diff --git a/.gitattributes b/.gitattributes index 804b6222e4a723f774c7af20deb21508e5da698a..f6203ba426d8bd09d6f70e6269106d323e76537a 100644 --- a/.gitattributes +++ b/.gitattributes @@ -7989,3 +7989,343 @@ parse/train/r1nmx5l0W/r1nmx5l0W_origin.pdf filter=lfs diff=lfs merge=lfs -text parse/train/r1nmx5l0W/r1nmx5l0W_span.pdf filter=lfs diff=lfs merge=lfs -text parse/train/BJg7x1HFvB/BJg7x1HFvB_origin.pdf filter=lfs diff=lfs merge=lfs -text parse/train/BJg7x1HFvB/BJg7x1HFvB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BJg7x1HFvB/BJg7x1HFvB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HyGBdo0qFm/HyGBdo0qFm_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HyGBdo0qFm/HyGBdo0qFm_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HyGBdo0qFm/HyGBdo0qFm_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1lNPxHKDH/H1lNPxHKDH_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1lNPxHKDH/H1lNPxHKDH_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1lNPxHKDH/H1lNPxHKDH_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1evfa4tPB/B1evfa4tPB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1evfa4tPB/B1evfa4tPB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1evfa4tPB/B1evfa4tPB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HylsgnCcFQ/HylsgnCcFQ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HylsgnCcFQ/HylsgnCcFQ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HylsgnCcFQ/HylsgnCcFQ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/EdXhmWvvQV/EdXhmWvvQV_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/EdXhmWvvQV/EdXhmWvvQV_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/EdXhmWvvQV/EdXhmWvvQV_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/S1eik6EtPB/S1eik6EtPB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/S1eik6EtPB/S1eik6EtPB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/S1eik6EtPB/S1eik6EtPB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/mSAKhLYLSsl/mSAKhLYLSsl_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/mSAKhLYLSsl/mSAKhLYLSsl_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HJeTo2VFwH/HJeTo2VFwH_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HJeTo2VFwH/HJeTo2VFwH_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HJeTo2VFwH/HJeTo2VFwH_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1lz-3Rct7/B1lz-3Rct7_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1lz-3Rct7/B1lz-3Rct7_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1lz-3Rct7/B1lz-3Rct7_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJeGJaEtPH/rJeGJaEtPH_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJeGJaEtPH/rJeGJaEtPH_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJeGJaEtPH/rJeGJaEtPH_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/hvdKKV2yt7T/hvdKKV2yt7T_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/hvdKKV2yt7T/hvdKKV2yt7T_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/hvdKKV2yt7T/hvdKKV2yt7T_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BJO-BuT1g/BJO-BuT1g_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BJO-BuT1g/BJO-BuT1g_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BJO-BuT1g/BJO-BuT1g_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HyjC5yWCW/HyjC5yWCW_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HyjC5yWCW/HyjC5yWCW_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HyjC5yWCW/HyjC5yWCW_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/66H4g_OHdnl/66H4g_OHdnl_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/66H4g_OHdnl/66H4g_OHdnl_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/66H4g_OHdnl/66H4g_OHdnl_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1-q5Pqxl/B1-q5Pqxl_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1-q5Pqxl/B1-q5Pqxl_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1-q5Pqxl/B1-q5Pqxl_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/UFGEelJkLu5/UFGEelJkLu5_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/UFGEelJkLu5/UFGEelJkLu5_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/UFGEelJkLu5/UFGEelJkLu5_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SyAbZb-0Z/SyAbZb-0Z_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SyAbZb-0Z/SyAbZb-0Z_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SyAbZb-0Z/SyAbZb-0Z_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/--GJkm7nt0/--GJkm7nt0_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/--GJkm7nt0/--GJkm7nt0_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/--GJkm7nt0/--GJkm7nt0_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/OPyWRrcjVQw/OPyWRrcjVQw_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/OPyWRrcjVQw/OPyWRrcjVQw_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/OPyWRrcjVQw/OPyWRrcjVQw_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SkfMWhAqYQ/SkfMWhAqYQ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SkfMWhAqYQ/SkfMWhAqYQ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SkfMWhAqYQ/SkfMWhAqYQ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/5jRVa89sZk/5jRVa89sZk_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/5jRVa89sZk/5jRVa89sZk_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/5jRVa89sZk/5jRVa89sZk_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/MudT1U2eIY/MudT1U2eIY_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/MudT1U2eIY/MudT1U2eIY_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/MudT1U2eIY/MudT1U2eIY_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/oDPxtrCMboN/oDPxtrCMboN_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/oDPxtrCMboN/oDPxtrCMboN_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/oDPxtrCMboN/oDPxtrCMboN_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJeXSo09FQ/SJeXSo09FQ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJeXSo09FQ/SJeXSo09FQ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJeXSo09FQ/SJeXSo09FQ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HyEeMu_xx/HyEeMu_xx_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HyEeMu_xx/HyEeMu_xx_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HyEeMu_xx/HyEeMu_xx_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJx0Q6EFPB/rJx0Q6EFPB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJx0Q6EFPB/rJx0Q6EFPB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJx0Q6EFPB/rJx0Q6EFPB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJxu5iR9KQ/SJxu5iR9KQ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJxu5iR9KQ/SJxu5iR9KQ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJxu5iR9KQ/SJxu5iR9KQ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BklhAj09K7/BklhAj09K7_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BklhAj09K7/BklhAj09K7_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BklhAj09K7/BklhAj09K7_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/X76iqnUbBjz/X76iqnUbBjz_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/X76iqnUbBjz/X76iqnUbBjz_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/X76iqnUbBjz/X76iqnUbBjz_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r1lq1hRqYQ/r1lq1hRqYQ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r1lq1hRqYQ/r1lq1hRqYQ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r1lq1hRqYQ/r1lq1hRqYQ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/uXc42E9ZPFs/uXc42E9ZPFs_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/uXc42E9ZPFs/uXc42E9ZPFs_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/uXc42E9ZPFs/uXc42E9ZPFs_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkZvSe-RZ/rkZvSe-RZ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkZvSe-RZ/rkZvSe-RZ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkZvSe-RZ/rkZvSe-RZ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HklSf3CqKm/HklSf3CqKm_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HklSf3CqKm/HklSf3CqKm_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HklSf3CqKm/HklSf3CqKm_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/v2tmeZVV9-c/v2tmeZVV9-c_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/v2tmeZVV9-c/v2tmeZVV9-c_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/v2tmeZVV9-c/v2tmeZVV9-c_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJg8TeSFDH/rJg8TeSFDH_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJg8TeSFDH/rJg8TeSFDH_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJg8TeSFDH/rJg8TeSFDH_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/h8flNv9x8v-/h8flNv9x8v-_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/h8flNv9x8v-/h8flNv9x8v-_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/h8flNv9x8v-/h8flNv9x8v-_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ByeWogStDS/ByeWogStDS_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ByeWogStDS/ByeWogStDS_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ByeWogStDS/ByeWogStDS_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rygoURNYvS/rygoURNYvS_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rygoURNYvS/rygoURNYvS_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rygoURNYvS/rygoURNYvS_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/5jaqt-Hsqir/5jaqt-Hsqir_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/5jaqt-Hsqir/5jaqt-Hsqir_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/5jaqt-Hsqir/5jaqt-Hsqir_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/7dpmlkBuJFC/7dpmlkBuJFC_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/7dpmlkBuJFC/7dpmlkBuJFC_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/7dpmlkBuJFC/7dpmlkBuJFC_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/XwATtbX3oCz/XwATtbX3oCz_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/XwATtbX3oCz/XwATtbX3oCz_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/XwATtbX3oCz/XwATtbX3oCz_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/kFJoj7zuDVi/kFJoj7zuDVi_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/kFJoj7zuDVi/kFJoj7zuDVi_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/kFJoj7zuDVi/kFJoj7zuDVi_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ujmgfuxSLrO/ujmgfuxSLrO_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ujmgfuxSLrO/ujmgfuxSLrO_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ujmgfuxSLrO/ujmgfuxSLrO_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/iaO86DUuKi/iaO86DUuKi_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/iaO86DUuKi/iaO86DUuKi_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/iaO86DUuKi/iaO86DUuKi_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/1Kof-nkmQB8/1Kof-nkmQB8_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/1Kof-nkmQB8/1Kof-nkmQB8_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/1Kof-nkmQB8/1Kof-nkmQB8_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkxfshNYwB/BkxfshNYwB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkxfshNYwB/BkxfshNYwB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkxfshNYwB/BkxfshNYwB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SySaJ0xCZ/SySaJ0xCZ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SySaJ0xCZ/SySaJ0xCZ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SySaJ0xCZ/SySaJ0xCZ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1l8BtlCb/B1l8BtlCb_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1l8BtlCb/B1l8BtlCb_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1l8BtlCb/B1l8BtlCb_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkcya1ZAW/rkcya1ZAW_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkcya1ZAW/rkcya1ZAW_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkcya1ZAW/rkcya1ZAW_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r1eowANFvr/r1eowANFvr_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r1eowANFvr/r1eowANFvr_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r1eowANFvr/r1eowANFvr_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Hk1iOLcle/Hk1iOLcle_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Hk1iOLcle/Hk1iOLcle_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Hk1iOLcle/Hk1iOLcle_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkrsAzWAb/BkrsAzWAb_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkrsAzWAb/BkrsAzWAb_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkrsAzWAb/BkrsAzWAb_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/h7-XixPCAL/h7-XixPCAL_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/h7-XixPCAL/h7-XixPCAL_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/h7-XixPCAL/h7-XixPCAL_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rklz9iAcKQ/rklz9iAcKQ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rklz9iAcKQ/rklz9iAcKQ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rklz9iAcKQ/rklz9iAcKQ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/P9TYG0j-wtG/P9TYG0j-wtG_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/P9TYG0j-wtG/P9TYG0j-wtG_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/P9TYG0j-wtG/P9TYG0j-wtG_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJxDDpEKvH/SJxDDpEKvH_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJxDDpEKvH/SJxDDpEKvH_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJxDDpEKvH/SJxDDpEKvH_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/zmbiQmdtg9/zmbiQmdtg9_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/zmbiQmdtg9/zmbiQmdtg9_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/zmbiQmdtg9/zmbiQmdtg9_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SksY3deAW/SksY3deAW_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SksY3deAW/SksY3deAW_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SksY3deAW/SksY3deAW_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HygrdpVKvr/HygrdpVKvr_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HygrdpVKvr/HygrdpVKvr_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HygrdpVKvr/HygrdpVKvr_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Byf5-30qFX/Byf5-30qFX_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Byf5-30qFX/Byf5-30qFX_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Byf5-30qFX/Byf5-30qFX_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ARFshOO1Iu/ARFshOO1Iu_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ARFshOO1Iu/ARFshOO1Iu_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/ARFshOO1Iu/ARFshOO1Iu_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/QmxFsofRvW9/QmxFsofRvW9_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/QmxFsofRvW9/QmxFsofRvW9_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/QmxFsofRvW9/QmxFsofRvW9_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkgZaT4tDr/rkgZaT4tDr_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkgZaT4tDr/rkgZaT4tDr_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkgZaT4tDr/rkgZaT4tDr_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/KLH36ELmwIB/KLH36ELmwIB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/KLH36ELmwIB/KLH36ELmwIB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/KLH36ELmwIB/KLH36ELmwIB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJed6j0cKX/rJed6j0cKX_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJed6j0cKX/rJed6j0cKX_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJed6j0cKX/rJed6j0cKX_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJJinbWRZ/SJJinbWRZ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJJinbWRZ/SJJinbWRZ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJJinbWRZ/SJJinbWRZ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJlbGJrtDB/SJlbGJrtDB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJlbGJrtDB/SJlbGJrtDB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SJlbGJrtDB/SJlbGJrtDB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BygkQeHKwB/BygkQeHKwB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BygkQeHKwB/BygkQeHKwB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BygkQeHKwB/BygkQeHKwB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/butEPeLARP_/butEPeLARP__span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/butEPeLARP_/butEPeLARP__layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/butEPeLARP_/butEPeLARP__origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Byl3K2VtwB/Byl3K2VtwB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Byl3K2VtwB/Byl3K2VtwB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Byl3K2VtwB/Byl3K2VtwB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/DMxOBm06HUx/DMxOBm06HUx_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/DMxOBm06HUx/DMxOBm06HUx_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/DMxOBm06HUx/DMxOBm06HUx_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/c_E8kFWfhp0/c_E8kFWfhp0_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/c_E8kFWfhp0/c_E8kFWfhp0_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/c_E8kFWfhp0/c_E8kFWfhp0_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SyrGJYlRZ/SyrGJYlRZ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SyrGJYlRZ/SyrGJYlRZ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/SyrGJYlRZ/SyrGJYlRZ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/QIRlze3I6hX/QIRlze3I6hX_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/QIRlze3I6hX/QIRlze3I6hX_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/QIRlze3I6hX/QIRlze3I6hX_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1MOqeHYvB/H1MOqeHYvB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1MOqeHYvB/H1MOqeHYvB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1MOqeHYvB/H1MOqeHYvB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BywyFQlAW/BywyFQlAW_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BywyFQlAW/BywyFQlAW_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BywyFQlAW/BywyFQlAW_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1zxjsCqKQ/H1zxjsCqKQ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1zxjsCqKQ/H1zxjsCqKQ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1zxjsCqKQ/H1zxjsCqKQ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r10FA8Kxg/r10FA8Kxg_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r10FA8Kxg/r10FA8Kxg_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r10FA8Kxg/r10FA8Kxg_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Iz3zU3M316D/Iz3zU3M316D_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Iz3zU3M316D/Iz3zU3M316D_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Iz3zU3M316D/Iz3zU3M316D_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1VyHY9gg/H1VyHY9gg_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1VyHY9gg/H1VyHY9gg_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1VyHY9gg/H1VyHY9gg_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Syr8Qc1CW/Syr8Qc1CW_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Syr8Qc1CW/Syr8Qc1CW_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Syr8Qc1CW/Syr8Qc1CW_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkgRe1SFDS/BkgRe1SFDS_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkgRe1SFDS/BkgRe1SFDS_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkgRe1SFDS/BkgRe1SFDS_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/wHoIjrT6MMb/wHoIjrT6MMb_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/wHoIjrT6MMb/wHoIjrT6MMb_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/wHoIjrT6MMb/wHoIjrT6MMb_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1xPR3NtPB/H1xPR3NtPB_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1xPR3NtPB/H1xPR3NtPB_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1xPR3NtPB/H1xPR3NtPB_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HJ0NvFzxl/HJ0NvFzxl_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HJ0NvFzxl/HJ0NvFzxl_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HJ0NvFzxl/HJ0NvFzxl_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Sklf1yrYDr/Sklf1yrYDr_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Sklf1yrYDr/Sklf1yrYDr_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Sklf1yrYDr/Sklf1yrYDr_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1lZJpVFvr/H1lZJpVFvr_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1lZJpVFvr/H1lZJpVFvr_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1lZJpVFvr/H1lZJpVFvr_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/T4gXBOXoIUr/T4gXBOXoIUr_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/T4gXBOXoIUr/T4gXBOXoIUr_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/T4gXBOXoIUr/T4gXBOXoIUr_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1Gq5Q9el/H1Gq5Q9el_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1Gq5Q9el/H1Gq5Q9el_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1Gq5Q9el/H1Gq5Q9el_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/pDgN3l3EAF/pDgN3l3EAF_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/pDgN3l3EAF/pDgN3l3EAF_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/pDgN3l3EAF/pDgN3l3EAF_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BklHpjCqKm/BklHpjCqKm_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BklHpjCqKm/BklHpjCqKm_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BklHpjCqKm/BklHpjCqKm_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/wtLW-Amuds/wtLW-Amuds_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/wtLW-Amuds/wtLW-Amuds_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/wtLW-Amuds/wtLW-Amuds_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkQqq0gRb/BkQqq0gRb_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkQqq0gRb/BkQqq0gRb_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BkQqq0gRb/BkQqq0gRb_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/mfQxdSMWOF/mfQxdSMWOF_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/mfQxdSMWOF/mfQxdSMWOF_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/mfQxdSMWOF/mfQxdSMWOF_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkgO66VKDS/rkgO66VKDS_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkgO66VKDS/rkgO66VKDS_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkgO66VKDS/rkgO66VKDS_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BylSPv9gx/BylSPv9gx_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BylSPv9gx/BylSPv9gx_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BylSPv9gx/BylSPv9gx_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HJCXZQbAZ/HJCXZQbAZ_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HJCXZQbAZ/HJCXZQbAZ_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HJCXZQbAZ/HJCXZQbAZ_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r1Oen--RW/r1Oen--RW_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r1Oen--RW/r1Oen--RW_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/r1Oen--RW/r1Oen--RW_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/JCodE7xOcc5/JCodE7xOcc5_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/JCodE7xOcc5/JCodE7xOcc5_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/JCodE7xOcc5/JCodE7xOcc5_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkaSvlnoG/rkaSvlnoG_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkaSvlnoG/rkaSvlnoG_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rkaSvlnoG/rkaSvlnoG_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/F3s69XzWOia/F3s69XzWOia_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/F3s69XzWOia/F3s69XzWOia_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/F3s69XzWOia/F3s69XzWOia_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Hyg_X2C5FX/Hyg_X2C5FX_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Hyg_X2C5FX/Hyg_X2C5FX_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/Hyg_X2C5FX/Hyg_X2C5FX_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJvJXZb0W/rJvJXZb0W_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJvJXZb0W/rJvJXZb0W_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJvJXZb0W/rJvJXZb0W_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HygnDhEtvr/HygnDhEtvr_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HygnDhEtvr/HygnDhEtvr_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/HygnDhEtvr/HygnDhEtvr_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/bJxgv5C3sYc/bJxgv5C3sYc_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/bJxgv5C3sYc/bJxgv5C3sYc_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/bJxgv5C3sYc/bJxgv5C3sYc_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJeqeCEtvH/rJeqeCEtvH_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJeqeCEtvH/rJeqeCEtvH_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJeqeCEtvH/rJeqeCEtvH_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1tSsb-AW/H1tSsb-AW_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1tSsb-AW/H1tSsb-AW_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/H1tSsb-AW/H1tSsb-AW_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJe2syrtvS/rJe2syrtvS_layout.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJe2syrtvS/rJe2syrtvS_origin.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/rJe2syrtvS/rJe2syrtvS_span.pdf filter=lfs diff=lfs merge=lfs -text +parse/train/B1lgUkBFwr/B1lgUkBFwr_span.pdf filter=lfs diff=lfs merge=lfs -text diff --git a/parse/train/--GJkm7nt0/--GJkm7nt0_layout.pdf b/parse/train/--GJkm7nt0/--GJkm7nt0_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..da2aeeb566725f774ecf845c4d6cc6f15d4f5f54 --- /dev/null +++ b/parse/train/--GJkm7nt0/--GJkm7nt0_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e31208d662b5c32da327e7f74a429944a05c98a7b762030c3b60e39c466ea19a +size 10925447 diff --git a/parse/train/--GJkm7nt0/--GJkm7nt0_origin.pdf b/parse/train/--GJkm7nt0/--GJkm7nt0_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..bb19c692c583c1eceb9cc504c4c196d37611772a --- /dev/null +++ b/parse/train/--GJkm7nt0/--GJkm7nt0_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:30e491acc0b823a501891dac2e307aff181fe8efe28ac5df74164f83d60e30d4 +size 10595443 diff --git a/parse/train/--GJkm7nt0/--GJkm7nt0_span.pdf b/parse/train/--GJkm7nt0/--GJkm7nt0_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..dae72532749f3013919616d4746b941c4f84f8f3 --- /dev/null +++ b/parse/train/--GJkm7nt0/--GJkm7nt0_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1b597ed791fbeb4aaa01c918c9af87abdf73cebdb21f7c461e3458abf858ab86 +size 10935170 diff --git a/parse/train/1Kof-nkmQB8/1Kof-nkmQB8_layout.pdf b/parse/train/1Kof-nkmQB8/1Kof-nkmQB8_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ff98c73a11ce2845f8f2b1f11c68758a2ba3fbef --- /dev/null +++ b/parse/train/1Kof-nkmQB8/1Kof-nkmQB8_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a4205a4c3631637d3b829dcb2816bf8c2fddece65ecb84ad7161ce8262a040d4 +size 1339166 diff --git a/parse/train/1Kof-nkmQB8/1Kof-nkmQB8_origin.pdf b/parse/train/1Kof-nkmQB8/1Kof-nkmQB8_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..273548ea3fe881d6d9df9c55763b4f48423eae69 --- /dev/null +++ b/parse/train/1Kof-nkmQB8/1Kof-nkmQB8_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:335bbb60af0746eb2263b292383707ebdb5dc8aaab75b00bdbd7f6f844c48749 +size 993419 diff --git a/parse/train/1Kof-nkmQB8/1Kof-nkmQB8_span.pdf b/parse/train/1Kof-nkmQB8/1Kof-nkmQB8_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..77c5280da10433b16de879b0e23869e1299d85ef --- /dev/null +++ b/parse/train/1Kof-nkmQB8/1Kof-nkmQB8_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:057d9de5d6b7211f5a7337cde901ffa8ab602b3e4ece25228be485fa51101e2c +size 1347971 diff --git a/parse/train/30EvkP2aQLD/30EvkP2aQLD.md b/parse/train/30EvkP2aQLD/30EvkP2aQLD.md new file mode 100644 index 0000000000000000000000000000000000000000..ac69917edd6e67b3e1e18c5d77d34c142627d187 --- /dev/null +++ b/parse/train/30EvkP2aQLD/30EvkP2aQLD.md @@ -0,0 +1,611 @@ +# WHAT ARE THE STATISTICAL LIMITS OF OFFLINE RL WITH LINEAR FUNCTION APPROXIMATION? + +Ruosong Wang Carnegie Mellon University ruosongw@andrew.cmu.edu + +Dean P. Foster +University of Pennsylvania and Amazon +dean@foster.net +Sham M. Kakade +University of Washington, Seattle and Microsoft Research +sham@cs.washington.edu + +# ABSTRACT + +Offline reinforcement learning seeks to utilize offline (observational) data to guide the learning of (causal) sequential decision making strategies. The hope is that offline reinforcement learning coupled with function approximation methods (to deal with the curse of dimensionality) can provide a means to help alleviate the excessive sample complexity burden in modern sequential decision making problems. However, the extent to which this broader approach can be effective is not well understood, where the literature largely consists of sufficient conditions. + +This work focuses on the basic question of what are necessary representational and distributional conditions that permit provable sample-efficient offline reinforcement learning. Perhaps surprisingly, our main result shows that even if: i) we have realizability in that the true value function of every policy is linear in a given set of features and 2) our off-policy data has good coverage over all features (under a strong spectral condition), any algorithm still (information-theoretically) requires a number of offline samples that is exponential in the problem horizon to nontrivially estimate the value of any given policy. Our results highlight that sampleefficient offline policy evaluation is not possible unless significantly stronger conditions hold; such conditions include either having low distribution shift (where the offline data distribution is close to the distribution of the policy to be evaluated) or significantly stronger representational conditions (beyond realizability). + +# 1 INTRODUCTION + +Offline methods (also known as off-policy methods or batch methods) are a promising methodology to alleviate the sample complexity burden in challenging reinforcement learning (RL) settings, particularly those where sample efficiency is paramount (Mandel et al., 2014; Gottesman et al., 2018; Wang et al., 2018; Yu et al., 2019). Off-policy methods are often applied together with function approximation schemes; such methods take sample transition data and reward values as inputs, and approximate the value of a target policy or the value function of the optimal policy. Indeed, many practical deep RL algorithms find their prototypes in the literature of offline RL. For example, when running on off-policy data (sometimes termed as “experience replay”), deep $Q$ -networks (DQN) (Mnih et al., 2015) can be viewed as an analog of Fitted $Q$ -Iteration (Gordon, 1999) with neural networks being the function approximators. More recently, there are an increasing number of both model-free (Laroche et al., 2019; Fujimoto et al., 2019; Jaques et al., 2020; Kumar et al., 2019; Agarwal et al., 2020) and model-based (Ross & Bagnell, 2012; Kidambi et al., 2020) offline RL methods, with steady improvements in performance (Fujimoto et al., 2019; Kumar et al., 2019; Wu et al., 2020; Kidambi et al., 2020). + +However, despite the importance of these methods, the extent to which data reuse is possible, especially when off-policy methods are combined with function approximation, is not well understood. For example, deep $Q$ -network requires millions of samples to solve certain Atari games (Mnih et al., 2015). Also important is that in some safety-critical settings, we seek guarantees when offlinetrained policies can be effective (Thomas, 2014; Thomas et al., 2019). A basic question here is that if there are fundamental statistical limits on such methods, where sample-efficient offline RL is simply not possible without further restrictions on the problem. + +In the context of supervised learning, it is well-known that empirical risk minimization is sampleefficient if the hypothesis class has bounded complexity. For example, suppose the agent is given a $d$ -dimensional feature extractor, and the ground truth labeling function is a (realizable) linear function with respect to the feature mapping. Here, it is well-known that a polynomial number of samples in $d$ suffice for a given target accuracy. Furthermore, in this realizable case, provided the training data has a good feature coverage, then we will have good accuracy against any test distribution.1 + +In the more challenging offline RL setting, it is unclear if sample-efficient methods are possible, even under analogous assumptions. This is our motivation to consider the following question: + +# What are the statistical limits for offline RL with linear function approximation? + +Here, one may hope that value estimation for a given policy is possible in the offline RL setting under the analogous set of assumptions that enable sample-efficient supervised learning, i.e., 1) (realizability) the features can perfectly represent the value functions and 2) (good coverage) the feature covariance matrix of our off-policy data has lower bounded eigenvalues. + +The extant body of provable methods on offline RL either make representational assumptions that are far stronger than realizability or assume distribution shift conditions that are far stronger than having coverage with regards to the spectrum of the feature covariance matrix of the data distribution. For example, Szepesvari & Munos (2005) analyze offline RL methods by assuming a representational ´ condition where the features satisfy (approximate) closedness under Bellman updates, which is a far stronger representation condition than realizability. Recently, Xie & Jiang (2020a) propose a offline RL algorithm that only requires realizability as the representation condition. However, the algorithm in (Xie & Jiang, 2020a) requires a more stringent data distribution condition. Whether it is possible to design a sample-efficient offline RL method under the realizability assumption and a reasonable data coverage assumption — an open problem in (Chen & Jiang, 2019) — is the focus of this work. + +Our Contributions. Perhaps surprisingly, our main result shows that, under only the above two assumptions, it is information-theoretically not possible to design a sample-efficient algorithm to non-trivially estimate the value of a given policy. The following theorem is an informal version of the result in Section 4. + +Theorem 1.1 (Informal). In the offline RL setting, suppose the data distributions have (polynomially) lower bounded eigenvalues, and the $Q$ -functions of every policy are linear with respect to a given feature mapping. Any algorithm requires an exponential number of samples in the horizon $H$ to output a non-trivially accurate estimate of the value of any given policy $\pi$ , with constant probability. + +This hardness result states that even if the $Q$ -functions of all polices are linear with respect to the given feature mapping, we still require an exponential number of samples to evaluate any given policy. Note that this representation condition is significantly stronger than assuming realizability with regards to only a single target policy; it assumes realizability for all policies. Regardless, even under this stronger representation condition, it is hard to evaluate any policy, as specified in our hardness result. + +This result also formalizes a key issue in offline reinforcement learning with function approximation: geometric error amplification. To better illustrate the issue, in Section 5, we analyze the classical Least-Squares Policy Evaluation (LSPE) algorithm under the realizability assumption, which demonstrates how the error propagates as the algorithm proceeds. Here, our analysis shows that, if we only rely on the realizability assumption, then a far more stringent condition is required for sample-efficient offline policy evaluation: the off-policy data distribution must be quite close to the distribution induced by the policy to be evaluated. + +Our results highlight that sample-efficient offline RL is simply not possible unless either the distribution shift condition is sufficiently mild or we have stronger representation conditions that go well beyond realizability. See Section 5 for more details. + +Furthermore, our hardness result implies an exponential separation on the sample complexity between offline RL and supervised learning, since supervised learning (which is equivalent to offline RL with $H = 1$ ) is possible with polynomial number of samples under the same set of assumptions. + +A few additional points are worth emphasizing with regards to our lower bound construction: + +• Our results imply that Least-Squares Policy Evaluation (LSPE, i.e., using Bellman backups with linear regression) will fail. Interestingly, while LSPE will provide an unbiased estimator, our results imply that it will have exponential variance in the problem horizon. +Our construction is simple and does not rely on having a large state or action space: the size of the state space is only $O ( d \cdot H )$ where $d$ is the feature dimension and $H$ is the planning horizon, and the size of the action space is only is 2. This stands in contrast to other RL lower bounds, which typically require state spaces that are exponential in the problem horizon (e.g. see (Du et al., 2020)). +• We provide two hard instances, one with a sparse reward (and stochastic transitions) and another with deterministic dynamics (and stochastic rewards). These two hard instances jointly imply that both the estimation error on reward values and the estimation error on the transition probabilities could be geometrically amplified in offline RL. Of possibly broader interest is that our hard instances are, to our knowledge, the first concrete examples showing that geometric error amplification is real in RL problems (even with realizability). While this is a known concern in the analysis of RL algorithms, there have been no concrete examples exhibiting such behavior under only a realizability assumption. + +# 2 RELATED WORK + +We now survey prior work on offline RL, largely focusing on theoretical results. We also discuss results on the error amplification issue in RL. Concurrent to this work, Xie & Jiang (2020a) propose a offline RL algorithm under the realizability assumption, which requires stronger distribution shift conditions. We will discuss this work shortly. + +Existing Algorithms and Analysis. Offline RL with value function approximation is closely related to Approximate Dynamic Programming (Bertsekas & Tsitsiklis, 1995). Existing work (Munos, 2003; Szepesvari & Munos, 2005; Antos et al., 2008; Munos & Szepesv ´ ari, 2008; Tosatto et al., ´ 2017; Xie & Jiang, 2020b; Duan & Wang, 2020) that analyze the sample complexity of approximate dynamic programming-based approaches usually make the following two categories of assumptions: (i) representation conditions that assume the function class approximates the value functions well and (ii) distribution shift conditions that assume the given data distribution has sufficient coverage over the state-action space. As mentioned in the introduction, the desired representation condition would be realizability, which only assumes the value function of the policy to be evaluated lies in the function class (for the case of offline policy evaluation) or the optimal value function lies in the function class (for the case of finding near-optimal policies), and existing works usually make stronger assumptions. For example, Szepesvari & Munos (2005); Duan & Wang (2020) assume (ap- ´ proximate) closedness under Bellman updates, which is much stronger than realizability. Whether it is possible to design a sample-efficient offline RL method under the realizability assumption and reasonable data coverage assumption, is left as an open problem in (Chen & Jiang, 2019). + +To measure the coverage over the state-action space of the given data distribution, existing works assume the concentrability coefficient (introduced by Munos (2003)) to be bounded. The concentrability coefficient, informally speaking, is the largest possible ratio between the probability for a state-action pair $( s , a )$ to be visited by a policy, and the probability that $( s , a )$ appears on the data distribution. Since we work with linear function approximation in this work, we measure the distribution shift in terms of the spectrum of the feature covariance matrices (see Assumption 2), which is a well-known sufficient condition in the context of supervised learning and is much more natural for the case of linear function approximation. + +Concurrent to this work, Xie & Jiang (2020a) propose an algorithm that works under the realizability assumption instead of other stronger representation conditions used in prior work. However, the algorithm in (Xie & Jiang, 2020a) requires a much stronger data distribution condition which assumes a stringent version of concentrability coefficient introduced by (Munos, 2003) to be bounded. In contrast, in this work we measure the distribution shift in terms of the spectrum of the feature covariance matrix of the data distribution, which is more natural than the concentrability coefficient for the case of linear function approximation. + +Recently, there has been great interest in approaching offline policy evaluation (Precup, 2000) via importance sampling. For recent work on this topic, see (Dud´ık et al., 2011; Mandel et al., 2014; Thomas et al., 2015; Li et al., 2015; Jiang & Li, 2016; Thomas & Brunskill, 2016; Guo et al., 2017; Wang et al., 2017; Liu et al., 2018; Farajtabar et al., 2018; Xie et al., 2019; Kallus & Uehara, 2019; Liu et al., 2019; Uehara & Jiang, 2019; Kallus & Uehara, 2020; Jiang & Huang, 2020; Feng et al., 2020). Offline policy evaluation with importance sampling incurs exponential variance in the planning horizon when the behavior policy is significantly different from the policy to be evaluated. Bypassing such exponential dependency requires non-trivial function approximation assumptions (Jiang & Huang, 2020; Feng et al., 2020; Liu et al., 2018). Finally, Kidambi et al. (2020) provide a model-based offline RL algorithm, with a theoretical analysis based on hitting times. + +Hardness Results. Algorithm-specific hardness results have been known for a long time in the literature of Approximate Dynamic Programming. See Chapter 4 in (Van Roy, 1994) and also (Gordon, 1995; Tsitsiklis & Van Roy, 1996). These works demonstrate that certain approximate dynamic programming-based methods will diverge on hard cases. However, such hardness results only hold for a restricted class of algorithms, and to demonstrate the fundamental difficulty of offline RL, it is more desirable to obtain information-theoretic lower bounds as initiated by Chen & Jiang (2019). + +Existing (information-theoretic) exponential lower bounds (Krishnamurthy et al., 2016; Sun et al., 2017; Chen & Jiang, 2019) usually construct unstructured MDPs with an exponentially large state space. Du et al. (2020) prove an exponential lower bound under the assumption that the optimal $Q$ - function is approximately linear. The condition that the optimal $Q$ -function is only approximately linear is crucial for the hardness result in Du et al. (2020). The techniques in (Du et al., 2020) are later generalized to other settings (Kumar et al., 2020; Wang et al., 2020; Mou et al., 2020). + +Error Amplification In RL. Error amplification induced by distribution shift and long planning horizon is a known issue in the theoretical analysis of RL algorithms. See (Gordon, 1995; 1996; Munos & Moore, 1999; Ormoneit & Sen, 2002; Kakade, 2003; Zanette et al., 2019) for papers on this topic and additional assumptions that mitigate this issue. Error amplification in offline RL is also observed in empirical works (see e.g. (Fujimoto et al., 2019)). In this work, we provide the first information-theoretic lower bound showing that geometric error amplification is real in offline RL. + +# 3 THE OFFLINE POLICY EVALUATION PROBLEM + +Throughout this paper, for a given integer $H$ , we use $[ H ]$ to denote the set $\{ 1 , 2 , \ldots , H \}$ + +Episodic Reinforcement Learning. Let $M = ( \mathcal { S } , \mathcal { A } , P , R , H )$ be a Markov Decision Process (MDP) where $s$ is the state space, $\mathcal { A }$ is the action space, $P : \mathcal { S } \times \mathcal { A } \Delta ( \mathcal { S } )$ is the transition operator which takes a state-action pair and returns a distribution over states, $\Dot { R : } \Dot { S } \times \mathcal { A } \Delta ( \mathbb { R } )$ is the reward distribution, $H \in \mathbb { Z } _ { + }$ is the planning horizon. For simplicity, we assume a fixed initial state $s _ { 1 } \in { \mathcal { S } }$ . A (stochastic) policy $\pi : S \Delta ( { \mathcal { A } } )$ chooses an action $a$ randomly based on the current state $s$ . The policy $\pi$ induces a (random) trajectory $s _ { 1 } , a _ { 1 } , r _ { 1 } , s _ { 2 } , a _ { 2 } , r _ { 2 } , \ldots , s _ { H } , a _ { H } , r _ { H }$ , where $a _ { 1 } \sim \pi _ { 1 } ( s _ { 1 } )$ , $r _ { 1 } \sim R ( s _ { 1 } , a _ { 1 } )$ , $s _ { 2 } \sim P ( s _ { 1 } , a _ { 1 } )$ , $a _ { 2 } \sim \pi _ { 2 } ( s _ { 2 } )$ , etc. To streamline our analysis, for each $h \in [ H ]$ , we use $S _ { h } \subseteq S$ to denote the set of states at level $h$ , and we assume $S _ { h }$ do not intersect with each other. We assume, almost surely, that $r _ { h } \in [ - 1 , 1 ]$ for all $h \in [ H ]$ . + +Value Functions. Given a policy $\begin{array} { r } { \mathbb { E } \left[ \sum _ { h ^ { \prime } = h } ^ { H } r _ { h ^ { \prime } } \mid s _ { h } = s , a _ { h } = a , \pi \right] } \end{array}$ an d , $\textit { h } \in \ [ H ]$ $\begin{array} { r } { V _ { h } ^ { \pi } ( s ) = \mathbb { E } \left[ \sum _ { h ^ { \prime } = h } ^ { H } r _ { h ^ { \prime } } \mid s _ { h } = s , \pi \right] } \end{array}$ and $( s , a ) \in S _ { h } \times \mathcal { A }$ , define h. For a policy $Q _ { h } ^ { \pi } ( s , a ) \ =$ $\pi$ , we define $V ^ { \pi } = V _ { 1 } ^ { \pi } ( s _ { 1 } )$ to be the value of $\pi$ from the fixed initial state $s _ { 1 }$ . + +Linear Function Approximation. When applying linear function approximation schemes, it is commonly assumed that the agent is given a feature extractor $\phi : \mathcal { S } \times \bar { \mathcal { A } } \mathbb { R } ^ { d }$ which can either be hand-crafted or a pre-trained neural network that transforms a state-action pair to a $d$ -dimensional embedding, and the $Q$ -functions can be predicted by linear functions of the features. In this paper, we are interested in the following realizability assumption. + +Assumption 1 (Realizable Linear Function Approximation). For every policy $\pi : S \Delta ( { \mathcal { A } } )$ , there exists $\theta _ { 1 } ^ { \pi } , \ldots \theta _ { H } ^ { \pi } \in \mathbb { R } ^ { d }$ such that for all $( s , a ) \in S \times A$ and $h \in [ H ] , Q _ { h } ^ { \pi } ( s , a ) = \left( \theta _ { h } ^ { \pi } \right) ^ { \top } \phi ( s , a ) .$ . + +Note that our assumption is much stronger than assuming realizability with regards to a single policy $\pi$ (say the policy that we wish to evaluate); our assumption imposes realizability for all policies. + +Offline Reinforcement Learning. This paper is concerned with the offline RL setting. In this setting, thtributions $\{ \mu _ { h } \} _ { h = 1 } ^ { H }$ oes not have dirwhere for each $h \in [ H ]$ , $\mu _ { h } \in \Delta ( S _ { h } \times \mathcal { A } )$ stead is given access to data d. The inputs of the agent are $H$ datasets $\{ D _ { h } \} _ { h = 1 } ^ { H }$ 1 , and for each $h \in [ H ]$ , $D _ { h }$ consists i.i.d. samples of the form $( s , a , r , s ^ { \prime } ) \in$ $S _ { h } \times \mathcal { A } \times \mathbb { R } \times \mathcal { S } _ { h + 1 }$ tuples, where $( s , \dot { a } ) \stackrel { . } { \sim } \mu _ { h } , r \sim r ( s , a ) , s ^ { \prime } \sim \bar { P ( } s , a ) $ . + +In this paper, we focus on the offline policy evaluation problem with linear function approximation: given a policy accurate estim $\pi : S \Delta ( { \mathcal { A } } )$ f $\pi$ d a fe(i.e., $V ^ { \pi }$ re extractor ) approxima $\phi : \mathcal { S } \times \mathcal { A } \mathbb { R } ^ { d }$ , the goal is toected datasets $\{ D _ { h } \} _ { h = 1 } ^ { H }$ with as few samples as possible. + +Notation. For a vector $x \in \mathbb { R } ^ { d }$ , we use $\lVert x \rVert _ { 2 }$ to denote its $\ell _ { 2 }$ norm. For a positive semidefinite matrix $A$ , we use $\| A \| _ { 2 }$ to denote its operator norm, and $\sigma _ { \mathrm { m i n } } ( A )$ to denote its smallest eigenvalue. For two positive semidefinite matrices $A$ and $B$ , we write $A \succeq B$ to denote the Lowner partial ¨ ordering of matrices, i.e, $A \succeq B$ if and only if $A - B$ is positive semidefinite. For a policy $\pi : { \cal { S } } $ $\Delta \left( \mathcal { A } \right)$ , we use $\mu _ { h } ^ { \pi }$ to denote the marginal distribution of $s _ { h }$ under $\pi$ , i.e., $\mu _ { h } ^ { \pi } ( s ) = \operatorname* { P r } [ s _ { h } = s \mid \pi ]$ . For a vector $x \in \mathbb { R } ^ { d }$ and a positive semidefinite matrix $A \in \mathbb { R } ^ { d \times d }$ , we use $\| x \| _ { A }$ to denote $\sqrt { x ^ { \top } A x }$ . + +# 4 THE LOWER BOUND: REALIZABILITY AND COVERAGE ARE INSUFFICIENT + +We now present our main hardness result for offline policy evaluation with linear function approximation. It should be evident that without feature coverage in our dataset, realizability alone is clearly not sufficient for sample-efficient estimation. Here, we will make the strongest possible assumption, with regards to the conditioning of the feature covariance matrix. + +Assumption 2 (Feature Coverage). For all $( s , a ) \in S \times A ,$ , assume our feature map is bounded such that $\| \phi ( s , a ) \| _ { 2 } \leq 1$ . Furthermore, suppose for each $h \in [ H ]$ , the data distributions $\mu _ { h }$ satisfy the following minimum eigenvalue condition: $\sigma _ { \mathrm { m i n } } \left( \mathbb { E } _ { ( s , a ) \sim \mu _ { h } } [ \dot { \phi } ( \dot { s } , a ) \phi ( s , a ) ^ { \top } ] \right) = 1 / d .$ . 2 + +Clearly, for the case where $H = 1$ , the realizability assumption (Assumption 1), and feature coverage assumption (Assumption 2) imply that the ordinary least squares estimator will accurately estimate $\theta _ { 1 }$ .3 Our main result now shows that these assumptions are not sufficient for offline policy evaluation for long horizon problems. + +Theorem 4.1. Suppose Assumption 2 holds. Fix an algorithm that takes as input both a policy and $a$ feature mapping. There exists a (deterministic) MDP satisfying Assumption $^ { l }$ , such that for any policy $\pi : S \Delta ( { \mathcal { A } } )$ , the algorithm requires $\Omega ( ( d / 2 ) ^ { H } )$ samples to output the value of $\pi$ up to constant additive approximation error with probability at least 0.9. + +Although we focus on offline policy evaluation in this work, our hardness result also holds for finding near-optimal policies under Assumption 1 in the offline RL setting. Below we give a simple reduction. At the initial state, if the agent chooses action $a _ { 1 }$ , then the agent receives a fixed reward value (say 0.5) and terminates. If the agent chooses action $a _ { 2 }$ , then the agent transits to our hard instance. In order to find a policy with suboptimality at most 0.5, the agent must evaluate the value of the optimal policy in our hard instance up to an error of 0.5, and hence the hardness result holds. + +Remark 1 (The sparse reward case). As stated, the theorem uses a deterministic MDP (with stochastic rewards). See Appendix C for another hard case where the transition is stochastic and the reward is deterministic and sparse (only occurring at two states at $h = H$ ). + +Remark 2 (Least-Squares Policy Evaluation (LSPE) has exponential variance). For offline policy evaluation with linear function approximation, the most na¨ıve algorithm here would be LSPE, i.e., using ordinary least squares (OLS) to estimate $\theta ^ { \pi }$ , starting at level $h = H$ and then proceeding backwards to level $h = 1$ , using the plug-in estimator from the previous level. Here, LSPE will provide an unbiased estimate (provided the feature covariance matrices are full rank, which will occur with high probability). As a direct corollary, the above theorem implies that LSPE has exponential variance in $H$ . See Section 5 for a more detailed discussion on LSPE. More generally, our theorem implies that there is no estimator that can avoid such exponential dependence in the offline setting. + +Remark 3 (Least-Squares Value Iteration (LSVI) versus Least-Squares Policy Iteration (LSPI)). In the offline setting, under Assumptions 1 and 2, in order to find a near-optimal policy, the most na¨ıve algorithm would be LSVI, i.e., using ordinary least squares (OLS) to estimate $\theta ^ { * }$ , starting at level $h = H$ and then proceeding backwards to level $h = 1$ , using the plug-in estimator from the previous level and the bellman operator. The above theorem implies that LSVI will require an exponential number of samples to find a near-optimal policy. On the other hand, if the regression targets are collected by using rollouts (i.e. on-policy sampling) as in LSPI (Lagoudakis & Parr, 2003), then a polynomial number of samples suffice. See Section D in (Du et al., 2020) for an analysis. Thus, Theorem 4.1 implies an exponential separation on the sample complexity between LSVI and LSPI. Of course, LSPI requires adaptive data samples and thus does not work in the offline setting. + +One may wonder if Theorem 4.1 still holds when the data distributions $\{ \mu _ { h } \} _ { h = 1 } ^ { H }$ are induced by a policy. In Appendix C, we prove another exponential sample complexity lower bound under the additional assumption that the data distributions are induced by a fixed policy $\pi$ . However, under such an assumption, it is impossible to prove a hardness result as strong as Theorem 4.1 (which shows that evaluating any policy is hard), since one can at least evaluate the policy $\pi$ that induces the data distributions. Nevertheless, we are able to prove the hardness of offline policy evaluation, under a weaker version of Assumption 1. See Appendix $\textrm { C }$ for more details. + +In the remaining part of this section, we give the hard instance construction and the proof of Theorem 4.1. We use $d$ the denote the feature dimension, and we assume $d$ is even for simplicity. We use $\hat { d }$ to denote $d / 2$ for convenience. We also provide an illustration of the construction in Figure 1. + +ac, Action Spcontains d Transtates or. and action space . For each $\mathcal { A } = \{ a _ { 1 } , a _ { 2 } \}$ . For each, for each $h \in [ H ]$ $S _ { h }$ $\hat { d } + 1$ $s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \ldots , s _ { h } ^ { \hat { d } }$ $s _ { h } ^ { \hat { d } + 1 }$ $h \in [ H - 1 ]$ $c \in \{ 1 , 2 , \ldots , \hat { d } + 1 \}$ , we have $P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { \hat { d } + 1 }$ and $P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { c }$ . + +Reward Distributions. Let $0 \leq r _ { 0 } \leq \hat { d } ^ { - H / 2 }$ be a parameter to be determined. For each $( h , c ) \in$ $[ H - 1 ] \times [ \hat { d } ]$ and $a \in { \mathcal { A } }$ , we set $R ( s _ { h } ^ { c } , a ) = 0$ and $R ( s _ { h } ^ { \hat { d } + 1 } , a ) = r _ { 0 } \cdot ( \hat { d } ^ { 1 / 2 } - 1 ) \cdot \hat { d } ^ { ( H - h ) / 2 }$ . For the last level, for each $c \in [ \hat { d } ]$ and $a \in { \mathcal { A } }$ , we set $R ( s _ { H } ^ { c } , a ) = \left\{ \begin{array} { l l } { { 1 } } \\ { { - 1 } } \end{array} \right.$ with probability with probability $( 1 + r _ { 0 } ) / 2$ $( 1 - r _ { 0 } ) / 2$ so that $\mathbb { E } [ R ( s _ { H } ^ { c } , a ) ] = r _ { 0 }$ . Moreover, for all actions $a \in \mathcal { A } , R ( s _ { H } ^ { \hat { d } + 1 } , a ) = r _ { 0 } \cdot \hat { d } ^ { 1 / 2 }$ . + +Feature Mapping. Let $e _ { 1 } , e _ { 2 } , \ldots , e _ { d }$ be a set of orthonormal vectors in $\mathbb { R } ^ { d }$ . Here, one possible choice is to set $e _ { 1 } , e _ { 2 } , \ldots , e _ { d }$ to be the standard basis vectors. For each $( h , c ) \in [ H ] \times [ \hat { d } ]$ , we set $\phi ( s _ { h } ^ { c } , a _ { 1 } ) = e _ { c } , \phi ( s _ { h } ^ { c } , a _ { 2 } ) = e _ { c + { \hat { d } } } $ , and $\begin{array} { r } { \phi ( s _ { h } ^ { \hat { d } + 1 } , a ) = \sum _ { c \in \hat { d } } e _ { c } / \hat { d } ^ { 1 / 2 } } \end{array}$ for all $a \in { \mathcal { A } }$ . + +Verifying Assumption 1. The following lemma shows that Assumption 1 holds for our construction. The formal proof can be found in Appendix A. + +Lemma 4.2. For every policy $\pi : S \Delta ( { \mathcal { A } } )$ , for each $h \in [ H ]$ , for all $( s , a ) \in S _ { h } \times \mathcal { A } ,$ , we have $Q _ { h } ^ { \pi } ( s , a ) = \left( \theta _ { h } ^ { \pi } \right) ^ { \top } \phi ( s , a )$ for some $\theta _ { h } ^ { \pi } \in \mathbb { R } ^ { d }$ . + +![](images/f1c705bac0910c06796a6d112262eac433faed712ddcc102a45cae574ace9638.jpg) + +Figure 1: An illustration of the hard instance. Recall that $\hat { d } = d / 2$ . States on the top are those in the first level $( h = 1 )$ ), while states at the bottom are those in the last level $h = H$ ). Solid line (with arrow) corresponds to transitions associated with action $a _ { 1 }$ , while dotted line (with arrow) corresponds to transitions associated with action $a _ { 2 }$ . For each level $h \in [ H ]$ , reward values and $Q$ -values associated with $s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \ldots , s _ { h } ^ { \hat { d } }$ are marked on the left, while reward values and $Q$ -values associated with $s _ { h } ^ { \hat { d } + 1 }$ are mark on the right. Rewards and transitions are all deterministic, except for the reward distributions associated with $s _ { H } ^ { 1 } , s _ { H } ^ { 2 } , \ldots , s _ { H } ^ { \hat { d } }$ . We mark the ex tation of the reward uniformly at random from those states in the dashed rectangle, i.e., $h \in [ H ]$ $\{ s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \ldots , s _ { h } ^ { \hat { d } } \}$ $\mu _ { h }$ , while the action is chosen uniformly at random from $\{ a _ { 1 } , a _ { 2 } \}$ . Suppose the initial state is $s _ { 1 } ^ { \hat { d } + 1 }$ . When $r _ { 0 } = 0$ , the value of the policy is 0. When $r _ { 0 } = \hat { d } ^ { - H / 2 }$ , the value of the policy is $r _ { 0 } \cdot \hat { d } ^ { H / 2 } = 1$ . + +The Data Distributions. For each level $h \in [ H ]$ , the data distribution $\mu _ { h }$ is a uniform distribution over $\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 1 } , a _ { 2 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 2 } ) , \ldots , ( s _ { h } ^ { \hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { \hat { d } } , a _ { 2 } ) \}$ . Notice that $( s _ { h } ^ { \hat { d } + 1 } , a )$ is not in the hsupport of $\mu _ { h }$ hfor all $a \in { \mathcal { A } }$ h h. It can be seen that, $\begin{array} { r } { \mathbb { E } _ { ( s , a ) \sim \mu _ { h } } \left[ \phi ( s , a ) \phi ( s , a ) ^ { \top } \right] = \frac { 1 } { d } \sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \top } = \frac { 1 } { d } I . } \end{array}$ + +The Lower Bound. We show that it is information-theoretically hard for any algorithm to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - H / 2 }$ . We fix the initial state to be $s _ { 1 } ^ { \hat { d } + 1 }$ , and consider any policy $\pi$ . When $r _ { 0 } = 0$ , all reward values will be zero, and thus the value of $\pi$ is zero. On the other hand, when $r _ { 0 } = \hat { d } ^ { - H / 2 }$ , the value of $\pi$ would be $r _ { 0 } \cdot \hat { d } ^ { H / 2 } = 1$ . Thus, if the algorithm approximates the value of the policy up to an error of $1 / 2$ , then it must distinguish the case that $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - H / 2 }$ . + +We first notice that for the case $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - H / 2 }$ , the data distributions $\{ \mu _ { h } \} _ { h = 1 } ^ { H }$ , the feature mapping $\phi : \mathcal { S } \times \mathcal { A } \mathbb { R } ^ { d }$ , the policy $\pi$ to be evaluated and the transition operator $P$ are the same. Thus, in order to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - H / 2 }$ , the only way is to query the reward distribution by using sampling taken from the data distributions. For all state-action pairs $( s , a )$ in the support of the data distributions of the first $H - 1$ levels, the reward distributions will be identical. This is because for all $s \in \mathcal { S } _ { h } \setminus \{ s _ { h } ^ { \hat { d } + 1 } \}$ and $a \in { \mathcal { A } }$ , we have $R ( s , a ) = 0$ . For the case $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - H / 2 }$ , for all state-action pairs $( s , a )$ in the support of the data distribution of the last level, $R ( s , a ) = \left\{ { 1 \atop - 1 } \right.$ with probability with probability $( 1 + r _ { 0 } ) / 2$ $\dot { ( 1 - r _ { 0 } ) / 2 }$ Therefore, to distinguish the case that $r _ { 0 } ~ = ~ 0$ and $r _ { 0 } ~ = ~ \hat { d } ^ { - H / 2 }$ , the agent needs to distinguish two reward distributions $r _ { 1 } = \left\{ { \begin{array} { l l } { 1 } & { { \mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\ { - 1 } & { { \mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \end{array} } \right.$ and $r _ { 2 } = \left\{ \begin{array} { l l } { { \stackrel { - } { 1 } } } \\ { { - 1 } } \end{array} \right.$ with probability with probability $\begin{array} { c } { { ( 1 + \hat { d } ^ { - H / 2 } ) / 2 } } \\ { { ( 1 - \hat { d } ^ { - H / 2 } ) / 2 } } \end{array}$ . Now we invoke Lemma B.1 in Section B by setting $\varepsilon = \hat { d } ^ { - H / 2 } / 2$ and $\delta = 0 . 9$ . By Lemma B.1, in order to distinguish $r _ { 1 }$ and $r _ { 2 }$ with probability at least 0.9, any algorithm requires $\Omega ( \hat { d } ^ { H } )$ samples. + +Algorithm 1 Least-Squares Policy Evaluation + +
1: Input: policy π to be evaluated, number of samples N, regularization parameter 入 > 0
2:Let QH+1(·,·)=O andVH+1(-)= 0
forh=H,H-1,...,1do
4:Take samples (s,a)~ μh,rh ~ r(s,a) and sh ~P(s,a) for eachi∈ [N]
5:LetAh=∑i∈[N](sn,an)(s,a)T+λI
6: 7:LetOn=An1(∑N(s,)·(nh+V+1(3))
Let Qn(-,) = (.,·)TOn and Vh(.)=Q(·,π())
+ +Remark 4. The key in our construction is the state sdˆ+h in each level, whose feature vector is defined to be $\textstyle \sum _ { c \in { \hat { d } } } e _ { c } / { \hat { d } } ^ { 1 / 2 }$ . In each level, $s _ { h } ^ { \hat { d } + 1 }$ amplifies the $Q$ -value by a $\hat { d } ^ { 1 / 2 }$ factor, due to the linearity of the $Q$ -function. After all the $H$ levels, the value will be amplified by a $\hat { d } ^ { H / 2 }$ factor. Since $s _ { h } ^ { \hat { d } + 1 }$ is not in the support of the data distribution, the only way to estimate the value of the policy istimate the expected reward value in the last level. Our construction forces the estimation error of the last level to be amplified exponentially and thus implies an exponential lower bound. + +# 5 UPPER BOUNDS: LOW DISTRIBUTION SHIFT OR POLICY COMPLETENESS ARE SUFFICIENT + +In order to illustrate the error amplification issue and discuss conditions that permit sample-efficient offline RL, in this section, we analyze Least-Squares Policy Evaluation when applied to the offline policy evaluation problem under the realizability assumption. The algorithm is presented in Algorithm 1. For simplicity here we assume the policy $\pi$ to be evaluated is deterministic. + +Notation. For each $h \in [ H ]$ , define $\Lambda _ { h } = \mathbb { E } _ { ( s , a ) \sim \mu _ { h } } \left[ \phi ( s , a ) \phi ( s , a ) ^ { \top } \right]$ to be the feature covariance matrix at level $h$ . For each $h \in [ H - 1 ]$ , define $\overline { { \Lambda } } _ { h + 1 } = \mathbb { E } _ { ( s , a ) \sim \mu _ { h } , \overline { { s } } \sim P ( \cdot \vert s , a ) } \left[ \phi ( \overline { { s } } , \pi ( \overline { { s } } ) ) \phi ( \overline { { s } } , \pi ( \overline { { s } } ) ) ^ { \top } \right]$ to be the feature covariance matrix of the one-step lookahead distribution at level $h$ . Moreover, define $\overline { { \Lambda } } _ { 1 } = \phi ( s _ { 1 } , \pi ( s _ { 1 } ) ) \phi ( s _ { 1 } , \pi ( s _ { 1 } ) ) ^ { \top }$ . We define $\Phi _ { h }$ to be a $N \times d$ matrix, whose $i$ -th row is $\phi ( s _ { h } ^ { i } , a _ { h } ^ { i } )$ , and define $\overline { { \Phi } } _ { h + 1 }$ to be another $N \times d$ matrix whose $i$ -th row is $\phi ( \overline { { s } } _ { h } ^ { i } , \pi ( \overline { { s } } _ { h } ^ { i } ) )$ . For each $h \in [ H ]$ and $i \in [ N ]$ , define $\xi _ { h } ^ { i } = r _ { h } ^ { i } + V ( \overline { { s } } _ { h } ^ { i } ) - Q ( s _ { h } ^ { i } , a _ { h } ^ { i } )$ . We use $\xi _ { h }$ to denote a vector whose $i$ -th entry is $\xi _ { h } ^ { i }$ . + +Now we present a general lemma that characterizes the estimation error of Algorithm 1 by an equality. The proof can be found in Appendix D. Later, we apply this general lemma to special cases. + +Lemma 5.1. Suppose $\lambda > 0$ in Algorithm $^ { l }$ , and for the given policy $\pi$ , there exists $\theta _ { 1 } , \theta _ { 2 } , \ldots , \theta _ { d } \in$ $\mathbb { R } ^ { d }$ such that for each $h \in [ H ]$ , $Q _ { h } ^ { \bar { \pi } } ( s , a ) = \phi ( s , \bar { a } ) ^ { \top } \theta _ { h }$ for all $( s , a ) \in S _ { h } \times \mathcal { A }$ . Then we have + +$$ +( Q ^ { \pi } ( s _ { 1 } , \pi ( s _ { 1 } ) ) - \hat { Q } ( s _ { 1 } , \pi ( s _ { 1 } ) ) ) ^ { 2 } = \displaystyle \left\| \sum _ { h = 1 } ^ { H } \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \cdot \cdot \cdot ( \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } \xi _ { h } - \lambda \hat { \Lambda } _ { h } ^ { - 1 } \theta _ { h } ) \right\| _ { \overline { { \Lambda } } _ { 1 } } ^ { 2 } . +$$ + +Now we consider two special cases where the estimation error in Equation (1) can be upper bounded. + +Low Distribution Shift. The first special we focus on is the case where the distribution shift between the data distributions and the distribution induced by the policy to be evaluated is low. To measure the distribution shift formally, our main assumption is as follows. + +Assumption 3. We assume that for each $h \in [ H ]$ , there exists $C _ { h } \geq 1$ such that $\overline { { \Lambda _ { h } } } \preceq C _ { h } \Lambda _ { h }$ . + +Remark 5. For each Therefore, Assumptio $h \in [ H ]$ , if be r $\sigma _ { \mathrm { m i n } } ( \Lambda _ { h } ) \succeq \frac { 1 } { C _ { h } } I$ for some ssumption $C _ { h } \geq 1$ e . $\overline { { { \Lambda } } } _ { h } \preceq I \preceq C _ { h } \Lambda _ { h }$ $C _ { h } \Lambda _ { h } \succeq I$ to the original version of Assumption 3 as it gives a tighter characterization of the distribution shift. + +Now we state the theoretical guarantee of Algorithm 1. The proof can be found in Appendix D. + +Theorem 5.2. Suppose for the given policy $\pi$ , there exists $\theta _ { 1 } , \theta _ { 2 } , \ldots , \theta _ { d } \ \in \ \mathbb { R } ^ { d }$ such that for√ each $h \in [ H ] , Q _ { h } ^ { \pi } ( s , a ) \ : = \ : \phi ( s , a ) ^ { \top } \theta _ { h }$ for all $( s , a ) \ \in \ S _ { h } \times { \mathcal A }$ and $\| \theta _ { h } \| _ { 2 } ~ \le ~ H \sqrt { d } .$ 4 Let $\lambda = C H \sqrt { d \log ( d H / \delta ) N }$ for some $C > 0$ . With probability at least $1 - \delta$ , for some $c > 0$ , $\begin{array} { r } { ( Q _ { 1 } ^ { \pi } ( s _ { 1 } , \pi ( s _ { 1 } ) ) - \hat { Q } _ { 1 } ( s _ { 1 } , \pi ( s _ { 1 } ) ) ) ^ { 2 } \leq c \cdot \prod _ { h = 1 } ^ { H } C _ { h } \cdot d H ^ { 5 } \cdot \sqrt { d \log ( d H / \delta ) / N } } \end{array}$ . + +Remark 6. The factor $\textstyle \prod _ { h = 1 } ^ { H } C _ { h }$ in Theorem 5.2 implies that the estimation error will be amplified geometrically. Now we discuss how the error is amplified when running Algorithm 1 on the instance in Section 4 to better illustrate the issue. If we run Algorithm 1 on the hard instance in Section 4, when $h = H$ , the estimation error on $V ( s _ { H } ^ { c } )$ would be roughly $N ^ { - 1 / 2 }$ for each $c \in [ \hat { d } ]$ . When using the linear predictor at level $H$ to predict the value of $s _ { H } ^ { * }$ , the error will be amplified by $\hat { d } ^ { 1 / 2 }$ . When $h = H - 1$ , the dataset contains only $s _ { H - 1 } ^ { c }$ for $c \in [ \hat { d } ]$ , and the estimation error on the value of $s _ { H - 1 } ^ { c }$ will be the same as that of $s _ { H } ^ { * }$ , which is roughly $( \hat { d } / N ) ^ { 1 / 2 }$ . Again, the estimation error on the value of $s _ { H - 1 } ^ { * }$ will be $( \hat { d } ^ { 2 } / N ) ^ { 1 / 2 }$ when using the linear predictor at level $H - 1$ . The error will eventually be amplified by a factor of $\hat { d } ^ { H / 2 }$ , which corresponds to the factor $\textstyle \prod _ { h = 1 } ^ { H } C _ { h }$ in Theorem 5.2. + +Policy Completeness. In offline RL, another representation condition is closedness under Bellman update (Szepesvari & Munos, 2005; Duan & Wang, 2020), which is stronger than realizability. In ´ the context of offline policy evaluation, we have the following policy completeness assumption. + +Assumption 4. For the given policy $\pi$ , for any $h > 1$ and $\theta _ { h } \in \mathbb { R } ^ { d }$ , there exists $\theta ^ { \prime } \in \mathbb { R } ^ { d }$ such that for any $\begin{array} { r } { ( s , a ) \in \mathcal S _ { h - 1 } \times \mathcal A , \mathbb E [ R ( s , a ) ] + \sum _ { s ^ { \prime } \in { \cal S } _ { h } } P ( s ^ { \prime } \mid s , a ) \phi ( s ^ { \prime } , \pi ( s ^ { \prime } ) ) ^ { \top } \theta _ { h } = \phi ( s , a ) ^ { \top } \theta ^ { \prime } . } \end{array}$ . + +Under Assumption 4 and the assumption that $\sigma _ { \operatorname* { m i n } } ( \Lambda _ { h } ) \geq \lambda _ { 0 }$ for all $h \in [ H ]$ for some $\lambda _ { 0 } > 0$ , Duan & Wang (2020) have shown that for Algorithm 1, by taking $N = \mathrm { p o l } \bar { \mathrm { y } } ( \bar { H } , d , 1 / \varepsilon , 1 / \lambda _ { 0 } )$ , we have $( Q _ { 1 } ^ { \pi } ( s _ { 1 } , \pi ( s _ { 1 } ) ) - \hat { Q } _ { 1 } ( s _ { 1 } , \pi ( s _ { 1 } ) ) ) ^ { 2 } \leq \varepsilon$ . We refer interested readers to (Duan & Wang, 2020). + +We remark that the above analysis again implies that geometric error amplification is a real issue in offline RL, and sample-efficient offline RL is impossible unless the distribution shift is sufficiently low, i.e., $\textstyle \prod _ { h = 1 } ^ { H } C _ { h }$ is bounded, or strong representation condition (e.g. policy completeness) holds. + +# 6 CONCLUSION + +While the extant body of provable results in the literature largely focus on sufficient conditions for sample-efficient offline RL, this work focuses on obtaining a better understanding of the necessary conditions, where we seek to understand to what extent mild assumptions can imply sample-efficient offline RL. This work shows that for off-policy evaluation, even if we are given a representation that can perfectly represent the value function of the given policy and the data distribution has good coverage over the features, any provable algorithm still requires an exponential number of samples to non-trivially approximate the value of the given policy. These results highlight that provable sample-efficient offline RL is simply not possible unless either the distribution shift condition is sufficiently mild or we have stronger representation conditions that go well beyond realizability. + +# ACKNOWLEDGMENTS + +The authors would like to thank Akshay Krishnamurthy, Alekh Agarwal, Wen Sun, and Nan Jiang for numerous helpful discussion. Sham M. Kakade gratefully acknowledges funding from the ONR award N00014-18-1-2247, and NSF Awards CCF-1703574 and CCF-1740551. Ruosong Wang was supported in part by the NSF IIS1763562, US Army W911NF1920104, and ONR Grant N000141812861. Research performed while Ruosong Wang was an intern at Microsoft Research. + +# REFERENCES + +Rishabh Agarwal, Dale Schuurmans, and Mohammad Norouzi. An optimistic perspective on offline reinforcement learning. In International Conference on Machine Learning, 2020. + +Martin Anthony and Peter L Bartlett. Neural network learning: Theoretical foundations. cambridge university press, 2009. + +Andras Antos, Csaba Szepesv ´ ari, and R ´ emi Munos. Learning near-optimal policies with bellman- ´ residual minimization based fitted policy iteration and a single sample path. Machine Learning, 71(1):89–129, 2008. + +Keith Ball. An elementary introduction to modern convex geometry. Flavors of geometry, 31:1–58, 1997. + +Dimitri P Bertsekas and John N Tsitsiklis. Neuro-dynamic programming: an overview. In Proceedings of 1995 34th IEEE Conference on Decision and Control, volume 1, pp. 560–564. IEEE, 1995. + +Sebastien Bubeck, Nicol ´ o Cesa-Bianchi, and Sham M. Kakade. Towards minimax policies for \` online linear optimization with bandit feedback. In COLT 2012 - The 25th Annual Conference on Learning Theory, June 25-27, 2012, Edinburgh, Scotland, volume 23 of JMLR Proceedings, pp. 41.1–41.14, 2012. + +Jinglin Chen and Nan Jiang. Information-theoretic considerations in batch reinforcement learning. In International Conference on Machine Learning, pp. 1042–1051, 2019. + +Herman Chernoff. Sequential analysis and optimal design. SIAM, 1972. + +Simon S. Du, Sham M. Kakade, Ruosong Wang, and Lin F. Yang. Is a good representation sufficient for sample efficient reinforcement learning? In International Conference on Learning Representations, 2020. + +Yaqi Duan and Mengdi Wang. Minimax-optimal off-policy evaluation with linear function approximation. arXiv preprint arXiv:2002.09516, 2020. + +Miroslav Dud´ık, John Langford, and Lihong Li. Doubly robust policy evaluation and learning. In Proceedings of the 28th International Conference on International Conference on Machine Learning, pp. 1097–1104, 2011. + +Mehrdad Farajtabar, Yinlam Chow, and Mohammad Ghavamzadeh. More robust doubly robust off-policy evaluation. In International Conference on Machine Learning, pp. 1447–1456, 2018. + +Yihao Feng, Tongzheng Ren, Ziyang Tang, and Qiang Liu. Accountable off-policy evaluation with kernel bellman statistics. arXiv preprint arXiv:2008.06668, 2020. + +Scott Fujimoto, David Meger, and Doina Precup. Off-policy deep reinforcement learning without exploration. In International Conference on Machine Learning, pp. 2052–2062, 2019. + +Geoffrey J Gordon. Stable function approximation in dynamic programming. In Machine Learning Proceedings 1995, pp. 261–268. Elsevier, 1995. + +Geoffrey J Gordon. Stable fitted reinforcement learning. In Advances in neural information processing systems, pp. 1052–1058, 1996. + +Geoffrey J Gordon. Approximate solutions to markov decision processes. Technical report, CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE, 1999. + +Omer Gottesman, Fredrik Johansson, Joshua Meier, Jack Dent, Donghun Lee, Srivatsan Srinivasan, Linying Zhang, Yi Ding, David Wihl, Xuefeng Peng, Jiayu Yao, Isaac Lage, Christopher Mosch, Li wei H. Lehman, Matthieu Komorowski, Matthieu Komorowski, Aldo Faisal, Leo Anthony Celi, David Sontag, and Finale Doshi-Velez. Evaluating reinforcement learning algorithms in observational health settings, 2018. + +Zhaohan Guo, Philip S Thomas, and Emma Brunskill. Using options and covariance testing for long horizon off-policy policy evaluation. In Advances in Neural Information Processing Systems, pp. 2492–2501, 2017. + +Daniel Hsu, Sham Kakade, Tong Zhang, et al. A tail inequality for quadratic forms of subgaussian random vectors. Electronic Communications in Probability, 17, 2012a. + +Daniel Hsu, Sham M Kakade, and Tong Zhang. Random design analysis of ridge regression. In Conference on learning theory, pp. 9–1, 2012b. + +Natasha Jaques, Asma Ghandeharioun, Judy Hanwen Shen, Craig Ferguson, Agata Lapedriza, Noah Jones, Shixiang Gu, and Rosalind Picard. Way off-policy batch deep reinforcement learning of human preferences in dialog, 2020. URL https://openreview.net/forum?id $=$ rJl5rRVFvH. + +Nan Jiang and Jiawei Huang. Minimax confidence interval for off-policy evaluation and policy optimization. arXiv preprint arXiv:2002.02081, 2020. + +Nan Jiang and Lihong Li. Doubly robust off-policy value evaluation for reinforcement learning. In International Conference on Machine Learning, pp. 652–661. PMLR, 2016. + +Sham Machandranath Kakade. On the sample complexity of reinforcement learning. PhD thesis, University of London London, England, 2003. + +Nathan Kallus and Masatoshi Uehara. Efficiently breaking the curse of horizon in off-policy evaluation with double reinforcement learning. arXiv preprint arXiv:1909.05850, 2019. + +Nathan Kallus and Masatoshi Uehara. Double reinforcement learning for efficient off-policy evaluation in markov decision processes. Journal of Machine Learning Research, 21(167):1–63, 2020. + +Emilie Kaufmann, Olivier Cappe, and Aur ´ elien Garivier. On the complexity of best-arm identifi- ´ cation in multi-armed bandit models. The Journal of Machine Learning Research, 17(1):1–42, 2016. + +Rahul Kidambi, Aravind Rajeswaran, Praneeth Netrapalli, and Thorsten Joachims. Morel $:$ Modelbased offline reinforcement learning, 2020. + +Akshay Krishnamurthy, Alekh Agarwal, and John Langford. Pac reinforcement learning with rich observations. In Advances in Neural Information Processing Systems, pp. 1840–1848, 2016. + +Aviral Kumar, Justin Fu, Matthew Soh, George Tucker, and Sergey Levine. Stabilizing off-policy q-learning via bootstrapping error reduction. neural information processing systems, pp. 11761– 11771, 2019. + +Aviral Kumar, Abhishek Gupta, and Sergey Levine. Discor: Corrective feedback in reinforcement learning via distribution correction. arXiv preprint arXiv:2003.07305, 2020. + +Michail G Lagoudakis and Ronald Parr. Least-squares policy iteration. Journal of machine learning research, 4(Dec):1107–1149, 2003. + +Romain Laroche, Paul Trichelair, and Remi Tachet des Combes. Safe policy improvement with ´ baseline bootstrapping. In Proceedings of the 36th International Conference on Machine Learning (ICML), 2019. + +Lihong Li, Remi Munos, and Csaba Szepesvari. Toward minimax off-policy value estimation. In Artificial Intelligence and Statistics, pp. 608–616, 2015. + +Qiang Liu, Lihong Li, Ziyang Tang, and Dengyong Zhou. Breaking the curse of horizon: Infinitehorizon off-policy estimation. In Advances in Neural Information Processing Systems, pp. 5356– 5366, 2018. + +Yao Liu, Pierre-Luc Bacon, and Emma Brunskill. Understanding the curse of horizon in off-policy evaluation via conditional importance sampling. arXiv preprint arXiv:1910.06508, 2019. + +Travis Mandel, Yun-En Liu, Sergey Levine, Emma Brunskill, and Zoran Popovic. Offline policy evaluation across representations with applications to educational games. In AAMAS, pp. 1077– 1084, 2014. + +Shie Mannor and John N Tsitsiklis. The sample complexity of exploration in the multi-armed bandit problem. Journal of Machine Learning Research, 5(Jun):623–648, 2004. + +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, 2015. + +Wenlong Mou, Zheng Wen, and Xi Chen. On the sample complexity of reinforcement learning with policy space generalization. arXiv preprint arXiv:2008.07353, 2020. + +Remi Munos. Error bounds for approximate policy iteration. In ´ ICML, volume 3, pp. 560–567, 2003. + +Remi Munos and Andrew W Moore. Barycentric interpolators for continuous space and time reinforcement learning. In Advances in neural information processing systems, pp. 1024–1030, 1999. + +Remi Munos and Csaba Szepesv ´ ari. Finite-time bounds for fitted value iteration. ´ Journal of Machine Learning Research, 9(May):815–857, 2008. + +Dirk Ormoneit and Saunak Sen. Kernel-based reinforcement learning. ´ Machine learning, 49(2-3): 161–178, 2002. + +Doina Precup. Eligibility traces for off-policy policy evaluation. Computer Science Department Faculty Publication Series, pp. 80, 2000. + +Stephane Ross and Drew Bagnell. Agnostic system identification for model-based reinforcement ´ learning. In Proceedings of the 29th International Conference on Machine Learning, ICML 2012, Edinburgh, Scotland, UK, June 26 - July 1, 2012. icml.cc / Omnipress, 2012. + +Wen Sun, Arun Venkatraman, Geoffrey J Gordon, Byron Boots, and J Andrew Bagnell. Deeply aggrevated: Differentiable imitation learning for sequential prediction. In International Conference on Machine Learning, pp. 3309–3318, 2017. + +Csaba Szepesvari and R ´ emi Munos. Finite time bounds for sampling based fitted value iteration. In ´ Proceedings of the 22nd international conference on Machine learning, pp. 880–887, 2005. + +Philip Thomas and Emma Brunskill. Data-efficient off-policy policy evaluation for reinforcement learning. In International Conference on Machine Learning, pp. 2139–2148, 2016. + +Philip S. Thomas. Safe reinforcement learning. PhD thesis, University of Massachusetts, Amherst, 2014. + +Philip S Thomas, Georgios Theocharous, and Mohammad Ghavamzadeh. High-confidence offpolicy evaluation. In Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015. + +Philip S. Thomas, Bruno Castro da Silva, Andrew G. Barto, Stephen Giguere, Yuriy Brun, and Emma Brunskill. Preventing undesirable behavior of intelligent machines. Science, 366(6468): 999–1004, 2019. ISSN 0036-8075. doi: 10.1126/science.aag3311. + +Samuele Tosatto, Matteo Pirotta, Carlo d’Eramo, and Marcello Restelli. Boosted fitted q-iteration. In International Conference on Machine Learning, pp. 3434–3443. PMLR, 2017. + +Joel A Tropp. An introduction to matrix concentration inequalities. Foundations and Trends $\textsuperscript { \textregistered }$ in Machine Learning, 8(1-2):1–230, 2015. + +J Tsitsiklis and B Van Roy. An analysis of temporal-difference learning with function approximation (technical report lids-p-2322). Laboratory for Information and Decision Systems, 1996. + +Masatoshi Uehara and Nan Jiang. Minimax weight and q-function learning for off-policy evaluation. arXiv preprint arXiv:1910.12809, 2019. + +Benjamin Van Roy. Feature-based methods for large scale dynamic programming. PhD thesis, Massachusetts Institute of Technology, 1994. + +L. Wang, Wei Zhang, Xiaofeng He, and H. Zha. Supervised reinforcement learning with recurrent neural network for dynamic treatment recommendation. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018. + +Ruosong Wang, Simon S Du, Lin F Yang, and Ruslan Salakhutdinov. On reward-free reinforcement learning with linear function approximation. arXiv preprint arXiv:2006.11274, 2020. + +Yu-Xiang Wang, Alekh Agarwal, and Miroslav Dudık. Optimal and adaptive off-policy evaluation in contextual bandits. In International Conference on Machine Learning, pp. 3589–3597. PMLR, 2017. + +Yifan Wu, George Tucker, and Ofir Nachum. Behavior regularized offline reinforcement learning, 2020. URL https://openreview.net/forum?id ${ . } = { }$ BJg9hTNKPH. + +Tengyang Xie and Nan Jiang. Batch value-function approximation with only realizability. arXiv preprint arXiv:2008.04990, 2020a. + +Tengyang Xie and Nan Jiang. $Q ^ { \star }$ approximation schemes for batch reinforcement learning: A theoretical comparison. arXiv preprint arXiv:2003.03924, 2020b. + +Tengyang Xie, Yifei Ma, and $\mathrm { Y u }$ -Xiang Wang. Towards optimal off-policy evaluation for reinforcement learning with marginalized importance sampling. In Advances in Neural Information Processing Systems, pp. 9668–9678, 2019. + +C. Yu, G. Ren, and J. Liu. Deep inverse reinforcement learning for sepsis treatment. In 2019 IEEE International Conference on Healthcare Informatics (ICHI), pp. 1–3, 2019. + +Andrea Zanette, Alessandro Lazaric, Mykel J Kochenderfer, and Emma Brunskill. Limiting extrapolation in linear approximate value iteration. In Advances in Neural Information Processing Systems, pp. 5616–5625, 2019. + +# A PROOF OF LEMMA 4.2 + +Proof. We first verify $Q ^ { \pi }$ is linear for the first $H - 1$ levels. For each $( h , c ) \in [ H - 1 ] \times [ \hat { d } ]$ , we have + +$$ +Q _ { h } ^ { \pi } ( s _ { h } ^ { c } , a _ { 1 } ) = R ( s _ { h } ^ { c } , a _ { 1 } ) + R ( s _ { h + 1 } ^ { \hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \hat { d } + 1 } , a _ { 1 } ) + \ldots + R ( s _ { H } ^ { \hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \cdot \hat { d } ^ { ( H - h ) / 2 } . +$$ + +Moreover, for all $a \in { \mathcal { A } }$ , + +$$ +\begin{array} { r } { \mathcal { Q } _ { h } ^ { \pi } ( s _ { h } ^ { \hat { d } + 1 } , a ) = R ( s _ { h } ^ { \hat { d } + 1 } , a ) + R ( s _ { h + 1 } ^ { \hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \hat { d } + 1 } , a _ { 1 } ) + . . . + R ( s _ { H } ^ { \hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \cdot \hat { d } ^ { ( H - h + 1 ) / 2 } . } \end{array} +$$ + +Therefore, if we define + +$$ +\boldsymbol { \theta } _ { h } ^ { \pi } = \sum _ { c = 1 } ^ { \hat { d } } \boldsymbol { r } _ { 0 } \cdot \hat { d } ^ { ( H - h ) / 2 } \cdot \boldsymbol { e } _ { c } + \sum _ { c = 1 } ^ { \hat { d } } Q _ { h } ^ { \pi } ( s _ { h } ^ { c } , a _ { 2 } ) \cdot \boldsymbol { e } _ { c + \hat { d } } , +$$ + +then $Q _ { h } ^ { \pi } ( s , a ) = \left( \theta _ { h } ^ { \pi } \right) ^ { \top } \phi ( s , a )$ for all $( s , a ) \in S _ { h } \times \mathcal { A }$ + +Now we verify that the $Q$ -function is linear for the last level. Clearly, for all $c \in [ \hat { d } ]$ and $a \in { \mathcal { A } }$ , $Q _ { H } ^ { \pi } ( s _ { H } ^ { c } , a ) = r _ { 0 }$ and $Q _ { H } ^ { \pi } ( s _ { H } ^ { \hat { d } + 1 } , a ) = r _ { 0 } \cdot \sqrt { \hat { d } }$ . Thus by defining $\begin{array} { r } { \theta _ { H } ^ { \pi } = \sum _ { c = 1 } ^ { d } r _ { 0 } \cdot e _ { c } } \end{array}$ , we have $Q _ { H } ^ { \pi } ( s , a ) = \left( \theta _ { H } ^ { \pi } \right) ^ { \top } \phi ( s , a )$ for all $( s , a ) \in { \cal S } _ { H } \times \mathcal { A }$ . + +# B A TECHNICAL LEMMA + +We need the following lemma in the proof of our hardness results. + +Lemma B.1. Let α be a random variable uniformly distributed on $\{ \alpha _ { + } , \alpha _ { - } \}$ , where $\alpha _ { - } = 1 / 2$ and $\alpha _ { + } = 1 / 2 + \varepsilon$ with $0 < \varepsilon < 1$ . Suppose that $\xi _ { 1 } , \xi _ { 2 } , \ldots , \xi _ { m }$ are i.i.d. $\{ + 1 , - 1 \}$ -valued random variables with $\operatorname* { P r } [ \xi _ { i } = + 1 ] = \alpha$ for all $i \in [ m ]$ . Let $f$ be a function from $\bar { \{ + 1 , - 1 \} } ^ { m }$ to $\{ \alpha _ { + } , \alpha _ { - } \}$ . Suppose $m \le C / \varepsilon ^ { 2 } \log ( 1 / \delta )$ for some fixed constant $C$ . Then + +$$ +\operatorname* { P r } [ f ( \xi _ { 1 } , \xi _ { 2 } , \ldots , \xi _ { m } ) \neq \alpha ] > \delta . +$$ + +To our best knowledge, Lemma B.1 was first proved in (Chernoff, 1972) and has enormous applications in statistical learning theory (see, e.g., Chapter 5 in (Anthony & Bartlett, 2009)) and bandits (Mannor & Tsitsiklis, 2004). + +To prove Lemma B.1, one can first prove that the maximum likelihood estimator (MLE) is optimal and then show that MLE requires $\dot { \Omega ( 1 / \varepsilon ^ { 2 } \log ( 1 / \delta ) ) }$ samples to correctly output $\alpha$ with probability $1 - \delta$ by anti-concentration. Lemma B.1 can also be proved by using information theory. See, e.g., (Kaufmann et al., 2016) for such a proof. + +# C ANOTHER HARD INSTANCE + +In this section, we present another hard case under a weaker version of Assumption 1. Here the transition operator is stochastic and the reward is deterministic and sparse, meaning that the reward value is non-zero only for the last level. Moreover, the data distributions $\{ \mu _ { h } \} _ { h = 1 } ^ { H }$ are induced by a fixed policy $\pi _ { \mathrm { d a t a } }$ . We also illustrate the construction in Figure 2. Throughout this section, we use $d$ the denote the feature dimension, and we assume $d$ is an even integer for simplicity. We use $\hat { d }$ to denote $d / 2 - 1$ . + +In this section, we adopt the following realizability assumption, which is a weaker version of Assumption 1. + +Assumption 5 (Realizability). For the policy $\pi : { \mathcal { S } } \to \Delta ( { \mathcal { A } } )$ to be evaluated, there exists $\theta _ { 1 } , \ldots \theta _ { H } \in \mathbb { R } ^ { d }$ such that for all $( s , a ) \in S \times A$ and $h \in [ H ]$ , + +$$ +Q _ { h } ^ { \pi } ( s , a ) = \theta _ { h } ^ { \top } \phi ( s , a ) . +$$ + +![](images/831f4f46b3c3a7fe56b9389db2fe0185582a4d12a043273c0a23665f61094463.jpg) +Figure 2: An illustration of the hard instance. Recall that $\hat { d } = d / 2 - 1$ . States on the top are those in the first level $( h = 1 )$ ), while states at the bottom are those in the last level ( $h = H$ ). Dotted line (with arrow) corresponds to transitions associated with actions $a _ { 1 } , a _ { 2 } , \ldots , a _ { \hat { d } }$ , while solid line (with arrow) corresponds to transitions associated with actions $a _ { \hat { d } + 1 } , a _ { \hat { d } + 2 } , \dotsc , a _ { d }$ . We omit the transition associated with $a _ { 1 } , a _ { 2 } , \ldots , a _ { \hat { d } }$ in the figure if all actions give the same transition. For each level $h \in [ H ]$ , $Q$ -values associated with $s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \ldots , s _ { h } ^ { \hat { d } } , s _ { h } ^ { + } , s _ { h } ^ { - }$ , sdˆh, s+h , s−h are marked on the left, while transition distributions and $Q$ -values associated with + − $s _ { h } ^ { \hat { d } + 1 }$ are marked on the right. Rewards are all deterministic, and the only two states ) with non-zero reward values are marked in black and grey. Consider the fixed policy that returns $\mathit { a } _ { d }$ for all input states. When $r _ { 0 } = 0$ , the value of the policy is 0. When $r _ { 0 } = \hat { d } ^ { - ( \bar { H } - 2 ) / 2 }$ , the value of the policy $s = r _ { 0 } \hat { d } ^ { ( H - 2 ) / 2 } = 1$ . + +State Space, Action Space and Transition Operator. In this hard case, the action space ${ \mathcal { A } } =$ $\{ a _ { 1 } , a _ { 2 } , \ldots , a _ { d } \}$ contains $d$ elements. $S _ { 1 }$ contains a single state $s _ { 1 }$ . For each $h \geq 2$ , $S _ { h }$ contains ${ \hat { d } } + 3$ states $s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \ldots , s _ { h } ^ { \hat { d } } , s _ { h } ^ { \hat { d } + 1 } , s _ { h } ^ { + }$ and $s _ { h } ^ { - }$ . + +Let $0 \leq r _ { 0 } \leq \hat { d } ^ { - ( H - 2 ) / 2 }$ be a parameter to be determined. We first define the transition operator for the first level. We have + +$$ +P ( s _ { 1 } , a ) = \left\{ \begin{array} { l l } { s _ { 2 } ^ { c } } & { a = a _ { c } , c \in [ \hat { d } ] } \\ { s _ { 2 } ^ { + } } & { a = a _ { \hat { d } + 1 } } \\ { s _ { 2 } ^ { - } } & { a = a _ { \hat { d } + 2 } } \\ { s _ { 2 } ^ { \hat { d } + 1 } } & { a \in \{ a _ { \hat { d } + 3 } , a _ { \hat { d } + 4 } , \dots , a _ { d } \} } \end{array} \right. . +$$ + +Now we define the transition operator when $h \in \{ 2 , 3 , \ldots , H - 2 \}$ . For each $h \in \{ 2 , 3 , \ldots , H - 2 \}$ , $a \in { \mathcal { A } }$ and $c \in [ \hat { d } ]$ , we have $P ( s _ { h } ^ { c } , a ) = s _ { h + 1 } ^ { \hat { d } + 1 }$ , $P ( s _ { h } ^ { + } , a ) = s _ { h + 1 } ^ { + }$ and $P ( s _ { h } ^ { - } , a ) = s _ { h + 1 } ^ { - }$ . For each $h \in \{ 2 , 3 , \ldots , H - 2 \}$ and $c \in [ \hat { d } ]$ , we have $P ( s _ { h } ^ { \hat { d } + 1 } , a _ { c } ) = s _ { h + 1 } ^ { c }$ . For all $a \in \left\{ a _ { \hat { d } + 1 } , a _ { \hat { d } + 2 } , \dotsc , a _ { d } \right\}$ , + +we have + +$$ +P \left( s _ { h } ^ { \hat { d } + 1 } , a \right) = \left\{ \begin{array} { l l } { s _ { h + 1 } ^ { + } } & { \mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } \cdot \hat { d } ^ { ( H - h ) / 2 } ) / 2 } \\ { s _ { h + 1 } ^ { - } } & { \mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } \cdot \hat { d } ^ { ( H - h ) / 2 } ) / 2 } \end{array} \right. . +$$ + +Now we define the transition operator for the second last level. For all $c \in [ \hat { d } ]$ and $a \in { \mathcal { A } }$ , we have + +$$ +P ( s _ { H - 1 } ^ { c } , a ) = \left\{ \begin{array} { l l } { s _ { H } ^ { + } } & { \mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } ) / 2 } \\ { s _ { H } ^ { - } } & { \mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } ) / 2 } \end{array} \right. . +$$ + +For all $a \in { \mathcal { A } }$ , we have $P ( s _ { H - 1 } ^ { + } , a ) = s _ { H } ^ { + }$ and $P ( s _ { H - 1 } ^ { - } , a ) \ = \ s _ { H } ^ { - }$ . For each $c \in [ \hat { d } ]$ , we have $P ( s _ { H - 1 } ^ { \hat { d } + 1 } , a _ { c } ) = s _ { H } ^ { c }$ . For all $a \in \left\{ a _ { \hat { d } + 1 } , a _ { \hat { d } + 2 } , \dotsc , a _ { d } \right\}$ , we have + +$$ +P ( s _ { H - 1 } ^ { \hat { d } + 1 } , a ) = \left\{ \begin{array} { l l } { s _ { H } ^ { + } } & { \mathrm { w i t h } \mathrm { p r o b a b i l i t y } \left( 1 + r _ { 0 } \cdot \sqrt { \hat { d } } \right) / 2 } \\ { s _ { H } ^ { - } } & { \mathrm { w i t h } \mathrm { p r o b a b i l i t y } \left( 1 - r _ { 0 } \cdot \sqrt { \hat { d } } \right) / 2 } \end{array} \right. . +$$ + +Reward Values. In this hard case, all reward values are deterministic, and reward values can be non-zero only for the last level. Formally, we have + +$$ +R ( s , a ) = \left\{ { \begin{array} { l l } { 1 } & { s = s _ { H } ^ { + } } \\ { - 1 } & { s = s _ { H } ^ { - } } \\ { 0 } & { { \mathrm { o t h e r w i s e } } } \end{array} } \right. . +$$ + +Feature Mapping. As in the in hard instance in Section 4, let $e _ { 1 } , e _ { 2 } , \ldots , e _ { d }$ be a set of of orthonormal vectors in $\mathbb { R } ^ { d }$ . For the initial state, for each $c \in [ d ]$ , we have $\phi ( s _ { 1 } , a _ { c } ) = e _ { c }$ . + +Now we define the feature mapping when $h \in \{ 2 , 3 , \ldots , H \}$ . For each $h \in \{ 2 , 3 , \ldots , H \}$ , $a \in { \mathcal { A } }$ and $c \in [ \hat { d } ] , \phi ( s _ { h } ^ { c } , a ) = e _ { c } , \phi ( s _ { h } ^ { + } , a ) = e _ { \hat { d } + 1 }$ and $\phi ( s _ { h } ^ { - } , a ) = e _ { \hat { d } + 2 }$ . Moreover, for all actions $a \in { \mathcal { A } }$ , + +$$ +\phi ( s _ { h } ^ { \hat { d } + 1 } , a ) = \left\{ { \begin{array} { l l } { e _ { \hat { d } + 2 + c } } & { a = a _ { c } , c \in [ { \hat { d } } ] } \\ { { \frac { 1 } { d ^ { 1 / 2 } } } \left( e _ { 1 } + e _ { 2 } + \ldots + e _ { \hat { d } } \right) } & { a \in \left\{ a _ { \hat { d } + 1 } , a _ { \hat { d } + 2 } , \ldots , a _ { d } \right\} } \end{array} } \right. . +$$ + +Clearly, for all (s, a) ∈ S × A, $\| \phi ( s , a ) \| _ { 2 } \leq 1$ . + +Verifying Assumption 5. Now we consider the deterministic policy $\pi : { \mathcal { S } } A$ , which is defined to be $\pi ( s ) = a _ { d }$ for all $s \in S$ . We show that Assumption 5 holds. + +When $h = 1$ , define + +$$ +\theta _ { 1 } = \sum _ { c = 1 } ^ { \hat { d } } r _ { 0 } \cdot \hat { d } ^ { ( H - 3 ) / 2 } \cdot e _ { c } + e _ { \hat { d } + 1 } - e _ { \hat { d } + 2 } + \sum _ { c = 1 } ^ { \hat { d } } r _ { 0 } \cdot \hat { d } ^ { ( H - 2 ) / 2 } \cdot e _ { \hat { d } + 2 + c } . +$$ + +For each $h \in \{ 2 , 3 , \ldots , H - 2 \}$ , define + +$$ +\theta _ { h } = \sum _ { c = 1 } ^ { \hat { d } } r _ { 0 } \cdot \hat { d } ^ { ( H - h - 1 ) / 2 } \cdot e _ { c } + e _ { \hat { d } + 1 } - e _ { \hat { d } + 2 } + \sum _ { c = 1 } ^ { \hat { d } } r _ { 0 } \cdot \hat { d } ^ { ( H - h - 2 ) / 2 } \cdot e _ { \hat { d } + 2 + c } . +$$ + +For the second last level $h = H - 1$ , define + +$$ +\theta _ { H - 1 } = \sum _ { c = 1 } ^ { \hat { d } } r _ { 0 } \cdot e _ { c } + e _ { \hat { d } + 1 } - e _ { \hat { d } + 2 } . +$$ + +Finally, for the last level $h = H$ , define + +$$ +\theta _ { H } = e _ { \hat { d } + 1 } - e _ { \hat { d } + 2 } . +$$ + +It can be verified that for each $h \in [ H ]$ , $Q _ { h } ^ { \pi } ( s , a ) = \theta _ { h } ^ { \top } \phi ( s , a )$ for all $( s , a ) \in S _ { h } \times \mathcal { A }$ . + +The Data Distributions. For the first level, the data distribution $\mu _ { 1 }$ is defined to be the uniform distribution over $\{ ( s _ { 1 } , a _ { c } ) ~ | ~ c ~ \in ~ [ d ] \}$ . For each $h \geq 2$ , the data distribution $\mu _ { h }$ is a uniform distribution over + +$$ +\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , \ldots , ( s _ { h } ^ { \hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { + } , a _ { 1 } ) , ( s _ { h } ^ { - } , a _ { 1 } ) , ( s _ { h } ^ { \hat { d } + 1 } , a _ { 1 } ) , ( s _ { h } ^ { \hat { d } + 1 } , a _ { 2 } ) , \ldots , ( s _ { h } ^ { \hat { d } + 1 } , a _ { \hat { d } } ) \} . +$$ + +Notice that again $( s _ { h } ^ { \hat { d } + 1 } , a )$ is not in the support of $\mu _ { h }$ for all actions $a \in \left\{ a _ { \hat { d } + 1 } , a _ { \hat { d } + 2 } , \dotsc , a _ { d } \right\}$ . It can be seen that for all $h \in [ H ]$ , + +$$ +\mathbb { E } _ { ( s , a ) \sim \mu _ { h } } [ \phi ( s , a ) \phi ( s , a ) ^ { \top } ] = \frac { 1 } { d } \sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \top } = \frac { 1 } { d } I . +$$ + +Moreover, by defining + +$$ +\pi _ { \operatorname* { d a t a } } ( s ) = \left\{ \begin{array} { l l } { \operatorname { U n i f o r m } ( A ) } & { s = s _ { 1 } } \\ { a _ { 1 } } & { s \in \{ s _ { h } ^ { c } \mid h \in \{ 2 , 3 , \ldots , H \} , c \in [ \hat { d } ] \} } \\ { a _ { 1 } } & { s \in \{ s _ { h } ^ { + } \mid h \in \{ 2 , 3 , \ldots , H \} \} } \\ { a _ { 1 } } & { s \in \{ s _ { h } ^ { - } \mid h \in \{ 2 , 3 , \ldots , H \} \} } \\ { \operatorname { U n i f o r m } ( \{ a _ { 1 } , a _ { 2 } , \ldots , a _ { \hat { d } } \} ) } & { s \in \{ s _ { h } ^ { \hat { d } + 1 } \mid h \in \{ 2 , 3 , \ldots , H \} \} } \end{array} \right. , +$$ + +we have $\mu _ { h } = \mu _ { h } ^ { \pi _ { \mathrm { d a t a } } }$ for all $h \in [ H ]$ + +The Lower Bound. Now we show that it is information-theoretically hard for any algorithm to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - ( H - 2 ) / 2 }$ in the offline setting by taking samples from the data distributions $\{ \mu _ { h } \} _ { h = 1 } ^ { H }$ . Here we consider the above policy $\pi$ defined above which returns action $a _ { d }$ for all input states. Notice that when $r _ { 0 } = 0$ , the value of the policy would be zero. On the other hand, when $\stackrel { \cdot } { r } _ { 0 } = \hat { d } ^ { - ( H - 2 ) / 2 }$ , the value of the policy would be $r _ { 0 } \cdot \hat { d } ^ { ( \overleftarrow { H } - 2 ) / 2 } = 1 .$ . Therefore, if the algorithm approximates the value of the policy up to an approximation error of $1 / 2$ , then it must distinguish the case that $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - ( H - 2 ) / 2 }$ . + +We first notice that for the case $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - ( H - 2 ) / 2 }$ , the data distributions $\{ \mu _ { h } \} _ { h = 1 } ^ { H }$ , the feature mapping $\phi : \mathcal { S } \times \mathcal { A } \mathbb { R } ^ { d }$ , the policy $\pi$ to be evaluated and the reward distributions $R$ are the same. Thus, in order to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - ( H - 2 ) / 2 }$ , the only way is to query the transition operator $P$ by using sampling taken from the data distributions. + +Now, for all state-action pairs $( s , a )$ in the support of the data distributions of the first $H - 2$ lev +elsing amely only $\mu _ { 1 } , \mu _ { 2 } , \ldots , \mu _ { H - 2 } )$ , the transition opeion distributions of ang-, and $r _ { 0 }$ $( s _ { h } ^ { \hat { d } + 1 } , a _ { \hat { d } + 1 } ) , ( s _ { h } ^ { \hat { d } + 1 } , a _ { \hat { d } + 2 } ) , \dots , ( s _ { h } ^ { \hat { d } + 1 } , a _ { d } )$ support of in the supp f of $h ~ \in ~ [ H \mathrm { ~ - ~ } 2 ]$ . Moreover, for anyso be identical no mat +$( s , a ) \in \{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \hat { d } + 1 } \} \times \mathcal { A }$ $\mu _ { H - 1 }$ $P ( s , a )$ +ter $r _ { 0 } = 0$ or $r _ { 0 } = \hat { d } ^ { - ( H - 2 ) / 2 }$ . For those state-action pairs $( s , a )$ in the support of $\mu _ { H - 1 }$ with +$s \not \in \{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \hat { d } + 1 } \}$ , we have + +$$ +P ( s , a ) = \left\{ \begin{array} { l l } { s _ { H } ^ { + } } & { \mathrm { w i t h } \ p r o b a b i l i t y \ ( 1 + r _ { 0 } ) / 2 } \\ { s _ { H } ^ { - } } & { \mathrm { w i t h } \ p r o b a b i l i t y \ ( 1 - r _ { 0 } ) / 2 } \end{array} \right. . +$$ + +Again, this is because $( s _ { H - 1 } ^ { \hat { d } + 1 } , a )$ is not in the support of $\mu _ { H - 1 }$ for all $a \in \left\{ a _ { \hat { d } + 1 } , a _ { \hat { d } + 2 } , \dotsc , a _ { d } \right\}$ + +Therefore, in order to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \hat { d } ^ { - ( H - 2 ) / 2 }$ , the agent needs distinguish two transition distributions + +$$ +p _ { 1 } = { \left\{ \begin{array} { l l } { s _ { H } ^ { + } } & { { \mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\ { s _ { H } ^ { - } } & { { \mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \end{array} \right. } +$$ + +and + +$$ +p _ { 2 } = \left\{ s _ { H } ^ { + } \quad \mathrm { w i t h } \mathrm { p r o b a b i l i t y } ( 1 + \hat { d } ^ { - ( H - 2 ) / 2 } ) / 2 \right. +$$ + +Again, by Lemma B.1, in order to distinguish $p _ { 1 }$ and $p _ { 2 }$ with probability at least 0.9, one needs $\Omega ( \hat { d } ^ { H - 2 } )$ samples. Formally, we have the following theorem. + +Theorem C.1. Suppose Assumption 2 holds, and rewards are deterministic and could be nonezero only for state-action pairs in the last level. Fix an algorithm that takes as input both a policy and a feature mapping. There exists an MDP satisfying Assumption 5, such that for a fixed policy $\pi : { \mathcal { S } } A$ , the algorithm requires $\Omega ( ( d / 2 - 1 ) ^ { H / 2 } )$ samples to output the value of π up to constant additive approximation error with probability at least 0.9. + +# D ANALYSIS OF ALGORITHM 1 + +D.1 PROOF OF LEMMA 5.1 + +Clearly, + +For the first te + +$$ +\begin{array} { r l } & { \frac { 1 } { \sqrt { 3 } } \sum _ { k \geq 0 , k \leq 1 } \bar { \zeta } _ { k } \bigg ( \frac { 1 } { 2 } \eta _ { k } ^ { 2 } \bigg ( \mathbb { E } _ { k } \| \hat { \zeta } _ { k } \| ^ { 2 } \eta _ { k } ^ { 2 } \bigg ( \mathbb { E } _ { k } \| \hat { \zeta } _ { k } \| ^ { 2 } \eta _ { k } ^ { 2 } \bigg ) \bigg ) } \\ & { \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 \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 \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 \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 \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 \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 \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 \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 \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 \end{array} +$$ + +Therefore, + +$$ +\begin{array} { l } { \displaystyle \hat { \theta } _ { 1 } - \theta _ { 1 } = ( \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } \xi _ { 1 } - \lambda \hat { \Lambda } _ { 1 } ^ { - 1 } \theta _ { 1 } ) + \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } ( \theta _ { 2 } - \hat { \theta } _ { 2 } ) } \\ { \displaystyle = ( \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } \xi _ { 1 } - \lambda \hat { \Lambda } _ { 1 } ^ { - 1 } \theta _ { 1 } ) + \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } ( \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \xi _ { 2 } - \lambda \hat { \Lambda } _ { 2 } ^ { - 1 } \theta _ { 2 } ) } \\ { \displaystyle \quad \quad + \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } ( \theta _ { 3 } - \hat { \theta } _ { 3 } ) } \\ { \displaystyle \quad = \ldots } \\ { \displaystyle \quad = \sum _ { h = 1 } ^ { H } \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } \ldots ( \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } \xi _ { h } - \lambda \hat { \Lambda } _ { h } ^ { - 1 } \theta _ { h } ) . } \end{array} +$$ + +Also note that + +$$ +\begin{array} { r } { ( Q ^ { \pi } ( s _ { 1 } , \pi ( s _ { 1 } ) ) - \hat { Q } ( s _ { 1 } , \pi ( s _ { 1 } ) ) ) ^ { 2 } = \| \theta _ { 1 } - \hat { \theta } _ { 1 } \| _ { \bar { \Lambda } _ { 1 } } ^ { 2 } . } \end{array} +$$ + +# D.2 PROOF OF THEOREM 5.2 + +By matrix concentration inequality (Tropp, 2015), we have the following lemma. + +Lemma D.1. For each $h \in [ H ]$ , with probability $1 - \delta / ( 4 H )$ , for some universal constant $C$ , we have + +$$ +\left\| \frac { 1 } { N } \Phi _ { h } ^ { \top } \Phi _ { h } - \Lambda _ { h } \right\| _ { 2 } \leq C \sqrt { d \log ( d H / \delta ) / N } . +$$ + +and + +$$ +\left\| \frac { 1 } { N } \overline { { \Phi } } _ { h + 1 } \overline { { \Phi } } _ { h + 1 } - \overline { { \Lambda } } _ { h + 1 } \right\| _ { 2 } \leq C \sqrt { d \log ( d H / \delta ) / N } . +$$ + +Therefore, since $\lambda = C H \sqrt { d \log ( d H / \delta ) N }$ , with probability $1 - \delta / ( 4 H )$ , we have + +$$ +\hat { \Lambda } _ { h } = \Phi _ { h } ^ { \top } \Phi _ { h } + \lambda I \succeq N \Lambda _ { h } . +$$ + +Note that + +$$ +\begin{array} { l } { \displaystyle ( { \mathcal Q } ^ { \pi } ( s _ { 1 } , \pi ( s _ { 1 } ) ) - \hat { Q } ( s _ { 1 } , \pi ( s _ { 1 } ) ) ) ^ { 2 } } \\ { \displaystyle \leq H \cdot \left( \sum _ { h = 1 } ^ { H } \left\| \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } \cdot \cdot \cdot ( \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } \xi _ { h } - \lambda \hat { \Lambda } _ { h } ^ { - 1 } \theta _ { h } ) \right\| _ { \overline { { \Lambda } } _ { 1 } } ^ { 2 } \right) } \\ { \displaystyle \leq 2 H \cdot \left( \sum _ { h = 1 } ^ { H } \left\| \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } \cdot \cdot \cdot \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } \xi _ { h } \right\| _ { \overline { { \Lambda } } _ { 1 } } ^ { 2 } + \sum _ { h = 1 } ^ { H } \left\| \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } \cdot \cdot \cdot \cdot \lambda \hat { \Lambda } _ { h } ^ { - 1 } \theta _ { h } \right\| _ { \overline { { \Lambda } } _ { 1 } } ^ { 2 } \right) } \end{array} +$$ + +For each $h \in [ H ]$ , + +$$ +\begin{array} { r l } & { \quad \| \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } \cdots \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } \xi _ { h } \| _ { \overline { { \Lambda } } _ { 1 } } ^ { 2 } } \\ & { \leq \| \Phi _ { 1 } \hat { \Lambda } _ { 1 } ^ { - 1 } \overline { { \Lambda } } _ { 1 } \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \| _ { 2 } \cdot \| \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } \cdots \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } \xi _ { h } \| _ { 2 } ^ { 2 } } \\ & { \leq \| \hat { \Lambda } _ { 1 } ^ { - 1 / 2 } \overline { { \Lambda } } _ { 1 } \hat { \Lambda } _ { 1 } ^ { - 1 / 2 } \| _ { 2 } \cdot \| \Phi _ { 1 } \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \| _ { 2 } \cdot \| \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 2 } \cdot \cdot \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } \xi _ { h } \| _ { 2 } ^ { 2 } } \\ & \leq \| \hat { \Lambda } _ { 1 } ^ { - 1 / 2 } \overline { { \Lambda } } _ { 1 } \hat { \Lambda } _ { 1 } ^ { - 1 / 2 } \| _ { 2 } \cdot \displaystyle \prod _ { h ^ { \prime } = 1 } ^ { h - 1 } \Big ( \| \Phi _ { h ^ { \prime } } \hat { \Lambda } _ { h ^ { \prime } } ^ { - 1 } \Phi _ { h ^ { \prime } } ^ { \top } \| _ { 2 } \cdot \| \hat { \Phi } _ { h ^ { \prime } + 1 } ^ { - 1 / 2 } ( \overline { { \Phi } } _ { h ^ { \prime } + 1 } ^ { \top } \overline { { \Phi } } _ { h ^ { \prime } + 1 } ) \hat { \Lambda } _ h ^ { \prime } \end{array} +$$ + +Similarly, + +$$ +\begin{array} { r l } & { \quad \| \hat { \boldsymbol { \Lambda } } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \boldsymbol { \Lambda } } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } \cdot \cdot \lambda \hat { \boldsymbol { \Lambda } } _ { h } ^ { - 1 } \theta _ { h } \| _ { \overline { { \boldsymbol { \Lambda } } } _ { 1 } } ^ { 2 } } \\ & { \leq \| \hat { \boldsymbol { \Lambda } } _ { 1 } ^ { - 1 / 2 } \overline { { \boldsymbol { \Lambda } } } _ { 1 } \hat { \boldsymbol { \Lambda } } _ { 1 } ^ { - 1 / 2 } \| _ { 2 } \cdot \displaystyle \prod _ { h ^ { \prime } = 1 } ^ { h - 1 } \Big ( \| \Phi _ { h ^ { \prime } } \hat { \boldsymbol { \Lambda } } _ { h ^ { \prime } } ^ { - 1 } \Phi _ { h ^ { \prime } } ^ { \top } \| _ { 2 } \cdot \| \hat { \boldsymbol { \Lambda } } _ { h ^ { \prime } + 1 } ^ { - 1 / 2 } ( \overline { { \Phi } } _ { h ^ { \prime } + 1 } ^ { \top } \overline { { \Phi } } _ { h ^ { \prime } + 1 } ) \hat { \boldsymbol { \Lambda } } _ { h + 1 } ^ { - 1 / 2 } \| _ { 2 } \Big ) \cdot \lambda ^ { 2 } \cdot \| \theta _ { h } \| _ { \hat { \boldsymbol { \Lambda } } _ { h } ^ { - 1 } } ^ { 2 } } \\ & { \leq \| \hat { \boldsymbol { \Lambda } } _ { 1 } ^ { - 1 / 2 } \overline { { \boldsymbol { \Lambda } } } _ { 1 } \hat { \boldsymbol { \Lambda } } _ { 1 } ^ { - 1 / 2 } \| _ { 2 } \cdot \displaystyle \prod _ { h ^ { \prime } = 1 } ^ { h - 1 } \Big ( \| \Phi _ { h ^ { \prime } } \hat { \boldsymbol { \Lambda } } _ { h ^ { \prime } } ^ { - 1 } \Phi _ { h ^ { \prime } } ^ { \top } \| _ { 2 } \cdot \| \hat { \boldsymbol { \Lambda } } _ { h ^ { \prime } + 1 } ^ { - 1 / 2 } ( \overline { { \Phi } } _ { h ^ { \prime } + 1 } ^ { \top } \overline { { \Phi } } _ { h ^ { \prime } + 1 } ) \hat { \boldsymbol { \Lambda } } _ { h ^ { \prime } + 1 } ^ { - 1 / 2 } \| _ { 2 } \cdot \lambda \cdot H ^ { 2 } d . } \end{array} +$$ + +For all $h \in [ H ]$ , we have + +$$ +\| \Phi _ { h } \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } \| _ { 2 } \leq 1 +$$ + +and + +$$ +\begin{array} { r } { \lVert \hat { \Lambda } _ { h } ^ { - 1 / 2 } ( \overline { { \Phi } } _ { h } ^ { \top } \overline { { \Phi } } _ { h } ) \hat { \Lambda } _ { h } ^ { - 1 / 2 } \rVert _ { 2 } \leq \lVert N \hat { \Lambda } _ { h } ^ { - 1 / 2 } \overline { { \Lambda } } _ { h } \hat { \Lambda } _ { h } ^ { - 1 / 2 } \rVert _ { 2 } + \lVert \hat { \Lambda } _ { h } ^ { - 1 / 2 } ( \overline { { \Phi } } _ { h } ^ { \top } \overline { { \Phi } } _ { h } - N \overline { { \Lambda } } _ { h } ) \hat { \Lambda } _ { h } ^ { - 1 / 2 } \rVert _ { 2 } . } \end{array} +$$ + +Conditioned on the event in Lemma D.1, + +$$ +\hat { \Lambda } _ { h } \succeq N \Lambda _ { h } \succeq \frac { N } { C _ { h } } \overline { { \Lambda } } _ { h } , +$$ + +which implies $\| N \hat { \Lambda } _ { h } ^ { - 1 / 2 } \overline { { \Lambda } } _ { h } \hat { \Lambda } _ { h } ^ { - 1 / 2 } \| \le C _ { h }$ . Moreover, conditioned on the event in Lemma D.1, + +$$ +\begin{array} { r } { \| \hat { \boldsymbol { \Lambda } } _ { h } ^ { - 1 / 2 } ( \overline { { \Phi } } _ { h } ^ { \top } \overline { { \Phi } } _ { h } - N \overline { { \boldsymbol { \Lambda } } } _ { h } ) \hat { \boldsymbol { \Lambda } } _ { h } ^ { - 1 / 2 } \| _ { 2 } \leq C \sqrt { d \log ( d H / \delta ) N } / \lambda . } \end{array} +$$ + +Thus, + +$$ +\| \hat { \boldsymbol { \Lambda } } _ { 1 } ^ { - 1 / 2 } \overline { { \boldsymbol { \Lambda } } } _ { 1 } \hat { \boldsymbol { \Lambda } } _ { 1 } ^ { - 1 / 2 } \| _ { 2 } \leq C _ { 1 } / N . +$$ + +and + +$$ +\begin{array} { r } { \| \hat { \boldsymbol \Lambda } _ { h } ^ { - 1 / 2 } ( \overline { { \Phi } } _ { h } ^ { \top } \overline { { \Phi } } _ { h } ) \hat { \boldsymbol \Lambda } _ { h } ^ { - 1 / 2 } \| _ { 2 } \leq C _ { h } + C \sqrt { d \log ( d H / \delta ) N } / \lambda . } \end{array} +$$ + +Finally, by Theorem 1.2 in (Hsu et al., 2012a), with probability $1 - \delta / ( 4 H )$ , for some constant $C ^ { \prime }$ , we have + +$$ +\begin{array} { r } { \| \xi _ { h } \| _ { \Phi _ { h } \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } } ^ { 2 } \le C ^ { \prime } H ^ { 2 } d \log ( H / \delta ) . } \end{array} +$$ + +Therefore, + +$$ +\begin{array} { r l } & { \quad \quad \left\| \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } \cdots \hat { \Lambda } _ { h } ^ { - 1 } \Phi _ { h } ^ { \top } \xi _ { h } \right\| _ { \overline { { \Lambda } } _ { 1 } } ^ { 2 } + \left\| \hat { \Lambda } _ { 1 } ^ { - 1 } \Phi _ { 1 } ^ { \top } \overline { { \Phi } } _ { 2 } \hat { \Lambda } _ { 2 } ^ { - 1 } \Phi _ { 2 } ^ { \top } \overline { { \Phi } } _ { 3 } \cdots \lambda \hat { \Lambda } _ { h } ^ { - 1 } \theta _ { h } \right\| _ { \overline { { \Lambda } } _ { 1 } } ^ { 2 } } \\ & { \leq \frac { C _ { 1 } } { N } ( C _ { 2 } + C \sqrt { d \log ( d / \delta ) N } / \lambda ) \times \cdots \times ( C _ { h } + C \sqrt { d \log ( d / \delta ) N } / \lambda ) \times ( C ^ { \prime } H ^ { 2 } d \log ( H / \delta ) + \lambda H } \\ & { \leq \frac { C _ { 1 } } { N } ( C _ { 2 } + 1 / H ) \times \cdots \times ( C _ { h } + 1 / H ) \times ( C ^ { \prime } H ^ { 2 } d \log ( H / \delta ) + \lambda H ^ { 2 } d ) } \\ & { \leq \frac { e } { N } C _ { 1 } \times C _ { 2 } \times \cdots \times C _ { h } \times ( C ^ { \prime } H ^ { 2 } d \log ( H / \delta ) + C d H ^ { 3 } \sqrt { d \log ( d H / \delta ) N } ) . } \end{array} +$$ + +Let $c > 0$ be a large enough constant. We now have + +$$ +\mathbb { E } _ { s _ { 1 } } [ ( Q _ { 1 } ^ { \pi } ( s _ { 1 } , \pi ( s _ { 1 } ) ) - \hat { Q } _ { 1 } ( s _ { 1 } , \pi ( s _ { 1 } ) ) ) ^ { 2 } ] \leq c \cdot \left( \prod _ { h = 1 } ^ { H } C _ { h } \right) \cdot d H ^ { 5 } \cdot \sqrt { \frac { d \log ( d H / \delta ) } { N } } . +$$ \ No newline at end of file diff --git a/parse/train/30EvkP2aQLD/30EvkP2aQLD_content_list.json b/parse/train/30EvkP2aQLD/30EvkP2aQLD_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..4059f1648204f808d1f05aa505a7ce688165baa8 --- /dev/null +++ b/parse/train/30EvkP2aQLD/30EvkP2aQLD_content_list.json @@ -0,0 +1,3002 @@ +[ + { + "type": "text", + "text": "WHAT ARE THE STATISTICAL LIMITS OF OFFLINE RL WITH LINEAR FUNCTION APPROXIMATION? ", + "text_level": 1, + "bbox": [ + 176, + 99, + 813, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Ruosong Wang Carnegie Mellon University ruosongw@andrew.cmu.edu ", + "bbox": [ + 184, + 170, + 411, + 212 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Dean P. Foster \nUniversity of Pennsylvania and Amazon \ndean@foster.net \nSham M. Kakade \nUniversity of Washington, Seattle and Microsoft Research \nsham@cs.washington.edu ", + "bbox": [ + 549, + 170, + 813, + 212 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 183, + 233, + 565, + 275 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 311, + 544, + 327 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Offline reinforcement learning seeks to utilize offline (observational) data to guide the learning of (causal) sequential decision making strategies. The hope is that offline reinforcement learning coupled with function approximation methods (to deal with the curse of dimensionality) can provide a means to help alleviate the excessive sample complexity burden in modern sequential decision making problems. However, the extent to which this broader approach can be effective is not well understood, where the literature largely consists of sufficient conditions. ", + "bbox": [ + 233, + 343, + 764, + 440 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "This work focuses on the basic question of what are necessary representational and distributional conditions that permit provable sample-efficient offline reinforcement learning. Perhaps surprisingly, our main result shows that even if: i) we have realizability in that the true value function of every policy is linear in a given set of features and 2) our off-policy data has good coverage over all features (under a strong spectral condition), any algorithm still (information-theoretically) requires a number of offline samples that is exponential in the problem horizon to nontrivially estimate the value of any given policy. Our results highlight that sampleefficient offline policy evaluation is not possible unless significantly stronger conditions hold; such conditions include either having low distribution shift (where the offline data distribution is close to the distribution of the policy to be evaluated) or significantly stronger representational conditions (beyond realizability). ", + "bbox": [ + 233, + 443, + 764, + 608 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 635, + 336, + 651 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Offline methods (also known as off-policy methods or batch methods) are a promising methodology to alleviate the sample complexity burden in challenging reinforcement learning (RL) settings, particularly those where sample efficiency is paramount (Mandel et al., 2014; Gottesman et al., 2018; Wang et al., 2018; Yu et al., 2019). Off-policy methods are often applied together with function approximation schemes; such methods take sample transition data and reward values as inputs, and approximate the value of a target policy or the value function of the optimal policy. Indeed, many practical deep RL algorithms find their prototypes in the literature of offline RL. For example, when running on off-policy data (sometimes termed as “experience replay”), deep $Q$ -networks (DQN) (Mnih et al., 2015) can be viewed as an analog of Fitted $Q$ -Iteration (Gordon, 1999) with neural networks being the function approximators. More recently, there are an increasing number of both model-free (Laroche et al., 2019; Fujimoto et al., 2019; Jaques et al., 2020; Kumar et al., 2019; Agarwal et al., 2020) and model-based (Ross & Bagnell, 2012; Kidambi et al., 2020) offline RL methods, with steady improvements in performance (Fujimoto et al., 2019; Kumar et al., 2019; Wu et al., 2020; Kidambi et al., 2020). ", + "bbox": [ + 174, + 666, + 825, + 861 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "However, despite the importance of these methods, the extent to which data reuse is possible, especially when off-policy methods are combined with function approximation, is not well understood. For example, deep $Q$ -network requires millions of samples to solve certain Atari games (Mnih et al., 2015). Also important is that in some safety-critical settings, we seek guarantees when offlinetrained policies can be effective (Thomas, 2014; Thomas et al., 2019). A basic question here is that if there are fundamental statistical limits on such methods, where sample-efficient offline RL is simply not possible without further restrictions on the problem. ", + "bbox": [ + 174, + 868, + 823, + 924 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 145 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In the context of supervised learning, it is well-known that empirical risk minimization is sampleefficient if the hypothesis class has bounded complexity. For example, suppose the agent is given a $d$ -dimensional feature extractor, and the ground truth labeling function is a (realizable) linear function with respect to the feature mapping. Here, it is well-known that a polynomial number of samples in $d$ suffice for a given target accuracy. Furthermore, in this realizable case, provided the training data has a good feature coverage, then we will have good accuracy against any test distribution.1 ", + "bbox": [ + 174, + 152, + 825, + 250 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In the more challenging offline RL setting, it is unclear if sample-efficient methods are possible, even under analogous assumptions. This is our motivation to consider the following question: ", + "bbox": [ + 171, + 257, + 823, + 285 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "What are the statistical limits for offline RL with linear function approximation? ", + "text_level": 1, + "bbox": [ + 217, + 297, + 779, + 313 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Here, one may hope that value estimation for a given policy is possible in the offline RL setting under the analogous set of assumptions that enable sample-efficient supervised learning, i.e., 1) (realizability) the features can perfectly represent the value functions and 2) (good coverage) the feature covariance matrix of our off-policy data has lower bounded eigenvalues. ", + "bbox": [ + 174, + 324, + 825, + 380 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The extant body of provable methods on offline RL either make representational assumptions that are far stronger than realizability or assume distribution shift conditions that are far stronger than having coverage with regards to the spectrum of the feature covariance matrix of the data distribution. For example, Szepesvari & Munos (2005) analyze offline RL methods by assuming a representational ´ condition where the features satisfy (approximate) closedness under Bellman updates, which is a far stronger representation condition than realizability. Recently, Xie & Jiang (2020a) propose a offline RL algorithm that only requires realizability as the representation condition. However, the algorithm in (Xie & Jiang, 2020a) requires a more stringent data distribution condition. Whether it is possible to design a sample-efficient offline RL method under the realizability assumption and a reasonable data coverage assumption — an open problem in (Chen & Jiang, 2019) — is the focus of this work. ", + "bbox": [ + 174, + 387, + 825, + 526 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our Contributions. Perhaps surprisingly, our main result shows that, under only the above two assumptions, it is information-theoretically not possible to design a sample-efficient algorithm to non-trivially estimate the value of a given policy. The following theorem is an informal version of the result in Section 4. ", + "bbox": [ + 174, + 542, + 825, + 598 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Theorem 1.1 (Informal). In the offline RL setting, suppose the data distributions have (polynomially) lower bounded eigenvalues, and the $Q$ -functions of every policy are linear with respect to a given feature mapping. Any algorithm requires an exponential number of samples in the horizon $H$ to output a non-trivially accurate estimate of the value of any given policy $\\pi$ , with constant probability. ", + "bbox": [ + 174, + 603, + 825, + 672 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "This hardness result states that even if the $Q$ -functions of all polices are linear with respect to the given feature mapping, we still require an exponential number of samples to evaluate any given policy. Note that this representation condition is significantly stronger than assuming realizability with regards to only a single target policy; it assumes realizability for all policies. Regardless, even under this stronger representation condition, it is hard to evaluate any policy, as specified in our hardness result. ", + "bbox": [ + 174, + 685, + 825, + 768 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "This result also formalizes a key issue in offline reinforcement learning with function approximation: geometric error amplification. To better illustrate the issue, in Section 5, we analyze the classical Least-Squares Policy Evaluation (LSPE) algorithm under the realizability assumption, which demonstrates how the error propagates as the algorithm proceeds. Here, our analysis shows that, if we only rely on the realizability assumption, then a far more stringent condition is required for sample-efficient offline policy evaluation: the off-policy data distribution must be quite close to the distribution induced by the policy to be evaluated. ", + "bbox": [ + 173, + 775, + 825, + 873 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our results highlight that sample-efficient offline RL is simply not possible unless either the distribution shift condition is sufficiently mild or we have stronger representation conditions that go well beyond realizability. See Section 5 for more details. ", + "bbox": [ + 174, + 103, + 823, + 145 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Furthermore, our hardness result implies an exponential separation on the sample complexity between offline RL and supervised learning, since supervised learning (which is equivalent to offline RL with $H = 1$ ) is possible with polynomial number of samples under the same set of assumptions. ", + "bbox": [ + 176, + 152, + 820, + 195 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "A few additional points are worth emphasizing with regards to our lower bound construction: ", + "bbox": [ + 176, + 202, + 782, + 217 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "• Our results imply that Least-Squares Policy Evaluation (LSPE, i.e., using Bellman backups with linear regression) will fail. Interestingly, while LSPE will provide an unbiased estimator, our results imply that it will have exponential variance in the problem horizon. \nOur construction is simple and does not rely on having a large state or action space: the size of the state space is only $O ( d \\cdot H )$ where $d$ is the feature dimension and $H$ is the planning horizon, and the size of the action space is only is 2. This stands in contrast to other RL lower bounds, which typically require state spaces that are exponential in the problem horizon (e.g. see (Du et al., 2020)). \n• We provide two hard instances, one with a sparse reward (and stochastic transitions) and another with deterministic dynamics (and stochastic rewards). These two hard instances jointly imply that both the estimation error on reward values and the estimation error on the transition probabilities could be geometrically amplified in offline RL. Of possibly broader interest is that our hard instances are, to our knowledge, the first concrete examples showing that geometric error amplification is real in RL problems (even with realizability). While this is a known concern in the analysis of RL algorithms, there have been no concrete examples exhibiting such behavior under only a realizability assumption. ", + "bbox": [ + 173, + 223, + 826, + 445 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 477, + 344, + 492 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We now survey prior work on offline RL, largely focusing on theoretical results. We also discuss results on the error amplification issue in RL. Concurrent to this work, Xie & Jiang (2020a) propose a offline RL algorithm under the realizability assumption, which requires stronger distribution shift conditions. We will discuss this work shortly. ", + "bbox": [ + 174, + 515, + 825, + 570 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Existing Algorithms and Analysis. Offline RL with value function approximation is closely related to Approximate Dynamic Programming (Bertsekas & Tsitsiklis, 1995). Existing work (Munos, 2003; Szepesvari & Munos, 2005; Antos et al., 2008; Munos & Szepesv ´ ari, 2008; Tosatto et al., ´ 2017; Xie & Jiang, 2020b; Duan & Wang, 2020) that analyze the sample complexity of approximate dynamic programming-based approaches usually make the following two categories of assumptions: (i) representation conditions that assume the function class approximates the value functions well and (ii) distribution shift conditions that assume the given data distribution has sufficient coverage over the state-action space. As mentioned in the introduction, the desired representation condition would be realizability, which only assumes the value function of the policy to be evaluated lies in the function class (for the case of offline policy evaluation) or the optimal value function lies in the function class (for the case of finding near-optimal policies), and existing works usually make stronger assumptions. For example, Szepesvari & Munos (2005); Duan & Wang (2020) assume (ap- ´ proximate) closedness under Bellman updates, which is much stronger than realizability. Whether it is possible to design a sample-efficient offline RL method under the realizability assumption and reasonable data coverage assumption, is left as an open problem in (Chen & Jiang, 2019). ", + "bbox": [ + 174, + 597, + 825, + 805 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To measure the coverage over the state-action space of the given data distribution, existing works assume the concentrability coefficient (introduced by Munos (2003)) to be bounded. The concentrability coefficient, informally speaking, is the largest possible ratio between the probability for a state-action pair $( s , a )$ to be visited by a policy, and the probability that $( s , a )$ appears on the data distribution. Since we work with linear function approximation in this work, we measure the distribution shift in terms of the spectrum of the feature covariance matrices (see Assumption 2), which is a well-known sufficient condition in the context of supervised learning and is much more natural for the case of linear function approximation. ", + "bbox": [ + 174, + 813, + 823, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Concurrent to this work, Xie & Jiang (2020a) propose an algorithm that works under the realizability assumption instead of other stronger representation conditions used in prior work. However, the algorithm in (Xie & Jiang, 2020a) requires a much stronger data distribution condition which assumes a stringent version of concentrability coefficient introduced by (Munos, 2003) to be bounded. In contrast, in this work we measure the distribution shift in terms of the spectrum of the feature covariance matrix of the data distribution, which is more natural than the concentrability coefficient for the case of linear function approximation. ", + "bbox": [ + 174, + 103, + 825, + 200 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Recently, there has been great interest in approaching offline policy evaluation (Precup, 2000) via importance sampling. For recent work on this topic, see (Dud´ık et al., 2011; Mandel et al., 2014; Thomas et al., 2015; Li et al., 2015; Jiang & Li, 2016; Thomas & Brunskill, 2016; Guo et al., 2017; Wang et al., 2017; Liu et al., 2018; Farajtabar et al., 2018; Xie et al., 2019; Kallus & Uehara, 2019; Liu et al., 2019; Uehara & Jiang, 2019; Kallus & Uehara, 2020; Jiang & Huang, 2020; Feng et al., 2020). Offline policy evaluation with importance sampling incurs exponential variance in the planning horizon when the behavior policy is significantly different from the policy to be evaluated. Bypassing such exponential dependency requires non-trivial function approximation assumptions (Jiang & Huang, 2020; Feng et al., 2020; Liu et al., 2018). Finally, Kidambi et al. (2020) provide a model-based offline RL algorithm, with a theoretical analysis based on hitting times. ", + "bbox": [ + 174, + 208, + 825, + 347 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Hardness Results. Algorithm-specific hardness results have been known for a long time in the literature of Approximate Dynamic Programming. See Chapter 4 in (Van Roy, 1994) and also (Gordon, 1995; Tsitsiklis & Van Roy, 1996). These works demonstrate that certain approximate dynamic programming-based methods will diverge on hard cases. However, such hardness results only hold for a restricted class of algorithms, and to demonstrate the fundamental difficulty of offline RL, it is more desirable to obtain information-theoretic lower bounds as initiated by Chen & Jiang (2019). ", + "bbox": [ + 174, + 364, + 825, + 448 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Existing (information-theoretic) exponential lower bounds (Krishnamurthy et al., 2016; Sun et al., 2017; Chen & Jiang, 2019) usually construct unstructured MDPs with an exponentially large state space. Du et al. (2020) prove an exponential lower bound under the assumption that the optimal $Q$ - function is approximately linear. The condition that the optimal $Q$ -function is only approximately linear is crucial for the hardness result in Du et al. (2020). The techniques in (Du et al., 2020) are later generalized to other settings (Kumar et al., 2020; Wang et al., 2020; Mou et al., 2020). ", + "bbox": [ + 174, + 455, + 825, + 539 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Error Amplification In RL. Error amplification induced by distribution shift and long planning horizon is a known issue in the theoretical analysis of RL algorithms. See (Gordon, 1995; 1996; Munos & Moore, 1999; Ormoneit & Sen, 2002; Kakade, 2003; Zanette et al., 2019) for papers on this topic and additional assumptions that mitigate this issue. Error amplification in offline RL is also observed in empirical works (see e.g. (Fujimoto et al., 2019)). In this work, we provide the first information-theoretic lower bound showing that geometric error amplification is real in offline RL. ", + "bbox": [ + 174, + 556, + 825, + 640 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 THE OFFLINE POLICY EVALUATION PROBLEM ", + "text_level": 1, + "bbox": [ + 174, + 662, + 589, + 679 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Throughout this paper, for a given integer $H$ , we use $[ H ]$ to denote the set $\\{ 1 , 2 , \\ldots , H \\}$ ", + "bbox": [ + 173, + 695, + 756, + 710 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Episodic Reinforcement Learning. Let $M = ( \\mathcal { S } , \\mathcal { A } , P , R , H )$ be a Markov Decision Process (MDP) where $s$ is the state space, $\\mathcal { A }$ is the action space, $P : \\mathcal { S } \\times \\mathcal { A } \\Delta ( \\mathcal { S } )$ is the transition operator which takes a state-action pair and returns a distribution over states, $\\Dot { R : } \\Dot { S } \\times \\mathcal { A } \\Delta ( \\mathbb { R } )$ is the reward distribution, $H \\in \\mathbb { Z } _ { + }$ is the planning horizon. For simplicity, we assume a fixed initial state $s _ { 1 } \\in { \\mathcal { S } }$ . A (stochastic) policy $\\pi : S \\Delta ( { \\mathcal { A } } )$ chooses an action $a$ randomly based on the current state $s$ . The policy $\\pi$ induces a (random) trajectory $s _ { 1 } , a _ { 1 } , r _ { 1 } , s _ { 2 } , a _ { 2 } , r _ { 2 } , \\ldots , s _ { H } , a _ { H } , r _ { H }$ , where $a _ { 1 } \\sim \\pi _ { 1 } ( s _ { 1 } )$ , $r _ { 1 } \\sim R ( s _ { 1 } , a _ { 1 } )$ , $s _ { 2 } \\sim P ( s _ { 1 } , a _ { 1 } )$ , $a _ { 2 } \\sim \\pi _ { 2 } ( s _ { 2 } )$ , etc. To streamline our analysis, for each $h \\in [ H ]$ , we use $S _ { h } \\subseteq S$ to denote the set of states at level $h$ , and we assume $S _ { h }$ do not intersect with each other. We assume, almost surely, that $r _ { h } \\in [ - 1 , 1 ]$ for all $h \\in [ H ]$ . ", + "bbox": [ + 173, + 727, + 825, + 854 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Value Functions. Given a policy $\\begin{array} { r } { \\mathbb { E } \\left[ \\sum _ { h ^ { \\prime } = h } ^ { H } r _ { h ^ { \\prime } } \\mid s _ { h } = s , a _ { h } = a , \\pi \\right] } \\end{array}$ an d , $\\textit { h } \\in \\ [ H ]$ $\\begin{array} { r } { V _ { h } ^ { \\pi } ( s ) = \\mathbb { E } \\left[ \\sum _ { h ^ { \\prime } = h } ^ { H } r _ { h ^ { \\prime } } \\mid s _ { h } = s , \\pi \\right] } \\end{array}$ and $( s , a ) \\in S _ { h } \\times \\mathcal { A }$ , define h. For a policy $Q _ { h } ^ { \\pi } ( s , a ) \\ =$ $\\pi$ , we define $V ^ { \\pi } = V _ { 1 } ^ { \\pi } ( s _ { 1 } )$ to be the value of $\\pi$ from the fixed initial state $s _ { 1 }$ . ", + "bbox": [ + 174, + 869, + 823, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Linear Function Approximation. When applying linear function approximation schemes, it is commonly assumed that the agent is given a feature extractor $\\phi : \\mathcal { S } \\times \\bar { \\mathcal { A } } \\mathbb { R } ^ { d }$ which can either be hand-crafted or a pre-trained neural network that transforms a state-action pair to a $d$ -dimensional embedding, and the $Q$ -functions can be predicted by linear functions of the features. In this paper, we are interested in the following realizability assumption. ", + "bbox": [ + 173, + 103, + 825, + 174 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Assumption 1 (Realizable Linear Function Approximation). For every policy $\\pi : S \\Delta ( { \\mathcal { A } } )$ , there exists $\\theta _ { 1 } ^ { \\pi } , \\ldots \\theta _ { H } ^ { \\pi } \\in \\mathbb { R } ^ { d }$ such that for all $( s , a ) \\in S \\times A$ and $h \\in [ H ] , Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a ) .$ . ", + "bbox": [ + 174, + 178, + 818, + 210 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Note that our assumption is much stronger than assuming realizability with regards to a single policy $\\pi$ (say the policy that we wish to evaluate); our assumption imposes realizability for all policies. ", + "bbox": [ + 173, + 222, + 825, + 251 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Offline Reinforcement Learning. This paper is concerned with the offline RL setting. In this setting, thtributions $\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }$ oes not have dirwhere for each $h \\in [ H ]$ , $\\mu _ { h } \\in \\Delta ( S _ { h } \\times \\mathcal { A } )$ stead is given access to data d. The inputs of the agent are $H$ datasets $\\{ D _ { h } \\} _ { h = 1 } ^ { H }$ 1 , and for each $h \\in [ H ]$ , $D _ { h }$ consists i.i.d. samples of the form $( s , a , r , s ^ { \\prime } ) \\in$ $S _ { h } \\times \\mathcal { A } \\times \\mathbb { R } \\times \\mathcal { S } _ { h + 1 }$ tuples, where $( s , \\dot { a } ) \\stackrel { . } { \\sim } \\mu _ { h } , r \\sim r ( s , a ) , s ^ { \\prime } \\sim \\bar { P ( } s , a ) $ . ", + "bbox": [ + 173, + 265, + 825, + 338 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this paper, we focus on the offline policy evaluation problem with linear function approximation: given a policy accurate estim $\\pi : S \\Delta ( { \\mathcal { A } } )$ f $\\pi$ d a fe(i.e., $V ^ { \\pi }$ re extractor ) approxima $\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }$ , the goal is toected datasets $\\{ D _ { h } \\} _ { h = 1 } ^ { H }$ with as few samples as possible. ", + "bbox": [ + 174, + 343, + 825, + 400 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Notation. For a vector $x \\in \\mathbb { R } ^ { d }$ , we use $\\lVert x \\rVert _ { 2 }$ to denote its $\\ell _ { 2 }$ norm. For a positive semidefinite matrix $A$ , we use $\\| A \\| _ { 2 }$ to denote its operator norm, and $\\sigma _ { \\mathrm { m i n } } ( A )$ to denote its smallest eigenvalue. For two positive semidefinite matrices $A$ and $B$ , we write $A \\succeq B$ to denote the Lowner partial ¨ ordering of matrices, i.e, $A \\succeq B$ if and only if $A - B$ is positive semidefinite. For a policy $\\pi : { \\cal { S } } $ $\\Delta \\left( \\mathcal { A } \\right)$ , we use $\\mu _ { h } ^ { \\pi }$ to denote the marginal distribution of $s _ { h }$ under $\\pi$ , i.e., $\\mu _ { h } ^ { \\pi } ( s ) = \\operatorname* { P r } [ s _ { h } = s \\mid \\pi ]$ . For a vector $x \\in \\mathbb { R } ^ { d }$ and a positive semidefinite matrix $A \\in \\mathbb { R } ^ { d \\times d }$ , we use $\\| x \\| _ { A }$ to denote $\\sqrt { x ^ { \\top } A x }$ . ", + "bbox": [ + 173, + 415, + 825, + 503 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 THE LOWER BOUND: REALIZABILITY AND COVERAGE ARE INSUFFICIENT ", + "text_level": 1, + "bbox": [ + 173, + 523, + 821, + 540 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We now present our main hardness result for offline policy evaluation with linear function approximation. It should be evident that without feature coverage in our dataset, realizability alone is clearly not sufficient for sample-efficient estimation. Here, we will make the strongest possible assumption, with regards to the conditioning of the feature covariance matrix. ", + "bbox": [ + 174, + 555, + 825, + 612 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Assumption 2 (Feature Coverage). For all $( s , a ) \\in S \\times A ,$ , assume our feature map is bounded such that $\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1$ . Furthermore, suppose for each $h \\in [ H ]$ , the data distributions $\\mu _ { h }$ satisfy the following minimum eigenvalue condition: $\\sigma _ { \\mathrm { m i n } } \\left( \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } [ \\dot { \\phi } ( \\dot { s } , a ) \\phi ( s , a ) ^ { \\top } ] \\right) = 1 / d .$ . 2 ", + "bbox": [ + 174, + 616, + 825, + 661 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Clearly, for the case where $H = 1$ , the realizability assumption (Assumption 1), and feature coverage assumption (Assumption 2) imply that the ordinary least squares estimator will accurately estimate $\\theta _ { 1 }$ .3 Our main result now shows that these assumptions are not sufficient for offline policy evaluation for long horizon problems. ", + "bbox": [ + 174, + 671, + 825, + 728 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Theorem 4.1. Suppose Assumption 2 holds. Fix an algorithm that takes as input both a policy and $a$ feature mapping. There exists a (deterministic) MDP satisfying Assumption $^ { l }$ , such that for any policy $\\pi : S \\Delta ( { \\mathcal { A } } )$ , the algorithm requires $\\Omega ( ( d / 2 ) ^ { H } )$ samples to output the value of $\\pi$ up to constant additive approximation error with probability at least 0.9. ", + "bbox": [ + 173, + 732, + 825, + 789 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Although we focus on offline policy evaluation in this work, our hardness result also holds for finding near-optimal policies under Assumption 1 in the offline RL setting. Below we give a simple reduction. At the initial state, if the agent chooses action $a _ { 1 }$ , then the agent receives a fixed reward value (say 0.5) and terminates. If the agent chooses action $a _ { 2 }$ , then the agent transits to our hard instance. In order to find a policy with suboptimality at most 0.5, the agent must evaluate the value of the optimal policy in our hard instance up to an error of 0.5, and hence the hardness result holds. ", + "bbox": [ + 173, + 800, + 825, + 857 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Remark 1 (The sparse reward case). As stated, the theorem uses a deterministic MDP (with stochastic rewards). See Appendix C for another hard case where the transition is stochastic and the reward is deterministic and sparse (only occurring at two states at $h = H$ ). ", + "bbox": [ + 174, + 137, + 825, + 179 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Remark 2 (Least-Squares Policy Evaluation (LSPE) has exponential variance). For offline policy evaluation with linear function approximation, the most na¨ıve algorithm here would be LSPE, i.e., using ordinary least squares (OLS) to estimate $\\theta ^ { \\pi }$ , starting at level $h = H$ and then proceeding backwards to level $h = 1$ , using the plug-in estimator from the previous level. Here, LSPE will provide an unbiased estimate (provided the feature covariance matrices are full rank, which will occur with high probability). As a direct corollary, the above theorem implies that LSPE has exponential variance in $H$ . See Section 5 for a more detailed discussion on LSPE. More generally, our theorem implies that there is no estimator that can avoid such exponential dependence in the offline setting. ", + "bbox": [ + 173, + 184, + 825, + 295 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Remark 3 (Least-Squares Value Iteration (LSVI) versus Least-Squares Policy Iteration (LSPI)). In the offline setting, under Assumptions 1 and 2, in order to find a near-optimal policy, the most na¨ıve algorithm would be LSVI, i.e., using ordinary least squares (OLS) to estimate $\\theta ^ { * }$ , starting at level $h = H$ and then proceeding backwards to level $h = 1$ , using the plug-in estimator from the previous level and the bellman operator. The above theorem implies that LSVI will require an exponential number of samples to find a near-optimal policy. On the other hand, if the regression targets are collected by using rollouts (i.e. on-policy sampling) as in LSPI (Lagoudakis & Parr, 2003), then a polynomial number of samples suffice. See Section D in (Du et al., 2020) for an analysis. Thus, Theorem 4.1 implies an exponential separation on the sample complexity between LSVI and LSPI. Of course, LSPI requires adaptive data samples and thus does not work in the offline setting. ", + "bbox": [ + 173, + 299, + 825, + 439 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "One may wonder if Theorem 4.1 still holds when the data distributions $\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }$ are induced by a policy. In Appendix C, we prove another exponential sample complexity lower bound under the additional assumption that the data distributions are induced by a fixed policy $\\pi$ . However, under such an assumption, it is impossible to prove a hardness result as strong as Theorem 4.1 (which shows that evaluating any policy is hard), since one can at least evaluate the policy $\\pi$ that induces the data distributions. Nevertheless, we are able to prove the hardness of offline policy evaluation, under a weaker version of Assumption 1. See Appendix $\\textrm { C }$ for more details. ", + "bbox": [ + 173, + 452, + 825, + 549 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In the remaining part of this section, we give the hard instance construction and the proof of Theorem 4.1. We use $d$ the denote the feature dimension, and we assume $d$ is even for simplicity. We use $\\hat { d }$ to denote $d / 2$ for convenience. We also provide an illustration of the construction in Figure 1. ", + "bbox": [ + 174, + 555, + 825, + 601 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "ac, Action Spcontains d Transtates or. and action space . For each $\\mathcal { A } = \\{ a _ { 1 } , a _ { 2 } \\}$ . For each, for each $h \\in [ H ]$ $S _ { h }$ $\\hat { d } + 1$ $s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } }$ $s _ { h } ^ { \\hat { d } + 1 }$ $h \\in [ H - 1 ]$ $c \\in \\{ 1 , 2 , \\ldots , \\hat { d } + 1 \\}$ , we have $P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { \\hat { d } + 1 }$ and $P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { c }$ . ", + "bbox": [ + 173, + 616, + 825, + 671 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Reward Distributions. Let $0 \\leq r _ { 0 } \\leq \\hat { d } ^ { - H / 2 }$ be a parameter to be determined. For each $( h , c ) \\in$ $[ H - 1 ] \\times [ \\hat { d } ]$ and $a \\in { \\mathcal { A } }$ , we set $R ( s _ { h } ^ { c } , a ) = 0$ and $R ( s _ { h } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot ( \\hat { d } ^ { 1 / 2 } - 1 ) \\cdot \\hat { d } ^ { ( H - h ) / 2 }$ . For the last level, for each $c \\in [ \\hat { d } ]$ and $a \\in { \\mathcal { A } }$ , we set $R ( s _ { H } ^ { c } , a ) = \\left\\{ \\begin{array} { l l } { { 1 } } \\\\ { { - 1 } } \\end{array} \\right.$ with probability with probability $( 1 + r _ { 0 } ) / 2$ $( 1 - r _ { 0 } ) / 2$ so that $\\mathbb { E } [ R ( s _ { H } ^ { c } , a ) ] = r _ { 0 }$ . Moreover, for all actions $a \\in \\mathcal { A } , R ( s _ { H } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot \\hat { d } ^ { 1 / 2 }$ . ", + "bbox": [ + 173, + 688, + 825, + 777 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Feature Mapping. Let $e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }$ be a set of orthonormal vectors in $\\mathbb { R } ^ { d }$ . Here, one possible choice is to set $e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }$ to be the standard basis vectors. For each $( h , c ) \\in [ H ] \\times [ \\hat { d } ]$ , we set $\\phi ( s _ { h } ^ { c } , a _ { 1 } ) = e _ { c } , \\phi ( s _ { h } ^ { c } , a _ { 2 } ) = e _ { c + { \\hat { d } } } $ , and $\\begin{array} { r } { \\phi ( s _ { h } ^ { \\hat { d } + 1 } , a ) = \\sum _ { c \\in \\hat { d } } e _ { c } / \\hat { d } ^ { 1 / 2 } } \\end{array}$ for all $a \\in { \\mathcal { A } }$ . ", + "bbox": [ + 173, + 794, + 825, + 845 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Verifying Assumption 1. The following lemma shows that Assumption 1 holds for our construction. The formal proof can be found in Appendix A. ", + "bbox": [ + 173, + 858, + 821, + 888 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Lemma 4.2. For every policy $\\pi : S \\Delta ( { \\mathcal { A } } )$ , for each $h \\in [ H ]$ , for all $( s , a ) \\in S _ { h } \\times \\mathcal { A } ,$ , we have $Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )$ for some $\\theta _ { h } ^ { \\pi } \\in \\mathbb { R } ^ { d }$ . ", + "bbox": [ + 174, + 891, + 821, + 925 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/f1c705bac0910c06796a6d112262eac433faed712ddcc102a45cae574ace9638.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 178, + 104, + 818, + 383 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Figure 1: An illustration of the hard instance. Recall that $\\hat { d } = d / 2$ . States on the top are those in the first level $( h = 1 )$ ), while states at the bottom are those in the last level $h = H$ ). Solid line (with arrow) corresponds to transitions associated with action $a _ { 1 }$ , while dotted line (with arrow) corresponds to transitions associated with action $a _ { 2 }$ . For each level $h \\in [ H ]$ , reward values and $Q$ -values associated with $s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } }$ are marked on the left, while reward values and $Q$ -values associated with $s _ { h } ^ { \\hat { d } + 1 }$ are mark on the right. Rewards and transitions are all deterministic, except for the reward distributions associated with $s _ { H } ^ { 1 } , s _ { H } ^ { 2 } , \\ldots , s _ { H } ^ { \\hat { d } }$ . We mark the ex tation of the reward uniformly at random from those states in the dashed rectangle, i.e., $h \\in [ H ]$ $\\{ s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } \\}$ $\\mu _ { h }$ , while the action is chosen uniformly at random from $\\{ a _ { 1 } , a _ { 2 } \\}$ . Suppose the initial state is $s _ { 1 } ^ { \\hat { d } + 1 }$ . When $r _ { 0 } = 0$ , the value of the policy is 0. When $r _ { 0 } = \\hat { d } ^ { - H / 2 }$ , the value of the policy is $r _ { 0 } \\cdot \\hat { d } ^ { H / 2 } = 1$ . ", + "bbox": [ + 173, + 415, + 826, + 595 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The Data Distributions. For each level $h \\in [ H ]$ , the data distribution $\\mu _ { h }$ is a uniform distribution over $\\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 1 } , a _ { 2 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 2 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } } , a _ { 2 } ) \\}$ . Notice that $( s _ { h } ^ { \\hat { d } + 1 } , a )$ is not in the hsupport of $\\mu _ { h }$ hfor all $a \\in { \\mathcal { A } }$ h h. It can be seen that, $\\begin{array} { r } { \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } \\left[ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } \\right] = \\frac { 1 } { d } \\sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \\top } = \\frac { 1 } { d } I . } \\end{array}$ ", + "bbox": [ + 173, + 625, + 825, + 679 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The Lower Bound. We show that it is information-theoretically hard for any algorithm to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - H / 2 }$ . We fix the initial state to be $s _ { 1 } ^ { \\hat { d } + 1 }$ , and consider any policy $\\pi$ . When $r _ { 0 } = 0$ , all reward values will be zero, and thus the value of $\\pi$ is zero. On the other hand, when $r _ { 0 } = \\hat { d } ^ { - H / 2 }$ , the value of $\\pi$ would be $r _ { 0 } \\cdot \\hat { d } ^ { H / 2 } = 1$ . Thus, if the algorithm approximates the value of the policy up to an error of $1 / 2$ , then it must distinguish the case that $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - H / 2 }$ . ", + "bbox": [ + 173, + 695, + 825, + 775 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We first notice that for the case $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - H / 2 }$ , the data distributions $\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }$ , the feature mapping $\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }$ , the policy $\\pi$ to be evaluated and the transition operator $P$ are the same. Thus, in order to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - H / 2 }$ , the only way is to query the reward distribution by using sampling taken from the data distributions. For all state-action pairs $( s , a )$ in the support of the data distributions of the first $H - 1$ levels, the reward distributions will be identical. This is because for all $s \\in \\mathcal { S } _ { h } \\setminus \\{ s _ { h } ^ { \\hat { d } + 1 } \\}$ and $a \\in { \\mathcal { A } }$ , we have $R ( s , a ) = 0$ . For the case $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - H / 2 }$ , for all state-action pairs $( s , a )$ in the support of the data distribution of the last level, $R ( s , a ) = \\left\\{ { 1 \\atop - 1 } \\right.$ with probability with probability $( 1 + r _ { 0 } ) / 2$ $\\dot { ( 1 - r _ { 0 } ) / 2 }$ Therefore, to distinguish the case that $r _ { 0 } ~ = ~ 0$ and $r _ { 0 } ~ = ~ \\hat { d } ^ { - H / 2 }$ , the agent needs to distinguish two reward distributions $r _ { 1 } = \\left\\{ { \\begin{array} { l l } { 1 } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\\\ { - 1 } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\end{array} } \\right.$ and $r _ { 2 } = \\left\\{ \\begin{array} { l l } { { \\stackrel { - } { 1 } } } \\\\ { { - 1 } } \\end{array} \\right.$ with probability with probability $\\begin{array} { c } { { ( 1 + \\hat { d } ^ { - H / 2 } ) / 2 } } \\\\ { { ( 1 - \\hat { d } ^ { - H / 2 } ) / 2 } } \\end{array}$ . Now we invoke Lemma B.1 in Section B by setting $\\varepsilon = \\hat { d } ^ { - H / 2 } / 2$ and $\\delta = 0 . 9$ . By Lemma B.1, in order to distinguish $r _ { 1 }$ and $r _ { 2 }$ with probability at least 0.9, any algorithm requires $\\Omega ( \\hat { d } ^ { H } )$ samples. ", + "bbox": [ + 173, + 780, + 825, + 926 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/6378731aaaa463eab5936d0eeab7d595642cdf4d6342dba676774f51486277ec.jpg", + "table_caption": [ + "Algorithm 1 Least-Squares Policy Evaluation " + ], + "table_footnote": [], + "table_body": "
1: Input: policy π to be evaluated, number of samples N, regularization parameter 入 > 0
2:Let QH+1(·,·)=O andVH+1(-)= 0
forh=H,H-1,...,1do
4:Take samples (s,a)~ μh,rh ~ r(s,a) and sh ~P(s,a) for eachi∈ [N]
5:LetAh=∑i∈[N](sn,an)(s,a)T+λI
6: 7:LetOn=An1(∑N(s,)·(nh+V+1(3))
Let Qn(-,) = (.,·)TOn and Vh(.)=Q(·,π())
", + "bbox": [ + 179, + 119, + 774, + 241 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 266, + 825, + 356 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Remark 4. The key in our construction is the state sdˆ+h in each level, whose feature vector is defined to be $\\textstyle \\sum _ { c \\in { \\hat { d } } } e _ { c } / { \\hat { d } } ^ { 1 / 2 }$ . In each level, $s _ { h } ^ { \\hat { d } + 1 }$ amplifies the $Q$ -value by a $\\hat { d } ^ { 1 / 2 }$ factor, due to the linearity of the $Q$ -function. After all the $H$ levels, the value will be amplified by a $\\hat { d } ^ { H / 2 }$ factor. Since $s _ { h } ^ { \\hat { d } + 1 }$ is not in the support of the data distribution, the only way to estimate the value of the policy istimate the expected reward value in the last level. Our construction forces the estimation error of the last level to be amplified exponentially and thus implies an exponential lower bound. ", + "bbox": [ + 173, + 359, + 826, + 462 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5 UPPER BOUNDS: LOW DISTRIBUTION SHIFT OR POLICY COMPLETENESS ARE SUFFICIENT ", + "text_level": 1, + "bbox": [ + 176, + 481, + 815, + 515 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In order to illustrate the error amplification issue and discuss conditions that permit sample-efficient offline RL, in this section, we analyze Least-Squares Policy Evaluation when applied to the offline policy evaluation problem under the realizability assumption. The algorithm is presented in Algorithm 1. For simplicity here we assume the policy $\\pi$ to be evaluated is deterministic. ", + "bbox": [ + 173, + 530, + 825, + 588 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Notation. For each $h \\in [ H ]$ , define $\\Lambda _ { h } = \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } \\left[ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } \\right]$ to be the feature covariance matrix at level $h$ . For each $h \\in [ H - 1 ]$ , define $\\overline { { \\Lambda } } _ { h + 1 } = \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } , \\overline { { s } } \\sim P ( \\cdot \\vert s , a ) } \\left[ \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) ^ { \\top } \\right]$ to be the feature covariance matrix of the one-step lookahead distribution at level $h$ . Moreover, define $\\overline { { \\Lambda } } _ { 1 } = \\phi ( s _ { 1 } , \\pi ( s _ { 1 } ) ) \\phi ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ^ { \\top }$ . We define $\\Phi _ { h }$ to be a $N \\times d$ matrix, whose $i$ -th row is $\\phi ( s _ { h } ^ { i } , a _ { h } ^ { i } )$ , and define $\\overline { { \\Phi } } _ { h + 1 }$ to be another $N \\times d$ matrix whose $i$ -th row is $\\phi ( \\overline { { s } } _ { h } ^ { i } , \\pi ( \\overline { { s } } _ { h } ^ { i } ) )$ . For each $h \\in [ H ]$ and $i \\in [ N ]$ , define $\\xi _ { h } ^ { i } = r _ { h } ^ { i } + V ( \\overline { { s } } _ { h } ^ { i } ) - Q ( s _ { h } ^ { i } , a _ { h } ^ { i } )$ . We use $\\xi _ { h }$ to denote a vector whose $i$ -th entry is $\\xi _ { h } ^ { i }$ . ", + "bbox": [ + 173, + 602, + 825, + 695 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Now we present a general lemma that characterizes the estimation error of Algorithm 1 by an equality. The proof can be found in Appendix D. Later, we apply this general lemma to special cases. ", + "bbox": [ + 173, + 700, + 823, + 729 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Lemma 5.1. Suppose $\\lambda > 0$ in Algorithm $^ { l }$ , and for the given policy $\\pi$ , there exists $\\theta _ { 1 } , \\theta _ { 2 } , \\ldots , \\theta _ { d } \\in$ $\\mathbb { R } ^ { d }$ such that for each $h \\in [ H ]$ , $Q _ { h } ^ { \\bar { \\pi } } ( s , a ) = \\phi ( s , \\bar { a } ) ^ { \\top } \\theta _ { h }$ for all $( s , a ) \\in S _ { h } \\times \\mathcal { A }$ . Then we have ", + "bbox": [ + 173, + 733, + 826, + 763 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/ae3c942c91242009b562629605d1f25f0be72411e576b0506d5890cac0fed046.jpg", + "text": "$$\n( Q ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } = \\displaystyle \\left\\| \\sum _ { h = 1 } ^ { H } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\cdot \\cdot \\cdot ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 181, + 771, + 795, + 818 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Now we consider two special cases where the estimation error in Equation (1) can be upper bounded. ", + "bbox": [ + 171, + 832, + 823, + 847 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Low Distribution Shift. The first special we focus on is the case where the distribution shift between the data distributions and the distribution induced by the policy to be evaluated is low. To measure the distribution shift formally, our main assumption is as follows. ", + "bbox": [ + 173, + 862, + 825, + 905 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Assumption 3. We assume that for each $h \\in [ H ]$ , there exists $C _ { h } \\geq 1$ such that $\\overline { { \\Lambda _ { h } } } \\preceq C _ { h } \\Lambda _ { h }$ . ", + "bbox": [ + 169, + 907, + 787, + 925 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Remark 5. For each Therefore, Assumptio $h \\in [ H ]$ , if be r $\\sigma _ { \\mathrm { m i n } } ( \\Lambda _ { h } ) \\succeq \\frac { 1 } { C _ { h } } I$ for some ssumption $C _ { h } \\geq 1$ e . $\\overline { { { \\Lambda } } } _ { h } \\preceq I \\preceq C _ { h } \\Lambda _ { h }$ $C _ { h } \\Lambda _ { h } \\succeq I$ to the original version of Assumption 3 as it gives a tighter characterization of the distribution shift. ", + "bbox": [ + 174, + 102, + 825, + 147 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Now we state the theoretical guarantee of Algorithm 1. The proof can be found in Appendix D. ", + "bbox": [ + 171, + 159, + 795, + 174 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Theorem 5.2. Suppose for the given policy $\\pi$ , there exists $\\theta _ { 1 } , \\theta _ { 2 } , \\ldots , \\theta _ { d } \\ \\in \\ \\mathbb { R } ^ { d }$ such that for√ each $h \\in [ H ] , Q _ { h } ^ { \\pi } ( s , a ) \\ : = \\ : \\phi ( s , a ) ^ { \\top } \\theta _ { h }$ for all $( s , a ) \\ \\in \\ S _ { h } \\times { \\mathcal A }$ and $\\| \\theta _ { h } \\| _ { 2 } ~ \\le ~ H \\sqrt { d } .$ 4 Let $\\lambda = C H \\sqrt { d \\log ( d H / \\delta ) N }$ for some $C > 0$ . With probability at least $1 - \\delta$ , for some $c > 0$ , $\\begin{array} { r } { ( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } \\leq c \\cdot \\prod _ { h = 1 } ^ { H } C _ { h } \\cdot d H ^ { 5 } \\cdot \\sqrt { d \\log ( d H / \\delta ) / N } } \\end{array}$ . ", + "bbox": [ + 173, + 176, + 825, + 242 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Remark 6. The factor $\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }$ in Theorem 5.2 implies that the estimation error will be amplified geometrically. Now we discuss how the error is amplified when running Algorithm 1 on the instance in Section 4 to better illustrate the issue. If we run Algorithm 1 on the hard instance in Section 4, when $h = H$ , the estimation error on $V ( s _ { H } ^ { c } )$ would be roughly $N ^ { - 1 / 2 }$ for each $c \\in [ \\hat { d } ]$ . When using the linear predictor at level $H$ to predict the value of $s _ { H } ^ { * }$ , the error will be amplified by $\\hat { d } ^ { 1 / 2 }$ . When $h = H - 1$ , the dataset contains only $s _ { H - 1 } ^ { c }$ for $c \\in [ \\hat { d } ]$ , and the estimation error on the value of $s _ { H - 1 } ^ { c }$ will be the same as that of $s _ { H } ^ { * }$ , which is roughly $( \\hat { d } / N ) ^ { 1 / 2 }$ . Again, the estimation error on the value of $s _ { H - 1 } ^ { * }$ will be $( \\hat { d } ^ { 2 } / N ) ^ { 1 / 2 }$ when using the linear predictor at level $H - 1$ . The error will eventually be amplified by a factor of $\\hat { d } ^ { H / 2 }$ , which corresponds to the factor $\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }$ in Theorem 5.2. ", + "bbox": [ + 173, + 246, + 826, + 393 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Policy Completeness. In offline RL, another representation condition is closedness under Bellman update (Szepesvari & Munos, 2005; Duan & Wang, 2020), which is stronger than realizability. In ´ the context of offline policy evaluation, we have the following policy completeness assumption. ", + "bbox": [ + 174, + 406, + 825, + 450 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Assumption 4. For the given policy $\\pi$ , for any $h > 1$ and $\\theta _ { h } \\in \\mathbb { R } ^ { d }$ , there exists $\\theta ^ { \\prime } \\in \\mathbb { R } ^ { d }$ such that for any $\\begin{array} { r } { ( s , a ) \\in \\mathcal S _ { h - 1 } \\times \\mathcal A , \\mathbb E [ R ( s , a ) ] + \\sum _ { s ^ { \\prime } \\in { \\cal S } _ { h } } P ( s ^ { \\prime } \\mid s , a ) \\phi ( s ^ { \\prime } , \\pi ( s ^ { \\prime } ) ) ^ { \\top } \\theta _ { h } = \\phi ( s , a ) ^ { \\top } \\theta ^ { \\prime } . } \\end{array}$ . ", + "bbox": [ + 171, + 452, + 823, + 484 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Under Assumption 4 and the assumption that $\\sigma _ { \\operatorname* { m i n } } ( \\Lambda _ { h } ) \\geq \\lambda _ { 0 }$ for all $h \\in [ H ]$ for some $\\lambda _ { 0 } > 0$ , Duan & Wang (2020) have shown that for Algorithm 1, by taking $N = \\mathrm { p o l } \\bar { \\mathrm { y } } ( \\bar { H } , d , 1 / \\varepsilon , 1 / \\lambda _ { 0 } )$ , we have $( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } \\leq \\varepsilon$ . We refer interested readers to (Duan & Wang, 2020). ", + "bbox": [ + 174, + 493, + 826, + 540 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We remark that the above analysis again implies that geometric error amplification is a real issue in offline RL, and sample-efficient offline RL is impossible unless the distribution shift is sufficiently low, i.e., $\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }$ is bounded, or strong representation condition (e.g. policy completeness) holds. ", + "bbox": [ + 174, + 545, + 825, + 590 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "6 CONCLUSION ", + "text_level": 1, + "bbox": [ + 174, + 609, + 318, + 626 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "While the extant body of provable results in the literature largely focus on sufficient conditions for sample-efficient offline RL, this work focuses on obtaining a better understanding of the necessary conditions, where we seek to understand to what extent mild assumptions can imply sample-efficient offline RL. This work shows that for off-policy evaluation, even if we are given a representation that can perfectly represent the value function of the given policy and the data distribution has good coverage over the features, any provable algorithm still requires an exponential number of samples to non-trivially approximate the value of the given policy. These results highlight that provable sample-efficient offline RL is simply not possible unless either the distribution shift condition is sufficiently mild or we have stronger representation conditions that go well beyond realizability. ", + "bbox": [ + 174, + 641, + 825, + 766 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "ACKNOWLEDGMENTS ", + "text_level": 1, + "bbox": [ + 176, + 787, + 356, + 803 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The authors would like to thank Akshay Krishnamurthy, Alekh Agarwal, Wen Sun, and Nan Jiang for numerous helpful discussion. Sham M. Kakade gratefully acknowledges funding from the ONR award N00014-18-1-2247, and NSF Awards CCF-1703574 and CCF-1740551. Ruosong Wang was supported in part by the NSF IIS1763562, US Army W911NF1920104, and ONR Grant N000141812861. Research performed while Ruosong Wang was an intern at Microsoft Research. ", + "bbox": [ + 174, + 818, + 825, + 887 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 102, + 287, + 118 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Rishabh Agarwal, Dale Schuurmans, and Mohammad Norouzi. An optimistic perspective on offline reinforcement learning. In International Conference on Machine Learning, 2020. ", + "bbox": [ + 171, + 126, + 823, + 155 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Martin Anthony and Peter L Bartlett. Neural network learning: Theoretical foundations. cambridge university press, 2009. ", + "bbox": [ + 171, + 165, + 823, + 194 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Andras Antos, Csaba Szepesv ´ ari, and R ´ emi Munos. Learning near-optimal policies with bellman- ´ residual minimization based fitted policy iteration and a single sample path. Machine Learning, 71(1):89–129, 2008. ", + "bbox": [ + 173, + 203, + 821, + 246 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Keith Ball. An elementary introduction to modern convex geometry. Flavors of geometry, 31:1–58, 1997. ", + "bbox": [ + 171, + 256, + 823, + 285 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dimitri P Bertsekas and John N Tsitsiklis. Neuro-dynamic programming: an overview. In Proceedings of 1995 34th IEEE Conference on Decision and Control, volume 1, pp. 560–564. IEEE, 1995. ", + "bbox": [ + 173, + 294, + 825, + 337 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Sebastien Bubeck, Nicol ´ o Cesa-Bianchi, and Sham M. Kakade. Towards minimax policies for \\` online linear optimization with bandit feedback. In COLT 2012 - The 25th Annual Conference on Learning Theory, June 25-27, 2012, Edinburgh, Scotland, volume 23 of JMLR Proceedings, pp. 41.1–41.14, 2012. ", + "bbox": [ + 173, + 347, + 825, + 404 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jinglin Chen and Nan Jiang. Information-theoretic considerations in batch reinforcement learning. In International Conference on Machine Learning, pp. 1042–1051, 2019. ", + "bbox": [ + 173, + 414, + 821, + 443 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Herman Chernoff. Sequential analysis and optimal design. SIAM, 1972. ", + "bbox": [ + 173, + 452, + 651, + 468 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Simon S. Du, Sham M. Kakade, Ruosong Wang, and Lin F. Yang. Is a good representation sufficient for sample efficient reinforcement learning? In International Conference on Learning Representations, 2020. ", + "bbox": [ + 174, + 477, + 823, + 520 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yaqi Duan and Mengdi Wang. Minimax-optimal off-policy evaluation with linear function approximation. arXiv preprint arXiv:2002.09516, 2020. ", + "bbox": [ + 171, + 530, + 823, + 559 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Miroslav Dud´ık, John Langford, and Lihong Li. Doubly robust policy evaluation and learning. In Proceedings of the 28th International Conference on International Conference on Machine Learning, pp. 1097–1104, 2011. ", + "bbox": [ + 174, + 568, + 825, + 612 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Mehrdad Farajtabar, Yinlam Chow, and Mohammad Ghavamzadeh. More robust doubly robust off-policy evaluation. In International Conference on Machine Learning, pp. 1447–1456, 2018. ", + "bbox": [ + 173, + 621, + 823, + 651 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yihao Feng, Tongzheng Ren, Ziyang Tang, and Qiang Liu. Accountable off-policy evaluation with kernel bellman statistics. arXiv preprint arXiv:2008.06668, 2020. ", + "bbox": [ + 174, + 660, + 823, + 689 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Scott Fujimoto, David Meger, and Doina Precup. Off-policy deep reinforcement learning without exploration. In International Conference on Machine Learning, pp. 2052–2062, 2019. ", + "bbox": [ + 173, + 698, + 823, + 728 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Geoffrey J Gordon. Stable function approximation in dynamic programming. In Machine Learning Proceedings 1995, pp. 261–268. Elsevier, 1995. ", + "bbox": [ + 173, + 737, + 823, + 766 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Geoffrey J Gordon. Stable fitted reinforcement learning. In Advances in neural information processing systems, pp. 1052–1058, 1996. ", + "bbox": [ + 173, + 776, + 823, + 805 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Geoffrey J Gordon. Approximate solutions to markov decision processes. Technical report, CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE, 1999. ", + "bbox": [ + 173, + 814, + 823, + 844 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Omer Gottesman, Fredrik Johansson, Joshua Meier, Jack Dent, Donghun Lee, Srivatsan Srinivasan, Linying Zhang, Yi Ding, David Wihl, Xuefeng Peng, Jiayu Yao, Isaac Lage, Christopher Mosch, Li wei H. Lehman, Matthieu Komorowski, Matthieu Komorowski, Aldo Faisal, Leo Anthony Celi, David Sontag, and Finale Doshi-Velez. Evaluating reinforcement learning algorithms in observational health settings, 2018. ", + "bbox": [ + 176, + 853, + 825, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Zhaohan Guo, Philip S Thomas, and Emma Brunskill. Using options and covariance testing for long horizon off-policy policy evaluation. In Advances in Neural Information Processing Systems, pp. 2492–2501, 2017. ", + "bbox": [ + 174, + 103, + 823, + 145 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Daniel Hsu, Sham Kakade, Tong Zhang, et al. A tail inequality for quadratic forms of subgaussian random vectors. Electronic Communications in Probability, 17, 2012a. ", + "bbox": [ + 173, + 155, + 823, + 184 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Daniel Hsu, Sham M Kakade, and Tong Zhang. Random design analysis of ridge regression. In Conference on learning theory, pp. 9–1, 2012b. ", + "bbox": [ + 176, + 194, + 821, + 223 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Natasha Jaques, Asma Ghandeharioun, Judy Hanwen Shen, Craig Ferguson, Agata Lapedriza, Noah Jones, Shixiang Gu, and Rosalind Picard. Way off-policy batch deep reinforcement learning of human preferences in dialog, 2020. URL https://openreview.net/forum?id $=$ rJl5rRVFvH. ", + "bbox": [ + 173, + 232, + 825, + 289 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nan Jiang and Jiawei Huang. Minimax confidence interval for off-policy evaluation and policy optimization. arXiv preprint arXiv:2002.02081, 2020. ", + "bbox": [ + 173, + 299, + 821, + 328 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nan Jiang and Lihong Li. Doubly robust off-policy value evaluation for reinforcement learning. In International Conference on Machine Learning, pp. 652–661. PMLR, 2016. ", + "bbox": [ + 174, + 338, + 823, + 367 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Sham Machandranath Kakade. On the sample complexity of reinforcement learning. PhD thesis, University of London London, England, 2003. ", + "bbox": [ + 173, + 376, + 823, + 405 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nathan Kallus and Masatoshi Uehara. Efficiently breaking the curse of horizon in off-policy evaluation with double reinforcement learning. arXiv preprint arXiv:1909.05850, 2019. ", + "bbox": [ + 173, + 415, + 821, + 444 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Nathan Kallus and Masatoshi Uehara. Double reinforcement learning for efficient off-policy evaluation in markov decision processes. Journal of Machine Learning Research, 21(167):1–63, 2020. ", + "bbox": [ + 173, + 453, + 823, + 483 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Emilie Kaufmann, Olivier Cappe, and Aur ´ elien Garivier. On the complexity of best-arm identifi- ´ cation in multi-armed bandit models. The Journal of Machine Learning Research, 17(1):1–42, 2016. ", + "bbox": [ + 176, + 492, + 823, + 535 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Rahul Kidambi, Aravind Rajeswaran, Praneeth Netrapalli, and Thorsten Joachims. Morel $:$ Modelbased offline reinforcement learning, 2020. ", + "bbox": [ + 173, + 544, + 821, + 574 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Akshay Krishnamurthy, Alekh Agarwal, and John Langford. Pac reinforcement learning with rich observations. In Advances in Neural Information Processing Systems, pp. 1840–1848, 2016. ", + "bbox": [ + 173, + 583, + 821, + 613 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Aviral Kumar, Justin Fu, Matthew Soh, George Tucker, and Sergey Levine. Stabilizing off-policy q-learning via bootstrapping error reduction. neural information processing systems, pp. 11761– 11771, 2019. ", + "bbox": [ + 174, + 621, + 825, + 664 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Aviral Kumar, Abhishek Gupta, and Sergey Levine. Discor: Corrective feedback in reinforcement learning via distribution correction. arXiv preprint arXiv:2003.07305, 2020. ", + "bbox": [ + 173, + 674, + 821, + 704 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Michail G Lagoudakis and Ronald Parr. Least-squares policy iteration. Journal of machine learning research, 4(Dec):1107–1149, 2003. ", + "bbox": [ + 173, + 713, + 823, + 742 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Romain Laroche, Paul Trichelair, and Remi Tachet des Combes. Safe policy improvement with ´ baseline bootstrapping. In Proceedings of the 36th International Conference on Machine Learning (ICML), 2019. ", + "bbox": [ + 174, + 751, + 823, + 794 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Lihong Li, Remi Munos, and Csaba Szepesvari. Toward minimax off-policy value estimation. In Artificial Intelligence and Statistics, pp. 608–616, 2015. ", + "bbox": [ + 169, + 804, + 823, + 833 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Qiang Liu, Lihong Li, Ziyang Tang, and Dengyong Zhou. Breaking the curse of horizon: Infinitehorizon off-policy estimation. In Advances in Neural Information Processing Systems, pp. 5356– 5366, 2018. ", + "bbox": [ + 173, + 843, + 823, + 885 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yao Liu, Pierre-Luc Bacon, and Emma Brunskill. Understanding the curse of horizon in off-policy evaluation via conditional importance sampling. arXiv preprint arXiv:1910.06508, 2019. ", + "bbox": [ + 174, + 895, + 820, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Travis Mandel, Yun-En Liu, Sergey Levine, Emma Brunskill, and Zoran Popovic. Offline policy evaluation across representations with applications to educational games. In AAMAS, pp. 1077– 1084, 2014. ", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Shie Mannor and John N Tsitsiklis. The sample complexity of exploration in the multi-armed bandit problem. Journal of Machine Learning Research, 5(Jun):623–648, 2004. ", + "bbox": [ + 171, + 154, + 823, + 184 + ], + "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, 2015. ", + "bbox": [ + 176, + 190, + 823, + 234 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Wenlong Mou, Zheng Wen, and Xi Chen. On the sample complexity of reinforcement learning with policy space generalization. arXiv preprint arXiv:2008.07353, 2020. ", + "bbox": [ + 171, + 242, + 825, + 272 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Remi Munos. Error bounds for approximate policy iteration. In ´ ICML, volume 3, pp. 560–567, 2003. ", + "bbox": [ + 173, + 279, + 823, + 309 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Remi Munos and Andrew W Moore. Barycentric interpolators for continuous space and time reinforcement learning. In Advances in neural information processing systems, pp. 1024–1030, 1999. ", + "bbox": [ + 176, + 316, + 823, + 359 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Remi Munos and Csaba Szepesv ´ ari. Finite-time bounds for fitted value iteration. ´ Journal of Machine Learning Research, 9(May):815–857, 2008. ", + "bbox": [ + 173, + 368, + 823, + 397 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Dirk Ormoneit and Saunak Sen. Kernel-based reinforcement learning. ´ Machine learning, 49(2-3): 161–178, 2002. ", + "bbox": [ + 174, + 406, + 821, + 435 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Doina Precup. Eligibility traces for off-policy policy evaluation. Computer Science Department Faculty Publication Series, pp. 80, 2000. ", + "bbox": [ + 174, + 444, + 821, + 473 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Stephane Ross and Drew Bagnell. Agnostic system identification for model-based reinforcement ´ learning. In Proceedings of the 29th International Conference on Machine Learning, ICML 2012, Edinburgh, Scotland, UK, June 26 - July 1, 2012. icml.cc / Omnipress, 2012. ", + "bbox": [ + 176, + 481, + 823, + 525 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Wen Sun, Arun Venkatraman, Geoffrey J Gordon, Byron Boots, and J Andrew Bagnell. Deeply aggrevated: Differentiable imitation learning for sequential prediction. In International Conference on Machine Learning, pp. 3309–3318, 2017. ", + "bbox": [ + 174, + 531, + 825, + 575 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Csaba Szepesvari and R ´ emi Munos. Finite time bounds for sampling based fitted value iteration. In ´ Proceedings of the 22nd international conference on Machine learning, pp. 880–887, 2005. ", + "bbox": [ + 173, + 583, + 821, + 613 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Philip Thomas and Emma Brunskill. Data-efficient off-policy policy evaluation for reinforcement learning. In International Conference on Machine Learning, pp. 2139–2148, 2016. ", + "bbox": [ + 173, + 619, + 821, + 650 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Philip S. Thomas. Safe reinforcement learning. PhD thesis, University of Massachusetts, Amherst, 2014. ", + "bbox": [ + 173, + 657, + 821, + 688 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Philip S Thomas, Georgios Theocharous, and Mohammad Ghavamzadeh. High-confidence offpolicy evaluation. In Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015. ", + "bbox": [ + 171, + 694, + 823, + 724 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Philip S. Thomas, Bruno Castro da Silva, Andrew G. Barto, Stephen Giguere, Yuriy Brun, and Emma Brunskill. Preventing undesirable behavior of intelligent machines. Science, 366(6468): 999–1004, 2019. ISSN 0036-8075. doi: 10.1126/science.aag3311. ", + "bbox": [ + 173, + 732, + 823, + 775 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Samuele Tosatto, Matteo Pirotta, Carlo d’Eramo, and Marcello Restelli. Boosted fitted q-iteration. In International Conference on Machine Learning, pp. 3434–3443. PMLR, 2017. ", + "bbox": [ + 173, + 782, + 820, + 813 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Joel A Tropp. An introduction to matrix concentration inequalities. Foundations and Trends $\\textsuperscript { \\textregistered }$ in Machine Learning, 8(1-2):1–230, 2015. ", + "bbox": [ + 173, + 820, + 823, + 849 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "J Tsitsiklis and B Van Roy. An analysis of temporal-difference learning with function approximation (technical report lids-p-2322). Laboratory for Information and Decision Systems, 1996. ", + "bbox": [ + 173, + 858, + 823, + 887 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Masatoshi Uehara and Nan Jiang. Minimax weight and q-function learning for off-policy evaluation. arXiv preprint arXiv:1910.12809, 2019. ", + "bbox": [ + 173, + 895, + 821, + 924 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Benjamin Van Roy. Feature-based methods for large scale dynamic programming. PhD thesis, Massachusetts Institute of Technology, 1994. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "L. Wang, Wei Zhang, Xiaofeng He, and H. Zha. Supervised reinforcement learning with recurrent neural network for dynamic treatment recommendation. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018. ", + "bbox": [ + 176, + 140, + 821, + 184 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Ruosong Wang, Simon S Du, Lin F Yang, and Ruslan Salakhutdinov. On reward-free reinforcement learning with linear function approximation. arXiv preprint arXiv:2006.11274, 2020. ", + "bbox": [ + 171, + 193, + 823, + 222 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Yu-Xiang Wang, Alekh Agarwal, and Miroslav Dudık. Optimal and adaptive off-policy evaluation in contextual bandits. In International Conference on Machine Learning, pp. 3589–3597. PMLR, 2017. ", + "bbox": [ + 178, + 229, + 823, + 272 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Yifan Wu, George Tucker, and Ofir Nachum. Behavior regularized offline reinforcement learning, 2020. URL https://openreview.net/forum?id ${ . } = { }$ BJg9hTNKPH. ", + "bbox": [ + 174, + 281, + 821, + 310 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Tengyang Xie and Nan Jiang. Batch value-function approximation with only realizability. arXiv preprint arXiv:2008.04990, 2020a. ", + "bbox": [ + 174, + 319, + 821, + 348 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Tengyang Xie and Nan Jiang. $Q ^ { \\star }$ approximation schemes for batch reinforcement learning: A theoretical comparison. arXiv preprint arXiv:2003.03924, 2020b. ", + "bbox": [ + 174, + 357, + 821, + 387 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Tengyang Xie, Yifei Ma, and $\\mathrm { Y u }$ -Xiang Wang. Towards optimal off-policy evaluation for reinforcement learning with marginalized importance sampling. In Advances in Neural Information Processing Systems, pp. 9668–9678, 2019. ", + "bbox": [ + 174, + 395, + 825, + 438 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "C. Yu, G. Ren, and J. Liu. Deep inverse reinforcement learning for sepsis treatment. In 2019 IEEE International Conference on Healthcare Informatics (ICHI), pp. 1–3, 2019. ", + "bbox": [ + 174, + 446, + 823, + 477 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Andrea Zanette, Alessandro Lazaric, Mykel J Kochenderfer, and Emma Brunskill. Limiting extrapolation in linear approximate value iteration. In Advances in Neural Information Processing Systems, pp. 5616–5625, 2019. ", + "bbox": [ + 176, + 484, + 825, + 527 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A PROOF OF LEMMA 4.2 ", + "text_level": 1, + "bbox": [ + 176, + 102, + 398, + 118 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proof. We first verify $Q ^ { \\pi }$ is linear for the first $H - 1$ levels. For each $( h , c ) \\in [ H - 1 ] \\times [ \\hat { d } ]$ , we have ", + "bbox": [ + 174, + 132, + 823, + 162 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/20e2f82f083315c34a6372cfc8601eda3bdec13111334ef8f8e4d716070da026.jpg", + "text": "$$\nQ _ { h } ^ { \\pi } ( s _ { h } ^ { c } , a _ { 1 } ) = R ( s _ { h } ^ { c } , a _ { 1 } ) + R ( s _ { h + 1 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + \\ldots + R ( s _ { H } ^ { \\hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 191, + 165, + 805, + 188 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Moreover, for all $a \\in { \\mathcal { A } }$ , ", + "bbox": [ + 174, + 200, + 338, + 215 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/26a6565e194fb4e7d4ad7047fd0657ab1f85ed87efc1665e0a2724854b375ea3.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { Q } _ { h } ^ { \\pi } ( s _ { h } ^ { \\hat { d } + 1 } , a ) = R ( s _ { h } ^ { \\hat { d } + 1 } , a ) + R ( s _ { h + 1 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + . . . + R ( s _ { H } ^ { \\hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \\cdot \\hat { d } ^ { ( H - h + 1 ) / 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 219, + 823, + 243 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Therefore, if we define ", + "bbox": [ + 174, + 255, + 326, + 270 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/54fcd2dd6f55180ccd68f147b6e964775504c997fdce54bc2f950525a174eb3e.jpg", + "text": "$$\n\\boldsymbol { \\theta } _ { h } ^ { \\pi } = \\sum _ { c = 1 } ^ { \\hat { d } } \\boldsymbol { r } _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } \\cdot \\boldsymbol { e } _ { c } + \\sum _ { c = 1 } ^ { \\hat { d } } Q _ { h } ^ { \\pi } ( s _ { h } ^ { c } , a _ { 2 } ) \\cdot \\boldsymbol { e } _ { c + \\hat { d } } ,\n$$", + "text_format": "latex", + "bbox": [ + 323, + 275, + 673, + 320 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "then $Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )$ for all $( s , a ) \\in S _ { h } \\times \\mathcal { A }$ ", + "bbox": [ + 173, + 327, + 535, + 345 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Now we verify that the $Q$ -function is linear for the last level. Clearly, for all $c \\in [ \\hat { d } ]$ and $a \\in { \\mathcal { A } }$ , $Q _ { H } ^ { \\pi } ( s _ { H } ^ { c } , a ) = r _ { 0 }$ and $Q _ { H } ^ { \\pi } ( s _ { H } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot \\sqrt { \\hat { d } }$ . Thus by defining $\\begin{array} { r } { \\theta _ { H } ^ { \\pi } = \\sum _ { c = 1 } ^ { d } r _ { 0 } \\cdot e _ { c } } \\end{array}$ , we have $Q _ { H } ^ { \\pi } ( s , a ) = \\left( \\theta _ { H } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )$ for all $( s , a ) \\in { \\cal S } _ { H } \\times \\mathcal { A }$ . ", + "bbox": [ + 173, + 352, + 825, + 406 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "B A TECHNICAL LEMMA ", + "text_level": 1, + "bbox": [ + 176, + 445, + 398, + 463 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We need the following lemma in the proof of our hardness results. ", + "bbox": [ + 173, + 477, + 607, + 492 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lemma B.1. Let α be a random variable uniformly distributed on $\\{ \\alpha _ { + } , \\alpha _ { - } \\}$ , where $\\alpha _ { - } = 1 / 2$ and $\\alpha _ { + } = 1 / 2 + \\varepsilon$ with $0 < \\varepsilon < 1$ . Suppose that $\\xi _ { 1 } , \\xi _ { 2 } , \\ldots , \\xi _ { m }$ are i.i.d. $\\{ + 1 , - 1 \\}$ -valued random variables with $\\operatorname* { P r } [ \\xi _ { i } = + 1 ] = \\alpha$ for all $i \\in [ m ]$ . Let $f$ be a function from $\\bar { \\{ + 1 , - 1 \\} } ^ { m }$ to $\\{ \\alpha _ { + } , \\alpha _ { - } \\}$ . Suppose $m \\le C / \\varepsilon ^ { 2 } \\log ( 1 / \\delta )$ for some fixed constant $C$ . Then ", + "bbox": [ + 173, + 496, + 826, + 553 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/8baf597341492de00e54fb80d5764f5c6ea5b5799a08174e53a081bb1892c63c.jpg", + "text": "$$\n\\operatorname* { P r } [ f ( \\xi _ { 1 } , \\xi _ { 2 } , \\ldots , \\xi _ { m } ) \\neq \\alpha ] > \\delta .\n$$", + "text_format": "latex", + "bbox": [ + 393, + 559, + 602, + 577 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "To our best knowledge, Lemma B.1 was first proved in (Chernoff, 1972) and has enormous applications in statistical learning theory (see, e.g., Chapter 5 in (Anthony & Bartlett, 2009)) and bandits (Mannor & Tsitsiklis, 2004). ", + "bbox": [ + 173, + 588, + 825, + 632 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "To prove Lemma B.1, one can first prove that the maximum likelihood estimator (MLE) is optimal and then show that MLE requires $\\dot { \\Omega ( 1 / \\varepsilon ^ { 2 } \\log ( 1 / \\delta ) ) }$ samples to correctly output $\\alpha$ with probability $1 - \\delta$ by anti-concentration. Lemma B.1 can also be proved by using information theory. See, e.g., (Kaufmann et al., 2016) for such a proof. ", + "bbox": [ + 173, + 638, + 825, + 695 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C ANOTHER HARD INSTANCE ", + "text_level": 1, + "bbox": [ + 176, + 714, + 439, + 731 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this section, we present another hard case under a weaker version of Assumption 1. Here the transition operator is stochastic and the reward is deterministic and sparse, meaning that the reward value is non-zero only for the last level. Moreover, the data distributions $\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }$ are induced by a fixed policy $\\pi _ { \\mathrm { d a t a } }$ . We also illustrate the construction in Figure 2. Throughout this section, we use $d$ the denote the feature dimension, and we assume $d$ is an even integer for simplicity. We use $\\hat { d }$ to denote $d / 2 - 1$ . ", + "bbox": [ + 173, + 746, + 826, + 833 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this section, we adopt the following realizability assumption, which is a weaker version of Assumption 1. ", + "bbox": [ + 173, + 838, + 823, + 867 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Assumption 5 (Realizability). For the policy $\\pi : { \\mathcal { S } } \\to \\Delta ( { \\mathcal { A } } )$ to be evaluated, there exists $\\theta _ { 1 } , \\ldots \\theta _ { H } \\in \\mathbb { R } ^ { d }$ such that for all $( s , a ) \\in S \\times A$ and $h \\in [ H ]$ , ", + "bbox": [ + 173, + 871, + 820, + 901 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/2e666fecfb6843e53103f4f01884c24aa399a2704cbf00af3317a8f5f1923b4b.jpg", + "text": "$$\nQ _ { h } ^ { \\pi } ( s , a ) = \\theta _ { h } ^ { \\top } \\phi ( s , a ) .\n$$", + "text_format": "latex", + "bbox": [ + 423, + 906, + 573, + 925 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/831f4f46b3c3a7fe56b9389db2fe0185582a4d12a043273c0a23665f61094463.jpg", + "image_caption": [ + "Figure 2: An illustration of the hard instance. Recall that $\\hat { d } = d / 2 - 1$ . States on the top are those in the first level $( h = 1 )$ ), while states at the bottom are those in the last level ( $h = H$ ). Dotted line (with arrow) corresponds to transitions associated with actions $a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } }$ , while solid line (with arrow) corresponds to transitions associated with actions $a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d }$ . We omit the transition associated with $a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } }$ in the figure if all actions give the same transition. For each level $h \\in [ H ]$ , $Q$ -values associated with $s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } , s _ { h } ^ { + } , s _ { h } ^ { - }$ , sdˆh, s+h , s−h are marked on the left, while transition distributions and $Q$ -values associated with + − $s _ { h } ^ { \\hat { d } + 1 }$ are marked on the right. Rewards are all deterministic, and the only two states ) with non-zero reward values are marked in black and grey. Consider the fixed policy that returns $\\mathit { a } _ { d }$ for all input states. When $r _ { 0 } = 0$ , the value of the policy is 0. When $r _ { 0 } = \\hat { d } ^ { - ( \\bar { H } - 2 ) / 2 }$ , the value of the policy $s = r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 } = 1$ . " + ], + "image_footnote": [], + "bbox": [ + 178, + 103, + 825, + 473 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "State Space, Action Space and Transition Operator. In this hard case, the action space ${ \\mathcal { A } } =$ $\\{ a _ { 1 } , a _ { 2 } , \\ldots , a _ { d } \\}$ contains $d$ elements. $S _ { 1 }$ contains a single state $s _ { 1 }$ . For each $h \\geq 2$ , $S _ { h }$ contains ${ \\hat { d } } + 3$ states $s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } , s _ { h } ^ { \\hat { d } + 1 } , s _ { h } ^ { + }$ and $s _ { h } ^ { - }$ . ", + "bbox": [ + 173, + 690, + 825, + 739 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Let $0 \\leq r _ { 0 } \\leq \\hat { d } ^ { - ( H - 2 ) / 2 }$ be a parameter to be determined. We first define the transition operator for the first level. We have ", + "bbox": [ + 174, + 746, + 825, + 776 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/02dca0d2d05899ca16665bb3efe99b1848e77bfa1b39750db47c7eb99487a458.jpg", + "text": "$$\nP ( s _ { 1 } , a ) = \\left\\{ \\begin{array} { l l } { s _ { 2 } ^ { c } } & { a = a _ { c } , c \\in [ \\hat { d } ] } \\\\ { s _ { 2 } ^ { + } } & { a = a _ { \\hat { d } + 1 } } \\\\ { s _ { 2 } ^ { - } } & { a = a _ { \\hat { d } + 2 } } \\\\ { s _ { 2 } ^ { \\hat { d } + 1 } } & { a \\in \\{ a _ { \\hat { d } + 3 } , a _ { \\hat { d } + 4 } , \\dots , a _ { d } \\} } \\end{array} \\right. .\n$$", + "text_format": "latex", + "bbox": [ + 334, + 785, + 658, + 861 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Now we define the transition operator when $h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}$ . For each $h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}$ , $a \\in { \\mathcal { A } }$ and $c \\in [ \\hat { d } ]$ , we have $P ( s _ { h } ^ { c } , a ) = s _ { h + 1 } ^ { \\hat { d } + 1 }$ , $P ( s _ { h } ^ { + } , a ) = s _ { h + 1 } ^ { + }$ and $P ( s _ { h } ^ { - } , a ) = s _ { h + 1 } ^ { - }$ . For each $h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}$ and $c \\in [ \\hat { d } ]$ , we have $P ( s _ { h } ^ { \\hat { d } + 1 } , a _ { c } ) = s _ { h + 1 } ^ { c }$ . For all $a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}$ , ", + "bbox": [ + 173, + 869, + 826, + 926 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "we have ", + "bbox": [ + 173, + 104, + 232, + 117 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/1f21f3f45f8a1770030c2e66d94d2b2fc888143c2656ab4cbff41319fc9f266f.jpg", + "text": "$$\nP \\left( s _ { h } ^ { \\hat { d } + 1 } , a \\right) = \\left\\{ \\begin{array} { l l } { s _ { h + 1 } ^ { + } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } ) / 2 } \\\\ { s _ { h + 1 } ^ { - } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } ) / 2 } \\end{array} \\right. .\n$$", + "text_format": "latex", + "bbox": [ + 281, + 113, + 712, + 156 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Now we define the transition operator for the second last level. For all $c \\in [ \\hat { d } ]$ and $a \\in { \\mathcal { A } }$ , we have ", + "bbox": [ + 173, + 166, + 816, + 184 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/26aa3d6833d1a76da303d0fdd448af1601354bcb4d0355dc55a5b4ece284cf45.jpg", + "text": "$$\nP ( s _ { H - 1 } ^ { c } , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } ) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } ) / 2 } \\end{array} \\right. .\n$$", + "text_format": "latex", + "bbox": [ + 326, + 189, + 671, + 226 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "For all $a \\in { \\mathcal { A } }$ , we have $P ( s _ { H - 1 } ^ { + } , a ) = s _ { H } ^ { + }$ and $P ( s _ { H - 1 } ^ { - } , a ) \\ = \\ s _ { H } ^ { - }$ . For each $c \\in [ \\hat { d } ]$ , we have $P ( s _ { H - 1 } ^ { \\hat { d } + 1 } , a _ { c } ) = s _ { H } ^ { c }$ . For all $a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}$ , we have ", + "bbox": [ + 171, + 233, + 823, + 272 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/1ec405fe5a1c83f132890bcdf71ead1c49f3819827dd48b952d4a005c8e16a0c.jpg", + "text": "$$\nP ( s _ { H - 1 } ^ { \\hat { d } + 1 } , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } \\left( 1 + r _ { 0 } \\cdot \\sqrt { \\hat { d } } \\right) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } \\left( 1 - r _ { 0 } \\cdot \\sqrt { \\hat { d } } \\right) / 2 } \\end{array} \\right. .\n$$", + "text_format": "latex", + "bbox": [ + 303, + 276, + 694, + 328 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Reward Values. In this hard case, all reward values are deterministic, and reward values can be non-zero only for the last level. Formally, we have ", + "bbox": [ + 171, + 338, + 823, + 368 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/9f7770932480add887a3daf15ae27f6fa6f34cf24a3f5fc2823575dd2bd7f97f.jpg", + "text": "$$\nR ( s , a ) = \\left\\{ { \\begin{array} { l l } { 1 } & { s = s _ { H } ^ { + } } \\\\ { - 1 } & { s = s _ { H } ^ { - } } \\\\ { 0 } & { { \\mathrm { o t h e r w i s e } } } \\end{array} } \\right. .\n$$", + "text_format": "latex", + "bbox": [ + 400, + 375, + 598, + 426 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Feature Mapping. As in the in hard instance in Section 4, let $e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }$ be a set of of orthonormal vectors in $\\mathbb { R } ^ { d }$ . For the initial state, for each $c \\in [ d ]$ , we have $\\phi ( s _ { 1 } , a _ { c } ) = e _ { c }$ . ", + "bbox": [ + 171, + 439, + 823, + 470 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Now we define the feature mapping when $h \\in \\{ 2 , 3 , \\ldots , H \\}$ . For each $h \\in \\{ 2 , 3 , \\ldots , H \\}$ , $a \\in { \\mathcal { A } }$ and $c \\in [ \\hat { d } ] , \\phi ( s _ { h } ^ { c } , a ) = e _ { c } , \\phi ( s _ { h } ^ { + } , a ) = e _ { \\hat { d } + 1 }$ and $\\phi ( s _ { h } ^ { - } , a ) = e _ { \\hat { d } + 2 }$ . Moreover, for all actions $a \\in { \\mathcal { A } }$ , ", + "bbox": [ + 173, + 474, + 823, + 510 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/3498e2809bc51250e1241c52184c87309d17438b131a1b68fb48c01d2312e276.jpg", + "text": "$$\n\\phi ( s _ { h } ^ { \\hat { d } + 1 } , a ) = \\left\\{ { \\begin{array} { l l } { e _ { \\hat { d } + 2 + c } } & { a = a _ { c } , c \\in [ { \\hat { d } } ] } \\\\ { { \\frac { 1 } { d ^ { 1 / 2 } } } \\left( e _ { 1 } + e _ { 2 } + \\ldots + e _ { \\hat { d } } \\right) } & { a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\ldots , a _ { d } \\right\\} } \\end{array} } \\right. .\n$$", + "text_format": "latex", + "bbox": [ + 259, + 515, + 735, + 556 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Clearly, for all (s, a) ∈ S × A, $\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1$ . ", + "bbox": [ + 173, + 561, + 485, + 579 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Verifying Assumption 5. Now we consider the deterministic policy $\\pi : { \\mathcal { S } } A$ , which is defined to be $\\pi ( s ) = a _ { d }$ for all $s \\in S$ . We show that Assumption 5 holds. ", + "bbox": [ + 173, + 592, + 825, + 622 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "When $h = 1$ , define ", + "bbox": [ + 174, + 627, + 308, + 642 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/b0f7eb3020ffacb568382bd05c55fe286cf5c19a1f426007fdc721000df37147.jpg", + "text": "$$\n\\theta _ { 1 } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - 3 ) / 2 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } + \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - 2 ) / 2 } \\cdot e _ { \\hat { d } + 2 + c } .\n$$", + "text_format": "latex", + "bbox": [ + 258, + 647, + 740, + 693 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "For each $h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}$ , define ", + "bbox": [ + 173, + 704, + 434, + 722 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/29b2bb5c7fea1f396573160e775cfc55b3fe971fa9c8e9868b297ec621610580.jpg", + "text": "$$\n\\theta _ { h } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - h - 1 ) / 2 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } + \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - h - 2 ) / 2 } \\cdot e _ { \\hat { d } + 2 + c } .\n$$", + "text_format": "latex", + "bbox": [ + 238, + 727, + 756, + 772 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "For the second last level $h = H - 1$ , define ", + "bbox": [ + 174, + 785, + 460, + 799 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/ae4a86643acf6941e5673bf4a1888cd7c2991b52c17b90361afecfc59f872b74.jpg", + "text": "$$\n\\theta _ { H - 1 } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 379, + 804, + 617, + 849 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Finally, for the last level $h = H$ , define ", + "bbox": [ + 173, + 862, + 433, + 877 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/54bfceffda606069ff016716960840835aa9b52c6640364dc3b678b6cae64510.jpg", + "text": "$$\n\\theta _ { H } = e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 431, + 883, + 563, + 902 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "It can be verified that for each $h \\in [ H ]$ , $Q _ { h } ^ { \\pi } ( s , a ) = \\theta _ { h } ^ { \\top } \\phi ( s , a )$ for all $( s , a ) \\in S _ { h } \\times \\mathcal { A }$ . ", + "bbox": [ + 171, + 907, + 740, + 926 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "The Data Distributions. For the first level, the data distribution $\\mu _ { 1 }$ is defined to be the uniform distribution over $\\{ ( s _ { 1 } , a _ { c } ) ~ | ~ c ~ \\in ~ [ d ] \\}$ . For each $h \\geq 2$ , the data distribution $\\mu _ { h }$ is a uniform distribution over ", + "bbox": [ + 174, + 102, + 825, + 146 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/98895987379f06852e232c87b7cac8b00890955f81df350fcbcb45bf6a0654bc.jpg", + "text": "$$\n\\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { + } , a _ { 1 } ) , ( s _ { h } ^ { - } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { 2 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } } ) \\} .\n$$", + "text_format": "latex", + "bbox": [ + 199, + 147, + 799, + 170 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Notice that again $( s _ { h } ^ { \\hat { d } + 1 } , a )$ is not in the support of $\\mu _ { h }$ for all actions $a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}$ . It can be seen that for all $h \\in [ H ]$ , ", + "bbox": [ + 173, + 178, + 825, + 210 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/b8f2754fd3e36c53d393f132679c299d7058189e6326959279130cb2a1054ff0.jpg", + "text": "$$\n\\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } [ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } ] = \\frac { 1 } { d } \\sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \\top } = \\frac { 1 } { d } I .\n$$", + "text_format": "latex", + "bbox": [ + 336, + 214, + 660, + 257 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Moreover, by defining ", + "bbox": [ + 173, + 261, + 321, + 275 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/18de4b21531d8a3ec8c9779582f02d0ff0c5e5bd98bf3a4718066e7864c111d0.jpg", + "text": "$$\n\\pi _ { \\operatorname* { d a t a } } ( s ) = \\left\\{ \\begin{array} { l l } { \\operatorname { U n i f o r m } ( A ) } & { s = s _ { 1 } } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { c } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} , c \\in [ \\hat { d } ] \\} } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { + } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { - } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\\\ { \\operatorname { U n i f o r m } ( \\{ a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } } \\} ) } & { s \\in \\{ s _ { h } ^ { \\hat { d } + 1 } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\end{array} \\right. ,\n$$", + "text_format": "latex", + "bbox": [ + 225, + 281, + 767, + 369 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "we have $\\mu _ { h } = \\mu _ { h } ^ { \\pi _ { \\mathrm { d a t a } } }$ for all $h \\in [ H ]$ ", + "bbox": [ + 174, + 372, + 419, + 390 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "The Lower Bound. Now we show that it is information-theoretically hard for any algorithm to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }$ in the offline setting by taking samples from the data distributions $\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }$ . Here we consider the above policy $\\pi$ defined above which returns action $a _ { d }$ for all input states. Notice that when $r _ { 0 } = 0$ , the value of the policy would be zero. On the other hand, when $\\stackrel { \\cdot } { r } _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }$ , the value of the policy would be $r _ { 0 } \\cdot \\hat { d } ^ { ( \\overleftarrow { H } - 2 ) / 2 } = 1 .$ . Therefore, if the algorithm approximates the value of the policy up to an approximation error of $1 / 2$ , then it must distinguish the case that $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }$ . ", + "bbox": [ + 173, + 401, + 826, + 508 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "We first notice that for the case $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }$ , the data distributions $\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }$ , the feature mapping $\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }$ , the policy $\\pi$ to be evaluated and the reward distributions $R$ are the same. Thus, in order to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }$ , the only way is to query the transition operator $P$ by using sampling taken from the data distributions. ", + "bbox": [ + 173, + 513, + 825, + 578 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Now, for all state-action pairs $( s , a )$ in the support of the data distributions of the first $H - 2$ lev \nelsing amely only $\\mu _ { 1 } , \\mu _ { 2 } , \\ldots , \\mu _ { H - 2 } )$ , the transition opeion distributions of ang-, and $r _ { 0 }$ $( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } + 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } ) , \\dots , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { d } )$ support of in the supp f of $h ~ \\in ~ [ H \\mathrm { ~ - ~ } 2 ]$ . Moreover, for anyso be identical no mat \n$( s , a ) \\in \\{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \\hat { d } + 1 } \\} \\times \\mathcal { A }$ $\\mu _ { H - 1 }$ $P ( s , a )$ \nter $r _ { 0 } = 0$ or $r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }$ . For those state-action pairs $( s , a )$ in the support of $\\mu _ { H - 1 }$ with \n$s \\not \\in \\{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \\hat { d } + 1 } \\}$ , we have ", + "bbox": [ + 173, + 582, + 825, + 703 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/3923d7417aca0ce99b714732257f17509ea4cdfc956725d9ef4dd19654d62acb.jpg", + "text": "$$\nP ( s , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h } \\ p r o b a b i l i t y \\ ( 1 + r _ { 0 } ) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h } \\ p r o b a b i l i t y \\ ( 1 - r _ { 0 } ) / 2 } \\end{array} \\right. .\n$$", + "text_format": "latex", + "bbox": [ + 341, + 707, + 655, + 743 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Again, this is because $( s _ { H - 1 } ^ { \\hat { d } + 1 } , a )$ is not in the support of $\\mu _ { H - 1 }$ for all $a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}$ ", + "bbox": [ + 171, + 750, + 803, + 770 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Therefore, in order to distinguish the case $r _ { 0 } = 0$ and $r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }$ , the agent needs distinguish two transition distributions ", + "bbox": [ + 174, + 776, + 823, + 805 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/0fe8bae359e8250df180debadc1391756ffe35c0d55a1e67825fa124ecc85b2f.jpg", + "text": "$$\np _ { 1 } = { \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\\\ { s _ { H } ^ { - } } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\end{array} \\right. }\n$$", + "text_format": "latex", + "bbox": [ + 385, + 803, + 614, + 839 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 842, + 202, + 854 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/213c2d1f6f8006f0ad57680ab50cc19ad912456c73418c5c8a550f318dc82780.jpg", + "text": "$$\np _ { 2 } = \\left\\{ s _ { H } ^ { + } \\quad \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } ( 1 + \\hat { d } ^ { - ( H - 2 ) / 2 } ) / 2 \\right.\n$$", + "text_format": "latex", + "bbox": [ + 330, + 851, + 663, + 892 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Again, by Lemma B.1, in order to distinguish $p _ { 1 }$ and $p _ { 2 }$ with probability at least 0.9, one needs $\\Omega ( \\hat { d } ^ { H - 2 } )$ samples. Formally, we have the following theorem. ", + "bbox": [ + 171, + 893, + 823, + 924 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Theorem C.1. Suppose Assumption 2 holds, and rewards are deterministic and could be nonezero only for state-action pairs in the last level. Fix an algorithm that takes as input both a policy and a feature mapping. There exists an MDP satisfying Assumption 5, such that for a fixed policy $\\pi : { \\mathcal { S } } A$ , the algorithm requires $\\Omega ( ( d / 2 - 1 ) ^ { H / 2 } )$ samples to output the value of π up to constant additive approximation error with probability at least 0.9. ", + "bbox": [ + 173, + 103, + 825, + 174 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "D ANALYSIS OF ALGORITHM 1 ", + "text_level": 1, + "bbox": [ + 176, + 193, + 446, + 209 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "D.1 PROOF OF LEMMA 5.1 ", + "bbox": [ + 174, + 222, + 372, + 238 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Clearly, ", + "bbox": [ + 173, + 250, + 227, + 263 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "For the first te ", + "bbox": [ + 173, + 486, + 349, + 498 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/a794e2984d07f734f3b1f7eee9882b84ec8c3c8980c3b8a66b48b1ae2f524bab.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { 1 } { \\sqrt { 3 } } \\sum _ { k \\geq 0 , k \\leq 1 } \\bar { \\zeta } _ { k } \\bigg ( \\frac { 1 } { 2 } \\eta _ { k } ^ { 2 } \\bigg ( \\mathbb { E } _ { k } \\| \\hat { \\zeta } _ { k } \\| ^ { 2 } \\eta _ { k } ^ { 2 } \\bigg ( \\mathbb { E } _ { k } \\| \\hat { \\zeta } _ { k } \\| ^ { 2 } \\eta _ { k } ^ { 2 } \\bigg ) \\bigg ) } \\\\ & { \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 269, + 303, + 926, + 704 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Therefore, ", + "bbox": [ + 174, + 784, + 245, + 799 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/2a3f5d3a13ff2478cb320974abe1bd48a8543ddb6d99844d86ae3f2995a70a01.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle \\hat { \\theta } _ { 1 } - \\theta _ { 1 } = ( \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } \\xi _ { 1 } - \\lambda \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\theta _ { 1 } ) + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } ( \\theta _ { 2 } - \\hat { \\theta } _ { 2 } ) } \\\\ { \\displaystyle = ( \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } \\xi _ { 1 } - \\lambda \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\theta _ { 1 } ) + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } ( \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\xi _ { 2 } - \\lambda \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\theta _ { 2 } ) } \\\\ { \\displaystyle \\quad \\quad + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } ( \\theta _ { 3 } - \\hat { \\theta } _ { 3 } ) } \\\\ { \\displaystyle \\quad = \\ldots } \\\\ { \\displaystyle \\quad = \\sum _ { h = 1 } ^ { H } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\ldots ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 264, + 796, + 732, + 922 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Also note that ", + "bbox": [ + 174, + 103, + 269, + 117 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/80cd714ffe24921aa94bd54a18fc45075e46a89d468f6ac7919e07b9b06ed96a.jpg", + "text": "$$\n\\begin{array} { r } { ( Q ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } = \\| \\theta _ { 1 } - \\hat { \\theta } _ { 1 } \\| _ { \\bar { \\Lambda } _ { 1 } } ^ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 333, + 114, + 663, + 137 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "D.2 PROOF OF THEOREM 5.2 ", + "text_level": 1, + "bbox": [ + 174, + 151, + 392, + 167 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "By matrix concentration inequality (Tropp, 2015), we have the following lemma. ", + "bbox": [ + 171, + 178, + 704, + 194 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Lemma D.1. For each $h \\in [ H ]$ , with probability $1 - \\delta / ( 4 H )$ , for some universal constant $C$ , we have ", + "bbox": [ + 174, + 196, + 823, + 224 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/c7c64ef9476b39f93cff38824d7eb84c7c88ae51fb7bf4cd1c2c2b697de684d0.jpg", + "text": "$$\n\\left\\| \\frac { 1 } { N } \\Phi _ { h } ^ { \\top } \\Phi _ { h } - \\Lambda _ { h } \\right\\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) / N } .\n$$", + "text_format": "latex", + "bbox": [ + 351, + 222, + 643, + 257 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 261, + 202, + 273 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/d18992896bb27ede910b917fc278c6f358083295a4c8af0afb592cf1f1efa217.jpg", + "text": "$$\n\\left\\| \\frac { 1 } { N } \\overline { { \\Phi } } _ { h + 1 } \\overline { { \\Phi } } _ { h + 1 } - \\overline { { \\Lambda } } _ { h + 1 } \\right\\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) / N } .\n$$", + "text_format": "latex", + "bbox": [ + 326, + 270, + 668, + 306 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Therefore, since $\\lambda = C H \\sqrt { d \\log ( d H / \\delta ) N }$ , with probability $1 - \\delta / ( 4 H )$ , we have ", + "bbox": [ + 174, + 310, + 717, + 328 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/3c7c5d913557d3e6cd3122de5023e285a00f1ee050cf0b46e2d9c9532373ac7a.jpg", + "text": "$$\n\\hat { \\Lambda } _ { h } = \\Phi _ { h } ^ { \\top } \\Phi _ { h } + \\lambda I \\succeq N \\Lambda _ { h } .\n$$", + "text_format": "latex", + "bbox": [ + 405, + 335, + 591, + 353 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Note that ", + "bbox": [ + 173, + 368, + 238, + 382 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/3f640e4d0c72d9b55eaa1cc73875fd439ff8e57122c01f2a179ebeee99f83023.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle ( { \\mathcal Q } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } } \\\\ { \\displaystyle \\leq H \\cdot \\left( \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } \\right) } \\\\ { \\displaystyle \\leq 2 H \\cdot \\left( \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } + \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot \\cdot \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } \\right) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 386, + 839, + 501 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "For each $h \\in [ H ]$ , ", + "bbox": [ + 173, + 503, + 295, + 520 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/9ec79d4746f8905d6df4d5b1764ac53c1187875809618c8fcca355596bf01604.jpg", + "text": "$$\n\\begin{array} { r l } & { \\quad \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\Phi _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\| _ { 2 } \\cdot \\| \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { 2 } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\| \\Phi _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\| _ { 2 } \\cdot \\| \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\cdot \\cdot \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { 2 } ^ { 2 } } \\\\ & \\leq \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\Lambda } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\Phi } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\Lambda } _ h ^ { \\prime } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 183, + 526, + 815, + 638 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Similarly, ", + "bbox": [ + 173, + 643, + 240, + 659 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/5c621ab495cfeba508eb079b25a59deb55cafc7a6cc84ae3556113a3a5c0ce9d.jpg", + "text": "$$\n\\begin{array} { r l } & { \\quad \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\boldsymbol { \\Lambda } } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\lambda \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } \\theta _ { h } \\| _ { \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\boldsymbol { \\Lambda } } _ { h + 1 } ^ { - 1 / 2 } \\| _ { 2 } \\Big ) \\cdot \\lambda ^ { 2 } \\cdot \\| \\theta _ { h } \\| _ { \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\lambda \\cdot H ^ { 2 } d . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 189, + 664, + 810, + 779 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "For all $h \\in [ H ]$ , we have ", + "bbox": [ + 173, + 790, + 338, + 806 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/c4d24dca6f5eeb28b52e7b0cd4cf24d79557e29cb35c1444a31ecb3b11b235b6.jpg", + "text": "$$\n\\| \\Phi _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\| _ { 2 } \\leq 1\n$$", + "text_format": "latex", + "bbox": [ + 434, + 805, + 563, + 825 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 828, + 202, + 842 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/71968eb5c3e9ed89a5967df56d332d49517ed473f83f287fb43d7ff9753f6e95.jpg", + "text": "$$\n\\begin{array} { r } { \\lVert \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } ) \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } \\leq \\lVert N \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } + \\lVert \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } - N \\overline { { \\Lambda } } _ { h } ) \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 210, + 847, + 785, + 869 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Conditioned on the event in Lemma D.1, ", + "bbox": [ + 173, + 875, + 442, + 890 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/7b8f444d1ac389152087b23af2e44d27956809a52a2ed169063423f1b4a17333.jpg", + "text": "$$\n\\hat { \\Lambda } _ { h } \\succeq N \\Lambda _ { h } \\succeq \\frac { N } { C _ { h } } \\overline { { \\Lambda } } _ { h } ,\n$$", + "text_format": "latex", + "bbox": [ + 423, + 897, + 571, + 928 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "which implies $\\| N \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\| \\le C _ { h }$ . Moreover, conditioned on the event in Lemma D.1, ", + "bbox": [ + 169, + 99, + 792, + 121 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/6e6767671c4e4636a8e1be4af157e7c41a6b480d7d433be88ac37bfbaa41ecec.jpg", + "text": "$$\n\\begin{array} { r } { \\| \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } - N \\overline { { \\boldsymbol { \\Lambda } } } _ { h } ) \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 / 2 } \\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) N } / \\lambda . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 302, + 126, + 694, + 148 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Thus, ", + "bbox": [ + 173, + 155, + 214, + 170 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/b2b2548e0ea0b422acc58fff0a4f4b8b8cbe7d7ebb26b29969d18729150d9d3a.jpg", + "text": "$$\n\\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\leq C _ { 1 } / N .\n$$", + "text_format": "latex", + "bbox": [ + 400, + 166, + 596, + 188 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 190, + 202, + 204 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/ab38e851fc8034ef60893618abc9ebaf82ebe920805527cd6413030127b47dd1.jpg", + "text": "$$\n\\begin{array} { r } { \\| \\hat { \\boldsymbol \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } ) \\hat { \\boldsymbol \\Lambda } _ { h } ^ { - 1 / 2 } \\| _ { 2 } \\leq C _ { h } + C \\sqrt { d \\log ( d H / \\delta ) N } / \\lambda . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 308, + 200, + 686, + 222 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Finally, by Theorem 1.2 in (Hsu et al., 2012a), with probability $1 - \\delta / ( 4 H )$ , for some constant $C ^ { \\prime }$ , we have ", + "bbox": [ + 171, + 224, + 828, + 251 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/338970a0fdadb8f420c39e132f02752370880618d5a28946bca55245ccfbe467.jpg", + "text": "$$\n\\begin{array} { r } { \\| \\xi _ { h } \\| _ { \\Phi _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } } ^ { 2 } \\le C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 380, + 250, + 617, + 272 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Therefore, ", + "bbox": [ + 173, + 275, + 245, + 290 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/47fb03575faea1eded3d4086e380a316e49ba6c7e6e943946002e940f7776085.jpg", + "text": "$$\n\\begin{array} { r l } & { \\quad \\quad \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } + \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\frac { C _ { 1 } } { N } ( C _ { 2 } + C \\sqrt { d \\log ( d / \\delta ) N } / \\lambda ) \\times \\cdots \\times ( C _ { h } + C \\sqrt { d \\log ( d / \\delta ) N } / \\lambda ) \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + \\lambda H } \\\\ & { \\leq \\frac { C _ { 1 } } { N } ( C _ { 2 } + 1 / H ) \\times \\cdots \\times ( C _ { h } + 1 / H ) \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + \\lambda H ^ { 2 } d ) } \\\\ & { \\leq \\frac { e } { N } C _ { 1 } \\times C _ { 2 } \\times \\cdots \\times C _ { h } \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + C d H ^ { 3 } \\sqrt { d \\log ( d H / \\delta ) N } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 169, + 295, + 816, + 417 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Let $c > 0$ be a large enough constant. We now have ", + "bbox": [ + 173, + 421, + 514, + 436 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/5de40fdf574b77713593f0e0355119c739d2cb55032e3a334d676be06484757b.jpg", + "text": "$$\n\\mathbb { E } _ { s _ { 1 } } [ ( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } ] \\leq c \\cdot \\left( \\prod _ { h = 1 } ^ { H } C _ { h } \\right) \\cdot d H ^ { 5 } \\cdot \\sqrt { \\frac { d \\log ( d H / \\delta ) } { N } } .\n$$", + "text_format": "latex", + "bbox": [ + 228, + 443, + 767, + 487 + ], + "page_idx": 19 + } +] \ No newline at end of file diff --git a/parse/train/30EvkP2aQLD/30EvkP2aQLD_middle.json b/parse/train/30EvkP2aQLD/30EvkP2aQLD_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..571f60ec88f305f64fa15f36ebb21b68e07ee06f --- /dev/null +++ b/parse/train/30EvkP2aQLD/30EvkP2aQLD_middle.json @@ -0,0 +1,63837 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 79, + 498, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 78, + 500, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 78, + 500, + 97 + ], + "score": 1.0, + "content": "WHAT ARE THE STATISTICAL LIMITS OF OFFLINE RL", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 99, + 431, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 99, + 431, + 117 + ], + "score": 1.0, + "content": "WITH LINEAR FUNCTION APPROXIMATION?", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 113, + 135, + 252, + 168 + ], + "lines": [ + { + "bbox": [ + 111, + 133, + 181, + 149 + ], + "spans": [ + { + "bbox": [ + 111, + 133, + 181, + 149 + ], + "score": 1.0, + "content": "Ruosong Wang", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 111, + 145, + 226, + 159 + ], + "spans": [ + { + "bbox": [ + 111, + 145, + 226, + 159 + ], + "score": 1.0, + "content": "Carnegie Mellon University", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 112, + 158, + 252, + 169 + ], + "spans": [ + { + "bbox": [ + 112, + 158, + 252, + 169 + ], + "score": 1.0, + "content": "ruosongw@andrew.cmu.edu", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 336, + 135, + 498, + 168 + ], + "lines": [ + { + "bbox": [ + 335, + 135, + 400, + 147 + ], + "spans": [ + { + "bbox": [ + 335, + 135, + 400, + 147 + ], + "score": 1.0, + "content": "Dean P. Foster", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 335, + 146, + 498, + 158 + ], + "spans": [ + { + "bbox": [ + 335, + 146, + 498, + 158 + ], + "score": 1.0, + "content": "University of Pennsylvania and Amazon", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 335, + 157, + 427, + 168 + ], + "spans": [ + { + "bbox": [ + 335, + 157, + 427, + 168 + ], + "score": 1.0, + "content": "dean@foster.net", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 112, + 185, + 346, + 218 + ], + "lines": [ + { + "bbox": [ + 111, + 183, + 190, + 198 + ], + "spans": [ + { + "bbox": [ + 111, + 183, + 190, + 198 + ], + "score": 1.0, + "content": "Sham M. Kakade", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 112, + 196, + 347, + 208 + ], + "spans": [ + { + "bbox": [ + 112, + 196, + 347, + 208 + ], + "score": 1.0, + "content": "University of Washington, Seattle and Microsoft Research", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 113, + 209, + 246, + 219 + ], + "spans": [ + { + "bbox": [ + 113, + 209, + 246, + 219 + ], + "score": 1.0, + "content": "sham@cs.washington.edu", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9 + }, + { + "type": "title", + "bbox": [ + 278, + 247, + 333, + 259 + ], + "lines": [ + { + "bbox": [ + 276, + 247, + 335, + 261 + ], + "spans": [ + { + "bbox": [ + 276, + 247, + 335, + 261 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 143, + 272, + 468, + 349 + ], + "lines": [ + { + "bbox": [ + 141, + 272, + 470, + 285 + ], + "spans": [ + { + "bbox": [ + 141, + 272, + 470, + 285 + ], + "score": 1.0, + "content": "Offline reinforcement learning seeks to utilize offline (observational) data to guide", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 283, + 470, + 297 + ], + "spans": [ + { + "bbox": [ + 141, + 283, + 470, + 297 + ], + "score": 1.0, + "content": "the learning of (causal) sequential decision making strategies. The hope is that", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 293, + 470, + 308 + ], + "spans": [ + { + "bbox": [ + 141, + 293, + 470, + 308 + ], + "score": 1.0, + "content": "offline reinforcement learning coupled with function approximation methods (to", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 305, + 470, + 318 + ], + "spans": [ + { + "bbox": [ + 141, + 305, + 470, + 318 + ], + "score": 1.0, + "content": "deal with the curse of dimensionality) can provide a means to help alleviate the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 316, + 469, + 329 + ], + "spans": [ + { + "bbox": [ + 141, + 316, + 469, + 329 + ], + "score": 1.0, + "content": "excessive sample complexity burden in modern sequential decision making prob-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 327, + 470, + 339 + ], + "spans": [ + { + "bbox": [ + 141, + 327, + 470, + 339 + ], + "score": 1.0, + "content": "lems. However, the extent to which this broader approach can be effective is not", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 338, + 452, + 351 + ], + "spans": [ + { + "bbox": [ + 141, + 338, + 452, + 351 + ], + "score": 1.0, + "content": "well understood, where the literature largely consists of sufficient conditions.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 143, + 351, + 468, + 482 + ], + "lines": [ + { + "bbox": [ + 142, + 351, + 469, + 363 + ], + "spans": [ + { + "bbox": [ + 142, + 351, + 469, + 363 + ], + "score": 1.0, + "content": "This work focuses on the basic question of what are necessary representational and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 362, + 469, + 374 + ], + "spans": [ + { + "bbox": [ + 142, + 362, + 469, + 374 + ], + "score": 1.0, + "content": "distributional conditions that permit provable sample-efficient offline reinforce-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 373, + 469, + 385 + ], + "spans": [ + { + "bbox": [ + 141, + 373, + 469, + 385 + ], + "score": 1.0, + "content": "ment learning. Perhaps surprisingly, our main result shows that even if: i) we have", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 384, + 470, + 396 + ], + "spans": [ + { + "bbox": [ + 141, + 384, + 470, + 396 + ], + "score": 1.0, + "content": "realizability in that the true value function of every policy is linear in a given set", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 395, + 470, + 407 + ], + "spans": [ + { + "bbox": [ + 141, + 395, + 470, + 407 + ], + "score": 1.0, + "content": "of features and 2) our off-policy data has good coverage over all features (under a", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 406, + 470, + 419 + ], + "spans": [ + { + "bbox": [ + 141, + 406, + 470, + 419 + ], + "score": 1.0, + "content": "strong spectral condition), any algorithm still (information-theoretically) requires", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 417, + 469, + 429 + ], + "spans": [ + { + "bbox": [ + 141, + 417, + 469, + 429 + ], + "score": 1.0, + "content": "a number of offline samples that is exponential in the problem horizon to non-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 428, + 469, + 441 + ], + "spans": [ + { + "bbox": [ + 141, + 428, + 469, + 441 + ], + "score": 1.0, + "content": "trivially estimate the value of any given policy. Our results highlight that sample-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 438, + 469, + 451 + ], + "spans": [ + { + "bbox": [ + 141, + 438, + 469, + 451 + ], + "score": 1.0, + "content": "efficient offline policy evaluation is not possible unless significantly stronger con-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 142, + 450, + 469, + 461 + ], + "spans": [ + { + "bbox": [ + 142, + 450, + 469, + 461 + ], + "score": 1.0, + "content": "ditions hold; such conditions include either having low distribution shift (where", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 460, + 469, + 473 + ], + "spans": [ + { + "bbox": [ + 141, + 460, + 469, + 473 + ], + "score": 1.0, + "content": "the offline data distribution is close to the distribution of the policy to be evaluated)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 471, + 442, + 485 + ], + "spans": [ + { + "bbox": [ + 141, + 471, + 442, + 485 + ], + "score": 1.0, + "content": "or significantly stronger representational conditions (beyond realizability).", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 24.5 + }, + { + "type": "title", + "bbox": [ + 108, + 503, + 206, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 502, + 208, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 208, + 519 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 528, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "Offline methods (also known as off-policy methods or batch methods) are a promising methodol-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 539, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 553 + ], + "score": 1.0, + "content": "ogy to alleviate the sample complexity burden in challenging reinforcement learning (RL) settings,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "particularly those where sample efficiency is paramount (Mandel et al., 2014; Gottesman et al.,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "2018; Wang et al., 2018; Yu et al., 2019). Off-policy methods are often applied together with func-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "tion approximation schemes; such methods take sample transition data and reward values as inputs,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "and approximate the value of a target policy or the value function of the optimal policy. Indeed,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 104, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "many practical deep RL algorithms find their prototypes in the literature of offline RL. For exam-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 455, + 618 + ], + "score": 1.0, + "content": "ple, when running on off-policy data (sometimes termed as “experience replay”), deep", + "type": "text" + }, + { + "bbox": [ + 455, + 605, + 464, + 616 + ], + "score": 0.83, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "-networks", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 370, + 628 + ], + "score": 1.0, + "content": "(DQN) (Mnih et al., 2015) can be viewed as an analog of Fitted", + "type": "text" + }, + { + "bbox": [ + 371, + 616, + 380, + 627 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "-Iteration (Gordon, 1999) with", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 505, + 639 + ], + "score": 1.0, + "content": "neural networks being the function approximators. More recently, there are an increasing number", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "of both model-free (Laroche et al., 2019; Fujimoto et al., 2019; Jaques et al., 2020; Kumar et al.,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 649, + 504, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 504, + 660 + ], + "score": 1.0, + "content": "2019; Agarwal et al., 2020) and model-based (Ross & Bagnell, 2012; Kidambi et al., 2020) offline", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 659, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 506, + 672 + ], + "score": 1.0, + "content": "RL methods, with steady improvements in performance (Fujimoto et al., 2019; Kumar et al., 2019;", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 671, + 262, + 682 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 262, + 682 + ], + "score": 1.0, + "content": "Wu et al., 2020; Kidambi et al., 2020).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 107, + 688, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 504, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 504, + 700 + ], + "score": 1.0, + "content": "However, despite the importance of these methods, the extent to which data reuse is possible, espe-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "cially when off-policy methods are combined with function approximation, is not well understood.", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 181, + 722 + ], + "score": 1.0, + "content": "For example, deep", + "type": "text" + }, + { + "bbox": [ + 182, + 710, + 191, + 721 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "-network requires millions of samples to solve certain Atari games (Mnih et al.,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "2015). Also important is that in some safety-critical settings, we seek guarantees when offline-", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 47.5 + } + ], + "page_idx": 0, + "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": [ + 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, + 79, + 498, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 78, + 500, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 78, + 500, + 97 + ], + "score": 1.0, + "content": "WHAT ARE THE STATISTICAL LIMITS OF OFFLINE RL", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 99, + 431, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 99, + 431, + 117 + ], + "score": 1.0, + "content": "WITH LINEAR FUNCTION APPROXIMATION?", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 113, + 135, + 252, + 168 + ], + "lines": [ + { + "bbox": [ + 111, + 133, + 181, + 149 + ], + "spans": [ + { + "bbox": [ + 111, + 133, + 181, + 149 + ], + "score": 1.0, + "content": "Ruosong Wang", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 111, + 145, + 226, + 159 + ], + "spans": [ + { + "bbox": [ + 111, + 145, + 226, + 159 + ], + "score": 1.0, + "content": "Carnegie Mellon University", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 112, + 158, + 252, + 169 + ], + "spans": [ + { + "bbox": [ + 112, + 158, + 252, + 169 + ], + "score": 1.0, + "content": "ruosongw@andrew.cmu.edu", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4, + "bbox_fs": [ + 111, + 133, + 252, + 169 + ] + }, + { + "type": "list", + "bbox": [ + 336, + 135, + 498, + 168 + ], + "lines": [ + { + "bbox": [ + 335, + 135, + 400, + 147 + ], + "spans": [ + { + "bbox": [ + 335, + 135, + 400, + 147 + ], + "score": 1.0, + "content": "Dean P. Foster", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 335, + 146, + 498, + 158 + ], + "spans": [ + { + "bbox": [ + 335, + 146, + 498, + 158 + ], + "score": 1.0, + "content": "University of Pennsylvania and Amazon", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 335, + 157, + 427, + 168 + ], + "spans": [ + { + "bbox": [ + 335, + 157, + 427, + 168 + ], + "score": 1.0, + "content": "dean@foster.net", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 183, + 190, + 198 + ], + "spans": [ + { + "bbox": [ + 111, + 183, + 190, + 198 + ], + "score": 1.0, + "content": "Sham M. Kakade", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 196, + 347, + 208 + ], + "spans": [ + { + "bbox": [ + 112, + 196, + 347, + 208 + ], + "score": 1.0, + "content": "University of Washington, Seattle and Microsoft Research", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 209, + 246, + 219 + ], + "spans": [ + { + "bbox": [ + 113, + 209, + 246, + 219 + ], + "score": 1.0, + "content": "sham@cs.washington.edu", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + } + ], + "index": 5, + "bbox_fs": [ + 335, + 135, + 498, + 168 + ] + }, + { + "type": "list", + "bbox": [ + 112, + 185, + 346, + 218 + ], + "lines": [], + "index": 9, + "bbox_fs": [ + 111, + 183, + 347, + 219 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 278, + 247, + 333, + 259 + ], + "lines": [ + { + "bbox": [ + 276, + 247, + 335, + 261 + ], + "spans": [ + { + "bbox": [ + 276, + 247, + 335, + 261 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 143, + 272, + 468, + 349 + ], + "lines": [ + { + "bbox": [ + 141, + 272, + 470, + 285 + ], + "spans": [ + { + "bbox": [ + 141, + 272, + 470, + 285 + ], + "score": 1.0, + "content": "Offline reinforcement learning seeks to utilize offline (observational) data to guide", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 283, + 470, + 297 + ], + "spans": [ + { + "bbox": [ + 141, + 283, + 470, + 297 + ], + "score": 1.0, + "content": "the learning of (causal) sequential decision making strategies. The hope is that", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 293, + 470, + 308 + ], + "spans": [ + { + "bbox": [ + 141, + 293, + 470, + 308 + ], + "score": 1.0, + "content": "offline reinforcement learning coupled with function approximation methods (to", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 305, + 470, + 318 + ], + "spans": [ + { + "bbox": [ + 141, + 305, + 470, + 318 + ], + "score": 1.0, + "content": "deal with the curse of dimensionality) can provide a means to help alleviate the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 316, + 469, + 329 + ], + "spans": [ + { + "bbox": [ + 141, + 316, + 469, + 329 + ], + "score": 1.0, + "content": "excessive sample complexity burden in modern sequential decision making prob-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 327, + 470, + 339 + ], + "spans": [ + { + "bbox": [ + 141, + 327, + 470, + 339 + ], + "score": 1.0, + "content": "lems. However, the extent to which this broader approach can be effective is not", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 338, + 452, + 351 + ], + "spans": [ + { + "bbox": [ + 141, + 338, + 452, + 351 + ], + "score": 1.0, + "content": "well understood, where the literature largely consists of sufficient conditions.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15, + "bbox_fs": [ + 141, + 272, + 470, + 351 + ] + }, + { + "type": "text", + "bbox": [ + 143, + 351, + 468, + 482 + ], + "lines": [ + { + "bbox": [ + 142, + 351, + 469, + 363 + ], + "spans": [ + { + "bbox": [ + 142, + 351, + 469, + 363 + ], + "score": 1.0, + "content": "This work focuses on the basic question of what are necessary representational and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 362, + 469, + 374 + ], + "spans": [ + { + "bbox": [ + 142, + 362, + 469, + 374 + ], + "score": 1.0, + "content": "distributional conditions that permit provable sample-efficient offline reinforce-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 373, + 469, + 385 + ], + "spans": [ + { + "bbox": [ + 141, + 373, + 469, + 385 + ], + "score": 1.0, + "content": "ment learning. Perhaps surprisingly, our main result shows that even if: i) we have", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 384, + 470, + 396 + ], + "spans": [ + { + "bbox": [ + 141, + 384, + 470, + 396 + ], + "score": 1.0, + "content": "realizability in that the true value function of every policy is linear in a given set", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 395, + 470, + 407 + ], + "spans": [ + { + "bbox": [ + 141, + 395, + 470, + 407 + ], + "score": 1.0, + "content": "of features and 2) our off-policy data has good coverage over all features (under a", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 406, + 470, + 419 + ], + "spans": [ + { + "bbox": [ + 141, + 406, + 470, + 419 + ], + "score": 1.0, + "content": "strong spectral condition), any algorithm still (information-theoretically) requires", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 417, + 469, + 429 + ], + "spans": [ + { + "bbox": [ + 141, + 417, + 469, + 429 + ], + "score": 1.0, + "content": "a number of offline samples that is exponential in the problem horizon to non-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 428, + 469, + 441 + ], + "spans": [ + { + "bbox": [ + 141, + 428, + 469, + 441 + ], + "score": 1.0, + "content": "trivially estimate the value of any given policy. Our results highlight that sample-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 438, + 469, + 451 + ], + "spans": [ + { + "bbox": [ + 141, + 438, + 469, + 451 + ], + "score": 1.0, + "content": "efficient offline policy evaluation is not possible unless significantly stronger con-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 142, + 450, + 469, + 461 + ], + "spans": [ + { + "bbox": [ + 142, + 450, + 469, + 461 + ], + "score": 1.0, + "content": "ditions hold; such conditions include either having low distribution shift (where", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 141, + 460, + 469, + 473 + ], + "spans": [ + { + "bbox": [ + 141, + 460, + 469, + 473 + ], + "score": 1.0, + "content": "the offline data distribution is close to the distribution of the policy to be evaluated)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 471, + 442, + 485 + ], + "spans": [ + { + "bbox": [ + 141, + 471, + 442, + 485 + ], + "score": 1.0, + "content": "or significantly stronger representational conditions (beyond realizability).", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 24.5, + "bbox_fs": [ + 141, + 351, + 470, + 485 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 503, + 206, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 502, + 208, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 208, + 519 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 528, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "Offline methods (also known as off-policy methods or batch methods) are a promising methodol-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 539, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 553 + ], + "score": 1.0, + "content": "ogy to alleviate the sample complexity burden in challenging reinforcement learning (RL) settings,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "particularly those where sample efficiency is paramount (Mandel et al., 2014; Gottesman et al.,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "2018; Wang et al., 2018; Yu et al., 2019). Off-policy methods are often applied together with func-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 585 + ], + "score": 1.0, + "content": "tion approximation schemes; such methods take sample transition data and reward values as inputs,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "and approximate the value of a target policy or the value function of the optimal policy. Indeed,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 104, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "many practical deep RL algorithms find their prototypes in the literature of offline RL. For exam-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 455, + 618 + ], + "score": 1.0, + "content": "ple, when running on off-policy data (sometimes termed as “experience replay”), deep", + "type": "text" + }, + { + "bbox": [ + 455, + 605, + 464, + 616 + ], + "score": 0.83, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "-networks", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 370, + 628 + ], + "score": 1.0, + "content": "(DQN) (Mnih et al., 2015) can be viewed as an analog of Fitted", + "type": "text" + }, + { + "bbox": [ + 371, + 616, + 380, + 627 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "-Iteration (Gordon, 1999) with", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 505, + 639 + ], + "score": 1.0, + "content": "neural networks being the function approximators. More recently, there are an increasing number", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "of both model-free (Laroche et al., 2019; Fujimoto et al., 2019; Jaques et al., 2020; Kumar et al.,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 649, + 504, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 504, + 660 + ], + "score": 1.0, + "content": "2019; Agarwal et al., 2020) and model-based (Ross & Bagnell, 2012; Kidambi et al., 2020) offline", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 659, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 506, + 672 + ], + "score": 1.0, + "content": "RL methods, with steady improvements in performance (Fujimoto et al., 2019; Kumar et al., 2019;", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 671, + 262, + 682 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 262, + 682 + ], + "score": 1.0, + "content": "Wu et al., 2020; Kidambi et al., 2020).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 38.5, + "bbox_fs": [ + 104, + 528, + 506, + 682 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 688, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 504, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 504, + 700 + ], + "score": 1.0, + "content": "However, despite the importance of these methods, the extent to which data reuse is possible, espe-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "cially when off-policy methods are combined with function approximation, is not well understood.", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 181, + 722 + ], + "score": 1.0, + "content": "For example, deep", + "type": "text" + }, + { + "bbox": [ + 182, + 710, + 191, + 721 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "-network requires millions of samples to solve certain Atari games (Mnih et al.,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "2015). Also important is that in some safety-critical settings, we seek guarantees when offline-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "trained policies can be effective (Thomas, 2014; Thomas et al., 2019). A basic question here is", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 504, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 504, + 105 + ], + "score": 1.0, + "content": "that if there are fundamental statistical limits on such methods, where sample-efficient offline RL is", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 361, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 361, + 117 + ], + "score": 1.0, + "content": "simply not possible without further restrictions on the problem.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 47.5, + "bbox_fs": [ + 105, + 687, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "trained policies can be effective (Thomas, 2014; Thomas et al., 2019). A basic question here is", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 504, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 504, + 105 + ], + "score": 1.0, + "content": "that if there are fundamental statistical limits on such methods, where sample-efficient offline RL is", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 361, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 361, + 117 + ], + "score": 1.0, + "content": "simply not possible without further restrictions on the problem.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 198 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "In the context of supervised learning, it is well-known that empirical risk minimization is sample-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "efficient if the hypothesis class has bounded complexity. For example, suppose the agent is given", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 114, + 156 + ], + "score": 1.0, + "content": "a", + "type": "text" + }, + { + "bbox": [ + 115, + 144, + 121, + 154 + ], + "score": 0.79, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "-dimensional feature extractor, and the ground truth labeling function is a (realizable) linear", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "function with respect to the feature mapping. Here, it is well-known that a polynomial number", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 164, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 164, + 178 + ], + "score": 1.0, + "content": "of samples in", + "type": "text" + }, + { + "bbox": [ + 164, + 166, + 171, + 175 + ], + "score": 0.74, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 164, + 506, + 178 + ], + "score": 1.0, + "content": "suffice for a given target accuracy. Furthermore, in this realizable case, provided", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "the training data has a good feature coverage, then we will have good accuracy against any test", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 160, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 160, + 199 + ], + "score": 1.0, + "content": "distribution.1", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 105, + 204, + 504, + 226 + ], + "lines": [ + { + "bbox": [ + 106, + 204, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 505, + 216 + ], + "score": 1.0, + "content": "In the more challenging offline RL setting, it is unclear if sample-efficient methods are possible,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 215, + 482, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 482, + 227 + ], + "score": 1.0, + "content": "even under analogous assumptions. This is our motivation to consider the following question:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "title", + "bbox": [ + 133, + 236, + 477, + 248 + ], + "lines": [ + { + "bbox": [ + 133, + 235, + 478, + 249 + ], + "spans": [ + { + "bbox": [ + 133, + 235, + 478, + 249 + ], + "score": 1.0, + "content": "What are the statistical limits for offline RL with linear function approximation?", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 257, + 505, + 301 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "score": 1.0, + "content": "Here, one may hope that value estimation for a given policy is possible in the offline RL setting", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "under the analogous set of assumptions that enable sample-efficient supervised learning, i.e., 1)", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "(realizability) the features can perfectly represent the value functions and 2) (good coverage) the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 290, + 426, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 426, + 303 + ], + "score": 1.0, + "content": "feature covariance matrix of our off-policy data has lower bounded eigenvalues.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 107, + 307, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 307, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 506, + 320 + ], + "score": 1.0, + "content": "The extant body of provable methods on offline RL either make representational assumptions that are", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 317, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 506, + 333 + ], + "score": 1.0, + "content": "far stronger than realizability or assume distribution shift conditions that are far stronger than having", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "score": 1.0, + "content": "coverage with regards to the spectrum of the feature covariance matrix of the data distribution. For", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 340, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 506, + 353 + ], + "score": 1.0, + "content": "example, Szepesvari & Munos (2005) analyze offline RL methods by assuming a representational ´", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 351, + 506, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 364 + ], + "score": 1.0, + "content": "condition where the features satisfy (approximate) closedness under Bellman updates, which is a far", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "score": 1.0, + "content": "stronger representation condition than realizability. Recently, Xie & Jiang (2020a) propose a offline", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "score": 1.0, + "content": "RL algorithm that only requires realizability as the representation condition. However, the algorithm", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "in (Xie & Jiang, 2020a) requires a more stringent data distribution condition. Whether it is possible", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "score": 1.0, + "content": "to design a sample-efficient offline RL method under the realizability assumption and a reasonable", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "data coverage assumption — an open problem in (Chen & Jiang, 2019) — is the focus of this work.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 107, + 430, + 505, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "score": 1.0, + "content": "Our Contributions. Perhaps surprisingly, our main result shows that, under only the above two", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "assumptions, it is information-theoretically not possible to design a sample-efficient algorithm to", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 452, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 506, + 465 + ], + "score": 1.0, + "content": "non-trivially estimate the value of a given policy. The following theorem is an informal version of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 464, + 199, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 199, + 474 + ], + "score": 1.0, + "content": "the result in Section 4.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 478, + 505, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 491 + ], + "score": 1.0, + "content": "Theorem 1.1 (Informal). In the offline RL setting, suppose the data distributions have (polynomi-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 488, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 276, + 502 + ], + "score": 1.0, + "content": "ally) lower bounded eigenvalues, and the", + "type": "text" + }, + { + "bbox": [ + 276, + 489, + 286, + 501 + ], + "score": 0.78, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 488, + 506, + 502 + ], + "score": 1.0, + "content": "-functions of every policy are linear with respect to a", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "score": 1.0, + "content": "given feature mapping. Any algorithm requires an exponential number of samples in the horizon", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 509, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 107, + 511, + 117, + 521 + ], + "score": 0.47, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 509, + 435, + 525 + ], + "score": 1.0, + "content": "to output a non-trivially accurate estimate of the value of any given policy", + "type": "text" + }, + { + "bbox": [ + 435, + 513, + 442, + 521 + ], + "score": 0.69, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 509, + 505, + 525 + ], + "score": 1.0, + "content": ", with constant", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 522, + 154, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 154, + 536 + ], + "score": 1.0, + "content": "probability.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 543, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 279, + 555 + ], + "score": 1.0, + "content": "This hardness result states that even if the", + "type": "text" + }, + { + "bbox": [ + 279, + 543, + 288, + 555 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 543, + 505, + 555 + ], + "score": 1.0, + "content": "-functions of all polices are linear with respect to the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "score": 1.0, + "content": "given feature mapping, we still require an exponential number of samples to evaluate any given", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 565, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 578 + ], + "score": 1.0, + "content": "policy. Note that this representation condition is significantly stronger than assuming realizability", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 577, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 588 + ], + "score": 1.0, + "content": "with regards to only a single target policy; it assumes realizability for all policies. Regardless, even", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "under this stronger representation condition, it is hard to evaluate any policy, as specified in our", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 598, + 171, + 610 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 171, + 610 + ], + "score": 1.0, + "content": "hardness result.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 106, + 614, + 505, + 692 + ], + "lines": [ + { + "bbox": [ + 106, + 615, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 615, + 505, + 627 + ], + "score": 1.0, + "content": "This result also formalizes a key issue in offline reinforcement learning with function approxima-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 626, + 505, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 638 + ], + "score": 1.0, + "content": "tion: geometric error amplification. To better illustrate the issue, in Section 5, we analyze the clas-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "score": 1.0, + "content": "sical Least-Squares Policy Evaluation (LSPE) algorithm under the realizability assumption, which", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "demonstrates how the error propagates as the algorithm proceeds. Here, our analysis shows that,", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 659, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 671 + ], + "score": 1.0, + "content": "if we only rely on the realizability assumption, then a far more stringent condition is required for", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 670, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 682 + ], + "score": 1.0, + "content": "sample-efficient offline policy evaluation: the off-policy data distribution must be quite close to the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 680, + 308, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 308, + 693 + ], + "score": 1.0, + "content": "distribution induced by the policy to be evaluated.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 45 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 701, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 118, + 700, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 118, + 700, + 506, + 713 + ], + "score": 1.0, + "content": "1Specifically, if the features have a uniformly bounded norm and if the minimum eigenvalue of the feature", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 710, + 505, + 725 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 332, + 725 + ], + "score": 1.0, + "content": "covariance matrix of our data is bounded away from 0, say by", + "type": "text" + }, + { + "bbox": [ + 333, + 712, + 370, + 722 + ], + "score": 0.85, + "content": "1 / \\mathrm { p o l y } ( d )", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 710, + 505, + 725 + ], + "score": 1.0, + "content": ", then we have good accuracy on any", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 722, + 341, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 722, + 341, + 732 + ], + "score": 1.0, + "content": "test distribution. See Assumption 2 and the comments thereafter.", + "type": "text" + } + ] + } + ] + }, + { + "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, + 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, + 115 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 81, + 505, + 117 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 198 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "In the context of supervised learning, it is well-known that empirical risk minimization is sample-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "efficient if the hypothesis class has bounded complexity. For example, suppose the agent is given", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 114, + 156 + ], + "score": 1.0, + "content": "a", + "type": "text" + }, + { + "bbox": [ + 115, + 144, + 121, + 154 + ], + "score": 0.79, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "-dimensional feature extractor, and the ground truth labeling function is a (realizable) linear", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "function with respect to the feature mapping. Here, it is well-known that a polynomial number", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 164, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 164, + 178 + ], + "score": 1.0, + "content": "of samples in", + "type": "text" + }, + { + "bbox": [ + 164, + 166, + 171, + 175 + ], + "score": 0.74, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 164, + 506, + 178 + ], + "score": 1.0, + "content": "suffice for a given target accuracy. Furthermore, in this realizable case, provided", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "the training data has a good feature coverage, then we will have good accuracy against any test", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 160, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 160, + 199 + ], + "score": 1.0, + "content": "distribution.1", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 121, + 506, + 199 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 204, + 504, + 226 + ], + "lines": [ + { + "bbox": [ + 106, + 204, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 505, + 216 + ], + "score": 1.0, + "content": "In the more challenging offline RL setting, it is unclear if sample-efficient methods are possible,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 215, + 482, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 482, + 227 + ], + "score": 1.0, + "content": "even under analogous assumptions. This is our motivation to consider the following question:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 204, + 505, + 227 + ] + }, + { + "type": "title", + "bbox": [ + 133, + 236, + 477, + 248 + ], + "lines": [ + { + "bbox": [ + 133, + 235, + 478, + 249 + ], + "spans": [ + { + "bbox": [ + 133, + 235, + 478, + 249 + ], + "score": 1.0, + "content": "What are the statistical limits for offline RL with linear function approximation?", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 257, + 505, + 301 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "score": 1.0, + "content": "Here, one may hope that value estimation for a given policy is possible in the offline RL setting", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "under the analogous set of assumptions that enable sample-efficient supervised learning, i.e., 1)", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "(realizability) the features can perfectly represent the value functions and 2) (good coverage) the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 290, + 426, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 426, + 303 + ], + "score": 1.0, + "content": "feature covariance matrix of our off-policy data has lower bounded eigenvalues.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 257, + 506, + 303 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 307, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 307, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 506, + 320 + ], + "score": 1.0, + "content": "The extant body of provable methods on offline RL either make representational assumptions that are", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 317, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 506, + 333 + ], + "score": 1.0, + "content": "far stronger than realizability or assume distribution shift conditions that are far stronger than having", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "score": 1.0, + "content": "coverage with regards to the spectrum of the feature covariance matrix of the data distribution. For", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 340, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 506, + 353 + ], + "score": 1.0, + "content": "example, Szepesvari & Munos (2005) analyze offline RL methods by assuming a representational ´", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 351, + 506, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 364 + ], + "score": 1.0, + "content": "condition where the features satisfy (approximate) closedness under Bellman updates, which is a far", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 505, + 375 + ], + "score": 1.0, + "content": "stronger representation condition than realizability. Recently, Xie & Jiang (2020a) propose a offline", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "score": 1.0, + "content": "RL algorithm that only requires realizability as the representation condition. However, the algorithm", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "in (Xie & Jiang, 2020a) requires a more stringent data distribution condition. Whether it is possible", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "score": 1.0, + "content": "to design a sample-efficient offline RL method under the realizability assumption and a reasonable", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "data coverage assumption — an open problem in (Chen & Jiang, 2019) — is the focus of this work.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 307, + 506, + 419 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 430, + 505, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "score": 1.0, + "content": "Our Contributions. Perhaps surprisingly, our main result shows that, under only the above two", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "assumptions, it is information-theoretically not possible to design a sample-efficient algorithm to", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 452, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 506, + 465 + ], + "score": 1.0, + "content": "non-trivially estimate the value of a given policy. The following theorem is an informal version of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 464, + 199, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 199, + 474 + ], + "score": 1.0, + "content": "the result in Section 4.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 429, + 506, + 474 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 478, + 505, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 491 + ], + "score": 1.0, + "content": "Theorem 1.1 (Informal). In the offline RL setting, suppose the data distributions have (polynomi-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 488, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 276, + 502 + ], + "score": 1.0, + "content": "ally) lower bounded eigenvalues, and the", + "type": "text" + }, + { + "bbox": [ + 276, + 489, + 286, + 501 + ], + "score": 0.78, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 488, + 506, + 502 + ], + "score": 1.0, + "content": "-functions of every policy are linear with respect to a", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "score": 1.0, + "content": "given feature mapping. Any algorithm requires an exponential number of samples in the horizon", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 509, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 107, + 511, + 117, + 521 + ], + "score": 0.47, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 509, + 435, + 525 + ], + "score": 1.0, + "content": "to output a non-trivially accurate estimate of the value of any given policy", + "type": "text" + }, + { + "bbox": [ + 435, + 513, + 442, + 521 + ], + "score": 0.69, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 509, + 505, + 525 + ], + "score": 1.0, + "content": ", with constant", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 522, + 154, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 154, + 536 + ], + "score": 1.0, + "content": "probability.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 477, + 506, + 536 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 543, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 279, + 555 + ], + "score": 1.0, + "content": "This hardness result states that even if the", + "type": "text" + }, + { + "bbox": [ + 279, + 543, + 288, + 555 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 543, + 505, + 555 + ], + "score": 1.0, + "content": "-functions of all polices are linear with respect to the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "score": 1.0, + "content": "given feature mapping, we still require an exponential number of samples to evaluate any given", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 565, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 578 + ], + "score": 1.0, + "content": "policy. Note that this representation condition is significantly stronger than assuming realizability", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 577, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 588 + ], + "score": 1.0, + "content": "with regards to only a single target policy; it assumes realizability for all policies. Regardless, even", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "under this stronger representation condition, it is hard to evaluate any policy, as specified in our", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 598, + 171, + 610 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 171, + 610 + ], + "score": 1.0, + "content": "hardness result.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 543, + 506, + 610 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 614, + 505, + 692 + ], + "lines": [ + { + "bbox": [ + 106, + 615, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 615, + 505, + 627 + ], + "score": 1.0, + "content": "This result also formalizes a key issue in offline reinforcement learning with function approxima-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 626, + 505, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 638 + ], + "score": 1.0, + "content": "tion: geometric error amplification. To better illustrate the issue, in Section 5, we analyze the clas-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "score": 1.0, + "content": "sical Least-Squares Policy Evaluation (LSPE) algorithm under the realizability assumption, which", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "demonstrates how the error propagates as the algorithm proceeds. Here, our analysis shows that,", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 659, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 671 + ], + "score": 1.0, + "content": "if we only rely on the realizability assumption, then a far more stringent condition is required for", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 670, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 682 + ], + "score": 1.0, + "content": "sample-efficient offline policy evaluation: the off-policy data distribution must be quite close to the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 680, + 308, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 308, + 693 + ], + "score": 1.0, + "content": "distribution induced by the policy to be evaluated.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 615, + 505, + 693 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "Our results highlight that sample-efficient offline RL is simply not possible unless either the distri-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "bution shift condition is sufficiently mild or we have stronger representation conditions that go well", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 316, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 316, + 116 + ], + "score": 1.0, + "content": "beyond realizability. See Section 5 for more details.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 108, + 121, + 502, + 155 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 504, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 504, + 135 + ], + "score": 1.0, + "content": "Furthermore, our hardness result implies an exponential separation on the sample complexity be-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 131, + 504, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 504, + 145 + ], + "score": 1.0, + "content": "tween offline RL and supervised learning, since supervised learning (which is equivalent to offline", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 504, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 141, + 156 + ], + "score": 1.0, + "content": "RL with", + "type": "text" + }, + { + "bbox": [ + 142, + 144, + 171, + 154 + ], + "score": 0.88, + "content": "H = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 144, + 504, + 156 + ], + "score": 1.0, + "content": ") is possible with polynomial number of samples under the same set of assumptions.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 108, + 160, + 479, + 172 + ], + "lines": [ + { + "bbox": [ + 105, + 159, + 480, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 480, + 173 + ], + "score": 1.0, + "content": "A few additional points are worth emphasizing with regards to our lower bound construction:", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 177, + 506, + 353 + ], + "lines": [ + { + "bbox": [ + 108, + 177, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 108, + 177, + 505, + 190 + ], + "score": 1.0, + "content": "• Our results imply that Least-Squares Policy Evaluation (LSPE, i.e., using Bellman backups with", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 188, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 116, + 188, + 505, + 200 + ], + "score": 1.0, + "content": "linear regression) will fail. Interestingly, while LSPE will provide an unbiased estimator, our", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 199, + 415, + 212 + ], + "spans": [ + { + "bbox": [ + 115, + 199, + 415, + 212 + ], + "score": 1.0, + "content": "results imply that it will have exponential variance in the problem horizon.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 111, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 111, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "Our construction is simple and does not rely on having a large state or action space: the size of", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 220, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 115, + 220, + 206, + 234 + ], + "score": 1.0, + "content": "the state space is only", + "type": "text" + }, + { + "bbox": [ + 207, + 221, + 245, + 233 + ], + "score": 0.93, + "content": "O ( d \\cdot H )", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 220, + 273, + 234 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 273, + 222, + 280, + 231 + ], + "score": 0.8, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 220, + 396, + 234 + ], + "score": 1.0, + "content": "is the feature dimension and", + "type": "text" + }, + { + "bbox": [ + 397, + 221, + 407, + 231 + ], + "score": 0.74, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 220, + 505, + 234 + ], + "score": 1.0, + "content": "is the planning horizon,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 232, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 115, + 232, + 505, + 244 + ], + "score": 1.0, + "content": "and the size of the action space is only is 2. This stands in contrast to other RL lower bounds,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 243, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 116, + 243, + 505, + 256 + ], + "score": 1.0, + "content": "which typically require state spaces that are exponential in the problem horizon (e.g. see (Du", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 254, + 173, + 266 + ], + "spans": [ + { + "bbox": [ + 115, + 254, + 173, + 266 + ], + "score": 1.0, + "content": "et al., 2020)).", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 265, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 107, + 265, + 505, + 277 + ], + "score": 1.0, + "content": "• We provide two hard instances, one with a sparse reward (and stochastic transitions) and another", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 275, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 115, + 275, + 505, + 289 + ], + "score": 1.0, + "content": "with deterministic dynamics (and stochastic rewards). These two hard instances jointly imply that", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 287, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 116, + 287, + 505, + 299 + ], + "score": 1.0, + "content": "both the estimation error on reward values and the estimation error on the transition probabilities", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 298, + 305, + 309 + ], + "spans": [ + { + "bbox": [ + 116, + 298, + 305, + 309 + ], + "score": 1.0, + "content": "could be geometrically amplified in offline RL.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 114, + 308, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 114, + 308, + 505, + 321 + ], + "score": 1.0, + "content": "Of possibly broader interest is that our hard instances are, to our knowledge, the first concrete", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 320, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 115, + 320, + 505, + 332 + ], + "score": 1.0, + "content": "examples showing that geometric error amplification is real in RL problems (even with realizabil-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 330, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 506, + 343 + ], + "score": 1.0, + "content": "ity). While this is a known concern in the analysis of RL algorithms, there have been no concrete", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 342, + 410, + 355 + ], + "spans": [ + { + "bbox": [ + 115, + 342, + 410, + 355 + ], + "score": 1.0, + "content": "examples exhibiting such behavior under only a realizability assumption.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 14.5 + }, + { + "type": "title", + "bbox": [ + 108, + 378, + 211, + 390 + ], + "lines": [ + { + "bbox": [ + 105, + 376, + 213, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 213, + 392 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 408, + 505, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 408, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 408, + 505, + 420 + ], + "score": 1.0, + "content": "We now survey prior work on offline RL, largely focusing on theoretical results. We also discuss", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "results on the error amplification issue in RL. Concurrent to this work, Xie & Jiang (2020a) propose", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 430, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 505, + 443 + ], + "score": 1.0, + "content": "a offline RL algorithm under the realizability assumption, which requires stronger distribution shift", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 441, + 290, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 290, + 453 + ], + "score": 1.0, + "content": "conditions. We will discuss this work shortly.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 473, + 505, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "score": 1.0, + "content": "Existing Algorithms and Analysis. Offline RL with value function approximation is closely re-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "score": 1.0, + "content": "lated to Approximate Dynamic Programming (Bertsekas & Tsitsiklis, 1995). Existing work (Munos,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "score": 1.0, + "content": "2003; Szepesvari & Munos, 2005; Antos et al., 2008; Munos & Szepesv ´ ari, 2008; Tosatto et al., ´", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 505, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 520 + ], + "score": 1.0, + "content": "2017; Xie & Jiang, 2020b; Duan & Wang, 2020) that analyze the sample complexity of approximate", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 516, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 531 + ], + "score": 1.0, + "content": "dynamic programming-based approaches usually make the following two categories of assumptions:", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "(i) representation conditions that assume the function class approximates the value functions well", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 538, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 553 + ], + "score": 1.0, + "content": "and (ii) distribution shift conditions that assume the given data distribution has sufficient coverage", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "over the state-action space. As mentioned in the introduction, the desired representation condition", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "would be realizability, which only assumes the value function of the policy to be evaluated lies in", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "the function class (for the case of offline policy evaluation) or the optimal value function lies in", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "score": 1.0, + "content": "the function class (for the case of finding near-optimal policies), and existing works usually make", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 594, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 104, + 594, + 505, + 608 + ], + "score": 1.0, + "content": "stronger assumptions. For example, Szepesvari & Munos (2005); Duan & Wang (2020) assume (ap- ´", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 605, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 506, + 618 + ], + "score": 1.0, + "content": "proximate) closedness under Bellman updates, which is much stronger than realizability. Whether", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "it is possible to design a sample-efficient offline RL method under the realizability assumption and", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 627, + 466, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 466, + 640 + ], + "score": 1.0, + "content": "reasonable data coverage assumption, is left as an open problem in (Chen & Jiang, 2019).", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 644, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "To measure the coverage over the state-action space of the given data distribution, existing works", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "assume the concentrability coefficient (introduced by Munos (2003)) to be bounded. The concen-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "trability coefficient, informally speaking, is the largest possible ratio between the probability for a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 174, + 689 + ], + "score": 1.0, + "content": "state-action pair", + "type": "text" + }, + { + "bbox": [ + 174, + 677, + 197, + 689 + ], + "score": 0.92, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 677, + 399, + 689 + ], + "score": 1.0, + "content": "to be visited by a policy, and the probability that", + "type": "text" + }, + { + "bbox": [ + 400, + 677, + 423, + 689 + ], + "score": 0.9, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "appears on the data", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "distribution. Since we work with linear function approximation in this work, we measure the distri-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "bution shift in terms of the spectrum of the feature covariance matrices (see Assumption 2), which", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "is a well-known sufficient condition in the context of supervised learning and is much more natural", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 720, + 289, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 289, + 733 + ], + "score": 1.0, + "content": "for the case of linear function approximation.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 46.5 + } + ], + "page_idx": 2, + "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, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "Our results highlight that sample-efficient offline RL is simply not possible unless either the distri-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "bution shift condition is sufficiently mild or we have stronger representation conditions that go well", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 316, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 316, + 116 + ], + "score": 1.0, + "content": "beyond realizability. See Section 5 for more details.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 116 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 121, + 502, + 155 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 504, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 504, + 135 + ], + "score": 1.0, + "content": "Furthermore, our hardness result implies an exponential separation on the sample complexity be-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 131, + 504, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 504, + 145 + ], + "score": 1.0, + "content": "tween offline RL and supervised learning, since supervised learning (which is equivalent to offline", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 504, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 141, + 156 + ], + "score": 1.0, + "content": "RL with", + "type": "text" + }, + { + "bbox": [ + 142, + 144, + 171, + 154 + ], + "score": 0.88, + "content": "H = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 144, + 504, + 156 + ], + "score": 1.0, + "content": ") is possible with polynomial number of samples under the same set of assumptions.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 121, + 504, + 156 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 160, + 479, + 172 + ], + "lines": [ + { + "bbox": [ + 105, + 159, + 480, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 480, + 173 + ], + "score": 1.0, + "content": "A few additional points are worth emphasizing with regards to our lower bound construction:", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 159, + 480, + 173 + ] + }, + { + "type": "list", + "bbox": [ + 106, + 177, + 506, + 353 + ], + "lines": [ + { + "bbox": [ + 108, + 177, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 108, + 177, + 505, + 190 + ], + "score": 1.0, + "content": "• Our results imply that Least-Squares Policy Evaluation (LSPE, i.e., using Bellman backups with", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 188, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 116, + 188, + 505, + 200 + ], + "score": 1.0, + "content": "linear regression) will fail. Interestingly, while LSPE will provide an unbiased estimator, our", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 199, + 415, + 212 + ], + "spans": [ + { + "bbox": [ + 115, + 199, + 415, + 212 + ], + "score": 1.0, + "content": "results imply that it will have exponential variance in the problem horizon.", + "type": "text" + } + ], + "index": 9, + "is_list_end_line": true + }, + { + "bbox": [ + 111, + 210, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 111, + 210, + 506, + 223 + ], + "score": 1.0, + "content": "Our construction is simple and does not rely on having a large state or action space: the size of", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 220, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 115, + 220, + 206, + 234 + ], + "score": 1.0, + "content": "the state space is only", + "type": "text" + }, + { + "bbox": [ + 207, + 221, + 245, + 233 + ], + "score": 0.93, + "content": "O ( d \\cdot H )", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 220, + 273, + 234 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 273, + 222, + 280, + 231 + ], + "score": 0.8, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 220, + 396, + 234 + ], + "score": 1.0, + "content": "is the feature dimension and", + "type": "text" + }, + { + "bbox": [ + 397, + 221, + 407, + 231 + ], + "score": 0.74, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 220, + 505, + 234 + ], + "score": 1.0, + "content": "is the planning horizon,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 232, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 115, + 232, + 505, + 244 + ], + "score": 1.0, + "content": "and the size of the action space is only is 2. This stands in contrast to other RL lower bounds,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 243, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 116, + 243, + 505, + 256 + ], + "score": 1.0, + "content": "which typically require state spaces that are exponential in the problem horizon (e.g. see (Du", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 254, + 173, + 266 + ], + "spans": [ + { + "bbox": [ + 115, + 254, + 173, + 266 + ], + "score": 1.0, + "content": "et al., 2020)).", + "type": "text" + } + ], + "index": 14, + "is_list_end_line": true + }, + { + "bbox": [ + 107, + 265, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 107, + 265, + 505, + 277 + ], + "score": 1.0, + "content": "• We provide two hard instances, one with a sparse reward (and stochastic transitions) and another", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 275, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 115, + 275, + 505, + 289 + ], + "score": 1.0, + "content": "with deterministic dynamics (and stochastic rewards). These two hard instances jointly imply that", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 287, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 116, + 287, + 505, + 299 + ], + "score": 1.0, + "content": "both the estimation error on reward values and the estimation error on the transition probabilities", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 298, + 305, + 309 + ], + "spans": [ + { + "bbox": [ + 116, + 298, + 305, + 309 + ], + "score": 1.0, + "content": "could be geometrically amplified in offline RL.", + "type": "text" + } + ], + "index": 18, + "is_list_end_line": true + }, + { + "bbox": [ + 114, + 308, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 114, + 308, + 505, + 321 + ], + "score": 1.0, + "content": "Of possibly broader interest is that our hard instances are, to our knowledge, the first concrete", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 320, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 115, + 320, + 505, + 332 + ], + "score": 1.0, + "content": "examples showing that geometric error amplification is real in RL problems (even with realizabil-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 330, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 506, + 343 + ], + "score": 1.0, + "content": "ity). While this is a known concern in the analysis of RL algorithms, there have been no concrete", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 342, + 410, + 355 + ], + "spans": [ + { + "bbox": [ + 115, + 342, + 410, + 355 + ], + "score": 1.0, + "content": "examples exhibiting such behavior under only a realizability assumption.", + "type": "text" + } + ], + "index": 22, + "is_list_end_line": true + } + ], + "index": 14.5, + "bbox_fs": [ + 107, + 177, + 506, + 355 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 378, + 211, + 390 + ], + "lines": [ + { + "bbox": [ + 105, + 376, + 213, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 213, + 392 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 408, + 505, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 408, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 408, + 505, + 420 + ], + "score": 1.0, + "content": "We now survey prior work on offline RL, largely focusing on theoretical results. We also discuss", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "results on the error amplification issue in RL. Concurrent to this work, Xie & Jiang (2020a) propose", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 430, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 505, + 443 + ], + "score": 1.0, + "content": "a offline RL algorithm under the realizability assumption, which requires stronger distribution shift", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 441, + 290, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 290, + 453 + ], + "score": 1.0, + "content": "conditions. We will discuss this work shortly.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 408, + 505, + 453 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 473, + 505, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 505, + 486 + ], + "score": 1.0, + "content": "Existing Algorithms and Analysis. Offline RL with value function approximation is closely re-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "score": 1.0, + "content": "lated to Approximate Dynamic Programming (Bertsekas & Tsitsiklis, 1995). Existing work (Munos,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "score": 1.0, + "content": "2003; Szepesvari & Munos, 2005; Antos et al., 2008; Munos & Szepesv ´ ari, 2008; Tosatto et al., ´", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 505, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 505, + 520 + ], + "score": 1.0, + "content": "2017; Xie & Jiang, 2020b; Duan & Wang, 2020) that analyze the sample complexity of approximate", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 516, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 531 + ], + "score": 1.0, + "content": "dynamic programming-based approaches usually make the following two categories of assumptions:", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "(i) representation conditions that assume the function class approximates the value functions well", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 538, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 553 + ], + "score": 1.0, + "content": "and (ii) distribution shift conditions that assume the given data distribution has sufficient coverage", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "over the state-action space. As mentioned in the introduction, the desired representation condition", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "would be realizability, which only assumes the value function of the policy to be evaluated lies in", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "the function class (for the case of offline policy evaluation) or the optimal value function lies in", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "score": 1.0, + "content": "the function class (for the case of finding near-optimal policies), and existing works usually make", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 594, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 104, + 594, + 505, + 608 + ], + "score": 1.0, + "content": "stronger assumptions. For example, Szepesvari & Munos (2005); Duan & Wang (2020) assume (ap- ´", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 605, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 506, + 618 + ], + "score": 1.0, + "content": "proximate) closedness under Bellman updates, which is much stronger than realizability. Whether", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "it is possible to design a sample-efficient offline RL method under the realizability assumption and", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 627, + 466, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 466, + 640 + ], + "score": 1.0, + "content": "reasonable data coverage assumption, is left as an open problem in (Chen & Jiang, 2019).", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 35, + "bbox_fs": [ + 104, + 473, + 506, + 640 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 644, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "To measure the coverage over the state-action space of the given data distribution, existing works", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "assume the concentrability coefficient (introduced by Munos (2003)) to be bounded. The concen-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "trability coefficient, informally speaking, is the largest possible ratio between the probability for a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 174, + 689 + ], + "score": 1.0, + "content": "state-action pair", + "type": "text" + }, + { + "bbox": [ + 174, + 677, + 197, + 689 + ], + "score": 0.92, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 677, + 399, + 689 + ], + "score": 1.0, + "content": "to be visited by a policy, and the probability that", + "type": "text" + }, + { + "bbox": [ + 400, + 677, + 423, + 689 + ], + "score": 0.9, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "appears on the data", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "distribution. Since we work with linear function approximation in this work, we measure the distri-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "bution shift in terms of the spectrum of the feature covariance matrices (see Assumption 2), which", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "is a well-known sufficient condition in the context of supervised learning and is much more natural", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 720, + 289, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 289, + 733 + ], + "score": 1.0, + "content": "for the case of linear function approximation.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 644, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Concurrent to this work, Xie & Jiang (2020a) propose an algorithm that works under the realizabil-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "ity assumption instead of other stronger representation conditions used in prior work. However, the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "algorithm in (Xie & Jiang, 2020a) requires a much stronger data distribution condition which as-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "score": 1.0, + "content": "sumes a stringent version of concentrability coefficient introduced by (Munos, 2003) to be bounded.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "score": 1.0, + "content": "In contrast, in this work we measure the distribution shift in terms of the spectrum of the feature", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 137, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 137, + 505, + 149 + ], + "score": 1.0, + "content": "covariance matrix of the data distribution, which is more natural than the concentrability coefficient", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 289, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 289, + 160 + ], + "score": 1.0, + "content": "for the case of linear function approximation.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 165, + 505, + 275 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "Recently, there has been great interest in approaching offline policy evaluation (Precup, 2000) via", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 188 + ], + "score": 1.0, + "content": "importance sampling. For recent work on this topic, see (Dud´ık et al., 2011; Mandel et al., 2014;", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "Thomas et al., 2015; Li et al., 2015; Jiang & Li, 2016; Thomas & Brunskill, 2016; Guo et al.,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 198, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 505, + 210 + ], + "score": 1.0, + "content": "2017; Wang et al., 2017; Liu et al., 2018; Farajtabar et al., 2018; Xie et al., 2019; Kallus & Ue-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 221 + ], + "score": 1.0, + "content": "hara, 2019; Liu et al., 2019; Uehara & Jiang, 2019; Kallus & Uehara, 2020; Jiang & Huang, 2020;", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 219, + 506, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 234 + ], + "score": 1.0, + "content": "Feng et al., 2020). Offline policy evaluation with importance sampling incurs exponential variance", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "in the planning horizon when the behavior policy is significantly different from the policy to be", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 506, + 255 + ], + "score": 1.0, + "content": "evaluated. Bypassing such exponential dependency requires non-trivial function approximation as-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 265 + ], + "score": 1.0, + "content": "sumptions (Jiang & Huang, 2020; Feng et al., 2020; Liu et al., 2018). Finally, Kidambi et al. (2020)", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 264, + 486, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 486, + 277 + ], + "score": 1.0, + "content": "provide a model-based offline RL algorithm, with a theoretical analysis based on hitting times.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 289, + 505, + 355 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "Hardness Results. Algorithm-specific hardness results have been known for a long time in the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 300, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 505, + 313 + ], + "score": 1.0, + "content": "literature of Approximate Dynamic Programming. See Chapter 4 in (Van Roy, 1994) and also (Gor-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 310, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 505, + 324 + ], + "score": 1.0, + "content": "don, 1995; Tsitsiklis & Van Roy, 1996). These works demonstrate that certain approximate dynamic", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "score": 1.0, + "content": "programming-based methods will diverge on hard cases. However, such hardness results only hold", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "score": 1.0, + "content": "for a restricted class of algorithms, and to demonstrate the fundamental difficulty of offline RL, it is", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 345, + 496, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 345, + 496, + 356 + ], + "score": 1.0, + "content": "more desirable to obtain information-theoretic lower bounds as initiated by Chen & Jiang (2019).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 107, + 361, + 505, + 427 + ], + "lines": [ + { + "bbox": [ + 105, + 361, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 374 + ], + "score": 1.0, + "content": "Existing (information-theoretic) exponential lower bounds (Krishnamurthy et al., 2016; Sun et al.,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "score": 1.0, + "content": "2017; Chen & Jiang, 2019) usually construct unstructured MDPs with an exponentially large state", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 383, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 491, + 396 + ], + "score": 1.0, + "content": "space. Du et al. (2020) prove an exponential lower bound under the assumption that the optimal", + "type": "text" + }, + { + "bbox": [ + 491, + 383, + 501, + 395 + ], + "score": 0.77, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 383, + 506, + 396 + ], + "score": 1.0, + "content": "-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 393, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 367, + 408 + ], + "score": 1.0, + "content": "function is approximately linear. The condition that the optimal", + "type": "text" + }, + { + "bbox": [ + 368, + 394, + 377, + 405 + ], + "score": 0.85, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 393, + 506, + 408 + ], + "score": 1.0, + "content": "-function is only approximately", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 405, + 506, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 506, + 418 + ], + "score": 1.0, + "content": "linear is crucial for the hardness result in Du et al. (2020). The techniques in (Du et al., 2020) are", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 415, + 473, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 473, + 428 + ], + "score": 1.0, + "content": "later generalized to other settings (Kumar et al., 2020; Wang et al., 2020; Mou et al., 2020).", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 441, + 505, + 507 + ], + "lines": [ + { + "bbox": [ + 105, + 440, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 455 + ], + "score": 1.0, + "content": "Error Amplification In RL. Error amplification induced by distribution shift and long planning", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 450, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 104, + 450, + 506, + 465 + ], + "score": 1.0, + "content": "horizon is a known issue in the theoretical analysis of RL algorithms. See (Gordon, 1995; 1996;", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 462, + 506, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 506, + 476 + ], + "score": 1.0, + "content": "Munos & Moore, 1999; Ormoneit & Sen, 2002; Kakade, 2003; Zanette et al., 2019) for papers on", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 475, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 486 + ], + "score": 1.0, + "content": "this topic and additional assumptions that mitigate this issue. Error amplification in offline RL is", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 485, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 485, + 506, + 498 + ], + "score": 1.0, + "content": "also observed in empirical works (see e.g. (Fujimoto et al., 2019)). In this work, we provide the first", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 496, + 502, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 502, + 509 + ], + "score": 1.0, + "content": "information-theoretic lower bound showing that geometric error amplification is real in offline RL.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31.5 + }, + { + "type": "title", + "bbox": [ + 107, + 525, + 361, + 538 + ], + "lines": [ + { + "bbox": [ + 105, + 524, + 362, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 362, + 540 + ], + "score": 1.0, + "content": "3 THE OFFLINE POLICY EVALUATION PROBLEM", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 463, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 550, + 460, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 275, + 566 + ], + "score": 1.0, + "content": "Throughout this paper, for a given integer", + "type": "text" + }, + { + "bbox": [ + 275, + 552, + 285, + 561 + ], + "score": 0.82, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 550, + 319, + 566 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 319, + 552, + 335, + 563 + ], + "score": 0.89, + "content": "[ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 550, + 403, + 566 + ], + "score": 1.0, + "content": "to denote the set", + "type": "text" + }, + { + "bbox": [ + 404, + 551, + 460, + 564 + ], + "score": 0.92, + "content": "\\{ 1 , 2 , \\ldots , H \\}", + "type": "inline_equation" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 106, + 576, + 505, + 677 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 506, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 281, + 590 + ], + "score": 1.0, + "content": "Episodic Reinforcement Learning. Let", + "type": "text" + }, + { + "bbox": [ + 281, + 577, + 374, + 589 + ], + "score": 0.91, + "content": "M = ( \\mathcal { S } , \\mathcal { A } , P , R , H )", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 576, + 506, + 590 + ], + "score": 1.0, + "content": "be a Markov Decision Process", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 165, + 600 + ], + "score": 1.0, + "content": "(MDP) where", + "type": "text" + }, + { + "bbox": [ + 166, + 589, + 174, + 598 + ], + "score": 0.79, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 588, + 252, + 600 + ], + "score": 1.0, + "content": "is the state space,", + "type": "text" + }, + { + "bbox": [ + 252, + 589, + 261, + 599 + ], + "score": 0.78, + "content": "\\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 588, + 345, + 600 + ], + "score": 1.0, + "content": "is the action space,", + "type": "text" + }, + { + "bbox": [ + 345, + 588, + 437, + 600 + ], + "score": 0.9, + "content": "P : \\mathcal { S } \\times \\mathcal { A } \\Delta ( \\mathcal { S } )", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "is the transition", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 599, + 504, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 417, + 612 + ], + "score": 1.0, + "content": "operator which takes a state-action pair and returns a distribution over states,", + "type": "text" + }, + { + "bbox": [ + 417, + 599, + 504, + 611 + ], + "score": 0.9, + "content": "\\Dot { R : } \\Dot { S } \\times \\mathcal { A } \\Delta ( \\mathbb { R } )", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 609, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 210, + 623 + ], + "score": 1.0, + "content": "is the reward distribution,", + "type": "text" + }, + { + "bbox": [ + 210, + 610, + 246, + 622 + ], + "score": 0.92, + "content": "H \\in \\mathbb { Z } _ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 609, + 506, + 623 + ], + "score": 1.0, + "content": "is the planning horizon. For simplicity, we assume a fixed initial", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 621, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 128, + 634 + ], + "score": 1.0, + "content": "state", + "type": "text" + }, + { + "bbox": [ + 128, + 621, + 160, + 632 + ], + "score": 0.92, + "content": "s _ { 1 } \\in { \\mathcal { S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 621, + 254, + 634 + ], + "score": 1.0, + "content": ". A (stochastic) policy", + "type": "text" + }, + { + "bbox": [ + 255, + 621, + 324, + 633 + ], + "score": 0.93, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 621, + 401, + 634 + ], + "score": 1.0, + "content": "chooses an action", + "type": "text" + }, + { + "bbox": [ + 401, + 623, + 408, + 631 + ], + "score": 0.71, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 621, + 506, + 634 + ], + "score": 1.0, + "content": "randomly based on the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 631, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 160, + 646 + ], + "score": 1.0, + "content": "current state", + "type": "text" + }, + { + "bbox": [ + 160, + 634, + 166, + 642 + ], + "score": 0.61, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 631, + 220, + 646 + ], + "score": 1.0, + "content": ". The policy", + "type": "text" + }, + { + "bbox": [ + 221, + 634, + 228, + 642 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 631, + 354, + 646 + ], + "score": 1.0, + "content": "induces a (random) trajectory", + "type": "text" + }, + { + "bbox": [ + 354, + 634, + 501, + 644 + ], + "score": 0.88, + "content": "s _ { 1 } , a _ { 1 } , r _ { 1 } , s _ { 2 } , a _ { 2 } , r _ { 2 } , \\ldots , s _ { H } , a _ { H } , r _ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 631, + 506, + 646 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 643, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 133, + 656 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 643, + 185, + 654 + ], + "score": 0.79, + "content": "a _ { 1 } \\sim \\pi _ { 1 } ( s _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 643, + 189, + 656 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 189, + 643, + 251, + 654 + ], + "score": 0.8, + "content": "r _ { 1 } \\sim R ( s _ { 1 } , a _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 643, + 255, + 656 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 256, + 643, + 318, + 655 + ], + "score": 0.82, + "content": "s _ { 2 } \\sim P ( s _ { 1 } , a _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 643, + 322, + 656 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 322, + 644, + 373, + 655 + ], + "score": 0.87, + "content": "a _ { 2 } \\sim \\pi _ { 2 } ( s _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 643, + 506, + 656 + ], + "score": 1.0, + "content": ", etc. To streamline our analysis,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 654, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 142, + 666 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 142, + 654, + 178, + 666 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 654, + 213, + 666 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 213, + 655, + 248, + 665 + ], + "score": 0.9, + "content": "S _ { h } \\subseteq S", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 654, + 387, + 666 + ], + "score": 1.0, + "content": "to denote the set of states at level", + "type": "text" + }, + { + "bbox": [ + 387, + 654, + 394, + 664 + ], + "score": 0.8, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 654, + 462, + 666 + ], + "score": 1.0, + "content": ", and we assume", + "type": "text" + }, + { + "bbox": [ + 462, + 654, + 475, + 665 + ], + "score": 0.88, + "content": "S _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 654, + 505, + 666 + ], + "score": 1.0, + "content": "do not", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 665, + 450, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 334, + 677 + ], + "score": 1.0, + "content": "intersect with each other. We assume, almost surely, that", + "type": "text" + }, + { + "bbox": [ + 334, + 665, + 385, + 677 + ], + "score": 0.92, + "content": "r _ { h } \\in [ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 665, + 413, + 677 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 413, + 665, + 446, + 677 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 665, + 450, + 677 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 510, + 726 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 257, + 703 + ], + "score": 1.0, + "content": "Value Functions. Given a policy", + "type": "text" + }, + { + "bbox": [ + 106, + 702, + 248, + 721 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathbb { E } \\left[ \\sum _ { h ^ { \\prime } = h } ^ { H } r _ { h ^ { \\prime } } \\mid s _ { h } = s , a _ { h } = a , \\pi \\right] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 694, + 268, + 726 + ], + "score": 1.0, + "content": "an d", + "type": "text" + }, + { + "bbox": [ + 265, + 687, + 267, + 703 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 267, + 690, + 314, + 702 + ], + "score": 0.91, + "content": "\\textit { h } \\in \\ [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 702, + 419, + 722 + ], + "score": 0.93, + "content": "\\begin{array} { r } { V _ { h } ^ { \\pi } ( s ) = \\mathbb { E } \\left[ \\sum _ { h ^ { \\prime } = h } ^ { H } r _ { h ^ { \\prime } } \\mid s _ { h } = s , \\pi \\right] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 687, + 337, + 703 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 338, + 690, + 417, + 702 + ], + "score": 0.89, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 687, + 452, + 703 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 419, + 694, + 479, + 726 + ], + "score": 1.0, + "content": "h. For a policy", + "type": "text" + }, + { + "bbox": [ + 452, + 690, + 504, + 703 + ], + "score": 0.9, + "content": "Q _ { h } ^ { \\pi } ( s , a ) \\ =", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 708, + 486, + 716 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 694, + 510, + 726 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 717, + 394, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 717, + 133, + 735 + ], + "score": 1.0, + "content": "define", + "type": "text" + }, + { + "bbox": [ + 133, + 720, + 191, + 732 + ], + "score": 0.91, + "content": "V ^ { \\pi } = V _ { 1 } ^ { \\pi } ( s _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 717, + 264, + 735 + ], + "score": 1.0, + "content": "to be the value of", + "type": "text" + }, + { + "bbox": [ + 264, + 723, + 271, + 730 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 717, + 378, + 735 + ], + "score": 1.0, + "content": "from the fixed initial state", + "type": "text" + }, + { + "bbox": [ + 378, + 723, + 388, + 732 + ], + "score": 0.85, + "content": "s _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 717, + 394, + 735 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5 + } + ], + "page_idx": 3, + "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, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Concurrent to this work, Xie & Jiang (2020a) propose an algorithm that works under the realizabil-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "ity assumption instead of other stronger representation conditions used in prior work. However, the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "algorithm in (Xie & Jiang, 2020a) requires a much stronger data distribution condition which as-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "score": 1.0, + "content": "sumes a stringent version of concentrability coefficient introduced by (Munos, 2003) to be bounded.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "score": 1.0, + "content": "In contrast, in this work we measure the distribution shift in terms of the spectrum of the feature", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 137, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 137, + 505, + 149 + ], + "score": 1.0, + "content": "covariance matrix of the data distribution, which is more natural than the concentrability coefficient", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 289, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 289, + 160 + ], + "score": 1.0, + "content": "for the case of linear function approximation.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 82, + 505, + 160 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 165, + 505, + 275 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "Recently, there has been great interest in approaching offline policy evaluation (Precup, 2000) via", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 188 + ], + "score": 1.0, + "content": "importance sampling. For recent work on this topic, see (Dud´ık et al., 2011; Mandel et al., 2014;", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "Thomas et al., 2015; Li et al., 2015; Jiang & Li, 2016; Thomas & Brunskill, 2016; Guo et al.,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 198, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 505, + 210 + ], + "score": 1.0, + "content": "2017; Wang et al., 2017; Liu et al., 2018; Farajtabar et al., 2018; Xie et al., 2019; Kallus & Ue-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 221 + ], + "score": 1.0, + "content": "hara, 2019; Liu et al., 2019; Uehara & Jiang, 2019; Kallus & Uehara, 2020; Jiang & Huang, 2020;", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 219, + 506, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 234 + ], + "score": 1.0, + "content": "Feng et al., 2020). Offline policy evaluation with importance sampling incurs exponential variance", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "in the planning horizon when the behavior policy is significantly different from the policy to be", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 506, + 255 + ], + "score": 1.0, + "content": "evaluated. Bypassing such exponential dependency requires non-trivial function approximation as-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 265 + ], + "score": 1.0, + "content": "sumptions (Jiang & Huang, 2020; Feng et al., 2020; Liu et al., 2018). Finally, Kidambi et al. (2020)", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 264, + 486, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 486, + 277 + ], + "score": 1.0, + "content": "provide a model-based offline RL algorithm, with a theoretical analysis based on hitting times.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 165, + 506, + 277 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 289, + 505, + 355 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "Hardness Results. Algorithm-specific hardness results have been known for a long time in the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 300, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 505, + 313 + ], + "score": 1.0, + "content": "literature of Approximate Dynamic Programming. See Chapter 4 in (Van Roy, 1994) and also (Gor-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 310, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 505, + 324 + ], + "score": 1.0, + "content": "don, 1995; Tsitsiklis & Van Roy, 1996). These works demonstrate that certain approximate dynamic", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "score": 1.0, + "content": "programming-based methods will diverge on hard cases. However, such hardness results only hold", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "score": 1.0, + "content": "for a restricted class of algorithms, and to demonstrate the fundamental difficulty of offline RL, it is", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 345, + 496, + 356 + ], + "spans": [ + { + "bbox": [ + 106, + 345, + 496, + 356 + ], + "score": 1.0, + "content": "more desirable to obtain information-theoretic lower bounds as initiated by Chen & Jiang (2019).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 289, + 505, + 356 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 361, + 505, + 427 + ], + "lines": [ + { + "bbox": [ + 105, + 361, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 374 + ], + "score": 1.0, + "content": "Existing (information-theoretic) exponential lower bounds (Krishnamurthy et al., 2016; Sun et al.,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 385 + ], + "score": 1.0, + "content": "2017; Chen & Jiang, 2019) usually construct unstructured MDPs with an exponentially large state", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 383, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 491, + 396 + ], + "score": 1.0, + "content": "space. Du et al. (2020) prove an exponential lower bound under the assumption that the optimal", + "type": "text" + }, + { + "bbox": [ + 491, + 383, + 501, + 395 + ], + "score": 0.77, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 383, + 506, + 396 + ], + "score": 1.0, + "content": "-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 393, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 367, + 408 + ], + "score": 1.0, + "content": "function is approximately linear. The condition that the optimal", + "type": "text" + }, + { + "bbox": [ + 368, + 394, + 377, + 405 + ], + "score": 0.85, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 393, + 506, + 408 + ], + "score": 1.0, + "content": "-function is only approximately", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 405, + 506, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 506, + 418 + ], + "score": 1.0, + "content": "linear is crucial for the hardness result in Du et al. (2020). The techniques in (Du et al., 2020) are", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 415, + 473, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 473, + 428 + ], + "score": 1.0, + "content": "later generalized to other settings (Kumar et al., 2020; Wang et al., 2020; Mou et al., 2020).", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 361, + 506, + 428 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 441, + 505, + 507 + ], + "lines": [ + { + "bbox": [ + 105, + 440, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 455 + ], + "score": 1.0, + "content": "Error Amplification In RL. Error amplification induced by distribution shift and long planning", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 450, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 104, + 450, + 506, + 465 + ], + "score": 1.0, + "content": "horizon is a known issue in the theoretical analysis of RL algorithms. See (Gordon, 1995; 1996;", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 462, + 506, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 506, + 476 + ], + "score": 1.0, + "content": "Munos & Moore, 1999; Ormoneit & Sen, 2002; Kakade, 2003; Zanette et al., 2019) for papers on", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 475, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 486 + ], + "score": 1.0, + "content": "this topic and additional assumptions that mitigate this issue. Error amplification in offline RL is", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 485, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 485, + 506, + 498 + ], + "score": 1.0, + "content": "also observed in empirical works (see e.g. (Fujimoto et al., 2019)). In this work, we provide the first", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 496, + 502, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 502, + 509 + ], + "score": 1.0, + "content": "information-theoretic lower bound showing that geometric error amplification is real in offline RL.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31.5, + "bbox_fs": [ + 104, + 440, + 506, + 509 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 525, + 361, + 538 + ], + "lines": [ + { + "bbox": [ + 105, + 524, + 362, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 362, + 540 + ], + "score": 1.0, + "content": "3 THE OFFLINE POLICY EVALUATION PROBLEM", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 463, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 550, + 460, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 275, + 566 + ], + "score": 1.0, + "content": "Throughout this paper, for a given integer", + "type": "text" + }, + { + "bbox": [ + 275, + 552, + 285, + 561 + ], + "score": 0.82, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 550, + 319, + 566 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 319, + 552, + 335, + 563 + ], + "score": 0.89, + "content": "[ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 550, + 403, + 566 + ], + "score": 1.0, + "content": "to denote the set", + "type": "text" + }, + { + "bbox": [ + 404, + 551, + 460, + 564 + ], + "score": 0.92, + "content": "\\{ 1 , 2 , \\ldots , H \\}", + "type": "inline_equation" + } + ], + "index": 36 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 550, + 460, + 566 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 576, + 505, + 677 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 506, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 281, + 590 + ], + "score": 1.0, + "content": "Episodic Reinforcement Learning. Let", + "type": "text" + }, + { + "bbox": [ + 281, + 577, + 374, + 589 + ], + "score": 0.91, + "content": "M = ( \\mathcal { S } , \\mathcal { A } , P , R , H )", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 576, + 506, + 590 + ], + "score": 1.0, + "content": "be a Markov Decision Process", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 165, + 600 + ], + "score": 1.0, + "content": "(MDP) where", + "type": "text" + }, + { + "bbox": [ + 166, + 589, + 174, + 598 + ], + "score": 0.79, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 588, + 252, + 600 + ], + "score": 1.0, + "content": "is the state space,", + "type": "text" + }, + { + "bbox": [ + 252, + 589, + 261, + 599 + ], + "score": 0.78, + "content": "\\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 588, + 345, + 600 + ], + "score": 1.0, + "content": "is the action space,", + "type": "text" + }, + { + "bbox": [ + 345, + 588, + 437, + 600 + ], + "score": 0.9, + "content": "P : \\mathcal { S } \\times \\mathcal { A } \\Delta ( \\mathcal { S } )", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "is the transition", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 599, + 504, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 417, + 612 + ], + "score": 1.0, + "content": "operator which takes a state-action pair and returns a distribution over states,", + "type": "text" + }, + { + "bbox": [ + 417, + 599, + 504, + 611 + ], + "score": 0.9, + "content": "\\Dot { R : } \\Dot { S } \\times \\mathcal { A } \\Delta ( \\mathbb { R } )", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 609, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 210, + 623 + ], + "score": 1.0, + "content": "is the reward distribution,", + "type": "text" + }, + { + "bbox": [ + 210, + 610, + 246, + 622 + ], + "score": 0.92, + "content": "H \\in \\mathbb { Z } _ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 609, + 506, + 623 + ], + "score": 1.0, + "content": "is the planning horizon. For simplicity, we assume a fixed initial", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 621, + 506, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 128, + 634 + ], + "score": 1.0, + "content": "state", + "type": "text" + }, + { + "bbox": [ + 128, + 621, + 160, + 632 + ], + "score": 0.92, + "content": "s _ { 1 } \\in { \\mathcal { S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 621, + 254, + 634 + ], + "score": 1.0, + "content": ". A (stochastic) policy", + "type": "text" + }, + { + "bbox": [ + 255, + 621, + 324, + 633 + ], + "score": 0.93, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 621, + 401, + 634 + ], + "score": 1.0, + "content": "chooses an action", + "type": "text" + }, + { + "bbox": [ + 401, + 623, + 408, + 631 + ], + "score": 0.71, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 621, + 506, + 634 + ], + "score": 1.0, + "content": "randomly based on the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 631, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 160, + 646 + ], + "score": 1.0, + "content": "current state", + "type": "text" + }, + { + "bbox": [ + 160, + 634, + 166, + 642 + ], + "score": 0.61, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 631, + 220, + 646 + ], + "score": 1.0, + "content": ". The policy", + "type": "text" + }, + { + "bbox": [ + 221, + 634, + 228, + 642 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 631, + 354, + 646 + ], + "score": 1.0, + "content": "induces a (random) trajectory", + "type": "text" + }, + { + "bbox": [ + 354, + 634, + 501, + 644 + ], + "score": 0.88, + "content": "s _ { 1 } , a _ { 1 } , r _ { 1 } , s _ { 2 } , a _ { 2 } , r _ { 2 } , \\ldots , s _ { H } , a _ { H } , r _ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 631, + 506, + 646 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 643, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 133, + 656 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 643, + 185, + 654 + ], + "score": 0.79, + "content": "a _ { 1 } \\sim \\pi _ { 1 } ( s _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 643, + 189, + 656 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 189, + 643, + 251, + 654 + ], + "score": 0.8, + "content": "r _ { 1 } \\sim R ( s _ { 1 } , a _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 643, + 255, + 656 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 256, + 643, + 318, + 655 + ], + "score": 0.82, + "content": "s _ { 2 } \\sim P ( s _ { 1 } , a _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 643, + 322, + 656 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 322, + 644, + 373, + 655 + ], + "score": 0.87, + "content": "a _ { 2 } \\sim \\pi _ { 2 } ( s _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 643, + 506, + 656 + ], + "score": 1.0, + "content": ", etc. To streamline our analysis,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 654, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 142, + 666 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 142, + 654, + 178, + 666 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 654, + 213, + 666 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 213, + 655, + 248, + 665 + ], + "score": 0.9, + "content": "S _ { h } \\subseteq S", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 654, + 387, + 666 + ], + "score": 1.0, + "content": "to denote the set of states at level", + "type": "text" + }, + { + "bbox": [ + 387, + 654, + 394, + 664 + ], + "score": 0.8, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 654, + 462, + 666 + ], + "score": 1.0, + "content": ", and we assume", + "type": "text" + }, + { + "bbox": [ + 462, + 654, + 475, + 665 + ], + "score": 0.88, + "content": "S _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 654, + 505, + 666 + ], + "score": 1.0, + "content": "do not", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 665, + 450, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 334, + 677 + ], + "score": 1.0, + "content": "intersect with each other. We assume, almost surely, that", + "type": "text" + }, + { + "bbox": [ + 334, + 665, + 385, + 677 + ], + "score": 0.92, + "content": "r _ { h } \\in [ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 665, + 413, + 677 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 413, + 665, + 446, + 677 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 665, + 450, + 677 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 576, + 506, + 677 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 510, + 726 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 257, + 703 + ], + "score": 1.0, + "content": "Value Functions. Given a policy", + "type": "text" + }, + { + "bbox": [ + 106, + 702, + 248, + 721 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathbb { E } \\left[ \\sum _ { h ^ { \\prime } = h } ^ { H } r _ { h ^ { \\prime } } \\mid s _ { h } = s , a _ { h } = a , \\pi \\right] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 694, + 268, + 726 + ], + "score": 1.0, + "content": "an d", + "type": "text" + }, + { + "bbox": [ + 265, + 687, + 267, + 703 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 267, + 690, + 314, + 702 + ], + "score": 0.91, + "content": "\\textit { h } \\in \\ [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 702, + 419, + 722 + ], + "score": 0.93, + "content": "\\begin{array} { r } { V _ { h } ^ { \\pi } ( s ) = \\mathbb { E } \\left[ \\sum _ { h ^ { \\prime } = h } ^ { H } r _ { h ^ { \\prime } } \\mid s _ { h } = s , \\pi \\right] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 687, + 337, + 703 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 338, + 690, + 417, + 702 + ], + "score": 0.89, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 687, + 452, + 703 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 419, + 694, + 479, + 726 + ], + "score": 1.0, + "content": "h. For a policy", + "type": "text" + }, + { + "bbox": [ + 452, + 690, + 504, + 703 + ], + "score": 0.9, + "content": "Q _ { h } ^ { \\pi } ( s , a ) \\ =", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 708, + 486, + 716 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 694, + 510, + 726 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 717, + 394, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 717, + 133, + 735 + ], + "score": 1.0, + "content": "define", + "type": "text" + }, + { + "bbox": [ + 133, + 720, + 191, + 732 + ], + "score": 0.91, + "content": "V ^ { \\pi } = V _ { 1 } ^ { \\pi } ( s _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 717, + 264, + 735 + ], + "score": 1.0, + "content": "to be the value of", + "type": "text" + }, + { + "bbox": [ + 264, + 723, + 271, + 730 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 717, + 378, + 735 + ], + "score": 1.0, + "content": "from the fixed initial state", + "type": "text" + }, + { + "bbox": [ + 378, + 723, + 388, + 732 + ], + "score": 0.85, + "content": "s _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 717, + 394, + 735 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 687, + 510, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "Linear Function Approximation. When applying linear function approximation schemes, it is", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 353, + 106 + ], + "score": 1.0, + "content": "commonly assumed that the agent is given a feature extractor", + "type": "text" + }, + { + "bbox": [ + 353, + 93, + 423, + 105 + ], + "score": 0.92, + "content": "\\phi : \\mathcal { S } \\times \\bar { \\mathcal { A } } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "which can either be", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 445, + 117 + ], + "score": 1.0, + "content": "hand-crafted or a pre-trained neural network that transforms a state-action pair to a", + "type": "text" + }, + { + "bbox": [ + 446, + 105, + 452, + 114 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "-dimensional", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 113, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 188, + 129 + ], + "score": 1.0, + "content": "embedding, and the", + "type": "text" + }, + { + "bbox": [ + 189, + 116, + 198, + 127 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 113, + 506, + 129 + ], + "score": 1.0, + "content": "-functions can be predicted by linear functions of the features. In this paper,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 127, + 342, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 342, + 139 + ], + "score": 1.0, + "content": "we are interested in the following realizability assumption.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 141, + 501, + 167 + ], + "lines": [ + { + "bbox": [ + 106, + 140, + 504, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 417, + 155 + ], + "score": 1.0, + "content": "Assumption 1 (Realizable Linear Function Approximation). For every policy", + "type": "text" + }, + { + "bbox": [ + 417, + 141, + 479, + 153 + ], + "score": 0.9, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 140, + 504, + 155 + ], + "score": 1.0, + "content": ", there", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 491, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 131, + 169 + ], + "score": 1.0, + "content": "exists", + "type": "text" + }, + { + "bbox": [ + 131, + 154, + 196, + 167 + ], + "score": 0.93, + "content": "\\theta _ { 1 } ^ { \\pi } , \\ldots \\theta _ { H } ^ { \\pi } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 153, + 264, + 169 + ], + "score": 1.0, + "content": "such that for all", + "type": "text" + }, + { + "bbox": [ + 264, + 154, + 326, + 167 + ], + "score": 0.92, + "content": "( s , a ) \\in S \\times A", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 153, + 344, + 169 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 345, + 153, + 487, + 167 + ], + "score": 0.84, + "content": "h \\in [ H ] , Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a ) .", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 153, + 491, + 169 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 176, + 505, + 199 + ], + "lines": [ + { + "bbox": [ + 105, + 174, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 505, + 190 + ], + "score": 1.0, + "content": "Note that our assumption is much stronger than assuming realizability with regards to a single policy", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 186, + 492, + 200 + ], + "spans": [ + { + "bbox": [ + 107, + 189, + 114, + 197 + ], + "score": 0.71, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 186, + 492, + 200 + ], + "score": 1.0, + "content": "(say the policy that we wish to evaluate); our assumption imposes realizability for all policies.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 210, + 505, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 224 + ], + "score": 1.0, + "content": "Offline Reinforcement Learning. This paper is concerned with the offline RL setting. In this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 102, + 221, + 504, + 251 + ], + "spans": [ + { + "bbox": [ + 102, + 221, + 148, + 251 + ], + "score": 1.0, + "content": "setting, thtributions", + "type": "text" + }, + { + "bbox": [ + 148, + 232, + 185, + 245 + ], + "score": 0.92, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 221, + 252, + 251 + ], + "score": 1.0, + "content": "oes not have dirwhere for each", + "type": "text" + }, + { + "bbox": [ + 252, + 233, + 289, + 245 + ], + "score": 0.7, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 221, + 295, + 251 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 295, + 233, + 371, + 245 + ], + "score": 0.8, + "content": "\\mu _ { h } \\in \\Delta ( S _ { h } \\times \\mathcal { A } )", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 221, + 493, + 251 + ], + "score": 1.0, + "content": "stead is given access to data d. The inputs of the agent are", + "type": "text" + }, + { + "bbox": [ + 494, + 233, + 504, + 243 + ], + "score": 0.78, + "content": "H", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 102, + 239, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 102, + 239, + 142, + 263 + ], + "score": 1.0, + "content": "datasets", + "type": "text" + }, + { + "bbox": [ + 142, + 245, + 181, + 257 + ], + "score": 0.88, + "content": "\\{ D _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 239, + 241, + 263 + ], + "score": 1.0, + "content": "1 , and for each", + "type": "text" + }, + { + "bbox": [ + 242, + 245, + 279, + 257 + ], + "score": 0.81, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 239, + 285, + 263 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 285, + 246, + 300, + 256 + ], + "score": 0.7, + "content": "D _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 239, + 448, + 263 + ], + "score": 1.0, + "content": "consists i.i.d. samples of the form", + "type": "text" + }, + { + "bbox": [ + 449, + 245, + 505, + 257 + ], + "score": 0.91, + "content": "( s , a , r , s ^ { \\prime } ) \\in", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 107, + 255, + 406, + 269 + ], + "spans": [ + { + "bbox": [ + 107, + 257, + 192, + 268 + ], + "score": 0.89, + "content": "S _ { h } \\times \\mathcal { A } \\times \\mathbb { R } \\times \\mathcal { S } _ { h + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 255, + 248, + 269 + ], + "score": 1.0, + "content": "tuples, where", + "type": "text" + }, + { + "bbox": [ + 248, + 256, + 403, + 268 + ], + "score": 0.25, + "content": "( s , \\dot { a } ) \\stackrel { . } { \\sim } \\mu _ { h } , r \\sim r ( s , a ) , s ^ { \\prime } \\sim \\bar { P ( } s , a ) ", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 255, + 406, + 269 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 505, + 317 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 286 + ], + "score": 1.0, + "content": "In this paper, we focus on the offline policy evaluation problem with linear function approximation:", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 101, + 284, + 501, + 313 + ], + "spans": [ + { + "bbox": [ + 101, + 284, + 167, + 313 + ], + "score": 1.0, + "content": "given a policy accurate estim", + "type": "text" + }, + { + "bbox": [ + 167, + 284, + 234, + 296 + ], + "score": 0.92, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 284, + 239, + 313 + ], + "score": 1.0, + "content": "f", + "type": "text" + }, + { + "bbox": [ + 239, + 297, + 246, + 305 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 284, + 268, + 313 + ], + "score": 1.0, + "content": "d a fe(i.e.,", + "type": "text" + }, + { + "bbox": [ + 268, + 295, + 282, + 305 + ], + "score": 0.77, + "content": "V ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 284, + 330, + 313 + ], + "score": 1.0, + "content": "re extractor ) approxima", + "type": "text" + }, + { + "bbox": [ + 330, + 284, + 404, + 296 + ], + "score": 0.91, + "content": "\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 284, + 461, + 313 + ], + "score": 1.0, + "content": ", the goal is toected datasets", + "type": "text" + }, + { + "bbox": [ + 462, + 294, + 501, + 307 + ], + "score": 0.92, + "content": "\\{ D _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 306, + 238, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 306, + 238, + 318 + ], + "score": 1.0, + "content": "with as few samples as possible.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 505, + 399 + ], + "lines": [ + { + "bbox": [ + 105, + 327, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 208, + 344 + ], + "score": 1.0, + "content": "Notation. For a vector", + "type": "text" + }, + { + "bbox": [ + 209, + 329, + 242, + 340 + ], + "score": 0.94, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 327, + 278, + 344 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 278, + 330, + 299, + 342 + ], + "score": 0.92, + "content": "\\lVert x \\rVert _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 327, + 354, + 344 + ], + "score": 1.0, + "content": "to denote its", + "type": "text" + }, + { + "bbox": [ + 354, + 331, + 364, + 341 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 327, + 506, + 344 + ], + "score": 1.0, + "content": "norm. For a positive semidefinite", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 135, + 354 + ], + "score": 1.0, + "content": "matrix", + "type": "text" + }, + { + "bbox": [ + 135, + 342, + 144, + 351 + ], + "score": 0.76, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 340, + 178, + 354 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 178, + 341, + 201, + 353 + ], + "score": 0.92, + "content": "\\| A \\| _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 340, + 333, + 354 + ], + "score": 1.0, + "content": "to denote its operator norm, and", + "type": "text" + }, + { + "bbox": [ + 333, + 342, + 369, + 353 + ], + "score": 0.92, + "content": "\\sigma _ { \\mathrm { m i n } } ( A )", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 340, + 505, + 354 + ], + "score": 1.0, + "content": "to denote its smallest eigenvalue.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 351, + 266, + 365 + ], + "score": 1.0, + "content": "For two positive semidefinite matrices", + "type": "text" + }, + { + "bbox": [ + 267, + 353, + 275, + 362 + ], + "score": 0.79, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 351, + 295, + 365 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 296, + 353, + 304, + 362 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 351, + 349, + 365 + ], + "score": 1.0, + "content": ", we write", + "type": "text" + }, + { + "bbox": [ + 349, + 353, + 383, + 363 + ], + "score": 0.92, + "content": "A \\succeq B", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "to denote the Lowner partial ¨", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 362, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 362, + 207, + 375 + ], + "score": 1.0, + "content": "ordering of matrices, i.e,", + "type": "text" + }, + { + "bbox": [ + 207, + 363, + 237, + 374 + ], + "score": 0.91, + "content": "A \\succeq B", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 362, + 292, + 375 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + }, + { + "bbox": [ + 292, + 363, + 320, + 374 + ], + "score": 0.91, + "content": "A - B", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 362, + 469, + 375 + ], + "score": 1.0, + "content": "is positive semidefinite. For a policy", + "type": "text" + }, + { + "bbox": [ + 469, + 363, + 505, + 373 + ], + "score": 0.88, + "content": "\\pi : { \\cal { S } } ", + "type": "inline_equation" + } + ], + "index": 19 + }, + { + "bbox": [ + 107, + 373, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 107, + 374, + 133, + 386 + ], + "score": 0.91, + "content": "\\Delta \\left( \\mathcal { A } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 373, + 168, + 388 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 168, + 374, + 181, + 386 + ], + "score": 0.89, + "content": "\\mu _ { h } ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 373, + 334, + 388 + ], + "score": 1.0, + "content": "to denote the marginal distribution of", + "type": "text" + }, + { + "bbox": [ + 335, + 376, + 345, + 385 + ], + "score": 0.85, + "content": "s _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 373, + 372, + 388 + ], + "score": 1.0, + "content": "under", + "type": "text" + }, + { + "bbox": [ + 372, + 376, + 380, + 384 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 373, + 401, + 388 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 402, + 374, + 501, + 386 + ], + "score": 0.91, + "content": "\\mu _ { h } ^ { \\pi } ( s ) = \\operatorname* { P r } [ s _ { h } = s \\mid \\pi ]", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 373, + 505, + 388 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 384, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 156, + 401 + ], + "score": 1.0, + "content": "For a vector", + "type": "text" + }, + { + "bbox": [ + 157, + 387, + 187, + 398 + ], + "score": 0.92, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 384, + 326, + 401 + ], + "score": 1.0, + "content": "and a positive semidefinite matrix", + "type": "text" + }, + { + "bbox": [ + 326, + 386, + 369, + 398 + ], + "score": 0.93, + "content": "A \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 384, + 402, + 401 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 403, + 387, + 425, + 399 + ], + "score": 0.92, + "content": "\\| x \\| _ { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 384, + 466, + 401 + ], + "score": 1.0, + "content": "to denote", + "type": "text" + }, + { + "bbox": [ + 466, + 386, + 501, + 398 + ], + "score": 0.88, + "content": "\\sqrt { x ^ { \\top } A x }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 384, + 506, + 401 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 106, + 415, + 503, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "score": 1.0, + "content": "4 THE LOWER BOUND: REALIZABILITY AND COVERAGE ARE INSUFFICIENT", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 440, + 505, + 485 + ], + "lines": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "score": 1.0, + "content": "We now present our main hardness result for offline policy evaluation with linear function approxi-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 452, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 505, + 465 + ], + "score": 1.0, + "content": "mation. It should be evident that without feature coverage in our dataset, realizability alone is clearly", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 462, + 505, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 476 + ], + "score": 1.0, + "content": "not sufficient for sample-efficient estimation. Here, we will make the strongest possible assumption,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 474, + 367, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 367, + 486 + ], + "score": 1.0, + "content": "with regards to the conditioning of the feature covariance matrix.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 488, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 286, + 502 + ], + "score": 1.0, + "content": "Assumption 2 (Feature Coverage). For all", + "type": "text" + }, + { + "bbox": [ + 286, + 488, + 353, + 501 + ], + "score": 0.91, + "content": "( s , a ) \\in S \\times A ,", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 488, + 506, + 502 + ], + "score": 1.0, + "content": ", assume our feature map is bounded", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 145, + 513 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 146, + 500, + 207, + 512 + ], + "score": 0.93, + "content": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 499, + 338, + 513 + ], + "score": 1.0, + "content": ". Furthermore, suppose for each", + "type": "text" + }, + { + "bbox": [ + 338, + 500, + 372, + 511 + ], + "score": 0.9, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 499, + 463, + 513 + ], + "score": 1.0, + "content": ", the data distributions", + "type": "text" + }, + { + "bbox": [ + 464, + 502, + 475, + 511 + ], + "score": 0.82, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 499, + 505, + 513 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 510, + 466, + 526 + ], + "spans": [ + { + "bbox": [ + 104, + 510, + 290, + 526 + ], + "score": 1.0, + "content": "the following minimum eigenvalue condition:", + "type": "text" + }, + { + "bbox": [ + 290, + 511, + 459, + 525 + ], + "score": 0.88, + "content": "\\sigma _ { \\mathrm { m i n } } \\left( \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } [ \\dot { \\phi } ( \\dot { s } , a ) \\phi ( s , a ) ^ { \\top } ] \\right) = 1 / d .", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 510, + 466, + 526 + ], + "score": 1.0, + "content": ". 2", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 505, + 577 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 218, + 545 + ], + "score": 1.0, + "content": "Clearly, for the case where", + "type": "text" + }, + { + "bbox": [ + 219, + 533, + 249, + 543 + ], + "score": 0.91, + "content": "H = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 532, + 506, + 545 + ], + "score": 1.0, + "content": ", the realizability assumption (Assumption 1), and feature cov-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 544, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 556 + ], + "score": 1.0, + "content": "erage assumption (Assumption 2) imply that the ordinary least squares estimator will accurately", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 554, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 142, + 568 + ], + "score": 1.0, + "content": "estimate", + "type": "text" + }, + { + "bbox": [ + 142, + 555, + 152, + 566 + ], + "score": 0.86, + "content": "\\theta _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 554, + 505, + 568 + ], + "score": 1.0, + "content": ".3 Our main result now shows that these assumptions are not sufficient for offline policy", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 566, + 259, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 259, + 578 + ], + "score": 1.0, + "content": "evaluation for long horizon problems.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 580, + 505, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 579, + 506, + 594 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 506, + 594 + ], + "score": 1.0, + "content": "Theorem 4.1. Suppose Assumption 2 holds. Fix an algorithm that takes as input both a policy and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 592, + 505, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 113, + 602 + ], + "score": 0.33, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 592, + 423, + 605 + ], + "score": 1.0, + "content": "feature mapping. There exists a (deterministic) MDP satisfying Assumption", + "type": "text" + }, + { + "bbox": [ + 424, + 593, + 429, + 602 + ], + "score": 0.31, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 592, + 505, + 605 + ], + "score": 1.0, + "content": ", such that for any", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 133, + 616 + ], + "score": 1.0, + "content": "policy", + "type": "text" + }, + { + "bbox": [ + 134, + 603, + 200, + 615 + ], + "score": 0.92, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 602, + 298, + 616 + ], + "score": 1.0, + "content": ", the algorithm requires", + "type": "text" + }, + { + "bbox": [ + 299, + 602, + 345, + 615 + ], + "score": 0.92, + "content": "\\Omega ( ( d / 2 ) ^ { H } )", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 602, + 472, + 616 + ], + "score": 1.0, + "content": "samples to output the value of", + "type": "text" + }, + { + "bbox": [ + 473, + 604, + 480, + 613 + ], + "score": 0.34, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 602, + 506, + 616 + ], + "score": 1.0, + "content": "up to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 614, + 376, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 376, + 626 + ], + "score": 1.0, + "content": "constant additive approximation error with probability at least 0.9.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 106, + 634, + 505, + 679 + ], + "lines": [ + { + "bbox": [ + 106, + 635, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 505, + 646 + ], + "score": 1.0, + "content": "Although we focus on offline policy evaluation in this work, our hardness result also holds for", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 646, + 505, + 658 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 505, + 658 + ], + "score": 1.0, + "content": "finding near-optimal policies under Assumption 1 in the offline RL setting. Below we give a simple", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 657, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 336, + 670 + ], + "score": 1.0, + "content": "reduction. At the initial state, if the agent chooses action", + "type": "text" + }, + { + "bbox": [ + 336, + 658, + 347, + 668 + ], + "score": 0.85, + "content": "a _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 657, + 506, + 670 + ], + "score": 1.0, + "content": ", then the agent receives a fixed reward", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 668, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 349, + 681 + ], + "score": 1.0, + "content": "value (say 0.5) and terminates. If the agent chooses action", + "type": "text" + }, + { + "bbox": [ + 349, + 669, + 360, + 679 + ], + "score": 0.84, + "content": "a _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 668, + 506, + 681 + ], + "score": 1.0, + "content": ", then the agent transits to our hard", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39.5 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 688, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 685, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 118, + 685, + 161, + 702 + ], + "score": 1.0, + "content": "2Note that", + "type": "text" + }, + { + "bbox": [ + 162, + 688, + 177, + 699 + ], + "score": 0.72, + "content": "1 / d", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 685, + 489, + 702 + ], + "score": 1.0, + "content": "is the largest possible minimum eigenvalue due to that, for any data distribution", + "type": "text" + }, + { + "bbox": [ + 490, + 688, + 501, + 699 + ], + "score": 0.87, + "content": "{ \\widetilde { \\mu } } _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 685, + 506, + 702 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 699, + 425, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 259, + 711 + ], + "score": 0.9, + "content": "\\sigma _ { \\operatorname* { m i n } } \\bigl ( \\mathbb { E } _ { ( s , a ) \\sim \\widetilde { \\mu } _ { h } } [ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } ] \\bigr ) \\leq 1 / d", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 699, + 281, + 711 + ], + "score": 1.0, + "content": "since", + "type": "text" + }, + { + "bbox": [ + 281, + 699, + 338, + 711 + ], + "score": 0.92, + "content": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 699, + 363, + 711 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 364, + 699, + 421, + 710 + ], + "score": 0.88, + "content": "( s , a ) \\in \\mathcal S \\times \\mathcal A", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 699, + 425, + 711 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 118, + 709, + 138, + 723 + ], + "score": 1.0, + "content": "3For", + "type": "text" + }, + { + "bbox": [ + 138, + 712, + 168, + 721 + ], + "score": 0.82, + "content": "H = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 709, + 368, + 723 + ], + "score": 1.0, + "content": ", the ordinary least squares estimator will satisfy that", + "type": "text" + }, + { + "bbox": [ + 369, + 710, + 465, + 723 + ], + "score": 0.91, + "content": "\\lVert \\theta _ { 1 } - \\widehat { \\theta } _ { \\mathrm { O L S } } \\rVert _ { 2 } ^ { 2 } \\leq O ( d / n )", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "with high", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 721, + 252, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 252, + 733 + ], + "score": 1.0, + "content": "probability. See e.g. (Hsu et al., 2012b).", + "type": "text" + } + ] + } + ] + }, + { + "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, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "Linear Function Approximation. When applying linear function approximation schemes, it is", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 353, + 106 + ], + "score": 1.0, + "content": "commonly assumed that the agent is given a feature extractor", + "type": "text" + }, + { + "bbox": [ + 353, + 93, + 423, + 105 + ], + "score": 0.92, + "content": "\\phi : \\mathcal { S } \\times \\bar { \\mathcal { A } } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "which can either be", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 445, + 117 + ], + "score": 1.0, + "content": "hand-crafted or a pre-trained neural network that transforms a state-action pair to a", + "type": "text" + }, + { + "bbox": [ + 446, + 105, + 452, + 114 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "-dimensional", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 113, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 188, + 129 + ], + "score": 1.0, + "content": "embedding, and the", + "type": "text" + }, + { + "bbox": [ + 189, + 116, + 198, + 127 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 113, + 506, + 129 + ], + "score": 1.0, + "content": "-functions can be predicted by linear functions of the features. In this paper,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 127, + 342, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 342, + 139 + ], + "score": 1.0, + "content": "we are interested in the following realizability assumption.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 82, + 506, + 139 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 141, + 501, + 167 + ], + "lines": [ + { + "bbox": [ + 106, + 140, + 504, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 417, + 155 + ], + "score": 1.0, + "content": "Assumption 1 (Realizable Linear Function Approximation). For every policy", + "type": "text" + }, + { + "bbox": [ + 417, + 141, + 479, + 153 + ], + "score": 0.9, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 140, + 504, + 155 + ], + "score": 1.0, + "content": ", there", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 491, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 131, + 169 + ], + "score": 1.0, + "content": "exists", + "type": "text" + }, + { + "bbox": [ + 131, + 154, + 196, + 167 + ], + "score": 0.93, + "content": "\\theta _ { 1 } ^ { \\pi } , \\ldots \\theta _ { H } ^ { \\pi } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 153, + 264, + 169 + ], + "score": 1.0, + "content": "such that for all", + "type": "text" + }, + { + "bbox": [ + 264, + 154, + 326, + 167 + ], + "score": 0.92, + "content": "( s , a ) \\in S \\times A", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 153, + 344, + 169 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 345, + 153, + 487, + 167 + ], + "score": 0.84, + "content": "h \\in [ H ] , Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a ) .", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 153, + 491, + 169 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 140, + 504, + 169 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 176, + 505, + 199 + ], + "lines": [ + { + "bbox": [ + 105, + 174, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 505, + 190 + ], + "score": 1.0, + "content": "Note that our assumption is much stronger than assuming realizability with regards to a single policy", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 186, + 492, + 200 + ], + "spans": [ + { + "bbox": [ + 107, + 189, + 114, + 197 + ], + "score": 0.71, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 186, + 492, + 200 + ], + "score": 1.0, + "content": "(say the policy that we wish to evaluate); our assumption imposes realizability for all policies.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 174, + 505, + 200 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 210, + 505, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 224 + ], + "score": 1.0, + "content": "Offline Reinforcement Learning. This paper is concerned with the offline RL setting. In this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 102, + 221, + 504, + 251 + ], + "spans": [ + { + "bbox": [ + 102, + 221, + 148, + 251 + ], + "score": 1.0, + "content": "setting, thtributions", + "type": "text" + }, + { + "bbox": [ + 148, + 232, + 185, + 245 + ], + "score": 0.92, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 221, + 252, + 251 + ], + "score": 1.0, + "content": "oes not have dirwhere for each", + "type": "text" + }, + { + "bbox": [ + 252, + 233, + 289, + 245 + ], + "score": 0.7, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 221, + 295, + 251 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 295, + 233, + 371, + 245 + ], + "score": 0.8, + "content": "\\mu _ { h } \\in \\Delta ( S _ { h } \\times \\mathcal { A } )", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 221, + 493, + 251 + ], + "score": 1.0, + "content": "stead is given access to data d. The inputs of the agent are", + "type": "text" + }, + { + "bbox": [ + 494, + 233, + 504, + 243 + ], + "score": 0.78, + "content": "H", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 102, + 239, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 102, + 239, + 142, + 263 + ], + "score": 1.0, + "content": "datasets", + "type": "text" + }, + { + "bbox": [ + 142, + 245, + 181, + 257 + ], + "score": 0.88, + "content": "\\{ D _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 239, + 241, + 263 + ], + "score": 1.0, + "content": "1 , and for each", + "type": "text" + }, + { + "bbox": [ + 242, + 245, + 279, + 257 + ], + "score": 0.81, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 239, + 285, + 263 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 285, + 246, + 300, + 256 + ], + "score": 0.7, + "content": "D _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 239, + 448, + 263 + ], + "score": 1.0, + "content": "consists i.i.d. samples of the form", + "type": "text" + }, + { + "bbox": [ + 449, + 245, + 505, + 257 + ], + "score": 0.91, + "content": "( s , a , r , s ^ { \\prime } ) \\in", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 107, + 255, + 406, + 269 + ], + "spans": [ + { + "bbox": [ + 107, + 257, + 192, + 268 + ], + "score": 0.89, + "content": "S _ { h } \\times \\mathcal { A } \\times \\mathbb { R } \\times \\mathcal { S } _ { h + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 255, + 248, + 269 + ], + "score": 1.0, + "content": "tuples, where", + "type": "text" + }, + { + "bbox": [ + 248, + 256, + 403, + 268 + ], + "score": 0.25, + "content": "( s , \\dot { a } ) \\stackrel { . } { \\sim } \\mu _ { h } , r \\sim r ( s , a ) , s ^ { \\prime } \\sim \\bar { P ( } s , a ) ", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 255, + 406, + 269 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10.5, + "bbox_fs": [ + 102, + 210, + 505, + 269 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 505, + 317 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 286 + ], + "score": 1.0, + "content": "In this paper, we focus on the offline policy evaluation problem with linear function approximation:", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 101, + 284, + 501, + 313 + ], + "spans": [ + { + "bbox": [ + 101, + 284, + 167, + 313 + ], + "score": 1.0, + "content": "given a policy accurate estim", + "type": "text" + }, + { + "bbox": [ + 167, + 284, + 234, + 296 + ], + "score": 0.92, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 284, + 239, + 313 + ], + "score": 1.0, + "content": "f", + "type": "text" + }, + { + "bbox": [ + 239, + 297, + 246, + 305 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 284, + 268, + 313 + ], + "score": 1.0, + "content": "d a fe(i.e.,", + "type": "text" + }, + { + "bbox": [ + 268, + 295, + 282, + 305 + ], + "score": 0.77, + "content": "V ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 284, + 330, + 313 + ], + "score": 1.0, + "content": "re extractor ) approxima", + "type": "text" + }, + { + "bbox": [ + 330, + 284, + 404, + 296 + ], + "score": 0.91, + "content": "\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 284, + 461, + 313 + ], + "score": 1.0, + "content": ", the goal is toected datasets", + "type": "text" + }, + { + "bbox": [ + 462, + 294, + 501, + 307 + ], + "score": 0.92, + "content": "\\{ D _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 306, + 238, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 306, + 238, + 318 + ], + "score": 1.0, + "content": "with as few samples as possible.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 101, + 272, + 505, + 318 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 505, + 399 + ], + "lines": [ + { + "bbox": [ + 105, + 327, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 208, + 344 + ], + "score": 1.0, + "content": "Notation. For a vector", + "type": "text" + }, + { + "bbox": [ + 209, + 329, + 242, + 340 + ], + "score": 0.94, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 327, + 278, + 344 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 278, + 330, + 299, + 342 + ], + "score": 0.92, + "content": "\\lVert x \\rVert _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 327, + 354, + 344 + ], + "score": 1.0, + "content": "to denote its", + "type": "text" + }, + { + "bbox": [ + 354, + 331, + 364, + 341 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 327, + 506, + 344 + ], + "score": 1.0, + "content": "norm. For a positive semidefinite", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 135, + 354 + ], + "score": 1.0, + "content": "matrix", + "type": "text" + }, + { + "bbox": [ + 135, + 342, + 144, + 351 + ], + "score": 0.76, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 340, + 178, + 354 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 178, + 341, + 201, + 353 + ], + "score": 0.92, + "content": "\\| A \\| _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 340, + 333, + 354 + ], + "score": 1.0, + "content": "to denote its operator norm, and", + "type": "text" + }, + { + "bbox": [ + 333, + 342, + 369, + 353 + ], + "score": 0.92, + "content": "\\sigma _ { \\mathrm { m i n } } ( A )", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 340, + 505, + 354 + ], + "score": 1.0, + "content": "to denote its smallest eigenvalue.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 351, + 266, + 365 + ], + "score": 1.0, + "content": "For two positive semidefinite matrices", + "type": "text" + }, + { + "bbox": [ + 267, + 353, + 275, + 362 + ], + "score": 0.79, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 351, + 295, + 365 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 296, + 353, + 304, + 362 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 351, + 349, + 365 + ], + "score": 1.0, + "content": ", we write", + "type": "text" + }, + { + "bbox": [ + 349, + 353, + 383, + 363 + ], + "score": 0.92, + "content": "A \\succeq B", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "to denote the Lowner partial ¨", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 362, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 362, + 207, + 375 + ], + "score": 1.0, + "content": "ordering of matrices, i.e,", + "type": "text" + }, + { + "bbox": [ + 207, + 363, + 237, + 374 + ], + "score": 0.91, + "content": "A \\succeq B", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 362, + 292, + 375 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + }, + { + "bbox": [ + 292, + 363, + 320, + 374 + ], + "score": 0.91, + "content": "A - B", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 362, + 469, + 375 + ], + "score": 1.0, + "content": "is positive semidefinite. For a policy", + "type": "text" + }, + { + "bbox": [ + 469, + 363, + 505, + 373 + ], + "score": 0.88, + "content": "\\pi : { \\cal { S } } ", + "type": "inline_equation" + } + ], + "index": 19 + }, + { + "bbox": [ + 107, + 373, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 107, + 374, + 133, + 386 + ], + "score": 0.91, + "content": "\\Delta \\left( \\mathcal { A } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 373, + 168, + 388 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 168, + 374, + 181, + 386 + ], + "score": 0.89, + "content": "\\mu _ { h } ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 373, + 334, + 388 + ], + "score": 1.0, + "content": "to denote the marginal distribution of", + "type": "text" + }, + { + "bbox": [ + 335, + 376, + 345, + 385 + ], + "score": 0.85, + "content": "s _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 373, + 372, + 388 + ], + "score": 1.0, + "content": "under", + "type": "text" + }, + { + "bbox": [ + 372, + 376, + 380, + 384 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 373, + 401, + 388 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 402, + 374, + 501, + 386 + ], + "score": 0.91, + "content": "\\mu _ { h } ^ { \\pi } ( s ) = \\operatorname* { P r } [ s _ { h } = s \\mid \\pi ]", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 373, + 505, + 388 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 384, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 156, + 401 + ], + "score": 1.0, + "content": "For a vector", + "type": "text" + }, + { + "bbox": [ + 157, + 387, + 187, + 398 + ], + "score": 0.92, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 384, + 326, + 401 + ], + "score": 1.0, + "content": "and a positive semidefinite matrix", + "type": "text" + }, + { + "bbox": [ + 326, + 386, + 369, + 398 + ], + "score": 0.93, + "content": "A \\in \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 384, + 402, + 401 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 403, + 387, + 425, + 399 + ], + "score": 0.92, + "content": "\\| x \\| _ { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 384, + 466, + 401 + ], + "score": 1.0, + "content": "to denote", + "type": "text" + }, + { + "bbox": [ + 466, + 386, + 501, + 398 + ], + "score": 0.88, + "content": "\\sqrt { x ^ { \\top } A x }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 384, + 506, + 401 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 327, + 506, + 401 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 415, + 503, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "score": 1.0, + "content": "4 THE LOWER BOUND: REALIZABILITY AND COVERAGE ARE INSUFFICIENT", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 440, + 505, + 485 + ], + "lines": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "score": 1.0, + "content": "We now present our main hardness result for offline policy evaluation with linear function approxi-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 452, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 505, + 465 + ], + "score": 1.0, + "content": "mation. It should be evident that without feature coverage in our dataset, realizability alone is clearly", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 462, + 505, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 476 + ], + "score": 1.0, + "content": "not sufficient for sample-efficient estimation. Here, we will make the strongest possible assumption,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 474, + 367, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 367, + 486 + ], + "score": 1.0, + "content": "with regards to the conditioning of the feature covariance matrix.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 440, + 505, + 486 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 488, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 286, + 502 + ], + "score": 1.0, + "content": "Assumption 2 (Feature Coverage). For all", + "type": "text" + }, + { + "bbox": [ + 286, + 488, + 353, + 501 + ], + "score": 0.91, + "content": "( s , a ) \\in S \\times A ,", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 488, + 506, + 502 + ], + "score": 1.0, + "content": ", assume our feature map is bounded", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 145, + 513 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 146, + 500, + 207, + 512 + ], + "score": 0.93, + "content": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 499, + 338, + 513 + ], + "score": 1.0, + "content": ". Furthermore, suppose for each", + "type": "text" + }, + { + "bbox": [ + 338, + 500, + 372, + 511 + ], + "score": 0.9, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 499, + 463, + 513 + ], + "score": 1.0, + "content": ", the data distributions", + "type": "text" + }, + { + "bbox": [ + 464, + 502, + 475, + 511 + ], + "score": 0.82, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 499, + 505, + 513 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 510, + 466, + 526 + ], + "spans": [ + { + "bbox": [ + 104, + 510, + 290, + 526 + ], + "score": 1.0, + "content": "the following minimum eigenvalue condition:", + "type": "text" + }, + { + "bbox": [ + 290, + 511, + 459, + 525 + ], + "score": 0.88, + "content": "\\sigma _ { \\mathrm { m i n } } \\left( \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } [ \\dot { \\phi } ( \\dot { s } , a ) \\phi ( s , a ) ^ { \\top } ] \\right) = 1 / d .", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 510, + 466, + 526 + ], + "score": 1.0, + "content": ". 2", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 104, + 488, + 506, + 526 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 505, + 577 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 218, + 545 + ], + "score": 1.0, + "content": "Clearly, for the case where", + "type": "text" + }, + { + "bbox": [ + 219, + 533, + 249, + 543 + ], + "score": 0.91, + "content": "H = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 532, + 506, + 545 + ], + "score": 1.0, + "content": ", the realizability assumption (Assumption 1), and feature cov-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 544, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 556 + ], + "score": 1.0, + "content": "erage assumption (Assumption 2) imply that the ordinary least squares estimator will accurately", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 554, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 142, + 568 + ], + "score": 1.0, + "content": "estimate", + "type": "text" + }, + { + "bbox": [ + 142, + 555, + 152, + 566 + ], + "score": 0.86, + "content": "\\theta _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 554, + 505, + 568 + ], + "score": 1.0, + "content": ".3 Our main result now shows that these assumptions are not sufficient for offline policy", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 566, + 259, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 259, + 578 + ], + "score": 1.0, + "content": "evaluation for long horizon problems.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 532, + 506, + 578 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 580, + 505, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 579, + 506, + 594 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 506, + 594 + ], + "score": 1.0, + "content": "Theorem 4.1. Suppose Assumption 2 holds. Fix an algorithm that takes as input both a policy and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 592, + 505, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 113, + 602 + ], + "score": 0.33, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 592, + 423, + 605 + ], + "score": 1.0, + "content": "feature mapping. There exists a (deterministic) MDP satisfying Assumption", + "type": "text" + }, + { + "bbox": [ + 424, + 593, + 429, + 602 + ], + "score": 0.31, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 592, + 505, + 605 + ], + "score": 1.0, + "content": ", such that for any", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 133, + 616 + ], + "score": 1.0, + "content": "policy", + "type": "text" + }, + { + "bbox": [ + 134, + 603, + 200, + 615 + ], + "score": 0.92, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 602, + 298, + 616 + ], + "score": 1.0, + "content": ", the algorithm requires", + "type": "text" + }, + { + "bbox": [ + 299, + 602, + 345, + 615 + ], + "score": 0.92, + "content": "\\Omega ( ( d / 2 ) ^ { H } )", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 602, + 472, + 616 + ], + "score": 1.0, + "content": "samples to output the value of", + "type": "text" + }, + { + "bbox": [ + 473, + 604, + 480, + 613 + ], + "score": 0.34, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 602, + 506, + 616 + ], + "score": 1.0, + "content": "up to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 614, + 376, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 376, + 626 + ], + "score": 1.0, + "content": "constant additive approximation error with probability at least 0.9.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 579, + 506, + 626 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 634, + 505, + 679 + ], + "lines": [ + { + "bbox": [ + 106, + 635, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 505, + 646 + ], + "score": 1.0, + "content": "Although we focus on offline policy evaluation in this work, our hardness result also holds for", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 646, + 505, + 658 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 505, + 658 + ], + "score": 1.0, + "content": "finding near-optimal policies under Assumption 1 in the offline RL setting. Below we give a simple", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 657, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 336, + 670 + ], + "score": 1.0, + "content": "reduction. At the initial state, if the agent chooses action", + "type": "text" + }, + { + "bbox": [ + 336, + 658, + 347, + 668 + ], + "score": 0.85, + "content": "a _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 657, + 506, + 670 + ], + "score": 1.0, + "content": ", then the agent receives a fixed reward", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 668, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 349, + 681 + ], + "score": 1.0, + "content": "value (say 0.5) and terminates. If the agent chooses action", + "type": "text" + }, + { + "bbox": [ + 349, + 669, + 360, + 679 + ], + "score": 0.84, + "content": "a _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 668, + 506, + 681 + ], + "score": 1.0, + "content": ", then the agent transits to our hard", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "instance. In order to find a policy with suboptimality at most 0.5, the agent must evaluate the value", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 504, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 504, + 106 + ], + "score": 1.0, + "content": "of the optimal policy in our hard instance up to an error of 0.5, and hence the hardness result holds.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 635, + 506, + 681 + ] + } + ] + }, + { + "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": "instance. In order to find a policy with suboptimality at most 0.5, the agent must evaluate the value", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 504, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 504, + 106 + ], + "score": 1.0, + "content": "of the optimal policy in our hard instance up to an error of 0.5, and hence the hardness result holds.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 109, + 505, + 142 + ], + "lines": [ + { + "bbox": [ + 106, + 109, + 505, + 121 + ], + "spans": [ + { + "bbox": [ + 106, + 109, + 505, + 121 + ], + "score": 1.0, + "content": "Remark 1 (The sparse reward case). As stated, the theorem uses a deterministic MDP (with stochas-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 120, + 505, + 132 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 505, + 132 + ], + "score": 1.0, + "content": "tic rewards). See Appendix C for another hard case where the transition is stochastic and the reward", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 130, + 377, + 143 + ], + "spans": [ + { + "bbox": [ + 104, + 130, + 340, + 143 + ], + "score": 1.0, + "content": "is deterministic and sparse (only occurring at two states at", + "type": "text" + }, + { + "bbox": [ + 340, + 131, + 369, + 141 + ], + "score": 0.89, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 130, + 377, + 143 + ], + "score": 1.0, + "content": ").", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 146, + 505, + 234 + ], + "lines": [ + { + "bbox": [ + 105, + 145, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 105, + 145, + 505, + 159 + ], + "score": 1.0, + "content": "Remark 2 (Least-Squares Policy Evaluation (LSPE) has exponential variance). For offline policy", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 156, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 104, + 156, + 506, + 170 + ], + "score": 1.0, + "content": "evaluation with linear function approximation, the most na¨ıve algorithm here would be LSPE, i.e.,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 168, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 300, + 181 + ], + "score": 1.0, + "content": "using ordinary least squares (OLS) to estimate", + "type": "text" + }, + { + "bbox": [ + 301, + 168, + 312, + 178 + ], + "score": 0.85, + "content": "\\theta ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 168, + 384, + 181 + ], + "score": 1.0, + "content": ", starting at level", + "type": "text" + }, + { + "bbox": [ + 384, + 168, + 417, + 178 + ], + "score": 0.91, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 168, + 505, + 181 + ], + "score": 1.0, + "content": "and then proceeding", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 179, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 179, + 182, + 191 + ], + "score": 1.0, + "content": "backwards to level", + "type": "text" + }, + { + "bbox": [ + 183, + 179, + 208, + 189 + ], + "score": 0.9, + "content": "h = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 179, + 505, + 191 + ], + "score": 1.0, + "content": ", using the plug-in estimator from the previous level. Here, LSPE will pro-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 190, + 505, + 202 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 505, + 202 + ], + "score": 1.0, + "content": "vide an unbiased estimate (provided the feature covariance matrices are full rank, which will occur", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 201, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 505, + 213 + ], + "score": 1.0, + "content": "with high probability). As a direct corollary, the above theorem implies that LSPE has exponential", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 212, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 153, + 224 + ], + "score": 1.0, + "content": "variance in", + "type": "text" + }, + { + "bbox": [ + 153, + 212, + 163, + 222 + ], + "score": 0.72, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 212, + 505, + 224 + ], + "score": 1.0, + "content": ". See Section 5 for a more detailed discussion on LSPE. More generally, our theorem", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 222, + 502, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 502, + 236 + ], + "score": 1.0, + "content": "implies that there is no estimator that can avoid such exponential dependence in the offline setting.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 505, + 348 + ], + "lines": [ + { + "bbox": [ + 106, + 238, + 505, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 505, + 251 + ], + "score": 1.0, + "content": "Remark 3 (Least-Squares Value Iteration (LSVI) versus Least-Squares Policy Iteration (LSPI)). In", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "the offline setting, under Assumptions 1 and 2, in order to find a near-optimal policy, the most na¨ıve", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 260, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 425, + 273 + ], + "score": 1.0, + "content": "algorithm would be LSVI, i.e., using ordinary least squares (OLS) to estimate", + "type": "text" + }, + { + "bbox": [ + 425, + 261, + 435, + 270 + ], + "score": 0.85, + "content": "\\theta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 260, + 505, + 273 + ], + "score": 1.0, + "content": ", starting at level", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 136, + 281 + ], + "score": 0.9, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 271, + 295, + 284 + ], + "score": 1.0, + "content": "and then proceeding backwards to level", + "type": "text" + }, + { + "bbox": [ + 295, + 271, + 320, + 281 + ], + "score": 0.9, + "content": "h = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 271, + 505, + 284 + ], + "score": 1.0, + "content": ", using the plug-in estimator from the previous", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "score": 1.0, + "content": "level and the bellman operator. The above theorem implies that LSVI will require an exponential", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 293, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 505, + 306 + ], + "score": 1.0, + "content": "number of samples to find a near-optimal policy. On the other hand, if the regression targets are", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 302, + 506, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 317 + ], + "score": 1.0, + "content": "collected by using rollouts (i.e. on-policy sampling) as in LSPI (Lagoudakis & Parr, 2003), then a", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 315, + 506, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 506, + 328 + ], + "score": 1.0, + "content": "polynomial number of samples suffice. See Section D in (Du et al., 2020) for an analysis. Thus,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 326, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 338 + ], + "score": 1.0, + "content": "Theorem 4.1 implies an exponential separation on the sample complexity between LSVI and LSPI.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 336, + 478, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 478, + 351 + ], + "score": 1.0, + "content": "Of course, LSPI requires adaptive data samples and thus does not work in the offline setting.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 358, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 101, + 351, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 101, + 351, + 402, + 378 + ], + "score": 1.0, + "content": "One may wonder if Theorem 4.1 still holds when the data distributions", + "type": "text" + }, + { + "bbox": [ + 402, + 357, + 440, + 371 + ], + "score": 0.93, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 351, + 505, + 378 + ], + "score": 1.0, + "content": "are induced by", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 370, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 104, + 370, + 505, + 381 + ], + "score": 1.0, + "content": "a policy. In Appendix C, we prove another exponential sample complexity lower bound under the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 380, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 425, + 393 + ], + "score": 1.0, + "content": "additional assumption that the data distributions are induced by a fixed policy", + "type": "text" + }, + { + "bbox": [ + 425, + 382, + 432, + 390 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 380, + 505, + 393 + ], + "score": 1.0, + "content": ". However, under", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 391, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 505, + 404 + ], + "score": 1.0, + "content": "such an assumption, it is impossible to prove a hardness result as strong as Theorem 4.1 (which", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 444, + 414 + ], + "score": 1.0, + "content": "shows that evaluating any policy is hard), since one can at least evaluate the policy", + "type": "text" + }, + { + "bbox": [ + 445, + 403, + 453, + 412 + ], + "score": 0.73, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 402, + 505, + 414 + ], + "score": 1.0, + "content": "that induces", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 412, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 426 + ], + "score": 1.0, + "content": "the data distributions. Nevertheless, we are able to prove the hardness of offline policy evaluation,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 424, + 409, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 331, + 436 + ], + "score": 1.0, + "content": "under a weaker version of Assumption 1. See Appendix", + "type": "text" + }, + { + "bbox": [ + 332, + 424, + 340, + 434 + ], + "score": 0.27, + "content": "\\textrm { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 424, + 409, + 436 + ], + "score": 1.0, + "content": "for more details.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 440, + 505, + 476 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 454 + ], + "score": 1.0, + "content": "In the remaining part of this section, we give the hard instance construction and the proof of Theo-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 451, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 104, + 451, + 173, + 465 + ], + "score": 1.0, + "content": "rem 4.1. We use", + "type": "text" + }, + { + "bbox": [ + 173, + 452, + 180, + 462 + ], + "score": 0.74, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 451, + 378, + 465 + ], + "score": 1.0, + "content": "the denote the feature dimension, and we assume", + "type": "text" + }, + { + "bbox": [ + 378, + 452, + 385, + 462 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 451, + 505, + 465 + ], + "score": 1.0, + "content": "is even for simplicity. We use", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 462, + 491, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 113, + 474 + ], + "score": 0.83, + "content": "\\hat { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 462, + 153, + 478 + ], + "score": 1.0, + "content": "to denote", + "type": "text" + }, + { + "bbox": [ + 154, + 464, + 170, + 477 + ], + "score": 0.89, + "content": "d / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 462, + 491, + 478 + ], + "score": 1.0, + "content": "for convenience. We also provide an illustration of the construction in Figure 1.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 488, + 505, + 532 + ], + "lines": [ + { + "bbox": [ + 145, + 487, + 510, + 527 + ], + "spans": [ + { + "bbox": [ + 145, + 487, + 151, + 527 + ], + "score": 1.0, + "content": "ac,", + "type": "text" + }, + { + "bbox": [ + 164, + 487, + 203, + 527 + ], + "score": 1.0, + "content": "Action Spcontains", + "type": "text" + }, + { + "bbox": [ + 230, + 487, + 258, + 527 + ], + "score": 1.0, + "content": "d Transtates", + "type": "text" + }, + { + "bbox": [ + 316, + 487, + 335, + 527 + ], + "score": 1.0, + "content": "or. and", + "type": "text" + }, + { + "bbox": [ + 357, + 487, + 405, + 527 + ], + "score": 1.0, + "content": "action space . For each", + "type": "text" + }, + { + "bbox": [ + 406, + 489, + 463, + 501 + ], + "score": 0.93, + "content": "\\mathcal { A } = \\{ a _ { 1 } , a _ { 2 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 487, + 510, + 527 + ], + "score": 1.0, + "content": ". For each, for each", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 500, + 463, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 145, + 516 + ], + "score": 0.61, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 503, + 163, + 515 + ], + "score": 0.3, + "content": "S _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 501, + 229, + 514 + ], + "score": 0.91, + "content": "\\hat { d } + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 501, + 315, + 516 + ], + "score": 0.92, + "content": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 500, + 356, + 516 + ], + "score": 0.92, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 503, + 463, + 516 + ], + "score": 0.89, + "content": "h \\in [ H - 1 ]", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 515, + 403, + 536 + ], + "spans": [ + { + "bbox": [ + 107, + 516, + 193, + 531 + ], + "score": 0.93, + "content": "c \\in \\{ 1 , 2 , \\ldots , \\hat { d } + 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 515, + 232, + 536 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 232, + 516, + 306, + 532 + ], + "score": 0.92, + "content": "P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 515, + 324, + 536 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 324, + 518, + 398, + 532 + ], + "score": 0.92, + "content": "P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 515, + 403, + 536 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 545, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 104, + 541, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 104, + 541, + 227, + 561 + ], + "score": 1.0, + "content": "Reward Distributions. Let", + "type": "text" + }, + { + "bbox": [ + 227, + 545, + 296, + 558 + ], + "score": 0.94, + "content": "0 \\leq r _ { 0 } \\leq \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 541, + 471, + 561 + ], + "score": 1.0, + "content": "be a parameter to be determined. For each", + "type": "text" + }, + { + "bbox": [ + 471, + 546, + 505, + 558 + ], + "score": 0.92, + "content": "( h , c ) \\in", + "type": "inline_equation" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 555, + 510, + 578 + ], + "spans": [ + { + "bbox": [ + 107, + 559, + 163, + 573 + ], + "score": 0.93, + "content": "[ H - 1 ] \\times [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 555, + 182, + 578 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 182, + 561, + 210, + 572 + ], + "score": 0.9, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 555, + 243, + 578 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + }, + { + "bbox": [ + 243, + 560, + 299, + 573 + ], + "score": 0.92, + "content": "R ( s _ { h } ^ { c } , a ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 555, + 318, + 578 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 318, + 558, + 483, + 573 + ], + "score": 0.92, + "content": "R ( s _ { h } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot ( \\hat { d } ^ { 1 / 2 } - 1 ) \\cdot \\hat { d } ^ { ( H - h ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 555, + 510, + 578 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 573, + 503, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 198, + 601 + ], + "score": 1.0, + "content": "the last level, for each", + "type": "text" + }, + { + "bbox": [ + 199, + 578, + 228, + 593 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 573, + 247, + 601 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 248, + 581, + 276, + 591 + ], + "score": 0.86, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 573, + 309, + 601 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + }, + { + "bbox": [ + 309, + 574, + 381, + 599 + ], + "score": 0.9, + "content": "R ( s _ { H } ^ { c } , a ) = \\left\\{ \\begin{array} { l l } { { 1 } } \\\\ { { - 1 } } \\end{array} \\right.", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 573, + 458, + 601 + ], + "score": 1.0, + "content": "with probability with probability", + "type": "text" + }, + { + "bbox": [ + 458, + 574, + 503, + 586 + ], + "score": 0.88, + "content": "( 1 + r _ { 0 } ) / 2", + "type": "inline_equation" + } + ], + "index": 38 + }, + { + "bbox": [ + 458, + 587, + 503, + 599 + ], + "spans": [ + { + "bbox": [ + 458, + 587, + 503, + 599 + ], + "score": 0.84, + "content": "( 1 - r _ { 0 } ) / 2", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 103, + 597, + 442, + 619 + ], + "spans": [ + { + "bbox": [ + 103, + 597, + 135, + 619 + ], + "score": 1.0, + "content": "so that", + "type": "text" + }, + { + "bbox": [ + 136, + 603, + 208, + 615 + ], + "score": 0.94, + "content": "\\mathbb { E } [ R ( s _ { H } ^ { c } , a ) ] = r _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 597, + 313, + 619 + ], + "score": 1.0, + "content": ". Moreover, for all actions", + "type": "text" + }, + { + "bbox": [ + 316, + 600, + 437, + 615 + ], + "score": 0.83, + "content": "a \\in \\mathcal { A } , R ( s _ { H } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot \\hat { d } ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 597, + 442, + 619 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 106, + 629, + 505, + 670 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 210, + 642 + ], + "score": 1.0, + "content": "Feature Mapping. Let", + "type": "text" + }, + { + "bbox": [ + 210, + 631, + 266, + 641 + ], + "score": 0.88, + "content": "e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 627, + 408, + 642 + ], + "score": 1.0, + "content": "be a set of orthonormal vectors in", + "type": "text" + }, + { + "bbox": [ + 408, + 628, + 421, + 639 + ], + "score": 0.88, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 627, + 505, + 642 + ], + "score": 1.0, + "content": ". Here, one possible", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 640, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 169, + 655 + ], + "score": 1.0, + "content": "choice is to set", + "type": "text" + }, + { + "bbox": [ + 170, + 644, + 225, + 654 + ], + "score": 0.89, + "content": "e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 641, + 398, + 655 + ], + "score": 1.0, + "content": "to be the standard basis vectors. For each", + "type": "text" + }, + { + "bbox": [ + 398, + 640, + 473, + 654 + ], + "score": 0.93, + "content": "( h , c ) \\in [ H ] \\times [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 641, + 505, + 655 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 650, + 438, + 674 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 243, + 669 + ], + "score": 0.78, + "content": "\\phi ( s _ { h } ^ { c } , a _ { 1 } ) = e _ { c } , \\phi ( s _ { h } ^ { c } , a _ { 2 } ) = e _ { c + { \\hat { d } } } ", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 650, + 262, + 674 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 263, + 653, + 376, + 669 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\phi ( s _ { h } ^ { \\hat { d } + 1 } , a ) = \\sum _ { c \\in \\hat { d } } e _ { c } / \\hat { d } ^ { 1 / 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 650, + 405, + 674 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 405, + 657, + 431, + 667 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 650, + 438, + 674 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 106, + 680, + 503, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 679, + 504, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 679, + 504, + 694 + ], + "score": 1.0, + "content": "Verifying Assumption 1. The following lemma shows that Assumption 1 holds for our construc-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 693, + 316, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 316, + 704 + ], + "score": 1.0, + "content": "tion. The formal proof can be found in Appendix A.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5 + }, + { + "type": "text", + "bbox": [ + 107, + 706, + 503, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 705, + 506, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 705, + 229, + 721 + ], + "score": 1.0, + "content": "Lemma 4.2. For every policy", + "type": "text" + }, + { + "bbox": [ + 230, + 707, + 292, + 719 + ], + "score": 0.92, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 705, + 332, + 721 + ], + "score": 1.0, + "content": ", for each", + "type": "text" + }, + { + "bbox": [ + 332, + 707, + 366, + 719 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 705, + 398, + 721 + ], + "score": 1.0, + "content": ", for all", + "type": "text" + }, + { + "bbox": [ + 399, + 707, + 467, + 719 + ], + "score": 0.92, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 705, + 506, + 721 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 718, + 289, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 718, + 211, + 733 + ], + "score": 0.91, + "content": "Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 718, + 249, + 734 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 249, + 720, + 284, + 733 + ], + "score": 0.93, + "content": "\\theta _ { h } ^ { \\pi } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 718, + 289, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5 + } + ], + "page_idx": 5, + "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": [ + 302, + 751, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 310, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 109, + 505, + 142 + ], + "lines": [ + { + "bbox": [ + 106, + 109, + 505, + 121 + ], + "spans": [ + { + "bbox": [ + 106, + 109, + 505, + 121 + ], + "score": 1.0, + "content": "Remark 1 (The sparse reward case). As stated, the theorem uses a deterministic MDP (with stochas-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 120, + 505, + 132 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 505, + 132 + ], + "score": 1.0, + "content": "tic rewards). See Appendix C for another hard case where the transition is stochastic and the reward", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 130, + 377, + 143 + ], + "spans": [ + { + "bbox": [ + 104, + 130, + 340, + 143 + ], + "score": 1.0, + "content": "is deterministic and sparse (only occurring at two states at", + "type": "text" + }, + { + "bbox": [ + 340, + 131, + 369, + 141 + ], + "score": 0.89, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 130, + 377, + 143 + ], + "score": 1.0, + "content": ").", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 104, + 109, + 505, + 143 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 146, + 505, + 234 + ], + "lines": [ + { + "bbox": [ + 105, + 145, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 105, + 145, + 505, + 159 + ], + "score": 1.0, + "content": "Remark 2 (Least-Squares Policy Evaluation (LSPE) has exponential variance). For offline policy", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 156, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 104, + 156, + 506, + 170 + ], + "score": 1.0, + "content": "evaluation with linear function approximation, the most na¨ıve algorithm here would be LSPE, i.e.,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 168, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 300, + 181 + ], + "score": 1.0, + "content": "using ordinary least squares (OLS) to estimate", + "type": "text" + }, + { + "bbox": [ + 301, + 168, + 312, + 178 + ], + "score": 0.85, + "content": "\\theta ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 168, + 384, + 181 + ], + "score": 1.0, + "content": ", starting at level", + "type": "text" + }, + { + "bbox": [ + 384, + 168, + 417, + 178 + ], + "score": 0.91, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 168, + 505, + 181 + ], + "score": 1.0, + "content": "and then proceeding", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 179, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 179, + 182, + 191 + ], + "score": 1.0, + "content": "backwards to level", + "type": "text" + }, + { + "bbox": [ + 183, + 179, + 208, + 189 + ], + "score": 0.9, + "content": "h = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 179, + 505, + 191 + ], + "score": 1.0, + "content": ", using the plug-in estimator from the previous level. Here, LSPE will pro-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 190, + 505, + 202 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 505, + 202 + ], + "score": 1.0, + "content": "vide an unbiased estimate (provided the feature covariance matrices are full rank, which will occur", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 201, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 505, + 213 + ], + "score": 1.0, + "content": "with high probability). As a direct corollary, the above theorem implies that LSPE has exponential", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 212, + 505, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 153, + 224 + ], + "score": 1.0, + "content": "variance in", + "type": "text" + }, + { + "bbox": [ + 153, + 212, + 163, + 222 + ], + "score": 0.72, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 212, + 505, + 224 + ], + "score": 1.0, + "content": ". See Section 5 for a more detailed discussion on LSPE. More generally, our theorem", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 222, + 502, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 502, + 236 + ], + "score": 1.0, + "content": "implies that there is no estimator that can avoid such exponential dependence in the offline setting.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8.5, + "bbox_fs": [ + 104, + 145, + 506, + 236 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 505, + 348 + ], + "lines": [ + { + "bbox": [ + 106, + 238, + 505, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 505, + 251 + ], + "score": 1.0, + "content": "Remark 3 (Least-Squares Value Iteration (LSVI) versus Least-Squares Policy Iteration (LSPI)). In", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "the offline setting, under Assumptions 1 and 2, in order to find a near-optimal policy, the most na¨ıve", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 260, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 260, + 425, + 273 + ], + "score": 1.0, + "content": "algorithm would be LSVI, i.e., using ordinary least squares (OLS) to estimate", + "type": "text" + }, + { + "bbox": [ + 425, + 261, + 435, + 270 + ], + "score": 0.85, + "content": "\\theta ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 260, + 505, + 273 + ], + "score": 1.0, + "content": ", starting at level", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 136, + 281 + ], + "score": 0.9, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 271, + 295, + 284 + ], + "score": 1.0, + "content": "and then proceeding backwards to level", + "type": "text" + }, + { + "bbox": [ + 295, + 271, + 320, + 281 + ], + "score": 0.9, + "content": "h = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 271, + 505, + 284 + ], + "score": 1.0, + "content": ", using the plug-in estimator from the previous", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "score": 1.0, + "content": "level and the bellman operator. The above theorem implies that LSVI will require an exponential", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 293, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 505, + 306 + ], + "score": 1.0, + "content": "number of samples to find a near-optimal policy. On the other hand, if the regression targets are", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 302, + 506, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 317 + ], + "score": 1.0, + "content": "collected by using rollouts (i.e. on-policy sampling) as in LSPI (Lagoudakis & Parr, 2003), then a", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 315, + 506, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 506, + 328 + ], + "score": 1.0, + "content": "polynomial number of samples suffice. See Section D in (Du et al., 2020) for an analysis. Thus,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 326, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 338 + ], + "score": 1.0, + "content": "Theorem 4.1 implies an exponential separation on the sample complexity between LSVI and LSPI.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 336, + 478, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 478, + 351 + ], + "score": 1.0, + "content": "Of course, LSPI requires adaptive data samples and thus does not work in the offline setting.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 238, + 506, + 351 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 358, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 101, + 351, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 101, + 351, + 402, + 378 + ], + "score": 1.0, + "content": "One may wonder if Theorem 4.1 still holds when the data distributions", + "type": "text" + }, + { + "bbox": [ + 402, + 357, + 440, + 371 + ], + "score": 0.93, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 351, + 505, + 378 + ], + "score": 1.0, + "content": "are induced by", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 370, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 104, + 370, + 505, + 381 + ], + "score": 1.0, + "content": "a policy. In Appendix C, we prove another exponential sample complexity lower bound under the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 380, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 425, + 393 + ], + "score": 1.0, + "content": "additional assumption that the data distributions are induced by a fixed policy", + "type": "text" + }, + { + "bbox": [ + 425, + 382, + 432, + 390 + ], + "score": 0.76, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 380, + 505, + 393 + ], + "score": 1.0, + "content": ". However, under", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 391, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 505, + 404 + ], + "score": 1.0, + "content": "such an assumption, it is impossible to prove a hardness result as strong as Theorem 4.1 (which", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 444, + 414 + ], + "score": 1.0, + "content": "shows that evaluating any policy is hard), since one can at least evaluate the policy", + "type": "text" + }, + { + "bbox": [ + 445, + 403, + 453, + 412 + ], + "score": 0.73, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 402, + 505, + 414 + ], + "score": 1.0, + "content": "that induces", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 412, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 426 + ], + "score": 1.0, + "content": "the data distributions. Nevertheless, we are able to prove the hardness of offline policy evaluation,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 424, + 409, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 331, + 436 + ], + "score": 1.0, + "content": "under a weaker version of Assumption 1. See Appendix", + "type": "text" + }, + { + "bbox": [ + 332, + 424, + 340, + 434 + ], + "score": 0.27, + "content": "\\textrm { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 424, + 409, + 436 + ], + "score": 1.0, + "content": "for more details.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26, + "bbox_fs": [ + 101, + 351, + 505, + 436 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 440, + 505, + 476 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 454 + ], + "score": 1.0, + "content": "In the remaining part of this section, we give the hard instance construction and the proof of Theo-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 451, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 104, + 451, + 173, + 465 + ], + "score": 1.0, + "content": "rem 4.1. We use", + "type": "text" + }, + { + "bbox": [ + 173, + 452, + 180, + 462 + ], + "score": 0.74, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 451, + 378, + 465 + ], + "score": 1.0, + "content": "the denote the feature dimension, and we assume", + "type": "text" + }, + { + "bbox": [ + 378, + 452, + 385, + 462 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 451, + 505, + 465 + ], + "score": 1.0, + "content": "is even for simplicity. We use", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 462, + 491, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 113, + 474 + ], + "score": 0.83, + "content": "\\hat { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 462, + 153, + 478 + ], + "score": 1.0, + "content": "to denote", + "type": "text" + }, + { + "bbox": [ + 154, + 464, + 170, + 477 + ], + "score": 0.89, + "content": "d / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 462, + 491, + 478 + ], + "score": 1.0, + "content": "for convenience. We also provide an illustration of the construction in Figure 1.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 104, + 439, + 505, + 478 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 488, + 505, + 532 + ], + "lines": [ + { + "bbox": [ + 145, + 487, + 510, + 527 + ], + "spans": [ + { + "bbox": [ + 145, + 487, + 151, + 527 + ], + "score": 1.0, + "content": "ac,", + "type": "text" + }, + { + "bbox": [ + 164, + 487, + 203, + 527 + ], + "score": 1.0, + "content": "Action Spcontains", + "type": "text" + }, + { + "bbox": [ + 230, + 487, + 258, + 527 + ], + "score": 1.0, + "content": "d Transtates", + "type": "text" + }, + { + "bbox": [ + 316, + 487, + 335, + 527 + ], + "score": 1.0, + "content": "or. and", + "type": "text" + }, + { + "bbox": [ + 357, + 487, + 405, + 527 + ], + "score": 1.0, + "content": "action space . For each", + "type": "text" + }, + { + "bbox": [ + 406, + 489, + 463, + 501 + ], + "score": 0.93, + "content": "\\mathcal { A } = \\{ a _ { 1 } , a _ { 2 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 487, + 510, + 527 + ], + "score": 1.0, + "content": ". For each, for each", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 500, + 463, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 145, + 516 + ], + "score": 0.61, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 503, + 163, + 515 + ], + "score": 0.3, + "content": "S _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 501, + 229, + 514 + ], + "score": 0.91, + "content": "\\hat { d } + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 501, + 315, + 516 + ], + "score": 0.92, + "content": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 500, + 356, + 516 + ], + "score": 0.92, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 503, + 463, + 516 + ], + "score": 0.89, + "content": "h \\in [ H - 1 ]", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 515, + 403, + 536 + ], + "spans": [ + { + "bbox": [ + 107, + 516, + 193, + 531 + ], + "score": 0.93, + "content": "c \\in \\{ 1 , 2 , \\ldots , \\hat { d } + 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 515, + 232, + 536 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 232, + 516, + 306, + 532 + ], + "score": 0.92, + "content": "P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 515, + 324, + 536 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 324, + 518, + 398, + 532 + ], + "score": 0.92, + "content": "P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 515, + 403, + 536 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 106, + 487, + 510, + 536 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 545, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 104, + 541, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 104, + 541, + 227, + 561 + ], + "score": 1.0, + "content": "Reward Distributions. Let", + "type": "text" + }, + { + "bbox": [ + 227, + 545, + 296, + 558 + ], + "score": 0.94, + "content": "0 \\leq r _ { 0 } \\leq \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 541, + 471, + 561 + ], + "score": 1.0, + "content": "be a parameter to be determined. For each", + "type": "text" + }, + { + "bbox": [ + 471, + 546, + 505, + 558 + ], + "score": 0.92, + "content": "( h , c ) \\in", + "type": "inline_equation" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 555, + 510, + 578 + ], + "spans": [ + { + "bbox": [ + 107, + 559, + 163, + 573 + ], + "score": 0.93, + "content": "[ H - 1 ] \\times [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 555, + 182, + 578 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 182, + 561, + 210, + 572 + ], + "score": 0.9, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 555, + 243, + 578 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + }, + { + "bbox": [ + 243, + 560, + 299, + 573 + ], + "score": 0.92, + "content": "R ( s _ { h } ^ { c } , a ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 555, + 318, + 578 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 318, + 558, + 483, + 573 + ], + "score": 0.92, + "content": "R ( s _ { h } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot ( \\hat { d } ^ { 1 / 2 } - 1 ) \\cdot \\hat { d } ^ { ( H - h ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 555, + 510, + 578 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 573, + 503, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 198, + 601 + ], + "score": 1.0, + "content": "the last level, for each", + "type": "text" + }, + { + "bbox": [ + 199, + 578, + 228, + 593 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 573, + 247, + 601 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 248, + 581, + 276, + 591 + ], + "score": 0.86, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 573, + 309, + 601 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + }, + { + "bbox": [ + 309, + 574, + 381, + 599 + ], + "score": 0.9, + "content": "R ( s _ { H } ^ { c } , a ) = \\left\\{ \\begin{array} { l l } { { 1 } } \\\\ { { - 1 } } \\end{array} \\right.", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 573, + 458, + 601 + ], + "score": 1.0, + "content": "with probability with probability", + "type": "text" + }, + { + "bbox": [ + 458, + 574, + 503, + 586 + ], + "score": 0.88, + "content": "( 1 + r _ { 0 } ) / 2", + "type": "inline_equation" + } + ], + "index": 38 + }, + { + "bbox": [ + 458, + 587, + 503, + 599 + ], + "spans": [ + { + "bbox": [ + 458, + 587, + 503, + 599 + ], + "score": 0.84, + "content": "( 1 - r _ { 0 } ) / 2", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 103, + 597, + 442, + 619 + ], + "spans": [ + { + "bbox": [ + 103, + 597, + 135, + 619 + ], + "score": 1.0, + "content": "so that", + "type": "text" + }, + { + "bbox": [ + 136, + 603, + 208, + 615 + ], + "score": 0.94, + "content": "\\mathbb { E } [ R ( s _ { H } ^ { c } , a ) ] = r _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 597, + 313, + 619 + ], + "score": 1.0, + "content": ". Moreover, for all actions", + "type": "text" + }, + { + "bbox": [ + 316, + 600, + 437, + 615 + ], + "score": 0.83, + "content": "a \\in \\mathcal { A } , R ( s _ { H } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot \\hat { d } ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 597, + 442, + 619 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38, + "bbox_fs": [ + 103, + 541, + 510, + 619 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 629, + 505, + 670 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 210, + 642 + ], + "score": 1.0, + "content": "Feature Mapping. Let", + "type": "text" + }, + { + "bbox": [ + 210, + 631, + 266, + 641 + ], + "score": 0.88, + "content": "e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 627, + 408, + 642 + ], + "score": 1.0, + "content": "be a set of orthonormal vectors in", + "type": "text" + }, + { + "bbox": [ + 408, + 628, + 421, + 639 + ], + "score": 0.88, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 627, + 505, + 642 + ], + "score": 1.0, + "content": ". Here, one possible", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 640, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 641, + 169, + 655 + ], + "score": 1.0, + "content": "choice is to set", + "type": "text" + }, + { + "bbox": [ + 170, + 644, + 225, + 654 + ], + "score": 0.89, + "content": "e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 641, + 398, + 655 + ], + "score": 1.0, + "content": "to be the standard basis vectors. For each", + "type": "text" + }, + { + "bbox": [ + 398, + 640, + 473, + 654 + ], + "score": 0.93, + "content": "( h , c ) \\in [ H ] \\times [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 641, + 505, + 655 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 650, + 438, + 674 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 243, + 669 + ], + "score": 0.78, + "content": "\\phi ( s _ { h } ^ { c } , a _ { 1 } ) = e _ { c } , \\phi ( s _ { h } ^ { c } , a _ { 2 } ) = e _ { c + { \\hat { d } } } ", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 650, + 262, + 674 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 263, + 653, + 376, + 669 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\phi ( s _ { h } ^ { \\hat { d } + 1 } , a ) = \\sum _ { c \\in \\hat { d } } e _ { c } / \\hat { d } ^ { 1 / 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 650, + 405, + 674 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 405, + 657, + 431, + 667 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 650, + 438, + 674 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 627, + 505, + 674 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 680, + 503, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 679, + 504, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 679, + 504, + 694 + ], + "score": 1.0, + "content": "Verifying Assumption 1. The following lemma shows that Assumption 1 holds for our construc-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 693, + 316, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 316, + 704 + ], + "score": 1.0, + "content": "tion. The formal proof can be found in Appendix A.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5, + "bbox_fs": [ + 106, + 679, + 504, + 704 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 706, + 503, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 705, + 506, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 705, + 229, + 721 + ], + "score": 1.0, + "content": "Lemma 4.2. For every policy", + "type": "text" + }, + { + "bbox": [ + 230, + 707, + 292, + 719 + ], + "score": 0.92, + "content": "\\pi : S \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 705, + 332, + 721 + ], + "score": 1.0, + "content": ", for each", + "type": "text" + }, + { + "bbox": [ + 332, + 707, + 366, + 719 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 705, + 398, + 721 + ], + "score": 1.0, + "content": ", for all", + "type": "text" + }, + { + "bbox": [ + 399, + 707, + 467, + 719 + ], + "score": 0.92, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 705, + 506, + 721 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 718, + 289, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 718, + 211, + 733 + ], + "score": 0.91, + "content": "Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 718, + 249, + 734 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 249, + 720, + 284, + 733 + ], + "score": 0.93, + "content": "\\theta _ { h } ^ { \\pi } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 718, + 289, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 705, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 83, + 501, + 304 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 83, + 501, + 304 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 83, + 501, + 304 + ], + "spans": [ + { + "bbox": [ + 109, + 83, + 501, + 304 + ], + "score": 0.947, + "type": "image", + "image_path": "f1c705bac0910c06796a6d112262eac433faed712ddcc102a45cae574ace9638.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 83, + 501, + 156.66666666666669 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 156.66666666666669, + 501, + 230.33333333333337 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 230.33333333333337, + 501, + 304.00000000000006 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 506, + 472 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 342, + 343 + ], + "score": 1.0, + "content": "Figure 1: An illustration of the hard instance. Recall that", + "type": "text" + }, + { + "bbox": [ + 342, + 329, + 379, + 343 + ], + "score": 0.92, + "content": "\\hat { d } = d / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 330, + 505, + 343 + ], + "score": 1.0, + "content": ". States on the top are those in", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 341, + 506, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 165, + 354 + ], + "score": 1.0, + "content": "the first level", + "type": "text" + }, + { + "bbox": [ + 165, + 343, + 195, + 353 + ], + "score": 0.85, + "content": "( h = 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 341, + 419, + 354 + ], + "score": 1.0, + "content": "), while states at the bottom are those in the last level", + "type": "text" + }, + { + "bbox": [ + 420, + 343, + 453, + 353 + ], + "score": 0.85, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 341, + 506, + 354 + ], + "score": 1.0, + "content": "). Solid line", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 353, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 362, + 365 + ], + "score": 1.0, + "content": "(with arrow) corresponds to transitions associated with action", + "type": "text" + }, + { + "bbox": [ + 363, + 355, + 374, + 364 + ], + "score": 0.84, + "content": "a _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 353, + 505, + 365 + ], + "score": 1.0, + "content": ", while dotted line (with arrow)", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 364, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 307, + 376 + ], + "score": 1.0, + "content": "corresponds to transitions associated with action", + "type": "text" + }, + { + "bbox": [ + 307, + 366, + 318, + 375 + ], + "score": 0.83, + "content": "a _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 365, + 386, + 376 + ], + "score": 1.0, + "content": ". For each level", + "type": "text" + }, + { + "bbox": [ + 387, + 364, + 424, + 376 + ], + "score": 0.93, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 365, + 505, + 376 + ], + "score": 1.0, + "content": ", reward values and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 373, + 508, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 115, + 390 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 373, + 210, + 393 + ], + "score": 1.0, + "content": "-values associated with", + "type": "text" + }, + { + "bbox": [ + 211, + 375, + 268, + 390 + ], + "score": 0.95, + "content": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 373, + 466, + 393 + ], + "score": 1.0, + "content": "are marked on the left, while reward values and", + "type": "text" + }, + { + "bbox": [ + 466, + 378, + 475, + 390 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 373, + 508, + 393 + ], + "score": 1.0, + "content": "-values", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 388, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 104, + 388, + 171, + 409 + ], + "score": 1.0, + "content": "associated with", + "type": "text" + }, + { + "bbox": [ + 172, + 389, + 192, + 405 + ], + "score": 0.93, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 388, + 505, + 409 + ], + "score": 1.0, + "content": "are mark on the right. Rewards and transitions are all deterministic, except", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 101, + 398, + 509, + 430 + ], + "spans": [ + { + "bbox": [ + 101, + 398, + 277, + 430 + ], + "score": 1.0, + "content": "for the reward distributions associated with", + "type": "text" + }, + { + "bbox": [ + 281, + 405, + 345, + 419 + ], + "score": 0.91, + "content": "s _ { H } ^ { 1 } , s _ { H } ^ { 2 } , \\ldots , s _ { H } ^ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 398, + 413, + 430 + ], + "score": 1.0, + "content": ". We mark the ex", + "type": "text" + }, + { + "bbox": [ + 425, + 398, + 509, + 430 + ], + "score": 1.0, + "content": "tation of the reward", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 101, + 419, + 510, + 452 + ], + "spans": [ + { + "bbox": [ + 101, + 423, + 370, + 452 + ], + "score": 1.0, + "content": "uniformly at random from those states in the dashed rectangle, i.e.,", + "type": "text" + }, + { + "bbox": [ + 277, + 419, + 312, + 430 + ], + "score": 0.91, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 429, + 437, + 444 + ], + "score": 0.93, + "content": "\\{ s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 420, + 425, + 429 + ], + "score": 0.83, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 423, + 510, + 452 + ], + "score": 1.0, + "content": ", while the action", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 100, + 438, + 510, + 466 + ], + "spans": [ + { + "bbox": [ + 100, + 438, + 255, + 466 + ], + "score": 1.0, + "content": "is chosen uniformly at random from", + "type": "text" + }, + { + "bbox": [ + 255, + 446, + 289, + 459 + ], + "score": 0.91, + "content": "\\{ a _ { 1 } , a _ { 2 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 438, + 403, + 466 + ], + "score": 1.0, + "content": ". Suppose the initial state is", + "type": "text" + }, + { + "bbox": [ + 404, + 444, + 424, + 459 + ], + "score": 0.9, + "content": "s _ { 1 } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 438, + 456, + 466 + ], + "score": 1.0, + "content": ". When", + "type": "text" + }, + { + "bbox": [ + 456, + 447, + 486, + 458 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 438, + 510, + 466 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 457, + 444, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 228, + 473 + ], + "score": 1.0, + "content": "value of the policy is 0. When", + "type": "text" + }, + { + "bbox": [ + 229, + 459, + 279, + 471 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 457, + 383, + 473 + ], + "score": 1.0, + "content": ", the value of the policy is", + "type": "text" + }, + { + "bbox": [ + 383, + 459, + 439, + 471 + ], + "score": 0.92, + "content": "r _ { 0 } \\cdot \\hat { d } ^ { H / 2 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 457, + 444, + 473 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 495, + 505, + 538 + ], + "lines": [ + { + "bbox": [ + 106, + 494, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 106, + 494, + 274, + 508 + ], + "score": 1.0, + "content": "The Data Distributions. For each level", + "type": "text" + }, + { + "bbox": [ + 274, + 496, + 308, + 507 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 494, + 393, + 508 + ], + "score": 1.0, + "content": ", the data distribution", + "type": "text" + }, + { + "bbox": [ + 393, + 498, + 405, + 507 + ], + "score": 0.85, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 494, + 505, + 508 + ], + "score": 1.0, + "content": "is a uniform distribution", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 102, + 502, + 509, + 530 + ], + "spans": [ + { + "bbox": [ + 102, + 502, + 126, + 530 + ], + "score": 1.0, + "content": "over", + "type": "text" + }, + { + "bbox": [ + 126, + 508, + 368, + 523 + ], + "score": 0.88, + "content": "\\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 1 } , a _ { 2 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 2 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } } , a _ { 2 } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 502, + 418, + 530 + ], + "score": 1.0, + "content": ". Notice that", + "type": "text" + }, + { + "bbox": [ + 419, + 507, + 456, + 522 + ], + "score": 0.93, + "content": "( s _ { h } ^ { \\hat { d } + 1 } , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 502, + 509, + 530 + ], + "score": 1.0, + "content": "is not in the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 102, + 515, + 502, + 543 + ], + "spans": [ + { + "bbox": [ + 102, + 515, + 149, + 543 + ], + "score": 1.0, + "content": "hsupport of", + "type": "text" + }, + { + "bbox": [ + 149, + 526, + 161, + 536 + ], + "score": 0.86, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 515, + 188, + 543 + ], + "score": 1.0, + "content": "hfor all", + "type": "text" + }, + { + "bbox": [ + 189, + 525, + 215, + 534 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 515, + 295, + 543 + ], + "score": 1.0, + "content": "h h. It can be seen that,", + "type": "text" + }, + { + "bbox": [ + 295, + 523, + 502, + 537 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } \\left[ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } \\right] = \\frac { 1 } { d } \\sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \\top } = \\frac { 1 } { d } I . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 505, + 614 + ], + "lines": [ + { + "bbox": [ + 106, + 551, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 565 + ], + "score": 1.0, + "content": "The Lower Bound. We show that it is information-theoretically hard for any algorithm to distin-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 102, + 563, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 102, + 563, + 163, + 582 + ], + "score": 1.0, + "content": "guish the case", + "type": "text" + }, + { + "bbox": [ + 164, + 566, + 192, + 577 + ], + "score": 0.89, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 563, + 210, + 582 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 210, + 564, + 260, + 577 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 563, + 374, + 582 + ], + "score": 1.0, + "content": ". We fix the initial state to be", + "type": "text" + }, + { + "bbox": [ + 374, + 563, + 394, + 578 + ], + "score": 0.93, + "content": "s _ { 1 } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 563, + 494, + 582 + ], + "score": 1.0, + "content": ", and consider any policy", + "type": "text" + }, + { + "bbox": [ + 494, + 569, + 501, + 576 + ], + "score": 0.72, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 563, + 506, + 582 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 577, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 132, + 589 + ], + "score": 1.0, + "content": "When", + "type": "text" + }, + { + "bbox": [ + 132, + 578, + 161, + 588 + ], + "score": 0.88, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 577, + 366, + 589 + ], + "score": 1.0, + "content": ", all reward values will be zero, and thus the value of", + "type": "text" + }, + { + "bbox": [ + 367, + 579, + 374, + 587 + ], + "score": 0.79, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 577, + 505, + 589 + ], + "score": 1.0, + "content": "is zero. On the other hand, when", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 586, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 156, + 601 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 586, + 210, + 603 + ], + "score": 1.0, + "content": ", the value of", + "type": "text" + }, + { + "bbox": [ + 210, + 591, + 218, + 599 + ], + "score": 0.73, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 586, + 258, + 603 + ], + "score": 1.0, + "content": "would be", + "type": "text" + }, + { + "bbox": [ + 259, + 587, + 316, + 600 + ], + "score": 0.93, + "content": "r _ { 0 } \\cdot \\hat { d } ^ { H / 2 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 586, + 506, + 603 + ], + "score": 1.0, + "content": ". Thus, if the algorithm approximates the value", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 600, + 495, + 614 + ], + "spans": [ + { + "bbox": [ + 104, + 600, + 226, + 614 + ], + "score": 1.0, + "content": "of the policy up to an error of", + "type": "text" + }, + { + "bbox": [ + 227, + 602, + 243, + 614 + ], + "score": 0.81, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 600, + 393, + 614 + ], + "score": 1.0, + "content": ", then it must distinguish the case that", + "type": "text" + }, + { + "bbox": [ + 394, + 602, + 423, + 613 + ], + "score": 0.92, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 600, + 440, + 614 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 441, + 600, + 490, + 613 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 600, + 495, + 614 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 618, + 505, + 734 + ], + "lines": [ + { + "bbox": [ + 103, + 615, + 508, + 638 + ], + "spans": [ + { + "bbox": [ + 103, + 615, + 236, + 638 + ], + "score": 1.0, + "content": "We first notice that for the case", + "type": "text" + }, + { + "bbox": [ + 236, + 621, + 267, + 632 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 615, + 286, + 638 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 286, + 619, + 338, + 632 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 615, + 430, + 638 + ], + "score": 1.0, + "content": ", the data distributions", + "type": "text" + }, + { + "bbox": [ + 430, + 619, + 467, + 633 + ], + "score": 0.93, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 615, + 508, + 638 + ], + "score": 1.0, + "content": ", the fea-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 163, + 646 + ], + "score": 1.0, + "content": "ture mapping", + "type": "text" + }, + { + "bbox": [ + 163, + 632, + 236, + 645 + ], + "score": 0.92, + "content": "\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 632, + 283, + 646 + ], + "score": 1.0, + "content": ", the policy", + "type": "text" + }, + { + "bbox": [ + 283, + 636, + 290, + 643 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 632, + 464, + 646 + ], + "score": 1.0, + "content": "to be evaluated and the transition operator", + "type": "text" + }, + { + "bbox": [ + 465, + 634, + 474, + 643 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 632, + 506, + 646 + ], + "score": 1.0, + "content": "are the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 642, + 506, + 660 + ], + "spans": [ + { + "bbox": [ + 104, + 642, + 285, + 660 + ], + "score": 1.0, + "content": "same. Thus, in order to distinguish the case", + "type": "text" + }, + { + "bbox": [ + 285, + 646, + 316, + 657 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 642, + 334, + 660 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 334, + 644, + 385, + 657 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 642, + 506, + 660 + ], + "score": 1.0, + "content": ", the only way is to query the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "reward distribution by using sampling taken from the data distributions. For all state-action pairs", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 667, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 107, + 668, + 129, + 680 + ], + "score": 0.92, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 130, + 667, + 332, + 680 + ], + "score": 1.0, + "content": "in the support of the data distributions of the first", + "type": "text" + }, + { + "bbox": [ + 332, + 668, + 360, + 678 + ], + "score": 0.89, + "content": "H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 667, + 505, + 680 + ], + "score": 1.0, + "content": "levels, the reward distributions will", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 101, + 675, + 509, + 702 + ], + "spans": [ + { + "bbox": [ + 101, + 675, + 259, + 702 + ], + "score": 1.0, + "content": "be identical. This is because for all", + "type": "text" + }, + { + "bbox": [ + 259, + 679, + 333, + 695 + ], + "score": 0.93, + "content": "s \\in \\mathcal { S } _ { h } \\setminus \\{ s _ { h } ^ { \\hat { d } + 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 675, + 353, + 702 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 354, + 682, + 384, + 693 + ], + "score": 0.88, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 675, + 427, + 702 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 428, + 682, + 481, + 694 + ], + "score": 0.95, + "content": "R ( s , a ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 675, + 509, + 702 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 691, + 506, + 710 + ], + "spans": [ + { + "bbox": [ + 104, + 691, + 142, + 710 + ], + "score": 1.0, + "content": "the case", + "type": "text" + }, + { + "bbox": [ + 143, + 696, + 175, + 707 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 691, + 195, + 710 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 195, + 694, + 248, + 707 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 691, + 354, + 710 + ], + "score": 1.0, + "content": ", for all state-action pairs", + "type": "text" + }, + { + "bbox": [ + 355, + 695, + 377, + 708 + ], + "score": 0.91, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 691, + 506, + 710 + ], + "score": 1.0, + "content": "in the support of the data dis-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 706, + 505, + 735 + ], + "spans": [ + { + "bbox": [ + 104, + 710, + 210, + 731 + ], + "score": 1.0, + "content": "tribution of the last level,", + "type": "text" + }, + { + "bbox": [ + 211, + 708, + 278, + 734 + ], + "score": 0.9, + "content": "R ( s , a ) = \\left\\{ { 1 \\atop - 1 } \\right.", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 706, + 352, + 735 + ], + "score": 1.0, + "content": "with probability with probability", + "type": "text" + }, + { + "bbox": [ + 352, + 708, + 398, + 721 + ], + "score": 0.67, + "content": "( 1 + r _ { 0 } ) / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 718, + 398, + 734 + ], + "score": 0.73, + "content": "\\dot { ( 1 - r _ { 0 } ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 714, + 505, + 728 + ], + "score": 1.0, + "content": "Therefore, to distinguish", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24.5 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 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, + 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": [ + 109, + 83, + 501, + 304 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 83, + 501, + 304 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 83, + 501, + 304 + ], + "spans": [ + { + "bbox": [ + 109, + 83, + 501, + 304 + ], + "score": 0.947, + "type": "image", + "image_path": "f1c705bac0910c06796a6d112262eac433faed712ddcc102a45cae574ace9638.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 83, + 501, + 156.66666666666669 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 156.66666666666669, + 501, + 230.33333333333337 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 230.33333333333337, + 501, + 304.00000000000006 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 506, + 472 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 342, + 343 + ], + "score": 1.0, + "content": "Figure 1: An illustration of the hard instance. Recall that", + "type": "text" + }, + { + "bbox": [ + 342, + 329, + 379, + 343 + ], + "score": 0.92, + "content": "\\hat { d } = d / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 330, + 505, + 343 + ], + "score": 1.0, + "content": ". States on the top are those in", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 341, + 506, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 165, + 354 + ], + "score": 1.0, + "content": "the first level", + "type": "text" + }, + { + "bbox": [ + 165, + 343, + 195, + 353 + ], + "score": 0.85, + "content": "( h = 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 341, + 419, + 354 + ], + "score": 1.0, + "content": "), while states at the bottom are those in the last level", + "type": "text" + }, + { + "bbox": [ + 420, + 343, + 453, + 353 + ], + "score": 0.85, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 341, + 506, + 354 + ], + "score": 1.0, + "content": "). Solid line", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 353, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 362, + 365 + ], + "score": 1.0, + "content": "(with arrow) corresponds to transitions associated with action", + "type": "text" + }, + { + "bbox": [ + 363, + 355, + 374, + 364 + ], + "score": 0.84, + "content": "a _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 353, + 505, + 365 + ], + "score": 1.0, + "content": ", while dotted line (with arrow)", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 364, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 307, + 376 + ], + "score": 1.0, + "content": "corresponds to transitions associated with action", + "type": "text" + }, + { + "bbox": [ + 307, + 366, + 318, + 375 + ], + "score": 0.83, + "content": "a _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 365, + 386, + 376 + ], + "score": 1.0, + "content": ". For each level", + "type": "text" + }, + { + "bbox": [ + 387, + 364, + 424, + 376 + ], + "score": 0.93, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 365, + 505, + 376 + ], + "score": 1.0, + "content": ", reward values and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 373, + 508, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 115, + 390 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 373, + 210, + 393 + ], + "score": 1.0, + "content": "-values associated with", + "type": "text" + }, + { + "bbox": [ + 211, + 375, + 268, + 390 + ], + "score": 0.95, + "content": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 373, + 466, + 393 + ], + "score": 1.0, + "content": "are marked on the left, while reward values and", + "type": "text" + }, + { + "bbox": [ + 466, + 378, + 475, + 390 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 373, + 508, + 393 + ], + "score": 1.0, + "content": "-values", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 388, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 104, + 388, + 171, + 409 + ], + "score": 1.0, + "content": "associated with", + "type": "text" + }, + { + "bbox": [ + 172, + 389, + 192, + 405 + ], + "score": 0.93, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 388, + 505, + 409 + ], + "score": 1.0, + "content": "are mark on the right. Rewards and transitions are all deterministic, except", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 101, + 398, + 509, + 430 + ], + "spans": [ + { + "bbox": [ + 101, + 398, + 277, + 430 + ], + "score": 1.0, + "content": "for the reward distributions associated with", + "type": "text" + }, + { + "bbox": [ + 281, + 405, + 345, + 419 + ], + "score": 0.91, + "content": "s _ { H } ^ { 1 } , s _ { H } ^ { 2 } , \\ldots , s _ { H } ^ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 398, + 413, + 430 + ], + "score": 1.0, + "content": ". We mark the ex", + "type": "text" + }, + { + "bbox": [ + 425, + 398, + 509, + 430 + ], + "score": 1.0, + "content": "tation of the reward", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 101, + 419, + 510, + 452 + ], + "spans": [ + { + "bbox": [ + 101, + 423, + 370, + 452 + ], + "score": 1.0, + "content": "uniformly at random from those states in the dashed rectangle, i.e.,", + "type": "text" + }, + { + "bbox": [ + 277, + 419, + 312, + 430 + ], + "score": 0.91, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 429, + 437, + 444 + ], + "score": 0.93, + "content": "\\{ s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 420, + 425, + 429 + ], + "score": 0.83, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 423, + 510, + 452 + ], + "score": 1.0, + "content": ", while the action", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 100, + 438, + 510, + 466 + ], + "spans": [ + { + "bbox": [ + 100, + 438, + 255, + 466 + ], + "score": 1.0, + "content": "is chosen uniformly at random from", + "type": "text" + }, + { + "bbox": [ + 255, + 446, + 289, + 459 + ], + "score": 0.91, + "content": "\\{ a _ { 1 } , a _ { 2 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 438, + 403, + 466 + ], + "score": 1.0, + "content": ". Suppose the initial state is", + "type": "text" + }, + { + "bbox": [ + 404, + 444, + 424, + 459 + ], + "score": 0.9, + "content": "s _ { 1 } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 438, + 456, + 466 + ], + "score": 1.0, + "content": ". When", + "type": "text" + }, + { + "bbox": [ + 456, + 447, + 486, + 458 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 438, + 510, + 466 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 457, + 444, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 228, + 473 + ], + "score": 1.0, + "content": "value of the policy is 0. When", + "type": "text" + }, + { + "bbox": [ + 229, + 459, + 279, + 471 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 457, + 383, + 473 + ], + "score": 1.0, + "content": ", the value of the policy is", + "type": "text" + }, + { + "bbox": [ + 383, + 459, + 439, + 471 + ], + "score": 0.92, + "content": "r _ { 0 } \\cdot \\hat { d } ^ { H / 2 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 457, + 444, + 473 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 7.5, + "bbox_fs": [ + 100, + 329, + 510, + 473 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 495, + 505, + 538 + ], + "lines": [ + { + "bbox": [ + 106, + 494, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 106, + 494, + 274, + 508 + ], + "score": 1.0, + "content": "The Data Distributions. For each level", + "type": "text" + }, + { + "bbox": [ + 274, + 496, + 308, + 507 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 494, + 393, + 508 + ], + "score": 1.0, + "content": ", the data distribution", + "type": "text" + }, + { + "bbox": [ + 393, + 498, + 405, + 507 + ], + "score": 0.85, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 494, + 505, + 508 + ], + "score": 1.0, + "content": "is a uniform distribution", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 102, + 502, + 509, + 530 + ], + "spans": [ + { + "bbox": [ + 102, + 502, + 126, + 530 + ], + "score": 1.0, + "content": "over", + "type": "text" + }, + { + "bbox": [ + 126, + 508, + 368, + 523 + ], + "score": 0.88, + "content": "\\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 1 } , a _ { 2 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 2 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } } , a _ { 2 } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 502, + 418, + 530 + ], + "score": 1.0, + "content": ". Notice that", + "type": "text" + }, + { + "bbox": [ + 419, + 507, + 456, + 522 + ], + "score": 0.93, + "content": "( s _ { h } ^ { \\hat { d } + 1 } , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 502, + 509, + 530 + ], + "score": 1.0, + "content": "is not in the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 102, + 515, + 502, + 543 + ], + "spans": [ + { + "bbox": [ + 102, + 515, + 149, + 543 + ], + "score": 1.0, + "content": "hsupport of", + "type": "text" + }, + { + "bbox": [ + 149, + 526, + 161, + 536 + ], + "score": 0.86, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 515, + 188, + 543 + ], + "score": 1.0, + "content": "hfor all", + "type": "text" + }, + { + "bbox": [ + 189, + 525, + 215, + 534 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 515, + 295, + 543 + ], + "score": 1.0, + "content": "h h. It can be seen that,", + "type": "text" + }, + { + "bbox": [ + 295, + 523, + 502, + 537 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } \\left[ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } \\right] = \\frac { 1 } { d } \\sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \\top } = \\frac { 1 } { d } I . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 102, + 494, + 509, + 543 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 505, + 614 + ], + "lines": [ + { + "bbox": [ + 106, + 551, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 565 + ], + "score": 1.0, + "content": "The Lower Bound. We show that it is information-theoretically hard for any algorithm to distin-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 102, + 563, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 102, + 563, + 163, + 582 + ], + "score": 1.0, + "content": "guish the case", + "type": "text" + }, + { + "bbox": [ + 164, + 566, + 192, + 577 + ], + "score": 0.89, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 563, + 210, + 582 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 210, + 564, + 260, + 577 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 563, + 374, + 582 + ], + "score": 1.0, + "content": ". We fix the initial state to be", + "type": "text" + }, + { + "bbox": [ + 374, + 563, + 394, + 578 + ], + "score": 0.93, + "content": "s _ { 1 } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 563, + 494, + 582 + ], + "score": 1.0, + "content": ", and consider any policy", + "type": "text" + }, + { + "bbox": [ + 494, + 569, + 501, + 576 + ], + "score": 0.72, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 563, + 506, + 582 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 577, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 132, + 589 + ], + "score": 1.0, + "content": "When", + "type": "text" + }, + { + "bbox": [ + 132, + 578, + 161, + 588 + ], + "score": 0.88, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 577, + 366, + 589 + ], + "score": 1.0, + "content": ", all reward values will be zero, and thus the value of", + "type": "text" + }, + { + "bbox": [ + 367, + 579, + 374, + 587 + ], + "score": 0.79, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 577, + 505, + 589 + ], + "score": 1.0, + "content": "is zero. On the other hand, when", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 586, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 156, + 601 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 586, + 210, + 603 + ], + "score": 1.0, + "content": ", the value of", + "type": "text" + }, + { + "bbox": [ + 210, + 591, + 218, + 599 + ], + "score": 0.73, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 586, + 258, + 603 + ], + "score": 1.0, + "content": "would be", + "type": "text" + }, + { + "bbox": [ + 259, + 587, + 316, + 600 + ], + "score": 0.93, + "content": "r _ { 0 } \\cdot \\hat { d } ^ { H / 2 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 586, + 506, + 603 + ], + "score": 1.0, + "content": ". Thus, if the algorithm approximates the value", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 600, + 495, + 614 + ], + "spans": [ + { + "bbox": [ + 104, + 600, + 226, + 614 + ], + "score": 1.0, + "content": "of the policy up to an error of", + "type": "text" + }, + { + "bbox": [ + 227, + 602, + 243, + 614 + ], + "score": 0.81, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 600, + 393, + 614 + ], + "score": 1.0, + "content": ", then it must distinguish the case that", + "type": "text" + }, + { + "bbox": [ + 394, + 602, + 423, + 613 + ], + "score": 0.92, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 600, + 440, + 614 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 441, + 600, + 490, + 613 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 600, + 495, + 614 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18, + "bbox_fs": [ + 102, + 551, + 506, + 614 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 618, + 505, + 734 + ], + "lines": [ + { + "bbox": [ + 103, + 615, + 508, + 638 + ], + "spans": [ + { + "bbox": [ + 103, + 615, + 236, + 638 + ], + "score": 1.0, + "content": "We first notice that for the case", + "type": "text" + }, + { + "bbox": [ + 236, + 621, + 267, + 632 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 615, + 286, + 638 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 286, + 619, + 338, + 632 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 615, + 430, + 638 + ], + "score": 1.0, + "content": ", the data distributions", + "type": "text" + }, + { + "bbox": [ + 430, + 619, + 467, + 633 + ], + "score": 0.93, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 615, + 508, + 638 + ], + "score": 1.0, + "content": ", the fea-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 163, + 646 + ], + "score": 1.0, + "content": "ture mapping", + "type": "text" + }, + { + "bbox": [ + 163, + 632, + 236, + 645 + ], + "score": 0.92, + "content": "\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 632, + 283, + 646 + ], + "score": 1.0, + "content": ", the policy", + "type": "text" + }, + { + "bbox": [ + 283, + 636, + 290, + 643 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 632, + 464, + 646 + ], + "score": 1.0, + "content": "to be evaluated and the transition operator", + "type": "text" + }, + { + "bbox": [ + 465, + 634, + 474, + 643 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 632, + 506, + 646 + ], + "score": 1.0, + "content": "are the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 642, + 506, + 660 + ], + "spans": [ + { + "bbox": [ + 104, + 642, + 285, + 660 + ], + "score": 1.0, + "content": "same. Thus, in order to distinguish the case", + "type": "text" + }, + { + "bbox": [ + 285, + 646, + 316, + 657 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 642, + 334, + 660 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 334, + 644, + 385, + 657 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 642, + 506, + 660 + ], + "score": 1.0, + "content": ", the only way is to query the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "reward distribution by using sampling taken from the data distributions. For all state-action pairs", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 667, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 107, + 668, + 129, + 680 + ], + "score": 0.92, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 130, + 667, + 332, + 680 + ], + "score": 1.0, + "content": "in the support of the data distributions of the first", + "type": "text" + }, + { + "bbox": [ + 332, + 668, + 360, + 678 + ], + "score": 0.89, + "content": "H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 667, + 505, + 680 + ], + "score": 1.0, + "content": "levels, the reward distributions will", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 101, + 675, + 509, + 702 + ], + "spans": [ + { + "bbox": [ + 101, + 675, + 259, + 702 + ], + "score": 1.0, + "content": "be identical. This is because for all", + "type": "text" + }, + { + "bbox": [ + 259, + 679, + 333, + 695 + ], + "score": 0.93, + "content": "s \\in \\mathcal { S } _ { h } \\setminus \\{ s _ { h } ^ { \\hat { d } + 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 675, + 353, + 702 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 354, + 682, + 384, + 693 + ], + "score": 0.88, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 675, + 427, + 702 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 428, + 682, + 481, + 694 + ], + "score": 0.95, + "content": "R ( s , a ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 675, + 509, + 702 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 691, + 506, + 710 + ], + "spans": [ + { + "bbox": [ + 104, + 691, + 142, + 710 + ], + "score": 1.0, + "content": "the case", + "type": "text" + }, + { + "bbox": [ + 143, + 696, + 175, + 707 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 691, + 195, + 710 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 195, + 694, + 248, + 707 + ], + "score": 0.93, + "content": "r _ { 0 } = \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 691, + 354, + 710 + ], + "score": 1.0, + "content": ", for all state-action pairs", + "type": "text" + }, + { + "bbox": [ + 355, + 695, + 377, + 708 + ], + "score": 0.91, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 691, + 506, + 710 + ], + "score": 1.0, + "content": "in the support of the data dis-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 706, + 505, + 735 + ], + "spans": [ + { + "bbox": [ + 104, + 710, + 210, + 731 + ], + "score": 1.0, + "content": "tribution of the last level,", + "type": "text" + }, + { + "bbox": [ + 211, + 708, + 278, + 734 + ], + "score": 0.9, + "content": "R ( s , a ) = \\left\\{ { 1 \\atop - 1 } \\right.", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 706, + 352, + 735 + ], + "score": 1.0, + "content": "with probability with probability", + "type": "text" + }, + { + "bbox": [ + 352, + 708, + 398, + 721 + ], + "score": 0.67, + "content": "( 1 + r _ { 0 } ) / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 718, + 398, + 734 + ], + "score": 0.73, + "content": "\\dot { ( 1 - r _ { 0 } ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 714, + 505, + 728 + ], + "score": 1.0, + "content": "Therefore, to distinguish", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 208, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 104, + 208, + 162, + 227 + ], + "score": 1.0, + "content": "the case that", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 162, + 214, + 196, + 225 + ], + "score": 0.91, + "content": "r _ { 0 } ~ = ~ 0", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 196, + 208, + 216, + 227 + ], + "score": 1.0, + "content": "and", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 216, + 211, + 271, + 225 + ], + "score": 0.92, + "content": "r _ { 0 } ~ = ~ \\hat { d } ^ { - H / 2 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 271, + 208, + 506, + 227 + ], + "score": 1.0, + "content": ", the agent needs to distinguish two reward distributions", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 222, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 245, + 254 + ], + "score": 0.58, + "content": "r _ { 1 } = \\left\\{ { \\begin{array} { l l } { 1 } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\\\ { - 1 } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\end{array} } \\right.", + "type": "inline_equation", + "image_path": "b6a9d4553bf5b120be9cf334cf02b0081b5c431eb7d50957a9b2faac4b2fbedf.jpg", + "cross_page": true + }, + { + "bbox": [ + 245, + 226, + 263, + 255 + ], + "score": 1.0, + "content": "and", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 263, + 224, + 311, + 256 + ], + "score": 0.92, + "content": "r _ { 2 } = \\left\\{ \\begin{array} { l l } { { \\stackrel { - } { 1 } } } \\\\ { { - 1 } } \\end{array} \\right.", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 314, + 222, + 385, + 255 + ], + "score": 1.0, + "content": "with probability with probability", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 385, + 225, + 450, + 253 + ], + "score": 0.86, + "content": "\\begin{array} { c } { { ( 1 + \\hat { d } ^ { - H / 2 } ) / 2 } } \\\\ { { ( 1 - \\hat { d } ^ { - H / 2 } ) / 2 } } \\end{array}", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 450, + 222, + 505, + 255 + ], + "score": 1.0, + "content": ". Now we in-", + "type": "text", + "cross_page": true + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 253, + 507, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 275, + 271 + ], + "score": 1.0, + "content": "voke Lemma B.1 in Section B by setting", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 275, + 255, + 333, + 269 + ], + "score": 0.91, + "content": "\\varepsilon = \\hat { d } ^ { - H / 2 } / 2", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 334, + 253, + 352, + 271 + ], + "score": 1.0, + "content": "and", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 352, + 257, + 386, + 267 + ], + "score": 0.9, + "content": "\\delta = 0 . 9", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 387, + 253, + 507, + 271 + ], + "score": 1.0, + "content": ". By Lemma B.1, in order to", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 267, + 468, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 152, + 284 + ], + "score": 1.0, + "content": "distinguish", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 153, + 271, + 163, + 281 + ], + "score": 0.85, + "content": "r _ { 1 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 163, + 267, + 181, + 284 + ], + "score": 1.0, + "content": "and", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 181, + 271, + 191, + 281 + ], + "score": 0.84, + "content": "r _ { 2 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 191, + 267, + 399, + 284 + ], + "score": 1.0, + "content": "with probability at least 0.9, any algorithm requires", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 400, + 268, + 428, + 282 + ], + "score": 0.93, + "content": "\\Omega ( \\hat { d } ^ { H } )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 429, + 267, + 468, + 284 + ], + "score": 1.0, + "content": "samples.", + "type": "text", + "cross_page": true + } + ], + "index": 7 + } + ], + "index": 24.5, + "bbox_fs": [ + 101, + 615, + 509, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 110, + 95, + 474, + 191 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 108, + 82, + 292, + 94 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 80, + 294, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 294, + 96 + ], + "score": 1.0, + "content": "Algorithm 1 Least-Squares Policy Evaluation", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 110, + 95, + 474, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 95, + 474, + 191 + ], + "spans": [ + { + "bbox": [ + 110, + 95, + 474, + 191 + ], + "score": 0.73, + "html": "
1: Input: policy π to be evaluated, number of samples N, regularization parameter 入 > 0
2:Let QH+1(·,·)=O andVH+1(-)= 0
forh=H,H-1,...,1do
4:Take samples (s,a)~ μh,rh ~ r(s,a) and sh ~P(s,a) for eachi∈ [N]
5:LetAh=∑i∈[N](sn,an)(s,a)T+λI
6: 7:LetOn=An1(∑N(s,)·(nh+V+1(3))
Let Qn(-,) = (.,·)TOn and Vh(.)=Q(·,π())
", + "type": "table", + "image_path": "6378731aaaa463eab5936d0eeab7d595642cdf4d6342dba676774f51486277ec.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 110, + 95, + 474, + 127.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 127.0, + 474, + 159.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 110, + 159.0, + 474, + 191.0 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "text", + "bbox": [ + 105, + 211, + 505, + 282 + ], + "lines": [ + { + "bbox": [ + 104, + 208, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 104, + 208, + 162, + 227 + ], + "score": 1.0, + "content": "the case that", + "type": "text" + }, + { + "bbox": [ + 162, + 214, + 196, + 225 + ], + "score": 0.91, + "content": "r _ { 0 } ~ = ~ 0", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 208, + 216, + 227 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 216, + 211, + 271, + 225 + ], + "score": 0.92, + "content": "r _ { 0 } ~ = ~ \\hat { d } ^ { - H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 208, + 506, + 227 + ], + "score": 1.0, + "content": ", the agent needs to distinguish two reward distributions", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 222, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 245, + 254 + ], + "score": 0.58, + "content": "r _ { 1 } = \\left\\{ { \\begin{array} { l l } { 1 } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\\\ { - 1 } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\end{array} } \\right.", + "type": "inline_equation", + "image_path": "b6a9d4553bf5b120be9cf334cf02b0081b5c431eb7d50957a9b2faac4b2fbedf.jpg" + }, + { + "bbox": [ + 245, + 226, + 263, + 255 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 263, + 224, + 311, + 256 + ], + "score": 0.92, + "content": "r _ { 2 } = \\left\\{ \\begin{array} { l l } { { \\stackrel { - } { 1 } } } \\\\ { { - 1 } } \\end{array} \\right.", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 222, + 385, + 255 + ], + "score": 1.0, + "content": "with probability with probability", + "type": "text" + }, + { + "bbox": [ + 385, + 225, + 450, + 253 + ], + "score": 0.86, + "content": "\\begin{array} { c } { { ( 1 + \\hat { d } ^ { - H / 2 } ) / 2 } } \\\\ { { ( 1 - \\hat { d } ^ { - H / 2 } ) / 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 222, + 505, + 255 + ], + "score": 1.0, + "content": ". Now we in-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 253, + 507, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 275, + 271 + ], + "score": 1.0, + "content": "voke Lemma B.1 in Section B by setting", + "type": "text" + }, + { + "bbox": [ + 275, + 255, + 333, + 269 + ], + "score": 0.91, + "content": "\\varepsilon = \\hat { d } ^ { - H / 2 } / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 253, + 352, + 271 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 352, + 257, + 386, + 267 + ], + "score": 0.9, + "content": "\\delta = 0 . 9", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 253, + 507, + 271 + ], + "score": 1.0, + "content": ". By Lemma B.1, in order to", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 267, + 468, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 152, + 284 + ], + "score": 1.0, + "content": "distinguish", + "type": "text" + }, + { + "bbox": [ + 153, + 271, + 163, + 281 + ], + "score": 0.85, + "content": "r _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 267, + 181, + 284 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 181, + 271, + 191, + 281 + ], + "score": 0.84, + "content": "r _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 267, + 399, + 284 + ], + "score": 1.0, + "content": "with probability at least 0.9, any algorithm requires", + "type": "text" + }, + { + "bbox": [ + 400, + 268, + 428, + 282 + ], + "score": 0.93, + "content": "\\Omega ( \\hat { d } ^ { H } )", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 267, + 468, + 284 + ], + "score": 1.0, + "content": "samples.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 285, + 506, + 366 + ], + "lines": [ + { + "bbox": [ + 104, + 284, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 104, + 284, + 340, + 304 + ], + "score": 1.0, + "content": "Remark 4. The key in our construction is the state sdˆ+h", + "type": "text" + }, + { + "bbox": [ + 346, + 284, + 506, + 301 + ], + "score": 1.0, + "content": "in each level, whose feature vector is", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 102, + 299, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 102, + 299, + 161, + 321 + ], + "score": 1.0, + "content": "defined to be", + "type": "text" + }, + { + "bbox": [ + 162, + 301, + 219, + 317 + ], + "score": 0.94, + "content": "\\textstyle \\sum _ { c \\in { \\hat { d } } } e _ { c } / { \\hat { d } } ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 299, + 281, + 321 + ], + "score": 1.0, + "content": ". In each level,", + "type": "text" + }, + { + "bbox": [ + 282, + 300, + 302, + 316 + ], + "score": 0.93, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 299, + 358, + 321 + ], + "score": 1.0, + "content": "amplifies the", + "type": "text" + }, + { + "bbox": [ + 358, + 303, + 367, + 315 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 299, + 414, + 321 + ], + "score": 1.0, + "content": "-value by a", + "type": "text" + }, + { + "bbox": [ + 414, + 301, + 433, + 314 + ], + "score": 0.9, + "content": "\\hat { d } ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 299, + 506, + 321 + ], + "score": 1.0, + "content": "factor, due to the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 315, + 506, + 331 + ], + "spans": [ + { + "bbox": [ + 104, + 315, + 166, + 331 + ], + "score": 1.0, + "content": "linearity of the", + "type": "text" + }, + { + "bbox": [ + 167, + 318, + 176, + 329 + ], + "score": 0.85, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 315, + 266, + 331 + ], + "score": 1.0, + "content": "-function. After all the", + "type": "text" + }, + { + "bbox": [ + 266, + 318, + 276, + 328 + ], + "score": 0.79, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 315, + 430, + 331 + ], + "score": 1.0, + "content": "levels, the value will be amplified by a", + "type": "text" + }, + { + "bbox": [ + 430, + 316, + 451, + 328 + ], + "score": 0.9, + "content": "\\hat { d } ^ { H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 315, + 506, + 331 + ], + "score": 1.0, + "content": "factor. Since", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 324, + 508, + 355 + ], + "spans": [ + { + "bbox": [ + 107, + 329, + 127, + 344 + ], + "score": 0.93, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 324, + 508, + 355 + ], + "score": 1.0, + "content": "is not in the support of the data distribution, the only way to estimate the value of the policy istimate the expected reward value in the last level. Our construction forces the estimation error", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 353, + 471, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 471, + 366 + ], + "score": 1.0, + "content": "of the last level to be amplified exponentially and thus implies an exponential lower bound.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10 + }, + { + "type": "title", + "bbox": [ + 108, + 381, + 499, + 408 + ], + "lines": [ + { + "bbox": [ + 104, + 378, + 500, + 397 + ], + "spans": [ + { + "bbox": [ + 104, + 378, + 500, + 397 + ], + "score": 1.0, + "content": "5 UPPER BOUNDS: LOW DISTRIBUTION SHIFT OR POLICY COMPLETENESS", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 124, + 396, + 212, + 410 + ], + "spans": [ + { + "bbox": [ + 124, + 396, + 212, + 410 + ], + "score": 1.0, + "content": "ARE SUFFICIENT", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 505, + 466 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "In order to illustrate the error amplification issue and discuss conditions that permit sample-efficient", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 433, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 505, + 444 + ], + "score": 1.0, + "content": "offline RL, in this section, we analyze Least-Squares Policy Evaluation when applied to the offline", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 443, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 505, + 456 + ], + "score": 1.0, + "content": "policy evaluation problem under the realizability assumption. The algorithm is presented in Algo-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 455, + 444, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 307, + 466 + ], + "score": 1.0, + "content": "rithm 1. For simplicity here we assume the policy", + "type": "text" + }, + { + "bbox": [ + 307, + 456, + 315, + 464 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 455, + 444, + 466 + ], + "score": 1.0, + "content": "to be evaluated is deterministic.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 477, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 104, + 476, + 507, + 493 + ], + "spans": [ + { + "bbox": [ + 104, + 476, + 191, + 493 + ], + "score": 1.0, + "content": "Notation. For each", + "type": "text" + }, + { + "bbox": [ + 192, + 478, + 225, + 490 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 476, + 255, + 493 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 255, + 477, + 393, + 491 + ], + "score": 0.91, + "content": "\\Lambda _ { h } = \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } \\left[ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } \\right]", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 476, + 507, + 493 + ], + "score": 1.0, + "content": "to be the feature covariance", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 103, + 489, + 503, + 507 + ], + "spans": [ + { + "bbox": [ + 103, + 489, + 164, + 507 + ], + "score": 1.0, + "content": "matrix at level", + "type": "text" + }, + { + "bbox": [ + 165, + 492, + 172, + 501 + ], + "score": 0.74, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 489, + 212, + 507 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 212, + 491, + 258, + 504 + ], + "score": 0.92, + "content": "h \\in [ H - 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 489, + 289, + 507 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 289, + 491, + 503, + 504 + ], + "score": 0.83, + "content": "\\overline { { \\Lambda } } _ { h + 1 } = \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } , \\overline { { s } } \\sim P ( \\cdot \\vert s , a ) } \\left[ \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) ^ { \\top } \\right]", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 502, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 424, + 515 + ], + "score": 1.0, + "content": "to be the feature covariance matrix of the one-step lookahead distribution at level", + "type": "text" + }, + { + "bbox": [ + 424, + 504, + 431, + 513 + ], + "score": 0.72, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 502, + 506, + 515 + ], + "score": 1.0, + "content": ". Moreover, define", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 512, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 106, + 513, + 239, + 525 + ], + "score": 0.92, + "content": "\\overline { { \\Lambda } } _ { 1 } = \\phi ( s _ { 1 } , \\pi ( s _ { 1 } ) ) \\phi ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 512, + 286, + 526 + ], + "score": 1.0, + "content": ". We define", + "type": "text" + }, + { + "bbox": [ + 286, + 514, + 300, + 524 + ], + "score": 0.9, + "content": "\\Phi _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 512, + 330, + 526 + ], + "score": 1.0, + "content": "to be a", + "type": "text" + }, + { + "bbox": [ + 330, + 514, + 358, + 524 + ], + "score": 0.92, + "content": "N \\times d", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 512, + 417, + 526 + ], + "score": 1.0, + "content": "matrix, whose", + "type": "text" + }, + { + "bbox": [ + 418, + 514, + 423, + 523 + ], + "score": 0.76, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 512, + 461, + 526 + ], + "score": 1.0, + "content": "-th row is", + "type": "text" + }, + { + "bbox": [ + 462, + 513, + 501, + 526 + ], + "score": 0.93, + "content": "\\phi ( s _ { h } ^ { i } , a _ { h } ^ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 512, + 505, + 526 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 524, + 506, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 150, + 539 + ], + "score": 1.0, + "content": "and define", + "type": "text" + }, + { + "bbox": [ + 150, + 525, + 174, + 538 + ], + "score": 0.91, + "content": "\\overline { { \\Phi } } _ { h + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 524, + 230, + 539 + ], + "score": 1.0, + "content": "to be another", + "type": "text" + }, + { + "bbox": [ + 230, + 526, + 258, + 536 + ], + "score": 0.89, + "content": "N \\times d", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 524, + 315, + 539 + ], + "score": 1.0, + "content": "matrix whose", + "type": "text" + }, + { + "bbox": [ + 315, + 527, + 320, + 536 + ], + "score": 0.75, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 524, + 359, + 539 + ], + "score": 1.0, + "content": "-th row is", + "type": "text" + }, + { + "bbox": [ + 360, + 525, + 411, + 538 + ], + "score": 0.93, + "content": "\\phi ( \\overline { { s } } _ { h } ^ { i } , \\pi ( \\overline { { s } } _ { h } ^ { i } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 524, + 453, + 539 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 453, + 526, + 487, + 538 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 524, + 506, + 539 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 537, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 138, + 550 + ], + "score": 0.91, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 537, + 168, + 552 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 169, + 537, + 292, + 551 + ], + "score": 0.92, + "content": "\\xi _ { h } ^ { i } = r _ { h } ^ { i } + V ( \\overline { { s } } _ { h } ^ { i } ) - Q ( s _ { h } ^ { i } , a _ { h } ^ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 537, + 328, + 552 + ], + "score": 1.0, + "content": ". We use", + "type": "text" + }, + { + "bbox": [ + 328, + 538, + 339, + 550 + ], + "score": 0.88, + "content": "\\xi _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 537, + 441, + 552 + ], + "score": 1.0, + "content": "to denote a vector whose", + "type": "text" + }, + { + "bbox": [ + 442, + 540, + 446, + 548 + ], + "score": 0.75, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 537, + 490, + 552 + ], + "score": 1.0, + "content": "-th entry is", + "type": "text" + }, + { + "bbox": [ + 491, + 537, + 501, + 550 + ], + "score": 0.9, + "content": "\\xi _ { h } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 537, + 505, + 552 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 504, + 578 + ], + "lines": [ + { + "bbox": [ + 106, + 555, + 504, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 504, + 568 + ], + "score": 1.0, + "content": "Now we present a general lemma that characterizes the estimation error of Algorithm 1 by an equal-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 566, + 491, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 491, + 579 + ], + "score": 1.0, + "content": "ity. The proof can be found in Appendix D. Later, we apply this general lemma to special cases.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 106, + 581, + 506, + 605 + ], + "lines": [ + { + "bbox": [ + 105, + 580, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 196, + 594 + ], + "score": 1.0, + "content": "Lemma 5.1. Suppose", + "type": "text" + }, + { + "bbox": [ + 197, + 581, + 222, + 591 + ], + "score": 0.89, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 580, + 276, + 594 + ], + "score": 1.0, + "content": "in Algorithm", + "type": "text" + }, + { + "bbox": [ + 276, + 582, + 281, + 591 + ], + "score": 0.54, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 580, + 381, + 594 + ], + "score": 1.0, + "content": ", and for the given policy", + "type": "text" + }, + { + "bbox": [ + 382, + 583, + 388, + 591 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 580, + 439, + 594 + ], + "score": 1.0, + "content": ", there exists", + "type": "text" + }, + { + "bbox": [ + 439, + 581, + 505, + 593 + ], + "score": 0.9, + "content": "\\theta _ { 1 } , \\theta _ { 2 } , \\ldots , \\theta _ { d } \\in", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 590, + 484, + 606 + ], + "spans": [ + { + "bbox": [ + 107, + 592, + 119, + 602 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 590, + 194, + 606 + ], + "score": 1.0, + "content": "such that for each", + "type": "text" + }, + { + "bbox": [ + 195, + 592, + 228, + 604 + ], + "score": 0.82, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 590, + 232, + 606 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 232, + 592, + 326, + 604 + ], + "score": 0.84, + "content": "Q _ { h } ^ { \\bar { \\pi } } ( s , a ) = \\phi ( s , \\bar { a } ) ^ { \\top } \\theta _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 590, + 355, + 606 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 356, + 592, + 422, + 604 + ], + "score": 0.92, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 590, + 484, + 606 + ], + "score": 1.0, + "content": ". Then we have", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 611, + 487, + 648 + ], + "lines": [ + { + "bbox": [ + 111, + 611, + 487, + 648 + ], + "spans": [ + { + "bbox": [ + 111, + 611, + 487, + 648 + ], + "score": 0.94, + "content": "( Q ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } = \\displaystyle \\left\\| \\sum _ { h = 1 } ^ { H } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\cdot \\cdot \\cdot ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } .", + "type": "interline_equation", + "image_path": "ae3c942c91242009b562629605d1f25f0be72411e576b0506d5890cac0fed046.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 111, + 611, + 487, + 623.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 111, + 623.3333333333334, + 487, + 635.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 111, + 635.6666666666667, + 487, + 648.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 659, + 504, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 658, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 672 + ], + "score": 1.0, + "content": "Now we consider two special cases where the estimation error in Equation (1) can be upper bounded.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 106, + 683, + 505, + 717 + ], + "lines": [ + { + "bbox": [ + 105, + 682, + 505, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 505, + 695 + ], + "score": 1.0, + "content": "Low Distribution Shift. The first special we focus on is the case where the distribution shift", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 695, + 505, + 707 + ], + "spans": [ + { + "bbox": [ + 106, + 695, + 505, + 707 + ], + "score": 1.0, + "content": "between the data distributions and the distribution induced by the policy to be evaluated is low. To", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 706, + 405, + 717 + ], + "spans": [ + { + "bbox": [ + 106, + 706, + 405, + 717 + ], + "score": 1.0, + "content": "measure the distribution shift formally, our main assumption is as follows.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 104, + 719, + 482, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 718, + 483, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 272, + 735 + ], + "score": 1.0, + "content": "Assumption 3. We assume that for each", + "type": "text" + }, + { + "bbox": [ + 272, + 721, + 305, + 732 + ], + "score": 0.91, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 718, + 356, + 735 + ], + "score": 1.0, + "content": ", there exists", + "type": "text" + }, + { + "bbox": [ + 357, + 720, + 388, + 732 + ], + "score": 0.91, + "content": "C _ { h } \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 718, + 428, + 735 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 428, + 720, + 478, + 732 + ], + "score": 0.91, + "content": "\\overline { { \\Lambda _ { h } } } \\preceq C _ { h } \\Lambda _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 718, + 483, + 735 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + } + ], + "page_idx": 7, + "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": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 110, + 95, + 474, + 191 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 108, + 82, + 292, + 94 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 80, + 294, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 294, + 96 + ], + "score": 1.0, + "content": "Algorithm 1 Least-Squares Policy Evaluation", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 110, + 95, + 474, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 95, + 474, + 191 + ], + "spans": [ + { + "bbox": [ + 110, + 95, + 474, + 191 + ], + "score": 0.73, + "html": "
1: Input: policy π to be evaluated, number of samples N, regularization parameter 入 > 0
2:Let QH+1(·,·)=O andVH+1(-)= 0
forh=H,H-1,...,1do
4:Take samples (s,a)~ μh,rh ~ r(s,a) and sh ~P(s,a) for eachi∈ [N]
5:LetAh=∑i∈[N](sn,an)(s,a)T+λI
6: 7:LetOn=An1(∑N(s,)·(nh+V+1(3))
Let Qn(-,) = (.,·)TOn and Vh(.)=Q(·,π())
", + "type": "table", + "image_path": "6378731aaaa463eab5936d0eeab7d595642cdf4d6342dba676774f51486277ec.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 110, + 95, + 474, + 127.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 127.0, + 474, + 159.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 110, + 159.0, + 474, + 191.0 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "text", + "bbox": [ + 105, + 211, + 505, + 282 + ], + "lines": [], + "index": 5.5, + "bbox_fs": [ + 104, + 208, + 507, + 284 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 285, + 506, + 366 + ], + "lines": [ + { + "bbox": [ + 104, + 284, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 104, + 284, + 340, + 304 + ], + "score": 1.0, + "content": "Remark 4. The key in our construction is the state sdˆ+h", + "type": "text" + }, + { + "bbox": [ + 346, + 284, + 506, + 301 + ], + "score": 1.0, + "content": "in each level, whose feature vector is", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 102, + 299, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 102, + 299, + 161, + 321 + ], + "score": 1.0, + "content": "defined to be", + "type": "text" + }, + { + "bbox": [ + 162, + 301, + 219, + 317 + ], + "score": 0.94, + "content": "\\textstyle \\sum _ { c \\in { \\hat { d } } } e _ { c } / { \\hat { d } } ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 299, + 281, + 321 + ], + "score": 1.0, + "content": ". In each level,", + "type": "text" + }, + { + "bbox": [ + 282, + 300, + 302, + 316 + ], + "score": 0.93, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 299, + 358, + 321 + ], + "score": 1.0, + "content": "amplifies the", + "type": "text" + }, + { + "bbox": [ + 358, + 303, + 367, + 315 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 299, + 414, + 321 + ], + "score": 1.0, + "content": "-value by a", + "type": "text" + }, + { + "bbox": [ + 414, + 301, + 433, + 314 + ], + "score": 0.9, + "content": "\\hat { d } ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 299, + 506, + 321 + ], + "score": 1.0, + "content": "factor, due to the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 315, + 506, + 331 + ], + "spans": [ + { + "bbox": [ + 104, + 315, + 166, + 331 + ], + "score": 1.0, + "content": "linearity of the", + "type": "text" + }, + { + "bbox": [ + 167, + 318, + 176, + 329 + ], + "score": 0.85, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 315, + 266, + 331 + ], + "score": 1.0, + "content": "-function. After all the", + "type": "text" + }, + { + "bbox": [ + 266, + 318, + 276, + 328 + ], + "score": 0.79, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 315, + 430, + 331 + ], + "score": 1.0, + "content": "levels, the value will be amplified by a", + "type": "text" + }, + { + "bbox": [ + 430, + 316, + 451, + 328 + ], + "score": 0.9, + "content": "\\hat { d } ^ { H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 315, + 506, + 331 + ], + "score": 1.0, + "content": "factor. Since", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 324, + 508, + 355 + ], + "spans": [ + { + "bbox": [ + 107, + 329, + 127, + 344 + ], + "score": 0.93, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 324, + 508, + 355 + ], + "score": 1.0, + "content": "is not in the support of the data distribution, the only way to estimate the value of the policy istimate the expected reward value in the last level. Our construction forces the estimation error", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 353, + 471, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 471, + 366 + ], + "score": 1.0, + "content": "of the last level to be amplified exponentially and thus implies an exponential lower bound.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10, + "bbox_fs": [ + 102, + 284, + 508, + 366 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 381, + 499, + 408 + ], + "lines": [ + { + "bbox": [ + 104, + 378, + 500, + 397 + ], + "spans": [ + { + "bbox": [ + 104, + 378, + 500, + 397 + ], + "score": 1.0, + "content": "5 UPPER BOUNDS: LOW DISTRIBUTION SHIFT OR POLICY COMPLETENESS", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 124, + 396, + 212, + 410 + ], + "spans": [ + { + "bbox": [ + 124, + 396, + 212, + 410 + ], + "score": 1.0, + "content": "ARE SUFFICIENT", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 505, + 466 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "In order to illustrate the error amplification issue and discuss conditions that permit sample-efficient", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 433, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 505, + 444 + ], + "score": 1.0, + "content": "offline RL, in this section, we analyze Least-Squares Policy Evaluation when applied to the offline", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 443, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 505, + 456 + ], + "score": 1.0, + "content": "policy evaluation problem under the realizability assumption. The algorithm is presented in Algo-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 455, + 444, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 307, + 466 + ], + "score": 1.0, + "content": "rithm 1. For simplicity here we assume the policy", + "type": "text" + }, + { + "bbox": [ + 307, + 456, + 315, + 464 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 455, + 444, + 466 + ], + "score": 1.0, + "content": "to be evaluated is deterministic.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 421, + 505, + 466 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 477, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 104, + 476, + 507, + 493 + ], + "spans": [ + { + "bbox": [ + 104, + 476, + 191, + 493 + ], + "score": 1.0, + "content": "Notation. For each", + "type": "text" + }, + { + "bbox": [ + 192, + 478, + 225, + 490 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 476, + 255, + 493 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 255, + 477, + 393, + 491 + ], + "score": 0.91, + "content": "\\Lambda _ { h } = \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } \\left[ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } \\right]", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 476, + 507, + 493 + ], + "score": 1.0, + "content": "to be the feature covariance", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 103, + 489, + 503, + 507 + ], + "spans": [ + { + "bbox": [ + 103, + 489, + 164, + 507 + ], + "score": 1.0, + "content": "matrix at level", + "type": "text" + }, + { + "bbox": [ + 165, + 492, + 172, + 501 + ], + "score": 0.74, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 489, + 212, + 507 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 212, + 491, + 258, + 504 + ], + "score": 0.92, + "content": "h \\in [ H - 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 489, + 289, + 507 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 289, + 491, + 503, + 504 + ], + "score": 0.83, + "content": "\\overline { { \\Lambda } } _ { h + 1 } = \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } , \\overline { { s } } \\sim P ( \\cdot \\vert s , a ) } \\left[ \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) ^ { \\top } \\right]", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 502, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 424, + 515 + ], + "score": 1.0, + "content": "to be the feature covariance matrix of the one-step lookahead distribution at level", + "type": "text" + }, + { + "bbox": [ + 424, + 504, + 431, + 513 + ], + "score": 0.72, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 502, + 506, + 515 + ], + "score": 1.0, + "content": ". Moreover, define", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 512, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 106, + 513, + 239, + 525 + ], + "score": 0.92, + "content": "\\overline { { \\Lambda } } _ { 1 } = \\phi ( s _ { 1 } , \\pi ( s _ { 1 } ) ) \\phi ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 512, + 286, + 526 + ], + "score": 1.0, + "content": ". We define", + "type": "text" + }, + { + "bbox": [ + 286, + 514, + 300, + 524 + ], + "score": 0.9, + "content": "\\Phi _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 512, + 330, + 526 + ], + "score": 1.0, + "content": "to be a", + "type": "text" + }, + { + "bbox": [ + 330, + 514, + 358, + 524 + ], + "score": 0.92, + "content": "N \\times d", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 512, + 417, + 526 + ], + "score": 1.0, + "content": "matrix, whose", + "type": "text" + }, + { + "bbox": [ + 418, + 514, + 423, + 523 + ], + "score": 0.76, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 512, + 461, + 526 + ], + "score": 1.0, + "content": "-th row is", + "type": "text" + }, + { + "bbox": [ + 462, + 513, + 501, + 526 + ], + "score": 0.93, + "content": "\\phi ( s _ { h } ^ { i } , a _ { h } ^ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 512, + 505, + 526 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 524, + 506, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 150, + 539 + ], + "score": 1.0, + "content": "and define", + "type": "text" + }, + { + "bbox": [ + 150, + 525, + 174, + 538 + ], + "score": 0.91, + "content": "\\overline { { \\Phi } } _ { h + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 524, + 230, + 539 + ], + "score": 1.0, + "content": "to be another", + "type": "text" + }, + { + "bbox": [ + 230, + 526, + 258, + 536 + ], + "score": 0.89, + "content": "N \\times d", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 524, + 315, + 539 + ], + "score": 1.0, + "content": "matrix whose", + "type": "text" + }, + { + "bbox": [ + 315, + 527, + 320, + 536 + ], + "score": 0.75, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 524, + 359, + 539 + ], + "score": 1.0, + "content": "-th row is", + "type": "text" + }, + { + "bbox": [ + 360, + 525, + 411, + 538 + ], + "score": 0.93, + "content": "\\phi ( \\overline { { s } } _ { h } ^ { i } , \\pi ( \\overline { { s } } _ { h } ^ { i } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 524, + 453, + 539 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 453, + 526, + 487, + 538 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 524, + 506, + 539 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 537, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 138, + 550 + ], + "score": 0.91, + "content": "i \\in [ N ]", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 537, + 168, + 552 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 169, + 537, + 292, + 551 + ], + "score": 0.92, + "content": "\\xi _ { h } ^ { i } = r _ { h } ^ { i } + V ( \\overline { { s } } _ { h } ^ { i } ) - Q ( s _ { h } ^ { i } , a _ { h } ^ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 537, + 328, + 552 + ], + "score": 1.0, + "content": ". We use", + "type": "text" + }, + { + "bbox": [ + 328, + 538, + 339, + 550 + ], + "score": 0.88, + "content": "\\xi _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 537, + 441, + 552 + ], + "score": 1.0, + "content": "to denote a vector whose", + "type": "text" + }, + { + "bbox": [ + 442, + 540, + 446, + 548 + ], + "score": 0.75, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 537, + 490, + 552 + ], + "score": 1.0, + "content": "-th entry is", + "type": "text" + }, + { + "bbox": [ + 491, + 537, + 501, + 550 + ], + "score": 0.9, + "content": "\\xi _ { h } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 537, + 505, + 552 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.5, + "bbox_fs": [ + 103, + 476, + 507, + 552 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 504, + 578 + ], + "lines": [ + { + "bbox": [ + 106, + 555, + 504, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 504, + 568 + ], + "score": 1.0, + "content": "Now we present a general lemma that characterizes the estimation error of Algorithm 1 by an equal-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 566, + 491, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 491, + 579 + ], + "score": 1.0, + "content": "ity. The proof can be found in Appendix D. Later, we apply this general lemma to special cases.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 106, + 555, + 504, + 579 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 581, + 506, + 605 + ], + "lines": [ + { + "bbox": [ + 105, + 580, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 196, + 594 + ], + "score": 1.0, + "content": "Lemma 5.1. Suppose", + "type": "text" + }, + { + "bbox": [ + 197, + 581, + 222, + 591 + ], + "score": 0.89, + "content": "\\lambda > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 580, + 276, + 594 + ], + "score": 1.0, + "content": "in Algorithm", + "type": "text" + }, + { + "bbox": [ + 276, + 582, + 281, + 591 + ], + "score": 0.54, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 580, + 381, + 594 + ], + "score": 1.0, + "content": ", and for the given policy", + "type": "text" + }, + { + "bbox": [ + 382, + 583, + 388, + 591 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 580, + 439, + 594 + ], + "score": 1.0, + "content": ", there exists", + "type": "text" + }, + { + "bbox": [ + 439, + 581, + 505, + 593 + ], + "score": 0.9, + "content": "\\theta _ { 1 } , \\theta _ { 2 } , \\ldots , \\theta _ { d } \\in", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 590, + 484, + 606 + ], + "spans": [ + { + "bbox": [ + 107, + 592, + 119, + 602 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 590, + 194, + 606 + ], + "score": 1.0, + "content": "such that for each", + "type": "text" + }, + { + "bbox": [ + 195, + 592, + 228, + 604 + ], + "score": 0.82, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 590, + 232, + 606 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 232, + 592, + 326, + 604 + ], + "score": 0.84, + "content": "Q _ { h } ^ { \\bar { \\pi } } ( s , a ) = \\phi ( s , \\bar { a } ) ^ { \\top } \\theta _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 590, + 355, + 606 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 356, + 592, + 422, + 604 + ], + "score": 0.92, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 590, + 484, + 606 + ], + "score": 1.0, + "content": ". Then we have", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 580, + 505, + 606 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 611, + 487, + 648 + ], + "lines": [ + { + "bbox": [ + 111, + 611, + 487, + 648 + ], + "spans": [ + { + "bbox": [ + 111, + 611, + 487, + 648 + ], + "score": 0.94, + "content": "( Q ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } = \\displaystyle \\left\\| \\sum _ { h = 1 } ^ { H } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\cdot \\cdot \\cdot ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } .", + "type": "interline_equation", + "image_path": "ae3c942c91242009b562629605d1f25f0be72411e576b0506d5890cac0fed046.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 111, + 611, + 487, + 623.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 111, + 623.3333333333334, + 487, + 635.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 111, + 635.6666666666667, + 487, + 648.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 659, + 504, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 658, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 672 + ], + "score": 1.0, + "content": "Now we consider two special cases where the estimation error in Equation (1) can be upper bounded.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32, + "bbox_fs": [ + 106, + 658, + 505, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 683, + 505, + 717 + ], + "lines": [ + { + "bbox": [ + 105, + 682, + 505, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 505, + 695 + ], + "score": 1.0, + "content": "Low Distribution Shift. The first special we focus on is the case where the distribution shift", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 695, + 505, + 707 + ], + "spans": [ + { + "bbox": [ + 106, + 695, + 505, + 707 + ], + "score": 1.0, + "content": "between the data distributions and the distribution induced by the policy to be evaluated is low. To", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 706, + 405, + 717 + ], + "spans": [ + { + "bbox": [ + 106, + 706, + 405, + 717 + ], + "score": 1.0, + "content": "measure the distribution shift formally, our main assumption is as follows.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 682, + 505, + 717 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 719, + 482, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 718, + 483, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 718, + 272, + 735 + ], + "score": 1.0, + "content": "Assumption 3. We assume that for each", + "type": "text" + }, + { + "bbox": [ + 272, + 721, + 305, + 732 + ], + "score": 0.91, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 718, + 356, + 735 + ], + "score": 1.0, + "content": ", there exists", + "type": "text" + }, + { + "bbox": [ + 357, + 720, + 388, + 732 + ], + "score": 0.91, + "content": "C _ { h } \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 718, + 428, + 735 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 428, + 720, + 478, + 732 + ], + "score": 0.91, + "content": "\\overline { { \\Lambda _ { h } } } \\preceq C _ { h } \\Lambda _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 718, + 483, + 735 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 718, + 483, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 81, + 505, + 117 + ], + "lines": [ + { + "bbox": [ + 102, + 77, + 501, + 107 + ], + "spans": [ + { + "bbox": [ + 102, + 77, + 194, + 107 + ], + "score": 1.0, + "content": "Remark 5. For each Therefore, Assumptio", + "type": "text" + }, + { + "bbox": [ + 195, + 82, + 230, + 95 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 77, + 243, + 107 + ], + "score": 1.0, + "content": ", if be r", + "type": "text" + }, + { + "bbox": [ + 243, + 81, + 316, + 97 + ], + "score": 0.93, + "content": "\\sigma _ { \\mathrm { m i n } } ( \\Lambda _ { h } ) \\succeq \\frac { 1 } { C _ { h } } I", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 77, + 356, + 107 + ], + "score": 1.0, + "content": "for some ssumption", + "type": "text" + }, + { + "bbox": [ + 356, + 83, + 389, + 94 + ], + "score": 0.91, + "content": "C _ { h } \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 77, + 429, + 107 + ], + "score": 1.0, + "content": "e .", + "type": "text" + }, + { + "bbox": [ + 429, + 81, + 501, + 94 + ], + "score": 0.91, + "content": "\\overline { { { \\Lambda } } } _ { h } \\preceq I \\preceq C _ { h } \\Lambda _ { h }", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 378, + 95, + 423, + 106 + ], + "spans": [ + { + "bbox": [ + 378, + 95, + 423, + 106 + ], + "score": 0.91, + "content": "C _ { h } \\Lambda _ { h } \\succeq I", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "score": 1.0, + "content": "to the original version of Assumption 3 as it gives a tighter characterization of the distribution shift.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 105, + 126, + 487, + 138 + ], + "lines": [ + { + "bbox": [ + 105, + 124, + 488, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 124, + 488, + 140 + ], + "score": 1.0, + "content": "Now we state the theoretical guarantee of Algorithm 1. The proof can be found in Appendix D.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 140, + 505, + 192 + ], + "lines": [ + { + "bbox": [ + 105, + 138, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 295, + 153 + ], + "score": 1.0, + "content": "Theorem 5.2. Suppose for the given policy", + "type": "text" + }, + { + "bbox": [ + 295, + 142, + 302, + 150 + ], + "score": 0.68, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 138, + 359, + 153 + ], + "score": 1.0, + "content": ", there exists", + "type": "text" + }, + { + "bbox": [ + 359, + 139, + 446, + 152 + ], + "score": 0.92, + "content": "\\theta _ { 1 } , \\theta _ { 2 } , \\ldots , \\theta _ { d } \\ \\in \\ \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 138, + 506, + 153 + ], + "score": 1.0, + "content": "such that for√", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 151, + 506, + 166 + ], + "spans": [ + { + "bbox": [ + 104, + 151, + 129, + 166 + ], + "score": 1.0, + "content": "each", + "type": "text" + }, + { + "bbox": [ + 130, + 152, + 276, + 165 + ], + "score": 0.84, + "content": "h \\in [ H ] , Q _ { h } ^ { \\pi } ( s , a ) \\ : = \\ : \\phi ( s , a ) ^ { \\top } \\theta _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 151, + 310, + 166 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 311, + 152, + 386, + 165 + ], + "score": 0.91, + "content": "( s , a ) \\ \\in \\ S _ { h } \\times { \\mathcal A }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 151, + 408, + 166 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 409, + 151, + 479, + 165 + ], + "score": 0.89, + "content": "\\| \\theta _ { h } \\| _ { 2 } ~ \\le ~ H \\sqrt { d } .", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 151, + 506, + 166 + ], + "score": 1.0, + "content": "4 Let", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 164, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 107, + 164, + 218, + 178 + ], + "score": 0.9, + "content": "\\lambda = C H \\sqrt { d \\log ( d H / \\delta ) N }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 164, + 260, + 178 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 260, + 166, + 291, + 176 + ], + "score": 0.89, + "content": "C > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 164, + 403, + 178 + ], + "score": 1.0, + "content": ". With probability at least", + "type": "text" + }, + { + "bbox": [ + 403, + 166, + 428, + 176 + ], + "score": 0.81, + "content": "1 - \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 164, + 473, + 178 + ], + "score": 1.0, + "content": ", for some", + "type": "text" + }, + { + "bbox": [ + 473, + 166, + 501, + 176 + ], + "score": 0.86, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 164, + 505, + 178 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 177, + 422, + 194 + ], + "spans": [ + { + "bbox": [ + 107, + 177, + 417, + 192 + ], + "score": 0.8, + "content": "\\begin{array} { r } { ( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } \\leq c \\cdot \\prod _ { h = 1 } ^ { H } C _ { h } \\cdot d H ^ { 5 } \\cdot \\sqrt { d \\log ( d H / \\delta ) / N } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 177, + 422, + 194 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 195, + 506, + 312 + ], + "lines": [ + { + "bbox": [ + 104, + 194, + 507, + 212 + ], + "spans": [ + { + "bbox": [ + 104, + 194, + 200, + 212 + ], + "score": 1.0, + "content": "Remark 6. The factor", + "type": "text" + }, + { + "bbox": [ + 200, + 194, + 240, + 209 + ], + "score": 0.92, + "content": "\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 194, + 507, + 212 + ], + "score": 1.0, + "content": "in Theorem 5.2 implies that the estimation error will be amplified", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 208, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 506, + 219 + ], + "score": 1.0, + "content": "geometrically. Now we discuss how the error is amplified when running Algorithm 1 on the instance", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 219, + 506, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 231 + ], + "score": 1.0, + "content": "in Section 4 to better illustrate the issue. If we run Algorithm 1 on the hard instance in Section 4,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 229, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 229, + 130, + 245 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 130, + 231, + 160, + 241 + ], + "score": 0.9, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 229, + 255, + 245 + ], + "score": 1.0, + "content": ", the estimation error on", + "type": "text" + }, + { + "bbox": [ + 255, + 231, + 284, + 244 + ], + "score": 0.93, + "content": "V ( s _ { H } ^ { c } )", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 229, + 357, + 245 + ], + "score": 1.0, + "content": "would be roughly", + "type": "text" + }, + { + "bbox": [ + 358, + 230, + 387, + 241 + ], + "score": 0.91, + "content": "N ^ { - 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 229, + 422, + 245 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 422, + 230, + 450, + 243 + ], + "score": 0.92, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 229, + 506, + 245 + ], + "score": 1.0, + "content": ". When using", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 243, + 506, + 258 + ], + "spans": [ + { + "bbox": [ + 104, + 243, + 216, + 258 + ], + "score": 1.0, + "content": "the linear predictor at level", + "type": "text" + }, + { + "bbox": [ + 217, + 245, + 227, + 254 + ], + "score": 0.81, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 243, + 318, + 258 + ], + "score": 1.0, + "content": "to predict the value of", + "type": "text" + }, + { + "bbox": [ + 318, + 245, + 331, + 257 + ], + "score": 0.89, + "content": "s _ { H } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 243, + 455, + 258 + ], + "score": 1.0, + "content": ", the error will be amplified by", + "type": "text" + }, + { + "bbox": [ + 455, + 243, + 474, + 255 + ], + "score": 0.88, + "content": "\\hat { d } ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 243, + 506, + 258 + ], + "score": 1.0, + "content": ". When", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 254, + 504, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 150, + 268 + ], + "score": 0.91, + "content": "h = H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 254, + 253, + 273 + ], + "score": 1.0, + "content": ", the dataset contains only", + "type": "text" + }, + { + "bbox": [ + 254, + 258, + 277, + 271 + ], + "score": 0.92, + "content": "s _ { H - 1 } ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 254, + 291, + 273 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 292, + 256, + 320, + 270 + ], + "score": 0.92, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 254, + 480, + 273 + ], + "score": 1.0, + "content": ", and the estimation error on the value of", + "type": "text" + }, + { + "bbox": [ + 480, + 258, + 504, + 271 + ], + "score": 0.92, + "content": "s _ { H - 1 } ^ { c }", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 270, + 506, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 213, + 286 + ], + "score": 1.0, + "content": "will be the same as that of", + "type": "text" + }, + { + "bbox": [ + 213, + 272, + 226, + 284 + ], + "score": 0.89, + "content": "s _ { H } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 270, + 300, + 286 + ], + "score": 1.0, + "content": ", which is roughly", + "type": "text" + }, + { + "bbox": [ + 300, + 270, + 339, + 284 + ], + "score": 0.93, + "content": "( \\hat { d } / N ) ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 270, + 506, + 286 + ], + "score": 1.0, + "content": ". Again, the estimation error on the value", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 282, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 104, + 282, + 117, + 299 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 285, + 141, + 298 + ], + "score": 0.92, + "content": "s _ { H - 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 282, + 172, + 299 + ], + "score": 1.0, + "content": "will be", + "type": "text" + }, + { + "bbox": [ + 172, + 284, + 216, + 297 + ], + "score": 0.93, + "content": "( \\hat { d } ^ { 2 } / N ) ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 282, + 373, + 299 + ], + "score": 1.0, + "content": "when using the linear predictor at level", + "type": "text" + }, + { + "bbox": [ + 374, + 285, + 400, + 296 + ], + "score": 0.84, + "content": "H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 282, + 506, + 299 + ], + "score": 1.0, + "content": ". The error will eventually", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 296, + 477, + 315 + ], + "spans": [ + { + "bbox": [ + 104, + 296, + 214, + 315 + ], + "score": 1.0, + "content": "be amplified by a factor of", + "type": "text" + }, + { + "bbox": [ + 214, + 298, + 235, + 309 + ], + "score": 0.89, + "content": "\\hat { d } ^ { H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 296, + 367, + 315 + ], + "score": 1.0, + "content": ", which corresponds to the factor", + "type": "text" + }, + { + "bbox": [ + 368, + 297, + 407, + 312 + ], + "score": 0.93, + "content": "\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 296, + 477, + 315 + ], + "score": 1.0, + "content": "in Theorem 5.2.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 322, + 505, + 357 + ], + "lines": [ + { + "bbox": [ + 105, + 322, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 505, + 336 + ], + "score": 1.0, + "content": "Policy Completeness. In offline RL, another representation condition is closedness under Bellman", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "score": 1.0, + "content": "update (Szepesvari & Munos, 2005; Duan & Wang, 2020), which is stronger than realizability. In ´", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 345, + 489, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 489, + 358 + ], + "score": 1.0, + "content": "the context of offline policy evaluation, we have the following policy completeness assumption.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 105, + 358, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 105, + 357, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 255, + 371 + ], + "score": 1.0, + "content": "Assumption 4. For the given policy", + "type": "text" + }, + { + "bbox": [ + 255, + 361, + 262, + 369 + ], + "score": 0.69, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 357, + 298, + 371 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 298, + 359, + 324, + 370 + ], + "score": 0.88, + "content": "h > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 357, + 343, + 371 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 344, + 358, + 379, + 370 + ], + "score": 0.91, + "content": "\\theta _ { h } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 357, + 431, + 371 + ], + "score": 1.0, + "content": ", there exists", + "type": "text" + }, + { + "bbox": [ + 431, + 358, + 465, + 369 + ], + "score": 0.9, + "content": "\\theta ^ { \\prime } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 357, + 506, + 371 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 103, + 368, + 477, + 384 + ], + "spans": [ + { + "bbox": [ + 103, + 368, + 137, + 384 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 138, + 370, + 473, + 384 + ], + "score": 0.84, + "content": "\\begin{array} { r } { ( s , a ) \\in \\mathcal S _ { h - 1 } \\times \\mathcal A , \\mathbb E [ R ( s , a ) ] + \\sum _ { s ^ { \\prime } \\in { \\cal S } _ { h } } P ( s ^ { \\prime } \\mid s , a ) \\phi ( s ^ { \\prime } , \\pi ( s ^ { \\prime } ) ) ^ { \\top } \\theta _ { h } = \\phi ( s , a ) ^ { \\top } \\theta ^ { \\prime } . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 368, + 477, + 384 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 391, + 506, + 428 + ], + "lines": [ + { + "bbox": [ + 106, + 391, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 391, + 294, + 405 + ], + "score": 1.0, + "content": "Under Assumption 4 and the assumption that", + "type": "text" + }, + { + "bbox": [ + 294, + 392, + 361, + 403 + ], + "score": 0.92, + "content": "\\sigma _ { \\operatorname* { m i n } } ( \\Lambda _ { h } ) \\geq \\lambda _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 391, + 391, + 405 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 391, + 392, + 428, + 403 + ], + "score": 0.91, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 391, + 468, + 405 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 469, + 392, + 501, + 402 + ], + "score": 0.89, + "content": "\\lambda _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 391, + 506, + 405 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 402, + 373, + 415 + ], + "score": 1.0, + "content": "Duan & Wang (2020) have shown that for Algorithm 1, by taking", + "type": "text" + }, + { + "bbox": [ + 373, + 403, + 486, + 415 + ], + "score": 0.89, + "content": "N = \\mathrm { p o l } \\bar { \\mathrm { y } } ( \\bar { H } , d , 1 / \\varepsilon , 1 / \\lambda _ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 402, + 505, + 415 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 414, + 503, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 128, + 428 + ], + "score": 1.0, + "content": "have", + "type": "text" + }, + { + "bbox": [ + 128, + 414, + 285, + 428 + ], + "score": 0.92, + "content": "( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } \\leq \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 414, + 503, + 428 + ], + "score": 1.0, + "content": ". We refer interested readers to (Duan & Wang, 2020).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 432, + 505, + 468 + ], + "lines": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "We remark that the above analysis again implies that geometric error amplification is a real issue in", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 443, + 504, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 504, + 456 + ], + "score": 1.0, + "content": "offline RL, and sample-efficient offline RL is impossible unless the distribution shift is sufficiently", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 455, + 503, + 471 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 142, + 471 + ], + "score": 1.0, + "content": "low, i.e.,", + "type": "text" + }, + { + "bbox": [ + 142, + 455, + 182, + 469 + ], + "score": 0.93, + "content": "\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 455, + 503, + 471 + ], + "score": 1.0, + "content": "is bounded, or strong representation condition (e.g. policy completeness) holds.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "title", + "bbox": [ + 107, + 483, + 195, + 496 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 198, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 198, + 499 + ], + "score": 1.0, + "content": "6 CONCLUSION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 508, + 505, + 607 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 505, + 520 + ], + "score": 1.0, + "content": "While the extant body of provable results in the literature largely focus on sufficient conditions for", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 517, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 506, + 533 + ], + "score": 1.0, + "content": "sample-efficient offline RL, this work focuses on obtaining a better understanding of the necessary", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 531, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 505, + 542 + ], + "score": 1.0, + "content": "conditions, where we seek to understand to what extent mild assumptions can imply sample-efficient", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "score": 1.0, + "content": "offline RL. This work shows that for off-policy evaluation, even if we are given a representation that", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 552, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 565 + ], + "score": 1.0, + "content": "can perfectly represent the value function of the given policy and the data distribution has good", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 563, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 506, + 576 + ], + "score": 1.0, + "content": "coverage over the features, any provable algorithm still requires an exponential number of samples", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 575, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 505, + 587 + ], + "score": 1.0, + "content": "to non-trivially approximate the value of the given policy. These results highlight that provable", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 584, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 506, + 598 + ], + "score": 1.0, + "content": "sample-efficient offline RL is simply not possible unless either the distribution shift condition is", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 595, + 492, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 492, + 610 + ], + "score": 1.0, + "content": "sufficiently mild or we have stronger representation conditions that go well beyond realizability.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33 + }, + { + "type": "title", + "bbox": [ + 108, + 624, + 218, + 636 + ], + "lines": [ + { + "bbox": [ + 106, + 623, + 220, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 220, + 639 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 646, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 661 + ], + "score": 1.0, + "content": "The authors would like to thank Akshay Krishnamurthy, Alekh Agarwal, Wen Sun, and Nan Jiang", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 658, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 505, + 672 + ], + "score": 1.0, + "content": "for numerous helpful discussion. Sham M. Kakade gratefully acknowledges funding from the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 667, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 506, + 685 + ], + "score": 1.0, + "content": "ONR award N00014-18-1-2247, and NSF Awards CCF-1703574 and CCF-1740551. Ruosong", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 680, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 506, + 694 + ], + "score": 1.0, + "content": "Wang was supported in part by the NSF IIS1763562, US Army W911NF1920104, and ONR Grant", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 691, + 499, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 499, + 705 + ], + "score": 1.0, + "content": "N000141812861. Research performed while Ruosong Wang was an intern at Microsoft Research.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41 + } + ], + "page_idx": 8, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 711, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 117, + 708, + 505, + 725 + ], + "spans": [ + { + "bbox": [ + 117, + 708, + 381, + 725 + ], + "score": 1.0, + "content": "4Without loss of generality, we can work in a coordinate system such that", + "type": "text" + }, + { + "bbox": [ + 381, + 710, + 438, + 722 + ], + "score": 0.92, + "content": "\\lVert \\theta _ { h } \\rVert _ { 2 } \\leq H \\sqrt { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 708, + 453, + 725 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 454, + 711, + 505, + 722 + ], + "score": 0.9, + "content": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq", + "type": "inline_equation" + } + ] + }, + { + "bbox": [ + 105, + 720, + 485, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 137, + 732 + ], + "score": 1.0, + "content": "1 for all", + "type": "text" + }, + { + "bbox": [ + 138, + 721, + 195, + 732 + ], + "score": 0.92, + "content": "( s , a ) \\in \\mathcal { S } \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 720, + 485, + 732 + ], + "score": 1.0, + "content": ". This follows due to John’s theorem (e.g. see (Ball, 1997; Bubeck et al., 2012)).", + "type": "text" + } + ] + } + ] + }, + { + "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, + 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, + 81, + 505, + 117 + ], + "lines": [ + { + "bbox": [ + 102, + 77, + 501, + 107 + ], + "spans": [ + { + "bbox": [ + 102, + 77, + 194, + 107 + ], + "score": 1.0, + "content": "Remark 5. For each Therefore, Assumptio", + "type": "text" + }, + { + "bbox": [ + 195, + 82, + 230, + 95 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 77, + 243, + 107 + ], + "score": 1.0, + "content": ", if be r", + "type": "text" + }, + { + "bbox": [ + 243, + 81, + 316, + 97 + ], + "score": 0.93, + "content": "\\sigma _ { \\mathrm { m i n } } ( \\Lambda _ { h } ) \\succeq \\frac { 1 } { C _ { h } } I", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 77, + 356, + 107 + ], + "score": 1.0, + "content": "for some ssumption", + "type": "text" + }, + { + "bbox": [ + 356, + 83, + 389, + 94 + ], + "score": 0.91, + "content": "C _ { h } \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 77, + 429, + 107 + ], + "score": 1.0, + "content": "e .", + "type": "text" + }, + { + "bbox": [ + 429, + 81, + 501, + 94 + ], + "score": 0.91, + "content": "\\overline { { { \\Lambda } } } _ { h } \\preceq I \\preceq C _ { h } \\Lambda _ { h }", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 378, + 95, + 423, + 106 + ], + "spans": [ + { + "bbox": [ + 378, + 95, + 423, + 106 + ], + "score": 0.91, + "content": "C _ { h } \\Lambda _ { h } \\succeq I", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 118 + ], + "score": 1.0, + "content": "to the original version of Assumption 3 as it gives a tighter characterization of the distribution shift.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 102, + 77, + 505, + 118 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 126, + 487, + 138 + ], + "lines": [ + { + "bbox": [ + 105, + 124, + 488, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 124, + 488, + 140 + ], + "score": 1.0, + "content": "Now we state the theoretical guarantee of Algorithm 1. The proof can be found in Appendix D.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 124, + 488, + 140 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 140, + 505, + 192 + ], + "lines": [ + { + "bbox": [ + 105, + 138, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 295, + 153 + ], + "score": 1.0, + "content": "Theorem 5.2. Suppose for the given policy", + "type": "text" + }, + { + "bbox": [ + 295, + 142, + 302, + 150 + ], + "score": 0.68, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 138, + 359, + 153 + ], + "score": 1.0, + "content": ", there exists", + "type": "text" + }, + { + "bbox": [ + 359, + 139, + 446, + 152 + ], + "score": 0.92, + "content": "\\theta _ { 1 } , \\theta _ { 2 } , \\ldots , \\theta _ { d } \\ \\in \\ \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 138, + 506, + 153 + ], + "score": 1.0, + "content": "such that for√", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 151, + 506, + 166 + ], + "spans": [ + { + "bbox": [ + 104, + 151, + 129, + 166 + ], + "score": 1.0, + "content": "each", + "type": "text" + }, + { + "bbox": [ + 130, + 152, + 276, + 165 + ], + "score": 0.84, + "content": "h \\in [ H ] , Q _ { h } ^ { \\pi } ( s , a ) \\ : = \\ : \\phi ( s , a ) ^ { \\top } \\theta _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 151, + 310, + 166 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 311, + 152, + 386, + 165 + ], + "score": 0.91, + "content": "( s , a ) \\ \\in \\ S _ { h } \\times { \\mathcal A }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 151, + 408, + 166 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 409, + 151, + 479, + 165 + ], + "score": 0.89, + "content": "\\| \\theta _ { h } \\| _ { 2 } ~ \\le ~ H \\sqrt { d } .", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 151, + 506, + 166 + ], + "score": 1.0, + "content": "4 Let", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 164, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 107, + 164, + 218, + 178 + ], + "score": 0.9, + "content": "\\lambda = C H \\sqrt { d \\log ( d H / \\delta ) N }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 164, + 260, + 178 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 260, + 166, + 291, + 176 + ], + "score": 0.89, + "content": "C > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 164, + 403, + 178 + ], + "score": 1.0, + "content": ". With probability at least", + "type": "text" + }, + { + "bbox": [ + 403, + 166, + 428, + 176 + ], + "score": 0.81, + "content": "1 - \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 164, + 473, + 178 + ], + "score": 1.0, + "content": ", for some", + "type": "text" + }, + { + "bbox": [ + 473, + 166, + 501, + 176 + ], + "score": 0.86, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 164, + 505, + 178 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 177, + 422, + 194 + ], + "spans": [ + { + "bbox": [ + 107, + 177, + 417, + 192 + ], + "score": 0.8, + "content": "\\begin{array} { r } { ( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } \\leq c \\cdot \\prod _ { h = 1 } ^ { H } C _ { h } \\cdot d H ^ { 5 } \\cdot \\sqrt { d \\log ( d H / \\delta ) / N } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 177, + 422, + 194 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5, + "bbox_fs": [ + 104, + 138, + 506, + 194 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 195, + 506, + 312 + ], + "lines": [ + { + "bbox": [ + 104, + 194, + 507, + 212 + ], + "spans": [ + { + "bbox": [ + 104, + 194, + 200, + 212 + ], + "score": 1.0, + "content": "Remark 6. The factor", + "type": "text" + }, + { + "bbox": [ + 200, + 194, + 240, + 209 + ], + "score": 0.92, + "content": "\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 194, + 507, + 212 + ], + "score": 1.0, + "content": "in Theorem 5.2 implies that the estimation error will be amplified", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 208, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 506, + 219 + ], + "score": 1.0, + "content": "geometrically. Now we discuss how the error is amplified when running Algorithm 1 on the instance", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 219, + 506, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 231 + ], + "score": 1.0, + "content": "in Section 4 to better illustrate the issue. If we run Algorithm 1 on the hard instance in Section 4,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 229, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 229, + 130, + 245 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 130, + 231, + 160, + 241 + ], + "score": 0.9, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 229, + 255, + 245 + ], + "score": 1.0, + "content": ", the estimation error on", + "type": "text" + }, + { + "bbox": [ + 255, + 231, + 284, + 244 + ], + "score": 0.93, + "content": "V ( s _ { H } ^ { c } )", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 229, + 357, + 245 + ], + "score": 1.0, + "content": "would be roughly", + "type": "text" + }, + { + "bbox": [ + 358, + 230, + 387, + 241 + ], + "score": 0.91, + "content": "N ^ { - 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 229, + 422, + 245 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 422, + 230, + 450, + 243 + ], + "score": 0.92, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 229, + 506, + 245 + ], + "score": 1.0, + "content": ". When using", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 243, + 506, + 258 + ], + "spans": [ + { + "bbox": [ + 104, + 243, + 216, + 258 + ], + "score": 1.0, + "content": "the linear predictor at level", + "type": "text" + }, + { + "bbox": [ + 217, + 245, + 227, + 254 + ], + "score": 0.81, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 243, + 318, + 258 + ], + "score": 1.0, + "content": "to predict the value of", + "type": "text" + }, + { + "bbox": [ + 318, + 245, + 331, + 257 + ], + "score": 0.89, + "content": "s _ { H } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 243, + 455, + 258 + ], + "score": 1.0, + "content": ", the error will be amplified by", + "type": "text" + }, + { + "bbox": [ + 455, + 243, + 474, + 255 + ], + "score": 0.88, + "content": "\\hat { d } ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 243, + 506, + 258 + ], + "score": 1.0, + "content": ". When", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 254, + 504, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 150, + 268 + ], + "score": 0.91, + "content": "h = H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 254, + 253, + 273 + ], + "score": 1.0, + "content": ", the dataset contains only", + "type": "text" + }, + { + "bbox": [ + 254, + 258, + 277, + 271 + ], + "score": 0.92, + "content": "s _ { H - 1 } ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 254, + 291, + 273 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 292, + 256, + 320, + 270 + ], + "score": 0.92, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 254, + 480, + 273 + ], + "score": 1.0, + "content": ", and the estimation error on the value of", + "type": "text" + }, + { + "bbox": [ + 480, + 258, + 504, + 271 + ], + "score": 0.92, + "content": "s _ { H - 1 } ^ { c }", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 270, + 506, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 213, + 286 + ], + "score": 1.0, + "content": "will be the same as that of", + "type": "text" + }, + { + "bbox": [ + 213, + 272, + 226, + 284 + ], + "score": 0.89, + "content": "s _ { H } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 270, + 300, + 286 + ], + "score": 1.0, + "content": ", which is roughly", + "type": "text" + }, + { + "bbox": [ + 300, + 270, + 339, + 284 + ], + "score": 0.93, + "content": "( \\hat { d } / N ) ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 270, + 506, + 286 + ], + "score": 1.0, + "content": ". Again, the estimation error on the value", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 282, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 104, + 282, + 117, + 299 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 285, + 141, + 298 + ], + "score": 0.92, + "content": "s _ { H - 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 282, + 172, + 299 + ], + "score": 1.0, + "content": "will be", + "type": "text" + }, + { + "bbox": [ + 172, + 284, + 216, + 297 + ], + "score": 0.93, + "content": "( \\hat { d } ^ { 2 } / N ) ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 282, + 373, + 299 + ], + "score": 1.0, + "content": "when using the linear predictor at level", + "type": "text" + }, + { + "bbox": [ + 374, + 285, + 400, + 296 + ], + "score": 0.84, + "content": "H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 282, + 506, + 299 + ], + "score": 1.0, + "content": ". The error will eventually", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 296, + 477, + 315 + ], + "spans": [ + { + "bbox": [ + 104, + 296, + 214, + 315 + ], + "score": 1.0, + "content": "be amplified by a factor of", + "type": "text" + }, + { + "bbox": [ + 214, + 298, + 235, + 309 + ], + "score": 0.89, + "content": "\\hat { d } ^ { H / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 296, + 367, + 315 + ], + "score": 1.0, + "content": ", which corresponds to the factor", + "type": "text" + }, + { + "bbox": [ + 368, + 297, + 407, + 312 + ], + "score": 0.93, + "content": "\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 296, + 477, + 315 + ], + "score": 1.0, + "content": "in Theorem 5.2.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12, + "bbox_fs": [ + 104, + 194, + 507, + 315 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 322, + 505, + 357 + ], + "lines": [ + { + "bbox": [ + 105, + 322, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 505, + 336 + ], + "score": 1.0, + "content": "Policy Completeness. In offline RL, another representation condition is closedness under Bellman", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "score": 1.0, + "content": "update (Szepesvari & Munos, 2005; Duan & Wang, 2020), which is stronger than realizability. In ´", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 345, + 489, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 489, + 358 + ], + "score": 1.0, + "content": "the context of offline policy evaluation, we have the following policy completeness assumption.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 322, + 505, + 358 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 358, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 105, + 357, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 255, + 371 + ], + "score": 1.0, + "content": "Assumption 4. For the given policy", + "type": "text" + }, + { + "bbox": [ + 255, + 361, + 262, + 369 + ], + "score": 0.69, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 357, + 298, + 371 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 298, + 359, + 324, + 370 + ], + "score": 0.88, + "content": "h > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 357, + 343, + 371 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 344, + 358, + 379, + 370 + ], + "score": 0.91, + "content": "\\theta _ { h } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 357, + 431, + 371 + ], + "score": 1.0, + "content": ", there exists", + "type": "text" + }, + { + "bbox": [ + 431, + 358, + 465, + 369 + ], + "score": 0.9, + "content": "\\theta ^ { \\prime } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 357, + 506, + 371 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 103, + 368, + 477, + 384 + ], + "spans": [ + { + "bbox": [ + 103, + 368, + 137, + 384 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 138, + 370, + 473, + 384 + ], + "score": 0.84, + "content": "\\begin{array} { r } { ( s , a ) \\in \\mathcal S _ { h - 1 } \\times \\mathcal A , \\mathbb E [ R ( s , a ) ] + \\sum _ { s ^ { \\prime } \\in { \\cal S } _ { h } } P ( s ^ { \\prime } \\mid s , a ) \\phi ( s ^ { \\prime } , \\pi ( s ^ { \\prime } ) ) ^ { \\top } \\theta _ { h } = \\phi ( s , a ) ^ { \\top } \\theta ^ { \\prime } . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 368, + 477, + 384 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 103, + 357, + 506, + 384 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 391, + 506, + 428 + ], + "lines": [ + { + "bbox": [ + 106, + 391, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 391, + 294, + 405 + ], + "score": 1.0, + "content": "Under Assumption 4 and the assumption that", + "type": "text" + }, + { + "bbox": [ + 294, + 392, + 361, + 403 + ], + "score": 0.92, + "content": "\\sigma _ { \\operatorname* { m i n } } ( \\Lambda _ { h } ) \\geq \\lambda _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 391, + 391, + 405 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 391, + 392, + 428, + 403 + ], + "score": 0.91, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 391, + 468, + 405 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 469, + 392, + 501, + 402 + ], + "score": 0.89, + "content": "\\lambda _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 391, + 506, + 405 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 402, + 373, + 415 + ], + "score": 1.0, + "content": "Duan & Wang (2020) have shown that for Algorithm 1, by taking", + "type": "text" + }, + { + "bbox": [ + 373, + 403, + 486, + 415 + ], + "score": 0.89, + "content": "N = \\mathrm { p o l } \\bar { \\mathrm { y } } ( \\bar { H } , d , 1 / \\varepsilon , 1 / \\lambda _ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 402, + 505, + 415 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 414, + 503, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 128, + 428 + ], + "score": 1.0, + "content": "have", + "type": "text" + }, + { + "bbox": [ + 128, + 414, + 285, + 428 + ], + "score": 0.92, + "content": "( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } \\leq \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 414, + 503, + 428 + ], + "score": 1.0, + "content": ". We refer interested readers to (Duan & Wang, 2020).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 106, + 391, + 506, + 428 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 432, + 505, + 468 + ], + "lines": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "We remark that the above analysis again implies that geometric error amplification is a real issue in", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 443, + 504, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 504, + 456 + ], + "score": 1.0, + "content": "offline RL, and sample-efficient offline RL is impossible unless the distribution shift is sufficiently", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 455, + 503, + 471 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 142, + 471 + ], + "score": 1.0, + "content": "low, i.e.,", + "type": "text" + }, + { + "bbox": [ + 142, + 455, + 182, + 469 + ], + "score": 0.93, + "content": "\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 455, + 503, + 471 + ], + "score": 1.0, + "content": "is bounded, or strong representation condition (e.g. policy completeness) holds.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 104, + 432, + 505, + 471 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 483, + 195, + 496 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 198, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 198, + 499 + ], + "score": 1.0, + "content": "6 CONCLUSION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 508, + 505, + 607 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 505, + 520 + ], + "score": 1.0, + "content": "While the extant body of provable results in the literature largely focus on sufficient conditions for", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 517, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 506, + 533 + ], + "score": 1.0, + "content": "sample-efficient offline RL, this work focuses on obtaining a better understanding of the necessary", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 531, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 505, + 542 + ], + "score": 1.0, + "content": "conditions, where we seek to understand to what extent mild assumptions can imply sample-efficient", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "score": 1.0, + "content": "offline RL. This work shows that for off-policy evaluation, even if we are given a representation that", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 552, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 565 + ], + "score": 1.0, + "content": "can perfectly represent the value function of the given policy and the data distribution has good", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 563, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 506, + 576 + ], + "score": 1.0, + "content": "coverage over the features, any provable algorithm still requires an exponential number of samples", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 575, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 505, + 587 + ], + "score": 1.0, + "content": "to non-trivially approximate the value of the given policy. These results highlight that provable", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 584, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 506, + 598 + ], + "score": 1.0, + "content": "sample-efficient offline RL is simply not possible unless either the distribution shift condition is", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 595, + 492, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 492, + 610 + ], + "score": 1.0, + "content": "sufficiently mild or we have stronger representation conditions that go well beyond realizability.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 509, + 506, + 610 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 624, + 218, + 636 + ], + "lines": [ + { + "bbox": [ + 106, + 623, + 220, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 220, + 639 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 646, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 661 + ], + "score": 1.0, + "content": "The authors would like to thank Akshay Krishnamurthy, Alekh Agarwal, Wen Sun, and Nan Jiang", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 658, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 505, + 672 + ], + "score": 1.0, + "content": "for numerous helpful discussion. Sham M. Kakade gratefully acknowledges funding from the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 667, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 506, + 685 + ], + "score": 1.0, + "content": "ONR award N00014-18-1-2247, and NSF Awards CCF-1703574 and CCF-1740551. Ruosong", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 680, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 506, + 694 + ], + "score": 1.0, + "content": "Wang was supported in part by the NSF IIS1763562, US Army W911NF1920104, and ONR Grant", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 691, + 499, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 499, + 705 + ], + "score": 1.0, + "content": "N000141812861. Research performed while Ruosong Wang was an intern at Microsoft Research.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 646, + 506, + 705 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 176, + 94 + ], + "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": [ + 105, + 100, + 504, + 123 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "score": 1.0, + "content": "Rishabh Agarwal, Dale Schuurmans, and Mohammad Norouzi. An optimistic perspective on offline", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 110, + 443, + 124 + ], + "spans": [ + { + "bbox": [ + 115, + 110, + 443, + 124 + ], + "score": 1.0, + "content": "reinforcement learning. In International Conference on Machine Learning, 2020.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 105, + 131, + 504, + 154 + ], + "lines": [ + { + "bbox": [ + 105, + 129, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 129, + 505, + 144 + ], + "score": 1.0, + "content": "Martin Anthony and Peter L Bartlett. Neural network learning: Theoretical foundations. cambridge", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 142, + 209, + 154 + ], + "spans": [ + { + "bbox": [ + 115, + 142, + 209, + 154 + ], + "score": 1.0, + "content": "university press, 2009.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 161, + 503, + 195 + ], + "lines": [ + { + "bbox": [ + 105, + 160, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 505, + 174 + ], + "score": 1.0, + "content": "Andras Antos, Csaba Szepesv ´ ari, and R ´ emi Munos. Learning near-optimal policies with bellman- ´", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 172, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 115, + 172, + 505, + 186 + ], + "score": 1.0, + "content": "residual minimization based fitted policy iteration and a single sample path. Machine Learning,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 117, + 183, + 201, + 195 + ], + "spans": [ + { + "bbox": [ + 117, + 183, + 201, + 195 + ], + "score": 1.0, + "content": "71(1):89–129, 2008.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 105, + 203, + 504, + 226 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 505, + 217 + ], + "score": 1.0, + "content": "Keith Ball. An elementary introduction to modern convex geometry. Flavors of geometry, 31:1–58,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 213, + 142, + 226 + ], + "spans": [ + { + "bbox": [ + 116, + 213, + 142, + 226 + ], + "score": 1.0, + "content": "1997.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 233, + 505, + 267 + ], + "lines": [ + { + "bbox": [ + 106, + 233, + 504, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 504, + 246 + ], + "score": 1.0, + "content": "Dimitri P Bertsekas and John N Tsitsiklis. Neuro-dynamic programming: an overview. In Pro-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 245, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 116, + 245, + 505, + 258 + ], + "score": 1.0, + "content": "ceedings of 1995 34th IEEE Conference on Decision and Control, volume 1, pp. 560–564. IEEE,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 255, + 142, + 268 + ], + "spans": [ + { + "bbox": [ + 116, + 255, + 142, + 268 + ], + "score": 1.0, + "content": "1995.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 505, + 320 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "Sebastien Bubeck, Nicol ´ o Cesa-Bianchi, and Sham M. Kakade. Towards minimax policies for `", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 286, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 115, + 286, + 505, + 299 + ], + "score": 1.0, + "content": "online linear optimization with bandit feedback. In COLT 2012 - The 25th Annual Conference on", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 297, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 115, + 297, + 505, + 311 + ], + "score": 1.0, + "content": "Learning Theory, June 25-27, 2012, Edinburgh, Scotland, volume 23 of JMLR Proceedings, pp.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 309, + 191, + 320 + ], + "spans": [ + { + "bbox": [ + 116, + 309, + 191, + 320 + ], + "score": 1.0, + "content": "41.1–41.14, 2012.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 328, + 503, + 351 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 342 + ], + "score": 1.0, + "content": "Jinglin Chen and Nan Jiang. Information-theoretic considerations in batch reinforcement learning.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 339, + 411, + 352 + ], + "spans": [ + { + "bbox": [ + 115, + 339, + 411, + 352 + ], + "score": 1.0, + "content": "In International Conference on Machine Learning, pp. 1042–1051, 2019.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 358, + 399, + 371 + ], + "lines": [ + { + "bbox": [ + 105, + 358, + 399, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 399, + 372 + ], + "score": 1.0, + "content": "Herman Chernoff. Sequential analysis and optimal design. SIAM, 1972.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 378, + 504, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "score": 1.0, + "content": "Simon S. Du, Sham M. Kakade, Ruosong Wang, and Lin F. Yang. Is a good representation suf-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 388, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 115, + 388, + 506, + 403 + ], + "score": 1.0, + "content": "ficient for sample efficient reinforcement learning? In International Conference on Learning", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 401, + 210, + 412 + ], + "spans": [ + { + "bbox": [ + 115, + 401, + 210, + 412 + ], + "score": 1.0, + "content": "Representations, 2020.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 105, + 420, + 504, + 443 + ], + "lines": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "Yaqi Duan and Mengdi Wang. Minimax-optimal off-policy evaluation with linear function approx-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 431, + 315, + 443 + ], + "spans": [ + { + "bbox": [ + 115, + 431, + 315, + 443 + ], + "score": 1.0, + "content": "imation. arXiv preprint arXiv:2002.09516, 2020.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 450, + 505, + 485 + ], + "lines": [ + { + "bbox": [ + 105, + 448, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 505, + 465 + ], + "score": 1.0, + "content": "Miroslav Dud´ık, John Langford, and Lihong Li. Doubly robust policy evaluation and learning.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 115, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "In Proceedings of the 28th International Conference on International Conference on Machine", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 473, + 248, + 485 + ], + "spans": [ + { + "bbox": [ + 116, + 473, + 248, + 485 + ], + "score": 1.0, + "content": "Learning, pp. 1097–1104, 2011.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 504, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "Mehrdad Farajtabar, Yinlam Chow, and Mohammad Ghavamzadeh. More robust doubly robust", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 503, + 500, + 516 + ], + "spans": [ + { + "bbox": [ + 116, + 503, + 500, + 516 + ], + "score": 1.0, + "content": "off-policy evaluation. In International Conference on Machine Learning, pp. 1447–1456, 2018.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 504, + 546 + ], + "lines": [ + { + "bbox": [ + 106, + 522, + 505, + 536 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 505, + 536 + ], + "score": 1.0, + "content": "Yihao Feng, Tongzheng Ren, Ziyang Tang, and Qiang Liu. Accountable off-policy evaluation with", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 534, + 380, + 547 + ], + "spans": [ + { + "bbox": [ + 115, + 534, + 380, + 547 + ], + "score": 1.0, + "content": "kernel bellman statistics. arXiv preprint arXiv:2008.06668, 2020.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 504, + 577 + ], + "lines": [ + { + "bbox": [ + 106, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 554, + 505, + 567 + ], + "score": 1.0, + "content": "Scott Fujimoto, David Meger, and Doina Precup. Off-policy deep reinforcement learning without", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 565, + 462, + 577 + ], + "spans": [ + { + "bbox": [ + 115, + 565, + 462, + 577 + ], + "score": 1.0, + "content": "exploration. In International Conference on Machine Learning, pp. 2052–2062, 2019.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 584, + 504, + 607 + ], + "lines": [ + { + "bbox": [ + 106, + 583, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 506, + 599 + ], + "score": 1.0, + "content": "Geoffrey J Gordon. Stable function approximation in dynamic programming. In Machine Learning", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 595, + 310, + 608 + ], + "spans": [ + { + "bbox": [ + 116, + 595, + 310, + 608 + ], + "score": 1.0, + "content": "Proceedings 1995, pp. 261–268. Elsevier, 1995.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 106, + 615, + 504, + 638 + ], + "lines": [ + { + "bbox": [ + 106, + 614, + 504, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 504, + 628 + ], + "score": 1.0, + "content": "Geoffrey J Gordon. Stable fitted reinforcement learning. In Advances in neural information pro-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 627, + 273, + 639 + ], + "spans": [ + { + "bbox": [ + 115, + 627, + 273, + 639 + ], + "score": 1.0, + "content": "cessing systems, pp. 1052–1058, 1996.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 106, + 645, + 504, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 645, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 505, + 659 + ], + "score": 1.0, + "content": "Geoffrey J Gordon. Approximate solutions to markov decision processes. Technical report,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 116, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE, 1999.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 108, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "Omer Gottesman, Fredrik Johansson, Joshua Meier, Jack Dent, Donghun Lee, Srivatsan Srinivasan,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 116, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "Linying Zhang, Yi Ding, David Wihl, Xuefeng Peng, Jiayu Yao, Isaac Lage, Christopher Mosch,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 115, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "Li wei H. Lehman, Matthieu Komorowski, Matthieu Komorowski, Aldo Faisal, Leo Anthony", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "Celi, David Sontag, and Finale Doshi-Velez. Evaluating reinforcement learning algorithms in", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 720, + 259, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 259, + 733 + ], + "score": 1.0, + "content": "observational health settings, 2018.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42 + } + ], + "page_idx": 9, + "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, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 176, + 94 + ], + "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": [ + 105, + 100, + 504, + 123 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 505, + 113 + ], + "score": 1.0, + "content": "Rishabh Agarwal, Dale Schuurmans, and Mohammad Norouzi. An optimistic perspective on offline", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 110, + 443, + 124 + ], + "spans": [ + { + "bbox": [ + 115, + 110, + 443, + 124 + ], + "score": 1.0, + "content": "reinforcement learning. In International Conference on Machine Learning, 2020.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 105, + 99, + 505, + 124 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 131, + 504, + 154 + ], + "lines": [ + { + "bbox": [ + 105, + 129, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 129, + 505, + 144 + ], + "score": 1.0, + "content": "Martin Anthony and Peter L Bartlett. Neural network learning: Theoretical foundations. cambridge", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 142, + 209, + 154 + ], + "spans": [ + { + "bbox": [ + 115, + 142, + 209, + 154 + ], + "score": 1.0, + "content": "university press, 2009.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 129, + 505, + 154 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 161, + 503, + 195 + ], + "lines": [ + { + "bbox": [ + 105, + 160, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 505, + 174 + ], + "score": 1.0, + "content": "Andras Antos, Csaba Szepesv ´ ari, and R ´ emi Munos. Learning near-optimal policies with bellman- ´", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 172, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 115, + 172, + 505, + 186 + ], + "score": 1.0, + "content": "residual minimization based fitted policy iteration and a single sample path. Machine Learning,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 117, + 183, + 201, + 195 + ], + "spans": [ + { + "bbox": [ + 117, + 183, + 201, + 195 + ], + "score": 1.0, + "content": "71(1):89–129, 2008.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 160, + 505, + 195 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 203, + 504, + 226 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 505, + 217 + ], + "score": 1.0, + "content": "Keith Ball. An elementary introduction to modern convex geometry. Flavors of geometry, 31:1–58,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 213, + 142, + 226 + ], + "spans": [ + { + "bbox": [ + 116, + 213, + 142, + 226 + ], + "score": 1.0, + "content": "1997.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 202, + 505, + 226 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 233, + 505, + 267 + ], + "lines": [ + { + "bbox": [ + 106, + 233, + 504, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 504, + 246 + ], + "score": 1.0, + "content": "Dimitri P Bertsekas and John N Tsitsiklis. Neuro-dynamic programming: an overview. In Pro-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 245, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 116, + 245, + 505, + 258 + ], + "score": 1.0, + "content": "ceedings of 1995 34th IEEE Conference on Decision and Control, volume 1, pp. 560–564. IEEE,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 255, + 142, + 268 + ], + "spans": [ + { + "bbox": [ + 116, + 255, + 142, + 268 + ], + "score": 1.0, + "content": "1995.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 233, + 505, + 268 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 505, + 320 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "Sebastien Bubeck, Nicol ´ o Cesa-Bianchi, and Sham M. Kakade. Towards minimax policies for `", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 286, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 115, + 286, + 505, + 299 + ], + "score": 1.0, + "content": "online linear optimization with bandit feedback. In COLT 2012 - The 25th Annual Conference on", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 297, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 115, + 297, + 505, + 311 + ], + "score": 1.0, + "content": "Learning Theory, June 25-27, 2012, Edinburgh, Scotland, volume 23 of JMLR Proceedings, pp.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 309, + 191, + 320 + ], + "spans": [ + { + "bbox": [ + 116, + 309, + 191, + 320 + ], + "score": 1.0, + "content": "41.1–41.14, 2012.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 275, + 505, + 320 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 328, + 503, + 351 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 342 + ], + "score": 1.0, + "content": "Jinglin Chen and Nan Jiang. Information-theoretic considerations in batch reinforcement learning.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 339, + 411, + 352 + ], + "spans": [ + { + "bbox": [ + 115, + 339, + 411, + 352 + ], + "score": 1.0, + "content": "In International Conference on Machine Learning, pp. 1042–1051, 2019.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 326, + 505, + 352 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 358, + 399, + 371 + ], + "lines": [ + { + "bbox": [ + 105, + 358, + 399, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 399, + 372 + ], + "score": 1.0, + "content": "Herman Chernoff. Sequential analysis and optimal design. SIAM, 1972.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 358, + 399, + 372 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 378, + 504, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "score": 1.0, + "content": "Simon S. Du, Sham M. Kakade, Ruosong Wang, and Lin F. Yang. Is a good representation suf-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 388, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 115, + 388, + 506, + 403 + ], + "score": 1.0, + "content": "ficient for sample efficient reinforcement learning? In International Conference on Learning", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 401, + 210, + 412 + ], + "spans": [ + { + "bbox": [ + 115, + 401, + 210, + 412 + ], + "score": 1.0, + "content": "Representations, 2020.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 378, + 506, + 412 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 420, + 504, + 443 + ], + "lines": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "Yaqi Duan and Mengdi Wang. Minimax-optimal off-policy evaluation with linear function approx-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 431, + 315, + 443 + ], + "spans": [ + { + "bbox": [ + 115, + 431, + 315, + 443 + ], + "score": 1.0, + "content": "imation. arXiv preprint arXiv:2002.09516, 2020.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 106, + 420, + 505, + 443 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 450, + 505, + 485 + ], + "lines": [ + { + "bbox": [ + 105, + 448, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 505, + 465 + ], + "score": 1.0, + "content": "Miroslav Dud´ık, John Langford, and Lihong Li. Doubly robust policy evaluation and learning.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 115, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "In Proceedings of the 28th International Conference on International Conference on Machine", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 473, + 248, + 485 + ], + "spans": [ + { + "bbox": [ + 116, + 473, + 248, + 485 + ], + "score": 1.0, + "content": "Learning, pp. 1097–1104, 2011.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 448, + 505, + 485 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 504, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "Mehrdad Farajtabar, Yinlam Chow, and Mohammad Ghavamzadeh. More robust doubly robust", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 503, + 500, + 516 + ], + "spans": [ + { + "bbox": [ + 116, + 503, + 500, + 516 + ], + "score": 1.0, + "content": "off-policy evaluation. In International Conference on Machine Learning, pp. 1447–1456, 2018.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 492, + 505, + 516 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 504, + 546 + ], + "lines": [ + { + "bbox": [ + 106, + 522, + 505, + 536 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 505, + 536 + ], + "score": 1.0, + "content": "Yihao Feng, Tongzheng Ren, Ziyang Tang, and Qiang Liu. Accountable off-policy evaluation with", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 534, + 380, + 547 + ], + "spans": [ + { + "bbox": [ + 115, + 534, + 380, + 547 + ], + "score": 1.0, + "content": "kernel bellman statistics. arXiv preprint arXiv:2008.06668, 2020.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 106, + 522, + 505, + 547 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 504, + 577 + ], + "lines": [ + { + "bbox": [ + 106, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 554, + 505, + 567 + ], + "score": 1.0, + "content": "Scott Fujimoto, David Meger, and Doina Precup. Off-policy deep reinforcement learning without", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 565, + 462, + 577 + ], + "spans": [ + { + "bbox": [ + 115, + 565, + 462, + 577 + ], + "score": 1.0, + "content": "exploration. In International Conference on Machine Learning, pp. 2052–2062, 2019.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 106, + 554, + 505, + 577 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 584, + 504, + 607 + ], + "lines": [ + { + "bbox": [ + 106, + 583, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 506, + 599 + ], + "score": 1.0, + "content": "Geoffrey J Gordon. Stable function approximation in dynamic programming. In Machine Learning", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 595, + 310, + 608 + ], + "spans": [ + { + "bbox": [ + 116, + 595, + 310, + 608 + ], + "score": 1.0, + "content": "Proceedings 1995, pp. 261–268. Elsevier, 1995.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 106, + 583, + 506, + 608 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 615, + 504, + 638 + ], + "lines": [ + { + "bbox": [ + 106, + 614, + 504, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 504, + 628 + ], + "score": 1.0, + "content": "Geoffrey J Gordon. Stable fitted reinforcement learning. In Advances in neural information pro-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 627, + 273, + 639 + ], + "spans": [ + { + "bbox": [ + 115, + 627, + 273, + 639 + ], + "score": 1.0, + "content": "cessing systems, pp. 1052–1058, 1996.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 106, + 614, + 504, + 639 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 645, + 504, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 645, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 505, + 659 + ], + "score": 1.0, + "content": "Geoffrey J Gordon. Approximate solutions to markov decision processes. Technical report,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 116, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE, 1999.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 106, + 645, + 505, + 669 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "Omer Gottesman, Fredrik Johansson, Joshua Meier, Jack Dent, Donghun Lee, Srivatsan Srinivasan,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 116, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "Linying Zhang, Yi Ding, David Wihl, Xuefeng Peng, Jiayu Yao, Isaac Lage, Christopher Mosch,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 697, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 115, + 697, + 505, + 712 + ], + "score": 1.0, + "content": "Li wei H. Lehman, Matthieu Komorowski, Matthieu Komorowski, Aldo Faisal, Leo Anthony", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "Celi, David Sontag, and Finale Doshi-Velez. Evaluating reinforcement learning algorithms in", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 720, + 259, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 259, + 733 + ], + "score": 1.0, + "content": "observational health settings, 2018.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42, + "bbox_fs": [ + 106, + 676, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Zhaohan Guo, Philip S Thomas, and Emma Brunskill. Using options and covariance testing for long", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 108 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 108 + ], + "score": 1.0, + "content": "horizon off-policy policy evaluation. In Advances in Neural Information Processing Systems, pp.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 191, + 116 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 191, + 116 + ], + "score": 1.0, + "content": "2492–2501, 2017.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Daniel Hsu, Sham Kakade, Tong Zhang, et al. A tail inequality for quadratic forms of subgaussian", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 135, + 401, + 147 + ], + "spans": [ + { + "bbox": [ + 116, + 135, + 401, + 147 + ], + "score": 1.0, + "content": "random vectors. Electronic Communications in Probability, 17, 2012a.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 108, + 154, + 503, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "score": 1.0, + "content": "Daniel Hsu, Sham M Kakade, and Tong Zhang. Random design analysis of ridge regression. In", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 117, + 165, + 308, + 178 + ], + "spans": [ + { + "bbox": [ + 117, + 165, + 308, + 178 + ], + "score": 1.0, + "content": "Conference on learning theory, pp. 9–1, 2012b.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 184, + 505, + 229 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 505, + 198 + ], + "score": 1.0, + "content": "Natasha Jaques, Asma Ghandeharioun, Judy Hanwen Shen, Craig Ferguson, Agata Lapedriza, Noah", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 195, + 506, + 210 + ], + "spans": [ + { + "bbox": [ + 115, + 195, + 506, + 210 + ], + "score": 1.0, + "content": "Jones, Shixiang Gu, and Rosalind Picard. Way off-policy batch deep reinforcement learning", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 207, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 116, + 207, + 497, + 220 + ], + "score": 1.0, + "content": "of human preferences in dialog, 2020. URL https://openreview.net/forum?id", + "type": "text" + }, + { + "bbox": [ + 497, + 208, + 505, + 217 + ], + "score": 0.39, + "content": "=", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 219, + 181, + 230 + ], + "spans": [ + { + "bbox": [ + 116, + 219, + 181, + 230 + ], + "score": 1.0, + "content": "rJl5rRVFvH.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 503, + 260 + ], + "lines": [ + { + "bbox": [ + 105, + 235, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 505, + 252 + ], + "score": 1.0, + "content": "Nan Jiang and Jiawei Huang. Minimax confidence interval for off-policy evaluation and policy", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 249, + 335, + 261 + ], + "spans": [ + { + "bbox": [ + 115, + 249, + 335, + 261 + ], + "score": 1.0, + "content": "optimization. arXiv preprint arXiv:2002.02081, 2020.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 268, + 504, + 291 + ], + "lines": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "Nan Jiang and Lihong Li. Doubly robust off-policy value evaluation for reinforcement learning. In", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 279, + 423, + 292 + ], + "spans": [ + { + "bbox": [ + 116, + 279, + 423, + 292 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, pp. 652–661. PMLR, 2016.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 298, + 504, + 321 + ], + "lines": [ + { + "bbox": [ + 105, + 298, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 506, + 312 + ], + "score": 1.0, + "content": "Sham Machandranath Kakade. On the sample complexity of reinforcement learning. PhD thesis,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 117, + 310, + 304, + 321 + ], + "spans": [ + { + "bbox": [ + 117, + 310, + 304, + 321 + ], + "score": 1.0, + "content": "University of London London, England, 2003.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 503, + 352 + ], + "lines": [ + { + "bbox": [ + 106, + 329, + 504, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 504, + 342 + ], + "score": 1.0, + "content": "Nathan Kallus and Masatoshi Uehara. Efficiently breaking the curse of horizon in off-policy evalu-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 340, + 448, + 353 + ], + "spans": [ + { + "bbox": [ + 116, + 340, + 448, + 353 + ], + "score": 1.0, + "content": "ation with double reinforcement learning. arXiv preprint arXiv:1909.05850, 2019.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 359, + 504, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 504, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 504, + 372 + ], + "score": 1.0, + "content": "Nathan Kallus and Masatoshi Uehara. Double reinforcement learning for efficient off-policy evalu-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 115, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "ation in markov decision processes. Journal of Machine Learning Research, 21(167):1–63, 2020.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 108, + 390, + 504, + 424 + ], + "lines": [ + { + "bbox": [ + 106, + 390, + 504, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 504, + 402 + ], + "score": 1.0, + "content": "Emilie Kaufmann, Olivier Cappe, and Aur ´ elien Garivier. On the complexity of best-arm identifi- ´", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 115, + 402, + 505, + 414 + ], + "score": 1.0, + "content": "cation in multi-armed bandit models. The Journal of Machine Learning Research, 17(1):1–42,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 114, + 411, + 143, + 424 + ], + "spans": [ + { + "bbox": [ + 114, + 411, + 143, + 424 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 431, + 503, + 455 + ], + "lines": [ + { + "bbox": [ + 105, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 465, + 444 + ], + "score": 1.0, + "content": "Rahul Kidambi, Aravind Rajeswaran, Praneeth Netrapalli, and Thorsten Joachims. Morel", + "type": "text" + }, + { + "bbox": [ + 466, + 434, + 473, + 442 + ], + "score": 0.39, + "content": ":", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "Model-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 117, + 443, + 290, + 455 + ], + "spans": [ + { + "bbox": [ + 117, + 443, + 290, + 455 + ], + "score": 1.0, + "content": "based offline reinforcement learning, 2020.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 106, + 462, + 503, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "Akshay Krishnamurthy, Alekh Agarwal, and John Langford. Pac reinforcement learning with rich", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 473, + 487, + 486 + ], + "spans": [ + { + "bbox": [ + 115, + 473, + 487, + 486 + ], + "score": 1.0, + "content": "observations. In Advances in Neural Information Processing Systems, pp. 1840–1848, 2016.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 492, + 505, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 505, + 507 + ], + "score": 1.0, + "content": "Aviral Kumar, Justin Fu, Matthew Soh, George Tucker, and Sergey Levine. Stabilizing off-policy", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 504, + 506, + 517 + ], + "spans": [ + { + "bbox": [ + 115, + 504, + 506, + 517 + ], + "score": 1.0, + "content": "q-learning via bootstrapping error reduction. neural information processing systems, pp. 11761–", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 117, + 515, + 172, + 526 + ], + "spans": [ + { + "bbox": [ + 117, + 515, + 172, + 526 + ], + "score": 1.0, + "content": "11771, 2019.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 106, + 534, + 503, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 533, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 505, + 547 + ], + "score": 1.0, + "content": "Aviral Kumar, Abhishek Gupta, and Sergey Levine. Discor: Corrective feedback in reinforcement", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 545, + 423, + 558 + ], + "spans": [ + { + "bbox": [ + 115, + 545, + 423, + 558 + ], + "score": 1.0, + "content": "learning via distribution correction. arXiv preprint arXiv:2003.07305, 2020.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 565, + 504, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 564, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 506, + 579 + ], + "score": 1.0, + "content": "Michail G Lagoudakis and Ronald Parr. Least-squares policy iteration. Journal of machine learning", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 576, + 261, + 589 + ], + "spans": [ + { + "bbox": [ + 115, + 576, + 261, + 589 + ], + "score": 1.0, + "content": "research, 4(Dec):1107–1149, 2003.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 595, + 504, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "Romain Laroche, Paul Trichelair, and Remi Tachet des Combes. Safe policy improvement with ´", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 606, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 115, + 606, + 506, + 621 + ], + "score": 1.0, + "content": "baseline bootstrapping. In Proceedings of the 36th International Conference on Machine Learning", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 617, + 177, + 630 + ], + "spans": [ + { + "bbox": [ + 116, + 617, + 177, + 630 + ], + "score": 1.0, + "content": "(ICML), 2019.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 104, + 637, + 504, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 650 + ], + "score": 1.0, + "content": "Lihong Li, Remi Munos, and Csaba Szepesvari. Toward minimax off-policy value estimation. In", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 648, + 342, + 661 + ], + "spans": [ + { + "bbox": [ + 115, + 648, + 342, + 661 + ], + "score": 1.0, + "content": "Artificial Intelligence and Statistics, pp. 608–616, 2015.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 106, + 668, + 504, + 701 + ], + "lines": [ + { + "bbox": [ + 106, + 667, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 505, + 681 + ], + "score": 1.0, + "content": "Qiang Liu, Lihong Li, Ziyang Tang, and Dengyong Zhou. Breaking the curse of horizon: Infinite-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "horizon off-policy estimation. In Advances in Neural Information Processing Systems, pp. 5356–", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 688, + 167, + 702 + ], + "spans": [ + { + "bbox": [ + 115, + 688, + 167, + 702 + ], + "score": 1.0, + "content": "5366, 2018.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 504, + 722 + ], + "score": 1.0, + "content": "Yao Liu, Pierre-Luc Bacon, and Emma Brunskill. Understanding the curse of horizon in off-policy", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 720, + 475, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 475, + 733 + ], + "score": 1.0, + "content": "evaluation via conditional importance sampling. arXiv preprint arXiv:1910.06508, 2019.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.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, + 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, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Zhaohan Guo, Philip S Thomas, and Emma Brunskill. Using options and covariance testing for long", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 108 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 108 + ], + "score": 1.0, + "content": "horizon off-policy policy evaluation. In Advances in Neural Information Processing Systems, pp.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 191, + 116 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 191, + 116 + ], + "score": 1.0, + "content": "2492–2501, 2017.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 505, + 116 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Daniel Hsu, Sham Kakade, Tong Zhang, et al. A tail inequality for quadratic forms of subgaussian", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 135, + 401, + 147 + ], + "spans": [ + { + "bbox": [ + 116, + 135, + 401, + 147 + ], + "score": 1.0, + "content": "random vectors. Electronic Communications in Probability, 17, 2012a.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 106, + 123, + 505, + 147 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 154, + 503, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "score": 1.0, + "content": "Daniel Hsu, Sham M Kakade, and Tong Zhang. Random design analysis of ridge regression. In", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 117, + 165, + 308, + 178 + ], + "spans": [ + { + "bbox": [ + 117, + 165, + 308, + 178 + ], + "score": 1.0, + "content": "Conference on learning theory, pp. 9–1, 2012b.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 153, + 506, + 178 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 184, + 505, + 229 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 505, + 198 + ], + "score": 1.0, + "content": "Natasha Jaques, Asma Ghandeharioun, Judy Hanwen Shen, Craig Ferguson, Agata Lapedriza, Noah", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 195, + 506, + 210 + ], + "spans": [ + { + "bbox": [ + 115, + 195, + 506, + 210 + ], + "score": 1.0, + "content": "Jones, Shixiang Gu, and Rosalind Picard. Way off-policy batch deep reinforcement learning", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 207, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 116, + 207, + 497, + 220 + ], + "score": 1.0, + "content": "of human preferences in dialog, 2020. URL https://openreview.net/forum?id", + "type": "text" + }, + { + "bbox": [ + 497, + 208, + 505, + 217 + ], + "score": 0.39, + "content": "=", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 219, + 181, + 230 + ], + "spans": [ + { + "bbox": [ + 116, + 219, + 181, + 230 + ], + "score": 1.0, + "content": "rJl5rRVFvH.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 185, + 506, + 230 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 503, + 260 + ], + "lines": [ + { + "bbox": [ + 105, + 235, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 505, + 252 + ], + "score": 1.0, + "content": "Nan Jiang and Jiawei Huang. Minimax confidence interval for off-policy evaluation and policy", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 249, + 335, + 261 + ], + "spans": [ + { + "bbox": [ + 115, + 249, + 335, + 261 + ], + "score": 1.0, + "content": "optimization. arXiv preprint arXiv:2002.02081, 2020.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 235, + 505, + 261 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 268, + 504, + 291 + ], + "lines": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "Nan Jiang and Lihong Li. Doubly robust off-policy value evaluation for reinforcement learning. In", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 279, + 423, + 292 + ], + "spans": [ + { + "bbox": [ + 116, + 279, + 423, + 292 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, pp. 652–661. PMLR, 2016.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 268, + 505, + 292 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 298, + 504, + 321 + ], + "lines": [ + { + "bbox": [ + 105, + 298, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 506, + 312 + ], + "score": 1.0, + "content": "Sham Machandranath Kakade. On the sample complexity of reinforcement learning. PhD thesis,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 117, + 310, + 304, + 321 + ], + "spans": [ + { + "bbox": [ + 117, + 310, + 304, + 321 + ], + "score": 1.0, + "content": "University of London London, England, 2003.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 298, + 506, + 321 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 503, + 352 + ], + "lines": [ + { + "bbox": [ + 106, + 329, + 504, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 504, + 342 + ], + "score": 1.0, + "content": "Nathan Kallus and Masatoshi Uehara. Efficiently breaking the curse of horizon in off-policy evalu-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 340, + 448, + 353 + ], + "spans": [ + { + "bbox": [ + 116, + 340, + 448, + 353 + ], + "score": 1.0, + "content": "ation with double reinforcement learning. arXiv preprint arXiv:1909.05850, 2019.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 106, + 329, + 504, + 353 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 359, + 504, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 504, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 504, + 372 + ], + "score": 1.0, + "content": "Nathan Kallus and Masatoshi Uehara. Double reinforcement learning for efficient off-policy evalu-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 115, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "ation in markov decision processes. Journal of Machine Learning Research, 21(167):1–63, 2020.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 106, + 360, + 505, + 383 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 390, + 504, + 424 + ], + "lines": [ + { + "bbox": [ + 106, + 390, + 504, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 504, + 402 + ], + "score": 1.0, + "content": "Emilie Kaufmann, Olivier Cappe, and Aur ´ elien Garivier. On the complexity of best-arm identifi- ´", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 115, + 402, + 505, + 414 + ], + "score": 1.0, + "content": "cation in multi-armed bandit models. The Journal of Machine Learning Research, 17(1):1–42,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 114, + 411, + 143, + 424 + ], + "spans": [ + { + "bbox": [ + 114, + 411, + 143, + 424 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 390, + 505, + 424 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 431, + 503, + 455 + ], + "lines": [ + { + "bbox": [ + 105, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 465, + 444 + ], + "score": 1.0, + "content": "Rahul Kidambi, Aravind Rajeswaran, Praneeth Netrapalli, and Thorsten Joachims. Morel", + "type": "text" + }, + { + "bbox": [ + 466, + 434, + 473, + 442 + ], + "score": 0.39, + "content": ":", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "Model-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 117, + 443, + 290, + 455 + ], + "spans": [ + { + "bbox": [ + 117, + 443, + 290, + 455 + ], + "score": 1.0, + "content": "based offline reinforcement learning, 2020.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 432, + 505, + 455 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 462, + 503, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "Akshay Krishnamurthy, Alekh Agarwal, and John Langford. Pac reinforcement learning with rich", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 473, + 487, + 486 + ], + "spans": [ + { + "bbox": [ + 115, + 473, + 487, + 486 + ], + "score": 1.0, + "content": "observations. In Advances in Neural Information Processing Systems, pp. 1840–1848, 2016.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 463, + 505, + 486 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 492, + 505, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 505, + 507 + ], + "score": 1.0, + "content": "Aviral Kumar, Justin Fu, Matthew Soh, George Tucker, and Sergey Levine. Stabilizing off-policy", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 504, + 506, + 517 + ], + "spans": [ + { + "bbox": [ + 115, + 504, + 506, + 517 + ], + "score": 1.0, + "content": "q-learning via bootstrapping error reduction. neural information processing systems, pp. 11761–", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 117, + 515, + 172, + 526 + ], + "spans": [ + { + "bbox": [ + 117, + 515, + 172, + 526 + ], + "score": 1.0, + "content": "11771, 2019.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 491, + 506, + 526 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 534, + 503, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 533, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 505, + 547 + ], + "score": 1.0, + "content": "Aviral Kumar, Abhishek Gupta, and Sergey Levine. Discor: Corrective feedback in reinforcement", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 545, + 423, + 558 + ], + "spans": [ + { + "bbox": [ + 115, + 545, + 423, + 558 + ], + "score": 1.0, + "content": "learning via distribution correction. arXiv preprint arXiv:2003.07305, 2020.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 106, + 533, + 505, + 558 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 565, + 504, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 564, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 506, + 579 + ], + "score": 1.0, + "content": "Michail G Lagoudakis and Ronald Parr. Least-squares policy iteration. Journal of machine learning", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 576, + 261, + 589 + ], + "spans": [ + { + "bbox": [ + 115, + 576, + 261, + 589 + ], + "score": 1.0, + "content": "research, 4(Dec):1107–1149, 2003.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 564, + 506, + 589 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 595, + 504, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "Romain Laroche, Paul Trichelair, and Remi Tachet des Combes. Safe policy improvement with ´", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 606, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 115, + 606, + 506, + 621 + ], + "score": 1.0, + "content": "baseline bootstrapping. In Proceedings of the 36th International Conference on Machine Learning", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 617, + 177, + 630 + ], + "spans": [ + { + "bbox": [ + 116, + 617, + 177, + 630 + ], + "score": 1.0, + "content": "(ICML), 2019.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 595, + 506, + 630 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 637, + 504, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 650 + ], + "score": 1.0, + "content": "Lihong Li, Remi Munos, and Csaba Szepesvari. Toward minimax off-policy value estimation. In", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 648, + 342, + 661 + ], + "spans": [ + { + "bbox": [ + 115, + 648, + 342, + 661 + ], + "score": 1.0, + "content": "Artificial Intelligence and Statistics, pp. 608–616, 2015.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 636, + 505, + 661 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 668, + 504, + 701 + ], + "lines": [ + { + "bbox": [ + 106, + 667, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 505, + 681 + ], + "score": 1.0, + "content": "Qiang Liu, Lihong Li, Ziyang Tang, and Dengyong Zhou. Breaking the curse of horizon: Infinite-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "horizon off-policy estimation. In Advances in Neural Information Processing Systems, pp. 5356–", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 688, + 167, + 702 + ], + "spans": [ + { + "bbox": [ + 115, + 688, + 167, + 702 + ], + "score": 1.0, + "content": "5366, 2018.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41, + "bbox_fs": [ + 106, + 667, + 505, + 702 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 504, + 722 + ], + "score": 1.0, + "content": "Yao Liu, Pierre-Luc Bacon, and Emma Brunskill. Understanding the curse of horizon in off-policy", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 720, + 475, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 475, + 733 + ], + "score": 1.0, + "content": "evaluation via conditional importance sampling. arXiv preprint arXiv:1910.06508, 2019.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5, + "bbox_fs": [ + 106, + 708, + 504, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Travis Mandel, Yun-En Liu, Sergey Levine, Emma Brunskill, and Zoran Popovic. Offline policy", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "evaluation across representations with applications to educational games. In AAMAS, pp. 1077–", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 166, + 115 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 166, + 115 + ], + "score": 1.0, + "content": "1084, 2014.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 105, + 122, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 122, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 135 + ], + "score": 1.0, + "content": "Shie Mannor and John N Tsitsiklis. The sample complexity of exploration in the multi-armed bandit", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 411, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 411, + 146 + ], + "score": 1.0, + "content": "problem. Journal of Machine Learning Research, 5(Jun):623–648, 2004.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 108, + 151, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Belle-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 505, + 176 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 505, + 176 + ], + "score": 1.0, + "content": "mare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, et al. Human-level", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 174, + 421, + 187 + ], + "spans": [ + { + "bbox": [ + 115, + 174, + 421, + 187 + ], + "score": 1.0, + "content": "control through deep reinforcement learning. Nature, 518(7540):529, 2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 105, + 192, + 505, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "Wenlong Mou, Zheng Wen, and Xi Chen. On the sample complexity of reinforcement learning with", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 393, + 216 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 393, + 216 + ], + "score": 1.0, + "content": "policy space generalization. arXiv preprint arXiv:2008.07353, 2020.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 221, + 504, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 220, + 506, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 506, + 235 + ], + "score": 1.0, + "content": "Remi Munos. Error bounds for approximate policy iteration. In ´ ICML, volume 3, pp. 560–567,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 114, + 232, + 144, + 246 + ], + "spans": [ + { + "bbox": [ + 114, + 232, + 144, + 246 + ], + "score": 1.0, + "content": "2003.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 108, + 251, + 504, + 285 + ], + "lines": [ + { + "bbox": [ + 105, + 251, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 105, + 251, + 505, + 264 + ], + "score": 1.0, + "content": "Remi Munos and Andrew W Moore. Barycentric interpolators for continuous space and time re-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 262, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 115, + 262, + 505, + 276 + ], + "score": 1.0, + "content": "inforcement learning. In Advances in neural information processing systems, pp. 1024–1030,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 272, + 143, + 286 + ], + "spans": [ + { + "bbox": [ + 115, + 272, + 143, + 286 + ], + "score": 1.0, + "content": "1999.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 504, + 315 + ], + "lines": [ + { + "bbox": [ + 106, + 292, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 106, + 292, + 505, + 305 + ], + "score": 1.0, + "content": "Remi Munos and Csaba Szepesv ´ ari. Finite-time bounds for fitted value iteration. ´ Journal of Machine", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 303, + 295, + 315 + ], + "spans": [ + { + "bbox": [ + 116, + 303, + 295, + 315 + ], + "score": 1.0, + "content": "Learning Research, 9(May):815–857, 2008.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 322, + 503, + 345 + ], + "lines": [ + { + "bbox": [ + 105, + 321, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 505, + 336 + ], + "score": 1.0, + "content": "Dirk Ormoneit and Saunak Sen. Kernel-based reinforcement learning. ´ Machine learning, 49(2-3):", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 117, + 334, + 181, + 346 + ], + "spans": [ + { + "bbox": [ + 117, + 334, + 181, + 346 + ], + "score": 1.0, + "content": "161–178, 2002.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 352, + 503, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 366 + ], + "score": 1.0, + "content": "Doina Precup. Eligibility traces for off-policy policy evaluation. Computer Science Department", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 362, + 284, + 376 + ], + "spans": [ + { + "bbox": [ + 116, + 362, + 284, + 376 + ], + "score": 1.0, + "content": "Faculty Publication Series, pp. 80, 2000.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 108, + 381, + 504, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 382, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 106, + 382, + 505, + 394 + ], + "score": 1.0, + "content": "Stephane Ross and Drew Bagnell. Agnostic system identification for model-based reinforcement ´", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 393, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 116, + 393, + 505, + 405 + ], + "score": 1.0, + "content": "learning. In Proceedings of the 29th International Conference on Machine Learning, ICML 2012,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 404, + 424, + 416 + ], + "spans": [ + { + "bbox": [ + 116, + 404, + 424, + 416 + ], + "score": 1.0, + "content": "Edinburgh, Scotland, UK, June 26 - July 1, 2012. icml.cc / Omnipress, 2012.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 105, + 420, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 437 + ], + "score": 1.0, + "content": "Wen Sun, Arun Venkatraman, Geoffrey J Gordon, Byron Boots, and J Andrew Bagnell. Deeply ag-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 433, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 116, + 433, + 505, + 447 + ], + "score": 1.0, + "content": "grevated: Differentiable imitation learning for sequential prediction. In International Conference", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 444, + 298, + 457 + ], + "spans": [ + { + "bbox": [ + 116, + 444, + 298, + 457 + ], + "score": 1.0, + "content": "on Machine Learning, pp. 3309–3318, 2017.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 462, + 503, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "Csaba Szepesvari and R ´ emi Munos. Finite time bounds for sampling based fitted value iteration. In ´", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 474, + 484, + 487 + ], + "spans": [ + { + "bbox": [ + 116, + 474, + 484, + 487 + ], + "score": 1.0, + "content": "Proceedings of the 22nd international conference on Machine learning, pp. 880–887, 2005.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 106, + 491, + 503, + 515 + ], + "lines": [ + { + "bbox": [ + 106, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "Philip Thomas and Emma Brunskill. Data-efficient off-policy policy evaluation for reinforcement", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 503, + 450, + 515 + ], + "spans": [ + { + "bbox": [ + 115, + 503, + 450, + 515 + ], + "score": 1.0, + "content": "learning. In International Conference on Machine Learning, pp. 2139–2148, 2016.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 106, + 521, + 503, + 545 + ], + "lines": [ + { + "bbox": [ + 105, + 520, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 505, + 535 + ], + "score": 1.0, + "content": "Philip S. Thomas. Safe reinforcement learning. PhD thesis, University of Massachusetts, Amherst,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 114, + 531, + 143, + 545 + ], + "spans": [ + { + "bbox": [ + 114, + 531, + 143, + 545 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 105, + 550, + 504, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "Philip S Thomas, Georgios Theocharous, and Mohammad Ghavamzadeh. High-confidence off-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 562, + 457, + 576 + ], + "spans": [ + { + "bbox": [ + 115, + 562, + 457, + 576 + ], + "score": 1.0, + "content": "policy evaluation. In Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 106, + 580, + 504, + 614 + ], + "lines": [ + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "score": 1.0, + "content": "Philip S. Thomas, Bruno Castro da Silva, Andrew G. Barto, Stephen Giguere, Yuriy Brun, and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 592, + 505, + 604 + ], + "spans": [ + { + "bbox": [ + 116, + 592, + 505, + 604 + ], + "score": 1.0, + "content": "Emma Brunskill. Preventing undesirable behavior of intelligent machines. Science, 366(6468):", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 602, + 385, + 615 + ], + "spans": [ + { + "bbox": [ + 115, + 602, + 385, + 615 + ], + "score": 1.0, + "content": "999–1004, 2019. ISSN 0036-8075. doi: 10.1126/science.aag3311.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 106, + 620, + 502, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 503, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 503, + 633 + ], + "score": 1.0, + "content": "Samuele Tosatto, Matteo Pirotta, Carlo d’Eramo, and Marcello Restelli. Boosted fitted q-iteration.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 632, + 444, + 644 + ], + "spans": [ + { + "bbox": [ + 115, + 632, + 444, + 644 + ], + "score": 1.0, + "content": "In International Conference on Machine Learning, pp. 3434–3443. PMLR, 2017.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 106, + 650, + 504, + 673 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 482, + 664 + ], + "score": 1.0, + "content": "Joel A Tropp. An introduction to matrix concentration inequalities. Foundations and Trends", + "type": "text" + }, + { + "bbox": [ + 483, + 651, + 493, + 662 + ], + "score": 0.68, + "content": "\\textsuperscript { \\textregistered }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 649, + 506, + 664 + ], + "score": 1.0, + "content": "in", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 662, + 277, + 673 + ], + "spans": [ + { + "bbox": [ + 115, + 662, + 277, + 673 + ], + "score": 1.0, + "content": "Machine Learning, 8(1-2):1–230, 2015.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 106, + 680, + 504, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "J Tsitsiklis and B Van Roy. An analysis of temporal-difference learning with function approximation", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 691, + 468, + 704 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 468, + 704 + ], + "score": 1.0, + "content": "(technical report lids-p-2322). Laboratory for Information and Decision Systems, 1996.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 504, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 504, + 723 + ], + "score": 1.0, + "content": "Masatoshi Uehara and Nan Jiang. Minimax weight and q-function learning for off-policy evaluation.", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 720, + 279, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 279, + 732 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1910.12809, 2019.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5 + } + ], + "page_idx": 11, + "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": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Travis Mandel, Yun-En Liu, Sergey Levine, Emma Brunskill, and Zoran Popovic. Offline policy", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "evaluation across representations with applications to educational games. In AAMAS, pp. 1077–", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 166, + 115 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 166, + 115 + ], + "score": 1.0, + "content": "1084, 2014.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 505, + 115 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 122, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 122, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 135 + ], + "score": 1.0, + "content": "Shie Mannor and John N Tsitsiklis. The sample complexity of exploration in the multi-armed bandit", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 411, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 411, + 146 + ], + "score": 1.0, + "content": "problem. Journal of Machine Learning Research, 5(Jun):623–648, 2004.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 106, + 122, + 505, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 151, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A Rusu, Joel Veness, Marc G Belle-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 505, + 176 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 505, + 176 + ], + "score": 1.0, + "content": "mare, Alex Graves, Martin Riedmiller, Andreas K Fidjeland, Georg Ostrovski, et al. Human-level", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 174, + 421, + 187 + ], + "spans": [ + { + "bbox": [ + 115, + 174, + 421, + 187 + ], + "score": 1.0, + "content": "control through deep reinforcement learning. Nature, 518(7540):529, 2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 151, + 505, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 192, + 505, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "Wenlong Mou, Zheng Wen, and Xi Chen. On the sample complexity of reinforcement learning with", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 393, + 216 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 393, + 216 + ], + "score": 1.0, + "content": "policy space generalization. arXiv preprint arXiv:2008.07353, 2020.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 192, + 505, + 216 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 221, + 504, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 220, + 506, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 506, + 235 + ], + "score": 1.0, + "content": "Remi Munos. Error bounds for approximate policy iteration. In ´ ICML, volume 3, pp. 560–567,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 114, + 232, + 144, + 246 + ], + "spans": [ + { + "bbox": [ + 114, + 232, + 144, + 246 + ], + "score": 1.0, + "content": "2003.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 220, + 506, + 246 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 251, + 504, + 285 + ], + "lines": [ + { + "bbox": [ + 105, + 251, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 105, + 251, + 505, + 264 + ], + "score": 1.0, + "content": "Remi Munos and Andrew W Moore. Barycentric interpolators for continuous space and time re-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 262, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 115, + 262, + 505, + 276 + ], + "score": 1.0, + "content": "inforcement learning. In Advances in neural information processing systems, pp. 1024–1030,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 272, + 143, + 286 + ], + "spans": [ + { + "bbox": [ + 115, + 272, + 143, + 286 + ], + "score": 1.0, + "content": "1999.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 251, + 505, + 286 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 504, + 315 + ], + "lines": [ + { + "bbox": [ + 106, + 292, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 106, + 292, + 505, + 305 + ], + "score": 1.0, + "content": "Remi Munos and Csaba Szepesv ´ ari. Finite-time bounds for fitted value iteration. ´ Journal of Machine", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 303, + 295, + 315 + ], + "spans": [ + { + "bbox": [ + 116, + 303, + 295, + 315 + ], + "score": 1.0, + "content": "Learning Research, 9(May):815–857, 2008.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 106, + 292, + 505, + 315 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 322, + 503, + 345 + ], + "lines": [ + { + "bbox": [ + 105, + 321, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 505, + 336 + ], + "score": 1.0, + "content": "Dirk Ormoneit and Saunak Sen. Kernel-based reinforcement learning. ´ Machine learning, 49(2-3):", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 117, + 334, + 181, + 346 + ], + "spans": [ + { + "bbox": [ + 117, + 334, + 181, + 346 + ], + "score": 1.0, + "content": "161–178, 2002.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 321, + 505, + 346 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 352, + 503, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 351, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 505, + 366 + ], + "score": 1.0, + "content": "Doina Precup. Eligibility traces for off-policy policy evaluation. Computer Science Department", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 362, + 284, + 376 + ], + "spans": [ + { + "bbox": [ + 116, + 362, + 284, + 376 + ], + "score": 1.0, + "content": "Faculty Publication Series, pp. 80, 2000.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 351, + 505, + 376 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 381, + 504, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 382, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 106, + 382, + 505, + 394 + ], + "score": 1.0, + "content": "Stephane Ross and Drew Bagnell. Agnostic system identification for model-based reinforcement ´", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 393, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 116, + 393, + 505, + 405 + ], + "score": 1.0, + "content": "learning. In Proceedings of the 29th International Conference on Machine Learning, ICML 2012,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 404, + 424, + 416 + ], + "spans": [ + { + "bbox": [ + 116, + 404, + 424, + 416 + ], + "score": 1.0, + "content": "Edinburgh, Scotland, UK, June 26 - July 1, 2012. icml.cc / Omnipress, 2012.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 382, + 505, + 416 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 105, + 420, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 437 + ], + "score": 1.0, + "content": "Wen Sun, Arun Venkatraman, Geoffrey J Gordon, Byron Boots, and J Andrew Bagnell. Deeply ag-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 433, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 116, + 433, + 505, + 447 + ], + "score": 1.0, + "content": "grevated: Differentiable imitation learning for sequential prediction. In International Conference", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 444, + 298, + 457 + ], + "spans": [ + { + "bbox": [ + 116, + 444, + 298, + 457 + ], + "score": 1.0, + "content": "on Machine Learning, pp. 3309–3318, 2017.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 420, + 505, + 457 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 462, + 503, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "Csaba Szepesvari and R ´ emi Munos. Finite time bounds for sampling based fitted value iteration. In ´", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 474, + 484, + 487 + ], + "spans": [ + { + "bbox": [ + 116, + 474, + 484, + 487 + ], + "score": 1.0, + "content": "Proceedings of the 22nd international conference on Machine learning, pp. 880–887, 2005.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 106, + 463, + 505, + 487 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 491, + 503, + 515 + ], + "lines": [ + { + "bbox": [ + 106, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "Philip Thomas and Emma Brunskill. Data-efficient off-policy policy evaluation for reinforcement", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 503, + 450, + 515 + ], + "spans": [ + { + "bbox": [ + 115, + 503, + 450, + 515 + ], + "score": 1.0, + "content": "learning. In International Conference on Machine Learning, pp. 2139–2148, 2016.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 492, + 505, + 515 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 521, + 503, + 545 + ], + "lines": [ + { + "bbox": [ + 105, + 520, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 505, + 535 + ], + "score": 1.0, + "content": "Philip S. Thomas. Safe reinforcement learning. PhD thesis, University of Massachusetts, Amherst,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 114, + 531, + 143, + 545 + ], + "spans": [ + { + "bbox": [ + 114, + 531, + 143, + 545 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 520, + 505, + 545 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 550, + 504, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "Philip S Thomas, Georgios Theocharous, and Mohammad Ghavamzadeh. High-confidence off-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 562, + 457, + 576 + ], + "spans": [ + { + "bbox": [ + 115, + 562, + 457, + 576 + ], + "score": 1.0, + "content": "policy evaluation. In Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 106, + 551, + 505, + 576 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 580, + 504, + 614 + ], + "lines": [ + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "score": 1.0, + "content": "Philip S. Thomas, Bruno Castro da Silva, Andrew G. Barto, Stephen Giguere, Yuriy Brun, and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 592, + 505, + 604 + ], + "spans": [ + { + "bbox": [ + 116, + 592, + 505, + 604 + ], + "score": 1.0, + "content": "Emma Brunskill. Preventing undesirable behavior of intelligent machines. Science, 366(6468):", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 602, + 385, + 615 + ], + "spans": [ + { + "bbox": [ + 115, + 602, + 385, + 615 + ], + "score": 1.0, + "content": "999–1004, 2019. ISSN 0036-8075. doi: 10.1126/science.aag3311.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 106, + 581, + 505, + 615 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 620, + 502, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 503, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 503, + 633 + ], + "score": 1.0, + "content": "Samuele Tosatto, Matteo Pirotta, Carlo d’Eramo, and Marcello Restelli. Boosted fitted q-iteration.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 632, + 444, + 644 + ], + "spans": [ + { + "bbox": [ + 115, + 632, + 444, + 644 + ], + "score": 1.0, + "content": "In International Conference on Machine Learning, pp. 3434–3443. PMLR, 2017.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 106, + 621, + 503, + 644 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 650, + 504, + 673 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 482, + 664 + ], + "score": 1.0, + "content": "Joel A Tropp. An introduction to matrix concentration inequalities. Foundations and Trends", + "type": "text" + }, + { + "bbox": [ + 483, + 651, + 493, + 662 + ], + "score": 0.68, + "content": "\\textsuperscript { \\textregistered }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 649, + 506, + 664 + ], + "score": 1.0, + "content": "in", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 662, + 277, + 673 + ], + "spans": [ + { + "bbox": [ + 115, + 662, + 277, + 673 + ], + "score": 1.0, + "content": "Machine Learning, 8(1-2):1–230, 2015.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 649, + 506, + 673 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 680, + 504, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "J Tsitsiklis and B Van Roy. An analysis of temporal-difference learning with function approximation", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 691, + 468, + 704 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 468, + 704 + ], + "score": 1.0, + "content": "(technical report lids-p-2322). Laboratory for Information and Decision Systems, 1996.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 678, + 505, + 704 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 504, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 504, + 723 + ], + "score": 1.0, + "content": "Masatoshi Uehara and Nan Jiang. Minimax weight and q-function learning for off-policy evaluation.", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 720, + 279, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 279, + 732 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1910.12809, 2019.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5, + "bbox_fs": [ + 106, + 708, + 504, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "Benjamin Van Roy. Feature-based methods for large scale dynamic programming. PhD thesis,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 299, + 105 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 299, + 105 + ], + "score": 1.0, + "content": "Massachusetts Institute of Technology, 1994.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 108, + 111, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 104, + 111, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 104, + 111, + 505, + 126 + ], + "score": 1.0, + "content": "L. Wang, Wei Zhang, Xiaofeng He, and H. Zha. Supervised reinforcement learning with recurrent", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "neural network for dynamic treatment recommendation. Proceedings of the 24th ACM SIGKDD", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 135, + 413, + 147 + ], + "spans": [ + { + "bbox": [ + 116, + 135, + 413, + 147 + ], + "score": 1.0, + "content": "International Conference on Knowledge Discovery & Data Mining, 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 105, + 153, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 153, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 153, + 505, + 166 + ], + "score": 1.0, + "content": "Ruosong Wang, Simon S Du, Lin F Yang, and Ruslan Salakhutdinov. On reward-free reinforcement", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 164, + 459, + 176 + ], + "spans": [ + { + "bbox": [ + 115, + 164, + 459, + 176 + ], + "score": 1.0, + "content": "learning with linear function approximation. arXiv preprint arXiv:2006.11274, 2020.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 109, + 182, + 504, + 216 + ], + "lines": [ + { + "bbox": [ + 107, + 183, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 107, + 183, + 505, + 195 + ], + "score": 1.0, + "content": "Yu-Xiang Wang, Alekh Agarwal, and Miroslav Dudık. Optimal and adaptive off-policy evaluation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 505, + 206 + ], + "score": 1.0, + "content": "in contextual bandits. In International Conference on Machine Learning, pp. 3589–3597. PMLR,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 143, + 217 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 143, + 217 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 503, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 238 + ], + "score": 1.0, + "content": "Yifan Wu, George Tucker, and Ofir Nachum. Behavior regularized offline reinforcement learning,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 234, + 421, + 248 + ], + "spans": [ + { + "bbox": [ + 116, + 234, + 350, + 248 + ], + "score": 1.0, + "content": "2020. URL https://openreview.net/forum?id", + "type": "text" + }, + { + "bbox": [ + 351, + 236, + 357, + 244 + ], + "score": 0.5, + "content": "{ . } = { }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 234, + 421, + 248 + ], + "score": 1.0, + "content": "BJg9hTNKPH.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 503, + 276 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "Tengyang Xie and Nan Jiang. Batch value-function approximation with only realizability. arXiv", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 265, + 259, + 277 + ], + "spans": [ + { + "bbox": [ + 115, + 265, + 259, + 277 + ], + "score": 1.0, + "content": "preprint arXiv:2008.04990, 2020a.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 283, + 503, + 307 + ], + "lines": [ + { + "bbox": [ + 106, + 283, + 505, + 296 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 237, + 296 + ], + "score": 1.0, + "content": "Tengyang Xie and Nan Jiang.", + "type": "text" + }, + { + "bbox": [ + 237, + 284, + 252, + 295 + ], + "score": 0.87, + "content": "Q ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 283, + 505, + 296 + ], + "score": 1.0, + "content": "approximation schemes for batch reinforcement learning: A", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 294, + 380, + 307 + ], + "spans": [ + { + "bbox": [ + 116, + 294, + 380, + 307 + ], + "score": 1.0, + "content": "theoretical comparison. arXiv preprint arXiv:2003.03924, 2020b.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 505, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 232, + 326 + ], + "score": 1.0, + "content": "Tengyang Xie, Yifei Ma, and", + "type": "text" + }, + { + "bbox": [ + 232, + 314, + 245, + 324 + ], + "score": 0.26, + "content": "\\mathrm { Y u }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "-Xiang Wang. Towards optimal off-policy evaluation for rein-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 325, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 116, + 325, + 505, + 337 + ], + "score": 1.0, + "content": "forcement learning with marginalized importance sampling. In Advances in Neural Information", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 335, + 288, + 348 + ], + "spans": [ + { + "bbox": [ + 116, + 335, + 288, + 348 + ], + "score": 1.0, + "content": "Processing Systems, pp. 9668–9678, 2019.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 354, + 504, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 506, + 367 + ], + "score": 1.0, + "content": "C. Yu, G. Ren, and J. Liu. Deep inverse reinforcement learning for sepsis treatment. In 2019 IEEE", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 365, + 419, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 365, + 419, + 378 + ], + "score": 1.0, + "content": "International Conference on Healthcare Informatics (ICHI), pp. 1–3, 2019.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 108, + 384, + 505, + 418 + ], + "lines": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "score": 1.0, + "content": "Andrea Zanette, Alessandro Lazaric, Mykel J Kochenderfer, and Emma Brunskill. Limiting ex-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 115, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "trapolation in linear approximate value iteration. In Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 406, + 243, + 419 + ], + "spans": [ + { + "bbox": [ + 116, + 406, + 243, + 419 + ], + "score": 1.0, + "content": "Systems, pp. 5616–5625, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + } + ], + "page_idx": 12, + "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, + 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": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "Benjamin Van Roy. Feature-based methods for large scale dynamic programming. PhD thesis,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 299, + 105 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 299, + 105 + ], + "score": 1.0, + "content": "Massachusetts Institute of Technology, 1994.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 506, + 105 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 111, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 104, + 111, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 104, + 111, + 505, + 126 + ], + "score": 1.0, + "content": "L. Wang, Wei Zhang, Xiaofeng He, and H. Zha. Supervised reinforcement learning with recurrent", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "neural network for dynamic treatment recommendation. Proceedings of the 24th ACM SIGKDD", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 135, + 413, + 147 + ], + "spans": [ + { + "bbox": [ + 116, + 135, + 413, + 147 + ], + "score": 1.0, + "content": "International Conference on Knowledge Discovery & Data Mining, 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 104, + 111, + 505, + 147 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 153, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 153, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 153, + 505, + 166 + ], + "score": 1.0, + "content": "Ruosong Wang, Simon S Du, Lin F Yang, and Ruslan Salakhutdinov. On reward-free reinforcement", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 164, + 459, + 176 + ], + "spans": [ + { + "bbox": [ + 115, + 164, + 459, + 176 + ], + "score": 1.0, + "content": "learning with linear function approximation. arXiv preprint arXiv:2006.11274, 2020.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 106, + 153, + 505, + 176 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 182, + 504, + 216 + ], + "lines": [ + { + "bbox": [ + 107, + 183, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 107, + 183, + 505, + 195 + ], + "score": 1.0, + "content": "Yu-Xiang Wang, Alekh Agarwal, and Miroslav Dudık. Optimal and adaptive off-policy evaluation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 505, + 206 + ], + "score": 1.0, + "content": "in contextual bandits. In International Conference on Machine Learning, pp. 3589–3597. PMLR,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 143, + 217 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 143, + 217 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 107, + 183, + 505, + 217 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 503, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 238 + ], + "score": 1.0, + "content": "Yifan Wu, George Tucker, and Ofir Nachum. Behavior regularized offline reinforcement learning,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 234, + 421, + 248 + ], + "spans": [ + { + "bbox": [ + 116, + 234, + 350, + 248 + ], + "score": 1.0, + "content": "2020. URL https://openreview.net/forum?id", + "type": "text" + }, + { + "bbox": [ + 351, + 236, + 357, + 244 + ], + "score": 0.5, + "content": "{ . } = { }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 234, + 421, + 248 + ], + "score": 1.0, + "content": "BJg9hTNKPH.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 222, + 505, + 248 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 503, + 276 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "Tengyang Xie and Nan Jiang. Batch value-function approximation with only realizability. arXiv", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 265, + 259, + 277 + ], + "spans": [ + { + "bbox": [ + 115, + 265, + 259, + 277 + ], + "score": 1.0, + "content": "preprint arXiv:2008.04990, 2020a.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 106, + 254, + 505, + 277 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 283, + 503, + 307 + ], + "lines": [ + { + "bbox": [ + 106, + 283, + 505, + 296 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 237, + 296 + ], + "score": 1.0, + "content": "Tengyang Xie and Nan Jiang.", + "type": "text" + }, + { + "bbox": [ + 237, + 284, + 252, + 295 + ], + "score": 0.87, + "content": "Q ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 283, + 505, + 296 + ], + "score": 1.0, + "content": "approximation schemes for batch reinforcement learning: A", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 294, + 380, + 307 + ], + "spans": [ + { + "bbox": [ + 116, + 294, + 380, + 307 + ], + "score": 1.0, + "content": "theoretical comparison. arXiv preprint arXiv:2003.03924, 2020b.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 106, + 283, + 505, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 505, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 232, + 326 + ], + "score": 1.0, + "content": "Tengyang Xie, Yifei Ma, and", + "type": "text" + }, + { + "bbox": [ + 232, + 314, + 245, + 324 + ], + "score": 0.26, + "content": "\\mathrm { Y u }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "-Xiang Wang. Towards optimal off-policy evaluation for rein-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 325, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 116, + 325, + 505, + 337 + ], + "score": 1.0, + "content": "forcement learning with marginalized importance sampling. In Advances in Neural Information", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 335, + 288, + 348 + ], + "spans": [ + { + "bbox": [ + 116, + 335, + 288, + 348 + ], + "score": 1.0, + "content": "Processing Systems, pp. 9668–9678, 2019.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 313, + 505, + 348 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 354, + 504, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 354, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 506, + 367 + ], + "score": 1.0, + "content": "C. Yu, G. Ren, and J. Liu. Deep inverse reinforcement learning for sepsis treatment. In 2019 IEEE", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 365, + 419, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 365, + 419, + 378 + ], + "score": 1.0, + "content": "International Conference on Healthcare Informatics (ICHI), pp. 1–3, 2019.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 106, + 354, + 506, + 378 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 384, + 505, + 418 + ], + "lines": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 505, + 397 + ], + "score": 1.0, + "content": "Andrea Zanette, Alessandro Lazaric, Mykel J Kochenderfer, and Emma Brunskill. Limiting ex-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 115, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "trapolation in linear approximate value iteration. In Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 406, + 243, + 419 + ], + "spans": [ + { + "bbox": [ + 116, + 406, + 243, + 419 + ], + "score": 1.0, + "content": "Systems, pp. 5616–5625, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 383, + 505, + 419 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 244, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 244, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 244, + 95 + ], + "score": 1.0, + "content": "A PROOF OF LEMMA 4.2", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 105, + 504, + 129 + ], + "lines": [ + { + "bbox": [ + 105, + 104, + 506, + 120 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 197, + 120 + ], + "score": 1.0, + "content": "Proof. We first verify", + "type": "text" + }, + { + "bbox": [ + 197, + 106, + 211, + 118 + ], + "score": 0.89, + "content": "Q ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 104, + 296, + 120 + ], + "score": 1.0, + "content": "is linear for the first", + "type": "text" + }, + { + "bbox": [ + 297, + 106, + 325, + 117 + ], + "score": 0.86, + "content": "H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 104, + 394, + 120 + ], + "score": 1.0, + "content": "levels. For each", + "type": "text" + }, + { + "bbox": [ + 394, + 104, + 487, + 118 + ], + "score": 0.92, + "content": "( h , c ) \\in [ H - 1 ] \\times [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 104, + 506, + 120 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 114, + 130, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 114, + 130, + 131 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 131, + 493, + 149 + ], + "lines": [ + { + "bbox": [ + 117, + 131, + 493, + 149 + ], + "spans": [ + { + "bbox": [ + 117, + 131, + 493, + 149 + ], + "score": 0.9, + "content": "Q _ { h } ^ { \\pi } ( s _ { h } ^ { c } , a _ { 1 } ) = R ( s _ { h } ^ { c } , a _ { 1 } ) + R ( s _ { h + 1 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + \\ldots + R ( s _ { H } ^ { \\hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } .", + "type": "interline_equation", + "image_path": "20e2f82f083315c34a6372cfc8601eda3bdec13111334ef8f8e4d716070da026.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 117, + 131, + 493, + 149 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 159, + 207, + 171 + ], + "lines": [ + { + "bbox": [ + 105, + 157, + 207, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 177, + 172 + ], + "score": 1.0, + "content": "Moreover, for all", + "type": "text" + }, + { + "bbox": [ + 177, + 160, + 203, + 169 + ], + "score": 0.93, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 157, + 207, + 172 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 174, + 504, + 193 + ], + "lines": [ + { + "bbox": [ + 111, + 174, + 504, + 193 + ], + "spans": [ + { + "bbox": [ + 111, + 174, + 504, + 193 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { Q } _ { h } ^ { \\pi } ( s _ { h } ^ { \\hat { d } + 1 } , a ) = R ( s _ { h } ^ { \\hat { d } + 1 } , a ) + R ( s _ { h + 1 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + . . . + R ( s _ { H } ^ { \\hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \\cdot \\hat { d } ^ { ( H - h + 1 ) / 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "26a6565e194fb4e7d4ad7047fd0657ab1f85ed87efc1665e0a2724854b375ea3.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 111, + 174, + 504, + 193 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 202, + 200, + 214 + ], + "lines": [ + { + "bbox": [ + 106, + 201, + 200, + 214 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 200, + 214 + ], + "score": 1.0, + "content": "Therefore, if we define", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 218, + 412, + 254 + ], + "lines": [ + { + "bbox": [ + 198, + 218, + 412, + 254 + ], + "spans": [ + { + "bbox": [ + 198, + 218, + 412, + 254 + ], + "score": 0.93, + "content": "\\boldsymbol { \\theta } _ { h } ^ { \\pi } = \\sum _ { c = 1 } ^ { \\hat { d } } \\boldsymbol { r } _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } \\cdot \\boldsymbol { e } _ { c } + \\sum _ { c = 1 } ^ { \\hat { d } } Q _ { h } ^ { \\pi } ( s _ { h } ^ { c } , a _ { 2 } ) \\cdot \\boldsymbol { e } _ { c + \\hat { d } } ,", + "type": "interline_equation", + "image_path": "54fcd2dd6f55180ccd68f147b6e964775504c997fdce54bc2f950525a174eb3e.jpg" + } + ] + } + ], + "index": 7.5, + "virtual_lines": [ + { + "bbox": [ + 198, + 218, + 412, + 236.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 198, + 236.0, + 412, + 254.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 259, + 328, + 274 + ], + "lines": [ + { + "bbox": [ + 105, + 258, + 325, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 126, + 276 + ], + "score": 1.0, + "content": "then", + "type": "text" + }, + { + "bbox": [ + 126, + 259, + 230, + 274 + ], + "score": 0.93, + "content": "Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 258, + 259, + 276 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 259, + 261, + 325, + 273 + ], + "score": 0.9, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A }", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 505, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 278, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 203, + 293 + ], + "score": 1.0, + "content": "Now we verify that the", + "type": "text" + }, + { + "bbox": [ + 204, + 281, + 212, + 292 + ], + "score": 0.85, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 278, + 422, + 293 + ], + "score": 1.0, + "content": "-function is linear for the last level. Clearly, for all", + "type": "text" + }, + { + "bbox": [ + 422, + 279, + 453, + 293 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 278, + 472, + 293 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 472, + 280, + 501, + 291 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 278, + 505, + 293 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 288, + 508, + 314 + ], + "spans": [ + { + "bbox": [ + 107, + 295, + 178, + 308 + ], + "score": 0.9, + "content": "Q _ { H } ^ { \\pi } ( s _ { H } ^ { c } , a ) = r _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 288, + 199, + 314 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 199, + 292, + 302, + 308 + ], + "score": 0.92, + "content": "Q _ { H } ^ { \\pi } ( s _ { H } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot \\sqrt { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 288, + 381, + 314 + ], + "score": 1.0, + "content": ". Thus by defining", + "type": "text" + }, + { + "bbox": [ + 381, + 293, + 464, + 309 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\theta _ { H } ^ { \\pi } = \\sum _ { c = 1 } ^ { d } r _ { 0 } \\cdot e _ { c } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 288, + 508, + 314 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 308, + 316, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 214, + 322 + ], + "score": 0.91, + "content": "Q _ { H } ^ { \\pi } ( s , a ) = \\left( \\theta _ { H } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 308, + 243, + 322 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 243, + 309, + 312, + 322 + ], + "score": 0.89, + "content": "( s , a ) \\in { \\cal S } _ { H } \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 308, + 316, + 322 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 108, + 353, + 244, + 367 + ], + "lines": [ + { + "bbox": [ + 105, + 353, + 245, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 245, + 368 + ], + "score": 1.0, + "content": "B A TECHNICAL LEMMA", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 378, + 372, + 390 + ], + "lines": [ + { + "bbox": [ + 106, + 378, + 372, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 372, + 392 + ], + "score": 1.0, + "content": "We need the following lemma in the proof of our hardness results.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 393, + 506, + 438 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 372, + 406 + ], + "score": 1.0, + "content": "Lemma B.1. Let α be a random variable uniformly distributed on", + "type": "text" + }, + { + "bbox": [ + 373, + 393, + 414, + 405 + ], + "score": 0.92, + "content": "\\{ \\alpha _ { + } , \\alpha _ { - } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 393, + 444, + 406 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 444, + 393, + 487, + 405 + ], + "score": 0.92, + "content": "\\alpha _ { - } = 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 393, + 506, + 406 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 404, + 506, + 418 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 169, + 416 + ], + "score": 0.91, + "content": "\\alpha _ { + } = 1 / 2 + \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 404, + 191, + 418 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 191, + 405, + 239, + 415 + ], + "score": 0.89, + "content": "0 < \\varepsilon < 1", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 404, + 300, + 418 + ], + "score": 1.0, + "content": ". Suppose that", + "type": "text" + }, + { + "bbox": [ + 300, + 405, + 357, + 416 + ], + "score": 0.92, + "content": "\\xi _ { 1 } , \\xi _ { 2 } , \\ldots , \\xi _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 404, + 399, + 418 + ], + "score": 1.0, + "content": "are i.i.d.", + "type": "text" + }, + { + "bbox": [ + 399, + 405, + 439, + 416 + ], + "score": 0.9, + "content": "\\{ + 1 , - 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 404, + 506, + 418 + ], + "score": 1.0, + "content": "-valued random", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 166, + 428 + ], + "score": 1.0, + "content": "variables with", + "type": "text" + }, + { + "bbox": [ + 166, + 416, + 237, + 427 + ], + "score": 0.89, + "content": "\\operatorname* { P r } [ \\xi _ { i } = + 1 ] = \\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 415, + 265, + 428 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 265, + 416, + 295, + 428 + ], + "score": 0.92, + "content": "i \\in [ m ]", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 415, + 316, + 428 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 316, + 416, + 323, + 427 + ], + "score": 0.83, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 415, + 399, + 428 + ], + "score": 1.0, + "content": "be a function from", + "type": "text" + }, + { + "bbox": [ + 400, + 416, + 448, + 428 + ], + "score": 0.87, + "content": "\\bar { \\{ + 1 , - 1 \\} } ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 415, + 460, + 428 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 460, + 416, + 501, + 428 + ], + "score": 0.9, + "content": "\\{ \\alpha _ { + } , \\alpha _ { - } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 415, + 505, + 428 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 426, + 357, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 142, + 439 + ], + "score": 1.0, + "content": "Suppose", + "type": "text" + }, + { + "bbox": [ + 142, + 427, + 225, + 439 + ], + "score": 0.87, + "content": "m \\le C / \\varepsilon ^ { 2 } \\log ( 1 / \\delta )", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 426, + 320, + 439 + ], + "score": 1.0, + "content": "for some fixed constant", + "type": "text" + }, + { + "bbox": [ + 321, + 428, + 329, + 437 + ], + "score": 0.81, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 426, + 357, + 439 + ], + "score": 1.0, + "content": ". Then", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5 + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 443, + 369, + 457 + ], + "lines": [ + { + "bbox": [ + 241, + 443, + 369, + 457 + ], + "spans": [ + { + "bbox": [ + 241, + 443, + 369, + 457 + ], + "score": 0.9, + "content": "\\operatorname* { P r } [ f ( \\xi _ { 1 } , \\xi _ { 2 } , \\ldots , \\xi _ { m } ) \\neq \\alpha ] > \\delta .", + "type": "interline_equation", + "image_path": "8baf597341492de00e54fb80d5764f5c6ea5b5799a08174e53a081bb1892c63c.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 241, + 443, + 369, + 457 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 466, + 505, + 501 + ], + "lines": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "score": 1.0, + "content": "To our best knowledge, Lemma B.1 was first proved in (Chernoff, 1972) and has enormous ap-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 478, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 492 + ], + "score": 1.0, + "content": "plications in statistical learning theory (see, e.g., Chapter 5 in (Anthony & Bartlett, 2009)) and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 488, + 255, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 255, + 501 + ], + "score": 1.0, + "content": "bandits (Mannor & Tsitsiklis, 2004).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 506, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 505, + 518 + ], + "score": 1.0, + "content": "To prove Lemma B.1, one can first prove that the maximum likelihood estimator (MLE) is optimal", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 244, + 530 + ], + "score": 1.0, + "content": "and then show that MLE requires", + "type": "text" + }, + { + "bbox": [ + 244, + 516, + 315, + 529 + ], + "score": 0.92, + "content": "\\dot { \\Omega ( 1 / \\varepsilon ^ { 2 } \\log ( 1 / \\delta ) ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 517, + 429, + 530 + ], + "score": 1.0, + "content": "samples to correctly output", + "type": "text" + }, + { + "bbox": [ + 429, + 519, + 437, + 527 + ], + "score": 0.79, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "with probability", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 527, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 130, + 539 + ], + "score": 0.86, + "content": "1 - \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 527, + 506, + 542 + ], + "score": 1.0, + "content": "by anti-concentration. Lemma B.1 can also be proved by using information theory. See, e.g.,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 539, + 273, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 539, + 273, + 551 + ], + "score": 1.0, + "content": "(Kaufmann et al., 2016) for such a proof.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5 + }, + { + "type": "title", + "bbox": [ + 108, + 566, + 269, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 565, + 271, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 271, + 581 + ], + "score": 1.0, + "content": "C ANOTHER HARD INSTANCE", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 591, + 506, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 591, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 505, + 603 + ], + "score": 1.0, + "content": "In this section, we present another hard case under a weaker version of Assumption 1. Here the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 603, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 603, + 505, + 614 + ], + "score": 1.0, + "content": "transition operator is stochastic and the reward is deterministic and sparse, meaning that the reward", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 610, + 507, + 630 + ], + "spans": [ + { + "bbox": [ + 104, + 610, + 398, + 630 + ], + "score": 1.0, + "content": "value is non-zero only for the last level. Moreover, the data distributions", + "type": "text" + }, + { + "bbox": [ + 398, + 613, + 435, + 626 + ], + "score": 0.93, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 610, + 507, + 630 + ], + "score": 1.0, + "content": "are induced by a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 623, + 506, + 638 + ], + "spans": [ + { + "bbox": [ + 104, + 623, + 156, + 638 + ], + "score": 1.0, + "content": "fixed policy", + "type": "text" + }, + { + "bbox": [ + 156, + 626, + 179, + 636 + ], + "score": 0.86, + "content": "\\pi _ { \\mathrm { d a t a } }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 623, + 506, + 638 + ], + "score": 1.0, + "content": ". We also illustrate the construction in Figure 2. Throughout this section, we use", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 635, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 113, + 647 + ], + "score": 0.76, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 636, + 314, + 649 + ], + "score": 1.0, + "content": "the denote the feature dimension, and we assume", + "type": "text" + }, + { + "bbox": [ + 315, + 637, + 321, + 647 + ], + "score": 0.79, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 636, + 487, + 649 + ], + "score": 1.0, + "content": "is an even integer for simplicity. We use", + "type": "text" + }, + { + "bbox": [ + 487, + 635, + 494, + 647 + ], + "score": 0.84, + "content": "\\hat { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 636, + 505, + 649 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 648, + 173, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 135, + 660 + ], + "score": 1.0, + "content": "denote", + "type": "text" + }, + { + "bbox": [ + 136, + 648, + 169, + 660 + ], + "score": 0.91, + "content": "d / 2 - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 648, + 173, + 660 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 664, + 504, + 687 + ], + "lines": [ + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "score": 1.0, + "content": "In this section, we adopt the following realizability assumption, which is a weaker version of As-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 675, + 157, + 688 + ], + "spans": [ + { + "bbox": [ + 104, + 675, + 157, + 688 + ], + "score": 1.0, + "content": "sumption 1.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 106, + 690, + 502, + 714 + ], + "lines": [ + { + "bbox": [ + 106, + 689, + 505, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 302, + 704 + ], + "score": 1.0, + "content": "Assumption 5 (Realizability). For the policy", + "type": "text" + }, + { + "bbox": [ + 302, + 690, + 380, + 702 + ], + "score": 0.9, + "content": "\\pi : { \\mathcal { S } } \\to \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 689, + 505, + 704 + ], + "score": 1.0, + "content": "to be evaluated, there exists", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 700, + 356, + 715 + ], + "spans": [ + { + "bbox": [ + 107, + 701, + 171, + 713 + ], + "score": 0.91, + "content": "\\theta _ { 1 } , \\ldots \\theta _ { H } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 700, + 238, + 715 + ], + "score": 1.0, + "content": "such that for all", + "type": "text" + }, + { + "bbox": [ + 239, + 702, + 300, + 714 + ], + "score": 0.91, + "content": "( s , a ) \\in S \\times A", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 700, + 319, + 715 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 319, + 702, + 352, + 714 + ], + "score": 0.91, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 700, + 356, + 715 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "interline_equation", + "bbox": [ + 259, + 718, + 351, + 733 + ], + "lines": [ + { + "bbox": [ + 259, + 718, + 351, + 733 + ], + "spans": [ + { + "bbox": [ + 259, + 718, + 351, + 733 + ], + "score": 0.9, + "content": "Q _ { h } ^ { \\pi } ( s , a ) = \\theta _ { h } ^ { \\top } \\phi ( s , a ) .", + "type": "interline_equation", + "image_path": "2e666fecfb6843e53103f4f01884c24aa399a2704cbf00af3317a8f5f1923b4b.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 259, + 718, + 351, + 733 + ], + "spans": [], + "index": 38 + } + ] + } + ], + "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" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 327, + 505, + 337 + ], + "lines": [ + { + "bbox": [ + 495, + 328, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 495, + 328, + 505, + 338 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 244, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 244, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 244, + 95 + ], + "score": 1.0, + "content": "A PROOF OF LEMMA 4.2", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 105, + 504, + 129 + ], + "lines": [ + { + "bbox": [ + 105, + 104, + 506, + 120 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 197, + 120 + ], + "score": 1.0, + "content": "Proof. We first verify", + "type": "text" + }, + { + "bbox": [ + 197, + 106, + 211, + 118 + ], + "score": 0.89, + "content": "Q ^ { \\pi }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 104, + 296, + 120 + ], + "score": 1.0, + "content": "is linear for the first", + "type": "text" + }, + { + "bbox": [ + 297, + 106, + 325, + 117 + ], + "score": 0.86, + "content": "H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 104, + 394, + 120 + ], + "score": 1.0, + "content": "levels. For each", + "type": "text" + }, + { + "bbox": [ + 394, + 104, + 487, + 118 + ], + "score": 0.92, + "content": "( h , c ) \\in [ H - 1 ] \\times [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 104, + 506, + 120 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 114, + 130, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 114, + 130, + 131 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 104, + 104, + 506, + 131 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 131, + 493, + 149 + ], + "lines": [ + { + "bbox": [ + 117, + 131, + 493, + 149 + ], + "spans": [ + { + "bbox": [ + 117, + 131, + 493, + 149 + ], + "score": 0.9, + "content": "Q _ { h } ^ { \\pi } ( s _ { h } ^ { c } , a _ { 1 } ) = R ( s _ { h } ^ { c } , a _ { 1 } ) + R ( s _ { h + 1 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + \\ldots + R ( s _ { H } ^ { \\hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } .", + "type": "interline_equation", + "image_path": "20e2f82f083315c34a6372cfc8601eda3bdec13111334ef8f8e4d716070da026.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 117, + 131, + 493, + 149 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 159, + 207, + 171 + ], + "lines": [ + { + "bbox": [ + 105, + 157, + 207, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 177, + 172 + ], + "score": 1.0, + "content": "Moreover, for all", + "type": "text" + }, + { + "bbox": [ + 177, + 160, + 203, + 169 + ], + "score": 0.93, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 157, + 207, + 172 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 157, + 207, + 172 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 174, + 504, + 193 + ], + "lines": [ + { + "bbox": [ + 111, + 174, + 504, + 193 + ], + "spans": [ + { + "bbox": [ + 111, + 174, + 504, + 193 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { Q } _ { h } ^ { \\pi } ( s _ { h } ^ { \\hat { d } + 1 } , a ) = R ( s _ { h } ^ { \\hat { d } + 1 } , a ) + R ( s _ { h + 1 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + . . . + R ( s _ { H } ^ { \\hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \\cdot \\hat { d } ^ { ( H - h + 1 ) / 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "26a6565e194fb4e7d4ad7047fd0657ab1f85ed87efc1665e0a2724854b375ea3.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 111, + 174, + 504, + 193 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 202, + 200, + 214 + ], + "lines": [ + { + "bbox": [ + 106, + 201, + 200, + 214 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 200, + 214 + ], + "score": 1.0, + "content": "Therefore, if we define", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 201, + 200, + 214 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 218, + 412, + 254 + ], + "lines": [ + { + "bbox": [ + 198, + 218, + 412, + 254 + ], + "spans": [ + { + "bbox": [ + 198, + 218, + 412, + 254 + ], + "score": 0.93, + "content": "\\boldsymbol { \\theta } _ { h } ^ { \\pi } = \\sum _ { c = 1 } ^ { \\hat { d } } \\boldsymbol { r } _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } \\cdot \\boldsymbol { e } _ { c } + \\sum _ { c = 1 } ^ { \\hat { d } } Q _ { h } ^ { \\pi } ( s _ { h } ^ { c } , a _ { 2 } ) \\cdot \\boldsymbol { e } _ { c + \\hat { d } } ,", + "type": "interline_equation", + "image_path": "54fcd2dd6f55180ccd68f147b6e964775504c997fdce54bc2f950525a174eb3e.jpg" + } + ] + } + ], + "index": 7.5, + "virtual_lines": [ + { + "bbox": [ + 198, + 218, + 412, + 236.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 198, + 236.0, + 412, + 254.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 259, + 328, + 274 + ], + "lines": [ + { + "bbox": [ + 105, + 258, + 325, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 126, + 276 + ], + "score": 1.0, + "content": "then", + "type": "text" + }, + { + "bbox": [ + 126, + 259, + 230, + 274 + ], + "score": 0.93, + "content": "Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 258, + 259, + 276 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 259, + 261, + 325, + 273 + ], + "score": 0.9, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A }", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 258, + 325, + 276 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 279, + 505, + 322 + ], + "lines": [ + { + "bbox": [ + 105, + 278, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 203, + 293 + ], + "score": 1.0, + "content": "Now we verify that the", + "type": "text" + }, + { + "bbox": [ + 204, + 281, + 212, + 292 + ], + "score": 0.85, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 278, + 422, + 293 + ], + "score": 1.0, + "content": "-function is linear for the last level. Clearly, for all", + "type": "text" + }, + { + "bbox": [ + 422, + 279, + 453, + 293 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 278, + 472, + 293 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 472, + 280, + 501, + 291 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 278, + 505, + 293 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 288, + 508, + 314 + ], + "spans": [ + { + "bbox": [ + 107, + 295, + 178, + 308 + ], + "score": 0.9, + "content": "Q _ { H } ^ { \\pi } ( s _ { H } ^ { c } , a ) = r _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 288, + 199, + 314 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 199, + 292, + 302, + 308 + ], + "score": 0.92, + "content": "Q _ { H } ^ { \\pi } ( s _ { H } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot \\sqrt { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 288, + 381, + 314 + ], + "score": 1.0, + "content": ". Thus by defining", + "type": "text" + }, + { + "bbox": [ + 381, + 293, + 464, + 309 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\theta _ { H } ^ { \\pi } = \\sum _ { c = 1 } ^ { d } r _ { 0 } \\cdot e _ { c } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 288, + 508, + 314 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 308, + 316, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 214, + 322 + ], + "score": 0.91, + "content": "Q _ { H } ^ { \\pi } ( s , a ) = \\left( \\theta _ { H } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 308, + 243, + 322 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 243, + 309, + 312, + 322 + ], + "score": 0.89, + "content": "( s , a ) \\in { \\cal S } _ { H } \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 308, + 316, + 322 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 278, + 508, + 322 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 353, + 244, + 367 + ], + "lines": [ + { + "bbox": [ + 105, + 353, + 245, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 245, + 368 + ], + "score": 1.0, + "content": "B A TECHNICAL LEMMA", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 378, + 372, + 390 + ], + "lines": [ + { + "bbox": [ + 106, + 378, + 372, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 372, + 392 + ], + "score": 1.0, + "content": "We need the following lemma in the proof of our hardness results.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 378, + 372, + 392 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 393, + 506, + 438 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 372, + 406 + ], + "score": 1.0, + "content": "Lemma B.1. Let α be a random variable uniformly distributed on", + "type": "text" + }, + { + "bbox": [ + 373, + 393, + 414, + 405 + ], + "score": 0.92, + "content": "\\{ \\alpha _ { + } , \\alpha _ { - } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 393, + 444, + 406 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 444, + 393, + 487, + 405 + ], + "score": 0.92, + "content": "\\alpha _ { - } = 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 393, + 506, + 406 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 404, + 506, + 418 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 169, + 416 + ], + "score": 0.91, + "content": "\\alpha _ { + } = 1 / 2 + \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 404, + 191, + 418 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 191, + 405, + 239, + 415 + ], + "score": 0.89, + "content": "0 < \\varepsilon < 1", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 404, + 300, + 418 + ], + "score": 1.0, + "content": ". Suppose that", + "type": "text" + }, + { + "bbox": [ + 300, + 405, + 357, + 416 + ], + "score": 0.92, + "content": "\\xi _ { 1 } , \\xi _ { 2 } , \\ldots , \\xi _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 404, + 399, + 418 + ], + "score": 1.0, + "content": "are i.i.d.", + "type": "text" + }, + { + "bbox": [ + 399, + 405, + 439, + 416 + ], + "score": 0.9, + "content": "\\{ + 1 , - 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 404, + 506, + 418 + ], + "score": 1.0, + "content": "-valued random", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 166, + 428 + ], + "score": 1.0, + "content": "variables with", + "type": "text" + }, + { + "bbox": [ + 166, + 416, + 237, + 427 + ], + "score": 0.89, + "content": "\\operatorname* { P r } [ \\xi _ { i } = + 1 ] = \\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 415, + 265, + 428 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 265, + 416, + 295, + 428 + ], + "score": 0.92, + "content": "i \\in [ m ]", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 415, + 316, + 428 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 316, + 416, + 323, + 427 + ], + "score": 0.83, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 415, + 399, + 428 + ], + "score": 1.0, + "content": "be a function from", + "type": "text" + }, + { + "bbox": [ + 400, + 416, + 448, + 428 + ], + "score": 0.87, + "content": "\\bar { \\{ + 1 , - 1 \\} } ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 415, + 460, + 428 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 460, + 416, + 501, + 428 + ], + "score": 0.9, + "content": "\\{ \\alpha _ { + } , \\alpha _ { - } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 415, + 505, + 428 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 426, + 357, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 142, + 439 + ], + "score": 1.0, + "content": "Suppose", + "type": "text" + }, + { + "bbox": [ + 142, + 427, + 225, + 439 + ], + "score": 0.87, + "content": "m \\le C / \\varepsilon ^ { 2 } \\log ( 1 / \\delta )", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 426, + 320, + 439 + ], + "score": 1.0, + "content": "for some fixed constant", + "type": "text" + }, + { + "bbox": [ + 321, + 428, + 329, + 437 + ], + "score": 0.81, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 426, + 357, + 439 + ], + "score": 1.0, + "content": ". Then", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 393, + 506, + 439 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 443, + 369, + 457 + ], + "lines": [ + { + "bbox": [ + 241, + 443, + 369, + 457 + ], + "spans": [ + { + "bbox": [ + 241, + 443, + 369, + 457 + ], + "score": 0.9, + "content": "\\operatorname* { P r } [ f ( \\xi _ { 1 } , \\xi _ { 2 } , \\ldots , \\xi _ { m } ) \\neq \\alpha ] > \\delta .", + "type": "interline_equation", + "image_path": "8baf597341492de00e54fb80d5764f5c6ea5b5799a08174e53a081bb1892c63c.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 241, + 443, + 369, + 457 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 466, + 505, + 501 + ], + "lines": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "score": 1.0, + "content": "To our best knowledge, Lemma B.1 was first proved in (Chernoff, 1972) and has enormous ap-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 478, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 492 + ], + "score": 1.0, + "content": "plications in statistical learning theory (see, e.g., Chapter 5 in (Anthony & Bartlett, 2009)) and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 488, + 255, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 255, + 501 + ], + "score": 1.0, + "content": "bandits (Mannor & Tsitsiklis, 2004).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 466, + 506, + 501 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 506, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 505, + 518 + ], + "score": 1.0, + "content": "To prove Lemma B.1, one can first prove that the maximum likelihood estimator (MLE) is optimal", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 516, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 244, + 530 + ], + "score": 1.0, + "content": "and then show that MLE requires", + "type": "text" + }, + { + "bbox": [ + 244, + 516, + 315, + 529 + ], + "score": 0.92, + "content": "\\dot { \\Omega ( 1 / \\varepsilon ^ { 2 } \\log ( 1 / \\delta ) ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 517, + 429, + 530 + ], + "score": 1.0, + "content": "samples to correctly output", + "type": "text" + }, + { + "bbox": [ + 429, + 519, + 437, + 527 + ], + "score": 0.79, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "with probability", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 527, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 130, + 539 + ], + "score": 0.86, + "content": "1 - \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 527, + 506, + 542 + ], + "score": 1.0, + "content": "by anti-concentration. Lemma B.1 can also be proved by using information theory. See, e.g.,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 539, + 273, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 539, + 273, + 551 + ], + "score": 1.0, + "content": "(Kaufmann et al., 2016) for such a proof.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 506, + 506, + 551 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 566, + 269, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 565, + 271, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 271, + 581 + ], + "score": 1.0, + "content": "C ANOTHER HARD INSTANCE", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 591, + 506, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 591, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 505, + 603 + ], + "score": 1.0, + "content": "In this section, we present another hard case under a weaker version of Assumption 1. Here the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 603, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 603, + 505, + 614 + ], + "score": 1.0, + "content": "transition operator is stochastic and the reward is deterministic and sparse, meaning that the reward", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 610, + 507, + 630 + ], + "spans": [ + { + "bbox": [ + 104, + 610, + 398, + 630 + ], + "score": 1.0, + "content": "value is non-zero only for the last level. Moreover, the data distributions", + "type": "text" + }, + { + "bbox": [ + 398, + 613, + 435, + 626 + ], + "score": 0.93, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 610, + 507, + 630 + ], + "score": 1.0, + "content": "are induced by a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 623, + 506, + 638 + ], + "spans": [ + { + "bbox": [ + 104, + 623, + 156, + 638 + ], + "score": 1.0, + "content": "fixed policy", + "type": "text" + }, + { + "bbox": [ + 156, + 626, + 179, + 636 + ], + "score": 0.86, + "content": "\\pi _ { \\mathrm { d a t a } }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 623, + 506, + 638 + ], + "score": 1.0, + "content": ". We also illustrate the construction in Figure 2. Throughout this section, we use", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 635, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 113, + 647 + ], + "score": 0.76, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 636, + 314, + 649 + ], + "score": 1.0, + "content": "the denote the feature dimension, and we assume", + "type": "text" + }, + { + "bbox": [ + 315, + 637, + 321, + 647 + ], + "score": 0.79, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 636, + 487, + 649 + ], + "score": 1.0, + "content": "is an even integer for simplicity. We use", + "type": "text" + }, + { + "bbox": [ + 487, + 635, + 494, + 647 + ], + "score": 0.84, + "content": "\\hat { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 636, + 505, + 649 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 648, + 173, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 135, + 660 + ], + "score": 1.0, + "content": "denote", + "type": "text" + }, + { + "bbox": [ + 136, + 648, + 169, + 660 + ], + "score": 0.91, + "content": "d / 2 - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 648, + 173, + 660 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30.5, + "bbox_fs": [ + 104, + 591, + 507, + 660 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 664, + 504, + 687 + ], + "lines": [ + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "score": 1.0, + "content": "In this section, we adopt the following realizability assumption, which is a weaker version of As-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 675, + 157, + 688 + ], + "spans": [ + { + "bbox": [ + 104, + 675, + 157, + 688 + ], + "score": 1.0, + "content": "sumption 1.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 104, + 664, + 505, + 688 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 690, + 502, + 714 + ], + "lines": [ + { + "bbox": [ + 106, + 689, + 505, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 302, + 704 + ], + "score": 1.0, + "content": "Assumption 5 (Realizability). For the policy", + "type": "text" + }, + { + "bbox": [ + 302, + 690, + 380, + 702 + ], + "score": 0.9, + "content": "\\pi : { \\mathcal { S } } \\to \\Delta ( { \\mathcal { A } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 689, + 505, + 704 + ], + "score": 1.0, + "content": "to be evaluated, there exists", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 700, + 356, + 715 + ], + "spans": [ + { + "bbox": [ + 107, + 701, + 171, + 713 + ], + "score": 0.91, + "content": "\\theta _ { 1 } , \\ldots \\theta _ { H } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 700, + 238, + 715 + ], + "score": 1.0, + "content": "such that for all", + "type": "text" + }, + { + "bbox": [ + 239, + 702, + 300, + 714 + ], + "score": 0.91, + "content": "( s , a ) \\in S \\times A", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 700, + 319, + 715 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 319, + 702, + 352, + 714 + ], + "score": 0.91, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 700, + 356, + 715 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 106, + 689, + 505, + 715 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 259, + 718, + 351, + 733 + ], + "lines": [ + { + "bbox": [ + 259, + 718, + 351, + 733 + ], + "spans": [ + { + "bbox": [ + 259, + 718, + 351, + 733 + ], + "score": 0.9, + "content": "Q _ { h } ^ { \\pi } ( s , a ) = \\theta _ { h } ^ { \\top } \\phi ( s , a ) .", + "type": "interline_equation", + "image_path": "2e666fecfb6843e53103f4f01884c24aa399a2704cbf00af3317a8f5f1923b4b.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 259, + 718, + 351, + 733 + ], + "spans": [], + "index": 38 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 82, + 505, + 375 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 82, + 505, + 375 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 82, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 109, + 82, + 505, + 375 + ], + "score": 0.97, + "type": "image", + "image_path": "831f4f46b3c3a7fe56b9389db2fe0185582a4d12a043273c0a23665f61094463.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 82, + 505, + 179.66666666666669 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 179.66666666666669, + 505, + 277.33333333333337 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 277.33333333333337, + 505, + 375.00000000000006 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 400, + 506, + 524 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 400, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 339, + 414 + ], + "score": 1.0, + "content": "Figure 2: An illustration of the hard instance. Recall that", + "type": "text" + }, + { + "bbox": [ + 339, + 400, + 392, + 414 + ], + "score": 0.92, + "content": "\\hat { d } = d / 2 - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 401, + 505, + 414 + ], + "score": 1.0, + "content": ". States on the top are those", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 413, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 176, + 425 + ], + "score": 1.0, + "content": "in the first level", + "type": "text" + }, + { + "bbox": [ + 176, + 413, + 207, + 424 + ], + "score": 0.85, + "content": "( h = 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 413, + 432, + 425 + ], + "score": 1.0, + "content": "), while states at the bottom are those in the last level (", + "type": "text" + }, + { + "bbox": [ + 432, + 413, + 465, + 424 + ], + "score": 0.85, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 413, + 505, + 425 + ], + "score": 1.0, + "content": "). Dotted", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 379, + 437 + ], + "score": 1.0, + "content": "line (with arrow) corresponds to transitions associated with actions", + "type": "text" + }, + { + "bbox": [ + 379, + 426, + 436, + 436 + ], + "score": 0.89, + "content": "a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 423, + 506, + 437 + ], + "score": 1.0, + "content": ", while solid line", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 433, + 507, + 451 + ], + "spans": [ + { + "bbox": [ + 104, + 433, + 366, + 451 + ], + "score": 1.0, + "content": "(with arrow) corresponds to transitions associated with actions", + "type": "text" + }, + { + "bbox": [ + 367, + 438, + 444, + 448 + ], + "score": 0.88, + "content": "a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 433, + 507, + 451 + ], + "score": 1.0, + "content": ". We omit the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 446, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 213, + 459 + ], + "score": 1.0, + "content": "transition associated with", + "type": "text" + }, + { + "bbox": [ + 214, + 447, + 271, + 459 + ], + "score": 0.91, + "content": "a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 446, + 506, + 459 + ], + "score": 1.0, + "content": "in the figure if all actions give the same transition. For", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 102, + 453, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 102, + 453, + 149, + 479 + ], + "score": 1.0, + "content": "each level", + "type": "text" + }, + { + "bbox": [ + 150, + 460, + 185, + 473 + ], + "score": 0.88, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 453, + 190, + 479 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 190, + 460, + 199, + 472 + ], + "score": 0.73, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 453, + 294, + 479 + ], + "score": 1.0, + "content": "-values associated with", + "type": "text" + }, + { + "bbox": [ + 295, + 458, + 383, + 473 + ], + "score": 0.92, + "content": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } , s _ { h } ^ { + } , s _ { h } ^ { - }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 459, + 506, + 474 + ], + "score": 1.0, + "content": ", sdˆh, s+h , s−h are marked on the left, while", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 100, + 466, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 100, + 466, + 216, + 497 + ], + "score": 1.0, + "content": "transition distributions and", + "type": "text" + }, + { + "bbox": [ + 216, + 475, + 225, + 487 + ], + "score": 0.85, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 466, + 319, + 497 + ], + "score": 1.0, + "content": "-values associated with + −", + "type": "text" + }, + { + "bbox": [ + 319, + 473, + 339, + 488 + ], + "score": 0.92, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 466, + 505, + 497 + ], + "score": 1.0, + "content": "are marked on the right. Rewards are all", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 487, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 259, + 502 + ], + "score": 1.0, + "content": "deterministic, and the only two states", + "type": "text" + }, + { + "bbox": [ + 305, + 487, + 506, + 502 + ], + "score": 1.0, + "content": ") with non-zero reward values are marked in black", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 499, + 506, + 511 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 294, + 511 + ], + "score": 1.0, + "content": "and grey. Consider the fixed policy that returns", + "type": "text" + }, + { + "bbox": [ + 295, + 501, + 306, + 510 + ], + "score": 0.86, + "content": "\\mathit { a } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 499, + 409, + 511 + ], + "score": 1.0, + "content": "for all input states. When", + "type": "text" + }, + { + "bbox": [ + 410, + 500, + 438, + 510 + ], + "score": 0.9, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 499, + 506, + 511 + ], + "score": 1.0, + "content": ", the value of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 509, + 433, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 180, + 525 + ], + "score": 1.0, + "content": "policy is 0. When", + "type": "text" + }, + { + "bbox": [ + 180, + 510, + 246, + 523 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( \\bar { H } - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 509, + 344, + 525 + ], + "score": 1.0, + "content": ", the value of the policy", + "type": "text" + }, + { + "bbox": [ + 345, + 510, + 427, + 523 + ], + "score": 0.9, + "content": "s = r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 509, + 433, + 525 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 7.5 + } + ], + "index": 4.25 + }, + { + "type": "text", + "bbox": [ + 106, + 547, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 105, + 547, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 547, + 482, + 560 + ], + "score": 1.0, + "content": "State Space, Action Space and Transition Operator. In this hard case, the action space", + "type": "text" + }, + { + "bbox": [ + 483, + 548, + 505, + 559 + ], + "score": 0.84, + "content": "{ \\mathcal { A } } =", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 558, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 107, + 559, + 174, + 571 + ], + "score": 0.91, + "content": "\\{ a _ { 1 } , a _ { 2 } , \\ldots , a _ { d } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 558, + 212, + 571 + ], + "score": 1.0, + "content": "contains", + "type": "text" + }, + { + "bbox": [ + 212, + 559, + 219, + 569 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 558, + 262, + 571 + ], + "score": 1.0, + "content": "elements.", + "type": "text" + }, + { + "bbox": [ + 263, + 559, + 275, + 570 + ], + "score": 0.88, + "content": "S _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 558, + 368, + 571 + ], + "score": 1.0, + "content": "contains a single state", + "type": "text" + }, + { + "bbox": [ + 369, + 560, + 379, + 570 + ], + "score": 0.84, + "content": "s _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 558, + 423, + 571 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 423, + 559, + 451, + 570 + ], + "score": 0.81, + "content": "h \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 558, + 455, + 571 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 455, + 559, + 468, + 570 + ], + "score": 0.71, + "content": "S _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 558, + 505, + 571 + ], + "score": 1.0, + "content": "contains", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 564, + 291, + 593 + ], + "spans": [ + { + "bbox": [ + 107, + 571, + 130, + 584 + ], + "score": 0.9, + "content": "{ \\hat { d } } + 3", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 564, + 156, + 593 + ], + "score": 1.0, + "content": "states", + "type": "text" + }, + { + "bbox": [ + 156, + 570, + 253, + 586 + ], + "score": 0.8, + "content": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } , s _ { h } ^ { \\hat { d } + 1 } , s _ { h } ^ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 564, + 271, + 593 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 271, + 572, + 283, + 586 + ], + "score": 0.87, + "content": "s _ { h } ^ { - }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 564, + 291, + 593 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 591, + 505, + 615 + ], + "lines": [ + { + "bbox": [ + 105, + 589, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 122, + 606 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 122, + 591, + 207, + 604 + ], + "score": 0.92, + "content": "0 \\leq r _ { 0 } \\leq \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 589, + 506, + 606 + ], + "score": 1.0, + "content": "be a parameter to be determined. We first define the transition operator for", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 602, + 201, + 615 + ], + "spans": [ + { + "bbox": [ + 106, + 602, + 201, + 615 + ], + "score": 1.0, + "content": "the first level. We have", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 622, + 403, + 682 + ], + "lines": [ + { + "bbox": [ + 205, + 622, + 403, + 682 + ], + "spans": [ + { + "bbox": [ + 205, + 622, + 403, + 682 + ], + "score": 0.93, + "content": "P ( s _ { 1 } , a ) = \\left\\{ \\begin{array} { l l } { s _ { 2 } ^ { c } } & { a = a _ { c } , c \\in [ \\hat { d } ] } \\\\ { s _ { 2 } ^ { + } } & { a = a _ { \\hat { d } + 1 } } \\\\ { s _ { 2 } ^ { - } } & { a = a _ { \\hat { d } + 2 } } \\\\ { s _ { 2 } ^ { \\hat { d } + 1 } } & { a \\in \\{ a _ { \\hat { d } + 3 } , a _ { \\hat { d } + 4 } , \\dots , a _ { d } \\} } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "02dca0d2d05899ca16665bb3efe99b1848e77bfa1b39750db47c7eb99487a458.jpg" + } + ] + } + ], + "index": 19.5, + "virtual_lines": [ + { + "bbox": [ + 205, + 622, + 403, + 637.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 205, + 637.0, + 403, + 652.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 205, + 652.0, + 403, + 667.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 205, + 667.0, + 403, + 682.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 689, + 506, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 281, + 703 + ], + "score": 1.0, + "content": "Now we define the transition operator when", + "type": "text" + }, + { + "bbox": [ + 282, + 690, + 371, + 702 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 688, + 411, + 703 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 412, + 690, + 501, + 702 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 688, + 505, + 703 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 696, + 510, + 724 + ], + "spans": [ + { + "bbox": [ + 106, + 705, + 135, + 716 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 696, + 153, + 724 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 154, + 703, + 183, + 717 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 696, + 223, + 724 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 224, + 702, + 294, + 718 + ], + "score": 0.9, + "content": "P ( s _ { h } ^ { c } , a ) = s _ { h + 1 } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 696, + 299, + 724 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 299, + 704, + 371, + 718 + ], + "score": 0.89, + "content": "P ( s _ { h } ^ { + } , a ) = s _ { h + 1 } ^ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 696, + 390, + 724 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 390, + 704, + 462, + 718 + ], + "score": 0.92, + "content": "P ( s _ { h } ^ { - } , a ) = s _ { h + 1 } ^ { - }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 696, + 510, + 724 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 715, + 507, + 738 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 196, + 732 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 715, + 213, + 738 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 213, + 719, + 241, + 732 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 715, + 279, + 738 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 280, + 718, + 362, + 734 + ], + "score": 0.93, + "content": "P ( s _ { h } ^ { \\hat { d } + 1 } , a _ { c } ) = s _ { h + 1 } ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 715, + 394, + 738 + ], + "score": 1.0, + "content": ". For all", + "type": "text" + }, + { + "bbox": [ + 395, + 720, + 501, + 734 + ], + "score": 0.92, + "content": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 715, + 507, + 738 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + } + ], + "page_idx": 14, + "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": [ + 300, + 751, + 311, + 761 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "15", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 82, + 505, + 375 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 82, + 505, + 375 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 82, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 109, + 82, + 505, + 375 + ], + "score": 0.97, + "type": "image", + "image_path": "831f4f46b3c3a7fe56b9389db2fe0185582a4d12a043273c0a23665f61094463.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 82, + 505, + 179.66666666666669 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 179.66666666666669, + 505, + 277.33333333333337 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 277.33333333333337, + 505, + 375.00000000000006 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 400, + 506, + 524 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 400, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 339, + 414 + ], + "score": 1.0, + "content": "Figure 2: An illustration of the hard instance. Recall that", + "type": "text" + }, + { + "bbox": [ + 339, + 400, + 392, + 414 + ], + "score": 0.92, + "content": "\\hat { d } = d / 2 - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 401, + 505, + 414 + ], + "score": 1.0, + "content": ". States on the top are those", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 413, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 176, + 425 + ], + "score": 1.0, + "content": "in the first level", + "type": "text" + }, + { + "bbox": [ + 176, + 413, + 207, + 424 + ], + "score": 0.85, + "content": "( h = 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 413, + 432, + 425 + ], + "score": 1.0, + "content": "), while states at the bottom are those in the last level (", + "type": "text" + }, + { + "bbox": [ + 432, + 413, + 465, + 424 + ], + "score": 0.85, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 413, + 505, + 425 + ], + "score": 1.0, + "content": "). Dotted", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 379, + 437 + ], + "score": 1.0, + "content": "line (with arrow) corresponds to transitions associated with actions", + "type": "text" + }, + { + "bbox": [ + 379, + 426, + 436, + 436 + ], + "score": 0.89, + "content": "a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 423, + 506, + 437 + ], + "score": 1.0, + "content": ", while solid line", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 433, + 507, + 451 + ], + "spans": [ + { + "bbox": [ + 104, + 433, + 366, + 451 + ], + "score": 1.0, + "content": "(with arrow) corresponds to transitions associated with actions", + "type": "text" + }, + { + "bbox": [ + 367, + 438, + 444, + 448 + ], + "score": 0.88, + "content": "a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 433, + 507, + 451 + ], + "score": 1.0, + "content": ". We omit the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 446, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 213, + 459 + ], + "score": 1.0, + "content": "transition associated with", + "type": "text" + }, + { + "bbox": [ + 214, + 447, + 271, + 459 + ], + "score": 0.91, + "content": "a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 446, + 506, + 459 + ], + "score": 1.0, + "content": "in the figure if all actions give the same transition. For", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 102, + 453, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 102, + 453, + 149, + 479 + ], + "score": 1.0, + "content": "each level", + "type": "text" + }, + { + "bbox": [ + 150, + 460, + 185, + 473 + ], + "score": 0.88, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 453, + 190, + 479 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 190, + 460, + 199, + 472 + ], + "score": 0.73, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 453, + 294, + 479 + ], + "score": 1.0, + "content": "-values associated with", + "type": "text" + }, + { + "bbox": [ + 295, + 458, + 383, + 473 + ], + "score": 0.92, + "content": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } , s _ { h } ^ { + } , s _ { h } ^ { - }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 459, + 506, + 474 + ], + "score": 1.0, + "content": ", sdˆh, s+h , s−h are marked on the left, while", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 100, + 466, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 100, + 466, + 216, + 497 + ], + "score": 1.0, + "content": "transition distributions and", + "type": "text" + }, + { + "bbox": [ + 216, + 475, + 225, + 487 + ], + "score": 0.85, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 466, + 319, + 497 + ], + "score": 1.0, + "content": "-values associated with + −", + "type": "text" + }, + { + "bbox": [ + 319, + 473, + 339, + 488 + ], + "score": 0.92, + "content": "s _ { h } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 466, + 505, + 497 + ], + "score": 1.0, + "content": "are marked on the right. Rewards are all", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 487, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 259, + 502 + ], + "score": 1.0, + "content": "deterministic, and the only two states", + "type": "text" + }, + { + "bbox": [ + 305, + 487, + 506, + 502 + ], + "score": 1.0, + "content": ") with non-zero reward values are marked in black", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 499, + 506, + 511 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 294, + 511 + ], + "score": 1.0, + "content": "and grey. Consider the fixed policy that returns", + "type": "text" + }, + { + "bbox": [ + 295, + 501, + 306, + 510 + ], + "score": 0.86, + "content": "\\mathit { a } _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 499, + 409, + 511 + ], + "score": 1.0, + "content": "for all input states. When", + "type": "text" + }, + { + "bbox": [ + 410, + 500, + 438, + 510 + ], + "score": 0.9, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 499, + 506, + 511 + ], + "score": 1.0, + "content": ", the value of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 509, + 433, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 180, + 525 + ], + "score": 1.0, + "content": "policy is 0. When", + "type": "text" + }, + { + "bbox": [ + 180, + 510, + 246, + 523 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( \\bar { H } - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 509, + 344, + 525 + ], + "score": 1.0, + "content": ", the value of the policy", + "type": "text" + }, + { + "bbox": [ + 345, + 510, + 427, + 523 + ], + "score": 0.9, + "content": "s = r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 509, + 433, + 525 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 7.5 + } + ], + "index": 4.25 + }, + { + "type": "text", + "bbox": [ + 106, + 547, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 105, + 547, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 547, + 482, + 560 + ], + "score": 1.0, + "content": "State Space, Action Space and Transition Operator. In this hard case, the action space", + "type": "text" + }, + { + "bbox": [ + 483, + 548, + 505, + 559 + ], + "score": 0.84, + "content": "{ \\mathcal { A } } =", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 558, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 107, + 559, + 174, + 571 + ], + "score": 0.91, + "content": "\\{ a _ { 1 } , a _ { 2 } , \\ldots , a _ { d } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 558, + 212, + 571 + ], + "score": 1.0, + "content": "contains", + "type": "text" + }, + { + "bbox": [ + 212, + 559, + 219, + 569 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 558, + 262, + 571 + ], + "score": 1.0, + "content": "elements.", + "type": "text" + }, + { + "bbox": [ + 263, + 559, + 275, + 570 + ], + "score": 0.88, + "content": "S _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 558, + 368, + 571 + ], + "score": 1.0, + "content": "contains a single state", + "type": "text" + }, + { + "bbox": [ + 369, + 560, + 379, + 570 + ], + "score": 0.84, + "content": "s _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 558, + 423, + 571 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 423, + 559, + 451, + 570 + ], + "score": 0.81, + "content": "h \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 558, + 455, + 571 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 455, + 559, + 468, + 570 + ], + "score": 0.71, + "content": "S _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 558, + 505, + 571 + ], + "score": 1.0, + "content": "contains", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 564, + 291, + 593 + ], + "spans": [ + { + "bbox": [ + 107, + 571, + 130, + 584 + ], + "score": 0.9, + "content": "{ \\hat { d } } + 3", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 564, + 156, + 593 + ], + "score": 1.0, + "content": "states", + "type": "text" + }, + { + "bbox": [ + 156, + 570, + 253, + 586 + ], + "score": 0.8, + "content": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } , s _ { h } ^ { \\hat { d } + 1 } , s _ { h } ^ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 564, + 271, + 593 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 271, + 572, + 283, + 586 + ], + "score": 0.87, + "content": "s _ { h } ^ { - }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 564, + 291, + 593 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 547, + 505, + 593 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 591, + 505, + 615 + ], + "lines": [ + { + "bbox": [ + 105, + 589, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 122, + 606 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 122, + 591, + 207, + 604 + ], + "score": 0.92, + "content": "0 \\leq r _ { 0 } \\leq \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 589, + 506, + 606 + ], + "score": 1.0, + "content": "be a parameter to be determined. We first define the transition operator for", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 602, + 201, + 615 + ], + "spans": [ + { + "bbox": [ + 106, + 602, + 201, + 615 + ], + "score": 1.0, + "content": "the first level. We have", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 589, + 506, + 615 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 622, + 403, + 682 + ], + "lines": [ + { + "bbox": [ + 205, + 622, + 403, + 682 + ], + "spans": [ + { + "bbox": [ + 205, + 622, + 403, + 682 + ], + "score": 0.93, + "content": "P ( s _ { 1 } , a ) = \\left\\{ \\begin{array} { l l } { s _ { 2 } ^ { c } } & { a = a _ { c } , c \\in [ \\hat { d } ] } \\\\ { s _ { 2 } ^ { + } } & { a = a _ { \\hat { d } + 1 } } \\\\ { s _ { 2 } ^ { - } } & { a = a _ { \\hat { d } + 2 } } \\\\ { s _ { 2 } ^ { \\hat { d } + 1 } } & { a \\in \\{ a _ { \\hat { d } + 3 } , a _ { \\hat { d } + 4 } , \\dots , a _ { d } \\} } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "02dca0d2d05899ca16665bb3efe99b1848e77bfa1b39750db47c7eb99487a458.jpg" + } + ] + } + ], + "index": 19.5, + "virtual_lines": [ + { + "bbox": [ + 205, + 622, + 403, + 637.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 205, + 637.0, + 403, + 652.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 205, + 652.0, + 403, + 667.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 205, + 667.0, + 403, + 682.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 689, + 506, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 281, + 703 + ], + "score": 1.0, + "content": "Now we define the transition operator when", + "type": "text" + }, + { + "bbox": [ + 282, + 690, + 371, + 702 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 688, + 411, + 703 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 412, + 690, + 501, + 702 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 688, + 505, + 703 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 696, + 510, + 724 + ], + "spans": [ + { + "bbox": [ + 106, + 705, + 135, + 716 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 696, + 153, + 724 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 154, + 703, + 183, + 717 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 696, + 223, + 724 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 224, + 702, + 294, + 718 + ], + "score": 0.9, + "content": "P ( s _ { h } ^ { c } , a ) = s _ { h + 1 } ^ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 696, + 299, + 724 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 299, + 704, + 371, + 718 + ], + "score": 0.89, + "content": "P ( s _ { h } ^ { + } , a ) = s _ { h + 1 } ^ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 696, + 390, + 724 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 390, + 704, + 462, + 718 + ], + "score": 0.92, + "content": "P ( s _ { h } ^ { - } , a ) = s _ { h + 1 } ^ { - }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 696, + 510, + 724 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 715, + 507, + 738 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 196, + 732 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 715, + 213, + 738 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 213, + 719, + 241, + 732 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 715, + 279, + 738 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 280, + 718, + 362, + 734 + ], + "score": 0.93, + "content": "P ( s _ { h } ^ { \\hat { d } + 1 } , a _ { c } ) = s _ { h + 1 } ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 715, + 394, + 738 + ], + "score": 1.0, + "content": ". For all", + "type": "text" + }, + { + "bbox": [ + 395, + 720, + 501, + 734 + ], + "score": 0.92, + "content": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 715, + 507, + 738 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 688, + 510, + 738 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 83, + 142, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 143, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 143, + 95 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 90, + 436, + 124 + ], + "lines": [ + { + "bbox": [ + 172, + 90, + 436, + 124 + ], + "spans": [ + { + "bbox": [ + 172, + 90, + 436, + 124 + ], + "score": 0.94, + "content": "P \\left( s _ { h } ^ { \\hat { d } + 1 } , a \\right) = \\left\\{ \\begin{array} { l l } { s _ { h + 1 } ^ { + } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } ) / 2 } \\\\ { s _ { h + 1 } ^ { - } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } ) / 2 } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "1f21f3f45f8a1770030c2e66d94d2b2fc888143c2656ab4cbff41319fc9f266f.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 172, + 90, + 436, + 101.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 172, + 101.33333333333333, + 436, + 112.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 172, + 112.66666666666666, + 436, + 123.99999999999999 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 132, + 500, + 146 + ], + "lines": [ + { + "bbox": [ + 105, + 131, + 501, + 147 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 388, + 147 + ], + "score": 1.0, + "content": "Now we define the transition operator for the second last level. For all", + "type": "text" + }, + { + "bbox": [ + 388, + 132, + 416, + 146 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 131, + 434, + 147 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 435, + 134, + 461, + 144 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 131, + 501, + 147 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 200, + 150, + 411, + 179 + ], + "lines": [ + { + "bbox": [ + 200, + 150, + 411, + 179 + ], + "spans": [ + { + "bbox": [ + 200, + 150, + 411, + 179 + ], + "score": 0.92, + "content": "P ( s _ { H - 1 } ^ { c } , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } ) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } ) / 2 } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "26aa3d6833d1a76da303d0fdd448af1601354bcb4d0355dc55a5b4ece284cf45.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 200, + 150, + 411, + 179 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 185, + 504, + 216 + ], + "lines": [ + { + "bbox": [ + 104, + 184, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 184, + 137, + 200 + ], + "score": 1.0, + "content": "For all", + "type": "text" + }, + { + "bbox": [ + 137, + 187, + 167, + 197 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 184, + 209, + 200 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 210, + 185, + 287, + 200 + ], + "score": 0.92, + "content": "P ( s _ { H - 1 } ^ { + } , a ) = s _ { H } ^ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 184, + 307, + 200 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 308, + 186, + 385, + 200 + ], + "score": 0.92, + "content": "P ( s _ { H - 1 } ^ { - } , a ) \\ = \\ s _ { H } ^ { - }", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 184, + 432, + 200 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 432, + 184, + 464, + 199 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 184, + 506, + 200 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 195, + 368, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 185, + 215 + ], + "score": 0.93, + "content": "P ( s _ { H - 1 } ^ { \\hat { d } + 1 } , a _ { c } ) = s _ { H } ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 195, + 218, + 220 + ], + "score": 1.0, + "content": ". For all", + "type": "text" + }, + { + "bbox": [ + 218, + 201, + 325, + 216 + ], + "score": 0.92, + "content": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 195, + 368, + 220 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 219, + 425, + 260 + ], + "lines": [ + { + "bbox": [ + 186, + 219, + 425, + 260 + ], + "spans": [ + { + "bbox": [ + 186, + 219, + 425, + 260 + ], + "score": 0.94, + "content": "P ( s _ { H - 1 } ^ { \\hat { d } + 1 } , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } \\left( 1 + r _ { 0 } \\cdot \\sqrt { \\hat { d } } \\right) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } \\left( 1 - r _ { 0 } \\cdot \\sqrt { \\hat { d } } \\right) / 2 } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "1ec405fe5a1c83f132890bcdf71ead1c49f3819827dd48b952d4a005c8e16a0c.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 219, + 425, + 239.5 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 186, + 239.5, + 425, + 260.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 268, + 504, + 292 + ], + "lines": [ + { + "bbox": [ + 106, + 269, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 505, + 282 + ], + "score": 1.0, + "content": "Reward Values. In this hard case, all reward values are deterministic, and reward values can be", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 280, + 310, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 310, + 293 + ], + "score": 1.0, + "content": "non-zero only for the last level. Formally, we have", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "interline_equation", + "bbox": [ + 245, + 297, + 366, + 338 + ], + "lines": [ + { + "bbox": [ + 245, + 297, + 366, + 338 + ], + "spans": [ + { + "bbox": [ + 245, + 297, + 366, + 338 + ], + "score": 0.94, + "content": "R ( s , a ) = \\left\\{ { \\begin{array} { l l } { 1 } & { s = s _ { H } ^ { + } } \\\\ { - 1 } & { s = s _ { H } ^ { - } } \\\\ { 0 } & { { \\mathrm { o t h e r w i s e } } } \\end{array} } \\right. .", + "type": "interline_equation", + "image_path": "9f7770932480add887a3daf15ae27f6fa6f34cf24a3f5fc2823575dd2bd7f97f.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 245, + 297, + 366, + 317.5 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 245, + 317.5, + 366, + 338.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 348, + 504, + 373 + ], + "lines": [ + { + "bbox": [ + 105, + 348, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 358, + 362 + ], + "score": 1.0, + "content": "Feature Mapping. As in the in hard instance in Section 4, let", + "type": "text" + }, + { + "bbox": [ + 358, + 351, + 412, + 361 + ], + "score": 0.84, + "content": "e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 348, + 505, + 362 + ], + "score": 1.0, + "content": "be a set of of orthonor-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 358, + 429, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 165, + 374 + ], + "score": 1.0, + "content": "mal vectors in", + "type": "text" + }, + { + "bbox": [ + 165, + 360, + 178, + 370 + ], + "score": 0.87, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 358, + 297, + 374 + ], + "score": 1.0, + "content": ". For the initial state, for each", + "type": "text" + }, + { + "bbox": [ + 298, + 360, + 325, + 372 + ], + "score": 0.92, + "content": "c \\in [ d ]", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 358, + 365, + 374 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 365, + 361, + 424, + 372 + ], + "score": 0.91, + "content": "\\phi ( s _ { 1 } , a _ { c } ) = e _ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 358, + 429, + 374 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 376, + 504, + 404 + ], + "lines": [ + { + "bbox": [ + 105, + 375, + 504, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 277, + 391 + ], + "score": 1.0, + "content": "Now we define the feature mapping when", + "type": "text" + }, + { + "bbox": [ + 278, + 377, + 353, + 389 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 375, + 396, + 391 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 396, + 377, + 471, + 389 + ], + "score": 0.9, + "content": "h \\in \\{ 2 , 3 , \\ldots , H \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 375, + 475, + 391 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 476, + 378, + 504, + 388 + ], + "score": 0.82, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 388, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 123, + 405 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 389, + 284, + 404 + ], + "score": 0.8, + "content": "c \\in [ \\hat { d } ] , \\phi ( s _ { h } ^ { c } , a ) = e _ { c } , \\phi ( s _ { h } ^ { + } , a ) = e _ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 388, + 302, + 405 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 302, + 390, + 370, + 404 + ], + "score": 0.92, + "content": "\\phi ( s _ { h } ^ { - } , a ) = e _ { \\hat { d } + 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 388, + 475, + 405 + ], + "score": 1.0, + "content": ". Moreover, for all actions", + "type": "text" + }, + { + "bbox": [ + 475, + 391, + 501, + 401 + ], + "score": 0.88, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 388, + 506, + 405 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "interline_equation", + "bbox": [ + 159, + 408, + 450, + 441 + ], + "lines": [ + { + "bbox": [ + 159, + 408, + 450, + 441 + ], + "spans": [ + { + "bbox": [ + 159, + 408, + 450, + 441 + ], + "score": 0.94, + "content": "\\phi ( s _ { h } ^ { \\hat { d } + 1 } , a ) = \\left\\{ { \\begin{array} { l l } { e _ { \\hat { d } + 2 + c } } & { a = a _ { c } , c \\in [ { \\hat { d } } ] } \\\\ { { \\frac { 1 } { d ^ { 1 / 2 } } } \\left( e _ { 1 } + e _ { 2 } + \\ldots + e _ { \\hat { d } } \\right) } & { a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\ldots , a _ { d } \\right\\} } \\end{array} } \\right. .", + "type": "interline_equation", + "image_path": "3498e2809bc51250e1241c52184c87309d17438b131a1b68fb48c01d2312e276.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 159, + 408, + 450, + 419.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 159, + 419.0, + 450, + 430.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 159, + 430.0, + 450, + 441.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 445, + 297, + 459 + ], + "lines": [ + { + "bbox": [ + 106, + 445, + 298, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 233, + 460 + ], + "score": 1.0, + "content": "Clearly, for all (s, a) ∈ S × A,", + "type": "text" + }, + { + "bbox": [ + 234, + 446, + 295, + 459 + ], + "score": 0.76, + "content": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 445, + 298, + 460 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 469, + 505, + 493 + ], + "lines": [ + { + "bbox": [ + 106, + 468, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 387, + 483 + ], + "score": 1.0, + "content": "Verifying Assumption 5. Now we consider the deterministic policy", + "type": "text" + }, + { + "bbox": [ + 388, + 470, + 433, + 480 + ], + "score": 0.89, + "content": "\\pi : { \\mathcal { S } } A", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 468, + 506, + 483 + ], + "score": 1.0, + "content": ", which is defined", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 480, + 369, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 128, + 493 + ], + "score": 1.0, + "content": "to be", + "type": "text" + }, + { + "bbox": [ + 129, + 481, + 172, + 493 + ], + "score": 0.92, + "content": "\\pi ( s ) = a _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 480, + 199, + 493 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 200, + 481, + 224, + 491 + ], + "score": 0.89, + "content": "s \\in S", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 480, + 369, + 493 + ], + "score": 1.0, + "content": ". We show that Assumption 5 holds.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 107, + 497, + 189, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 496, + 189, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 496, + 133, + 510 + ], + "score": 1.0, + "content": "When", + "type": "text" + }, + { + "bbox": [ + 133, + 498, + 158, + 508 + ], + "score": 0.9, + "content": "h = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 496, + 189, + 510 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 158, + 513, + 453, + 549 + ], + "lines": [ + { + "bbox": [ + 158, + 513, + 453, + 549 + ], + "spans": [ + { + "bbox": [ + 158, + 513, + 453, + 549 + ], + "score": 0.93, + "content": "\\theta _ { 1 } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - 3 ) / 2 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } + \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - 2 ) / 2 } \\cdot e _ { \\hat { d } + 2 + c } .", + "type": "interline_equation", + "image_path": "b0f7eb3020ffacb568382bd05c55fe286cf5c19a1f426007fdc721000df37147.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 158, + 513, + 453, + 525.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 158, + 525.0, + 453, + 537.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 158, + 537.0, + 453, + 549.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 558, + 266, + 572 + ], + "lines": [ + { + "bbox": [ + 106, + 559, + 266, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 143, + 572 + ], + "score": 1.0, + "content": "For each", + "type": "text" + }, + { + "bbox": [ + 144, + 559, + 235, + 572 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 559, + 266, + 572 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 146, + 576, + 463, + 612 + ], + "lines": [ + { + "bbox": [ + 146, + 576, + 463, + 612 + ], + "spans": [ + { + "bbox": [ + 146, + 576, + 463, + 612 + ], + "score": 0.93, + "content": "\\theta _ { h } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - h - 1 ) / 2 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } + \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - h - 2 ) / 2 } \\cdot e _ { \\hat { d } + 2 + c } .", + "type": "interline_equation", + "image_path": "29b2bb5c7fea1f396573160e775cfc55b3fe971fa9c8e9868b297ec621610580.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 146, + 576, + 463, + 588.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 146, + 588.0, + 463, + 600.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 146, + 600.0, + 463, + 612.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 282, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 282, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 205, + 634 + ], + "score": 1.0, + "content": "For the second last level", + "type": "text" + }, + { + "bbox": [ + 205, + 623, + 252, + 633 + ], + "score": 0.92, + "content": "h = H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 622, + 282, + 634 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 637, + 378, + 673 + ], + "lines": [ + { + "bbox": [ + 232, + 637, + 378, + 673 + ], + "spans": [ + { + "bbox": [ + 232, + 637, + 378, + 673 + ], + "score": 0.94, + "content": "\\theta _ { H - 1 } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } .", + "type": "interline_equation", + "image_path": "ae4a86643acf6941e5673bf4a1888cd7c2991b52c17b90361afecfc59f872b74.jpg" + } + ] + } + ], + "index": 33.5, + "virtual_lines": [ + { + "bbox": [ + 232, + 637, + 378, + 655.0 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 232, + 655.0, + 378, + 673.0 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 683, + 265, + 695 + ], + "lines": [ + { + "bbox": [ + 106, + 683, + 265, + 696 + ], + "spans": [ + { + "bbox": [ + 106, + 683, + 205, + 696 + ], + "score": 1.0, + "content": "Finally, for the last level", + "type": "text" + }, + { + "bbox": [ + 206, + 684, + 235, + 694 + ], + "score": 0.89, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 683, + 265, + 696 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 700, + 345, + 715 + ], + "lines": [ + { + "bbox": [ + 264, + 700, + 345, + 715 + ], + "spans": [ + { + "bbox": [ + 264, + 700, + 345, + 715 + ], + "score": 0.89, + "content": "\\theta _ { H } = e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } .", + "type": "interline_equation", + "image_path": "54bfceffda606069ff016716960840835aa9b52c6640364dc3b678b6cae64510.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 264, + 700, + 345, + 715 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 719, + 453, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 717, + 454, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 717, + 228, + 735 + ], + "score": 1.0, + "content": "It can be verified that for each", + "type": "text" + }, + { + "bbox": [ + 228, + 720, + 262, + 732 + ], + "score": 0.82, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 717, + 266, + 735 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 266, + 719, + 355, + 733 + ], + "score": 0.91, + "content": "Q _ { h } ^ { \\pi } ( s , a ) = \\theta _ { h } ^ { \\top } \\phi ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 717, + 384, + 735 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 384, + 720, + 450, + 732 + ], + "score": 0.91, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 717, + 454, + 735 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 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": "16", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 83, + 142, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 143, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 143, + 95 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 82, + 143, + 95 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 90, + 436, + 124 + ], + "lines": [ + { + "bbox": [ + 172, + 90, + 436, + 124 + ], + "spans": [ + { + "bbox": [ + 172, + 90, + 436, + 124 + ], + "score": 0.94, + "content": "P \\left( s _ { h } ^ { \\hat { d } + 1 } , a \\right) = \\left\\{ \\begin{array} { l l } { s _ { h + 1 } ^ { + } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } ) / 2 } \\\\ { s _ { h + 1 } ^ { - } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } ) / 2 } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "1f21f3f45f8a1770030c2e66d94d2b2fc888143c2656ab4cbff41319fc9f266f.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 172, + 90, + 436, + 101.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 172, + 101.33333333333333, + 436, + 112.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 172, + 112.66666666666666, + 436, + 123.99999999999999 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 132, + 500, + 146 + ], + "lines": [ + { + "bbox": [ + 105, + 131, + 501, + 147 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 388, + 147 + ], + "score": 1.0, + "content": "Now we define the transition operator for the second last level. For all", + "type": "text" + }, + { + "bbox": [ + 388, + 132, + 416, + 146 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 131, + 434, + 147 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 435, + 134, + 461, + 144 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 131, + 501, + 147 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 131, + 501, + 147 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 200, + 150, + 411, + 179 + ], + "lines": [ + { + "bbox": [ + 200, + 150, + 411, + 179 + ], + "spans": [ + { + "bbox": [ + 200, + 150, + 411, + 179 + ], + "score": 0.92, + "content": "P ( s _ { H - 1 } ^ { c } , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } ) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } ) / 2 } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "26aa3d6833d1a76da303d0fdd448af1601354bcb4d0355dc55a5b4ece284cf45.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 200, + 150, + 411, + 179 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 185, + 504, + 216 + ], + "lines": [ + { + "bbox": [ + 104, + 184, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 184, + 137, + 200 + ], + "score": 1.0, + "content": "For all", + "type": "text" + }, + { + "bbox": [ + 137, + 187, + 167, + 197 + ], + "score": 0.89, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 184, + 209, + 200 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 210, + 185, + 287, + 200 + ], + "score": 0.92, + "content": "P ( s _ { H - 1 } ^ { + } , a ) = s _ { H } ^ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 184, + 307, + 200 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 308, + 186, + 385, + 200 + ], + "score": 0.92, + "content": "P ( s _ { H - 1 } ^ { - } , a ) \\ = \\ s _ { H } ^ { - }", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 184, + 432, + 200 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 432, + 184, + 464, + 199 + ], + "score": 0.93, + "content": "c \\in [ \\hat { d } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 184, + 506, + 200 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 195, + 368, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 185, + 215 + ], + "score": 0.93, + "content": "P ( s _ { H - 1 } ^ { \\hat { d } + 1 } , a _ { c } ) = s _ { H } ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 195, + 218, + 220 + ], + "score": 1.0, + "content": ". For all", + "type": "text" + }, + { + "bbox": [ + 218, + 201, + 325, + 216 + ], + "score": 0.92, + "content": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 195, + 368, + 220 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 104, + 184, + 506, + 220 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 219, + 425, + 260 + ], + "lines": [ + { + "bbox": [ + 186, + 219, + 425, + 260 + ], + "spans": [ + { + "bbox": [ + 186, + 219, + 425, + 260 + ], + "score": 0.94, + "content": "P ( s _ { H - 1 } ^ { \\hat { d } + 1 } , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } \\left( 1 + r _ { 0 } \\cdot \\sqrt { \\hat { d } } \\right) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } \\left( 1 - r _ { 0 } \\cdot \\sqrt { \\hat { d } } \\right) / 2 } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "1ec405fe5a1c83f132890bcdf71ead1c49f3819827dd48b952d4a005c8e16a0c.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 219, + 425, + 239.5 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 186, + 239.5, + 425, + 260.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 268, + 504, + 292 + ], + "lines": [ + { + "bbox": [ + 106, + 269, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 505, + 282 + ], + "score": 1.0, + "content": "Reward Values. In this hard case, all reward values are deterministic, and reward values can be", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 280, + 310, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 310, + 293 + ], + "score": 1.0, + "content": "non-zero only for the last level. Formally, we have", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 269, + 505, + 293 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 245, + 297, + 366, + 338 + ], + "lines": [ + { + "bbox": [ + 245, + 297, + 366, + 338 + ], + "spans": [ + { + "bbox": [ + 245, + 297, + 366, + 338 + ], + "score": 0.94, + "content": "R ( s , a ) = \\left\\{ { \\begin{array} { l l } { 1 } & { s = s _ { H } ^ { + } } \\\\ { - 1 } & { s = s _ { H } ^ { - } } \\\\ { 0 } & { { \\mathrm { o t h e r w i s e } } } \\end{array} } \\right. .", + "type": "interline_equation", + "image_path": "9f7770932480add887a3daf15ae27f6fa6f34cf24a3f5fc2823575dd2bd7f97f.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 245, + 297, + 366, + 317.5 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 245, + 317.5, + 366, + 338.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 348, + 504, + 373 + ], + "lines": [ + { + "bbox": [ + 105, + 348, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 358, + 362 + ], + "score": 1.0, + "content": "Feature Mapping. As in the in hard instance in Section 4, let", + "type": "text" + }, + { + "bbox": [ + 358, + 351, + 412, + 361 + ], + "score": 0.84, + "content": "e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 348, + 505, + 362 + ], + "score": 1.0, + "content": "be a set of of orthonor-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 358, + 429, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 165, + 374 + ], + "score": 1.0, + "content": "mal vectors in", + "type": "text" + }, + { + "bbox": [ + 165, + 360, + 178, + 370 + ], + "score": 0.87, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 358, + 297, + 374 + ], + "score": 1.0, + "content": ". For the initial state, for each", + "type": "text" + }, + { + "bbox": [ + 298, + 360, + 325, + 372 + ], + "score": 0.92, + "content": "c \\in [ d ]", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 358, + 365, + 374 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 365, + 361, + 424, + 372 + ], + "score": 0.91, + "content": "\\phi ( s _ { 1 } , a _ { c } ) = e _ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 358, + 429, + 374 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 348, + 505, + 374 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 376, + 504, + 404 + ], + "lines": [ + { + "bbox": [ + 105, + 375, + 504, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 277, + 391 + ], + "score": 1.0, + "content": "Now we define the feature mapping when", + "type": "text" + }, + { + "bbox": [ + 278, + 377, + 353, + 389 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 375, + 396, + 391 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 396, + 377, + 471, + 389 + ], + "score": 0.9, + "content": "h \\in \\{ 2 , 3 , \\ldots , H \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 375, + 475, + 391 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 476, + 378, + 504, + 388 + ], + "score": 0.82, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 388, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 123, + 405 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 389, + 284, + 404 + ], + "score": 0.8, + "content": "c \\in [ \\hat { d } ] , \\phi ( s _ { h } ^ { c } , a ) = e _ { c } , \\phi ( s _ { h } ^ { + } , a ) = e _ { \\hat { d } + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 388, + 302, + 405 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 302, + 390, + 370, + 404 + ], + "score": 0.92, + "content": "\\phi ( s _ { h } ^ { - } , a ) = e _ { \\hat { d } + 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 388, + 475, + 405 + ], + "score": 1.0, + "content": ". Moreover, for all actions", + "type": "text" + }, + { + "bbox": [ + 475, + 391, + 501, + 401 + ], + "score": 0.88, + "content": "a \\in { \\mathcal { A } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 388, + 506, + 405 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 375, + 506, + 405 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 159, + 408, + 450, + 441 + ], + "lines": [ + { + "bbox": [ + 159, + 408, + 450, + 441 + ], + "spans": [ + { + "bbox": [ + 159, + 408, + 450, + 441 + ], + "score": 0.94, + "content": "\\phi ( s _ { h } ^ { \\hat { d } + 1 } , a ) = \\left\\{ { \\begin{array} { l l } { e _ { \\hat { d } + 2 + c } } & { a = a _ { c } , c \\in [ { \\hat { d } } ] } \\\\ { { \\frac { 1 } { d ^ { 1 / 2 } } } \\left( e _ { 1 } + e _ { 2 } + \\ldots + e _ { \\hat { d } } \\right) } & { a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\ldots , a _ { d } \\right\\} } \\end{array} } \\right. .", + "type": "interline_equation", + "image_path": "3498e2809bc51250e1241c52184c87309d17438b131a1b68fb48c01d2312e276.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 159, + 408, + 450, + 419.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 159, + 419.0, + 450, + 430.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 159, + 430.0, + 450, + 441.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 445, + 297, + 459 + ], + "lines": [ + { + "bbox": [ + 106, + 445, + 298, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 233, + 460 + ], + "score": 1.0, + "content": "Clearly, for all (s, a) ∈ S × A,", + "type": "text" + }, + { + "bbox": [ + 234, + 446, + 295, + 459 + ], + "score": 0.76, + "content": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 445, + 298, + 460 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 445, + 298, + 460 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 469, + 505, + 493 + ], + "lines": [ + { + "bbox": [ + 106, + 468, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 387, + 483 + ], + "score": 1.0, + "content": "Verifying Assumption 5. Now we consider the deterministic policy", + "type": "text" + }, + { + "bbox": [ + 388, + 470, + 433, + 480 + ], + "score": 0.89, + "content": "\\pi : { \\mathcal { S } } A", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 468, + 506, + 483 + ], + "score": 1.0, + "content": ", which is defined", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 480, + 369, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 128, + 493 + ], + "score": 1.0, + "content": "to be", + "type": "text" + }, + { + "bbox": [ + 129, + 481, + 172, + 493 + ], + "score": 0.92, + "content": "\\pi ( s ) = a _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 480, + 199, + 493 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 200, + 481, + 224, + 491 + ], + "score": 0.89, + "content": "s \\in S", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 480, + 369, + 493 + ], + "score": 1.0, + "content": ". We show that Assumption 5 holds.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 468, + 506, + 493 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 497, + 189, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 496, + 189, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 496, + 133, + 510 + ], + "score": 1.0, + "content": "When", + "type": "text" + }, + { + "bbox": [ + 133, + 498, + 158, + 508 + ], + "score": 0.9, + "content": "h = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 496, + 189, + 510 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 106, + 496, + 189, + 510 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 158, + 513, + 453, + 549 + ], + "lines": [ + { + "bbox": [ + 158, + 513, + 453, + 549 + ], + "spans": [ + { + "bbox": [ + 158, + 513, + 453, + 549 + ], + "score": 0.93, + "content": "\\theta _ { 1 } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - 3 ) / 2 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } + \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - 2 ) / 2 } \\cdot e _ { \\hat { d } + 2 + c } .", + "type": "interline_equation", + "image_path": "b0f7eb3020ffacb568382bd05c55fe286cf5c19a1f426007fdc721000df37147.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 158, + 513, + 453, + 525.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 158, + 525.0, + 453, + 537.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 158, + 537.0, + 453, + 549.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 558, + 266, + 572 + ], + "lines": [ + { + "bbox": [ + 106, + 559, + 266, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 143, + 572 + ], + "score": 1.0, + "content": "For each", + "type": "text" + }, + { + "bbox": [ + 144, + 559, + 235, + 572 + ], + "score": 0.92, + "content": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 559, + 266, + 572 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 559, + 266, + 572 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 146, + 576, + 463, + 612 + ], + "lines": [ + { + "bbox": [ + 146, + 576, + 463, + 612 + ], + "spans": [ + { + "bbox": [ + 146, + 576, + 463, + 612 + ], + "score": 0.93, + "content": "\\theta _ { h } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - h - 1 ) / 2 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } + \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - h - 2 ) / 2 } \\cdot e _ { \\hat { d } + 2 + c } .", + "type": "interline_equation", + "image_path": "29b2bb5c7fea1f396573160e775cfc55b3fe971fa9c8e9868b297ec621610580.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 146, + 576, + 463, + 588.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 146, + 588.0, + 463, + 600.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 146, + 600.0, + 463, + 612.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 282, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 282, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 205, + 634 + ], + "score": 1.0, + "content": "For the second last level", + "type": "text" + }, + { + "bbox": [ + 205, + 623, + 252, + 633 + ], + "score": 0.92, + "content": "h = H - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 622, + 282, + 634 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32, + "bbox_fs": [ + 106, + 622, + 282, + 634 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 637, + 378, + 673 + ], + "lines": [ + { + "bbox": [ + 232, + 637, + 378, + 673 + ], + "spans": [ + { + "bbox": [ + 232, + 637, + 378, + 673 + ], + "score": 0.94, + "content": "\\theta _ { H - 1 } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } .", + "type": "interline_equation", + "image_path": "ae4a86643acf6941e5673bf4a1888cd7c2991b52c17b90361afecfc59f872b74.jpg" + } + ] + } + ], + "index": 33.5, + "virtual_lines": [ + { + "bbox": [ + 232, + 637, + 378, + 655.0 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 232, + 655.0, + 378, + 673.0 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 683, + 265, + 695 + ], + "lines": [ + { + "bbox": [ + 106, + 683, + 265, + 696 + ], + "spans": [ + { + "bbox": [ + 106, + 683, + 205, + 696 + ], + "score": 1.0, + "content": "Finally, for the last level", + "type": "text" + }, + { + "bbox": [ + 206, + 684, + 235, + 694 + ], + "score": 0.89, + "content": "h = H", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 683, + 265, + 696 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 106, + 683, + 265, + 696 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 264, + 700, + 345, + 715 + ], + "lines": [ + { + "bbox": [ + 264, + 700, + 345, + 715 + ], + "spans": [ + { + "bbox": [ + 264, + 700, + 345, + 715 + ], + "score": 0.89, + "content": "\\theta _ { H } = e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } .", + "type": "interline_equation", + "image_path": "54bfceffda606069ff016716960840835aa9b52c6640364dc3b678b6cae64510.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 264, + 700, + 345, + 715 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 719, + 453, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 717, + 454, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 717, + 228, + 735 + ], + "score": 1.0, + "content": "It can be verified that for each", + "type": "text" + }, + { + "bbox": [ + 228, + 720, + 262, + 732 + ], + "score": 0.82, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 717, + 266, + 735 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 266, + 719, + 355, + 733 + ], + "score": 0.91, + "content": "Q _ { h } ^ { \\pi } ( s , a ) = \\theta _ { h } ^ { \\top } \\phi ( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 717, + 384, + 735 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 384, + 720, + 450, + 732 + ], + "score": 0.91, + "content": "( s , a ) \\in S _ { h } \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 717, + 454, + 735 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 717, + 454, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 81, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 376, + 94 + ], + "score": 1.0, + "content": "The Data Distributions. For the first level, the data distribution", + "type": "text" + }, + { + "bbox": [ + 376, + 84, + 388, + 94 + ], + "score": 0.85, + "content": "\\mu _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "is defined to be the uniform", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 177, + 107 + ], + "score": 1.0, + "content": "distribution over", + "type": "text" + }, + { + "bbox": [ + 178, + 93, + 266, + 106 + ], + "score": 0.9, + "content": "\\{ ( s _ { 1 } , a _ { c } ) ~ | ~ c ~ \\in ~ [ d ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 92, + 313, + 107 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 314, + 94, + 345, + 105 + ], + "score": 0.9, + "content": "h \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 92, + 436, + 107 + ], + "score": 1.0, + "content": ", the data distribution", + "type": "text" + }, + { + "bbox": [ + 436, + 95, + 449, + 105 + ], + "score": 0.85, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 92, + 506, + 107 + ], + "score": 1.0, + "content": "is a uniform", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 175, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 175, + 116 + ], + "score": 1.0, + "content": "distribution over", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "interline_equation", + "bbox": [ + 122, + 117, + 489, + 135 + ], + "lines": [ + { + "bbox": [ + 122, + 117, + 489, + 135 + ], + "spans": [ + { + "bbox": [ + 122, + 117, + 489, + 135 + ], + "score": 0.91, + "content": "\\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { + } , a _ { 1 } ) , ( s _ { h } ^ { - } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { 2 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } } ) \\} .", + "type": "interline_equation", + "image_path": "98895987379f06852e232c87b7cac8b00890955f81df350fcbcb45bf6a0654bc.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 122, + 117, + 489, + 135 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 141, + 505, + 167 + ], + "lines": [ + { + "bbox": [ + 102, + 134, + 510, + 162 + ], + "spans": [ + { + "bbox": [ + 102, + 134, + 178, + 162 + ], + "score": 1.0, + "content": "Notice that again", + "type": "text" + }, + { + "bbox": [ + 178, + 138, + 216, + 154 + ], + "score": 0.93, + "content": "( s _ { h } ^ { \\hat { d } + 1 } , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 134, + 311, + 162 + ], + "score": 1.0, + "content": "is not in the support of", + "type": "text" + }, + { + "bbox": [ + 312, + 144, + 324, + 154 + ], + "score": 0.87, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 134, + 384, + 162 + ], + "score": 1.0, + "content": "for all actions", + "type": "text" + }, + { + "bbox": [ + 384, + 140, + 491, + 156 + ], + "score": 0.92, + "content": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 134, + 510, + 162 + ], + "score": 1.0, + "content": ". It", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 154, + 237, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 199, + 167 + ], + "score": 1.0, + "content": "can be seen that for all", + "type": "text" + }, + { + "bbox": [ + 199, + 155, + 232, + 167 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 154, + 237, + 167 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "interline_equation", + "bbox": [ + 206, + 170, + 404, + 204 + ], + "lines": [ + { + "bbox": [ + 206, + 170, + 404, + 204 + ], + "spans": [ + { + "bbox": [ + 206, + 170, + 404, + 204 + ], + "score": 0.93, + "content": "\\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } [ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } ] = \\frac { 1 } { d } \\sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \\top } = \\frac { 1 } { d } I .", + "type": "interline_equation", + "image_path": "b8f2754fd3e36c53d393f132679c299d7058189e6326959279130cb2a1054ff0.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 206, + 170, + 404, + 204 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 197, + 218 + ], + "lines": [ + { + "bbox": [ + 105, + 204, + 198, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 198, + 221 + ], + "score": 1.0, + "content": "Moreover, by defining", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 223, + 470, + 293 + ], + "lines": [ + { + "bbox": [ + 138, + 223, + 470, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 223, + 470, + 293 + ], + "score": 0.95, + "content": "\\pi _ { \\operatorname* { d a t a } } ( s ) = \\left\\{ \\begin{array} { l l } { \\operatorname { U n i f o r m } ( A ) } & { s = s _ { 1 } } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { c } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} , c \\in [ \\hat { d } ] \\} } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { + } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { - } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\\\ { \\operatorname { U n i f o r m } ( \\{ a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } } \\} ) } & { s \\in \\{ s _ { h } ^ { \\hat { d } + 1 } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\end{array} \\right. ,", + "type": "interline_equation", + "image_path": "18de4b21531d8a3ec8c9779582f02d0ff0c5e5bd98bf3a4718066e7864c111d0.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 138, + 223, + 470, + 246.33333333333334 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 138, + 246.33333333333334, + 470, + 269.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 138, + 269.6666666666667, + 470, + 293.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 295, + 257, + 309 + ], + "lines": [ + { + "bbox": [ + 103, + 293, + 253, + 311 + ], + "spans": [ + { + "bbox": [ + 103, + 293, + 141, + 311 + ], + "score": 1.0, + "content": "we have", + "type": "text" + }, + { + "bbox": [ + 142, + 296, + 191, + 309 + ], + "score": 0.91, + "content": "\\mu _ { h } = \\mu _ { h } ^ { \\pi _ { \\mathrm { d a t a } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 293, + 220, + 311 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 220, + 296, + 253, + 308 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 318, + 506, + 403 + ], + "lines": [ + { + "bbox": [ + 106, + 319, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 505, + 332 + ], + "score": 1.0, + "content": "The Lower Bound. Now we show that it is information-theoretically hard for any algorithm to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 329, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 104, + 329, + 188, + 346 + ], + "score": 1.0, + "content": "distinguish the case", + "type": "text" + }, + { + "bbox": [ + 188, + 333, + 219, + 343 + ], + "score": 0.88, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 329, + 237, + 346 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 238, + 330, + 306, + 343 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 329, + 506, + 346 + ], + "score": 1.0, + "content": "in the offline setting by taking samples from the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 342, + 507, + 359 + ], + "spans": [ + { + "bbox": [ + 104, + 342, + 177, + 359 + ], + "score": 1.0, + "content": "data distributions", + "type": "text" + }, + { + "bbox": [ + 177, + 343, + 214, + 356 + ], + "score": 0.92, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 342, + 356, + 359 + ], + "score": 1.0, + "content": ". Here we consider the above policy", + "type": "text" + }, + { + "bbox": [ + 357, + 345, + 364, + 353 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 342, + 507, + 359 + ], + "score": 1.0, + "content": "defined above which returns action", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 354, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 107, + 356, + 118, + 365 + ], + "score": 0.82, + "content": "a _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 354, + 266, + 367 + ], + "score": 1.0, + "content": "for all input states. Notice that when", + "type": "text" + }, + { + "bbox": [ + 267, + 355, + 295, + 366 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 354, + 506, + 367 + ], + "score": 1.0, + "content": ", the value of the policy would be zero. On the other", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 363, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 104, + 363, + 155, + 381 + ], + "score": 1.0, + "content": "hand, when", + "type": "text" + }, + { + "bbox": [ + 155, + 365, + 222, + 378 + ], + "score": 0.93, + "content": "\\stackrel { \\cdot } { r } _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 363, + 358, + 381 + ], + "score": 1.0, + "content": ", the value of the policy would be", + "type": "text" + }, + { + "bbox": [ + 358, + 365, + 433, + 378 + ], + "score": 0.92, + "content": "r _ { 0 } \\cdot \\hat { d } ^ { ( \\overleftarrow { H } - 2 ) / 2 } = 1 .", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 363, + 506, + 381 + ], + "score": 1.0, + "content": ". Therefore, if the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 378, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 433, + 390 + ], + "score": 1.0, + "content": "algorithm approximates the value of the policy up to an approximation error of", + "type": "text" + }, + { + "bbox": [ + 433, + 378, + 449, + 390 + ], + "score": 0.8, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 378, + 506, + 390 + ], + "score": 1.0, + "content": ", then it must", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 389, + 322, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 204, + 402 + ], + "score": 1.0, + "content": "distinguish the case that", + "type": "text" + }, + { + "bbox": [ + 204, + 391, + 233, + 402 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 390, + 251, + 402 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 251, + 389, + 317, + 402 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 390, + 322, + 402 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 407, + 505, + 458 + ], + "lines": [ + { + "bbox": [ + 104, + 404, + 507, + 426 + ], + "spans": [ + { + "bbox": [ + 104, + 404, + 236, + 426 + ], + "score": 1.0, + "content": "We first notice that for the case", + "type": "text" + }, + { + "bbox": [ + 237, + 410, + 268, + 421 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 404, + 287, + 426 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 287, + 407, + 356, + 421 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 404, + 448, + 426 + ], + "score": 1.0, + "content": ", the data distributions", + "type": "text" + }, + { + "bbox": [ + 448, + 409, + 486, + 422 + ], + "score": 0.93, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 404, + 507, + 426 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 421, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 174, + 434 + ], + "score": 1.0, + "content": "feature mapping", + "type": "text" + }, + { + "bbox": [ + 175, + 421, + 246, + 434 + ], + "score": 0.91, + "content": "\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 421, + 293, + 434 + ], + "score": 1.0, + "content": ", the policy", + "type": "text" + }, + { + "bbox": [ + 293, + 424, + 301, + 432 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 421, + 480, + 434 + ], + "score": 1.0, + "content": "to be evaluated and the reward distributions", + "type": "text" + }, + { + "bbox": [ + 480, + 423, + 489, + 432 + ], + "score": 0.82, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 421, + 506, + 434 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 431, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 104, + 431, + 304, + 448 + ], + "score": 1.0, + "content": "the same. Thus, in order to distinguish the case", + "type": "text" + }, + { + "bbox": [ + 304, + 435, + 336, + 446 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 431, + 355, + 448 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 355, + 433, + 424, + 446 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 431, + 506, + 448 + ], + "score": 1.0, + "content": ", the only way is to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 446, + 443, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 222, + 458 + ], + "score": 1.0, + "content": "query the transition operator", + "type": "text" + }, + { + "bbox": [ + 222, + 446, + 231, + 456 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 446, + 443, + 458 + ], + "score": 1.0, + "content": "by using sampling taken from the data distributions.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 461, + 505, + 557 + ], + "lines": [ + { + "bbox": [ + 106, + 462, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 230, + 475 + ], + "score": 1.0, + "content": "Now, for all state-action pairs", + "type": "text" + }, + { + "bbox": [ + 230, + 463, + 253, + 474 + ], + "score": 0.92, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 462, + 457, + 475 + ], + "score": 1.0, + "content": "in the support of the data distributions of the first", + "type": "text" + }, + { + "bbox": [ + 457, + 463, + 486, + 473 + ], + "score": 0.85, + "content": "H - 2", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 462, + 506, + 475 + ], + "score": 1.0, + "content": "lev-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 100, + 473, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 100, + 473, + 122, + 509 + ], + "score": 1.0, + "content": "elsing", + "type": "text" + }, + { + "bbox": [ + 133, + 473, + 158, + 509 + ], + "score": 1.0, + "content": "amely only", + "type": "text" + }, + { + "bbox": [ + 158, + 475, + 233, + 486 + ], + "score": 0.88, + "content": "\\mu _ { 1 } , \\mu _ { 2 } , \\ldots , \\mu _ { H - 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 473, + 312, + 509 + ], + "score": 1.0, + "content": ", the transition opeion distributions of", + "type": "text" + }, + { + "bbox": [ + 484, + 473, + 506, + 509 + ], + "score": 1.0, + "content": "ang-, and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 122, + 484, + 483, + 501 + ], + "spans": [ + { + "bbox": [ + 122, + 489, + 133, + 499 + ], + "score": 0.83, + "content": "r _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 484, + 483, + 501 + ], + "score": 0.89, + "content": "( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } + 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } ) , \\dots , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { d } )", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 251, + 498, + 510, + 535 + ], + "spans": [ + { + "bbox": [ + 251, + 498, + 299, + 535 + ], + "score": 1.0, + "content": "support of in the supp", + "type": "text" + }, + { + "bbox": [ + 312, + 498, + 322, + 535 + ], + "score": 1.0, + "content": "f of", + "type": "text" + }, + { + "bbox": [ + 347, + 501, + 411, + 513 + ], + "score": 0.88, + "content": "h ~ \\in ~ [ H \\mathrm { ~ - ~ } 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 498, + 510, + 535 + ], + "score": 1.0, + "content": ". Moreover, for anyso be identical no mat-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 511, + 383, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 250, + 528 + ], + "score": 0.92, + "content": "( s , a ) \\in \\{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \\hat { d } + 1 } \\} \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 516, + 347, + 527 + ], + "score": 0.72, + "content": "\\mu _ { H - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 514, + 383, + 527 + ], + "score": 0.82, + "content": "P ( s , a )", + "type": "inline_equation" + } + ], + "index": 26 + }, + { + "bbox": [ + 102, + 524, + 507, + 544 + ], + "spans": [ + { + "bbox": [ + 102, + 524, + 120, + 544 + ], + "score": 1.0, + "content": "ter", + "type": "text" + }, + { + "bbox": [ + 120, + 529, + 153, + 540 + ], + "score": 0.89, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 524, + 167, + 544 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 167, + 528, + 237, + 540 + ], + "score": 0.9, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 524, + 360, + 544 + ], + "score": 1.0, + "content": ". For those state-action pairs", + "type": "text" + }, + { + "bbox": [ + 360, + 529, + 383, + 541 + ], + "score": 0.91, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 524, + 457, + 544 + ], + "score": 1.0, + "content": "in the support of", + "type": "text" + }, + { + "bbox": [ + 457, + 531, + 482, + 541 + ], + "score": 0.87, + "content": "\\mu _ { H - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 524, + 507, + 544 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 537, + 254, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 210, + 557 + ], + "score": 0.92, + "content": "s \\not \\in \\{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \\hat { d } + 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 537, + 254, + 563 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 209, + 560, + 401, + 589 + ], + "lines": [ + { + "bbox": [ + 209, + 560, + 401, + 589 + ], + "spans": [ + { + "bbox": [ + 209, + 560, + 401, + 589 + ], + "score": 0.93, + "content": "P ( s , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h } \\ p r o b a b i l i t y \\ ( 1 + r _ { 0 } ) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h } \\ p r o b a b i l i t y \\ ( 1 - r _ { 0 } ) / 2 } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "3923d7417aca0ce99b714732257f17509ea4cdfc956725d9ef4dd19654d62acb.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 209, + 560, + 401, + 589 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 594, + 492, + 610 + ], + "lines": [ + { + "bbox": [ + 101, + 588, + 490, + 615 + ], + "spans": [ + { + "bbox": [ + 101, + 588, + 196, + 615 + ], + "score": 1.0, + "content": "Again, this is because", + "type": "text" + }, + { + "bbox": [ + 197, + 593, + 237, + 609 + ], + "score": 0.93, + "content": "( s _ { H - 1 } ^ { \\hat { d } + 1 } , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 588, + 330, + 615 + ], + "score": 1.0, + "content": "is not in the support of", + "type": "text" + }, + { + "bbox": [ + 331, + 598, + 356, + 608 + ], + "score": 0.84, + "content": "\\mu _ { H - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 588, + 383, + 615 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 384, + 596, + 490, + 610 + ], + "score": 0.91, + "content": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}", + "type": "inline_equation" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 615, + 504, + 638 + ], + "lines": [ + { + "bbox": [ + 104, + 613, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 104, + 613, + 276, + 631 + ], + "score": 1.0, + "content": "Therefore, in order to distinguish the case", + "type": "text" + }, + { + "bbox": [ + 276, + 618, + 305, + 628 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 613, + 323, + 631 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 324, + 615, + 390, + 628 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 613, + 506, + 631 + ], + "score": 1.0, + "content": ", the agent needs distinguish", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 628, + 217, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 217, + 640 + ], + "score": 1.0, + "content": "two transition distributions", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 636, + 376, + 665 + ], + "lines": [ + { + "bbox": [ + 236, + 636, + 376, + 665 + ], + "spans": [ + { + "bbox": [ + 236, + 636, + 376, + 665 + ], + "score": 0.91, + "content": "p _ { 1 } = { \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\\\ { s _ { H } ^ { - } } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\end{array} \\right. }", + "type": "interline_equation", + "image_path": "0fe8bae359e8250df180debadc1391756ffe35c0d55a1e67825fa124ecc85b2f.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 236, + 636, + 376, + 665 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 667, + 124, + 677 + ], + "lines": [ + { + "bbox": [ + 105, + 666, + 124, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 124, + 677 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "interline_equation", + "bbox": [ + 202, + 674, + 406, + 707 + ], + "lines": [ + { + "bbox": [ + 202, + 674, + 406, + 707 + ], + "spans": [ + { + "bbox": [ + 202, + 674, + 406, + 707 + ], + "score": 0.92, + "content": "p _ { 2 } = \\left\\{ s _ { H } ^ { + } \\quad \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } ( 1 + \\hat { d } ^ { - ( H - 2 ) / 2 } ) / 2 \\right.", + "type": "interline_equation", + "image_path": "213c2d1f6f8006f0ad57680ab50cc19ad912456c73418c5c8a550f318dc82780.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 202, + 674, + 406, + 707 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 708, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 707, + 504, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 707, + 298, + 721 + ], + "score": 1.0, + "content": "Again, by Lemma B.1, in order to distinguish", + "type": "text" + }, + { + "bbox": [ + 299, + 710, + 309, + 720 + ], + "score": 0.84, + "content": "p _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 707, + 329, + 721 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 329, + 710, + 340, + 720 + ], + "score": 0.83, + "content": "p _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 707, + 504, + 721 + ], + "score": 1.0, + "content": "with probability at least 0.9, one needs", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 717, + 354, + 734 + ], + "spans": [ + { + "bbox": [ + 107, + 719, + 145, + 732 + ], + "score": 0.92, + "content": "\\Omega ( \\hat { d } ^ { H - 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 717, + 354, + 734 + ], + "score": 1.0, + "content": "samples. Formally, we have the following theorem.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 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 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 81, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 376, + 94 + ], + "score": 1.0, + "content": "The Data Distributions. For the first level, the data distribution", + "type": "text" + }, + { + "bbox": [ + 376, + 84, + 388, + 94 + ], + "score": 0.85, + "content": "\\mu _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "is defined to be the uniform", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 177, + 107 + ], + "score": 1.0, + "content": "distribution over", + "type": "text" + }, + { + "bbox": [ + 178, + 93, + 266, + 106 + ], + "score": 0.9, + "content": "\\{ ( s _ { 1 } , a _ { c } ) ~ | ~ c ~ \\in ~ [ d ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 92, + 313, + 107 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 314, + 94, + 345, + 105 + ], + "score": 0.9, + "content": "h \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 92, + 436, + 107 + ], + "score": 1.0, + "content": ", the data distribution", + "type": "text" + }, + { + "bbox": [ + 436, + 95, + 449, + 105 + ], + "score": 0.85, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 92, + 506, + 107 + ], + "score": 1.0, + "content": "is a uniform", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 175, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 175, + 116 + ], + "score": 1.0, + "content": "distribution over", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 506, + 116 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 122, + 117, + 489, + 135 + ], + "lines": [ + { + "bbox": [ + 122, + 117, + 489, + 135 + ], + "spans": [ + { + "bbox": [ + 122, + 117, + 489, + 135 + ], + "score": 0.91, + "content": "\\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { + } , a _ { 1 } ) , ( s _ { h } ^ { - } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { 2 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } } ) \\} .", + "type": "interline_equation", + "image_path": "98895987379f06852e232c87b7cac8b00890955f81df350fcbcb45bf6a0654bc.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 122, + 117, + 489, + 135 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 141, + 505, + 167 + ], + "lines": [ + { + "bbox": [ + 102, + 134, + 510, + 162 + ], + "spans": [ + { + "bbox": [ + 102, + 134, + 178, + 162 + ], + "score": 1.0, + "content": "Notice that again", + "type": "text" + }, + { + "bbox": [ + 178, + 138, + 216, + 154 + ], + "score": 0.93, + "content": "( s _ { h } ^ { \\hat { d } + 1 } , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 134, + 311, + 162 + ], + "score": 1.0, + "content": "is not in the support of", + "type": "text" + }, + { + "bbox": [ + 312, + 144, + 324, + 154 + ], + "score": 0.87, + "content": "\\mu _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 134, + 384, + 162 + ], + "score": 1.0, + "content": "for all actions", + "type": "text" + }, + { + "bbox": [ + 384, + 140, + 491, + 156 + ], + "score": 0.92, + "content": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 134, + 510, + 162 + ], + "score": 1.0, + "content": ". It", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 154, + 237, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 199, + 167 + ], + "score": 1.0, + "content": "can be seen that for all", + "type": "text" + }, + { + "bbox": [ + 199, + 155, + 232, + 167 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 154, + 237, + 167 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 102, + 134, + 510, + 167 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 206, + 170, + 404, + 204 + ], + "lines": [ + { + "bbox": [ + 206, + 170, + 404, + 204 + ], + "spans": [ + { + "bbox": [ + 206, + 170, + 404, + 204 + ], + "score": 0.93, + "content": "\\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } [ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } ] = \\frac { 1 } { d } \\sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \\top } = \\frac { 1 } { d } I .", + "type": "interline_equation", + "image_path": "b8f2754fd3e36c53d393f132679c299d7058189e6326959279130cb2a1054ff0.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 206, + 170, + 404, + 204 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 197, + 218 + ], + "lines": [ + { + "bbox": [ + 105, + 204, + 198, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 198, + 221 + ], + "score": 1.0, + "content": "Moreover, by defining", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 204, + 198, + 221 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 223, + 470, + 293 + ], + "lines": [ + { + "bbox": [ + 138, + 223, + 470, + 293 + ], + "spans": [ + { + "bbox": [ + 138, + 223, + 470, + 293 + ], + "score": 0.95, + "content": "\\pi _ { \\operatorname* { d a t a } } ( s ) = \\left\\{ \\begin{array} { l l } { \\operatorname { U n i f o r m } ( A ) } & { s = s _ { 1 } } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { c } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} , c \\in [ \\hat { d } ] \\} } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { + } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { - } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\\\ { \\operatorname { U n i f o r m } ( \\{ a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } } \\} ) } & { s \\in \\{ s _ { h } ^ { \\hat { d } + 1 } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\end{array} \\right. ,", + "type": "interline_equation", + "image_path": "18de4b21531d8a3ec8c9779582f02d0ff0c5e5bd98bf3a4718066e7864c111d0.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 138, + 223, + 470, + 246.33333333333334 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 138, + 246.33333333333334, + 470, + 269.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 138, + 269.6666666666667, + 470, + 293.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 295, + 257, + 309 + ], + "lines": [ + { + "bbox": [ + 103, + 293, + 253, + 311 + ], + "spans": [ + { + "bbox": [ + 103, + 293, + 141, + 311 + ], + "score": 1.0, + "content": "we have", + "type": "text" + }, + { + "bbox": [ + 142, + 296, + 191, + 309 + ], + "score": 0.91, + "content": "\\mu _ { h } = \\mu _ { h } ^ { \\pi _ { \\mathrm { d a t a } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 293, + 220, + 311 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 220, + 296, + 253, + 308 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 103, + 293, + 253, + 311 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 318, + 506, + 403 + ], + "lines": [ + { + "bbox": [ + 106, + 319, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 505, + 332 + ], + "score": 1.0, + "content": "The Lower Bound. Now we show that it is information-theoretically hard for any algorithm to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 329, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 104, + 329, + 188, + 346 + ], + "score": 1.0, + "content": "distinguish the case", + "type": "text" + }, + { + "bbox": [ + 188, + 333, + 219, + 343 + ], + "score": 0.88, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 329, + 237, + 346 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 238, + 330, + 306, + 343 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 329, + 506, + 346 + ], + "score": 1.0, + "content": "in the offline setting by taking samples from the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 342, + 507, + 359 + ], + "spans": [ + { + "bbox": [ + 104, + 342, + 177, + 359 + ], + "score": 1.0, + "content": "data distributions", + "type": "text" + }, + { + "bbox": [ + 177, + 343, + 214, + 356 + ], + "score": 0.92, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 342, + 356, + 359 + ], + "score": 1.0, + "content": ". Here we consider the above policy", + "type": "text" + }, + { + "bbox": [ + 357, + 345, + 364, + 353 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 342, + 507, + 359 + ], + "score": 1.0, + "content": "defined above which returns action", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 354, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 107, + 356, + 118, + 365 + ], + "score": 0.82, + "content": "a _ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 354, + 266, + 367 + ], + "score": 1.0, + "content": "for all input states. Notice that when", + "type": "text" + }, + { + "bbox": [ + 267, + 355, + 295, + 366 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 354, + 506, + 367 + ], + "score": 1.0, + "content": ", the value of the policy would be zero. On the other", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 363, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 104, + 363, + 155, + 381 + ], + "score": 1.0, + "content": "hand, when", + "type": "text" + }, + { + "bbox": [ + 155, + 365, + 222, + 378 + ], + "score": 0.93, + "content": "\\stackrel { \\cdot } { r } _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 363, + 358, + 381 + ], + "score": 1.0, + "content": ", the value of the policy would be", + "type": "text" + }, + { + "bbox": [ + 358, + 365, + 433, + 378 + ], + "score": 0.92, + "content": "r _ { 0 } \\cdot \\hat { d } ^ { ( \\overleftarrow { H } - 2 ) / 2 } = 1 .", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 363, + 506, + 381 + ], + "score": 1.0, + "content": ". Therefore, if the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 378, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 433, + 390 + ], + "score": 1.0, + "content": "algorithm approximates the value of the policy up to an approximation error of", + "type": "text" + }, + { + "bbox": [ + 433, + 378, + 449, + 390 + ], + "score": 0.8, + "content": "1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 378, + 506, + 390 + ], + "score": 1.0, + "content": ", then it must", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 389, + 322, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 204, + 402 + ], + "score": 1.0, + "content": "distinguish the case that", + "type": "text" + }, + { + "bbox": [ + 204, + 391, + 233, + 402 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 390, + 251, + 402 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 251, + 389, + 317, + 402 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 390, + 322, + 402 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15, + "bbox_fs": [ + 104, + 319, + 507, + 402 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 407, + 505, + 458 + ], + "lines": [ + { + "bbox": [ + 104, + 404, + 507, + 426 + ], + "spans": [ + { + "bbox": [ + 104, + 404, + 236, + 426 + ], + "score": 1.0, + "content": "We first notice that for the case", + "type": "text" + }, + { + "bbox": [ + 237, + 410, + 268, + 421 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 404, + 287, + 426 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 287, + 407, + 356, + 421 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 404, + 448, + 426 + ], + "score": 1.0, + "content": ", the data distributions", + "type": "text" + }, + { + "bbox": [ + 448, + 409, + 486, + 422 + ], + "score": 0.93, + "content": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 404, + 507, + 426 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 421, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 174, + 434 + ], + "score": 1.0, + "content": "feature mapping", + "type": "text" + }, + { + "bbox": [ + 175, + 421, + 246, + 434 + ], + "score": 0.91, + "content": "\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 421, + 293, + 434 + ], + "score": 1.0, + "content": ", the policy", + "type": "text" + }, + { + "bbox": [ + 293, + 424, + 301, + 432 + ], + "score": 0.78, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 421, + 480, + 434 + ], + "score": 1.0, + "content": "to be evaluated and the reward distributions", + "type": "text" + }, + { + "bbox": [ + 480, + 423, + 489, + 432 + ], + "score": 0.82, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 421, + 506, + 434 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 431, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 104, + 431, + 304, + 448 + ], + "score": 1.0, + "content": "the same. Thus, in order to distinguish the case", + "type": "text" + }, + { + "bbox": [ + 304, + 435, + 336, + 446 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 431, + 355, + 448 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 355, + 433, + 424, + 446 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 431, + 506, + 448 + ], + "score": 1.0, + "content": ", the only way is to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 446, + 443, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 222, + 458 + ], + "score": 1.0, + "content": "query the transition operator", + "type": "text" + }, + { + "bbox": [ + 222, + 446, + 231, + 456 + ], + "score": 0.84, + "content": "P", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 446, + 443, + 458 + ], + "score": 1.0, + "content": "by using sampling taken from the data distributions.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5, + "bbox_fs": [ + 104, + 404, + 507, + 458 + ] + }, + { + "type": "list", + "bbox": [ + 106, + 461, + 505, + 557 + ], + "lines": [ + { + "bbox": [ + 106, + 462, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 230, + 475 + ], + "score": 1.0, + "content": "Now, for all state-action pairs", + "type": "text" + }, + { + "bbox": [ + 230, + 463, + 253, + 474 + ], + "score": 0.92, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 462, + 457, + 475 + ], + "score": 1.0, + "content": "in the support of the data distributions of the first", + "type": "text" + }, + { + "bbox": [ + 457, + 463, + 486, + 473 + ], + "score": 0.85, + "content": "H - 2", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 462, + 506, + 475 + ], + "score": 1.0, + "content": "lev-", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 100, + 473, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 100, + 473, + 122, + 509 + ], + "score": 1.0, + "content": "elsing", + "type": "text" + }, + { + "bbox": [ + 133, + 473, + 158, + 509 + ], + "score": 1.0, + "content": "amely only", + "type": "text" + }, + { + "bbox": [ + 158, + 475, + 233, + 486 + ], + "score": 0.88, + "content": "\\mu _ { 1 } , \\mu _ { 2 } , \\ldots , \\mu _ { H - 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 473, + 312, + 509 + ], + "score": 1.0, + "content": ", the transition opeion distributions of", + "type": "text" + }, + { + "bbox": [ + 484, + 473, + 506, + 509 + ], + "score": 1.0, + "content": "ang-, and", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 122, + 484, + 483, + 501 + ], + "spans": [ + { + "bbox": [ + 122, + 489, + 133, + 499 + ], + "score": 0.83, + "content": "r _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 484, + 483, + 501 + ], + "score": 0.89, + "content": "( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } + 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } ) , \\dots , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { d } )", + "type": "inline_equation" + } + ], + "index": 25, + "is_list_end_line": true + }, + { + "bbox": [ + 251, + 498, + 510, + 535 + ], + "spans": [ + { + "bbox": [ + 251, + 498, + 299, + 535 + ], + "score": 1.0, + "content": "support of in the supp", + "type": "text" + }, + { + "bbox": [ + 312, + 498, + 322, + 535 + ], + "score": 1.0, + "content": "f of", + "type": "text" + }, + { + "bbox": [ + 347, + 501, + 411, + 513 + ], + "score": 0.88, + "content": "h ~ \\in ~ [ H \\mathrm { ~ - ~ } 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 498, + 510, + 535 + ], + "score": 1.0, + "content": ". Moreover, for anyso be identical no mat-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 511, + 383, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 250, + 528 + ], + "score": 0.92, + "content": "( s , a ) \\in \\{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \\hat { d } + 1 } \\} \\times \\mathcal { A }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 516, + 347, + 527 + ], + "score": 0.72, + "content": "\\mu _ { H - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 514, + 383, + 527 + ], + "score": 0.82, + "content": "P ( s , a )", + "type": "inline_equation" + } + ], + "index": 26, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 102, + 524, + 507, + 544 + ], + "spans": [ + { + "bbox": [ + 102, + 524, + 120, + 544 + ], + "score": 1.0, + "content": "ter", + "type": "text" + }, + { + "bbox": [ + 120, + 529, + 153, + 540 + ], + "score": 0.89, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 524, + 167, + 544 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 167, + 528, + 237, + 540 + ], + "score": 0.9, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 524, + 360, + 544 + ], + "score": 1.0, + "content": ". For those state-action pairs", + "type": "text" + }, + { + "bbox": [ + 360, + 529, + 383, + 541 + ], + "score": 0.91, + "content": "( s , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 524, + 457, + 544 + ], + "score": 1.0, + "content": "in the support of", + "type": "text" + }, + { + "bbox": [ + 457, + 531, + 482, + 541 + ], + "score": 0.87, + "content": "\\mu _ { H - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 524, + 507, + 544 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 537, + 254, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 210, + 557 + ], + "score": 0.92, + "content": "s \\not \\in \\{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \\hat { d } + 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 537, + 254, + 563 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 26, + "bbox_fs": [ + 100, + 462, + 510, + 563 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 209, + 560, + 401, + 589 + ], + "lines": [ + { + "bbox": [ + 209, + 560, + 401, + 589 + ], + "spans": [ + { + "bbox": [ + 209, + 560, + 401, + 589 + ], + "score": 0.93, + "content": "P ( s , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h } \\ p r o b a b i l i t y \\ ( 1 + r _ { 0 } ) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h } \\ p r o b a b i l i t y \\ ( 1 - r _ { 0 } ) / 2 } \\end{array} \\right. .", + "type": "interline_equation", + "image_path": "3923d7417aca0ce99b714732257f17509ea4cdfc956725d9ef4dd19654d62acb.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 209, + 560, + 401, + 589 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 594, + 492, + 610 + ], + "lines": [ + { + "bbox": [ + 101, + 588, + 490, + 615 + ], + "spans": [ + { + "bbox": [ + 101, + 588, + 196, + 615 + ], + "score": 1.0, + "content": "Again, this is because", + "type": "text" + }, + { + "bbox": [ + 197, + 593, + 237, + 609 + ], + "score": 0.93, + "content": "( s _ { H - 1 } ^ { \\hat { d } + 1 } , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 588, + 330, + 615 + ], + "score": 1.0, + "content": "is not in the support of", + "type": "text" + }, + { + "bbox": [ + 331, + 598, + 356, + 608 + ], + "score": 0.84, + "content": "\\mu _ { H - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 588, + 383, + 615 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 384, + 596, + 490, + 610 + ], + "score": 0.91, + "content": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}", + "type": "inline_equation" + } + ], + "index": 31 + } + ], + "index": 31, + "bbox_fs": [ + 101, + 588, + 490, + 615 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 615, + 504, + 638 + ], + "lines": [ + { + "bbox": [ + 104, + 613, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 104, + 613, + 276, + 631 + ], + "score": 1.0, + "content": "Therefore, in order to distinguish the case", + "type": "text" + }, + { + "bbox": [ + 276, + 618, + 305, + 628 + ], + "score": 0.91, + "content": "r _ { 0 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 613, + 323, + 631 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 324, + 615, + 390, + 628 + ], + "score": 0.92, + "content": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 613, + 506, + 631 + ], + "score": 1.0, + "content": ", the agent needs distinguish", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 628, + 217, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 217, + 640 + ], + "score": 1.0, + "content": "two transition distributions", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 104, + 613, + 506, + 640 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 636, + 376, + 665 + ], + "lines": [ + { + "bbox": [ + 236, + 636, + 376, + 665 + ], + "spans": [ + { + "bbox": [ + 236, + 636, + 376, + 665 + ], + "score": 0.91, + "content": "p _ { 1 } = { \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\\\ { s _ { H } ^ { - } } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\end{array} \\right. }", + "type": "interline_equation", + "image_path": "0fe8bae359e8250df180debadc1391756ffe35c0d55a1e67825fa124ecc85b2f.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 236, + 636, + 376, + 665 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 667, + 124, + 677 + ], + "lines": [ + { + "bbox": [ + 105, + 666, + 124, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 124, + 677 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 666, + 124, + 677 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 202, + 674, + 406, + 707 + ], + "lines": [ + { + "bbox": [ + 202, + 674, + 406, + 707 + ], + "spans": [ + { + "bbox": [ + 202, + 674, + 406, + 707 + ], + "score": 0.92, + "content": "p _ { 2 } = \\left\\{ s _ { H } ^ { + } \\quad \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } ( 1 + \\hat { d } ^ { - ( H - 2 ) / 2 } ) / 2 \\right.", + "type": "interline_equation", + "image_path": "213c2d1f6f8006f0ad57680ab50cc19ad912456c73418c5c8a550f318dc82780.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 202, + 674, + 406, + 707 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 708, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 707, + 504, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 707, + 298, + 721 + ], + "score": 1.0, + "content": "Again, by Lemma B.1, in order to distinguish", + "type": "text" + }, + { + "bbox": [ + 299, + 710, + 309, + 720 + ], + "score": 0.84, + "content": "p _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 707, + 329, + 721 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 329, + 710, + 340, + 720 + ], + "score": 0.83, + "content": "p _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 707, + 504, + 721 + ], + "score": 1.0, + "content": "with probability at least 0.9, one needs", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 717, + 354, + 734 + ], + "spans": [ + { + "bbox": [ + 107, + 719, + 145, + 732 + ], + "score": 0.92, + "content": "\\Omega ( \\hat { d } ^ { H - 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 717, + 354, + 734 + ], + "score": 1.0, + "content": "samples. Formally, we have the following theorem.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 106, + 707, + 504, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Theorem C.1. Suppose Assumption 2 holds, and rewards are deterministic and could be none-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "zero only for state-action pairs in the last level. Fix an algorithm that takes as input both a policy", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "and a feature mapping. There exists an MDP satisfying Assumption 5, such that for a fixed policy", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 112, + 506, + 130 + ], + "spans": [ + { + "bbox": [ + 107, + 115, + 152, + 126 + ], + "score": 0.89, + "content": "\\pi : { \\mathcal { S } } A", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 112, + 247, + 130 + ], + "score": 1.0, + "content": ", the algorithm requires", + "type": "text" + }, + { + "bbox": [ + 247, + 114, + 316, + 127 + ], + "score": 0.92, + "content": "\\Omega ( ( d / 2 - 1 ) ^ { H / 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 112, + 506, + 130 + ], + "score": 1.0, + "content": "samples to output the value of π up to constant", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 125, + 339, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 339, + 139 + ], + "score": 1.0, + "content": "additive approximation error with probability at least 0.9.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "title", + "bbox": [ + 108, + 153, + 273, + 166 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 275, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 275, + 167 + ], + "score": 1.0, + "content": "D ANALYSIS OF ALGORITHM 1", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 176, + 228, + 189 + ], + "lines": [ + { + "bbox": [ + 106, + 176, + 230, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 230, + 190 + ], + "score": 1.0, + "content": "D.1 PROOF OF LEMMA 5.1", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 198, + 139, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 142, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 142, + 212 + ], + "score": 1.0, + "content": "Clearly,", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 209, + 514, + 386 + ], + "lines": [], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 111, + 209, + 514, + 268.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 111, + 268.0, + 514, + 327.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 111, + 327.0, + 514, + 386.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 385, + 214, + 395 + ], + "lines": [ + { + "bbox": [ + 106, + 383, + 164, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 164, + 397 + ], + "score": 1.0, + "content": "For the first te", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 240, + 567, + 558 + ], + "lines": [ + { + "bbox": [ + 165, + 240, + 567, + 558 + ], + "spans": [ + { + "bbox": [ + 165, + 240, + 567, + 558 + ], + "score": 0.25, + "content": "\\begin{array} { r l } & { \\frac { 1 } { \\sqrt { 3 } } \\sum _ { k \\geq 0 , k \\leq 1 } \\bar { \\zeta } _ { k } \\bigg ( \\frac { 1 } { 2 } \\eta _ { k } ^ { 2 } \\bigg ( \\mathbb { E } _ { k } \\| \\hat { \\zeta } _ { k } \\| ^ { 2 } \\eta _ { k } ^ { 2 } \\bigg ( \\mathbb { E } _ { k } \\| \\hat { \\zeta } _ { k } \\| ^ { 2 } \\eta _ { k } ^ { 2 } \\bigg ) \\bigg ) } \\\\ & { \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\end{array}", + "type": "interline_equation", + "image_path": "a794e2984d07f734f3b1f7eee9882b84ec8c3c8980c3b8a66b48b1ae2f524bab.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 165, + 240, + 567, + 346.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 165, + 346.0, + 567, + 452.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 165, + 452.0, + 567, + 558.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 179, + 396, + 430, + 625 + ], + "lines": [], + "index": 22.0, + "virtual_lines": [ + { + "bbox": [ + 179, + 396, + 430, + 410.3125 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 179, + 410.3125, + 430, + 424.625 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 179, + 424.625, + 430, + 438.9375 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 179, + 438.9375, + 430, + 453.25 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 179, + 453.25, + 430, + 467.5625 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 179, + 467.5625, + 430, + 481.875 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 179, + 481.875, + 430, + 496.1875 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 179, + 496.1875, + 430, + 510.5 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 179, + 510.5, + 430, + 524.8125 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 179, + 524.8125, + 430, + 539.125 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 179, + 539.125, + 430, + 553.4375 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 179, + 553.4375, + 430, + 567.75 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 179, + 567.75, + 430, + 582.0625 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 179, + 582.0625, + 430, + 596.375 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 179, + 596.375, + 430, + 610.6875 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 179, + 610.6875, + 430, + 625.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 150, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 620, + 152, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 620, + 152, + 634 + ], + "score": 1.0, + "content": "Therefore,", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 631, + 448, + 731 + ], + "lines": [ + { + "bbox": [ + 162, + 631, + 448, + 731 + ], + "spans": [ + { + "bbox": [ + 162, + 631, + 448, + 731 + ], + "score": 0.92, + "content": "\\begin{array} { l } { \\displaystyle \\hat { \\theta } _ { 1 } - \\theta _ { 1 } = ( \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } \\xi _ { 1 } - \\lambda \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\theta _ { 1 } ) + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } ( \\theta _ { 2 } - \\hat { \\theta } _ { 2 } ) } \\\\ { \\displaystyle = ( \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } \\xi _ { 1 } - \\lambda \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\theta _ { 1 } ) + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } ( \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\xi _ { 2 } - \\lambda \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\theta _ { 2 } ) } \\\\ { \\displaystyle \\quad \\quad + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } ( \\theta _ { 3 } - \\hat { \\theta } _ { 3 } ) } \\\\ { \\displaystyle \\quad = \\ldots } \\\\ { \\displaystyle \\quad = \\sum _ { h = 1 } ^ { H } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\ldots ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "2a3f5d3a13ff2478cb320974abe1bd48a8543ddb6d99844d86ae3f2995a70a01.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 162, + 631, + 448, + 664.3333333333334 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 162, + 664.3333333333334, + 448, + 697.6666666666667 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 162, + 697.6666666666667, + 448, + 731.0000000000001 + ], + "spans": [], + "index": 34 + } + ] + } + ], + "page_idx": 17, + "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, + 763 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "18", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Theorem C.1. Suppose Assumption 2 holds, and rewards are deterministic and could be none-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "zero only for state-action pairs in the last level. Fix an algorithm that takes as input both a policy", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "and a feature mapping. There exists an MDP satisfying Assumption 5, such that for a fixed policy", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 112, + 506, + 130 + ], + "spans": [ + { + "bbox": [ + 107, + 115, + 152, + 126 + ], + "score": 0.89, + "content": "\\pi : { \\mathcal { S } } A", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 112, + 247, + 130 + ], + "score": 1.0, + "content": ", the algorithm requires", + "type": "text" + }, + { + "bbox": [ + 247, + 114, + 316, + 127 + ], + "score": 0.92, + "content": "\\Omega ( ( d / 2 - 1 ) ^ { H / 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 112, + 506, + 130 + ], + "score": 1.0, + "content": "samples to output the value of π up to constant", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 125, + 339, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 339, + 139 + ], + "score": 1.0, + "content": "additive approximation error with probability at least 0.9.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 82, + 506, + 139 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 153, + 273, + 166 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 275, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 275, + 167 + ], + "score": 1.0, + "content": "D ANALYSIS OF ALGORITHM 1", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 176, + 228, + 189 + ], + "lines": [ + { + "bbox": [ + 106, + 176, + 230, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 230, + 190 + ], + "score": 1.0, + "content": "D.1 PROOF OF LEMMA 5.1", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 176, + 230, + 190 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 198, + 139, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 142, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 142, + 212 + ], + "score": 1.0, + "content": "Clearly,", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 195, + 142, + 212 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 209, + 514, + 386 + ], + "lines": [], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 111, + 209, + 514, + 268.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 111, + 268.0, + 514, + 327.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 111, + 327.0, + 514, + 386.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 385, + 214, + 395 + ], + "lines": [ + { + "bbox": [ + 106, + 383, + 164, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 164, + 397 + ], + "score": 1.0, + "content": "For the first te", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 383, + 164, + 397 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 240, + 567, + 558 + ], + "lines": [ + { + "bbox": [ + 165, + 240, + 567, + 558 + ], + "spans": [ + { + "bbox": [ + 165, + 240, + 567, + 558 + ], + "score": 0.25, + "content": "\\begin{array} { r l } & { \\frac { 1 } { \\sqrt { 3 } } \\sum _ { k \\geq 0 , k \\leq 1 } \\bar { \\zeta } _ { k } \\bigg ( \\frac { 1 } { 2 } \\eta _ { k } ^ { 2 } \\bigg ( \\mathbb { E } _ { k } \\| \\hat { \\zeta } _ { k } \\| ^ { 2 } \\eta _ { k } ^ { 2 } \\bigg ( \\mathbb { E } _ { k } \\| \\hat { \\zeta } _ { k } \\| ^ { 2 } \\eta _ { k } ^ { 2 } \\bigg ) \\bigg ) } \\\\ & { \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\end{array}", + "type": "interline_equation", + "image_path": "a794e2984d07f734f3b1f7eee9882b84ec8c3c8980c3b8a66b48b1ae2f524bab.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 165, + 240, + 567, + 346.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 165, + 346.0, + 567, + 452.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 165, + 452.0, + 567, + 558.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 179, + 396, + 430, + 625 + ], + "lines": [], + "index": 22.0, + "virtual_lines": [ + { + "bbox": [ + 179, + 396, + 430, + 410.3125 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 179, + 410.3125, + 430, + 424.625 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 179, + 424.625, + 430, + 438.9375 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 179, + 438.9375, + 430, + 453.25 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 179, + 453.25, + 430, + 467.5625 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 179, + 467.5625, + 430, + 481.875 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 179, + 481.875, + 430, + 496.1875 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 179, + 496.1875, + 430, + 510.5 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 179, + 510.5, + 430, + 524.8125 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 179, + 524.8125, + 430, + 539.125 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 179, + 539.125, + 430, + 553.4375 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 179, + 553.4375, + 430, + 567.75 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 179, + 567.75, + 430, + 582.0625 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 179, + 582.0625, + 430, + 596.375 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 179, + 596.375, + 430, + 610.6875 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 179, + 610.6875, + 430, + 625.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 150, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 620, + 152, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 620, + 152, + 634 + ], + "score": 1.0, + "content": "Therefore,", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31, + "bbox_fs": [ + 106, + 620, + 152, + 634 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 631, + 448, + 731 + ], + "lines": [ + { + "bbox": [ + 162, + 631, + 448, + 731 + ], + "spans": [ + { + "bbox": [ + 162, + 631, + 448, + 731 + ], + "score": 0.92, + "content": "\\begin{array} { l } { \\displaystyle \\hat { \\theta } _ { 1 } - \\theta _ { 1 } = ( \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } \\xi _ { 1 } - \\lambda \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\theta _ { 1 } ) + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } ( \\theta _ { 2 } - \\hat { \\theta } _ { 2 } ) } \\\\ { \\displaystyle = ( \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } \\xi _ { 1 } - \\lambda \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\theta _ { 1 } ) + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } ( \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\xi _ { 2 } - \\lambda \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\theta _ { 2 } ) } \\\\ { \\displaystyle \\quad \\quad + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } ( \\theta _ { 3 } - \\hat { \\theta } _ { 3 } ) } \\\\ { \\displaystyle \\quad = \\ldots } \\\\ { \\displaystyle \\quad = \\sum _ { h = 1 } ^ { H } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\ldots ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "2a3f5d3a13ff2478cb320974abe1bd48a8543ddb6d99844d86ae3f2995a70a01.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 162, + 631, + 448, + 664.3333333333334 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 162, + 664.3333333333334, + 448, + 697.6666666666667 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 162, + 697.6666666666667, + 448, + 731.0000000000001 + ], + "spans": [], + "index": 34 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 165, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 165, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 165, + 95 + ], + "score": 1.0, + "content": "Also note that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 91, + 406, + 109 + ], + "lines": [ + { + "bbox": [ + 204, + 91, + 406, + 109 + ], + "spans": [ + { + "bbox": [ + 204, + 91, + 406, + 109 + ], + "score": 0.89, + "content": "\\begin{array} { r } { ( Q ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } = \\| \\theta _ { 1 } - \\hat { \\theta } _ { 1 } \\| _ { \\bar { \\Lambda } _ { 1 } } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "80cd714ffe24921aa94bd54a18fc45075e46a89d468f6ac7919e07b9b06ed96a.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 204, + 91, + 406, + 109 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 120, + 240, + 133 + ], + "lines": [ + { + "bbox": [ + 105, + 120, + 240, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 240, + 133 + ], + "score": 1.0, + "content": "D.2 PROOF OF THEOREM 5.2", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 105, + 141, + 431, + 154 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 432, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 432, + 155 + ], + "score": 1.0, + "content": "By matrix concentration inequality (Tropp, 2015), we have the following lemma.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 156, + 504, + 178 + ], + "lines": [ + { + "bbox": [ + 105, + 155, + 505, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 202, + 170 + ], + "score": 1.0, + "content": "Lemma D.1. For each", + "type": "text" + }, + { + "bbox": [ + 203, + 157, + 238, + 169 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 155, + 309, + 170 + ], + "score": 1.0, + "content": ", with probability", + "type": "text" + }, + { + "bbox": [ + 309, + 156, + 359, + 169 + ], + "score": 0.92, + "content": "1 - \\delta / ( 4 H )", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 155, + 478, + 170 + ], + "score": 1.0, + "content": ", for some universal constant", + "type": "text" + }, + { + "bbox": [ + 478, + 158, + 487, + 167 + ], + "score": 0.78, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 155, + 505, + 170 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 166, + 129, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 129, + 181 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "interline_equation", + "bbox": [ + 215, + 176, + 394, + 204 + ], + "lines": [ + { + "bbox": [ + 215, + 176, + 394, + 204 + ], + "spans": [ + { + "bbox": [ + 215, + 176, + 394, + 204 + ], + "score": 0.93, + "content": "\\left\\| \\frac { 1 } { N } \\Phi _ { h } ^ { \\top } \\Phi _ { h } - \\Lambda _ { h } \\right\\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) / N } .", + "type": "interline_equation", + "image_path": "c7c64ef9476b39f93cff38824d7eb84c7c88ae51fb7bf4cd1c2c2b697de684d0.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 215, + 176, + 394, + 204 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 124, + 217 + ], + "lines": [ + { + "bbox": [ + 104, + 207, + 124, + 218 + ], + "spans": [ + { + "bbox": [ + 104, + 207, + 124, + 218 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 200, + 214, + 409, + 243 + ], + "lines": [ + { + "bbox": [ + 200, + 214, + 409, + 243 + ], + "spans": [ + { + "bbox": [ + 200, + 214, + 409, + 243 + ], + "score": 0.91, + "content": "\\left\\| \\frac { 1 } { N } \\overline { { \\Phi } } _ { h + 1 } \\overline { { \\Phi } } _ { h + 1 } - \\overline { { \\Lambda } } _ { h + 1 } \\right\\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) / N } .", + "type": "interline_equation", + "image_path": "d18992896bb27ede910b917fc278c6f358083295a4c8af0afb592cf1f1efa217.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 200, + 214, + 409, + 228.5 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 200, + 228.5, + 409, + 243.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 246, + 439, + 260 + ], + "lines": [ + { + "bbox": [ + 105, + 244, + 439, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 173, + 262 + ], + "score": 1.0, + "content": "Therefore, since", + "type": "text" + }, + { + "bbox": [ + 173, + 246, + 280, + 260 + ], + "score": 0.93, + "content": "\\lambda = C H \\sqrt { d \\log ( d H / \\delta ) N }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 244, + 350, + 262 + ], + "score": 1.0, + "content": ", with probability", + "type": "text" + }, + { + "bbox": [ + 350, + 247, + 399, + 259 + ], + "score": 0.92, + "content": "1 - \\delta / ( 4 H )", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 244, + 439, + 262 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 248, + 266, + 362, + 280 + ], + "lines": [ + { + "bbox": [ + 248, + 266, + 362, + 280 + ], + "spans": [ + { + "bbox": [ + 248, + 266, + 362, + 280 + ], + "score": 0.89, + "content": "\\hat { \\Lambda } _ { h } = \\Phi _ { h } ^ { \\top } \\Phi _ { h } + \\lambda I \\succeq N \\Lambda _ { h } .", + "type": "interline_equation", + "image_path": "3c7c5d913557d3e6cd3122de5023e285a00f1ee050cf0b46e2d9c9532373ac7a.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 248, + 266, + 362, + 280 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 146, + 303 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 146, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 146, + 304 + ], + "score": 1.0, + "content": "Note that", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 306, + 514, + 397 + ], + "lines": [ + { + "bbox": [ + 111, + 306, + 514, + 397 + ], + "spans": [ + { + "bbox": [ + 111, + 306, + 514, + 397 + ], + "score": 0.92, + "content": "\\begin{array} { l } { \\displaystyle ( { \\mathcal Q } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } } \\\\ { \\displaystyle \\leq H \\cdot \\left( \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } \\right) } \\\\ { \\displaystyle \\leq 2 H \\cdot \\left( \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } + \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot \\cdot \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } \\right) } \\end{array}", + "type": "interline_equation", + "image_path": "3f640e4d0c72d9b55eaa1cc73875fd439ff8e57122c01f2a179ebeee99f83023.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 111, + 306, + 514, + 336.3333333333333 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 111, + 336.3333333333333, + 514, + 366.66666666666663 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 111, + 366.66666666666663, + 514, + 396.99999999999994 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 399, + 181, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 181, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 143, + 413 + ], + "score": 1.0, + "content": "For each", + "type": "text" + }, + { + "bbox": [ + 144, + 400, + 177, + 412 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 398, + 181, + 413 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 112, + 417, + 499, + 506 + ], + "lines": [ + { + "bbox": [ + 112, + 417, + 499, + 506 + ], + "spans": [ + { + "bbox": [ + 112, + 417, + 499, + 506 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\quad \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\Phi _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\| _ { 2 } \\cdot \\| \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { 2 } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\| \\Phi _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\| _ { 2 } \\cdot \\| \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\cdot \\cdot \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { 2 } ^ { 2 } } \\\\ & \\leq \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\Lambda } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\Phi } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\Lambda } _ h ^ { \\prime } \\end{array}", + "type": "interline_equation", + "image_path": "9ec79d4746f8905d6df4d5b1764ac53c1187875809618c8fcca355596bf01604.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 112, + 417, + 499, + 446.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 112, + 446.6666666666667, + 499, + 476.33333333333337 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 112, + 476.33333333333337, + 499, + 506.00000000000006 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 510, + 147, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 149, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 149, + 524 + ], + "score": 1.0, + "content": "Similarly,", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 116, + 526, + 496, + 617 + ], + "lines": [ + { + "bbox": [ + 116, + 526, + 496, + 617 + ], + "spans": [ + { + "bbox": [ + 116, + 526, + 496, + 617 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\quad \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\boldsymbol { \\Lambda } } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\lambda \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } \\theta _ { h } \\| _ { \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\boldsymbol { \\Lambda } } _ { h + 1 } ^ { - 1 / 2 } \\| _ { 2 } \\Big ) \\cdot \\lambda ^ { 2 } \\cdot \\| \\theta _ { h } \\| _ { \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\lambda \\cdot H ^ { 2 } d . } \\end{array}", + "type": "interline_equation", + "image_path": "5c621ab495cfeba508eb079b25a59deb55cafc7a6cc84ae3556113a3a5c0ce9d.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 116, + 526, + 496, + 556.3333333333334 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 116, + 556.3333333333334, + 496, + 586.6666666666667 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 116, + 586.6666666666667, + 496, + 617.0000000000001 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 626, + 207, + 639 + ], + "lines": [ + { + "bbox": [ + 106, + 626, + 208, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 135, + 640 + ], + "score": 1.0, + "content": "For all", + "type": "text" + }, + { + "bbox": [ + 135, + 627, + 168, + 639 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 626, + 208, + 640 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 266, + 638, + 345, + 654 + ], + "lines": [ + { + "bbox": [ + 266, + 638, + 345, + 654 + ], + "spans": [ + { + "bbox": [ + 266, + 638, + 345, + 654 + ], + "score": 0.81, + "content": "\\| \\Phi _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\| _ { 2 } \\leq 1", + "type": "interline_equation", + "image_path": "c4d24dca6f5eeb28b52e7b0cd4cf24d79557e29cb35c1444a31ecb3b11b235b6.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 266, + 638, + 345, + 654 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 656, + 124, + 667 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 123, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 123, + 667 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 671, + 481, + 689 + ], + "lines": [ + { + "bbox": [ + 129, + 671, + 481, + 689 + ], + "spans": [ + { + "bbox": [ + 129, + 671, + 481, + 689 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\lVert \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } ) \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } \\leq \\lVert N \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } + \\lVert \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } - N \\overline { { \\Lambda } } _ { h } ) \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "71968eb5c3e9ed89a5967df56d332d49517ed473f83f287fb43d7ff9753f6e95.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 129, + 671, + 481, + 689 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 693, + 271, + 705 + ], + "lines": [ + { + "bbox": [ + 106, + 691, + 272, + 707 + ], + "spans": [ + { + "bbox": [ + 106, + 691, + 272, + 707 + ], + "score": 1.0, + "content": "Conditioned on the event in Lemma D.1,", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 259, + 711, + 350, + 735 + ], + "lines": [ + { + "bbox": [ + 259, + 711, + 350, + 735 + ], + "spans": [ + { + "bbox": [ + 259, + 711, + 350, + 735 + ], + "score": 0.93, + "content": "\\hat { \\Lambda } _ { h } \\succeq N \\Lambda _ { h } \\succeq \\frac { N } { C _ { h } } \\overline { { \\Lambda } } _ { h } ,", + "type": "interline_equation", + "image_path": "7b8f444d1ac389152087b23af2e44d27956809a52a2ed169063423f1b4a17333.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 259, + 711, + 350, + 735 + ], + "spans": [], + "index": 29 + } + ] + } + ], + "page_idx": 18, + "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, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "19", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 165, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 165, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 165, + 95 + ], + "score": 1.0, + "content": "Also note that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 165, + 95 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 204, + 91, + 406, + 109 + ], + "lines": [ + { + "bbox": [ + 204, + 91, + 406, + 109 + ], + "spans": [ + { + "bbox": [ + 204, + 91, + 406, + 109 + ], + "score": 0.89, + "content": "\\begin{array} { r } { ( Q ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } = \\| \\theta _ { 1 } - \\hat { \\theta } _ { 1 } \\| _ { \\bar { \\Lambda } _ { 1 } } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "80cd714ffe24921aa94bd54a18fc45075e46a89d468f6ac7919e07b9b06ed96a.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 204, + 91, + 406, + 109 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 120, + 240, + 133 + ], + "lines": [ + { + "bbox": [ + 105, + 120, + 240, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 240, + 133 + ], + "score": 1.0, + "content": "D.2 PROOF OF THEOREM 5.2", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 105, + 141, + 431, + 154 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 432, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 432, + 155 + ], + "score": 1.0, + "content": "By matrix concentration inequality (Tropp, 2015), we have the following lemma.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 141, + 432, + 155 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 156, + 504, + 178 + ], + "lines": [ + { + "bbox": [ + 105, + 155, + 505, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 202, + 170 + ], + "score": 1.0, + "content": "Lemma D.1. For each", + "type": "text" + }, + { + "bbox": [ + 203, + 157, + 238, + 169 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 155, + 309, + 170 + ], + "score": 1.0, + "content": ", with probability", + "type": "text" + }, + { + "bbox": [ + 309, + 156, + 359, + 169 + ], + "score": 0.92, + "content": "1 - \\delta / ( 4 H )", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 155, + 478, + 170 + ], + "score": 1.0, + "content": ", for some universal constant", + "type": "text" + }, + { + "bbox": [ + 478, + 158, + 487, + 167 + ], + "score": 0.78, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 155, + 505, + 170 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 166, + 129, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 129, + 181 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 155, + 505, + 181 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 215, + 176, + 394, + 204 + ], + "lines": [ + { + "bbox": [ + 215, + 176, + 394, + 204 + ], + "spans": [ + { + "bbox": [ + 215, + 176, + 394, + 204 + ], + "score": 0.93, + "content": "\\left\\| \\frac { 1 } { N } \\Phi _ { h } ^ { \\top } \\Phi _ { h } - \\Lambda _ { h } \\right\\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) / N } .", + "type": "interline_equation", + "image_path": "c7c64ef9476b39f93cff38824d7eb84c7c88ae51fb7bf4cd1c2c2b697de684d0.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 215, + 176, + 394, + 204 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 124, + 217 + ], + "lines": [ + { + "bbox": [ + 104, + 207, + 124, + 218 + ], + "spans": [ + { + "bbox": [ + 104, + 207, + 124, + 218 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 104, + 207, + 124, + 218 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 200, + 214, + 409, + 243 + ], + "lines": [ + { + "bbox": [ + 200, + 214, + 409, + 243 + ], + "spans": [ + { + "bbox": [ + 200, + 214, + 409, + 243 + ], + "score": 0.91, + "content": "\\left\\| \\frac { 1 } { N } \\overline { { \\Phi } } _ { h + 1 } \\overline { { \\Phi } } _ { h + 1 } - \\overline { { \\Lambda } } _ { h + 1 } \\right\\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) / N } .", + "type": "interline_equation", + "image_path": "d18992896bb27ede910b917fc278c6f358083295a4c8af0afb592cf1f1efa217.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 200, + 214, + 409, + 228.5 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 200, + 228.5, + 409, + 243.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 246, + 439, + 260 + ], + "lines": [ + { + "bbox": [ + 105, + 244, + 439, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 173, + 262 + ], + "score": 1.0, + "content": "Therefore, since", + "type": "text" + }, + { + "bbox": [ + 173, + 246, + 280, + 260 + ], + "score": 0.93, + "content": "\\lambda = C H \\sqrt { d \\log ( d H / \\delta ) N }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 244, + 350, + 262 + ], + "score": 1.0, + "content": ", with probability", + "type": "text" + }, + { + "bbox": [ + 350, + 247, + 399, + 259 + ], + "score": 0.92, + "content": "1 - \\delta / ( 4 H )", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 244, + 439, + 262 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 244, + 439, + 262 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 248, + 266, + 362, + 280 + ], + "lines": [ + { + "bbox": [ + 248, + 266, + 362, + 280 + ], + "spans": [ + { + "bbox": [ + 248, + 266, + 362, + 280 + ], + "score": 0.89, + "content": "\\hat { \\Lambda } _ { h } = \\Phi _ { h } ^ { \\top } \\Phi _ { h } + \\lambda I \\succeq N \\Lambda _ { h } .", + "type": "interline_equation", + "image_path": "3c7c5d913557d3e6cd3122de5023e285a00f1ee050cf0b46e2d9c9532373ac7a.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 248, + 266, + 362, + 280 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 146, + 303 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 146, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 146, + 304 + ], + "score": 1.0, + "content": "Note that", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 291, + 146, + 304 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 306, + 514, + 397 + ], + "lines": [ + { + "bbox": [ + 111, + 306, + 514, + 397 + ], + "spans": [ + { + "bbox": [ + 111, + 306, + 514, + 397 + ], + "score": 0.92, + "content": "\\begin{array} { l } { \\displaystyle ( { \\mathcal Q } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } } \\\\ { \\displaystyle \\leq H \\cdot \\left( \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } \\right) } \\\\ { \\displaystyle \\leq 2 H \\cdot \\left( \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } + \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot \\cdot \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } \\right) } \\end{array}", + "type": "interline_equation", + "image_path": "3f640e4d0c72d9b55eaa1cc73875fd439ff8e57122c01f2a179ebeee99f83023.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 111, + 306, + 514, + 336.3333333333333 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 111, + 336.3333333333333, + 514, + 366.66666666666663 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 111, + 366.66666666666663, + 514, + 396.99999999999994 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 399, + 181, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 181, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 143, + 413 + ], + "score": 1.0, + "content": "For each", + "type": "text" + }, + { + "bbox": [ + 144, + 400, + 177, + 412 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 398, + 181, + 413 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 398, + 181, + 413 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 112, + 417, + 499, + 506 + ], + "lines": [ + { + "bbox": [ + 112, + 417, + 499, + 506 + ], + "spans": [ + { + "bbox": [ + 112, + 417, + 499, + 506 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\quad \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\Phi _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\| _ { 2 } \\cdot \\| \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { 2 } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\| \\Phi _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\| _ { 2 } \\cdot \\| \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\cdot \\cdot \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { 2 } ^ { 2 } } \\\\ & \\leq \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\Lambda } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\Phi } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\Lambda } _ h ^ { \\prime } \\end{array}", + "type": "interline_equation", + "image_path": "9ec79d4746f8905d6df4d5b1764ac53c1187875809618c8fcca355596bf01604.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 112, + 417, + 499, + 446.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 112, + 446.6666666666667, + 499, + 476.33333333333337 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 112, + 476.33333333333337, + 499, + 506.00000000000006 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 510, + 147, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 149, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 149, + 524 + ], + "score": 1.0, + "content": "Similarly,", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 106, + 508, + 149, + 524 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 116, + 526, + 496, + 617 + ], + "lines": [ + { + "bbox": [ + 116, + 526, + 496, + 617 + ], + "spans": [ + { + "bbox": [ + 116, + 526, + 496, + 617 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\quad \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\boldsymbol { \\Lambda } } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\lambda \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } \\theta _ { h } \\| _ { \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\boldsymbol { \\Lambda } } _ { h + 1 } ^ { - 1 / 2 } \\| _ { 2 } \\Big ) \\cdot \\lambda ^ { 2 } \\cdot \\| \\theta _ { h } \\| _ { \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\lambda \\cdot H ^ { 2 } d . } \\end{array}", + "type": "interline_equation", + "image_path": "5c621ab495cfeba508eb079b25a59deb55cafc7a6cc84ae3556113a3a5c0ce9d.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 116, + 526, + 496, + 556.3333333333334 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 116, + 556.3333333333334, + 496, + 586.6666666666667 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 116, + 586.6666666666667, + 496, + 617.0000000000001 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 626, + 207, + 639 + ], + "lines": [ + { + "bbox": [ + 106, + 626, + 208, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 135, + 640 + ], + "score": 1.0, + "content": "For all", + "type": "text" + }, + { + "bbox": [ + 135, + 627, + 168, + 639 + ], + "score": 0.92, + "content": "h \\in [ H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 626, + 208, + 640 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 106, + 626, + 208, + 640 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 266, + 638, + 345, + 654 + ], + "lines": [ + { + "bbox": [ + 266, + 638, + 345, + 654 + ], + "spans": [ + { + "bbox": [ + 266, + 638, + 345, + 654 + ], + "score": 0.81, + "content": "\\| \\Phi _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\| _ { 2 } \\leq 1", + "type": "interline_equation", + "image_path": "c4d24dca6f5eeb28b52e7b0cd4cf24d79557e29cb35c1444a31ecb3b11b235b6.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 266, + 638, + 345, + 654 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 656, + 124, + 667 + ], + "lines": [ + { + "bbox": [ + 105, + 657, + 123, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 123, + 667 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 657, + 123, + 667 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 671, + 481, + 689 + ], + "lines": [ + { + "bbox": [ + 129, + 671, + 481, + 689 + ], + "spans": [ + { + "bbox": [ + 129, + 671, + 481, + 689 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\lVert \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } ) \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } \\leq \\lVert N \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } + \\lVert \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } - N \\overline { { \\Lambda } } _ { h } ) \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "71968eb5c3e9ed89a5967df56d332d49517ed473f83f287fb43d7ff9753f6e95.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 129, + 671, + 481, + 689 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 693, + 271, + 705 + ], + "lines": [ + { + "bbox": [ + 106, + 691, + 272, + 707 + ], + "spans": [ + { + "bbox": [ + 106, + 691, + 272, + 707 + ], + "score": 1.0, + "content": "Conditioned on the event in Lemma D.1,", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 691, + 272, + 707 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 259, + 711, + 350, + 735 + ], + "lines": [ + { + "bbox": [ + 259, + 711, + 350, + 735 + ], + "spans": [ + { + "bbox": [ + 259, + 711, + 350, + 735 + ], + "score": 0.93, + "content": "\\hat { \\Lambda } _ { h } \\succeq N \\Lambda _ { h } \\succeq \\frac { N } { C _ { h } } \\overline { { \\Lambda } } _ { h } ,", + "type": "interline_equation", + "image_path": "7b8f444d1ac389152087b23af2e44d27956809a52a2ed169063423f1b4a17333.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 259, + 711, + 350, + 735 + ], + "spans": [], + "index": 29 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 79, + 485, + 96 + ], + "lines": [ + { + "bbox": [ + 102, + 77, + 489, + 99 + ], + "spans": [ + { + "bbox": [ + 102, + 77, + 165, + 99 + ], + "score": 1.0, + "content": "which implies", + "type": "text" + }, + { + "bbox": [ + 165, + 80, + 275, + 96 + ], + "score": 0.93, + "content": "\\| N \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\| \\le C _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 77, + 489, + 99 + ], + "score": 1.0, + "content": ". Moreover, conditioned on the event in Lemma D.1,", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 185, + 100, + 425, + 118 + ], + "lines": [ + { + "bbox": [ + 185, + 100, + 425, + 118 + ], + "spans": [ + { + "bbox": [ + 185, + 100, + 425, + 118 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\| \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } - N \\overline { { \\boldsymbol { \\Lambda } } } _ { h } ) \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 / 2 } \\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) N } / \\lambda . } \\end{array}", + "type": "interline_equation", + "image_path": "6e6767671c4e4636a8e1be4af157e7c41a6b480d7d433be88ac37bfbaa41ecec.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 185, + 100, + 425, + 118 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 131, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 133, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 133, + 137 + ], + "score": 1.0, + "content": "Thus,", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 245, + 132, + 365, + 149 + ], + "lines": [ + { + "bbox": [ + 245, + 132, + 365, + 149 + ], + "spans": [ + { + "bbox": [ + 245, + 132, + 365, + 149 + ], + "score": 0.85, + "content": "\\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\leq C _ { 1 } / N .", + "type": "interline_equation", + "image_path": "b2b2548e0ea0b422acc58fff0a4f4b8b8cbe7d7ebb26b29969d18729150d9d3a.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 245, + 132, + 365, + 149 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 151, + 124, + 162 + ], + "lines": [ + { + "bbox": [ + 105, + 151, + 123, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 123, + 162 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 159, + 420, + 176 + ], + "lines": [ + { + "bbox": [ + 189, + 159, + 420, + 176 + ], + "spans": [ + { + "bbox": [ + 189, + 159, + 420, + 176 + ], + "score": 0.85, + "content": "\\begin{array} { r } { \\| \\hat { \\boldsymbol \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } ) \\hat { \\boldsymbol \\Lambda } _ { h } ^ { - 1 / 2 } \\| _ { 2 } \\leq C _ { h } + C \\sqrt { d \\log ( d H / \\delta ) N } / \\lambda . } \\end{array}", + "type": "interline_equation", + "image_path": "ab38e851fc8034ef60893618abc9ebaf82ebe920805527cd6413030127b47dd1.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 189, + 159, + 420, + 176 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 178, + 507, + 199 + ], + "lines": [ + { + "bbox": [ + 105, + 177, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 362, + 191 + ], + "score": 1.0, + "content": "Finally, by Theorem 1.2 in (Hsu et al., 2012a), with probability", + "type": "text" + }, + { + "bbox": [ + 362, + 178, + 411, + 190 + ], + "score": 0.91, + "content": "1 - \\delta / ( 4 H )", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 177, + 489, + 191 + ], + "score": 1.0, + "content": ", for some constant", + "type": "text" + }, + { + "bbox": [ + 490, + 178, + 501, + 188 + ], + "score": 0.85, + "content": "C ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 177, + 505, + 191 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 189, + 142, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 142, + 201 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 198, + 378, + 216 + ], + "lines": [ + { + "bbox": [ + 233, + 198, + 378, + 216 + ], + "spans": [ + { + "bbox": [ + 233, + 198, + 378, + 216 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\| \\xi _ { h } \\| _ { \\Phi _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } } ^ { 2 } \\le C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) . } \\end{array}", + "type": "interline_equation", + "image_path": "338970a0fdadb8f420c39e132f02752370880618d5a28946bca55245ccfbe467.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 233, + 198, + 378, + 216 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 218, + 150, + 230 + ], + "lines": [ + { + "bbox": [ + 105, + 217, + 152, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 217, + 152, + 231 + ], + "score": 1.0, + "content": "Therefore,", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 104, + 234, + 500, + 331 + ], + "lines": [ + { + "bbox": [ + 104, + 234, + 500, + 331 + ], + "spans": [ + { + "bbox": [ + 104, + 234, + 500, + 331 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\quad \\quad \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } + \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\frac { C _ { 1 } } { N } ( C _ { 2 } + C \\sqrt { d \\log ( d / \\delta ) N } / \\lambda ) \\times \\cdots \\times ( C _ { h } + C \\sqrt { d \\log ( d / \\delta ) N } / \\lambda ) \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + \\lambda H } \\\\ & { \\leq \\frac { C _ { 1 } } { N } ( C _ { 2 } + 1 / H ) \\times \\cdots \\times ( C _ { h } + 1 / H ) \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + \\lambda H ^ { 2 } d ) } \\\\ & { \\leq \\frac { e } { N } C _ { 1 } \\times C _ { 2 } \\times \\cdots \\times C _ { h } \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + C d H ^ { 3 } \\sqrt { d \\log ( d H / \\delta ) N } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "47fb03575faea1eded3d4086e380a316e49ba6c7e6e943946002e940f7776085.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 104, + 234, + 500, + 266.3333333333333 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 104, + 266.3333333333333, + 500, + 298.66666666666663 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 104, + 298.66666666666663, + 500, + 330.99999999999994 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 334, + 315, + 346 + ], + "lines": [ + { + "bbox": [ + 106, + 334, + 315, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 122, + 347 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 122, + 335, + 146, + 345 + ], + "score": 0.89, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 334, + 315, + 347 + ], + "score": 1.0, + "content": "be a large enough constant. We now have", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 140, + 351, + 470, + 386 + ], + "lines": [ + { + "bbox": [ + 140, + 351, + 470, + 386 + ], + "spans": [ + { + "bbox": [ + 140, + 351, + 470, + 386 + ], + "score": 0.92, + "content": "\\mathbb { E } _ { s _ { 1 } } [ ( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } ] \\leq c \\cdot \\left( \\prod _ { h = 1 } ^ { H } C _ { h } \\right) \\cdot d H ^ { 5 } \\cdot \\sqrt { \\frac { d \\log ( d H / \\delta ) } { N } } .", + "type": "interline_equation", + "image_path": "5de40fdf574b77713593f0e0355119c739d2cb55032e3a334d676be06484757b.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 140, + 351, + 470, + 362.6666666666667 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 140, + 362.6666666666667, + 470, + 374.33333333333337 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 140, + 374.33333333333337, + 470, + 386.00000000000006 + ], + "spans": [], + "index": 16 + } + ] + } + ], + "page_idx": 19, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 25, + 293, + 38 + ], + "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, + 749, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 749, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 79, + 485, + 96 + ], + "lines": [ + { + "bbox": [ + 102, + 77, + 489, + 99 + ], + "spans": [ + { + "bbox": [ + 102, + 77, + 165, + 99 + ], + "score": 1.0, + "content": "which implies", + "type": "text" + }, + { + "bbox": [ + 165, + 80, + 275, + 96 + ], + "score": 0.93, + "content": "\\| N \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\| \\le C _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 77, + 489, + 99 + ], + "score": 1.0, + "content": ". Moreover, conditioned on the event in Lemma D.1,", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 102, + 77, + 489, + 99 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 185, + 100, + 425, + 118 + ], + "lines": [ + { + "bbox": [ + 185, + 100, + 425, + 118 + ], + "spans": [ + { + "bbox": [ + 185, + 100, + 425, + 118 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\| \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } - N \\overline { { \\boldsymbol { \\Lambda } } } _ { h } ) \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 / 2 } \\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) N } / \\lambda . } \\end{array}", + "type": "interline_equation", + "image_path": "6e6767671c4e4636a8e1be4af157e7c41a6b480d7d433be88ac37bfbaa41ecec.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 185, + 100, + 425, + 118 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 131, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 133, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 133, + 137 + ], + "score": 1.0, + "content": "Thus,", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 122, + 133, + 137 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 245, + 132, + 365, + 149 + ], + "lines": [ + { + "bbox": [ + 245, + 132, + 365, + 149 + ], + "spans": [ + { + "bbox": [ + 245, + 132, + 365, + 149 + ], + "score": 0.85, + "content": "\\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\leq C _ { 1 } / N .", + "type": "interline_equation", + "image_path": "b2b2548e0ea0b422acc58fff0a4f4b8b8cbe7d7ebb26b29969d18729150d9d3a.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 245, + 132, + 365, + 149 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 151, + 124, + 162 + ], + "lines": [ + { + "bbox": [ + 105, + 151, + 123, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 123, + 162 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 151, + 123, + 162 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 159, + 420, + 176 + ], + "lines": [ + { + "bbox": [ + 189, + 159, + 420, + 176 + ], + "spans": [ + { + "bbox": [ + 189, + 159, + 420, + 176 + ], + "score": 0.85, + "content": "\\begin{array} { r } { \\| \\hat { \\boldsymbol \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } ) \\hat { \\boldsymbol \\Lambda } _ { h } ^ { - 1 / 2 } \\| _ { 2 } \\leq C _ { h } + C \\sqrt { d \\log ( d H / \\delta ) N } / \\lambda . } \\end{array}", + "type": "interline_equation", + "image_path": "ab38e851fc8034ef60893618abc9ebaf82ebe920805527cd6413030127b47dd1.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 189, + 159, + 420, + 176 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 178, + 507, + 199 + ], + "lines": [ + { + "bbox": [ + 105, + 177, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 362, + 191 + ], + "score": 1.0, + "content": "Finally, by Theorem 1.2 in (Hsu et al., 2012a), with probability", + "type": "text" + }, + { + "bbox": [ + 362, + 178, + 411, + 190 + ], + "score": 0.91, + "content": "1 - \\delta / ( 4 H )", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 177, + 489, + 191 + ], + "score": 1.0, + "content": ", for some constant", + "type": "text" + }, + { + "bbox": [ + 490, + 178, + 501, + 188 + ], + "score": 0.85, + "content": "C ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 177, + 505, + 191 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 189, + 142, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 142, + 201 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 177, + 505, + 201 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 198, + 378, + 216 + ], + "lines": [ + { + "bbox": [ + 233, + 198, + 378, + 216 + ], + "spans": [ + { + "bbox": [ + 233, + 198, + 378, + 216 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\| \\xi _ { h } \\| _ { \\Phi _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } } ^ { 2 } \\le C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) . } \\end{array}", + "type": "interline_equation", + "image_path": "338970a0fdadb8f420c39e132f02752370880618d5a28946bca55245ccfbe467.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 233, + 198, + 378, + 216 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 218, + 150, + 230 + ], + "lines": [ + { + "bbox": [ + 105, + 217, + 152, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 217, + 152, + 231 + ], + "score": 1.0, + "content": "Therefore,", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 217, + 152, + 231 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 104, + 234, + 500, + 331 + ], + "lines": [ + { + "bbox": [ + 104, + 234, + 500, + 331 + ], + "spans": [ + { + "bbox": [ + 104, + 234, + 500, + 331 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\quad \\quad \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } + \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\frac { C _ { 1 } } { N } ( C _ { 2 } + C \\sqrt { d \\log ( d / \\delta ) N } / \\lambda ) \\times \\cdots \\times ( C _ { h } + C \\sqrt { d \\log ( d / \\delta ) N } / \\lambda ) \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + \\lambda H } \\\\ & { \\leq \\frac { C _ { 1 } } { N } ( C _ { 2 } + 1 / H ) \\times \\cdots \\times ( C _ { h } + 1 / H ) \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + \\lambda H ^ { 2 } d ) } \\\\ & { \\leq \\frac { e } { N } C _ { 1 } \\times C _ { 2 } \\times \\cdots \\times C _ { h } \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + C d H ^ { 3 } \\sqrt { d \\log ( d H / \\delta ) N } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "47fb03575faea1eded3d4086e380a316e49ba6c7e6e943946002e940f7776085.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 104, + 234, + 500, + 266.3333333333333 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 104, + 266.3333333333333, + 500, + 298.66666666666663 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 104, + 298.66666666666663, + 500, + 330.99999999999994 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 334, + 315, + 346 + ], + "lines": [ + { + "bbox": [ + 106, + 334, + 315, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 122, + 347 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 122, + 335, + 146, + 345 + ], + "score": 0.89, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 334, + 315, + 347 + ], + "score": 1.0, + "content": "be a large enough constant. We now have", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 334, + 315, + 347 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 140, + 351, + 470, + 386 + ], + "lines": [ + { + "bbox": [ + 140, + 351, + 470, + 386 + ], + "spans": [ + { + "bbox": [ + 140, + 351, + 470, + 386 + ], + "score": 0.92, + "content": "\\mathbb { E } _ { s _ { 1 } } [ ( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } ] \\leq c \\cdot \\left( \\prod _ { h = 1 } ^ { H } C _ { h } \\right) \\cdot d H ^ { 5 } \\cdot \\sqrt { \\frac { d \\log ( d H / \\delta ) } { N } } .", + "type": "interline_equation", + "image_path": "5de40fdf574b77713593f0e0355119c739d2cb55032e3a334d676be06484757b.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 140, + 351, + 470, + 362.6666666666667 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 140, + 362.6666666666667, + 470, + 374.33333333333337 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 140, + 374.33333333333337, + 470, + 386.00000000000006 + ], + "spans": [], + "index": 16 + } + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/30EvkP2aQLD/30EvkP2aQLD_model.json b/parse/train/30EvkP2aQLD/30EvkP2aQLD_model.json new file mode 100644 index 0000000000000000000000000000000000000000..2c3f8a2bd7049034c8c5c4508f9d656a8d17d22c --- /dev/null +++ b/parse/train/30EvkP2aQLD/30EvkP2aQLD_model.json @@ -0,0 +1,34390 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1468, + 1404, + 1468, + 1404, + 1895, + 298, + 1895 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 398, + 977, + 1302, + 977, + 1302, + 1341, + 398, + 1341 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1912, + 1400, + 1912, + 1400, + 2034, + 299, + 2034 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 398, + 757, + 1302, + 757, + 1302, + 971, + 398, + 971 + ], + "score": 0.97 + }, + { + "category_id": 0, + "poly": [ + 301, + 220, + 1386, + 220, + 1386, + 324, + 301, + 324 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 314, + 377, + 701, + 377, + 701, + 468, + 314, + 468 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 934, + 377, + 1385, + 377, + 1385, + 467, + 934, + 467 + ], + "score": 0.945 + }, + { + "category_id": 0, + "poly": [ + 302, + 1399, + 573, + 1399, + 573, + 1434, + 302, + 1434 + ], + "score": 0.893 + }, + { + "category_id": 1, + "poly": [ + 312, + 516, + 962, + 516, + 962, + 608, + 312, + 608 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.875 + }, + { + "category_id": 0, + "poly": [ + 773, + 688, + 926, + 688, + 926, + 722, + 773, + 722 + ], + "score": 0.868 + }, + { + "category_id": 2, + "poly": [ + 842, + 2089, + 857, + 2089, + 857, + 2112, + 842, + 2112 + ], + "score": 0.612 + }, + { + "category_id": 0, + "poly": [ + 315, + 517, + 525, + 517, + 525, + 546, + 315, + 546 + ], + "score": 0.091 + }, + { + "category_id": 13, + "poly": [ + 1031, + 1713, + 1057, + 1713, + 1057, + 1744, + 1031, + 1744 + ], + "score": 0.84, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 506, + 1974, + 531, + 1974, + 531, + 2005, + 506, + 2005 + ], + "score": 0.84, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 1265, + 1683, + 1290, + 1683, + 1290, + 1713, + 1265, + 1713 + ], + "score": 0.83, + "latex": "Q" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 218.0, + 1389.0, + 218.0, + 1389.0, + 271.0, + 297.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 276.0, + 1199.0, + 276.0, + 1199.0, + 326.0, + 295.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1396.0, + 579.0, + 1396.0, + 579.0, + 1443.0, + 294.0, + 1443.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": [ + 769.0, + 687.0, + 932.0, + 687.0, + 932.0, + 725.0, + 769.0, + 725.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": [ + 311.0, + 511.0, + 529.0, + 511.0, + 529.0, + 552.0, + 311.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1467.0, + 1404.0, + 1467.0, + 1404.0, + 1503.0, + 296.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1498.0, + 1405.0, + 1498.0, + 1405.0, + 1538.0, + 292.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1528.0, + 1406.0, + 1528.0, + 1406.0, + 1565.0, + 292.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1559.0, + 1404.0, + 1559.0, + 1404.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": [ + 294.0, + 1621.0, + 1405.0, + 1621.0, + 1405.0, + 1656.0, + 294.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1650.0, + 1405.0, + 1650.0, + 1405.0, + 1688.0, + 291.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1682.0, + 1264.0, + 1682.0, + 1264.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 1682.0, + 1404.0, + 1682.0, + 1404.0, + 1717.0, + 1291.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1712.0, + 1030.0, + 1712.0, + 1030.0, + 1746.0, + 293.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 1712.0, + 1404.0, + 1712.0, + 1404.0, + 1746.0, + 1058.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1745.0, + 1405.0, + 1745.0, + 1405.0, + 1777.0, + 294.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1773.0, + 1404.0, + 1773.0, + 1404.0, + 1807.0, + 295.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1803.0, + 1402.0, + 1803.0, + 1402.0, + 1835.0, + 296.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1832.0, + 1406.0, + 1832.0, + 1406.0, + 1869.0, + 292.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1865.0, + 729.0, + 1865.0, + 729.0, + 1897.0, + 296.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 976.0, + 1304.0, + 976.0, + 1304.0, + 1010.0, + 395.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1008.0, + 1304.0, + 1008.0, + 1304.0, + 1040.0, + 396.0, + 1040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1037.0, + 1305.0, + 1037.0, + 1305.0, + 1071.0, + 393.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1067.0, + 1306.0, + 1067.0, + 1306.0, + 1102.0, + 394.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1098.0, + 1307.0, + 1098.0, + 1307.0, + 1133.0, + 394.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1129.0, + 1306.0, + 1129.0, + 1306.0, + 1164.0, + 393.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1160.0, + 1305.0, + 1160.0, + 1305.0, + 1192.0, + 393.0, + 1192.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1190.0, + 1305.0, + 1190.0, + 1305.0, + 1225.0, + 394.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1219.0, + 1303.0, + 1219.0, + 1303.0, + 1255.0, + 394.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1251.0, + 1305.0, + 1251.0, + 1305.0, + 1283.0, + 395.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1280.0, + 1304.0, + 1280.0, + 1304.0, + 1314.0, + 394.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1310.0, + 1228.0, + 1310.0, + 1228.0, + 1349.0, + 393.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1909.0, + 1402.0, + 1909.0, + 1402.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 1404.0, + 1943.0, + 1404.0, + 1975.0, + 295.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1974.0, + 505.0, + 1974.0, + 505.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2007.0, + 532.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2001.0, + 1405.0, + 2001.0, + 1405.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 757.0, + 1306.0, + 757.0, + 1306.0, + 794.0, + 394.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 788.0, + 1307.0, + 788.0, + 1307.0, + 825.0, + 394.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 816.0, + 1307.0, + 816.0, + 1307.0, + 856.0, + 392.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 849.0, + 1307.0, + 849.0, + 1307.0, + 886.0, + 393.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 879.0, + 1305.0, + 879.0, + 1305.0, + 915.0, + 393.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 909.0, + 1306.0, + 909.0, + 1306.0, + 944.0, + 393.0, + 944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 940.0, + 1257.0, + 940.0, + 1257.0, + 975.0, + 394.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 371.0, + 503.0, + 371.0, + 503.0, + 416.0, + 311.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 404.0, + 629.0, + 404.0, + 629.0, + 443.0, + 310.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 439.0, + 701.0, + 439.0, + 701.0, + 470.0, + 312.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 931.0, + 375.0, + 1112.0, + 375.0, + 1112.0, + 409.0, + 931.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 407.0, + 1386.0, + 407.0, + 1386.0, + 440.0, + 932.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 933.0, + 438.0, + 1187.0, + 438.0, + 1187.0, + 469.0, + 933.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 517.0, + 526.0, + 517.0, + 526.0, + 546.0, + 314.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 547.0, + 964.0, + 547.0, + 964.0, + 578.0, + 313.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 581.0, + 685.0, + 581.0, + 685.0, + 609.0, + 315.0, + 609.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 853, + 1404, + 853, + 1404, + 1160, + 298, + 1160 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 338, + 1403, + 338, + 1403, + 552, + 298, + 552 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1509, + 1403, + 1509, + 1403, + 1693, + 298, + 1693 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 716, + 1403, + 716, + 1403, + 838, + 298, + 838 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1195, + 1403, + 1195, + 1403, + 1318, + 298, + 1318 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1708, + 1403, + 1708, + 1403, + 1923, + 297, + 1923 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 1329, + 1403, + 1329, + 1403, + 1482, + 298, + 1482 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1400, + 229, + 1400, + 322, + 298, + 322 + ], + "score": 0.963 + }, + { + "category_id": 2, + "poly": [ + 299, + 1949, + 1401, + 1949, + 1401, + 2033, + 299, + 2033 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 293, + 568, + 1401, + 568, + 1401, + 629, + 293, + 629 + ], + "score": 0.946 + }, + { + "category_id": 0, + "poly": [ + 370, + 656, + 1325, + 656, + 1325, + 689, + 370, + 689 + ], + "score": 0.915 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2112, + 841, + 2112 + ], + "score": 0.734 + }, + { + "category_id": 13, + "poly": [ + 777, + 1511, + 802, + 1511, + 802, + 1543, + 777, + 1543 + ], + "score": 0.86, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 925, + 1978, + 1030, + 1978, + 1030, + 2008, + 925, + 2008 + ], + "score": 0.85, + "latex": "1 / \\mathrm { p o l y } ( d )" + }, + { + "category_id": 13, + "poly": [ + 320, + 401, + 338, + 401, + 338, + 428, + 320, + 428 + ], + "score": 0.79, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 769, + 1361, + 795, + 1361, + 795, + 1392, + 769, + 1392 + ], + "score": 0.78, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 458, + 462, + 477, + 462, + 477, + 488, + 458, + 488 + ], + "score": 0.74, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1210, + 1426, + 1230, + 1426, + 1230, + 1449, + 1210, + 1449 + ], + "score": 0.69, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 298, + 1422, + 326, + 1422, + 326, + 1448, + 298, + 1448 + ], + "score": 0.47, + "latex": "H" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1945.0, + 1406.0, + 1945.0, + 1406.0, + 1983.0, + 329.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1973.0, + 924.0, + 1973.0, + 924.0, + 2014.0, + 292.0, + 2014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 1973.0, + 1405.0, + 1973.0, + 1405.0, + 2014.0, + 1031.0, + 2014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 2006.0, + 948.0, + 2006.0, + 948.0, + 2035.0, + 297.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 653.0, + 1329.0, + 653.0, + 1329.0, + 694.0, + 370.0, + 694.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": [ + 295.0, + 853.0, + 1406.0, + 853.0, + 1406.0, + 890.0, + 295.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 881.0, + 1408.0, + 881.0, + 1408.0, + 925.0, + 292.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 915.0, + 1406.0, + 915.0, + 1406.0, + 951.0, + 294.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 945.0, + 1406.0, + 945.0, + 1406.0, + 981.0, + 294.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 976.0, + 1406.0, + 976.0, + 1406.0, + 1012.0, + 294.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1007.0, + 1404.0, + 1007.0, + 1404.0, + 1042.0, + 294.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1037.0, + 1404.0, + 1037.0, + 1404.0, + 1073.0, + 294.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1068.0, + 1404.0, + 1068.0, + 1404.0, + 1103.0, + 294.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1098.0, + 1404.0, + 1098.0, + 1404.0, + 1134.0, + 294.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1129.0, + 1404.0, + 1129.0, + 1404.0, + 1164.0, + 294.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 338.0, + 1403.0, + 338.0, + 1403.0, + 373.0, + 294.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 368.0, + 1404.0, + 368.0, + 1404.0, + 405.0, + 293.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 400.0, + 319.0, + 400.0, + 319.0, + 434.0, + 293.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 400.0, + 1405.0, + 400.0, + 1405.0, + 434.0, + 339.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 428.0, + 1405.0, + 428.0, + 1405.0, + 465.0, + 293.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 458.0, + 457.0, + 458.0, + 457.0, + 497.0, + 293.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 458.0, + 1407.0, + 458.0, + 1407.0, + 497.0, + 478.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 489.0, + 1405.0, + 489.0, + 1405.0, + 526.0, + 293.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 521.0, + 446.0, + 521.0, + 446.0, + 553.0, + 294.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1511.0, + 776.0, + 1511.0, + 776.0, + 1543.0, + 296.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 803.0, + 1511.0, + 1404.0, + 1511.0, + 1404.0, + 1543.0, + 803.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1539.0, + 1407.0, + 1539.0, + 1407.0, + 1578.0, + 293.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1571.0, + 1404.0, + 1571.0, + 1404.0, + 1606.0, + 294.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1604.0, + 1404.0, + 1604.0, + 1404.0, + 1635.0, + 296.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1631.0, + 1405.0, + 1631.0, + 1405.0, + 1667.0, + 294.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1663.0, + 476.0, + 1663.0, + 476.0, + 1695.0, + 296.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 716.0, + 1407.0, + 716.0, + 1407.0, + 752.0, + 293.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 746.0, + 1405.0, + 746.0, + 1405.0, + 782.0, + 293.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 778.0, + 1404.0, + 778.0, + 1404.0, + 814.0, + 293.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 807.0, + 1186.0, + 807.0, + 1186.0, + 842.0, + 292.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1193.0, + 1407.0, + 1193.0, + 1407.0, + 1231.0, + 293.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1227.0, + 1405.0, + 1227.0, + 1405.0, + 1260.0, + 296.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1256.0, + 1407.0, + 1256.0, + 1407.0, + 1293.0, + 293.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1289.0, + 554.0, + 1289.0, + 554.0, + 1318.0, + 296.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1710.0, + 1403.0, + 1710.0, + 1403.0, + 1744.0, + 295.0, + 1744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1740.0, + 1405.0, + 1740.0, + 1405.0, + 1774.0, + 293.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1772.0, + 1403.0, + 1772.0, + 1403.0, + 1803.0, + 295.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1802.0, + 1405.0, + 1802.0, + 1405.0, + 1836.0, + 295.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1831.0, + 1405.0, + 1831.0, + 1405.0, + 1866.0, + 293.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1862.0, + 1405.0, + 1862.0, + 1405.0, + 1897.0, + 293.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1891.0, + 856.0, + 1891.0, + 856.0, + 1926.0, + 294.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1326.0, + 1405.0, + 1326.0, + 1405.0, + 1365.0, + 294.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1358.0, + 768.0, + 1358.0, + 768.0, + 1396.0, + 293.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1358.0, + 1407.0, + 1358.0, + 1407.0, + 1396.0, + 796.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1390.0, + 1405.0, + 1390.0, + 1405.0, + 1427.0, + 294.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1416.0, + 297.0, + 1416.0, + 297.0, + 1460.0, + 293.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1416.0, + 1209.0, + 1416.0, + 1209.0, + 1460.0, + 327.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 1416.0, + 1405.0, + 1416.0, + 1405.0, + 1460.0, + 1231.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1452.0, + 430.0, + 1452.0, + 430.0, + 1490.0, + 292.0, + 1490.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": [ + 294.0, + 261.0, + 1402.0, + 261.0, + 1402.0, + 294.0, + 294.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 292.0, + 1003.0, + 292.0, + 1003.0, + 326.0, + 296.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 567.0, + 1404.0, + 567.0, + 1404.0, + 602.0, + 295.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 599.0, + 1339.0, + 599.0, + 1339.0, + 632.0, + 293.0, + 632.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1315, + 1404, + 1315, + 1404, + 1773, + 298, + 1773 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1789, + 1402, + 1789, + 1402, + 2035, + 298, + 2035 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1135, + 1403, + 1135, + 1403, + 1257, + 298, + 1257 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1400, + 229, + 1400, + 322, + 299, + 322 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 300, + 338, + 1397, + 338, + 1397, + 431, + 300, + 431 + ], + "score": 0.948 + }, + { + "category_id": 0, + "poly": [ + 300, + 1050, + 587, + 1050, + 587, + 1085, + 300, + 1085 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.896 + }, + { + "category_id": 1, + "poly": [ + 296, + 493, + 1407, + 493, + 1407, + 982, + 296, + 982 + ], + "score": 0.894 + }, + { + "category_id": 1, + "poly": [ + 302, + 446, + 1333, + 446, + 1333, + 478, + 302, + 478 + ], + "score": 0.86 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.627 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.315 + }, + { + "category_id": 13, + "poly": [ + 575, + 615, + 681, + 615, + 681, + 649, + 575, + 649 + ], + "score": 0.93, + "latex": "O ( d \\cdot H )" + }, + { + "category_id": 13, + "poly": [ + 486, + 1882, + 549, + 1882, + 549, + 1915, + 486, + 1915 + ], + "score": 0.92, + "latex": "( s , a )" + }, + { + "category_id": 13, + "poly": [ + 1112, + 1882, + 1175, + 1882, + 1175, + 1915, + 1112, + 1915 + ], + "score": 0.9, + "latex": "( s , a )" + }, + { + "category_id": 13, + "poly": [ + 395, + 400, + 475, + 400, + 475, + 428, + 395, + 428 + ], + "score": 0.88, + "latex": "H = 1" + }, + { + "category_id": 13, + "poly": [ + 760, + 617, + 779, + 617, + 779, + 643, + 760, + 643 + ], + "score": 0.8, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1103, + 616, + 1131, + 616, + 1131, + 643, + 1103, + 643 + ], + "score": 0.74, + "latex": "H" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1047.0, + 593.0, + 1047.0, + 593.0, + 1091.0, + 292.0, + 1091.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, + 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, + 1315.0, + 1403.0, + 1315.0, + 1403.0, + 1352.0, + 293.0, + 1352.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": [ + 292.0, + 1375.0, + 1405.0, + 1375.0, + 1405.0, + 1414.0, + 292.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1403.0, + 1405.0, + 1403.0, + 1405.0, + 1446.0, + 292.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1436.0, + 1405.0, + 1436.0, + 1405.0, + 1476.0, + 292.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1469.0, + 1405.0, + 1469.0, + 1405.0, + 1504.0, + 294.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1495.0, + 1405.0, + 1495.0, + 1405.0, + 1538.0, + 292.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1529.0, + 1404.0, + 1529.0, + 1404.0, + 1564.0, + 293.0, + 1564.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, + 1405.0, + 1589.0, + 1405.0, + 1626.0, + 293.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1619.0, + 1404.0, + 1619.0, + 1404.0, + 1656.0, + 293.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1650.0, + 1405.0, + 1650.0, + 1405.0, + 1690.0, + 291.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1682.0, + 1406.0, + 1682.0, + 1406.0, + 1717.0, + 293.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1713.0, + 1404.0, + 1713.0, + 1404.0, + 1745.0, + 294.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1743.0, + 1297.0, + 1743.0, + 1297.0, + 1778.0, + 293.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1789.0, + 1404.0, + 1789.0, + 1404.0, + 1823.0, + 296.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1819.0, + 1404.0, + 1819.0, + 1404.0, + 1853.0, + 294.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1851.0, + 1407.0, + 1851.0, + 1407.0, + 1884.0, + 296.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 485.0, + 1882.0, + 485.0, + 1916.0, + 294.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 1882.0, + 1111.0, + 1882.0, + 1111.0, + 1916.0, + 550.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 1882.0, + 1404.0, + 1882.0, + 1404.0, + 1916.0, + 1176.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1910.0, + 1406.0, + 1910.0, + 1406.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1976.0, + 294.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1971.0, + 1406.0, + 1971.0, + 1406.0, + 2007.0, + 292.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2001.0, + 805.0, + 2001.0, + 805.0, + 2037.0, + 293.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1136.0, + 1404.0, + 1136.0, + 1404.0, + 1168.0, + 296.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1165.0, + 1405.0, + 1165.0, + 1405.0, + 1201.0, + 293.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1196.0, + 1404.0, + 1196.0, + 1404.0, + 1232.0, + 293.0, + 1232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1226.0, + 807.0, + 1226.0, + 807.0, + 1261.0, + 293.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 1404.0, + 230.0, + 1404.0, + 263.0, + 295.0, + 263.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, + 878.0, + 292.0, + 878.0, + 324.0, + 295.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 337.0, + 1402.0, + 337.0, + 1402.0, + 375.0, + 294.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 366.0, + 1402.0, + 366.0, + 1402.0, + 404.0, + 295.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 400.0, + 394.0, + 400.0, + 394.0, + 434.0, + 296.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 400.0, + 1402.0, + 400.0, + 1402.0, + 434.0, + 476.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 493.0, + 1404.0, + 493.0, + 1404.0, + 528.0, + 300.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 524.0, + 1405.0, + 524.0, + 1405.0, + 558.0, + 323.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 555.0, + 1154.0, + 555.0, + 1154.0, + 589.0, + 320.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 585.0, + 1407.0, + 585.0, + 1407.0, + 620.0, + 309.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 612.0, + 574.0, + 612.0, + 574.0, + 650.0, + 322.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 612.0, + 759.0, + 612.0, + 759.0, + 650.0, + 682.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 612.0, + 1102.0, + 612.0, + 1102.0, + 650.0, + 780.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.0, + 612.0, + 1405.0, + 612.0, + 1405.0, + 650.0, + 1132.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 645.0, + 1405.0, + 645.0, + 1405.0, + 680.0, + 322.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 677.0, + 1405.0, + 677.0, + 1405.0, + 712.0, + 323.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 708.0, + 481.0, + 708.0, + 481.0, + 740.0, + 322.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 737.0, + 1404.0, + 737.0, + 1404.0, + 772.0, + 298.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 766.0, + 1405.0, + 766.0, + 1405.0, + 803.0, + 322.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 798.0, + 1404.0, + 798.0, + 1404.0, + 831.0, + 323.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 830.0, + 849.0, + 830.0, + 849.0, + 860.0, + 323.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 858.0, + 1405.0, + 858.0, + 1405.0, + 893.0, + 317.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 890.0, + 1404.0, + 890.0, + 1404.0, + 924.0, + 322.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 919.0, + 1407.0, + 919.0, + 1407.0, + 955.0, + 322.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 950.0, + 1139.0, + 950.0, + 1139.0, + 988.0, + 322.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 444.0, + 1335.0, + 444.0, + 1335.0, + 483.0, + 294.0, + 483.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 459, + 1404, + 459, + 1404, + 766, + 298, + 766 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 804, + 1403, + 804, + 1403, + 988, + 298, + 988 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1403, + 229, + 1403, + 444, + 298, + 444 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1226, + 1404, + 1226, + 1404, + 1411, + 298, + 1411 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1003, + 1403, + 1003, + 1403, + 1188, + 298, + 1188 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1916, + 1402, + 1916, + 1402, + 2035, + 298, + 2035 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1602, + 1404, + 1602, + 1404, + 1882, + 297, + 1882 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 296, + 1531, + 1287, + 1531, + 1287, + 1566, + 296, + 1566 + ], + "score": 0.905 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 813, + 76, + 813, + 104, + 300, + 104 + ], + "score": 0.895 + }, + { + "category_id": 0, + "poly": [ + 299, + 1459, + 1004, + 1459, + 1004, + 1496, + 299, + 1496 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.761 + }, + { + "category_id": 13, + "poly": [ + 747, + 1952, + 1165, + 1952, + 1165, + 2006, + 747, + 2006 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { V _ { h } ^ { \\pi } ( s ) = \\mathbb { E } \\left[ \\sum _ { h ^ { \\prime } = h } ^ { H } r _ { h ^ { \\prime } } \\mid s _ { h } = s , \\pi \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 709, + 1726, + 900, + 1726, + 900, + 1759, + 709, + 1759 + ], + "score": 0.93, + "latex": "\\pi : S \\Delta ( { \\mathcal { A } } )" + }, + { + "category_id": 13, + "poly": [ + 1149, + 1848, + 1241, + 1848, + 1241, + 1882, + 1149, + 1882 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 930, + 1848, + 1070, + 1848, + 1070, + 1882, + 930, + 1882 + ], + "score": 0.92, + "latex": "r _ { h } \\in [ - 1 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 586, + 1696, + 685, + 1696, + 685, + 1728, + 586, + 1728 + ], + "score": 0.92, + "latex": "H \\in \\mathbb { Z } _ { + }" + }, + { + "category_id": 13, + "poly": [ + 397, + 1819, + 495, + 1819, + 495, + 1850, + 397, + 1850 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 1123, + 1533, + 1279, + 1533, + 1279, + 1567, + 1123, + 1567 + ], + "score": 0.92, + "latex": "\\{ 1 , 2 , \\ldots , H \\}" + }, + { + "category_id": 13, + "poly": [ + 357, + 1727, + 446, + 1727, + 446, + 1757, + 357, + 1757 + ], + "score": 0.92, + "latex": "s _ { 1 } \\in { \\mathcal { S } }" + }, + { + "category_id": 13, + "poly": [ + 783, + 1604, + 1041, + 1604, + 1041, + 1637, + 783, + 1637 + ], + "score": 0.91, + "latex": "M = ( \\mathcal { S } , \\mathcal { A } , P , R , H )" + }, + { + "category_id": 13, + "poly": [ + 372, + 2002, + 533, + 2002, + 533, + 2036, + 372, + 2036 + ], + "score": 0.91, + "latex": "V ^ { \\pi } = V _ { 1 } ^ { \\pi } ( s _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 744, + 1918, + 874, + 1918, + 874, + 1951, + 744, + 1951 + ], + "score": 0.91, + "latex": "\\textit { h } \\in \\ [ H ]" + }, + { + "category_id": 13, + "poly": [ + 1161, + 1665, + 1401, + 1665, + 1401, + 1698, + 1161, + 1698 + ], + "score": 0.9, + "latex": "\\Dot { R : } \\Dot { S } \\times \\mathcal { A } \\Delta ( \\mathbb { R } )" + }, + { + "category_id": 13, + "poly": [ + 593, + 1820, + 689, + 1820, + 689, + 1849, + 593, + 1849 + ], + "score": 0.9, + "latex": "S _ { h } \\subseteq S" + }, + { + "category_id": 13, + "poly": [ + 1258, + 1918, + 1402, + 1918, + 1402, + 1953, + 1258, + 1953 + ], + "score": 0.9, + "latex": "Q _ { h } ^ { \\pi } ( s , a ) \\ =" + }, + { + "category_id": 13, + "poly": [ + 296, + 1951, + 690, + 1951, + 690, + 2005, + 296, + 2005 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathbb { E } \\left[ \\sum _ { h ^ { \\prime } = h } ^ { H } r _ { h ^ { \\prime } } \\mid s _ { h } = s , a _ { h } = a , \\pi \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 960, + 1636, + 1215, + 1636, + 1215, + 1667, + 960, + 1667 + ], + "score": 0.9, + "latex": "P : \\mathcal { S } \\times \\mathcal { A } \\Delta ( \\mathcal { S } )" + }, + { + "category_id": 13, + "poly": [ + 888, + 1534, + 931, + 1534, + 931, + 1566, + 888, + 1566 + ], + "score": 0.89, + "latex": "[ H ]" + }, + { + "category_id": 13, + "poly": [ + 939, + 1918, + 1159, + 1918, + 1159, + 1951, + 939, + 1951 + ], + "score": 0.89, + "latex": "( s , a ) \\in S _ { h } \\times \\mathcal { A }" + }, + { + "category_id": 13, + "poly": [ + 986, + 1762, + 1393, + 1762, + 1393, + 1789, + 986, + 1789 + ], + "score": 0.88, + "latex": "s _ { 1 } , a _ { 1 } , r _ { 1 } , s _ { 2 } , a _ { 2 } , r _ { 2 } , \\ldots , s _ { H } , a _ { H } , r _ { H }" + }, + { + "category_id": 13, + "poly": [ + 1286, + 1818, + 1320, + 1818, + 1320, + 1848, + 1286, + 1848 + ], + "score": 0.88, + "latex": "S _ { h }" + }, + { + "category_id": 13, + "poly": [ + 897, + 1789, + 1038, + 1789, + 1038, + 1820, + 897, + 1820 + ], + "score": 0.87, + "latex": "a _ { 2 } \\sim \\pi _ { 2 } ( s _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1023, + 1097, + 1048, + 1097, + 1048, + 1127, + 1023, + 1127 + ], + "score": 0.85, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 1052, + 2010, + 1080, + 2010, + 1080, + 2034, + 1052, + 2034 + ], + "score": 0.85, + "latex": "s _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 765, + 1535, + 793, + 1535, + 793, + 1561, + 765, + 1561 + ], + "score": 0.82, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 712, + 1788, + 884, + 1788, + 884, + 1820, + 712, + 1820 + ], + "score": 0.82, + "latex": "s _ { 2 } \\sim P ( s _ { 1 } , a _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 1077, + 1819, + 1096, + 1819, + 1096, + 1846, + 1077, + 1846 + ], + "score": 0.8, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 527, + 1788, + 698, + 1788, + 698, + 1819, + 527, + 1819 + ], + "score": 0.8, + "latex": "r _ { 1 } \\sim R ( s _ { 1 } , a _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 372, + 1788, + 514, + 1788, + 514, + 1819, + 372, + 1819 + ], + "score": 0.79, + "latex": "a _ { 1 } \\sim \\pi _ { 1 } ( s _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 462, + 1637, + 485, + 1637, + 485, + 1663, + 462, + 1663 + ], + "score": 0.79, + "latex": "s" + }, + { + "category_id": 13, + "poly": [ + 614, + 1762, + 635, + 1762, + 635, + 1784, + 614, + 1784 + ], + "score": 0.78, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 701, + 1637, + 727, + 1637, + 727, + 1664, + 701, + 1664 + ], + "score": 0.78, + "latex": "\\mathcal { A }" + }, + { + "category_id": 13, + "poly": [ + 1366, + 1066, + 1392, + 1066, + 1392, + 1098, + 1366, + 1098 + ], + "score": 0.77, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 736, + 2010, + 755, + 2010, + 755, + 2030, + 736, + 2030 + ], + "score": 0.77, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1969, + 1351, + 1969, + 1351, + 1989, + 1332, + 1989 + ], + "score": 0.76, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1116, + 1733, + 1134, + 1733, + 1134, + 1754, + 1116, + 1754 + ], + "score": 0.71, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 446, + 1763, + 462, + 1763, + 462, + 1784, + 446, + 1784 + ], + "score": 0.61, + "latex": "s" + }, + { + "category_id": 13, + "poly": [ + 717, + 1924, + 737, + 1924, + 737, + 1947, + 717, + 1947 + ], + "score": 0.38, + "latex": "\\pi" + }, + { + "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": [ + 292.0, + 1457.0, + 1008.0, + 1457.0, + 1008.0, + 1501.0, + 292.0, + 1501.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": [ + 294.0, + 460.0, + 1406.0, + 460.0, + 1406.0, + 495.0, + 294.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 490.0, + 1405.0, + 490.0, + 1405.0, + 523.0, + 293.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 520.0, + 1405.0, + 520.0, + 1405.0, + 557.0, + 293.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 550.0, + 1404.0, + 550.0, + 1404.0, + 586.0, + 294.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 581.0, + 1404.0, + 581.0, + 1404.0, + 616.0, + 294.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 611.0, + 1406.0, + 611.0, + 1406.0, + 651.0, + 292.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 642.0, + 1405.0, + 642.0, + 1405.0, + 679.0, + 292.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 674.0, + 1406.0, + 674.0, + 1406.0, + 709.0, + 294.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 703.0, + 1404.0, + 703.0, + 1404.0, + 738.0, + 294.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 735.0, + 1351.0, + 735.0, + 1351.0, + 770.0, + 294.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 803.0, + 1405.0, + 803.0, + 1405.0, + 840.0, + 293.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 835.0, + 1405.0, + 835.0, + 1405.0, + 871.0, + 294.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 863.0, + 1405.0, + 863.0, + 1405.0, + 900.0, + 293.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 897.0, + 1405.0, + 897.0, + 1405.0, + 930.0, + 292.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 928.0, + 1404.0, + 928.0, + 1404.0, + 959.0, + 294.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 959.0, + 1380.0, + 959.0, + 1380.0, + 991.0, + 296.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1404.0, + 228.0, + 1404.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 261.0, + 1404.0, + 261.0, + 1404.0, + 296.0, + 293.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 291.0, + 1404.0, + 291.0, + 1404.0, + 325.0, + 293.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 322.0, + 1403.0, + 322.0, + 1403.0, + 355.0, + 293.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 351.0, + 1405.0, + 351.0, + 1405.0, + 387.0, + 293.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 383.0, + 1403.0, + 383.0, + 1403.0, + 414.0, + 296.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 414.0, + 804.0, + 414.0, + 804.0, + 447.0, + 294.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1223.0, + 1404.0, + 1223.0, + 1404.0, + 1264.0, + 293.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1252.0, + 1406.0, + 1252.0, + 1406.0, + 1294.0, + 291.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1285.0, + 1406.0, + 1285.0, + 1406.0, + 1324.0, + 292.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1320.0, + 1405.0, + 1320.0, + 1405.0, + 1352.0, + 296.0, + 1352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1349.0, + 1406.0, + 1349.0, + 1406.0, + 1385.0, + 294.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1380.0, + 1397.0, + 1380.0, + 1397.0, + 1415.0, + 294.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1004.0, + 1404.0, + 1004.0, + 1404.0, + 1040.0, + 294.0, + 1040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1034.0, + 1405.0, + 1034.0, + 1405.0, + 1070.0, + 294.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1064.0, + 1365.0, + 1064.0, + 1365.0, + 1102.0, + 292.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1064.0, + 1406.0, + 1064.0, + 1406.0, + 1102.0, + 1393.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1093.0, + 1022.0, + 1093.0, + 1022.0, + 1134.0, + 292.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1093.0, + 1407.0, + 1093.0, + 1407.0, + 1134.0, + 1049.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1125.0, + 1407.0, + 1125.0, + 1407.0, + 1162.0, + 293.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1155.0, + 1314.0, + 1155.0, + 1314.0, + 1191.0, + 294.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1911.0, + 716.0, + 1911.0, + 716.0, + 1955.0, + 293.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1911.0, + 743.0, + 1911.0, + 743.0, + 1955.0, + 738.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1911.0, + 938.0, + 1911.0, + 938.0, + 1955.0, + 875.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 1911.0, + 1257.0, + 1911.0, + 1257.0, + 1955.0, + 1160.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 1930.0, + 746.0, + 1930.0, + 746.0, + 2018.0, + 691.0, + 2018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 1930.0, + 1331.0, + 1930.0, + 1331.0, + 2018.0, + 1166.0, + 2018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1930.0, + 1418.0, + 1930.0, + 1418.0, + 2018.0, + 1352.0, + 2018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1993.0, + 371.0, + 1993.0, + 371.0, + 2043.0, + 292.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 1993.0, + 735.0, + 1993.0, + 735.0, + 2043.0, + 534.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1993.0, + 1051.0, + 1993.0, + 1051.0, + 2043.0, + 756.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 1993.0, + 1095.0, + 1993.0, + 1095.0, + 2043.0, + 1081.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1601.0, + 782.0, + 1601.0, + 782.0, + 1640.0, + 294.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 1601.0, + 1406.0, + 1601.0, + 1406.0, + 1640.0, + 1042.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1635.0, + 461.0, + 1635.0, + 461.0, + 1668.0, + 296.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 1635.0, + 700.0, + 1635.0, + 700.0, + 1668.0, + 486.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 1635.0, + 959.0, + 1635.0, + 959.0, + 1668.0, + 728.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1635.0, + 1404.0, + 1635.0, + 1404.0, + 1668.0, + 1216.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1665.0, + 1160.0, + 1665.0, + 1160.0, + 1700.0, + 293.0, + 1700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1694.0, + 585.0, + 1694.0, + 585.0, + 1731.0, + 294.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1694.0, + 1406.0, + 1694.0, + 1406.0, + 1731.0, + 686.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1725.0, + 356.0, + 1725.0, + 356.0, + 1762.0, + 294.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 1725.0, + 708.0, + 1725.0, + 708.0, + 1762.0, + 447.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 1725.0, + 1115.0, + 1725.0, + 1115.0, + 1762.0, + 901.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1725.0, + 1406.0, + 1725.0, + 1406.0, + 1762.0, + 1135.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1753.0, + 445.0, + 1753.0, + 445.0, + 1797.0, + 294.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1753.0, + 613.0, + 1753.0, + 613.0, + 1797.0, + 463.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 1753.0, + 985.0, + 1753.0, + 985.0, + 1797.0, + 636.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1753.0, + 1406.0, + 1753.0, + 1406.0, + 1797.0, + 1394.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1787.0, + 371.0, + 1787.0, + 371.0, + 1824.0, + 295.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 1787.0, + 526.0, + 1787.0, + 526.0, + 1824.0, + 515.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1787.0, + 711.0, + 1787.0, + 711.0, + 1824.0, + 699.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1787.0, + 896.0, + 1787.0, + 896.0, + 1824.0, + 885.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1787.0, + 1406.0, + 1787.0, + 1406.0, + 1824.0, + 1039.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1817.0, + 396.0, + 1817.0, + 396.0, + 1850.0, + 296.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 496.0, + 1817.0, + 592.0, + 1817.0, + 592.0, + 1850.0, + 496.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1817.0, + 1076.0, + 1817.0, + 1076.0, + 1850.0, + 690.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 1817.0, + 1285.0, + 1817.0, + 1285.0, + 1850.0, + 1097.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 1817.0, + 1405.0, + 1817.0, + 1405.0, + 1850.0, + 1321.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1849.0, + 929.0, + 1849.0, + 929.0, + 1882.0, + 296.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1849.0, + 1148.0, + 1849.0, + 1148.0, + 1882.0, + 1071.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 1849.0, + 1250.0, + 1849.0, + 1250.0, + 1882.0, + 1242.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1528.0, + 764.0, + 1528.0, + 764.0, + 1573.0, + 293.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 794.0, + 1528.0, + 887.0, + 1528.0, + 887.0, + 1573.0, + 794.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1528.0, + 1122.0, + 1528.0, + 1122.0, + 1573.0, + 932.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1280.0, + 1528.0, + 1292.0, + 1528.0, + 1292.0, + 1573.0, + 1280.0, + 1573.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 915, + 1404, + 915, + 1404, + 1110, + 297, + 1110 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 586, + 1403, + 586, + 1403, + 747, + 297, + 747 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1224, + 1404, + 1224, + 1404, + 1348, + 298, + 1348 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 228, + 1404, + 228, + 1404, + 385, + 297, + 385 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 298, + 758, + 1403, + 758, + 1403, + 883, + 298, + 883 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 1763, + 1405, + 1763, + 1405, + 1888, + 297, + 1888 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1358, + 1404, + 1358, + 1404, + 1458, + 298, + 1458 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1480, + 1403, + 1480, + 1403, + 1604, + 298, + 1604 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 297, + 1613, + 1403, + 1613, + 1403, + 1738, + 297, + 1738 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 297, + 489, + 1403, + 489, + 1403, + 553, + 297, + 553 + ], + "score": 0.954 + }, + { + "category_id": 2, + "poly": [ + 296, + 1912, + 1403, + 1912, + 1403, + 2034, + 296, + 2034 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 298, + 393, + 1392, + 393, + 1392, + 466, + 298, + 466 + ], + "score": 0.938 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.756 + }, + { + "category_id": 0, + "poly": [ + 295, + 1154, + 1398, + 1154, + 1398, + 1191, + 295, + 1191 + ], + "score": 0.591 + }, + { + "category_id": 1, + "poly": [ + 295, + 1154, + 1398, + 1154, + 1398, + 1191, + 295, + 1191 + ], + "score": 0.349 + }, + { + "category_id": 13, + "poly": [ + 581, + 916, + 673, + 916, + 673, + 947, + 581, + 947 + ], + "score": 0.94, + "latex": "x \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 406, + 1389, + 577, + 1389, + 577, + 1423, + 406, + 1423 + ], + "score": 0.93, + "latex": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 366, + 428, + 547, + 428, + 547, + 466, + 366, + 466 + ], + "score": 0.93, + "latex": "\\theta _ { 1 } ^ { \\pi } , \\ldots \\theta _ { H } ^ { \\pi } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 907, + 1074, + 1025, + 1074, + 1025, + 1106, + 907, + 1106 + ], + "score": 0.93, + "latex": "A \\in \\mathbb { R } ^ { d \\times d }" + }, + { + "category_id": 13, + "poly": [ + 927, + 950, + 1026, + 950, + 1026, + 981, + 927, + 981 + ], + "score": 0.92, + "latex": "\\sigma _ { \\mathrm { m i n } } ( A )" + }, + { + "category_id": 13, + "poly": [ + 497, + 949, + 559, + 949, + 559, + 982, + 497, + 982 + ], + "score": 0.92, + "latex": "\\| A \\| _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1284, + 819, + 1393, + 819, + 1393, + 855, + 1284, + 855 + ], + "score": 0.92, + "latex": "\\{ D _ { h } \\} _ { h = 1 } ^ { H }" + }, + { + "category_id": 13, + "poly": [ + 782, + 1944, + 941, + 1944, + 941, + 1976, + 782, + 1976 + ], + "score": 0.92, + "latex": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 465, + 790, + 651, + 790, + 651, + 824, + 465, + 824 + ], + "score": 0.92, + "latex": "\\pi : S \\Delta ( { \\mathcal { A } } )" + }, + { + "category_id": 13, + "poly": [ + 831, + 1674, + 959, + 1674, + 959, + 1709, + 831, + 1709 + ], + "score": 0.92, + "latex": "\\Omega ( ( d / 2 ) ^ { H } )" + }, + { + "category_id": 13, + "poly": [ + 1120, + 1077, + 1183, + 1077, + 1183, + 1111, + 1120, + 1111 + ], + "score": 0.92, + "latex": "\\| x \\| _ { A }" + }, + { + "category_id": 13, + "poly": [ + 983, + 260, + 1177, + 260, + 1177, + 294, + 983, + 294 + ], + "score": 0.92, + "latex": "\\phi : \\mathcal { S } \\times \\bar { \\mathcal { A } } \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 774, + 919, + 832, + 919, + 832, + 952, + 774, + 952 + ], + "score": 0.92, + "latex": "\\lVert x \\rVert _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 735, + 430, + 906, + 430, + 906, + 465, + 735, + 465 + ], + "score": 0.92, + "latex": "( s , a ) \\in S \\times A" + }, + { + "category_id": 13, + "poly": [ + 373, + 1676, + 558, + 1676, + 558, + 1709, + 373, + 1709 + ], + "score": 0.92, + "latex": "\\pi : S \\Delta ( { \\mathcal { A } } )" + }, + { + "category_id": 13, + "poly": [ + 437, + 1076, + 522, + 1076, + 522, + 1106, + 437, + 1106 + ], + "score": 0.92, + "latex": "x \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 971, + 981, + 1065, + 981, + 1065, + 1010, + 971, + 1010 + ], + "score": 0.92, + "latex": "A \\succeq B" + }, + { + "category_id": 13, + "poly": [ + 413, + 647, + 516, + 647, + 516, + 682, + 413, + 682 + ], + "score": 0.92, + "latex": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }" + }, + { + "category_id": 13, + "poly": [ + 918, + 790, + 1123, + 790, + 1123, + 823, + 918, + 823 + ], + "score": 0.91, + "latex": "\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1117, + 1040, + 1393, + 1040, + 1393, + 1074, + 1117, + 1074 + ], + "score": 0.91, + "latex": "\\mu _ { h } ^ { \\pi } ( s ) = \\operatorname* { P r } [ s _ { h } = s \\mid \\pi ]" + }, + { + "category_id": 13, + "poly": [ + 576, + 1010, + 659, + 1010, + 659, + 1040, + 576, + 1040 + ], + "score": 0.91, + "latex": "A \\succeq B" + }, + { + "category_id": 13, + "poly": [ + 813, + 1011, + 891, + 1011, + 891, + 1039, + 813, + 1039 + ], + "score": 0.91, + "latex": "A - B" + }, + { + "category_id": 13, + "poly": [ + 298, + 1040, + 371, + 1040, + 371, + 1074, + 298, + 1074 + ], + "score": 0.91, + "latex": "\\Delta \\left( \\mathcal { A } \\right)" + }, + { + "category_id": 13, + "poly": [ + 609, + 1482, + 693, + 1482, + 693, + 1510, + 609, + 1510 + ], + "score": 0.91, + "latex": "H = 1" + }, + { + "category_id": 13, + "poly": [ + 1025, + 1973, + 1294, + 1973, + 1294, + 2009, + 1025, + 2009 + ], + "score": 0.91, + "latex": "\\lVert \\theta _ { 1 } - \\widehat { \\theta } _ { \\mathrm { O L S } } \\rVert _ { 2 } ^ { 2 } \\leq O ( d / n )" + }, + { + "category_id": 13, + "poly": [ + 1248, + 681, + 1403, + 681, + 1403, + 716, + 1248, + 716 + ], + "score": 0.91, + "latex": "( s , a , r , s ^ { \\prime } ) \\in" + }, + { + "category_id": 13, + "poly": [ + 796, + 1358, + 981, + 1358, + 981, + 1392, + 796, + 1392 + ], + "score": 0.91, + "latex": "( s , a ) \\in S \\times A ," + }, + { + "category_id": 13, + "poly": [ + 940, + 1390, + 1034, + 1390, + 1034, + 1422, + 940, + 1422 + ], + "score": 0.9, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 297, + 1942, + 722, + 1942, + 722, + 1977, + 297, + 1977 + ], + "score": 0.9, + "latex": "\\sigma _ { \\operatorname* { m i n } } \\bigl ( \\mathbb { E } _ { ( s , a ) \\sim \\widetilde { \\mu } _ { h } } [ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } ] \\bigr ) \\leq 1 / d" + }, + { + "category_id": 13, + "poly": [ + 1160, + 394, + 1331, + 394, + 1331, + 427, + 1160, + 427 + ], + "score": 0.9, + "latex": "\\pi : S \\Delta ( { \\mathcal { A } } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 715, + 534, + 715, + 534, + 746, + 298, + 746 + ], + "score": 0.89, + "latex": "S _ { h } \\times \\mathcal { A } \\times \\mathbb { R } \\times \\mathcal { S } _ { h + 1 }" + }, + { + "category_id": 13, + "poly": [ + 468, + 1041, + 503, + 1041, + 503, + 1074, + 468, + 1074 + ], + "score": 0.89, + "latex": "\\mu _ { h } ^ { \\pi }" + }, + { + "category_id": 13, + "poly": [ + 1012, + 1944, + 1171, + 1944, + 1171, + 1974, + 1012, + 1974 + ], + "score": 0.88, + "latex": "( s , a ) \\in \\mathcal S \\times \\mathcal A" + }, + { + "category_id": 13, + "poly": [ + 1304, + 1011, + 1405, + 1011, + 1405, + 1038, + 1304, + 1038 + ], + "score": 0.88, + "latex": "\\pi : { \\cal { S } } " + }, + { + "category_id": 13, + "poly": [ + 396, + 683, + 505, + 683, + 505, + 716, + 396, + 716 + ], + "score": 0.88, + "latex": "\\{ D _ { h } \\} _ { h = 1 } ^ { H }" + }, + { + "category_id": 13, + "poly": [ + 1297, + 1074, + 1394, + 1074, + 1394, + 1107, + 1297, + 1107 + ], + "score": 0.88, + "latex": "\\sqrt { x ^ { \\top } A x }" + }, + { + "category_id": 13, + "poly": [ + 808, + 1420, + 1275, + 1420, + 1275, + 1459, + 808, + 1459 + ], + "score": 0.88, + "latex": "\\sigma _ { \\mathrm { m i n } } \\left( \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } [ \\dot { \\phi } ( \\dot { s } , a ) \\phi ( s , a ) ^ { \\top } ] \\right) = 1 / d ." + }, + { + "category_id": 13, + "poly": [ + 986, + 920, + 1012, + 920, + 1012, + 949, + 986, + 949 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1362, + 1913, + 1394, + 1913, + 1394, + 1943, + 1362, + 1943 + ], + "score": 0.87, + "latex": "{ \\widetilde { \\mu } } _ { h }" + }, + { + "category_id": 13, + "poly": [ + 525, + 323, + 550, + 323, + 550, + 353, + 525, + 353 + ], + "score": 0.86, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 397, + 1542, + 424, + 1542, + 424, + 1573, + 397, + 1573 + ], + "score": 0.86, + "latex": "\\theta _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 694, + 715, + 823, + 715, + 823, + 746, + 694, + 746 + ], + "score": 0.85, + "latex": "( s , a ) \\sim \\mu _ { h }" + }, + { + "category_id": 13, + "poly": [ + 936, + 1830, + 966, + 1830, + 966, + 1856, + 936, + 1856 + ], + "score": 0.85, + "latex": "a _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 931, + 1045, + 961, + 1045, + 961, + 1071, + 931, + 1071 + ], + "score": 0.85, + "latex": "s _ { h }" + }, + { + "category_id": 13, + "poly": [ + 971, + 1861, + 1001, + 1861, + 1001, + 1887, + 971, + 1887 + ], + "score": 0.84, + "latex": "a _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 960, + 427, + 1353, + 427, + 1353, + 466, + 960, + 466 + ], + "score": 0.84, + "latex": "h \\in [ H ] , Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a ) ." + }, + { + "category_id": 13, + "poly": [ + 1289, + 1395, + 1322, + 1395, + 1322, + 1422, + 1289, + 1422 + ], + "score": 0.82, + "latex": "\\mu _ { h }" + }, + { + "category_id": 13, + "poly": [ + 386, + 1978, + 469, + 1978, + 469, + 2004, + 386, + 2004 + ], + "score": 0.82, + "latex": "H = 1" + }, + { + "category_id": 13, + "poly": [ + 1239, + 293, + 1257, + 293, + 1257, + 319, + 1239, + 319 + ], + "score": 0.81, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 823, + 981, + 847, + 981, + 847, + 1007, + 823, + 1007 + ], + "score": 0.81, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 673, + 682, + 777, + 682, + 777, + 714, + 673, + 714 + ], + "score": 0.81, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 821, + 648, + 1032, + 648, + 1032, + 682, + 821, + 682 + ], + "score": 0.8, + "latex": "\\mu _ { h } \\in \\Delta ( S _ { h } \\times \\mathcal { A } )" + }, + { + "category_id": 13, + "poly": [ + 742, + 981, + 766, + 981, + 766, + 1007, + 742, + 1007 + ], + "score": 0.79, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 1373, + 649, + 1401, + 649, + 1401, + 677, + 1373, + 677 + ], + "score": 0.78, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 836, + 713, + 962, + 713, + 962, + 746, + 836, + 746 + ], + "score": 0.78, + "latex": "r \\sim r ( s , a )" + }, + { + "category_id": 13, + "poly": [ + 746, + 821, + 786, + 821, + 786, + 849, + 746, + 849 + ], + "score": 0.77, + "latex": "V ^ { \\pi }" + }, + { + "category_id": 13, + "poly": [ + 665, + 826, + 685, + 826, + 685, + 848, + 665, + 848 + ], + "score": 0.77, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1036, + 1046, + 1056, + 1046, + 1056, + 1069, + 1036, + 1069 + ], + "score": 0.76, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 377, + 950, + 401, + 950, + 401, + 976, + 377, + 976 + ], + "score": 0.76, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 975, + 712, + 1117, + 712, + 1117, + 746, + 975, + 746 + ], + "score": 0.75, + "latex": "s ^ { \\prime } \\sim \\bar { P ( s , a ) }" + }, + { + "category_id": 13, + "poly": [ + 450, + 1913, + 493, + 1913, + 493, + 1943, + 450, + 1943 + ], + "score": 0.72, + "latex": "1 / d" + }, + { + "category_id": 13, + "poly": [ + 298, + 526, + 317, + 526, + 317, + 548, + 298, + 548 + ], + "score": 0.71, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 702, + 648, + 805, + 648, + 805, + 681, + 702, + 681 + ], + "score": 0.7, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 793, + 684, + 834, + 684, + 834, + 713, + 793, + 713 + ], + "score": 0.7, + "latex": "D _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1314, + 1680, + 1335, + 1680, + 1335, + 1703, + 1314, + 1703 + ], + "score": 0.34, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 297, + 1650, + 315, + 1650, + 315, + 1674, + 297, + 1674 + ], + "score": 0.33, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 1178, + 1648, + 1193, + 1648, + 1193, + 1673, + 1178, + 1673 + ], + "score": 0.31, + "latex": "^ { l }" + }, + { + "category_id": 13, + "poly": [ + 959, + 430, + 1053, + 430, + 1053, + 465, + 959, + 465 + ], + "score": 0.26, + "latex": "h \\in [ H ] _ { : }" + }, + { + "category_id": 13, + "poly": [ + 691, + 712, + 1120, + 712, + 1120, + 747, + 691, + 747 + ], + "score": 0.25, + "latex": "( s , \\dot { a } ) \\stackrel { . } { \\sim } \\mu _ { h } , r \\sim r ( s , a ) , s ^ { \\prime } \\sim \\bar { P ( } s , a ) " + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1905.0, + 449.0, + 1905.0, + 449.0, + 1950.0, + 328.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 494.0, + 1905.0, + 1361.0, + 1905.0, + 1361.0, + 1950.0, + 494.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1905.0, + 1407.0, + 1905.0, + 1407.0, + 1950.0, + 1395.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 1942.0, + 781.0, + 1942.0, + 781.0, + 1976.0, + 723.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 942.0, + 1942.0, + 1011.0, + 1942.0, + 1011.0, + 1976.0, + 942.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 1942.0, + 1181.0, + 1942.0, + 1181.0, + 1976.0, + 1172.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1972.0, + 385.0, + 1972.0, + 385.0, + 2011.0, + 329.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 1972.0, + 1024.0, + 1972.0, + 1024.0, + 2011.0, + 470.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2011.0, + 1295.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2004.0, + 702.0, + 2004.0, + 702.0, + 2037.0, + 296.0, + 2037.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": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2119.0, + 838.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1153.0, + 1403.0, + 1153.0, + 1403.0, + 1194.0, + 293.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 910.0, + 580.0, + 910.0, + 580.0, + 956.0, + 292.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 910.0, + 773.0, + 910.0, + 773.0, + 956.0, + 674.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 910.0, + 985.0, + 910.0, + 985.0, + 956.0, + 833.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 910.0, + 1406.0, + 910.0, + 1406.0, + 956.0, + 1013.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 947.0, + 376.0, + 947.0, + 376.0, + 984.0, + 294.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 947.0, + 496.0, + 947.0, + 496.0, + 984.0, + 402.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 947.0, + 926.0, + 947.0, + 926.0, + 984.0, + 560.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 947.0, + 1404.0, + 947.0, + 1404.0, + 984.0, + 1027.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 977.0, + 741.0, + 977.0, + 741.0, + 1014.0, + 295.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 977.0, + 822.0, + 977.0, + 822.0, + 1014.0, + 767.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 977.0, + 970.0, + 977.0, + 970.0, + 1014.0, + 848.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 977.0, + 1406.0, + 977.0, + 1406.0, + 1014.0, + 1066.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1007.0, + 575.0, + 1007.0, + 575.0, + 1044.0, + 295.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 1007.0, + 812.0, + 1007.0, + 812.0, + 1044.0, + 660.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 1007.0, + 1303.0, + 1007.0, + 1303.0, + 1044.0, + 892.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1038.0, + 467.0, + 1038.0, + 467.0, + 1078.0, + 372.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 1038.0, + 930.0, + 1038.0, + 930.0, + 1078.0, + 504.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 1038.0, + 1035.0, + 1038.0, + 1035.0, + 1078.0, + 962.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 1038.0, + 1116.0, + 1038.0, + 1116.0, + 1078.0, + 1057.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1038.0, + 1404.0, + 1038.0, + 1404.0, + 1078.0, + 1394.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1069.0, + 436.0, + 1069.0, + 436.0, + 1114.0, + 292.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 523.0, + 1069.0, + 906.0, + 1069.0, + 906.0, + 1114.0, + 523.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1026.0, + 1069.0, + 1119.0, + 1069.0, + 1119.0, + 1114.0, + 1026.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1069.0, + 1296.0, + 1069.0, + 1296.0, + 1114.0, + 1184.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1069.0, + 1406.0, + 1069.0, + 1406.0, + 1114.0, + 1395.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 585.0, + 1405.0, + 585.0, + 1405.0, + 623.0, + 296.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 286.0, + 616.0, + 412.0, + 616.0, + 412.0, + 699.0, + 286.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 616.0, + 701.0, + 616.0, + 701.0, + 699.0, + 517.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 616.0, + 820.0, + 616.0, + 820.0, + 699.0, + 806.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 616.0, + 1372.0, + 616.0, + 1372.0, + 699.0, + 1033.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 616.0, + 1413.0, + 616.0, + 1413.0, + 699.0, + 1402.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 665.0, + 395.0, + 665.0, + 395.0, + 733.0, + 285.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 665.0, + 672.0, + 665.0, + 672.0, + 733.0, + 506.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 665.0, + 792.0, + 665.0, + 792.0, + 733.0, + 778.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 665.0, + 1247.0, + 665.0, + 1247.0, + 733.0, + 835.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 665.0, + 1414.0, + 665.0, + 1414.0, + 733.0, + 1404.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 535.0, + 711.0, + 690.0, + 711.0, + 690.0, + 749.0, + 535.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 711.0, + 1130.0, + 711.0, + 1130.0, + 749.0, + 1121.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1224.0, + 1404.0, + 1224.0, + 1404.0, + 1259.0, + 295.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1256.0, + 1404.0, + 1256.0, + 1404.0, + 1292.0, + 293.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1285.0, + 1404.0, + 1285.0, + 1404.0, + 1323.0, + 292.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1318.0, + 1022.0, + 1318.0, + 1022.0, + 1350.0, + 296.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1406.0, + 229.0, + 1406.0, + 266.0, + 295.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 260.0, + 982.0, + 260.0, + 982.0, + 296.0, + 293.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 260.0, + 1404.0, + 260.0, + 1404.0, + 296.0, + 1178.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 292.0, + 1238.0, + 292.0, + 1238.0, + 325.0, + 296.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 292.0, + 1404.0, + 292.0, + 1404.0, + 325.0, + 1258.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 314.0, + 524.0, + 314.0, + 524.0, + 361.0, + 292.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 314.0, + 1406.0, + 314.0, + 1406.0, + 361.0, + 551.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 353.0, + 952.0, + 353.0, + 952.0, + 387.0, + 296.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 756.0, + 1404.0, + 756.0, + 1404.0, + 795.0, + 292.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 282.0, + 789.0, + 464.0, + 789.0, + 464.0, + 871.0, + 282.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 789.0, + 664.0, + 789.0, + 664.0, + 871.0, + 652.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 789.0, + 745.0, + 789.0, + 745.0, + 871.0, + 686.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 789.0, + 917.0, + 789.0, + 917.0, + 871.0, + 787.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 789.0, + 1283.0, + 789.0, + 1283.0, + 871.0, + 1124.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 789.0, + 1417.0, + 789.0, + 1417.0, + 871.0, + 1394.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 852.0, + 662.0, + 852.0, + 662.0, + 885.0, + 296.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1765.0, + 1405.0, + 1765.0, + 1405.0, + 1797.0, + 296.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1796.0, + 1403.0, + 1796.0, + 1403.0, + 1829.0, + 295.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1825.0, + 935.0, + 1825.0, + 935.0, + 1862.0, + 294.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 1825.0, + 1406.0, + 1825.0, + 1406.0, + 1862.0, + 967.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1856.0, + 970.0, + 1856.0, + 970.0, + 1892.0, + 296.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 1856.0, + 1406.0, + 1856.0, + 1406.0, + 1892.0, + 1002.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1357.0, + 795.0, + 1357.0, + 795.0, + 1396.0, + 294.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1357.0, + 1408.0, + 1357.0, + 1408.0, + 1396.0, + 982.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1387.0, + 405.0, + 1387.0, + 405.0, + 1427.0, + 292.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.0, + 1387.0, + 939.0, + 1387.0, + 939.0, + 1427.0, + 578.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1387.0, + 1288.0, + 1387.0, + 1288.0, + 1427.0, + 1035.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1387.0, + 1405.0, + 1387.0, + 1405.0, + 1427.0, + 1323.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1418.0, + 807.0, + 1418.0, + 807.0, + 1462.0, + 291.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1418.0, + 1297.0, + 1418.0, + 1297.0, + 1462.0, + 1276.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1480.0, + 608.0, + 1480.0, + 608.0, + 1516.0, + 294.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 694.0, + 1480.0, + 1407.0, + 1480.0, + 1407.0, + 1516.0, + 694.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1512.0, + 1404.0, + 1512.0, + 1404.0, + 1545.0, + 292.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1540.0, + 396.0, + 1540.0, + 396.0, + 1579.0, + 292.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1540.0, + 1404.0, + 1540.0, + 1404.0, + 1579.0, + 425.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1574.0, + 721.0, + 1574.0, + 721.0, + 1606.0, + 293.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1611.0, + 1407.0, + 1611.0, + 1407.0, + 1650.0, + 295.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1645.0, + 296.0, + 1645.0, + 296.0, + 1681.0, + 293.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1645.0, + 1177.0, + 1645.0, + 1177.0, + 1681.0, + 316.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 1645.0, + 1404.0, + 1645.0, + 1404.0, + 1681.0, + 1194.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1673.0, + 372.0, + 1673.0, + 372.0, + 1713.0, + 292.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1673.0, + 830.0, + 1673.0, + 830.0, + 1713.0, + 559.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 1673.0, + 1313.0, + 1673.0, + 1313.0, + 1713.0, + 960.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1673.0, + 1408.0, + 1673.0, + 1408.0, + 1713.0, + 1336.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1707.0, + 1046.0, + 1707.0, + 1046.0, + 1741.0, + 292.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 485.0, + 1404.0, + 485.0, + 1404.0, + 529.0, + 292.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 518.0, + 297.0, + 518.0, + 297.0, + 558.0, + 293.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 518.0, + 1368.0, + 518.0, + 1368.0, + 558.0, + 318.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 389.0, + 1159.0, + 389.0, + 1159.0, + 431.0, + 297.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1332.0, + 389.0, + 1400.0, + 389.0, + 1400.0, + 431.0, + 1332.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 425.0, + 365.0, + 425.0, + 365.0, + 471.0, + 294.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 425.0, + 734.0, + 425.0, + 734.0, + 471.0, + 548.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 425.0, + 958.0, + 425.0, + 958.0, + 471.0, + 907.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 425.0, + 1364.0, + 425.0, + 1364.0, + 471.0, + 1354.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1153.0, + 1403.0, + 1153.0, + 1403.0, + 1194.0, + 293.0, + 1194.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 406, + 1404, + 406, + 1404, + 652, + 297, + 652 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 995, + 1404, + 995, + 1404, + 1211, + 297, + 1211 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 296, + 1514, + 1404, + 1514, + 1404, + 1713, + 296, + 1713 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 660, + 1404, + 660, + 1404, + 968, + 297, + 968 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1224, + 1403, + 1224, + 1403, + 1324, + 298, + 1324 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 296, + 1357, + 1404, + 1357, + 1404, + 1478, + 296, + 1478 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 297, + 1748, + 1404, + 1748, + 1404, + 1862, + 297, + 1862 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 298, + 303, + 1403, + 303, + 1403, + 395, + 298, + 395 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 293, + 229, + 1401, + 229, + 1401, + 293, + 293, + 293 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 297, + 1891, + 1398, + 1891, + 1398, + 1956, + 297, + 1956 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 298, + 1963, + 1398, + 1963, + 1398, + 2038, + 298, + 2038 + ], + "score": 0.938 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2113, + 840, + 2113 + ], + "score": 0.793 + }, + { + "category_id": 13, + "poly": [ + 378, + 1675, + 579, + 1675, + 579, + 1711, + 378, + 1711 + ], + "score": 0.94, + "latex": "\\mathbb { E } [ R ( s _ { H } ^ { c } , a ) ] = r _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 632, + 1514, + 824, + 1514, + 824, + 1552, + 632, + 1552 + ], + "score": 0.94, + "latex": "0 \\leq r _ { 0 } \\leq \\hat { d } ^ { - H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 731, + 1815, + 1047, + 1815, + 1047, + 1861, + 731, + 1861 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\phi ( s _ { h } ^ { \\hat { d } + 1 } , a ) = \\sum _ { c \\in \\hat { d } } e _ { c } / \\hat { d } ^ { 1 / 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 553, + 1608, + 636, + 1608, + 636, + 1648, + 553, + 1648 + ], + "score": 0.93, + "latex": "c \\in [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 1107, + 1780, + 1314, + 1780, + 1314, + 1818, + 1107, + 1818 + ], + "score": 0.93, + "latex": "( h , c ) \\in [ H ] \\times [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 1119, + 994, + 1223, + 994, + 1223, + 1031, + 1119, + 1031 + ], + "score": 0.93, + "latex": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1554, + 455, + 1554, + 455, + 1593, + 298, + 1593 + ], + "score": 0.93, + "latex": "[ H - 1 ] \\times [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 694, + 2001, + 791, + 2001, + 791, + 2037, + 694, + 2037 + ], + "score": 0.93, + "latex": "\\theta _ { h } ^ { \\pi } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1436, + 537, + 1436, + 537, + 1475, + 298, + 1475 + ], + "score": 0.93, + "latex": "c \\in \\{ 1 , 2 , \\ldots , \\hat { d } + 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 1130, + 1359, + 1287, + 1359, + 1287, + 1394, + 1130, + 1394 + ], + "score": 0.93, + "latex": "\\mathcal { A } = \\{ a _ { 1 } , a _ { 2 } \\}" + }, + { + "category_id": 13, + "poly": [ + 646, + 1434, + 850, + 1434, + 850, + 1478, + 646, + 1478 + ], + "score": 0.92, + "latex": "P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 677, + 1558, + 832, + 1558, + 832, + 1594, + 677, + 1594 + ], + "score": 0.92, + "latex": "R ( s _ { h } ^ { c } , a ) = 0" + }, + { + "category_id": 13, + "poly": [ + 718, + 1392, + 877, + 1392, + 877, + 1434, + 718, + 1434 + ], + "score": 0.92, + "latex": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } }" + }, + { + "category_id": 13, + "poly": [ + 902, + 1440, + 1106, + 1440, + 1106, + 1478, + 902, + 1478 + ], + "score": 0.92, + "latex": "P ( s _ { h } ^ { c } , a _ { 1 } ) = s _ { h + 1 } ^ { c }" + }, + { + "category_id": 13, + "poly": [ + 934, + 1391, + 991, + 1391, + 991, + 1435, + 934, + 1435 + ], + "score": 0.92, + "latex": "s _ { h } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 885, + 1551, + 1344, + 1551, + 1344, + 1593, + 885, + 1593 + ], + "score": 0.92, + "latex": "R ( s _ { h } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot ( \\hat { d } ^ { 1 / 2 } - 1 ) \\cdot \\hat { d } ^ { ( H - h ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1109, + 1965, + 1298, + 1965, + 1298, + 1999, + 1109, + 1999 + ], + "score": 0.92, + "latex": "( s , a ) \\in S _ { h } \\times \\mathcal { A } ," + }, + { + "category_id": 13, + "poly": [ + 1310, + 1519, + 1404, + 1519, + 1404, + 1552, + 1310, + 1552 + ], + "score": 0.92, + "latex": "( h , c ) \\in" + }, + { + "category_id": 13, + "poly": [ + 639, + 1965, + 813, + 1965, + 813, + 1999, + 639, + 1999 + ], + "score": 0.92, + "latex": "\\pi : S \\Delta ( { \\mathcal { A } } )" + }, + { + "category_id": 13, + "poly": [ + 924, + 1965, + 1019, + 1965, + 1019, + 1999, + 924, + 1999 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 566, + 1394, + 638, + 1394, + 638, + 1430, + 566, + 1430 + ], + "score": 0.91, + "latex": "\\hat { d } + 1" + }, + { + "category_id": 13, + "poly": [ + 1069, + 469, + 1161, + 469, + 1161, + 496, + 1069, + 496 + ], + "score": 0.91, + "latex": "h = H" + }, + { + "category_id": 13, + "poly": [ + 297, + 1996, + 588, + 1996, + 588, + 2038, + 297, + 2038 + ], + "score": 0.91, + "latex": "Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )" + }, + { + "category_id": 13, + "poly": [ + 297, + 755, + 379, + 755, + 379, + 783, + 297, + 783 + ], + "score": 0.9, + "latex": "h = H" + }, + { + "category_id": 13, + "poly": [ + 508, + 1559, + 585, + 1559, + 585, + 1589, + 508, + 1589 + ], + "score": 0.9, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 821, + 755, + 891, + 755, + 891, + 783, + 821, + 783 + ], + "score": 0.9, + "latex": "h = 1" + }, + { + "category_id": 13, + "poly": [ + 860, + 1595, + 1061, + 1595, + 1061, + 1666, + 860, + 1666 + ], + "score": 0.9, + "latex": "R ( s _ { H } ^ { c } , a ) = \\left\\{ \\begin{array} { l l } { { 1 } } \\\\ { { - 1 } } \\end{array} \\right." + }, + { + "category_id": 13, + "poly": [ + 509, + 499, + 579, + 499, + 579, + 527, + 509, + 527 + ], + "score": 0.9, + "latex": "h = 1" + }, + { + "category_id": 13, + "poly": [ + 1126, + 1399, + 1287, + 1399, + 1287, + 1434, + 1126, + 1434 + ], + "score": 0.89, + "latex": "h \\in [ H - 1 ]" + }, + { + "category_id": 13, + "poly": [ + 946, + 365, + 1027, + 365, + 1027, + 393, + 946, + 393 + ], + "score": 0.89, + "latex": "h = H" + }, + { + "category_id": 13, + "poly": [ + 1126, + 1825, + 1199, + 1825, + 1199, + 1853, + 1126, + 1853 + ], + "score": 0.89, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 473, + 1790, + 626, + 1790, + 626, + 1817, + 473, + 1817 + ], + "score": 0.89, + "latex": "e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }" + }, + { + "category_id": 13, + "poly": [ + 428, + 1290, + 473, + 1290, + 473, + 1325, + 428, + 1325 + ], + "score": 0.89, + "latex": "d / 2" + }, + { + "category_id": 13, + "poly": [ + 585, + 1755, + 739, + 1755, + 739, + 1782, + 585, + 1782 + ], + "score": 0.88, + "latex": "e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }" + }, + { + "category_id": 13, + "poly": [ + 1274, + 1595, + 1398, + 1595, + 1398, + 1630, + 1274, + 1630 + ], + "score": 0.88, + "latex": "( 1 + r _ { 0 } ) / 2" + }, + { + "category_id": 13, + "poly": [ + 1135, + 1747, + 1170, + 1747, + 1170, + 1777, + 1135, + 1777 + ], + "score": 0.88, + "latex": "\\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 689, + 1614, + 767, + 1614, + 767, + 1644, + 689, + 1644 + ], + "score": 0.86, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 1182, + 725, + 1211, + 725, + 1211, + 752, + 1182, + 752 + ], + "score": 0.85, + "latex": "\\theta ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 837, + 469, + 869, + 469, + 869, + 497, + 837, + 497 + ], + "score": 0.85, + "latex": "\\theta ^ { \\pi }" + }, + { + "category_id": 13, + "poly": [ + 1274, + 1632, + 1398, + 1632, + 1398, + 1666, + 1274, + 1666 + ], + "score": 0.84, + "latex": "( 1 - r _ { 0 } ) / 2" + }, + { + "category_id": 13, + "poly": [ + 297, + 1287, + 316, + 1287, + 316, + 1319, + 297, + 1319 + ], + "score": 0.83, + "latex": "\\hat { d }" + }, + { + "category_id": 13, + "poly": [ + 878, + 1669, + 1214, + 1669, + 1214, + 1711, + 878, + 1711 + ], + "score": 0.83, + "latex": "a \\in \\mathcal { A } , R ( s _ { H } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot \\hat { d } ^ { 1 / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1051, + 1258, + 1070, + 1258, + 1070, + 1284, + 1051, + 1284 + ], + "score": 0.81, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 296, + 1822, + 675, + 1822, + 675, + 1861, + 296, + 1861 + ], + "score": 0.78, + "latex": "\\phi ( s _ { h } ^ { c } , a _ { 1 } ) = e _ { c } , \\phi ( s _ { h } ^ { c } , a _ { 2 } ) = e _ { c + { \\hat { d } } } " + }, + { + "category_id": 13, + "poly": [ + 1182, + 1063, + 1202, + 1063, + 1202, + 1085, + 1182, + 1085 + ], + "score": 0.76, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 483, + 1258, + 502, + 1258, + 502, + 1284, + 483, + 1284 + ], + "score": 0.74, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1237, + 1122, + 1259, + 1122, + 1259, + 1146, + 1237, + 1146 + ], + "score": 0.73, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 427, + 591, + 455, + 591, + 455, + 617, + 427, + 617 + ], + "score": 0.72, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 296, + 1398, + 404, + 1398, + 404, + 1434, + 296, + 1434 + ], + "score": 0.61, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 421, + 1399, + 455, + 1399, + 455, + 1433, + 421, + 1433 + ], + "score": 0.3, + "latex": "S _ { h }" + }, + { + "category_id": 13, + "poly": [ + 873, + 1674, + 946, + 1674, + 946, + 1706, + 873, + 1706 + ], + "score": 0.28, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1823, + 466, + 1823, + 466, + 1859, + 298, + 1859 + ], + "score": 0.28, + "latex": "\\phi ( s _ { h } ^ { c } , a _ { 1 } ) = e _ { c }" + }, + { + "category_id": 13, + "poly": [ + 923, + 1180, + 947, + 1180, + 947, + 1206, + 923, + 1206 + ], + "score": 0.27, + "latex": "\\textrm { C }" + }, + { + "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, + 2087.0, + 862.0, + 2087.0, + 862.0, + 2117.0, + 840.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 404.0, + 1404.0, + 404.0, + 1404.0, + 444.0, + 292.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 434.0, + 1408.0, + 434.0, + 1408.0, + 474.0, + 291.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 468.0, + 836.0, + 468.0, + 836.0, + 504.0, + 294.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 468.0, + 1068.0, + 468.0, + 1068.0, + 504.0, + 870.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 468.0, + 1404.0, + 468.0, + 1404.0, + 504.0, + 1162.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 499.0, + 508.0, + 499.0, + 508.0, + 533.0, + 294.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 499.0, + 1404.0, + 499.0, + 1404.0, + 533.0, + 580.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 529.0, + 1405.0, + 529.0, + 1405.0, + 563.0, + 295.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 560.0, + 1405.0, + 560.0, + 1405.0, + 594.0, + 295.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 589.0, + 426.0, + 589.0, + 426.0, + 624.0, + 294.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 589.0, + 1404.0, + 589.0, + 1404.0, + 624.0, + 456.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 618.0, + 1395.0, + 618.0, + 1395.0, + 658.0, + 292.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 282.0, + 976.0, + 1118.0, + 976.0, + 1118.0, + 1050.0, + 282.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 976.0, + 1404.0, + 976.0, + 1404.0, + 1050.0, + 1224.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1028.0, + 1405.0, + 1028.0, + 1405.0, + 1060.0, + 291.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1057.0, + 1181.0, + 1057.0, + 1181.0, + 1092.0, + 295.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1203.0, + 1057.0, + 1405.0, + 1057.0, + 1405.0, + 1092.0, + 1203.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1088.0, + 1405.0, + 1088.0, + 1405.0, + 1123.0, + 294.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1118.0, + 1236.0, + 1118.0, + 1236.0, + 1152.0, + 294.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 1118.0, + 1404.0, + 1118.0, + 1404.0, + 1152.0, + 1260.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1145.0, + 1405.0, + 1145.0, + 1405.0, + 1185.0, + 294.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1178.0, + 922.0, + 1178.0, + 922.0, + 1213.0, + 295.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 1178.0, + 1137.0, + 1178.0, + 1137.0, + 1213.0, + 948.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1505.0, + 631.0, + 1505.0, + 631.0, + 1559.0, + 290.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 825.0, + 1505.0, + 1309.0, + 1505.0, + 1309.0, + 1559.0, + 825.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1543.0, + 297.0, + 1543.0, + 297.0, + 1608.0, + 283.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 1543.0, + 507.0, + 1543.0, + 507.0, + 1608.0, + 456.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 1543.0, + 676.0, + 1543.0, + 676.0, + 1608.0, + 586.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 1543.0, + 884.0, + 1543.0, + 884.0, + 1608.0, + 833.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 1543.0, + 1418.0, + 1543.0, + 1418.0, + 1608.0, + 1345.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1593.0, + 552.0, + 1593.0, + 552.0, + 1672.0, + 293.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 1593.0, + 688.0, + 1593.0, + 688.0, + 1672.0, + 637.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 1593.0, + 859.0, + 1593.0, + 859.0, + 1672.0, + 768.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 1593.0, + 1273.0, + 1593.0, + 1273.0, + 1672.0, + 1062.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1593.0, + 1403.0, + 1593.0, + 1403.0, + 1672.0, + 1399.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1659.0, + 377.0, + 1659.0, + 377.0, + 1722.0, + 288.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 1659.0, + 872.0, + 1659.0, + 872.0, + 1722.0, + 580.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 1659.0, + 1229.0, + 1659.0, + 1229.0, + 1722.0, + 1215.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 662.0, + 1405.0, + 662.0, + 1405.0, + 698.0, + 295.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 694.0, + 1404.0, + 694.0, + 1404.0, + 726.0, + 296.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 723.0, + 1181.0, + 723.0, + 1181.0, + 759.0, + 295.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1212.0, + 723.0, + 1405.0, + 723.0, + 1405.0, + 759.0, + 1212.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 753.0, + 296.0, + 753.0, + 296.0, + 791.0, + 292.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 753.0, + 820.0, + 753.0, + 820.0, + 791.0, + 380.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 753.0, + 1404.0, + 753.0, + 1404.0, + 791.0, + 892.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 785.0, + 1405.0, + 785.0, + 1405.0, + 820.0, + 294.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 815.0, + 1405.0, + 815.0, + 1405.0, + 852.0, + 292.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 841.0, + 1408.0, + 841.0, + 1408.0, + 883.0, + 292.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 876.0, + 1406.0, + 876.0, + 1406.0, + 912.0, + 294.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 906.0, + 1405.0, + 906.0, + 1405.0, + 940.0, + 294.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 934.0, + 1328.0, + 934.0, + 1328.0, + 975.0, + 292.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1221.0, + 1403.0, + 1221.0, + 1403.0, + 1262.0, + 293.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1253.0, + 482.0, + 1253.0, + 482.0, + 1294.0, + 291.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 1253.0, + 1050.0, + 1253.0, + 1050.0, + 1294.0, + 503.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1253.0, + 1405.0, + 1253.0, + 1405.0, + 1294.0, + 1071.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1286.0, + 296.0, + 1286.0, + 296.0, + 1328.0, + 292.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1286.0, + 427.0, + 1286.0, + 427.0, + 1328.0, + 317.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 474.0, + 1286.0, + 1364.0, + 1286.0, + 1364.0, + 1328.0, + 474.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 279.0, + 1355.0, + 295.0, + 1355.0, + 295.0, + 1465.0, + 279.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1355.0, + 420.0, + 1355.0, + 420.0, + 1465.0, + 405.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 1355.0, + 565.0, + 1355.0, + 565.0, + 1465.0, + 456.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1355.0, + 717.0, + 1355.0, + 717.0, + 1465.0, + 639.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 878.0, + 1355.0, + 933.0, + 1355.0, + 933.0, + 1465.0, + 878.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 1355.0, + 1125.0, + 1355.0, + 1125.0, + 1465.0, + 992.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 1355.0, + 1418.0, + 1355.0, + 1418.0, + 1465.0, + 1288.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1433.0, + 297.0, + 1433.0, + 297.0, + 1489.0, + 289.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1433.0, + 645.0, + 1433.0, + 645.0, + 1489.0, + 538.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 1433.0, + 901.0, + 1433.0, + 901.0, + 1489.0, + 851.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 1433.0, + 1122.0, + 1433.0, + 1122.0, + 1489.0, + 1107.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1743.0, + 584.0, + 1743.0, + 584.0, + 1785.0, + 292.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 1743.0, + 1134.0, + 1743.0, + 1134.0, + 1785.0, + 740.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 1743.0, + 1405.0, + 1743.0, + 1405.0, + 1785.0, + 1171.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1782.0, + 472.0, + 1782.0, + 472.0, + 1820.0, + 295.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1782.0, + 1106.0, + 1782.0, + 1106.0, + 1820.0, + 627.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1315.0, + 1782.0, + 1404.0, + 1782.0, + 1404.0, + 1820.0, + 1315.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1806.0, + 295.0, + 1806.0, + 295.0, + 1873.0, + 288.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 1806.0, + 730.0, + 1806.0, + 730.0, + 1873.0, + 676.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1806.0, + 1125.0, + 1806.0, + 1125.0, + 1873.0, + 1048.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 1806.0, + 1218.0, + 1806.0, + 1218.0, + 1873.0, + 1200.0, + 1873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 303.0, + 1403.0, + 303.0, + 1403.0, + 337.0, + 296.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 336.0, + 1405.0, + 336.0, + 1405.0, + 367.0, + 293.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 363.0, + 945.0, + 363.0, + 945.0, + 399.0, + 291.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 363.0, + 1048.0, + 363.0, + 1048.0, + 399.0, + 1028.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 1402.0, + 261.0, + 1402.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1887.0, + 1402.0, + 1887.0, + 1402.0, + 1930.0, + 296.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1925.0, + 880.0, + 1925.0, + 880.0, + 1957.0, + 297.0, + 1957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1961.0, + 638.0, + 1961.0, + 638.0, + 2003.0, + 294.0, + 2003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 1961.0, + 923.0, + 1961.0, + 923.0, + 2003.0, + 814.0, + 2003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 1961.0, + 1108.0, + 1961.0, + 1108.0, + 2003.0, + 1020.0, + 2003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1299.0, + 1961.0, + 1406.0, + 1961.0, + 1406.0, + 2003.0, + 1299.0, + 2003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 1997.0, + 693.0, + 1997.0, + 693.0, + 2040.0, + 589.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 1997.0, + 804.0, + 1997.0, + 804.0, + 2040.0, + 792.0, + 2040.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 295, + 1719, + 1405, + 1719, + 1405, + 2041, + 295, + 2041 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 296, + 1532, + 1404, + 1532, + 1404, + 1707, + 296, + 1707 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 296, + 1376, + 1405, + 1376, + 1405, + 1495, + 296, + 1495 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 305, + 231, + 1392, + 231, + 1392, + 846, + 305, + 846 + ], + "score": 0.947 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 812, + 76, + 812, + 105, + 299, + 105 + ], + "score": 0.892 + }, + { + "category_id": 1, + "poly": [ + 295, + 916, + 1406, + 916, + 1406, + 1312, + 295, + 1312 + ], + "score": 0.8 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2111, + 841, + 2111 + ], + "score": 0.65 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 859, + 2087, + 859, + 2111, + 841, + 2111 + ], + "score": 0.404 + }, + { + "category_id": 4, + "poly": [ + 295, + 916, + 1406, + 916, + 1406, + 1312, + 295, + 1312 + ], + "score": 0.271 + }, + { + "category_id": 8, + "poly": [ + 498, + 242, + 786, + 242, + 786, + 316, + 498, + 316 + ], + "score": 0.105 + }, + { + "category_id": 13, + "poly": [ + 587, + 1044, + 746, + 1044, + 746, + 1086, + 587, + 1086 + ], + "score": 0.95, + "latex": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } }" + }, + { + "category_id": 13, + "poly": [ + 1189, + 1895, + 1337, + 1895, + 1337, + 1930, + 1189, + 1930 + ], + "score": 0.95, + "latex": "R ( s , a ) = 0" + }, + { + "category_id": 13, + "poly": [ + 585, + 1568, + 723, + 1568, + 723, + 1605, + 585, + 1605 + ], + "score": 0.93, + "latex": "r _ { 0 } = \\hat { d } ^ { - H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 796, + 1720, + 939, + 1720, + 939, + 1758, + 796, + 1758 + ], + "score": 0.93, + "latex": "r _ { 0 } = \\hat { d } ^ { - H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1196, + 1722, + 1299, + 1722, + 1299, + 1760, + 1196, + 1760 + ], + "score": 0.93, + "latex": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }" + }, + { + "category_id": 13, + "poly": [ + 930, + 1790, + 1071, + 1790, + 1071, + 1826, + 930, + 1826 + ], + "score": 0.93, + "latex": "r _ { 0 } = \\hat { d } ^ { - H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1164, + 1409, + 1267, + 1409, + 1267, + 1452, + 1164, + 1452 + ], + "score": 0.93, + "latex": "( s _ { h } ^ { \\hat { d } + 1 } , a )" + }, + { + "category_id": 13, + "poly": [ + 721, + 1888, + 927, + 1888, + 927, + 1931, + 721, + 1931 + ], + "score": 0.93, + "latex": "s \\in \\mathcal { S } _ { h } \\setminus \\{ s _ { h } ^ { \\hat { d } + 1 } \\}" + }, + { + "category_id": 13, + "poly": [ + 478, + 1083, + 536, + 1083, + 536, + 1127, + 478, + 1127 + ], + "score": 0.93, + "latex": "s _ { h } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 637, + 1275, + 775, + 1275, + 775, + 1310, + 637, + 1310 + ], + "score": 0.93, + "latex": "r _ { 0 } = \\hat { d } ^ { - H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1225, + 1667, + 1363, + 1667, + 1363, + 1704, + 1225, + 1704 + ], + "score": 0.93, + "latex": "r _ { 0 } = \\hat { d } ^ { - H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 720, + 1633, + 878, + 1633, + 878, + 1669, + 720, + 1669 + ], + "score": 0.93, + "latex": "r _ { 0 } \\cdot \\hat { d } ^ { H / 2 } = 1" + }, + { + "category_id": 13, + "poly": [ + 1075, + 1013, + 1178, + 1013, + 1178, + 1047, + 1075, + 1047 + ], + "score": 0.93, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 1041, + 1565, + 1097, + 1565, + 1097, + 1607, + 1041, + 1607 + ], + "score": 0.93, + "latex": "s _ { 1 } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 543, + 1928, + 691, + 1928, + 691, + 1965, + 543, + 1965 + ], + "score": 0.93, + "latex": "r _ { 0 } = \\hat { d } ^ { - H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1029, + 1194, + 1214, + 1194, + 1214, + 1235, + 1029, + 1235 + ], + "score": 0.93, + "latex": "\\{ s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } \\}" + }, + { + "category_id": 13, + "poly": [ + 952, + 916, + 1053, + 916, + 1053, + 954, + 952, + 954 + ], + "score": 0.92, + "latex": "\\hat { d } = d / 2" + }, + { + "category_id": 13, + "poly": [ + 763, + 1378, + 856, + 1378, + 856, + 1411, + 763, + 1411 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 1066, + 1275, + 1221, + 1275, + 1221, + 1309, + 1066, + 1309 + ], + "score": 0.92, + "latex": "r _ { 0 } \\cdot \\hat { d } ^ { H / 2 } = 1" + }, + { + "category_id": 13, + "poly": [ + 298, + 1856, + 361, + 1856, + 361, + 1890, + 298, + 1890 + ], + "score": 0.92, + "latex": "( s , a )" + }, + { + "category_id": 13, + "poly": [ + 454, + 1758, + 656, + 1758, + 656, + 1793, + 454, + 1793 + ], + "score": 0.92, + "latex": "\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1095, + 1674, + 1175, + 1674, + 1175, + 1704, + 1095, + 1704 + ], + "score": 0.92, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 297, + 1634, + 436, + 1634, + 436, + 1670, + 297, + 1670 + ], + "score": 0.92, + "latex": "r _ { 0 } = \\hat { d } ^ { - H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 710, + 1241, + 805, + 1241, + 805, + 1275, + 710, + 1275 + ], + "score": 0.91, + "latex": "\\{ a _ { 1 } , a _ { 2 } \\}" + }, + { + "category_id": 13, + "poly": [ + 987, + 1933, + 1049, + 1933, + 1049, + 1967, + 987, + 1967 + ], + "score": 0.91, + "latex": "( s , a )" + }, + { + "category_id": 13, + "poly": [ + 772, + 1165, + 867, + 1165, + 867, + 1196, + 772, + 1196 + ], + "score": 0.91, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 398, + 1934, + 487, + 1934, + 487, + 1965, + 398, + 1965 + ], + "score": 0.91, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 781, + 1125, + 959, + 1125, + 959, + 1165, + 781, + 1165 + ], + "score": 0.91, + "latex": "s _ { H } ^ { 1 } , s _ { H } ^ { 2 } , \\ldots , s _ { H } ^ { \\hat { d } }" + }, + { + "category_id": 13, + "poly": [ + 794, + 1796, + 878, + 1796, + 878, + 1826, + 794, + 1826 + ], + "score": 0.91, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 658, + 1726, + 743, + 1726, + 743, + 1757, + 658, + 1757 + ], + "score": 0.91, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 1269, + 1244, + 1351, + 1244, + 1351, + 1274, + 1269, + 1274 + ], + "score": 0.91, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 1123, + 1235, + 1179, + 1235, + 1179, + 1275, + 1123, + 1275 + ], + "score": 0.9, + "latex": "s _ { 1 } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 587, + 1967, + 773, + 1967, + 773, + 2041, + 587, + 2041 + ], + "score": 0.9, + "latex": "R ( s , a ) = \\left\\{ { 1 \\atop - 1 } \\right." + }, + { + "category_id": 13, + "poly": [ + 456, + 1574, + 536, + 1574, + 536, + 1605, + 456, + 1605 + ], + "score": 0.89, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 924, + 1857, + 1000, + 1857, + 1000, + 1885, + 924, + 1885 + ], + "score": 0.89, + "latex": "H - 1" + }, + { + "category_id": 13, + "poly": [ + 525, + 1459, + 598, + 1459, + 598, + 1486, + 525, + 1486 + ], + "score": 0.89, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 984, + 1896, + 1069, + 1896, + 1069, + 1926, + 984, + 1926 + ], + "score": 0.88, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 369, + 1606, + 448, + 1606, + 448, + 1634, + 369, + 1634 + ], + "score": 0.88, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 821, + 1453, + 1396, + 1453, + 1396, + 1494, + 821, + 1494 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } \\left[ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } \\right] = \\frac { 1 } { d } \\sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \\top } = \\frac { 1 } { d } I . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 352, + 1413, + 1024, + 1413, + 1024, + 1453, + 352, + 1453 + ], + "score": 0.88, + "latex": "\\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 1 } , a _ { 2 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 2 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } } , a _ { 2 } ) \\}" + }, + { + "category_id": 13, + "poly": [ + 416, + 1462, + 449, + 1462, + 449, + 1489, + 416, + 1489 + ], + "score": 0.86, + "latex": "\\mu _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1296, + 1052, + 1321, + 1052, + 1321, + 1084, + 1296, + 1084 + ], + "score": 0.86, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 460, + 953, + 544, + 953, + 544, + 983, + 460, + 983 + ], + "score": 0.85, + "latex": "( h = 1 )" + }, + { + "category_id": 13, + "poly": [ + 1167, + 953, + 1261, + 953, + 1261, + 982, + 1167, + 982 + ], + "score": 0.85, + "latex": "h = H" + }, + { + "category_id": 13, + "poly": [ + 1094, + 1384, + 1127, + 1384, + 1127, + 1411, + 1094, + 1411 + ], + "score": 0.85, + "latex": "\\mu _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1009, + 987, + 1039, + 987, + 1039, + 1013, + 1009, + 1013 + ], + "score": 0.84, + "latex": "a _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1292, + 1762, + 1317, + 1762, + 1317, + 1788, + 1292, + 1788 + ], + "score": 0.84, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 297, + 1051, + 322, + 1051, + 322, + 1084, + 297, + 1084 + ], + "score": 0.84, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 1149, + 1167, + 1182, + 1167, + 1182, + 1194, + 1149, + 1194 + ], + "score": 0.83, + "latex": "\\mu _ { h }" + }, + { + "category_id": 13, + "poly": [ + 855, + 1018, + 885, + 1018, + 885, + 1044, + 855, + 1044 + ], + "score": 0.83, + "latex": "a _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 631, + 1673, + 675, + 1673, + 675, + 1707, + 631, + 1707 + ], + "score": 0.81, + "latex": "1 / 2" + }, + { + "category_id": 13, + "poly": [ + 1020, + 1610, + 1040, + 1610, + 1040, + 1632, + 1020, + 1632 + ], + "score": 0.79, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 788, + 1767, + 808, + 1767, + 808, + 1788, + 788, + 1788 + ], + "score": 0.78, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1030, + 368, + 1064, + 368, + 1064, + 391, + 1030, + 391 + ], + "score": 0.74, + "latex": "s _ { 1 } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 586, + 1642, + 607, + 1642, + 607, + 1665, + 586, + 1665 + ], + "score": 0.73, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 979, + 1996, + 1107, + 1996, + 1107, + 2039, + 979, + 2039 + ], + "score": 0.73, + "latex": "\\dot { ( 1 - r _ { 0 } ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1029, + 478, + 1064, + 478, + 1064, + 501, + 1029, + 501 + ], + "score": 0.73, + "latex": "s _ { 2 } ^ { \\tilde { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1374, + 1582, + 1393, + 1582, + 1393, + 1602, + 1374, + 1602 + ], + "score": 0.72, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1029, + 698, + 1064, + 698, + 1064, + 720, + 1029, + 720 + ], + "score": 0.71, + "latex": "s _ { H - 1 } ^ { \\tilde { d } + 1 }" + }, + { + "category_id": 14, + "poly": [ + 1099, + 566, + 1391, + 566, + 1391, + 631, + 1099, + 631 + ], + "score": 0.69, + "latex": "\\begin{array} { l } { { Q \\left( s _ { h } ^ { \\hat { d } + 1 } , a \\right) = r _ { 0 } \\hat { d } ^ { ( H - h + 1 ) / 2 } } } \\\\ { { R \\left( s _ { h } ^ { \\hat { d } + 1 } , a \\right) = r _ { 0 } ( \\hat { d } ^ { ( H - h + 1 ) / 2 } - \\hat { d } ^ { ( H - h ) / 2 } ) } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1030, + 260, + 1047, + 260, + 1047, + 273, + 1030, + 273 + ], + "score": 0.68, + "latex": "a _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 980, + 1969, + 1106, + 1969, + 1106, + 2003, + 980, + 2003 + ], + "score": 0.67, + "latex": "( 1 + r _ { 0 } ) / 2" + }, + { + "category_id": 13, + "poly": [ + 1030, + 282, + 1047, + 282, + 1047, + 294, + 1030, + 294 + ], + "score": 0.67, + "latex": "a _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 521, + 480, + 539, + 480, + 539, + 499, + 521, + 499 + ], + "score": 0.66, + "latex": "s _ { 2 } ^ { 1 }" + }, + { + "category_id": 14, + "poly": [ + 1099, + 462, + 1368, + 462, + 1368, + 516, + 1099, + 516 + ], + "score": 0.57, + "latex": "\\begin{array} { r l } & { Q \\big ( s _ { 2 } ^ { \\hat { d } + 1 } , a \\big ) = r _ { 0 } \\hat { d } ^ { ( H - 1 ) / 2 } } \\\\ & { R \\big ( s _ { 2 } ^ { \\hat { d } + 1 } , a \\big ) = r _ { 0 } ( \\hat { d } ^ { ( H - 1 ) / 2 } - \\hat { d } ^ { ( H - 2 ) / 2 } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1027, + 796, + 1064, + 796, + 1064, + 819, + 1027, + 819 + ], + "score": 0.54, + "latex": "s _ { H } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 320, + 579, + 475, + 579, + 475, + 598, + 320, + 598 + ], + "score": 0.52, + "latex": "Q ( s , a _ { 1 } ) = r _ { 0 } \\hat { d } ^ { ( H - h ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 733, + 482, + 752, + 482, + 752, + 503, + 733, + 503 + ], + "score": 0.49, + "latex": "s _ { 2 } ^ { 3 }" + }, + { + "category_id": 13, + "poly": [ + 315, + 573, + 475, + 573, + 475, + 622, + 315, + 622 + ], + "score": 0.47, + "latex": "\\left| \\begin{array} { l } { { Q ( s , a _ { 1 } ) = r _ { 0 } \\hat { d } ^ { ( H - h ) / 2 } } } \\\\ { { R ( s , a ) = 0 } } \\end{array} \\right." + }, + { + "category_id": 14, + "poly": [ + 500, + 240, + 786, + 240, + 786, + 318, + 500, + 318 + ], + "score": 0.47, + "latex": "\\begin{array} { r l } & { \\phi ( s _ { h } ^ { c } , a _ { 1 } ) = e _ { c } } \\\\ & { \\phi ( s _ { h } ^ { c } , a _ { 2 } ) = e _ { c + \\hat { d } } } \\\\ & { \\phi \\left( s _ { h } ^ { \\hat { d } + 1 } , a \\right) = ( e _ { 1 } + e _ { 2 } + \\dots + e _ { \\hat { d } } ) / \\hat { d } ^ { 1 / 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 717, + 700, + 761, + 700, + 761, + 722, + 717, + 722 + ], + "score": 0.46, + "latex": "\\left( { { s _ { H - 1 } ^ { 3 } } } \\right." + }, + { + "category_id": 13, + "poly": [ + 319, + 379, + 402, + 379, + 402, + 397, + 319, + 397 + ], + "score": 0.45, + "latex": "R ( s , a ) = 0" + }, + { + "category_id": 13, + "poly": [ + 314, + 459, + 476, + 459, + 476, + 508, + 314, + 508 + ], + "score": 0.42, + "latex": "\\left. \\begin{array} { l } { { Q ( s , a _ { 1 } ) = r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 } } } \\\\ { { R ( s , a ) = 0 } } \\end{array} \\right." + }, + { + "category_id": 13, + "poly": [ + 318, + 356, + 474, + 356, + 474, + 376, + 318, + 376 + ], + "score": 0.42, + "latex": "Q ( s , a _ { 1 } ) = r _ { 0 } \\hat { d } ^ { ( H - 1 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 319, + 602, + 402, + 602, + 402, + 619, + 319, + 619 + ], + "score": 0.39, + "latex": "R ( s , a ) = 0" + }, + { + "category_id": 13, + "poly": [ + 902, + 479, + 922, + 479, + 922, + 502, + 902, + 502 + ], + "score": 0.38, + "latex": "s _ { 2 } ^ { \\hat { d } }" + }, + { + "category_id": 13, + "poly": [ + 889, + 699, + 933, + 699, + 933, + 723, + 889, + 723 + ], + "score": 0.35, + "latex": "\\left( s _ { H - 1 } ^ { \\hat { d } } \\right." + }, + { + "category_id": 13, + "poly": [ + 317, + 488, + 402, + 488, + 402, + 506, + 317, + 506 + ], + "score": 0.31, + "latex": "R ( s , a ) = 0" + }, + { + "category_id": 13, + "poly": [ + 313, + 672, + 443, + 672, + 443, + 734, + 313, + 734 + ], + "score": 0.3, + "latex": "\\boxed { Q ( s , a _ { 1 } ) = r _ { 0 } \\hat { d } ^ { 1 / 2 } }" + }, + { + "category_id": 14, + "poly": [ + 1098, + 353, + 1342, + 353, + 1342, + 404, + 1098, + 404 + ], + "score": 0.3, + "latex": "\\begin{array} { r l } & { Q \\big ( s _ { 1 } ^ { \\hat { d } + 1 } , a \\big ) = r _ { 0 } \\hat { d } ^ { H / 2 } } \\\\ & { R \\big ( s _ { 1 } ^ { \\hat { d } + 1 } , a \\big ) = r _ { 0 } ( \\hat { d } ^ { H / 2 } - \\hat { d } ^ { ( H - 1 ) / 2 } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 318, + 467, + 474, + 467, + 474, + 486, + 318, + 486 + ], + "score": 0.27, + "latex": "Q ( s , a _ { 1 } ) = r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1100, + 381, + 1341, + 381, + 1341, + 403, + 1100, + 403 + ], + "score": 0.27, + "latex": "R \\big ( s _ { 1 } ^ { d + 1 } , a \\big ) = r _ { 0 } ( \\hat { d } ^ { H / 2 } - \\hat { d } ^ { ( H - 1 ) / 2 } )" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 235.0, + 499.0, + 235.0, + 499.0, + 271.0, + 495.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 254.0, + 499.0, + 254.0, + 499.0, + 323.0, + 491.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 254.0, + 794.0, + 254.0, + 794.0, + 323.0, + 787.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 267.0, + 1029.0, + 267.0, + 1029.0, + 302.0, + 994.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 267.0, + 1057.0, + 267.0, + 1057.0, + 302.0, + 1048.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 349.0, + 317.0, + 349.0, + 317.0, + 402.0, + 313.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 475.0, + 349.0, + 481.0, + 349.0, + 481.0, + 402.0, + 475.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 363.0, + 546.0, + 363.0, + 546.0, + 395.0, + 516.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 360.0, + 654.0, + 360.0, + 654.0, + 396.0, + 620.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 363.0, + 756.0, + 363.0, + 756.0, + 392.0, + 730.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 355.0, + 933.0, + 355.0, + 933.0, + 399.0, + 900.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 345.0, + 1097.0, + 345.0, + 1097.0, + 407.0, + 1092.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 345.0, + 1348.0, + 345.0, + 1348.0, + 407.0, + 1343.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 456.0, + 313.0, + 456.0, + 313.0, + 511.0, + 309.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 456.0, + 483.0, + 456.0, + 483.0, + 511.0, + 477.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 476.0, + 520.0, + 476.0, + 520.0, + 501.0, + 517.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 476.0, + 543.0, + 476.0, + 543.0, + 501.0, + 540.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 621.0, + 474.0, + 652.0, + 474.0, + 652.0, + 505.0, + 621.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 476.0, + 732.0, + 476.0, + 732.0, + 507.0, + 727.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 476.0, + 757.0, + 476.0, + 757.0, + 507.0, + 753.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 464.0, + 1028.0, + 464.0, + 1028.0, + 509.0, + 1020.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 464.0, + 1074.0, + 464.0, + 1074.0, + 509.0, + 1065.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 456.0, + 1098.0, + 456.0, + 1098.0, + 516.0, + 1091.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1369.0, + 456.0, + 1374.0, + 456.0, + 1374.0, + 516.0, + 1369.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 570.0, + 483.0, + 570.0, + 483.0, + 600.0, + 476.0, + 600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 561.0, + 1098.0, + 561.0, + 1098.0, + 598.0, + 1092.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 591.0, + 1056.0, + 591.0, + 1056.0, + 601.0, + 1043.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 590.0, + 1098.0, + 590.0, + 1098.0, + 629.0, + 1091.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1392.0, + 590.0, + 1397.0, + 590.0, + 1397.0, + 629.0, + 1392.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 444.0, + 674.0, + 453.0, + 674.0, + 453.0, + 706.0, + 444.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 671.0, + 1236.0, + 671.0, + 1236.0, + 707.0, + 1095.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 695.0, + 553.0, + 695.0, + 553.0, + 722.0, + 510.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 697.0, + 642.0, + 697.0, + 642.0, + 721.0, + 619.0, + 721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 687.0, + 1028.0, + 687.0, + 1028.0, + 726.0, + 1022.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 687.0, + 1071.0, + 687.0, + 1071.0, + 726.0, + 1065.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 694.0, + 1295.0, + 694.0, + 1295.0, + 733.0, + 1091.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 774.0, + 438.0, + 774.0, + 438.0, + 831.0, + 312.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 792.0, + 546.0, + 792.0, + 546.0, + 823.0, + 516.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 790.0, + 652.0, + 790.0, + 652.0, + 823.0, + 620.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 788.0, + 761.0, + 788.0, + 761.0, + 824.0, + 726.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 788.0, + 931.0, + 788.0, + 931.0, + 825.0, + 895.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 783.0, + 1026.0, + 783.0, + 1026.0, + 826.0, + 1020.0, + 826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 783.0, + 1072.0, + 783.0, + 1072.0, + 826.0, + 1065.0, + 826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 775.0, + 1253.0, + 775.0, + 1253.0, + 835.0, + 1092.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 248.0, + 1052.0, + 248.0, + 1052.0, + 275.5, + 1010.0, + 275.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.75, + 357.5, + 1080.75, + 357.5, + 1080.75, + 392.5, + 1010.75, + 392.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 469.0, + 923.0, + 469.0, + 923.0, + 504.0, + 903.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 698.0, + 757.0, + 698.0, + 757.0, + 723.0, + 715.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 70.0, + 816.0, + 70.0, + 816.0, + 110.0, + 293.0, + 110.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": [ + 294.0, + 919.0, + 951.0, + 919.0, + 951.0, + 955.0, + 294.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 919.0, + 1404.0, + 919.0, + 1404.0, + 955.0, + 1054.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 949.0, + 459.0, + 949.0, + 459.0, + 986.0, + 293.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 949.0, + 1166.0, + 949.0, + 1166.0, + 986.0, + 545.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 949.0, + 1406.0, + 949.0, + 1406.0, + 986.0, + 1262.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 981.0, + 1008.0, + 981.0, + 1008.0, + 1016.0, + 293.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 981.0, + 1404.0, + 981.0, + 1404.0, + 1016.0, + 1040.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1015.0, + 854.0, + 1015.0, + 854.0, + 1047.0, + 295.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1015.0, + 1074.0, + 1015.0, + 1074.0, + 1047.0, + 886.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1015.0, + 1403.0, + 1015.0, + 1403.0, + 1047.0, + 1179.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1038.0, + 296.0, + 1038.0, + 296.0, + 1092.0, + 288.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1038.0, + 586.0, + 1038.0, + 586.0, + 1092.0, + 323.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1038.0, + 1295.0, + 1038.0, + 1295.0, + 1092.0, + 747.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1038.0, + 1412.0, + 1038.0, + 1412.0, + 1092.0, + 1322.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1080.0, + 477.0, + 1080.0, + 477.0, + 1138.0, + 290.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 1080.0, + 1404.0, + 1080.0, + 1404.0, + 1138.0, + 537.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1106.0, + 771.0, + 1106.0, + 771.0, + 1195.0, + 283.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 1106.0, + 1148.0, + 1106.0, + 1148.0, + 1195.0, + 960.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1106.0, + 1416.0, + 1106.0, + 1416.0, + 1195.0, + 1183.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 282.0, + 1176.0, + 1028.0, + 1176.0, + 1028.0, + 1257.0, + 282.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 1176.0, + 1419.0, + 1176.0, + 1419.0, + 1257.0, + 1215.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 280.0, + 1217.0, + 709.0, + 1217.0, + 709.0, + 1295.0, + 280.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1217.0, + 1122.0, + 1217.0, + 1122.0, + 1295.0, + 806.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 1217.0, + 1268.0, + 1217.0, + 1268.0, + 1295.0, + 1180.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1217.0, + 1418.0, + 1217.0, + 1418.0, + 1295.0, + 1352.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1272.0, + 636.0, + 1272.0, + 636.0, + 1314.0, + 292.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1272.0, + 1065.0, + 1272.0, + 1065.0, + 1314.0, + 776.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1272.0, + 1236.0, + 1272.0, + 1236.0, + 1314.0, + 1222.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1709.0, + 657.0, + 1709.0, + 657.0, + 1774.0, + 287.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 1709.0, + 795.0, + 1709.0, + 795.0, + 1774.0, + 744.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 940.0, + 1709.0, + 1195.0, + 1709.0, + 1195.0, + 1774.0, + 940.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1709.0, + 1413.0, + 1709.0, + 1413.0, + 1774.0, + 1300.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1756.0, + 453.0, + 1756.0, + 453.0, + 1797.0, + 294.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 1756.0, + 787.0, + 1756.0, + 787.0, + 1797.0, + 657.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 1756.0, + 1291.0, + 1756.0, + 1291.0, + 1797.0, + 809.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 1756.0, + 1406.0, + 1756.0, + 1406.0, + 1797.0, + 1318.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1786.0, + 793.0, + 1786.0, + 793.0, + 1834.0, + 290.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1786.0, + 929.0, + 1786.0, + 929.0, + 1834.0, + 879.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1786.0, + 1407.0, + 1786.0, + 1407.0, + 1834.0, + 1072.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1826.0, + 1403.0, + 1826.0, + 1403.0, + 1859.0, + 294.0, + 1859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1855.0, + 297.0, + 1855.0, + 297.0, + 1891.0, + 294.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 1855.0, + 923.0, + 1855.0, + 923.0, + 1891.0, + 362.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1001.0, + 1855.0, + 1405.0, + 1855.0, + 1405.0, + 1891.0, + 1001.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1875.0, + 720.0, + 1875.0, + 720.0, + 1950.0, + 283.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1875.0, + 983.0, + 1875.0, + 983.0, + 1950.0, + 928.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1875.0, + 1188.0, + 1875.0, + 1188.0, + 1950.0, + 1070.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1338.0, + 1875.0, + 1416.0, + 1875.0, + 1416.0, + 1950.0, + 1338.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1922.0, + 397.0, + 1922.0, + 397.0, + 1974.0, + 289.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 1922.0, + 542.0, + 1922.0, + 542.0, + 1974.0, + 488.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 1922.0, + 986.0, + 1922.0, + 986.0, + 1974.0, + 692.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 1922.0, + 1407.0, + 1922.0, + 1407.0, + 1974.0, + 1050.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1973.0, + 586.0, + 1973.0, + 586.0, + 2032.0, + 291.0, + 2032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1963.0, + 978.0, + 1963.0, + 978.0, + 2042.0, + 774.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 1963.0, + 1111.0, + 1963.0, + 1111.0, + 2042.0, + 1108.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 1985.0, + 1403.0, + 1985.0, + 1403.0, + 2024.0, + 1121.0, + 2024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1532.0, + 1404.0, + 1532.0, + 1404.0, + 1570.0, + 295.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1564.0, + 455.0, + 1564.0, + 455.0, + 1619.0, + 285.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 1564.0, + 584.0, + 1564.0, + 584.0, + 1619.0, + 537.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 1564.0, + 1040.0, + 1564.0, + 1040.0, + 1619.0, + 724.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 1564.0, + 1373.0, + 1564.0, + 1373.0, + 1619.0, + 1098.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1564.0, + 1407.0, + 1564.0, + 1407.0, + 1619.0, + 1394.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1604.0, + 368.0, + 1604.0, + 368.0, + 1638.0, + 296.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1604.0, + 1019.0, + 1604.0, + 1019.0, + 1638.0, + 449.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1604.0, + 1405.0, + 1604.0, + 1405.0, + 1638.0, + 1041.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1629.0, + 296.0, + 1629.0, + 296.0, + 1676.0, + 290.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 1629.0, + 585.0, + 1629.0, + 585.0, + 1676.0, + 437.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1629.0, + 719.0, + 1629.0, + 719.0, + 1676.0, + 608.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1629.0, + 1407.0, + 1629.0, + 1407.0, + 1676.0, + 879.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1669.0, + 630.0, + 1669.0, + 630.0, + 1708.0, + 291.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 1669.0, + 1094.0, + 1669.0, + 1094.0, + 1708.0, + 676.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 1669.0, + 1224.0, + 1669.0, + 1224.0, + 1708.0, + 1176.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1669.0, + 1376.0, + 1669.0, + 1376.0, + 1708.0, + 1364.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1374.0, + 762.0, + 1374.0, + 762.0, + 1412.0, + 296.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 1374.0, + 1093.0, + 1374.0, + 1093.0, + 1412.0, + 857.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 1374.0, + 1405.0, + 1374.0, + 1405.0, + 1412.0, + 1128.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1396.0, + 351.0, + 1396.0, + 351.0, + 1474.0, + 285.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 1396.0, + 1163.0, + 1396.0, + 1163.0, + 1474.0, + 1025.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 1396.0, + 1416.0, + 1396.0, + 1416.0, + 1474.0, + 1268.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 1431.0, + 415.0, + 1431.0, + 415.0, + 1509.0, + 284.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1431.0, + 524.0, + 1431.0, + 524.0, + 1509.0, + 450.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1431.0, + 820.0, + 1431.0, + 820.0, + 1509.0, + 599.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 1431.0, + 1415.0, + 1431.0, + 1415.0, + 1509.0, + 1397.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 919.0, + 951.0, + 919.0, + 951.0, + 955.0, + 294.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 919.0, + 1404.0, + 919.0, + 1404.0, + 955.0, + 1054.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 949.0, + 459.0, + 949.0, + 459.0, + 986.0, + 293.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 949.0, + 1166.0, + 949.0, + 1166.0, + 986.0, + 545.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 949.0, + 1406.0, + 949.0, + 1406.0, + 986.0, + 1262.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 981.0, + 1008.0, + 981.0, + 1008.0, + 1016.0, + 293.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 981.0, + 1404.0, + 981.0, + 1404.0, + 1016.0, + 1040.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1015.0, + 854.0, + 1015.0, + 854.0, + 1047.0, + 295.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1015.0, + 1074.0, + 1015.0, + 1074.0, + 1047.0, + 886.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1015.0, + 1403.0, + 1015.0, + 1403.0, + 1047.0, + 1179.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1038.0, + 296.0, + 1038.0, + 296.0, + 1092.0, + 288.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1038.0, + 586.0, + 1038.0, + 586.0, + 1092.0, + 323.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1038.0, + 1295.0, + 1038.0, + 1295.0, + 1092.0, + 747.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1038.0, + 1412.0, + 1038.0, + 1412.0, + 1092.0, + 1322.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1080.0, + 477.0, + 1080.0, + 477.0, + 1138.0, + 290.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 1080.0, + 1404.0, + 1080.0, + 1404.0, + 1138.0, + 537.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1106.0, + 771.0, + 1106.0, + 771.0, + 1195.0, + 283.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 1106.0, + 1148.0, + 1106.0, + 1148.0, + 1195.0, + 960.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1106.0, + 1416.0, + 1106.0, + 1416.0, + 1195.0, + 1183.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 282.0, + 1176.0, + 1028.0, + 1176.0, + 1028.0, + 1257.0, + 282.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 1176.0, + 1419.0, + 1176.0, + 1419.0, + 1257.0, + 1215.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 280.0, + 1217.0, + 709.0, + 1217.0, + 709.0, + 1295.0, + 280.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1217.0, + 1122.0, + 1217.0, + 1122.0, + 1295.0, + 806.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 1217.0, + 1268.0, + 1217.0, + 1268.0, + 1295.0, + 1180.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1217.0, + 1418.0, + 1217.0, + 1418.0, + 1295.0, + 1352.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1272.0, + 636.0, + 1272.0, + 636.0, + 1314.0, + 292.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1272.0, + 1065.0, + 1272.0, + 1065.0, + 1314.0, + 776.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1272.0, + 1236.0, + 1272.0, + 1236.0, + 1314.0, + 1222.0, + 1314.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 794, + 1406, + 794, + 1406, + 1018, + 296, + 1018 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1169, + 1404, + 1169, + 1404, + 1295, + 297, + 1295 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 295, + 588, + 1405, + 588, + 1405, + 785, + 295, + 785 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1898, + 1405, + 1898, + 1405, + 1993, + 297, + 1993 + ], + "score": 0.966 + }, + { + "category_id": 0, + "poly": [ + 301, + 1060, + 1387, + 1060, + 1387, + 1135, + 301, + 1135 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 310, + 1701, + 1340, + 1701, + 1340, + 1798, + 310, + 1798 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 295, + 1614, + 1407, + 1614, + 1407, + 1681, + 295, + 1681 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 294, + 1831, + 1400, + 1831, + 1400, + 1866, + 294, + 1866 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 813, + 74, + 813, + 105, + 299, + 105 + ], + "score": 0.908 + }, + { + "category_id": 1, + "poly": [ + 291, + 1999, + 1339, + 1999, + 1339, + 2037, + 291, + 2037 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2112, + 840, + 2112 + ], + "score": 0.816 + }, + { + "category_id": 9, + "poly": [ + 1368, + 1735, + 1400, + 1735, + 1400, + 1765, + 1368, + 1765 + ], + "score": 0.774 + }, + { + "category_id": 1, + "poly": [ + 295, + 1325, + 1405, + 1325, + 1405, + 1532, + 295, + 1532 + ], + "score": 0.761 + }, + { + "category_id": 5, + "poly": [ + 307, + 265, + 1318, + 265, + 1318, + 532, + 307, + 532 + ], + "score": 0.73, + "html": "
1: Input: policy π to be evaluated, number of samples N, regularization parameter 入 > 0
2:Let QH+1(·,·)=O andVH+1(-)= 0
forh=H,H-1,...,1do
4:Take samples (s,a)~ μh,rh ~ r(s,a) and sh ~P(s,a) for eachi∈ [N]
5:LetAh=∑i∈[N](sn,an)(s,a)T+λI
6: 7:LetOn=An1(∑N(s,)·(nh+V+1(3))
Let Qn(-,) = (.,·)TOn and Vh(.)=Q(·,π())
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1542, + 1400, + 1542, + 1400, + 1606, + 297, + 1606 + ], + "score": 0.687 + }, + { + "category_id": 6, + "poly": [ + 300, + 229, + 812, + 229, + 812, + 262, + 300, + 262 + ], + "score": 0.491 + }, + { + "category_id": 0, + "poly": [ + 300, + 229, + 812, + 229, + 812, + 262, + 300, + 262 + ], + "score": 0.298 + }, + { + "category_id": 13, + "poly": [ + 450, + 837, + 611, + 837, + 611, + 882, + 450, + 882 + ], + "score": 0.94, + "latex": "\\textstyle \\sum _ { c \\in { \\hat { d } } } e _ { c } / { \\hat { d } } ^ { 1 / 2 }" + }, + { + "category_id": 14, + "poly": [ + 311, + 1698, + 1354, + 1698, + 1354, + 1800, + 311, + 1800 + ], + "score": 0.94, + "latex": "( Q ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } = \\displaystyle \\left\\| \\sum _ { h = 1 } ^ { H } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\cdot \\cdot \\cdot ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } ." + }, + { + "category_id": 13, + "poly": [ + 784, + 835, + 841, + 835, + 841, + 879, + 784, + 879 + ], + "score": 0.93, + "latex": "s _ { h } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1000, + 1459, + 1143, + 1459, + 1143, + 1496, + 1000, + 1496 + ], + "score": 0.93, + "latex": "\\phi ( \\overline { { s } } _ { h } ^ { i } , \\pi ( \\overline { { s } } _ { h } ^ { i } ) )" + }, + { + "category_id": 13, + "poly": [ + 1112, + 746, + 1191, + 746, + 1191, + 784, + 1112, + 784 + ], + "score": 0.93, + "latex": "\\Omega ( \\hat { d } ^ { H } )" + }, + { + "category_id": 13, + "poly": [ + 1284, + 1426, + 1393, + 1426, + 1393, + 1462, + 1284, + 1462 + ], + "score": 0.93, + "latex": "\\phi ( s _ { h } ^ { i } , a _ { h } ^ { i } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 915, + 354, + 915, + 354, + 958, + 298, + 958 + ], + "score": 0.93, + "latex": "s _ { h } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 904, + 793, + 961, + 793, + 961, + 838, + 904, + 838 + ], + "score": 0.93, + "latex": "s _ { h } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 935, + 356, + 1113, + 356, + 1113, + 393, + 935, + 393 + ], + "score": 0.92, + "latex": "\\overline { { s } } _ { h } ^ { i } \\sim P ( s _ { h } ^ { i } , a _ { h } ^ { i } )" + }, + { + "category_id": 13, + "poly": [ + 733, + 623, + 865, + 623, + 865, + 713, + 733, + 713 + ], + "score": 0.92, + "latex": "r _ { 2 } = \\left\\{ \\begin{array} { l l } { { \\stackrel { - } { 1 } } } \\\\ { { - 1 } } \\end{array} \\right." + }, + { + "category_id": 13, + "poly": [ + 602, + 588, + 753, + 588, + 753, + 625, + 602, + 625 + ], + "score": 0.92, + "latex": "r _ { 0 } ~ = ~ \\hat { d } ^ { - H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 534, + 1329, + 627, + 1329, + 627, + 1363, + 534, + 1363 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 590, + 1366, + 719, + 1366, + 719, + 1400, + 590, + 1400 + ], + "score": 0.92, + "latex": "h \\in [ H - 1 ]" + }, + { + "category_id": 13, + "poly": [ + 297, + 1425, + 666, + 1425, + 666, + 1461, + 297, + 1461 + ], + "score": 0.92, + "latex": "\\overline { { \\Lambda } } _ { 1 } = \\phi ( s _ { 1 } , \\pi ( s _ { 1 } ) ) \\phi ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 470, + 1493, + 813, + 1493, + 813, + 1531, + 470, + 1531 + ], + "score": 0.92, + "latex": "\\xi _ { h } ^ { i } = r _ { h } ^ { i } + V ( \\overline { { s } } _ { h } ^ { i } ) - Q ( s _ { h } ^ { i } , a _ { h } ^ { i } )" + }, + { + "category_id": 13, + "poly": [ + 989, + 1647, + 1174, + 1647, + 1174, + 1680, + 989, + 1680 + ], + "score": 0.92, + "latex": "( s , a ) \\in S _ { h } \\times \\mathcal { A }" + }, + { + "category_id": 13, + "poly": [ + 1260, + 1463, + 1353, + 1463, + 1353, + 1495, + 1260, + 1495 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 918, + 1428, + 996, + 1428, + 996, + 1456, + 918, + 1456 + ], + "score": 0.92, + "latex": "N \\times d" + }, + { + "category_id": 13, + "poly": [ + 711, + 1327, + 1094, + 1327, + 1094, + 1366, + 711, + 1366 + ], + "score": 0.91, + "latex": "\\Lambda _ { h } = \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } \\left[ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } \\right]" + }, + { + "category_id": 13, + "poly": [ + 766, + 710, + 927, + 710, + 927, + 748, + 766, + 748 + ], + "score": 0.91, + "latex": "\\varepsilon = \\hat { d } ^ { - H / 2 } / 2" + }, + { + "category_id": 13, + "poly": [ + 419, + 1461, + 484, + 1461, + 484, + 1495, + 419, + 1495 + ], + "score": 0.91, + "latex": "\\overline { { \\Phi } } _ { h + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1191, + 2000, + 1330, + 2000, + 1330, + 2035, + 1191, + 2035 + ], + "score": 0.91, + "latex": "\\overline { { \\Lambda _ { h } } } \\preceq C _ { h } \\Lambda _ { h }" + }, + { + "category_id": 13, + "poly": [ + 389, + 298, + 563, + 298, + 563, + 330, + 389, + 330 + ], + "score": 0.91, + "latex": "Q _ { H + 1 } ( \\cdot , \\cdot ) = 0" + }, + { + "category_id": 13, + "poly": [ + 297, + 1495, + 384, + 1495, + 384, + 1530, + 297, + 1530 + ], + "score": 0.91, + "latex": "i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 992, + 2002, + 1080, + 2002, + 1080, + 2034, + 992, + 2034 + ], + "score": 0.91, + "latex": "C _ { h } \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 451, + 595, + 545, + 595, + 545, + 625, + 451, + 625 + ], + "score": 0.91, + "latex": "r _ { 0 } ~ = ~ 0" + }, + { + "category_id": 13, + "poly": [ + 758, + 2003, + 849, + 2003, + 849, + 2036, + 758, + 2036 + ], + "score": 0.91, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 613, + 297, + 762, + 297, + 762, + 331, + 613, + 331 + ], + "score": 0.9, + "latex": "V _ { H + 1 } ( \\cdot ) = 0" + }, + { + "category_id": 13, + "poly": [ + 980, + 714, + 1074, + 714, + 1074, + 744, + 980, + 744 + ], + "score": 0.9, + "latex": "\\delta = 0 . 9" + }, + { + "category_id": 13, + "poly": [ + 1196, + 878, + 1254, + 878, + 1254, + 913, + 1196, + 913 + ], + "score": 0.9, + "latex": "\\hat { d } ^ { H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1151, + 838, + 1203, + 838, + 1203, + 873, + 1151, + 873 + ], + "score": 0.9, + "latex": "\\hat { d } ^ { 1 / 2 }" + }, + { + "category_id": 13, + "poly": [ + 796, + 1428, + 834, + 1428, + 834, + 1458, + 796, + 1458 + ], + "score": 0.9, + "latex": "\\Phi _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1222, + 1615, + 1405, + 1615, + 1405, + 1648, + 1222, + 1648 + ], + "score": 0.9, + "latex": "\\theta _ { 1 } , \\theta _ { 2 } , \\ldots , \\theta _ { d } \\in" + }, + { + "category_id": 13, + "poly": [ + 1364, + 1494, + 1393, + 1494, + 1393, + 1530, + 1364, + 1530 + ], + "score": 0.9, + "latex": "\\xi _ { h } ^ { i }" + }, + { + "category_id": 13, + "poly": [ + 548, + 1616, + 618, + 1616, + 618, + 1644, + 548, + 1644 + ], + "score": 0.89, + "latex": "\\lambda > 0" + }, + { + "category_id": 13, + "poly": [ + 640, + 1463, + 717, + 1463, + 717, + 1491, + 640, + 1491 + ], + "score": 0.89, + "latex": "N \\times d" + }, + { + "category_id": 13, + "poly": [ + 430, + 486, + 665, + 486, + 665, + 525, + 430, + 525 + ], + "score": 0.89, + "latex": "\\hat { Q } _ { h } ( \\cdot , \\cdot ) = \\phi ( \\cdot , \\cdot ) ^ { \\top } \\hat { \\theta } _ { h }" + }, + { + "category_id": 13, + "poly": [ + 913, + 1497, + 942, + 1497, + 942, + 1529, + 913, + 1529 + ], + "score": 0.88, + "latex": "\\xi _ { h }" + }, + { + "category_id": 13, + "poly": [ + 429, + 393, + 891, + 393, + 891, + 433, + 429, + 433 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\hat { \\Lambda } _ { h } = \\sum _ { i \\in [ N ] } \\phi ( s _ { h } ^ { i } , a _ { h } ^ { i } ) \\phi ( s _ { h } ^ { i } , a _ { h } ^ { i } ) ^ { \\top } + \\lambda I } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1214, + 357, + 1301, + 357, + 1301, + 392, + 1214, + 392 + ], + "score": 0.87, + "latex": "i \\in [ N ]" + }, + { + "category_id": 13, + "poly": [ + 1071, + 627, + 1251, + 627, + 1251, + 705, + 1071, + 705 + ], + "score": 0.86, + "latex": "\\begin{array} { c } { { ( 1 + \\hat { d } ^ { - H / 2 } ) / 2 } } \\\\ { { ( 1 - \\hat { d } ^ { - H / 2 } ) / 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1645, + 333, + 1645, + 333, + 1674, + 298, + 1674 + ], + "score": 0.86, + "latex": "\\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 997, + 844, + 1022, + 844, + 1022, + 877, + 997, + 877 + ], + "score": 0.86, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 464, + 886, + 489, + 886, + 489, + 916, + 464, + 916 + ], + "score": 0.85, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 425, + 755, + 454, + 755, + 454, + 782, + 425, + 782 + ], + "score": 0.85, + "latex": "r _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 647, + 1645, + 908, + 1645, + 908, + 1680, + 647, + 1680 + ], + "score": 0.84, + "latex": "Q _ { h } ^ { \\bar { \\pi } } ( s , a ) = \\phi ( s , \\bar { a } ) ^ { \\top } \\theta _ { h }" + }, + { + "category_id": 13, + "poly": [ + 504, + 755, + 532, + 755, + 532, + 782, + 504, + 782 + ], + "score": 0.84, + "latex": "r _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 804, + 1364, + 1399, + 1364, + 1399, + 1402, + 804, + 1402 + ], + "score": 0.83, + "latex": "\\overline { { \\Lambda } } _ { h + 1 } = \\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } , \\overline { { s } } \\sim P ( \\cdot \\vert s , a ) } \\left[ \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) ^ { \\top } \\right]" + }, + { + "category_id": 13, + "poly": [ + 542, + 1647, + 635, + 1647, + 635, + 1679, + 542, + 1679 + ], + "score": 0.82, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 925, + 270, + 953, + 270, + 953, + 295, + 925, + 295 + ], + "score": 0.81, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1242, + 269, + 1313, + 269, + 1313, + 297, + 1242, + 297 + ], + "score": 0.8, + "latex": "\\lambda > 0" + }, + { + "category_id": 13, + "poly": [ + 741, + 885, + 769, + 885, + 769, + 912, + 741, + 912 + ], + "score": 0.79, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 854, + 1268, + 875, + 1268, + 875, + 1290, + 854, + 1290 + ], + "score": 0.77, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 429, + 434, + 969, + 434, + 969, + 484, + 429, + 484 + ], + "score": 0.77, + "latex": "\\begin{array} { r } { \\hat { \\theta } ^ { h } = \\hat { \\Lambda } _ { h } ^ { - 1 } \\left( \\sum _ { i = 1 } ^ { N } \\phi ( s _ { h } ^ { i } , a _ { h } ^ { i } ) \\cdot ( r _ { h } ^ { i } + \\hat { V } _ { h + 1 } ( \\overline { { s } } _ { h } ^ { i } ) ) \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1162, + 1430, + 1175, + 1430, + 1175, + 1455, + 1162, + 1455 + ], + "score": 0.76, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 386, + 330, + 630, + 330, + 630, + 359, + 386, + 359 + ], + "score": 0.75, + "latex": "h = H , H - 1 , \\dots , 1" + }, + { + "category_id": 13, + "poly": [ + 504, + 274, + 524, + 274, + 524, + 295, + 504, + 295 + ], + "score": 0.75, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 877, + 1464, + 889, + 1464, + 889, + 1490, + 877, + 1490 + ], + "score": 0.75, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1228, + 1500, + 1240, + 1500, + 1240, + 1524, + 1228, + 1524 + ], + "score": 0.75, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1621, + 1080, + 1621, + 1080, + 1644, + 1062, + 1644 + ], + "score": 0.74, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 459, + 1367, + 478, + 1367, + 478, + 1394, + 459, + 1394 + ], + "score": 0.74, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 1180, + 1401, + 1198, + 1401, + 1198, + 1425, + 1180, + 1425 + ], + "score": 0.72, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 718, + 485, + 925, + 485, + 925, + 526, + 718, + 526 + ], + "score": 0.71, + "latex": "\\hat { V } _ { h } ( \\cdot ) = \\hat { Q } ( \\cdot , \\pi ( \\cdot ) )" + }, + { + "category_id": 13, + "poly": [ + 544, + 357, + 884, + 357, + 884, + 393, + 544, + 393 + ], + "score": 0.69, + "latex": "( s _ { h } ^ { i } , a _ { h } ^ { i } ) \\sim \\mu _ { h } , r _ { h } ^ { i } \\sim r ( s _ { h } ^ { i } , a _ { h } ^ { i } )" + }, + { + "category_id": 14, + "poly": [ + 294, + 630, + 682, + 630, + 682, + 706, + 294, + 706 + ], + "score": 0.58, + "latex": "r _ { 1 } = \\left\\{ { \\begin{array} { l l } { 1 } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\\\ { - 1 } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\end{array} } \\right." + }, + { + "category_id": 13, + "poly": [ + 768, + 1618, + 783, + 1618, + 783, + 1643, + 768, + 1643 + ], + "score": 0.54, + "latex": "^ { l }" + }, + { + "category_id": 14, + "poly": [ + 296, + 629, + 427, + 629, + 427, + 705, + 296, + 705 + ], + "score": 0.39, + "latex": "r _ { 1 } = { \\binom { 1 } { - 1 } }" + }, + { + "category_id": 13, + "poly": [ + 296, + 629, + 427, + 629, + 427, + 705, + 296, + 705 + ], + "score": 0.32, + "latex": "r _ { 1 } = { \\binom { 1 } { - 1 } }" + }, + { + "category_id": 13, + "poly": [ + 1131, + 1363, + 1399, + 1363, + 1399, + 1401, + 1131, + 1401 + ], + "score": 0.31, + "latex": "\\left[ \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) \\phi ( \\overline { { s } } , \\pi ( \\overline { { s } } ) ) ^ { \\top } \\right]" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1052.0, + 1391.0, + 1052.0, + 1391.0, + 1103.0, + 289.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1100.0, + 591.0, + 1100.0, + 591.0, + 1139.0, + 346.0, + 1139.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": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 224.0, + 817.0, + 224.0, + 817.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 224.0, + 817.0, + 224.0, + 817.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 790.0, + 1406.0, + 790.0, + 1406.0, + 838.0, + 962.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 832.0, + 449.0, + 832.0, + 449.0, + 893.0, + 285.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 832.0, + 783.0, + 832.0, + 783.0, + 893.0, + 612.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 832.0, + 996.0, + 832.0, + 996.0, + 893.0, + 842.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 832.0, + 1150.0, + 832.0, + 1150.0, + 893.0, + 1023.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 832.0, + 1407.0, + 832.0, + 1407.0, + 893.0, + 1204.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 876.0, + 463.0, + 876.0, + 463.0, + 922.0, + 291.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 490.0, + 876.0, + 740.0, + 876.0, + 740.0, + 922.0, + 490.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 876.0, + 1195.0, + 876.0, + 1195.0, + 922.0, + 770.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 876.0, + 1408.0, + 876.0, + 1408.0, + 922.0, + 1255.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 902.0, + 297.0, + 902.0, + 297.0, + 987.0, + 288.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 902.0, + 1413.0, + 902.0, + 1413.0, + 987.0, + 355.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 982.0, + 1311.0, + 982.0, + 1311.0, + 1019.0, + 293.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 790.0, + 947.0, + 790.0, + 947.0, + 846.0, + 290.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 934.0, + 329.0, + 934.0, + 329.0, + 961.5, + 298.0, + 961.5 + ], + "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": [ + 295.0, + 1203.0, + 1405.0, + 1203.0, + 1405.0, + 1236.0, + 295.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1232.0, + 1404.0, + 1232.0, + 1404.0, + 1267.0, + 292.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1264.0, + 853.0, + 1264.0, + 853.0, + 1297.0, + 294.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1264.0, + 1235.0, + 1264.0, + 1235.0, + 1297.0, + 876.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 580.0, + 450.0, + 580.0, + 450.0, + 632.0, + 290.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 580.0, + 601.0, + 580.0, + 601.0, + 632.0, + 546.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 580.0, + 1407.0, + 580.0, + 1407.0, + 632.0, + 754.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 628.0, + 732.0, + 628.0, + 732.0, + 709.0, + 683.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 619.0, + 1070.0, + 619.0, + 1070.0, + 709.0, + 874.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 619.0, + 1404.0, + 619.0, + 1404.0, + 709.0, + 1252.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 704.0, + 765.0, + 704.0, + 765.0, + 753.0, + 292.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 704.0, + 979.0, + 704.0, + 979.0, + 753.0, + 928.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 704.0, + 1410.0, + 704.0, + 1410.0, + 753.0, + 1075.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 744.0, + 424.0, + 744.0, + 424.0, + 789.0, + 293.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 744.0, + 503.0, + 744.0, + 503.0, + 789.0, + 455.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 744.0, + 1111.0, + 744.0, + 1111.0, + 789.0, + 533.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 744.0, + 1300.0, + 744.0, + 1300.0, + 789.0, + 1192.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1897.0, + 1405.0, + 1897.0, + 1405.0, + 1932.0, + 292.0, + 1932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1931.0, + 1405.0, + 1931.0, + 1405.0, + 1965.0, + 295.0, + 1965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1963.0, + 1125.0, + 1963.0, + 1125.0, + 1993.0, + 296.0, + 1993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1612.0, + 547.0, + 1612.0, + 547.0, + 1651.0, + 294.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 1612.0, + 767.0, + 1612.0, + 767.0, + 1651.0, + 619.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1612.0, + 1061.0, + 1612.0, + 1061.0, + 1651.0, + 784.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 1612.0, + 1221.0, + 1612.0, + 1221.0, + 1651.0, + 1081.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1641.0, + 297.0, + 1641.0, + 297.0, + 1684.0, + 292.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 1641.0, + 541.0, + 1641.0, + 541.0, + 1684.0, + 334.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 1641.0, + 646.0, + 1641.0, + 646.0, + 1684.0, + 636.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 1641.0, + 988.0, + 1641.0, + 988.0, + 1684.0, + 909.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1175.0, + 1641.0, + 1346.0, + 1641.0, + 1346.0, + 1684.0, + 1175.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1829.0, + 1404.0, + 1829.0, + 1404.0, + 1868.0, + 296.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1996.0, + 757.0, + 1996.0, + 757.0, + 2042.0, + 292.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 1996.0, + 991.0, + 1996.0, + 991.0, + 2042.0, + 850.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 1996.0, + 1190.0, + 1996.0, + 1190.0, + 2042.0, + 1081.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 1996.0, + 1342.0, + 1996.0, + 1342.0, + 2042.0, + 1331.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1323.0, + 533.0, + 1323.0, + 533.0, + 1371.0, + 289.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1323.0, + 710.0, + 1323.0, + 710.0, + 1371.0, + 628.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 1323.0, + 1410.0, + 1323.0, + 1410.0, + 1371.0, + 1095.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1359.0, + 458.0, + 1359.0, + 458.0, + 1409.0, + 288.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 1359.0, + 589.0, + 1359.0, + 589.0, + 1409.0, + 479.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 1359.0, + 803.0, + 1359.0, + 803.0, + 1409.0, + 720.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1400.0, + 1359.0, + 1404.0, + 1359.0, + 1404.0, + 1409.0, + 1400.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1397.0, + 1179.0, + 1397.0, + 1179.0, + 1431.0, + 294.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1397.0, + 1406.0, + 1397.0, + 1406.0, + 1431.0, + 1199.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1424.0, + 296.0, + 1424.0, + 296.0, + 1463.0, + 293.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1424.0, + 795.0, + 1424.0, + 795.0, + 1463.0, + 667.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1424.0, + 917.0, + 1424.0, + 917.0, + 1463.0, + 835.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1424.0, + 1161.0, + 1424.0, + 1161.0, + 1463.0, + 997.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 1424.0, + 1283.0, + 1424.0, + 1283.0, + 1463.0, + 1176.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1424.0, + 1403.0, + 1424.0, + 1403.0, + 1463.0, + 1394.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1458.0, + 418.0, + 1458.0, + 418.0, + 1499.0, + 294.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 485.0, + 1458.0, + 639.0, + 1458.0, + 639.0, + 1499.0, + 485.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 1458.0, + 876.0, + 1458.0, + 876.0, + 1499.0, + 718.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 1458.0, + 999.0, + 1458.0, + 999.0, + 1499.0, + 890.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 1458.0, + 1259.0, + 1458.0, + 1259.0, + 1499.0, + 1144.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1458.0, + 1407.0, + 1458.0, + 1407.0, + 1499.0, + 1354.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1493.0, + 296.0, + 1493.0, + 296.0, + 1534.0, + 290.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 1493.0, + 469.0, + 1493.0, + 469.0, + 1534.0, + 385.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 1493.0, + 912.0, + 1493.0, + 912.0, + 1534.0, + 814.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 1493.0, + 1227.0, + 1493.0, + 1227.0, + 1534.0, + 943.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 1493.0, + 1363.0, + 1493.0, + 1363.0, + 1534.0, + 1241.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1493.0, + 1405.0, + 1493.0, + 1405.0, + 1534.0, + 1394.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1542.0, + 1402.0, + 1542.0, + 1402.0, + 1578.0, + 295.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1573.0, + 1366.0, + 1573.0, + 1366.0, + 1609.0, + 296.0, + 1609.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1412, + 1405, + 1412, + 1405, + 1688, + 298, + 1688 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 296, + 543, + 1406, + 543, + 1406, + 868, + 296, + 868 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1801, + 1404, + 1801, + 1404, + 1954, + 299, + 1954 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 897, + 1404, + 897, + 1404, + 992, + 299, + 992 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 298, + 226, + 1404, + 226, + 1404, + 327, + 298, + 327 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 298, + 1201, + 1405, + 1201, + 1405, + 1302, + 298, + 1302 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 297, + 389, + 1405, + 389, + 1405, + 536, + 297, + 536 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 298, + 1088, + 1406, + 1088, + 1406, + 1189, + 298, + 1189 + ], + "score": 0.958 + }, + { + "category_id": 2, + "poly": [ + 298, + 1977, + 1404, + 1977, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 293, + 997, + 1400, + 997, + 1400, + 1067, + 293, + 1067 + ], + "score": 0.929 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 299, + 1343, + 544, + 1343, + 544, + 1379, + 299, + 1379 + ], + "score": 0.896 + }, + { + "category_id": 1, + "poly": [ + 294, + 350, + 1355, + 350, + 1355, + 384, + 294, + 384 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 301, + 1735, + 607, + 1735, + 607, + 1767, + 301, + 1767 + ], + "score": 0.88 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2111, + 840, + 2111 + ], + "score": 0.803 + }, + { + "category_id": 13, + "poly": [ + 677, + 227, + 879, + 227, + 879, + 270, + 677, + 270 + ], + "score": 0.93, + "latex": "\\sigma _ { \\mathrm { m i n } } ( \\Lambda _ { h } ) \\succeq \\frac { 1 } { C _ { h } } I" + }, + { + "category_id": 13, + "poly": [ + 397, + 1264, + 507, + 1264, + 507, + 1305, + 397, + 1305 + ], + "score": 0.93, + "latex": "\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }" + }, + { + "category_id": 13, + "poly": [ + 479, + 789, + 600, + 789, + 600, + 827, + 479, + 827 + ], + "score": 0.93, + "latex": "( \\hat { d } ^ { 2 } / N ) ^ { 1 / 2 }" + }, + { + "category_id": 13, + "poly": [ + 835, + 752, + 944, + 752, + 944, + 790, + 835, + 790 + ], + "score": 0.93, + "latex": "( \\hat { d } / N ) ^ { 1 / 2 }" + }, + { + "category_id": 13, + "poly": [ + 711, + 642, + 791, + 642, + 791, + 678, + 711, + 678 + ], + "score": 0.93, + "latex": "V ( s _ { H } ^ { c } )" + }, + { + "category_id": 13, + "poly": [ + 1023, + 826, + 1133, + 826, + 1133, + 869, + 1023, + 869 + ], + "score": 0.93, + "latex": "\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1061, + 1973, + 1219, + 1973, + 1219, + 2007, + 1061, + 2007 + ], + "score": 0.92, + "latex": "\\lVert \\theta _ { h } \\rVert _ { 2 } \\leq H \\sqrt { d }" + }, + { + "category_id": 13, + "poly": [ + 1336, + 718, + 1400, + 718, + 1400, + 755, + 1336, + 755 + ], + "score": 0.92, + "latex": "s _ { H - 1 } ^ { c }" + }, + { + "category_id": 13, + "poly": [ + 1174, + 639, + 1252, + 639, + 1252, + 677, + 1174, + 677 + ], + "score": 0.92, + "latex": "c \\in [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 812, + 713, + 890, + 713, + 890, + 751, + 812, + 751 + ], + "score": 0.92, + "latex": "c \\in [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 327, + 794, + 392, + 794, + 392, + 830, + 327, + 830 + ], + "score": 0.92, + "latex": "s _ { H - 1 } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 706, + 718, + 770, + 718, + 770, + 754, + 706, + 754 + ], + "score": 0.92, + "latex": "s _ { H - 1 } ^ { c }" + }, + { + "category_id": 13, + "poly": [ + 558, + 541, + 668, + 541, + 668, + 582, + 558, + 582 + ], + "score": 0.92, + "latex": "\\textstyle \\prod _ { h = 1 } ^ { H } C _ { h }" + }, + { + "category_id": 13, + "poly": [ + 819, + 1089, + 1003, + 1089, + 1003, + 1122, + 819, + 1122 + ], + "score": 0.92, + "latex": "\\sigma _ { \\operatorname* { m i n } } ( \\Lambda _ { h } ) \\geq \\lambda _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 358, + 1151, + 794, + 1151, + 794, + 1191, + 358, + 1191 + ], + "score": 0.92, + "latex": "( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } \\leq \\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 999, + 387, + 1239, + 387, + 1239, + 423, + 999, + 423 + ], + "score": 0.92, + "latex": "\\theta _ { 1 } , \\theta _ { 2 } , \\ldots , \\theta _ { d } \\ \\in \\ \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 542, + 230, + 639, + 230, + 639, + 264, + 542, + 264 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 384, + 2005, + 543, + 2005, + 543, + 2035, + 384, + 2035 + ], + "score": 0.92, + "latex": "( s , a ) \\in \\mathcal { S } \\times \\mathcal { A }" + }, + { + "category_id": 13, + "poly": [ + 990, + 231, + 1082, + 231, + 1082, + 262, + 990, + 262 + ], + "score": 0.91, + "latex": "C _ { h } \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 956, + 995, + 1054, + 995, + 1054, + 1029, + 956, + 1029 + ], + "score": 0.91, + "latex": "\\theta _ { h } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 864, + 424, + 1074, + 424, + 1074, + 459, + 864, + 459 + ], + "score": 0.91, + "latex": "( s , a ) \\ \\in \\ S _ { h } \\times { \\mathcal A }" + }, + { + "category_id": 13, + "poly": [ + 1050, + 265, + 1176, + 265, + 1176, + 296, + 1050, + 296 + ], + "score": 0.91, + "latex": "C _ { h } \\Lambda _ { h } \\succeq I" + }, + { + "category_id": 13, + "poly": [ + 1194, + 227, + 1393, + 227, + 1393, + 262, + 1194, + 262 + ], + "score": 0.91, + "latex": "\\overline { { { \\Lambda } } } _ { h } \\preceq I \\preceq C _ { h } \\Lambda _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1088, + 1089, + 1189, + 1089, + 1189, + 1121, + 1088, + 1121 + ], + "score": 0.91, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 995, + 640, + 1075, + 640, + 1075, + 672, + 995, + 672 + ], + "score": 0.91, + "latex": "N ^ { - 1 / 2 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 716, + 419, + 716, + 419, + 747, + 297, + 747 + ], + "score": 0.91, + "latex": "h = H - 1" + }, + { + "category_id": 13, + "poly": [ + 1199, + 995, + 1292, + 995, + 1292, + 1026, + 1199, + 1026 + ], + "score": 0.9, + "latex": "\\theta ^ { \\prime } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 363, + 643, + 445, + 643, + 445, + 672, + 363, + 672 + ], + "score": 0.9, + "latex": "h = H" + }, + { + "category_id": 13, + "poly": [ + 1262, + 1975, + 1405, + 1975, + 1405, + 2008, + 1262, + 2008 + ], + "score": 0.9, + "latex": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq" + }, + { + "category_id": 13, + "poly": [ + 298, + 458, + 608, + 458, + 608, + 496, + 298, + 496 + ], + "score": 0.9, + "latex": "\\lambda = C H \\sqrt { d \\log ( d H / \\delta ) N }" + }, + { + "category_id": 13, + "poly": [ + 597, + 828, + 655, + 828, + 655, + 861, + 597, + 861 + ], + "score": 0.89, + "latex": "\\hat { d } ^ { H / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1303, + 1090, + 1394, + 1090, + 1394, + 1119, + 1303, + 1119 + ], + "score": 0.89, + "latex": "\\lambda _ { 0 } > 0" + }, + { + "category_id": 13, + "poly": [ + 594, + 758, + 630, + 758, + 630, + 790, + 594, + 790 + ], + "score": 0.89, + "latex": "s _ { H } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1137, + 421, + 1333, + 421, + 1333, + 459, + 1137, + 459 + ], + "score": 0.89, + "latex": "\\| \\theta _ { h } \\| _ { 2 } ~ \\le ~ H \\sqrt { d } ." + }, + { + "category_id": 13, + "poly": [ + 886, + 682, + 922, + 682, + 922, + 714, + 886, + 714 + ], + "score": 0.89, + "latex": "s _ { H } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 724, + 462, + 811, + 462, + 811, + 491, + 724, + 491 + ], + "score": 0.89, + "latex": "C > 0" + }, + { + "category_id": 13, + "poly": [ + 1038, + 1120, + 1352, + 1120, + 1352, + 1153, + 1038, + 1153 + ], + "score": 0.89, + "latex": "N = \\mathrm { p o l } \\bar { \\mathrm { y } } ( \\bar { H } , d , 1 / \\varepsilon , 1 / \\lambda _ { 0 } )" + }, + { + "category_id": 13, + "poly": [ + 1266, + 676, + 1317, + 676, + 1317, + 709, + 1266, + 709 + ], + "score": 0.88, + "latex": "\\hat { d } ^ { 1 / 2 }" + }, + { + "category_id": 13, + "poly": [ + 830, + 998, + 902, + 998, + 902, + 1028, + 830, + 1028 + ], + "score": 0.88, + "latex": "h > 1" + }, + { + "category_id": 13, + "poly": [ + 1315, + 462, + 1393, + 462, + 1393, + 491, + 1315, + 491 + ], + "score": 0.86, + "latex": "c > 0" + }, + { + "category_id": 13, + "poly": [ + 1039, + 793, + 1112, + 793, + 1112, + 823, + 1039, + 823 + ], + "score": 0.84, + "latex": "H - 1" + }, + { + "category_id": 13, + "poly": [ + 384, + 1029, + 1315, + 1029, + 1315, + 1067, + 384, + 1067 + ], + "score": 0.84, + "latex": "\\begin{array} { r } { ( s , a ) \\in \\mathcal S _ { h - 1 } \\times \\mathcal A , \\mathbb E [ R ( s , a ) ] + \\sum _ { s ^ { \\prime } \\in { \\cal S } _ { h } } P ( s ^ { \\prime } \\mid s , a ) \\phi ( s ^ { \\prime } , \\pi ( s ^ { \\prime } ) ) ^ { \\top } \\theta _ { h } = \\phi ( s , a ) ^ { \\top } \\theta ^ { \\prime } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 363, + 423, + 769, + 423, + 769, + 459, + 363, + 459 + ], + "score": 0.84, + "latex": "h \\in [ H ] , Q _ { h } ^ { \\pi } ( s , a ) \\ : = \\ : \\phi ( s , a ) ^ { \\top } \\theta _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1122, + 463, + 1191, + 463, + 1191, + 491, + 1122, + 491 + ], + "score": 0.81, + "latex": "1 - \\delta" + }, + { + "category_id": 13, + "poly": [ + 603, + 681, + 631, + 681, + 631, + 708, + 603, + 708 + ], + "score": 0.81, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 298, + 494, + 1160, + 494, + 1160, + 536, + 298, + 536 + ], + "score": 0.8, + "latex": "\\begin{array} { r } { ( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } \\leq c \\cdot \\prod _ { h = 1 } ^ { H } C _ { h } \\cdot d H ^ { 5 } \\cdot \\sqrt { d \\log ( d H / \\delta ) / N } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 711, + 1005, + 730, + 1005, + 730, + 1027, + 711, + 1027 + ], + "score": 0.69, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 821, + 397, + 841, + 397, + 841, + 419, + 821, + 419 + ], + "score": 0.68, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 361, + 424, + 473, + 424, + 473, + 458, + 361, + 458 + ], + "score": 0.66, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 386, + 1029, + 598, + 1029, + 598, + 1063, + 386, + 1063 + ], + "score": 0.55, + "latex": "( s , a ) \\in S _ { h - 1 } \\times \\mathcal { A }" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1967.0, + 1060.0, + 1967.0, + 1060.0, + 2014.0, + 326.0, + 2014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 1967.0, + 1261.0, + 1967.0, + 1261.0, + 2014.0, + 1220.0, + 2014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 383.0, + 2002.0, + 383.0, + 2036.0, + 294.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 2002.0, + 1348.0, + 2002.0, + 1348.0, + 2036.0, + 544.0, + 2036.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": [ + 292.0, + 1340.0, + 550.0, + 1340.0, + 550.0, + 1388.0, + 292.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1732.0, + 612.0, + 1732.0, + 612.0, + 1775.0, + 297.0, + 1775.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, + 1414.0, + 1405.0, + 1414.0, + 1405.0, + 1447.0, + 297.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1438.0, + 1406.0, + 1438.0, + 1406.0, + 1483.0, + 292.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1476.0, + 1405.0, + 1476.0, + 1405.0, + 1508.0, + 296.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1502.0, + 1406.0, + 1502.0, + 1406.0, + 1541.0, + 293.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1536.0, + 1406.0, + 1536.0, + 1406.0, + 1571.0, + 293.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1566.0, + 1406.0, + 1566.0, + 1406.0, + 1602.0, + 295.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1598.0, + 1403.0, + 1598.0, + 1403.0, + 1631.0, + 295.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1624.0, + 1407.0, + 1624.0, + 1407.0, + 1662.0, + 292.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1653.0, + 1367.0, + 1653.0, + 1367.0, + 1695.0, + 293.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 540.0, + 557.0, + 540.0, + 557.0, + 591.0, + 290.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 669.0, + 540.0, + 1409.0, + 540.0, + 1409.0, + 591.0, + 669.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 578.0, + 1406.0, + 578.0, + 1406.0, + 611.0, + 294.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 609.0, + 1406.0, + 609.0, + 1406.0, + 643.0, + 294.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 638.0, + 362.0, + 638.0, + 362.0, + 683.0, + 293.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 638.0, + 710.0, + 638.0, + 710.0, + 683.0, + 446.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 638.0, + 994.0, + 638.0, + 994.0, + 683.0, + 792.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 638.0, + 1173.0, + 638.0, + 1173.0, + 683.0, + 1076.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 638.0, + 1408.0, + 638.0, + 1408.0, + 683.0, + 1253.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 675.0, + 602.0, + 675.0, + 602.0, + 719.0, + 291.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 675.0, + 885.0, + 675.0, + 885.0, + 719.0, + 632.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 675.0, + 1265.0, + 675.0, + 1265.0, + 719.0, + 923.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 675.0, + 1407.0, + 675.0, + 1407.0, + 719.0, + 1318.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 707.0, + 296.0, + 707.0, + 296.0, + 761.0, + 289.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 707.0, + 705.0, + 707.0, + 705.0, + 761.0, + 420.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 707.0, + 811.0, + 707.0, + 811.0, + 761.0, + 771.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 707.0, + 1335.0, + 707.0, + 1335.0, + 761.0, + 891.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 707.0, + 1407.0, + 707.0, + 1407.0, + 761.0, + 1401.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 751.0, + 593.0, + 751.0, + 593.0, + 796.0, + 293.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 751.0, + 834.0, + 751.0, + 834.0, + 796.0, + 631.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 751.0, + 1408.0, + 751.0, + 1408.0, + 796.0, + 945.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 786.0, + 326.0, + 786.0, + 326.0, + 832.0, + 290.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 786.0, + 478.0, + 786.0, + 478.0, + 832.0, + 393.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 786.0, + 1038.0, + 786.0, + 1038.0, + 832.0, + 601.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 786.0, + 1408.0, + 786.0, + 1408.0, + 832.0, + 1113.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 823.0, + 596.0, + 823.0, + 596.0, + 875.0, + 289.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 823.0, + 1022.0, + 823.0, + 1022.0, + 875.0, + 656.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 823.0, + 1326.0, + 823.0, + 1326.0, + 875.0, + 1134.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1797.0, + 1405.0, + 1797.0, + 1405.0, + 1838.0, + 294.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1829.0, + 1405.0, + 1829.0, + 1405.0, + 1867.0, + 293.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1855.0, + 1406.0, + 1855.0, + 1406.0, + 1903.0, + 292.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1891.0, + 1406.0, + 1891.0, + 1406.0, + 1928.0, + 295.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1920.0, + 1387.0, + 1920.0, + 1387.0, + 1959.0, + 293.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 897.0, + 1405.0, + 897.0, + 1405.0, + 935.0, + 294.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 929.0, + 1405.0, + 929.0, + 1405.0, + 964.0, + 293.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 959.0, + 1360.0, + 959.0, + 1360.0, + 997.0, + 294.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 216.0, + 541.0, + 216.0, + 541.0, + 299.0, + 284.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 216.0, + 676.0, + 216.0, + 676.0, + 299.0, + 640.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 216.0, + 989.0, + 216.0, + 989.0, + 299.0, + 880.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 216.0, + 1193.0, + 216.0, + 1193.0, + 299.0, + 1177.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 216.0, + 1415.0, + 216.0, + 1415.0, + 299.0, + 1394.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 294.0, + 1404.0, + 294.0, + 1404.0, + 329.0, + 293.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1201.0, + 1403.0, + 1201.0, + 1403.0, + 1236.0, + 297.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1233.0, + 1402.0, + 1233.0, + 1402.0, + 1268.0, + 296.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1265.0, + 396.0, + 1265.0, + 396.0, + 1309.0, + 291.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 1265.0, + 1398.0, + 1265.0, + 1398.0, + 1309.0, + 508.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 384.0, + 820.0, + 384.0, + 820.0, + 426.0, + 292.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 384.0, + 998.0, + 384.0, + 998.0, + 426.0, + 842.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 384.0, + 1408.0, + 384.0, + 1408.0, + 426.0, + 1240.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 420.0, + 360.0, + 420.0, + 360.0, + 462.0, + 291.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 420.0, + 863.0, + 420.0, + 863.0, + 462.0, + 770.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 420.0, + 1136.0, + 420.0, + 1136.0, + 462.0, + 1075.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 420.0, + 1407.0, + 420.0, + 1407.0, + 462.0, + 1334.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 456.0, + 297.0, + 456.0, + 297.0, + 497.0, + 292.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 456.0, + 723.0, + 456.0, + 723.0, + 497.0, + 609.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 812.0, + 456.0, + 1121.0, + 456.0, + 1121.0, + 497.0, + 812.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 456.0, + 1314.0, + 456.0, + 1314.0, + 497.0, + 1192.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 456.0, + 1405.0, + 456.0, + 1405.0, + 497.0, + 1394.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 492.0, + 297.0, + 492.0, + 297.0, + 540.0, + 294.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 492.0, + 1173.0, + 492.0, + 1173.0, + 540.0, + 1161.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1087.0, + 818.0, + 1087.0, + 818.0, + 1126.0, + 295.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 1087.0, + 1087.0, + 1087.0, + 1087.0, + 1126.0, + 1004.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 1087.0, + 1302.0, + 1087.0, + 1302.0, + 1126.0, + 1190.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1087.0, + 1407.0, + 1087.0, + 1407.0, + 1126.0, + 1395.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1117.0, + 1037.0, + 1117.0, + 1037.0, + 1155.0, + 295.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 1117.0, + 1404.0, + 1117.0, + 1404.0, + 1155.0, + 1353.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1152.0, + 357.0, + 1152.0, + 357.0, + 1191.0, + 295.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 1152.0, + 1399.0, + 1152.0, + 1399.0, + 1191.0, + 795.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 992.0, + 710.0, + 992.0, + 710.0, + 1033.0, + 293.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 992.0, + 829.0, + 992.0, + 829.0, + 1033.0, + 731.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 992.0, + 955.0, + 992.0, + 955.0, + 1033.0, + 903.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 992.0, + 1198.0, + 992.0, + 1198.0, + 1033.0, + 1055.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1293.0, + 992.0, + 1406.0, + 992.0, + 1406.0, + 1033.0, + 1293.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1024.0, + 383.0, + 1024.0, + 383.0, + 1069.0, + 287.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1316.0, + 1024.0, + 1325.0, + 1024.0, + 1325.0, + 1069.0, + 1316.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 346.0, + 1358.0, + 346.0, + 1358.0, + 389.0, + 294.0, + 389.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 649, + 1405, + 649, + 1405, + 743, + 297, + 743 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 297, + 448, + 1399, + 448, + 1399, + 543, + 297, + 543 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 294, + 279, + 1401, + 279, + 1401, + 343, + 294, + 343 + ], + "score": 0.917 + }, + { + "category_id": 1, + "poly": [ + 294, + 565, + 1401, + 565, + 1401, + 628, + 294, + 628 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 293, + 364, + 1400, + 364, + 1400, + 428, + 293, + 428 + ], + "score": 0.906 + }, + { + "category_id": 1, + "poly": [ + 296, + 765, + 1404, + 765, + 1404, + 891, + 296, + 891 + ], + "score": 0.903 + }, + { + "category_id": 1, + "poly": [ + 296, + 1709, + 1402, + 1709, + 1402, + 1774, + 296, + 1774 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.893 + }, + { + "category_id": 1, + "poly": [ + 296, + 1624, + 1402, + 1624, + 1402, + 1688, + 296, + 1688 + ], + "score": 0.891 + }, + { + "category_id": 1, + "poly": [ + 297, + 1538, + 1402, + 1538, + 1402, + 1604, + 297, + 1604 + ], + "score": 0.886 + }, + { + "category_id": 1, + "poly": [ + 298, + 1052, + 1402, + 1052, + 1402, + 1146, + 298, + 1146 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 299, + 1453, + 1401, + 1453, + 1401, + 1518, + 299, + 1518 + ], + "score": 0.879 + }, + { + "category_id": 1, + "poly": [ + 293, + 1167, + 1401, + 1167, + 1401, + 1232, + 293, + 1232 + ], + "score": 0.876 + }, + { + "category_id": 1, + "poly": [ + 295, + 1794, + 1402, + 1794, + 1402, + 1859, + 295, + 1859 + ], + "score": 0.876 + }, + { + "category_id": 1, + "poly": [ + 300, + 1880, + 1403, + 1880, + 1403, + 2034, + 300, + 2034 + ], + "score": 0.874 + }, + { + "category_id": 1, + "poly": [ + 295, + 1367, + 1401, + 1367, + 1401, + 1434, + 295, + 1434 + ], + "score": 0.873 + }, + { + "category_id": 1, + "poly": [ + 296, + 912, + 1399, + 912, + 1399, + 976, + 296, + 976 + ], + "score": 0.867 + }, + { + "category_id": 1, + "poly": [ + 298, + 1252, + 1404, + 1252, + 1404, + 1348, + 298, + 1348 + ], + "score": 0.864 + }, + { + "category_id": 1, + "poly": [ + 296, + 996, + 1111, + 996, + 1111, + 1031, + 296, + 1031 + ], + "score": 0.86 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.831 + }, + { + "category_id": 0, + "poly": [ + 299, + 227, + 489, + 227, + 489, + 262, + 299, + 262 + ], + "score": 0.782 + }, + { + "category_id": 1, + "poly": [ + 299, + 227, + 489, + 227, + 489, + 262, + 299, + 262 + ], + "score": 0.094 + }, + { + "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, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 230.0, + 490.0, + 230.0, + 490.0, + 263.0, + 297.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 649.0, + 1402.0, + 649.0, + 1402.0, + 686.0, + 295.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 683.0, + 1405.0, + 683.0, + 1405.0, + 717.0, + 323.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 711.0, + 397.0, + 711.0, + 397.0, + 745.0, + 323.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 447.0, + 1404.0, + 447.0, + 1404.0, + 486.0, + 293.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 478.0, + 1405.0, + 478.0, + 1405.0, + 519.0, + 320.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 511.0, + 559.0, + 511.0, + 559.0, + 544.0, + 325.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 276.0, + 1403.0, + 276.0, + 1403.0, + 316.0, + 294.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 308.0, + 1233.0, + 308.0, + 1233.0, + 346.0, + 321.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 562.0, + 1404.0, + 562.0, + 1404.0, + 603.0, + 292.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 594.0, + 397.0, + 594.0, + 397.0, + 630.0, + 323.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 359.0, + 1405.0, + 359.0, + 1405.0, + 402.0, + 292.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 396.0, + 582.0, + 396.0, + 582.0, + 429.0, + 322.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 764.0, + 1405.0, + 764.0, + 1405.0, + 801.0, + 294.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 795.0, + 1405.0, + 795.0, + 1405.0, + 833.0, + 322.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 826.0, + 1405.0, + 826.0, + 1405.0, + 866.0, + 320.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 860.0, + 532.0, + 860.0, + 532.0, + 889.0, + 323.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1707.0, + 1402.0, + 1707.0, + 1402.0, + 1747.0, + 296.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1742.0, + 761.0, + 1742.0, + 761.0, + 1775.0, + 321.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1620.0, + 1406.0, + 1620.0, + 1406.0, + 1664.0, + 295.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1655.0, + 863.0, + 1655.0, + 863.0, + 1691.0, + 324.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1540.0, + 1404.0, + 1540.0, + 1404.0, + 1576.0, + 296.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1570.0, + 1286.0, + 1570.0, + 1286.0, + 1605.0, + 322.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1052.0, + 1403.0, + 1052.0, + 1403.0, + 1089.0, + 294.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1080.0, + 1406.0, + 1080.0, + 1406.0, + 1122.0, + 321.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1114.0, + 585.0, + 1114.0, + 585.0, + 1147.0, + 322.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1452.0, + 1403.0, + 1452.0, + 1403.0, + 1491.0, + 295.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1484.0, + 1058.0, + 1484.0, + 1058.0, + 1520.0, + 322.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1169.0, + 1403.0, + 1169.0, + 1403.0, + 1205.0, + 297.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1198.0, + 876.0, + 1198.0, + 876.0, + 1233.0, + 321.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1793.0, + 1405.0, + 1793.0, + 1405.0, + 1832.0, + 295.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1825.0, + 1404.0, + 1825.0, + 1404.0, + 1861.0, + 324.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1878.0, + 1405.0, + 1878.0, + 1405.0, + 1917.0, + 295.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1912.0, + 1403.0, + 1912.0, + 1403.0, + 1945.0, + 323.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1938.0, + 1403.0, + 1938.0, + 1403.0, + 1980.0, + 320.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1970.0, + 1404.0, + 1970.0, + 1404.0, + 2009.0, + 323.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2001.0, + 722.0, + 2001.0, + 722.0, + 2038.0, + 323.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1367.0, + 1405.0, + 1367.0, + 1405.0, + 1404.0, + 294.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1399.0, + 1391.0, + 1399.0, + 1391.0, + 1434.0, + 324.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 908.0, + 1404.0, + 908.0, + 1404.0, + 952.0, + 292.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 943.0, + 1143.0, + 943.0, + 1143.0, + 979.0, + 322.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1247.0, + 1405.0, + 1247.0, + 1405.0, + 1294.0, + 292.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1284.0, + 1404.0, + 1284.0, + 1404.0, + 1320.0, + 322.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1315.0, + 690.0, + 1315.0, + 690.0, + 1349.0, + 323.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 996.0, + 1111.0, + 996.0, + 1111.0, + 1036.0, + 294.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 230.0, + 490.0, + 230.0, + 490.0, + 263.0, + 297.0, + 263.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 229, + 1400, + 229, + 1400, + 322, + 298, + 322 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.885 + }, + { + "category_id": 1, + "poly": [ + 301, + 1084, + 1402, + 1084, + 1402, + 1179, + 301, + 1179 + ], + "score": 0.883 + }, + { + "category_id": 1, + "poly": [ + 296, + 1199, + 1398, + 1199, + 1398, + 1265, + 296, + 1265 + ], + "score": 0.878 + }, + { + "category_id": 1, + "poly": [ + 297, + 914, + 1399, + 914, + 1399, + 980, + 297, + 980 + ], + "score": 0.868 + }, + { + "category_id": 1, + "poly": [ + 296, + 830, + 1402, + 830, + 1402, + 894, + 296, + 894 + ], + "score": 0.858 + }, + { + "category_id": 1, + "poly": [ + 296, + 660, + 1398, + 660, + 1398, + 724, + 296, + 724 + ], + "score": 0.857 + }, + { + "category_id": 1, + "poly": [ + 298, + 745, + 1400, + 745, + 1400, + 809, + 298, + 809 + ], + "score": 0.856 + }, + { + "category_id": 1, + "poly": [ + 301, + 428, + 1398, + 428, + 1398, + 494, + 301, + 494 + ], + "score": 0.856 + }, + { + "category_id": 1, + "poly": [ + 295, + 999, + 1401, + 999, + 1401, + 1064, + 295, + 1064 + ], + "score": 0.853 + }, + { + "category_id": 1, + "poly": [ + 296, + 1570, + 1402, + 1570, + 1402, + 1634, + 296, + 1634 + ], + "score": 0.848 + }, + { + "category_id": 1, + "poly": [ + 297, + 513, + 1405, + 513, + 1405, + 638, + 297, + 638 + ], + "score": 0.845 + }, + { + "category_id": 1, + "poly": [ + 296, + 1284, + 1398, + 1284, + 1398, + 1350, + 296, + 1350 + ], + "score": 0.838 + }, + { + "category_id": 1, + "poly": [ + 296, + 344, + 1401, + 344, + 1401, + 408, + 296, + 408 + ], + "score": 0.837 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.824 + }, + { + "category_id": 1, + "poly": [ + 295, + 1484, + 1399, + 1484, + 1399, + 1550, + 295, + 1550 + ], + "score": 0.82 + }, + { + "category_id": 1, + "poly": [ + 298, + 1654, + 1401, + 1654, + 1401, + 1749, + 298, + 1749 + ], + "score": 0.819 + }, + { + "category_id": 1, + "poly": [ + 298, + 1369, + 1405, + 1369, + 1405, + 1463, + 298, + 1463 + ], + "score": 0.811 + }, + { + "category_id": 1, + "poly": [ + 289, + 1770, + 1402, + 1770, + 1402, + 1835, + 289, + 1835 + ], + "score": 0.794 + }, + { + "category_id": 1, + "poly": [ + 299, + 1971, + 1397, + 1971, + 1397, + 2035, + 299, + 2035 + ], + "score": 0.78 + }, + { + "category_id": 1, + "poly": [ + 296, + 1856, + 1402, + 1856, + 1402, + 1949, + 296, + 1949 + ], + "score": 0.748 + }, + { + "category_id": 13, + "poly": [ + 1295, + 1208, + 1315, + 1208, + 1315, + 1228, + 1295, + 1228 + ], + "score": 0.39, + "latex": ":" + }, + { + "category_id": 13, + "poly": [ + 1383, + 580, + 1403, + 580, + 1403, + 603, + 1383, + 603 + ], + "score": 0.39, + "latex": "=" + }, + { + "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, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 1404.0, + 227.0, + 1404.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 259.0, + 1404.0, + 259.0, + 1404.0, + 300.0, + 321.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 291.0, + 533.0, + 291.0, + 533.0, + 323.0, + 324.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1085.0, + 1402.0, + 1085.0, + 1402.0, + 1119.0, + 296.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1117.0, + 1404.0, + 1117.0, + 1404.0, + 1151.0, + 322.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1144.0, + 399.0, + 1144.0, + 399.0, + 1180.0, + 319.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1200.0, + 1294.0, + 1200.0, + 1294.0, + 1236.0, + 294.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1316.0, + 1200.0, + 1403.0, + 1200.0, + 1403.0, + 1236.0, + 1316.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1232.0, + 808.0, + 1232.0, + 808.0, + 1264.0, + 325.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 915.0, + 1401.0, + 915.0, + 1401.0, + 950.0, + 295.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 946.0, + 1247.0, + 946.0, + 1247.0, + 982.0, + 323.0, + 982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 829.0, + 1406.0, + 829.0, + 1406.0, + 868.0, + 294.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 862.0, + 845.0, + 862.0, + 845.0, + 894.0, + 325.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 655.0, + 1403.0, + 655.0, + 1403.0, + 700.0, + 292.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 692.0, + 931.0, + 692.0, + 931.0, + 725.0, + 322.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 745.0, + 1404.0, + 745.0, + 1404.0, + 781.0, + 294.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 776.0, + 1175.0, + 776.0, + 1175.0, + 812.0, + 323.0, + 812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 426.0, + 1406.0, + 426.0, + 1406.0, + 468.0, + 293.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 460.0, + 857.0, + 460.0, + 857.0, + 495.0, + 325.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1002.0, + 1402.0, + 1002.0, + 1402.0, + 1034.0, + 295.0, + 1034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1030.0, + 1403.0, + 1030.0, + 1403.0, + 1065.0, + 322.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1567.0, + 1406.0, + 1567.0, + 1406.0, + 1610.0, + 293.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1601.0, + 726.0, + 1601.0, + 726.0, + 1637.0, + 321.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 515.0, + 1405.0, + 515.0, + 1405.0, + 551.0, + 294.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 543.0, + 1406.0, + 543.0, + 1406.0, + 584.0, + 320.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 577.0, + 1382.0, + 577.0, + 1382.0, + 613.0, + 323.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 609.0, + 505.0, + 609.0, + 505.0, + 639.0, + 324.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1287.0, + 1403.0, + 1287.0, + 1403.0, + 1320.0, + 297.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1316.0, + 1353.0, + 1316.0, + 1353.0, + 1351.0, + 322.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 344.0, + 1403.0, + 344.0, + 1403.0, + 380.0, + 295.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 377.0, + 1116.0, + 377.0, + 1116.0, + 409.0, + 324.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1483.0, + 1404.0, + 1483.0, + 1404.0, + 1521.0, + 295.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1516.0, + 1176.0, + 1516.0, + 1176.0, + 1551.0, + 321.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1653.0, + 1403.0, + 1653.0, + 1403.0, + 1691.0, + 293.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1684.0, + 1406.0, + 1684.0, + 1406.0, + 1725.0, + 321.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1716.0, + 494.0, + 1716.0, + 494.0, + 1751.0, + 323.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1366.0, + 1405.0, + 1366.0, + 1405.0, + 1409.0, + 293.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1400.0, + 1406.0, + 1400.0, + 1406.0, + 1437.0, + 321.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1432.0, + 478.0, + 1432.0, + 478.0, + 1463.0, + 325.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1769.0, + 1404.0, + 1769.0, + 1404.0, + 1808.0, + 293.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1801.0, + 952.0, + 1801.0, + 952.0, + 1837.0, + 322.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1968.0, + 1402.0, + 1968.0, + 1402.0, + 2008.0, + 295.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 2002.0, + 1320.0, + 2002.0, + 1320.0, + 2038.0, + 324.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1855.0, + 1403.0, + 1855.0, + 1403.0, + 1893.0, + 296.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1886.0, + 1405.0, + 1886.0, + 1405.0, + 1922.0, + 320.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1913.0, + 466.0, + 1913.0, + 466.0, + 1951.0, + 321.0, + 1951.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 105, + 299, + 105 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.826 + }, + { + "category_id": 1, + "poly": [ + 299, + 978, + 1399, + 978, + 1399, + 1044, + 299, + 1044 + ], + "score": 0.798 + }, + { + "category_id": 1, + "poly": [ + 299, + 896, + 1399, + 896, + 1399, + 961, + 299, + 961 + ], + "score": 0.792 + }, + { + "category_id": 1, + "poly": [ + 295, + 812, + 1402, + 812, + 1402, + 876, + 295, + 876 + ], + "score": 0.783 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1400, + 229, + 1400, + 323, + 298, + 323 + ], + "score": 0.764 + }, + { + "category_id": 1, + "poly": [ + 300, + 698, + 1401, + 698, + 1401, + 793, + 300, + 793 + ], + "score": 0.734 + }, + { + "category_id": 1, + "poly": [ + 297, + 1285, + 1399, + 1285, + 1399, + 1351, + 297, + 1351 + ], + "score": 0.727 + }, + { + "category_id": 1, + "poly": [ + 297, + 1366, + 1398, + 1366, + 1398, + 1433, + 297, + 1433 + ], + "score": 0.724 + }, + { + "category_id": 1, + "poly": [ + 296, + 1448, + 1398, + 1448, + 1398, + 1514, + 296, + 1514 + ], + "score": 0.716 + }, + { + "category_id": 1, + "poly": [ + 294, + 1530, + 1401, + 1530, + 1401, + 1597, + 294, + 1597 + ], + "score": 0.685 + }, + { + "category_id": 1, + "poly": [ + 300, + 1061, + 1401, + 1061, + 1401, + 1157, + 300, + 1157 + ], + "score": 0.681 + }, + { + "category_id": 1, + "poly": [ + 297, + 616, + 1402, + 616, + 1402, + 682, + 297, + 682 + ], + "score": 0.673 + }, + { + "category_id": 1, + "poly": [ + 296, + 1724, + 1395, + 1724, + 1395, + 1791, + 296, + 1791 + ], + "score": 0.671 + }, + { + "category_id": 1, + "poly": [ + 296, + 1806, + 1400, + 1806, + 1400, + 1872, + 296, + 1872 + ], + "score": 0.608 + }, + { + "category_id": 1, + "poly": [ + 297, + 1971, + 1398, + 1971, + 1398, + 2034, + 297, + 2034 + ], + "score": 0.602 + }, + { + "category_id": 1, + "poly": [ + 302, + 422, + 1400, + 422, + 1400, + 518, + 302, + 518 + ], + "score": 0.597 + }, + { + "category_id": 1, + "poly": [ + 294, + 536, + 1403, + 536, + 1403, + 600, + 294, + 600 + ], + "score": 0.59 + }, + { + "category_id": 1, + "poly": [ + 294, + 340, + 1402, + 340, + 1402, + 406, + 294, + 406 + ], + "score": 0.571 + }, + { + "category_id": 1, + "poly": [ + 297, + 1889, + 1400, + 1889, + 1400, + 1955, + 297, + 1955 + ], + "score": 0.57 + }, + { + "category_id": 1, + "poly": [ + 296, + 1613, + 1402, + 1613, + 1402, + 1708, + 296, + 1708 + ], + "score": 0.512 + }, + { + "category_id": 1, + "poly": [ + 299, + 1172, + 1404, + 1172, + 1404, + 1268, + 299, + 1268 + ], + "score": 0.152 + }, + { + "category_id": 13, + "poly": [ + 1342, + 1809, + 1371, + 1809, + 1371, + 1840, + 1342, + 1840 + ], + "score": 0.68, + "latex": "\\textsuperscript { \\textregistered }" + }, + { + "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, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 976.0, + 1404.0, + 976.0, + 1404.0, + 1019.0, + 293.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1008.0, + 789.0, + 1008.0, + 789.0, + 1045.0, + 324.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 892.0, + 1403.0, + 892.0, + 1403.0, + 935.0, + 293.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 928.0, + 504.0, + 928.0, + 504.0, + 962.0, + 325.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 812.0, + 1404.0, + 812.0, + 1404.0, + 848.0, + 295.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 843.0, + 820.0, + 843.0, + 820.0, + 877.0, + 323.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 225.0, + 1404.0, + 225.0, + 1404.0, + 268.0, + 293.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 260.0, + 1405.0, + 260.0, + 1405.0, + 295.0, + 321.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 291.0, + 463.0, + 291.0, + 463.0, + 322.0, + 324.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 698.0, + 1403.0, + 698.0, + 1403.0, + 736.0, + 294.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 728.0, + 1405.0, + 728.0, + 1405.0, + 769.0, + 321.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 756.0, + 398.0, + 756.0, + 398.0, + 797.0, + 321.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1288.0, + 1403.0, + 1288.0, + 1403.0, + 1321.0, + 297.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1317.0, + 1346.0, + 1317.0, + 1346.0, + 1353.0, + 323.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1367.0, + 1404.0, + 1367.0, + 1404.0, + 1403.0, + 295.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1398.0, + 1252.0, + 1398.0, + 1252.0, + 1433.0, + 322.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1445.0, + 1404.0, + 1445.0, + 1404.0, + 1488.0, + 292.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1477.0, + 399.0, + 1477.0, + 399.0, + 1516.0, + 319.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1531.0, + 1403.0, + 1531.0, + 1403.0, + 1567.0, + 296.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1562.0, + 1270.0, + 1562.0, + 1270.0, + 1600.0, + 322.0, + 1600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1062.0, + 1405.0, + 1062.0, + 1405.0, + 1097.0, + 296.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1093.0, + 1403.0, + 1093.0, + 1403.0, + 1127.0, + 324.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1124.0, + 1180.0, + 1124.0, + 1180.0, + 1158.0, + 324.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 613.0, + 1407.0, + 613.0, + 1407.0, + 654.0, + 292.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 645.0, + 400.0, + 645.0, + 400.0, + 684.0, + 319.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1725.0, + 1398.0, + 1725.0, + 1398.0, + 1761.0, + 297.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1756.0, + 1234.0, + 1756.0, + 1234.0, + 1791.0, + 321.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1805.0, + 1341.0, + 1805.0, + 1341.0, + 1845.0, + 294.0, + 1845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1372.0, + 1805.0, + 1406.0, + 1805.0, + 1406.0, + 1845.0, + 1372.0, + 1845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1839.0, + 771.0, + 1839.0, + 771.0, + 1871.0, + 322.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1968.0, + 1402.0, + 1968.0, + 1402.0, + 2009.0, + 295.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2001.0, + 775.0, + 2001.0, + 775.0, + 2036.0, + 323.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 422.0, + 1404.0, + 422.0, + 1404.0, + 460.0, + 297.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 454.0, + 1405.0, + 454.0, + 1405.0, + 490.0, + 321.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 485.0, + 1170.0, + 485.0, + 1170.0, + 521.0, + 322.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 536.0, + 1403.0, + 536.0, + 1403.0, + 572.0, + 297.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 568.0, + 1093.0, + 568.0, + 1093.0, + 601.0, + 322.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 341.0, + 1404.0, + 341.0, + 1404.0, + 377.0, + 296.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 373.0, + 1142.0, + 373.0, + 1142.0, + 407.0, + 322.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1886.0, + 1405.0, + 1886.0, + 1405.0, + 1927.0, + 292.0, + 1927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1921.0, + 1302.0, + 1921.0, + 1302.0, + 1956.0, + 323.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1614.0, + 1404.0, + 1614.0, + 1404.0, + 1648.0, + 295.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1645.0, + 1404.0, + 1645.0, + 1404.0, + 1679.0, + 323.0, + 1679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1674.0, + 1071.0, + 1674.0, + 1071.0, + 1709.0, + 321.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1167.0, + 1404.0, + 1167.0, + 1404.0, + 1215.0, + 293.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1204.0, + 1405.0, + 1204.0, + 1405.0, + 1242.0, + 323.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1236.0, + 829.0, + 1236.0, + 829.0, + 1270.0, + 324.0, + 1270.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.833 + }, + { + "category_id": 1, + "poly": [ + 298, + 622, + 1398, + 622, + 1398, + 686, + 298, + 686 + ], + "score": 0.775 + }, + { + "category_id": 1, + "poly": [ + 298, + 788, + 1399, + 788, + 1399, + 853, + 298, + 853 + ], + "score": 0.764 + }, + { + "category_id": 1, + "poly": [ + 298, + 704, + 1399, + 704, + 1399, + 769, + 298, + 769 + ], + "score": 0.757 + }, + { + "category_id": 1, + "poly": [ + 292, + 228, + 1402, + 228, + 1402, + 294, + 292, + 294 + ], + "score": 0.755 + }, + { + "category_id": 1, + "poly": [ + 303, + 508, + 1402, + 508, + 1402, + 602, + 303, + 602 + ], + "score": 0.75 + }, + { + "category_id": 1, + "poly": [ + 298, + 985, + 1401, + 985, + 1401, + 1050, + 298, + 1050 + ], + "score": 0.736 + }, + { + "category_id": 1, + "poly": [ + 294, + 425, + 1402, + 425, + 1402, + 490, + 294, + 490 + ], + "score": 0.703 + }, + { + "category_id": 1, + "poly": [ + 300, + 311, + 1399, + 311, + 1399, + 407, + 300, + 407 + ], + "score": 0.661 + }, + { + "category_id": 1, + "poly": [ + 300, + 1068, + 1403, + 1068, + 1403, + 1162, + 300, + 1162 + ], + "score": 0.638 + }, + { + "category_id": 1, + "poly": [ + 298, + 871, + 1405, + 871, + 1405, + 966, + 298, + 966 + ], + "score": 0.615 + }, + { + "category_id": 13, + "poly": [ + 661, + 790, + 700, + 790, + 700, + 822, + 661, + 822 + ], + "score": 0.87, + "latex": "Q ^ { \\star }" + }, + { + "category_id": 13, + "poly": [ + 975, + 657, + 994, + 657, + 994, + 680, + 975, + 680 + ], + "score": 0.5, + "latex": "{ . } = { }" + }, + { + "category_id": 13, + "poly": [ + 647, + 873, + 681, + 873, + 681, + 902, + 647, + 902 + ], + "score": 0.26, + "latex": "\\mathrm { Y u }" + }, + { + "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, + 2084.0, + 870.0, + 2084.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 617.0, + 1404.0, + 617.0, + 1404.0, + 662.0, + 294.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 651.0, + 974.0, + 651.0, + 974.0, + 689.0, + 323.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 651.0, + 1172.0, + 651.0, + 1172.0, + 689.0, + 995.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 788.0, + 660.0, + 788.0, + 660.0, + 824.0, + 297.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 788.0, + 1404.0, + 788.0, + 1404.0, + 824.0, + 701.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 819.0, + 1057.0, + 819.0, + 1057.0, + 854.0, + 323.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 706.0, + 1403.0, + 706.0, + 1403.0, + 742.0, + 296.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 737.0, + 721.0, + 737.0, + 721.0, + 771.0, + 320.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 226.0, + 1407.0, + 226.0, + 1407.0, + 269.0, + 292.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 261.0, + 831.0, + 261.0, + 831.0, + 293.0, + 324.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 510.0, + 1403.0, + 510.0, + 1403.0, + 544.0, + 298.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 540.0, + 1405.0, + 540.0, + 1405.0, + 574.0, + 322.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 567.0, + 399.0, + 567.0, + 399.0, + 604.0, + 320.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 985.0, + 1406.0, + 985.0, + 1406.0, + 1021.0, + 296.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1016.0, + 1166.0, + 1016.0, + 1166.0, + 1050.0, + 322.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 427.0, + 1404.0, + 427.0, + 1404.0, + 463.0, + 296.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 458.0, + 1275.0, + 458.0, + 1275.0, + 491.0, + 321.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 311.0, + 1405.0, + 311.0, + 1405.0, + 350.0, + 291.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 344.0, + 1404.0, + 344.0, + 1404.0, + 379.0, + 321.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 375.0, + 1149.0, + 375.0, + 1149.0, + 409.0, + 324.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1065.0, + 1404.0, + 1065.0, + 1404.0, + 1105.0, + 294.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1097.0, + 1404.0, + 1097.0, + 1404.0, + 1137.0, + 320.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1130.0, + 676.0, + 1130.0, + 676.0, + 1164.0, + 323.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 870.0, + 646.0, + 870.0, + 646.0, + 908.0, + 293.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 870.0, + 1403.0, + 870.0, + 1403.0, + 908.0, + 682.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 904.0, + 1403.0, + 904.0, + 1403.0, + 938.0, + 323.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 933.0, + 802.0, + 933.0, + 802.0, + 967.0, + 323.0, + 967.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1406, + 1404, + 1406, + 1404, + 1531, + 297, + 1531 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 777, + 1405, + 777, + 1405, + 897, + 297, + 897 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 296, + 1642, + 1406, + 1642, + 1406, + 1835, + 296, + 1835 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 1093, + 1406, + 1093, + 1406, + 1219, + 296, + 1219 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1297, + 1404, + 1297, + 1404, + 1393, + 297, + 1393 + ], + "score": 0.971 + }, + { + "category_id": 8, + "poly": [ + 549, + 611, + 1146, + 611, + 1146, + 707, + 549, + 707 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 295, + 1846, + 1402, + 1846, + 1402, + 1911, + 295, + 1911 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 295, + 1917, + 1397, + 1917, + 1397, + 1984, + 295, + 1984 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 719, + 1998, + 978, + 1998, + 978, + 2039, + 719, + 2039 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 671, + 1230, + 1028, + 1230, + 1028, + 1273, + 671, + 1273 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 295, + 722, + 913, + 722, + 913, + 762, + 295, + 762 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 298, + 293, + 1402, + 293, + 1402, + 359, + 298, + 359 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 296, + 1051, + 1034, + 1051, + 1034, + 1086, + 296, + 1086 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 298, + 442, + 575, + 442, + 575, + 475, + 298, + 475 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 299, + 562, + 557, + 562, + 557, + 595, + 299, + 595 + ], + "score": 0.922 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 301, + 1574, + 748, + 1574, + 748, + 1610, + 301, + 1610 + ], + "score": 0.915 + }, + { + "category_id": 0, + "poly": [ + 300, + 983, + 680, + 983, + 680, + 1020, + 300, + 1020 + ], + "score": 0.914 + }, + { + "category_id": 0, + "poly": [ + 300, + 225, + 678, + 225, + 678, + 262, + 300, + 262 + ], + "score": 0.912 + }, + { + "category_id": 8, + "poly": [ + 322, + 368, + 1370, + 368, + 1370, + 417, + 322, + 417 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.873 + }, + { + "category_id": 8, + "poly": [ + 294, + 488, + 1396, + 488, + 1396, + 537, + 294, + 537 + ], + "score": 0.872 + }, + { + "category_id": 2, + "poly": [ + 1374, + 909, + 1403, + 909, + 1403, + 938, + 1374, + 938 + ], + "score": 0.796 + }, + { + "category_id": 13, + "poly": [ + 1174, + 776, + 1259, + 776, + 1259, + 814, + 1174, + 814 + ], + "score": 0.93, + "latex": "c \\in [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 1061, + 816, + 1290, + 816, + 1290, + 859, + 1061, + 859 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\theta _ { H } ^ { \\pi } = \\sum _ { c = 1 } ^ { d } r _ { 0 } \\cdot e _ { c } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1107, + 1703, + 1210, + 1703, + 1210, + 1740, + 1107, + 1740 + ], + "score": 0.93, + "latex": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }" + }, + { + "category_id": 13, + "poly": [ + 493, + 445, + 565, + 445, + 565, + 472, + 493, + 472 + ], + "score": 0.93, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 14, + "poly": [ + 551, + 607, + 1146, + 607, + 1146, + 707, + 551, + 707 + ], + "score": 0.93, + "latex": "\\boldsymbol { \\theta } _ { h } ^ { \\pi } = \\sum _ { c = 1 } ^ { \\hat { d } } \\boldsymbol { r } _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } \\cdot \\boldsymbol { e } _ { c } + \\sum _ { c = 1 } ^ { \\hat { d } } Q _ { h } ^ { \\pi } ( s _ { h } ^ { c } , a _ { 2 } ) \\cdot \\boldsymbol { e } _ { c + \\hat { d } } ," + }, + { + "category_id": 13, + "poly": [ + 352, + 721, + 641, + 721, + 641, + 762, + 352, + 762 + ], + "score": 0.93, + "latex": "Q _ { h } ^ { \\pi } ( s , a ) = \\left( \\theta _ { h } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )" + }, + { + "category_id": 13, + "poly": [ + 554, + 812, + 839, + 812, + 839, + 857, + 554, + 857 + ], + "score": 0.92, + "latex": "Q _ { H } ^ { \\pi } ( s _ { H } ^ { \\hat { d } + 1 } , a ) = r _ { 0 } \\cdot \\sqrt { \\hat { d } }" + }, + { + "category_id": 13, + "poly": [ + 1096, + 291, + 1353, + 291, + 1353, + 330, + 1096, + 330 + ], + "score": 0.92, + "latex": "( h , c ) \\in [ H - 1 ] \\times [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 836, + 1127, + 994, + 1127, + 994, + 1158, + 836, + 1158 + ], + "score": 0.92, + "latex": "\\xi _ { 1 } , \\xi _ { 2 } , \\ldots , \\xi _ { m }" + }, + { + "category_id": 13, + "poly": [ + 1235, + 1094, + 1353, + 1094, + 1353, + 1127, + 1235, + 1127 + ], + "score": 0.92, + "latex": "\\alpha _ { - } = 1 / 2" + }, + { + "category_id": 13, + "poly": [ + 679, + 1436, + 877, + 1436, + 877, + 1471, + 679, + 1471 + ], + "score": 0.92, + "latex": "\\dot { \\Omega ( 1 / \\varepsilon ^ { 2 } \\log ( 1 / \\delta ) ) }" + }, + { + "category_id": 13, + "poly": [ + 738, + 1156, + 822, + 1156, + 822, + 1189, + 738, + 1189 + ], + "score": 0.92, + "latex": "i \\in [ m ]" + }, + { + "category_id": 13, + "poly": [ + 1037, + 1094, + 1150, + 1094, + 1150, + 1127, + 1037, + 1127 + ], + "score": 0.92, + "latex": "\\{ \\alpha _ { + } , \\alpha _ { - } \\}" + }, + { + "category_id": 13, + "poly": [ + 664, + 1951, + 835, + 1951, + 835, + 1984, + 664, + 1984 + ], + "score": 0.91, + "latex": "( s , a ) \\in S \\times A" + }, + { + "category_id": 13, + "poly": [ + 298, + 1949, + 476, + 1949, + 476, + 1982, + 298, + 1982 + ], + "score": 0.91, + "latex": "\\theta _ { 1 } , \\ldots \\theta _ { H } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1125, + 472, + 1125, + 472, + 1158, + 297, + 1158 + ], + "score": 0.91, + "latex": "\\alpha _ { + } = 1 / 2 + \\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 378, + 1801, + 471, + 1801, + 471, + 1835, + 378, + 1835 + ], + "score": 0.91, + "latex": "d / 2 - 1" + }, + { + "category_id": 13, + "poly": [ + 297, + 856, + 597, + 856, + 597, + 896, + 297, + 896 + ], + "score": 0.91, + "latex": "Q _ { H } ^ { \\pi } ( s , a ) = \\left( \\theta _ { H } ^ { \\pi } \\right) ^ { \\top } \\phi ( s , a )" + }, + { + "category_id": 13, + "poly": [ + 888, + 1951, + 979, + 1951, + 979, + 1984, + 888, + 1984 + ], + "score": 0.91, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 1279, + 1156, + 1392, + 1156, + 1392, + 1189, + 1279, + 1189 + ], + "score": 0.9, + "latex": "\\{ \\alpha _ { + } , \\alpha _ { - } \\}" + }, + { + "category_id": 13, + "poly": [ + 721, + 725, + 905, + 725, + 905, + 761, + 721, + 761 + ], + "score": 0.9, + "latex": "( s , a ) \\in S _ { h } \\times \\mathcal { A }" + }, + { + "category_id": 14, + "poly": [ + 326, + 366, + 1370, + 366, + 1370, + 416, + 326, + 416 + ], + "score": 0.9, + "latex": "Q _ { h } ^ { \\pi } ( s _ { h } ^ { c } , a _ { 1 } ) = R ( s _ { h } ^ { c } , a _ { 1 } ) + R ( s _ { h + 1 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + \\ldots + R ( s _ { H } ^ { \\hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } ." + }, + { + "category_id": 14, + "poly": [ + 310, + 486, + 1400, + 486, + 1400, + 537, + 310, + 537 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathcal { Q } _ { h } ^ { \\pi } ( s _ { h } ^ { \\hat { d } + 1 } , a ) = R ( s _ { h } ^ { \\hat { d } + 1 } , a ) + R ( s _ { h + 1 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + R ( s _ { h + 2 } ^ { \\hat { d } + 1 } , a _ { 1 } ) + . . . + R ( s _ { H } ^ { \\hat { d } + 1 } , a _ { 1 } ) = r _ { 0 } \\cdot \\hat { d } ^ { ( H - h + 1 ) / 2 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 720, + 1996, + 976, + 1996, + 976, + 2038, + 720, + 2038 + ], + "score": 0.9, + "latex": "Q _ { h } ^ { \\pi } ( s , a ) = \\theta _ { h } ^ { \\top } \\phi ( s , a ) ." + }, + { + "category_id": 13, + "poly": [ + 841, + 1919, + 1057, + 1919, + 1057, + 1951, + 841, + 1951 + ], + "score": 0.9, + "latex": "\\pi : { \\mathcal { S } } \\to \\Delta ( { \\mathcal { A } } )" + }, + { + "category_id": 13, + "poly": [ + 1110, + 1127, + 1222, + 1127, + 1222, + 1157, + 1110, + 1157 + ], + "score": 0.9, + "latex": "\\{ + 1 , - 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 298, + 821, + 497, + 821, + 497, + 857, + 298, + 857 + ], + "score": 0.9, + "latex": "Q _ { H } ^ { \\pi } ( s _ { H } ^ { c } , a ) = r _ { 0 }" + }, + { + "category_id": 14, + "poly": [ + 670, + 1231, + 1027, + 1231, + 1027, + 1270, + 670, + 1270 + ], + "score": 0.9, + "latex": "\\operatorname* { P r } [ f ( \\xi _ { 1 } , \\xi _ { 2 } , \\ldots , \\xi _ { m } ) \\neq \\alpha ] > \\delta ." + }, + { + "category_id": 13, + "poly": [ + 549, + 297, + 588, + 297, + 588, + 329, + 549, + 329 + ], + "score": 0.89, + "latex": "Q ^ { \\pi }" + }, + { + "category_id": 13, + "poly": [ + 677, + 861, + 868, + 861, + 868, + 895, + 677, + 895 + ], + "score": 0.89, + "latex": "( s , a ) \\in { \\cal S } _ { H } \\times \\mathcal { A }" + }, + { + "category_id": 13, + "poly": [ + 463, + 1156, + 660, + 1156, + 660, + 1188, + 463, + 1188 + ], + "score": 0.89, + "latex": "\\operatorname* { P r } [ \\xi _ { i } = + 1 ] = \\alpha" + }, + { + "category_id": 13, + "poly": [ + 1313, + 780, + 1393, + 780, + 1393, + 810, + 1313, + 810 + ], + "score": 0.89, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 533, + 1126, + 664, + 1126, + 664, + 1154, + 533, + 1154 + ], + "score": 0.89, + "latex": "0 < \\varepsilon < 1" + }, + { + "category_id": 13, + "poly": [ + 397, + 1188, + 626, + 1188, + 626, + 1220, + 397, + 1220 + ], + "score": 0.87, + "latex": "m \\le C / \\varepsilon ^ { 2 } \\log ( 1 / \\delta )" + }, + { + "category_id": 13, + "poly": [ + 1112, + 1156, + 1245, + 1156, + 1245, + 1189, + 1112, + 1189 + ], + "score": 0.87, + "latex": "\\bar { \\{ + 1 , - 1 \\} } ^ { m }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1469, + 363, + 1469, + 363, + 1498, + 297, + 1498 + ], + "score": 0.86, + "latex": "1 - \\delta" + }, + { + "category_id": 13, + "poly": [ + 825, + 297, + 903, + 297, + 903, + 326, + 825, + 326 + ], + "score": 0.86, + "latex": "H - 1" + }, + { + "category_id": 13, + "poly": [ + 436, + 1739, + 499, + 1739, + 499, + 1767, + 436, + 1767 + ], + "score": 0.86, + "latex": "\\pi _ { \\mathrm { d a t a } }" + }, + { + "category_id": 13, + "poly": [ + 567, + 782, + 591, + 782, + 591, + 812, + 567, + 812 + ], + "score": 0.85, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 1354, + 1766, + 1374, + 1766, + 1374, + 1798, + 1354, + 1798 + ], + "score": 0.84, + "latex": "\\hat { d }" + }, + { + "category_id": 13, + "poly": [ + 879, + 1158, + 898, + 1158, + 898, + 1187, + 879, + 1187 + ], + "score": 0.83, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 892, + 1189, + 914, + 1189, + 914, + 1214, + 892, + 1214 + ], + "score": 0.81, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 875, + 1771, + 893, + 1771, + 893, + 1798, + 875, + 1798 + ], + "score": 0.79, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1194, + 1443, + 1215, + 1443, + 1215, + 1465, + 1194, + 1465 + ], + "score": 0.79, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 297, + 1771, + 316, + 1771, + 316, + 1798, + 297, + 1798 + ], + "score": 0.76, + "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": [ + 293.0, + 1570.0, + 753.0, + 1570.0, + 753.0, + 1616.0, + 293.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 981.0, + 683.0, + 981.0, + 683.0, + 1024.0, + 293.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 223.0, + 679.0, + 223.0, + 679.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 871.0, + 2085.0, + 871.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 913.0, + 1403.0, + 913.0, + 1403.0, + 940.0, + 1377.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1408.0, + 1404.0, + 1408.0, + 1404.0, + 1440.0, + 296.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1437.0, + 678.0, + 1437.0, + 678.0, + 1473.0, + 294.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 878.0, + 1437.0, + 1193.0, + 1437.0, + 1193.0, + 1473.0, + 878.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1437.0, + 1404.0, + 1437.0, + 1404.0, + 1473.0, + 1216.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1466.0, + 296.0, + 1466.0, + 296.0, + 1506.0, + 292.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 1466.0, + 1406.0, + 1466.0, + 1406.0, + 1506.0, + 364.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1499.0, + 759.0, + 1499.0, + 759.0, + 1532.0, + 296.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 774.0, + 566.0, + 774.0, + 566.0, + 816.0, + 294.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 774.0, + 1173.0, + 774.0, + 1173.0, + 816.0, + 592.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 774.0, + 1312.0, + 774.0, + 1312.0, + 816.0, + 1260.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 774.0, + 1405.0, + 774.0, + 1405.0, + 816.0, + 1394.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 800.0, + 297.0, + 800.0, + 297.0, + 873.0, + 287.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 800.0, + 553.0, + 800.0, + 553.0, + 873.0, + 498.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 800.0, + 1060.0, + 800.0, + 1060.0, + 873.0, + 840.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 800.0, + 1413.0, + 800.0, + 1413.0, + 873.0, + 1291.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 856.0, + 296.0, + 856.0, + 296.0, + 897.0, + 293.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 856.0, + 676.0, + 856.0, + 676.0, + 897.0, + 598.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 856.0, + 880.0, + 856.0, + 880.0, + 897.0, + 869.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1644.0, + 1404.0, + 1644.0, + 1404.0, + 1677.0, + 295.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1676.0, + 1404.0, + 1676.0, + 1404.0, + 1708.0, + 295.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1697.0, + 1106.0, + 1697.0, + 1106.0, + 1750.0, + 289.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 1697.0, + 1411.0, + 1697.0, + 1411.0, + 1750.0, + 1211.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1731.0, + 435.0, + 1731.0, + 435.0, + 1774.0, + 291.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 1731.0, + 1407.0, + 1731.0, + 1407.0, + 1774.0, + 500.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1769.0, + 874.0, + 1769.0, + 874.0, + 1805.0, + 317.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1769.0, + 1353.0, + 1769.0, + 1353.0, + 1805.0, + 894.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 1769.0, + 1404.0, + 1769.0, + 1404.0, + 1805.0, + 1375.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1801.0, + 377.0, + 1801.0, + 377.0, + 1835.0, + 295.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 1801.0, + 483.0, + 1801.0, + 483.0, + 1835.0, + 472.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1092.0, + 1036.0, + 1092.0, + 1036.0, + 1129.0, + 294.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 1092.0, + 1234.0, + 1092.0, + 1234.0, + 1129.0, + 1151.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1092.0, + 1407.0, + 1092.0, + 1407.0, + 1129.0, + 1354.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 473.0, + 1123.0, + 532.0, + 1123.0, + 532.0, + 1163.0, + 473.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 1123.0, + 835.0, + 1123.0, + 835.0, + 1163.0, + 665.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 1123.0, + 1109.0, + 1123.0, + 1109.0, + 1163.0, + 995.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1123.0, + 1407.0, + 1123.0, + 1407.0, + 1163.0, + 1223.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1155.0, + 462.0, + 1155.0, + 462.0, + 1191.0, + 295.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 1155.0, + 737.0, + 1155.0, + 737.0, + 1191.0, + 661.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1155.0, + 878.0, + 1155.0, + 878.0, + 1191.0, + 823.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 1155.0, + 1111.0, + 1155.0, + 1111.0, + 1191.0, + 899.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 1155.0, + 1278.0, + 1155.0, + 1278.0, + 1191.0, + 1246.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1155.0, + 1404.0, + 1155.0, + 1404.0, + 1191.0, + 1393.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1185.0, + 396.0, + 1185.0, + 396.0, + 1222.0, + 295.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1185.0, + 891.0, + 1185.0, + 891.0, + 1222.0, + 627.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1185.0, + 993.0, + 1185.0, + 993.0, + 1222.0, + 915.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1295.0, + 1404.0, + 1295.0, + 1404.0, + 1336.0, + 292.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1329.0, + 1406.0, + 1329.0, + 1406.0, + 1367.0, + 294.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1358.0, + 710.0, + 1358.0, + 710.0, + 1394.0, + 294.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1845.0, + 1405.0, + 1845.0, + 1405.0, + 1885.0, + 293.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1877.0, + 437.0, + 1877.0, + 437.0, + 1913.0, + 291.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1915.0, + 840.0, + 1915.0, + 840.0, + 1956.0, + 295.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 1915.0, + 1403.0, + 1915.0, + 1403.0, + 1956.0, + 1058.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1947.0, + 297.0, + 1947.0, + 297.0, + 1987.0, + 294.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 1947.0, + 663.0, + 1947.0, + 663.0, + 1987.0, + 477.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1947.0, + 887.0, + 1947.0, + 887.0, + 1987.0, + 836.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1947.0, + 991.0, + 1947.0, + 991.0, + 1987.0, + 980.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 717.0, + 351.0, + 717.0, + 351.0, + 768.0, + 293.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 717.0, + 720.0, + 717.0, + 720.0, + 768.0, + 642.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 717.0, + 917.0, + 717.0, + 917.0, + 768.0, + 906.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 290.0, + 548.0, + 290.0, + 548.0, + 334.0, + 292.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 290.0, + 824.0, + 290.0, + 824.0, + 334.0, + 589.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 290.0, + 1095.0, + 290.0, + 1095.0, + 334.0, + 904.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 290.0, + 1407.0, + 290.0, + 1407.0, + 334.0, + 1354.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 319.0, + 362.0, + 319.0, + 362.0, + 365.0, + 290.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1052.0, + 1036.0, + 1052.0, + 1036.0, + 1089.0, + 297.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 438.0, + 492.0, + 438.0, + 492.0, + 479.0, + 294.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 438.0, + 577.0, + 438.0, + 577.0, + 479.0, + 566.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 561.0, + 558.0, + 561.0, + 558.0, + 597.0, + 296.0, + 597.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1520, + 1404, + 1520, + 1404, + 1630, + 296, + 1630 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 1915, + 1407, + 1915, + 1407, + 2041, + 296, + 2041 + ], + "score": 0.971 + }, + { + "category_id": 3, + "poly": [ + 303, + 228, + 1405, + 228, + 1405, + 1044, + 303, + 1044 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 572, + 1730, + 1116, + 1730, + 1116, + 1896, + 572, + 1896 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 299, + 1643, + 1403, + 1643, + 1403, + 1710, + 299, + 1710 + ], + "score": 0.939 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 812, + 75, + 812, + 104, + 299, + 104 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2114, + 836, + 2114 + ], + "score": 0.865 + }, + { + "category_id": 4, + "poly": [ + 295, + 1112, + 1406, + 1112, + 1406, + 1457, + 295, + 1457 + ], + "score": 0.809 + }, + { + "category_id": 1, + "poly": [ + 295, + 1112, + 1406, + 1112, + 1406, + 1457, + 295, + 1457 + ], + "score": 0.213 + }, + { + "category_id": 14, + "poly": [ + 571, + 1728, + 1121, + 1728, + 1121, + 1895, + 571, + 1895 + ], + "score": 0.93, + "latex": "P ( s _ { 1 } , a ) = \\left\\{ \\begin{array} { l l } { s _ { 2 } ^ { c } } & { a = a _ { c } , c \\in [ \\hat { d } ] } \\\\ { s _ { 2 } ^ { + } } & { a = a _ { \\hat { d } + 1 } } \\\\ { s _ { 2 } ^ { - } } & { a = a _ { \\hat { d } + 2 } } \\\\ { s _ { 2 } ^ { \\hat { d } + 1 } } & { a \\in \\{ a _ { \\hat { d } + 3 } , a _ { \\hat { d } + 4 } , \\dots , a _ { d } \\} } \\end{array} \\right. ." + }, + { + "category_id": 13, + "poly": [ + 428, + 1953, + 509, + 1953, + 509, + 1993, + 428, + 1993 + ], + "score": 0.93, + "latex": "c \\in [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 594, + 1998, + 671, + 1998, + 671, + 2036, + 594, + 2036 + ], + "score": 0.93, + "latex": "c \\in [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 778, + 1995, + 1008, + 1995, + 1008, + 2039, + 778, + 2039 + ], + "score": 0.93, + "latex": "P ( s _ { h } ^ { \\hat { d } + 1 } , a _ { c } ) = s _ { h + 1 } ^ { c }" + }, + { + "category_id": 13, + "poly": [ + 943, + 1112, + 1090, + 1112, + 1090, + 1151, + 943, + 1151 + ], + "score": 0.92, + "latex": "\\hat { d } = d / 2 - 1" + }, + { + "category_id": 13, + "poly": [ + 820, + 1273, + 1064, + 1273, + 1064, + 1315, + 820, + 1315 + ], + "score": 0.92, + "latex": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } , s _ { h } ^ { + } , s _ { h } ^ { - }" + }, + { + "category_id": 13, + "poly": [ + 297, + 2001, + 545, + 2001, + 545, + 2036, + 297, + 2036 + ], + "score": 0.92, + "latex": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}" + }, + { + "category_id": 13, + "poly": [ + 501, + 1417, + 685, + 1417, + 685, + 1453, + 501, + 1453 + ], + "score": 0.92, + "latex": "r _ { 0 } = \\hat { d } ^ { - ( \\bar { H } - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1085, + 1957, + 1285, + 1957, + 1285, + 1996, + 1085, + 1996 + ], + "score": 0.92, + "latex": "P ( s _ { h } ^ { - } , a ) = s _ { h + 1 } ^ { - }" + }, + { + "category_id": 13, + "poly": [ + 1098, + 2000, + 1393, + 2000, + 1393, + 2040, + 1098, + 2040 + ], + "score": 0.92, + "latex": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}" + }, + { + "category_id": 13, + "poly": [ + 888, + 1314, + 944, + 1314, + 944, + 1357, + 888, + 1357 + ], + "score": 0.92, + "latex": "s _ { h } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1145, + 1918, + 1393, + 1918, + 1393, + 1952, + 1145, + 1952 + ], + "score": 0.92, + "latex": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}" + }, + { + "category_id": 13, + "poly": [ + 341, + 1642, + 576, + 1642, + 576, + 1679, + 341, + 1679 + ], + "score": 0.92, + "latex": "0 \\leq r _ { 0 } \\leq \\hat { d } ^ { - ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 784, + 1918, + 1031, + 1918, + 1031, + 1952, + 784, + 1952 + ], + "score": 0.92, + "latex": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}" + }, + { + "category_id": 13, + "poly": [ + 299, + 1553, + 484, + 1553, + 484, + 1587, + 299, + 1587 + ], + "score": 0.91, + "latex": "\\{ a _ { 1 } , a _ { 2 } , \\ldots , a _ { d } \\}" + }, + { + "category_id": 13, + "poly": [ + 595, + 1244, + 755, + 1244, + 755, + 1275, + 595, + 1275 + ], + "score": 0.91, + "latex": "a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } }" + }, + { + "category_id": 13, + "poly": [ + 959, + 1417, + 1187, + 1417, + 1187, + 1453, + 959, + 1453 + ], + "score": 0.9, + "latex": "s = r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 } = 1" + }, + { + "category_id": 13, + "poly": [ + 298, + 1588, + 363, + 1588, + 363, + 1623, + 298, + 1623 + ], + "score": 0.9, + "latex": "{ \\hat { d } } + 3" + }, + { + "category_id": 13, + "poly": [ + 1139, + 1389, + 1218, + 1389, + 1218, + 1418, + 1139, + 1418 + ], + "score": 0.9, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 623, + 1951, + 817, + 1951, + 817, + 1996, + 623, + 1996 + ], + "score": 0.9, + "latex": "P ( s _ { h } ^ { c } , a ) = s _ { h + 1 } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1054, + 1184, + 1213, + 1184, + 1213, + 1213, + 1054, + 1213 + ], + "score": 0.89, + "latex": "a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1959, + 375, + 1959, + 375, + 1989, + 297, + 1989 + ], + "score": 0.89, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 832, + 1956, + 1031, + 1956, + 1031, + 1996, + 832, + 1996 + ], + "score": 0.89, + "latex": "P ( s _ { h } ^ { + } , a ) = s _ { h + 1 } ^ { + }" + }, + { + "category_id": 13, + "poly": [ + 417, + 1279, + 516, + 1279, + 516, + 1314, + 417, + 1314 + ], + "score": 0.88, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 1020, + 1217, + 1235, + 1217, + 1235, + 1247, + 1020, + 1247 + ], + "score": 0.88, + "latex": "a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d }" + }, + { + "category_id": 13, + "poly": [ + 731, + 1555, + 764, + 1555, + 764, + 1584, + 731, + 1584 + ], + "score": 0.88, + "latex": "S _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 754, + 1591, + 788, + 1591, + 788, + 1629, + 754, + 1629 + ], + "score": 0.87, + "latex": "s _ { h } ^ { - }" + }, + { + "category_id": 13, + "poly": [ + 722, + 1354, + 760, + 1354, + 760, + 1391, + 722, + 1391 + ], + "score": 0.87, + "latex": "\\cdot s _ { H } ^ { + }" + }, + { + "category_id": 13, + "poly": [ + 810, + 1355, + 847, + 1355, + 847, + 1391, + 810, + 1391 + ], + "score": 0.87, + "latex": "s _ { H } ^ { - }" + }, + { + "category_id": 13, + "poly": [ + 820, + 1394, + 851, + 1394, + 851, + 1418, + 820, + 1418 + ], + "score": 0.86, + "latex": "\\mathit { a } _ { d }" + }, + { + "category_id": 13, + "poly": [ + 491, + 1149, + 576, + 1149, + 576, + 1179, + 491, + 1179 + ], + "score": 0.85, + "latex": "( h = 1 )" + }, + { + "category_id": 13, + "poly": [ + 1201, + 1149, + 1294, + 1149, + 1294, + 1179, + 1201, + 1179 + ], + "score": 0.85, + "latex": "h = H" + }, + { + "category_id": 13, + "poly": [ + 602, + 1322, + 627, + 1322, + 627, + 1353, + 602, + 1353 + ], + "score": 0.85, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 1025, + 1558, + 1053, + 1558, + 1053, + 1584, + 1025, + 1584 + ], + "score": 0.84, + "latex": "s _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1342, + 1523, + 1404, + 1523, + 1404, + 1553, + 1342, + 1553 + ], + "score": 0.84, + "latex": "{ \\mathcal { A } } =" + }, + { + "category_id": 13, + "poly": [ + 1177, + 1554, + 1253, + 1554, + 1253, + 1584, + 1177, + 1584 + ], + "score": 0.81, + "latex": "h \\geq 2" + }, + { + "category_id": 13, + "poly": [ + 435, + 1585, + 704, + 1585, + 704, + 1629, + 435, + 1629 + ], + "score": 0.8, + "latex": "s _ { h } ^ { 1 } , s _ { h } ^ { 2 } , \\ldots , s _ { h } ^ { \\hat { d } } , s _ { h } ^ { \\hat { d } + 1 } , s _ { h } ^ { + }" + }, + { + "category_id": 13, + "poly": [ + 590, + 1555, + 609, + 1555, + 609, + 1581, + 590, + 1581 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 530, + 1280, + 555, + 1280, + 555, + 1313, + 530, + 1313 + ], + "score": 0.73, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 1265, + 1554, + 1300, + 1554, + 1300, + 1585, + 1265, + 1585 + ], + "score": 0.71, + "latex": "S _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1066, + 532, + 1101, + 532, + 1101, + 556, + 1066, + 556 + ], + "score": 0.7, + "latex": "s _ { 2 } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1125, + 532, + 1388, + 532, + 1388, + 553, + 1125, + 553 + ], + "score": 0.69, + "latex": "P ( s _ { 3 } ^ { - } \\mid s _ { 2 } ^ { d + 1 } , a _ { d } ) = ( 1 - r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 } ) / 2" + }, + { + "category_id": 13, + "poly": [ + 1127, + 555, + 1301, + 555, + 1301, + 576, + 1127, + 576 + ], + "score": 0.66, + "latex": "Q \\left( s _ { 2 } ^ { d + 1 } , a _ { d } \\right) = r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1065, + 837, + 1100, + 837, + 1100, + 861, + 1065, + 861 + ], + "score": 0.59, + "latex": "s _ { H - 1 } ^ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1127, + 508, + 1388, + 508, + 1388, + 529, + 1127, + 529 + ], + "score": 0.58, + "latex": "P ( s _ { 3 } ^ { + } \\mid s _ { 2 } ^ { \\dot { d } + 1 } , a _ { d } ) = ( 1 + r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 } ) / 2" + }, + { + "category_id": 13, + "poly": [ + 317, + 379, + 474, + 379, + 474, + 398, + 317, + 398 + ], + "score": 0.48, + "latex": "Q ( s _ { 1 } , a _ { d } ) = r _ { 0 } \\hat { d } ^ { ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 1127, + 701, + 1306, + 701, + 1306, + 729, + 1127, + 729 + ], + "score": 0.44, + "latex": "Q \\left( s _ { h } ^ { \\hat { d } + 1 } , a _ { d } \\right) = r _ { 0 } \\hat { d } ^ { ( H - h ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 315, + 821, + 424, + 821, + 424, + 838, + 315, + 838 + ], + "score": 0.42, + "latex": "Q ( s _ { H - 1 } ^ { c } , a ) = r _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1127, + 860, + 1274, + 860, + 1274, + 881, + 1127, + 881 + ], + "score": 0.38, + "latex": "Q \\left( s _ { H - 1 } ^ { d + 1 } , a _ { d } \\right) = r _ { 0 } \\hat { d } ^ { 1 / 2 }" + }, + { + "category_id": 13, + "poly": [ + 668, + 1586, + 704, + 1586, + 704, + 1629, + 668, + 1629 + ], + "score": 0.29, + "latex": "s _ { h } ^ { + }" + }, + { + "category_id": 13, + "poly": [ + 1126, + 654, + 1403, + 654, + 1403, + 677, + 1126, + 677 + ], + "score": 0.26, + "latex": "P ( s _ { h + 1 } ^ { + } \\mid s _ { h } ^ { \\hat { d } + 1 } , a _ { d } ) = ( 1 + r _ { 0 } \\hat { d } ^ { ( H - h ) / 2 } ) / 2" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 244.0, + 988.0, + 244.0, + 988.0, + 277.0, + 850.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 266.0, + 1022.0, + 266.0, + 1022.0, + 299.0, + 872.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 370.0, + 316.0, + 370.0, + 316.0, + 399.0, + 310.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 475.0, + 370.0, + 480.0, + 370.0, + 480.0, + 399.0, + 475.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 499.0, + 1126.0, + 499.0, + 1126.0, + 535.0, + 1118.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1389.0, + 499.0, + 1397.0, + 499.0, + 1397.0, + 535.0, + 1389.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 530.0, + 559.0, + 530.0, + 559.0, + 558.0, + 532.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 530.0, + 635.0, + 530.0, + 635.0, + 555.0, + 609.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 528.0, + 776.0, + 528.0, + 776.0, + 559.0, + 746.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 531.0, + 879.0, + 531.0, + 879.0, + 556.0, + 853.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 534.0, + 975.0, + 534.0, + 975.0, + 559.0, + 948.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 522.0, + 1065.0, + 522.0, + 1065.0, + 564.0, + 1058.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.0, + 522.0, + 1111.0, + 522.0, + 1111.0, + 564.0, + 1102.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 520.0, + 1124.0, + 520.0, + 1124.0, + 560.0, + 1118.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1389.0, + 520.0, + 1399.0, + 520.0, + 1399.0, + 560.0, + 1389.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 544.0, + 1126.0, + 544.0, + 1126.0, + 580.0, + 1119.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1302.0, + 544.0, + 1312.0, + 544.0, + 1312.0, + 580.0, + 1302.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 645.0, + 1125.0, + 645.0, + 1125.0, + 681.0, + 1117.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 645.0, + 1411.0, + 645.0, + 1411.0, + 681.0, + 1404.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 666.0, + 1414.0, + 666.0, + 1414.0, + 709.0, + 1116.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 721.0, + 1068.0, + 721.0, + 1068.0, + 733.0, + 1036.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 691.0, + 1126.0, + 691.0, + 1126.0, + 731.0, + 1118.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 691.0, + 1317.0, + 691.0, + 1317.0, + 731.0, + 1307.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 807.0, + 314.0, + 807.0, + 314.0, + 844.0, + 309.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 807.0, + 432.0, + 807.0, + 432.0, + 844.0, + 425.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 807.0, + 1367.0, + 807.0, + 1367.0, + 838.0, + 1121.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 829.0, + 521.0, + 829.0, + 521.0, + 883.0, + 304.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 841.0, + 547.0, + 841.0, + 547.0, + 858.0, + 530.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 834.0, + 642.0, + 834.0, + 642.0, + 861.0, + 601.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 841.0, + 868.0, + 841.0, + 868.0, + 855.0, + 850.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 836.0, + 982.0, + 836.0, + 982.0, + 863.0, + 939.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 828.0, + 1064.0, + 828.0, + 1064.0, + 866.0, + 1059.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 828.0, + 1104.0, + 828.0, + 1104.0, + 866.0, + 1101.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 826.0, + 1126.0, + 826.0, + 1126.0, + 886.0, + 1118.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 826.0, + 1370.0, + 826.0, + 1370.0, + 886.0, + 1275.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 955.0, + 418.0, + 955.0, + 418.0, + 1005.0, + 305.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 982.0, + 553.0, + 982.0, + 553.0, + 1002.0, + 533.0, + 1002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 982.0, + 634.0, + 982.0, + 634.0, + 1001.0, + 612.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 978.0, + 773.0, + 978.0, + 773.0, + 1004.0, + 748.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 981.0, + 880.0, + 981.0, + 880.0, + 1004.0, + 853.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 965.0, + 989.0, + 965.0, + 989.0, + 1018.0, + 937.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 993.0, + 423.0, + 993.0, + 423.0, + 1024.0, + 307.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 381.5, + 773.0, + 381.5, + 773.0, + 397.5, + 749.0, + 397.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 522.5, + 474.0, + 522.5, + 474.0, + 558.5, + 309.0, + 558.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 676.0, + 488.0, + 676.0, + 488.0, + 712.0, + 309.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.75, + 741.5, + 957.75, + 741.5, + 957.75, + 754.5, + 917.75, + 754.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.75, + 842.0, + 769.75, + 842.0, + 769.75, + 859.5, + 746.75, + 859.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 872.0, + 1062.0, + 872.0, + 1062.0, + 892.0, + 1003.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 978.0, + 1108.0, + 978.0, + 1108.0, + 1002.0, + 1052.0, + 1002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 816.0, + 72.0, + 816.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": [ + 295.0, + 1116.0, + 942.0, + 1116.0, + 942.0, + 1152.0, + 295.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 1116.0, + 1404.0, + 1116.0, + 1404.0, + 1152.0, + 1091.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1149.0, + 490.0, + 1149.0, + 490.0, + 1181.0, + 294.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1149.0, + 1200.0, + 1149.0, + 1200.0, + 1181.0, + 577.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 1149.0, + 1404.0, + 1149.0, + 1404.0, + 1181.0, + 1295.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1177.0, + 1053.0, + 1177.0, + 1053.0, + 1216.0, + 293.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1177.0, + 1406.0, + 1177.0, + 1406.0, + 1216.0, + 1214.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1204.0, + 1019.0, + 1204.0, + 1019.0, + 1254.0, + 289.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 1204.0, + 1411.0, + 1204.0, + 1411.0, + 1254.0, + 1236.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1239.0, + 594.0, + 1239.0, + 594.0, + 1276.0, + 293.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1239.0, + 1407.0, + 1239.0, + 1407.0, + 1276.0, + 756.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 1260.0, + 416.0, + 1260.0, + 416.0, + 1333.0, + 284.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 1260.0, + 529.0, + 1260.0, + 529.0, + 1333.0, + 517.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1260.0, + 819.0, + 1260.0, + 819.0, + 1333.0, + 556.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 280.0, + 1297.0, + 601.0, + 1297.0, + 601.0, + 1381.0, + 280.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1297.0, + 887.0, + 1297.0, + 887.0, + 1381.0, + 628.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 1297.0, + 1404.0, + 1297.0, + 1404.0, + 1381.0, + 945.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1353.0, + 721.0, + 1353.0, + 721.0, + 1396.0, + 292.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 1353.0, + 809.0, + 1353.0, + 809.0, + 1396.0, + 761.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 1353.0, + 1408.0, + 1353.0, + 1408.0, + 1396.0, + 848.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1387.0, + 819.0, + 1387.0, + 819.0, + 1421.0, + 294.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 1387.0, + 1138.0, + 1387.0, + 1138.0, + 1421.0, + 852.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 1387.0, + 1406.0, + 1387.0, + 1406.0, + 1421.0, + 1219.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1415.0, + 500.0, + 1415.0, + 500.0, + 1460.0, + 292.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1415.0, + 958.0, + 1415.0, + 958.0, + 1460.0, + 686.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1415.0, + 1204.0, + 1415.0, + 1204.0, + 1460.0, + 1188.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 1277.5, + 1406.0, + 1277.5, + 1406.0, + 1318.0, + 937.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1520.0, + 1341.0, + 1520.0, + 1341.0, + 1557.0, + 294.0, + 1557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 485.0, + 1551.0, + 589.0, + 1551.0, + 589.0, + 1588.0, + 485.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 1551.0, + 730.0, + 1551.0, + 730.0, + 1588.0, + 610.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 1551.0, + 1024.0, + 1551.0, + 1024.0, + 1588.0, + 765.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1551.0, + 1176.0, + 1551.0, + 1176.0, + 1588.0, + 1054.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 1551.0, + 1264.0, + 1551.0, + 1264.0, + 1588.0, + 1254.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1301.0, + 1551.0, + 1405.0, + 1551.0, + 1405.0, + 1588.0, + 1301.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1567.0, + 297.0, + 1567.0, + 297.0, + 1649.0, + 283.0, + 1649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 1567.0, + 434.0, + 1567.0, + 434.0, + 1649.0, + 364.0, + 1649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 1567.0, + 753.0, + 1567.0, + 753.0, + 1649.0, + 705.0, + 1649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1567.0, + 810.0, + 1567.0, + 810.0, + 1649.0, + 789.0, + 1649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1912.0, + 783.0, + 1912.0, + 783.0, + 1954.0, + 293.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 1912.0, + 1144.0, + 1912.0, + 1144.0, + 1954.0, + 1032.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1954.0, + 1394.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 279.0, + 1936.0, + 296.0, + 1936.0, + 296.0, + 2013.0, + 279.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 1936.0, + 427.0, + 1936.0, + 427.0, + 2013.0, + 376.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1936.0, + 622.0, + 1936.0, + 622.0, + 2013.0, + 510.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1936.0, + 831.0, + 1936.0, + 831.0, + 2013.0, + 818.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 1936.0, + 1084.0, + 1936.0, + 1084.0, + 2013.0, + 1032.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 1936.0, + 1418.0, + 1936.0, + 1418.0, + 2013.0, + 1286.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1987.0, + 296.0, + 1987.0, + 296.0, + 2050.0, + 285.0, + 2050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 1987.0, + 593.0, + 1987.0, + 593.0, + 2050.0, + 546.0, + 2050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 672.0, + 1987.0, + 777.0, + 1987.0, + 777.0, + 2050.0, + 672.0, + 2050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1987.0, + 1097.0, + 1987.0, + 1097.0, + 2050.0, + 1009.0, + 2050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1987.0, + 1410.0, + 1987.0, + 1410.0, + 2050.0, + 1394.0, + 2050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1637.0, + 340.0, + 1637.0, + 340.0, + 1686.0, + 292.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1637.0, + 1408.0, + 1637.0, + 1408.0, + 1686.0, + 577.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1674.0, + 559.0, + 1674.0, + 559.0, + 1711.0, + 296.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1116.0, + 942.0, + 1116.0, + 942.0, + 1152.0, + 295.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 1116.0, + 1404.0, + 1116.0, + 1404.0, + 1152.0, + 1091.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1149.0, + 490.0, + 1149.0, + 490.0, + 1181.0, + 294.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1149.0, + 1200.0, + 1149.0, + 1200.0, + 1181.0, + 577.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 1149.0, + 1404.0, + 1149.0, + 1404.0, + 1181.0, + 1295.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1177.0, + 1053.0, + 1177.0, + 1053.0, + 1216.0, + 293.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1177.0, + 1406.0, + 1177.0, + 1406.0, + 1216.0, + 1214.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1204.0, + 1019.0, + 1204.0, + 1019.0, + 1254.0, + 289.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 1204.0, + 1411.0, + 1204.0, + 1411.0, + 1254.0, + 1236.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1239.0, + 594.0, + 1239.0, + 594.0, + 1276.0, + 293.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1239.0, + 1407.0, + 1239.0, + 1407.0, + 1276.0, + 756.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 1260.0, + 416.0, + 1260.0, + 416.0, + 1333.0, + 284.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 1260.0, + 529.0, + 1260.0, + 529.0, + 1333.0, + 517.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1260.0, + 819.0, + 1260.0, + 819.0, + 1333.0, + 556.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 280.0, + 1297.0, + 601.0, + 1297.0, + 601.0, + 1381.0, + 280.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1297.0, + 887.0, + 1297.0, + 887.0, + 1381.0, + 628.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 1297.0, + 1404.0, + 1297.0, + 1404.0, + 1381.0, + 945.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1353.0, + 721.0, + 1353.0, + 721.0, + 1396.0, + 292.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 1353.0, + 809.0, + 1353.0, + 809.0, + 1396.0, + 761.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 1353.0, + 1408.0, + 1353.0, + 1408.0, + 1396.0, + 848.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1387.0, + 819.0, + 1387.0, + 819.0, + 1421.0, + 294.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 1387.0, + 1138.0, + 1387.0, + 1138.0, + 1421.0, + 852.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 1387.0, + 1406.0, + 1387.0, + 1406.0, + 1421.0, + 1219.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1415.0, + 500.0, + 1415.0, + 500.0, + 1460.0, + 292.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1415.0, + 958.0, + 1415.0, + 958.0, + 1460.0, + 686.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1415.0, + 1204.0, + 1415.0, + 1204.0, + 1460.0, + 1188.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 1277.5, + 1406.0, + 1277.5, + 1406.0, + 1318.0, + 937.0, + 1318.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 646, + 1778, + 1051, + 1778, + 1051, + 1872, + 646, + 1872 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 680, + 828, + 1015, + 828, + 1015, + 941, + 680, + 941 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 294, + 514, + 1401, + 514, + 1401, + 600, + 294, + 600 + ], + "score": 0.955 + }, + { + "category_id": 8, + "poly": [ + 407, + 1605, + 1287, + 1605, + 1287, + 1701, + 407, + 1701 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 295, + 1303, + 1403, + 1303, + 1403, + 1370, + 295, + 1370 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 292, + 747, + 1402, + 747, + 1402, + 813, + 292, + 813 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 518, + 614, + 1176, + 614, + 1176, + 722, + 518, + 722 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 293, + 969, + 1400, + 969, + 1400, + 1037, + 293, + 1037 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 296, + 1047, + 1401, + 1047, + 1401, + 1123, + 296, + 1123 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 437, + 1430, + 1256, + 1430, + 1256, + 1526, + 437, + 1526 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 440, + 1136, + 1255, + 1136, + 1255, + 1227, + 440, + 1227 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 297, + 1899, + 738, + 1899, + 738, + 1933, + 297, + 1933 + ], + "score": 0.933 + }, + { + "category_id": 8, + "poly": [ + 735, + 1949, + 961, + 1949, + 961, + 1989, + 735, + 1989 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 298, + 1728, + 786, + 1728, + 786, + 1761, + 298, + 1761 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 296, + 1552, + 740, + 1552, + 740, + 1590, + 296, + 1590 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 293, + 1999, + 1260, + 1999, + 1260, + 2040, + 293, + 2040 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 297, + 1238, + 827, + 1238, + 827, + 1275, + 297, + 1275 + ], + "score": 0.925 + }, + { + "category_id": 8, + "poly": [ + 479, + 253, + 1214, + 253, + 1214, + 343, + 479, + 343 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 298, + 1382, + 525, + 1382, + 525, + 1415, + 298, + 1415 + ], + "score": 0.923 + }, + { + "category_id": 2, + "poly": [ + 297, + 73, + 814, + 73, + 814, + 106, + 297, + 106 + ], + "score": 0.922 + }, + { + "category_id": 8, + "poly": [ + 558, + 420, + 1137, + 420, + 1137, + 498, + 558, + 498 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 296, + 231, + 395, + 231, + 395, + 261, + 296, + 261 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 297, + 369, + 1390, + 369, + 1390, + 407, + 297, + 407 + ], + "score": 0.917 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 866, + 2087, + 866, + 2114, + 835, + 2114 + ], + "score": 0.811 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 866, + 2087, + 866, + 2114, + 835, + 2114 + ], + "score": 0.139 + }, + { + "category_id": 14, + "poly": [ + 681, + 826, + 1017, + 826, + 1017, + 941, + 681, + 941 + ], + "score": 0.94, + "latex": "R ( s , a ) = \\left\\{ { \\begin{array} { l l } { 1 } & { s = s _ { H } ^ { + } } \\\\ { - 1 } & { s = s _ { H } ^ { - } } \\\\ { 0 } & { { \\mathrm { o t h e r w i s e } } } \\end{array} } \\right. ." + }, + { + "category_id": 14, + "poly": [ + 517, + 611, + 1181, + 611, + 1181, + 723, + 517, + 723 + ], + "score": 0.94, + "latex": "P ( s _ { H - 1 } ^ { \\hat { d } + 1 } , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } \\left( 1 + r _ { 0 } \\cdot \\sqrt { \\hat { d } } \\right) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } \\left( 1 - r _ { 0 } \\cdot \\sqrt { \\hat { d } } \\right) / 2 } \\end{array} \\right. ." + }, + { + "category_id": 14, + "poly": [ + 647, + 1772, + 1052, + 1772, + 1052, + 1872, + 647, + 1872 + ], + "score": 0.94, + "latex": "\\theta _ { H - 1 } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } ." + }, + { + "category_id": 14, + "poly": [ + 443, + 1135, + 1252, + 1135, + 1252, + 1227, + 443, + 1227 + ], + "score": 0.94, + "latex": "\\phi ( s _ { h } ^ { \\hat { d } + 1 } , a ) = \\left\\{ { \\begin{array} { l l } { e _ { \\hat { d } + 2 + c } } & { a = a _ { c } , c \\in [ { \\hat { d } } ] } \\\\ { { \\frac { 1 } { d ^ { 1 / 2 } } } \\left( e _ { 1 } + e _ { 2 } + \\ldots + e _ { \\hat { d } } \\right) } & { a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\ldots , a _ { d } \\right\\} } \\end{array} } \\right. ." + }, + { + "category_id": 14, + "poly": [ + 480, + 251, + 1212, + 251, + 1212, + 345, + 480, + 345 + ], + "score": 0.94, + "latex": "P \\left( s _ { h } ^ { \\hat { d } + 1 } , a \\right) = \\left\\{ \\begin{array} { l l } { s _ { h + 1 } ^ { + } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } ) / 2 } \\\\ { s _ { h + 1 } ^ { - } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } \\cdot \\hat { d } ^ { ( H - h ) / 2 } ) / 2 } \\end{array} \\right. ." + }, + { + "category_id": 14, + "poly": [ + 407, + 1601, + 1288, + 1601, + 1288, + 1702, + 407, + 1702 + ], + "score": 0.93, + "latex": "\\theta _ { h } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - h - 1 ) / 2 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } + \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - h - 2 ) / 2 } \\cdot e _ { \\hat { d } + 2 + c } ." + }, + { + "category_id": 14, + "poly": [ + 439, + 1425, + 1259, + 1425, + 1259, + 1526, + 439, + 1526 + ], + "score": 0.93, + "latex": "\\theta _ { 1 } = \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - 3 ) / 2 } \\cdot e _ { c } + e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } + \\sum _ { c = 1 } ^ { \\hat { d } } r _ { 0 } \\cdot \\hat { d } ^ { ( H - 2 ) / 2 } \\cdot e _ { \\hat { d } + 2 + c } ." + }, + { + "category_id": 13, + "poly": [ + 297, + 553, + 515, + 553, + 515, + 599, + 297, + 599 + ], + "score": 0.93, + "latex": "P ( s _ { H - 1 } ^ { \\hat { d } + 1 } , a _ { c } ) = s _ { H } ^ { c }" + }, + { + "category_id": 13, + "poly": [ + 1201, + 513, + 1290, + 513, + 1290, + 553, + 1201, + 553 + ], + "score": 0.93, + "latex": "c \\in [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 1080, + 368, + 1158, + 368, + 1158, + 406, + 1080, + 406 + ], + "score": 0.93, + "latex": "c \\in [ \\hat { d } ]" + }, + { + "category_id": 13, + "poly": [ + 584, + 516, + 799, + 516, + 799, + 556, + 584, + 556 + ], + "score": 0.92, + "latex": "P ( s _ { H - 1 } ^ { + } , a ) = s _ { H } ^ { + }" + }, + { + "category_id": 13, + "poly": [ + 359, + 1337, + 478, + 1337, + 478, + 1370, + 359, + 1370 + ], + "score": 0.92, + "latex": "\\pi ( s ) = a _ { d }" + }, + { + "category_id": 13, + "poly": [ + 400, + 1555, + 654, + 1555, + 654, + 1589, + 400, + 1589 + ], + "score": 0.92, + "latex": "h \\in \\{ 2 , 3 , \\ldots , H - 2 \\}" + }, + { + "category_id": 13, + "poly": [ + 773, + 1048, + 982, + 1048, + 982, + 1083, + 773, + 1083 + ], + "score": 0.92, + "latex": "h \\in \\{ 2 , 3 , \\ldots , H \\}" + }, + { + "category_id": 13, + "poly": [ + 828, + 1002, + 905, + 1002, + 905, + 1036, + 828, + 1036 + ], + "score": 0.92, + "latex": "c \\in [ d ]" + }, + { + "category_id": 13, + "poly": [ + 840, + 1085, + 1030, + 1085, + 1030, + 1123, + 840, + 1123 + ], + "score": 0.92, + "latex": "\\phi ( s _ { h } ^ { - } , a ) = e _ { \\hat { d } + 2 }" + }, + { + "category_id": 13, + "poly": [ + 572, + 1731, + 700, + 1731, + 700, + 1759, + 572, + 1759 + ], + "score": 0.92, + "latex": "h = H - 1" + }, + { + "category_id": 13, + "poly": [ + 856, + 518, + 1072, + 518, + 1072, + 556, + 856, + 556 + ], + "score": 0.92, + "latex": "P ( s _ { H - 1 } ^ { - } , a ) \\ = \\ s _ { H } ^ { - }" + }, + { + "category_id": 14, + "poly": [ + 557, + 419, + 1142, + 419, + 1142, + 499, + 557, + 499 + ], + "score": 0.92, + "latex": "P ( s _ { H - 1 } ^ { c } , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 + r _ { 0 } ) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } ( 1 - r _ { 0 } ) / 2 } \\end{array} \\right. ." + }, + { + "category_id": 13, + "poly": [ + 608, + 560, + 903, + 560, + 903, + 601, + 608, + 601 + ], + "score": 0.92, + "latex": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}" + }, + { + "category_id": 13, + "poly": [ + 1015, + 1004, + 1180, + 1004, + 1180, + 1036, + 1015, + 1036 + ], + "score": 0.91, + "latex": "\\phi ( s _ { 1 } , a _ { c } ) = e _ { c }" + }, + { + "category_id": 13, + "poly": [ + 1068, + 2002, + 1252, + 2002, + 1252, + 2036, + 1068, + 2036 + ], + "score": 0.91, + "latex": "( s , a ) \\in S _ { h } \\times \\mathcal { A }" + }, + { + "category_id": 13, + "poly": [ + 741, + 1999, + 988, + 1999, + 988, + 2037, + 741, + 2037 + ], + "score": 0.91, + "latex": "Q _ { h } ^ { \\pi } ( s , a ) = \\theta _ { h } ^ { \\top } \\phi ( s , a )" + }, + { + "category_id": 13, + "poly": [ + 1101, + 1048, + 1311, + 1048, + 1311, + 1083, + 1101, + 1083 + ], + "score": 0.9, + "latex": "h \\in \\{ 2 , 3 , \\ldots , H \\}" + }, + { + "category_id": 13, + "poly": [ + 371, + 1384, + 440, + 1384, + 440, + 1412, + 371, + 1412 + ], + "score": 0.9, + "latex": "h = 1" + }, + { + "category_id": 13, + "poly": [ + 382, + 520, + 466, + 520, + 466, + 549, + 382, + 549 + ], + "score": 0.89, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 1209, + 373, + 1283, + 373, + 1283, + 401, + 1209, + 401 + ], + "score": 0.89, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 1078, + 1306, + 1205, + 1306, + 1205, + 1334, + 1078, + 1334 + ], + "score": 0.89, + "latex": "\\pi : { \\mathcal { S } } A" + }, + { + "category_id": 14, + "poly": [ + 735, + 1946, + 961, + 1946, + 961, + 1988, + 735, + 1988 + ], + "score": 0.89, + "latex": "\\theta _ { H } = e _ { \\hat { d } + 1 } - e _ { \\hat { d } + 2 } ." + }, + { + "category_id": 13, + "poly": [ + 573, + 1902, + 654, + 1902, + 654, + 1928, + 573, + 1928 + ], + "score": 0.89, + "latex": "h = H" + }, + { + "category_id": 13, + "poly": [ + 556, + 1337, + 624, + 1337, + 624, + 1365, + 556, + 1365 + ], + "score": 0.89, + "latex": "s \\in S" + }, + { + "category_id": 13, + "poly": [ + 1321, + 1087, + 1393, + 1087, + 1393, + 1114, + 1321, + 1114 + ], + "score": 0.88, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 461, + 1002, + 496, + 1002, + 496, + 1030, + 461, + 1030 + ], + "score": 0.87, + "latex": "\\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 996, + 977, + 1147, + 977, + 1147, + 1003, + 996, + 1003 + ], + "score": 0.84, + "latex": "e _ { 1 } , e _ { 2 } , \\ldots , e _ { d }" + }, + { + "category_id": 13, + "poly": [ + 1323, + 1050, + 1401, + 1050, + 1401, + 1080, + 1323, + 1080 + ], + "score": 0.82, + "latex": "a \\in { \\mathcal { A } }" + }, + { + "category_id": 13, + "poly": [ + 636, + 2002, + 728, + 2002, + 728, + 2036, + 636, + 2036 + ], + "score": 0.82, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 346, + 1081, + 790, + 1081, + 790, + 1123, + 346, + 1123 + ], + "score": 0.8, + "latex": "c \\in [ \\hat { d } ] , \\phi ( s _ { h } ^ { c } , a ) = e _ { c } , \\phi ( s _ { h } ^ { + } , a ) = e _ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 650, + 1239, + 820, + 1239, + 820, + 1275, + 650, + 1275 + ], + "score": 0.76, + "latex": "\\| \\phi ( s , a ) \\| _ { 2 } \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 601, + 1083, + 789, + 1083, + 789, + 1124, + 601, + 1124 + ], + "score": 0.32, + "latex": "\\phi ( s _ { h } ^ { + } , a ) = e _ { \\hat { d } + 1 }" + }, + { + "category_id": 13, + "poly": [ + 345, + 1081, + 422, + 1081, + 422, + 1119, + 345, + 1119 + ], + "score": 0.28, + "latex": "c \\in [ \\hat { d } ]" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 71.0, + 815.0, + 71.0, + 815.0, + 108.0, + 295.0, + 108.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": [ + 832.0, + 2085.0, + 871.0, + 2085.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 512.0, + 381.0, + 512.0, + 381.0, + 558.0, + 290.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 512.0, + 583.0, + 512.0, + 583.0, + 558.0, + 467.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 512.0, + 855.0, + 512.0, + 855.0, + 558.0, + 800.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 512.0, + 1200.0, + 512.0, + 1200.0, + 558.0, + 1073.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 512.0, + 1407.0, + 512.0, + 1407.0, + 558.0, + 1291.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 543.0, + 296.0, + 543.0, + 296.0, + 613.0, + 287.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 543.0, + 607.0, + 543.0, + 607.0, + 613.0, + 516.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 543.0, + 1024.0, + 543.0, + 1024.0, + 613.0, + 904.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1301.0, + 1077.0, + 1301.0, + 1077.0, + 1342.0, + 295.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1301.0, + 1406.0, + 1301.0, + 1406.0, + 1342.0, + 1206.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1334.0, + 358.0, + 1334.0, + 358.0, + 1370.0, + 294.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 1334.0, + 555.0, + 1334.0, + 555.0, + 1370.0, + 479.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1334.0, + 1025.0, + 1334.0, + 1025.0, + 1370.0, + 625.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 748.0, + 1404.0, + 748.0, + 1404.0, + 784.0, + 295.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 780.0, + 862.0, + 780.0, + 862.0, + 815.0, + 292.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 968.0, + 995.0, + 968.0, + 995.0, + 1007.0, + 293.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 968.0, + 1403.0, + 968.0, + 1403.0, + 1007.0, + 1148.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 995.0, + 460.0, + 995.0, + 460.0, + 1041.0, + 292.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 995.0, + 827.0, + 995.0, + 827.0, + 1041.0, + 497.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 995.0, + 1014.0, + 995.0, + 1014.0, + 1041.0, + 906.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 995.0, + 1192.0, + 995.0, + 1192.0, + 1041.0, + 1181.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1042.0, + 772.0, + 1042.0, + 772.0, + 1088.0, + 292.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1042.0, + 1100.0, + 1042.0, + 1100.0, + 1088.0, + 983.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1312.0, + 1042.0, + 1322.0, + 1042.0, + 1322.0, + 1088.0, + 1312.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1042.0, + 1406.0, + 1042.0, + 1406.0, + 1088.0, + 1402.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1079.0, + 344.0, + 1079.0, + 344.0, + 1126.0, + 294.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 1079.0, + 839.0, + 1079.0, + 839.0, + 1126.0, + 791.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 1079.0, + 1320.0, + 1079.0, + 1320.0, + 1126.0, + 1031.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1079.0, + 1407.0, + 1079.0, + 1407.0, + 1126.0, + 1394.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1898.0, + 572.0, + 1898.0, + 572.0, + 1935.0, + 296.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 1898.0, + 738.0, + 1898.0, + 738.0, + 1935.0, + 655.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1728.0, + 571.0, + 1728.0, + 571.0, + 1763.0, + 295.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 1728.0, + 786.0, + 1728.0, + 786.0, + 1763.0, + 701.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1553.0, + 399.0, + 1553.0, + 399.0, + 1590.0, + 295.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 1553.0, + 739.0, + 1553.0, + 739.0, + 1590.0, + 655.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1994.0, + 635.0, + 1994.0, + 635.0, + 2043.0, + 292.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 1994.0, + 740.0, + 1994.0, + 740.0, + 2043.0, + 729.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 989.0, + 1994.0, + 1067.0, + 1994.0, + 1067.0, + 2043.0, + 989.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 1994.0, + 1263.0, + 1994.0, + 1263.0, + 2043.0, + 1253.0, + 2043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1237.0, + 649.0, + 1237.0, + 649.0, + 1278.0, + 297.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1237.0, + 830.0, + 1237.0, + 830.0, + 1278.0, + 821.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1379.0, + 370.0, + 1379.0, + 370.0, + 1418.0, + 295.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 1379.0, + 526.0, + 1379.0, + 526.0, + 1418.0, + 441.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 398.0, + 228.0, + 398.0, + 264.0, + 294.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 365.0, + 1079.0, + 365.0, + 1079.0, + 411.0, + 292.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 365.0, + 1208.0, + 365.0, + 1208.0, + 411.0, + 1159.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 365.0, + 1392.0, + 365.0, + 1392.0, + 411.0, + 1284.0, + 411.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 886, + 1406, + 886, + 1406, + 1120, + 296, + 1120 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 295, + 1283, + 1405, + 1283, + 1405, + 1548, + 295, + 1548 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 296, + 1133, + 1405, + 1133, + 1405, + 1273, + 296, + 1273 + ], + "score": 0.975 + }, + { + "category_id": 8, + "poly": [ + 389, + 621, + 1310, + 621, + 1310, + 815, + 389, + 815 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 298, + 227, + 1403, + 227, + 1403, + 324, + 298, + 324 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 573, + 479, + 1123, + 479, + 1123, + 566, + 573, + 566 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 296, + 392, + 1404, + 392, + 1404, + 465, + 296, + 465 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 294, + 1967, + 1400, + 1967, + 1400, + 2036, + 294, + 2036 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 560, + 1876, + 1131, + 1876, + 1131, + 1962, + 560, + 1962 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 583, + 1559, + 1113, + 1559, + 1113, + 1638, + 583, + 1638 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 297, + 575, + 549, + 575, + 549, + 607, + 297, + 607 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 298, + 822, + 715, + 822, + 715, + 860, + 298, + 860 + ], + "score": 0.92 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 814, + 74, + 814, + 106, + 299, + 106 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 296, + 1853, + 345, + 1853, + 345, + 1882, + 296, + 1882 + ], + "score": 0.902 + }, + { + "category_id": 1, + "poly": [ + 293, + 1651, + 1367, + 1651, + 1367, + 1696, + 293, + 1696 + ], + "score": 0.893 + }, + { + "category_id": 1, + "poly": [ + 298, + 1709, + 1401, + 1709, + 1401, + 1774, + 298, + 1774 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.87 + }, + { + "category_id": 8, + "poly": [ + 655, + 1774, + 1041, + 1774, + 1041, + 1848, + 655, + 1848 + ], + "score": 0.737 + }, + { + "category_id": 8, + "poly": [ + 332, + 329, + 1360, + 329, + 1360, + 378, + 332, + 378 + ], + "score": 0.705 + }, + { + "category_id": 8, + "poly": [ + 334, + 329, + 1358, + 329, + 1358, + 378, + 334, + 378 + ], + "score": 0.55 + }, + { + "category_id": 14, + "poly": [ + 386, + 620, + 1308, + 620, + 1308, + 816, + 386, + 816 + ], + "score": 0.95, + "latex": "\\pi _ { \\operatorname* { d a t a } } ( s ) = \\left\\{ \\begin{array} { l l } { \\operatorname { U n i f o r m } ( A ) } & { s = s _ { 1 } } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { c } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} , c \\in [ \\hat { d } ] \\} } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { + } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\\\ { a _ { 1 } } & { s \\in \\{ s _ { h } ^ { - } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\\\ { \\operatorname { U n i f o r m } ( \\{ a _ { 1 } , a _ { 2 } , \\ldots , a _ { \\hat { d } } \\} ) } & { s \\in \\{ s _ { h } ^ { \\hat { d } + 1 } \\mid h \\in \\{ 2 , 3 , \\ldots , H \\} \\} } \\end{array} \\right. ," + }, + { + "category_id": 13, + "poly": [ + 497, + 386, + 600, + 386, + 600, + 430, + 497, + 430 + ], + "score": 0.93, + "latex": "( s _ { h } ^ { \\hat { d } + 1 } , a )" + }, + { + "category_id": 13, + "poly": [ + 1247, + 1137, + 1350, + 1137, + 1350, + 1174, + 1247, + 1174 + ], + "score": 0.93, + "latex": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }" + }, + { + "category_id": 13, + "poly": [ + 548, + 1649, + 659, + 1649, + 659, + 1694, + 548, + 1694 + ], + "score": 0.93, + "latex": "( s _ { H - 1 } ^ { \\hat { d } + 1 } , a )" + }, + { + "category_id": 14, + "poly": [ + 574, + 473, + 1124, + 473, + 1124, + 568, + 574, + 568 + ], + "score": 0.93, + "latex": "\\mathbb { E } _ { ( s , a ) \\sim \\mu _ { h } } [ \\phi ( s , a ) \\phi ( s , a ) ^ { \\top } ] = \\frac { 1 } { d } \\sum _ { c = 1 } ^ { d } e _ { c } e _ { c } ^ { \\top } = \\frac { 1 } { d } I ." + }, + { + "category_id": 14, + "poly": [ + 582, + 1558, + 1115, + 1558, + 1115, + 1638, + 582, + 1638 + ], + "score": 0.93, + "latex": "P ( s , a ) = \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { \\mathrm { w i t h } \\ p r o b a b i l i t y \\ ( 1 + r _ { 0 } ) / 2 } \\\\ { s _ { H } ^ { - } } & { \\mathrm { w i t h } \\ p r o b a b i l i t y \\ ( 1 - r _ { 0 } ) / 2 } \\end{array} \\right. ." + }, + { + "category_id": 13, + "poly": [ + 433, + 1015, + 619, + 1015, + 619, + 1051, + 433, + 1051 + ], + "score": 0.93, + "latex": "\\stackrel { \\cdot } { r } _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 662, + 919, + 851, + 919, + 851, + 955, + 662, + 955 + ], + "score": 0.92, + "latex": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 988, + 1203, + 1178, + 1203, + 1178, + 1239, + 988, + 1239 + ], + "score": 0.92, + "latex": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 555, + 431, + 647, + 431, + 647, + 464, + 555, + 464 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 997, + 1015, + 1204, + 1015, + 1204, + 1051, + 997, + 1051 + ], + "score": 0.92, + "latex": "r _ { 0 } \\cdot \\hat { d } ^ { ( \\overleftarrow { H } - 2 ) / 2 } = 1 ." + }, + { + "category_id": 13, + "poly": [ + 799, + 1133, + 989, + 1133, + 989, + 1171, + 799, + 1171 + ], + "score": 0.92, + "latex": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 900, + 1710, + 1085, + 1710, + 1085, + 1746, + 900, + 1746 + ], + "score": 0.92, + "latex": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 699, + 1083, + 883, + 1083, + 883, + 1118, + 699, + 1118 + ], + "score": 0.92, + "latex": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 494, + 955, + 597, + 955, + 597, + 989, + 494, + 989 + ], + "score": 0.92, + "latex": "\\{ \\mu _ { h } \\} _ { h = 1 } ^ { H }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1422, + 697, + 1422, + 697, + 1468, + 297, + 1468 + ], + "score": 0.92, + "latex": "( s , a ) \\in \\{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \\hat { d } + 1 } \\} \\times \\mathcal { A }" + }, + { + "category_id": 13, + "poly": [ + 613, + 824, + 705, + 824, + 705, + 858, + 613, + 858 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 297, + 1504, + 586, + 1504, + 586, + 1548, + 297, + 1548 + ], + "score": 0.92, + "latex": "s \\not \\in \\{ s _ { H - 1 } ^ { + } , s _ { H - 1 } ^ { - } , s _ { H - 1 } ^ { \\hat { d } + 1 } \\}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1998, + 405, + 1998, + 405, + 2036, + 298, + 2036 + ], + "score": 0.92, + "latex": "\\Omega ( \\hat { d } ^ { H - 2 } )" + }, + { + "category_id": 14, + "poly": [ + 562, + 1874, + 1129, + 1874, + 1129, + 1966, + 562, + 1966 + ], + "score": 0.92, + "latex": "p _ { 2 } = \\left\\{ s _ { H } ^ { + } \\quad \\mathrm { w i t h } \\mathrm { p r o b a b i l i t y } ( 1 + \\hat { d } ^ { - ( H - 2 ) / 2 } ) / 2 \\right." + }, + { + "category_id": 13, + "poly": [ + 641, + 1287, + 703, + 1287, + 703, + 1319, + 641, + 1319 + ], + "score": 0.92, + "latex": "( s , a )" + }, + { + "category_id": 13, + "poly": [ + 1068, + 391, + 1366, + 391, + 1366, + 434, + 1068, + 434 + ], + "score": 0.92, + "latex": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}" + }, + { + "category_id": 13, + "poly": [ + 487, + 1172, + 686, + 1172, + 686, + 1206, + 487, + 1206 + ], + "score": 0.91, + "latex": "\\phi : \\mathcal { S } \\times \\mathcal { A } \\mathbb { R } ^ { d }" + }, + { + "category_id": 14, + "poly": [ + 339, + 327, + 1359, + 327, + 1359, + 376, + 339, + 376 + ], + "score": 0.91, + "latex": "\\{ ( s _ { h } ^ { 1 } , a _ { 1 } ) , ( s _ { h } ^ { 2 } , a _ { 1 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } } , a _ { 1 } ) , ( s _ { h } ^ { + } , a _ { 1 } ) , ( s _ { h } ^ { - } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { 2 } ) , \\ldots , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } } ) \\} ." + }, + { + "category_id": 13, + "poly": [ + 395, + 824, + 533, + 824, + 533, + 859, + 395, + 859 + ], + "score": 0.91, + "latex": "\\mu _ { h } = \\mu _ { h } ^ { \\pi _ { \\mathrm { d a t a } } }" + }, + { + "category_id": 13, + "poly": [ + 1067, + 1656, + 1363, + 1656, + 1363, + 1697, + 1067, + 1697 + ], + "score": 0.91, + "latex": "a \\in \\left\\{ a _ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } , \\dotsc , a _ { d } \\right\\}" + }, + { + "category_id": 13, + "poly": [ + 742, + 987, + 822, + 987, + 822, + 1017, + 742, + 1017 + ], + "score": 0.91, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 569, + 1088, + 649, + 1088, + 649, + 1118, + 569, + 1118 + ], + "score": 0.91, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 659, + 1141, + 745, + 1141, + 745, + 1170, + 659, + 1170 + ], + "score": 0.91, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 768, + 1717, + 848, + 1717, + 848, + 1746, + 768, + 1746 + ], + "score": 0.91, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 846, + 1209, + 934, + 1209, + 934, + 1239, + 846, + 1239 + ], + "score": 0.91, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 14, + "poly": [ + 656, + 1769, + 1047, + 1769, + 1047, + 1849, + 656, + 1849 + ], + "score": 0.91, + "latex": "p _ { 1 } = { \\left\\{ \\begin{array} { l l } { s _ { H } ^ { + } } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\\\ { s _ { H } ^ { - } } & { { \\mathrm { w i t h ~ p r o b a b i l i t y ~ } } 1 / 2 } \\end{array} \\right. }" + }, + { + "category_id": 13, + "poly": [ + 1002, + 1471, + 1064, + 1471, + 1064, + 1503, + 1002, + 1503 + ], + "score": 0.91, + "latex": "( s , a )" + }, + { + "category_id": 13, + "poly": [ + 465, + 1467, + 660, + 1467, + 660, + 1502, + 465, + 1502 + ], + "score": 0.9, + "latex": "r _ { 0 } = \\hat { d } ^ { - ( H - 2 ) / 2 }" + }, + { + "category_id": 13, + "poly": [ + 873, + 262, + 959, + 262, + 959, + 293, + 873, + 293 + ], + "score": 0.9, + "latex": "h \\geq 2" + }, + { + "category_id": 13, + "poly": [ + 495, + 260, + 739, + 260, + 739, + 296, + 495, + 296 + ], + "score": 0.9, + "latex": "\\{ ( s _ { 1 } , a _ { c } ) ~ | ~ c ~ \\in ~ [ d ] \\}" + }, + { + "category_id": 13, + "poly": [ + 336, + 1472, + 426, + 1472, + 426, + 1502, + 336, + 1502 + ], + "score": 0.89, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 868, + 1347, + 1344, + 1347, + 1344, + 1393, + 868, + 1393 + ], + "score": 0.89, + "latex": "( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } + 1 } ) , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { \\hat { d } + 2 } ) , \\dots , ( s _ { h } ^ { \\hat { d } + 1 } , a _ { d } )" + }, + { + "category_id": 13, + "poly": [ + 966, + 1392, + 1144, + 1392, + 1144, + 1425, + 966, + 1425 + ], + "score": 0.88, + "latex": "h ~ \\in ~ [ H \\mathrm { ~ - ~ } 2 ]" + }, + { + "category_id": 13, + "poly": [ + 524, + 925, + 609, + 925, + 609, + 954, + 524, + 954 + ], + "score": 0.88, + "latex": "r _ { 0 } = 0" + }, + { + "category_id": 13, + "poly": [ + 440, + 1320, + 648, + 1320, + 648, + 1350, + 440, + 1350 + ], + "score": 0.88, + "latex": "\\mu _ { 1 } , \\mu _ { 2 } , \\ldots , \\mu _ { H - 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1272, + 1476, + 1341, + 1476, + 1341, + 1504, + 1272, + 1504 + ], + "score": 0.87, + "latex": "\\mu _ { H - 1 }" + }, + { + "category_id": 13, + "poly": [ + 867, + 400, + 901, + 400, + 901, + 428, + 867, + 428 + ], + "score": 0.87, + "latex": "\\mu _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1047, + 235, + 1080, + 235, + 1080, + 263, + 1047, + 263 + ], + "score": 0.85, + "latex": "\\mu _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 832, + 1397, + 867, + 1397, + 867, + 1424, + 832, + 1424 + ], + "score": 0.85, + "latex": "\\mu _ { h }" + }, + { + "category_id": 13, + "poly": [ + 1272, + 1287, + 1351, + 1287, + 1351, + 1315, + 1272, + 1315 + ], + "score": 0.85, + "latex": "H - 2" + }, + { + "category_id": 13, + "poly": [ + 1213, + 266, + 1248, + 266, + 1248, + 294, + 1213, + 294 + ], + "score": 0.85, + "latex": "\\mu _ { h }" + }, + { + "category_id": 13, + "poly": [ + 920, + 1663, + 989, + 1663, + 989, + 1691, + 920, + 1691 + ], + "score": 0.84, + "latex": "\\mu _ { H - 1 }" + }, + { + "category_id": 13, + "poly": [ + 619, + 1241, + 644, + 1241, + 644, + 1267, + 619, + 1267 + ], + "score": 0.84, + "latex": "P" + }, + { + "category_id": 13, + "poly": [ + 831, + 1974, + 861, + 1974, + 861, + 2000, + 831, + 2000 + ], + "score": 0.84, + "latex": "p _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 916, + 1974, + 946, + 1974, + 946, + 2000, + 916, + 2000 + ], + "score": 0.83, + "latex": "p _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 341, + 1361, + 370, + 1361, + 370, + 1388, + 341, + 1388 + ], + "score": 0.83, + "latex": "r _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 298, + 989, + 328, + 989, + 328, + 1016, + 298, + 1016 + ], + "score": 0.82, + "latex": "a _ { d }" + }, + { + "category_id": 13, + "poly": [ + 978, + 1430, + 1064, + 1430, + 1064, + 1465, + 978, + 1465 + ], + "score": 0.82, + "latex": "P ( s , a )" + }, + { + "category_id": 13, + "poly": [ + 1335, + 1176, + 1360, + 1176, + 1360, + 1201, + 1335, + 1201 + ], + "score": 0.82, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 1204, + 1051, + 1248, + 1051, + 1248, + 1085, + 1204, + 1085 + ], + "score": 0.8, + "latex": "1 / 2" + }, + { + "category_id": 13, + "poly": [ + 816, + 1180, + 837, + 1180, + 837, + 1201, + 816, + 1201 + ], + "score": 0.78, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 992, + 960, + 1013, + 960, + 1013, + 983, + 992, + 983 + ], + "score": 0.74, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 896, + 1434, + 965, + 1434, + 965, + 1464, + 896, + 1464 + ], + "score": 0.72, + "latex": "\\mu _ { H - 1 }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 815.0, + 72.0, + 815.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": [ + 295.0, + 887.0, + 1404.0, + 887.0, + 1404.0, + 923.0, + 295.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 914.0, + 523.0, + 914.0, + 523.0, + 963.0, + 290.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 914.0, + 661.0, + 914.0, + 661.0, + 963.0, + 610.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 914.0, + 1408.0, + 914.0, + 1408.0, + 963.0, + 852.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 950.0, + 493.0, + 950.0, + 493.0, + 999.0, + 290.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 950.0, + 991.0, + 950.0, + 991.0, + 999.0, + 598.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 950.0, + 1409.0, + 950.0, + 1409.0, + 999.0, + 1014.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 985.0, + 297.0, + 985.0, + 297.0, + 1021.0, + 294.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 985.0, + 741.0, + 985.0, + 741.0, + 1021.0, + 329.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 985.0, + 1406.0, + 985.0, + 1406.0, + 1021.0, + 823.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1011.0, + 432.0, + 1011.0, + 432.0, + 1059.0, + 290.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 1011.0, + 996.0, + 1011.0, + 996.0, + 1059.0, + 620.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 1011.0, + 1408.0, + 1011.0, + 1408.0, + 1059.0, + 1205.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1050.0, + 1203.0, + 1050.0, + 1203.0, + 1086.0, + 295.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1249.0, + 1050.0, + 1406.0, + 1050.0, + 1406.0, + 1086.0, + 1249.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1085.0, + 568.0, + 1085.0, + 568.0, + 1119.0, + 292.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 1085.0, + 698.0, + 1085.0, + 698.0, + 1119.0, + 650.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 1085.0, + 897.0, + 1085.0, + 897.0, + 1119.0, + 884.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1285.0, + 640.0, + 1285.0, + 640.0, + 1320.0, + 295.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 1285.0, + 1271.0, + 1285.0, + 1271.0, + 1320.0, + 704.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1285.0, + 1406.0, + 1285.0, + 1406.0, + 1320.0, + 1352.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 280.0, + 1314.0, + 340.0, + 1314.0, + 340.0, + 1416.0, + 280.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1314.0, + 439.0, + 1314.0, + 439.0, + 1416.0, + 371.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 1314.0, + 867.0, + 1314.0, + 867.0, + 1416.0, + 649.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 1314.0, + 1406.0, + 1314.0, + 1406.0, + 1416.0, + 1345.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 280.0, + 1386.0, + 296.0, + 1386.0, + 296.0, + 1488.0, + 280.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 1386.0, + 831.0, + 1386.0, + 831.0, + 1488.0, + 698.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1386.0, + 895.0, + 1386.0, + 895.0, + 1488.0, + 868.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 1386.0, + 1418.0, + 1386.0, + 1418.0, + 1488.0, + 1145.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1457.0, + 335.0, + 1457.0, + 335.0, + 1512.0, + 285.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 427.0, + 1457.0, + 464.0, + 1457.0, + 464.0, + 1512.0, + 427.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 1457.0, + 1001.0, + 1457.0, + 1001.0, + 1512.0, + 661.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1457.0, + 1271.0, + 1457.0, + 1271.0, + 1512.0, + 1065.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1342.0, + 1457.0, + 1410.0, + 1457.0, + 1410.0, + 1512.0, + 1342.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 1492.0, + 296.0, + 1492.0, + 296.0, + 1565.0, + 284.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 1492.0, + 707.0, + 1492.0, + 707.0, + 1565.0, + 587.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1124.0, + 658.0, + 1124.0, + 658.0, + 1184.0, + 289.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1124.0, + 798.0, + 1124.0, + 798.0, + 1184.0, + 746.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 1124.0, + 1246.0, + 1124.0, + 1246.0, + 1184.0, + 990.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 1124.0, + 1411.0, + 1124.0, + 1411.0, + 1184.0, + 1351.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1171.0, + 486.0, + 1171.0, + 486.0, + 1208.0, + 293.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1171.0, + 815.0, + 1171.0, + 815.0, + 1208.0, + 687.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 1171.0, + 1334.0, + 1171.0, + 1334.0, + 1208.0, + 838.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1361.0, + 1171.0, + 1406.0, + 1171.0, + 1406.0, + 1208.0, + 1361.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1198.0, + 845.0, + 1198.0, + 845.0, + 1247.0, + 290.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 1198.0, + 987.0, + 1198.0, + 987.0, + 1247.0, + 935.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1198.0, + 1408.0, + 1198.0, + 1408.0, + 1247.0, + 1179.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1239.0, + 618.0, + 1239.0, + 618.0, + 1274.0, + 294.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 1239.0, + 1232.0, + 1239.0, + 1232.0, + 1274.0, + 645.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 229.0, + 1046.0, + 229.0, + 1046.0, + 263.0, + 296.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 229.0, + 1403.0, + 229.0, + 1403.0, + 263.0, + 1081.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 257.0, + 494.0, + 257.0, + 494.0, + 298.0, + 293.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 257.0, + 872.0, + 257.0, + 872.0, + 298.0, + 740.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 257.0, + 1212.0, + 257.0, + 1212.0, + 298.0, + 960.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1249.0, + 257.0, + 1407.0, + 257.0, + 1407.0, + 298.0, + 1249.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 289.0, + 488.0, + 289.0, + 488.0, + 324.0, + 295.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 374.0, + 496.0, + 374.0, + 496.0, + 450.0, + 284.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 374.0, + 866.0, + 374.0, + 866.0, + 450.0, + 601.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 374.0, + 1067.0, + 374.0, + 1067.0, + 450.0, + 902.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1367.0, + 374.0, + 1418.0, + 374.0, + 1418.0, + 450.0, + 1367.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 428.0, + 554.0, + 428.0, + 554.0, + 466.0, + 295.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 428.0, + 659.0, + 428.0, + 659.0, + 466.0, + 648.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1966.0, + 830.0, + 1966.0, + 830.0, + 2003.0, + 296.0, + 2003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1966.0, + 915.0, + 1966.0, + 915.0, + 2003.0, + 862.0, + 2003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 1966.0, + 1402.0, + 1966.0, + 1402.0, + 2003.0, + 947.0, + 2003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1994.0, + 297.0, + 1994.0, + 297.0, + 2041.0, + 292.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 1994.0, + 985.0, + 1994.0, + 985.0, + 2041.0, + 406.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 569.0, + 552.0, + 569.0, + 552.0, + 614.0, + 294.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 814.0, + 394.0, + 814.0, + 394.0, + 866.0, + 287.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 814.0, + 612.0, + 814.0, + 612.0, + 866.0, + 534.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 814.0, + 723.0, + 814.0, + 723.0, + 866.0, + 706.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1851.0, + 345.0, + 1851.0, + 345.0, + 1883.0, + 293.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1636.0, + 547.0, + 1636.0, + 547.0, + 1711.0, + 283.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 1636.0, + 919.0, + 1636.0, + 919.0, + 1711.0, + 660.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 1636.0, + 1066.0, + 1636.0, + 1066.0, + 1711.0, + 990.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1636.0, + 1383.0, + 1636.0, + 1383.0, + 1711.0, + 1364.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1703.0, + 767.0, + 1703.0, + 767.0, + 1754.0, + 291.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 1703.0, + 899.0, + 1703.0, + 899.0, + 1754.0, + 849.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1086.0, + 1703.0, + 1407.0, + 1703.0, + 1407.0, + 1754.0, + 1086.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1747.0, + 603.0, + 1747.0, + 603.0, + 1779.0, + 296.0, + 1779.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 450, + 1754, + 1247, + 1754, + 1247, + 2030, + 450, + 2030 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 297, + 228, + 1405, + 228, + 1405, + 385, + 297, + 385 + ], + "score": 0.968 + }, + { + "category_id": 8, + "poly": [ + 502, + 1104, + 1194, + 1104, + 1194, + 1727, + 502, + 1727 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 294, + 584, + 1564, + 584, + 1564, + 1067, + 294, + 1067 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 297, + 1070, + 595, + 1070, + 595, + 1099, + 297, + 1099 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 298, + 1727, + 418, + 1727, + 418, + 1759, + 298, + 1759 + ], + "score": 0.913 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 105, + 299, + 105 + ], + "score": 0.895 + }, + { + "category_id": 1, + "poly": [ + 296, + 550, + 388, + 550, + 388, + 582, + 296, + 582 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.856 + }, + { + "category_id": 0, + "poly": [ + 300, + 426, + 761, + 426, + 761, + 462, + 300, + 462 + ], + "score": 0.839 + }, + { + "category_id": 1, + "poly": [ + 299, + 491, + 636, + 491, + 636, + 525, + 299, + 525 + ], + "score": 0.667 + }, + { + "category_id": 0, + "poly": [ + 299, + 491, + 636, + 491, + 636, + 525, + 299, + 525 + ], + "score": 0.278 + }, + { + "category_id": 14, + "poly": [ + 499, + 1101, + 1197, + 1101, + 1197, + 1737, + 499, + 1737 + ], + "score": 0.96, + "latex": "\\begin{array} { r l } & { \\begin{array} { r l } & { \\lambda _ { h } \\left( \\displaystyle \\sum _ { i = 1 } ^ { N } \\left( \\sum _ { j = 1 } ^ { N } \\omega ( s _ { i } , \\omega _ { i } ^ { ( 1 ) } ) \\cdot ( \\mathbf { r } _ { h } ^ { i } + \\mathbf { r } _ { h } ^ { i } ( \\partial ( s _ { h } ^ { ( 1 ) } , \\mathbf { r } _ { h } ^ { i } ) ) ^ { \\top } \\mathbf { r } _ { h } \\omega _ { 1 1 } \\right) \\right) } \\\\ & { = \\lambda _ { h } \\cdot \\left( \\displaystyle \\sum _ { i = 1 } ^ { N } \\omega ( s _ { i } , \\omega _ { i } ^ { ( 1 ) } ) \\cdot ( \\mathbf { r } _ { h } ^ { i } - \\mathbf { r } _ { h } ^ { i } ( \\mathbf { r } _ { h } ^ { i } , \\mathbf { r } _ { h } ^ { i } ) ) \\right) } \\\\ & { = \\lambda _ { h } \\cdot \\left( \\displaystyle \\sum _ { i = 1 } ^ { N } \\omega ( s _ { i } , \\omega _ { i } ^ { ( 1 ) } ) \\cdot ( \\mathbf { r } _ { h } ^ { i } - \\mathbf { r } _ { h } ^ { i } ( \\mathbf { r } _ { h } ^ { i } , \\mathbf { r } _ { h } ^ { i } ) ) \\right) } \\end{array} } \\\\ & \\begin{array} { r l } & { - \\lambda _ { h } \\cdot 1 \\left( \\displaystyle \\sum _ { i = 1 } ^ { N } \\omega ( s _ { i } , \\omega _ { i } ^ { ( 1 ) } ) \\cdot ( \\mathbf { r } _ { h } ^ { i } - \\mathbf { r } ^ { i } ( \\mathbf { r } _ { h } ^ { i } , \\mathbf { r } _ { h } ^ { i } ) ) \\right) } \\\\ & { = \\lambda _ { h } \\cdot 1 \\left( \\displaystyle \\sum _ { i = 1 } ^ { N } \\omega ( s _ { i } , \\omega _ { i } ^ { ( 1 ) } ) \\cdot ( \\mathbf { r } _ { h } ^ { i } - \\mathbf { r } ^ { i } ( \\mathbf { r } _ { h } ^ { i } , \\mathbf { r } _ { h } ^ { i } ) ) \\right) } \\\\ & { - \\lambda _ { h } \\cdot 1 \\left( \\displaystyle \\sum _ { i = 1 } ^ { N } \\omega ( s _ { i } , \\omega _ { i } ^ { ( 1 ) } , \\mathbf { r } _ { h } ^ { i } ) \\cdot ( \\mathbf { r } _ { h } ^ { i } , \\mathbf { r } _ { h } ^ { i } ) \\right) } \\\\ & = \\lambda _ { h } \\cdot \\displaystyle \\sum _ { i = 1 } ^ { N } \\partial ( s _ { i } , \\omega _ { i } ^ { ( 1 ) } \\end{array} \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 451, + 1755, + 1247, + 1755, + 1247, + 2033, + 451, + 2033 + ], + "score": 0.92, + "latex": "\\begin{array} { l } { \\displaystyle \\hat { \\theta } _ { 1 } - \\theta _ { 1 } = ( \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } \\xi _ { 1 } - \\lambda \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\theta _ { 1 } ) + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } ( \\theta _ { 2 } - \\hat { \\theta } _ { 2 } ) } \\\\ { \\displaystyle = ( \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } \\xi _ { 1 } - \\lambda \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\theta _ { 1 } ) + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } ( \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\xi _ { 2 } - \\lambda \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\theta _ { 2 } ) } \\\\ { \\displaystyle \\quad \\quad + \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } ( \\theta _ { 3 } - \\hat { \\theta } _ { 3 } ) } \\\\ { \\displaystyle \\quad = \\ldots } \\\\ { \\displaystyle \\quad = \\sum _ { h = 1 } ^ { H } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\ldots ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 310, + 582, + 1428, + 582, + 1428, + 1074, + 310, + 1074 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\hat { \\boldsymbol { u } } _ { h } = \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } ( \\displaystyle \\sum _ { i = 1 } ^ { N } \\phi ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } , \\boldsymbol { a } _ { h } ^ { i } ) \\cdot ( \\boldsymbol { r } _ { h } ^ { i } + \\hat { V } _ { h + 1 } ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } ) ) ) } \\\\ & { \\quad = \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } ( \\displaystyle \\sum _ { i = 1 } ^ { N } \\phi ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } , \\boldsymbol { a } _ { h } ^ { i } ) \\cdot ( \\boldsymbol { r } _ { h } ^ { i } + \\hat { Q } _ { h + 1 } ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } , \\boldsymbol { \\pi } ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } ) ) ) ) } \\\\ & { \\quad = \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } ( \\displaystyle \\sum _ { i = 1 } ^ { N } \\phi ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } , \\boldsymbol { a } _ { h } ^ { i } ) \\cdot ( \\boldsymbol { r } _ { h } ^ { i } + \\phi ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } , \\boldsymbol { \\pi } ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } ) ) ) ^ { \\top } \\boldsymbol { \\hat { \\theta } } _ { h + 1 } ) ) } \\\\ & { \\quad = \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } ( \\displaystyle \\sum _ { i = 1 } ^ { N } \\phi ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } , \\boldsymbol { a } _ { h } ^ { i } ) \\cdot ( \\boldsymbol { r } _ { h } ^ { i } + \\phi ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } , \\boldsymbol { \\pi } ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } ) ) ) ^ { \\top } \\boldsymbol { \\hat { \\theta } } _ { h + 1 } ) ) } \\\\ & \\quad = \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } ( \\displaystyle \\sum _ { i = 1 } ^ { N } \\phi ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } , \\boldsymbol { a } _ { h } ^ { i } ) \\cdot ( \\boldsymbol { r } _ { h } ^ { i } + \\phi ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } , \\boldsymbol { \\pi } ( \\boldsymbol { \\hat { s } } _ { h } ^ { i } ) ) ^ \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 688, + 319, + 879, + 319, + 879, + 355, + 688, + 355 + ], + "score": 0.92, + "latex": "\\Omega ( ( d / 2 - 1 ) ^ { H / 2 } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 322, + 424, + 322, + 424, + 350, + 298, + 350 + ], + "score": 0.89, + "latex": "\\pi : { \\mathcal { S } } A" + }, + { + "category_id": 14, + "poly": [ + 459, + 667, + 1577, + 667, + 1577, + 1551, + 459, + 1551 + ], + "score": 0.25, + "latex": "\\begin{array} { r l } & { \\frac { 1 } { \\sqrt { 3 } } \\sum _ { k \\geq 0 , k \\leq 1 } \\bar { \\zeta } _ { k } \\bigg ( \\frac { 1 } { 2 } \\eta _ { k } ^ { 2 } \\bigg ( \\mathbb { E } _ { k } \\| \\hat { \\zeta } _ { k } \\| ^ { 2 } \\eta _ { k } ^ { 2 } \\bigg ( \\mathbb { E } _ { k } \\| \\hat { \\zeta } _ { k } \\| ^ { 2 } \\eta _ { k } ^ { 2 } \\bigg ) \\bigg ) } \\\\ & { \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\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 \\end{array}" + }, + { + "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, + 2122.0, + 832.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 423.0, + 766.0, + 423.0, + 766.0, + 466.0, + 295.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 489.0, + 639.0, + 489.0, + 639.0, + 529.0, + 295.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 229.0, + 1405.0, + 229.0, + 1405.0, + 266.0, + 296.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 298.0, + 294.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 289.0, + 1405.0, + 289.0, + 1405.0, + 329.0, + 294.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 313.0, + 297.0, + 313.0, + 297.0, + 363.0, + 290.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 313.0, + 687.0, + 313.0, + 687.0, + 363.0, + 425.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 313.0, + 1408.0, + 313.0, + 1408.0, + 363.0, + 880.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 349.0, + 944.0, + 349.0, + 944.0, + 387.0, + 294.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1065.0, + 458.0, + 1065.0, + 458.0, + 1103.0, + 295.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1723.0, + 423.0, + 1723.0, + 423.0, + 1763.0, + 295.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 543.0, + 395.0, + 543.0, + 395.0, + 591.0, + 293.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 489.0, + 639.0, + 489.0, + 639.0, + 529.0, + 295.0, + 529.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 310, + 1159, + 1386, + 1159, + 1386, + 1404, + 310, + 1404 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 295, + 856, + 1448, + 856, + 1448, + 1098, + 295, + 1098 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 320, + 1463, + 1374, + 1463, + 1374, + 1712, + 320, + 1712 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 722, + 1975, + 977, + 1975, + 977, + 2045, + 722, + 2045 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 562, + 598, + 1138, + 598, + 1138, + 675, + 562, + 675 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 691, + 739, + 1005, + 739, + 1005, + 783, + 691, + 783 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 738, + 1774, + 958, + 1774, + 958, + 1820, + 738, + 1820 + ], + "score": 0.934 + }, + { + "category_id": 8, + "poly": [ + 601, + 494, + 1096, + 494, + 1096, + 568, + 601, + 568 + ], + "score": 0.934 + }, + { + "category_id": 8, + "poly": [ + 565, + 255, + 1132, + 255, + 1132, + 304, + 565, + 304 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 299, + 685, + 1220, + 685, + 1220, + 723, + 299, + 723 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 296, + 813, + 406, + 813, + 406, + 844, + 296, + 844 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 298, + 435, + 1400, + 435, + 1400, + 495, + 298, + 495 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 296, + 1741, + 577, + 1741, + 577, + 1777, + 296, + 1777 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 299, + 230, + 459, + 230, + 459, + 261, + 299, + 261 + ], + "score": 0.92 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 814, + 73, + 814, + 106, + 298, + 106 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 296, + 1417, + 410, + 1417, + 410, + 1450, + 296, + 1450 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 293, + 393, + 1198, + 393, + 1198, + 430, + 293, + 430 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 296, + 1927, + 754, + 1927, + 754, + 1961, + 296, + 1961 + ], + "score": 0.915 + }, + { + "category_id": 8, + "poly": [ + 359, + 1864, + 1331, + 1864, + 1331, + 1918, + 359, + 1918 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 295, + 1110, + 503, + 1110, + 503, + 1146, + 295, + 1146 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 296, + 575, + 347, + 575, + 347, + 605, + 296, + 605 + ], + "score": 0.905 + }, + { + "category_id": 1, + "poly": [ + 296, + 1824, + 345, + 1824, + 345, + 1853, + 296, + 1853 + ], + "score": 0.893 + }, + { + "category_id": 0, + "poly": [ + 298, + 336, + 667, + 336, + 667, + 370, + 298, + 370 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 866, + 2087, + 866, + 2113, + 836, + 2113 + ], + "score": 0.872 + }, + { + "category_id": 14, + "poly": [ + 324, + 1462, + 1378, + 1462, + 1378, + 1714, + 324, + 1714 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\quad \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\boldsymbol { \\Lambda } } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\lambda \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } \\theta _ { h } \\| _ { \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\boldsymbol { \\Lambda } } _ { h + 1 } ^ { - 1 / 2 } \\| _ { 2 } \\Big ) \\cdot \\lambda ^ { 2 } \\cdot \\| \\theta _ { h } \\| _ { \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\boldsymbol { \\Lambda } } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\lambda \\cdot H ^ { 2 } d . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 599, + 489, + 1097, + 489, + 1097, + 568, + 599, + 568 + ], + "score": 0.93, + "latex": "\\left\\| \\frac { 1 } { N } \\Phi _ { h } ^ { \\top } \\Phi _ { h } - \\Lambda _ { h } \\right\\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) / N } ." + }, + { + "category_id": 14, + "poly": [ + 722, + 1975, + 974, + 1975, + 974, + 2044, + 722, + 2044 + ], + "score": 0.93, + "latex": "\\hat { \\Lambda } _ { h } \\succeq N \\Lambda _ { h } \\succeq \\frac { N } { C _ { h } } \\overline { { \\Lambda } } _ { h } ," + }, + { + "category_id": 13, + "poly": [ + 482, + 684, + 779, + 684, + 779, + 723, + 482, + 723 + ], + "score": 0.93, + "latex": "\\lambda = C H \\sqrt { d \\log ( d H / \\delta ) N }" + }, + { + "category_id": 14, + "poly": [ + 312, + 1159, + 1387, + 1159, + 1387, + 1408, + 312, + 1408 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\quad \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\| \\Phi _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\| _ { 2 } \\cdot \\| \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { 2 } ^ { 2 } } \\\\ & { \\leq \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\| \\Phi _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\| _ { 2 } \\cdot \\| \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\cdot \\cdot \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\| _ { 2 } ^ { 2 } } \\\\ & \\leq \\| \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { 1 } \\hat { \\Lambda } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\cdot \\displaystyle \\prod _ { h ^ { \\prime } = 1 } ^ { h - 1 } \\Big ( \\| \\Phi _ { h ^ { \\prime } } \\hat { \\Lambda } _ { h ^ { \\prime } } ^ { - 1 } \\Phi _ { h ^ { \\prime } } ^ { \\top } \\| _ { 2 } \\cdot \\| \\hat { \\Phi } _ { h ^ { \\prime } + 1 } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ^ { \\top } \\overline { { \\Phi } } _ { h ^ { \\prime } + 1 } ) \\hat { \\Lambda } _ h ^ { \\prime } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 860, + 436, + 999, + 436, + 999, + 471, + 860, + 471 + ], + "score": 0.92, + "latex": "1 - \\delta / ( 4 H )" + }, + { + "category_id": 14, + "poly": [ + 310, + 852, + 1428, + 852, + 1428, + 1103, + 310, + 1103 + ], + "score": 0.92, + "latex": "\\begin{array} { l } { \\displaystyle ( { \\mathcal Q } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } } \\\\ { \\displaystyle \\leq H \\cdot \\left( \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot ( \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } - \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } ) \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } \\right) } \\\\ { \\displaystyle \\leq 2 H \\cdot \\left( \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } + \\sum _ { h = 1 } ^ { H } \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdot \\cdot \\cdot \\cdot \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 400, + 1112, + 493, + 1112, + 493, + 1146, + 400, + 1146 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 377, + 1743, + 469, + 1743, + 469, + 1777, + 377, + 1777 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 564, + 437, + 662, + 437, + 662, + 471, + 564, + 471 + ], + "score": 0.92, + "latex": "h \\in [ H ]" + }, + { + "category_id": 13, + "poly": [ + 974, + 688, + 1111, + 688, + 1111, + 722, + 974, + 722 + ], + "score": 0.92, + "latex": "1 - \\delta / ( 4 H )" + }, + { + "category_id": 14, + "poly": [ + 558, + 597, + 1137, + 597, + 1137, + 675, + 558, + 675 + ], + "score": 0.91, + "latex": "\\left\\| \\frac { 1 } { N } \\overline { { \\Phi } } _ { h + 1 } \\overline { { \\Phi } } _ { h + 1 } - \\overline { { \\Lambda } } _ { h + 1 } \\right\\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) / N } ." + }, + { + "category_id": 14, + "poly": [ + 691, + 739, + 1007, + 739, + 1007, + 780, + 691, + 780 + ], + "score": 0.89, + "latex": "\\hat { \\Lambda } _ { h } = \\Phi _ { h } ^ { \\top } \\Phi _ { h } + \\lambda I \\succeq N \\Lambda _ { h } ." + }, + { + "category_id": 14, + "poly": [ + 568, + 254, + 1130, + 254, + 1130, + 304, + 568, + 304 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { ( Q ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } = \\| \\theta _ { 1 } - \\hat { \\theta } _ { 1 } \\| _ { \\bar { \\Lambda } _ { 1 } } ^ { 2 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 361, + 1866, + 1338, + 1866, + 1338, + 1915, + 361, + 1915 + ], + "score": 0.84, + "latex": "\\begin{array} { r } { \\lVert \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } ) \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } \\leq \\lVert N \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } + \\lVert \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } - N \\overline { { \\Lambda } } _ { h } ) \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\rVert _ { 2 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 740, + 1773, + 959, + 1773, + 959, + 1818, + 740, + 1818 + ], + "score": 0.81, + "latex": "\\| \\Phi _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\| _ { 2 } \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 1330, + 439, + 1354, + 439, + 1354, + 465, + 1330, + 465 + ], + "score": 0.78, + "latex": "C" + }, + { + "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": [ + 294.0, + 334.0, + 668.0, + 334.0, + 668.0, + 372.0, + 294.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 680.0, + 481.0, + 680.0, + 481.0, + 729.0, + 293.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 680.0, + 973.0, + 680.0, + 973.0, + 729.0, + 780.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 680.0, + 1222.0, + 680.0, + 1222.0, + 729.0, + 1112.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 810.0, + 408.0, + 810.0, + 408.0, + 847.0, + 294.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 432.0, + 563.0, + 432.0, + 563.0, + 474.0, + 293.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 432.0, + 859.0, + 432.0, + 859.0, + 474.0, + 663.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 432.0, + 1329.0, + 432.0, + 1329.0, + 474.0, + 1000.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 432.0, + 1405.0, + 432.0, + 1405.0, + 474.0, + 1355.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 463.0, + 360.0, + 463.0, + 360.0, + 503.0, + 293.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1741.0, + 376.0, + 1741.0, + 376.0, + 1778.0, + 295.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 1741.0, + 579.0, + 1741.0, + 579.0, + 1778.0, + 470.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 226.0, + 461.0, + 226.0, + 461.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1412.0, + 414.0, + 1412.0, + 414.0, + 1457.0, + 295.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 393.0, + 1200.0, + 393.0, + 1200.0, + 433.0, + 294.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1922.0, + 757.0, + 1922.0, + 757.0, + 1965.0, + 295.0, + 1965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1106.0, + 399.0, + 1106.0, + 399.0, + 1149.0, + 294.0, + 1149.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 494.0, + 1106.0, + 504.0, + 1106.0, + 504.0, + 1149.0, + 494.0, + 1149.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 576.0, + 347.0, + 576.0, + 347.0, + 606.0, + 291.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1825.0, + 344.0, + 1825.0, + 344.0, + 1854.0, + 293.0, + 1854.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 294, + 650, + 1441, + 650, + 1441, + 915, + 294, + 915 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 389, + 978, + 1306, + 978, + 1306, + 1073, + 389, + 1073 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 650, + 551, + 1049, + 551, + 1049, + 603, + 650, + 603 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 683, + 368, + 1014, + 368, + 1014, + 418, + 683, + 418 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 513, + 282, + 1184, + 282, + 1184, + 332, + 513, + 332 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 297, + 606, + 418, + 606, + 418, + 640, + 297, + 640 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 294, + 495, + 1411, + 495, + 1411, + 555, + 294, + 555 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 297, + 72, + 815, + 72, + 815, + 107, + 297, + 107 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 297, + 342, + 365, + 342, + 365, + 375, + 297, + 375 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 295, + 929, + 877, + 929, + 877, + 963, + 295, + 963 + ], + "score": 0.91 + }, + { + "category_id": 8, + "poly": [ + 530, + 443, + 1170, + 443, + 1170, + 491, + 530, + 491 + ], + "score": 0.904 + }, + { + "category_id": 1, + "poly": [ + 296, + 420, + 345, + 420, + 345, + 451, + 296, + 451 + ], + "score": 0.901 + }, + { + "category_id": 1, + "poly": [ + 289, + 221, + 1349, + 221, + 1349, + 268, + 289, + 268 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 866, + 2088, + 866, + 2113, + 834, + 2113 + ], + "score": 0.852 + }, + { + "category_id": 13, + "poly": [ + 461, + 223, + 764, + 223, + 764, + 267, + 461, + 267 + ], + "score": 0.93, + "latex": "\\| N \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\overline { { \\Lambda } } _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 / 2 } \\| \\le C _ { h }" + }, + { + "category_id": 14, + "poly": [ + 290, + 651, + 1391, + 651, + 1391, + 921, + 290, + 921 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\quad \\quad \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } \\xi _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } + \\left\\| \\hat { \\Lambda } _ { 1 } ^ { - 1 } \\Phi _ { 1 } ^ { \\top } \\overline { { \\Phi } } _ { 2 } \\hat { \\Lambda } _ { 2 } ^ { - 1 } \\Phi _ { 2 } ^ { \\top } \\overline { { \\Phi } } _ { 3 } \\cdots \\lambda \\hat { \\Lambda } _ { h } ^ { - 1 } \\theta _ { h } \\right\\| _ { \\overline { { \\Lambda } } _ { 1 } } ^ { 2 } } \\\\ & { \\leq \\frac { C _ { 1 } } { N } ( C _ { 2 } + C \\sqrt { d \\log ( d / \\delta ) N } / \\lambda ) \\times \\cdots \\times ( C _ { h } + C \\sqrt { d \\log ( d / \\delta ) N } / \\lambda ) \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + \\lambda H } \\\\ & { \\leq \\frac { C _ { 1 } } { N } ( C _ { 2 } + 1 / H ) \\times \\cdots \\times ( C _ { h } + 1 / H ) \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + \\lambda H ^ { 2 } d ) } \\\\ & { \\leq \\frac { e } { N } C _ { 1 } \\times C _ { 2 } \\times \\cdots \\times C _ { h } \\times ( C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) + C d H ^ { 3 } \\sqrt { d \\log ( d H / \\delta ) N } ) . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 390, + 976, + 1306, + 976, + 1306, + 1073, + 390, + 1073 + ], + "score": 0.92, + "latex": "\\mathbb { E } _ { s _ { 1 } } [ ( Q _ { 1 } ^ { \\pi } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) - \\hat { Q } _ { 1 } ( s _ { 1 } , \\pi ( s _ { 1 } ) ) ) ^ { 2 } ] \\leq c \\cdot \\left( \\prod _ { h = 1 } ^ { H } C _ { h } \\right) \\cdot d H ^ { 5 } \\cdot \\sqrt { \\frac { d \\log ( d H / \\delta ) } { N } } ." + }, + { + "category_id": 14, + "poly": [ + 648, + 551, + 1051, + 551, + 1051, + 602, + 648, + 602 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\| \\xi _ { h } \\| _ { \\Phi _ { h } \\hat { \\Lambda } _ { h } ^ { - 1 } \\Phi _ { h } ^ { \\top } } ^ { 2 } \\le C ^ { \\prime } H ^ { 2 } d \\log ( H / \\delta ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1007, + 495, + 1144, + 495, + 1144, + 529, + 1007, + 529 + ], + "score": 0.91, + "latex": "1 - \\delta / ( 4 H )" + }, + { + "category_id": 13, + "poly": [ + 341, + 932, + 407, + 932, + 407, + 959, + 341, + 959 + ], + "score": 0.89, + "latex": "c > 0" + }, + { + "category_id": 14, + "poly": [ + 514, + 280, + 1182, + 280, + 1182, + 330, + 514, + 330 + ], + "score": 0.86, + "latex": "\\begin{array} { r } { \\| \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } - N \\overline { { \\boldsymbol { \\Lambda } } } _ { h } ) \\hat { \\boldsymbol { \\Lambda } } _ { h } ^ { - 1 / 2 } \\| _ { 2 } \\leq C \\sqrt { d \\log ( d H / \\delta ) N } / \\lambda . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 682, + 368, + 1016, + 368, + 1016, + 415, + 682, + 415 + ], + "score": 0.85, + "latex": "\\| \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\overline { { \\boldsymbol { \\Lambda } } } _ { 1 } \\hat { \\boldsymbol { \\Lambda } } _ { 1 } ^ { - 1 / 2 } \\| _ { 2 } \\leq C _ { 1 } / N ." + }, + { + "category_id": 13, + "poly": [ + 1362, + 496, + 1393, + 496, + 1393, + 523, + 1362, + 523 + ], + "score": 0.85, + "latex": "C ^ { \\prime }" + }, + { + "category_id": 14, + "poly": [ + 527, + 442, + 1168, + 442, + 1168, + 490, + 527, + 490 + ], + "score": 0.85, + "latex": "\\begin{array} { r } { \\| \\hat { \\boldsymbol \\Lambda } _ { h } ^ { - 1 / 2 } ( \\overline { { \\Phi } } _ { h } ^ { \\top } \\overline { { \\Phi } } _ { h } ) \\hat { \\boldsymbol \\Lambda } _ { h } ^ { - 1 / 2 } \\| _ { 2 } \\leq C _ { h } + C \\sqrt { d \\log ( d H / \\delta ) N } / \\lambda . } \\end{array}" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 815.0, + 73.0, + 815.0, + 108.0, + 296.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": [ + 294.0, + 603.0, + 423.0, + 603.0, + 423.0, + 643.0, + 294.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 493.0, + 1006.0, + 493.0, + 1006.0, + 531.0, + 293.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 493.0, + 1361.0, + 493.0, + 1361.0, + 531.0, + 1145.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 493.0, + 1405.0, + 493.0, + 1405.0, + 531.0, + 1394.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 526.0, + 397.0, + 526.0, + 397.0, + 560.0, + 295.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 340.0, + 372.0, + 340.0, + 372.0, + 381.0, + 294.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 929.0, + 340.0, + 929.0, + 340.0, + 966.0, + 295.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 929.0, + 875.0, + 929.0, + 875.0, + 966.0, + 408.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 422.0, + 344.0, + 422.0, + 344.0, + 451.0, + 293.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 215.0, + 460.0, + 215.0, + 460.0, + 275.0, + 285.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 215.0, + 1360.0, + 215.0, + 1360.0, + 275.0, + 765.0, + 275.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/5jRVa89sZk/5jRVa89sZk_layout.pdf b/parse/train/5jRVa89sZk/5jRVa89sZk_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..388ffd9a42b74ad0697b9b1ac708a7554b1f738e --- /dev/null +++ b/parse/train/5jRVa89sZk/5jRVa89sZk_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d0bb8ecd77915a5756020bc3a9a49d2cc9bd1e7e618b3e6d429a40168d4bfcad +size 664425 diff --git a/parse/train/5jRVa89sZk/5jRVa89sZk_origin.pdf b/parse/train/5jRVa89sZk/5jRVa89sZk_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..895297f0f90d93042cffcae86527b9262dc05901 --- /dev/null +++ b/parse/train/5jRVa89sZk/5jRVa89sZk_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:315816e1e4da9eba81586032e107d54da91b890cc9e6514871d073664234c7dd +size 538581 diff --git a/parse/train/5jRVa89sZk/5jRVa89sZk_span.pdf b/parse/train/5jRVa89sZk/5jRVa89sZk_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..0a69660b3bbacbf2007dd3c194219e69f3eed4a7 --- /dev/null +++ b/parse/train/5jRVa89sZk/5jRVa89sZk_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fe3c3801ccbf0b8342a770947a00a717a469e0ba09bdbbf00db77cc0befc5594 +size 666050 diff --git a/parse/train/5jaqt-Hsqir/5jaqt-Hsqir_layout.pdf b/parse/train/5jaqt-Hsqir/5jaqt-Hsqir_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7482d0ab7f7b245f2a7d49e821882cc00fe8adb9 --- /dev/null +++ b/parse/train/5jaqt-Hsqir/5jaqt-Hsqir_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:cae683819b22ebfe16578deb1eca4f921cc6e044b80708f13eaf688afeb1a394 +size 1140586 diff --git a/parse/train/5jaqt-Hsqir/5jaqt-Hsqir_origin.pdf b/parse/train/5jaqt-Hsqir/5jaqt-Hsqir_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a27788c69465c42d6501ab7267ed4d27bc8d1a17 --- /dev/null +++ b/parse/train/5jaqt-Hsqir/5jaqt-Hsqir_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9d76ef4fa6e91ff2ac4b5a2622d05b2212d180f5c0116f67f752744918d90913 +size 988606 diff --git a/parse/train/5jaqt-Hsqir/5jaqt-Hsqir_span.pdf b/parse/train/5jaqt-Hsqir/5jaqt-Hsqir_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b513d6a09d0157af28bb94f82bbf010c0c2376ed --- /dev/null +++ b/parse/train/5jaqt-Hsqir/5jaqt-Hsqir_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4f5fc1c55633be8c06d87c5ab3ae278a42ae88dfe549df2fe67732eb9cc4af48 +size 1159616 diff --git a/parse/train/66H4g_OHdnl/66H4g_OHdnl_layout.pdf b/parse/train/66H4g_OHdnl/66H4g_OHdnl_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9ba6f70adf67e4a6ff62e9fe3f80e01508754496 --- /dev/null +++ b/parse/train/66H4g_OHdnl/66H4g_OHdnl_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2450d7cb275e774e3d5781e0b8b40090be77f26c75e9d26fe731d05b6c8ff663 +size 2200170 diff --git a/parse/train/66H4g_OHdnl/66H4g_OHdnl_origin.pdf b/parse/train/66H4g_OHdnl/66H4g_OHdnl_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..105ce62b286a839f2a0f4189382081737eb87566 --- /dev/null +++ b/parse/train/66H4g_OHdnl/66H4g_OHdnl_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e3d5a45b8c861322510f1036d2da79d3d4f651efd69eae1735072a63f6e86d6e +size 1667813 diff --git a/parse/train/66H4g_OHdnl/66H4g_OHdnl_span.pdf b/parse/train/66H4g_OHdnl/66H4g_OHdnl_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2253c97acc5cc38dc24e4917c337504bd3890e07 --- /dev/null +++ b/parse/train/66H4g_OHdnl/66H4g_OHdnl_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:dd328f5c56f504187af62c11d6df4064df6abac881d6d48c56d8967f9c31436e +size 2200101 diff --git a/parse/train/7dpmlkBuJFC/7dpmlkBuJFC_layout.pdf b/parse/train/7dpmlkBuJFC/7dpmlkBuJFC_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..da6ca3306eafb6510ddc18496f243c4b01b6aced --- /dev/null +++ b/parse/train/7dpmlkBuJFC/7dpmlkBuJFC_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7bf7a64cbe59ece2073552dc9d80ea117fe608e2e217be5f57f1d75366361ca5 +size 4155986 diff --git a/parse/train/7dpmlkBuJFC/7dpmlkBuJFC_origin.pdf b/parse/train/7dpmlkBuJFC/7dpmlkBuJFC_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e4a50befa4a5e0acc091ce53f0b196078fde226c --- /dev/null +++ b/parse/train/7dpmlkBuJFC/7dpmlkBuJFC_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a4f57de29ede0e7ae375597fd4357c8b098e3d8dc85191ddc228e7ce837d84d5 +size 3643859 diff --git a/parse/train/7dpmlkBuJFC/7dpmlkBuJFC_span.pdf b/parse/train/7dpmlkBuJFC/7dpmlkBuJFC_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6f9b094827415f971f3d8040c2582907b71d4141 --- /dev/null +++ b/parse/train/7dpmlkBuJFC/7dpmlkBuJFC_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:69e3af92e7e259fb3a7ed5b02b95f825c8ba22246629266a403204c1c5aad415 +size 4182774 diff --git a/parse/train/ARFshOO1Iu/ARFshOO1Iu_layout.pdf b/parse/train/ARFshOO1Iu/ARFshOO1Iu_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7500123e2d593e882b0e88015f44906458bb265b --- /dev/null +++ b/parse/train/ARFshOO1Iu/ARFshOO1Iu_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:afa2e5801e83a419445d0c3a943e1928eae95d8b31350f2c85717d9c1491b63a +size 597599 diff --git a/parse/train/ARFshOO1Iu/ARFshOO1Iu_origin.pdf b/parse/train/ARFshOO1Iu/ARFshOO1Iu_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..33c22c3a7e36ab0256c4da106faeaa53877cbe1b --- /dev/null +++ b/parse/train/ARFshOO1Iu/ARFshOO1Iu_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:53072b177ecf50c0edfcbfc331af6003579406dd08c603ccc5f61adaabf40965 +size 423255 diff --git a/parse/train/ARFshOO1Iu/ARFshOO1Iu_span.pdf b/parse/train/ARFshOO1Iu/ARFshOO1Iu_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d37245fae31d5a553eda05aaa6c763532c8c33a3 --- /dev/null +++ b/parse/train/ARFshOO1Iu/ARFshOO1Iu_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5a6b63210b48d16b07e84de427ec4e67def5683febd6c63a7f472ada8ab58f9d +size 597939 diff --git a/parse/train/B1-q5Pqxl/B1-q5Pqxl_layout.pdf b/parse/train/B1-q5Pqxl/B1-q5Pqxl_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..05a2ef402a11ab234b725ebaaa23ad4e92aba986 --- /dev/null +++ b/parse/train/B1-q5Pqxl/B1-q5Pqxl_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ba1625036cfef92b68de97ed47a8c75dcba8bbd302616f7b6e157622954645ad +size 674287 diff --git a/parse/train/B1-q5Pqxl/B1-q5Pqxl_origin.pdf b/parse/train/B1-q5Pqxl/B1-q5Pqxl_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..52c3d54bf4fb84e34801bf810e5980acb2dd262f --- /dev/null +++ b/parse/train/B1-q5Pqxl/B1-q5Pqxl_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:73af3b74498cbfae9dbd88f629f858b339665420102da29cb3fd23859ec23228 +size 547030 diff --git a/parse/train/B1-q5Pqxl/B1-q5Pqxl_span.pdf b/parse/train/B1-q5Pqxl/B1-q5Pqxl_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..648dec62489f64e5c25e3c8ff92148223435c9b6 --- /dev/null +++ b/parse/train/B1-q5Pqxl/B1-q5Pqxl_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6867715159518f6b68ecdbd0e81719873946523f978d6c3c7172fda54cb0d7a6 +size 675929 diff --git a/parse/train/B1evfa4tPB/B1evfa4tPB_layout.pdf b/parse/train/B1evfa4tPB/B1evfa4tPB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f5d41ef1f5ced32b01857ae9dcabe017683e8403 --- /dev/null +++ b/parse/train/B1evfa4tPB/B1evfa4tPB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5d46195acd86efc43ca585657ab725be5849590d2c75a155b9b51497ac9a8cd5 +size 1064398 diff --git a/parse/train/B1evfa4tPB/B1evfa4tPB_origin.pdf b/parse/train/B1evfa4tPB/B1evfa4tPB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..fb0d769e32b70e645a47d2852c88168261615397 --- /dev/null +++ b/parse/train/B1evfa4tPB/B1evfa4tPB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f9d260d2b3c331638600e4c11a76bca1e0ef712252d73ca2dfd919f95138c15f +size 784635 diff --git a/parse/train/B1evfa4tPB/B1evfa4tPB_span.pdf b/parse/train/B1evfa4tPB/B1evfa4tPB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8bad132a41b3ac3f12f6f1f2e603c66509eddf4e --- /dev/null +++ b/parse/train/B1evfa4tPB/B1evfa4tPB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a0ca5733a9282986fd234612dc5c3ecc6b6ee31b3570ce55e869578d151fbf1e +size 1080156 diff --git a/parse/train/B1l8BtlCb/B1l8BtlCb_layout.pdf b/parse/train/B1l8BtlCb/B1l8BtlCb_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2dd3fb70eca7f23f1a45d6fb18b8f2dcf2b87830 --- /dev/null +++ b/parse/train/B1l8BtlCb/B1l8BtlCb_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e91f5488c8a4cd345d861deeab3c227ce8a223cd40c89fd779c992be6adc46fa +size 864614 diff --git a/parse/train/B1l8BtlCb/B1l8BtlCb_origin.pdf b/parse/train/B1l8BtlCb/B1l8BtlCb_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6654ce853053dd95dec4e260ba61cf3b5bbc9126 --- /dev/null +++ b/parse/train/B1l8BtlCb/B1l8BtlCb_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:24d4069e207712f98043472c0f43d414a685de2d3a71ee1ad9313c92818e2563 +size 746276 diff --git a/parse/train/B1l8BtlCb/B1l8BtlCb_span.pdf b/parse/train/B1l8BtlCb/B1l8BtlCb_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5e524392ae168b9f431e4d62451fa3fbca780d93 --- /dev/null +++ b/parse/train/B1l8BtlCb/B1l8BtlCb_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2231c51e5a2d583a304ee14b2f5bc81a85bf7b6a1027a2a6e1758b88f0457a9a +size 862559 diff --git a/parse/train/B1lgUkBFwr/B1lgUkBFwr_span.pdf b/parse/train/B1lgUkBFwr/B1lgUkBFwr_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7017e1dbda121a934cdbd5cd78898b660293f5d3 --- /dev/null +++ b/parse/train/B1lgUkBFwr/B1lgUkBFwr_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b80b0697cee86d8555178c996d5fce2df6ea281be64e60abb63e2dd6a4971838 +size 3404916 diff --git a/parse/train/B1lz-3Rct7/B1lz-3Rct7_layout.pdf b/parse/train/B1lz-3Rct7/B1lz-3Rct7_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b112c0888e440f3177177df083948bbb2f148086 --- /dev/null +++ b/parse/train/B1lz-3Rct7/B1lz-3Rct7_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8becc4e69a2e6c15f2497f2b41359e4f7e27adcc100240d1fd7c8f44cbf811d6 +size 5946416 diff --git a/parse/train/B1lz-3Rct7/B1lz-3Rct7_origin.pdf b/parse/train/B1lz-3Rct7/B1lz-3Rct7_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..171a65cdb2ef40f0d9d779b4fc6655c19056f46d --- /dev/null +++ b/parse/train/B1lz-3Rct7/B1lz-3Rct7_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0a13e5d39d95e2ccd18967d4c4f00ff7270299adf5c03b51b921c8b9de2c774c +size 5715017 diff --git a/parse/train/B1lz-3Rct7/B1lz-3Rct7_span.pdf b/parse/train/B1lz-3Rct7/B1lz-3Rct7_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..32bb672e4fd67b53f8551d6e5ddecbb8ef62acf1 --- /dev/null +++ b/parse/train/B1lz-3Rct7/B1lz-3Rct7_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a1af6772a26ce2eef3754c39032d6de7c39387110c81c417e7d3c7509bbb8ba1 +size 5946857 diff --git a/parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_layout.pdf b/parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5764df72321b27718c1b6be42b4e5e3af1ecf705 --- /dev/null +++ b/parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0890df97c6f6aa856cda8c341d6091ac0c13a1d8c95b893d85cdc4cf3a7aae09 +size 4970645 diff --git a/parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_origin.pdf b/parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..030e0543e070d9007109cec8c9fe63424fbdfb6e --- /dev/null +++ b/parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:28db19ea9092872af67a0341480e1995a58334206d523479ab009e5c88ab90df +size 4692329 diff --git a/parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_span.pdf b/parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c603297861c0c45e6ba1f6ec1c2faf20808c5751 --- /dev/null +++ b/parse/train/BEs-Q1ggdwT/BEs-Q1ggdwT_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0b14928a8ae973e96db0e502173df340314d418b124fad7c65b85282ac314a1e +size 4976781 diff --git a/parse/train/BJO-BuT1g/BJO-BuT1g_layout.pdf b/parse/train/BJO-BuT1g/BJO-BuT1g_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..385dba2186c5d8e0ec17f656aa38f17fda51e849 --- /dev/null +++ b/parse/train/BJO-BuT1g/BJO-BuT1g_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0c24783171b24e9ab9b775e19514247d4473cd8163d81ecaf2fd44c7e82cbb31 +size 44178252 diff --git a/parse/train/BJO-BuT1g/BJO-BuT1g_origin.pdf b/parse/train/BJO-BuT1g/BJO-BuT1g_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a2cef735a5b713d91592cc02086314ae7954cf83 --- /dev/null +++ b/parse/train/BJO-BuT1g/BJO-BuT1g_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a690a2d9e56ca528171e50fe0e8d392d8e1621b8c248f628e8cd9d1ca6eb2d36 +size 44023502 diff --git a/parse/train/BJO-BuT1g/BJO-BuT1g_span.pdf b/parse/train/BJO-BuT1g/BJO-BuT1g_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6f95e25292650ce439a01a6da5d2a4ec2e672d90 --- /dev/null +++ b/parse/train/BJO-BuT1g/BJO-BuT1g_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f9e30a7f6089b126be13add1ac8e402cfed79e5e10c7aad78d858060ed556f07 +size 44171217 diff --git a/parse/train/BJg7x1HFvB/BJg7x1HFvB_layout.pdf b/parse/train/BJg7x1HFvB/BJg7x1HFvB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9f33660075d2d669d935b10888b2a4ae121598d8 --- /dev/null +++ b/parse/train/BJg7x1HFvB/BJg7x1HFvB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:35127c7b6ac3163808cb688d31a71672c073acaa1ab92e818c334dad12292e1d +size 580288 diff --git a/parse/train/BJxI5gHKDr/BJxI5gHKDr.md b/parse/train/BJxI5gHKDr/BJxI5gHKDr.md new file mode 100644 index 0000000000000000000000000000000000000000..b50bfaa26befc477fff704b216b61077d9ef951e --- /dev/null +++ b/parse/train/BJxI5gHKDr/BJxI5gHKDr.md @@ -0,0 +1,485 @@ +# PITFALLS OF IN-DOMAIN UNCERTAINTY ESTIMATION AND ENSEMBLING IN DEEP LEARNING + +Arsenii Ashukha ∗ Samsung AI Center Moscow, HSE‡ aashukha@bayesgroup.ru + +Alexander Lyzhov ∗ Samsung AI Center Moscow, Skoltech†, HSE§ alyzhov@bayesgroup.ru + +Dmitry Molchanov ∗ Samsung AI Center Moscow, HSE‡ dmolch@bayesgroup.ru + +Dmitry Vetrov HSE‡, Samsung AI Center Moscow dvetrov@bayesgroup.ru + +# ABSTRACT + +Uncertainty estimation and ensembling methods go hand-in-hand. Uncertainty estimation is one of the main benchmarks for assessment of ensembling performance. At the same time, deep learning ensembles have provided state-of-the-art results in uncertainty estimation. In this work, we focus on in-domain uncertainty for image classification. We explore the standards for its quantification and point out pitfalls of existing metrics. Avoiding these pitfalls, we perform a broad study of different ensembling techniques. To provide more insight in this study, we introduce the deep ensemble equivalent score (DEE) and show that many sophisticated ensembling techniques are equivalent to an ensemble of only few independently trained networks in terms of test performance. + +# video / code / blog post + +# 1 INTRODUCTION + +Deep neural networks (DNNs) have become one of the most popular families of machine learning models. The predictive performance of DNNs for classification is often measured in terms of accuracy. However, DNNs have been shown to yield inaccurate and unreliable probability estimates, or predictive uncertainty (Guo et al., 2017). This has brought considerable attention to the problem of uncertainty estimation with deep neural networks. + +There are many faces to uncertainty estimation. Different desirable uncertainty estimation properties of a model require different settings and metrics to capture them. Out-of-domain uncertainty of the model is measured on the data that does not follow the same distribution as the training dataset (out-of-domain data). Out-of-domain data can include images corrupted with rotations or blurring, adversarial attacks (Szegedy et al., 2013) or data points from a completely different dataset. The model is expected to be resistant to data corruptions and to be more uncertain on out-of-domain data than on in-domain data. On the contrary, in-domain uncertainty of the model is measured on data taken from the training data distribution, i.e. data from the same domain. In this setting the model is expected to produce reliable probability estimates, e.g. the model shouldn’t be too overconfident in its wrong predictions. + +Pitfalls of metrics We show that many common metrics of in-domain uncertainty estimation (e.g. log-likelihood, Brier score, calibration metrics, etc.) are either not comparable across different models or fail to provide a reliable ranking. We address some of the stated pitfalls and point out more reasonable evaluation schemes. For instance, although temperature scaling is not a standard for ensembling techniques, it is a must for a fair evaluation. With this in mind, the calibrated log-likelihood avoids most of the stated pitfalls and generally is a reasonable metric for in-domain uncertainty estimation task. + +Pitfalls of ensembles Equipped with the proposed evaluation framework, we are revisiting the evaluation of ensembles of DNNs—one of the major tools for uncertainty estimation. We introduce the deep ensemble equivalent (DEE) score that measures the number of independently trained models that, when ensembled, achieve the same performance as the ensembling technique of interest. The DEE score allows us to compare ensembling techniques across different datasets and architectures using a unified scale. Our study shows that most of the popular ensembling techniques require averaging predictions across dozens of samples (members of an ensemble), yet are essentially equivalent to an ensemble of only few independently trained models. + +Missing part of ensembling In our study, test-time data augmentation (TTA) turned out to be a surprisingly strong baseline for uncertainty estimation and a simple way to improve ensembles. Despite being a popular technique in large-scale classification, TTA seems to be overlooked in the community of uncertainty estimation and ensembling. + +# 2 SCOPE OF THE PAPER + +We use standard benchmark problems of image classification which comprise a common setting in research on learning ensembles of neural networks. There are other relevant settings where the correctness of probability estimates can be a priority, and ensembling techniques are used to improve it. These settings include, but are not limited to, regression, language modeling (Gal, 2016), image segmentation (Gustafsson et al., 2019), active learning (Settles, 2012) and reinforcement learning (Buckman et al., 2018; Chua et al., 2018). + +We focus on in-domain uncertainty, as opposed to out-of-domain uncertainty. Out-of-domain uncertainty includes detection of inputs that come from a completely different domain or have been corrupted by noise or adversarial attacks. This setting has been thoroughly explored by (Ovadia et al., 2019). + +We only consider methods that are trained on clean data with simple data augmentation. Some other methods use out-of-domain data (Malinin & Gales, 2018) or more elaborate data augmentation, e.g. mixup (Zhang et al., 2017) or adversarial training (Lakshminarayanan et al., 2017) to improve accuracy, robustness and uncertainty. + +We use conventional training procedures. We use the stochastic gradient descent (SGD) and use batch normalization (Ioffe & Szegedy, 2015), both being the de-facto standards in modern deep learning. We refrain from using more elaborate optimization techniques including works on superconvergence (Smith & Topin, 2019) and stochastic weight averaging (SWA) (Izmailov et al., 2018). These techniques can be used to drastically accelerate training and to improve the predictive performance. Thus, we do not comment on the training time of different ensembling methods since the use of these and other more efficient training techniques would render such a comparison obsolete. + +A number of related works study ways of approximating and accelerating prediction in ensembles. The distillation mechanism allows to approximate the prediction of an ensemble by a single neural network (Hinton et al., 2015; Balan et al., 2015; Tran et al., 2020), whereas fast dropout (Wang & Manning, 2013) and deterministic variational inference (Wu et al., 2018) allow to approximate the predictive distribution of specific stochastic computation graphs. We measure the raw power of ensembling techniques without these approximations. + +All of the aforementioned alternative settings are orthogonal to the scope of this paper and are promising points of interest for further research. + +# 3 PITFALLS OF IN-DOMAIN UNCERTAINTY ESTIMATION + +No single metric measures all the desirable properties of uncertainty estimates obtained by a model of interest. Because of this, the community is using many different metrics in an attempt to capture the quality of uncertainty estimation, such as the Brier score (Brier, 1950), log-likelihood (Quinonero-Candela et al., 2005), metrics of calibration (Guo et al., 2017; Nixon et al., 2019), performance of misclassification detection (Malinin & Gales, 2018), and threshold–accuracy curves (Lakshminarayanan et al., 2017). In the section we highlight the pitfalls of the aforementioned metrics, and demonstrate that these pitfalls can significantly affect evaluation, changing the ranking of the methods. + +![](images/d97acaa163ca38357212bbd72f60d4fc445d6e7aa0be224c9c8cf4a1312e3276.jpg) +Figure 1: The average log-likelihood of two different ensembling techniques for ResNet50 on ImageNet dataset before (solid) and after (dashed) temperature scaling. Without the temperature scaling, test-time data augmentation decreases the log-likelihood of plain deep ensembles. However, when the temperature scaling is enabled, deep ensembles with test-time data augmentation outperform plain deep ensembles. + +![](images/0c9b556ad42fcfa9d83f9f988497812e9a476b418a72ba3fcc791159192d282e.jpg) +Figure 2: Thresholded adaptive calibration error (TACE) is highly sensitive to the threshold and the number of bins. It does not provide a consistent ranking of different ensembling techniques. Here TACE is reported for VGG16BN model on CIFAR-100 dataset and is evaluated at the optimal temperature. + +Notation We consider a classification problem with a dataset that consists of $N$ training and $n$ testing pairs $( x _ { i } , y _ { i } ^ { * } ) \sim p ( x , y )$ , where $x _ { i }$ is an object and $y _ { i } ^ { * } \in \{ 1 , \ldots , C \}$ is a discrete class label. A probabilistic classifier maps an object $x _ { i }$ into a predictive distribution ${ \dot { p } } ( y \mid x _ { i } )$ . The predictive distribution ${ \hat { p } } ( y \mid x _ { i } )$ of a deep neural network is typically defined by the softmax function ${ \hat { p } } ( y \mid x ) =$ $\mathrm { S o f t m a x } ( z ( x ) / T )$ , where $z ( x )$ is a vector of logits and $T$ is a scalar parameter standing for the temperature of the predictive distribution. This scalar parameter is usually set to $T = 1$ or is tuned on a validation set (Guo et al., 2017). The maximum probability $\operatorname* { m a x } _ { c } \dot { \hat { p } } ( y = c | x _ { i } )$ is called the confidence of a classifier $\hat { p }$ on an object $x _ { i }$ . $\mathbb { I } [ \cdot ]$ denotes the indicator function throughout the text. + +# 3.1 LOG-LIKELIHOOD AND BRIER SCORE + +The average test log-likelihood $\begin{array} { r } { \mathbf { L } \mathbf { L } = \frac { 1 } { n } \sum _ { i = 1 } ^ { n } \log \hat { p } ( y = y _ { i } ^ { * } \mid x _ { i } ) } \end{array}$ is a popular metric for measuring the quality of in-domain uncertainty of deep learning models. It directly penalizes high probability scores assigned to incorrect labels and low probability scores assigned to the correct labels $y _ { i } ^ { * }$ . + +LL is sensitive to the softmax temperature $T$ . The temperature that has been implicitly learned during training can be far from optimal for the test data. However, a nearly optimal temperature can be found post-hoc by maximizing the log-likelihood on validation data. This approach is called temperature scaling or calibration (Guo et al., 2017). Despite its simplicity, the temperature scaling results in a notable improvement in the LL. + +While ensembling techniques tend to have better temperature than single models, the default choice of $T = 1$ is still suboptimal. Comparing the LL with suboptimal temperatures—that is often the case in practice—can potentially produce an arbitrary ranking of different methods. + +Comparison of the log-likelihood should only be performed at the optimal temperature. + +Empirically, we demonstrate that the overall ordering of methods and also the best ensembling method according to the LL can vary depending on temperature $T$ . While this applies to most ensembling techniques (see Figure 10), this effect is most noticeable on experiments with data augmentation on ImageNet (Figure 1). + +We introduce a new metric called the calibrated log-likelihood that is the log-likelihood at the optimal temperature. + +The calibrated log-likelihood considers a model and a post-training calibration as a unified system, targeting to measure all models in the equal conditions of optimal temperature. That allows to avoid measuring calibration error that can be eliminated by a simple temperature scaling. The metric significantly affects the results of the comparison. For example, in Figure 10 the differences between Bayesian (VI, K-FAC, SWAG, dropout) and conventional non-Bayesian networks become much less pronounced, and in most cases making conventional non-Bayesian networks match the performance of Bayesian ones (VI, K-FAC, Dropout) on ResNet110, ResNet164, and WideResNet. + +We show how to obtain an unbiased estimate of the calibrated log-likelihood without a held-out validation set in Section 3.5. + +LL also demonstrates a high correlation with accuracy $( \rho > 0 . 8 6 )$ , that in case of calibrated LL becomes even stronger $( \rho > 0 . 9 5 )$ . That suggests that while (calibrated) LL measures the uncertainty of the model, it still has a significant dependence on the accuracy and vice versa. A model with higher accuracy would likely have a higher log-likelihood. See Figure 9 in Appendix C for more details. + +Brier score $\begin{array} { r } { \mathrm { { B S } } = \frac { 1 } { n } \frac { 1 } { C } \sum _ { i = 1 } ^ { n } \sum _ { c = 1 } ^ { C } ( \mathbb { I } [ y _ { i } ^ { * } = c ] - \hat { p } ( y = c | x _ { i } ) ) ^ { 2 } } \end{array}$ has also been known for a long time as a metric for verification of predicted probabilities (Brier, 1950). Similarly to the log-likelihood, the Brier score penalizes low probabilities assigned to correct predictions and high probabilities assigned to wrong ones. It is also sensitive to the temperature of the softmax distribution and behaves similarly to the log-likelihood. While these metrics are not strictly equivalent, they show a high empirical correlation for a wide range of models on CIFAR-10, CIFAR-100 and ImageNet datasets (see Figure 8 in Appendix C ). + +# 3.2 MISCLASSIFICATION DETECTION + +Detection of wrong predictions of the model, or misclassifications, is a popular downstream problem relevant to the problem of in-domain uncertainty estimation. Since misclassification detection is essentially a binary classification problem, some papers measure its quality using conventional metrics for binary classification such as AUC-ROC and AUC-PR (Malinin & Gales, 2018; Cui et al., 2019; Mozejko et al., 2018). These papers use an uncertainty criterion like confidence or predictive ˙ entropy $\mathcal { H } [ \bar { p } ( \boldsymbol { y } | \boldsymbol { x } _ { i } ) ]$ as a prediction score. + +While these metrics can be used to assess the misclassification detection performance of a single model, they cannot be used to directly compare misclassification performance across different models. Correct and incorrect predictions are specific for every model, therefore, every model induces its own binary classification problem. The induced problems can differ significantly, since different models produce different confidences and misclassify different objects. In other words, comparing such metrics implies a comparison of performance of classifiers that solve different classification problems. Such metrics are therefore incomparable. + +AUCs for misclassification detection cannot be directly compared between different models. + +While comparing AUCs is incorrect in the setting of misclassification detection, it is correct to compare these metrics in many out-of-domain data detection problems. In that case, both objects and targets of the induced binary classification problems remain the same for all models. All outof-domain objects have a positive label and all in-domain objects have a negative label. Note that this condition does not necessarily hold in the problem of detection of adversarial attacks. Different models generally have different inputs after an adversarial attack, so such AUC-based metrics might still be flawed. + +# 3.3 CLASSIFICATION WITH REJECTION + +Accuracy-confidence curves are another way to measure the performance of misclassification detection. These curves measure the accuracy on the set of objects with confidence $\operatorname* { m a x } _ { c } { \hat { p } } ( y = c | x _ { i } )$ above a certain threshold $\tau$ (Lakshminarayanan et al., 2017) and ignoring or rejecting the others. + +The main problem with accuracy-confidence curves is that they rely too much on calibration and the actual values of confidence. Models with different temperatures have different numbers of objects at each confidence level which does not allow for a meaningful comparison. To overcome this problem, one can swhich from thresholding by the confidence level to thresholding by the number of rejected objects. The corresponding curves are then less sensitive to temperature scaling and thus allow to compare the rejection ability in a more meaningful way. Such curves have been known as accuracyrejection curves (Nadeem et al., 2009). In order to obtain a scalar metric for easy comparisons, one can compute the area under this curve, resulting in AU-ARC (Nadeem et al., 2009). + +# 3.4 CALIBRATION METRICS + +Informally speaking, a probabilistic classifier is calibrated if any predicted class probability is equal to the true class probability according to the underlying data distribution (see (Vaicenavicius et al., 2019) for formal definitions). Any deviation from the perfect calibration is called miscalibration. For brevity, we will use $\hat { p } _ { i , c }$ to denote ${ \hat { p } } ( y = c | x _ { i } )$ in the current section. + +Expected calibration error (ECE) (Naeini et al., 2015) is a metric that estimates model miscalibration by binning the assigned probability scores and comparing them to average accuracies inside these bins. Assuming ${ B } _ { m } ^ { \bar { } }$ denotes the $m$ -th bin and $M$ is overall number of bins, the ECE is defined as follows: + +$$ +\mathrm { E C E } = \sum _ { m = 1 } ^ { M } \frac { | B _ { m } | } { n } \left| \operatorname { a c c } ( B _ { m } ) - \operatorname { c o n f } ( B _ { m } ) \right| , +$$ + +where $\begin{array} { r } { \operatorname { a c c } ( B ) = | B | ^ { - 1 } \sum _ { i \in B } { \mathbb { I } } [ \operatorname { a r g m a x } _ { c } \hat { p } _ { i , c } = y _ { i } ^ { * } ] \mathrm { ~ a n d ~ c o n f } ( B ) = | B | ^ { - 1 } \sum _ { i \in B } \hat { p } _ { i , y _ { i } ^ { * } } . } \end{array}$ + +A recent line of works on measuring calibration in deep learning (Vaicenavicius et al., 2019; Kumar et al., 2019; Nixon et al., 2019) outlines several problems of the ECE score. Firstly, ECE is a biased estimate of the true calibration. Secondly, ECE-like scores cannot be optimized directly since they are minimized by a model with constant uniform predictions, making the infinite temperature $T = + \infty$ its global optimum. Thirdly, ECE only estimates miscalibration in terms of the maximum assigned probability whereas practical applications may require the full predicted probability vector to be calibrated. Finally, biases of ECE on different models may not be equal, rendering the miscalibration estimates incompatible. Similar concerns are also discussed by Ding et al. (2019). + +Thresholded adaptive calibration error (TACE) was proposed as a step towards solving some of these problems (Nixon et al., 2019). TACE disregards all predicted probabilities that are less than a certain threshold (hence thresholded), chooses the bin locations adaptively so that each bin has the same number of objects (hence adaptive), and estimates miscalibration of probabilties across all classes in the prediction (not just the top-1 predicted class as in ECE). Assuming that $B _ { m } ^ { \mathrm { { T A } } }$ denotes the $m$ -th thresholded adaptive bin and $\bar { M }$ is the overall number of bins, TACE is defined as follows: + +$$ +\begin{array} { r } { \mathrm { \ o b j s } ( B ^ { \mathtt { T A } } , c ) = | B ^ { \mathtt { T A } } | ^ { - 1 } \sum _ { i \in B ^ { \mathtt { T A } } } \mathbb { I } [ y _ { i } ^ { * } = c ] \mathrm { \ a n d \ c o n f } ( B ^ { \mathtt { T A } } , c ) = | B ^ { \mathtt { T A } } | ^ { - 1 } \sum _ { i \in B ^ { \mathtt { T A } } } \hat { p } _ { i } } \end{array} +$$ + +$$ +\mathrm { T A C E } = \frac { 1 } { C M } \sum _ { c = 1 } ^ { C } \sum _ { m = 1 } ^ { M } \frac { | B _ { m } ^ { \mathrm { T A } } | } { n } \left| \mathrm { o b j s } ( B _ { m } ^ { \mathrm { T A } } , c ) - \mathrm { c o n f } ( B _ { m } ^ { \mathrm { T A } } , c ) \right| , +$$ + +Although TACE does solve several problems of ECE and is useful for measuring calibration of a specific model, it still cannot be used as a reliable criterion for comparing different models. Theory suggests that it is still a biased estimate of true calibration with different bias for each model (Vaicenavicius et al., 2019). In practice, we find that TACE is sensitive to its two parameters, the number of bins and the threshold, and does not provide a consistent ranking of different models, as shown in Figure 2. + +# 3.5 CALIBRATED LOG-LIKELIHOOD AND TEST-TIME CROSS-VALIDATION + +There are two common ways to perform temperature scaling using a validation set when training on datasets that only feature public training and test sets (e.g. CIFARs). The public training set might be divided into a smaller training set and validation set, or the public test set can be split into test and validation parts (Guo et al., 2017; Nixon et al., 2019). The problem with the first method is that the resulting models cannot be directly compared with all the other models that have been trained on the full training set. The second approach, however, provides an unbiased estimate of metrics such as log-likelihood and Brier score but introduces more variance. + +In order to reduce the variance of the second approach, we perform a “test-time cross-validation”. We randomly divide the test set into two equal parts, then compute metrics for each half of the test set using the temperature optimized on another half. We repeat this procedure five times and average the results across different random partitions to reduce the variance of the computed metrics. + +# 4 A STUDY OF ENSEMBLING & DEEP ENSEMBLE EQUIVALENT + +Ensembles of deep neural networks have become a de-facto standard for uncertainty estimation and improving the quality of deep learning models (Hansen & Salamon, 1990; Krizhevsky et al., 2009; Lakshminarayanan et al., 2017). There are two main directions of training ensembles of DNNs: training stochastic computation graphs and obtaining separate snapshots of neural network parameters. + +Methods based on the paradigm of stochastic computation graphs introduce some kind of random noise over the weights or activations of deep learning models. When the model is trained, each sample of the noise corresponds to a member of the ensemble. During test time, the predictions are averaged across the noise samples. These methods include (test-time) data augmentation, dropout (Srivastava et al., 2014; Gal & Ghahramani, 2016), variational inference (Blundell et al., 2015; Kingma et al., 2015; Louizos & Welling, 2017), batch normalization (Ioffe & Szegedy, 2015; Teye et al., 2018; Atanov et al., 2019), Laplace approximation (Ritter et al., 2018) and many more. + +Snapshot-based methods aim to obtain sets of weights for deep learning models and then to average the predictions across these weights. The weights can be trained independently (e.g. deep ensembles (Lakshminarayanan et al., 2017)), collected on different stages of a training trajectory (e.g. snapshot ensembles (Huang et al., 2017) and fast geometric ensembles (Garipov et al., 2018)), or obtained from a sampling process (e.g. MCMC-based methods (Welling & Teh, 2011; Zhang et al., 2019)). These two paradigms can be combined. Some works suggest construction of ensembles of stochastic computation graphs (Tomczak et al., 2018), while others make use of the collected snapshots to construct a stochastic computation graph (Wang et al., 2018; Maddox et al., 2019). + +In this paper we consider the following ensembling techniques: deep ensembles (Lakshminarayanan et al., 2017), snapshot ensembles (SSE by Huang et al. (2017)), fast geometric ensembling (FGE by Garipov et al. (2018)), SWA-Gaussian (SWAG by Maddox et al. (2019)), cyclical SGLD (cSGLD by Zhang et al. (2019)), variational inference (VI by Blundell et al. (2015)), K-FAC Laplace approximation (Ritter et al., 2018), dropout (Srivastava et al., 2014) and test-time data augmentation (Krizhevsky et al., 2009). These techniques were chosen to cover a diverse set of approaches keeping their predictive performance in mind. + +All these techniques can be summarized as distributions $q _ { m } ( \omega )$ over parameters $\omega$ of computation graphs, where $m$ stands for the technique. During testing, one can average the predictions across parameters $\omega \sim q _ { m } ( \omega )$ to approximate the predictive distribution + +$$ +\hat { p } ( y _ { i } | x _ { i } ) \approx \int p ( y _ { i } | x _ { i } , \omega ) q _ { m } ( \omega ) d \omega \simeq \frac { 1 } { K } \sum _ { k = 1 } ^ { K } p ( y _ { i } | x _ { i } , \omega _ { k } ) , \quad \omega _ { k } \sim q _ { m } ( \omega ) \omega _ { k } ^ { \quad \mathrm { ~ d ~ } } , +$$ + +For example,Dirac’s deltas $S$ rks can be represented in this form as a mix, centered at independently trained snapshots re of . Sim $S$ $\begin{array} { r } { q _ { \mathrm { { D E } } } ( \omega ) = \frac { 1 } { S } \sum _ { s = 1 } ^ { S } \delta ( \omega - \omega _ { s } ) } \end{array}$ $\omega _ { s }$ over the weight matrices and convolutional kernels $\omega$ is represented as $q _ { \mathrm { v I } } ( \omega ) = \mathcal { N } ( \omega | \mu , \mathrm { d i a g } ( \sigma ^ { 2 } ) )$ , $\mu$ and $\sigma ^ { 2 }$ being the optimal variational means and variances respectively. + +If one considers data augmentation as a part of the computational graph, it can be parameterized by the coordinates of the random crop and the flag for whether to flip the image horizontally or not. Sampling from the corresponding $q _ { \mathrm { a u g } } ( \omega )$ would generate different ways to augment the data during inference. However, as data augmentation is present by default during the training of all othe mentioned ensembling techniques, it is suitable to study it in combination with these methods and not as a separate ensembling technique. We perform such an evaluation in Section 4.3. + +![](images/4c4790d017e5dfd157b34a61bcb790afb627af636464852f4f415612b476f194.jpg) +Figure 3: The deep ensemble equivalent score (DEE) for different numbers of samples on CIFAR10, CIFAR-100, and ImageNet datasets averaged across different deep convolutional architectures. A deep ensemble equivalent score (DEE) of a model is equal to the minimum size of a deep ensemble (an ensemble of independently train networks) that achieves the same performance as the model under consideration. The score is measured in the number of models (higher is better). The area between average lower and upper bounds of DEE is shaded. The plot demonstrates that all of the ensembling techniques are far less efficient than deep ensembles during inference and fail to produce the same level of performance as deep ensembles. The comparison that is normalized on training time is presented in Appendix A. + +Typically, the approximation (equation 3) requires $K$ independent forward passes through a neural network, making the test-time budget directly comparable across all methods. + +# 4.1 DEEP ENSEMBLE EQUIVALENT + +Most ensembling techniques under consideration are either bounded to a single mode, or provide positively correlated samples. Deep ensemble, on the other hand, is a simple technique that provides independent samples from different modes of the loss landscape, which, intuitively, should result in a better ensemble. Therefore deep ensembles can be considered a strong baseline for the performance of other ensembling techniques given a fixed test-time computation budget. + +Comparing the performance of ensembling techniques is, however, a challenging problem. Different models on different datasets achieve different values of metrics; their dependence on the number of samples is non-trivial, and varies depending on a specific model and dataset. Values of the metrics are thus lacking in interpretability as the gain in performance has to be compared against a modeland dataset-specific baseline. + +Aiming to introduce perspective and interpretability in our study, we introduce the deep ensemble equivalent score that employs deep ensembles to measure the performance of other ensembling techniques. Specifically, the deep ensemble equivalent score answers the following question: + +What size of deep ensemble yields the same performance as a particular ensembling method? + +Following the insights from the previous sections, we base the deep ensemble equivalent on the calibrated log-likelihood (CLL). Formally speaking, we define the deep ensemble equivalent (DEE) for an ensembling method $m$ and its upper and lower bounds as follows: + +$$ +\begin{array} { r l r } & { } & { \mathrm { D E E } _ { m } ( k ) = \operatorname* { m i n } \Big \{ l \in \mathbb { R } , l \geq 1 \Big | \mathrm { C L L } _ { D E } ^ { \mathrm { m e a n } } ( l ) \geq \mathrm { C L L } _ { m } ^ { \mathrm { m e a n } } ( k ) \Big \} , \quad } \\ & { } & { \mathrm { D E E } _ { m } ^ { \mathrm { ~ u p p e r ~ } } ( k ) = \operatorname* { m i n } \Big \{ l \in \mathbb { R } , l \geq 1 \Big | \mathrm { C L L } _ { D E } ^ { \mathrm { m e a n } } ( l ) \mp \mathrm { C L L } _ { D E } ^ { \mathrm { s t d } } ( l ) \geq \mathrm { C L L } _ { m } ^ { \mathrm { m e a n } } ( k ) \Big \} , } \end{array} +$$ + +![](images/041e736d79e230462a713217d44dd55230a471b35cac4d3728d20c81d88722e8.jpg) +Figure 4: An illustration of test-time augmentation (TTA) for an ensemble. We apply every member of an ensemble to a separate random augmentation of an image. The predictions of all members are averaged to produce a final prediction of an ensemble. In our experiments, TTA leads to a significant boost of the performance for most of the ensembling techniques on ImageNet with a sufficient computational budget (see Figure 5). + +where $\mathrm { C L L } _ { m } ^ { \mathrm { m e a n / s t d } } ( l )$ are the mean and the standard deviation of the calibrated log-likelihood achieved by an ensembling method $m$ with $l$ samples. We compute $\mathrm { C L L } _ { \mathrm { D E } } ^ { \mathrm { m e a n } } ( l )$ and $\mathrm { C L L } _ { \mathrm { D E } } ^ { \mathrm { s t d } } ( l )$ for natural numbers $l \in { \mathbb { N } } _ { > 0 }$ and use linear interpolation to define them for real values $l \geq 1$ . In the following plots we report $\mathrm { D E E } _ { m } ( k )$ for different methods $m$ with different numbers of samples $k$ , and shade the area between the respective lower and upper bounds $\mathrm { D E E } _ { m } ^ { \mathrm { l o w e r } } ( k )$ and $\mathrm { D E E } _ { m } ^ { \mathrm { u p p e r } } ( k )$ . + +# 4.2 EXPERIMENTS + +We compute the deep ensemble equivalent (DEE) of various ensembling techniques for four popular deep architectures: VGG16 (Simonyan & Zisserman, 2014), PreResNet110/164 (He et al., 2016), and WideResNet28x10 (Zagoruyko & Komodakis, 2016) on CIFAR-10/100 datasets (Krizhevsky et al., 2009), and ResNet50 (He et al., 2016) on ImageNet dataset (Russakovsky et al., 2015). We use PyTorch (Paszke et al., 2017) for implementation of these models, building upon available public implementations. Our implementation closely matches the quality of methods that has been reported in original works. Technical details on training, hyperparameters and implementations can be found in Appendix B. The source code and all computed metrics are available on GitHub1. + +As one can see on Figure 3, ensembling methods clearly fall into three categories. SSE and cSGLD outperform all other techniques except deep ensembles and enjoy a near-linear scaling of DEE with the number of samples on CIFAR datasets. The investigation of weight-space trajectories of cSGLD and SSE (Huang et al., 2017; Zhang et al., 2019) suggests that these methods can efficiently explore different modes of the loss landscape. In terms of the deep ensemble equivalent, these methods do not saturate unlike other methods that are bound to a single mode. We found SSE to still saturate on ImageNet. This is likely due to suboptimal hyperparameters of the cyclic learning rate schedule. More verbose results are presented in Figures 11–13 and in Table 5 and Table 8 in Appendix C. + +In our experiments SSE typically outperforms cSGLD. This is mostly due to the fact that SSE has a much larger training budget. The cycle lengths and learning rates of SSE and cSGLD are comparable, however, SSE collects one snapshot per cycle while cSGLD collects three snapshots. This makes samples from SSE less correlated with each other while increasing the training budget threefold. Both SSE and cSGLD can be adjusted to obtain a different trade-off between the training budget and the DEE-to-samples ratio. We reused the schedules provided in the original papers (Huang et al., 2017; Zhang et al., 2019). + +![](images/3514525c9717703869980514d722dbb583156e3303e2ad13660f10f30a57c3ac.jpg) +Figure 5: How to read results: $\times \ \frac { \mathrm { \ t e s t { - } t i m e \ a u g } } { 1 0 \ \mathrm { s a m p l e s } } \quad \Phi , \times \ \frac { \mathrm { \ t e s t { - } t i m e \ a u g } } { 5 0 \ \mathrm { s a m p l e s } } \quad \cdot$ . The negative calibrated loglikelihood (lower is better) for different ensembling techniques on ImageNet. We report performance for two regimes. Central-crop evaluation $( \times \times )$ means every member of an ensemble is applied to a central crop of an image, and test-time data augmentation ( ) means each member of the ensemble is applied to a separate random augmentation of the image. Test-time data augmentation significantly improves ensembles with no additional computational cost. Interestingly, a single model with TTA performs competitively with methods that require significantly larger parameters budget, and training complexity, e.g., a single model with TTA performs closely to pure deep ensembles (DE) of the same size. + +Being more “local” methods, FGE and SWAG perform worse than SSE and cSGLD, but still significantly outperform “single-snapshot” methods like dropout, K-FAC Laplace approximation and variational inference. We hypothesize that by covering a single mode with a set of snapshots, FGE and SWAG provide a better fit for the local geometry than models trained as stochastic computation graphs. This implies that the performance of FGE and SWAG should be achievable by singlesnapshot methods. However, one might need more elaborate posterior approximations and better inference techniques in order to match the performance of FGE and SWAG by training a stochastic computation graph end-to-end (as opposed to SWAG that constructs a stochastic computation graph post-hoc). + +The deep ensemble equivalent curves allow us to notice the common behaviour of different methods, e.g. the relation between deep ensembles, snapshot methods, advanced local methods and singlesnapshot local methods. They also allow us to notice inconsistencies that may indicate a suboptimal choice of hyperparameters. For example, we find that SSE on ImageNet quickly saturates, unlike SSE on CIFAR datasets (Figure 3). This may indicate that the hyperparameters used on ImageNet are not good enough for efficient coverage of different modes of the loss landscape. We also find that SSE on WideResNet on CIFAR-10 achieves a DEE score of 100 on approx. 70 samples (Figure 12). This may indicate that the members of the deep ensemble for this dataset-architecture pair are underfitted and may benefit from longer training or a different learning rate schedule. Such inconsistencies might be more difficult to spot using plain calibrated log-likelihood plots. + +# 4.3 TEST-TIME DATA AUGMENTATION IMPROVES ENSEMBLES FOR FREE + +Data augmentation is a time-honored technique that is widely used in deep learning, and is a crucial component for training modern DNNs. Test-time data augmentation has been used for a long time to improve the performance of convolutional networks. For example, multi-crop evaluation has been a standard procedure for the ImageNet challenge (Simonyan & Zisserman, 2014; Szegedy et al., 2015; He et al., 2016). It is, however, often overlooked in the literature on ensembling techniques in deep learning. In this section, we study the effect of test-time data augmentation on the aforementioned ensembling techniques. To keep the test-time computation budget the same, we sample one random augmentation for each member of an ensemble. Figure 5 reports the calibrated log-likelihood on combination of ensembles and test-time data augmentation for ImageNet. Other metrics and results on CIFAR-10/100 datasets are reported in Appendix C. We have used the standard data augmentation: random horizontal flips and random padded crops for CIFAR-10/100 datasets, and random horizontal flips and random resized crops for ImageNet (see more details in Appendix B). + +Test-time data augmentation (Figure 4) consistently improves most ensembling methods, especially on ImageNet, where we see a clear improvement across all methods (Figure 5 and Table 7). The performance gain for powerful ensembles (deep ensembles, SSE and cSGLD) on CIFAR datasets is not as dramatic (Figures 14–15 and Table 4). This is likely due to the fact that CIFAR images are small, making data augmentation limited, whereas images from ImageNet allow for a large number of diverse samples of augmented images. On the other hand, while the performance of “single-snapshot” methods (e.g. variational inference, K-FAC Laplace and dropout) is improved significantly, they perform approximately as good as an augmented version of a single model across all datasets.w + +Interestingly, test-time data augmentation on ImageNet improves accuracy but decreases the uncalibrated log-likelihood of deep ensembles (Table 7 in Appendix C). Test-time data augmentation breaks the nearly optimal temperature of deep ensembles and requires temperature scaling to reveal the actual performance of the method, as discussed in Section 3.1. The experiment demonstrates that ensembles may be highly miscalibrated by default while still providing superior predictive performance after calibration. + +We would like to note that test-time data augmentation does not always break the calibration of an ensemble, and, on the contrary, test-time data augmentation often improves the calibration of an ensemble. In our experiments, decalibration was caused by the extreme magnitude of a random crop, that is conventionally used for ImageNet augmentation. Using less extreme magnitude of the random crop fixes decalibration, that makes test-time data augmentation a more practical method that provides out-of-the-box calibration. Although, as we demonstrated earlier, there is no guarantee that any ensemble is calibrated out-of-the-box. If we are willing to apply post-hoc calibration, the final performance can be much better with more severe augmentations. + +# 5 DISCUSSION & CONCLUSION + +We have explored the field of in-domain uncertainty estimation and performed an extensive evaluation of modern ensembling techniques. Our main findings can be summarized as follows: + +• Temperature scaling is a must even for ensembles. While ensembles generally have better calibration out-of-the-box, they are not calibrated perfectly and can benefit from the procedure. A comparison of log-likelihoods of different ensembling methods without temperature scaling might not provide a fair ranking, especially if some models happen to be miscalibrated. Many common metrics for measuring in-domain uncertainty are either unreliable (ECE and analogues) or cannot be used to compare different methods (AUC-ROC, AUC-PR for misclassification detection; accuracy-confidence curves). In order to perform a fair comparison of different methods, one needs to be cautious of these pitfalls. Many popular ensembling techniques require dozens of samples for test-time averaging, yet are essentially equivalent to a handful of independently trained models. Deep ensembles dominate other methods given a fixed test-time budget. The results indicate, in particular, that exploration of different modes in the loss landscape is crucial for good predictive performance. +• Methods that are stuck in a single mode are unable to compete with methods that are designed to explore different modes of the loss landscape. Would more elaborate posterior approximations and better inference techniques shorten this gap? Test-time data augmentation is a surprisingly strong baseline for in-domain uncertainty estimation. It can significantly improve other methods without increasing training time or model size since data augmentation is usually already present during training. + +Our takeaways are aligned with the take-home messages of Ovadia et al. (2019) that relate to indomain uncertainty estimation. We also observe a stable ordering of different methods in our experiments, and observe that deep ensembles with few members outperform methods based on stochastic computation graphs. + +A large number of unreliable metrics inhibits a fair comparison of different methods. Because of this, we urge the community to aim for more reliable benchmarks in the numerous setups of uncertainty estimation. + +# ACKNOWLEDGMENTS + +Dmitry Vetrov and Dmitry Molchanov were supported by the Russian Science Foundation grant no. 19-71-30020. This research was supported in part through computational resources of HPC facilities at NRU HSE. + +# REFERENCES + +Andrei Atanov, Arsenii Ashukha, Dmitry Molchanov, Kirill Neklyudov, and Dmitry Vetrov. Uncertainty estimation via stochastic batch normalization. In International Symposium on Neural Networks, pp. 261–269. Springer, 2019. + +Anoop Korattikara Balan, Vivek Rathod, Kevin P Murphy, and Max Welling. Bayesian dark knowledge. In Advances in Neural Information Processing Systems, pp. 3438–3446, 2015. + +Charles Blundell, Julien Cornebise, Koray Kavukcuoglu, and Daan Wierstra. Weight uncertainty in neural networks. arXiv preprint arXiv:1505.05424, 2015. + +Glenn W Brier. Verification of forecasts expressed in terms of probability. Monthly weather review, 78(1):1–3, 1950. + +Jacob Buckman, Danijar Hafner, George Tucker, Eugene Brevdo, and Honglak Lee. Sampleefficient reinforcement learning with stochastic ensemble value expansion. In Advances in Neural Information Processing Systems, pp. 8224–8234, 2018. + +Kurtland Chua, Roberto Calandra, Rowan McAllister, and Sergey Levine. Deep reinforcement learning in a handful of trials using probabilistic dynamics models. In Advances in Neural Information Processing Systems, pp. 4754–4765, 2018. + +Yufei Cui, Wuguannan Yao, Qiao Li, Antoni B Chan, and Chun Jason Xue. Accelerating monte carlo bayesian inference via approximating predictive uncertainty over simplex. arXiv preprint arXiv:1905.12194, 2019. + +Yukun Ding, Jinglan Liu, Jinjun Xiong, and Yiyu Shi. Evaluation of neural network uncertainty estimation with application to resource-constrained platforms. arXiv preprint arXiv:1903.02050, 2019. + +Yarin Gal. Uncertainty in deep learning. PhD thesis, PhD thesis, University of Cambridge, 2016. + +Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In international conference on machine learning, pp. 1050–1059, 2016. + +Timur Garipov, Pavel Izmailov, Dmitrii Podoprikhin, Dmitry P Vetrov, and Andrew G Wilson. Loss surfaces, mode connectivity, and fast ensembling of dnns. In Advances in Neural Information Processing Systems, pp. 8789–8798, 2018. + +Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q Weinberger. On calibration of modern neural networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 1321–1330. JMLR. org, 2017. + +Fredrik K Gustafsson, Martin Danelljan, and Thomas B Schon. Evaluating scalable bayesian deep ¨ learning methods for robust computer vision. arXiv preprint arXiv:1906.01620, 2019. + +Lars Kai Hansen and Peter Salamon. Neural network ensembles. IEEE Transactions on Pattern Analysis & Machine Intelligence, (10):993–1001, 1990. + +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. + +Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531, 2015. + +Gao Huang, Yixuan Li, Geoff Pleiss, Zhuang Liu, John E Hopcroft, and Kilian Q Weinberger. Snapshot ensembles: Train 1, get m for free. arXiv preprint arXiv:1704.00109, 2017. + +Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. arXiv preprint arXiv:1502.03167, 2015. + +Pavel Izmailov, Dmitrii Podoprikhin, Timur Garipov, Dmitry Vetrov, and Andrew Gordon Wilson. Averaging weights leads to wider optima and better generalization. arXiv preprint arXiv:1803.05407, 2018. + +Durk P Kingma, Tim Salimans, and Max Welling. Variational dropout and the local reparameterization trick. In Advances in Neural Information Processing Systems, pp. 2575–2583, 2015. + +Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. Technical report, Citeseer, 2009. + +Ananya Kumar, Percy S Liang, and Tengyu Ma. Verified uncertainty calibration. In Advances in Neural Information Processing Systems, pp. 3787–3798, 2019. + +Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. Simple and scalable predictive uncertainty estimation using deep ensembles. In Advances in Neural Information Processing Systems, pp. 6402–6413, 2017. + +Christos Louizos and Max Welling. Multiplicative normalizing flows for variational bayesian neural networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 2218–2227. JMLR. org, 2017. + +Wesley Maddox, Timur Garipov, Pavel Izmailov, Dmitry Vetrov, and Andrew Gordon Wilson. A simple baseline for bayesian uncertainty in deep learning. arXiv preprint arXiv:1902.02476, 2019. + +Andrey Malinin and Mark Gales. Predictive uncertainty estimation via prior networks. In Advances in Neural Information Processing Systems, pp. 7047–7058, 2018. + +James Martens and Roger Grosse. Optimizing neural networks with kronecker-factored approximate curvature. In International conference on machine learning, pp. 2408–2417, 2015. + +Dmitry Molchanov, Arsenii Ashukha, and Dmitry Vetrov. Variational dropout sparsifies deep neural networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 2498–2507. JMLR. org, 2017. + +Marcin Mozejko, Mateusz Susik, and Rafał Karczewski. Inhibited softmax for uncertainty estima- ˙ tion in neural networks. arXiv preprint arXiv:1810.01861, 2018. + +Malik Sajjad Ahmed Nadeem, Jean-Daniel Zucker, and Blaise Hanczar. Accuracy-rejection curves (arcs) for comparing classification methods with a reject option. In Machine Learning in Systems Biology, pp. 65–81, 2009. + +Mahdi Pakdaman Naeini, Gregory Cooper, and Milos Hauskrecht. Obtaining well calibrated probabilities using bayesian binning. In Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015. + +Jeremy Nixon, Mike Dusenberry, Linchuan Zhang, Ghassen Jerfel, and Dustin Tran. Measuring calibration in deep learning. 2019. + +Yaniv Ovadia, Emily Fertig, Jie Ren, Zachary Nado, D Sculley, Sebastian Nowozin, Joshua V Dillon, Balaji Lakshminarayanan, and Jasper Snoek. Can you trust your model’s uncertainty? evaluating predictive uncertainty under dataset shift. arXiv preprint arXiv:1906.02530, 2019. + +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. In NIPS Autodiff Workshop, 2017. + +Joaquin Quinonero-Candela, Carl Edward Rasmussen, Fabian Sinz, Olivier Bousquet, and Bernhard Scholkopf. Evaluating predictive uncertainty challenge. In ¨ Machine Learning Challenges Workshop, pp. 1–27. Springer, 2005. + +Hippolyt Ritter, Aleksandar Botev, and David Barber. A scalable laplace approximation for neural networks. 2018. + +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. + +Burr Settles. Active learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6 (1):1–114, 2012. + +Karen Simonyan and Andrew Zisserman. Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556, 2014. + +Leslie N Smith and Nicholay Topin. Super-convergence: Very fast training of neural networks using large learning rates. In Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications, volume 11006, pp. 1100612. International Society for Optics and Photonics, 2019. + +Casper Kaae Sønderby, Tapani Raiko, Lars Maaløe, Søren Kaae Sønderby, and Ole Winther. How to train deep variational autoencoders and probabilistic ladder networks. In 33rd International Conference on Machine Learning (ICML 2016), 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. + +Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013. + +Christian Szegedy, Wei Liu, Yangqing Jia, Pierre Sermanet, Scott Reed, Dragomir Anguelov, Dumitru Erhan, Vincent Vanhoucke, and Andrew Rabinovich. Going deeper with convolutions. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 1–9, 2015. + +Mattias Teye, Hossein Azizpour, and Kevin Smith. Bayesian uncertainty estimation for batch normalized deep networks. In International Conference on Machine Learning (ICML), 2018. + +Marcin B Tomczak, Siddharth Swaroop, and Richard E Turner. Neural network ensembles and variational inference revisited. In 1st Symposium on Advances in Approximate Bayesian Inference, pp. 1–11, 2018. + +Linh Tran, Bastiaan S Veeling, Kevin Roth, Jakub Swiatkowski, Joshua V Dillon, Jasper Snoek, Stephan Mandt, Tim Salimans, Sebastian Nowozin, and Rodolphe Jenatton. Hydra: Preserving ensemble diversity for model distillation. arXiv preprint arXiv:2001.04694, 2020. + +Karen Ullrich, Edward Meeds, and Max Welling. Soft weight-sharing for neural network compression. arXiv preprint arXiv:1702.04008, 2017. + +Juozas Vaicenavicius, David Widmann, Carl Andersson, Fredrik Lindsten, Jacob Roll, and Thomas B Schon. Evaluating model calibration in classification. arXiv preprint arXiv:1902.06977, 2019. + +Kuan-Chieh Wang, Paul Vicol, James Lucas, Li Gu, Roger Grosse, and Richard Zemel. Adversarial distillation of bayesian neural network posteriors. In International Conference on Machine Learning, pp. 5177–5186, 2018. + +Sida Wang and Christopher Manning. Fast dropout training. In international conference on machine learning, pp. 118–126, 2013. + +Max Welling and Yee W Teh. Bayesian learning via stochastic gradient langevin dynamics. In Proceedings of the 28th international conference on machine learning (ICML-11), pp. 681–688, 2011. + +Anqi Wu, Sebastian Nowozin, Edward Meeds, Richard E Turner, Jose Miguel Hern ´ andez-Lobato, ´ and Alexander L Gaunt. Deterministic variational inference for robust bayesian neural networks. 2018. + +Sergey Zagoruyko. 92.45 on cifar-10 in torch, 2015. URL http://torch.ch/blog/2015/ 07/30/cifar.html. + +Sergey Zagoruyko and Nikos Komodakis. Wide residual networks. arXiv preprint arXiv:1605.07146, 2016. + +Hongyi Zhang, Moustapha Cisse, Yann N Dauphin, and David Lopez-Paz. mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412, 2017. + +Ruqi Zhang, Chunyuan Li, Jianyi Zhang, Changyou Chen, and Andrew Gordon Wilson. Cyclical stochastic gradient mcmc for bayesian deep learning. arXiv preprint arXiv:1902.03932, 2019. + +![](images/b99ab9378285371b9bd9ddff05efc8db0b75a615ceaadc0061e7d48e93d60585.jpg) +Figure 6: The mean cost of training of an ensemble vs. the mean deep ensemble equivalent score. Each marker on the plot denotes one snapshot of weights. + +![](images/5c4fc74147c281d75e6de7a251e4d1655d62287a436773f81f5644901192105e.jpg) +Figure 7: Cost of training of an ensemble vs. its quality (DEE). Each marker on a plot denotes one snapshot of weights. + +# A IS ”EFFICIENT” TRAINING OF ENSEMBLES EFFICIENT AT ALL? + +Yes! If you care most about training time efficiency. All snapshot based methods (SSE, cSGLD and FGE) on average (Figure 6) tend to achieve the same performance as deep ensembles using $2 { - } 5 \times$ less training epochs on CIFAR datasets. + +The gain comes at a cost of inference efficiency and memory consumption. ”Efficient” snapshotbased methods require to store much more samples of weights compared to deep ensembles making inference significantly more expensive (up to $\times 2 5$ ) given the same predictive performance. + +You need to get lucky with hyperparameter choice. While on average ”efficient” snapshot-based methods require less training resources, they might be completely inefficient if your hyperparameter choice is sub-optimal (see Figure 7). Such hyperparameters as the maximum learning rate, the length of learning rate decay cycle, the snapshot saving schedule can all impact the performance significantly. + +This analysis assumes that we use only conventional training procedure. Many models can most likely be trained, stored and executed much more efficiently with methods like super-convergence, stochastic weight averaging, compression, distillation and others. These methods are out of the scope of the paper but are interesting topics for future research. The current choice of hyperparameters may also not be optimal. We reuse the hyperparameters used in the original papers. + +# B EXPERIMENTAL DETAILS + +Implementations of deep ensembles, SWAG, FGE and K-FAC Laplace are heavily based on the original PyTorch implementations of stochastic weight averaging (SWA) 2 and SWAG 3. Implementations of cyclical MCMC and snapshot ensembles are based on the original implementation of cyclical MCMC 4. We hypothesize that the optimal hyperparameters of ensembling methods may vary widely depending on the computational budget and the number of samples in the ensemble. Searching for the optimal values for each configuration is outside the scope of this paper so we stick to the originally proposed hyperparameters whenever possible. + +Implied probabilistic model Conventional neural networks for classification are usually trained using the average cross-entropy loss function with weight decay regularization hidden inside an optimizer in a deep learning framework like PyTorch. The underlying optimization problem can be written as follows: + +$$ +L ( w ) = - \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \log \hat { p } ( y _ { i } ^ { * } \mid x _ { i } , w ) + \frac { \lambda } { 2 } \| w \| ^ { 2 } \operatorname* { m i n } _ { w } , +$$ + +where $\{ ( x _ { i } , y _ { i } ^ { * } ) \} _ { i = 1 } ^ { N }$ is the training dataset of $N$ objects $x _ { i }$ with corresponding labels $y _ { i } ^ { * } , \lambda$ is the weight decay scale and $\hat { p } ( j | x _ { i } , w )$ denotes the probability that a neural network with parameters $w$ assigns to class $j$ when evaluated on object $x _ { i }$ . + +The cross-entropy loss defines a likelihood function $p ( y ^ { * } \mid x , w )$ and weight decay regularization, or $L _ { 2 }$ regularization corresponding to a certain Gaussian prior distribution $p ( w )$ . The whole optimization objective then corresponds to the maximum a posteriori inference in the following probabilistic model: + +$$ +\begin{array} { c } { { p ( y ^ { * } , w \mid x ) = p ( y ^ { * } \mid x , w ) p ( w ) , } } \\ { { \displaystyle \log p ( y ^ { * } \mid x , w ) = \log \prod _ { i = 1 } ^ { N } p ( y _ { i } ^ { * } \mid x _ { i } , w ) = \sum _ { i = 1 } ^ { N } \log \hat { p } ( y _ { i } ^ { * } \mid x _ { i } , w ) , } } \\ { { \displaystyle \log p ( w ) = \frac { - N \lambda } { 2 } \| w \| ^ { 2 } + \mathrm { c o n s t } \iff p ( w ) = \mathcal { N } \left( w \mid 0 , ( N \lambda ) ^ { - 1 } I \right) } } \end{array} +$$ + +In order to make the results comparable across all ensembling techniques, we used the same probabilistic model for all methods, choosing fixed weight decay parameters for each architecture. We used the softmax-based likelihood for all models. We also use the fully-factorized zero-mean Gaussian prior distribution with variances $\sigma ^ { 2 } = ( N \lambda ) ^ { - 1 }$ where the number of objects $N$ and the weight decay scale $\lambda$ are dictated by the particular datasets and neural architectures as defined in the following paragraph. + +Conventional networks To train a single network on CIFAR-10/100, we used SGD with batch size of 128, momentum 0.9 and model-specific parameters, i.e. the initial learning rate $( l r _ { i n i t } )$ , the weight decay coefficient (wd), and the number of optimization epochs (epoch). Specific hyperparameters are shown in Table 1. The models were trained with a unified learning rate scheduler that is shown in equation 10. All models have been trained using data augmentation that consists of horizontal flips and a random crop of 32 pixels with a padding of 4 pixels5. The standard data normalization has also been applied. Weight decays, initial learning rates, and the learning rate scheduler were taken from (Garipov et al., 2018) paper. Compared with hyperparameters of (Garipov et al., 2018), we increased the number of optimization epochs since we found that all models were underfitted. While the original WideResNet28x10 network includes a number of dropout layers with $p = 0 . 3$ and is trained for 200 epochs, we find that the WideResNet28x10 underfits in this setting and requires a longer training. Therefore, we used $p = 0$ which reduces training time while bearing no significant effect on final model performance in our experiments. + +Table 1: Hyperparameters of models trained on CIFARs for single-model evaluation + +
Modellrinit epochs wd
VGG0.05 4005e-4
PreResNet1100.1 3003e-4
PreResNet1640.1 3003e-4
WideResNet28x10 0.13005e-4
+ +$$ +\begin{array} { r } { \bot \mathbf { r } ( i ) = \left\{ \begin{array} { l l } { l _ { r _ { i n i t } } , } & { i \in [ 0 , 0 . 5 \cdot \mathrm { e p o c h s } ] } \\ { l _ { r _ { i n i t } } \cdot ( 1 . 0 - 0 . 9 9 * ( i / \mathrm { e p o c h s } - 0 . 5 ) / 0 . 4 ) , } & { i \in [ 0 . 5 \cdot \mathrm { e p o c h s } , 0 . 9 \cdot \mathrm { e p o c h s } ] } \\ { l _ { r _ { i n i t } } \cdot 0 . 0 1 , } & { \mathrm { o t h e r w i s e } } \end{array} \right. } \end{array} +$$ + +On ImageNet dataset we used ResNet50 with default hyperparameters taken from PyTorch examples 6. Specifically, we used SGD with momentum 0.9, batch size of 256, initial learning rate 0.1, weight decay $1 e - 4$ . Training included data augmentation7 (scaling, random crops of size $2 2 4 \times 2 2 4$ , horizontal flips), normalization and learning rate scheduler $l r = l r _ { i n i t } \cdot 0 . 1 ^ { \mathrm { e p o c h / / 3 0 } }$ where $/ /$ denotes integer division. We only deviated from standard parameters by increasing the number of training epochs from 90 to 130. Or models achieve top-1 error of $2 3 . 8 1 \pm 0 . 1 5$ that closely matches the accuracy of ResNet50 provided by PyTorch which is $2 3 . 8 5 ^ { 8 }$ . Training of one model on a single NVIDIA Tesla V100 GPU takes approximately 5.5 days. + +Deep ensembles Deep ensembles (Lakshminarayanan et al., 2017) average the predictions across networks trained independently starting from different initializations. To obtain a deep ensemble we repeat the described procedure of training standard networks 128 times for all architectures on CIFAR-10 and CIFAR-100 datasets (1024 networks over all) and 50 times for ImageNet dataset. Every member of deep ensembles was trained with exactly the same hyperparameters as conventional models of the same architecture. + +Dropout Binary dropout (or MC dropout) (Srivastava et al., 2014; Gal & Ghahramani, 2016) is one of the most widely known ensembling techniques. It involves putting a multiplicative Bernoulli noise with a parameter $p$ over the activations of either a fully connected layer or a convolutional layer, averaging predictions of the network w.r.t. noise at test-time. Dropout layers were applied to VGG and WideResNet networks on CIFAR-10 and CIFAR-100 datasets. Dropout for VGG was applied to fully connected layers with $p = 0 . 5$ . Two dropout layers were applied: one before the first fully connected layer and one before the second one. While the original version of VGG for CIFARs (Zagoruyko, 2015) exploits more dropout layers, we observed that any additional dropout layer deteriorates the performance of the model in ether deterministic or stochastic mode. Dropout for WideResNet was applied in accordance with the original paper (Zagoruyko & Komodakis, 2016) with $p = 0 . 3$ . Dropout usually increases the time needed to achieve convergence. Because of this, WideResNet networks with dropout were trained for 400 epochs instead of 300 epochs for deterministic case, and VGG networks have always been trained with dropout. All the other hyperparameters were the same as in the case of conventional models. + +Variational Inference Variational Inference (VI) approximates the true posterior distribution over weights $p ( w | D a t a )$ with a tractable variational approximation $q _ { \theta } ( w )$ by maximizing a so-called variational lower bound $\mathcal { L }$ (eq. 11) w.r.t. the parameters of variational approximation $\theta$ . We used a fully-factorized Gaussian approximation $q ( w )$ and Gaussian prior distribution $p ( w )$ . + +$$ +\mathcal { L } ( \theta ) = \mathbb { E } _ { q } \log p ( y ^ { * } \mid x , w ) - K L ( q _ { \theta } ( w ) \mid \mid p ( w ) ) \to \operatorname* { m a x } _ { \theta } +$$ + +$$ +q ( w ) = \mathcal { N } ( w \mid \mu , \mathrm { d i a g } ( \sigma ^ { 2 } ) ) \quad p ( w ) = N ( w \mid 0 , \mathrm { d i a g } ( \sigma _ { p } ^ { 2 } ) ) , \mathrm { w h e r e } \sigma _ { p } ^ { 2 } = ( N \cdot \mathrm { w d } ) ^ { - 1 } +$$ + +Table 2: Optimal noise scale for K-FAC Laplace for different datasets and architectures. For ResNet50 on ImageNet, the optimal scale found was 2.0 with test-time augmentation and 6.8 without test-time augmentation. + +
Optimal noise scale
ArchitectureCIFAR-10 CIFAR-10-augCIFAR-100 CIFAR-100-aug
VGG16BN0.0420.0420.1000.100
PreResNet1100.2130.1410.4780.401
PreResNet1640.1200.1050.2850.225
WideResNet28x100.0220.0180.0220.004
+ +In the case of such a prior, the probabilistic model remains consistent with the conventional training which corresponds to MAP inference in the same probabilistic model. We used variational inference for both convolutional and fully-connected layers where variances of the weights were parameterized by $\log \sigma$ . For fully-connected layers we applied the local reparameterization trick (LRT, (Kingma et al., 2015)). + +While variational inference provides a theoretically grounded way to approximate the true posterior, it tends to underfit deep learning models in practice (Kingma et al., 2015). The following tricks are applied to deal with it: pre-training (Molchanov et al., 2017) or equivalently annealing of $\beta$ (Sønderby et al., 2016), and scaling $\beta$ down (Kingma et al., 2015; Ullrich et al., 2017). + +During pre-training we initialize $\mu$ with a snapshot of weights of a pre-trained conventional model, and initialize $\log \sigma$ with a model-specific constant $\log \sigma _ { i n i t }$ . The KL-divergence – except for the term corresponding to the weight decay – is scaled with a model-specific parameter $\beta$ . The weight decay term is implemented as a part of the optimizer. We used a fact that the KL-divergence between two Gaussian distributions can be rewritten as two terms, one of which is equivalent to the weight decay regularization. + +On CIFAR-10 and CIFAR-100 we used $\beta$ equal to 1e-4 for VGG, ResNet100 and ResNet164 networks, and $\beta$ equal to 1e-5 for WideResNet. Log-variance $\log \sigma _ { i n i t }$ was initialized with $- 5$ for all models. Parameters $\mu$ were optimized with SGD in the same manner as in the case of conventional networks except that the initial learning rate $l r _ { i n i t }$ was set to 1e-3. We used a separate Adam optimizer with a constant learning rate of 1e-3 to optimize log-variances of the weights $\log \sigma$ . Pretraining was done for 300 epochs, and after that the remaining part of training was done for 100 epochs. On ImageNet we used $\beta = 1 \mathrm { e } { - 3 }$ , $l r _ { i n i t } = 0 . 0 1$ , $\log { \sigma _ { i n i t } } = - 6$ , and trained the model for 45 epochs after pre-training. + +K-FAC Laplace The Laplace approximation uses the curvature information of the appropriately scaled loss function to construct a Gaussian approximation to the posterior distribution. Ideally, one would use the Hessian of the loss function as a covariance matrix and use the maximum a posteriori estimate $w ^ { M A P }$ as a mean of the Gaussian approximation: + +$$ +\begin{array} { c } { \log p ( \boldsymbol { w } \mid \boldsymbol { x } , \boldsymbol { y } ^ { * } ) = \log p ( \boldsymbol { y } ^ { * } \mid \boldsymbol { x } , \boldsymbol { w } ) + \log p ( \boldsymbol { w } ) + \mathrm { c o n s t } } \\ { \boldsymbol { w } ^ { M A P } = \arg \operatorname* { m a x } _ { \boldsymbol { w } } \log p ( \boldsymbol { w } \mid \boldsymbol { x } , \boldsymbol { y } ^ { * } ) ; \quad \Sigma = - \nabla \nabla \log p ( \boldsymbol { w } \mid \boldsymbol { x } , \boldsymbol { y } ^ { * } ) } \\ { p ( \boldsymbol { w } \mid \boldsymbol { x } , \boldsymbol { y } ^ { * } ) \approx \mathcal { N } ( \boldsymbol { w } \mid \boldsymbol { w } ^ { M A P } , \Sigma ) } \end{array} +$$ + +In order to keep the method scalable, we use the Fisher Information Matrix as an approximation to the true Hessian (Martens & Grosse, 2015). For K-FAC Laplace, we use the whole dataset to construct an approximation to the empirical Fisher Information Matrix, and use the $\pi$ correction to reduce the bias (Ritter et al., 2018; Martens & Grosse, 2015). Following (Ritter et al., 2018), we find the optimal noise scale for K-FAC Laplace on a held-out validation set by averaging across five random initializations. We then reuse this scale for networks trained without a hold-out validation set. We report the optimal values of scales in Table 2. Note that the optimal scale is different depending on whether we use test-time data augmentation or not. Since the data augmentation also introduces some amount of additional noise, the optimal noise scale for K-FAC Laplace with data augmentation is lower. + +Snapshot ensembles Snapshot ensembles (SSE) (Huang et al., 2017) is a simple example of an array of methods which collect samples from a training trajectory of a network in weight space to construct an ensemble. Samples are collected in a cyclical manner: during each cycle the learning rate goes from a large value to near-zero and snapshot of weights of the network is taken at the end of the cycle. SSE uses SGD with a cosine learning schedule defined as follows: + +$$ +\alpha ( t ) = \frac { \alpha _ { 0 } } 2 \left( \cos \left( \frac { \pi \ \mathrm { m o d } \ ( t - 1 , \lceil T / M \rceil ) } { \lceil T / M \rceil } \right) + 1 \right) , +$$ + +where $\alpha _ { 0 }$ is the initial learning rate, $T$ is the total number of training iterations and $\mathbf { M }$ is the number of cycles. + +For all datasets and models hyperparameters from the original SSE paper are reused. For CIFAR10/100 length of the cycle is 40 epochs, maximum learning rate is 0.2, batch size is 64. On ResNet50 and ImageNet length of the cycle is 45 epochs, maximum learning rate is 0.1, batch size is 256. + +Cyclical SGLD Cyclical Stochastic Gradient Langevin Dynamics (cSGLD) (Zhang et al., 2019) is a state-of-the-art ensembling method for deep neural networks pertaining to stochastic Markov Chain Monte Carlo family of methods. It bears similarity to SSE, e.g. it employs SGD with a learning rate schedule described with the equation 16 and training is cyclical in the same manner. Its main differences from SSE are the introduction of gradient noise and the capturing of several snapshots per cycle, both of which can aid in sampling from posterior distribution over neural network weights efficiently. + +Some parameters from the original paper are reused: length of cycle is 50 epochs, maximum learning rate is 0.5, batch size is 64. Number of epochs with gradient noise per cycle is 3 epochs. This was found to yield much higher predictive performance and better uncertainty estimation compared to the original paper choice of 10 epochs for CIFAR-10 and 3 epochs for CIFAR-100. + +Finally, the results of cyclical Stochastic Gradient Hamiltonian Monte Carlo (SGHMC), (Zhang et al., 2019) which reportedly has marginally better performance compared with cyclical SGLD, could not be reproduced with any value of SGD momentum term. Because of this, we only include cyclical SGLD in our benchmark. + +FGE Fast Geometric Ensembling (FGE) is an ensembling method that is similar to SSE in that it collects weight samples from a training trajectory to construct an ensemble. Its main differences from SSE are pretraining, short cycle length and a piecewise-linear learning rate schedule: + +$$ +\begin{array} { r } { \alpha ( i ) = \left\{ \begin{array} { l l } { ( 1 - 2 t ( i ) ) \alpha _ { 1 } + 2 t ( i ) \alpha _ { 2 } \quad } & { 0 < t ( i ) \le \frac { 1 } { 2 } } \\ { ( 2 - 2 t ( i ) ) \alpha _ { 2 } + ( 2 t ( i ) - 1 ) \alpha _ { 1 } \quad \frac { 1 } { 2 } < t ( i ) \le 1 } \end{array} \right. . } \end{array} +$$ + +Hyperparameters of the original implementation of FGE are reused. Model pretraining is done with SGD for 160 epochs according to the standard learning rate schedule described in equation 10 with maximum learning rates from Table 1. After that, a desired number of FGE cycles is done with one snapshot per cycle collected. For VGG the learning rate is changed with parameters $\alpha _ { 1 } ~ =$ $1 e - 2 , \alpha _ { 2 } = 5 e - 4$ in a cycle with cycle length of 2 epochs. For other networks the learning rate is changed with parameters $\alpha _ { 1 } = 5 e - 2 , \alpha _ { 2 } = 5 e - 4$ with cycle length of 4 epochs. Batch size is 128. + +SWAG SWA-Gaussian (SWAG) (Maddox et al., 2019) is an ensembling method based on fitting a Gaussian distribution to model weights on the SGD training trajectory and sampling from this distribution to construct an ensemble. + +Like FGE, SWAG has a pretraining stage which is done according to the standard learning rate schedule described in equation 10 with maximum learning rates from Table 1. After that, training continues with a constant learning rate of 1e-2 for all models except for PreResNet110 and PreResNet164 on CIFAR-100 where it continues with a constant learning rate of 5e-2 in accordance with the original paper. Rank of the empirical covariance matrix which is used for estimation of Gaussian distribution parameters is set to be 20. + +![](images/2a825137f49c7974e6db16204b1deb20b2f92b8075de353a11ccc2ad4f4c35fa.jpg) +Figure 8: The average log-likelihood vs the Brier score on a test dataset for different ensemble methods on CIFAR-10 (a) and CIFAR-10 (b) and ImageNet (c) datasets. While not being equivalent, these metrics demonstrate a strong linear correlation. The correlation coefficient is denoted as $\rho$ . + +![](images/f79eb25efb99dc1d1cf2252961481981546a627b7c3560dc947a9f166feb89fb.jpg) +Figure 9: Log-likelihood vs accuracy for different ensembles before (a, c, e) and after (b, d, f) calibration. Both plain log-likelihood and especially calibrated log-likelihood are highly correlated with accuracy. + +![](images/1c82cd765d3fe4c675cf5745ced5b5595d028f7bbbfc9baf50458fca311762fb.jpg) +Figure 10: A side-by-side comparison of log-likelihood and calibrated log-likelihood on CIFAR-10 (a) and CIFAR-100 (b) datasets. On CIFAR-10 the performance of one network becomes close to dropout, variational inference (vi), and K-FAC Laplace approximation (kfacl) after calibration on all models except VGG. On CIFAR-100 deep ensembles move to the first position in the ranking after calibration on WideResNet and VGG. See Section 3.1 for details on the calibrated log-likelihood. + +![](images/8f837d5863b3595ff9cc80d99dbb23acb46b6f3ce2f4945af33c61bff0c683c4.jpg) +Figure 11: The deep ensemble equivalent of various ensembling techniques on ImageNet. Solid lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is shaded. Columns 2–4 correspond to DEE based on other metrics, defined similarly to the loglikelihood-based DEE. The results are consistent for all metrics + +![](images/dc519f6110a305db8a3aad6a42faf32c4c983c8b916344cd0632e17670f2194b.jpg) +Figure 12: The deep ensemble equivalent of various ensembling techniques on CIFAR-10. Solid lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is shaded. Lines 2–4 correspond to DEE based on other metrics, defined similarly to the log-likelihoodbased DEE. Note that while the actual scale of DEE varies from metric to metric, the ordering of different methods and the overall behaviour of the lines remain the same. + +SSE outperforms deep ensembles on CIFAR-10 on the WideResNet architecture. It possibly indicates that the cosine learning rate schedule and longer training of SSE are more suitable for this architecture than the piecewise-linear learning rate schedule and the number of epochs used in deep ensembles. + +![](images/0f9191ac394276b345b9ff56a48f66b2bbb712f94543168240fb11d445daae9b.jpg) +Figure 13: The deep ensemble equivalent of various ensembling techniques on CIFAR-100. Solid lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is shaded. Lines 2–4 correspond to DEE based on other metrics, defined similarly to the log-likelihoodbased DEE. Note that while the actual scale of DEE varies from metric to metric, the ordering of different methods and the overall behaviour of the lines remain the same. + +
Model MethodError (%) Negative calibrated log-likelihood
15 101001 5 10 100
Dropout5.86±0.095.81±0.085.82±0.065.79±0.070.232±0.005 0.225±0.0040.224±0.004 0.223±0.003
SWA-Gaussian7.03±0.505.66±0.085.49±0.125.25±0.130.230±0.0140.182±0.0030.171±0.002 0.160±0.002
Cyclic SGLD7.37±0.166.56±0.095.71±0.064.84±0.040.234±0.0040.196±0.0040.176±0.003 0.147±0.003
Fast Geometric Ens.6.52±0.165.95±0.165.69±0.165.10±0.130.213±0.0050.187±0.0030.178±0.003 0.155±0.004
VGG16Deep Ensembles5.95±0.144.79±0.114.57±0.074.39±NA0.226±0.0010.158±0.0020.134±NA
CIFAR-10Single model5.83±0.115.83±0.115.83±0.115.83±0.110.223±0.0020.223±0.0020.223+0.002 0.223+0.002
Variational Inf. (FFG)6.57±0.095.63±0.135.50±0.105.46±0.030.239±0.0020.192±0.0020.184±0.002 0.175±0.001
KFAC-Laplace6.00±0.135.82±0.125.82±0.195.80±0.190.210±0.005 0.203±0.0070.201±0.007 0.200±0.008
Snapshot Ensembles7.76±0.225.52±0.135.00±0.104.54±0.050.247±0.0050.176±0.0010.160±0.001 0.137±0.001
SWA-Gaussian5.77±0.454.56±0.174.46±0.124.34±0.130.178±0.0090.143±0.0040.178±0.009 0.143±0.004 0.139±0.003 0.131±0.003
Cyclic SGLD6.18±0.205.32±0.154.55±0.133.83±0.020.185±0.0060.156±0.0050.138±0.002 0.115±0.001
Fast GeometricEns.5.52±0.094.83±0.084.73±0.104.28±0.050.163±0.0020.141±0.0030.137±0.003 0.126±0.002
ResNet110Deep Ensembles4.66±0.113.77±0.113.63±0.073.53±NA0.148±0.0040.117±0.0020.106±NA
CIFAR-10Single model4.69±0.114.69±0.114.69±0.114.69±0.110.150±0.0020.150±0.0020.150±0.003 0.150±0.002
Variational Inf. (FFG)5.57±0.264.91±0.154.72±0.134.60±0.030.178±0.0030.149±0.0010.144±0.001 0.140±0.000
KFAC-Laplace5.81±0.395.14±0.154.90±0.144.78±0.080.187±0.0140.160±0.0070.147±0.003
Snapshot Ensembles8.41±0.274.85±0.114.16±0.163.52±0.100.252±0.0060.153±0.0020.132±0.002 0.107±0.001
SWA-Gaussian5.41±0.714.21±0.194.21±0.234.02±0.140.171±0.0280.130±0.0040.128±0.004 0.121±0.002
Cyclic SGLD5.80±0.214.97±0.124.30±0.083.66±0.060.178±0.0040.149±0.0040.131±0.003 0.110±0.001
Fast Geometric Ens.5.22±0.074.49±0.064.36±0.074.09±0.120.157±0.0030.134±0.0020.130±0.001 0.119±0.002
ResNet164Deep Ensembles4.53±0.113.51±0.093.50±0.063.34±NA0.147±0.0020.113±0.0010.107±0.001 0.100±NA
CIFAR-10Single model4.52±0.114.52±0.114.52±0.114.52±0.110.144±0.0020.144±0.0030.144±0.002 0.144±0.003
Variational Inf. (FFG)5.62±0.144.78±0.054.66±0.054.55±0.080.183±0.0040.151±0.0010.146±0.001 0.141±0.001
KFAC-Laplace5.23±0.294.77±0.234.65±0.174.60±0.090.168±0.0080.151±0.0070.146±0.005 0.142±0.004
Snapshot Ensembles8.06±0.104.50±0.043.89±0.093.50±0.050.241±0.0040.144±0.0030.124±0.002 0.104±0.001
Dropout3.88±0.123.70±0.183.63±0.193.64±0.170.130±0.0020.120±0.0020.130±0.002 0.120±0.002 0.119±0.001 0.117±0.002
SWA-Gaussian4.98±1.173.53±0.093.34±0.143.28±0.100.157±0.0360.111±0.0040.105±0.0030.101±0.002
Cyclic SGLD4.78±0.164.09±0.113.63±0.133.19±0.040.155±0.0030.128±0.0020.114±0.0010.099±0.002
Fast Geometric Ens.4.86±0.173.95±0.073.77±0.103.34±0.060.148±0.0030.120±0.0020.113±0.0020.102±0.001
WideResNetDeepEnsembles3.65±0.023.11±0.103.01±0.062.83±NA0.123±0.0020.097±0.0010.095±0.0010.090±NA
CIFAR-10Single model3.70±0.153.70±0.153.70±0.153.70±0.150.124±0.0050.124±0.0050.125±0.0050.124±0.005
Variational Inf. (FFG)5.61±0.044.15±0.153.94±0.103.64±0.070.189±0.0020.134±0.0020.127±0.0020.117±0.001
KFAC-Laplace4.03±0.193.90±0.153.88±0.223.83±0.160.134±0.0040.124±0.0040.122±0.0050.120±0.003
Snapshot Ensembles5.56±0.153.68±0.093.33±0.102.89±0.070.179±0.0050.119±0.0010.105±0.0010.090±0.001
Dropout26.10±0.2025.68±0.1825.66±0.1425.60±0.171.176±0.0081.111±0.0081.098±0.0091.084±0.009
SWA-Gaussian27.74±1.8724.53±0.0923.64±0.2822.97±0.201.109±0.0730.931±0.0070.879±0.0070.826±0.005
Cyclic SGLD29.75±0.1726.79±0.1924.14±0.1121.15±0.111.114±0.0030.976±0.0040.881±0.0060.749±0.004
Fast Geometric Ens.27.07±0.2425.35±0.2924.68±0.4022.78±0.221.057±0.0100.965±0.0030.930±0.0030.827±0.004
VGG16Deep Ensembles25.72±0.1721.60±0.1320.79±0.1619.88±NA1.092±0.0040.840±0.0050.794±0.0020.723±NA
CIFAR-100Single model25.44±0.2925.44±0.2925.44±0.2925.44±0.291.087±0.0061.087±0.0061.087±0.0061.087±0.006
Variational Inf.(FFG)27.24±0.0925.24±0.1124.85±0.0524.56±0.071.154±0.0041.001±0.0020.973±0.0020.939±0.001
KFAC-Laplace27.11±0.5925.98±0.2125.84±0.3825.70±0.381.174±0.0371.089±0.0071.069±0.0051.050±0.008
Snapshot Ensembles31.19±0.3323.87±0.1822.31±0.3121.03±0.101.170±0.0120.899±0.0040.834±0.005 0.751±0.003
SWA-Gaussian27.75±0.7622.31±0.2221.52±0.3020.69±0.190.960±0.0330.781±0.0110.745±0.0100.701±0.008
Cyclic SGLD25.73±0.1423.30±0.1921.20±0.2118.07±0.160.914±0.0060.818±0.0040.753±0.0020.630±0.002
Fast Geometric Ens.22.84±0.1621.22±0.2020.79±0.2319.64±0.15(0.798±0.0060.729±0.0030.713±0.002:0.679±0.002
ResNet110Deep Ensembles22.55±0.2818.30±0.2217.59±0.2116.97±NA0.847±0.0070.675±0.0010.638±0.0010.594±NA
CIFAR-100Single model22.66±0.3122.66±0.3122.66±0.3122.66±0.310.848±0.0140.848±0.0150.848±0.0140.848±0.015
VariationalInf.(FFG)24.27±0.2622.41±0.1322.14±0.1221.86±0.070.924±0.0070.829±0.0030.813±0.0010.795±0.001
KFAC-Laplace24.88±0.9722.87±0.4422.41±0.2622.14±0.290.948±0.0360.858±0.0140.836±0.0100.812±0.010
Snapshot Ensembles30.30±0.4022.83±0.2321.13±0.1418.48±0.251.069±0.0060.820±0.0030.761±0.0020.662±0.002
SWA-Gaussian24.38±0.9320.62±0.1820.08±0.1919.48±0.190.844±0.0420.719±0.0060.700±0.006 0.667±0.004
Cyclic SGLD24.87±0.3922.37±0.2720.23±0.2217.13±0.180.888±0.0080.790±0.009
Fast Geometric Ens.21.92±0.1520.10±0.2219.87±0.2518.73±0.250.765±0.0030.699±0.0040.686±0.0040.650±0.003
ResNet164CIFAR-100Deep EnsemblesSingle model21.41±0.2517.53±0.1716.90±0.1516.50±NA0.819±0.0080.647±0.0030.615±0.0020.574±NA
CIAR-100Single modelVariational Inf. (FFG)23.47±0.2621.35±0.1121.10±0.1620.82±0.040.910±0.0010.801±0.0020.782±0.0020.762±0.000
KFAC-Laplace23.44±0.4521.77±0.2021.29±0.23221.03±0.380.902±0.0190.813±0.0060.792±0.0050.772±0.007
Snapshot Ensembles29.48±0.1921.92±0.1820.27±0.2317.68±0.071.045±0.0050.789±0.0050.729±0.004 0.634±0.003
Dropout20.19±0.11 19.41±0.1719.36±0.1219.22±0.150.823±0.0080.768±0.0050.760±0.006 0.751±0.005
SWA-Gaussian20.45±0.73 17.57±0.1717.21±0.2217.08±0.190.794±0.0250.653±0.0040.634±0.005 0.614±0.005
Cyclic SGLD21.42±0.3219.42±0.2817.88±0.1616.29±0.100.813±0.0100.713±0.0090.654±0.005 0.583±0.004
Fast Geometric Ens.21.48±0.3118.54±0.1618.00±0.1917.12±0.160.770±0.0070.652±0.0060.630±0.006 0.596±0.003
WideResNetDeepEnsembles19.38±0.2016.55±0.0816.17±0.1515.77±NA0.797±0.0070.623±0.0030.595±0.003 0.571±NA
CIFAR-100SSingle model19.31±0.2419.31±0.2419.31±0.2419.31±0.240.797±0.0100.797±0.0100.797±0.010 0.797±0.010
VariationalInf. (FFG)24.38±0.2720.17±0.1519.28±0.0918.74±0.081.004±0.0110.767±0.0040.727±0.003 0.685±0.002
KFAC-Laplace20.02±0.18 19.76±0.1519.53±0.1919.43±0.210.834±0.0090.803±0.006 0.795±0.007 0.789±0.006
Snapshot Ensembles23.01±0.26 18.20±0.1317.12±0.3116.07±0.070.859±0.009 0.678±0.006 0.633±0.008 0.582±0.004
+ +Table 3: Classification error and negative calibrated log-likelihood for different models and numbers of samples on CIFAR-10/100. + +
Error (%) Negative calibrated log-likelihood
ModelMethod5 10 100 510100
Dropout5.81 vs 5.525.82 vs 5.345.79 vs 5.210.225 vs 0.1870.224 vs 0.1770.223 vs 0.167
SWA-Gaussian5.66 vs 5.655.49 vs 5.365.25 vs 5.080.182 vs 0.1800.171 vs 0.1660.160 vs 0.152
Cyclic SGLD6.56 vs 6.075.71 vs 5.474.84 vs 4.880.196 vs 0.1860.176 vs 0.1690.147 vs 0.147
Fast Geometric Ens.5.95 vs 5.645.69 vs 5.365.10 vs 4.98~0.187 vs 0.1770.178 vs 0.1670.155 vs 0.150
VGG16Deep Ensembles4.79 vs 4.904.57 vs 4.734.39 vs 4.55个0.158 vs 0.1620.148 vs 0.1520.134 vs 0.136个
CIFAR-10Single model5.83 vs 5.555.83 vs 5.355.83 vs 5.19↓0.223 vs 0.1830.223 vs 0.1740.223 vs 0.166
VariationalInf.(FFG)5.63vs5.435.50 vs 5.255.46 vs 5.070.192 vs 0.1820.184 vs 0.1690.175 vs 0.154
KFAC-Laplace5.82 vs 5.495.82 vs 5.325.80 vs 5.170.203 vs 0.1770.201 vs 0.1710.200 vs 0.164
Snapshot Ensembles5.52 vs 5.61~5.00 vs 5.03~4.54 vs 4.640.176 vs 0.178个0.160 vs 0.160~0.137 vs 0.137
SWA-Gaussian4.56 vs 4.47~4.46 vs 4.344.34 vs 4.160.143 vs 0.1420.139 vs 0.1350.131 vs 0.125
Cyclic SGLD5.32 vs 4.884.55 vs 4.353.83 vs 3.590.156 vs 0.1480.138 vs 0.1310.115 vs 0.111
Fast Geometric Ens.4.83 vs 4.594.73 vs 4.444.28 vs 4.140.141 vs 0.1380.137 vs 0.1320.126 vs 0.121
ResNet110Deep Ensembles3.77 vs 3.703.63 vs 3.583.53 vs 3.450.117 vs 0.1180.112 vs 0.1120.106 vs 0.105
CIFAR-10Single model4.69 vs 4.324.69 vs 4.234.69 vs 4.100.150 vs 0.1370.150 vs 0.1340.150 vs 0.131
Variational Inf.(FFG)44.91 vs 4.664.72 vs 4.434.60 vs 4.250.149 vs 0.1450.144 vs 0.1380.140 vs 0.130
KFAC-Laplace5.14 vs 4.434.90 vs 4.274.78 vs 4.170.160 vs 0.1390.153 vs 0.1340.147 vs 0.130
Snapshot Ensembles4.85 vs 4.78~4.16 vs 4.183.52 vs 3.480.153 vs 0.1500.132 vs 0.1300.107 vs 0.106
SWA-Gaussian4.21 vs 4.174.21 vs 4.04~4.02 vs 3.840.130 vs 0.130~0.128 vs 0.126~0.121 vs 0.116
Cyclic SGLD4.97 vs 4.674.30 vs 4.013.66 vs 3.480.149 vs 0.1410.131 vs 0.1250.110 vs 0.107
Fast Geometric Ens.4.49 vs 4.294.36 vs 4.154.09 vs 3.850.134 vs 0.1310.130 vs 0.1260.119 vs 0.115
ResNet164Deep Ensembles3.51 vs 3.583.50 vs 3.463.34 vs 3.300.113 vs 0.1140.107 vs 0.1070.100 vs 0.101个
CIFAR-10Single model4.52 vs 4.154.52 vs 4.084.52 vs 3.980.144 vs 0.1310.144 vs 0.1280.144 vs 0.126
VariationalInf.(FFG)4.78vs 4.414.66 vs 4.224.55 vs 4.050.151 vs 0.1420.146 vs 0.1350.141 vs 0.128
KFAC-Laplace4.77 vs 4.264.65 vs 4.214.60 vs 4.080.151 vs 0.1350.146 vs 0.1320.142 vs 0.127
Snapshot Ensembles4.50 vs 4.423.89 vs 3.873.50 vs 3.350.144 vs 0.1420.124 vs 0.1230.104 vs 0.104
Dropout3.70 vs 3.62~3.63 vs 3.523.64 vs 3.440.120 vs 0.1170.119 vs 0.1140.117 vs 0.111
SWA-Gaussian3.53 vs 3.59~3.34 vs 3.34~3.28 vs 3.24~0.111 vs 0.1140.105 vs 0.1070.101 vs 0.102
Cyclic SGLD4.09 vs 3.95~3.63 vs 3.583.19 vs 3.22~0.128 vs 0.1250.114 vs 0.1120.099 vs 0.100个
Fast Geometric Ens.3.95 vs 3.90~3.77 vs 3.643.34 vs 3.270.120 vs 0.120~0.113 vs 0.1130.102 vs 0.102
WideResNetDeepEnsembles3.11 vs 3.21个3.01 vs 3.022.83 vs 2.910.097 vs 0.1030.095 vs 0.0980.090 vs 0.094
CIFAR-10Single model3.70 vs 3.533.70 vs 3.453.70 vs 3.400.124 vs 0.117↓0.125 vs 0.114↓0.124 vs 0.113
VariationalInf.(FFG)4.15vs4.053.94 vs 3.803.64 vs 3.63~0.134 vs 0.1360.127 vs 0.1260.117 vs 0.116
KFAC-Laplace3.90 vs 3.633.88 vs 3.583.83vs 3.500.124 vs 0.1150.122 vs 0.1130.120 vs 0.111
Snapshot Ensembles3.68 vs 3.743.33 vs 3.352.89 vs 2.900.119 vs 0.122个0.105 vs 0.107个0.090 vs 0.093
Dropout25.68 vs 24.3725.66 vs 23.8925.60 vs 23.411.111 vs 0.9991.098 vs 0.960↓1.084 vs 0.911
SWA-Gaussian24.53 vs 24.2823.64 vs 23.2722.97 vs 22.340.931 vs 0.9260.879 vs 0.8590.826 vs 0.795
Cyclic SGLD26.79 vs 25.6624.14 vs 23.4521.15 vs 21.040.976 vs 0.9290.881 vs 0.8480.749 vs 0.740
Fast Geometric Ens.25.35 vs 24.5324.68 vs 23.6222.78 vs 22.200.965 vs 0.9210.930 vs 0.8780.827 vs 0.800
VGG16Deep Ensembles21.60 vs 21.90个20.79 vs 21.0319.88 vs 20.230.840 vs 0.865个0.794 vs 0.811个0.723 vs 0.731
CIFAR-100Single model25.44 vs 24.3825.44 vs 23.9225.44 vs 23.481.087 vs 0.9731.087 vs 0.9451.087 vs 0.912
VariationalInf.(FFG)25.24vs24.1924.85 vs 23.5624.56 vs 22.891.001 vs 0.9640.973 vs 0.9190.939 vs 0.864
KFAC-Laplace25.98 vs 24.5325.84 vs 24.0325.70 vs 23.571.089 vs 0.9891.069 vs 0.9491.050 vs 0.909
Snapshot Ensembles23.87 vs 23.8822.31 vs 22.5021.03 vs 21.040.899 vs 0.905~0.834 vs 0.836~0.751 vs 0.750
SWA-Gaussian22.31 vs 22.20~21.52 vs 21.21~20.69 vs 20.280.781 vs 0.7700.745 vs 0.7300.701 vs 0.683
Cyclic SGLD23.30 vs 22.3221.20 vs 20.4318.07 vs 17.670.818 vs 0.7870.753 vs 0.7250.630 vs 0.616
Fast Geometric Ens.21.22 vs 20.6920.79 vs 20.1819.64 vs 19.250.729 vs 0.7140.713 vs 0.6940.679 vs 0.661
ResNet110Deep Ensembles18.30 vs 18.3617.59 vs 17.6116.97 vs 16.740.675 vs 0.6720.638 vs 0.6350.594 vs 0.591
CIFAR-100Single model22.66 vs 21.3722.66 vs 21.1722.66 vs 20.980.848 vs 0.7970.848 vs 0.7860.848 vs 0.775
Variational Inf. (FFG)22.41 vs 21.6722.14 vs 21.2121.86 vs 20.770.829 vs 0.7990.813 vs 0.7750.795 vs 0.748
KFAC-Laplace22.87 vs 21.6922.41 vs 21.2822.14 vs 20.990.858 vs 0.8100.836 vs 0.7880.812 vs 0.766
Snapshot Ensembles22.83 vs 22.3321.13 vs 20.7118.48 vs 18.230.820 vs 0.8060.761 vs 0.7440.662 vs 0.651
SWA-Gaussian20.62 vs 20.6120.08 vs 20.0819.48 vs 19.330.719 vs 0.7150.700 vs 0.6900.667 vs 0.654
Cyclic SGLD22.37 vs 21.5720.23 vs 19.5817.13 vs 16.990.790 vs 0.7670.722 vs 0.7020.606 vs 0.595
Fast Geometric Ens.20.10 vs 19.8219.87 vs 19.3918.73 vs 18.330.699 vs 0.6890.686 vs 0.6710.650 vs 0.636
ResNet164Deep Ensembles17.53 vs 17.5716.90 vs 16.8416.50 vs 16.220.647 vs 0.650~0.615 vs 0.6130.574 vs 0.575
CIFAR-100Single model21.39 vs 20.6021.39 vs 20.3921.39 vs 20.230.817 vs 0.7720.817 vs 0.7610.817 vs 0.751
VariationalInf.(FFG)21.35vs 21.0621.10 vs 20.5420.82 vs 19.970.801 vs 0.7850.782 vs 0.7590.762 vs 0.731
KFAC-Laplace21.77 vs 20.6621.29 vs 20.3621.03 vs 20.180.813 vs 0.7780.792 vs 0.7580.772 vs 0.740
Snapshot Ensembles21.92 vs 21.6920.27 vs 19.9217.68 vs 17.660.789 vs 0.7810.729 vs 0.7200.634 vs 0.629
Dropout19.41 vs 19.2719.36 vs 19.1119.22 vs 18.880.768 vs 0.7510.760 vs 0.7380.751 vs 0.723
Cyclic SGLD19.42 vs 18.8317.88 vs 17.5016.29 vs 16.210.713 vs 0.6960.654 vs 0.6410.583 vs 0.580
Fast Geometric Ens.18.54 vs 18.3918.00 vs 17.8417.12 vs 16.930.652 vs 0.6490.630 vs 0.6240.596 vs 0.592
WideResNetDeepEnsembles16.55 vs 16.84个16.17 vs 16.3015.77 vs 15.770.623 vs 0.632个0.595 vs 0.6020.571 vs 0.573个
CIFAR-100Singlemodel19.31 vs 18.8319.31 vs 18.8019.31 vs 18.720.797 vs 0.7550.797 vs 0.7460.797 vs 0.738
VariationalInf.(FFG)20.17vs20.1219.28 vs 19.20~18.74 vs 18.540.767 vs 0.766~0.727 vs 0.7240.685 vs 0.679
KFAC-Laplace19.76 vs 19.2119.53 vs 19.0319.43 vs 18.930.803 vs 0.7640.795 vs 0.757↓0.789 vs 0.747
Snapshot Ensembles18.20 vs 18.2217.12 vs 17.2016.07 vs 16.27~0.678 vs 0.6800.633 vs 0.6350.582 vs 0.586个
+ +Table 4: Classification error and negative calibrated log-likelihood before vs. after test-time augmentation on CIFAR-10/100. + +Table 5: Deep ensemble equivalent score for CIFAR-10/100. + +
ModelDeep ensemble equivalent score
Method1 sample 5 samples 10 samples 50 samples 100 samples
VGG16 CIFAR-10Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.64.721.933.8
Cyclic SGLD1.0 1.72.67.410.5
SWA-Gaussian1.0 2.22.94.44.6
1.3 2.0
Fast Geometric Ens.2.44.75.8
Dropout1.0 1.01.01.11.1
Variational Inf. (FFG)1.0 1.82.02.52.6 1.6
KFAC-Laplace Single model1.4 1.6 1.11.6 1.11.6 1.11.1
ResNet110 CIFAR-101.1 5.094.6
Deep Ensembles1.0 1.0 1.010.0 2.048.032.6
Snapshot Ensembles1.0 1.01.614.66.0
Cyclic SGLD1.34.62.0
SWA-Gaussian1.01.51.9
Fast Geometric Ens.1.0 1.4 1.01.72.42.9
Variational Inf. (FFG)1.01.21.41.5
KFAC-Laplace1.0 1.01.01.01.1
Single model1.0 1.01.01.01.0
Deep Ensembles1.0 5.010.043.7100.0
ResNet164 CIFAR-101.0 1.12.311.317.2
Snapshot Ensembles Cyclic SGLD1.0 1.01.84.86.7
SWA-Gaussian1.0 1.81.92.52.7
Fast Geometric Ens.1.0 1.61.82.52.9
Variational Inf. (FFG)1.0 1.01.01.31.3
1.01.0 1.01.21.2
KFAC-Laplace1.11.1 1.11.11.1
Single model1.010.048.0
Deep Ensembles5.0 1.02.530.686.0 100.0
Snapshot Ensembles1.3 1.0 1.01.64.04.1
Cyclic SGLD SWA-Gaussian1.01.82.53.1 3.3
WideResNet Fast Geometric Ens. CIFAR-101.01.21.72.7 3.2
Dropout1.01.21.3 1.41.4
Variational Inf. (FFG)1.01.01.0 1.31.4
KFAC-Laplace1.01.01.0 1.21.2
Single model1.01.01.01.0
VGG16 CIFAR-1001.0
Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.95.418.826.8
Cyclic SGLD1.0 1.8 1.0 2.33.3 3.415.928.2
SWA-Gaussian1.2 1.92.35.25.9 5.8
Fast Geometric Ens.1.0 1.01.04.5 1.01.1
Dropout1.82.12.2
Variational Inf. (FFG)1.0 1.61.3
KFAC-Laplace Single model1.0 1.01.2 1.01.3 1.01.0
1.0 1.01.0
ResNet110 CIFAR-1005.010.050.099.0
Deep Ensembles Snapshot Ensembles1.0 1.31.94.76.2
1.02.07.012.2
Cyclic SGLD1.32.23.6
SWA-Gaussian1.0 1.7 1.5 2.63.03.3 4.24.7
Fast Geometric Ens. Variational Inf. (FFG)1.0 1.21.31.51.5
KFAC-Laplace1.0 1.01.11.31.4
Single model1.0 1.01.01.01.0
Deep Ensembles1.010.050.0100.0
Snapshot Ensembles5.0 1.0
ResNet164 CIFAR-1001.31.94.86.3
Cyclic SGLD SWA-Gaussian1.0 1.32.06.813.3
Fast Geometric Ens.1.0 2.1 1.6 2.62.6 3.03.6 4.23.8 4.8
Variational Inf. (FFG)1.0 1.21.41.61.6
KFAC-Laplace1.0 1.11.31.51.5
1.0
Single model1.01.01.01.0
WideResNet Fast Geometric Ens. CIFAR-100Dropout Variational Inf. (FFG) KFAC-LaplaceDeep Ensembles5.010.049.095.9
Snapshot Ensembles1.0 1.0 2.54.216.220.0
Cyclic SGLD SWA-Gaussian1.0 1.9 1.0 3.23.2 4.213.6 5.718.8 6.0
+ +Table 6: Classification error and negative calibrated log-likelihood for different numbers of samples on ImageNet. + +
Error (%)Negative calibrated log-likelihood
ModelMethod151050151050
Fast Geometric Ens.23.71±0.0023.61±0.0023.56±0.0023.28±0.000.929±0.0000.921±0.0000.916±0.0000.904±0.000
Deep Ensembles23.79±0.1421.19±0.14 20.90±0.08 20.63±NA0.935±0.007 0.823±0.002 0.805±0.0000.788±NA
ResNet50 Single model23.86±0.2023.86±0.2023.86±0.2023.86±0.200.938±0.0060.938±0.006:0.938±0.0060.938±0.006
Variational Inf.(FFG)24.50±0.06 23.82±0.03223.77±0.04 23.67±0.000.957±0.0010.927±0.0000.923±0.0010.920±0.000
KFAC-Laplace25.01±0.4924.19±0.2923.93±0.2023.86±0.160.988±0.0220.948±0.0130.939±0.0110.934±0.008
Snapshot Ensembles24.92±NA22.21±NA21.75±NA21.48±NA0.983±NA0.865±NA0.843±NA0.830±NA
+ +Table 7: Classification error and negative calibrated log-likelihood before vs. after test-time augmentation on ImageNet. + +
Error (%)Negative calibrated log-likelihood
ModelMethod5105051050
Fast Geometric Ens.23.61 vs 22.2123.56 vs 21.3723.28 vs 20.670.921 vs 0.8940.916 vs 0.8420.904 vs 0.793
Deep Ensembles21.19 vs 21.2020.90 vs 20.1620.63 vs 19.390.823 vs 0.855个0.805 vs 0.7930.788 vs 0.739
ResNet50 Single model23.86 vs 22.3923.86 vs 21.6023.86 vs 21.060.938 vs 0.9000.938 vs 0.8510.938 vs 0.805
Variational Inf. (FFG)23.82 vs 22.5823.77 vs 21.7423.67 vs 21.100.927 vs 0.9050.923 vs 0.8510.920 vs 0.805
KFAC-Laplace24.19 vs 22.5023.93 vs 21.6723.86 vs 21.040.948 vs 0.9060.939 vs 0.8550.934 vs 0.809
Snapshot Ensembles22.21 vs 21.9921.75 vs 20.8121.48 vs 19.860.865 vs 0.879个0.843 vs 0.8150.830 vs 0.763
+ +Table 8: Deep ensemble equivalent score for ImageNet. + +
Deep ensemble equivalent score
ModelMethod1 sample 5 samples 10 samples 25 samples 50 samples
Deep Ensembles1.05.010.025.050.0
Snapshot Ensembles1.02.23.24.04.2
ResNet50 Fast Geometric Ens.1.11.21.31.41.5
Variational Inf. (FFG)1.01.11.21.21.2
KFAC-Laplace1.01.01.01.01.0
Single model1.01.01.01.01.0
+ +![](images/06c0a02f97dac8847cb6e77106788659571be54f7441eec252ec711954a27069.jpg) +Figure 14: Classification error and negative calibrated log-likelihood before vs. after test-time aug mentation on CIFAR-10 + +![](images/972ed43a1c92f0c8398f5c3ca02ab2e95164ce635709284ce67e4c2b485dddf1.jpg) +Figure 15: Classification error and negative calibrated log-likelihood before vs. after test-time aug mentation on CIFAR-100 \ No newline at end of file diff --git a/parse/train/BJxI5gHKDr/BJxI5gHKDr_content_list.json b/parse/train/BJxI5gHKDr/BJxI5gHKDr_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..a6c013174d2238d58f4e7a90a187a6e3c1e8f0e6 --- /dev/null +++ b/parse/train/BJxI5gHKDr/BJxI5gHKDr_content_list.json @@ -0,0 +1,2579 @@ +[ + { + "type": "text", + "text": "PITFALLS OF IN-DOMAIN UNCERTAINTY ESTIMATION AND ENSEMBLING IN DEEP LEARNING ", + "text_level": 1, + "bbox": [ + 176, + 98, + 823, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Arsenii Ashukha ∗ Samsung AI Center Moscow, HSE‡ aashukha@bayesgroup.ru ", + "bbox": [ + 178, + 170, + 413, + 213 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Alexander Lyzhov ∗ Samsung AI Center Moscow, Skoltech†, HSE§ alyzhov@bayesgroup.ru ", + "bbox": [ + 519, + 170, + 818, + 213 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Dmitry Molchanov ∗ Samsung AI Center Moscow, HSE‡ dmolch@bayesgroup.ru ", + "bbox": [ + 178, + 234, + 413, + 276 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Dmitry Vetrov HSE‡, Samsung AI Center Moscow dvetrov@bayesgroup.ru ", + "bbox": [ + 522, + 234, + 753, + 276 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 314, + 544, + 329 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Uncertainty estimation and ensembling methods go hand-in-hand. Uncertainty estimation is one of the main benchmarks for assessment of ensembling performance. At the same time, deep learning ensembles have provided state-of-the-art results in uncertainty estimation. In this work, we focus on in-domain uncertainty for image classification. We explore the standards for its quantification and point out pitfalls of existing metrics. Avoiding these pitfalls, we perform a broad study of different ensembling techniques. To provide more insight in this study, we introduce the deep ensemble equivalent score (DEE) and show that many sophisticated ensembling techniques are equivalent to an ensemble of only few independently trained networks in terms of test performance. ", + "bbox": [ + 233, + 345, + 764, + 484 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "video / code / blog post ", + "text_level": 1, + "bbox": [ + 395, + 506, + 619, + 520 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 547, + 336, + 563 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Deep neural networks (DNNs) have become one of the most popular families of machine learning models. The predictive performance of DNNs for classification is often measured in terms of accuracy. However, DNNs have been shown to yield inaccurate and unreliable probability estimates, or predictive uncertainty (Guo et al., 2017). This has brought considerable attention to the problem of uncertainty estimation with deep neural networks. ", + "bbox": [ + 174, + 579, + 825, + 648 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "There are many faces to uncertainty estimation. Different desirable uncertainty estimation properties of a model require different settings and metrics to capture them. Out-of-domain uncertainty of the model is measured on the data that does not follow the same distribution as the training dataset (out-of-domain data). Out-of-domain data can include images corrupted with rotations or blurring, adversarial attacks (Szegedy et al., 2013) or data points from a completely different dataset. The model is expected to be resistant to data corruptions and to be more uncertain on out-of-domain data than on in-domain data. On the contrary, in-domain uncertainty of the model is measured on data taken from the training data distribution, i.e. data from the same domain. In this setting the model is expected to produce reliable probability estimates, e.g. the model shouldn’t be too overconfident in its wrong predictions. ", + "bbox": [ + 174, + 656, + 825, + 795 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Pitfalls of metrics We show that many common metrics of in-domain uncertainty estimation (e.g. log-likelihood, Brier score, calibration metrics, etc.) are either not comparable across different models or fail to provide a reliable ranking. We address some of the stated pitfalls and point out more reasonable evaluation schemes. For instance, although temperature scaling is not a standard for ensembling techniques, it is a must for a fair evaluation. With this in mind, the calibrated log-likelihood avoids most of the stated pitfalls and generally is a reasonable metric for in-domain uncertainty estimation task. ", + "bbox": [ + 174, + 801, + 823, + 871 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 132 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Pitfalls of ensembles Equipped with the proposed evaluation framework, we are revisiting the evaluation of ensembles of DNNs—one of the major tools for uncertainty estimation. We introduce the deep ensemble equivalent (DEE) score that measures the number of independently trained models that, when ensembled, achieve the same performance as the ensembling technique of interest. The DEE score allows us to compare ensembling techniques across different datasets and architectures using a unified scale. Our study shows that most of the popular ensembling techniques require averaging predictions across dozens of samples (members of an ensemble), yet are essentially equivalent to an ensemble of only few independently trained models. ", + "bbox": [ + 174, + 138, + 825, + 251 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Missing part of ensembling In our study, test-time data augmentation (TTA) turned out to be a surprisingly strong baseline for uncertainty estimation and a simple way to improve ensembles. Despite being a popular technique in large-scale classification, TTA seems to be overlooked in the community of uncertainty estimation and ensembling. ", + "bbox": [ + 174, + 257, + 825, + 313 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 SCOPE OF THE PAPER ", + "text_level": 1, + "bbox": [ + 176, + 333, + 383, + 348 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We use standard benchmark problems of image classification which comprise a common setting in research on learning ensembles of neural networks. There are other relevant settings where the correctness of probability estimates can be a priority, and ensembling techniques are used to improve it. These settings include, but are not limited to, regression, language modeling (Gal, 2016), image segmentation (Gustafsson et al., 2019), active learning (Settles, 2012) and reinforcement learning (Buckman et al., 2018; Chua et al., 2018). ", + "bbox": [ + 174, + 363, + 825, + 446 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We focus on in-domain uncertainty, as opposed to out-of-domain uncertainty. Out-of-domain uncertainty includes detection of inputs that come from a completely different domain or have been corrupted by noise or adversarial attacks. This setting has been thoroughly explored by (Ovadia et al., 2019). ", + "bbox": [ + 174, + 454, + 823, + 510 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We only consider methods that are trained on clean data with simple data augmentation. Some other methods use out-of-domain data (Malinin & Gales, 2018) or more elaborate data augmentation, e.g. mixup (Zhang et al., 2017) or adversarial training (Lakshminarayanan et al., 2017) to improve accuracy, robustness and uncertainty. ", + "bbox": [ + 174, + 517, + 825, + 573 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We use conventional training procedures. We use the stochastic gradient descent (SGD) and use batch normalization (Ioffe & Szegedy, 2015), both being the de-facto standards in modern deep learning. We refrain from using more elaborate optimization techniques including works on superconvergence (Smith & Topin, 2019) and stochastic weight averaging (SWA) (Izmailov et al., 2018). These techniques can be used to drastically accelerate training and to improve the predictive performance. Thus, we do not comment on the training time of different ensembling methods since the use of these and other more efficient training techniques would render such a comparison obsolete. ", + "bbox": [ + 174, + 580, + 825, + 678 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "A number of related works study ways of approximating and accelerating prediction in ensembles. The distillation mechanism allows to approximate the prediction of an ensemble by a single neural network (Hinton et al., 2015; Balan et al., 2015; Tran et al., 2020), whereas fast dropout (Wang & Manning, 2013) and deterministic variational inference (Wu et al., 2018) allow to approximate the predictive distribution of specific stochastic computation graphs. We measure the raw power of ensembling techniques without these approximations. ", + "bbox": [ + 174, + 684, + 825, + 768 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "All of the aforementioned alternative settings are orthogonal to the scope of this paper and are promising points of interest for further research. ", + "bbox": [ + 176, + 775, + 823, + 803 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "3 PITFALLS OF IN-DOMAIN UNCERTAINTY ESTIMATION ", + "text_level": 1, + "bbox": [ + 176, + 824, + 647, + 838 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "No single metric measures all the desirable properties of uncertainty estimates obtained by a model of interest. Because of this, the community is using many different metrics in an attempt to capture the quality of uncertainty estimation, such as the Brier score (Brier, 1950), log-likelihood (Quinonero-Candela et al., 2005), metrics of calibration (Guo et al., 2017; Nixon et al., 2019), performance of misclassification detection (Malinin & Gales, 2018), and threshold–accuracy curves (Lakshminarayanan et al., 2017). In the section we highlight the pitfalls of the aforementioned metrics, and demonstrate that these pitfalls can significantly affect evaluation, changing the ranking of the methods. ", + "bbox": [ + 174, + 853, + 823, + 922 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/d97acaa163ca38357212bbd72f60d4fc445d6e7aa0be224c9c8cf4a1312e3276.jpg", + "image_caption": [ + "Figure 1: The average log-likelihood of two different ensembling techniques for ResNet50 on ImageNet dataset before (solid) and after (dashed) temperature scaling. Without the temperature scaling, test-time data augmentation decreases the log-likelihood of plain deep ensembles. However, when the temperature scaling is enabled, deep ensembles with test-time data augmentation outperform plain deep ensembles. " + ], + "image_footnote": [], + "bbox": [ + 176, + 111, + 488, + 270 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/0c9b556ad42fcfa9d83f9f988497812e9a476b418a72ba3fcc791159192d282e.jpg", + "image_caption": [ + "Figure 2: Thresholded adaptive calibration error (TACE) is highly sensitive to the threshold and the number of bins. It does not provide a consistent ranking of different ensembling techniques. Here TACE is reported for VGG16BN model on CIFAR-100 dataset and is evaluated at the optimal temperature. " + ], + "image_footnote": [], + "bbox": [ + 503, + 107, + 802, + 267 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 449, + 825, + 492 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Notation We consider a classification problem with a dataset that consists of $N$ training and $n$ testing pairs $( x _ { i } , y _ { i } ^ { * } ) \\sim p ( x , y )$ , where $x _ { i }$ is an object and $y _ { i } ^ { * } \\in \\{ 1 , \\ldots , C \\}$ is a discrete class label. A probabilistic classifier maps an object $x _ { i }$ into a predictive distribution ${ \\dot { p } } ( y \\mid x _ { i } )$ . The predictive distribution ${ \\hat { p } } ( y \\mid x _ { i } )$ of a deep neural network is typically defined by the softmax function ${ \\hat { p } } ( y \\mid x ) =$ $\\mathrm { S o f t m a x } ( z ( x ) / T )$ , where $z ( x )$ is a vector of logits and $T$ is a scalar parameter standing for the temperature of the predictive distribution. This scalar parameter is usually set to $T = 1$ or is tuned on a validation set (Guo et al., 2017). The maximum probability $\\operatorname* { m a x } _ { c } \\dot { \\hat { p } } ( y = c | x _ { i } )$ is called the confidence of a classifier $\\hat { p }$ on an object $x _ { i }$ . $\\mathbb { I } [ \\cdot ]$ denotes the indicator function throughout the text. ", + "bbox": [ + 173, + 511, + 825, + 625 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 LOG-LIKELIHOOD AND BRIER SCORE ", + "text_level": 1, + "bbox": [ + 176, + 645, + 473, + 659 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The average test log-likelihood $\\begin{array} { r } { \\mathbf { L } \\mathbf { L } = \\frac { 1 } { n } \\sum _ { i = 1 } ^ { n } \\log \\hat { p } ( y = y _ { i } ^ { * } \\mid x _ { i } ) } \\end{array}$ is a popular metric for measuring the quality of in-domain uncertainty of deep learning models. It directly penalizes high probability scores assigned to incorrect labels and low probability scores assigned to the correct labels $y _ { i } ^ { * }$ . ", + "bbox": [ + 174, + 671, + 825, + 714 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "LL is sensitive to the softmax temperature $T$ . The temperature that has been implicitly learned during training can be far from optimal for the test data. However, a nearly optimal temperature can be found post-hoc by maximizing the log-likelihood on validation data. This approach is called temperature scaling or calibration (Guo et al., 2017). Despite its simplicity, the temperature scaling results in a notable improvement in the LL. ", + "bbox": [ + 174, + 722, + 825, + 791 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "While ensembling techniques tend to have better temperature than single models, the default choice of $T = 1$ is still suboptimal. Comparing the LL with suboptimal temperatures—that is often the case in practice—can potentially produce an arbitrary ranking of different methods. ", + "bbox": [ + 174, + 799, + 825, + 840 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Comparison of the log-likelihood should only be performed at the optimal temperature. ", + "bbox": [ + 212, + 858, + 782, + 873 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Empirically, we demonstrate that the overall ordering of methods and also the best ensembling method according to the LL can vary depending on temperature $T$ . While this applies to most ensembling techniques (see Figure 10), this effect is most noticeable on experiments with data augmentation on ImageNet (Figure 1). ", + "bbox": [ + 176, + 895, + 823, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 821, + 132 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We introduce a new metric called the calibrated log-likelihood that is the log-likelihood at the optimal temperature. ", + "bbox": [ + 200, + 150, + 802, + 179 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The calibrated log-likelihood considers a model and a post-training calibration as a unified system, targeting to measure all models in the equal conditions of optimal temperature. That allows to avoid measuring calibration error that can be eliminated by a simple temperature scaling. The metric significantly affects the results of the comparison. For example, in Figure 10 the differences between Bayesian (VI, K-FAC, SWAG, dropout) and conventional non-Bayesian networks become much less pronounced, and in most cases making conventional non-Bayesian networks match the performance of Bayesian ones (VI, K-FAC, Dropout) on ResNet110, ResNet164, and WideResNet. ", + "bbox": [ + 174, + 200, + 825, + 297 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We show how to obtain an unbiased estimate of the calibrated log-likelihood without a held-out validation set in Section 3.5. ", + "bbox": [ + 173, + 304, + 823, + 333 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "LL also demonstrates a high correlation with accuracy $( \\rho > 0 . 8 6 )$ , that in case of calibrated LL becomes even stronger $( \\rho > 0 . 9 5 )$ . That suggests that while (calibrated) LL measures the uncertainty of the model, it still has a significant dependence on the accuracy and vice versa. A model with higher accuracy would likely have a higher log-likelihood. See Figure 9 in Appendix C for more details. ", + "bbox": [ + 174, + 340, + 825, + 410 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Brier score $\\begin{array} { r } { \\mathrm { { B S } } = \\frac { 1 } { n } \\frac { 1 } { C } \\sum _ { i = 1 } ^ { n } \\sum _ { c = 1 } ^ { C } ( \\mathbb { I } [ y _ { i } ^ { * } = c ] - \\hat { p } ( y = c | x _ { i } ) ) ^ { 2 } } \\end{array}$ has also been known for a long time as a metric for verification of predicted probabilities (Brier, 1950). Similarly to the log-likelihood, the Brier score penalizes low probabilities assigned to correct predictions and high probabilities assigned to wrong ones. It is also sensitive to the temperature of the softmax distribution and behaves similarly to the log-likelihood. While these metrics are not strictly equivalent, they show a high empirical correlation for a wide range of models on CIFAR-10, CIFAR-100 and ImageNet datasets (see Figure 8 in Appendix C ). ", + "bbox": [ + 173, + 415, + 825, + 515 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 MISCLASSIFICATION DETECTION ", + "text_level": 1, + "bbox": [ + 176, + 545, + 442, + 559 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Detection of wrong predictions of the model, or misclassifications, is a popular downstream problem relevant to the problem of in-domain uncertainty estimation. Since misclassification detection is essentially a binary classification problem, some papers measure its quality using conventional metrics for binary classification such as AUC-ROC and AUC-PR (Malinin & Gales, 2018; Cui et al., 2019; Mozejko et al., 2018). These papers use an uncertainty criterion like confidence or predictive ˙ entropy $\\mathcal { H } [ \\bar { p } ( \\boldsymbol { y } | \\boldsymbol { x } _ { i } ) ]$ as a prediction score. ", + "bbox": [ + 173, + 577, + 825, + 660 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "While these metrics can be used to assess the misclassification detection performance of a single model, they cannot be used to directly compare misclassification performance across different models. Correct and incorrect predictions are specific for every model, therefore, every model induces its own binary classification problem. The induced problems can differ significantly, since different models produce different confidences and misclassify different objects. In other words, comparing such metrics implies a comparison of performance of classifiers that solve different classification problems. Such metrics are therefore incomparable. ", + "bbox": [ + 174, + 667, + 825, + 765 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "AUCs for misclassification detection cannot be directly compared between different models. ", + "bbox": [ + 316, + 780, + 678, + 808 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "While comparing AUCs is incorrect in the setting of misclassification detection, it is correct to compare these metrics in many out-of-domain data detection problems. In that case, both objects and targets of the induced binary classification problems remain the same for all models. All outof-domain objects have a positive label and all in-domain objects have a negative label. Note that this condition does not necessarily hold in the problem of detection of adversarial attacks. Different models generally have different inputs after an adversarial attack, so such AUC-based metrics might still be flawed. ", + "bbox": [ + 173, + 825, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.3 CLASSIFICATION WITH REJECTION ", + "text_level": 1, + "bbox": [ + 176, + 103, + 452, + 117 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Accuracy-confidence curves are another way to measure the performance of misclassification detection. These curves measure the accuracy on the set of objects with confidence $\\operatorname* { m a x } _ { c } { \\hat { p } } ( y = c | x _ { i } )$ above a certain threshold $\\tau$ (Lakshminarayanan et al., 2017) and ignoring or rejecting the others. ", + "bbox": [ + 176, + 130, + 823, + 171 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The main problem with accuracy-confidence curves is that they rely too much on calibration and the actual values of confidence. Models with different temperatures have different numbers of objects at each confidence level which does not allow for a meaningful comparison. To overcome this problem, one can swhich from thresholding by the confidence level to thresholding by the number of rejected objects. The corresponding curves are then less sensitive to temperature scaling and thus allow to compare the rejection ability in a more meaningful way. Such curves have been known as accuracyrejection curves (Nadeem et al., 2009). In order to obtain a scalar metric for easy comparisons, one can compute the area under this curve, resulting in AU-ARC (Nadeem et al., 2009). ", + "bbox": [ + 174, + 178, + 825, + 290 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.4 CALIBRATION METRICS ", + "text_level": 1, + "bbox": [ + 176, + 306, + 379, + 320 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Informally speaking, a probabilistic classifier is calibrated if any predicted class probability is equal to the true class probability according to the underlying data distribution (see (Vaicenavicius et al., 2019) for formal definitions). Any deviation from the perfect calibration is called miscalibration. For brevity, we will use $\\hat { p } _ { i , c }$ to denote ${ \\hat { p } } ( y = c | x _ { i } )$ in the current section. ", + "bbox": [ + 173, + 332, + 825, + 388 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Expected calibration error (ECE) (Naeini et al., 2015) is a metric that estimates model miscalibration by binning the assigned probability scores and comparing them to average accuracies inside these bins. Assuming ${ B } _ { m } ^ { \\bar { } }$ denotes the $m$ -th bin and $M$ is overall number of bins, the ECE is defined as follows: ", + "bbox": [ + 173, + 393, + 825, + 445 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/5afa4554b17b8b5979560f9df3c87d552ad0910980a5e1009cab4de87caaa03f.jpg", + "text": "$$\n\\mathrm { E C E } = \\sum _ { m = 1 } ^ { M } \\frac { | B _ { m } | } { n } \\left| \\operatorname { a c c } ( B _ { m } ) - \\operatorname { c o n f } ( B _ { m } ) \\right| ,\n$$", + "text_format": "latex", + "bbox": [ + 362, + 443, + 632, + 481 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\begin{array} { r } { \\operatorname { a c c } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } { \\mathbb { I } } [ \\operatorname { a r g m a x } _ { c } \\hat { p } _ { i , c } = y _ { i } ^ { * } ] \\mathrm { ~ a n d ~ c o n f } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } \\hat { p } _ { i , y _ { i } ^ { * } } . } \\end{array}$ ", + "bbox": [ + 178, + 482, + 754, + 502 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "A recent line of works on measuring calibration in deep learning (Vaicenavicius et al., 2019; Kumar et al., 2019; Nixon et al., 2019) outlines several problems of the ECE score. Firstly, ECE is a biased estimate of the true calibration. Secondly, ECE-like scores cannot be optimized directly since they are minimized by a model with constant uniform predictions, making the infinite temperature $T = + \\infty$ its global optimum. Thirdly, ECE only estimates miscalibration in terms of the maximum assigned probability whereas practical applications may require the full predicted probability vector to be calibrated. Finally, biases of ECE on different models may not be equal, rendering the miscalibration estimates incompatible. Similar concerns are also discussed by Ding et al. (2019). ", + "bbox": [ + 173, + 503, + 825, + 617 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Thresholded adaptive calibration error (TACE) was proposed as a step towards solving some of these problems (Nixon et al., 2019). TACE disregards all predicted probabilities that are less than a certain threshold (hence thresholded), chooses the bin locations adaptively so that each bin has the same number of objects (hence adaptive), and estimates miscalibration of probabilties across all classes in the prediction (not just the top-1 predicted class as in ECE). Assuming that $B _ { m } ^ { \\mathrm { { T A } } }$ denotes the $m$ -th thresholded adaptive bin and $\\bar { M }$ is the overall number of bins, TACE is defined as follows: ", + "bbox": [ + 173, + 621, + 825, + 699 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/ac924504db297316b22ed50ee666606bdff414a08ecf2e73ba2f3c638fc6877d.jpg", + "text": "$$\n\\begin{array} { r } { \\mathrm { \\ o b j s } ( B ^ { \\mathtt { T A } } , c ) = | B ^ { \\mathtt { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathtt { T A } } } \\mathbb { I } [ y _ { i } ^ { * } = c ] \\mathrm { \\ a n d \\ c o n f } ( B ^ { \\mathtt { T A } } , c ) = | B ^ { \\mathtt { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathtt { T A } } } \\hat { p } _ { i } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 225, + 747, + 781, + 765 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/b798a685f321ee0b846b98f2fd23f0b55d8c570633ba884f309b8acfac1cd1d1.jpg", + "text": "$$\n\\mathrm { T A C E } = \\frac { 1 } { C M } \\sum _ { c = 1 } ^ { C } \\sum _ { m = 1 } ^ { M } \\frac { | B _ { m } ^ { \\mathrm { T A } } | } { n } \\left| \\mathrm { o b j s } ( B _ { m } ^ { \\mathrm { T A } } , c ) - \\mathrm { c o n f } ( B _ { m } ^ { \\mathrm { T A } } , c ) \\right| ,\n$$", + "text_format": "latex", + "bbox": [ + 303, + 703, + 691, + 742 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Although TACE does solve several problems of ECE and is useful for measuring calibration of a specific model, it still cannot be used as a reliable criterion for comparing different models. Theory suggests that it is still a biased estimate of true calibration with different bias for each model (Vaicenavicius et al., 2019). In practice, we find that TACE is sensitive to its two parameters, the number of bins and the threshold, and does not provide a consistent ranking of different models, as shown in Figure 2. ", + "bbox": [ + 174, + 768, + 825, + 853 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.5 CALIBRATED LOG-LIKELIHOOD AND TEST-TIME CROSS-VALIDATION ", + "text_level": 1, + "bbox": [ + 176, + 869, + 687, + 883 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "There are two common ways to perform temperature scaling using a validation set when training on datasets that only feature public training and test sets (e.g. CIFARs). The public training set might be divided into a smaller training set and validation set, or the public test set can be split into test and validation parts (Guo et al., 2017; Nixon et al., 2019). The problem with the first method is that the resulting models cannot be directly compared with all the other models that have been trained on the full training set. The second approach, however, provides an unbiased estimate of metrics such as log-likelihood and Brier score but introduces more variance. ", + "bbox": [ + 173, + 895, + 821, + 924 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 174 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In order to reduce the variance of the second approach, we perform a “test-time cross-validation”. We randomly divide the test set into two equal parts, then compute metrics for each half of the test set using the temperature optimized on another half. We repeat this procedure five times and average the results across different random partitions to reduce the variance of the computed metrics. ", + "bbox": [ + 174, + 180, + 825, + 236 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 A STUDY OF ENSEMBLING & DEEP ENSEMBLE EQUIVALENT ", + "text_level": 1, + "bbox": [ + 176, + 257, + 699, + 272 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Ensembles of deep neural networks have become a de-facto standard for uncertainty estimation and improving the quality of deep learning models (Hansen & Salamon, 1990; Krizhevsky et al., 2009; Lakshminarayanan et al., 2017). There are two main directions of training ensembles of DNNs: training stochastic computation graphs and obtaining separate snapshots of neural network parameters. ", + "bbox": [ + 174, + 287, + 825, + 358 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Methods based on the paradigm of stochastic computation graphs introduce some kind of random noise over the weights or activations of deep learning models. When the model is trained, each sample of the noise corresponds to a member of the ensemble. During test time, the predictions are averaged across the noise samples. These methods include (test-time) data augmentation, dropout (Srivastava et al., 2014; Gal & Ghahramani, 2016), variational inference (Blundell et al., 2015; Kingma et al., 2015; Louizos & Welling, 2017), batch normalization (Ioffe & Szegedy, 2015; Teye et al., 2018; Atanov et al., 2019), Laplace approximation (Ritter et al., 2018) and many more. ", + "bbox": [ + 174, + 364, + 825, + 463 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Snapshot-based methods aim to obtain sets of weights for deep learning models and then to average the predictions across these weights. The weights can be trained independently (e.g. deep ensembles (Lakshminarayanan et al., 2017)), collected on different stages of a training trajectory (e.g. snapshot ensembles (Huang et al., 2017) and fast geometric ensembles (Garipov et al., 2018)), or obtained from a sampling process (e.g. MCMC-based methods (Welling & Teh, 2011; Zhang et al., 2019)). These two paradigms can be combined. Some works suggest construction of ensembles of stochastic computation graphs (Tomczak et al., 2018), while others make use of the collected snapshots to construct a stochastic computation graph (Wang et al., 2018; Maddox et al., 2019). ", + "bbox": [ + 173, + 468, + 825, + 580 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this paper we consider the following ensembling techniques: deep ensembles (Lakshminarayanan et al., 2017), snapshot ensembles (SSE by Huang et al. (2017)), fast geometric ensembling (FGE by Garipov et al. (2018)), SWA-Gaussian (SWAG by Maddox et al. (2019)), cyclical SGLD (cSGLD by Zhang et al. (2019)), variational inference (VI by Blundell et al. (2015)), K-FAC Laplace approximation (Ritter et al., 2018), dropout (Srivastava et al., 2014) and test-time data augmentation (Krizhevsky et al., 2009). These techniques were chosen to cover a diverse set of approaches keeping their predictive performance in mind. ", + "bbox": [ + 174, + 587, + 825, + 685 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "All these techniques can be summarized as distributions $q _ { m } ( \\omega )$ over parameters $\\omega$ of computation graphs, where $m$ stands for the technique. During testing, one can average the predictions across parameters $\\omega \\sim q _ { m } ( \\omega )$ to approximate the predictive distribution ", + "bbox": [ + 176, + 691, + 825, + 734 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/615aab3299152d4a5ee7cfc2bed94a1c921c7ad7b4aafd3981a1129aac897697.jpg", + "text": "$$\n\\hat { p } ( y _ { i } | x _ { i } ) \\approx \\int p ( y _ { i } | x _ { i } , \\omega ) q _ { m } ( \\omega ) d \\omega \\simeq \\frac { 1 } { K } \\sum _ { k = 1 } ^ { K } p ( y _ { i } | x _ { i } , \\omega _ { k } ) , \\quad \\omega _ { k } \\sim q _ { m } ( \\omega ) \\omega _ { k } ^ { \\quad \\mathrm { ~ d ~ } } ,\n$$", + "text_format": "latex", + "bbox": [ + 245, + 739, + 753, + 784 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "For example,Dirac’s deltas $S$ rks can be represented in this form as a mix, centered at independently trained snapshots re of . Sim $S$ $\\begin{array} { r } { q _ { \\mathrm { { D E } } } ( \\omega ) = \\frac { 1 } { S } \\sum _ { s = 1 } ^ { S } \\delta ( \\omega - \\omega _ { s } ) } \\end{array}$ $\\omega _ { s }$ over the weight matrices and convolutional kernels $\\omega$ is represented as $q _ { \\mathrm { v I } } ( \\omega ) = \\mathcal { N } ( \\omega | \\mu , \\mathrm { d i a g } ( \\sigma ^ { 2 } ) )$ , $\\mu$ and $\\sigma ^ { 2 }$ being the optimal variational means and variances respectively. ", + "bbox": [ + 173, + 787, + 823, + 861 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "If one considers data augmentation as a part of the computational graph, it can be parameterized by the coordinates of the random crop and the flag for whether to flip the image horizontally or not. Sampling from the corresponding $q _ { \\mathrm { a u g } } ( \\omega )$ would generate different ways to augment the data during inference. However, as data augmentation is present by default during the training of all othe mentioned ensembling techniques, it is suitable to study it in combination with these methods and not as a separate ensembling technique. We perform such an evaluation in Section 4.3. ", + "bbox": [ + 174, + 867, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/4c4790d017e5dfd157b34a61bcb790afb627af636464852f4f415612b476f194.jpg", + "image_caption": [ + "Figure 3: The deep ensemble equivalent score (DEE) for different numbers of samples on CIFAR10, CIFAR-100, and ImageNet datasets averaged across different deep convolutional architectures. A deep ensemble equivalent score (DEE) of a model is equal to the minimum size of a deep ensemble (an ensemble of independently train networks) that achieves the same performance as the model under consideration. The score is measured in the number of models (higher is better). The area between average lower and upper bounds of DEE is shaded. The plot demonstrates that all of the ensembling techniques are far less efficient than deep ensembles during inference and fail to produce the same level of performance as deep ensembles. The comparison that is normalized on training time is presented in Appendix A. " + ], + "image_footnote": [], + "bbox": [ + 174, + 104, + 820, + 323 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 484, + 823, + 513 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Typically, the approximation (equation 3) requires $K$ independent forward passes through a neural network, making the test-time budget directly comparable across all methods. ", + "bbox": [ + 174, + 520, + 823, + 549 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 DEEP ENSEMBLE EQUIVALENT ", + "text_level": 1, + "bbox": [ + 176, + 565, + 424, + 579 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Most ensembling techniques under consideration are either bounded to a single mode, or provide positively correlated samples. Deep ensemble, on the other hand, is a simple technique that provides independent samples from different modes of the loss landscape, which, intuitively, should result in a better ensemble. Therefore deep ensembles can be considered a strong baseline for the performance of other ensembling techniques given a fixed test-time computation budget. ", + "bbox": [ + 174, + 592, + 825, + 661 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Comparing the performance of ensembling techniques is, however, a challenging problem. Different models on different datasets achieve different values of metrics; their dependence on the number of samples is non-trivial, and varies depending on a specific model and dataset. Values of the metrics are thus lacking in interpretability as the gain in performance has to be compared against a modeland dataset-specific baseline. ", + "bbox": [ + 174, + 667, + 825, + 738 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Aiming to introduce perspective and interpretability in our study, we introduce the deep ensemble equivalent score that employs deep ensembles to measure the performance of other ensembling techniques. Specifically, the deep ensemble equivalent score answers the following question: ", + "bbox": [ + 174, + 744, + 823, + 786 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "What size of deep ensemble yields the same performance as a particular ensembling method? ", + "bbox": [ + 192, + 797, + 805, + 811 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Following the insights from the previous sections, we base the deep ensemble equivalent on the calibrated log-likelihood (CLL). Formally speaking, we define the deep ensemble equivalent (DEE) for an ensembling method $m$ and its upper and lower bounds as follows: ", + "bbox": [ + 176, + 821, + 823, + 864 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/c05462a9cb39907fc99138255f32d42aa3aee1cda761a9264389f6f1a17fb996.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { \\mathrm { D E E } _ { m } ( k ) = \\operatorname* { m i n } \\Big \\{ l \\in \\mathbb { R } , l \\geq 1 \\Big | \\mathrm { C L L } _ { D E } ^ { \\mathrm { m e a n } } ( l ) \\geq \\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n } } ( k ) \\Big \\} , \\quad } \\\\ & { } & { \\mathrm { D E E } _ { m } ^ { \\mathrm { ~ u p p e r ~ } } ( k ) = \\operatorname* { m i n } \\Big \\{ l \\in \\mathbb { R } , l \\geq 1 \\Big | \\mathrm { C L L } _ { D E } ^ { \\mathrm { m e a n } } ( l ) \\mp \\mathrm { C L L } _ { D E } ^ { \\mathrm { s t d } } ( l ) \\geq \\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n } } ( k ) \\Big \\} , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 230, + 867, + 766, + 924 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/041e736d79e230462a713217d44dd55230a471b35cac4d3728d20c81d88722e8.jpg", + "image_caption": [ + "Figure 4: An illustration of test-time augmentation (TTA) for an ensemble. We apply every member of an ensemble to a separate random augmentation of an image. The predictions of all members are averaged to produce a final prediction of an ensemble. In our experiments, TTA leads to a significant boost of the performance for most of the ensembling techniques on ImageNet with a sufficient computational budget (see Figure 5). " + ], + "image_footnote": [], + "bbox": [ + 214, + 106, + 790, + 308 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n / s t d } } ( l )$ are the mean and the standard deviation of the calibrated log-likelihood achieved by an ensembling method $m$ with $l$ samples. We compute $\\mathrm { C L L } _ { \\mathrm { D E } } ^ { \\mathrm { m e a n } } ( l )$ and $\\mathrm { C L L } _ { \\mathrm { D E } } ^ { \\mathrm { s t d } } ( l )$ for natural numbers $l \\in { \\mathbb { N } } _ { > 0 }$ and use linear interpolation to define them for real values $l \\geq 1$ . In the following plots we report $\\mathrm { D E E } _ { m } ( k )$ for different methods $m$ with different numbers of samples $k$ , and shade the area between the respective lower and upper bounds $\\mathrm { D E E } _ { m } ^ { \\mathrm { l o w e r } } ( k )$ and $\\mathrm { D E E } _ { m } ^ { \\mathrm { u p p e r } } ( k )$ . ", + "bbox": [ + 174, + 428, + 825, + 503 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 526, + 315, + 540 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We compute the deep ensemble equivalent (DEE) of various ensembling techniques for four popular deep architectures: VGG16 (Simonyan & Zisserman, 2014), PreResNet110/164 (He et al., 2016), and WideResNet28x10 (Zagoruyko & Komodakis, 2016) on CIFAR-10/100 datasets (Krizhevsky et al., 2009), and ResNet50 (He et al., 2016) on ImageNet dataset (Russakovsky et al., 2015). We use PyTorch (Paszke et al., 2017) for implementation of these models, building upon available public implementations. Our implementation closely matches the quality of methods that has been reported in original works. Technical details on training, hyperparameters and implementations can be found in Appendix B. The source code and all computed metrics are available on GitHub1. ", + "bbox": [ + 174, + 554, + 825, + 665 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "As one can see on Figure 3, ensembling methods clearly fall into three categories. SSE and cSGLD outperform all other techniques except deep ensembles and enjoy a near-linear scaling of DEE with the number of samples on CIFAR datasets. The investigation of weight-space trajectories of cSGLD and SSE (Huang et al., 2017; Zhang et al., 2019) suggests that these methods can efficiently explore different modes of the loss landscape. In terms of the deep ensemble equivalent, these methods do not saturate unlike other methods that are bound to a single mode. We found SSE to still saturate on ImageNet. This is likely due to suboptimal hyperparameters of the cyclic learning rate schedule. More verbose results are presented in Figures 11–13 and in Table 5 and Table 8 in Appendix C. ", + "bbox": [ + 174, + 672, + 825, + 784 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In our experiments SSE typically outperforms cSGLD. This is mostly due to the fact that SSE has a much larger training budget. The cycle lengths and learning rates of SSE and cSGLD are comparable, however, SSE collects one snapshot per cycle while cSGLD collects three snapshots. This makes samples from SSE less correlated with each other while increasing the training budget threefold. Both SSE and cSGLD can be adjusted to obtain a different trade-off between the training budget and the DEE-to-samples ratio. We reused the schedules provided in the original papers (Huang et al., 2017; Zhang et al., 2019). ", + "bbox": [ + 174, + 791, + 823, + 888 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/3514525c9717703869980514d722dbb583156e3303e2ad13660f10f30a57c3ac.jpg", + "image_caption": [ + "Figure 5: How to read results: $\\times \\ \\frac { \\mathrm { \\ t e s t { - } t i m e \\ a u g } } { 1 0 \\ \\mathrm { s a m p l e s } } \\quad \\Phi , \\times \\ \\frac { \\mathrm { \\ t e s t { - } t i m e \\ a u g } } { 5 0 \\ \\mathrm { s a m p l e s } } \\quad \\cdot$ . The negative calibrated loglikelihood (lower is better) for different ensembling techniques on ImageNet. We report performance for two regimes. Central-crop evaluation $( \\times \\times )$ means every member of an ensemble is applied to a central crop of an image, and test-time data augmentation ( ) means each member of the ensemble is applied to a separate random augmentation of the image. Test-time data augmentation significantly improves ensembles with no additional computational cost. Interestingly, a single model with TTA performs competitively with methods that require significantly larger parameters budget, and training complexity, e.g., a single model with TTA performs closely to pure deep ensembles (DE) of the same size. " + ], + "image_footnote": [], + "bbox": [ + 209, + 106, + 787, + 291 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Being more “local” methods, FGE and SWAG perform worse than SSE and cSGLD, but still significantly outperform “single-snapshot” methods like dropout, K-FAC Laplace approximation and variational inference. We hypothesize that by covering a single mode with a set of snapshots, FGE and SWAG provide a better fit for the local geometry than models trained as stochastic computation graphs. This implies that the performance of FGE and SWAG should be achievable by singlesnapshot methods. However, one might need more elaborate posterior approximations and better inference techniques in order to match the performance of FGE and SWAG by training a stochastic computation graph end-to-end (as opposed to SWAG that constructs a stochastic computation graph post-hoc). ", + "bbox": [ + 174, + 469, + 825, + 595 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The deep ensemble equivalent curves allow us to notice the common behaviour of different methods, e.g. the relation between deep ensembles, snapshot methods, advanced local methods and singlesnapshot local methods. They also allow us to notice inconsistencies that may indicate a suboptimal choice of hyperparameters. For example, we find that SSE on ImageNet quickly saturates, unlike SSE on CIFAR datasets (Figure 3). This may indicate that the hyperparameters used on ImageNet are not good enough for efficient coverage of different modes of the loss landscape. We also find that SSE on WideResNet on CIFAR-10 achieves a DEE score of 100 on approx. 70 samples (Figure 12). This may indicate that the members of the deep ensemble for this dataset-architecture pair are underfitted and may benefit from longer training or a different learning rate schedule. Such inconsistencies might be more difficult to spot using plain calibrated log-likelihood plots. ", + "bbox": [ + 174, + 603, + 825, + 742 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "4.3 TEST-TIME DATA AUGMENTATION IMPROVES ENSEMBLES FOR FREE ", + "text_level": 1, + "bbox": [ + 176, + 758, + 689, + 772 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Data augmentation is a time-honored technique that is widely used in deep learning, and is a crucial component for training modern DNNs. Test-time data augmentation has been used for a long time to improve the performance of convolutional networks. For example, multi-crop evaluation has been a standard procedure for the ImageNet challenge (Simonyan & Zisserman, 2014; Szegedy et al., 2015; He et al., 2016). It is, however, often overlooked in the literature on ensembling techniques in deep learning. In this section, we study the effect of test-time data augmentation on the aforementioned ensembling techniques. To keep the test-time computation budget the same, we sample one random augmentation for each member of an ensemble. Figure 5 reports the calibrated log-likelihood on combination of ensembles and test-time data augmentation for ImageNet. Other metrics and results on CIFAR-10/100 datasets are reported in Appendix C. We have used the standard data augmentation: random horizontal flips and random padded crops for CIFAR-10/100 datasets, and random horizontal flips and random resized crops for ImageNet (see more details in Appendix B). ", + "bbox": [ + 174, + 785, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 821, + 132 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Test-time data augmentation (Figure 4) consistently improves most ensembling methods, especially on ImageNet, where we see a clear improvement across all methods (Figure 5 and Table 7). The performance gain for powerful ensembles (deep ensembles, SSE and cSGLD) on CIFAR datasets is not as dramatic (Figures 14–15 and Table 4). This is likely due to the fact that CIFAR images are small, making data augmentation limited, whereas images from ImageNet allow for a large number of diverse samples of augmented images. On the other hand, while the performance of “single-snapshot” methods (e.g. variational inference, K-FAC Laplace and dropout) is improved significantly, they perform approximately as good as an augmented version of a single model across all datasets.w ", + "bbox": [ + 174, + 138, + 825, + 263 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Interestingly, test-time data augmentation on ImageNet improves accuracy but decreases the uncalibrated log-likelihood of deep ensembles (Table 7 in Appendix C). Test-time data augmentation breaks the nearly optimal temperature of deep ensembles and requires temperature scaling to reveal the actual performance of the method, as discussed in Section 3.1. The experiment demonstrates that ensembles may be highly miscalibrated by default while still providing superior predictive performance after calibration. ", + "bbox": [ + 174, + 271, + 825, + 354 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We would like to note that test-time data augmentation does not always break the calibration of an ensemble, and, on the contrary, test-time data augmentation often improves the calibration of an ensemble. In our experiments, decalibration was caused by the extreme magnitude of a random crop, that is conventionally used for ImageNet augmentation. Using less extreme magnitude of the random crop fixes decalibration, that makes test-time data augmentation a more practical method that provides out-of-the-box calibration. Although, as we demonstrated earlier, there is no guarantee that any ensemble is calibrated out-of-the-box. If we are willing to apply post-hoc calibration, the final performance can be much better with more severe augmentations. ", + "bbox": [ + 174, + 361, + 825, + 473 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "5 DISCUSSION & CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 492, + 447, + 508 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We have explored the field of in-domain uncertainty estimation and performed an extensive evaluation of modern ensembling techniques. Our main findings can be summarized as follows: ", + "bbox": [ + 174, + 523, + 823, + 551 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "• Temperature scaling is a must even for ensembles. While ensembles generally have better calibration out-of-the-box, they are not calibrated perfectly and can benefit from the procedure. A comparison of log-likelihoods of different ensembling methods without temperature scaling might not provide a fair ranking, especially if some models happen to be miscalibrated. Many common metrics for measuring in-domain uncertainty are either unreliable (ECE and analogues) or cannot be used to compare different methods (AUC-ROC, AUC-PR for misclassification detection; accuracy-confidence curves). In order to perform a fair comparison of different methods, one needs to be cautious of these pitfalls. Many popular ensembling techniques require dozens of samples for test-time averaging, yet are essentially equivalent to a handful of independently trained models. Deep ensembles dominate other methods given a fixed test-time budget. The results indicate, in particular, that exploration of different modes in the loss landscape is crucial for good predictive performance. \n• Methods that are stuck in a single mode are unable to compete with methods that are designed to explore different modes of the loss landscape. Would more elaborate posterior approximations and better inference techniques shorten this gap? Test-time data augmentation is a surprisingly strong baseline for in-domain uncertainty estimation. It can significantly improve other methods without increasing training time or model size since data augmentation is usually already present during training. ", + "bbox": [ + 215, + 563, + 825, + 857 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Our takeaways are aligned with the take-home messages of Ovadia et al. (2019) that relate to indomain uncertainty estimation. We also observe a stable ordering of different methods in our experiments, and observe that deep ensembles with few members outperform methods based on stochastic computation graphs. ", + "bbox": [ + 176, + 868, + 823, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "A large number of unreliable metrics inhibits a fair comparison of different methods. Because of this, we urge the community to aim for more reliable benchmarks in the numerous setups of uncertainty estimation. ", + "bbox": [ + 174, + 103, + 823, + 145 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "ACKNOWLEDGMENTS ", + "text_level": 1, + "bbox": [ + 176, + 161, + 326, + 175 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Dmitry Vetrov and Dmitry Molchanov were supported by the Russian Science Foundation grant no. 19-71-30020. This research was supported in part through computational resources of HPC facilities at NRU HSE. ", + "bbox": [ + 174, + 185, + 825, + 227 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 247, + 285, + 262 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Andrei Atanov, Arsenii Ashukha, Dmitry Molchanov, Kirill Neklyudov, and Dmitry Vetrov. Uncertainty estimation via stochastic batch normalization. In International Symposium on Neural Networks, pp. 261–269. Springer, 2019. ", + "bbox": [ + 174, + 270, + 826, + 313 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Anoop Korattikara Balan, Vivek Rathod, Kevin P Murphy, and Max Welling. Bayesian dark knowledge. In Advances in Neural Information Processing Systems, pp. 3438–3446, 2015. ", + "bbox": [ + 173, + 320, + 823, + 349 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Charles Blundell, Julien Cornebise, Koray Kavukcuoglu, and Daan Wierstra. Weight uncertainty in neural networks. arXiv preprint arXiv:1505.05424, 2015. ", + "bbox": [ + 174, + 357, + 821, + 387 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Glenn W Brier. Verification of forecasts expressed in terms of probability. Monthly weather review, 78(1):1–3, 1950. ", + "bbox": [ + 174, + 393, + 821, + 422 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jacob Buckman, Danijar Hafner, George Tucker, Eugene Brevdo, and Honglak Lee. Sampleefficient reinforcement learning with stochastic ensemble value expansion. In Advances in Neural Information Processing Systems, pp. 8224–8234, 2018. ", + "bbox": [ + 174, + 430, + 823, + 474 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Kurtland Chua, Roberto Calandra, Rowan McAllister, and Sergey Levine. Deep reinforcement learning in a handful of trials using probabilistic dynamics models. In Advances in Neural Information Processing Systems, pp. 4754–4765, 2018. ", + "bbox": [ + 176, + 481, + 823, + 525 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yufei Cui, Wuguannan Yao, Qiao Li, Antoni B Chan, and Chun Jason Xue. Accelerating monte carlo bayesian inference via approximating predictive uncertainty over simplex. arXiv preprint arXiv:1905.12194, 2019. ", + "bbox": [ + 174, + 531, + 825, + 574 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yukun Ding, Jinglan Liu, Jinjun Xiong, and Yiyu Shi. Evaluation of neural network uncertainty estimation with application to resource-constrained platforms. arXiv preprint arXiv:1903.02050, 2019. ", + "bbox": [ + 174, + 582, + 825, + 625 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yarin Gal. Uncertainty in deep learning. PhD thesis, PhD thesis, University of Cambridge, 2016. ", + "bbox": [ + 171, + 632, + 810, + 648 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model uncertainty in deep learning. In international conference on machine learning, pp. 1050–1059, 2016. ", + "bbox": [ + 176, + 656, + 823, + 698 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Timur Garipov, Pavel Izmailov, Dmitrii Podoprikhin, Dmitry P Vetrov, and Andrew G Wilson. Loss surfaces, mode connectivity, and fast ensembling of dnns. In Advances in Neural Information Processing Systems, pp. 8789–8798, 2018. ", + "bbox": [ + 174, + 705, + 825, + 750 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q Weinberger. On calibration of modern neural networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 1321–1330. JMLR. org, 2017. ", + "bbox": [ + 173, + 757, + 825, + 800 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Fredrik K Gustafsson, Martin Danelljan, and Thomas B Schon. Evaluating scalable bayesian deep ¨ learning methods for robust computer vision. arXiv preprint arXiv:1906.01620, 2019. ", + "bbox": [ + 173, + 808, + 823, + 837 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Lars Kai Hansen and Peter Salamon. Neural network ensembles. IEEE Transactions on Pattern Analysis & Machine Intelligence, (10):993–1001, 1990. ", + "bbox": [ + 173, + 844, + 823, + 873 + ], + "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": [ + 176, + 882, + 823, + 922 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531, 2015. ", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Gao Huang, Yixuan Li, Geoff Pleiss, Zhuang Liu, John E Hopcroft, and Kilian Q Weinberger. Snapshot ensembles: Train 1, get m for free. arXiv preprint arXiv:1704.00109, 2017. ", + "bbox": [ + 173, + 140, + 821, + 171 + ], + "page_idx": 11 + }, + { + "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": [ + 173, + 179, + 823, + 208 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Pavel Izmailov, Dmitrii Podoprikhin, Timur Garipov, Dmitry Vetrov, and Andrew Gordon Wilson. Averaging weights leads to wider optima and better generalization. arXiv preprint arXiv:1803.05407, 2018. ", + "bbox": [ + 173, + 217, + 825, + 260 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Durk P Kingma, Tim Salimans, and Max Welling. Variational dropout and the local reparameterization trick. In Advances in Neural Information Processing Systems, pp. 2575–2583, 2015. ", + "bbox": [ + 173, + 267, + 821, + 297 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. Technical report, Citeseer, 2009. ", + "bbox": [ + 171, + 306, + 821, + 335 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ananya Kumar, Percy S Liang, and Tengyu Ma. Verified uncertainty calibration. In Advances in Neural Information Processing Systems, pp. 3787–3798, 2019. ", + "bbox": [ + 174, + 343, + 823, + 373 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. Simple and scalable predictive uncertainty estimation using deep ensembles. In Advances in Neural Information Processing Systems, pp. 6402–6413, 2017. ", + "bbox": [ + 174, + 381, + 823, + 425 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Christos Louizos and Max Welling. Multiplicative normalizing flows for variational bayesian neural networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 2218–2227. JMLR. org, 2017. ", + "bbox": [ + 176, + 433, + 823, + 477 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Wesley Maddox, Timur Garipov, Pavel Izmailov, Dmitry Vetrov, and Andrew Gordon Wilson. A simple baseline for bayesian uncertainty in deep learning. arXiv preprint arXiv:1902.02476, 2019. ", + "bbox": [ + 173, + 484, + 823, + 515 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Andrey Malinin and Mark Gales. Predictive uncertainty estimation via prior networks. In Advances in Neural Information Processing Systems, pp. 7047–7058, 2018. ", + "bbox": [ + 173, + 522, + 823, + 553 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "James Martens and Roger Grosse. Optimizing neural networks with kronecker-factored approximate curvature. In International conference on machine learning, pp. 2408–2417, 2015. ", + "bbox": [ + 173, + 560, + 823, + 590 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Dmitry Molchanov, Arsenii Ashukha, and Dmitry Vetrov. Variational dropout sparsifies deep neural networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 2498–2507. JMLR. org, 2017. ", + "bbox": [ + 174, + 598, + 821, + 642 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Marcin Mozejko, Mateusz Susik, and Rafał Karczewski. Inhibited softmax for uncertainty estima- ˙ tion in neural networks. arXiv preprint arXiv:1810.01861, 2018. ", + "bbox": [ + 173, + 650, + 821, + 680 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Malik Sajjad Ahmed Nadeem, Jean-Daniel Zucker, and Blaise Hanczar. Accuracy-rejection curves (arcs) for comparing classification methods with a reject option. In Machine Learning in Systems Biology, pp. 65–81, 2009. ", + "bbox": [ + 173, + 688, + 823, + 731 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Mahdi Pakdaman Naeini, Gregory Cooper, and Milos Hauskrecht. Obtaining well calibrated probabilities using bayesian binning. In Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015. ", + "bbox": [ + 174, + 739, + 823, + 782 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Jeremy Nixon, Mike Dusenberry, Linchuan Zhang, Ghassen Jerfel, and Dustin Tran. Measuring calibration in deep learning. 2019. ", + "bbox": [ + 171, + 791, + 823, + 820 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yaniv Ovadia, Emily Fertig, Jie Ren, Zachary Nado, D Sculley, Sebastian Nowozin, Joshua V Dillon, Balaji Lakshminarayanan, and Jasper Snoek. Can you trust your model’s uncertainty? evaluating predictive uncertainty under dataset shift. arXiv preprint arXiv:1906.02530, 2019. ", + "bbox": [ + 174, + 829, + 823, + 873 + ], + "page_idx": 11 + }, + { + "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. In NIPS Autodiff Workshop, 2017. ", + "bbox": [ + 176, + 881, + 825, + 924 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Joaquin Quinonero-Candela, Carl Edward Rasmussen, Fabian Sinz, Olivier Bousquet, and Bernhard Scholkopf. Evaluating predictive uncertainty challenge. In ¨ Machine Learning Challenges Workshop, pp. 1–27. Springer, 2005. ", + "bbox": [ + 176, + 103, + 821, + 146 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Hippolyt Ritter, Aleksandar Botev, and David Barber. A scalable laplace approximation for neural networks. 2018. ", + "bbox": [ + 174, + 154, + 823, + 183 + ], + "page_idx": 12 + }, + { + "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": [ + 176, + 191, + 821, + 236 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Burr Settles. Active learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6 (1):1–114, 2012. ", + "bbox": [ + 174, + 243, + 823, + 273 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Karen Simonyan and Andrew Zisserman. Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556, 2014. ", + "bbox": [ + 174, + 281, + 821, + 310 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Leslie N Smith and Nicholay Topin. Super-convergence: Very fast training of neural networks using large learning rates. In Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications, volume 11006, pp. 1100612. International Society for Optics and Photonics, 2019. ", + "bbox": [ + 173, + 319, + 823, + 363 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Casper Kaae Sønderby, Tapani Raiko, Lars Maaløe, Søren Kaae Sønderby, and Ole Winther. How to train deep variational autoencoders and probabilistic ladder networks. In 33rd International Conference on Machine Learning (ICML 2016), 2016. ", + "bbox": [ + 174, + 369, + 823, + 414 + ], + "page_idx": 12 + }, + { + "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": [ + 174, + 421, + 821, + 465 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013. ", + "bbox": [ + 171, + 473, + 823, + 503 + ], + "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. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 1–9, 2015. ", + "bbox": [ + 174, + 511, + 823, + 554 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Mattias Teye, Hossein Azizpour, and Kevin Smith. Bayesian uncertainty estimation for batch normalized deep networks. In International Conference on Machine Learning (ICML), 2018. ", + "bbox": [ + 173, + 561, + 821, + 592 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Marcin B Tomczak, Siddharth Swaroop, and Richard E Turner. Neural network ensembles and variational inference revisited. In 1st Symposium on Advances in Approximate Bayesian Inference, pp. 1–11, 2018. ", + "bbox": [ + 173, + 599, + 823, + 642 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Linh Tran, Bastiaan S Veeling, Kevin Roth, Jakub Swiatkowski, Joshua V Dillon, Jasper Snoek, Stephan Mandt, Tim Salimans, Sebastian Nowozin, and Rodolphe Jenatton. Hydra: Preserving ensemble diversity for model distillation. arXiv preprint arXiv:2001.04694, 2020. ", + "bbox": [ + 174, + 651, + 821, + 695 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Karen Ullrich, Edward Meeds, and Max Welling. Soft weight-sharing for neural network compression. arXiv preprint arXiv:1702.04008, 2017. ", + "bbox": [ + 169, + 703, + 823, + 732 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Juozas Vaicenavicius, David Widmann, Carl Andersson, Fredrik Lindsten, Jacob Roll, and Thomas B Schon. Evaluating model calibration in classification. arXiv preprint arXiv:1902.06977, 2019. ", + "bbox": [ + 174, + 739, + 825, + 784 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Kuan-Chieh Wang, Paul Vicol, James Lucas, Li Gu, Roger Grosse, and Richard Zemel. Adversarial distillation of bayesian neural network posteriors. In International Conference on Machine Learning, pp. 5177–5186, 2018. ", + "bbox": [ + 173, + 791, + 823, + 835 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Sida Wang and Christopher Manning. Fast dropout training. In international conference on machine learning, pp. 118–126, 2013. ", + "bbox": [ + 171, + 843, + 823, + 872 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Max Welling and Yee W Teh. Bayesian learning via stochastic gradient langevin dynamics. In Proceedings of the 28th international conference on machine learning (ICML-11), pp. 681–688, 2011. ", + "bbox": [ + 174, + 882, + 825, + 922 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Anqi Wu, Sebastian Nowozin, Edward Meeds, Richard E Turner, Jose Miguel Hern ´ andez-Lobato, ´ and Alexander L Gaunt. Deterministic variational inference for robust bayesian neural networks. 2018. ", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Sergey Zagoruyko. 92.45 on cifar-10 in torch, 2015. URL http://torch.ch/blog/2015/ 07/30/cifar.html. ", + "bbox": [ + 173, + 155, + 821, + 184 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Sergey Zagoruyko and Nikos Komodakis. Wide residual networks. arXiv preprint arXiv:1605.07146, 2016. ", + "bbox": [ + 173, + 193, + 823, + 222 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Hongyi Zhang, Moustapha Cisse, Yann N Dauphin, and David Lopez-Paz. mixup: Beyond empirical risk minimization. arXiv preprint arXiv:1710.09412, 2017. ", + "bbox": [ + 171, + 229, + 823, + 260 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Ruqi Zhang, Chunyuan Li, Jianyi Zhang, Changyou Chen, and Andrew Gordon Wilson. Cyclical stochastic gradient mcmc for bayesian deep learning. arXiv preprint arXiv:1902.03932, 2019. ", + "bbox": [ + 171, + 268, + 825, + 297 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/b99ab9378285371b9bd9ddff05efc8db0b75a615ceaadc0061e7d48e93d60585.jpg", + "image_caption": [ + "Figure 6: The mean cost of training of an ensemble vs. the mean deep ensemble equivalent score. Each marker on the plot denotes one snapshot of weights. " + ], + "image_footnote": [], + "bbox": [ + 238, + 63, + 754, + 241 + ], + "page_idx": 14 + }, + { + "type": "image", + "img_path": "images/5c4fc74147c281d75e6de7a251e4d1655d62287a436773f81f5644901192105e.jpg", + "image_caption": [ + "Figure 7: Cost of training of an ensemble vs. its quality (DEE). Each marker on a plot denotes one snapshot of weights. " + ], + "image_footnote": [], + "bbox": [ + 272, + 299, + 725, + 578 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "A IS ”EFFICIENT” TRAINING OF ENSEMBLES EFFICIENT AT ALL? ", + "text_level": 1, + "bbox": [ + 174, + 646, + 723, + 662 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Yes! If you care most about training time efficiency. All snapshot based methods (SSE, cSGLD and FGE) on average (Figure 6) tend to achieve the same performance as deep ensembles using $2 { - } 5 \\times$ less training epochs on CIFAR datasets. ", + "bbox": [ + 174, + 679, + 823, + 720 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "The gain comes at a cost of inference efficiency and memory consumption. ”Efficient” snapshotbased methods require to store much more samples of weights compared to deep ensembles making inference significantly more expensive (up to $\\times 2 5$ ) given the same predictive performance. ", + "bbox": [ + 174, + 728, + 821, + 771 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "You need to get lucky with hyperparameter choice. While on average ”efficient” snapshot-based methods require less training resources, they might be completely inefficient if your hyperparameter choice is sub-optimal (see Figure 7). Such hyperparameters as the maximum learning rate, the length of learning rate decay cycle, the snapshot saving schedule can all impact the performance significantly. ", + "bbox": [ + 174, + 777, + 825, + 847 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This analysis assumes that we use only conventional training procedure. Many models can most likely be trained, stored and executed much more efficiently with methods like super-convergence, stochastic weight averaging, compression, distillation and others. These methods are out of the scope of the paper but are interesting topics for future research. The current choice of hyperparameters may also not be optimal. We reuse the hyperparameters used in the original papers. ", + "bbox": [ + 174, + 854, + 825, + 924 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "B EXPERIMENTAL DETAILS ", + "text_level": 1, + "bbox": [ + 176, + 102, + 416, + 117 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Implementations of deep ensembles, SWAG, FGE and K-FAC Laplace are heavily based on the original PyTorch implementations of stochastic weight averaging (SWA) 2 and SWAG 3. Implementations of cyclical MCMC and snapshot ensembles are based on the original implementation of cyclical MCMC 4. We hypothesize that the optimal hyperparameters of ensembling methods may vary widely depending on the computational budget and the number of samples in the ensemble. Searching for the optimal values for each configuration is outside the scope of this paper so we stick to the originally proposed hyperparameters whenever possible. ", + "bbox": [ + 173, + 135, + 825, + 233 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Implied probabilistic model Conventional neural networks for classification are usually trained using the average cross-entropy loss function with weight decay regularization hidden inside an optimizer in a deep learning framework like PyTorch. The underlying optimization problem can be written as follows: ", + "bbox": [ + 174, + 251, + 825, + 308 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/c15a121a2b84c7453dfe015d29b383c1561b686a56c508b6b0fd1e6eb6d38e3a.jpg", + "text": "$$\nL ( w ) = - \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\log \\hat { p } ( y _ { i } ^ { * } \\mid x _ { i } , w ) + \\frac { \\lambda } { 2 } \\| w \\| ^ { 2 } \\operatorname* { m i n } _ { w } ,\n$$", + "text_format": "latex", + "bbox": [ + 323, + 314, + 674, + 358 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where $\\{ ( x _ { i } , y _ { i } ^ { * } ) \\} _ { i = 1 } ^ { N }$ is the training dataset of $N$ objects $x _ { i }$ with corresponding labels $y _ { i } ^ { * } , \\lambda$ is the weight decay scale and $\\hat { p } ( j | x _ { i } , w )$ denotes the probability that a neural network with parameters $w$ assigns to class $j$ when evaluated on object $x _ { i }$ . ", + "bbox": [ + 174, + 367, + 825, + 410 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "The cross-entropy loss defines a likelihood function $p ( y ^ { * } \\mid x , w )$ and weight decay regularization, or $L _ { 2 }$ regularization corresponding to a certain Gaussian prior distribution $p ( w )$ . The whole optimization objective then corresponds to the maximum a posteriori inference in the following probabilistic model: ", + "bbox": [ + 176, + 416, + 823, + 473 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/7ac45338e73506d4a3bdecb2bf94c6358548f4caa1ed12b136afcbd31fe3007f.jpg", + "text": "$$\n\\begin{array} { c } { { p ( y ^ { * } , w \\mid x ) = p ( y ^ { * } \\mid x , w ) p ( w ) , } } \\\\ { { \\displaystyle \\log p ( y ^ { * } \\mid x , w ) = \\log \\prod _ { i = 1 } ^ { N } p ( y _ { i } ^ { * } \\mid x _ { i } , w ) = \\sum _ { i = 1 } ^ { N } \\log \\hat { p } ( y _ { i } ^ { * } \\mid x _ { i } , w ) , } } \\\\ { { \\displaystyle \\log p ( w ) = \\frac { - N \\lambda } { 2 } \\| w \\| ^ { 2 } + \\mathrm { c o n s t } \\iff p ( w ) = \\mathcal { N } \\left( w \\mid 0 , ( N \\lambda ) ^ { - 1 } I \\right) } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 272, + 479, + 723, + 578 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "In order to make the results comparable across all ensembling techniques, we used the same probabilistic model for all methods, choosing fixed weight decay parameters for each architecture. We used the softmax-based likelihood for all models. We also use the fully-factorized zero-mean Gaussian prior distribution with variances $\\sigma ^ { 2 } = ( N \\lambda ) ^ { - 1 }$ where the number of objects $N$ and the weight decay scale $\\lambda$ are dictated by the particular datasets and neural architectures as defined in the following paragraph. ", + "bbox": [ + 173, + 584, + 825, + 669 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Conventional networks To train a single network on CIFAR-10/100, we used SGD with batch size of 128, momentum 0.9 and model-specific parameters, i.e. the initial learning rate $( l r _ { i n i t } )$ , the weight decay coefficient (wd), and the number of optimization epochs (epoch). Specific hyperparameters are shown in Table 1. The models were trained with a unified learning rate scheduler that is shown in equation 10. All models have been trained using data augmentation that consists of horizontal flips and a random crop of 32 pixels with a padding of 4 pixels5. The standard data normalization has also been applied. Weight decays, initial learning rates, and the learning rate scheduler were taken from (Garipov et al., 2018) paper. Compared with hyperparameters of (Garipov et al., 2018), we increased the number of optimization epochs since we found that all models were underfitted. While the original WideResNet28x10 network includes a number of dropout layers with $p = 0 . 3$ and is trained for 200 epochs, we find that the WideResNet28x10 underfits in this setting and requires a longer training. Therefore, we used $p = 0$ which reduces training time while bearing no significant effect on final model performance in our experiments. ", + "bbox": [ + 173, + 685, + 825, + 853 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/09d204676176528c426c44857d692b1ce875291e8d2313da2192d009ac96e9f4.jpg", + "table_caption": [ + "Table 1: Hyperparameters of models trained on CIFARs for single-model evaluation " + ], + "table_footnote": [], + "table_body": "
Modellrinit epochs wd
VGG0.05 4005e-4
PreResNet1100.1 3003e-4
PreResNet1640.1 3003e-4
WideResNet28x10 0.13005e-4
", + "bbox": [ + 364, + 101, + 633, + 186 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 239, + 619, + 253 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/7060e1466728a5f9e5c28e1e7dc4c8c05433fd32c53d39f6128ac1a884bab51f.jpg", + "text": "$$\n\\begin{array} { r } { \\bot \\mathbf { r } ( i ) = \\left\\{ \\begin{array} { l l } { l _ { r _ { i n i t } } , } & { i \\in [ 0 , 0 . 5 \\cdot \\mathrm { e p o c h s } ] } \\\\ { l _ { r _ { i n i t } } \\cdot ( 1 . 0 - 0 . 9 9 * ( i / \\mathrm { e p o c h s } - 0 . 5 ) / 0 . 4 ) , } & { i \\in [ 0 . 5 \\cdot \\mathrm { e p o c h s } , 0 . 9 \\cdot \\mathrm { e p o c h s } ] } \\\\ { l _ { r _ { i n i t } } \\cdot 0 . 0 1 , } & { \\mathrm { o t h e r w i s e } } \\end{array} \\right. } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 223, + 261, + 769, + 314 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "On ImageNet dataset we used ResNet50 with default hyperparameters taken from PyTorch examples 6. Specifically, we used SGD with momentum 0.9, batch size of 256, initial learning rate 0.1, weight decay $1 e - 4$ . Training included data augmentation7 (scaling, random crops of size $2 2 4 \\times 2 2 4$ , horizontal flips), normalization and learning rate scheduler $l r = l r _ { i n i t } \\cdot 0 . 1 ^ { \\mathrm { e p o c h / / 3 0 } }$ where $/ /$ denotes integer division. We only deviated from standard parameters by increasing the number of training epochs from 90 to 130. Or models achieve top-1 error of $2 3 . 8 1 \\pm 0 . 1 5$ that closely matches the accuracy of ResNet50 provided by PyTorch which is $2 3 . 8 5 ^ { 8 }$ . Training of one model on a single NVIDIA Tesla V100 GPU takes approximately 5.5 days. ", + "bbox": [ + 173, + 320, + 825, + 434 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Deep ensembles Deep ensembles (Lakshminarayanan et al., 2017) average the predictions across networks trained independently starting from different initializations. To obtain a deep ensemble we repeat the described procedure of training standard networks 128 times for all architectures on CIFAR-10 and CIFAR-100 datasets (1024 networks over all) and 50 times for ImageNet dataset. Every member of deep ensembles was trained with exactly the same hyperparameters as conventional models of the same architecture. ", + "bbox": [ + 173, + 450, + 825, + 535 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Dropout Binary dropout (or MC dropout) (Srivastava et al., 2014; Gal & Ghahramani, 2016) is one of the most widely known ensembling techniques. It involves putting a multiplicative Bernoulli noise with a parameter $p$ over the activations of either a fully connected layer or a convolutional layer, averaging predictions of the network w.r.t. noise at test-time. Dropout layers were applied to VGG and WideResNet networks on CIFAR-10 and CIFAR-100 datasets. Dropout for VGG was applied to fully connected layers with $p = 0 . 5$ . Two dropout layers were applied: one before the first fully connected layer and one before the second one. While the original version of VGG for CIFARs (Zagoruyko, 2015) exploits more dropout layers, we observed that any additional dropout layer deteriorates the performance of the model in ether deterministic or stochastic mode. Dropout for WideResNet was applied in accordance with the original paper (Zagoruyko & Komodakis, 2016) with $p = 0 . 3$ . Dropout usually increases the time needed to achieve convergence. Because of this, WideResNet networks with dropout were trained for 400 epochs instead of 300 epochs for deterministic case, and VGG networks have always been trained with dropout. All the other hyperparameters were the same as in the case of conventional models. ", + "bbox": [ + 173, + 550, + 825, + 746 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Variational Inference Variational Inference (VI) approximates the true posterior distribution over weights $p ( w | D a t a )$ with a tractable variational approximation $q _ { \\theta } ( w )$ by maximizing a so-called variational lower bound $\\mathcal { L }$ (eq. 11) w.r.t. the parameters of variational approximation $\\theta$ . We used a fully-factorized Gaussian approximation $q ( w )$ and Gaussian prior distribution $p ( w )$ . ", + "bbox": [ + 174, + 762, + 825, + 819 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/966cd7be74a796b0c4b910a6a6e6834ec7c1feed89c62a86e0127b5dcc72b078.jpg", + "text": "$$\n\\mathcal { L } ( \\theta ) = \\mathbb { E } _ { q } \\log p ( y ^ { * } \\mid x , w ) - K L ( q _ { \\theta } ( w ) \\mid \\mid p ( w ) ) \\to \\operatorname* { m a x } _ { \\theta }\n$$", + "text_format": "latex", + "bbox": [ + 308, + 825, + 691, + 848 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/58a1c200e96c7f97cc10568be00220895c52dcb025054edb6b5779f898e75ff7.jpg", + "text": "$$\nq ( w ) = \\mathcal { N } ( w \\mid \\mu , \\mathrm { d i a g } ( \\sigma ^ { 2 } ) ) \\quad p ( w ) = N ( w \\mid 0 , \\mathrm { d i a g } ( \\sigma _ { p } ^ { 2 } ) ) , \\mathrm { w h e r e } \\sigma _ { p } ^ { 2 } = ( N \\cdot \\mathrm { w d } ) ^ { - 1 }\n$$", + "text_format": "latex", + "bbox": [ + 210, + 849, + 758, + 871 + ], + "page_idx": 16 + }, + { + "type": "table", + "img_path": "images/6d379a8d50595a446c94656c2486bed74487f4ea173a1392c485e51f2c5bb38d.jpg", + "table_caption": [ + "Table 2: Optimal noise scale for K-FAC Laplace for different datasets and architectures. For ResNet50 on ImageNet, the optimal scale found was 2.0 with test-time augmentation and 6.8 without test-time augmentation. " + ], + "table_footnote": [], + "table_body": "
Optimal noise scale
ArchitectureCIFAR-10 CIFAR-10-augCIFAR-100 CIFAR-100-aug
VGG16BN0.0420.0420.1000.100
PreResNet1100.2130.1410.4780.401
PreResNet1640.1200.1050.2850.225
WideResNet28x100.0220.0180.0220.004
", + "bbox": [ + 240, + 101, + 758, + 200 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "In the case of such a prior, the probabilistic model remains consistent with the conventional training which corresponds to MAP inference in the same probabilistic model. We used variational inference for both convolutional and fully-connected layers where variances of the weights were parameterized by $\\log \\sigma$ . For fully-connected layers we applied the local reparameterization trick (LRT, (Kingma et al., 2015)). ", + "bbox": [ + 174, + 281, + 825, + 352 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "While variational inference provides a theoretically grounded way to approximate the true posterior, it tends to underfit deep learning models in practice (Kingma et al., 2015). The following tricks are applied to deal with it: pre-training (Molchanov et al., 2017) or equivalently annealing of $\\beta$ (Sønderby et al., 2016), and scaling $\\beta$ down (Kingma et al., 2015; Ullrich et al., 2017). ", + "bbox": [ + 174, + 358, + 825, + 414 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "During pre-training we initialize $\\mu$ with a snapshot of weights of a pre-trained conventional model, and initialize $\\log \\sigma$ with a model-specific constant $\\log \\sigma _ { i n i t }$ . The KL-divergence – except for the term corresponding to the weight decay – is scaled with a model-specific parameter $\\beta$ . The weight decay term is implemented as a part of the optimizer. We used a fact that the KL-divergence between two Gaussian distributions can be rewritten as two terms, one of which is equivalent to the weight decay regularization. ", + "bbox": [ + 174, + 420, + 825, + 505 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "On CIFAR-10 and CIFAR-100 we used $\\beta$ equal to 1e-4 for VGG, ResNet100 and ResNet164 networks, and $\\beta$ equal to 1e-5 for WideResNet. Log-variance $\\log \\sigma _ { i n i t }$ was initialized with $- 5$ for all models. Parameters $\\mu$ were optimized with SGD in the same manner as in the case of conventional networks except that the initial learning rate $l r _ { i n i t }$ was set to 1e-3. We used a separate Adam optimizer with a constant learning rate of 1e-3 to optimize log-variances of the weights $\\log \\sigma$ . Pretraining was done for 300 epochs, and after that the remaining part of training was done for 100 epochs. On ImageNet we used $\\beta = 1 \\mathrm { e } { - 3 }$ , $l r _ { i n i t } = 0 . 0 1$ , $\\log { \\sigma _ { i n i t } } = - 6$ , and trained the model for 45 epochs after pre-training. ", + "bbox": [ + 173, + 511, + 825, + 623 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "K-FAC Laplace The Laplace approximation uses the curvature information of the appropriately scaled loss function to construct a Gaussian approximation to the posterior distribution. Ideally, one would use the Hessian of the loss function as a covariance matrix and use the maximum a posteriori estimate $w ^ { M A P }$ as a mean of the Gaussian approximation: ", + "bbox": [ + 174, + 640, + 823, + 695 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/a8f7c41b50037fda98448cc616e05be4f95ee453beabeb272b249faa6ab1035b.jpg", + "text": "$$\n\\begin{array} { c } { \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) = \\log p ( \\boldsymbol { y } ^ { * } \\mid \\boldsymbol { x } , \\boldsymbol { w } ) + \\log p ( \\boldsymbol { w } ) + \\mathrm { c o n s t } } \\\\ { \\boldsymbol { w } ^ { M A P } = \\arg \\operatorname* { m a x } _ { \\boldsymbol { w } } \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) ; \\quad \\Sigma = - \\nabla \\nabla \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) } \\\\ { p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) \\approx \\mathcal { N } ( \\boldsymbol { w } \\mid \\boldsymbol { w } ^ { M A P } , \\Sigma ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 281, + 702, + 715, + 772 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "In order to keep the method scalable, we use the Fisher Information Matrix as an approximation to the true Hessian (Martens & Grosse, 2015). For K-FAC Laplace, we use the whole dataset to construct an approximation to the empirical Fisher Information Matrix, and use the $\\pi$ correction to reduce the bias (Ritter et al., 2018; Martens & Grosse, 2015). Following (Ritter et al., 2018), we find the optimal noise scale for K-FAC Laplace on a held-out validation set by averaging across five random initializations. We then reuse this scale for networks trained without a hold-out validation set. We report the optimal values of scales in Table 2. Note that the optimal scale is different depending on whether we use test-time data augmentation or not. Since the data augmentation also introduces some amount of additional noise, the optimal noise scale for K-FAC Laplace with data augmentation is lower. ", + "bbox": [ + 173, + 784, + 825, + 924 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Snapshot ensembles Snapshot ensembles (SSE) (Huang et al., 2017) is a simple example of an array of methods which collect samples from a training trajectory of a network in weight space to construct an ensemble. Samples are collected in a cyclical manner: during each cycle the learning rate goes from a large value to near-zero and snapshot of weights of the network is taken at the end of the cycle. SSE uses SGD with a cosine learning schedule defined as follows: ", + "bbox": [ + 173, + 103, + 823, + 169 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/e878bf844409987f489dadacdcc0f85ed405bd6212df995ba1c43bc32567b14c.jpg", + "text": "$$\n\\alpha ( t ) = \\frac { \\alpha _ { 0 } } 2 \\left( \\cos \\left( \\frac { \\pi \\ \\mathrm { m o d } \\ ( t - 1 , \\lceil T / M \\rceil ) } { \\lceil T / M \\rceil } \\right) + 1 \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 338, + 175, + 656, + 207 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "where $\\alpha _ { 0 }$ is the initial learning rate, $T$ is the total number of training iterations and $\\mathbf { M }$ is the number of cycles. ", + "bbox": [ + 174, + 212, + 823, + 241 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "For all datasets and models hyperparameters from the original SSE paper are reused. For CIFAR10/100 length of the cycle is 40 epochs, maximum learning rate is 0.2, batch size is 64. On ResNet50 and ImageNet length of the cycle is 45 epochs, maximum learning rate is 0.1, batch size is 256. ", + "bbox": [ + 173, + 247, + 825, + 290 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Cyclical SGLD Cyclical Stochastic Gradient Langevin Dynamics (cSGLD) (Zhang et al., 2019) is a state-of-the-art ensembling method for deep neural networks pertaining to stochastic Markov Chain Monte Carlo family of methods. It bears similarity to SSE, e.g. it employs SGD with a learning rate schedule described with the equation 16 and training is cyclical in the same manner. Its main differences from SSE are the introduction of gradient noise and the capturing of several snapshots per cycle, both of which can aid in sampling from posterior distribution over neural network weights efficiently. ", + "bbox": [ + 173, + 304, + 825, + 404 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Some parameters from the original paper are reused: length of cycle is 50 epochs, maximum learning rate is 0.5, batch size is 64. Number of epochs with gradient noise per cycle is 3 epochs. This was found to yield much higher predictive performance and better uncertainty estimation compared to the original paper choice of 10 epochs for CIFAR-10 and 3 epochs for CIFAR-100. ", + "bbox": [ + 174, + 410, + 825, + 465 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Finally, the results of cyclical Stochastic Gradient Hamiltonian Monte Carlo (SGHMC), (Zhang et al., 2019) which reportedly has marginally better performance compared with cyclical SGLD, could not be reproduced with any value of SGD momentum term. Because of this, we only include cyclical SGLD in our benchmark. ", + "bbox": [ + 173, + 472, + 825, + 529 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "FGE Fast Geometric Ensembling (FGE) is an ensembling method that is similar to SSE in that it collects weight samples from a training trajectory to construct an ensemble. Its main differences from SSE are pretraining, short cycle length and a piecewise-linear learning rate schedule: ", + "bbox": [ + 174, + 541, + 825, + 583 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/c0c75003d5c5e3b984b5e1ce77671b4bf9bdf46ca3b36d4e28c655a83c988e56.jpg", + "text": "$$\n\\begin{array} { r } { \\alpha ( i ) = \\left\\{ \\begin{array} { l l } { ( 1 - 2 t ( i ) ) \\alpha _ { 1 } + 2 t ( i ) \\alpha _ { 2 } \\quad } & { 0 < t ( i ) \\le \\frac { 1 } { 2 } } \\\\ { ( 2 - 2 t ( i ) ) \\alpha _ { 2 } + ( 2 t ( i ) - 1 ) \\alpha _ { 1 } \\quad \\frac { 1 } { 2 } < t ( i ) \\le 1 } \\end{array} \\right. . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 313, + 589, + 683, + 621 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Hyperparameters of the original implementation of FGE are reused. Model pretraining is done with SGD for 160 epochs according to the standard learning rate schedule described in equation 10 with maximum learning rates from Table 1. After that, a desired number of FGE cycles is done with one snapshot per cycle collected. For VGG the learning rate is changed with parameters $\\alpha _ { 1 } ~ =$ $1 e - 2 , \\alpha _ { 2 } = 5 e - 4$ in a cycle with cycle length of 2 epochs. For other networks the learning rate is changed with parameters $\\alpha _ { 1 } = 5 e - 2 , \\alpha _ { 2 } = 5 e - 4$ with cycle length of 4 epochs. Batch size is 128. ", + "bbox": [ + 173, + 640, + 825, + 738 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "SWAG SWA-Gaussian (SWAG) (Maddox et al., 2019) is an ensembling method based on fitting a Gaussian distribution to model weights on the SGD training trajectory and sampling from this distribution to construct an ensemble. ", + "bbox": [ + 174, + 753, + 821, + 796 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Like FGE, SWAG has a pretraining stage which is done according to the standard learning rate schedule described in equation 10 with maximum learning rates from Table 1. After that, training continues with a constant learning rate of 1e-2 for all models except for PreResNet110 and PreResNet164 on CIFAR-100 where it continues with a constant learning rate of 5e-2 in accordance with the original paper. Rank of the empirical covariance matrix which is used for estimation of Gaussian distribution parameters is set to be 20. ", + "bbox": [ + 174, + 803, + 825, + 887 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/2a825137f49c7974e6db16204b1deb20b2f92b8075de353a11ccc2ad4f4c35fa.jpg", + "image_caption": [ + "Figure 8: The average log-likelihood vs the Brier score on a test dataset for different ensemble methods on CIFAR-10 (a) and CIFAR-10 (b) and ImageNet (c) datasets. While not being equivalent, these metrics demonstrate a strong linear correlation. The correlation coefficient is denoted as $\\rho$ . " + ], + "image_footnote": [], + "bbox": [ + 302, + 121, + 684, + 847 + ], + "page_idx": 19 + }, + { + "type": "image", + "img_path": "images/f79eb25efb99dc1d1cf2252961481981546a627b7c3560dc947a9f166feb89fb.jpg", + "image_caption": [ + "Figure 9: Log-likelihood vs accuracy for different ensembles before (a, c, e) and after (b, d, f) calibration. Both plain log-likelihood and especially calibrated log-likelihood are highly correlated with accuracy. " + ], + "image_footnote": [], + "bbox": [ + 171, + 203, + 759, + 766 + ], + "page_idx": 20 + }, + { + "type": "image", + "img_path": "images/1c82cd765d3fe4c675cf5745ced5b5595d028f7bbbfc9baf50458fca311762fb.jpg", + "image_caption": [ + "Figure 10: A side-by-side comparison of log-likelihood and calibrated log-likelihood on CIFAR-10 (a) and CIFAR-100 (b) datasets. On CIFAR-10 the performance of one network becomes close to dropout, variational inference (vi), and K-FAC Laplace approximation (kfacl) after calibration on all models except VGG. On CIFAR-100 deep ensembles move to the first position in the ranking after calibration on WideResNet and VGG. See Section 3.1 for details on the calibrated log-likelihood. " + ], + "image_footnote": [], + "bbox": [ + 174, + 126, + 821, + 544 + ], + "page_idx": 21 + }, + { + "type": "image", + "img_path": "images/8f837d5863b3595ff9cc80d99dbb23acb46b6f3ce2f4945af33c61bff0c683c4.jpg", + "image_caption": [ + "Figure 11: The deep ensemble equivalent of various ensembling techniques on ImageNet. Solid lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is shaded. Columns 2–4 correspond to DEE based on other metrics, defined similarly to the loglikelihood-based DEE. The results are consistent for all metrics " + ], + "image_footnote": [], + "bbox": [ + 179, + 685, + 816, + 825 + ], + "page_idx": 21 + }, + { + "type": "image", + "img_path": "images/dc519f6110a305db8a3aad6a42faf32c4c983c8b916344cd0632e17670f2194b.jpg", + "image_caption": [ + "Figure 12: The deep ensemble equivalent of various ensembling techniques on CIFAR-10. Solid lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is shaded. Lines 2–4 correspond to DEE based on other metrics, defined similarly to the log-likelihoodbased DEE. Note that while the actual scale of DEE varies from metric to metric, the ordering of different methods and the overall behaviour of the lines remain the same. " + ], + "image_footnote": [], + "bbox": [ + 179, + 179, + 816, + 702 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "SSE outperforms deep ensembles on CIFAR-10 on the WideResNet architecture. It possibly indicates that the cosine learning rate schedule and longer training of SSE are more suitable for this architecture than the piecewise-linear learning rate schedule and the number of epochs used in deep ensembles. ", + "bbox": [ + 173, + 784, + 825, + 838 + ], + "page_idx": 22 + }, + { + "type": "image", + "img_path": "images/0f9191ac394276b345b9ff56a48f66b2bbb712f94543168240fb11d445daae9b.jpg", + "image_caption": [ + "Figure 13: The deep ensemble equivalent of various ensembling techniques on CIFAR-100. Solid lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is shaded. Lines 2–4 correspond to DEE based on other metrics, defined similarly to the log-likelihoodbased DEE. Note that while the actual scale of DEE varies from metric to metric, the ordering of different methods and the overall behaviour of the lines remain the same. " + ], + "image_footnote": [], + "bbox": [ + 179, + 205, + 816, + 729 + ], + "page_idx": 23 + }, + { + "type": "table", + "img_path": "images/d8205cb8bab67f5c77abbc1d98b3ada6d4617f33ea2020dc2a2f44dcc04c3ae3.jpg", + "table_caption": [], + "table_footnote": [ + "Table 3: Classification error and negative calibrated log-likelihood for different models and numbers of samples on CIFAR-10/100. " + ], + "table_body": "
Model MethodError (%) Negative calibrated log-likelihood
15 101001 5 10 100
Dropout5.86±0.095.81±0.085.82±0.065.79±0.070.232±0.005 0.225±0.0040.224±0.004 0.223±0.003
SWA-Gaussian7.03±0.505.66±0.085.49±0.125.25±0.130.230±0.0140.182±0.0030.171±0.002 0.160±0.002
Cyclic SGLD7.37±0.166.56±0.095.71±0.064.84±0.040.234±0.0040.196±0.0040.176±0.003 0.147±0.003
Fast Geometric Ens.6.52±0.165.95±0.165.69±0.165.10±0.130.213±0.0050.187±0.0030.178±0.003 0.155±0.004
VGG16Deep Ensembles5.95±0.144.79±0.114.57±0.074.39±NA0.226±0.0010.158±0.0020.134±NA
CIFAR-10Single model5.83±0.115.83±0.115.83±0.115.83±0.110.223±0.0020.223±0.0020.223+0.002 0.223+0.002
Variational Inf. (FFG)6.57±0.095.63±0.135.50±0.105.46±0.030.239±0.0020.192±0.0020.184±0.002 0.175±0.001
KFAC-Laplace6.00±0.135.82±0.125.82±0.195.80±0.190.210±0.005 0.203±0.0070.201±0.007 0.200±0.008
Snapshot Ensembles7.76±0.225.52±0.135.00±0.104.54±0.050.247±0.0050.176±0.0010.160±0.001 0.137±0.001
SWA-Gaussian5.77±0.454.56±0.174.46±0.124.34±0.130.178±0.0090.143±0.0040.178±0.009 0.143±0.004 0.139±0.003 0.131±0.003
Cyclic SGLD6.18±0.205.32±0.154.55±0.133.83±0.020.185±0.0060.156±0.0050.138±0.002 0.115±0.001
Fast GeometricEns.5.52±0.094.83±0.084.73±0.104.28±0.050.163±0.0020.141±0.0030.137±0.003 0.126±0.002
ResNet110Deep Ensembles4.66±0.113.77±0.113.63±0.073.53±NA0.148±0.0040.117±0.0020.106±NA
CIFAR-10Single model4.69±0.114.69±0.114.69±0.114.69±0.110.150±0.0020.150±0.0020.150±0.003 0.150±0.002
Variational Inf. (FFG)5.57±0.264.91±0.154.72±0.134.60±0.030.178±0.0030.149±0.0010.144±0.001 0.140±0.000
KFAC-Laplace5.81±0.395.14±0.154.90±0.144.78±0.080.187±0.0140.160±0.0070.147±0.003
Snapshot Ensembles8.41±0.274.85±0.114.16±0.163.52±0.100.252±0.0060.153±0.0020.132±0.002 0.107±0.001
SWA-Gaussian5.41±0.714.21±0.194.21±0.234.02±0.140.171±0.0280.130±0.0040.128±0.004 0.121±0.002
Cyclic SGLD5.80±0.214.97±0.124.30±0.083.66±0.060.178±0.0040.149±0.0040.131±0.003 0.110±0.001
Fast Geometric Ens.5.22±0.074.49±0.064.36±0.074.09±0.120.157±0.0030.134±0.0020.130±0.001 0.119±0.002
ResNet164Deep Ensembles4.53±0.113.51±0.093.50±0.063.34±NA0.147±0.0020.113±0.0010.107±0.001 0.100±NA
CIFAR-10Single model4.52±0.114.52±0.114.52±0.114.52±0.110.144±0.0020.144±0.0030.144±0.002 0.144±0.003
Variational Inf. (FFG)5.62±0.144.78±0.054.66±0.054.55±0.080.183±0.0040.151±0.0010.146±0.001 0.141±0.001
KFAC-Laplace5.23±0.294.77±0.234.65±0.174.60±0.090.168±0.0080.151±0.0070.146±0.005 0.142±0.004
Snapshot Ensembles8.06±0.104.50±0.043.89±0.093.50±0.050.241±0.0040.144±0.0030.124±0.002 0.104±0.001
Dropout3.88±0.123.70±0.183.63±0.193.64±0.170.130±0.0020.120±0.0020.130±0.002 0.120±0.002 0.119±0.001 0.117±0.002
SWA-Gaussian4.98±1.173.53±0.093.34±0.143.28±0.100.157±0.0360.111±0.0040.105±0.0030.101±0.002
Cyclic SGLD4.78±0.164.09±0.113.63±0.133.19±0.040.155±0.0030.128±0.0020.114±0.0010.099±0.002
Fast Geometric Ens.4.86±0.173.95±0.073.77±0.103.34±0.060.148±0.0030.120±0.0020.113±0.0020.102±0.001
WideResNetDeepEnsembles3.65±0.023.11±0.103.01±0.062.83±NA0.123±0.0020.097±0.0010.095±0.0010.090±NA
CIFAR-10Single model3.70±0.153.70±0.153.70±0.153.70±0.150.124±0.0050.124±0.0050.125±0.0050.124±0.005
Variational Inf. (FFG)5.61±0.044.15±0.153.94±0.103.64±0.070.189±0.0020.134±0.0020.127±0.0020.117±0.001
KFAC-Laplace4.03±0.193.90±0.153.88±0.223.83±0.160.134±0.0040.124±0.0040.122±0.0050.120±0.003
Snapshot Ensembles5.56±0.153.68±0.093.33±0.102.89±0.070.179±0.0050.119±0.0010.105±0.0010.090±0.001
Dropout26.10±0.2025.68±0.1825.66±0.1425.60±0.171.176±0.0081.111±0.0081.098±0.0091.084±0.009
SWA-Gaussian27.74±1.8724.53±0.0923.64±0.2822.97±0.201.109±0.0730.931±0.0070.879±0.0070.826±0.005
Cyclic SGLD29.75±0.1726.79±0.1924.14±0.1121.15±0.111.114±0.0030.976±0.0040.881±0.0060.749±0.004
Fast Geometric Ens.27.07±0.2425.35±0.2924.68±0.4022.78±0.221.057±0.0100.965±0.0030.930±0.0030.827±0.004
VGG16Deep Ensembles25.72±0.1721.60±0.1320.79±0.1619.88±NA1.092±0.0040.840±0.0050.794±0.0020.723±NA
CIFAR-100Single model25.44±0.2925.44±0.2925.44±0.2925.44±0.291.087±0.0061.087±0.0061.087±0.0061.087±0.006
Variational Inf.(FFG)27.24±0.0925.24±0.1124.85±0.0524.56±0.071.154±0.0041.001±0.0020.973±0.0020.939±0.001
KFAC-Laplace27.11±0.5925.98±0.2125.84±0.3825.70±0.381.174±0.0371.089±0.0071.069±0.0051.050±0.008
Snapshot Ensembles31.19±0.3323.87±0.1822.31±0.3121.03±0.101.170±0.0120.899±0.0040.834±0.005 0.751±0.003
SWA-Gaussian27.75±0.7622.31±0.2221.52±0.3020.69±0.190.960±0.0330.781±0.0110.745±0.0100.701±0.008
Cyclic SGLD25.73±0.1423.30±0.1921.20±0.2118.07±0.160.914±0.0060.818±0.0040.753±0.0020.630±0.002
Fast Geometric Ens.22.84±0.1621.22±0.2020.79±0.2319.64±0.15(0.798±0.0060.729±0.0030.713±0.002:0.679±0.002
ResNet110Deep Ensembles22.55±0.2818.30±0.2217.59±0.2116.97±NA0.847±0.0070.675±0.0010.638±0.0010.594±NA
CIFAR-100Single model22.66±0.3122.66±0.3122.66±0.3122.66±0.310.848±0.0140.848±0.0150.848±0.0140.848±0.015
VariationalInf.(FFG)24.27±0.2622.41±0.1322.14±0.1221.86±0.070.924±0.0070.829±0.0030.813±0.0010.795±0.001
KFAC-Laplace24.88±0.9722.87±0.4422.41±0.2622.14±0.290.948±0.0360.858±0.0140.836±0.0100.812±0.010
Snapshot Ensembles30.30±0.4022.83±0.2321.13±0.1418.48±0.251.069±0.0060.820±0.0030.761±0.0020.662±0.002
SWA-Gaussian24.38±0.9320.62±0.1820.08±0.1919.48±0.190.844±0.0420.719±0.0060.700±0.006 0.667±0.004
Cyclic SGLD24.87±0.3922.37±0.2720.23±0.2217.13±0.180.888±0.0080.790±0.009
Fast Geometric Ens.21.92±0.1520.10±0.2219.87±0.2518.73±0.250.765±0.0030.699±0.0040.686±0.0040.650±0.003
ResNet164CIFAR-100Deep EnsemblesSingle model21.41±0.2517.53±0.1716.90±0.1516.50±NA0.819±0.0080.647±0.0030.615±0.0020.574±NA
CIAR-100Single modelVariational Inf. (FFG)23.47±0.2621.35±0.1121.10±0.1620.82±0.040.910±0.0010.801±0.0020.782±0.0020.762±0.000
KFAC-Laplace23.44±0.4521.77±0.2021.29±0.23221.03±0.380.902±0.0190.813±0.0060.792±0.0050.772±0.007
Snapshot Ensembles29.48±0.1921.92±0.1820.27±0.2317.68±0.071.045±0.0050.789±0.0050.729±0.004 0.634±0.003
Dropout20.19±0.11 19.41±0.1719.36±0.1219.22±0.150.823±0.0080.768±0.0050.760±0.006 0.751±0.005
SWA-Gaussian20.45±0.73 17.57±0.1717.21±0.2217.08±0.190.794±0.0250.653±0.0040.634±0.005 0.614±0.005
Cyclic SGLD21.42±0.3219.42±0.2817.88±0.1616.29±0.100.813±0.0100.713±0.0090.654±0.005 0.583±0.004
Fast Geometric Ens.21.48±0.3118.54±0.1618.00±0.1917.12±0.160.770±0.0070.652±0.0060.630±0.006 0.596±0.003
WideResNetDeepEnsembles19.38±0.2016.55±0.0816.17±0.1515.77±NA0.797±0.0070.623±0.0030.595±0.003 0.571±NA
CIFAR-100SSingle model19.31±0.2419.31±0.2419.31±0.2419.31±0.240.797±0.0100.797±0.0100.797±0.010 0.797±0.010
VariationalInf. (FFG)24.38±0.2720.17±0.1519.28±0.0918.74±0.081.004±0.0110.767±0.0040.727±0.003 0.685±0.002
KFAC-Laplace20.02±0.18 19.76±0.1519.53±0.1919.43±0.210.834±0.0090.803±0.006 0.795±0.007 0.789±0.006
Snapshot Ensembles23.01±0.26 18.20±0.1317.12±0.3116.07±0.070.859±0.009 0.678±0.006 0.633±0.008 0.582±0.004
", + "bbox": [ + 178, + 121, + 820, + 880 + ], + "page_idx": 24 + }, + { + "type": "table", + "img_path": "images/ff5628fbf7a70318b2599a800f6465a6b7a575fe44b3dac05fc99771191be206.jpg", + "table_caption": [], + "table_footnote": [ + "Table 4: Classification error and negative calibrated log-likelihood before vs. after test-time augmentation on CIFAR-10/100. " + ], + "table_body": "
Error (%) Negative calibrated log-likelihood
ModelMethod5 10 100 510100
Dropout5.81 vs 5.525.82 vs 5.345.79 vs 5.210.225 vs 0.1870.224 vs 0.1770.223 vs 0.167
SWA-Gaussian5.66 vs 5.655.49 vs 5.365.25 vs 5.080.182 vs 0.1800.171 vs 0.1660.160 vs 0.152
Cyclic SGLD6.56 vs 6.075.71 vs 5.474.84 vs 4.880.196 vs 0.1860.176 vs 0.1690.147 vs 0.147
Fast Geometric Ens.5.95 vs 5.645.69 vs 5.365.10 vs 4.98~0.187 vs 0.1770.178 vs 0.1670.155 vs 0.150
VGG16Deep Ensembles4.79 vs 4.904.57 vs 4.734.39 vs 4.55个0.158 vs 0.1620.148 vs 0.1520.134 vs 0.136个
CIFAR-10Single model5.83 vs 5.555.83 vs 5.355.83 vs 5.19↓0.223 vs 0.1830.223 vs 0.1740.223 vs 0.166
VariationalInf.(FFG)5.63vs5.435.50 vs 5.255.46 vs 5.070.192 vs 0.1820.184 vs 0.1690.175 vs 0.154
KFAC-Laplace5.82 vs 5.495.82 vs 5.325.80 vs 5.170.203 vs 0.1770.201 vs 0.1710.200 vs 0.164
Snapshot Ensembles5.52 vs 5.61~5.00 vs 5.03~4.54 vs 4.640.176 vs 0.178个0.160 vs 0.160~0.137 vs 0.137
SWA-Gaussian4.56 vs 4.47~4.46 vs 4.344.34 vs 4.160.143 vs 0.1420.139 vs 0.1350.131 vs 0.125
Cyclic SGLD5.32 vs 4.884.55 vs 4.353.83 vs 3.590.156 vs 0.1480.138 vs 0.1310.115 vs 0.111
Fast Geometric Ens.4.83 vs 4.594.73 vs 4.444.28 vs 4.140.141 vs 0.1380.137 vs 0.1320.126 vs 0.121
ResNet110Deep Ensembles3.77 vs 3.703.63 vs 3.583.53 vs 3.450.117 vs 0.1180.112 vs 0.1120.106 vs 0.105
CIFAR-10Single model4.69 vs 4.324.69 vs 4.234.69 vs 4.100.150 vs 0.1370.150 vs 0.1340.150 vs 0.131
Variational Inf.(FFG)44.91 vs 4.664.72 vs 4.434.60 vs 4.250.149 vs 0.1450.144 vs 0.1380.140 vs 0.130
KFAC-Laplace5.14 vs 4.434.90 vs 4.274.78 vs 4.170.160 vs 0.1390.153 vs 0.1340.147 vs 0.130
Snapshot Ensembles4.85 vs 4.78~4.16 vs 4.183.52 vs 3.480.153 vs 0.1500.132 vs 0.1300.107 vs 0.106
SWA-Gaussian4.21 vs 4.174.21 vs 4.04~4.02 vs 3.840.130 vs 0.130~0.128 vs 0.126~0.121 vs 0.116
Cyclic SGLD4.97 vs 4.674.30 vs 4.013.66 vs 3.480.149 vs 0.1410.131 vs 0.1250.110 vs 0.107
Fast Geometric Ens.4.49 vs 4.294.36 vs 4.154.09 vs 3.850.134 vs 0.1310.130 vs 0.1260.119 vs 0.115
ResNet164Deep Ensembles3.51 vs 3.583.50 vs 3.463.34 vs 3.300.113 vs 0.1140.107 vs 0.1070.100 vs 0.101个
CIFAR-10Single model4.52 vs 4.154.52 vs 4.084.52 vs 3.980.144 vs 0.1310.144 vs 0.1280.144 vs 0.126
VariationalInf.(FFG)4.78vs 4.414.66 vs 4.224.55 vs 4.050.151 vs 0.1420.146 vs 0.1350.141 vs 0.128
KFAC-Laplace4.77 vs 4.264.65 vs 4.214.60 vs 4.080.151 vs 0.1350.146 vs 0.1320.142 vs 0.127
Snapshot Ensembles4.50 vs 4.423.89 vs 3.873.50 vs 3.350.144 vs 0.1420.124 vs 0.1230.104 vs 0.104
Dropout3.70 vs 3.62~3.63 vs 3.523.64 vs 3.440.120 vs 0.1170.119 vs 0.1140.117 vs 0.111
SWA-Gaussian3.53 vs 3.59~3.34 vs 3.34~3.28 vs 3.24~0.111 vs 0.1140.105 vs 0.1070.101 vs 0.102
Cyclic SGLD4.09 vs 3.95~3.63 vs 3.583.19 vs 3.22~0.128 vs 0.1250.114 vs 0.1120.099 vs 0.100个
Fast Geometric Ens.3.95 vs 3.90~3.77 vs 3.643.34 vs 3.270.120 vs 0.120~0.113 vs 0.1130.102 vs 0.102
WideResNetDeepEnsembles3.11 vs 3.21个3.01 vs 3.022.83 vs 2.910.097 vs 0.1030.095 vs 0.0980.090 vs 0.094
CIFAR-10Single model3.70 vs 3.533.70 vs 3.453.70 vs 3.400.124 vs 0.117↓0.125 vs 0.114↓0.124 vs 0.113
VariationalInf.(FFG)4.15vs4.053.94 vs 3.803.64 vs 3.63~0.134 vs 0.1360.127 vs 0.1260.117 vs 0.116
KFAC-Laplace3.90 vs 3.633.88 vs 3.583.83vs 3.500.124 vs 0.1150.122 vs 0.1130.120 vs 0.111
Snapshot Ensembles3.68 vs 3.743.33 vs 3.352.89 vs 2.900.119 vs 0.122个0.105 vs 0.107个0.090 vs 0.093
Dropout25.68 vs 24.3725.66 vs 23.8925.60 vs 23.411.111 vs 0.9991.098 vs 0.960↓1.084 vs 0.911
SWA-Gaussian24.53 vs 24.2823.64 vs 23.2722.97 vs 22.340.931 vs 0.9260.879 vs 0.8590.826 vs 0.795
Cyclic SGLD26.79 vs 25.6624.14 vs 23.4521.15 vs 21.040.976 vs 0.9290.881 vs 0.8480.749 vs 0.740
Fast Geometric Ens.25.35 vs 24.5324.68 vs 23.6222.78 vs 22.200.965 vs 0.9210.930 vs 0.8780.827 vs 0.800
VGG16Deep Ensembles21.60 vs 21.90个20.79 vs 21.0319.88 vs 20.230.840 vs 0.865个0.794 vs 0.811个0.723 vs 0.731
CIFAR-100Single model25.44 vs 24.3825.44 vs 23.9225.44 vs 23.481.087 vs 0.9731.087 vs 0.9451.087 vs 0.912
VariationalInf.(FFG)25.24vs24.1924.85 vs 23.5624.56 vs 22.891.001 vs 0.9640.973 vs 0.9190.939 vs 0.864
KFAC-Laplace25.98 vs 24.5325.84 vs 24.0325.70 vs 23.571.089 vs 0.9891.069 vs 0.9491.050 vs 0.909
Snapshot Ensembles23.87 vs 23.8822.31 vs 22.5021.03 vs 21.040.899 vs 0.905~0.834 vs 0.836~0.751 vs 0.750
SWA-Gaussian22.31 vs 22.20~21.52 vs 21.21~20.69 vs 20.280.781 vs 0.7700.745 vs 0.7300.701 vs 0.683
Cyclic SGLD23.30 vs 22.3221.20 vs 20.4318.07 vs 17.670.818 vs 0.7870.753 vs 0.7250.630 vs 0.616
Fast Geometric Ens.21.22 vs 20.6920.79 vs 20.1819.64 vs 19.250.729 vs 0.7140.713 vs 0.6940.679 vs 0.661
ResNet110Deep Ensembles18.30 vs 18.3617.59 vs 17.6116.97 vs 16.740.675 vs 0.6720.638 vs 0.6350.594 vs 0.591
CIFAR-100Single model22.66 vs 21.3722.66 vs 21.1722.66 vs 20.980.848 vs 0.7970.848 vs 0.7860.848 vs 0.775
Variational Inf. (FFG)22.41 vs 21.6722.14 vs 21.2121.86 vs 20.770.829 vs 0.7990.813 vs 0.7750.795 vs 0.748
KFAC-Laplace22.87 vs 21.6922.41 vs 21.2822.14 vs 20.990.858 vs 0.8100.836 vs 0.7880.812 vs 0.766
Snapshot Ensembles22.83 vs 22.3321.13 vs 20.7118.48 vs 18.230.820 vs 0.8060.761 vs 0.7440.662 vs 0.651
SWA-Gaussian20.62 vs 20.6120.08 vs 20.0819.48 vs 19.330.719 vs 0.7150.700 vs 0.6900.667 vs 0.654
Cyclic SGLD22.37 vs 21.5720.23 vs 19.5817.13 vs 16.990.790 vs 0.7670.722 vs 0.7020.606 vs 0.595
Fast Geometric Ens.20.10 vs 19.8219.87 vs 19.3918.73 vs 18.330.699 vs 0.6890.686 vs 0.6710.650 vs 0.636
ResNet164Deep Ensembles17.53 vs 17.5716.90 vs 16.8416.50 vs 16.220.647 vs 0.650~0.615 vs 0.6130.574 vs 0.575
CIFAR-100Single model21.39 vs 20.6021.39 vs 20.3921.39 vs 20.230.817 vs 0.7720.817 vs 0.7610.817 vs 0.751
VariationalInf.(FFG)21.35vs 21.0621.10 vs 20.5420.82 vs 19.970.801 vs 0.7850.782 vs 0.7590.762 vs 0.731
KFAC-Laplace21.77 vs 20.6621.29 vs 20.3621.03 vs 20.180.813 vs 0.7780.792 vs 0.7580.772 vs 0.740
Snapshot Ensembles21.92 vs 21.6920.27 vs 19.9217.68 vs 17.660.789 vs 0.7810.729 vs 0.7200.634 vs 0.629
Dropout19.41 vs 19.2719.36 vs 19.1119.22 vs 18.880.768 vs 0.7510.760 vs 0.7380.751 vs 0.723
Cyclic SGLD19.42 vs 18.8317.88 vs 17.5016.29 vs 16.210.713 vs 0.6960.654 vs 0.6410.583 vs 0.580
Fast Geometric Ens.18.54 vs 18.3918.00 vs 17.8417.12 vs 16.930.652 vs 0.6490.630 vs 0.6240.596 vs 0.592
WideResNetDeepEnsembles16.55 vs 16.84个16.17 vs 16.3015.77 vs 15.770.623 vs 0.632个0.595 vs 0.6020.571 vs 0.573个
CIFAR-100Singlemodel19.31 vs 18.8319.31 vs 18.8019.31 vs 18.720.797 vs 0.7550.797 vs 0.7460.797 vs 0.738
VariationalInf.(FFG)20.17vs20.1219.28 vs 19.20~18.74 vs 18.540.767 vs 0.766~0.727 vs 0.7240.685 vs 0.679
KFAC-Laplace19.76 vs 19.2119.53 vs 19.0319.43 vs 18.930.803 vs 0.7640.795 vs 0.757↓0.789 vs 0.747
Snapshot Ensembles18.20 vs 18.2217.12 vs 17.2016.07 vs 16.27~0.678 vs 0.6800.633 vs 0.6350.582 vs 0.586个
", + "bbox": [ + 178, + 145, + 818, + 853 + ], + "page_idx": 25 + }, + { + "type": "table", + "img_path": "images/80694f819e2b363ec5780885623f38bcafd88a15fb20d0149149dda8dc74e89d.jpg", + "table_caption": [ + "Table 5: Deep ensemble equivalent score for CIFAR-10/100. " + ], + "table_footnote": [], + "table_body": "
ModelDeep ensemble equivalent score
Method1 sample 5 samples 10 samples 50 samples 100 samples
VGG16 CIFAR-10Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.64.721.933.8
Cyclic SGLD1.0 1.72.67.410.5
SWA-Gaussian1.0 2.22.94.44.6
1.3 2.0
Fast Geometric Ens.2.44.75.8
Dropout1.0 1.01.01.11.1
Variational Inf. (FFG)1.0 1.82.02.52.6 1.6
KFAC-Laplace Single model1.4 1.6 1.11.6 1.11.6 1.11.1
ResNet110 CIFAR-101.1 5.094.6
Deep Ensembles1.0 1.0 1.010.0 2.048.032.6
Snapshot Ensembles1.0 1.01.614.66.0
Cyclic SGLD1.34.62.0
SWA-Gaussian1.01.51.9
Fast Geometric Ens.1.0 1.4 1.01.72.42.9
Variational Inf. (FFG)1.01.21.41.5
KFAC-Laplace1.0 1.01.01.01.1
Single model1.0 1.01.01.01.0
Deep Ensembles1.0 5.010.043.7100.0
ResNet164 CIFAR-101.0 1.12.311.317.2
Snapshot Ensembles Cyclic SGLD1.0 1.01.84.86.7
SWA-Gaussian1.0 1.81.92.52.7
Fast Geometric Ens.1.0 1.61.82.52.9
Variational Inf. (FFG)1.0 1.01.01.31.3
1.01.0 1.01.21.2
KFAC-Laplace1.11.1 1.11.11.1
Single model1.010.048.0
Deep Ensembles5.0 1.02.530.686.0 100.0
Snapshot Ensembles1.3 1.0 1.01.64.04.1
Cyclic SGLD SWA-Gaussian1.01.82.53.1 3.3
WideResNet Fast Geometric Ens. CIFAR-101.01.21.72.7 3.2
Dropout1.01.21.3 1.41.4
Variational Inf. (FFG)1.01.01.0 1.31.4
KFAC-Laplace1.01.01.0 1.21.2
Single model1.01.01.01.0
VGG16 CIFAR-1001.0
Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.95.418.826.8
Cyclic SGLD1.0 1.8 1.0 2.33.3 3.415.928.2
SWA-Gaussian1.2 1.92.35.25.9 5.8
Fast Geometric Ens.1.0 1.01.04.5 1.01.1
Dropout1.82.12.2
Variational Inf. (FFG)1.0 1.61.3
KFAC-Laplace Single model1.0 1.01.2 1.01.3 1.01.0
1.0 1.01.0
ResNet110 CIFAR-1005.010.050.099.0
Deep Ensembles Snapshot Ensembles1.0 1.31.94.76.2
1.02.07.012.2
Cyclic SGLD1.32.23.6
SWA-Gaussian1.0 1.7 1.5 2.63.03.3 4.24.7
Fast Geometric Ens. Variational Inf. (FFG)1.0 1.21.31.51.5
KFAC-Laplace1.0 1.01.11.31.4
Single model1.0 1.01.01.01.0
Deep Ensembles1.010.050.0100.0
Snapshot Ensembles5.0 1.0
ResNet164 CIFAR-1001.31.94.86.3
Cyclic SGLD SWA-Gaussian1.0 1.32.06.813.3
Fast Geometric Ens.1.0 2.1 1.6 2.62.6 3.03.6 4.23.8 4.8
Variational Inf. (FFG)1.0 1.21.41.61.6
KFAC-Laplace1.0 1.11.31.51.5
1.0
Single model1.01.01.01.0
WideResNet Fast Geometric Ens. CIFAR-100Dropout Variational Inf. (FFG) KFAC-LaplaceDeep Ensembles5.010.049.095.9
Snapshot Ensembles1.0 1.0 2.54.216.220.0
Cyclic SGLD SWA-Gaussian1.0 1.9 1.0 3.23.2 4.213.6 5.718.8 6.0
", + "bbox": [ + 254, + 98, + 741, + 898 + ], + "page_idx": 26 + }, + { + "type": "table", + "img_path": "images/dd08cc8919404c8521c907c23aa73ed43d249d5e9805df9552f3337025dcc5a3.jpg", + "table_caption": [ + "Table 6: Classification error and negative calibrated log-likelihood for different numbers of samples on ImageNet. " + ], + "table_footnote": [], + "table_body": "
Error (%)Negative calibrated log-likelihood
ModelMethod151050151050
Fast Geometric Ens.23.71±0.0023.61±0.0023.56±0.0023.28±0.000.929±0.0000.921±0.0000.916±0.0000.904±0.000
Deep Ensembles23.79±0.1421.19±0.14 20.90±0.08 20.63±NA0.935±0.007 0.823±0.002 0.805±0.0000.788±NA
ResNet50 Single model23.86±0.2023.86±0.2023.86±0.2023.86±0.200.938±0.0060.938±0.006:0.938±0.0060.938±0.006
Variational Inf.(FFG)24.50±0.06 23.82±0.03223.77±0.04 23.67±0.000.957±0.0010.927±0.0000.923±0.0010.920±0.000
KFAC-Laplace25.01±0.4924.19±0.2923.93±0.2023.86±0.160.988±0.0220.948±0.0130.939±0.0110.934±0.008
Snapshot Ensembles24.92±NA22.21±NA21.75±NA21.48±NA0.983±NA0.865±NA0.843±NA0.830±NA
", + "bbox": [ + 178, + 101, + 820, + 200 + ], + "page_idx": 27 + }, + { + "type": "table", + "img_path": "images/ee33806917cc00e9cc730edf40acf6c59f3c578fd8ec9f64061c2594fe50bb88.jpg", + "table_caption": [ + "Table 7: Classification error and negative calibrated log-likelihood before vs. after test-time augmentation on ImageNet. " + ], + "table_footnote": [], + "table_body": "
Error (%)Negative calibrated log-likelihood
ModelMethod5105051050
Fast Geometric Ens.23.61 vs 22.2123.56 vs 21.3723.28 vs 20.670.921 vs 0.8940.916 vs 0.8420.904 vs 0.793
Deep Ensembles21.19 vs 21.2020.90 vs 20.1620.63 vs 19.390.823 vs 0.855个0.805 vs 0.7930.788 vs 0.739
ResNet50 Single model23.86 vs 22.3923.86 vs 21.6023.86 vs 21.060.938 vs 0.9000.938 vs 0.8510.938 vs 0.805
Variational Inf. (FFG)23.82 vs 22.5823.77 vs 21.7423.67 vs 21.100.927 vs 0.9050.923 vs 0.8510.920 vs 0.805
KFAC-Laplace24.19 vs 22.5023.93 vs 21.6723.86 vs 21.040.948 vs 0.9060.939 vs 0.8550.934 vs 0.809
Snapshot Ensembles22.21 vs 21.9921.75 vs 20.8121.48 vs 19.860.865 vs 0.879个0.843 vs 0.8150.830 vs 0.763
", + "bbox": [ + 179, + 243, + 820, + 338 + ], + "page_idx": 27 + }, + { + "type": "table", + "img_path": "images/b377037602b4810ea333cb6e7a3a37cbbca4ce25cb1d37def4fbebbf5817ba63.jpg", + "table_caption": [ + "Table 8: Deep ensemble equivalent score for ImageNet. " + ], + "table_footnote": [], + "table_body": "
Deep ensemble equivalent score
ModelMethod1 sample 5 samples 10 samples 25 samples 50 samples
Deep Ensembles1.05.010.025.050.0
Snapshot Ensembles1.02.23.24.04.2
ResNet50 Fast Geometric Ens.1.11.21.31.41.5
Variational Inf. (FFG)1.01.11.21.21.2
KFAC-Laplace1.01.01.01.01.0
Single model1.01.01.01.01.0
", + "bbox": [ + 241, + 381, + 756, + 494 + ], + "page_idx": 27 + }, + { + "type": "image", + "img_path": "images/06c0a02f97dac8847cb6e77106788659571be54f7441eec252ec711954a27069.jpg", + "image_caption": [ + "Figure 14: Classification error and negative calibrated log-likelihood before vs. after test-time aug mentation on CIFAR-10 " + ], + "image_footnote": [], + "bbox": [ + 184, + 111, + 812, + 904 + ], + "page_idx": 28 + }, + { + "type": "image", + "img_path": "images/972ed43a1c92f0c8398f5c3ca02ab2e95164ce635709284ce67e4c2b485dddf1.jpg", + "image_caption": [ + "Figure 15: Classification error and negative calibrated log-likelihood before vs. after test-time aug mentation on CIFAR-100 " + ], + "image_footnote": [], + "bbox": [ + 183, + 112, + 812, + 904 + ], + "page_idx": 29 + } +] \ No newline at end of file diff --git a/parse/train/BJxI5gHKDr/BJxI5gHKDr_middle.json b/parse/train/BJxI5gHKDr/BJxI5gHKDr_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..b2efdfe287d5f82be77fc15093b1204bc39d557c --- /dev/null +++ b/parse/train/BJxI5gHKDr/BJxI5gHKDr_middle.json @@ -0,0 +1,56707 @@ +{ + "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": "PITFALLS OF IN-DOMAIN UNCERTAINTY ESTIMATION", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 99, + 394, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 99, + 394, + 117 + ], + "score": 1.0, + "content": "AND ENSEMBLING IN DEEP LEARNING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 109, + 135, + 253, + 169 + ], + "lines": [ + { + "bbox": [ + 109, + 135, + 189, + 146 + ], + "spans": [ + { + "bbox": [ + 109, + 135, + 189, + 146 + ], + "score": 1.0, + "content": "Arsenii Ashukha ∗", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 108, + 147, + 253, + 158 + ], + "spans": [ + { + "bbox": [ + 108, + 147, + 253, + 158 + ], + "score": 1.0, + "content": "Samsung AI Center Moscow, HSE‡", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 109, + 158, + 243, + 170 + ], + "spans": [ + { + "bbox": [ + 109, + 158, + 243, + 170 + ], + "score": 1.0, + "content": "aashukha@bayesgroup.ru", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 318, + 135, + 501, + 169 + ], + "lines": [ + { + "bbox": [ + 317, + 135, + 405, + 146 + ], + "spans": [ + { + "bbox": [ + 317, + 135, + 405, + 146 + ], + "score": 1.0, + "content": "Alexander Lyzhov ∗", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 317, + 147, + 501, + 158 + ], + "spans": [ + { + "bbox": [ + 317, + 147, + 501, + 158 + ], + "score": 1.0, + "content": "Samsung AI Center Moscow, Skoltech†, HSE§", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 317, + 158, + 446, + 170 + ], + "spans": [ + { + "bbox": [ + 317, + 158, + 446, + 170 + ], + "score": 1.0, + "content": "alyzhov@bayesgroup.ru", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 109, + 186, + 253, + 219 + ], + "lines": [ + { + "bbox": [ + 108, + 186, + 199, + 197 + ], + "spans": [ + { + "bbox": [ + 108, + 186, + 199, + 197 + ], + "score": 1.0, + "content": "Dmitry Molchanov ∗", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 109, + 198, + 253, + 209 + ], + "spans": [ + { + "bbox": [ + 109, + 198, + 253, + 209 + ], + "score": 1.0, + "content": "Samsung AI Center Moscow, HSE‡", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 109, + 208, + 231, + 222 + ], + "spans": [ + { + "bbox": [ + 109, + 208, + 231, + 222 + ], + "score": 1.0, + "content": "dmolch@bayesgroup.ru", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 320, + 186, + 461, + 219 + ], + "lines": [ + { + "bbox": [ + 319, + 184, + 384, + 198 + ], + "spans": [ + { + "bbox": [ + 319, + 184, + 384, + 198 + ], + "score": 1.0, + "content": "Dmitry Vetrov", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 319, + 196, + 461, + 210 + ], + "spans": [ + { + "bbox": [ + 319, + 196, + 461, + 210 + ], + "score": 1.0, + "content": "HSE‡, Samsung AI Center Moscow", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 320, + 208, + 447, + 221 + ], + "spans": [ + { + "bbox": [ + 320, + 208, + 447, + 221 + ], + "score": 1.0, + "content": "dvetrov@bayesgroup.ru", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 278, + 249, + 333, + 261 + ], + "lines": [ + { + "bbox": [ + 276, + 248, + 336, + 263 + ], + "spans": [ + { + "bbox": [ + 276, + 248, + 336, + 263 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 143, + 274, + 468, + 384 + ], + "lines": [ + { + "bbox": [ + 142, + 274, + 469, + 287 + ], + "spans": [ + { + "bbox": [ + 142, + 274, + 469, + 287 + ], + "score": 1.0, + "content": "Uncertainty estimation and ensembling methods go hand-in-hand. Uncertainty", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 285, + 469, + 297 + ], + "spans": [ + { + "bbox": [ + 142, + 285, + 469, + 297 + ], + "score": 1.0, + "content": "estimation is one of the main benchmarks for assessment of ensembling perfor-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 296, + 469, + 308 + ], + "spans": [ + { + "bbox": [ + 141, + 296, + 469, + 308 + ], + "score": 1.0, + "content": "mance. At the same time, deep learning ensembles have provided state-of-the-art", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 307, + 469, + 320 + ], + "spans": [ + { + "bbox": [ + 141, + 307, + 469, + 320 + ], + "score": 1.0, + "content": "results in uncertainty estimation. In this work, we focus on in-domain uncertainty", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 318, + 470, + 330 + ], + "spans": [ + { + "bbox": [ + 141, + 318, + 470, + 330 + ], + "score": 1.0, + "content": "for image classification. We explore the standards for its quantification and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 330, + 470, + 341 + ], + "spans": [ + { + "bbox": [ + 141, + 330, + 470, + 341 + ], + "score": 1.0, + "content": "point out pitfalls of existing metrics. Avoiding these pitfalls, we perform a broad", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 340, + 469, + 352 + ], + "spans": [ + { + "bbox": [ + 141, + 340, + 469, + 352 + ], + "score": 1.0, + "content": "study of different ensembling techniques. To provide more insight in this study,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 351, + 469, + 364 + ], + "spans": [ + { + "bbox": [ + 141, + 351, + 469, + 364 + ], + "score": 1.0, + "content": "we introduce the deep ensemble equivalent score (DEE) and show that many", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 142, + 362, + 469, + 374 + ], + "spans": [ + { + "bbox": [ + 142, + 362, + 469, + 374 + ], + "score": 1.0, + "content": "sophisticated ensembling techniques are equivalent to an ensemble of only few", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 373, + 388, + 385 + ], + "spans": [ + { + "bbox": [ + 141, + 373, + 388, + 385 + ], + "score": 1.0, + "content": "independently trained networks in terms of test performance.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 19.5 + }, + { + "type": "title", + "bbox": [ + 242, + 401, + 379, + 412 + ], + "lines": [ + { + "bbox": [ + 240, + 400, + 381, + 413 + ], + "spans": [ + { + "bbox": [ + 240, + 400, + 381, + 413 + ], + "score": 1.0, + "content": "video / code / blog post", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "title", + "bbox": [ + 108, + 434, + 206, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 208, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 208, + 450 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 505, + 514 + ], + "lines": [ + { + "bbox": [ + 105, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "Deep neural networks (DNNs) have become one of the most popular families of machine learning", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "score": 1.0, + "content": "models. The predictive performance of DNNs for classification is often measured in terms of accu-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 481, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 506, + 493 + ], + "score": 1.0, + "content": "racy. However, DNNs have been shown to yield inaccurate and unreliable probability estimates, or", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "score": 1.0, + "content": "predictive uncertainty (Guo et al., 2017). This has brought considerable attention to the problem of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 503, + 308, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 308, + 515 + ], + "score": 1.0, + "content": "uncertainty estimation with deep neural networks.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 630 + ], + "lines": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "There are many faces to uncertainty estimation. Different desirable uncertainty estimation properties", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 530, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 505, + 543 + ], + "score": 1.0, + "content": "of a model require different settings and metrics to capture them. Out-of-domain uncertainty of the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 542, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 554 + ], + "score": 1.0, + "content": "model is measured on the data that does not follow the same distribution as the training dataset", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 551, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 506, + 567 + ], + "score": 1.0, + "content": "(out-of-domain data). Out-of-domain data can include images corrupted with rotations or blurring,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 564, + 506, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 506, + 577 + ], + "score": 1.0, + "content": "adversarial attacks (Szegedy et al., 2013) or data points from a completely different dataset. The", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 575, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 505, + 586 + ], + "score": 1.0, + "content": "model is expected to be resistant to data corruptions and to be more uncertain on out-of-domain data", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 585, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 506, + 598 + ], + "score": 1.0, + "content": "than on in-domain data. On the contrary, in-domain uncertainty of the model is measured on data", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 597, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 505, + 608 + ], + "score": 1.0, + "content": "taken from the training data distribution, i.e. data from the same domain. In this setting the model is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 607, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 506, + 620 + ], + "score": 1.0, + "content": "expected to produce reliable probability estimates, e.g. the model shouldn’t be too overconfident in", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 619, + 195, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 195, + 631 + ], + "score": 1.0, + "content": "its wrong predictions.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 107, + 635, + 504, + 690 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 505, + 648 + ], + "score": 1.0, + "content": "Pitfalls of metrics We show that many common metrics of in-domain uncertainty estimation", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 646, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 659 + ], + "score": 1.0, + "content": "(e.g. log-likelihood, Brier score, calibration metrics, etc.) are either not comparable across dif-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 658, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 669 + ], + "score": 1.0, + "content": "ferent models or fail to provide a reliable ranking. We address some of the stated pitfalls and", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 668, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 506, + 681 + ], + "score": 1.0, + "content": "point out more reasonable evaluation schemes. For instance, although temperature scaling is not", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 679, + 506, + 692 + ], + "spans": [ + { + "bbox": [ + 104, + 679, + 506, + 692 + ], + "score": 1.0, + "content": "a standard for ensembling techniques, it is a must for a fair evaluation. With this in mind, the", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 118, + 699, + 487, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 698, + 465, + 711 + ], + "spans": [ + { + "bbox": [ + 118, + 698, + 465, + 711 + ], + "score": 1.0, + "content": "∗Equal contribution §HSE refers to National Research University Higher School of Economics", + "type": "text" + } + ] + }, + { + "bbox": [ + 119, + 708, + 355, + 723 + ], + "spans": [ + { + "bbox": [ + 119, + 708, + 355, + 723 + ], + "score": 1.0, + "content": "†Skoltech refers to Skolkovo Institute of Science and Technology", + "type": "text" + } + ] + }, + { + "bbox": [ + 117, + 719, + 487, + 734 + ], + "spans": [ + { + "bbox": [ + 117, + 719, + 487, + 734 + ], + "score": 1.0, + "content": "‡HSE refers to Samsung-HSE Laboratory, National Research University Higher School of Economics", + "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": [ + 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": "PITFALLS OF IN-DOMAIN UNCERTAINTY ESTIMATION", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 99, + 394, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 99, + 394, + 117 + ], + "score": 1.0, + "content": "AND ENSEMBLING IN DEEP LEARNING", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 109, + 135, + 253, + 169 + ], + "lines": [ + { + "bbox": [ + 109, + 135, + 189, + 146 + ], + "spans": [ + { + "bbox": [ + 109, + 135, + 189, + 146 + ], + "score": 1.0, + "content": "Arsenii Ashukha ∗", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 108, + 147, + 253, + 158 + ], + "spans": [ + { + "bbox": [ + 108, + 147, + 253, + 158 + ], + "score": 1.0, + "content": "Samsung AI Center Moscow, HSE‡", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 109, + 158, + 243, + 170 + ], + "spans": [ + { + "bbox": [ + 109, + 158, + 243, + 170 + ], + "score": 1.0, + "content": "aashukha@bayesgroup.ru", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4, + "bbox_fs": [ + 108, + 135, + 253, + 170 + ] + }, + { + "type": "text", + "bbox": [ + 318, + 135, + 501, + 169 + ], + "lines": [ + { + "bbox": [ + 317, + 135, + 405, + 146 + ], + "spans": [ + { + "bbox": [ + 317, + 135, + 405, + 146 + ], + "score": 1.0, + "content": "Alexander Lyzhov ∗", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 317, + 147, + 501, + 158 + ], + "spans": [ + { + "bbox": [ + 317, + 147, + 501, + 158 + ], + "score": 1.0, + "content": "Samsung AI Center Moscow, Skoltech†, HSE§", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 317, + 158, + 446, + 170 + ], + "spans": [ + { + "bbox": [ + 317, + 158, + 446, + 170 + ], + "score": 1.0, + "content": "alyzhov@bayesgroup.ru", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5, + "bbox_fs": [ + 317, + 135, + 501, + 170 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 186, + 253, + 219 + ], + "lines": [ + { + "bbox": [ + 108, + 186, + 199, + 197 + ], + "spans": [ + { + "bbox": [ + 108, + 186, + 199, + 197 + ], + "score": 1.0, + "content": "Dmitry Molchanov ∗", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 109, + 198, + 253, + 209 + ], + "spans": [ + { + "bbox": [ + 109, + 198, + 253, + 209 + ], + "score": 1.0, + "content": "Samsung AI Center Moscow, HSE‡", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 109, + 208, + 231, + 222 + ], + "spans": [ + { + "bbox": [ + 109, + 208, + 231, + 222 + ], + "score": 1.0, + "content": "dmolch@bayesgroup.ru", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10, + "bbox_fs": [ + 108, + 186, + 253, + 222 + ] + }, + { + "type": "text", + "bbox": [ + 320, + 186, + 461, + 219 + ], + "lines": [ + { + "bbox": [ + 319, + 184, + 384, + 198 + ], + "spans": [ + { + "bbox": [ + 319, + 184, + 384, + 198 + ], + "score": 1.0, + "content": "Dmitry Vetrov", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 319, + 196, + 461, + 210 + ], + "spans": [ + { + "bbox": [ + 319, + 196, + 461, + 210 + ], + "score": 1.0, + "content": "HSE‡, Samsung AI Center Moscow", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 320, + 208, + 447, + 221 + ], + "spans": [ + { + "bbox": [ + 320, + 208, + 447, + 221 + ], + "score": 1.0, + "content": "dvetrov@bayesgroup.ru", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11, + "bbox_fs": [ + 319, + 184, + 461, + 221 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 249, + 333, + 261 + ], + "lines": [ + { + "bbox": [ + 276, + 248, + 336, + 263 + ], + "spans": [ + { + "bbox": [ + 276, + 248, + 336, + 263 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 143, + 274, + 468, + 384 + ], + "lines": [ + { + "bbox": [ + 142, + 274, + 469, + 287 + ], + "spans": [ + { + "bbox": [ + 142, + 274, + 469, + 287 + ], + "score": 1.0, + "content": "Uncertainty estimation and ensembling methods go hand-in-hand. Uncertainty", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 285, + 469, + 297 + ], + "spans": [ + { + "bbox": [ + 142, + 285, + 469, + 297 + ], + "score": 1.0, + "content": "estimation is one of the main benchmarks for assessment of ensembling perfor-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 296, + 469, + 308 + ], + "spans": [ + { + "bbox": [ + 141, + 296, + 469, + 308 + ], + "score": 1.0, + "content": "mance. At the same time, deep learning ensembles have provided state-of-the-art", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 307, + 469, + 320 + ], + "spans": [ + { + "bbox": [ + 141, + 307, + 469, + 320 + ], + "score": 1.0, + "content": "results in uncertainty estimation. In this work, we focus on in-domain uncertainty", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 318, + 470, + 330 + ], + "spans": [ + { + "bbox": [ + 141, + 318, + 470, + 330 + ], + "score": 1.0, + "content": "for image classification. We explore the standards for its quantification and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 330, + 470, + 341 + ], + "spans": [ + { + "bbox": [ + 141, + 330, + 470, + 341 + ], + "score": 1.0, + "content": "point out pitfalls of existing metrics. Avoiding these pitfalls, we perform a broad", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 340, + 469, + 352 + ], + "spans": [ + { + "bbox": [ + 141, + 340, + 469, + 352 + ], + "score": 1.0, + "content": "study of different ensembling techniques. To provide more insight in this study,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 351, + 469, + 364 + ], + "spans": [ + { + "bbox": [ + 141, + 351, + 469, + 364 + ], + "score": 1.0, + "content": "we introduce the deep ensemble equivalent score (DEE) and show that many", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 142, + 362, + 469, + 374 + ], + "spans": [ + { + "bbox": [ + 142, + 362, + 469, + 374 + ], + "score": 1.0, + "content": "sophisticated ensembling techniques are equivalent to an ensemble of only few", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 373, + 388, + 385 + ], + "spans": [ + { + "bbox": [ + 141, + 373, + 388, + 385 + ], + "score": 1.0, + "content": "independently trained networks in terms of test performance.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 19.5, + "bbox_fs": [ + 141, + 274, + 470, + 385 + ] + }, + { + "type": "title", + "bbox": [ + 242, + 401, + 379, + 412 + ], + "lines": [ + { + "bbox": [ + 240, + 400, + 381, + 413 + ], + "spans": [ + { + "bbox": [ + 240, + 400, + 381, + 413 + ], + "score": 1.0, + "content": "video / code / blog post", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "title", + "bbox": [ + 108, + 434, + 206, + 446 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 208, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 208, + 450 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 505, + 514 + ], + "lines": [ + { + "bbox": [ + 105, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "Deep neural networks (DNNs) have become one of the most popular families of machine learning", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "score": 1.0, + "content": "models. The predictive performance of DNNs for classification is often measured in terms of accu-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 481, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 506, + 493 + ], + "score": 1.0, + "content": "racy. However, DNNs have been shown to yield inaccurate and unreliable probability estimates, or", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "score": 1.0, + "content": "predictive uncertainty (Guo et al., 2017). This has brought considerable attention to the problem of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 503, + 308, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 308, + 515 + ], + "score": 1.0, + "content": "uncertainty estimation with deep neural networks.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 459, + 506, + 515 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 630 + ], + "lines": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "There are many faces to uncertainty estimation. Different desirable uncertainty estimation properties", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 530, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 505, + 543 + ], + "score": 1.0, + "content": "of a model require different settings and metrics to capture them. Out-of-domain uncertainty of the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 542, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 554 + ], + "score": 1.0, + "content": "model is measured on the data that does not follow the same distribution as the training dataset", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 551, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 506, + 567 + ], + "score": 1.0, + "content": "(out-of-domain data). Out-of-domain data can include images corrupted with rotations or blurring,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 564, + 506, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 506, + 577 + ], + "score": 1.0, + "content": "adversarial attacks (Szegedy et al., 2013) or data points from a completely different dataset. The", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 575, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 505, + 586 + ], + "score": 1.0, + "content": "model is expected to be resistant to data corruptions and to be more uncertain on out-of-domain data", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 585, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 506, + 598 + ], + "score": 1.0, + "content": "than on in-domain data. On the contrary, in-domain uncertainty of the model is measured on data", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 597, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 505, + 608 + ], + "score": 1.0, + "content": "taken from the training data distribution, i.e. data from the same domain. In this setting the model is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 607, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 506, + 620 + ], + "score": 1.0, + "content": "expected to produce reliable probability estimates, e.g. the model shouldn’t be too overconfident in", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 619, + 195, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 195, + 631 + ], + "score": 1.0, + "content": "its wrong predictions.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 519, + 506, + 631 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 635, + 504, + 690 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 505, + 648 + ], + "score": 1.0, + "content": "Pitfalls of metrics We show that many common metrics of in-domain uncertainty estimation", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 646, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 659 + ], + "score": 1.0, + "content": "(e.g. log-likelihood, Brier score, calibration metrics, etc.) are either not comparable across dif-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 658, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 669 + ], + "score": 1.0, + "content": "ferent models or fail to provide a reliable ranking. We address some of the stated pitfalls and", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 668, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 506, + 681 + ], + "score": 1.0, + "content": "point out more reasonable evaluation schemes. For instance, although temperature scaling is not", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 679, + 506, + 692 + ], + "spans": [ + { + "bbox": [ + 104, + 679, + 506, + 692 + ], + "score": 1.0, + "content": "a standard for ensembling techniques, it is a must for a fair evaluation. With this in mind, the", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "calibrated log-likelihood avoids most of the stated pitfalls and generally is a reasonable metric for", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 262, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 262, + 105 + ], + "score": 1.0, + "content": "in-domain uncertainty estimation task.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 44, + "bbox_fs": [ + 104, + 635, + 506, + 692 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "calibrated log-likelihood avoids most of the stated pitfalls and generally is a reasonable metric for", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 262, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 262, + 105 + ], + "score": 1.0, + "content": "in-domain uncertainty estimation task.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 199 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "Pitfalls of ensembles Equipped with the proposed evaluation framework, we are revisiting the eval-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "score": 1.0, + "content": "uation of ensembles of DNNs—one of the major tools for uncertainty estimation. We introduce the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "deep ensemble equivalent (DEE) score that measures the number of independently trained models", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "that, when ensembled, achieve the same performance as the ensembling technique of interest. The", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "score": 1.0, + "content": "DEE score allows us to compare ensembling techniques across different datasets and architectures", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "using a unified scale. Our study shows that most of the popular ensembling techniques require aver-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 177, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 505, + 189 + ], + "score": 1.0, + "content": "aging predictions across dozens of samples (members of an ensemble), yet are essentially equivalent", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 188, + 340, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 340, + 199 + ], + "score": 1.0, + "content": "to an ensemble of only few independently trained models.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 204, + 505, + 248 + ], + "lines": [ + { + "bbox": [ + 106, + 205, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 505, + 216 + ], + "score": 1.0, + "content": "Missing part of ensembling In our study, test-time data augmentation (TTA) turned out to be", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 216, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 505, + 228 + ], + "score": 1.0, + "content": "a surprisingly strong baseline for uncertainty estimation and a simple way to improve ensembles.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 239 + ], + "score": 1.0, + "content": "Despite being a popular technique in large-scale classification, TTA seems to be overlooked in the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 324, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 324, + 250 + ], + "score": 1.0, + "content": "community of uncertainty estimation and ensembling.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + }, + { + "type": "title", + "bbox": [ + 108, + 264, + 235, + 276 + ], + "lines": [ + { + "bbox": [ + 104, + 262, + 237, + 279 + ], + "spans": [ + { + "bbox": [ + 104, + 262, + 237, + 279 + ], + "score": 1.0, + "content": "2 SCOPE OF THE PAPER", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 288, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 106, + 287, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 505, + 302 + ], + "score": 1.0, + "content": "We use standard benchmark problems of image classification which comprise a common setting", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 300, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 505, + 312 + ], + "score": 1.0, + "content": "in research on learning ensembles of neural networks. There are other relevant settings where the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 310, + 506, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 506, + 323 + ], + "score": 1.0, + "content": "correctness of probability estimates can be a priority, and ensembling techniques are used to improve", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 319, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 505, + 335 + ], + "score": 1.0, + "content": "it. These settings include, but are not limited to, regression, language modeling (Gal, 2016), image", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 331, + 506, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 506, + 347 + ], + "score": 1.0, + "content": "segmentation (Gustafsson et al., 2019), active learning (Settles, 2012) and reinforcement learning", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 343, + 276, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 276, + 354 + ], + "score": 1.0, + "content": "(Buckman et al., 2018; Chua et al., 2018).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 360, + 504, + 404 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 506, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 506, + 372 + ], + "score": 1.0, + "content": "We focus on in-domain uncertainty, as opposed to out-of-domain uncertainty. Out-of-domain un-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 371, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 505, + 383 + ], + "score": 1.0, + "content": "certainty includes detection of inputs that come from a completely different domain or have been", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 382, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 506, + 394 + ], + "score": 1.0, + "content": "corrupted by noise or adversarial attacks. This setting has been thoroughly explored by (Ovadia", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 393, + 159, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 159, + 405 + ], + "score": 1.0, + "content": "et al., 2019).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 107, + 410, + 505, + 454 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 505, + 422 + ], + "score": 1.0, + "content": "We only consider methods that are trained on clean data with simple data augmentation. Some other", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "methods use out-of-domain data (Malinin & Gales, 2018) or more elaborate data augmentation,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 432, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 505, + 445 + ], + "score": 1.0, + "content": "e.g. mixup (Zhang et al., 2017) or adversarial training (Lakshminarayanan et al., 2017) to improve", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 444, + 256, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 256, + 456 + ], + "score": 1.0, + "content": "accuracy, robustness and uncertainty.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 460, + 505, + 537 + ], + "lines": [ + { + "bbox": [ + 106, + 460, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 505, + 472 + ], + "score": 1.0, + "content": "We use conventional training procedures. We use the stochastic gradient descent (SGD) and use", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 470, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 505, + 484 + ], + "score": 1.0, + "content": "batch normalization (Ioffe & Szegedy, 2015), both being the de-facto standards in modern deep", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 481, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 505, + 495 + ], + "score": 1.0, + "content": "learning. We refrain from using more elaborate optimization techniques including works on super-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "score": 1.0, + "content": "convergence (Smith & Topin, 2019) and stochastic weight averaging (SWA) (Izmailov et al., 2018).", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 503, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 505, + 516 + ], + "score": 1.0, + "content": "These techniques can be used to drastically accelerate training and to improve the predictive perfor-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 515, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 505, + 527 + ], + "score": 1.0, + "content": "mance. Thus, we do not comment on the training time of different ensembling methods since the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 525, + 503, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 503, + 538 + ], + "score": 1.0, + "content": "use of these and other more efficient training techniques would render such a comparison obsolete.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 542, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 542, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 555 + ], + "score": 1.0, + "content": "A number of related works study ways of approximating and accelerating prediction in ensembles.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 553, + 505, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 505, + 566 + ], + "score": 1.0, + "content": "The distillation mechanism allows to approximate the prediction of an ensemble by a single neural", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 563, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 506, + 578 + ], + "score": 1.0, + "content": "network (Hinton et al., 2015; Balan et al., 2015; Tran et al., 2020), whereas fast dropout (Wang", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 575, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 505, + 588 + ], + "score": 1.0, + "content": "& Manning, 2013) and deterministic variational inference (Wu et al., 2018) allow to approximate", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 586, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 586, + 506, + 599 + ], + "score": 1.0, + "content": "the predictive distribution of specific stochastic computation graphs. We measure the raw power of", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 597, + 323, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 323, + 610 + ], + "score": 1.0, + "content": "ensembling techniques without these approximations.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 108, + 614, + 504, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 505, + 628 + ], + "score": 1.0, + "content": "All of the aforementioned alternative settings are orthogonal to the scope of this paper and are", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 626, + 300, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 300, + 637 + ], + "score": 1.0, + "content": "promising points of interest for further research.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "title", + "bbox": [ + 108, + 653, + 396, + 664 + ], + "lines": [ + { + "bbox": [ + 104, + 651, + 397, + 667 + ], + "spans": [ + { + "bbox": [ + 104, + 651, + 397, + 667 + ], + "score": 1.0, + "content": "3 PITFALLS OF IN-DOMAIN UNCERTAINTY ESTIMATION", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "No single metric measures all the desirable properties of uncertainty estimates obtained by a model", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "of interest. Because of this, the community is using many different metrics in an attempt to cap-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "ture the quality of uncertainty estimation, such as the Brier score (Brier, 1950), log-likelihood", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "(Quinonero-Candela et al., 2005), metrics of calibration (Guo et al., 2017; Nixon et al., 2019), per-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "formance of misclassification detection (Malinin & Gales, 2018), and threshold–accuracy curves", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 47 + } + ], + "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, + 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": [ + 107, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 105 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 199 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "Pitfalls of ensembles Equipped with the proposed evaluation framework, we are revisiting the eval-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "score": 1.0, + "content": "uation of ensembles of DNNs—one of the major tools for uncertainty estimation. We introduce the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "deep ensemble equivalent (DEE) score that measures the number of independently trained models", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "that, when ensembled, achieve the same performance as the ensembling technique of interest. The", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "score": 1.0, + "content": "DEE score allows us to compare ensembling techniques across different datasets and architectures", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "using a unified scale. Our study shows that most of the popular ensembling techniques require aver-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 177, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 505, + 189 + ], + "score": 1.0, + "content": "aging predictions across dozens of samples (members of an ensemble), yet are essentially equivalent", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 188, + 340, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 340, + 199 + ], + "score": 1.0, + "content": "to an ensemble of only few independently trained models.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 111, + 506, + 199 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 204, + 505, + 248 + ], + "lines": [ + { + "bbox": [ + 106, + 205, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 505, + 216 + ], + "score": 1.0, + "content": "Missing part of ensembling In our study, test-time data augmentation (TTA) turned out to be", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 216, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 505, + 228 + ], + "score": 1.0, + "content": "a surprisingly strong baseline for uncertainty estimation and a simple way to improve ensembles.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 239 + ], + "score": 1.0, + "content": "Despite being a popular technique in large-scale classification, TTA seems to be overlooked in the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 324, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 324, + 250 + ], + "score": 1.0, + "content": "community of uncertainty estimation and ensembling.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 205, + 505, + 250 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 264, + 235, + 276 + ], + "lines": [ + { + "bbox": [ + 104, + 262, + 237, + 279 + ], + "spans": [ + { + "bbox": [ + 104, + 262, + 237, + 279 + ], + "score": 1.0, + "content": "2 SCOPE OF THE PAPER", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 288, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 106, + 287, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 505, + 302 + ], + "score": 1.0, + "content": "We use standard benchmark problems of image classification which comprise a common setting", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 300, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 505, + 312 + ], + "score": 1.0, + "content": "in research on learning ensembles of neural networks. There are other relevant settings where the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 310, + 506, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 506, + 323 + ], + "score": 1.0, + "content": "correctness of probability estimates can be a priority, and ensembling techniques are used to improve", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 319, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 505, + 335 + ], + "score": 1.0, + "content": "it. These settings include, but are not limited to, regression, language modeling (Gal, 2016), image", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 331, + 506, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 506, + 347 + ], + "score": 1.0, + "content": "segmentation (Gustafsson et al., 2019), active learning (Settles, 2012) and reinforcement learning", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 343, + 276, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 276, + 354 + ], + "score": 1.0, + "content": "(Buckman et al., 2018; Chua et al., 2018).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 287, + 506, + 354 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 360, + 504, + 404 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 506, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 506, + 372 + ], + "score": 1.0, + "content": "We focus on in-domain uncertainty, as opposed to out-of-domain uncertainty. Out-of-domain un-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 371, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 505, + 383 + ], + "score": 1.0, + "content": "certainty includes detection of inputs that come from a completely different domain or have been", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 382, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 506, + 394 + ], + "score": 1.0, + "content": "corrupted by noise or adversarial attacks. This setting has been thoroughly explored by (Ovadia", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 393, + 159, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 159, + 405 + ], + "score": 1.0, + "content": "et al., 2019).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 360, + 506, + 405 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 410, + 505, + 454 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 505, + 422 + ], + "score": 1.0, + "content": "We only consider methods that are trained on clean data with simple data augmentation. Some other", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "methods use out-of-domain data (Malinin & Gales, 2018) or more elaborate data augmentation,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 432, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 505, + 445 + ], + "score": 1.0, + "content": "e.g. mixup (Zhang et al., 2017) or adversarial training (Lakshminarayanan et al., 2017) to improve", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 444, + 256, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 256, + 456 + ], + "score": 1.0, + "content": "accuracy, robustness and uncertainty.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 410, + 505, + 456 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 460, + 505, + 537 + ], + "lines": [ + { + "bbox": [ + 106, + 460, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 505, + 472 + ], + "score": 1.0, + "content": "We use conventional training procedures. We use the stochastic gradient descent (SGD) and use", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 470, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 505, + 484 + ], + "score": 1.0, + "content": "batch normalization (Ioffe & Szegedy, 2015), both being the de-facto standards in modern deep", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 481, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 505, + 495 + ], + "score": 1.0, + "content": "learning. We refrain from using more elaborate optimization techniques including works on super-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "score": 1.0, + "content": "convergence (Smith & Topin, 2019) and stochastic weight averaging (SWA) (Izmailov et al., 2018).", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 503, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 505, + 516 + ], + "score": 1.0, + "content": "These techniques can be used to drastically accelerate training and to improve the predictive perfor-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 515, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 505, + 527 + ], + "score": 1.0, + "content": "mance. Thus, we do not comment on the training time of different ensembling methods since the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 525, + 503, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 503, + 538 + ], + "score": 1.0, + "content": "use of these and other more efficient training techniques would render such a comparison obsolete.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 460, + 505, + 538 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 542, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 542, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 505, + 555 + ], + "score": 1.0, + "content": "A number of related works study ways of approximating and accelerating prediction in ensembles.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 553, + 505, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 505, + 566 + ], + "score": 1.0, + "content": "The distillation mechanism allows to approximate the prediction of an ensemble by a single neural", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 563, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 506, + 578 + ], + "score": 1.0, + "content": "network (Hinton et al., 2015; Balan et al., 2015; Tran et al., 2020), whereas fast dropout (Wang", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 575, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 505, + 588 + ], + "score": 1.0, + "content": "& Manning, 2013) and deterministic variational inference (Wu et al., 2018) allow to approximate", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 586, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 586, + 506, + 599 + ], + "score": 1.0, + "content": "the predictive distribution of specific stochastic computation graphs. We measure the raw power of", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 597, + 323, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 323, + 610 + ], + "score": 1.0, + "content": "ensembling techniques without these approximations.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 542, + 506, + 610 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 614, + 504, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 505, + 628 + ], + "score": 1.0, + "content": "All of the aforementioned alternative settings are orthogonal to the scope of this paper and are", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 626, + 300, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 300, + 637 + ], + "score": 1.0, + "content": "promising points of interest for further research.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 612, + 505, + 637 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 653, + 396, + 664 + ], + "lines": [ + { + "bbox": [ + 104, + 651, + 397, + 667 + ], + "spans": [ + { + "bbox": [ + 104, + 651, + 397, + 667 + ], + "score": 1.0, + "content": "3 PITFALLS OF IN-DOMAIN UNCERTAINTY ESTIMATION", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "No single metric measures all the desirable properties of uncertainty estimates obtained by a model", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "of interest. Because of this, the community is using many different metrics in an attempt to cap-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "ture the quality of uncertainty estimation, such as the Brier score (Brier, 1950), log-likelihood", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "(Quinonero-Candela et al., 2005), metrics of calibration (Guo et al., 2017; Nixon et al., 2019), per-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "formance of misclassification detection (Malinin & Gales, 2018), and threshold–accuracy curves", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "score": 1.0, + "content": "(Lakshminarayanan et al., 2017). In the section we highlight the pitfalls of the aforementioned met-", + "type": "text", + "cross_page": true + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 368, + 505, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 380 + ], + "score": 1.0, + "content": "rics, and demonstrate that these pitfalls can significantly affect evaluation, changing the ranking of", + "type": "text", + "cross_page": true + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 379, + 160, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 160, + 390 + ], + "score": 1.0, + "content": "the methods.", + "type": "text", + "cross_page": true + } + ], + "index": 38 + } + ], + "index": 47, + "bbox_fs": [ + 105, + 676, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 88, + 299, + 214 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 88, + 299, + 214 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 88, + 299, + 214 + ], + "spans": [ + { + "bbox": [ + 108, + 88, + 299, + 214 + ], + "score": 0.966, + "type": "image", + "image_path": "d97acaa163ca38357212bbd72f60d4fc445d6e7aa0be224c9c8cf4a1312e3276.jpg" + } + ] + } + ], + "index": 4.5, + "virtual_lines": [ + { + "bbox": [ + 108, + 88, + 299, + 100.6 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 100.6, + 299, + 113.19999999999999 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 113.19999999999999, + 299, + 125.79999999999998 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 108, + 125.79999999999998, + 299, + 138.39999999999998 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 108, + 138.39999999999998, + 299, + 150.99999999999997 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 108, + 150.99999999999997, + 299, + 163.59999999999997 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 108, + 163.59999999999997, + 299, + 176.19999999999996 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 108, + 176.19999999999996, + 299, + 188.79999999999995 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 108, + 188.79999999999995, + 299, + 201.39999999999995 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 108, + 201.39999999999995, + 299, + 213.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 224, + 302, + 323 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 224, + 303, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 303, + 236 + ], + "score": 1.0, + "content": "Figure 1: The average log-likelihood of two", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 235, + 303, + 247 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 303, + 247 + ], + "score": 1.0, + "content": "different ensembling techniques for ResNet50", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 246, + 303, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 303, + 258 + ], + "score": 1.0, + "content": "on ImageNet dataset before (solid) and after", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 257, + 303, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 303, + 269 + ], + "score": 1.0, + "content": "(dashed) temperature scaling. Without the tem-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 268, + 303, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 303, + 280 + ], + "score": 1.0, + "content": "perature scaling, test-time data augmentation de-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 279, + 303, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 303, + 291 + ], + "score": 1.0, + "content": "creases the log-likelihood of plain deep ensem-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 289, + 303, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 303, + 302 + ], + "score": 1.0, + "content": "bles. However, when the temperature scaling is", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 299, + 303, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 303, + 314 + ], + "score": 1.0, + "content": "enabled, deep ensembles with test-time data aug-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 312, + 287, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 312, + 287, + 324 + ], + "score": 1.0, + "content": "mentation outperform plain deep ensembles.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24 + } + ], + "index": 14.25 + }, + { + "type": "image", + "bbox": [ + 308, + 85, + 491, + 212 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 308, + 85, + 491, + 212 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 308, + 85, + 491, + 212 + ], + "spans": [ + { + "bbox": [ + 308, + 85, + 491, + 212 + ], + "score": 0.965, + "type": "image", + "image_path": "0c9b556ad42fcfa9d83f9f988497812e9a476b418a72ba3fcc791159192d282e.jpg" + } + ] + } + ], + "index": 14.5, + "virtual_lines": [ + { + "bbox": [ + 308, + 85, + 491, + 97.7 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 308, + 97.7, + 491, + 110.4 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 308, + 110.4, + 491, + 123.10000000000001 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 308, + 123.10000000000001, + 491, + 135.8 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 308, + 135.8, + 491, + 148.5 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 308, + 148.5, + 491, + 161.2 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 308, + 161.2, + 491, + 173.89999999999998 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 308, + 173.89999999999998, + 491, + 186.59999999999997 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 308, + 186.59999999999997, + 491, + 199.29999999999995 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 308, + 199.29999999999995, + 491, + 211.99999999999994 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 308, + 225, + 505, + 302 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 308, + 225, + 506, + 237 + ], + "spans": [ + { + "bbox": [ + 308, + 225, + 506, + 237 + ], + "score": 1.0, + "content": "Figure 2: Thresholded adaptive calibration error", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 308, + 236, + 505, + 247 + ], + "spans": [ + { + "bbox": [ + 308, + 236, + 505, + 247 + ], + "score": 1.0, + "content": "(TACE) is highly sensitive to the threshold and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 307, + 246, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 307, + 246, + 505, + 258 + ], + "score": 1.0, + "content": "the number of bins. It does not provide a consis-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 307, + 257, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 307, + 257, + 505, + 270 + ], + "score": 1.0, + "content": "tent ranking of different ensembling techniques.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 307, + 268, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 307, + 268, + 505, + 280 + ], + "score": 1.0, + "content": "Here TACE is reported for VGG16BN model on", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 307, + 279, + 505, + 292 + ], + "spans": [ + { + "bbox": [ + 307, + 279, + 505, + 292 + ], + "score": 1.0, + "content": "CIFAR-100 dataset and is evaluated at the opti-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 308, + 291, + 378, + 303 + ], + "spans": [ + { + "bbox": [ + 308, + 291, + 378, + 303 + ], + "score": 1.0, + "content": "mal temperature.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32 + } + ], + "index": 23.25 + }, + { + "type": "text", + "bbox": [ + 107, + 356, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "score": 1.0, + "content": "(Lakshminarayanan et al., 2017). In the section we highlight the pitfalls of the aforementioned met-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 368, + 505, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 380 + ], + "score": 1.0, + "content": "rics, and demonstrate that these pitfalls can significantly affect evaluation, changing the ranking of", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 379, + 160, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 160, + 390 + ], + "score": 1.0, + "content": "the methods.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 106, + 405, + 505, + 495 + ], + "lines": [ + { + "bbox": [ + 106, + 406, + 504, + 418 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 432, + 418 + ], + "score": 1.0, + "content": "Notation We consider a classification problem with a dataset that consists of", + "type": "text" + }, + { + "bbox": [ + 432, + 407, + 442, + 416 + ], + "score": 0.83, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 406, + 496, + 418 + ], + "score": 1.0, + "content": "training and", + "type": "text" + }, + { + "bbox": [ + 497, + 408, + 504, + 416 + ], + "score": 0.71, + "content": "n", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 158, + 430 + ], + "score": 1.0, + "content": "testing pairs", + "type": "text" + }, + { + "bbox": [ + 158, + 417, + 231, + 429 + ], + "score": 0.92, + "content": "( x _ { i } , y _ { i } ^ { * } ) \\sim p ( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 416, + 262, + 430 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 262, + 418, + 272, + 428 + ], + "score": 0.85, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 416, + 339, + 430 + ], + "score": 1.0, + "content": "is an object and", + "type": "text" + }, + { + "bbox": [ + 339, + 417, + 407, + 429 + ], + "score": 0.93, + "content": "y _ { i } ^ { * } \\in \\{ 1 , \\ldots , C \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 416, + 505, + 430 + ], + "score": 1.0, + "content": "is a discrete class label.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 427, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 273, + 441 + ], + "score": 1.0, + "content": "A probabilistic classifier maps an object", + "type": "text" + }, + { + "bbox": [ + 273, + 429, + 283, + 439 + ], + "score": 0.87, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 427, + 403, + 441 + ], + "score": 1.0, + "content": "into a predictive distribution", + "type": "text" + }, + { + "bbox": [ + 403, + 428, + 437, + 440 + ], + "score": 0.95, + "content": "{ \\dot { p } } ( y \\mid x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 427, + 505, + 441 + ], + "score": 1.0, + "content": ". The predictive", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 438, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 154, + 452 + ], + "score": 1.0, + "content": "distribution", + "type": "text" + }, + { + "bbox": [ + 155, + 439, + 189, + 451 + ], + "score": 0.92, + "content": "{ \\hat { p } } ( y \\mid x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 438, + 462, + 452 + ], + "score": 1.0, + "content": "of a deep neural network is typically defined by the softmax function", + "type": "text" + }, + { + "bbox": [ + 462, + 439, + 505, + 451 + ], + "score": 0.92, + "content": "{ \\hat { p } } ( y \\mid x ) =", + "type": "inline_equation" + } + ], + "index": 42 + }, + { + "bbox": [ + 107, + 448, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 107, + 450, + 182, + 462 + ], + "score": 0.6, + "content": "\\mathrm { S o f t m a x } ( z ( x ) / T )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 448, + 214, + 462 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 215, + 450, + 235, + 461 + ], + "score": 0.91, + "content": "z ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 448, + 339, + 462 + ], + "score": 1.0, + "content": "is a vector of logits and", + "type": "text" + }, + { + "bbox": [ + 339, + 450, + 348, + 460 + ], + "score": 0.79, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 448, + 505, + 462 + ], + "score": 1.0, + "content": "is a scalar parameter standing for the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 461, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 431, + 473 + ], + "score": 1.0, + "content": "temperature of the predictive distribution. This scalar parameter is usually set to", + "type": "text" + }, + { + "bbox": [ + 431, + 461, + 459, + 471 + ], + "score": 0.9, + "content": "T = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 461, + 505, + 473 + ], + "score": 1.0, + "content": "or is tuned", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 471, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 373, + 485 + ], + "score": 1.0, + "content": "on a validation set (Guo et al., 2017). The maximum probability", + "type": "text" + }, + { + "bbox": [ + 373, + 471, + 452, + 484 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { c } \\dot { \\hat { p } } ( y = c | x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 471, + 506, + 485 + ], + "score": 1.0, + "content": "is called the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 483, + 498, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 207, + 495 + ], + "score": 1.0, + "content": "confidence of a classifier", + "type": "text" + }, + { + "bbox": [ + 208, + 483, + 214, + 494 + ], + "score": 0.85, + "content": "\\hat { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 483, + 266, + 495 + ], + "score": 1.0, + "content": "on an object", + "type": "text" + }, + { + "bbox": [ + 266, + 484, + 277, + 494 + ], + "score": 0.73, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 483, + 280, + 495 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 281, + 483, + 294, + 495 + ], + "score": 0.31, + "content": "\\mathbb { I } [ \\cdot ]", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 483, + 498, + 495 + ], + "score": 1.0, + "content": "denotes the indicator function throughout the text.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 42.5 + }, + { + "type": "title", + "bbox": [ + 108, + 511, + 290, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 511, + 291, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 291, + 523 + ], + "score": 1.0, + "content": "3.1 LOG-LIKELIHOOD AND BRIER SCORE", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 505, + 566 + ], + "lines": [ + { + "bbox": [ + 102, + 528, + 508, + 550 + ], + "spans": [ + { + "bbox": [ + 102, + 528, + 233, + 550 + ], + "score": 1.0, + "content": "The average test log-likelihood", + "type": "text" + }, + { + "bbox": [ + 234, + 532, + 367, + 546 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathbf { L } \\mathbf { L } = \\frac { 1 } { n } \\sum _ { i = 1 } ^ { n } \\log \\hat { p } ( y = y _ { i } ^ { * } \\mid x _ { i } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 528, + 508, + 550 + ], + "score": 1.0, + "content": "is a popular metric for measuring", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 544, + 504, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 544, + 504, + 556 + ], + "score": 1.0, + "content": "the quality of in-domain uncertainty of deep learning models. It directly penalizes high probability", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 555, + 485, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 470, + 568 + ], + "score": 1.0, + "content": "scores assigned to incorrect labels and low probability scores assigned to the correct labels", + "type": "text" + }, + { + "bbox": [ + 470, + 556, + 480, + 567 + ], + "score": 0.88, + "content": "y _ { i } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 555, + 485, + 568 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 49 + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 285, + 584 + ], + "score": 1.0, + "content": "LL is sensitive to the softmax temperature", + "type": "text" + }, + { + "bbox": [ + 285, + 573, + 294, + 582 + ], + "score": 0.76, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 572, + 505, + 584 + ], + "score": 1.0, + "content": ". The temperature that has been implicitly learned", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "during training can be far from optimal for the test data. However, a nearly optimal temperature", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "can be found post-hoc by maximizing the log-likelihood on validation data. This approach is called", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 604, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 619 + ], + "score": 1.0, + "content": "temperature scaling or calibration (Guo et al., 2017). Despite its simplicity, the temperature scaling", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 105, + 615, + 281, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 281, + 630 + ], + "score": 1.0, + "content": "results in a notable improvement in the LL.", + "type": "text" + } + ], + "index": 55 + } + ], + "index": 53 + }, + { + "type": "text", + "bbox": [ + 107, + 633, + 505, + 666 + ], + "lines": [ + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "score": 1.0, + "content": "While ensembling techniques tend to have better temperature than single models, the default choice", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 118, + 656 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 644, + 148, + 654 + ], + "score": 0.9, + "content": "T = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "is still suboptimal. Comparing the LL with suboptimal temperatures—that is often the", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 105, + 655, + 442, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 442, + 668 + ], + "score": 1.0, + "content": "case in practice—can potentially produce an arbitrary ranking of different methods.", + "type": "text" + } + ], + "index": 58 + } + ], + "index": 57 + }, + { + "type": "text", + "bbox": [ + 130, + 680, + 479, + 692 + ], + "lines": [ + { + "bbox": [ + 128, + 679, + 480, + 694 + ], + "spans": [ + { + "bbox": [ + 128, + 679, + 480, + 694 + ], + "score": 1.0, + "content": "Comparison of the log-likelihood should only be performed at the optimal temperature.", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 59 + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "Empirically, we demonstrate that the overall ordering of methods and also the best ensembling", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 376, + 733 + ], + "score": 1.0, + "content": "method according to the LL can vary depending on temperature", + "type": "text" + }, + { + "bbox": [ + 376, + 721, + 385, + 730 + ], + "score": 0.78, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 721, + 505, + 733 + ], + "score": 1.0, + "content": ". While this applies to most", + "type": "text" + } + ], + "index": 61 + } + ], + "index": 60.5 + } + ], + "page_idx": 2, + "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 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": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 88, + 299, + 214 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 88, + 299, + 214 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 88, + 299, + 214 + ], + "spans": [ + { + "bbox": [ + 108, + 88, + 299, + 214 + ], + "score": 0.966, + "type": "image", + "image_path": "d97acaa163ca38357212bbd72f60d4fc445d6e7aa0be224c9c8cf4a1312e3276.jpg" + } + ] + } + ], + "index": 4.5, + "virtual_lines": [ + { + "bbox": [ + 108, + 88, + 299, + 100.6 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 100.6, + 299, + 113.19999999999999 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 113.19999999999999, + 299, + 125.79999999999998 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 108, + 125.79999999999998, + 299, + 138.39999999999998 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 108, + 138.39999999999998, + 299, + 150.99999999999997 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 108, + 150.99999999999997, + 299, + 163.59999999999997 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 108, + 163.59999999999997, + 299, + 176.19999999999996 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 108, + 176.19999999999996, + 299, + 188.79999999999995 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 108, + 188.79999999999995, + 299, + 201.39999999999995 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 108, + 201.39999999999995, + 299, + 213.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 224, + 302, + 323 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 224, + 303, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 303, + 236 + ], + "score": 1.0, + "content": "Figure 1: The average log-likelihood of two", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 235, + 303, + 247 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 303, + 247 + ], + "score": 1.0, + "content": "different ensembling techniques for ResNet50", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 246, + 303, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 303, + 258 + ], + "score": 1.0, + "content": "on ImageNet dataset before (solid) and after", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 257, + 303, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 303, + 269 + ], + "score": 1.0, + "content": "(dashed) temperature scaling. Without the tem-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 268, + 303, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 303, + 280 + ], + "score": 1.0, + "content": "perature scaling, test-time data augmentation de-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 279, + 303, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 303, + 291 + ], + "score": 1.0, + "content": "creases the log-likelihood of plain deep ensem-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 289, + 303, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 303, + 302 + ], + "score": 1.0, + "content": "bles. However, when the temperature scaling is", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 299, + 303, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 303, + 314 + ], + "score": 1.0, + "content": "enabled, deep ensembles with test-time data aug-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 312, + 287, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 312, + 287, + 324 + ], + "score": 1.0, + "content": "mentation outperform plain deep ensembles.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24 + } + ], + "index": 14.25 + }, + { + "type": "image", + "bbox": [ + 308, + 85, + 491, + 212 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 308, + 85, + 491, + 212 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 308, + 85, + 491, + 212 + ], + "spans": [ + { + "bbox": [ + 308, + 85, + 491, + 212 + ], + "score": 0.965, + "type": "image", + "image_path": "0c9b556ad42fcfa9d83f9f988497812e9a476b418a72ba3fcc791159192d282e.jpg" + } + ] + } + ], + "index": 14.5, + "virtual_lines": [ + { + "bbox": [ + 308, + 85, + 491, + 97.7 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 308, + 97.7, + 491, + 110.4 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 308, + 110.4, + 491, + 123.10000000000001 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 308, + 123.10000000000001, + 491, + 135.8 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 308, + 135.8, + 491, + 148.5 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 308, + 148.5, + 491, + 161.2 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 308, + 161.2, + 491, + 173.89999999999998 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 308, + 173.89999999999998, + 491, + 186.59999999999997 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 308, + 186.59999999999997, + 491, + 199.29999999999995 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 308, + 199.29999999999995, + 491, + 211.99999999999994 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 308, + 225, + 505, + 302 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 308, + 225, + 506, + 237 + ], + "spans": [ + { + "bbox": [ + 308, + 225, + 506, + 237 + ], + "score": 1.0, + "content": "Figure 2: Thresholded adaptive calibration error", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 308, + 236, + 505, + 247 + ], + "spans": [ + { + "bbox": [ + 308, + 236, + 505, + 247 + ], + "score": 1.0, + "content": "(TACE) is highly sensitive to the threshold and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 307, + 246, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 307, + 246, + 505, + 258 + ], + "score": 1.0, + "content": "the number of bins. It does not provide a consis-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 307, + 257, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 307, + 257, + 505, + 270 + ], + "score": 1.0, + "content": "tent ranking of different ensembling techniques.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 307, + 268, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 307, + 268, + 505, + 280 + ], + "score": 1.0, + "content": "Here TACE is reported for VGG16BN model on", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 307, + 279, + 505, + 292 + ], + "spans": [ + { + "bbox": [ + 307, + 279, + 505, + 292 + ], + "score": 1.0, + "content": "CIFAR-100 dataset and is evaluated at the opti-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 308, + 291, + 378, + 303 + ], + "spans": [ + { + "bbox": [ + 308, + 291, + 378, + 303 + ], + "score": 1.0, + "content": "mal temperature.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32 + } + ], + "index": 23.25 + }, + { + "type": "text", + "bbox": [ + 107, + 356, + 505, + 390 + ], + "lines": [], + "index": 37, + "bbox_fs": [ + 105, + 356, + 505, + 390 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 405, + 505, + 495 + ], + "lines": [ + { + "bbox": [ + 106, + 406, + 504, + 418 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 432, + 418 + ], + "score": 1.0, + "content": "Notation We consider a classification problem with a dataset that consists of", + "type": "text" + }, + { + "bbox": [ + 432, + 407, + 442, + 416 + ], + "score": 0.83, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 406, + 496, + 418 + ], + "score": 1.0, + "content": "training and", + "type": "text" + }, + { + "bbox": [ + 497, + 408, + 504, + 416 + ], + "score": 0.71, + "content": "n", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 158, + 430 + ], + "score": 1.0, + "content": "testing pairs", + "type": "text" + }, + { + "bbox": [ + 158, + 417, + 231, + 429 + ], + "score": 0.92, + "content": "( x _ { i } , y _ { i } ^ { * } ) \\sim p ( x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 416, + 262, + 430 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 262, + 418, + 272, + 428 + ], + "score": 0.85, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 416, + 339, + 430 + ], + "score": 1.0, + "content": "is an object and", + "type": "text" + }, + { + "bbox": [ + 339, + 417, + 407, + 429 + ], + "score": 0.93, + "content": "y _ { i } ^ { * } \\in \\{ 1 , \\ldots , C \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 416, + 505, + 430 + ], + "score": 1.0, + "content": "is a discrete class label.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 427, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 273, + 441 + ], + "score": 1.0, + "content": "A probabilistic classifier maps an object", + "type": "text" + }, + { + "bbox": [ + 273, + 429, + 283, + 439 + ], + "score": 0.87, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 427, + 403, + 441 + ], + "score": 1.0, + "content": "into a predictive distribution", + "type": "text" + }, + { + "bbox": [ + 403, + 428, + 437, + 440 + ], + "score": 0.95, + "content": "{ \\dot { p } } ( y \\mid x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 427, + 505, + 441 + ], + "score": 1.0, + "content": ". The predictive", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 438, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 154, + 452 + ], + "score": 1.0, + "content": "distribution", + "type": "text" + }, + { + "bbox": [ + 155, + 439, + 189, + 451 + ], + "score": 0.92, + "content": "{ \\hat { p } } ( y \\mid x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 438, + 462, + 452 + ], + "score": 1.0, + "content": "of a deep neural network is typically defined by the softmax function", + "type": "text" + }, + { + "bbox": [ + 462, + 439, + 505, + 451 + ], + "score": 0.92, + "content": "{ \\hat { p } } ( y \\mid x ) =", + "type": "inline_equation" + } + ], + "index": 42 + }, + { + "bbox": [ + 107, + 448, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 107, + 450, + 182, + 462 + ], + "score": 0.6, + "content": "\\mathrm { S o f t m a x } ( z ( x ) / T )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 448, + 214, + 462 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 215, + 450, + 235, + 461 + ], + "score": 0.91, + "content": "z ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 448, + 339, + 462 + ], + "score": 1.0, + "content": "is a vector of logits and", + "type": "text" + }, + { + "bbox": [ + 339, + 450, + 348, + 460 + ], + "score": 0.79, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 448, + 505, + 462 + ], + "score": 1.0, + "content": "is a scalar parameter standing for the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 461, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 431, + 473 + ], + "score": 1.0, + "content": "temperature of the predictive distribution. This scalar parameter is usually set to", + "type": "text" + }, + { + "bbox": [ + 431, + 461, + 459, + 471 + ], + "score": 0.9, + "content": "T = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 461, + 505, + 473 + ], + "score": 1.0, + "content": "or is tuned", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 471, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 373, + 485 + ], + "score": 1.0, + "content": "on a validation set (Guo et al., 2017). The maximum probability", + "type": "text" + }, + { + "bbox": [ + 373, + 471, + 452, + 484 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { c } \\dot { \\hat { p } } ( y = c | x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 471, + 506, + 485 + ], + "score": 1.0, + "content": "is called the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 483, + 498, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 207, + 495 + ], + "score": 1.0, + "content": "confidence of a classifier", + "type": "text" + }, + { + "bbox": [ + 208, + 483, + 214, + 494 + ], + "score": 0.85, + "content": "\\hat { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 483, + 266, + 495 + ], + "score": 1.0, + "content": "on an object", + "type": "text" + }, + { + "bbox": [ + 266, + 484, + 277, + 494 + ], + "score": 0.73, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 483, + 280, + 495 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 281, + 483, + 294, + 495 + ], + "score": 0.31, + "content": "\\mathbb { I } [ \\cdot ]", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 483, + 498, + 495 + ], + "score": 1.0, + "content": "denotes the indicator function throughout the text.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 406, + 506, + 495 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 511, + 290, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 511, + 291, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 291, + 523 + ], + "score": 1.0, + "content": "3.1 LOG-LIKELIHOOD AND BRIER SCORE", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 505, + 566 + ], + "lines": [ + { + "bbox": [ + 102, + 528, + 508, + 550 + ], + "spans": [ + { + "bbox": [ + 102, + 528, + 233, + 550 + ], + "score": 1.0, + "content": "The average test log-likelihood", + "type": "text" + }, + { + "bbox": [ + 234, + 532, + 367, + 546 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathbf { L } \\mathbf { L } = \\frac { 1 } { n } \\sum _ { i = 1 } ^ { n } \\log \\hat { p } ( y = y _ { i } ^ { * } \\mid x _ { i } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 528, + 508, + 550 + ], + "score": 1.0, + "content": "is a popular metric for measuring", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 544, + 504, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 544, + 504, + 556 + ], + "score": 1.0, + "content": "the quality of in-domain uncertainty of deep learning models. It directly penalizes high probability", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 555, + 485, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 470, + 568 + ], + "score": 1.0, + "content": "scores assigned to incorrect labels and low probability scores assigned to the correct labels", + "type": "text" + }, + { + "bbox": [ + 470, + 556, + 480, + 567 + ], + "score": 0.88, + "content": "y _ { i } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 555, + 485, + 568 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 49, + "bbox_fs": [ + 102, + 528, + 508, + 568 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 285, + 584 + ], + "score": 1.0, + "content": "LL is sensitive to the softmax temperature", + "type": "text" + }, + { + "bbox": [ + 285, + 573, + 294, + 582 + ], + "score": 0.76, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 572, + 505, + 584 + ], + "score": 1.0, + "content": ". The temperature that has been implicitly learned", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "during training can be far from optimal for the test data. However, a nearly optimal temperature", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "can be found post-hoc by maximizing the log-likelihood on validation data. This approach is called", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 604, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 619 + ], + "score": 1.0, + "content": "temperature scaling or calibration (Guo et al., 2017). Despite its simplicity, the temperature scaling", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 105, + 615, + 281, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 281, + 630 + ], + "score": 1.0, + "content": "results in a notable improvement in the LL.", + "type": "text" + } + ], + "index": 55 + } + ], + "index": 53, + "bbox_fs": [ + 105, + 572, + 505, + 630 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 633, + 505, + 666 + ], + "lines": [ + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "score": 1.0, + "content": "While ensembling techniques tend to have better temperature than single models, the default choice", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 118, + 656 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 644, + 148, + 654 + ], + "score": 0.9, + "content": "T = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "is still suboptimal. Comparing the LL with suboptimal temperatures—that is often the", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 105, + 655, + 442, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 442, + 668 + ], + "score": 1.0, + "content": "case in practice—can potentially produce an arbitrary ranking of different methods.", + "type": "text" + } + ], + "index": 58 + } + ], + "index": 57, + "bbox_fs": [ + 105, + 632, + 505, + 668 + ] + }, + { + "type": "text", + "bbox": [ + 130, + 680, + 479, + 692 + ], + "lines": [ + { + "bbox": [ + 128, + 679, + 480, + 694 + ], + "spans": [ + { + "bbox": [ + 128, + 679, + 480, + 694 + ], + "score": 1.0, + "content": "Comparison of the log-likelihood should only be performed at the optimal temperature.", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 59, + "bbox_fs": [ + 128, + 679, + 480, + 694 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "Empirically, we demonstrate that the overall ordering of methods and also the best ensembling", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 376, + 733 + ], + "score": 1.0, + "content": "method according to the LL can vary depending on temperature", + "type": "text" + }, + { + "bbox": [ + 376, + 721, + 385, + 730 + ], + "score": 0.78, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 721, + 505, + 733 + ], + "score": 1.0, + "content": ". While this applies to most", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "score": 1.0, + "content": "ensembling techniques (see Figure 10), this effect is most noticeable on experiments with data aug-", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 248, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 248, + 106 + ], + "score": 1.0, + "content": "mentation on ImageNet (Figure 1).", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 60.5, + "bbox_fs": [ + 106, + 708, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 503, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "score": 1.0, + "content": "ensembling techniques (see Figure 10), this effect is most noticeable on experiments with data aug-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 248, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 248, + 106 + ], + "score": 1.0, + "content": "mentation on ImageNet (Figure 1).", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 123, + 119, + 491, + 142 + ], + "lines": [ + { + "bbox": [ + 121, + 117, + 492, + 133 + ], + "spans": [ + { + "bbox": [ + 121, + 117, + 492, + 133 + ], + "score": 1.0, + "content": "We introduce a new metric called the calibrated log-likelihood that is the log-likelihood at", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 254, + 128, + 356, + 144 + ], + "spans": [ + { + "bbox": [ + 254, + 128, + 356, + 144 + ], + "score": 1.0, + "content": "the optimal temperature.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 159, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 160, + 504, + 172 + ], + "spans": [ + { + "bbox": [ + 106, + 160, + 504, + 172 + ], + "score": 1.0, + "content": "The calibrated log-likelihood considers a model and a post-training calibration as a unified system,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "targeting to measure all models in the equal conditions of optimal temperature. That allows to avoid", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "measuring calibration error that can be eliminated by a simple temperature scaling. The metric", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "score": 1.0, + "content": "significantly affects the results of the comparison. For example, in Figure 10 the differences between", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 203, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 505, + 216 + ], + "score": 1.0, + "content": "Bayesian (VI, K-FAC, SWAG, dropout) and conventional non-Bayesian networks become much less", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 214, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 506, + 227 + ], + "score": 1.0, + "content": "pronounced, and in most cases making conventional non-Bayesian networks match the performance", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 225, + 452, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 452, + 238 + ], + "score": 1.0, + "content": "of Bayesian ones (VI, K-FAC, Dropout) on ResNet110, ResNet164, and WideResNet.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 504, + 264 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "score": 1.0, + "content": "We show how to obtain an unbiased estimate of the calibrated log-likelihood without a held-out", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 253, + 222, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 222, + 264 + ], + "score": 1.0, + "content": "validation set in Section 3.5.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 270, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 329, + 283 + ], + "score": 1.0, + "content": "LL also demonstrates a high correlation with accuracy", + "type": "text" + }, + { + "bbox": [ + 329, + 271, + 370, + 282 + ], + "score": 0.86, + "content": "( \\rho > 0 . 8 6 )", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 270, + 505, + 283 + ], + "score": 1.0, + "content": ", that in case of calibrated LL be-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 193, + 294 + ], + "score": 1.0, + "content": "comes even stronger", + "type": "text" + }, + { + "bbox": [ + 193, + 281, + 235, + 293 + ], + "score": 0.86, + "content": "( \\rho > 0 . 9 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 280, + 505, + 294 + ], + "score": 1.0, + "content": ". That suggests that while (calibrated) LL measures the uncertainty", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 291, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 305 + ], + "score": 1.0, + "content": "of the model, it still has a significant dependence on the accuracy and vice versa. A model with", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 302, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 505, + 316 + ], + "score": 1.0, + "content": "higher accuracy would likely have a higher log-likelihood. See Figure 9 in Appendix C for more", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 312, + 138, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 138, + 326 + ], + "score": 1.0, + "content": "details.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 505, + 408 + ], + "lines": [ + { + "bbox": [ + 101, + 324, + 509, + 351 + ], + "spans": [ + { + "bbox": [ + 101, + 324, + 152, + 351 + ], + "score": 1.0, + "content": "Brier score", + "type": "text" + }, + { + "bbox": [ + 153, + 329, + 359, + 344 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathrm { { B S } } = \\frac { 1 } { n } \\frac { 1 } { C } \\sum _ { i = 1 } ^ { n } \\sum _ { c = 1 } ^ { C } ( \\mathbb { I } [ y _ { i } ^ { * } = c ] - \\hat { p } ( y = c | x _ { i } ) ) ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 324, + 509, + 351 + ], + "score": 1.0, + "content": "has also been known for a long time", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 342, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 505, + 354 + ], + "score": 1.0, + "content": "as a metric for verification of predicted probabilities (Brier, 1950). Similarly to the log-likelihood,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 351, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 366 + ], + "score": 1.0, + "content": "the Brier score penalizes low probabilities assigned to correct predictions and high probabilities as-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "score": 1.0, + "content": "signed to wrong ones. It is also sensitive to the temperature of the softmax distribution and behaves", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "score": 1.0, + "content": "similarly to the log-likelihood. While these metrics are not strictly equivalent, they show a high em-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 386, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 505, + 398 + ], + "score": 1.0, + "content": "pirical correlation for a wide range of models on CIFAR-10, CIFAR-100 and ImageNet datasets (see", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 396, + 213, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 213, + 410 + ], + "score": 1.0, + "content": "Figure 8 in Appendix C ).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21 + }, + { + "type": "title", + "bbox": [ + 108, + 432, + 271, + 443 + ], + "lines": [ + { + "bbox": [ + 106, + 432, + 272, + 445 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 272, + 445 + ], + "score": 1.0, + "content": "3.2 MISCLASSIFICATION DETECTION", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 457, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 106, + 457, + 504, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 504, + 469 + ], + "score": 1.0, + "content": "Detection of wrong predictions of the model, or misclassifications, is a popular downstream prob-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 469, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 505, + 480 + ], + "score": 1.0, + "content": "lem relevant to the problem of in-domain uncertainty estimation. Since misclassification detection is", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 479, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 506, + 492 + ], + "score": 1.0, + "content": "essentially a binary classification problem, some papers measure its quality using conventional met-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "rics for binary classification such as AUC-ROC and AUC-PR (Malinin & Gales, 2018; Cui et al.,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "score": 1.0, + "content": "2019; Mozejko et al., 2018). These papers use an uncertainty criterion like confidence or predictive ˙", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 512, + 276, + 525 + ], + "spans": [ + { + "bbox": [ + 106, + 512, + 139, + 525 + ], + "score": 1.0, + "content": "entropy", + "type": "text" + }, + { + "bbox": [ + 140, + 512, + 187, + 524 + ], + "score": 0.93, + "content": "\\mathcal { H } [ \\bar { p } ( \\boldsymbol { y } | \\boldsymbol { x } _ { i } ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 512, + 276, + 525 + ], + "score": 1.0, + "content": "as a prediction score.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 529, + 505, + 606 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "While these metrics can be used to assess the misclassification detection performance of a single", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "model, they cannot be used to directly compare misclassification performance across different mod-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "els. Correct and incorrect predictions are specific for every model, therefore, every model induces", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 562, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 505, + 574 + ], + "score": 1.0, + "content": "its own binary classification problem. The induced problems can differ significantly, since different", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "score": 1.0, + "content": "models produce different confidences and misclassify different objects. In other words, comparing", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 584, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 505, + 596 + ], + "score": 1.0, + "content": "such metrics implies a comparison of performance of classifiers that solve different classification", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 595, + 315, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 315, + 606 + ], + "score": 1.0, + "content": "problems. Such metrics are therefore incomparable.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 194, + 618, + 415, + 640 + ], + "lines": [ + { + "bbox": [ + 231, + 616, + 381, + 630 + ], + "spans": [ + { + "bbox": [ + 231, + 616, + 381, + 630 + ], + "score": 1.0, + "content": "AUCs for misclassification detection", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 192, + 627, + 416, + 641 + ], + "spans": [ + { + "bbox": [ + 192, + 627, + 416, + 641 + ], + "score": 1.0, + "content": "cannot be directly compared between different models.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 506, + 667 + ], + "score": 1.0, + "content": "While comparing AUCs is incorrect in the setting of misclassification detection, it is correct to", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "compare these metrics in many out-of-domain data detection problems. In that case, both objects", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "and targets of the induced binary classification problems remain the same for all models. All out-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "score": 1.0, + "content": "of-domain objects have a positive label and all in-domain objects have a negative label. Note that", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 698, + 506, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 710 + ], + "score": 1.0, + "content": "this condition does not necessarily hold in the problem of detection of adversarial attacks. Different", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "score": 1.0, + "content": "models generally have different inputs after an adversarial attack, so such AUC-based metrics might", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 721, + 167, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 167, + 732 + ], + "score": 1.0, + "content": "still be flawed.", + "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, + 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": "text", + "bbox": [ + 106, + 82, + 503, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 80, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 123, + 119, + 491, + 142 + ], + "lines": [ + { + "bbox": [ + 121, + 117, + 492, + 133 + ], + "spans": [ + { + "bbox": [ + 121, + 117, + 492, + 133 + ], + "score": 1.0, + "content": "We introduce a new metric called the calibrated log-likelihood that is the log-likelihood at", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 254, + 128, + 356, + 144 + ], + "spans": [ + { + "bbox": [ + 254, + 128, + 356, + 144 + ], + "score": 1.0, + "content": "the optimal temperature.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 121, + 117, + 492, + 144 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 159, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 160, + 504, + 172 + ], + "spans": [ + { + "bbox": [ + 106, + 160, + 504, + 172 + ], + "score": 1.0, + "content": "The calibrated log-likelihood considers a model and a post-training calibration as a unified system,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "targeting to measure all models in the equal conditions of optimal temperature. That allows to avoid", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "measuring calibration error that can be eliminated by a simple temperature scaling. The metric", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "score": 1.0, + "content": "significantly affects the results of the comparison. For example, in Figure 10 the differences between", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 203, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 505, + 216 + ], + "score": 1.0, + "content": "Bayesian (VI, K-FAC, SWAG, dropout) and conventional non-Bayesian networks become much less", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 214, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 506, + 227 + ], + "score": 1.0, + "content": "pronounced, and in most cases making conventional non-Bayesian networks match the performance", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 225, + 452, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 452, + 238 + ], + "score": 1.0, + "content": "of Bayesian ones (VI, K-FAC, Dropout) on ResNet110, ResNet164, and WideResNet.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 160, + 506, + 238 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 504, + 264 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "score": 1.0, + "content": "We show how to obtain an unbiased estimate of the calibrated log-likelihood without a held-out", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 253, + 222, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 222, + 264 + ], + "score": 1.0, + "content": "validation set in Section 3.5.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 106, + 241, + 505, + 264 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 270, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 329, + 283 + ], + "score": 1.0, + "content": "LL also demonstrates a high correlation with accuracy", + "type": "text" + }, + { + "bbox": [ + 329, + 271, + 370, + 282 + ], + "score": 0.86, + "content": "( \\rho > 0 . 8 6 )", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 270, + 505, + 283 + ], + "score": 1.0, + "content": ", that in case of calibrated LL be-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 193, + 294 + ], + "score": 1.0, + "content": "comes even stronger", + "type": "text" + }, + { + "bbox": [ + 193, + 281, + 235, + 293 + ], + "score": 0.86, + "content": "( \\rho > 0 . 9 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 280, + 505, + 294 + ], + "score": 1.0, + "content": ". That suggests that while (calibrated) LL measures the uncertainty", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 291, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 305 + ], + "score": 1.0, + "content": "of the model, it still has a significant dependence on the accuracy and vice versa. A model with", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 302, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 505, + 316 + ], + "score": 1.0, + "content": "higher accuracy would likely have a higher log-likelihood. See Figure 9 in Appendix C for more", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 312, + 138, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 138, + 326 + ], + "score": 1.0, + "content": "details.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 270, + 505, + 326 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 505, + 408 + ], + "lines": [ + { + "bbox": [ + 101, + 324, + 509, + 351 + ], + "spans": [ + { + "bbox": [ + 101, + 324, + 152, + 351 + ], + "score": 1.0, + "content": "Brier score", + "type": "text" + }, + { + "bbox": [ + 153, + 329, + 359, + 344 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathrm { { B S } } = \\frac { 1 } { n } \\frac { 1 } { C } \\sum _ { i = 1 } ^ { n } \\sum _ { c = 1 } ^ { C } ( \\mathbb { I } [ y _ { i } ^ { * } = c ] - \\hat { p } ( y = c | x _ { i } ) ) ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 324, + 509, + 351 + ], + "score": 1.0, + "content": "has also been known for a long time", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 342, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 505, + 354 + ], + "score": 1.0, + "content": "as a metric for verification of predicted probabilities (Brier, 1950). Similarly to the log-likelihood,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 351, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 506, + 366 + ], + "score": 1.0, + "content": "the Brier score penalizes low probabilities assigned to correct predictions and high probabilities as-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "score": 1.0, + "content": "signed to wrong ones. It is also sensitive to the temperature of the softmax distribution and behaves", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "score": 1.0, + "content": "similarly to the log-likelihood. While these metrics are not strictly equivalent, they show a high em-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 386, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 505, + 398 + ], + "score": 1.0, + "content": "pirical correlation for a wide range of models on CIFAR-10, CIFAR-100 and ImageNet datasets (see", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 396, + 213, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 213, + 410 + ], + "score": 1.0, + "content": "Figure 8 in Appendix C ).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21, + "bbox_fs": [ + 101, + 324, + 509, + 410 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 432, + 271, + 443 + ], + "lines": [ + { + "bbox": [ + 106, + 432, + 272, + 445 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 272, + 445 + ], + "score": 1.0, + "content": "3.2 MISCLASSIFICATION DETECTION", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 457, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 106, + 457, + 504, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 504, + 469 + ], + "score": 1.0, + "content": "Detection of wrong predictions of the model, or misclassifications, is a popular downstream prob-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 469, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 505, + 480 + ], + "score": 1.0, + "content": "lem relevant to the problem of in-domain uncertainty estimation. Since misclassification detection is", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 479, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 506, + 492 + ], + "score": 1.0, + "content": "essentially a binary classification problem, some papers measure its quality using conventional met-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "rics for binary classification such as AUC-ROC and AUC-PR (Malinin & Gales, 2018; Cui et al.,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 506, + 515 + ], + "score": 1.0, + "content": "2019; Mozejko et al., 2018). These papers use an uncertainty criterion like confidence or predictive ˙", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 512, + 276, + 525 + ], + "spans": [ + { + "bbox": [ + 106, + 512, + 139, + 525 + ], + "score": 1.0, + "content": "entropy", + "type": "text" + }, + { + "bbox": [ + 140, + 512, + 187, + 524 + ], + "score": 0.93, + "content": "\\mathcal { H } [ \\bar { p } ( \\boldsymbol { y } | \\boldsymbol { x } _ { i } ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 512, + 276, + 525 + ], + "score": 1.0, + "content": "as a prediction score.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 457, + 506, + 525 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 529, + 505, + 606 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "While these metrics can be used to assess the misclassification detection performance of a single", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "model, they cannot be used to directly compare misclassification performance across different mod-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "els. Correct and incorrect predictions are specific for every model, therefore, every model induces", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 562, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 505, + 574 + ], + "score": 1.0, + "content": "its own binary classification problem. The induced problems can differ significantly, since different", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "score": 1.0, + "content": "models produce different confidences and misclassify different objects. In other words, comparing", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 584, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 584, + 505, + 596 + ], + "score": 1.0, + "content": "such metrics implies a comparison of performance of classifiers that solve different classification", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 595, + 315, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 315, + 606 + ], + "score": 1.0, + "content": "problems. Such metrics are therefore incomparable.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 529, + 505, + 606 + ] + }, + { + "type": "text", + "bbox": [ + 194, + 618, + 415, + 640 + ], + "lines": [ + { + "bbox": [ + 231, + 616, + 381, + 630 + ], + "spans": [ + { + "bbox": [ + 231, + 616, + 381, + 630 + ], + "score": 1.0, + "content": "AUCs for misclassification detection", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 192, + 627, + 416, + 641 + ], + "spans": [ + { + "bbox": [ + 192, + 627, + 416, + 641 + ], + "score": 1.0, + "content": "cannot be directly compared between different models.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 192, + 616, + 416, + 641 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 506, + 667 + ], + "score": 1.0, + "content": "While comparing AUCs is incorrect in the setting of misclassification detection, it is correct to", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "compare these metrics in many out-of-domain data detection problems. In that case, both objects", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "and targets of the induced binary classification problems remain the same for all models. All out-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "score": 1.0, + "content": "of-domain objects have a positive label and all in-domain objects have a negative label. Note that", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 698, + 506, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 710 + ], + "score": 1.0, + "content": "this condition does not necessarily hold in the problem of detection of adversarial attacks. Different", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 721 + ], + "score": 1.0, + "content": "models generally have different inputs after an adversarial attack, so such AUC-based metrics might", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 721, + 167, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 167, + 732 + ], + "score": 1.0, + "content": "still be flawed.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 654, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 277, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 279, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 279, + 95 + ], + "score": 1.0, + "content": "3.3 CLASSIFICATION WITH REJECTION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 103, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 505, + 116 + ], + "score": 1.0, + "content": "Accuracy-confidence curves are another way to measure the performance of misclassification detec-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 114, + 504, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 426, + 127 + ], + "score": 1.0, + "content": "tion. These curves measure the accuracy on the set of objects with confidence", + "type": "text" + }, + { + "bbox": [ + 426, + 114, + 504, + 126 + ], + "score": 0.89, + "content": "\\operatorname* { m a x } _ { c } { \\hat { p } } ( y = c | x _ { i } )", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 124, + 495, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 208, + 137 + ], + "score": 1.0, + "content": "above a certain threshold", + "type": "text" + }, + { + "bbox": [ + 208, + 127, + 216, + 135 + ], + "score": 0.75, + "content": "\\tau", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 124, + 495, + 137 + ], + "score": 1.0, + "content": "(Lakshminarayanan et al., 2017) and ignoring or rejecting the others.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 141, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 506, + 155 + ], + "score": 1.0, + "content": "The main problem with accuracy-confidence curves is that they rely too much on calibration and the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 153, + 505, + 165 + ], + "score": 1.0, + "content": "actual values of confidence. Models with different temperatures have different numbers of objects at", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 164, + 505, + 176 + ], + "spans": [ + { + "bbox": [ + 106, + 164, + 505, + 176 + ], + "score": 1.0, + "content": "each confidence level which does not allow for a meaningful comparison. To overcome this problem,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 175, + 505, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 175, + 505, + 187 + ], + "score": 1.0, + "content": "one can swhich from thresholding by the confidence level to thresholding by the number of rejected", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 186, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 505, + 198 + ], + "score": 1.0, + "content": "objects. The corresponding curves are then less sensitive to temperature scaling and thus allow to", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 196, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 505, + 210 + ], + "score": 1.0, + "content": "compare the rejection ability in a more meaningful way. Such curves have been known as accuracy-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 208, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 505, + 220 + ], + "score": 1.0, + "content": "rejection curves (Nadeem et al., 2009). In order to obtain a scalar metric for easy comparisons, one", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 219, + 441, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 441, + 231 + ], + "score": 1.0, + "content": "can compute the area under this curve, resulting in AU-ARC (Nadeem et al., 2009).", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 7.5 + }, + { + "type": "title", + "bbox": [ + 108, + 243, + 232, + 254 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 233, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 233, + 256 + ], + "score": 1.0, + "content": "3.4 CALIBRATION METRICS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 263, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 263, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 505, + 277 + ], + "score": 1.0, + "content": "Informally speaking, a probabilistic classifier is calibrated if any predicted class probability is equal", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 275, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 506, + 288 + ], + "score": 1.0, + "content": "to the true class probability according to the underlying data distribution (see (Vaicenavicius et al.,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 505, + 298 + ], + "score": 1.0, + "content": "2019) for formal definitions). Any deviation from the perfect calibration is called miscalibration.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 296, + 401, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 202, + 309 + ], + "score": 1.0, + "content": "For brevity, we will use", + "type": "text" + }, + { + "bbox": [ + 203, + 297, + 218, + 309 + ], + "score": 0.9, + "content": "\\hat { p } _ { i , c }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 296, + 259, + 309 + ], + "score": 1.0, + "content": "to denote", + "type": "text" + }, + { + "bbox": [ + 259, + 297, + 311, + 309 + ], + "score": 0.93, + "content": "{ \\hat { p } } ( y = c | x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 296, + 401, + 309 + ], + "score": 1.0, + "content": "in the current section.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 312, + 505, + 353 + ], + "lines": [ + { + "bbox": [ + 106, + 312, + 504, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 312, + 504, + 324 + ], + "score": 1.0, + "content": "Expected calibration error (ECE) (Naeini et al., 2015) is a metric that estimates model miscalibration", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 322, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 506, + 335 + ], + "score": 1.0, + "content": "by binning the assigned probability scores and comparing them to average accuracies inside these", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 331, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 104, + 331, + 173, + 346 + ], + "score": 1.0, + "content": "bins. Assuming", + "type": "text" + }, + { + "bbox": [ + 173, + 333, + 189, + 344 + ], + "score": 0.9, + "content": "{ B } _ { m } ^ { \\bar { } }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 331, + 239, + 346 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 240, + 334, + 250, + 343 + ], + "score": 0.82, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 331, + 295, + 346 + ], + "score": 1.0, + "content": "-th bin and", + "type": "text" + }, + { + "bbox": [ + 295, + 333, + 307, + 343 + ], + "score": 0.86, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 331, + 506, + 346 + ], + "score": 1.0, + "content": "is overall number of bins, the ECE is defined as", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 341, + 142, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 142, + 354 + ], + "score": 1.0, + "content": "follows:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 351, + 387, + 381 + ], + "lines": [ + { + "bbox": [ + 222, + 351, + 387, + 381 + ], + "spans": [ + { + "bbox": [ + 222, + 351, + 387, + 381 + ], + "score": 0.92, + "content": "\\mathrm { E C E } = \\sum _ { m = 1 } ^ { M } \\frac { | B _ { m } | } { n } \\left| \\operatorname { a c c } ( B _ { m } ) - \\operatorname { c o n f } ( B _ { m } ) \\right| ,", + "type": "interline_equation", + "image_path": "5afa4554b17b8b5979560f9df3c87d552ad0910980a5e1009cab4de87caaa03f.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 222, + 351, + 387, + 366.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 222, + 366.0, + 387, + 381.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 109, + 382, + 462, + 398 + ], + "lines": [ + { + "bbox": [ + 107, + 378, + 462, + 401 + ], + "spans": [ + { + "bbox": [ + 107, + 378, + 134, + 401 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 384, + 462, + 398 + ], + "score": 0.31, + "content": "\\begin{array} { r } { \\operatorname { a c c } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } { \\mathbb { I } } [ \\operatorname { a r g m a x } _ { c } \\hat { p } _ { i , c } = y _ { i } ^ { * } ] \\mathrm { ~ a n d ~ c o n f } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } \\hat { p } _ { i , y _ { i } ^ { * } } . } \\end{array}", + "type": "inline_equation", + "image_path": "b8e72d2c5f8ce2526f91b00c8903d1979465875ea1dee00cde691db1c4187e73.jpg" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 399, + 505, + 489 + ], + "lines": [ + { + "bbox": [ + 105, + 400, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 400, + 505, + 412 + ], + "score": 1.0, + "content": "A recent line of works on measuring calibration in deep learning (Vaicenavicius et al., 2019; Kumar", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "et al., 2019; Nixon et al., 2019) outlines several problems of the ECE score. Firstly, ECE is a bi-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 421, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 434 + ], + "score": 1.0, + "content": "ased estimate of the true calibration. Secondly, ECE-like scores cannot be optimized directly since", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 433, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 505, + 446 + ], + "score": 1.0, + "content": "they are minimized by a model with constant uniform predictions, making the infinite temperature", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 444, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 444, + 149, + 455 + ], + "score": 0.91, + "content": "T = + \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 444, + 505, + 456 + ], + "score": 1.0, + "content": "its global optimum. Thirdly, ECE only estimates miscalibration in terms of the maxi-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 455, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 505, + 469 + ], + "score": 1.0, + "content": "mum assigned probability whereas practical applications may require the full predicted probability", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 466, + 504, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 504, + 478 + ], + "score": 1.0, + "content": "vector to be calibrated. Finally, biases of ECE on different models may not be equal, rendering the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 477, + 495, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 495, + 489 + ], + "score": 1.0, + "content": "miscalibration estimates incompatible. Similar concerns are also discussed by Ding et al. (2019).", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 505, + 554 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 506, + 506 + ], + "score": 1.0, + "content": "Thresholded adaptive calibration error (TACE) was proposed as a step towards solving some of these", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "score": 1.0, + "content": "problems (Nixon et al., 2019). TACE disregards all predicted probabilities that are less than a certain", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 511, + 506, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 526 + ], + "score": 1.0, + "content": "threshold (hence thresholded), chooses the bin locations adaptively so that each bin has the same", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 522, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 505, + 535 + ], + "score": 1.0, + "content": "number of objects (hence adaptive), and estimates miscalibration of probabilties across all classes", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 104, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 104, + 532, + 415, + 545 + ], + "score": 1.0, + "content": "in the prediction (not just the top-1 predicted class as in ECE). Assuming that", + "type": "text" + }, + { + "bbox": [ + 416, + 533, + 434, + 545 + ], + "score": 0.9, + "content": "B _ { m } ^ { \\mathrm { { T A } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 532, + 482, + 545 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 483, + 534, + 493, + 542 + ], + "score": 0.79, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 532, + 506, + 545 + ], + "score": 1.0, + "content": "-th", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 542, + 470, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 223, + 555 + ], + "score": 1.0, + "content": "thresholded adaptive bin and", + "type": "text" + }, + { + "bbox": [ + 224, + 543, + 235, + 552 + ], + "score": 0.8, + "content": "\\bar { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 542, + 470, + 555 + ], + "score": 1.0, + "content": "is the overall number of bins, TACE is defined as follows:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34.5 + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 592, + 478, + 606 + ], + "lines": [ + { + "bbox": [ + 138, + 592, + 478, + 606 + ], + "spans": [ + { + "bbox": [ + 138, + 592, + 478, + 606 + ], + "score": 0.49, + "content": "\\begin{array} { r } { \\mathrm { \\ o b j s } ( B ^ { \\mathtt { T A } } , c ) = | B ^ { \\mathtt { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathtt { T A } } } \\mathbb { I } [ y _ { i } ^ { * } = c ] \\mathrm { \\ a n d \\ c o n f } ( B ^ { \\mathtt { T A } } , c ) = | B ^ { \\mathtt { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathtt { T A } } } \\hat { p } _ { i } } \\end{array}", + "type": "interline_equation", + "image_path": "ac924504db297316b22ed50ee666606bdff414a08ecf2e73ba2f3c638fc6877d.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 138, + 592, + 478, + 606 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 557, + 423, + 588 + ], + "lines": [ + { + "bbox": [ + 186, + 557, + 423, + 588 + ], + "spans": [ + { + "bbox": [ + 186, + 557, + 423, + 588 + ], + "score": 0.94, + "content": "\\mathrm { T A C E } = \\frac { 1 } { C M } \\sum _ { c = 1 } ^ { C } \\sum _ { m = 1 } ^ { M } \\frac { | B _ { m } ^ { \\mathrm { T A } } | } { n } \\left| \\mathrm { o b j s } ( B _ { m } ^ { \\mathrm { T A } } , c ) - \\mathrm { c o n f } ( B _ { m } ^ { \\mathrm { T A } } , c ) \\right| ,", + "type": "interline_equation", + "image_path": "b798a685f321ee0b846b98f2fd23f0b55d8c570633ba884f309b8acfac1cd1d1.jpg" + } + ] + } + ], + "index": 40.0, + "virtual_lines": [ + { + "bbox": [ + 186, + 557, + 423, + 572.5 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 186, + 572.5, + 423, + 588.0 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 609, + 505, + 676 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 506, + 622 + ], + "score": 1.0, + "content": "Although TACE does solve several problems of ECE and is useful for measuring calibration of a", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 620, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 505, + 634 + ], + "score": 1.0, + "content": "specific model, it still cannot be used as a reliable criterion for comparing different models. Theory", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 630, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 644 + ], + "score": 1.0, + "content": "suggests that it is still a biased estimate of true calibration with different bias for each model (Vaice-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 643, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 505, + 654 + ], + "score": 1.0, + "content": "navicius et al., 2019). In practice, we find that TACE is sensitive to its two parameters, the number", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 653, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 653, + 505, + 666 + ], + "score": 1.0, + "content": "of bins and the threshold, and does not provide a consistent ranking of different models, as shown", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 664, + 156, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 156, + 677 + ], + "score": 1.0, + "content": "in Figure 2.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43.5 + }, + { + "type": "title", + "bbox": [ + 108, + 689, + 421, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 422, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 422, + 702 + ], + "score": 1.0, + "content": "3.5 CALIBRATED LOG-LIKELIHOOD AND TEST-TIME CROSS-VALIDATION", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "There are two common ways to perform temperature scaling using a validation set when training on", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "datasets that only feature public training and test sets (e.g. CIFARs). The public training set might", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 48.5 + } + ], + "page_idx": 4, + "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, + 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": [ + 108, + 82, + 277, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 279, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 279, + 95 + ], + "score": 1.0, + "content": "3.3 CLASSIFICATION WITH REJECTION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 103, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 505, + 116 + ], + "score": 1.0, + "content": "Accuracy-confidence curves are another way to measure the performance of misclassification detec-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 114, + 504, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 426, + 127 + ], + "score": 1.0, + "content": "tion. These curves measure the accuracy on the set of objects with confidence", + "type": "text" + }, + { + "bbox": [ + 426, + 114, + 504, + 126 + ], + "score": 0.89, + "content": "\\operatorname* { m a x } _ { c } { \\hat { p } } ( y = c | x _ { i } )", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 124, + 495, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 208, + 137 + ], + "score": 1.0, + "content": "above a certain threshold", + "type": "text" + }, + { + "bbox": [ + 208, + 127, + 216, + 135 + ], + "score": 0.75, + "content": "\\tau", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 124, + 495, + 137 + ], + "score": 1.0, + "content": "(Lakshminarayanan et al., 2017) and ignoring or rejecting the others.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 102, + 505, + 137 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 141, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 506, + 155 + ], + "score": 1.0, + "content": "The main problem with accuracy-confidence curves is that they rely too much on calibration and the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 153, + 505, + 165 + ], + "score": 1.0, + "content": "actual values of confidence. Models with different temperatures have different numbers of objects at", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 164, + 505, + 176 + ], + "spans": [ + { + "bbox": [ + 106, + 164, + 505, + 176 + ], + "score": 1.0, + "content": "each confidence level which does not allow for a meaningful comparison. To overcome this problem,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 175, + 505, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 175, + 505, + 187 + ], + "score": 1.0, + "content": "one can swhich from thresholding by the confidence level to thresholding by the number of rejected", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 186, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 505, + 198 + ], + "score": 1.0, + "content": "objects. The corresponding curves are then less sensitive to temperature scaling and thus allow to", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 196, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 505, + 210 + ], + "score": 1.0, + "content": "compare the rejection ability in a more meaningful way. Such curves have been known as accuracy-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 208, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 505, + 220 + ], + "score": 1.0, + "content": "rejection curves (Nadeem et al., 2009). In order to obtain a scalar metric for easy comparisons, one", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 219, + 441, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 441, + 231 + ], + "score": 1.0, + "content": "can compute the area under this curve, resulting in AU-ARC (Nadeem et al., 2009).", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 141, + 506, + 231 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 243, + 232, + 254 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 233, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 233, + 256 + ], + "score": 1.0, + "content": "3.4 CALIBRATION METRICS", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 263, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 263, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 505, + 277 + ], + "score": 1.0, + "content": "Informally speaking, a probabilistic classifier is calibrated if any predicted class probability is equal", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 275, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 506, + 288 + ], + "score": 1.0, + "content": "to the true class probability according to the underlying data distribution (see (Vaicenavicius et al.,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 505, + 298 + ], + "score": 1.0, + "content": "2019) for formal definitions). Any deviation from the perfect calibration is called miscalibration.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 296, + 401, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 202, + 309 + ], + "score": 1.0, + "content": "For brevity, we will use", + "type": "text" + }, + { + "bbox": [ + 203, + 297, + 218, + 309 + ], + "score": 0.9, + "content": "\\hat { p } _ { i , c }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 296, + 259, + 309 + ], + "score": 1.0, + "content": "to denote", + "type": "text" + }, + { + "bbox": [ + 259, + 297, + 311, + 309 + ], + "score": 0.93, + "content": "{ \\hat { p } } ( y = c | x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 296, + 401, + 309 + ], + "score": 1.0, + "content": "in the current section.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 263, + 506, + 309 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 312, + 505, + 353 + ], + "lines": [ + { + "bbox": [ + 106, + 312, + 504, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 312, + 504, + 324 + ], + "score": 1.0, + "content": "Expected calibration error (ECE) (Naeini et al., 2015) is a metric that estimates model miscalibration", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 322, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 506, + 335 + ], + "score": 1.0, + "content": "by binning the assigned probability scores and comparing them to average accuracies inside these", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 331, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 104, + 331, + 173, + 346 + ], + "score": 1.0, + "content": "bins. Assuming", + "type": "text" + }, + { + "bbox": [ + 173, + 333, + 189, + 344 + ], + "score": 0.9, + "content": "{ B } _ { m } ^ { \\bar { } }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 331, + 239, + 346 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 240, + 334, + 250, + 343 + ], + "score": 0.82, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 331, + 295, + 346 + ], + "score": 1.0, + "content": "-th bin and", + "type": "text" + }, + { + "bbox": [ + 295, + 333, + 307, + 343 + ], + "score": 0.86, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 331, + 506, + 346 + ], + "score": 1.0, + "content": "is overall number of bins, the ECE is defined as", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 341, + 142, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 142, + 354 + ], + "score": 1.0, + "content": "follows:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5, + "bbox_fs": [ + 104, + 312, + 506, + 354 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 351, + 387, + 381 + ], + "lines": [ + { + "bbox": [ + 222, + 351, + 387, + 381 + ], + "spans": [ + { + "bbox": [ + 222, + 351, + 387, + 381 + ], + "score": 0.92, + "content": "\\mathrm { E C E } = \\sum _ { m = 1 } ^ { M } \\frac { | B _ { m } | } { n } \\left| \\operatorname { a c c } ( B _ { m } ) - \\operatorname { c o n f } ( B _ { m } ) \\right| ,", + "type": "interline_equation", + "image_path": "5afa4554b17b8b5979560f9df3c87d552ad0910980a5e1009cab4de87caaa03f.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 222, + 351, + 387, + 366.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 222, + 366.0, + 387, + 381.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 109, + 382, + 462, + 398 + ], + "lines": [ + { + "bbox": [ + 107, + 378, + 462, + 401 + ], + "spans": [ + { + "bbox": [ + 107, + 378, + 134, + 401 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 384, + 462, + 398 + ], + "score": 0.31, + "content": "\\begin{array} { r } { \\operatorname { a c c } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } { \\mathbb { I } } [ \\operatorname { a r g m a x } _ { c } \\hat { p } _ { i , c } = y _ { i } ^ { * } ] \\mathrm { ~ a n d ~ c o n f } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } \\hat { p } _ { i , y _ { i } ^ { * } } . } \\end{array}", + "type": "inline_equation", + "image_path": "b8e72d2c5f8ce2526f91b00c8903d1979465875ea1dee00cde691db1c4187e73.jpg" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 107, + 378, + 462, + 401 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 399, + 505, + 489 + ], + "lines": [ + { + "bbox": [ + 105, + 400, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 400, + 505, + 412 + ], + "score": 1.0, + "content": "A recent line of works on measuring calibration in deep learning (Vaicenavicius et al., 2019; Kumar", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "et al., 2019; Nixon et al., 2019) outlines several problems of the ECE score. Firstly, ECE is a bi-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 421, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 434 + ], + "score": 1.0, + "content": "ased estimate of the true calibration. Secondly, ECE-like scores cannot be optimized directly since", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 433, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 505, + 446 + ], + "score": 1.0, + "content": "they are minimized by a model with constant uniform predictions, making the infinite temperature", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 444, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 444, + 149, + 455 + ], + "score": 0.91, + "content": "T = + \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 444, + 505, + 456 + ], + "score": 1.0, + "content": "its global optimum. Thirdly, ECE only estimates miscalibration in terms of the maxi-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 455, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 505, + 469 + ], + "score": 1.0, + "content": "mum assigned probability whereas practical applications may require the full predicted probability", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 466, + 504, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 504, + 478 + ], + "score": 1.0, + "content": "vector to be calibrated. Finally, biases of ECE on different models may not be equal, rendering the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 477, + 495, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 495, + 489 + ], + "score": 1.0, + "content": "miscalibration estimates incompatible. Similar concerns are also discussed by Ding et al. (2019).", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 400, + 505, + 489 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 505, + 554 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 506, + 506 + ], + "score": 1.0, + "content": "Thresholded adaptive calibration error (TACE) was proposed as a step towards solving some of these", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "score": 1.0, + "content": "problems (Nixon et al., 2019). TACE disregards all predicted probabilities that are less than a certain", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 511, + 506, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 526 + ], + "score": 1.0, + "content": "threshold (hence thresholded), chooses the bin locations adaptively so that each bin has the same", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 522, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 505, + 535 + ], + "score": 1.0, + "content": "number of objects (hence adaptive), and estimates miscalibration of probabilties across all classes", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 104, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 104, + 532, + 415, + 545 + ], + "score": 1.0, + "content": "in the prediction (not just the top-1 predicted class as in ECE). Assuming that", + "type": "text" + }, + { + "bbox": [ + 416, + 533, + 434, + 545 + ], + "score": 0.9, + "content": "B _ { m } ^ { \\mathrm { { T A } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 532, + 482, + 545 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 483, + 534, + 493, + 542 + ], + "score": 0.79, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 532, + 506, + 545 + ], + "score": 1.0, + "content": "-th", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 542, + 470, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 223, + 555 + ], + "score": 1.0, + "content": "thresholded adaptive bin and", + "type": "text" + }, + { + "bbox": [ + 224, + 543, + 235, + 552 + ], + "score": 0.8, + "content": "\\bar { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 542, + 470, + 555 + ], + "score": 1.0, + "content": "is the overall number of bins, TACE is defined as follows:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34.5, + "bbox_fs": [ + 104, + 492, + 506, + 555 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 592, + 478, + 606 + ], + "lines": [ + { + "bbox": [ + 138, + 592, + 478, + 606 + ], + "spans": [ + { + "bbox": [ + 138, + 592, + 478, + 606 + ], + "score": 0.49, + "content": "\\begin{array} { r } { \\mathrm { \\ o b j s } ( B ^ { \\mathtt { T A } } , c ) = | B ^ { \\mathtt { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathtt { T A } } } \\mathbb { I } [ y _ { i } ^ { * } = c ] \\mathrm { \\ a n d \\ c o n f } ( B ^ { \\mathtt { T A } } , c ) = | B ^ { \\mathtt { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathtt { T A } } } \\hat { p } _ { i } } \\end{array}", + "type": "interline_equation", + "image_path": "ac924504db297316b22ed50ee666606bdff414a08ecf2e73ba2f3c638fc6877d.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 138, + 592, + 478, + 606 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 557, + 423, + 588 + ], + "lines": [ + { + "bbox": [ + 186, + 557, + 423, + 588 + ], + "spans": [ + { + "bbox": [ + 186, + 557, + 423, + 588 + ], + "score": 0.94, + "content": "\\mathrm { T A C E } = \\frac { 1 } { C M } \\sum _ { c = 1 } ^ { C } \\sum _ { m = 1 } ^ { M } \\frac { | B _ { m } ^ { \\mathrm { T A } } | } { n } \\left| \\mathrm { o b j s } ( B _ { m } ^ { \\mathrm { T A } } , c ) - \\mathrm { c o n f } ( B _ { m } ^ { \\mathrm { T A } } , c ) \\right| ,", + "type": "interline_equation", + "image_path": "b798a685f321ee0b846b98f2fd23f0b55d8c570633ba884f309b8acfac1cd1d1.jpg" + } + ] + } + ], + "index": 40.0, + "virtual_lines": [ + { + "bbox": [ + 186, + 557, + 423, + 572.5 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 186, + 572.5, + 423, + 588.0 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 609, + 505, + 676 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 506, + 622 + ], + "score": 1.0, + "content": "Although TACE does solve several problems of ECE and is useful for measuring calibration of a", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 620, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 505, + 634 + ], + "score": 1.0, + "content": "specific model, it still cannot be used as a reliable criterion for comparing different models. Theory", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 630, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 644 + ], + "score": 1.0, + "content": "suggests that it is still a biased estimate of true calibration with different bias for each model (Vaice-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 643, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 505, + 654 + ], + "score": 1.0, + "content": "navicius et al., 2019). In practice, we find that TACE is sensitive to its two parameters, the number", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 653, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 653, + 505, + 666 + ], + "score": 1.0, + "content": "of bins and the threshold, and does not provide a consistent ranking of different models, as shown", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 664, + 156, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 156, + 677 + ], + "score": 1.0, + "content": "in Figure 2.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 609, + 506, + 677 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 689, + 421, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 422, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 422, + 702 + ], + "score": 1.0, + "content": "3.5 CALIBRATED LOG-LIKELIHOOD AND TEST-TIME CROSS-VALIDATION", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "There are two common ways to perform temperature scaling using a validation set when training on", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "datasets that only feature public training and test sets (e.g. CIFARs). The public training set might", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "be divided into a smaller training set and validation set, or the public test set can be split into test", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 505, + 105 + ], + "score": 1.0, + "content": "and validation parts (Guo et al., 2017; Nixon et al., 2019). The problem with the first method is that", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "score": 1.0, + "content": "the resulting models cannot be directly compared with all the other models that have been trained on", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "the full training set. The second approach, however, provides an unbiased estimate of metrics such", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 360, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 360, + 140 + ], + "score": 1.0, + "content": "as log-likelihood and Brier score but introduces more variance.", + "type": "text", + "cross_page": true + } + ], + "index": 4 + } + ], + "index": 48.5, + "bbox_fs": [ + 106, + 709, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "be divided into a smaller training set and validation set, or the public test set can be split into test", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 505, + 105 + ], + "score": 1.0, + "content": "and validation parts (Guo et al., 2017; Nixon et al., 2019). The problem with the first method is that", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "score": 1.0, + "content": "the resulting models cannot be directly compared with all the other models that have been trained on", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "the full training set. The second approach, however, provides an unbiased estimate of metrics such", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 360, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 360, + 140 + ], + "score": 1.0, + "content": "as log-likelihood and Brier score but introduces more variance.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 143, + 505, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "In order to reduce the variance of the second approach, we perform a “test-time cross-validation”.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 154, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 506, + 167 + ], + "score": 1.0, + "content": "We randomly divide the test set into two equal parts, then compute metrics for each half of the test", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 179 + ], + "score": 1.0, + "content": "set using the temperature optimized on another half. We repeat this procedure five times and average", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 478, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 478, + 189 + ], + "score": 1.0, + "content": "the results across different random partitions to reduce the variance of the computed metrics.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5 + }, + { + "type": "title", + "bbox": [ + 108, + 204, + 428, + 216 + ], + "lines": [ + { + "bbox": [ + 105, + 203, + 430, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 430, + 218 + ], + "score": 1.0, + "content": "4 A STUDY OF ENSEMBLING & DEEP ENSEMBLE EQUIVALENT", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 284 + ], + "lines": [ + { + "bbox": [ + 106, + 228, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 505, + 240 + ], + "score": 1.0, + "content": "Ensembles of deep neural networks have become a de-facto standard for uncertainty estimation", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 239, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 505, + 252 + ], + "score": 1.0, + "content": "and improving the quality of deep learning models (Hansen & Salamon, 1990; Krizhevsky et al.,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 250, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 505, + 262 + ], + "score": 1.0, + "content": "2009; Lakshminarayanan et al., 2017). There are two main directions of training ensembles of", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 259, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 104, + 259, + 506, + 275 + ], + "score": 1.0, + "content": "DNNs: training stochastic computation graphs and obtaining separate snapshots of neural network", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 155, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 155, + 284 + ], + "score": 1.0, + "content": "parameters.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 289, + 505, + 367 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "Methods based on the paradigm of stochastic computation graphs introduce some kind of random", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 300, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 505, + 313 + ], + "score": 1.0, + "content": "noise over the weights or activations of deep learning models. When the model is trained, each", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 324 + ], + "score": 1.0, + "content": "sample of the noise corresponds to a member of the ensemble. During test time, the predictions are", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 323, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 505, + 334 + ], + "score": 1.0, + "content": "averaged across the noise samples. These methods include (test-time) data augmentation, dropout", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 333, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 505, + 345 + ], + "score": 1.0, + "content": "(Srivastava et al., 2014; Gal & Ghahramani, 2016), variational inference (Blundell et al., 2015;", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "Kingma et al., 2015; Louizos & Welling, 2017), batch normalization (Ioffe & Szegedy, 2015; Teye", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 355, + 480, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 480, + 368 + ], + "score": 1.0, + "content": "et al., 2018; Atanov et al., 2019), Laplace approximation (Ritter et al., 2018) and many more.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 371, + 505, + 460 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 385 + ], + "score": 1.0, + "content": "Snapshot-based methods aim to obtain sets of weights for deep learning models and then to average", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 383, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 506, + 396 + ], + "score": 1.0, + "content": "the predictions across these weights. The weights can be trained independently (e.g. deep ensembles", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 394, + 506, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 506, + 407 + ], + "score": 1.0, + "content": "(Lakshminarayanan et al., 2017)), collected on different stages of a training trajectory (e.g. snapshot", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 405, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 505, + 417 + ], + "score": 1.0, + "content": "ensembles (Huang et al., 2017) and fast geometric ensembles (Garipov et al., 2018)), or obtained", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "score": 1.0, + "content": "from a sampling process (e.g. MCMC-based methods (Welling & Teh, 2011; Zhang et al., 2019)).", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 426, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 505, + 440 + ], + "score": 1.0, + "content": "These two paradigms can be combined. Some works suggest construction of ensembles of stochastic", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 438, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 506, + 450 + ], + "score": 1.0, + "content": "computation graphs (Tomczak et al., 2018), while others make use of the collected snapshots to", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 449, + 438, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 449, + 438, + 461 + ], + "score": 1.0, + "content": "construct a stochastic computation graph (Wang et al., 2018; Maddox et al., 2019).", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 465, + 505, + 543 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "score": 1.0, + "content": "In this paper we consider the following ensembling techniques: deep ensembles (Lakshminarayanan", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 475, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 104, + 475, + 505, + 490 + ], + "score": 1.0, + "content": "et al., 2017), snapshot ensembles (SSE by Huang et al. (2017)), fast geometric ensembling (FGE by", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 487, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 505, + 500 + ], + "score": 1.0, + "content": "Garipov et al. (2018)), SWA-Gaussian (SWAG by Maddox et al. (2019)), cyclical SGLD (cSGLD", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 497, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 513 + ], + "score": 1.0, + "content": "by Zhang et al. (2019)), variational inference (VI by Blundell et al. (2015)), K-FAC Laplace ap-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 509, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 505, + 523 + ], + "score": 1.0, + "content": "proximation (Ritter et al., 2018), dropout (Srivastava et al., 2014) and test-time data augmentation", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 519, + 505, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 505, + 534 + ], + "score": 1.0, + "content": "(Krizhevsky et al., 2009). These techniques were chosen to cover a diverse set of approaches keeping", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 532, + 257, + 544 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 257, + 544 + ], + "score": 1.0, + "content": "their predictive performance in mind.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 108, + 548, + 505, + 582 + ], + "lines": [ + { + "bbox": [ + 106, + 548, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 335, + 561 + ], + "score": 1.0, + "content": "All these techniques can be summarized as distributions", + "type": "text" + }, + { + "bbox": [ + 336, + 549, + 363, + 560 + ], + "score": 0.92, + "content": "q _ { m } ( \\omega )", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 548, + 432, + 561 + ], + "score": 1.0, + "content": "over parameters", + "type": "text" + }, + { + "bbox": [ + 432, + 551, + 440, + 558 + ], + "score": 0.76, + "content": "\\omega", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 548, + 505, + 561 + ], + "score": 1.0, + "content": "of computation", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 166, + 572 + ], + "score": 1.0, + "content": "graphs, where", + "type": "text" + }, + { + "bbox": [ + 167, + 561, + 176, + 569 + ], + "score": 0.71, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "stands for the technique. During testing, one can average the predictions across", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 570, + 369, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 153, + 583 + ], + "score": 1.0, + "content": "parameters", + "type": "text" + }, + { + "bbox": [ + 153, + 570, + 200, + 582 + ], + "score": 0.94, + "content": "\\omega \\sim q _ { m } ( \\omega )", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 570, + 369, + 583 + ], + "score": 1.0, + "content": "to approximate the predictive distribution", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 586, + 461, + 621 + ], + "lines": [ + { + "bbox": [ + 150, + 586, + 461, + 621 + ], + "spans": [ + { + "bbox": [ + 150, + 586, + 461, + 621 + ], + "score": 0.94, + "content": "\\hat { p } ( y _ { i } | x _ { i } ) \\approx \\int p ( y _ { i } | x _ { i } , \\omega ) q _ { m } ( \\omega ) d \\omega \\simeq \\frac { 1 } { K } \\sum _ { k = 1 } ^ { K } p ( y _ { i } | x _ { i } , \\omega _ { k } ) , \\quad \\omega _ { k } \\sim q _ { m } ( \\omega ) \\omega _ { k } ^ { \\quad \\mathrm { ~ d ~ } } ,", + "type": "interline_equation", + "image_path": "615aab3299152d4a5ee7cfc2bed94a1c921c7ad7b4aafd3981a1129aac897697.jpg" + } + ] + } + ], + "index": 41, + "virtual_lines": [ + { + "bbox": [ + 150, + 586, + 461, + 597.6666666666666 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 150, + 597.6666666666666, + 461, + 609.3333333333333 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 150, + 609.3333333333333, + 461, + 620.9999999999999 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 101, + 625, + 504, + 661 + ], + "spans": [ + { + "bbox": [ + 101, + 625, + 164, + 661 + ], + "score": 1.0, + "content": "For example,Dirac’s deltas", + "type": "text" + }, + { + "bbox": [ + 248, + 626, + 255, + 635 + ], + "score": 0.83, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 625, + 464, + 661 + ], + "score": 1.0, + "content": "rks can be represented in this form as a mix, centered at independently trained snapshots", + "type": "text" + }, + { + "bbox": [ + 475, + 625, + 496, + 661 + ], + "score": 1.0, + "content": "re of . Sim", + "type": "text" + }, + { + "bbox": [ + 496, + 626, + 504, + 635 + ], + "score": 0.81, + "content": "S", + "type": "inline_equation" + } + ], + "index": 43 + }, + { + "bbox": [ + 164, + 636, + 475, + 651 + ], + "spans": [ + { + "bbox": [ + 164, + 636, + 283, + 651 + ], + "score": 0.93, + "content": "\\begin{array} { r } { q _ { \\mathrm { { D E } } } ( \\omega ) = \\frac { 1 } { S } \\sum _ { s = 1 } ^ { S } \\delta ( \\omega - \\omega _ { s } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 639, + 475, + 649 + ], + "score": 0.83, + "content": "\\omega _ { s }", + "type": "inline_equation" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 309, + 673 + ], + "score": 1.0, + "content": "over the weight matrices and convolutional kernels", + "type": "text" + }, + { + "bbox": [ + 309, + 663, + 317, + 670 + ], + "score": 0.73, + "content": "\\omega", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 659, + 385, + 673 + ], + "score": 1.0, + "content": "is represented as", + "type": "text" + }, + { + "bbox": [ + 385, + 659, + 501, + 672 + ], + "score": 0.91, + "content": "q _ { \\mathrm { v I } } ( \\omega ) = \\mathcal { N } ( \\omega | \\mu , \\mathrm { d i a g } ( \\sigma ^ { 2 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 659, + 505, + 673 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 670, + 398, + 684 + ], + "spans": [ + { + "bbox": [ + 106, + 673, + 114, + 682 + ], + "score": 0.74, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 670, + 132, + 684 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 132, + 670, + 144, + 681 + ], + "score": 0.87, + "content": "\\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 670, + 398, + 684 + ], + "score": 1.0, + "content": "being the optimal variational means and variances respectively.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 104, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "If one considers data augmentation as a part of the computational graph, it can be parameterized", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "by the coordinates of the random crop and the flag for whether to flip the image horizontally or", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 710, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 264, + 723 + ], + "score": 1.0, + "content": "not. Sampling from the corresponding", + "type": "text" + }, + { + "bbox": [ + 264, + 711, + 297, + 722 + ], + "score": 0.92, + "content": "q _ { \\mathrm { a u g } } ( \\omega )", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 710, + 505, + 723 + ], + "score": 1.0, + "content": "would generate different ways to augment the data", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "during inference. However, as data augmentation is present by default during the training of all othe", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 48.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 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, + 505, + 138 + ], + "lines": [], + "index": 2, + "bbox_fs": [ + 105, + 83, + 506, + 140 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 143, + 505, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "In order to reduce the variance of the second approach, we perform a “test-time cross-validation”.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 154, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 506, + 167 + ], + "score": 1.0, + "content": "We randomly divide the test set into two equal parts, then compute metrics for each half of the test", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 179 + ], + "score": 1.0, + "content": "set using the temperature optimized on another half. We repeat this procedure five times and average", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 478, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 478, + 189 + ], + "score": 1.0, + "content": "the results across different random partitions to reduce the variance of the computed metrics.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 143, + 506, + 189 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 204, + 428, + 216 + ], + "lines": [ + { + "bbox": [ + 105, + 203, + 430, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 430, + 218 + ], + "score": 1.0, + "content": "4 A STUDY OF ENSEMBLING & DEEP ENSEMBLE EQUIVALENT", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 284 + ], + "lines": [ + { + "bbox": [ + 106, + 228, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 505, + 240 + ], + "score": 1.0, + "content": "Ensembles of deep neural networks have become a de-facto standard for uncertainty estimation", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 239, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 505, + 252 + ], + "score": 1.0, + "content": "and improving the quality of deep learning models (Hansen & Salamon, 1990; Krizhevsky et al.,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 250, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 505, + 262 + ], + "score": 1.0, + "content": "2009; Lakshminarayanan et al., 2017). There are two main directions of training ensembles of", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 259, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 104, + 259, + 506, + 275 + ], + "score": 1.0, + "content": "DNNs: training stochastic computation graphs and obtaining separate snapshots of neural network", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 155, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 155, + 284 + ], + "score": 1.0, + "content": "parameters.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12, + "bbox_fs": [ + 104, + 228, + 506, + 284 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 289, + 505, + 367 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "Methods based on the paradigm of stochastic computation graphs introduce some kind of random", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 300, + 505, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 505, + 313 + ], + "score": 1.0, + "content": "noise over the weights or activations of deep learning models. When the model is trained, each", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 324 + ], + "score": 1.0, + "content": "sample of the noise corresponds to a member of the ensemble. During test time, the predictions are", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 323, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 505, + 334 + ], + "score": 1.0, + "content": "averaged across the noise samples. These methods include (test-time) data augmentation, dropout", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 333, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 505, + 345 + ], + "score": 1.0, + "content": "(Srivastava et al., 2014; Gal & Ghahramani, 2016), variational inference (Blundell et al., 2015;", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 505, + 357 + ], + "score": 1.0, + "content": "Kingma et al., 2015; Louizos & Welling, 2017), batch normalization (Ioffe & Szegedy, 2015; Teye", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 355, + 480, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 480, + 368 + ], + "score": 1.0, + "content": "et al., 2018; Atanov et al., 2019), Laplace approximation (Ritter et al., 2018) and many more.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 289, + 505, + 368 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 371, + 505, + 460 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 385 + ], + "score": 1.0, + "content": "Snapshot-based methods aim to obtain sets of weights for deep learning models and then to average", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 383, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 383, + 506, + 396 + ], + "score": 1.0, + "content": "the predictions across these weights. The weights can be trained independently (e.g. deep ensembles", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 394, + 506, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 506, + 407 + ], + "score": 1.0, + "content": "(Lakshminarayanan et al., 2017)), collected on different stages of a training trajectory (e.g. snapshot", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 405, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 505, + 417 + ], + "score": 1.0, + "content": "ensembles (Huang et al., 2017) and fast geometric ensembles (Garipov et al., 2018)), or obtained", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "score": 1.0, + "content": "from a sampling process (e.g. MCMC-based methods (Welling & Teh, 2011; Zhang et al., 2019)).", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 426, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 505, + 440 + ], + "score": 1.0, + "content": "These two paradigms can be combined. Some works suggest construction of ensembles of stochastic", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 438, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 506, + 450 + ], + "score": 1.0, + "content": "computation graphs (Tomczak et al., 2018), while others make use of the collected snapshots to", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 449, + 438, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 449, + 438, + 461 + ], + "score": 1.0, + "content": "construct a stochastic computation graph (Wang et al., 2018; Maddox et al., 2019).", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 370, + 506, + 461 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 465, + 505, + 543 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "score": 1.0, + "content": "In this paper we consider the following ensembling techniques: deep ensembles (Lakshminarayanan", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 475, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 104, + 475, + 505, + 490 + ], + "score": 1.0, + "content": "et al., 2017), snapshot ensembles (SSE by Huang et al. (2017)), fast geometric ensembling (FGE by", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 487, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 505, + 500 + ], + "score": 1.0, + "content": "Garipov et al. (2018)), SWA-Gaussian (SWAG by Maddox et al. (2019)), cyclical SGLD (cSGLD", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 497, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 513 + ], + "score": 1.0, + "content": "by Zhang et al. (2019)), variational inference (VI by Blundell et al. (2015)), K-FAC Laplace ap-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 509, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 505, + 523 + ], + "score": 1.0, + "content": "proximation (Ritter et al., 2018), dropout (Srivastava et al., 2014) and test-time data augmentation", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 519, + 505, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 505, + 534 + ], + "score": 1.0, + "content": "(Krizhevsky et al., 2009). These techniques were chosen to cover a diverse set of approaches keeping", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 532, + 257, + 544 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 257, + 544 + ], + "score": 1.0, + "content": "their predictive performance in mind.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33, + "bbox_fs": [ + 104, + 464, + 506, + 544 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 548, + 505, + 582 + ], + "lines": [ + { + "bbox": [ + 106, + 548, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 335, + 561 + ], + "score": 1.0, + "content": "All these techniques can be summarized as distributions", + "type": "text" + }, + { + "bbox": [ + 336, + 549, + 363, + 560 + ], + "score": 0.92, + "content": "q _ { m } ( \\omega )", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 548, + 432, + 561 + ], + "score": 1.0, + "content": "over parameters", + "type": "text" + }, + { + "bbox": [ + 432, + 551, + 440, + 558 + ], + "score": 0.76, + "content": "\\omega", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 548, + 505, + 561 + ], + "score": 1.0, + "content": "of computation", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 166, + 572 + ], + "score": 1.0, + "content": "graphs, where", + "type": "text" + }, + { + "bbox": [ + 167, + 561, + 176, + 569 + ], + "score": 0.71, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "stands for the technique. During testing, one can average the predictions across", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 570, + 369, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 153, + 583 + ], + "score": 1.0, + "content": "parameters", + "type": "text" + }, + { + "bbox": [ + 153, + 570, + 200, + 582 + ], + "score": 0.94, + "content": "\\omega \\sim q _ { m } ( \\omega )", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 570, + 369, + 583 + ], + "score": 1.0, + "content": "to approximate the predictive distribution", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 106, + 548, + 505, + 583 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 586, + 461, + 621 + ], + "lines": [ + { + "bbox": [ + 150, + 586, + 461, + 621 + ], + "spans": [ + { + "bbox": [ + 150, + 586, + 461, + 621 + ], + "score": 0.94, + "content": "\\hat { p } ( y _ { i } | x _ { i } ) \\approx \\int p ( y _ { i } | x _ { i } , \\omega ) q _ { m } ( \\omega ) d \\omega \\simeq \\frac { 1 } { K } \\sum _ { k = 1 } ^ { K } p ( y _ { i } | x _ { i } , \\omega _ { k } ) , \\quad \\omega _ { k } \\sim q _ { m } ( \\omega ) \\omega _ { k } ^ { \\quad \\mathrm { ~ d ~ } } ,", + "type": "interline_equation", + "image_path": "615aab3299152d4a5ee7cfc2bed94a1c921c7ad7b4aafd3981a1129aac897697.jpg" + } + ] + } + ], + "index": 41, + "virtual_lines": [ + { + "bbox": [ + 150, + 586, + 461, + 597.6666666666666 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 150, + 597.6666666666666, + 461, + 609.3333333333333 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 150, + 609.3333333333333, + 461, + 620.9999999999999 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 101, + 625, + 504, + 661 + ], + "spans": [ + { + "bbox": [ + 101, + 625, + 164, + 661 + ], + "score": 1.0, + "content": "For example,Dirac’s deltas", + "type": "text" + }, + { + "bbox": [ + 248, + 626, + 255, + 635 + ], + "score": 0.83, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 625, + 464, + 661 + ], + "score": 1.0, + "content": "rks can be represented in this form as a mix, centered at independently trained snapshots", + "type": "text" + }, + { + "bbox": [ + 475, + 625, + 496, + 661 + ], + "score": 1.0, + "content": "re of . Sim", + "type": "text" + }, + { + "bbox": [ + 496, + 626, + 504, + 635 + ], + "score": 0.81, + "content": "S", + "type": "inline_equation" + } + ], + "index": 43 + }, + { + "bbox": [ + 164, + 636, + 475, + 651 + ], + "spans": [ + { + "bbox": [ + 164, + 636, + 283, + 651 + ], + "score": 0.93, + "content": "\\begin{array} { r } { q _ { \\mathrm { { D E } } } ( \\omega ) = \\frac { 1 } { S } \\sum _ { s = 1 } ^ { S } \\delta ( \\omega - \\omega _ { s } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 639, + 475, + 649 + ], + "score": 0.83, + "content": "\\omega _ { s }", + "type": "inline_equation" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 309, + 673 + ], + "score": 1.0, + "content": "over the weight matrices and convolutional kernels", + "type": "text" + }, + { + "bbox": [ + 309, + 663, + 317, + 670 + ], + "score": 0.73, + "content": "\\omega", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 659, + 385, + 673 + ], + "score": 1.0, + "content": "is represented as", + "type": "text" + }, + { + "bbox": [ + 385, + 659, + 501, + 672 + ], + "score": 0.91, + "content": "q _ { \\mathrm { v I } } ( \\omega ) = \\mathcal { N } ( \\omega | \\mu , \\mathrm { d i a g } ( \\sigma ^ { 2 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 659, + 505, + 673 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 670, + 398, + 684 + ], + "spans": [ + { + "bbox": [ + 106, + 673, + 114, + 682 + ], + "score": 0.74, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 670, + 132, + 684 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 132, + 670, + 144, + 681 + ], + "score": 0.87, + "content": "\\sigma ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 670, + 398, + 684 + ], + "score": 1.0, + "content": "being the optimal variational means and variances respectively.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5, + "bbox_fs": [ + 101, + 625, + 505, + 684 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 104, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "If one considers data augmentation as a part of the computational graph, it can be parameterized", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "by the coordinates of the random crop and the flag for whether to flip the image horizontally or", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 710, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 264, + 723 + ], + "score": 1.0, + "content": "not. Sampling from the corresponding", + "type": "text" + }, + { + "bbox": [ + 264, + 711, + 297, + 722 + ], + "score": 0.92, + "content": "q _ { \\mathrm { a u g } } ( \\omega )", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 710, + 505, + 723 + ], + "score": 1.0, + "content": "would generate different ways to augment the data", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "during inference. However, as data augmentation is present by default during the training of all othe", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 385, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "mentioned ensembling techniques, it is suitable to study it in combination with these methods and", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 396, + 454, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 454, + 408 + ], + "score": 1.0, + "content": "not as a separate ensembling technique. We perform such an evaluation in Section 4.3.", + "type": "text", + "cross_page": true + } + ], + "index": 13 + } + ], + "index": 48.5, + "bbox_fs": [ + 104, + 687, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 83, + 502, + 256 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 83, + 502, + 256 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 83, + 502, + 256 + ], + "spans": [ + { + "bbox": [ + 107, + 83, + 502, + 256 + ], + "score": 0.969, + "type": "image", + "image_path": "4c4790d017e5dfd157b34a61bcb790afb627af636464852f4f415612b476f194.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 83, + 502, + 140.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 140.66666666666666, + 502, + 198.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 198.33333333333331, + 502, + 255.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 266, + 505, + 366 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "score": 1.0, + "content": "Figure 3: The deep ensemble equivalent score (DEE) for different numbers of samples on CIFAR-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 276, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 505, + 290 + ], + "score": 1.0, + "content": "10, CIFAR-100, and ImageNet datasets averaged across different deep convolutional architectures.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 288, + 504, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 288, + 504, + 300 + ], + "score": 1.0, + "content": "A deep ensemble equivalent score (DEE) of a model is equal to the minimum size of a deep ensem-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 299, + 504, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 504, + 311 + ], + "score": 1.0, + "content": "ble (an ensemble of independently train networks) that achieves the same performance as the model", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 311, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 505, + 322 + ], + "score": 1.0, + "content": "under consideration. The score is measured in the number of models (higher is better). The area", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 321, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 505, + 334 + ], + "score": 1.0, + "content": "between average lower and upper bounds of DEE is shaded. The plot demonstrates that all of the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "score": 1.0, + "content": "ensembling techniques are far less efficient than deep ensembles during inference and fail to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 343, + 506, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 506, + 355 + ], + "score": 1.0, + "content": "produce the same level of performance as deep ensembles. The comparison that is normalized", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 354, + 286, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 286, + 366 + ], + "score": 1.0, + "content": "on training time is presented in Appendix A.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 7 + } + ], + "index": 4.0 + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 504, + 407 + ], + "lines": [ + { + "bbox": [ + 106, + 385, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "mentioned ensembling techniques, it is suitable to study it in combination with these methods and", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 396, + 454, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 454, + 408 + ], + "score": 1.0, + "content": "not as a separate ensembling technique. We perform such an evaluation in Section 4.3.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 504, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 311, + 426 + ], + "score": 1.0, + "content": "Typically, the approximation (equation 3) requires", + "type": "text" + }, + { + "bbox": [ + 311, + 413, + 321, + 423 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 412, + 505, + 426 + ], + "score": 1.0, + "content": "independent forward passes through a neural", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 424, + 418, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 418, + 436 + ], + "score": 1.0, + "content": "network, making the test-time budget directly comparable across all methods.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "title", + "bbox": [ + 108, + 448, + 260, + 459 + ], + "lines": [ + { + "bbox": [ + 105, + 447, + 262, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 262, + 461 + ], + "score": 1.0, + "content": "4.1 DEEP ENSEMBLE EQUIVALENT", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 469, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 505, + 481 + ], + "score": 1.0, + "content": "Most ensembling techniques under consideration are either bounded to a single mode, or provide", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 479, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 505, + 492 + ], + "score": 1.0, + "content": "positively correlated samples. Deep ensemble, on the other hand, is a simple technique that provides", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 491, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 505, + 502 + ], + "score": 1.0, + "content": "independent samples from different modes of the loss landscape, which, intuitively, should result in a", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 500, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 515 + ], + "score": 1.0, + "content": "better ensemble. Therefore deep ensembles can be considered a strong baseline for the performance", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 513, + 408, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 408, + 526 + ], + "score": 1.0, + "content": "of other ensembling techniques given a fixed test-time computation budget.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 529, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 542 + ], + "score": 1.0, + "content": "Comparing the performance of ensembling techniques is, however, a challenging problem. Different", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 541, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 505, + 552 + ], + "score": 1.0, + "content": "models on different datasets achieve different values of metrics; their dependence on the number of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "samples is non-trivial, and varies depending on a specific model and dataset. Values of the metrics", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 562, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 505, + 575 + ], + "score": 1.0, + "content": "are thus lacking in interpretability as the gain in performance has to be compared against a model-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 573, + 224, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 224, + 585 + ], + "score": 1.0, + "content": "and dataset-specific baseline.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 590, + 504, + 623 + ], + "lines": [ + { + "bbox": [ + 105, + 590, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 505, + 603 + ], + "score": 1.0, + "content": "Aiming to introduce perspective and interpretability in our study, we introduce the deep ensem-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 600, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 506, + 615 + ], + "score": 1.0, + "content": "ble equivalent score that employs deep ensembles to measure the performance of other ensembling", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 612, + 478, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 478, + 626 + ], + "score": 1.0, + "content": "techniques. Specifically, the deep ensemble equivalent score answers the following question:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 118, + 632, + 493, + 643 + ], + "lines": [ + { + "bbox": [ + 118, + 630, + 494, + 645 + ], + "spans": [ + { + "bbox": [ + 118, + 630, + 494, + 645 + ], + "score": 1.0, + "content": "What size of deep ensemble yields the same performance as a particular ensembling method?", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 108, + 651, + 504, + 685 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 506, + 664 + ], + "score": 1.0, + "content": "Following the insights from the previous sections, we base the deep ensemble equivalent on the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 663, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 505, + 675 + ], + "score": 1.0, + "content": "calibrated log-likelihood (CLL). Formally speaking, we define the deep ensemble equivalent (DEE)", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 674, + 397, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 674, + 213, + 686 + ], + "score": 1.0, + "content": "for an ensembling method", + "type": "text" + }, + { + "bbox": [ + 213, + 676, + 223, + 684 + ], + "score": 0.8, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 674, + 397, + 686 + ], + "score": 1.0, + "content": "and its upper and lower bounds as follows:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32 + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 687, + 469, + 732 + ], + "lines": [ + { + "bbox": [ + 141, + 687, + 469, + 732 + ], + "spans": [ + { + "bbox": [ + 141, + 687, + 469, + 732 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } & { } & { \\mathrm { D E E } _ { m } ( k ) = \\operatorname* { m i n } \\Big \\{ l \\in \\mathbb { R } , l \\geq 1 \\Big | \\mathrm { C L L } _ { D E } ^ { \\mathrm { m e a n } } ( l ) \\geq \\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n } } ( k ) \\Big \\} , \\quad } \\\\ & { } & { \\mathrm { D E E } _ { m } ^ { \\mathrm { ~ u p p e r ~ } } ( k ) = \\operatorname* { m i n } \\Big \\{ l \\in \\mathbb { R } , l \\geq 1 \\Big | \\mathrm { C L L } _ { D E } ^ { \\mathrm { m e a n } } ( l ) \\mp \\mathrm { C L L } _ { D E } ^ { \\mathrm { s t d } } ( l ) \\geq \\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n } } ( k ) \\Big \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "c05462a9cb39907fc99138255f32d42aa3aee1cda761a9264389f6f1a17fb996.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 141, + 687, + 469, + 702.0 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 141, + 702.0, + 469, + 717.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 141, + 717.0, + 469, + 732.0 + ], + "spans": [], + "index": 36 + } + ] + } + ], + "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 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": "image", + "bbox": [ + 107, + 83, + 502, + 256 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 83, + 502, + 256 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 83, + 502, + 256 + ], + "spans": [ + { + "bbox": [ + 107, + 83, + 502, + 256 + ], + "score": 0.969, + "type": "image", + "image_path": "4c4790d017e5dfd157b34a61bcb790afb627af636464852f4f415612b476f194.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 83, + 502, + 140.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 140.66666666666666, + 502, + 198.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 198.33333333333331, + 502, + 255.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 266, + 505, + 366 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "score": 1.0, + "content": "Figure 3: The deep ensemble equivalent score (DEE) for different numbers of samples on CIFAR-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 276, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 505, + 290 + ], + "score": 1.0, + "content": "10, CIFAR-100, and ImageNet datasets averaged across different deep convolutional architectures.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 288, + 504, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 288, + 504, + 300 + ], + "score": 1.0, + "content": "A deep ensemble equivalent score (DEE) of a model is equal to the minimum size of a deep ensem-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 299, + 504, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 504, + 311 + ], + "score": 1.0, + "content": "ble (an ensemble of independently train networks) that achieves the same performance as the model", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 311, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 505, + 322 + ], + "score": 1.0, + "content": "under consideration. The score is measured in the number of models (higher is better). The area", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 321, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 505, + 334 + ], + "score": 1.0, + "content": "between average lower and upper bounds of DEE is shaded. The plot demonstrates that all of the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "score": 1.0, + "content": "ensembling techniques are far less efficient than deep ensembles during inference and fail to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 343, + 506, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 506, + 355 + ], + "score": 1.0, + "content": "produce the same level of performance as deep ensembles. The comparison that is normalized", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 354, + 286, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 286, + 366 + ], + "score": 1.0, + "content": "on training time is presented in Appendix A.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 7 + } + ], + "index": 4.0 + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 504, + 407 + ], + "lines": [], + "index": 12.5, + "bbox_fs": [ + 105, + 385, + 505, + 408 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 504, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 311, + 426 + ], + "score": 1.0, + "content": "Typically, the approximation (equation 3) requires", + "type": "text" + }, + { + "bbox": [ + 311, + 413, + 321, + 423 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 412, + 505, + 426 + ], + "score": 1.0, + "content": "independent forward passes through a neural", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 424, + 418, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 418, + 436 + ], + "score": 1.0, + "content": "network, making the test-time budget directly comparable across all methods.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 412, + 505, + 436 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 448, + 260, + 459 + ], + "lines": [ + { + "bbox": [ + 105, + 447, + 262, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 262, + 461 + ], + "score": 1.0, + "content": "4.1 DEEP ENSEMBLE EQUIVALENT", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 469, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 505, + 481 + ], + "score": 1.0, + "content": "Most ensembling techniques under consideration are either bounded to a single mode, or provide", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 479, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 505, + 492 + ], + "score": 1.0, + "content": "positively correlated samples. Deep ensemble, on the other hand, is a simple technique that provides", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 491, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 505, + 502 + ], + "score": 1.0, + "content": "independent samples from different modes of the loss landscape, which, intuitively, should result in a", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 500, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 515 + ], + "score": 1.0, + "content": "better ensemble. Therefore deep ensembles can be considered a strong baseline for the performance", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 513, + 408, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 408, + 526 + ], + "score": 1.0, + "content": "of other ensembling techniques given a fixed test-time computation budget.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 469, + 505, + 526 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 529, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 542 + ], + "score": 1.0, + "content": "Comparing the performance of ensembling techniques is, however, a challenging problem. Different", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 541, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 505, + 552 + ], + "score": 1.0, + "content": "models on different datasets achieve different values of metrics; their dependence on the number of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "samples is non-trivial, and varies depending on a specific model and dataset. Values of the metrics", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 562, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 505, + 575 + ], + "score": 1.0, + "content": "are thus lacking in interpretability as the gain in performance has to be compared against a model-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 573, + 224, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 224, + 585 + ], + "score": 1.0, + "content": "and dataset-specific baseline.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 529, + 505, + 585 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 590, + 504, + 623 + ], + "lines": [ + { + "bbox": [ + 105, + 590, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 505, + 603 + ], + "score": 1.0, + "content": "Aiming to introduce perspective and interpretability in our study, we introduce the deep ensem-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 600, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 506, + 615 + ], + "score": 1.0, + "content": "ble equivalent score that employs deep ensembles to measure the performance of other ensembling", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 612, + 478, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 478, + 626 + ], + "score": 1.0, + "content": "techniques. Specifically, the deep ensemble equivalent score answers the following question:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 590, + 506, + 626 + ] + }, + { + "type": "text", + "bbox": [ + 118, + 632, + 493, + 643 + ], + "lines": [ + { + "bbox": [ + 118, + 630, + 494, + 645 + ], + "spans": [ + { + "bbox": [ + 118, + 630, + 494, + 645 + ], + "score": 1.0, + "content": "What size of deep ensemble yields the same performance as a particular ensembling method?", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 118, + 630, + 494, + 645 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 651, + 504, + 685 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 506, + 664 + ], + "score": 1.0, + "content": "Following the insights from the previous sections, we base the deep ensemble equivalent on the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 663, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 505, + 675 + ], + "score": 1.0, + "content": "calibrated log-likelihood (CLL). Formally speaking, we define the deep ensemble equivalent (DEE)", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 674, + 397, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 674, + 213, + 686 + ], + "score": 1.0, + "content": "for an ensembling method", + "type": "text" + }, + { + "bbox": [ + 213, + 676, + 223, + 684 + ], + "score": 0.8, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 674, + 397, + 686 + ], + "score": 1.0, + "content": "and its upper and lower bounds as follows:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 651, + 506, + 686 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 687, + 469, + 732 + ], + "lines": [ + { + "bbox": [ + 141, + 687, + 469, + 732 + ], + "spans": [ + { + "bbox": [ + 141, + 687, + 469, + 732 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } & { } & { \\mathrm { D E E } _ { m } ( k ) = \\operatorname* { m i n } \\Big \\{ l \\in \\mathbb { R } , l \\geq 1 \\Big | \\mathrm { C L L } _ { D E } ^ { \\mathrm { m e a n } } ( l ) \\geq \\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n } } ( k ) \\Big \\} , \\quad } \\\\ & { } & { \\mathrm { D E E } _ { m } ^ { \\mathrm { ~ u p p e r ~ } } ( k ) = \\operatorname* { m i n } \\Big \\{ l \\in \\mathbb { R } , l \\geq 1 \\Big | \\mathrm { C L L } _ { D E } ^ { \\mathrm { m e a n } } ( l ) \\mp \\mathrm { C L L } _ { D E } ^ { \\mathrm { s t d } } ( l ) \\geq \\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n } } ( k ) \\Big \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "c05462a9cb39907fc99138255f32d42aa3aee1cda761a9264389f6f1a17fb996.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 141, + 687, + 469, + 702.0 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 141, + 702.0, + 469, + 717.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 141, + 717.0, + 469, + 732.0 + ], + "spans": [], + "index": 36 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 131, + 84, + 484, + 244 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 131, + 84, + 484, + 244 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 84, + 484, + 244 + ], + "spans": [ + { + "bbox": [ + 131, + 84, + 484, + 244 + ], + "score": 0.975, + "type": "image", + "image_path": "041e736d79e230462a713217d44dd55230a471b35cac4d3728d20c81d88722e8.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 131, + 84, + 484, + 137.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 131, + 137.33333333333334, + 484, + 190.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 131, + 190.66666666666669, + 484, + 244.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 258, + 505, + 314 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 259, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 505, + 271 + ], + "score": 1.0, + "content": "Figure 4: An illustration of test-time augmentation (TTA) for an ensemble. We apply every member", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "of an ensemble to a separate random augmentation of an image. The predictions of all members", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 280, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 506, + 294 + ], + "score": 1.0, + "content": "are averaged to produce a final prediction of an ensemble. In our experiments, TTA leads to a", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 290, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 506, + 304 + ], + "score": 1.0, + "content": "significant boost of the performance for most of the ensembling techniques on ImageNet with a", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 302, + 295, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 295, + 316 + ], + "score": 1.0, + "content": "sufficient computational budget (see Figure 5).", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 339, + 505, + 399 + ], + "lines": [ + { + "bbox": [ + 102, + 334, + 509, + 355 + ], + "spans": [ + { + "bbox": [ + 102, + 334, + 135, + 355 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 338, + 200, + 352 + ], + "score": 0.91, + "content": "\\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n / s t d } } ( l )", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 334, + 509, + 355 + ], + "score": 1.0, + "content": "are the mean and the standard deviation of the calibrated log-likelihood", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 102, + 347, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 102, + 347, + 251, + 370 + ], + "score": 1.0, + "content": "achieved by an ensembling method", + "type": "text" + }, + { + "bbox": [ + 252, + 354, + 262, + 363 + ], + "score": 0.72, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 347, + 284, + 370 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 284, + 353, + 289, + 362 + ], + "score": 0.58, + "content": "l", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 347, + 382, + 370 + ], + "score": 1.0, + "content": "samples. We compute", + "type": "text" + }, + { + "bbox": [ + 383, + 352, + 429, + 365 + ], + "score": 0.83, + "content": "\\mathrm { C L L } _ { \\mathrm { D E } } ^ { \\mathrm { m e a n } } ( l )", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 347, + 448, + 370 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 448, + 351, + 489, + 365 + ], + "score": 0.8, + "content": "\\mathrm { C L L } _ { \\mathrm { D E } } ^ { \\mathrm { s t d } } ( l )", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 347, + 505, + 370 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 174, + 376 + ], + "score": 1.0, + "content": "natural numbers", + "type": "text" + }, + { + "bbox": [ + 175, + 364, + 211, + 375 + ], + "score": 0.91, + "content": "l \\in { \\mathbb { N } } _ { > 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 363, + 448, + 376 + ], + "score": 1.0, + "content": "and use linear interpolation to define them for real values", + "type": "text" + }, + { + "bbox": [ + 448, + 364, + 473, + 375 + ], + "score": 0.89, + "content": "l \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 363, + 505, + 376 + ], + "score": 1.0, + "content": ". In the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 375, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 375, + 211, + 387 + ], + "score": 1.0, + "content": "following plots we report", + "type": "text" + }, + { + "bbox": [ + 211, + 375, + 252, + 387 + ], + "score": 0.92, + "content": "\\mathrm { D E E } _ { m } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 375, + 342, + 387 + ], + "score": 1.0, + "content": "for different methods", + "type": "text" + }, + { + "bbox": [ + 342, + 376, + 352, + 385 + ], + "score": 0.7, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 375, + 494, + 387 + ], + "score": 1.0, + "content": "with different numbers of samples", + "type": "text" + }, + { + "bbox": [ + 495, + 375, + 501, + 385 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 375, + 505, + 387 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 102, + 381, + 507, + 405 + ], + "spans": [ + { + "bbox": [ + 102, + 381, + 373, + 405 + ], + "score": 1.0, + "content": "and shade the area between the respective lower and upper bounds", + "type": "text" + }, + { + "bbox": [ + 373, + 386, + 426, + 399 + ], + "score": 0.9, + "content": "\\mathrm { D E E } _ { m } ^ { \\mathrm { l o w e r } } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 381, + 444, + 405 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 444, + 387, + 498, + 399 + ], + "score": 0.9, + "content": "\\mathrm { D E E } _ { m } ^ { \\mathrm { u p p e r } } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 498, + 381, + 507, + 405 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10 + }, + { + "type": "title", + "bbox": [ + 107, + 417, + 193, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 195, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 195, + 429 + ], + "score": 1.0, + "content": "4.2 EXPERIMENTS", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 439, + 505, + 527 + ], + "lines": [ + { + "bbox": [ + 106, + 439, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 505, + 452 + ], + "score": 1.0, + "content": "We compute the deep ensemble equivalent (DEE) of various ensembling techniques for four popular", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "score": 1.0, + "content": "deep architectures: VGG16 (Simonyan & Zisserman, 2014), PreResNet110/164 (He et al., 2016),", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 461, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 474 + ], + "score": 1.0, + "content": "and WideResNet28x10 (Zagoruyko & Komodakis, 2016) on CIFAR-10/100 datasets (Krizhevsky", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 472, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 506, + 485 + ], + "score": 1.0, + "content": "et al., 2009), and ResNet50 (He et al., 2016) on ImageNet dataset (Russakovsky et al., 2015). We", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "use PyTorch (Paszke et al., 2017) for implementation of these models, building upon available public", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 495, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 506 + ], + "score": 1.0, + "content": "implementations. Our implementation closely matches the quality of methods that has been reported", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "score": 1.0, + "content": "in original works. Technical details on training, hyperparameters and implementations can be found", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 515, + 446, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 446, + 530 + ], + "score": 1.0, + "content": "in Appendix B. The source code and all computed metrics are available on GitHub1.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 533, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "As one can see on Figure 3, ensembling methods clearly fall into three categories. SSE and cSGLD", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 544, + 506, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 506, + 557 + ], + "score": 1.0, + "content": "outperform all other techniques except deep ensembles and enjoy a near-linear scaling of DEE with", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "the number of samples on CIFAR datasets. The investigation of weight-space trajectories of cSGLD", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 566, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 578 + ], + "score": 1.0, + "content": "and SSE (Huang et al., 2017; Zhang et al., 2019) suggests that these methods can efficiently explore", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "different modes of the loss landscape. In terms of the deep ensemble equivalent, these methods do", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "not saturate unlike other methods that are bound to a single mode. We found SSE to still saturate", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 599, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 506, + 612 + ], + "score": 1.0, + "content": "on ImageNet. This is likely due to suboptimal hyperparameters of the cyclic learning rate schedule.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 609, + 489, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 489, + 622 + ], + "score": 1.0, + "content": "More verbose results are presented in Figures 11–13 and in Table 5 and Table 8 in Appendix C.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 504, + 704 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "score": 1.0, + "content": "In our experiments SSE typically outperforms cSGLD. This is mostly due to the fact that SSE", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "score": 1.0, + "content": "has a much larger training budget. The cycle lengths and learning rates of SSE and cSGLD are", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 649, + 504, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 504, + 661 + ], + "score": 1.0, + "content": "comparable, however, SSE collects one snapshot per cycle while cSGLD collects three snapshots.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 659, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 506, + 672 + ], + "score": 1.0, + "content": "This makes samples from SSE less correlated with each other while increasing the training budget", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 669, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 506, + 685 + ], + "score": 1.0, + "content": "threefold. Both SSE and cSGLD can be adjusted to obtain a different trade-off between the training", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 681, + 506, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 506, + 695 + ], + "score": 1.0, + "content": "budget and the DEE-to-samples ratio. We reused the schedules provided in the original papers", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 693, + 269, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 269, + 705 + ], + "score": 1.0, + "content": "(Huang et al., 2017; Zhang et al., 2019).", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 118, + 722, + 427, + 732 + ], + "lines": [ + { + "bbox": [ + 119, + 720, + 428, + 734 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 428, + 734 + ], + "score": 1.0, + "content": "1Source code: https://github.com/bayesgroup/pytorch-ensembles", + "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 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 300, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 11, + "width": 9 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 131, + 84, + 484, + 244 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 131, + 84, + 484, + 244 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 84, + 484, + 244 + ], + "spans": [ + { + "bbox": [ + 131, + 84, + 484, + 244 + ], + "score": 0.975, + "type": "image", + "image_path": "041e736d79e230462a713217d44dd55230a471b35cac4d3728d20c81d88722e8.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 131, + 84, + 484, + 137.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 131, + 137.33333333333334, + 484, + 190.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 131, + 190.66666666666669, + 484, + 244.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 258, + 505, + 314 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 259, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 505, + 271 + ], + "score": 1.0, + "content": "Figure 4: An illustration of test-time augmentation (TTA) for an ensemble. We apply every member", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "of an ensemble to a separate random augmentation of an image. The predictions of all members", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 280, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 506, + 294 + ], + "score": 1.0, + "content": "are averaged to produce a final prediction of an ensemble. In our experiments, TTA leads to a", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 290, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 506, + 304 + ], + "score": 1.0, + "content": "significant boost of the performance for most of the ensembling techniques on ImageNet with a", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 302, + 295, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 295, + 316 + ], + "score": 1.0, + "content": "sufficient computational budget (see Figure 5).", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 339, + 505, + 399 + ], + "lines": [ + { + "bbox": [ + 102, + 334, + 509, + 355 + ], + "spans": [ + { + "bbox": [ + 102, + 334, + 135, + 355 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 338, + 200, + 352 + ], + "score": 0.91, + "content": "\\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n / s t d } } ( l )", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 334, + 509, + 355 + ], + "score": 1.0, + "content": "are the mean and the standard deviation of the calibrated log-likelihood", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 102, + 347, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 102, + 347, + 251, + 370 + ], + "score": 1.0, + "content": "achieved by an ensembling method", + "type": "text" + }, + { + "bbox": [ + 252, + 354, + 262, + 363 + ], + "score": 0.72, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 347, + 284, + 370 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 284, + 353, + 289, + 362 + ], + "score": 0.58, + "content": "l", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 347, + 382, + 370 + ], + "score": 1.0, + "content": "samples. We compute", + "type": "text" + }, + { + "bbox": [ + 383, + 352, + 429, + 365 + ], + "score": 0.83, + "content": "\\mathrm { C L L } _ { \\mathrm { D E } } ^ { \\mathrm { m e a n } } ( l )", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 347, + 448, + 370 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 448, + 351, + 489, + 365 + ], + "score": 0.8, + "content": "\\mathrm { C L L } _ { \\mathrm { D E } } ^ { \\mathrm { s t d } } ( l )", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 347, + 505, + 370 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 174, + 376 + ], + "score": 1.0, + "content": "natural numbers", + "type": "text" + }, + { + "bbox": [ + 175, + 364, + 211, + 375 + ], + "score": 0.91, + "content": "l \\in { \\mathbb { N } } _ { > 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 363, + 448, + 376 + ], + "score": 1.0, + "content": "and use linear interpolation to define them for real values", + "type": "text" + }, + { + "bbox": [ + 448, + 364, + 473, + 375 + ], + "score": 0.89, + "content": "l \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 363, + 505, + 376 + ], + "score": 1.0, + "content": ". In the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 375, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 375, + 211, + 387 + ], + "score": 1.0, + "content": "following plots we report", + "type": "text" + }, + { + "bbox": [ + 211, + 375, + 252, + 387 + ], + "score": 0.92, + "content": "\\mathrm { D E E } _ { m } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 375, + 342, + 387 + ], + "score": 1.0, + "content": "for different methods", + "type": "text" + }, + { + "bbox": [ + 342, + 376, + 352, + 385 + ], + "score": 0.7, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 375, + 494, + 387 + ], + "score": 1.0, + "content": "with different numbers of samples", + "type": "text" + }, + { + "bbox": [ + 495, + 375, + 501, + 385 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 375, + 505, + 387 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 102, + 381, + 507, + 405 + ], + "spans": [ + { + "bbox": [ + 102, + 381, + 373, + 405 + ], + "score": 1.0, + "content": "and shade the area between the respective lower and upper bounds", + "type": "text" + }, + { + "bbox": [ + 373, + 386, + 426, + 399 + ], + "score": 0.9, + "content": "\\mathrm { D E E } _ { m } ^ { \\mathrm { l o w e r } } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 381, + 444, + 405 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 444, + 387, + 498, + 399 + ], + "score": 0.9, + "content": "\\mathrm { D E E } _ { m } ^ { \\mathrm { u p p e r } } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 498, + 381, + 507, + 405 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10, + "bbox_fs": [ + 102, + 334, + 509, + 405 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 417, + 193, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 195, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 195, + 429 + ], + "score": 1.0, + "content": "4.2 EXPERIMENTS", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 439, + 505, + 527 + ], + "lines": [ + { + "bbox": [ + 106, + 439, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 505, + 452 + ], + "score": 1.0, + "content": "We compute the deep ensemble equivalent (DEE) of various ensembling techniques for four popular", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "score": 1.0, + "content": "deep architectures: VGG16 (Simonyan & Zisserman, 2014), PreResNet110/164 (He et al., 2016),", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 461, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 474 + ], + "score": 1.0, + "content": "and WideResNet28x10 (Zagoruyko & Komodakis, 2016) on CIFAR-10/100 datasets (Krizhevsky", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 472, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 506, + 485 + ], + "score": 1.0, + "content": "et al., 2009), and ResNet50 (He et al., 2016) on ImageNet dataset (Russakovsky et al., 2015). We", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "use PyTorch (Paszke et al., 2017) for implementation of these models, building upon available public", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 495, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 506 + ], + "score": 1.0, + "content": "implementations. Our implementation closely matches the quality of methods that has been reported", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 506, + 518 + ], + "score": 1.0, + "content": "in original works. Technical details on training, hyperparameters and implementations can be found", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 515, + 446, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 446, + 530 + ], + "score": 1.0, + "content": "in Appendix B. The source code and all computed metrics are available on GitHub1.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 439, + 506, + 530 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 533, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "As one can see on Figure 3, ensembling methods clearly fall into three categories. SSE and cSGLD", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 544, + 506, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 506, + 557 + ], + "score": 1.0, + "content": "outperform all other techniques except deep ensembles and enjoy a near-linear scaling of DEE with", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "the number of samples on CIFAR datasets. The investigation of weight-space trajectories of cSGLD", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 566, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 578 + ], + "score": 1.0, + "content": "and SSE (Huang et al., 2017; Zhang et al., 2019) suggests that these methods can efficiently explore", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "different modes of the loss landscape. In terms of the deep ensemble equivalent, these methods do", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "not saturate unlike other methods that are bound to a single mode. We found SSE to still saturate", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 599, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 506, + 612 + ], + "score": 1.0, + "content": "on ImageNet. This is likely due to suboptimal hyperparameters of the cyclic learning rate schedule.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 609, + 489, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 489, + 622 + ], + "score": 1.0, + "content": "More verbose results are presented in Figures 11–13 and in Table 5 and Table 8 in Appendix C.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 533, + 506, + 622 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 504, + 704 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "score": 1.0, + "content": "In our experiments SSE typically outperforms cSGLD. This is mostly due to the fact that SSE", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "score": 1.0, + "content": "has a much larger training budget. The cycle lengths and learning rates of SSE and cSGLD are", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 649, + 504, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 504, + 661 + ], + "score": 1.0, + "content": "comparable, however, SSE collects one snapshot per cycle while cSGLD collects three snapshots.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 659, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 506, + 672 + ], + "score": 1.0, + "content": "This makes samples from SSE less correlated with each other while increasing the training budget", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 669, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 506, + 685 + ], + "score": 1.0, + "content": "threefold. Both SSE and cSGLD can be adjusted to obtain a different trade-off between the training", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 681, + 506, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 506, + 695 + ], + "score": 1.0, + "content": "budget and the DEE-to-samples ratio. We reused the schedules provided in the original papers", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 693, + 269, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 269, + 705 + ], + "score": 1.0, + "content": "(Huang et al., 2017; Zhang et al., 2019).", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 626, + 506, + 705 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 128, + 84, + 482, + 231 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 128, + 84, + 482, + 231 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 128, + 84, + 482, + 231 + ], + "spans": [ + { + "bbox": [ + 128, + 84, + 482, + 231 + ], + "score": 0.969, + "type": "image", + "image_path": "3514525c9717703869980514d722dbb583156e3303e2ad13660f10f30a57c3ac.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 128, + 84, + 482, + 133.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 128, + 133.0, + 482, + 182.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 128, + 182.0, + 482, + 231.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 244, + 505, + 352 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 244, + 504, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 236, + 258 + ], + "score": 1.0, + "content": "Figure 5: How to read results:", + "type": "text" + }, + { + "bbox": [ + 236, + 244, + 380, + 264 + ], + "score": 0.46, + "content": "\\times \\ \\frac { \\mathrm { \\ t e s t { - } t i m e \\ a u g } } { 1 0 \\ \\mathrm { s a m p l e s } } \\quad \\Phi , \\times \\ \\frac { \\mathrm { \\ t e s t { - } t i m e \\ a u g } } { 5 0 \\ \\mathrm { s a m p l e s } } \\quad \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 250, + 381, + 256 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 385, + 244, + 504, + 261 + ], + "score": 1.0, + "content": "The negative calibrated log-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 263, + 504, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 504, + 276 + ], + "score": 1.0, + "content": "likelihood (lower is better) for different ensembling techniques on ImageNet. We report perfor-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 312, + 286 + ], + "score": 1.0, + "content": "mance for two regimes. Central-crop evaluation", + "type": "text" + }, + { + "bbox": [ + 312, + 276, + 335, + 286 + ], + "score": 0.88, + "content": "( \\times \\times )", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "means every member of an ensemble is", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 286, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 506, + 297 + ], + "score": 1.0, + "content": "applied to a central crop of an image, and test-time data augmentation ( ) means each member of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 297, + 504, + 308 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 504, + 308 + ], + "score": 1.0, + "content": "the ensemble is applied to a separate random augmentation of the image. Test-time data augmen-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 306, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 506, + 320 + ], + "score": 1.0, + "content": "tation significantly improves ensembles with no additional computational cost. Interestingly, a", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "score": 1.0, + "content": "single model with TTA performs competitively with methods that require significantly larger param-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "score": 1.0, + "content": "eters budget, and training complexity, e.g., a single model with TTA performs closely to pure deep", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 341, + 241, + 353 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 241, + 353 + ], + "score": 1.0, + "content": "ensembles (DE) of the same size.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 7 + } + ], + "index": 4.0 + }, + { + "type": "text", + "bbox": [ + 107, + 372, + 505, + 472 + ], + "lines": [ + { + "bbox": [ + 105, + 372, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 387 + ], + "score": 1.0, + "content": "Being more “local” methods, FGE and SWAG perform worse than SSE and cSGLD, but still sig-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "nificantly outperform “single-snapshot” methods like dropout, K-FAC Laplace approximation and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 396, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 505, + 408 + ], + "score": 1.0, + "content": "variational inference. We hypothesize that by covering a single mode with a set of snapshots, FGE", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "score": 1.0, + "content": "and SWAG provide a better fit for the local geometry than models trained as stochastic computation", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "score": 1.0, + "content": "graphs. This implies that the performance of FGE and SWAG should be achievable by single-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 428, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 106, + 428, + 505, + 440 + ], + "score": 1.0, + "content": "snapshot methods. However, one might need more elaborate posterior approximations and better", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 438, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 505, + 452 + ], + "score": 1.0, + "content": "inference techniques in order to match the performance of FGE and SWAG by training a stochastic", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "score": 1.0, + "content": "computation graph end-to-end (as opposed to SWAG that constructs a stochastic computation graph", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 461, + 149, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 149, + 474 + ], + "score": 1.0, + "content": "post-hoc).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 478, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 106, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "The deep ensemble equivalent curves allow us to notice the common behaviour of different methods,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "e.g. the relation between deep ensembles, snapshot methods, advanced local methods and single-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 500, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 512 + ], + "score": 1.0, + "content": "snapshot local methods. They also allow us to notice inconsistencies that may indicate a suboptimal", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "choice of hyperparameters. For example, we find that SSE on ImageNet quickly saturates, unlike", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 521, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 506, + 534 + ], + "score": 1.0, + "content": "SSE on CIFAR datasets (Figure 3). This may indicate that the hyperparameters used on ImageNet", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "score": 1.0, + "content": "are not good enough for efficient coverage of different modes of the loss landscape. We also find", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 542, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 505, + 558 + ], + "score": 1.0, + "content": "that SSE on WideResNet on CIFAR-10 achieves a DEE score of 100 on approx. 70 samples (Fig-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "ure 12). This may indicate that the members of the deep ensemble for this dataset-architecture pair", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 565, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 104, + 565, + 506, + 578 + ], + "score": 1.0, + "content": "are underfitted and may benefit from longer training or a different learning rate schedule. Such", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 577, + 464, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 464, + 589 + ], + "score": 1.0, + "content": "inconsistencies might be more difficult to spot using plain calibrated log-likelihood plots.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 25.5 + }, + { + "type": "title", + "bbox": [ + 108, + 601, + 422, + 612 + ], + "lines": [ + { + "bbox": [ + 106, + 601, + 424, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 424, + 613 + ], + "score": 1.0, + "content": "4.3 TEST-TIME DATA AUGMENTATION IMPROVES ENSEMBLES FOR FREE", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "Data augmentation is a time-honored technique that is widely used in deep learning, and is a crucial", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "score": 1.0, + "content": "component for training modern DNNs. Test-time data augmentation has been used for a long time to", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "improve the performance of convolutional networks. For example, multi-crop evaluation has been a", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "standard procedure for the ImageNet challenge (Simonyan & Zisserman, 2014; Szegedy et al., 2015;", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "He et al., 2016). It is, however, often overlooked in the literature on ensembling techniques in deep", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "score": 1.0, + "content": "learning. In this section, we study the effect of test-time data augmentation on the aforementioned", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "ensembling techniques. To keep the test-time computation budget the same, we sample one random", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "augmentation for each member of an ensemble. Figure 5 reports the calibrated log-likelihood on", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "combination of ensembles and test-time data augmentation for ImageNet. Other metrics and results", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "on CIFAR-10/100 datasets are reported in Appendix C. We have used the standard data augmen-", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 36.5 + } + ], + "page_idx": 8, + "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": [ + 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": [ + 128, + 84, + 482, + 231 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 128, + 84, + 482, + 231 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 128, + 84, + 482, + 231 + ], + "spans": [ + { + "bbox": [ + 128, + 84, + 482, + 231 + ], + "score": 0.969, + "type": "image", + "image_path": "3514525c9717703869980514d722dbb583156e3303e2ad13660f10f30a57c3ac.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 128, + 84, + 482, + 133.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 128, + 133.0, + 482, + 182.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 128, + 182.0, + 482, + 231.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 244, + 505, + 352 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 244, + 504, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 247, + 236, + 258 + ], + "score": 1.0, + "content": "Figure 5: How to read results:", + "type": "text" + }, + { + "bbox": [ + 236, + 244, + 380, + 264 + ], + "score": 0.46, + "content": "\\times \\ \\frac { \\mathrm { \\ t e s t { - } t i m e \\ a u g } } { 1 0 \\ \\mathrm { s a m p l e s } } \\quad \\Phi , \\times \\ \\frac { \\mathrm { \\ t e s t { - } t i m e \\ a u g } } { 5 0 \\ \\mathrm { s a m p l e s } } \\quad \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 250, + 381, + 256 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 385, + 244, + 504, + 261 + ], + "score": 1.0, + "content": "The negative calibrated log-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 263, + 504, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 504, + 276 + ], + "score": 1.0, + "content": "likelihood (lower is better) for different ensembling techniques on ImageNet. We report perfor-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 312, + 286 + ], + "score": 1.0, + "content": "mance for two regimes. Central-crop evaluation", + "type": "text" + }, + { + "bbox": [ + 312, + 276, + 335, + 286 + ], + "score": 0.88, + "content": "( \\times \\times )", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "means every member of an ensemble is", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 286, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 506, + 297 + ], + "score": 1.0, + "content": "applied to a central crop of an image, and test-time data augmentation ( ) means each member of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 297, + 504, + 308 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 504, + 308 + ], + "score": 1.0, + "content": "the ensemble is applied to a separate random augmentation of the image. Test-time data augmen-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 306, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 506, + 320 + ], + "score": 1.0, + "content": "tation significantly improves ensembles with no additional computational cost. Interestingly, a", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "score": 1.0, + "content": "single model with TTA performs competitively with methods that require significantly larger param-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 505, + 343 + ], + "score": 1.0, + "content": "eters budget, and training complexity, e.g., a single model with TTA performs closely to pure deep", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 341, + 241, + 353 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 241, + 353 + ], + "score": 1.0, + "content": "ensembles (DE) of the same size.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 7 + } + ], + "index": 4.0 + }, + { + "type": "text", + "bbox": [ + 107, + 372, + 505, + 472 + ], + "lines": [ + { + "bbox": [ + 105, + 372, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 372, + 505, + 387 + ], + "score": 1.0, + "content": "Being more “local” methods, FGE and SWAG perform worse than SSE and cSGLD, but still sig-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "nificantly outperform “single-snapshot” methods like dropout, K-FAC Laplace approximation and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 396, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 505, + 408 + ], + "score": 1.0, + "content": "variational inference. We hypothesize that by covering a single mode with a set of snapshots, FGE", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "score": 1.0, + "content": "and SWAG provide a better fit for the local geometry than models trained as stochastic computation", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "score": 1.0, + "content": "graphs. This implies that the performance of FGE and SWAG should be achievable by single-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 428, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 106, + 428, + 505, + 440 + ], + "score": 1.0, + "content": "snapshot methods. However, one might need more elaborate posterior approximations and better", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 438, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 505, + 452 + ], + "score": 1.0, + "content": "inference techniques in order to match the performance of FGE and SWAG by training a stochastic", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "score": 1.0, + "content": "computation graph end-to-end (as opposed to SWAG that constructs a stochastic computation graph", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 461, + 149, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 149, + 474 + ], + "score": 1.0, + "content": "post-hoc).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 372, + 505, + 474 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 478, + 505, + 588 + ], + "lines": [ + { + "bbox": [ + 106, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "The deep ensemble equivalent curves allow us to notice the common behaviour of different methods,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 505, + 502 + ], + "score": 1.0, + "content": "e.g. the relation between deep ensembles, snapshot methods, advanced local methods and single-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 500, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 512 + ], + "score": 1.0, + "content": "snapshot local methods. They also allow us to notice inconsistencies that may indicate a suboptimal", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "choice of hyperparameters. For example, we find that SSE on ImageNet quickly saturates, unlike", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 521, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 506, + 534 + ], + "score": 1.0, + "content": "SSE on CIFAR datasets (Figure 3). This may indicate that the hyperparameters used on ImageNet", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "score": 1.0, + "content": "are not good enough for efficient coverage of different modes of the loss landscape. We also find", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 542, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 505, + 558 + ], + "score": 1.0, + "content": "that SSE on WideResNet on CIFAR-10 achieves a DEE score of 100 on approx. 70 samples (Fig-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "ure 12). This may indicate that the members of the deep ensemble for this dataset-architecture pair", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 565, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 104, + 565, + 506, + 578 + ], + "score": 1.0, + "content": "are underfitted and may benefit from longer training or a different learning rate schedule. Such", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 577, + 464, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 464, + 589 + ], + "score": 1.0, + "content": "inconsistencies might be more difficult to spot using plain calibrated log-likelihood plots.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 25.5, + "bbox_fs": [ + 104, + 477, + 506, + 589 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 601, + 422, + 612 + ], + "lines": [ + { + "bbox": [ + 106, + 601, + 424, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 424, + 613 + ], + "score": 1.0, + "content": "4.3 TEST-TIME DATA AUGMENTATION IMPROVES ENSEMBLES FOR FREE", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "Data augmentation is a time-honored technique that is widely used in deep learning, and is a crucial", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "score": 1.0, + "content": "component for training modern DNNs. Test-time data augmentation has been used for a long time to", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "improve the performance of convolutional networks. For example, multi-crop evaluation has been a", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "standard procedure for the ImageNet challenge (Simonyan & Zisserman, 2014; Szegedy et al., 2015;", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "He et al., 2016). It is, however, often overlooked in the literature on ensembling techniques in deep", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "score": 1.0, + "content": "learning. In this section, we study the effect of test-time data augmentation on the aforementioned", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "ensembling techniques. To keep the test-time computation budget the same, we sample one random", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "augmentation for each member of an ensemble. Figure 5 reports the calibrated log-likelihood on", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "combination of ensembles and test-time data augmentation for ImageNet. Other metrics and results", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "on CIFAR-10/100 datasets are reported in Appendix C. We have used the standard data augmen-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "tation: random horizontal flips and random padded crops for CIFAR-10/100 datasets, and random", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 466, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 466, + 106 + ], + "score": 1.0, + "content": "horizontal flips and random resized crops for ImageNet (see more details in Appendix B).", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 622, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 503, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "tation: random horizontal flips and random padded crops for CIFAR-10/100 datasets, and random", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 466, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 466, + 106 + ], + "score": 1.0, + "content": "horizontal flips and random resized crops for ImageNet (see more details in Appendix B).", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 505, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 505, + 124 + ], + "score": 1.0, + "content": "Test-time data augmentation (Figure 4) consistently improves most ensembling methods, especially", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "on ImageNet, where we see a clear improvement across all methods (Figure 5 and Table 7). The", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "performance gain for powerful ensembles (deep ensembles, SSE and cSGLD) on CIFAR datasets", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "is not as dramatic (Figures 14–15 and Table 4). This is likely due to the fact that CIFAR images", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 155, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 505, + 167 + ], + "score": 1.0, + "content": "are small, making data augmentation limited, whereas images from ImageNet allow for a large", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "number of diverse samples of augmented images. On the other hand, while the performance of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "“single-snapshot” methods (e.g. variational inference, K-FAC Laplace and dropout) is improved", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 188, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 188, + 505, + 200 + ], + "score": 1.0, + "content": "significantly, they perform approximately as good as an augmented version of a single model across", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 163, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 163, + 210 + ], + "score": 1.0, + "content": "all datasets.w", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 215, + 505, + 281 + ], + "lines": [ + { + "bbox": [ + 106, + 216, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 505, + 227 + ], + "score": 1.0, + "content": "Interestingly, test-time data augmentation on ImageNet improves accuracy but decreases the un-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 238 + ], + "score": 1.0, + "content": "calibrated log-likelihood of deep ensembles (Table 7 in Appendix C). Test-time data augmentation", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "breaks the nearly optimal temperature of deep ensembles and requires temperature scaling to reveal", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 248, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 505, + 259 + ], + "score": 1.0, + "content": "the actual performance of the method, as discussed in Section 3.1. The experiment demonstrates", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "score": 1.0, + "content": "that ensembles may be highly miscalibrated by default while still providing superior predictive per-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 270, + 214, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 214, + 281 + ], + "score": 1.0, + "content": "formance after calibration.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 286, + 505, + 375 + ], + "lines": [ + { + "bbox": [ + 106, + 286, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 506, + 299 + ], + "score": 1.0, + "content": "We would like to note that test-time data augmentation does not always break the calibration of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 298, + 506, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 506, + 310 + ], + "score": 1.0, + "content": "an ensemble, and, on the contrary, test-time data augmentation often improves the calibration of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 309, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 321 + ], + "score": 1.0, + "content": "an ensemble. In our experiments, decalibration was caused by the extreme magnitude of a random", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 319, + 506, + 332 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 506, + 332 + ], + "score": 1.0, + "content": "crop, that is conventionally used for ImageNet augmentation. Using less extreme magnitude of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "random crop fixes decalibration, that makes test-time data augmentation a more practical method", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "that provides out-of-the-box calibration. Although, as we demonstrated earlier, there is no guarantee", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "score": 1.0, + "content": "that any ensemble is calibrated out-of-the-box. If we are willing to apply post-hoc calibration, the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 363, + 392, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 392, + 376 + ], + "score": 1.0, + "content": "final performance can be much better with more severe augmentations.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5 + }, + { + "type": "title", + "bbox": [ + 108, + 390, + 274, + 403 + ], + "lines": [ + { + "bbox": [ + 104, + 388, + 277, + 406 + ], + "spans": [ + { + "bbox": [ + 104, + 388, + 277, + 406 + ], + "score": 1.0, + "content": "5 DISCUSSION & CONCLUSION", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 504, + 437 + ], + "lines": [ + { + "bbox": [ + 106, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 505, + 428 + ], + "score": 1.0, + "content": "We have explored the field of in-domain uncertainty estimation and performed an extensive evalua-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 426, + 465, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 465, + 438 + ], + "score": 1.0, + "content": "tion of modern ensembling techniques. Our main findings can be summarized as follows:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 132, + 446, + 505, + 679 + ], + "lines": [ + { + "bbox": [ + 133, + 447, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 133, + 447, + 505, + 457 + ], + "score": 1.0, + "content": "• Temperature scaling is a must even for ensembles. While ensembles generally have bet-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 142, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 142, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "ter calibration out-of-the-box, they are not calibrated perfectly and can benefit from the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 141, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "procedure. A comparison of log-likelihoods of different ensembling methods without tem-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 479, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 141, + 479, + 505, + 492 + ], + "score": 1.0, + "content": "perature scaling might not provide a fair ranking, especially if some models happen to be", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 491, + 201, + 500 + ], + "spans": [ + { + "bbox": [ + 141, + 491, + 201, + 500 + ], + "score": 1.0, + "content": "miscalibrated.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 140, + 504, + 506, + 517 + ], + "spans": [ + { + "bbox": [ + 140, + 504, + 506, + 517 + ], + "score": 1.0, + "content": "Many common metrics for measuring in-domain uncertainty are either unreliable (ECE and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 142, + 516, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 142, + 516, + 505, + 527 + ], + "score": 1.0, + "content": "analogues) or cannot be used to compare different methods (AUC-ROC, AUC-PR for mis-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 526, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 141, + 526, + 505, + 538 + ], + "score": 1.0, + "content": "classification detection; accuracy-confidence curves). In order to perform a fair comparison", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 142, + 537, + 394, + 549 + ], + "spans": [ + { + "bbox": [ + 142, + 537, + 394, + 549 + ], + "score": 1.0, + "content": "of different methods, one needs to be cautious of these pitfalls.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 141, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 141, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "Many popular ensembling techniques require dozens of samples for test-time averaging, yet", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 141, + 563, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 141, + 563, + 505, + 574 + ], + "score": 1.0, + "content": "are essentially equivalent to a handful of independently trained models. Deep ensembles", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 141, + 573, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 141, + 573, + 505, + 586 + ], + "score": 1.0, + "content": "dominate other methods given a fixed test-time budget. The results indicate, in particu-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 141, + 584, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 141, + 584, + 505, + 597 + ], + "score": 1.0, + "content": "lar, that exploration of different modes in the loss landscape is crucial for good predictive", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 142, + 596, + 198, + 607 + ], + "spans": [ + { + "bbox": [ + 142, + 596, + 198, + 607 + ], + "score": 1.0, + "content": "performance.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 133, + 609, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 133, + 609, + 505, + 622 + ], + "score": 1.0, + "content": "• Methods that are stuck in a single mode are unable to compete with methods that are de-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 141, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 141, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "signed to explore different modes of the loss landscape. Would more elaborate posterior", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 141, + 632, + 404, + 645 + ], + "spans": [ + { + "bbox": [ + 141, + 632, + 404, + 645 + ], + "score": 1.0, + "content": "approximations and better inference techniques shorten this gap?", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 140, + 646, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 140, + 646, + 505, + 659 + ], + "score": 1.0, + "content": "Test-time data augmentation is a surprisingly strong baseline for in-domain uncertainty", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 142, + 658, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 142, + 658, + 505, + 670 + ], + "score": 1.0, + "content": "estimation. It can significantly improve other methods without increasing training time or", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 141, + 668, + 454, + 681 + ], + "spans": [ + { + "bbox": [ + 141, + 668, + 454, + 681 + ], + "score": 1.0, + "content": "model size since data augmentation is usually already present during training.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 108, + 688, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "Our takeaways are aligned with the take-home messages of Ovadia et al. (2019) that relate to in-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "domain uncertainty estimation. We also observe a stable ordering of different methods in our exper-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "iments, and observe that deep ensembles with few members outperform methods based on stochastic", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 721, + 190, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 190, + 732 + ], + "score": 1.0, + "content": "computation graphs.", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 49.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 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 301, + 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": "text", + "bbox": [ + 105, + 82, + 503, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 505, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 505, + 124 + ], + "score": 1.0, + "content": "Test-time data augmentation (Figure 4) consistently improves most ensembling methods, especially", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "on ImageNet, where we see a clear improvement across all methods (Figure 5 and Table 7). The", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "performance gain for powerful ensembles (deep ensembles, SSE and cSGLD) on CIFAR datasets", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "is not as dramatic (Figures 14–15 and Table 4). This is likely due to the fact that CIFAR images", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 155, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 505, + 167 + ], + "score": 1.0, + "content": "are small, making data augmentation limited, whereas images from ImageNet allow for a large", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "number of diverse samples of augmented images. On the other hand, while the performance of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "“single-snapshot” methods (e.g. variational inference, K-FAC Laplace and dropout) is improved", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 188, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 188, + 505, + 200 + ], + "score": 1.0, + "content": "significantly, they perform approximately as good as an augmented version of a single model across", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 163, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 163, + 210 + ], + "score": 1.0, + "content": "all datasets.w", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 109, + 506, + 210 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 215, + 505, + 281 + ], + "lines": [ + { + "bbox": [ + 106, + 216, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 505, + 227 + ], + "score": 1.0, + "content": "Interestingly, test-time data augmentation on ImageNet improves accuracy but decreases the un-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 238 + ], + "score": 1.0, + "content": "calibrated log-likelihood of deep ensembles (Table 7 in Appendix C). Test-time data augmentation", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "breaks the nearly optimal temperature of deep ensembles and requires temperature scaling to reveal", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 248, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 505, + 259 + ], + "score": 1.0, + "content": "the actual performance of the method, as discussed in Section 3.1. The experiment demonstrates", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "score": 1.0, + "content": "that ensembles may be highly miscalibrated by default while still providing superior predictive per-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 270, + 214, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 214, + 281 + ], + "score": 1.0, + "content": "formance after calibration.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 216, + 505, + 281 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 286, + 505, + 375 + ], + "lines": [ + { + "bbox": [ + 106, + 286, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 506, + 299 + ], + "score": 1.0, + "content": "We would like to note that test-time data augmentation does not always break the calibration of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 298, + 506, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 506, + 310 + ], + "score": 1.0, + "content": "an ensemble, and, on the contrary, test-time data augmentation often improves the calibration of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 309, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 321 + ], + "score": 1.0, + "content": "an ensemble. In our experiments, decalibration was caused by the extreme magnitude of a random", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 319, + 506, + 332 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 506, + 332 + ], + "score": 1.0, + "content": "crop, that is conventionally used for ImageNet augmentation. Using less extreme magnitude of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "random crop fixes decalibration, that makes test-time data augmentation a more practical method", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "that provides out-of-the-box calibration. Although, as we demonstrated earlier, there is no guarantee", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "score": 1.0, + "content": "that any ensemble is calibrated out-of-the-box. If we are willing to apply post-hoc calibration, the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 363, + 392, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 392, + 376 + ], + "score": 1.0, + "content": "final performance can be much better with more severe augmentations.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 286, + 506, + 376 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 390, + 274, + 403 + ], + "lines": [ + { + "bbox": [ + 104, + 388, + 277, + 406 + ], + "spans": [ + { + "bbox": [ + 104, + 388, + 277, + 406 + ], + "score": 1.0, + "content": "5 DISCUSSION & CONCLUSION", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 504, + 437 + ], + "lines": [ + { + "bbox": [ + 106, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 505, + 428 + ], + "score": 1.0, + "content": "We have explored the field of in-domain uncertainty estimation and performed an extensive evalua-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 426, + 465, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 465, + 438 + ], + "score": 1.0, + "content": "tion of modern ensembling techniques. Our main findings can be summarized as follows:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 415, + 505, + 438 + ] + }, + { + "type": "list", + "bbox": [ + 132, + 446, + 505, + 679 + ], + "lines": [ + { + "bbox": [ + 133, + 447, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 133, + 447, + 505, + 457 + ], + "score": 1.0, + "content": "• Temperature scaling is a must even for ensembles. While ensembles generally have bet-", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 142, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 142, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "ter calibration out-of-the-box, they are not calibrated perfectly and can benefit from the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 141, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 141, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "procedure. A comparison of log-likelihoods of different ensembling methods without tem-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 141, + 479, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 141, + 479, + 505, + 492 + ], + "score": 1.0, + "content": "perature scaling might not provide a fair ranking, especially if some models happen to be", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 141, + 491, + 201, + 500 + ], + "spans": [ + { + "bbox": [ + 141, + 491, + 201, + 500 + ], + "score": 1.0, + "content": "miscalibrated.", + "type": "text" + } + ], + "index": 32, + "is_list_end_line": true + }, + { + "bbox": [ + 140, + 504, + 506, + 517 + ], + "spans": [ + { + "bbox": [ + 140, + 504, + 506, + 517 + ], + "score": 1.0, + "content": "Many common metrics for measuring in-domain uncertainty are either unreliable (ECE and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 142, + 516, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 142, + 516, + 505, + 527 + ], + "score": 1.0, + "content": "analogues) or cannot be used to compare different methods (AUC-ROC, AUC-PR for mis-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 526, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 141, + 526, + 505, + 538 + ], + "score": 1.0, + "content": "classification detection; accuracy-confidence curves). In order to perform a fair comparison", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 142, + 537, + 394, + 549 + ], + "spans": [ + { + "bbox": [ + 142, + 537, + 394, + 549 + ], + "score": 1.0, + "content": "of different methods, one needs to be cautious of these pitfalls.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 141, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 141, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "Many popular ensembling techniques require dozens of samples for test-time averaging, yet", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 141, + 563, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 141, + 563, + 505, + 574 + ], + "score": 1.0, + "content": "are essentially equivalent to a handful of independently trained models. Deep ensembles", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 141, + 573, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 141, + 573, + 505, + 586 + ], + "score": 1.0, + "content": "dominate other methods given a fixed test-time budget. The results indicate, in particu-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 141, + 584, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 141, + 584, + 505, + 597 + ], + "score": 1.0, + "content": "lar, that exploration of different modes in the loss landscape is crucial for good predictive", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 142, + 596, + 198, + 607 + ], + "spans": [ + { + "bbox": [ + 142, + 596, + 198, + 607 + ], + "score": 1.0, + "content": "performance.", + "type": "text" + } + ], + "index": 41, + "is_list_end_line": true + }, + { + "bbox": [ + 133, + 609, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 133, + 609, + 505, + 622 + ], + "score": 1.0, + "content": "• Methods that are stuck in a single mode are unable to compete with methods that are de-", + "type": "text" + } + ], + "index": 42, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 141, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "signed to explore different modes of the loss landscape. Would more elaborate posterior", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 141, + 632, + 404, + 645 + ], + "spans": [ + { + "bbox": [ + 141, + 632, + 404, + 645 + ], + "score": 1.0, + "content": "approximations and better inference techniques shorten this gap?", + "type": "text" + } + ], + "index": 44, + "is_list_end_line": true + }, + { + "bbox": [ + 140, + 646, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 140, + 646, + 505, + 659 + ], + "score": 1.0, + "content": "Test-time data augmentation is a surprisingly strong baseline for in-domain uncertainty", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 142, + 658, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 142, + 658, + 505, + 670 + ], + "score": 1.0, + "content": "estimation. It can significantly improve other methods without increasing training time or", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 141, + 668, + 454, + 681 + ], + "spans": [ + { + "bbox": [ + 141, + 668, + 454, + 681 + ], + "score": 1.0, + "content": "model size since data augmentation is usually already present during training.", + "type": "text" + } + ], + "index": 47, + "is_list_end_line": true + } + ], + "index": 37.5, + "bbox_fs": [ + 133, + 447, + 506, + 681 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 688, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "Our takeaways are aligned with the take-home messages of Ovadia et al. (2019) that relate to in-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "domain uncertainty estimation. We also observe a stable ordering of different methods in our exper-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "iments, and observe that deep ensembles with few members outperform methods based on stochastic", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 721, + 190, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 190, + 732 + ], + "score": 1.0, + "content": "computation graphs.", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 49.5, + "bbox_fs": [ + 105, + 687, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "A large number of unreliable metrics inhibits a fair comparison of different methods. Because of this,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "we urge the community to aim for more reliable benchmarks in the numerous setups of uncertainty", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 153, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 153, + 116 + ], + "score": 1.0, + "content": "estimation.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 108, + 128, + 200, + 139 + ], + "lines": [ + { + "bbox": [ + 107, + 129, + 201, + 139 + ], + "spans": [ + { + "bbox": [ + 107, + 129, + 201, + 139 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 147, + 505, + 180 + ], + "lines": [ + { + "bbox": [ + 105, + 146, + 506, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 506, + 160 + ], + "score": 1.0, + "content": "Dmitry Vetrov and Dmitry Molchanov were supported by the Russian Science Foundation grant", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 157, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 506, + 170 + ], + "score": 1.0, + "content": "no. 19-71-30020. This research was supported in part through computational resources of HPC", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 169, + 199, + 180 + ], + "spans": [ + { + "bbox": [ + 106, + 169, + 199, + 180 + ], + "score": 1.0, + "content": "facilities at NRU HSE.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 107, + 196, + 175, + 208 + ], + "lines": [ + { + "bbox": [ + 106, + 196, + 176, + 209 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 176, + 209 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 214, + 506, + 248 + ], + "lines": [ + { + "bbox": [ + 106, + 214, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 214, + 505, + 227 + ], + "score": 1.0, + "content": "Andrei Atanov, Arsenii Ashukha, Dmitry Molchanov, Kirill Neklyudov, and Dmitry Vetrov. Un-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 225, + 506, + 238 + ], + "spans": [ + { + "bbox": [ + 115, + 225, + 506, + 238 + ], + "score": 1.0, + "content": "certainty estimation via stochastic batch normalization. In International Symposium on Neural", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 237, + 278, + 249 + ], + "spans": [ + { + "bbox": [ + 116, + 237, + 278, + 249 + ], + "score": 1.0, + "content": "Networks, pp. 261–269. Springer, 2019.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 504, + 277 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "Anoop Korattikara Balan, Vivek Rathod, Kevin P Murphy, and Max Welling. Bayesian dark knowl-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 266, + 456, + 278 + ], + "spans": [ + { + "bbox": [ + 115, + 266, + 456, + 278 + ], + "score": 1.0, + "content": "edge. In Advances in Neural Information Processing Systems, pp. 3438–3446, 2015.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 283, + 503, + 307 + ], + "lines": [ + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "score": 1.0, + "content": "Charles Blundell, Julien Cornebise, Koray Kavukcuoglu, and Daan Wierstra. Weight uncertainty in", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 295, + 349, + 307 + ], + "spans": [ + { + "bbox": [ + 116, + 295, + 349, + 307 + ], + "score": 1.0, + "content": "neural networks. arXiv preprint arXiv:1505.05424, 2015.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 312, + 503, + 335 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 327 + ], + "score": 1.0, + "content": "Glenn W Brier. Verification of forecasts expressed in terms of probability. Monthly weather review,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 323, + 186, + 335 + ], + "spans": [ + { + "bbox": [ + 115, + 323, + 186, + 335 + ], + "score": 1.0, + "content": "78(1):1–3, 1950.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 341, + 504, + 376 + ], + "lines": [ + { + "bbox": [ + 105, + 342, + 504, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 504, + 354 + ], + "score": 1.0, + "content": "Jacob Buckman, Danijar Hafner, George Tucker, Eugene Brevdo, and Honglak Lee. Sample-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 353, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 116, + 353, + 505, + 365 + ], + "score": 1.0, + "content": "efficient reinforcement learning with stochastic ensemble value expansion. In Advances in Neural", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 363, + 339, + 377 + ], + "spans": [ + { + "bbox": [ + 116, + 363, + 339, + 377 + ], + "score": 1.0, + "content": "Information Processing Systems, pp. 8224–8234, 2018.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 108, + 381, + 504, + 416 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 505, + 395 + ], + "score": 1.0, + "content": "Kurtland Chua, Roberto Calandra, Rowan McAllister, and Sergey Levine. Deep reinforcement learn-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 393, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 116, + 393, + 505, + 406 + ], + "score": 1.0, + "content": "ing in a handful of trials using probabilistic dynamics models. In Advances in Neural Information", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 403, + 290, + 417 + ], + "spans": [ + { + "bbox": [ + 116, + 403, + 290, + 417 + ], + "score": 1.0, + "content": "Processing Systems, pp. 4754–4765, 2018.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 505, + 455 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "Yufei Cui, Wuguannan Yao, Qiao Li, Antoni B Chan, and Chun Jason Xue. Accelerating monte", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 433, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 116, + 433, + 505, + 446 + ], + "score": 1.0, + "content": "carlo bayesian inference via approximating predictive uncertainty over simplex. arXiv preprint", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 444, + 219, + 455 + ], + "spans": [ + { + "bbox": [ + 116, + 444, + 219, + 455 + ], + "score": 1.0, + "content": "arXiv:1905.12194, 2019.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 461, + 505, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "score": 1.0, + "content": "Yukun Ding, Jinglan Liu, Jinjun Xiong, and Yiyu Shi. Evaluation of neural network uncertainty", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 473, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 115, + 473, + 505, + 485 + ], + "score": 1.0, + "content": "estimation with application to resource-constrained platforms. arXiv preprint arXiv:1903.02050,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 483, + 142, + 496 + ], + "spans": [ + { + "bbox": [ + 115, + 483, + 142, + 496 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 105, + 501, + 496, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 500, + 497, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 497, + 516 + ], + "score": 1.0, + "content": "Yarin Gal. Uncertainty in deep learning. PhD thesis, PhD thesis, University of Cambridge, 2016.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 108, + 520, + 504, + 553 + ], + "lines": [ + { + "bbox": [ + 105, + 519, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 505, + 533 + ], + "score": 1.0, + "content": "Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 532, + 505, + 544 + ], + "spans": [ + { + "bbox": [ + 115, + 532, + 505, + 544 + ], + "score": 1.0, + "content": "uncertainty in deep learning. In international conference on machine learning, pp. 1050–1059,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 540, + 143, + 555 + ], + "spans": [ + { + "bbox": [ + 115, + 540, + 143, + 555 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 559, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 560, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 560, + 505, + 572 + ], + "score": 1.0, + "content": "Timur Garipov, Pavel Izmailov, Dmitrii Podoprikhin, Dmitry P Vetrov, and Andrew G Wilson. Loss", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 117, + 571, + 504, + 583 + ], + "spans": [ + { + "bbox": [ + 117, + 571, + 504, + 583 + ], + "score": 1.0, + "content": "surfaces, mode connectivity, and fast ensembling of dnns. In Advances in Neural Information", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 582, + 289, + 594 + ], + "spans": [ + { + "bbox": [ + 116, + 582, + 289, + 594 + ], + "score": 1.0, + "content": "Processing Systems, pp. 8789–8798, 2018.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 505, + 634 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 613 + ], + "score": 1.0, + "content": "Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q Weinberger. On calibration of modern neural", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 612, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 116, + 612, + 505, + 624 + ], + "score": 1.0, + "content": "networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 622, + 255, + 635 + ], + "spans": [ + { + "bbox": [ + 115, + 622, + 255, + 635 + ], + "score": 1.0, + "content": "pp. 1321–1330. JMLR. org, 2017.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 106, + 640, + 504, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 638, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 654 + ], + "score": 1.0, + "content": "Fredrik K Gustafsson, Martin Danelljan, and Thomas B Schon. Evaluating scalable bayesian deep ¨", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 650, + 461, + 663 + ], + "spans": [ + { + "bbox": [ + 116, + 650, + 461, + 663 + ], + "score": 1.0, + "content": "learning methods for robust computer vision. arXiv preprint arXiv:1906.01620, 2019.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 106, + 669, + 504, + 692 + ], + "lines": [ + { + "bbox": [ + 105, + 669, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 505, + 682 + ], + "score": 1.0, + "content": "Lars Kai Hansen and Peter Salamon. Neural network ensembles. IEEE Transactions on Pattern", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 680, + 341, + 692 + ], + "spans": [ + { + "bbox": [ + 116, + 680, + 341, + 692 + ], + "score": 1.0, + "content": "Analysis & Machine Intelligence, (10):993–1001, 1990.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 505, + 713 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recog-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 115, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "nition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp.", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 719, + 181, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 719, + 181, + 732 + ], + "score": 1.0, + "content": "770–778, 2016.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44 + } + ], + "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 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": [ + 107, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "A large number of unreliable metrics inhibits a fair comparison of different methods. Because of this,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "we urge the community to aim for more reliable benchmarks in the numerous setups of uncertainty", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 153, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 153, + 116 + ], + "score": 1.0, + "content": "estimation.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 116 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 128, + 200, + 139 + ], + "lines": [ + { + "bbox": [ + 107, + 129, + 201, + 139 + ], + "spans": [ + { + "bbox": [ + 107, + 129, + 201, + 139 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 147, + 505, + 180 + ], + "lines": [ + { + "bbox": [ + 105, + 146, + 506, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 506, + 160 + ], + "score": 1.0, + "content": "Dmitry Vetrov and Dmitry Molchanov were supported by the Russian Science Foundation grant", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 157, + 506, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 506, + 170 + ], + "score": 1.0, + "content": "no. 19-71-30020. This research was supported in part through computational resources of HPC", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 169, + 199, + 180 + ], + "spans": [ + { + "bbox": [ + 106, + 169, + 199, + 180 + ], + "score": 1.0, + "content": "facilities at NRU HSE.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 146, + 506, + 180 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 196, + 175, + 208 + ], + "lines": [ + { + "bbox": [ + 106, + 196, + 176, + 209 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 176, + 209 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 214, + 506, + 248 + ], + "lines": [ + { + "bbox": [ + 106, + 214, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 214, + 505, + 227 + ], + "score": 1.0, + "content": "Andrei Atanov, Arsenii Ashukha, Dmitry Molchanov, Kirill Neklyudov, and Dmitry Vetrov. Un-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 225, + 506, + 238 + ], + "spans": [ + { + "bbox": [ + 115, + 225, + 506, + 238 + ], + "score": 1.0, + "content": "certainty estimation via stochastic batch normalization. In International Symposium on Neural", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 237, + 278, + 249 + ], + "spans": [ + { + "bbox": [ + 116, + 237, + 278, + 249 + ], + "score": 1.0, + "content": "Networks, pp. 261–269. Springer, 2019.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9, + "bbox_fs": [ + 106, + 214, + 506, + 249 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 504, + 277 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "Anoop Korattikara Balan, Vivek Rathod, Kevin P Murphy, and Max Welling. Bayesian dark knowl-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 266, + 456, + 278 + ], + "spans": [ + { + "bbox": [ + 115, + 266, + 456, + 278 + ], + "score": 1.0, + "content": "edge. In Advances in Neural Information Processing Systems, pp. 3438–3446, 2015.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 106, + 254, + 505, + 278 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 283, + 503, + 307 + ], + "lines": [ + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "score": 1.0, + "content": "Charles Blundell, Julien Cornebise, Koray Kavukcuoglu, and Daan Wierstra. Weight uncertainty in", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 295, + 349, + 307 + ], + "spans": [ + { + "bbox": [ + 116, + 295, + 349, + 307 + ], + "score": 1.0, + "content": "neural networks. arXiv preprint arXiv:1505.05424, 2015.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 283, + 506, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 312, + 503, + 335 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 327 + ], + "score": 1.0, + "content": "Glenn W Brier. Verification of forecasts expressed in terms of probability. Monthly weather review,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 323, + 186, + 335 + ], + "spans": [ + { + "bbox": [ + 115, + 323, + 186, + 335 + ], + "score": 1.0, + "content": "78(1):1–3, 1950.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 311, + 505, + 335 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 341, + 504, + 376 + ], + "lines": [ + { + "bbox": [ + 105, + 342, + 504, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 504, + 354 + ], + "score": 1.0, + "content": "Jacob Buckman, Danijar Hafner, George Tucker, Eugene Brevdo, and Honglak Lee. Sample-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 353, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 116, + 353, + 505, + 365 + ], + "score": 1.0, + "content": "efficient reinforcement learning with stochastic ensemble value expansion. In Advances in Neural", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 363, + 339, + 377 + ], + "spans": [ + { + "bbox": [ + 116, + 363, + 339, + 377 + ], + "score": 1.0, + "content": "Information Processing Systems, pp. 8224–8234, 2018.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 342, + 505, + 377 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 381, + 504, + 416 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 505, + 395 + ], + "score": 1.0, + "content": "Kurtland Chua, Roberto Calandra, Rowan McAllister, and Sergey Levine. Deep reinforcement learn-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 393, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 116, + 393, + 505, + 406 + ], + "score": 1.0, + "content": "ing in a handful of trials using probabilistic dynamics models. In Advances in Neural Information", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 403, + 290, + 417 + ], + "spans": [ + { + "bbox": [ + 116, + 403, + 290, + 417 + ], + "score": 1.0, + "content": "Processing Systems, pp. 4754–4765, 2018.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 381, + 505, + 417 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 505, + 455 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "Yufei Cui, Wuguannan Yao, Qiao Li, Antoni B Chan, and Chun Jason Xue. Accelerating monte", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 433, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 116, + 433, + 505, + 446 + ], + "score": 1.0, + "content": "carlo bayesian inference via approximating predictive uncertainty over simplex. arXiv preprint", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 444, + 219, + 455 + ], + "spans": [ + { + "bbox": [ + 116, + 444, + 219, + 455 + ], + "score": 1.0, + "content": "arXiv:1905.12194, 2019.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 421, + 505, + 455 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 461, + 505, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 505, + 475 + ], + "score": 1.0, + "content": "Yukun Ding, Jinglan Liu, Jinjun Xiong, and Yiyu Shi. Evaluation of neural network uncertainty", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 473, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 115, + 473, + 505, + 485 + ], + "score": 1.0, + "content": "estimation with application to resource-constrained platforms. arXiv preprint arXiv:1903.02050,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 483, + 142, + 496 + ], + "spans": [ + { + "bbox": [ + 115, + 483, + 142, + 496 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 461, + 505, + 496 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 501, + 496, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 500, + 497, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 497, + 516 + ], + "score": 1.0, + "content": "Yarin Gal. Uncertainty in deep learning. PhD thesis, PhD thesis, University of Cambridge, 2016.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 106, + 500, + 497, + 516 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 520, + 504, + 553 + ], + "lines": [ + { + "bbox": [ + 105, + 519, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 505, + 533 + ], + "score": 1.0, + "content": "Yarin Gal and Zoubin Ghahramani. Dropout as a bayesian approximation: Representing model", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 532, + 505, + 544 + ], + "spans": [ + { + "bbox": [ + 115, + 532, + 505, + 544 + ], + "score": 1.0, + "content": "uncertainty in deep learning. In international conference on machine learning, pp. 1050–1059,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 540, + 143, + 555 + ], + "spans": [ + { + "bbox": [ + 115, + 540, + 143, + 555 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 519, + 505, + 555 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 559, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 560, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 560, + 505, + 572 + ], + "score": 1.0, + "content": "Timur Garipov, Pavel Izmailov, Dmitrii Podoprikhin, Dmitry P Vetrov, and Andrew G Wilson. Loss", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 117, + 571, + 504, + 583 + ], + "spans": [ + { + "bbox": [ + 117, + 571, + 504, + 583 + ], + "score": 1.0, + "content": "surfaces, mode connectivity, and fast ensembling of dnns. In Advances in Neural Information", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 582, + 289, + 594 + ], + "spans": [ + { + "bbox": [ + 116, + 582, + 289, + 594 + ], + "score": 1.0, + "content": "Processing Systems, pp. 8789–8798, 2018.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 106, + 560, + 505, + 594 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 505, + 634 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 613 + ], + "score": 1.0, + "content": "Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q Weinberger. On calibration of modern neural", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 612, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 116, + 612, + 505, + 624 + ], + "score": 1.0, + "content": "networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 622, + 255, + 635 + ], + "spans": [ + { + "bbox": [ + 115, + 622, + 255, + 635 + ], + "score": 1.0, + "content": "pp. 1321–1330. JMLR. org, 2017.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 599, + 505, + 635 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 640, + 504, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 638, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 654 + ], + "score": 1.0, + "content": "Fredrik K Gustafsson, Martin Danelljan, and Thomas B Schon. Evaluating scalable bayesian deep ¨", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 650, + 461, + 663 + ], + "spans": [ + { + "bbox": [ + 116, + 650, + 461, + 663 + ], + "score": 1.0, + "content": "learning methods for robust computer vision. arXiv preprint arXiv:1906.01620, 2019.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 638, + 506, + 663 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 669, + 504, + 692 + ], + "lines": [ + { + "bbox": [ + 105, + 669, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 505, + 682 + ], + "score": 1.0, + "content": "Lars Kai Hansen and Peter Salamon. Neural network ensembles. IEEE Transactions on Pattern", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 680, + 341, + 692 + ], + "spans": [ + { + "bbox": [ + 116, + 680, + 341, + 692 + ], + "score": 1.0, + "content": "Analysis & Machine Intelligence, (10):993–1001, 1990.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 669, + 505, + 692 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 697, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 697, + 505, + 713 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recog-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 115, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "nition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp.", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 719, + 181, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 719, + 181, + 732 + ], + "score": 1.0, + "content": "770–778, 2016.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 697, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. arXiv", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 94, + 254, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 94, + 254, + 106 + ], + "score": 1.0, + "content": "preprint arXiv:1503.02531, 2015.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 111, + 503, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 126 + ], + "score": 1.0, + "content": "Gao Huang, Yixuan Li, Geoff Pleiss, Zhuang Liu, John E Hopcroft, and Kilian Q Weinberger.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 117, + 123, + 459, + 136 + ], + "spans": [ + { + "bbox": [ + 117, + 123, + 459, + 136 + ], + "score": 1.0, + "content": "Snapshot ensembles: Train 1, get m for free. arXiv preprint arXiv:1704.00109, 2017.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 106, + 142, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 505, + 156 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 153, + 411, + 165 + ], + "spans": [ + { + "bbox": [ + 115, + 153, + 411, + 165 + ], + "score": 1.0, + "content": "reducing internal covariate shift. arXiv preprint arXiv:1502.03167, 2015.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 106, + 172, + 505, + 206 + ], + "lines": [ + { + "bbox": [ + 106, + 172, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 505, + 184 + ], + "score": 1.0, + "content": "Pavel Izmailov, Dmitrii Podoprikhin, Timur Garipov, Dmitry Vetrov, and Andrew Gordon Wil-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 183, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 115, + 183, + 505, + 196 + ], + "score": 1.0, + "content": "son. Averaging weights leads to wider optima and better generalization. arXiv preprint", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 219, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 219, + 206 + ], + "score": 1.0, + "content": "arXiv:1803.05407, 2018.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 212, + 503, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 212, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 106, + 212, + 505, + 225 + ], + "score": 1.0, + "content": "Durk P Kingma, Tim Salimans, and Max Welling. Variational dropout and the local reparameteri-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 224, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 116, + 224, + 482, + 237 + ], + "score": 1.0, + "content": "zation trick. In Advances in Neural Information Processing Systems, pp. 2575–2583, 2015.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 105, + 243, + 503, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 257 + ], + "score": 1.0, + "content": "Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 254, + 249, + 267 + ], + "spans": [ + { + "bbox": [ + 116, + 254, + 249, + 267 + ], + "score": 1.0, + "content": "Technical report, Citeseer, 2009.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 504, + 296 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 506, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 506, + 287 + ], + "score": 1.0, + "content": "Ananya Kumar, Percy S Liang, and Tengyu Ma. Verified uncertainty calibration. In Advances in", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 283, + 369, + 297 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 369, + 297 + ], + "score": 1.0, + "content": "Neural Information Processing Systems, pp. 3787–3798, 2019.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 302, + 504, + 337 + ], + "lines": [ + { + "bbox": [ + 105, + 302, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 316 + ], + "score": 1.0, + "content": "Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. Simple and scalable predictive", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 313, + 506, + 328 + ], + "spans": [ + { + "bbox": [ + 115, + 313, + 506, + 328 + ], + "score": 1.0, + "content": "uncertainty estimation using deep ensembles. In Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 325, + 243, + 337 + ], + "spans": [ + { + "bbox": [ + 116, + 325, + 243, + 337 + ], + "score": 1.0, + "content": "Systems, pp. 6402–6413, 2017.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 108, + 343, + 504, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 343, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 505, + 357 + ], + "score": 1.0, + "content": "Christos Louizos and Max Welling. Multiplicative normalizing flows for variational bayesian neural", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 355, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 116, + 355, + 505, + 368 + ], + "score": 1.0, + "content": "networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 366, + 255, + 379 + ], + "spans": [ + { + "bbox": [ + 115, + 366, + 255, + 379 + ], + "score": 1.0, + "content": "pp. 2218–2227. JMLR. org, 2017.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 384, + 504, + 408 + ], + "lines": [ + { + "bbox": [ + 106, + 385, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "Wesley Maddox, Timur Garipov, Pavel Izmailov, Dmitry Vetrov, and Andrew Gordon Wilson. A", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 396, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 115, + 396, + 505, + 408 + ], + "score": 1.0, + "content": "simple baseline for bayesian uncertainty in deep learning. arXiv preprint arXiv:1902.02476, 2019.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 414, + 504, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 428 + ], + "score": 1.0, + "content": "Andrey Malinin and Mark Gales. Predictive uncertainty estimation via prior networks. In Advances", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 426, + 379, + 439 + ], + "spans": [ + { + "bbox": [ + 116, + 426, + 379, + 439 + ], + "score": 1.0, + "content": "in Neural Information Processing Systems, pp. 7047–7058, 2018.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 444, + 504, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 444, + 505, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 458 + ], + "score": 1.0, + "content": "James Martens and Roger Grosse. Optimizing neural networks with kronecker-factored approximate", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 456, + 448, + 468 + ], + "spans": [ + { + "bbox": [ + 115, + 456, + 448, + 468 + ], + "score": 1.0, + "content": "curvature. In International conference on machine learning, pp. 2408–2417, 2015.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 474, + 503, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "Dmitry Molchanov, Arsenii Ashukha, and Dmitry Vetrov. Variational dropout sparsifies deep neural", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 115, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 496, + 255, + 510 + ], + "spans": [ + { + "bbox": [ + 115, + 496, + 255, + 510 + ], + "score": 1.0, + "content": "pp. 2498–2507. JMLR. org, 2017.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 515, + 503, + 539 + ], + "lines": [ + { + "bbox": [ + 105, + 514, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 505, + 529 + ], + "score": 1.0, + "content": "Marcin Mozejko, Mateusz Susik, and Rafał Karczewski. Inhibited softmax for uncertainty estima- ˙", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 527, + 376, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 527, + 376, + 538 + ], + "score": 1.0, + "content": "tion in neural networks. arXiv preprint arXiv:1810.01861, 2018.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 545, + 504, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 545, + 506, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 506, + 559 + ], + "score": 1.0, + "content": "Malik Sajjad Ahmed Nadeem, Jean-Daniel Zucker, and Blaise Hanczar. Accuracy-rejection curves", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 117, + 557, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 117, + 557, + 505, + 569 + ], + "score": 1.0, + "content": "(arcs) for comparing classification methods with a reject option. In Machine Learning in Systems", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 567, + 222, + 581 + ], + "spans": [ + { + "bbox": [ + 115, + 567, + 222, + 581 + ], + "score": 1.0, + "content": "Biology, pp. 65–81, 2009.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 586, + 504, + 620 + ], + "lines": [ + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "score": 1.0, + "content": "Mahdi Pakdaman Naeini, Gregory Cooper, and Milos Hauskrecht. Obtaining well calibrated prob-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 597, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 115, + 597, + 506, + 610 + ], + "score": 1.0, + "content": "abilities using bayesian binning. In Twenty-Ninth AAAI Conference on Artificial Intelligence,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 608, + 142, + 621 + ], + "spans": [ + { + "bbox": [ + 115, + 608, + 142, + 621 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 105, + 627, + 504, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "score": 1.0, + "content": "Jeremy Nixon, Mike Dusenberry, Linchuan Zhang, Ghassen Jerfel, and Dustin Tran. Measuring", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 638, + 257, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 638, + 257, + 651 + ], + "score": 1.0, + "content": "calibration in deep learning. 2019.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 107, + 657, + 504, + 692 + ], + "lines": [ + { + "bbox": [ + 106, + 657, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 657, + 505, + 671 + ], + "score": 1.0, + "content": "Yaniv Ovadia, Emily Fertig, Jie Ren, Zachary Nado, D Sculley, Sebastian Nowozin, Joshua V Dil-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 116, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "lon, Balaji Lakshminarayanan, and Jasper Snoek. Can you trust your model’s uncertainty? eval-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 679, + 474, + 693 + ], + "spans": [ + { + "bbox": [ + 116, + 679, + 474, + 693 + ], + "score": 1.0, + "content": "uating predictive uncertainty under dataset shift. arXiv preprint arXiv:1906.02530, 2019.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + }, + { + "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": 43 + }, + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. Automatic differentiation in", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 721, + 294, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 294, + 732 + ], + "score": 1.0, + "content": "PyTorch. In NIPS Autodiff Workshop, 2017.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44 + } + ], + "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, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. arXiv", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 94, + 254, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 94, + 254, + 106 + ], + "score": 1.0, + "content": "preprint arXiv:1503.02531, 2015.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 506, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 111, + 503, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 126 + ], + "score": 1.0, + "content": "Gao Huang, Yixuan Li, Geoff Pleiss, Zhuang Liu, John E Hopcroft, and Kilian Q Weinberger.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 117, + 123, + 459, + 136 + ], + "spans": [ + { + "bbox": [ + 117, + 123, + 459, + 136 + ], + "score": 1.0, + "content": "Snapshot ensembles: Train 1, get m for free. arXiv preprint arXiv:1704.00109, 2017.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 110, + 505, + 136 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 142, + 504, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 505, + 156 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 153, + 411, + 165 + ], + "spans": [ + { + "bbox": [ + 115, + 153, + 411, + 165 + ], + "score": 1.0, + "content": "reducing internal covariate shift. arXiv preprint arXiv:1502.03167, 2015.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 141, + 505, + 165 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 172, + 505, + 206 + ], + "lines": [ + { + "bbox": [ + 106, + 172, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 505, + 184 + ], + "score": 1.0, + "content": "Pavel Izmailov, Dmitrii Podoprikhin, Timur Garipov, Dmitry Vetrov, and Andrew Gordon Wil-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 183, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 115, + 183, + 505, + 196 + ], + "score": 1.0, + "content": "son. Averaging weights leads to wider optima and better generalization. arXiv preprint", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 219, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 219, + 206 + ], + "score": 1.0, + "content": "arXiv:1803.05407, 2018.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 106, + 172, + 505, + 206 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 212, + 503, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 212, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 106, + 212, + 505, + 225 + ], + "score": 1.0, + "content": "Durk P Kingma, Tim Salimans, and Max Welling. Variational dropout and the local reparameteri-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 224, + 482, + 237 + ], + "spans": [ + { + "bbox": [ + 116, + 224, + 482, + 237 + ], + "score": 1.0, + "content": "zation trick. In Advances in Neural Information Processing Systems, pp. 2575–2583, 2015.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 106, + 212, + 505, + 237 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 243, + 503, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 242, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 257 + ], + "score": 1.0, + "content": "Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 254, + 249, + 267 + ], + "spans": [ + { + "bbox": [ + 116, + 254, + 249, + 267 + ], + "score": 1.0, + "content": "Technical report, Citeseer, 2009.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 242, + 505, + 267 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 272, + 504, + 296 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 506, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 506, + 287 + ], + "score": 1.0, + "content": "Ananya Kumar, Percy S Liang, and Tengyu Ma. Verified uncertainty calibration. In Advances in", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 283, + 369, + 297 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 369, + 297 + ], + "score": 1.0, + "content": "Neural Information Processing Systems, pp. 3787–3798, 2019.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 272, + 506, + 297 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 302, + 504, + 337 + ], + "lines": [ + { + "bbox": [ + 105, + 302, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 316 + ], + "score": 1.0, + "content": "Balaji Lakshminarayanan, Alexander Pritzel, and Charles Blundell. Simple and scalable predictive", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 313, + 506, + 328 + ], + "spans": [ + { + "bbox": [ + 115, + 313, + 506, + 328 + ], + "score": 1.0, + "content": "uncertainty estimation using deep ensembles. In Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 325, + 243, + 337 + ], + "spans": [ + { + "bbox": [ + 116, + 325, + 243, + 337 + ], + "score": 1.0, + "content": "Systems, pp. 6402–6413, 2017.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 302, + 506, + 337 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 343, + 504, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 343, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 505, + 357 + ], + "score": 1.0, + "content": "Christos Louizos and Max Welling. Multiplicative normalizing flows for variational bayesian neural", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 355, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 116, + 355, + 505, + 368 + ], + "score": 1.0, + "content": "networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 366, + 255, + 379 + ], + "spans": [ + { + "bbox": [ + 115, + 366, + 255, + 379 + ], + "score": 1.0, + "content": "pp. 2218–2227. JMLR. org, 2017.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 106, + 343, + 505, + 379 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 384, + 504, + 408 + ], + "lines": [ + { + "bbox": [ + 106, + 385, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 505, + 397 + ], + "score": 1.0, + "content": "Wesley Maddox, Timur Garipov, Pavel Izmailov, Dmitry Vetrov, and Andrew Gordon Wilson. A", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 396, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 115, + 396, + 505, + 408 + ], + "score": 1.0, + "content": "simple baseline for bayesian uncertainty in deep learning. arXiv preprint arXiv:1902.02476, 2019.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 106, + 385, + 505, + 408 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 414, + 504, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 428 + ], + "score": 1.0, + "content": "Andrey Malinin and Mark Gales. Predictive uncertainty estimation via prior networks. In Advances", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 426, + 379, + 439 + ], + "spans": [ + { + "bbox": [ + 116, + 426, + 379, + 439 + ], + "score": 1.0, + "content": "in Neural Information Processing Systems, pp. 7047–7058, 2018.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 106, + 414, + 505, + 439 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 444, + 504, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 444, + 505, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 505, + 458 + ], + "score": 1.0, + "content": "James Martens and Roger Grosse. Optimizing neural networks with kronecker-factored approximate", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 456, + 448, + 468 + ], + "spans": [ + { + "bbox": [ + 115, + 456, + 448, + 468 + ], + "score": 1.0, + "content": "curvature. In International conference on machine learning, pp. 2408–2417, 2015.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 444, + 505, + 468 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 474, + 503, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "Dmitry Molchanov, Arsenii Ashukha, and Dmitry Vetrov. Variational dropout sparsifies deep neural", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 115, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 496, + 255, + 510 + ], + "spans": [ + { + "bbox": [ + 115, + 496, + 255, + 510 + ], + "score": 1.0, + "content": "pp. 2498–2507. JMLR. org, 2017.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 475, + 505, + 510 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 515, + 503, + 539 + ], + "lines": [ + { + "bbox": [ + 105, + 514, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 505, + 529 + ], + "score": 1.0, + "content": "Marcin Mozejko, Mateusz Susik, and Rafał Karczewski. Inhibited softmax for uncertainty estima- ˙", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 527, + 376, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 527, + 376, + 538 + ], + "score": 1.0, + "content": "tion in neural networks. arXiv preprint arXiv:1810.01861, 2018.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 514, + 505, + 538 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 545, + 504, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 545, + 506, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 506, + 559 + ], + "score": 1.0, + "content": "Malik Sajjad Ahmed Nadeem, Jean-Daniel Zucker, and Blaise Hanczar. Accuracy-rejection curves", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 117, + 557, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 117, + 557, + 505, + 569 + ], + "score": 1.0, + "content": "(arcs) for comparing classification methods with a reject option. In Machine Learning in Systems", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 567, + 222, + 581 + ], + "spans": [ + { + "bbox": [ + 115, + 567, + 222, + 581 + ], + "score": 1.0, + "content": "Biology, pp. 65–81, 2009.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 545, + 506, + 581 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 586, + 504, + 620 + ], + "lines": [ + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "score": 1.0, + "content": "Mahdi Pakdaman Naeini, Gregory Cooper, and Milos Hauskrecht. Obtaining well calibrated prob-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 597, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 115, + 597, + 506, + 610 + ], + "score": 1.0, + "content": "abilities using bayesian binning. In Twenty-Ninth AAAI Conference on Artificial Intelligence,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 608, + 142, + 621 + ], + "spans": [ + { + "bbox": [ + 115, + 608, + 142, + 621 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 106, + 587, + 506, + 621 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 627, + 504, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "score": 1.0, + "content": "Jeremy Nixon, Mike Dusenberry, Linchuan Zhang, Ghassen Jerfel, and Dustin Tran. Measuring", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 638, + 257, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 638, + 257, + 651 + ], + "score": 1.0, + "content": "calibration in deep learning. 2019.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 626, + 506, + 651 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 657, + 504, + 692 + ], + "lines": [ + { + "bbox": [ + 106, + 657, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 657, + 505, + 671 + ], + "score": 1.0, + "content": "Yaniv Ovadia, Emily Fertig, Jie Ren, Zachary Nado, D Sculley, Sebastian Nowozin, Joshua V Dil-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 116, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "lon, Balaji Lakshminarayanan, and Jasper Snoek. Can you trust your model’s uncertainty? eval-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 679, + 474, + 693 + ], + "spans": [ + { + "bbox": [ + 116, + 679, + 474, + 693 + ], + "score": 1.0, + "content": "uating predictive uncertainty under dataset shift. arXiv preprint arXiv:1906.02530, 2019.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41, + "bbox_fs": [ + 106, + 657, + 505, + 693 + ] + }, + { + "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": 43 + }, + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. Automatic differentiation in", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 721, + 294, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 294, + 732 + ], + "score": 1.0, + "content": "PyTorch. In NIPS Autodiff Workshop, 2017.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 697, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "score": 1.0, + "content": "Joaquin Quinonero-Candela, Carl Edward Rasmussen, Fabian Sinz, Olivier Bousquet, and Bern-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "hard Scholkopf. Evaluating predictive uncertainty challenge. In ¨ Machine Learning Challenges", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 117, + 104, + 265, + 118 + ], + "spans": [ + { + "bbox": [ + 117, + 104, + 265, + 118 + ], + "score": 1.0, + "content": "Workshop, pp. 1–27. Springer, 2005.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 122, + 504, + 145 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 136 + ], + "score": 1.0, + "content": "Hippolyt Ritter, Aleksandar Botev, and David Barber. A scalable laplace approximation for neural", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 114, + 133, + 184, + 146 + ], + "spans": [ + { + "bbox": [ + 114, + 133, + 184, + 146 + ], + "score": 1.0, + "content": "networks. 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 108, + 152, + 503, + 187 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 505, + 166 + ], + "score": 1.0, + "content": "Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 505, + 177 + ], + "score": 1.0, + "content": "Huang, Andrej Karpathy, Aditya Khosla, Michael Bernstein, et al. Imagenet large scale visual", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 175, + 468, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 175, + 468, + 187 + ], + "score": 1.0, + "content": "recognition challenge. International journal of computer vision, 115(3):211–252, 2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 193, + 504, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 193, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 206 + ], + "score": 1.0, + "content": "Burr Settles. Active learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 205, + 186, + 217 + ], + "spans": [ + { + "bbox": [ + 116, + 205, + 186, + 217 + ], + "score": 1.0, + "content": "(1):1–114, 2012.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 503, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 221, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 238 + ], + "score": 1.0, + "content": "Karen Simonyan and Andrew Zisserman. Very deep convolutional networks for large-scale image", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 235, + 325, + 245 + ], + "spans": [ + { + "bbox": [ + 116, + 235, + 325, + 245 + ], + "score": 1.0, + "content": "recognition. arXiv preprint arXiv:1409.1556, 2014.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 253, + 504, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 506, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 506, + 267 + ], + "score": 1.0, + "content": "Leslie N Smith and Nicholay Topin. Super-convergence: Very fast training of neural networks using", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 265, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 116, + 265, + 505, + 276 + ], + "score": 1.0, + "content": "large learning rates. In Artificial Intelligence and Machine Learning for Multi-Domain Operations", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 275, + 503, + 288 + ], + "spans": [ + { + "bbox": [ + 115, + 275, + 503, + 288 + ], + "score": 1.0, + "content": "Applications, volume 11006, pp. 1100612. International Society for Optics and Photonics, 2019.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 293, + 504, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "Casper Kaae Sønderby, Tapani Raiko, Lars Maaløe, Søren Kaae Sønderby, and Ole Winther. How", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 305, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 115, + 305, + 505, + 317 + ], + "score": 1.0, + "content": "to train deep variational autoencoders and probabilistic ladder networks. In 33rd International", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 315, + 337, + 329 + ], + "spans": [ + { + "bbox": [ + 116, + 315, + 337, + 329 + ], + "score": 1.0, + "content": "Conference on Machine Learning (ICML 2016), 2016.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 334, + 503, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 347, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 116, + 347, + 505, + 359 + ], + "score": 1.0, + "content": "Dropout: a simple way to prevent neural networks from overfitting. The journal of machine", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 357, + 291, + 369 + ], + "spans": [ + { + "bbox": [ + 116, + 357, + 291, + 369 + ], + "score": 1.0, + "content": "learning research, 15(1):1929–1958, 2014.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 105, + 375, + 504, + 399 + ], + "lines": [ + { + "bbox": [ + 106, + 375, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 375, + 505, + 388 + ], + "score": 1.0, + "content": "Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 386, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 115, + 386, + 505, + 399 + ], + "score": 1.0, + "content": "and Rob Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 107, + 405, + 504, + 439 + ], + "lines": [ + { + "bbox": [ + 105, + 405, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 505, + 419 + ], + "score": 1.0, + "content": "Christian Szegedy, Wei Liu, Yangqing Jia, Pierre Sermanet, Scott Reed, Dragomir Anguelov, Du-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 417, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 116, + 417, + 505, + 429 + ], + "score": 1.0, + "content": "mitru Erhan, Vincent Vanhoucke, and Andrew Rabinovich. Going deeper with convolutions. In", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 427, + 502, + 440 + ], + "spans": [ + { + "bbox": [ + 116, + 427, + 502, + 440 + ], + "score": 1.0, + "content": "Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 1–9, 2015.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 445, + 503, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "Mattias Teye, Hossein Azizpour, and Kevin Smith. Bayesian uncertainty estimation for batch nor-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 457, + 477, + 470 + ], + "spans": [ + { + "bbox": [ + 116, + 457, + 477, + 470 + ], + "score": 1.0, + "content": "malized deep networks. In International Conference on Machine Learning (ICML), 2018.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 106, + 475, + 504, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 475, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 488 + ], + "score": 1.0, + "content": "Marcin B Tomczak, Siddharth Swaroop, and Richard E Turner. Neural network ensembles and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 486, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 115, + 486, + 506, + 501 + ], + "score": 1.0, + "content": "variational inference revisited. In 1st Symposium on Advances in Approximate Bayesian Inference,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 498, + 181, + 509 + ], + "spans": [ + { + "bbox": [ + 115, + 498, + 181, + 509 + ], + "score": 1.0, + "content": "pp. 1–11, 2018.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 516, + 503, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "score": 1.0, + "content": "Linh Tran, Bastiaan S Veeling, Kevin Roth, Jakub Swiatkowski, Joshua V Dillon, Jasper Snoek,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 526, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 115, + 526, + 505, + 542 + ], + "score": 1.0, + "content": "Stephan Mandt, Tim Salimans, Sebastian Nowozin, and Rodolphe Jenatton. Hydra: Preserving", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 539, + 445, + 550 + ], + "spans": [ + { + "bbox": [ + 116, + 539, + 445, + 550 + ], + "score": 1.0, + "content": "ensemble diversity for model distillation. arXiv preprint arXiv:2001.04694, 2020.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 104, + 557, + 504, + 580 + ], + "lines": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "Karen Ullrich, Edward Meeds, and Max Welling. Soft weight-sharing for neural network compres-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 569, + 302, + 579 + ], + "spans": [ + { + "bbox": [ + 115, + 569, + 302, + 579 + ], + "score": 1.0, + "content": "sion. arXiv preprint arXiv:1702.04008, 2017.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 586, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "score": 1.0, + "content": "Juozas Vaicenavicius, David Widmann, Carl Andersson, Fredrik Lindsten, Jacob Roll, and", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 597, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 116, + 597, + 200, + 610 + ], + "score": 1.0, + "content": "Thomas B Schon.", + "type": "text" + }, + { + "bbox": [ + 216, + 597, + 424, + 611 + ], + "score": 1.0, + "content": "Evaluating model calibration in classification.", + "type": "text" + }, + { + "bbox": [ + 439, + 598, + 505, + 610 + ], + "score": 1.0, + "content": "arXiv preprint", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 609, + 219, + 620 + ], + "spans": [ + { + "bbox": [ + 115, + 609, + 219, + 620 + ], + "score": 1.0, + "content": "arXiv:1902.06977, 2019.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 106, + 627, + 504, + 662 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "score": 1.0, + "content": "Kuan-Chieh Wang, Paul Vicol, James Lucas, Li Gu, Roger Grosse, and Richard Zemel. Adversar-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "ial distillation of bayesian neural network posteriors. In International Conference on Machine", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 650, + 248, + 662 + ], + "spans": [ + { + "bbox": [ + 116, + 650, + 248, + 662 + ], + "score": 1.0, + "content": "Learning, pp. 5177–5186, 2018.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 105, + 668, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 682 + ], + "score": 1.0, + "content": "Sida Wang and Christopher Manning. Fast dropout training. In international conference on machine", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 680, + 235, + 692 + ], + "spans": [ + { + "bbox": [ + 116, + 680, + 235, + 692 + ], + "score": 1.0, + "content": "learning, pp. 118–126, 2013.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "Max Welling and Yee W Teh. Bayesian learning via stochastic gradient langevin dynamics. In", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "Proceedings of the 28th international conference on machine learning (ICML-11), pp. 681–688,", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 115, + 719, + 143, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 719, + 143, + 732 + ], + "score": 1.0, + "content": "2011.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45 + } + ], + "page_idx": 12, + "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, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "score": 1.0, + "content": "Joaquin Quinonero-Candela, Carl Edward Rasmussen, Fabian Sinz, Olivier Bousquet, and Bern-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "hard Scholkopf. Evaluating predictive uncertainty challenge. In ¨ Machine Learning Challenges", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 117, + 104, + 265, + 118 + ], + "spans": [ + { + "bbox": [ + 117, + 104, + 265, + 118 + ], + "score": 1.0, + "content": "Workshop, pp. 1–27. Springer, 2005.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 82, + 505, + 118 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 122, + 504, + 145 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 136 + ], + "score": 1.0, + "content": "Hippolyt Ritter, Aleksandar Botev, and David Barber. A scalable laplace approximation for neural", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 114, + 133, + 184, + 146 + ], + "spans": [ + { + "bbox": [ + 114, + 133, + 184, + 146 + ], + "score": 1.0, + "content": "networks. 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 121, + 505, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 152, + 503, + 187 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 505, + 166 + ], + "score": 1.0, + "content": "Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 505, + 177 + ], + "score": 1.0, + "content": "Huang, Andrej Karpathy, Aditya Khosla, Michael Bernstein, et al. Imagenet large scale visual", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 175, + 468, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 175, + 468, + 187 + ], + "score": 1.0, + "content": "recognition challenge. International journal of computer vision, 115(3):211–252, 2015.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 152, + 505, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 193, + 504, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 193, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 206 + ], + "score": 1.0, + "content": "Burr Settles. Active learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 6", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 205, + 186, + 217 + ], + "spans": [ + { + "bbox": [ + 116, + 205, + 186, + 217 + ], + "score": 1.0, + "content": "(1):1–114, 2012.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 193, + 505, + 217 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 503, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 221, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 238 + ], + "score": 1.0, + "content": "Karen Simonyan and Andrew Zisserman. Very deep convolutional networks for large-scale image", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 235, + 325, + 245 + ], + "spans": [ + { + "bbox": [ + 116, + 235, + 325, + 245 + ], + "score": 1.0, + "content": "recognition. arXiv preprint arXiv:1409.1556, 2014.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 221, + 505, + 245 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 253, + 504, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 506, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 506, + 267 + ], + "score": 1.0, + "content": "Leslie N Smith and Nicholay Topin. Super-convergence: Very fast training of neural networks using", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 265, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 116, + 265, + 505, + 276 + ], + "score": 1.0, + "content": "large learning rates. In Artificial Intelligence and Machine Learning for Multi-Domain Operations", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 275, + 503, + 288 + ], + "spans": [ + { + "bbox": [ + 115, + 275, + 503, + 288 + ], + "score": 1.0, + "content": "Applications, volume 11006, pp. 1100612. International Society for Optics and Photonics, 2019.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 252, + 506, + 288 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 293, + 504, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "Casper Kaae Sønderby, Tapani Raiko, Lars Maaløe, Søren Kaae Sønderby, and Ole Winther. How", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 305, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 115, + 305, + 505, + 317 + ], + "score": 1.0, + "content": "to train deep variational autoencoders and probabilistic ladder networks. In 33rd International", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 315, + 337, + 329 + ], + "spans": [ + { + "bbox": [ + 116, + 315, + 337, + 329 + ], + "score": 1.0, + "content": "Conference on Machine Learning (ICML 2016), 2016.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 294, + 505, + 329 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 334, + 503, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 347, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 116, + 347, + 505, + 359 + ], + "score": 1.0, + "content": "Dropout: a simple way to prevent neural networks from overfitting. The journal of machine", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 357, + 291, + 369 + ], + "spans": [ + { + "bbox": [ + 116, + 357, + 291, + 369 + ], + "score": 1.0, + "content": "learning research, 15(1):1929–1958, 2014.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 334, + 505, + 369 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 375, + 504, + 399 + ], + "lines": [ + { + "bbox": [ + 106, + 375, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 375, + 505, + 388 + ], + "score": 1.0, + "content": "Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 386, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 115, + 386, + 505, + 399 + ], + "score": 1.0, + "content": "and Rob Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 106, + 375, + 505, + 399 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 405, + 504, + 439 + ], + "lines": [ + { + "bbox": [ + 105, + 405, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 505, + 419 + ], + "score": 1.0, + "content": "Christian Szegedy, Wei Liu, Yangqing Jia, Pierre Sermanet, Scott Reed, Dragomir Anguelov, Du-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 417, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 116, + 417, + 505, + 429 + ], + "score": 1.0, + "content": "mitru Erhan, Vincent Vanhoucke, and Andrew Rabinovich. Going deeper with convolutions. In", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 427, + 502, + 440 + ], + "spans": [ + { + "bbox": [ + 116, + 427, + 502, + 440 + ], + "score": 1.0, + "content": "Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 1–9, 2015.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 405, + 505, + 440 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 445, + 503, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "Mattias Teye, Hossein Azizpour, and Kevin Smith. Bayesian uncertainty estimation for batch nor-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 457, + 477, + 470 + ], + "spans": [ + { + "bbox": [ + 116, + 457, + 477, + 470 + ], + "score": 1.0, + "content": "malized deep networks. In International Conference on Machine Learning (ICML), 2018.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 446, + 505, + 470 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 475, + 504, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 475, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 488 + ], + "score": 1.0, + "content": "Marcin B Tomczak, Siddharth Swaroop, and Richard E Turner. Neural network ensembles and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 486, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 115, + 486, + 506, + 501 + ], + "score": 1.0, + "content": "variational inference revisited. In 1st Symposium on Advances in Approximate Bayesian Inference,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 498, + 181, + 509 + ], + "spans": [ + { + "bbox": [ + 115, + 498, + 181, + 509 + ], + "score": 1.0, + "content": "pp. 1–11, 2018.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29, + "bbox_fs": [ + 106, + 475, + 506, + 509 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 516, + 503, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "score": 1.0, + "content": "Linh Tran, Bastiaan S Veeling, Kevin Roth, Jakub Swiatkowski, Joshua V Dillon, Jasper Snoek,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 526, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 115, + 526, + 505, + 542 + ], + "score": 1.0, + "content": "Stephan Mandt, Tim Salimans, Sebastian Nowozin, and Rodolphe Jenatton. Hydra: Preserving", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 539, + 445, + 550 + ], + "spans": [ + { + "bbox": [ + 116, + 539, + 445, + 550 + ], + "score": 1.0, + "content": "ensemble diversity for model distillation. arXiv preprint arXiv:2001.04694, 2020.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 516, + 505, + 550 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 557, + 504, + 580 + ], + "lines": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "Karen Ullrich, Edward Meeds, and Max Welling. Soft weight-sharing for neural network compres-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 569, + 302, + 579 + ], + "spans": [ + { + "bbox": [ + 115, + 569, + 302, + 579 + ], + "score": 1.0, + "content": "sion. arXiv preprint arXiv:1702.04008, 2017.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 106, + 558, + 505, + 579 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 586, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 505, + 599 + ], + "score": 1.0, + "content": "Juozas Vaicenavicius, David Widmann, Carl Andersson, Fredrik Lindsten, Jacob Roll, and", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 597, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 116, + 597, + 200, + 610 + ], + "score": 1.0, + "content": "Thomas B Schon.", + "type": "text" + }, + { + "bbox": [ + 216, + 597, + 424, + 611 + ], + "score": 1.0, + "content": "Evaluating model calibration in classification.", + "type": "text" + }, + { + "bbox": [ + 439, + 598, + 505, + 610 + ], + "score": 1.0, + "content": "arXiv preprint", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 609, + 219, + 620 + ], + "spans": [ + { + "bbox": [ + 115, + 609, + 219, + 620 + ], + "score": 1.0, + "content": "arXiv:1902.06977, 2019.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 586, + 505, + 620 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 627, + 504, + 662 + ], + "lines": [ + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 641 + ], + "score": 1.0, + "content": "Kuan-Chieh Wang, Paul Vicol, James Lucas, Li Gu, Roger Grosse, and Richard Zemel. Adversar-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 639, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 639, + 505, + 651 + ], + "score": 1.0, + "content": "ial distillation of bayesian neural network posteriors. In International Conference on Machine", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 650, + 248, + 662 + ], + "spans": [ + { + "bbox": [ + 116, + 650, + 248, + 662 + ], + "score": 1.0, + "content": "Learning, pp. 5177–5186, 2018.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 627, + 505, + 662 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 668, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 682 + ], + "score": 1.0, + "content": "Sida Wang and Christopher Manning. Fast dropout training. In international conference on machine", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 680, + 235, + 692 + ], + "spans": [ + { + "bbox": [ + 116, + 680, + 235, + 692 + ], + "score": 1.0, + "content": "learning, pp. 118–126, 2013.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 668, + 505, + 692 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "Max Welling and Yee W Teh. Bayesian learning via stochastic gradient langevin dynamics. In", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "Proceedings of the 28th international conference on machine learning (ICML-11), pp. 681–688,", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 115, + 719, + 143, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 719, + 143, + 732 + ], + "score": 1.0, + "content": "2011.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 698, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Anqi Wu, Sebastian Nowozin, Edward Meeds, Richard E Turner, Jose Miguel Hern ´ andez-Lobato, ´", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "and Alexander L Gaunt. Deterministic variational inference for robust bayesian neural networks.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 103, + 143, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 103, + 143, + 117 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 504, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 504, + 136 + ], + "score": 1.0, + "content": "Sergey Zagoruyko. 92.45 on cifar-10 in torch, 2015. URL http://torch.ch/blog/2015/", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 133, + 218, + 146 + ], + "spans": [ + { + "bbox": [ + 116, + 133, + 218, + 146 + ], + "score": 1.0, + "content": "07/30/cifar.html.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 152, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 297, + 165 + ], + "score": 1.0, + "content": "Sergey Zagoruyko and Nikos Komodakis.", + "type": "text" + }, + { + "bbox": [ + 313, + 153, + 429, + 165 + ], + "score": 1.0, + "content": "Wide residual networks.", + "type": "text" + }, + { + "bbox": [ + 437, + 152, + 505, + 167 + ], + "score": 1.0, + "content": "arXiv preprint", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 219, + 176 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 219, + 176 + ], + "score": 1.0, + "content": "arXiv:1605.07146, 2016.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 105, + 182, + 504, + 206 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 505, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 197 + ], + "score": 1.0, + "content": "Hongyi Zhang, Moustapha Cisse, Yann N Dauphin, and David Lopez-Paz. mixup: Beyond empirical", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 356, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 356, + 206 + ], + "score": 1.0, + "content": "risk minimization. arXiv preprint arXiv:1710.09412, 2017.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 105, + 213, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 212, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 226 + ], + "score": 1.0, + "content": "Ruqi Zhang, Chunyuan Li, Jianyi Zhang, Changyou Chen, and Andrew Gordon Wilson. Cyclical", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 224, + 495, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 224, + 495, + 236 + ], + "score": 1.0, + "content": "stochastic gradient mcmc for bayesian deep learning. arXiv preprint arXiv:1902.03932, 2019.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 108, + 26, + 294, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 293, + 38 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Anqi Wu, Sebastian Nowozin, Edward Meeds, Richard E Turner, Jose Miguel Hern ´ andez-Lobato, ´", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "and Alexander L Gaunt. Deterministic variational inference for robust bayesian neural networks.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 103, + 143, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 103, + 143, + 117 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 505, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 504, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 504, + 136 + ], + "score": 1.0, + "content": "Sergey Zagoruyko. 92.45 on cifar-10 in torch, 2015. URL http://torch.ch/blog/2015/", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 133, + 218, + 146 + ], + "spans": [ + { + "bbox": [ + 116, + 133, + 218, + 146 + ], + "score": 1.0, + "content": "07/30/cifar.html.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 122, + 504, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 152, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 297, + 165 + ], + "score": 1.0, + "content": "Sergey Zagoruyko and Nikos Komodakis.", + "type": "text" + }, + { + "bbox": [ + 313, + 153, + 429, + 165 + ], + "score": 1.0, + "content": "Wide residual networks.", + "type": "text" + }, + { + "bbox": [ + 437, + 152, + 505, + 167 + ], + "score": 1.0, + "content": "arXiv preprint", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 219, + 176 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 219, + 176 + ], + "score": 1.0, + "content": "arXiv:1605.07146, 2016.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 152, + 505, + 176 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 182, + 504, + 206 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 505, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 197 + ], + "score": 1.0, + "content": "Hongyi Zhang, Moustapha Cisse, Yann N Dauphin, and David Lopez-Paz. mixup: Beyond empirical", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 356, + 206 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 356, + 206 + ], + "score": 1.0, + "content": "risk minimization. arXiv preprint arXiv:1710.09412, 2017.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 182, + 505, + 206 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 213, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 212, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 226 + ], + "score": 1.0, + "content": "Ruqi Zhang, Chunyuan Li, Jianyi Zhang, Changyou Chen, and Andrew Gordon Wilson. Cyclical", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 224, + 495, + 236 + ], + "spans": [ + { + "bbox": [ + 115, + 224, + 495, + 236 + ], + "score": 1.0, + "content": "stochastic gradient mcmc for bayesian deep learning. arXiv preprint arXiv:1902.03932, 2019.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 212, + 505, + 236 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 146, + 50, + 462, + 191 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 146, + 50, + 462, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 146, + 50, + 462, + 191 + ], + "spans": [ + { + "bbox": [ + 146, + 50, + 462, + 191 + ], + "score": 0.971, + "type": "image", + "image_path": "b99ab9378285371b9bd9ddff05efc8db0b75a615ceaadc0061e7d48e93d60585.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 146, + 50, + 462, + 97.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 146, + 97.0, + 462, + 144.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 146, + 144.0, + 462, + 191.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 200, + 503, + 223 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 199, + 505, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 505, + 214 + ], + "score": 1.0, + "content": "Figure 6: The mean cost of training of an ensemble vs. the mean deep ensemble equivalent score.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 211, + 338, + 224 + ], + "spans": [ + { + "bbox": [ + 106, + 211, + 338, + 224 + ], + "score": 1.0, + "content": "Each marker on the plot denotes one snapshot of weights.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "image", + "bbox": [ + 167, + 237, + 444, + 458 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 167, + 237, + 444, + 458 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 167, + 237, + 444, + 458 + ], + "spans": [ + { + "bbox": [ + 167, + 237, + 444, + 458 + ], + "score": 0.973, + "type": "image", + "image_path": "5c4fc74147c281d75e6de7a251e4d1655d62287a436773f81f5644901192105e.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 167, + 237, + 444, + 251.73333333333332 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 167, + 251.73333333333332, + 444, + 266.46666666666664 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 167, + 266.46666666666664, + 444, + 281.2 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 167, + 281.2, + 444, + 295.93333333333334 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 167, + 295.93333333333334, + 444, + 310.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 167, + 310.6666666666667, + 444, + 325.40000000000003 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 167, + 325.40000000000003, + 444, + 340.1333333333334 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 167, + 340.1333333333334, + 444, + 354.86666666666673 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 167, + 354.86666666666673, + 444, + 369.6000000000001 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 167, + 369.6000000000001, + 444, + 384.3333333333334 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 167, + 384.3333333333334, + 444, + 399.0666666666668 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 167, + 399.0666666666668, + 444, + 413.8000000000001 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 167, + 413.8000000000001, + 444, + 428.5333333333335 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 167, + 428.5333333333335, + 444, + 443.2666666666668 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 167, + 443.2666666666668, + 444, + 458.00000000000017 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 104, + 468, + 505, + 490 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 466, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 481 + ], + "score": 1.0, + "content": "Figure 7: Cost of training of an ensemble vs. its quality (DEE). Each marker on a plot denotes one", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 478, + 190, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 190, + 491 + ], + "score": 1.0, + "content": "snapshot of weights.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + } + ], + "index": 16.25 + }, + { + "type": "title", + "bbox": [ + 107, + 512, + 443, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 446, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 446, + 526 + ], + "score": 1.0, + "content": "A IS ”EFFICIENT” TRAINING OF ENSEMBLES EFFICIENT AT ALL?", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 538, + 504, + 571 + ], + "lines": [ + { + "bbox": [ + 106, + 537, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 505, + 551 + ], + "score": 1.0, + "content": "Yes! If you care most about training time efficiency. All snapshot based methods (SSE, cSGLD", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 549, + 505, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 505, + 562 + ], + "score": 1.0, + "content": "and FGE) on average (Figure 6) tend to achieve the same performance as deep ensembles using", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 560, + 292, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 560, + 129, + 571 + ], + "score": 0.84, + "content": "2 { - } 5 \\times", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 560, + 292, + 573 + ], + "score": 1.0, + "content": "less training epochs on CIFAR datasets.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 577, + 503, + 611 + ], + "lines": [ + { + "bbox": [ + 106, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "The gain comes at a cost of inference efficiency and memory consumption. ”Efficient” snapshot-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "score": 1.0, + "content": "based methods require to store much more samples of weights compared to deep ensembles making", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 600, + 471, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 289, + 612 + ], + "score": 1.0, + "content": "inference significantly more expensive (up to", + "type": "text" + }, + { + "bbox": [ + 289, + 600, + 308, + 610 + ], + "score": 0.85, + "content": "\\times 2 5", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 600, + 471, + 612 + ], + "score": 1.0, + "content": ") given the same predictive performance.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 616, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "You need to get lucky with hyperparameter choice. While on average ”efficient” snapshot-based", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "score": 1.0, + "content": "methods require less training resources, they might be completely inefficient if your hyperparameter", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "choice is sub-optimal (see Figure 7). Such hyperparameters as the maximum learning rate, the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "length of learning rate decay cycle, the snapshot saving schedule can all impact the performance", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 658, + 160, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 160, + 675 + ], + "score": 1.0, + "content": "significantly.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "This analysis assumes that we use only conventional training procedure. Many models can most", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 686, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 701 + ], + "score": 1.0, + "content": "likely be trained, stored and executed much more efficiently with methods like super-convergence,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "stochastic weight averaging, compression, distillation and others. These methods are out of the scope", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "of the paper but are interesting topics for future research. The current choice of hyperparameters", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 721, + 441, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 441, + 734 + ], + "score": 1.0, + "content": "may also not be optimal. We reuse the hyperparameters used in the original papers.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36 + } + ], + "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 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": "15", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 146, + 50, + 462, + 191 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 146, + 50, + 462, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 146, + 50, + 462, + 191 + ], + "spans": [ + { + "bbox": [ + 146, + 50, + 462, + 191 + ], + "score": 0.971, + "type": "image", + "image_path": "b99ab9378285371b9bd9ddff05efc8db0b75a615ceaadc0061e7d48e93d60585.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 146, + 50, + 462, + 97.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 146, + 97.0, + 462, + 144.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 146, + 144.0, + 462, + 191.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 200, + 503, + 223 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 199, + 505, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 505, + 214 + ], + "score": 1.0, + "content": "Figure 6: The mean cost of training of an ensemble vs. the mean deep ensemble equivalent score.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 211, + 338, + 224 + ], + "spans": [ + { + "bbox": [ + 106, + 211, + 338, + 224 + ], + "score": 1.0, + "content": "Each marker on the plot denotes one snapshot of weights.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "image", + "bbox": [ + 167, + 237, + 444, + 458 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 167, + 237, + 444, + 458 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 167, + 237, + 444, + 458 + ], + "spans": [ + { + "bbox": [ + 167, + 237, + 444, + 458 + ], + "score": 0.973, + "type": "image", + "image_path": "5c4fc74147c281d75e6de7a251e4d1655d62287a436773f81f5644901192105e.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 167, + 237, + 444, + 251.73333333333332 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 167, + 251.73333333333332, + 444, + 266.46666666666664 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 167, + 266.46666666666664, + 444, + 281.2 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 167, + 281.2, + 444, + 295.93333333333334 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 167, + 295.93333333333334, + 444, + 310.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 167, + 310.6666666666667, + 444, + 325.40000000000003 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 167, + 325.40000000000003, + 444, + 340.1333333333334 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 167, + 340.1333333333334, + 444, + 354.86666666666673 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 167, + 354.86666666666673, + 444, + 369.6000000000001 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 167, + 369.6000000000001, + 444, + 384.3333333333334 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 167, + 384.3333333333334, + 444, + 399.0666666666668 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 167, + 399.0666666666668, + 444, + 413.8000000000001 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 167, + 413.8000000000001, + 444, + 428.5333333333335 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 167, + 428.5333333333335, + 444, + 443.2666666666668 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 167, + 443.2666666666668, + 444, + 458.00000000000017 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 104, + 468, + 505, + 490 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 466, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 481 + ], + "score": 1.0, + "content": "Figure 7: Cost of training of an ensemble vs. its quality (DEE). Each marker on a plot denotes one", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 478, + 190, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 190, + 491 + ], + "score": 1.0, + "content": "snapshot of weights.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + } + ], + "index": 16.25 + }, + { + "type": "title", + "bbox": [ + 107, + 512, + 443, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 446, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 446, + 526 + ], + "score": 1.0, + "content": "A IS ”EFFICIENT” TRAINING OF ENSEMBLES EFFICIENT AT ALL?", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 538, + 504, + 571 + ], + "lines": [ + { + "bbox": [ + 106, + 537, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 505, + 551 + ], + "score": 1.0, + "content": "Yes! If you care most about training time efficiency. All snapshot based methods (SSE, cSGLD", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 549, + 505, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 505, + 562 + ], + "score": 1.0, + "content": "and FGE) on average (Figure 6) tend to achieve the same performance as deep ensembles using", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 560, + 292, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 560, + 129, + 571 + ], + "score": 0.84, + "content": "2 { - } 5 \\times", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 560, + 292, + 573 + ], + "score": 1.0, + "content": "less training epochs on CIFAR datasets.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 537, + 505, + 573 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 577, + 503, + 611 + ], + "lines": [ + { + "bbox": [ + 106, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "The gain comes at a cost of inference efficiency and memory consumption. ”Efficient” snapshot-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 601 + ], + "score": 1.0, + "content": "based methods require to store much more samples of weights compared to deep ensembles making", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 600, + 471, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 289, + 612 + ], + "score": 1.0, + "content": "inference significantly more expensive (up to", + "type": "text" + }, + { + "bbox": [ + 289, + 600, + 308, + 610 + ], + "score": 0.85, + "content": "\\times 2 5", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 600, + 471, + 612 + ], + "score": 1.0, + "content": ") given the same predictive performance.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 577, + 505, + 612 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 616, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "You need to get lucky with hyperparameter choice. While on average ”efficient” snapshot-based", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "score": 1.0, + "content": "methods require less training resources, they might be completely inefficient if your hyperparameter", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "choice is sub-optimal (see Figure 7). Such hyperparameters as the maximum learning rate, the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "length of learning rate decay cycle, the snapshot saving schedule can all impact the performance", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 658, + 160, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 160, + 675 + ], + "score": 1.0, + "content": "significantly.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 615, + 506, + 675 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "This analysis assumes that we use only conventional training procedure. Many models can most", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 686, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 701 + ], + "score": 1.0, + "content": "likely be trained, stored and executed much more efficiently with methods like super-convergence,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "stochastic weight averaging, compression, distillation and others. These methods are out of the scope", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "of the paper but are interesting topics for future research. The current choice of hyperparameters", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 721, + 441, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 441, + 734 + ], + "score": 1.0, + "content": "may also not be optimal. We reuse the hyperparameters used in the original papers.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 676, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 255, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 256, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 256, + 96 + ], + "score": 1.0, + "content": "B EXPERIMENTAL DETAILS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 107, + 505, + 185 + ], + "lines": [ + { + "bbox": [ + 106, + 108, + 505, + 120 + ], + "spans": [ + { + "bbox": [ + 106, + 108, + 505, + 120 + ], + "score": 1.0, + "content": "Implementations of deep ensembles, SWAG, FGE and K-FAC Laplace are heavily based on the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 118, + 505, + 131 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 505, + 131 + ], + "score": 1.0, + "content": "original PyTorch implementations of stochastic weight averaging (SWA) 2 and SWAG 3. Imple-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 130, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 130, + 506, + 142 + ], + "score": 1.0, + "content": "mentations of cyclical MCMC and snapshot ensembles are based on the original implementation of", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 138, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 104, + 138, + 506, + 155 + ], + "score": 1.0, + "content": "cyclical MCMC 4. We hypothesize that the optimal hyperparameters of ensembling methods may", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 151, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 164 + ], + "score": 1.0, + "content": "vary widely depending on the computational budget and the number of samples in the ensemble.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "score": 1.0, + "content": "Searching for the optimal values for each configuration is outside the scope of this paper so we stick", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 173, + 359, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 359, + 186 + ], + "score": 1.0, + "content": "to the originally proposed hyperparameters whenever possible.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 199, + 505, + 244 + ], + "lines": [ + { + "bbox": [ + 106, + 200, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 505, + 212 + ], + "score": 1.0, + "content": "Implied probabilistic model Conventional neural networks for classification are usually trained", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 210, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 505, + 222 + ], + "score": 1.0, + "content": "using the average cross-entropy loss function with weight decay regularization hidden inside an", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 222, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 234 + ], + "score": 1.0, + "content": "optimizer in a deep learning framework like PyTorch. The underlying optimization problem can be", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 233, + 182, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 182, + 244 + ], + "score": 1.0, + "content": "written as follows:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 249, + 413, + 284 + ], + "lines": [ + { + "bbox": [ + 198, + 249, + 413, + 284 + ], + "spans": [ + { + "bbox": [ + 198, + 249, + 413, + 284 + ], + "score": 0.94, + "content": "L ( w ) = - \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\log \\hat { p } ( y _ { i } ^ { * } \\mid x _ { i } , w ) + \\frac { \\lambda } { 2 } \\| w \\| ^ { 2 } \\operatorname* { m i n } _ { w } ,", + "type": "interline_equation", + "image_path": "c15a121a2b84c7453dfe015d29b383c1561b686a56c508b6b0fd1e6eb6d38e3a.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 198, + 249, + 413, + 266.5 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 198, + 266.5, + 413, + 284.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 291, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 290, + 506, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 134, + 306 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 291, + 189, + 304 + ], + "score": 0.95, + "content": "\\{ ( x _ { i } , y _ { i } ^ { * } ) \\} _ { i = 1 } ^ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 290, + 293, + 306 + ], + "score": 1.0, + "content": "is the training dataset of", + "type": "text" + }, + { + "bbox": [ + 293, + 294, + 303, + 302 + ], + "score": 0.85, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 290, + 336, + 306 + ], + "score": 1.0, + "content": "objects", + "type": "text" + }, + { + "bbox": [ + 336, + 294, + 347, + 303 + ], + "score": 0.85, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 290, + 456, + 306 + ], + "score": 1.0, + "content": "with corresponding labels", + "type": "text" + }, + { + "bbox": [ + 456, + 292, + 479, + 304 + ], + "score": 0.29, + "content": "y _ { i } ^ { * } , \\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 290, + 506, + 306 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 303, + 504, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 303, + 201, + 315 + ], + "score": 1.0, + "content": "weight decay scale and", + "type": "text" + }, + { + "bbox": [ + 201, + 303, + 246, + 315 + ], + "score": 0.93, + "content": "\\hat { p } ( j | x _ { i } , w )", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 303, + 495, + 315 + ], + "score": 1.0, + "content": "denotes the probability that a neural network with parameters", + "type": "text" + }, + { + "bbox": [ + 495, + 305, + 504, + 312 + ], + "score": 0.76, + "content": "w", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 314, + 295, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 170, + 327 + ], + "score": 1.0, + "content": "assigns to class", + "type": "text" + }, + { + "bbox": [ + 170, + 315, + 176, + 326 + ], + "score": 0.83, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 314, + 280, + 327 + ], + "score": 1.0, + "content": "when evaluated on object", + "type": "text" + }, + { + "bbox": [ + 281, + 316, + 290, + 325 + ], + "score": 0.82, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 314, + 295, + 327 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 108, + 330, + 504, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 314, + 344 + ], + "score": 1.0, + "content": "The cross-entropy loss defines a likelihood function", + "type": "text" + }, + { + "bbox": [ + 315, + 331, + 361, + 343 + ], + "score": 0.93, + "content": "p ( y ^ { * } \\mid x , w )", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 330, + 506, + 344 + ], + "score": 1.0, + "content": "and weight decay regularization, or", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 107, + 342, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 107, + 342, + 119, + 353 + ], + "score": 0.87, + "content": "L _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 342, + 393, + 354 + ], + "score": 1.0, + "content": "regularization corresponding to a certain Gaussian prior distribution", + "type": "text" + }, + { + "bbox": [ + 394, + 342, + 415, + 354 + ], + "score": 0.91, + "content": "p ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 342, + 505, + 354 + ], + "score": 1.0, + "content": ". The whole optimiza-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 352, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 506, + 366 + ], + "score": 1.0, + "content": "tion objective then corresponds to the maximum a posteriori inference in the following probabilistic", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 363, + 138, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 138, + 375 + ], + "score": 1.0, + "content": "model:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 167, + 380, + 443, + 458 + ], + "lines": [ + { + "bbox": [ + 167, + 380, + 443, + 458 + ], + "spans": [ + { + "bbox": [ + 167, + 380, + 443, + 458 + ], + "score": 0.91, + "content": "\\begin{array} { c } { { p ( y ^ { * } , w \\mid x ) = p ( y ^ { * } \\mid x , w ) p ( w ) , } } \\\\ { { \\displaystyle \\log p ( y ^ { * } \\mid x , w ) = \\log \\prod _ { i = 1 } ^ { N } p ( y _ { i } ^ { * } \\mid x _ { i } , w ) = \\sum _ { i = 1 } ^ { N } \\log \\hat { p } ( y _ { i } ^ { * } \\mid x _ { i } , w ) , } } \\\\ { { \\displaystyle \\log p ( w ) = \\frac { - N \\lambda } { 2 } \\| w \\| ^ { 2 } + \\mathrm { c o n s t } \\iff p ( w ) = \\mathcal { N } \\left( w \\mid 0 , ( N \\lambda ) ^ { - 1 } I \\right) } } \\end{array}", + "type": "interline_equation", + "image_path": "7ac45338e73506d4a3bdecb2bf94c6358548f4caa1ed12b136afcbd31fe3007f.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 167, + 380, + 443, + 406.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 167, + 406.0, + 443, + 432.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 167, + 432.0, + 443, + 458.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 463, + 505, + 530 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 504, + 476 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 504, + 476 + ], + "score": 1.0, + "content": "In order to make the results comparable across all ensembling techniques, we used the same prob-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "abilistic model for all methods, choosing fixed weight decay parameters for each architecture. We", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 484, + 504, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 504, + 498 + ], + "score": 1.0, + "content": "used the softmax-based likelihood for all models. We also use the fully-factorized zero-mean Gaus-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 495, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 255, + 509 + ], + "score": 1.0, + "content": "sian prior distribution with variances", + "type": "text" + }, + { + "bbox": [ + 256, + 496, + 314, + 508 + ], + "score": 0.94, + "content": "\\sigma ^ { 2 } = ( N \\lambda ) ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 495, + 432, + 509 + ], + "score": 1.0, + "content": "where the number of objects", + "type": "text" + }, + { + "bbox": [ + 432, + 497, + 442, + 506 + ], + "score": 0.81, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 495, + 506, + 509 + ], + "score": 1.0, + "content": "and the weight", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 155, + 520 + ], + "score": 1.0, + "content": "decay scale", + "type": "text" + }, + { + "bbox": [ + 156, + 508, + 163, + 517 + ], + "score": 0.77, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "are dictated by the particular datasets and neural architectures as defined in the fol-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 519, + 180, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 180, + 531 + ], + "score": 1.0, + "content": "lowing paragraph.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 106, + 543, + 505, + 676 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "Conventional networks To train a single network on CIFAR-10/100, we used SGD with batch", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 457, + 568 + ], + "score": 1.0, + "content": "size of 128, momentum 0.9 and model-specific parameters, i.e. the initial learning rate", + "type": "text" + }, + { + "bbox": [ + 457, + 555, + 486, + 567 + ], + "score": 0.9, + "content": "( l r _ { i n i t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 555, + 505, + 568 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 565, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 505, + 579 + ], + "score": 1.0, + "content": "weight decay coefficient (wd), and the number of optimization epochs (epoch). Specific hyperpa-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 578, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 589 + ], + "score": 1.0, + "content": "rameters are shown in Table 1. The models were trained with a unified learning rate scheduler that", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "is shown in equation 10. All models have been trained using data augmentation that consists of hor-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "score": 1.0, + "content": "izontal flips and a random crop of 32 pixels with a padding of 4 pixels5. The standard data normal-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 610, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 505, + 622 + ], + "score": 1.0, + "content": "ization has also been applied. Weight decays, initial learning rates, and the learning rate scheduler", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "were taken from (Garipov et al., 2018) paper. Compared with hyperparameters of (Garipov et al.,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 631, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 505, + 644 + ], + "score": 1.0, + "content": "2018), we increased the number of optimization epochs since we found that all models were un-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 642, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 642, + 505, + 655 + ], + "score": 1.0, + "content": "derfitted. While the original WideResNet28x10 network includes a number of dropout layers with", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 141, + 665 + ], + "score": 0.91, + "content": "p = 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 654, + 506, + 667 + ], + "score": 1.0, + "content": "and is trained for 200 epochs, we find that the WideResNet28x10 underfits in this setting", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 308, + 678 + ], + "score": 1.0, + "content": "and requires a longer training. Therefore, we used", + "type": "text" + }, + { + "bbox": [ + 309, + 665, + 333, + 676 + ], + "score": 0.91, + "content": "p = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 664, + 505, + 678 + ], + "score": 1.0, + "content": "which reduces training time while bearing", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 35.5 + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 689, + 447, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 686, + 304, + 702 + ], + "spans": [ + { + "bbox": [ + 118, + 686, + 304, + 702 + ], + "score": 1.0, + "content": "2https://github.com/timgaripov/swa", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 696, + 342, + 714 + ], + "spans": [ + { + "bbox": [ + 118, + 696, + 342, + 714 + ], + "score": 1.0, + "content": "3https://github.com/wjmaddox/swa_gaussian", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 708, + 448, + 723 + ], + "spans": [ + { + "bbox": [ + 118, + 708, + 448, + 723 + ], + "score": 1.0, + "content": "4https://github.com/ruqizhang/csgmcmc/tree/master/experiments", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 720, + 446, + 734 + ], + "spans": [ + { + "bbox": [ + 118, + 720, + 419, + 734 + ], + "score": 1.0, + "content": "5Compose([RandomHorizontalFlip(), RandomCrop(32, padding", + "type": "text" + }, + { + "bbox": [ + 419, + 722, + 430, + 731 + ], + "score": 0.73, + "content": "= 4", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 720, + 446, + 734 + ], + "score": 1.0, + "content": ")])", + "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": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "16", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 255, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 256, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 256, + 96 + ], + "score": 1.0, + "content": "B EXPERIMENTAL DETAILS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 107, + 505, + 185 + ], + "lines": [ + { + "bbox": [ + 106, + 108, + 505, + 120 + ], + "spans": [ + { + "bbox": [ + 106, + 108, + 505, + 120 + ], + "score": 1.0, + "content": "Implementations of deep ensembles, SWAG, FGE and K-FAC Laplace are heavily based on the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 118, + 505, + 131 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 505, + 131 + ], + "score": 1.0, + "content": "original PyTorch implementations of stochastic weight averaging (SWA) 2 and SWAG 3. Imple-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 130, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 130, + 506, + 142 + ], + "score": 1.0, + "content": "mentations of cyclical MCMC and snapshot ensembles are based on the original implementation of", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 138, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 104, + 138, + 506, + 155 + ], + "score": 1.0, + "content": "cyclical MCMC 4. We hypothesize that the optimal hyperparameters of ensembling methods may", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 151, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 164 + ], + "score": 1.0, + "content": "vary widely depending on the computational budget and the number of samples in the ensemble.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 175 + ], + "score": 1.0, + "content": "Searching for the optimal values for each configuration is outside the scope of this paper so we stick", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 173, + 359, + 186 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 359, + 186 + ], + "score": 1.0, + "content": "to the originally proposed hyperparameters whenever possible.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4, + "bbox_fs": [ + 104, + 108, + 506, + 186 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 199, + 505, + 244 + ], + "lines": [ + { + "bbox": [ + 106, + 200, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 505, + 212 + ], + "score": 1.0, + "content": "Implied probabilistic model Conventional neural networks for classification are usually trained", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 210, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 505, + 222 + ], + "score": 1.0, + "content": "using the average cross-entropy loss function with weight decay regularization hidden inside an", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 222, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 234 + ], + "score": 1.0, + "content": "optimizer in a deep learning framework like PyTorch. The underlying optimization problem can be", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 233, + 182, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 182, + 244 + ], + "score": 1.0, + "content": "written as follows:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 200, + 505, + 244 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 249, + 413, + 284 + ], + "lines": [ + { + "bbox": [ + 198, + 249, + 413, + 284 + ], + "spans": [ + { + "bbox": [ + 198, + 249, + 413, + 284 + ], + "score": 0.94, + "content": "L ( w ) = - \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\log \\hat { p } ( y _ { i } ^ { * } \\mid x _ { i } , w ) + \\frac { \\lambda } { 2 } \\| w \\| ^ { 2 } \\operatorname* { m i n } _ { w } ,", + "type": "interline_equation", + "image_path": "c15a121a2b84c7453dfe015d29b383c1561b686a56c508b6b0fd1e6eb6d38e3a.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 198, + 249, + 413, + 266.5 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 198, + 266.5, + 413, + 284.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 291, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 290, + 506, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 134, + 306 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 291, + 189, + 304 + ], + "score": 0.95, + "content": "\\{ ( x _ { i } , y _ { i } ^ { * } ) \\} _ { i = 1 } ^ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 290, + 293, + 306 + ], + "score": 1.0, + "content": "is the training dataset of", + "type": "text" + }, + { + "bbox": [ + 293, + 294, + 303, + 302 + ], + "score": 0.85, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 290, + 336, + 306 + ], + "score": 1.0, + "content": "objects", + "type": "text" + }, + { + "bbox": [ + 336, + 294, + 347, + 303 + ], + "score": 0.85, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 290, + 456, + 306 + ], + "score": 1.0, + "content": "with corresponding labels", + "type": "text" + }, + { + "bbox": [ + 456, + 292, + 479, + 304 + ], + "score": 0.29, + "content": "y _ { i } ^ { * } , \\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 290, + 506, + 306 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 303, + 504, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 303, + 201, + 315 + ], + "score": 1.0, + "content": "weight decay scale and", + "type": "text" + }, + { + "bbox": [ + 201, + 303, + 246, + 315 + ], + "score": 0.93, + "content": "\\hat { p } ( j | x _ { i } , w )", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 303, + 495, + 315 + ], + "score": 1.0, + "content": "denotes the probability that a neural network with parameters", + "type": "text" + }, + { + "bbox": [ + 495, + 305, + 504, + 312 + ], + "score": 0.76, + "content": "w", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 314, + 295, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 170, + 327 + ], + "score": 1.0, + "content": "assigns to class", + "type": "text" + }, + { + "bbox": [ + 170, + 315, + 176, + 326 + ], + "score": 0.83, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 314, + 280, + 327 + ], + "score": 1.0, + "content": "when evaluated on object", + "type": "text" + }, + { + "bbox": [ + 281, + 316, + 290, + 325 + ], + "score": 0.82, + "content": "x _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 314, + 295, + 327 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 290, + 506, + 327 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 330, + 504, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 314, + 344 + ], + "score": 1.0, + "content": "The cross-entropy loss defines a likelihood function", + "type": "text" + }, + { + "bbox": [ + 315, + 331, + 361, + 343 + ], + "score": 0.93, + "content": "p ( y ^ { * } \\mid x , w )", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 330, + 506, + 344 + ], + "score": 1.0, + "content": "and weight decay regularization, or", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 107, + 342, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 107, + 342, + 119, + 353 + ], + "score": 0.87, + "content": "L _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 342, + 393, + 354 + ], + "score": 1.0, + "content": "regularization corresponding to a certain Gaussian prior distribution", + "type": "text" + }, + { + "bbox": [ + 394, + 342, + 415, + 354 + ], + "score": 0.91, + "content": "p ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 342, + 505, + 354 + ], + "score": 1.0, + "content": ". The whole optimiza-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 352, + 506, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 506, + 366 + ], + "score": 1.0, + "content": "tion objective then corresponds to the maximum a posteriori inference in the following probabilistic", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 363, + 138, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 138, + 375 + ], + "score": 1.0, + "content": "model:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 330, + 506, + 375 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 167, + 380, + 443, + 458 + ], + "lines": [ + { + "bbox": [ + 167, + 380, + 443, + 458 + ], + "spans": [ + { + "bbox": [ + 167, + 380, + 443, + 458 + ], + "score": 0.91, + "content": "\\begin{array} { c } { { p ( y ^ { * } , w \\mid x ) = p ( y ^ { * } \\mid x , w ) p ( w ) , } } \\\\ { { \\displaystyle \\log p ( y ^ { * } \\mid x , w ) = \\log \\prod _ { i = 1 } ^ { N } p ( y _ { i } ^ { * } \\mid x _ { i } , w ) = \\sum _ { i = 1 } ^ { N } \\log \\hat { p } ( y _ { i } ^ { * } \\mid x _ { i } , w ) , } } \\\\ { { \\displaystyle \\log p ( w ) = \\frac { - N \\lambda } { 2 } \\| w \\| ^ { 2 } + \\mathrm { c o n s t } \\iff p ( w ) = \\mathcal { N } \\left( w \\mid 0 , ( N \\lambda ) ^ { - 1 } I \\right) } } \\end{array}", + "type": "interline_equation", + "image_path": "7ac45338e73506d4a3bdecb2bf94c6358548f4caa1ed12b136afcbd31fe3007f.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 167, + 380, + 443, + 406.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 167, + 406.0, + 443, + 432.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 167, + 432.0, + 443, + 458.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 463, + 505, + 530 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 504, + 476 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 504, + 476 + ], + "score": 1.0, + "content": "In order to make the results comparable across all ensembling techniques, we used the same prob-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "abilistic model for all methods, choosing fixed weight decay parameters for each architecture. We", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 484, + 504, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 504, + 498 + ], + "score": 1.0, + "content": "used the softmax-based likelihood for all models. We also use the fully-factorized zero-mean Gaus-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 495, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 255, + 509 + ], + "score": 1.0, + "content": "sian prior distribution with variances", + "type": "text" + }, + { + "bbox": [ + 256, + 496, + 314, + 508 + ], + "score": 0.94, + "content": "\\sigma ^ { 2 } = ( N \\lambda ) ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 495, + 432, + 509 + ], + "score": 1.0, + "content": "where the number of objects", + "type": "text" + }, + { + "bbox": [ + 432, + 497, + 442, + 506 + ], + "score": 0.81, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 495, + 506, + 509 + ], + "score": 1.0, + "content": "and the weight", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 155, + 520 + ], + "score": 1.0, + "content": "decay scale", + "type": "text" + }, + { + "bbox": [ + 156, + 508, + 163, + 517 + ], + "score": 0.77, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "are dictated by the particular datasets and neural architectures as defined in the fol-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 519, + 180, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 180, + 531 + ], + "score": 1.0, + "content": "lowing paragraph.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 463, + 506, + 531 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 543, + 505, + 676 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "Conventional networks To train a single network on CIFAR-10/100, we used SGD with batch", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 457, + 568 + ], + "score": 1.0, + "content": "size of 128, momentum 0.9 and model-specific parameters, i.e. the initial learning rate", + "type": "text" + }, + { + "bbox": [ + 457, + 555, + 486, + 567 + ], + "score": 0.9, + "content": "( l r _ { i n i t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 555, + 505, + 568 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 565, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 505, + 579 + ], + "score": 1.0, + "content": "weight decay coefficient (wd), and the number of optimization epochs (epoch). Specific hyperpa-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 578, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 589 + ], + "score": 1.0, + "content": "rameters are shown in Table 1. The models were trained with a unified learning rate scheduler that", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "is shown in equation 10. All models have been trained using data augmentation that consists of hor-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 611 + ], + "score": 1.0, + "content": "izontal flips and a random crop of 32 pixels with a padding of 4 pixels5. The standard data normal-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 610, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 505, + 622 + ], + "score": 1.0, + "content": "ization has also been applied. Weight decays, initial learning rates, and the learning rate scheduler", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "were taken from (Garipov et al., 2018) paper. Compared with hyperparameters of (Garipov et al.,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 631, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 505, + 644 + ], + "score": 1.0, + "content": "2018), we increased the number of optimization epochs since we found that all models were un-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 642, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 642, + 505, + 655 + ], + "score": 1.0, + "content": "derfitted. While the original WideResNet28x10 network includes a number of dropout layers with", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 654, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 141, + 665 + ], + "score": 0.91, + "content": "p = 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 654, + 506, + 667 + ], + "score": 1.0, + "content": "and is trained for 200 epochs, we find that the WideResNet28x10 underfits in this setting", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 308, + 678 + ], + "score": 1.0, + "content": "and requires a longer training. Therefore, we used", + "type": "text" + }, + { + "bbox": [ + 309, + 665, + 333, + 676 + ], + "score": 0.91, + "content": "p = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 664, + 505, + 678 + ], + "score": 1.0, + "content": "which reduces training time while bearing", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 189, + 381, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 381, + 204 + ], + "score": 1.0, + "content": "no significant effect on final model performance in our experiments.", + "type": "text", + "cross_page": true + } + ], + "index": 6 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 543, + 506, + 678 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 223, + 80, + 388, + 148 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 223, + 80, + 388, + 148 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 223, + 80, + 388, + 148 + ], + "spans": [ + { + "bbox": [ + 223, + 80, + 388, + 148 + ], + "score": 0.977, + "html": "
Modellrinit epochs wd
VGG0.05 4005e-4
PreResNet1100.1 3003e-4
PreResNet1640.1 3003e-4
WideResNet28x10 0.13005e-4
", + "type": "table", + "image_path": "09d204676176528c426c44857d692b1ce875291e8d2313da2192d009ac96e9f4.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 223, + 80, + 388, + 93.6 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 223, + 93.6, + 388, + 107.19999999999999 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 223, + 107.19999999999999, + 388, + 120.79999999999998 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 223, + 120.79999999999998, + 388, + 134.39999999999998 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 223, + 134.39999999999998, + 388, + 147.99999999999997 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 135, + 156, + 473, + 168 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 135, + 155, + 475, + 169 + ], + "spans": [ + { + "bbox": [ + 135, + 155, + 475, + 169 + ], + "score": 1.0, + "content": "Table 1: Hyperparameters of models trained on CIFARs for single-model evaluation", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 190, + 379, + 201 + ], + "lines": [ + { + "bbox": [ + 106, + 189, + 381, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 381, + 204 + ], + "score": 1.0, + "content": "no significant effect on final model performance in our experiments.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 137, + 207, + 471, + 249 + ], + "lines": [ + { + "bbox": [ + 137, + 207, + 471, + 249 + ], + "spans": [ + { + "bbox": [ + 137, + 207, + 471, + 249 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\bot \\mathbf { r } ( i ) = \\left\\{ \\begin{array} { l l } { l _ { r _ { i n i t } } , } & { i \\in [ 0 , 0 . 5 \\cdot \\mathrm { e p o c h s } ] } \\\\ { l _ { r _ { i n i t } } \\cdot ( 1 . 0 - 0 . 9 9 * ( i / \\mathrm { e p o c h s } - 0 . 5 ) / 0 . 4 ) , } & { i \\in [ 0 . 5 \\cdot \\mathrm { e p o c h s } , 0 . 9 \\cdot \\mathrm { e p o c h s } ] } \\\\ { l _ { r _ { i n i t } } \\cdot 0 . 0 1 , } & { \\mathrm { o t h e r w i s e } } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "7060e1466728a5f9e5c28e1e7dc4c8c05433fd32c53d39f6128ac1a884bab51f.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 137, + 207, + 471, + 221.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 137, + 221.0, + 471, + 235.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 137, + 235.0, + 471, + 249.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 505, + 344 + ], + "lines": [ + { + "bbox": [ + 106, + 255, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 505, + 267 + ], + "score": 1.0, + "content": "On ImageNet dataset we used ResNet50 with default hyperparameters taken from PyTorch examples", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 263, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 104, + 263, + 506, + 281 + ], + "score": 1.0, + "content": "6. Specifically, we used SGD with momentum 0.9, batch size of 256, initial learning rate 0.1, weight", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 276, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 133, + 290 + ], + "score": 1.0, + "content": "decay", + "type": "text" + }, + { + "bbox": [ + 133, + 277, + 163, + 288 + ], + "score": 0.83, + "content": "1 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 276, + 456, + 290 + ], + "score": 1.0, + "content": ". Training included data augmentation7 (scaling, random crops of size", + "type": "text" + }, + { + "bbox": [ + 456, + 277, + 501, + 288 + ], + "score": 0.88, + "content": "2 2 4 \\times 2 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 276, + 506, + 290 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 286, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 104, + 286, + 353, + 303 + ], + "score": 1.0, + "content": "horizontal flips), normalization and learning rate scheduler", + "type": "text" + }, + { + "bbox": [ + 353, + 288, + 462, + 300 + ], + "score": 0.88, + "content": "l r = l r _ { i n i t } \\cdot 0 . 1 ^ { \\mathrm { e p o c h / / 3 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 286, + 492, + 303 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 492, + 289, + 505, + 301 + ], + "score": 0.69, + "content": "/ /", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 300, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 506, + 312 + ], + "score": 1.0, + "content": "denotes integer division. We only deviated from standard parameters by increasing the number of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 310, + 506, + 323 + ], + "spans": [ + { + "bbox": [ + 104, + 310, + 367, + 323 + ], + "score": 1.0, + "content": "training epochs from 90 to 130. Or models achieve top-1 error of", + "type": "text" + }, + { + "bbox": [ + 368, + 311, + 421, + 321 + ], + "score": 0.89, + "content": "2 3 . 8 1 \\pm 0 . 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 310, + 506, + 323 + ], + "score": 1.0, + "content": "that closely matches", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 320, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 104, + 320, + 333, + 335 + ], + "score": 1.0, + "content": "the accuracy of ResNet50 provided by PyTorch which is", + "type": "text" + }, + { + "bbox": [ + 334, + 321, + 363, + 332 + ], + "score": 0.71, + "content": "2 3 . 8 5 ^ { 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 320, + 506, + 335 + ], + "score": 1.0, + "content": ". Training of one model on a single", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 331, + 336, + 346 + ], + "spans": [ + { + "bbox": [ + 104, + 331, + 336, + 346 + ], + "score": 1.0, + "content": "NVIDIA Tesla V100 GPU takes approximately 5.5 days.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 357, + 505, + 424 + ], + "lines": [ + { + "bbox": [ + 106, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "Deep ensembles Deep ensembles (Lakshminarayanan et al., 2017) average the predictions across", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "networks trained independently starting from different initializations. To obtain a deep ensemble", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 378, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 506, + 393 + ], + "score": 1.0, + "content": "we repeat the described procedure of training standard networks 128 times for all architectures on", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 390, + 504, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 504, + 402 + ], + "score": 1.0, + "content": "CIFAR-10 and CIFAR-100 datasets (1024 networks over all) and 50 times for ImageNet dataset. Ev-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "ery member of deep ensembles was trained with exactly the same hyperparameters as conventional", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 413, + 238, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 238, + 424 + ], + "score": 1.0, + "content": "models of the same architecture.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 436, + 505, + 591 + ], + "lines": [ + { + "bbox": [ + 106, + 437, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 505, + 450 + ], + "score": 1.0, + "content": "Dropout Binary dropout (or MC dropout) (Srivastava et al., 2014; Gal & Ghahramani, 2016) is", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 448, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 505, + 461 + ], + "score": 1.0, + "content": "one of the most widely known ensembling techniques. It involves putting a multiplicative Bernoulli", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 203, + 471 + ], + "score": 1.0, + "content": "noise with a parameter", + "type": "text" + }, + { + "bbox": [ + 203, + 461, + 210, + 471 + ], + "score": 0.79, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 459, + 505, + 471 + ], + "score": 1.0, + "content": "over the activations of either a fully connected layer or a convolutional", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 470, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 505, + 483 + ], + "score": 1.0, + "content": "layer, averaging predictions of the network w.r.t. noise at test-time. Dropout layers were applied", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 480, + 506, + 494 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 506, + 494 + ], + "score": 1.0, + "content": "to VGG and WideResNet networks on CIFAR-10 and CIFAR-100 datasets. Dropout for VGG was", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 263, + 505 + ], + "score": 1.0, + "content": "applied to fully connected layers with", + "type": "text" + }, + { + "bbox": [ + 263, + 492, + 298, + 503 + ], + "score": 0.91, + "content": "p = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 491, + 506, + 505 + ], + "score": 1.0, + "content": ". Two dropout layers were applied: one before the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 502, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 506, + 515 + ], + "score": 1.0, + "content": "first fully connected layer and one before the second one. While the original version of VGG for", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 513, + 506, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 506, + 527 + ], + "score": 1.0, + "content": "CIFARs (Zagoruyko, 2015) exploits more dropout layers, we observed that any additional dropout", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 524, + 505, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 505, + 537 + ], + "score": 1.0, + "content": "layer deteriorates the performance of the model in ether deterministic or stochastic mode. Dropout", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 536, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 505, + 549 + ], + "score": 1.0, + "content": "for WideResNet was applied in accordance with the original paper (Zagoruyko & Komodakis, 2016)", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 546, + 505, + 559 + ], + "spans": [ + { + "bbox": [ + 106, + 546, + 127, + 559 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 547, + 160, + 558 + ], + "score": 0.91, + "content": "p = 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 546, + 505, + 559 + ], + "score": 1.0, + "content": ". Dropout usually increases the time needed to achieve convergence. Because of this,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 557, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 505, + 570 + ], + "score": 1.0, + "content": "WideResNet networks with dropout were trained for 400 epochs instead of 300 epochs for determin-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 568, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 505, + 582 + ], + "score": 1.0, + "content": "istic case, and VGG networks have always been trained with dropout. All the other hyperparameters", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 580, + 319, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 319, + 591 + ], + "score": 1.0, + "content": "were the same as in the case of conventional models.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 505, + 649 + ], + "lines": [ + { + "bbox": [ + 106, + 603, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 603, + 505, + 617 + ], + "score": 1.0, + "content": "Variational Inference Variational Inference (VI) approximates the true posterior distribution over", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 615, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 141, + 628 + ], + "score": 1.0, + "content": "weights", + "type": "text" + }, + { + "bbox": [ + 141, + 615, + 191, + 627 + ], + "score": 0.91, + "content": "p ( w | D a t a )", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 615, + 367, + 628 + ], + "score": 1.0, + "content": "with a tractable variational approximation", + "type": "text" + }, + { + "bbox": [ + 367, + 615, + 392, + 627 + ], + "score": 0.92, + "content": "q _ { \\theta } ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 615, + 505, + 628 + ], + "score": 1.0, + "content": "by maximizing a so-called", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 204, + 639 + ], + "score": 1.0, + "content": "variational lower bound", + "type": "text" + }, + { + "bbox": [ + 205, + 627, + 213, + 636 + ], + "score": 0.78, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 626, + 450, + 639 + ], + "score": 1.0, + "content": "(eq. 11) w.r.t. the parameters of variational approximation", + "type": "text" + }, + { + "bbox": [ + 450, + 627, + 456, + 636 + ], + "score": 0.78, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 626, + 506, + 639 + ], + "score": 1.0, + "content": ". We used a", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 636, + 444, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 270, + 650 + ], + "score": 1.0, + "content": "fully-factorized Gaussian approximation", + "type": "text" + }, + { + "bbox": [ + 271, + 637, + 291, + 649 + ], + "score": 0.92, + "content": "q ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 636, + 419, + 650 + ], + "score": 1.0, + "content": "and Gaussian prior distribution", + "type": "text" + }, + { + "bbox": [ + 419, + 637, + 440, + 649 + ], + "score": 0.92, + "content": "p ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 636, + 444, + 650 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39.5 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 654, + 423, + 672 + ], + "lines": [ + { + "bbox": [ + 189, + 654, + 423, + 672 + ], + "spans": [ + { + "bbox": [ + 189, + 654, + 423, + 672 + ], + "score": 0.68, + "content": "\\mathcal { L } ( \\theta ) = \\mathbb { E } _ { q } \\log p ( y ^ { * } \\mid x , w ) - K L ( q _ { \\theta } ( w ) \\mid \\mid p ( w ) ) \\to \\operatorname* { m a x } _ { \\theta }", + "type": "interline_equation", + "image_path": "966cd7be74a796b0c4b910a6a6e6834ec7c1feed89c62a86e0127b5dcc72b078.jpg" + } + ] + } + ], + "index": 42, + "virtual_lines": [ + { + "bbox": [ + 189, + 654, + 423, + 672 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 673, + 464, + 690 + ], + "lines": [ + { + "bbox": [ + 129, + 673, + 464, + 690 + ], + "spans": [ + { + "bbox": [ + 129, + 673, + 464, + 690 + ], + "score": 0.41, + "content": "q ( w ) = \\mathcal { N } ( w \\mid \\mu , \\mathrm { d i a g } ( \\sigma ^ { 2 } ) ) \\quad p ( w ) = N ( w \\mid 0 , \\mathrm { d i a g } ( \\sigma _ { p } ^ { 2 } ) ) , \\mathrm { w h e r e } \\sigma _ { p } ^ { 2 } = ( N \\cdot \\mathrm { w d } ) ^ { - 1 }", + "type": "interline_equation", + "image_path": "58a1c200e96c7f97cc10568be00220895c52dcb025054edb6b5779f898e75ff7.jpg" + } + ] + } + ], + "index": 43, + "virtual_lines": [ + { + "bbox": [ + 129, + 673, + 464, + 690 + ], + "spans": [], + "index": 43 + } + ] + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 117, + 699, + 431, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 697, + 432, + 713 + ], + "spans": [ + { + "bbox": [ + 118, + 697, + 432, + 713 + ], + "score": 1.0, + "content": "6https://github.com/pytorch/examples/tree/ee964a2/imagenet", + "type": "text" + } + ] + }, + { + "bbox": [ + 117, + 708, + 431, + 723 + ], + "spans": [ + { + "bbox": [ + 117, + 708, + 431, + 723 + ], + "score": 1.0, + "content": "7Compose([RandomResizedCrop(224), RandomHorizontalFlip()])", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 719, + 421, + 734 + ], + "spans": [ + { + "bbox": [ + 118, + 719, + 421, + 734 + ], + "score": 1.0, + "content": "8https://pytorch.org/docs/stable/torchvision/models.html", + "type": "text" + } + ] + } + ] + }, + { + "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, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "17", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 223, + 80, + 388, + 148 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 223, + 80, + 388, + 148 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 223, + 80, + 388, + 148 + ], + "spans": [ + { + "bbox": [ + 223, + 80, + 388, + 148 + ], + "score": 0.977, + "html": "
Modellrinit epochs wd
VGG0.05 4005e-4
PreResNet1100.1 3003e-4
PreResNet1640.1 3003e-4
WideResNet28x10 0.13005e-4
", + "type": "table", + "image_path": "09d204676176528c426c44857d692b1ce875291e8d2313da2192d009ac96e9f4.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 223, + 80, + 388, + 93.6 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 223, + 93.6, + 388, + 107.19999999999999 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 223, + 107.19999999999999, + 388, + 120.79999999999998 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 223, + 120.79999999999998, + 388, + 134.39999999999998 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 223, + 134.39999999999998, + 388, + 147.99999999999997 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 135, + 156, + 473, + 168 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 135, + 155, + 475, + 169 + ], + "spans": [ + { + "bbox": [ + 135, + 155, + 475, + 169 + ], + "score": 1.0, + "content": "Table 1: Hyperparameters of models trained on CIFARs for single-model evaluation", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 190, + 379, + 201 + ], + "lines": [], + "index": 6, + "bbox_fs": [ + 106, + 189, + 381, + 204 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 137, + 207, + 471, + 249 + ], + "lines": [ + { + "bbox": [ + 137, + 207, + 471, + 249 + ], + "spans": [ + { + "bbox": [ + 137, + 207, + 471, + 249 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\bot \\mathbf { r } ( i ) = \\left\\{ \\begin{array} { l l } { l _ { r _ { i n i t } } , } & { i \\in [ 0 , 0 . 5 \\cdot \\mathrm { e p o c h s } ] } \\\\ { l _ { r _ { i n i t } } \\cdot ( 1 . 0 - 0 . 9 9 * ( i / \\mathrm { e p o c h s } - 0 . 5 ) / 0 . 4 ) , } & { i \\in [ 0 . 5 \\cdot \\mathrm { e p o c h s } , 0 . 9 \\cdot \\mathrm { e p o c h s } ] } \\\\ { l _ { r _ { i n i t } } \\cdot 0 . 0 1 , } & { \\mathrm { o t h e r w i s e } } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "7060e1466728a5f9e5c28e1e7dc4c8c05433fd32c53d39f6128ac1a884bab51f.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 137, + 207, + 471, + 221.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 137, + 221.0, + 471, + 235.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 137, + 235.0, + 471, + 249.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 505, + 344 + ], + "lines": [ + { + "bbox": [ + 106, + 255, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 505, + 267 + ], + "score": 1.0, + "content": "On ImageNet dataset we used ResNet50 with default hyperparameters taken from PyTorch examples", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 263, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 104, + 263, + 506, + 281 + ], + "score": 1.0, + "content": "6. Specifically, we used SGD with momentum 0.9, batch size of 256, initial learning rate 0.1, weight", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 276, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 133, + 290 + ], + "score": 1.0, + "content": "decay", + "type": "text" + }, + { + "bbox": [ + 133, + 277, + 163, + 288 + ], + "score": 0.83, + "content": "1 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 276, + 456, + 290 + ], + "score": 1.0, + "content": ". Training included data augmentation7 (scaling, random crops of size", + "type": "text" + }, + { + "bbox": [ + 456, + 277, + 501, + 288 + ], + "score": 0.88, + "content": "2 2 4 \\times 2 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 276, + 506, + 290 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 286, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 104, + 286, + 353, + 303 + ], + "score": 1.0, + "content": "horizontal flips), normalization and learning rate scheduler", + "type": "text" + }, + { + "bbox": [ + 353, + 288, + 462, + 300 + ], + "score": 0.88, + "content": "l r = l r _ { i n i t } \\cdot 0 . 1 ^ { \\mathrm { e p o c h / / 3 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 286, + 492, + 303 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 492, + 289, + 505, + 301 + ], + "score": 0.69, + "content": "/ /", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 300, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 506, + 312 + ], + "score": 1.0, + "content": "denotes integer division. We only deviated from standard parameters by increasing the number of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 310, + 506, + 323 + ], + "spans": [ + { + "bbox": [ + 104, + 310, + 367, + 323 + ], + "score": 1.0, + "content": "training epochs from 90 to 130. Or models achieve top-1 error of", + "type": "text" + }, + { + "bbox": [ + 368, + 311, + 421, + 321 + ], + "score": 0.89, + "content": "2 3 . 8 1 \\pm 0 . 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 310, + 506, + 323 + ], + "score": 1.0, + "content": "that closely matches", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 320, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 104, + 320, + 333, + 335 + ], + "score": 1.0, + "content": "the accuracy of ResNet50 provided by PyTorch which is", + "type": "text" + }, + { + "bbox": [ + 334, + 321, + 363, + 332 + ], + "score": 0.71, + "content": "2 3 . 8 5 ^ { 8 }", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 320, + 506, + 335 + ], + "score": 1.0, + "content": ". Training of one model on a single", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 331, + 336, + 346 + ], + "spans": [ + { + "bbox": [ + 104, + 331, + 336, + 346 + ], + "score": 1.0, + "content": "NVIDIA Tesla V100 GPU takes approximately 5.5 days.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 255, + 506, + 346 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 357, + 505, + 424 + ], + "lines": [ + { + "bbox": [ + 106, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "Deep ensembles Deep ensembles (Lakshminarayanan et al., 2017) average the predictions across", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "networks trained independently starting from different initializations. To obtain a deep ensemble", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 378, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 506, + 393 + ], + "score": 1.0, + "content": "we repeat the described procedure of training standard networks 128 times for all architectures on", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 390, + 504, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 504, + 402 + ], + "score": 1.0, + "content": "CIFAR-10 and CIFAR-100 datasets (1024 networks over all) and 50 times for ImageNet dataset. Ev-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "ery member of deep ensembles was trained with exactly the same hyperparameters as conventional", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 413, + 238, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 238, + 424 + ], + "score": 1.0, + "content": "models of the same architecture.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 357, + 506, + 424 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 436, + 505, + 591 + ], + "lines": [ + { + "bbox": [ + 106, + 437, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 505, + 450 + ], + "score": 1.0, + "content": "Dropout Binary dropout (or MC dropout) (Srivastava et al., 2014; Gal & Ghahramani, 2016) is", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 448, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 505, + 461 + ], + "score": 1.0, + "content": "one of the most widely known ensembling techniques. It involves putting a multiplicative Bernoulli", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 459, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 203, + 471 + ], + "score": 1.0, + "content": "noise with a parameter", + "type": "text" + }, + { + "bbox": [ + 203, + 461, + 210, + 471 + ], + "score": 0.79, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 459, + 505, + 471 + ], + "score": 1.0, + "content": "over the activations of either a fully connected layer or a convolutional", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 470, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 505, + 483 + ], + "score": 1.0, + "content": "layer, averaging predictions of the network w.r.t. noise at test-time. Dropout layers were applied", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 480, + 506, + 494 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 506, + 494 + ], + "score": 1.0, + "content": "to VGG and WideResNet networks on CIFAR-10 and CIFAR-100 datasets. Dropout for VGG was", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 263, + 505 + ], + "score": 1.0, + "content": "applied to fully connected layers with", + "type": "text" + }, + { + "bbox": [ + 263, + 492, + 298, + 503 + ], + "score": 0.91, + "content": "p = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 491, + 506, + 505 + ], + "score": 1.0, + "content": ". Two dropout layers were applied: one before the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 502, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 506, + 515 + ], + "score": 1.0, + "content": "first fully connected layer and one before the second one. While the original version of VGG for", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 513, + 506, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 506, + 527 + ], + "score": 1.0, + "content": "CIFARs (Zagoruyko, 2015) exploits more dropout layers, we observed that any additional dropout", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 524, + 505, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 505, + 537 + ], + "score": 1.0, + "content": "layer deteriorates the performance of the model in ether deterministic or stochastic mode. Dropout", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 536, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 505, + 549 + ], + "score": 1.0, + "content": "for WideResNet was applied in accordance with the original paper (Zagoruyko & Komodakis, 2016)", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 546, + 505, + 559 + ], + "spans": [ + { + "bbox": [ + 106, + 546, + 127, + 559 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 547, + 160, + 558 + ], + "score": 0.91, + "content": "p = 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 546, + 505, + 559 + ], + "score": 1.0, + "content": ". Dropout usually increases the time needed to achieve convergence. Because of this,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 557, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 505, + 570 + ], + "score": 1.0, + "content": "WideResNet networks with dropout were trained for 400 epochs instead of 300 epochs for determin-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 568, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 505, + 582 + ], + "score": 1.0, + "content": "istic case, and VGG networks have always been trained with dropout. All the other hyperparameters", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 580, + 319, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 319, + 591 + ], + "score": 1.0, + "content": "were the same as in the case of conventional models.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 437, + 506, + 591 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 505, + 649 + ], + "lines": [ + { + "bbox": [ + 106, + 603, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 603, + 505, + 617 + ], + "score": 1.0, + "content": "Variational Inference Variational Inference (VI) approximates the true posterior distribution over", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 615, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 141, + 628 + ], + "score": 1.0, + "content": "weights", + "type": "text" + }, + { + "bbox": [ + 141, + 615, + 191, + 627 + ], + "score": 0.91, + "content": "p ( w | D a t a )", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 615, + 367, + 628 + ], + "score": 1.0, + "content": "with a tractable variational approximation", + "type": "text" + }, + { + "bbox": [ + 367, + 615, + 392, + 627 + ], + "score": 0.92, + "content": "q _ { \\theta } ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 615, + 505, + 628 + ], + "score": 1.0, + "content": "by maximizing a so-called", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 626, + 506, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 204, + 639 + ], + "score": 1.0, + "content": "variational lower bound", + "type": "text" + }, + { + "bbox": [ + 205, + 627, + 213, + 636 + ], + "score": 0.78, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 626, + 450, + 639 + ], + "score": 1.0, + "content": "(eq. 11) w.r.t. the parameters of variational approximation", + "type": "text" + }, + { + "bbox": [ + 450, + 627, + 456, + 636 + ], + "score": 0.78, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 626, + 506, + 639 + ], + "score": 1.0, + "content": ". We used a", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 636, + 444, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 270, + 650 + ], + "score": 1.0, + "content": "fully-factorized Gaussian approximation", + "type": "text" + }, + { + "bbox": [ + 271, + 637, + 291, + 649 + ], + "score": 0.92, + "content": "q ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 636, + 419, + 650 + ], + "score": 1.0, + "content": "and Gaussian prior distribution", + "type": "text" + }, + { + "bbox": [ + 419, + 637, + 440, + 649 + ], + "score": 0.92, + "content": "p ( w )", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 636, + 444, + 650 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 603, + 506, + 650 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 654, + 423, + 672 + ], + "lines": [ + { + "bbox": [ + 189, + 654, + 423, + 672 + ], + "spans": [ + { + "bbox": [ + 189, + 654, + 423, + 672 + ], + "score": 0.68, + "content": "\\mathcal { L } ( \\theta ) = \\mathbb { E } _ { q } \\log p ( y ^ { * } \\mid x , w ) - K L ( q _ { \\theta } ( w ) \\mid \\mid p ( w ) ) \\to \\operatorname* { m a x } _ { \\theta }", + "type": "interline_equation", + "image_path": "966cd7be74a796b0c4b910a6a6e6834ec7c1feed89c62a86e0127b5dcc72b078.jpg" + } + ] + } + ], + "index": 42, + "virtual_lines": [ + { + "bbox": [ + 189, + 654, + 423, + 672 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 673, + 464, + 690 + ], + "lines": [ + { + "bbox": [ + 129, + 673, + 464, + 690 + ], + "spans": [ + { + "bbox": [ + 129, + 673, + 464, + 690 + ], + "score": 0.41, + "content": "q ( w ) = \\mathcal { N } ( w \\mid \\mu , \\mathrm { d i a g } ( \\sigma ^ { 2 } ) ) \\quad p ( w ) = N ( w \\mid 0 , \\mathrm { d i a g } ( \\sigma _ { p } ^ { 2 } ) ) , \\mathrm { w h e r e } \\sigma _ { p } ^ { 2 } = ( N \\cdot \\mathrm { w d } ) ^ { - 1 }", + "type": "interline_equation", + "image_path": "58a1c200e96c7f97cc10568be00220895c52dcb025054edb6b5779f898e75ff7.jpg" + } + ] + } + ], + "index": 43, + "virtual_lines": [ + { + "bbox": [ + 129, + 673, + 464, + 690 + ], + "spans": [], + "index": 43 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 147, + 80, + 464, + 159 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 147, + 80, + 464, + 159 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 147, + 80, + 464, + 159 + ], + "spans": [ + { + "bbox": [ + 147, + 80, + 464, + 159 + ], + "score": 0.977, + "html": "
Optimal noise scale
ArchitectureCIFAR-10 CIFAR-10-augCIFAR-100 CIFAR-100-aug
VGG16BN0.0420.0420.1000.100
PreResNet1100.2130.1410.4780.401
PreResNet1640.1200.1050.2850.225
WideResNet28x100.0220.0180.0220.004
", + "type": "table", + "image_path": "6d379a8d50595a446c94656c2486bed74487f4ea173a1392c485e51f2c5bb38d.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 147, + 80, + 464, + 106.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 147, + 106.33333333333333, + 464, + 132.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 147, + 132.66666666666666, + 464, + 159.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 107, + 167, + 504, + 200 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 167, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 106, + 167, + 505, + 179 + ], + "score": 1.0, + "content": "Table 2: Optimal noise scale for K-FAC Laplace for different datasets and architectures. For", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 178, + 504, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 504, + 190 + ], + "score": 1.0, + "content": "ResNet50 on ImageNet, the optimal scale found was 2.0 with test-time augmentation and 6.8 with-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 189, + 218, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 218, + 201 + ], + "score": 1.0, + "content": "out test-time augmentation.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 505, + 279 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 236 + ], + "score": 1.0, + "content": "In the case of such a prior, the probabilistic model remains consistent with the conventional training", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "which corresponds to MAP inference in the same probabilistic model. We used variational inference", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 245, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 258 + ], + "score": 1.0, + "content": "for both convolutional and fully-connected layers where variances of the weights were parameterized", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 254, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 104, + 254, + 119, + 270 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 119, + 257, + 141, + 267 + ], + "score": 0.8, + "content": "\\log \\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 254, + 506, + 270 + ], + "score": 1.0, + "content": ". For fully-connected layers we applied the local reparameterization trick (LRT, (Kingma", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 267, + 162, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 162, + 280 + ], + "score": 1.0, + "content": "et al., 2015)).", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 284, + 505, + 328 + ], + "lines": [ + { + "bbox": [ + 105, + 283, + 505, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 505, + 297 + ], + "score": 1.0, + "content": "While variational inference provides a theoretically grounded way to approximate the true posterior,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 295, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 505, + 307 + ], + "score": 1.0, + "content": "it tends to underfit deep learning models in practice (Kingma et al., 2015). The following tricks", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 307, + 504, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 496, + 318 + ], + "score": 1.0, + "content": "are applied to deal with it: pre-training (Molchanov et al., 2017) or equivalently annealing of", + "type": "text" + }, + { + "bbox": [ + 496, + 307, + 504, + 318 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 317, + 455, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 250, + 329 + ], + "score": 1.0, + "content": "(Sønderby et al., 2016), and scaling", + "type": "text" + }, + { + "bbox": [ + 250, + 317, + 258, + 329 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 317, + 455, + 329 + ], + "score": 1.0, + "content": "down (Kingma et al., 2015; Ullrich et al., 2017).", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 333, + 505, + 400 + ], + "lines": [ + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 238, + 347 + ], + "score": 1.0, + "content": "During pre-training we initialize", + "type": "text" + }, + { + "bbox": [ + 239, + 336, + 246, + 345 + ], + "score": 0.81, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 334, + 505, + 347 + ], + "score": 1.0, + "content": "with a snapshot of weights of a pre-trained conventional model,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 344, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 162, + 359 + ], + "score": 1.0, + "content": "and initialize", + "type": "text" + }, + { + "bbox": [ + 162, + 345, + 185, + 356 + ], + "score": 0.83, + "content": "\\log \\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 344, + 313, + 359 + ], + "score": 1.0, + "content": "with a model-specific constant", + "type": "text" + }, + { + "bbox": [ + 313, + 345, + 349, + 357 + ], + "score": 0.89, + "content": "\\log \\sigma _ { i n i t }", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 344, + 506, + 359 + ], + "score": 1.0, + "content": ". The KL-divergence – except for the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 444, + 369 + ], + "score": 1.0, + "content": "term corresponding to the weight decay – is scaled with a model-specific parameter", + "type": "text" + }, + { + "bbox": [ + 444, + 356, + 452, + 367 + ], + "score": 0.82, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 356, + 505, + 369 + ], + "score": 1.0, + "content": ". The weight", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 367, + 504, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 504, + 379 + ], + "score": 1.0, + "content": "decay term is implemented as a part of the optimizer. We used a fact that the KL-divergence between", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 378, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 505, + 390 + ], + "score": 1.0, + "content": "two Gaussian distributions can be rewritten as two terms, one of which is equivalent to the weight", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 389, + 192, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 192, + 401 + ], + "score": 1.0, + "content": "decay regularization.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 405, + 505, + 494 + ], + "lines": [ + { + "bbox": [ + 106, + 405, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 269, + 417 + ], + "score": 1.0, + "content": "On CIFAR-10 and CIFAR-100 we used", + "type": "text" + }, + { + "bbox": [ + 269, + 406, + 277, + 417 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 405, + 505, + 417 + ], + "score": 1.0, + "content": "equal to 1e-4 for VGG, ResNet100 and ResNet164 net-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 416, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 154, + 430 + ], + "score": 1.0, + "content": "works, and", + "type": "text" + }, + { + "bbox": [ + 155, + 417, + 163, + 428 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 416, + 352, + 430 + ], + "score": 1.0, + "content": "equal to 1e-5 for WideResNet. Log-variance", + "type": "text" + }, + { + "bbox": [ + 353, + 417, + 389, + 428 + ], + "score": 0.89, + "content": "\\log \\sigma _ { i n i t }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 416, + 474, + 430 + ], + "score": 1.0, + "content": "was initialized with", + "type": "text" + }, + { + "bbox": [ + 475, + 417, + 489, + 427 + ], + "score": 0.71, + "content": "- 5", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 416, + 506, + 430 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 426, + 506, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 202, + 440 + ], + "score": 1.0, + "content": "all models. Parameters", + "type": "text" + }, + { + "bbox": [ + 202, + 429, + 210, + 439 + ], + "score": 0.81, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 426, + 506, + 440 + ], + "score": 1.0, + "content": "were optimized with SGD in the same manner as in the case of conven-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 438, + 505, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 309, + 451 + ], + "score": 1.0, + "content": "tional networks except that the initial learning rate", + "type": "text" + }, + { + "bbox": [ + 310, + 439, + 333, + 450 + ], + "score": 0.91, + "content": "l r _ { i n i t }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 438, + 505, + 451 + ], + "score": 1.0, + "content": "was set to 1e-3. We used a separate Adam", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 450, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 459, + 461 + ], + "score": 1.0, + "content": "optimizer with a constant learning rate of 1e-3 to optimize log-variances of the weights", + "type": "text" + }, + { + "bbox": [ + 459, + 450, + 481, + 461 + ], + "score": 0.83, + "content": "\\log \\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 450, + 505, + 461 + ], + "score": 1.0, + "content": ". Pre-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "training was done for 300 epochs, and after that the remaining part of training was done for 100", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 471, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 104, + 471, + 232, + 484 + ], + "score": 1.0, + "content": "epochs. On ImageNet we used", + "type": "text" + }, + { + "bbox": [ + 233, + 471, + 271, + 483 + ], + "score": 0.78, + "content": "\\beta = 1 \\mathrm { e } { - 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 471, + 275, + 484 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 276, + 471, + 330, + 483 + ], + "score": 0.82, + "content": "l r _ { i n i t } = 0 . 0 1", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 471, + 334, + 484 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 335, + 472, + 397, + 483 + ], + "score": 0.84, + "content": "\\log { \\sigma _ { i n i t } } = - 6", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 471, + 506, + 484 + ], + "score": 1.0, + "content": ", and trained the model for", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 482, + 222, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 222, + 496 + ], + "score": 1.0, + "content": "45 epochs after pre-training.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 507, + 504, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "K-FAC Laplace The Laplace approximation uses the curvature information of the appropriately", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "scaled loss function to construct a Gaussian approximation to the posterior distribution. Ideally, one", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "would use the Hessian of the loss function as a covariance matrix and use the maximum a posteriori", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 537, + 344, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 142, + 554 + ], + "score": 1.0, + "content": "estimate", + "type": "text" + }, + { + "bbox": [ + 142, + 539, + 171, + 550 + ], + "score": 0.93, + "content": "w ^ { M A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 537, + 344, + 554 + ], + "score": 1.0, + "content": "as a mean of the Gaussian approximation:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 556, + 438, + 612 + ], + "lines": [ + { + "bbox": [ + 172, + 556, + 438, + 612 + ], + "spans": [ + { + "bbox": [ + 172, + 556, + 438, + 612 + ], + "score": 0.93, + "content": "\\begin{array} { c } { \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) = \\log p ( \\boldsymbol { y } ^ { * } \\mid \\boldsymbol { x } , \\boldsymbol { w } ) + \\log p ( \\boldsymbol { w } ) + \\mathrm { c o n s t } } \\\\ { \\boldsymbol { w } ^ { M A P } = \\arg \\operatorname* { m a x } _ { \\boldsymbol { w } } \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) ; \\quad \\Sigma = - \\nabla \\nabla \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) } \\\\ { p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) \\approx \\mathcal { N } ( \\boldsymbol { w } \\mid \\boldsymbol { w } ^ { M A P } , \\Sigma ) } \\end{array}", + "type": "interline_equation", + "image_path": "a8f7c41b50037fda98448cc616e05be4f95ee453beabeb272b249faa6ab1035b.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 172, + 556, + 438, + 574.6666666666666 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 172, + 574.6666666666666, + 438, + 593.3333333333333 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 172, + 593.3333333333333, + 438, + 611.9999999999999 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "In order to keep the method scalable, we use the Fisher Information Matrix as an approximation", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "to the true Hessian (Martens & Grosse, 2015). For K-FAC Laplace, we use the whole dataset to", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 442, + 657 + ], + "score": 1.0, + "content": "construct an approximation to the empirical Fisher Information Matrix, and use the", + "type": "text" + }, + { + "bbox": [ + 443, + 645, + 451, + 654 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "correction to", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "score": 1.0, + "content": "reduce the bias (Ritter et al., 2018; Martens & Grosse, 2015). Following (Ritter et al., 2018), we", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "find the optimal noise scale for K-FAC Laplace on a held-out validation set by averaging across five", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 677, + 504, + 688 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 504, + 688 + ], + "score": 1.0, + "content": "random initializations. We then reuse this scale for networks trained without a hold-out validation", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 699 + ], + "score": 1.0, + "content": "set. We report the optimal values of scales in Table 2. Note that the optimal scale is different", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "depending on whether we use test-time data augmentation or not. Since the data augmentation also", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "introduces some amount of additional noise, the optimal noise scale for K-FAC Laplace with data", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 721, + 199, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 199, + 732 + ], + "score": 1.0, + "content": "augmentation is lower.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 40.5 + } + ], + "page_idx": 17, + "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": "18", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 147, + 80, + 464, + 159 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 147, + 80, + 464, + 159 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 147, + 80, + 464, + 159 + ], + "spans": [ + { + "bbox": [ + 147, + 80, + 464, + 159 + ], + "score": 0.977, + "html": "
Optimal noise scale
ArchitectureCIFAR-10 CIFAR-10-augCIFAR-100 CIFAR-100-aug
VGG16BN0.0420.0420.1000.100
PreResNet1100.2130.1410.4780.401
PreResNet1640.1200.1050.2850.225
WideResNet28x100.0220.0180.0220.004
", + "type": "table", + "image_path": "6d379a8d50595a446c94656c2486bed74487f4ea173a1392c485e51f2c5bb38d.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 147, + 80, + 464, + 106.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 147, + 106.33333333333333, + 464, + 132.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 147, + 132.66666666666666, + 464, + 159.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 107, + 167, + 504, + 200 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 167, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 106, + 167, + 505, + 179 + ], + "score": 1.0, + "content": "Table 2: Optimal noise scale for K-FAC Laplace for different datasets and architectures. For", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 178, + 504, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 504, + 190 + ], + "score": 1.0, + "content": "ResNet50 on ImageNet, the optimal scale found was 2.0 with test-time augmentation and 6.8 with-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 189, + 218, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 218, + 201 + ], + "score": 1.0, + "content": "out test-time augmentation.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 505, + 279 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 236 + ], + "score": 1.0, + "content": "In the case of such a prior, the probabilistic model remains consistent with the conventional training", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "which corresponds to MAP inference in the same probabilistic model. We used variational inference", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 245, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 258 + ], + "score": 1.0, + "content": "for both convolutional and fully-connected layers where variances of the weights were parameterized", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 254, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 104, + 254, + 119, + 270 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 119, + 257, + 141, + 267 + ], + "score": 0.8, + "content": "\\log \\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 254, + 506, + 270 + ], + "score": 1.0, + "content": ". For fully-connected layers we applied the local reparameterization trick (LRT, (Kingma", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 267, + 162, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 162, + 280 + ], + "score": 1.0, + "content": "et al., 2015)).", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8, + "bbox_fs": [ + 104, + 222, + 506, + 280 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 284, + 505, + 328 + ], + "lines": [ + { + "bbox": [ + 105, + 283, + 505, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 505, + 297 + ], + "score": 1.0, + "content": "While variational inference provides a theoretically grounded way to approximate the true posterior,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 295, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 505, + 307 + ], + "score": 1.0, + "content": "it tends to underfit deep learning models in practice (Kingma et al., 2015). The following tricks", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 307, + 504, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 496, + 318 + ], + "score": 1.0, + "content": "are applied to deal with it: pre-training (Molchanov et al., 2017) or equivalently annealing of", + "type": "text" + }, + { + "bbox": [ + 496, + 307, + 504, + 318 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 317, + 455, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 250, + 329 + ], + "score": 1.0, + "content": "(Sønderby et al., 2016), and scaling", + "type": "text" + }, + { + "bbox": [ + 250, + 317, + 258, + 329 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 317, + 455, + 329 + ], + "score": 1.0, + "content": "down (Kingma et al., 2015; Ullrich et al., 2017).", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 283, + 505, + 329 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 333, + 505, + 400 + ], + "lines": [ + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 238, + 347 + ], + "score": 1.0, + "content": "During pre-training we initialize", + "type": "text" + }, + { + "bbox": [ + 239, + 336, + 246, + 345 + ], + "score": 0.81, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 334, + 505, + 347 + ], + "score": 1.0, + "content": "with a snapshot of weights of a pre-trained conventional model,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 344, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 162, + 359 + ], + "score": 1.0, + "content": "and initialize", + "type": "text" + }, + { + "bbox": [ + 162, + 345, + 185, + 356 + ], + "score": 0.83, + "content": "\\log \\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 344, + 313, + 359 + ], + "score": 1.0, + "content": "with a model-specific constant", + "type": "text" + }, + { + "bbox": [ + 313, + 345, + 349, + 357 + ], + "score": 0.89, + "content": "\\log \\sigma _ { i n i t }", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 344, + 506, + 359 + ], + "score": 1.0, + "content": ". The KL-divergence – except for the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 356, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 444, + 369 + ], + "score": 1.0, + "content": "term corresponding to the weight decay – is scaled with a model-specific parameter", + "type": "text" + }, + { + "bbox": [ + 444, + 356, + 452, + 367 + ], + "score": 0.82, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 356, + 505, + 369 + ], + "score": 1.0, + "content": ". The weight", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 367, + 504, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 504, + 379 + ], + "score": 1.0, + "content": "decay term is implemented as a part of the optimizer. We used a fact that the KL-divergence between", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 378, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 505, + 390 + ], + "score": 1.0, + "content": "two Gaussian distributions can be rewritten as two terms, one of which is equivalent to the weight", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 389, + 192, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 192, + 401 + ], + "score": 1.0, + "content": "decay regularization.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 334, + 506, + 401 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 405, + 505, + 494 + ], + "lines": [ + { + "bbox": [ + 106, + 405, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 269, + 417 + ], + "score": 1.0, + "content": "On CIFAR-10 and CIFAR-100 we used", + "type": "text" + }, + { + "bbox": [ + 269, + 406, + 277, + 417 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 405, + 505, + 417 + ], + "score": 1.0, + "content": "equal to 1e-4 for VGG, ResNet100 and ResNet164 net-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 416, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 154, + 430 + ], + "score": 1.0, + "content": "works, and", + "type": "text" + }, + { + "bbox": [ + 155, + 417, + 163, + 428 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 416, + 352, + 430 + ], + "score": 1.0, + "content": "equal to 1e-5 for WideResNet. Log-variance", + "type": "text" + }, + { + "bbox": [ + 353, + 417, + 389, + 428 + ], + "score": 0.89, + "content": "\\log \\sigma _ { i n i t }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 416, + 474, + 430 + ], + "score": 1.0, + "content": "was initialized with", + "type": "text" + }, + { + "bbox": [ + 475, + 417, + 489, + 427 + ], + "score": 0.71, + "content": "- 5", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 416, + 506, + 430 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 426, + 506, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 202, + 440 + ], + "score": 1.0, + "content": "all models. Parameters", + "type": "text" + }, + { + "bbox": [ + 202, + 429, + 210, + 439 + ], + "score": 0.81, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 426, + 506, + 440 + ], + "score": 1.0, + "content": "were optimized with SGD in the same manner as in the case of conven-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 438, + 505, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 309, + 451 + ], + "score": 1.0, + "content": "tional networks except that the initial learning rate", + "type": "text" + }, + { + "bbox": [ + 310, + 439, + 333, + 450 + ], + "score": 0.91, + "content": "l r _ { i n i t }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 438, + 505, + 451 + ], + "score": 1.0, + "content": "was set to 1e-3. We used a separate Adam", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 450, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 459, + 461 + ], + "score": 1.0, + "content": "optimizer with a constant learning rate of 1e-3 to optimize log-variances of the weights", + "type": "text" + }, + { + "bbox": [ + 459, + 450, + 481, + 461 + ], + "score": 0.83, + "content": "\\log \\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 450, + 505, + 461 + ], + "score": 1.0, + "content": ". Pre-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "training was done for 300 epochs, and after that the remaining part of training was done for 100", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 471, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 104, + 471, + 232, + 484 + ], + "score": 1.0, + "content": "epochs. On ImageNet we used", + "type": "text" + }, + { + "bbox": [ + 233, + 471, + 271, + 483 + ], + "score": 0.78, + "content": "\\beta = 1 \\mathrm { e } { - 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 471, + 275, + 484 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 276, + 471, + 330, + 483 + ], + "score": 0.82, + "content": "l r _ { i n i t } = 0 . 0 1", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 471, + 334, + 484 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 335, + 472, + 397, + 483 + ], + "score": 0.84, + "content": "\\log { \\sigma _ { i n i t } } = - 6", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 471, + 506, + 484 + ], + "score": 1.0, + "content": ", and trained the model for", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 482, + 222, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 222, + 496 + ], + "score": 1.0, + "content": "45 epochs after pre-training.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24.5, + "bbox_fs": [ + 104, + 405, + 506, + 496 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 507, + 504, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "K-FAC Laplace The Laplace approximation uses the curvature information of the appropriately", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "scaled loss function to construct a Gaussian approximation to the posterior distribution. Ideally, one", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "would use the Hessian of the loss function as a covariance matrix and use the maximum a posteriori", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 537, + 344, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 142, + 554 + ], + "score": 1.0, + "content": "estimate", + "type": "text" + }, + { + "bbox": [ + 142, + 539, + 171, + 550 + ], + "score": 0.93, + "content": "w ^ { M A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 537, + 344, + 554 + ], + "score": 1.0, + "content": "as a mean of the Gaussian approximation:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 507, + 505, + 554 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 556, + 438, + 612 + ], + "lines": [ + { + "bbox": [ + 172, + 556, + 438, + 612 + ], + "spans": [ + { + "bbox": [ + 172, + 556, + 438, + 612 + ], + "score": 0.93, + "content": "\\begin{array} { c } { \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) = \\log p ( \\boldsymbol { y } ^ { * } \\mid \\boldsymbol { x } , \\boldsymbol { w } ) + \\log p ( \\boldsymbol { w } ) + \\mathrm { c o n s t } } \\\\ { \\boldsymbol { w } ^ { M A P } = \\arg \\operatorname* { m a x } _ { \\boldsymbol { w } } \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) ; \\quad \\Sigma = - \\nabla \\nabla \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) } \\\\ { p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) \\approx \\mathcal { N } ( \\boldsymbol { w } \\mid \\boldsymbol { w } ^ { M A P } , \\Sigma ) } \\end{array}", + "type": "interline_equation", + "image_path": "a8f7c41b50037fda98448cc616e05be4f95ee453beabeb272b249faa6ab1035b.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 172, + 556, + 438, + 574.6666666666666 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 172, + 574.6666666666666, + 438, + 593.3333333333333 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 172, + 593.3333333333333, + 438, + 611.9999999999999 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "In order to keep the method scalable, we use the Fisher Information Matrix as an approximation", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "to the true Hessian (Martens & Grosse, 2015). For K-FAC Laplace, we use the whole dataset to", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 442, + 657 + ], + "score": 1.0, + "content": "construct an approximation to the empirical Fisher Information Matrix, and use the", + "type": "text" + }, + { + "bbox": [ + 443, + 645, + 451, + 654 + ], + "score": 0.74, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "correction to", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "score": 1.0, + "content": "reduce the bias (Ritter et al., 2018; Martens & Grosse, 2015). Following (Ritter et al., 2018), we", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "find the optimal noise scale for K-FAC Laplace on a held-out validation set by averaging across five", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 677, + 504, + 688 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 504, + 688 + ], + "score": 1.0, + "content": "random initializations. We then reuse this scale for networks trained without a hold-out validation", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 699 + ], + "score": 1.0, + "content": "set. We report the optimal values of scales in Table 2. Note that the optimal scale is different", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "depending on whether we use test-time data augmentation or not. Since the data augmentation also", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "introduces some amount of additional noise, the optimal noise scale for K-FAC Laplace with data", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 721, + 199, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 199, + 732 + ], + "score": 1.0, + "content": "augmentation is lower.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 622, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 134 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "Snapshot ensembles Snapshot ensembles (SSE) (Huang et al., 2017) is a simple example of an", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 506, + 105 + ], + "score": 1.0, + "content": "array of methods which collect samples from a training trajectory of a network in weight space to", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 101, + 506, + 116 + ], + "spans": [ + { + "bbox": [ + 104, + 101, + 506, + 116 + ], + "score": 1.0, + "content": "construct an ensemble. Samples are collected in a cyclical manner: during each cycle the learning", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 113, + 505, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 505, + 124 + ], + "score": 1.0, + "content": "rate goes from a large value to near-zero and snapshot of weights of the network is taken at the end", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 123, + 425, + 135 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 425, + 135 + ], + "score": 1.0, + "content": "of the cycle. SSE uses SGD with a cosine learning schedule defined as follows:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 139, + 402, + 164 + ], + "lines": [ + { + "bbox": [ + 207, + 139, + 402, + 164 + ], + "spans": [ + { + "bbox": [ + 207, + 139, + 402, + 164 + ], + "score": 0.95, + "content": "\\alpha ( t ) = \\frac { \\alpha _ { 0 } } 2 \\left( \\cos \\left( \\frac { \\pi \\ \\mathrm { m o d } \\ ( t - 1 , \\lceil T / M \\rceil ) } { \\lceil T / M \\rceil } \\right) + 1 \\right) ,", + "type": "interline_equation", + "image_path": "e878bf844409987f489dadacdcc0f85ed405bd6212df995ba1c43bc32567b14c.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 207, + 139, + 402, + 164 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 168, + 504, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 168, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 132, + 181 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 132, + 171, + 145, + 180 + ], + "score": 0.84, + "content": "\\alpha _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 168, + 250, + 181 + ], + "score": 1.0, + "content": "is the initial learning rate,", + "type": "text" + }, + { + "bbox": [ + 250, + 169, + 259, + 179 + ], + "score": 0.84, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 168, + 437, + 181 + ], + "score": 1.0, + "content": "is the total number of training iterations and", + "type": "text" + }, + { + "bbox": [ + 437, + 169, + 447, + 179 + ], + "score": 0.33, + "content": "\\mathbf { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 168, + 505, + 181 + ], + "score": 1.0, + "content": "is the number", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 177, + 149, + 194 + ], + "spans": [ + { + "bbox": [ + 104, + 177, + 149, + 194 + ], + "score": 1.0, + "content": "of cycles.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 106, + 196, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 105, + 196, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 505, + 209 + ], + "score": 1.0, + "content": "For all datasets and models hyperparameters from the original SSE paper are reused. For CIFAR-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 208, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 505, + 220 + ], + "score": 1.0, + "content": "10/100 length of the cycle is 40 epochs, maximum learning rate is 0.2, batch size is 64. On ResNet50", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 218, + 488, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 488, + 231 + ], + "score": 1.0, + "content": "and ImageNet length of the cycle is 45 epochs, maximum learning rate is 0.1, batch size is 256.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 505, + 320 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 505, + 255 + ], + "score": 1.0, + "content": "Cyclical SGLD Cyclical Stochastic Gradient Langevin Dynamics (cSGLD) (Zhang et al., 2019)", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "is a state-of-the-art ensembling method for deep neural networks pertaining to stochastic Markov", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 263, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 505, + 277 + ], + "score": 1.0, + "content": "Chain Monte Carlo family of methods. It bears similarity to SSE, e.g. it employs SGD with a learn-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "ing rate schedule described with the equation 16 and training is cyclical in the same manner. Its main", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "score": 1.0, + "content": "differences from SSE are the introduction of gradient noise and the capturing of several snapshots", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 297, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 297, + 505, + 310 + ], + "score": 1.0, + "content": "per cycle, both of which can aid in sampling from posterior distribution over neural network weights", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 307, + 151, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 151, + 321 + ], + "score": 1.0, + "content": "efficiently.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 325, + 505, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 325, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 338 + ], + "score": 1.0, + "content": "Some parameters from the original paper are reused: length of cycle is 50 epochs, maximum learning", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "score": 1.0, + "content": "rate is 0.5, batch size is 64. Number of epochs with gradient noise per cycle is 3 epochs. This was", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 346, + 506, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 506, + 360 + ], + "score": 1.0, + "content": "found to yield much higher predictive performance and better uncertainty estimation compared to", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 358, + 440, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 440, + 371 + ], + "score": 1.0, + "content": "the original paper choice of 10 epochs for CIFAR-10 and 3 epochs for CIFAR-100.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 106, + 374, + 505, + 419 + ], + "lines": [ + { + "bbox": [ + 105, + 374, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 506, + 388 + ], + "score": 1.0, + "content": "Finally, the results of cyclical Stochastic Gradient Hamiltonian Monte Carlo (SGHMC), (Zhang", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 385, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 398 + ], + "score": 1.0, + "content": "et al., 2019) which reportedly has marginally better performance compared with cyclical SGLD,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "score": 1.0, + "content": "could not be reproduced with any value of SGD momentum term. Because of this, we only include", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 408, + 244, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 244, + 419 + ], + "score": 1.0, + "content": "cyclical SGLD in our benchmark.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 429, + 505, + 462 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "score": 1.0, + "content": "FGE Fast Geometric Ensembling (FGE) is an ensembling method that is similar to SSE in that", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "score": 1.0, + "content": "it collects weight samples from a training trajectory to construct an ensemble. Its main differences", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 451, + 468, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 468, + 463 + ], + "score": 1.0, + "content": "from SSE are pretraining, short cycle length and a piecewise-linear learning rate schedule:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 467, + 418, + 492 + ], + "lines": [ + { + "bbox": [ + 192, + 467, + 418, + 492 + ], + "spans": [ + { + "bbox": [ + 192, + 467, + 418, + 492 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\alpha ( i ) = \\left\\{ \\begin{array} { l l } { ( 1 - 2 t ( i ) ) \\alpha _ { 1 } + 2 t ( i ) \\alpha _ { 2 } \\quad } & { 0 < t ( i ) \\le \\frac { 1 } { 2 } } \\\\ { ( 2 - 2 t ( i ) ) \\alpha _ { 2 } + ( 2 t ( i ) - 1 ) \\alpha _ { 1 } \\quad \\frac { 1 } { 2 } < t ( i ) \\le 1 } \\end{array} \\right. . } \\end{array}", + "type": "interline_equation", + "image_path": "c0c75003d5c5e3b984b5e1ce77671b4bf9bdf46ca3b36d4e28c655a83c988e56.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 192, + 467, + 418, + 492 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 507, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 105, + 507, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 521 + ], + "score": 1.0, + "content": "Hyperparameters of the original implementation of FGE are reused. Model pretraining is done with", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "SGD for 160 epochs according to the standard learning rate schedule described in equation 10 with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "score": 1.0, + "content": "maximum learning rates from Table 1. After that, a desired number of FGE cycles is done with", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 540, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 479, + 555 + ], + "score": 1.0, + "content": "one snapshot per cycle collected. For VGG the learning rate is changed with parameters", + "type": "text" + }, + { + "bbox": [ + 479, + 542, + 505, + 552 + ], + "score": 0.86, + "content": "\\alpha _ { 1 } ~ =", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 107, + 552, + 191, + 563 + ], + "score": 0.92, + "content": "1 e - 2 , \\alpha _ { 2 } = 5 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "in a cycle with cycle length of 2 epochs. For other networks the learning rate", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 562, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 104, + 562, + 218, + 576 + ], + "score": 1.0, + "content": "is changed with parameters", + "type": "text" + }, + { + "bbox": [ + 218, + 563, + 327, + 574 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } = 5 e - 2 , \\alpha _ { 2 } = 5 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 562, + 506, + 576 + ], + "score": 1.0, + "content": "with cycle length of 4 epochs. Batch size is", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 573, + 127, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 127, + 586 + ], + "score": 1.0, + "content": "128.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 597, + 503, + 631 + ], + "lines": [ + { + "bbox": [ + 105, + 596, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 505, + 611 + ], + "score": 1.0, + "content": "SWAG SWA-Gaussian (SWAG) (Maddox et al., 2019) is an ensembling method based on fitting", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 608, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 505, + 622 + ], + "score": 1.0, + "content": "a Gaussian distribution to model weights on the SGD training trajectory and sampling from this", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 620, + 258, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 620, + 258, + 631 + ], + "score": 1.0, + "content": "distribution to construct an ensemble.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 649 + ], + "score": 1.0, + "content": "Like FGE, SWAG has a pretraining stage which is done according to the standard learning rate", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 646, + 506, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 506, + 661 + ], + "score": 1.0, + "content": "schedule described in equation 10 with maximum learning rates from Table 1. After that, training", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 659, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 505, + 670 + ], + "score": 1.0, + "content": "continues with a constant learning rate of 1e-2 for all models except for PreResNet110 and PreRes-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "Net164 on CIFAR-100 where it continues with a constant learning rate of 5e-2 in accordance with", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 680, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 505, + 693 + ], + "score": 1.0, + "content": "the original paper. Rank of the empirical covariance matrix which is used for estimation of Gaussian", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 691, + 260, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 260, + 703 + ], + "score": 1.0, + "content": "distribution parameters is set to be 20.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42.5 + } + ], + "page_idx": 18, + "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": [ + 301, + 751, + 311, + 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": [ + 106, + 82, + 504, + 134 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "Snapshot ensembles Snapshot ensembles (SSE) (Huang et al., 2017) is a simple example of an", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 506, + 105 + ], + "score": 1.0, + "content": "array of methods which collect samples from a training trajectory of a network in weight space to", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 101, + 506, + 116 + ], + "spans": [ + { + "bbox": [ + 104, + 101, + 506, + 116 + ], + "score": 1.0, + "content": "construct an ensemble. Samples are collected in a cyclical manner: during each cycle the learning", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 113, + 505, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 505, + 124 + ], + "score": 1.0, + "content": "rate goes from a large value to near-zero and snapshot of weights of the network is taken at the end", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 123, + 425, + 135 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 425, + 135 + ], + "score": 1.0, + "content": "of the cycle. SSE uses SGD with a cosine learning schedule defined as follows:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 104, + 82, + 506, + 135 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 139, + 402, + 164 + ], + "lines": [ + { + "bbox": [ + 207, + 139, + 402, + 164 + ], + "spans": [ + { + "bbox": [ + 207, + 139, + 402, + 164 + ], + "score": 0.95, + "content": "\\alpha ( t ) = \\frac { \\alpha _ { 0 } } 2 \\left( \\cos \\left( \\frac { \\pi \\ \\mathrm { m o d } \\ ( t - 1 , \\lceil T / M \\rceil ) } { \\lceil T / M \\rceil } \\right) + 1 \\right) ,", + "type": "interline_equation", + "image_path": "e878bf844409987f489dadacdcc0f85ed405bd6212df995ba1c43bc32567b14c.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 207, + 139, + 402, + 164 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 168, + 504, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 168, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 132, + 181 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 132, + 171, + 145, + 180 + ], + "score": 0.84, + "content": "\\alpha _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 168, + 250, + 181 + ], + "score": 1.0, + "content": "is the initial learning rate,", + "type": "text" + }, + { + "bbox": [ + 250, + 169, + 259, + 179 + ], + "score": 0.84, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 168, + 437, + 181 + ], + "score": 1.0, + "content": "is the total number of training iterations and", + "type": "text" + }, + { + "bbox": [ + 437, + 169, + 447, + 179 + ], + "score": 0.33, + "content": "\\mathbf { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 168, + 505, + 181 + ], + "score": 1.0, + "content": "is the number", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 177, + 149, + 194 + ], + "spans": [ + { + "bbox": [ + 104, + 177, + 149, + 194 + ], + "score": 1.0, + "content": "of cycles.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 104, + 168, + 505, + 194 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 196, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 105, + 196, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 505, + 209 + ], + "score": 1.0, + "content": "For all datasets and models hyperparameters from the original SSE paper are reused. For CIFAR-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 208, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 505, + 220 + ], + "score": 1.0, + "content": "10/100 length of the cycle is 40 epochs, maximum learning rate is 0.2, batch size is 64. On ResNet50", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 218, + 488, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 488, + 231 + ], + "score": 1.0, + "content": "and ImageNet length of the cycle is 45 epochs, maximum learning rate is 0.1, batch size is 256.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 196, + 505, + 231 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 505, + 320 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 505, + 255 + ], + "score": 1.0, + "content": "Cyclical SGLD Cyclical Stochastic Gradient Langevin Dynamics (cSGLD) (Zhang et al., 2019)", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "is a state-of-the-art ensembling method for deep neural networks pertaining to stochastic Markov", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 263, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 505, + 277 + ], + "score": 1.0, + "content": "Chain Monte Carlo family of methods. It bears similarity to SSE, e.g. it employs SGD with a learn-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "ing rate schedule described with the equation 16 and training is cyclical in the same manner. Its main", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 505, + 299 + ], + "score": 1.0, + "content": "differences from SSE are the introduction of gradient noise and the capturing of several snapshots", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 297, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 297, + 505, + 310 + ], + "score": 1.0, + "content": "per cycle, both of which can aid in sampling from posterior distribution over neural network weights", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 307, + 151, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 151, + 321 + ], + "score": 1.0, + "content": "efficiently.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 241, + 505, + 321 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 325, + 505, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 325, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 338 + ], + "score": 1.0, + "content": "Some parameters from the original paper are reused: length of cycle is 50 epochs, maximum learning", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "score": 1.0, + "content": "rate is 0.5, batch size is 64. Number of epochs with gradient noise per cycle is 3 epochs. This was", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 346, + 506, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 506, + 360 + ], + "score": 1.0, + "content": "found to yield much higher predictive performance and better uncertainty estimation compared to", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 358, + 440, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 440, + 371 + ], + "score": 1.0, + "content": "the original paper choice of 10 epochs for CIFAR-10 and 3 epochs for CIFAR-100.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 325, + 506, + 371 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 374, + 505, + 419 + ], + "lines": [ + { + "bbox": [ + 105, + 374, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 506, + 388 + ], + "score": 1.0, + "content": "Finally, the results of cyclical Stochastic Gradient Hamiltonian Monte Carlo (SGHMC), (Zhang", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 385, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 398 + ], + "score": 1.0, + "content": "et al., 2019) which reportedly has marginally better performance compared with cyclical SGLD,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "score": 1.0, + "content": "could not be reproduced with any value of SGD momentum term. Because of this, we only include", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 408, + 244, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 244, + 419 + ], + "score": 1.0, + "content": "cyclical SGLD in our benchmark.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 374, + 506, + 419 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 429, + 505, + 462 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "score": 1.0, + "content": "FGE Fast Geometric Ensembling (FGE) is an ensembling method that is similar to SSE in that", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 452 + ], + "score": 1.0, + "content": "it collects weight samples from a training trajectory to construct an ensemble. Its main differences", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 451, + 468, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 468, + 463 + ], + "score": 1.0, + "content": "from SSE are pretraining, short cycle length and a piecewise-linear learning rate schedule:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 429, + 506, + 463 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 467, + 418, + 492 + ], + "lines": [ + { + "bbox": [ + 192, + 467, + 418, + 492 + ], + "spans": [ + { + "bbox": [ + 192, + 467, + 418, + 492 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\alpha ( i ) = \\left\\{ \\begin{array} { l l } { ( 1 - 2 t ( i ) ) \\alpha _ { 1 } + 2 t ( i ) \\alpha _ { 2 } \\quad } & { 0 < t ( i ) \\le \\frac { 1 } { 2 } } \\\\ { ( 2 - 2 t ( i ) ) \\alpha _ { 2 } + ( 2 t ( i ) - 1 ) \\alpha _ { 1 } \\quad \\frac { 1 } { 2 } < t ( i ) \\le 1 } \\end{array} \\right. . } \\end{array}", + "type": "interline_equation", + "image_path": "c0c75003d5c5e3b984b5e1ce77671b4bf9bdf46ca3b36d4e28c655a83c988e56.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 192, + 467, + 418, + 492 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 507, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 105, + 507, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 521 + ], + "score": 1.0, + "content": "Hyperparameters of the original implementation of FGE are reused. Model pretraining is done with", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "SGD for 160 epochs according to the standard learning rate schedule described in equation 10 with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 505, + 542 + ], + "score": 1.0, + "content": "maximum learning rates from Table 1. After that, a desired number of FGE cycles is done with", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 540, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 479, + 555 + ], + "score": 1.0, + "content": "one snapshot per cycle collected. For VGG the learning rate is changed with parameters", + "type": "text" + }, + { + "bbox": [ + 479, + 542, + 505, + 552 + ], + "score": 0.86, + "content": "\\alpha _ { 1 } ~ =", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 107, + 552, + 191, + 563 + ], + "score": 0.92, + "content": "1 e - 2 , \\alpha _ { 2 } = 5 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "in a cycle with cycle length of 2 epochs. For other networks the learning rate", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 562, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 104, + 562, + 218, + 576 + ], + "score": 1.0, + "content": "is changed with parameters", + "type": "text" + }, + { + "bbox": [ + 218, + 563, + 327, + 574 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } = 5 e - 2 , \\alpha _ { 2 } = 5 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 562, + 506, + 576 + ], + "score": 1.0, + "content": "with cycle length of 4 epochs. Batch size is", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 573, + 127, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 127, + 586 + ], + "score": 1.0, + "content": "128.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33, + "bbox_fs": [ + 104, + 507, + 506, + 586 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 597, + 503, + 631 + ], + "lines": [ + { + "bbox": [ + 105, + 596, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 505, + 611 + ], + "score": 1.0, + "content": "SWAG SWA-Gaussian (SWAG) (Maddox et al., 2019) is an ensembling method based on fitting", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 608, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 505, + 622 + ], + "score": 1.0, + "content": "a Gaussian distribution to model weights on the SGD training trajectory and sampling from this", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 620, + 258, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 620, + 258, + 631 + ], + "score": 1.0, + "content": "distribution to construct an ensemble.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 596, + 505, + 631 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 649 + ], + "score": 1.0, + "content": "Like FGE, SWAG has a pretraining stage which is done according to the standard learning rate", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 646, + 506, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 506, + 661 + ], + "score": 1.0, + "content": "schedule described in equation 10 with maximum learning rates from Table 1. After that, training", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 659, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 505, + 670 + ], + "score": 1.0, + "content": "continues with a constant learning rate of 1e-2 for all models except for PreResNet110 and PreRes-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "Net164 on CIFAR-100 where it continues with a constant learning rate of 5e-2 in accordance with", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 680, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 505, + 693 + ], + "score": 1.0, + "content": "the original paper. Rank of the empirical covariance matrix which is used for estimation of Gaussian", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 691, + 260, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 260, + 703 + ], + "score": 1.0, + "content": "distribution parameters is set to be 20.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 636, + 506, + 703 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 185, + 96, + 419, + 671 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 185, + 96, + 419, + 671 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 185, + 96, + 419, + 671 + ], + "spans": [ + { + "bbox": [ + 185, + 96, + 419, + 671 + ], + "score": 0.941, + "type": "image", + "image_path": "2a825137f49c7974e6db16204b1deb20b2f92b8075de353a11ccc2ad4f4c35fa.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 185, + 96, + 419, + 110.02439024390245 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 185, + 110.02439024390245, + 419, + 124.04878048780489 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 185, + 124.04878048780489, + 419, + 138.07317073170734 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 185, + 138.07317073170734, + 419, + 152.09756097560978 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 185, + 152.09756097560978, + 419, + 166.12195121951223 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 185, + 166.12195121951223, + 419, + 180.14634146341467 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 185, + 180.14634146341467, + 419, + 194.17073170731712 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 185, + 194.17073170731712, + 419, + 208.19512195121956 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 185, + 208.19512195121956, + 419, + 222.219512195122 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 185, + 222.219512195122, + 419, + 236.24390243902445 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 185, + 236.24390243902445, + 419, + 250.2682926829269 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 185, + 250.2682926829269, + 419, + 264.29268292682934 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 185, + 264.29268292682934, + 419, + 278.31707317073176 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 185, + 278.31707317073176, + 419, + 292.3414634146342 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 185, + 292.3414634146342, + 419, + 306.3658536585366 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 185, + 306.3658536585366, + 419, + 320.390243902439 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 185, + 320.390243902439, + 419, + 334.4146341463414 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 185, + 334.4146341463414, + 419, + 348.43902439024384 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 185, + 348.43902439024384, + 419, + 362.46341463414626 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 185, + 362.46341463414626, + 419, + 376.4878048780487 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 185, + 376.4878048780487, + 419, + 390.5121951219511 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 185, + 390.5121951219511, + 419, + 404.5365853658535 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 185, + 404.5365853658535, + 419, + 418.5609756097559 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 185, + 418.5609756097559, + 419, + 432.58536585365835 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 185, + 432.58536585365835, + 419, + 446.60975609756076 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 185, + 446.60975609756076, + 419, + 460.6341463414632 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 185, + 460.6341463414632, + 419, + 474.6585365853656 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 185, + 474.6585365853656, + 419, + 488.682926829268 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 185, + 488.682926829268, + 419, + 502.70731707317043 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 185, + 502.70731707317043, + 419, + 516.7317073170728 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 185, + 516.7317073170728, + 419, + 530.7560975609753 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 185, + 530.7560975609753, + 419, + 544.7804878048777 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 185, + 544.7804878048777, + 419, + 558.8048780487801 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 185, + 558.8048780487801, + 419, + 572.8292682926825 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 185, + 572.8292682926825, + 419, + 586.8536585365849 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 185, + 586.8536585365849, + 419, + 600.8780487804873 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 185, + 600.8780487804873, + 419, + 614.9024390243898 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 185, + 614.9024390243898, + 419, + 628.9268292682922 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 185, + 628.9268292682922, + 419, + 642.9512195121946 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 185, + 642.9512195121946, + 419, + 656.975609756097 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 185, + 656.975609756097, + 419, + 670.9999999999994 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 679, + 505, + 714 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 680, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 505, + 692 + ], + "score": 1.0, + "content": "Figure 8: The average log-likelihood vs the Brier score on a test dataset for different ensemble", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 690, + 505, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 505, + 704 + ], + "score": 1.0, + "content": "methods on CIFAR-10 (a) and CIFAR-10 (b) and ImageNet (c) datasets. While not being equivalent,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 700, + 493, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 700, + 482, + 715 + ], + "score": 1.0, + "content": "these metrics demonstrate a strong linear correlation. The correlation coefficient is denoted as", + "type": "text" + }, + { + "bbox": [ + 483, + 704, + 489, + 713 + ], + "score": 0.79, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 700, + 493, + 715 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + } + ], + "index": 31.0 + } + ], + "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 2020", + "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": [ + 106, + 82, + 326, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 327, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 327, + 96 + ], + "score": 1.0, + "content": "C ADDITIONAL EXPERIMENTAL RESULTS", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 185, + 96, + 419, + 671 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 185, + 96, + 419, + 671 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 185, + 96, + 419, + 671 + ], + "spans": [ + { + "bbox": [ + 185, + 96, + 419, + 671 + ], + "score": 0.941, + "type": "image", + "image_path": "2a825137f49c7974e6db16204b1deb20b2f92b8075de353a11ccc2ad4f4c35fa.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 185, + 96, + 419, + 110.02439024390245 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 185, + 110.02439024390245, + 419, + 124.04878048780489 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 185, + 124.04878048780489, + 419, + 138.07317073170734 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 185, + 138.07317073170734, + 419, + 152.09756097560978 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 185, + 152.09756097560978, + 419, + 166.12195121951223 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 185, + 166.12195121951223, + 419, + 180.14634146341467 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 185, + 180.14634146341467, + 419, + 194.17073170731712 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 185, + 194.17073170731712, + 419, + 208.19512195121956 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 185, + 208.19512195121956, + 419, + 222.219512195122 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 185, + 222.219512195122, + 419, + 236.24390243902445 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 185, + 236.24390243902445, + 419, + 250.2682926829269 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 185, + 250.2682926829269, + 419, + 264.29268292682934 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 185, + 264.29268292682934, + 419, + 278.31707317073176 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 185, + 278.31707317073176, + 419, + 292.3414634146342 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 185, + 292.3414634146342, + 419, + 306.3658536585366 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 185, + 306.3658536585366, + 419, + 320.390243902439 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 185, + 320.390243902439, + 419, + 334.4146341463414 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 185, + 334.4146341463414, + 419, + 348.43902439024384 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 185, + 348.43902439024384, + 419, + 362.46341463414626 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 185, + 362.46341463414626, + 419, + 376.4878048780487 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 185, + 376.4878048780487, + 419, + 390.5121951219511 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 185, + 390.5121951219511, + 419, + 404.5365853658535 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 185, + 404.5365853658535, + 419, + 418.5609756097559 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 185, + 418.5609756097559, + 419, + 432.58536585365835 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 185, + 432.58536585365835, + 419, + 446.60975609756076 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 185, + 446.60975609756076, + 419, + 460.6341463414632 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 185, + 460.6341463414632, + 419, + 474.6585365853656 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 185, + 474.6585365853656, + 419, + 488.682926829268 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 185, + 488.682926829268, + 419, + 502.70731707317043 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 185, + 502.70731707317043, + 419, + 516.7317073170728 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 185, + 516.7317073170728, + 419, + 530.7560975609753 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 185, + 530.7560975609753, + 419, + 544.7804878048777 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 185, + 544.7804878048777, + 419, + 558.8048780487801 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 185, + 558.8048780487801, + 419, + 572.8292682926825 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 185, + 572.8292682926825, + 419, + 586.8536585365849 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 185, + 586.8536585365849, + 419, + 600.8780487804873 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 185, + 600.8780487804873, + 419, + 614.9024390243898 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 185, + 614.9024390243898, + 419, + 628.9268292682922 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 185, + 628.9268292682922, + 419, + 642.9512195121946 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 185, + 642.9512195121946, + 419, + 656.975609756097 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 185, + 656.975609756097, + 419, + 670.9999999999994 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 679, + 505, + 714 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 680, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 505, + 692 + ], + "score": 1.0, + "content": "Figure 8: The average log-likelihood vs the Brier score on a test dataset for different ensemble", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 690, + 505, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 505, + 704 + ], + "score": 1.0, + "content": "methods on CIFAR-10 (a) and CIFAR-10 (b) and ImageNet (c) datasets. While not being equivalent,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 700, + 493, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 700, + 482, + 715 + ], + "score": 1.0, + "content": "these metrics demonstrate a strong linear correlation. The correlation coefficient is denoted as", + "type": "text" + }, + { + "bbox": [ + 483, + 704, + 489, + 713 + ], + "score": 0.79, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 700, + 493, + 715 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + } + ], + "index": 31.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 105, + 161, + 465, + 607 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 105, + 161, + 465, + 607 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 161, + 465, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 465, + 607 + ], + "score": 0.975, + "type": "image", + "image_path": "f79eb25efb99dc1d1cf2252961481981546a627b7c3560dc947a9f166feb89fb.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 105, + 161, + 465, + 309.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 105, + 309.66666666666663, + 465, + 458.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 105, + 458.33333333333326, + 465, + 606.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 612, + 505, + 646 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 612, + 506, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 506, + 626 + ], + "score": 1.0, + "content": "Figure 9: Log-likelihood vs accuracy for different ensembles before (a, c, e) and after (b, d, f)", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "score": 1.0, + "content": "calibration. Both plain log-likelihood and especially calibrated log-likelihood are highly correlated", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 633, + 167, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 167, + 648 + ], + "score": 1.0, + "content": "with accuracy.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.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 2020", + "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": [ + 105, + 161, + 465, + 607 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 105, + 161, + 465, + 607 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 161, + 465, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 161, + 465, + 607 + ], + "score": 0.975, + "type": "image", + "image_path": "f79eb25efb99dc1d1cf2252961481981546a627b7c3560dc947a9f166feb89fb.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 105, + 161, + 465, + 309.66666666666663 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 105, + 309.66666666666663, + 465, + 458.33333333333326 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 105, + 458.33333333333326, + 465, + 606.9999999999999 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 612, + 505, + 646 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 612, + 506, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 506, + 626 + ], + "score": 1.0, + "content": "Figure 9: Log-likelihood vs accuracy for different ensembles before (a, c, e) and after (b, d, f)", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "score": 1.0, + "content": "calibration. Both plain log-likelihood and especially calibrated log-likelihood are highly correlated", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 633, + 167, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 167, + 648 + ], + "score": 1.0, + "content": "with accuracy.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 100, + 503, + 431 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 100, + 503, + 431 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 100, + 503, + 431 + ], + "spans": [ + { + "bbox": [ + 107, + 100, + 503, + 431 + ], + "score": 0.976, + "type": "image", + "image_path": "1c82cd765d3fe4c675cf5745ced5b5595d028f7bbbfc9baf50458fca311762fb.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 100, + 503, + 210.33333333333331 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 210.33333333333331, + 503, + 320.66666666666663 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 320.66666666666663, + 503, + 430.99999999999994 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 441, + 506, + 497 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 442, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 454 + ], + "score": 1.0, + "content": "Figure 10: A side-by-side comparison of log-likelihood and calibrated log-likelihood on CIFAR-10", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 452, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 506, + 465 + ], + "score": 1.0, + "content": "(a) and CIFAR-100 (b) datasets. On CIFAR-10 the performance of one network becomes close to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 464, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 506, + 477 + ], + "score": 1.0, + "content": "dropout, variational inference (vi), and K-FAC Laplace approximation (kfacl) after calibration on all", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "models except VGG. On CIFAR-100 deep ensembles move to the first position in the ranking after", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 485, + 497, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 485, + 497, + 498 + ], + "score": 1.0, + "content": "calibration on WideResNet and VGG. See Section 3.1 for details on the calibrated log-likelihood.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "image", + "bbox": [ + 110, + 543, + 500, + 654 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 543, + 500, + 654 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 110, + 543, + 500, + 654 + ], + "spans": [ + { + "bbox": [ + 110, + 543, + 500, + 654 + ], + "score": 0.967, + "type": "image", + "image_path": "8f837d5863b3595ff9cc80d99dbb23acb46b6f3ce2f4945af33c61bff0c683c4.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 110, + 543, + 500, + 580.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 110, + 580.0, + 500, + 617.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 110, + 617.0, + 500, + 654.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 663, + 505, + 709 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 663, + 506, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 663, + 506, + 676 + ], + "score": 1.0, + "content": "Figure 11: The deep ensemble equivalent of various ensembling techniques on ImageNet. Solid", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 674, + 506, + 688 + ], + "spans": [ + { + "bbox": [ + 104, + 674, + 506, + 688 + ], + "score": 1.0, + "content": "lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "is shaded. Columns 2–4 correspond to DEE based on other metrics, defined similarly to the log-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 698, + 361, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 361, + 709 + ], + "score": 1.0, + "content": "likelihood-based DEE. The results are consistent for all metrics", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + } + ], + "index": 10.75 + } + ], + "page_idx": 21, + "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 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": "22", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 100, + 503, + 431 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 100, + 503, + 431 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 100, + 503, + 431 + ], + "spans": [ + { + "bbox": [ + 107, + 100, + 503, + 431 + ], + "score": 0.976, + "type": "image", + "image_path": "1c82cd765d3fe4c675cf5745ced5b5595d028f7bbbfc9baf50458fca311762fb.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 100, + 503, + 210.33333333333331 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 210.33333333333331, + 503, + 320.66666666666663 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 320.66666666666663, + 503, + 430.99999999999994 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 441, + 506, + 497 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 442, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 454 + ], + "score": 1.0, + "content": "Figure 10: A side-by-side comparison of log-likelihood and calibrated log-likelihood on CIFAR-10", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 452, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 506, + 465 + ], + "score": 1.0, + "content": "(a) and CIFAR-100 (b) datasets. On CIFAR-10 the performance of one network becomes close to", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 464, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 506, + 477 + ], + "score": 1.0, + "content": "dropout, variational inference (vi), and K-FAC Laplace approximation (kfacl) after calibration on all", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "models except VGG. On CIFAR-100 deep ensembles move to the first position in the ranking after", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 485, + 497, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 485, + 497, + 498 + ], + "score": 1.0, + "content": "calibration on WideResNet and VGG. See Section 3.1 for details on the calibrated log-likelihood.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "image", + "bbox": [ + 110, + 543, + 500, + 654 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 543, + 500, + 654 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 110, + 543, + 500, + 654 + ], + "spans": [ + { + "bbox": [ + 110, + 543, + 500, + 654 + ], + "score": 0.967, + "type": "image", + "image_path": "8f837d5863b3595ff9cc80d99dbb23acb46b6f3ce2f4945af33c61bff0c683c4.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 110, + 543, + 500, + 580.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 110, + 580.0, + 500, + 617.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 110, + 617.0, + 500, + 654.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 663, + 505, + 709 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 663, + 506, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 663, + 506, + 676 + ], + "score": 1.0, + "content": "Figure 11: The deep ensemble equivalent of various ensembling techniques on ImageNet. Solid", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 674, + 506, + 688 + ], + "spans": [ + { + "bbox": [ + 104, + 674, + 506, + 688 + ], + "score": 1.0, + "content": "lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "is shaded. Columns 2–4 correspond to DEE based on other metrics, defined similarly to the log-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 698, + 361, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 361, + 709 + ], + "score": 1.0, + "content": "likelihood-based DEE. The results are consistent for all metrics", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12.5 + } + ], + "index": 10.75 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 110, + 142, + 500, + 556 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 142, + 500, + 556 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 142, + 500, + 556 + ], + "spans": [ + { + "bbox": [ + 110, + 142, + 500, + 556 + ], + "score": 0.976, + "type": "image", + "image_path": "dc519f6110a305db8a3aad6a42faf32c4c983c8b916344cd0632e17670f2194b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 110, + 142, + 500, + 280.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 110, + 280.0, + 500, + 418.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 418.0, + 500, + 556.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 564, + 505, + 621 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 564, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 506, + 578 + ], + "score": 1.0, + "content": "Figure 12: The deep ensemble equivalent of various ensembling techniques on CIFAR-10. Solid", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 573, + 507, + 590 + ], + "spans": [ + { + "bbox": [ + 104, + 573, + 507, + 590 + ], + "score": 1.0, + "content": "lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "shaded. Lines 2–4 correspond to DEE based on other metrics, defined similarly to the log-likelihood-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 598, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 506, + 611 + ], + "score": 1.0, + "content": "based DEE. Note that while the actual scale of DEE varies from metric to metric, the ordering of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 609, + 400, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 400, + 622 + ], + "score": 1.0, + "content": "different methods and the overall behaviour of the lines remain the same.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 505, + 664 + ], + "lines": [ + { + "bbox": [ + 106, + 620, + 504, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 620, + 504, + 633 + ], + "score": 1.0, + "content": "SSE outperforms deep ensembles on CIFAR-10 on the WideResNet architecture. It possibly indi-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 631, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 505, + 644 + ], + "score": 1.0, + "content": "cates that the cosine learning rate schedule and longer training of SSE are more suitable for this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 640, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 505, + 657 + ], + "score": 1.0, + "content": "architecture than the piecewise-linear learning rate schedule and the number of epochs used in deep", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 652, + 153, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 153, + 666 + ], + "score": 1.0, + "content": "ensembles.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + } + ], + "page_idx": 22, + "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": [ + 298, + 750, + 312, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 763 + ], + "score": 1.0, + "content": "23", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 110, + 142, + 500, + 556 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 142, + 500, + 556 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 142, + 500, + 556 + ], + "spans": [ + { + "bbox": [ + 110, + 142, + 500, + 556 + ], + "score": 0.976, + "type": "image", + "image_path": "dc519f6110a305db8a3aad6a42faf32c4c983c8b916344cd0632e17670f2194b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 110, + 142, + 500, + 280.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 110, + 280.0, + 500, + 418.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 418.0, + 500, + 556.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 564, + 505, + 621 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 564, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 506, + 578 + ], + "score": 1.0, + "content": "Figure 12: The deep ensemble equivalent of various ensembling techniques on CIFAR-10. Solid", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 573, + 507, + 590 + ], + "spans": [ + { + "bbox": [ + 104, + 573, + 507, + 590 + ], + "score": 1.0, + "content": "lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "shaded. Lines 2–4 correspond to DEE based on other metrics, defined similarly to the log-likelihood-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 598, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 506, + 611 + ], + "score": 1.0, + "content": "based DEE. Note that while the actual scale of DEE varies from metric to metric, the ordering of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 609, + 400, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 400, + 622 + ], + "score": 1.0, + "content": "different methods and the overall behaviour of the lines remain the same.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 505, + 664 + ], + "lines": [ + { + "bbox": [ + 106, + 620, + 504, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 620, + 504, + 633 + ], + "score": 1.0, + "content": "SSE outperforms deep ensembles on CIFAR-10 on the WideResNet architecture. It possibly indi-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 631, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 505, + 644 + ], + "score": 1.0, + "content": "cates that the cosine learning rate schedule and longer training of SSE are more suitable for this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 640, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 505, + 657 + ], + "score": 1.0, + "content": "architecture than the piecewise-linear learning rate schedule and the number of epochs used in deep", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 652, + 153, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 153, + 666 + ], + "score": 1.0, + "content": "ensembles.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 620, + 505, + 666 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 110, + 163, + 500, + 578 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 163, + 500, + 578 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 163, + 500, + 578 + ], + "spans": [ + { + "bbox": [ + 110, + 163, + 500, + 578 + ], + "score": 0.974, + "type": "image", + "image_path": "0f9191ac394276b345b9ff56a48f66b2bbb712f94543168240fb11d445daae9b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 110, + 163, + 500, + 301.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 110, + 301.33333333333337, + 500, + 439.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 439.66666666666674, + 500, + 578.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 584, + 506, + 641 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 585, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 505, + 597 + ], + "score": 1.0, + "content": "Figure 13: The deep ensemble equivalent of various ensembling techniques on CIFAR-100. Solid", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 593, + 507, + 611 + ], + "spans": [ + { + "bbox": [ + 104, + 593, + 507, + 611 + ], + "score": 1.0, + "content": "lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "score": 1.0, + "content": "shaded. Lines 2–4 correspond to DEE based on other metrics, defined similarly to the log-likelihood-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 618, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 506, + 631 + ], + "score": 1.0, + "content": "based DEE. Note that while the actual scale of DEE varies from metric to metric, the ordering of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 629, + 400, + 642 + ], + "spans": [ + { + "bbox": [ + 106, + 629, + 400, + 642 + ], + "score": 1.0, + "content": "different methods and the overall behaviour of the lines remain the same.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + } + ], + "page_idx": 23, + "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 2020", + "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": [ + 110, + 163, + 500, + 578 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 163, + 500, + 578 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 163, + 500, + 578 + ], + "spans": [ + { + "bbox": [ + 110, + 163, + 500, + 578 + ], + "score": 0.974, + "type": "image", + "image_path": "0f9191ac394276b345b9ff56a48f66b2bbb712f94543168240fb11d445daae9b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 110, + 163, + 500, + 301.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 110, + 301.33333333333337, + 500, + 439.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 439.66666666666674, + 500, + 578.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 584, + 506, + 641 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 585, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 505, + 597 + ], + "score": 1.0, + "content": "Figure 13: The deep ensemble equivalent of various ensembling techniques on CIFAR-100. Solid", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 593, + 507, + 611 + ], + "spans": [ + { + "bbox": [ + 104, + 593, + 507, + 611 + ], + "score": 1.0, + "content": "lines: mean DEE for different methods and architectures. Area between DEElower and DEEupper is", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "score": 1.0, + "content": "shaded. Lines 2–4 correspond to DEE based on other metrics, defined similarly to the log-likelihood-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 618, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 506, + 631 + ], + "score": 1.0, + "content": "based DEE. Note that while the actual scale of DEE varies from metric to metric, the ordering of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 629, + 400, + 642 + ], + "spans": [ + { + "bbox": [ + 106, + 629, + 400, + 642 + ], + "score": 1.0, + "content": "different methods and the overall behaviour of the lines remain the same.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 109, + 96, + 502, + 697 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 109, + 96, + 502, + 697 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 96, + 502, + 697 + ], + "spans": [ + { + "bbox": [ + 109, + 96, + 502, + 697 + ], + "score": 0.979, + "html": "
Model MethodError (%) Negative calibrated log-likelihood
15 101001 5 10 100
Dropout5.86±0.095.81±0.085.82±0.065.79±0.070.232±0.005 0.225±0.0040.224±0.004 0.223±0.003
SWA-Gaussian7.03±0.505.66±0.085.49±0.125.25±0.130.230±0.0140.182±0.0030.171±0.002 0.160±0.002
Cyclic SGLD7.37±0.166.56±0.095.71±0.064.84±0.040.234±0.0040.196±0.0040.176±0.003 0.147±0.003
Fast Geometric Ens.6.52±0.165.95±0.165.69±0.165.10±0.130.213±0.0050.187±0.0030.178±0.003 0.155±0.004
VGG16Deep Ensembles5.95±0.144.79±0.114.57±0.074.39±NA0.226±0.0010.158±0.0020.134±NA
CIFAR-10Single model5.83±0.115.83±0.115.83±0.115.83±0.110.223±0.0020.223±0.0020.223+0.002 0.223+0.002
Variational Inf. (FFG)6.57±0.095.63±0.135.50±0.105.46±0.030.239±0.0020.192±0.0020.184±0.002 0.175±0.001
KFAC-Laplace6.00±0.135.82±0.125.82±0.195.80±0.190.210±0.005 0.203±0.0070.201±0.007 0.200±0.008
Snapshot Ensembles7.76±0.225.52±0.135.00±0.104.54±0.050.247±0.0050.176±0.0010.160±0.001 0.137±0.001
SWA-Gaussian5.77±0.454.56±0.174.46±0.124.34±0.130.178±0.0090.143±0.0040.178±0.009 0.143±0.004 0.139±0.003 0.131±0.003
Cyclic SGLD6.18±0.205.32±0.154.55±0.133.83±0.020.185±0.0060.156±0.0050.138±0.002 0.115±0.001
Fast GeometricEns.5.52±0.094.83±0.084.73±0.104.28±0.050.163±0.0020.141±0.0030.137±0.003 0.126±0.002
ResNet110Deep Ensembles4.66±0.113.77±0.113.63±0.073.53±NA0.148±0.0040.117±0.0020.106±NA
CIFAR-10Single model4.69±0.114.69±0.114.69±0.114.69±0.110.150±0.0020.150±0.0020.150±0.003 0.150±0.002
Variational Inf. (FFG)5.57±0.264.91±0.154.72±0.134.60±0.030.178±0.0030.149±0.0010.144±0.001 0.140±0.000
KFAC-Laplace5.81±0.395.14±0.154.90±0.144.78±0.080.187±0.0140.160±0.0070.147±0.003
Snapshot Ensembles8.41±0.274.85±0.114.16±0.163.52±0.100.252±0.0060.153±0.0020.132±0.002 0.107±0.001
SWA-Gaussian5.41±0.714.21±0.194.21±0.234.02±0.140.171±0.0280.130±0.0040.128±0.004 0.121±0.002
Cyclic SGLD5.80±0.214.97±0.124.30±0.083.66±0.060.178±0.0040.149±0.0040.131±0.003 0.110±0.001
Fast Geometric Ens.5.22±0.074.49±0.064.36±0.074.09±0.120.157±0.0030.134±0.0020.130±0.001 0.119±0.002
ResNet164Deep Ensembles4.53±0.113.51±0.093.50±0.063.34±NA0.147±0.0020.113±0.0010.107±0.001 0.100±NA
CIFAR-10Single model4.52±0.114.52±0.114.52±0.114.52±0.110.144±0.0020.144±0.0030.144±0.002 0.144±0.003
Variational Inf. (FFG)5.62±0.144.78±0.054.66±0.054.55±0.080.183±0.0040.151±0.0010.146±0.001 0.141±0.001
KFAC-Laplace5.23±0.294.77±0.234.65±0.174.60±0.090.168±0.0080.151±0.0070.146±0.005 0.142±0.004
Snapshot Ensembles8.06±0.104.50±0.043.89±0.093.50±0.050.241±0.0040.144±0.0030.124±0.002 0.104±0.001
Dropout3.88±0.123.70±0.183.63±0.193.64±0.170.130±0.0020.120±0.0020.130±0.002 0.120±0.002 0.119±0.001 0.117±0.002
SWA-Gaussian4.98±1.173.53±0.093.34±0.143.28±0.100.157±0.0360.111±0.0040.105±0.0030.101±0.002
Cyclic SGLD4.78±0.164.09±0.113.63±0.133.19±0.040.155±0.0030.128±0.0020.114±0.0010.099±0.002
Fast Geometric Ens.4.86±0.173.95±0.073.77±0.103.34±0.060.148±0.0030.120±0.0020.113±0.0020.102±0.001
WideResNetDeepEnsembles3.65±0.023.11±0.103.01±0.062.83±NA0.123±0.0020.097±0.0010.095±0.0010.090±NA
CIFAR-10Single model3.70±0.153.70±0.153.70±0.153.70±0.150.124±0.0050.124±0.0050.125±0.0050.124±0.005
Variational Inf. (FFG)5.61±0.044.15±0.153.94±0.103.64±0.070.189±0.0020.134±0.0020.127±0.0020.117±0.001
KFAC-Laplace4.03±0.193.90±0.153.88±0.223.83±0.160.134±0.0040.124±0.0040.122±0.0050.120±0.003
Snapshot Ensembles5.56±0.153.68±0.093.33±0.102.89±0.070.179±0.0050.119±0.0010.105±0.0010.090±0.001
Dropout26.10±0.2025.68±0.1825.66±0.1425.60±0.171.176±0.0081.111±0.0081.098±0.0091.084±0.009
SWA-Gaussian27.74±1.8724.53±0.0923.64±0.2822.97±0.201.109±0.0730.931±0.0070.879±0.0070.826±0.005
Cyclic SGLD29.75±0.1726.79±0.1924.14±0.1121.15±0.111.114±0.0030.976±0.0040.881±0.0060.749±0.004
Fast Geometric Ens.27.07±0.2425.35±0.2924.68±0.4022.78±0.221.057±0.0100.965±0.0030.930±0.0030.827±0.004
VGG16Deep Ensembles25.72±0.1721.60±0.1320.79±0.1619.88±NA1.092±0.0040.840±0.0050.794±0.0020.723±NA
CIFAR-100Single model25.44±0.2925.44±0.2925.44±0.2925.44±0.291.087±0.0061.087±0.0061.087±0.0061.087±0.006
Variational Inf.(FFG)27.24±0.0925.24±0.1124.85±0.0524.56±0.071.154±0.0041.001±0.0020.973±0.0020.939±0.001
KFAC-Laplace27.11±0.5925.98±0.2125.84±0.3825.70±0.381.174±0.0371.089±0.0071.069±0.0051.050±0.008
Snapshot Ensembles31.19±0.3323.87±0.1822.31±0.3121.03±0.101.170±0.0120.899±0.0040.834±0.005 0.751±0.003
SWA-Gaussian27.75±0.7622.31±0.2221.52±0.3020.69±0.190.960±0.0330.781±0.0110.745±0.0100.701±0.008
Cyclic SGLD25.73±0.1423.30±0.1921.20±0.2118.07±0.160.914±0.0060.818±0.0040.753±0.0020.630±0.002
Fast Geometric Ens.22.84±0.1621.22±0.2020.79±0.2319.64±0.15(0.798±0.0060.729±0.0030.713±0.002:0.679±0.002
ResNet110Deep Ensembles22.55±0.2818.30±0.2217.59±0.2116.97±NA0.847±0.0070.675±0.0010.638±0.0010.594±NA
CIFAR-100Single model22.66±0.3122.66±0.3122.66±0.3122.66±0.310.848±0.0140.848±0.0150.848±0.0140.848±0.015
VariationalInf.(FFG)24.27±0.2622.41±0.1322.14±0.1221.86±0.070.924±0.0070.829±0.0030.813±0.0010.795±0.001
KFAC-Laplace24.88±0.9722.87±0.4422.41±0.2622.14±0.290.948±0.0360.858±0.0140.836±0.0100.812±0.010
Snapshot Ensembles30.30±0.4022.83±0.2321.13±0.1418.48±0.251.069±0.0060.820±0.0030.761±0.0020.662±0.002
SWA-Gaussian24.38±0.9320.62±0.1820.08±0.1919.48±0.190.844±0.0420.719±0.0060.700±0.006 0.667±0.004
Cyclic SGLD24.87±0.3922.37±0.2720.23±0.2217.13±0.180.888±0.0080.790±0.009
Fast Geometric Ens.21.92±0.1520.10±0.2219.87±0.2518.73±0.250.765±0.0030.699±0.0040.686±0.0040.650±0.003
ResNet164CIFAR-100Deep EnsemblesSingle model21.41±0.2517.53±0.1716.90±0.1516.50±NA0.819±0.0080.647±0.0030.615±0.0020.574±NA
CIAR-100Single modelVariational Inf. (FFG)23.47±0.2621.35±0.1121.10±0.1620.82±0.040.910±0.0010.801±0.0020.782±0.0020.762±0.000
KFAC-Laplace23.44±0.4521.77±0.2021.29±0.23221.03±0.380.902±0.0190.813±0.0060.792±0.0050.772±0.007
Snapshot Ensembles29.48±0.1921.92±0.1820.27±0.2317.68±0.071.045±0.0050.789±0.0050.729±0.004 0.634±0.003
Dropout20.19±0.11 19.41±0.1719.36±0.1219.22±0.150.823±0.0080.768±0.0050.760±0.006 0.751±0.005
SWA-Gaussian20.45±0.73 17.57±0.1717.21±0.2217.08±0.190.794±0.0250.653±0.0040.634±0.005 0.614±0.005
Cyclic SGLD21.42±0.3219.42±0.2817.88±0.1616.29±0.100.813±0.0100.713±0.0090.654±0.005 0.583±0.004
Fast Geometric Ens.21.48±0.3118.54±0.1618.00±0.1917.12±0.160.770±0.0070.652±0.0060.630±0.006 0.596±0.003
WideResNetDeepEnsembles19.38±0.2016.55±0.0816.17±0.1515.77±NA0.797±0.0070.623±0.0030.595±0.003 0.571±NA
CIFAR-100SSingle model19.31±0.2419.31±0.2419.31±0.2419.31±0.240.797±0.0100.797±0.0100.797±0.010 0.797±0.010
VariationalInf. (FFG)24.38±0.2720.17±0.1519.28±0.0918.74±0.081.004±0.0110.767±0.0040.727±0.003 0.685±0.002
KFAC-Laplace20.02±0.18 19.76±0.1519.53±0.1919.43±0.210.834±0.0090.803±0.006 0.795±0.007 0.789±0.006
Snapshot Ensembles23.01±0.26 18.20±0.1317.12±0.3116.07±0.070.859±0.009 0.678±0.006 0.633±0.008 0.582±0.004
", + "type": "table", + "image_path": "d8205cb8bab67f5c77abbc1d98b3ada6d4617f33ea2020dc2a2f44dcc04c3ae3.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 96, + 502, + 296.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 296.33333333333337, + 502, + 496.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 496.66666666666674, + 502, + 697.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 120, + 705, + 490, + 714 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 122, + 704, + 489, + 714 + ], + "spans": [ + { + "bbox": [ + 122, + 704, + 489, + 714 + ], + "score": 1.0, + "content": "Table 3: Classification error and negative calibrated log-likelihood for different models and numbers of samples on CIFAR-10/100.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + } + ], + "page_idx": 24, + "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": [ + 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": "table", + "bbox": [ + 109, + 96, + 502, + 697 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 109, + 96, + 502, + 697 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 96, + 502, + 697 + ], + "spans": [ + { + "bbox": [ + 109, + 96, + 502, + 697 + ], + "score": 0.979, + "html": "
Model MethodError (%) Negative calibrated log-likelihood
15 101001 5 10 100
Dropout5.86±0.095.81±0.085.82±0.065.79±0.070.232±0.005 0.225±0.0040.224±0.004 0.223±0.003
SWA-Gaussian7.03±0.505.66±0.085.49±0.125.25±0.130.230±0.0140.182±0.0030.171±0.002 0.160±0.002
Cyclic SGLD7.37±0.166.56±0.095.71±0.064.84±0.040.234±0.0040.196±0.0040.176±0.003 0.147±0.003
Fast Geometric Ens.6.52±0.165.95±0.165.69±0.165.10±0.130.213±0.0050.187±0.0030.178±0.003 0.155±0.004
VGG16Deep Ensembles5.95±0.144.79±0.114.57±0.074.39±NA0.226±0.0010.158±0.0020.134±NA
CIFAR-10Single model5.83±0.115.83±0.115.83±0.115.83±0.110.223±0.0020.223±0.0020.223+0.002 0.223+0.002
Variational Inf. (FFG)6.57±0.095.63±0.135.50±0.105.46±0.030.239±0.0020.192±0.0020.184±0.002 0.175±0.001
KFAC-Laplace6.00±0.135.82±0.125.82±0.195.80±0.190.210±0.005 0.203±0.0070.201±0.007 0.200±0.008
Snapshot Ensembles7.76±0.225.52±0.135.00±0.104.54±0.050.247±0.0050.176±0.0010.160±0.001 0.137±0.001
SWA-Gaussian5.77±0.454.56±0.174.46±0.124.34±0.130.178±0.0090.143±0.0040.178±0.009 0.143±0.004 0.139±0.003 0.131±0.003
Cyclic SGLD6.18±0.205.32±0.154.55±0.133.83±0.020.185±0.0060.156±0.0050.138±0.002 0.115±0.001
Fast GeometricEns.5.52±0.094.83±0.084.73±0.104.28±0.050.163±0.0020.141±0.0030.137±0.003 0.126±0.002
ResNet110Deep Ensembles4.66±0.113.77±0.113.63±0.073.53±NA0.148±0.0040.117±0.0020.106±NA
CIFAR-10Single model4.69±0.114.69±0.114.69±0.114.69±0.110.150±0.0020.150±0.0020.150±0.003 0.150±0.002
Variational Inf. (FFG)5.57±0.264.91±0.154.72±0.134.60±0.030.178±0.0030.149±0.0010.144±0.001 0.140±0.000
KFAC-Laplace5.81±0.395.14±0.154.90±0.144.78±0.080.187±0.0140.160±0.0070.147±0.003
Snapshot Ensembles8.41±0.274.85±0.114.16±0.163.52±0.100.252±0.0060.153±0.0020.132±0.002 0.107±0.001
SWA-Gaussian5.41±0.714.21±0.194.21±0.234.02±0.140.171±0.0280.130±0.0040.128±0.004 0.121±0.002
Cyclic SGLD5.80±0.214.97±0.124.30±0.083.66±0.060.178±0.0040.149±0.0040.131±0.003 0.110±0.001
Fast Geometric Ens.5.22±0.074.49±0.064.36±0.074.09±0.120.157±0.0030.134±0.0020.130±0.001 0.119±0.002
ResNet164Deep Ensembles4.53±0.113.51±0.093.50±0.063.34±NA0.147±0.0020.113±0.0010.107±0.001 0.100±NA
CIFAR-10Single model4.52±0.114.52±0.114.52±0.114.52±0.110.144±0.0020.144±0.0030.144±0.002 0.144±0.003
Variational Inf. (FFG)5.62±0.144.78±0.054.66±0.054.55±0.080.183±0.0040.151±0.0010.146±0.001 0.141±0.001
KFAC-Laplace5.23±0.294.77±0.234.65±0.174.60±0.090.168±0.0080.151±0.0070.146±0.005 0.142±0.004
Snapshot Ensembles8.06±0.104.50±0.043.89±0.093.50±0.050.241±0.0040.144±0.0030.124±0.002 0.104±0.001
Dropout3.88±0.123.70±0.183.63±0.193.64±0.170.130±0.0020.120±0.0020.130±0.002 0.120±0.002 0.119±0.001 0.117±0.002
SWA-Gaussian4.98±1.173.53±0.093.34±0.143.28±0.100.157±0.0360.111±0.0040.105±0.0030.101±0.002
Cyclic SGLD4.78±0.164.09±0.113.63±0.133.19±0.040.155±0.0030.128±0.0020.114±0.0010.099±0.002
Fast Geometric Ens.4.86±0.173.95±0.073.77±0.103.34±0.060.148±0.0030.120±0.0020.113±0.0020.102±0.001
WideResNetDeepEnsembles3.65±0.023.11±0.103.01±0.062.83±NA0.123±0.0020.097±0.0010.095±0.0010.090±NA
CIFAR-10Single model3.70±0.153.70±0.153.70±0.153.70±0.150.124±0.0050.124±0.0050.125±0.0050.124±0.005
Variational Inf. (FFG)5.61±0.044.15±0.153.94±0.103.64±0.070.189±0.0020.134±0.0020.127±0.0020.117±0.001
KFAC-Laplace4.03±0.193.90±0.153.88±0.223.83±0.160.134±0.0040.124±0.0040.122±0.0050.120±0.003
Snapshot Ensembles5.56±0.153.68±0.093.33±0.102.89±0.070.179±0.0050.119±0.0010.105±0.0010.090±0.001
Dropout26.10±0.2025.68±0.1825.66±0.1425.60±0.171.176±0.0081.111±0.0081.098±0.0091.084±0.009
SWA-Gaussian27.74±1.8724.53±0.0923.64±0.2822.97±0.201.109±0.0730.931±0.0070.879±0.0070.826±0.005
Cyclic SGLD29.75±0.1726.79±0.1924.14±0.1121.15±0.111.114±0.0030.976±0.0040.881±0.0060.749±0.004
Fast Geometric Ens.27.07±0.2425.35±0.2924.68±0.4022.78±0.221.057±0.0100.965±0.0030.930±0.0030.827±0.004
VGG16Deep Ensembles25.72±0.1721.60±0.1320.79±0.1619.88±NA1.092±0.0040.840±0.0050.794±0.0020.723±NA
CIFAR-100Single model25.44±0.2925.44±0.2925.44±0.2925.44±0.291.087±0.0061.087±0.0061.087±0.0061.087±0.006
Variational Inf.(FFG)27.24±0.0925.24±0.1124.85±0.0524.56±0.071.154±0.0041.001±0.0020.973±0.0020.939±0.001
KFAC-Laplace27.11±0.5925.98±0.2125.84±0.3825.70±0.381.174±0.0371.089±0.0071.069±0.0051.050±0.008
Snapshot Ensembles31.19±0.3323.87±0.1822.31±0.3121.03±0.101.170±0.0120.899±0.0040.834±0.005 0.751±0.003
SWA-Gaussian27.75±0.7622.31±0.2221.52±0.3020.69±0.190.960±0.0330.781±0.0110.745±0.0100.701±0.008
Cyclic SGLD25.73±0.1423.30±0.1921.20±0.2118.07±0.160.914±0.0060.818±0.0040.753±0.0020.630±0.002
Fast Geometric Ens.22.84±0.1621.22±0.2020.79±0.2319.64±0.15(0.798±0.0060.729±0.0030.713±0.002:0.679±0.002
ResNet110Deep Ensembles22.55±0.2818.30±0.2217.59±0.2116.97±NA0.847±0.0070.675±0.0010.638±0.0010.594±NA
CIFAR-100Single model22.66±0.3122.66±0.3122.66±0.3122.66±0.310.848±0.0140.848±0.0150.848±0.0140.848±0.015
VariationalInf.(FFG)24.27±0.2622.41±0.1322.14±0.1221.86±0.070.924±0.0070.829±0.0030.813±0.0010.795±0.001
KFAC-Laplace24.88±0.9722.87±0.4422.41±0.2622.14±0.290.948±0.0360.858±0.0140.836±0.0100.812±0.010
Snapshot Ensembles30.30±0.4022.83±0.2321.13±0.1418.48±0.251.069±0.0060.820±0.0030.761±0.0020.662±0.002
SWA-Gaussian24.38±0.9320.62±0.1820.08±0.1919.48±0.190.844±0.0420.719±0.0060.700±0.006 0.667±0.004
Cyclic SGLD24.87±0.3922.37±0.2720.23±0.2217.13±0.180.888±0.0080.790±0.009
Fast Geometric Ens.21.92±0.1520.10±0.2219.87±0.2518.73±0.250.765±0.0030.699±0.0040.686±0.0040.650±0.003
ResNet164CIFAR-100Deep EnsemblesSingle model21.41±0.2517.53±0.1716.90±0.1516.50±NA0.819±0.0080.647±0.0030.615±0.0020.574±NA
CIAR-100Single modelVariational Inf. (FFG)23.47±0.2621.35±0.1121.10±0.1620.82±0.040.910±0.0010.801±0.0020.782±0.0020.762±0.000
KFAC-Laplace23.44±0.4521.77±0.2021.29±0.23221.03±0.380.902±0.0190.813±0.0060.792±0.0050.772±0.007
Snapshot Ensembles29.48±0.1921.92±0.1820.27±0.2317.68±0.071.045±0.0050.789±0.0050.729±0.004 0.634±0.003
Dropout20.19±0.11 19.41±0.1719.36±0.1219.22±0.150.823±0.0080.768±0.0050.760±0.006 0.751±0.005
SWA-Gaussian20.45±0.73 17.57±0.1717.21±0.2217.08±0.190.794±0.0250.653±0.0040.634±0.005 0.614±0.005
Cyclic SGLD21.42±0.3219.42±0.2817.88±0.1616.29±0.100.813±0.0100.713±0.0090.654±0.005 0.583±0.004
Fast Geometric Ens.21.48±0.3118.54±0.1618.00±0.1917.12±0.160.770±0.0070.652±0.0060.630±0.006 0.596±0.003
WideResNetDeepEnsembles19.38±0.2016.55±0.0816.17±0.1515.77±NA0.797±0.0070.623±0.0030.595±0.003 0.571±NA
CIFAR-100SSingle model19.31±0.2419.31±0.2419.31±0.2419.31±0.240.797±0.0100.797±0.0100.797±0.010 0.797±0.010
VariationalInf. (FFG)24.38±0.2720.17±0.1519.28±0.0918.74±0.081.004±0.0110.767±0.0040.727±0.003 0.685±0.002
KFAC-Laplace20.02±0.18 19.76±0.1519.53±0.1919.43±0.210.834±0.0090.803±0.006 0.795±0.007 0.789±0.006
Snapshot Ensembles23.01±0.26 18.20±0.1317.12±0.3116.07±0.070.859±0.009 0.678±0.006 0.633±0.008 0.582±0.004
", + "type": "table", + "image_path": "d8205cb8bab67f5c77abbc1d98b3ada6d4617f33ea2020dc2a2f44dcc04c3ae3.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 96, + 502, + 296.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 296.33333333333337, + 502, + 496.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 496.66666666666674, + 502, + 697.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 120, + 705, + 490, + 714 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 122, + 704, + 489, + 714 + ], + "spans": [ + { + "bbox": [ + 122, + 704, + 489, + 714 + ], + "score": 1.0, + "content": "Table 3: Classification error and negative calibrated log-likelihood for different models and numbers of samples on CIFAR-10/100.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 109, + 115, + 501, + 676 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 109, + 115, + 501, + 676 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 115, + 501, + 676 + ], + "spans": [ + { + "bbox": [ + 109, + 115, + 501, + 676 + ], + "score": 0.98, + "html": "
Error (%) Negative calibrated log-likelihood
ModelMethod5 10 100 510100
Dropout5.81 vs 5.525.82 vs 5.345.79 vs 5.210.225 vs 0.1870.224 vs 0.1770.223 vs 0.167
SWA-Gaussian5.66 vs 5.655.49 vs 5.365.25 vs 5.080.182 vs 0.1800.171 vs 0.1660.160 vs 0.152
Cyclic SGLD6.56 vs 6.075.71 vs 5.474.84 vs 4.880.196 vs 0.1860.176 vs 0.1690.147 vs 0.147
Fast Geometric Ens.5.95 vs 5.645.69 vs 5.365.10 vs 4.98~0.187 vs 0.1770.178 vs 0.1670.155 vs 0.150
VGG16Deep Ensembles4.79 vs 4.904.57 vs 4.734.39 vs 4.55个0.158 vs 0.1620.148 vs 0.1520.134 vs 0.136个
CIFAR-10Single model5.83 vs 5.555.83 vs 5.355.83 vs 5.19↓0.223 vs 0.1830.223 vs 0.1740.223 vs 0.166
VariationalInf.(FFG)5.63vs5.435.50 vs 5.255.46 vs 5.070.192 vs 0.1820.184 vs 0.1690.175 vs 0.154
KFAC-Laplace5.82 vs 5.495.82 vs 5.325.80 vs 5.170.203 vs 0.1770.201 vs 0.1710.200 vs 0.164
Snapshot Ensembles5.52 vs 5.61~5.00 vs 5.03~4.54 vs 4.640.176 vs 0.178个0.160 vs 0.160~0.137 vs 0.137
SWA-Gaussian4.56 vs 4.47~4.46 vs 4.344.34 vs 4.160.143 vs 0.1420.139 vs 0.1350.131 vs 0.125
Cyclic SGLD5.32 vs 4.884.55 vs 4.353.83 vs 3.590.156 vs 0.1480.138 vs 0.1310.115 vs 0.111
Fast Geometric Ens.4.83 vs 4.594.73 vs 4.444.28 vs 4.140.141 vs 0.1380.137 vs 0.1320.126 vs 0.121
ResNet110Deep Ensembles3.77 vs 3.703.63 vs 3.583.53 vs 3.450.117 vs 0.1180.112 vs 0.1120.106 vs 0.105
CIFAR-10Single model4.69 vs 4.324.69 vs 4.234.69 vs 4.100.150 vs 0.1370.150 vs 0.1340.150 vs 0.131
Variational Inf.(FFG)44.91 vs 4.664.72 vs 4.434.60 vs 4.250.149 vs 0.1450.144 vs 0.1380.140 vs 0.130
KFAC-Laplace5.14 vs 4.434.90 vs 4.274.78 vs 4.170.160 vs 0.1390.153 vs 0.1340.147 vs 0.130
Snapshot Ensembles4.85 vs 4.78~4.16 vs 4.183.52 vs 3.480.153 vs 0.1500.132 vs 0.1300.107 vs 0.106
SWA-Gaussian4.21 vs 4.174.21 vs 4.04~4.02 vs 3.840.130 vs 0.130~0.128 vs 0.126~0.121 vs 0.116
Cyclic SGLD4.97 vs 4.674.30 vs 4.013.66 vs 3.480.149 vs 0.1410.131 vs 0.1250.110 vs 0.107
Fast Geometric Ens.4.49 vs 4.294.36 vs 4.154.09 vs 3.850.134 vs 0.1310.130 vs 0.1260.119 vs 0.115
ResNet164Deep Ensembles3.51 vs 3.583.50 vs 3.463.34 vs 3.300.113 vs 0.1140.107 vs 0.1070.100 vs 0.101个
CIFAR-10Single model4.52 vs 4.154.52 vs 4.084.52 vs 3.980.144 vs 0.1310.144 vs 0.1280.144 vs 0.126
VariationalInf.(FFG)4.78vs 4.414.66 vs 4.224.55 vs 4.050.151 vs 0.1420.146 vs 0.1350.141 vs 0.128
KFAC-Laplace4.77 vs 4.264.65 vs 4.214.60 vs 4.080.151 vs 0.1350.146 vs 0.1320.142 vs 0.127
Snapshot Ensembles4.50 vs 4.423.89 vs 3.873.50 vs 3.350.144 vs 0.1420.124 vs 0.1230.104 vs 0.104
Dropout3.70 vs 3.62~3.63 vs 3.523.64 vs 3.440.120 vs 0.1170.119 vs 0.1140.117 vs 0.111
SWA-Gaussian3.53 vs 3.59~3.34 vs 3.34~3.28 vs 3.24~0.111 vs 0.1140.105 vs 0.1070.101 vs 0.102
Cyclic SGLD4.09 vs 3.95~3.63 vs 3.583.19 vs 3.22~0.128 vs 0.1250.114 vs 0.1120.099 vs 0.100个
Fast Geometric Ens.3.95 vs 3.90~3.77 vs 3.643.34 vs 3.270.120 vs 0.120~0.113 vs 0.1130.102 vs 0.102
WideResNetDeepEnsembles3.11 vs 3.21个3.01 vs 3.022.83 vs 2.910.097 vs 0.1030.095 vs 0.0980.090 vs 0.094
CIFAR-10Single model3.70 vs 3.533.70 vs 3.453.70 vs 3.400.124 vs 0.117↓0.125 vs 0.114↓0.124 vs 0.113
VariationalInf.(FFG)4.15vs4.053.94 vs 3.803.64 vs 3.63~0.134 vs 0.1360.127 vs 0.1260.117 vs 0.116
KFAC-Laplace3.90 vs 3.633.88 vs 3.583.83vs 3.500.124 vs 0.1150.122 vs 0.1130.120 vs 0.111
Snapshot Ensembles3.68 vs 3.743.33 vs 3.352.89 vs 2.900.119 vs 0.122个0.105 vs 0.107个0.090 vs 0.093
Dropout25.68 vs 24.3725.66 vs 23.8925.60 vs 23.411.111 vs 0.9991.098 vs 0.960↓1.084 vs 0.911
SWA-Gaussian24.53 vs 24.2823.64 vs 23.2722.97 vs 22.340.931 vs 0.9260.879 vs 0.8590.826 vs 0.795
Cyclic SGLD26.79 vs 25.6624.14 vs 23.4521.15 vs 21.040.976 vs 0.9290.881 vs 0.8480.749 vs 0.740
Fast Geometric Ens.25.35 vs 24.5324.68 vs 23.6222.78 vs 22.200.965 vs 0.9210.930 vs 0.8780.827 vs 0.800
VGG16Deep Ensembles21.60 vs 21.90个20.79 vs 21.0319.88 vs 20.230.840 vs 0.865个0.794 vs 0.811个0.723 vs 0.731
CIFAR-100Single model25.44 vs 24.3825.44 vs 23.9225.44 vs 23.481.087 vs 0.9731.087 vs 0.9451.087 vs 0.912
VariationalInf.(FFG)25.24vs24.1924.85 vs 23.5624.56 vs 22.891.001 vs 0.9640.973 vs 0.9190.939 vs 0.864
KFAC-Laplace25.98 vs 24.5325.84 vs 24.0325.70 vs 23.571.089 vs 0.9891.069 vs 0.9491.050 vs 0.909
Snapshot Ensembles23.87 vs 23.8822.31 vs 22.5021.03 vs 21.040.899 vs 0.905~0.834 vs 0.836~0.751 vs 0.750
SWA-Gaussian22.31 vs 22.20~21.52 vs 21.21~20.69 vs 20.280.781 vs 0.7700.745 vs 0.7300.701 vs 0.683
Cyclic SGLD23.30 vs 22.3221.20 vs 20.4318.07 vs 17.670.818 vs 0.7870.753 vs 0.7250.630 vs 0.616
Fast Geometric Ens.21.22 vs 20.6920.79 vs 20.1819.64 vs 19.250.729 vs 0.7140.713 vs 0.6940.679 vs 0.661
ResNet110Deep Ensembles18.30 vs 18.3617.59 vs 17.6116.97 vs 16.740.675 vs 0.6720.638 vs 0.6350.594 vs 0.591
CIFAR-100Single model22.66 vs 21.3722.66 vs 21.1722.66 vs 20.980.848 vs 0.7970.848 vs 0.7860.848 vs 0.775
Variational Inf. (FFG)22.41 vs 21.6722.14 vs 21.2121.86 vs 20.770.829 vs 0.7990.813 vs 0.7750.795 vs 0.748
KFAC-Laplace22.87 vs 21.6922.41 vs 21.2822.14 vs 20.990.858 vs 0.8100.836 vs 0.7880.812 vs 0.766
Snapshot Ensembles22.83 vs 22.3321.13 vs 20.7118.48 vs 18.230.820 vs 0.8060.761 vs 0.7440.662 vs 0.651
SWA-Gaussian20.62 vs 20.6120.08 vs 20.0819.48 vs 19.330.719 vs 0.7150.700 vs 0.6900.667 vs 0.654
Cyclic SGLD22.37 vs 21.5720.23 vs 19.5817.13 vs 16.990.790 vs 0.7670.722 vs 0.7020.606 vs 0.595
Fast Geometric Ens.20.10 vs 19.8219.87 vs 19.3918.73 vs 18.330.699 vs 0.6890.686 vs 0.6710.650 vs 0.636
ResNet164Deep Ensembles17.53 vs 17.5716.90 vs 16.8416.50 vs 16.220.647 vs 0.650~0.615 vs 0.6130.574 vs 0.575
CIFAR-100Single model21.39 vs 20.6021.39 vs 20.3921.39 vs 20.230.817 vs 0.7720.817 vs 0.7610.817 vs 0.751
VariationalInf.(FFG)21.35vs 21.0621.10 vs 20.5420.82 vs 19.970.801 vs 0.7850.782 vs 0.7590.762 vs 0.731
KFAC-Laplace21.77 vs 20.6621.29 vs 20.3621.03 vs 20.180.813 vs 0.7780.792 vs 0.7580.772 vs 0.740
Snapshot Ensembles21.92 vs 21.6920.27 vs 19.9217.68 vs 17.660.789 vs 0.7810.729 vs 0.7200.634 vs 0.629
Dropout19.41 vs 19.2719.36 vs 19.1119.22 vs 18.880.768 vs 0.7510.760 vs 0.7380.751 vs 0.723
Cyclic SGLD19.42 vs 18.8317.88 vs 17.5016.29 vs 16.210.713 vs 0.6960.654 vs 0.6410.583 vs 0.580
Fast Geometric Ens.18.54 vs 18.3918.00 vs 17.8417.12 vs 16.930.652 vs 0.6490.630 vs 0.6240.596 vs 0.592
WideResNetDeepEnsembles16.55 vs 16.84个16.17 vs 16.3015.77 vs 15.770.623 vs 0.632个0.595 vs 0.6020.571 vs 0.573个
CIFAR-100Singlemodel19.31 vs 18.8319.31 vs 18.8019.31 vs 18.720.797 vs 0.7550.797 vs 0.7460.797 vs 0.738
VariationalInf.(FFG)20.17vs20.1219.28 vs 19.20~18.74 vs 18.540.767 vs 0.766~0.727 vs 0.7240.685 vs 0.679
KFAC-Laplace19.76 vs 19.2119.53 vs 19.0319.43 vs 18.930.803 vs 0.7640.795 vs 0.757↓0.789 vs 0.747
Snapshot Ensembles18.20 vs 18.2217.12 vs 17.2016.07 vs 16.27~0.678 vs 0.6800.633 vs 0.6350.582 vs 0.586个
", + "type": "table", + "image_path": "ff5628fbf7a70318b2599a800f6465a6b7a575fe44b3dac05fc99771191be206.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 115, + 501, + 302.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 302.0, + 501, + 489.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 489.0, + 501, + 676.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 130, + 685, + 480, + 694 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 130, + 684, + 480, + 695 + ], + "spans": [ + { + "bbox": [ + 130, + 684, + 480, + 695 + ], + "score": 1.0, + "content": "Table 4: Classification error and negative calibrated log-likelihood before vs. after test-time augmentation on CIFAR-10/100.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + } + ], + "page_idx": 25, + "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": [ + 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": "table", + "bbox": [ + 109, + 115, + 501, + 676 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 109, + 115, + 501, + 676 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 115, + 501, + 676 + ], + "spans": [ + { + "bbox": [ + 109, + 115, + 501, + 676 + ], + "score": 0.98, + "html": "
Error (%) Negative calibrated log-likelihood
ModelMethod5 10 100 510100
Dropout5.81 vs 5.525.82 vs 5.345.79 vs 5.210.225 vs 0.1870.224 vs 0.1770.223 vs 0.167
SWA-Gaussian5.66 vs 5.655.49 vs 5.365.25 vs 5.080.182 vs 0.1800.171 vs 0.1660.160 vs 0.152
Cyclic SGLD6.56 vs 6.075.71 vs 5.474.84 vs 4.880.196 vs 0.1860.176 vs 0.1690.147 vs 0.147
Fast Geometric Ens.5.95 vs 5.645.69 vs 5.365.10 vs 4.98~0.187 vs 0.1770.178 vs 0.1670.155 vs 0.150
VGG16Deep Ensembles4.79 vs 4.904.57 vs 4.734.39 vs 4.55个0.158 vs 0.1620.148 vs 0.1520.134 vs 0.136个
CIFAR-10Single model5.83 vs 5.555.83 vs 5.355.83 vs 5.19↓0.223 vs 0.1830.223 vs 0.1740.223 vs 0.166
VariationalInf.(FFG)5.63vs5.435.50 vs 5.255.46 vs 5.070.192 vs 0.1820.184 vs 0.1690.175 vs 0.154
KFAC-Laplace5.82 vs 5.495.82 vs 5.325.80 vs 5.170.203 vs 0.1770.201 vs 0.1710.200 vs 0.164
Snapshot Ensembles5.52 vs 5.61~5.00 vs 5.03~4.54 vs 4.640.176 vs 0.178个0.160 vs 0.160~0.137 vs 0.137
SWA-Gaussian4.56 vs 4.47~4.46 vs 4.344.34 vs 4.160.143 vs 0.1420.139 vs 0.1350.131 vs 0.125
Cyclic SGLD5.32 vs 4.884.55 vs 4.353.83 vs 3.590.156 vs 0.1480.138 vs 0.1310.115 vs 0.111
Fast Geometric Ens.4.83 vs 4.594.73 vs 4.444.28 vs 4.140.141 vs 0.1380.137 vs 0.1320.126 vs 0.121
ResNet110Deep Ensembles3.77 vs 3.703.63 vs 3.583.53 vs 3.450.117 vs 0.1180.112 vs 0.1120.106 vs 0.105
CIFAR-10Single model4.69 vs 4.324.69 vs 4.234.69 vs 4.100.150 vs 0.1370.150 vs 0.1340.150 vs 0.131
Variational Inf.(FFG)44.91 vs 4.664.72 vs 4.434.60 vs 4.250.149 vs 0.1450.144 vs 0.1380.140 vs 0.130
KFAC-Laplace5.14 vs 4.434.90 vs 4.274.78 vs 4.170.160 vs 0.1390.153 vs 0.1340.147 vs 0.130
Snapshot Ensembles4.85 vs 4.78~4.16 vs 4.183.52 vs 3.480.153 vs 0.1500.132 vs 0.1300.107 vs 0.106
SWA-Gaussian4.21 vs 4.174.21 vs 4.04~4.02 vs 3.840.130 vs 0.130~0.128 vs 0.126~0.121 vs 0.116
Cyclic SGLD4.97 vs 4.674.30 vs 4.013.66 vs 3.480.149 vs 0.1410.131 vs 0.1250.110 vs 0.107
Fast Geometric Ens.4.49 vs 4.294.36 vs 4.154.09 vs 3.850.134 vs 0.1310.130 vs 0.1260.119 vs 0.115
ResNet164Deep Ensembles3.51 vs 3.583.50 vs 3.463.34 vs 3.300.113 vs 0.1140.107 vs 0.1070.100 vs 0.101个
CIFAR-10Single model4.52 vs 4.154.52 vs 4.084.52 vs 3.980.144 vs 0.1310.144 vs 0.1280.144 vs 0.126
VariationalInf.(FFG)4.78vs 4.414.66 vs 4.224.55 vs 4.050.151 vs 0.1420.146 vs 0.1350.141 vs 0.128
KFAC-Laplace4.77 vs 4.264.65 vs 4.214.60 vs 4.080.151 vs 0.1350.146 vs 0.1320.142 vs 0.127
Snapshot Ensembles4.50 vs 4.423.89 vs 3.873.50 vs 3.350.144 vs 0.1420.124 vs 0.1230.104 vs 0.104
Dropout3.70 vs 3.62~3.63 vs 3.523.64 vs 3.440.120 vs 0.1170.119 vs 0.1140.117 vs 0.111
SWA-Gaussian3.53 vs 3.59~3.34 vs 3.34~3.28 vs 3.24~0.111 vs 0.1140.105 vs 0.1070.101 vs 0.102
Cyclic SGLD4.09 vs 3.95~3.63 vs 3.583.19 vs 3.22~0.128 vs 0.1250.114 vs 0.1120.099 vs 0.100个
Fast Geometric Ens.3.95 vs 3.90~3.77 vs 3.643.34 vs 3.270.120 vs 0.120~0.113 vs 0.1130.102 vs 0.102
WideResNetDeepEnsembles3.11 vs 3.21个3.01 vs 3.022.83 vs 2.910.097 vs 0.1030.095 vs 0.0980.090 vs 0.094
CIFAR-10Single model3.70 vs 3.533.70 vs 3.453.70 vs 3.400.124 vs 0.117↓0.125 vs 0.114↓0.124 vs 0.113
VariationalInf.(FFG)4.15vs4.053.94 vs 3.803.64 vs 3.63~0.134 vs 0.1360.127 vs 0.1260.117 vs 0.116
KFAC-Laplace3.90 vs 3.633.88 vs 3.583.83vs 3.500.124 vs 0.1150.122 vs 0.1130.120 vs 0.111
Snapshot Ensembles3.68 vs 3.743.33 vs 3.352.89 vs 2.900.119 vs 0.122个0.105 vs 0.107个0.090 vs 0.093
Dropout25.68 vs 24.3725.66 vs 23.8925.60 vs 23.411.111 vs 0.9991.098 vs 0.960↓1.084 vs 0.911
SWA-Gaussian24.53 vs 24.2823.64 vs 23.2722.97 vs 22.340.931 vs 0.9260.879 vs 0.8590.826 vs 0.795
Cyclic SGLD26.79 vs 25.6624.14 vs 23.4521.15 vs 21.040.976 vs 0.9290.881 vs 0.8480.749 vs 0.740
Fast Geometric Ens.25.35 vs 24.5324.68 vs 23.6222.78 vs 22.200.965 vs 0.9210.930 vs 0.8780.827 vs 0.800
VGG16Deep Ensembles21.60 vs 21.90个20.79 vs 21.0319.88 vs 20.230.840 vs 0.865个0.794 vs 0.811个0.723 vs 0.731
CIFAR-100Single model25.44 vs 24.3825.44 vs 23.9225.44 vs 23.481.087 vs 0.9731.087 vs 0.9451.087 vs 0.912
VariationalInf.(FFG)25.24vs24.1924.85 vs 23.5624.56 vs 22.891.001 vs 0.9640.973 vs 0.9190.939 vs 0.864
KFAC-Laplace25.98 vs 24.5325.84 vs 24.0325.70 vs 23.571.089 vs 0.9891.069 vs 0.9491.050 vs 0.909
Snapshot Ensembles23.87 vs 23.8822.31 vs 22.5021.03 vs 21.040.899 vs 0.905~0.834 vs 0.836~0.751 vs 0.750
SWA-Gaussian22.31 vs 22.20~21.52 vs 21.21~20.69 vs 20.280.781 vs 0.7700.745 vs 0.7300.701 vs 0.683
Cyclic SGLD23.30 vs 22.3221.20 vs 20.4318.07 vs 17.670.818 vs 0.7870.753 vs 0.7250.630 vs 0.616
Fast Geometric Ens.21.22 vs 20.6920.79 vs 20.1819.64 vs 19.250.729 vs 0.7140.713 vs 0.6940.679 vs 0.661
ResNet110Deep Ensembles18.30 vs 18.3617.59 vs 17.6116.97 vs 16.740.675 vs 0.6720.638 vs 0.6350.594 vs 0.591
CIFAR-100Single model22.66 vs 21.3722.66 vs 21.1722.66 vs 20.980.848 vs 0.7970.848 vs 0.7860.848 vs 0.775
Variational Inf. (FFG)22.41 vs 21.6722.14 vs 21.2121.86 vs 20.770.829 vs 0.7990.813 vs 0.7750.795 vs 0.748
KFAC-Laplace22.87 vs 21.6922.41 vs 21.2822.14 vs 20.990.858 vs 0.8100.836 vs 0.7880.812 vs 0.766
Snapshot Ensembles22.83 vs 22.3321.13 vs 20.7118.48 vs 18.230.820 vs 0.8060.761 vs 0.7440.662 vs 0.651
SWA-Gaussian20.62 vs 20.6120.08 vs 20.0819.48 vs 19.330.719 vs 0.7150.700 vs 0.6900.667 vs 0.654
Cyclic SGLD22.37 vs 21.5720.23 vs 19.5817.13 vs 16.990.790 vs 0.7670.722 vs 0.7020.606 vs 0.595
Fast Geometric Ens.20.10 vs 19.8219.87 vs 19.3918.73 vs 18.330.699 vs 0.6890.686 vs 0.6710.650 vs 0.636
ResNet164Deep Ensembles17.53 vs 17.5716.90 vs 16.8416.50 vs 16.220.647 vs 0.650~0.615 vs 0.6130.574 vs 0.575
CIFAR-100Single model21.39 vs 20.6021.39 vs 20.3921.39 vs 20.230.817 vs 0.7720.817 vs 0.7610.817 vs 0.751
VariationalInf.(FFG)21.35vs 21.0621.10 vs 20.5420.82 vs 19.970.801 vs 0.7850.782 vs 0.7590.762 vs 0.731
KFAC-Laplace21.77 vs 20.6621.29 vs 20.3621.03 vs 20.180.813 vs 0.7780.792 vs 0.7580.772 vs 0.740
Snapshot Ensembles21.92 vs 21.6920.27 vs 19.9217.68 vs 17.660.789 vs 0.7810.729 vs 0.7200.634 vs 0.629
Dropout19.41 vs 19.2719.36 vs 19.1119.22 vs 18.880.768 vs 0.7510.760 vs 0.7380.751 vs 0.723
Cyclic SGLD19.42 vs 18.8317.88 vs 17.5016.29 vs 16.210.713 vs 0.6960.654 vs 0.6410.583 vs 0.580
Fast Geometric Ens.18.54 vs 18.3918.00 vs 17.8417.12 vs 16.930.652 vs 0.6490.630 vs 0.6240.596 vs 0.592
WideResNetDeepEnsembles16.55 vs 16.84个16.17 vs 16.3015.77 vs 15.770.623 vs 0.632个0.595 vs 0.6020.571 vs 0.573个
CIFAR-100Singlemodel19.31 vs 18.8319.31 vs 18.8019.31 vs 18.720.797 vs 0.7550.797 vs 0.7460.797 vs 0.738
VariationalInf.(FFG)20.17vs20.1219.28 vs 19.20~18.74 vs 18.540.767 vs 0.766~0.727 vs 0.7240.685 vs 0.679
KFAC-Laplace19.76 vs 19.2119.53 vs 19.0319.43 vs 18.930.803 vs 0.7640.795 vs 0.757↓0.789 vs 0.747
Snapshot Ensembles18.20 vs 18.2217.12 vs 17.2016.07 vs 16.27~0.678 vs 0.6800.633 vs 0.6350.582 vs 0.586个
", + "type": "table", + "image_path": "ff5628fbf7a70318b2599a800f6465a6b7a575fe44b3dac05fc99771191be206.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 115, + 501, + 302.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 302.0, + 501, + 489.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 489.0, + 501, + 676.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 130, + 685, + 480, + 694 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 130, + 684, + 480, + 695 + ], + "spans": [ + { + "bbox": [ + 130, + 684, + 480, + 695 + ], + "score": 1.0, + "content": "Table 4: Classification error and negative calibrated log-likelihood before vs. after test-time augmentation on CIFAR-10/100.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 156, + 78, + 454, + 712 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 156, + 78, + 454, + 712 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 156, + 78, + 454, + 712 + ], + "spans": [ + { + "bbox": [ + 156, + 78, + 454, + 712 + ], + "score": 0.972, + "html": "
ModelDeep ensemble equivalent score
Method1 sample 5 samples 10 samples 50 samples 100 samples
VGG16 CIFAR-10Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.64.721.933.8
Cyclic SGLD1.0 1.72.67.410.5
SWA-Gaussian1.0 2.22.94.44.6
1.3 2.0
Fast Geometric Ens.2.44.75.8
Dropout1.0 1.01.01.11.1
Variational Inf. (FFG)1.0 1.82.02.52.6 1.6
KFAC-Laplace Single model1.4 1.6 1.11.6 1.11.6 1.11.1
ResNet110 CIFAR-101.1 5.094.6
Deep Ensembles1.0 1.0 1.010.0 2.048.032.6
Snapshot Ensembles1.0 1.01.614.66.0
Cyclic SGLD1.34.62.0
SWA-Gaussian1.01.51.9
Fast Geometric Ens.1.0 1.4 1.01.72.42.9
Variational Inf. (FFG)1.01.21.41.5
KFAC-Laplace1.0 1.01.01.01.1
Single model1.0 1.01.01.01.0
Deep Ensembles1.0 5.010.043.7100.0
ResNet164 CIFAR-101.0 1.12.311.317.2
Snapshot Ensembles Cyclic SGLD1.0 1.01.84.86.7
SWA-Gaussian1.0 1.81.92.52.7
Fast Geometric Ens.1.0 1.61.82.52.9
Variational Inf. (FFG)1.0 1.01.01.31.3
1.01.0 1.01.21.2
KFAC-Laplace1.11.1 1.11.11.1
Single model1.010.048.0
Deep Ensembles5.0 1.02.530.686.0 100.0
Snapshot Ensembles1.3 1.0 1.01.64.04.1
Cyclic SGLD SWA-Gaussian1.01.82.53.1 3.3
WideResNet Fast Geometric Ens. CIFAR-101.01.21.72.7 3.2
Dropout1.01.21.3 1.41.4
Variational Inf. (FFG)1.01.01.0 1.31.4
KFAC-Laplace1.01.01.0 1.21.2
Single model1.01.01.01.0
VGG16 CIFAR-1001.0
Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.95.418.826.8
Cyclic SGLD1.0 1.8 1.0 2.33.3 3.415.928.2
SWA-Gaussian1.2 1.92.35.25.9 5.8
Fast Geometric Ens.1.0 1.01.04.5 1.01.1
Dropout1.82.12.2
Variational Inf. (FFG)1.0 1.61.3
KFAC-Laplace Single model1.0 1.01.2 1.01.3 1.01.0
1.0 1.01.0
ResNet110 CIFAR-1005.010.050.099.0
Deep Ensembles Snapshot Ensembles1.0 1.31.94.76.2
1.02.07.012.2
Cyclic SGLD1.32.23.6
SWA-Gaussian1.0 1.7 1.5 2.63.03.3 4.24.7
Fast Geometric Ens. Variational Inf. (FFG)1.0 1.21.31.51.5
KFAC-Laplace1.0 1.01.11.31.4
Single model1.0 1.01.01.01.0
Deep Ensembles1.010.050.0100.0
Snapshot Ensembles5.0 1.0
ResNet164 CIFAR-1001.31.94.86.3
Cyclic SGLD SWA-Gaussian1.0 1.32.06.813.3
Fast Geometric Ens.1.0 2.1 1.6 2.62.6 3.03.6 4.23.8 4.8
Variational Inf. (FFG)1.0 1.21.41.61.6
KFAC-Laplace1.0 1.11.31.51.5
1.0
Single model1.01.01.01.0
WideResNet Fast Geometric Ens. CIFAR-100Dropout Variational Inf. (FFG) KFAC-LaplaceDeep Ensembles5.010.049.095.9
Snapshot Ensembles1.0 1.0 2.54.216.220.0
Cyclic SGLD SWA-Gaussian1.0 1.9 1.0 3.23.2 4.213.6 5.718.8 6.0
", + "type": "table", + "image_path": "80694f819e2b363ec5780885623f38bcafd88a15fb20d0149149dda8dc74e89d.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 156, + 78, + 454, + 89.12280701754386 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 156, + 89.12280701754386, + 454, + 100.24561403508773 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 156, + 100.24561403508773, + 454, + 111.36842105263159 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 156, + 111.36842105263159, + 454, + 122.49122807017545 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 156, + 122.49122807017545, + 454, + 133.61403508771932 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 156, + 133.61403508771932, + 454, + 144.73684210526318 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 156, + 144.73684210526318, + 454, + 155.85964912280704 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 156, + 155.85964912280704, + 454, + 166.9824561403509 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 156, + 166.9824561403509, + 454, + 178.10526315789477 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 156, + 178.10526315789477, + 454, + 189.22807017543863 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 156, + 189.22807017543863, + 454, + 200.3508771929825 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 156, + 200.3508771929825, + 454, + 211.47368421052636 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 156, + 211.47368421052636, + 454, + 222.59649122807022 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 156, + 222.59649122807022, + 454, + 233.71929824561408 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 156, + 233.71929824561408, + 454, + 244.84210526315795 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 156, + 244.84210526315795, + 454, + 255.9649122807018 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 156, + 255.9649122807018, + 454, + 267.08771929824564 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 156, + 267.08771929824564, + 454, + 278.2105263157895 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 156, + 278.2105263157895, + 454, + 289.3333333333333 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 156, + 289.3333333333333, + 454, + 300.45614035087715 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 156, + 300.45614035087715, + 454, + 311.578947368421 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 156, + 311.578947368421, + 454, + 322.7017543859648 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 156, + 322.7017543859648, + 454, + 333.82456140350865 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 156, + 333.82456140350865, + 454, + 344.9473684210525 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 156, + 344.9473684210525, + 454, + 356.0701754385963 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 156, + 356.0701754385963, + 454, + 367.19298245614016 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 156, + 367.19298245614016, + 454, + 378.315789473684 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 156, + 378.315789473684, + 454, + 389.4385964912278 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 156, + 389.4385964912278, + 454, + 400.56140350877166 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 156, + 400.56140350877166, + 454, + 411.6842105263155 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 156, + 411.6842105263155, + 454, + 422.80701754385933 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 156, + 422.80701754385933, + 454, + 433.92982456140317 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 156, + 433.92982456140317, + 454, + 445.052631578947 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 156, + 445.052631578947, + 454, + 456.17543859649084 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 156, + 456.17543859649084, + 454, + 467.29824561403467 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 156, + 467.29824561403467, + 454, + 478.4210526315785 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 156, + 478.4210526315785, + 454, + 489.54385964912234 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 156, + 489.54385964912234, + 454, + 500.6666666666662 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 156, + 500.6666666666662, + 454, + 511.78947368421 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 156, + 511.78947368421, + 454, + 522.9122807017538 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 156, + 522.9122807017538, + 454, + 534.0350877192977 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 156, + 534.0350877192977, + 454, + 545.1578947368416 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 156, + 545.1578947368416, + 454, + 556.2807017543855 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 156, + 556.2807017543855, + 454, + 567.4035087719294 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 156, + 567.4035087719294, + 454, + 578.5263157894733 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 156, + 578.5263157894733, + 454, + 589.6491228070172 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 156, + 589.6491228070172, + 454, + 600.7719298245611 + ], + "spans": [], + "index": 46 + }, + { + "bbox": [ + 156, + 600.7719298245611, + 454, + 611.894736842105 + ], + "spans": [], + "index": 47 + }, + { + "bbox": [ + 156, + 611.894736842105, + 454, + 623.0175438596489 + ], + "spans": [], + "index": 48 + }, + { + "bbox": [ + 156, + 623.0175438596489, + 454, + 634.1403508771928 + ], + "spans": [], + "index": 49 + }, + { + "bbox": [ + 156, + 634.1403508771928, + 454, + 645.2631578947367 + ], + "spans": [], + "index": 50 + }, + { + "bbox": [ + 156, + 645.2631578947367, + 454, + 656.3859649122805 + ], + "spans": [], + "index": 51 + }, + { + "bbox": [ + 156, + 656.3859649122805, + 454, + 667.5087719298244 + ], + "spans": [], + "index": 52 + }, + { + "bbox": [ + 156, + 667.5087719298244, + 454, + 678.6315789473683 + ], + "spans": [], + "index": 53 + }, + { + "bbox": [ + 156, + 678.6315789473683, + 454, + 689.7543859649122 + ], + "spans": [], + "index": 54 + }, + { + "bbox": [ + 156, + 689.7543859649122, + 454, + 700.8771929824561 + ], + "spans": [], + "index": 55 + }, + { + "bbox": [ + 156, + 700.8771929824561, + 454, + 712.0 + ], + "spans": [], + "index": 56 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 221, + 719, + 391, + 728 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 220, + 718, + 391, + 729 + ], + "spans": [ + { + "bbox": [ + 220, + 718, + 391, + 729 + ], + "score": 1.0, + "content": "Table 5: Deep ensemble equivalent score for CIFAR-10/100.", + "type": "text" + } + ], + "index": 57 + } + ], + "index": 57 + } + ], + "index": 42.5 + } + ], + "page_idx": 26, + "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": [ + 298, + 750, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 156, + 78, + 454, + 712 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 156, + 78, + 454, + 712 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 156, + 78, + 454, + 712 + ], + "spans": [ + { + "bbox": [ + 156, + 78, + 454, + 712 + ], + "score": 0.972, + "html": "
ModelDeep ensemble equivalent score
Method1 sample 5 samples 10 samples 50 samples 100 samples
VGG16 CIFAR-10Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.64.721.933.8
Cyclic SGLD1.0 1.72.67.410.5
SWA-Gaussian1.0 2.22.94.44.6
1.3 2.0
Fast Geometric Ens.2.44.75.8
Dropout1.0 1.01.01.11.1
Variational Inf. (FFG)1.0 1.82.02.52.6 1.6
KFAC-Laplace Single model1.4 1.6 1.11.6 1.11.6 1.11.1
ResNet110 CIFAR-101.1 5.094.6
Deep Ensembles1.0 1.0 1.010.0 2.048.032.6
Snapshot Ensembles1.0 1.01.614.66.0
Cyclic SGLD1.34.62.0
SWA-Gaussian1.01.51.9
Fast Geometric Ens.1.0 1.4 1.01.72.42.9
Variational Inf. (FFG)1.01.21.41.5
KFAC-Laplace1.0 1.01.01.01.1
Single model1.0 1.01.01.01.0
Deep Ensembles1.0 5.010.043.7100.0
ResNet164 CIFAR-101.0 1.12.311.317.2
Snapshot Ensembles Cyclic SGLD1.0 1.01.84.86.7
SWA-Gaussian1.0 1.81.92.52.7
Fast Geometric Ens.1.0 1.61.82.52.9
Variational Inf. (FFG)1.0 1.01.01.31.3
1.01.0 1.01.21.2
KFAC-Laplace1.11.1 1.11.11.1
Single model1.010.048.0
Deep Ensembles5.0 1.02.530.686.0 100.0
Snapshot Ensembles1.3 1.0 1.01.64.04.1
Cyclic SGLD SWA-Gaussian1.01.82.53.1 3.3
WideResNet Fast Geometric Ens. CIFAR-101.01.21.72.7 3.2
Dropout1.01.21.3 1.41.4
Variational Inf. (FFG)1.01.01.0 1.31.4
KFAC-Laplace1.01.01.0 1.21.2
Single model1.01.01.01.0
VGG16 CIFAR-1001.0
Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.95.418.826.8
Cyclic SGLD1.0 1.8 1.0 2.33.3 3.415.928.2
SWA-Gaussian1.2 1.92.35.25.9 5.8
Fast Geometric Ens.1.0 1.01.04.5 1.01.1
Dropout1.82.12.2
Variational Inf. (FFG)1.0 1.61.3
KFAC-Laplace Single model1.0 1.01.2 1.01.3 1.01.0
1.0 1.01.0
ResNet110 CIFAR-1005.010.050.099.0
Deep Ensembles Snapshot Ensembles1.0 1.31.94.76.2
1.02.07.012.2
Cyclic SGLD1.32.23.6
SWA-Gaussian1.0 1.7 1.5 2.63.03.3 4.24.7
Fast Geometric Ens. Variational Inf. (FFG)1.0 1.21.31.51.5
KFAC-Laplace1.0 1.01.11.31.4
Single model1.0 1.01.01.01.0
Deep Ensembles1.010.050.0100.0
Snapshot Ensembles5.0 1.0
ResNet164 CIFAR-1001.31.94.86.3
Cyclic SGLD SWA-Gaussian1.0 1.32.06.813.3
Fast Geometric Ens.1.0 2.1 1.6 2.62.6 3.03.6 4.23.8 4.8
Variational Inf. (FFG)1.0 1.21.41.61.6
KFAC-Laplace1.0 1.11.31.51.5
1.0
Single model1.01.01.01.0
WideResNet Fast Geometric Ens. CIFAR-100Dropout Variational Inf. (FFG) KFAC-LaplaceDeep Ensembles5.010.049.095.9
Snapshot Ensembles1.0 1.0 2.54.216.220.0
Cyclic SGLD SWA-Gaussian1.0 1.9 1.0 3.23.2 4.213.6 5.718.8 6.0
", + "type": "table", + "image_path": "80694f819e2b363ec5780885623f38bcafd88a15fb20d0149149dda8dc74e89d.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 156, + 78, + 454, + 89.12280701754386 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 156, + 89.12280701754386, + 454, + 100.24561403508773 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 156, + 100.24561403508773, + 454, + 111.36842105263159 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 156, + 111.36842105263159, + 454, + 122.49122807017545 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 156, + 122.49122807017545, + 454, + 133.61403508771932 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 156, + 133.61403508771932, + 454, + 144.73684210526318 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 156, + 144.73684210526318, + 454, + 155.85964912280704 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 156, + 155.85964912280704, + 454, + 166.9824561403509 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 156, + 166.9824561403509, + 454, + 178.10526315789477 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 156, + 178.10526315789477, + 454, + 189.22807017543863 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 156, + 189.22807017543863, + 454, + 200.3508771929825 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 156, + 200.3508771929825, + 454, + 211.47368421052636 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 156, + 211.47368421052636, + 454, + 222.59649122807022 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 156, + 222.59649122807022, + 454, + 233.71929824561408 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 156, + 233.71929824561408, + 454, + 244.84210526315795 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 156, + 244.84210526315795, + 454, + 255.9649122807018 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 156, + 255.9649122807018, + 454, + 267.08771929824564 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 156, + 267.08771929824564, + 454, + 278.2105263157895 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 156, + 278.2105263157895, + 454, + 289.3333333333333 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 156, + 289.3333333333333, + 454, + 300.45614035087715 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 156, + 300.45614035087715, + 454, + 311.578947368421 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 156, + 311.578947368421, + 454, + 322.7017543859648 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 156, + 322.7017543859648, + 454, + 333.82456140350865 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 156, + 333.82456140350865, + 454, + 344.9473684210525 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 156, + 344.9473684210525, + 454, + 356.0701754385963 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 156, + 356.0701754385963, + 454, + 367.19298245614016 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 156, + 367.19298245614016, + 454, + 378.315789473684 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 156, + 378.315789473684, + 454, + 389.4385964912278 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 156, + 389.4385964912278, + 454, + 400.56140350877166 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 156, + 400.56140350877166, + 454, + 411.6842105263155 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 156, + 411.6842105263155, + 454, + 422.80701754385933 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 156, + 422.80701754385933, + 454, + 433.92982456140317 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 156, + 433.92982456140317, + 454, + 445.052631578947 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 156, + 445.052631578947, + 454, + 456.17543859649084 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 156, + 456.17543859649084, + 454, + 467.29824561403467 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 156, + 467.29824561403467, + 454, + 478.4210526315785 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 156, + 478.4210526315785, + 454, + 489.54385964912234 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 156, + 489.54385964912234, + 454, + 500.6666666666662 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 156, + 500.6666666666662, + 454, + 511.78947368421 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 156, + 511.78947368421, + 454, + 522.9122807017538 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 156, + 522.9122807017538, + 454, + 534.0350877192977 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 156, + 534.0350877192977, + 454, + 545.1578947368416 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 156, + 545.1578947368416, + 454, + 556.2807017543855 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 156, + 556.2807017543855, + 454, + 567.4035087719294 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 156, + 567.4035087719294, + 454, + 578.5263157894733 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 156, + 578.5263157894733, + 454, + 589.6491228070172 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 156, + 589.6491228070172, + 454, + 600.7719298245611 + ], + "spans": [], + "index": 46 + }, + { + "bbox": [ + 156, + 600.7719298245611, + 454, + 611.894736842105 + ], + "spans": [], + "index": 47 + }, + { + "bbox": [ + 156, + 611.894736842105, + 454, + 623.0175438596489 + ], + "spans": [], + "index": 48 + }, + { + "bbox": [ + 156, + 623.0175438596489, + 454, + 634.1403508771928 + ], + "spans": [], + "index": 49 + }, + { + "bbox": [ + 156, + 634.1403508771928, + 454, + 645.2631578947367 + ], + "spans": [], + "index": 50 + }, + { + "bbox": [ + 156, + 645.2631578947367, + 454, + 656.3859649122805 + ], + "spans": [], + "index": 51 + }, + { + "bbox": [ + 156, + 656.3859649122805, + 454, + 667.5087719298244 + ], + "spans": [], + "index": 52 + }, + { + "bbox": [ + 156, + 667.5087719298244, + 454, + 678.6315789473683 + ], + "spans": [], + "index": 53 + }, + { + "bbox": [ + 156, + 678.6315789473683, + 454, + 689.7543859649122 + ], + "spans": [], + "index": 54 + }, + { + "bbox": [ + 156, + 689.7543859649122, + 454, + 700.8771929824561 + ], + "spans": [], + "index": 55 + }, + { + "bbox": [ + 156, + 700.8771929824561, + 454, + 712.0 + ], + "spans": [], + "index": 56 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 221, + 719, + 391, + 728 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 220, + 718, + 391, + 729 + ], + "spans": [ + { + "bbox": [ + 220, + 718, + 391, + 729 + ], + "score": 1.0, + "content": "Table 5: Deep ensemble equivalent score for CIFAR-10/100.", + "type": "text" + } + ], + "index": 57 + } + ], + "index": 57 + } + ], + "index": 42.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 109, + 80, + 502, + 159 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 109, + 80, + 502, + 159 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 80, + 502, + 159 + ], + "spans": [ + { + "bbox": [ + 109, + 80, + 502, + 159 + ], + "score": 0.978, + "html": "
Error (%)Negative calibrated log-likelihood
ModelMethod151050151050
Fast Geometric Ens.23.71±0.0023.61±0.0023.56±0.0023.28±0.000.929±0.0000.921±0.0000.916±0.0000.904±0.000
Deep Ensembles23.79±0.1421.19±0.14 20.90±0.08 20.63±NA0.935±0.007 0.823±0.002 0.805±0.0000.788±NA
ResNet50 Single model23.86±0.2023.86±0.2023.86±0.2023.86±0.200.938±0.0060.938±0.006:0.938±0.0060.938±0.006
Variational Inf.(FFG)24.50±0.06 23.82±0.03223.77±0.04 23.67±0.000.957±0.0010.927±0.0000.923±0.0010.920±0.000
KFAC-Laplace25.01±0.4924.19±0.2923.93±0.2023.86±0.160.988±0.0220.948±0.0130.939±0.0110.934±0.008
Snapshot Ensembles24.92±NA22.21±NA21.75±NA21.48±NA0.983±NA0.865±NA0.843±NA0.830±NA
", + "type": "table", + "image_path": "dd08cc8919404c8521c907c23aa73ed43d249d5e9805df9552f3337025dcc5a3.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 80, + 502, + 106.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 106.33333333333333, + 502, + 132.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 132.66666666666666, + 502, + 159.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 144, + 167, + 465, + 176 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 145, + 166, + 466, + 178 + ], + "spans": [ + { + "bbox": [ + 145, + 166, + 466, + 178 + ], + "score": 1.0, + "content": "Table 6: Classification error and negative calibrated log-likelihood for different numbers of samples on ImageNet.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "table", + "bbox": [ + 110, + 193, + 502, + 268 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 110, + 193, + 502, + 268 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 110, + 193, + 502, + 268 + ], + "spans": [ + { + "bbox": [ + 110, + 193, + 502, + 268 + ], + "score": 0.973, + "html": "
Error (%)Negative calibrated log-likelihood
ModelMethod5105051050
Fast Geometric Ens.23.61 vs 22.2123.56 vs 21.3723.28 vs 20.670.921 vs 0.8940.916 vs 0.8420.904 vs 0.793
Deep Ensembles21.19 vs 21.2020.90 vs 20.1620.63 vs 19.390.823 vs 0.855个0.805 vs 0.7930.788 vs 0.739
ResNet50 Single model23.86 vs 22.3923.86 vs 21.6023.86 vs 21.060.938 vs 0.9000.938 vs 0.8510.938 vs 0.805
Variational Inf. (FFG)23.82 vs 22.5823.77 vs 21.7423.67 vs 21.100.927 vs 0.9050.923 vs 0.8510.920 vs 0.805
KFAC-Laplace24.19 vs 22.5023.93 vs 21.6723.86 vs 21.040.948 vs 0.9060.939 vs 0.8550.934 vs 0.809
Snapshot Ensembles22.21 vs 21.9921.75 vs 20.8121.48 vs 19.860.865 vs 0.879个0.843 vs 0.8150.830 vs 0.763
", + "type": "table", + "image_path": "ee33806917cc00e9cc730edf40acf6c59f3c578fd8ec9f64061c2594fe50bb88.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 110, + 193, + 502, + 218.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 110, + 218.0, + 502, + 243.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 110, + 243.0, + 502, + 268.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 137, + 276, + 473, + 285 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 137, + 275, + 474, + 287 + ], + "spans": [ + { + "bbox": [ + 137, + 275, + 474, + 287 + ], + "score": 1.0, + "content": "Table 7: Classification error and negative calibrated log-likelihood before vs. after test-time augmentation on ImageNet.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + } + ], + "index": 6.0 + }, + { + "type": "table", + "bbox": [ + 148, + 302, + 463, + 392 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 148, + 302, + 463, + 392 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 148, + 302, + 463, + 392 + ], + "spans": [ + { + "bbox": [ + 148, + 302, + 463, + 392 + ], + "score": 0.982, + "html": "
Deep ensemble equivalent score
ModelMethod1 sample 5 samples 10 samples 25 samples 50 samples
Deep Ensembles1.05.010.025.050.0
Snapshot Ensembles1.02.23.24.04.2
ResNet50 Fast Geometric Ens.1.11.21.31.41.5
Variational Inf. (FFG)1.01.11.21.21.2
KFAC-Laplace1.01.01.01.01.0
Single model1.01.01.01.01.0
", + "type": "table", + "image_path": "b377037602b4810ea333cb6e7a3a37cbbca4ce25cb1d37def4fbebbf5817ba63.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 148, + 302, + 463, + 332.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 148, + 332.0, + 463, + 362.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 148, + 362.0, + 463, + 392.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 227, + 400, + 383, + 408 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 226, + 399, + 384, + 410 + ], + "spans": [ + { + "bbox": [ + 226, + 399, + 384, + 410 + ], + "score": 1.0, + "content": "Table 8: Deep ensemble equivalent score for ImageNet.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + } + ], + "index": 10.0 + } + ], + "page_idx": 27, + "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": [ + 300, + 752, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 13, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 109, + 80, + 502, + 159 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 109, + 80, + 502, + 159 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 80, + 502, + 159 + ], + "spans": [ + { + "bbox": [ + 109, + 80, + 502, + 159 + ], + "score": 0.978, + "html": "
Error (%)Negative calibrated log-likelihood
ModelMethod151050151050
Fast Geometric Ens.23.71±0.0023.61±0.0023.56±0.0023.28±0.000.929±0.0000.921±0.0000.916±0.0000.904±0.000
Deep Ensembles23.79±0.1421.19±0.14 20.90±0.08 20.63±NA0.935±0.007 0.823±0.002 0.805±0.0000.788±NA
ResNet50 Single model23.86±0.2023.86±0.2023.86±0.2023.86±0.200.938±0.0060.938±0.006:0.938±0.0060.938±0.006
Variational Inf.(FFG)24.50±0.06 23.82±0.03223.77±0.04 23.67±0.000.957±0.0010.927±0.0000.923±0.0010.920±0.000
KFAC-Laplace25.01±0.4924.19±0.2923.93±0.2023.86±0.160.988±0.0220.948±0.0130.939±0.0110.934±0.008
Snapshot Ensembles24.92±NA22.21±NA21.75±NA21.48±NA0.983±NA0.865±NA0.843±NA0.830±NA
", + "type": "table", + "image_path": "dd08cc8919404c8521c907c23aa73ed43d249d5e9805df9552f3337025dcc5a3.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 80, + 502, + 106.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 106.33333333333333, + 502, + 132.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 132.66666666666666, + 502, + 159.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 144, + 167, + 465, + 176 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 145, + 166, + 466, + 178 + ], + "spans": [ + { + "bbox": [ + 145, + 166, + 466, + 178 + ], + "score": 1.0, + "content": "Table 6: Classification error and negative calibrated log-likelihood for different numbers of samples on ImageNet.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "table", + "bbox": [ + 110, + 193, + 502, + 268 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 110, + 193, + 502, + 268 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 110, + 193, + 502, + 268 + ], + "spans": [ + { + "bbox": [ + 110, + 193, + 502, + 268 + ], + "score": 0.973, + "html": "
Error (%)Negative calibrated log-likelihood
ModelMethod5105051050
Fast Geometric Ens.23.61 vs 22.2123.56 vs 21.3723.28 vs 20.670.921 vs 0.8940.916 vs 0.8420.904 vs 0.793
Deep Ensembles21.19 vs 21.2020.90 vs 20.1620.63 vs 19.390.823 vs 0.855个0.805 vs 0.7930.788 vs 0.739
ResNet50 Single model23.86 vs 22.3923.86 vs 21.6023.86 vs 21.060.938 vs 0.9000.938 vs 0.8510.938 vs 0.805
Variational Inf. (FFG)23.82 vs 22.5823.77 vs 21.7423.67 vs 21.100.927 vs 0.9050.923 vs 0.8510.920 vs 0.805
KFAC-Laplace24.19 vs 22.5023.93 vs 21.6723.86 vs 21.040.948 vs 0.9060.939 vs 0.8550.934 vs 0.809
Snapshot Ensembles22.21 vs 21.9921.75 vs 20.8121.48 vs 19.860.865 vs 0.879个0.843 vs 0.8150.830 vs 0.763
", + "type": "table", + "image_path": "ee33806917cc00e9cc730edf40acf6c59f3c578fd8ec9f64061c2594fe50bb88.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 110, + 193, + 502, + 218.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 110, + 218.0, + 502, + 243.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 110, + 243.0, + 502, + 268.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 137, + 276, + 473, + 285 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 137, + 275, + 474, + 287 + ], + "spans": [ + { + "bbox": [ + 137, + 275, + 474, + 287 + ], + "score": 1.0, + "content": "Table 7: Classification error and negative calibrated log-likelihood before vs. after test-time augmentation on ImageNet.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + } + ], + "index": 6.0 + }, + { + "type": "table", + "bbox": [ + 148, + 302, + 463, + 392 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 148, + 302, + 463, + 392 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 148, + 302, + 463, + 392 + ], + "spans": [ + { + "bbox": [ + 148, + 302, + 463, + 392 + ], + "score": 0.982, + "html": "
Deep ensemble equivalent score
ModelMethod1 sample 5 samples 10 samples 25 samples 50 samples
Deep Ensembles1.05.010.025.050.0
Snapshot Ensembles1.02.23.24.04.2
ResNet50 Fast Geometric Ens.1.11.21.31.41.5
Variational Inf. (FFG)1.01.11.21.21.2
KFAC-Laplace1.01.01.01.01.0
Single model1.01.01.01.01.0
", + "type": "table", + "image_path": "b377037602b4810ea333cb6e7a3a37cbbca4ce25cb1d37def4fbebbf5817ba63.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 148, + 302, + 463, + 332.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 148, + 332.0, + 463, + 362.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 148, + 362.0, + 463, + 392.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 227, + 400, + 383, + 408 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 226, + 399, + 384, + 410 + ], + "spans": [ + { + "bbox": [ + 226, + 399, + 384, + 410 + ], + "score": 1.0, + "content": "Table 8: Deep ensemble equivalent score for ImageNet.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + } + ], + "index": 10.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 113, + 88, + 497, + 716 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 113, + 88, + 497, + 716 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 88, + 497, + 716 + ], + "spans": [ + { + "bbox": [ + 113, + 88, + 497, + 716 + ], + "score": 0.965, + "type": "image", + "image_path": "06c0a02f97dac8847cb6e77106788659571be54f7441eec252ec711954a27069.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 113, + 88, + 497, + 297.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 113, + 297.33333333333337, + 497, + 506.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 113, + 506.66666666666674, + 497, + 716.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 723, + 499, + 745 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 721, + 502, + 738 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 502, + 738 + ], + "score": 1.0, + "content": "Figure 14: Classification error and negative calibrated log-likelihood before vs. after test-time aug", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 735, + 206, + 745 + ], + "spans": [ + { + "bbox": [ + 106, + 735, + 206, + 745 + ], + "score": 1.0, + "content": "mentation on CIFAR-10", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 28, + "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": [ + 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": [ + 113, + 88, + 497, + 716 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 113, + 88, + 497, + 716 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 88, + 497, + 716 + ], + "spans": [ + { + "bbox": [ + 113, + 88, + 497, + 716 + ], + "score": 0.965, + "type": "image", + "image_path": "06c0a02f97dac8847cb6e77106788659571be54f7441eec252ec711954a27069.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 113, + 88, + 497, + 297.33333333333337 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 113, + 297.33333333333337, + 497, + 506.66666666666674 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 113, + 506.66666666666674, + 497, + 716.0000000000001 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 723, + 499, + 745 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 721, + 502, + 738 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 502, + 738 + ], + "score": 1.0, + "content": "Figure 14: Classification error and negative calibrated log-likelihood before vs. after test-time aug", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 735, + 206, + 745 + ], + "spans": [ + { + "bbox": [ + 106, + 735, + 206, + 745 + ], + "score": 1.0, + "content": "mentation on CIFAR-10", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 112, + 89, + 497, + 716 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 112, + 89, + 497, + 716 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 112, + 89, + 497, + 716 + ], + "spans": [ + { + "bbox": [ + 112, + 89, + 497, + 716 + ], + "score": 0.966, + "type": "image", + "image_path": "972ed43a1c92f0c8398f5c3ca02ab2e95164ce635709284ce67e4c2b485dddf1.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 112, + 89, + 497, + 298.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 112, + 298.0, + 497, + 507.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 112, + 507.0, + 497, + 716.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 723, + 499, + 745 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 721, + 502, + 738 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 502, + 738 + ], + "score": 1.0, + "content": "Figure 15: Classification error and negative calibrated log-likelihood before vs. after test-time aug", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 735, + 210, + 745 + ], + "spans": [ + { + "bbox": [ + 106, + 735, + 210, + 745 + ], + "score": 1.0, + "content": "mentation on CIFAR-100", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + } + ], + "page_idx": 29, + "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": [ + 298, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "30", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 112, + 89, + 497, + 716 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 112, + 89, + 497, + 716 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 112, + 89, + 497, + 716 + ], + "spans": [ + { + "bbox": [ + 112, + 89, + 497, + 716 + ], + "score": 0.966, + "type": "image", + "image_path": "972ed43a1c92f0c8398f5c3ca02ab2e95164ce635709284ce67e4c2b485dddf1.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 112, + 89, + 497, + 298.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 112, + 298.0, + 497, + 507.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 112, + 507.0, + 497, + 716.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 723, + 499, + 745 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 721, + 502, + 738 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 502, + 738 + ], + "score": 1.0, + "content": "Figure 15: Classification error and negative calibrated log-likelihood before vs. after test-time aug", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 735, + 210, + 745 + ], + "spans": [ + { + "bbox": [ + 106, + 735, + 210, + 745 + ], + "score": 1.0, + "content": "mentation on CIFAR-100", + "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/BJxI5gHKDr/BJxI5gHKDr_model.json b/parse/train/BJxI5gHKDr/BJxI5gHKDr_model.json new file mode 100644 index 0000000000000000000000000000000000000000..0c095b994cf07a51908126a51945ef0e5fa73067 --- /dev/null +++ b/parse/train/BJxI5gHKDr/BJxI5gHKDr_model.json @@ -0,0 +1,50022 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 762, + 1302, + 762, + 1302, + 1067, + 398, + 1067 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1445, + 1404, + 1445, + 1404, + 1750, + 298, + 1750 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 1766, + 1401, + 1766, + 1401, + 1919, + 299, + 1919 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1276, + 1403, + 1276, + 1403, + 1429, + 298, + 1429 + ], + "score": 0.975 + }, + { + "category_id": 0, + "poly": [ + 300, + 219, + 1400, + 219, + 1400, + 323, + 300, + 323 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 304, + 376, + 704, + 376, + 704, + 471, + 304, + 471 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 304, + 517, + 703, + 517, + 703, + 611, + 304, + 611 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 884, + 376, + 1394, + 376, + 1394, + 471, + 884, + 471 + ], + "score": 0.95 + }, + { + "category_id": 2, + "poly": [ + 329, + 1943, + 1353, + 1943, + 1353, + 2034, + 329, + 2034 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 890, + 518, + 1281, + 518, + 1281, + 611, + 890, + 611 + ], + "score": 0.943 + }, + { + "category_id": 0, + "poly": [ + 302, + 1206, + 573, + 1206, + 573, + 1241, + 302, + 1241 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 817, + 75, + 817, + 104, + 299, + 104 + ], + "score": 0.873 + }, + { + "category_id": 0, + "poly": [ + 773, + 693, + 927, + 693, + 927, + 726, + 773, + 726 + ], + "score": 0.86 + }, + { + "category_id": 0, + "poly": [ + 673, + 1115, + 1053, + 1115, + 1053, + 1145, + 673, + 1145 + ], + "score": 0.854 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 857, + 2088, + 857, + 2112, + 842, + 2112 + ], + "score": 0.685 + }, + { + "category_id": 15, + "poly": [ + 294.0, + 215.0, + 1405.0, + 215.0, + 1405.0, + 274.0, + 294.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 275.0, + 1096.0, + 275.0, + 1096.0, + 327.0, + 296.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1941.0, + 1293.0, + 1941.0, + 1293.0, + 1977.0, + 329.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1969.0, + 987.0, + 1969.0, + 987.0, + 2009.0, + 331.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1999.0, + 1355.0, + 1999.0, + 1355.0, + 2039.0, + 326.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1203.0, + 579.0, + 1203.0, + 579.0, + 1250.0, + 294.0, + 1250.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": [ + 768.0, + 689.0, + 934.0, + 689.0, + 934.0, + 732.0, + 768.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1112.0, + 1059.0, + 1112.0, + 1059.0, + 1149.0, + 667.0, + 1149.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": [ + 395.0, + 762.0, + 1303.0, + 762.0, + 1303.0, + 798.0, + 395.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 794.0, + 1304.0, + 794.0, + 1304.0, + 827.0, + 395.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 824.0, + 1305.0, + 824.0, + 1305.0, + 856.0, + 393.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 854.0, + 1303.0, + 854.0, + 1303.0, + 889.0, + 393.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 885.0, + 1306.0, + 885.0, + 1306.0, + 917.0, + 393.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 918.0, + 1306.0, + 918.0, + 1306.0, + 948.0, + 393.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 947.0, + 1304.0, + 947.0, + 1304.0, + 980.0, + 394.0, + 980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 977.0, + 1305.0, + 977.0, + 1305.0, + 1012.0, + 394.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1008.0, + 1304.0, + 1008.0, + 1304.0, + 1041.0, + 395.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1037.0, + 1078.0, + 1037.0, + 1078.0, + 1072.0, + 394.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1444.0, + 1404.0, + 1444.0, + 1404.0, + 1479.0, + 295.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1473.0, + 1405.0, + 1473.0, + 1405.0, + 1510.0, + 293.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1508.0, + 1405.0, + 1508.0, + 1405.0, + 1539.0, + 296.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1533.0, + 1406.0, + 1533.0, + 1406.0, + 1575.0, + 292.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1567.0, + 1406.0, + 1567.0, + 1406.0, + 1603.0, + 294.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1599.0, + 1405.0, + 1599.0, + 1405.0, + 1630.0, + 296.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1625.0, + 1406.0, + 1625.0, + 1406.0, + 1662.0, + 293.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1660.0, + 1404.0, + 1660.0, + 1404.0, + 1691.0, + 296.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1687.0, + 1406.0, + 1687.0, + 1406.0, + 1724.0, + 292.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1722.0, + 543.0, + 1722.0, + 543.0, + 1753.0, + 294.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1765.0, + 1403.0, + 1765.0, + 1403.0, + 1800.0, + 294.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1795.0, + 1405.0, + 1795.0, + 1405.0, + 1831.0, + 294.0, + 1831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1828.0, + 1403.0, + 1828.0, + 1403.0, + 1861.0, + 295.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1857.0, + 1406.0, + 1857.0, + 1406.0, + 1893.0, + 294.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1887.0, + 1406.0, + 1887.0, + 1406.0, + 1923.0, + 290.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1275.0, + 1405.0, + 1275.0, + 1405.0, + 1313.0, + 293.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1305.0, + 1404.0, + 1305.0, + 1404.0, + 1341.0, + 294.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1337.0, + 1407.0, + 1337.0, + 1407.0, + 1372.0, + 292.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1366.0, + 1408.0, + 1366.0, + 1408.0, + 1404.0, + 292.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1399.0, + 856.0, + 1399.0, + 856.0, + 1432.0, + 296.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 376.0, + 527.0, + 376.0, + 527.0, + 406.0, + 303.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 410.0, + 704.0, + 410.0, + 704.0, + 441.0, + 302.0, + 441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 441.0, + 675.0, + 441.0, + 675.0, + 474.0, + 303.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 517.0, + 555.0, + 517.0, + 555.0, + 549.0, + 301.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 551.0, + 704.0, + 551.0, + 704.0, + 582.0, + 303.0, + 582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 580.0, + 642.0, + 580.0, + 642.0, + 617.0, + 304.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 376.0, + 1127.0, + 376.0, + 1127.0, + 408.0, + 882.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 409.0, + 1394.0, + 409.0, + 1394.0, + 440.0, + 881.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 440.0, + 1239.0, + 440.0, + 1239.0, + 474.0, + 883.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 513.0, + 1069.0, + 513.0, + 1069.0, + 552.0, + 888.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 546.0, + 1283.0, + 546.0, + 1283.0, + 586.0, + 888.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 580.0, + 1244.0, + 580.0, + 1244.0, + 615.0, + 890.0, + 615.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1508, + 1403, + 1508, + 1403, + 1692, + 299, + 1692 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 307, + 1403, + 307, + 1403, + 553, + 298, + 553 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 801, + 1404, + 801, + 1404, + 986, + 298, + 986 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 569, + 1403, + 569, + 1403, + 690, + 299, + 690 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1278, + 1403, + 1278, + 1403, + 1493, + 298, + 1493 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1880, + 1402, + 1880, + 1402, + 2033, + 299, + 2033 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1002, + 1402, + 1002, + 1402, + 1124, + 299, + 1124 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1140, + 1403, + 1140, + 1403, + 1263, + 298, + 1263 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1400, + 229, + 1400, + 292, + 299, + 292 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 300, + 1707, + 1401, + 1707, + 1401, + 1769, + 300, + 1769 + ], + "score": 0.946 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 816, + 76, + 816, + 104, + 300, + 104 + ], + "score": 0.895 + }, + { + "category_id": 0, + "poly": [ + 301, + 735, + 653, + 735, + 653, + 769, + 301, + 769 + ], + "score": 0.895 + }, + { + "category_id": 0, + "poly": [ + 300, + 1815, + 1100, + 1815, + 1100, + 1847, + 300, + 1847 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.693 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.156 + }, + { + "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": [ + 291.0, + 729.0, + 659.0, + 729.0, + 659.0, + 775.0, + 291.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1809.0, + 1105.0, + 1809.0, + 1105.0, + 1854.0, + 290.0, + 1854.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": [ + 295.0, + 1507.0, + 1403.0, + 1507.0, + 1403.0, + 1543.0, + 295.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1537.0, + 1405.0, + 1537.0, + 1405.0, + 1573.0, + 294.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1566.0, + 1407.0, + 1566.0, + 1407.0, + 1608.0, + 292.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1599.0, + 1405.0, + 1599.0, + 1405.0, + 1634.0, + 295.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1630.0, + 1407.0, + 1630.0, + 1407.0, + 1666.0, + 295.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1661.0, + 899.0, + 1661.0, + 899.0, + 1695.0, + 293.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 309.0, + 1403.0, + 309.0, + 1403.0, + 342.0, + 294.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 337.0, + 1405.0, + 337.0, + 1405.0, + 372.0, + 293.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 369.0, + 1405.0, + 369.0, + 1405.0, + 402.0, + 296.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 400.0, + 1404.0, + 400.0, + 1404.0, + 434.0, + 294.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 426.0, + 1407.0, + 426.0, + 1407.0, + 465.0, + 292.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 459.0, + 1404.0, + 459.0, + 1404.0, + 497.0, + 293.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 492.0, + 1405.0, + 492.0, + 1405.0, + 525.0, + 293.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 523.0, + 945.0, + 523.0, + 945.0, + 555.0, + 293.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 798.0, + 1405.0, + 798.0, + 1405.0, + 839.0, + 295.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 835.0, + 1405.0, + 835.0, + 1405.0, + 867.0, + 294.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 863.0, + 1406.0, + 863.0, + 1406.0, + 899.0, + 294.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 888.0, + 1405.0, + 888.0, + 1405.0, + 932.0, + 292.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 920.0, + 1406.0, + 920.0, + 1406.0, + 965.0, + 292.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 955.0, + 767.0, + 955.0, + 767.0, + 986.0, + 297.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 570.0, + 1404.0, + 570.0, + 1404.0, + 602.0, + 295.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 600.0, + 1404.0, + 600.0, + 1404.0, + 635.0, + 293.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 629.0, + 1404.0, + 629.0, + 1404.0, + 665.0, + 294.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 661.0, + 902.0, + 661.0, + 902.0, + 696.0, + 294.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1278.0, + 1405.0, + 1278.0, + 1405.0, + 1313.0, + 296.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1308.0, + 1404.0, + 1308.0, + 1404.0, + 1345.0, + 293.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1337.0, + 1404.0, + 1337.0, + 1404.0, + 1376.0, + 293.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1368.0, + 1404.0, + 1368.0, + 1404.0, + 1406.0, + 293.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1399.0, + 1404.0, + 1399.0, + 1404.0, + 1436.0, + 293.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1431.0, + 1404.0, + 1431.0, + 1404.0, + 1465.0, + 294.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1461.0, + 1398.0, + 1461.0, + 1398.0, + 1497.0, + 293.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1879.0, + 1403.0, + 1879.0, + 1403.0, + 1917.0, + 294.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1909.0, + 1404.0, + 1909.0, + 1404.0, + 1949.0, + 293.0, + 1949.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": [ + 293.0, + 1968.0, + 1407.0, + 1968.0, + 1407.0, + 2011.0, + 293.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2000.0, + 1406.0, + 2000.0, + 1406.0, + 2038.0, + 292.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1001.0, + 1406.0, + 1001.0, + 1406.0, + 1036.0, + 295.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1033.0, + 1404.0, + 1033.0, + 1404.0, + 1065.0, + 295.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1062.0, + 1406.0, + 1062.0, + 1406.0, + 1097.0, + 292.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1093.0, + 444.0, + 1093.0, + 444.0, + 1127.0, + 294.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1139.0, + 1405.0, + 1139.0, + 1405.0, + 1174.0, + 294.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1171.0, + 1405.0, + 1171.0, + 1405.0, + 1204.0, + 294.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1202.0, + 1405.0, + 1202.0, + 1405.0, + 1237.0, + 293.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1234.0, + 712.0, + 1234.0, + 712.0, + 1267.0, + 294.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1405.0, + 229.0, + 1405.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 262.0, + 728.0, + 262.0, + 728.0, + 294.0, + 295.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1701.0, + 1405.0, + 1701.0, + 1405.0, + 1746.0, + 294.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1739.0, + 835.0, + 1739.0, + 835.0, + 1772.0, + 294.0, + 1772.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1127, + 1404, + 1127, + 1404, + 1375, + 297, + 1375 + ], + "score": 0.978 + }, + { + "category_id": 4, + "poly": [ + 297, + 624, + 840, + 624, + 840, + 899, + 297, + 899 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1589, + 1403, + 1589, + 1403, + 1744, + 298, + 1744 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1759, + 1405, + 1759, + 1405, + 1852, + 298, + 1852 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 1479, + 1403, + 1479, + 1403, + 1574, + 299, + 1574 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 298, + 991, + 1405, + 991, + 1405, + 1084, + 298, + 1084 + ], + "score": 0.969 + }, + { + "category_id": 4, + "poly": [ + 858, + 626, + 1404, + 626, + 1404, + 839, + 858, + 839 + ], + "score": 0.968 + }, + { + "category_id": 3, + "poly": [ + 300, + 245, + 832, + 245, + 832, + 595, + 300, + 595 + ], + "score": 0.966 + }, + { + "category_id": 3, + "poly": [ + 858, + 237, + 1365, + 237, + 1365, + 591, + 858, + 591 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 301, + 1971, + 1401, + 1971, + 1401, + 2034, + 301, + 2034 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 362, + 1890, + 1332, + 1890, + 1332, + 1924, + 362, + 1924 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 815, + 76, + 815, + 104, + 299, + 104 + ], + "score": 0.891 + }, + { + "category_id": 0, + "poly": [ + 300, + 1421, + 807, + 1421, + 807, + 1452, + 300, + 1452 + ], + "score": 0.646 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 858, + 2088, + 858, + 2111, + 842, + 2111 + ], + "score": 0.602 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 859, + 2088, + 859, + 2111, + 842, + 2111 + ], + "score": 0.368 + }, + { + "category_id": 1, + "poly": [ + 300, + 1421, + 807, + 1421, + 807, + 1452, + 300, + 1452 + ], + "score": 0.258 + }, + { + "category_id": 13, + "poly": [ + 1122, + 1190, + 1216, + 1190, + 1216, + 1223, + 1122, + 1223 + ], + "score": 0.95, + "latex": "{ \\dot { p } } ( y \\mid x _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 944, + 1160, + 1133, + 1160, + 1133, + 1192, + 944, + 1192 + ], + "score": 0.93, + "latex": "y _ { i } ^ { * } \\in \\{ 1 , \\ldots , C \\}" + }, + { + "category_id": 13, + "poly": [ + 441, + 1159, + 644, + 1159, + 644, + 1193, + 441, + 1193 + ], + "score": 0.92, + "latex": "( x _ { i } , y _ { i } ^ { * } ) \\sim p ( x , y )" + }, + { + "category_id": 13, + "poly": [ + 1286, + 1220, + 1405, + 1220, + 1405, + 1254, + 1286, + 1254 + ], + "score": 0.92, + "latex": "{ \\hat { p } } ( y \\mid x ) =" + }, + { + "category_id": 13, + "poly": [ + 650, + 1479, + 1021, + 1479, + 1021, + 1518, + 650, + 1518 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\mathbf { L } \\mathbf { L } = \\frac { 1 } { n } \\sum _ { i = 1 } ^ { n } \\log \\hat { p } ( y = y _ { i } ^ { * } \\mid x _ { i } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 431, + 1220, + 525, + 1220, + 525, + 1253, + 431, + 1253 + ], + "score": 0.92, + "latex": "{ \\hat { p } } ( y \\mid x _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 598, + 1251, + 653, + 1251, + 653, + 1283, + 598, + 1283 + ], + "score": 0.91, + "latex": "z ( x )" + }, + { + "category_id": 13, + "poly": [ + 329, + 1790, + 412, + 1790, + 412, + 1818, + 329, + 1818 + ], + "score": 0.9, + "latex": "T = 1" + }, + { + "category_id": 13, + "poly": [ + 1038, + 1311, + 1256, + 1311, + 1256, + 1345, + 1038, + 1345 + ], + "score": 0.9, + "latex": "\\operatorname* { m a x } _ { c } \\dot { \\hat { p } } ( y = c | x _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 1199, + 1282, + 1275, + 1282, + 1275, + 1309, + 1199, + 1309 + ], + "score": 0.9, + "latex": "T = 1" + }, + { + "category_id": 13, + "poly": [ + 1307, + 1545, + 1336, + 1545, + 1336, + 1577, + 1307, + 1577 + ], + "score": 0.88, + "latex": "y _ { i } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 760, + 1194, + 788, + 1194, + 788, + 1221, + 760, + 1221 + ], + "score": 0.87, + "latex": "x _ { i }" + }, + { + "category_id": 13, + "poly": [ + 730, + 1163, + 758, + 1163, + 758, + 1190, + 730, + 1190 + ], + "score": 0.85, + "latex": "x _ { i }" + }, + { + "category_id": 13, + "poly": [ + 578, + 1344, + 597, + 1344, + 597, + 1374, + 578, + 1374 + ], + "score": 0.85, + "latex": "\\hat { p }" + }, + { + "category_id": 13, + "poly": [ + 1201, + 1131, + 1230, + 1131, + 1230, + 1157, + 1201, + 1157 + ], + "score": 0.83, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 943, + 1252, + 967, + 1252, + 967, + 1278, + 943, + 1278 + ], + "score": 0.79, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1047, + 2004, + 1070, + 2004, + 1070, + 2030, + 1047, + 2030 + ], + "score": 0.78, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 794, + 1592, + 818, + 1592, + 818, + 1618, + 794, + 1618 + ], + "score": 0.76, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 741, + 1346, + 770, + 1346, + 770, + 1373, + 741, + 1373 + ], + "score": 0.73, + "latex": "x _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1381, + 1136, + 1401, + 1136, + 1401, + 1157, + 1381, + 1157 + ], + "score": 0.71, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 298, + 1251, + 506, + 1251, + 506, + 1284, + 298, + 1284 + ], + "score": 0.6, + "latex": "\\mathrm { S o f t m a x } ( z ( x ) / T )" + }, + { + "category_id": 13, + "poly": [ + 781, + 1342, + 819, + 1342, + 819, + 1375, + 781, + 1375 + ], + "score": 0.31, + "latex": "\\mathbb { I } [ \\cdot ]" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 623.0, + 844.0, + 623.0, + 844.0, + 657.0, + 296.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 653.0, + 843.0, + 653.0, + 843.0, + 687.0, + 296.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 685.0, + 844.0, + 685.0, + 844.0, + 719.0, + 295.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 716.0, + 843.0, + 716.0, + 843.0, + 749.0, + 295.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 746.0, + 844.0, + 746.0, + 844.0, + 779.0, + 292.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 776.0, + 843.0, + 776.0, + 843.0, + 809.0, + 294.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 804.0, + 843.0, + 804.0, + 843.0, + 840.0, + 293.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 833.0, + 844.0, + 833.0, + 844.0, + 874.0, + 293.0, + 874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 868.0, + 798.0, + 868.0, + 798.0, + 901.0, + 295.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 626.0, + 1406.0, + 626.0, + 1406.0, + 659.0, + 856.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 656.0, + 1403.0, + 656.0, + 1403.0, + 687.0, + 856.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 686.0, + 1403.0, + 686.0, + 1403.0, + 718.0, + 855.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 716.0, + 1405.0, + 716.0, + 1405.0, + 751.0, + 854.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 745.0, + 1404.0, + 745.0, + 1404.0, + 778.0, + 855.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 775.0, + 1404.0, + 775.0, + 1404.0, + 812.0, + 855.0, + 812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 809.0, + 1052.0, + 809.0, + 1052.0, + 842.0, + 856.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 248.0, + 381.0, + 248.0, + 381.0, + 274.0, + 345.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 258.0, + 353.0, + 258.0, + 353.0, + 552.0, + 315.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 292.0, + 381.0, + 292.0, + 381.0, + 318.0, + 345.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 298.0, + 650.0, + 298.0, + 650.0, + 313.0, + 623.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 315.0, + 326.0, + 315.0, + 326.0, + 489.0, + 297.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 337.0, + 382.0, + 337.0, + 382.0, + 363.0, + 343.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 382.0, + 382.0, + 382.0, + 382.0, + 407.0, + 344.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 425.0, + 380.0, + 425.0, + 380.0, + 451.0, + 346.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 471.0, + 380.0, + 471.0, + 380.0, + 494.0, + 348.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 473.0, + 821.0, + 473.0, + 821.0, + 499.0, + 696.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 493.0, + 822.0, + 493.0, + 822.0, + 522.0, + 697.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 520.0, + 377.0, + 520.0, + 377.0, + 536.0, + 353.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 510.0, + 823.0, + 510.0, + 823.0, + 544.0, + 700.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 558.0, + 401.0, + 558.0, + 401.0, + 571.0, + 389.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 555.0, + 478.0, + 555.0, + 478.0, + 575.0, + 462.0, + 575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 555.0, + 578.0, + 555.0, + 578.0, + 574.0, + 562.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 552.0, + 659.0, + 552.0, + 659.0, + 576.0, + 632.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 552.0, + 758.0, + 552.0, + 758.0, + 576.0, + 730.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 552.0, + 833.0, + 552.0, + 833.0, + 577.0, + 806.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 568.0, + 722.0, + 568.0, + 722.0, + 599.0, + 488.0, + 599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 355.5, + 427.0, + 355.5, + 427.0, + 369.5, + 383.0, + 369.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 355.5, + 625.0, + 355.5, + 625.0, + 403.5, + 397.0, + 403.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 236.0, + 963.0, + 236.0, + 963.0, + 261.0, + 906.0, + 261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 244.0, + 914.0, + 244.0, + 914.0, + 273.0, + 874.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 306.0, + 912.0, + 306.0, + 912.0, + 333.0, + 875.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 313.0, + 1334.0, + 313.0, + 1334.0, + 338.0, + 1269.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 335.0, + 1345.0, + 335.0, + 1345.0, + 361.0, + 1268.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 361.0, + 962.0, + 361.0, + 962.0, + 368.0, + 954.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 357.0, + 1364.0, + 357.0, + 1364.0, + 387.0, + 1268.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 367.0, + 911.0, + 367.0, + 911.0, + 431.0, + 853.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 381.0, + 1361.0, + 381.0, + 1361.0, + 410.0, + 1269.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 427.0, + 911.0, + 427.0, + 911.0, + 455.0, + 875.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 427.0, + 1351.0, + 427.0, + 1351.0, + 457.0, + 1268.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 450.0, + 1341.0, + 450.0, + 1341.0, + 479.0, + 1268.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 473.0, + 1342.0, + 473.0, + 1342.0, + 504.0, + 1269.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 487.0, + 914.0, + 487.0, + 914.0, + 516.0, + 874.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 509.0, + 1202.0, + 509.0, + 1202.0, + 542.0, + 1154.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 546.0, + 1086.0, + 546.0, + 1086.0, + 572.0, + 1035.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 547.0, + 1219.0, + 547.0, + 1219.0, + 571.0, + 1170.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 566.0, + 1109.0, + 566.0, + 1109.0, + 595.0, + 1017.0, + 595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 307.0, + 949.0, + 307.0, + 949.0, + 321.0, + 925.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 328.0, + 980.0, + 328.0, + 980.0, + 344.0, + 947.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.25, + 545.0, + 955.25, + 545.0, + 955.25, + 574.0, + 898.25, + 574.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": [ + 295.0, + 1420.0, + 811.0, + 1420.0, + 811.0, + 1455.0, + 295.0, + 1455.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, + 2117.0, + 839.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1129.0, + 1200.0, + 1129.0, + 1200.0, + 1163.0, + 295.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 1129.0, + 1380.0, + 1129.0, + 1380.0, + 1163.0, + 1231.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1129.0, + 1405.0, + 1129.0, + 1405.0, + 1163.0, + 1402.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1158.0, + 440.0, + 1158.0, + 440.0, + 1195.0, + 292.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 1158.0, + 729.0, + 1158.0, + 729.0, + 1195.0, + 645.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 1158.0, + 943.0, + 1158.0, + 943.0, + 1195.0, + 759.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1158.0, + 1405.0, + 1158.0, + 1405.0, + 1195.0, + 1134.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1188.0, + 759.0, + 1188.0, + 759.0, + 1226.0, + 294.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1188.0, + 1121.0, + 1188.0, + 1121.0, + 1226.0, + 789.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1188.0, + 1405.0, + 1188.0, + 1405.0, + 1226.0, + 1217.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1217.0, + 430.0, + 1217.0, + 430.0, + 1257.0, + 292.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 1217.0, + 1285.0, + 1217.0, + 1285.0, + 1257.0, + 526.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1247.0, + 297.0, + 1247.0, + 297.0, + 1286.0, + 292.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 1247.0, + 597.0, + 1247.0, + 597.0, + 1286.0, + 507.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 1247.0, + 942.0, + 1247.0, + 942.0, + 1286.0, + 654.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 1247.0, + 1405.0, + 1247.0, + 1405.0, + 1286.0, + 968.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1281.0, + 1198.0, + 1281.0, + 1198.0, + 1315.0, + 294.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1281.0, + 1405.0, + 1281.0, + 1405.0, + 1315.0, + 1276.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1310.0, + 1037.0, + 1310.0, + 1037.0, + 1348.0, + 294.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1257.0, + 1310.0, + 1406.0, + 1310.0, + 1406.0, + 1348.0, + 1257.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1343.0, + 577.0, + 1343.0, + 577.0, + 1377.0, + 295.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 1343.0, + 740.0, + 1343.0, + 740.0, + 1377.0, + 598.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1343.0, + 780.0, + 1343.0, + 780.0, + 1377.0, + 771.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 1343.0, + 1384.0, + 1343.0, + 1384.0, + 1377.0, + 820.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1591.0, + 793.0, + 1591.0, + 793.0, + 1624.0, + 293.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 1591.0, + 1404.0, + 1591.0, + 1404.0, + 1624.0, + 819.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1621.0, + 1404.0, + 1621.0, + 1404.0, + 1655.0, + 296.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1651.0, + 1405.0, + 1651.0, + 1405.0, + 1688.0, + 293.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1678.0, + 1405.0, + 1678.0, + 1405.0, + 1721.0, + 292.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1710.0, + 783.0, + 1710.0, + 783.0, + 1750.0, + 292.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1756.0, + 1405.0, + 1756.0, + 1405.0, + 1795.0, + 293.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1790.0, + 328.0, + 1790.0, + 328.0, + 1824.0, + 295.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 1790.0, + 1403.0, + 1790.0, + 1403.0, + 1824.0, + 413.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1820.0, + 1229.0, + 1820.0, + 1229.0, + 1856.0, + 292.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1469.0, + 649.0, + 1469.0, + 649.0, + 1528.0, + 285.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 1469.0, + 1413.0, + 1469.0, + 1413.0, + 1528.0, + 1022.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1513.0, + 1402.0, + 1513.0, + 1402.0, + 1547.0, + 295.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1542.0, + 1306.0, + 1542.0, + 1306.0, + 1580.0, + 294.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1337.0, + 1542.0, + 1348.0, + 1542.0, + 1348.0, + 1580.0, + 1337.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 990.0, + 1405.0, + 990.0, + 1405.0, + 1025.0, + 292.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1024.0, + 1405.0, + 1024.0, + 1405.0, + 1058.0, + 293.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1053.0, + 445.0, + 1053.0, + 445.0, + 1085.0, + 296.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1968.0, + 1406.0, + 1968.0, + 1406.0, + 2010.0, + 295.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2003.0, + 1046.0, + 2003.0, + 1046.0, + 2038.0, + 296.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 2003.0, + 1405.0, + 2003.0, + 1405.0, + 2038.0, + 1071.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 1887.0, + 1336.0, + 1887.0, + 1336.0, + 1929.0, + 358.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1420.0, + 811.0, + 1420.0, + 811.0, + 1455.0, + 295.0, + 1455.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 443, + 1404, + 443, + 1404, + 658, + 298, + 658 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 915, + 1405, + 915, + 1405, + 1135, + 297, + 1135 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1470, + 1404, + 1470, + 1404, + 1685, + 298, + 1685 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1270, + 1404, + 1270, + 1404, + 1455, + 297, + 1455 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 750, + 1403, + 750, + 1403, + 903, + 298, + 903 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1819, + 1404, + 1819, + 1404, + 2034, + 297, + 2034 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 296, + 672, + 1401, + 672, + 1401, + 735, + 296, + 735 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 295, + 229, + 1399, + 229, + 1399, + 293, + 295, + 293 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 343, + 331, + 1364, + 331, + 1364, + 395, + 343, + 395 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 301, + 1202, + 754, + 1202, + 754, + 1233, + 301, + 1233 + ], + "score": 0.875 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.752 + }, + { + "category_id": 1, + "poly": [ + 541, + 1717, + 1154, + 1717, + 1154, + 1779, + 541, + 1779 + ], + "score": 0.644 + }, + { + "category_id": 13, + "poly": [ + 389, + 1423, + 522, + 1423, + 522, + 1458, + 389, + 1458 + ], + "score": 0.93, + "latex": "\\mathcal { H } [ \\bar { p } ( \\boldsymbol { y } | \\boldsymbol { x } _ { i } ) ]" + }, + { + "category_id": 13, + "poly": [ + 425, + 914, + 998, + 914, + 998, + 957, + 425, + 957 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathrm { { B S } } = \\frac { 1 } { n } \\frac { 1 } { C } \\sum _ { i = 1 } ^ { n } \\sum _ { c = 1 } ^ { C } ( \\mathbb { I } [ y _ { i } ^ { * } = c ] - \\hat { p } ( y = c | x _ { i } ) ) ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 538, + 783, + 653, + 783, + 653, + 814, + 538, + 814 + ], + "score": 0.86, + "latex": "( \\rho > 0 . 9 5 )" + }, + { + "category_id": 13, + "poly": [ + 916, + 753, + 1028, + 753, + 1028, + 784, + 916, + 784 + ], + "score": 0.86, + "latex": "( \\rho > 0 . 8 6 )" + }, + { + "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": [ + 295.0, + 1201.0, + 757.0, + 1201.0, + 757.0, + 1237.0, + 295.0, + 1237.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, + 445.0, + 1402.0, + 445.0, + 1402.0, + 479.0, + 296.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 475.0, + 1405.0, + 475.0, + 1405.0, + 509.0, + 294.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 504.0, + 1406.0, + 504.0, + 1406.0, + 541.0, + 292.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 535.0, + 1406.0, + 535.0, + 1406.0, + 571.0, + 292.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 564.0, + 1405.0, + 564.0, + 1405.0, + 602.0, + 293.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 596.0, + 1406.0, + 596.0, + 1406.0, + 633.0, + 292.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 627.0, + 1258.0, + 627.0, + 1258.0, + 662.0, + 293.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 282.0, + 900.0, + 424.0, + 900.0, + 424.0, + 975.0, + 282.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 900.0, + 1416.0, + 900.0, + 1416.0, + 975.0, + 999.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 950.0, + 1403.0, + 950.0, + 1403.0, + 985.0, + 292.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 976.0, + 1406.0, + 976.0, + 1406.0, + 1018.0, + 292.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1011.0, + 1403.0, + 1011.0, + 1403.0, + 1046.0, + 295.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1041.0, + 1403.0, + 1041.0, + 1403.0, + 1076.0, + 294.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1073.0, + 1405.0, + 1073.0, + 1405.0, + 1107.0, + 294.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1102.0, + 592.0, + 1102.0, + 592.0, + 1139.0, + 295.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.75, + 915.0, + 663.75, + 915.0, + 663.75, + 936.5, + 644.75, + 936.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1470.0, + 1404.0, + 1470.0, + 1404.0, + 1505.0, + 296.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1501.0, + 1404.0, + 1501.0, + 1404.0, + 1536.0, + 294.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1532.0, + 1405.0, + 1532.0, + 1405.0, + 1566.0, + 294.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1562.0, + 1405.0, + 1562.0, + 1405.0, + 1596.0, + 294.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1589.0, + 1405.0, + 1589.0, + 1405.0, + 1630.0, + 292.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1623.0, + 1405.0, + 1623.0, + 1405.0, + 1657.0, + 294.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1655.0, + 876.0, + 1655.0, + 876.0, + 1686.0, + 294.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1272.0, + 1401.0, + 1272.0, + 1401.0, + 1304.0, + 296.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1303.0, + 1405.0, + 1303.0, + 1405.0, + 1335.0, + 295.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1332.0, + 1406.0, + 1332.0, + 1406.0, + 1368.0, + 295.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1361.0, + 1404.0, + 1361.0, + 1404.0, + 1397.0, + 294.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1390.0, + 1407.0, + 1390.0, + 1407.0, + 1431.0, + 292.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1424.0, + 388.0, + 1424.0, + 388.0, + 1459.0, + 295.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 523.0, + 1424.0, + 768.0, + 1424.0, + 768.0, + 1459.0, + 523.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 750.0, + 915.0, + 750.0, + 915.0, + 787.0, + 294.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 750.0, + 1405.0, + 750.0, + 1405.0, + 787.0, + 1029.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 780.0, + 537.0, + 780.0, + 537.0, + 817.0, + 293.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 780.0, + 1404.0, + 780.0, + 1404.0, + 817.0, + 654.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 809.0, + 1405.0, + 809.0, + 1405.0, + 848.0, + 293.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 840.0, + 1405.0, + 840.0, + 1405.0, + 879.0, + 292.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 868.0, + 384.0, + 868.0, + 384.0, + 907.0, + 293.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1818.0, + 1406.0, + 1818.0, + 1406.0, + 1855.0, + 295.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1850.0, + 1405.0, + 1850.0, + 1405.0, + 1883.0, + 294.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1881.0, + 1405.0, + 1881.0, + 1405.0, + 1914.0, + 294.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1913.0, + 1405.0, + 1913.0, + 1405.0, + 1944.0, + 296.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 1406.0, + 1941.0, + 1406.0, + 1974.0, + 294.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2005.0, + 296.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2003.0, + 466.0, + 2003.0, + 466.0, + 2034.0, + 295.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 672.0, + 1405.0, + 672.0, + 1405.0, + 707.0, + 296.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 704.0, + 619.0, + 704.0, + 619.0, + 735.0, + 296.0, + 735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 223.0, + 1405.0, + 223.0, + 1405.0, + 271.0, + 293.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 690.0, + 261.0, + 690.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 325.0, + 1368.0, + 325.0, + 1368.0, + 372.0, + 337.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 358.0, + 990.0, + 358.0, + 990.0, + 402.0, + 708.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 1713.0, + 1060.0, + 1713.0, + 1060.0, + 1750.0, + 642.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 535.0, + 1744.0, + 1158.0, + 1744.0, + 1158.0, + 1782.0, + 535.0, + 1782.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 394, + 1405, + 394, + 1405, + 641, + 298, + 641 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 297, + 1111, + 1404, + 1111, + 1404, + 1359, + 297, + 1359 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1369, + 1403, + 1369, + 1403, + 1540, + 297, + 1540 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1693, + 1404, + 1693, + 1404, + 1879, + 298, + 1879 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 733, + 1403, + 733, + 1403, + 858, + 297, + 858 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 301, + 287, + 1401, + 287, + 1401, + 380, + 301, + 380 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 520, + 1552, + 1179, + 1552, + 1179, + 1634, + 520, + 1634 + ], + "score": 0.958 + }, + { + "category_id": 8, + "poly": [ + 618, + 982, + 1079, + 982, + 1079, + 1056, + 618, + 1056 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 297, + 1972, + 1399, + 1972, + 1399, + 2035, + 297, + 2035 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 294, + 1644, + 1351, + 1644, + 1351, + 1684, + 294, + 1684 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 304, + 1063, + 1281, + 1063, + 1281, + 1103, + 304, + 1103 + ], + "score": 0.911 + }, + { + "category_id": 0, + "poly": [ + 300, + 677, + 647, + 677, + 647, + 708, + 300, + 708 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 105, + 300, + 105 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1369, + 1004, + 1400, + 1004, + 1400, + 1032, + 1369, + 1032 + ], + "score": 0.88 + }, + { + "category_id": 0, + "poly": [ + 301, + 1916, + 1171, + 1916, + 1171, + 1947, + 301, + 1947 + ], + "score": 0.879 + }, + { + "category_id": 9, + "poly": [ + 1369, + 1579, + 1400, + 1579, + 1400, + 1607, + 1369, + 1607 + ], + "score": 0.87 + }, + { + "category_id": 1, + "poly": [ + 296, + 867, + 1404, + 867, + 1404, + 981, + 296, + 981 + ], + "score": 0.812 + }, + { + "category_id": 0, + "poly": [ + 301, + 230, + 772, + 230, + 772, + 261, + 301, + 261 + ], + "score": 0.81 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.725 + }, + { + "category_id": 14, + "poly": [ + 518, + 1549, + 1177, + 1549, + 1177, + 1636, + 518, + 1636 + ], + "score": 0.94, + "latex": "\\mathrm { T A C E } = \\frac { 1 } { C M } \\sum _ { c = 1 } ^ { C } \\sum _ { m = 1 } ^ { M } \\frac { | B _ { m } ^ { \\mathrm { T A } } | } { n } \\left| \\mathrm { o b j s } ( B _ { m } ^ { \\mathrm { T A } } , c ) - \\mathrm { c o n f } ( B _ { m } ^ { \\mathrm { T A } } , c ) \\right| ," + }, + { + "category_id": 13, + "poly": [ + 721, + 825, + 864, + 825, + 864, + 860, + 721, + 860 + ], + "score": 0.93, + "latex": "{ \\hat { p } } ( y = c | x _ { i } )" + }, + { + "category_id": 14, + "poly": [ + 618, + 975, + 1076, + 975, + 1076, + 1059, + 618, + 1059 + ], + "score": 0.92, + "latex": "\\mathrm { E C E } = \\sum _ { m = 1 } ^ { M } \\frac { | B _ { m } | } { n } \\left| \\operatorname { a c c } ( B _ { m } ) - \\operatorname { c o n f } ( B _ { m } ) \\right| ," + }, + { + "category_id": 13, + "poly": [ + 297, + 1236, + 416, + 1236, + 416, + 1264, + 297, + 1264 + ], + "score": 0.91, + "latex": "T = + \\infty" + }, + { + "category_id": 13, + "poly": [ + 564, + 827, + 608, + 827, + 608, + 859, + 564, + 859 + ], + "score": 0.9, + "latex": "\\hat { p } _ { i , c }" + }, + { + "category_id": 13, + "poly": [ + 483, + 927, + 527, + 927, + 527, + 956, + 483, + 956 + ], + "score": 0.9, + "latex": "{ B } _ { m } ^ { \\bar { } }" + }, + { + "category_id": 13, + "poly": [ + 1156, + 1482, + 1207, + 1482, + 1207, + 1514, + 1156, + 1514 + ], + "score": 0.9, + "latex": "B _ { m } ^ { \\mathrm { { T A } } }" + }, + { + "category_id": 13, + "poly": [ + 1185, + 318, + 1400, + 318, + 1400, + 352, + 1185, + 352 + ], + "score": 0.89, + "latex": "\\operatorname* { m a x } _ { c } { \\hat { p } } ( y = c | x _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 380, + 1063, + 889, + 1063, + 889, + 1103, + 380, + 1103 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\operatorname { a c c } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } { \\mathbb { I } } [ \\operatorname { a r g m a x } _ { c } \\hat { p } _ { i , c } = y _ { i } ^ { * } ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 822, + 927, + 855, + 927, + 855, + 953, + 822, + 953 + ], + "score": 0.86, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 409, + 1645, + 869, + 1645, + 869, + 1684, + 409, + 1684 + ], + "score": 0.84, + "latex": "\\begin{array} { r } { \\mathrm { j s } ( B ^ { \\mathrm { T A } } , c ) = | B ^ { \\mathrm { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathrm { T A } } } \\mathbb { I } [ y _ { i } ^ { * } = c ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 667, + 930, + 695, + 930, + 695, + 953, + 667, + 953 + ], + "score": 0.82, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 623, + 1510, + 655, + 1510, + 655, + 1536, + 623, + 1536 + ], + "score": 0.8, + "latex": "\\bar { M }" + }, + { + "category_id": 13, + "poly": [ + 1342, + 1484, + 1370, + 1484, + 1370, + 1508, + 1342, + 1508 + ], + "score": 0.79, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 941, + 1063, + 1279, + 1063, + 1279, + 1104, + 941, + 1104 + ], + "score": 0.78, + "latex": "\\begin{array} { r } { \\operatorname { c o n f } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } \\hat { p } _ { i , y _ { i } ^ { * } } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 920, + 1644, + 1351, + 1644, + 1351, + 1684, + 920, + 1684 + ], + "score": 0.77, + "latex": "\\begin{array} { r } { \\mathrm { c o n f } ( B ^ { \\mathrm { T A } } , c ) = | B ^ { \\mathrm { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathrm { T A } } } \\hat { p } _ { i , c } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 580, + 353, + 600, + 353, + 600, + 376, + 580, + 376 + ], + "score": 0.75, + "latex": "\\tau" + }, + { + "category_id": 14, + "poly": [ + 385, + 1645, + 1330, + 1645, + 1330, + 1686, + 385, + 1686 + ], + "score": 0.49, + "latex": "\\begin{array} { r } { \\mathrm { \\ o b j s } ( B ^ { \\mathtt { T A } } , c ) = | B ^ { \\mathtt { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathtt { T A } } } \\mathbb { I } [ y _ { i } ^ { * } = c ] \\mathrm { \\ a n d \\ c o n f } ( B ^ { \\mathtt { T A } } , c ) = | B ^ { \\mathtt { T A } } | ^ { - 1 } \\sum _ { i \\in B ^ { \\mathtt { T A } } } \\hat { p } _ { i } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 374, + 1069, + 1286, + 1069, + 1286, + 1106, + 374, + 1106 + ], + "score": 0.31, + "latex": "\\begin{array} { r } { \\operatorname { a c c } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } { \\mathbb { I } } [ \\operatorname { a r g m a x } _ { c } \\hat { p } _ { i , c } = y _ { i } ^ { * } ] \\mathrm { ~ a n d ~ c o n f } ( B ) = | B | ^ { - 1 } \\sum _ { i \\in B } \\hat { p } _ { i , y _ { i } ^ { * } } . } \\end{array}" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 674.0, + 649.0, + 674.0, + 649.0, + 712.0, + 294.0, + 712.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, + 1913.0, + 1174.0, + 1913.0, + 1174.0, + 1950.0, + 293.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 776.0, + 229.0, + 776.0, + 265.0, + 295.0, + 265.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": [ + 295.0, + 393.0, + 1406.0, + 393.0, + 1406.0, + 431.0, + 295.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 425.0, + 1405.0, + 425.0, + 1405.0, + 460.0, + 295.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 457.0, + 1403.0, + 457.0, + 1403.0, + 491.0, + 295.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 487.0, + 1405.0, + 487.0, + 1405.0, + 521.0, + 295.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 519.0, + 1405.0, + 519.0, + 1405.0, + 552.0, + 295.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 545.0, + 1403.0, + 545.0, + 1403.0, + 585.0, + 292.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 579.0, + 1405.0, + 579.0, + 1405.0, + 613.0, + 293.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 609.0, + 1226.0, + 609.0, + 1226.0, + 643.0, + 295.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1113.0, + 1404.0, + 1113.0, + 1404.0, + 1147.0, + 294.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1142.0, + 1404.0, + 1142.0, + 1404.0, + 1177.0, + 292.0, + 1177.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1172.0, + 1404.0, + 1172.0, + 1404.0, + 1208.0, + 294.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1205.0, + 1404.0, + 1205.0, + 1404.0, + 1239.0, + 295.0, + 1239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 1235.0, + 1405.0, + 1235.0, + 1405.0, + 1269.0, + 417.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1265.0, + 1404.0, + 1265.0, + 1404.0, + 1303.0, + 294.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1297.0, + 1402.0, + 1297.0, + 1402.0, + 1330.0, + 295.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1327.0, + 1376.0, + 1327.0, + 1376.0, + 1361.0, + 294.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1369.0, + 1407.0, + 1369.0, + 1407.0, + 1406.0, + 293.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1398.0, + 1405.0, + 1398.0, + 1405.0, + 1432.0, + 293.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1422.0, + 1407.0, + 1422.0, + 1407.0, + 1462.0, + 292.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1452.0, + 1405.0, + 1452.0, + 1405.0, + 1488.0, + 293.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1478.0, + 1155.0, + 1478.0, + 1155.0, + 1516.0, + 290.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.0, + 1478.0, + 1341.0, + 1478.0, + 1341.0, + 1516.0, + 1208.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 1478.0, + 1408.0, + 1478.0, + 1408.0, + 1516.0, + 1371.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1508.0, + 622.0, + 1508.0, + 622.0, + 1542.0, + 293.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 1508.0, + 1307.0, + 1508.0, + 1307.0, + 1542.0, + 656.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 1499.0, + 1199.0, + 1499.0, + 1199.0, + 1514.0, + 1178.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1693.0, + 1406.0, + 1693.0, + 1406.0, + 1729.0, + 296.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1723.0, + 1405.0, + 1723.0, + 1405.0, + 1763.0, + 294.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1752.0, + 1404.0, + 1752.0, + 1404.0, + 1791.0, + 293.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1787.0, + 1404.0, + 1787.0, + 1404.0, + 1819.0, + 296.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1815.0, + 1405.0, + 1815.0, + 1405.0, + 1851.0, + 294.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1845.0, + 435.0, + 1845.0, + 435.0, + 1882.0, + 293.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 731.0, + 1405.0, + 731.0, + 1405.0, + 770.0, + 292.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 764.0, + 1407.0, + 764.0, + 1407.0, + 800.0, + 292.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 792.0, + 1405.0, + 792.0, + 1405.0, + 829.0, + 292.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 824.0, + 563.0, + 824.0, + 563.0, + 861.0, + 292.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 824.0, + 720.0, + 824.0, + 720.0, + 861.0, + 609.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 824.0, + 1115.0, + 824.0, + 1115.0, + 861.0, + 865.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 284.0, + 1405.0, + 284.0, + 1405.0, + 324.0, + 295.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 318.0, + 1184.0, + 318.0, + 1184.0, + 355.0, + 295.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 347.0, + 579.0, + 347.0, + 579.0, + 383.0, + 295.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 347.0, + 1375.0, + 347.0, + 1375.0, + 383.0, + 601.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1970.0, + 1404.0, + 1970.0, + 1404.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2001.0, + 1403.0, + 2001.0, + 1403.0, + 2037.0, + 296.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1637.0, + 384.0, + 1637.0, + 384.0, + 1693.0, + 297.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1637.0, + 1360.0, + 1637.0, + 1360.0, + 1693.0, + 1352.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1052.0, + 373.0, + 1052.0, + 373.0, + 1114.0, + 298.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1287.0, + 1052.0, + 1292.0, + 1052.0, + 1292.0, + 1114.0, + 1287.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 868.0, + 1402.0, + 868.0, + 1402.0, + 901.0, + 295.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 895.0, + 1406.0, + 895.0, + 1406.0, + 933.0, + 293.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 920.0, + 482.0, + 920.0, + 482.0, + 963.0, + 290.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 920.0, + 666.0, + 920.0, + 666.0, + 963.0, + 528.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 920.0, + 821.0, + 920.0, + 821.0, + 963.0, + 696.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 920.0, + 1407.0, + 920.0, + 1407.0, + 963.0, + 856.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 949.0, + 395.0, + 949.0, + 395.0, + 986.0, + 295.0, + 986.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 803, + 1403, + 803, + 1403, + 1020, + 298, + 1020 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1293, + 1403, + 1293, + 1403, + 1510, + 298, + 1510 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1033, + 1404, + 1033, + 1404, + 1280, + 297, + 1280 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1736, + 1402, + 1736, + 1402, + 1897, + 297, + 1897 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 634, + 1404, + 634, + 1404, + 789, + 298, + 789 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1403, + 229, + 1403, + 384, + 299, + 384 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 399, + 1403, + 399, + 1403, + 522, + 299, + 522 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1911, + 1403, + 1911, + 1403, + 2035, + 298, + 2035 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 301, + 1523, + 1404, + 1523, + 1404, + 1618, + 301, + 1618 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 416, + 1633, + 1279, + 1633, + 1279, + 1723, + 416, + 1723 + ], + "score": 0.95 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 816, + 76, + 816, + 104, + 300, + 104 + ], + "score": 0.899 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1663, + 1400, + 1663, + 1400, + 1694, + 1366, + 1694 + ], + "score": 0.876 + }, + { + "category_id": 0, + "poly": [ + 300, + 567, + 1189, + 567, + 1189, + 601, + 300, + 601 + ], + "score": 0.841 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.782 + }, + { + "category_id": 13, + "poly": [ + 426, + 1586, + 556, + 1586, + 556, + 1619, + 426, + 1619 + ], + "score": 0.94, + "latex": "\\omega \\sim q _ { m } ( \\omega )" + }, + { + "category_id": 14, + "poly": [ + 417, + 1630, + 1281, + 1630, + 1281, + 1726, + 417, + 1726 + ], + "score": 0.94, + "latex": "\\hat { p } ( y _ { i } | x _ { i } ) \\approx \\int p ( y _ { i } | x _ { i } , \\omega ) q _ { m } ( \\omega ) d \\omega \\simeq \\frac { 1 } { K } \\sum _ { k = 1 } ^ { K } p ( y _ { i } | x _ { i } , \\omega _ { k } ) , \\quad \\omega _ { k } \\sim q _ { m } ( \\omega ) \\omega _ { k } ^ { \\quad \\mathrm { ~ d ~ } } ," + }, + { + "category_id": 13, + "poly": [ + 458, + 1768, + 787, + 1768, + 787, + 1809, + 458, + 1809 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { q _ { \\mathrm { { D E } } } ( \\omega ) = \\frac { 1 } { S } \\sum _ { s = 1 } ^ { S } \\delta ( \\omega - \\omega _ { s } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 934, + 1525, + 1010, + 1525, + 1010, + 1558, + 934, + 1558 + ], + "score": 0.92, + "latex": "q _ { m } ( \\omega )" + }, + { + "category_id": 13, + "poly": [ + 736, + 1976, + 826, + 1976, + 826, + 2007, + 736, + 2007 + ], + "score": 0.92, + "latex": "q _ { \\mathrm { a u g } } ( \\omega )" + }, + { + "category_id": 13, + "poly": [ + 1072, + 1833, + 1393, + 1833, + 1393, + 1868, + 1072, + 1868 + ], + "score": 0.91, + "latex": "q _ { \\mathrm { v I } } ( \\omega ) = \\mathcal { N } ( \\omega | \\mu , \\mathrm { d i a g } ( \\sigma ^ { 2 } ) )" + }, + { + "category_id": 13, + "poly": [ + 368, + 1863, + 400, + 1863, + 400, + 1892, + 368, + 1892 + ], + "score": 0.87, + "latex": "\\sigma ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 689, + 1739, + 710, + 1739, + 710, + 1765, + 689, + 1765 + ], + "score": 0.83, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1290, + 1777, + 1321, + 1777, + 1321, + 1804, + 1290, + 1804 + ], + "score": 0.83, + "latex": "\\omega _ { s }" + }, + { + "category_id": 13, + "poly": [ + 1379, + 1739, + 1402, + 1739, + 1402, + 1765, + 1379, + 1765 + ], + "score": 0.81, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1201, + 1531, + 1223, + 1531, + 1223, + 1552, + 1201, + 1552 + ], + "score": 0.76, + "latex": "\\omega" + }, + { + "category_id": 13, + "poly": [ + 297, + 1870, + 317, + 1870, + 317, + 1897, + 297, + 1897 + ], + "score": 0.74, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 861, + 1842, + 881, + 1842, + 881, + 1862, + 861, + 1862 + ], + "score": 0.73, + "latex": "\\omega" + }, + { + "category_id": 13, + "poly": [ + 464, + 1560, + 491, + 1560, + 491, + 1582, + 464, + 1582 + ], + "score": 0.71, + "latex": "m" + }, + { + "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, + 565.0, + 1195.0, + 565.0, + 1195.0, + 607.0, + 292.0, + 607.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, + 805.0, + 1404.0, + 805.0, + 1404.0, + 840.0, + 294.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 836.0, + 1405.0, + 836.0, + 1405.0, + 871.0, + 294.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 866.0, + 1405.0, + 866.0, + 1405.0, + 900.0, + 294.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 898.0, + 1405.0, + 898.0, + 1405.0, + 929.0, + 296.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 926.0, + 1405.0, + 926.0, + 1405.0, + 961.0, + 294.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 957.0, + 1405.0, + 957.0, + 1405.0, + 992.0, + 294.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 988.0, + 1336.0, + 988.0, + 1336.0, + 1023.0, + 294.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1291.0, + 1407.0, + 1291.0, + 1407.0, + 1333.0, + 292.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1322.0, + 1404.0, + 1322.0, + 1404.0, + 1362.0, + 291.0, + 1362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1353.0, + 1404.0, + 1353.0, + 1404.0, + 1390.0, + 292.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1382.0, + 1404.0, + 1382.0, + 1404.0, + 1425.0, + 292.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1415.0, + 1405.0, + 1415.0, + 1405.0, + 1454.0, + 293.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1442.0, + 1404.0, + 1442.0, + 1404.0, + 1486.0, + 293.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1478.0, + 716.0, + 1478.0, + 716.0, + 1513.0, + 296.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1030.0, + 1405.0, + 1030.0, + 1405.0, + 1072.0, + 292.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1064.0, + 1406.0, + 1064.0, + 1406.0, + 1101.0, + 294.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1095.0, + 1406.0, + 1095.0, + 1406.0, + 1132.0, + 294.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1126.0, + 1405.0, + 1126.0, + 1405.0, + 1160.0, + 295.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1154.0, + 1404.0, + 1154.0, + 1404.0, + 1194.0, + 292.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1185.0, + 1405.0, + 1185.0, + 1405.0, + 1223.0, + 294.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1218.0, + 1406.0, + 1218.0, + 1406.0, + 1252.0, + 294.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1248.0, + 1218.0, + 1248.0, + 1218.0, + 1282.0, + 295.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1738.0, + 457.0, + 1738.0, + 457.0, + 1838.0, + 283.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 788.0, + 1738.0, + 1289.0, + 1738.0, + 1289.0, + 1838.0, + 788.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1738.0, + 1378.0, + 1738.0, + 1378.0, + 1838.0, + 1322.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1738.0, + 1417.0, + 1738.0, + 1417.0, + 1838.0, + 1403.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1833.0, + 860.0, + 1833.0, + 860.0, + 1871.0, + 293.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 1833.0, + 1071.0, + 1833.0, + 1071.0, + 1871.0, + 882.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1833.0, + 1404.0, + 1833.0, + 1404.0, + 1871.0, + 1394.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1863.0, + 296.0, + 1863.0, + 296.0, + 1901.0, + 293.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1863.0, + 367.0, + 1863.0, + 367.0, + 1901.0, + 318.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 1863.0, + 1106.0, + 1863.0, + 1106.0, + 1901.0, + 401.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 636.0, + 1404.0, + 636.0, + 1404.0, + 669.0, + 296.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 665.0, + 1404.0, + 665.0, + 1404.0, + 701.0, + 294.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 697.0, + 1405.0, + 697.0, + 1405.0, + 730.0, + 296.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 722.0, + 1406.0, + 722.0, + 1406.0, + 766.0, + 291.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 760.0, + 433.0, + 760.0, + 433.0, + 791.0, + 292.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 231.0, + 1405.0, + 231.0, + 1405.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 260.0, + 1404.0, + 260.0, + 1404.0, + 293.0, + 295.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 291.0, + 1407.0, + 291.0, + 1407.0, + 328.0, + 294.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 320.0, + 1407.0, + 320.0, + 1407.0, + 357.0, + 293.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 352.0, + 1001.0, + 352.0, + 1001.0, + 389.0, + 294.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 398.0, + 1407.0, + 398.0, + 1407.0, + 434.0, + 292.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 429.0, + 1408.0, + 429.0, + 1408.0, + 465.0, + 295.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 460.0, + 1407.0, + 460.0, + 1407.0, + 498.0, + 293.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 490.0, + 1328.0, + 490.0, + 1328.0, + 526.0, + 294.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1909.0, + 1407.0, + 1909.0, + 1407.0, + 1947.0, + 291.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1940.0, + 1407.0, + 1940.0, + 1407.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1973.0, + 735.0, + 1973.0, + 735.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1973.0, + 1405.0, + 1973.0, + 1405.0, + 2009.0, + 827.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2001.0, + 1405.0, + 2001.0, + 1405.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1523.0, + 933.0, + 1523.0, + 933.0, + 1561.0, + 295.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 1523.0, + 1200.0, + 1523.0, + 1200.0, + 1561.0, + 1011.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1523.0, + 1404.0, + 1523.0, + 1404.0, + 1561.0, + 1224.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1553.0, + 463.0, + 1553.0, + 463.0, + 1591.0, + 295.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 492.0, + 1553.0, + 1405.0, + 1553.0, + 1405.0, + 1591.0, + 492.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1585.0, + 425.0, + 1585.0, + 425.0, + 1622.0, + 295.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 1585.0, + 1025.0, + 1585.0, + 1025.0, + 1622.0, + 557.0, + 1622.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1303, + 1403, + 1303, + 1403, + 1457, + 298, + 1457 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1472, + 1403, + 1472, + 1403, + 1626, + 299, + 1626 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 296, + 739, + 1405, + 739, + 1405, + 1018, + 296, + 1018 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 1641, + 1402, + 1641, + 1402, + 1733, + 299, + 1733 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 301, + 1810, + 1402, + 1810, + 1402, + 1903, + 301, + 1903 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 299, + 231, + 1397, + 231, + 1397, + 712, + 299, + 712 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 299, + 1069, + 1401, + 1069, + 1401, + 1132, + 299, + 1132 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 299, + 1147, + 1400, + 1147, + 1400, + 1210, + 299, + 1210 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 396, + 1973, + 1299, + 1973, + 1299, + 2030, + 396, + 2030 + ], + "score": 0.928 + }, + { + "category_id": 8, + "poly": [ + 487, + 1913, + 1208, + 1913, + 1208, + 1967, + 487, + 1967 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 328, + 1756, + 1371, + 1756, + 1371, + 1788, + 328, + 1788 + ], + "score": 0.916 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 815, + 76, + 815, + 104, + 299, + 104 + ], + "score": 0.89 + }, + { + "category_id": 0, + "poly": [ + 302, + 1246, + 724, + 1246, + 724, + 1277, + 302, + 1277 + ], + "score": 0.876 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1927, + 1400, + 1927, + 1400, + 1955, + 1366, + 1955 + ], + "score": 0.847 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1986, + 1401, + 1986, + 1401, + 2016, + 1366, + 2016 + ], + "score": 0.829 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2111, + 841, + 2111 + ], + "score": 0.672 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 859, + 2087, + 859, + 2111, + 841, + 2111 + ], + "score": 0.287 + }, + { + "category_id": 14, + "poly": [ + 393, + 1909, + 1303, + 1909, + 1303, + 2035, + 393, + 2035 + ], + "score": 0.91, + "latex": "\\begin{array} { r l r } & { } & { \\mathrm { D E E } _ { m } ( k ) = \\operatorname* { m i n } \\Big \\{ l \\in \\mathbb { R } , l \\geq 1 \\Big | \\mathrm { C L L } _ { D E } ^ { \\mathrm { m e a n } } ( l ) \\geq \\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n } } ( k ) \\Big \\} , \\quad } \\\\ & { } & { \\mathrm { D E E } _ { m } ^ { \\mathrm { ~ u p p e r ~ } } ( k ) = \\operatorname* { m i n } \\Big \\{ l \\in \\mathbb { R } , l \\geq 1 \\Big | \\mathrm { C L L } _ { D E } ^ { \\mathrm { m e a n } } ( l ) \\mp \\mathrm { C L L } _ { D E } ^ { \\mathrm { s t d } } ( l ) \\geq \\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n } } ( k ) \\Big \\} , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 865, + 1149, + 894, + 1149, + 894, + 1177, + 865, + 1177 + ], + "score": 0.8, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 594, + 1878, + 622, + 1878, + 622, + 1900, + 594, + 1900 + ], + "score": 0.8, + "latex": "m" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 742.0, + 1403.0, + 742.0, + 1403.0, + 775.0, + 296.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 768.0, + 1403.0, + 768.0, + 1403.0, + 806.0, + 296.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 801.0, + 1402.0, + 801.0, + 1402.0, + 836.0, + 295.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 832.0, + 1402.0, + 832.0, + 1402.0, + 865.0, + 295.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 864.0, + 1405.0, + 864.0, + 1405.0, + 897.0, + 295.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 892.0, + 1405.0, + 892.0, + 1405.0, + 929.0, + 294.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 925.0, + 1403.0, + 925.0, + 1403.0, + 957.0, + 295.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 954.0, + 1406.0, + 954.0, + 1406.0, + 988.0, + 293.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 986.0, + 796.0, + 986.0, + 796.0, + 1018.0, + 294.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 427.0, + 234.0, + 510.0, + 234.0, + 510.0, + 267.0, + 427.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 234.0, + 767.0, + 234.0, + 767.0, + 266.0, + 591.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 231.0, + 952.0, + 231.0, + 952.0, + 271.0, + 850.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 233.0, + 1090.0, + 233.0, + 1090.0, + 268.0, + 1030.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 232.0, + 1332.0, + 232.0, + 1332.0, + 270.0, + 1168.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 263.0, + 724.0, + 263.0, + 724.0, + 298.0, + 575.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 803.0, + 261.0, + 863.0, + 261.0, + 863.0, + 300.0, + 803.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 265.0, + 1021.0, + 265.0, + 1021.0, + 297.0, + 939.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 265.0, + 1186.0, + 265.0, + 1186.0, + 297.0, + 1103.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 816.0, + 315.0, + 930.0, + 315.0, + 930.0, + 350.0, + 816.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 317.0, + 565.0, + 317.0, + 565.0, + 349.0, + 465.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 317.0, + 1288.0, + 317.0, + 1288.0, + 350.0, + 1171.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 326.0, + 336.0, + 326.0, + 336.0, + 680.0, + 298.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 329.0, + 728.0, + 329.0, + 728.0, + 367.0, + 680.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 331.0, + 365.0, + 331.0, + 365.0, + 365.0, + 325.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 332.0, + 1081.0, + 332.0, + 1081.0, + 364.0, + 1053.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 411.0, + 1079.0, + 411.0, + 1079.0, + 439.0, + 1055.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 444.0, + 364.0, + 444.0, + 364.0, + 473.0, + 329.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 439.0, + 726.0, + 439.0, + 726.0, + 476.0, + 680.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 487.0, + 1079.0, + 487.0, + 1079.0, + 517.0, + 1054.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 556.0, + 361.0, + 556.0, + 361.0, + 582.0, + 341.0, + 582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 555.0, + 722.0, + 555.0, + 722.0, + 584.0, + 697.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 565.0, + 1079.0, + 565.0, + 1079.0, + 594.0, + 1054.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 619.0, + 362.0, + 619.0, + 362.0, + 671.0, + 336.0, + 671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 619.0, + 723.0, + 619.0, + 723.0, + 671.0, + 697.0, + 671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 668.0, + 371.0, + 668.0, + 371.0, + 677.0, + 361.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 655.0, + 445.0, + 655.0, + 445.0, + 687.0, + 402.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 658.0, + 505.0, + 658.0, + 505.0, + 686.0, + 464.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 658.0, + 565.0, + 658.0, + 565.0, + 686.0, + 524.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 653.0, + 692.0, + 653.0, + 692.0, + 688.0, + 580.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 657.0, + 863.0, + 657.0, + 863.0, + 687.0, + 762.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 878.0, + 657.0, + 923.0, + 657.0, + 923.0, + 687.0, + 878.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 653.0, + 1048.0, + 653.0, + 1048.0, + 688.0, + 934.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1060.0, + 653.0, + 1070.0, + 653.0, + 1070.0, + 664.0, + 1060.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 662.0, + 1089.0, + 662.0, + 1089.0, + 682.0, + 1074.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 653.0, + 1401.0, + 653.0, + 1401.0, + 689.0, + 1113.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 680.0, + 660.0, + 680.0, + 660.0, + 714.0, + 370.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 680.0, + 1019.0, + 680.0, + 1019.0, + 714.0, + 727.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 680.0, + 1375.0, + 680.0, + 1375.0, + 714.0, + 1083.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 665.5, + 724.0, + 665.5, + 724.0, + 678.5, + 721.0, + 678.5 + ], + "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, + 1244.0, + 729.0, + 1244.0, + 729.0, + 1281.0, + 294.0, + 1281.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": [ + 296.0, + 1305.0, + 1403.0, + 1305.0, + 1403.0, + 1338.0, + 296.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1332.0, + 1405.0, + 1332.0, + 1405.0, + 1369.0, + 293.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1364.0, + 1404.0, + 1364.0, + 1404.0, + 1397.0, + 294.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1391.0, + 1405.0, + 1391.0, + 1405.0, + 1432.0, + 292.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1425.0, + 1135.0, + 1425.0, + 1135.0, + 1462.0, + 294.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1471.0, + 1405.0, + 1471.0, + 1405.0, + 1508.0, + 295.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1503.0, + 1405.0, + 1503.0, + 1405.0, + 1536.0, + 295.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1532.0, + 1405.0, + 1532.0, + 1405.0, + 1569.0, + 294.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1562.0, + 1404.0, + 1562.0, + 1404.0, + 1599.0, + 294.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1594.0, + 623.0, + 1594.0, + 623.0, + 1627.0, + 295.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1640.0, + 1404.0, + 1640.0, + 1404.0, + 1677.0, + 294.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1669.0, + 1407.0, + 1669.0, + 1407.0, + 1709.0, + 293.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1701.0, + 1330.0, + 1701.0, + 1330.0, + 1739.0, + 294.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1809.0, + 1406.0, + 1809.0, + 1406.0, + 1847.0, + 294.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1842.0, + 1403.0, + 1842.0, + 1403.0, + 1876.0, + 296.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1873.0, + 593.0, + 1873.0, + 593.0, + 1907.0, + 296.0, + 1907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 1873.0, + 1105.0, + 1873.0, + 1105.0, + 1907.0, + 623.0, + 1907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1070.0, + 1405.0, + 1070.0, + 1405.0, + 1103.0, + 295.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1101.0, + 1263.0, + 1101.0, + 1263.0, + 1134.0, + 294.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1147.0, + 864.0, + 1147.0, + 864.0, + 1185.0, + 294.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 1147.0, + 1405.0, + 1147.0, + 1405.0, + 1185.0, + 895.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1179.0, + 1162.0, + 1179.0, + 1162.0, + 1212.0, + 293.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1750.0, + 1373.0, + 1750.0, + 1373.0, + 1794.0, + 330.0, + 1794.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1221, + 1404, + 1221, + 1404, + 1466, + 298, + 1466 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1481, + 1404, + 1481, + 1404, + 1727, + 298, + 1727 + ], + "score": 0.98 + }, + { + "category_id": 3, + "poly": [ + 365, + 235, + 1346, + 235, + 1346, + 680, + 365, + 680 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 942, + 1403, + 942, + 1403, + 1109, + 299, + 1109 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 1742, + 1402, + 1742, + 1402, + 1958, + 299, + 1958 + ], + "score": 0.971 + }, + { + "category_id": 4, + "poly": [ + 295, + 718, + 1405, + 718, + 1405, + 873, + 295, + 873 + ], + "score": 0.955 + }, + { + "category_id": 2, + "poly": [ + 329, + 2006, + 1187, + 2006, + 1187, + 2034, + 329, + 2034 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 815, + 76, + 815, + 104, + 299, + 104 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 299, + 1159, + 537, + 1159, + 537, + 1190, + 299, + 1190 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2111, + 840, + 2111 + ], + "score": 0.802 + }, + { + "category_id": 13, + "poly": [ + 588, + 1042, + 702, + 1042, + 702, + 1075, + 588, + 1075 + ], + "score": 0.92, + "latex": "\\mathrm { D E E } _ { m } ( k )" + }, + { + "category_id": 13, + "poly": [ + 487, + 1012, + 587, + 1012, + 587, + 1043, + 487, + 1043 + ], + "score": 0.91, + "latex": "l \\in { \\mathbb { N } } _ { > 0 }" + }, + { + "category_id": 13, + "poly": [ + 376, + 940, + 556, + 940, + 556, + 980, + 376, + 980 + ], + "score": 0.91, + "latex": "\\mathrm { C L L } _ { m } ^ { \\mathrm { m e a n / s t d } } ( l )" + }, + { + "category_id": 13, + "poly": [ + 1235, + 1075, + 1385, + 1075, + 1385, + 1110, + 1235, + 1110 + ], + "score": 0.9, + "latex": "\\mathrm { D E E } _ { m } ^ { \\mathrm { u p p e r } } ( k )" + }, + { + "category_id": 13, + "poly": [ + 1038, + 1073, + 1184, + 1073, + 1184, + 1110, + 1038, + 1110 + ], + "score": 0.9, + "latex": "\\mathrm { D E E } _ { m } ^ { \\mathrm { l o w e r } } ( k )" + }, + { + "category_id": 13, + "poly": [ + 1246, + 1013, + 1315, + 1013, + 1315, + 1042, + 1246, + 1042 + ], + "score": 0.89, + "latex": "l \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 1064, + 978, + 1193, + 978, + 1193, + 1014, + 1064, + 1014 + ], + "score": 0.83, + "latex": "\\mathrm { C L L } _ { \\mathrm { D E } } ^ { \\mathrm { m e a n } } ( l )" + }, + { + "category_id": 13, + "poly": [ + 1246, + 977, + 1360, + 977, + 1360, + 1014, + 1246, + 1014 + ], + "score": 0.8, + "latex": "\\mathrm { C L L } _ { \\mathrm { D E } } ^ { \\mathrm { s t d } } ( l )" + }, + { + "category_id": 13, + "poly": [ + 1375, + 1043, + 1393, + 1043, + 1393, + 1070, + 1375, + 1070 + ], + "score": 0.79, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 700, + 985, + 729, + 985, + 729, + 1009, + 700, + 1009 + ], + "score": 0.72, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 952, + 1046, + 980, + 1046, + 980, + 1070, + 952, + 1070 + ], + "score": 0.7, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 790, + 981, + 804, + 981, + 804, + 1008, + 790, + 1008 + ], + "score": 0.58, + "latex": "l" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 237.0, + 728.0, + 237.0, + 728.0, + 270.0, + 572.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 803.0, + 236.0, + 911.0, + 236.0, + 911.0, + 269.0, + 803.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 235.0, + 1117.0, + 235.0, + 1117.0, + 268.0, + 998.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 278.0, + 718.0, + 278.0, + 718.0, + 421.0, + 580.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 292.0, + 1058.0, + 292.0, + 1058.0, + 311.0, + 1039.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 296.0, + 1094.0, + 296.0, + 1094.0, + 306.0, + 1085.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 319.0, + 1045.0, + 319.0, + 1045.0, + 344.0, + 1006.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 333.0, + 874.0, + 333.0, + 874.0, + 360.0, + 834.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 352.0, + 473.0, + 352.0, + 473.0, + 386.0, + 384.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 350.0, + 1044.0, + 350.0, + 1044.0, + 369.0, + 1000.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 346.0, + 1342.0, + 346.0, + 1342.0, + 379.0, + 1232.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 377.0, + 466.0, + 377.0, + 466.0, + 417.0, + 390.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 376.0, + 1045.0, + 376.0, + 1045.0, + 400.0, + 1009.0, + 400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 371.0, + 1342.0, + 371.0, + 1342.0, + 409.0, + 1231.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 409.0, + 504.0, + 409.0, + 504.0, + 560.0, + 355.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 406.0, + 1269.0, + 406.0, + 1269.0, + 431.0, + 1247.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 412.0, + 1322.0, + 412.0, + 1322.0, + 426.0, + 1307.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 424.0, + 710.0, + 424.0, + 710.0, + 551.0, + 575.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 428.0, + 1056.0, + 428.0, + 1056.0, + 444.0, + 1042.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 452.0, + 1044.0, + 452.0, + 1044.0, + 479.0, + 1009.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 439.0, + 1255.0, + 439.0, + 1255.0, + 477.0, + 1206.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1257.0, + 451.0, + 1267.0, + 451.0, + 1267.0, + 464.0, + 1257.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 475.0, + 878.0, + 475.0, + 878.0, + 501.0, + 842.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 485.0, + 1042.0, + 485.0, + 1042.0, + 504.0, + 1002.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 479.0, + 1193.0, + 479.0, + 1193.0, + 487.0, + 1183.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 481.0, + 1252.0, + 481.0, + 1252.0, + 510.0, + 1199.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 512.0, + 1045.0, + 512.0, + 1045.0, + 532.0, + 1011.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 521.0, + 1251.0, + 521.0, + 1251.0, + 546.0, + 1211.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 546.0, + 717.0, + 546.0, + 717.0, + 688.0, + 574.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 562.0, + 1057.0, + 562.0, + 1057.0, + 580.0, + 1039.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1086.0, + 566.0, + 1095.0, + 566.0, + 1095.0, + 576.0, + 1086.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1001.0, + 620.0, + 1042.0, + 620.0, + 1042.0, + 639.0, + 1001.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 647.0, + 1044.0, + 647.0, + 1044.0, + 666.0, + 1010.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1008.25, + 589.0, + 1042.25, + 589.0, + 1042.25, + 611.0, + 1008.25, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 608.5, + 881.0, + 608.5, + 881.0, + 637.5, + 850.0, + 637.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 720.0, + 1405.0, + 720.0, + 1405.0, + 753.0, + 295.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 750.0, + 1403.0, + 750.0, + 1403.0, + 784.0, + 295.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 780.0, + 1407.0, + 780.0, + 1407.0, + 817.0, + 293.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 807.0, + 1408.0, + 807.0, + 1408.0, + 847.0, + 293.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 839.0, + 820.0, + 839.0, + 820.0, + 878.0, + 294.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 2000.0, + 1191.0, + 2000.0, + 1191.0, + 2040.0, + 332.0, + 2040.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, + 1157.0, + 542.0, + 1157.0, + 542.0, + 1193.0, + 294.0, + 1193.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": [ + 296.0, + 1221.0, + 1405.0, + 1221.0, + 1405.0, + 1258.0, + 296.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1251.0, + 1405.0, + 1251.0, + 1405.0, + 1288.0, + 294.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1282.0, + 1404.0, + 1282.0, + 1404.0, + 1318.0, + 293.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1312.0, + 1406.0, + 1312.0, + 1406.0, + 1349.0, + 293.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1343.0, + 1405.0, + 1343.0, + 1405.0, + 1381.0, + 294.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1375.0, + 1405.0, + 1375.0, + 1405.0, + 1408.0, + 294.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1403.0, + 1407.0, + 1403.0, + 1407.0, + 1441.0, + 292.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1432.0, + 1240.0, + 1432.0, + 1240.0, + 1473.0, + 292.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1481.0, + 1405.0, + 1481.0, + 1405.0, + 1519.0, + 294.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1512.0, + 1406.0, + 1512.0, + 1406.0, + 1548.0, + 292.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1544.0, + 1404.0, + 1544.0, + 1404.0, + 1578.0, + 294.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1574.0, + 1405.0, + 1574.0, + 1405.0, + 1608.0, + 294.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1605.0, + 1405.0, + 1605.0, + 1405.0, + 1639.0, + 294.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1635.0, + 1405.0, + 1635.0, + 1405.0, + 1669.0, + 293.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1666.0, + 1406.0, + 1666.0, + 1406.0, + 1700.0, + 294.0, + 1700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1694.0, + 1359.0, + 1694.0, + 1359.0, + 1730.0, + 293.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 930.0, + 375.0, + 930.0, + 375.0, + 988.0, + 285.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 930.0, + 1414.0, + 930.0, + 1414.0, + 988.0, + 557.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 966.0, + 699.0, + 966.0, + 699.0, + 1029.0, + 285.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 966.0, + 789.0, + 966.0, + 789.0, + 1029.0, + 730.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 966.0, + 1063.0, + 966.0, + 1063.0, + 1029.0, + 805.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 966.0, + 1245.0, + 966.0, + 1245.0, + 1029.0, + 1194.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1361.0, + 966.0, + 1405.0, + 966.0, + 1405.0, + 1029.0, + 1361.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1011.0, + 486.0, + 1011.0, + 486.0, + 1045.0, + 293.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1011.0, + 1245.0, + 1011.0, + 1245.0, + 1045.0, + 588.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1316.0, + 1011.0, + 1405.0, + 1011.0, + 1405.0, + 1045.0, + 1316.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1042.0, + 587.0, + 1042.0, + 587.0, + 1076.0, + 295.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 1042.0, + 951.0, + 1042.0, + 951.0, + 1076.0, + 703.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 1042.0, + 1374.0, + 1042.0, + 1374.0, + 1076.0, + 981.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1042.0, + 1405.0, + 1042.0, + 1405.0, + 1076.0, + 1394.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 1060.0, + 1037.0, + 1060.0, + 1037.0, + 1127.0, + 284.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1060.0, + 1234.0, + 1060.0, + 1234.0, + 1127.0, + 1185.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1386.0, + 1060.0, + 1410.0, + 1060.0, + 1410.0, + 1127.0, + 1386.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1740.0, + 1406.0, + 1740.0, + 1406.0, + 1777.0, + 292.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1773.0, + 1406.0, + 1773.0, + 1406.0, + 1808.0, + 293.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1803.0, + 1402.0, + 1803.0, + 1402.0, + 1838.0, + 295.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1831.0, + 1406.0, + 1831.0, + 1406.0, + 1869.0, + 294.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1859.0, + 1406.0, + 1859.0, + 1406.0, + 1903.0, + 293.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1892.0, + 1406.0, + 1892.0, + 1406.0, + 1933.0, + 293.0, + 1933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1925.0, + 748.0, + 1925.0, + 748.0, + 1960.0, + 297.0, + 1960.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1328, + 1404, + 1328, + 1404, + 1634, + 298, + 1634 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1728, + 1403, + 1728, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1036, + 1403, + 1036, + 1403, + 1312, + 298, + 1312 + ], + "score": 0.981 + }, + { + "category_id": 3, + "poly": [ + 358, + 234, + 1339, + 234, + 1339, + 642, + 358, + 642 + ], + "score": 0.969 + }, + { + "category_id": 4, + "poly": [ + 297, + 678, + 1405, + 678, + 1405, + 979, + 297, + 979 + ], + "score": 0.932 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 815, + 76, + 815, + 104, + 298, + 104 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.788 + }, + { + "category_id": 0, + "poly": [ + 300, + 1671, + 1174, + 1671, + 1174, + 1702, + 300, + 1702 + ], + "score": 0.738 + }, + { + "category_id": 1, + "poly": [ + 300, + 1671, + 1174, + 1671, + 1174, + 1702, + 300, + 1702 + ], + "score": 0.17 + }, + { + "category_id": 13, + "poly": [ + 868, + 767, + 933, + 767, + 933, + 796, + 868, + 796 + ], + "score": 0.88, + "latex": "( \\times \\times )" + }, + { + "category_id": 13, + "poly": [ + 657, + 679, + 1057, + 679, + 1057, + 736, + 657, + 736 + ], + "score": 0.46, + "latex": "\\times \\ \\frac { \\mathrm { \\ t e s t { - } t i m e \\ a u g } } { 1 0 \\ \\mathrm { s a m p l e s } } \\quad \\Phi , \\times \\ \\frac { \\mathrm { \\ t e s t { - } t i m e \\ a u g } } { 5 0 \\ \\mathrm { s a m p l e s } } \\quad \\cdot" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 242.0, + 584.0, + 242.0, + 584.0, + 265.0, + 560.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 237.0, + 865.0, + 237.0, + 865.0, + 266.0, + 597.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 242.0, + 926.0, + 242.0, + 926.0, + 265.0, + 901.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 237.0, + 1212.0, + 237.0, + 1212.0, + 266.0, + 936.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 271.0, + 581.0, + 271.0, + 581.0, + 285.0, + 565.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 261.0, + 868.0, + 261.0, + 868.0, + 293.0, + 596.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 271.0, + 919.0, + 271.0, + 919.0, + 285.0, + 905.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 261.0, + 1207.0, + 261.0, + 1207.0, + 292.0, + 935.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 285.0, + 422.0, + 285.0, + 422.0, + 318.0, + 386.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 308.0, + 881.0, + 308.0, + 881.0, + 592.0, + 842.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 327.0, + 917.0, + 327.0, + 917.0, + 355.0, + 872.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 331.0, + 424.0, + 331.0, + 424.0, + 369.0, + 383.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 339.0, + 1031.0, + 339.0, + 1031.0, + 372.0, + 1004.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 340.0, + 959.0, + 340.0, + 959.0, + 365.0, + 927.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 342.0, + 465.0, + 342.0, + 465.0, + 371.0, + 422.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 343.0, + 531.0, + 343.0, + 531.0, + 369.0, + 507.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 351.0, + 608.0, + 351.0, + 608.0, + 380.0, + 581.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 359.0, + 1104.0, + 359.0, + 1104.0, + 389.0, + 1078.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 362.0, + 677.0, + 362.0, + 677.0, + 399.0, + 657.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 367.0, + 1178.0, + 367.0, + 1178.0, + 404.0, + 1153.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 369.0, + 400.0, + 369.0, + 400.0, + 530.0, + 356.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 382.0, + 418.0, + 382.0, + 418.0, + 413.0, + 381.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 382.0, + 917.0, + 382.0, + 917.0, + 412.0, + 872.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 429.0, + 419.0, + 429.0, + 419.0, + 465.0, + 387.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 457.0, + 599.0, + 457.0, + 599.0, + 467.0, + 587.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 448.0, + 756.0, + 448.0, + 756.0, + 491.0, + 728.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 440.0, + 917.0, + 440.0, + 917.0, + 469.0, + 871.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 933.0, + 445.0, + 951.0, + 445.0, + 951.0, + 464.0, + 933.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 439.0, + 1026.0, + 439.0, + 1026.0, + 458.0, + 1007.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 445.0, + 1101.0, + 445.0, + 1101.0, + 464.0, + 1083.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 455.0, + 1175.0, + 455.0, + 1175.0, + 473.0, + 1156.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1229.0, + 453.0, + 1252.0, + 453.0, + 1252.0, + 506.0, + 1229.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 463.0, + 451.0, + 463.0, + 451.0, + 477.0, + 435.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 461.0, + 524.0, + 461.0, + 524.0, + 471.0, + 513.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 473.0, + 675.0, + 473.0, + 675.0, + 489.0, + 660.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 482.0, + 419.0, + 482.0, + 419.0, + 514.0, + 387.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 489.0, + 451.0, + 489.0, + 451.0, + 504.0, + 435.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 490.0, + 525.0, + 490.0, + 525.0, + 505.0, + 512.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 487.0, + 600.0, + 487.0, + 600.0, + 500.0, + 586.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 508.0, + 674.0, + 508.0, + 674.0, + 523.0, + 660.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 499.0, + 751.0, + 499.0, + 751.0, + 519.0, + 733.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 495.0, + 828.0, + 495.0, + 828.0, + 531.0, + 805.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 497.0, + 917.0, + 497.0, + 917.0, + 526.0, + 871.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 497.0, + 952.0, + 497.0, + 952.0, + 516.0, + 932.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 492.0, + 1025.0, + 492.0, + 1025.0, + 512.0, + 1007.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 498.0, + 1098.0, + 498.0, + 1098.0, + 513.0, + 1083.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 511.0, + 1174.0, + 511.0, + 1174.0, + 529.0, + 1156.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1303.0, + 494.0, + 1326.0, + 494.0, + 1326.0, + 539.0, + 1303.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 530.0, + 423.0, + 530.0, + 423.0, + 566.0, + 385.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 534.0, + 824.0, + 534.0, + 824.0, + 547.0, + 809.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 579.0, + 424.0, + 579.0, + 424.0, + 615.0, + 386.0, + 615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 547.0, + 751.0, + 547.0, + 751.0, + 565.0, + 731.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 572.0, + 824.0, + 572.0, + 824.0, + 587.0, + 809.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 553.0, + 919.0, + 553.0, + 919.0, + 584.0, + 870.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 547.0, + 1247.0, + 547.0, + 1247.0, + 563.0, + 1232.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 572.0, + 1323.0, + 572.0, + 1323.0, + 591.0, + 1306.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 599.0, + 472.0, + 599.0, + 472.0, + 631.0, + 416.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 599.0, + 553.0, + 599.0, + 553.0, + 630.0, + 483.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 571.0, + 600.0, + 614.0, + 600.0, + 614.0, + 630.0, + 571.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 600.0, + 689.0, + 600.0, + 689.0, + 630.0, + 645.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 600.0, + 763.0, + 600.0, + 763.0, + 630.0, + 720.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 601.0, + 832.0, + 601.0, + 832.0, + 628.0, + 800.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 601.0, + 969.0, + 601.0, + 969.0, + 630.0, + 915.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 599.0, + 1051.0, + 599.0, + 1051.0, + 630.0, + 980.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1069.0, + 600.0, + 1112.0, + 600.0, + 1112.0, + 630.0, + 1069.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 600.0, + 1187.0, + 600.0, + 1187.0, + 630.0, + 1142.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 600.0, + 1261.0, + 600.0, + 1261.0, + 630.0, + 1217.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 602.0, + 1330.0, + 602.0, + 1330.0, + 630.0, + 1297.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 616.0, + 470.0, + 616.0, + 470.0, + 644.0, + 417.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 617.0, + 610.0, + 617.0, + 610.0, + 644.0, + 577.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 616.0, + 969.0, + 616.0, + 969.0, + 644.0, + 915.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 617.0, + 1107.0, + 617.0, + 1107.0, + 643.0, + 1074.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 687.0, + 656.0, + 687.0, + 656.0, + 718.0, + 296.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 671.0, + 814.0, + 671.0, + 814.0, + 709.0, + 696.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 670.0, + 1019.0, + 670.0, + 1019.0, + 709.0, + 901.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 697.0, + 1061.0, + 697.0, + 1061.0, + 713.0, + 1058.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 680.0, + 1401.0, + 680.0, + 1401.0, + 726.0, + 1072.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 733.0, + 1402.0, + 733.0, + 1402.0, + 768.0, + 296.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 765.0, + 867.0, + 765.0, + 867.0, + 796.0, + 295.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 765.0, + 1405.0, + 765.0, + 1405.0, + 796.0, + 934.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 795.0, + 1406.0, + 795.0, + 1406.0, + 827.0, + 294.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 826.0, + 1402.0, + 826.0, + 1402.0, + 857.0, + 296.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 852.0, + 1406.0, + 852.0, + 1406.0, + 890.0, + 294.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 885.0, + 1403.0, + 885.0, + 1403.0, + 921.0, + 294.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 915.0, + 1403.0, + 915.0, + 1403.0, + 953.0, + 294.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 948.0, + 672.0, + 948.0, + 672.0, + 981.0, + 295.0, + 981.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, + 1670.0, + 1179.0, + 1670.0, + 1179.0, + 1705.0, + 295.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1327.0, + 1404.0, + 1327.0, + 1404.0, + 1363.0, + 296.0, + 1363.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": [ + 292.0, + 1390.0, + 1405.0, + 1390.0, + 1405.0, + 1424.0, + 292.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1420.0, + 1405.0, + 1420.0, + 1405.0, + 1456.0, + 294.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1448.0, + 1406.0, + 1448.0, + 1406.0, + 1486.0, + 293.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1480.0, + 1406.0, + 1480.0, + 1406.0, + 1515.0, + 293.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1508.0, + 1405.0, + 1508.0, + 1405.0, + 1550.0, + 292.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1542.0, + 1405.0, + 1542.0, + 1405.0, + 1576.0, + 293.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1570.0, + 1407.0, + 1570.0, + 1407.0, + 1608.0, + 291.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1603.0, + 1291.0, + 1603.0, + 1291.0, + 1638.0, + 293.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1730.0, + 1403.0, + 1730.0, + 1403.0, + 1762.0, + 296.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1758.0, + 1407.0, + 1758.0, + 1407.0, + 1797.0, + 293.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1790.0, + 1407.0, + 1790.0, + 1407.0, + 1825.0, + 294.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1820.0, + 1405.0, + 1820.0, + 1405.0, + 1856.0, + 294.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1848.0, + 1405.0, + 1848.0, + 1405.0, + 1886.0, + 293.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1884.0, + 1405.0, + 1884.0, + 1405.0, + 1915.0, + 296.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1976.0, + 293.0, + 1976.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": [ + 293.0, + 2002.0, + 1403.0, + 2002.0, + 1403.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1034.0, + 1405.0, + 1034.0, + 1405.0, + 1077.0, + 292.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1067.0, + 1405.0, + 1067.0, + 1405.0, + 1105.0, + 293.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1100.0, + 1405.0, + 1100.0, + 1405.0, + 1136.0, + 296.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1131.0, + 1404.0, + 1131.0, + 1404.0, + 1164.0, + 296.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1158.0, + 1405.0, + 1158.0, + 1405.0, + 1196.0, + 292.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1191.0, + 1403.0, + 1191.0, + 1403.0, + 1224.0, + 296.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1218.0, + 1405.0, + 1218.0, + 1405.0, + 1256.0, + 293.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1251.0, + 1405.0, + 1251.0, + 1405.0, + 1288.0, + 292.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1283.0, + 416.0, + 1283.0, + 416.0, + 1317.0, + 292.0, + 1317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1670.0, + 1179.0, + 1670.0, + 1179.0, + 1705.0, + 295.0, + 1705.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 308, + 1403, + 308, + 1403, + 581, + 298, + 581 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 598, + 1403, + 598, + 1403, + 781, + 298, + 781 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 300, + 1912, + 1401, + 1912, + 1401, + 2035, + 300, + 2035 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 298, + 797, + 1404, + 797, + 1404, + 1042, + 298, + 1042 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 368, + 1239, + 1403, + 1239, + 1403, + 1888, + 368, + 1888 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 299, + 1154, + 1401, + 1154, + 1401, + 1216, + 299, + 1216 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1399, + 229, + 1399, + 293, + 294, + 293 + ], + "score": 0.947 + }, + { + "category_id": 0, + "poly": [ + 302, + 1085, + 763, + 1085, + 763, + 1120, + 302, + 1120 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 816, + 76, + 816, + 104, + 300, + 104 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 837, + 2088, + 865, + 2088, + 865, + 2112, + 837, + 2112 + ], + "score": 0.847 + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1079.0, + 770.0, + 1079.0, + 770.0, + 1129.0, + 291.0, + 1129.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, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 305.0, + 1404.0, + 305.0, + 1404.0, + 346.0, + 293.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 337.0, + 1405.0, + 337.0, + 1405.0, + 373.0, + 294.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 368.0, + 1407.0, + 368.0, + 1407.0, + 403.0, + 293.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 395.0, + 1405.0, + 395.0, + 1405.0, + 435.0, + 292.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 432.0, + 1404.0, + 432.0, + 1404.0, + 464.0, + 294.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 460.0, + 1407.0, + 460.0, + 1407.0, + 496.0, + 294.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 490.0, + 1405.0, + 490.0, + 1405.0, + 526.0, + 296.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 524.0, + 1404.0, + 524.0, + 1404.0, + 556.0, + 296.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 548.0, + 454.0, + 548.0, + 454.0, + 586.0, + 294.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 600.0, + 1403.0, + 600.0, + 1403.0, + 631.0, + 296.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 628.0, + 1404.0, + 628.0, + 1404.0, + 663.0, + 294.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 659.0, + 1404.0, + 659.0, + 1404.0, + 693.0, + 294.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 691.0, + 1404.0, + 691.0, + 1404.0, + 722.0, + 296.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 719.0, + 1404.0, + 719.0, + 1404.0, + 756.0, + 293.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 751.0, + 597.0, + 751.0, + 597.0, + 783.0, + 296.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1947.0, + 295.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1976.0, + 296.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2005.0, + 529.0, + 2005.0, + 529.0, + 2036.0, + 295.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 796.0, + 1406.0, + 796.0, + 1406.0, + 831.0, + 295.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 830.0, + 1406.0, + 830.0, + 1406.0, + 863.0, + 294.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 860.0, + 1404.0, + 860.0, + 1404.0, + 893.0, + 294.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 888.0, + 1406.0, + 888.0, + 1406.0, + 924.0, + 292.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 918.0, + 1404.0, + 918.0, + 1404.0, + 954.0, + 293.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 949.0, + 1405.0, + 949.0, + 1405.0, + 985.0, + 293.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 978.0, + 1405.0, + 978.0, + 1405.0, + 1018.0, + 292.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1011.0, + 1090.0, + 1011.0, + 1090.0, + 1045.0, + 293.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1242.0, + 1403.0, + 1242.0, + 1403.0, + 1271.0, + 372.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1272.0, + 1405.0, + 1272.0, + 1405.0, + 1305.0, + 395.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1301.0, + 1404.0, + 1301.0, + 1404.0, + 1336.0, + 392.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1332.0, + 1405.0, + 1332.0, + 1405.0, + 1368.0, + 394.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1365.0, + 559.0, + 1365.0, + 559.0, + 1391.0, + 393.0, + 1391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 1401.0, + 1406.0, + 1401.0, + 1406.0, + 1437.0, + 390.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1434.0, + 1403.0, + 1434.0, + 1403.0, + 1466.0, + 395.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1462.0, + 1405.0, + 1462.0, + 1405.0, + 1497.0, + 394.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1493.0, + 1097.0, + 1493.0, + 1097.0, + 1526.0, + 395.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1534.0, + 1405.0, + 1534.0, + 1405.0, + 1567.0, + 394.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1565.0, + 1405.0, + 1565.0, + 1405.0, + 1596.0, + 392.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1593.0, + 1403.0, + 1593.0, + 1403.0, + 1629.0, + 394.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1623.0, + 1403.0, + 1623.0, + 1403.0, + 1659.0, + 394.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1658.0, + 551.0, + 1658.0, + 551.0, + 1688.0, + 395.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1693.0, + 1403.0, + 1693.0, + 1403.0, + 1729.0, + 372.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1725.0, + 1405.0, + 1725.0, + 1405.0, + 1761.0, + 394.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1757.0, + 1123.0, + 1757.0, + 1123.0, + 1792.0, + 392.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 1795.0, + 1403.0, + 1795.0, + 1403.0, + 1832.0, + 389.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1829.0, + 1405.0, + 1829.0, + 1405.0, + 1862.0, + 395.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1857.0, + 1263.0, + 1857.0, + 1263.0, + 1892.0, + 394.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1153.0, + 1403.0, + 1153.0, + 1403.0, + 1189.0, + 297.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1184.0, + 1293.0, + 1184.0, + 1293.0, + 1218.0, + 294.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 260.0, + 1295.0, + 260.0, + 1295.0, + 296.0, + 295.0, + 296.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 409, + 1404, + 409, + 1404, + 501, + 299, + 501 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1400, + 229, + 1400, + 322, + 298, + 322 + ], + "score": 0.949 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 105, + 300, + 105 + ], + "score": 0.893 + }, + { + "category_id": 0, + "poly": [ + 299, + 546, + 488, + 546, + 488, + 580, + 299, + 580 + ], + "score": 0.838 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.822 + }, + { + "category_id": 0, + "poly": [ + 300, + 358, + 558, + 358, + 558, + 387, + 300, + 387 + ], + "score": 0.821 + }, + { + "category_id": 1, + "poly": [ + 294, + 1394, + 1378, + 1394, + 1378, + 1430, + 294, + 1430 + ], + "score": 0.81 + }, + { + "category_id": 1, + "poly": [ + 300, + 1445, + 1400, + 1445, + 1400, + 1538, + 300, + 1538 + ], + "score": 0.796 + }, + { + "category_id": 1, + "poly": [ + 299, + 1283, + 1403, + 1283, + 1403, + 1376, + 299, + 1376 + ], + "score": 0.774 + }, + { + "category_id": 1, + "poly": [ + 299, + 1172, + 1405, + 1172, + 1405, + 1266, + 299, + 1266 + ], + "score": 0.766 + }, + { + "category_id": 1, + "poly": [ + 297, + 1668, + 1405, + 1668, + 1405, + 1763, + 297, + 1763 + ], + "score": 0.707 + }, + { + "category_id": 1, + "poly": [ + 298, + 1555, + 1404, + 1555, + 1404, + 1651, + 298, + 1651 + ], + "score": 0.683 + }, + { + "category_id": 1, + "poly": [ + 298, + 869, + 1399, + 869, + 1399, + 933, + 298, + 933 + ], + "score": 0.682 + }, + { + "category_id": 1, + "poly": [ + 298, + 949, + 1400, + 949, + 1400, + 1046, + 298, + 1046 + ], + "score": 0.66 + }, + { + "category_id": 1, + "poly": [ + 295, + 1779, + 1400, + 1779, + 1400, + 1843, + 295, + 1843 + ], + "score": 0.647 + }, + { + "category_id": 1, + "poly": [ + 297, + 706, + 1400, + 706, + 1400, + 772, + 297, + 772 + ], + "score": 0.645 + }, + { + "category_id": 1, + "poly": [ + 300, + 1061, + 1402, + 1061, + 1402, + 1156, + 300, + 1156 + ], + "score": 0.63 + }, + { + "category_id": 1, + "poly": [ + 296, + 1860, + 1400, + 1860, + 1400, + 1924, + 296, + 1924 + ], + "score": 0.629 + }, + { + "category_id": 1, + "poly": [ + 298, + 788, + 1398, + 788, + 1398, + 853, + 298, + 853 + ], + "score": 0.627 + }, + { + "category_id": 1, + "poly": [ + 298, + 597, + 1406, + 597, + 1406, + 691, + 298, + 691 + ], + "score": 0.614 + }, + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1401, + 1942, + 1401, + 2033, + 300, + 2033 + ], + "score": 0.588 + }, + { + "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, + 547.0, + 490.0, + 547.0, + 490.0, + 583.0, + 296.0, + 583.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": [ + 299.0, + 359.0, + 559.0, + 359.0, + 559.0, + 388.0, + 299.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 406.0, + 1406.0, + 406.0, + 1406.0, + 445.0, + 293.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 437.0, + 1406.0, + 437.0, + 1406.0, + 474.0, + 293.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 471.0, + 555.0, + 471.0, + 555.0, + 501.0, + 297.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 230.0, + 1404.0, + 230.0, + 1404.0, + 263.0, + 296.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 260.0, + 1404.0, + 260.0, + 1404.0, + 298.0, + 293.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 292.0, + 427.0, + 292.0, + 427.0, + 324.0, + 296.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1391.0, + 1382.0, + 1391.0, + 1382.0, + 1435.0, + 296.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1443.0, + 1404.0, + 1443.0, + 1404.0, + 1482.0, + 294.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1478.0, + 1404.0, + 1478.0, + 1404.0, + 1512.0, + 322.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1502.0, + 398.0, + 1502.0, + 398.0, + 1543.0, + 320.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1281.0, + 1404.0, + 1281.0, + 1404.0, + 1322.0, + 294.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1315.0, + 1403.0, + 1315.0, + 1403.0, + 1349.0, + 322.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1344.0, + 397.0, + 1344.0, + 397.0, + 1378.0, + 322.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1170.0, + 1405.0, + 1170.0, + 1405.0, + 1209.0, + 294.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1203.0, + 1404.0, + 1203.0, + 1404.0, + 1240.0, + 323.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1235.0, + 609.0, + 1235.0, + 609.0, + 1264.0, + 323.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1666.0, + 1405.0, + 1666.0, + 1405.0, + 1705.0, + 294.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1700.0, + 1403.0, + 1700.0, + 1403.0, + 1734.0, + 323.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1730.0, + 711.0, + 1730.0, + 711.0, + 1764.0, + 321.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1556.0, + 1404.0, + 1556.0, + 1404.0, + 1591.0, + 296.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1587.0, + 1402.0, + 1587.0, + 1402.0, + 1621.0, + 325.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1618.0, + 804.0, + 1618.0, + 804.0, + 1652.0, + 323.0, + 1652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 864.0, + 1405.0, + 864.0, + 1405.0, + 909.0, + 293.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 899.0, + 517.0, + 899.0, + 517.0, + 933.0, + 322.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 951.0, + 1402.0, + 951.0, + 1402.0, + 985.0, + 294.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 981.0, + 1405.0, + 981.0, + 1405.0, + 1016.0, + 324.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1011.0, + 944.0, + 1011.0, + 944.0, + 1049.0, + 323.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1774.0, + 1406.0, + 1774.0, + 1406.0, + 1819.0, + 293.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1808.0, + 1283.0, + 1808.0, + 1283.0, + 1844.0, + 323.0, + 1844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 707.0, + 1404.0, + 707.0, + 1404.0, + 743.0, + 296.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 739.0, + 1267.0, + 739.0, + 1267.0, + 773.0, + 322.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1059.0, + 1403.0, + 1059.0, + 1403.0, + 1099.0, + 293.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1094.0, + 1404.0, + 1094.0, + 1404.0, + 1128.0, + 323.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1122.0, + 806.0, + 1122.0, + 806.0, + 1160.0, + 323.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1860.0, + 1405.0, + 1860.0, + 1405.0, + 1896.0, + 294.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1891.0, + 948.0, + 1891.0, + 948.0, + 1923.0, + 324.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 787.0, + 1406.0, + 787.0, + 1406.0, + 827.0, + 294.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 821.0, + 970.0, + 821.0, + 970.0, + 854.0, + 323.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 597.0, + 1403.0, + 597.0, + 1403.0, + 631.0, + 296.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 626.0, + 1406.0, + 626.0, + 1406.0, + 663.0, + 322.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 659.0, + 773.0, + 659.0, + 773.0, + 693.0, + 324.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1937.0, + 1403.0, + 1937.0, + 1403.0, + 1982.0, + 293.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1968.0, + 1405.0, + 1968.0, + 1405.0, + 2011.0, + 320.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1998.0, + 505.0, + 1998.0, + 505.0, + 2035.0, + 322.0, + 2035.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 75, + 817, + 75, + 817, + 105, + 299, + 105 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.828 + }, + { + "category_id": 1, + "poly": [ + 296, + 1152, + 1401, + 1152, + 1401, + 1218, + 296, + 1218 + ], + "score": 0.706 + }, + { + "category_id": 1, + "poly": [ + 295, + 1235, + 1401, + 1235, + 1401, + 1301, + 295, + 1301 + ], + "score": 0.693 + }, + { + "category_id": 1, + "poly": [ + 298, + 758, + 1400, + 758, + 1400, + 824, + 298, + 824 + ], + "score": 0.668 + }, + { + "category_id": 1, + "poly": [ + 296, + 1069, + 1401, + 1069, + 1401, + 1135, + 296, + 1135 + ], + "score": 0.657 + }, + { + "category_id": 1, + "poly": [ + 299, + 1629, + 1402, + 1629, + 1402, + 1723, + 299, + 1723 + ], + "score": 0.626 + }, + { + "category_id": 1, + "poly": [ + 297, + 1515, + 1401, + 1515, + 1401, + 1610, + 297, + 1610 + ], + "score": 0.618 + }, + { + "category_id": 1, + "poly": [ + 299, + 1318, + 1399, + 1318, + 1399, + 1415, + 299, + 1415 + ], + "score": 0.614 + }, + { + "category_id": 1, + "poly": [ + 292, + 1743, + 1401, + 1743, + 1401, + 1808, + 292, + 1808 + ], + "score": 0.611 + }, + { + "category_id": 1, + "poly": [ + 294, + 675, + 1399, + 675, + 1399, + 740, + 294, + 740 + ], + "score": 0.607 + }, + { + "category_id": 1, + "poly": [ + 299, + 841, + 1402, + 841, + 1402, + 937, + 299, + 937 + ], + "score": 0.606 + }, + { + "category_id": 1, + "poly": [ + 299, + 1826, + 1400, + 1826, + 1400, + 1923, + 299, + 1923 + ], + "score": 0.604 + }, + { + "category_id": 1, + "poly": [ + 296, + 229, + 1402, + 229, + 1402, + 294, + 296, + 294 + ], + "score": 0.596 + }, + { + "category_id": 1, + "poly": [ + 297, + 478, + 1403, + 478, + 1403, + 573, + 297, + 573 + ], + "score": 0.594 + }, + { + "category_id": 1, + "poly": [ + 295, + 591, + 1399, + 591, + 1399, + 658, + 295, + 658 + ], + "score": 0.587 + }, + { + "category_id": 1, + "poly": [ + 296, + 1432, + 1399, + 1432, + 1399, + 1498, + 296, + 1498 + ], + "score": 0.581 + }, + { + "category_id": 1, + "poly": [ + 295, + 396, + 1400, + 396, + 1400, + 460, + 295, + 460 + ], + "score": 0.563 + }, + { + "category_id": 1, + "poly": [ + 297, + 311, + 1399, + 311, + 1399, + 378, + 297, + 378 + ], + "score": 0.561 + }, + { + "category_id": 1, + "poly": [ + 300, + 955, + 1401, + 955, + 1401, + 1051, + 300, + 1051 + ], + "score": 0.552 + }, + { + "category_id": 1, + "poly": [ + 300, + 1941, + 1403, + 1941, + 1403, + 2035, + 300, + 2035 + ], + "score": 0.508 + }, + { + "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": [ + 295.0, + 1151.0, + 1405.0, + 1151.0, + 1405.0, + 1190.0, + 295.0, + 1190.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1184.0, + 1054.0, + 1184.0, + 1054.0, + 1220.0, + 323.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1236.0, + 1405.0, + 1236.0, + 1405.0, + 1273.0, + 294.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1268.0, + 1247.0, + 1268.0, + 1247.0, + 1302.0, + 322.0, + 1302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 756.0, + 1406.0, + 756.0, + 1406.0, + 798.0, + 294.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 788.0, + 1027.0, + 788.0, + 1027.0, + 825.0, + 322.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1072.0, + 1403.0, + 1072.0, + 1403.0, + 1105.0, + 297.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1102.0, + 1405.0, + 1102.0, + 1405.0, + 1136.0, + 321.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1631.0, + 1403.0, + 1631.0, + 1403.0, + 1665.0, + 295.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1660.0, + 1406.0, + 1660.0, + 1406.0, + 1697.0, + 322.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1691.0, + 396.0, + 1691.0, + 396.0, + 1725.0, + 320.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1514.0, + 1406.0, + 1514.0, + 1406.0, + 1554.0, + 292.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1549.0, + 1405.0, + 1549.0, + 1405.0, + 1583.0, + 325.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1577.0, + 618.0, + 1577.0, + 618.0, + 1614.0, + 321.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1320.0, + 1403.0, + 1320.0, + 1403.0, + 1354.0, + 296.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1352.0, + 1403.0, + 1352.0, + 1403.0, + 1386.0, + 321.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1380.0, + 710.0, + 1380.0, + 710.0, + 1417.0, + 320.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1739.0, + 1406.0, + 1739.0, + 1406.0, + 1783.0, + 292.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1774.0, + 714.0, + 1774.0, + 714.0, + 1810.0, + 324.0, + 1810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 673.0, + 1404.0, + 673.0, + 1404.0, + 715.0, + 293.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 706.0, + 693.0, + 706.0, + 693.0, + 742.0, + 324.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 840.0, + 1406.0, + 840.0, + 1406.0, + 879.0, + 293.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 871.0, + 1406.0, + 871.0, + 1406.0, + 912.0, + 321.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 904.0, + 677.0, + 904.0, + 677.0, + 938.0, + 323.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1826.0, + 1404.0, + 1826.0, + 1404.0, + 1865.0, + 295.0, + 1865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1858.0, + 1404.0, + 1858.0, + 1404.0, + 1893.0, + 324.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1888.0, + 1319.0, + 1888.0, + 1319.0, + 1925.0, + 324.0, + 1925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 1406.0, + 228.0, + 1406.0, + 268.0, + 295.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 262.0, + 707.0, + 262.0, + 707.0, + 295.0, + 320.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 479.0, + 1403.0, + 479.0, + 1403.0, + 513.0, + 295.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 511.0, + 1404.0, + 511.0, + 1404.0, + 545.0, + 321.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 540.0, + 611.0, + 540.0, + 611.0, + 573.0, + 321.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 591.0, + 1403.0, + 591.0, + 1403.0, + 627.0, + 295.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 623.0, + 1341.0, + 623.0, + 1341.0, + 660.0, + 323.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1430.0, + 1403.0, + 1430.0, + 1403.0, + 1470.0, + 294.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1465.0, + 1047.0, + 1465.0, + 1047.0, + 1497.0, + 324.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 393.0, + 1404.0, + 393.0, + 1404.0, + 436.0, + 294.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 427.0, + 1144.0, + 427.0, + 1144.0, + 461.0, + 320.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 308.0, + 1404.0, + 308.0, + 1404.0, + 351.0, + 293.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 343.0, + 1277.0, + 343.0, + 1277.0, + 380.0, + 325.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 955.0, + 1405.0, + 955.0, + 1405.0, + 993.0, + 295.0, + 993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 988.0, + 1403.0, + 988.0, + 1403.0, + 1023.0, + 323.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1018.0, + 710.0, + 1018.0, + 710.0, + 1053.0, + 320.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1937.0, + 1404.0, + 1937.0, + 1404.0, + 1980.0, + 294.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2006.0, + 323.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 2003.0, + 818.0, + 2003.0, + 818.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": [ + 300, + 75, + 817, + 75, + 817, + 105, + 300, + 105 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2113, + 836, + 2113 + ], + "score": 0.831 + }, + { + "category_id": 1, + "poly": [ + 293, + 1042, + 1402, + 1042, + 1402, + 1109, + 293, + 1109 + ], + "score": 0.646 + }, + { + "category_id": 1, + "poly": [ + 298, + 1630, + 1404, + 1630, + 1404, + 1726, + 298, + 1726 + ], + "score": 0.644 + }, + { + "category_id": 1, + "poly": [ + 300, + 229, + 1399, + 229, + 1399, + 324, + 300, + 324 + ], + "score": 0.637 + }, + { + "category_id": 1, + "poly": [ + 298, + 1125, + 1401, + 1125, + 1401, + 1222, + 298, + 1222 + ], + "score": 0.611 + }, + { + "category_id": 1, + "poly": [ + 290, + 1548, + 1400, + 1548, + 1400, + 1613, + 290, + 1613 + ], + "score": 0.61 + }, + { + "category_id": 1, + "poly": [ + 296, + 1321, + 1401, + 1321, + 1401, + 1416, + 296, + 1416 + ], + "score": 0.599 + }, + { + "category_id": 1, + "poly": [ + 295, + 1238, + 1399, + 1238, + 1399, + 1305, + 295, + 1305 + ], + "score": 0.587 + }, + { + "category_id": 1, + "poly": [ + 295, + 1744, + 1401, + 1744, + 1401, + 1839, + 295, + 1839 + ], + "score": 0.578 + }, + { + "category_id": 1, + "poly": [ + 298, + 620, + 1398, + 620, + 1398, + 685, + 298, + 685 + ], + "score": 0.575 + }, + { + "category_id": 1, + "poly": [ + 298, + 1434, + 1399, + 1434, + 1399, + 1531, + 298, + 1531 + ], + "score": 0.572 + }, + { + "category_id": 1, + "poly": [ + 298, + 341, + 1401, + 341, + 1401, + 405, + 298, + 405 + ], + "score": 0.572 + }, + { + "category_id": 1, + "poly": [ + 294, + 1858, + 1402, + 1858, + 1402, + 1922, + 294, + 1922 + ], + "score": 0.558 + }, + { + "category_id": 1, + "poly": [ + 299, + 929, + 1399, + 929, + 1399, + 1025, + 299, + 1025 + ], + "score": 0.546 + }, + { + "category_id": 1, + "poly": [ + 295, + 703, + 1402, + 703, + 1402, + 800, + 295, + 800 + ], + "score": 0.542 + }, + { + "category_id": 1, + "poly": [ + 298, + 537, + 1400, + 537, + 1400, + 603, + 298, + 603 + ], + "score": 0.537 + }, + { + "category_id": 1, + "poly": [ + 298, + 816, + 1400, + 816, + 1400, + 912, + 298, + 912 + ], + "score": 0.536 + }, + { + "category_id": 1, + "poly": [ + 302, + 424, + 1398, + 424, + 1398, + 520, + 302, + 520 + ], + "score": 0.52 + }, + { + "category_id": 1, + "poly": [ + 298, + 1942, + 1404, + 1942, + 1404, + 2033, + 298, + 2033 + ], + "score": 0.469 + }, + { + "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, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1043.0, + 1405.0, + 1043.0, + 1405.0, + 1079.0, + 296.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1074.0, + 1405.0, + 1074.0, + 1405.0, + 1111.0, + 322.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1630.0, + 1405.0, + 1630.0, + 1405.0, + 1665.0, + 294.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1661.0, + 558.0, + 1661.0, + 558.0, + 1695.0, + 324.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 1661.0, + 1180.0, + 1661.0, + 1180.0, + 1698.0, + 601.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1663.0, + 1404.0, + 1663.0, + 1404.0, + 1695.0, + 1222.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1692.0, + 611.0, + 1692.0, + 611.0, + 1724.0, + 321.0, + 1724.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": [ + 321.0, + 259.0, + 1404.0, + 259.0, + 1404.0, + 297.0, + 321.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 290.0, + 737.0, + 290.0, + 737.0, + 328.0, + 325.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1125.0, + 1403.0, + 1125.0, + 1403.0, + 1164.0, + 294.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1159.0, + 1403.0, + 1159.0, + 1403.0, + 1193.0, + 323.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1187.0, + 1395.0, + 1187.0, + 1395.0, + 1224.0, + 323.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1550.0, + 1403.0, + 1550.0, + 1403.0, + 1586.0, + 295.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1582.0, + 840.0, + 1582.0, + 840.0, + 1611.0, + 322.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1322.0, + 1405.0, + 1322.0, + 1405.0, + 1356.0, + 295.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1351.0, + 1407.0, + 1351.0, + 1407.0, + 1392.0, + 321.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1386.0, + 505.0, + 1386.0, + 505.0, + 1416.0, + 320.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1239.0, + 1403.0, + 1239.0, + 1403.0, + 1275.0, + 294.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1270.0, + 1326.0, + 1270.0, + 1326.0, + 1307.0, + 323.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1742.0, + 1405.0, + 1742.0, + 1405.0, + 1783.0, + 294.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1777.0, + 1405.0, + 1777.0, + 1405.0, + 1811.0, + 323.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1807.0, + 691.0, + 1807.0, + 691.0, + 1839.0, + 323.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 615.0, + 1403.0, + 615.0, + 1403.0, + 662.0, + 293.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 654.0, + 904.0, + 654.0, + 904.0, + 683.0, + 323.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1436.0, + 1403.0, + 1436.0, + 1403.0, + 1470.0, + 294.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1463.0, + 1405.0, + 1463.0, + 1405.0, + 1506.0, + 322.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1499.0, + 1238.0, + 1499.0, + 1238.0, + 1530.0, + 323.0, + 1530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 338.0, + 1403.0, + 338.0, + 1403.0, + 379.0, + 294.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 372.0, + 513.0, + 372.0, + 513.0, + 406.0, + 319.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1857.0, + 1405.0, + 1857.0, + 1405.0, + 1896.0, + 293.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1889.0, + 653.0, + 1889.0, + 653.0, + 1923.0, + 323.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 928.0, + 1404.0, + 928.0, + 1404.0, + 967.0, + 292.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 964.0, + 1403.0, + 964.0, + 1403.0, + 998.0, + 323.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 993.0, + 809.0, + 993.0, + 809.0, + 1027.0, + 324.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 700.0, + 1406.0, + 700.0, + 1406.0, + 744.0, + 292.0, + 744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 738.0, + 1404.0, + 738.0, + 1404.0, + 769.0, + 324.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 766.0, + 1399.0, + 766.0, + 1399.0, + 801.0, + 322.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 538.0, + 1404.0, + 538.0, + 1404.0, + 574.0, + 294.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 570.0, + 517.0, + 570.0, + 517.0, + 604.0, + 324.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 817.0, + 1404.0, + 817.0, + 1404.0, + 852.0, + 296.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 848.0, + 1405.0, + 848.0, + 1405.0, + 881.0, + 322.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 876.0, + 937.0, + 876.0, + 937.0, + 915.0, + 323.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 423.0, + 1403.0, + 423.0, + 1403.0, + 463.0, + 296.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 457.0, + 1404.0, + 457.0, + 1404.0, + 492.0, + 323.0, + 492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 488.0, + 1302.0, + 488.0, + 1302.0, + 522.0, + 323.0, + 522.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": [ + 322.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2007.0, + 322.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1999.0, + 399.0, + 1999.0, + 399.0, + 2035.0, + 320.0, + 2035.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.833 + }, + { + "category_id": 2, + "poly": [ + 300, + 74, + 817, + 74, + 817, + 105, + 300, + 105 + ], + "score": 0.821 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 1401, + 228, + 1401, + 323, + 298, + 323 + ], + "score": 0.589 + }, + { + "category_id": 1, + "poly": [ + 294, + 508, + 1402, + 508, + 1402, + 573, + 294, + 573 + ], + "score": 0.481 + }, + { + "category_id": 1, + "poly": [ + 297, + 342, + 1398, + 342, + 1398, + 406, + 297, + 406 + ], + "score": 0.468 + }, + { + "category_id": 1, + "poly": [ + 296, + 425, + 1401, + 425, + 1401, + 489, + 296, + 489 + ], + "score": 0.453 + }, + { + "category_id": 1, + "poly": [ + 294, + 592, + 1403, + 592, + 1403, + 656, + 294, + 656 + ], + "score": 0.451 + }, + { + "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": [ + 296.0, + 72.0, + 816.0, + 72.0, + 816.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 226.0, + 1405.0, + 226.0, + 1405.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 260.0, + 1403.0, + 260.0, + 1403.0, + 296.0, + 321.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 288.0, + 398.0, + 288.0, + 398.0, + 325.0, + 321.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 506.0, + 1404.0, + 506.0, + 1404.0, + 548.0, + 293.0, + 548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 539.0, + 989.0, + 539.0, + 989.0, + 574.0, + 321.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 341.0, + 1402.0, + 341.0, + 1402.0, + 380.0, + 293.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 371.0, + 606.0, + 371.0, + 606.0, + 407.0, + 324.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 425.0, + 827.0, + 425.0, + 827.0, + 460.0, + 294.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 425.0, + 1194.0, + 425.0, + 1194.0, + 461.0, + 870.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 423.0, + 1405.0, + 423.0, + 1405.0, + 464.0, + 1215.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 455.0, + 611.0, + 455.0, + 611.0, + 489.0, + 321.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 591.0, + 1405.0, + 591.0, + 1405.0, + 630.0, + 294.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 623.0, + 1375.0, + 623.0, + 1375.0, + 657.0, + 321.0, + 657.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1881, + 1403, + 1881, + 1403, + 2035, + 299, + 2035 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1712, + 1404, + 1712, + 1404, + 1866, + 298, + 1866 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 464, + 659, + 1234, + 659, + 1234, + 1273, + 464, + 1273 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 408, + 139, + 1285, + 139, + 1285, + 531, + 408, + 531 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 299, + 1495, + 1400, + 1495, + 1400, + 1588, + 299, + 1588 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 298, + 1604, + 1398, + 1604, + 1398, + 1698, + 298, + 1698 + ], + "score": 0.958 + }, + { + "category_id": 4, + "poly": [ + 291, + 1300, + 1403, + 1300, + 1403, + 1362, + 291, + 1362 + ], + "score": 0.935 + }, + { + "category_id": 4, + "poly": [ + 292, + 558, + 1399, + 558, + 1399, + 621, + 292, + 621 + ], + "score": 0.926 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 815, + 76, + 815, + 104, + 298, + 104 + ], + "score": 0.885 + }, + { + "category_id": 0, + "poly": [ + 299, + 1424, + 1231, + 1424, + 1231, + 1459, + 299, + 1459 + ], + "score": 0.872 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.853 + }, + { + "category_id": 13, + "poly": [ + 804, + 1667, + 857, + 1667, + 857, + 1696, + 804, + 1696 + ], + "score": 0.85, + "latex": "\\times 2 5" + }, + { + "category_id": 13, + "poly": [ + 297, + 1558, + 360, + 1558, + 360, + 1588, + 297, + 1588 + ], + "score": 0.84, + "latex": "2 { - } 5 \\times" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 663.0, + 648.0, + 663.0, + 648.0, + 679.0, + 559.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 663.0, + 901.0, + 663.0, + 901.0, + 679.0, + 814.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 663.0, + 1158.0, + 663.0, + 1158.0, + 679.0, + 1065.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 673.0, + 494.0, + 673.0, + 494.0, + 685.0, + 479.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 671.0, + 749.0, + 671.0, + 749.0, + 686.0, + 732.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 671.0, + 1004.0, + 671.0, + 1004.0, + 686.0, + 987.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 707.0, + 494.0, + 707.0, + 494.0, + 807.0, + 469.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 706.0, + 748.0, + 706.0, + 748.0, + 809.0, + 721.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 706.0, + 1002.0, + 706.0, + 1002.0, + 809.0, + 975.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 771.0, + 492.0, + 771.0, + 492.0, + 781.0, + 484.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 771.0, + 746.0, + 771.0, + 746.0, + 781.0, + 738.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 771.0, + 1001.0, + 771.0, + 1001.0, + 781.0, + 992.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 776.0, + 658.0, + 776.0, + 658.0, + 794.0, + 627.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 776.0, + 911.0, + 776.0, + 911.0, + 795.0, + 881.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 776.0, + 1165.0, + 776.0, + 1165.0, + 794.0, + 1136.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 789.0, + 670.0, + 789.0, + 670.0, + 809.0, + 626.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 790.0, + 922.0, + 790.0, + 922.0, + 807.0, + 880.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 789.0, + 1178.0, + 789.0, + 1178.0, + 809.0, + 1134.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 805.0, + 492.0, + 805.0, + 492.0, + 814.0, + 484.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 803.0, + 708.0, + 803.0, + 708.0, + 824.0, + 627.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 805.0, + 746.0, + 805.0, + 746.0, + 814.0, + 738.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 803.0, + 962.0, + 803.0, + 962.0, + 825.0, + 881.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 805.0, + 1001.0, + 805.0, + 1001.0, + 814.0, + 992.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 803.0, + 1216.0, + 803.0, + 1216.0, + 825.0, + 1134.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 817.0, + 659.0, + 817.0, + 659.0, + 838.0, + 625.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 817.0, + 913.0, + 817.0, + 913.0, + 838.0, + 879.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 817.0, + 1167.0, + 817.0, + 1167.0, + 838.0, + 1134.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 837.0, + 493.0, + 837.0, + 493.0, + 846.0, + 484.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 837.0, + 746.0, + 837.0, + 746.0, + 846.0, + 738.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 835.0, + 1003.0, + 835.0, + 1003.0, + 847.0, + 991.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 844.0, + 500.0, + 844.0, + 500.0, + 854.0, + 491.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 842.0, + 542.0, + 842.0, + 542.0, + 857.0, + 521.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 842.0, + 580.0, + 842.0, + 580.0, + 856.0, + 556.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 842.0, + 615.0, + 842.0, + 615.0, + 856.0, + 591.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 842.0, + 652.0, + 842.0, + 652.0, + 857.0, + 626.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 842.0, + 688.0, + 842.0, + 688.0, + 857.0, + 663.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 842.0, + 723.0, + 842.0, + 723.0, + 857.0, + 699.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 843.0, + 755.0, + 843.0, + 755.0, + 855.0, + 743.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 842.0, + 796.0, + 842.0, + 796.0, + 857.0, + 774.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 842.0, + 834.0, + 842.0, + 834.0, + 856.0, + 811.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 845.0, + 842.0, + 869.0, + 842.0, + 869.0, + 856.0, + 845.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 842.0, + 905.0, + 842.0, + 905.0, + 856.0, + 880.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 842.0, + 942.0, + 842.0, + 942.0, + 856.0, + 917.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 842.0, + 978.0, + 842.0, + 978.0, + 857.0, + 953.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 844.0, + 1008.0, + 844.0, + 1008.0, + 854.0, + 999.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 842.0, + 1049.0, + 842.0, + 1049.0, + 856.0, + 1029.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 842.0, + 1088.0, + 842.0, + 1088.0, + 856.0, + 1064.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 842.0, + 1124.0, + 842.0, + 1124.0, + 856.0, + 1099.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 842.0, + 1159.0, + 842.0, + 1159.0, + 856.0, + 1134.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 842.0, + 1195.0, + 842.0, + 1195.0, + 857.0, + 1171.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1207.0, + 842.0, + 1232.0, + 842.0, + 1232.0, + 857.0, + 1207.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 849.0, + 651.0, + 849.0, + 651.0, + 869.0, + 556.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 849.0, + 905.0, + 849.0, + 905.0, + 869.0, + 810.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 849.0, + 1158.0, + 849.0, + 1158.0, + 869.0, + 1064.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 868.0, + 640.0, + 868.0, + 640.0, + 881.0, + 567.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 866.0, + 904.0, + 866.0, + 904.0, + 882.0, + 811.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 866.0, + 1158.0, + 866.0, + 1158.0, + 882.0, + 1064.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 876.0, + 494.0, + 876.0, + 494.0, + 888.0, + 480.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 881.0, + 609.0, + 881.0, + 609.0, + 891.0, + 601.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 875.0, + 747.0, + 875.0, + 747.0, + 888.0, + 734.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 875.0, + 1002.0, + 875.0, + 1002.0, + 888.0, + 988.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 910.0, + 494.0, + 910.0, + 494.0, + 1011.0, + 467.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 909.0, + 748.0, + 909.0, + 748.0, + 1012.0, + 720.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 909.0, + 1002.0, + 909.0, + 1002.0, + 1012.0, + 975.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 973.0, + 492.0, + 973.0, + 492.0, + 984.0, + 483.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 974.0, + 746.0, + 974.0, + 746.0, + 984.0, + 738.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 974.0, + 1001.0, + 974.0, + 1001.0, + 984.0, + 992.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 979.0, + 658.0, + 979.0, + 658.0, + 996.0, + 627.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 980.0, + 910.0, + 980.0, + 910.0, + 995.0, + 880.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 979.0, + 1165.0, + 979.0, + 1165.0, + 996.0, + 1136.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 991.0, + 670.0, + 991.0, + 670.0, + 1012.0, + 626.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 991.0, + 924.0, + 991.0, + 924.0, + 1012.0, + 880.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 991.0, + 1178.0, + 991.0, + 1178.0, + 1012.0, + 1134.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1007.0, + 493.0, + 1007.0, + 493.0, + 1017.0, + 483.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1005.0, + 708.0, + 1005.0, + 708.0, + 1027.0, + 627.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1008.0, + 746.0, + 1008.0, + 746.0, + 1017.0, + 738.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 1005.0, + 961.0, + 1005.0, + 961.0, + 1027.0, + 881.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 1007.0, + 1001.0, + 1007.0, + 1001.0, + 1017.0, + 992.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1007.0, + 1216.0, + 1007.0, + 1216.0, + 1026.0, + 1135.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1020.0, + 660.0, + 1020.0, + 660.0, + 1041.0, + 625.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1020.0, + 913.0, + 1020.0, + 913.0, + 1041.0, + 879.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1020.0, + 1167.0, + 1020.0, + 1167.0, + 1041.0, + 1134.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1040.0, + 500.0, + 1040.0, + 500.0, + 1057.0, + 483.0, + 1057.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 1045.0, + 542.0, + 1045.0, + 542.0, + 1060.0, + 521.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1045.0, + 580.0, + 1045.0, + 580.0, + 1059.0, + 556.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1045.0, + 615.0, + 1045.0, + 615.0, + 1059.0, + 591.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 1045.0, + 652.0, + 1045.0, + 652.0, + 1060.0, + 626.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 1045.0, + 688.0, + 1045.0, + 688.0, + 1060.0, + 663.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1045.0, + 724.0, + 1045.0, + 724.0, + 1060.0, + 699.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1039.0, + 755.0, + 1039.0, + 755.0, + 1058.0, + 738.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1045.0, + 796.0, + 1045.0, + 796.0, + 1060.0, + 774.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 1045.0, + 834.0, + 1045.0, + 834.0, + 1059.0, + 811.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 845.0, + 1045.0, + 869.0, + 1045.0, + 869.0, + 1059.0, + 845.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1045.0, + 905.0, + 1045.0, + 905.0, + 1059.0, + 880.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1045.0, + 942.0, + 1045.0, + 942.0, + 1060.0, + 916.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 1045.0, + 978.0, + 1045.0, + 978.0, + 1060.0, + 953.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 1038.0, + 1009.0, + 1038.0, + 1009.0, + 1058.0, + 991.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 1045.0, + 1050.0, + 1045.0, + 1050.0, + 1059.0, + 1028.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1045.0, + 1088.0, + 1045.0, + 1088.0, + 1059.0, + 1064.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1045.0, + 1124.0, + 1045.0, + 1124.0, + 1059.0, + 1100.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1045.0, + 1159.0, + 1045.0, + 1159.0, + 1059.0, + 1134.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 1043.0, + 1197.0, + 1043.0, + 1197.0, + 1061.0, + 1170.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1207.0, + 1045.0, + 1232.0, + 1045.0, + 1232.0, + 1059.0, + 1207.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 555.0, + 1052.0, + 651.0, + 1052.0, + 651.0, + 1071.0, + 555.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 1052.0, + 905.0, + 1052.0, + 905.0, + 1071.0, + 810.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1052.0, + 1158.0, + 1052.0, + 1158.0, + 1071.0, + 1064.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 1068.0, + 653.0, + 1068.0, + 653.0, + 1085.0, + 554.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1068.0, + 897.0, + 1068.0, + 897.0, + 1085.0, + 818.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1068.0, + 1155.0, + 1068.0, + 1155.0, + 1085.0, + 1067.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 1078.0, + 494.0, + 1078.0, + 494.0, + 1091.0, + 479.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 1077.0, + 749.0, + 1077.0, + 749.0, + 1092.0, + 732.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 1077.0, + 1004.0, + 1077.0, + 1004.0, + 1092.0, + 987.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 1096.0, + 1092.0, + 1096.0, + 1092.0, + 1106.0, + 1085.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 1112.0, + 493.0, + 1112.0, + 493.0, + 1122.0, + 484.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1112.0, + 746.0, + 1112.0, + 746.0, + 1122.0, + 738.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 1112.0, + 1001.0, + 1112.0, + 1001.0, + 1122.0, + 992.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 1119.0, + 494.0, + 1119.0, + 494.0, + 1212.0, + 467.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 722.0, + 1118.0, + 747.0, + 1118.0, + 747.0, + 1212.0, + 722.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1117.0, + 1002.0, + 1117.0, + 1002.0, + 1213.0, + 975.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 1177.0, + 493.0, + 1177.0, + 493.0, + 1187.0, + 484.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 1180.0, + 659.0, + 1180.0, + 659.0, + 1201.0, + 626.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1177.0, + 746.0, + 1177.0, + 746.0, + 1187.0, + 738.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1180.0, + 912.0, + 1180.0, + 912.0, + 1201.0, + 880.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 1175.0, + 1002.0, + 1175.0, + 1002.0, + 1188.0, + 991.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 501.0, + 1202.0, + 509.0, + 1202.0, + 509.0, + 1212.0, + 501.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 1194.0, + 670.0, + 1194.0, + 670.0, + 1214.0, + 626.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1194.0, + 924.0, + 1194.0, + 924.0, + 1214.0, + 880.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1196.0, + 1165.0, + 1196.0, + 1165.0, + 1213.0, + 1136.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 1209.0, + 493.0, + 1209.0, + 493.0, + 1220.0, + 484.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1208.0, + 708.0, + 1208.0, + 708.0, + 1231.0, + 627.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1210.0, + 746.0, + 1210.0, + 746.0, + 1220.0, + 738.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 1209.0, + 961.0, + 1209.0, + 961.0, + 1229.0, + 881.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 1210.0, + 1001.0, + 1210.0, + 1001.0, + 1220.0, + 992.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1208.0, + 1216.0, + 1208.0, + 1216.0, + 1231.0, + 1134.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1223.0, + 659.0, + 1223.0, + 659.0, + 1244.0, + 625.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1223.0, + 913.0, + 1223.0, + 913.0, + 1244.0, + 879.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1220.0, + 1168.0, + 1220.0, + 1168.0, + 1245.0, + 1134.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1242.0, + 493.0, + 1242.0, + 493.0, + 1252.0, + 483.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1242.0, + 747.0, + 1242.0, + 747.0, + 1252.0, + 738.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 1241.0, + 1005.0, + 1241.0, + 1005.0, + 1253.0, + 991.0, + 1253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 1249.0, + 501.0, + 1249.0, + 501.0, + 1261.0, + 489.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 1247.0, + 542.0, + 1247.0, + 542.0, + 1262.0, + 521.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1248.0, + 580.0, + 1248.0, + 580.0, + 1262.0, + 556.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1248.0, + 615.0, + 1248.0, + 615.0, + 1262.0, + 591.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 1247.0, + 652.0, + 1247.0, + 652.0, + 1262.0, + 626.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 1247.0, + 688.0, + 1247.0, + 688.0, + 1262.0, + 663.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1248.0, + 723.0, + 1248.0, + 723.0, + 1262.0, + 699.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 1249.0, + 755.0, + 1249.0, + 755.0, + 1261.0, + 743.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1248.0, + 796.0, + 1248.0, + 796.0, + 1262.0, + 774.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 1248.0, + 834.0, + 1248.0, + 834.0, + 1262.0, + 811.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 1248.0, + 869.0, + 1248.0, + 869.0, + 1262.0, + 846.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1248.0, + 905.0, + 1248.0, + 905.0, + 1262.0, + 880.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 1248.0, + 942.0, + 1248.0, + 942.0, + 1262.0, + 917.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 1248.0, + 978.0, + 1248.0, + 978.0, + 1262.0, + 953.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 1249.0, + 1009.0, + 1249.0, + 1009.0, + 1261.0, + 996.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 1248.0, + 1049.0, + 1248.0, + 1049.0, + 1262.0, + 1029.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1248.0, + 1089.0, + 1248.0, + 1089.0, + 1262.0, + 1064.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 1248.0, + 1124.0, + 1248.0, + 1124.0, + 1262.0, + 1099.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1248.0, + 1159.0, + 1248.0, + 1159.0, + 1262.0, + 1134.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 1248.0, + 1195.0, + 1248.0, + 1195.0, + 1262.0, + 1171.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1207.0, + 1248.0, + 1232.0, + 1248.0, + 1232.0, + 1262.0, + 1207.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 1256.0, + 651.0, + 1256.0, + 651.0, + 1272.0, + 557.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 1256.0, + 904.0, + 1256.0, + 904.0, + 1272.0, + 811.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1255.0, + 1158.0, + 1255.0, + 1158.0, + 1273.0, + 1064.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.75, + 793.0, + 1030.75, + 793.0, + 1030.75, + 819.5, + 1023.75, + 819.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 795.0, + 548.0, + 795.0, + 548.0, + 806.5, + 514.0, + 806.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 796.0, + 801.0, + 796.0, + 801.0, + 814.5, + 752.0, + 814.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 930.0, + 559.0, + 930.0, + 559.0, + 935.5, + 536.0, + 935.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.25, + 972.5, + 536.25, + 972.5, + 536.25, + 981.5, + 500.25, + 981.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.25, + 1209.0, + 1045.25, + 1209.0, + 1045.25, + 1226.5, + 992.25, + 1226.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 139.0, + 687.0, + 139.0, + 687.0, + 170.0, + 602.0, + 170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 140.0, + 1132.0, + 140.0, + 1132.0, + 170.0, + 1039.0, + 170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 158.0, + 458.0, + 158.0, + 458.0, + 183.0, + 429.0, + 183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 156.0, + 899.0, + 156.0, + 899.0, + 184.0, + 869.0, + 184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 197.0, + 735.0, + 197.0, + 735.0, + 205.0, + 724.0, + 205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 215.0, + 434.0, + 215.0, + 434.0, + 439.0, + 409.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 215.0, + 877.0, + 215.0, + 877.0, + 439.0, + 851.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 219.0, + 456.0, + 219.0, + 456.0, + 242.0, + 436.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 220.0, + 895.0, + 220.0, + 895.0, + 241.0, + 879.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 226.0, + 1146.0, + 226.0, + 1146.0, + 235.0, + 1138.0, + 235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 281.0, + 455.0, + 281.0, + 455.0, + 300.0, + 438.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 281.0, + 895.0, + 281.0, + 895.0, + 300.0, + 879.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 286.0, + 1086.0, + 286.0, + 1086.0, + 296.0, + 1077.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 341.0, + 455.0, + 341.0, + 455.0, + 360.0, + 438.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 341.0, + 895.0, + 341.0, + 895.0, + 360.0, + 879.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 379.0, + 819.0, + 379.0, + 819.0, + 408.0, + 609.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 379.0, + 1261.0, + 379.0, + 1261.0, + 408.0, + 1050.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 400.0, + 455.0, + 400.0, + 455.0, + 421.0, + 438.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 398.0, + 782.0, + 398.0, + 782.0, + 434.0, + 607.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 400.0, + 895.0, + 400.0, + 895.0, + 420.0, + 879.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 398.0, + 1222.0, + 398.0, + 1222.0, + 434.0, + 1048.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 423.0, + 736.0, + 423.0, + 736.0, + 453.0, + 608.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 424.0, + 1176.0, + 424.0, + 1176.0, + 454.0, + 1048.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 461.0, + 455.0, + 461.0, + 455.0, + 480.0, + 439.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 448.0, + 816.0, + 448.0, + 816.0, + 476.0, + 607.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 460.0, + 895.0, + 460.0, + 895.0, + 481.0, + 879.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 448.0, + 1257.0, + 448.0, + 1257.0, + 476.0, + 1048.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 490.0, + 473.0, + 490.0, + 473.0, + 511.0, + 452.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 487.0, + 850.0, + 487.0, + 850.0, + 512.0, + 484.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 490.0, + 913.0, + 490.0, + 913.0, + 511.0, + 891.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 487.0, + 1290.0, + 487.0, + 1290.0, + 512.0, + 926.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 506.0, + 755.0, + 506.0, + 755.0, + 533.0, + 532.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 506.0, + 1197.0, + 506.0, + 1197.0, + 534.0, + 974.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 185.0, + 1070.0, + 185.0, + 1070.0, + 191.5, + 1048.0, + 191.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 222.5, + 718.0, + 222.5, + 718.0, + 232.5, + 687.0, + 232.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 255.5, + 679.0, + 255.5, + 679.0, + 264.0, + 661.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 257.0, + 1118.0, + 257.0, + 1118.0, + 264.0, + 1101.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 246.5, + 986.0, + 246.5, + 986.0, + 254.5, + 909.0, + 254.5 + ], + "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": [ + 294.0, + 1328.0, + 529.0, + 1328.0, + 529.0, + 1365.0, + 294.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 554.0, + 1404.0, + 554.0, + 1404.0, + 596.0, + 292.0, + 596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 588.0, + 941.0, + 588.0, + 941.0, + 624.0, + 295.0, + 624.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, + 1420.0, + 1239.0, + 1420.0, + 1239.0, + 1463.0, + 292.0, + 1463.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, + 1879.0, + 1407.0, + 1879.0, + 1407.0, + 1917.0, + 294.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1908.0, + 1405.0, + 1908.0, + 1405.0, + 1949.0, + 294.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1404.0, + 1942.0, + 1404.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 1226.0, + 2003.0, + 1226.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1710.0, + 1405.0, + 1710.0, + 1405.0, + 1748.0, + 296.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1741.0, + 1406.0, + 1741.0, + 1406.0, + 1778.0, + 294.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1772.0, + 1403.0, + 1772.0, + 1403.0, + 1809.0, + 295.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1801.0, + 1405.0, + 1801.0, + 1405.0, + 1841.0, + 292.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1830.0, + 447.0, + 1830.0, + 447.0, + 1875.0, + 292.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1494.0, + 1405.0, + 1494.0, + 1405.0, + 1532.0, + 295.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1526.0, + 1404.0, + 1526.0, + 1404.0, + 1562.0, + 294.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1558.0, + 812.0, + 1558.0, + 812.0, + 1592.0, + 361.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1604.0, + 1403.0, + 1604.0, + 1403.0, + 1641.0, + 295.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1634.0, + 1404.0, + 1634.0, + 1404.0, + 1672.0, + 294.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1667.0, + 803.0, + 1667.0, + 803.0, + 1701.0, + 295.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1667.0, + 1310.0, + 1667.0, + 1310.0, + 1701.0, + 858.0, + 1701.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1510, + 1404, + 1510, + 1404, + 1879, + 297, + 1879 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 299, + 1404, + 299, + 1404, + 516, + 297, + 516 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1287, + 1404, + 1287, + 1404, + 1474, + 297, + 1474 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 553, + 1404, + 553, + 1404, + 678, + 298, + 678 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 811, + 1403, + 811, + 1403, + 905, + 299, + 905 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 300, + 919, + 1401, + 919, + 1401, + 1042, + 300, + 1042 + ], + "score": 0.973 + }, + { + "category_id": 2, + "poly": [ + 331, + 1914, + 1244, + 1914, + 1244, + 2035, + 331, + 2035 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 551, + 697, + 1149, + 697, + 1149, + 787, + 551, + 787 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 463, + 1205, + 1235, + 1205, + 1235, + 1269, + 463, + 1269 + ], + "score": 0.934 + }, + { + "category_id": 8, + "poly": [ + 498, + 1111, + 1199, + 1111, + 1199, + 1199, + 498, + 1199 + ], + "score": 0.929 + }, + { + "category_id": 8, + "poly": [ + 667, + 1064, + 1032, + 1064, + 1032, + 1102, + 667, + 1102 + ], + "score": 0.92 + }, + { + "category_id": 9, + "poly": [ + 1366, + 727, + 1400, + 727, + 1400, + 756, + 1366, + 756 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.886 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1069, + 1400, + 1069, + 1400, + 1099, + 1366, + 1099 + ], + "score": 0.871 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1224, + 1400, + 1224, + 1400, + 1253, + 1366, + 1253 + ], + "score": 0.87 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.865 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1140, + 1400, + 1140, + 1400, + 1170, + 1365, + 1170 + ], + "score": 0.864 + }, + { + "category_id": 0, + "poly": [ + 302, + 226, + 710, + 226, + 710, + 261, + 302, + 261 + ], + "score": 0.844 + }, + { + "category_id": 13, + "poly": [ + 374, + 810, + 527, + 810, + 527, + 847, + 374, + 847 + ], + "score": 0.95, + "latex": "\\{ ( x _ { i } , y _ { i } ^ { * } ) \\} _ { i = 1 } ^ { N }" + }, + { + "category_id": 13, + "poly": [ + 712, + 1378, + 874, + 1378, + 874, + 1413, + 712, + 1413 + ], + "score": 0.94, + "latex": "\\sigma ^ { 2 } = ( N \\lambda ) ^ { - 1 }" + }, + { + "category_id": 14, + "poly": [ + 550, + 693, + 1148, + 693, + 1148, + 789, + 550, + 789 + ], + "score": 0.94, + "latex": "L ( w ) = - \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\log \\hat { p } ( y _ { i } ^ { * } \\mid x _ { i } , w ) + \\frac { \\lambda } { 2 } \\| w \\| ^ { 2 } \\operatorname* { m i n } _ { w } ," + }, + { + "category_id": 13, + "poly": [ + 561, + 844, + 686, + 844, + 686, + 876, + 561, + 876 + ], + "score": 0.93, + "latex": "\\hat { p } ( j | x _ { i } , w )" + }, + { + "category_id": 13, + "poly": [ + 875, + 920, + 1005, + 920, + 1005, + 954, + 875, + 954 + ], + "score": 0.93, + "latex": "p ( y ^ { * } \\mid x , w )" + }, + { + "category_id": 13, + "poly": [ + 1095, + 951, + 1153, + 951, + 1153, + 984, + 1095, + 984 + ], + "score": 0.91, + "latex": "p ( w )" + }, + { + "category_id": 13, + "poly": [ + 859, + 1849, + 927, + 1849, + 927, + 1880, + 859, + 1880 + ], + "score": 0.91, + "latex": "p = 0" + }, + { + "category_id": 14, + "poly": [ + 464, + 1058, + 1233, + 1058, + 1233, + 1274, + 464, + 1274 + ], + "score": 0.91, + "latex": "\\begin{array} { c } { { p ( y ^ { * } , w \\mid x ) = p ( y ^ { * } \\mid x , w ) p ( w ) , } } \\\\ { { \\displaystyle \\log p ( y ^ { * } \\mid x , w ) = \\log \\prod _ { i = 1 } ^ { N } p ( y _ { i } ^ { * } \\mid x _ { i } , w ) = \\sum _ { i = 1 } ^ { N } \\log \\hat { p } ( y _ { i } ^ { * } \\mid x _ { i } , w ) , } } \\\\ { { \\displaystyle \\log p ( w ) = \\frac { - N \\lambda } { 2 } \\| w \\| ^ { 2 } + \\mathrm { c o n s t } \\iff p ( w ) = \\mathcal { N } \\left( w \\mid 0 , ( N \\lambda ) ^ { - 1 } I \\right) } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 1818, + 393, + 1818, + 393, + 1849, + 297, + 1849 + ], + "score": 0.91, + "latex": "p = 0 . 3" + }, + { + "category_id": 13, + "poly": [ + 1271, + 1544, + 1351, + 1544, + 1351, + 1575, + 1271, + 1575 + ], + "score": 0.9, + "latex": "( l r _ { i n i t } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 952, + 331, + 952, + 331, + 981, + 298, + 981 + ], + "score": 0.87, + "latex": "L _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 936, + 818, + 965, + 818, + 965, + 843, + 936, + 843 + ], + "score": 0.85, + "latex": "x _ { i }" + }, + { + "category_id": 13, + "poly": [ + 816, + 818, + 843, + 818, + 843, + 840, + 816, + 840 + ], + "score": 0.85, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 474, + 876, + 490, + 876, + 490, + 906, + 474, + 906 + ], + "score": 0.83, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 781, + 880, + 808, + 880, + 808, + 904, + 781, + 904 + ], + "score": 0.82, + "latex": "x _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1202, + 1381, + 1230, + 1381, + 1230, + 1408, + 1202, + 1408 + ], + "score": 0.81, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 434, + 1412, + 454, + 1412, + 454, + 1438, + 434, + 1438 + ], + "score": 0.77, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1377, + 849, + 1401, + 849, + 1401, + 869, + 1377, + 869 + ], + "score": 0.76, + "latex": "w" + }, + { + "category_id": 13, + "poly": [ + 1165, + 2007, + 1197, + 2007, + 1197, + 2031, + 1165, + 2031 + ], + "score": 0.73, + "latex": "= 4" + }, + { + "category_id": 13, + "poly": [ + 1268, + 814, + 1298, + 814, + 1298, + 846, + 1268, + 846 + ], + "score": 0.72, + "latex": "y _ { i } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1311, + 814, + 1331, + 814, + 1331, + 840, + 1311, + 840 + ], + "score": 0.63, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1268, + 813, + 1332, + 813, + 1332, + 846, + 1268, + 846 + ], + "score": 0.29, + "latex": "y _ { i } ^ { * } , \\lambda" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1907.0, + 845.0, + 1907.0, + 845.0, + 1950.0, + 329.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1936.0, + 950.0, + 1936.0, + 950.0, + 1984.0, + 328.0, + 1984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1968.0, + 1247.0, + 1968.0, + 1247.0, + 2010.0, + 328.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 2000.0, + 1164.0, + 2000.0, + 1164.0, + 2039.0, + 330.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 2000.0, + 1241.0, + 2000.0, + 1241.0, + 2039.0, + 1198.0, + 2039.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": [ + 832.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 224.0, + 713.0, + 224.0, + 713.0, + 269.0, + 293.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1511.0, + 1405.0, + 1511.0, + 1405.0, + 1545.0, + 297.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1544.0, + 1270.0, + 1544.0, + 1270.0, + 1578.0, + 295.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1544.0, + 1405.0, + 1544.0, + 1405.0, + 1578.0, + 1352.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1570.0, + 1405.0, + 1570.0, + 1405.0, + 1611.0, + 295.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1607.0, + 1405.0, + 1607.0, + 1405.0, + 1637.0, + 295.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1635.0, + 1404.0, + 1635.0, + 1404.0, + 1669.0, + 294.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1665.0, + 1404.0, + 1665.0, + 1404.0, + 1699.0, + 292.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1696.0, + 1405.0, + 1696.0, + 1405.0, + 1730.0, + 295.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1726.0, + 1404.0, + 1726.0, + 1404.0, + 1760.0, + 295.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1754.0, + 1404.0, + 1754.0, + 1404.0, + 1791.0, + 294.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1786.0, + 1404.0, + 1786.0, + 1404.0, + 1820.0, + 295.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1817.0, + 296.0, + 1817.0, + 296.0, + 1854.0, + 292.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1817.0, + 1406.0, + 1817.0, + 1406.0, + 1854.0, + 394.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1846.0, + 858.0, + 1846.0, + 858.0, + 1885.0, + 294.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1846.0, + 1405.0, + 1846.0, + 1405.0, + 1885.0, + 928.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 301.0, + 1405.0, + 301.0, + 1405.0, + 336.0, + 296.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 330.0, + 1405.0, + 330.0, + 1405.0, + 365.0, + 292.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 362.0, + 1406.0, + 362.0, + 1406.0, + 396.0, + 294.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 386.0, + 1406.0, + 386.0, + 1406.0, + 431.0, + 291.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 421.0, + 1404.0, + 421.0, + 1404.0, + 458.0, + 292.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 453.0, + 1404.0, + 453.0, + 1404.0, + 488.0, + 295.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 483.0, + 999.0, + 483.0, + 999.0, + 518.0, + 294.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1287.0, + 1402.0, + 1287.0, + 1402.0, + 1323.0, + 295.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1318.0, + 1405.0, + 1318.0, + 1405.0, + 1354.0, + 295.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1347.0, + 1402.0, + 1347.0, + 1402.0, + 1384.0, + 295.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1375.0, + 711.0, + 1375.0, + 711.0, + 1415.0, + 294.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1375.0, + 1201.0, + 1375.0, + 1201.0, + 1415.0, + 875.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 1375.0, + 1406.0, + 1375.0, + 1406.0, + 1415.0, + 1231.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1409.0, + 433.0, + 1409.0, + 433.0, + 1445.0, + 294.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 1409.0, + 1404.0, + 1409.0, + 1404.0, + 1445.0, + 455.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1442.0, + 502.0, + 1442.0, + 502.0, + 1475.0, + 295.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 556.0, + 1405.0, + 556.0, + 1405.0, + 589.0, + 296.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 586.0, + 1404.0, + 586.0, + 1404.0, + 619.0, + 293.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 617.0, + 1405.0, + 617.0, + 1405.0, + 651.0, + 293.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 648.0, + 508.0, + 648.0, + 508.0, + 679.0, + 296.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 806.0, + 373.0, + 806.0, + 373.0, + 852.0, + 293.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 806.0, + 815.0, + 806.0, + 815.0, + 852.0, + 528.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 806.0, + 935.0, + 806.0, + 935.0, + 852.0, + 844.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 806.0, + 1267.0, + 806.0, + 1267.0, + 852.0, + 966.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 806.0, + 1407.0, + 806.0, + 1407.0, + 852.0, + 1333.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 843.0, + 560.0, + 843.0, + 560.0, + 877.0, + 297.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 843.0, + 1376.0, + 843.0, + 1376.0, + 877.0, + 687.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 873.0, + 473.0, + 873.0, + 473.0, + 910.0, + 294.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 873.0, + 780.0, + 873.0, + 780.0, + 910.0, + 491.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 873.0, + 822.0, + 873.0, + 822.0, + 910.0, + 809.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 918.0, + 874.0, + 918.0, + 874.0, + 956.0, + 294.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 918.0, + 1406.0, + 918.0, + 1406.0, + 956.0, + 1006.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 951.0, + 1094.0, + 951.0, + 1094.0, + 984.0, + 332.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 951.0, + 1403.0, + 951.0, + 1403.0, + 984.0, + 1154.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 979.0, + 1406.0, + 979.0, + 1406.0, + 1018.0, + 293.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1010.0, + 384.0, + 1010.0, + 384.0, + 1044.0, + 293.0, + 1044.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1213, + 1404, + 1213, + 1404, + 1642, + 297, + 1642 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 296, + 708, + 1405, + 708, + 1405, + 958, + 296, + 958 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 993, + 1404, + 993, + 1404, + 1178, + 297, + 1178 + ], + "score": 0.978 + }, + { + "category_id": 5, + "poly": [ + 620, + 224, + 1079, + 224, + 1079, + 412, + 620, + 412 + ], + "score": 0.977, + "html": "
Modellrinit epochs wd
VGG0.05 4005e-4
PreResNet1100.1 3003e-4
PreResNet1640.1 3003e-4
WideResNet28x10 0.13005e-4
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1678, + 1404, + 1678, + 1404, + 1804, + 298, + 1804 + ], + "score": 0.975 + }, + { + "category_id": 2, + "poly": [ + 327, + 1944, + 1199, + 1944, + 1199, + 2035, + 327, + 2035 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 295, + 528, + 1054, + 528, + 1054, + 561, + 295, + 561 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 817, + 75, + 817, + 105, + 299, + 105 + ], + "score": 0.902 + }, + { + "category_id": 9, + "poly": [ + 1357, + 622, + 1400, + 622, + 1400, + 650, + 1357, + 650 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1824, + 1400, + 1824, + 1400, + 1855, + 1352, + 1855 + ], + "score": 0.876 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1881, + 1400, + 1881, + 1400, + 1911, + 1352, + 1911 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.866 + }, + { + "category_id": 8, + "poly": [ + 527, + 1820, + 1172, + 1820, + 1172, + 1864, + 527, + 1864 + ], + "score": 0.858 + }, + { + "category_id": 8, + "poly": [ + 387, + 582, + 1309, + 582, + 1309, + 689, + 387, + 689 + ], + "score": 0.852 + }, + { + "category_id": 6, + "poly": [ + 376, + 434, + 1315, + 434, + 1315, + 467, + 376, + 467 + ], + "score": 0.808 + }, + { + "category_id": 8, + "poly": [ + 357, + 1875, + 1286, + 1875, + 1286, + 1916, + 357, + 1916 + ], + "score": 0.732 + }, + { + "category_id": 8, + "poly": [ + 384, + 582, + 969, + 582, + 969, + 691, + 384, + 691 + ], + "score": 0.607 + }, + { + "category_id": 14, + "poly": [ + 383, + 577, + 1309, + 577, + 1309, + 693, + 383, + 693 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\bot \\mathbf { r } ( i ) = \\left\\{ \\begin{array} { l l } { l _ { r _ { i n i t } } , } & { i \\in [ 0 , 0 . 5 \\cdot \\mathrm { e p o c h s } ] } \\\\ { l _ { r _ { i n i t } } \\cdot ( 1 . 0 - 0 . 9 9 * ( i / \\mathrm { e p o c h s } - 0 . 5 ) / 0 . 4 ) , } & { i \\in [ 0 . 5 \\cdot \\mathrm { e p o c h s } , 0 . 9 \\cdot \\mathrm { e p o c h s } ] } \\\\ { l _ { r _ { i n i t } } \\cdot 0 . 0 1 , } & { \\mathrm { o t h e r w i s e } } \\end{array} \\right. } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1021, + 1711, + 1090, + 1711, + 1090, + 1743, + 1021, + 1743 + ], + "score": 0.92, + "latex": "q _ { \\theta } ( w )" + }, + { + "category_id": 13, + "poly": [ + 1165, + 1771, + 1224, + 1771, + 1224, + 1805, + 1165, + 1805 + ], + "score": 0.92, + "latex": "p ( w )" + }, + { + "category_id": 13, + "poly": [ + 753, + 1772, + 811, + 1772, + 811, + 1805, + 753, + 1805 + ], + "score": 0.92, + "latex": "q ( w )" + }, + { + "category_id": 13, + "poly": [ + 354, + 1520, + 447, + 1520, + 447, + 1551, + 354, + 1551 + ], + "score": 0.91, + "latex": "p = 0 . 3" + }, + { + "category_id": 13, + "poly": [ + 393, + 1711, + 531, + 1711, + 531, + 1744, + 393, + 1744 + ], + "score": 0.91, + "latex": "p ( w | D a t a )" + }, + { + "category_id": 13, + "poly": [ + 732, + 1369, + 828, + 1369, + 828, + 1399, + 732, + 1399 + ], + "score": 0.91, + "latex": "p = 0 . 5" + }, + { + "category_id": 13, + "poly": [ + 1023, + 865, + 1170, + 865, + 1170, + 894, + 1023, + 894 + ], + "score": 0.89, + "latex": "2 3 . 8 1 \\pm 0 . 1 5" + }, + { + "category_id": 13, + "poly": [ + 982, + 801, + 1284, + 801, + 1284, + 834, + 982, + 834 + ], + "score": 0.88, + "latex": "l r = l r _ { i n i t } \\cdot 0 . 1 ^ { \\mathrm { e p o c h / / 3 0 } }" + }, + { + "category_id": 13, + "poly": [ + 1269, + 771, + 1394, + 771, + 1394, + 800, + 1269, + 800 + ], + "score": 0.88, + "latex": "2 2 4 \\times 2 2 4" + }, + { + "category_id": 13, + "poly": [ + 371, + 771, + 454, + 771, + 454, + 801, + 371, + 801 + ], + "score": 0.83, + "latex": "1 e - 4" + }, + { + "category_id": 13, + "poly": [ + 565, + 1282, + 584, + 1282, + 584, + 1309, + 565, + 1309 + ], + "score": 0.79, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1251, + 1742, + 1267, + 1742, + 1267, + 1768, + 1251, + 1768 + ], + "score": 0.78, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 570, + 1742, + 593, + 1742, + 593, + 1768, + 570, + 1768 + ], + "score": 0.78, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 928, + 893, + 1010, + 893, + 1010, + 924, + 928, + 924 + ], + "score": 0.71, + "latex": "2 3 . 8 5 ^ { 8 }" + }, + { + "category_id": 13, + "poly": [ + 1369, + 803, + 1403, + 803, + 1403, + 837, + 1369, + 837 + ], + "score": 0.69, + "latex": "/ /" + }, + { + "category_id": 14, + "poly": [ + 525, + 1819, + 1176, + 1819, + 1176, + 1868, + 525, + 1868 + ], + "score": 0.68, + "latex": "\\mathcal { L } ( \\theta ) = \\mathbb { E } _ { q } \\log p ( y ^ { * } \\mid x , w ) - K L ( q _ { \\theta } ( w ) \\mid \\mid p ( w ) ) \\to \\operatorname* { m a x } _ { \\theta }" + }, + { + "category_id": 13, + "poly": [ + 1091, + 1875, + 1291, + 1875, + 1291, + 1918, + 1091, + 1918 + ], + "score": 0.58, + "latex": "\\sigma _ { p } ^ { 2 } = ( N \\cdot { \\mathrm { w d } } ) ^ { - 1 }" + }, + { + "category_id": 14, + "poly": [ + 360, + 1870, + 1291, + 1870, + 1291, + 1918, + 360, + 1918 + ], + "score": 0.41, + "latex": "q ( w ) = \\mathcal { N } ( w \\mid \\mu , \\mathrm { d i a g } ( \\sigma ^ { 2 } ) ) \\quad p ( w ) = N ( w \\mid 0 , \\mathrm { d i a g } ( \\sigma _ { p } ^ { 2 } ) ) , \\mathrm { w h e r e } \\sigma _ { p } ^ { 2 } = ( N \\cdot \\mathrm { w d } ) ^ { - 1 }" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1938.0, + 1201.0, + 1938.0, + 1201.0, + 1981.0, + 328.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1968.0, + 1198.0, + 1968.0, + 1198.0, + 2010.0, + 327.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1998.0, + 1171.0, + 1998.0, + 1171.0, + 2039.0, + 328.0, + 2039.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": [ + 832.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 377.0, + 432.0, + 1321.0, + 432.0, + 1321.0, + 470.0, + 377.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1215.0, + 1405.0, + 1215.0, + 1405.0, + 1251.0, + 295.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1246.0, + 1405.0, + 1246.0, + 1405.0, + 1281.0, + 295.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1276.0, + 564.0, + 1276.0, + 564.0, + 1310.0, + 292.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 1276.0, + 1405.0, + 1276.0, + 1405.0, + 1310.0, + 585.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1307.0, + 1405.0, + 1307.0, + 1405.0, + 1342.0, + 294.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1335.0, + 1406.0, + 1335.0, + 1406.0, + 1373.0, + 292.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1366.0, + 731.0, + 1366.0, + 731.0, + 1405.0, + 292.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 1366.0, + 1407.0, + 1366.0, + 1407.0, + 1405.0, + 829.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1397.0, + 1406.0, + 1397.0, + 1406.0, + 1433.0, + 295.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1426.0, + 1406.0, + 1426.0, + 1406.0, + 1464.0, + 294.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1458.0, + 1405.0, + 1458.0, + 1405.0, + 1492.0, + 294.0, + 1492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1490.0, + 1405.0, + 1490.0, + 1405.0, + 1525.0, + 295.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1519.0, + 353.0, + 1519.0, + 353.0, + 1555.0, + 295.0, + 1555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1519.0, + 1405.0, + 1519.0, + 1405.0, + 1555.0, + 448.0, + 1555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1548.0, + 1404.0, + 1548.0, + 1404.0, + 1585.0, + 294.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1579.0, + 1405.0, + 1579.0, + 1405.0, + 1617.0, + 292.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1612.0, + 887.0, + 1612.0, + 887.0, + 1644.0, + 296.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 709.0, + 1405.0, + 709.0, + 1405.0, + 743.0, + 295.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 731.0, + 1407.0, + 731.0, + 1407.0, + 781.0, + 290.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 769.0, + 370.0, + 769.0, + 370.0, + 806.0, + 295.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 769.0, + 1268.0, + 769.0, + 1268.0, + 806.0, + 455.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 769.0, + 1406.0, + 769.0, + 1406.0, + 806.0, + 1395.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 795.0, + 981.0, + 795.0, + 981.0, + 842.0, + 290.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 795.0, + 1368.0, + 795.0, + 1368.0, + 842.0, + 1285.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 795.0, + 1408.0, + 795.0, + 1408.0, + 842.0, + 1404.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 834.0, + 1407.0, + 834.0, + 1407.0, + 868.0, + 295.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 862.0, + 1022.0, + 862.0, + 1022.0, + 899.0, + 291.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 862.0, + 1406.0, + 862.0, + 1406.0, + 899.0, + 1171.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 890.0, + 927.0, + 890.0, + 927.0, + 931.0, + 291.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 890.0, + 1406.0, + 890.0, + 1406.0, + 931.0, + 1011.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 922.0, + 936.0, + 922.0, + 936.0, + 963.0, + 291.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 994.0, + 1405.0, + 994.0, + 1405.0, + 1030.0, + 295.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1024.0, + 1404.0, + 1024.0, + 1404.0, + 1059.0, + 292.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1052.0, + 1406.0, + 1052.0, + 1406.0, + 1093.0, + 292.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1084.0, + 1402.0, + 1084.0, + 1402.0, + 1119.0, + 295.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1116.0, + 1406.0, + 1116.0, + 1406.0, + 1150.0, + 294.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1148.0, + 663.0, + 1148.0, + 663.0, + 1180.0, + 296.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1676.0, + 1405.0, + 1676.0, + 1405.0, + 1716.0, + 295.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1709.0, + 392.0, + 1709.0, + 392.0, + 1746.0, + 294.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 1709.0, + 1020.0, + 1709.0, + 1020.0, + 1746.0, + 532.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 1709.0, + 1405.0, + 1709.0, + 1405.0, + 1746.0, + 1091.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1740.0, + 569.0, + 1740.0, + 569.0, + 1775.0, + 293.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1740.0, + 1250.0, + 1740.0, + 1250.0, + 1775.0, + 594.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 1740.0, + 1407.0, + 1740.0, + 1407.0, + 1775.0, + 1268.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1769.0, + 752.0, + 1769.0, + 752.0, + 1808.0, + 292.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 812.0, + 1769.0, + 1164.0, + 1769.0, + 1164.0, + 1808.0, + 812.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 1769.0, + 1235.0, + 1769.0, + 1235.0, + 1808.0, + 1225.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 526.0, + 1059.0, + 526.0, + 1059.0, + 568.0, + 295.0, + 568.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1726, + 1404, + 1726, + 1404, + 2034, + 296, + 2034 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1125, + 1404, + 1125, + 1404, + 1374, + 297, + 1374 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 927, + 1404, + 927, + 1404, + 1112, + 298, + 1112 + ], + "score": 0.979 + }, + { + "category_id": 5, + "poly": [ + 410, + 223, + 1289, + 223, + 1289, + 444, + 410, + 444 + ], + "score": 0.977, + "html": "
Optimal noise scale
ArchitectureCIFAR-10 CIFAR-10-augCIFAR-100 CIFAR-100-aug
VGG16BN0.0420.0420.1000.100
PreResNet1100.2130.1410.4780.401
PreResNet1640.1200.1050.2850.225
WideResNet28x100.0220.0180.0220.004
" + }, + { + "category_id": 1, + "poly": [ + 299, + 789, + 1403, + 789, + 1403, + 913, + 299, + 913 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 620, + 1403, + 620, + 1403, + 776, + 298, + 776 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1409, + 1401, + 1409, + 1401, + 1533, + 299, + 1533 + ], + "score": 0.976 + }, + { + "category_id": 8, + "poly": [ + 665, + 1654, + 1035, + 1654, + 1035, + 1695, + 665, + 1695 + ], + "score": 0.914 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.9 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1660, + 1399, + 1660, + 1399, + 1691, + 1352, + 1691 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1555, + 1399, + 1555, + 1399, + 1585, + 1352, + 1585 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1601, + 1400, + 1601, + 1400, + 1630, + 1352, + 1630 + ], + "score": 0.857 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.856 + }, + { + "category_id": 8, + "poly": [ + 482, + 1596, + 1218, + 1596, + 1218, + 1647, + 482, + 1647 + ], + "score": 0.82 + }, + { + "category_id": 8, + "poly": [ + 546, + 1552, + 1156, + 1552, + 1156, + 1589, + 546, + 1589 + ], + "score": 0.742 + }, + { + "category_id": 6, + "poly": [ + 299, + 465, + 1400, + 465, + 1400, + 558, + 299, + 558 + ], + "score": 0.623 + }, + { + "category_id": 1, + "poly": [ + 299, + 465, + 1400, + 465, + 1400, + 558, + 299, + 558 + ], + "score": 0.283 + }, + { + "category_id": 8, + "poly": [ + 546, + 1552, + 1160, + 1552, + 1160, + 1589, + 546, + 1589 + ], + "score": 0.227 + }, + { + "category_id": 8, + "poly": [ + 488, + 1595, + 1207, + 1595, + 1207, + 1645, + 488, + 1645 + ], + "score": 0.154 + }, + { + "category_id": 13, + "poly": [ + 397, + 1499, + 477, + 1499, + 477, + 1529, + 397, + 1529 + ], + "score": 0.93, + "latex": "w ^ { M A P }" + }, + { + "category_id": 14, + "poly": [ + 480, + 1547, + 1218, + 1547, + 1218, + 1700, + 480, + 1700 + ], + "score": 0.93, + "latex": "\\begin{array} { c } { \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) = \\log p ( \\boldsymbol { y } ^ { * } \\mid \\boldsymbol { x } , \\boldsymbol { w } ) + \\log p ( \\boldsymbol { w } ) + \\mathrm { c o n s t } } \\\\ { \\boldsymbol { w } ^ { M A P } = \\arg \\operatorname* { m a x } _ { \\boldsymbol { w } } \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) ; \\quad \\Sigma = - \\nabla \\nabla \\log p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) } \\\\ { p ( \\boldsymbol { w } \\mid \\boldsymbol { x } , \\boldsymbol { y } ^ { * } ) \\approx \\mathcal { N } ( \\boldsymbol { w } \\mid \\boldsymbol { w } ^ { M A P } , \\Sigma ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 862, + 1220, + 926, + 1220, + 926, + 1251, + 862, + 1251 + ], + "score": 0.91, + "latex": "l r _ { i n i t }" + }, + { + "category_id": 13, + "poly": [ + 981, + 1160, + 1081, + 1160, + 1081, + 1190, + 981, + 1190 + ], + "score": 0.89, + "latex": "\\log \\sigma _ { i n i t }" + }, + { + "category_id": 13, + "poly": [ + 872, + 961, + 970, + 961, + 970, + 992, + 872, + 992 + ], + "score": 0.89, + "latex": "\\log \\sigma _ { i n i t }" + }, + { + "category_id": 13, + "poly": [ + 931, + 1312, + 1103, + 1312, + 1103, + 1342, + 931, + 1342 + ], + "score": 0.84, + "latex": "\\log { \\sigma _ { i n i t } } = - 6" + }, + { + "category_id": 13, + "poly": [ + 451, + 961, + 514, + 961, + 514, + 991, + 451, + 991 + ], + "score": 0.83, + "latex": "\\log \\sigma" + }, + { + "category_id": 13, + "poly": [ + 1276, + 1251, + 1337, + 1251, + 1337, + 1281, + 1276, + 1281 + ], + "score": 0.83, + "latex": "\\log \\sigma" + }, + { + "category_id": 13, + "poly": [ + 697, + 883, + 719, + 883, + 719, + 914, + 697, + 914 + ], + "score": 0.83, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 431, + 1159, + 453, + 1159, + 453, + 1190, + 431, + 1190 + ], + "score": 0.83, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 1380, + 853, + 1401, + 853, + 1401, + 884, + 1380, + 884 + ], + "score": 0.83, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 749, + 1128, + 770, + 1128, + 770, + 1159, + 749, + 1159 + ], + "score": 0.83, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 1236, + 991, + 1257, + 991, + 1257, + 1021, + 1236, + 1021 + ], + "score": 0.82, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 767, + 1311, + 918, + 1311, + 918, + 1342, + 767, + 1342 + ], + "score": 0.82, + "latex": "l r _ { i n i t } = 0 . 0 1" + }, + { + "category_id": 13, + "poly": [ + 664, + 934, + 686, + 934, + 686, + 961, + 664, + 961 + ], + "score": 0.81, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 563, + 1194, + 585, + 1194, + 585, + 1220, + 563, + 1220 + ], + "score": 0.81, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 333, + 714, + 394, + 714, + 394, + 744, + 333, + 744 + ], + "score": 0.8, + "latex": "\\log \\sigma" + }, + { + "category_id": 13, + "poly": [ + 648, + 1311, + 755, + 1311, + 755, + 1342, + 648, + 1342 + ], + "score": 0.78, + "latex": "\\beta = 1 \\mathrm { e } { - 3 }" + }, + { + "category_id": 13, + "poly": [ + 1231, + 1794, + 1253, + 1794, + 1253, + 1817, + 1231, + 1817 + ], + "score": 0.74, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 1320, + 1160, + 1360, + 1160, + 1360, + 1188, + 1320, + 1188 + ], + "score": 0.71, + "latex": "- 5" + }, + { + "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, + 2122.0, + 832.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 464.0, + 1405.0, + 464.0, + 1405.0, + 498.0, + 295.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 496.0, + 1402.0, + 496.0, + 1402.0, + 530.0, + 295.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 527.0, + 608.0, + 527.0, + 608.0, + 561.0, + 294.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1730.0, + 1404.0, + 1730.0, + 1404.0, + 1761.0, + 295.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1758.0, + 1405.0, + 1758.0, + 1405.0, + 1793.0, + 294.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1789.0, + 1230.0, + 1789.0, + 1230.0, + 1825.0, + 294.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 1789.0, + 1406.0, + 1789.0, + 1406.0, + 1825.0, + 1254.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1819.0, + 1405.0, + 1819.0, + 1405.0, + 1856.0, + 293.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1848.0, + 1406.0, + 1848.0, + 1406.0, + 1886.0, + 293.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1881.0, + 1402.0, + 1881.0, + 1402.0, + 1913.0, + 295.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1912.0, + 1405.0, + 1912.0, + 1405.0, + 1944.0, + 293.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1978.0, + 295.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 1405.0, + 1974.0, + 1405.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 553.0, + 2004.0, + 553.0, + 2036.0, + 295.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1127.0, + 748.0, + 1127.0, + 748.0, + 1161.0, + 296.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1127.0, + 1404.0, + 1127.0, + 1404.0, + 1161.0, + 771.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1157.0, + 430.0, + 1157.0, + 430.0, + 1195.0, + 294.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1157.0, + 980.0, + 1157.0, + 980.0, + 1195.0, + 454.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 1157.0, + 1319.0, + 1157.0, + 1319.0, + 1195.0, + 1082.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1361.0, + 1157.0, + 1407.0, + 1157.0, + 1407.0, + 1195.0, + 1361.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1185.0, + 562.0, + 1185.0, + 562.0, + 1224.0, + 292.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 1185.0, + 1406.0, + 1185.0, + 1406.0, + 1224.0, + 586.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1218.0, + 861.0, + 1218.0, + 861.0, + 1254.0, + 294.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1218.0, + 1404.0, + 1218.0, + 1404.0, + 1254.0, + 927.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1250.0, + 1275.0, + 1250.0, + 1275.0, + 1283.0, + 294.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1338.0, + 1250.0, + 1404.0, + 1250.0, + 1404.0, + 1283.0, + 1338.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1279.0, + 1404.0, + 1279.0, + 1404.0, + 1315.0, + 292.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1309.0, + 647.0, + 1309.0, + 647.0, + 1346.0, + 291.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1309.0, + 766.0, + 1309.0, + 766.0, + 1346.0, + 756.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1309.0, + 930.0, + 1309.0, + 930.0, + 1346.0, + 919.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 1309.0, + 1406.0, + 1309.0, + 1406.0, + 1346.0, + 1104.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1339.0, + 617.0, + 1339.0, + 617.0, + 1378.0, + 294.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 928.0, + 663.0, + 928.0, + 663.0, + 964.0, + 294.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 928.0, + 1405.0, + 928.0, + 1405.0, + 964.0, + 687.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 958.0, + 450.0, + 958.0, + 450.0, + 998.0, + 293.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 958.0, + 871.0, + 958.0, + 871.0, + 998.0, + 515.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 958.0, + 1406.0, + 958.0, + 1406.0, + 998.0, + 971.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 989.0, + 1235.0, + 989.0, + 1235.0, + 1025.0, + 294.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 989.0, + 1405.0, + 989.0, + 1405.0, + 1025.0, + 1258.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1021.0, + 1402.0, + 1021.0, + 1402.0, + 1053.0, + 296.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1050.0, + 1405.0, + 1050.0, + 1405.0, + 1086.0, + 294.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1081.0, + 536.0, + 1081.0, + 536.0, + 1116.0, + 294.0, + 1116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 788.0, + 1404.0, + 788.0, + 1404.0, + 827.0, + 293.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 822.0, + 1405.0, + 822.0, + 1405.0, + 855.0, + 294.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 853.0, + 1379.0, + 853.0, + 1379.0, + 886.0, + 295.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 853.0, + 1405.0, + 853.0, + 1405.0, + 886.0, + 1402.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 881.0, + 696.0, + 881.0, + 696.0, + 916.0, + 294.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 881.0, + 1264.0, + 881.0, + 1264.0, + 916.0, + 720.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 618.0, + 1405.0, + 618.0, + 1405.0, + 658.0, + 292.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 651.0, + 1404.0, + 651.0, + 1404.0, + 685.0, + 296.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 681.0, + 1404.0, + 681.0, + 1404.0, + 717.0, + 293.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 707.0, + 332.0, + 707.0, + 332.0, + 751.0, + 291.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 707.0, + 1408.0, + 707.0, + 1408.0, + 751.0, + 395.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 743.0, + 451.0, + 743.0, + 451.0, + 778.0, + 293.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1409.0, + 1405.0, + 1409.0, + 1405.0, + 1445.0, + 294.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1441.0, + 1403.0, + 1441.0, + 1403.0, + 1473.0, + 294.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1470.0, + 1405.0, + 1470.0, + 1405.0, + 1505.0, + 294.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1494.0, + 396.0, + 1494.0, + 396.0, + 1539.0, + 292.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 1494.0, + 956.0, + 1494.0, + 956.0, + 1539.0, + 478.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 464.0, + 1405.0, + 464.0, + 1405.0, + 498.0, + 295.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 496.0, + 1402.0, + 496.0, + 1402.0, + 530.0, + 295.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 527.0, + 608.0, + 527.0, + 608.0, + 561.0, + 294.0, + 561.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 671, + 1404, + 671, + 1404, + 889, + 297, + 889 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 228, + 1402, + 228, + 1402, + 373, + 297, + 373 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1768, + 1403, + 1768, + 1403, + 1953, + 298, + 1953 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 903, + 1403, + 903, + 1403, + 1027, + 298, + 1027 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1041, + 1403, + 1041, + 1403, + 1166, + 297, + 1166 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 546, + 1404, + 546, + 1404, + 640, + 297, + 640 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1659, + 1398, + 1659, + 1398, + 1754, + 299, + 1754 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 298, + 1194, + 1403, + 1194, + 1403, + 1285, + 298, + 1285 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 534, + 1298, + 1163, + 1298, + 1163, + 1369, + 534, + 1369 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 578, + 387, + 1121, + 387, + 1121, + 458, + 578, + 458 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 298, + 469, + 1402, + 469, + 1402, + 532, + 298, + 532 + ], + "score": 0.948 + }, + { + "category_id": 9, + "poly": [ + 1357, + 1318, + 1399, + 1318, + 1399, + 1347, + 1357, + 1347 + ], + "score": 0.908 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.908 + }, + { + "category_id": 9, + "poly": [ + 1357, + 407, + 1399, + 407, + 1399, + 436, + 1357, + 436 + ], + "score": 0.902 + }, + { + "category_id": 1, + "poly": [ + 297, + 1411, + 1404, + 1411, + 1404, + 1626, + 297, + 1626 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 837, + 2088, + 865, + 2088, + 865, + 2112, + 837, + 2112 + ], + "score": 0.854 + }, + { + "category_id": 14, + "poly": [ + 576, + 387, + 1119, + 387, + 1119, + 457, + 576, + 457 + ], + "score": 0.95, + "latex": "\\alpha ( t ) = \\frac { \\alpha _ { 0 } } 2 \\left( \\cos \\left( \\frac { \\pi \\ \\mathrm { m o d } \\ ( t - 1 , \\lceil T / M \\rceil ) } { \\lceil T / M \\rceil } \\right) + 1 \\right) ," + }, + { + "category_id": 13, + "poly": [ + 298, + 1535, + 533, + 1535, + 533, + 1566, + 298, + 1566 + ], + "score": 0.92, + "latex": "1 e - 2 , \\alpha _ { 2 } = 5 e - 4" + }, + { + "category_id": 14, + "poly": [ + 534, + 1298, + 1162, + 1298, + 1162, + 1369, + 534, + 1369 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\alpha ( i ) = \\left\\{ \\begin{array} { l l } { ( 1 - 2 t ( i ) ) \\alpha _ { 1 } + 2 t ( i ) \\alpha _ { 2 } \\quad } & { 0 < t ( i ) \\le \\frac { 1 } { 2 } } \\\\ { ( 2 - 2 t ( i ) ) \\alpha _ { 2 } + ( 2 t ( i ) - 1 ) \\alpha _ { 1 } \\quad \\frac { 1 } { 2 } < t ( i ) \\le 1 } \\end{array} \\right. . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 608, + 1566, + 910, + 1566, + 910, + 1597, + 608, + 1597 + ], + "score": 0.91, + "latex": "\\alpha _ { 1 } = 5 e - 2 , \\alpha _ { 2 } = 5 e - 4" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1507, + 1403, + 1507, + 1403, + 1536, + 1332, + 1536 + ], + "score": 0.86, + "latex": "\\alpha _ { 1 } ~ =" + }, + { + "category_id": 13, + "poly": [ + 369, + 475, + 403, + 475, + 403, + 501, + 369, + 501 + ], + "score": 0.84, + "latex": "\\alpha _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 696, + 472, + 720, + 472, + 720, + 498, + 696, + 498 + ], + "score": 0.84, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1215, + 472, + 1244, + 472, + 1244, + 498, + 1215, + 498 + ], + "score": 0.33, + "latex": "\\mathbf { M }" + }, + { + "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, + 869.0, + 2085.0, + 869.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 672.0, + 1405.0, + 672.0, + 1405.0, + 710.0, + 296.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 704.0, + 1405.0, + 704.0, + 1405.0, + 739.0, + 292.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 733.0, + 1404.0, + 733.0, + 1404.0, + 770.0, + 294.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 765.0, + 1405.0, + 765.0, + 1405.0, + 800.0, + 295.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 794.0, + 1404.0, + 794.0, + 1404.0, + 831.0, + 294.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 827.0, + 1404.0, + 827.0, + 1404.0, + 862.0, + 294.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 853.0, + 422.0, + 853.0, + 422.0, + 893.0, + 294.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1406.0, + 229.0, + 1406.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 256.0, + 1407.0, + 256.0, + 1407.0, + 294.0, + 293.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 281.0, + 1407.0, + 281.0, + 1407.0, + 324.0, + 291.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 315.0, + 1404.0, + 315.0, + 1404.0, + 346.0, + 293.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 343.0, + 1182.0, + 343.0, + 1182.0, + 375.0, + 296.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1768.0, + 1405.0, + 1768.0, + 1405.0, + 1805.0, + 293.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1796.0, + 1407.0, + 1796.0, + 1407.0, + 1838.0, + 292.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1831.0, + 1404.0, + 1831.0, + 1404.0, + 1863.0, + 296.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1859.0, + 1404.0, + 1859.0, + 1404.0, + 1894.0, + 294.0, + 1894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1891.0, + 1405.0, + 1891.0, + 1405.0, + 1927.0, + 294.0, + 1927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1922.0, + 724.0, + 1922.0, + 724.0, + 1953.0, + 294.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 903.0, + 1404.0, + 903.0, + 1404.0, + 941.0, + 293.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 936.0, + 1405.0, + 936.0, + 1405.0, + 968.0, + 294.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 963.0, + 1407.0, + 963.0, + 1407.0, + 1000.0, + 292.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 995.0, + 1223.0, + 995.0, + 1223.0, + 1031.0, + 294.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1039.0, + 1407.0, + 1039.0, + 1407.0, + 1079.0, + 292.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1072.0, + 1405.0, + 1072.0, + 1405.0, + 1108.0, + 293.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1105.0, + 1404.0, + 1105.0, + 1404.0, + 1137.0, + 295.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1135.0, + 678.0, + 1135.0, + 678.0, + 1166.0, + 293.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 546.0, + 1404.0, + 546.0, + 1404.0, + 583.0, + 294.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 578.0, + 1404.0, + 578.0, + 1404.0, + 612.0, + 297.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 608.0, + 1358.0, + 608.0, + 1358.0, + 643.0, + 293.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1656.0, + 1403.0, + 1656.0, + 1403.0, + 1699.0, + 292.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1691.0, + 1404.0, + 1691.0, + 1404.0, + 1728.0, + 293.0, + 1728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1724.0, + 719.0, + 1724.0, + 719.0, + 1754.0, + 296.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1193.0, + 1407.0, + 1193.0, + 1407.0, + 1231.0, + 292.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1224.0, + 1404.0, + 1224.0, + 1404.0, + 1257.0, + 294.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1254.0, + 1301.0, + 1254.0, + 1301.0, + 1287.0, + 294.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 467.0, + 368.0, + 467.0, + 368.0, + 503.0, + 293.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 467.0, + 695.0, + 467.0, + 695.0, + 503.0, + 404.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 467.0, + 1214.0, + 467.0, + 1214.0, + 503.0, + 721.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 467.0, + 1403.0, + 467.0, + 1403.0, + 503.0, + 1245.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 494.0, + 414.0, + 494.0, + 414.0, + 539.0, + 291.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1411.0, + 1405.0, + 1411.0, + 1405.0, + 1448.0, + 294.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, + 1474.0, + 1404.0, + 1474.0, + 1404.0, + 1507.0, + 294.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1501.0, + 1331.0, + 1501.0, + 1331.0, + 1543.0, + 292.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 1534.0, + 1404.0, + 1534.0, + 1404.0, + 1569.0, + 534.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1563.0, + 607.0, + 1563.0, + 607.0, + 1602.0, + 290.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 911.0, + 1563.0, + 1406.0, + 1563.0, + 1406.0, + 1602.0, + 911.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1594.0, + 355.0, + 1594.0, + 355.0, + 1629.0, + 294.0, + 1629.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 4, + "poly": [ + 297, + 1888, + 1405, + 1888, + 1405, + 1984, + 297, + 1984 + ], + "score": 0.951 + }, + { + "category_id": 3, + "poly": [ + 516, + 268, + 1166, + 268, + 1166, + 1865, + 516, + 1865 + ], + "score": 0.941 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 816, + 75, + 816, + 105, + 298, + 105 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 866, + 2088, + 866, + 2113, + 834, + 2113 + ], + "score": 0.858 + }, + { + "category_id": 2, + "poly": [ + 296, + 229, + 907, + 229, + 907, + 261, + 296, + 261 + ], + "score": 0.422 + }, + { + "category_id": 0, + "poly": [ + 296, + 229, + 907, + 229, + 907, + 261, + 296, + 261 + ], + "score": 0.394 + }, + { + "category_id": 13, + "poly": [ + 898, + 792, + 1022, + 792, + 1022, + 824, + 898, + 824 + ], + "score": 0.9, + "latex": "| \\rho | = 0 . 9 8 5" + }, + { + "category_id": 13, + "poly": [ + 895, + 1833, + 1018, + 1833, + 1018, + 1865, + 895, + 1865 + ], + "score": 0.9, + "latex": "| \\rho | = 0 . 9 9 9" + }, + { + "category_id": 13, + "poly": [ + 905, + 1331, + 1029, + 1331, + 1029, + 1363, + 905, + 1363 + ], + "score": 0.88, + "latex": "| \\rho | = 0 . 9 7 2" + }, + { + "category_id": 13, + "poly": [ + 1342, + 1957, + 1359, + 1957, + 1359, + 1983, + 1342, + 1983 + ], + "score": 0.79, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 839, + 1372, + 860, + 1372, + 860, + 1395, + 839, + 1395 + ], + "score": 0.32, + "latex": "\\diamond" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1889.0, + 1405.0, + 1889.0, + 1405.0, + 1924.0, + 296.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1919.0, + 1403.0, + 1919.0, + 1403.0, + 1956.0, + 294.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1947.0, + 1341.0, + 1947.0, + 1341.0, + 1987.0, + 292.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1947.0, + 1372.0, + 1947.0, + 1372.0, + 1987.0, + 1360.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 310.0, + 886.0, + 310.0, + 886.0, + 340.0, + 754.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 306.0, + 1016.0, + 306.0, + 1016.0, + 342.0, + 906.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 331.0, + 886.0, + 331.0, + 886.0, + 361.0, + 753.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 329.0, + 1052.0, + 329.0, + 1052.0, + 363.0, + 906.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 377.0, + 679.0, + 377.0, + 679.0, + 405.0, + 648.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 393.0, + 635.0, + 393.0, + 635.0, + 435.0, + 545.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 398.0, + 566.0, + 398.0, + 566.0, + 687.0, + 513.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 435.0, + 827.0, + 435.0, + 827.0, + 481.0, + 754.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 448.0, + 637.0, + 448.0, + 637.0, + 496.0, + 545.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 471.0, + 850.0, + 471.0, + 850.0, + 480.0, + 841.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 474.0, + 872.0, + 474.0, + 872.0, + 504.0, + 841.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 504.0, + 637.0, + 504.0, + 637.0, + 552.0, + 540.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 487.0, + 938.0, + 487.0, + 938.0, + 541.0, + 866.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 531.0, + 976.0, + 531.0, + 976.0, + 554.0, + 953.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 538.0, + 1000.0, + 538.0, + 1000.0, + 566.0, + 971.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 563.0, + 637.0, + 563.0, + 637.0, + 610.0, + 544.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 561.0, + 847.0, + 561.0, + 847.0, + 626.0, + 657.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 557.0, + 1001.0, + 557.0, + 1001.0, + 630.0, + 872.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 577.0, + 1038.0, + 577.0, + 1038.0, + 600.0, + 1012.0, + 600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 623.0, + 635.0, + 623.0, + 635.0, + 665.0, + 545.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 626.0, + 679.0, + 626.0, + 679.0, + 640.0, + 664.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 612.0, + 789.0, + 612.0, + 789.0, + 653.0, + 690.0, + 653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 610.0, + 1000.0, + 610.0, + 1000.0, + 656.0, + 873.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 653.0, + 679.0, + 653.0, + 679.0, + 669.0, + 663.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 640.0, + 825.0, + 640.0, + 825.0, + 681.0, + 690.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 648.0, + 904.0, + 648.0, + 904.0, + 672.0, + 881.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 640.0, + 980.0, + 640.0, + 980.0, + 679.0, + 913.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 633.0, + 1104.0, + 633.0, + 1104.0, + 656.0, + 1081.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 678.0, + 637.0, + 678.0, + 637.0, + 725.0, + 542.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 679.0, + 679.0, + 679.0, + 679.0, + 695.0, + 663.0, + 695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 665.0, + 780.0, + 665.0, + 780.0, + 708.0, + 690.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 681.0, + 1147.0, + 681.0, + 1147.0, + 711.0, + 1115.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 711.0, + 756.0, + 711.0, + 756.0, + 755.0, + 686.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 711.0, + 852.0, + 711.0, + 852.0, + 755.0, + 780.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 711.0, + 947.0, + 711.0, + 947.0, + 755.0, + 873.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 711.0, + 1045.0, + 711.0, + 1045.0, + 755.0, + 973.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 715.0, + 1137.0, + 715.0, + 1137.0, + 755.0, + 1066.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 738.0, + 989.0, + 738.0, + 989.0, + 778.0, + 809.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 785.0, + 897.0, + 785.0, + 897.0, + 830.0, + 668.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 785.0, + 1032.0, + 785.0, + 1032.0, + 830.0, + 1023.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 828.0, + 877.0, + 828.0, + 877.0, + 863.0, + 740.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 826.0, + 1012.0, + 826.0, + 1012.0, + 867.0, + 893.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 853.0, + 875.0, + 853.0, + 875.0, + 883.0, + 738.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 851.0, + 1047.0, + 851.0, + 1047.0, + 886.0, + 897.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 902.0, + 691.0, + 902.0, + 691.0, + 936.0, + 644.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 904.0, + 652.0, + 904.0, + 652.0, + 927.0, + 630.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 911.0, + 614.0, + 911.0, + 614.0, + 955.0, + 547.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 916.0, + 729.0, + 916.0, + 729.0, + 957.0, + 691.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 921.0, + 569.0, + 921.0, + 569.0, + 1224.0, + 511.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 945.0, + 765.0, + 945.0, + 765.0, + 959.0, + 747.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 975.0, + 612.0, + 975.0, + 612.0, + 1013.0, + 553.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 958.0, + 797.0, + 958.0, + 797.0, + 995.0, + 767.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 964.0, + 841.0, + 964.0, + 841.0, + 994.0, + 809.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 990.0, + 879.0, + 990.0, + 879.0, + 1003.0, + 863.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 998.0, + 854.0, + 998.0, + 854.0, + 1021.0, + 830.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1010.0, + 915.0, + 1010.0, + 915.0, + 1054.0, + 866.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1022.0, + 827.0, + 1022.0, + 827.0, + 1031.0, + 818.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 1035.0, + 614.0, + 1035.0, + 614.0, + 1079.0, + 547.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 1040.0, + 861.0, + 1040.0, + 861.0, + 1061.0, + 839.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 1077.0, + 989.0, + 1077.0, + 989.0, + 1095.0, + 974.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 1097.0, + 612.0, + 1097.0, + 612.0, + 1137.0, + 553.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1097.0, + 668.0, + 1097.0, + 668.0, + 1125.0, + 635.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 1091.0, + 836.0, + 1091.0, + 836.0, + 1130.0, + 673.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1098.0, + 899.0, + 1098.0, + 899.0, + 1125.0, + 866.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1093.0, + 992.0, + 1093.0, + 992.0, + 1130.0, + 906.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1127.0, + 666.0, + 1127.0, + 666.0, + 1153.0, + 635.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 1115.0, + 770.0, + 1115.0, + 770.0, + 1163.0, + 671.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 1128.0, + 895.0, + 1128.0, + 895.0, + 1151.0, + 870.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1116.0, + 973.0, + 1116.0, + 973.0, + 1160.0, + 902.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 1130.0, + 1056.0, + 1130.0, + 1056.0, + 1155.0, + 1032.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 1157.0, + 614.0, + 1157.0, + 614.0, + 1201.0, + 547.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1144.0, + 812.0, + 1144.0, + 812.0, + 1215.0, + 635.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 1155.0, + 895.0, + 1155.0, + 895.0, + 1206.0, + 870.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1144.0, + 989.0, + 1144.0, + 989.0, + 1217.0, + 902.0, + 1217.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1208.0, + 666.0, + 1208.0, + 666.0, + 1236.0, + 635.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 1199.0, + 765.0, + 1199.0, + 765.0, + 1247.0, + 670.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 1201.0, + 1128.0, + 1201.0, + 1128.0, + 1220.0, + 1104.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 1220.0, + 610.0, + 1220.0, + 610.0, + 1259.0, + 545.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 1249.0, + 1129.0, + 1249.0, + 1129.0, + 1293.0, + 612.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 1277.0, + 982.0, + 1277.0, + 982.0, + 1321.0, + 795.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 1325.0, + 904.0, + 1325.0, + 904.0, + 1369.0, + 663.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 1325.0, + 1039.0, + 1325.0, + 1039.0, + 1369.0, + 1030.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1363.0, + 838.0, + 1363.0, + 838.0, + 1404.0, + 828.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 1363.0, + 964.0, + 1363.0, + 964.0, + 1404.0, + 861.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.0, + 1401.0, + 690.0, + 1401.0, + 690.0, + 1441.0, + 643.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 1425.0, + 625.0, + 1425.0, + 625.0, + 1468.0, + 544.0, + 1468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 1434.0, + 562.0, + 1434.0, + 562.0, + 1724.0, + 515.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 1436.0, + 720.0, + 1436.0, + 720.0, + 1471.0, + 679.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 722.0, + 1473.0, + 751.0, + 1473.0, + 751.0, + 1501.0, + 722.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1478.0, + 778.0, + 1478.0, + 778.0, + 1515.0, + 738.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 549.0, + 1514.0, + 626.0, + 1514.0, + 626.0, + 1558.0, + 549.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1503.0, + 816.0, + 1503.0, + 816.0, + 1537.0, + 776.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1544.0, + 864.0, + 1544.0, + 864.0, + 1577.0, + 836.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 1604.0, + 625.0, + 1604.0, + 625.0, + 1646.0, + 547.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 931.0, + 1613.0, + 973.0, + 1613.0, + 973.0, + 1646.0, + 931.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 1622.0, + 1036.0, + 1622.0, + 1036.0, + 1703.0, + 899.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1653.0, + 837.0, + 1653.0, + 837.0, + 1689.0, + 682.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1660.0, + 673.0, + 1660.0, + 673.0, + 1682.0, + 648.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 1668.0, + 1057.0, + 1668.0, + 1057.0, + 1710.0, + 1005.0, + 1710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1676.0, + 974.0, + 1676.0, + 974.0, + 1721.0, + 908.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1678.0, + 782.0, + 1678.0, + 782.0, + 1719.0, + 681.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1685.0, + 673.0, + 1685.0, + 673.0, + 1708.0, + 648.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1687.0, + 900.0, + 1687.0, + 900.0, + 1710.0, + 875.0, + 1710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 1694.0, + 625.0, + 1694.0, + 625.0, + 1736.0, + 545.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1696.0, + 1068.0, + 1696.0, + 1068.0, + 1724.0, + 1039.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1705.0, + 976.0, + 1705.0, + 976.0, + 1749.0, + 908.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1706.0, + 818.0, + 1706.0, + 818.0, + 1747.0, + 682.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1712.0, + 677.0, + 1712.0, + 677.0, + 1740.0, + 646.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1715.0, + 897.0, + 1715.0, + 897.0, + 1738.0, + 875.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 1754.0, + 686.0, + 1754.0, + 686.0, + 1795.0, + 616.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 702.0, + 1754.0, + 772.0, + 1754.0, + 772.0, + 1795.0, + 702.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 1754.0, + 859.0, + 1754.0, + 859.0, + 1793.0, + 792.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 1751.0, + 951.0, + 1751.0, + 951.0, + 1795.0, + 877.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 1752.0, + 1043.0, + 1752.0, + 1043.0, + 1795.0, + 969.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 1754.0, + 1129.0, + 1754.0, + 1129.0, + 1795.0, + 1059.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 1777.0, + 984.0, + 1777.0, + 984.0, + 1822.0, + 800.0, + 1822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 1827.0, + 894.0, + 1827.0, + 894.0, + 1871.0, + 673.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1019.0, + 1827.0, + 1027.0, + 1827.0, + 1027.0, + 1871.0, + 1019.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 411.0, + 764.0, + 411.0, + 764.0, + 438.5, + 698.0, + 438.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 911.75, + 1033.0, + 982.75, + 1033.0, + 982.75, + 1091.0, + 911.75, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.75, + 1218.5, + 1141.75, + 1218.5, + 1141.75, + 1245.5, + 1114.75, + 1245.5 + ], + "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": [ + 828.0, + 2083.0, + 872.0, + 2083.0, + 872.0, + 2123.0, + 828.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 223.0, + 909.0, + 223.0, + 909.0, + 269.0, + 295.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 223.0, + 909.0, + 223.0, + 909.0, + 269.0, + 295.0, + 269.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 19, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 294, + 448, + 1292, + 448, + 1292, + 1688, + 294, + 1688 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 296, + 1702, + 1404, + 1702, + 1404, + 1797, + 296, + 1797 + ], + "score": 0.961 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 863, + 2088, + 863, + 2113, + 834, + 2113 + ], + "score": 0.781 + }, + { + "category_id": 13, + "poly": [ + 567, + 837, + 677, + 837, + 677, + 866, + 567, + 866 + ], + "score": 0.8, + "latex": "\\rho = 0 . 8 6 1" + }, + { + "category_id": 13, + "poly": [ + 1076, + 1257, + 1187, + 1257, + 1187, + 1286, + 1076, + 1286 + ], + "score": 0.79, + "latex": "\\rho = 0 . 9 5 6" + }, + { + "category_id": 13, + "poly": [ + 1070, + 837, + 1180, + 837, + 1180, + 866, + 1070, + 866 + ], + "score": 0.78, + "latex": "\\rho = 0 . 9 5 7" + }, + { + "category_id": 13, + "poly": [ + 573, + 1257, + 685, + 1257, + 685, + 1286, + 573, + 1286 + ], + "score": 0.62, + "latex": "\\rho = 0 . 8 7 7" + }, + { + "category_id": 13, + "poly": [ + 1065, + 1649, + 1175, + 1649, + 1175, + 1678, + 1065, + 1678 + ], + "score": 0.39, + "latex": "\\rho = 0 . 9 9 7" + }, + { + "category_id": 13, + "poly": [ + 563, + 1649, + 674, + 1649, + 674, + 1678, + 563, + 1678 + ], + "score": 0.38, + "latex": "\\rho = 0 . 9 9 5" + }, + { + "category_id": 13, + "poly": [ + 1111, + 799, + 1140, + 799, + 1140, + 820, + 1111, + 820 + ], + "score": 0.37, + "latex": "( \\% )" + }, + { + "category_id": 13, + "poly": [ + 1104, + 1218, + 1134, + 1218, + 1134, + 1240, + 1104, + 1240 + ], + "score": 0.32, + "latex": "( \\% )" + }, + { + "category_id": 13, + "poly": [ + 1043, + 1293, + 1060, + 1293, + 1060, + 1312, + 1043, + 1312 + ], + "score": 0.27, + "latex": "\\diamond" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 455.0, + 575.0, + 455.0, + 575.0, + 499.0, + 470.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 454.0, + 701.0, + 454.0, + 701.0, + 500.0, + 587.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 465.0, + 1080.0, + 465.0, + 1080.0, + 505.0, + 978.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 464.0, + 1205.0, + 464.0, + 1205.0, + 509.0, + 1094.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 514.0, + 380.0, + 514.0, + 380.0, + 549.0, + 317.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 511.0, + 777.0, + 511.0, + 777.0, + 532.0, + 749.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 517.0, + 1277.0, + 517.0, + 1277.0, + 538.0, + 1251.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 568.0, + 380.0, + 568.0, + 380.0, + 704.0, + 290.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 585.0, + 495.0, + 585.0, + 495.0, + 606.0, + 459.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 575.0, + 534.0, + 575.0, + 534.0, + 592.0, + 510.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 566.0, + 565.0, + 566.0, + 565.0, + 588.0, + 540.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 546.0, + 621.0, + 546.0, + 621.0, + 561.0, + 604.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 540.0, + 652.0, + 540.0, + 652.0, + 560.0, + 635.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 535.0, + 672.0, + 535.0, + 672.0, + 577.0, + 653.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 533.0, + 687.0, + 533.0, + 687.0, + 546.0, + 675.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 528.0, + 892.0, + 528.0, + 892.0, + 753.0, + 793.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 568.0, + 1132.0, + 568.0, + 1132.0, + 589.0, + 1106.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 534.0, + 1230.0, + 534.0, + 1230.0, + 592.0, + 1137.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 609.0, + 451.0, + 609.0, + 451.0, + 628.0, + 435.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 531.0, + 617.0, + 543.0, + 617.0, + 543.0, + 630.0, + 531.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 613.0, + 892.0, + 613.0, + 892.0, + 651.0, + 819.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 599.0, + 1076.0, + 599.0, + 1076.0, + 635.0, + 1044.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 624.0, + 380.0, + 624.0, + 380.0, + 658.0, + 319.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 634.0, + 410.0, + 634.0, + 410.0, + 652.0, + 392.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 632.0, + 1004.0, + 632.0, + 1004.0, + 660.0, + 965.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 677.0, + 379.0, + 677.0, + 379.0, + 712.0, + 317.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 659.0, + 534.0, + 659.0, + 534.0, + 695.0, + 516.0, + 695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 652.0, + 663.0, + 652.0, + 663.0, + 704.0, + 542.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 652.0, + 781.0, + 652.0, + 781.0, + 702.0, + 689.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 659.0, + 890.0, + 659.0, + 890.0, + 693.0, + 820.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 670.0, + 962.0, + 670.0, + 962.0, + 686.0, + 944.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 662.0, + 1044.0, + 662.0, + 1044.0, + 699.0, + 1025.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 656.0, + 1168.0, + 656.0, + 1168.0, + 706.0, + 1050.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 655.0, + 1285.0, + 655.0, + 1285.0, + 706.0, + 1195.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 702.0, + 532.0, + 702.0, + 532.0, + 715.0, + 520.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 693.0, + 616.0, + 693.0, + 616.0, + 725.0, + 542.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 698.0, + 712.0, + 698.0, + 712.0, + 719.0, + 689.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 694.0, + 778.0, + 694.0, + 778.0, + 723.0, + 715.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 701.0, + 892.0, + 701.0, + 892.0, + 739.0, + 819.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 694.0, + 1124.0, + 694.0, + 1124.0, + 726.0, + 1048.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 694.0, + 1283.0, + 694.0, + 1283.0, + 727.0, + 1194.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 719.0, + 414.0, + 719.0, + 414.0, + 743.0, + 392.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 723.0, + 532.0, + 723.0, + 532.0, + 736.0, + 520.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 713.0, + 645.0, + 713.0, + 645.0, + 746.0, + 543.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 720.0, + 709.0, + 720.0, + 709.0, + 737.0, + 690.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 712.0, + 767.0, + 712.0, + 767.0, + 747.0, + 713.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 711.0, + 921.0, + 711.0, + 921.0, + 727.0, + 899.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 726.0, + 1039.0, + 726.0, + 1039.0, + 737.0, + 1028.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 715.0, + 1153.0, + 715.0, + 1153.0, + 747.0, + 1050.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 723.0, + 1213.0, + 723.0, + 1213.0, + 740.0, + 1195.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 711.0, + 1273.0, + 711.0, + 1273.0, + 752.0, + 1215.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 732.0, + 380.0, + 732.0, + 380.0, + 767.0, + 317.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 748.0, + 409.0, + 748.0, + 409.0, + 771.0, + 387.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 743.0, + 534.0, + 743.0, + 534.0, + 760.0, + 517.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 733.0, + 609.0, + 733.0, + 609.0, + 767.0, + 542.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 744.0, + 892.0, + 744.0, + 892.0, + 782.0, + 818.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 748.0, + 923.0, + 748.0, + 923.0, + 771.0, + 897.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 744.0, + 1043.0, + 744.0, + 1043.0, + 760.0, + 1025.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 737.0, + 1117.0, + 737.0, + 1117.0, + 767.0, + 1051.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 768.0, + 527.0, + 768.0, + 527.0, + 806.0, + 410.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 769.0, + 591.0, + 769.0, + 591.0, + 804.0, + 532.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 769.0, + 649.0, + 769.0, + 649.0, + 803.0, + 593.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 769.0, + 712.0, + 769.0, + 712.0, + 804.0, + 654.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 769.0, + 772.0, + 769.0, + 772.0, + 804.0, + 716.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 771.0, + 1035.0, + 771.0, + 1035.0, + 804.0, + 921.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 769.0, + 1154.0, + 769.0, + 1154.0, + 804.0, + 1040.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 771.0, + 1216.0, + 771.0, + 1216.0, + 804.0, + 1159.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 771.0, + 1275.0, + 771.0, + 1275.0, + 806.0, + 1218.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 787.0, + 645.0, + 787.0, + 645.0, + 828.0, + 521.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 790.0, + 1110.0, + 790.0, + 1110.0, + 827.0, + 1028.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 790.0, + 1150.0, + 790.0, + 1150.0, + 827.0, + 1141.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 831.0, + 566.0, + 831.0, + 566.0, + 870.0, + 411.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 831.0, + 682.0, + 831.0, + 682.0, + 870.0, + 678.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 912.0, + 831.0, + 1069.0, + 831.0, + 1069.0, + 870.0, + 912.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 831.0, + 1186.0, + 831.0, + 1186.0, + 870.0, + 1181.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 868.0, + 569.0, + 868.0, + 569.0, + 896.0, + 464.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 868.0, + 672.0, + 868.0, + 672.0, + 896.0, + 586.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 868.0, + 1072.0, + 868.0, + 1072.0, + 896.0, + 966.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 868.0, + 1173.0, + 868.0, + 1173.0, + 896.0, + 1088.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 887.0, + 569.0, + 887.0, + 569.0, + 914.0, + 465.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 887.0, + 700.0, + 887.0, + 700.0, + 914.0, + 588.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 887.0, + 1072.0, + 887.0, + 1072.0, + 914.0, + 965.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 887.0, + 1202.0, + 887.0, + 1202.0, + 914.0, + 1089.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 920.0, + 373.0, + 920.0, + 373.0, + 961.0, + 315.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 925.0, + 1277.0, + 925.0, + 1277.0, + 950.0, + 1225.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 933.0, + 873.0, + 933.0, + 873.0, + 968.0, + 822.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 938.0, + 707.0, + 938.0, + 707.0, + 962.0, + 667.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 938.0, + 770.0, + 938.0, + 770.0, + 949.0, + 757.0, + 949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 939.0, + 838.0, + 939.0, + 838.0, + 1172.0, + 795.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 940.0, + 1232.0, + 940.0, + 1232.0, + 966.0, + 1206.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 945.0, + 672.0, + 945.0, + 672.0, + 968.0, + 645.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 954.0, + 632.0, + 954.0, + 632.0, + 969.0, + 612.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 956.0, + 1202.0, + 956.0, + 1202.0, + 972.0, + 1173.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 963.0, + 660.0, + 963.0, + 660.0, + 976.0, + 648.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 963.0, + 1175.0, + 963.0, + 1175.0, + 1000.0, + 1142.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 965.0, + 621.0, + 965.0, + 621.0, + 983.0, + 602.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 972.0, + 1135.0, + 972.0, + 1135.0, + 995.0, + 1111.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 973.0, + 372.0, + 973.0, + 372.0, + 1009.0, + 318.0, + 1009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 980.0, + 871.0, + 980.0, + 871.0, + 1011.0, + 827.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 986.0, + 327.0, + 986.0, + 327.0, + 1124.0, + 289.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 481.0, + 987.0, + 514.0, + 987.0, + 514.0, + 1014.0, + 481.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 988.0, + 546.0, + 988.0, + 546.0, + 1014.0, + 512.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 991.0, + 1087.0, + 991.0, + 1087.0, + 1004.0, + 1076.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 1016.0, + 562.0, + 1016.0, + 562.0, + 1039.0, + 540.0, + 1039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 1005.0, + 1089.0, + 1005.0, + 1089.0, + 1044.0, + 1050.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.0, + 998.0, + 1121.0, + 998.0, + 1121.0, + 1016.0, + 1102.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1012.0, + 1146.0, + 1012.0, + 1146.0, + 1029.0, + 1129.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1028.0, + 370.0, + 1028.0, + 370.0, + 1058.0, + 321.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1029.0, + 442.0, + 1029.0, + 442.0, + 1047.0, + 424.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1032.0, + 514.0, + 1032.0, + 514.0, + 1050.0, + 497.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1028.0, + 871.0, + 1028.0, + 871.0, + 1058.0, + 823.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 1028.0, + 1143.0, + 1028.0, + 1143.0, + 1050.0, + 1120.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 1041.0, + 1021.0, + 1041.0, + 1021.0, + 1081.0, + 981.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 1044.0, + 1066.0, + 1044.0, + 1066.0, + 1061.0, + 1046.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1051.0, + 399.0, + 1051.0, + 399.0, + 1071.0, + 383.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1076.0, + 372.0, + 1076.0, + 372.0, + 1111.0, + 318.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1076.0, + 529.0, + 1076.0, + 529.0, + 1095.0, + 510.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1071.0, + 661.0, + 1071.0, + 661.0, + 1101.0, + 538.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1068.0, + 782.0, + 1068.0, + 782.0, + 1101.0, + 686.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 1072.0, + 873.0, + 1072.0, + 873.0, + 1107.0, + 820.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1074.0, + 1035.0, + 1074.0, + 1035.0, + 1096.0, + 1013.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 1072.0, + 1162.0, + 1072.0, + 1162.0, + 1099.0, + 1043.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1069.0, + 1283.0, + 1069.0, + 1283.0, + 1098.0, + 1188.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1097.0, + 528.0, + 1097.0, + 528.0, + 1115.0, + 512.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1090.0, + 610.0, + 1090.0, + 610.0, + 1122.0, + 538.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1088.0, + 766.0, + 1088.0, + 766.0, + 1124.0, + 687.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 1097.0, + 947.0, + 1097.0, + 947.0, + 1120.0, + 925.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1097.0, + 1033.0, + 1097.0, + 1033.0, + 1114.0, + 1014.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1090.0, + 1114.0, + 1090.0, + 1114.0, + 1122.0, + 1041.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1095.0, + 1212.0, + 1095.0, + 1212.0, + 1117.0, + 1188.0, + 1117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1090.0, + 1267.0, + 1090.0, + 1267.0, + 1121.0, + 1216.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 1111.0, + 402.0, + 1111.0, + 402.0, + 1131.0, + 384.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1118.0, + 528.0, + 1118.0, + 528.0, + 1135.0, + 512.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 1110.0, + 613.0, + 1110.0, + 613.0, + 1143.0, + 536.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1107.0, + 781.0, + 1107.0, + 781.0, + 1146.0, + 687.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 1120.0, + 873.0, + 1120.0, + 873.0, + 1155.0, + 820.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1120.0, + 1030.0, + 1120.0, + 1030.0, + 1132.0, + 1017.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1110.0, + 1116.0, + 1110.0, + 1116.0, + 1143.0, + 1040.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1110.0, + 1280.0, + 1110.0, + 1280.0, + 1143.0, + 1188.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1127.0, + 373.0, + 1127.0, + 373.0, + 1163.0, + 317.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 1142.0, + 527.0, + 1142.0, + 527.0, + 1155.0, + 513.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 1132.0, + 642.0, + 1132.0, + 642.0, + 1164.0, + 536.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 1142.0, + 704.0, + 1142.0, + 704.0, + 1155.0, + 691.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 1131.0, + 766.0, + 1131.0, + 766.0, + 1166.0, + 712.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1139.0, + 1033.0, + 1139.0, + 1033.0, + 1156.0, + 1014.0, + 1156.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1132.0, + 1146.0, + 1132.0, + 1146.0, + 1164.0, + 1041.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 1139.0, + 1209.0, + 1139.0, + 1209.0, + 1156.0, + 1190.0, + 1156.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1131.0, + 1268.0, + 1131.0, + 1268.0, + 1166.0, + 1214.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1166.0, + 410.0, + 1166.0, + 410.0, + 1191.0, + 388.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 1157.0, + 532.0, + 1157.0, + 532.0, + 1180.0, + 509.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 1152.0, + 605.0, + 1152.0, + 605.0, + 1185.0, + 536.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 1166.0, + 874.0, + 1166.0, + 874.0, + 1202.0, + 819.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 1152.0, + 911.0, + 1152.0, + 911.0, + 1188.0, + 884.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 1160.0, + 1033.0, + 1160.0, + 1033.0, + 1178.0, + 1015.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 1153.0, + 1109.0, + 1153.0, + 1109.0, + 1187.0, + 1041.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1188.0, + 399.0, + 1188.0, + 399.0, + 1223.0, + 361.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 433.0, + 1188.0, + 476.0, + 1188.0, + 476.0, + 1226.0, + 433.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1189.0, + 549.0, + 1189.0, + 549.0, + 1223.0, + 510.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 1188.0, + 626.0, + 1188.0, + 626.0, + 1222.0, + 586.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 1189.0, + 701.0, + 1189.0, + 701.0, + 1223.0, + 661.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 1189.0, + 777.0, + 1189.0, + 777.0, + 1223.0, + 735.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1189.0, + 901.0, + 1189.0, + 901.0, + 1223.0, + 862.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 1188.0, + 977.0, + 1188.0, + 977.0, + 1226.0, + 934.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1189.0, + 1052.0, + 1189.0, + 1052.0, + 1223.0, + 1013.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 1187.0, + 1129.0, + 1187.0, + 1129.0, + 1224.0, + 1085.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1164.0, + 1189.0, + 1202.0, + 1189.0, + 1202.0, + 1223.0, + 1164.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1238.0, + 1189.0, + 1279.0, + 1189.0, + 1279.0, + 1223.0, + 1238.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 1208.0, + 642.0, + 1208.0, + 642.0, + 1248.0, + 513.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1210.0, + 1103.0, + 1210.0, + 1103.0, + 1247.0, + 1017.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1210.0, + 1142.0, + 1210.0, + 1142.0, + 1247.0, + 1135.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1251.0, + 572.0, + 1251.0, + 572.0, + 1290.0, + 405.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1251.0, + 690.0, + 1251.0, + 690.0, + 1290.0, + 686.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 1251.0, + 1075.0, + 1251.0, + 1075.0, + 1290.0, + 907.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1251.0, + 1194.0, + 1251.0, + 1194.0, + 1290.0, + 1188.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1287.0, + 637.0, + 1287.0, + 637.0, + 1319.0, + 529.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 1287.0, + 1042.0, + 1287.0, + 1042.0, + 1319.0, + 1033.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 1287.0, + 1139.0, + 1287.0, + 1139.0, + 1319.0, + 1061.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 1314.0, + 790.0, + 1314.0, + 790.0, + 1347.0, + 752.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 1315.0, + 1290.0, + 1315.0, + 1290.0, + 1347.0, + 1254.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1328.0, + 380.0, + 1328.0, + 380.0, + 1363.0, + 317.0, + 1363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 1333.0, + 881.0, + 1333.0, + 881.0, + 1368.0, + 819.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 1339.0, + 757.0, + 1339.0, + 757.0, + 1368.0, + 726.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 1339.0, + 837.0, + 1339.0, + 837.0, + 1564.0, + 793.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 1343.0, + 1261.0, + 1343.0, + 1261.0, + 1371.0, + 1227.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1383.0, + 380.0, + 1383.0, + 380.0, + 1518.0, + 289.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1364.0, + 720.0, + 1364.0, + 720.0, + 1417.0, + 639.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 1403.0, + 881.0, + 1403.0, + 881.0, + 1436.0, + 822.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1368.0, + 1221.0, + 1368.0, + 1221.0, + 1421.0, + 1140.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1423.0, + 615.0, + 1423.0, + 615.0, + 1448.0, + 593.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1427.0, + 1117.0, + 1427.0, + 1117.0, + 1452.0, + 1094.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1469.0, + 379.0, + 1469.0, + 379.0, + 1503.0, + 317.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 481.0, + 1484.0, + 513.0, + 1484.0, + 513.0, + 1513.0, + 481.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1476.0, + 881.0, + 1476.0, + 881.0, + 1505.0, + 823.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 1481.0, + 1013.0, + 1481.0, + 1013.0, + 1505.0, + 987.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 1513.0, + 535.0, + 1513.0, + 535.0, + 1530.0, + 516.0, + 1530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 1508.0, + 663.0, + 1508.0, + 663.0, + 1534.0, + 543.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1513.0, + 709.0, + 1513.0, + 709.0, + 1530.0, + 690.0, + 1530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1506.0, + 781.0, + 1506.0, + 781.0, + 1536.0, + 716.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 1506.0, + 1164.0, + 1506.0, + 1164.0, + 1537.0, + 1018.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 1512.0, + 1212.0, + 1512.0, + 1212.0, + 1530.0, + 1192.0, + 1530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 1506.0, + 1284.0, + 1506.0, + 1284.0, + 1536.0, + 1218.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1540.0, + 380.0, + 1540.0, + 380.0, + 1573.0, + 317.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 1541.0, + 410.0, + 1541.0, + 410.0, + 1568.0, + 387.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 1530.0, + 536.0, + 1530.0, + 536.0, + 1575.0, + 514.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 1526.0, + 645.0, + 1526.0, + 645.0, + 1579.0, + 540.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1533.0, + 709.0, + 1533.0, + 709.0, + 1570.0, + 690.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 1524.0, + 766.0, + 1524.0, + 766.0, + 1582.0, + 715.0, + 1582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 1543.0, + 882.0, + 1543.0, + 882.0, + 1576.0, + 820.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1540.0, + 915.0, + 1540.0, + 915.0, + 1569.0, + 888.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 1530.0, + 1040.0, + 1530.0, + 1040.0, + 1572.0, + 1018.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 1526.0, + 1147.0, + 1526.0, + 1147.0, + 1579.0, + 1043.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 1530.0, + 1212.0, + 1530.0, + 1212.0, + 1572.0, + 1190.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1524.0, + 1268.0, + 1524.0, + 1268.0, + 1582.0, + 1216.0, + 1582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 1582.0, + 436.0, + 1582.0, + 436.0, + 1617.0, + 398.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 1580.0, + 647.0, + 1580.0, + 647.0, + 1642.0, + 502.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1582.0, + 746.0, + 1582.0, + 746.0, + 1617.0, + 708.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 1582.0, + 938.0, + 1582.0, + 938.0, + 1615.0, + 900.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 1580.0, + 1147.0, + 1580.0, + 1147.0, + 1639.0, + 1004.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1207.0, + 1580.0, + 1250.0, + 1580.0, + 1250.0, + 1619.0, + 1207.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 1643.0, + 562.0, + 1643.0, + 562.0, + 1681.0, + 414.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 1643.0, + 680.0, + 1643.0, + 680.0, + 1681.0, + 675.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1643.0, + 1064.0, + 1643.0, + 1064.0, + 1681.0, + 918.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 1643.0, + 1180.0, + 1643.0, + 1180.0, + 1681.0, + 1176.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 521.5, + 729.0, + 521.5, + 729.0, + 542.0, + 690.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 555.0, + 555.5, + 602.0, + 555.5, + 602.0, + 577.0, + 555.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 587.0, + 1112.0, + 587.0, + 1112.0, + 611.0, + 1059.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 615.0, + 1052.0, + 615.0, + 1052.0, + 641.5, + 1017.0, + 641.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 920.0, + 767.0, + 920.0, + 767.0, + 953.5, + 695.0, + 953.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 966.5, + 638.0, + 966.5, + 638.0, + 1002.0, + 625.0, + 1002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.25, + 960.0, + 606.25, + 960.0, + 606.25, + 998.0, + 538.25, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.25, + 1036.0, + 1051.25, + 1036.0, + 1051.25, + 1055.0, + 1011.25, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 1507.5, + 998.0, + 1507.5, + 998.0, + 1541.0, + 900.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1510.0, + 501.0, + 1510.0, + 501.0, + 1549.0, + 394.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1701.0, + 1406.0, + 1701.0, + 1406.0, + 1739.0, + 294.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1732.0, + 1405.0, + 1732.0, + 1405.0, + 1769.0, + 294.0, + 1769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1761.0, + 465.0, + 1761.0, + 465.0, + 1802.0, + 295.0, + 1802.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": [ + 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": [ + 299, + 278, + 1399, + 278, + 1399, + 1199, + 299, + 1199 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 308, + 1510, + 1391, + 1510, + 1391, + 1819, + 308, + 1819 + ], + "score": 0.967 + }, + { + "category_id": 4, + "poly": [ + 296, + 1227, + 1406, + 1227, + 1406, + 1383, + 296, + 1383 + ], + "score": 0.966 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 815, + 76, + 815, + 104, + 299, + 104 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 865, + 2088, + 865, + 2113, + 835, + 2113 + ], + "score": 0.855 + }, + { + "category_id": 4, + "poly": [ + 296, + 1843, + 1405, + 1843, + 1405, + 1972, + 296, + 1972 + ], + "score": 0.854 + }, + { + "category_id": 4, + "poly": [ + 297, + 1843, + 1404, + 1843, + 1404, + 1972, + 297, + 1972 + ], + "score": 0.402 + }, + { + "category_id": 15, + "poly": [ + 399.0, + 282.0, + 523.0, + 282.0, + 523.0, + 305.0, + 399.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 666.0, + 282.0, + 790.0, + 282.0, + 790.0, + 305.0, + 666.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 284.0, + 1080.0, + 284.0, + 1080.0, + 304.0, + 952.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 282.0, + 1349.0, + 282.0, + 1349.0, + 305.0, + 1218.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 309.0, + 354.0, + 309.0, + 354.0, + 326.0, + 324.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 307.0, + 620.0, + 307.0, + 620.0, + 457.0, + 569.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 313.0, + 904.0, + 313.0, + 904.0, + 330.0, + 879.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 305.0, + 1172.0, + 305.0, + 1172.0, + 459.0, + 1128.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 335.0, + 353.0, + 335.0, + 353.0, + 427.0, + 305.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 332.0, + 623.0, + 332.0, + 623.0, + 374.0, + 588.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 336.0, + 903.0, + 336.0, + 903.0, + 428.0, + 860.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 331.0, + 1172.0, + 331.0, + 1172.0, + 384.0, + 1148.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 375.0, + 622.0, + 375.0, + 622.0, + 392.0, + 590.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 388.0, + 353.0, + 388.0, + 353.0, + 406.0, + 324.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 395.0, + 622.0, + 395.0, + 622.0, + 413.0, + 590.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 395.0, + 904.0, + 395.0, + 904.0, + 413.0, + 880.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 400.0, + 1172.0, + 400.0, + 1172.0, + 419.0, + 1150.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 415.0, + 353.0, + 415.0, + 353.0, + 432.0, + 324.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 423.0, + 425.0, + 423.0, + 425.0, + 440.0, + 395.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 419.0, + 505.0, + 419.0, + 505.0, + 451.0, + 464.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 421.0, + 564.0, + 421.0, + 564.0, + 450.0, + 530.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 415.0, + 623.0, + 415.0, + 623.0, + 435.0, + 587.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 426.0, + 692.0, + 426.0, + 692.0, + 438.0, + 665.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 426.0, + 759.0, + 426.0, + 759.0, + 438.0, + 739.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 421.0, + 834.0, + 421.0, + 834.0, + 450.0, + 799.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 426.0, + 903.0, + 426.0, + 903.0, + 439.0, + 880.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 950.0, + 419.0, + 996.0, + 419.0, + 996.0, + 451.0, + 950.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 426.0, + 1050.0, + 426.0, + 1050.0, + 439.0, + 1029.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 424.0, + 1116.0, + 424.0, + 1116.0, + 439.0, + 1095.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 416.0, + 1172.0, + 416.0, + 1172.0, + 437.0, + 1148.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 426.0, + 1250.0, + 426.0, + 1250.0, + 438.0, + 1225.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 422.0, + 1332.0, + 422.0, + 1332.0, + 450.0, + 1295.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1359.0, + 421.0, + 1394.0, + 421.0, + 1394.0, + 450.0, + 1359.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 442.0, + 354.0, + 442.0, + 354.0, + 459.0, + 324.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 434.0, + 445.0, + 434.0, + 445.0, + 455.0, + 395.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 443.0, + 511.0, + 443.0, + 511.0, + 455.0, + 470.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 440.0, + 565.0, + 440.0, + 565.0, + 457.0, + 533.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 437.0, + 622.0, + 437.0, + 622.0, + 454.0, + 588.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 434.0, + 715.0, + 434.0, + 715.0, + 457.0, + 663.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 432.0, + 780.0, + 432.0, + 780.0, + 455.0, + 738.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 439.0, + 835.0, + 439.0, + 835.0, + 460.0, + 800.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 443.0, + 986.0, + 443.0, + 986.0, + 456.0, + 958.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 435.0, + 1005.0, + 435.0, + 1005.0, + 445.0, + 990.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 432.0, + 1071.0, + 432.0, + 1071.0, + 455.0, + 1028.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 434.0, + 1124.0, + 434.0, + 1124.0, + 457.0, + 1094.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 435.0, + 1170.0, + 435.0, + 1170.0, + 450.0, + 1149.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 434.0, + 1275.0, + 434.0, + 1275.0, + 456.0, + 1225.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 443.0, + 1340.0, + 443.0, + 1340.0, + 455.0, + 1298.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1361.0, + 440.0, + 1393.0, + 440.0, + 1393.0, + 459.0, + 1361.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 460.0, + 377.0, + 460.0, + 377.0, + 481.0, + 354.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 459.0, + 472.0, + 459.0, + 472.0, + 480.0, + 449.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 460.0, + 566.0, + 460.0, + 566.0, + 481.0, + 544.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 460.0, + 644.0, + 460.0, + 644.0, + 481.0, + 622.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 460.0, + 739.0, + 460.0, + 739.0, + 481.0, + 716.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 459.0, + 835.0, + 459.0, + 835.0, + 482.0, + 811.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 460.0, + 928.0, + 460.0, + 928.0, + 481.0, + 905.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 460.0, + 1025.0, + 460.0, + 1025.0, + 480.0, + 1004.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 460.0, + 1125.0, + 460.0, + 1125.0, + 481.0, + 1104.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 460.0, + 1196.0, + 460.0, + 1196.0, + 481.0, + 1174.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 460.0, + 1294.0, + 460.0, + 1294.0, + 481.0, + 1273.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 460.0, + 1394.0, + 460.0, + 1394.0, + 481.0, + 1371.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 473.0, + 499.0, + 473.0, + 499.0, + 501.0, + 420.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 473.0, + 768.0, + 473.0, + 768.0, + 501.0, + 688.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 473.0, + 1054.0, + 473.0, + 1054.0, + 501.0, + 975.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 473.0, + 1323.0, + 473.0, + 1323.0, + 501.0, + 1243.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 503.0, + 534.0, + 503.0, + 534.0, + 523.0, + 387.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 503.0, + 801.0, + 503.0, + 801.0, + 523.0, + 655.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 503.0, + 1093.0, + 503.0, + 1093.0, + 523.0, + 938.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 503.0, + 1361.0, + 503.0, + 1361.0, + 523.0, + 1206.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 519.0, + 354.0, + 519.0, + 354.0, + 536.0, + 319.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 573.0, + 520.0, + 620.0, + 520.0, + 620.0, + 677.0, + 573.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 524.0, + 904.0, + 524.0, + 904.0, + 541.0, + 879.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 524.0, + 1172.0, + 524.0, + 1172.0, + 678.0, + 1128.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 538.0, + 353.0, + 538.0, + 353.0, + 554.0, + 319.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 534.0, + 623.0, + 534.0, + 623.0, + 557.0, + 591.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 554.0, + 353.0, + 554.0, + 353.0, + 646.0, + 301.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 552.0, + 623.0, + 552.0, + 623.0, + 574.0, + 591.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 551.0, + 903.0, + 551.0, + 903.0, + 647.0, + 859.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 553.0, + 1172.0, + 553.0, + 1172.0, + 572.0, + 1150.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 575.0, + 353.0, + 575.0, + 353.0, + 592.0, + 320.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 570.0, + 623.0, + 570.0, + 623.0, + 594.0, + 591.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 572.0, + 904.0, + 572.0, + 904.0, + 591.0, + 879.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 580.0, + 1172.0, + 580.0, + 1172.0, + 601.0, + 1149.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 595.0, + 353.0, + 595.0, + 353.0, + 612.0, + 320.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 590.0, + 623.0, + 590.0, + 623.0, + 612.0, + 591.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 596.0, + 904.0, + 596.0, + 904.0, + 616.0, + 880.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 613.0, + 353.0, + 613.0, + 353.0, + 631.0, + 320.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 610.0, + 622.0, + 610.0, + 622.0, + 632.0, + 591.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 605.0, + 1173.0, + 605.0, + 1173.0, + 632.0, + 1149.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 628.0, + 623.0, + 628.0, + 623.0, + 650.0, + 591.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 621.0, + 904.0, + 621.0, + 904.0, + 640.0, + 880.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 651.0, + 354.0, + 651.0, + 354.0, + 669.0, + 319.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 642.0, + 449.0, + 642.0, + 449.0, + 667.0, + 394.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 643.0, + 515.0, + 643.0, + 515.0, + 667.0, + 468.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 642.0, + 563.0, + 642.0, + 563.0, + 666.0, + 530.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 646.0, + 623.0, + 646.0, + 623.0, + 669.0, + 593.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 644.0, + 718.0, + 644.0, + 718.0, + 667.0, + 664.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 643.0, + 784.0, + 643.0, + 784.0, + 667.0, + 738.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 643.0, + 833.0, + 643.0, + 833.0, + 667.0, + 797.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 646.0, + 904.0, + 646.0, + 904.0, + 665.0, + 879.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 644.0, + 1009.0, + 644.0, + 1009.0, + 667.0, + 955.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 643.0, + 1074.0, + 643.0, + 1074.0, + 667.0, + 1029.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 644.0, + 1121.0, + 644.0, + 1121.0, + 666.0, + 1094.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 640.0, + 1173.0, + 640.0, + 1173.0, + 659.0, + 1150.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 644.0, + 1276.0, + 644.0, + 1276.0, + 667.0, + 1224.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1299.0, + 644.0, + 1343.0, + 644.0, + 1343.0, + 667.0, + 1299.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1358.0, + 640.0, + 1395.0, + 640.0, + 1395.0, + 670.0, + 1358.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 661.0, + 417.0, + 661.0, + 417.0, + 675.0, + 398.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 662.0, + 488.0, + 662.0, + 488.0, + 672.0, + 472.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 661.0, + 685.0, + 661.0, + 685.0, + 675.0, + 665.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 661.0, + 976.0, + 661.0, + 976.0, + 675.0, + 958.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 664.0, + 1046.0, + 664.0, + 1046.0, + 672.0, + 1033.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 661.0, + 1244.0, + 661.0, + 1244.0, + 675.0, + 1225.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 678.0, + 377.0, + 678.0, + 377.0, + 699.0, + 354.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 680.0, + 470.0, + 680.0, + 470.0, + 699.0, + 449.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 680.0, + 566.0, + 680.0, + 566.0, + 699.0, + 545.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 680.0, + 644.0, + 680.0, + 644.0, + 699.0, + 622.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 680.0, + 738.0, + 680.0, + 738.0, + 699.0, + 716.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 680.0, + 834.0, + 680.0, + 834.0, + 699.0, + 811.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 680.0, + 928.0, + 680.0, + 928.0, + 699.0, + 905.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 680.0, + 1025.0, + 680.0, + 1025.0, + 699.0, + 1005.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 680.0, + 1125.0, + 680.0, + 1125.0, + 699.0, + 1104.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 680.0, + 1195.0, + 680.0, + 1195.0, + 699.0, + 1174.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1271.0, + 680.0, + 1293.0, + 680.0, + 1293.0, + 699.0, + 1271.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 680.0, + 1394.0, + 680.0, + 1394.0, + 699.0, + 1371.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 692.0, + 499.0, + 692.0, + 499.0, + 719.0, + 420.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 692.0, + 768.0, + 692.0, + 768.0, + 719.0, + 688.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 692.0, + 1054.0, + 692.0, + 1054.0, + 719.0, + 975.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 692.0, + 1323.0, + 692.0, + 1323.0, + 719.0, + 1243.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 720.0, + 534.0, + 720.0, + 534.0, + 743.0, + 387.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 720.0, + 803.0, + 720.0, + 803.0, + 743.0, + 655.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 720.0, + 1093.0, + 720.0, + 1093.0, + 743.0, + 938.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 720.0, + 1363.0, + 720.0, + 1363.0, + 743.0, + 1206.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 742.0, + 353.0, + 742.0, + 353.0, + 759.0, + 319.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 743.0, + 620.0, + 743.0, + 620.0, + 897.0, + 574.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 748.0, + 904.0, + 748.0, + 904.0, + 765.0, + 879.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 743.0, + 1172.0, + 743.0, + 1172.0, + 899.0, + 1128.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 762.0, + 353.0, + 762.0, + 353.0, + 779.0, + 319.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 758.0, + 623.0, + 758.0, + 623.0, + 780.0, + 591.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 772.0, + 354.0, + 772.0, + 354.0, + 868.0, + 296.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 777.0, + 623.0, + 777.0, + 623.0, + 800.0, + 591.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 772.0, + 904.0, + 772.0, + 904.0, + 864.0, + 857.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 778.0, + 1170.0, + 778.0, + 1170.0, + 797.0, + 1150.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 800.0, + 353.0, + 800.0, + 353.0, + 817.0, + 319.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 796.0, + 623.0, + 796.0, + 623.0, + 819.0, + 591.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 804.0, + 1172.0, + 804.0, + 1172.0, + 827.0, + 1150.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 819.0, + 353.0, + 819.0, + 353.0, + 837.0, + 319.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 817.0, + 623.0, + 817.0, + 623.0, + 839.0, + 591.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 817.0, + 904.0, + 817.0, + 904.0, + 838.0, + 880.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 837.0, + 354.0, + 837.0, + 354.0, + 858.0, + 318.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 835.0, + 624.0, + 835.0, + 624.0, + 862.0, + 592.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 842.0, + 904.0, + 842.0, + 904.0, + 861.0, + 880.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 837.0, + 1172.0, + 837.0, + 1172.0, + 856.0, + 1150.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 859.0, + 354.0, + 859.0, + 354.0, + 876.0, + 319.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 861.0, + 454.0, + 861.0, + 454.0, + 900.0, + 391.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 869.0, + 516.0, + 869.0, + 516.0, + 899.0, + 465.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 864.0, + 561.0, + 864.0, + 561.0, + 885.0, + 534.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 859.0, + 622.0, + 859.0, + 622.0, + 877.0, + 594.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 864.0, + 720.0, + 864.0, + 720.0, + 899.0, + 657.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 861.0, + 786.0, + 861.0, + 786.0, + 900.0, + 732.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 859.0, + 834.0, + 859.0, + 834.0, + 888.0, + 798.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 867.0, + 904.0, + 867.0, + 904.0, + 886.0, + 879.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 950.0, + 861.0, + 1014.0, + 861.0, + 1014.0, + 900.0, + 950.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 867.0, + 1077.0, + 867.0, + 1077.0, + 899.0, + 1025.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 864.0, + 1121.0, + 864.0, + 1121.0, + 885.0, + 1094.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 864.0, + 1173.0, + 864.0, + 1173.0, + 886.0, + 1149.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 864.0, + 1280.0, + 864.0, + 1280.0, + 897.0, + 1216.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 861.0, + 1344.0, + 861.0, + 1344.0, + 897.0, + 1292.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 861.0, + 1392.0, + 861.0, + 1392.0, + 885.0, + 1360.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 878.0, + 353.0, + 878.0, + 353.0, + 896.0, + 319.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 878.0, + 622.0, + 878.0, + 622.0, + 896.0, + 593.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 898.0, + 377.0, + 898.0, + 377.0, + 919.0, + 354.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 898.0, + 470.0, + 898.0, + 470.0, + 919.0, + 449.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 898.0, + 566.0, + 898.0, + 566.0, + 918.0, + 544.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 898.0, + 644.0, + 898.0, + 644.0, + 919.0, + 623.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 898.0, + 739.0, + 898.0, + 739.0, + 919.0, + 716.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 898.0, + 834.0, + 898.0, + 834.0, + 919.0, + 811.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 898.0, + 928.0, + 898.0, + 928.0, + 919.0, + 905.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 898.0, + 1025.0, + 898.0, + 1025.0, + 919.0, + 1004.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 898.0, + 1125.0, + 898.0, + 1125.0, + 918.0, + 1104.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 898.0, + 1195.0, + 898.0, + 1195.0, + 918.0, + 1174.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1271.0, + 898.0, + 1294.0, + 898.0, + 1294.0, + 919.0, + 1271.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 898.0, + 1394.0, + 898.0, + 1394.0, + 919.0, + 1371.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 910.0, + 499.0, + 910.0, + 499.0, + 940.0, + 420.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 911.0, + 768.0, + 911.0, + 768.0, + 939.0, + 688.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 911.0, + 1056.0, + 911.0, + 1056.0, + 939.0, + 975.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 911.0, + 1323.0, + 911.0, + 1323.0, + 939.0, + 1243.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 941.0, + 538.0, + 941.0, + 538.0, + 961.0, + 383.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 941.0, + 807.0, + 941.0, + 807.0, + 961.0, + 652.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 941.0, + 1096.0, + 941.0, + 1096.0, + 961.0, + 934.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1203.0, + 941.0, + 1365.0, + 941.0, + 1365.0, + 961.0, + 1203.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 972.0, + 353.0, + 972.0, + 353.0, + 989.0, + 324.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 573.0, + 963.0, + 623.0, + 963.0, + 623.0, + 1114.0, + 573.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 966.0, + 904.0, + 966.0, + 904.0, + 983.0, + 879.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 963.0, + 1172.0, + 963.0, + 1172.0, + 1114.0, + 1129.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 991.0, + 353.0, + 991.0, + 353.0, + 1085.0, + 302.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1000.0, + 623.0, + 1000.0, + 623.0, + 1022.0, + 591.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 991.0, + 904.0, + 991.0, + 904.0, + 1083.0, + 860.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 1001.0, + 1172.0, + 1001.0, + 1172.0, + 1020.0, + 1150.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1012.0, + 353.0, + 1012.0, + 353.0, + 1031.0, + 325.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1033.0, + 353.0, + 1033.0, + 353.0, + 1051.0, + 325.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1028.0, + 904.0, + 1028.0, + 904.0, + 1047.0, + 880.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 1033.0, + 1172.0, + 1033.0, + 1172.0, + 1053.0, + 1150.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1054.0, + 354.0, + 1054.0, + 354.0, + 1071.0, + 324.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1056.0, + 623.0, + 1056.0, + 623.0, + 1078.0, + 591.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1060.0, + 904.0, + 1060.0, + 904.0, + 1078.0, + 879.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 1067.0, + 1170.0, + 1067.0, + 1170.0, + 1082.0, + 1150.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1075.0, + 354.0, + 1075.0, + 354.0, + 1113.0, + 324.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1082.0, + 449.0, + 1082.0, + 449.0, + 1113.0, + 394.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1077.0, + 514.0, + 1077.0, + 514.0, + 1114.0, + 464.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 1078.0, + 564.0, + 1078.0, + 564.0, + 1113.0, + 530.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1087.0, + 622.0, + 1087.0, + 622.0, + 1104.0, + 594.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1076.0, + 723.0, + 1076.0, + 723.0, + 1113.0, + 659.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1077.0, + 781.0, + 1077.0, + 781.0, + 1114.0, + 733.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 1078.0, + 834.0, + 1078.0, + 834.0, + 1115.0, + 799.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1093.0, + 905.0, + 1093.0, + 905.0, + 1110.0, + 879.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1082.0, + 1009.0, + 1082.0, + 1009.0, + 1113.0, + 954.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1024.0, + 1077.0, + 1074.0, + 1077.0, + 1074.0, + 1114.0, + 1024.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 1078.0, + 1124.0, + 1078.0, + 1124.0, + 1115.0, + 1090.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 1098.0, + 1173.0, + 1098.0, + 1173.0, + 1116.0, + 1149.0, + 1116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 1076.0, + 1281.0, + 1076.0, + 1281.0, + 1113.0, + 1219.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 1075.0, + 1341.0, + 1075.0, + 1341.0, + 1113.0, + 1292.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1359.0, + 1078.0, + 1394.0, + 1078.0, + 1394.0, + 1115.0, + 1359.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1116.0, + 377.0, + 1116.0, + 377.0, + 1137.0, + 354.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1116.0, + 472.0, + 1116.0, + 472.0, + 1137.0, + 449.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 1116.0, + 566.0, + 1116.0, + 566.0, + 1137.0, + 545.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 1116.0, + 644.0, + 1116.0, + 644.0, + 1137.0, + 622.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1118.0, + 738.0, + 1118.0, + 738.0, + 1137.0, + 716.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1116.0, + 928.0, + 1116.0, + 928.0, + 1137.0, + 905.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 1118.0, + 1025.0, + 1118.0, + 1025.0, + 1137.0, + 1005.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 1116.0, + 1125.0, + 1116.0, + 1125.0, + 1137.0, + 1104.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 1116.0, + 1195.0, + 1116.0, + 1195.0, + 1137.0, + 1174.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1118.0, + 1294.0, + 1118.0, + 1294.0, + 1137.0, + 1273.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 1116.0, + 1395.0, + 1116.0, + 1395.0, + 1140.0, + 1371.0, + 1140.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 1130.0, + 499.0, + 1130.0, + 499.0, + 1157.0, + 420.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1130.0, + 768.0, + 1130.0, + 768.0, + 1157.0, + 688.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1130.0, + 1056.0, + 1130.0, + 1056.0, + 1157.0, + 975.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 1130.0, + 1323.0, + 1130.0, + 1323.0, + 1157.0, + 1243.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 494.0, + 1172.0, + 645.0, + 1172.0, + 645.0, + 1201.0, + 494.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1172.0, + 1211.0, + 1172.0, + 1211.0, + 1201.0, + 1048.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 379.5, + 1169.0, + 379.5, + 1169.0, + 400.5, + 1152.0, + 400.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 629.5, + 350.0, + 629.5, + 350.0, + 650.5, + 319.0, + 650.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 794.0, + 896.0, + 794.0, + 896.0, + 814.0, + 887.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.75, + 860.0, + 501.75, + 860.0, + 501.75, + 877.0, + 467.75, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 860.0, + 1060.0, + 860.0, + 1060.0, + 877.0, + 1028.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1027.0, + 620.0, + 1027.0, + 620.0, + 1050.0, + 594.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.25, + 1117.0, + 838.25, + 1117.0, + 838.25, + 1136.5, + 807.25, + 1136.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 1514.0, + 610.0, + 1514.0, + 610.0, + 1542.0, + 566.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 669.0, + 1513.0, + 788.0, + 1513.0, + 788.0, + 1542.0, + 669.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 1514.0, + 959.0, + 1514.0, + 959.0, + 1542.0, + 848.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1514.0, + 1061.0, + 1514.0, + 1061.0, + 1542.0, + 1017.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 1512.0, + 1183.0, + 1512.0, + 1183.0, + 1542.0, + 1118.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 1553.0, + 538.0, + 1553.0, + 538.0, + 1578.0, + 378.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 1553.0, + 806.0, + 1553.0, + 806.0, + 1576.0, + 645.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1553.0, + 1075.0, + 1553.0, + 1075.0, + 1578.0, + 915.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1553.0, + 1345.0, + 1553.0, + 1345.0, + 1578.0, + 1183.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1566.0, + 1155.0, + 1566.0, + 1155.0, + 1588.0, + 1135.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1601.0, + 347.0, + 1601.0, + 347.0, + 1622.0, + 328.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1592.0, + 617.0, + 1592.0, + 617.0, + 1613.0, + 597.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1595.0, + 884.0, + 1595.0, + 884.0, + 1617.0, + 866.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1631.0, + 606.0, + 1631.0, + 606.0, + 1722.0, + 577.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1616.0, + 875.0, + 1616.0, + 875.0, + 1735.0, + 847.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 1622.0, + 1151.0, + 1622.0, + 1151.0, + 1731.0, + 1116.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 1650.0, + 345.0, + 1650.0, + 345.0, + 1696.0, + 310.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1645.0, + 615.0, + 1645.0, + 615.0, + 1671.0, + 597.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1650.0, + 880.0, + 1650.0, + 880.0, + 1671.0, + 868.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1705.0, + 347.0, + 1705.0, + 347.0, + 1728.0, + 328.0, + 1728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1700.0, + 615.0, + 1700.0, + 615.0, + 1726.0, + 597.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1703.0, + 882.0, + 1703.0, + 882.0, + 1725.0, + 868.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1693.0, + 1153.0, + 1693.0, + 1153.0, + 1718.0, + 1135.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1762.0, + 345.0, + 1762.0, + 345.0, + 1780.0, + 331.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 1759.0, + 617.0, + 1759.0, + 617.0, + 1781.0, + 598.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1760.0, + 883.0, + 1760.0, + 883.0, + 1780.0, + 868.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1759.0, + 1154.0, + 1759.0, + 1154.0, + 1781.0, + 1135.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 1778.0, + 355.0, + 1778.0, + 355.0, + 1800.0, + 337.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 1776.0, + 419.0, + 1776.0, + 419.0, + 1804.0, + 385.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1774.0, + 475.0, + 1774.0, + 475.0, + 1803.0, + 439.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1777.0, + 529.0, + 1777.0, + 529.0, + 1801.0, + 497.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 1777.0, + 583.0, + 1777.0, + 583.0, + 1801.0, + 553.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1778.0, + 626.0, + 1778.0, + 626.0, + 1800.0, + 604.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 1777.0, + 687.0, + 1777.0, + 687.0, + 1803.0, + 656.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1774.0, + 744.0, + 1774.0, + 744.0, + 1803.0, + 709.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 1774.0, + 799.0, + 1774.0, + 799.0, + 1803.0, + 764.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1777.0, + 853.0, + 1777.0, + 853.0, + 1801.0, + 821.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 1778.0, + 895.0, + 1778.0, + 895.0, + 1801.0, + 874.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1776.0, + 958.0, + 1776.0, + 958.0, + 1804.0, + 923.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 1774.0, + 1012.0, + 1774.0, + 1012.0, + 1804.0, + 978.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 1776.0, + 1069.0, + 1776.0, + 1069.0, + 1804.0, + 1033.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 1777.0, + 1122.0, + 1777.0, + 1122.0, + 1801.0, + 1090.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 1778.0, + 1164.0, + 1778.0, + 1164.0, + 1800.0, + 1144.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 1776.0, + 1227.0, + 1776.0, + 1227.0, + 1804.0, + 1192.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 1774.0, + 1281.0, + 1774.0, + 1281.0, + 1803.0, + 1246.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1304.0, + 1777.0, + 1336.0, + 1777.0, + 1336.0, + 1801.0, + 1304.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1358.0, + 1777.0, + 1390.0, + 1777.0, + 1390.0, + 1801.0, + 1358.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 1794.0, + 503.0, + 1794.0, + 503.0, + 1819.0, + 411.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1794.0, + 773.0, + 1794.0, + 773.0, + 1819.0, + 681.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 1794.0, + 1042.0, + 1794.0, + 1042.0, + 1819.0, + 949.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 1794.0, + 1310.0, + 1794.0, + 1310.0, + 1819.0, + 1218.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1229.0, + 1404.0, + 1229.0, + 1404.0, + 1262.0, + 295.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1257.0, + 1406.0, + 1257.0, + 1406.0, + 1293.0, + 293.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1289.0, + 1406.0, + 1289.0, + 1406.0, + 1326.0, + 295.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1320.0, + 1404.0, + 1320.0, + 1404.0, + 1353.0, + 295.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1348.0, + 1382.0, + 1348.0, + 1382.0, + 1386.0, + 293.0, + 1386.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, + 869.0, + 2085.0, + 869.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1843.0, + 1406.0, + 1843.0, + 1406.0, + 1880.0, + 294.0, + 1880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1874.0, + 1407.0, + 1874.0, + 1407.0, + 1912.0, + 289.0, + 1912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1906.0, + 1403.0, + 1906.0, + 1403.0, + 1946.0, + 290.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1940.0, + 1005.0, + 1940.0, + 1005.0, + 1972.0, + 294.0, + 1972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1843.0, + 1404.0, + 1843.0, + 1404.0, + 1880.0, + 294.0, + 1880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1874.0, + 1407.0, + 1874.0, + 1407.0, + 1912.0, + 290.0, + 1912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1906.0, + 1404.0, + 1906.0, + 1404.0, + 1946.0, + 291.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1940.0, + 1005.0, + 1940.0, + 1005.0, + 1972.0, + 295.0, + 1972.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 21, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 306, + 396, + 1389, + 396, + 1389, + 1547, + 306, + 1547 + ], + "score": 0.976 + }, + { + "category_id": 4, + "poly": [ + 298, + 1569, + 1405, + 1569, + 1405, + 1725, + 298, + 1725 + ], + "score": 0.948 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 816, + 76, + 816, + 104, + 299, + 104 + ], + "score": 0.897 + }, + { + "category_id": 1, + "poly": [ + 297, + 1726, + 1404, + 1726, + 1404, + 1847, + 297, + 1847 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 865, + 2088, + 865, + 2112, + 835, + 2112 + ], + "score": 0.852 + }, + { + "category_id": 15, + "poly": [ + 380.0, + 405.0, + 443.0, + 405.0, + 443.0, + 431.0, + 380.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 406.0, + 578.0, + 406.0, + 578.0, + 432.0, + 503.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 405.0, + 682.0, + 405.0, + 682.0, + 432.0, + 635.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 406.0, + 861.0, + 406.0, + 861.0, + 431.0, + 741.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 406.0, + 1032.0, + 406.0, + 1032.0, + 431.0, + 921.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 405.0, + 1135.0, + 405.0, + 1135.0, + 432.0, + 1090.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 405.0, + 1254.0, + 405.0, + 1254.0, + 431.0, + 1193.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1311.0, + 403.0, + 1378.0, + 403.0, + 1378.0, + 433.0, + 1311.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 457.0, + 543.0, + 457.0, + 543.0, + 482.0, + 388.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 457.0, + 828.0, + 457.0, + 828.0, + 482.0, + 640.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 457.0, + 1097.0, + 457.0, + 1097.0, + 482.0, + 910.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 455.0, + 1381.0, + 455.0, + 1381.0, + 482.0, + 1161.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 472.0, + 359.0, + 472.0, + 359.0, + 498.0, + 326.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 474.0, + 630.0, + 474.0, + 630.0, + 502.0, + 593.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 479.0, + 896.0, + 479.0, + 896.0, + 509.0, + 862.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 475.0, + 1166.0, + 475.0, + 1166.0, + 502.0, + 1122.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 522.0, + 358.0, + 522.0, + 358.0, + 548.0, + 327.0, + 548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 522.0, + 628.0, + 522.0, + 628.0, + 552.0, + 593.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 525.0, + 1093.0, + 525.0, + 1093.0, + 535.0, + 1077.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 514.0, + 1164.0, + 514.0, + 1164.0, + 540.0, + 1133.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 530.0, + 895.0, + 530.0, + 895.0, + 556.0, + 863.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 551.0, + 366.0, + 551.0, + 366.0, + 611.0, + 301.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 551.0, + 1166.0, + 551.0, + 1166.0, + 581.0, + 1131.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 571.0, + 628.0, + 571.0, + 628.0, + 601.0, + 593.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 579.0, + 896.0, + 579.0, + 896.0, + 605.0, + 865.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 592.0, + 1166.0, + 592.0, + 1166.0, + 618.0, + 1133.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 622.0, + 359.0, + 622.0, + 359.0, + 648.0, + 327.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 621.0, + 628.0, + 621.0, + 628.0, + 651.0, + 593.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 629.0, + 894.0, + 629.0, + 894.0, + 654.0, + 874.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 629.0, + 1166.0, + 629.0, + 1166.0, + 659.0, + 1131.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 674.0, + 359.0, + 674.0, + 359.0, + 697.0, + 338.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 673.0, + 628.0, + 673.0, + 628.0, + 698.0, + 606.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 668.0, + 1178.0, + 668.0, + 1178.0, + 697.0, + 1141.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 690.0, + 375.0, + 690.0, + 375.0, + 712.0, + 354.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 689.0, + 482.0, + 689.0, + 482.0, + 713.0, + 447.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 688.0, + 584.0, + 688.0, + 584.0, + 712.0, + 539.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 689.0, + 644.0, + 689.0, + 644.0, + 712.0, + 622.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 686.0, + 751.0, + 686.0, + 751.0, + 715.0, + 714.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 686.0, + 854.0, + 686.0, + 854.0, + 715.0, + 811.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 690.0, + 914.0, + 690.0, + 914.0, + 712.0, + 891.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 687.0, + 1018.0, + 687.0, + 1018.0, + 713.0, + 985.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 687.0, + 1122.0, + 687.0, + 1122.0, + 712.0, + 1076.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 690.0, + 1182.0, + 690.0, + 1182.0, + 713.0, + 1159.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 687.0, + 1287.0, + 687.0, + 1287.0, + 713.0, + 1254.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 687.0, + 1391.0, + 687.0, + 1391.0, + 715.0, + 1349.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 704.0, + 512.0, + 704.0, + 512.0, + 730.0, + 420.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 704.0, + 781.0, + 704.0, + 781.0, + 730.0, + 688.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 703.0, + 1050.0, + 703.0, + 1050.0, + 732.0, + 956.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 701.0, + 1319.0, + 701.0, + 1319.0, + 735.0, + 1223.0, + 735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 728.0, + 543.0, + 728.0, + 543.0, + 753.0, + 388.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 728.0, + 829.0, + 728.0, + 829.0, + 753.0, + 640.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 728.0, + 1097.0, + 728.0, + 1097.0, + 753.0, + 908.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 728.0, + 1382.0, + 728.0, + 1382.0, + 753.0, + 1162.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 755.0, + 359.0, + 755.0, + 359.0, + 785.0, + 325.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 753.0, + 895.0, + 753.0, + 895.0, + 779.0, + 863.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 746.0, + 1166.0, + 746.0, + 1166.0, + 773.0, + 1122.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 770.0, + 628.0, + 770.0, + 628.0, + 799.0, + 593.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 796.0, + 895.0, + 796.0, + 895.0, + 819.0, + 874.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 785.0, + 1164.0, + 785.0, + 1164.0, + 811.0, + 1131.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 806.0, + 358.0, + 806.0, + 358.0, + 902.0, + 307.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 813.0, + 628.0, + 813.0, + 628.0, + 844.0, + 594.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 824.0, + 1164.0, + 824.0, + 1164.0, + 850.0, + 1133.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 836.0, + 895.0, + 836.0, + 895.0, + 861.0, + 875.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 853.0, + 358.0, + 853.0, + 358.0, + 879.0, + 325.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 859.0, + 627.0, + 859.0, + 627.0, + 885.0, + 595.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 863.0, + 1166.0, + 863.0, + 1166.0, + 889.0, + 1133.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 879.0, + 895.0, + 879.0, + 895.0, + 901.0, + 875.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 902.0, + 355.0, + 902.0, + 355.0, + 923.0, + 339.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 904.0, + 626.0, + 904.0, + 626.0, + 928.0, + 606.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 900.0, + 1166.0, + 900.0, + 1166.0, + 930.0, + 1130.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 921.0, + 892.0, + 921.0, + 892.0, + 943.0, + 877.0, + 943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 931.0, + 925.0, + 931.0, + 925.0, + 952.0, + 903.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 952.0, + 375.0, + 952.0, + 375.0, + 982.0, + 339.0, + 982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 960.0, + 482.0, + 960.0, + 482.0, + 985.0, + 447.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 957.0, + 586.0, + 957.0, + 586.0, + 985.0, + 541.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 947.0, + 645.0, + 947.0, + 645.0, + 985.0, + 605.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 960.0, + 748.0, + 960.0, + 748.0, + 985.0, + 717.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 957.0, + 854.0, + 957.0, + 854.0, + 986.0, + 811.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 961.0, + 914.0, + 961.0, + 914.0, + 983.0, + 891.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 958.0, + 1018.0, + 958.0, + 1018.0, + 985.0, + 985.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 958.0, + 1122.0, + 958.0, + 1122.0, + 983.0, + 1076.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 942.0, + 1182.0, + 942.0, + 1182.0, + 985.0, + 1142.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 958.0, + 1287.0, + 958.0, + 1287.0, + 985.0, + 1254.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 960.0, + 1390.0, + 960.0, + 1390.0, + 983.0, + 1351.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 975.0, + 511.0, + 975.0, + 511.0, + 1001.0, + 418.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 975.0, + 781.0, + 975.0, + 781.0, + 1001.0, + 688.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 975.0, + 1048.0, + 975.0, + 1048.0, + 1001.0, + 956.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 972.0, + 1319.0, + 972.0, + 1319.0, + 1006.0, + 1223.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 999.0, + 543.0, + 999.0, + 543.0, + 1024.0, + 388.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 999.0, + 829.0, + 999.0, + 829.0, + 1024.0, + 640.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 999.0, + 1097.0, + 999.0, + 1097.0, + 1024.0, + 908.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 999.0, + 1381.0, + 999.0, + 1381.0, + 1024.0, + 1160.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 1017.0, + 630.0, + 1017.0, + 630.0, + 1044.0, + 585.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1015.0, + 898.0, + 1015.0, + 898.0, + 1044.0, + 862.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1031.0, + 359.0, + 1031.0, + 359.0, + 1058.0, + 327.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1035.0, + 1166.0, + 1035.0, + 1166.0, + 1065.0, + 1131.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 1064.0, + 337.0, + 1064.0, + 337.0, + 1186.0, + 303.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1055.0, + 630.0, + 1055.0, + 630.0, + 1084.0, + 593.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 1067.0, + 895.0, + 1067.0, + 895.0, + 1093.0, + 863.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1091.0, + 358.0, + 1091.0, + 358.0, + 1119.0, + 327.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1093.0, + 630.0, + 1093.0, + 630.0, + 1124.0, + 594.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1095.0, + 1166.0, + 1095.0, + 1166.0, + 1121.0, + 1133.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1119.0, + 896.0, + 1119.0, + 896.0, + 1144.0, + 865.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1134.0, + 627.0, + 1134.0, + 627.0, + 1160.0, + 594.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1154.0, + 358.0, + 1154.0, + 358.0, + 1180.0, + 326.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 1153.0, + 1166.0, + 1153.0, + 1166.0, + 1183.0, + 1130.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1171.0, + 628.0, + 1171.0, + 628.0, + 1201.0, + 594.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1170.0, + 894.0, + 1170.0, + 894.0, + 1196.0, + 875.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 1218.0, + 359.0, + 1218.0, + 359.0, + 1240.0, + 338.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 1214.0, + 628.0, + 1214.0, + 628.0, + 1236.0, + 606.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 1214.0, + 1166.0, + 1214.0, + 1166.0, + 1237.0, + 1143.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1232.0, + 375.0, + 1232.0, + 375.0, + 1254.0, + 354.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 1228.0, + 483.0, + 1228.0, + 483.0, + 1257.0, + 446.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1228.0, + 585.0, + 1228.0, + 585.0, + 1257.0, + 541.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 1231.0, + 644.0, + 1231.0, + 644.0, + 1254.0, + 622.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1230.0, + 750.0, + 1230.0, + 750.0, + 1256.0, + 717.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 1228.0, + 854.0, + 1228.0, + 854.0, + 1257.0, + 811.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 1231.0, + 914.0, + 1231.0, + 914.0, + 1254.0, + 891.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1230.0, + 1018.0, + 1230.0, + 1018.0, + 1256.0, + 985.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 1229.0, + 1122.0, + 1229.0, + 1122.0, + 1254.0, + 1076.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1232.0, + 1182.0, + 1232.0, + 1182.0, + 1256.0, + 1159.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 1230.0, + 1287.0, + 1230.0, + 1287.0, + 1256.0, + 1254.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 1231.0, + 1390.0, + 1231.0, + 1390.0, + 1254.0, + 1351.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1245.0, + 511.0, + 1245.0, + 511.0, + 1271.0, + 418.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1246.0, + 781.0, + 1246.0, + 781.0, + 1273.0, + 688.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1245.0, + 1050.0, + 1245.0, + 1050.0, + 1274.0, + 956.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1244.0, + 1319.0, + 1244.0, + 1319.0, + 1277.0, + 1223.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1288.0, + 359.0, + 1288.0, + 359.0, + 1314.0, + 326.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1269.0, + 543.0, + 1269.0, + 543.0, + 1293.0, + 388.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 1270.0, + 829.0, + 1270.0, + 829.0, + 1295.0, + 640.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1270.0, + 1097.0, + 1270.0, + 1097.0, + 1295.0, + 908.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1270.0, + 1382.0, + 1270.0, + 1382.0, + 1305.0, + 1133.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1306.0, + 895.0, + 1306.0, + 895.0, + 1331.0, + 865.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1327.0, + 358.0, + 1327.0, + 358.0, + 1353.0, + 327.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1317.0, + 627.0, + 1317.0, + 627.0, + 1343.0, + 594.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1342.0, + 356.0, + 1342.0, + 356.0, + 1452.0, + 307.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1357.0, + 628.0, + 1357.0, + 628.0, + 1387.0, + 594.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 1369.0, + 896.0, + 1369.0, + 896.0, + 1394.0, + 863.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1347.0, + 1166.0, + 1347.0, + 1166.0, + 1377.0, + 1131.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1405.0, + 356.0, + 1405.0, + 356.0, + 1432.0, + 327.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 1403.0, + 627.0, + 1403.0, + 627.0, + 1429.0, + 595.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1430.0, + 894.0, + 1430.0, + 894.0, + 1456.0, + 875.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1416.0, + 1166.0, + 1416.0, + 1166.0, + 1446.0, + 1131.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1446.0, + 358.0, + 1446.0, + 358.0, + 1472.0, + 329.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 1447.0, + 626.0, + 1447.0, + 626.0, + 1472.0, + 606.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1482.0, + 919.0, + 1482.0, + 919.0, + 1494.0, + 906.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 1488.0, + 363.0, + 1488.0, + 363.0, + 1508.0, + 338.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 1489.0, + 1166.0, + 1489.0, + 1166.0, + 1512.0, + 1145.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1502.0, + 375.0, + 1502.0, + 375.0, + 1524.0, + 354.0, + 1524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 1499.0, + 483.0, + 1499.0, + 483.0, + 1528.0, + 446.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1499.0, + 585.0, + 1499.0, + 585.0, + 1527.0, + 541.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1501.0, + 748.0, + 1501.0, + 748.0, + 1527.0, + 717.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 1499.0, + 854.0, + 1499.0, + 854.0, + 1528.0, + 811.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 1502.0, + 914.0, + 1502.0, + 914.0, + 1525.0, + 891.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1501.0, + 1018.0, + 1501.0, + 1018.0, + 1527.0, + 985.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 1499.0, + 1123.0, + 1499.0, + 1123.0, + 1527.0, + 1080.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 1502.0, + 1182.0, + 1502.0, + 1182.0, + 1525.0, + 1159.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 1501.0, + 1286.0, + 1501.0, + 1286.0, + 1527.0, + 1254.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 1502.0, + 1390.0, + 1502.0, + 1390.0, + 1525.0, + 1351.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1515.0, + 514.0, + 1515.0, + 514.0, + 1548.0, + 418.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1515.0, + 783.0, + 1515.0, + 783.0, + 1548.0, + 686.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1515.0, + 1051.0, + 1515.0, + 1051.0, + 1548.0, + 955.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1515.0, + 1319.0, + 1515.0, + 1319.0, + 1548.0, + 1223.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 560.0, + 520.0, + 560.0, + 520.0, + 589.0, + 413.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.75, + 625.0, + 1277.75, + 625.0, + 1277.75, + 638.0, + 1240.75, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.25, + 886.5, + 424.25, + 886.5, + 424.25, + 897.0, + 397.25, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1494.0, + 634.0, + 1494.0, + 634.0, + 1520.0, + 615.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1568.0, + 1406.0, + 1568.0, + 1406.0, + 1606.0, + 295.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1592.0, + 1410.0, + 1592.0, + 1410.0, + 1640.0, + 290.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1634.0, + 1405.0, + 1634.0, + 1405.0, + 1667.0, + 296.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1662.0, + 1406.0, + 1662.0, + 1406.0, + 1698.0, + 295.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1692.0, + 1112.0, + 1692.0, + 1112.0, + 1728.0, + 295.0, + 1728.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": [ + 830.0, + 2084.0, + 869.0, + 2084.0, + 869.0, + 2122.0, + 830.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1724.0, + 1402.0, + 1724.0, + 1402.0, + 1759.0, + 296.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1753.0, + 1405.0, + 1753.0, + 1405.0, + 1791.0, + 295.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1780.0, + 1405.0, + 1780.0, + 1405.0, + 1825.0, + 292.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1812.0, + 427.0, + 1812.0, + 427.0, + 1852.0, + 294.0, + 1852.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 22, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 308, + 454, + 1389, + 454, + 1389, + 1607, + 308, + 1607 + ], + "score": 0.974 + }, + { + "category_id": 4, + "poly": [ + 296, + 1624, + 1406, + 1624, + 1406, + 1782, + 296, + 1782 + ], + "score": 0.961 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 816, + 76, + 816, + 105, + 299, + 105 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 865, + 2088, + 865, + 2112, + 834, + 2112 + ], + "score": 0.853 + }, + { + "category_id": 15, + "poly": [ + 381.0, + 471.0, + 443.0, + 471.0, + 443.0, + 497.0, + 381.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 472.0, + 576.0, + 472.0, + 576.0, + 498.0, + 502.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 471.0, + 678.0, + 471.0, + 678.0, + 498.0, + 634.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 472.0, + 856.0, + 472.0, + 856.0, + 497.0, + 736.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 472.0, + 1025.0, + 472.0, + 1025.0, + 497.0, + 917.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 471.0, + 1128.0, + 471.0, + 1128.0, + 498.0, + 1084.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 471.0, + 1245.0, + 471.0, + 1245.0, + 497.0, + 1186.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 469.0, + 1368.0, + 469.0, + 1368.0, + 497.0, + 1305.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 521.0, + 564.0, + 521.0, + 564.0, + 546.0, + 403.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 522.0, + 843.0, + 522.0, + 843.0, + 545.0, + 647.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 520.0, + 1104.0, + 520.0, + 1104.0, + 546.0, + 908.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 522.0, + 1382.0, + 522.0, + 1382.0, + 545.0, + 1152.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 548.0, + 371.0, + 548.0, + 371.0, + 572.0, + 341.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 541.0, + 635.0, + 541.0, + 635.0, + 570.0, + 588.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 532.0, + 1155.0, + 532.0, + 1155.0, + 555.0, + 1123.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 559.0, + 897.0, + 559.0, + 897.0, + 588.0, + 850.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 572.0, + 1157.0, + 572.0, + 1157.0, + 598.0, + 1127.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 583.0, + 635.0, + 583.0, + 635.0, + 610.0, + 588.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 597.0, + 897.0, + 597.0, + 897.0, + 625.0, + 850.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 610.0, + 371.0, + 610.0, + 371.0, + 668.0, + 324.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 623.0, + 635.0, + 623.0, + 635.0, + 652.0, + 597.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 634.0, + 897.0, + 634.0, + 897.0, + 662.0, + 859.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 614.0, + 1157.0, + 614.0, + 1157.0, + 640.0, + 1127.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 674.0, + 373.0, + 674.0, + 373.0, + 700.0, + 341.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 664.0, + 636.0, + 664.0, + 636.0, + 692.0, + 595.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 670.0, + 897.0, + 670.0, + 897.0, + 699.0, + 858.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 657.0, + 1158.0, + 657.0, + 1158.0, + 682.0, + 1127.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 704.0, + 635.0, + 704.0, + 635.0, + 734.0, + 597.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 708.0, + 896.0, + 708.0, + 896.0, + 737.0, + 858.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 713.0, + 930.0, + 713.0, + 930.0, + 736.0, + 905.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 698.0, + 1157.0, + 698.0, + 1157.0, + 722.0, + 1136.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 739.0, + 388.0, + 739.0, + 388.0, + 775.0, + 352.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 751.0, + 499.0, + 751.0, + 499.0, + 776.0, + 466.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 750.0, + 607.0, + 750.0, + 607.0, + 777.0, + 564.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 752.0, + 651.0, + 752.0, + 651.0, + 775.0, + 630.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 751.0, + 759.0, + 751.0, + 759.0, + 776.0, + 729.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 750.0, + 868.0, + 750.0, + 868.0, + 777.0, + 826.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 752.0, + 912.0, + 752.0, + 912.0, + 775.0, + 891.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 751.0, + 1021.0, + 751.0, + 1021.0, + 776.0, + 990.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 750.0, + 1131.0, + 750.0, + 1131.0, + 777.0, + 1087.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 743.0, + 1174.0, + 743.0, + 1174.0, + 775.0, + 1138.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 751.0, + 1283.0, + 751.0, + 1283.0, + 776.0, + 1251.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 750.0, + 1392.0, + 750.0, + 1392.0, + 777.0, + 1348.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 768.0, + 530.0, + 768.0, + 530.0, + 794.0, + 437.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 767.0, + 791.0, + 767.0, + 791.0, + 796.0, + 699.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 768.0, + 1053.0, + 768.0, + 1053.0, + 794.0, + 961.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 767.0, + 1314.0, + 767.0, + 1314.0, + 796.0, + 1222.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 789.0, + 564.0, + 789.0, + 564.0, + 814.0, + 402.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 793.0, + 842.0, + 793.0, + 842.0, + 814.0, + 648.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 793.0, + 1104.0, + 793.0, + 1104.0, + 814.0, + 909.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 793.0, + 1381.0, + 793.0, + 1381.0, + 814.0, + 1154.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 816.0, + 373.0, + 816.0, + 373.0, + 845.0, + 325.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 831.0, + 634.0, + 831.0, + 634.0, + 857.0, + 614.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 832.0, + 847.0, + 832.0, + 847.0, + 848.0, + 827.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 831.0, + 895.0, + 831.0, + 895.0, + 857.0, + 875.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 832.0, + 1158.0, + 832.0, + 1158.0, + 861.0, + 1109.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 857.0, + 373.0, + 857.0, + 373.0, + 958.0, + 306.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 880.0, + 631.0, + 880.0, + 631.0, + 903.0, + 615.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 879.0, + 895.0, + 879.0, + 895.0, + 904.0, + 875.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 867.0, + 1158.0, + 867.0, + 1158.0, + 896.0, + 1112.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 897.0, + 371.0, + 897.0, + 371.0, + 922.0, + 337.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 904.0, + 1158.0, + 904.0, + 1158.0, + 934.0, + 1120.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 937.0, + 371.0, + 937.0, + 371.0, + 961.0, + 336.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 931.0, + 631.0, + 931.0, + 631.0, + 950.0, + 615.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 929.0, + 895.0, + 929.0, + 895.0, + 951.0, + 875.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 940.0, + 1158.0, + 940.0, + 1158.0, + 970.0, + 1120.0, + 970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 974.0, + 373.0, + 974.0, + 373.0, + 1003.0, + 336.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 978.0, + 631.0, + 978.0, + 631.0, + 998.0, + 615.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 978.0, + 892.0, + 978.0, + 892.0, + 999.0, + 876.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 977.0, + 1158.0, + 977.0, + 1158.0, + 1006.0, + 1120.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 993.0, + 921.0, + 993.0, + 921.0, + 1008.0, + 905.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1021.0, + 388.0, + 1021.0, + 388.0, + 1044.0, + 369.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1020.0, + 498.0, + 1020.0, + 498.0, + 1045.0, + 466.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 1019.0, + 607.0, + 1019.0, + 607.0, + 1046.0, + 564.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1021.0, + 651.0, + 1021.0, + 651.0, + 1044.0, + 630.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 1020.0, + 759.0, + 1020.0, + 759.0, + 1045.0, + 727.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 1019.0, + 868.0, + 1019.0, + 868.0, + 1046.0, + 826.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 1021.0, + 912.0, + 1021.0, + 912.0, + 1044.0, + 892.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 1020.0, + 1021.0, + 1020.0, + 1021.0, + 1045.0, + 990.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 1019.0, + 1129.0, + 1019.0, + 1129.0, + 1046.0, + 1087.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1021.0, + 1174.0, + 1021.0, + 1174.0, + 1045.0, + 1153.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1020.0, + 1283.0, + 1020.0, + 1283.0, + 1045.0, + 1251.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 1019.0, + 1392.0, + 1019.0, + 1392.0, + 1046.0, + 1349.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 1035.0, + 530.0, + 1035.0, + 530.0, + 1065.0, + 437.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1035.0, + 791.0, + 1035.0, + 791.0, + 1065.0, + 699.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 1037.0, + 1053.0, + 1037.0, + 1053.0, + 1063.0, + 961.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1037.0, + 1314.0, + 1037.0, + 1314.0, + 1063.0, + 1223.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 1059.0, + 565.0, + 1059.0, + 565.0, + 1084.0, + 403.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 1059.0, + 843.0, + 1059.0, + 843.0, + 1084.0, + 647.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 1059.0, + 1106.0, + 1059.0, + 1106.0, + 1084.0, + 909.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 1059.0, + 1382.0, + 1059.0, + 1382.0, + 1084.0, + 1154.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 1077.0, + 373.0, + 1077.0, + 373.0, + 1104.0, + 341.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 1079.0, + 1157.0, + 1079.0, + 1157.0, + 1104.0, + 1127.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1100.0, + 895.0, + 1100.0, + 895.0, + 1123.0, + 875.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1101.0, + 1369.0, + 1101.0, + 1369.0, + 1115.0, + 1340.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1124.0, + 350.0, + 1124.0, + 350.0, + 1247.0, + 320.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1123.0, + 369.0, + 1123.0, + 369.0, + 1144.0, + 353.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1119.0, + 631.0, + 1119.0, + 631.0, + 1139.0, + 615.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1118.0, + 846.0, + 1118.0, + 846.0, + 1128.0, + 835.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1148.0, + 895.0, + 1148.0, + 895.0, + 1171.0, + 875.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1145.0, + 1158.0, + 1145.0, + 1158.0, + 1171.0, + 1125.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1165.0, + 371.0, + 1165.0, + 371.0, + 1187.0, + 352.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1181.0, + 631.0, + 1181.0, + 631.0, + 1200.0, + 615.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1205.0, + 371.0, + 1205.0, + 371.0, + 1229.0, + 352.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1198.0, + 895.0, + 1198.0, + 895.0, + 1220.0, + 875.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1215.0, + 1156.0, + 1215.0, + 1156.0, + 1239.0, + 1136.0, + 1239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1251.0, + 369.0, + 1251.0, + 369.0, + 1269.0, + 354.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1241.0, + 631.0, + 1241.0, + 631.0, + 1262.0, + 615.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1247.0, + 892.0, + 1247.0, + 892.0, + 1268.0, + 876.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 1264.0, + 924.0, + 1264.0, + 924.0, + 1285.0, + 901.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1293.0, + 387.0, + 1293.0, + 387.0, + 1311.0, + 370.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1289.0, + 498.0, + 1289.0, + 498.0, + 1314.0, + 466.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 1288.0, + 607.0, + 1288.0, + 607.0, + 1315.0, + 564.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1290.0, + 651.0, + 1290.0, + 651.0, + 1312.0, + 630.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 1289.0, + 760.0, + 1289.0, + 760.0, + 1314.0, + 727.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 1288.0, + 868.0, + 1288.0, + 868.0, + 1315.0, + 826.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 1290.0, + 912.0, + 1290.0, + 912.0, + 1312.0, + 892.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 1289.0, + 1022.0, + 1289.0, + 1022.0, + 1314.0, + 990.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 1288.0, + 1131.0, + 1288.0, + 1131.0, + 1315.0, + 1087.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1290.0, + 1174.0, + 1290.0, + 1174.0, + 1312.0, + 1153.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1289.0, + 1283.0, + 1289.0, + 1283.0, + 1314.0, + 1251.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 1288.0, + 1392.0, + 1288.0, + 1392.0, + 1315.0, + 1348.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 1302.0, + 531.0, + 1302.0, + 531.0, + 1335.0, + 435.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 1302.0, + 792.0, + 1302.0, + 792.0, + 1335.0, + 698.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 959.0, + 1302.0, + 1054.0, + 1302.0, + 1054.0, + 1335.0, + 959.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 1302.0, + 1317.0, + 1302.0, + 1317.0, + 1335.0, + 1220.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 1328.0, + 565.0, + 1328.0, + 565.0, + 1353.0, + 403.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1331.0, + 842.0, + 1331.0, + 842.0, + 1352.0, + 648.0, + 1352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 1331.0, + 1104.0, + 1331.0, + 1104.0, + 1352.0, + 910.0, + 1352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 1331.0, + 1381.0, + 1331.0, + 1381.0, + 1352.0, + 1154.0, + 1352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 1340.0, + 635.0, + 1340.0, + 635.0, + 1365.0, + 603.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 864.0, + 1344.0, + 897.0, + 1344.0, + 897.0, + 1369.0, + 864.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1358.0, + 373.0, + 1358.0, + 373.0, + 1386.0, + 327.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1374.0, + 395.0, + 1374.0, + 395.0, + 1532.0, + 290.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 1384.0, + 634.0, + 1384.0, + 634.0, + 1408.0, + 614.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1387.0, + 895.0, + 1387.0, + 895.0, + 1412.0, + 875.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 1378.0, + 1156.0, + 1378.0, + 1156.0, + 1404.0, + 1127.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 1435.0, + 373.0, + 1435.0, + 373.0, + 1464.0, + 336.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 1429.0, + 634.0, + 1429.0, + 634.0, + 1452.0, + 614.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1431.0, + 895.0, + 1431.0, + 895.0, + 1453.0, + 875.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1435.0, + 1158.0, + 1435.0, + 1158.0, + 1460.0, + 1125.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 1474.0, + 373.0, + 1474.0, + 373.0, + 1503.0, + 336.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1476.0, + 631.0, + 1476.0, + 631.0, + 1494.0, + 615.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1474.0, + 895.0, + 1474.0, + 895.0, + 1496.0, + 875.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1491.0, + 1156.0, + 1491.0, + 1156.0, + 1517.0, + 1136.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 1515.0, + 371.0, + 1515.0, + 371.0, + 1540.0, + 337.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1517.0, + 631.0, + 1517.0, + 631.0, + 1538.0, + 615.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1519.0, + 892.0, + 1519.0, + 892.0, + 1540.0, + 876.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 1538.0, + 392.0, + 1538.0, + 392.0, + 1550.0, + 382.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1530.0, + 921.0, + 1530.0, + 921.0, + 1549.0, + 904.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1559.0, + 388.0, + 1559.0, + 388.0, + 1581.0, + 369.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1558.0, + 498.0, + 1558.0, + 498.0, + 1583.0, + 466.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 1556.0, + 607.0, + 1556.0, + 607.0, + 1584.0, + 564.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1559.0, + 651.0, + 1559.0, + 651.0, + 1581.0, + 630.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 1559.0, + 758.0, + 1559.0, + 758.0, + 1580.0, + 730.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1558.0, + 866.0, + 1558.0, + 866.0, + 1583.0, + 827.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 1559.0, + 909.0, + 1559.0, + 909.0, + 1580.0, + 893.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 1558.0, + 1021.0, + 1558.0, + 1021.0, + 1583.0, + 990.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 1556.0, + 1129.0, + 1556.0, + 1129.0, + 1584.0, + 1087.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 1559.0, + 1174.0, + 1559.0, + 1174.0, + 1581.0, + 1154.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1558.0, + 1282.0, + 1558.0, + 1282.0, + 1581.0, + 1251.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 1558.0, + 1389.0, + 1558.0, + 1389.0, + 1581.0, + 1351.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 1571.0, + 531.0, + 1571.0, + 531.0, + 1604.0, + 435.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 1575.0, + 791.0, + 1575.0, + 791.0, + 1601.0, + 700.0, + 1601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 959.0, + 1571.0, + 1054.0, + 1571.0, + 1054.0, + 1604.0, + 959.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1575.0, + 1314.0, + 1575.0, + 1314.0, + 1601.0, + 1223.0, + 1601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.75, + 557.5, + 853.75, + 557.5, + 853.75, + 569.0, + 830.75, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.75, + 594.0, + 1122.75, + 594.0, + 1122.75, + 615.5, + 991.75, + 615.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 833.0, + 1122.0, + 833.0, + 1122.0, + 858.5, + 1058.0, + 858.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.25, + 1381.5, + 1115.25, + 1381.5, + 1115.25, + 1398.5, + 1070.25, + 1398.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1625.0, + 1404.0, + 1625.0, + 1404.0, + 1659.0, + 295.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1648.0, + 1411.0, + 1648.0, + 1411.0, + 1698.0, + 290.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1690.0, + 1404.0, + 1690.0, + 1404.0, + 1723.0, + 295.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1718.0, + 1407.0, + 1718.0, + 1407.0, + 1755.0, + 294.0, + 1755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1749.0, + 1112.0, + 1749.0, + 1112.0, + 1785.0, + 295.0, + 1785.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": [ + 829.0, + 2084.0, + 872.0, + 2084.0, + 872.0, + 2124.0, + 829.0, + 2124.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 23, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 304, + 267, + 1395, + 267, + 1395, + 1937, + 304, + 1937 + ], + "score": 0.979, + "html": "
Model MethodError (%) Negative calibrated log-likelihood
15 101001 5 10 100
Dropout5.86±0.095.81±0.085.82±0.065.79±0.070.232±0.005 0.225±0.0040.224±0.004 0.223±0.003
SWA-Gaussian7.03±0.505.66±0.085.49±0.125.25±0.130.230±0.0140.182±0.0030.171±0.002 0.160±0.002
Cyclic SGLD7.37±0.166.56±0.095.71±0.064.84±0.040.234±0.0040.196±0.0040.176±0.003 0.147±0.003
Fast Geometric Ens.6.52±0.165.95±0.165.69±0.165.10±0.130.213±0.0050.187±0.0030.178±0.003 0.155±0.004
VGG16Deep Ensembles5.95±0.144.79±0.114.57±0.074.39±NA0.226±0.0010.158±0.0020.134±NA
CIFAR-10Single model5.83±0.115.83±0.115.83±0.115.83±0.110.223±0.0020.223±0.0020.223+0.002 0.223+0.002
Variational Inf. (FFG)6.57±0.095.63±0.135.50±0.105.46±0.030.239±0.0020.192±0.0020.184±0.002 0.175±0.001
KFAC-Laplace6.00±0.135.82±0.125.82±0.195.80±0.190.210±0.005 0.203±0.0070.201±0.007 0.200±0.008
Snapshot Ensembles7.76±0.225.52±0.135.00±0.104.54±0.050.247±0.0050.176±0.0010.160±0.001 0.137±0.001
SWA-Gaussian5.77±0.454.56±0.174.46±0.124.34±0.130.178±0.0090.143±0.0040.178±0.009 0.143±0.004 0.139±0.003 0.131±0.003
Cyclic SGLD6.18±0.205.32±0.154.55±0.133.83±0.020.185±0.0060.156±0.0050.138±0.002 0.115±0.001
Fast GeometricEns.5.52±0.094.83±0.084.73±0.104.28±0.050.163±0.0020.141±0.0030.137±0.003 0.126±0.002
ResNet110Deep Ensembles4.66±0.113.77±0.113.63±0.073.53±NA0.148±0.0040.117±0.0020.106±NA
CIFAR-10Single model4.69±0.114.69±0.114.69±0.114.69±0.110.150±0.0020.150±0.0020.150±0.003 0.150±0.002
Variational Inf. (FFG)5.57±0.264.91±0.154.72±0.134.60±0.030.178±0.0030.149±0.0010.144±0.001 0.140±0.000
KFAC-Laplace5.81±0.395.14±0.154.90±0.144.78±0.080.187±0.0140.160±0.0070.147±0.003
Snapshot Ensembles8.41±0.274.85±0.114.16±0.163.52±0.100.252±0.0060.153±0.0020.132±0.002 0.107±0.001
SWA-Gaussian5.41±0.714.21±0.194.21±0.234.02±0.140.171±0.0280.130±0.0040.128±0.004 0.121±0.002
Cyclic SGLD5.80±0.214.97±0.124.30±0.083.66±0.060.178±0.0040.149±0.0040.131±0.003 0.110±0.001
Fast Geometric Ens.5.22±0.074.49±0.064.36±0.074.09±0.120.157±0.0030.134±0.0020.130±0.001 0.119±0.002
ResNet164Deep Ensembles4.53±0.113.51±0.093.50±0.063.34±NA0.147±0.0020.113±0.0010.107±0.001 0.100±NA
CIFAR-10Single model4.52±0.114.52±0.114.52±0.114.52±0.110.144±0.0020.144±0.0030.144±0.002 0.144±0.003
Variational Inf. (FFG)5.62±0.144.78±0.054.66±0.054.55±0.080.183±0.0040.151±0.0010.146±0.001 0.141±0.001
KFAC-Laplace5.23±0.294.77±0.234.65±0.174.60±0.090.168±0.0080.151±0.0070.146±0.005 0.142±0.004
Snapshot Ensembles8.06±0.104.50±0.043.89±0.093.50±0.050.241±0.0040.144±0.0030.124±0.002 0.104±0.001
Dropout3.88±0.123.70±0.183.63±0.193.64±0.170.130±0.0020.120±0.0020.130±0.002 0.120±0.002 0.119±0.001 0.117±0.002
SWA-Gaussian4.98±1.173.53±0.093.34±0.143.28±0.100.157±0.0360.111±0.0040.105±0.0030.101±0.002
Cyclic SGLD4.78±0.164.09±0.113.63±0.133.19±0.040.155±0.0030.128±0.0020.114±0.0010.099±0.002
Fast Geometric Ens.4.86±0.173.95±0.073.77±0.103.34±0.060.148±0.0030.120±0.0020.113±0.0020.102±0.001
WideResNetDeepEnsembles3.65±0.023.11±0.103.01±0.062.83±NA0.123±0.0020.097±0.0010.095±0.0010.090±NA
CIFAR-10Single model3.70±0.153.70±0.153.70±0.153.70±0.150.124±0.0050.124±0.0050.125±0.0050.124±0.005
Variational Inf. (FFG)5.61±0.044.15±0.153.94±0.103.64±0.070.189±0.0020.134±0.0020.127±0.0020.117±0.001
KFAC-Laplace4.03±0.193.90±0.153.88±0.223.83±0.160.134±0.0040.124±0.0040.122±0.0050.120±0.003
Snapshot Ensembles5.56±0.153.68±0.093.33±0.102.89±0.070.179±0.0050.119±0.0010.105±0.0010.090±0.001
Dropout26.10±0.2025.68±0.1825.66±0.1425.60±0.171.176±0.0081.111±0.0081.098±0.0091.084±0.009
SWA-Gaussian27.74±1.8724.53±0.0923.64±0.2822.97±0.201.109±0.0730.931±0.0070.879±0.0070.826±0.005
Cyclic SGLD29.75±0.1726.79±0.1924.14±0.1121.15±0.111.114±0.0030.976±0.0040.881±0.0060.749±0.004
Fast Geometric Ens.27.07±0.2425.35±0.2924.68±0.4022.78±0.221.057±0.0100.965±0.0030.930±0.0030.827±0.004
VGG16Deep Ensembles25.72±0.1721.60±0.1320.79±0.1619.88±NA1.092±0.0040.840±0.0050.794±0.0020.723±NA
CIFAR-100Single model25.44±0.2925.44±0.2925.44±0.2925.44±0.291.087±0.0061.087±0.0061.087±0.0061.087±0.006
Variational Inf.(FFG)27.24±0.0925.24±0.1124.85±0.0524.56±0.071.154±0.0041.001±0.0020.973±0.0020.939±0.001
KFAC-Laplace27.11±0.5925.98±0.2125.84±0.3825.70±0.381.174±0.0371.089±0.0071.069±0.0051.050±0.008
Snapshot Ensembles31.19±0.3323.87±0.1822.31±0.3121.03±0.101.170±0.0120.899±0.0040.834±0.005 0.751±0.003
SWA-Gaussian27.75±0.7622.31±0.2221.52±0.3020.69±0.190.960±0.0330.781±0.0110.745±0.0100.701±0.008
Cyclic SGLD25.73±0.1423.30±0.1921.20±0.2118.07±0.160.914±0.0060.818±0.0040.753±0.0020.630±0.002
Fast Geometric Ens.22.84±0.1621.22±0.2020.79±0.2319.64±0.15(0.798±0.0060.729±0.0030.713±0.002:0.679±0.002
ResNet110Deep Ensembles22.55±0.2818.30±0.2217.59±0.2116.97±NA0.847±0.0070.675±0.0010.638±0.0010.594±NA
CIFAR-100Single model22.66±0.3122.66±0.3122.66±0.3122.66±0.310.848±0.0140.848±0.0150.848±0.0140.848±0.015
VariationalInf.(FFG)24.27±0.2622.41±0.1322.14±0.1221.86±0.070.924±0.0070.829±0.0030.813±0.0010.795±0.001
KFAC-Laplace24.88±0.9722.87±0.4422.41±0.2622.14±0.290.948±0.0360.858±0.0140.836±0.0100.812±0.010
Snapshot Ensembles30.30±0.4022.83±0.2321.13±0.1418.48±0.251.069±0.0060.820±0.0030.761±0.0020.662±0.002
SWA-Gaussian24.38±0.9320.62±0.1820.08±0.1919.48±0.190.844±0.0420.719±0.0060.700±0.006 0.667±0.004
Cyclic SGLD24.87±0.3922.37±0.2720.23±0.2217.13±0.180.888±0.0080.790±0.009
Fast Geometric Ens.21.92±0.1520.10±0.2219.87±0.2518.73±0.250.765±0.0030.699±0.0040.686±0.0040.650±0.003
ResNet164CIFAR-100Deep EnsemblesSingle model21.41±0.2517.53±0.1716.90±0.1516.50±NA0.819±0.0080.647±0.0030.615±0.0020.574±NA
CIAR-100Single modelVariational Inf. (FFG)23.47±0.2621.35±0.1121.10±0.1620.82±0.040.910±0.0010.801±0.0020.782±0.0020.762±0.000
KFAC-Laplace23.44±0.4521.77±0.2021.29±0.23221.03±0.380.902±0.0190.813±0.0060.792±0.0050.772±0.007
Snapshot Ensembles29.48±0.1921.92±0.1820.27±0.2317.68±0.071.045±0.0050.789±0.0050.729±0.004 0.634±0.003
Dropout20.19±0.11 19.41±0.1719.36±0.1219.22±0.150.823±0.0080.768±0.0050.760±0.006 0.751±0.005
SWA-Gaussian20.45±0.73 17.57±0.1717.21±0.2217.08±0.190.794±0.0250.653±0.0040.634±0.005 0.614±0.005
Cyclic SGLD21.42±0.3219.42±0.2817.88±0.1616.29±0.100.813±0.0100.713±0.0090.654±0.005 0.583±0.004
Fast Geometric Ens.21.48±0.3118.54±0.1618.00±0.1917.12±0.160.770±0.0070.652±0.0060.630±0.006 0.596±0.003
WideResNetDeepEnsembles19.38±0.2016.55±0.0816.17±0.1515.77±NA0.797±0.0070.623±0.0030.595±0.003 0.571±NA
CIFAR-100SSingle model19.31±0.2419.31±0.2419.31±0.2419.31±0.240.797±0.0100.797±0.0100.797±0.010 0.797±0.010
VariationalInf. (FFG)24.38±0.2720.17±0.1519.28±0.0918.74±0.081.004±0.0110.767±0.0040.727±0.003 0.685±0.002
KFAC-Laplace20.02±0.18 19.76±0.1519.53±0.1919.43±0.210.834±0.0090.803±0.006 0.795±0.007 0.789±0.006
Snapshot Ensembles23.01±0.26 18.20±0.1317.12±0.3116.07±0.070.859±0.009 0.678±0.006 0.633±0.008 0.582±0.004
" + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 816, + 76, + 816, + 104, + 300, + 104 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2112, + 835, + 2112 + ], + "score": 0.863 + }, + { + "category_id": 7, + "poly": [ + 336, + 1960, + 1362, + 1960, + 1362, + 1985, + 336, + 1985 + ], + "score": 0.799 + }, + { + "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": [ + 829.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2124.0, + 829.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 1957.0, + 1359.0, + 1957.0, + 1359.0, + 1986.0, + 339.0, + 1986.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 24, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 303, + 320, + 1392, + 320, + 1392, + 1879, + 303, + 1879 + ], + "score": 0.98, + "html": "
Error (%) Negative calibrated log-likelihood
ModelMethod5 10 100 510100
Dropout5.81 vs 5.525.82 vs 5.345.79 vs 5.210.225 vs 0.1870.224 vs 0.1770.223 vs 0.167
SWA-Gaussian5.66 vs 5.655.49 vs 5.365.25 vs 5.080.182 vs 0.1800.171 vs 0.1660.160 vs 0.152
Cyclic SGLD6.56 vs 6.075.71 vs 5.474.84 vs 4.880.196 vs 0.1860.176 vs 0.1690.147 vs 0.147
Fast Geometric Ens.5.95 vs 5.645.69 vs 5.365.10 vs 4.98~0.187 vs 0.1770.178 vs 0.1670.155 vs 0.150
VGG16Deep Ensembles4.79 vs 4.904.57 vs 4.734.39 vs 4.55个0.158 vs 0.1620.148 vs 0.1520.134 vs 0.136个
CIFAR-10Single model5.83 vs 5.555.83 vs 5.355.83 vs 5.19↓0.223 vs 0.1830.223 vs 0.1740.223 vs 0.166
VariationalInf.(FFG)5.63vs5.435.50 vs 5.255.46 vs 5.070.192 vs 0.1820.184 vs 0.1690.175 vs 0.154
KFAC-Laplace5.82 vs 5.495.82 vs 5.325.80 vs 5.170.203 vs 0.1770.201 vs 0.1710.200 vs 0.164
Snapshot Ensembles5.52 vs 5.61~5.00 vs 5.03~4.54 vs 4.640.176 vs 0.178个0.160 vs 0.160~0.137 vs 0.137
SWA-Gaussian4.56 vs 4.47~4.46 vs 4.344.34 vs 4.160.143 vs 0.1420.139 vs 0.1350.131 vs 0.125
Cyclic SGLD5.32 vs 4.884.55 vs 4.353.83 vs 3.590.156 vs 0.1480.138 vs 0.1310.115 vs 0.111
Fast Geometric Ens.4.83 vs 4.594.73 vs 4.444.28 vs 4.140.141 vs 0.1380.137 vs 0.1320.126 vs 0.121
ResNet110Deep Ensembles3.77 vs 3.703.63 vs 3.583.53 vs 3.450.117 vs 0.1180.112 vs 0.1120.106 vs 0.105
CIFAR-10Single model4.69 vs 4.324.69 vs 4.234.69 vs 4.100.150 vs 0.1370.150 vs 0.1340.150 vs 0.131
Variational Inf.(FFG)44.91 vs 4.664.72 vs 4.434.60 vs 4.250.149 vs 0.1450.144 vs 0.1380.140 vs 0.130
KFAC-Laplace5.14 vs 4.434.90 vs 4.274.78 vs 4.170.160 vs 0.1390.153 vs 0.1340.147 vs 0.130
Snapshot Ensembles4.85 vs 4.78~4.16 vs 4.183.52 vs 3.480.153 vs 0.1500.132 vs 0.1300.107 vs 0.106
SWA-Gaussian4.21 vs 4.174.21 vs 4.04~4.02 vs 3.840.130 vs 0.130~0.128 vs 0.126~0.121 vs 0.116
Cyclic SGLD4.97 vs 4.674.30 vs 4.013.66 vs 3.480.149 vs 0.1410.131 vs 0.1250.110 vs 0.107
Fast Geometric Ens.4.49 vs 4.294.36 vs 4.154.09 vs 3.850.134 vs 0.1310.130 vs 0.1260.119 vs 0.115
ResNet164Deep Ensembles3.51 vs 3.583.50 vs 3.463.34 vs 3.300.113 vs 0.1140.107 vs 0.1070.100 vs 0.101个
CIFAR-10Single model4.52 vs 4.154.52 vs 4.084.52 vs 3.980.144 vs 0.1310.144 vs 0.1280.144 vs 0.126
VariationalInf.(FFG)4.78vs 4.414.66 vs 4.224.55 vs 4.050.151 vs 0.1420.146 vs 0.1350.141 vs 0.128
KFAC-Laplace4.77 vs 4.264.65 vs 4.214.60 vs 4.080.151 vs 0.1350.146 vs 0.1320.142 vs 0.127
Snapshot Ensembles4.50 vs 4.423.89 vs 3.873.50 vs 3.350.144 vs 0.1420.124 vs 0.1230.104 vs 0.104
Dropout3.70 vs 3.62~3.63 vs 3.523.64 vs 3.440.120 vs 0.1170.119 vs 0.1140.117 vs 0.111
SWA-Gaussian3.53 vs 3.59~3.34 vs 3.34~3.28 vs 3.24~0.111 vs 0.1140.105 vs 0.1070.101 vs 0.102
Cyclic SGLD4.09 vs 3.95~3.63 vs 3.583.19 vs 3.22~0.128 vs 0.1250.114 vs 0.1120.099 vs 0.100个
Fast Geometric Ens.3.95 vs 3.90~3.77 vs 3.643.34 vs 3.270.120 vs 0.120~0.113 vs 0.1130.102 vs 0.102
WideResNetDeepEnsembles3.11 vs 3.21个3.01 vs 3.022.83 vs 2.910.097 vs 0.1030.095 vs 0.0980.090 vs 0.094
CIFAR-10Single model3.70 vs 3.533.70 vs 3.453.70 vs 3.400.124 vs 0.117↓0.125 vs 0.114↓0.124 vs 0.113
VariationalInf.(FFG)4.15vs4.053.94 vs 3.803.64 vs 3.63~0.134 vs 0.1360.127 vs 0.1260.117 vs 0.116
KFAC-Laplace3.90 vs 3.633.88 vs 3.583.83vs 3.500.124 vs 0.1150.122 vs 0.1130.120 vs 0.111
Snapshot Ensembles3.68 vs 3.743.33 vs 3.352.89 vs 2.900.119 vs 0.122个0.105 vs 0.107个0.090 vs 0.093
Dropout25.68 vs 24.3725.66 vs 23.8925.60 vs 23.411.111 vs 0.9991.098 vs 0.960↓1.084 vs 0.911
SWA-Gaussian24.53 vs 24.2823.64 vs 23.2722.97 vs 22.340.931 vs 0.9260.879 vs 0.8590.826 vs 0.795
Cyclic SGLD26.79 vs 25.6624.14 vs 23.4521.15 vs 21.040.976 vs 0.9290.881 vs 0.8480.749 vs 0.740
Fast Geometric Ens.25.35 vs 24.5324.68 vs 23.6222.78 vs 22.200.965 vs 0.9210.930 vs 0.8780.827 vs 0.800
VGG16Deep Ensembles21.60 vs 21.90个20.79 vs 21.0319.88 vs 20.230.840 vs 0.865个0.794 vs 0.811个0.723 vs 0.731
CIFAR-100Single model25.44 vs 24.3825.44 vs 23.9225.44 vs 23.481.087 vs 0.9731.087 vs 0.9451.087 vs 0.912
VariationalInf.(FFG)25.24vs24.1924.85 vs 23.5624.56 vs 22.891.001 vs 0.9640.973 vs 0.9190.939 vs 0.864
KFAC-Laplace25.98 vs 24.5325.84 vs 24.0325.70 vs 23.571.089 vs 0.9891.069 vs 0.9491.050 vs 0.909
Snapshot Ensembles23.87 vs 23.8822.31 vs 22.5021.03 vs 21.040.899 vs 0.905~0.834 vs 0.836~0.751 vs 0.750
SWA-Gaussian22.31 vs 22.20~21.52 vs 21.21~20.69 vs 20.280.781 vs 0.7700.745 vs 0.7300.701 vs 0.683
Cyclic SGLD23.30 vs 22.3221.20 vs 20.4318.07 vs 17.670.818 vs 0.7870.753 vs 0.7250.630 vs 0.616
Fast Geometric Ens.21.22 vs 20.6920.79 vs 20.1819.64 vs 19.250.729 vs 0.7140.713 vs 0.6940.679 vs 0.661
ResNet110Deep Ensembles18.30 vs 18.3617.59 vs 17.6116.97 vs 16.740.675 vs 0.6720.638 vs 0.6350.594 vs 0.591
CIFAR-100Single model22.66 vs 21.3722.66 vs 21.1722.66 vs 20.980.848 vs 0.7970.848 vs 0.7860.848 vs 0.775
Variational Inf. (FFG)22.41 vs 21.6722.14 vs 21.2121.86 vs 20.770.829 vs 0.7990.813 vs 0.7750.795 vs 0.748
KFAC-Laplace22.87 vs 21.6922.41 vs 21.2822.14 vs 20.990.858 vs 0.8100.836 vs 0.7880.812 vs 0.766
Snapshot Ensembles22.83 vs 22.3321.13 vs 20.7118.48 vs 18.230.820 vs 0.8060.761 vs 0.7440.662 vs 0.651
SWA-Gaussian20.62 vs 20.6120.08 vs 20.0819.48 vs 19.330.719 vs 0.7150.700 vs 0.6900.667 vs 0.654
Cyclic SGLD22.37 vs 21.5720.23 vs 19.5817.13 vs 16.990.790 vs 0.7670.722 vs 0.7020.606 vs 0.595
Fast Geometric Ens.20.10 vs 19.8219.87 vs 19.3918.73 vs 18.330.699 vs 0.6890.686 vs 0.6710.650 vs 0.636
ResNet164Deep Ensembles17.53 vs 17.5716.90 vs 16.8416.50 vs 16.220.647 vs 0.650~0.615 vs 0.6130.574 vs 0.575
CIFAR-100Single model21.39 vs 20.6021.39 vs 20.3921.39 vs 20.230.817 vs 0.7720.817 vs 0.7610.817 vs 0.751
VariationalInf.(FFG)21.35vs 21.0621.10 vs 20.5420.82 vs 19.970.801 vs 0.7850.782 vs 0.7590.762 vs 0.731
KFAC-Laplace21.77 vs 20.6621.29 vs 20.3621.03 vs 20.180.813 vs 0.7780.792 vs 0.7580.772 vs 0.740
Snapshot Ensembles21.92 vs 21.6920.27 vs 19.9217.68 vs 17.660.789 vs 0.7810.729 vs 0.7200.634 vs 0.629
Dropout19.41 vs 19.2719.36 vs 19.1119.22 vs 18.880.768 vs 0.7510.760 vs 0.7380.751 vs 0.723
Cyclic SGLD19.42 vs 18.8317.88 vs 17.5016.29 vs 16.210.713 vs 0.6960.654 vs 0.6410.583 vs 0.580
Fast Geometric Ens.18.54 vs 18.3918.00 vs 17.8417.12 vs 16.930.652 vs 0.6490.630 vs 0.6240.596 vs 0.592
WideResNetDeepEnsembles16.55 vs 16.84个16.17 vs 16.3015.77 vs 15.770.623 vs 0.632个0.595 vs 0.6020.571 vs 0.573个
CIFAR-100Singlemodel19.31 vs 18.8319.31 vs 18.8019.31 vs 18.720.797 vs 0.7550.797 vs 0.7460.797 vs 0.738
VariationalInf.(FFG)20.17vs20.1219.28 vs 19.20~18.74 vs 18.540.767 vs 0.766~0.727 vs 0.7240.685 vs 0.679
KFAC-Laplace19.76 vs 19.2119.53 vs 19.0319.43 vs 18.930.803 vs 0.7640.795 vs 0.757↓0.789 vs 0.747
Snapshot Ensembles18.20 vs 18.2217.12 vs 17.2016.07 vs 16.27~0.678 vs 0.6800.633 vs 0.6350.582 vs 0.586个
" + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 816, + 76, + 816, + 104, + 300, + 104 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 865, + 2088, + 865, + 2113, + 835, + 2113 + ], + "score": 0.859 + }, + { + "category_id": 7, + "poly": [ + 363, + 1904, + 1335, + 1904, + 1335, + 1929, + 363, + 1929 + ], + "score": 0.594 + }, + { + "category_id": 6, + "poly": [ + 363, + 1904, + 1335, + 1904, + 1335, + 1929, + 363, + 1929 + ], + "score": 0.158 + }, + { + "category_id": 13, + "poly": [ + 659, + 1812, + 717, + 1812, + 717, + 1831, + 659, + 1831 + ], + "score": 0.39, + "latex": "2 0 . 1 2 \\mathrm { _ { \\approx } }" + }, + { + "category_id": 13, + "poly": [ + 660, + 1853, + 717, + 1853, + 717, + 1873, + 660, + 1873 + ], + "score": 0.29, + "latex": "1 8 . 2 2 _ { \\approx }" + }, + { + "category_id": 13, + "poly": [ + 659, + 1832, + 715, + 1832, + 715, + 1852, + 659, + 1852 + ], + "score": 0.29, + "latex": "1 9 . 2 1 _ { \\perp }" + }, + { + "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": [ + 829.0, + 2083.0, + 871.0, + 2083.0, + 871.0, + 2123.0, + 829.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 1902.0, + 1336.0, + 1902.0, + 1336.0, + 1931.0, + 362.0, + 1931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 1902.0, + 1336.0, + 1902.0, + 1336.0, + 1931.0, + 362.0, + 1931.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 25, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 435, + 217, + 1263, + 217, + 1263, + 1979, + 435, + 1979 + ], + "score": 0.972, + "html": "
ModelDeep ensemble equivalent score
Method1 sample 5 samples 10 samples 50 samples 100 samples
VGG16 CIFAR-10Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.64.721.933.8
Cyclic SGLD1.0 1.72.67.410.5
SWA-Gaussian1.0 2.22.94.44.6
1.3 2.0
Fast Geometric Ens.2.44.75.8
Dropout1.0 1.01.01.11.1
Variational Inf. (FFG)1.0 1.82.02.52.6 1.6
KFAC-Laplace Single model1.4 1.6 1.11.6 1.11.6 1.11.1
ResNet110 CIFAR-101.1 5.094.6
Deep Ensembles1.0 1.0 1.010.0 2.048.032.6
Snapshot Ensembles1.0 1.01.614.66.0
Cyclic SGLD1.34.62.0
SWA-Gaussian1.01.51.9
Fast Geometric Ens.1.0 1.4 1.01.72.42.9
Variational Inf. (FFG)1.01.21.41.5
KFAC-Laplace1.0 1.01.01.01.1
Single model1.0 1.01.01.01.0
Deep Ensembles1.0 5.010.043.7100.0
ResNet164 CIFAR-101.0 1.12.311.317.2
Snapshot Ensembles Cyclic SGLD1.0 1.01.84.86.7
SWA-Gaussian1.0 1.81.92.52.7
Fast Geometric Ens.1.0 1.61.82.52.9
Variational Inf. (FFG)1.0 1.01.01.31.3
1.01.0 1.01.21.2
KFAC-Laplace1.11.1 1.11.11.1
Single model1.010.048.0
Deep Ensembles5.0 1.02.530.686.0 100.0
Snapshot Ensembles1.3 1.0 1.01.64.04.1
Cyclic SGLD SWA-Gaussian1.01.82.53.1 3.3
WideResNet Fast Geometric Ens. CIFAR-101.01.21.72.7 3.2
Dropout1.01.21.3 1.41.4
Variational Inf. (FFG)1.01.01.0 1.31.4
KFAC-Laplace1.01.01.0 1.21.2
Single model1.01.01.01.0
VGG16 CIFAR-1001.0
Deep Ensembles1.0 5.010.050.0100.0
Snapshot Ensembles1.0 2.95.418.826.8
Cyclic SGLD1.0 1.8 1.0 2.33.3 3.415.928.2
SWA-Gaussian1.2 1.92.35.25.9 5.8
Fast Geometric Ens.1.0 1.01.04.5 1.01.1
Dropout1.82.12.2
Variational Inf. (FFG)1.0 1.61.3
KFAC-Laplace Single model1.0 1.01.2 1.01.3 1.01.0
1.0 1.01.0
ResNet110 CIFAR-1005.010.050.099.0
Deep Ensembles Snapshot Ensembles1.0 1.31.94.76.2
1.02.07.012.2
Cyclic SGLD1.32.23.6
SWA-Gaussian1.0 1.7 1.5 2.63.03.3 4.24.7
Fast Geometric Ens. Variational Inf. (FFG)1.0 1.21.31.51.5
KFAC-Laplace1.0 1.01.11.31.4
Single model1.0 1.01.01.01.0
Deep Ensembles1.010.050.0100.0
Snapshot Ensembles5.0 1.0
ResNet164 CIFAR-1001.31.94.86.3
Cyclic SGLD SWA-Gaussian1.0 1.32.06.813.3
Fast Geometric Ens.1.0 2.1 1.6 2.62.6 3.03.6 4.23.8 4.8
Variational Inf. (FFG)1.0 1.21.41.61.6
KFAC-Laplace1.0 1.11.31.51.5
1.0
Single model1.01.01.01.0
WideResNet Fast Geometric Ens. CIFAR-100Dropout Variational Inf. (FFG) KFAC-LaplaceDeep Ensembles5.010.049.095.9
Snapshot Ensembles1.0 1.0 2.54.216.220.0
Cyclic SGLD SWA-Gaussian1.0 1.9 1.0 3.23.2 4.213.6 5.718.8 6.0
" + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 815, + 76, + 815, + 104, + 298, + 104 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2112, + 835, + 2112 + ], + "score": 0.875 + }, + { + "category_id": 6, + "poly": [ + 616, + 1999, + 1087, + 1999, + 1087, + 2023, + 616, + 2023 + ], + "score": 0.848 + }, + { + "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": [ + 829.0, + 2084.0, + 870.0, + 2084.0, + 870.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 1997.0, + 1088.0, + 1997.0, + 1088.0, + 2027.0, + 612.0, + 2027.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 26, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 413, + 840, + 1287, + 840, + 1287, + 1089, + 413, + 1089 + ], + "score": 0.982, + "html": "
Deep ensemble equivalent score
ModelMethod1 sample 5 samples 10 samples 25 samples 50 samples
Deep Ensembles1.05.010.025.050.0
Snapshot Ensembles1.02.23.24.04.2
ResNet50 Fast Geometric Ens.1.11.21.31.41.5
Variational Inf. (FFG)1.01.11.21.21.2
KFAC-Laplace1.01.01.01.01.0
Single model1.01.01.01.01.0
" + }, + { + "category_id": 5, + "poly": [ + 304, + 223, + 1396, + 223, + 1396, + 443, + 304, + 443 + ], + "score": 0.978, + "html": "
Error (%)Negative calibrated log-likelihood
ModelMethod151050151050
Fast Geometric Ens.23.71±0.0023.61±0.0023.56±0.0023.28±0.000.929±0.0000.921±0.0000.916±0.0000.904±0.000
Deep Ensembles23.79±0.1421.19±0.14 20.90±0.08 20.63±NA0.935±0.007 0.823±0.002 0.805±0.0000.788±NA
ResNet50 Single model23.86±0.2023.86±0.2023.86±0.2023.86±0.200.938±0.0060.938±0.006:0.938±0.0060.938±0.006
Variational Inf.(FFG)24.50±0.06 23.82±0.03223.77±0.04 23.67±0.000.957±0.0010.927±0.0000.923±0.0010.920±0.000
KFAC-Laplace25.01±0.4924.19±0.2923.93±0.2023.86±0.160.988±0.0220.948±0.0130.939±0.0110.934±0.008
Snapshot Ensembles24.92±NA22.21±NA21.75±NA21.48±NA0.983±NA0.865±NA0.843±NA0.830±NA
" + }, + { + "category_id": 5, + "poly": [ + 306, + 537, + 1395, + 537, + 1395, + 747, + 306, + 747 + ], + "score": 0.973, + "html": "
Error (%)Negative calibrated log-likelihood
ModelMethod5105051050
Fast Geometric Ens.23.61 vs 22.2123.56 vs 21.3723.28 vs 20.670.921 vs 0.8940.916 vs 0.8420.904 vs 0.793
Deep Ensembles21.19 vs 21.2020.90 vs 20.1620.63 vs 19.390.823 vs 0.855个0.805 vs 0.7930.788 vs 0.739
ResNet50 Single model23.86 vs 22.3923.86 vs 21.6023.86 vs 21.060.938 vs 0.9000.938 vs 0.8510.938 vs 0.805
Variational Inf. (FFG)23.82 vs 22.5823.77 vs 21.7423.67 vs 21.100.927 vs 0.9050.923 vs 0.8510.920 vs 0.805
KFAC-Laplace24.19 vs 22.5023.93 vs 21.6723.86 vs 21.040.948 vs 0.9060.939 vs 0.8550.934 vs 0.809
Snapshot Ensembles22.21 vs 21.9921.75 vs 20.8121.48 vs 19.860.865 vs 0.879个0.843 vs 0.8150.830 vs 0.763
" + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.894 + }, + { + "category_id": 6, + "poly": [ + 632, + 1112, + 1066, + 1112, + 1066, + 1136, + 632, + 1136 + ], + "score": 0.883 + }, + { + "category_id": 6, + "poly": [ + 402, + 466, + 1293, + 466, + 1293, + 491, + 402, + 491 + ], + "score": 0.874 + }, + { + "category_id": 6, + "poly": [ + 381, + 769, + 1314, + 769, + 1314, + 794, + 381, + 794 + ], + "score": 0.857 + }, + { + "category_id": 2, + "poly": [ + 835, + 2089, + 864, + 2089, + 864, + 2112, + 835, + 2112 + ], + "score": 0.842 + }, + { + "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": [ + 630.0, + 1109.0, + 1069.0, + 1109.0, + 1069.0, + 1140.0, + 630.0, + 1140.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 463.0, + 1295.0, + 463.0, + 1295.0, + 495.0, + 403.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 766.0, + 1317.0, + 766.0, + 1317.0, + 798.0, + 381.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2122.0, + 829.0, + 2122.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 27, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 314, + 247, + 1383, + 247, + 1383, + 1991, + 314, + 1991 + ], + "score": 0.965 + }, + { + "category_id": 4, + "poly": [ + 302, + 2009, + 1388, + 2009, + 1388, + 2072, + 302, + 2072 + ], + "score": 0.931 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 816, + 76, + 816, + 104, + 299, + 104 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.842 + }, + { + "category_id": 15, + "poly": [ + 848.0, + 233.0, + 960.0, + 233.0, + 960.0, + 266.0, + 848.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 283.0, + 629.0, + 283.0, + 629.0, + 308.0, + 602.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 280.0, + 875.0, + 280.0, + 875.0, + 310.0, + 633.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 274.0, + 1177.0, + 274.0, + 1177.0, + 310.0, + 897.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 305.0, + 629.0, + 305.0, + 629.0, + 330.0, + 604.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 299.0, + 877.0, + 299.0, + 877.0, + 335.0, + 631.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 305.0, + 925.0, + 305.0, + 925.0, + 330.0, + 900.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 299.0, + 1175.0, + 299.0, + 1175.0, + 335.0, + 927.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 360.0, + 662.0, + 360.0, + 662.0, + 404.0, + 562.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 360.0, + 1206.0, + 360.0, + 1206.0, + 406.0, + 1106.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 368.0, + 970.0, + 368.0, + 970.0, + 750.0, + 814.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 401.0, + 429.0, + 401.0, + 429.0, + 431.0, + 395.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 401.0, + 487.0, + 401.0, + 487.0, + 437.0, + 456.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 404.0, + 391.0, + 404.0, + 391.0, + 443.0, + 343.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 408.0, + 977.0, + 408.0, + 977.0, + 445.0, + 941.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 416.0, + 937.0, + 416.0, + 937.0, + 456.0, + 875.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 426.0, + 714.0, + 426.0, + 714.0, + 458.0, + 681.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 427.0, + 656.0, + 427.0, + 656.0, + 462.0, + 625.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 445.0, + 391.0, + 445.0, + 391.0, + 483.0, + 343.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 470.0, + 393.0, + 470.0, + 393.0, + 587.0, + 312.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 399.0, + 500.0, + 429.0, + 500.0, + 429.0, + 558.0, + 399.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 504.0, + 487.0, + 504.0, + 487.0, + 556.0, + 456.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 468.0, + 547.0, + 468.0, + 547.0, + 549.0, + 508.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 470.0, + 602.0, + 470.0, + 602.0, + 552.0, + 566.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 624.0, + 499.0, + 658.0, + 499.0, + 658.0, + 550.0, + 624.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 474.0, + 714.0, + 474.0, + 714.0, + 506.0, + 683.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 479.0, + 933.0, + 479.0, + 933.0, + 516.0, + 877.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 483.0, + 1029.0, + 483.0, + 1029.0, + 516.0, + 1000.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 531.0, + 1087.0, + 531.0, + 1087.0, + 566.0, + 1056.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 564.0, + 391.0, + 564.0, + 391.0, + 648.0, + 312.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 550.0, + 541.0, + 550.0, + 541.0, + 585.0, + 512.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 545.0, + 599.0, + 545.0, + 599.0, + 577.0, + 570.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 568.0, + 654.0, + 568.0, + 654.0, + 593.0, + 627.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 583.0, + 710.0, + 583.0, + 710.0, + 618.0, + 681.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 564.0, + 768.0, + 564.0, + 768.0, + 598.0, + 739.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 545.0, + 933.0, + 545.0, + 933.0, + 579.0, + 877.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 562.0, + 975.0, + 562.0, + 975.0, + 625.0, + 943.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 573.0, + 1031.0, + 573.0, + 1031.0, + 627.0, + 998.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 552.0, + 1089.0, + 552.0, + 1089.0, + 614.0, + 1054.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 572.0, + 1145.0, + 572.0, + 1145.0, + 660.0, + 1112.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 556.0, + 1200.0, + 556.0, + 1200.0, + 620.0, + 1170.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 558.0, + 1258.0, + 558.0, + 1258.0, + 610.0, + 1223.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 604.0, + 393.0, + 604.0, + 393.0, + 725.0, + 339.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 658.0, + 768.0, + 658.0, + 768.0, + 693.0, + 739.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 625.0, + 837.0, + 625.0, + 837.0, + 723.0, + 789.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 606.0, + 933.0, + 606.0, + 933.0, + 643.0, + 877.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 620.0, + 1087.0, + 620.0, + 1087.0, + 650.0, + 1056.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 610.0, + 1197.0, + 610.0, + 1197.0, + 660.0, + 1172.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 637.0, + 1256.0, + 637.0, + 1256.0, + 671.0, + 1225.0, + 671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 612.0, + 1314.0, + 612.0, + 1314.0, + 706.0, + 1283.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 635.0, + 1370.0, + 635.0, + 1370.0, + 716.0, + 1341.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 714.0, + 829.0, + 714.0, + 829.0, + 750.0, + 381.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 714.0, + 1323.0, + 714.0, + 1323.0, + 750.0, + 923.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 719.0, + 1373.0, + 719.0, + 1373.0, + 748.0, + 1331.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 739.0, + 445.0, + 739.0, + 445.0, + 766.0, + 387.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 741.0, + 545.0, + 741.0, + 545.0, + 764.0, + 512.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 735.0, + 989.0, + 735.0, + 989.0, + 767.0, + 927.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 737.0, + 1089.0, + 737.0, + 1089.0, + 766.0, + 1052.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 767.0, + 679.0, + 767.0, + 679.0, + 806.0, + 547.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 766.0, + 1222.0, + 766.0, + 1222.0, + 804.0, + 1091.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 804.0, + 489.0, + 804.0, + 489.0, + 860.0, + 454.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 806.0, + 1029.0, + 806.0, + 1029.0, + 846.0, + 1000.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 821.0, + 937.0, + 821.0, + 937.0, + 862.0, + 875.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 823.0, + 391.0, + 823.0, + 391.0, + 862.0, + 343.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 825.0, + 973.0, + 825.0, + 973.0, + 854.0, + 939.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 827.0, + 895.0, + 827.0, + 895.0, + 1100.0, + 847.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 837.0, + 549.0, + 837.0, + 549.0, + 898.0, + 506.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 839.0, + 656.0, + 839.0, + 656.0, + 873.0, + 625.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 839.0, + 1029.0, + 839.0, + 1029.0, + 873.0, + 1000.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 399.0, + 846.0, + 429.0, + 846.0, + 429.0, + 881.0, + 399.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 856.0, + 1091.0, + 856.0, + 1091.0, + 933.0, + 1052.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 862.0, + 391.0, + 862.0, + 391.0, + 898.0, + 343.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 871.0, + 353.0, + 871.0, + 353.0, + 988.0, + 309.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 879.0, + 712.0, + 879.0, + 712.0, + 904.0, + 685.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 879.0, + 937.0, + 879.0, + 937.0, + 921.0, + 875.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 889.0, + 656.0, + 889.0, + 656.0, + 925.0, + 625.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 889.0, + 1145.0, + 889.0, + 1145.0, + 965.0, + 1112.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 892.0, + 600.0, + 892.0, + 600.0, + 925.0, + 568.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 896.0, + 543.0, + 896.0, + 543.0, + 927.0, + 512.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 896.0, + 1256.0, + 896.0, + 1256.0, + 929.0, + 1225.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 902.0, + 391.0, + 902.0, + 391.0, + 937.0, + 341.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 904.0, + 1200.0, + 904.0, + 1200.0, + 937.0, + 1170.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 913.0, + 600.0, + 913.0, + 600.0, + 948.0, + 570.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 915.0, + 1031.0, + 915.0, + 1031.0, + 969.0, + 998.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 917.0, + 710.0, + 917.0, + 710.0, + 944.0, + 685.0, + 944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 923.0, + 972.0, + 923.0, + 972.0, + 965.0, + 943.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 925.0, + 541.0, + 925.0, + 541.0, + 958.0, + 512.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 931.0, + 485.0, + 931.0, + 485.0, + 969.0, + 456.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 931.0, + 1200.0, + 931.0, + 1200.0, + 965.0, + 1170.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 933.0, + 1256.0, + 933.0, + 1256.0, + 965.0, + 1225.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 937.0, + 1312.0, + 937.0, + 1312.0, + 977.0, + 1285.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 938.0, + 937.0, + 938.0, + 937.0, + 981.0, + 875.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 940.0, + 426.0, + 940.0, + 426.0, + 965.0, + 401.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 940.0, + 599.0, + 940.0, + 599.0, + 977.0, + 570.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 940.0, + 1087.0, + 940.0, + 1087.0, + 971.0, + 1056.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 942.0, + 391.0, + 942.0, + 391.0, + 977.0, + 343.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 946.0, + 654.0, + 946.0, + 654.0, + 971.0, + 627.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 948.0, + 768.0, + 948.0, + 768.0, + 983.0, + 739.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 956.0, + 1198.0, + 956.0, + 1198.0, + 981.0, + 1173.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 961.0, + 427.0, + 961.0, + 427.0, + 986.0, + 401.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 963.0, + 1143.0, + 963.0, + 1143.0, + 998.0, + 1114.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 971.0, + 358.0, + 971.0, + 358.0, + 1054.0, + 312.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 981.0, + 393.0, + 981.0, + 393.0, + 1015.0, + 341.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 981.0, + 1200.0, + 981.0, + 1200.0, + 1013.0, + 1170.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 1017.0, + 391.0, + 1017.0, + 391.0, + 1056.0, + 343.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1002.0, + 712.0, + 1002.0, + 712.0, + 1038.0, + 681.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 998.0, + 937.0, + 998.0, + 937.0, + 1038.0, + 875.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 1015.0, + 1258.0, + 1015.0, + 1258.0, + 1075.0, + 1225.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 1056.0, + 395.0, + 1056.0, + 395.0, + 1098.0, + 339.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 1052.0, + 710.0, + 1052.0, + 710.0, + 1079.0, + 685.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1065.0, + 770.0, + 1065.0, + 770.0, + 1100.0, + 739.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 1054.0, + 829.0, + 1054.0, + 829.0, + 1121.0, + 795.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 1059.0, + 933.0, + 1059.0, + 933.0, + 1096.0, + 877.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 1059.0, + 1316.0, + 1059.0, + 1316.0, + 1107.0, + 1281.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 1052.0, + 1371.0, + 1052.0, + 1371.0, + 1083.0, + 1341.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 1098.0, + 393.0, + 1098.0, + 393.0, + 1134.0, + 341.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 1083.0, + 1371.0, + 1083.0, + 1371.0, + 1121.0, + 1341.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1121.0, + 781.0, + 1121.0, + 781.0, + 1157.0, + 381.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1125.0, + 829.0, + 1125.0, + 829.0, + 1154.0, + 789.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 1121.0, + 1325.0, + 1121.0, + 1325.0, + 1157.0, + 925.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1125.0, + 1373.0, + 1125.0, + 1373.0, + 1154.0, + 1335.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 1140.0, + 445.0, + 1140.0, + 445.0, + 1173.0, + 385.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 1140.0, + 547.0, + 1140.0, + 547.0, + 1169.0, + 508.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1140.0, + 989.0, + 1140.0, + 989.0, + 1173.0, + 927.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1140.0, + 1091.0, + 1140.0, + 1091.0, + 1169.0, + 1054.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 1173.0, + 677.0, + 1173.0, + 677.0, + 1211.0, + 545.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 1173.0, + 1222.0, + 1173.0, + 1222.0, + 1211.0, + 1091.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1209.0, + 545.0, + 1209.0, + 545.0, + 1242.0, + 510.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 1209.0, + 1035.0, + 1209.0, + 1035.0, + 1273.0, + 995.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1211.0, + 489.0, + 1211.0, + 489.0, + 1259.0, + 454.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1211.0, + 1091.0, + 1211.0, + 1091.0, + 1248.0, + 1054.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 1221.0, + 391.0, + 1221.0, + 391.0, + 1257.0, + 343.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 1223.0, + 975.0, + 1223.0, + 975.0, + 1259.0, + 943.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1228.0, + 903.0, + 1228.0, + 903.0, + 1507.0, + 847.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1230.0, + 545.0, + 1230.0, + 545.0, + 1265.0, + 512.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1238.0, + 1087.0, + 1238.0, + 1087.0, + 1273.0, + 1056.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 399.0, + 1240.0, + 429.0, + 1240.0, + 429.0, + 1271.0, + 399.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1246.0, + 937.0, + 1246.0, + 937.0, + 1288.0, + 875.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 1265.0, + 391.0, + 1265.0, + 391.0, + 1300.0, + 343.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1277.0, + 656.0, + 1277.0, + 656.0, + 1307.0, + 625.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1282.0, + 1087.0, + 1282.0, + 1087.0, + 1315.0, + 1056.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1286.0, + 352.0, + 1286.0, + 352.0, + 1334.0, + 316.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 1292.0, + 710.0, + 1292.0, + 710.0, + 1317.0, + 683.0, + 1317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 1301.0, + 1029.0, + 1301.0, + 1029.0, + 1334.0, + 998.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 1304.0, + 392.0, + 1304.0, + 392.0, + 1346.0, + 344.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1307.0, + 489.0, + 1307.0, + 489.0, + 1359.0, + 454.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 1307.0, + 541.0, + 1307.0, + 541.0, + 1332.0, + 514.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 1307.0, + 600.0, + 1307.0, + 600.0, + 1336.0, + 568.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 1311.0, + 933.0, + 1311.0, + 933.0, + 1348.0, + 877.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1229.0, + 1311.0, + 1254.0, + 1311.0, + 1254.0, + 1334.0, + 1229.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 1325.0, + 429.0, + 1325.0, + 429.0, + 1469.0, + 301.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 1344.0, + 539.0, + 1344.0, + 539.0, + 1371.0, + 514.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 1340.0, + 600.0, + 1340.0, + 600.0, + 1415.0, + 568.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1321.0, + 656.0, + 1321.0, + 656.0, + 1403.0, + 625.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 1355.0, + 710.0, + 1355.0, + 710.0, + 1380.0, + 685.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1376.0, + 770.0, + 1376.0, + 770.0, + 1413.0, + 739.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1371.0, + 937.0, + 1371.0, + 937.0, + 1415.0, + 875.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 1326.0, + 972.0, + 1326.0, + 972.0, + 1371.0, + 945.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 1325.0, + 1029.0, + 1325.0, + 1029.0, + 1359.0, + 1000.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1326.0, + 1087.0, + 1326.0, + 1087.0, + 1357.0, + 1056.0, + 1357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 1325.0, + 1147.0, + 1325.0, + 1147.0, + 1421.0, + 1112.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1164.0, + 1323.0, + 1204.0, + 1323.0, + 1204.0, + 1422.0, + 1164.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 1348.0, + 1256.0, + 1348.0, + 1256.0, + 1378.0, + 1225.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 1355.0, + 1314.0, + 1355.0, + 1314.0, + 1392.0, + 1285.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 1434.0, + 395.0, + 1434.0, + 395.0, + 1476.0, + 339.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1413.0, + 712.0, + 1413.0, + 712.0, + 1497.0, + 681.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1465.0, + 770.0, + 1465.0, + 770.0, + 1497.0, + 739.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1461.0, + 825.0, + 1461.0, + 825.0, + 1499.0, + 797.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1435.0, + 932.0, + 1435.0, + 932.0, + 1472.0, + 872.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 1422.0, + 1256.0, + 1422.0, + 1256.0, + 1474.0, + 1225.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 1461.0, + 1314.0, + 1461.0, + 1314.0, + 1499.0, + 1283.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 1455.0, + 1371.0, + 1455.0, + 1371.0, + 1488.0, + 1341.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 1478.0, + 391.0, + 1478.0, + 391.0, + 1517.0, + 343.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1492.0, + 768.0, + 1492.0, + 768.0, + 1524.0, + 739.0, + 1524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 1494.0, + 831.0, + 1494.0, + 831.0, + 1526.0, + 795.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1497.0, + 937.0, + 1497.0, + 937.0, + 1538.0, + 875.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1497.0, + 1368.0, + 1497.0, + 1368.0, + 1522.0, + 1343.0, + 1522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1524.0, + 781.0, + 1524.0, + 781.0, + 1561.0, + 381.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1528.0, + 829.0, + 1528.0, + 829.0, + 1557.0, + 789.0, + 1557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 1524.0, + 1325.0, + 1524.0, + 1325.0, + 1561.0, + 925.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1528.0, + 1373.0, + 1528.0, + 1373.0, + 1559.0, + 1333.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1544.0, + 445.0, + 1544.0, + 445.0, + 1576.0, + 383.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1547.0, + 543.0, + 1547.0, + 543.0, + 1570.0, + 512.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1544.0, + 989.0, + 1544.0, + 989.0, + 1576.0, + 927.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1547.0, + 1087.0, + 1547.0, + 1087.0, + 1570.0, + 1056.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 1576.0, + 687.0, + 1576.0, + 687.0, + 1615.0, + 539.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 1574.0, + 1229.0, + 1574.0, + 1229.0, + 1613.0, + 1083.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 1595.0, + 395.0, + 1595.0, + 395.0, + 1638.0, + 339.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1615.0, + 543.0, + 1615.0, + 543.0, + 1647.0, + 512.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1616.0, + 1087.0, + 1616.0, + 1087.0, + 1649.0, + 1056.0, + 1649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 864.0, + 1626.0, + 937.0, + 1626.0, + 937.0, + 1665.0, + 864.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 1634.0, + 487.0, + 1634.0, + 487.0, + 1670.0, + 456.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 1634.0, + 885.0, + 1634.0, + 885.0, + 1908.0, + 837.0, + 1908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 1634.0, + 975.0, + 1634.0, + 975.0, + 1666.0, + 941.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 1647.0, + 429.0, + 1647.0, + 429.0, + 1805.0, + 301.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 1711.0, + 485.0, + 1711.0, + 485.0, + 1757.0, + 456.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1653.0, + 545.0, + 1653.0, + 545.0, + 1724.0, + 510.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1661.0, + 656.0, + 1661.0, + 656.0, + 1724.0, + 625.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 1699.0, + 712.0, + 1699.0, + 712.0, + 1739.0, + 683.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 864.0, + 1665.0, + 937.0, + 1665.0, + 937.0, + 1745.0, + 864.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 1714.0, + 975.0, + 1714.0, + 975.0, + 1762.0, + 941.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1651.0, + 1033.0, + 1651.0, + 1033.0, + 1770.0, + 997.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1688.0, + 1087.0, + 1688.0, + 1087.0, + 1724.0, + 1056.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 1724.0, + 1200.0, + 1724.0, + 1200.0, + 1759.0, + 1170.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 1718.0, + 1258.0, + 1718.0, + 1258.0, + 1766.0, + 1223.0, + 1766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1741.0, + 431.0, + 1741.0, + 431.0, + 1787.0, + 395.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1741.0, + 656.0, + 1741.0, + 656.0, + 1772.0, + 625.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1743.0, + 937.0, + 1743.0, + 937.0, + 1786.0, + 866.0, + 1786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 1766.0, + 406.0, + 1766.0, + 406.0, + 1874.0, + 301.0, + 1874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1770.0, + 599.0, + 1770.0, + 599.0, + 1814.0, + 570.0, + 1814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1768.0, + 656.0, + 1768.0, + 656.0, + 1801.0, + 625.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1770.0, + 768.0, + 1770.0, + 768.0, + 1805.0, + 739.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1784.0, + 937.0, + 1784.0, + 937.0, + 1824.0, + 866.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 1772.0, + 1143.0, + 1772.0, + 1143.0, + 1843.0, + 1116.0, + 1843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 1795.0, + 1200.0, + 1795.0, + 1200.0, + 1826.0, + 1170.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 1768.0, + 1312.0, + 1768.0, + 1312.0, + 1818.0, + 1285.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 1853.0, + 395.0, + 1853.0, + 395.0, + 1943.0, + 341.0, + 1943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 1809.0, + 712.0, + 1809.0, + 712.0, + 1845.0, + 683.0, + 1845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 1859.0, + 772.0, + 1859.0, + 772.0, + 1910.0, + 737.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 1851.0, + 829.0, + 1851.0, + 829.0, + 1933.0, + 791.0, + 1933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1817.0, + 938.0, + 1817.0, + 938.0, + 1941.0, + 862.0, + 1941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 1834.0, + 1256.0, + 1834.0, + 1256.0, + 1868.0, + 1225.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 1872.0, + 1314.0, + 1872.0, + 1314.0, + 1928.0, + 1281.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 1841.0, + 1371.0, + 1841.0, + 1371.0, + 1928.0, + 1339.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1928.0, + 785.0, + 1928.0, + 785.0, + 1964.0, + 381.0, + 1964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1932.0, + 829.0, + 1932.0, + 829.0, + 1960.0, + 789.0, + 1960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 1926.0, + 1329.0, + 1926.0, + 1329.0, + 1966.0, + 921.0, + 1966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 1932.0, + 1371.0, + 1932.0, + 1371.0, + 1960.0, + 1331.0, + 1960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 1951.0, + 445.0, + 1951.0, + 445.0, + 1978.0, + 385.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1949.0, + 547.0, + 1949.0, + 547.0, + 1978.0, + 510.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 1951.0, + 987.0, + 1951.0, + 987.0, + 1978.0, + 929.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1949.0, + 1091.0, + 1949.0, + 1091.0, + 1978.0, + 1052.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2004.0, + 1396.0, + 2004.0, + 1396.0, + 2051.0, + 293.0, + 2051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2043.0, + 574.0, + 2043.0, + 574.0, + 2072.0, + 295.0, + 2072.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": [ + 830.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 830.0, + 2123.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 28, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 313, + 248, + 1382, + 248, + 1382, + 1989, + 313, + 1989 + ], + "score": 0.966 + }, + { + "category_id": 4, + "poly": [ + 302, + 2009, + 1387, + 2009, + 1387, + 2072, + 302, + 2072 + ], + "score": 0.931 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 816, + 76, + 816, + 104, + 299, + 104 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 866, + 2087, + 866, + 2113, + 835, + 2113 + ], + "score": 0.834 + }, + { + "category_id": 15, + "poly": [ + 840.0, + 231.0, + 967.0, + 231.0, + 967.0, + 267.0, + 840.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 284.0, + 630.0, + 284.0, + 630.0, + 309.0, + 603.0, + 309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 280.0, + 876.0, + 280.0, + 876.0, + 311.0, + 634.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 277.0, + 1176.0, + 277.0, + 1176.0, + 311.0, + 899.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 300.0, + 878.0, + 300.0, + 878.0, + 336.0, + 601.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 300.0, + 1176.0, + 300.0, + 1176.0, + 336.0, + 899.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 361.0, + 661.0, + 361.0, + 661.0, + 405.0, + 561.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 359.0, + 1203.0, + 359.0, + 1203.0, + 405.0, + 1103.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 392.0, + 386.0, + 392.0, + 386.0, + 430.0, + 344.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 394.0, + 930.0, + 394.0, + 930.0, + 428.0, + 874.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 394.0, + 972.0, + 394.0, + 972.0, + 437.0, + 922.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 397.0, + 892.0, + 397.0, + 892.0, + 722.0, + 836.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 403.0, + 482.0, + 403.0, + 482.0, + 440.0, + 451.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 417.0, + 1026.0, + 417.0, + 1026.0, + 465.0, + 992.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 422.0, + 425.0, + 422.0, + 425.0, + 453.0, + 394.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 432.0, + 928.0, + 432.0, + 928.0, + 466.0, + 872.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 438.0, + 386.0, + 438.0, + 386.0, + 478.0, + 344.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 449.0, + 542.0, + 449.0, + 542.0, + 497.0, + 507.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 624.0, + 457.0, + 655.0, + 457.0, + 655.0, + 489.0, + 624.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 462.0, + 365.0, + 462.0, + 365.0, + 653.0, + 310.0, + 653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 470.0, + 928.0, + 470.0, + 928.0, + 507.0, + 874.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 486.0, + 386.0, + 486.0, + 386.0, + 720.0, + 342.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 495.0, + 426.0, + 495.0, + 426.0, + 545.0, + 392.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 489.0, + 482.0, + 489.0, + 482.0, + 541.0, + 451.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 513.0, + 540.0, + 513.0, + 540.0, + 570.0, + 509.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 507.0, + 598.0, + 507.0, + 598.0, + 601.0, + 565.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 507.0, + 655.0, + 507.0, + 655.0, + 595.0, + 623.0, + 595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 488.0, + 711.0, + 488.0, + 711.0, + 652.0, + 682.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 564.0, + 771.0, + 564.0, + 771.0, + 660.0, + 738.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 633.0, + 830.0, + 633.0, + 830.0, + 722.0, + 792.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 509.0, + 930.0, + 509.0, + 930.0, + 708.0, + 867.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 940.0, + 522.0, + 965.0, + 522.0, + 965.0, + 568.0, + 940.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 514.0, + 1024.0, + 514.0, + 1024.0, + 570.0, + 994.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 493.0, + 1084.0, + 493.0, + 1084.0, + 608.0, + 1051.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 564.0, + 1144.0, + 564.0, + 1144.0, + 660.0, + 1105.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 530.0, + 1197.0, + 530.0, + 1197.0, + 652.0, + 1167.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 566.0, + 1255.0, + 566.0, + 1255.0, + 699.0, + 1224.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1280.0, + 605.0, + 1313.0, + 605.0, + 1313.0, + 697.0, + 1280.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1338.0, + 624.0, + 1372.0, + 624.0, + 1372.0, + 718.0, + 1338.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 716.0, + 782.0, + 716.0, + 782.0, + 752.0, + 380.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 720.0, + 830.0, + 720.0, + 830.0, + 748.0, + 790.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 716.0, + 1324.0, + 716.0, + 1324.0, + 752.0, + 921.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 720.0, + 1374.0, + 720.0, + 1374.0, + 748.0, + 1334.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 739.0, + 440.0, + 739.0, + 440.0, + 766.0, + 380.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 741.0, + 540.0, + 741.0, + 540.0, + 762.0, + 507.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 735.0, + 984.0, + 735.0, + 984.0, + 768.0, + 922.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 739.0, + 1086.0, + 739.0, + 1086.0, + 766.0, + 1047.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 768.0, + 676.0, + 768.0, + 676.0, + 806.0, + 544.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 768.0, + 1221.0, + 768.0, + 1221.0, + 806.0, + 1088.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 804.0, + 425.0, + 804.0, + 425.0, + 839.0, + 394.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 804.0, + 928.0, + 804.0, + 928.0, + 839.0, + 871.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 808.0, + 967.0, + 808.0, + 967.0, + 839.0, + 932.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 816.0, + 484.0, + 816.0, + 484.0, + 875.0, + 450.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 817.0, + 1028.0, + 817.0, + 1028.0, + 932.0, + 990.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 827.0, + 890.0, + 827.0, + 890.0, + 1101.0, + 842.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 835.0, + 386.0, + 835.0, + 386.0, + 875.0, + 342.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 835.0, + 540.0, + 835.0, + 540.0, + 875.0, + 509.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 846.0, + 1084.0, + 846.0, + 1084.0, + 948.0, + 1051.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 860.0, + 928.0, + 860.0, + 928.0, + 894.0, + 872.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 863.0, + 598.0, + 863.0, + 598.0, + 950.0, + 565.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 871.0, + 363.0, + 871.0, + 363.0, + 1056.0, + 311.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 873.0, + 484.0, + 873.0, + 484.0, + 919.0, + 450.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 879.0, + 536.0, + 879.0, + 536.0, + 906.0, + 511.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 879.0, + 967.0, + 879.0, + 967.0, + 919.0, + 938.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 881.0, + 425.0, + 881.0, + 425.0, + 911.0, + 394.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 883.0, + 384.0, + 883.0, + 384.0, + 921.0, + 342.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 883.0, + 709.0, + 883.0, + 709.0, + 908.0, + 686.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 885.0, + 767.0, + 885.0, + 767.0, + 909.0, + 742.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 932.0, + 386.0, + 932.0, + 386.0, + 971.0, + 344.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 896.0, + 540.0, + 896.0, + 540.0, + 927.0, + 509.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 900.0, + 655.0, + 900.0, + 655.0, + 992.0, + 623.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 915.0, + 711.0, + 915.0, + 711.0, + 950.0, + 682.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 904.0, + 767.0, + 904.0, + 767.0, + 931.0, + 742.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 913.0, + 930.0, + 913.0, + 930.0, + 954.0, + 869.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 923.0, + 1144.0, + 923.0, + 1144.0, + 1000.0, + 1105.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 913.0, + 1255.0, + 913.0, + 1255.0, + 977.0, + 1224.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1280.0, + 904.0, + 1315.0, + 904.0, + 1315.0, + 957.0, + 1280.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 982.0, + 386.0, + 982.0, + 386.0, + 1069.0, + 344.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 996.0, + 713.0, + 996.0, + 713.0, + 1055.0, + 680.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 990.0, + 769.0, + 990.0, + 769.0, + 1030.0, + 740.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1051.0, + 826.0, + 1051.0, + 826.0, + 1086.0, + 798.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 971.0, + 930.0, + 971.0, + 930.0, + 1065.0, + 869.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 986.0, + 1140.0, + 986.0, + 1140.0, + 1017.0, + 1109.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 959.0, + 1199.0, + 959.0, + 1199.0, + 1042.0, + 1167.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1021.0, + 1257.0, + 1021.0, + 1257.0, + 1076.0, + 1222.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1280.0, + 994.0, + 1315.0, + 994.0, + 1315.0, + 1046.0, + 1280.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1044.0, + 1369.0, + 1044.0, + 1369.0, + 1082.0, + 1340.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 1080.0, + 386.0, + 1080.0, + 386.0, + 1117.0, + 344.0, + 1117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1076.0, + 830.0, + 1076.0, + 830.0, + 1124.0, + 796.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 1080.0, + 930.0, + 1080.0, + 930.0, + 1122.0, + 869.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1086.0, + 1369.0, + 1086.0, + 1369.0, + 1120.0, + 1340.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1111.0, + 782.0, + 1111.0, + 782.0, + 1182.0, + 367.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1124.0, + 830.0, + 1124.0, + 830.0, + 1153.0, + 790.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 1120.0, + 1324.0, + 1120.0, + 1324.0, + 1157.0, + 921.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1124.0, + 1374.0, + 1124.0, + 1374.0, + 1155.0, + 1336.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 1140.0, + 440.0, + 1140.0, + 440.0, + 1172.0, + 378.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 1140.0, + 982.0, + 1140.0, + 982.0, + 1172.0, + 922.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 1143.0, + 1082.0, + 1143.0, + 1082.0, + 1166.0, + 1051.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 1172.0, + 676.0, + 1172.0, + 676.0, + 1211.0, + 544.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 1172.0, + 1219.0, + 1172.0, + 1219.0, + 1211.0, + 1088.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1209.0, + 425.0, + 1209.0, + 425.0, + 1243.0, + 394.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 1211.0, + 969.0, + 1211.0, + 969.0, + 1243.0, + 938.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1212.0, + 484.0, + 1212.0, + 484.0, + 1258.0, + 450.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 1226.0, + 544.0, + 1226.0, + 544.0, + 1318.0, + 505.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 1228.0, + 384.0, + 1228.0, + 384.0, + 1266.0, + 342.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 1230.0, + 888.0, + 1230.0, + 888.0, + 1502.0, + 840.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1232.0, + 926.0, + 1232.0, + 926.0, + 1266.0, + 871.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 1241.0, + 1030.0, + 1241.0, + 1030.0, + 1318.0, + 990.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1253.0, + 1084.0, + 1253.0, + 1084.0, + 1318.0, + 1049.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1268.0, + 425.0, + 1268.0, + 425.0, + 1305.0, + 394.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1268.0, + 482.0, + 1268.0, + 482.0, + 1306.0, + 451.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1273.0, + 363.0, + 1273.0, + 363.0, + 1462.0, + 308.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 1276.0, + 713.0, + 1276.0, + 713.0, + 1308.0, + 680.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 1278.0, + 767.0, + 1278.0, + 767.0, + 1303.0, + 742.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 1278.0, + 971.0, + 1278.0, + 971.0, + 1320.0, + 934.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 1285.0, + 386.0, + 1285.0, + 386.0, + 1322.0, + 342.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1285.0, + 594.0, + 1285.0, + 594.0, + 1312.0, + 569.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1287.0, + 930.0, + 1287.0, + 930.0, + 1329.0, + 871.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 1297.0, + 767.0, + 1297.0, + 767.0, + 1322.0, + 742.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 1303.0, + 651.0, + 1303.0, + 651.0, + 1326.0, + 626.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1305.0, + 1022.0, + 1305.0, + 1022.0, + 1329.0, + 997.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 1308.0, + 1082.0, + 1308.0, + 1082.0, + 1343.0, + 1051.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 1314.0, + 709.0, + 1314.0, + 709.0, + 1341.0, + 684.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 1316.0, + 596.0, + 1316.0, + 596.0, + 1354.0, + 567.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 621.0, + 1318.0, + 659.0, + 1318.0, + 659.0, + 1400.0, + 621.0, + 1400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1318.0, + 1311.0, + 1318.0, + 1311.0, + 1356.0, + 1284.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1322.0, + 1257.0, + 1322.0, + 1257.0, + 1381.0, + 1222.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1339.0, + 386.0, + 1339.0, + 386.0, + 1379.0, + 346.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 1347.0, + 930.0, + 1347.0, + 930.0, + 1387.0, + 869.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 1351.0, + 1144.0, + 1351.0, + 1144.0, + 1433.0, + 1105.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 1366.0, + 1197.0, + 1366.0, + 1197.0, + 1450.0, + 1167.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 1391.0, + 769.0, + 1391.0, + 769.0, + 1423.0, + 740.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1398.0, + 384.0, + 1398.0, + 384.0, + 1435.0, + 348.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1406.0, + 928.0, + 1406.0, + 928.0, + 1443.0, + 872.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 1414.0, + 1309.0, + 1414.0, + 1309.0, + 1446.0, + 1286.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1420.0, + 711.0, + 1420.0, + 711.0, + 1460.0, + 682.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1435.0, + 1253.0, + 1435.0, + 1253.0, + 1483.0, + 1224.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1452.0, + 386.0, + 1452.0, + 386.0, + 1491.0, + 346.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1452.0, + 1370.0, + 1452.0, + 1370.0, + 1489.0, + 1340.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1464.0, + 830.0, + 1464.0, + 830.0, + 1527.0, + 796.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 1464.0, + 930.0, + 1464.0, + 930.0, + 1504.0, + 867.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1492.0, + 1370.0, + 1492.0, + 1370.0, + 1527.0, + 1340.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 1525.0, + 778.0, + 1525.0, + 778.0, + 1561.0, + 376.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1529.0, + 830.0, + 1529.0, + 830.0, + 1558.0, + 790.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 1525.0, + 1322.0, + 1525.0, + 1322.0, + 1561.0, + 921.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1529.0, + 1372.0, + 1529.0, + 1372.0, + 1558.0, + 1334.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 1544.0, + 440.0, + 1544.0, + 440.0, + 1577.0, + 378.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 1548.0, + 540.0, + 1548.0, + 540.0, + 1571.0, + 509.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 1544.0, + 982.0, + 1544.0, + 982.0, + 1577.0, + 922.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1546.0, + 1084.0, + 1546.0, + 1084.0, + 1575.0, + 1049.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1577.0, + 684.0, + 1577.0, + 684.0, + 1615.0, + 538.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1079.0, + 1575.0, + 1229.0, + 1575.0, + 1229.0, + 1617.0, + 1079.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1609.0, + 486.0, + 1609.0, + 486.0, + 1696.0, + 448.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 1609.0, + 969.0, + 1609.0, + 969.0, + 1650.0, + 930.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1611.0, + 927.0, + 1611.0, + 927.0, + 1645.0, + 865.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 1621.0, + 1024.0, + 1621.0, + 1024.0, + 1659.0, + 994.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1631.0, + 425.0, + 1631.0, + 425.0, + 1665.0, + 394.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 1634.0, + 890.0, + 1634.0, + 890.0, + 1909.0, + 842.0, + 1909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 1636.0, + 540.0, + 1636.0, + 540.0, + 1673.0, + 509.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1652.0, + 386.0, + 1652.0, + 386.0, + 1690.0, + 346.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 1663.0, + 542.0, + 1663.0, + 542.0, + 1719.0, + 507.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 1667.0, + 1024.0, + 1667.0, + 1024.0, + 1709.0, + 996.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1671.0, + 425.0, + 1671.0, + 425.0, + 1703.0, + 394.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1675.0, + 928.0, + 1675.0, + 928.0, + 1711.0, + 872.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1678.0, + 363.0, + 1678.0, + 363.0, + 1864.0, + 307.0, + 1864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1680.0, + 971.0, + 1680.0, + 971.0, + 1723.0, + 932.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 1705.0, + 1082.0, + 1705.0, + 1082.0, + 1740.0, + 1053.0, + 1740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 1726.0, + 386.0, + 1726.0, + 386.0, + 1765.0, + 340.0, + 1765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 624.0, + 1732.0, + 655.0, + 1732.0, + 655.0, + 1771.0, + 624.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 1740.0, + 713.0, + 1740.0, + 713.0, + 1801.0, + 680.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1736.0, + 928.0, + 1736.0, + 928.0, + 1772.0, + 872.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 1755.0, + 1082.0, + 1755.0, + 1082.0, + 1792.0, + 1051.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 1799.0, + 384.0, + 1799.0, + 384.0, + 1840.0, + 344.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1788.0, + 596.0, + 1788.0, + 596.0, + 1838.0, + 569.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 624.0, + 1792.0, + 653.0, + 1792.0, + 653.0, + 1824.0, + 624.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 1790.0, + 769.0, + 1790.0, + 769.0, + 1824.0, + 740.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 1797.0, + 930.0, + 1797.0, + 930.0, + 1838.0, + 869.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1795.0, + 1257.0, + 1795.0, + 1257.0, + 1847.0, + 1222.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 1818.0, + 1142.0, + 1818.0, + 1142.0, + 1882.0, + 1107.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1282.0, + 1820.0, + 1313.0, + 1820.0, + 1313.0, + 1853.0, + 1282.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 1828.0, + 1197.0, + 1828.0, + 1197.0, + 1866.0, + 1167.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1876.0, + 386.0, + 1876.0, + 386.0, + 1914.0, + 346.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1855.0, + 711.0, + 1855.0, + 711.0, + 1891.0, + 682.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 1861.0, + 769.0, + 1861.0, + 769.0, + 1899.0, + 740.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1859.0, + 830.0, + 1859.0, + 830.0, + 1930.0, + 798.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1856.0, + 931.0, + 1856.0, + 931.0, + 1904.0, + 868.0, + 1904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 1859.0, + 1196.0, + 1859.0, + 1196.0, + 1899.0, + 1167.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1880.0, + 1255.0, + 1880.0, + 1255.0, + 1916.0, + 1224.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1280.0, + 1880.0, + 1313.0, + 1880.0, + 1313.0, + 1916.0, + 1280.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1861.0, + 1374.0, + 1861.0, + 1374.0, + 1935.0, + 1336.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 1930.0, + 780.0, + 1930.0, + 780.0, + 1964.0, + 374.0, + 1964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1932.0, + 830.0, + 1932.0, + 830.0, + 1962.0, + 790.0, + 1962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1919.0, + 1322.0, + 1919.0, + 1322.0, + 1990.0, + 905.0, + 1990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1932.0, + 1374.0, + 1932.0, + 1374.0, + 1962.0, + 1334.0, + 1962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1951.0, + 438.0, + 1951.0, + 438.0, + 1978.0, + 380.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 1949.0, + 542.0, + 1949.0, + 542.0, + 1978.0, + 505.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 1951.0, + 1086.0, + 1951.0, + 1086.0, + 1978.0, + 1047.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2004.0, + 1395.0, + 2004.0, + 1395.0, + 2051.0, + 293.0, + 2051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2042.0, + 585.0, + 2042.0, + 585.0, + 2071.0, + 295.0, + 2071.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": [ + 830.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2121.0, + 830.0, + 2121.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 29, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/BkQqq0gRb/BkQqq0gRb_layout.pdf b/parse/train/BkQqq0gRb/BkQqq0gRb_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c052c0ee3f514ee8d4e30b3fa27f8b9cba096a93 --- /dev/null +++ b/parse/train/BkQqq0gRb/BkQqq0gRb_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0d87fc049104fbed41052118989a24fcf9768bfc8c88e4318e356219e059b8c7 +size 2099447 diff --git a/parse/train/BkQqq0gRb/BkQqq0gRb_origin.pdf b/parse/train/BkQqq0gRb/BkQqq0gRb_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8526888298904d19a93290d546faba5e7faa087b --- /dev/null +++ b/parse/train/BkQqq0gRb/BkQqq0gRb_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:adc3927f63dd31a16ab06400029c4de10d01f7b672a920f4f52280e6e0b649cb +size 1893313 diff --git a/parse/train/BkQqq0gRb/BkQqq0gRb_span.pdf b/parse/train/BkQqq0gRb/BkQqq0gRb_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..aa9b30768a3ac37d10ed2a8a8aa3d57fc5857a92 --- /dev/null +++ b/parse/train/BkQqq0gRb/BkQqq0gRb_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0e7a6946e1169bb97eb42c036505ac980b3cd7450ad64748ab71e693ac50be6d +size 2101498 diff --git a/parse/train/BkeqO7x0-/BkeqO7x0-.md b/parse/train/BkeqO7x0-/BkeqO7x0-.md new file mode 100644 index 0000000000000000000000000000000000000000..83f01583f9d1d705ffc55b1c161c8a0d9f36e0cc --- /dev/null +++ b/parse/train/BkeqO7x0-/BkeqO7x0-.md @@ -0,0 +1,475 @@ +# UNSUPERVISED CIPHER CRACKING USING DISCRETE GANS + +Aidan N. Gomez 1,2 aidan@cs.toronto.edu + +Sicong Huang 1,2 huang@cs.toronto.edu + +Ivan Zhang 2 ivan@ivanzhang.ca + +Bryan M. Li 1,2 bryan@bryanli.io + +Muhammad Osama 1,2 muhammad.osama@mcode.ca + +Łukasz Kaiser 3 lukaszkaiser@google.com + +1 Department of Computer Science, University of Toronto +2 FOR.ai +3 Google Brain + +# ABSTRACT + +This work details CipherGAN, an architecture inspired by CycleGAN used for inferring the underlying cipher mapping given banks of unpaired ciphertext and plaintext. We demonstrate that CipherGAN is capable of cracking language data enciphered using shift and Vigenere ciphers to a high degree of fidelity and for \` vocabularies much larger than previously achieved. We present how CycleGAN can be made compatible with discrete data and train in a stable way. We then prove that the technique used in CipherGAN avoids the common problem of uninformative discrimination associated with GANs applied to discrete data. + +# 1 INTRODUCTION + +Humans have been encoding messages for secrecy since before the ancient Greeks, and for the same amount of time, have been fascinated with trying to crack these codes using brute-force, frequency analysis, crib-dragging and even espionage. Simple ciphers have, in the past century, been rendered irrelevant in favor of the more secure encryption schemes enabled by modern computational resources. However, the question of cipher-cracking remains an interesting problem since it requires an intimate understanding of the structure in a language. Nearly all automated cipher cracking techniques have had to rely on a human-in-the-loop; grounding the automated techniques in a human’s preexisting knowledge of language to clean up the errors made by simple algorithms such as frequency analysis. Across a number of domains, the use of hand-crafted features has often been replaced by automatic feature extraction directly from data using end-to-end learning frameworks (Goodfellow et al., 2016). The question to be addressed is as follows: + +Can a neural network be trained to deduce withheld ciphers from unaligned text, without the supplementation of preexisting human knowledge? + +The implications for such a general framework would be far-reaching in the field of unsupervised translation, where each language can be treated as an enciphering of the other. The decoding of the Copiale cipher (Knight et al., 2011) stands as an excellent example of the potential for machine learning techniques to decode enciphered texts by treating the problem as language translation. The CycleGAN (Zhu et al., 2017) architecture is extremely general and we demonstrate our adaptation, CipherGAN, is capable of cracking ciphers to an extremely high degree of accuracy. CipherGAN requires little or no modification to be applied to plaintext and ciphertext banks generated by the user’s cipher of choice. + +In addition to presenting a GAN that can crack ciphers, we contribute the following techniques: + +• We show how to stabilize CycleGAN training: our CipherGAN achieves good performance in all training runs, compared to approximately $50 \%$ of runs for the original CycleGAN. +We provide a theoretical description and analysis of the uninformative discrimination problem that impacts GANs applied to discrete data. +• We introduce a solution to the above problem by operating in the embedding space and show that it works in practice. + +# 1.1 SHIFT AND VIGENERE \` CIPHERS + +The shift and Vigenere ciphers are well known historical substitution ciphers. The earliest known \` record of a substitution cipher is believed to have dated back to 58 BCE, when Julius Caesar replaced each letter in a message with the letter that was three places further down the alphabet (Singh, 2000). + +![](images/460d7b3f9d39c9ab0d81dac7303d48440815027d54ce29a9743c7db1f3544a48.jpg) +Figure 1: An example of a right-shift-3 cipher. + +Using Figure 1, the message “attackatdawn” can be encrypted to “DWWDFNDWGDZQ”. This message can be easily deciphered by the intended recipient (who is aware of the particular shift number used) but looks meaningless to a third party. The shift cipher ensured secure communication between sender and receiver for centuries, until the ninth century polymath Al-Kindi introduced the concept of frequency analysis (Singh, 2000). He suggested that it would be possible to crack a cipher simply by analyzing the individual characters’ frequencies. For instance, in English the most frequently occurring letters are $\cdot _ { e } ,$ $( 1 2 . 7 \% )$ , $\cdot _ { t } ,$ $( 9 . 1 \% )$ and $\cdot _ { a } ,$ $( 8 . 2 \% )$ ; whereas $\mathbf { \dot { q } }$ , $\cdot _ { x } ,$ and $\cdot _ { z } ,$ each have frequency of less than $1 \%$ . Moreover, the code-breaker can also focus on bigrams of repeated letters; ‘ss’, ‘ee’, and ‘oo’ are the most common in English. This structure in language provides an exploit of efficiency to the code-breaker. + +Polyalphabetic substitution ciphers, including the Vigenere cipher, were introduced to inhibit the \` use of n-gram frequency analysis in determining the cipher mapping. Instead, the encrypter further scrambles the message by using a separate shift cipher for each element of a key that is tiled to match the length of the plaintext. Increasing the key length greatly increases the number of possible combinations and thus prevents against basic frequency analysis. In the mid nineteenth century, Charles Babbage recognized that the length of the used key could be determined by counting the repetitions and spacing of sequences of letters in the cipher (Singh, 2000). Using the determined length, we can then apply frequency analysis on the index of the cipher base. This method makes it possible to break the Vigenere cipher, but is very time consuming and requires strong knowledge of \` the language itself. + +There is a rich literature of automated shift-cipher cracking techniques (Ramesh et al., 1993; Forsyth & Safavi-Naini, 1993; Hasinoff, 2003; Knight et al., 2006; Verma et al., 2007; Raju et al., 2010; Knight et al., 2011) many of which achieve excellent results which is what one would expect from hand-crafted algorithms targeting specific ciphers and vocabularies. Work on automated cracking of polyalphabetic ciphers (Carroll & Martin, 1986; Toemeh & Arumugam, 2008; Omran et al., 2011) has seen similar success on small vocabularies. It is a difficult matter to compare the results of previous work with our own as their focus ranges from inferring cipher keys (Carroll & Martin, 1986; Ramesh et al., 1993; Omran et al., 2011), to inferring the mappings given limited quantities of ciphertext (determining unicity distance) (Carroll & Martin, 1986; Ramesh et al., 1993; Hasinoff, 2003; Verma et al., 2007), to analyzing the unicity distance required to solve small percentages of the cipher mappings (i.e. $20 \%$ in Carroll & Martin (1986)). + +In comparison to these past works, we afford ourselves the advantage of an unconstrained corpus of ciphertext, however, we prescribe ourselves the following constraints: our model is not provided any prior knowledge of vocabulary element frequencies; and, no information about the cipher key is provided. Another complexity our work must overcome is our significantly larger vocabulary sizes; all previous work has addressed vocabularies of approximately 26 characters, while our model is capable of solving word-level ciphers with over 200 distinct vocabulary elements. As such, our methodology is notably ‘hands-off’ in comparison to previous work and can be easily applied to different forms of cipher, different underlying data and unsupervised text alignment tasks. + +# 1.2 GANS AND WASSERSTEIN GANS + +Generative Adversarial Networks (GANs) are a class of neural network architectures introduced by Goodfellow et al. (2014) as an alternative to optimizing likelihood under a true data distribution. Instead, GANs balance the optimization of a generator network which attempts to produce convincing samples from the data distribution, and a discriminator which is trained to distinguish between samples from the true data distribution and the generator’s synthetic samples. GANs have been shown to produce compelling results in the domain of image generation, but comparatively weak performance in domains using discrete data (discussed in Section 2). + +The original GAN discriminator objective as introduced in Goodfellow et al. (2014) is: + +$$ +D ^ { * } = \arg \operatorname* { m a x } _ { D } \mathbb { E } _ { x \sim \mathcal { X } } [ \log D ( x ) ] - \mathbb { E } _ { z \sim \mathcal { Z } } [ \log ( 1 - D ( F ( z ) ) ) ] +$$ + +Where $F$ is the generator network and $D$ is the discriminator network. This loss is vulnerable to the problem of ‘mode collapse’ where the generative distribution collapses to produce a generating distribution with low diversity. In order to more broadly distribute the mass, the Wasserstein GAN (WGAN) objective (Arjovsky et al., 2017) considers the set of K-Lipschitz discriminator functions $D : X \mathbb { R }$ and minimizes the earth movers (1st Wasserstein) distance. The Lipschitz condition is enforced by clipping discriminators weights to fall within a predefined range. + +$$ +D ^ { * } = \arg \operatorname* { m a x } _ { \| D \| _ { L } \leq K } \mathbb { E } _ { x \sim \mathcal { X } } [ D ( x ) ] - \mathbb { E } _ { z \sim \mathcal { Z } } [ D ( F ( z ) ) ] +$$ + +An improved WGAN objective, introduced by Gulrajani et al. (2017), enforced the Lipschitz condition using a Jacobian regularization term instead of the originally proposed weight-clipping solution. This resulted in more stable training, avoiding capacity under-use and exploding gradients, and improved network performance over weight-clipping. + +$$ +\begin{array} { r l } & { D ^ { * } = \arg \underset { D } { \operatorname* { m a x } } \mathbb { E } _ { x \sim \mathcal { X } } [ D ( x ) ] - \mathbb { E } _ { z \sim \mathcal { Z } } [ D ( F ( z ) ) ] + } \\ & { \qquad \quad \alpha \cdot \mathbb { E } _ { \hat { x } \sim \hat { \mathcal { X } } } [ ( \| \nabla _ { \hat { x } } D ( \hat { x } ) \| _ { 2 } - 1 ) ^ { 2 } ] } \end{array} +$$ + +Here $\hat { \mathcal X }$ are samples taken along a line between the true data distribution $\mathcal { X }$ and the generator’s data distribution $\mathcal { X } _ { g } \overset { \cdot } { = } \{ F ( z ) | z \sim \bar { \mathcal { Z } } \}$ . + +# 1.3 CYCLEGAN + +CycleGAN (Zhu et al., 2017) is a generative adversarial network designed to learn a mapping between two data distributions without supervision. Three separate works (Zhu et al., 2017; Yi et al., 2017; Liu et al., 2017) share many of the core features we describe below, however, for simplicity we will refer to CycleGAN as the basis for our work as it is the most similar to our model. It acts on distributions $\mathcal { X }$ and $\mathcal { V }$ by using two mapping generators: $F : \mathcal { X } \mathcal { Y }$ and $G : \mathcal { V } \to \mathcal { X }$ ; and two discriminators: $D _ { \mathcal { X } } : \mathcal { X } [ 0 , 1 ]$ and $D y : \bar { \mathcal { Y } } \stackrel { \textstyle - } { \to } \bar { [ 0 , 1 ] }$ . + +CycleGAN optimizes the standard GAN loss ${ \mathcal { L } } _ { \mathrm { G A N } }$ : + +$$ +{ \mathcal { L } } _ { \mathrm { G A N } } ( F , D _ { \mathcal { V } } , \chi , \mathcal { V } ) = \mathbb { E } _ { y \sim \mathcal { V } } [ \log D _ { \mathcal { V } } ( y ) ] + \mathbb { E } _ { x \sim \chi } [ \log ( 1 - D _ { \mathcal { V } } ( F ( x ) ) ) ] +$$ + +While also considering a reconstruction loss, or ‘cycle’ loss $\mathcal { L } _ { \mathrm { c y c } }$ : + +$$ +\begin{array} { r } { \mathcal { L } _ { \mathrm { c y c } } ( F , G , \mathcal { X } , \mathcal { Y } ) = \mathbb { E } _ { x \sim \mathcal { X } } [ \| G ( F ( x ) ) - x \| _ { 1 } ] + \mathbb { E } _ { y \sim \mathcal { Y } } [ \| F ( G ( y ) ) - y \| _ { 1 } ] } \end{array} +$$ + +Taken together the losses are balanced using a hyperparameter $\lambda$ : + +$$ +\begin{array} { r } { \mathcal { L } ( F , G , D _ { \mathcal { X } } , D _ { \mathcal { Y } } , \mathcal { X } , \mathcal { Y } ) = \mathcal { L } _ { \mathrm { G A N } } ( F , D _ { \mathcal { Y } } , \mathcal { X } , \mathcal { Y } ) + \mathcal { L } _ { \mathrm { G A N } } ( G , D _ { \mathcal { X } } , \mathcal { Y } , \mathcal { X } ) + \lambda \cdot \mathcal { L } _ { \mathrm { c y c } } ( F , G , \mathcal { X } , \mathcal { Y } ) } \end{array} +$$ + +![](images/812aeb636c0618e5ae1a7118c5a53c0189743ca4f6c24f4f68b67e47a40cac93.jpg) +Figure 2: Discriminators trained on the toy example of recognizing the bottom-right corner of a simplex as true data. From left to right the discriminators were regularized using: nothing; WGAN Jacobian norm regularization; and, the relaxed sampling technique. + +This leads to the training objectives: + +$$ +\begin{array} { r l } & { F ^ { * } = \arg \underset { F } { \operatorname* { m i n } } \mathcal { L } _ { \mathrm { c y c } } ( F , G , \mathcal { X } , \mathcal { Y } ) + \mathcal { L } _ { \mathrm { G A N } } ( F , D _ { \mathcal { Y } } , \mathcal { X } , \mathcal { Y } ) } \\ & { G ^ { * } = \arg \underset { G } { \operatorname* { m i n } } \mathcal { L } _ { \mathrm { c y c } } ( F , G , \mathcal { X } , \mathcal { Y } ) + \mathcal { L } _ { \mathrm { G A N } } ( G , D _ { \mathcal { X } } , \mathcal { Y } , \mathcal { X } ) } \\ & { D _ { \mathcal { X } } ^ { * } = \arg \underset { D _ { \mathcal { X } } } { \operatorname* { m a x } } \mathcal { L } _ { \mathrm { G A N } } ( G , D _ { \mathcal { X } } , \mathcal { Y } , \mathcal { X } ) } \\ & { D _ { \mathcal { Y } } ^ { * } = \arg \underset { D _ { \mathcal { Y } } } { \operatorname* { m a x } } \mathcal { L } _ { \mathrm { G A N } } ( F , D _ { \mathcal { Y } } , \mathcal { X } , \mathcal { Y } ) } \end{array} +$$ + +CycleGAN uses $\mathcal { L } _ { \mathrm { c y c } }$ to avoid mode collapse by preserving reconstruction of mapping inputs from outputs. It has demonstrated excellent results in unpaired image translation between two visually similar categories. Our architecture is the first example of this unsupervised learning framework being successfully applied to discrete data such as language. + +# 2 DISCRETE GANS + +Applying GANs to discrete data generation is still an open research problem that has seen great interest and development. The primary difficulty with training discrete data generators in a GAN setting is the lack of a gradient through a discrete node in the computation graph. The alternatives to producing discrete outputs - for instance, generators producing a categorical distribution over discrete elements - are prone to uninformative discrimination (described below), in that, the discriminator may use an optimal discrimination criterion that is unrelated to the correctness of the re-discretized generated data. In our example of a continuous distribution over discrete elements, the produced samples all lie within the standard simplex $\Delta ^ { k }$ with dimension $k$ equal to the number of elements in the distribution. In this case, samples from the true data distribution always lie on a vertex $\mathbf { v } _ { i }$ of the simplex, while any sub-optimal generator will produce samples within the simplex’s interior ${ \Delta ^ { k } \backslash \{ \bf { v } _ { 1 } , . . . , \bf { v } _ { k } \} }$ . In this example, a discriminator which performs uninformative discrimination might evaluate a sample’s membership in the vertices of the simplex as an optimal discrimination criterion, which is entirely uninformative of the correctness of re-discretized samples from the generator. + +A number of solutions to training generators with discrete outputs have been proposed: SeqGAN (Yu et al., 2017) uses the REINFORCE gradient estimate to train the generator; Boundary-seeking GANs (Hjelm et al., 2017) and maximum-likelihood augmented GANs (Che et al., 2017) proposed a gradient approximation with low bias and variance that resembles the REINFORCE (Williams, 1992) estimator. Gumbel-softmax GANs (Kusner & Hernandez-Lobato, 2016) replace discrete variables in ´ the simplex with continuous relaxations called Concrete (Maddison et al., 2016) or Gumbel-softmax (Jang et al., 2016) variables; WGANs (Arjovsky et al., 2017) were suggested as a remedy to the uninformative discrimination problem by ensuring that the discriminator’s rate of change with respect to its input is bound by some constant. + +Our work utilizes both the Wasserstein GAN (Gulrajani et al., 2017; Arjovsky et al., 2017) and relaxation of discrete random variables (such as Concrete/Gumbel-softmax). It has been noted multiple times in implementations of CycleGAN as well as in the original paper itself that the architecture was sensitive to initialization and requires repeat attempts in order to converge to a satisfactory mapping (Bansal & Rathore, 2017; Sari, 2017). Our architecture suffered the same instability before the WGAN Jacobian norm regularization term was added to the discriminator’s loss. In addition, we found that having the discriminator operate over embedding space instead of directly over softmax vectors produced by our generator has improved performance. + +Our hypothesis, which is justified by Proposition 1 below, is that the embedding vectors may act as continuous relaxations of discrete random variables as small, noisy updates are applied throughout training; Proposition 1 asserts that by replacing discrete random variables with continuous ones, our discriminator is prevented from arbitrarily approximating a Dirac delta distribution. Figure 2 shows simple discriminators trained on the toy task of identify a single vertex of a simplex as true data; it is clear that a lack of regularization leads to the discriminator collapsing to the vertex of the simplex, leaving approximately zero gradient everywhere; while the Jacobian regularization of Wasserstein GANs leads to the space covered by lines leading from the true data vertex to the generated data having a lower rate of change (note that the gradient is still close to zero in the remaining area of the simplex); and finally, replacing the discrete random variables of the true data with continuous samples about the vertex results in a much more gradual transition, which is desirable since it provides a stronger gradient signal from which to learn. + +Unique to CycleGAN is the auxiliary cycle loss described in Section 1.3. The effect of this additional objective is the generated samples regularly being forced away from the discriminator’s minimum in favor of a mapping that better-satisfies reconstruction. For instance, it may be the case that the discriminator favors a particular cipher mapping that is not bijective; in this case, the model will receive a strong signal from the cycle loss away from the discriminator’s minimum. In these cases where the model moves against the gradient it receives from the discriminator it may be the case that this region has near zero curvature (as is visually discernible from Figure 2); this is because the WGAN curvature regularization (see Equation 3) has not been applied in this region. + +‘Curvature’ here refers to the curvature of the discriminator’s output with respect to its input; this curvature determines the strength of the training signal received by the generator. Low curvature means little information for the generator to improve itself with. This motivates the benefits of having strong curvature globally, as opposed to linearly between the generators samples and the true data. Kodali et al. (2017) proposes regularizing in all directions about the generated samples, which would likely remedy the vanishing gradient in our case as well; for our experiments, the relaxed sampling technique proved effective. It should also be noted that Luc et al. (2016) propose something similar to relaxed sampling whereby they replace the ground-truth discrete tokens with a distribution over the vocabulary that distributes some of the mass across the remaining incorrect tokens. + +Let us now introduce the definitions needed for the formal presentation of Proposition 1. + +# Definitions. + +• (Continuous relaxation of a discrete set). A continuous relaxation of a discrete set $\mathcal { X }$ is a proper, path-connected metric space $\overline { { \mathcal { X } } }$ satisfying $\chi _ { \mathrm { ~ C ~ } } \overline { { \mathcal { X } } }$ . +• (Rediscretization function). A rediscretization function is an injective function $R : \overline { { \mathcal { X } } } \to \mathcal { X }$ from a continuous relaxation $\overline { { \mathcal { X } } }$ of discrete space $\mathcal { X }$ satisfying $\forall x \in \mathcal { X } , \exists \epsilon > 0$ s.t. $R \equiv$ $x$ on $B _ { \epsilon } [ x ]$ . Note that $R$ defines an equivalence relation in $\overline { { \mathcal { X } } }$ . +• (Uninformative Discrimination). A discriminator $D _ { \mathcal { X } }$ is said to perform uninformative discrimination under rediscretization function $R$ if: $\exists x \in { \mathcal { X } } , { \bar { x } } \in { \overline { { \mathcal { X } } } }$ s.t. $R ( \bar { x } ) = x$ ) $\wedge$ $( D _ { \mathcal { X } } ( x ) \not \approx D _ { \mathcal { X } } ( \bar { x } ) )$ . +• (Continuous relaxation of a function). A continuous relaxation of a function over discrete sets $F : \mathcal { X } \mathcal { V }$ is another function $\overline { { F } } : \overline { { \mathcal { X } } } \overline { { \mathcal { Y } } }$ (where $\overline { { \mathcal { X } } } , \overline { { \mathcal { V } } }$ are continuous relaxations of $x , y )$ such that $\overline { F }$ is continuous and ${ \overline { { F } } } ( x ) = F ( x ) , \forall x \in { \mathcal { X } }$ . + +The following proposition (proved in the Appendix) forms the theoretical basis of the technique. + +Proposition 1 (Reliable Fooling Via Relaxation). + +Given: + +• discrete spaces $\mathcal { X } , \mathcal { y }$ and continuous relaxations $\overline { { \mathcal { X } } } , \overline { { \mathcal { V } } }$ • generators $F : \overline { { \mathcal { X } } } \overline { { \mathcal { V } } } , G : \overline { { \mathcal { V } } } \overline { { \mathcal { X } } }$ bijections satisfying $F = G ^ { - 1 }$ • discrete discriminators $D _ { \mathcal { X } } , D _ { \mathcal { Y } }$ both optimal for fixed $F , G$ • rediscretization functions $R _ { \mathcal { X } } , R _ { \mathcal { Y } }$ + +Suppose: $F$ is approximately volume preserving in a small region about each $x \in \mathcal { X }$ . Consequently the same is true for $G$ about each $y \in \mathcal { V }$ . + +If: during training, we replace discrete random variables from $\mathcal { X }$ which lie in the continuous metric space $\overline { { \mathcal { X } } }$ with samples from regions about them. + +Then: the optimal relaxed discriminators $D _ { \overline { { \mathcal { X } } } }$ and $D _ { \overline { { { y } } } }$ have a non-empty region about each $x \in \mathcal { X }$ and $y \in \mathcal { V }$ where they are expected to assign values close to $D _ { \mathcal { X } } ( x )$ and $D _ { \mathcal { Y } } ( y )$ . + +Figure 3 compares a model trained with embedding vectors versus one with only the softmax outputs. It becomes clear on a harder task, such as Vigenere, that the embeddings vastly outperforms \` softmax in terms of speed of convergence and final accuracy; however we found that the simpler task of a shift cipher showed little difference between embeddings and softmax, suggesting an increase in task complexity increases the benefits provided by the stronger gradient signal of embeddings. + +# 3 METHOD + +# 3.1 CIPHERGAN + +GANs applied to text data have yet to produce truly convincing results (Kawthekar et al.). Previous attempts at discrete sequence generation with GANs have generally utilized a generator outputting a probability distribution over the token space (Gulrajani et al., 2017; Yu et al., 2017; Hjelm et al., 2017). This leads to the discriminator receiving a sequence of discrete random variables from the data distribution, and a sequence of continuous random variables from the generator distribution; making the task of discrimination trivial and uninformative of the underlying data distribution. In order to avoid such a scenario, we perform all discrimination within the embedding space by allowing the generator’s output distribution to define a convex combination of corresponding embeddings. This leads to the following losses: + +$$ +\begin{array} { r l } & { \mathcal { L } _ { \mathrm { G A N } } ( F , D _ { \mathcal { V } } , \boldsymbol { \chi } , \mathcal { V } ) = \mathbb { E } _ { \boldsymbol { y } \sim \mathcal { V } } [ \log D _ { \mathcal { V } } ( \boldsymbol { y } \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) ] } \\ & { \qquad + \mathbb { E } _ { \boldsymbol { x } \sim \mathcal { X } } [ \log ( 1 - D _ { \mathcal { V } } ( \boldsymbol { F } ( \boldsymbol { x } \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) ) ] } \\ & { \qquad \mathcal { L } _ { \mathrm { c y c } } ( F , G , \boldsymbol { \chi } , \mathcal { V } ) = \mathbb { E } _ { \boldsymbol { x } \sim \mathcal { X } } [ \| G ( F ( \boldsymbol { x } \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) - \boldsymbol { x } \| _ { 1 } ] } \\ & { \qquad + \mathbb { E } _ { \boldsymbol { y } \sim \mathcal { Y } } [ \| F ( G ( \boldsymbol { y } \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) - \boldsymbol { y } \| _ { 1 } ] } \end{array} +$$ + +We perform an inner product between the embeddings $W _ { E m b }$ and the one-hot vectors in $x$ as well as between the embeddings and the softmax vectors produced by generators $F$ and $G$ . The former is equivalent to a lookup operation over the table of embedding vectors, while the latter is a convex combination between all vectors in the vocabulary. The embeddings $W _ { E m b }$ are trained at each step to minimize $\mathcal { L } _ { \mathrm { c y c } }$ and maximize $\mathcal { L } _ { \mathrm { G A N } }$ , meaning the embeddings are easily mapped from and are easy to discriminate. As was discussed in Section 2, training with the above loss functions was unstable, with approximately three of every four experiments failing to produce compelling results. This is a problem we observed with the original CycleGAN horse-zebra experiment, and one that has been noted by multiple re-implementations online (Bansal & Rathore, 2017; Sari, 2017). We were able to significantly increase the stability by training the discriminator loss along with the Lipschitz conditioning term from the improved Wasserstein GAN (Gulrajani et al., 2017) (see Equation 3 and Fedus et al. (2017)), resulting in the following loss (DualGAN (Yi et al., 2017) opted to use weight-clipping to enforce the Lipschitz condition): + +$$ +\begin{array} { r l } & { \mathcal { L } _ { \mathrm { G A N } } ( F , D _ { \mathcal { V } } , \boldsymbol { \chi } , \mathcal { V } ) = \mathbb { E } _ { y \sim \mathcal { V } } [ D _ { \mathcal { V } } ( \boldsymbol { y } \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) ] } \\ & { \qquad - \mathbb { E } _ { \boldsymbol { x } \sim \boldsymbol { x } } [ D _ { \mathcal { V } } ( F ( \boldsymbol { x } \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) \cdot \boldsymbol { W } _ { E m b } ^ { \top } ) ] } \\ & { \qquad + \alpha \cdot \mathbb { E } _ { \hat { \boldsymbol { y } } \sim \hat { \mathcal { V } } } [ ( \| \nabla _ { \hat { \boldsymbol { y } } } D _ { \mathcal { V } } ( \hat { \boldsymbol { y } } ) \| _ { 2 } - 1 ) ^ { 2 } ] } \end{array} +$$ + +As a consequence of Proposition 1, discriminators trained on non-stationary embeddings will be unable to approximate Dirac delta distributions to arbitrary accuracy; implying there are dedicated ‘safe-zones’ about members of $\mathcal { X }$ where the generator can reliably fool the discriminator and uninformative discrimination is prevented. + +In our experiments, we jointly train the embedding vectors as parameters of the model. The gradient updates applied to these vectors introduces noise between training iterations; we observed that embedding vectors tend to remain in a bounded region after the initial steps of training. We found + +
WorkCiphertext LengthAccuracy
Hasinoff (2003)500~ 97%
Forsyth& Safavi-Naini (1993)5000~ 100%
Ramesh et al. (1993)160~ 78.5%
Verma et al. (2007)1000~ 87%
+ +Table 1: Previous results on automated shift cipher cracking with limited ciphertext length. + +that simply replacing the data with embedding vectors had a similar effect to performing the random sampling described in Proposition 1 (see Figure 3). + +# 4 EXPERIMENTS + +# 4.1 DATA + +Our experiments use plaintext natural language samples from the Brown English text dataset (Francis $\&$ Kucera, 1979). We generate $2 *$ batch size plaintext samples, the first half are fed as the CycleGAN’s $\mathcal { X }$ distribution and the second half is passed through the cipher of choice and fed as the $\mathcal { V }$ distribution. + +For our natural language plaintext data we used the Brown English-language corpus which consists of over one million words in 57340 sentences. We experiment with both word-level ”Brown-W” and character-level ”Brown- $\mathbf { \vec { C } } ^ { \mathbf { \vec { \mu } } }$ vocabularies. For word-level vocabularies, we control the size of the vocabulary by taking the top $k$ most frequent words and introducing an ‘unknown’ token which we use to replace all words that are not within the taken vocabulary. We demonstrate our method’s ability to scale to large vocabularies using the word-level vocabularies; more modern enciphering techniques rely on large substitution-boxes (S-boxes) with many (often hundreds of) elements. + +# 4.2 TRAINING + +As in Zhu et al. (2017) we replace the log-likelihood loss with a squared difference loss which was originally introduced by Mao et al. (2016). The original motivation for this replacement was improved stability in training and avoidance of the vanishing gradients problem. In this work we found the effect on training stability substantial. + +$$ +\begin{array} { r l } & { \mathcal { L } _ { \mathrm { G A N } } ( F , D y , \mathcal { X } , \mathcal { Y } ) = \mathbb { E } _ { y \sim \mathcal { Y } } [ ( D y ( y \cdot W _ { E m b } ^ { \top } ) ) ^ { 2 } ] } \\ & { \qquad + \mathbb { E } _ { x \sim \mathcal { X } } [ ( 1 - D _ { \mathcal { V } } ( F ( x \cdot W _ { E m b } ^ { \top } ) \cdot W _ { E m b } ^ { \top } ) ) ^ { 2 } ] } \\ & { \qquad + \alpha \cdot \mathbb { E } _ { \hat { y } \sim \hat { \mathcal { Y } } } [ ( 1 - \| \nabla _ { \hat { y } } D y ( \hat { y } ) \| _ { 2 } ) ^ { 2 } ] } \end{array} +$$ + +Hence, our total loss is: + +$$ +\begin{array} { r l } { \mathcal { L } _ { \mathrm { T o t a l } } ( F , G , D _ { \mathcal { X } } , D _ { \mathcal { Y } } , \mathcal { X } , \mathcal { Y } ) = \mathcal { L } _ { \mathrm { c y c } } ( F , G , \mathcal { X } , \mathcal { Y } ) } & { } \\ { + \mathcal { L } _ { \mathrm { G A N } } ( F , D _ { \mathcal { V } } , \mathcal { X } , \mathcal { Y } ) } & { } \\ { + \mathcal { L } _ { \mathrm { G A N } } ( G , D _ { \mathcal { X } } , \mathcal { X } , \mathcal { Y } ) } \end{array} +$$ + +We adapted the convolutional architecture for the generator and discriminator directly from Zhu et al. (2017). We simply replace all two dimensional convolutions with the one dimension variant and reduce the filter sizes in our generators to 1 (pointwise convolutions). Convolutional neural networks have recently been shown to be highly effective on language tasks and can speed up training significantly (Zhang & LeCun, 2015; Kalchbrenner et al., 2016; Yu et al., 2017). Both our generators and discriminators receive a sequence of vectors in embedding space; our generators produce a softmax distribution over the vocabulary, while our discriminator produces a scalar output. For all our experiments we use a cycle loss with regularization coefficient $\lambda = 1$ . In order to be compatible with the WGAN we replace batch normalization (Ioffe & Szegedy, 2015) with layer normalization (Ba et al., 2016). We train using the Adam optmizer (Kingma & Ba, 2014) with batch size 64 and learning rate $2 e - 4$ , $\beta _ { 1 } = 0$ and $\beta _ { 2 } = 0 . 9$ . Our learning rate is exponentially warmed up to $2 e - 4$ over 2500 steps, and held constant thereafter. We use learned embedding vectors with 256 dimensions. The WGAN Lipschitz conditioning parameter was set to $\alpha = 1 0$ as was prescribed in Gulrajani et al. (2017). + +![](images/a2e5c03b8e76f7f6e10222d4ba2250b1da9bf6d92b825379601540cad2ec3077.jpg) +Figure 3: Left: Comparison of different timing techniques for Brown-C Vigenere. Right: Compari- \` son of embedding vs. raw softmax on Brown-W with vocab size of 200. + +Table 2: Average proportion of characters correctly mapped in a given sequence. The “Freq. Analysis” column is simple frequency analysis applied to the same corpus our model observes. For Vigenere we also show the score if the key were known (note: the key is left unknown to our \` model). + +
Data Vocab sizeBrown-W 10Brown-W 200Brown-C 58Freq. Analysis (With Key) 58200
CipherShift/Permutation
Acc.100%98.7%99.8%80.9%44.5%
CipherVigenere (Key: “345")
Acc.99.7%75.7%99.0%9.6% (78.1%)<0.1% (44.3%)
+ +For the Vigenere cipher, positional information is critical to the network being able to perform the \` mapping. In order to facilitate this we experimented with adding the timing signal described in Vaswani et al. (2017) (”Transformer Timing” in Figure 3) and found that performance increased relative to no explicit timing signal; we found that the best option was concatenating a learned positional embedding vector specific to each position onto the sequence (”Concat Timing” in Figure 3), this dramatically improved performance, however this means that the architecture can not generalize to sequences longer than those in the training set. A potential solution to the issue of generalizing to longer sequences would be making a ’soft’ choice at each position for which positional embedding vector to concatenate using a softmax distribution over a set of embedding vectors larger than the expected key length, however, we leave this to future work. + +# 4.3 DISCUSSION + +Table 2 shows that CipherGAN was able to solve shift ciphers to near flawless accuracy, with all three vocabulary sizes being easily decoded by the model. CipherGAN performs extremely well on Vigenere, achieving excellent results on the character-level cipher and strong results on the chal- \` lenging word-level cipher with a vocabulary size of 200. The vocabulary size of 58 for our character level, containing punctuation and special characters, is more than double what has been previously explored. In comparison to the original CycleGAN architecture, we found CipherGAN to be extremely consistent in training and notably insensitive to the random initialization of weights; we attribute this stability to the Jacobian norm regularization term. + +For both ciphers, the first mappings to be correctly determined were those of the most frequently occurring vocabulary elements, suggesting that the network does indeed perform some form of frequency analysis to distinguish outlier frequencies in the two banks of text. Another interesting observation is that of the mistakes made by the network: the network would frequently confuse punctuation marks with one another, perhaps suggesting that these vocabulary elements’ skip-gram signatures were similar enough to lead to the repeated confusion observed across many training runs. + +# 5 CONCLUSION + +CipherGAN is a compelling demonstration of the potential generative adversarial networks hold to act on discrete data to solve difficult tasks that rely on an extremely sensitive and nuanced discrimination criterion. Our work serves to redouble the promise of the CycleGAN architecture for unsupervised alignment tasks for multiple classes of data. CipherGAN presents an algorithm that is both stable and consistent in training, improving upon past implementations of the CycleGAN architecture. Our work theoretically motivates – and empirically confirms – the use of continuous relaxations of discrete variables, not only to facilitate the flow of gradients through discrete nodes, but also to prevent the oft-observed phenomena of uninformative discrimination. CipherGAN is highly general in its structure and can be directly applied to a variety of unsupervised text alignment tasks, without excess burden of adaptation. On the one hand, CipherGAN is an early step towards the goal of unsupervised translation between languages and has shown excellent performance on the simplified task of cipher map inference. On the other hand, the methods we introduce can be used more broadly in the field of text generation with adversarial networks. + +# ACKNOWLEDGMENTS + +Our thanks goes to Roger Grosse and Kelvin Shuangjian Zhang for their advice and support throughout. We also thank Otavio Good and Ian Goodfellow for meaningful early discussions and direction; as well as Michal Wiszniewski for his assistance in developing the code upon which the experiments were run. This work was made possible thanks to the AI Grant, which provided generous support throughout. + +# REFERENCES + +Martin Arjovsky, Soumith Chintala, and Leon Bottou. Wasserstein gan. ´ arXiv preprint arXiv:1701.07875, 2017. +Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint arXiv:1607.06450, 2016. +Hardik Bansal and Archit Rathore. Understanding and implementing cyclegan in tensorflow. https://hardikbansal.github.io/CycleGANBlog/, 2017. +John M Carroll and Steve Martin. The automated cryptanalysis of substitution ciphers. Cryptologia, 10(4):193–209, 1986. +Tong Che, Yanran Li, Ruixiang Zhang, R Devon Hjelm, Wenjie Li, Yangqiu Song, and Yoshua Bengio. Maximum-likelihood augmented discrete generative adversarial networks. arXiv preprint arXiv:1702.07983, 2017. +William Fedus, Mihaela Rosca, Balaji Lakshminarayanan, Andrew M. Dai, Shakir Mohamed, and Ian Goodfellow. Many paths to equilibrium: Gans do not need to decrease a divergence at every step, 2017. +William S Forsyth and Reihaneh Safavi-Naini. Automated cryptanalysis of substitution ciphers. Cryptologia, 17(4):407–418, 1993. +W Nelson Francis and Henry Kucera. Brown corpus manual. Brown University, 2, 1979. +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, pp. 2672–2680, 2014. +Ian Goodfellow, Yoshua Bengio, and Aaron Courville. Deep Learning. MIT Press, 2016. http: //www.deeplearningbook.org. + +Ishaan Gulrajani, Faruk Ahmed, Martin Arjovsky, Vincent Dumoulin, and Aaron Courville. Improved training of wasserstein gans. arXiv preprint arXiv:1704.00028, 2017. + +Sam Hasinoff. Solving substitution ciphers. Department of Computer Science, University of Toronto, Tech. Rep, 2003. + +R Devon Hjelm, Athul Paul Jacob, Tong Che, Kyunghyun Cho, and Yoshua Bengio. Boundaryseeking generative adversarial networks. arXiv preprint arXiv:1702.08431, 2017. + +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. + +Eric Jang, Shixiang Gu, and Ben Poole. Categorical reparameterization with gumbel-softmax. arXiv preprint arXiv:1611.01144, 2016. + +Nal Kalchbrenner, Lasse Espeholt, Karen Simonyan, Aaron van den Oord, Alex Graves, and Koray Kavukcuoglu. Neural machine translation in linear time. arXiv preprint arXiv:1610.10099, 2016. + +Prasad Kawthekar, Raunaq Rewari, and Suvrat Bhooshan. Evaluating generative models for text generation. + +Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. CoRR, abs/1412.6980, 2014. URL http://arxiv.org/abs/1412.6980. + +Kevin Knight, Anish Nair, Nishit Rathod, and Kenji Yamada. Unsupervised analysis for decipherment problems. In Proceedings of the COLING/ACL on Main conference poster sessions, pp. 499–506. Association for Computational Linguistics, 2006. + +Kevin Knight, Beata Megyesi, and Christiane Schaefer. The copiale cipher. In ´ Proceedings of the 4th Workshop on Building and Using Comparable Corpora: Comparable Corpora and the Web, pp. 2–9. Association for Computational Linguistics, 2011. + +Naveen Kodali, Jacob Abernethy, James Hays, and Zsolt Kira. How to train your dragan. arXiv preprint arXiv:1705.07215, 2017. + +Matt J Kusner and Jose Miguel Hern ´ andez-Lobato. Gans for sequences of discrete elements with ´ the gumbel-softmax distribution. arXiv preprint arXiv:1611.04051, 2016. + +Ming-Yu Liu, Thomas Breuel, and Jan Kautz. Unsupervised image-to-image translation networks. arXiv preprint arXiv:1703.00848, 2017. + +Pauline Luc, Camille Couprie, Soumith Chintala, and Jakob Verbeek. Semantic segmentation using adversarial networks. arXiv preprint arXiv:1611.08408, 2016. + +Chris J Maddison, Andriy Mnih, and Yee Whye Teh. The concrete distribution: A continuous relaxation of discrete random variables. arXiv preprint arXiv:1611.00712, 2016. + +Xudong Mao, Qing Li, Haoran Xie, Raymond YK Lau, Zhen Wang, and Stephen Paul Smolley. Least squares generative adversarial networks. arXiv preprint ArXiv:1611.04076, 2016. + +SS Omran, AS Al-Khalid, and DM Al-Saady. A cryptanalytic attack on vigenere cipher using \` genetic algorithm. In Open Systems (ICOS), 2011 IEEE Conference on, pp. 59–64. IEEE, 2011. + +Bhadri Msvs Raju et al. Decipherment of substitution cipher using enhanced probability distribution. International Journal of Computer Applications, 5(8):34–40, 2010. + +RS Ramesh, G Athithan, and K Thiruvengadam. An automated approach to solve simple substitution ciphers. Cryptologia, 17(2):202–218, 1993. + +Eyyb Sari. tensorflow-cyclegan. https://github.com/Eyyub/tensorflow-cyclegan, 2017. + +Simon Singh. The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Anchor, 2000. + +Ragheb Toemeh and Subbanagounder Arumugam. Applying genetic algorithms for searching keyspace of polyalphabetic substitution ciphers. International Arab Journal of Information Technology (IAJIT), 5(1), 2008. + +Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Lukasz Kaiser, and Illia Polosukhin. Attention is all you need. arXiv preprint arXiv:1706.03762, 2017. + +AK Verma, Mayank Dave, and RC Joshi. Genetic algorithm and tabu search attack on the monoalphabetic substitution cipher i adhoc networks. In Journal of Computer science. Citeseer, 2007. + +Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning, 8(3-4):229–256, 1992. + +Zili Yi, Hao Zhang, Ping Tan Gong, et al. Dualgan: Unsupervised dual learning for image-to-image translation. arXiv preprint arXiv:1704.02510, 2017. + +Lantao Yu, Weinan Zhang, Jun Wang, and Yong Yu. Seqgan: Sequence generative adversarial nets with policy gradient. In AAAI, pp. 2852–2858, 2017. + +Xiang Zhang and Yann LeCun. Text understanding from scratch. arXiv preprint arXiv:1502.01710, 2015. + +Jun-Yan Zhu, Taesung Park, Phillip Isola, and Alexei A Efros. Unpaired image-to-image translation using cycle-consistent adversarial networks. arXiv preprint arXiv:1703.10593, 2017. + +# APPENDIX + +A ARCHITECTURAL DETAILS + +For both the generator and discriminator architectures below, we assume the network is provided with a sequence of $N$ tokens denoted data laying in a $K$ -simplex. Therefore data is an $N$ by $K$ matrix. + +For simplicity we define the following notation: + +$$ +\begin{array} { r l } & { \mathrm { \mathrm { ~ 5 o n v L a y e r } } _ { f _ { c , f s = 1 , s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( C o n v 1 D _ { f c , f s } ( x ) ) ) } \\ & { \qquad \mathrm { R e s B l o c k } _ { f _ { c , f s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( x + C o n v 1 D _ { f c , f s } ( C o n v 1 D _ { f c , f s } ( x ) ) ) ) } \\ & { \mathrm { C o n v S t a c k } _ { n , f c , f s = 1 } ( x ) = } \\ & { \qquad \mathrm { C o n v L a y e r } _ { 1 , f s } \circ \mathrm { C o n v L a y e r } _ { 2 ^ { 1 } \cdot f c , f s , 2 } \circ \cdot \cdot \circ \mathrm { C o n v L a y e r } _ { 2 ^ { n } \cdot f c , f s , 2 } \circ \mathrm { C o n v L a y e r } _ { f c , f s , 2 } ( x ) } \end{array} +$$ + +# A.1 GENERATOR + +We define the following constants: + +• $f c = 3 2$ : The base ’filter count‘, or number of filters in a convolution layer +• $f s = 1$ : The ’filter size‘, or width of weight kernel used in convolution layers +• $v s = 1$ : The ’vocab size‘, or number of elements in the vocabulary +• $s = 1$ : The stride of the convolution layers +• $E = 1 0 0$ : The dimensionality of the embedding vectors +• $T = 1 0 0$ : The dimensionality of the concat timing weights + +First, we first look up embedding vectors corresponding to the observed tokens. This is performed as a simple inner-product between data and a learning weight matrix of embeddings $W _ { \mathrm { E m b } } ^ { \mathbf { \Upsilon } ^ { \bullet } } \in \mathbb { R } ^ { K \times E }$ : + +$$ +x = \mathrm { d a t a } \cdot W _ { \mathrm { E m b } } +$$ + +Next, a timing signal is added using either: + +• The Transformer method: + +$$ +\begin{array} { c } { { \mathrm { s i g n a l } _ { n , 2 k } = \sin ( n / 1 e 5 ^ { 2 k / K } ) } } \\ { { \mathrm { s i g n a l } _ { n , 2 k + 1 } = \cos ( n / 1 e 5 ^ { 2 k / K } ) } } \\ { { \mathrm { t i m i n g } ( x ) = x + \mathrm { s i g n a l } } } \end{array} +$$ + +• The concat method: + +$$ +\begin{array} { r l } & { W _ { \mathrm { t i m e } } \in \mathbb { R } ^ { N \times T } } \\ & { t = \mathsf { t i m i n g } ( x ) = [ x \| _ { 2 } W _ { \mathrm { t i m e } } ] } \end{array} +$$ + +Where $W _ { \mathrm { t i m e } }$ are trained parameters and $[ \cdot | | _ { k } \cdot ]$ denotes concatenation along the $k ^ { \mathrm { { t h } } }$ axis. + +Then the generator is defined as follows: + +$$ +\begin{array} { r l } & { \phantom { \frac { 1 } { 2 } } a ( x ) = \mathrm { C o n v L a y e r } _ { 4 \cdot f c } ( \mathrm { C o n v L a y e r } _ { 2 \cdot f c , f s } ( \mathrm { C o n v L a y e r } _ { f c } ( x ) ) ) } \\ & { \phantom { \frac { 1 } { 2 } } b ( x ) = \mathrm { R e s B l o c k } _ { 4 \cdot f c } ^ { ( 5 ) } ( x ) } \\ & { \circ \mathrm { u t } ( t ) = \mathrm { S o f t m a x } ( \mathrm { C o n v L a y e r } _ { v s } ( b ( a ( t ) ) ) ) } \end{array} +$$ + +# A.2 DISCRIMINATOR + +We define the following constants: + +• $f c = 3 2$ : The base ’filter count‘, or number of filters in a convolution layer • $f s = 1 5$ : The ’filter size‘, or width of weight kernel used in convolution layers • $n = 5$ : The depth of the convolutional stack + +Similar to the generator, a timing signal is added first. Leading to the following discriminator: + +$$ +\mathsf { o u t } ( t ) = \mathbf { C o n v S t a c k } _ { n , f c , f s } ( \mathsf { d r o p o u t } _ { 0 . 5 } ( t ) ) +$$ + +B PROOF OF PROPOSITION 1 + +Proposition 1 (Reliable Fooling Via Relaxation). + +Given: + +• discrete spaces $\mathcal { X } , \mathcal { y }$ and continuous relaxations $\overline { { \mathcal { X } } } , \overline { { \mathcal { V } } }$ • generators $F : \overline { { \mathcal { X } } } \overline { { \mathcal { V } } } , G : \overline { { \mathcal { V } } } \overline { { \mathcal { X } } }$ bijections satisfying $F = G ^ { - 1 }$ • discrete discriminators $D _ { \mathcal { X } } , D _ { \mathcal { Y } }$ both optimal for fixed $F , G$ • rediscretization functions $R _ { \mathcal { X } } , R _ { \mathcal { Y } }$ + +Suppose: $F$ is approximately volume preserving in a small region about each $x \in \mathcal { X }$ . Consequently the same is true for $G$ about each $y \in \mathcal { V }$ . +If: during training, we replace discrete random variables from $\mathcal { X }$ which lie in the continuous metric space $\overline { { \mathcal { X } } }$ with samples from regions about them. +Then: the optimal relaxed discriminators $D _ { \overline { { \mathcal { X } } } }$ and $D _ { \overline { { { y } } } }$ have a non-empty region about each $x \in \mathcal { X }$ and $y \in \mathcal { V }$ where they are expected to assign values close to $D _ { \mathcal { X } } ( x )$ and $D _ { \mathcal { Y } } ( y )$ . + +Proof. We’ll prove one side of the CipherGAN as the proof for both sides are similar. + +Given bijective function between continuous relaxations of $\mathcal { X }$ and $\mathcal { V }$ : $F : ( \overline { { \mathcal { X } } } , d _ { \overline { { \mathcal { X } } } } ) ( \overline { { \mathcal { V } } } , d _ { \overline { { \mathcal { V } } } } )$ , where $\mathcal { X }$ and $\mathcal { V }$ contain finite sequences (length $n$ ) of vectors laying on the vertices of the simplex $\Delta ^ { k }$ , and are supports of data distributions $p _ { \mathscr { X } } , p _ { \mathscr { Y } }$ respectively. + +Let: + +• $\overline { { \mathcal { X } } } = \overline { { \mathcal { Y } } } = \underbrace { \Delta ^ { k } \times \cdots \times \Delta ^ { k } } _ { n }$ with $k$ equal to the number of elements in our vocabulary. • the rediscretization function $R _ { { \mathcal { X } } } : { \overline { { { \mathcal { X } } } } } { \mathcal { X } }$ : $R _ { { \mathcal K } } ( \bar { x } ) = \arg \operatorname* { m i n } _ { x \in { \mathcal K } } d _ { \overline { { { \mathcal K } } } } ( \bar { x } , x )$ ; similarly for $R _ { \mathcal { Y } }$ . + +Now, for each $x \in \mathcal { X }$ consider the infinite set $S _ { x }$ with cardinality of the continuum constructed according to: + +Equivalently, + +$$ +S _ { x } = R _ { \chi } ^ { - 1 } ( x ) \cap F ^ { - 1 } ( R _ { \ y } ^ { - 1 } ( F ( x ) ) ) +$$ + +Note. $S _ { x }$ is never of cardinality less than the continuum since the following is implied by the definitions of $R _ { \mathcal { X } }$ , $S _ { x }$ and the fact that $F$ is continuous: $x \in \mathcal { X } \implies x \in S _ { x } \wedge \exists$ closed ball $B _ { \epsilon } [ x ]$ with radius + +$$ +0 < \epsilon < \operatorname* { m i n } _ { \substack { z \in \overline { { \mathcal X } } } } d _ { \mathcal X } ( x , z ) +$$ + +So, for each element $x \in \mathcal { X }$ there exists a closed set of points in $\overline { { \mathcal { X } } }$ which are rediscretized, under $R _ { \mathcal { X } }$ , to $x$ . Since $S _ { x }$ is a Borel Set we can sample uniformly from it. Therefore, during training suppose we replace each element of $x \in \mathcal { X }$ with a sample $\bar { x } \sim S _ { x }$ : + +We begin with the discrete objective: + +$$ +\sum _ { x \in \mathcal { X } } p _ { \mathcal { X } } ( x ) \log ( D _ { \mathcal { X } } ( x ) ) + p _ { F } ( x ) \log ( 1 - D _ { \mathcal { X } } ( x ) ) +$$ + +As was noted in Goodfellow et al. (2014), this objective is optimized in $D _ { \mathcal { X } } : \mathcal { X } [ 0 , 1 ]$ when: + +$$ +D _ { \mathcal { X } } = \frac { p _ { \mathcal { X } } } { p _ { \mathcal { X } } + p _ { G } } +$$ + +which is undesirable as $p _ { \mathcal { X } }$ is a sum of Dirac delta distributions $\begin{array} { r } { p _ { \mathcal { X } } ( x ) = \sum _ { x _ { i } \in \mathcal { X } } \delta _ { x _ { i } } ( x ) } \end{array}$ and lacks a non-zero gradient to train the generator function with. Instead, let us consider a continuous relaxation $D _ { \overline { { \mathcal { X } } } } : \overline { { \mathcal { X } } } [ 0 , 1 ]$ of the discriminator $D _ { \mathcal { X } }$ and observe where it optimizes. + +Suppose $\forall x \in \mathcal { X } , \exists \epsilon _ { x } \geq 0 , \forall \bar { x } \in S _ { x }$ + +$$ +\left( 1 - \epsilon _ { x } \right) \leq \left| \nabla _ { \bar { x } } F ( \bar { x } ) \right| \leq \left( 1 + \epsilon _ { x } \right) +$$ + +That is, suppose $F$ is approximately volume preserving within a small region about each $x \in \mathcal { X }$ . + +Lemma 1. $\forall y \in \mathcal { Y } , G ( S _ { y } ) = S _ { G ( y ) }$ + +Proof of Lemma $^ { l }$ . For all $y \in \mathcal { V }$ with $G ( y ) = x \Leftrightarrow y = F ( x )$ : + +$$ +\begin{array} { r l } & { G ( S _ { y } ) = G [ R _ { y } ^ { - 1 } ( y ) \cap G ^ { - 1 } ( R _ { \chi } ^ { - 1 } ( G ( y ) ) ) ] } \\ & { \qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \cap G ( G ^ { - 1 } ( R _ { \chi } ^ { - 1 } ( G ( y ) ) ) ) } \\ & { \qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \cap R _ { \chi } ^ { - 1 } ( G ( y ) ) } \\ & { \qquad = F ^ { - 1 } ( R _ { y } ^ { - 1 } ( F ( x ) ) ) \cap R _ { \chi } ^ { - 1 } ( x ) } \\ & { \qquad = S _ { x } = S _ { G ( y ) } } \end{array} +$$ + +Corollary 1. + +$$ +\int _ { { \bar { x } } \sim S _ { G ( y ) } } { \frac { 1 } { \left| S _ { G ( y ) } \right| } } d { \bar { x } } = \int _ { { \bar { x } } \sim G ( S _ { y } ) } { \frac { \left| \nabla _ { \bar { x } } F ( { \bar { x } } ) \right| } { \left| S _ { y } \right| } } d { \bar { x } } +$$ + +Proof of Corollary 1. + +$$ +\begin{array} { r l } { \displaystyle \int _ { \bar { x } \sim S _ { G ( y ) } } \frac { 1 } { \vert S _ { G ( y ) } \vert } d \bar { x } = 1 = \int _ { \bar { y } \sim S _ { y } } \frac { 1 } { \vert S _ { y } \vert } d \bar { y } } & { { } } \\ { = \displaystyle \int _ { \bar { x } \sim G ( S _ { y } ) } \frac { \vert \nabla _ { \bar { x } } G ^ { - 1 } ( \bar { x } ) \vert } { \vert S _ { y } \vert } d \bar { x } } & { { } } \\ { = \displaystyle \int _ { \bar { x } \sim G ( S _ { y } ) } \frac { \vert \nabla _ { \bar { x } } F ( \bar { x } ) \vert } { \vert S _ { y } \vert } d \bar { x } } & { { } } \end{array} +$$ + +Corollary 2. + +$$ +\frac { 1 } { ( 1 - \epsilon _ { x } ) | S _ { G ( y ) } | } \geq \frac { 1 } { | S _ { y } | } \geq \frac { 1 } { ( 1 + \epsilon _ { x } ) | S _ { G ( y ) } | } +$$ + +Proof of Corollary 2. By Equation 6 and Corollary 1: + +$$ +\begin{array} { r l } & { \displaystyle \int _ { \bar { x } \sim S _ { G ( y ) } } \frac { 1 - \epsilon _ { x } } { | S _ { y } | } d \bar { x } \le \int _ { \bar { x } \sim S _ { G ( y ) } } \frac { 1 } { | S _ { G ( y ) } | } d \bar { x } \le \int _ { \bar { x } \sim S _ { G ( y ) } } \frac { 1 + \epsilon _ { x } } { | S _ { y } | } d \bar { x } } \\ & { \qquad \implies \frac { 1 - \epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | \le 1 \le \frac { 1 + \epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | } \\ & { \qquad \implies ( 1 - \epsilon _ { x } ) | S _ { G ( y ) } | \le | S _ { y } | \le ( 1 + \epsilon _ { x } ) | S _ { G ( y ) } | } \\ & { \qquad \implies \frac { 1 } { ( 1 - \epsilon _ { x } ) | S _ { G ( y ) } | } \ge \frac { 1 } { | S _ { y } | } \ge \frac { 1 } { ( 1 + \epsilon _ { x } ) | S _ { G ( y ) } | } } \end{array} +$$ + +Corollary 1 leads to the following: + +$$ +\begin{array} { r l } & { \mathbb { E } _ { \boldsymbol { x } \in \mathcal { X } } [ \mathbb { E } _ { \bar { \boldsymbol { x } } \in S _ { \boldsymbol { x } } } [ \mathrm { l o g } ( D _ { \overline { { \boldsymbol { x } } } } ( \bar { \boldsymbol { x } } ) ) ] ] + \mathbb { E } _ { \boldsymbol { y } \in \mathcal { Y } } [ \mathbb { E } _ { \bar { \boldsymbol { y } } \in S _ { \boldsymbol { y } } } [ \mathrm { l o g } ( 1 - D _ { \overline { { \mathcal { X } } } } ( G ( \bar { \boldsymbol { y } } ) ) ) ] ] } \\ & { = \displaystyle \sum _ { \boldsymbol { x } \in \mathcal { X } } p _ { \mathcal { X } } ( \boldsymbol { x } ) \int _ { \bar { \boldsymbol { x } } \sim S _ { \boldsymbol { x } } } \frac { 1 } { | S _ { \boldsymbol { x } } | } \log ( D _ { \overline { { \boldsymbol { x } } } } ( \bar { \boldsymbol { x } } ) ) d \bar { x } + \displaystyle \sum _ { \boldsymbol { y } \in \mathcal { Y } } p _ { \mathcal { Y } } ( \boldsymbol { y } ) \int _ { \bar { \boldsymbol { y } } \sim S _ { \boldsymbol { y } } } \frac { 1 } { | S _ { \boldsymbol { y } } | } \log ( 1 - D _ { \overline { { \boldsymbol { x } } } } ( G ( \bar { \boldsymbol { y } } ) ) ) d \bar { y } } \\ & { = \displaystyle \sum _ { \boldsymbol { x } \in \mathcal { X } } p _ { \mathcal { X } } ( \boldsymbol { x } ) \int _ { \bar { \boldsymbol { x } } \sim S _ { \boldsymbol { x } } } \frac { 1 } { | S _ { \boldsymbol { x } } | } \log ( D _ { \overline { { \boldsymbol { x } } } } ( \bar { \boldsymbol { x } } ) ) d \bar { x } + \displaystyle \sum _ { \boldsymbol { y } \in \mathcal { Y } } p _ { \mathcal { Y } } ( \boldsymbol { y } ) \int _ { \bar { \boldsymbol { x } } \sim G ( S _ { \boldsymbol { y } } ) } \frac { | \nabla _ { \bar { x } } F ( \bar { \boldsymbol { x } } ) | } { | S _ { \boldsymbol { y } } | } \log ( 1 - D _ { \overline { { \boldsymbol { x } } } } ( \bar { \boldsymbol { x } } ) ) d \bar { x } } \end{array} +$$ + +Using Lemma 1 and Corollary 2, we obtain the following lower-bound of Equation 7: + +$$ +\begin{array} { l } { { \displaystyle \geq \sum _ { x \in \mathcal { X } } p _ { \mathcal X } ( x ) \int _ { \overline { { x } } \sim S _ { \varepsilon } } \frac { 1 } { | S _ { x } | } \log ( D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) d \bar { x } + \displaystyle \sum _ { y \in \mathcal { Y } } p _ { \mathcal Y } ( y ) \int _ { \overline { { x } } \sim G ( S _ { y } ) } \frac { 1 - \epsilon _ { x } } { | S _ { y } | } \log ( 1 - D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) d \bar { x } } \ ~ } \\ { { \displaystyle \geq \sum _ { x \in \mathcal { X } } p _ { \mathcal X } ( x ) \int _ { \bar { x } \sim S _ { x } } \frac { 1 } { | S _ { x } | } \log ( D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) d \bar { x } } \ ~ } \\ { { \displaystyle \qquad + p _ { \mathcal Y } ( F ( x ) ) \int _ { \bar { x } \sim S _ { G ( F ( x ) ) } } \frac { 1 - \epsilon _ { x } } { ( 1 + \epsilon _ { x } ) | S _ { G ( F ( x ) ) } | } \log ( 1 - D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) d \bar { x } } \ ~ } \\ { { \displaystyle = \sum _ { x \in \mathcal { X } } \int _ { \bar { x } \sim S _ { x } } \frac { 1 } { | S _ { x } | } \left[ p _ { \mathcal X } ( x ) \log ( D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) + \frac { 1 - \epsilon _ { x } } { 1 + \epsilon _ { x } } p _ { G } ( x ) \log ( 1 - D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) \right] d \bar { x } } } \end{array} +$$ + +Which is maximal at: + +$$ +\begin{array} { c } { { D _ { \overline { { { \mathcal { X } } } } } ( \bar { x } \sim S _ { x } ) = \frac { p _ { \mathcal { X } } } { p _ { \mathcal { X } } + \frac { 1 - \epsilon _ { x } } { 1 + \epsilon _ { x } } p _ { G } } \stackrel { \epsilon _ { x } } { \approx } D _ { \mathcal { X } } } } \\ { { \Longrightarrow \mathbb { E } _ { \bar { x } \sim S _ { x } } [ D _ { \overline { { { \mathcal { X } } } } } ( \bar { x } ) ] \stackrel { \epsilon _ { x } } { \approx } D _ { \mathcal { X } } } } \end{array} +$$ + +And similarly, we find Equation 7 is upper-bounded by: + +$$ +\begin{array} { l } { { \displaystyle \leq \sum _ { x \in \mathcal { X } } p _ { \mathcal X } ( x ) \int _ { \overline { { x } } \sim S _ { z } } \frac { 1 } { | S _ { x } | } \log ( D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) d \bar { x } + \displaystyle \sum _ { y \in \mathcal { Y } } p _ { \mathcal Y } ( y ) \int _ { \overline { { x } } \sim G ( S _ { y } ) } \frac { 1 + \epsilon _ { x } } { | S _ { y } | } \log ( 1 - D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) d \bar { x } } } \\ { { \displaystyle \leq \sum _ { x \in \mathcal { X } } p _ { \mathcal X } ( x ) \int _ { \bar { x } \sim S _ { x } } \frac { 1 } { | S _ { x } | } \log ( D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) d \bar { x } } } \\ { { \displaystyle \qquad + p _ { \mathcal Y } ( F ( x ) ) \int _ { \bar { x } \sim S _ { G ( F ( \bar { x } ) ) } } \frac { 1 + \epsilon _ { x } } { ( 1 - \epsilon _ { x } ) | S _ { G ( F ( \bar { x } ) ) } | } \log ( 1 - D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) d \bar { x } } } \\ { { \displaystyle = \sum _ { x \in \mathcal { X } } \int _ { \bar { x } \sim S _ { x } } \frac { 1 } { | S _ { x } | } \left[ p _ { \mathcal X } ( x ) \log ( D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) + \frac { 1 + \epsilon _ { x } } { 1 - \epsilon _ { x } } p _ { G } ( x ) \log ( 1 - D _ { \overline { { \mathcal X } } } ( \bar { x } ) ) \right] d \bar { x } } } \end{array} +$$ + +Which is maximal in $D _ { \overline { { \mathcal { X } } } }$ at: + +$$ +\begin{array} { c } { { D _ { \overline { { { \mathcal { X } } } } } ( \bar { x } \sim S _ { x } ) = \frac { p _ { \mathcal { X } } } { p _ { \mathcal { X } } + \frac { 1 + \epsilon _ { x } } { 1 - \epsilon _ { x } } p _ { G } } \stackrel { \epsilon _ { x } } { \approx } D _ { \mathcal { X } } } } \\ { { \Longrightarrow \mathbb { E } _ { \bar { x } \sim S _ { x } } [ D _ { \overline { { { \mathcal { X } } } } } ( \bar { x } ) ] \stackrel { \epsilon _ { x } } { \approx } D _ { \mathcal { X } } } } \end{array} +$$ + +Hence, asymptotically as $F$ becomes approximately volume-preserving about each discrete $x \in \mathcal { X }$ the bounds maximize to the same loss value in the same class of functions $\mathbb { E } _ { { \bar { x } } \sim S _ { x } } [ D _ { \overline { { \mathcal { X } } } } ( { \bar { x } } ) ] = D _ { \mathcal { X } }$ , application of the squeeze theorem concludes the proof. □ \ No newline at end of file diff --git a/parse/train/BkeqO7x0-/BkeqO7x0-_content_list.json b/parse/train/BkeqO7x0-/BkeqO7x0-_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..568c3a92c8ac4c7fd8753ebde5351ea07fefe2a2 --- /dev/null +++ b/parse/train/BkeqO7x0-/BkeqO7x0-_content_list.json @@ -0,0 +1,2262 @@ +[ + { + "type": "text", + "text": "UNSUPERVISED CIPHER CRACKING USING DISCRETE GANS ", + "text_level": 1, + "bbox": [ + 176, + 99, + 823, + 145 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Aidan N. Gomez 1,2 aidan@cs.toronto.edu ", + "bbox": [ + 186, + 170, + 382, + 198 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Sicong Huang 1,2 huang@cs.toronto.edu ", + "bbox": [ + 616, + 170, + 813, + 199 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Ivan Zhang 2 ivan@ivanzhang.ca ", + "bbox": [ + 184, + 218, + 352, + 248 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Bryan M. Li 1,2 bryan@bryanli.io ", + "bbox": [ + 655, + 218, + 813, + 248 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Muhammad Osama 1,2 muhammad.osama@mcode.ca ", + "bbox": [ + 183, + 268, + 411, + 296 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Łukasz Kaiser 3 lukaszkaiser@google.com ", + "bbox": [ + 586, + 268, + 815, + 297 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Department of Computer Science, University of Toronto \n2 FOR.ai \n3 Google Brain ", + "bbox": [ + 184, + 318, + 565, + 361 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 398, + 544, + 412 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "This work details CipherGAN, an architecture inspired by CycleGAN used for inferring the underlying cipher mapping given banks of unpaired ciphertext and plaintext. We demonstrate that CipherGAN is capable of cracking language data enciphered using shift and Vigenere ciphers to a high degree of fidelity and for \\` vocabularies much larger than previously achieved. We present how CycleGAN can be made compatible with discrete data and train in a stable way. We then prove that the technique used in CipherGAN avoids the common problem of uninformative discrimination associated with GANs applied to discrete data. ", + "bbox": [ + 233, + 431, + 764, + 542 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 573, + 336, + 589 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Humans have been encoding messages for secrecy since before the ancient Greeks, and for the same amount of time, have been fascinated with trying to crack these codes using brute-force, frequency analysis, crib-dragging and even espionage. Simple ciphers have, in the past century, been rendered irrelevant in favor of the more secure encryption schemes enabled by modern computational resources. However, the question of cipher-cracking remains an interesting problem since it requires an intimate understanding of the structure in a language. Nearly all automated cipher cracking techniques have had to rely on a human-in-the-loop; grounding the automated techniques in a human’s preexisting knowledge of language to clean up the errors made by simple algorithms such as frequency analysis. Across a number of domains, the use of hand-crafted features has often been replaced by automatic feature extraction directly from data using end-to-end learning frameworks (Goodfellow et al., 2016). The question to be addressed is as follows: ", + "bbox": [ + 174, + 607, + 825, + 758 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Can a neural network be trained to deduce withheld ciphers from unaligned text, without the supplementation of preexisting human knowledge? ", + "bbox": [ + 196, + 772, + 803, + 800 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The implications for such a general framework would be far-reaching in the field of unsupervised translation, where each language can be treated as an enciphering of the other. The decoding of the Copiale cipher (Knight et al., 2011) stands as an excellent example of the potential for machine learning techniques to decode enciphered texts by treating the problem as language translation. The CycleGAN (Zhu et al., 2017) architecture is extremely general and we demonstrate our adaptation, CipherGAN, is capable of cracking ciphers to an extremely high degree of accuracy. CipherGAN requires little or no modification to be applied to plaintext and ciphertext banks generated by the user’s cipher of choice. ", + "bbox": [ + 174, + 814, + 825, + 897 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In addition to presenting a GAN that can crack ciphers, we contribute the following techniques: ", + "bbox": [ + 173, + 138, + 799, + 154 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• We show how to stabilize CycleGAN training: our CipherGAN achieves good performance in all training runs, compared to approximately $50 \\%$ of runs for the original CycleGAN. \nWe provide a theoretical description and analysis of the uninformative discrimination problem that impacts GANs applied to discrete data. \n• We introduce a solution to the above problem by operating in the embedding space and show that it works in practice. ", + "bbox": [ + 215, + 165, + 825, + 262 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1.1 SHIFT AND VIGENERE \\` CIPHERS ", + "text_level": 1, + "bbox": [ + 176, + 279, + 434, + 292 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The shift and Vigenere ciphers are well known historical substitution ciphers. The earliest known \\` record of a substitution cipher is believed to have dated back to 58 BCE, when Julius Caesar replaced each letter in a message with the letter that was three places further down the alphabet (Singh, 2000). ", + "bbox": [ + 176, + 305, + 826, + 347 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/460d7b3f9d39c9ab0d81dac7303d48440815027d54ce29a9743c7db1f3544a48.jpg", + "image_caption": [ + "Figure 1: An example of a right-shift-3 cipher. " + ], + "image_footnote": [], + "bbox": [ + 215, + 368, + 776, + 396 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Using Figure 1, the message “attackatdawn” can be encrypted to “DWWDFNDWGDZQ”. This message can be easily deciphered by the intended recipient (who is aware of the particular shift number used) but looks meaningless to a third party. The shift cipher ensured secure communication between sender and receiver for centuries, until the ninth century polymath Al-Kindi introduced the concept of frequency analysis (Singh, 2000). He suggested that it would be possible to crack a cipher simply by analyzing the individual characters’ frequencies. For instance, in English the most frequently occurring letters are $\\cdot _ { e } ,$ $( 1 2 . 7 \\% )$ , $\\cdot _ { t } ,$ $( 9 . 1 \\% )$ and $\\cdot _ { a } ,$ $( 8 . 2 \\% )$ ; whereas $\\mathbf { \\dot { q } }$ , $\\cdot _ { x } ,$ and $\\cdot _ { z } ,$ each have frequency of less than $1 \\%$ . Moreover, the code-breaker can also focus on bigrams of repeated letters; ‘ss’, ‘ee’, and ‘oo’ are the most common in English. This structure in language provides an exploit of efficiency to the code-breaker. ", + "bbox": [ + 173, + 430, + 825, + 569 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Polyalphabetic substitution ciphers, including the Vigenere cipher, were introduced to inhibit the \\` use of n-gram frequency analysis in determining the cipher mapping. Instead, the encrypter further scrambles the message by using a separate shift cipher for each element of a key that is tiled to match the length of the plaintext. Increasing the key length greatly increases the number of possible combinations and thus prevents against basic frequency analysis. In the mid nineteenth century, Charles Babbage recognized that the length of the used key could be determined by counting the repetitions and spacing of sequences of letters in the cipher (Singh, 2000). Using the determined length, we can then apply frequency analysis on the index of the cipher base. This method makes it possible to break the Vigenere cipher, but is very time consuming and requires strong knowledge of \\` the language itself. ", + "bbox": [ + 173, + 575, + 825, + 715 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "There is a rich literature of automated shift-cipher cracking techniques (Ramesh et al., 1993; Forsyth & Safavi-Naini, 1993; Hasinoff, 2003; Knight et al., 2006; Verma et al., 2007; Raju et al., 2010; Knight et al., 2011) many of which achieve excellent results which is what one would expect from hand-crafted algorithms targeting specific ciphers and vocabularies. Work on automated cracking of polyalphabetic ciphers (Carroll & Martin, 1986; Toemeh & Arumugam, 2008; Omran et al., 2011) has seen similar success on small vocabularies. It is a difficult matter to compare the results of previous work with our own as their focus ranges from inferring cipher keys (Carroll & Martin, 1986; Ramesh et al., 1993; Omran et al., 2011), to inferring the mappings given limited quantities of ciphertext (determining unicity distance) (Carroll & Martin, 1986; Ramesh et al., 1993; Hasinoff, 2003; Verma et al., 2007), to analyzing the unicity distance required to solve small percentages of the cipher mappings (i.e. $20 \\%$ in Carroll & Martin (1986)). ", + "bbox": [ + 174, + 722, + 825, + 875 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In comparison to these past works, we afford ourselves the advantage of an unconstrained corpus of ciphertext, however, we prescribe ourselves the following constraints: our model is not provided any prior knowledge of vocabulary element frequencies; and, no information about the cipher key is provided. Another complexity our work must overcome is our significantly larger vocabulary sizes; all previous work has addressed vocabularies of approximately 26 characters, while our model is capable of solving word-level ciphers with over 200 distinct vocabulary elements. As such, our methodology is notably ‘hands-off’ in comparison to previous work and can be easily applied to different forms of cipher, different underlying data and unsupervised text alignment tasks. ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 174 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "1.2 GANS AND WASSERSTEIN GANS ", + "text_level": 1, + "bbox": [ + 176, + 191, + 449, + 207 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Generative Adversarial Networks (GANs) are a class of neural network architectures introduced by Goodfellow et al. (2014) as an alternative to optimizing likelihood under a true data distribution. Instead, GANs balance the optimization of a generator network which attempts to produce convincing samples from the data distribution, and a discriminator which is trained to distinguish between samples from the true data distribution and the generator’s synthetic samples. GANs have been shown to produce compelling results in the domain of image generation, but comparatively weak performance in domains using discrete data (discussed in Section 2). ", + "bbox": [ + 173, + 218, + 825, + 318 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The original GAN discriminator objective as introduced in Goodfellow et al. (2014) is: ", + "bbox": [ + 173, + 323, + 743, + 338 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/3dbc6a730250f4938e194737af8ef907841bb0e75ed99b81eafa8df2d928acf9.jpg", + "text": "$$\nD ^ { * } = \\arg \\operatorname* { m a x } _ { D } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ \\log D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ \\log ( 1 - D ( F ( z ) ) ) ]\n$$", + "text_format": "latex", + "bbox": [ + 297, + 347, + 700, + 369 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Where $F$ is the generator network and $D$ is the discriminator network. This loss is vulnerable to the problem of ‘mode collapse’ where the generative distribution collapses to produce a generating distribution with low diversity. In order to more broadly distribute the mass, the Wasserstein GAN (WGAN) objective (Arjovsky et al., 2017) considers the set of K-Lipschitz discriminator functions $D : X \\mathbb { R }$ and minimizes the earth movers (1st Wasserstein) distance. The Lipschitz condition is enforced by clipping discriminators weights to fall within a predefined range. ", + "bbox": [ + 173, + 377, + 825, + 462 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/a3b7c70eb61d13a0cc68ef36a15c7ca5f0d9986572c8c5a616c02cfe068e4694.jpg", + "text": "$$\nD ^ { * } = \\arg \\operatorname* { m a x } _ { \\| D \\| _ { L } \\leq K } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ D ( F ( z ) ) ]\n$$", + "text_format": "latex", + "bbox": [ + 326, + 469, + 669, + 496 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "An improved WGAN objective, introduced by Gulrajani et al. (2017), enforced the Lipschitz condition using a Jacobian regularization term instead of the originally proposed weight-clipping solution. This resulted in more stable training, avoiding capacity under-use and exploding gradients, and improved network performance over weight-clipping. ", + "bbox": [ + 174, + 503, + 825, + 560 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/1d2c540c593398728c59299573ae22d29e887e27f44ee1933a2d1f9da45587c8.jpg", + "text": "$$\n\\begin{array} { r l } & { D ^ { * } = \\arg \\underset { D } { \\operatorname* { m a x } } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ D ( F ( z ) ) ] + } \\\\ & { \\qquad \\quad \\alpha \\cdot \\mathbb { E } _ { \\hat { x } \\sim \\hat { \\mathcal { X } } } [ ( \\| \\nabla _ { \\hat { x } } D ( \\hat { x } ) \\| _ { 2 } - 1 ) ^ { 2 } ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 331, + 566, + 666, + 614 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Here $\\hat { \\mathcal X }$ are samples taken along a line between the true data distribution $\\mathcal { X }$ and the generator’s data distribution $\\mathcal { X } _ { g } \\overset { \\cdot } { = } \\{ F ( z ) | z \\sim \\bar { \\mathcal { Z } } \\}$ . ", + "bbox": [ + 174, + 622, + 826, + 651 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "1.3 CYCLEGAN ", + "text_level": 1, + "bbox": [ + 176, + 670, + 302, + 684 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "CycleGAN (Zhu et al., 2017) is a generative adversarial network designed to learn a mapping between two data distributions without supervision. Three separate works (Zhu et al., 2017; Yi et al., 2017; Liu et al., 2017) share many of the core features we describe below, however, for simplicity we will refer to CycleGAN as the basis for our work as it is the most similar to our model. It acts on distributions $\\mathcal { X }$ and $\\mathcal { V }$ by using two mapping generators: $F : \\mathcal { X } \\mathcal { Y }$ and $G : \\mathcal { V } \\to \\mathcal { X }$ ; and two discriminators: $D _ { \\mathcal { X } } : \\mathcal { X } [ 0 , 1 ]$ and $D y : \\bar { \\mathcal { Y } } \\stackrel { \\textstyle - } { \\to } \\bar { [ 0 , 1 ] }$ . ", + "bbox": [ + 173, + 695, + 825, + 781 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "CycleGAN optimizes the standard GAN loss ${ \\mathcal { L } } _ { \\mathrm { G A N } }$ : ", + "bbox": [ + 174, + 786, + 514, + 801 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/6703707856e60714b7b5b7bc833ed70d7c2f42876dd7792fbae226ab8ae66796.jpg", + "text": "$$\n{ \\mathcal { L } } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\chi , \\mathcal { V } ) = \\mathbb { E } _ { y \\sim \\mathcal { V } } [ \\log D _ { \\mathcal { V } } ( y ) ] + \\mathbb { E } _ { x \\sim \\chi } [ \\log ( 1 - D _ { \\mathcal { V } } ( F ( x ) ) ) ]\n$$", + "text_format": "latex", + "bbox": [ + 259, + 810, + 738, + 829 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "While also considering a reconstruction loss, or ‘cycle’ loss $\\mathcal { L } _ { \\mathrm { c y c } }$ : ", + "bbox": [ + 173, + 835, + 602, + 851 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/64e760da228cd877436dc52d691c7489e8b64312cdba8065d7c2956a3445d164.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) = \\mathbb { E } _ { x \\sim \\mathcal { X } } [ \\| G ( F ( x ) ) - x \\| _ { 1 } ] + \\mathbb { E } _ { y \\sim \\mathcal { Y } } [ \\| F ( G ( y ) ) - y \\| _ { 1 } ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 258, + 858, + 738, + 877 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Taken together the losses are balanced using a hyperparameter $\\lambda$ : ", + "bbox": [ + 176, + 885, + 601, + 900 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/c4e5214b74b7cbe6c0f89e582b95af134571cca124dbb569db521acb59f9fbc5.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { L } ( F , G , D _ { \\mathcal { X } } , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) = \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) + \\lambda \\cdot \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 184, + 907, + 810, + 925 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/812aeb636c0618e5ae1a7118c5a53c0189743ca4f6c24f4f68b67e47a40cac93.jpg", + "image_caption": [ + "Figure 2: Discriminators trained on the toy example of recognizing the bottom-right corner of a simplex as true data. From left to right the discriminators were regularized using: nothing; WGAN Jacobian norm regularization; and, the relaxed sampling technique. " + ], + "image_footnote": [], + "bbox": [ + 320, + 71, + 676, + 174 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "This leads to the training objectives: ", + "bbox": [ + 176, + 243, + 413, + 258 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/3b82a0cdbd40f5c924b15112f28bc09fa13ba44932b7d3208bf802dd60028f30.jpg", + "text": "$$\n\\begin{array} { r l } & { F ^ { * } = \\arg \\underset { F } { \\operatorname* { m i n } } \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) } \\\\ & { G ^ { * } = \\arg \\underset { G } { \\operatorname* { m i n } } \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) } \\\\ & { D _ { \\mathcal { X } } ^ { * } = \\arg \\underset { D _ { \\mathcal { X } } } { \\operatorname* { m a x } } \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) } \\\\ & { D _ { \\mathcal { Y } } ^ { * } = \\arg \\underset { D _ { \\mathcal { Y } } } { \\operatorname* { m a x } } \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 312, + 261, + 684, + 362 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "CycleGAN uses $\\mathcal { L } _ { \\mathrm { c y c } }$ to avoid mode collapse by preserving reconstruction of mapping inputs from outputs. It has demonstrated excellent results in unpaired image translation between two visually similar categories. Our architecture is the first example of this unsupervised learning framework being successfully applied to discrete data such as language. ", + "bbox": [ + 173, + 372, + 826, + 429 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2 DISCRETE GANS ", + "text_level": 1, + "bbox": [ + 176, + 446, + 351, + 463 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Applying GANs to discrete data generation is still an open research problem that has seen great interest and development. The primary difficulty with training discrete data generators in a GAN setting is the lack of a gradient through a discrete node in the computation graph. The alternatives to producing discrete outputs - for instance, generators producing a categorical distribution over discrete elements - are prone to uninformative discrimination (described below), in that, the discriminator may use an optimal discrimination criterion that is unrelated to the correctness of the re-discretized generated data. In our example of a continuous distribution over discrete elements, the produced samples all lie within the standard simplex $\\Delta ^ { k }$ with dimension $k$ equal to the number of elements in the distribution. In this case, samples from the true data distribution always lie on a vertex $\\mathbf { v } _ { i }$ of the simplex, while any sub-optimal generator will produce samples within the simplex’s interior ${ \\Delta ^ { k } \\backslash \\{ \\bf { v } _ { 1 } , . . . , \\bf { v } _ { k } \\} }$ . In this example, a discriminator which performs uninformative discrimination might evaluate a sample’s membership in the vertices of the simplex as an optimal discrimination criterion, which is entirely uninformative of the correctness of re-discretized samples from the generator. ", + "bbox": [ + 174, + 478, + 825, + 674 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "A number of solutions to training generators with discrete outputs have been proposed: SeqGAN (Yu et al., 2017) uses the REINFORCE gradient estimate to train the generator; Boundary-seeking GANs (Hjelm et al., 2017) and maximum-likelihood augmented GANs (Che et al., 2017) proposed a gradient approximation with low bias and variance that resembles the REINFORCE (Williams, 1992) estimator. Gumbel-softmax GANs (Kusner & Hernandez-Lobato, 2016) replace discrete variables in ´ the simplex with continuous relaxations called Concrete (Maddison et al., 2016) or Gumbel-softmax (Jang et al., 2016) variables; WGANs (Arjovsky et al., 2017) were suggested as a remedy to the uninformative discrimination problem by ensuring that the discriminator’s rate of change with respect to its input is bound by some constant. ", + "bbox": [ + 174, + 680, + 825, + 805 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Our work utilizes both the Wasserstein GAN (Gulrajani et al., 2017; Arjovsky et al., 2017) and relaxation of discrete random variables (such as Concrete/Gumbel-softmax). It has been noted multiple times in implementations of CycleGAN as well as in the original paper itself that the architecture was sensitive to initialization and requires repeat attempts in order to converge to a satisfactory mapping (Bansal & Rathore, 2017; Sari, 2017). Our architecture suffered the same instability before the WGAN Jacobian norm regularization term was added to the discriminator’s loss. In addition, we found that having the discriminator operate over embedding space instead of directly over softmax vectors produced by our generator has improved performance. ", + "bbox": [ + 174, + 811, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Our hypothesis, which is justified by Proposition 1 below, is that the embedding vectors may act as continuous relaxations of discrete random variables as small, noisy updates are applied throughout training; Proposition 1 asserts that by replacing discrete random variables with continuous ones, our discriminator is prevented from arbitrarily approximating a Dirac delta distribution. Figure 2 shows simple discriminators trained on the toy task of identify a single vertex of a simplex as true data; it is clear that a lack of regularization leads to the discriminator collapsing to the vertex of the simplex, leaving approximately zero gradient everywhere; while the Jacobian regularization of Wasserstein GANs leads to the space covered by lines leading from the true data vertex to the generated data having a lower rate of change (note that the gradient is still close to zero in the remaining area of the simplex); and finally, replacing the discrete random variables of the true data with continuous samples about the vertex results in a much more gradual transition, which is desirable since it provides a stronger gradient signal from which to learn. ", + "bbox": [ + 174, + 103, + 825, + 270 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Unique to CycleGAN is the auxiliary cycle loss described in Section 1.3. The effect of this additional objective is the generated samples regularly being forced away from the discriminator’s minimum in favor of a mapping that better-satisfies reconstruction. For instance, it may be the case that the discriminator favors a particular cipher mapping that is not bijective; in this case, the model will receive a strong signal from the cycle loss away from the discriminator’s minimum. In these cases where the model moves against the gradient it receives from the discriminator it may be the case that this region has near zero curvature (as is visually discernible from Figure 2); this is because the WGAN curvature regularization (see Equation 3) has not been applied in this region. ", + "bbox": [ + 174, + 276, + 825, + 388 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "‘Curvature’ here refers to the curvature of the discriminator’s output with respect to its input; this curvature determines the strength of the training signal received by the generator. Low curvature means little information for the generator to improve itself with. This motivates the benefits of having strong curvature globally, as opposed to linearly between the generators samples and the true data. Kodali et al. (2017) proposes regularizing in all directions about the generated samples, which would likely remedy the vanishing gradient in our case as well; for our experiments, the relaxed sampling technique proved effective. It should also be noted that Luc et al. (2016) propose something similar to relaxed sampling whereby they replace the ground-truth discrete tokens with a distribution over the vocabulary that distributes some of the mass across the remaining incorrect tokens. ", + "bbox": [ + 174, + 395, + 825, + 534 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Let us now introduce the definitions needed for the formal presentation of Proposition 1. ", + "bbox": [ + 173, + 541, + 751, + 556 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Definitions. ", + "text_level": 1, + "bbox": [ + 174, + 561, + 254, + 575 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "• (Continuous relaxation of a discrete set). A continuous relaxation of a discrete set $\\mathcal { X }$ is a proper, path-connected metric space $\\overline { { \\mathcal { X } } }$ satisfying $\\chi _ { \\mathrm { ~ C ~ } } \\overline { { \\mathcal { X } } }$ . \n• (Rediscretization function). A rediscretization function is an injective function $R : \\overline { { \\mathcal { X } } } \\to \\mathcal { X }$ from a continuous relaxation $\\overline { { \\mathcal { X } } }$ of discrete space $\\mathcal { X }$ satisfying $\\forall x \\in \\mathcal { X } , \\exists \\epsilon > 0$ s.t. $R \\equiv$ $x$ on $B _ { \\epsilon } [ x ]$ . Note that $R$ defines an equivalence relation in $\\overline { { \\mathcal { X } } }$ . \n• (Uninformative Discrimination). A discriminator $D _ { \\mathcal { X } }$ is said to perform uninformative discrimination under rediscretization function $R$ if: $\\exists x \\in { \\mathcal { X } } , { \\bar { x } } \\in { \\overline { { \\mathcal { X } } } }$ s.t. $R ( \\bar { x } ) = x$ ) $\\wedge$ $( D _ { \\mathcal { X } } ( x ) \\not \\approx D _ { \\mathcal { X } } ( \\bar { x } ) )$ . \n• (Continuous relaxation of a function). A continuous relaxation of a function over discrete sets $F : \\mathcal { X } \\mathcal { V }$ is another function $\\overline { { F } } : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { Y } } }$ (where $\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }$ are continuous relaxations of $x , y )$ such that $\\overline { F }$ is continuous and ${ \\overline { { F } } } ( x ) = F ( x ) , \\forall x \\in { \\mathcal { X } }$ . ", + "bbox": [ + 215, + 584, + 825, + 770 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The following proposition (proved in the Appendix) forms the theoretical basis of the technique. ", + "bbox": [ + 169, + 781, + 803, + 797 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Proposition 1 (Reliable Fooling Via Relaxation). ", + "bbox": [ + 176, + 801, + 498, + 815 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Given: ", + "bbox": [ + 178, + 818, + 223, + 829 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "• discrete spaces $\\mathcal { X } , \\mathcal { y }$ and continuous relaxations $\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }$ • generators $F : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { V } } } , G : \\overline { { \\mathcal { V } } } \\overline { { \\mathcal { X } } }$ bijections satisfying $F = G ^ { - 1 }$ • discrete discriminators $D _ { \\mathcal { X } } , D _ { \\mathcal { Y } }$ both optimal for fixed $F , G$ • rediscretization functions $R _ { \\mathcal { X } } , R _ { \\mathcal { Y } }$ ", + "bbox": [ + 215, + 834, + 674, + 925 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Suppose: $F$ is approximately volume preserving in a small region about each $x \\in \\mathcal { X }$ . Consequently the same is true for $G$ about each $y \\in \\mathcal { V }$ . ", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "If: during training, we replace discrete random variables from $\\mathcal { X }$ which lie in the continuous metric space $\\overline { { \\mathcal { X } } }$ with samples from regions about them. ", + "bbox": [ + 178, + 132, + 821, + 159 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Then: the optimal relaxed discriminators $D _ { \\overline { { \\mathcal { X } } } }$ and $D _ { \\overline { { { y } } } }$ have a non-empty region about each $x \\in \\mathcal { X }$ and $y \\in \\mathcal { V }$ where they are expected to assign values close to $D _ { \\mathcal { X } } ( x )$ and $D _ { \\mathcal { Y } } ( y )$ . ", + "bbox": [ + 176, + 160, + 820, + 189 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Figure 3 compares a model trained with embedding vectors versus one with only the softmax outputs. It becomes clear on a harder task, such as Vigenere, that the embeddings vastly outperforms \\` softmax in terms of speed of convergence and final accuracy; however we found that the simpler task of a shift cipher showed little difference between embeddings and softmax, suggesting an increase in task complexity increases the benefits provided by the stronger gradient signal of embeddings. ", + "bbox": [ + 173, + 200, + 825, + 271 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3 METHOD ", + "text_level": 1, + "bbox": [ + 174, + 290, + 282, + 306 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.1 CIPHERGAN ", + "text_level": 1, + "bbox": [ + 174, + 320, + 305, + 337 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "GANs applied to text data have yet to produce truly convincing results (Kawthekar et al.). Previous attempts at discrete sequence generation with GANs have generally utilized a generator outputting a probability distribution over the token space (Gulrajani et al., 2017; Yu et al., 2017; Hjelm et al., 2017). This leads to the discriminator receiving a sequence of discrete random variables from the data distribution, and a sequence of continuous random variables from the generator distribution; making the task of discrimination trivial and uninformative of the underlying data distribution. In order to avoid such a scenario, we perform all discrimination within the embedding space by allowing the generator’s output distribution to define a convex combination of corresponding embeddings. This leads to the following losses: ", + "bbox": [ + 173, + 347, + 826, + 473 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/9bb537560a1679e50af0947b65ca13eecb7bc7c7286a355b76dc9cd558f312bc.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { \\boldsymbol { y } \\sim \\mathcal { V } } [ \\log D _ { \\mathcal { V } } ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad + \\mathbb { E } _ { \\boldsymbol { x } \\sim \\mathcal { X } } [ \\log ( 1 - D _ { \\mathcal { V } } ( \\boldsymbol { F } ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ) ] } \\\\ & { \\qquad \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { \\boldsymbol { x } \\sim \\mathcal { X } } [ \\| G ( F ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) - \\boldsymbol { x } \\| _ { 1 } ] } \\\\ & { \\qquad + \\mathbb { E } _ { \\boldsymbol { y } \\sim \\mathcal { Y } } [ \\| F ( G ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) - \\boldsymbol { y } \\| _ { 1 } ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 245, + 478, + 751, + 561 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We perform an inner product between the embeddings $W _ { E m b }$ and the one-hot vectors in $x$ as well as between the embeddings and the softmax vectors produced by generators $F$ and $G$ . The former is equivalent to a lookup operation over the table of embedding vectors, while the latter is a convex combination between all vectors in the vocabulary. The embeddings $W _ { E m b }$ are trained at each step to minimize $\\mathcal { L } _ { \\mathrm { c y c } }$ and maximize $\\mathcal { L } _ { \\mathrm { G A N } }$ , meaning the embeddings are easily mapped from and are easy to discriminate. As was discussed in Section 2, training with the above loss functions was unstable, with approximately three of every four experiments failing to produce compelling results. This is a problem we observed with the original CycleGAN horse-zebra experiment, and one that has been noted by multiple re-implementations online (Bansal & Rathore, 2017; Sari, 2017). We were able to significantly increase the stability by training the discriminator loss along with the Lipschitz conditioning term from the improved Wasserstein GAN (Gulrajani et al., 2017) (see Equation 3 and Fedus et al. (2017)), resulting in the following loss (DualGAN (Yi et al., 2017) opted to use weight-clipping to enforce the Lipschitz condition): ", + "bbox": [ + 173, + 565, + 826, + 746 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/8323112c9ee5c65285ce3c59c76b8c97dd9dc84a8f713e718f53ee86eb74be17.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { y \\sim \\mathcal { V } } [ D _ { \\mathcal { V } } ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad - \\mathbb { E } _ { \\boldsymbol { x } \\sim \\boldsymbol { x } } [ D _ { \\mathcal { V } } ( F ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad + \\alpha \\cdot \\mathbb { E } _ { \\hat { \\boldsymbol { y } } \\sim \\hat { \\mathcal { V } } } [ ( \\| \\nabla _ { \\hat { \\boldsymbol { y } } } D _ { \\mathcal { V } } ( \\hat { \\boldsymbol { y } } ) \\| _ { 2 } - 1 ) ^ { 2 } ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 287, + 751, + 710, + 815 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "As a consequence of Proposition 1, discriminators trained on non-stationary embeddings will be unable to approximate Dirac delta distributions to arbitrary accuracy; implying there are dedicated ‘safe-zones’ about members of $\\mathcal { X }$ where the generator can reliably fool the discriminator and uninformative discrimination is prevented. ", + "bbox": [ + 174, + 819, + 825, + 875 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In our experiments, we jointly train the embedding vectors as parameters of the model. The gradient updates applied to these vectors introduces noise between training iterations; we observed that embedding vectors tend to remain in a bounded region after the initial steps of training. We found ", + "bbox": [ + 174, + 881, + 823, + 924 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/de591efc73553c8fff57c84a0f03988cc0ea968e7f6f2f2577db83a15d4a7034.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
WorkCiphertext LengthAccuracy
Hasinoff (2003)500~ 97%
Forsyth& Safavi-Naini (1993)5000~ 100%
Ramesh et al. (1993)160~ 78.5%
Verma et al. (2007)1000~ 87%
", + "bbox": [ + 269, + 101, + 728, + 186 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Table 1: Previous results on automated shift cipher cracking with limited ciphertext length. ", + "bbox": [ + 196, + 193, + 795, + 208 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "that simply replacing the data with embedding vectors had a similar effect to performing the random sampling described in Proposition 1 (see Figure 3). ", + "bbox": [ + 173, + 233, + 821, + 261 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 281, + 326, + 297 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 DATA ", + "text_level": 1, + "bbox": [ + 174, + 313, + 253, + 327 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Our experiments use plaintext natural language samples from the Brown English text dataset (Francis $\\&$ Kucera, 1979). We generate $2 *$ batch size plaintext samples, the first half are fed as the CycleGAN’s $\\mathcal { X }$ distribution and the second half is passed through the cipher of choice and fed as the $\\mathcal { V }$ distribution. ", + "bbox": [ + 174, + 339, + 825, + 395 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For our natural language plaintext data we used the Brown English-language corpus which consists of over one million words in 57340 sentences. We experiment with both word-level ”Brown-W” and character-level ”Brown- $\\mathbf { \\vec { C } } ^ { \\mathbf { \\vec { \\mu } } }$ vocabularies. For word-level vocabularies, we control the size of the vocabulary by taking the top $k$ most frequent words and introducing an ‘unknown’ token which we use to replace all words that are not within the taken vocabulary. We demonstrate our method’s ability to scale to large vocabularies using the word-level vocabularies; more modern enciphering techniques rely on large substitution-boxes (S-boxes) with many (often hundreds of) elements. ", + "bbox": [ + 174, + 401, + 825, + 500 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 TRAINING ", + "text_level": 1, + "bbox": [ + 174, + 516, + 287, + 530 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "As in Zhu et al. (2017) we replace the log-likelihood loss with a squared difference loss which was originally introduced by Mao et al. (2016). The original motivation for this replacement was improved stability in training and avoidance of the vanishing gradients problem. In this work we found the effect on training stability substantial. ", + "bbox": [ + 176, + 541, + 823, + 598 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/a8eefb593835118e22f2ebd4ba9d0478fda1bb4697322c3eb04dc4529afed82e.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D y , \\mathcal { X } , \\mathcal { Y } ) = \\mathbb { E } _ { y \\sim \\mathcal { Y } } [ ( D y ( y \\cdot W _ { E m b } ^ { \\top } ) ) ^ { 2 } ] } \\\\ & { \\qquad + \\mathbb { E } _ { x \\sim \\mathcal { X } } [ ( 1 - D _ { \\mathcal { V } } ( F ( x \\cdot W _ { E m b } ^ { \\top } ) \\cdot W _ { E m b } ^ { \\top } ) ) ^ { 2 } ] } \\\\ & { \\qquad + \\alpha \\cdot \\mathbb { E } _ { \\hat { y } \\sim \\hat { \\mathcal { Y } } } [ ( 1 - \\| \\nabla _ { \\hat { y } } D y ( \\hat { y } ) \\| _ { 2 } ) ^ { 2 } ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 269, + 603, + 728, + 667 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Hence, our total loss is: ", + "bbox": [ + 174, + 671, + 330, + 685 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/e3903c3b5ea74aac586cf4959f002575d42318e4645a9e85c6b64c3f0a46eced.jpg", + "text": "$$\n\\begin{array} { r l } { \\mathcal { L } _ { \\mathrm { T o t a l } } ( F , G , D _ { \\mathcal { X } } , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) = \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) } & { } \\\\ { + \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\mathcal { X } , \\mathcal { Y } ) } & { } \\\\ { + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 318, + 689, + 678, + 746 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We adapted the convolutional architecture for the generator and discriminator directly from Zhu et al. (2017). We simply replace all two dimensional convolutions with the one dimension variant and reduce the filter sizes in our generators to 1 (pointwise convolutions). Convolutional neural networks have recently been shown to be highly effective on language tasks and can speed up training significantly (Zhang & LeCun, 2015; Kalchbrenner et al., 2016; Yu et al., 2017). Both our generators and discriminators receive a sequence of vectors in embedding space; our generators produce a softmax distribution over the vocabulary, while our discriminator produces a scalar output. For all our experiments we use a cycle loss with regularization coefficient $\\lambda = 1$ . In order to be compatible with the WGAN we replace batch normalization (Ioffe & Szegedy, 2015) with layer normalization (Ba et al., 2016). We train using the Adam optmizer (Kingma & Ba, 2014) with batch size 64 and learning rate $2 e - 4$ , $\\beta _ { 1 } = 0$ and $\\beta _ { 2 } = 0 . 9$ . Our learning rate is exponentially warmed up to $2 e - 4$ over 2500 steps, and held constant thereafter. We use learned embedding vectors with 256 dimensions. The WGAN Lipschitz conditioning parameter was set to $\\alpha = 1 0$ as was prescribed in Gulrajani et al. (2017). ", + "bbox": [ + 173, + 757, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/a2e5c03b8e76f7f6e10222d4ba2250b1da9bf6d92b825379601540cad2ec3077.jpg", + "image_caption": [ + "Figure 3: Left: Comparison of different timing techniques for Brown-C Vigenere. Right: Compari- \\` son of embedding vs. raw softmax on Brown-W with vocab size of 200. " + ], + "image_footnote": [], + "bbox": [ + 202, + 101, + 789, + 260 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/c8fb91b727f1c5a1c91f7df2b55d6f9f8cf202d2015999460b39e567150e15ad.jpg", + "table_caption": [ + "Table 2: Average proportion of characters correctly mapped in a given sequence. The “Freq. Analysis” column is simple frequency analysis applied to the same corpus our model observes. For Vigenere we also show the score if the key were known (note: the key is left unknown to our \\` model). " + ], + "table_footnote": [], + "table_body": "
Data Vocab sizeBrown-W 10Brown-W 200Brown-C 58Freq. Analysis (With Key) 58200
CipherShift/Permutation
Acc.100%98.7%99.8%80.9%44.5%
CipherVigenere (Key: “345")
Acc.99.7%75.7%99.0%9.6% (78.1%)<0.1% (44.3%)
", + "bbox": [ + 209, + 310, + 787, + 430 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 176, + 523, + 823, + 551 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "For the Vigenere cipher, positional information is critical to the network being able to perform the \\` mapping. In order to facilitate this we experimented with adding the timing signal described in Vaswani et al. (2017) (”Transformer Timing” in Figure 3) and found that performance increased relative to no explicit timing signal; we found that the best option was concatenating a learned positional embedding vector specific to each position onto the sequence (”Concat Timing” in Figure 3), this dramatically improved performance, however this means that the architecture can not generalize to sequences longer than those in the training set. A potential solution to the issue of generalizing to longer sequences would be making a ’soft’ choice at each position for which positional embedding vector to concatenate using a softmax distribution over a set of embedding vectors larger than the expected key length, however, we leave this to future work. ", + "bbox": [ + 174, + 559, + 825, + 696 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 DISCUSSION ", + "text_level": 1, + "bbox": [ + 176, + 720, + 302, + 734 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Table 2 shows that CipherGAN was able to solve shift ciphers to near flawless accuracy, with all three vocabulary sizes being easily decoded by the model. CipherGAN performs extremely well on Vigenere, achieving excellent results on the character-level cipher and strong results on the chal- \\` lenging word-level cipher with a vocabulary size of 200. The vocabulary size of 58 for our character level, containing punctuation and special characters, is more than double what has been previously explored. In comparison to the original CycleGAN architecture, we found CipherGAN to be extremely consistent in training and notably insensitive to the random initialization of weights; we attribute this stability to the Jacobian norm regularization term. ", + "bbox": [ + 174, + 750, + 825, + 861 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "For both ciphers, the first mappings to be correctly determined were those of the most frequently occurring vocabulary elements, suggesting that the network does indeed perform some form of frequency analysis to distinguish outlier frequencies in the two banks of text. Another interesting observation is that of the mistakes made by the network: the network would frequently confuse punctuation marks with one another, perhaps suggesting that these vocabulary elements’ skip-gram signatures were similar enough to lead to the repeated confusion observed across many training runs. ", + "bbox": [ + 174, + 868, + 823, + 922 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 152, + 318, + 169 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "CipherGAN is a compelling demonstration of the potential generative adversarial networks hold to act on discrete data to solve difficult tasks that rely on an extremely sensitive and nuanced discrimination criterion. Our work serves to redouble the promise of the CycleGAN architecture for unsupervised alignment tasks for multiple classes of data. CipherGAN presents an algorithm that is both stable and consistent in training, improving upon past implementations of the CycleGAN architecture. Our work theoretically motivates – and empirically confirms – the use of continuous relaxations of discrete variables, not only to facilitate the flow of gradients through discrete nodes, but also to prevent the oft-observed phenomena of uninformative discrimination. CipherGAN is highly general in its structure and can be directly applied to a variety of unsupervised text alignment tasks, without excess burden of adaptation. On the one hand, CipherGAN is an early step towards the goal of unsupervised translation between languages and has shown excellent performance on the simplified task of cipher map inference. On the other hand, the methods we introduce can be used more broadly in the field of text generation with adversarial networks. ", + "bbox": [ + 174, + 185, + 825, + 364 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "ACKNOWLEDGMENTS ", + "text_level": 1, + "bbox": [ + 176, + 382, + 326, + 395 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Our thanks goes to Roger Grosse and Kelvin Shuangjian Zhang for their advice and support throughout. We also thank Otavio Good and Ian Goodfellow for meaningful early discussions and direction; as well as Michal Wiszniewski for his assistance in developing the code upon which the experiments were run. This work was made possible thanks to the AI Grant, which provided generous support throughout. ", + "bbox": [ + 174, + 405, + 825, + 476 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 176, + 497, + 285, + 512 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Martin Arjovsky, Soumith Chintala, and Leon Bottou. Wasserstein gan. ´ arXiv preprint arXiv:1701.07875, 2017. \nJimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint arXiv:1607.06450, 2016. \nHardik Bansal and Archit Rathore. Understanding and implementing cyclegan in tensorflow. https://hardikbansal.github.io/CycleGANBlog/, 2017. \nJohn M Carroll and Steve Martin. The automated cryptanalysis of substitution ciphers. Cryptologia, 10(4):193–209, 1986. \nTong Che, Yanran Li, Ruixiang Zhang, R Devon Hjelm, Wenjie Li, Yangqiu Song, and Yoshua Bengio. Maximum-likelihood augmented discrete generative adversarial networks. arXiv preprint arXiv:1702.07983, 2017. \nWilliam Fedus, Mihaela Rosca, Balaji Lakshminarayanan, Andrew M. Dai, Shakir Mohamed, and Ian Goodfellow. Many paths to equilibrium: Gans do not need to decrease a divergence at every step, 2017. \nWilliam S Forsyth and Reihaneh Safavi-Naini. Automated cryptanalysis of substitution ciphers. Cryptologia, 17(4):407–418, 1993. \nW Nelson Francis and Henry Kucera. Brown corpus manual. Brown University, 2, 1979. \nIan 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, pp. 2672–2680, 2014. \nIan Goodfellow, Yoshua Bengio, and Aaron Courville. Deep Learning. MIT Press, 2016. http: //www.deeplearningbook.org. ", + "bbox": [ + 166, + 518, + 826, + 926 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Ishaan Gulrajani, Faruk Ahmed, Martin Arjovsky, Vincent Dumoulin, and Aaron Courville. Improved training of wasserstein gans. arXiv preprint arXiv:1704.00028, 2017. ", + "bbox": [ + 171, + 103, + 823, + 133 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Sam Hasinoff. Solving substitution ciphers. Department of Computer Science, University of Toronto, Tech. Rep, 2003. ", + "bbox": [ + 176, + 140, + 821, + 170 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "R Devon Hjelm, Athul Paul Jacob, Tong Che, Kyunghyun Cho, and Yoshua Bengio. Boundaryseeking generative adversarial networks. arXiv preprint arXiv:1702.08431, 2017. ", + "bbox": [ + 174, + 178, + 821, + 208 + ], + "page_idx": 9 + }, + { + "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": [ + 176, + 215, + 823, + 258 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Eric Jang, Shixiang Gu, and Ben Poole. Categorical reparameterization with gumbel-softmax. arXiv preprint arXiv:1611.01144, 2016. ", + "bbox": [ + 173, + 267, + 825, + 296 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Nal Kalchbrenner, Lasse Espeholt, Karen Simonyan, Aaron van den Oord, Alex Graves, and Koray Kavukcuoglu. Neural machine translation in linear time. arXiv preprint arXiv:1610.10099, 2016. ", + "bbox": [ + 173, + 304, + 823, + 334 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Prasad Kawthekar, Raunaq Rewari, and Suvrat Bhooshan. Evaluating generative models for text generation. ", + "bbox": [ + 173, + 342, + 823, + 371 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. CoRR, abs/1412.6980, 2014. URL http://arxiv.org/abs/1412.6980. ", + "bbox": [ + 173, + 380, + 823, + 410 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Kevin Knight, Anish Nair, Nishit Rathod, and Kenji Yamada. Unsupervised analysis for decipherment problems. In Proceedings of the COLING/ACL on Main conference poster sessions, pp. 499–506. Association for Computational Linguistics, 2006. ", + "bbox": [ + 176, + 416, + 823, + 460 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Kevin Knight, Beata Megyesi, and Christiane Schaefer. The copiale cipher. In ´ Proceedings of the 4th Workshop on Building and Using Comparable Corpora: Comparable Corpora and the Web, pp. 2–9. Association for Computational Linguistics, 2011. ", + "bbox": [ + 176, + 468, + 823, + 512 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Naveen Kodali, Jacob Abernethy, James Hays, and Zsolt Kira. How to train your dragan. arXiv preprint arXiv:1705.07215, 2017. ", + "bbox": [ + 174, + 520, + 823, + 549 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Matt J Kusner and Jose Miguel Hern ´ andez-Lobato. Gans for sequences of discrete elements with ´ the gumbel-softmax distribution. arXiv preprint arXiv:1611.04051, 2016. ", + "bbox": [ + 173, + 556, + 821, + 587 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ming-Yu Liu, Thomas Breuel, and Jan Kautz. Unsupervised image-to-image translation networks. arXiv preprint arXiv:1703.00848, 2017. ", + "bbox": [ + 173, + 594, + 820, + 625 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Pauline Luc, Camille Couprie, Soumith Chintala, and Jakob Verbeek. Semantic segmentation using adversarial networks. arXiv preprint arXiv:1611.08408, 2016. ", + "bbox": [ + 173, + 632, + 821, + 662 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Chris J Maddison, Andriy Mnih, and Yee Whye Teh. The concrete distribution: A continuous relaxation of discrete random variables. arXiv preprint arXiv:1611.00712, 2016. ", + "bbox": [ + 171, + 670, + 820, + 699 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Xudong Mao, Qing Li, Haoran Xie, Raymond YK Lau, Zhen Wang, and Stephen Paul Smolley. Least squares generative adversarial networks. arXiv preprint ArXiv:1611.04076, 2016. ", + "bbox": [ + 173, + 707, + 821, + 737 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "SS Omran, AS Al-Khalid, and DM Al-Saady. A cryptanalytic attack on vigenere cipher using \\` genetic algorithm. In Open Systems (ICOS), 2011 IEEE Conference on, pp. 59–64. IEEE, 2011. ", + "bbox": [ + 173, + 744, + 823, + 775 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Bhadri Msvs Raju et al. Decipherment of substitution cipher using enhanced probability distribution. International Journal of Computer Applications, 5(8):34–40, 2010. ", + "bbox": [ + 174, + 781, + 821, + 813 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "RS Ramesh, G Athithan, and K Thiruvengadam. An automated approach to solve simple substitution ciphers. Cryptologia, 17(2):202–218, 1993. ", + "bbox": [ + 174, + 820, + 821, + 849 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Eyyb Sari. tensorflow-cyclegan. https://github.com/Eyyub/tensorflow-cyclegan, 2017. ", + "bbox": [ + 174, + 858, + 821, + 887 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Simon Singh. The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. Anchor, 2000. ", + "bbox": [ + 171, + 895, + 825, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ragheb Toemeh and Subbanagounder Arumugam. Applying genetic algorithms for searching keyspace of polyalphabetic substitution ciphers. International Arab Journal of Information Technology (IAJIT), 5(1), 2008. ", + "bbox": [ + 173, + 103, + 821, + 146 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Lukasz Kaiser, and Illia Polosukhin. Attention is all you need. arXiv preprint arXiv:1706.03762, 2017. ", + "bbox": [ + 174, + 155, + 823, + 196 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "AK Verma, Mayank Dave, and RC Joshi. Genetic algorithm and tabu search attack on the monoalphabetic substitution cipher i adhoc networks. In Journal of Computer science. Citeseer, 2007. ", + "bbox": [ + 169, + 207, + 823, + 234 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning, 8(3-4):229–256, 1992. ", + "bbox": [ + 174, + 244, + 821, + 272 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Zili Yi, Hao Zhang, Ping Tan Gong, et al. Dualgan: Unsupervised dual learning for image-to-image translation. arXiv preprint arXiv:1704.02510, 2017. ", + "bbox": [ + 174, + 281, + 823, + 310 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Lantao Yu, Weinan Zhang, Jun Wang, and Yong Yu. Seqgan: Sequence generative adversarial nets with policy gradient. In AAAI, pp. 2852–2858, 2017. ", + "bbox": [ + 174, + 319, + 821, + 349 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Xiang Zhang and Yann LeCun. Text understanding from scratch. arXiv preprint arXiv:1502.01710, 2015. ", + "bbox": [ + 174, + 357, + 823, + 386 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jun-Yan Zhu, Taesung Park, Phillip Isola, and Alexei A Efros. Unpaired image-to-image translation using cycle-consistent adversarial networks. arXiv preprint arXiv:1703.10593, 2017. ", + "bbox": [ + 173, + 395, + 823, + 424 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "APPENDIX ", + "text_level": 1, + "bbox": [ + 176, + 102, + 264, + 118 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A ARCHITECTURAL DETAILS ", + "bbox": [ + 176, + 132, + 392, + 147 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "For both the generator and discriminator architectures below, we assume the network is provided with a sequence of $N$ tokens denoted data laying in a $K$ -simplex. Therefore data is an $N$ by $K$ matrix. ", + "bbox": [ + 173, + 159, + 825, + 200 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "For simplicity we define the following notation: ", + "bbox": [ + 176, + 207, + 488, + 222 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/b6bc893c516af484a84128e05effada85847aaf55223b6144fd89a27a4fde6f2.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathrm { \\mathrm { ~ 5 o n v L a y e r } } _ { f _ { c , f s = 1 , s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( C o n v 1 D _ { f c , f s } ( x ) ) ) } \\\\ & { \\qquad \\mathrm { R e s B l o c k } _ { f _ { c , f s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( x + C o n v 1 D _ { f c , f s } ( C o n v 1 D _ { f c , f s } ( x ) ) ) ) } \\\\ & { \\mathrm { C o n v S t a c k } _ { n , f c , f s = 1 } ( x ) = } \\\\ & { \\qquad \\mathrm { C o n v L a y e r } _ { 1 , f s } \\circ \\mathrm { C o n v L a y e r } _ { 2 ^ { 1 } \\cdot f c , f s , 2 } \\circ \\cdot \\cdot \\circ \\mathrm { C o n v L a y e r } _ { 2 ^ { n } \\cdot f c , f s , 2 } \\circ \\mathrm { C o n v L a y e r } _ { f c , f s , 2 } ( x ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 187, + 222, + 826, + 300 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A.1 GENERATOR ", + "text_level": 1, + "bbox": [ + 174, + 305, + 305, + 320 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We define the following constants: ", + "bbox": [ + 176, + 330, + 401, + 345 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "• $f c = 3 2$ : The base ’filter count‘, or number of filters in a convolution layer \n• $f s = 1$ : The ’filter size‘, or width of weight kernel used in convolution layers \n• $v s = 1$ : The ’vocab size‘, or number of elements in the vocabulary \n• $s = 1$ : The stride of the convolution layers \n• $E = 1 0 0$ : The dimensionality of the embedding vectors \n• $T = 1 0 0$ : The dimensionality of the concat timing weights ", + "bbox": [ + 214, + 353, + 741, + 458 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "First, we first look up embedding vectors corresponding to the observed tokens. This is performed as a simple inner-product between data and a learning weight matrix of embeddings $W _ { \\mathrm { E m b } } ^ { \\mathbf { \\Upsilon } ^ { \\bullet } } \\in \\mathbb { R } ^ { K \\times E }$ : ", + "bbox": [ + 171, + 467, + 825, + 496 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/d369ee0fbce1dc54c8b04d98bcf6bd49575caa880828c9ae3bb427de8dff0cbb.jpg", + "text": "$$\nx = \\mathrm { d a t a } \\cdot W _ { \\mathrm { E m b } }\n$$", + "text_format": "latex", + "bbox": [ + 436, + 497, + 560, + 512 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Next, a timing signal is added using either: ", + "bbox": [ + 176, + 522, + 455, + 537 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "• The Transformer method: ", + "bbox": [ + 217, + 546, + 401, + 560 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/644862dada9fc682578f83c1c6202052ef4856bcbaf6a2f692a486bee38e1486.jpg", + "text": "$$\n\\begin{array} { c } { { \\mathrm { s i g n a l } _ { n , 2 k } = \\sin ( n / 1 e 5 ^ { 2 k / K } ) } } \\\\ { { \\mathrm { s i g n a l } _ { n , 2 k + 1 } = \\cos ( n / 1 e 5 ^ { 2 k / K } ) } } \\\\ { { \\mathrm { t i m i n g } ( x ) = x + \\mathrm { s i g n a l } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 411, + 560, + 647, + 621 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "• The concat method: ", + "bbox": [ + 215, + 622, + 364, + 636 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/38f70d25f3269ca174bd6c8f5112ff86d4f000e113b0d6975d45f93db42c1b02.jpg", + "text": "$$\n\\begin{array} { r l } & { W _ { \\mathrm { t i m e } } \\in \\mathbb { R } ^ { N \\times T } } \\\\ & { t = \\mathsf { t i m i n g } ( x ) = [ x \\| _ { 2 } W _ { \\mathrm { t i m e } } ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 424, + 635, + 632, + 672 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Where $W _ { \\mathrm { t i m e } }$ are trained parameters and $[ \\cdot | | _ { k } \\cdot ]$ denotes concatenation along the $k ^ { \\mathrm { { t h } } }$ axis. ", + "bbox": [ + 227, + 675, + 799, + 691 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Then the generator is defined as follows: ", + "bbox": [ + 173, + 700, + 442, + 714 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/d9f1c149bd6d109f6424fd432c6f91acb80d79dbfcd3082d705e83aadc86f891.jpg", + "text": "$$\n\\begin{array} { r l } & { \\phantom { \\frac { 1 } { 2 } } a ( x ) = \\mathrm { C o n v L a y e r } _ { 4 \\cdot f c } ( \\mathrm { C o n v L a y e r } _ { 2 \\cdot f c , f s } ( \\mathrm { C o n v L a y e r } _ { f c } ( x ) ) ) } \\\\ & { \\phantom { \\frac { 1 } { 2 } } b ( x ) = \\mathrm { R e s B l o c k } _ { 4 \\cdot f c } ^ { ( 5 ) } ( x ) } \\\\ & { \\circ \\mathrm { u t } ( t ) = \\mathrm { S o f t m a x } ( \\mathrm { C o n v L a y e r } _ { v s } ( b ( a ( t ) ) ) ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 287, + 715, + 709, + 777 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A.2 DISCRIMINATOR ", + "text_level": 1, + "bbox": [ + 174, + 784, + 333, + 799 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We define the following constants: ", + "bbox": [ + 174, + 808, + 401, + 824 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "• $f c = 3 2$ : The base ’filter count‘, or number of filters in a convolution layer • $f s = 1 5$ : The ’filter size‘, or width of weight kernel used in convolution layers • $n = 5$ : The depth of the convolutional stack ", + "bbox": [ + 215, + 832, + 750, + 883 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Similar to the generator, a timing signal is added first. Leading to the following discriminator: ", + "bbox": [ + 171, + 891, + 789, + 907 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/8985869c00ff06fa93f08abfc63569335d94dbe527710cff95326bee8d5af8ee.jpg", + "text": "$$\n\\mathsf { o u t } ( t ) = \\mathbf { C o n v S t a c k } _ { n , f c , f s } ( \\mathsf { d r o p o u t } _ { 0 . 5 } ( t ) )\n$$", + "text_format": "latex", + "bbox": [ + 354, + 909, + 642, + 926 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "B PROOF OF PROPOSITION 1 ", + "bbox": [ + 174, + 103, + 385, + 118 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Proposition 1 (Reliable Fooling Via Relaxation). ", + "bbox": [ + 176, + 128, + 498, + 143 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Given: ", + "bbox": [ + 178, + 145, + 223, + 157 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "• discrete spaces $\\mathcal { X } , \\mathcal { y }$ and continuous relaxations $\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }$ • generators $F : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { V } } } , G : \\overline { { \\mathcal { V } } } \\overline { { \\mathcal { X } } }$ bijections satisfying $F = G ^ { - 1 }$ • discrete discriminators $D _ { \\mathcal { X } } , D _ { \\mathcal { Y } }$ both optimal for fixed $F , G$ • rediscretization functions $R _ { \\mathcal { X } } , R _ { \\mathcal { Y } }$ ", + "bbox": [ + 215, + 160, + 673, + 248 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Suppose: $F$ is approximately volume preserving in a small region about each $x \\in \\mathcal { X }$ . Consequently the same is true for $G$ about each $y \\in \\mathcal { V }$ . \nIf: during training, we replace discrete random variables from $\\mathcal { X }$ which lie in the continuous metric space $\\overline { { \\mathcal { X } } }$ with samples from regions about them. \nThen: the optimal relaxed discriminators $D _ { \\overline { { \\mathcal { X } } } }$ and $D _ { \\overline { { { y } } } }$ have a non-empty region about each $x \\in \\mathcal { X }$ and $y \\in \\mathcal { V }$ where they are expected to assign values close to $D _ { \\mathcal { X } } ( x )$ and $D _ { \\mathcal { Y } } ( y )$ . ", + "bbox": [ + 173, + 257, + 826, + 344 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Proof. We’ll prove one side of the CipherGAN as the proof for both sides are similar. ", + "bbox": [ + 176, + 358, + 735, + 375 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Given bijective function between continuous relaxations of $\\mathcal { X }$ and $\\mathcal { V }$ : $F : ( \\overline { { \\mathcal { X } } } , d _ { \\overline { { \\mathcal { X } } } } ) ( \\overline { { \\mathcal { V } } } , d _ { \\overline { { \\mathcal { V } } } } )$ , where $\\mathcal { X }$ and $\\mathcal { V }$ contain finite sequences (length $n$ ) of vectors laying on the vertices of the simplex $\\Delta ^ { k }$ , and are supports of data distributions $p _ { \\mathscr { X } } , p _ { \\mathscr { Y } }$ respectively. ", + "bbox": [ + 176, + 380, + 826, + 424 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Let: ", + "bbox": [ + 173, + 430, + 202, + 444 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "• $\\overline { { \\mathcal { X } } } = \\overline { { \\mathcal { Y } } } = \\underbrace { \\Delta ^ { k } \\times \\cdots \\times \\Delta ^ { k } } _ { n }$ with $k$ equal to the number of elements in our vocabulary. • the rediscretization function $R _ { { \\mathcal { X } } } : { \\overline { { { \\mathcal { X } } } } } { \\mathcal { X } }$ : $R _ { { \\mathcal K } } ( \\bar { x } ) = \\arg \\operatorname* { m i n } _ { x \\in { \\mathcal K } } d _ { \\overline { { { \\mathcal K } } } } ( \\bar { x } , x )$ ; similarly for $R _ { \\mathcal { Y } }$ . ", + "bbox": [ + 215, + 455, + 820, + 529 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Now, for each $x \\in \\mathcal { X }$ consider the infinite set $S _ { x }$ with cardinality of the continuum constructed according to: ", + "bbox": [ + 171, + 541, + 825, + 570 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Equivalently, ", + "bbox": [ + 173, + 587, + 261, + 602 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/798ecb9854547d76cb84b2ddfef24b6f2b7d91539da30ed7a6abecf3845aaf29.jpg", + "text": "$$\nS _ { x } = R _ { \\chi } ^ { - 1 } ( x ) \\cap F ^ { - 1 } ( R _ { \\ y } ^ { - 1 } ( F ( x ) ) )\n$$", + "text_format": "latex", + "bbox": [ + 380, + 598, + 616, + 618 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Note. $S _ { x }$ is never of cardinality less than the continuum since the following is implied by the definitions of $R _ { \\mathcal { X } }$ , $S _ { x }$ and the fact that $F$ is continuous: $x \\in \\mathcal { X } \\implies x \\in S _ { x } \\wedge \\exists$ closed ball $B _ { \\epsilon } [ x ]$ with radius ", + "bbox": [ + 173, + 622, + 825, + 662 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/173b64083c6fe68ba5bfe354bcd91499af11b4954ead01712d0c1ffe9df95617.jpg", + "text": "$$\n0 < \\epsilon < \\operatorname* { m i n } _ { \\substack { z \\in \\overline { { \\mathcal X } } } } d _ { \\mathcal X } ( x , z )\n$$", + "text_format": "latex", + "bbox": [ + 375, + 662, + 622, + 699 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "So, for each element $x \\in \\mathcal { X }$ there exists a closed set of points in $\\overline { { \\mathcal { X } } }$ which are rediscretized, under $R _ { \\mathcal { X } }$ , to $x$ . Since $S _ { x }$ is a Borel Set we can sample uniformly from it. Therefore, during training suppose we replace each element of $x \\in \\mathcal { X }$ with a sample $\\bar { x } \\sim S _ { x }$ : ", + "bbox": [ + 173, + 713, + 825, + 756 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We begin with the discrete objective: ", + "bbox": [ + 176, + 762, + 416, + 777 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/952e6737c0ea248058e3c37db45cee03f5acc0fae8c07deca454a8d4ad5d16c5.jpg", + "text": "$$\n\\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal { X } } ( x ) \\log ( D _ { \\mathcal { X } } ( x ) ) + p _ { F } ( x ) \\log ( 1 - D _ { \\mathcal { X } } ( x ) )\n$$", + "text_format": "latex", + "bbox": [ + 331, + 781, + 665, + 816 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "As was noted in Goodfellow et al. (2014), this objective is optimized in $D _ { \\mathcal { X } } : \\mathcal { X } [ 0 , 1 ]$ when: ", + "bbox": [ + 168, + 828, + 800, + 844 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/6e5de30ec7d12996f18760572256a0daf483fd32d056422c6668e1af3b05f79c.jpg", + "text": "$$\nD _ { \\mathcal { X } } = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + p _ { G } }\n$$", + "text_format": "latex", + "bbox": [ + 442, + 847, + 555, + 877 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "which is undesirable as $p _ { \\mathcal { X } }$ is a sum of Dirac delta distributions $\\begin{array} { r } { p _ { \\mathcal { X } } ( x ) = \\sum _ { x _ { i } \\in \\mathcal { X } } \\delta _ { x _ { i } } ( x ) } \\end{array}$ and lacks a non-zero gradient to train the generator function with. Instead, let us consider a continuous relaxation $D _ { \\overline { { \\mathcal { X } } } } : \\overline { { \\mathcal { X } } } [ 0 , 1 ]$ of the discriminator $D _ { \\mathcal { X } }$ and observe where it optimizes. ", + "bbox": [ + 174, + 881, + 823, + 924 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Suppose $\\forall x \\in \\mathcal { X } , \\exists \\epsilon _ { x } \\geq 0 , \\forall \\bar { x } \\in S _ { x }$ ", + "bbox": [ + 174, + 103, + 413, + 119 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/bb23f4fbcfc0e384ec2cc0557d5e7fa5ace2ac615265174c1b4e6a194c3ec54f.jpg", + "text": "$$\n\\left( 1 - \\epsilon _ { x } \\right) \\leq \\left| \\nabla _ { \\bar { x } } F ( \\bar { x } ) \\right| \\leq \\left( 1 + \\epsilon _ { x } \\right)\n$$", + "text_format": "latex", + "bbox": [ + 387, + 125, + 611, + 143 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "That is, suppose $F$ is approximately volume preserving within a small region about each $x \\in \\mathcal { X }$ . ", + "bbox": [ + 171, + 148, + 803, + 165 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lemma 1. $\\forall y \\in \\mathcal { Y } , G ( S _ { y } ) = S _ { G ( y ) }$ ", + "bbox": [ + 173, + 170, + 415, + 186 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proof of Lemma $^ { l }$ . For all $y \\in \\mathcal { V }$ with $G ( y ) = x \\Leftrightarrow y = F ( x )$ : ", + "bbox": [ + 176, + 191, + 591, + 208 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/df02c46fa988a1f20958c811c9122b0b44a76ac90e7446c907d076536677a682.jpg", + "text": "$$\n\\begin{array} { r l } & { G ( S _ { y } ) = G [ R _ { y } ^ { - 1 } ( y ) \\cap G ^ { - 1 } ( R _ { \\chi } ^ { - 1 } ( G ( y ) ) ) ] } \\\\ & { \\qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \\cap G ( G ^ { - 1 } ( R _ { \\chi } ^ { - 1 } ( G ( y ) ) ) ) } \\\\ & { \\qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \\cap R _ { \\chi } ^ { - 1 } ( G ( y ) ) } \\\\ & { \\qquad = F ^ { - 1 } ( R _ { y } ^ { - 1 } ( F ( x ) ) ) \\cap R _ { \\chi } ^ { - 1 } ( x ) } \\\\ & { \\qquad = S _ { x } = S _ { G ( y ) } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 343, + 212, + 653, + 316 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Corollary 1. ", + "bbox": [ + 173, + 342, + 259, + 357 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/2102091569a0158170b92e653242a6c676025798ff9f08f5d0e361b209201693.jpg", + "text": "$$\n\\int _ { { \\bar { x } } \\sim S _ { G ( y ) } } { \\frac { 1 } { \\left| S _ { G ( y ) } \\right| } } d { \\bar { x } } = \\int _ { { \\bar { x } } \\sim G ( S _ { y } ) } { \\frac { \\left| \\nabla _ { \\bar { x } } F ( { \\bar { x } } ) \\right| } { \\left| S _ { y } \\right| } } d { \\bar { x } }\n$$", + "text_format": "latex", + "bbox": [ + 343, + 357, + 653, + 391 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proof of Corollary 1. ", + "bbox": [ + 174, + 395, + 313, + 410 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/2fff165673065660f5376ded2ebdf984a1d36da8b004d39bf1516f469738e666.jpg", + "text": "$$\n\\begin{array} { r l } { \\displaystyle \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 } { \\vert S _ { G ( y ) } \\vert } d \\bar { x } = 1 = \\int _ { \\bar { y } \\sim S _ { y } } \\frac { 1 } { \\vert S _ { y } \\vert } d \\bar { y } } & { { } } \\\\ { = \\displaystyle \\int _ { \\bar { x } \\sim G ( S _ { y } ) } \\frac { \\vert \\nabla _ { \\bar { x } } G ^ { - 1 } ( \\bar { x } ) \\vert } { \\vert S _ { y } \\vert } d \\bar { x } } & { { } } \\\\ { = \\displaystyle \\int _ { \\bar { x } \\sim G ( S _ { y } ) } \\frac { \\vert \\nabla _ { \\bar { x } } F ( \\bar { x } ) \\vert } { \\vert S _ { y } \\vert } d \\bar { x } } & { { } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 318, + 416, + 678, + 529 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Corollary 2. ", + "bbox": [ + 173, + 555, + 259, + 570 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/6d7a9bdec88fee1d37f30a1c421a10899bfe3101e991f58826d278266ca7f219.jpg", + "text": "$$\n\\frac { 1 } { ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | } \\geq \\frac { 1 } { | S _ { y } | } \\geq \\frac { 1 } { ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | }\n$$", + "text_format": "latex", + "bbox": [ + 354, + 566, + 643, + 602 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proof of Corollary 2. By Equation 6 and Corollary 1: ", + "bbox": [ + 173, + 604, + 527, + 621 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/f3836292e77ab0dd915a5a602f2af10c5bd8b3196ab1c60988388f7d0a089af5.jpg", + "text": "$$\n\\begin{array} { r l } & { \\displaystyle \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } d \\bar { x } \\le \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 } { | S _ { G ( y ) } | } d \\bar { x } \\le \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } d \\bar { x } } \\\\ & { \\qquad \\implies \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | \\le 1 \\le \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | } \\\\ & { \\qquad \\implies ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | \\le | S _ { y } | \\le ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | } \\\\ & { \\qquad \\implies \\frac { 1 } { ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | } \\ge \\frac { 1 } { | S _ { y } | } \\ge \\frac { 1 } { ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 279, + 626, + 715, + 753 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Corollary 1 leads to the following: ", + "bbox": [ + 173, + 785, + 400, + 801 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/6064f14506d47aafe2797111864a6353330a472891418373db4e854a15d8c21d.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { E } _ { \\boldsymbol { x } \\in \\mathcal { X } } [ \\mathbb { E } _ { \\bar { \\boldsymbol { x } } \\in S _ { \\boldsymbol { x } } } [ \\mathrm { l o g } ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) ] ] + \\mathbb { E } _ { \\boldsymbol { y } \\in \\mathcal { Y } } [ \\mathbb { E } _ { \\bar { \\boldsymbol { y } } \\in S _ { \\boldsymbol { y } } } [ \\mathrm { l o g } ( 1 - D _ { \\overline { { \\mathcal { X } } } } ( G ( \\bar { \\boldsymbol { y } } ) ) ) ] ] } \\\\ & { = \\displaystyle \\sum _ { \\boldsymbol { x } \\in \\mathcal { X } } p _ { \\mathcal { X } } ( \\boldsymbol { x } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim S _ { \\boldsymbol { x } } } \\frac { 1 } { | S _ { \\boldsymbol { x } } | } \\log ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } + \\displaystyle \\sum _ { \\boldsymbol { y } \\in \\mathcal { Y } } p _ { \\mathcal { Y } } ( \\boldsymbol { y } ) \\int _ { \\bar { \\boldsymbol { y } } \\sim S _ { \\boldsymbol { y } } } \\frac { 1 } { | S _ { \\boldsymbol { y } } | } \\log ( 1 - D _ { \\overline { { \\boldsymbol { x } } } } ( G ( \\bar { \\boldsymbol { y } } ) ) ) d \\bar { y } } \\\\ & { = \\displaystyle \\sum _ { \\boldsymbol { x } \\in \\mathcal { X } } p _ { \\mathcal { X } } ( \\boldsymbol { x } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim S _ { \\boldsymbol { x } } } \\frac { 1 } { | S _ { \\boldsymbol { x } } | } \\log ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } + \\displaystyle \\sum _ { \\boldsymbol { y } \\in \\mathcal { Y } } p _ { \\mathcal { Y } } ( \\boldsymbol { y } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim G ( S _ { \\boldsymbol { y } } ) } \\frac { | \\nabla _ { \\bar { x } } F ( \\bar { \\boldsymbol { x } } ) | } { | S _ { \\boldsymbol { y } } | } \\log ( 1 - D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 183, + 805, + 812, + 910 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Using Lemma 1 and Corollary 2, we obtain the following lower-bound of Equation 7: ", + "bbox": [ + 173, + 102, + 735, + 119 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/c78ddc885c86b2aca066a3eb0c1e38a7aa1007a7a65138edbd14d921dc0bf613.jpg", + "text": "$$\n\\begin{array} { l } { { \\displaystyle \\geq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\overline { { x } } \\sim S _ { \\varepsilon } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } + \\displaystyle \\sum _ { y \\in \\mathcal { Y } } p _ { \\mathcal Y } ( y ) \\int _ { \\overline { { x } } \\sim G ( S _ { y } ) } \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle \\geq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle \\qquad + p _ { \\mathcal Y } ( F ( x ) ) \\int _ { \\bar { x } \\sim S _ { G ( F ( x ) ) } } \\frac { 1 - \\epsilon _ { x } } { ( 1 + \\epsilon _ { x } ) | S _ { G ( F ( x ) ) } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle = \\sum _ { x \\in \\mathcal { X } } \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\left[ p _ { \\mathcal X } ( x ) \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) + \\frac { 1 - \\epsilon _ { x } } { 1 + \\epsilon _ { x } } p _ { G } ( x ) \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) \\right] d \\bar { x } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 192, + 123, + 805, + 284 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Which is maximal at: ", + "bbox": [ + 174, + 305, + 316, + 319 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/1ae1705cf7d3c04b76590d4347b18cdd522e1eef3cd64b8065ad1823163ee9b4.jpg", + "text": "$$\n\\begin{array} { c } { { D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } \\sim S _ { x } ) = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + \\frac { 1 - \\epsilon _ { x } } { 1 + \\epsilon _ { x } } p _ { G } } \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\\\ { { \\Longrightarrow \\mathbb { E } _ { \\bar { x } \\sim S _ { x } } [ D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } ) ] \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 370, + 323, + 627, + 382 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "And similarly, we find Equation 7 is upper-bounded by: ", + "bbox": [ + 173, + 385, + 540, + 401 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/d213134d4845d993a39ab315d2c6fb9a7f32685cdc23dbe5da7c296264d7f425.jpg", + "text": "$$\n\\begin{array} { l } { { \\displaystyle \\leq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\overline { { x } } \\sim S _ { z } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } + \\displaystyle \\sum _ { y \\in \\mathcal { Y } } p _ { \\mathcal Y } ( y ) \\int _ { \\overline { { x } } \\sim G ( S _ { y } ) } \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle \\leq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle \\qquad + p _ { \\mathcal Y } ( F ( x ) ) \\int _ { \\bar { x } \\sim S _ { G ( F ( \\bar { x } ) ) } } \\frac { 1 + \\epsilon _ { x } } { ( 1 - \\epsilon _ { x } ) | S _ { G ( F ( \\bar { x } ) ) } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle = \\sum _ { x \\in \\mathcal { X } } \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\left[ p _ { \\mathcal X } ( x ) \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) + \\frac { 1 + \\epsilon _ { x } } { 1 - \\epsilon _ { x } } p _ { G } ( x ) \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) \\right] d \\bar { x } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 192, + 406, + 803, + 564 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Which is maximal in $D _ { \\overline { { \\mathcal { X } } } }$ at: ", + "bbox": [ + 174, + 587, + 362, + 602 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/75fa2714e726836ced313e42b55d7f4dd0c0d7b93c3dfa3da6ab50806c788a35.jpg", + "text": "$$\n\\begin{array} { c } { { D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } \\sim S _ { x } ) = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + \\frac { 1 + \\epsilon _ { x } } { 1 - \\epsilon _ { x } } p _ { G } } \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\\\ { { \\Longrightarrow \\mathbb { E } _ { \\bar { x } \\sim S _ { x } } [ D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } ) ] \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 370, + 608, + 627, + 667 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Hence, asymptotically as $F$ becomes approximately volume-preserving about each discrete $x \\in \\mathcal { X }$ the bounds maximize to the same loss value in the same class of functions $\\mathbb { E } _ { { \\bar { x } } \\sim S _ { x } } [ D _ { \\overline { { \\mathcal { X } } } } ( { \\bar { x } } ) ] = D _ { \\mathcal { X } }$ , application of the squeeze theorem concludes the proof. □ ", + "bbox": [ + 174, + 671, + 826, + 714 + ], + "page_idx": 14 + } +] \ No newline at end of file diff --git a/parse/train/BkeqO7x0-/BkeqO7x0-_middle.json b/parse/train/BkeqO7x0-/BkeqO7x0-_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..5e865dd6c1c7e78b72b32615f03fdf0cd6a671a4 --- /dev/null +++ b/parse/train/BkeqO7x0-/BkeqO7x0-_middle.json @@ -0,0 +1,40351 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 79, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 506, + 99 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 506, + 99 + ], + "score": 1.0, + "content": "UNSUPERVISED CIPHER CRACKING USING DISCRETE", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 96, + 159, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 96, + 159, + 118 + ], + "score": 1.0, + "content": "GANS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 114, + 135, + 234, + 157 + ], + "lines": [ + { + "bbox": [ + 114, + 135, + 201, + 146 + ], + "spans": [ + { + "bbox": [ + 114, + 135, + 201, + 146 + ], + "score": 1.0, + "content": "Aidan N. Gomez 1,2", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 147, + 234, + 158 + ], + "spans": [ + { + "bbox": [ + 112, + 147, + 234, + 158 + ], + "score": 1.0, + "content": "aidan@cs.toronto.edu", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 377, + 135, + 498, + 158 + ], + "lines": [ + { + "bbox": [ + 375, + 134, + 453, + 148 + ], + "spans": [ + { + "bbox": [ + 375, + 134, + 453, + 148 + ], + "score": 1.0, + "content": "Sicong Huang 1,2", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 377, + 146, + 498, + 158 + ], + "spans": [ + { + "bbox": [ + 377, + 146, + 498, + 158 + ], + "score": 1.0, + "content": "huang@cs.toronto.edu", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.0 + }, + { + "type": "text", + "bbox": [ + 113, + 173, + 216, + 197 + ], + "lines": [ + { + "bbox": [ + 110, + 173, + 172, + 187 + ], + "spans": [ + { + "bbox": [ + 110, + 173, + 172, + 187 + ], + "score": 1.0, + "content": "Ivan Zhang 2", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 113, + 186, + 217, + 197 + ], + "spans": [ + { + "bbox": [ + 113, + 186, + 217, + 197 + ], + "score": 1.0, + "content": "ivan@ivanzhang.ca", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.0 + }, + { + "type": "text", + "bbox": [ + 401, + 173, + 498, + 197 + ], + "lines": [ + { + "bbox": [ + 400, + 172, + 470, + 187 + ], + "spans": [ + { + "bbox": [ + 400, + 172, + 470, + 187 + ], + "score": 1.0, + "content": "Bryan M. Li 1,2", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 401, + 186, + 498, + 198 + ], + "spans": [ + { + "bbox": [ + 401, + 186, + 498, + 198 + ], + "score": 1.0, + "content": "bryan@bryanli.io", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.0 + }, + { + "type": "text", + "bbox": [ + 112, + 213, + 252, + 235 + ], + "lines": [ + { + "bbox": [ + 111, + 213, + 214, + 224 + ], + "spans": [ + { + "bbox": [ + 111, + 213, + 214, + 224 + ], + "score": 1.0, + "content": "Muhammad Osama 1,2", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 112, + 225, + 252, + 236 + ], + "spans": [ + { + "bbox": [ + 112, + 225, + 252, + 236 + ], + "score": 1.0, + "content": "muhammad.osama@mcode.ca", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.0 + }, + { + "type": "text", + "bbox": [ + 359, + 213, + 499, + 236 + ], + "lines": [ + { + "bbox": [ + 357, + 213, + 429, + 225 + ], + "spans": [ + { + "bbox": [ + 357, + 213, + 429, + 225 + ], + "score": 1.0, + "content": "Łukasz Kaiser 3", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 358, + 224, + 499, + 237 + ], + "spans": [ + { + "bbox": [ + 358, + 224, + 499, + 237 + ], + "score": 1.0, + "content": "lukaszkaiser@google.com", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.0 + }, + { + "type": "text", + "bbox": [ + 113, + 252, + 346, + 286 + ], + "lines": [ + { + "bbox": [ + 110, + 250, + 348, + 267 + ], + "spans": [ + { + "bbox": [ + 110, + 250, + 348, + 267 + ], + "score": 1.0, + "content": "1 Department of Computer Science, University of Toronto", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 110, + 262, + 152, + 275 + ], + "spans": [ + { + "bbox": [ + 110, + 262, + 152, + 275 + ], + "score": 1.0, + "content": "2 FOR.ai", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 109, + 271, + 177, + 290 + ], + "spans": [ + { + "bbox": [ + 109, + 271, + 177, + 290 + ], + "score": 1.0, + "content": "3 Google Brain", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "title", + "bbox": [ + 278, + 316, + 333, + 327 + ], + "lines": [ + { + "bbox": [ + 277, + 315, + 335, + 329 + ], + "spans": [ + { + "bbox": [ + 277, + 315, + 335, + 329 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 143, + 342, + 468, + 430 + ], + "lines": [ + { + "bbox": [ + 142, + 342, + 469, + 354 + ], + "spans": [ + { + "bbox": [ + 142, + 342, + 469, + 354 + ], + "score": 1.0, + "content": "This work details CipherGAN, an architecture inspired by CycleGAN used for", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 353, + 470, + 366 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 470, + 366 + ], + "score": 1.0, + "content": "inferring the underlying cipher mapping given banks of unpaired ciphertext and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 365, + 470, + 376 + ], + "spans": [ + { + "bbox": [ + 141, + 365, + 470, + 376 + ], + "score": 1.0, + "content": "plaintext. We demonstrate that CipherGAN is capable of cracking language data", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 375, + 470, + 388 + ], + "spans": [ + { + "bbox": [ + 141, + 375, + 470, + 388 + ], + "score": 1.0, + "content": "enciphered using shift and Vigenere ciphers to a high degree of fidelity and for `", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 386, + 470, + 399 + ], + "spans": [ + { + "bbox": [ + 141, + 386, + 470, + 399 + ], + "score": 1.0, + "content": "vocabularies much larger than previously achieved. We present how CycleGAN", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 397, + 470, + 409 + ], + "spans": [ + { + "bbox": [ + 141, + 397, + 470, + 409 + ], + "score": 1.0, + "content": "can be made compatible with discrete data and train in a stable way. We then", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 407, + 470, + 420 + ], + "spans": [ + { + "bbox": [ + 141, + 407, + 470, + 420 + ], + "score": 1.0, + "content": "prove that the technique used in CipherGAN avoids the common problem of un-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 418, + 439, + 431 + ], + "spans": [ + { + "bbox": [ + 141, + 418, + 439, + 431 + ], + "score": 1.0, + "content": "informative discrimination associated with GANs applied to discrete data.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 21.5 + }, + { + "type": "title", + "bbox": [ + 108, + 454, + 206, + 467 + ], + "lines": [ + { + "bbox": [ + 105, + 453, + 208, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 208, + 470 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 481, + 505, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "Humans have been encoding messages for secrecy since before the ancient Greeks, and for the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 492, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 504 + ], + "score": 1.0, + "content": "same amount of time, have been fascinated with trying to crack these codes using brute-force, fre-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "score": 1.0, + "content": "quency analysis, crib-dragging and even espionage. Simple ciphers have, in the past century, been", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 513, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 505, + 526 + ], + "score": 1.0, + "content": "rendered irrelevant in favor of the more secure encryption schemes enabled by modern computa-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 525, + 506, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 537 + ], + "score": 1.0, + "content": "tional resources. However, the question of cipher-cracking remains an interesting problem since it", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 536, + 505, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 548 + ], + "score": 1.0, + "content": "requires an intimate understanding of the structure in a language. Nearly all automated cipher crack-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 546, + 506, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 506, + 559 + ], + "score": 1.0, + "content": "ing techniques have had to rely on a human-in-the-loop; grounding the automated techniques in a", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "human’s preexisting knowledge of language to clean up the errors made by simple algorithms such", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 569, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 505, + 581 + ], + "score": 1.0, + "content": "as frequency analysis. Across a number of domains, the use of hand-crafted features has often been", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 579, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 592 + ], + "score": 1.0, + "content": "replaced by automatic feature extraction directly from data using end-to-end learning frameworks", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 591, + 385, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 385, + 602 + ], + "score": 1.0, + "content": "(Goodfellow et al., 2016). The question to be addressed is as follows:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 120, + 612, + 492, + 634 + ], + "lines": [ + { + "bbox": [ + 120, + 612, + 491, + 624 + ], + "spans": [ + { + "bbox": [ + 120, + 612, + 491, + 624 + ], + "score": 1.0, + "content": "Can a neural network be trained to deduce withheld ciphers from unaligned text, without the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 203, + 623, + 408, + 636 + ], + "spans": [ + { + "bbox": [ + 203, + 623, + 408, + 636 + ], + "score": 1.0, + "content": "supplementation of preexisting human knowledge?", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 107, + 645, + 505, + 711 + ], + "lines": [ + { + "bbox": [ + 106, + 645, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 505, + 656 + ], + "score": 1.0, + "content": "The implications for such a general framework would be far-reaching in the field of unsupervised", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "score": 1.0, + "content": "translation, where each language can be treated as an enciphering of the other. The decoding of", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 666, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 679 + ], + "score": 1.0, + "content": "the Copiale cipher (Knight et al., 2011) stands as an excellent example of the potential for machine", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "learning techniques to decode enciphered texts by treating the problem as language translation. The", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 688, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 701 + ], + "score": 1.0, + "content": "CycleGAN (Zhu et al., 2017) architecture is extremely general and we demonstrate our adaptation,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "CipherGAN, is capable of cracking ciphers to an extremely high degree of accuracy. CipherGAN", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 123, + 722, + 336, + 731 + ], + "lines": [ + { + "bbox": [ + 122, + 720, + 337, + 733 + ], + "spans": [ + { + "bbox": [ + 122, + 720, + 337, + 733 + ], + "score": 1.0, + "content": "Code available at: github.com/for-ai/ciphergan", + "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 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": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 79, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 506, + 99 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 506, + 99 + ], + "score": 1.0, + "content": "UNSUPERVISED CIPHER CRACKING USING DISCRETE", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 96, + 159, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 96, + 159, + 118 + ], + "score": 1.0, + "content": "GANS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 114, + 135, + 234, + 157 + ], + "lines": [ + { + "bbox": [ + 114, + 135, + 201, + 146 + ], + "spans": [ + { + "bbox": [ + 114, + 135, + 201, + 146 + ], + "score": 1.0, + "content": "Aidan N. Gomez 1,2", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 147, + 234, + 158 + ], + "spans": [ + { + "bbox": [ + 112, + 147, + 234, + 158 + ], + "score": 1.0, + "content": "aidan@cs.toronto.edu", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.0, + "bbox_fs": [ + 112, + 135, + 234, + 158 + ] + }, + { + "type": "text", + "bbox": [ + 377, + 135, + 498, + 158 + ], + "lines": [ + { + "bbox": [ + 375, + 134, + 453, + 148 + ], + "spans": [ + { + "bbox": [ + 375, + 134, + 453, + 148 + ], + "score": 1.0, + "content": "Sicong Huang 1,2", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 377, + 146, + 498, + 158 + ], + "spans": [ + { + "bbox": [ + 377, + 146, + 498, + 158 + ], + "score": 1.0, + "content": "huang@cs.toronto.edu", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.0, + "bbox_fs": [ + 375, + 134, + 498, + 158 + ] + }, + { + "type": "text", + "bbox": [ + 113, + 173, + 216, + 197 + ], + "lines": [ + { + "bbox": [ + 110, + 173, + 172, + 187 + ], + "spans": [ + { + "bbox": [ + 110, + 173, + 172, + 187 + ], + "score": 1.0, + "content": "Ivan Zhang 2", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 113, + 186, + 217, + 197 + ], + "spans": [ + { + "bbox": [ + 113, + 186, + 217, + 197 + ], + "score": 1.0, + "content": "ivan@ivanzhang.ca", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.0, + "bbox_fs": [ + 110, + 173, + 217, + 197 + ] + }, + { + "type": "text", + "bbox": [ + 401, + 173, + 498, + 197 + ], + "lines": [ + { + "bbox": [ + 400, + 172, + 470, + 187 + ], + "spans": [ + { + "bbox": [ + 400, + 172, + 470, + 187 + ], + "score": 1.0, + "content": "Bryan M. Li 1,2", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 401, + 186, + 498, + 198 + ], + "spans": [ + { + "bbox": [ + 401, + 186, + 498, + 198 + ], + "score": 1.0, + "content": "bryan@bryanli.io", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.0, + "bbox_fs": [ + 400, + 172, + 498, + 198 + ] + }, + { + "type": "text", + "bbox": [ + 112, + 213, + 252, + 235 + ], + "lines": [ + { + "bbox": [ + 111, + 213, + 214, + 224 + ], + "spans": [ + { + "bbox": [ + 111, + 213, + 214, + 224 + ], + "score": 1.0, + "content": "Muhammad Osama 1,2", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 112, + 225, + 252, + 236 + ], + "spans": [ + { + "bbox": [ + 112, + 225, + 252, + 236 + ], + "score": 1.0, + "content": "muhammad.osama@mcode.ca", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.0, + "bbox_fs": [ + 111, + 213, + 252, + 236 + ] + }, + { + "type": "text", + "bbox": [ + 359, + 213, + 499, + 236 + ], + "lines": [ + { + "bbox": [ + 357, + 213, + 429, + 225 + ], + "spans": [ + { + "bbox": [ + 357, + 213, + 429, + 225 + ], + "score": 1.0, + "content": "Łukasz Kaiser 3", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 358, + 224, + 499, + 237 + ], + "spans": [ + { + "bbox": [ + 358, + 224, + 499, + 237 + ], + "score": 1.0, + "content": "lukaszkaiser@google.com", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.0, + "bbox_fs": [ + 357, + 213, + 499, + 237 + ] + }, + { + "type": "index", + "bbox": [ + 113, + 252, + 346, + 286 + ], + "lines": [ + { + "bbox": [ + 110, + 250, + 348, + 267 + ], + "spans": [ + { + "bbox": [ + 110, + 250, + 348, + 267 + ], + "score": 1.0, + "content": "1 Department of Computer Science, University of Toronto", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 262, + 152, + 275 + ], + "spans": [ + { + "bbox": [ + 110, + 262, + 152, + 275 + ], + "score": 1.0, + "content": "2 FOR.ai", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 271, + 177, + 290 + ], + "spans": [ + { + "bbox": [ + 109, + 271, + 177, + 290 + ], + "score": 1.0, + "content": "3 Google Brain", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + } + ], + "index": 15, + "bbox_fs": [ + 109, + 250, + 348, + 290 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 316, + 333, + 327 + ], + "lines": [ + { + "bbox": [ + 277, + 315, + 335, + 329 + ], + "spans": [ + { + "bbox": [ + 277, + 315, + 335, + 329 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 143, + 342, + 468, + 430 + ], + "lines": [ + { + "bbox": [ + 142, + 342, + 469, + 354 + ], + "spans": [ + { + "bbox": [ + 142, + 342, + 469, + 354 + ], + "score": 1.0, + "content": "This work details CipherGAN, an architecture inspired by CycleGAN used for", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 353, + 470, + 366 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 470, + 366 + ], + "score": 1.0, + "content": "inferring the underlying cipher mapping given banks of unpaired ciphertext and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 365, + 470, + 376 + ], + "spans": [ + { + "bbox": [ + 141, + 365, + 470, + 376 + ], + "score": 1.0, + "content": "plaintext. We demonstrate that CipherGAN is capable of cracking language data", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 375, + 470, + 388 + ], + "spans": [ + { + "bbox": [ + 141, + 375, + 470, + 388 + ], + "score": 1.0, + "content": "enciphered using shift and Vigenere ciphers to a high degree of fidelity and for `", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 386, + 470, + 399 + ], + "spans": [ + { + "bbox": [ + 141, + 386, + 470, + 399 + ], + "score": 1.0, + "content": "vocabularies much larger than previously achieved. We present how CycleGAN", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 397, + 470, + 409 + ], + "spans": [ + { + "bbox": [ + 141, + 397, + 470, + 409 + ], + "score": 1.0, + "content": "can be made compatible with discrete data and train in a stable way. We then", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 407, + 470, + 420 + ], + "spans": [ + { + "bbox": [ + 141, + 407, + 470, + 420 + ], + "score": 1.0, + "content": "prove that the technique used in CipherGAN avoids the common problem of un-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 418, + 439, + 431 + ], + "spans": [ + { + "bbox": [ + 141, + 418, + 439, + 431 + ], + "score": 1.0, + "content": "informative discrimination associated with GANs applied to discrete data.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 21.5, + "bbox_fs": [ + 141, + 342, + 470, + 431 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 454, + 206, + 467 + ], + "lines": [ + { + "bbox": [ + 105, + 453, + 208, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 208, + 470 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 481, + 505, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "Humans have been encoding messages for secrecy since before the ancient Greeks, and for the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 492, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 504 + ], + "score": 1.0, + "content": "same amount of time, have been fascinated with trying to crack these codes using brute-force, fre-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 505, + 515 + ], + "score": 1.0, + "content": "quency analysis, crib-dragging and even espionage. Simple ciphers have, in the past century, been", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 513, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 505, + 526 + ], + "score": 1.0, + "content": "rendered irrelevant in favor of the more secure encryption schemes enabled by modern computa-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 525, + 506, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 537 + ], + "score": 1.0, + "content": "tional resources. However, the question of cipher-cracking remains an interesting problem since it", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 536, + 505, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 548 + ], + "score": 1.0, + "content": "requires an intimate understanding of the structure in a language. Nearly all automated cipher crack-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 546, + 506, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 506, + 559 + ], + "score": 1.0, + "content": "ing techniques have had to rely on a human-in-the-loop; grounding the automated techniques in a", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "human’s preexisting knowledge of language to clean up the errors made by simple algorithms such", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 569, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 505, + 581 + ], + "score": 1.0, + "content": "as frequency analysis. Across a number of domains, the use of hand-crafted features has often been", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 579, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 505, + 592 + ], + "score": 1.0, + "content": "replaced by automatic feature extraction directly from data using end-to-end learning frameworks", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 591, + 385, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 385, + 602 + ], + "score": 1.0, + "content": "(Goodfellow et al., 2016). The question to be addressed is as follows:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 480, + 506, + 602 + ] + }, + { + "type": "text", + "bbox": [ + 120, + 612, + 492, + 634 + ], + "lines": [ + { + "bbox": [ + 120, + 612, + 491, + 624 + ], + "spans": [ + { + "bbox": [ + 120, + 612, + 491, + 624 + ], + "score": 1.0, + "content": "Can a neural network be trained to deduce withheld ciphers from unaligned text, without the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 203, + 623, + 408, + 636 + ], + "spans": [ + { + "bbox": [ + 203, + 623, + 408, + 636 + ], + "score": 1.0, + "content": "supplementation of preexisting human knowledge?", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 120, + 612, + 491, + 636 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 645, + 505, + 711 + ], + "lines": [ + { + "bbox": [ + 106, + 645, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 505, + 656 + ], + "score": 1.0, + "content": "The implications for such a general framework would be far-reaching in the field of unsupervised", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "score": 1.0, + "content": "translation, where each language can be treated as an enciphering of the other. The decoding of", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 666, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 679 + ], + "score": 1.0, + "content": "the Copiale cipher (Knight et al., 2011) stands as an excellent example of the potential for machine", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "learning techniques to decode enciphered texts by treating the problem as language translation. The", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 688, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 701 + ], + "score": 1.0, + "content": "CycleGAN (Zhu et al., 2017) architecture is extremely general and we demonstrate our adaptation,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "CipherGAN, is capable of cracking ciphers to an extremely high degree of accuracy. CipherGAN", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 104, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "requires little or no modification to be applied to plaintext and ciphertext banks generated by the", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 201, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 201, + 106 + ], + "score": 1.0, + "content": "user’s cipher of choice.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 645, + 506, + 712 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 104, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 104, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "requires little or no modification to be applied to plaintext and ciphertext banks generated by the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 201, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 201, + 106 + ], + "score": 1.0, + "content": "user’s cipher of choice.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 489, + 122 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 489, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 489, + 125 + ], + "score": 1.0, + "content": "In addition to presenting a GAN that can crack ciphers, we contribute the following techniques:", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 132, + 131, + 505, + 208 + ], + "lines": [ + { + "bbox": [ + 132, + 131, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 132, + 131, + 505, + 145 + ], + "score": 1.0, + "content": "• We show how to stabilize CycleGAN training: our CipherGAN achieves good performance", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 141, + 142, + 496, + 156 + ], + "spans": [ + { + "bbox": [ + 141, + 142, + 332, + 156 + ], + "score": 1.0, + "content": "in all training runs, compared to approximately", + "type": "text" + }, + { + "bbox": [ + 333, + 143, + 352, + 153 + ], + "score": 0.84, + "content": "50 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 142, + 496, + 156 + ], + "score": 1.0, + "content": "of runs for the original CycleGAN.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 137, + 157, + 504, + 171 + ], + "spans": [ + { + "bbox": [ + 137, + 157, + 504, + 171 + ], + "score": 1.0, + "content": "We provide a theoretical description and analysis of the uninformative discrimination prob-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 169, + 335, + 182 + ], + "spans": [ + { + "bbox": [ + 141, + 169, + 335, + 182 + ], + "score": 1.0, + "content": "lem that impacts GANs applied to discrete data.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 132, + 183, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 505, + 198 + ], + "score": 1.0, + "content": "• We introduce a solution to the above problem by operating in the embedding space and", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 142, + 196, + 264, + 208 + ], + "spans": [ + { + "bbox": [ + 142, + 196, + 264, + 208 + ], + "score": 1.0, + "content": "show that it works in practice.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + }, + { + "type": "title", + "bbox": [ + 108, + 221, + 266, + 232 + ], + "lines": [ + { + "bbox": [ + 106, + 219, + 268, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 268, + 233 + ], + "score": 1.0, + "content": "1.1 SHIFT AND VIGENERE ` CIPHERS", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 108, + 242, + 506, + 275 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "score": 1.0, + "content": "The shift and Vigenere ciphers are well known historical substitution ciphers. The earliest known `", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 253, + 506, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 506, + 265 + ], + "score": 1.0, + "content": "record of a substitution cipher is believed to have dated back to 58 BCE, when Julius Caesar replaced", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 264, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 264, + 505, + 276 + ], + "score": 1.0, + "content": "each letter in a message with the letter that was three places further down the alphabet (Singh, 2000).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "image", + "bbox": [ + 132, + 292, + 475, + 314 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 132, + 292, + 475, + 314 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 132, + 292, + 475, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 292, + 475, + 314 + ], + "score": 0.921, + "type": "image", + "image_path": "460d7b3f9d39c9ab0d81dac7303d48440815027d54ce29a9743c7db1f3544a48.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 132, + 292, + 475, + 314 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 212, + 321, + 399, + 333 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 211, + 320, + 399, + 334 + ], + "spans": [ + { + "bbox": [ + 211, + 320, + 399, + 334 + ], + "score": 1.0, + "content": "Figure 1: An example of a right-shift-3 cipher.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 341, + 505, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "score": 1.0, + "content": "Using Figure 1, the message “attackatdawn” can be encrypted to “DWWDFNDWGDZQ”. This mes-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 352, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 506, + 365 + ], + "score": 1.0, + "content": "sage can be easily deciphered by the intended recipient (who is aware of the particular shift number", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "score": 1.0, + "content": "used) but looks meaningless to a third party. The shift cipher ensured secure communication be-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "score": 1.0, + "content": "tween sender and receiver for centuries, until the ninth century polymath Al-Kindi introduced the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 385, + 506, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 506, + 398 + ], + "score": 1.0, + "content": "concept of frequency analysis (Singh, 2000). He suggested that it would be possible to crack a ci-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "score": 1.0, + "content": "pher simply by analyzing the individual characters’ frequencies. For instance, in English the most", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 407, + 506, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 234, + 419 + ], + "score": 1.0, + "content": "frequently occurring letters are", + "type": "text" + }, + { + "bbox": [ + 234, + 407, + 244, + 417 + ], + "score": 0.34, + "content": "\\cdot _ { e } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 407, + 279, + 418 + ], + "score": 0.8, + "content": "( 1 2 . 7 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 407, + 283, + 419 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 284, + 407, + 294, + 417 + ], + "score": 0.37, + "content": "\\cdot _ { t } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 407, + 324, + 418 + ], + "score": 0.5, + "content": "( 9 . 1 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 407, + 343, + 419 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 343, + 407, + 355, + 417 + ], + "score": 0.32, + "content": "\\cdot _ { a } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 407, + 385, + 418 + ], + "score": 0.88, + "content": "( 8 . 2 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 407, + 424, + 419 + ], + "score": 1.0, + "content": "; whereas", + "type": "text" + }, + { + "bbox": [ + 425, + 407, + 436, + 419 + ], + "score": 0.44, + "content": "\\mathbf { \\dot { q } }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 407, + 441, + 419 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 441, + 407, + 453, + 417 + ], + "score": 0.6, + "content": "\\cdot _ { x } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 407, + 471, + 419 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 472, + 407, + 483, + 417 + ], + "score": 0.57, + "content": "\\cdot _ { z } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 407, + 506, + 419 + ], + "score": 1.0, + "content": "each", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 218, + 430 + ], + "score": 1.0, + "content": "have frequency of less than", + "type": "text" + }, + { + "bbox": [ + 218, + 418, + 232, + 428 + ], + "score": 0.87, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 417, + 505, + 430 + ], + "score": 1.0, + "content": ". Moreover, the code-breaker can also focus on bigrams of repeated", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 429, + 504, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 504, + 442 + ], + "score": 1.0, + "content": "letters; ‘ss’, ‘ee’, and ‘oo’ are the most common in English. This structure in language provides an", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 440, + 270, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 270, + 452 + ], + "score": 1.0, + "content": "exploit of efficiency to the code-breaker.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 106, + 456, + 505, + 567 + ], + "lines": [ + { + "bbox": [ + 105, + 456, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 505, + 469 + ], + "score": 1.0, + "content": "Polyalphabetic substitution ciphers, including the Vigenere cipher, were introduced to inhibit the `", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 467, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 505, + 480 + ], + "score": 1.0, + "content": "use of n-gram frequency analysis in determining the cipher mapping. Instead, the encrypter further", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "score": 1.0, + "content": "scrambles the message by using a separate shift cipher for each element of a key that is tiled to", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 489, + 504, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 504, + 502 + ], + "score": 1.0, + "content": "match the length of the plaintext. Increasing the key length greatly increases the number of possible", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 499, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 104, + 499, + 505, + 514 + ], + "score": 1.0, + "content": "combinations and thus prevents against basic frequency analysis. In the mid nineteenth century,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "Charles Babbage recognized that the length of the used key could be determined by counting the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 522, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 505, + 535 + ], + "score": 1.0, + "content": "repetitions and spacing of sequences of letters in the cipher (Singh, 2000). Using the determined", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "score": 1.0, + "content": "length, we can then apply frequency analysis on the index of the cipher base. This method makes it", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 544, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 506, + 558 + ], + "score": 1.0, + "content": "possible to break the Vigenere cipher, but is very time consuming and requires strong knowledge of `", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 555, + 184, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 184, + 567 + ], + "score": 1.0, + "content": "the language itself.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "There is a rich literature of automated shift-cipher cracking techniques (Ramesh et al., 1993; Forsyth", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "& Safavi-Naini, 1993; Hasinoff, 2003; Knight et al., 2006; Verma et al., 2007; Raju et al., 2010;", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "Knight et al., 2011) many of which achieve excellent results which is what one would expect from", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 605, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 506, + 618 + ], + "score": 1.0, + "content": "hand-crafted algorithms targeting specific ciphers and vocabularies. Work on automated cracking of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "score": 1.0, + "content": "polyalphabetic ciphers (Carroll & Martin, 1986; Toemeh & Arumugam, 2008; Omran et al., 2011)", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "has seen similar success on small vocabularies. It is a difficult matter to compare the results of", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "previous work with our own as their focus ranges from inferring cipher keys (Carroll & Martin,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "1986; Ramesh et al., 1993; Omran et al., 2011), to inferring the mappings given limited quantities", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 660, + 504, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 504, + 672 + ], + "score": 1.0, + "content": "of ciphertext (determining unicity distance) (Carroll & Martin, 1986; Ramesh et al., 1993; Hasinoff,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 670, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 506, + 684 + ], + "score": 1.0, + "content": "2003; Verma et al., 2007), to analyzing the unicity distance required to solve small percentages of", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 682, + 345, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 208, + 694 + ], + "score": 1.0, + "content": "the cipher mappings (i.e.", + "type": "text" + }, + { + "bbox": [ + 208, + 682, + 228, + 692 + ], + "score": 0.86, + "content": "20 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 682, + 345, + 694 + ], + "score": 1.0, + "content": "in Carroll & Martin (1986)).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "In comparison to these past works, we afford ourselves the advantage of an unconstrained corpus", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "of ciphertext, however, we prescribe ourselves the following constraints: our model is not provided", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "any prior knowledge of vocabulary element frequencies; and, no information about the cipher key is", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47 + } + ], + "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": [ + 104, + 82, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 489, + 122 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 489, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 489, + 125 + ], + "score": 1.0, + "content": "In addition to presenting a GAN that can crack ciphers, we contribute the following techniques:", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 109, + 489, + 125 + ] + }, + { + "type": "list", + "bbox": [ + 132, + 131, + 505, + 208 + ], + "lines": [ + { + "bbox": [ + 132, + 131, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 132, + 131, + 505, + 145 + ], + "score": 1.0, + "content": "• We show how to stabilize CycleGAN training: our CipherGAN achieves good performance", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 142, + 496, + 156 + ], + "spans": [ + { + "bbox": [ + 141, + 142, + 332, + 156 + ], + "score": 1.0, + "content": "in all training runs, compared to approximately", + "type": "text" + }, + { + "bbox": [ + 333, + 143, + 352, + 153 + ], + "score": 0.84, + "content": "50 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 142, + 496, + 156 + ], + "score": 1.0, + "content": "of runs for the original CycleGAN.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 137, + 157, + 504, + 171 + ], + "spans": [ + { + "bbox": [ + 137, + 157, + 504, + 171 + ], + "score": 1.0, + "content": "We provide a theoretical description and analysis of the uninformative discrimination prob-", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 169, + 335, + 182 + ], + "spans": [ + { + "bbox": [ + 141, + 169, + 335, + 182 + ], + "score": 1.0, + "content": "lem that impacts GANs applied to discrete data.", + "type": "text" + } + ], + "index": 6, + "is_list_end_line": true + }, + { + "bbox": [ + 132, + 183, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 505, + 198 + ], + "score": 1.0, + "content": "• We introduce a solution to the above problem by operating in the embedding space and", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 142, + 196, + 264, + 208 + ], + "spans": [ + { + "bbox": [ + 142, + 196, + 264, + 208 + ], + "score": 1.0, + "content": "show that it works in practice.", + "type": "text" + } + ], + "index": 8, + "is_list_end_line": true + } + ], + "index": 5.5, + "bbox_fs": [ + 132, + 131, + 505, + 208 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 221, + 266, + 232 + ], + "lines": [ + { + "bbox": [ + 106, + 219, + 268, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 268, + 233 + ], + "score": 1.0, + "content": "1.1 SHIFT AND VIGENERE ` CIPHERS", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 108, + 242, + 506, + 275 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "score": 1.0, + "content": "The shift and Vigenere ciphers are well known historical substitution ciphers. The earliest known `", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 253, + 506, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 506, + 265 + ], + "score": 1.0, + "content": "record of a substitution cipher is believed to have dated back to 58 BCE, when Julius Caesar replaced", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 264, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 106, + 264, + 505, + 276 + ], + "score": 1.0, + "content": "each letter in a message with the letter that was three places further down the alphabet (Singh, 2000).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 241, + 506, + 276 + ] + }, + { + "type": "image", + "bbox": [ + 132, + 292, + 475, + 314 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 132, + 292, + 475, + 314 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 132, + 292, + 475, + 314 + ], + "spans": [ + { + "bbox": [ + 132, + 292, + 475, + 314 + ], + "score": 0.921, + "type": "image", + "image_path": "460d7b3f9d39c9ab0d81dac7303d48440815027d54ce29a9743c7db1f3544a48.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 132, + 292, + 475, + 314 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 212, + 321, + 399, + 333 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 211, + 320, + 399, + 334 + ], + "spans": [ + { + "bbox": [ + 211, + 320, + 399, + 334 + ], + "score": 1.0, + "content": "Figure 1: An example of a right-shift-3 cipher.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 341, + 505, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "score": 1.0, + "content": "Using Figure 1, the message “attackatdawn” can be encrypted to “DWWDFNDWGDZQ”. This mes-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 352, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 506, + 365 + ], + "score": 1.0, + "content": "sage can be easily deciphered by the intended recipient (who is aware of the particular shift number", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "score": 1.0, + "content": "used) but looks meaningless to a third party. The shift cipher ensured secure communication be-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "score": 1.0, + "content": "tween sender and receiver for centuries, until the ninth century polymath Al-Kindi introduced the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 385, + 506, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 506, + 398 + ], + "score": 1.0, + "content": "concept of frequency analysis (Singh, 2000). He suggested that it would be possible to crack a ci-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "score": 1.0, + "content": "pher simply by analyzing the individual characters’ frequencies. For instance, in English the most", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 407, + 506, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 234, + 419 + ], + "score": 1.0, + "content": "frequently occurring letters are", + "type": "text" + }, + { + "bbox": [ + 234, + 407, + 244, + 417 + ], + "score": 0.34, + "content": "\\cdot _ { e } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 407, + 279, + 418 + ], + "score": 0.8, + "content": "( 1 2 . 7 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 407, + 283, + 419 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 284, + 407, + 294, + 417 + ], + "score": 0.37, + "content": "\\cdot _ { t } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 407, + 324, + 418 + ], + "score": 0.5, + "content": "( 9 . 1 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 407, + 343, + 419 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 343, + 407, + 355, + 417 + ], + "score": 0.32, + "content": "\\cdot _ { a } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 407, + 385, + 418 + ], + "score": 0.88, + "content": "( 8 . 2 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 407, + 424, + 419 + ], + "score": 1.0, + "content": "; whereas", + "type": "text" + }, + { + "bbox": [ + 425, + 407, + 436, + 419 + ], + "score": 0.44, + "content": "\\mathbf { \\dot { q } }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 407, + 441, + 419 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 441, + 407, + 453, + 417 + ], + "score": 0.6, + "content": "\\cdot _ { x } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 407, + 471, + 419 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 472, + 407, + 483, + 417 + ], + "score": 0.57, + "content": "\\cdot _ { z } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 407, + 506, + 419 + ], + "score": 1.0, + "content": "each", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 218, + 430 + ], + "score": 1.0, + "content": "have frequency of less than", + "type": "text" + }, + { + "bbox": [ + 218, + 418, + 232, + 428 + ], + "score": 0.87, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 417, + 505, + 430 + ], + "score": 1.0, + "content": ". Moreover, the code-breaker can also focus on bigrams of repeated", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 429, + 504, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 504, + 442 + ], + "score": 1.0, + "content": "letters; ‘ss’, ‘ee’, and ‘oo’ are the most common in English. This structure in language provides an", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 440, + 270, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 270, + 452 + ], + "score": 1.0, + "content": "exploit of efficiency to the code-breaker.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 340, + 506, + 452 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 456, + 505, + 567 + ], + "lines": [ + { + "bbox": [ + 105, + 456, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 505, + 469 + ], + "score": 1.0, + "content": "Polyalphabetic substitution ciphers, including the Vigenere cipher, were introduced to inhibit the `", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 467, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 505, + 480 + ], + "score": 1.0, + "content": "use of n-gram frequency analysis in determining the cipher mapping. Instead, the encrypter further", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "score": 1.0, + "content": "scrambles the message by using a separate shift cipher for each element of a key that is tiled to", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 489, + 504, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 504, + 502 + ], + "score": 1.0, + "content": "match the length of the plaintext. Increasing the key length greatly increases the number of possible", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 499, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 104, + 499, + 505, + 514 + ], + "score": 1.0, + "content": "combinations and thus prevents against basic frequency analysis. In the mid nineteenth century,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "Charles Babbage recognized that the length of the used key could be determined by counting the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 522, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 505, + 535 + ], + "score": 1.0, + "content": "repetitions and spacing of sequences of letters in the cipher (Singh, 2000). Using the determined", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "score": 1.0, + "content": "length, we can then apply frequency analysis on the index of the cipher base. This method makes it", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 544, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 506, + 558 + ], + "score": 1.0, + "content": "possible to break the Vigenere cipher, but is very time consuming and requires strong knowledge of `", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 555, + 184, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 184, + 567 + ], + "score": 1.0, + "content": "the language itself.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 29.5, + "bbox_fs": [ + 104, + 456, + 506, + 567 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 572, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "There is a rich literature of automated shift-cipher cracking techniques (Ramesh et al., 1993; Forsyth", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "& Safavi-Naini, 1993; Hasinoff, 2003; Knight et al., 2006; Verma et al., 2007; Raju et al., 2010;", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "Knight et al., 2011) many of which achieve excellent results which is what one would expect from", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 605, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 506, + 618 + ], + "score": 1.0, + "content": "hand-crafted algorithms targeting specific ciphers and vocabularies. Work on automated cracking of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "score": 1.0, + "content": "polyalphabetic ciphers (Carroll & Martin, 1986; Toemeh & Arumugam, 2008; Omran et al., 2011)", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "has seen similar success on small vocabularies. It is a difficult matter to compare the results of", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "previous work with our own as their focus ranges from inferring cipher keys (Carroll & Martin,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "1986; Ramesh et al., 1993; Omran et al., 2011), to inferring the mappings given limited quantities", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 660, + 504, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 504, + 672 + ], + "score": 1.0, + "content": "of ciphertext (determining unicity distance) (Carroll & Martin, 1986; Ramesh et al., 1993; Hasinoff,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 670, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 506, + 684 + ], + "score": 1.0, + "content": "2003; Verma et al., 2007), to analyzing the unicity distance required to solve small percentages of", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 682, + 345, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 208, + 694 + ], + "score": 1.0, + "content": "the cipher mappings (i.e.", + "type": "text" + }, + { + "bbox": [ + 208, + 682, + 228, + 692 + ], + "score": 0.86, + "content": "20 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 682, + 345, + 694 + ], + "score": 1.0, + "content": "in Carroll & Martin (1986)).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 572, + 506, + 694 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "In comparison to these past works, we afford ourselves the advantage of an unconstrained corpus", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "of ciphertext, however, we prescribe ourselves the following constraints: our model is not provided", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "any prior knowledge of vocabulary element frequencies; and, no information about the cipher key is", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "provided. Another complexity our work must overcome is our significantly larger vocabulary sizes;", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "all previous work has addressed vocabularies of approximately 26 characters, while our model is", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "capable of solving word-level ciphers with over 200 distinct vocabulary elements. As such, our", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "methodology is notably ‘hands-off’ in comparison to previous work and can be easily applied to", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 466, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 466, + 139 + ], + "score": 1.0, + "content": "different forms of cipher, different underlying data and unsupervised text alignment tasks.", + "type": "text", + "cross_page": true + } + ], + "index": 4 + } + ], + "index": 47, + "bbox_fs": [ + 105, + 699, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "provided. Another complexity our work must overcome is our significantly larger vocabulary sizes;", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "all previous work has addressed vocabularies of approximately 26 characters, while our model is", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "capable of solving word-level ciphers with over 200 distinct vocabulary elements. As such, our", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "methodology is notably ‘hands-off’ in comparison to previous work and can be easily applied to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 466, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 466, + 139 + ], + "score": 1.0, + "content": "different forms of cipher, different underlying data and unsupervised text alignment tasks.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "title", + "bbox": [ + 108, + 152, + 275, + 164 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 276, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 276, + 165 + ], + "score": 1.0, + "content": "1.2 GANS AND WASSERSTEIN GANS", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 173, + 505, + 252 + ], + "lines": [ + { + "bbox": [ + 106, + 173, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 186 + ], + "score": 1.0, + "content": "Generative Adversarial Networks (GANs) are a class of neural network architectures introduced by", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 184, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 505, + 198 + ], + "score": 1.0, + "content": "Goodfellow et al. (2014) as an alternative to optimizing likelihood under a true data distribution.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "score": 1.0, + "content": "Instead, GANs balance the optimization of a generator network which attempts to produce convinc-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 207, + 506, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 506, + 220 + ], + "score": 1.0, + "content": "ing samples from the data distribution, and a discriminator which is trained to distinguish between", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 217, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 217, + 505, + 230 + ], + "score": 1.0, + "content": "samples from the true data distribution and the generator’s synthetic samples. GANs have been", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 229, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 229, + 505, + 241 + ], + "score": 1.0, + "content": "shown to produce compelling results in the domain of image generation, but comparatively weak", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 240, + 382, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 240, + 382, + 252 + ], + "score": 1.0, + "content": "performance in domains using discrete data (discussed in Section 2).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 256, + 455, + 268 + ], + "lines": [ + { + "bbox": [ + 105, + 256, + 456, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 456, + 270 + ], + "score": 1.0, + "content": "The original GAN discriminator objective as introduced in Goodfellow et al. (2014) is:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 182, + 275, + 429, + 293 + ], + "lines": [ + { + "bbox": [ + 182, + 275, + 429, + 293 + ], + "spans": [ + { + "bbox": [ + 182, + 275, + 429, + 293 + ], + "score": 0.91, + "content": "D ^ { * } = \\arg \\operatorname* { m a x } _ { D } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ \\log D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ \\log ( 1 - D ( F ( z ) ) ) ]", + "type": "interline_equation", + "image_path": "3dbc6a730250f4938e194737af8ef907841bb0e75ed99b81eafa8df2d928acf9.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 182, + 275, + 429, + 293 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 299, + 505, + 366 + ], + "lines": [ + { + "bbox": [ + 106, + 298, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 136, + 312 + ], + "score": 1.0, + "content": "Where", + "type": "text" + }, + { + "bbox": [ + 136, + 300, + 145, + 309 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 298, + 266, + 312 + ], + "score": 1.0, + "content": "is the generator network and", + "type": "text" + }, + { + "bbox": [ + 267, + 300, + 276, + 309 + ], + "score": 0.84, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 298, + 506, + 312 + ], + "score": 1.0, + "content": "is the discriminator network. This loss is vulnerable to", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 309, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 506, + 325 + ], + "score": 1.0, + "content": "the problem of ‘mode collapse’ where the generative distribution collapses to produce a generating", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 322, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 322, + 505, + 333 + ], + "score": 1.0, + "content": "distribution with low diversity. In order to more broadly distribute the mass, the Wasserstein GAN", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "score": 1.0, + "content": "(WGAN) objective (Arjovsky et al., 2017) considers the set of K-Lipschitz discriminator functions", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 107, + 344, + 157, + 353 + ], + "score": 0.89, + "content": "D : X \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "and minimizes the earth movers (1st Wasserstein) distance. The Lipschitz condition is", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 354, + 416, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 416, + 367 + ], + "score": 1.0, + "content": "enforced by clipping discriminators weights to fall within a predefined range.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5 + }, + { + "type": "interline_equation", + "bbox": [ + 200, + 372, + 410, + 393 + ], + "lines": [ + { + "bbox": [ + 200, + 372, + 410, + 393 + ], + "spans": [ + { + "bbox": [ + 200, + 372, + 410, + 393 + ], + "score": 0.92, + "content": "D ^ { * } = \\arg \\operatorname* { m a x } _ { \\| D \\| _ { L } \\leq K } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ D ( F ( z ) ) ]", + "type": "interline_equation", + "image_path": "a3b7c70eb61d13a0cc68ef36a15c7ca5f0d9986572c8c5a616c02cfe068e4694.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 200, + 372, + 410, + 393 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 399, + 505, + 444 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "An improved WGAN objective, introduced by Gulrajani et al. (2017), enforced the Lipschitz condi-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "tion using a Jacobian regularization term instead of the originally proposed weight-clipping solution.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "This resulted in more stable training, avoiding capacity under-use and exploding gradients, and im-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 433, + 312, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 312, + 446 + ], + "score": 1.0, + "content": "proved network performance over weight-clipping.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5 + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 449, + 408, + 487 + ], + "lines": [ + { + "bbox": [ + 203, + 449, + 408, + 487 + ], + "spans": [ + { + "bbox": [ + 203, + 449, + 408, + 487 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { D ^ { * } = \\arg \\underset { D } { \\operatorname* { m a x } } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ D ( F ( z ) ) ] + } \\\\ & { \\qquad \\quad \\alpha \\cdot \\mathbb { E } _ { \\hat { x } \\sim \\hat { \\mathcal { X } } } [ ( \\| \\nabla _ { \\hat { x } } D ( \\hat { x } ) \\| _ { 2 } - 1 ) ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "1d2c540c593398728c59299573ae22d29e887e27f44ee1933a2d1f9da45587c8.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 203, + 449, + 408, + 468.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 203, + 468.0, + 408, + 487.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 493, + 506, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 128, + 506 + ], + "score": 1.0, + "content": "Here", + "type": "text" + }, + { + "bbox": [ + 128, + 492, + 138, + 504 + ], + "score": 0.87, + "content": "\\hat { \\mathcal X }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 492, + 397, + 506 + ], + "score": 1.0, + "content": "are samples taken along a line between the true data distribution", + "type": "text" + }, + { + "bbox": [ + 397, + 494, + 406, + 504 + ], + "score": 0.84, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 492, + 505, + 506 + ], + "score": 1.0, + "content": "and the generator’s data", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 504, + 245, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 155, + 518 + ], + "score": 1.0, + "content": "distribution", + "type": "text" + }, + { + "bbox": [ + 155, + 504, + 241, + 517 + ], + "score": 0.92, + "content": "\\mathcal { X } _ { g } \\overset { \\cdot } { = } \\{ F ( z ) | z \\sim \\bar { \\mathcal { Z } } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 504, + 245, + 518 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "title", + "bbox": [ + 108, + 531, + 185, + 542 + ], + "lines": [ + { + "bbox": [ + 105, + 529, + 186, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 186, + 545 + ], + "score": 1.0, + "content": "1.3 CYCLEGAN", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "CycleGAN (Zhu et al., 2017) is a generative adversarial network designed to learn a mapping be-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 563, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 104, + 563, + 505, + 575 + ], + "score": 1.0, + "content": "tween two data distributions without supervision. Three separate works (Zhu et al., 2017; Yi et al.,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 573, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 505, + 587 + ], + "score": 1.0, + "content": "2017; Liu et al., 2017) share many of the core features we describe below, however, for simplicity", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 585, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 505, + 597 + ], + "score": 1.0, + "content": "we will refer to CycleGAN as the basis for our work as it is the most similar to our model. It acts", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 595, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 171, + 610 + ], + "score": 1.0, + "content": "on distributions", + "type": "text" + }, + { + "bbox": [ + 172, + 597, + 181, + 606 + ], + "score": 0.84, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 595, + 199, + 610 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 200, + 597, + 208, + 607 + ], + "score": 0.8, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 595, + 348, + 610 + ], + "score": 1.0, + "content": "by using two mapping generators:", + "type": "text" + }, + { + "bbox": [ + 349, + 596, + 399, + 607 + ], + "score": 0.92, + "content": "F : \\mathcal { X } \\mathcal { Y }", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 595, + 416, + 610 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 417, + 596, + 466, + 607 + ], + "score": 0.91, + "content": "G : \\mathcal { V } \\to \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 595, + 506, + 610 + ], + "score": 1.0, + "content": "; and two", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 607, + 327, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 169, + 620 + ], + "score": 1.0, + "content": "discriminators:", + "type": "text" + }, + { + "bbox": [ + 170, + 607, + 238, + 619 + ], + "score": 0.93, + "content": "D _ { \\mathcal { X } } : \\mathcal { X } [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 607, + 256, + 620 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 257, + 607, + 323, + 619 + ], + "score": 0.93, + "content": "D y : \\bar { \\mathcal { Y } } \\stackrel { \\textstyle - } { \\to } \\bar { [ 0 , 1 ] }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 607, + 327, + 620 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 623, + 315, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 316, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 288, + 638 + ], + "score": 1.0, + "content": "CycleGAN optimizes the standard GAN loss", + "type": "text" + }, + { + "bbox": [ + 288, + 624, + 312, + 635 + ], + "score": 0.88, + "content": "{ \\mathcal { L } } _ { \\mathrm { G A N } }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 622, + 316, + 638 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "interline_equation", + "bbox": [ + 159, + 642, + 452, + 657 + ], + "lines": [ + { + "bbox": [ + 159, + 642, + 452, + 657 + ], + "spans": [ + { + "bbox": [ + 159, + 642, + 452, + 657 + ], + "score": 0.87, + "content": "{ \\mathcal { L } } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\chi , \\mathcal { V } ) = \\mathbb { E } _ { y \\sim \\mathcal { V } } [ \\log D _ { \\mathcal { V } } ( y ) ] + \\mathbb { E } _ { x \\sim \\chi } [ \\log ( 1 - D _ { \\mathcal { V } } ( F ( x ) ) ) ]", + "type": "interline_equation", + "image_path": "6703707856e60714b7b5b7bc833ed70d7c2f42876dd7792fbae226ab8ae66796.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 159, + 642, + 452, + 657 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 662, + 369, + 674 + ], + "lines": [ + { + "bbox": [ + 105, + 659, + 370, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 347, + 677 + ], + "score": 1.0, + "content": "While also considering a reconstruction loss, or ‘cycle’ loss", + "type": "text" + }, + { + "bbox": [ + 347, + 663, + 365, + 675 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { \\mathrm { c y c } }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 659, + 370, + 677 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "interline_equation", + "bbox": [ + 158, + 680, + 452, + 695 + ], + "lines": [ + { + "bbox": [ + 158, + 680, + 452, + 695 + ], + "spans": [ + { + "bbox": [ + 158, + 680, + 452, + 695 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) = \\mathbb { E } _ { x \\sim \\mathcal { X } } [ \\| G ( F ( x ) ) - x \\| _ { 1 } ] + \\mathbb { E } _ { y \\sim \\mathcal { Y } } [ \\| F ( G ( y ) ) - y \\| _ { 1 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "64e760da228cd877436dc52d691c7489e8b64312cdba8065d7c2956a3445d164.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 158, + 680, + 452, + 695 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 701, + 368, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 369, + 716 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 358, + 716 + ], + "score": 1.0, + "content": "Taken together the losses are balanced using a hyperparameter", + "type": "text" + }, + { + "bbox": [ + 358, + 702, + 364, + 711 + ], + "score": 0.83, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 699, + 369, + 716 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 719, + 496, + 733 + ], + "lines": [ + { + "bbox": [ + 113, + 719, + 496, + 733 + ], + "spans": [ + { + "bbox": [ + 113, + 719, + 496, + 733 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } ( F , G , D _ { \\mathcal { X } } , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) = \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) + \\lambda \\cdot \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}", + "type": "interline_equation", + "image_path": "c4e5214b74b7cbe6c0f89e582b95af134571cca124dbb569db521acb59f9fbc5.jpg" + } + ] + } + ], + "index": 42, + "virtual_lines": [ + { + "bbox": [ + 113, + 719, + 496, + 733 + ], + "spans": [], + "index": 42 + } + ] + } + ], + "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": "text", + "bbox": [ + 107, + 82, + 505, + 138 + ], + "lines": [], + "index": 2, + "bbox_fs": [ + 105, + 83, + 506, + 139 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 152, + 275, + 164 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 276, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 276, + 165 + ], + "score": 1.0, + "content": "1.2 GANS AND WASSERSTEIN GANS", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 173, + 505, + 252 + ], + "lines": [ + { + "bbox": [ + 106, + 173, + 505, + 186 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 186 + ], + "score": 1.0, + "content": "Generative Adversarial Networks (GANs) are a class of neural network architectures introduced by", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 184, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 505, + 198 + ], + "score": 1.0, + "content": "Goodfellow et al. (2014) as an alternative to optimizing likelihood under a true data distribution.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "score": 1.0, + "content": "Instead, GANs balance the optimization of a generator network which attempts to produce convinc-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 207, + 506, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 506, + 220 + ], + "score": 1.0, + "content": "ing samples from the data distribution, and a discriminator which is trained to distinguish between", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 217, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 217, + 505, + 230 + ], + "score": 1.0, + "content": "samples from the true data distribution and the generator’s synthetic samples. GANs have been", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 229, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 229, + 505, + 241 + ], + "score": 1.0, + "content": "shown to produce compelling results in the domain of image generation, but comparatively weak", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 240, + 382, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 240, + 382, + 252 + ], + "score": 1.0, + "content": "performance in domains using discrete data (discussed in Section 2).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 173, + 506, + 252 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 256, + 455, + 268 + ], + "lines": [ + { + "bbox": [ + 105, + 256, + 456, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 456, + 270 + ], + "score": 1.0, + "content": "The original GAN discriminator objective as introduced in Goodfellow et al. (2014) is:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 256, + 456, + 270 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 182, + 275, + 429, + 293 + ], + "lines": [ + { + "bbox": [ + 182, + 275, + 429, + 293 + ], + "spans": [ + { + "bbox": [ + 182, + 275, + 429, + 293 + ], + "score": 0.91, + "content": "D ^ { * } = \\arg \\operatorname* { m a x } _ { D } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ \\log D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ \\log ( 1 - D ( F ( z ) ) ) ]", + "type": "interline_equation", + "image_path": "3dbc6a730250f4938e194737af8ef907841bb0e75ed99b81eafa8df2d928acf9.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 182, + 275, + 429, + 293 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 299, + 505, + 366 + ], + "lines": [ + { + "bbox": [ + 106, + 298, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 136, + 312 + ], + "score": 1.0, + "content": "Where", + "type": "text" + }, + { + "bbox": [ + 136, + 300, + 145, + 309 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 298, + 266, + 312 + ], + "score": 1.0, + "content": "is the generator network and", + "type": "text" + }, + { + "bbox": [ + 267, + 300, + 276, + 309 + ], + "score": 0.84, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 298, + 506, + 312 + ], + "score": 1.0, + "content": "is the discriminator network. This loss is vulnerable to", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 309, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 506, + 325 + ], + "score": 1.0, + "content": "the problem of ‘mode collapse’ where the generative distribution collapses to produce a generating", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 322, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 322, + 505, + 333 + ], + "score": 1.0, + "content": "distribution with low diversity. In order to more broadly distribute the mass, the Wasserstein GAN", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 344 + ], + "score": 1.0, + "content": "(WGAN) objective (Arjovsky et al., 2017) considers the set of K-Lipschitz discriminator functions", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 107, + 344, + 157, + 353 + ], + "score": 0.89, + "content": "D : X \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "and minimizes the earth movers (1st Wasserstein) distance. The Lipschitz condition is", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 354, + 416, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 416, + 367 + ], + "score": 1.0, + "content": "enforced by clipping discriminators weights to fall within a predefined range.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 298, + 506, + 367 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 200, + 372, + 410, + 393 + ], + "lines": [ + { + "bbox": [ + 200, + 372, + 410, + 393 + ], + "spans": [ + { + "bbox": [ + 200, + 372, + 410, + 393 + ], + "score": 0.92, + "content": "D ^ { * } = \\arg \\operatorname* { m a x } _ { \\| D \\| _ { L } \\leq K } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ D ( F ( z ) ) ]", + "type": "interline_equation", + "image_path": "a3b7c70eb61d13a0cc68ef36a15c7ca5f0d9986572c8c5a616c02cfe068e4694.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 200, + 372, + 410, + 393 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 399, + 505, + 444 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "An improved WGAN objective, introduced by Gulrajani et al. (2017), enforced the Lipschitz condi-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "tion using a Jacobian regularization term instead of the originally proposed weight-clipping solution.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "This resulted in more stable training, avoiding capacity under-use and exploding gradients, and im-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 433, + 312, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 312, + 446 + ], + "score": 1.0, + "content": "proved network performance over weight-clipping.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 399, + 505, + 446 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 449, + 408, + 487 + ], + "lines": [ + { + "bbox": [ + 203, + 449, + 408, + 487 + ], + "spans": [ + { + "bbox": [ + 203, + 449, + 408, + 487 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { D ^ { * } = \\arg \\underset { D } { \\operatorname* { m a x } } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ D ( F ( z ) ) ] + } \\\\ & { \\qquad \\quad \\alpha \\cdot \\mathbb { E } _ { \\hat { x } \\sim \\hat { \\mathcal { X } } } [ ( \\| \\nabla _ { \\hat { x } } D ( \\hat { x } ) \\| _ { 2 } - 1 ) ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "1d2c540c593398728c59299573ae22d29e887e27f44ee1933a2d1f9da45587c8.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 203, + 449, + 408, + 468.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 203, + 468.0, + 408, + 487.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 493, + 506, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 128, + 506 + ], + "score": 1.0, + "content": "Here", + "type": "text" + }, + { + "bbox": [ + 128, + 492, + 138, + 504 + ], + "score": 0.87, + "content": "\\hat { \\mathcal X }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 492, + 397, + 506 + ], + "score": 1.0, + "content": "are samples taken along a line between the true data distribution", + "type": "text" + }, + { + "bbox": [ + 397, + 494, + 406, + 504 + ], + "score": 0.84, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 492, + 505, + 506 + ], + "score": 1.0, + "content": "and the generator’s data", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 504, + 245, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 155, + 518 + ], + "score": 1.0, + "content": "distribution", + "type": "text" + }, + { + "bbox": [ + 155, + 504, + 241, + 517 + ], + "score": 0.92, + "content": "\\mathcal { X } _ { g } \\overset { \\cdot } { = } \\{ F ( z ) | z \\sim \\bar { \\mathcal { Z } } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 504, + 245, + 518 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 492, + 505, + 518 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 531, + 185, + 542 + ], + "lines": [ + { + "bbox": [ + 105, + 529, + 186, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 186, + 545 + ], + "score": 1.0, + "content": "1.3 CYCLEGAN", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 551, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "CycleGAN (Zhu et al., 2017) is a generative adversarial network designed to learn a mapping be-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 563, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 104, + 563, + 505, + 575 + ], + "score": 1.0, + "content": "tween two data distributions without supervision. Three separate works (Zhu et al., 2017; Yi et al.,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 573, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 505, + 587 + ], + "score": 1.0, + "content": "2017; Liu et al., 2017) share many of the core features we describe below, however, for simplicity", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 585, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 505, + 597 + ], + "score": 1.0, + "content": "we will refer to CycleGAN as the basis for our work as it is the most similar to our model. It acts", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 595, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 171, + 610 + ], + "score": 1.0, + "content": "on distributions", + "type": "text" + }, + { + "bbox": [ + 172, + 597, + 181, + 606 + ], + "score": 0.84, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 595, + 199, + 610 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 200, + 597, + 208, + 607 + ], + "score": 0.8, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 595, + 348, + 610 + ], + "score": 1.0, + "content": "by using two mapping generators:", + "type": "text" + }, + { + "bbox": [ + 349, + 596, + 399, + 607 + ], + "score": 0.92, + "content": "F : \\mathcal { X } \\mathcal { Y }", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 595, + 416, + 610 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 417, + 596, + 466, + 607 + ], + "score": 0.91, + "content": "G : \\mathcal { V } \\to \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 595, + 506, + 610 + ], + "score": 1.0, + "content": "; and two", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 607, + 327, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 169, + 620 + ], + "score": 1.0, + "content": "discriminators:", + "type": "text" + }, + { + "bbox": [ + 170, + 607, + 238, + 619 + ], + "score": 0.93, + "content": "D _ { \\mathcal { X } } : \\mathcal { X } [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 607, + 256, + 620 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 257, + 607, + 323, + 619 + ], + "score": 0.93, + "content": "D y : \\bar { \\mathcal { Y } } \\stackrel { \\textstyle - } { \\to } \\bar { [ 0 , 1 ] }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 607, + 327, + 620 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5, + "bbox_fs": [ + 104, + 552, + 506, + 620 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 623, + 315, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 316, + 638 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 288, + 638 + ], + "score": 1.0, + "content": "CycleGAN optimizes the standard GAN loss", + "type": "text" + }, + { + "bbox": [ + 288, + 624, + 312, + 635 + ], + "score": 0.88, + "content": "{ \\mathcal { L } } _ { \\mathrm { G A N } }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 622, + 316, + 638 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 622, + 316, + 638 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 159, + 642, + 452, + 657 + ], + "lines": [ + { + "bbox": [ + 159, + 642, + 452, + 657 + ], + "spans": [ + { + "bbox": [ + 159, + 642, + 452, + 657 + ], + "score": 0.87, + "content": "{ \\mathcal { L } } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\chi , \\mathcal { V } ) = \\mathbb { E } _ { y \\sim \\mathcal { V } } [ \\log D _ { \\mathcal { V } } ( y ) ] + \\mathbb { E } _ { x \\sim \\chi } [ \\log ( 1 - D _ { \\mathcal { V } } ( F ( x ) ) ) ]", + "type": "interline_equation", + "image_path": "6703707856e60714b7b5b7bc833ed70d7c2f42876dd7792fbae226ab8ae66796.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 159, + 642, + 452, + 657 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 662, + 369, + 674 + ], + "lines": [ + { + "bbox": [ + 105, + 659, + 370, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 347, + 677 + ], + "score": 1.0, + "content": "While also considering a reconstruction loss, or ‘cycle’ loss", + "type": "text" + }, + { + "bbox": [ + 347, + 663, + 365, + 675 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { \\mathrm { c y c } }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 659, + 370, + 677 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 659, + 370, + 677 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 158, + 680, + 452, + 695 + ], + "lines": [ + { + "bbox": [ + 158, + 680, + 452, + 695 + ], + "spans": [ + { + "bbox": [ + 158, + 680, + 452, + 695 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) = \\mathbb { E } _ { x \\sim \\mathcal { X } } [ \\| G ( F ( x ) ) - x \\| _ { 1 } ] + \\mathbb { E } _ { y \\sim \\mathcal { Y } } [ \\| F ( G ( y ) ) - y \\| _ { 1 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "64e760da228cd877436dc52d691c7489e8b64312cdba8065d7c2956a3445d164.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 158, + 680, + 452, + 695 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 701, + 368, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 369, + 716 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 358, + 716 + ], + "score": 1.0, + "content": "Taken together the losses are balanced using a hyperparameter", + "type": "text" + }, + { + "bbox": [ + 358, + 702, + 364, + 711 + ], + "score": 0.83, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 699, + 369, + 716 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 699, + 369, + 716 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 719, + 496, + 733 + ], + "lines": [ + { + "bbox": [ + 113, + 719, + 496, + 733 + ], + "spans": [ + { + "bbox": [ + 113, + 719, + 496, + 733 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } ( F , G , D _ { \\mathcal { X } } , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) = \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) + \\lambda \\cdot \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}", + "type": "interline_equation", + "image_path": "c4e5214b74b7cbe6c0f89e582b95af134571cca124dbb569db521acb59f9fbc5.jpg" + } + ] + } + ], + "index": 42, + "virtual_lines": [ + { + "bbox": [ + 113, + 719, + 496, + 733 + ], + "spans": [], + "index": 42 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 196, + 57, + 414, + 138 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 196, + 57, + 414, + 138 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 196, + 57, + 414, + 138 + ], + "spans": [ + { + "bbox": [ + 196, + 57, + 414, + 138 + ], + "score": 0.13, + "type": "image", + "image_path": "812aeb636c0618e5ae1a7118c5a53c0189743ca4f6c24f4f68b67e47a40cac93.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 196, + 57, + 414, + 70.5 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 196, + 70.5, + 414, + 84.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 196, + 84.0, + 414, + 97.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 196, + 97.5, + 414, + 111.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 196, + 111.0, + 414, + 124.5 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 196, + 124.5, + 414, + 138.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 141, + 505, + 175 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 140, + 505, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 505, + 153 + ], + "score": 1.0, + "content": "Figure 2: Discriminators trained on the toy example of recognizing the bottom-right corner of a", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "simplex as true data. From left to right the discriminators were regularized using: nothing; WGAN", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 163, + 376, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 376, + 176 + ], + "score": 1.0, + "content": "Jacobian norm regularization; and, the relaxed sampling technique.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + } + ], + "index": 4.75 + }, + { + "type": "text", + "bbox": [ + 108, + 193, + 253, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 253, + 206 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 253, + 206 + ], + "score": 1.0, + "content": "This leads to the training objectives:", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 207, + 419, + 287 + ], + "lines": [ + { + "bbox": [ + 191, + 207, + 419, + 287 + ], + "spans": [ + { + "bbox": [ + 191, + 207, + 419, + 287 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { F ^ { * } = \\arg \\underset { F } { \\operatorname* { m i n } } \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) } \\\\ & { G ^ { * } = \\arg \\underset { G } { \\operatorname* { m i n } } \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) } \\\\ & { D _ { \\mathcal { X } } ^ { * } = \\arg \\underset { D _ { \\mathcal { X } } } { \\operatorname* { m a x } } \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) } \\\\ & { D _ { \\mathcal { Y } } ^ { * } = \\arg \\underset { D _ { \\mathcal { Y } } } { \\operatorname* { m a x } } \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}", + "type": "interline_equation", + "image_path": "3b82a0cdbd40f5c924b15112f28bc09fa13ba44932b7d3208bf802dd60028f30.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 191, + 207, + 419, + 220.33333333333334 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 191, + 220.33333333333334, + 419, + 233.66666666666669 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 191, + 233.66666666666669, + 419, + 247.00000000000003 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 191, + 247.00000000000003, + 419, + 260.33333333333337 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 191, + 260.33333333333337, + 419, + 273.6666666666667 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 191, + 273.6666666666667, + 419, + 287.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 295, + 506, + 340 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 506, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 174, + 308 + ], + "score": 1.0, + "content": "CycleGAN uses", + "type": "text" + }, + { + "bbox": [ + 174, + 296, + 192, + 307 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { \\mathrm { c y c } }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 294, + 506, + 308 + ], + "score": 1.0, + "content": "to avoid mode collapse by preserving reconstruction of mapping inputs from", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 307, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 505, + 318 + ], + "score": 1.0, + "content": "outputs. It has demonstrated excellent results in unpaired image translation between two visually", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 318, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 329 + ], + "score": 1.0, + "content": "similar categories. Our architecture is the first example of this unsupervised learning framework", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 327, + 349, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 349, + 342 + ], + "score": 1.0, + "content": "being successfully applied to discrete data such as language.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "title", + "bbox": [ + 108, + 354, + 215, + 367 + ], + "lines": [ + { + "bbox": [ + 104, + 354, + 216, + 369 + ], + "spans": [ + { + "bbox": [ + 104, + 354, + 216, + 369 + ], + "score": 1.0, + "content": "2 DISCRETE GANS", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 379, + 505, + 534 + ], + "lines": [ + { + "bbox": [ + 106, + 380, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 506, + 392 + ], + "score": 1.0, + "content": "Applying GANs to discrete data generation is still an open research problem that has seen great", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 391, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 505, + 402 + ], + "score": 1.0, + "content": "interest and development. The primary difficulty with training discrete data generators in a GAN", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 505, + 415 + ], + "score": 1.0, + "content": "setting is the lack of a gradient through a discrete node in the computation graph. The alternatives", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "score": 1.0, + "content": "to producing discrete outputs - for instance, generators producing a categorical distribution over", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 424, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 505, + 437 + ], + "score": 1.0, + "content": "discrete elements - are prone to uninformative discrimination (described below), in that, the dis-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "criminator may use an optimal discrimination criterion that is unrelated to the correctness of the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 444, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 104, + 444, + 506, + 459 + ], + "score": 1.0, + "content": "re-discretized generated data. In our example of a continuous distribution over discrete elements,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 455, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 339, + 470 + ], + "score": 1.0, + "content": "the produced samples all lie within the standard simplex", + "type": "text" + }, + { + "bbox": [ + 340, + 456, + 354, + 467 + ], + "score": 0.9, + "content": "\\Delta ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 455, + 421, + 470 + ], + "score": 1.0, + "content": "with dimension", + "type": "text" + }, + { + "bbox": [ + 421, + 457, + 429, + 467 + ], + "score": 0.76, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 455, + 506, + 470 + ], + "score": 1.0, + "content": "equal to the num-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "score": 1.0, + "content": "ber of elements in the distribution. In this case, samples from the true data distribution always lie", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 156, + 491 + ], + "score": 1.0, + "content": "on a vertex", + "type": "text" + }, + { + "bbox": [ + 156, + 480, + 167, + 489 + ], + "score": 0.84, + "content": "\\mathbf { v } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 479, + 506, + 491 + ], + "score": 1.0, + "content": "of the simplex, while any sub-optimal generator will produce samples within the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 488, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 179, + 503 + ], + "score": 1.0, + "content": "simplex’s interior", + "type": "text" + }, + { + "bbox": [ + 180, + 489, + 247, + 501 + ], + "score": 0.93, + "content": "{ \\Delta ^ { k } \\backslash \\{ \\bf { v } _ { 1 } , . . . , \\bf { v } _ { k } \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 488, + 506, + 503 + ], + "score": 1.0, + "content": ". In this example, a discriminator which performs uninformative", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 501, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 505, + 513 + ], + "score": 1.0, + "content": "discrimination might evaluate a sample’s membership in the vertices of the simplex as an optimal", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "discrimination criterion, which is entirely uninformative of the correctness of re-discretized samples", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 523, + 185, + 535 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 185, + 535 + ], + "score": 1.0, + "content": "from the generator.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 505, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "A number of solutions to training generators with discrete outputs have been proposed: SeqGAN (Yu", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "et al., 2017) uses the REINFORCE gradient estimate to train the generator; Boundary-seeking GANs", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "(Hjelm et al., 2017) and maximum-likelihood augmented GANs (Che et al., 2017) proposed a gra-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "dient approximation with low bias and variance that resembles the REINFORCE (Williams, 1992)", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "estimator. Gumbel-softmax GANs (Kusner & Hernandez-Lobato, 2016) replace discrete variables in ´", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "the simplex with continuous relaxations called Concrete (Maddison et al., 2016) or Gumbel-softmax", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 604, + 504, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 504, + 618 + ], + "score": 1.0, + "content": "(Jang et al., 2016) variables; WGANs (Arjovsky et al., 2017) were suggested as a remedy to the un-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "informative discrimination problem by ensuring that the discriminator’s rate of change with respect", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 627, + 262, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 262, + 639 + ], + "score": 1.0, + "content": "to its input is bound by some constant.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "score": 1.0, + "content": "Our work utilizes both the Wasserstein GAN (Gulrajani et al., 2017; Arjovsky et al., 2017) and relax-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "ation of discrete random variables (such as Concrete/Gumbel-softmax). It has been noted multiple", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "times in implementations of CycleGAN as well as in the original paper itself that the architecture", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "was sensitive to initialization and requires repeat attempts in order to converge to a satisfactory map-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "ping (Bansal & Rathore, 2017; Sari, 2017). Our architecture suffered the same instability before the", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "WGAN Jacobian norm regularization term was added to the discriminator’s loss. In addition, we", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "found that having the discriminator operate over embedding space instead of directly over softmax", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 721, + 358, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 358, + 733 + ], + "score": 1.0, + "content": "vectors produced by our generator has improved performance.", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 47.5 + } + ], + "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": [ + 196, + 57, + 414, + 138 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 196, + 57, + 414, + 138 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 196, + 57, + 414, + 138 + ], + "spans": [ + { + "bbox": [ + 196, + 57, + 414, + 138 + ], + "score": 0.13, + "type": "image", + "image_path": "812aeb636c0618e5ae1a7118c5a53c0189743ca4f6c24f4f68b67e47a40cac93.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 196, + 57, + 414, + 70.5 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 196, + 70.5, + 414, + 84.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 196, + 84.0, + 414, + 97.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 196, + 97.5, + 414, + 111.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 196, + 111.0, + 414, + 124.5 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 196, + 124.5, + 414, + 138.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 141, + 505, + 175 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 140, + 505, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 505, + 153 + ], + "score": 1.0, + "content": "Figure 2: Discriminators trained on the toy example of recognizing the bottom-right corner of a", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "simplex as true data. From left to right the discriminators were regularized using: nothing; WGAN", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 163, + 376, + 176 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 376, + 176 + ], + "score": 1.0, + "content": "Jacobian norm regularization; and, the relaxed sampling technique.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + } + ], + "index": 4.75 + }, + { + "type": "text", + "bbox": [ + 108, + 193, + 253, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 253, + 206 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 253, + 206 + ], + "score": 1.0, + "content": "This leads to the training objectives:", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 106, + 192, + 253, + 206 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 207, + 419, + 287 + ], + "lines": [ + { + "bbox": [ + 191, + 207, + 419, + 287 + ], + "spans": [ + { + "bbox": [ + 191, + 207, + 419, + 287 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { F ^ { * } = \\arg \\underset { F } { \\operatorname* { m i n } } \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) } \\\\ & { G ^ { * } = \\arg \\underset { G } { \\operatorname* { m i n } } \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) } \\\\ & { D _ { \\mathcal { X } } ^ { * } = \\arg \\underset { D _ { \\mathcal { X } } } { \\operatorname* { m a x } } \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) } \\\\ & { D _ { \\mathcal { Y } } ^ { * } = \\arg \\underset { D _ { \\mathcal { Y } } } { \\operatorname* { m a x } } \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}", + "type": "interline_equation", + "image_path": "3b82a0cdbd40f5c924b15112f28bc09fa13ba44932b7d3208bf802dd60028f30.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 191, + 207, + 419, + 220.33333333333334 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 191, + 220.33333333333334, + 419, + 233.66666666666669 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 191, + 233.66666666666669, + 419, + 247.00000000000003 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 191, + 247.00000000000003, + 419, + 260.33333333333337 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 191, + 260.33333333333337, + 419, + 273.6666666666667 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 191, + 273.6666666666667, + 419, + 287.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 295, + 506, + 340 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 506, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 174, + 308 + ], + "score": 1.0, + "content": "CycleGAN uses", + "type": "text" + }, + { + "bbox": [ + 174, + 296, + 192, + 307 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { \\mathrm { c y c } }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 294, + 506, + 308 + ], + "score": 1.0, + "content": "to avoid mode collapse by preserving reconstruction of mapping inputs from", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 307, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 505, + 318 + ], + "score": 1.0, + "content": "outputs. It has demonstrated excellent results in unpaired image translation between two visually", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 318, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 329 + ], + "score": 1.0, + "content": "similar categories. Our architecture is the first example of this unsupervised learning framework", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 327, + 349, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 349, + 342 + ], + "score": 1.0, + "content": "being successfully applied to discrete data such as language.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 294, + 506, + 342 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 354, + 215, + 367 + ], + "lines": [ + { + "bbox": [ + 104, + 354, + 216, + 369 + ], + "spans": [ + { + "bbox": [ + 104, + 354, + 216, + 369 + ], + "score": 1.0, + "content": "2 DISCRETE GANS", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 379, + 505, + 534 + ], + "lines": [ + { + "bbox": [ + 106, + 380, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 506, + 392 + ], + "score": 1.0, + "content": "Applying GANs to discrete data generation is still an open research problem that has seen great", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 391, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 505, + 402 + ], + "score": 1.0, + "content": "interest and development. The primary difficulty with training discrete data generators in a GAN", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 505, + 415 + ], + "score": 1.0, + "content": "setting is the lack of a gradient through a discrete node in the computation graph. The alternatives", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 506, + 425 + ], + "score": 1.0, + "content": "to producing discrete outputs - for instance, generators producing a categorical distribution over", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 424, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 505, + 437 + ], + "score": 1.0, + "content": "discrete elements - are prone to uninformative discrimination (described below), in that, the dis-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "criminator may use an optimal discrimination criterion that is unrelated to the correctness of the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 444, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 104, + 444, + 506, + 459 + ], + "score": 1.0, + "content": "re-discretized generated data. In our example of a continuous distribution over discrete elements,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 455, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 339, + 470 + ], + "score": 1.0, + "content": "the produced samples all lie within the standard simplex", + "type": "text" + }, + { + "bbox": [ + 340, + 456, + 354, + 467 + ], + "score": 0.9, + "content": "\\Delta ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 455, + 421, + 470 + ], + "score": 1.0, + "content": "with dimension", + "type": "text" + }, + { + "bbox": [ + 421, + 457, + 429, + 467 + ], + "score": 0.76, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 455, + 506, + 470 + ], + "score": 1.0, + "content": "equal to the num-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 506, + 480 + ], + "score": 1.0, + "content": "ber of elements in the distribution. In this case, samples from the true data distribution always lie", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 479, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 156, + 491 + ], + "score": 1.0, + "content": "on a vertex", + "type": "text" + }, + { + "bbox": [ + 156, + 480, + 167, + 489 + ], + "score": 0.84, + "content": "\\mathbf { v } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 479, + 506, + 491 + ], + "score": 1.0, + "content": "of the simplex, while any sub-optimal generator will produce samples within the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 488, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 179, + 503 + ], + "score": 1.0, + "content": "simplex’s interior", + "type": "text" + }, + { + "bbox": [ + 180, + 489, + 247, + 501 + ], + "score": 0.93, + "content": "{ \\Delta ^ { k } \\backslash \\{ \\bf { v } _ { 1 } , . . . , \\bf { v } _ { k } \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 488, + 506, + 503 + ], + "score": 1.0, + "content": ". In this example, a discriminator which performs uninformative", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 501, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 505, + 513 + ], + "score": 1.0, + "content": "discrimination might evaluate a sample’s membership in the vertices of the simplex as an optimal", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "discrimination criterion, which is entirely uninformative of the correctness of re-discretized samples", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 523, + 185, + 535 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 185, + 535 + ], + "score": 1.0, + "content": "from the generator.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 27.5, + "bbox_fs": [ + 104, + 380, + 506, + 535 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 505, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "A number of solutions to training generators with discrete outputs have been proposed: SeqGAN (Yu", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "et al., 2017) uses the REINFORCE gradient estimate to train the generator; Boundary-seeking GANs", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "(Hjelm et al., 2017) and maximum-likelihood augmented GANs (Che et al., 2017) proposed a gra-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "dient approximation with low bias and variance that resembles the REINFORCE (Williams, 1992)", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "estimator. Gumbel-softmax GANs (Kusner & Hernandez-Lobato, 2016) replace discrete variables in ´", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "the simplex with continuous relaxations called Concrete (Maddison et al., 2016) or Gumbel-softmax", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 604, + 504, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 504, + 618 + ], + "score": 1.0, + "content": "(Jang et al., 2016) variables; WGANs (Arjovsky et al., 2017) were suggested as a remedy to the un-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "informative discrimination problem by ensuring that the discriminator’s rate of change with respect", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 627, + 262, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 262, + 639 + ], + "score": 1.0, + "content": "to its input is bound by some constant.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 539, + 506, + 639 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 656 + ], + "score": 1.0, + "content": "Our work utilizes both the Wasserstein GAN (Gulrajani et al., 2017; Arjovsky et al., 2017) and relax-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "ation of discrete random variables (such as Concrete/Gumbel-softmax). It has been noted multiple", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "times in implementations of CycleGAN as well as in the original paper itself that the architecture", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "was sensitive to initialization and requires repeat attempts in order to converge to a satisfactory map-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "ping (Bansal & Rathore, 2017; Sari, 2017). Our architecture suffered the same instability before the", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "WGAN Jacobian norm regularization term was added to the discriminator’s loss. In addition, we", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "found that having the discriminator operate over embedding space instead of directly over softmax", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 721, + 358, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 358, + 733 + ], + "score": 1.0, + "content": "vectors produced by our generator has improved performance.", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 47.5, + "bbox_fs": [ + 105, + 643, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 214 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "Our hypothesis, which is justified by Proposition 1 below, is that the embedding vectors may act as", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "continuous relaxations of discrete random variables as small, noisy updates are applied throughout", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "score": 1.0, + "content": "training; Proposition 1 asserts that by replacing discrete random variables with continuous ones, our", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "discriminator is prevented from arbitrarily approximating a Dirac delta distribution. Figure 2 shows", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 139 + ], + "score": 1.0, + "content": "simple discriminators trained on the toy task of identify a single vertex of a simplex as true data; it is", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "clear that a lack of regularization leads to the discriminator collapsing to the vertex of the simplex,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "score": 1.0, + "content": "leaving approximately zero gradient everywhere; while the Jacobian regularization of Wasserstein", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 506, + 172 + ], + "score": 1.0, + "content": "GANs leads to the space covered by lines leading from the true data vertex to the generated data", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "having a lower rate of change (note that the gradient is still close to zero in the remaining area of the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 180, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 505, + 194 + ], + "score": 1.0, + "content": "simplex); and finally, replacing the discrete random variables of the true data with continuous sam-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 192, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 204 + ], + "score": 1.0, + "content": "ples about the vertex results in a much more gradual transition, which is desirable since it provides", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 203, + 294, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 294, + 215 + ], + "score": 1.0, + "content": "a stronger gradient signal from which to learn.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 219, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 106, + 220, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 505, + 232 + ], + "score": 1.0, + "content": "Unique to CycleGAN is the auxiliary cycle loss described in Section 1.3. The effect of this additional", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 230, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 505, + 243 + ], + "score": 1.0, + "content": "objective is the generated samples regularly being forced away from the discriminator’s minimum", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 504, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 504, + 254 + ], + "score": 1.0, + "content": "in favor of a mapping that better-satisfies reconstruction. For instance, it may be the case that the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 505, + 265 + ], + "score": 1.0, + "content": "discriminator favors a particular cipher mapping that is not bijective; in this case, the model will", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 264, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 276 + ], + "score": 1.0, + "content": "receive a strong signal from the cycle loss away from the discriminator’s minimum. In these cases", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 275, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 287 + ], + "score": 1.0, + "content": "where the model moves against the gradient it receives from the discriminator it may be the case", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 287, + 504, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 504, + 298 + ], + "score": 1.0, + "content": "that this region has near zero curvature (as is visually discernible from Figure 2); this is because the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 297, + 446, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 446, + 309 + ], + "score": 1.0, + "content": "WGAN curvature regularization (see Equation 3) has not been applied in this region.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 505, + 423 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "‘Curvature’ here refers to the curvature of the discriminator’s output with respect to its input; this", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 326, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 326, + 505, + 337 + ], + "score": 1.0, + "content": "curvature determines the strength of the training signal received by the generator. Low curvature", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "means little information for the generator to improve itself with. This motivates the benefits of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 347, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 505, + 359 + ], + "score": 1.0, + "content": "having strong curvature globally, as opposed to linearly between the generators samples and the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "true data. Kodali et al. (2017) proposes regularizing in all directions about the generated samples,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "which would likely remedy the vanishing gradient in our case as well; for our experiments, the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 378, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 506, + 393 + ], + "score": 1.0, + "content": "relaxed sampling technique proved effective. It should also be noted that Luc et al. (2016) propose", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "something similar to relaxed sampling whereby they replace the ground-truth discrete tokens with", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 104, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "a distribution over the vocabulary that distributes some of the mass across the remaining incorrect", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 411, + 138, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 138, + 425 + ], + "score": 1.0, + "content": "tokens.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 106, + 429, + 460, + 441 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 461, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 461, + 442 + ], + "score": 1.0, + "content": "Let us now introduce the definitions needed for the formal presentation of Proposition 1.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "title", + "bbox": [ + 107, + 445, + 156, + 456 + ], + "lines": [ + { + "bbox": [ + 106, + 445, + 158, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 158, + 456 + ], + "score": 1.0, + "content": "Definitions.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 132, + 463, + 505, + 610 + ], + "lines": [ + { + "bbox": [ + 134, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 134, + 463, + 477, + 475 + ], + "score": 1.0, + "content": "• (Continuous relaxation of a discrete set). A continuous relaxation of a discrete set", + "type": "text" + }, + { + "bbox": [ + 477, + 464, + 487, + 473 + ], + "score": 0.78, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "is a", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 473, + 376, + 486 + ], + "spans": [ + { + "bbox": [ + 141, + 474, + 290, + 486 + ], + "score": 1.0, + "content": "proper, path-connected metric space", + "type": "text" + }, + { + "bbox": [ + 290, + 473, + 299, + 483 + ], + "score": 0.83, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 474, + 342, + 486 + ], + "score": 1.0, + "content": "satisfying", + "type": "text" + }, + { + "bbox": [ + 342, + 473, + 373, + 484 + ], + "score": 0.91, + "content": "\\chi _ { \\mathrm { ~ C ~ } } \\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 474, + 376, + 486 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 131, + 492, + 504, + 507 + ], + "spans": [ + { + "bbox": [ + 131, + 492, + 454, + 507 + ], + "score": 1.0, + "content": "• (Rediscretization function). A rediscretization function is an injective function", + "type": "text" + }, + { + "bbox": [ + 454, + 492, + 504, + 504 + ], + "score": 0.9, + "content": "R : \\overline { { \\mathcal { X } } } \\to \\mathcal { X }", + "type": "inline_equation" + } + ], + "index": 34 + }, + { + "bbox": [ + 140, + 504, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 140, + 505, + 262, + 517 + ], + "score": 1.0, + "content": "from a continuous relaxation", + "type": "text" + }, + { + "bbox": [ + 263, + 504, + 272, + 514 + ], + "score": 0.83, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 505, + 344, + 517 + ], + "score": 1.0, + "content": "of discrete space", + "type": "text" + }, + { + "bbox": [ + 345, + 505, + 355, + 514 + ], + "score": 0.8, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 505, + 397, + 517 + ], + "score": 1.0, + "content": "satisfying", + "type": "text" + }, + { + "bbox": [ + 397, + 505, + 468, + 516 + ], + "score": 0.85, + "content": "\\forall x \\in \\mathcal { X } , \\exists \\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 505, + 483, + 517 + ], + "score": 1.0, + "content": "s.t.", + "type": "text" + }, + { + "bbox": [ + 483, + 505, + 505, + 516 + ], + "score": 0.82, + "content": "R \\equiv", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 142, + 515, + 392, + 528 + ], + "spans": [ + { + "bbox": [ + 142, + 518, + 149, + 525 + ], + "score": 0.46, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 515, + 163, + 528 + ], + "score": 1.0, + "content": "on", + "type": "text" + }, + { + "bbox": [ + 163, + 515, + 187, + 528 + ], + "score": 0.91, + "content": "B _ { \\epsilon } [ x ]", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 515, + 231, + 528 + ], + "score": 1.0, + "content": ". Note that", + "type": "text" + }, + { + "bbox": [ + 231, + 516, + 240, + 525 + ], + "score": 0.68, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 515, + 377, + 528 + ], + "score": 1.0, + "content": "defines an equivalence relation in", + "type": "text" + }, + { + "bbox": [ + 378, + 516, + 387, + 525 + ], + "score": 0.84, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 515, + 392, + 528 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 135, + 533, + 505, + 548 + ], + "spans": [ + { + "bbox": [ + 135, + 533, + 348, + 548 + ], + "score": 1.0, + "content": "• (Uninformative Discrimination). A discriminator", + "type": "text" + }, + { + "bbox": [ + 349, + 536, + 365, + 546 + ], + "score": 0.91, + "content": "D _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 533, + 505, + 548 + ], + "score": 1.0, + "content": "is said to perform uninformative", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 142, + 546, + 504, + 558 + ], + "spans": [ + { + "bbox": [ + 142, + 546, + 331, + 558 + ], + "score": 1.0, + "content": "discrimination under rediscretization function", + "type": "text" + }, + { + "bbox": [ + 331, + 546, + 340, + 556 + ], + "score": 0.69, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 546, + 356, + 558 + ], + "score": 1.0, + "content": "if:", + "type": "text" + }, + { + "bbox": [ + 356, + 546, + 425, + 557 + ], + "score": 0.88, + "content": "\\exists x \\in { \\mathcal { X } } , { \\bar { x } } \\in { \\overline { { \\mathcal { X } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 546, + 444, + 558 + ], + "score": 1.0, + "content": "s.t.", + "type": "text" + }, + { + "bbox": [ + 444, + 546, + 489, + 558 + ], + "score": 0.8, + "content": "R ( \\bar { x } ) = x", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 546, + 495, + 558 + ], + "score": 1.0, + "content": ")", + "type": "text" + }, + { + "bbox": [ + 496, + 546, + 504, + 556 + ], + "score": 0.43, + "content": "\\wedge", + "type": "inline_equation" + } + ], + "index": 38 + }, + { + "bbox": [ + 144, + 556, + 226, + 570 + ], + "spans": [ + { + "bbox": [ + 144, + 556, + 222, + 569 + ], + "score": 0.89, + "content": "( D _ { \\mathcal { X } } ( x ) \\not \\approx D _ { \\mathcal { X } } ( \\bar { x } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 557, + 226, + 570 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 136, + 576, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 136, + 576, + 505, + 589 + ], + "score": 1.0, + "content": "• (Continuous relaxation of a function). A continuous relaxation of a function over discrete", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 141, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 141, + 587, + 160, + 599 + ], + "score": 1.0, + "content": "sets", + "type": "text" + }, + { + "bbox": [ + 160, + 587, + 211, + 598 + ], + "score": 0.9, + "content": "F : \\mathcal { X } \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 587, + 291, + 599 + ], + "score": 1.0, + "content": "is another function", + "type": "text" + }, + { + "bbox": [ + 291, + 586, + 342, + 597 + ], + "score": 0.91, + "content": "\\overline { { F } } : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { Y } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 587, + 372, + 599 + ], + "score": 1.0, + "content": "(where", + "type": "text" + }, + { + "bbox": [ + 373, + 586, + 395, + 598 + ], + "score": 0.85, + "content": "\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 587, + 505, + 599 + ], + "score": 1.0, + "content": "are continuous relaxations", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 142, + 598, + 397, + 611 + ], + "spans": [ + { + "bbox": [ + 142, + 598, + 153, + 611 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 153, + 599, + 177, + 610 + ], + "score": 0.84, + "content": "x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 598, + 217, + 611 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 218, + 598, + 226, + 608 + ], + "score": 0.84, + "content": "\\overline { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 598, + 301, + 611 + ], + "score": 1.0, + "content": "is continuous and", + "type": "text" + }, + { + "bbox": [ + 301, + 598, + 394, + 610 + ], + "score": 0.91, + "content": "{ \\overline { { F } } } ( x ) = F ( x ) , \\forall x \\in { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 598, + 397, + 611 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 104, + 619, + 492, + 632 + ], + "lines": [ + { + "bbox": [ + 106, + 618, + 493, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 493, + 633 + ], + "score": 1.0, + "content": "The following proposition (proved in the Appendix) forms the theoretical basis of the technique.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 108, + 635, + 305, + 646 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 306, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 306, + 649 + ], + "score": 1.0, + "content": "Proposition 1 (Reliable Fooling Via Relaxation).", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 109, + 648, + 137, + 657 + ], + "lines": [ + { + "bbox": [ + 108, + 645, + 139, + 659 + ], + "spans": [ + { + "bbox": [ + 108, + 645, + 139, + 659 + ], + "score": 1.0, + "content": "Given:", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45 + }, + { + "type": "text", + "bbox": [ + 132, + 661, + 413, + 733 + ], + "lines": [ + { + "bbox": [ + 132, + 661, + 361, + 674 + ], + "spans": [ + { + "bbox": [ + 132, + 661, + 205, + 674 + ], + "score": 1.0, + "content": "• discrete spaces", + "type": "text" + }, + { + "bbox": [ + 205, + 662, + 227, + 673 + ], + "score": 0.89, + "content": "\\mathcal { X } , \\mathcal { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 661, + 339, + 674 + ], + "score": 1.0, + "content": "and continuous relaxations", + "type": "text" + }, + { + "bbox": [ + 339, + 661, + 361, + 673 + ], + "score": 0.66, + "content": "\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }", + "type": "inline_equation" + } + ], + "index": 46 + }, + { + "bbox": [ + 131, + 680, + 412, + 694 + ], + "spans": [ + { + "bbox": [ + 131, + 680, + 187, + 694 + ], + "score": 1.0, + "content": "• generators", + "type": "text" + }, + { + "bbox": [ + 188, + 680, + 289, + 693 + ], + "score": 0.91, + "content": "F : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { V } } } , G : \\overline { { \\mathcal { V } } } \\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 680, + 372, + 694 + ], + "score": 1.0, + "content": "bijections satisfying", + "type": "text" + }, + { + "bbox": [ + 372, + 681, + 412, + 691 + ], + "score": 0.84, + "content": "F = G ^ { - 1 }", + "type": "inline_equation" + } + ], + "index": 47 + }, + { + "bbox": [ + 132, + 699, + 382, + 714 + ], + "spans": [ + { + "bbox": [ + 132, + 699, + 236, + 714 + ], + "score": 1.0, + "content": "• discrete discriminators", + "type": "text" + }, + { + "bbox": [ + 237, + 702, + 272, + 713 + ], + "score": 0.92, + "content": "D _ { \\mathcal { X } } , D _ { \\mathcal { Y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 699, + 362, + 714 + ], + "score": 1.0, + "content": "both optimal for fixed", + "type": "text" + }, + { + "bbox": [ + 362, + 702, + 382, + 712 + ], + "score": 0.83, + "content": "F , G", + "type": "inline_equation" + } + ], + "index": 48 + }, + { + "bbox": [ + 132, + 718, + 280, + 735 + ], + "spans": [ + { + "bbox": [ + 132, + 718, + 246, + 735 + ], + "score": 1.0, + "content": "• rediscretization functions", + "type": "text" + }, + { + "bbox": [ + 246, + 721, + 280, + 732 + ], + "score": 0.9, + "content": "R _ { \\mathcal { X } } , R _ { \\mathcal { Y } }", + "type": "inline_equation" + } + ], + "index": 49 + } + ], + "index": 47.5 + } + ], + "page_idx": 4, + "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": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 214 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "Our hypothesis, which is justified by Proposition 1 below, is that the embedding vectors may act as", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "continuous relaxations of discrete random variables as small, noisy updates are applied throughout", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "score": 1.0, + "content": "training; Proposition 1 asserts that by replacing discrete random variables with continuous ones, our", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "discriminator is prevented from arbitrarily approximating a Dirac delta distribution. Figure 2 shows", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 139 + ], + "score": 1.0, + "content": "simple discriminators trained on the toy task of identify a single vertex of a simplex as true data; it is", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "clear that a lack of regularization leads to the discriminator collapsing to the vertex of the simplex,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "score": 1.0, + "content": "leaving approximately zero gradient everywhere; while the Jacobian regularization of Wasserstein", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 506, + 172 + ], + "score": 1.0, + "content": "GANs leads to the space covered by lines leading from the true data vertex to the generated data", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "having a lower rate of change (note that the gradient is still close to zero in the remaining area of the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 180, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 505, + 194 + ], + "score": 1.0, + "content": "simplex); and finally, replacing the discrete random variables of the true data with continuous sam-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 192, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 204 + ], + "score": 1.0, + "content": "ples about the vertex results in a much more gradual transition, which is desirable since it provides", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 203, + 294, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 294, + 215 + ], + "score": 1.0, + "content": "a stronger gradient signal from which to learn.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 83, + 506, + 215 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 219, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 106, + 220, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 505, + 232 + ], + "score": 1.0, + "content": "Unique to CycleGAN is the auxiliary cycle loss described in Section 1.3. The effect of this additional", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 230, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 505, + 243 + ], + "score": 1.0, + "content": "objective is the generated samples regularly being forced away from the discriminator’s minimum", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 504, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 504, + 254 + ], + "score": 1.0, + "content": "in favor of a mapping that better-satisfies reconstruction. For instance, it may be the case that the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 505, + 265 + ], + "score": 1.0, + "content": "discriminator favors a particular cipher mapping that is not bijective; in this case, the model will", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 264, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 276 + ], + "score": 1.0, + "content": "receive a strong signal from the cycle loss away from the discriminator’s minimum. In these cases", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 275, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 287 + ], + "score": 1.0, + "content": "where the model moves against the gradient it receives from the discriminator it may be the case", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 287, + 504, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 504, + 298 + ], + "score": 1.0, + "content": "that this region has near zero curvature (as is visually discernible from Figure 2); this is because the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 297, + 446, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 446, + 309 + ], + "score": 1.0, + "content": "WGAN curvature regularization (see Equation 3) has not been applied in this region.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 220, + 505, + 309 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 505, + 423 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "‘Curvature’ here refers to the curvature of the discriminator’s output with respect to its input; this", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 326, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 326, + 505, + 337 + ], + "score": 1.0, + "content": "curvature determines the strength of the training signal received by the generator. Low curvature", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "means little information for the generator to improve itself with. This motivates the benefits of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 347, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 505, + 359 + ], + "score": 1.0, + "content": "having strong curvature globally, as opposed to linearly between the generators samples and the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "true data. Kodali et al. (2017) proposes regularizing in all directions about the generated samples,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "which would likely remedy the vanishing gradient in our case as well; for our experiments, the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 378, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 506, + 393 + ], + "score": 1.0, + "content": "relaxed sampling technique proved effective. It should also be noted that Luc et al. (2016) propose", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "something similar to relaxed sampling whereby they replace the ground-truth discrete tokens with", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 104, + 401, + 506, + 414 + ], + "score": 1.0, + "content": "a distribution over the vocabulary that distributes some of the mass across the remaining incorrect", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 411, + 138, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 138, + 425 + ], + "score": 1.0, + "content": "tokens.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 24.5, + "bbox_fs": [ + 104, + 313, + 506, + 425 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 429, + 460, + 441 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 461, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 461, + 442 + ], + "score": 1.0, + "content": "Let us now introduce the definitions needed for the formal presentation of Proposition 1.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 428, + 461, + 442 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 445, + 156, + 456 + ], + "lines": [ + { + "bbox": [ + 106, + 445, + 158, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 158, + 456 + ], + "score": 1.0, + "content": "Definitions.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "list", + "bbox": [ + 132, + 463, + 505, + 610 + ], + "lines": [ + { + "bbox": [ + 134, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 134, + 463, + 477, + 475 + ], + "score": 1.0, + "content": "• (Continuous relaxation of a discrete set). A continuous relaxation of a discrete set", + "type": "text" + }, + { + "bbox": [ + 477, + 464, + 487, + 473 + ], + "score": 0.78, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "is a", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 473, + 376, + 486 + ], + "spans": [ + { + "bbox": [ + 141, + 474, + 290, + 486 + ], + "score": 1.0, + "content": "proper, path-connected metric space", + "type": "text" + }, + { + "bbox": [ + 290, + 473, + 299, + 483 + ], + "score": 0.83, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 474, + 342, + 486 + ], + "score": 1.0, + "content": "satisfying", + "type": "text" + }, + { + "bbox": [ + 342, + 473, + 373, + 484 + ], + "score": 0.91, + "content": "\\chi _ { \\mathrm { ~ C ~ } } \\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 474, + 376, + 486 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33, + "is_list_end_line": true + }, + { + "bbox": [ + 131, + 492, + 504, + 507 + ], + "spans": [ + { + "bbox": [ + 131, + 492, + 454, + 507 + ], + "score": 1.0, + "content": "• (Rediscretization function). A rediscretization function is an injective function", + "type": "text" + }, + { + "bbox": [ + 454, + 492, + 504, + 504 + ], + "score": 0.9, + "content": "R : \\overline { { \\mathcal { X } } } \\to \\mathcal { X }", + "type": "inline_equation" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 140, + 504, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 140, + 505, + 262, + 517 + ], + "score": 1.0, + "content": "from a continuous relaxation", + "type": "text" + }, + { + "bbox": [ + 263, + 504, + 272, + 514 + ], + "score": 0.83, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 505, + 344, + 517 + ], + "score": 1.0, + "content": "of discrete space", + "type": "text" + }, + { + "bbox": [ + 345, + 505, + 355, + 514 + ], + "score": 0.8, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 505, + 397, + 517 + ], + "score": 1.0, + "content": "satisfying", + "type": "text" + }, + { + "bbox": [ + 397, + 505, + 468, + 516 + ], + "score": 0.85, + "content": "\\forall x \\in \\mathcal { X } , \\exists \\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 505, + 483, + 517 + ], + "score": 1.0, + "content": "s.t.", + "type": "text" + }, + { + "bbox": [ + 483, + 505, + 505, + 516 + ], + "score": 0.82, + "content": "R \\equiv", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 142, + 515, + 392, + 528 + ], + "spans": [ + { + "bbox": [ + 142, + 518, + 149, + 525 + ], + "score": 0.46, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 515, + 163, + 528 + ], + "score": 1.0, + "content": "on", + "type": "text" + }, + { + "bbox": [ + 163, + 515, + 187, + 528 + ], + "score": 0.91, + "content": "B _ { \\epsilon } [ x ]", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 515, + 231, + 528 + ], + "score": 1.0, + "content": ". Note that", + "type": "text" + }, + { + "bbox": [ + 231, + 516, + 240, + 525 + ], + "score": 0.68, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 515, + 377, + 528 + ], + "score": 1.0, + "content": "defines an equivalence relation in", + "type": "text" + }, + { + "bbox": [ + 378, + 516, + 387, + 525 + ], + "score": 0.84, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 515, + 392, + 528 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 135, + 533, + 505, + 548 + ], + "spans": [ + { + "bbox": [ + 135, + 533, + 348, + 548 + ], + "score": 1.0, + "content": "• (Uninformative Discrimination). A discriminator", + "type": "text" + }, + { + "bbox": [ + 349, + 536, + 365, + 546 + ], + "score": 0.91, + "content": "D _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 533, + 505, + 548 + ], + "score": 1.0, + "content": "is said to perform uninformative", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 142, + 546, + 504, + 558 + ], + "spans": [ + { + "bbox": [ + 142, + 546, + 331, + 558 + ], + "score": 1.0, + "content": "discrimination under rediscretization function", + "type": "text" + }, + { + "bbox": [ + 331, + 546, + 340, + 556 + ], + "score": 0.69, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 546, + 356, + 558 + ], + "score": 1.0, + "content": "if:", + "type": "text" + }, + { + "bbox": [ + 356, + 546, + 425, + 557 + ], + "score": 0.88, + "content": "\\exists x \\in { \\mathcal { X } } , { \\bar { x } } \\in { \\overline { { \\mathcal { X } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 546, + 444, + 558 + ], + "score": 1.0, + "content": "s.t.", + "type": "text" + }, + { + "bbox": [ + 444, + 546, + 489, + 558 + ], + "score": 0.8, + "content": "R ( \\bar { x } ) = x", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 546, + 495, + 558 + ], + "score": 1.0, + "content": ")", + "type": "text" + }, + { + "bbox": [ + 496, + 546, + 504, + 556 + ], + "score": 0.43, + "content": "\\wedge", + "type": "inline_equation" + } + ], + "index": 38 + }, + { + "bbox": [ + 144, + 556, + 226, + 570 + ], + "spans": [ + { + "bbox": [ + 144, + 556, + 222, + 569 + ], + "score": 0.89, + "content": "( D _ { \\mathcal { X } } ( x ) \\not \\approx D _ { \\mathcal { X } } ( \\bar { x } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 557, + 226, + 570 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39, + "is_list_end_line": true + }, + { + "bbox": [ + 136, + 576, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 136, + 576, + 505, + 589 + ], + "score": 1.0, + "content": "• (Continuous relaxation of a function). A continuous relaxation of a function over discrete", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 141, + 587, + 160, + 599 + ], + "score": 1.0, + "content": "sets", + "type": "text" + }, + { + "bbox": [ + 160, + 587, + 211, + 598 + ], + "score": 0.9, + "content": "F : \\mathcal { X } \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 587, + 291, + 599 + ], + "score": 1.0, + "content": "is another function", + "type": "text" + }, + { + "bbox": [ + 291, + 586, + 342, + 597 + ], + "score": 0.91, + "content": "\\overline { { F } } : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { Y } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 587, + 372, + 599 + ], + "score": 1.0, + "content": "(where", + "type": "text" + }, + { + "bbox": [ + 373, + 586, + 395, + 598 + ], + "score": 0.85, + "content": "\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 587, + 505, + 599 + ], + "score": 1.0, + "content": "are continuous relaxations", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 142, + 598, + 397, + 611 + ], + "spans": [ + { + "bbox": [ + 142, + 598, + 153, + 611 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 153, + 599, + 177, + 610 + ], + "score": 0.84, + "content": "x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 598, + 217, + 611 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 218, + 598, + 226, + 608 + ], + "score": 0.84, + "content": "\\overline { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 598, + 301, + 611 + ], + "score": 1.0, + "content": "is continuous and", + "type": "text" + }, + { + "bbox": [ + 301, + 598, + 394, + 610 + ], + "score": 0.91, + "content": "{ \\overline { { F } } } ( x ) = F ( x ) , \\forall x \\in { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 598, + 397, + 611 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 42, + "is_list_end_line": true + } + ], + "index": 37, + "bbox_fs": [ + 131, + 463, + 505, + 611 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 619, + 492, + 632 + ], + "lines": [ + { + "bbox": [ + 106, + 618, + 493, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 493, + 633 + ], + "score": 1.0, + "content": "The following proposition (proved in the Appendix) forms the theoretical basis of the technique.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43, + "bbox_fs": [ + 106, + 618, + 493, + 633 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 635, + 305, + 646 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 306, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 306, + 649 + ], + "score": 1.0, + "content": "Proposition 1 (Reliable Fooling Via Relaxation).", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 633, + 306, + 649 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 648, + 137, + 657 + ], + "lines": [ + { + "bbox": [ + 108, + 645, + 139, + 659 + ], + "spans": [ + { + "bbox": [ + 108, + 645, + 139, + 659 + ], + "score": 1.0, + "content": "Given:", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45, + "bbox_fs": [ + 108, + 645, + 139, + 659 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 661, + 413, + 733 + ], + "lines": [ + { + "bbox": [ + 132, + 661, + 361, + 674 + ], + "spans": [ + { + "bbox": [ + 132, + 661, + 205, + 674 + ], + "score": 1.0, + "content": "• discrete spaces", + "type": "text" + }, + { + "bbox": [ + 205, + 662, + 227, + 673 + ], + "score": 0.89, + "content": "\\mathcal { X } , \\mathcal { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 661, + 339, + 674 + ], + "score": 1.0, + "content": "and continuous relaxations", + "type": "text" + }, + { + "bbox": [ + 339, + 661, + 361, + 673 + ], + "score": 0.66, + "content": "\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }", + "type": "inline_equation" + } + ], + "index": 46 + }, + { + "bbox": [ + 131, + 680, + 412, + 694 + ], + "spans": [ + { + "bbox": [ + 131, + 680, + 187, + 694 + ], + "score": 1.0, + "content": "• generators", + "type": "text" + }, + { + "bbox": [ + 188, + 680, + 289, + 693 + ], + "score": 0.91, + "content": "F : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { V } } } , G : \\overline { { \\mathcal { V } } } \\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 680, + 372, + 694 + ], + "score": 1.0, + "content": "bijections satisfying", + "type": "text" + }, + { + "bbox": [ + 372, + 681, + 412, + 691 + ], + "score": 0.84, + "content": "F = G ^ { - 1 }", + "type": "inline_equation" + } + ], + "index": 47 + }, + { + "bbox": [ + 132, + 699, + 382, + 714 + ], + "spans": [ + { + "bbox": [ + 132, + 699, + 236, + 714 + ], + "score": 1.0, + "content": "• discrete discriminators", + "type": "text" + }, + { + "bbox": [ + 237, + 702, + 272, + 713 + ], + "score": 0.92, + "content": "D _ { \\mathcal { X } } , D _ { \\mathcal { Y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 699, + 362, + 714 + ], + "score": 1.0, + "content": "both optimal for fixed", + "type": "text" + }, + { + "bbox": [ + 362, + 702, + 382, + 712 + ], + "score": 0.83, + "content": "F , G", + "type": "inline_equation" + } + ], + "index": 48 + }, + { + "bbox": [ + 132, + 718, + 280, + 735 + ], + "spans": [ + { + "bbox": [ + 132, + 718, + 246, + 735 + ], + "score": 1.0, + "content": "• rediscretization functions", + "type": "text" + }, + { + "bbox": [ + 246, + 721, + 280, + 732 + ], + "score": 0.9, + "content": "R _ { \\mathcal { X } } , R _ { \\mathcal { Y } }", + "type": "inline_equation" + } + ], + "index": 49 + } + ], + "index": 47.5, + "bbox_fs": [ + 131, + 661, + 412, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 146, + 96 + ], + "score": 1.0, + "content": "Suppose:", + "type": "text" + }, + { + "bbox": [ + 146, + 83, + 155, + 92 + ], + "score": 0.73, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 82, + 416, + 96 + ], + "score": 1.0, + "content": "is approximately volume preserving in a small region about each", + "type": "text" + }, + { + "bbox": [ + 416, + 83, + 443, + 93 + ], + "score": 0.88, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 82, + 505, + 96 + ], + "score": 1.0, + "content": ". Consequently", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 272, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 186, + 106 + ], + "score": 1.0, + "content": "the same is true for", + "type": "text" + }, + { + "bbox": [ + 186, + 94, + 195, + 104 + ], + "score": 0.69, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 93, + 243, + 106 + ], + "score": 1.0, + "content": "about each", + "type": "text" + }, + { + "bbox": [ + 243, + 94, + 268, + 105 + ], + "score": 0.9, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 93, + 272, + 106 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 109, + 105, + 503, + 126 + ], + "lines": [ + { + "bbox": [ + 106, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 357, + 117 + ], + "score": 1.0, + "content": "If: during training, we replace discrete random variables from", + "type": "text" + }, + { + "bbox": [ + 357, + 105, + 367, + 114 + ], + "score": 0.68, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "which lie in the continuous metric", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 298, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 115, + 132, + 128 + ], + "score": 1.0, + "content": "space", + "type": "text" + }, + { + "bbox": [ + 132, + 115, + 141, + 125 + ], + "score": 0.83, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 115, + 298, + 128 + ], + "score": 1.0, + "content": "with samples from regions about them.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 108, + 127, + 502, + 150 + ], + "lines": [ + { + "bbox": [ + 106, + 126, + 504, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 126, + 274, + 140 + ], + "score": 1.0, + "content": "Then: the optimal relaxed discriminators", + "type": "text" + }, + { + "bbox": [ + 274, + 127, + 291, + 139 + ], + "score": 0.9, + "content": "D _ { \\overline { { \\mathcal { X } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 126, + 309, + 140 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 310, + 127, + 326, + 140 + ], + "score": 0.9, + "content": "D _ { \\overline { { { y } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 126, + 475, + 140 + ], + "score": 1.0, + "content": "have a non-empty region about each", + "type": "text" + }, + { + "bbox": [ + 475, + 127, + 504, + 137 + ], + "score": 0.88, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 138, + 429, + 153 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 124, + 153 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 139, + 150, + 150 + ], + "score": 0.91, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 138, + 348, + 153 + ], + "score": 1.0, + "content": "where they are expected to assign values close to", + "type": "text" + }, + { + "bbox": [ + 349, + 138, + 378, + 151 + ], + "score": 0.92, + "content": "D _ { \\mathcal { X } } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 138, + 397, + 153 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 398, + 138, + 426, + 151 + ], + "score": 0.92, + "content": "D _ { \\mathcal { Y } } ( y )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 138, + 429, + 153 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 106, + 159, + 505, + 215 + ], + "lines": [ + { + "bbox": [ + 106, + 159, + 504, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 159, + 504, + 171 + ], + "score": 1.0, + "content": "Figure 3 compares a model trained with embedding vectors versus one with only the softmax out-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 169, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 505, + 183 + ], + "score": 1.0, + "content": "puts. It becomes clear on a harder task, such as Vigenere, that the embeddings vastly outperforms `", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 181, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 505, + 194 + ], + "score": 1.0, + "content": "softmax in terms of speed of convergence and final accuracy; however we found that the simpler task", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 191, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 505, + 205 + ], + "score": 1.0, + "content": "of a shift cipher showed little difference between embeddings and softmax, suggesting an increase", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 203, + 495, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 495, + 217 + ], + "score": 1.0, + "content": "in task complexity increases the benefits provided by the stronger gradient signal of embeddings.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8 + }, + { + "type": "title", + "bbox": [ + 107, + 230, + 173, + 243 + ], + "lines": [ + { + "bbox": [ + 104, + 228, + 175, + 246 + ], + "spans": [ + { + "bbox": [ + 104, + 228, + 175, + 246 + ], + "score": 1.0, + "content": "3 METHOD", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 107, + 254, + 187, + 267 + ], + "lines": [ + { + "bbox": [ + 105, + 254, + 189, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 189, + 268 + ], + "score": 1.0, + "content": "3.1 CIPHERGAN", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 506, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 289 + ], + "score": 1.0, + "content": "GANs applied to text data have yet to produce truly convincing results (Kawthekar et al.). Previous", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 285, + 506, + 301 + ], + "spans": [ + { + "bbox": [ + 104, + 285, + 506, + 301 + ], + "score": 1.0, + "content": "attempts at discrete sequence generation with GANs have generally utilized a generator outputting", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 297, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 297, + 505, + 310 + ], + "score": 1.0, + "content": "a probability distribution over the token space (Gulrajani et al., 2017; Yu et al., 2017; Hjelm et al.,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 308, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 506, + 322 + ], + "score": 1.0, + "content": "2017). This leads to the discriminator receiving a sequence of discrete random variables from the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 319, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 506, + 333 + ], + "score": 1.0, + "content": "data distribution, and a sequence of continuous random variables from the generator distribution;", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "making the task of discrimination trivial and uninformative of the underlying data distribution. In", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 342, + 505, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 505, + 355 + ], + "score": 1.0, + "content": "order to avoid such a scenario, we perform all discrimination within the embedding space by allow-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 350, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 104, + 350, + 506, + 367 + ], + "score": 1.0, + "content": "ing the generator’s output distribution to define a convex combination of corresponding embeddings.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 363, + 245, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 245, + 376 + ], + "score": 1.0, + "content": "This leads to the following losses:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17 + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 379, + 460, + 445 + ], + "lines": [ + { + "bbox": [ + 150, + 379, + 460, + 445 + ], + "spans": [ + { + "bbox": [ + 150, + 379, + 460, + 445 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { \\boldsymbol { y } \\sim \\mathcal { V } } [ \\log D _ { \\mathcal { V } } ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad + \\mathbb { E } _ { \\boldsymbol { x } \\sim \\mathcal { X } } [ \\log ( 1 - D _ { \\mathcal { V } } ( \\boldsymbol { F } ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ) ] } \\\\ & { \\qquad \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { \\boldsymbol { x } \\sim \\mathcal { X } } [ \\| G ( F ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) - \\boldsymbol { x } \\| _ { 1 } ] } \\\\ & { \\qquad + \\mathbb { E } _ { \\boldsymbol { y } \\sim \\mathcal { Y } } [ \\| F ( G ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) - \\boldsymbol { y } \\| _ { 1 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "9bb537560a1679e50af0947b65ca13eecb7bc7c7286a355b76dc9cd558f312bc.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 150, + 379, + 460, + 401.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 150, + 401.0, + 460, + 423.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 150, + 423.0, + 460, + 445.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 448, + 506, + 591 + ], + "lines": [ + { + "bbox": [ + 106, + 448, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 328, + 461 + ], + "score": 1.0, + "content": "We perform an inner product between the embeddings", + "type": "text" + }, + { + "bbox": [ + 328, + 448, + 356, + 460 + ], + "score": 0.91, + "content": "W _ { E m b }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 448, + 465, + 461 + ], + "score": 1.0, + "content": "and the one-hot vectors in", + "type": "text" + }, + { + "bbox": [ + 466, + 451, + 473, + 458 + ], + "score": 0.75, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 448, + 506, + 461 + ], + "score": 1.0, + "content": "as well", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 460, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 415, + 471 + ], + "score": 1.0, + "content": "as between the embeddings and the softmax vectors produced by generators", + "type": "text" + }, + { + "bbox": [ + 415, + 460, + 424, + 469 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 460, + 443, + 471 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 443, + 460, + 452, + 469 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 460, + 505, + 471 + ], + "score": 1.0, + "content": ". The former", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 470, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 506, + 483 + ], + "score": 1.0, + "content": "is equivalent to a lookup operation over the table of embedding vectors, while the latter is a convex", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 479, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 104, + 479, + 381, + 495 + ], + "score": 1.0, + "content": "combination between all vectors in the vocabulary. The embeddings", + "type": "text" + }, + { + "bbox": [ + 381, + 481, + 410, + 492 + ], + "score": 0.92, + "content": "W _ { E m b }", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 479, + 506, + 495 + ], + "score": 1.0, + "content": "are trained at each step", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 492, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 158, + 506 + ], + "score": 1.0, + "content": "to minimize", + "type": "text" + }, + { + "bbox": [ + 159, + 492, + 177, + 504 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { \\mathrm { c y c } }", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 492, + 239, + 506 + ], + "score": 1.0, + "content": "and maximize", + "type": "text" + }, + { + "bbox": [ + 239, + 492, + 263, + 504 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { \\mathrm { G A N } }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 492, + 506, + 506 + ], + "score": 1.0, + "content": ", meaning the embeddings are easily mapped from and are", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 503, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 505, + 516 + ], + "score": 1.0, + "content": "easy to discriminate. As was discussed in Section 2, training with the above loss functions was", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 514, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 505, + 527 + ], + "score": 1.0, + "content": "unstable, with approximately three of every four experiments failing to produce compelling results.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 524, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 505, + 538 + ], + "score": 1.0, + "content": "This is a problem we observed with the original CycleGAN horse-zebra experiment, and one that has", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 506, + 549 + ], + "score": 1.0, + "content": "been noted by multiple re-implementations online (Bansal & Rathore, 2017; Sari, 2017). We were", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 546, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 505, + 560 + ], + "score": 1.0, + "content": "able to significantly increase the stability by training the discriminator loss along with the Lipschitz", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "conditioning term from the improved Wasserstein GAN (Gulrajani et al., 2017) (see Equation 3", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "score": 1.0, + "content": "and Fedus et al. (2017)), resulting in the following loss (DualGAN (Yi et al., 2017) opted to use", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 579, + 315, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 315, + 592 + ], + "score": 1.0, + "content": "weight-clipping to enforce the Lipschitz condition):", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 31 + }, + { + "type": "interline_equation", + "bbox": [ + 176, + 595, + 435, + 646 + ], + "lines": [ + { + "bbox": [ + 176, + 595, + 435, + 646 + ], + "spans": [ + { + "bbox": [ + 176, + 595, + 435, + 646 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { y \\sim \\mathcal { V } } [ D _ { \\mathcal { V } } ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad - \\mathbb { E } _ { \\boldsymbol { x } \\sim \\boldsymbol { x } } [ D _ { \\mathcal { V } } ( F ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad + \\alpha \\cdot \\mathbb { E } _ { \\hat { \\boldsymbol { y } } \\sim \\hat { \\mathcal { V } } } [ ( \\| \\nabla _ { \\hat { \\boldsymbol { y } } } D _ { \\mathcal { V } } ( \\hat { \\boldsymbol { y } } ) \\| _ { 2 } - 1 ) ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "8323112c9ee5c65285ce3c59c76b8c97dd9dc84a8f713e718f53ee86eb74be17.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 176, + 595, + 435, + 612.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 176, + 612.0, + 435, + 629.0 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 176, + 629.0, + 435, + 646.0 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 649, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "As a consequence of Proposition 1, discriminators trained on non-stationary embeddings will be", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "unable to approximate Dirac delta distributions to arbitrary accuracy; implying there are dedicated", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 107, + 671, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 107, + 671, + 233, + 683 + ], + "score": 1.0, + "content": "‘safe-zones’ about members of", + "type": "text" + }, + { + "bbox": [ + 233, + 672, + 242, + 680 + ], + "score": 0.79, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 671, + 505, + 683 + ], + "score": 1.0, + "content": "where the generator can reliably fool the discriminator and unin-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 681, + 261, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 261, + 694 + ], + "score": 1.0, + "content": "formative discrimination is prevented.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5 + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 504, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 504, + 711 + ], + "score": 1.0, + "content": "In our experiments, we jointly train the embedding vectors as parameters of the model. The gradi-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "ent updates applied to these vectors introduces noise between training iterations; we observed that", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "embedding vectors tend to remain in a bounded region after the initial steps of training. We found", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46 + } + ], + "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 2018", + "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": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 146, + 96 + ], + "score": 1.0, + "content": "Suppose:", + "type": "text" + }, + { + "bbox": [ + 146, + 83, + 155, + 92 + ], + "score": 0.73, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 82, + 416, + 96 + ], + "score": 1.0, + "content": "is approximately volume preserving in a small region about each", + "type": "text" + }, + { + "bbox": [ + 416, + 83, + 443, + 93 + ], + "score": 0.88, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 82, + 505, + 96 + ], + "score": 1.0, + "content": ". Consequently", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 272, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 186, + 106 + ], + "score": 1.0, + "content": "the same is true for", + "type": "text" + }, + { + "bbox": [ + 186, + 94, + 195, + 104 + ], + "score": 0.69, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 93, + 243, + 106 + ], + "score": 1.0, + "content": "about each", + "type": "text" + }, + { + "bbox": [ + 243, + 94, + 268, + 105 + ], + "score": 0.9, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 93, + 272, + 106 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 105, + 503, + 126 + ], + "lines": [ + { + "bbox": [ + 106, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 357, + 117 + ], + "score": 1.0, + "content": "If: during training, we replace discrete random variables from", + "type": "text" + }, + { + "bbox": [ + 357, + 105, + 367, + 114 + ], + "score": 0.68, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "which lie in the continuous metric", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 298, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 115, + 132, + 128 + ], + "score": 1.0, + "content": "space", + "type": "text" + }, + { + "bbox": [ + 132, + 115, + 141, + 125 + ], + "score": 0.83, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 115, + 298, + 128 + ], + "score": 1.0, + "content": "with samples from regions about them.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 106, + 104, + 505, + 128 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 127, + 502, + 150 + ], + "lines": [ + { + "bbox": [ + 106, + 126, + 504, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 126, + 274, + 140 + ], + "score": 1.0, + "content": "Then: the optimal relaxed discriminators", + "type": "text" + }, + { + "bbox": [ + 274, + 127, + 291, + 139 + ], + "score": 0.9, + "content": "D _ { \\overline { { \\mathcal { X } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 126, + 309, + 140 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 310, + 127, + 326, + 140 + ], + "score": 0.9, + "content": "D _ { \\overline { { { y } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 126, + 475, + 140 + ], + "score": 1.0, + "content": "have a non-empty region about each", + "type": "text" + }, + { + "bbox": [ + 475, + 127, + 504, + 137 + ], + "score": 0.88, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 138, + 429, + 153 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 124, + 153 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 139, + 150, + 150 + ], + "score": 0.91, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 138, + 348, + 153 + ], + "score": 1.0, + "content": "where they are expected to assign values close to", + "type": "text" + }, + { + "bbox": [ + 349, + 138, + 378, + 151 + ], + "score": 0.92, + "content": "D _ { \\mathcal { X } } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 138, + 397, + 153 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 398, + 138, + 426, + 151 + ], + "score": 0.92, + "content": "D _ { \\mathcal { Y } } ( y )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 138, + 429, + 153 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 106, + 126, + 504, + 153 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 159, + 505, + 215 + ], + "lines": [ + { + "bbox": [ + 106, + 159, + 504, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 159, + 504, + 171 + ], + "score": 1.0, + "content": "Figure 3 compares a model trained with embedding vectors versus one with only the softmax out-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 169, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 505, + 183 + ], + "score": 1.0, + "content": "puts. It becomes clear on a harder task, such as Vigenere, that the embeddings vastly outperforms `", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 181, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 505, + 194 + ], + "score": 1.0, + "content": "softmax in terms of speed of convergence and final accuracy; however we found that the simpler task", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 191, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 505, + 205 + ], + "score": 1.0, + "content": "of a shift cipher showed little difference between embeddings and softmax, suggesting an increase", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 203, + 495, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 495, + 217 + ], + "score": 1.0, + "content": "in task complexity increases the benefits provided by the stronger gradient signal of embeddings.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 159, + 505, + 217 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 230, + 173, + 243 + ], + "lines": [ + { + "bbox": [ + 104, + 228, + 175, + 246 + ], + "spans": [ + { + "bbox": [ + 104, + 228, + 175, + 246 + ], + "score": 1.0, + "content": "3 METHOD", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 107, + 254, + 187, + 267 + ], + "lines": [ + { + "bbox": [ + 105, + 254, + 189, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 189, + 268 + ], + "score": 1.0, + "content": "3.1 CIPHERGAN", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 506, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 289 + ], + "score": 1.0, + "content": "GANs applied to text data have yet to produce truly convincing results (Kawthekar et al.). Previous", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 285, + 506, + 301 + ], + "spans": [ + { + "bbox": [ + 104, + 285, + 506, + 301 + ], + "score": 1.0, + "content": "attempts at discrete sequence generation with GANs have generally utilized a generator outputting", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 297, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 297, + 505, + 310 + ], + "score": 1.0, + "content": "a probability distribution over the token space (Gulrajani et al., 2017; Yu et al., 2017; Hjelm et al.,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 308, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 506, + 322 + ], + "score": 1.0, + "content": "2017). This leads to the discriminator receiving a sequence of discrete random variables from the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 319, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 506, + 333 + ], + "score": 1.0, + "content": "data distribution, and a sequence of continuous random variables from the generator distribution;", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "making the task of discrimination trivial and uninformative of the underlying data distribution. In", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 342, + 505, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 505, + 355 + ], + "score": 1.0, + "content": "order to avoid such a scenario, we perform all discrimination within the embedding space by allow-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 350, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 104, + 350, + 506, + 367 + ], + "score": 1.0, + "content": "ing the generator’s output distribution to define a convex combination of corresponding embeddings.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 363, + 245, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 245, + 376 + ], + "score": 1.0, + "content": "This leads to the following losses:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17, + "bbox_fs": [ + 104, + 275, + 506, + 376 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 379, + 460, + 445 + ], + "lines": [ + { + "bbox": [ + 150, + 379, + 460, + 445 + ], + "spans": [ + { + "bbox": [ + 150, + 379, + 460, + 445 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { \\boldsymbol { y } \\sim \\mathcal { V } } [ \\log D _ { \\mathcal { V } } ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad + \\mathbb { E } _ { \\boldsymbol { x } \\sim \\mathcal { X } } [ \\log ( 1 - D _ { \\mathcal { V } } ( \\boldsymbol { F } ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ) ] } \\\\ & { \\qquad \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { \\boldsymbol { x } \\sim \\mathcal { X } } [ \\| G ( F ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) - \\boldsymbol { x } \\| _ { 1 } ] } \\\\ & { \\qquad + \\mathbb { E } _ { \\boldsymbol { y } \\sim \\mathcal { Y } } [ \\| F ( G ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) - \\boldsymbol { y } \\| _ { 1 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "9bb537560a1679e50af0947b65ca13eecb7bc7c7286a355b76dc9cd558f312bc.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 150, + 379, + 460, + 401.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 150, + 401.0, + 460, + 423.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 150, + 423.0, + 460, + 445.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 448, + 506, + 591 + ], + "lines": [ + { + "bbox": [ + 106, + 448, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 328, + 461 + ], + "score": 1.0, + "content": "We perform an inner product between the embeddings", + "type": "text" + }, + { + "bbox": [ + 328, + 448, + 356, + 460 + ], + "score": 0.91, + "content": "W _ { E m b }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 448, + 465, + 461 + ], + "score": 1.0, + "content": "and the one-hot vectors in", + "type": "text" + }, + { + "bbox": [ + 466, + 451, + 473, + 458 + ], + "score": 0.75, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 448, + 506, + 461 + ], + "score": 1.0, + "content": "as well", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 460, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 460, + 415, + 471 + ], + "score": 1.0, + "content": "as between the embeddings and the softmax vectors produced by generators", + "type": "text" + }, + { + "bbox": [ + 415, + 460, + 424, + 469 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 460, + 443, + 471 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 443, + 460, + 452, + 469 + ], + "score": 0.81, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 460, + 505, + 471 + ], + "score": 1.0, + "content": ". The former", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 470, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 506, + 483 + ], + "score": 1.0, + "content": "is equivalent to a lookup operation over the table of embedding vectors, while the latter is a convex", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 479, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 104, + 479, + 381, + 495 + ], + "score": 1.0, + "content": "combination between all vectors in the vocabulary. The embeddings", + "type": "text" + }, + { + "bbox": [ + 381, + 481, + 410, + 492 + ], + "score": 0.92, + "content": "W _ { E m b }", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 479, + 506, + 495 + ], + "score": 1.0, + "content": "are trained at each step", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 492, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 158, + 506 + ], + "score": 1.0, + "content": "to minimize", + "type": "text" + }, + { + "bbox": [ + 159, + 492, + 177, + 504 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { \\mathrm { c y c } }", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 492, + 239, + 506 + ], + "score": 1.0, + "content": "and maximize", + "type": "text" + }, + { + "bbox": [ + 239, + 492, + 263, + 504 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { \\mathrm { G A N } }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 492, + 506, + 506 + ], + "score": 1.0, + "content": ", meaning the embeddings are easily mapped from and are", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 503, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 505, + 516 + ], + "score": 1.0, + "content": "easy to discriminate. As was discussed in Section 2, training with the above loss functions was", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 514, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 505, + 527 + ], + "score": 1.0, + "content": "unstable, with approximately three of every four experiments failing to produce compelling results.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 524, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 505, + 538 + ], + "score": 1.0, + "content": "This is a problem we observed with the original CycleGAN horse-zebra experiment, and one that has", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 506, + 549 + ], + "score": 1.0, + "content": "been noted by multiple re-implementations online (Bansal & Rathore, 2017; Sari, 2017). We were", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 546, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 505, + 560 + ], + "score": 1.0, + "content": "able to significantly increase the stability by training the discriminator loss along with the Lipschitz", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "conditioning term from the improved Wasserstein GAN (Gulrajani et al., 2017) (see Equation 3", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "score": 1.0, + "content": "and Fedus et al. (2017)), resulting in the following loss (DualGAN (Yi et al., 2017) opted to use", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 579, + 315, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 315, + 592 + ], + "score": 1.0, + "content": "weight-clipping to enforce the Lipschitz condition):", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 31, + "bbox_fs": [ + 104, + 448, + 506, + 592 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 176, + 595, + 435, + 646 + ], + "lines": [ + { + "bbox": [ + 176, + 595, + 435, + 646 + ], + "spans": [ + { + "bbox": [ + 176, + 595, + 435, + 646 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { y \\sim \\mathcal { V } } [ D _ { \\mathcal { V } } ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad - \\mathbb { E } _ { \\boldsymbol { x } \\sim \\boldsymbol { x } } [ D _ { \\mathcal { V } } ( F ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad + \\alpha \\cdot \\mathbb { E } _ { \\hat { \\boldsymbol { y } } \\sim \\hat { \\mathcal { V } } } [ ( \\| \\nabla _ { \\hat { \\boldsymbol { y } } } D _ { \\mathcal { V } } ( \\hat { \\boldsymbol { y } } ) \\| _ { 2 } - 1 ) ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "8323112c9ee5c65285ce3c59c76b8c97dd9dc84a8f713e718f53ee86eb74be17.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 176, + 595, + 435, + 612.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 176, + 612.0, + 435, + 629.0 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 176, + 629.0, + 435, + 646.0 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 649, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "As a consequence of Proposition 1, discriminators trained on non-stationary embeddings will be", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "unable to approximate Dirac delta distributions to arbitrary accuracy; implying there are dedicated", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 107, + 671, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 107, + 671, + 233, + 683 + ], + "score": 1.0, + "content": "‘safe-zones’ about members of", + "type": "text" + }, + { + "bbox": [ + 233, + 672, + 242, + 680 + ], + "score": 0.79, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 671, + 505, + 683 + ], + "score": 1.0, + "content": "where the generator can reliably fool the discriminator and unin-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 681, + 261, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 261, + 694 + ], + "score": 1.0, + "content": "formative discrimination is prevented.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 649, + 505, + 694 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 504, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 504, + 711 + ], + "score": 1.0, + "content": "In our experiments, we jointly train the embedding vectors as parameters of the model. The gradi-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "ent updates applied to these vectors introduces noise between training iterations; we observed that", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "embedding vectors tend to remain in a bounded region after the initial steps of training. We found", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 699, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 165, + 80, + 446, + 148 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 165, + 80, + 446, + 148 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 165, + 80, + 446, + 148 + ], + "spans": [ + { + "bbox": [ + 165, + 80, + 446, + 148 + ], + "score": 0.98, + "html": "
WorkCiphertext LengthAccuracy
Hasinoff (2003)500~ 97%
Forsyth& Safavi-Naini (1993)5000~ 100%
Ramesh et al. (1993)160~ 78.5%
Verma et al. (2007)1000~ 87%
", + "type": "table", + "image_path": "de591efc73553c8fff57c84a0f03988cc0ea968e7f6f2f2577db83a15d4a7034.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 165, + 80, + 446, + 102.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 165, + 102.66666666666667, + 446, + 125.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 165, + 125.33333333333334, + 446, + 148.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 120, + 153, + 487, + 165 + ], + "lines": [ + { + "bbox": [ + 121, + 152, + 487, + 167 + ], + "spans": [ + { + "bbox": [ + 121, + 152, + 487, + 167 + ], + "score": 1.0, + "content": "Table 1: Previous results on automated shift cipher cracking with limited ciphertext length.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 185, + 503, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 183, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 505, + 198 + ], + "score": 1.0, + "content": "that simply replacing the data with embedding vectors had a similar effect to performing the random", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 196, + 312, + 209 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 312, + 209 + ], + "score": 1.0, + "content": "sampling described in Proposition 1 (see Figure 3).", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "title", + "bbox": [ + 108, + 223, + 200, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 201, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 201, + 237 + ], + "score": 1.0, + "content": "4 EXPERIMENTS", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 107, + 248, + 155, + 259 + ], + "lines": [ + { + "bbox": [ + 105, + 247, + 157, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 157, + 261 + ], + "score": 1.0, + "content": "4.1 DATA", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 269, + 505, + 313 + ], + "lines": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "Our experiments use plaintext natural language samples from the Brown English text dataset (Fran-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 280, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 120, + 291 + ], + "score": 1.0, + "content": "cis", + "type": "text" + }, + { + "bbox": [ + 120, + 280, + 129, + 290 + ], + "score": 0.29, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 130, + 280, + 247, + 291 + ], + "score": 1.0, + "content": "Kucera, 1979). We generate", + "type": "text" + }, + { + "bbox": [ + 247, + 280, + 262, + 290 + ], + "score": 0.71, + "content": "2 *", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 280, + 505, + 291 + ], + "score": 1.0, + "content": "batch size plaintext samples, the first half are fed as the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 290, + 506, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 160, + 303 + ], + "score": 1.0, + "content": "CycleGAN’s", + "type": "text" + }, + { + "bbox": [ + 161, + 291, + 171, + 300 + ], + "score": 0.79, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 290, + 506, + 303 + ], + "score": 1.0, + "content": "distribution and the second half is passed through the cipher of choice and fed as", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 301, + 182, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 121, + 314 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 121, + 302, + 130, + 313 + ], + "score": 0.82, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 301, + 182, + 314 + ], + "score": 1.0, + "content": "distribution.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 107, + 318, + 505, + 396 + ], + "lines": [ + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "score": 1.0, + "content": "For our natural language plaintext data we used the Brown English-language corpus which consists", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "score": 1.0, + "content": "of over one million words in 57340 sentences. We experiment with both word-level ”Brown-W”", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 339, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 221, + 353 + ], + "score": 1.0, + "content": "and character-level ”Brown-", + "type": "text" + }, + { + "bbox": [ + 221, + 341, + 234, + 351 + ], + "score": 0.3, + "content": "\\mathbf { \\vec { C } } ^ { \\mathbf { \\vec { \\mu } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 339, + 506, + 353 + ], + "score": 1.0, + "content": "vocabularies. For word-level vocabularies, we control the size of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 237, + 364 + ], + "score": 1.0, + "content": "the vocabulary by taking the top", + "type": "text" + }, + { + "bbox": [ + 237, + 352, + 245, + 362 + ], + "score": 0.73, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "most frequent words and introducing an ‘unknown’ token which", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 362, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 506, + 375 + ], + "score": 1.0, + "content": "we use to replace all words that are not within the taken vocabulary. We demonstrate our method’s", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 373, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 387 + ], + "score": 1.0, + "content": "ability to scale to large vocabularies using the word-level vocabularies; more modern enciphering", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 385, + 485, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 485, + 397 + ], + "score": 1.0, + "content": "techniques rely on large substitution-boxes (S-boxes) with many (often hundreds of) elements.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15 + }, + { + "type": "title", + "bbox": [ + 107, + 409, + 176, + 420 + ], + "lines": [ + { + "bbox": [ + 105, + 408, + 177, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 177, + 422 + ], + "score": 1.0, + "content": "4.2 TRAINING", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 108, + 429, + 504, + 474 + ], + "lines": [ + { + "bbox": [ + 106, + 430, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 505, + 442 + ], + "score": 1.0, + "content": "As in Zhu et al. (2017) we replace the log-likelihood loss with a squared difference loss which", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "score": 1.0, + "content": "was originally introduced by Mao et al. (2016). The original motivation for this replacement was", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 452, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 505, + 465 + ], + "score": 1.0, + "content": "improved stability in training and avoidance of the vanishing gradients problem. In this work we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 462, + 300, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 300, + 475 + ], + "score": 1.0, + "content": "found the effect on training stability substantial.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5 + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 478, + 446, + 529 + ], + "lines": [ + { + "bbox": [ + 165, + 478, + 446, + 529 + ], + "spans": [ + { + "bbox": [ + 165, + 478, + 446, + 529 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D y , \\mathcal { X } , \\mathcal { Y } ) = \\mathbb { E } _ { y \\sim \\mathcal { Y } } [ ( D y ( y \\cdot W _ { E m b } ^ { \\top } ) ) ^ { 2 } ] } \\\\ & { \\qquad + \\mathbb { E } _ { x \\sim \\mathcal { X } } [ ( 1 - D _ { \\mathcal { V } } ( F ( x \\cdot W _ { E m b } ^ { \\top } ) \\cdot W _ { E m b } ^ { \\top } ) ) ^ { 2 } ] } \\\\ & { \\qquad + \\alpha \\cdot \\mathbb { E } _ { \\hat { y } \\sim \\hat { \\mathcal { Y } } } [ ( 1 - \\| \\nabla _ { \\hat { y } } D y ( \\hat { y } ) \\| _ { 2 } ) ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "a8eefb593835118e22f2ebd4ba9d0478fda1bb4697322c3eb04dc4529afed82e.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 165, + 478, + 446, + 495.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 165, + 495.0, + 446, + 512.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 165, + 512.0, + 446, + 529.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 202, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 532, + 203, + 544 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 203, + 544 + ], + "score": 1.0, + "content": "Hence, our total loss is:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "interline_equation", + "bbox": [ + 195, + 546, + 415, + 591 + ], + "lines": [ + { + "bbox": [ + 195, + 546, + 415, + 591 + ], + "spans": [ + { + "bbox": [ + 195, + 546, + 415, + 591 + ], + "score": 0.92, + "content": "\\begin{array} { r l } { \\mathcal { L } _ { \\mathrm { T o t a l } } ( F , G , D _ { \\mathcal { X } } , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) = \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) } & { } \\\\ { + \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\mathcal { X } , \\mathcal { Y } ) } & { } \\\\ { + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}", + "type": "interline_equation", + "image_path": "e3903c3b5ea74aac586cf4959f002575d42318e4645a9e85c6b64c3f0a46eced.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 195, + 546, + 415, + 561.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 195, + 561.0, + 415, + 576.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 195, + 576.0, + 415, + 591.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "We adapted the convolutional architecture for the generator and discriminator directly from Zhu", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "score": 1.0, + "content": "et al. (2017). We simply replace all two dimensional convolutions with the one dimension variant", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "and reduce the filter sizes in our generators to 1 (pointwise convolutions). Convolutional neural net-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "score": 1.0, + "content": "works have recently been shown to be highly effective on language tasks and can speed up training", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 642, + 505, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 505, + 658 + ], + "score": 1.0, + "content": "significantly (Zhang & LeCun, 2015; Kalchbrenner et al., 2016; Yu et al., 2017). Both our genera-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "score": 1.0, + "content": "tors and discriminators receive a sequence of vectors in embedding space; our generators produce a", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "softmax distribution over the vocabulary, while our discriminator produces a scalar output. For all", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 372, + 689 + ], + "score": 1.0, + "content": "our experiments we use a cycle loss with regularization coefficient", + "type": "text" + }, + { + "bbox": [ + 373, + 677, + 398, + 687 + ], + "score": 0.89, + "content": "\\lambda = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 677, + 505, + 689 + ], + "score": 1.0, + "content": ". In order to be compatible", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "with the WGAN we replace batch normalization (Ioffe & Szegedy, 2015) with layer normalization", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "(Ba et al., 2016). We train using the Adam optmizer (Kingma & Ba, 2014) with batch size 64", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 177, + 722 + ], + "score": 1.0, + "content": "and learning rate", + "type": "text" + }, + { + "bbox": [ + 178, + 710, + 207, + 720 + ], + "score": 0.66, + "content": "2 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 709, + 210, + 722 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 211, + 710, + 243, + 721 + ], + "score": 0.85, + "content": "\\beta _ { 1 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 709, + 262, + 722 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 262, + 710, + 302, + 721 + ], + "score": 0.91, + "content": "\\beta _ { 2 } = 0 . 9", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 709, + 506, + 722 + ], + "score": 1.0, + "content": ". Our learning rate is exponentially warmed up to", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 136, + 731 + ], + "score": 0.84, + "content": "2 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "over 2500 steps, and held constant thereafter. We use learned embedding vectors with 256", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 36.5 + } + ], + "page_idx": 6, + "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, + 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": [ + 165, + 80, + 446, + 148 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 165, + 80, + 446, + 148 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 165, + 80, + 446, + 148 + ], + "spans": [ + { + "bbox": [ + 165, + 80, + 446, + 148 + ], + "score": 0.98, + "html": "
WorkCiphertext LengthAccuracy
Hasinoff (2003)500~ 97%
Forsyth& Safavi-Naini (1993)5000~ 100%
Ramesh et al. (1993)160~ 78.5%
Verma et al. (2007)1000~ 87%
", + "type": "table", + "image_path": "de591efc73553c8fff57c84a0f03988cc0ea968e7f6f2f2577db83a15d4a7034.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 165, + 80, + 446, + 102.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 165, + 102.66666666666667, + 446, + 125.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 165, + 125.33333333333334, + 446, + 148.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 120, + 153, + 487, + 165 + ], + "lines": [ + { + "bbox": [ + 121, + 152, + 487, + 167 + ], + "spans": [ + { + "bbox": [ + 121, + 152, + 487, + 167 + ], + "score": 1.0, + "content": "Table 1: Previous results on automated shift cipher cracking with limited ciphertext length.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 121, + 152, + 487, + 167 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 185, + 503, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 183, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 505, + 198 + ], + "score": 1.0, + "content": "that simply replacing the data with embedding vectors had a similar effect to performing the random", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 196, + 312, + 209 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 312, + 209 + ], + "score": 1.0, + "content": "sampling described in Proposition 1 (see Figure 3).", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 183, + 505, + 209 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 223, + 200, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 201, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 201, + 237 + ], + "score": 1.0, + "content": "4 EXPERIMENTS", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 107, + 248, + 155, + 259 + ], + "lines": [ + { + "bbox": [ + 105, + 247, + 157, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 157, + 261 + ], + "score": 1.0, + "content": "4.1 DATA", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 269, + 505, + 313 + ], + "lines": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "Our experiments use plaintext natural language samples from the Brown English text dataset (Fran-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 280, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 120, + 291 + ], + "score": 1.0, + "content": "cis", + "type": "text" + }, + { + "bbox": [ + 120, + 280, + 129, + 290 + ], + "score": 0.29, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 130, + 280, + 247, + 291 + ], + "score": 1.0, + "content": "Kucera, 1979). We generate", + "type": "text" + }, + { + "bbox": [ + 247, + 280, + 262, + 290 + ], + "score": 0.71, + "content": "2 *", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 280, + 505, + 291 + ], + "score": 1.0, + "content": "batch size plaintext samples, the first half are fed as the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 290, + 506, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 160, + 303 + ], + "score": 1.0, + "content": "CycleGAN’s", + "type": "text" + }, + { + "bbox": [ + 161, + 291, + 171, + 300 + ], + "score": 0.79, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 290, + 506, + 303 + ], + "score": 1.0, + "content": "distribution and the second half is passed through the cipher of choice and fed as", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 301, + 182, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 121, + 314 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 121, + 302, + 130, + 313 + ], + "score": 0.82, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 301, + 182, + 314 + ], + "score": 1.0, + "content": "distribution.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 268, + 506, + 314 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 318, + 505, + 396 + ], + "lines": [ + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 331 + ], + "score": 1.0, + "content": "For our natural language plaintext data we used the Brown English-language corpus which consists", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 506, + 342 + ], + "score": 1.0, + "content": "of over one million words in 57340 sentences. We experiment with both word-level ”Brown-W”", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 339, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 221, + 353 + ], + "score": 1.0, + "content": "and character-level ”Brown-", + "type": "text" + }, + { + "bbox": [ + 221, + 341, + 234, + 351 + ], + "score": 0.3, + "content": "\\mathbf { \\vec { C } } ^ { \\mathbf { \\vec { \\mu } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 339, + 506, + 353 + ], + "score": 1.0, + "content": "vocabularies. For word-level vocabularies, we control the size of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 351, + 505, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 351, + 237, + 364 + ], + "score": 1.0, + "content": "the vocabulary by taking the top", + "type": "text" + }, + { + "bbox": [ + 237, + 352, + 245, + 362 + ], + "score": 0.73, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 351, + 505, + 364 + ], + "score": 1.0, + "content": "most frequent words and introducing an ‘unknown’ token which", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 362, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 506, + 375 + ], + "score": 1.0, + "content": "we use to replace all words that are not within the taken vocabulary. We demonstrate our method’s", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 373, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 387 + ], + "score": 1.0, + "content": "ability to scale to large vocabularies using the word-level vocabularies; more modern enciphering", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 385, + 485, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 485, + 397 + ], + "score": 1.0, + "content": "techniques rely on large substitution-boxes (S-boxes) with many (often hundreds of) elements.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 318, + 506, + 397 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 409, + 176, + 420 + ], + "lines": [ + { + "bbox": [ + 105, + 408, + 177, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 177, + 422 + ], + "score": 1.0, + "content": "4.2 TRAINING", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 108, + 429, + 504, + 474 + ], + "lines": [ + { + "bbox": [ + 106, + 430, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 505, + 442 + ], + "score": 1.0, + "content": "As in Zhu et al. (2017) we replace the log-likelihood loss with a squared difference loss which", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "score": 1.0, + "content": "was originally introduced by Mao et al. (2016). The original motivation for this replacement was", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 452, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 505, + 465 + ], + "score": 1.0, + "content": "improved stability in training and avoidance of the vanishing gradients problem. In this work we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 462, + 300, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 300, + 475 + ], + "score": 1.0, + "content": "found the effect on training stability substantial.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5, + "bbox_fs": [ + 106, + 430, + 505, + 475 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 478, + 446, + 529 + ], + "lines": [ + { + "bbox": [ + 165, + 478, + 446, + 529 + ], + "spans": [ + { + "bbox": [ + 165, + 478, + 446, + 529 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D y , \\mathcal { X } , \\mathcal { Y } ) = \\mathbb { E } _ { y \\sim \\mathcal { Y } } [ ( D y ( y \\cdot W _ { E m b } ^ { \\top } ) ) ^ { 2 } ] } \\\\ & { \\qquad + \\mathbb { E } _ { x \\sim \\mathcal { X } } [ ( 1 - D _ { \\mathcal { V } } ( F ( x \\cdot W _ { E m b } ^ { \\top } ) \\cdot W _ { E m b } ^ { \\top } ) ) ^ { 2 } ] } \\\\ & { \\qquad + \\alpha \\cdot \\mathbb { E } _ { \\hat { y } \\sim \\hat { \\mathcal { Y } } } [ ( 1 - \\| \\nabla _ { \\hat { y } } D y ( \\hat { y } ) \\| _ { 2 } ) ^ { 2 } ] } \\end{array}", + "type": "interline_equation", + "image_path": "a8eefb593835118e22f2ebd4ba9d0478fda1bb4697322c3eb04dc4529afed82e.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 165, + 478, + 446, + 495.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 165, + 495.0, + 446, + 512.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 165, + 512.0, + 446, + 529.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 202, + 543 + ], + "lines": [ + { + "bbox": [ + 106, + 532, + 203, + 544 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 203, + 544 + ], + "score": 1.0, + "content": "Hence, our total loss is:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 532, + 203, + 544 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 195, + 546, + 415, + 591 + ], + "lines": [ + { + "bbox": [ + 195, + 546, + 415, + 591 + ], + "spans": [ + { + "bbox": [ + 195, + 546, + 415, + 591 + ], + "score": 0.92, + "content": "\\begin{array} { r l } { \\mathcal { L } _ { \\mathrm { T o t a l } } ( F , G , D _ { \\mathcal { X } } , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) = \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) } & { } \\\\ { + \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\mathcal { X } , \\mathcal { Y } ) } & { } \\\\ { + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}", + "type": "interline_equation", + "image_path": "e3903c3b5ea74aac586cf4959f002575d42318e4645a9e85c6b64c3f0a46eced.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 195, + 546, + 415, + 561.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 195, + 561.0, + 415, + 576.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 195, + 576.0, + 415, + 591.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "We adapted the convolutional architecture for the generator and discriminator directly from Zhu", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "score": 1.0, + "content": "et al. (2017). We simply replace all two dimensional convolutions with the one dimension variant", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "and reduce the filter sizes in our generators to 1 (pointwise convolutions). Convolutional neural net-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 505, + 646 + ], + "score": 1.0, + "content": "works have recently been shown to be highly effective on language tasks and can speed up training", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 642, + 505, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 505, + 658 + ], + "score": 1.0, + "content": "significantly (Zhang & LeCun, 2015; Kalchbrenner et al., 2016; Yu et al., 2017). Both our genera-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "score": 1.0, + "content": "tors and discriminators receive a sequence of vectors in embedding space; our generators produce a", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "softmax distribution over the vocabulary, while our discriminator produces a scalar output. For all", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 372, + 689 + ], + "score": 1.0, + "content": "our experiments we use a cycle loss with regularization coefficient", + "type": "text" + }, + { + "bbox": [ + 373, + 677, + 398, + 687 + ], + "score": 0.89, + "content": "\\lambda = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 677, + 505, + 689 + ], + "score": 1.0, + "content": ". In order to be compatible", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "with the WGAN we replace batch normalization (Ioffe & Szegedy, 2015) with layer normalization", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "(Ba et al., 2016). We train using the Adam optmizer (Kingma & Ba, 2014) with batch size 64", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 177, + 722 + ], + "score": 1.0, + "content": "and learning rate", + "type": "text" + }, + { + "bbox": [ + 178, + 710, + 207, + 720 + ], + "score": 0.66, + "content": "2 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 709, + 210, + 722 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 211, + 710, + 243, + 721 + ], + "score": 0.85, + "content": "\\beta _ { 1 } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 709, + 262, + 722 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 262, + 710, + 302, + 721 + ], + "score": 0.91, + "content": "\\beta _ { 2 } = 0 . 9", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 709, + 506, + 722 + ], + "score": 1.0, + "content": ". Our learning rate is exponentially warmed up to", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 136, + 731 + ], + "score": 0.84, + "content": "2 e - 4", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "over 2500 steps, and held constant thereafter. We use learned embedding vectors with 256", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 107, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 107, + 415, + 388, + 428 + ], + "score": 1.0, + "content": "dimensions. The WGAN Lipschitz conditioning parameter was set to", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 388, + 416, + 420, + 425 + ], + "score": 0.91, + "content": "\\alpha = 1 0", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 420, + 415, + 505, + 428 + ], + "score": 1.0, + "content": "as was prescribed in", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 426, + 200, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 200, + 438 + ], + "score": 1.0, + "content": "Gulrajani et al. (2017).", + "type": "text", + "cross_page": true + } + ], + "index": 13 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 600, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 124, + 80, + 483, + 206 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 124, + 80, + 483, + 206 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 124, + 80, + 483, + 206 + ], + "spans": [ + { + "bbox": [ + 124, + 80, + 483, + 206 + ], + "score": 0.972, + "type": "image", + "image_path": "a2e5c03b8e76f7f6e10222d4ba2250b1da9bf6d92b825379601540cad2ec3077.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 124, + 80, + 483, + 122.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 124, + 122.0, + 483, + 164.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 124, + 164.0, + 483, + 206.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 210, + 504, + 233 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 223 + ], + "score": 1.0, + "content": "Figure 3: Left: Comparison of different timing techniques for Brown-C Vigenere. Right: Compari- `", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 221, + 396, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 396, + 233 + ], + "score": 1.0, + "content": "son of embedding vs. raw softmax on Brown-W with vocab size of 200.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "table", + "bbox": [ + 128, + 246, + 482, + 341 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 128, + 246, + 482, + 341 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 128, + 246, + 482, + 341 + ], + "spans": [ + { + "bbox": [ + 128, + 246, + 482, + 341 + ], + "score": 0.974, + "html": "
Data Vocab sizeBrown-W 10Brown-W 200Brown-C 58Freq. Analysis (With Key) 58200
CipherShift/Permutation
Acc.100%98.7%99.8%80.9%44.5%
CipherVigenere (Key: “345")
Acc.99.7%75.7%99.0%9.6% (78.1%)<0.1% (44.3%)
", + "type": "table", + "image_path": "c8fb91b727f1c5a1c91f7df2b55d6f9f8cf202d2015999460b39e567150e15ad.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 128, + 246, + 482, + 277.6666666666667 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 128, + 277.6666666666667, + 482, + 309.33333333333337 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 128, + 309.33333333333337, + 482, + 341.00000000000006 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 107, + 346, + 505, + 390 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 345, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 506, + 359 + ], + "score": 1.0, + "content": "Table 2: Average proportion of characters correctly mapped in a given sequence. The “Freq. Anal-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "ysis” column is simple frequency analysis applied to the same corpus our model observes. For", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 367, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 381 + ], + "score": 1.0, + "content": "Vigenere we also show the score if the key were known (note: the key is left unknown to our `", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 379, + 141, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 141, + 392 + ], + "score": 1.0, + "content": "model).", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + } + ], + "index": 7.75 + }, + { + "type": "text", + "bbox": [ + 108, + 415, + 504, + 437 + ], + "lines": [ + { + "bbox": [ + 107, + 415, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 107, + 415, + 388, + 428 + ], + "score": 1.0, + "content": "dimensions. The WGAN Lipschitz conditioning parameter was set to", + "type": "text" + }, + { + "bbox": [ + 388, + 416, + 420, + 425 + ], + "score": 0.91, + "content": "\\alpha = 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 415, + 505, + 428 + ], + "score": 1.0, + "content": "as was prescribed in", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 426, + 200, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 200, + 438 + ], + "score": 1.0, + "content": "Gulrajani et al. (2017).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 443, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "For the Vigenere cipher, positional information is critical to the network being able to perform the `", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 454, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 505, + 466 + ], + "score": 1.0, + "content": "mapping. In order to facilitate this we experimented with adding the timing signal described in", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 465, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 506, + 478 + ], + "score": 1.0, + "content": "Vaswani et al. (2017) (”Transformer Timing” in Figure 3) and found that performance increased", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 477, + 504, + 488 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 504, + 488 + ], + "score": 1.0, + "content": "relative to no explicit timing signal; we found that the best option was concatenating a learned posi-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 486, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 500 + ], + "score": 1.0, + "content": "tional embedding vector specific to each position onto the sequence (”Concat Timing” in Figure 3),", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "this dramatically improved performance, however this means that the architecture can not generalize", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 509, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 506, + 522 + ], + "score": 1.0, + "content": "to sequences longer than those in the training set. A potential solution to the issue of generalizing to", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 519, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 505, + 533 + ], + "score": 1.0, + "content": "longer sequences would be making a ’soft’ choice at each position for which positional embedding", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 531, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 505, + 543 + ], + "score": 1.0, + "content": "vector to concatenate using a softmax distribution over a set of embedding vectors larger than the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 542, + 345, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 345, + 554 + ], + "score": 1.0, + "content": "expected key length, however, we leave this to future work.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 108, + 571, + 185, + 582 + ], + "lines": [ + { + "bbox": [ + 105, + 569, + 187, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 187, + 585 + ], + "score": 1.0, + "content": "4.3 DISCUSSION", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 593, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 505, + 606 + ], + "score": 1.0, + "content": "Table 2 shows that CipherGAN was able to solve shift ciphers to near flawless accuracy, with all", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "score": 1.0, + "content": "three vocabulary sizes being easily decoded by the model. CipherGAN performs extremely well on", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "Vigenere, achieving excellent results on the character-level cipher and strong results on the chal- `", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "lenging word-level cipher with a vocabulary size of 200. The vocabulary size of 58 for our character", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "level, containing punctuation and special characters, is more than double what has been previously", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "explored. In comparison to the original CycleGAN architecture, we found CipherGAN to be ex-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "tremely consistent in training and notably insensitive to the random initialization of weights; we", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 671, + 360, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 360, + 683 + ], + "score": 1.0, + "content": "attribute this stability to the Jacobian norm regularization term.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 688, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "For both ciphers, the first mappings to be correctly determined were those of the most frequently", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "occurring vocabulary elements, suggesting that the network does indeed perform some form of", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "frequency analysis to distinguish outlier frequencies in the two banks of text. Another interesting", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 720, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 732 + ], + "score": 1.0, + "content": "observation is that of the mistakes made by the network: the network would frequently confuse", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5 + } + ], + "page_idx": 7, + "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": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 124, + 80, + 483, + 206 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 124, + 80, + 483, + 206 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 124, + 80, + 483, + 206 + ], + "spans": [ + { + "bbox": [ + 124, + 80, + 483, + 206 + ], + "score": 0.972, + "type": "image", + "image_path": "a2e5c03b8e76f7f6e10222d4ba2250b1da9bf6d92b825379601540cad2ec3077.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 124, + 80, + 483, + 122.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 124, + 122.0, + 483, + 164.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 124, + 164.0, + 483, + 206.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 210, + 504, + 233 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 223 + ], + "score": 1.0, + "content": "Figure 3: Left: Comparison of different timing techniques for Brown-C Vigenere. Right: Compari- `", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 221, + 396, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 396, + 233 + ], + "score": 1.0, + "content": "son of embedding vs. raw softmax on Brown-W with vocab size of 200.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "table", + "bbox": [ + 128, + 246, + 482, + 341 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 128, + 246, + 482, + 341 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 128, + 246, + 482, + 341 + ], + "spans": [ + { + "bbox": [ + 128, + 246, + 482, + 341 + ], + "score": 0.974, + "html": "
Data Vocab sizeBrown-W 10Brown-W 200Brown-C 58Freq. Analysis (With Key) 58200
CipherShift/Permutation
Acc.100%98.7%99.8%80.9%44.5%
CipherVigenere (Key: “345")
Acc.99.7%75.7%99.0%9.6% (78.1%)<0.1% (44.3%)
", + "type": "table", + "image_path": "c8fb91b727f1c5a1c91f7df2b55d6f9f8cf202d2015999460b39e567150e15ad.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 128, + 246, + 482, + 277.6666666666667 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 128, + 277.6666666666667, + 482, + 309.33333333333337 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 128, + 309.33333333333337, + 482, + 341.00000000000006 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 107, + 346, + 505, + 390 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 345, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 506, + 359 + ], + "score": 1.0, + "content": "Table 2: Average proportion of characters correctly mapped in a given sequence. The “Freq. Anal-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "ysis” column is simple frequency analysis applied to the same corpus our model observes. For", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 367, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 381 + ], + "score": 1.0, + "content": "Vigenere we also show the score if the key were known (note: the key is left unknown to our `", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 379, + 141, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 141, + 392 + ], + "score": 1.0, + "content": "model).", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + } + ], + "index": 7.75 + }, + { + "type": "text", + "bbox": [ + 108, + 415, + 504, + 437 + ], + "lines": [], + "index": 12.5, + "bbox_fs": [ + 106, + 415, + 505, + 438 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 443, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "For the Vigenere cipher, positional information is critical to the network being able to perform the `", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 454, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 505, + 466 + ], + "score": 1.0, + "content": "mapping. In order to facilitate this we experimented with adding the timing signal described in", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 465, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 506, + 478 + ], + "score": 1.0, + "content": "Vaswani et al. (2017) (”Transformer Timing” in Figure 3) and found that performance increased", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 477, + 504, + 488 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 504, + 488 + ], + "score": 1.0, + "content": "relative to no explicit timing signal; we found that the best option was concatenating a learned posi-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 486, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 500 + ], + "score": 1.0, + "content": "tional embedding vector specific to each position onto the sequence (”Concat Timing” in Figure 3),", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "this dramatically improved performance, however this means that the architecture can not generalize", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 509, + 506, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 506, + 522 + ], + "score": 1.0, + "content": "to sequences longer than those in the training set. A potential solution to the issue of generalizing to", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 519, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 505, + 533 + ], + "score": 1.0, + "content": "longer sequences would be making a ’soft’ choice at each position for which positional embedding", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 531, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 505, + 543 + ], + "score": 1.0, + "content": "vector to concatenate using a softmax distribution over a set of embedding vectors larger than the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 542, + 345, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 345, + 554 + ], + "score": 1.0, + "content": "expected key length, however, we leave this to future work.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 442, + 506, + 554 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 571, + 185, + 582 + ], + "lines": [ + { + "bbox": [ + 105, + 569, + 187, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 187, + 585 + ], + "score": 1.0, + "content": "4.3 DISCUSSION", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 593, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 505, + 606 + ], + "score": 1.0, + "content": "Table 2 shows that CipherGAN was able to solve shift ciphers to near flawless accuracy, with all", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "score": 1.0, + "content": "three vocabulary sizes being easily decoded by the model. CipherGAN performs extremely well on", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "Vigenere, achieving excellent results on the character-level cipher and strong results on the chal- `", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "lenging word-level cipher with a vocabulary size of 200. The vocabulary size of 58 for our character", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "level, containing punctuation and special characters, is more than double what has been previously", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 506, + 662 + ], + "score": 1.0, + "content": "explored. In comparison to the original CycleGAN architecture, we found CipherGAN to be ex-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "tremely consistent in training and notably insensitive to the random initialization of weights; we", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 671, + 360, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 360, + 683 + ], + "score": 1.0, + "content": "attribute this stability to the Jacobian norm regularization term.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 593, + 506, + 683 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 688, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "For both ciphers, the first mappings to be correctly determined were those of the most frequently", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "occurring vocabulary elements, suggesting that the network does indeed perform some form of", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "frequency analysis to distinguish outlier frequencies in the two banks of text. Another interesting", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 720, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 732 + ], + "score": 1.0, + "content": "observation is that of the mistakes made by the network: the network would frequently confuse", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 82, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 96 + ], + "score": 1.0, + "content": "punctuation marks with one another, perhaps suggesting that these vocabulary elements’ skip-gram", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 108 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 506, + 108 + ], + "score": 1.0, + "content": "signatures were similar enough to lead to the repeated confusion observed across many training runs.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 687, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 96 + ], + "score": 1.0, + "content": "punctuation marks with one another, perhaps suggesting that these vocabulary elements’ skip-gram", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 108 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 506, + 108 + ], + "score": 1.0, + "content": "signatures were similar enough to lead to the repeated confusion observed across many training runs.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "title", + "bbox": [ + 108, + 121, + 195, + 134 + ], + "lines": [ + { + "bbox": [ + 104, + 119, + 197, + 137 + ], + "spans": [ + { + "bbox": [ + 104, + 119, + 197, + 137 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 147, + 505, + 289 + ], + "lines": [ + { + "bbox": [ + 106, + 146, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 106, + 146, + 505, + 159 + ], + "score": 1.0, + "content": "CipherGAN is a compelling demonstration of the potential generative adversarial networks hold", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 158, + 504, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 504, + 169 + ], + "score": 1.0, + "content": "to act on discrete data to solve difficult tasks that rely on an extremely sensitive and nuanced dis-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 169, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 505, + 181 + ], + "score": 1.0, + "content": "crimination criterion. Our work serves to redouble the promise of the CycleGAN architecture for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 180, + 506, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 506, + 192 + ], + "score": 1.0, + "content": "unsupervised alignment tasks for multiple classes of data. CipherGAN presents an algorithm that", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 190, + 506, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 506, + 204 + ], + "score": 1.0, + "content": "is both stable and consistent in training, improving upon past implementations of the CycleGAN", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 201, + 505, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 201, + 505, + 214 + ], + "score": 1.0, + "content": "architecture. Our work theoretically motivates – and empirically confirms – the use of continuous", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 211, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 505, + 225 + ], + "score": 1.0, + "content": "relaxations of discrete variables, not only to facilitate the flow of gradients through discrete nodes,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 223, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 505, + 236 + ], + "score": 1.0, + "content": "but also to prevent the oft-observed phenomena of uninformative discrimination. CipherGAN is", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 234, + 506, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 506, + 248 + ], + "score": 1.0, + "content": "highly general in its structure and can be directly applied to a variety of unsupervised text alignment", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 244, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 258 + ], + "score": 1.0, + "content": "tasks, without excess burden of adaptation. On the one hand, CipherGAN is an early step towards", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 256, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 505, + 270 + ], + "score": 1.0, + "content": "the goal of unsupervised translation between languages and has shown excellent performance on the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "simplified task of cipher map inference. On the other hand, the methods we introduce can be used", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 279, + 387, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 387, + 290 + ], + "score": 1.0, + "content": "more broadly in the field of text generation with adversarial networks.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 9 + }, + { + "type": "title", + "bbox": [ + 108, + 303, + 200, + 313 + ], + "lines": [ + { + "bbox": [ + 107, + 303, + 200, + 313 + ], + "spans": [ + { + "bbox": [ + 107, + 303, + 200, + 313 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 321, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 106, + 321, + 504, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 504, + 334 + ], + "score": 1.0, + "content": "Our thanks goes to Roger Grosse and Kelvin Shuangjian Zhang for their advice and support through-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 331, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 505, + 345 + ], + "score": 1.0, + "content": "out. We also thank Otavio Good and Ian Goodfellow for meaningful early discussions and direction;", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "as well as Michal Wiszniewski for his assistance in developing the code upon which the experiments", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 353, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 368 + ], + "score": 1.0, + "content": "were run. This work was made possible thanks to the AI Grant, which provided generous support", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 364, + 156, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 156, + 380 + ], + "score": 1.0, + "content": "throughout.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19 + }, + { + "type": "title", + "bbox": [ + 108, + 394, + 175, + 406 + ], + "lines": [ + { + "bbox": [ + 106, + 393, + 177, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 393, + 177, + 408 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 102, + 411, + 506, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 411, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 427 + ], + "score": 1.0, + "content": "Martin Arjovsky, Soumith Chintala, and Leon Bottou. Wasserstein gan. ´ arXiv preprint", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 424, + 219, + 436 + ], + "spans": [ + { + "bbox": [ + 115, + 424, + 219, + 436 + ], + "score": 1.0, + "content": "arXiv:1701.07875, 2017.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 442, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 506, + 457 + ], + "score": 1.0, + "content": "Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 454, + 219, + 468 + ], + "spans": [ + { + "bbox": [ + 115, + 454, + 219, + 468 + ], + "score": 1.0, + "content": "arXiv:1607.06450, 2016.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 474, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 505, + 488 + ], + "score": 1.0, + "content": "Hardik Bansal and Archit Rathore. Understanding and implementing cyclegan in tensorflow.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 484, + 410, + 499 + ], + "spans": [ + { + "bbox": [ + 115, + 484, + 410, + 499 + ], + "score": 1.0, + "content": "https://hardikbansal.github.io/CycleGANBlog/, 2017.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 504, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 104, + 504, + 505, + 519 + ], + "score": 1.0, + "content": "John M Carroll and Steve Martin. The automated cryptanalysis of substitution ciphers. Cryptologia,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 117, + 515, + 206, + 529 + ], + "spans": [ + { + "bbox": [ + 117, + 515, + 206, + 529 + ], + "score": 1.0, + "content": "10(4):193–209, 1986.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 534, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 506, + 549 + ], + "score": 1.0, + "content": "Tong Che, Yanran Li, Ruixiang Zhang, R Devon Hjelm, Wenjie Li, Yangqiu Song, and Yoshua", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 546, + 506, + 560 + ], + "spans": [ + { + "bbox": [ + 115, + 546, + 506, + 560 + ], + "score": 1.0, + "content": "Bengio. Maximum-likelihood augmented discrete generative adversarial networks. arXiv preprint", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 558, + 219, + 569 + ], + "spans": [ + { + "bbox": [ + 116, + 558, + 219, + 569 + ], + "score": 1.0, + "content": "arXiv:1702.07983, 2017.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "score": 1.0, + "content": "William Fedus, Mihaela Rosca, Balaji Lakshminarayanan, Andrew M. Dai, Shakir Mohamed, and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 114, + 587, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 114, + 587, + 505, + 602 + ], + "score": 1.0, + "content": "Ian Goodfellow. Many paths to equilibrium: Gans do not need to decrease a divergence at every", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 599, + 163, + 613 + ], + "spans": [ + { + "bbox": [ + 115, + 599, + 163, + 613 + ], + "score": 1.0, + "content": "step, 2017.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 617, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 633 + ], + "score": 1.0, + "content": "William S Forsyth and Reihaneh Safavi-Naini. Automated cryptanalysis of substitution ciphers.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 629, + 258, + 642 + ], + "spans": [ + { + "bbox": [ + 115, + 629, + 258, + 642 + ], + "score": 1.0, + "content": "Cryptologia, 17(4):407–418, 1993.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 648, + 463, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 463, + 662 + ], + "score": 1.0, + "content": "W Nelson Francis and Henry Kucera. Brown corpus manual. Brown University, 2, 1979.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 667, + 506, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 506, + 682 + ], + "score": 1.0, + "content": "Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 680, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 116, + 680, + 505, + 693 + ], + "score": 1.0, + "content": "Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In Advances in neural infor-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 691, + 317, + 703 + ], + "spans": [ + { + "bbox": [ + 115, + 691, + 317, + 703 + ], + "score": 1.0, + "content": "mation processing systems, pp. 2672–2680, 2014.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 708, + 505, + 725 + ], + "spans": [ + { + "bbox": [ + 104, + 708, + 505, + 725 + ], + "score": 1.0, + "content": "Ian Goodfellow, Yoshua Bengio, and Aaron Courville. Deep Learning. MIT Press, 2016. http:", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 720, + 277, + 735 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 277, + 735 + ], + "score": 1.0, + "content": "//www.deeplearningbook.org.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 33.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": [ + 106, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 82, + 506, + 108 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 121, + 195, + 134 + ], + "lines": [ + { + "bbox": [ + 104, + 119, + 197, + 137 + ], + "spans": [ + { + "bbox": [ + 104, + 119, + 197, + 137 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 147, + 505, + 289 + ], + "lines": [ + { + "bbox": [ + 106, + 146, + 505, + 159 + ], + "spans": [ + { + "bbox": [ + 106, + 146, + 505, + 159 + ], + "score": 1.0, + "content": "CipherGAN is a compelling demonstration of the potential generative adversarial networks hold", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 158, + 504, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 504, + 169 + ], + "score": 1.0, + "content": "to act on discrete data to solve difficult tasks that rely on an extremely sensitive and nuanced dis-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 169, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 169, + 505, + 181 + ], + "score": 1.0, + "content": "crimination criterion. Our work serves to redouble the promise of the CycleGAN architecture for", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 180, + 506, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 506, + 192 + ], + "score": 1.0, + "content": "unsupervised alignment tasks for multiple classes of data. CipherGAN presents an algorithm that", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 190, + 506, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 506, + 204 + ], + "score": 1.0, + "content": "is both stable and consistent in training, improving upon past implementations of the CycleGAN", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 201, + 505, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 201, + 505, + 214 + ], + "score": 1.0, + "content": "architecture. Our work theoretically motivates – and empirically confirms – the use of continuous", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 211, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 505, + 225 + ], + "score": 1.0, + "content": "relaxations of discrete variables, not only to facilitate the flow of gradients through discrete nodes,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 223, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 505, + 236 + ], + "score": 1.0, + "content": "but also to prevent the oft-observed phenomena of uninformative discrimination. CipherGAN is", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 234, + 506, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 506, + 248 + ], + "score": 1.0, + "content": "highly general in its structure and can be directly applied to a variety of unsupervised text alignment", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 244, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 258 + ], + "score": 1.0, + "content": "tasks, without excess burden of adaptation. On the one hand, CipherGAN is an early step towards", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 256, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 505, + 270 + ], + "score": 1.0, + "content": "the goal of unsupervised translation between languages and has shown excellent performance on the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "simplified task of cipher map inference. On the other hand, the methods we introduce can be used", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 279, + 387, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 387, + 290 + ], + "score": 1.0, + "content": "more broadly in the field of text generation with adversarial networks.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 146, + 506, + 290 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 303, + 200, + 313 + ], + "lines": [ + { + "bbox": [ + 107, + 303, + 200, + 313 + ], + "spans": [ + { + "bbox": [ + 107, + 303, + 200, + 313 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 321, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 106, + 321, + 504, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 504, + 334 + ], + "score": 1.0, + "content": "Our thanks goes to Roger Grosse and Kelvin Shuangjian Zhang for their advice and support through-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 331, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 505, + 345 + ], + "score": 1.0, + "content": "out. We also thank Otavio Good and Ian Goodfellow for meaningful early discussions and direction;", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "as well as Michal Wiszniewski for his assistance in developing the code upon which the experiments", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 353, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 368 + ], + "score": 1.0, + "content": "were run. This work was made possible thanks to the AI Grant, which provided generous support", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 364, + 156, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 156, + 380 + ], + "score": 1.0, + "content": "throughout.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 321, + 505, + 380 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 394, + 175, + 406 + ], + "lines": [ + { + "bbox": [ + 106, + 393, + 177, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 393, + 177, + 408 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "list", + "bbox": [ + 102, + 411, + 506, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 411, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 427 + ], + "score": 1.0, + "content": "Martin Arjovsky, Soumith Chintala, and Leon Bottou. Wasserstein gan. ´ arXiv preprint", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 424, + 219, + 436 + ], + "spans": [ + { + "bbox": [ + 115, + 424, + 219, + 436 + ], + "score": 1.0, + "content": "arXiv:1701.07875, 2017.", + "type": "text" + } + ], + "index": 24, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 442, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 506, + 457 + ], + "score": 1.0, + "content": "Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E Hinton. Layer normalization. arXiv preprint", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 454, + 219, + 468 + ], + "spans": [ + { + "bbox": [ + 115, + 454, + 219, + 468 + ], + "score": 1.0, + "content": "arXiv:1607.06450, 2016.", + "type": "text" + } + ], + "index": 26, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 474, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 505, + 488 + ], + "score": 1.0, + "content": "Hardik Bansal and Archit Rathore. Understanding and implementing cyclegan in tensorflow.", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 484, + 410, + 499 + ], + "spans": [ + { + "bbox": [ + 115, + 484, + 410, + 499 + ], + "score": 1.0, + "content": "https://hardikbansal.github.io/CycleGANBlog/, 2017.", + "type": "text" + } + ], + "index": 28, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 504, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 104, + 504, + 505, + 519 + ], + "score": 1.0, + "content": "John M Carroll and Steve Martin. The automated cryptanalysis of substitution ciphers. Cryptologia,", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 117, + 515, + 206, + 529 + ], + "spans": [ + { + "bbox": [ + 117, + 515, + 206, + 529 + ], + "score": 1.0, + "content": "10(4):193–209, 1986.", + "type": "text" + } + ], + "index": 30, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 534, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 506, + 549 + ], + "score": 1.0, + "content": "Tong Che, Yanran Li, Ruixiang Zhang, R Devon Hjelm, Wenjie Li, Yangqiu Song, and Yoshua", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 546, + 506, + 560 + ], + "spans": [ + { + "bbox": [ + 115, + 546, + 506, + 560 + ], + "score": 1.0, + "content": "Bengio. Maximum-likelihood augmented discrete generative adversarial networks. arXiv preprint", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 558, + 219, + 569 + ], + "spans": [ + { + "bbox": [ + 116, + 558, + 219, + 569 + ], + "score": 1.0, + "content": "arXiv:1702.07983, 2017.", + "type": "text" + } + ], + "index": 33, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 590 + ], + "score": 1.0, + "content": "William Fedus, Mihaela Rosca, Balaji Lakshminarayanan, Andrew M. Dai, Shakir Mohamed, and", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 587, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 114, + 587, + 505, + 602 + ], + "score": 1.0, + "content": "Ian Goodfellow. Many paths to equilibrium: Gans do not need to decrease a divergence at every", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 599, + 163, + 613 + ], + "spans": [ + { + "bbox": [ + 115, + 599, + 163, + 613 + ], + "score": 1.0, + "content": "step, 2017.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 617, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 506, + 633 + ], + "score": 1.0, + "content": "William S Forsyth and Reihaneh Safavi-Naini. Automated cryptanalysis of substitution ciphers.", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 629, + 258, + 642 + ], + "spans": [ + { + "bbox": [ + 115, + 629, + 258, + 642 + ], + "score": 1.0, + "content": "Cryptologia, 17(4):407–418, 1993.", + "type": "text" + } + ], + "index": 38, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 648, + 463, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 463, + 662 + ], + "score": 1.0, + "content": "W Nelson Francis and Henry Kucera. Brown corpus manual. Brown University, 2, 1979.", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 667, + 506, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 506, + 682 + ], + "score": 1.0, + "content": "Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair,", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 680, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 116, + 680, + 505, + 693 + ], + "score": 1.0, + "content": "Aaron Courville, and Yoshua Bengio. Generative adversarial nets. In Advances in neural infor-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 691, + 317, + 703 + ], + "spans": [ + { + "bbox": [ + 115, + 691, + 317, + 703 + ], + "score": 1.0, + "content": "mation processing systems, pp. 2672–2680, 2014.", + "type": "text" + } + ], + "index": 42, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 708, + 505, + 725 + ], + "spans": [ + { + "bbox": [ + 104, + 708, + 505, + 725 + ], + "score": 1.0, + "content": "Ian Goodfellow, Yoshua Bengio, and Aaron Courville. Deep Learning. MIT Press, 2016. http:", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 720, + 277, + 735 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 277, + 735 + ], + "score": 1.0, + "content": "//www.deeplearningbook.org.", + "type": "text" + } + ], + "index": 44, + "is_list_end_line": true + } + ], + "index": 33.5, + "bbox_fs": [ + 104, + 411, + 506, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 106 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "score": 1.0, + "content": "Ishaan Gulrajani, Faruk Ahmed, Martin Arjovsky, Vincent Dumoulin, and Aaron Courville. Im-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 94, + 425, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 94, + 425, + 106 + ], + "score": 1.0, + "content": "proved training of wasserstein gans. arXiv preprint arXiv:1704.00028, 2017.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 108, + 111, + 503, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 126 + ], + "score": 1.0, + "content": "Sam Hasinoff. Solving substitution ciphers. Department of Computer Science, University of Toronto,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 122, + 185, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 122, + 185, + 136 + ], + "score": 1.0, + "content": "Tech. Rep, 2003.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 141, + 503, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 140, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 505, + 155 + ], + "score": 1.0, + "content": "R Devon Hjelm, Athul Paul Jacob, Tong Che, Kyunghyun Cho, and Yoshua Bengio. Boundary-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 444, + 165 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 444, + 165 + ], + "score": 1.0, + "content": "seeking generative adversarial networks. arXiv preprint arXiv:1702.08431, 2017.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 108, + 171, + 504, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 170, + 504, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 504, + 185 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 182, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 115, + 182, + 505, + 195 + ], + "score": 1.0, + "content": "reducing internal covariate shift. In International Conference on Machine Learning, pp. 448–456,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 114, + 192, + 143, + 206 + ], + "spans": [ + { + "bbox": [ + 114, + 192, + 143, + 206 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 212, + 505, + 235 + ], + "lines": [ + { + "bbox": [ + 105, + 211, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 505, + 225 + ], + "score": 1.0, + "content": "Eric Jang, Shixiang Gu, and Ben Poole. Categorical reparameterization with gumbel-softmax. arXiv", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 223, + 254, + 235 + ], + "spans": [ + { + "bbox": [ + 115, + 223, + 254, + 235 + ], + "score": 1.0, + "content": "preprint arXiv:1611.01144, 2016.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 504, + 265 + ], + "lines": [ + { + "bbox": [ + 105, + 240, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 256 + ], + "score": 1.0, + "content": "Nal Kalchbrenner, Lasse Espeholt, Karen Simonyan, Aaron van den Oord, Alex Graves, and Koray", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 117, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 117, + 253, + 505, + 265 + ], + "score": 1.0, + "content": "Kavukcuoglu. Neural machine translation in linear time. arXiv preprint arXiv:1610.10099, 2016.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 271, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "score": 1.0, + "content": "Prasad Kawthekar, Raunaq Rewari, and Suvrat Bhooshan. Evaluating generative models for text", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 283, + 164, + 294 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 164, + 294 + ], + "score": 1.0, + "content": "generation.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 301, + 504, + 325 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 505, + 314 + ], + "score": 1.0, + "content": "Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. CoRR,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 313, + 412, + 324 + ], + "spans": [ + { + "bbox": [ + 116, + 313, + 412, + 324 + ], + "score": 1.0, + "content": "abs/1412.6980, 2014. URL http://arxiv.org/abs/1412.6980.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 108, + 330, + 504, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 344 + ], + "score": 1.0, + "content": "Kevin Knight, Anish Nair, Nishit Rathod, and Kenji Yamada. Unsupervised analysis for decipher-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 341, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 115, + 341, + 505, + 356 + ], + "score": 1.0, + "content": "ment problems. In Proceedings of the COLING/ACL on Main conference poster sessions, pp.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 353, + 356, + 366 + ], + "spans": [ + { + "bbox": [ + 116, + 353, + 356, + 366 + ], + "score": 1.0, + "content": "499–506. Association for Computational Linguistics, 2006.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 108, + 371, + 504, + 406 + ], + "lines": [ + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "score": 1.0, + "content": "Kevin Knight, Beata Megyesi, and Christiane Schaefer. The copiale cipher. In ´ Proceedings of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 383, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 116, + 383, + 505, + 395 + ], + "score": 1.0, + "content": "4th Workshop on Building and Using Comparable Corpora: Comparable Corpora and the Web,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 394, + 351, + 407 + ], + "spans": [ + { + "bbox": [ + 115, + 394, + 351, + 407 + ], + "score": 1.0, + "content": "pp. 2–9. Association for Computational Linguistics, 2011.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 504, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 411, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 425 + ], + "score": 1.0, + "content": "Naveen Kodali, Jacob Abernethy, James Hays, and Zsolt Kira. How to train your dragan. arXiv", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 424, + 254, + 435 + ], + "spans": [ + { + "bbox": [ + 114, + 424, + 254, + 435 + ], + "score": 1.0, + "content": "preprint arXiv:1705.07215, 2017.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 441, + 503, + 465 + ], + "lines": [ + { + "bbox": [ + 106, + 442, + 504, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 504, + 454 + ], + "score": 1.0, + "content": "Matt J Kusner and Jose Miguel Hern ´ andez-Lobato. Gans for sequences of discrete elements with ´", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 453, + 413, + 466 + ], + "spans": [ + { + "bbox": [ + 116, + 453, + 413, + 466 + ], + "score": 1.0, + "content": "the gumbel-softmax distribution. arXiv preprint arXiv:1611.04051, 2016.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 106, + 471, + 502, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 472, + 504, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 504, + 485 + ], + "score": 1.0, + "content": "Ming-Yu Liu, Thomas Breuel, and Jan Kautz. Unsupervised image-to-image translation networks.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 483, + 278, + 494 + ], + "spans": [ + { + "bbox": [ + 116, + 483, + 278, + 494 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1703.00848, 2017.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 106, + 501, + 503, + 525 + ], + "lines": [ + { + "bbox": [ + 104, + 498, + 506, + 516 + ], + "spans": [ + { + "bbox": [ + 104, + 498, + 506, + 516 + ], + "score": 1.0, + "content": "Pauline Luc, Camille Couprie, Soumith Chintala, and Jakob Verbeek. Semantic segmentation using", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 512, + 367, + 525 + ], + "spans": [ + { + "bbox": [ + 115, + 512, + 367, + 525 + ], + "score": 1.0, + "content": "adversarial networks. arXiv preprint arXiv:1611.08408, 2016.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 105, + 531, + 502, + 554 + ], + "lines": [ + { + "bbox": [ + 106, + 531, + 504, + 544 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 504, + 544 + ], + "score": 1.0, + "content": "Chris J Maddison, Andriy Mnih, and Yee Whye Teh. The concrete distribution: A continuous", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 542, + 439, + 554 + ], + "spans": [ + { + "bbox": [ + 116, + 542, + 439, + 554 + ], + "score": 1.0, + "content": "relaxation of discrete random variables. arXiv preprint arXiv:1611.00712, 2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 560, + 503, + 584 + ], + "lines": [ + { + "bbox": [ + 105, + 559, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 505, + 574 + ], + "score": 1.0, + "content": "Xudong Mao, Qing Li, Haoran Xie, Raymond YK Lau, Zhen Wang, and Stephen Paul Smolley.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 572, + 468, + 584 + ], + "spans": [ + { + "bbox": [ + 115, + 572, + 468, + 584 + ], + "score": 1.0, + "content": "Least squares generative adversarial networks. arXiv preprint ArXiv:1611.04076, 2016.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 106, + 590, + 504, + 614 + ], + "lines": [ + { + "bbox": [ + 105, + 589, + 505, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 505, + 605 + ], + "score": 1.0, + "content": "SS Omran, AS Al-Khalid, and DM Al-Saady. A cryptanalytic attack on vigenere cipher using `", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 601, + 502, + 614 + ], + "spans": [ + { + "bbox": [ + 115, + 601, + 502, + 614 + ], + "score": 1.0, + "content": "genetic algorithm. In Open Systems (ICOS), 2011 IEEE Conference on, pp. 59–64. IEEE, 2011.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 503, + 644 + ], + "lines": [ + { + "bbox": [ + 105, + 619, + 504, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 504, + 633 + ], + "score": 1.0, + "content": "Bhadri Msvs Raju et al. Decipherment of substitution cipher using enhanced probability distribution.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 631, + 387, + 644 + ], + "spans": [ + { + "bbox": [ + 116, + 631, + 387, + 644 + ], + "score": 1.0, + "content": "International Journal of Computer Applications, 5(8):34–40, 2010.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 650, + 503, + 673 + ], + "lines": [ + { + "bbox": [ + 106, + 650, + 505, + 663 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 505, + 663 + ], + "score": 1.0, + "content": "RS Ramesh, G Athithan, and K Thiruvengadam. An automated approach to solve simple substitution", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 661, + 294, + 673 + ], + "spans": [ + { + "bbox": [ + 116, + 661, + 294, + 673 + ], + "score": 1.0, + "content": "ciphers. Cryptologia, 17(2):202–218, 1993.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 107, + 680, + 503, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "Eyyb Sari. tensorflow-cyclegan. https://github.com/Eyyub/tensorflow-cyclegan,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 114, + 689, + 143, + 703 + ], + "spans": [ + { + "bbox": [ + 114, + 689, + 143, + 703 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 105, + 709, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "Simon Singh. The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptogra-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 114, + 721, + 196, + 732 + ], + "spans": [ + { + "bbox": [ + 114, + 721, + 196, + 732 + ], + "score": 1.0, + "content": "phy. Anchor, 2000.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5 + } + ], + "page_idx": 9, + "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": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 106 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "score": 1.0, + "content": "Ishaan Gulrajani, Faruk Ahmed, Martin Arjovsky, Vincent Dumoulin, and Aaron Courville. Im-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 94, + 425, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 94, + 425, + 106 + ], + "score": 1.0, + "content": "proved training of wasserstein gans. arXiv preprint arXiv:1704.00028, 2017.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 504, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 111, + 503, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 126 + ], + "score": 1.0, + "content": "Sam Hasinoff. Solving substitution ciphers. Department of Computer Science, University of Toronto,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 122, + 185, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 122, + 185, + 136 + ], + "score": 1.0, + "content": "Tech. Rep, 2003.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 111, + 505, + 136 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 141, + 503, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 140, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 140, + 505, + 155 + ], + "score": 1.0, + "content": "R Devon Hjelm, Athul Paul Jacob, Tong Che, Kyunghyun Cho, and Yoshua Bengio. Boundary-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 444, + 165 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 444, + 165 + ], + "score": 1.0, + "content": "seeking generative adversarial networks. arXiv preprint arXiv:1702.08431, 2017.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 140, + 505, + 165 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 171, + 504, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 170, + 504, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 504, + 185 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 182, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 115, + 182, + 505, + 195 + ], + "score": 1.0, + "content": "reducing internal covariate shift. In International Conference on Machine Learning, pp. 448–456,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 114, + 192, + 143, + 206 + ], + "spans": [ + { + "bbox": [ + 114, + 192, + 143, + 206 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 106, + 170, + 505, + 206 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 212, + 505, + 235 + ], + "lines": [ + { + "bbox": [ + 105, + 211, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 505, + 225 + ], + "score": 1.0, + "content": "Eric Jang, Shixiang Gu, and Ben Poole. Categorical reparameterization with gumbel-softmax. arXiv", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 223, + 254, + 235 + ], + "spans": [ + { + "bbox": [ + 115, + 223, + 254, + 235 + ], + "score": 1.0, + "content": "preprint arXiv:1611.01144, 2016.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 211, + 505, + 235 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 504, + 265 + ], + "lines": [ + { + "bbox": [ + 105, + 240, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 256 + ], + "score": 1.0, + "content": "Nal Kalchbrenner, Lasse Espeholt, Karen Simonyan, Aaron van den Oord, Alex Graves, and Koray", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 117, + 253, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 117, + 253, + 505, + 265 + ], + "score": 1.0, + "content": "Kavukcuoglu. Neural machine translation in linear time. arXiv preprint arXiv:1610.10099, 2016.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 240, + 505, + 265 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 271, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "score": 1.0, + "content": "Prasad Kawthekar, Raunaq Rewari, and Suvrat Bhooshan. Evaluating generative models for text", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 283, + 164, + 294 + ], + "spans": [ + { + "bbox": [ + 115, + 283, + 164, + 294 + ], + "score": 1.0, + "content": "generation.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 106, + 271, + 505, + 294 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 301, + 504, + 325 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 505, + 314 + ], + "score": 1.0, + "content": "Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. CoRR,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 313, + 412, + 324 + ], + "spans": [ + { + "bbox": [ + 116, + 313, + 412, + 324 + ], + "score": 1.0, + "content": "abs/1412.6980, 2014. URL http://arxiv.org/abs/1412.6980.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 106, + 301, + 505, + 324 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 330, + 504, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 505, + 344 + ], + "score": 1.0, + "content": "Kevin Knight, Anish Nair, Nishit Rathod, and Kenji Yamada. Unsupervised analysis for decipher-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 341, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 115, + 341, + 505, + 356 + ], + "score": 1.0, + "content": "ment problems. In Proceedings of the COLING/ACL on Main conference poster sessions, pp.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 353, + 356, + 366 + ], + "spans": [ + { + "bbox": [ + 116, + 353, + 356, + 366 + ], + "score": 1.0, + "content": "499–506. Association for Computational Linguistics, 2006.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 330, + 505, + 366 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 371, + 504, + 406 + ], + "lines": [ + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "score": 1.0, + "content": "Kevin Knight, Beata Megyesi, and Christiane Schaefer. The copiale cipher. In ´ Proceedings of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 383, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 116, + 383, + 505, + 395 + ], + "score": 1.0, + "content": "4th Workshop on Building and Using Comparable Corpora: Comparable Corpora and the Web,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 394, + 351, + 407 + ], + "spans": [ + { + "bbox": [ + 115, + 394, + 351, + 407 + ], + "score": 1.0, + "content": "pp. 2–9. Association for Computational Linguistics, 2011.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 371, + 505, + 407 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 504, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 411, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 505, + 425 + ], + "score": 1.0, + "content": "Naveen Kodali, Jacob Abernethy, James Hays, and Zsolt Kira. How to train your dragan. arXiv", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 424, + 254, + 435 + ], + "spans": [ + { + "bbox": [ + 114, + 424, + 254, + 435 + ], + "score": 1.0, + "content": "preprint arXiv:1705.07215, 2017.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 411, + 505, + 435 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 441, + 503, + 465 + ], + "lines": [ + { + "bbox": [ + 106, + 442, + 504, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 504, + 454 + ], + "score": 1.0, + "content": "Matt J Kusner and Jose Miguel Hern ´ andez-Lobato. Gans for sequences of discrete elements with ´", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 453, + 413, + 466 + ], + "spans": [ + { + "bbox": [ + 116, + 453, + 413, + 466 + ], + "score": 1.0, + "content": "the gumbel-softmax distribution. arXiv preprint arXiv:1611.04051, 2016.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 106, + 442, + 504, + 466 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 471, + 502, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 472, + 504, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 504, + 485 + ], + "score": 1.0, + "content": "Ming-Yu Liu, Thomas Breuel, and Jan Kautz. Unsupervised image-to-image translation networks.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 483, + 278, + 494 + ], + "spans": [ + { + "bbox": [ + 116, + 483, + 278, + 494 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1703.00848, 2017.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 472, + 504, + 494 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 501, + 503, + 525 + ], + "lines": [ + { + "bbox": [ + 104, + 498, + 506, + 516 + ], + "spans": [ + { + "bbox": [ + 104, + 498, + 506, + 516 + ], + "score": 1.0, + "content": "Pauline Luc, Camille Couprie, Soumith Chintala, and Jakob Verbeek. Semantic segmentation using", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 512, + 367, + 525 + ], + "spans": [ + { + "bbox": [ + 115, + 512, + 367, + 525 + ], + "score": 1.0, + "content": "adversarial networks. arXiv preprint arXiv:1611.08408, 2016.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 104, + 498, + 506, + 525 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 531, + 502, + 554 + ], + "lines": [ + { + "bbox": [ + 106, + 531, + 504, + 544 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 504, + 544 + ], + "score": 1.0, + "content": "Chris J Maddison, Andriy Mnih, and Yee Whye Teh. The concrete distribution: A continuous", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 542, + 439, + 554 + ], + "spans": [ + { + "bbox": [ + 116, + 542, + 439, + 554 + ], + "score": 1.0, + "content": "relaxation of discrete random variables. arXiv preprint arXiv:1611.00712, 2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 106, + 531, + 504, + 554 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 560, + 503, + 584 + ], + "lines": [ + { + "bbox": [ + 105, + 559, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 505, + 574 + ], + "score": 1.0, + "content": "Xudong Mao, Qing Li, Haoran Xie, Raymond YK Lau, Zhen Wang, and Stephen Paul Smolley.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 572, + 468, + 584 + ], + "spans": [ + { + "bbox": [ + 115, + 572, + 468, + 584 + ], + "score": 1.0, + "content": "Least squares generative adversarial networks. arXiv preprint ArXiv:1611.04076, 2016.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 559, + 505, + 584 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 590, + 504, + 614 + ], + "lines": [ + { + "bbox": [ + 105, + 589, + 505, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 505, + 605 + ], + "score": 1.0, + "content": "SS Omran, AS Al-Khalid, and DM Al-Saady. A cryptanalytic attack on vigenere cipher using `", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 601, + 502, + 614 + ], + "spans": [ + { + "bbox": [ + 115, + 601, + 502, + 614 + ], + "score": 1.0, + "content": "genetic algorithm. In Open Systems (ICOS), 2011 IEEE Conference on, pp. 59–64. IEEE, 2011.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 589, + 505, + 614 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 503, + 644 + ], + "lines": [ + { + "bbox": [ + 105, + 619, + 504, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 504, + 633 + ], + "score": 1.0, + "content": "Bhadri Msvs Raju et al. Decipherment of substitution cipher using enhanced probability distribution.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 631, + 387, + 644 + ], + "spans": [ + { + "bbox": [ + 116, + 631, + 387, + 644 + ], + "score": 1.0, + "content": "International Journal of Computer Applications, 5(8):34–40, 2010.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 619, + 504, + 644 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 650, + 503, + 673 + ], + "lines": [ + { + "bbox": [ + 106, + 650, + 505, + 663 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 505, + 663 + ], + "score": 1.0, + "content": "RS Ramesh, G Athithan, and K Thiruvengadam. An automated approach to solve simple substitution", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 661, + 294, + 673 + ], + "spans": [ + { + "bbox": [ + 116, + 661, + 294, + 673 + ], + "score": 1.0, + "content": "ciphers. Cryptologia, 17(2):202–218, 1993.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 106, + 650, + 505, + 673 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 680, + 503, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "Eyyb Sari. tensorflow-cyclegan. https://github.com/Eyyub/tensorflow-cyclegan,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 114, + 689, + 143, + 703 + ], + "spans": [ + { + "bbox": [ + 114, + 689, + 143, + 703 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 678, + 505, + 703 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 709, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "Simon Singh. The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptogra-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 114, + 721, + 196, + 732 + ], + "spans": [ + { + "bbox": [ + 114, + 721, + 196, + 732 + ], + "score": 1.0, + "content": "phy. Anchor, 2000.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 708, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Ragheb Toemeh and Subbanagounder Arumugam. Applying genetic algorithms for searching key-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "space of polyalphabetic substitution ciphers. International Arab Journal of Information Technol-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 105, + 214, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 105, + 214, + 117 + ], + "score": 1.0, + "content": "ogy (IAJIT), 5(1), 2008.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 123, + 504, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "score": 1.0, + "content": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 133, + 505, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 133, + 505, + 146 + ], + "score": 1.0, + "content": "Lukasz Kaiser, and Illia Polosukhin. Attention is all you need. arXiv preprint arXiv:1706.03762,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 144, + 144, + 157 + ], + "spans": [ + { + "bbox": [ + 115, + 144, + 144, + 157 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 104, + 164, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 106, + 163, + 505, + 176 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 176 + ], + "score": 1.0, + "content": "AK Verma, Mayank Dave, and RC Joshi. Genetic algorithm and tabu search attack on the mono-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 174, + 503, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 174, + 503, + 187 + ], + "score": 1.0, + "content": "alphabetic substitution cipher i adhoc networks. In Journal of Computer science. Citeseer, 2007.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 503, + 216 + ], + "lines": [ + { + "bbox": [ + 105, + 193, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 207 + ], + "score": 1.0, + "content": "Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 204, + 324, + 217 + ], + "spans": [ + { + "bbox": [ + 116, + 204, + 324, + 217 + ], + "score": 1.0, + "content": "learning. Machine learning, 8(3-4):229–256, 1992.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 504, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 238 + ], + "score": 1.0, + "content": "Zili Yi, Hao Zhang, Ping Tan Gong, et al. Dualgan: Unsupervised dual learning for image-to-image", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 235, + 327, + 246 + ], + "spans": [ + { + "bbox": [ + 116, + 235, + 327, + 246 + ], + "score": 1.0, + "content": "translation. arXiv preprint arXiv:1704.02510, 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 503, + 277 + ], + "lines": [ + { + "bbox": [ + 105, + 253, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 267 + ], + "score": 1.0, + "content": "Lantao Yu, Weinan Zhang, Jun Wang, and Yong Yu. Seqgan: Sequence generative adversarial nets", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 264, + 330, + 277 + ], + "spans": [ + { + "bbox": [ + 116, + 264, + 330, + 277 + ], + "score": 1.0, + "content": "with policy gradient. In AAAI, pp. 2852–2858, 2017.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 283, + 504, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 505, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 505, + 297 + ], + "score": 1.0, + "content": "Xiang Zhang and Yann LeCun. Text understanding from scratch. arXiv preprint arXiv:1502.01710,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 114, + 293, + 143, + 307 + ], + "spans": [ + { + "bbox": [ + 114, + 293, + 143, + 307 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 504, + 336 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "Jun-Yan Zhu, Taesung Park, Phillip Isola, and Alexei A Efros. Unpaired image-to-image translation", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 324, + 459, + 337 + ], + "spans": [ + { + "bbox": [ + 116, + 324, + 459, + 337 + ], + "score": 1.0, + "content": "using cycle-consistent adversarial networks. arXiv preprint arXiv:1703.10593, 2017.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.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, + 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": [ + 106, + 82, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Ragheb Toemeh and Subbanagounder Arumugam. Applying genetic algorithms for searching key-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "space of polyalphabetic substitution ciphers. International Arab Journal of Information Technol-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 105, + 214, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 105, + 214, + 117 + ], + "score": 1.0, + "content": "ogy (IAJIT), 5(1), 2008.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 505, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 123, + 504, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "score": 1.0, + "content": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 133, + 505, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 133, + 505, + 146 + ], + "score": 1.0, + "content": "Lukasz Kaiser, and Illia Polosukhin. Attention is all you need. arXiv preprint arXiv:1706.03762,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 144, + 144, + 157 + ], + "spans": [ + { + "bbox": [ + 115, + 144, + 144, + 157 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 122, + 505, + 157 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 164, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 106, + 163, + 505, + 176 + ], + "spans": [ + { + "bbox": [ + 106, + 163, + 505, + 176 + ], + "score": 1.0, + "content": "AK Verma, Mayank Dave, and RC Joshi. Genetic algorithm and tabu search attack on the mono-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 174, + 503, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 174, + 503, + 187 + ], + "score": 1.0, + "content": "alphabetic substitution cipher i adhoc networks. In Journal of Computer science. Citeseer, 2007.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 106, + 163, + 505, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 503, + 216 + ], + "lines": [ + { + "bbox": [ + 105, + 193, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 207 + ], + "score": 1.0, + "content": "Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 204, + 324, + 217 + ], + "spans": [ + { + "bbox": [ + 116, + 204, + 324, + 217 + ], + "score": 1.0, + "content": "learning. Machine learning, 8(3-4):229–256, 1992.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 193, + 505, + 217 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 504, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 238 + ], + "score": 1.0, + "content": "Zili Yi, Hao Zhang, Ping Tan Gong, et al. Dualgan: Unsupervised dual learning for image-to-image", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 235, + 327, + 246 + ], + "spans": [ + { + "bbox": [ + 116, + 235, + 327, + 246 + ], + "score": 1.0, + "content": "translation. arXiv preprint arXiv:1704.02510, 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 222, + 505, + 246 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 503, + 277 + ], + "lines": [ + { + "bbox": [ + 105, + 253, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 267 + ], + "score": 1.0, + "content": "Lantao Yu, Weinan Zhang, Jun Wang, and Yong Yu. Seqgan: Sequence generative adversarial nets", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 264, + 330, + 277 + ], + "spans": [ + { + "bbox": [ + 116, + 264, + 330, + 277 + ], + "score": 1.0, + "content": "with policy gradient. In AAAI, pp. 2852–2858, 2017.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 253, + 505, + 277 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 283, + 504, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 505, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 505, + 297 + ], + "score": 1.0, + "content": "Xiang Zhang and Yann LeCun. Text understanding from scratch. arXiv preprint arXiv:1502.01710,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 114, + 293, + 143, + 307 + ], + "spans": [ + { + "bbox": [ + 114, + 293, + 143, + 307 + ], + "score": 1.0, + "content": "2015.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 282, + 505, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 504, + 336 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "Jun-Yan Zhu, Taesung Park, Phillip Isola, and Alexei A Efros. Unpaired image-to-image translation", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 324, + 459, + 337 + ], + "spans": [ + { + "bbox": [ + 116, + 324, + 459, + 337 + ], + "score": 1.0, + "content": "using cycle-consistent adversarial networks. arXiv preprint arXiv:1703.10593, 2017.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 106, + 313, + 505, + 337 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 162, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 163, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 163, + 97 + ], + "score": 1.0, + "content": "APPENDIX", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 105, + 240, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 240, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 240, + 118 + ], + "score": 1.0, + "content": "A ARCHITECTURAL DETAILS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 126, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 105, + 126, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 137 + ], + "score": 1.0, + "content": "For both the generator and discriminator architectures below, we assume the network is provided", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 137, + 504, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 137, + 183, + 149 + ], + "score": 1.0, + "content": "with a sequence of", + "type": "text" + }, + { + "bbox": [ + 184, + 137, + 194, + 147 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 137, + 329, + 149 + ], + "score": 1.0, + "content": "tokens denoted data laying in a", + "type": "text" + }, + { + "bbox": [ + 330, + 137, + 340, + 147 + ], + "score": 0.83, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 137, + 469, + 149 + ], + "score": 1.0, + "content": "-simplex. Therefore data is an", + "type": "text" + }, + { + "bbox": [ + 469, + 137, + 479, + 147 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 137, + 493, + 149 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 493, + 137, + 504, + 147 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 148, + 138, + 159 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 138, + 159 + ], + "score": 1.0, + "content": "matrix.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 108, + 164, + 299, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 163, + 300, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 300, + 179 + ], + "score": 1.0, + "content": "For simplicity we define the following notation:", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 176, + 506, + 238 + ], + "lines": [ + { + "bbox": [ + 115, + 176, + 506, + 238 + ], + "spans": [ + { + "bbox": [ + 115, + 176, + 506, + 238 + ], + "score": 0.89, + "content": "\\begin{array} { r l } & { \\mathrm { \\mathrm { ~ 5 o n v L a y e r } } _ { f _ { c , f s = 1 , s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( C o n v 1 D _ { f c , f s } ( x ) ) ) } \\\\ & { \\qquad \\mathrm { R e s B l o c k } _ { f _ { c , f s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( x + C o n v 1 D _ { f c , f s } ( C o n v 1 D _ { f c , f s } ( x ) ) ) ) } \\\\ & { \\mathrm { C o n v S t a c k } _ { n , f c , f s = 1 } ( x ) = } \\\\ & { \\qquad \\mathrm { C o n v L a y e r } _ { 1 , f s } \\circ \\mathrm { C o n v L a y e r } _ { 2 ^ { 1 } \\cdot f c , f s , 2 } \\circ \\cdot \\cdot \\circ \\mathrm { C o n v L a y e r } _ { 2 ^ { n } \\cdot f c , f s , 2 } \\circ \\mathrm { C o n v L a y e r } _ { f c , f s , 2 } ( x ) } \\end{array}", + "type": "interline_equation", + "image_path": "b6bc893c516af484a84128e05effada85847aaf55223b6144fd89a27a4fde6f2.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 115, + 176, + 506, + 196.66666666666666 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 115, + 196.66666666666666, + 506, + 217.33333333333331 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 115, + 217.33333333333331, + 506, + 237.99999999999997 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 242, + 187, + 254 + ], + "lines": [ + { + "bbox": [ + 106, + 242, + 189, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 242, + 189, + 255 + ], + "score": 1.0, + "content": "A.1 GENERATOR", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 108, + 262, + 246, + 274 + ], + "lines": [ + { + "bbox": [ + 106, + 261, + 247, + 275 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 247, + 275 + ], + "score": 1.0, + "content": "We define the following constants:", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 131, + 280, + 454, + 363 + ], + "lines": [ + { + "bbox": [ + 132, + 281, + 444, + 294 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 142, + 294 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 281, + 177, + 293 + ], + "score": 0.9, + "content": "f c = 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 281, + 444, + 294 + ], + "score": 1.0, + "content": ": The base ’filter count‘, or number of filters in a convolution layer", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 132, + 294, + 453, + 308 + ], + "spans": [ + { + "bbox": [ + 132, + 294, + 142, + 308 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 295, + 172, + 307 + ], + "score": 0.88, + "content": "f s = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 294, + 453, + 308 + ], + "score": 1.0, + "content": ": The ’filter size‘, or width of weight kernel used in convolution layers", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 131, + 308, + 410, + 322 + ], + "spans": [ + { + "bbox": [ + 131, + 308, + 142, + 322 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 310, + 172, + 320 + ], + "score": 0.87, + "content": "v s = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 308, + 410, + 322 + ], + "score": 1.0, + "content": ": The ’vocab size‘, or number of elements in the vocabulary", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 132, + 324, + 315, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 324, + 142, + 335 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 324, + 167, + 334 + ], + "score": 0.89, + "content": "s = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 324, + 315, + 335 + ], + "score": 1.0, + "content": ": The stride of the convolution layers", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 132, + 336, + 367, + 350 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 142, + 350 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 337, + 180, + 348 + ], + "score": 0.89, + "content": "E = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 336, + 367, + 350 + ], + "score": 1.0, + "content": ": The dimensionality of the embedding vectors", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 132, + 350, + 379, + 364 + ], + "spans": [ + { + "bbox": [ + 132, + 350, + 142, + 364 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 351, + 179, + 362 + ], + "score": 0.88, + "content": "T = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 350, + 379, + 364 + ], + "score": 1.0, + "content": ": The dimensionality of the concat timing weights", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 105, + 370, + 505, + 393 + ], + "lines": [ + { + "bbox": [ + 105, + 369, + 506, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 506, + 384 + ], + "score": 1.0, + "content": "First, we first look up embedding vectors corresponding to the observed tokens. This is performed as", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 380, + 507, + 394 + ], + "spans": [ + { + "bbox": [ + 104, + 380, + 437, + 394 + ], + "score": 1.0, + "content": "a simple inner-product between data and a learning weight matrix of embeddings", + "type": "text" + }, + { + "bbox": [ + 437, + 380, + 501, + 392 + ], + "score": 0.94, + "content": "W _ { \\mathrm { E m b } } ^ { \\mathbf { \\Upsilon } ^ { \\bullet } } \\in \\mathbb { R } ^ { K \\times E }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 380, + 507, + 394 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "interline_equation", + "bbox": [ + 267, + 394, + 343, + 406 + ], + "lines": [ + { + "bbox": [ + 267, + 394, + 343, + 406 + ], + "spans": [ + { + "bbox": [ + 267, + 394, + 343, + 406 + ], + "score": 0.81, + "content": "x = \\mathrm { d a t a } \\cdot W _ { \\mathrm { E m b } }", + "type": "interline_equation", + "image_path": "d369ee0fbce1dc54c8b04d98bcf6bd49575caa880828c9ae3bb427de8dff0cbb.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 267, + 394, + 343, + 406 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 414, + 279, + 426 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 280, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 280, + 427 + ], + "score": 1.0, + "content": "Next, a timing signal is added using either:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 133, + 433, + 246, + 444 + ], + "lines": [ + { + "bbox": [ + 132, + 432, + 247, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 432, + 247, + 445 + ], + "score": 1.0, + "content": "• The Transformer method:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 252, + 444, + 396, + 492 + ], + "lines": [ + { + "bbox": [ + 252, + 444, + 396, + 492 + ], + "spans": [ + { + "bbox": [ + 252, + 444, + 396, + 492 + ], + "score": 0.68, + "content": "\\begin{array} { c } { { \\mathrm { s i g n a l } _ { n , 2 k } = \\sin ( n / 1 e 5 ^ { 2 k / K } ) } } \\\\ { { \\mathrm { s i g n a l } _ { n , 2 k + 1 } = \\cos ( n / 1 e 5 ^ { 2 k / K } ) } } \\\\ { { \\mathrm { t i m i n g } ( x ) = x + \\mathrm { s i g n a l } } } \\end{array}", + "type": "interline_equation", + "image_path": "644862dada9fc682578f83c1c6202052ef4856bcbaf6a2f692a486bee38e1486.jpg" + } + ] + } + ], + "index": 22.5, + "virtual_lines": [ + { + "bbox": [ + 252, + 444, + 396, + 468.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 252, + 468.0, + 396, + 492.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 132, + 493, + 223, + 504 + ], + "lines": [ + { + "bbox": [ + 132, + 492, + 223, + 505 + ], + "spans": [ + { + "bbox": [ + 132, + 492, + 223, + 505 + ], + "score": 1.0, + "content": "• The concat method:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 260, + 503, + 387, + 533 + ], + "lines": [ + { + "bbox": [ + 260, + 503, + 387, + 533 + ], + "spans": [ + { + "bbox": [ + 260, + 503, + 387, + 533 + ], + "score": 0.89, + "content": "\\begin{array} { r l } & { W _ { \\mathrm { t i m e } } \\in \\mathbb { R } ^ { N \\times T } } \\\\ & { t = \\mathsf { t i m i n g } ( x ) = [ x \\| _ { 2 } W _ { \\mathrm { t i m e } } ] } \\end{array}", + "type": "interline_equation", + "image_path": "38f70d25f3269ca174bd6c8f5112ff86d4f000e113b0d6975d45f93db42c1b02.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 260, + 503, + 387, + 518.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 260, + 518.0, + 387, + 533.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 139, + 535, + 489, + 548 + ], + "lines": [ + { + "bbox": [ + 141, + 533, + 491, + 549 + ], + "spans": [ + { + "bbox": [ + 141, + 533, + 171, + 549 + ], + "score": 1.0, + "content": "Where", + "type": "text" + }, + { + "bbox": [ + 172, + 536, + 195, + 547 + ], + "score": 0.9, + "content": "W _ { \\mathrm { t i m e } }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 533, + 304, + 549 + ], + "score": 1.0, + "content": "are trained parameters and", + "type": "text" + }, + { + "bbox": [ + 304, + 535, + 326, + 547 + ], + "score": 0.91, + "content": "[ \\cdot | | _ { k } \\cdot ]", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 533, + 457, + 549 + ], + "score": 1.0, + "content": "denotes concatenation along the", + "type": "text" + }, + { + "bbox": [ + 458, + 535, + 470, + 545 + ], + "score": 0.88, + "content": "k ^ { \\mathrm { { t h } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 533, + 491, + 549 + ], + "score": 1.0, + "content": "axis.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 271, + 566 + ], + "lines": [ + { + "bbox": [ + 106, + 555, + 271, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 271, + 567 + ], + "score": 1.0, + "content": "Then the generator is defined as follows:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 176, + 567, + 434, + 616 + ], + "lines": [ + { + "bbox": [ + 176, + 567, + 434, + 616 + ], + "spans": [ + { + "bbox": [ + 176, + 567, + 434, + 616 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { \\phantom { \\frac { 1 } { 2 } } a ( x ) = \\mathrm { C o n v L a y e r } _ { 4 \\cdot f c } ( \\mathrm { C o n v L a y e r } _ { 2 \\cdot f c , f s } ( \\mathrm { C o n v L a y e r } _ { f c } ( x ) ) ) } \\\\ & { \\phantom { \\frac { 1 } { 2 } } b ( x ) = \\mathrm { R e s B l o c k } _ { 4 \\cdot f c } ^ { ( 5 ) } ( x ) } \\\\ & { \\circ \\mathrm { u t } ( t ) = \\mathrm { S o f t m a x } ( \\mathrm { C o n v L a y e r } _ { v s } ( b ( a ( t ) ) ) ) } \\end{array}", + "type": "interline_equation", + "image_path": "d9f1c149bd6d109f6424fd432c6f91acb80d79dbfcd3082d705e83aadc86f891.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 176, + 567, + 434, + 583.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 176, + 583.3333333333334, + 434, + 599.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 176, + 599.6666666666667, + 434, + 616.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 621, + 204, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 205, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 205, + 634 + ], + "score": 1.0, + "content": "A.2 DISCRIMINATOR", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 640, + 246, + 653 + ], + "lines": [ + { + "bbox": [ + 106, + 639, + 247, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 247, + 654 + ], + "score": 1.0, + "content": "We define the following constants:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 132, + 659, + 459, + 700 + ], + "lines": [ + { + "bbox": [ + 132, + 659, + 444, + 673 + ], + "spans": [ + { + "bbox": [ + 132, + 659, + 142, + 673 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 660, + 177, + 672 + ], + "score": 0.9, + "content": "f c = 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 659, + 444, + 673 + ], + "score": 1.0, + "content": ": The base ’filter count‘, or number of filters in a convolution layer", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 132, + 673, + 459, + 686 + ], + "spans": [ + { + "bbox": [ + 132, + 673, + 142, + 686 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 674, + 178, + 686 + ], + "score": 0.88, + "content": "f s = 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 673, + 459, + 686 + ], + "score": 1.0, + "content": ": The ’filter size‘, or width of weight kernel used in convolution layers", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 131, + 688, + 321, + 700 + ], + "spans": [ + { + "bbox": [ + 131, + 688, + 142, + 700 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 688, + 168, + 698 + ], + "score": 0.87, + "content": "n = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 688, + 321, + 700 + ], + "score": 1.0, + "content": ": The depth of the convolutional stack", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 105, + 706, + 483, + 719 + ], + "lines": [ + { + "bbox": [ + 105, + 706, + 483, + 720 + ], + "spans": [ + { + "bbox": [ + 105, + 706, + 483, + 720 + ], + "score": 1.0, + "content": "Similar to the generator, a timing signal is added first. Leading to the following discriminator:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 720, + 393, + 734 + ], + "lines": [ + { + "bbox": [ + 217, + 720, + 393, + 734 + ], + "spans": [ + { + "bbox": [ + 217, + 720, + 393, + 734 + ], + "score": 0.82, + "content": "\\mathsf { o u t } ( t ) = \\mathbf { C o n v S t a c k } _ { n , f c , f s } ( \\mathsf { d r o p o u t } _ { 0 . 5 } ( t ) )", + "type": "interline_equation", + "image_path": "8985869c00ff06fa93f08abfc63569335d94dbe527710cff95326bee8d5af8ee.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 217, + 720, + 393, + 734 + ], + "spans": [], + "index": 38 + } + ] + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "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": "title", + "bbox": [ + 108, + 81, + 162, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 163, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 163, + 97 + ], + "score": 1.0, + "content": "APPENDIX", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 105, + 240, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 240, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 240, + 118 + ], + "score": 1.0, + "content": "A ARCHITECTURAL DETAILS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 106, + 240, + 118 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 126, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 105, + 126, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 137 + ], + "score": 1.0, + "content": "For both the generator and discriminator architectures below, we assume the network is provided", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 137, + 504, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 137, + 183, + 149 + ], + "score": 1.0, + "content": "with a sequence of", + "type": "text" + }, + { + "bbox": [ + 184, + 137, + 194, + 147 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 137, + 329, + 149 + ], + "score": 1.0, + "content": "tokens denoted data laying in a", + "type": "text" + }, + { + "bbox": [ + 330, + 137, + 340, + 147 + ], + "score": 0.83, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 137, + 469, + 149 + ], + "score": 1.0, + "content": "-simplex. Therefore data is an", + "type": "text" + }, + { + "bbox": [ + 469, + 137, + 479, + 147 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 137, + 493, + 149 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 493, + 137, + 504, + 147 + ], + "score": 0.81, + "content": "K", + "type": "inline_equation" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 148, + 138, + 159 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 138, + 159 + ], + "score": 1.0, + "content": "matrix.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 126, + 505, + 159 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 164, + 299, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 163, + 300, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 300, + 179 + ], + "score": 1.0, + "content": "For simplicity we define the following notation:", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 163, + 300, + 179 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 176, + 506, + 238 + ], + "lines": [ + { + "bbox": [ + 115, + 176, + 506, + 238 + ], + "spans": [ + { + "bbox": [ + 115, + 176, + 506, + 238 + ], + "score": 0.89, + "content": "\\begin{array} { r l } & { \\mathrm { \\mathrm { ~ 5 o n v L a y e r } } _ { f _ { c , f s = 1 , s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( C o n v 1 D _ { f c , f s } ( x ) ) ) } \\\\ & { \\qquad \\mathrm { R e s B l o c k } _ { f _ { c , f s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( x + C o n v 1 D _ { f c , f s } ( C o n v 1 D _ { f c , f s } ( x ) ) ) ) } \\\\ & { \\mathrm { C o n v S t a c k } _ { n , f c , f s = 1 } ( x ) = } \\\\ & { \\qquad \\mathrm { C o n v L a y e r } _ { 1 , f s } \\circ \\mathrm { C o n v L a y e r } _ { 2 ^ { 1 } \\cdot f c , f s , 2 } \\circ \\cdot \\cdot \\circ \\mathrm { C o n v L a y e r } _ { 2 ^ { n } \\cdot f c , f s , 2 } \\circ \\mathrm { C o n v L a y e r } _ { f c , f s , 2 } ( x ) } \\end{array}", + "type": "interline_equation", + "image_path": "b6bc893c516af484a84128e05effada85847aaf55223b6144fd89a27a4fde6f2.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 115, + 176, + 506, + 196.66666666666666 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 115, + 196.66666666666666, + 506, + 217.33333333333331 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 115, + 217.33333333333331, + 506, + 237.99999999999997 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 242, + 187, + 254 + ], + "lines": [ + { + "bbox": [ + 106, + 242, + 189, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 242, + 189, + 255 + ], + "score": 1.0, + "content": "A.1 GENERATOR", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 108, + 262, + 246, + 274 + ], + "lines": [ + { + "bbox": [ + 106, + 261, + 247, + 275 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 247, + 275 + ], + "score": 1.0, + "content": "We define the following constants:", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 106, + 261, + 247, + 275 + ] + }, + { + "type": "list", + "bbox": [ + 131, + 280, + 454, + 363 + ], + "lines": [ + { + "bbox": [ + 132, + 281, + 444, + 294 + ], + "spans": [ + { + "bbox": [ + 132, + 281, + 142, + 294 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 281, + 177, + 293 + ], + "score": 0.9, + "content": "f c = 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 281, + 444, + 294 + ], + "score": 1.0, + "content": ": The base ’filter count‘, or number of filters in a convolution layer", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 132, + 294, + 453, + 308 + ], + "spans": [ + { + "bbox": [ + 132, + 294, + 142, + 308 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 295, + 172, + 307 + ], + "score": 0.88, + "content": "f s = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 294, + 453, + 308 + ], + "score": 1.0, + "content": ": The ’filter size‘, or width of weight kernel used in convolution layers", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 131, + 308, + 410, + 322 + ], + "spans": [ + { + "bbox": [ + 131, + 308, + 142, + 322 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 310, + 172, + 320 + ], + "score": 0.87, + "content": "v s = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 308, + 410, + 322 + ], + "score": 1.0, + "content": ": The ’vocab size‘, or number of elements in the vocabulary", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 132, + 324, + 315, + 335 + ], + "spans": [ + { + "bbox": [ + 132, + 324, + 142, + 335 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 324, + 167, + 334 + ], + "score": 0.89, + "content": "s = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 324, + 315, + 335 + ], + "score": 1.0, + "content": ": The stride of the convolution layers", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 132, + 336, + 367, + 350 + ], + "spans": [ + { + "bbox": [ + 132, + 336, + 142, + 350 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 337, + 180, + 348 + ], + "score": 0.89, + "content": "E = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 336, + 367, + 350 + ], + "score": 1.0, + "content": ": The dimensionality of the embedding vectors", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 132, + 350, + 379, + 364 + ], + "spans": [ + { + "bbox": [ + 132, + 350, + 142, + 364 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 351, + 179, + 362 + ], + "score": 0.88, + "content": "T = 1 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 350, + 379, + 364 + ], + "score": 1.0, + "content": ": The dimensionality of the concat timing weights", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + } + ], + "index": 13.5, + "bbox_fs": [ + 131, + 281, + 453, + 364 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 370, + 505, + 393 + ], + "lines": [ + { + "bbox": [ + 105, + 369, + 506, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 506, + 384 + ], + "score": 1.0, + "content": "First, we first look up embedding vectors corresponding to the observed tokens. This is performed as", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 380, + 507, + 394 + ], + "spans": [ + { + "bbox": [ + 104, + 380, + 437, + 394 + ], + "score": 1.0, + "content": "a simple inner-product between data and a learning weight matrix of embeddings", + "type": "text" + }, + { + "bbox": [ + 437, + 380, + 501, + 392 + ], + "score": 0.94, + "content": "W _ { \\mathrm { E m b } } ^ { \\mathbf { \\Upsilon } ^ { \\bullet } } \\in \\mathbb { R } ^ { K \\times E }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 380, + 507, + 394 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 104, + 369, + 507, + 394 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 267, + 394, + 343, + 406 + ], + "lines": [ + { + "bbox": [ + 267, + 394, + 343, + 406 + ], + "spans": [ + { + "bbox": [ + 267, + 394, + 343, + 406 + ], + "score": 0.81, + "content": "x = \\mathrm { d a t a } \\cdot W _ { \\mathrm { E m b } }", + "type": "interline_equation", + "image_path": "d369ee0fbce1dc54c8b04d98bcf6bd49575caa880828c9ae3bb427de8dff0cbb.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 267, + 394, + 343, + 406 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 414, + 279, + 426 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 280, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 280, + 427 + ], + "score": 1.0, + "content": "Next, a timing signal is added using either:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 412, + 280, + 427 + ] + }, + { + "type": "text", + "bbox": [ + 133, + 433, + 246, + 444 + ], + "lines": [ + { + "bbox": [ + 132, + 432, + 247, + 445 + ], + "spans": [ + { + "bbox": [ + 132, + 432, + 247, + 445 + ], + "score": 1.0, + "content": "• The Transformer method:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 132, + 432, + 247, + 445 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 252, + 444, + 396, + 492 + ], + "lines": [ + { + "bbox": [ + 252, + 444, + 396, + 492 + ], + "spans": [ + { + "bbox": [ + 252, + 444, + 396, + 492 + ], + "score": 0.68, + "content": "\\begin{array} { c } { { \\mathrm { s i g n a l } _ { n , 2 k } = \\sin ( n / 1 e 5 ^ { 2 k / K } ) } } \\\\ { { \\mathrm { s i g n a l } _ { n , 2 k + 1 } = \\cos ( n / 1 e 5 ^ { 2 k / K } ) } } \\\\ { { \\mathrm { t i m i n g } ( x ) = x + \\mathrm { s i g n a l } } } \\end{array}", + "type": "interline_equation", + "image_path": "644862dada9fc682578f83c1c6202052ef4856bcbaf6a2f692a486bee38e1486.jpg" + } + ] + } + ], + "index": 22.5, + "virtual_lines": [ + { + "bbox": [ + 252, + 444, + 396, + 468.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 252, + 468.0, + 396, + 492.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 132, + 493, + 223, + 504 + ], + "lines": [ + { + "bbox": [ + 132, + 492, + 223, + 505 + ], + "spans": [ + { + "bbox": [ + 132, + 492, + 223, + 505 + ], + "score": 1.0, + "content": "• The concat method:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 132, + 492, + 223, + 505 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 260, + 503, + 387, + 533 + ], + "lines": [ + { + "bbox": [ + 260, + 503, + 387, + 533 + ], + "spans": [ + { + "bbox": [ + 260, + 503, + 387, + 533 + ], + "score": 0.89, + "content": "\\begin{array} { r l } & { W _ { \\mathrm { t i m e } } \\in \\mathbb { R } ^ { N \\times T } } \\\\ & { t = \\mathsf { t i m i n g } ( x ) = [ x \\| _ { 2 } W _ { \\mathrm { t i m e } } ] } \\end{array}", + "type": "interline_equation", + "image_path": "38f70d25f3269ca174bd6c8f5112ff86d4f000e113b0d6975d45f93db42c1b02.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 260, + 503, + 387, + 518.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 260, + 518.0, + 387, + 533.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 139, + 535, + 489, + 548 + ], + "lines": [ + { + "bbox": [ + 141, + 533, + 491, + 549 + ], + "spans": [ + { + "bbox": [ + 141, + 533, + 171, + 549 + ], + "score": 1.0, + "content": "Where", + "type": "text" + }, + { + "bbox": [ + 172, + 536, + 195, + 547 + ], + "score": 0.9, + "content": "W _ { \\mathrm { t i m e } }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 533, + 304, + 549 + ], + "score": 1.0, + "content": "are trained parameters and", + "type": "text" + }, + { + "bbox": [ + 304, + 535, + 326, + 547 + ], + "score": 0.91, + "content": "[ \\cdot | | _ { k } \\cdot ]", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 533, + 457, + 549 + ], + "score": 1.0, + "content": "denotes concatenation along the", + "type": "text" + }, + { + "bbox": [ + 458, + 535, + 470, + 545 + ], + "score": 0.88, + "content": "k ^ { \\mathrm { { t h } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 533, + 491, + 549 + ], + "score": 1.0, + "content": "axis.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 141, + 533, + 491, + 549 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 271, + 566 + ], + "lines": [ + { + "bbox": [ + 106, + 555, + 271, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 271, + 567 + ], + "score": 1.0, + "content": "Then the generator is defined as follows:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 555, + 271, + 567 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 176, + 567, + 434, + 616 + ], + "lines": [ + { + "bbox": [ + 176, + 567, + 434, + 616 + ], + "spans": [ + { + "bbox": [ + 176, + 567, + 434, + 616 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { \\phantom { \\frac { 1 } { 2 } } a ( x ) = \\mathrm { C o n v L a y e r } _ { 4 \\cdot f c } ( \\mathrm { C o n v L a y e r } _ { 2 \\cdot f c , f s } ( \\mathrm { C o n v L a y e r } _ { f c } ( x ) ) ) } \\\\ & { \\phantom { \\frac { 1 } { 2 } } b ( x ) = \\mathrm { R e s B l o c k } _ { 4 \\cdot f c } ^ { ( 5 ) } ( x ) } \\\\ & { \\circ \\mathrm { u t } ( t ) = \\mathrm { S o f t m a x } ( \\mathrm { C o n v L a y e r } _ { v s } ( b ( a ( t ) ) ) ) } \\end{array}", + "type": "interline_equation", + "image_path": "d9f1c149bd6d109f6424fd432c6f91acb80d79dbfcd3082d705e83aadc86f891.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 176, + 567, + 434, + 583.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 176, + 583.3333333333334, + 434, + 599.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 176, + 599.6666666666667, + 434, + 616.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 621, + 204, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 205, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 205, + 634 + ], + "score": 1.0, + "content": "A.2 DISCRIMINATOR", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 640, + 246, + 653 + ], + "lines": [ + { + "bbox": [ + 106, + 639, + 247, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 247, + 654 + ], + "score": 1.0, + "content": "We define the following constants:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33, + "bbox_fs": [ + 106, + 639, + 247, + 654 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 659, + 459, + 700 + ], + "lines": [ + { + "bbox": [ + 132, + 659, + 444, + 673 + ], + "spans": [ + { + "bbox": [ + 132, + 659, + 142, + 673 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 660, + 177, + 672 + ], + "score": 0.9, + "content": "f c = 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 659, + 444, + 673 + ], + "score": 1.0, + "content": ": The base ’filter count‘, or number of filters in a convolution layer", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 132, + 673, + 459, + 686 + ], + "spans": [ + { + "bbox": [ + 132, + 673, + 142, + 686 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 674, + 178, + 686 + ], + "score": 0.88, + "content": "f s = 1 5", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 673, + 459, + 686 + ], + "score": 1.0, + "content": ": The ’filter size‘, or width of weight kernel used in convolution layers", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 131, + 688, + 321, + 700 + ], + "spans": [ + { + "bbox": [ + 131, + 688, + 142, + 700 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 688, + 168, + 698 + ], + "score": 0.87, + "content": "n = 5", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 688, + 321, + 700 + ], + "score": 1.0, + "content": ": The depth of the convolutional stack", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 131, + 659, + 459, + 700 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 706, + 483, + 719 + ], + "lines": [ + { + "bbox": [ + 105, + 706, + 483, + 720 + ], + "spans": [ + { + "bbox": [ + 105, + 706, + 483, + 720 + ], + "score": 1.0, + "content": "Similar to the generator, a timing signal is added first. Leading to the following discriminator:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 706, + 483, + 720 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 720, + 393, + 734 + ], + "lines": [ + { + "bbox": [ + 217, + 720, + 393, + 734 + ], + "spans": [ + { + "bbox": [ + 217, + 720, + 393, + 734 + ], + "score": 0.82, + "content": "\\mathsf { o u t } ( t ) = \\mathbf { C o n v S t a c k } _ { n , f c , f s } ( \\mathsf { d r o p o u t } _ { 0 . 5 } ( t ) )", + "type": "interline_equation", + "image_path": "8985869c00ff06fa93f08abfc63569335d94dbe527710cff95326bee8d5af8ee.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 217, + 720, + 393, + 734 + ], + "spans": [], + "index": 38 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 236, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 236, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 236, + 95 + ], + "score": 1.0, + "content": "B PROOF OF PROPOSITION 1", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 102, + 305, + 114 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 307, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 307, + 118 + ], + "score": 1.0, + "content": "Proposition 1 (Reliable Fooling Via Relaxation).", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 109, + 115, + 137, + 125 + ], + "lines": [ + { + "bbox": [ + 108, + 113, + 139, + 127 + ], + "spans": [ + { + "bbox": [ + 108, + 113, + 139, + 127 + ], + "score": 1.0, + "content": "Given:", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 132, + 127, + 412, + 197 + ], + "lines": [ + { + "bbox": [ + 131, + 127, + 361, + 141 + ], + "spans": [ + { + "bbox": [ + 131, + 128, + 205, + 141 + ], + "score": 1.0, + "content": "• discrete spaces", + "type": "text" + }, + { + "bbox": [ + 205, + 129, + 227, + 140 + ], + "score": 0.88, + "content": "\\mathcal { X } , \\mathcal { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 128, + 339, + 141 + ], + "score": 1.0, + "content": "and continuous relaxations", + "type": "text" + }, + { + "bbox": [ + 339, + 127, + 361, + 140 + ], + "score": 0.57, + "content": "\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }", + "type": "inline_equation" + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 146, + 412, + 160 + ], + "spans": [ + { + "bbox": [ + 131, + 146, + 187, + 160 + ], + "score": 1.0, + "content": "• generators", + "type": "text" + }, + { + "bbox": [ + 188, + 146, + 289, + 159 + ], + "score": 0.91, + "content": "F : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { V } } } , G : \\overline { { \\mathcal { V } } } \\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 146, + 372, + 160 + ], + "score": 1.0, + "content": "bijections satisfying", + "type": "text" + }, + { + "bbox": [ + 372, + 147, + 412, + 158 + ], + "score": 0.86, + "content": "F = G ^ { - 1 }", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 165, + 383, + 179 + ], + "spans": [ + { + "bbox": [ + 132, + 165, + 236, + 179 + ], + "score": 1.0, + "content": "• discrete discriminators", + "type": "text" + }, + { + "bbox": [ + 237, + 167, + 272, + 178 + ], + "score": 0.91, + "content": "D _ { \\mathcal { X } } , D _ { \\mathcal { Y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 165, + 362, + 179 + ], + "score": 1.0, + "content": "both optimal for fixed", + "type": "text" + }, + { + "bbox": [ + 362, + 166, + 383, + 177 + ], + "score": 0.85, + "content": "F , G", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 183, + 280, + 198 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 246, + 198 + ], + "score": 1.0, + "content": "• rediscretization functions", + "type": "text" + }, + { + "bbox": [ + 246, + 185, + 280, + 196 + ], + "score": 0.89, + "content": "R _ { \\mathcal { X } } , R _ { \\mathcal { Y } }", + "type": "inline_equation" + } + ], + "index": 6 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 106, + 204, + 506, + 273 + ], + "lines": [ + { + "bbox": [ + 106, + 205, + 504, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 146, + 218 + ], + "score": 1.0, + "content": "Suppose:", + "type": "text" + }, + { + "bbox": [ + 146, + 206, + 155, + 215 + ], + "score": 0.76, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 205, + 416, + 218 + ], + "score": 1.0, + "content": "is approximately volume preserving in a small region about each", + "type": "text" + }, + { + "bbox": [ + 416, + 205, + 443, + 215 + ], + "score": 0.88, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 205, + 504, + 218 + ], + "score": 1.0, + "content": ". Consequently", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 216, + 271, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 186, + 228 + ], + "score": 1.0, + "content": "the same is true for", + "type": "text" + }, + { + "bbox": [ + 186, + 217, + 195, + 226 + ], + "score": 0.71, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 216, + 243, + 228 + ], + "score": 1.0, + "content": "about each", + "type": "text" + }, + { + "bbox": [ + 243, + 217, + 268, + 228 + ], + "score": 0.91, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 216, + 271, + 228 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 357, + 240 + ], + "score": 1.0, + "content": "If: during training, we replace discrete random variables from", + "type": "text" + }, + { + "bbox": [ + 357, + 227, + 367, + 237 + ], + "score": 0.77, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 226, + 506, + 240 + ], + "score": 1.0, + "content": "which lie in the continuous metric", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 237, + 299, + 251 + ], + "spans": [ + { + "bbox": [ + 104, + 237, + 132, + 251 + ], + "score": 1.0, + "content": "space", + "type": "text" + }, + { + "bbox": [ + 132, + 238, + 141, + 248 + ], + "score": 0.81, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 237, + 299, + 251 + ], + "score": 1.0, + "content": "with samples from regions about them.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 248, + 504, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 274, + 262 + ], + "score": 1.0, + "content": "Then: the optimal relaxed discriminators", + "type": "text" + }, + { + "bbox": [ + 274, + 249, + 291, + 261 + ], + "score": 0.91, + "content": "D _ { \\overline { { \\mathcal { X } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 248, + 309, + 262 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 310, + 249, + 326, + 262 + ], + "score": 0.9, + "content": "D _ { \\overline { { { y } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 248, + 475, + 262 + ], + "score": 1.0, + "content": "have a non-empty region about each", + "type": "text" + }, + { + "bbox": [ + 475, + 249, + 504, + 259 + ], + "score": 0.87, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 261, + 429, + 274 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 124, + 274 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 261, + 150, + 273 + ], + "score": 0.88, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 261, + 348, + 274 + ], + "score": 1.0, + "content": "where they are expected to assign values close to", + "type": "text" + }, + { + "bbox": [ + 349, + 261, + 378, + 273 + ], + "score": 0.92, + "content": "D _ { \\mathcal { X } } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 261, + 397, + 274 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 398, + 261, + 426, + 273 + ], + "score": 0.92, + "content": "D _ { \\mathcal { Y } } ( y )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 261, + 429, + 274 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 108, + 284, + 450, + 297 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 450, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 450, + 298 + ], + "score": 1.0, + "content": "Proof. We’ll prove one side of the CipherGAN as the proof for both sides are similar.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 108, + 301, + 506, + 336 + ], + "lines": [ + { + "bbox": [ + 105, + 300, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 351, + 315 + ], + "score": 1.0, + "content": "Given bijective function between continuous relaxations of", + "type": "text" + }, + { + "bbox": [ + 351, + 302, + 361, + 312 + ], + "score": 0.82, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 300, + 381, + 315 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 381, + 302, + 390, + 313 + ], + "score": 0.54, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 300, + 397, + 315 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 397, + 300, + 501, + 314 + ], + "score": 0.88, + "content": "F : ( \\overline { { \\mathcal { X } } } , d _ { \\overline { { \\mathcal { X } } } } ) ( \\overline { { \\mathcal { V } } } , d _ { \\overline { { \\mathcal { V } } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 300, + 505, + 315 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 312, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 133, + 325 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 313, + 144, + 322 + ], + "score": 0.83, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 312, + 162, + 325 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 162, + 313, + 171, + 324 + ], + "score": 0.84, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 312, + 301, + 325 + ], + "score": 1.0, + "content": "contain finite sequences (length", + "type": "text" + }, + { + "bbox": [ + 302, + 315, + 309, + 322 + ], + "score": 0.7, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 312, + 505, + 325 + ], + "score": 1.0, + "content": ") of vectors laying on the vertices of the simplex", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 322, + 357, + 337 + ], + "spans": [ + { + "bbox": [ + 107, + 323, + 120, + 334 + ], + "score": 0.87, + "content": "\\Delta ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 322, + 274, + 337 + ], + "score": 1.0, + "content": ", and are supports of data distributions", + "type": "text" + }, + { + "bbox": [ + 275, + 326, + 304, + 335 + ], + "score": 0.9, + "content": "p _ { \\mathscr { X } } , p _ { \\mathscr { Y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 322, + 357, + 337 + ], + "score": 1.0, + "content": "respectively.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 341, + 124, + 352 + ], + "lines": [ + { + "bbox": [ + 105, + 340, + 126, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 126, + 354 + ], + "score": 1.0, + "content": "Let:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 132, + 361, + 502, + 419 + ], + "lines": [ + { + "bbox": [ + 131, + 360, + 483, + 388 + ], + "spans": [ + { + "bbox": [ + 131, + 360, + 141, + 378 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 361, + 249, + 388 + ], + "score": 0.73, + "content": "\\overline { { \\mathcal { X } } } = \\overline { { \\mathcal { Y } } } = \\underbrace { \\Delta ^ { k } \\times \\cdots \\times \\Delta ^ { k } } _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 360, + 270, + 378 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 270, + 364, + 277, + 373 + ], + "score": 0.82, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 360, + 483, + 378 + ], + "score": 1.0, + "content": "equal to the number of elements in our vocabulary.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 393, + 505, + 410 + ], + "spans": [ + { + "bbox": [ + 130, + 393, + 257, + 410 + ], + "score": 1.0, + "content": "• the rediscretization function", + "type": "text" + }, + { + "bbox": [ + 258, + 395, + 315, + 407 + ], + "score": 0.67, + "content": "R _ { { \\mathcal { X } } } : { \\overline { { { \\mathcal { X } } } } } { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 393, + 319, + 410 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 320, + 396, + 449, + 408 + ], + "score": 0.81, + "content": "R _ { { \\mathcal K } } ( \\bar { x } ) = \\arg \\operatorname* { m i n } _ { x \\in { \\mathcal K } } d _ { \\overline { { { \\mathcal K } } } } ( \\bar { x } , x )", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 393, + 505, + 410 + ], + "score": 1.0, + "content": "; similarly for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 404, + 164, + 423 + ], + "spans": [ + { + "bbox": [ + 142, + 407, + 157, + 419 + ], + "score": 0.87, + "content": "R _ { \\mathcal { Y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 404, + 164, + 423 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 105, + 429, + 505, + 452 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 168, + 442 + ], + "score": 1.0, + "content": "Now, for each", + "type": "text" + }, + { + "bbox": [ + 168, + 430, + 200, + 440 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 428, + 301, + 442 + ], + "score": 1.0, + "content": "consider the infinite set", + "type": "text" + }, + { + "bbox": [ + 301, + 430, + 313, + 441 + ], + "score": 0.89, + "content": "S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 428, + 505, + 442 + ], + "score": 1.0, + "content": "with cardinality of the continuum constructed", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 439, + 163, + 455 + ], + "spans": [ + { + "bbox": [ + 104, + 439, + 163, + 455 + ], + "score": 1.0, + "content": "according to:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 465, + 160, + 477 + ], + "lines": [ + { + "bbox": [ + 105, + 462, + 162, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 162, + 480 + ], + "score": 1.0, + "content": "Equivalently,", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 474, + 377, + 490 + ], + "lines": [ + { + "bbox": [ + 233, + 474, + 377, + 490 + ], + "spans": [ + { + "bbox": [ + 233, + 474, + 377, + 490 + ], + "score": 0.91, + "content": "S _ { x } = R _ { \\chi } ^ { - 1 } ( x ) \\cap F ^ { - 1 } ( R _ { \\ y } ^ { - 1 } ( F ( x ) ) )", + "type": "interline_equation", + "image_path": "798ecb9854547d76cb84b2ddfef24b6f2b7d91539da30ed7a6abecf3845aaf29.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 233, + 474, + 377, + 490 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 493, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 133, + 506 + ], + "score": 1.0, + "content": "Note.", + "type": "text" + }, + { + "bbox": [ + 133, + 494, + 145, + 505 + ], + "score": 0.89, + "content": "S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 492, + 505, + 506 + ], + "score": 1.0, + "content": "is never of cardinality less than the continuum since the following is implied by the defini-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 504, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 139, + 517 + ], + "score": 1.0, + "content": "tions of", + "type": "text" + }, + { + "bbox": [ + 139, + 505, + 154, + 515 + ], + "score": 0.76, + "content": "R _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 504, + 158, + 517 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 159, + 505, + 171, + 515 + ], + "score": 0.82, + "content": "S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 504, + 240, + 517 + ], + "score": 1.0, + "content": "and the fact that", + "type": "text" + }, + { + "bbox": [ + 241, + 505, + 249, + 514 + ], + "score": 0.84, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 504, + 311, + 517 + ], + "score": 1.0, + "content": "is continuous:", + "type": "text" + }, + { + "bbox": [ + 311, + 505, + 412, + 515 + ], + "score": 0.84, + "content": "x \\in \\mathcal { X } \\implies x \\in S _ { x } \\wedge \\exists", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 504, + 460, + 517 + ], + "score": 1.0, + "content": "closed ball", + "type": "text" + }, + { + "bbox": [ + 460, + 505, + 484, + 516 + ], + "score": 0.91, + "content": "B _ { \\epsilon } [ x ]", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 504, + 505, + 517 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 514, + 136, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 136, + 528 + ], + "score": 1.0, + "content": "radius", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 525, + 381, + 554 + ], + "lines": [ + { + "bbox": [ + 230, + 525, + 381, + 554 + ], + "spans": [ + { + "bbox": [ + 230, + 525, + 381, + 554 + ], + "score": 0.91, + "content": "0 < \\epsilon < \\operatorname* { m i n } _ { \\substack { z \\in \\overline { { \\mathcal X } } } } d _ { \\mathcal X } ( x , z )", + "type": "interline_equation", + "image_path": "173b64083c6fe68ba5bfe354bcd91499af11b4954ead01712d0c1ffe9df95617.jpg" + } + ] + } + ], + "index": 28.5, + "virtual_lines": [ + { + "bbox": [ + 230, + 525, + 381, + 539.5 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 230, + 539.5, + 381, + 554.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 565, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 106, + 565, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 192, + 578 + ], + "score": 1.0, + "content": "So, for each element", + "type": "text" + }, + { + "bbox": [ + 192, + 567, + 222, + 576 + ], + "score": 0.92, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 565, + 370, + 578 + ], + "score": 1.0, + "content": "there exists a closed set of points in", + "type": "text" + }, + { + "bbox": [ + 370, + 565, + 380, + 576 + ], + "score": 0.85, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 565, + 505, + 578 + ], + "score": 1.0, + "content": "which are rediscretized, under", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 107, + 576, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 107, + 577, + 122, + 588 + ], + "score": 0.87, + "content": "R _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 123, + 576, + 138, + 590 + ], + "score": 1.0, + "content": ", to", + "type": "text" + }, + { + "bbox": [ + 139, + 579, + 145, + 587 + ], + "score": 0.74, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 576, + 178, + 590 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 178, + 577, + 191, + 588 + ], + "score": 0.89, + "content": "S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 576, + 505, + 590 + ], + "score": 1.0, + "content": "is a Borel Set we can sample uniformly from it. Therefore, during training", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 587, + 375, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 252, + 601 + ], + "score": 1.0, + "content": "suppose we replace each element of", + "type": "text" + }, + { + "bbox": [ + 252, + 588, + 280, + 598 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 587, + 339, + 601 + ], + "score": 1.0, + "content": "with a sample", + "type": "text" + }, + { + "bbox": [ + 339, + 588, + 370, + 599 + ], + "score": 0.91, + "content": "\\bar { x } \\sim S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 587, + 375, + 601 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 108, + 604, + 255, + 616 + ], + "lines": [ + { + "bbox": [ + 106, + 603, + 256, + 618 + ], + "spans": [ + { + "bbox": [ + 106, + 603, + 256, + 618 + ], + "score": 1.0, + "content": "We begin with the discrete objective:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 619, + 407, + 647 + ], + "lines": [ + { + "bbox": [ + 203, + 619, + 407, + 647 + ], + "spans": [ + { + "bbox": [ + 203, + 619, + 407, + 647 + ], + "score": 0.91, + "content": "\\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal { X } } ( x ) \\log ( D _ { \\mathcal { X } } ( x ) ) + p _ { F } ( x ) \\log ( 1 - D _ { \\mathcal { X } } ( x ) )", + "type": "interline_equation", + "image_path": "952e6737c0ea248058e3c37db45cee03f5acc0fae8c07deca454a8d4ad5d16c5.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 203, + 619, + 407, + 647 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 656, + 490, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 656, + 490, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 656, + 393, + 670 + ], + "score": 1.0, + "content": "As was noted in Goodfellow et al. (2014), this objective is optimized in", + "type": "text" + }, + { + "bbox": [ + 394, + 657, + 462, + 669 + ], + "score": 0.93, + "content": "D _ { \\mathcal { X } } : \\mathcal { X } [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 656, + 490, + 670 + ], + "score": 1.0, + "content": "when:", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "interline_equation", + "bbox": [ + 271, + 671, + 340, + 695 + ], + "lines": [ + { + "bbox": [ + 271, + 671, + 340, + 695 + ], + "spans": [ + { + "bbox": [ + 271, + 671, + 340, + 695 + ], + "score": 0.94, + "content": "D _ { \\mathcal { X } } = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + p _ { G } }", + "type": "interline_equation", + "image_path": "6e5de30ec7d12996f18760572256a0daf483fd32d056422c6668e1af3b05f79c.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 271, + 671, + 340, + 695 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 696, + 507, + 714 + ], + "spans": [ + { + "bbox": [ + 104, + 696, + 202, + 714 + ], + "score": 1.0, + "content": "which is undesirable as", + "type": "text" + }, + { + "bbox": [ + 203, + 701, + 216, + 711 + ], + "score": 0.84, + "content": "p _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 696, + 364, + 714 + ], + "score": 1.0, + "content": "is a sum of Dirac delta distributions", + "type": "text" + }, + { + "bbox": [ + 364, + 698, + 463, + 712 + ], + "score": 0.92, + "content": "\\begin{array} { r } { p _ { \\mathcal { X } } ( x ) = \\sum _ { x _ { i } \\in \\mathcal { X } } \\delta _ { x _ { i } } ( x ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 696, + 507, + 714 + ], + "score": 1.0, + "content": "and lacks", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "a non-zero gradient to train the generator function with. Instead, let us consider a continuous relax-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 720, + 427, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 129, + 733 + ], + "score": 1.0, + "content": "ation", + "type": "text" + }, + { + "bbox": [ + 129, + 720, + 198, + 733 + ], + "score": 0.94, + "content": "D _ { \\overline { { \\mathcal { X } } } } : \\overline { { \\mathcal { X } } } [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 721, + 280, + 733 + ], + "score": 1.0, + "content": "of the discriminator", + "type": "text" + }, + { + "bbox": [ + 281, + 721, + 297, + 732 + ], + "score": 0.89, + "content": "D _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 721, + 427, + 733 + ], + "score": 1.0, + "content": "and observe where it optimizes.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + } + ], + "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, + 236, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 236, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 236, + 95 + ], + "score": 1.0, + "content": "B PROOF OF PROPOSITION 1", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 82, + 236, + 95 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 102, + 305, + 114 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 307, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 307, + 118 + ], + "score": 1.0, + "content": "Proposition 1 (Reliable Fooling Via Relaxation).", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 100, + 307, + 118 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 115, + 137, + 125 + ], + "lines": [ + { + "bbox": [ + 108, + 113, + 139, + 127 + ], + "spans": [ + { + "bbox": [ + 108, + 113, + 139, + 127 + ], + "score": 1.0, + "content": "Given:", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 108, + 113, + 139, + 127 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 127, + 412, + 197 + ], + "lines": [ + { + "bbox": [ + 131, + 127, + 361, + 141 + ], + "spans": [ + { + "bbox": [ + 131, + 128, + 205, + 141 + ], + "score": 1.0, + "content": "• discrete spaces", + "type": "text" + }, + { + "bbox": [ + 205, + 129, + 227, + 140 + ], + "score": 0.88, + "content": "\\mathcal { X } , \\mathcal { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 128, + 339, + 141 + ], + "score": 1.0, + "content": "and continuous relaxations", + "type": "text" + }, + { + "bbox": [ + 339, + 127, + 361, + 140 + ], + "score": 0.57, + "content": "\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }", + "type": "inline_equation" + } + ], + "index": 3 + }, + { + "bbox": [ + 131, + 146, + 412, + 160 + ], + "spans": [ + { + "bbox": [ + 131, + 146, + 187, + 160 + ], + "score": 1.0, + "content": "• generators", + "type": "text" + }, + { + "bbox": [ + 188, + 146, + 289, + 159 + ], + "score": 0.91, + "content": "F : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { V } } } , G : \\overline { { \\mathcal { V } } } \\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 146, + 372, + 160 + ], + "score": 1.0, + "content": "bijections satisfying", + "type": "text" + }, + { + "bbox": [ + 372, + 147, + 412, + 158 + ], + "score": 0.86, + "content": "F = G ^ { - 1 }", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 132, + 165, + 383, + 179 + ], + "spans": [ + { + "bbox": [ + 132, + 165, + 236, + 179 + ], + "score": 1.0, + "content": "• discrete discriminators", + "type": "text" + }, + { + "bbox": [ + 237, + 167, + 272, + 178 + ], + "score": 0.91, + "content": "D _ { \\mathcal { X } } , D _ { \\mathcal { Y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 165, + 362, + 179 + ], + "score": 1.0, + "content": "both optimal for fixed", + "type": "text" + }, + { + "bbox": [ + 362, + 166, + 383, + 177 + ], + "score": 0.85, + "content": "F , G", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 132, + 183, + 280, + 198 + ], + "spans": [ + { + "bbox": [ + 132, + 183, + 246, + 198 + ], + "score": 1.0, + "content": "• rediscretization functions", + "type": "text" + }, + { + "bbox": [ + 246, + 185, + 280, + 196 + ], + "score": 0.89, + "content": "R _ { \\mathcal { X } } , R _ { \\mathcal { Y } }", + "type": "inline_equation" + } + ], + "index": 6 + } + ], + "index": 4.5, + "bbox_fs": [ + 131, + 127, + 412, + 198 + ] + }, + { + "type": "list", + "bbox": [ + 106, + 204, + 506, + 273 + ], + "lines": [ + { + "bbox": [ + 106, + 205, + 504, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 146, + 218 + ], + "score": 1.0, + "content": "Suppose:", + "type": "text" + }, + { + "bbox": [ + 146, + 206, + 155, + 215 + ], + "score": 0.76, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 205, + 416, + 218 + ], + "score": 1.0, + "content": "is approximately volume preserving in a small region about each", + "type": "text" + }, + { + "bbox": [ + 416, + 205, + 443, + 215 + ], + "score": 0.88, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 205, + 504, + 218 + ], + "score": 1.0, + "content": ". Consequently", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 216, + 271, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 186, + 228 + ], + "score": 1.0, + "content": "the same is true for", + "type": "text" + }, + { + "bbox": [ + 186, + 217, + 195, + 226 + ], + "score": 0.71, + "content": "G", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 216, + 243, + 228 + ], + "score": 1.0, + "content": "about each", + "type": "text" + }, + { + "bbox": [ + 243, + 217, + 268, + 228 + ], + "score": 0.91, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 216, + 271, + 228 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 226, + 506, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 357, + 240 + ], + "score": 1.0, + "content": "If: during training, we replace discrete random variables from", + "type": "text" + }, + { + "bbox": [ + 357, + 227, + 367, + 237 + ], + "score": 0.77, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 226, + 506, + 240 + ], + "score": 1.0, + "content": "which lie in the continuous metric", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 104, + 237, + 299, + 251 + ], + "spans": [ + { + "bbox": [ + 104, + 237, + 132, + 251 + ], + "score": 1.0, + "content": "space", + "type": "text" + }, + { + "bbox": [ + 132, + 238, + 141, + 248 + ], + "score": 0.81, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 237, + 299, + 251 + ], + "score": 1.0, + "content": "with samples from regions about them.", + "type": "text" + } + ], + "index": 10, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 248, + 504, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 274, + 262 + ], + "score": 1.0, + "content": "Then: the optimal relaxed discriminators", + "type": "text" + }, + { + "bbox": [ + 274, + 249, + 291, + 261 + ], + "score": 0.91, + "content": "D _ { \\overline { { \\mathcal { X } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 248, + 309, + 262 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 310, + 249, + 326, + 262 + ], + "score": 0.9, + "content": "D _ { \\overline { { { y } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 248, + 475, + 262 + ], + "score": 1.0, + "content": "have a non-empty region about each", + "type": "text" + }, + { + "bbox": [ + 475, + 249, + 504, + 259 + ], + "score": 0.87, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 261, + 429, + 274 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 124, + 274 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 261, + 150, + 273 + ], + "score": 0.88, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 261, + 348, + 274 + ], + "score": 1.0, + "content": "where they are expected to assign values close to", + "type": "text" + }, + { + "bbox": [ + 349, + 261, + 378, + 273 + ], + "score": 0.92, + "content": "D _ { \\mathcal { X } } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 261, + 397, + 274 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 398, + 261, + 426, + 273 + ], + "score": 0.92, + "content": "D _ { \\mathcal { Y } } ( y )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 261, + 429, + 274 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12, + "is_list_end_line": true + } + ], + "index": 9.5, + "bbox_fs": [ + 104, + 205, + 506, + 274 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 284, + 450, + 297 + ], + "lines": [ + { + "bbox": [ + 105, + 284, + 450, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 450, + 298 + ], + "score": 1.0, + "content": "Proof. We’ll prove one side of the CipherGAN as the proof for both sides are similar.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 284, + 450, + 298 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 301, + 506, + 336 + ], + "lines": [ + { + "bbox": [ + 105, + 300, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 351, + 315 + ], + "score": 1.0, + "content": "Given bijective function between continuous relaxations of", + "type": "text" + }, + { + "bbox": [ + 351, + 302, + 361, + 312 + ], + "score": 0.82, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 300, + 381, + 315 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 381, + 302, + 390, + 313 + ], + "score": 0.54, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 300, + 397, + 315 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 397, + 300, + 501, + 314 + ], + "score": 0.88, + "content": "F : ( \\overline { { \\mathcal { X } } } , d _ { \\overline { { \\mathcal { X } } } } ) ( \\overline { { \\mathcal { V } } } , d _ { \\overline { { \\mathcal { V } } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 300, + 505, + 315 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 312, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 133, + 325 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 313, + 144, + 322 + ], + "score": 0.83, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 312, + 162, + 325 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 162, + 313, + 171, + 324 + ], + "score": 0.84, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 312, + 301, + 325 + ], + "score": 1.0, + "content": "contain finite sequences (length", + "type": "text" + }, + { + "bbox": [ + 302, + 315, + 309, + 322 + ], + "score": 0.7, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 312, + 505, + 325 + ], + "score": 1.0, + "content": ") of vectors laying on the vertices of the simplex", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 322, + 357, + 337 + ], + "spans": [ + { + "bbox": [ + 107, + 323, + 120, + 334 + ], + "score": 0.87, + "content": "\\Delta ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 322, + 274, + 337 + ], + "score": 1.0, + "content": ", and are supports of data distributions", + "type": "text" + }, + { + "bbox": [ + 275, + 326, + 304, + 335 + ], + "score": 0.9, + "content": "p _ { \\mathscr { X } } , p _ { \\mathscr { Y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 322, + 357, + 337 + ], + "score": 1.0, + "content": "respectively.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 300, + 505, + 337 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 341, + 124, + 352 + ], + "lines": [ + { + "bbox": [ + 105, + 340, + 126, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 126, + 354 + ], + "score": 1.0, + "content": "Let:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 340, + 126, + 354 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 361, + 502, + 419 + ], + "lines": [ + { + "bbox": [ + 131, + 360, + 483, + 388 + ], + "spans": [ + { + "bbox": [ + 131, + 360, + 141, + 378 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 361, + 249, + 388 + ], + "score": 0.73, + "content": "\\overline { { \\mathcal { X } } } = \\overline { { \\mathcal { Y } } } = \\underbrace { \\Delta ^ { k } \\times \\cdots \\times \\Delta ^ { k } } _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 360, + 270, + 378 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 270, + 364, + 277, + 373 + ], + "score": 0.82, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 360, + 483, + 378 + ], + "score": 1.0, + "content": "equal to the number of elements in our vocabulary.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 130, + 393, + 505, + 410 + ], + "spans": [ + { + "bbox": [ + 130, + 393, + 257, + 410 + ], + "score": 1.0, + "content": "• the rediscretization function", + "type": "text" + }, + { + "bbox": [ + 258, + 395, + 315, + 407 + ], + "score": 0.67, + "content": "R _ { { \\mathcal { X } } } : { \\overline { { { \\mathcal { X } } } } } { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 393, + 319, + 410 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 320, + 396, + 449, + 408 + ], + "score": 0.81, + "content": "R _ { { \\mathcal K } } ( \\bar { x } ) = \\arg \\operatorname* { m i n } _ { x \\in { \\mathcal K } } d _ { \\overline { { { \\mathcal K } } } } ( \\bar { x } , x )", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 393, + 505, + 410 + ], + "score": 1.0, + "content": "; similarly for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 404, + 164, + 423 + ], + "spans": [ + { + "bbox": [ + 142, + 407, + 157, + 419 + ], + "score": 0.87, + "content": "R _ { \\mathcal { Y } }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 404, + 164, + 423 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 130, + 360, + 505, + 423 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 429, + 505, + 452 + ], + "lines": [ + { + "bbox": [ + 105, + 428, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 168, + 442 + ], + "score": 1.0, + "content": "Now, for each", + "type": "text" + }, + { + "bbox": [ + 168, + 430, + 200, + 440 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 428, + 301, + 442 + ], + "score": 1.0, + "content": "consider the infinite set", + "type": "text" + }, + { + "bbox": [ + 301, + 430, + 313, + 441 + ], + "score": 0.89, + "content": "S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 428, + 505, + 442 + ], + "score": 1.0, + "content": "with cardinality of the continuum constructed", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 439, + 163, + 455 + ], + "spans": [ + { + "bbox": [ + 104, + 439, + 163, + 455 + ], + "score": 1.0, + "content": "according to:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 104, + 428, + 505, + 455 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 465, + 160, + 477 + ], + "lines": [ + { + "bbox": [ + 105, + 462, + 162, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 162, + 480 + ], + "score": 1.0, + "content": "Equivalently,", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 462, + 162, + 480 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 474, + 377, + 490 + ], + "lines": [ + { + "bbox": [ + 233, + 474, + 377, + 490 + ], + "spans": [ + { + "bbox": [ + 233, + 474, + 377, + 490 + ], + "score": 0.91, + "content": "S _ { x } = R _ { \\chi } ^ { - 1 } ( x ) \\cap F ^ { - 1 } ( R _ { \\ y } ^ { - 1 } ( F ( x ) ) )", + "type": "interline_equation", + "image_path": "798ecb9854547d76cb84b2ddfef24b6f2b7d91539da30ed7a6abecf3845aaf29.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 233, + 474, + 377, + 490 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 493, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 133, + 506 + ], + "score": 1.0, + "content": "Note.", + "type": "text" + }, + { + "bbox": [ + 133, + 494, + 145, + 505 + ], + "score": 0.89, + "content": "S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 492, + 505, + 506 + ], + "score": 1.0, + "content": "is never of cardinality less than the continuum since the following is implied by the defini-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 504, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 139, + 517 + ], + "score": 1.0, + "content": "tions of", + "type": "text" + }, + { + "bbox": [ + 139, + 505, + 154, + 515 + ], + "score": 0.76, + "content": "R _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 504, + 158, + 517 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 159, + 505, + 171, + 515 + ], + "score": 0.82, + "content": "S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 504, + 240, + 517 + ], + "score": 1.0, + "content": "and the fact that", + "type": "text" + }, + { + "bbox": [ + 241, + 505, + 249, + 514 + ], + "score": 0.84, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 504, + 311, + 517 + ], + "score": 1.0, + "content": "is continuous:", + "type": "text" + }, + { + "bbox": [ + 311, + 505, + 412, + 515 + ], + "score": 0.84, + "content": "x \\in \\mathcal { X } \\implies x \\in S _ { x } \\wedge \\exists", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 504, + 460, + 517 + ], + "score": 1.0, + "content": "closed ball", + "type": "text" + }, + { + "bbox": [ + 460, + 505, + 484, + 516 + ], + "score": 0.91, + "content": "B _ { \\epsilon } [ x ]", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 504, + 505, + 517 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 514, + 136, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 136, + 528 + ], + "score": 1.0, + "content": "radius", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 492, + 505, + 528 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 525, + 381, + 554 + ], + "lines": [ + { + "bbox": [ + 230, + 525, + 381, + 554 + ], + "spans": [ + { + "bbox": [ + 230, + 525, + 381, + 554 + ], + "score": 0.91, + "content": "0 < \\epsilon < \\operatorname* { m i n } _ { \\substack { z \\in \\overline { { \\mathcal X } } } } d _ { \\mathcal X } ( x , z )", + "type": "interline_equation", + "image_path": "173b64083c6fe68ba5bfe354bcd91499af11b4954ead01712d0c1ffe9df95617.jpg" + } + ] + } + ], + "index": 28.5, + "virtual_lines": [ + { + "bbox": [ + 230, + 525, + 381, + 539.5 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 230, + 539.5, + 381, + 554.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 565, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 106, + 565, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 192, + 578 + ], + "score": 1.0, + "content": "So, for each element", + "type": "text" + }, + { + "bbox": [ + 192, + 567, + 222, + 576 + ], + "score": 0.92, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 565, + 370, + 578 + ], + "score": 1.0, + "content": "there exists a closed set of points in", + "type": "text" + }, + { + "bbox": [ + 370, + 565, + 380, + 576 + ], + "score": 0.85, + "content": "\\overline { { \\mathcal { X } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 565, + 505, + 578 + ], + "score": 1.0, + "content": "which are rediscretized, under", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 107, + 576, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 107, + 577, + 122, + 588 + ], + "score": 0.87, + "content": "R _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 123, + 576, + 138, + 590 + ], + "score": 1.0, + "content": ", to", + "type": "text" + }, + { + "bbox": [ + 139, + 579, + 145, + 587 + ], + "score": 0.74, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 576, + 178, + 590 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 178, + 577, + 191, + 588 + ], + "score": 0.89, + "content": "S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 576, + 505, + 590 + ], + "score": 1.0, + "content": "is a Borel Set we can sample uniformly from it. Therefore, during training", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 587, + 375, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 252, + 601 + ], + "score": 1.0, + "content": "suppose we replace each element of", + "type": "text" + }, + { + "bbox": [ + 252, + 588, + 280, + 598 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 587, + 339, + 601 + ], + "score": 1.0, + "content": "with a sample", + "type": "text" + }, + { + "bbox": [ + 339, + 588, + 370, + 599 + ], + "score": 0.91, + "content": "\\bar { x } \\sim S _ { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 587, + 375, + 601 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 565, + 505, + 601 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 604, + 255, + 616 + ], + "lines": [ + { + "bbox": [ + 106, + 603, + 256, + 618 + ], + "spans": [ + { + "bbox": [ + 106, + 603, + 256, + 618 + ], + "score": 1.0, + "content": "We begin with the discrete objective:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33, + "bbox_fs": [ + 106, + 603, + 256, + 618 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 619, + 407, + 647 + ], + "lines": [ + { + "bbox": [ + 203, + 619, + 407, + 647 + ], + "spans": [ + { + "bbox": [ + 203, + 619, + 407, + 647 + ], + "score": 0.91, + "content": "\\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal { X } } ( x ) \\log ( D _ { \\mathcal { X } } ( x ) ) + p _ { F } ( x ) \\log ( 1 - D _ { \\mathcal { X } } ( x ) )", + "type": "interline_equation", + "image_path": "952e6737c0ea248058e3c37db45cee03f5acc0fae8c07deca454a8d4ad5d16c5.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 203, + 619, + 407, + 647 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 656, + 490, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 656, + 490, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 656, + 393, + 670 + ], + "score": 1.0, + "content": "As was noted in Goodfellow et al. (2014), this objective is optimized in", + "type": "text" + }, + { + "bbox": [ + 394, + 657, + 462, + 669 + ], + "score": 0.93, + "content": "D _ { \\mathcal { X } } : \\mathcal { X } [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 656, + 490, + 670 + ], + "score": 1.0, + "content": "when:", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 106, + 656, + 490, + 670 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 271, + 671, + 340, + 695 + ], + "lines": [ + { + "bbox": [ + 271, + 671, + 340, + 695 + ], + "spans": [ + { + "bbox": [ + 271, + 671, + 340, + 695 + ], + "score": 0.94, + "content": "D _ { \\mathcal { X } } = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + p _ { G } }", + "type": "interline_equation", + "image_path": "6e5de30ec7d12996f18760572256a0daf483fd32d056422c6668e1af3b05f79c.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 271, + 671, + 340, + 695 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 696, + 507, + 714 + ], + "spans": [ + { + "bbox": [ + 104, + 696, + 202, + 714 + ], + "score": 1.0, + "content": "which is undesirable as", + "type": "text" + }, + { + "bbox": [ + 203, + 701, + 216, + 711 + ], + "score": 0.84, + "content": "p _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 696, + 364, + 714 + ], + "score": 1.0, + "content": "is a sum of Dirac delta distributions", + "type": "text" + }, + { + "bbox": [ + 364, + 698, + 463, + 712 + ], + "score": 0.92, + "content": "\\begin{array} { r } { p _ { \\mathcal { X } } ( x ) = \\sum _ { x _ { i } \\in \\mathcal { X } } \\delta _ { x _ { i } } ( x ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 696, + 507, + 714 + ], + "score": 1.0, + "content": "and lacks", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "a non-zero gradient to train the generator function with. Instead, let us consider a continuous relax-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 720, + 427, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 129, + 733 + ], + "score": 1.0, + "content": "ation", + "type": "text" + }, + { + "bbox": [ + 129, + 720, + 198, + 733 + ], + "score": 0.94, + "content": "D _ { \\overline { { \\mathcal { X } } } } : \\overline { { \\mathcal { X } } } [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 721, + 280, + 733 + ], + "score": 1.0, + "content": "of the discriminator", + "type": "text" + }, + { + "bbox": [ + 281, + 721, + 297, + 732 + ], + "score": 0.89, + "content": "D _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 721, + 427, + 733 + ], + "score": 1.0, + "content": "and observe where it optimizes.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 104, + 696, + 507, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 253, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 252, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 142, + 96 + ], + "score": 1.0, + "content": "Suppose", + "type": "text" + }, + { + "bbox": [ + 142, + 82, + 252, + 94 + ], + "score": 0.83, + "content": "\\forall x \\in \\mathcal { X } , \\exists \\epsilon _ { x } \\geq 0 , \\forall \\bar { x } \\in S _ { x }", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 237, + 99, + 374, + 114 + ], + "lines": [ + { + "bbox": [ + 237, + 99, + 374, + 114 + ], + "spans": [ + { + "bbox": [ + 237, + 99, + 374, + 114 + ], + "score": 0.89, + "content": "\\left( 1 - \\epsilon _ { x } \\right) \\leq \\left| \\nabla _ { \\bar { x } } F ( \\bar { x } ) \\right| \\leq \\left( 1 + \\epsilon _ { x } \\right)", + "type": "interline_equation", + "image_path": "bb23f4fbcfc0e384ec2cc0557d5e7fa5ace2ac615265174c1b4e6a194c3ec54f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 237, + 99, + 374, + 114 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 118, + 492, + 131 + ], + "lines": [ + { + "bbox": [ + 106, + 117, + 493, + 132 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 173, + 132 + ], + "score": 1.0, + "content": "That is, suppose", + "type": "text" + }, + { + "bbox": [ + 174, + 119, + 182, + 128 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 117, + 461, + 132 + ], + "score": 1.0, + "content": "is approximately volume preserving within a small region about each", + "type": "text" + }, + { + "bbox": [ + 462, + 119, + 489, + 129 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 117, + 493, + 132 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 135, + 254, + 148 + ], + "lines": [ + { + "bbox": [ + 105, + 132, + 253, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 153, + 151 + ], + "score": 1.0, + "content": "Lemma 1.", + "type": "text" + }, + { + "bbox": [ + 154, + 135, + 253, + 149 + ], + "score": 0.88, + "content": "\\forall y \\in \\mathcal { Y } , G ( S _ { y } ) = S _ { G ( y ) }", + "type": "inline_equation" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 108, + 152, + 362, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 150, + 362, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 173, + 166 + ], + "score": 1.0, + "content": "Proof of Lemma", + "type": "text" + }, + { + "bbox": [ + 174, + 153, + 179, + 162 + ], + "score": 0.57, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 150, + 214, + 166 + ], + "score": 1.0, + "content": ". For all", + "type": "text" + }, + { + "bbox": [ + 214, + 153, + 241, + 164 + ], + "score": 0.91, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 150, + 262, + 166 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 262, + 152, + 359, + 164 + ], + "score": 0.91, + "content": "G ( y ) = x \\Leftrightarrow y = F ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 150, + 362, + 166 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 168, + 400, + 251 + ], + "lines": [ + { + "bbox": [ + 210, + 168, + 400, + 251 + ], + "spans": [ + { + "bbox": [ + 210, + 168, + 400, + 251 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { G ( S _ { y } ) = G [ R _ { y } ^ { - 1 } ( y ) \\cap G ^ { - 1 } ( R _ { \\chi } ^ { - 1 } ( G ( y ) ) ) ] } \\\\ & { \\qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \\cap G ( G ^ { - 1 } ( R _ { \\chi } ^ { - 1 } ( G ( y ) ) ) ) } \\\\ & { \\qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \\cap R _ { \\chi } ^ { - 1 } ( G ( y ) ) } \\\\ & { \\qquad = F ^ { - 1 } ( R _ { y } ^ { - 1 } ( F ( x ) ) ) \\cap R _ { \\chi } ^ { - 1 } ( x ) } \\\\ & { \\qquad = S _ { x } = S _ { G ( y ) } } \\end{array}", + "type": "interline_equation", + "image_path": "df02c46fa988a1f20958c811c9122b0b44a76ac90e7446c907d076536677a682.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 210, + 168, + 400, + 184.6 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 210, + 184.6, + 400, + 201.2 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 210, + 201.2, + 400, + 217.79999999999998 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 210, + 217.79999999999998, + 400, + 234.39999999999998 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 210, + 234.39999999999998, + 400, + 250.99999999999997 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 271, + 159, + 283 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 162, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 162, + 286 + ], + "score": 1.0, + "content": "Corollary 1.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 283, + 400, + 310 + ], + "lines": [ + { + "bbox": [ + 210, + 283, + 400, + 310 + ], + "spans": [ + { + "bbox": [ + 210, + 283, + 400, + 310 + ], + "score": 0.93, + "content": "\\int _ { { \\bar { x } } \\sim S _ { G ( y ) } } { \\frac { 1 } { \\left| S _ { G ( y ) } \\right| } } d { \\bar { x } } = \\int _ { { \\bar { x } } \\sim G ( S _ { y } ) } { \\frac { \\left| \\nabla _ { \\bar { x } } F ( { \\bar { x } } ) \\right| } { \\left| S _ { y } \\right| } } d { \\bar { x } }", + "type": "interline_equation", + "image_path": "2102091569a0158170b92e653242a6c676025798ff9f08f5d0e361b209201693.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 210, + 283, + 400, + 310 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 192, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 193, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 193, + 327 + ], + "score": 1.0, + "content": "Proof of Corollary 1.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 195, + 330, + 415, + 419 + ], + "lines": [ + { + "bbox": [ + 195, + 330, + 415, + 419 + ], + "spans": [ + { + "bbox": [ + 195, + 330, + 415, + 419 + ], + "score": 0.94, + "content": "\\begin{array} { r l } { \\displaystyle \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 } { \\vert S _ { G ( y ) } \\vert } d \\bar { x } = 1 = \\int _ { \\bar { y } \\sim S _ { y } } \\frac { 1 } { \\vert S _ { y } \\vert } d \\bar { y } } & { { } } \\\\ { = \\displaystyle \\int _ { \\bar { x } \\sim G ( S _ { y } ) } \\frac { \\vert \\nabla _ { \\bar { x } } G ^ { - 1 } ( \\bar { x } ) \\vert } { \\vert S _ { y } \\vert } d \\bar { x } } & { { } } \\\\ { = \\displaystyle \\int _ { \\bar { x } \\sim G ( S _ { y } ) } \\frac { \\vert \\nabla _ { \\bar { x } } F ( \\bar { x } ) \\vert } { \\vert S _ { y } \\vert } d \\bar { x } } & { { } } \\end{array}", + "type": "interline_equation", + "image_path": "2fff165673065660f5376ded2ebdf984a1d36da8b004d39bf1516f469738e666.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 195, + 330, + 415, + 347.8 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 195, + 347.8, + 415, + 365.6 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 195, + 365.6, + 415, + 383.40000000000003 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 195, + 383.40000000000003, + 415, + 401.20000000000005 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 195, + 401.20000000000005, + 415, + 419.00000000000006 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 440, + 159, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 439, + 161, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 161, + 455 + ], + "score": 1.0, + "content": "Corollary 2.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 449, + 394, + 477 + ], + "lines": [ + { + "bbox": [ + 217, + 449, + 394, + 477 + ], + "spans": [ + { + "bbox": [ + 217, + 449, + 394, + 477 + ], + "score": 0.93, + "content": "\\frac { 1 } { ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | } \\geq \\frac { 1 } { | S _ { y } | } \\geq \\frac { 1 } { ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | }", + "type": "interline_equation", + "image_path": "6d7a9bdec88fee1d37f30a1c421a10899bfe3101e991f58826d278266ca7f219.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 217, + 449, + 394, + 477 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 479, + 323, + 492 + ], + "lines": [ + { + "bbox": [ + 106, + 479, + 323, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 323, + 493 + ], + "score": 1.0, + "content": "Proof of Corollary 2. By Equation 6 and Corollary 1:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 171, + 496, + 438, + 597 + ], + "lines": [ + { + "bbox": [ + 171, + 496, + 438, + 597 + ], + "spans": [ + { + "bbox": [ + 171, + 496, + 438, + 597 + ], + "score": 0.96, + "content": "\\begin{array} { r l } & { \\displaystyle \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } d \\bar { x } \\le \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 } { | S _ { G ( y ) } | } d \\bar { x } \\le \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } d \\bar { x } } \\\\ & { \\qquad \\implies \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | \\le 1 \\le \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | } \\\\ & { \\qquad \\implies ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | \\le | S _ { y } | \\le ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | } \\\\ & { \\qquad \\implies \\frac { 1 } { ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | } \\ge \\frac { 1 } { | S _ { y } | } \\ge \\frac { 1 } { ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | } } \\end{array}", + "type": "interline_equation", + "image_path": "f3836292e77ab0dd915a5a602f2af10c5bd8b3196ab1c60988388f7d0a089af5.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 171, + 496, + 438, + 529.6666666666666 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 171, + 529.6666666666666, + 438, + 563.3333333333333 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 171, + 563.3333333333333, + 438, + 596.9999999999999 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 622, + 245, + 635 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 246, + 637 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 246, + 637 + ], + "score": 1.0, + "content": "Corollary 1 leads to the following:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 112, + 638, + 497, + 721 + ], + "lines": [ + { + "bbox": [ + 112, + 638, + 497, + 721 + ], + "spans": [ + { + "bbox": [ + 112, + 638, + 497, + 721 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathbb { E } _ { \\boldsymbol { x } \\in \\mathcal { X } } [ \\mathbb { E } _ { \\bar { \\boldsymbol { x } } \\in S _ { \\boldsymbol { x } } } [ \\mathrm { l o g } ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) ] ] + \\mathbb { E } _ { \\boldsymbol { y } \\in \\mathcal { Y } } [ \\mathbb { E } _ { \\bar { \\boldsymbol { y } } \\in S _ { \\boldsymbol { y } } } [ \\mathrm { l o g } ( 1 - D _ { \\overline { { \\mathcal { X } } } } ( G ( \\bar { \\boldsymbol { y } } ) ) ) ] ] } \\\\ & { = \\displaystyle \\sum _ { \\boldsymbol { x } \\in \\mathcal { X } } p _ { \\mathcal { X } } ( \\boldsymbol { x } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim S _ { \\boldsymbol { x } } } \\frac { 1 } { | S _ { \\boldsymbol { x } } | } \\log ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } + \\displaystyle \\sum _ { \\boldsymbol { y } \\in \\mathcal { Y } } p _ { \\mathcal { Y } } ( \\boldsymbol { y } ) \\int _ { \\bar { \\boldsymbol { y } } \\sim S _ { \\boldsymbol { y } } } \\frac { 1 } { | S _ { \\boldsymbol { y } } | } \\log ( 1 - D _ { \\overline { { \\boldsymbol { x } } } } ( G ( \\bar { \\boldsymbol { y } } ) ) ) d \\bar { y } } \\\\ & { = \\displaystyle \\sum _ { \\boldsymbol { x } \\in \\mathcal { X } } p _ { \\mathcal { X } } ( \\boldsymbol { x } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim S _ { \\boldsymbol { x } } } \\frac { 1 } { | S _ { \\boldsymbol { x } } | } \\log ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } + \\displaystyle \\sum _ { \\boldsymbol { y } \\in \\mathcal { Y } } p _ { \\mathcal { Y } } ( \\boldsymbol { y } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim G ( S _ { \\boldsymbol { y } } ) } \\frac { | \\nabla _ { \\bar { x } } F ( \\bar { \\boldsymbol { x } } ) | } { | S _ { \\boldsymbol { y } } | } \\log ( 1 - D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } } \\end{array}", + "type": "interline_equation", + "image_path": "6064f14506d47aafe2797111864a6353330a472891418373db4e854a15d8c21d.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 112, + 638, + 497, + 665.6666666666666 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 112, + 665.6666666666666, + 497, + 693.3333333333333 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 112, + 693.3333333333333, + 497, + 720.9999999999999 + ], + "spans": [], + "index": 27 + } + ] + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 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" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 253, + 505, + 264 + ], + "lines": [ + { + "bbox": [ + 496, + 255, + 505, + 265 + ], + "spans": [ + { + "bbox": [ + 496, + 255, + 505, + 265 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 599, + 505, + 610 + ], + "lines": [ + { + "bbox": [ + 495, + 600, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 495, + 600, + 505, + 610 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 422, + 505, + 433 + ], + "lines": [ + { + "bbox": [ + 495, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 495, + 423, + 505, + 435 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 253, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 252, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 142, + 96 + ], + "score": 1.0, + "content": "Suppose", + "type": "text" + }, + { + "bbox": [ + 142, + 82, + 252, + 94 + ], + "score": 0.83, + "content": "\\forall x \\in \\mathcal { X } , \\exists \\epsilon _ { x } \\geq 0 , \\forall \\bar { x } \\in S _ { x }", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 252, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 237, + 99, + 374, + 114 + ], + "lines": [ + { + "bbox": [ + 237, + 99, + 374, + 114 + ], + "spans": [ + { + "bbox": [ + 237, + 99, + 374, + 114 + ], + "score": 0.89, + "content": "\\left( 1 - \\epsilon _ { x } \\right) \\leq \\left| \\nabla _ { \\bar { x } } F ( \\bar { x } ) \\right| \\leq \\left( 1 + \\epsilon _ { x } \\right)", + "type": "interline_equation", + "image_path": "bb23f4fbcfc0e384ec2cc0557d5e7fa5ace2ac615265174c1b4e6a194c3ec54f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 237, + 99, + 374, + 114 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 118, + 492, + 131 + ], + "lines": [ + { + "bbox": [ + 106, + 117, + 493, + 132 + ], + "spans": [ + { + "bbox": [ + 106, + 117, + 173, + 132 + ], + "score": 1.0, + "content": "That is, suppose", + "type": "text" + }, + { + "bbox": [ + 174, + 119, + 182, + 128 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 117, + 461, + 132 + ], + "score": 1.0, + "content": "is approximately volume preserving within a small region about each", + "type": "text" + }, + { + "bbox": [ + 462, + 119, + 489, + 129 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 117, + 493, + 132 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 117, + 493, + 132 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 135, + 254, + 148 + ], + "lines": [ + { + "bbox": [ + 105, + 132, + 253, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 153, + 151 + ], + "score": 1.0, + "content": "Lemma 1.", + "type": "text" + }, + { + "bbox": [ + 154, + 135, + 253, + 149 + ], + "score": 0.88, + "content": "\\forall y \\in \\mathcal { Y } , G ( S _ { y } ) = S _ { G ( y ) }", + "type": "inline_equation" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 132, + 253, + 151 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 152, + 362, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 150, + 362, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 173, + 166 + ], + "score": 1.0, + "content": "Proof of Lemma", + "type": "text" + }, + { + "bbox": [ + 174, + 153, + 179, + 162 + ], + "score": 0.57, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 150, + 214, + 166 + ], + "score": 1.0, + "content": ". For all", + "type": "text" + }, + { + "bbox": [ + 214, + 153, + 241, + 164 + ], + "score": 0.91, + "content": "y \\in \\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 150, + 262, + 166 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 262, + 152, + 359, + 164 + ], + "score": 0.91, + "content": "G ( y ) = x \\Leftrightarrow y = F ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 150, + 362, + 166 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 150, + 362, + 166 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 168, + 400, + 251 + ], + "lines": [ + { + "bbox": [ + 210, + 168, + 400, + 251 + ], + "spans": [ + { + "bbox": [ + 210, + 168, + 400, + 251 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { G ( S _ { y } ) = G [ R _ { y } ^ { - 1 } ( y ) \\cap G ^ { - 1 } ( R _ { \\chi } ^ { - 1 } ( G ( y ) ) ) ] } \\\\ & { \\qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \\cap G ( G ^ { - 1 } ( R _ { \\chi } ^ { - 1 } ( G ( y ) ) ) ) } \\\\ & { \\qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \\cap R _ { \\chi } ^ { - 1 } ( G ( y ) ) } \\\\ & { \\qquad = F ^ { - 1 } ( R _ { y } ^ { - 1 } ( F ( x ) ) ) \\cap R _ { \\chi } ^ { - 1 } ( x ) } \\\\ & { \\qquad = S _ { x } = S _ { G ( y ) } } \\end{array}", + "type": "interline_equation", + "image_path": "df02c46fa988a1f20958c811c9122b0b44a76ac90e7446c907d076536677a682.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 210, + 168, + 400, + 184.6 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 210, + 184.6, + 400, + 201.2 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 210, + 201.2, + 400, + 217.79999999999998 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 210, + 217.79999999999998, + 400, + 234.39999999999998 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 210, + 234.39999999999998, + 400, + 250.99999999999997 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 271, + 159, + 283 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 162, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 162, + 286 + ], + "score": 1.0, + "content": "Corollary 1.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 270, + 162, + 286 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 283, + 400, + 310 + ], + "lines": [ + { + "bbox": [ + 210, + 283, + 400, + 310 + ], + "spans": [ + { + "bbox": [ + 210, + 283, + 400, + 310 + ], + "score": 0.93, + "content": "\\int _ { { \\bar { x } } \\sim S _ { G ( y ) } } { \\frac { 1 } { \\left| S _ { G ( y ) } \\right| } } d { \\bar { x } } = \\int _ { { \\bar { x } } \\sim G ( S _ { y } ) } { \\frac { \\left| \\nabla _ { \\bar { x } } F ( { \\bar { x } } ) \\right| } { \\left| S _ { y } \\right| } } d { \\bar { x } }", + "type": "interline_equation", + "image_path": "2102091569a0158170b92e653242a6c676025798ff9f08f5d0e361b209201693.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 210, + 283, + 400, + 310 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 192, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 193, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 193, + 327 + ], + "score": 1.0, + "content": "Proof of Corollary 1.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 311, + 193, + 327 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 195, + 330, + 415, + 419 + ], + "lines": [ + { + "bbox": [ + 195, + 330, + 415, + 419 + ], + "spans": [ + { + "bbox": [ + 195, + 330, + 415, + 419 + ], + "score": 0.94, + "content": "\\begin{array} { r l } { \\displaystyle \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 } { \\vert S _ { G ( y ) } \\vert } d \\bar { x } = 1 = \\int _ { \\bar { y } \\sim S _ { y } } \\frac { 1 } { \\vert S _ { y } \\vert } d \\bar { y } } & { { } } \\\\ { = \\displaystyle \\int _ { \\bar { x } \\sim G ( S _ { y } ) } \\frac { \\vert \\nabla _ { \\bar { x } } G ^ { - 1 } ( \\bar { x } ) \\vert } { \\vert S _ { y } \\vert } d \\bar { x } } & { { } } \\\\ { = \\displaystyle \\int _ { \\bar { x } \\sim G ( S _ { y } ) } \\frac { \\vert \\nabla _ { \\bar { x } } F ( \\bar { x } ) \\vert } { \\vert S _ { y } \\vert } d \\bar { x } } & { { } } \\end{array}", + "type": "interline_equation", + "image_path": "2fff165673065660f5376ded2ebdf984a1d36da8b004d39bf1516f469738e666.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 195, + 330, + 415, + 347.8 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 195, + 347.8, + 415, + 365.6 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 195, + 365.6, + 415, + 383.40000000000003 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 195, + 383.40000000000003, + 415, + 401.20000000000005 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 195, + 401.20000000000005, + 415, + 419.00000000000006 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 440, + 159, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 439, + 161, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 161, + 455 + ], + "score": 1.0, + "content": "Corollary 2.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18, + "bbox_fs": [ + 106, + 439, + 161, + 455 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 217, + 449, + 394, + 477 + ], + "lines": [ + { + "bbox": [ + 217, + 449, + 394, + 477 + ], + "spans": [ + { + "bbox": [ + 217, + 449, + 394, + 477 + ], + "score": 0.93, + "content": "\\frac { 1 } { ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | } \\geq \\frac { 1 } { | S _ { y } | } \\geq \\frac { 1 } { ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | }", + "type": "interline_equation", + "image_path": "6d7a9bdec88fee1d37f30a1c421a10899bfe3101e991f58826d278266ca7f219.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 217, + 449, + 394, + 477 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 479, + 323, + 492 + ], + "lines": [ + { + "bbox": [ + 106, + 479, + 323, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 323, + 493 + ], + "score": 1.0, + "content": "Proof of Corollary 2. By Equation 6 and Corollary 1:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 106, + 479, + 323, + 493 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 171, + 496, + 438, + 597 + ], + "lines": [ + { + "bbox": [ + 171, + 496, + 438, + 597 + ], + "spans": [ + { + "bbox": [ + 171, + 496, + 438, + 597 + ], + "score": 0.96, + "content": "\\begin{array} { r l } & { \\displaystyle \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } d \\bar { x } \\le \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 } { | S _ { G ( y ) } | } d \\bar { x } \\le \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } d \\bar { x } } \\\\ & { \\qquad \\implies \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | \\le 1 \\le \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | } \\\\ & { \\qquad \\implies ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | \\le | S _ { y } | \\le ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | } \\\\ & { \\qquad \\implies \\frac { 1 } { ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | } \\ge \\frac { 1 } { | S _ { y } | } \\ge \\frac { 1 } { ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | } } \\end{array}", + "type": "interline_equation", + "image_path": "f3836292e77ab0dd915a5a602f2af10c5bd8b3196ab1c60988388f7d0a089af5.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 171, + 496, + 438, + 529.6666666666666 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 171, + 529.6666666666666, + 438, + 563.3333333333333 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 171, + 563.3333333333333, + 438, + 596.9999999999999 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 622, + 245, + 635 + ], + "lines": [ + { + "bbox": [ + 106, + 621, + 246, + 637 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 246, + 637 + ], + "score": 1.0, + "content": "Corollary 1 leads to the following:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 106, + 621, + 246, + 637 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 112, + 638, + 497, + 721 + ], + "lines": [ + { + "bbox": [ + 112, + 638, + 497, + 721 + ], + "spans": [ + { + "bbox": [ + 112, + 638, + 497, + 721 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathbb { E } _ { \\boldsymbol { x } \\in \\mathcal { X } } [ \\mathbb { E } _ { \\bar { \\boldsymbol { x } } \\in S _ { \\boldsymbol { x } } } [ \\mathrm { l o g } ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) ] ] + \\mathbb { E } _ { \\boldsymbol { y } \\in \\mathcal { Y } } [ \\mathbb { E } _ { \\bar { \\boldsymbol { y } } \\in S _ { \\boldsymbol { y } } } [ \\mathrm { l o g } ( 1 - D _ { \\overline { { \\mathcal { X } } } } ( G ( \\bar { \\boldsymbol { y } } ) ) ) ] ] } \\\\ & { = \\displaystyle \\sum _ { \\boldsymbol { x } \\in \\mathcal { X } } p _ { \\mathcal { X } } ( \\boldsymbol { x } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim S _ { \\boldsymbol { x } } } \\frac { 1 } { | S _ { \\boldsymbol { x } } | } \\log ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } + \\displaystyle \\sum _ { \\boldsymbol { y } \\in \\mathcal { Y } } p _ { \\mathcal { Y } } ( \\boldsymbol { y } ) \\int _ { \\bar { \\boldsymbol { y } } \\sim S _ { \\boldsymbol { y } } } \\frac { 1 } { | S _ { \\boldsymbol { y } } | } \\log ( 1 - D _ { \\overline { { \\boldsymbol { x } } } } ( G ( \\bar { \\boldsymbol { y } } ) ) ) d \\bar { y } } \\\\ & { = \\displaystyle \\sum _ { \\boldsymbol { x } \\in \\mathcal { X } } p _ { \\mathcal { X } } ( \\boldsymbol { x } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim S _ { \\boldsymbol { x } } } \\frac { 1 } { | S _ { \\boldsymbol { x } } | } \\log ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } + \\displaystyle \\sum _ { \\boldsymbol { y } \\in \\mathcal { Y } } p _ { \\mathcal { Y } } ( \\boldsymbol { y } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim G ( S _ { \\boldsymbol { y } } ) } \\frac { | \\nabla _ { \\bar { x } } F ( \\bar { \\boldsymbol { x } } ) | } { | S _ { \\boldsymbol { y } } | } \\log ( 1 - D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } } \\end{array}", + "type": "interline_equation", + "image_path": "6064f14506d47aafe2797111864a6353330a472891418373db4e854a15d8c21d.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 112, + 638, + 497, + 665.6666666666666 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 112, + 665.6666666666666, + 497, + 693.3333333333333 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 112, + 693.3333333333333, + 497, + 720.9999999999999 + ], + "spans": [], + "index": 27 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 450, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 451, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 451, + 96 + ], + "score": 1.0, + "content": "Using Lemma 1 and Corollary 2, we obtain the following lower-bound of Equation 7:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 98, + 493, + 225 + ], + "lines": [ + { + "bbox": [ + 118, + 98, + 493, + 225 + ], + "spans": [ + { + "bbox": [ + 118, + 98, + 493, + 225 + ], + "score": 0.94, + "content": "\\begin{array} { l } { { \\displaystyle \\geq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\overline { { x } } \\sim S _ { \\varepsilon } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } + \\displaystyle \\sum _ { y \\in \\mathcal { Y } } p _ { \\mathcal Y } ( y ) \\int _ { \\overline { { x } } \\sim G ( S _ { y } ) } \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle \\geq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle \\qquad + p _ { \\mathcal Y } ( F ( x ) ) \\int _ { \\bar { x } \\sim S _ { G ( F ( x ) ) } } \\frac { 1 - \\epsilon _ { x } } { ( 1 + \\epsilon _ { x } ) | S _ { G ( F ( x ) ) } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle = \\sum _ { x \\in \\mathcal { X } } \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\left[ p _ { \\mathcal X } ( x ) \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) + \\frac { 1 - \\epsilon _ { x } } { 1 + \\epsilon _ { x } } p _ { G } ( x ) \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) \\right] d \\bar { x } } } \\end{array}", + "type": "interline_equation", + "image_path": "c78ddc885c86b2aca066a3eb0c1e38a7aa1007a7a65138edbd14d921dc0bf613.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 118, + 98, + 493, + 140.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 118, + 140.33333333333334, + 493, + 182.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 118, + 182.66666666666669, + 493, + 225.00000000000003 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 242, + 194, + 253 + ], + "lines": [ + { + "bbox": [ + 106, + 242, + 194, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 242, + 194, + 253 + ], + "score": 1.0, + "content": "Which is maximal at:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 256, + 384, + 303 + ], + "lines": [ + { + "bbox": [ + 227, + 256, + 384, + 303 + ], + "spans": [ + { + "bbox": [ + 227, + 256, + 384, + 303 + ], + "score": 0.9, + "content": "\\begin{array} { c } { { D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } \\sim S _ { x } ) = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + \\frac { 1 - \\epsilon _ { x } } { 1 + \\epsilon _ { x } } p _ { G } } \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\\\ { { \\Longrightarrow \\mathbb { E } _ { \\bar { x } \\sim S _ { x } } [ D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } ) ] \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\end{array}", + "type": "interline_equation", + "image_path": "1ae1705cf7d3c04b76590d4347b18cdd522e1eef3cd64b8065ad1823163ee9b4.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 227, + 256, + 384, + 271.6666666666667 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 227, + 271.6666666666667, + 384, + 287.33333333333337 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 227, + 287.33333333333337, + 384, + 303.00000000000006 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 305, + 331, + 318 + ], + "lines": [ + { + "bbox": [ + 105, + 303, + 331, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 331, + 321 + ], + "score": 1.0, + "content": "And similarly, we find Equation 7 is upper-bounded by:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 322, + 492, + 447 + ], + "lines": [ + { + "bbox": [ + 118, + 322, + 492, + 447 + ], + "spans": [ + { + "bbox": [ + 118, + 322, + 492, + 447 + ], + "score": 0.94, + "content": "\\begin{array} { l } { { \\displaystyle \\leq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\overline { { x } } \\sim S _ { z } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } + \\displaystyle \\sum _ { y \\in \\mathcal { Y } } p _ { \\mathcal Y } ( y ) \\int _ { \\overline { { x } } \\sim G ( S _ { y } ) } \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle \\leq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle \\qquad + p _ { \\mathcal Y } ( F ( x ) ) \\int _ { \\bar { x } \\sim S _ { G ( F ( \\bar { x } ) ) } } \\frac { 1 + \\epsilon _ { x } } { ( 1 - \\epsilon _ { x } ) | S _ { G ( F ( \\bar { x } ) ) } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle = \\sum _ { x \\in \\mathcal { X } } \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\left[ p _ { \\mathcal X } ( x ) \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) + \\frac { 1 + \\epsilon _ { x } } { 1 - \\epsilon _ { x } } p _ { G } ( x ) \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) \\right] d \\bar { x } } } \\end{array}", + "type": "interline_equation", + "image_path": "d213134d4845d993a39ab315d2c6fb9a7f32685cdc23dbe5da7c296264d7f425.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 118, + 322, + 492, + 363.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 118, + 363.6666666666667, + 492, + 405.33333333333337 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 118, + 405.33333333333337, + 492, + 447.00000000000006 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 465, + 222, + 477 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 223, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 192, + 479 + ], + "score": 1.0, + "content": "Which is maximal in", + "type": "text" + }, + { + "bbox": [ + 192, + 466, + 210, + 478 + ], + "score": 0.91, + "content": "D _ { \\overline { { \\mathcal { X } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 463, + 223, + 479 + ], + "score": 1.0, + "content": "at:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 482, + 384, + 529 + ], + "lines": [ + { + "bbox": [ + 227, + 482, + 384, + 529 + ], + "spans": [ + { + "bbox": [ + 227, + 482, + 384, + 529 + ], + "score": 0.9, + "content": "\\begin{array} { c } { { D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } \\sim S _ { x } ) = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + \\frac { 1 + \\epsilon _ { x } } { 1 - \\epsilon _ { x } } p _ { G } } \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\\\ { { \\Longrightarrow \\mathbb { E } _ { \\bar { x } \\sim S _ { x } } [ D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } ) ] \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\end{array}", + "type": "interline_equation", + "image_path": "75fa2714e726836ced313e42b55d7f4dd0c0d7b93c3dfa3da6ab50806c788a35.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 227, + 482, + 384, + 497.6666666666667 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 227, + 497.6666666666667, + 384, + 513.3333333333334 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 227, + 513.3333333333334, + 384, + 529.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 506, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 504, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 209, + 545 + ], + "score": 1.0, + "content": "Hence, asymptotically as", + "type": "text" + }, + { + "bbox": [ + 210, + 533, + 219, + 542 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 532, + 475, + 545 + ], + "score": 1.0, + "content": "becomes approximately volume-preserving about each discrete", + "type": "text" + }, + { + "bbox": [ + 475, + 533, + 504, + 542 + ], + "score": 0.89, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 543, + 506, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 408, + 556 + ], + "score": 1.0, + "content": "the bounds maximize to the same loss value in the same class of functions", + "type": "text" + }, + { + "bbox": [ + 409, + 543, + 501, + 555 + ], + "score": 0.91, + "content": "\\mathbb { E } _ { { \\bar { x } } \\sim S _ { x } } [ D _ { \\overline { { \\mathcal { X } } } } ( { \\bar { x } } ) ] = D _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 543, + 506, + 556 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 332, + 567 + ], + "score": 1.0, + "content": "application of the squeeze theorem concludes the proof.", + "type": "text" + }, + { + "bbox": [ + 494, + 555, + 505, + 565 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + } + ], + "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": "text", + "bbox": [ + 106, + 81, + 450, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 451, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 451, + 96 + ], + "score": 1.0, + "content": "Using Lemma 1 and Corollary 2, we obtain the following lower-bound of Equation 7:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 451, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 98, + 493, + 225 + ], + "lines": [ + { + "bbox": [ + 118, + 98, + 493, + 225 + ], + "spans": [ + { + "bbox": [ + 118, + 98, + 493, + 225 + ], + "score": 0.94, + "content": "\\begin{array} { l } { { \\displaystyle \\geq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\overline { { x } } \\sim S _ { \\varepsilon } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } + \\displaystyle \\sum _ { y \\in \\mathcal { Y } } p _ { \\mathcal Y } ( y ) \\int _ { \\overline { { x } } \\sim G ( S _ { y } ) } \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle \\geq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle \\qquad + p _ { \\mathcal Y } ( F ( x ) ) \\int _ { \\bar { x } \\sim S _ { G ( F ( x ) ) } } \\frac { 1 - \\epsilon _ { x } } { ( 1 + \\epsilon _ { x } ) | S _ { G ( F ( x ) ) } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle = \\sum _ { x \\in \\mathcal { X } } \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\left[ p _ { \\mathcal X } ( x ) \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) + \\frac { 1 - \\epsilon _ { x } } { 1 + \\epsilon _ { x } } p _ { G } ( x ) \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) \\right] d \\bar { x } } } \\end{array}", + "type": "interline_equation", + "image_path": "c78ddc885c86b2aca066a3eb0c1e38a7aa1007a7a65138edbd14d921dc0bf613.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 118, + 98, + 493, + 140.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 118, + 140.33333333333334, + 493, + 182.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 118, + 182.66666666666669, + 493, + 225.00000000000003 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 242, + 194, + 253 + ], + "lines": [ + { + "bbox": [ + 106, + 242, + 194, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 242, + 194, + 253 + ], + "score": 1.0, + "content": "Which is maximal at:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 242, + 194, + 253 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 256, + 384, + 303 + ], + "lines": [ + { + "bbox": [ + 227, + 256, + 384, + 303 + ], + "spans": [ + { + "bbox": [ + 227, + 256, + 384, + 303 + ], + "score": 0.9, + "content": "\\begin{array} { c } { { D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } \\sim S _ { x } ) = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + \\frac { 1 - \\epsilon _ { x } } { 1 + \\epsilon _ { x } } p _ { G } } \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\\\ { { \\Longrightarrow \\mathbb { E } _ { \\bar { x } \\sim S _ { x } } [ D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } ) ] \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\end{array}", + "type": "interline_equation", + "image_path": "1ae1705cf7d3c04b76590d4347b18cdd522e1eef3cd64b8065ad1823163ee9b4.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 227, + 256, + 384, + 271.6666666666667 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 227, + 271.6666666666667, + 384, + 287.33333333333337 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 227, + 287.33333333333337, + 384, + 303.00000000000006 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 305, + 331, + 318 + ], + "lines": [ + { + "bbox": [ + 105, + 303, + 331, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 331, + 321 + ], + "score": 1.0, + "content": "And similarly, we find Equation 7 is upper-bounded by:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 303, + 331, + 321 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 322, + 492, + 447 + ], + "lines": [ + { + "bbox": [ + 118, + 322, + 492, + 447 + ], + "spans": [ + { + "bbox": [ + 118, + 322, + 492, + 447 + ], + "score": 0.94, + "content": "\\begin{array} { l } { { \\displaystyle \\leq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\overline { { x } } \\sim S _ { z } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } + \\displaystyle \\sum _ { y \\in \\mathcal { Y } } p _ { \\mathcal Y } ( y ) \\int _ { \\overline { { x } } \\sim G ( S _ { y } ) } \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle \\leq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle \\qquad + p _ { \\mathcal Y } ( F ( x ) ) \\int _ { \\bar { x } \\sim S _ { G ( F ( \\bar { x } ) ) } } \\frac { 1 + \\epsilon _ { x } } { ( 1 - \\epsilon _ { x } ) | S _ { G ( F ( \\bar { x } ) ) } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle = \\sum _ { x \\in \\mathcal { X } } \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\left[ p _ { \\mathcal X } ( x ) \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) + \\frac { 1 + \\epsilon _ { x } } { 1 - \\epsilon _ { x } } p _ { G } ( x ) \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) \\right] d \\bar { x } } } \\end{array}", + "type": "interline_equation", + "image_path": "d213134d4845d993a39ab315d2c6fb9a7f32685cdc23dbe5da7c296264d7f425.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 118, + 322, + 492, + 363.6666666666667 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 118, + 363.6666666666667, + 492, + 405.33333333333337 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 118, + 405.33333333333337, + 492, + 447.00000000000006 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 465, + 222, + 477 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 223, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 192, + 479 + ], + "score": 1.0, + "content": "Which is maximal in", + "type": "text" + }, + { + "bbox": [ + 192, + 466, + 210, + 478 + ], + "score": 0.91, + "content": "D _ { \\overline { { \\mathcal { X } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 463, + 223, + 479 + ], + "score": 1.0, + "content": "at:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 463, + 223, + 479 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 482, + 384, + 529 + ], + "lines": [ + { + "bbox": [ + 227, + 482, + 384, + 529 + ], + "spans": [ + { + "bbox": [ + 227, + 482, + 384, + 529 + ], + "score": 0.9, + "content": "\\begin{array} { c } { { D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } \\sim S _ { x } ) = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + \\frac { 1 + \\epsilon _ { x } } { 1 - \\epsilon _ { x } } p _ { G } } \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\\\ { { \\Longrightarrow \\mathbb { E } _ { \\bar { x } \\sim S _ { x } } [ D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } ) ] \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\end{array}", + "type": "interline_equation", + "image_path": "75fa2714e726836ced313e42b55d7f4dd0c0d7b93c3dfa3da6ab50806c788a35.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 227, + 482, + 384, + 497.6666666666667 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 227, + 497.6666666666667, + 384, + 513.3333333333334 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 227, + 513.3333333333334, + 384, + 529.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 506, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 504, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 209, + 545 + ], + "score": 1.0, + "content": "Hence, asymptotically as", + "type": "text" + }, + { + "bbox": [ + 210, + 533, + 219, + 542 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 532, + 475, + 545 + ], + "score": 1.0, + "content": "becomes approximately volume-preserving about each discrete", + "type": "text" + }, + { + "bbox": [ + 475, + 533, + 504, + 542 + ], + "score": 0.89, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 543, + 506, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 408, + 556 + ], + "score": 1.0, + "content": "the bounds maximize to the same loss value in the same class of functions", + "type": "text" + }, + { + "bbox": [ + 409, + 543, + 501, + 555 + ], + "score": 0.91, + "content": "\\mathbb { E } _ { { \\bar { x } } \\sim S _ { x } } [ D _ { \\overline { { \\mathcal { X } } } } ( { \\bar { x } } ) ] = D _ { \\mathcal { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 543, + 506, + 556 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 332, + 567 + ], + "score": 1.0, + "content": "application of the squeeze theorem concludes the proof.", + "type": "text" + }, + { + "bbox": [ + 494, + 555, + 505, + 565 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 532, + 506, + 567 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/BkeqO7x0-/BkeqO7x0-_model.json b/parse/train/BkeqO7x0-/BkeqO7x0-_model.json new file mode 100644 index 0000000000000000000000000000000000000000..be6fb52db7b8791f6b75ffc210c67733256c2602 --- /dev/null +++ b/parse/train/BkeqO7x0-/BkeqO7x0-_model.json @@ -0,0 +1,18560 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1337, + 1404, + 1337, + 1404, + 1670, + 298, + 1670 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 398, + 951, + 1302, + 951, + 1302, + 1195, + 398, + 1195 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1792, + 1404, + 1792, + 1404, + 1976, + 298, + 1976 + ], + "score": 0.975 + }, + { + "category_id": 0, + "poly": [ + 300, + 220, + 1401, + 220, + 1401, + 321, + 300, + 321 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 1048, + 376, + 1385, + 376, + 1385, + 439, + 1048, + 439 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 318, + 375, + 650, + 375, + 650, + 438, + 318, + 438 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 315, + 483, + 602, + 483, + 602, + 548, + 315, + 548 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 1114, + 483, + 1385, + 483, + 1385, + 548, + 1114, + 548 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 313, + 592, + 701, + 592, + 701, + 655, + 313, + 655 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 314, + 702, + 963, + 702, + 963, + 796, + 314, + 796 + ], + "score": 0.932 + }, + { + "category_id": 2, + "poly": [ + 342, + 2006, + 934, + 2006, + 934, + 2033, + 342, + 2033 + ], + "score": 0.922 + }, + { + "category_id": 0, + "poly": [ + 302, + 1263, + 573, + 1263, + 573, + 1298, + 302, + 1298 + ], + "score": 0.889 + }, + { + "category_id": 1, + "poly": [ + 999, + 592, + 1387, + 592, + 1387, + 657, + 999, + 657 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.875 + }, + { + "category_id": 0, + "poly": [ + 773, + 879, + 927, + 879, + 927, + 911, + 773, + 911 + ], + "score": 0.847 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 857, + 2089, + 857, + 2112, + 841, + 2112 + ], + "score": 0.674 + }, + { + "category_id": 1, + "poly": [ + 334, + 1701, + 1367, + 1701, + 1367, + 1763, + 334, + 1763 + ], + "score": 0.647 + }, + { + "category_id": 0, + "poly": [ + 334, + 1701, + 1367, + 1701, + 1367, + 1763, + 334, + 1763 + ], + "score": 0.404 + }, + { + "category_id": 0, + "poly": [ + 999, + 594, + 1187, + 594, + 1187, + 623, + 999, + 623 + ], + "score": 0.231 + }, + { + "category_id": 15, + "poly": [ + 293.0, + 214.0, + 1406.0, + 214.0, + 1406.0, + 276.0, + 293.0, + 276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 269.0, + 444.0, + 269.0, + 444.0, + 330.0, + 292.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 2001.0, + 938.0, + 2001.0, + 938.0, + 2038.0, + 340.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1260.0, + 579.0, + 1260.0, + 579.0, + 1307.0, + 294.0, + 1307.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, + 877.0, + 932.0, + 877.0, + 932.0, + 915.0, + 770.0, + 915.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": [ + 336.0, + 1700.0, + 1366.0, + 1700.0, + 1366.0, + 1736.0, + 336.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1732.0, + 1134.0, + 1732.0, + 1134.0, + 1767.0, + 565.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 592.0, + 1193.0, + 592.0, + 1193.0, + 626.0, + 994.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1336.0, + 1405.0, + 1336.0, + 1405.0, + 1371.0, + 294.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1367.0, + 1404.0, + 1367.0, + 1404.0, + 1401.0, + 293.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1398.0, + 1405.0, + 1398.0, + 1405.0, + 1433.0, + 292.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1426.0, + 1405.0, + 1426.0, + 1405.0, + 1463.0, + 292.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1459.0, + 1406.0, + 1459.0, + 1406.0, + 1494.0, + 294.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1489.0, + 1405.0, + 1489.0, + 1405.0, + 1523.0, + 292.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1519.0, + 1406.0, + 1519.0, + 1406.0, + 1554.0, + 293.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1550.0, + 1405.0, + 1550.0, + 1405.0, + 1585.0, + 294.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1581.0, + 1404.0, + 1581.0, + 1404.0, + 1615.0, + 294.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1611.0, + 1404.0, + 1611.0, + 1404.0, + 1645.0, + 294.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1643.0, + 1072.0, + 1643.0, + 1072.0, + 1673.0, + 297.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 952.0, + 1304.0, + 952.0, + 1304.0, + 985.0, + 396.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 981.0, + 1306.0, + 981.0, + 1306.0, + 1019.0, + 393.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1014.0, + 1306.0, + 1014.0, + 1306.0, + 1047.0, + 394.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1043.0, + 1307.0, + 1043.0, + 1307.0, + 1079.0, + 393.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1073.0, + 1307.0, + 1073.0, + 1307.0, + 1110.0, + 393.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1105.0, + 1306.0, + 1105.0, + 1306.0, + 1137.0, + 394.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1133.0, + 1307.0, + 1133.0, + 1307.0, + 1169.0, + 392.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1163.0, + 1222.0, + 1163.0, + 1222.0, + 1199.0, + 394.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1793.0, + 1404.0, + 1793.0, + 1404.0, + 1824.0, + 297.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1822.0, + 1406.0, + 1822.0, + 1406.0, + 1857.0, + 294.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1852.0, + 1404.0, + 1852.0, + 1404.0, + 1888.0, + 293.0, + 1888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1881.0, + 1406.0, + 1881.0, + 1406.0, + 1918.0, + 292.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1912.0, + 1405.0, + 1912.0, + 1405.0, + 1949.0, + 293.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1404.0, + 1942.0, + 1404.0, + 1978.0, + 294.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 373.0, + 1260.0, + 373.0, + 1260.0, + 413.0, + 1042.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 408.0, + 1385.0, + 408.0, + 1385.0, + 439.0, + 1048.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 375.0, + 561.0, + 375.0, + 561.0, + 407.0, + 317.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 409.0, + 652.0, + 409.0, + 652.0, + 439.0, + 313.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 481.0, + 479.0, + 481.0, + 479.0, + 521.0, + 306.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 517.0, + 603.0, + 517.0, + 603.0, + 549.0, + 314.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 518.0, + 1386.0, + 518.0, + 1386.0, + 551.0, + 1114.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.75, + 479.5, + 1305.75, + 479.5, + 1305.75, + 519.5, + 1111.75, + 519.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 592.0, + 595.0, + 592.0, + 595.0, + 624.0, + 309.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 627.0, + 701.0, + 627.0, + 701.0, + 657.0, + 312.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 695.0, + 967.0, + 695.0, + 967.0, + 742.0, + 306.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 755.0, + 494.0, + 755.0, + 494.0, + 807.0, + 305.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.25, + 730.0, + 422.25, + 730.0, + 422.25, + 766.0, + 308.25, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 592.0, + 1194.0, + 592.0, + 1194.0, + 624.0, + 994.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 624.0, + 1387.0, + 624.0, + 1387.0, + 660.0, + 997.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 1700.0, + 1366.0, + 1700.0, + 1366.0, + 1736.0, + 336.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1732.0, + 1134.0, + 1732.0, + 1134.0, + 1767.0, + 565.0, + 1767.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 948, + 1404, + 948, + 1404, + 1253, + 297, + 1253 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1589, + 1405, + 1589, + 1405, + 1927, + 298, + 1927 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 1268, + 1404, + 1268, + 1404, + 1575, + 297, + 1575 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 300, + 1943, + 1402, + 1943, + 1402, + 2034, + 300, + 2034 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 368, + 365, + 1404, + 365, + 1404, + 578, + 368, + 578 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 295, + 229, + 1401, + 229, + 1401, + 293, + 295, + 293 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 300, + 673, + 1406, + 673, + 1406, + 766, + 300, + 766 + ], + "score": 0.932 + }, + { + "category_id": 4, + "poly": [ + 590, + 892, + 1109, + 892, + 1109, + 926, + 590, + 926 + ], + "score": 0.926 + }, + { + "category_id": 3, + "poly": [ + 369, + 812, + 1322, + 812, + 1322, + 874, + 369, + 874 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 295, + 307, + 1359, + 307, + 1359, + 341, + 295, + 341 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 301, + 614, + 741, + 614, + 741, + 646, + 301, + 646 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.714 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.138 + }, + { + "category_id": 13, + "poly": [ + 992, + 1132, + 1070, + 1132, + 1070, + 1163, + 992, + 1163 + ], + "score": 0.88, + "latex": "( 8 . 2 \\% )" + }, + { + "category_id": 13, + "poly": [ + 608, + 1163, + 647, + 1163, + 647, + 1191, + 608, + 1191 + ], + "score": 0.87, + "latex": "1 \\%" + }, + { + "category_id": 13, + "poly": [ + 579, + 1895, + 634, + 1895, + 634, + 1924, + 579, + 1924 + ], + "score": 0.86, + "latex": "20 \\%" + }, + { + "category_id": 13, + "poly": [ + 925, + 398, + 980, + 398, + 980, + 427, + 925, + 427 + ], + "score": 0.84, + "latex": "50 \\%" + }, + { + "category_id": 13, + "poly": [ + 688, + 1132, + 776, + 1132, + 776, + 1162, + 688, + 1162 + ], + "score": 0.8, + "latex": "( 1 2 . 7 \\% )" + }, + { + "category_id": 13, + "poly": [ + 1227, + 1132, + 1259, + 1132, + 1259, + 1161, + 1227, + 1161 + ], + "score": 0.6, + "latex": "\\cdot _ { x } ," + }, + { + "category_id": 13, + "poly": [ + 1312, + 1132, + 1342, + 1132, + 1342, + 1161, + 1312, + 1161 + ], + "score": 0.57, + "latex": "\\cdot _ { z } ," + }, + { + "category_id": 13, + "poly": [ + 824, + 1132, + 901, + 1132, + 901, + 1162, + 824, + 1162 + ], + "score": 0.5, + "latex": "( 9 . 1 \\% )" + }, + { + "category_id": 13, + "poly": [ + 1181, + 1132, + 1213, + 1132, + 1213, + 1164, + 1181, + 1164 + ], + "score": 0.44, + "latex": "\\mathbf { \\dot { q } }" + }, + { + "category_id": 13, + "poly": [ + 789, + 1132, + 817, + 1132, + 817, + 1160, + 789, + 1160 + ], + "score": 0.37, + "latex": "\\cdot _ { t } ," + }, + { + "category_id": 13, + "poly": [ + 652, + 1133, + 680, + 1133, + 680, + 1160, + 652, + 1160 + ], + "score": 0.34, + "latex": "\\cdot _ { e } ," + }, + { + "category_id": 13, + "poly": [ + 954, + 1132, + 987, + 1132, + 987, + 1161, + 954, + 1161 + ], + "score": 0.32, + "latex": "\\cdot _ { a } ," + }, + { + "category_id": 15, + "poly": [ + 588.0, + 890.0, + 1111.0, + 890.0, + 1111.0, + 930.0, + 588.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 811.0, + 1323.0, + 811.0, + 1323.0, + 845.0, + 373.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 841.0, + 1326.0, + 841.0, + 1326.0, + 872.0, + 374.0, + 872.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, + 611.0, + 745.0, + 611.0, + 745.0, + 649.0, + 295.0, + 649.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, + 946.0, + 1405.0, + 946.0, + 1405.0, + 984.0, + 294.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 978.0, + 1406.0, + 978.0, + 1406.0, + 1014.0, + 292.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1009.0, + 1404.0, + 1009.0, + 1404.0, + 1045.0, + 295.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1038.0, + 1405.0, + 1038.0, + 1405.0, + 1074.0, + 294.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1070.0, + 1406.0, + 1070.0, + 1406.0, + 1106.0, + 294.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1099.0, + 1405.0, + 1099.0, + 1405.0, + 1135.0, + 294.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1131.0, + 651.0, + 1131.0, + 651.0, + 1166.0, + 294.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1131.0, + 687.0, + 1131.0, + 687.0, + 1166.0, + 681.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 1131.0, + 788.0, + 1131.0, + 788.0, + 1166.0, + 777.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1131.0, + 823.0, + 1131.0, + 823.0, + 1166.0, + 818.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1131.0, + 953.0, + 1131.0, + 953.0, + 1166.0, + 902.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 1131.0, + 991.0, + 1131.0, + 991.0, + 1166.0, + 988.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1131.0, + 1180.0, + 1131.0, + 1180.0, + 1166.0, + 1071.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1131.0, + 1226.0, + 1131.0, + 1226.0, + 1166.0, + 1214.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 1131.0, + 1311.0, + 1131.0, + 1311.0, + 1166.0, + 1260.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1131.0, + 1406.0, + 1131.0, + 1406.0, + 1166.0, + 1343.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1160.0, + 607.0, + 1160.0, + 607.0, + 1197.0, + 292.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 1160.0, + 1405.0, + 1160.0, + 1405.0, + 1197.0, + 648.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1193.0, + 1402.0, + 1193.0, + 1402.0, + 1228.0, + 294.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1223.0, + 751.0, + 1223.0, + 751.0, + 1257.0, + 293.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1590.0, + 1405.0, + 1590.0, + 1405.0, + 1625.0, + 296.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1620.0, + 1405.0, + 1620.0, + 1405.0, + 1655.0, + 295.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1651.0, + 1406.0, + 1651.0, + 1406.0, + 1686.0, + 295.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1682.0, + 1407.0, + 1682.0, + 1407.0, + 1717.0, + 295.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1711.0, + 1406.0, + 1711.0, + 1406.0, + 1748.0, + 292.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1744.0, + 1405.0, + 1744.0, + 1405.0, + 1775.0, + 295.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1773.0, + 1405.0, + 1773.0, + 1405.0, + 1809.0, + 292.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1802.0, + 1405.0, + 1802.0, + 1405.0, + 1839.0, + 295.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1834.0, + 1402.0, + 1834.0, + 1402.0, + 1869.0, + 295.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1862.0, + 1406.0, + 1862.0, + 1406.0, + 1901.0, + 293.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1895.0, + 578.0, + 1895.0, + 578.0, + 1930.0, + 295.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1895.0, + 960.0, + 1895.0, + 960.0, + 1930.0, + 635.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1268.0, + 1405.0, + 1268.0, + 1405.0, + 1305.0, + 294.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1298.0, + 1405.0, + 1298.0, + 1405.0, + 1334.0, + 295.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1330.0, + 1406.0, + 1330.0, + 1406.0, + 1366.0, + 292.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1360.0, + 1402.0, + 1360.0, + 1402.0, + 1396.0, + 294.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1388.0, + 1405.0, + 1388.0, + 1405.0, + 1430.0, + 291.0, + 1430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1422.0, + 1405.0, + 1422.0, + 1405.0, + 1457.0, + 295.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1452.0, + 1405.0, + 1452.0, + 1405.0, + 1488.0, + 294.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1483.0, + 1407.0, + 1483.0, + 1407.0, + 1518.0, + 294.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1512.0, + 1407.0, + 1512.0, + 1407.0, + 1551.0, + 292.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1544.0, + 512.0, + 1544.0, + 512.0, + 1577.0, + 295.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2006.0, + 296.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 1406.0, + 2002.0, + 1406.0, + 2040.0, + 293.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 365.0, + 1405.0, + 365.0, + 1405.0, + 403.0, + 368.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 397.0, + 924.0, + 397.0, + 924.0, + 435.0, + 393.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 397.0, + 1379.0, + 397.0, + 1379.0, + 435.0, + 981.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 438.0, + 1402.0, + 438.0, + 1402.0, + 475.0, + 381.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 470.0, + 933.0, + 470.0, + 933.0, + 506.0, + 393.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 511.0, + 1404.0, + 511.0, + 1404.0, + 550.0, + 367.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 545.0, + 736.0, + 545.0, + 736.0, + 578.0, + 395.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 228.0, + 1404.0, + 228.0, + 1404.0, + 266.0, + 291.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 560.0, + 261.0, + 560.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 672.0, + 1404.0, + 672.0, + 1404.0, + 706.0, + 296.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 703.0, + 1406.0, + 703.0, + 1406.0, + 738.0, + 293.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 734.0, + 1404.0, + 734.0, + 1404.0, + 768.0, + 296.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 303.0, + 1361.0, + 303.0, + 1361.0, + 348.0, + 294.0, + 348.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 482, + 1404, + 482, + 1404, + 701, + 297, + 701 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 1533, + 1405, + 1533, + 1405, + 1722, + 297, + 1722 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 831, + 1403, + 831, + 1403, + 1018, + 297, + 1018 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1109, + 1403, + 1109, + 1403, + 1235, + 298, + 1235 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 1404, + 228, + 1404, + 385, + 298, + 385 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1371, + 1406, + 1371, + 1406, + 1436, + 299, + 1436 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 565, + 1251, + 1131, + 1251, + 1131, + 1351, + 565, + 1351 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 559, + 1035, + 1140, + 1035, + 1140, + 1091, + 559, + 1091 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 506, + 763, + 1194, + 763, + 1194, + 811, + 506, + 811 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 300, + 1948, + 1024, + 1948, + 1024, + 1983, + 300, + 1983 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 295, + 713, + 1266, + 713, + 1266, + 746, + 295, + 746 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 298, + 1733, + 876, + 1733, + 876, + 1766, + 298, + 1766 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 297, + 1840, + 1025, + 1840, + 1025, + 1874, + 297, + 1874 + ], + "score": 0.922 + }, + { + "category_id": 8, + "poly": [ + 439, + 1891, + 1257, + 1891, + 1257, + 1933, + 439, + 1933 + ], + "score": 0.914 + }, + { + "category_id": 8, + "poly": [ + 442, + 1784, + 1254, + 1784, + 1254, + 1826, + 442, + 1826 + ], + "score": 0.909 + }, + { + "category_id": 0, + "poly": [ + 302, + 424, + 764, + 424, + 764, + 458, + 302, + 458 + ], + "score": 0.908 + }, + { + "category_id": 0, + "poly": [ + 301, + 1475, + 515, + 1475, + 515, + 1507, + 301, + 1507 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.905 + }, + { + "category_id": 9, + "poly": [ + 1366, + 769, + 1400, + 769, + 1400, + 800, + 1366, + 800 + ], + "score": 0.898 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1041, + 1400, + 1041, + 1400, + 1070, + 1366, + 1070 + ], + "score": 0.896 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1285, + 1400, + 1285, + 1400, + 1315, + 1366, + 1315 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1790, + 1400, + 1790, + 1400, + 1819, + 1366, + 1819 + ], + "score": 0.874 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1897, + 1401, + 1897, + 1401, + 1927, + 1365, + 1927 + ], + "score": 0.868 + }, + { + "category_id": 8, + "poly": [ + 314, + 1998, + 1382, + 1998, + 1382, + 2039, + 314, + 2039 + ], + "score": 0.856 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.667 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.481 + }, + { + "category_id": 13, + "poly": [ + 714, + 1687, + 899, + 1687, + 899, + 1721, + 714, + 1721 + ], + "score": 0.93, + "latex": "D y : \\bar { \\mathcal { Y } } \\stackrel { \\textstyle - } { \\to } \\bar { [ 0 , 1 ] }" + }, + { + "category_id": 13, + "poly": [ + 473, + 1688, + 663, + 1688, + 663, + 1721, + 473, + 1721 + ], + "score": 0.93, + "latex": "D _ { \\mathcal { X } } : \\mathcal { X } [ 0 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 432, + 1402, + 670, + 1402, + 670, + 1437, + 432, + 1437 + ], + "score": 0.92, + "latex": "\\mathcal { X } _ { g } \\overset { \\cdot } { = } \\{ F ( z ) | z \\sim \\bar { \\mathcal { Z } } \\}" + }, + { + "category_id": 14, + "poly": [ + 558, + 1036, + 1140, + 1036, + 1140, + 1092, + 558, + 1092 + ], + "score": 0.92, + "latex": "D ^ { * } = \\arg \\operatorname* { m a x } _ { \\| D \\| _ { L } \\leq K } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ D ( F ( z ) ) ]" + }, + { + "category_id": 13, + "poly": [ + 970, + 1658, + 1109, + 1658, + 1109, + 1688, + 970, + 1688 + ], + "score": 0.92, + "latex": "F : \\mathcal { X } \\mathcal { Y }" + }, + { + "category_id": 14, + "poly": [ + 315, + 1998, + 1380, + 1998, + 1380, + 2038, + 315, + 2038 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathcal { L } ( F , G , D _ { \\mathcal { X } } , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) = \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) + \\lambda \\cdot \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 507, + 764, + 1192, + 764, + 1192, + 814, + 507, + 814 + ], + "score": 0.91, + "latex": "D ^ { * } = \\arg \\operatorname* { m a x } _ { D } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ \\log D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ \\log ( 1 - D ( F ( z ) ) ) ]" + }, + { + "category_id": 13, + "poly": [ + 965, + 1842, + 1014, + 1842, + 1014, + 1877, + 965, + 1877 + ], + "score": 0.91, + "latex": "\\mathcal { L } _ { \\mathrm { c y c } }" + }, + { + "category_id": 13, + "poly": [ + 1159, + 1657, + 1297, + 1657, + 1297, + 1688, + 1159, + 1688 + ], + "score": 0.91, + "latex": "G : \\mathcal { V } \\to \\mathcal { X }" + }, + { + "category_id": 14, + "poly": [ + 564, + 1249, + 1136, + 1249, + 1136, + 1353, + 564, + 1353 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { D ^ { * } = \\arg \\underset { D } { \\operatorname* { m a x } } \\mathbb { E } _ { x \\sim \\mathcal { X } } [ D ( x ) ] - \\mathbb { E } _ { z \\sim \\mathcal { Z } } [ D ( F ( z ) ) ] + } \\\\ & { \\qquad \\quad \\alpha \\cdot \\mathbb { E } _ { \\hat { x } \\sim \\hat { \\mathcal { X } } } [ ( \\| \\nabla _ { \\hat { x } } D ( \\hat { x } ) \\| _ { 2 } - 1 ) ^ { 2 } ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 957, + 438, + 957, + 438, + 983, + 298, + 983 + ], + "score": 0.89, + "latex": "D : X \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 802, + 1735, + 867, + 1735, + 867, + 1766, + 802, + 1766 + ], + "score": 0.88, + "latex": "{ \\mathcal { L } } _ { \\mathrm { G A N } }" + }, + { + "category_id": 13, + "poly": [ + 358, + 1368, + 385, + 1368, + 385, + 1400, + 358, + 1400 + ], + "score": 0.87, + "latex": "\\hat { \\mathcal X }" + }, + { + "category_id": 14, + "poly": [ + 443, + 1785, + 1256, + 1785, + 1256, + 1825, + 443, + 1825 + ], + "score": 0.87, + "latex": "{ \\mathcal { L } } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\chi , \\mathcal { V } ) = \\mathbb { E } _ { y \\sim \\mathcal { V } } [ \\log D _ { \\mathcal { V } } ( y ) ] + \\mathbb { E } _ { x \\sim \\chi } [ \\log ( 1 - D _ { \\mathcal { V } } ( F ( x ) ) ) ]" + }, + { + "category_id": 14, + "poly": [ + 441, + 1891, + 1258, + 1891, + 1258, + 1931, + 441, + 1931 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) = \\mathbb { E } _ { x \\sim \\mathcal { X } } [ \\| G ( F ( x ) ) - x \\| _ { 1 } ] + \\mathbb { E } _ { y \\sim \\mathcal { Y } } [ \\| F ( G ( y ) ) - y \\| _ { 1 } ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1104, + 1374, + 1130, + 1374, + 1130, + 1400, + 1104, + 1400 + ], + "score": 0.84, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 742, + 835, + 769, + 835, + 769, + 861, + 742, + 861 + ], + "score": 0.84, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 478, + 1659, + 504, + 1659, + 504, + 1685, + 478, + 1685 + ], + "score": 0.84, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 380, + 835, + 405, + 835, + 405, + 861, + 380, + 861 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 996, + 1952, + 1013, + 1952, + 1013, + 1977, + 996, + 1977 + ], + "score": 0.83, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 556, + 1659, + 580, + 1659, + 580, + 1687, + 556, + 1687 + ], + "score": 0.8, + "latex": "\\mathcal { V }" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 424.0, + 768.0, + 424.0, + 768.0, + 461.0, + 297.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1470.0, + 519.0, + 1470.0, + 519.0, + 1514.0, + 294.0, + 1514.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, + 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, + 483.0, + 1404.0, + 483.0, + 1404.0, + 519.0, + 295.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 512.0, + 1404.0, + 512.0, + 1404.0, + 552.0, + 292.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 544.0, + 1404.0, + 544.0, + 1404.0, + 580.0, + 292.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 575.0, + 1406.0, + 575.0, + 1406.0, + 613.0, + 292.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 605.0, + 1404.0, + 605.0, + 1404.0, + 640.0, + 294.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 638.0, + 1405.0, + 638.0, + 1405.0, + 672.0, + 295.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 668.0, + 1063.0, + 668.0, + 1063.0, + 702.0, + 295.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1536.0, + 1403.0, + 1536.0, + 1403.0, + 1568.0, + 296.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1564.0, + 1405.0, + 1564.0, + 1405.0, + 1599.0, + 291.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1593.0, + 1403.0, + 1593.0, + 1403.0, + 1633.0, + 294.0, + 1633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1625.0, + 1405.0, + 1625.0, + 1405.0, + 1660.0, + 294.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1655.0, + 477.0, + 1655.0, + 477.0, + 1695.0, + 292.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 1655.0, + 555.0, + 1655.0, + 555.0, + 1695.0, + 505.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 1655.0, + 969.0, + 1655.0, + 969.0, + 1695.0, + 581.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1110.0, + 1655.0, + 1158.0, + 1655.0, + 1158.0, + 1695.0, + 1110.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 1655.0, + 1407.0, + 1655.0, + 1407.0, + 1695.0, + 1298.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1687.0, + 472.0, + 1687.0, + 472.0, + 1723.0, + 294.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 1687.0, + 713.0, + 1687.0, + 713.0, + 1723.0, + 664.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 1687.0, + 911.0, + 1687.0, + 911.0, + 1723.0, + 900.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 830.0, + 379.0, + 830.0, + 379.0, + 868.0, + 295.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 830.0, + 741.0, + 830.0, + 741.0, + 868.0, + 406.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 830.0, + 1407.0, + 830.0, + 1407.0, + 868.0, + 770.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 859.0, + 1407.0, + 859.0, + 1407.0, + 904.0, + 292.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 895.0, + 1404.0, + 895.0, + 1404.0, + 927.0, + 296.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 926.0, + 1404.0, + 926.0, + 1404.0, + 958.0, + 296.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 953.0, + 1405.0, + 953.0, + 1405.0, + 991.0, + 439.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 985.0, + 1158.0, + 985.0, + 1158.0, + 1022.0, + 294.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1110.0, + 1404.0, + 1110.0, + 1404.0, + 1146.0, + 294.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1143.0, + 1404.0, + 1143.0, + 1404.0, + 1176.0, + 294.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1170.0, + 1404.0, + 1170.0, + 1404.0, + 1209.0, + 292.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1203.0, + 868.0, + 1203.0, + 868.0, + 1241.0, + 293.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 232.0, + 1404.0, + 232.0, + 1404.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 262.0, + 1405.0, + 262.0, + 1405.0, + 296.0, + 296.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 290.0, + 1406.0, + 290.0, + 1406.0, + 327.0, + 293.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, + 351.0, + 1296.0, + 351.0, + 1296.0, + 388.0, + 294.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1367.0, + 357.0, + 1367.0, + 357.0, + 1407.0, + 294.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 1367.0, + 1103.0, + 1367.0, + 1103.0, + 1407.0, + 386.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1367.0, + 1404.0, + 1367.0, + 1404.0, + 1407.0, + 1131.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1400.0, + 431.0, + 1400.0, + 431.0, + 1440.0, + 294.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 1400.0, + 682.0, + 1400.0, + 682.0, + 1440.0, + 671.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1944.0, + 995.0, + 1944.0, + 995.0, + 1990.0, + 294.0, + 1990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1944.0, + 1027.0, + 1944.0, + 1027.0, + 1990.0, + 1014.0, + 1990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 712.0, + 1267.0, + 712.0, + 1267.0, + 750.0, + 294.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1730.0, + 801.0, + 1730.0, + 801.0, + 1773.0, + 293.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1730.0, + 880.0, + 1730.0, + 880.0, + 1773.0, + 868.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1832.0, + 964.0, + 1832.0, + 964.0, + 1883.0, + 294.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 1832.0, + 1028.0, + 1832.0, + 1028.0, + 1883.0, + 1015.0, + 1883.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1055, + 1404, + 1055, + 1404, + 1484, + 298, + 1484 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 1498, + 1404, + 1498, + 1404, + 1774, + 298, + 1774 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1787, + 1403, + 1787, + 1403, + 2035, + 298, + 2035 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 820, + 1406, + 820, + 1406, + 945, + 297, + 945 + ], + "score": 0.975 + }, + { + "category_id": 8, + "poly": [ + 538, + 578, + 1164, + 578, + 1164, + 793, + 538, + 793 + ], + "score": 0.965 + }, + { + "category_id": 4, + "poly": [ + 295, + 392, + 1403, + 392, + 1403, + 487, + 295, + 487 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 300, + 537, + 703, + 537, + 703, + 570, + 300, + 570 + ], + "score": 0.93 + }, + { + "category_id": 0, + "poly": [ + 301, + 986, + 598, + 986, + 598, + 1022, + 301, + 1022 + ], + "score": 0.908 + }, + { + "category_id": 3, + "poly": [ + 547, + 239, + 1148, + 239, + 1148, + 385, + 547, + 385 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 815, + 75, + 815, + 105, + 298, + 105 + ], + "score": 0.903 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.766 + }, + { + "category_id": 3, + "poly": [ + 548, + 160, + 1150, + 160, + 1150, + 384, + 548, + 384 + ], + "score": 0.13 + }, + { + "category_id": 14, + "poly": [ + 533, + 576, + 1166, + 576, + 1166, + 798, + 533, + 798 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { F ^ { * } = \\arg \\underset { F } { \\operatorname* { m i n } } \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) } \\\\ & { G ^ { * } = \\arg \\underset { G } { \\operatorname* { m i n } } \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) } \\\\ & { D _ { \\mathcal { X } } ^ { * } = \\arg \\underset { D _ { \\mathcal { X } } } { \\operatorname* { m a x } } \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { Y } , \\mathcal { X } ) } \\\\ & { D _ { \\mathcal { Y } } ^ { * } = \\arg \\underset { D _ { \\mathcal { Y } } } { \\operatorname* { m a x } } \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 500, + 1359, + 687, + 1359, + 687, + 1394, + 500, + 1394 + ], + "score": 0.93, + "latex": "{ \\Delta ^ { k } \\backslash \\{ \\bf { v } _ { 1 } , . . . , \\bf { v } _ { k } \\} }" + }, + { + "category_id": 13, + "poly": [ + 485, + 823, + 536, + 823, + 536, + 855, + 485, + 855 + ], + "score": 0.92, + "latex": "\\mathcal { L } _ { \\mathrm { c y c } }" + }, + { + "category_id": 13, + "poly": [ + 945, + 1268, + 984, + 1268, + 984, + 1298, + 945, + 1298 + ], + "score": 0.9, + "latex": "\\Delta ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 435, + 1335, + 466, + 1335, + 466, + 1361, + 435, + 1361 + ], + "score": 0.84, + "latex": "\\mathbf { v } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1172, + 1270, + 1192, + 1270, + 1192, + 1298, + 1172, + 1298 + ], + "score": 0.76, + "latex": "k" + }, + { + "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": [ + 295.0, + 422.0, + 1405.0, + 422.0, + 1405.0, + 460.0, + 295.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 453.0, + 1045.0, + 453.0, + 1045.0, + 489.0, + 293.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 984.0, + 602.0, + 984.0, + 602.0, + 1026.0, + 291.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 223.0, + 708.0, + 223.0, + 708.0, + 397.0, + 565.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 243.5, + 922.0, + 243.5, + 922.0, + 375.0, + 757.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 244.0, + 1158.0, + 244.0, + 1158.0, + 400.5, + 953.0, + 400.5 + ], + "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": [ + 833.0, + 231.0, + 902.0, + 231.0, + 902.0, + 367.0, + 833.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 232.0, + 685.0, + 232.0, + 685.0, + 384.0, + 574.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 250.0, + 1150.0, + 250.0, + 1150.0, + 397.0, + 971.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1056.0, + 1406.0, + 1056.0, + 1406.0, + 1091.0, + 296.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1088.0, + 1404.0, + 1088.0, + 1404.0, + 1119.0, + 294.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1117.0, + 1404.0, + 1117.0, + 1404.0, + 1153.0, + 294.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1147.0, + 1406.0, + 1147.0, + 1406.0, + 1182.0, + 293.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1178.0, + 1405.0, + 1178.0, + 1405.0, + 1214.0, + 294.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1208.0, + 1405.0, + 1208.0, + 1405.0, + 1243.0, + 293.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1236.0, + 1408.0, + 1236.0, + 1408.0, + 1277.0, + 291.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1266.0, + 944.0, + 1266.0, + 944.0, + 1306.0, + 293.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1266.0, + 1171.0, + 1266.0, + 1171.0, + 1306.0, + 985.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 1266.0, + 1406.0, + 1266.0, + 1406.0, + 1306.0, + 1193.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1297.0, + 1406.0, + 1297.0, + 1406.0, + 1334.0, + 293.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1331.0, + 434.0, + 1331.0, + 434.0, + 1366.0, + 293.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 1331.0, + 1406.0, + 1331.0, + 1406.0, + 1366.0, + 467.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1357.0, + 499.0, + 1357.0, + 499.0, + 1398.0, + 292.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1357.0, + 1408.0, + 1357.0, + 1408.0, + 1398.0, + 688.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1393.0, + 1404.0, + 1393.0, + 1404.0, + 1425.0, + 296.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1420.0, + 1404.0, + 1420.0, + 1404.0, + 1456.0, + 293.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1454.0, + 514.0, + 1454.0, + 514.0, + 1487.0, + 296.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1499.0, + 1405.0, + 1499.0, + 1405.0, + 1535.0, + 294.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1528.0, + 1404.0, + 1528.0, + 1404.0, + 1566.0, + 292.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1559.0, + 1406.0, + 1559.0, + 1406.0, + 1597.0, + 293.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1589.0, + 1405.0, + 1589.0, + 1405.0, + 1626.0, + 294.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1622.0, + 1405.0, + 1622.0, + 1405.0, + 1654.0, + 294.0, + 1654.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": [ + 294.0, + 1680.0, + 1402.0, + 1680.0, + 1402.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1710.0, + 1406.0, + 1710.0, + 1406.0, + 1750.0, + 293.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1744.0, + 728.0, + 1744.0, + 728.0, + 1777.0, + 296.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1788.0, + 1403.0, + 1788.0, + 1403.0, + 1824.0, + 294.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1819.0, + 1404.0, + 1819.0, + 1404.0, + 1854.0, + 293.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1852.0, + 1404.0, + 1852.0, + 1404.0, + 1886.0, + 296.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1880.0, + 1404.0, + 1880.0, + 1404.0, + 1919.0, + 292.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1911.0, + 1407.0, + 1911.0, + 1407.0, + 1947.0, + 292.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1977.0, + 294.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": [ + 296.0, + 2004.0, + 995.0, + 2004.0, + 995.0, + 2038.0, + 296.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 819.0, + 484.0, + 819.0, + 484.0, + 858.0, + 294.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 819.0, + 1406.0, + 819.0, + 1406.0, + 858.0, + 537.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 853.0, + 1403.0, + 853.0, + 1403.0, + 886.0, + 295.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 884.0, + 1404.0, + 884.0, + 1404.0, + 916.0, + 294.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 911.0, + 972.0, + 911.0, + 972.0, + 951.0, + 292.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 535.0, + 705.0, + 535.0, + 705.0, + 574.0, + 295.0, + 574.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 230, + 1404, + 230, + 1404, + 595, + 298, + 595 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 872, + 1404, + 872, + 1404, + 1177, + 298, + 1177 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 611, + 1404, + 611, + 1404, + 857, + 298, + 857 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 367, + 1288, + 1405, + 1288, + 1405, + 1696, + 367, + 1696 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 369, + 1837, + 1149, + 1837, + 1149, + 2038, + 369, + 2038 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 289, + 1721, + 1367, + 1721, + 1367, + 1756, + 289, + 1756 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.895 + }, + { + "category_id": 0, + "poly": [ + 298, + 1237, + 435, + 1237, + 435, + 1267, + 298, + 1267 + ], + "score": 0.882 + }, + { + "category_id": 1, + "poly": [ + 295, + 1192, + 1280, + 1192, + 1280, + 1225, + 295, + 1225 + ], + "score": 0.88 + }, + { + "category_id": 1, + "poly": [ + 300, + 1765, + 849, + 1765, + 849, + 1797, + 300, + 1797 + ], + "score": 0.842 + }, + { + "category_id": 1, + "poly": [ + 305, + 1800, + 382, + 1800, + 382, + 1826, + 305, + 1826 + ], + "score": 0.79 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2112, + 840, + 2112 + ], + "score": 0.732 + }, + { + "category_id": 13, + "poly": [ + 659, + 1950, + 757, + 1950, + 757, + 1981, + 659, + 1981 + ], + "score": 0.92, + "latex": "D _ { \\mathcal { X } } , D _ { \\mathcal { Y } }" + }, + { + "category_id": 13, + "poly": [ + 523, + 1890, + 803, + 1890, + 803, + 1926, + 523, + 1926 + ], + "score": 0.91, + "latex": "F : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { V } } } , G : \\overline { { \\mathcal { V } } } \\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 455, + 1433, + 520, + 1433, + 520, + 1467, + 455, + 1467 + ], + "score": 0.91, + "latex": "B _ { \\epsilon } [ x ]" + }, + { + "category_id": 13, + "poly": [ + 810, + 1630, + 950, + 1630, + 950, + 1661, + 810, + 1661 + ], + "score": 0.91, + "latex": "\\overline { { F } } : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { Y } } }" + }, + { + "category_id": 13, + "poly": [ + 970, + 1489, + 1016, + 1489, + 1016, + 1518, + 970, + 1518 + ], + "score": 0.91, + "latex": "D _ { \\mathcal { X } }" + }, + { + "category_id": 13, + "poly": [ + 951, + 1316, + 1037, + 1316, + 1037, + 1346, + 951, + 1346 + ], + "score": 0.91, + "latex": "\\chi _ { \\mathrm { ~ C ~ } } \\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 838, + 1663, + 1095, + 1663, + 1095, + 1697, + 838, + 1697 + ], + "score": 0.91, + "latex": "{ \\overline { { F } } } ( x ) = F ( x ) , \\forall x \\in { \\mathcal { X } }" + }, + { + "category_id": 13, + "poly": [ + 685, + 2004, + 779, + 2004, + 779, + 2036, + 685, + 2036 + ], + "score": 0.9, + "latex": "R _ { \\mathcal { X } } , R _ { \\mathcal { Y } }" + }, + { + "category_id": 13, + "poly": [ + 447, + 1633, + 588, + 1633, + 588, + 1662, + 447, + 1662 + ], + "score": 0.9, + "latex": "F : \\mathcal { X } \\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 1263, + 1368, + 1401, + 1368, + 1401, + 1401, + 1263, + 1401 + ], + "score": 0.9, + "latex": "R : \\overline { { \\mathcal { X } } } \\to \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 400, + 1547, + 617, + 1547, + 617, + 1582, + 400, + 1582 + ], + "score": 0.89, + "latex": "( D _ { \\mathcal { X } } ( x ) \\not \\approx D _ { \\mathcal { X } } ( \\bar { x } ) )" + }, + { + "category_id": 13, + "poly": [ + 571, + 1841, + 632, + 1841, + 632, + 1872, + 571, + 1872 + ], + "score": 0.89, + "latex": "\\mathcal { X } , \\mathcal { y }" + }, + { + "category_id": 13, + "poly": [ + 991, + 1518, + 1183, + 1518, + 1183, + 1549, + 991, + 1549 + ], + "score": 0.88, + "latex": "\\exists x \\in { \\mathcal { X } } , { \\bar { x } } \\in { \\overline { { \\mathcal { X } } } }" + }, + { + "category_id": 13, + "poly": [ + 1037, + 1630, + 1098, + 1630, + 1098, + 1663, + 1037, + 1663 + ], + "score": 0.85, + "latex": "\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }" + }, + { + "category_id": 13, + "poly": [ + 1105, + 1403, + 1300, + 1403, + 1300, + 1434, + 1105, + 1434 + ], + "score": 0.85, + "latex": "\\forall x \\in \\mathcal { X } , \\exists \\epsilon > 0" + }, + { + "category_id": 13, + "poly": [ + 606, + 1662, + 630, + 1662, + 630, + 1690, + 606, + 1690 + ], + "score": 0.84, + "latex": "\\overline { F }" + }, + { + "category_id": 13, + "poly": [ + 1050, + 1434, + 1075, + 1434, + 1075, + 1460, + 1050, + 1460 + ], + "score": 0.84, + "latex": "\\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 427, + 1664, + 493, + 1664, + 493, + 1695, + 427, + 1695 + ], + "score": 0.84, + "latex": "x , y )" + }, + { + "category_id": 13, + "poly": [ + 1035, + 1893, + 1146, + 1893, + 1146, + 1922, + 1035, + 1922 + ], + "score": 0.84, + "latex": "F = G ^ { - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1008, + 1952, + 1063, + 1952, + 1063, + 1980, + 1008, + 1980 + ], + "score": 0.83, + "latex": "F , G" + }, + { + "category_id": 13, + "poly": [ + 731, + 1402, + 757, + 1402, + 757, + 1429, + 731, + 1429 + ], + "score": 0.83, + "latex": "\\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 808, + 1316, + 833, + 1316, + 833, + 1344, + 808, + 1344 + ], + "score": 0.83, + "latex": "\\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 1344, + 1404, + 1404, + 1404, + 1404, + 1434, + 1344, + 1434 + ], + "score": 0.82, + "latex": "R \\equiv" + }, + { + "category_id": 13, + "poly": [ + 1236, + 1518, + 1361, + 1518, + 1361, + 1551, + 1236, + 1551 + ], + "score": 0.8, + "latex": "R ( \\bar { x } ) = x" + }, + { + "category_id": 13, + "poly": [ + 959, + 1404, + 987, + 1404, + 987, + 1430, + 959, + 1430 + ], + "score": 0.8, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 1326, + 1289, + 1353, + 1289, + 1353, + 1315, + 1326, + 1315 + ], + "score": 0.78, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 922, + 1519, + 947, + 1519, + 947, + 1546, + 922, + 1546 + ], + "score": 0.69, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 643, + 1435, + 667, + 1435, + 667, + 1461, + 643, + 1461 + ], + "score": 0.68, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 944, + 1838, + 1003, + 1838, + 1003, + 1872, + 944, + 1872 + ], + "score": 0.66, + "latex": "\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }" + }, + { + "category_id": 13, + "poly": [ + 397, + 1440, + 416, + 1440, + 416, + 1461, + 397, + 1461 + ], + "score": 0.46, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 1378, + 1519, + 1402, + 1519, + 1402, + 1546, + 1378, + 1546 + ], + "score": 0.43, + "latex": "\\wedge" + }, + { + "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, + 1237.0, + 440.0, + 1237.0, + 440.0, + 1269.0, + 296.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 861.0, + 2086.0, + 861.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 231.0, + 1404.0, + 231.0, + 1404.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 261.0, + 1404.0, + 261.0, + 1404.0, + 295.0, + 293.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 290.0, + 1406.0, + 290.0, + 1406.0, + 328.0, + 293.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 320.0, + 1406.0, + 320.0, + 1406.0, + 358.0, + 293.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 353.0, + 1405.0, + 353.0, + 1405.0, + 387.0, + 294.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 381.0, + 1405.0, + 381.0, + 1405.0, + 417.0, + 293.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 411.0, + 1406.0, + 411.0, + 1406.0, + 450.0, + 292.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 440.0, + 1406.0, + 440.0, + 1406.0, + 479.0, + 292.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 475.0, + 1404.0, + 475.0, + 1404.0, + 509.0, + 294.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 502.0, + 1405.0, + 502.0, + 1405.0, + 541.0, + 292.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 535.0, + 1404.0, + 535.0, + 1404.0, + 567.0, + 293.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 566.0, + 817.0, + 566.0, + 817.0, + 599.0, + 292.0, + 599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 870.0, + 1405.0, + 870.0, + 1405.0, + 907.0, + 297.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 906.0, + 1405.0, + 906.0, + 1405.0, + 937.0, + 296.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 933.0, + 1406.0, + 933.0, + 1406.0, + 969.0, + 293.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 964.0, + 1404.0, + 964.0, + 1404.0, + 999.0, + 294.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 994.0, + 1405.0, + 994.0, + 1405.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, + 1060.0, + 293.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1051.0, + 1408.0, + 1051.0, + 1408.0, + 1093.0, + 292.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1085.0, + 1405.0, + 1085.0, + 1405.0, + 1121.0, + 294.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1114.0, + 1406.0, + 1114.0, + 1406.0, + 1152.0, + 291.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1144.0, + 384.0, + 1144.0, + 384.0, + 1181.0, + 293.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 613.0, + 1405.0, + 613.0, + 1405.0, + 646.0, + 296.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 641.0, + 1404.0, + 641.0, + 1404.0, + 675.0, + 294.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 674.0, + 1402.0, + 674.0, + 1402.0, + 708.0, + 294.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 704.0, + 1404.0, + 704.0, + 1404.0, + 738.0, + 296.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 735.0, + 1404.0, + 735.0, + 1404.0, + 769.0, + 294.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 765.0, + 1404.0, + 765.0, + 1404.0, + 799.0, + 294.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 798.0, + 1402.0, + 798.0, + 1402.0, + 828.0, + 296.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 827.0, + 1240.0, + 827.0, + 1240.0, + 860.0, + 296.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 1287.0, + 1325.0, + 1287.0, + 1325.0, + 1321.0, + 373.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1287.0, + 1404.0, + 1287.0, + 1404.0, + 1321.0, + 1354.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1319.0, + 807.0, + 1319.0, + 807.0, + 1350.0, + 392.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 1319.0, + 950.0, + 1319.0, + 950.0, + 1350.0, + 834.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1319.0, + 1047.0, + 1319.0, + 1047.0, + 1350.0, + 1038.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 1369.0, + 1262.0, + 1369.0, + 1262.0, + 1409.0, + 366.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1369.0, + 1406.0, + 1369.0, + 1406.0, + 1409.0, + 1402.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 1403.0, + 730.0, + 1403.0, + 730.0, + 1437.0, + 390.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1403.0, + 958.0, + 1403.0, + 958.0, + 1437.0, + 758.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 1403.0, + 1104.0, + 1403.0, + 1104.0, + 1437.0, + 988.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1301.0, + 1403.0, + 1343.0, + 1403.0, + 1343.0, + 1437.0, + 1301.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1431.0, + 396.0, + 1431.0, + 396.0, + 1469.0, + 392.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 1431.0, + 454.0, + 1431.0, + 454.0, + 1469.0, + 417.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 1431.0, + 642.0, + 1431.0, + 642.0, + 1469.0, + 521.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 1431.0, + 1049.0, + 1431.0, + 1049.0, + 1469.0, + 668.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 1431.0, + 1089.0, + 1431.0, + 1089.0, + 1469.0, + 1076.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 377.0, + 1483.0, + 969.0, + 1483.0, + 969.0, + 1524.0, + 377.0, + 1524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1483.0, + 1404.0, + 1483.0, + 1404.0, + 1524.0, + 1017.0, + 1524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1518.0, + 921.0, + 1518.0, + 921.0, + 1552.0, + 395.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 1518.0, + 990.0, + 1518.0, + 990.0, + 1552.0, + 948.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1518.0, + 1235.0, + 1518.0, + 1235.0, + 1552.0, + 1184.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1362.0, + 1518.0, + 1377.0, + 1518.0, + 1377.0, + 1552.0, + 1362.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1548.0, + 629.0, + 1548.0, + 629.0, + 1584.0, + 618.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1601.0, + 1405.0, + 1601.0, + 1405.0, + 1637.0, + 380.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1631.0, + 446.0, + 1631.0, + 446.0, + 1665.0, + 394.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 1631.0, + 809.0, + 1631.0, + 809.0, + 1665.0, + 589.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 1631.0, + 1036.0, + 1631.0, + 1036.0, + 1665.0, + 951.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 1631.0, + 1405.0, + 1631.0, + 1405.0, + 1665.0, + 1099.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1662.0, + 426.0, + 1662.0, + 426.0, + 1698.0, + 395.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 494.0, + 1662.0, + 605.0, + 1662.0, + 605.0, + 1698.0, + 494.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 1662.0, + 837.0, + 1662.0, + 837.0, + 1698.0, + 631.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1662.0, + 1103.0, + 1662.0, + 1103.0, + 1698.0, + 1096.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1837.0, + 570.0, + 1837.0, + 570.0, + 1874.0, + 368.0, + 1874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 1837.0, + 943.0, + 1837.0, + 943.0, + 1874.0, + 633.0, + 1874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 1889.0, + 522.0, + 1889.0, + 522.0, + 1930.0, + 366.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1889.0, + 1034.0, + 1889.0, + 1034.0, + 1930.0, + 804.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 1889.0, + 1150.0, + 1889.0, + 1150.0, + 1930.0, + 1147.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1944.0, + 658.0, + 1944.0, + 658.0, + 1985.0, + 368.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1944.0, + 1007.0, + 1944.0, + 1007.0, + 1985.0, + 758.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1997.0, + 684.0, + 1997.0, + 684.0, + 2042.0, + 368.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 1997.0, + 783.0, + 1997.0, + 783.0, + 2042.0, + 780.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1717.0, + 1372.0, + 1717.0, + 1372.0, + 1761.0, + 295.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1189.0, + 1283.0, + 1189.0, + 1283.0, + 1230.0, + 293.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1759.0, + 850.0, + 1759.0, + 850.0, + 1805.0, + 293.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 1794.0, + 388.0, + 1794.0, + 388.0, + 1831.0, + 302.0, + 1831.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1245, + 1406, + 1245, + 1406, + 1643, + 296, + 1643 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 296, + 765, + 1406, + 765, + 1406, + 1043, + 296, + 1043 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1803, + 1405, + 1803, + 1405, + 1927, + 298, + 1927 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 442, + 1405, + 442, + 1405, + 598, + 296, + 598 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 1941, + 1402, + 1941, + 1402, + 2035, + 298, + 2035 + ], + "score": 0.972 + }, + { + "category_id": 8, + "poly": [ + 494, + 1655, + 1208, + 1655, + 1208, + 1792, + 494, + 1792 + ], + "score": 0.972 + }, + { + "category_id": 8, + "poly": [ + 422, + 1056, + 1280, + 1056, + 1280, + 1235, + 422, + 1235 + ], + "score": 0.967 + }, + { + "category_id": 0, + "poly": [ + 299, + 708, + 522, + 708, + 522, + 742, + 299, + 742 + ], + "score": 0.914 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 299, + 640, + 481, + 640, + 481, + 677, + 299, + 677 + ], + "score": 0.899 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 859, + 2089, + 859, + 2112, + 840, + 2112 + ], + "score": 0.793 + }, + { + "category_id": 1, + "poly": [ + 297, + 230, + 1401, + 230, + 1401, + 292, + 297, + 292 + ], + "score": 0.69 + }, + { + "category_id": 1, + "poly": [ + 301, + 353, + 1397, + 353, + 1397, + 419, + 301, + 419 + ], + "score": 0.68 + }, + { + "category_id": 1, + "poly": [ + 305, + 293, + 1398, + 293, + 1398, + 352, + 305, + 352 + ], + "score": 0.673 + }, + { + "category_id": 14, + "poly": [ + 490, + 1654, + 1209, + 1654, + 1209, + 1796, + 490, + 1796 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { y \\sim \\mathcal { V } } [ D _ { \\mathcal { V } } ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad - \\mathbb { E } _ { \\boldsymbol { x } \\sim \\boldsymbol { x } } [ D _ { \\mathcal { V } } ( F ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad + \\alpha \\cdot \\mathbb { E } _ { \\hat { \\boldsymbol { y } } \\sim \\hat { \\mathcal { V } } } [ ( \\| \\nabla _ { \\hat { \\boldsymbol { y } } } D _ { \\mathcal { V } } ( \\hat { \\boldsymbol { y } } ) \\| _ { 2 } - 1 ) ^ { 2 } ] } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 419, + 1053, + 1279, + 1053, + 1279, + 1237, + 419, + 1237 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { \\boldsymbol { y } \\sim \\mathcal { V } } [ \\log D _ { \\mathcal { V } } ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ] } \\\\ & { \\qquad + \\mathbb { E } _ { \\boldsymbol { x } \\sim \\mathcal { X } } [ \\log ( 1 - D _ { \\mathcal { V } } ( \\boldsymbol { F } ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) ) ] } \\\\ & { \\qquad \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\boldsymbol { \\chi } , \\mathcal { V } ) = \\mathbb { E } _ { \\boldsymbol { x } \\sim \\mathcal { X } } [ \\| G ( F ( \\boldsymbol { x } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) - \\boldsymbol { x } \\| _ { 1 } ] } \\\\ & { \\qquad + \\mathbb { E } _ { \\boldsymbol { y } \\sim \\mathcal { Y } } [ \\| F ( G ( \\boldsymbol { y } \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) \\cdot \\boldsymbol { W } _ { E m b } ^ { \\top } ) - \\boldsymbol { y } \\| _ { 1 } ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 970, + 386, + 1052, + 386, + 1052, + 420, + 970, + 420 + ], + "score": 0.92, + "latex": "D _ { \\mathcal { X } } ( x )" + }, + { + "category_id": 13, + "poly": [ + 1106, + 386, + 1184, + 386, + 1184, + 420, + 1106, + 420 + ], + "score": 0.92, + "latex": "D _ { \\mathcal { Y } } ( y )" + }, + { + "category_id": 13, + "poly": [ + 1061, + 1338, + 1139, + 1338, + 1139, + 1368, + 1061, + 1368 + ], + "score": 0.92, + "latex": "W _ { E m b }" + }, + { + "category_id": 13, + "poly": [ + 913, + 1247, + 991, + 1247, + 991, + 1278, + 913, + 1278 + ], + "score": 0.91, + "latex": "W _ { E m b }" + }, + { + "category_id": 13, + "poly": [ + 347, + 388, + 419, + 388, + 419, + 419, + 347, + 419 + ], + "score": 0.91, + "latex": "y \\in \\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 666, + 1368, + 732, + 1368, + 732, + 1400, + 666, + 1400 + ], + "score": 0.91, + "latex": "\\mathcal { L } _ { \\mathrm { G A N } }" + }, + { + "category_id": 13, + "poly": [ + 763, + 353, + 810, + 353, + 810, + 387, + 763, + 387 + ], + "score": 0.9, + "latex": "D _ { \\overline { { \\mathcal { X } } } }" + }, + { + "category_id": 13, + "poly": [ + 676, + 263, + 747, + 263, + 747, + 294, + 676, + 294 + ], + "score": 0.9, + "latex": "y \\in \\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 442, + 1368, + 493, + 1368, + 493, + 1401, + 442, + 1401 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { \\mathrm { c y c } }" + }, + { + "category_id": 13, + "poly": [ + 862, + 353, + 907, + 353, + 907, + 389, + 862, + 389 + ], + "score": 0.9, + "latex": "D _ { \\overline { { { y } } } }" + }, + { + "category_id": 13, + "poly": [ + 1158, + 232, + 1233, + 232, + 1233, + 259, + 1158, + 259 + ], + "score": 0.88, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 1322, + 353, + 1401, + 353, + 1401, + 381, + 1322, + 381 + ], + "score": 0.88, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 1154, + 1278, + 1179, + 1278, + 1179, + 1304, + 1154, + 1304 + ], + "score": 0.85, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 368, + 322, + 394, + 322, + 394, + 349, + 368, + 349 + ], + "score": 0.83, + "latex": "\\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 1232, + 1278, + 1256, + 1278, + 1256, + 1304, + 1232, + 1304 + ], + "score": 0.81, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 649, + 1867, + 674, + 1867, + 674, + 1891, + 649, + 1891 + ], + "score": 0.79, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 1295, + 1253, + 1314, + 1253, + 1314, + 1274, + 1295, + 1274 + ], + "score": 0.75, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 407, + 232, + 432, + 232, + 432, + 258, + 407, + 258 + ], + "score": 0.73, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 518, + 263, + 543, + 263, + 543, + 289, + 518, + 289 + ], + "score": 0.69, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 994, + 293, + 1021, + 293, + 1021, + 319, + 994, + 319 + ], + "score": 0.68, + "latex": "\\mathcal { X }" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 706.0, + 526.0, + 706.0, + 526.0, + 746.0, + 293.0, + 746.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": [ + 290.0, + 635.0, + 487.0, + 635.0, + 487.0, + 685.0, + 290.0, + 685.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": [ + 296.0, + 1246.0, + 912.0, + 1246.0, + 912.0, + 1282.0, + 296.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 1246.0, + 1294.0, + 1246.0, + 1294.0, + 1282.0, + 992.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1315.0, + 1246.0, + 1406.0, + 1246.0, + 1406.0, + 1282.0, + 1315.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1278.0, + 1153.0, + 1278.0, + 1153.0, + 1310.0, + 295.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 1278.0, + 1231.0, + 1278.0, + 1231.0, + 1310.0, + 1180.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1257.0, + 1278.0, + 1404.0, + 1278.0, + 1404.0, + 1310.0, + 1257.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1307.0, + 1406.0, + 1307.0, + 1406.0, + 1342.0, + 293.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1332.0, + 1060.0, + 1332.0, + 1060.0, + 1377.0, + 291.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1332.0, + 1406.0, + 1332.0, + 1406.0, + 1377.0, + 1140.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1367.0, + 441.0, + 1367.0, + 441.0, + 1408.0, + 293.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 494.0, + 1367.0, + 665.0, + 1367.0, + 665.0, + 1408.0, + 494.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1367.0, + 1407.0, + 1367.0, + 1407.0, + 1408.0, + 733.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1399.0, + 1404.0, + 1399.0, + 1404.0, + 1435.0, + 295.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1428.0, + 1404.0, + 1428.0, + 1404.0, + 1465.0, + 294.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1458.0, + 1404.0, + 1458.0, + 1404.0, + 1495.0, + 294.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1489.0, + 1406.0, + 1489.0, + 1406.0, + 1526.0, + 294.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1519.0, + 1404.0, + 1519.0, + 1404.0, + 1556.0, + 294.0, + 1556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1552.0, + 1404.0, + 1552.0, + 1404.0, + 1584.0, + 295.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1579.0, + 1404.0, + 1579.0, + 1404.0, + 1615.0, + 294.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1611.0, + 875.0, + 1611.0, + 875.0, + 1646.0, + 295.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 765.0, + 1404.0, + 765.0, + 1404.0, + 803.0, + 294.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 794.0, + 1406.0, + 794.0, + 1406.0, + 838.0, + 291.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 827.0, + 1404.0, + 827.0, + 1404.0, + 863.0, + 293.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 858.0, + 1406.0, + 858.0, + 1406.0, + 895.0, + 294.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 887.0, + 1406.0, + 887.0, + 1406.0, + 926.0, + 293.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 918.0, + 1404.0, + 918.0, + 1404.0, + 955.0, + 294.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 950.0, + 1404.0, + 950.0, + 1404.0, + 987.0, + 294.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 974.0, + 1407.0, + 974.0, + 1407.0, + 1022.0, + 291.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1010.0, + 681.0, + 1010.0, + 681.0, + 1047.0, + 297.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1804.0, + 1403.0, + 1804.0, + 1403.0, + 1837.0, + 296.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1836.0, + 1405.0, + 1836.0, + 1405.0, + 1869.0, + 295.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1866.0, + 648.0, + 1866.0, + 648.0, + 1899.0, + 298.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 1866.0, + 1405.0, + 1866.0, + 1405.0, + 1899.0, + 675.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1894.0, + 725.0, + 1894.0, + 725.0, + 1928.0, + 293.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 444.0, + 1402.0, + 444.0, + 1402.0, + 477.0, + 295.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 471.0, + 1403.0, + 471.0, + 1403.0, + 511.0, + 293.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 505.0, + 1403.0, + 505.0, + 1403.0, + 539.0, + 295.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 531.0, + 1405.0, + 531.0, + 1405.0, + 572.0, + 293.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 564.0, + 1377.0, + 564.0, + 1377.0, + 603.0, + 293.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 1402.0, + 1942.0, + 1402.0, + 1976.0, + 293.0, + 1976.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": [ + 293.0, + 2001.0, + 1406.0, + 2001.0, + 1406.0, + 2039.0, + 293.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 406.0, + 228.0, + 406.0, + 267.0, + 295.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 433.0, + 228.0, + 1157.0, + 228.0, + 1157.0, + 267.0, + 433.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 228.0, + 1403.0, + 228.0, + 1403.0, + 267.0, + 1234.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 517.0, + 261.0, + 517.0, + 296.0, + 295.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 261.0, + 675.0, + 261.0, + 675.0, + 296.0, + 544.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 261.0, + 756.0, + 261.0, + 756.0, + 296.0, + 748.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 350.0, + 762.0, + 350.0, + 762.0, + 390.0, + 296.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 350.0, + 861.0, + 350.0, + 861.0, + 390.0, + 811.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 350.0, + 1321.0, + 350.0, + 1321.0, + 390.0, + 908.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 385.0, + 346.0, + 385.0, + 346.0, + 425.0, + 295.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 385.0, + 969.0, + 385.0, + 969.0, + 425.0, + 420.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 385.0, + 1105.0, + 385.0, + 1105.0, + 425.0, + 1053.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 385.0, + 1194.0, + 385.0, + 1194.0, + 425.0, + 1185.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 290.0, + 993.0, + 290.0, + 993.0, + 325.0, + 297.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 290.0, + 1403.0, + 290.0, + 1403.0, + 325.0, + 1022.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 321.0, + 367.0, + 321.0, + 367.0, + 357.0, + 297.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 321.0, + 830.0, + 321.0, + 830.0, + 357.0, + 395.0, + 357.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1667, + 1404, + 1667, + 1404, + 2035, + 297, + 2035 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 884, + 1404, + 884, + 1404, + 1102, + 298, + 1102 + ], + "score": 0.981 + }, + { + "category_id": 5, + "poly": [ + 459, + 224, + 1239, + 224, + 1239, + 413, + 459, + 413 + ], + "score": 0.98, + "html": "
WorkCiphertext LengthAccuracy
Hasinoff (2003)500~ 97%
Forsyth& Safavi-Naini (1993)5000~ 100%
Ramesh et al. (1993)160~ 78.5%
Verma et al. (2007)1000~ 87%
" + }, + { + "category_id": 1, + "poly": [ + 298, + 748, + 1403, + 748, + 1403, + 870, + 298, + 870 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 301, + 1194, + 1400, + 1194, + 1400, + 1318, + 301, + 1318 + ], + "score": 0.977 + }, + { + "category_id": 8, + "poly": [ + 459, + 1332, + 1240, + 1332, + 1240, + 1467, + 459, + 1467 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 544, + 1521, + 1155, + 1521, + 1155, + 1638, + 544, + 1638 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 297, + 514, + 1399, + 514, + 1399, + 577, + 297, + 577 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 298, + 1479, + 562, + 1479, + 562, + 1510, + 298, + 1510 + ], + "score": 0.928 + }, + { + "category_id": 0, + "poly": [ + 299, + 1137, + 489, + 1137, + 489, + 1169, + 299, + 1169 + ], + "score": 0.908 + }, + { + "category_id": 0, + "poly": [ + 300, + 621, + 558, + 621, + 558, + 656, + 300, + 656 + ], + "score": 0.906 + }, + { + "category_id": 0, + "poly": [ + 299, + 690, + 433, + 690, + 433, + 722, + 299, + 722 + ], + "score": 0.905 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 815, + 75, + 815, + 105, + 298, + 105 + ], + "score": 0.901 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2111, + 841, + 2111 + ], + "score": 0.672 + }, + { + "category_id": 1, + "poly": [ + 336, + 427, + 1354, + 427, + 1354, + 460, + 336, + 460 + ], + "score": 0.438 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 859, + 2087, + 859, + 2111, + 841, + 2111 + ], + "score": 0.333 + }, + { + "category_id": 7, + "poly": [ + 336, + 427, + 1354, + 427, + 1354, + 460, + 336, + 460 + ], + "score": 0.302 + }, + { + "category_id": 14, + "poly": [ + 459, + 1328, + 1241, + 1328, + 1241, + 1471, + 459, + 1471 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\mathcal { L } _ { \\mathrm { G A N } } ( F , D y , \\mathcal { X } , \\mathcal { Y } ) = \\mathbb { E } _ { y \\sim \\mathcal { Y } } [ ( D y ( y \\cdot W _ { E m b } ^ { \\top } ) ) ^ { 2 } ] } \\\\ & { \\qquad + \\mathbb { E } _ { x \\sim \\mathcal { X } } [ ( 1 - D _ { \\mathcal { V } } ( F ( x \\cdot W _ { E m b } ^ { \\top } ) \\cdot W _ { E m b } ^ { \\top } ) ) ^ { 2 } ] } \\\\ & { \\qquad + \\alpha \\cdot \\mathbb { E } _ { \\hat { y } \\sim \\hat { \\mathcal { Y } } } [ ( 1 - \\| \\nabla _ { \\hat { y } } D y ( \\hat { y } ) \\| _ { 2 } ) ^ { 2 } ] } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 543, + 1519, + 1155, + 1519, + 1155, + 1643, + 543, + 1643 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } { \\mathcal { L } _ { \\mathrm { T o t a l } } ( F , G , D _ { \\mathcal { X } } , D _ { \\mathcal { Y } } , \\mathcal { X } , \\mathcal { Y } ) = \\mathcal { L } _ { \\mathrm { c y c } } ( F , G , \\mathcal { X } , \\mathcal { Y } ) } & { } \\\\ { + \\mathcal { L } _ { \\mathrm { G A N } } ( F , D _ { \\mathcal { V } } , \\mathcal { X } , \\mathcal { Y } ) } & { } \\\\ { + \\mathcal { L } _ { \\mathrm { G A N } } ( G , D _ { \\mathcal { X } } , \\mathcal { X } , \\mathcal { Y } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 729, + 1973, + 839, + 1973, + 839, + 2004, + 729, + 2004 + ], + "score": 0.91, + "latex": "\\beta _ { 2 } = 0 . 9" + }, + { + "category_id": 13, + "poly": [ + 1037, + 1882, + 1106, + 1882, + 1106, + 1910, + 1037, + 1910 + ], + "score": 0.89, + "latex": "\\lambda = 1" + }, + { + "category_id": 13, + "poly": [ + 587, + 1973, + 676, + 1973, + 676, + 2004, + 587, + 2004 + ], + "score": 0.85, + "latex": "\\beta _ { 1 } = 0" + }, + { + "category_id": 13, + "poly": [ + 297, + 2003, + 378, + 2003, + 378, + 2032, + 297, + 2032 + ], + "score": 0.84, + "latex": "2 e - 4" + }, + { + "category_id": 13, + "poly": [ + 338, + 840, + 363, + 840, + 363, + 870, + 338, + 870 + ], + "score": 0.82, + "latex": "\\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 448, + 810, + 477, + 810, + 477, + 836, + 448, + 836 + ], + "score": 0.79, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 661, + 979, + 681, + 979, + 681, + 1006, + 661, + 1006 + ], + "score": 0.73, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 688, + 780, + 728, + 780, + 728, + 807, + 688, + 807 + ], + "score": 0.71, + "latex": "2 *" + }, + { + "category_id": 13, + "poly": [ + 495, + 1973, + 575, + 1973, + 575, + 2002, + 495, + 2002 + ], + "score": 0.66, + "latex": "2 e - 4" + }, + { + "category_id": 13, + "poly": [ + 615, + 948, + 651, + 948, + 651, + 976, + 615, + 976 + ], + "score": 0.3, + "latex": "\\mathbf { \\vec { C } } ^ { \\mathbf { \\vec { \\mu } } }" + }, + { + "category_id": 13, + "poly": [ + 336, + 780, + 361, + 780, + 361, + 807, + 336, + 807 + ], + "score": 0.29, + "latex": "\\&" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1134.0, + 492.0, + 1134.0, + 492.0, + 1174.0, + 293.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 621.0, + 561.0, + 621.0, + 561.0, + 661.0, + 293.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 688.0, + 438.0, + 688.0, + 438.0, + 726.0, + 294.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": [ + 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": [ + 338.0, + 423.0, + 1355.0, + 423.0, + 1355.0, + 464.0, + 338.0, + 464.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": [ + 294.0, + 1699.0, + 1406.0, + 1699.0, + 1406.0, + 1733.0, + 294.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1729.0, + 1404.0, + 1729.0, + 1404.0, + 1763.0, + 295.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1756.0, + 1405.0, + 1756.0, + 1405.0, + 1797.0, + 292.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1786.0, + 1405.0, + 1786.0, + 1405.0, + 1828.0, + 292.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1822.0, + 1406.0, + 1822.0, + 1406.0, + 1856.0, + 294.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1851.0, + 1405.0, + 1851.0, + 1405.0, + 1885.0, + 294.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1881.0, + 1036.0, + 1881.0, + 1036.0, + 1916.0, + 294.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 1881.0, + 1404.0, + 1881.0, + 1404.0, + 1916.0, + 1107.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1912.0, + 1405.0, + 1912.0, + 1405.0, + 1946.0, + 295.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1977.0, + 295.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1972.0, + 494.0, + 1972.0, + 494.0, + 2008.0, + 292.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1972.0, + 586.0, + 1972.0, + 586.0, + 2008.0, + 576.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 1972.0, + 728.0, + 1972.0, + 728.0, + 2008.0, + 677.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2008.0, + 840.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 379.0, + 2003.0, + 1405.0, + 2003.0, + 1405.0, + 2037.0, + 379.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 886.0, + 1404.0, + 886.0, + 1404.0, + 921.0, + 294.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 915.0, + 1406.0, + 915.0, + 1406.0, + 950.0, + 293.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 943.0, + 614.0, + 943.0, + 614.0, + 983.0, + 293.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 943.0, + 1406.0, + 943.0, + 1406.0, + 983.0, + 652.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 977.0, + 660.0, + 977.0, + 660.0, + 1012.0, + 293.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 977.0, + 1405.0, + 977.0, + 1405.0, + 1012.0, + 682.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1008.0, + 1406.0, + 1008.0, + 1406.0, + 1043.0, + 293.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1038.0, + 1405.0, + 1038.0, + 1405.0, + 1075.0, + 293.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1070.0, + 1348.0, + 1070.0, + 1348.0, + 1105.0, + 296.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 747.0, + 1404.0, + 747.0, + 1404.0, + 782.0, + 294.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 779.0, + 335.0, + 779.0, + 335.0, + 811.0, + 294.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 779.0, + 687.0, + 779.0, + 687.0, + 811.0, + 362.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 779.0, + 1404.0, + 779.0, + 1404.0, + 811.0, + 729.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 808.0, + 447.0, + 808.0, + 447.0, + 844.0, + 294.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 808.0, + 1407.0, + 808.0, + 1407.0, + 844.0, + 478.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 837.0, + 337.0, + 837.0, + 337.0, + 873.0, + 294.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 837.0, + 507.0, + 837.0, + 507.0, + 873.0, + 364.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1195.0, + 1404.0, + 1195.0, + 1404.0, + 1228.0, + 297.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1224.0, + 1405.0, + 1224.0, + 1405.0, + 1261.0, + 295.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1257.0, + 1404.0, + 1257.0, + 1404.0, + 1293.0, + 295.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1284.0, + 834.0, + 1284.0, + 834.0, + 1321.0, + 295.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 511.0, + 1404.0, + 511.0, + 1404.0, + 552.0, + 293.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 546.0, + 869.0, + 546.0, + 869.0, + 581.0, + 295.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1479.0, + 564.0, + 1479.0, + 564.0, + 1512.0, + 296.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 423.0, + 1355.0, + 423.0, + 1355.0, + 464.0, + 338.0, + 464.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1231, + 1404, + 1231, + 1404, + 1536, + 298, + 1536 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1650, + 1403, + 1650, + 1403, + 1896, + 298, + 1896 + ], + "score": 0.98 + }, + { + "category_id": 5, + "poly": [ + 356, + 686, + 1341, + 686, + 1341, + 949, + 356, + 949 + ], + "score": 0.974, + "html": "
Data Vocab sizeBrown-W 10Brown-W 200Brown-C 58Freq. Analysis (With Key) 58200
CipherShift/Permutation
Acc.100%98.7%99.8%80.9%44.5%
CipherVigenere (Key: “345")
Acc.99.7%75.7%99.0%9.6% (78.1%)<0.1% (44.3%)
" + }, + { + "category_id": 1, + "poly": [ + 299, + 1912, + 1402, + 1912, + 1402, + 2033, + 299, + 2033 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 345, + 224, + 1344, + 224, + 1344, + 574, + 345, + 574 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 302, + 1154, + 1401, + 1154, + 1401, + 1216, + 302, + 1216 + ], + "score": 0.947 + }, + { + "category_id": 4, + "poly": [ + 295, + 585, + 1401, + 585, + 1401, + 648, + 295, + 648 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.892 + }, + { + "category_id": 0, + "poly": [ + 300, + 1587, + 514, + 1587, + 514, + 1619, + 300, + 1619 + ], + "score": 0.882 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.788 + }, + { + "category_id": 6, + "poly": [ + 298, + 962, + 1405, + 962, + 1405, + 1085, + 298, + 1085 + ], + "score": 0.745 + }, + { + "category_id": 1, + "poly": [ + 298, + 962, + 1405, + 962, + 1405, + 1085, + 298, + 1085 + ], + "score": 0.252 + }, + { + "category_id": 13, + "poly": [ + 1080, + 1156, + 1168, + 1156, + 1168, + 1183, + 1080, + 1183 + ], + "score": 0.91, + "latex": "\\alpha = 1 0" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 238.0, + 390.0, + 238.0, + 390.0, + 253.0, + 373.0, + 253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 257.0, + 897.0, + 257.0, + 897.0, + 275.0, + 874.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 294.0, + 390.0, + 294.0, + 390.0, + 308.0, + 371.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 292.0, + 897.0, + 292.0, + 897.0, + 310.0, + 874.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 291.0, + 1330.0, + 291.0, + 1330.0, + 329.0, + 1172.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 304.0, + 1183.0, + 304.0, + 1183.0, + 322.0, + 1158.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 332.0, + 564.0, + 332.0, + 564.0, + 344.0, + 543.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 573.0, + 321.0, + 670.0, + 321.0, + 670.0, + 354.0, + 573.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 328.0, + 897.0, + 328.0, + 897.0, + 346.0, + 875.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 354.0, + 369.0, + 354.0, + 369.0, + 429.0, + 346.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 349.0, + 390.0, + 349.0, + 390.0, + 363.0, + 373.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 347.0, + 896.0, + 347.0, + 896.0, + 425.0, + 851.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 401.0, + 391.0, + 401.0, + 391.0, + 420.0, + 371.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 399.0, + 897.0, + 399.0, + 897.0, + 418.0, + 875.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 434.0, + 897.0, + 434.0, + 897.0, + 453.0, + 874.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 456.0, + 392.0, + 456.0, + 392.0, + 475.0, + 371.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 447.0, + 758.0, + 447.0, + 758.0, + 480.0, + 665.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 469.0, + 825.0, + 469.0, + 825.0, + 504.0, + 665.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 469.0, + 896.0, + 469.0, + 896.0, + 488.0, + 874.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 469.0, + 1292.0, + 469.0, + 1292.0, + 500.0, + 1216.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 494.0, + 788.0, + 494.0, + 788.0, + 528.0, + 665.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 503.0, + 906.0, + 503.0, + 906.0, + 526.0, + 873.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 491.0, + 1323.0, + 491.0, + 1323.0, + 526.0, + 1215.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 512.0, + 391.0, + 512.0, + 391.0, + 530.0, + 371.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 537.0, + 401.0, + 537.0, + 401.0, + 553.0, + 388.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 536.0, + 468.0, + 536.0, + 468.0, + 553.0, + 435.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 493.0, + 536.0, + 525.0, + 536.0, + 525.0, + 553.0, + 493.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 549.0, + 536.0, + 582.0, + 536.0, + 582.0, + 553.0, + 549.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 534.0, + 641.0, + 534.0, + 641.0, + 555.0, + 605.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 534.0, + 700.0, + 534.0, + 700.0, + 554.0, + 661.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 534.0, + 757.0, + 534.0, + 757.0, + 554.0, + 719.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 536.0, + 812.0, + 536.0, + 812.0, + 553.0, + 777.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 535.0, + 909.0, + 535.0, + 909.0, + 550.0, + 894.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 533.0, + 990.0, + 533.0, + 990.0, + 553.0, + 956.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 533.0, + 1061.0, + 533.0, + 1061.0, + 553.0, + 1027.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 531.0, + 1132.0, + 531.0, + 1132.0, + 553.0, + 1097.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 531.0, + 1203.0, + 531.0, + 1203.0, + 553.0, + 1168.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 531.0, + 1274.0, + 531.0, + 1274.0, + 553.0, + 1239.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 533.0, + 1345.0, + 533.0, + 1345.0, + 553.0, + 1310.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 551.0, + 635.0, + 551.0, + 635.0, + 579.0, + 577.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 546.0, + 1132.0, + 546.0, + 1132.0, + 580.0, + 1070.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1163.75, + 242.0, + 1334.75, + 242.0, + 1334.75, + 296.0, + 1163.75, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.25, + 279.0, + 1193.25, + 279.0, + 1193.25, + 348.0, + 909.25, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.25, + 302.0, + 1168.25, + 302.0, + 1168.25, + 315.0, + 1136.25, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.75, + 332.0, + 494.75, + 332.0, + 494.75, + 355.0, + 455.75, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 330.5, + 546.0, + 330.5, + 546.0, + 350.0, + 503.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 585.0, + 1403.0, + 585.0, + 1403.0, + 620.0, + 295.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 615.0, + 1102.0, + 615.0, + 1102.0, + 648.0, + 294.0, + 648.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, + 1583.0, + 520.0, + 1583.0, + 520.0, + 1626.0, + 292.0, + 1626.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": [ + 292.0, + 960.0, + 1406.0, + 960.0, + 1406.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, + 1027.0, + 295.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1021.0, + 1406.0, + 1021.0, + 1406.0, + 1060.0, + 293.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1054.0, + 393.0, + 1054.0, + 393.0, + 1089.0, + 292.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1229.0, + 1405.0, + 1229.0, + 1405.0, + 1266.0, + 293.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1263.0, + 1405.0, + 1263.0, + 1405.0, + 1297.0, + 293.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1292.0, + 1406.0, + 1292.0, + 1406.0, + 1328.0, + 296.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1325.0, + 1402.0, + 1325.0, + 1402.0, + 1357.0, + 296.0, + 1357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1352.0, + 1405.0, + 1352.0, + 1405.0, + 1389.0, + 293.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1383.0, + 1406.0, + 1383.0, + 1406.0, + 1419.0, + 294.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1414.0, + 1406.0, + 1414.0, + 1406.0, + 1451.0, + 292.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1442.0, + 1405.0, + 1442.0, + 1405.0, + 1482.0, + 292.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1476.0, + 1405.0, + 1476.0, + 1405.0, + 1511.0, + 296.0, + 1511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1506.0, + 960.0, + 1506.0, + 960.0, + 1539.0, + 294.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1649.0, + 1404.0, + 1649.0, + 1404.0, + 1685.0, + 294.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1680.0, + 1404.0, + 1680.0, + 1404.0, + 1714.0, + 294.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1713.0, + 1403.0, + 1713.0, + 1403.0, + 1747.0, + 296.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, + 1774.0, + 1403.0, + 1774.0, + 1403.0, + 1808.0, + 294.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1803.0, + 1407.0, + 1803.0, + 1407.0, + 1840.0, + 293.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1835.0, + 1405.0, + 1835.0, + 1405.0, + 1869.0, + 294.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1865.0, + 1000.0, + 1865.0, + 1000.0, + 1898.0, + 294.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1909.0, + 1407.0, + 1909.0, + 1407.0, + 1948.0, + 293.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1943.0, + 1407.0, + 1943.0, + 1407.0, + 1978.0, + 294.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1970.0, + 1406.0, + 1970.0, + 1406.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2001.0, + 1404.0, + 2001.0, + 1404.0, + 2036.0, + 294.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1153.0, + 1079.0, + 1153.0, + 1079.0, + 1189.0, + 298.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1169.0, + 1153.0, + 1405.0, + 1153.0, + 1405.0, + 1189.0, + 1169.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1184.0, + 557.0, + 1184.0, + 557.0, + 1219.0, + 297.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 960.0, + 1406.0, + 960.0, + 1406.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, + 1027.0, + 295.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1021.0, + 1406.0, + 1021.0, + 1406.0, + 1060.0, + 293.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1054.0, + 393.0, + 1054.0, + 393.0, + 1089.0, + 292.0, + 1089.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 894, + 1403, + 894, + 1403, + 1048, + 299, + 1048 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 296, + 230, + 1401, + 230, + 1401, + 293, + 296, + 293 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 298, + 409, + 1404, + 409, + 1404, + 804, + 298, + 804 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.891 + }, + { + "category_id": 0, + "poly": [ + 300, + 338, + 543, + 338, + 543, + 374, + 300, + 374 + ], + "score": 0.887 + }, + { + "category_id": 0, + "poly": [ + 300, + 1096, + 488, + 1096, + 488, + 1128, + 300, + 1128 + ], + "score": 0.861 + }, + { + "category_id": 0, + "poly": [ + 301, + 843, + 557, + 843, + 557, + 870, + 301, + 870 + ], + "score": 0.859 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.76 + }, + { + "category_id": 1, + "poly": [ + 286, + 1143, + 1407, + 1143, + 1407, + 2041, + 286, + 2041 + ], + "score": 0.532 + }, + { + "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": [ + 290.0, + 332.0, + 549.0, + 332.0, + 549.0, + 383.0, + 290.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1094.0, + 492.0, + 1094.0, + 492.0, + 1134.0, + 296.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 844.0, + 558.0, + 844.0, + 558.0, + 872.0, + 299.0, + 872.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, + 893.0, + 1402.0, + 893.0, + 1402.0, + 930.0, + 295.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 922.0, + 1405.0, + 922.0, + 1405.0, + 960.0, + 293.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 954.0, + 1404.0, + 954.0, + 1404.0, + 990.0, + 294.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 982.0, + 1405.0, + 982.0, + 1405.0, + 1023.0, + 293.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1013.0, + 435.0, + 1013.0, + 435.0, + 1056.0, + 293.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1405.0, + 228.0, + 1405.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 260.0, + 1406.0, + 260.0, + 1406.0, + 300.0, + 295.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 408.0, + 1405.0, + 408.0, + 1405.0, + 444.0, + 296.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 440.0, + 1402.0, + 440.0, + 1402.0, + 472.0, + 294.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 471.0, + 1405.0, + 471.0, + 1405.0, + 503.0, + 294.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 500.0, + 1406.0, + 500.0, + 1406.0, + 536.0, + 294.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 529.0, + 1406.0, + 529.0, + 1406.0, + 569.0, + 292.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 560.0, + 1405.0, + 560.0, + 1405.0, + 596.0, + 294.0, + 596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 588.0, + 1405.0, + 588.0, + 1405.0, + 627.0, + 292.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 621.0, + 1405.0, + 621.0, + 1405.0, + 657.0, + 293.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 652.0, + 1406.0, + 652.0, + 1406.0, + 689.0, + 293.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 680.0, + 1404.0, + 680.0, + 1404.0, + 719.0, + 293.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 713.0, + 1404.0, + 713.0, + 1404.0, + 750.0, + 294.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 742.0, + 1404.0, + 742.0, + 1404.0, + 778.0, + 294.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 775.0, + 1077.0, + 775.0, + 1077.0, + 808.0, + 296.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1144.0, + 1405.0, + 1144.0, + 1405.0, + 1188.0, + 292.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1179.0, + 611.0, + 1179.0, + 611.0, + 1212.0, + 321.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1229.0, + 1406.0, + 1229.0, + 1406.0, + 1272.0, + 292.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1263.0, + 611.0, + 1263.0, + 611.0, + 1300.0, + 322.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1317.0, + 1405.0, + 1317.0, + 1405.0, + 1357.0, + 292.0, + 1357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1346.0, + 1140.0, + 1346.0, + 1140.0, + 1387.0, + 320.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1400.0, + 1405.0, + 1400.0, + 1405.0, + 1443.0, + 291.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1433.0, + 573.0, + 1433.0, + 573.0, + 1470.0, + 325.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1484.0, + 1406.0, + 1484.0, + 1406.0, + 1527.0, + 292.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1519.0, + 1406.0, + 1519.0, + 1406.0, + 1556.0, + 322.0, + 1556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1550.0, + 610.0, + 1550.0, + 610.0, + 1583.0, + 324.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1601.0, + 1405.0, + 1601.0, + 1405.0, + 1641.0, + 293.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1631.0, + 1405.0, + 1631.0, + 1405.0, + 1674.0, + 319.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1665.0, + 453.0, + 1665.0, + 453.0, + 1704.0, + 322.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1715.0, + 1406.0, + 1715.0, + 1406.0, + 1760.0, + 292.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1749.0, + 719.0, + 1749.0, + 719.0, + 1786.0, + 322.0, + 1786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1801.0, + 1288.0, + 1801.0, + 1288.0, + 1840.0, + 292.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1854.0, + 1406.0, + 1854.0, + 1406.0, + 1897.0, + 292.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1890.0, + 1405.0, + 1890.0, + 1405.0, + 1926.0, + 324.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1920.0, + 882.0, + 1920.0, + 882.0, + 1955.0, + 320.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1969.0, + 1405.0, + 1969.0, + 1405.0, + 2016.0, + 289.0, + 2016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2001.0, + 772.0, + 2001.0, + 772.0, + 2044.0, + 323.0, + 2044.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "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, + 866, + 2088, + 866, + 2113, + 836, + 2113 + ], + "score": 0.838 + }, + { + "category_id": 1, + "poly": [ + 296, + 754, + 1401, + 754, + 1401, + 819, + 296, + 819 + ], + "score": 0.626 + }, + { + "category_id": 1, + "poly": [ + 295, + 671, + 1401, + 671, + 1401, + 737, + 295, + 737 + ], + "score": 0.625 + }, + { + "category_id": 1, + "poly": [ + 297, + 589, + 1403, + 589, + 1403, + 654, + 297, + 654 + ], + "score": 0.62 + }, + { + "category_id": 1, + "poly": [ + 297, + 1392, + 1398, + 1392, + 1398, + 1459, + 297, + 1459 + ], + "score": 0.601 + }, + { + "category_id": 1, + "poly": [ + 301, + 919, + 1400, + 919, + 1400, + 1016, + 301, + 1016 + ], + "score": 0.6 + }, + { + "category_id": 1, + "poly": [ + 296, + 1557, + 1399, + 1557, + 1399, + 1624, + 296, + 1624 + ], + "score": 0.59 + }, + { + "category_id": 1, + "poly": [ + 293, + 228, + 1400, + 228, + 1400, + 295, + 293, + 295 + ], + "score": 0.589 + }, + { + "category_id": 1, + "poly": [ + 302, + 476, + 1401, + 476, + 1401, + 570, + 302, + 570 + ], + "score": 0.585 + }, + { + "category_id": 1, + "poly": [ + 294, + 1971, + 1404, + 1971, + 1404, + 2034, + 294, + 2034 + ], + "score": 0.582 + }, + { + "category_id": 1, + "poly": [ + 298, + 1722, + 1398, + 1722, + 1398, + 1789, + 298, + 1789 + ], + "score": 0.578 + }, + { + "category_id": 1, + "poly": [ + 294, + 1475, + 1395, + 1475, + 1395, + 1541, + 294, + 1541 + ], + "score": 0.577 + }, + { + "category_id": 1, + "poly": [ + 297, + 1310, + 1397, + 1310, + 1397, + 1375, + 297, + 1375 + ], + "score": 0.576 + }, + { + "category_id": 1, + "poly": [ + 297, + 1640, + 1400, + 1640, + 1400, + 1706, + 297, + 1706 + ], + "score": 0.574 + }, + { + "category_id": 1, + "poly": [ + 298, + 1145, + 1400, + 1145, + 1400, + 1210, + 298, + 1210 + ], + "score": 0.571 + }, + { + "category_id": 1, + "poly": [ + 295, + 837, + 1401, + 837, + 1401, + 903, + 295, + 903 + ], + "score": 0.571 + }, + { + "category_id": 1, + "poly": [ + 300, + 311, + 1399, + 311, + 1399, + 377, + 300, + 377 + ], + "score": 0.566 + }, + { + "category_id": 1, + "poly": [ + 302, + 1032, + 1400, + 1032, + 1400, + 1129, + 302, + 1129 + ], + "score": 0.562 + }, + { + "category_id": 1, + "poly": [ + 298, + 1889, + 1398, + 1889, + 1398, + 1953, + 298, + 1953 + ], + "score": 0.556 + }, + { + "category_id": 1, + "poly": [ + 299, + 393, + 1398, + 393, + 1398, + 460, + 299, + 460 + ], + "score": 0.548 + }, + { + "category_id": 1, + "poly": [ + 296, + 1227, + 1398, + 1227, + 1398, + 1294, + 296, + 1294 + ], + "score": 0.548 + }, + { + "category_id": 1, + "poly": [ + 299, + 1806, + 1398, + 1806, + 1398, + 1870, + 299, + 1870 + ], + "score": 0.545 + }, + { + "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": [ + 295.0, + 754.0, + 1405.0, + 754.0, + 1405.0, + 790.0, + 295.0, + 790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 787.0, + 456.0, + 787.0, + 456.0, + 819.0, + 320.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 669.0, + 1403.0, + 669.0, + 1403.0, + 712.0, + 294.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 705.0, + 1403.0, + 705.0, + 1403.0, + 738.0, + 325.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 588.0, + 1405.0, + 588.0, + 1405.0, + 627.0, + 294.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 622.0, + 707.0, + 622.0, + 707.0, + 655.0, + 320.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1385.0, + 1406.0, + 1385.0, + 1406.0, + 1436.0, + 291.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1424.0, + 1021.0, + 1424.0, + 1021.0, + 1459.0, + 322.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 918.0, + 1403.0, + 918.0, + 1403.0, + 958.0, + 293.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 948.0, + 1404.0, + 948.0, + 1404.0, + 991.0, + 320.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 982.0, + 989.0, + 982.0, + 989.0, + 1017.0, + 323.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1555.0, + 1405.0, + 1555.0, + 1405.0, + 1597.0, + 294.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1591.0, + 1301.0, + 1591.0, + 1301.0, + 1624.0, + 321.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1402.0, + 229.0, + 1402.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 262.0, + 1183.0, + 262.0, + 1183.0, + 295.0, + 321.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 474.0, + 1402.0, + 474.0, + 1402.0, + 516.0, + 295.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 508.0, + 1404.0, + 508.0, + 1404.0, + 542.0, + 321.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 536.0, + 398.0, + 536.0, + 398.0, + 573.0, + 319.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1967.0, + 1404.0, + 1967.0, + 1404.0, + 2010.0, + 293.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 2003.0, + 546.0, + 2003.0, + 546.0, + 2034.0, + 319.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1722.0, + 1402.0, + 1722.0, + 1402.0, + 1761.0, + 294.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1754.0, + 1075.0, + 1754.0, + 1075.0, + 1789.0, + 323.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1476.0, + 1401.0, + 1476.0, + 1401.0, + 1512.0, + 295.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1508.0, + 1222.0, + 1508.0, + 1222.0, + 1540.0, + 323.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1312.0, + 1400.0, + 1312.0, + 1400.0, + 1348.0, + 294.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1344.0, + 774.0, + 1344.0, + 774.0, + 1373.0, + 323.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1637.0, + 1405.0, + 1637.0, + 1405.0, + 1682.0, + 292.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1672.0, + 1396.0, + 1672.0, + 1396.0, + 1708.0, + 321.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1144.0, + 1404.0, + 1144.0, + 1404.0, + 1183.0, + 293.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1178.0, + 707.0, + 1178.0, + 707.0, + 1210.0, + 319.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 838.0, + 1405.0, + 838.0, + 1405.0, + 874.0, + 295.0, + 874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 870.0, + 1147.0, + 870.0, + 1147.0, + 902.0, + 324.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 309.0, + 1403.0, + 309.0, + 1403.0, + 352.0, + 292.0, + 352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 341.0, + 516.0, + 341.0, + 516.0, + 379.0, + 322.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1031.0, + 1405.0, + 1031.0, + 1405.0, + 1071.0, + 294.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1064.0, + 1404.0, + 1064.0, + 1404.0, + 1099.0, + 323.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1095.0, + 977.0, + 1095.0, + 977.0, + 1131.0, + 322.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1884.0, + 1404.0, + 1884.0, + 1404.0, + 1927.0, + 293.0, + 1927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1916.0, + 399.0, + 1916.0, + 399.0, + 1954.0, + 319.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 390.0, + 1403.0, + 390.0, + 1403.0, + 433.0, + 292.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 425.0, + 1234.0, + 425.0, + 1234.0, + 460.0, + 323.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1229.0, + 1402.0, + 1229.0, + 1402.0, + 1262.0, + 296.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1259.0, + 1148.0, + 1259.0, + 1148.0, + 1296.0, + 324.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1806.0, + 1403.0, + 1806.0, + 1403.0, + 1842.0, + 295.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1838.0, + 817.0, + 1838.0, + 817.0, + 1871.0, + 323.0, + 1871.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 229, + 1399, + 229, + 1399, + 323, + 297, + 323 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.88 + }, + { + "category_id": 1, + "poly": [ + 296, + 871, + 1401, + 871, + 1401, + 936, + 296, + 936 + ], + "score": 0.867 + }, + { + "category_id": 1, + "poly": [ + 298, + 343, + 1400, + 343, + 1400, + 435, + 298, + 435 + ], + "score": 0.842 + }, + { + "category_id": 1, + "poly": [ + 298, + 788, + 1400, + 788, + 1400, + 852, + 298, + 852 + ], + "score": 0.84 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2112, + 836, + 2112 + ], + "score": 0.832 + }, + { + "category_id": 1, + "poly": [ + 299, + 705, + 1398, + 705, + 1398, + 770, + 299, + 770 + ], + "score": 0.798 + }, + { + "category_id": 1, + "poly": [ + 299, + 622, + 1400, + 622, + 1400, + 686, + 299, + 686 + ], + "score": 0.788 + }, + { + "category_id": 1, + "poly": [ + 298, + 539, + 1399, + 539, + 1399, + 602, + 298, + 602 + ], + "score": 0.762 + }, + { + "category_id": 1, + "poly": [ + 291, + 456, + 1401, + 456, + 1401, + 519, + 291, + 519 + ], + "score": 0.752 + }, + { + "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, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 226.0, + 1403.0, + 226.0, + 1403.0, + 268.0, + 293.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 261.0, + 1404.0, + 261.0, + 1404.0, + 295.0, + 321.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 292.0, + 596.0, + 292.0, + 596.0, + 325.0, + 321.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 871.0, + 1405.0, + 871.0, + 1405.0, + 907.0, + 295.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 902.0, + 1275.0, + 902.0, + 1275.0, + 937.0, + 323.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 339.0, + 1405.0, + 339.0, + 1405.0, + 381.0, + 292.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 372.0, + 1404.0, + 372.0, + 1404.0, + 408.0, + 321.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 401.0, + 401.0, + 401.0, + 401.0, + 437.0, + 321.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 785.0, + 1405.0, + 785.0, + 1405.0, + 825.0, + 293.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 816.0, + 398.0, + 816.0, + 398.0, + 855.0, + 319.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 703.0, + 1403.0, + 703.0, + 1403.0, + 743.0, + 294.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 736.0, + 918.0, + 736.0, + 918.0, + 771.0, + 323.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 617.0, + 1404.0, + 617.0, + 1404.0, + 663.0, + 293.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 653.0, + 911.0, + 653.0, + 911.0, + 686.0, + 323.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 537.0, + 1404.0, + 537.0, + 1404.0, + 576.0, + 293.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 569.0, + 901.0, + 569.0, + 901.0, + 604.0, + 323.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 454.0, + 1403.0, + 454.0, + 1403.0, + 490.0, + 295.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 486.0, + 1399.0, + 486.0, + 1399.0, + 521.0, + 323.0, + 521.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 365, + 780, + 1263, + 780, + 1263, + 1011, + 365, + 1011 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 368, + 1832, + 1277, + 1832, + 1277, + 1946, + 368, + 1946 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 350, + 1405, + 350, + 1405, + 444, + 297, + 444 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 698, + 1237, + 1100, + 1237, + 1100, + 1365, + 698, + 1365 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 301, + 494, + 1400, + 494, + 1400, + 660, + 301, + 660 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 292, + 1029, + 1403, + 1029, + 1403, + 1093, + 292, + 1093 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 724, + 1402, + 1074, + 1402, + 1074, + 1483, + 724, + 1483 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 300, + 728, + 685, + 728, + 685, + 762, + 300, + 762 + ], + "score": 0.933 + }, + { + "category_id": 8, + "poly": [ + 743, + 1098, + 953, + 1098, + 953, + 1132, + 743, + 1132 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 299, + 1780, + 684, + 1780, + 684, + 1814, + 299, + 1814 + ], + "score": 0.931 + }, + { + "category_id": 8, + "poly": [ + 493, + 1578, + 1207, + 1578, + 1207, + 1712, + 493, + 1712 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 300, + 1151, + 777, + 1151, + 777, + 1184, + 300, + 1184 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 369, + 1371, + 620, + 1371, + 620, + 1402, + 369, + 1402 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 370, + 1204, + 686, + 1204, + 686, + 1235, + 370, + 1235 + ], + "score": 0.916 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 816, + 74, + 816, + 106, + 299, + 106 + ], + "score": 0.915 + }, + { + "category_id": 0, + "poly": [ + 299, + 1727, + 569, + 1727, + 569, + 1759, + 299, + 1759 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 387, + 1488, + 1361, + 1488, + 1361, + 1523, + 387, + 1523 + ], + "score": 0.909 + }, + { + "category_id": 0, + "poly": [ + 299, + 674, + 521, + 674, + 521, + 706, + 299, + 706 + ], + "score": 0.899 + }, + { + "category_id": 8, + "poly": [ + 608, + 2003, + 1093, + 2003, + 1093, + 2040, + 608, + 2040 + ], + "score": 0.898 + }, + { + "category_id": 1, + "poly": [ + 294, + 1963, + 1342, + 1963, + 1342, + 1999, + 294, + 1999 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.865 + }, + { + "category_id": 1, + "poly": [ + 300, + 457, + 831, + 457, + 831, + 491, + 300, + 491 + ], + "score": 0.86 + }, + { + "category_id": 0, + "poly": [ + 300, + 227, + 450, + 227, + 450, + 262, + 300, + 262 + ], + "score": 0.821 + }, + { + "category_id": 1, + "poly": [ + 297, + 1542, + 755, + 1542, + 755, + 1574, + 297, + 1574 + ], + "score": 0.802 + }, + { + "category_id": 1, + "poly": [ + 300, + 293, + 669, + 293, + 669, + 326, + 300, + 326 + ], + "score": 0.516 + }, + { + "category_id": 0, + "poly": [ + 300, + 293, + 669, + 293, + 669, + 326, + 300, + 326 + ], + "score": 0.459 + }, + { + "category_id": 13, + "poly": [ + 1216, + 1058, + 1392, + 1058, + 1392, + 1091, + 1216, + 1091 + ], + "score": 0.94, + "latex": "W _ { \\mathrm { E m b } } ^ { \\mathbf { \\Upsilon } ^ { \\bullet } } \\in \\mathbb { R } ^ { K \\times E }" + }, + { + "category_id": 13, + "poly": [ + 847, + 1488, + 908, + 1488, + 908, + 1522, + 847, + 1522 + ], + "score": 0.91, + "latex": "[ \\cdot | | _ { k } \\cdot ]" + }, + { + "category_id": 14, + "poly": [ + 490, + 1575, + 1207, + 1575, + 1207, + 1713, + 490, + 1713 + ], + "score": 0.9, + "latex": "\\begin{array} { r l } & { \\phantom { \\frac { 1 } { 2 } } a ( x ) = \\mathrm { C o n v L a y e r } _ { 4 \\cdot f c } ( \\mathrm { C o n v L a y e r } _ { 2 \\cdot f c , f s } ( \\mathrm { C o n v L a y e r } _ { f c } ( x ) ) ) } \\\\ & { \\phantom { \\frac { 1 } { 2 } } b ( x ) = \\mathrm { R e s B l o c k } _ { 4 \\cdot f c } ^ { ( 5 ) } ( x ) } \\\\ & { \\circ \\mathrm { u t } ( t ) = \\mathrm { S o f t m a x } ( \\mathrm { C o n v L a y e r } _ { v s } ( b ( a ( t ) ) ) ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 478, + 1489, + 543, + 1489, + 543, + 1520, + 478, + 1520 + ], + "score": 0.9, + "latex": "W _ { \\mathrm { t i m e } }" + }, + { + "category_id": 13, + "poly": [ + 396, + 1835, + 494, + 1835, + 494, + 1867, + 396, + 1867 + ], + "score": 0.9, + "latex": "f c = 3 2" + }, + { + "category_id": 13, + "poly": [ + 396, + 782, + 494, + 782, + 494, + 815, + 396, + 815 + ], + "score": 0.9, + "latex": "f c = 3 2" + }, + { + "category_id": 13, + "poly": [ + 396, + 938, + 501, + 938, + 501, + 968, + 396, + 968 + ], + "score": 0.89, + "latex": "E = 1 0 0" + }, + { + "category_id": 14, + "poly": [ + 320, + 491, + 1407, + 491, + 1407, + 663, + 320, + 663 + ], + "score": 0.89, + "latex": "\\begin{array} { r l } & { \\mathrm { \\mathrm { ~ 5 o n v L a y e r } } _ { f _ { c , f s = 1 , s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( C o n v 1 D _ { f c , f s } ( x ) ) ) } \\\\ & { \\qquad \\mathrm { R e s B l o c k } _ { f _ { c , f s = 1 } } ( x ) = R e L U ( L a y e r N o r m ( x + C o n v 1 D _ { f c , f s } ( C o n v 1 D _ { f c , f s } ( x ) ) ) ) } \\\\ & { \\mathrm { C o n v S t a c k } _ { n , f c , f s = 1 } ( x ) = } \\\\ & { \\qquad \\mathrm { C o n v L a y e r } _ { 1 , f s } \\circ \\mathrm { C o n v L a y e r } _ { 2 ^ { 1 } \\cdot f c , f s , 2 } \\circ \\cdot \\cdot \\circ \\mathrm { C o n v L a y e r } _ { 2 ^ { n } \\cdot f c , f s , 2 } \\circ \\mathrm { C o n v L a y e r } _ { f c , f s , 2 } ( x ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 723, + 1399, + 1075, + 1399, + 1075, + 1483, + 723, + 1483 + ], + "score": 0.89, + "latex": "\\begin{array} { r l } & { W _ { \\mathrm { t i m e } } \\in \\mathbb { R } ^ { N \\times T } } \\\\ & { t = \\mathsf { t i m i n g } ( x ) = [ x \\| _ { 2 } W _ { \\mathrm { t i m e } } ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 396, + 901, + 464, + 901, + 464, + 928, + 396, + 928 + ], + "score": 0.89, + "latex": "s = 1" + }, + { + "category_id": 13, + "poly": [ + 1273, + 1487, + 1308, + 1487, + 1308, + 1516, + 1273, + 1516 + ], + "score": 0.88, + "latex": "k ^ { \\mathrm { { t h } } }" + }, + { + "category_id": 13, + "poly": [ + 396, + 1873, + 495, + 1873, + 495, + 1906, + 396, + 1906 + ], + "score": 0.88, + "latex": "f s = 1 5" + }, + { + "category_id": 13, + "poly": [ + 396, + 977, + 499, + 977, + 499, + 1006, + 396, + 1006 + ], + "score": 0.88, + "latex": "T = 1 0 0" + }, + { + "category_id": 13, + "poly": [ + 396, + 821, + 480, + 821, + 480, + 854, + 396, + 854 + ], + "score": 0.88, + "latex": "f s = 1" + }, + { + "category_id": 13, + "poly": [ + 396, + 1913, + 468, + 1913, + 468, + 1941, + 396, + 1941 + ], + "score": 0.87, + "latex": "n = 5" + }, + { + "category_id": 13, + "poly": [ + 396, + 862, + 478, + 862, + 478, + 889, + 396, + 889 + ], + "score": 0.87, + "latex": "v s = 1" + }, + { + "category_id": 13, + "poly": [ + 917, + 383, + 946, + 383, + 946, + 409, + 917, + 409 + ], + "score": 0.83, + "latex": "K" + }, + { + "category_id": 14, + "poly": [ + 603, + 2000, + 1093, + 2000, + 1093, + 2039, + 603, + 2039 + ], + "score": 0.82, + "latex": "\\mathsf { o u t } ( t ) = \\mathbf { C o n v S t a c k } _ { n , f c , f s } ( \\mathsf { d r o p o u t } _ { 0 . 5 } ( t ) )" + }, + { + "category_id": 13, + "poly": [ + 512, + 383, + 541, + 383, + 541, + 409, + 512, + 409 + ], + "score": 0.82, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1305, + 383, + 1333, + 383, + 1333, + 409, + 1305, + 409 + ], + "score": 0.82, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1372, + 382, + 1401, + 382, + 1401, + 409, + 1372, + 409 + ], + "score": 0.81, + "latex": "K" + }, + { + "category_id": 14, + "poly": [ + 744, + 1097, + 954, + 1097, + 954, + 1130, + 744, + 1130 + ], + "score": 0.81, + "latex": "x = \\mathrm { d a t a } \\cdot W _ { \\mathrm { E m b } }" + }, + { + "category_id": 14, + "poly": [ + 701, + 1234, + 1100, + 1234, + 1100, + 1367, + 701, + 1367 + ], + "score": 0.68, + "latex": "\\begin{array} { c } { { \\mathrm { s i g n a l } _ { n , 2 k } = \\sin ( n / 1 e 5 ^ { 2 k / K } ) } } \\\\ { { \\mathrm { s i g n a l } _ { n , 2 k + 1 } = \\cos ( n / 1 e 5 ^ { 2 k / K } ) } } \\\\ { { \\mathrm { t i m i n g } ( x ) = x + \\mathrm { s i g n a l } } } \\end{array}" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 817.0, + 72.0, + 817.0, + 109.0, + 295.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1727.0, + 571.0, + 1727.0, + 571.0, + 1763.0, + 296.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 673.0, + 525.0, + 673.0, + 525.0, + 710.0, + 295.0, + 710.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": [ + 295.0, + 223.0, + 454.0, + 223.0, + 454.0, + 270.0, + 295.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 295.0, + 668.0, + 295.0, + 668.0, + 328.0, + 296.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 782.0, + 395.0, + 782.0, + 395.0, + 817.0, + 368.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 782.0, + 1235.0, + 782.0, + 1235.0, + 817.0, + 495.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 819.0, + 395.0, + 819.0, + 395.0, + 856.0, + 367.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 481.0, + 819.0, + 1261.0, + 819.0, + 1261.0, + 856.0, + 481.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 858.0, + 395.0, + 858.0, + 395.0, + 896.0, + 366.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 858.0, + 1140.0, + 858.0, + 1140.0, + 896.0, + 479.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 901.0, + 395.0, + 901.0, + 395.0, + 933.0, + 369.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 901.0, + 876.0, + 901.0, + 876.0, + 933.0, + 465.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 936.0, + 395.0, + 936.0, + 395.0, + 974.0, + 367.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 936.0, + 1022.0, + 936.0, + 1022.0, + 974.0, + 502.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 974.0, + 395.0, + 974.0, + 395.0, + 1013.0, + 367.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 974.0, + 1054.0, + 974.0, + 1054.0, + 1013.0, + 500.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1832.0, + 395.0, + 1832.0, + 395.0, + 1870.0, + 367.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 1832.0, + 1236.0, + 1832.0, + 1236.0, + 1870.0, + 495.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1871.0, + 395.0, + 1871.0, + 395.0, + 1908.0, + 367.0, + 1908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 496.0, + 1871.0, + 1276.0, + 1871.0, + 1276.0, + 1908.0, + 496.0, + 1908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 1912.0, + 395.0, + 1912.0, + 395.0, + 1945.0, + 366.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1912.0, + 892.0, + 1912.0, + 892.0, + 1945.0, + 469.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 351.0, + 1405.0, + 351.0, + 1405.0, + 382.0, + 294.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 381.0, + 511.0, + 381.0, + 511.0, + 415.0, + 295.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 381.0, + 916.0, + 381.0, + 916.0, + 415.0, + 542.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 381.0, + 1304.0, + 381.0, + 1304.0, + 415.0, + 947.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 381.0, + 1371.0, + 381.0, + 1371.0, + 415.0, + 1334.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 413.0, + 384.0, + 413.0, + 384.0, + 444.0, + 292.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 490.0, + 319.0, + 490.0, + 319.0, + 539.0, + 300.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1025.0, + 1406.0, + 1025.0, + 1406.0, + 1067.0, + 293.0, + 1067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1057.0, + 1215.0, + 1057.0, + 1215.0, + 1096.0, + 290.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1057.0, + 1409.0, + 1057.0, + 1409.0, + 1096.0, + 1393.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 725.0, + 687.0, + 725.0, + 687.0, + 765.0, + 297.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1777.0, + 687.0, + 1777.0, + 687.0, + 1817.0, + 296.0, + 1817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1147.0, + 779.0, + 1147.0, + 779.0, + 1188.0, + 294.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1369.0, + 622.0, + 1369.0, + 622.0, + 1405.0, + 368.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1200.0, + 688.0, + 1200.0, + 688.0, + 1238.0, + 367.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1483.0, + 477.0, + 1483.0, + 477.0, + 1526.0, + 393.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 1483.0, + 846.0, + 1483.0, + 846.0, + 1526.0, + 544.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 1483.0, + 1272.0, + 1483.0, + 1272.0, + 1526.0, + 909.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1309.0, + 1483.0, + 1366.0, + 1483.0, + 1366.0, + 1526.0, + 1309.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1963.0, + 1344.0, + 1963.0, + 1344.0, + 2001.0, + 294.0, + 2001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 453.0, + 834.0, + 453.0, + 834.0, + 498.0, + 292.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1542.0, + 755.0, + 1542.0, + 755.0, + 1577.0, + 295.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 295.0, + 668.0, + 295.0, + 668.0, + 328.0, + 296.0, + 328.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1941, + 1402, + 1941, + 1402, + 2036, + 299, + 2036 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1572, + 1404, + 1572, + 1404, + 1666, + 297, + 1666 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 1372, + 1405, + 1372, + 1405, + 1461, + 297, + 1461 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 300, + 838, + 1406, + 838, + 1406, + 934, + 300, + 934 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 639, + 1464, + 1059, + 1464, + 1059, + 1541, + 639, + 1541 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 752, + 1868, + 945, + 1868, + 945, + 1933, + 752, + 1933 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 566, + 1724, + 1134, + 1724, + 1134, + 1797, + 566, + 1797 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 650, + 1318, + 1048, + 1318, + 1048, + 1363, + 650, + 1363 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 293, + 1193, + 1405, + 1193, + 1405, + 1256, + 293, + 1256 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 288, + 1823, + 1362, + 1823, + 1362, + 1859, + 288, + 1859 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 300, + 1680, + 709, + 1680, + 709, + 1712, + 300, + 1712 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 297, + 1294, + 446, + 1294, + 446, + 1327, + 297, + 1327 + ], + "score": 0.908 + }, + { + "category_id": 1, + "poly": [ + 300, + 790, + 1250, + 790, + 1250, + 825, + 300, + 825 + ], + "score": 0.906 + }, + { + "category_id": 8, + "poly": [ + 494, + 1255, + 1201, + 1255, + 1201, + 1292, + 494, + 1292 + ], + "score": 0.904 + }, + { + "category_id": 1, + "poly": [ + 369, + 355, + 1147, + 355, + 1147, + 548, + 369, + 548 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.899 + }, + { + "category_id": 1, + "poly": [ + 297, + 569, + 1408, + 569, + 1408, + 761, + 297, + 761 + ], + "score": 0.882 + }, + { + "category_id": 1, + "poly": [ + 300, + 286, + 848, + 286, + 848, + 319, + 300, + 319 + ], + "score": 0.878 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.875 + }, + { + "category_id": 1, + "poly": [ + 296, + 948, + 346, + 948, + 346, + 978, + 296, + 978 + ], + "score": 0.868 + }, + { + "category_id": 1, + "poly": [ + 368, + 1004, + 1396, + 1004, + 1396, + 1166, + 368, + 1166 + ], + "score": 0.779 + }, + { + "category_id": 1, + "poly": [ + 303, + 322, + 382, + 322, + 382, + 348, + 303, + 348 + ], + "score": 0.737 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 656, + 229, + 656, + 262, + 299, + 262 + ], + "score": 0.659 + }, + { + "category_id": 0, + "poly": [ + 299, + 229, + 656, + 229, + 656, + 262, + 299, + 262 + ], + "score": 0.292 + }, + { + "category_id": 14, + "poly": [ + 753, + 1866, + 947, + 1866, + 947, + 1933, + 753, + 1933 + ], + "score": 0.94, + "latex": "D _ { \\mathcal { X } } = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + p _ { G } }" + }, + { + "category_id": 13, + "poly": [ + 360, + 2001, + 550, + 2001, + 550, + 2038, + 360, + 2038 + ], + "score": 0.94, + "latex": "D _ { \\overline { { \\mathcal { X } } } } : \\overline { { \\mathcal { X } } } [ 0 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 1095, + 1826, + 1285, + 1826, + 1285, + 1859, + 1095, + 1859 + ], + "score": 0.93, + "latex": "D _ { \\mathcal { X } } : \\mathcal { X } [ 0 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 795, + 1256, + 930, + 1256, + 930, + 1290, + 795, + 1290 + ], + "score": 0.93, + "latex": "R _ { { \\mathcal { X } } } ( { \\bar { x } } ) = x" + }, + { + "category_id": 13, + "poly": [ + 1106, + 726, + 1184, + 726, + 1184, + 760, + 1106, + 760 + ], + "score": 0.92, + "latex": "D _ { \\mathcal { Y } } ( y )" + }, + { + "category_id": 13, + "poly": [ + 536, + 1575, + 617, + 1575, + 617, + 1602, + 536, + 1602 + ], + "score": 0.92, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 970, + 726, + 1052, + 726, + 1052, + 760, + 970, + 760 + ], + "score": 0.92, + "latex": "D _ { \\mathcal { X } } ( x )" + }, + { + "category_id": 13, + "poly": [ + 1013, + 1941, + 1288, + 1941, + 1288, + 1980, + 1013, + 1980 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { p _ { \\mathcal { X } } ( x ) = \\sum _ { x _ { i } \\in \\mathcal { X } } \\delta _ { x _ { i } } ( x ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 566, + 1721, + 1133, + 1721, + 1133, + 1798, + 566, + 1798 + ], + "score": 0.91, + "latex": "\\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal { X } } ( x ) \\log ( D _ { \\mathcal { X } } ( x ) ) + p _ { F } ( x ) \\log ( 1 - D _ { \\mathcal { X } } ( x ) )" + }, + { + "category_id": 14, + "poly": [ + 649, + 1318, + 1049, + 1318, + 1049, + 1363, + 649, + 1363 + ], + "score": 0.91, + "latex": "S _ { x } = R _ { \\chi } ^ { - 1 } ( x ) \\cap F ^ { - 1 } ( R _ { \\ y } ^ { - 1 } ( F ( x ) ) )" + }, + { + "category_id": 14, + "poly": [ + 639, + 1459, + 1060, + 1459, + 1060, + 1540, + 639, + 1540 + ], + "score": 0.91, + "latex": "0 < \\epsilon < \\operatorname* { m i n } _ { \\substack { z \\in \\overline { { \\mathcal X } } } } d _ { \\mathcal X } ( x , z )" + }, + { + "category_id": 13, + "poly": [ + 943, + 1635, + 1028, + 1635, + 1028, + 1665, + 943, + 1665 + ], + "score": 0.91, + "latex": "\\bar { x } \\sim S _ { x }" + }, + { + "category_id": 13, + "poly": [ + 659, + 464, + 757, + 464, + 757, + 495, + 659, + 495 + ], + "score": 0.91, + "latex": "D _ { \\mathcal { X } } , D _ { \\mathcal { Y } }" + }, + { + "category_id": 13, + "poly": [ + 523, + 406, + 803, + 406, + 803, + 443, + 523, + 443 + ], + "score": 0.91, + "latex": "F : \\overline { { \\mathcal { X } } } \\overline { { \\mathcal { V } } } , G : \\overline { { \\mathcal { V } } } \\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 1280, + 1403, + 1345, + 1403, + 1345, + 1436, + 1280, + 1436 + ], + "score": 0.91, + "latex": "B _ { \\epsilon } [ x ]" + }, + { + "category_id": 13, + "poly": [ + 676, + 603, + 747, + 603, + 747, + 634, + 676, + 634 + ], + "score": 0.91, + "latex": "y \\in \\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 763, + 694, + 810, + 694, + 810, + 727, + 763, + 727 + ], + "score": 0.91, + "latex": "D _ { \\overline { { \\mathcal { X } } } }" + }, + { + "category_id": 13, + "poly": [ + 862, + 694, + 907, + 694, + 907, + 730, + 862, + 730 + ], + "score": 0.9, + "latex": "D _ { \\overline { { { y } } } }" + }, + { + "category_id": 13, + "poly": [ + 702, + 1635, + 778, + 1635, + 778, + 1662, + 702, + 1662 + ], + "score": 0.9, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 468, + 1197, + 556, + 1197, + 556, + 1224, + 468, + 1224 + ], + "score": 0.9, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 764, + 906, + 845, + 906, + 845, + 933, + 764, + 933 + ], + "score": 0.9, + "latex": "p _ { \\mathscr { X } } , p _ { \\mathscr { Y } }" + }, + { + "category_id": 13, + "poly": [ + 838, + 1197, + 871, + 1197, + 871, + 1226, + 838, + 1226 + ], + "score": 0.89, + "latex": "S _ { x }" + }, + { + "category_id": 13, + "poly": [ + 685, + 515, + 779, + 515, + 779, + 547, + 685, + 547 + ], + "score": 0.89, + "latex": "R _ { \\mathcal { X } } , R _ { \\mathcal { Y } }" + }, + { + "category_id": 13, + "poly": [ + 497, + 1605, + 531, + 1605, + 531, + 1634, + 497, + 1634 + ], + "score": 0.89, + "latex": "S _ { x }" + }, + { + "category_id": 13, + "poly": [ + 781, + 2005, + 825, + 2005, + 825, + 2034, + 781, + 2034 + ], + "score": 0.89, + "latex": "D _ { \\mathcal { X } }" + }, + { + "category_id": 13, + "poly": [ + 372, + 1374, + 405, + 1374, + 405, + 1403, + 372, + 1403 + ], + "score": 0.89, + "latex": "S _ { x }" + }, + { + "category_id": 13, + "poly": [ + 346, + 727, + 419, + 727, + 419, + 759, + 346, + 759 + ], + "score": 0.88, + "latex": "y \\in \\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 572, + 359, + 632, + 359, + 632, + 390, + 572, + 390 + ], + "score": 0.88, + "latex": "\\mathcal { X } , \\mathcal { y }" + }, + { + "category_id": 13, + "poly": [ + 1158, + 572, + 1233, + 572, + 1233, + 599, + 1158, + 599 + ], + "score": 0.88, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 1105, + 835, + 1394, + 835, + 1394, + 874, + 1105, + 874 + ], + "score": 0.88, + "latex": "F : ( \\overline { { \\mathcal { X } } } , d _ { \\overline { { \\mathcal { X } } } } ) ( \\overline { { \\mathcal { V } } } , d _ { \\overline { { \\mathcal { V } } } } )" + }, + { + "category_id": 13, + "poly": [ + 981, + 1255, + 1199, + 1255, + 1199, + 1290, + 981, + 1290 + ], + "score": 0.88, + "latex": "R y ( F ( { \\bar { x } } ) ) = F ( x )" + }, + { + "category_id": 13, + "poly": [ + 1322, + 693, + 1401, + 693, + 1401, + 721, + 1322, + 721 + ], + "score": 0.87, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1604, + 341, + 1604, + 341, + 1634, + 298, + 1634 + ], + "score": 0.87, + "latex": "R _ { \\mathcal { X } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 899, + 336, + 899, + 336, + 928, + 298, + 928 + ], + "score": 0.87, + "latex": "\\Delta ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 397, + 1133, + 438, + 1133, + 438, + 1165, + 397, + 1165 + ], + "score": 0.87, + "latex": "R _ { \\mathcal { Y } }" + }, + { + "category_id": 13, + "poly": [ + 1035, + 409, + 1147, + 409, + 1147, + 440, + 1035, + 440 + ], + "score": 0.86, + "latex": "F = G ^ { - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1008, + 463, + 1064, + 463, + 1064, + 494, + 1008, + 494 + ], + "score": 0.85, + "latex": "F , G" + }, + { + "category_id": 13, + "poly": [ + 1029, + 1571, + 1056, + 1571, + 1056, + 1601, + 1029, + 1601 + ], + "score": 0.85, + "latex": "\\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 499, + 1253, + 738, + 1253, + 738, + 1288, + 499, + 1288 + ], + "score": 0.85, + "latex": "\\bar { x } \\in S _ { x } \\iff \\bar { x } \\in \\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 564, + 1948, + 601, + 1948, + 601, + 1975, + 564, + 1975 + ], + "score": 0.84, + "latex": "p _ { \\mathcal { X } }" + }, + { + "category_id": 13, + "poly": [ + 451, + 871, + 477, + 871, + 477, + 900, + 451, + 900 + ], + "score": 0.84, + "latex": "\\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 670, + 1404, + 694, + 1404, + 694, + 1430, + 670, + 1430 + ], + "score": 0.84, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 866, + 1404, + 1147, + 1404, + 1147, + 1433, + 866, + 1433 + ], + "score": 0.84, + "latex": "x \\in \\mathcal { X } \\implies x \\in S _ { x } \\wedge \\exists" + }, + { + "category_id": 13, + "poly": [ + 373, + 871, + 400, + 871, + 400, + 897, + 373, + 897 + ], + "score": 0.83, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 977, + 841, + 1005, + 841, + 1005, + 867, + 977, + 867 + ], + "score": 0.82, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 442, + 1404, + 476, + 1404, + 476, + 1433, + 442, + 1433 + ], + "score": 0.82, + "latex": "S _ { x }" + }, + { + "category_id": 13, + "poly": [ + 751, + 1012, + 770, + 1012, + 770, + 1038, + 751, + 1038 + ], + "score": 0.82, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 368, + 663, + 393, + 663, + 393, + 690, + 368, + 690 + ], + "score": 0.81, + "latex": "\\overline { { \\mathcal { X } } }" + }, + { + "category_id": 13, + "poly": [ + 889, + 1100, + 1248, + 1100, + 1248, + 1136, + 889, + 1136 + ], + "score": 0.81, + "latex": "R _ { { \\mathcal K } } ( \\bar { x } ) = \\arg \\operatorname* { m i n } _ { x \\in { \\mathcal K } } d _ { \\overline { { { \\mathcal K } } } } ( \\bar { x } , x )" + }, + { + "category_id": 13, + "poly": [ + 993, + 633, + 1021, + 633, + 1021, + 659, + 993, + 659 + ], + "score": 0.77, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 388, + 1405, + 430, + 1405, + 430, + 1433, + 388, + 1433 + ], + "score": 0.76, + "latex": "R _ { \\mathcal { X } }" + }, + { + "category_id": 13, + "poly": [ + 408, + 574, + 432, + 574, + 432, + 598, + 408, + 598 + ], + "score": 0.76, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 387, + 1610, + 405, + 1610, + 405, + 1631, + 387, + 1631 + ], + "score": 0.74, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 395, + 1005, + 693, + 1005, + 693, + 1080, + 395, + 1080 + ], + "score": 0.73, + "latex": "\\overline { { \\mathcal { X } } } = \\overline { { \\mathcal { Y } } } = \\underbrace { \\Delta ^ { k } \\times \\cdots \\times \\Delta ^ { k } } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 518, + 603, + 542, + 603, + 542, + 629, + 518, + 629 + ], + "score": 0.71, + "latex": "G" + }, + { + "category_id": 13, + "poly": [ + 839, + 875, + 860, + 875, + 860, + 897, + 839, + 897 + ], + "score": 0.7, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 717, + 1098, + 876, + 1098, + 876, + 1132, + 717, + 1132 + ], + "score": 0.67, + "latex": "R _ { { \\mathcal { X } } } : { \\overline { { { \\mathcal { X } } } } } { \\mathcal { X } }" + }, + { + "category_id": 13, + "poly": [ + 396, + 1006, + 693, + 1006, + 693, + 1039, + 396, + 1039 + ], + "score": 0.59, + "latex": "\\overline { { \\mathcal { X } } } = \\overline { { \\mathcal { Y } } } = \\Delta ^ { k } \\times \\cdot \\cdot \\cdot \\times \\Delta ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 943, + 355, + 1004, + 355, + 1004, + 390, + 943, + 390 + ], + "score": 0.57, + "latex": "\\overline { { \\mathcal { X } } } , \\overline { { \\mathcal { V } } }" + }, + { + "category_id": 13, + "poly": [ + 1060, + 840, + 1084, + 840, + 1084, + 870, + 1060, + 870 + ], + "score": 0.54, + "latex": "\\mathcal { V }" + }, + { + "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, + 870.0, + 2085.0, + 870.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 658.0, + 228.0, + 658.0, + 264.0, + 294.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1936.0, + 563.0, + 1936.0, + 563.0, + 1986.0, + 290.0, + 1986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 1936.0, + 1012.0, + 1936.0, + 1012.0, + 1986.0, + 602.0, + 1986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 1936.0, + 1409.0, + 1936.0, + 1409.0, + 1986.0, + 1289.0, + 1986.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": [ + 297.0, + 2003.0, + 359.0, + 2003.0, + 359.0, + 2037.0, + 297.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 2003.0, + 780.0, + 2003.0, + 780.0, + 2037.0, + 551.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 2003.0, + 1188.0, + 2003.0, + 1188.0, + 2037.0, + 826.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1572.0, + 535.0, + 1572.0, + 535.0, + 1606.0, + 296.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1572.0, + 1028.0, + 1572.0, + 1028.0, + 1606.0, + 618.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 1572.0, + 1404.0, + 1572.0, + 1404.0, + 1606.0, + 1057.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 1600.0, + 386.0, + 1600.0, + 386.0, + 1641.0, + 342.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 1600.0, + 496.0, + 1600.0, + 496.0, + 1641.0, + 406.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 1600.0, + 1405.0, + 1600.0, + 1405.0, + 1641.0, + 532.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1632.0, + 701.0, + 1632.0, + 701.0, + 1670.0, + 292.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 779.0, + 1632.0, + 942.0, + 1632.0, + 942.0, + 1670.0, + 779.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 1632.0, + 1042.0, + 1632.0, + 1042.0, + 1670.0, + 1029.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1369.0, + 371.0, + 1369.0, + 371.0, + 1407.0, + 292.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 1369.0, + 1403.0, + 1369.0, + 1403.0, + 1407.0, + 406.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1401.0, + 387.0, + 1401.0, + 387.0, + 1438.0, + 294.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 1401.0, + 441.0, + 1401.0, + 441.0, + 1438.0, + 431.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 1401.0, + 669.0, + 1401.0, + 669.0, + 1438.0, + 477.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 1401.0, + 865.0, + 1401.0, + 865.0, + 1438.0, + 695.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 1401.0, + 1279.0, + 1401.0, + 1279.0, + 1438.0, + 1148.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 1401.0, + 1405.0, + 1401.0, + 1405.0, + 1438.0, + 1346.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1429.0, + 380.0, + 1429.0, + 380.0, + 1469.0, + 292.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 835.0, + 976.0, + 835.0, + 976.0, + 876.0, + 293.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 835.0, + 1059.0, + 835.0, + 1059.0, + 876.0, + 1006.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 835.0, + 1104.0, + 835.0, + 1104.0, + 876.0, + 1085.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 835.0, + 1404.0, + 835.0, + 1404.0, + 876.0, + 1395.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 868.0, + 372.0, + 868.0, + 372.0, + 904.0, + 294.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 868.0, + 450.0, + 868.0, + 450.0, + 904.0, + 401.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 868.0, + 838.0, + 868.0, + 838.0, + 904.0, + 478.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 868.0, + 1405.0, + 868.0, + 1405.0, + 904.0, + 861.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 896.0, + 297.0, + 896.0, + 297.0, + 938.0, + 294.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 896.0, + 763.0, + 896.0, + 763.0, + 938.0, + 337.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 896.0, + 994.0, + 896.0, + 994.0, + 938.0, + 846.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1191.0, + 467.0, + 1191.0, + 467.0, + 1230.0, + 294.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 1191.0, + 837.0, + 1191.0, + 837.0, + 1230.0, + 557.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1191.0, + 1405.0, + 1191.0, + 1405.0, + 1230.0, + 872.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1220.0, + 453.0, + 1220.0, + 453.0, + 1264.0, + 291.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1823.0, + 1094.0, + 1823.0, + 1094.0, + 1862.0, + 295.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 1823.0, + 1362.0, + 1823.0, + 1362.0, + 1862.0, + 1286.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1675.0, + 712.0, + 1675.0, + 712.0, + 1717.0, + 295.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1286.0, + 451.0, + 1286.0, + 451.0, + 1336.0, + 294.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 790.0, + 1252.0, + 790.0, + 1252.0, + 829.0, + 294.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 356.0, + 571.0, + 356.0, + 571.0, + 392.0, + 366.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 356.0, + 942.0, + 356.0, + 942.0, + 392.0, + 633.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 406.0, + 522.0, + 406.0, + 522.0, + 445.0, + 364.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 406.0, + 1034.0, + 406.0, + 1034.0, + 445.0, + 804.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 406.0, + 1151.0, + 406.0, + 1151.0, + 445.0, + 1148.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 459.0, + 658.0, + 459.0, + 658.0, + 498.0, + 367.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 459.0, + 1007.0, + 459.0, + 1007.0, + 498.0, + 758.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 510.0, + 684.0, + 510.0, + 684.0, + 552.0, + 368.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 570.0, + 407.0, + 570.0, + 407.0, + 606.0, + 295.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 433.0, + 570.0, + 1157.0, + 570.0, + 1157.0, + 606.0, + 433.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 570.0, + 1402.0, + 570.0, + 1402.0, + 606.0, + 1234.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 602.0, + 517.0, + 602.0, + 517.0, + 635.0, + 295.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 602.0, + 675.0, + 602.0, + 675.0, + 635.0, + 543.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 602.0, + 755.0, + 602.0, + 755.0, + 635.0, + 748.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 629.0, + 992.0, + 629.0, + 992.0, + 668.0, + 292.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 629.0, + 1406.0, + 629.0, + 1406.0, + 668.0, + 1022.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 660.0, + 367.0, + 660.0, + 367.0, + 699.0, + 291.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 660.0, + 832.0, + 660.0, + 832.0, + 699.0, + 394.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 690.0, + 762.0, + 690.0, + 762.0, + 730.0, + 294.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 690.0, + 861.0, + 690.0, + 861.0, + 730.0, + 811.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 690.0, + 1321.0, + 690.0, + 1321.0, + 730.0, + 908.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 690.0, + 1406.0, + 690.0, + 1406.0, + 730.0, + 1402.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 726.0, + 345.0, + 726.0, + 345.0, + 763.0, + 295.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 726.0, + 969.0, + 726.0, + 969.0, + 763.0, + 420.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 726.0, + 1105.0, + 726.0, + 1105.0, + 763.0, + 1053.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 726.0, + 1194.0, + 726.0, + 1194.0, + 763.0, + 1185.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 280.0, + 853.0, + 280.0, + 853.0, + 329.0, + 292.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 945.0, + 350.0, + 945.0, + 350.0, + 984.0, + 292.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 1002.0, + 394.0, + 1002.0, + 394.0, + 1050.0, + 364.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 694.0, + 1002.0, + 750.0, + 1002.0, + 750.0, + 1050.0, + 694.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1002.0, + 1343.0, + 1002.0, + 1343.0, + 1050.0, + 771.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 1094.0, + 716.0, + 1094.0, + 716.0, + 1140.0, + 363.0, + 1140.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 1094.0, + 888.0, + 1094.0, + 888.0, + 1140.0, + 877.0, + 1140.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1249.0, + 1094.0, + 1403.0, + 1094.0, + 1403.0, + 1140.0, + 1249.0, + 1140.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1123.0, + 396.0, + 1123.0, + 396.0, + 1175.0, + 388.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1123.0, + 457.0, + 1123.0, + 457.0, + 1175.0, + 439.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 316.0, + 388.0, + 316.0, + 388.0, + 353.0, + 302.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 658.0, + 228.0, + 658.0, + 264.0, + 294.0, + 264.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 315, + 1776, + 1384, + 1776, + 1384, + 1997, + 315, + 1997 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 479, + 1377, + 1219, + 1377, + 1219, + 1657, + 479, + 1657 + ], + "score": 0.968 + }, + { + "category_id": 8, + "poly": [ + 545, + 915, + 1154, + 915, + 1154, + 1163, + 545, + 1163 + ], + "score": 0.964 + }, + { + "category_id": 8, + "poly": [ + 587, + 470, + 1113, + 470, + 1113, + 696, + 587, + 696 + ], + "score": 0.963 + }, + { + "category_id": 8, + "poly": [ + 584, + 781, + 1114, + 781, + 1114, + 864, + 584, + 864 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 601, + 1251, + 1094, + 1251, + 1094, + 1328, + 601, + 1328 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 296, + 1730, + 683, + 1730, + 683, + 1764, + 296, + 1764 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 293, + 329, + 1367, + 329, + 1367, + 364, + 293, + 364 + ], + "score": 0.926 + }, + { + "category_id": 2, + "poly": [ + 297, + 73, + 816, + 73, + 816, + 106, + 297, + 106 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 297, + 1332, + 899, + 1332, + 899, + 1367, + 297, + 1367 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 704, + 228, + 704, + 264, + 298, + 264 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 298, + 870, + 534, + 870, + 534, + 904, + 298, + 904 + ], + "score": 0.914 + }, + { + "category_id": 8, + "poly": [ + 659, + 276, + 1038, + 276, + 1038, + 318, + 659, + 318 + ], + "score": 0.904 + }, + { + "category_id": 1, + "poly": [ + 297, + 375, + 706, + 375, + 706, + 413, + 297, + 413 + ], + "score": 0.894 + }, + { + "category_id": 1, + "poly": [ + 300, + 423, + 1007, + 423, + 1007, + 459, + 300, + 459 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.864 + }, + { + "category_id": 9, + "poly": [ + 1365, + 281, + 1401, + 281, + 1401, + 312, + 1365, + 312 + ], + "score": 0.86 + }, + { + "category_id": 9, + "poly": [ + 1364, + 1995, + 1402, + 1995, + 1402, + 2025, + 1364, + 2025 + ], + "score": 0.856 + }, + { + "category_id": 2, + "poly": [ + 1373, + 705, + 1405, + 705, + 1405, + 736, + 1373, + 736 + ], + "score": 0.832 + }, + { + "category_id": 2, + "poly": [ + 1373, + 1665, + 1404, + 1665, + 1404, + 1695, + 1373, + 1695 + ], + "score": 0.828 + }, + { + "category_id": 2, + "poly": [ + 1373, + 1173, + 1405, + 1173, + 1405, + 1205, + 1373, + 1205 + ], + "score": 0.824 + }, + { + "category_id": 1, + "poly": [ + 297, + 755, + 444, + 755, + 444, + 787, + 297, + 787 + ], + "score": 0.77 + }, + { + "category_id": 1, + "poly": [ + 297, + 1223, + 444, + 1223, + 444, + 1256, + 297, + 1256 + ], + "score": 0.596 + }, + { + "category_id": 0, + "poly": [ + 297, + 1223, + 444, + 1223, + 444, + 1256, + 297, + 1256 + ], + "score": 0.375 + }, + { + "category_id": 0, + "poly": [ + 297, + 755, + 444, + 755, + 444, + 787, + 297, + 787 + ], + "score": 0.161 + }, + { + "category_id": 14, + "poly": [ + 477, + 1379, + 1219, + 1379, + 1219, + 1660, + 477, + 1660 + ], + "score": 0.96, + "latex": "\\begin{array} { r l } & { \\displaystyle \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } d \\bar { x } \\le \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 } { | S _ { G ( y ) } | } d \\bar { x } \\le \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } d \\bar { x } } \\\\ & { \\qquad \\implies \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | \\le 1 \\le \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } | S _ { G ( y ) } | } \\\\ & { \\qquad \\implies ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | \\le | S _ { y } | \\le ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | } \\\\ & { \\qquad \\implies \\frac { 1 } { ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | } \\ge \\frac { 1 } { | S _ { y } | } \\ge \\frac { 1 } { ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 544, + 919, + 1154, + 919, + 1154, + 1166, + 544, + 1166 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } { \\displaystyle \\int _ { \\bar { x } \\sim S _ { G ( y ) } } \\frac { 1 } { \\vert S _ { G ( y ) } \\vert } d \\bar { x } = 1 = \\int _ { \\bar { y } \\sim S _ { y } } \\frac { 1 } { \\vert S _ { y } \\vert } d \\bar { y } } & { { } } \\\\ { = \\displaystyle \\int _ { \\bar { x } \\sim G ( S _ { y } ) } \\frac { \\vert \\nabla _ { \\bar { x } } G ^ { - 1 } ( \\bar { x } ) \\vert } { \\vert S _ { y } \\vert } d \\bar { x } } & { { } } \\\\ { = \\displaystyle \\int _ { \\bar { x } \\sim G ( S _ { y } ) } \\frac { \\vert \\nabla _ { \\bar { x } } F ( \\bar { x } ) \\vert } { \\vert S _ { y } \\vert } d \\bar { x } } & { { } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 585, + 469, + 1112, + 469, + 1112, + 698, + 585, + 698 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { G ( S _ { y } ) = G [ R _ { y } ^ { - 1 } ( y ) \\cap G ^ { - 1 } ( R _ { \\chi } ^ { - 1 } ( G ( y ) ) ) ] } \\\\ & { \\qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \\cap G ( G ^ { - 1 } ( R _ { \\chi } ^ { - 1 } ( G ( y ) ) ) ) } \\\\ & { \\qquad = G ( R _ { y } ^ { - 1 } ( y ) ) \\cap R _ { \\chi } ^ { - 1 } ( G ( y ) ) } \\\\ & { \\qquad = F ^ { - 1 } ( R _ { y } ^ { - 1 } ( F ( x ) ) ) \\cap R _ { \\chi } ^ { - 1 } ( x ) } \\\\ & { \\qquad = S _ { x } = S _ { G ( y ) } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 312, + 1773, + 1383, + 1773, + 1383, + 2003, + 312, + 2003 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathbb { E } _ { \\boldsymbol { x } \\in \\mathcal { X } } [ \\mathbb { E } _ { \\bar { \\boldsymbol { x } } \\in S _ { \\boldsymbol { x } } } [ \\mathrm { l o g } ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) ] ] + \\mathbb { E } _ { \\boldsymbol { y } \\in \\mathcal { Y } } [ \\mathbb { E } _ { \\bar { \\boldsymbol { y } } \\in S _ { \\boldsymbol { y } } } [ \\mathrm { l o g } ( 1 - D _ { \\overline { { \\mathcal { X } } } } ( G ( \\bar { \\boldsymbol { y } } ) ) ) ] ] } \\\\ & { = \\displaystyle \\sum _ { \\boldsymbol { x } \\in \\mathcal { X } } p _ { \\mathcal { X } } ( \\boldsymbol { x } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim S _ { \\boldsymbol { x } } } \\frac { 1 } { | S _ { \\boldsymbol { x } } | } \\log ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } + \\displaystyle \\sum _ { \\boldsymbol { y } \\in \\mathcal { Y } } p _ { \\mathcal { Y } } ( \\boldsymbol { y } ) \\int _ { \\bar { \\boldsymbol { y } } \\sim S _ { \\boldsymbol { y } } } \\frac { 1 } { | S _ { \\boldsymbol { y } } | } \\log ( 1 - D _ { \\overline { { \\boldsymbol { x } } } } ( G ( \\bar { \\boldsymbol { y } } ) ) ) d \\bar { y } } \\\\ & { = \\displaystyle \\sum _ { \\boldsymbol { x } \\in \\mathcal { X } } p _ { \\mathcal { X } } ( \\boldsymbol { x } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim S _ { \\boldsymbol { x } } } \\frac { 1 } { | S _ { \\boldsymbol { x } } | } \\log ( D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } + \\displaystyle \\sum _ { \\boldsymbol { y } \\in \\mathcal { Y } } p _ { \\mathcal { Y } } ( \\boldsymbol { y } ) \\int _ { \\bar { \\boldsymbol { x } } \\sim G ( S _ { \\boldsymbol { y } } ) } \\frac { | \\nabla _ { \\bar { x } } F ( \\bar { \\boldsymbol { x } } ) | } { | S _ { \\boldsymbol { y } } | } \\log ( 1 - D _ { \\overline { { \\boldsymbol { x } } } } ( \\bar { \\boldsymbol { x } } ) ) d \\bar { x } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 585, + 788, + 1112, + 788, + 1112, + 863, + 585, + 863 + ], + "score": 0.93, + "latex": "\\int _ { { \\bar { x } } \\sim S _ { G ( y ) } } { \\frac { 1 } { \\left| S _ { G ( y ) } \\right| } } d { \\bar { x } } = \\int _ { { \\bar { x } } \\sim G ( S _ { y } ) } { \\frac { \\left| \\nabla _ { \\bar { x } } F ( { \\bar { x } } ) \\right| } { \\left| S _ { y } \\right| } } d { \\bar { x } }" + }, + { + "category_id": 14, + "poly": [ + 603, + 1249, + 1095, + 1249, + 1095, + 1326, + 603, + 1326 + ], + "score": 0.93, + "latex": "\\frac { 1 } { ( 1 - \\epsilon _ { x } ) | S _ { G ( y ) } | } \\geq \\frac { 1 } { | S _ { y } | } \\geq \\frac { 1 } { ( 1 + \\epsilon _ { x } ) | S _ { G ( y ) } | }" + }, + { + "category_id": 13, + "poly": [ + 597, + 425, + 670, + 425, + 670, + 457, + 597, + 457 + ], + "score": 0.91, + "latex": "y \\in \\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 729, + 423, + 998, + 423, + 998, + 458, + 729, + 458 + ], + "score": 0.91, + "latex": "G ( y ) = x \\Leftrightarrow y = F ( x )" + }, + { + "category_id": 13, + "poly": [ + 1284, + 332, + 1360, + 332, + 1360, + 359, + 1284, + 359 + ], + "score": 0.9, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 14, + "poly": [ + 659, + 277, + 1040, + 277, + 1040, + 317, + 659, + 317 + ], + "score": 0.89, + "latex": "\\left( 1 - \\epsilon _ { x } \\right) \\leq \\left| \\nabla _ { \\bar { x } } F ( \\bar { x } ) \\right| \\leq \\left( 1 + \\epsilon _ { x } \\right)" + }, + { + "category_id": 13, + "poly": [ + 428, + 376, + 704, + 376, + 704, + 415, + 428, + 415 + ], + "score": 0.88, + "latex": "\\forall y \\in \\mathcal { Y } , G ( S _ { y } ) = S _ { G ( y ) }" + }, + { + "category_id": 13, + "poly": [ + 484, + 332, + 508, + 332, + 508, + 358, + 484, + 358 + ], + "score": 0.85, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 396, + 230, + 702, + 230, + 702, + 263, + 396, + 263 + ], + "score": 0.83, + "latex": "\\forall x \\in \\mathcal { X } , \\exists \\epsilon _ { x } \\geq 0 , \\forall \\bar { x } \\in S _ { x }" + }, + { + "category_id": 13, + "poly": [ + 484, + 427, + 499, + 427, + 499, + 452, + 484, + 452 + ], + "score": 0.57, + "latex": "^ { l }" + }, + { + "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, + 871.0, + 2085.0, + 871.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1378.0, + 710.0, + 1403.0, + 710.0, + 1403.0, + 738.0, + 1378.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 1669.0, + 1403.0, + 1669.0, + 1403.0, + 1697.0, + 1377.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1177.0, + 1404.0, + 1177.0, + 1404.0, + 1209.0, + 1376.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1221.0, + 449.0, + 1221.0, + 449.0, + 1264.0, + 295.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 750.0, + 450.0, + 750.0, + 450.0, + 797.0, + 294.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1725.0, + 685.0, + 1725.0, + 685.0, + 1770.0, + 296.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 325.0, + 483.0, + 325.0, + 483.0, + 369.0, + 296.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 325.0, + 1283.0, + 325.0, + 1283.0, + 369.0, + 509.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1361.0, + 325.0, + 1372.0, + 325.0, + 1372.0, + 369.0, + 1361.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1331.0, + 899.0, + 1331.0, + 899.0, + 1371.0, + 296.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 226.0, + 395.0, + 226.0, + 395.0, + 269.0, + 295.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 226.0, + 706.0, + 226.0, + 706.0, + 269.0, + 703.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 866.0, + 537.0, + 866.0, + 537.0, + 909.0, + 293.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 367.0, + 427.0, + 367.0, + 427.0, + 422.0, + 293.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 367.0, + 708.0, + 367.0, + 708.0, + 422.0, + 705.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 419.0, + 483.0, + 419.0, + 483.0, + 463.0, + 293.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 419.0, + 596.0, + 419.0, + 596.0, + 463.0, + 500.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 419.0, + 728.0, + 419.0, + 728.0, + 463.0, + 671.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 419.0, + 1008.0, + 419.0, + 1008.0, + 463.0, + 999.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 750.0, + 450.0, + 750.0, + 450.0, + 797.0, + 294.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1221.0, + 449.0, + 1221.0, + 449.0, + 1264.0, + 295.0, + 1264.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1479, + 1407, + 1479, + 1407, + 1574, + 298, + 1574 + ], + "score": 0.976 + }, + { + "category_id": 8, + "poly": [ + 332, + 895, + 1365, + 895, + 1365, + 1241, + 332, + 1241 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 332, + 274, + 1365, + 274, + 1365, + 619, + 332, + 619 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 632, + 713, + 1066, + 713, + 1066, + 839, + 632, + 839 + ], + "score": 0.963 + }, + { + "category_id": 8, + "poly": [ + 632, + 1342, + 1066, + 1342, + 1066, + 1468, + 632, + 1468 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 298, + 1293, + 618, + 1293, + 618, + 1327, + 298, + 1327 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 296, + 849, + 920, + 849, + 920, + 885, + 296, + 885 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 298, + 673, + 539, + 673, + 539, + 705, + 298, + 705 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 297, + 227, + 1250, + 227, + 1250, + 264, + 297, + 264 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 816, + 73, + 816, + 106, + 298, + 106 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.852 + }, + { + "category_id": 14, + "poly": [ + 329, + 896, + 1369, + 896, + 1369, + 1243, + 329, + 1243 + ], + "score": 0.94, + "latex": "\\begin{array} { l } { { \\displaystyle \\leq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\overline { { x } } \\sim S _ { z } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } + \\displaystyle \\sum _ { y \\in \\mathcal { Y } } p _ { \\mathcal Y } ( y ) \\int _ { \\overline { { x } } \\sim G ( S _ { y } ) } \\frac { 1 + \\epsilon _ { x } } { | S _ { y } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle \\leq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle \\qquad + p _ { \\mathcal Y } ( F ( x ) ) \\int _ { \\bar { x } \\sim S _ { G ( F ( \\bar { x } ) ) } } \\frac { 1 + \\epsilon _ { x } } { ( 1 - \\epsilon _ { x } ) | S _ { G ( F ( \\bar { x } ) ) } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } } \\\\ { { \\displaystyle = \\sum _ { x \\in \\mathcal { X } } \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\left[ p _ { \\mathcal X } ( x ) \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) + \\frac { 1 + \\epsilon _ { x } } { 1 - \\epsilon _ { x } } p _ { G } ( x ) \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) \\right] d \\bar { x } } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 328, + 273, + 1372, + 273, + 1372, + 625, + 328, + 625 + ], + "score": 0.94, + "latex": "\\begin{array} { l } { { \\displaystyle \\geq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\overline { { x } } \\sim S _ { \\varepsilon } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } + \\displaystyle \\sum _ { y \\in \\mathcal { Y } } p _ { \\mathcal Y } ( y ) \\int _ { \\overline { { x } } \\sim G ( S _ { y } ) } \\frac { 1 - \\epsilon _ { x } } { | S _ { y } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle \\geq \\sum _ { x \\in \\mathcal { X } } p _ { \\mathcal X } ( x ) \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle \\qquad + p _ { \\mathcal Y } ( F ( x ) ) \\int _ { \\bar { x } \\sim S _ { G ( F ( x ) ) } } \\frac { 1 - \\epsilon _ { x } } { ( 1 + \\epsilon _ { x } ) | S _ { G ( F ( x ) ) } | } \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) d \\bar { x } } \\ ~ } \\\\ { { \\displaystyle = \\sum _ { x \\in \\mathcal { X } } \\int _ { \\bar { x } \\sim S _ { x } } \\frac { 1 } { | S _ { x } | } \\left[ p _ { \\mathcal X } ( x ) \\log ( D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) + \\frac { 1 - \\epsilon _ { x } } { 1 + \\epsilon _ { x } } p _ { G } ( x ) \\log ( 1 - D _ { \\overline { { \\mathcal X } } } ( \\bar { x } ) ) \\right] d \\bar { x } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 536, + 1296, + 584, + 1296, + 584, + 1329, + 536, + 1329 + ], + "score": 0.91, + "latex": "D _ { \\overline { { \\mathcal { X } } } }" + }, + { + "category_id": 13, + "poly": [ + 1137, + 1510, + 1394, + 1510, + 1394, + 1544, + 1137, + 1544 + ], + "score": 0.91, + "latex": "\\mathbb { E } _ { { \\bar { x } } \\sim S _ { x } } [ D _ { \\overline { { \\mathcal { X } } } } ( { \\bar { x } } ) ] = D _ { \\mathcal { X } }" + }, + { + "category_id": 14, + "poly": [ + 631, + 1341, + 1068, + 1341, + 1068, + 1471, + 631, + 1471 + ], + "score": 0.9, + "latex": "\\begin{array} { c } { { D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } \\sim S _ { x } ) = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + \\frac { 1 + \\epsilon _ { x } } { 1 - \\epsilon _ { x } } p _ { G } } \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\\\ { { \\Longrightarrow \\mathbb { E } _ { \\bar { x } \\sim S _ { x } } [ D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } ) ] \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 631, + 713, + 1068, + 713, + 1068, + 842, + 631, + 842 + ], + "score": 0.9, + "latex": "\\begin{array} { c } { { D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } \\sim S _ { x } ) = \\frac { p _ { \\mathcal { X } } } { p _ { \\mathcal { X } } + \\frac { 1 - \\epsilon _ { x } } { 1 + \\epsilon _ { x } } p _ { G } } \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\\\ { { \\Longrightarrow \\mathbb { E } _ { \\bar { x } \\sim S _ { x } } [ D _ { \\overline { { { \\mathcal { X } } } } } ( \\bar { x } ) ] \\stackrel { \\epsilon _ { x } } { \\approx } D _ { \\mathcal { X } } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1322, + 1481, + 1401, + 1481, + 1401, + 1508, + 1322, + 1508 + ], + "score": 0.89, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 584, + 1481, + 609, + 1481, + 609, + 1507, + 584, + 1507 + ], + "score": 0.83, + "latex": "F" + }, + { + "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": [ + 293.0, + 1478.0, + 583.0, + 1478.0, + 583.0, + 1516.0, + 293.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 1478.0, + 1321.0, + 1478.0, + 1321.0, + 1516.0, + 610.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1478.0, + 1405.0, + 1478.0, + 1405.0, + 1516.0, + 1402.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1509.0, + 1136.0, + 1509.0, + 1136.0, + 1547.0, + 295.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1509.0, + 1407.0, + 1509.0, + 1407.0, + 1547.0, + 1395.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1540.0, + 923.0, + 1540.0, + 923.0, + 1576.0, + 293.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 1542.0, + 1404.0, + 1542.0, + 1404.0, + 1572.0, + 1373.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1288.0, + 535.0, + 1288.0, + 535.0, + 1333.0, + 295.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 1288.0, + 620.0, + 1288.0, + 620.0, + 1333.0, + 585.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 842.0, + 921.0, + 842.0, + 921.0, + 894.0, + 293.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 673.0, + 541.0, + 673.0, + 541.0, + 705.0, + 297.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 227.0, + 1254.0, + 227.0, + 1254.0, + 267.0, + 295.0, + 267.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/BkgRe1SFDS/BkgRe1SFDS_layout.pdf b/parse/train/BkgRe1SFDS/BkgRe1SFDS_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..66ccc531147d59ab8df26c4381babf9b3f9f6203 --- /dev/null +++ b/parse/train/BkgRe1SFDS/BkgRe1SFDS_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:29df08cbb6f9e1966096bd2126c38f99912f0a8185ea2c4a4b8118c276585344 +size 1224948 diff --git a/parse/train/BkgRe1SFDS/BkgRe1SFDS_origin.pdf b/parse/train/BkgRe1SFDS/BkgRe1SFDS_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c360568e5d815fe74619505dba96020dd38d477e --- /dev/null +++ b/parse/train/BkgRe1SFDS/BkgRe1SFDS_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:137c6cdd528c248dc4379c0df9070b4e4e2fc25b045ddc36dda7e39e5dbf4946 +size 1019029 diff --git a/parse/train/BkgRe1SFDS/BkgRe1SFDS_span.pdf b/parse/train/BkgRe1SFDS/BkgRe1SFDS_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d625aa0e9d9dd8ecfdecd00833e0bc6be3f11a7a --- /dev/null +++ b/parse/train/BkgRe1SFDS/BkgRe1SFDS_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b4c46f2f3d03a36c7995b68af40090f5c8d3d33f255d52092a20308629c79fc0 +size 1228789 diff --git a/parse/train/BklHpjCqKm/BklHpjCqKm_layout.pdf b/parse/train/BklHpjCqKm/BklHpjCqKm_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6912fd38ec092718e0ed7634c8da71dd10c5f957 --- /dev/null +++ b/parse/train/BklHpjCqKm/BklHpjCqKm_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:dac4bde8ba60651fa165fec52317b68d1e86fd5041a92d27920ca9b59898106f +size 4719763 diff --git a/parse/train/BklHpjCqKm/BklHpjCqKm_origin.pdf b/parse/train/BklHpjCqKm/BklHpjCqKm_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4c35309bd2c1a305b7d6c920fa06a7c22d3f5c1f --- /dev/null +++ b/parse/train/BklHpjCqKm/BklHpjCqKm_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c96ebb6ac2d28db7796c1621c0025106902fddb175e49855f4feb4ae1a5f6c63 +size 4555828 diff --git a/parse/train/BklHpjCqKm/BklHpjCqKm_span.pdf b/parse/train/BklHpjCqKm/BklHpjCqKm_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..76ef0782bbc0b37b0539465ae6cf89d467a53b47 --- /dev/null +++ b/parse/train/BklHpjCqKm/BklHpjCqKm_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3923838991704a43953303f282d9d5046eef53a86f91b480db2fda6d92b721d4 +size 4723872 diff --git a/parse/train/BklhAj09K7/BklhAj09K7_layout.pdf b/parse/train/BklhAj09K7/BklhAj09K7_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d77e6b9bb6e8b46cc8667033a772296a8c8dedb9 --- /dev/null +++ b/parse/train/BklhAj09K7/BklhAj09K7_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7de2cc918331affeac2cd6402b9cba9e1e436f3e613e9370c9f5d48f913e3545 +size 2995439 diff --git a/parse/train/BklhAj09K7/BklhAj09K7_origin.pdf b/parse/train/BklhAj09K7/BklhAj09K7_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..1ff846a3a94b17038d838f16d7e12e33d377c771 --- /dev/null +++ b/parse/train/BklhAj09K7/BklhAj09K7_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:96f057a93480b7a610ad211e213adc5305297ed7f9be8118fde8ab57fc7a7e53 +size 2744769 diff --git a/parse/train/BklhAj09K7/BklhAj09K7_span.pdf b/parse/train/BklhAj09K7/BklhAj09K7_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e06d2d115d5126b29fb0ddfcc73999f8725b6fc8 --- /dev/null +++ b/parse/train/BklhAj09K7/BklhAj09K7_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2e41c359f19d456dd9b3900c72b7586ab63d1fca621d996a8c6e5396fa622219 +size 3004779 diff --git a/parse/train/BkrsAzWAb/BkrsAzWAb_layout.pdf b/parse/train/BkrsAzWAb/BkrsAzWAb_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7e6fbea8617a4e0141cfddc3c7b8029995005a09 --- /dev/null +++ b/parse/train/BkrsAzWAb/BkrsAzWAb_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:355dbfc032f418e0e2deb4f09583739d47b9e9bc10fb9502ff24f202dbb12dd7 +size 2366073 diff --git a/parse/train/BkrsAzWAb/BkrsAzWAb_origin.pdf b/parse/train/BkrsAzWAb/BkrsAzWAb_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..889df2c2a95a2f41921938439a32c4a0055b1adb --- /dev/null +++ b/parse/train/BkrsAzWAb/BkrsAzWAb_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6511f0488aaf306fb8452f49dd5ba6e5886f5b61322e27a0bf5ea1a88b6ff048 +size 2222963 diff --git a/parse/train/BkrsAzWAb/BkrsAzWAb_span.pdf b/parse/train/BkrsAzWAb/BkrsAzWAb_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f1540a4aa0143abdac9cab9ff73daf9b2ed8b6b0 --- /dev/null +++ b/parse/train/BkrsAzWAb/BkrsAzWAb_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:90a6750f487d7a4cf65083609c308caabbc880f5b063621ebdcf69e1769d8c36 +size 2375445 diff --git a/parse/train/BkxfshNYwB/BkxfshNYwB_layout.pdf b/parse/train/BkxfshNYwB/BkxfshNYwB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3e0edb8fd3d0042ffe0cde9b3442d9f19f663683 --- /dev/null +++ b/parse/train/BkxfshNYwB/BkxfshNYwB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:93d4f74a1e0416d3b4761e3de6d373abb13441dc46f0071c1f4599957078e6f4 +size 1036601 diff --git a/parse/train/BkxfshNYwB/BkxfshNYwB_origin.pdf b/parse/train/BkxfshNYwB/BkxfshNYwB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4a87e8755ab87436159bd97c837b01f0610bc139 --- /dev/null +++ b/parse/train/BkxfshNYwB/BkxfshNYwB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c038bb4c668aa0e30ea836992a33b5821fd14165c62cae623c31c40b57559f80 +size 889247 diff --git a/parse/train/BkxfshNYwB/BkxfshNYwB_span.pdf b/parse/train/BkxfshNYwB/BkxfshNYwB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8f74979ef7f6af7c3eff3c00201c8ab89d871f51 --- /dev/null +++ b/parse/train/BkxfshNYwB/BkxfshNYwB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3aea1b51b63e115287667785f4303c10e72b1cf0fcdadcff8fcac068e7a33fd9 +size 1039075 diff --git a/parse/train/ByeWogStDS/ByeWogStDS_layout.pdf b/parse/train/ByeWogStDS/ByeWogStDS_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..060625ee2e4543a3f1cf05e5e58bff62139d0991 --- /dev/null +++ b/parse/train/ByeWogStDS/ByeWogStDS_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5c319fa77c1f6ceae1d4f4f8b94338eb39513c7c547921f0c618ab6393abd92b +size 4265974 diff --git a/parse/train/ByeWogStDS/ByeWogStDS_origin.pdf b/parse/train/ByeWogStDS/ByeWogStDS_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..fb38b8e4c819ef663f63da5eef22ebba5ef3ea58 --- /dev/null +++ b/parse/train/ByeWogStDS/ByeWogStDS_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:78410e9e6b58bad47ae659259de61eec873de6a48aef2ac485faaf22c2bcc9b6 +size 4061045 diff --git a/parse/train/ByeWogStDS/ByeWogStDS_span.pdf b/parse/train/ByeWogStDS/ByeWogStDS_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..36da74726f7e5c9937b734e06f6f41514b3f63a3 --- /dev/null +++ b/parse/train/ByeWogStDS/ByeWogStDS_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:77499f0bc2ea6b287b90d40ff4d0a8c8305497b2a8a706c214b2d113a6381288 +size 4267312 diff --git a/parse/train/Byf5-30qFX/Byf5-30qFX_layout.pdf b/parse/train/Byf5-30qFX/Byf5-30qFX_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..726a1e74857f4418ab4f014a39cfea7a414f7ff0 --- /dev/null +++ b/parse/train/Byf5-30qFX/Byf5-30qFX_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ac2c2b12f72a7b1270f1607a8b5995fc579324d479fd678c79d6d28215c58058 +size 2617243 diff --git a/parse/train/Byf5-30qFX/Byf5-30qFX_origin.pdf b/parse/train/Byf5-30qFX/Byf5-30qFX_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c58c37a2657b634f9bdb0099841f9c66170a541b --- /dev/null +++ b/parse/train/Byf5-30qFX/Byf5-30qFX_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5b177555f27bd6e6436393399c02c9823bba5120200595287c75930981528ae1 +size 2498359 diff --git a/parse/train/Byf5-30qFX/Byf5-30qFX_span.pdf b/parse/train/Byf5-30qFX/Byf5-30qFX_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8c7395726c5f5fefe65fbeaa76bff0d389a4db09 --- /dev/null +++ b/parse/train/Byf5-30qFX/Byf5-30qFX_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0b0a5880111ad1b0e1079fc409949cc49f2a58bce6e07f7ceefae5657e002d80 +size 2626342 diff --git a/parse/train/BygkQeHKwB/BygkQeHKwB_layout.pdf b/parse/train/BygkQeHKwB/BygkQeHKwB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5b39ddcc531ff659d657523cb05c71c1455ad193 --- /dev/null +++ b/parse/train/BygkQeHKwB/BygkQeHKwB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:249f2d7987486e7da43aedc75132dabac381f7843c99d0babf1d291e6c0e04ae +size 9527319 diff --git a/parse/train/BygkQeHKwB/BygkQeHKwB_origin.pdf b/parse/train/BygkQeHKwB/BygkQeHKwB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..181185924ab942a5e02e33a1d5fe0ef7746c8502 --- /dev/null +++ b/parse/train/BygkQeHKwB/BygkQeHKwB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d98d8bdf5fe8bb363ae47c83a8c7ebac8dd012372483d0bd02100032f36dcba0 +size 9270118 diff --git a/parse/train/BygkQeHKwB/BygkQeHKwB_span.pdf b/parse/train/BygkQeHKwB/BygkQeHKwB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b8d8659b2566b4fafa7e047ba7937baef11fcd79 --- /dev/null +++ b/parse/train/BygkQeHKwB/BygkQeHKwB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0078110887584a4063d2b4538699078234ae45e2a4940b2c4ffb2400a2e02c5b +size 9536471 diff --git a/parse/train/Byl3K2VtwB/Byl3K2VtwB_layout.pdf b/parse/train/Byl3K2VtwB/Byl3K2VtwB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..1fb99be476fcb019895d1189bb01e915de45e32b --- /dev/null +++ b/parse/train/Byl3K2VtwB/Byl3K2VtwB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:beab698cbbf415f56462f1f0236c04cd150355ee8d1979ad0a2633e0dcd0236e +size 868244 diff --git a/parse/train/Byl3K2VtwB/Byl3K2VtwB_origin.pdf b/parse/train/Byl3K2VtwB/Byl3K2VtwB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e2deb1117e80a83f76974072b35a1bdfdefb5b78 --- /dev/null +++ b/parse/train/Byl3K2VtwB/Byl3K2VtwB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f431f6518c336a3600dd4bf781fde195b4a76f596cd2885e83e0e3f8138a4820 +size 605580 diff --git a/parse/train/Byl3K2VtwB/Byl3K2VtwB_span.pdf b/parse/train/Byl3K2VtwB/Byl3K2VtwB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7b4dc48b755baf83341442a6f73025737ab26ac7 --- /dev/null +++ b/parse/train/Byl3K2VtwB/Byl3K2VtwB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ec343d9dda90a2872872cae425bcb674544714e56018a7ca472efd32ed0b2199 +size 877213 diff --git a/parse/train/BylSPv9gx/BylSPv9gx_layout.pdf b/parse/train/BylSPv9gx/BylSPv9gx_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..63e573649e5c83c74f371dd1a2f065c486111c56 --- /dev/null +++ b/parse/train/BylSPv9gx/BylSPv9gx_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e1ed000e68668995ce9ea65b5279ba8f8b53f8e3a054101cb70b57ae5521e333 +size 447151 diff --git a/parse/train/BylSPv9gx/BylSPv9gx_origin.pdf b/parse/train/BylSPv9gx/BylSPv9gx_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..45627ccd4e230f36fb2f23e5531d4cf4e626f1c8 --- /dev/null +++ b/parse/train/BylSPv9gx/BylSPv9gx_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:66ed31fb56042577b63db19545fd0e2b64d1981cd9c7579c9575470055241db3 +size 373209 diff --git a/parse/train/BylSPv9gx/BylSPv9gx_span.pdf b/parse/train/BylSPv9gx/BylSPv9gx_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..0325f315c01043f2843e4de262da7a5de3825e48 --- /dev/null +++ b/parse/train/BylSPv9gx/BylSPv9gx_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7ba07094e3a7054f17a0916acb628b7322213b5096d4b214dee761a3091cdc13 +size 447641 diff --git a/parse/train/BywyFQlAW/BywyFQlAW_layout.pdf b/parse/train/BywyFQlAW/BywyFQlAW_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ad976352935a500aed465a16e66a367bae033f66 --- /dev/null +++ b/parse/train/BywyFQlAW/BywyFQlAW_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e7bcb71a3d28dd9d723cc5769b4e77f817bb9642cfcf3a8d436ea5d26d33a2fe +size 19472549 diff --git a/parse/train/BywyFQlAW/BywyFQlAW_origin.pdf b/parse/train/BywyFQlAW/BywyFQlAW_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2d29c69dedda7806b0dafb087ccb742918413011 --- /dev/null +++ b/parse/train/BywyFQlAW/BywyFQlAW_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bd23b3309b272960d6a2bc4ea984a1675ad5bb34f2b622de4b64fcfee570f949 +size 19120765 diff --git a/parse/train/BywyFQlAW/BywyFQlAW_span.pdf b/parse/train/BywyFQlAW/BywyFQlAW_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8cf4fc1016f2e8be37b5901a35e9f4f51a0bd8bc --- /dev/null +++ b/parse/train/BywyFQlAW/BywyFQlAW_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8084005dcc8ba3c1cf0e2f041c38a1ba7995f56f3ed9f361c285ad36472e4cbd +size 19503972 diff --git a/parse/train/D04TGKz5rfF/D04TGKz5rfF.md b/parse/train/D04TGKz5rfF/D04TGKz5rfF.md new file mode 100644 index 0000000000000000000000000000000000000000..a6a2a9bbed7f3e43710c7bae8d3f37cd8fba7527 --- /dev/null +++ b/parse/train/D04TGKz5rfF/D04TGKz5rfF.md @@ -0,0 +1,540 @@ +# A FREQUENCY DOMAIN ANALYSIS OF GRADIENTBASED ADVERSARIAL EXAMPLES + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +It is well known that deep neural networks are vulnerable to adversarial examples. We attempt to understand adversarial examples from the perspective of frequency analysis. Several works have empirically shown that the gradient-based adversarial attacks perform differently in the low-frequency and high-frequency part of the input data. But there is still a lack of theoretical justification of these phenomena. In this work, we both theoretically and empirically show that the adversarial perturbations gradually increase the concentration in the low-frequency domain of the spectrum during the training process of the model parameters. And the log-spectrum difference of the adversarial examples and clean image is more concentrated in the high-frequency part than the low-frequency part. We also find out that the ratio of the high-frequency and the low-frequency part in the adversarial perturbation is much larger than that in the corresponding natural image. Inspired by these important theoretical findings, we apply low-pass filter to potential adversarial examples before feeding them to the model. The results show that this preprocessing can significantly improve the robustness of the model. + +# 1 INTRODUCTION + +Recently, deep neural networks (DNN) have achieved great success in the field of image processing, but it was found that DNNs are vulnerable to some synthetic data called adversarial examples ((Szegedy et al., 2013), (Kurakin et al., 2016)). Adversarial examples are natural samples plus adversarial perturbations, and the perturbations between natural samples and adversarial examples are imperceptible to human but able to fool the model. Typically, generating an adversarial example can be considered as finding an example in an $\epsilon$ -ball around a natural image that could be misclassified by the classifier. Recent studies designed Fast Gradient Sign Method (FGSM, (Goodfellow et al., 2014)), Fast Gradient Method (FGM, (Miyato et al., 2016)), Projected Gradient Descent (PGD, (Madry et al., 2017)) and other algorithms (Carlini & Wagner (2017), (Su et al., 2019), (Xiao et al., 2018), (Kurakin et al., 2016), (Chen et al., 2017)) to attack the model. + +Since the phenomenon of adversarial examples was discovered, many related works have made progress to study why they exist. Several works studied this phenomenon from the perspective of feature representation. Ilyas et al. (2019) divided the features into non-robust ones that are responsible for the model’s vulnerability to adversarial examples, and robust ones that are close to human perception. Further, they showed that adversarial vulnerability arises from non-robust features that are useful for correct classification. + +Another way to characterize adversarial examples is to investigate them in the frequency domain via Fourier transform. Wang et al. (2020a) divided an image into low-frequency component (LFC) and high-frequency component (HFC) and they empirically showed that human can only perceive LFC, but convolutional neural networks can obtain useful information from both LFC and HFC. Yin et al. (2019) filters out the input data with low-pass or high-pass filters to study the sensitivity of the additive noise with different frequencies. Wang et al. (2020b) claimed that existing adversarial attacks mainly concentrate in the high-frequency part. Sharma et al. (2019) found that when perturbations are constrained to the low-frequency subspace, they are generated faster and are more transferable, and will be effective to fool the defended models, but not for clean models. + +All of these works showed that spectrum in frequency domain is an reasonable way to study the adversarial examples. + +However, there is a lack of theoretical understanding about the dynamics of the adversarial perturbations in frequency domain along the training process of the model parameters. In this work, we focus on the frequency domain of the adversarial perturbations to explore the spectral properties of the adversarial examples generated by FGM (Miyato et al., 2016) and PGD (Madry et al., 2017). + +In this work, we give a theoretical analysis in frequency domain of natural images for the adversarial examples. + +• For a two-layer neural network with non-linear activation function, we prove that adversarial perturbations by FGM and $l _ { 2 }$ -PGD attacks gradually increase the concentration in the low-frequency part of the spectrum during the training process over model parameters. Meanwhile, the log-spectrum difference of the adversarial examples (the definition will be clarified in Section 2.2) will be more concentrated in the high-frequency part than the low-frequency part. • Furthermore, we show that the ratio of the high-frequency and the low-frequency part in the adversarial perturbation is much larger than that in the corresponding clean image. + +Empirically, + +• we design several experiments on the two-layer model and Resnet-32 with CIFAR-10 to verify the above findings. Based on these phenomena, we filter out the high-frequency part of the adversarial examples before feeding them to the model to improve the robustness. Compared with the adversarially trained model with the same architecture, our method achieves comparable robustness with the similar computational cost of normal training and almost no loss of accuracy. + +The rest of the paper is organized as follows: In Section 2, we present preliminaries and some theoretical analysis on the calculation of the spectrum and log-spectrum. Then we provide our main results about the frequency domain analysis of gradient-based adversarial examples in Section 3. Furthermore, some experiments for supporting our theoretical findings are shown in Section 4. Finally we conclude our work and conduct a discussion about the future work in Section 5. All the details about the proof and experiments are shown in the Appendix. + +# 2 BACKGROUND + +# 2.1 PRELIMINARIES + +Notations We use $\{ 0 , 1 , . . . , d \}$ to denote the set of all integers between 0 and $d$ and use $\| \cdot \| _ { p }$ to denote $l _ { p }$ norm. Specifically, we denote by $\| \cdot \|$ the $l _ { 2 }$ norm. For a $d$ -dimensional vector $_ { \textbf { \em x } }$ , we use $x _ { \mu }$ to denote its $\mu$ -th component with index starting at 0. For a scalar function $f ( { \pmb x } )$ $) \colon { \mathbb { R } ^ { d } } \mapsto { \mathbb { R } }$ , $\nabla _ { \pmb { x } } f$ and $\partial _ { \mu } f$ denote the gradient vector and its $\mu$ -th component. We let $\operatorname { s g n } ( x ) = 1$ for $x > 0$ and $- 1$ for $x < 0$ . Normal training refers to training on the original training data for learning the optimal weights for the neural networks. $\tilde { { \pmb x } } = \mathcal { F } ( { \pmb x } )$ denotes the Discrete Fourier Transform (DFT) of $_ { \textbf { \em x } }$ . + +Discrete Fourier Transform The $k$ -th frequency component $\tilde { g } [ k ]$ of one-dimensional DFT of a vector $\textbf { { g } }$ is defined by + +$$ +\tilde { g } [ k ] = \mathcal { F } ( g ) [ k ] = \sum _ { \mu = 0 } ^ { d - 1 } g _ { \mu } e ^ { i k \frac { 2 \pi } { d } \mu } , +$$ + +where $k \in \{ - d / 2 , - d / 2 + 1 , . . . , d / 2 \}$ if $d$ is even and $k \in \{ - ( d - 1 ) / 2 , . . . , ( d - 1 ) / 2 \}$ if $d$ is odd. For convenience, we always consider an odd $d$ and one can easily generalize the case to even dimensions. For an integer cut-off (cutoff frequency) $k _ { r } \in ( 0 , ( d - 1 ) / 2 )$ , the Low Frequency Components (LFC) and High Frequency Components (HFC) of $\tilde { g }$ are denoted by + +$$ +\begin{array} { r } { \tilde { g } _ { l } [ k ] = \left\{ \begin{array} { l l } { \tilde { g } [ k ] } & { \mathrm { i f } - k _ { c } \leq k \leq k _ { c } , } \\ { 0 } & { \mathrm { o t h e r w i s e } } \end{array} \right. \quad \tilde { g } _ { h } [ k ] = \left\{ \begin{array} { l l } { 0 } & { \mathrm { i f } - k _ { c } \leq k \leq k _ { c } , } \\ { \tilde { g } [ k ] } & { \mathrm { o t h e r w i s e } . } \end{array} \right. } \end{array} +$$ + +Then the frequency space $\mathbb { R } ^ { d }$ can be decomposed as $S _ { l } \oplus S _ { h }$ where $\tilde { g } _ { l } \in S _ { l }$ and $\tilde { g } _ { h } \in S _ { h }$ . Let $N _ { \tilde { g } } =$ $\sqrt { \Sigma _ { k = - d / 2 } ^ { d / 2 } | \tilde { g } [ k ] | ^ { 2 } }$ , then the ratio of a frequency component with respect to the whole frequency spectrum is denoted by + +$$ +\tau ( \tilde { g } [ k ] ) = \frac { | \tilde { g } [ k ] | ^ { 2 } } { N _ { \tilde { g } } ^ { 2 } } +$$ + +and the ratio of LFC is denoted by + +$$ +\tau ( \tilde { g } \in S _ { l } ) = \sum _ { k = - k _ { c } } ^ { k _ { c } } \frac { | \tilde { g } [ k ] | ^ { 2 } } { N _ { \tilde { g } } ^ { 2 } } . +$$ + +Setup In this paper, we consider a two-layer neural network $f : \mathbb { R } ^ { d } \mapsto \mathbb { R }$ + +$$ +f ( \pmb { x } , \pmb { \theta } ) = \sum _ { r = 1 } ^ { m } a _ { r } \sigma ( \pmb { w } _ { r } ^ { T } \pmb { x } ) +$$ + +where $\sigma$ is an activation function, $\mathbf { \boldsymbol { a } } = ( a _ { 1 } , a _ { 2 } , . . . , a _ { m } ) ^ { T }$ is an $m$ -dimensional vector and ${ \pmb w } _ { r }$ ’s are $d$ -dimensional weight vectors. + +Van der Schaaf & van Hateren (1996) showed that natural images obey a power law in the frequency domain. Therefore, to make our settings closer to widely studied image related tasks, we also assume our input $_ { \textbf { \em x } }$ obey the power law + +$$ +| \tilde { \mathbf { x } } [ k ] | \propto k ^ { - \alpha } +$$ + +to imitate LFC-concentrated images, where the constant $\alpha \geq 1$ and $| \tilde { \pmb { x } } [ 0 ] | = \alpha _ { 0 }$ is another constant. Besides, we choose the cut-off $k _ { c }$ in such a way that + +$$ +\sum _ { k = 1 } ^ { k _ { c } } \frac { 1 } { k ^ { 2 \alpha } } + \alpha _ { 0 } ^ { 2 } > \sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } \frac { 1 } { k ^ { 2 \alpha } } , +$$ + +which indicates that $\tau ( \tilde { \pmb { x } } \in S _ { l } ) > \tau ( \tilde { \pmb { x } } \in S _ { h } )$ and can be easily satisfied for a small $k _ { c }$ + +Gradient-based adversarial attack For a loss function $\ell$ , we find $l _ { p }$ -norm $\epsilon$ -bounded adversarial perturbations by solving the optimization problem + +$$ +\operatorname* { m a x } _ { \| \pmb { \delta } \| _ { p } \leq \epsilon } \ell ( f ( \pmb { x } + \pmb { \delta } ) , y ) , +$$ + +where $( \pmb { x } , y ) \in \mathbb { R } ^ { d } \times \mathbb { R }$ is $d$ -dimensional input and output following the joint distribution $\mathcal { D }$ . + +To solve the above optimization problem, Goodfellow et al. (2014) proposed FGSM, an attack for an $l _ { \infty }$ -bounded adversary, and computed an adversarial example as $\begin{array} { r } { \pmb { x } _ { \mathrm { a d v } } = \pmb { x } + \epsilon \mathrm { s g n } \left( \nabla _ { \pmb { x } } \ell ( \theta , \pmb { x } , y ) \right) } \end{array}$ . Miyato et al. (2016) proposed FGM with an l2-bounded adversary, xadv = x +  ∇x\`(x,y)k∇x\`(x,y)k2 . Madry et al. (2017) introduced PGD which training adversarial examples in an iterative way that $\boldsymbol { x } ^ { t + 1 } =$ Πx+S (xt + α sgn (∇x\`(θ, x, y))) or xt+1 = Πx+S (xt + α ∇x\`(x,y)k∇x\`(x,y)k2 ) + +To simplify the analysis, we make the following assumptions on the normal training process: + +Assumption 1 There exist $\beta ^ { \prime } , \beta > 0$ such that $\beta ^ { \prime } \leq | \partial \ell / \partial f | \leq \beta .$ . + +Assumption 2 If $\begin{array} { r } { \ell = \frac { 1 } { 2 } \left( y - f ( \pmb { x } , \pmb { \theta } ) \right) ^ { 2 } } \end{array}$ , $\vert \partial \ell / \partial f \vert$ should be a small quantity such that $\vert \partial \ell / \partial f \vert =$ $\epsilon ^ { 1 + v }$ if the network is well trained in the end stage of normal training, where $0 < v < 1$ . + +Assumption 3 There exist $\lambda , \gamma > 0$ such that $0 \leq \sigma ^ { \prime } \leq \lambda$ and $0 \leq \sigma ^ { \prime \prime } \leq \gamma ^ { 1 }$ . + +Assumption 4 $a _ { r }$ ’s are i.i.d drawn from a distribution2 and will not be updated during the training. + +Wang et al. (2020a) considered the log-spectrum of an image: $2 0 * \log \left( | \mathcal { F } ( \pmb { x } ) | \right)$ , where $_ { \textbf { \em x } }$ is a $2 d$ - dimensional matrix representing an image. One way to calculate the ”log-spectrum difference of the adversarial examples” is to consider the difference between the log-spectrum of the adversarial and natural image and as follows, + +$$ +2 0 * \left| \log ( | \mathcal { F } ( \mathbf { x } + \delta ) | ) - \log ( | \mathcal { F } ( \mathbf { x } ) | ) \right| \approx 2 0 * \left| \log ( 1 + \frac { | \mathcal { F } ( \delta ) | } { | \mathcal { F } ( \mathbf { x } ) | } ) \right| \approx 2 0 * \frac { | \mathcal { F } ( \delta ) | } { | \mathcal { F } ( \mathbf { x } ) | } . +$$ + +We can observe that this quantity is approximately proportional to the ratio of the perturbation’s over the natural image’s frequency. Moreover, the average Relative Change in discrete cosine Transforms (RCT) in (Wang et al., 2020b)) approximately equals to it. Fig. 5 empirically shows that this ratio is large for high frequency component but small for low frequency one. However, Van der Schaaf & van Hateren (1996) claimed that the LFC of $\mathcal { F } ( x )$ is much bigger than its HFC, and the right side of Eq. 3 is inversely proportional to $\mathcal { F } ( x )$ . The denominator of the right side of Eq.(3) in low-frequency part is much larger than it in high frequency part, so it may be imprudent to consider the frequency distribution of the adversarial perturbations only based on the ratio in the right side of Eq.(3). + +Yin et al. (2019) provided another spectral measurement for adversarial examples. They considered the ”spectrum of the adversarial perturbation” $| \mathcal { F } ( \delta ) |$ , which directly reflects the distribution of adversarial perturbations in the frequency domain. Unfortunately, they claimed that ‘The adversarial perturbations for the normally trained model are uniformly distributed across frequency components’ without sufficient empirical and theoretical justification. In this work, we provide a totally different theoretical finding that the adversarial perturbations for the normally trained model are gradually concentrated in the low-frequency domain, further verified by extensive experiments. + +Fig. 1 visually shows the calculation methods of the spectrum of perturbations $\mathcal { F } ( \delta )$ and the logspectrum difference of adversarial examples $\begin{array} { r } { | \log ( | \mathcal { F } ( \pmb { x } + \pmb { \delta } ) | ) - \log ( | \mathcal { F } ( \pmb { x } ) | \approx \frac { | \mathcal { F } ( \pmb { \delta } ) | } { | \mathcal { F } ( \pmb { x } ) | } } \end{array}$ . + +# 3 MAIN RESULTS + +In Section 3.1, we show that, for a well trained two-layer neural network described in Eq.(1) with LFC-concentrated inputs, $l _ { 2 }$ - norm adversarial perturbations generated by FGM (Theorem 1) prefer to concentrate in the low frequency domain. Section 3.2 theoretically proves the HFC-concentration of the logspectrum difference of adversarial examples. Section 3.3 attempts to demonstrate the effectiveness of masking the HFC of the adversarial examples to improve model’s robustness despite that perturbations can concentrate in the low frequency domain. All technical proofs are deferred to Appendix A. Results on $l _ { 2 }$ PGD perturbations are presented in Appendix B. + +In this work, we consider the two-layer neural networks and the loss function $\ell \_ =$ ${ \scriptstyle { \frac { 1 } { 2 } } } \left( y - f ( \pmb { x } , \pmb { \theta } ) \right) ^ { 2 }$ . For any $_ { \textbf { \em x } }$ in this setting, we have + +$$ +\frac { \partial f } { \partial a _ { r } } = \sigma ( { \boldsymbol { w } } _ { r } ^ { T } { \boldsymbol { \mathbf { x } } } ) , \quad \frac { \partial f } { \partial { \boldsymbol { w } } _ { r } } = a _ { r } ^ { \prime } { \boldsymbol { \mathbf { x } } } , \quad \nabla _ { \boldsymbol { x } } f = \sum _ { r } a _ { r } ^ { \prime } { \boldsymbol { w } } _ { r } , +$$ + +![](images/518c8129a3aad49e7ddff8a6ab8bab8f2cd9a72478b926222aaf34b8041fa0de.jpg) +Figure 1: Visualization of spectrum and logspectrum for adversarial attacks . Section 3.1 focuses on the center picture $\mathcal { F } ( \delta )$ to prove that the LFC ratio of $\mathcal { F } ( \delta )$ is increasing. Section 3.2 focuses on the third-line center picture $\vert \log ( \vert \mathcal { F } ( x +$ $\delta ) | ) - \log ( | \mathcal { F } ( x | ) |$ , and shows that its LFC is smaller than its HFC. + +where $a _ { r } ^ { \prime } = a _ { r } \sigma ^ { \prime } ( \pmb { w } _ { r } ^ { T } \pmb { x } )$ and $\pmb { a } ^ { \prime } = ( a _ { 1 } ^ { \prime } , a _ { 2 } ^ { \prime } , . . . , a _ { m } ^ { \prime } )$ . At the $( t + 1 )$ -th step of gradient descent in the normal training process of the classifier, weight $\pmb { w }$ is updated as + +$$ +\pmb { w } _ { r } ^ { ( t + 1 ) } = \pmb { w } _ { r } ^ { ( t ) } - \eta \frac { \partial \ell } { \partial f } ^ { ( t ) } a _ { r } ^ { \prime ( t ) } \pmb { x } . +$$ + +We use $L _ { x }$ and $H _ { x }$ to denote the LFC and HFC of the clean input + +$$ +L _ { x } = \sum _ { k = 0 } ^ { k _ { c } } | \tilde { \pmb { x } } [ k ] | ^ { 2 } \mathrm { a n d } H _ { x } = \sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } | \tilde { \pmb { x } } [ k ] | ^ { 2 } . +$$ + +3.1 SPECTRAL TRAJECTORIES OF $l _ { 2 }$ -NORM FGM PERTURBATIONS + +Consider the $l _ { 2 }$ -norm FGM perturbation $\delta$ and its DFT $\tilde { \delta } [ k ]$ + +$$ +\delta = \epsilon \frac { \frac { \partial \ell } { \partial f } \nabla _ { \pmb { x } } f } { \big \| \frac { \partial \ell } { \partial f } \nabla _ { \pmb { x } } f \big \| } , \quad \tilde { \delta } [ k ] = \epsilon \mathrm { s g n } \left( \frac { \partial \ell } { \partial f } \right) \frac { 1 } { \big \| \nabla _ { \pmb { x } } f \big \| } \widetilde { \nabla } f [ k ] , +$$ + +where $\widetilde { \nabla f } [ k ] = \mathcal { F } \left( \nabla _ { x } f \right) [ k ]$ . Since the coefficient before $\widetilde { \nabla f } [ \boldsymbol { k } ]$ in (6) is same for different frequencies $k$ , we only need to analyze the spectrum of $\widetilde { \nabla f [ k ] }$ to investigate the ratio of certain frequency component over the whole frequency spectrum, i.e. + +$$ +\tau \left( \tilde { \delta } [ k ] \right) = \tau \left( \widetilde { \nabla f } [ k ] \right) . +$$ + +In this subsection, we explore the evolving of $\tau ( \tilde { \delta } [ k ] )$ along the normal training process. For a randomly initialized network, the FGM-attack perturbation will not have bias towards either HFC or LFC. We attack this model with FGM at each step of the normal training to study the trajectory of these perturbations in the frequency domain. According to Eq.(4), $\nabla _ { x } f$ is updated to the order of $\eta$ at the $( t + 1 )$ -th step as + +$$ +\nabla _ { \pmb { x } } f ^ { ( t + 1 ) } = \sum _ { r = 1 } ^ { m } ( 1 - \eta _ { r } ^ { ( t ) } ) a _ { r } ^ { \prime ( t ) } \pmb { w } _ { r } ^ { ( t ) } - \tilde { \eta } ^ { ( t ) } \pmb { x } + \mathcal { O } ( \eta ^ { 2 } ) , +$$ + +where $\begin{array} { r } { \eta _ { r } ^ { ( t ) } = \eta a _ { r } \| \pmb { x } \| ^ { 2 } \frac { \partial \ell } { \partial f } ^ { ( t ) } \sigma ^ { \prime \prime ( t ) } ( \pmb { w } _ { r } ^ { ( t ) T } \pmb { x } ) } \end{array}$ and $\begin{array} { r } { \tilde { \eta } ^ { ( t ) } = \eta \frac { \partial \ell } { \partial f } ^ { ( t ) } \| \pmb { a } ^ { \prime ( t ) } \| ^ { 2 } } \end{array}$ are composite learning rates for easing our notation. For ReLU activation function $\sigma ( x ) = \operatorname* { m a x } ( 0 , x )$ , we have that $\eta _ { r } ^ { ( t ) } = \frac { } { }$ $\mathbb { E } _ { i \in \{ 1 , 2 , \dots , m \} } [ \eta _ { i } ^ { ( t ) } ]$ , therefore, considering that Softplus has similar shape as ReLU, we derive that $\eta _ { r } ^ { ( t ) } = \bar { \eta } ^ { ( t ) } + \mathcal { O } ( \eta ^ { 2 } )$ , where $\begin{array} { r } { \bar { \eta } ^ { ( t ) } = \eta \| \pmb { x } \| ^ { 2 } \frac { \partial \ell } { \partial f } ^ { ( t ) } \mathbb { E } _ { r \in \{ 1 , 2 , \ldots , m \} } \left[ a _ { r } \sigma ^ { \prime \prime ( t ) } ( \pmb { w } _ { r } ^ { ( t ) T } \pmb { x } ) \right] } \end{array}$ . In this way, the $1 d$ -DFT of $\nabla _ { \pmb { x } } f ^ { ( t + 1 ) }$ has the following form, + +$$ +\widetilde { \nabla f } ^ { ( t + 1 ) } [ k ] = ( 1 - \bar { \eta } ^ { ( t ) } ) \widetilde { \nabla f } ^ { ( t ) } [ k ] - \tilde { \eta } ^ { ( t ) } \tilde { x } [ k ] . +$$ + +We are now ready to study the trajectory of $\tau ( \tilde { \delta } [ k ] )$ along the training step $t$ . Let $\triangle \varphi _ { k } ^ { ( t ) }$ denote the difference of phases between $\widetilde { \nabla f } ^ { ( t ) } [ k ]$ and ${ \tilde { \mathbf { x } } } [ k ]$ for frequency $k$ at the $t$ -th step. And for ease of notation, denote + +$$ +\triangle \tau _ { l } ^ { ( t ) } \triangleq - 2 \sum _ { k = 0 } ^ { k _ { c } } \vert \widehat { \nabla } f ^ { ( t ) } [ k ] \vert | \tilde { x } [ k ] | \cos \left( \triangle \varphi _ { k } ^ { ( t ) } \right) , \quad \triangle \tau _ { h } ^ { ( t ) } \triangleq - 2 \sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } \vert \widehat { \nabla } f ^ { ( t ) } [ k ] \vert | \tilde { x } [ k ] | \cos \left( \triangle \varphi _ { k } ^ { ( t ) } \right) , +$$ + +where $\tilde { \eta } ^ { ( t ) } \triangle \tau _ { l } ^ { ( t ) }$ and $\tilde { \eta } ^ { ( t ) } \triangle \tau _ { h } ^ { ( t ) }$ are approximately changed amounts for LFC and HFC of $| \widetilde { \nabla f } ^ { ( t ) } | ^ { 2 }$ at the $t$ -th step of the normal training of the network, respectively. Since the network is randomly initialized and the clean inputs $_ { \textbf { \em x } }$ are highly concentrated in the low frequency domain, we always study the case where $\tau ( \tilde { \pmb \delta } ^ { ( 0 ) } \in S _ { l } ) < \tau ( \tilde { \pmb x } \in S _ { l } )$ . We now, taking Eq.(7) into consideration , present our main theorem about $l _ { 2 }$ norm FGM perturbations as follows. + +Theorem 1 (The spectral trajectory of $l _ { 2 }$ FGM perturbation) During the training process of the two-layer neural network $f ( x )$ in $( l )$ , the $l _ { 2 }$ norm FGM adversarial perturbation will change its ratio of LFC, $\tau ( \tilde { \delta } \in S _ { l } )$ , at the $( t + 1 )$ -th step as follows, + +$$ +\tau ( \tilde { \pmb \delta } ^ { ( t + 1 ) } \in S _ { l } ) = \tau ( \tilde { \pmb \delta } ^ { ( t ) } \in S _ { l } ) + \tilde { \eta } ^ { ( t ) } \frac { \Delta \tau _ { l } ^ { ( t ) } \tau \left( \tilde { \pmb \delta } ^ { ( t ) } \in S _ { h } \right) - \bigtriangleup \tau _ { h } ^ { ( t ) } \tau \left( \tilde { \pmb \delta } ^ { ( t ) } \in S _ { l } \right) } { \sum _ { k = 0 } ^ { ( d - 1 ) / 2 } | \widetilde { \nabla f } ^ { ( t + 1 ) } [ k ] | ^ { 2 } } ; +$$ + +there will be a $t _ { 1 }$ s.t. $\forall t \geq t _ { 1 }$ , we have + +$$ +\tau ( \tilde { \delta } ^ { ( t + 1 ) } \in S _ { l } ) > \tau ( \tilde { \delta } ^ { ( t ) } \in S _ { l } ) . +$$ + +Remark According to theorem 1, during the normal training process for a randomly initialized network with LFC-concentrated input, there will be a $t _ { 0 }$ s.t. $\forall t \geq t _ { 0 }$ , we have $\triangle \tau _ { l } ^ { ( i ) } > \triangle \tau _ { h } ^ { ( t ) }$ , and $\tau \left( \tilde { \delta } ^ { ( t + 1 ) } \in S _ { l } \right) \ > \ \tau \left( \tilde { \delta } ^ { ( t ) } \in S _ { l } \right)$ if $\tau \left( \tilde { \delta } ^ { ( t ) } \in S _ { l } \right) \ < \ \tau \left( \tilde { \delta } ^ { ( t ) } \in S _ { h } \right)$ . For ReLU activation function, starting with $\tau ( \tilde { \delta } ^ { ( 0 ) } \ \in \ S _ { l } ) \ = \ 1 / 2 \ - \ \zeta$ and $\triangle \tau _ { l } ^ { ( 0 ) } ~ = ~ \triangle \tau _ { h } ^ { ( 0 ) } + b \zeta$ , we have $\begin{array} { r } { t _ { 0 } ~ = ~ \operatorname* { m a x } \bigg \{ 0 , - \frac { b \zeta } { n \eta \beta ^ { \prime } ( L _ { x } - H _ { x } ) } \bigg \} } \end{array}$ , where $\begin{array} { r } { n \ = \ \operatorname* { m i n } _ { t \in [ 0 , t _ { 0 } ] } \Vert \pmb { a } ^ { \prime ( t ) } \Vert ^ { 2 } } \end{array}$ l h . Besides, given such a network trained with at least $t _ { 0 }$ steps, there will be a $t _ { 1 } ~ > ~ t _ { 0 }$ such that $\triangle \tau _ { l } ^ { ( t _ { 1 } ) } \tau \left( \tilde { \pmb { \delta } } ^ { ( t _ { 1 } ) } \in S _ { h } \right) \ \geq$ $\triangle \tau _ { h } ^ { ( t _ { 1 } ) } \tau \left( \tilde { \delta } ^ { ( t _ { 1 } ) } \in S _ { l } \right)$ and FGM perturbation will increase its ratio of LFC for all $t > t _ { 1 }$ no matter whether it is smaller than $1 / 2$ . Finally, if $\tau \left( \tilde { \pmb \delta } ^ { ( t _ { 2 } ) } \in S _ { l } \right) > \tau \left( \tilde { \pmb \delta } ^ { ( t _ { 2 } ) } \in S _ { h } \right)$ for some $t _ { 2 } > t _ { 0 }$ , this relation will hold for any $t \geq t _ { 2 }$ . + +# 3.2 HIGH-FREQUENCY CONCENTRATION FOR LOG-SPECTRUM DIFFERENCE OFADVERSARIAL EXAMPLES + +In this subsection, we explore spectral trajectories of log-spectrum difference of $l _ { 2 }$ FGM adversarial examples + +$$ +R _ { k } ^ { ( t ) } = \frac { \left| \widetilde { \nabla f } ^ { ( t ) } [ k ] \right| } { \left| \tilde { \mathbf { \ b { x } } } [ k ] \right| } \propto \frac { \left| \tilde { \mathbf { \delta } } ^ { ( t ) } [ k ] \right| } { \left| \tilde { \mathbf { \ b { x } } } [ k ] \right| } +$$ + +along normal training step $t$ as in Section 3.1 to study their HFC-concentration phenomenon. Since $\widehat { \nabla f } ^ { ( 0 ) } [ k ] |$ for a randomly initialized network (1) has no bias towards high frequency or low frequency while $| \tilde { \mathbf { x } } | \propto k ^ { - \alpha }$ , we adopt the following setting + +$$ +R _ { k } ^ { ( 0 ) } \propto k ^ { \alpha } +$$ + +without loss of generality and present below our result on the log-spectrum difference of the adversarial examples. + +Theorework in (Concent, for any log spectrum differewhich satisfies that $l _ { 2 }$ GM perturbatio, there exists a of the net-such that $( l )$ $k > k ^ { \prime } > 0$ $R _ { k } ^ { ( 0 ) } > R _ { k ^ { \prime } } ^ { ( 0 ) }$ $t ^ { \prime }$ $R _ { k } ^ { ( t ) } > R _ { k ^ { \prime } } ^ { ( t ) }$ for all $t < t ^ { \prime }$ steps of the normal training. For ReLU activation function, we have + +$$ +t ^ { \prime } = \frac { R _ { k } ^ { ( 0 ) } \cos ( \triangle \varphi _ { k } ^ { ( 0 ) } ) - R _ { k ^ { \prime } } ^ { ( 0 ) } \cos ( \triangle \varphi _ { k ^ { \prime } } ^ { ( 0 ) } ) } { \eta \beta \| \pmb { a } \| ^ { 2 } } , +$$ + +while if the initialization satisfies that $R _ { k } ^ { ( 0 ) } \cos ( \triangle \varphi _ { k } ^ { ( 0 ) } ) \leq R _ { k ^ { \prime } } ^ { ( 0 ) } \cos ( \triangle \varphi _ { k ^ { \prime } } ^ { ( 0 ) } )$ then $t ^ { \prime } = \infty$ + +The theorem shows that although $\tilde { \delta }$ itself can concentrate in the low frequency domain, it does not concentrate as dense in the low frequency domain as the inputs $\tilde { \pmb x }$ which obey the power law. Therefore, the log-spectrum difference (i.e. equivalent to spectrum of the ratio of the perturbation to the clean data) of adversarial examples will express a HFC-concentrated phenomenon instead (Fig.1). + +# 3.3 MASKING HFC OF THE ADVERSARIAL EXAMPLES TO IMPROVE ROBUSTNESS + +In this subsection, we compare the ratio of LFC of the adversarial perturbations $\tau ( \tilde { \delta } \in S _ { l } )$ and the ratio of LFC of original images $\tau ( \tilde { \mathbfit { x } } \in S _ { l } )$ . + +Theorem 3 (Comparison on the LFC ratio of clean data and perturbations) For $l _ { 2 }$ FGM perturbation of the two-layer neural network in $( l )$ , at the $t$ -th step of normal training, let $\zeta = \tau ( \tilde { \pmb { x } } \in$ $S l ) - \tau ( \tilde { \delta } ^ { ( 0 ) } \in S _ { l } ) > 0 ;$ , then we will have $\tau ( \tilde { \pmb \delta } ^ { ( t ) } \in S _ { l } ) < \tau ( \tilde { \pmb x } \in S _ { l } )$ for all $t > 0$ if the initilization of the netowrk satisfies that + +$$ +\triangle \tau _ { l } ^ { ( 0 ) } < \tau ( \tilde { \pmb { x } } \in S _ { l } ) ( \triangle \tau _ { l } ^ { ( 0 ) } + \triangle \tau _ { h } ^ { ( 0 ) } ) . +$$ + +Remark When both $\triangle \tau _ { l } ^ { ( 0 ) }$ and 4τ (0)h are positive, condition (12) states that the ratio of low frequency component of 4τ (0)l $\triangle \tau _ { l } ^ { ( 0 ) } + \triangle \tau _ { h } ^ { ( 0 ) }$ is smaller than that of clean data, which can be easily satisfied for a randomly initialized network. The ratio of LFC of the perturbations $\delta$ will be less than that of clean data $_ { \textbf { \em x } }$ if the condition Eq.(12) is satisfied for $l _ { 2 }$ FGM perturbations during the normal training process. Masking the HFC of an adversarial example $\boldsymbol { x } + \boldsymbol { \delta }$ will then erase more amount of the perturbation than that of the clean data which leads to a new ”not-perturbed-much” adversarial example. As a result, one can expect the improvement for robustness of the model, as demonstrated in Section 4.3 later. + +# 4 EXPERIMENT + +In this section, we conduct several experiments to validate our theoretical conclusions. + +Setup. We use the Resnet-32 (He et al., 2016), a fully connected network as the last layer and cross entropy loss, and train all the parameters on the CIFAR-10 dataset with Adam optimizer (Kingma & Ba, 2014). We use PGD-attack with $\epsilon = 8 / 2 5 5 , 4 0$ iterations and step size $\xi = 4 / 2 5 5$ . + +We supplement more experiments in Appendix C to fill the gap between our theory and more complicated settings: we use the MSE loss and keep other conditions unchanged to resolve the discrepancy of loss function; experiments to support our theorems on two-layer neural network with fixed outer-layer parameters are also provided. + +# 4.1 THE INCREASE OF LFC CONCENTRATION + +In this part, we empirically verify the theorem in Section 3.1, to show that adversarial perturbations gradually concentrate more in the low-frequency part of the spectrum during the training process. Consider a neural network with random initialization, each time before updating all the parameters of neural network, we randomly sample 100 images and apply the $l _ { 2 }$ FGM / PGD attack to them. For each iteration in PGD attack, we calculate their ratios of LFC and plot them in Fig. 2. It shows that the LFC ratios of the perturbations $\tau ( \tilde { \delta } \in S _ { l } )$ are gradually increasing along the normal training. + +![](images/2e93463d8b0d8af92c0f40e0e0bd8611a726e341e4e8e6b27f1e727f9ad9a6cb.jpg) +Figure 2: The LFC ratio of the adversarial perturbations in the training process. (a) The attack method is $l _ { 2 }$ FGM. (b) The attack method is $l _ { 2 }$ PGD + +![](images/cbb1802ab61a949a3797efad53a3fcb320cff34edb185c00f05d097a796bfc36.jpg) +Figure 3: The spectrum of adversarial perturbations. The first line is the original examples in CIFAR10 dataset. The second line is the spectrum of the adversarial perturbations corresponding to the above images. + +For a sufficiently trained neural network, we choose an image, use PGD-attack to obtain its adversarial examples and perturbations, and calculate its spectrum. We randomly select 10 images in the test set and show the original images and the spectrum of perturbations in Fig. 3. We also randomly select 1000 images in the test set and average their spectrum to show the expectation of the spectrum in Fig. 4(a). They show that the spectrum of adversarial perturbations are more concentrated in the low-frequency domain after a sufficient training. Ortiz-Jimenez et al. (2020) show that the distance to the boundary (margin) in different frequency bands is heavily dependent of the distribution used for training, which also supports our claims. + +![](images/9062280e264e63edf3fd6c84be714fa9e63fd8f5fd3ef29919592afe72ed4f54.jpg) +Figure 4: The expectation of: (a) the spectrum of adversarial perturbations; (b) the log-spectrum difference of adversarial examples. + +# 4.2 HFC CONCENTRATION OF LOG-SPECTRUM DIFFERENCE + +We first use PGD-attack to get the adversarial example of a image for a sufficiently trained neural network. We then make the log-spectrum of the original image and its adversarial example and calculate the difference of their log-spectrum (Fig.5). Fig.4(b) displays the expectation of the spectrum for 1000 random images in the test set. They both show that the log-spectrum difference of adversarial examples is generally concentrated around. + +![](images/62cba9a5793dd7b65128cce6b902985d67a27e37337aa637955d8d198e3786f2.jpg) +Figure 5: The log-spectrum difference of adversarial examples. In each $3 \times 2$ -image part, the first line is the original example, the adversarial example attacked by PGD in a normally trained Resnet-32 and the perturbation. The second line is the log-spectrum of the original example, the log-spectrum of the adversarial example and the difference of the two log-spectrum. + +# 4.3 LOW-PASS FILTER IMPROVES ROBUSTNESS + +In this part, we empirically show how a low-pass filter (which filters out HFC of the inputs) can improve the robustness of the model with a cheat sheet in the sense that the attacker does not know the existence of the filter while the model is aware of the frequency distribution of the gradient-based adversarial examples. + +The procedure of our low-pass filter basically has three steps: performing DFT on the inputs, then masking their high frequency components (set as 0) in the frequency domain and finally performing inverse DFT on them to give the desired inputs with only low frequency components preserved. + +We evaluate two types of accuracy. One is filtering the clean images out of high frequencies and feed them into the model to test accuracy, named as ”no-attack accuracy”. The other is firstly PGD-attacking the input images in the normally trained model, and then check the test accuracy of filtered adversarial images, called “PGD-attack accuracy”. + +Here, we use data augmentation to train the model to the best. We show the results in Fig. 6. As the cut-off increases, the no-attack accuracy gradually increases, and the PGD-attack accuracy first increases and then decreases. The highest robustness achieves $5 1 . 7 \%$ when the cut-off $k = 1 2$ and its robustness accuracy is $8 1 . 7 \%$ . And the normal accuracy (no filter, no attack) is $9 3 . 0 3 \%$ . We also adversarially train the model with PGD-attacks. Its normal accuracy is $79 \%$ and PGD-attack accuracy is $48 \%$ without the filtering. Our low-pass filter model not only performs better on both no-attack accuracy and PGD-attack accuracy, but also does not need computationally expensive adversarial training. + +![](images/b0219b4fea00bd34d29e889814dc51c667590f4626cc6d8d512b5793bb802d50.jpg) +Figure 6: Normally trained model’s performance and robustness after a low-pass filter with cut-off from 1 to 22. + +Theorem 3 provides a reasonable explanation for the above results. When the cut-off is low, the filter masks most of the original image and the adversarial perturbation, so both of the no-attack and PGD-attack models perform not well. When the cut-off is proper, there remains enough information of original images but little of perturbations, so the PGD attacker cannot fool the model thoroughly. Therefore, with a suitable cut-off, the low-pass filter can indeed improve the model’s robustness without computationally expensive adversarial training. + +# 5 CONCLUSION + +We investigate the adversarial examples through the lens of frequency analysis. Our work both theoretically and empirically clarifies the definition of log-spectrum difference of the adversarial examples in existing literature. Besides, we devote to understanding the spectral trajectories of adversarial examples: $l _ { 2 }$ FGM perturbations gradually increase the concentration in the low-frequency part of the spectrum but their ratios of LFC will never exceed that of clean data during the training process over model parameters. Inspired by these findings, we find that a low-pass filter can improve the robustness of the model and give a reasonable explanation for this phenomenon. + +Future work can focus on analysis of other perturbations in the frequency domain such as FGSM and $l _ { \infty }$ PGD perturbations or providing theoretical understanding of the phenomenon that the ratio of the LFC of the perturbation for adversarially trained model is much higher than that for normally trained model (Appendix D). + +# REFERENCES + +Nicholas Carlini and David Wagner. Towards evaluating the robustness of neural networks. In 2017 ieee symposium on security and privacy (sp), pp. 39–57. IEEE, 2017. + +Xinyun Chen, Chang Liu, Bo Li, Kimberly Lu, and Dawn Song. Targeted backdoor attacks on deep learning systems using data poisoning. arXiv preprint arXiv:1712.05526, 2017. + +Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572, 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. + +Andrew Ilyas, Shibani Santurkar, Dimitris Tsipras, Logan Engstrom, Brandon Tran, and Aleksander Madry. Adversarial examples are not bugs, they are features. In Advances in Neural Information Processing Systems, pp. 125–136, 2019. + +Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. + +Alexey Kurakin, Ian Goodfellow, and Samy Bengio. Adversarial examples in the physical world. arXiv preprint arXiv:1607.02533, 2016. + +Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards deep learning models resistant to adversarial attacks. arXiv preprint arXiv:1706.06083, 2017. + +Takeru Miyato, Andrew M Dai, and Ian Goodfellow. Adversarial training methods for semisupervised text classification. arXiv preprint arXiv:1605.07725, 2016. + +Guillermo Ortiz-Jimenez, Apostolos Modas, Seyed-Mohsen Moosavi-Dezfooli, and Pascal Frossard. Hold me tight! influence of discriminative features on deep network boundaries. arXiv preprint arXiv:2002.06349, 2020. + +Yash Sharma, Gavin Weiguang Ding, and Marcus A Brubaker. On the effectiveness of low frequency perturbations. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 3389–3396. AAAI Press, 2019. + +Jiawei Su, Danilo Vasconcellos Vargas, and Kouichi Sakurai. One pixel attack for fooling deep neural networks. IEEE Transactions on Evolutionary Computation, 23(5):828–841, 2019. + +Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013. + +van A Van der Schaaf and JH van van Hateren. Modelling the power spectra of natural images: statistics and information. Vision research, 36(17):2759–2770, 1996. + +Haohan Wang, Xindi Wu, Zeyi Huang, and Eric P Xing. High-frequency component helps explain the generalization of convolutional neural networks. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 8684–8694, 2020a. + +Zifan Wang, Yilin Yang, Ankit Shrivastava, Varun Rawal, and Zihao Ding. Towards frequency-based explanation for robust cnn. arXiv preprint arXiv:2005.03141, 2020b. + +Chaowei Xiao, Bo Li, Jun-Yan Zhu, Warren He, Mingyan Liu, and Dawn Song. Generating adversarial examples with adversarial networks. arXiv preprint arXiv:1801.02610, 2018. + +Dong Yin, Raphael Gontijo Lopes, Jon Shlens, Ekin Dogus Cubuk, and Justin Gilmer. A fourier perspective on model robustness in computer vision. In Advances in Neural Information Processing Systems, pp. 13276–13286, 2019. + +# A PROOFS + +# A.1 PROOF OF THEOREM 1 + +According to (8), the update of $\tau ( \tilde { \delta } [ k ] )$ for $k$ -th frequency component of $l _ { 2 }$ norm FGM adversarial perturbation at the $( t + 1 )$ -th step is proportional to + +$$ +\begin{array} { r } { ( 1 - 2 \bar { \eta } _ { 2 } ^ { ( t ) } ) \lvert \widetilde { \nabla } f ^ { ( t ) } [ k ] \rvert ^ { 2 } - 2 \tilde { \eta } ^ { ( t ) } \lvert \widetilde { \nabla } f ^ { ( t ) } [ k ] \rvert | \tilde { x } [ k ] | \cos \left( \triangle \varphi _ { k } ^ { ( t ) } \right) . } \end{array} +$$ + +We adopt the following representations to see trends of $\cos \left( \triangle \varphi _ { k } ^ { ( t ) } \right)$ through the training process: + +$$ +\begin{array} { r l r } { { \widetilde { \nabla f } ^ { ( t ) } [ k ] : = \overrightarrow { c _ { ( t ) } } = ( | c _ { ( t ) } | \cos \theta , | c _ { ( t ) } | \sin \theta ) } } \\ & { } & { \tilde { x } [ k ] : = \overrightarrow { x _ { ( k ) } } = ( | x _ { ( k ) } | \cos \zeta , | x _ { ( k ) } | \sin \zeta ) , } \end{array} +$$ + +$| \widetilde { \nabla f } ^ { ( t + 1 ) } [ k ] | | \widetilde { \pmb { x } } [ k ] | \cos \left( \triangle \varphi _ { k } ^ { ( t ) } \right)$ will have the form of + +$$ +\left. \overrightarrow { c _ { ( t + 1 ) } } , \overrightarrow { x _ { ( k ) } } \right. = ( 1 - \bar { \eta } ^ { ( t ) } ) \left. \overrightarrow { c _ { ( t ) } } , \overrightarrow { x _ { ( k ) } } \right. - \tilde { \eta } ^ { ( t ) } | x _ { ( k ) } | ^ { 2 } + \mathcal { O } ( \eta ^ { 2 } ) +$$ + +at the $( t + 1 )$ -th step. At the $( t + 1 )$ -th step, we have + +$$ +\triangle \tau _ { l } ^ { ( t + 1 ) } - \triangle \tau _ { h } ^ { ( t + 1 ) } = ( 1 - \bar { \eta } ^ { ( t ) } ) ( \triangle \tau _ { l } ^ { ( t ) } - \triangle \tau _ { h } ^ { ( t ) } ) + \tilde { \eta } ^ { ( t ) } ( L _ { x } - H _ { x } ) , +$$ + +which means that if $\triangle \tau _ { l } ^ { ( t ) } > \triangle \tau _ { h } ^ { ( t ) }$ then we must have $\triangle \tau _ { l } ^ { ( t ^ { \prime } ) } > \triangle \tau _ { h } ^ { ( t ^ { \prime } ) }$ for all $t ^ { \prime } \geq t$ . Besides, l hthere must be a step which leads to this condition since $\begin{array} { r } { H ^ { ( t ) } = \sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } | \widetilde { \nabla f } [ k ] | ^ { 2 } } \end{array}$ . At the $( t + 1 )$ -th step, the changed amount of . Let $\begin{array} { r } { \ddot { L } ^ { ( t ) } = \sum _ { k = 0 } ^ { k _ { c } } | \widetilde { \nabla f } [ k ] | ^ { 2 } } \end{array}$ $\tau ( \tilde { \delta } \in S _ { l } )$ 0 f is and + +$$ +\begin{array} { r l } & { \frac { ( 1 - 2 \bar { \eta } ^ { ( t ) } ) L ^ { ( t ) } + \tilde { \eta } ^ { ( t ) } \bigtriangleup \tau _ { l } ^ { ( t ) } } { \big ( 1 - 2 \bar { \eta } ^ { ( t ) } \big ) \big ( L ^ { ( t ) } + H ^ { ( t ) } \big ) + \tilde { \eta } ^ { ( t ) } \big ( \bigtriangleup \tau _ { l } ^ { ( t ) } + \bigtriangleup \tau _ { h } ^ { ( t ) } \big ) } - \frac { L ^ { ( t ) } } { L ^ { ( t ) } + H ^ { ( t ) } } } \\ & { { = } \tilde { \eta } ^ { ( t ) } \frac { \bigtriangleup \tau _ { l } ^ { ( t ) } \tau \left( \tilde { \delta } ^ { ( t ) } \in S _ { h } \right) - \bigtriangleup \tau _ { h } ^ { ( t ) } \tau \left( \tilde { \delta } ^ { ( t ) } \in S _ { l } \right) } { \sum _ { k = 0 } ^ { ( d - 1 ) / 2 } | \widetilde { \nabla f } ^ { ( t + 1 ) } [ k ] | ^ { 2 } } . } \end{array} +$$ + +If $t ~ > ~ t _ { 0 }$ and $\tau \left( { \tilde { \delta } } ^ { ( t ) } \in S _ { h } \right) \ > \ \tau \left( { \tilde { \delta } } ^ { ( t ) } \in S _ { l } \right)$ then the above changed amount will be positive and gradient descent will increase $\tau \left( \tilde { \delta } \in S _ { l } \right)$ at this step. If $\begin{array} { r l } { \triangle \tau _ { l } ^ { ( t ) } \tau \left( \tilde { \pmb { \delta } } ^ { ( t ) } \in S _ { h } \right) } & { { } < } \end{array}$ $\triangle \tau _ { h } ^ { ( t ) } \tau \left( \tilde { \delta } ^ { ( t ) } \in S _ { l } \right)$ , then gradient descent will increase $\tau \left( \tilde { \delta } ^ { ( t ) } \in S _ { h } \right)$ untill the step $t _ { 1 }$ at which $\triangle \tau _ { l } ^ { ( t _ { 1 } ) } \tau \left( \tilde { \pmb \delta } ^ { ( t _ { 1 } ) } \in S _ { h } \right) \geq \triangle \tau _ { h } ^ { ( t _ { 1 } ) } \tau \left( \tilde { \pmb \delta } ^ { ( t _ { 1 } ) } \in S _ { l } \right)$ , then for any $t > t _ { 1 }$ , we have $\tau \left( \tilde { \delta } ^ { ( t + 1 ) } \in S _ { l } \right) >$ $\tau \left( \tilde { \delta } ^ { ( t ) } \in S _ { l } \right)$ . + +# A.2 PROOF OF THEOREM 2 + +We provide the proof for ReLU activation function for positive $e \tilde { t } a$ , the case for negative $\tilde { \eta }$ is similar. The update rules of $R _ { k }$ at the $( t + 1 )$ -th step are + +$$ +\begin{array} { r l r } & { } & { R _ { k } ^ { ( t + 1 ) 2 } = R _ { k } ^ { ( t ) 2 } - 2 \tilde { \eta } ^ { ( t ) } R _ { k } ^ { ( t ) } \cos \left( \triangle \varphi _ { k } ^ { ( t ) } \right) } \\ & { } & { R _ { k } ^ { ( t ) } \cos \left( \triangle \varphi _ { k } ^ { ( t ) } \right) = R _ { k } ^ { ( t - 1 ) } \cos \left( \triangle \varphi _ { k } ^ { ( t - 1 ) } \right) - \tilde { \eta } ^ { ( t - 1 ) } . } \end{array} +$$ + +$k > k ^ { \prime } > 0$ with $R _ { k } ^ { ( 0 ) } > R _ { k ^ { \prime } } ^ { ( 0 ) }$ , we have + +$$ +\begin{array} { c } { { R _ { k } ^ { ( t + 1 ) 2 } - R _ { k ^ { \prime } } ^ { ( t + 1 ) 2 } = R _ { k } ^ { ( t ) 2 } - R _ { k ^ { \prime } } ^ { ( t ) 2 } - 2 \tilde { \eta } ^ { ( t ) } \left[ R _ { k } ^ { ( t ) } \cos \left( \bigtriangleup \varphi _ { k } ^ { ( t ) } \right) - R _ { k ^ { \prime } } ^ { ( t ) } \cos \left( \bigtriangleup \varphi _ { k ^ { \prime } } ^ { ( t ) } \right) \right] } } \\ { { = R _ { k } ^ { ( 0 ) 2 } - R _ { k ^ { \prime } } ^ { ( 0 ) 2 } - 2 \displaystyle \sum _ { t ^ { \prime } = 0 } ^ { t } \tilde { \eta } ^ { ( t ^ { \prime } ) } \left[ R _ { k } ^ { ( 0 ) } \cos \left( \bigtriangleup \varphi _ { k } ^ { ( 0 ) } \right) - R _ { k ^ { \prime } } ^ { ( 0 ) } \cos \left( \bigtriangleup \varphi _ { k ^ { \prime } } ^ { ( 0 ) } \right) \right] } } \end{array} +$$ + +at the $( t + 1 )$ -th step. If $\begin{array} { r } { R _ { k } ^ { ( 0 ) } \cos \left( \triangle \varphi _ { k } ^ { ( 0 ) } \right) - R _ { k ^ { \prime } } ^ { ( 0 ) } \cos \left( \triangle \varphi _ { k ^ { \prime } } ^ { ( 0 ) } \right) > 0 } \end{array}$ , considering the case $\tilde { \eta } ^ { ( t ^ { \prime } ) } =$ $\tilde { \eta } _ { \mathrm { m a x } }$ for any $t ^ { \prime }$ and the condition that the left L.H.S of the above equation is larger than 0 gives us Eq.(11). On the other hand, if $\begin{array} { r } { R _ { k } ^ { ( 0 ) } \cos \left( \triangle \varphi _ { k } ^ { ( 0 ) } \right) - R _ { k ^ { \prime } } ^ { ( 0 ) } \cos \left( \triangle \varphi _ { k ^ { \prime } } ^ { ( 0 ) } \right) < 0 } \end{array}$ , then $R _ { k } ^ { ( t ) } > R _ { k ^ { \prime } } ^ { ( t ) }$ for all $t \geq 0$ . + +# A.3 PROOF OF THEOREM 3 + +We consider the case for $l _ { 2 }$ FGM perturbations with $\tilde { \eta } > 0$ , the case for negative $\tilde { \eta }$ is similar. Let the initialization of the network always satisfy the condition + +$$ +\frac { L ^ { ( 0 ) } } { L ^ { ( 0 ) } + H ^ { ( 0 ) } } = \tau ( \tilde { \delta } ^ { ( 0 ) } \in S _ { l } ) < \tau ( \tilde { { \pmb x } } \in S _ { l } ) = \frac { L _ { x } } { L _ { x } + H _ { x } } +$$ + +such that $\tau ( \tilde { \pmb { x } } \in S _ { l } ) - \tau ( \tilde { \pmb { \delta } } ^ { ( 0 ) } \in S _ { l } ) = \zeta > 0$ . Then at the $( t )$ -th step, we can express $\tau ( \tilde { \delta } ^ { ( 0 ) } \in S _ { l } )$ as follows + +$$ +\begin{array} { r l } & { \frac { L ^ { ( t ) } } { L ^ { ( t ) } + H ^ { ( t ) } } = \frac { L ^ { ( 0 ) } + \sum _ { t ^ { \prime } = 0 } ^ { t - 1 } \tilde { \eta } ^ { ( t ^ { \prime } ) } \bigtriangleup \tau _ { l } ^ { ( t ^ { \prime } ) } } { L ^ { ( 0 ) } + H ^ { ( 0 ) } + \sum _ { t ^ { \prime } = 0 } ^ { t - 1 } \tilde { \eta } ^ { ( t ^ { \prime } ) } \big ( \triangle \tau _ { h } ^ { ( t ^ { \prime } ) } + \triangle \tau _ { l } ^ { ( t ^ { \prime } ) } \big ) } } \\ & { \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad L ^ { ( 0 ) } + \sum _ { t ^ { \prime } = 0 } ^ { t - 1 } \tilde { \eta } ^ { ( t ^ { \prime } ) } \big ( \sum _ { t ^ { \prime \prime } = 0 } ^ { t ^ { \prime } } \tilde { \eta } ^ { ( t ^ { \prime \prime } ) } L _ { x } + \triangle \tau _ { l } ^ { ( 0 ) } \big ) } \\ & { \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad L ^ { ( 0 ) } + H ^ { ( 0 ) } + \sum _ { t ^ { \prime } = 0 } ^ { t - 1 } \tilde { \eta } ^ { ( t ^ { \prime } ) } \big ( \sum _ { t ^ { \prime \prime } = 0 } ^ { t ^ { \prime } } \tilde { \eta } ^ { ( t ^ { \prime \prime } ) } \big ( L _ { x } + H _ { x } \big ) + \big \triangleup \tau _ { l } ^ { ( 0 ) } + \triangle \tau _ { h } ^ { ( 0 ) } \big ) . } \end{array} +$$ + +Let + +$$ +a = \sum _ { t ^ { \prime } = 0 } ^ { t - 1 } \tilde { \eta } ^ { ( t ^ { \prime } ) } \sum _ { t ^ { \prime \prime } = 0 } ^ { t ^ { \prime } } \tilde { \eta } ^ { ( t ^ { \prime \prime } ) } L _ { x } , b = \sum _ { t ^ { \prime } = 0 } ^ { t - 1 } \tilde { \eta } ^ { ( t ^ { \prime } ) } \sum _ { t ^ { \prime \prime } = 0 } ^ { t ^ { \prime } } \tilde { \eta } ^ { ( t ^ { \prime \prime } ) } H _ { x } , c = \sum _ { t ^ { \prime } = 0 } ^ { t - 1 } \tilde { \eta } ^ { ( t ^ { \prime } ) } \triangle \tau _ { l } ^ { ( 0 ) } , d = \sum _ { t ^ { \prime } = 0 } ^ { t - 1 } \tilde { \eta } ^ { ( t ^ { \prime } ) } \triangle \tau _ { h } ^ { ( 0 ) } , +$$ + +then + +$$ +\frac { a } { a + b } = \tau ( \tilde { \pmb { x } } \in S _ { l } ) , \frac { c } { c + d } = \frac { \triangle \tau _ { l } ^ { ( 0 ) } } { \triangle \tau _ { l } ^ { ( 0 ) } + \triangle \tau _ { h } ^ { ( 0 ) } } +$$ + +and + +$$ +\begin{array} { r } { \frac { L ^ { ( t ) } } { L ^ { ( t ) } + H ^ { ( t ) } } = \frac { L ^ { ( 0 ) } + a + c } { L ^ { ( 0 ) } + H ^ { ( 0 ) } + a + b + c + d } } \\ { = \tau ( \tilde { \pmb { x } } \in S _ { l } ) \frac { 1 + \frac { c } { a } + \frac { L ^ { ( 0 ) } } { a } } { 1 + \frac { L ^ { ( 0 ) } + H ^ { ( 0 ) } } { a + b } + \frac { c + d } { a + b } } . } \end{array} +$$ + +If + +$$ +\begin{array} { c } { { \displaystyle \frac { c } { a } + \frac { L ^ { ( 0 ) } } { a } < \frac { L ^ { ( 0 ) } + H ^ { ( 0 ) } } { a + b } + \frac { c + d } { a + b } } } \\ { { \displaystyle \frac { c } { L ^ { ( 0 ) } + H ^ { ( 0 ) } } + \tau ( \tilde { \delta } ^ { ( 0 ) } \in S _ { l } ) < \tau ( \tilde { \pmb x } \in S _ { l } ) \left( 1 + \frac { c + d } { L ^ { ( 0 ) } + H ^ { ( 0 ) } } \right) } } \\ { { \triangle \tau _ { l } ^ { ( 0 ) } - \tau ( \tilde { \pmb x } \in S _ { l } ) ( \triangle \tau _ { l } ^ { ( 0 ) } + \triangle \tau _ { h } ^ { ( 0 ) } ) < \zeta \left( L ^ { ( 0 ) } + H ^ { ( 0 ) } \right) } } \end{array} +$$ + +then we must have + +$$ +\tau ( \tilde { \pmb \delta } ^ { ( t ) } \in S _ { l } ) < \tau ( \tilde { \pmb x } \in S _ { l } ) +$$ + +at the $t$ -th step. A stronger condition is that + +$$ +\triangle \tau _ { l } ^ { ( 0 ) } < \tau ( \tilde { \pmb { x } } \in S _ { l } ) ( \triangle \tau _ { l } ^ { ( 0 ) } + \triangle \tau _ { h } ^ { ( 0 ) } ) +$$ + +then we will have $\tau ( \tilde { \pmb { \delta } } ^ { ( t ) } \in S _ { l } ) < \tau ( \tilde { \pmb { x } } \in S _ { l } )$ for all $t$ . This condition approximately states that the ”ratio” of low frequency component of $\triangle \tau _ { l } ^ { ( 0 ) } + \triangle \tau _ { h } ^ { ( 0 ) }$ is smaller than that of clean data. + +# B $l _ { 2 }$ PGD PERTURBATIONS + +The PGD update rule for finding perturbations of $_ { \textbf { \em x } }$ with learning rate $\xi$ at step $j + 1$ is: + +$$ +\delta ^ { ( j + 1 ) } = { \mathcal { P } } _ { { \mathcal { B } } ( 0 , \epsilon ) } \left[ \delta ^ { ( j ) } + \xi \frac { \partial \ell } { \partial f } ^ { ( j ) } \nabla _ { x } f ^ { ( j ) } \right] , +$$ + +where $B ( 0 , \epsilon )$ is a ball centered at 0 with radius $\epsilon$ in Euclidean space and $\mathcal { P }$ is the projection operator defined as + +$$ +\mathcal { P } _ { B ( 0 , \epsilon ) } \left[ \delta \right] = \underset { \delta ^ { \prime } \in B ( 0 , \epsilon ) } { \mathrm { a r g m i n } } \| \delta ^ { \prime } - \delta \| ^ { 2 } . +$$ + +Note that in this part quantities removing the step script $j$ (e.g. $\frac { \partial \ell } { \partial f }$ and $\nabla _ { x } f$ ) refers to not involving perturbations. For convenience, we use the same learning rate $\xi$ for all steps $j$ and instead explore the update of + +$$ +\kappa ^ { ( j ) } = \frac { \delta ^ { ( j ) } } { \xi } +$$ + +to the order of $\delta$ to see trends of PGD perturbations in frequency domain alongside PGD iterations since $\tau ( \tilde { \delta } [ k ] ) = \tau ( \tilde { \kappa } [ k ] )$ . For ease of notation, we adopt the following representations: Let $\triangle \phi _ { k } ^ { ( j ) }$ denote the difference of phases between $\widetilde { \nabla f [ k ] }$ and $\tilde { \kappa } ^ { ( j ) } [ k ]$ ; l $\mathrm { ~ ~ \sf ~ { ~ \sf ~ * ~ } ~ } \bar { \beta } ^ { ( j ) } = \partial \ell / \partial f + \delta ^ { ( j ) } \cdot \nabla _ { \bf x } f$ where $\bar { \beta } ^ { ( 0 ) } > 0$ and one can drive similar results for $\bar { \beta } ^ { ( 0 ) } < 0$ ; we denote + +$$ +\begin{array} { r } { \displaystyle \Lambda \bar { \tau } _ { l } ^ { ( j ) } \triangleq 2 \sum _ { k = 0 } ^ { k _ { c } } | \tilde { \kappa } ^ { ( j ) } [ k ] | | \widetilde { \nabla f } [ k ] | \cos \left( \bigtriangleup \phi _ { k } ^ { ( j ) } \right) \mathrm { ~ a n d ~ } \bigtriangleup \bar { \tau } _ { h } ^ { ( j ) } \triangleq 2 \sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } | \tilde { \kappa } ^ { ( j ) } [ k ] | | \widetilde { \nabla f } [ k ] | \cos \left( \bigtriangleup \phi _ { k } ^ { ( j ) } \right) , } \end{array} +$$ + +where $\bar { \beta } ^ { ( j ) } \triangle \bar { \tau } _ { l } ^ { ( j ) }$ and $\bar { \beta } ^ { ( j ) } \triangle \bar { \tau } _ { h } ^ { ( j ) }$ are changed amounts of LFC and HFC of $| \kappa | ^ { 2 }$ at the $( j + 1 )$ - th step of PGD iteration. We provide below our results on frequency spectrum of -norm PGD perturbations. + +Theorem 4 (The spectral trajectory of $l _ { 2 }$ PGD perturbation) At the $( j + 1 )$ -th step of PGD, iteration of PGD will change the ratio of LFC of $l _ { 2 }$ norm PGD adversarial perturbation for a neural network $( l )$ which satisfies $| \partial \ell / \partial f | = \overset { \cdot } { \epsilon } ^ { 1 + \nu }$ with $0 < \nu < 1$ as follows, + +$$ +\tau ( \tilde { \pmb { \delta } } \in S _ { l } ) \gets \tau ( \tilde { \pmb { \delta } } \in S _ { l } ) + \bar { \beta } ^ { ( j ) } \frac { \triangle \bar { \tau } _ { l } ^ { ( j ) } \tau \left( \tilde { \pmb { \delta } } ^ { ( j ) } \in S _ { h } \right) - \triangle \bar { \tau } _ { h } ^ { ( j ) } \tau \left( \tilde { \pmb { \delta } } ^ { ( j ) } \in S _ { l } \right) } { \sum _ { k = 0 } ^ { ( d - 1 ) / 2 } | \tilde { \star } ^ { ( j + 1 ) } [ k ] | ^ { 2 } } . +$$ + +Remark If the two-layer neural network in (1) is trained with at least $t \geq t _ { 1 }$ steps $t _ { 1 }$ determined by theorem 1) such that $\tau ( \widetilde { \nabla f } \in S _ { l } ) > \tau ( \widetilde { \nabla f } \in S _ { h } )$ , then, according to theorem 4, there exists + +$$ +j _ { 0 } = \operatorname* { m a x } \left\{ 0 , \frac { \triangle \bar { \tau } _ { h } ^ { ( 0 ) } - \triangle \bar { \tau } _ { l } ^ { ( 0 ) } } { \tilde { \beta } \left( \sum _ { k = 0 } ^ { k = k _ { c } } | \widetilde { \nabla f } [ k ] | ^ { 2 } - \sum _ { k = k _ { c } } ^ { k = ( d - 1 ) / 2 } | \widetilde { \nabla f } [ k ] | ^ { 2 } \right) } \right\} , +$$ + +where $\tilde { \beta } = \mathrm { m a x } _ { i \in [ 0 , j _ { 0 } ] } \bar { \beta } ^ { ( i ) }$ , such that $\tau ( \tilde { \delta } ^ { ( j + 1 ) } \in S _ { l } ) > \tau ( \tilde { \delta } ^ { ( j ) } \in S _ { l } )$ for all $j > j _ { 0 }$ if $\tau ( \tilde { \delta } ^ { ( j ) } \in$ $S _ { l } ) < \tau ( \tilde { \delta } ^ { ( j ) } \in S _ { h } \bar { ) }$ . + +# B.1 PROOF OF THEOREM 4 + +At the $( \mathrm { j } + 1 )$ -th step of PGD update for $\kappa ^ { ( j + 1 ) }$ , if + +1. P (j) $\mathcal { P } _ { B ( 0 , \epsilon ) } ^ { ( j ) } = I$ + +$$ +\kappa ^ { ( j + 1 ) } = \kappa ^ { ( j ) } + \frac { \partial \ell } { \partial f } \nabla _ { x } f + \frac { \partial \ell } { \partial f } \sum _ { r } a _ { r } \sigma ^ { \prime \prime } \delta ^ { ( j ) } \cdot W _ { : , r } W _ { : , r } + \delta ^ { ( j ) } \cdot \nabla _ { x } f \nabla _ { x } f + \mathcal { O } ( \delta ^ { 2 } ) ; +$$ + +2. P (j) B(0,) 6= I : + +$$ +\pmb { \kappa } ^ { ( j + 1 ) } = \frac { \epsilon } { \| \pmb { \kappa } ^ { ( j ) } + \nabla _ { \pmb { x } } \ell ^ { ( j ) } \| } \left( \pmb { \kappa } ^ { ( j ) } + \frac { \partial \ell } { \partial f } ^ { ( j ) } \nabla _ { \pmb { x } } f ^ { ( j ) } \right) . +$$ + +In either case, the quantity $\tau ( \tilde { \kappa } [ k ] )$ is proportional to + +$$ +\left| \mathcal { F } \left( \kappa ^ { ( j ) } + \frac { \partial \ell } { \partial f } ^ { ( j ) } \nabla _ { \pmb { x } } f ^ { ( j ) } \right) \right| ^ { 2 } = \left| \mathcal { F } \left( \kappa ^ { ( j ) } + \frac { \partial \ell } { \partial f } \nabla _ { \pmb { x } } f + \delta ^ { ( j ) } \cdot \nabla _ { \pmb { x } } f \nabla _ { \pmb { x } } f \right) \right| ^ { 2 } +$$ + +since the term $\delta \partial \ell / \partial f < \delta ^ { 2 }$ and can be dropped. Therefore, we now consider + +$$ +\tilde { \kappa } ^ { ( j + 1 ) } [ k ] = \tilde { \kappa } ^ { ( j ) } [ k ] + \left( \frac { \partial \ell } { \partial f } + \delta ^ { ( j ) } \cdot \nabla _ { x } f \right) \widetilde { \nabla } f [ k ] +$$ + +at the $( j + 1 )$ -th step of PGD in the frequency domain to explore ratio of frequency $k$ to the whole frequency spectrum of perturbations + +$$ +\tau \left( \tilde { \delta } ^ { ( j + 1 ) } [ k ] \right) \propto | \tilde { \kappa } ^ { ( j ) } [ k ] | ^ { 2 } + 2 \left( \beta ^ { \prime } + \delta ^ { ( j ) } \cdot \nabla _ { x } f \right) | \tilde { \kappa } ^ { ( j ) } [ k ] | | \widetilde { \nabla f } [ k ] | \cos ( \bigtriangleup \phi _ { k } ^ { ( j ) } ) . +$$ + +Lemma 1 (Dynamics of $l _ { 2 }$ Norm PGD in the Frequency Domain) If the initialization of $l _ { 2 }$ norm PGD adversarial perturbation satisfies $\begin{array} { r } { \frac { \partial \ell } { \partial f } + \pmb { \delta } ^ { ( 0 ) } \cdot \nabla _ { \pmb { x } } ^ { * } f > \mathbf { \overset { . } { 0 } } } \end{array}$ , then it will be positive at every iteration of $P G D ^ { 3 }$ . + +Similar to Eq.(15), one can derive the changed amount of $\tau ( \tilde { \delta } \in S _ { l } )$ in theorem 4 at the $( j + 1 )$ -th step and find the necessary condition. + +# C SUPPLEMENTARY EXPERIMENT + +In this part, we present experiments on models with MSE loss and two-layer neural networks with fixed outer-layer parameters in Section 4. + +# C.1 MSE LOSS + +We show the supplementary experiment of Section 4.1 in Fig. 7 and Fig. 8. They have similar results to show that the spectrum of adversarial perturbations are more concentrated in the low-frequency domain after a sufficient training. + +![](images/9fcb1fb6c5ceecd016e1cd56f6f851dd26f63d03c9d93b2ebbdfe4cf43a4771e.jpg) +Figure 7: The difference of the spectrum between original and adversarial examples. The model are trained with MSE loss. + +Then we show the supplementary experiment of Section 4.2 in Fig. 9 and Fig. 10. They have similar results to show the log-spectrum difference of adversarial examples is generally concentrated around. + +In general, there is little empirical gap between MSE loss and CrossEntropy loss. + +![](images/8614ad2e36229fab0c1eaee197fd02a28b2653cae3d5e263aabf0dd3bd96ba80.jpg) + +![](images/edb9000a5dded652ee0c4c84c69810858aaf35c43edd08d0b243f8ba3f618afe.jpg) +Figure 8: The expectation of the spectrum of adversarial perturbations. The model are trained with MSE loss. + +![](images/ef4bb15c556334596d309ce25b86f8622cffcff8cdf1be9609791a9b7b0bbb2b.jpg) +Figure 9: The difference of the log-spectrum between original and adversarial examples. The model are trained with MSE loss. +Figure 10: The expectation of the log-spectrum of adversarial perturbations. The model are trained with MSE loss. + +# C.2 TWO-LAYER NEURAL NETWORK + +We use two-layer neural networks with fixed outer-layer parameters. The input layer is of size $3 * 3 2 * 3 2$ followed by a ReLU activation function, and the hidden layer is of size 500 followed by a sigmoid activation function. The dataset is still CIFAR10. We use random initialization and SGD optimizer without any training tricks. This setting can be used in practice and get higher than $40 \%$ test accuracy. The attack method is the same as the setup in Section 4. + +We show the LFC ratio of the adversarial perturbations during the training process in Fig.11. After sufficient training, we show the expectation of the spectrum in Fig.12(a) and the expectation of the log-spectrum difference in Fig.12(b). + +![](images/e44002f7f5522dc16adc33827c4d9dff228ddc6e5edc1fbd48b3a44c05e09e42.jpg) +Figure 11: The LFC ratio of the adversarial perturbations for two-layer neural networks in the training process. (a) The attack method is $l _ { 2 }$ FGM; (b) The attack method is $l _ { 2 }$ PGD. + +![](images/eeba38973e8de140b7941ad462156cdf97a2d14bb1b1f4992aec60a0e4f2bcb6.jpg) +Figure 12: For two-layer neural network, the expectation of: (a) the spectrum of adversarial perturbations; (Due to the large value gap between LFC and HFC, it is hard to see the trend in original result, so we show the logarithm of the result which will not change the size relationship.) (b) the log-spectrum difference of adversarial examples. + +# D PERTURBATIONS OF PGD-ATTACK ADVERSARIAL TRAINED MODEL ARE MORE CONCENTRATED IN LFC + +We do use the same setup in Section 4, and the PGD-attack adversarial training is also PGD-attack with $\epsilon = 8 / 2 5 5$ , 40 iterations and step size $\xi = 4 / 2 5 5$ in each training step. Then we test the ratio of LFC of original images, perturbations in a normally trained model and perturbations in a PGDattack adversarially trained model. The results are shown in Fig. 13. It shows that the LFC ratio of perturbations in PGD-attack adversarially trained model is generally higher than that in normally trained model. + +![](images/81106fbe707cbf3630dabacce730c50a19e85001c9a888f663a178edac7d1d37.jpg) +Figure 13: the ratio of LFC of original images, perturbations in a normally trained model and perturbations in a PGD-attack adversarially trained model \ No newline at end of file diff --git a/parse/train/D04TGKz5rfF/D04TGKz5rfF_content_list.json b/parse/train/D04TGKz5rfF/D04TGKz5rfF_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..429eb098163e686bfda5a8a16f60f6793cf3879c --- /dev/null +++ b/parse/train/D04TGKz5rfF/D04TGKz5rfF_content_list.json @@ -0,0 +1,2551 @@ +[ + { + "type": "text", + "text": "A FREQUENCY DOMAIN ANALYSIS OF GRADIENTBASED ADVERSARIAL EXAMPLES ", + "text_level": 1, + "bbox": [ + 176, + 101, + 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, + 236, + 544, + 251 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "It is well known that deep neural networks are vulnerable to adversarial examples. We attempt to understand adversarial examples from the perspective of frequency analysis. Several works have empirically shown that the gradient-based adversarial attacks perform differently in the low-frequency and high-frequency part of the input data. But there is still a lack of theoretical justification of these phenomena. In this work, we both theoretically and empirically show that the adversarial perturbations gradually increase the concentration in the low-frequency domain of the spectrum during the training process of the model parameters. And the log-spectrum difference of the adversarial examples and clean image is more concentrated in the high-frequency part than the low-frequency part. We also find out that the ratio of the high-frequency and the low-frequency part in the adversarial perturbation is much larger than that in the corresponding natural image. Inspired by these important theoretical findings, we apply low-pass filter to potential adversarial examples before feeding them to the model. The results show that this preprocessing can significantly improve the robustness of the model. ", + "bbox": [ + 233, + 265, + 764, + 472 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 496, + 336, + 512 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recently, deep neural networks (DNN) have achieved great success in the field of image processing, but it was found that DNNs are vulnerable to some synthetic data called adversarial examples ((Szegedy et al., 2013), (Kurakin et al., 2016)). Adversarial examples are natural samples plus adversarial perturbations, and the perturbations between natural samples and adversarial examples are imperceptible to human but able to fool the model. Typically, generating an adversarial example can be considered as finding an example in an $\\epsilon$ -ball around a natural image that could be misclassified by the classifier. Recent studies designed Fast Gradient Sign Method (FGSM, (Goodfellow et al., 2014)), Fast Gradient Method (FGM, (Miyato et al., 2016)), Projected Gradient Descent (PGD, (Madry et al., 2017)) and other algorithms (Carlini & Wagner (2017), (Su et al., 2019), (Xiao et al., 2018), (Kurakin et al., 2016), (Chen et al., 2017)) to attack the model. ", + "bbox": [ + 174, + 526, + 825, + 666 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Since the phenomenon of adversarial examples was discovered, many related works have made progress to study why they exist. Several works studied this phenomenon from the perspective of feature representation. Ilyas et al. (2019) divided the features into non-robust ones that are responsible for the model’s vulnerability to adversarial examples, and robust ones that are close to human perception. Further, they showed that adversarial vulnerability arises from non-robust features that are useful for correct classification. ", + "bbox": [ + 174, + 672, + 825, + 756 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Another way to characterize adversarial examples is to investigate them in the frequency domain via Fourier transform. Wang et al. (2020a) divided an image into low-frequency component (LFC) and high-frequency component (HFC) and they empirically showed that human can only perceive LFC, but convolutional neural networks can obtain useful information from both LFC and HFC. Yin et al. (2019) filters out the input data with low-pass or high-pass filters to study the sensitivity of the additive noise with different frequencies. Wang et al. (2020b) claimed that existing adversarial attacks mainly concentrate in the high-frequency part. Sharma et al. (2019) found that when perturbations are constrained to the low-frequency subspace, they are generated faster and are more transferable, and will be effective to fool the defended models, but not for clean models. ", + "bbox": [ + 174, + 763, + 825, + 888 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "All of these works showed that spectrum in frequency domain is an reasonable way to study the adversarial examples. ", + "bbox": [ + 174, + 895, + 823, + 924 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "However, there is a lack of theoretical understanding about the dynamics of the adversarial perturbations in frequency domain along the training process of the model parameters. In this work, we focus on the frequency domain of the adversarial perturbations to explore the spectral properties of the adversarial examples generated by FGM (Miyato et al., 2016) and PGD (Madry et al., 2017). ", + "bbox": [ + 174, + 103, + 825, + 160 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this work, we give a theoretical analysis in frequency domain of natural images for the adversarial examples. ", + "bbox": [ + 173, + 166, + 823, + 194 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• For a two-layer neural network with non-linear activation function, we prove that adversarial perturbations by FGM and $l _ { 2 }$ -PGD attacks gradually increase the concentration in the low-frequency part of the spectrum during the training process over model parameters. Meanwhile, the log-spectrum difference of the adversarial examples (the definition will be clarified in Section 2.2) will be more concentrated in the high-frequency part than the low-frequency part. • Furthermore, we show that the ratio of the high-frequency and the low-frequency part in the adversarial perturbation is much larger than that in the corresponding clean image. ", + "bbox": [ + 215, + 207, + 825, + 332 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Empirically, ", + "bbox": [ + 174, + 343, + 254, + 358 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• we design several experiments on the two-layer model and Resnet-32 with CIFAR-10 to verify the above findings. Based on these phenomena, we filter out the high-frequency part of the adversarial examples before feeding them to the model to improve the robustness. Compared with the adversarially trained model with the same architecture, our method achieves comparable robustness with the similar computational cost of normal training and almost no loss of accuracy. ", + "bbox": [ + 214, + 369, + 825, + 473 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The rest of the paper is organized as follows: In Section 2, we present preliminaries and some theoretical analysis on the calculation of the spectrum and log-spectrum. Then we provide our main results about the frequency domain analysis of gradient-based adversarial examples in Section 3. Furthermore, some experiments for supporting our theoretical findings are shown in Section 4. Finally we conclude our work and conduct a discussion about the future work in Section 5. All the details about the proof and experiments are shown in the Appendix. ", + "bbox": [ + 173, + 486, + 825, + 569 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 BACKGROUND ", + "text_level": 1, + "bbox": [ + 176, + 589, + 326, + 606 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2.1 PRELIMINARIES ", + "text_level": 1, + "bbox": [ + 174, + 622, + 326, + 636 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Notations We use $\\{ 0 , 1 , . . . , d \\}$ to denote the set of all integers between 0 and $d$ and use $\\| \\cdot \\| _ { p }$ to denote $l _ { p }$ norm. Specifically, we denote by $\\| \\cdot \\|$ the $l _ { 2 }$ norm. For a $d$ -dimensional vector $_ { \\textbf { \\em x } }$ , we use $x _ { \\mu }$ to denote its $\\mu$ -th component with index starting at 0. For a scalar function $f ( { \\pmb x } )$ $) \\colon { \\mathbb { R } ^ { d } } \\mapsto { \\mathbb { R } }$ , $\\nabla _ { \\pmb { x } } f$ and $\\partial _ { \\mu } f$ denote the gradient vector and its $\\mu$ -th component. We let $\\operatorname { s g n } ( x ) = 1$ for $x > 0$ and $- 1$ for $x < 0$ . Normal training refers to training on the original training data for learning the optimal weights for the neural networks. $\\tilde { { \\pmb x } } = \\mathcal { F } ( { \\pmb x } )$ denotes the Discrete Fourier Transform (DFT) of $_ { \\textbf { \\em x } }$ . ", + "bbox": [ + 173, + 647, + 825, + 734 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Discrete Fourier Transform The $k$ -th frequency component $\\tilde { g } [ k ]$ of one-dimensional DFT of a vector $\\textbf { { g } }$ is defined by ", + "bbox": [ + 173, + 750, + 821, + 779 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/26f2f5291fe3a9a9e8a2de0776ab882b86ceba2872be6ba90d61568686ff97ae.jpg", + "text": "$$\n\\tilde { g } [ k ] = \\mathcal { F } ( g ) [ k ] = \\sum _ { \\mu = 0 } ^ { d - 1 } g _ { \\mu } e ^ { i k \\frac { 2 \\pi } { d } \\mu } ,\n$$", + "text_format": "latex", + "bbox": [ + 387, + 777, + 607, + 823 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "where $k \\in \\{ - d / 2 , - d / 2 + 1 , . . . , d / 2 \\}$ if $d$ is even and $k \\in \\{ - ( d - 1 ) / 2 , . . . , ( d - 1 ) / 2 \\}$ if $d$ is odd. For convenience, we always consider an odd $d$ and one can easily generalize the case to even dimensions. For an integer cut-off (cutoff frequency) $k _ { r } \\in ( 0 , ( d - 1 ) / 2 )$ , the Low Frequency Components (LFC) and High Frequency Components (HFC) of $\\tilde { g }$ are denoted by ", + "bbox": [ + 174, + 825, + 825, + 883 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/4a5841e2b1d3d538e41d2eae04dc8755693ce3e0fa798d2a02a6320735805568.jpg", + "text": "$$\n\\begin{array} { r } { \\tilde { g } _ { l } [ k ] = \\left\\{ \\begin{array} { l l } { \\tilde { g } [ k ] } & { \\mathrm { i f } - k _ { c } \\leq k \\leq k _ { c } , } \\\\ { 0 } & { \\mathrm { o t h e r w i s e } } \\end{array} \\right. \\quad \\tilde { g } _ { h } [ k ] = \\left\\{ \\begin{array} { l l } { 0 } & { \\mathrm { i f } - k _ { c } \\leq k \\leq k _ { c } , } \\\\ { \\tilde { g } [ k ] } & { \\mathrm { o t h e r w i s e } . } \\end{array} \\right. } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 250, + 892, + 743, + 928 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Then the frequency space $\\mathbb { R } ^ { d }$ can be decomposed as $S _ { l } \\oplus S _ { h }$ where $\\tilde { g } _ { l } \\in S _ { l }$ and $\\tilde { g } _ { h } \\in S _ { h }$ . Let $N _ { \\tilde { g } } =$ $\\sqrt { \\Sigma _ { k = - d / 2 } ^ { d / 2 } | \\tilde { g } [ k ] | ^ { 2 } }$ , then the ratio of a frequency component with respect to the whole frequency spectrum is denoted by ", + "bbox": [ + 173, + 102, + 825, + 155 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/097816deebae36dec376f4d7b1da863aab21a06f1ebb9949ad9d75aaad6c383f.jpg", + "text": "$$\n\\tau ( \\tilde { g } [ k ] ) = \\frac { | \\tilde { g } [ k ] | ^ { 2 } } { N _ { \\tilde { g } } ^ { 2 } }\n$$", + "text_format": "latex", + "bbox": [ + 437, + 154, + 560, + 191 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "and the ratio of LFC is denoted by ", + "bbox": [ + 174, + 193, + 400, + 208 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/b49293c9ef4b82199ce4dd3df6371975a74e8eb2b6b210a4a29710a72f0f9098.jpg", + "text": "$$\n\\tau ( \\tilde { g } \\in S _ { l } ) = \\sum _ { k = - k _ { c } } ^ { k _ { c } } \\frac { | \\tilde { g } [ k ] | ^ { 2 } } { N _ { \\tilde { g } } ^ { 2 } } .\n$$", + "text_format": "latex", + "bbox": [ + 405, + 215, + 591, + 261 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Setup In this paper, we consider a two-layer neural network $f : \\mathbb { R } ^ { d } \\mapsto \\mathbb { R }$ ", + "bbox": [ + 171, + 275, + 665, + 291 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/53e7f13c5e727eac435536c12c93ec658e33d0e7b63a7618b99ba17f9a2f9dd0.jpg", + "text": "$$\nf ( \\pmb { x } , \\pmb { \\theta } ) = \\sum _ { r = 1 } ^ { m } a _ { r } \\sigma ( \\pmb { w } _ { r } ^ { T } \\pmb { x } )\n$$", + "text_format": "latex", + "bbox": [ + 411, + 297, + 588, + 339 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $\\sigma$ is an activation function, $\\mathbf { \\boldsymbol { a } } = ( a _ { 1 } , a _ { 2 } , . . . , a _ { m } ) ^ { T }$ is an $m$ -dimensional vector and ${ \\pmb w } _ { r }$ ’s are $d$ -dimensional weight vectors. ", + "bbox": [ + 174, + 345, + 825, + 376 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Van der Schaaf & van Hateren (1996) showed that natural images obey a power law in the frequency domain. Therefore, to make our settings closer to widely studied image related tasks, we also assume our input $_ { \\textbf { \\em x } }$ obey the power law ", + "bbox": [ + 173, + 381, + 825, + 424 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/38d217e7b96362db6f810624ee737caa6a055ee49c50ece4238d9c1b6a542e6b.jpg", + "text": "$$\n| \\tilde { \\mathbf { x } } [ k ] | \\propto k ^ { - \\alpha }\n$$", + "text_format": "latex", + "bbox": [ + 452, + 421, + 544, + 440 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "to imitate LFC-concentrated images, where the constant $\\alpha \\geq 1$ and $| \\tilde { \\pmb { x } } [ 0 ] | = \\alpha _ { 0 }$ is another constant. Besides, we choose the cut-off $k _ { c }$ in such a way that ", + "bbox": [ + 171, + 443, + 821, + 472 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/d685ce0e88aa3c1da1c02d96abdfc4cba2f5c3de009bd4aeb12fed94d0d81fe4.jpg", + "text": "$$\n\\sum _ { k = 1 } ^ { k _ { c } } \\frac { 1 } { k ^ { 2 \\alpha } } + \\alpha _ { 0 } ^ { 2 } > \\sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } \\frac { 1 } { k ^ { 2 \\alpha } } ,\n$$", + "text_format": "latex", + "bbox": [ + 397, + 478, + 599, + 525 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "which indicates that $\\tau ( \\tilde { \\pmb { x } } \\in S _ { l } ) > \\tau ( \\tilde { \\pmb { x } } \\in S _ { h } )$ and can be easily satisfied for a small $k _ { c }$ ", + "bbox": [ + 174, + 531, + 738, + 547 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Gradient-based adversarial attack For a loss function $\\ell$ , we find $l _ { p }$ -norm $\\epsilon$ -bounded adversarial perturbations by solving the optimization problem ", + "bbox": [ + 173, + 561, + 825, + 592 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/ca379d2c73cbc2594461e25ccbca7389a649ad5759050be5f4dda312497b1994.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\| \\pmb { \\delta } \\| _ { p } \\leq \\epsilon } \\ell ( f ( \\pmb { x } + \\pmb { \\delta } ) , y ) ,\n$$", + "text_format": "latex", + "bbox": [ + 423, + 597, + 571, + 625 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $( \\pmb { x } , y ) \\in \\mathbb { R } ^ { d } \\times \\mathbb { R }$ is $d$ -dimensional input and output following the joint distribution $\\mathcal { D }$ . ", + "bbox": [ + 171, + 632, + 779, + 648 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To solve the above optimization problem, Goodfellow et al. (2014) proposed FGSM, an attack for an $l _ { \\infty }$ -bounded adversary, and computed an adversarial example as $\\begin{array} { r } { \\pmb { x } _ { \\mathrm { a d v } } = \\pmb { x } + \\epsilon \\mathrm { s g n } \\left( \\nabla _ { \\pmb { x } } \\ell ( \\theta , \\pmb { x } , y ) \\right) } \\end{array}$ . Miyato et al. (2016) proposed FGM with an l2-bounded adversary, xadv = x + \u000f ∇x\\`(x,y)k∇x\\`(x,y)k2 . Madry et al. (2017) introduced PGD which training adversarial examples in an iterative way that $\\boldsymbol { x } ^ { t + 1 } =$ Πx+S (xt + α sgn (∇x\\`(θ, x, y))) or xt+1 = Πx+S (xt + α ∇x\\`(x,y)k∇x\\`(x,y)k2 ) ", + "bbox": [ + 173, + 652, + 826, + 739 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To simplify the analysis, we make the following assumptions on the normal training process: ", + "bbox": [ + 168, + 744, + 781, + 761 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Assumption 1 There exist $\\beta ^ { \\prime } , \\beta > 0$ such that $\\beta ^ { \\prime } \\leq | \\partial \\ell / \\partial f | \\leq \\beta .$ . ", + "bbox": [ + 173, + 770, + 609, + 787 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Assumption 2 If $\\begin{array} { r } { \\ell = \\frac { 1 } { 2 } \\left( y - f ( \\pmb { x } , \\pmb { \\theta } ) \\right) ^ { 2 } } \\end{array}$ , $\\vert \\partial \\ell / \\partial f \\vert$ should be a small quantity such that $\\vert \\partial \\ell / \\partial f \\vert =$ $\\epsilon ^ { 1 + v }$ if the network is well trained in the end stage of normal training, where $0 < v < 1$ . ", + "bbox": [ + 173, + 799, + 825, + 833 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Assumption 3 There exist $\\lambda , \\gamma > 0$ such that $0 \\leq \\sigma ^ { \\prime } \\leq \\lambda$ and $0 \\leq \\sigma ^ { \\prime \\prime } \\leq \\gamma ^ { 1 }$ . ", + "bbox": [ + 173, + 844, + 676, + 862 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Assumption 4 $a _ { r }$ ’s are i.i.d drawn from a distribution2 and will not be updated during the training. ", + "bbox": [ + 173, + 872, + 821, + 888 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Wang et al. (2020a) considered the log-spectrum of an image: $2 0 * \\log \\left( | \\mathcal { F } ( \\pmb { x } ) | \\right)$ , where $_ { \\textbf { \\em x } }$ is a $2 d$ - dimensional matrix representing an image. One way to calculate the ”log-spectrum difference of the adversarial examples” is to consider the difference between the log-spectrum of the adversarial and natural image and as follows, ", + "bbox": [ + 173, + 128, + 826, + 185 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/107db76e3cd2e39e91cc040f62d145e0ee608daad3ee41e519d90c5202e9f4c5.jpg", + "text": "$$\n2 0 * \\left| \\log ( | \\mathcal { F } ( \\mathbf { x } + \\delta ) | ) - \\log ( | \\mathcal { F } ( \\mathbf { x } ) | ) \\right| \\approx 2 0 * \\left| \\log ( 1 + \\frac { | \\mathcal { F } ( \\delta ) | } { | \\mathcal { F } ( \\mathbf { x } ) | } ) \\right| \\approx 2 0 * \\frac { | \\mathcal { F } ( \\delta ) | } { | \\mathcal { F } ( \\mathbf { x } ) | } .\n$$", + "text_format": "latex", + "bbox": [ + 230, + 202, + 766, + 237 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We can observe that this quantity is approximately proportional to the ratio of the perturbation’s over the natural image’s frequency. Moreover, the average Relative Change in discrete cosine Transforms (RCT) in (Wang et al., 2020b)) approximately equals to it. Fig. 5 empirically shows that this ratio is large for high frequency component but small for low frequency one. However, Van der Schaaf & van Hateren (1996) claimed that the LFC of $\\mathcal { F } ( x )$ is much bigger than its HFC, and the right side of Eq. 3 is inversely proportional to $\\mathcal { F } ( x )$ . The denominator of the right side of Eq.(3) in low-frequency part is much larger than it in high frequency part, so it may be imprudent to consider the frequency distribution of the adversarial perturbations only based on the ratio in the right side of Eq.(3). ", + "bbox": [ + 173, + 236, + 825, + 361 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Yin et al. (2019) provided another spectral measurement for adversarial examples. They considered the ”spectrum of the adversarial perturbation” $| \\mathcal { F } ( \\delta ) |$ , which directly reflects the distribution of adversarial perturbations in the frequency domain. Unfortunately, they claimed that ‘The adversarial perturbations for the normally trained model are uniformly distributed across frequency components’ without sufficient empirical and theoretical justification. In this work, we provide a totally different theoretical finding that the adversarial perturbations for the normally trained model are gradually concentrated in the low-frequency domain, further verified by extensive experiments. ", + "bbox": [ + 173, + 367, + 825, + 465 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Fig. 1 visually shows the calculation methods of the spectrum of perturbations $\\mathcal { F } ( \\delta )$ and the logspectrum difference of adversarial examples $\\begin{array} { r } { | \\log ( | \\mathcal { F } ( \\pmb { x } + \\pmb { \\delta } ) | ) - \\log ( | \\mathcal { F } ( \\pmb { x } ) | \\approx \\frac { | \\mathcal { F } ( \\pmb { \\delta } ) | } { | \\mathcal { F } ( \\pmb { x } ) | } } \\end{array}$ . ", + "bbox": [ + 173, + 472, + 823, + 506 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 MAIN RESULTS ", + "text_level": 1, + "bbox": [ + 176, + 522, + 334, + 539 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In Section 3.1, we show that, for a well trained two-layer neural network described in Eq.(1) with LFC-concentrated inputs, $l _ { 2 }$ - norm adversarial perturbations generated by FGM (Theorem 1) prefer to concentrate in the low frequency domain. Section 3.2 theoretically proves the HFC-concentration of the logspectrum difference of adversarial examples. Section 3.3 attempts to demonstrate the effectiveness of masking the HFC of the adversarial examples to improve model’s robustness despite that perturbations can concentrate in the low frequency domain. All technical proofs are deferred to Appendix A. Results on $l _ { 2 }$ PGD perturbations are presented in Appendix B. ", + "bbox": [ + 174, + 553, + 483, + 762 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this work, we consider the two-layer neural networks and the loss function $\\ell \\_ =$ ${ \\scriptstyle { \\frac { 1 } { 2 } } } \\left( y - f ( \\pmb { x } , \\pmb { \\theta } ) \\right) ^ { 2 }$ . For any $_ { \\textbf { \\em x } }$ in this setting, we have ", + "bbox": [ + 173, + 768, + 483, + 824 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/d3c0d25cbc98ca92bd12dad216ecbfb809fad3fbbe5e349cd1667cef31bf97e6.jpg", + "text": "$$\n\\frac { \\partial f } { \\partial a _ { r } } = \\sigma ( { \\boldsymbol { w } } _ { r } ^ { T } { \\boldsymbol { \\mathbf { x } } } ) , \\quad \\frac { \\partial f } { \\partial { \\boldsymbol { w } } _ { r } } = a _ { r } ^ { \\prime } { \\boldsymbol { \\mathbf { x } } } , \\quad \\nabla _ { \\boldsymbol { x } } f = \\sum _ { r } a _ { r } ^ { \\prime } { \\boldsymbol { w } } _ { r } ,\n$$", + "text_format": "latex", + "bbox": [ + 173, + 821, + 535, + 859 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/518c8129a3aad49e7ddff8a6ab8bab8f2cd9a72478b926222aaf34b8041fa0de.jpg", + "image_caption": [ + "Figure 1: Visualization of spectrum and logspectrum for adversarial attacks . Section 3.1 focuses on the center picture $\\mathcal { F } ( \\delta )$ to prove that the LFC ratio of $\\mathcal { F } ( \\delta )$ is increasing. Section 3.2 focuses on the third-line center picture $\\vert \\log ( \\vert \\mathcal { F } ( x +$ $\\delta ) | ) - \\log ( | \\mathcal { F } ( x | ) |$ , and shows that its LFC is smaller than its HFC. " + ], + "image_footnote": [], + "bbox": [ + 532, + 568, + 787, + 718 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $a _ { r } ^ { \\prime } = a _ { r } \\sigma ^ { \\prime } ( \\pmb { w } _ { r } ^ { T } \\pmb { x } )$ and $\\pmb { a } ^ { \\prime } = ( a _ { 1 } ^ { \\prime } , a _ { 2 } ^ { \\prime } , . . . , a _ { m } ^ { \\prime } )$ . At the $( t + 1 )$ -th step of gradient descent in the normal training process of the classifier, weight $\\pmb { w }$ is updated as ", + "bbox": [ + 174, + 862, + 821, + 891 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/79ec57c94c33a9a386eb1ece9d87f10338a5344a04a7ee427c682c6f88755ce3.jpg", + "text": "$$\n\\pmb { w } _ { r } ^ { ( t + 1 ) } = \\pmb { w } _ { r } ^ { ( t ) } - \\eta \\frac { \\partial \\ell } { \\partial f } ^ { ( t ) } a _ { r } ^ { \\prime ( t ) } \\pmb { x } .\n$$", + "text_format": "latex", + "bbox": [ + 392, + 892, + 606, + 929 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We use $L _ { x }$ and $H _ { x }$ to denote the LFC and HFC of the clean input ", + "bbox": [ + 173, + 102, + 606, + 118 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/ce851af7975fcd672b3f83ed03307a640ee92609d77109f815a4ddc54a38c531.jpg", + "text": "$$\nL _ { x } = \\sum _ { k = 0 } ^ { k _ { c } } | \\tilde { \\pmb { x } } [ k ] | ^ { 2 } \\mathrm { a n d } H _ { x } = \\sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } | \\tilde { \\pmb { x } } [ k ] | ^ { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 352, + 121, + 643, + 167 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.1 SPECTRAL TRAJECTORIES OF $l _ { 2 }$ -NORM FGM PERTURBATIONS ", + "bbox": [ + 173, + 180, + 642, + 195 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Consider the $l _ { 2 }$ -norm FGM perturbation $\\delta$ and its DFT $\\tilde { \\delta } [ k ]$ ", + "bbox": [ + 174, + 207, + 566, + 223 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/823da96088d6c55c197f14ef5279f1a9555bc3d836bf0bee95a19e9b3923eed6.jpg", + "text": "$$\n\\delta = \\epsilon \\frac { \\frac { \\partial \\ell } { \\partial f } \\nabla _ { \\pmb { x } } f } { \\big \\| \\frac { \\partial \\ell } { \\partial f } \\nabla _ { \\pmb { x } } f \\big \\| } , \\quad \\tilde { \\delta } [ k ] = \\epsilon \\mathrm { s g n } \\left( \\frac { \\partial \\ell } { \\partial f } \\right) \\frac { 1 } { \\big \\| \\nabla _ { \\pmb { x } } f \\big \\| } \\widetilde { \\nabla } f [ k ] ,\n$$", + "text_format": "latex", + "bbox": [ + 326, + 226, + 669, + 263 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\widetilde { \\nabla f } [ k ] = \\mathcal { F } \\left( \\nabla _ { x } f \\right) [ k ]$ . Since the coefficient before $\\widetilde { \\nabla f } [ \\boldsymbol { k } ]$ in (6) is same for different frequencies $k$ , we only need to analyze the spectrum of $\\widetilde { \\nabla f [ k ] }$ to investigate the ratio of certain frequency component over the whole frequency spectrum, i.e. ", + "bbox": [ + 173, + 273, + 825, + 323 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/09470e69a52a749536b729dbca49d9f02c1622e4f07db19584059d8f1329572a.jpg", + "text": "$$\n\\tau \\left( \\tilde { \\delta } [ k ] \\right) = \\tau \\left( \\widetilde { \\nabla f } [ k ] \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 416, + 324, + 581, + 352 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this subsection, we explore the evolving of $\\tau ( \\tilde { \\delta } [ k ] )$ along the normal training process. For a randomly initialized network, the FGM-attack perturbation will not have bias towards either HFC or LFC. We attack this model with FGM at each step of the normal training to study the trajectory of these perturbations in the frequency domain. According to Eq.(4), $\\nabla _ { x } f$ is updated to the order of $\\eta$ at the $( t + 1 )$ -th step as ", + "bbox": [ + 173, + 362, + 826, + 434 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/43d905e20e443fe489bfb9a46e83b9e28f326a1b47c71136a2a264f1e09769eb.jpg", + "text": "$$\n\\nabla _ { \\pmb { x } } f ^ { ( t + 1 ) } = \\sum _ { r = 1 } ^ { m } ( 1 - \\eta _ { r } ^ { ( t ) } ) a _ { r } ^ { \\prime ( t ) } \\pmb { w } _ { r } ^ { ( t ) } - \\tilde { \\eta } ^ { ( t ) } \\pmb { x } + \\mathcal { O } ( \\eta ^ { 2 } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 318, + 435, + 678, + 477 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\begin{array} { r } { \\eta _ { r } ^ { ( t ) } = \\eta a _ { r } \\| \\pmb { x } \\| ^ { 2 } \\frac { \\partial \\ell } { \\partial f } ^ { ( t ) } \\sigma ^ { \\prime \\prime ( t ) } ( \\pmb { w } _ { r } ^ { ( t ) T } \\pmb { x } ) } \\end{array}$ and $\\begin{array} { r } { \\tilde { \\eta } ^ { ( t ) } = \\eta \\frac { \\partial \\ell } { \\partial f } ^ { ( t ) } \\| \\pmb { a } ^ { \\prime ( t ) } \\| ^ { 2 } } \\end{array}$ are composite learning rates for easing our notation. For ReLU activation function $\\sigma ( x ) = \\operatorname* { m a x } ( 0 , x )$ , we have that $\\eta _ { r } ^ { ( t ) } = \\frac { } { }$ $\\mathbb { E } _ { i \\in \\{ 1 , 2 , \\dots , m \\} } [ \\eta _ { i } ^ { ( t ) } ]$ , therefore, considering that Softplus has similar shape as ReLU, we derive that $\\eta _ { r } ^ { ( t ) } = \\bar { \\eta } ^ { ( t ) } + \\mathcal { O } ( \\eta ^ { 2 } )$ , where $\\begin{array} { r } { \\bar { \\eta } ^ { ( t ) } = \\eta \\| \\pmb { x } \\| ^ { 2 } \\frac { \\partial \\ell } { \\partial f } ^ { ( t ) } \\mathbb { E } _ { r \\in \\{ 1 , 2 , \\ldots , m \\} } \\left[ a _ { r } \\sigma ^ { \\prime \\prime ( t ) } ( \\pmb { w } _ { r } ^ { ( t ) T } \\pmb { x } ) \\right] } \\end{array}$ . In this way, the $1 d$ -DFT of $\\nabla _ { \\pmb { x } } f ^ { ( t + 1 ) }$ has the following form, ", + "bbox": [ + 173, + 479, + 826, + 579 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/a19437da0b2ef43b1a5b0c039216168cf2c2fc859270649f1e5c819047ea84ba.jpg", + "text": "$$\n\\widetilde { \\nabla f } ^ { ( t + 1 ) } [ k ] = ( 1 - \\bar { \\eta } ^ { ( t ) } ) \\widetilde { \\nabla f } ^ { ( t ) } [ k ] - \\tilde { \\eta } ^ { ( t ) } \\tilde { x } [ k ] .\n$$", + "text_format": "latex", + "bbox": [ + 348, + 580, + 648, + 603 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We are now ready to study the trajectory of $\\tau ( \\tilde { \\delta } [ k ] )$ along the training step $t$ . Let $\\triangle \\varphi _ { k } ^ { ( t ) }$ denote the difference of phases between $\\widetilde { \\nabla f } ^ { ( t ) } [ k ]$ and ${ \\tilde { \\mathbf { x } } } [ k ]$ for frequency $k$ at the $t$ -th step. And for ease of notation, denote ", + "bbox": [ + 174, + 608, + 826, + 659 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/d00e405601e30e364e7b9208e6b62d1242a5d1cd4b7631a0d12fdafc901ca634.jpg", + "text": "$$\n\\triangle \\tau _ { l } ^ { ( t ) } \\triangleq - 2 \\sum _ { k = 0 } ^ { k _ { c } } \\vert \\widehat { \\nabla } f ^ { ( t ) } [ k ] \\vert | \\tilde { x } [ k ] | \\cos \\left( \\triangle \\varphi _ { k } ^ { ( t ) } \\right) , \\quad \\triangle \\tau _ { h } ^ { ( t ) } \\triangleq - 2 \\sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } \\vert \\widehat { \\nabla } f ^ { ( t ) } [ k ] \\vert | \\tilde { x } [ k ] | \\cos \\left( \\triangle \\varphi _ { k } ^ { ( t ) } \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 187, + 659, + 808, + 702 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\tilde { \\eta } ^ { ( t ) } \\triangle \\tau _ { l } ^ { ( t ) }$ and $\\tilde { \\eta } ^ { ( t ) } \\triangle \\tau _ { h } ^ { ( t ) }$ are approximately changed amounts for LFC and HFC of $| \\widetilde { \\nabla f } ^ { ( t ) } | ^ { 2 }$ at the $t$ -th step of the normal training of the network, respectively. Since the network is randomly initialized and the clean inputs $_ { \\textbf { \\em x } }$ are highly concentrated in the low frequency domain, we always study the case where $\\tau ( \\tilde { \\pmb \\delta } ^ { ( 0 ) } \\in S _ { l } ) < \\tau ( \\tilde { \\pmb x } \\in S _ { l } )$ . We now, taking Eq.(7) into consideration , present our main theorem about $l _ { 2 }$ norm FGM perturbations as follows. ", + "bbox": [ + 173, + 707, + 825, + 784 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Theorem 1 (The spectral trajectory of $l _ { 2 }$ FGM perturbation) During the training process of the two-layer neural network $f ( x )$ in $( l )$ , the $l _ { 2 }$ norm FGM adversarial perturbation will change its ratio of LFC, $\\tau ( \\tilde { \\delta } \\in S _ { l } )$ , at the $( t + 1 )$ -th step as follows, ", + "bbox": [ + 174, + 791, + 823, + 837 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/17eacb9e573b145cd568c2cd8dcdd68c81dc377166e1d8180e5fc53a013f248d.jpg", + "text": "$$\n\\tau ( \\tilde { \\pmb \\delta } ^ { ( t + 1 ) } \\in S _ { l } ) = \\tau ( \\tilde { \\pmb \\delta } ^ { ( t ) } \\in S _ { l } ) + \\tilde { \\eta } ^ { ( t ) } \\frac { \\Delta \\tau _ { l } ^ { ( t ) } \\tau \\left( \\tilde { \\pmb \\delta } ^ { ( t ) } \\in S _ { h } \\right) - \\bigtriangleup \\tau _ { h } ^ { ( t ) } \\tau \\left( \\tilde { \\pmb \\delta } ^ { ( t ) } \\in S _ { l } \\right) } { \\sum _ { k = 0 } ^ { ( d - 1 ) / 2 } | \\widetilde { \\nabla f } ^ { ( t + 1 ) } [ k ] | ^ { 2 } } ;\n$$", + "text_format": "latex", + "bbox": [ + 227, + 839, + 769, + 890 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "there will be a $t _ { 1 }$ s.t. $\\forall t \\geq t _ { 1 }$ , we have ", + "bbox": [ + 174, + 891, + 428, + 906 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/3ab081d2b07f93ec34c0d974dc0dcffad897d1d73c59c43b5bbc7d7638f7874a.jpg", + "text": "$$\n\\tau ( \\tilde { \\delta } ^ { ( t + 1 ) } \\in S _ { l } ) > \\tau ( \\tilde { \\delta } ^ { ( t ) } \\in S _ { l } ) .\n$$", + "text_format": "latex", + "bbox": [ + 393, + 906, + 604, + 925 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Remark According to theorem 1, during the normal training process for a randomly initialized network with LFC-concentrated input, there will be a $t _ { 0 }$ s.t. $\\forall t \\geq t _ { 0 }$ , we have $\\triangle \\tau _ { l } ^ { ( i ) } > \\triangle \\tau _ { h } ^ { ( t ) }$ , and $\\tau \\left( \\tilde { \\delta } ^ { ( t + 1 ) } \\in S _ { l } \\right) \\ > \\ \\tau \\left( \\tilde { \\delta } ^ { ( t ) } \\in S _ { l } \\right)$ if $\\tau \\left( \\tilde { \\delta } ^ { ( t ) } \\in S _ { l } \\right) \\ < \\ \\tau \\left( \\tilde { \\delta } ^ { ( t ) } \\in S _ { h } \\right)$ . For ReLU activation function, starting with $\\tau ( \\tilde { \\delta } ^ { ( 0 ) } \\ \\in \\ S _ { l } ) \\ = \\ 1 / 2 \\ - \\ \\zeta$ and $\\triangle \\tau _ { l } ^ { ( 0 ) } ~ = ~ \\triangle \\tau _ { h } ^ { ( 0 ) } + b \\zeta$ , we have $\\begin{array} { r } { t _ { 0 } ~ = ~ \\operatorname* { m a x } \\bigg \\{ 0 , - \\frac { b \\zeta } { n \\eta \\beta ^ { \\prime } ( L _ { x } - H _ { x } ) } \\bigg \\} } \\end{array}$ , where $\\begin{array} { r } { n \\ = \\ \\operatorname* { m i n } _ { t \\in [ 0 , t _ { 0 } ] } \\Vert \\pmb { a } ^ { \\prime ( t ) } \\Vert ^ { 2 } } \\end{array}$ l h . Besides, given such a network trained with at least $t _ { 0 }$ steps, there will be a $t _ { 1 } ~ > ~ t _ { 0 }$ such that $\\triangle \\tau _ { l } ^ { ( t _ { 1 } ) } \\tau \\left( \\tilde { \\pmb { \\delta } } ^ { ( t _ { 1 } ) } \\in S _ { h } \\right) \\ \\geq$ $\\triangle \\tau _ { h } ^ { ( t _ { 1 } ) } \\tau \\left( \\tilde { \\delta } ^ { ( t _ { 1 } ) } \\in S _ { l } \\right)$ and FGM perturbation will increase its ratio of LFC for all $t > t _ { 1 }$ no matter whether it is smaller than $1 / 2$ . Finally, if $\\tau \\left( \\tilde { \\pmb \\delta } ^ { ( t _ { 2 } ) } \\in S _ { l } \\right) > \\tau \\left( \\tilde { \\pmb \\delta } ^ { ( t _ { 2 } ) } \\in S _ { h } \\right)$ for some $t _ { 2 } > t _ { 0 }$ , this relation will hold for any $t \\geq t _ { 2 }$ . ", + "bbox": [ + 173, + 102, + 826, + 289 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.2 HIGH-FREQUENCY CONCENTRATION FOR LOG-SPECTRUM DIFFERENCE OFADVERSARIAL EXAMPLES", + "text_level": 1, + "bbox": [ + 176, + 303, + 727, + 332 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this subsection, we explore spectral trajectories of log-spectrum difference of $l _ { 2 }$ FGM adversarial examples ", + "bbox": [ + 176, + 342, + 823, + 371 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/3ba7d571360fed72a6ef071c2b3956ac7ba297423ca9bbf3edd2f119df1725ae.jpg", + "text": "$$\nR _ { k } ^ { ( t ) } = \\frac { \\left| \\widetilde { \\nabla f } ^ { ( t ) } [ k ] \\right| } { \\left| \\tilde { \\mathbf { \\ b { x } } } [ k ] \\right| } \\propto \\frac { \\left| \\tilde { \\mathbf { \\delta } } ^ { ( t ) } [ k ] \\right| } { \\left| \\tilde { \\mathbf { \\ b { x } } } [ k ] \\right| }\n$$", + "text_format": "latex", + "bbox": [ + 395, + 368, + 601, + 420 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "along normal training step $t$ as in Section 3.1 to study their HFC-concentration phenomenon. Since $\\widehat { \\nabla f } ^ { ( 0 ) } [ k ] |$ for a randomly initialized network (1) has no bias towards high frequency or low frequency while $| \\tilde { \\mathbf { x } } | \\propto k ^ { - \\alpha }$ , we adopt the following setting ", + "bbox": [ + 173, + 421, + 825, + 470 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/61943b33b589b8d0a9cad08288b282efa60d9379b68fc606370f7cc92f4dbe99.jpg", + "text": "$$\nR _ { k } ^ { ( 0 ) } \\propto k ^ { \\alpha }\n$$", + "text_format": "latex", + "bbox": [ + 462, + 474, + 535, + 496 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "without loss of generality and present below our result on the log-spectrum difference of the adversarial examples. ", + "bbox": [ + 176, + 500, + 823, + 529 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorework in (Concent, for any log spectrum differewhich satisfies that $l _ { 2 }$ GM perturbatio, there exists a of the net-such that $( l )$ $k > k ^ { \\prime } > 0$ $R _ { k } ^ { ( 0 ) } > R _ { k ^ { \\prime } } ^ { ( 0 ) }$ $t ^ { \\prime }$ $R _ { k } ^ { ( t ) } > R _ { k ^ { \\prime } } ^ { ( t ) }$ for all $t < t ^ { \\prime }$ steps of the normal training. For ReLU activation function, we have ", + "bbox": [ + 173, + 537, + 825, + 589 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/83c6097d4883193f7cde9fee708e560d838d659dba6138647d41b1c50aeb9be1.jpg", + "text": "$$\nt ^ { \\prime } = \\frac { R _ { k } ^ { ( 0 ) } \\cos ( \\triangle \\varphi _ { k } ^ { ( 0 ) } ) - R _ { k ^ { \\prime } } ^ { ( 0 ) } \\cos ( \\triangle \\varphi _ { k ^ { \\prime } } ^ { ( 0 ) } ) } { \\eta \\beta \\| \\pmb { a } \\| ^ { 2 } } ,\n$$", + "text_format": "latex", + "bbox": [ + 356, + 593, + 640, + 632 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "while if the initialization satisfies that $R _ { k } ^ { ( 0 ) } \\cos ( \\triangle \\varphi _ { k } ^ { ( 0 ) } ) \\leq R _ { k ^ { \\prime } } ^ { ( 0 ) } \\cos ( \\triangle \\varphi _ { k ^ { \\prime } } ^ { ( 0 ) } )$ then $t ^ { \\prime } = \\infty$ ", + "bbox": [ + 169, + 636, + 754, + 657 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The theorem shows that although $\\tilde { \\delta }$ itself can concentrate in the low frequency domain, it does not concentrate as dense in the low frequency domain as the inputs $\\tilde { \\pmb x }$ which obey the power law. Therefore, the log-spectrum difference (i.e. equivalent to spectrum of the ratio of the perturbation to the clean data) of adversarial examples will express a HFC-concentrated phenomenon instead (Fig.1). ", + "bbox": [ + 173, + 666, + 825, + 739 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3.3 MASKING HFC OF THE ADVERSARIAL EXAMPLES TO IMPROVE ROBUSTNESS ", + "text_level": 1, + "bbox": [ + 173, + 756, + 745, + 770 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this subsection, we compare the ratio of LFC of the adversarial perturbations $\\tau ( \\tilde { \\delta } \\in S _ { l } )$ and the ratio of LFC of original images $\\tau ( \\tilde { \\mathbfit { x } } \\in S _ { l } )$ . ", + "bbox": [ + 174, + 780, + 821, + 810 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorem 3 (Comparison on the LFC ratio of clean data and perturbations) For $l _ { 2 }$ FGM perturbation of the two-layer neural network in $( l )$ , at the $t$ -th step of normal training, let $\\zeta = \\tau ( \\tilde { \\pmb { x } } \\in$ $S l ) - \\tau ( \\tilde { \\delta } ^ { ( 0 ) } \\in S _ { l } ) > 0 ;$ , then we will have $\\tau ( \\tilde { \\pmb \\delta } ^ { ( t ) } \\in S _ { l } ) < \\tau ( \\tilde { \\pmb x } \\in S _ { l } )$ for all $t > 0$ if the initilization of the netowrk satisfies that ", + "bbox": [ + 173, + 820, + 825, + 881 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/ad7657a7526b6ea269dff5cfa02eb67f27c18ec752c76237a9140bb5840548fb.jpg", + "text": "$$\n\\triangle \\tau _ { l } ^ { ( 0 ) } < \\tau ( \\tilde { \\pmb { x } } \\in S _ { l } ) ( \\triangle \\tau _ { l } ^ { ( 0 ) } + \\triangle \\tau _ { h } ^ { ( 0 ) } ) .\n$$", + "text_format": "latex", + "bbox": [ + 372, + 883, + 625, + 905 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Remark When both $\\triangle \\tau _ { l } ^ { ( 0 ) }$ and 4τ (0)h are positive, condition (12) states that the ratio of low frequency component of 4τ (0)l $\\triangle \\tau _ { l } ^ { ( 0 ) } + \\triangle \\tau _ { h } ^ { ( 0 ) }$ is smaller than that of clean data, which can be easily satisfied for a randomly initialized network. The ratio of LFC of the perturbations $\\delta$ will be less than that of clean data $_ { \\textbf { \\em x } }$ if the condition Eq.(12) is satisfied for $l _ { 2 }$ FGM perturbations during the normal training process. Masking the HFC of an adversarial example $\\boldsymbol { x } + \\boldsymbol { \\delta }$ will then erase more amount of the perturbation than that of the clean data which leads to a new ”not-perturbed-much” adversarial example. As a result, one can expect the improvement for robustness of the model, as demonstrated in Section 4.3 later. ", + "bbox": [ + 173, + 101, + 825, + 219 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4 EXPERIMENT ", + "text_level": 1, + "bbox": [ + 176, + 241, + 316, + 257 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In this section, we conduct several experiments to validate our theoretical conclusions. ", + "bbox": [ + 174, + 272, + 738, + 287 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Setup. We use the Resnet-32 (He et al., 2016), a fully connected network as the last layer and cross entropy loss, and train all the parameters on the CIFAR-10 dataset with Adam optimizer (Kingma & Ba, 2014). We use PGD-attack with $\\epsilon = 8 / 2 5 5 , 4 0$ iterations and step size $\\xi = 4 / 2 5 5$ . ", + "bbox": [ + 174, + 294, + 825, + 337 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We supplement more experiments in Appendix C to fill the gap between our theory and more complicated settings: we use the MSE loss and keep other conditions unchanged to resolve the discrepancy of loss function; experiments to support our theorems on two-layer neural network with fixed outer-layer parameters are also provided. ", + "bbox": [ + 174, + 343, + 825, + 398 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 THE INCREASE OF LFC CONCENTRATION ", + "text_level": 1, + "bbox": [ + 176, + 416, + 500, + 431 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In this part, we empirically verify the theorem in Section 3.1, to show that adversarial perturbations gradually concentrate more in the low-frequency part of the spectrum during the training process. Consider a neural network with random initialization, each time before updating all the parameters of neural network, we randomly sample 100 images and apply the $l _ { 2 }$ FGM / PGD attack to them. For each iteration in PGD attack, we calculate their ratios of LFC and plot them in Fig. 2. It shows that the LFC ratios of the perturbations $\\tau ( \\tilde { \\delta } \\in S _ { l } )$ are gradually increasing along the normal training. ", + "bbox": [ + 173, + 443, + 826, + 529 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/2e93463d8b0d8af92c0f40e0e0bd8611a726e341e4e8e6b27f1e727f9ad9a6cb.jpg", + "image_caption": [ + "Figure 2: The LFC ratio of the adversarial perturbations in the training process. (a) The attack method is $l _ { 2 }$ FGM. (b) The attack method is $l _ { 2 }$ PGD " + ], + "image_footnote": [], + "bbox": [ + 232, + 563, + 748, + 705 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/cbb1802ab61a949a3797efad53a3fcb320cff34edb185c00f05d097a796bfc36.jpg", + "image_caption": [ + "Figure 3: The spectrum of adversarial perturbations. The first line is the original examples in CIFAR10 dataset. The second line is the spectrum of the adversarial perturbations corresponding to the above images. " + ], + "image_footnote": [], + "bbox": [ + 181, + 770, + 818, + 857 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For a sufficiently trained neural network, we choose an image, use PGD-attack to obtain its adversarial examples and perturbations, and calculate its spectrum. We randomly select 10 images in the test set and show the original images and the spectrum of perturbations in Fig. 3. We also randomly select 1000 images in the test set and average their spectrum to show the expectation of the spectrum in Fig. 4(a). They show that the spectrum of adversarial perturbations are more concentrated in the low-frequency domain after a sufficient training. Ortiz-Jimenez et al. (2020) show that the distance to the boundary (margin) in different frequency bands is heavily dependent of the distribution used for training, which also supports our claims. ", + "bbox": [ + 174, + 103, + 560, + 284 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/9062280e264e63edf3fd6c84be714fa9e63fd8f5fd3ef29919592afe72ed4f54.jpg", + "image_caption": [ + "Figure 4: The expectation of: (a) the spectrum of adversarial perturbations; (b) the log-spectrum difference of adversarial examples. " + ], + "image_footnote": [], + "bbox": [ + 596, + 113, + 816, + 204 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.2 HFC CONCENTRATION OF LOG-SPECTRUM DIFFERENCE ", + "text_level": 1, + "bbox": [ + 173, + 303, + 509, + 329 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We first use PGD-attack to get the adversarial example of a image for a sufficiently trained neural network. We then make the log-spectrum of the original image and its adversarial example and calculate the difference of their log-spectrum (Fig.5). Fig.4(b) displays the expectation of the spectrum for 1000 random images in the test set. They both show that the log-spectrum difference of adversarial examples is generally concentrated around. ", + "bbox": [ + 174, + 342, + 825, + 411 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/62cba9a5793dd7b65128cce6b902985d67a27e37337aa637955d8d198e3786f2.jpg", + "image_caption": [ + "Figure 5: The log-spectrum difference of adversarial examples. In each $3 \\times 2$ -image part, the first line is the original example, the adversarial example attacked by PGD in a normally trained Resnet-32 and the perturbation. The second line is the log-spectrum of the original example, the log-spectrum of the adversarial example and the difference of the two log-spectrum. " + ], + "image_footnote": [], + "bbox": [ + 176, + 424, + 823, + 558 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 LOW-PASS FILTER IMPROVES ROBUSTNESS ", + "text_level": 1, + "bbox": [ + 176, + 654, + 508, + 667 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this part, we empirically show how a low-pass filter (which filters out HFC of the inputs) can improve the robustness of the model with a cheat sheet in the sense that the attacker does not know the existence of the filter while the model is aware of the frequency distribution of the gradient-based adversarial examples. ", + "bbox": [ + 174, + 679, + 825, + 734 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The procedure of our low-pass filter basically has three steps: performing DFT on the inputs, then masking their high frequency components (set as 0) in the frequency domain and finally performing inverse DFT on them to give the desired inputs with only low frequency components preserved. ", + "bbox": [ + 176, + 741, + 823, + 784 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We evaluate two types of accuracy. One is filtering the clean images out of high frequencies and feed them into the model to test accuracy, named as ”no-attack accuracy”. The other is firstly PGD-attacking the input images in the normally trained model, and then check the test accuracy of filtered adversarial images, called “PGD-attack accuracy”. ", + "bbox": [ + 174, + 790, + 825, + 847 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Here, we use data augmentation to train the model to the best. We show the results in Fig. 6. As the cut-off increases, the no-attack accuracy gradually increases, and the PGD-attack accuracy first increases and then decreases. The highest robustness achieves $5 1 . 7 \\%$ when the cut-off $k = 1 2$ and its robustness accuracy is $8 1 . 7 \\%$ . And the normal accuracy (no filter, no attack) is $9 3 . 0 3 \\%$ . We also adversarially train the model with PGD-attacks. Its normal accuracy is $79 \\%$ and PGD-attack accuracy is $48 \\%$ without the filtering. Our low-pass filter model not only performs better on both no-attack accuracy and PGD-attack accuracy, but also does not need computationally expensive adversarial training. ", + "bbox": [ + 174, + 854, + 825, + 924 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 146 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/b0219b4fea00bd34d29e889814dc51c667590f4626cc6d8d512b5793bb802d50.jpg", + "image_caption": [ + "Figure 6: Normally trained model’s performance and robustness after a low-pass filter with cut-off from 1 to 22. " + ], + "image_footnote": [], + "bbox": [ + 323, + 181, + 653, + 349 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Theorem 3 provides a reasonable explanation for the above results. When the cut-off is low, the filter masks most of the original image and the adversarial perturbation, so both of the no-attack and PGD-attack models perform not well. When the cut-off is proper, there remains enough information of original images but little of perturbations, so the PGD attacker cannot fool the model thoroughly. Therefore, with a suitable cut-off, the low-pass filter can indeed improve the model’s robustness without computationally expensive adversarial training. ", + "bbox": [ + 174, + 410, + 825, + 494 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 516, + 318, + 532 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We investigate the adversarial examples through the lens of frequency analysis. Our work both theoretically and empirically clarifies the definition of log-spectrum difference of the adversarial examples in existing literature. Besides, we devote to understanding the spectral trajectories of adversarial examples: $l _ { 2 }$ FGM perturbations gradually increase the concentration in the low-frequency part of the spectrum but their ratios of LFC will never exceed that of clean data during the training process over model parameters. Inspired by these findings, we find that a low-pass filter can improve the robustness of the model and give a reasonable explanation for this phenomenon. ", + "bbox": [ + 174, + 549, + 825, + 647 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Future work can focus on analysis of other perturbations in the frequency domain such as FGSM and $l _ { \\infty }$ PGD perturbations or providing theoretical understanding of the phenomenon that the ratio of the LFC of the perturbation for adversarially trained model is much higher than that for normally trained model (Appendix D). ", + "bbox": [ + 174, + 654, + 825, + 709 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 733, + 285, + 747 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Nicholas Carlini and David Wagner. Towards evaluating the robustness of neural networks. In 2017 ieee symposium on security and privacy (sp), pp. 39–57. IEEE, 2017. ", + "bbox": [ + 173, + 757, + 823, + 786 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Xinyun Chen, Chang Liu, Bo Li, Kimberly Lu, and Dawn Song. Targeted backdoor attacks on deep learning systems using data poisoning. arXiv preprint arXiv:1712.05526, 2017. ", + "bbox": [ + 171, + 797, + 821, + 828 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572, 2014. ", + "bbox": [ + 168, + 839, + 823, + 868 + ], + "page_idx": 8 + }, + { + "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, + 881, + 823, + 922 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Andrew Ilyas, Shibani Santurkar, Dimitris Tsipras, Logan Engstrom, Brandon Tran, and Aleksander Madry. Adversarial examples are not bugs, they are features. In Advances in Neural Information Processing Systems, pp. 125–136, 2019. ", + "bbox": [ + 176, + 103, + 823, + 146 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. ", + "bbox": [ + 171, + 155, + 823, + 183 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alexey Kurakin, Ian Goodfellow, and Samy Bengio. Adversarial examples in the physical world. arXiv preprint arXiv:1607.02533, 2016. ", + "bbox": [ + 171, + 193, + 823, + 222 + ], + "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. arXiv preprint arXiv:1706.06083, 2017. ", + "bbox": [ + 174, + 231, + 823, + 272 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Takeru Miyato, Andrew M Dai, and Ian Goodfellow. Adversarial training methods for semisupervised text classification. arXiv preprint arXiv:1605.07725, 2016. ", + "bbox": [ + 173, + 281, + 821, + 310 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Guillermo Ortiz-Jimenez, Apostolos Modas, Seyed-Mohsen Moosavi-Dezfooli, and Pascal Frossard. Hold me tight! influence of discriminative features on deep network boundaries. arXiv preprint arXiv:2002.06349, 2020. ", + "bbox": [ + 176, + 319, + 823, + 362 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yash Sharma, Gavin Weiguang Ding, and Marcus A Brubaker. On the effectiveness of low frequency perturbations. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 3389–3396. AAAI Press, 2019. ", + "bbox": [ + 174, + 371, + 823, + 414 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jiawei Su, Danilo Vasconcellos Vargas, and Kouichi Sakurai. One pixel attack for fooling deep neural networks. IEEE Transactions on Evolutionary Computation, 23(5):828–841, 2019. ", + "bbox": [ + 173, + 422, + 823, + 452 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013. ", + "bbox": [ + 173, + 460, + 825, + 489 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "van A Van der Schaaf and JH van van Hateren. Modelling the power spectra of natural images: statistics and information. Vision research, 36(17):2759–2770, 1996. ", + "bbox": [ + 173, + 498, + 825, + 527 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Haohan Wang, Xindi Wu, Zeyi Huang, and Eric P Xing. High-frequency component helps explain the generalization of convolutional neural networks. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 8684–8694, 2020a. ", + "bbox": [ + 173, + 536, + 825, + 579 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Zifan Wang, Yilin Yang, Ankit Shrivastava, Varun Rawal, and Zihao Ding. Towards frequency-based explanation for robust cnn. arXiv preprint arXiv:2005.03141, 2020b. ", + "bbox": [ + 173, + 588, + 823, + 617 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Chaowei Xiao, Bo Li, Jun-Yan Zhu, Warren He, Mingyan Liu, and Dawn Song. Generating adversarial examples with adversarial networks. arXiv preprint arXiv:1801.02610, 2018. ", + "bbox": [ + 173, + 626, + 823, + 655 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dong Yin, Raphael Gontijo Lopes, Jon Shlens, Ekin Dogus Cubuk, and Justin Gilmer. A fourier perspective on model robustness in computer vision. In Advances in Neural Information Processing Systems, pp. 13276–13286, 2019. ", + "bbox": [ + 173, + 662, + 821, + 705 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "A PROOFS ", + "text_level": 1, + "bbox": [ + 174, + 102, + 277, + 118 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A.1 PROOF OF THEOREM 1 ", + "text_level": 1, + "bbox": [ + 176, + 132, + 374, + 147 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "According to (8), the update of $\\tau ( \\tilde { \\delta } [ k ] )$ for $k$ -th frequency component of $l _ { 2 }$ norm FGM adversarial perturbation at the $( t + 1 )$ -th step is proportional to ", + "bbox": [ + 173, + 157, + 823, + 189 + ], + "page_idx": 10 + }, + { + "type": "equation", + "img_path": "images/8a3640268956f0102fa5178654a4eacc97c0d84b8d9887bcf848060237a06885.jpg", + "text": "$$\n\\begin{array} { r } { ( 1 - 2 \\bar { \\eta } _ { 2 } ^ { ( t ) } ) \\lvert \\widetilde { \\nabla } f ^ { ( t ) } [ k ] \\rvert ^ { 2 } - 2 \\tilde { \\eta } ^ { ( t ) } \\lvert \\widetilde { \\nabla } f ^ { ( t ) } [ k ] \\rvert | \\tilde { x } [ k ] | \\cos \\left( \\triangle \\varphi _ { k } ^ { ( t ) } \\right) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 295, + 193, + 700, + 222 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We adopt the following representations to see trends of $\\cos \\left( \\triangle \\varphi _ { k } ^ { ( t ) } \\right)$ through the training process: ", + "bbox": [ + 171, + 227, + 812, + 252 + ], + "page_idx": 10 + }, + { + "type": "equation", + "img_path": "images/33d43838a8990b9a1a1d780d9c91f2c97cec71f2ffc940d552a24586aeb4702e.jpg", + "text": "$$\n\\begin{array} { r l r } { { \\widetilde { \\nabla f } ^ { ( t ) } [ k ] : = \\overrightarrow { c _ { ( t ) } } = ( | c _ { ( t ) } | \\cos \\theta , | c _ { ( t ) } | \\sin \\theta ) } } \\\\ & { } & { \\tilde { x } [ k ] : = \\overrightarrow { x _ { ( k ) } } = ( | x _ { ( k ) } | \\cos \\zeta , | x _ { ( k ) } | \\sin \\zeta ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 343, + 257, + 651, + 304 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "$| \\widetilde { \\nabla f } ^ { ( t + 1 ) } [ k ] | | \\widetilde { \\pmb { x } } [ k ] | \\cos \\left( \\triangle \\varphi _ { k } ^ { ( t ) } \\right)$ will have the form of ", + "bbox": [ + 173, + 308, + 560, + 333 + ], + "page_idx": 10 + }, + { + "type": "equation", + "img_path": "images/ba30c1aa8fdf5a3b0962e608904425e5c086d13952603673ae2f31d0b2b2438c.jpg", + "text": "$$\n\\left. \\overrightarrow { c _ { ( t + 1 ) } } , \\overrightarrow { x _ { ( k ) } } \\right. = ( 1 - \\bar { \\eta } ^ { ( t ) } ) \\left. \\overrightarrow { c _ { ( t ) } } , \\overrightarrow { x _ { ( k ) } } \\right. - \\tilde { \\eta } ^ { ( t ) } | x _ { ( k ) } | ^ { 2 } + \\mathcal { O } ( \\eta ^ { 2 } )\n$$", + "text_format": "latex", + "bbox": [ + 294, + 338, + 700, + 359 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "at the $( t + 1 )$ -th step. At the $( t + 1 )$ -th step, we have ", + "bbox": [ + 173, + 363, + 521, + 380 + ], + "page_idx": 10 + }, + { + "type": "equation", + "img_path": "images/7522120521f1c840c2291cea93bfa42a00727a35fa84045ddc7edf79a124c21f.jpg", + "text": "$$\n\\triangle \\tau _ { l } ^ { ( t + 1 ) } - \\triangle \\tau _ { h } ^ { ( t + 1 ) } = ( 1 - \\bar { \\eta } ^ { ( t ) } ) ( \\triangle \\tau _ { l } ^ { ( t ) } - \\triangle \\tau _ { h } ^ { ( t ) } ) + \\tilde { \\eta } ^ { ( t ) } ( L _ { x } - H _ { x } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 269, + 383, + 725, + 406 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "which means that if $\\triangle \\tau _ { l } ^ { ( t ) } > \\triangle \\tau _ { h } ^ { ( t ) }$ then we must have $\\triangle \\tau _ { l } ^ { ( t ^ { \\prime } ) } > \\triangle \\tau _ { h } ^ { ( t ^ { \\prime } ) }$ for all $t ^ { \\prime } \\geq t$ . Besides, l hthere must be a step which leads to this condition since $\\begin{array} { r } { H ^ { ( t ) } = \\sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } | \\widetilde { \\nabla f } [ k ] | ^ { 2 } } \\end{array}$ . At the $( t + 1 )$ -th step, the changed amount of . Let $\\begin{array} { r } { \\ddot { L } ^ { ( t ) } = \\sum _ { k = 0 } ^ { k _ { c } } | \\widetilde { \\nabla f } [ k ] | ^ { 2 } } \\end{array}$ $\\tau ( \\tilde { \\delta } \\in S _ { l } )$ 0 f is and ", + "bbox": [ + 174, + 411, + 826, + 468 + ], + "page_idx": 10 + }, + { + "type": "equation", + "img_path": "images/654cca2f3ba8f806f3aebc172d95608934514308e5fc045e965c5b2188c7dc38.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { ( 1 - 2 \\bar { \\eta } ^ { ( t ) } ) L ^ { ( t ) } + \\tilde { \\eta } ^ { ( t ) } \\bigtriangleup \\tau _ { l } ^ { ( t ) } } { \\big ( 1 - 2 \\bar { \\eta } ^ { ( t ) } \\big ) \\big ( L ^ { ( t ) } + H ^ { ( t ) } \\big ) + \\tilde { \\eta } ^ { ( t ) } \\big ( \\bigtriangleup \\tau _ { l } ^ { ( t ) } + \\bigtriangleup \\tau _ { h } ^ { ( t ) } \\big ) } - \\frac { L ^ { ( t ) } } { L ^ { ( t ) } + H ^ { ( t ) } } } \\\\ & { { = } \\tilde { \\eta } ^ { ( t ) } \\frac { \\bigtriangleup \\tau _ { l } ^ { ( t ) } \\tau \\left( \\tilde { \\delta } ^ { ( t ) } \\in S _ { h } \\right) - \\bigtriangleup \\tau _ { h } ^ { ( t ) } \\tau \\left( \\tilde { \\delta } ^ { ( t ) } \\in S _ { l } \\right) } { \\sum _ { k = 0 } ^ { ( d - 1 ) / 2 } | \\widetilde { \\nabla f } ^ { ( t + 1 ) } [ k ] | ^ { 2 } } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 274, + 473, + 720, + 568 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "If $t ~ > ~ t _ { 0 }$ and $\\tau \\left( { \\tilde { \\delta } } ^ { ( t ) } \\in S _ { h } \\right) \\ > \\ \\tau \\left( { \\tilde { \\delta } } ^ { ( t ) } \\in S _ { l } \\right)$ then the above changed amount will be positive and gradient descent will increase $\\tau \\left( \\tilde { \\delta } \\in S _ { l } \\right)$ at this step. If $\\begin{array} { r l } { \\triangle \\tau _ { l } ^ { ( t ) } \\tau \\left( \\tilde { \\pmb { \\delta } } ^ { ( t ) } \\in S _ { h } \\right) } & { { } < } \\end{array}$ $\\triangle \\tau _ { h } ^ { ( t ) } \\tau \\left( \\tilde { \\delta } ^ { ( t ) } \\in S _ { l } \\right)$ , then gradient descent will increase $\\tau \\left( \\tilde { \\delta } ^ { ( t ) } \\in S _ { h } \\right)$ untill the step $t _ { 1 }$ at which $\\triangle \\tau _ { l } ^ { ( t _ { 1 } ) } \\tau \\left( \\tilde { \\pmb \\delta } ^ { ( t _ { 1 } ) } \\in S _ { h } \\right) \\geq \\triangle \\tau _ { h } ^ { ( t _ { 1 } ) } \\tau \\left( \\tilde { \\pmb \\delta } ^ { ( t _ { 1 } ) } \\in S _ { l } \\right)$ , then for any $t > t _ { 1 }$ , we have $\\tau \\left( \\tilde { \\delta } ^ { ( t + 1 ) } \\in S _ { l } \\right) >$ $\\tau \\left( \\tilde { \\delta } ^ { ( t ) } \\in S _ { l } \\right)$ . ", + "bbox": [ + 171, + 570, + 826, + 693 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A.2 PROOF OF THEOREM 2 ", + "text_level": 1, + "bbox": [ + 176, + 707, + 375, + 722 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We provide the proof for ReLU activation function for positive $e \\tilde { t } a$ , the case for negative $\\tilde { \\eta }$ is similar. The update rules of $R _ { k }$ at the $( t + 1 )$ -th step are ", + "bbox": [ + 173, + 732, + 821, + 762 + ], + "page_idx": 10 + }, + { + "type": "equation", + "img_path": "images/3307a3d3192f1b3c224b14695742237fa8d1c0af9e7ac060315bfb0779a98523.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { R _ { k } ^ { ( t + 1 ) 2 } = R _ { k } ^ { ( t ) 2 } - 2 \\tilde { \\eta } ^ { ( t ) } R _ { k } ^ { ( t ) } \\cos \\left( \\triangle \\varphi _ { k } ^ { ( t ) } \\right) } \\\\ & { } & { R _ { k } ^ { ( t ) } \\cos \\left( \\triangle \\varphi _ { k } ^ { ( t ) } \\right) = R _ { k } ^ { ( t - 1 ) } \\cos \\left( \\triangle \\varphi _ { k } ^ { ( t - 1 ) } \\right) - \\tilde { \\eta } ^ { ( t - 1 ) } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 320, + 766, + 678, + 823 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "$k > k ^ { \\prime } > 0$ with $R _ { k } ^ { ( 0 ) } > R _ { k ^ { \\prime } } ^ { ( 0 ) }$ , we have ", + "bbox": [ + 171, + 827, + 486, + 847 + ], + "page_idx": 10 + }, + { + "type": "equation", + "img_path": "images/4aa1a37e7aabad90de2601439ff1dceb44b6916042f8e87032a97e421c3ddb10.jpg", + "text": "$$\n\\begin{array} { c } { { R _ { k } ^ { ( t + 1 ) 2 } - R _ { k ^ { \\prime } } ^ { ( t + 1 ) 2 } = R _ { k } ^ { ( t ) 2 } - R _ { k ^ { \\prime } } ^ { ( t ) 2 } - 2 \\tilde { \\eta } ^ { ( t ) } \\left[ R _ { k } ^ { ( t ) } \\cos \\left( \\bigtriangleup \\varphi _ { k } ^ { ( t ) } \\right) - R _ { k ^ { \\prime } } ^ { ( t ) } \\cos \\left( \\bigtriangleup \\varphi _ { k ^ { \\prime } } ^ { ( t ) } \\right) \\right] } } \\\\ { { = R _ { k } ^ { ( 0 ) 2 } - R _ { k ^ { \\prime } } ^ { ( 0 ) 2 } - 2 \\displaystyle \\sum _ { t ^ { \\prime } = 0 } ^ { t } \\tilde { \\eta } ^ { ( t ^ { \\prime } ) } \\left[ R _ { k } ^ { ( 0 ) } \\cos \\left( \\bigtriangleup \\varphi _ { k } ^ { ( 0 ) } \\right) - R _ { k ^ { \\prime } } ^ { ( 0 ) } \\cos \\left( \\bigtriangleup \\varphi _ { k ^ { \\prime } } ^ { ( 0 ) } \\right) \\right] } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 194, + 851, + 805, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "at the $( t + 1 )$ -th step. If $\\begin{array} { r } { R _ { k } ^ { ( 0 ) } \\cos \\left( \\triangle \\varphi _ { k } ^ { ( 0 ) } \\right) - R _ { k ^ { \\prime } } ^ { ( 0 ) } \\cos \\left( \\triangle \\varphi _ { k ^ { \\prime } } ^ { ( 0 ) } \\right) > 0 } \\end{array}$ , considering the case $\\tilde { \\eta } ^ { ( t ^ { \\prime } ) } =$ $\\tilde { \\eta } _ { \\mathrm { m a x } }$ for any $t ^ { \\prime }$ and the condition that the left L.H.S of the above equation is larger than 0 gives us Eq.(11). On the other hand, if $\\begin{array} { r } { R _ { k } ^ { ( 0 ) } \\cos \\left( \\triangle \\varphi _ { k } ^ { ( 0 ) } \\right) - R _ { k ^ { \\prime } } ^ { ( 0 ) } \\cos \\left( \\triangle \\varphi _ { k ^ { \\prime } } ^ { ( 0 ) } \\right) < 0 } \\end{array}$ , then $R _ { k } ^ { ( t ) } > R _ { k ^ { \\prime } } ^ { ( t ) }$ for all $t \\geq 0$ . ", + "bbox": [ + 173, + 99, + 826, + 176 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A.3 PROOF OF THEOREM 3 ", + "text_level": 1, + "bbox": [ + 174, + 194, + 375, + 209 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We consider the case for $l _ { 2 }$ FGM perturbations with $\\tilde { \\eta } > 0$ , the case for negative $\\tilde { \\eta }$ is similar. Let the initialization of the network always satisfy the condition ", + "bbox": [ + 173, + 220, + 825, + 250 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/d1068994dde591a9d05083f774768e21ea69dd2f596f3c9c9b7122584ad4c58b.jpg", + "text": "$$\n\\frac { L ^ { ( 0 ) } } { L ^ { ( 0 ) } + H ^ { ( 0 ) } } = \\tau ( \\tilde { \\delta } ^ { ( 0 ) } \\in S _ { l } ) < \\tau ( \\tilde { { \\pmb x } } \\in S _ { l } ) = \\frac { L _ { x } } { L _ { x } + H _ { x } }\n$$", + "text_format": "latex", + "bbox": [ + 313, + 257, + 684, + 292 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "such that $\\tau ( \\tilde { \\pmb { x } } \\in S _ { l } ) - \\tau ( \\tilde { \\pmb { \\delta } } ^ { ( 0 ) } \\in S _ { l } ) = \\zeta > 0$ . Then at the $( t )$ -th step, we can express $\\tau ( \\tilde { \\delta } ^ { ( 0 ) } \\in S _ { l } )$ as follows ", + "bbox": [ + 169, + 303, + 825, + 333 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/59424f0bbcf80a8c5858e9a3bda1c613ca924a3bb62b156d7ed1c5deb462d387.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { L ^ { ( t ) } } { L ^ { ( t ) } + H ^ { ( t ) } } = \\frac { L ^ { ( 0 ) } + \\sum _ { t ^ { \\prime } = 0 } ^ { t - 1 } \\tilde { \\eta } ^ { ( t ^ { \\prime } ) } \\bigtriangleup \\tau _ { l } ^ { ( t ^ { \\prime } ) } } { L ^ { ( 0 ) } + H ^ { ( 0 ) } + \\sum _ { t ^ { \\prime } = 0 } ^ { t - 1 } \\tilde { \\eta } ^ { ( t ^ { \\prime } ) } \\big ( \\triangle \\tau _ { h } ^ { ( t ^ { \\prime } ) } + \\triangle \\tau _ { l } ^ { ( t ^ { \\prime } ) } \\big ) } } \\\\ & { \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad L ^ { ( 0 ) } + \\sum _ { t ^ { \\prime } = 0 } ^ { t - 1 } \\tilde { \\eta } ^ { ( t ^ { \\prime } ) } \\big ( \\sum _ { t ^ { \\prime \\prime } = 0 } ^ { t ^ { \\prime } } \\tilde { \\eta } ^ { ( t ^ { \\prime \\prime } ) } L _ { x } + \\triangle \\tau _ { l } ^ { ( 0 ) } \\big ) } \\\\ & { \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad \\quad L ^ { ( 0 ) } + H ^ { ( 0 ) } + \\sum _ { t ^ { \\prime } = 0 } ^ { t - 1 } \\tilde { \\eta } ^ { ( t ^ { \\prime } ) } \\big ( \\sum _ { t ^ { \\prime \\prime } = 0 } ^ { t ^ { \\prime } } \\tilde { \\eta } ^ { ( t ^ { \\prime \\prime } ) } \\big ( L _ { x } + H _ { x } \\big ) + \\big \\triangleup \\tau _ { l } ^ { ( 0 ) } + \\triangle \\tau _ { h } ^ { ( 0 ) } \\big ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 207, + 337, + 790, + 426 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Let ", + "bbox": [ + 173, + 433, + 199, + 445 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/bb7eb677e2eee159819f1bc7b7b725d04e3ec8f0f35575c53143c08fe7a9e9e0.jpg", + "text": "$$\na = \\sum _ { t ^ { \\prime } = 0 } ^ { t - 1 } \\tilde { \\eta } ^ { ( t ^ { \\prime } ) } \\sum _ { t ^ { \\prime \\prime } = 0 } ^ { t ^ { \\prime } } \\tilde { \\eta } ^ { ( t ^ { \\prime \\prime } ) } L _ { x } , b = \\sum _ { t ^ { \\prime } = 0 } ^ { t - 1 } \\tilde { \\eta } ^ { ( t ^ { \\prime } ) } \\sum _ { t ^ { \\prime \\prime } = 0 } ^ { t ^ { \\prime } } \\tilde { \\eta } ^ { ( t ^ { \\prime \\prime } ) } H _ { x } , c = \\sum _ { t ^ { \\prime } = 0 } ^ { t - 1 } \\tilde { \\eta } ^ { ( t ^ { \\prime } ) } \\triangle \\tau _ { l } ^ { ( 0 ) } , d = \\sum _ { t ^ { \\prime } = 0 } ^ { t - 1 } \\tilde { \\eta } ^ { ( t ^ { \\prime } ) } \\triangle \\tau _ { h } ^ { ( 0 ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 453, + 815, + 497 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "then ", + "bbox": [ + 173, + 506, + 205, + 518 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/bccba702c89f3b75be13f9a9ca3736ee48f7800bd51509ac6381926808c71560.jpg", + "text": "$$\n\\frac { a } { a + b } = \\tau ( \\tilde { \\pmb { x } } \\in S _ { l } ) , \\frac { c } { c + d } = \\frac { \\triangle \\tau _ { l } ^ { ( 0 ) } } { \\triangle \\tau _ { l } ^ { ( 0 ) } + \\triangle \\tau _ { h } ^ { ( 0 ) } }\n$$", + "text_format": "latex", + "bbox": [ + 346, + 520, + 650, + 560 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 565, + 200, + 579 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/09fee4606c30ffa3d5b0268f30a5d7af393f86543f843e9ea88f59b58cb568bf.jpg", + "text": "$$\n\\begin{array} { r } { \\frac { L ^ { ( t ) } } { L ^ { ( t ) } + H ^ { ( t ) } } = \\frac { L ^ { ( 0 ) } + a + c } { L ^ { ( 0 ) } + H ^ { ( 0 ) } + a + b + c + d } } \\\\ { = \\tau ( \\tilde { \\pmb { x } } \\in S _ { l } ) \\frac { 1 + \\frac { c } { a } + \\frac { L ^ { ( 0 ) } } { a } } { 1 + \\frac { L ^ { ( 0 ) } + H ^ { ( 0 ) } } { a + b } + \\frac { c + d } { a + b } } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 338, + 587, + 658, + 666 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "If ", + "bbox": [ + 173, + 671, + 189, + 685 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/0fe6b79125c7f5088fc51d604231fd7d4518a7ad4aa41f3897c8010f1a527175.jpg", + "text": "$$\n\\begin{array} { c } { { \\displaystyle \\frac { c } { a } + \\frac { L ^ { ( 0 ) } } { a } < \\frac { L ^ { ( 0 ) } + H ^ { ( 0 ) } } { a + b } + \\frac { c + d } { a + b } } } \\\\ { { \\displaystyle \\frac { c } { L ^ { ( 0 ) } + H ^ { ( 0 ) } } + \\tau ( \\tilde { \\delta } ^ { ( 0 ) } \\in S _ { l } ) < \\tau ( \\tilde { \\pmb x } \\in S _ { l } ) \\left( 1 + \\frac { c + d } { L ^ { ( 0 ) } + H ^ { ( 0 ) } } \\right) } } \\\\ { { \\triangle \\tau _ { l } ^ { ( 0 ) } - \\tau ( \\tilde { \\pmb x } \\in S _ { l } ) ( \\triangle \\tau _ { l } ^ { ( 0 ) } + \\triangle \\tau _ { h } ^ { ( 0 ) } ) < \\zeta \\left( L ^ { ( 0 ) } + H ^ { ( 0 ) } \\right) } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 259, + 693, + 736, + 790 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "then we must have ", + "bbox": [ + 173, + 797, + 299, + 811 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/fd0c20031cd3351220d5cb96388512fad393519d375b583edc593ba77f2f1631.jpg", + "text": "$$\n\\tau ( \\tilde { \\pmb \\delta } ^ { ( t ) } \\in S _ { l } ) < \\tau ( \\tilde { \\pmb x } \\in S _ { l } )\n$$", + "text_format": "latex", + "bbox": [ + 411, + 810, + 586, + 829 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "at the $t$ -th step. A stronger condition is that ", + "bbox": [ + 173, + 835, + 460, + 851 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/98fe091164f993164e97d3e91c28a2a46c1741261e0e9ac1b9335133ac19ea74.jpg", + "text": "$$\n\\triangle \\tau _ { l } ^ { ( 0 ) } < \\tau ( \\tilde { \\pmb { x } } \\in S _ { l } ) ( \\triangle \\tau _ { l } ^ { ( 0 ) } + \\triangle \\tau _ { h } ^ { ( 0 ) } )\n$$", + "text_format": "latex", + "bbox": [ + 374, + 858, + 622, + 881 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "then we will have $\\tau ( \\tilde { \\pmb { \\delta } } ^ { ( t ) } \\in S _ { l } ) < \\tau ( \\tilde { \\pmb { x } } \\in S _ { l } )$ for all $t$ . This condition approximately states that the ”ratio” of low frequency component of $\\triangle \\tau _ { l } ^ { ( 0 ) } + \\triangle \\tau _ { h } ^ { ( 0 ) }$ is smaller than that of clean data. ", + "bbox": [ + 173, + 890, + 826, + 926 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "B $l _ { 2 }$ PGD PERTURBATIONS ", + "text_level": 1, + "bbox": [ + 174, + 101, + 413, + 118 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The PGD update rule for finding perturbations of $_ { \\textbf { \\em x } }$ with learning rate $\\xi$ at step $j + 1$ is: ", + "bbox": [ + 174, + 133, + 746, + 150 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/0f9bb22566604319d8d22dc8decacdc92640628103b2a5566b8d2b23008176ab.jpg", + "text": "$$\n\\delta ^ { ( j + 1 ) } = { \\mathcal { P } } _ { { \\mathcal { B } } ( 0 , \\epsilon ) } \\left[ \\delta ^ { ( j ) } + \\xi \\frac { \\partial \\ell } { \\partial f } ^ { ( j ) } \\nabla _ { x } f ^ { ( j ) } \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 354, + 156, + 642, + 199 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "where $B ( 0 , \\epsilon )$ is a ball centered at 0 with radius $\\epsilon$ in Euclidean space and $\\mathcal { P }$ is the projection operator defined as ", + "bbox": [ + 173, + 207, + 823, + 236 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/cb931368f2541d4c9d3b03acabfba12ce0113e585db02366f2f2c2c10461cbc2.jpg", + "text": "$$\n\\mathcal { P } _ { B ( 0 , \\epsilon ) } \\left[ \\delta \\right] = \\underset { \\delta ^ { \\prime } \\in B ( 0 , \\epsilon ) } { \\mathrm { a r g m i n } } \\| \\delta ^ { \\prime } - \\delta \\| ^ { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 388, + 234, + 607, + 263 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Note that in this part quantities removing the step script $j$ (e.g. $\\frac { \\partial \\ell } { \\partial f }$ and $\\nabla _ { x } f$ ) refers to not involving perturbations. For convenience, we use the same learning rate $\\xi$ for all steps $j$ and instead explore the update of ", + "bbox": [ + 173, + 270, + 826, + 315 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/33d0c3687d07f4c2915ab35767b2b66d19f5eecd0329a469e43824f33c5ca31b.jpg", + "text": "$$\n\\kappa ^ { ( j ) } = \\frac { \\delta ^ { ( j ) } } { \\xi }\n$$", + "text_format": "latex", + "bbox": [ + 455, + 315, + 540, + 352 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "to the order of $\\delta$ to see trends of PGD perturbations in frequency domain alongside PGD iterations since $\\tau ( \\tilde { \\delta } [ k ] ) = \\tau ( \\tilde { \\kappa } [ k ] )$ . For ease of notation, we adopt the following representations: Let $\\triangle \\phi _ { k } ^ { ( j ) }$ denote the difference of phases between $\\widetilde { \\nabla f [ k ] }$ and $\\tilde { \\kappa } ^ { ( j ) } [ k ]$ ; l $\\mathrm { ~ ~ \\sf ~ { ~ \\sf ~ * ~ } ~ } \\bar { \\beta } ^ { ( j ) } = \\partial \\ell / \\partial f + \\delta ^ { ( j ) } \\cdot \\nabla _ { \\bf x } f$ where $\\bar { \\beta } ^ { ( 0 ) } > 0$ and one can drive similar results for $\\bar { \\beta } ^ { ( 0 ) } < 0$ ; we denote ", + "bbox": [ + 173, + 354, + 826, + 421 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/4ab3abef4008d8e695a956d2448a2bd513c740ad5cb4254f16bf35e57f2a775b.jpg", + "text": "$$\n\\begin{array} { r } { \\displaystyle \\Lambda \\bar { \\tau } _ { l } ^ { ( j ) } \\triangleq 2 \\sum _ { k = 0 } ^ { k _ { c } } | \\tilde { \\kappa } ^ { ( j ) } [ k ] | | \\widetilde { \\nabla f } [ k ] | \\cos \\left( \\bigtriangleup \\phi _ { k } ^ { ( j ) } \\right) \\mathrm { ~ a n d ~ } \\bigtriangleup \\bar { \\tau } _ { h } ^ { ( j ) } \\triangleq 2 \\sum _ { k = k _ { c } + 1 } ^ { ( d - 1 ) / 2 } | \\tilde { \\kappa } ^ { ( j ) } [ k ] | | \\widetilde { \\nabla f } [ k ] | \\cos \\left( \\bigtriangleup \\phi _ { k } ^ { ( j ) } \\right) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 429, + 828, + 476 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "where $\\bar { \\beta } ^ { ( j ) } \\triangle \\bar { \\tau } _ { l } ^ { ( j ) }$ and $\\bar { \\beta } ^ { ( j ) } \\triangle \\bar { \\tau } _ { h } ^ { ( j ) }$ are changed amounts of LFC and HFC of $| \\kappa | ^ { 2 }$ at the $( j + 1 )$ - th step of PGD iteration. We provide below our results on frequency spectrum of -norm PGD perturbations. ", + "bbox": [ + 173, + 483, + 826, + 530 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Theorem 4 (The spectral trajectory of $l _ { 2 }$ PGD perturbation) At the $( j + 1 )$ -th step of PGD, iteration of PGD will change the ratio of LFC of $l _ { 2 }$ norm PGD adversarial perturbation for a neural network $( l )$ which satisfies $| \\partial \\ell / \\partial f | = \\overset { \\cdot } { \\epsilon } ^ { 1 + \\nu }$ with $0 < \\nu < 1$ as follows, ", + "bbox": [ + 174, + 541, + 825, + 585 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/91d42e9211c56ae284a3fb38ea04f02395767c4b0c7df964f8b2341b0efa8a80.jpg", + "text": "$$\n\\tau ( \\tilde { \\pmb { \\delta } } \\in S _ { l } ) \\gets \\tau ( \\tilde { \\pmb { \\delta } } \\in S _ { l } ) + \\bar { \\beta } ^ { ( j ) } \\frac { \\triangle \\bar { \\tau } _ { l } ^ { ( j ) } \\tau \\left( \\tilde { \\pmb { \\delta } } ^ { ( j ) } \\in S _ { h } \\right) - \\triangle \\bar { \\tau } _ { h } ^ { ( j ) } \\tau \\left( \\tilde { \\pmb { \\delta } } ^ { ( j ) } \\in S _ { l } \\right) } { \\sum _ { k = 0 } ^ { ( d - 1 ) / 2 } | \\tilde { \\star } ^ { ( j + 1 ) } [ k ] | ^ { 2 } } .\n$$", + "text_format": "latex", + "bbox": [ + 245, + 593, + 751, + 641 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Remark If the two-layer neural network in (1) is trained with at least $t \\geq t _ { 1 }$ steps $t _ { 1 }$ determined by theorem 1) such that $\\tau ( \\widetilde { \\nabla f } \\in S _ { l } ) > \\tau ( \\widetilde { \\nabla f } \\in S _ { h } )$ , then, according to theorem 4, there exists ", + "bbox": [ + 171, + 654, + 831, + 688 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/416809a829738670ee6ec00abbf9370a5f416677433a20d8a4eeadfe85eacba1.jpg", + "text": "$$\nj _ { 0 } = \\operatorname* { m a x } \\left\\{ 0 , \\frac { \\triangle \\bar { \\tau } _ { h } ^ { ( 0 ) } - \\triangle \\bar { \\tau } _ { l } ^ { ( 0 ) } } { \\tilde { \\beta } \\left( \\sum _ { k = 0 } ^ { k = k _ { c } } | \\widetilde { \\nabla f } [ k ] | ^ { 2 } - \\sum _ { k = k _ { c } } ^ { k = ( d - 1 ) / 2 } | \\widetilde { \\nabla f } [ k ] | ^ { 2 } \\right) } \\right\\} ,\n$$", + "text_format": "latex", + "bbox": [ + 282, + 694, + 712, + 746 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "where $\\tilde { \\beta } = \\mathrm { m a x } _ { i \\in [ 0 , j _ { 0 } ] } \\bar { \\beta } ^ { ( i ) }$ , such that $\\tau ( \\tilde { \\delta } ^ { ( j + 1 ) } \\in S _ { l } ) > \\tau ( \\tilde { \\delta } ^ { ( j ) } \\in S _ { l } )$ for all $j > j _ { 0 }$ if $\\tau ( \\tilde { \\delta } ^ { ( j ) } \\in$ $S _ { l } ) < \\tau ( \\tilde { \\delta } ^ { ( j ) } \\in S _ { h } \\bar { ) }$ . ", + "bbox": [ + 174, + 753, + 823, + 790 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "B.1 PROOF OF THEOREM 4 ", + "text_level": 1, + "bbox": [ + 174, + 806, + 377, + 821 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "At the $( \\mathrm { j } + 1 )$ -th step of PGD update for $\\kappa ^ { ( j + 1 ) }$ , if ", + "bbox": [ + 173, + 832, + 503, + 849 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "1. P (j) $\\mathcal { P } _ { B ( 0 , \\epsilon ) } ^ { ( j ) } = I$ ", + "bbox": [ + 212, + 861, + 316, + 882 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/013b78b9d261649e20b779ce3ba57c7e1aa07960d161f6b4878f053bb414ae19.jpg", + "text": "$$\n\\kappa ^ { ( j + 1 ) } = \\kappa ^ { ( j ) } + \\frac { \\partial \\ell } { \\partial f } \\nabla _ { x } f + \\frac { \\partial \\ell } { \\partial f } \\sum _ { r } a _ { r } \\sigma ^ { \\prime \\prime } \\delta ^ { ( j ) } \\cdot W _ { : , r } W _ { : , r } + \\delta ^ { ( j ) } \\cdot \\nabla _ { x } f \\nabla _ { x } f + \\mathcal { O } ( \\delta ^ { 2 } ) ;\n$$", + "text_format": "latex", + "bbox": [ + 240, + 890, + 812, + 928 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "2. P (j) B(0,\u000f) 6= I : ", + "bbox": [ + 210, + 101, + 316, + 123 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/565d87709aad963201e63d939e9117cb791a289848b3d6e66117d9c597df5f05.jpg", + "text": "$$\n\\pmb { \\kappa } ^ { ( j + 1 ) } = \\frac { \\epsilon } { \\| \\pmb { \\kappa } ^ { ( j ) } + \\nabla _ { \\pmb { x } } \\ell ^ { ( j ) } \\| } \\left( \\pmb { \\kappa } ^ { ( j ) } + \\frac { \\partial \\ell } { \\partial f } ^ { ( j ) } \\nabla _ { \\pmb { x } } f ^ { ( j ) } \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 348, + 130, + 705, + 172 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In either case, the quantity $\\tau ( \\tilde { \\kappa } [ k ] )$ is proportional to ", + "bbox": [ + 173, + 181, + 521, + 199 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/f8b8b06f2c9442972ebf9378e5d7b6c93b5d14ca8faae49856203a966f6c4a51.jpg", + "text": "$$\n\\left| \\mathcal { F } \\left( \\kappa ^ { ( j ) } + \\frac { \\partial \\ell } { \\partial f } ^ { ( j ) } \\nabla _ { \\pmb { x } } f ^ { ( j ) } \\right) \\right| ^ { 2 } = \\left| \\mathcal { F } \\left( \\kappa ^ { ( j ) } + \\frac { \\partial \\ell } { \\partial f } \\nabla _ { \\pmb { x } } f + \\delta ^ { ( j ) } \\cdot \\nabla _ { \\pmb { x } } f \\nabla _ { \\pmb { x } } f \\right) \\right| ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 241, + 204, + 751, + 251 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "since the term $\\delta \\partial \\ell / \\partial f < \\delta ^ { 2 }$ and can be dropped. Therefore, we now consider ", + "bbox": [ + 174, + 257, + 686, + 273 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/6c25bd7027a30bdd98c692ec294319f557c3eda7f254c509b471610e6e566154.jpg", + "text": "$$\n\\tilde { \\kappa } ^ { ( j + 1 ) } [ k ] = \\tilde { \\kappa } ^ { ( j ) } [ k ] + \\left( \\frac { \\partial \\ell } { \\partial f } + \\delta ^ { ( j ) } \\cdot \\nabla _ { x } f \\right) \\widetilde { \\nabla } f [ k ]\n$$", + "text_format": "latex", + "bbox": [ + 330, + 280, + 668, + 315 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "at the $( j + 1 )$ -th step of PGD in the frequency domain to explore ratio of frequency $k$ to the whole frequency spectrum of perturbations ", + "bbox": [ + 173, + 321, + 826, + 351 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/c7df0365396b18fd3d42c94797d342884794ee5303d1ff24200c2bb054424036.jpg", + "text": "$$\n\\tau \\left( \\tilde { \\delta } ^ { ( j + 1 ) } [ k ] \\right) \\propto | \\tilde { \\kappa } ^ { ( j ) } [ k ] | ^ { 2 } + 2 \\left( \\beta ^ { \\prime } + \\delta ^ { ( j ) } \\cdot \\nabla _ { x } f \\right) | \\tilde { \\kappa } ^ { ( j ) } [ k ] | | \\widetilde { \\nabla f } [ k ] | \\cos ( \\bigtriangleup \\phi _ { k } ^ { ( j ) } ) .\n$$", + "text_format": "latex", + "bbox": [ + 235, + 358, + 761, + 386 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lemma 1 (Dynamics of $l _ { 2 }$ Norm PGD in the Frequency Domain) If the initialization of $l _ { 2 }$ norm PGD adversarial perturbation satisfies $\\begin{array} { r } { \\frac { \\partial \\ell } { \\partial f } + \\pmb { \\delta } ^ { ( 0 ) } \\cdot \\nabla _ { \\pmb { x } } ^ { * } f > \\mathbf { \\overset { . } { 0 } } } \\end{array}$ , then it will be positive at every iteration of $P G D ^ { 3 }$ . ", + "bbox": [ + 173, + 414, + 825, + 460 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Similar to Eq.(15), one can derive the changed amount of $\\tau ( \\tilde { \\delta } \\in S _ { l } )$ in theorem 4 at the $( j + 1 )$ -th step and find the necessary condition. ", + "bbox": [ + 174, + 473, + 823, + 503 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C SUPPLEMENTARY EXPERIMENT ", + "text_level": 1, + "bbox": [ + 174, + 525, + 468, + 541 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this part, we present experiments on models with MSE loss and two-layer neural networks with fixed outer-layer parameters in Section 4. ", + "bbox": [ + 174, + 556, + 823, + 585 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C.1 MSE LOSS ", + "text_level": 1, + "bbox": [ + 174, + 602, + 294, + 617 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We show the supplementary experiment of Section 4.1 in Fig. 7 and Fig. 8. They have similar results to show that the spectrum of adversarial perturbations are more concentrated in the low-frequency domain after a sufficient training. ", + "bbox": [ + 176, + 628, + 826, + 671 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/9fcb1fb6c5ceecd016e1cd56f6f851dd26f63d03c9d93b2ebbdfe4cf43a4771e.jpg", + "image_caption": [ + "Figure 7: The difference of the spectrum between original and adversarial examples. The model are trained with MSE loss. " + ], + "image_footnote": [], + "bbox": [ + 173, + 684, + 869, + 780 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Then we show the supplementary experiment of Section 4.2 in Fig. 9 and Fig. 10. They have similar results to show the log-spectrum difference of adversarial examples is generally concentrated around. ", + "bbox": [ + 174, + 833, + 825, + 877 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In general, there is little empirical gap between MSE loss and CrossEntropy loss. ", + "bbox": [ + 173, + 882, + 705, + 898 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/8614ad2e36229fab0c1eaee197fd02a28b2653cae3d5e263aabf0dd3bd96ba80.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 444, + 103, + 553, + 186 + ], + "page_idx": 14 + }, + { + "type": "image", + "img_path": "images/edb9000a5dded652ee0c4c84c69810858aaf35c43edd08d0b243f8ba3f618afe.jpg", + "image_caption": [ + "Figure 8: The expectation of the spectrum of adversarial perturbations. The model are trained with MSE loss. " + ], + "image_footnote": [], + "bbox": [ + 187, + 247, + 810, + 333 + ], + "page_idx": 14 + }, + { + "type": "image", + "img_path": "images/ef4bb15c556334596d309ce25b86f8622cffcff8cdf1be9609791a9b7b0bbb2b.jpg", + "image_caption": [ + "Figure 9: The difference of the log-spectrum between original and adversarial examples. The model are trained with MSE loss. ", + "Figure 10: The expectation of the log-spectrum of adversarial perturbations. The model are trained with MSE loss. " + ], + "image_footnote": [], + "bbox": [ + 444, + 392, + 553, + 477 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "C.2 TWO-LAYER NEURAL NETWORK ", + "text_level": 1, + "bbox": [ + 176, + 553, + 439, + 565 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We use two-layer neural networks with fixed outer-layer parameters. The input layer is of size $3 * 3 2 * 3 2$ followed by a ReLU activation function, and the hidden layer is of size 500 followed by a sigmoid activation function. The dataset is still CIFAR10. We use random initialization and SGD optimizer without any training tricks. This setting can be used in practice and get higher than $40 \\%$ test accuracy. The attack method is the same as the setup in Section 4. ", + "bbox": [ + 174, + 580, + 825, + 651 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We show the LFC ratio of the adversarial perturbations during the training process in Fig.11. After sufficient training, we show the expectation of the spectrum in Fig.12(a) and the expectation of the log-spectrum difference in Fig.12(b). ", + "bbox": [ + 174, + 657, + 825, + 699 + ], + "page_idx": 14 + }, + { + "type": "image", + "img_path": "images/e44002f7f5522dc16adc33827c4d9dff228ddc6e5edc1fbd48b3a44c05e09e42.jpg", + "image_caption": [ + "Figure 11: The LFC ratio of the adversarial perturbations for two-layer neural networks in the training process. (a) The attack method is $l _ { 2 }$ FGM; (b) The attack method is $l _ { 2 }$ PGD. " + ], + "image_footnote": [], + "bbox": [ + 264, + 736, + 717, + 863 + ], + "page_idx": 14 + }, + { + "type": "image", + "img_path": "images/eeba38973e8de140b7941ad462156cdf97a2d14bb1b1f4992aec60a0e4f2bcb6.jpg", + "image_caption": [ + "Figure 12: For two-layer neural network, the expectation of: (a) the spectrum of adversarial perturbations; (Due to the large value gap between LFC and HFC, it is hard to see the trend in original result, so we show the logarithm of the result which will not change the size relationship.) (b) the log-spectrum difference of adversarial examples. " + ], + "image_footnote": [], + "bbox": [ + 354, + 108, + 642, + 233 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "D PERTURBATIONS OF PGD-ATTACK ADVERSARIAL TRAINED MODEL ARE MORE CONCENTRATED IN LFC ", + "text_level": 1, + "bbox": [ + 178, + 329, + 802, + 363 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We do use the same setup in Section 4, and the PGD-attack adversarial training is also PGD-attack with $\\epsilon = 8 / 2 5 5$ , 40 iterations and step size $\\xi = 4 / 2 5 5$ in each training step. Then we test the ratio of LFC of original images, perturbations in a normally trained model and perturbations in a PGDattack adversarially trained model. The results are shown in Fig. 13. It shows that the LFC ratio of perturbations in PGD-attack adversarially trained model is generally higher than that in normally trained model. ", + "bbox": [ + 173, + 377, + 825, + 462 + ], + "page_idx": 15 + }, + { + "type": "image", + "img_path": "images/81106fbe707cbf3630dabacce730c50a19e85001c9a888f663a178edac7d1d37.jpg", + "image_caption": [ + "Figure 13: the ratio of LFC of original images, perturbations in a normally trained model and perturbations in a PGD-attack adversarially trained model " + ], + "image_footnote": [], + "bbox": [ + 364, + 487, + 614, + 617 + ], + "page_idx": 15 + } +] \ No newline at end of file diff --git a/parse/train/D8-iwC9UN3/D8-iwC9UN3.md b/parse/train/D8-iwC9UN3/D8-iwC9UN3.md new file mode 100644 index 0000000000000000000000000000000000000000..72976d20f143535c72f6e57b920345fc1e79d7c6 --- /dev/null +++ b/parse/train/D8-iwC9UN3/D8-iwC9UN3.md @@ -0,0 +1,608 @@ +# Efficient and Modular Implicit Differentiation + +Anonymous Author(s) +Affiliation +Address +email + +# Abstract + +1 Automatic differentiation (autodiff) has revolutionized machine learning. It allows +2 expressing complex computations by composing elementary ones in creative ways +3 and removes the burden of computing their derivatives by hand. More recently, +4 differentiation of optimization problem solutions has attracted widespread attention +5 with applications such as optimization as a layer, and in bi-level problems such as +6 hyper-parameter optimization and meta-learning. However, the formulas for these +7 derivatives often involve case-by-case tedious mathematical derivations. In this +8 paper, we propose a unified, efficient and modular approach for implicit differentia +9 tion of optimization problems. In our approach, the user defines (in Python in the +10 case of our implementation) a function $F$ capturing the optimality conditions of +11 the problem to be differentiated. Once this is done, we leverage autodiff of $F$ and +12 implicit differentiation to automatically differentiate the optimization problem. Our +13 approach thus combines the benefits of implicit differentiation and autodiff. We +14 show that seemingly simple principles allow to recover many recently proposed im +15 plicit differentiation methods and create new ones easily. We demonstrate the ease +16 of formulating and solving bi-level optimization problems using our framework. +17 We also showcase an application to the sensitivity analysis of molecular dynamics. + +# 18 1 Introduction + +19 Automatic differentiation (autodiff) is now an inherent part of machine learning software. It allows +20 expressing complex computations by composing elementary ones in creative ways and removes +21 the tedious burden of computing their derivatives by hand. The differentiation of optimization +22 problem solutions has found many applications. A classical example is bi-level optimization, which +23 typically involves computing the derivatives of a nested optimization problem in order to solve +24 an outer one. Examples of applications in machine learning include hyper-parameter optimization +25 [19, 63, 57, 30, 10, 11], neural networks [46], and meta-learning [31, 59]. Another line of applications +26 is “optimization as a layer” [42, 6, 51, 27, 36, 7], which usually includes regularization or constraints +27 in the optimization problem in order to impose desirable structure on the layer output. In addition +28 to providing well sought-for interpretability, recent research indicates that such structure could be +29 beneficial in order to improve generalization of neural networks [20]. +30 Since optimization problem solutions typically do not enjoy an explicit formula in terms of their +31 inputs, autodiff cannot be used directly to differentiate these functions. In recent years, two main +32 approaches have been developed to circumvent this problem. The first one consists in unrolling the +33 iterations of an optimization algorithm and to use the final iteration as a proxy for the optimization +34 problem solution [68, 28, 25, 31]. An advantage of this approach is that autodiff through the algorithm +35 iterates can then be used transparently. However, this requires a reimplementation of the algorithm +36 using the autodiff system, and not all algorithms are necessarily autodiff friendly. Moreover, forward +37 mode autodiff has time complexity that scales linearly with the number of variables and reverse-mode +38 autodiff has memory complexity that scales linearly with the number of algorithm iterations. A second +39 approach is to see optimization problem solutions as implicitly-defined functions of certain optimality +40 conditions. Examples include stationary conditions [9, 46], KKT conditions [19, 35, 6, 53, 52] and +41 the proximal gradient fixed point [51, 10, 11]. An advantage of such implicit differentiation is that +42 a reimplementation is not needed, allowing to build upon state-of-the-art software. However, so +43 far, obtaining the implicit differentiation formulas required a case-by-case tedious mathematical +44 derivation. Recent work [2] attempts to address this issue by adding implicit differentiation on top of +45 cvxpy [26]. This works by reducing all convex optimization problems to a conic program and using +46 conic programming’s optimality conditions to derive an implicit differentiation formula. While this +47 approach is very generic, solving a convex optimization problem using a conic programming solver— +48 an ADMM-based splitting conic solver [54] in the case of cvxpy—is rarely the state-of-the-art +49 approach for each particular problem instance. +50 In this work, we adopt a different strategy, which allows to easily add implicit differentiation on top +51 of existing solvers. In our approach, the user defines (in Python in the case of our implementation) +52 a mapping function $F$ capturing the optimality conditions of the problem solved by the algorithm. +53 Once this is done, we leverage autodiff of $F$ combined with implicit differentiation techniques to +54 automatically differentiate the optimization problem solution. In this way, our approach is very +55 generic and still the efficiency of state-of-the-art solvers. It therefore combines the benefits of implicit +56 differentiation and autodiff. To summarize, we make the following contributions. + +• We delineate extremely general principles for implicitly differentiating through an optimization problem solution. Our approach can be seen as “hybrid”, in the sense that it combines implicit differentiation with autodiff of the optimality conditions. +• We show how to instantiate our framework in order to recover many recently-proposed implicit differentiation schemes, thereby providing a unifying perspective. We also obtain new implicit differentiation schemes, such as the one based on the mirror descent fixed point. +• On the theoretical side, we provide new bounds on the Jacobian error when the optimization problem is only solved approximately. +• We describe a JAX implementation and provide a blueprint for implementing our approach in other frameworks. We will open-source a full-fledged library for implicit differentiation in JAX. +• We implement four illustrative applications, demonstrating our framework’s ease of use. + +68 In essence, our implementation significantly extends JAX’s default autodiff system in context of the +69 numerical optimization domain. From an end user’s perspective, autodiff with JAX simply becomes +70 more efficient if they use solvers with implicit differentiation set up by our framework. +71 Notation. We denote the gradient and Hessian of $f \colon { \mathbb { R } ^ { d } } \to { \mathbb { R } }$ evaluated at $x \in \mathbb { R } ^ { d }$ by $\nabla f ( x ) \in$ +72 $\mathbb { R } ^ { d }$ and $\nabla ^ { 2 } f ( x ) \ \in \ \mathbb { R } ^ { d \times d }$ . We denote the Jacobian of $F \colon \mathbb { R } ^ { d } \ \ \mathbb { R } ^ { p }$ evaluated at $x \in \mathbb { R } ^ { d }$ by +73 $\partial F ( x ) \in \mathbb { R } ^ { p \times d }$ . When $f$ or $F$ have several arguments, we denote the gradient, Hessian and Jacobian +74 in the $i ^ { \mathrm { { t h } } }$ argument by $\nabla _ { i }$ , $\nabla _ { i } ^ { 2 }$ and $\partial _ { i }$ , respectively. The standard probability simplex is denoted +75 by $\triangle ^ { d } : = \{ x \in \mathbb { R } ^ { d } \colon \| x \| _ { 1 } = 1 , x \geq 0 \}$ . For any set $\mathcal { C } \subset \mathbb { R } ^ { d }$ , we denote by $I _ { \mathcal { C } }$ the function +76 $\mathbb { R } ^ { d } \to \mathbb { R } \cup \{ + \infty \}$ where $I _ { \mathit { C } } ( x ) = 0$ if $x \in { \mathcal { C } }$ , $I _ { C } ( x ) = + \infty$ otherwise. For a vector or matrix $A$ , we +77 note $\| A \|$ the Frobenius (or Euclidean) norm, and $\| A \| _ { \mathrm { o } p }$ the operator norm. + +# 2 Proposed framework: combining implicit differentiation and autodiff + +# 2.1 General principles + +Overview. Contrary to unrolling of algorithm iterations, implicit differentiation typically involves a manual, sometimes complicated, mathematical derivation. For instance, numerous works [19, 35, 6, 53, 52] use Karush–Kuhn–Tucker (KKT) conditions in order to relate a constrained optimization problem’s solution to its inputs, and to manually derive a formula for its derivatives. The derivation and implementation is typically case-by-case. + +85 In this work, we propose a general way to easily add implicit differentiation on top of existing solvers. +86 In our approach, the user defines (in Python in the case of our implementation) a mapping function +87 $F$ capturing the optimality conditions of the problem solved by the algorithm. We provide reusable +88 building blocks to easily express such $F$ . Once this is done, we leverage autodiff of $F$ combined with +89 implicit differentiation to automatically differentiate the optimization problem solution. A simple +90 illustrative example is given in Figure 1. + +![](images/54ed46780257aac9d2be9edbb82db1f5cfb576d08726ad6f832a85f9ef6a61f7.jpg) +Figure 1: Example: adding implicit differentiation on top of a ridge regression solver. The function $f ( x , \theta )$ defines the objective function and the mapping $F$ , here simply equation (4), captures the optimality conditions. The decorator @custom_root (provided by our library) automatically adds implicit differentiation to the solver for the user. The last line evaluates the Jacobian at $\theta = 1 0$ . + +91 Differentiating a root. Let $F \colon { \mathbb { R } } ^ { d } \times { \mathbb { R } } ^ { n } \to { \mathbb { R } } ^ { d }$ be a user-provided mapping, capturing the optimality conditions of a problem. An optimal solution, denoted 92 $x ^ { \star } ( \theta )$ , should be a root of $F$ : + +$$ +F ( x ^ { \star } ( \theta ) , \theta ) = 0 . +$$ + +93 We can see $x ^ { \star } ( \theta )$ as an implicitly defined function of $\theta \in \mathbb { R } ^ { n }$ , i.e., $x ^ { \star } \colon { \mathbb { R } } ^ { n } \to { \mathbb { R } } ^ { d }$ . Our goal +94 is to differentiate $x ^ { \star } ( \theta )$ w.r.t. $\theta$ . From the implicit function theorem [44], if $F$ is continuously +95 differentiable and the Jacobian $\partial _ { 1 } F$ evaluated at $x ^ { \star } ( \theta ) \times \theta$ is a square invertible matrix, then ${ \partial x ^ { \star } ( \theta ) }$ +96 exists. Using the chain rule, we know that the Jacobian ${ \partial x ^ { \star } ( \theta ) }$ satisfies + +$$ +\partial _ { 1 } F ( x ^ { \star } ( \theta ) , \theta ) \partial x ^ { \star } ( \theta ) + \partial _ { 2 } F ( x ^ { \star } ( \theta ) , \theta ) = 0 . +$$ + +Computing 97 ${ \partial x ^ { \star } ( \theta ) }$ boils down to the resolution of the linear system of equations + +$$ +\underbrace { - \partial _ { 1 } F ( x ^ { \star } ( \theta ) , \theta ) } _ { A \in \mathbb { R } ^ { d \times d } } \underbrace { \partial x ^ { \star } ( \theta ) } _ { J \in \mathbb { R } ^ { d \times n } } = \underbrace { \partial _ { 2 } F ( x ^ { \star } ( \theta ) , \theta ) } _ { B \in \mathbb { R } ^ { d \times n } } +$$ + +98 When (1) is a one-dimensional root finding problem $\dot { d } = 1 \dot { }$ ), (2) becomes particularly simple since +99 $\nabla x ^ { \star } ( \theta ) = B ^ { \top } / A$ , where $A$ is a scalar value. +100 We will show that existing and new implicit differentiation methods all reduce to this simple principle. +101 We call our approach hybrid, since it combines implicit differentiation (it involves the resolution of a +102 linear system) with the autodiff of the optimality conditions $F$ . Our approach is efficient as it can be +103 added on top of any state-of-the-art solver and modular as the optimality conditon specification is +104 decoupled from the implicit differentiation mechanism. + +Differentiating a fixed point. We will encounter numerous applications where 05 $x ^ { \star } ( \theta )$ is implicitly 06 defined through a fixed point iteration: + +$$ +x ^ { \star } ( \theta ) = T ( x ^ { \star } ( \theta ) , \theta ) , +$$ + +where 107 $T \colon { \mathbb { R } } ^ { d } \times { \mathbb { R } } ^ { n } \to { \mathbb { R } } ^ { d }$ . This can be seen as a particular case of (1) with + +$$ +F ( x ^ { \star } ( \theta ) , \theta ) = T ( x ^ { \star } ( \theta ) , \theta ) - x ^ { \star } ( \theta ) . +$$ + +108 In this case, using the chain rule, we have + +$$ +A = - \partial _ { 1 } F ( x ^ { \star } ( \theta ) , \theta ) = I - \partial _ { 1 } T ( x ^ { \star } ( \theta ) , \theta ) \quad \mathrm { a n d } \quad B = \partial _ { 2 } F ( x ^ { \star } ( \theta ) , \theta ) = \partial _ { 2 } T ( x ^ { \star } ( \theta ) , \theta ) . +$$ + +109 Computing JVPs and VJPs. In practice, all we need to know from $F$ is how to left-multiply or +110 right-multiply $\partial _ { 1 } F$ and $\partial _ { 2 } F$ with a vector of appropriate size. These are called vector-Jacobian +111 product (VJP) and Jacobian-vector product (JVP), and are useful for integrating $x ^ { \star } ( \theta )$ with reverse +112 mode and forward-mode autodiff, respectively. Often times, $F$ will be explicitly defined. In this case, +113 computing the VJP or JVP can be done via autodiff. Other times, $F$ may itself be implicitly defined, +114 for instance when $F$ involves the solution of a variational problem. In this case, computing the VJP +115 or JVP will itself involve implicit differentiation. +116 The right-multiplication (JVP) between $J = \partial x ^ { \star } ( \theta )$ and a vector $v$ , $J v$ , can be computed efficiently +117 by solving $A ( J v ) = B v$ . The left-multiplication (VJP) of $v ^ { \top }$ with $J , v ^ { \top } J$ , can be computed by first +118 solving $A ^ { \top } u = v$ . Then, we can obtain $v ^ { \top } J$ by $\boldsymbol { v } ^ { \top } \boldsymbol { J } = \boldsymbol { u } ^ { \top } \boldsymbol { A } \boldsymbol { J } = \boldsymbol { u } ^ { \top } \boldsymbol { B }$ . Note that when $B$ changes +119 but $A$ and $v$ remain the same, we do not need to solve $A ^ { \top } u = v$ once again. This allows to compute +120 the VJP w.r.t. different variables while solving only one linear system. +121 To solve these linear systems, we can use the conjugate gradient method [39] when $A$ is positive +122 semi-definite and GMRES [61] or BiCGSTAB [66] when $A$ is not. All algorithms are matrix-free, +123 i.e., they only require matrix-vector products (linear maps). Thus, all we need from $F$ is its JVPs +124 or VJPs. An alternative to GMRES/BiCGSTAB is to solve the normal equation $A A ^ { \top } u = A v$ using +125 conjugate gradient, which we find faster in some scenarios. +126 Pre-processing and post-processing mappings. Often times, the goal is not to differentiate $\theta$ per +127 se, but the parameters of a function producing $\theta$ . One example of such pre-processing is to convert +128 the parameters to be differentiated from one form to another canonical form, such as a quadratic +129 program [6] or a conic program [2]. Another example is when $x ^ { \star } ( \theta )$ is used as the output of a neural +130 network layer, in which case $\theta$ is produced by the previous layer. Likewise, $x ^ { \star } ( \theta )$ will often not +131 be the final output we want to differentiate. One example of such post-processing is when $x ^ { \star } ( \theta )$ is +132 the solution of a dual program and we apply the dual-primal mapping to recover the solution of the +133 primal program. Another example is the application of a loss function, in order to reduce $x ^ { \star } ( \theta )$ to a +134 scalar value. In all these cases, we leave the differentiation of the pre/post-processing mappings to +135 the autodiff system, allowing us to compose functions in complex ways. +136 Usage and implementation details. Our implementation is based on JAX [17, 34]. JAX’s autodiff +137 features enter the picture in at least two ways: (i) we lean heavily on JAX within our implementation, +138 and (ii) we integrate the differentiation routines introduced by our framework into JAX’s existing +139 autodiff system. In doing the latter, we override JAX’s default autodiff behavior (e.g. of differentiating +140 transparently through an iterative solver’s unrolled iterations). +141 We delineate here what features are needed from an autodiff system to implement our proposed +142 framework. As mentioned, we only need access to $F$ through the JVP or VJP of $\partial _ { 1 } F$ and $\partial _ { 2 } F$ . +143 Since the definition of $F$ will often include a gradient mapping $\nabla _ { 1 } f ( x , \theta )$ (see examples in $\ S 2 . 2 \AA ,$ ), +144 second-order derivatives need also be supported. Our library provides two decorators, custom_root +145 and custom_fixed_point, for adding implicit differentiation on top of a solver, given optimality +146 conditions $F$ or fixed point iteration $T$ . This functionality requires the ability to add custom JVP +147 and/or VJP to a function. All these features are supported by recent autodiff systems, including JAX +148 [17], TensorFlow [1] and PyTorch [56]. Our implementation, made in JAX, also uses JAX-specific +149 features. We make extensive use of automatic batching with ${ \mathrm { j a x . v m a p } }$ , JAX’s vectorizing map +150 transformation. In order to solve the normal equation ${ \bar { A } } A ^ { \top } u \stackrel { = } { = } A v$ , we also use JAX’s ability to +151 automatically transpose a linear map using jax.linear_transpose [33]. + +# 2.2 Examples + +We now give various examples of mapping $F$ or fixed point iteration $T$ , recovering existing implicit differentiation methods and creating new ones. Each choice of $F$ or $T$ implies different trade-offs in terms of computational oracles; see Table 1. Source code examples are given in Appendix A. + +56 Stationary point condition. The simplest example is to differentiate through the implicit function + +$$ +x ^ { \star } ( \theta ) = \operatorname * { a r g m i n } _ { x \in \mathbb { R } ^ { d } } f ( x , \theta ) , +$$ + +where 157 $f \colon { \mathbb { R } ^ { d } } \times { \mathbb { R } ^ { n } } \to { \mathbb { R } }$ is twice differentiable. In this case, $F$ is simply the gradient mapping + +$$ +F ( x , \theta ) = \nabla _ { 1 } f ( x , \theta ) . +$$ + +Table 1: Summary of optimality condition mappings. Oracles are accessed through their JVP or VJP. + +
NameEquationSolution neededOracles needed
Stationary(4), (5)PrimalVif
KKT(6)Primal and dualVif,H,G,δH,δG
Proximal gradient(7)PrimalVif,proxng
Projected gradient(9)PrimalVif,projc
Mirror descent(11)PrimalV1f,proje,
Newton(15)Primal[V²f(x,0)]-1,Vif(x,0)
Block proximal gradient(16)Primal[Vif]j,[proXnglj
Conic programming(20)Residual map rootprojRp ×K* ×R+
+ +158 We then have $\partial _ { 1 } F ( x , \theta ) = \nabla _ { 1 } ^ { 2 } f ( x , \theta )$ and $\partial _ { 2 } F ( x , \theta ) = \partial _ { 2 } \nabla _ { 1 } f ( x , \theta )$ , the Hessian of $f$ in its first +159 argument and the Jacobian in the second argument of $\nabla _ { 1 } f ( x , \theta )$ . In practice, we use autodiff to +160 compute Jacobian products automatically. Equivalently, we can use the gradient descent fixed point + +$$ +T ( x , \theta ) = x - \eta \nabla _ { 1 } f ( x , \theta ) , +$$ + +161 which holds for all step sizes $\eta > 0$ . Using (3), it is easy to verify that we end up with the same linear +162 system since $\eta$ cancels out. +163 KKT conditions. We now show that the KKT conditions, manually differentiated in several works +164 [19, 35, 6, 53, 52], fit our framework. As we will see, the key will be to group the optimal primal and +65 dual variables as our $x ^ { \star } ( \theta )$ . Let us consider the general problem + +$$ +\operatorname { a r g m i n } _ { z \in \mathbb { R } ^ { p } } f ( z , \theta ) \quad { \mathrm { s u b j e c t ~ t o } } \quad G ( z , \theta ) \leq 0 , \ H ( z , \theta ) = 0 , +$$ + +where166 $z \in \mathbb { R } ^ { p }$ is the primal variable, $f \colon { \mathbb { R } } ^ { p } \times { \mathbb { R } } ^ { n } \to { \mathbb { R } }$ , $G \colon \mathbb { R } ^ { p } \times \mathbb { R } ^ { n } \to \mathbb { R } ^ { r }$ and $H \colon \mathbb { R } ^ { p } \times \mathbb { R } ^ { n } \to \mathbb { R } ^ { q }$ 167 The stationarity, primal feasibility and complementary slackness conditions give + +$$ +\begin{array} { r } { \nabla _ { 1 } f ( z , \theta ) + \left[ \partial _ { 1 } G ( z , \theta ) \right] ^ { \top } \boldsymbol { \lambda } + \left[ \partial _ { 1 } H ( z , \theta ) \right] ^ { \top } \boldsymbol { \nu } = 0 } \\ { H ( z , \theta ) = 0 } \\ { \boldsymbol { \lambda } \circ G ( z , \theta ) = 0 , } \end{array} +$$ + +168 where $\nu \in \mathbb { R } ^ { q }$ and $\lambda \in \mathbb { R } _ { + } ^ { r }$ are the dual variables, also known as KKT multipliers. The system of +169 (potentially nonlinear) equations (6) fits our framework, as we can group the primal and dual solutions +170 as $x ^ { \star } ( \theta ) = ( z ^ { \star } ( \theta ) , \nu ^ { \star } ( \theta ) , \lambda ^ { \star } ( \theta ) )$ to form the root of a function $F ( x ^ { \star } ( \theta ) , \theta )$ , where $F \colon \mathbb { R } ^ { d } \times \mathbb { R } ^ { n } $ +171 $\mathbb { R } ^ { d }$ and $d = p + q + r$ . The primal and dual solutions can be obtained from a generic solver, such as +172 an interior point method. In practice, the above mapping $F$ will be defined directly in Python (see +173 Figure 6 in Appendix A) and $F$ will be differentiated automatically via autodiff. +174 Proximal gradient fixed point. Unfortunately, not all algorithms return both primal and dual +175 solutions. Moreover, if the objective contains non-smooth terms, proximal gradient descent may be +176 more efficient. We now discuss its fixed point. Let $x ^ { \star } ( \theta )$ be implicitly defined as + +$$ +x ^ { \star } ( \theta ) : = \operatornamewithlimits { a r g m i n } _ { x \in \mathbb { R } ^ { d } } f ( x , \theta ) + g ( x , \theta ) , +$$ + +where 177 $f \colon { \mathbb { R } ^ { d } } \times { \mathbb { R } ^ { n } } \to { \mathbb { R } }$ is twice-differentiable convex and $g \colon { \mathbb { R } } ^ { d } \times { \mathbb { R } } ^ { n } \to { \mathbb { R } }$ is convex but possibly 178 non-smooth. Let us define the proximity operator associated with $g$ by + +$$ +\operatorname { p r o x } _ { g } ( y , \theta ) : = \underset { x \in \mathbb { R } ^ { d } } { \operatorname { a r g m i n } } \frac { 1 } { 2 } \| x - y \| _ { 2 } ^ { 2 } + g ( x , \theta ) . +$$ + +To implicitly differentiate through 179 $x ^ { \star } ( \theta )$ , we use the fixed point mapping [55, p.150] + +$$ +T ( x , \theta ) = \mathrm { p r o x } _ { \eta g } ( x - \eta \nabla _ { 1 } f ( x , \theta ) , \theta ) , +$$ + +180 for any step size $\eta > 0$ . The proximity operator is 1-Lipschitz continuous [50]. By Rademacher’s +181 theorem, it is differentiable almost everywhere. Many proximity operators enjoy a closed form and +182 can easily be differentiated, as discussed in Appendix $\mathbf { B }$ . +183 Projected gradient fixed point. As a special case, when $g ( x , \theta )$ is the indicator function $I _ { C ( \theta ) } ( x )$ , +184 where $\mathcal { C } ( \boldsymbol { \theta } )$ is a convex set depending on $\theta$ , we obtain + +$$ +x ^ { \star } ( \theta ) = \operatorname * { a r g m i n } _ { x \in { \mathcal { C } } ( \theta ) } f ( x , \theta ) . +$$ + +The proximity operator185 $\operatorname { p r o x } _ { g }$ becomes the Euclidean projection onto $\mathcal { C } ( \boldsymbol { \theta } )$ + +$$ +{ \mathrm { p r o x } } _ { g } ( y , \theta ) = { \mathrm { p r o j } } _ { \mathcal { C } } ( y , \theta ) : = { \underset { x \in { \mathcal { C } } ( \theta ) } { \operatorname { a r g m i n } } } \| x - y \| _ { 2 } ^ { 2 } +$$ + +186 and (7) becomes the projected gradient fixed point + +$$ +T ( x , \theta ) = \mathrm { p r o j } _ { \mathcal { C } } ( x - \eta \nabla _ { 1 } f ( x , \theta ) , \theta ) . +$$ + +187 Compared to the KKT conditions, this fixed point is particularly suitable when the projection enjoys +188 a closed form. We discuss how to compute the JVP $/$ VJP for a wealth of convex sets in Appendix B. +189 Mirror descent fixed point. We again consider the case when $x ^ { \star } ( \theta )$ is implicitly defined as the +190 solution of (8). We now generalize the projected gradient fixed point beyond Euclidean geometry. +191 Let the Bregman divergence $D _ { \varphi }$ : $\operatorname { d o m } ( \bar { \varphi } ) \cdot \operatorname { r e l i n t } ( \operatorname { d o m } ( \varphi ) ) \to \bar { \mathbb { R } } _ { + }$ generated by $\varphi$ be defined by + +$$ +D _ { \varphi } ( x , y ) : = \varphi ( x ) - \varphi ( y ) - \langle \nabla \varphi ( y ) , x - y \rangle . +$$ + +192 We define the Bregman projection of $y$ onto ${ \mathcal { C } } ( \theta ) \subseteq \mathrm { d o m } ( \varphi )$ by + +$$ +\begin{array} { r } { \mathrm { p r o j } _ { \mathcal { C } } ^ { \varphi } ( y , \theta ) : = \underset { x \in \mathcal { C } ( \theta ) } { \mathrm { a r g m i n } } D _ { \varphi } ( x , \nabla \varphi ^ { \ast } ( y ) ) . } \end{array} +$$ + +193 Definition (10) incudes the mirror map $\nabla \varphi ^ { * } ( y )$ for convenience. It can be seen as a mapping from +194 $\mathbb { R } ^ { d }$ to $\mathrm { d o m } ( \varphi )$ , ensuring that (10) is well-defined. The mirror descent fixed point mapping is then + +$$ +\begin{array} { c } { \hat { x } = \nabla \varphi ( x ) } \\ { y = \hat { x } - \eta \nabla _ { 1 } f ( x , \theta ) } \\ { T ( x , \theta ) = \mathrm { p r o j } _ { \mathcal { C } } ^ { \varphi } ( y , \theta ) . } \end{array} +$$ + +195 Because $T$ involves the composition of several functions, manually deriving its JVP/VJP is error +196 prone. This shows that our approach leveraging autodiff allows to handle more advanced fixed point +197 mappings. A common example of $\varphi$ is $\varphi ( \bar { x } ) \stackrel { - } { = } \langle x , \log x - 1 \rangle$ , where $\mathrm { d o m } ( \varphi ) = \mathbb { R } _ { + } ^ { d }$ . In this case, +198 $D _ { \varphi }$ is the Kullback-Leibler divergence. An advantage of the Kullback-Leibler projection is that it +199 sometimes easier to compute than the Euclidean projection, as we detail in Appendix B. + +200 Other fixed points. More fixed points are described in Appendix C. + +# 2.3 Jacobian bounds + +In practice, either by the limitations of finite precision arithmetic or because we perform a finite number of iterations, we rarely reach the exact solution $x ^ { \star } ( \theta )$ , but instead only reach an approximate solution $\hat { x }$ and apply the implicit differentiation equation (2) at this approximate solution. This motivates the need for approximation guarantees of this approach + +Definition 1. Let $F : \mathbb { R } ^ { d } \times \mathbb { R } ^ { n } \mathbb { R } ^ { d }$ be an optimality criterion mapping. Let $A : = - \partial _ { 1 } F$ and $B : = \partial _ { 2 } F$ . We define the Jacobian estimate at $( x , \theta )$ as the solution to the following linear equation $A ( x , \theta ) J ( x , \theta ) = B ( x , \theta )$ . It is a function $J : \mathbb { R } ^ { d } \times \mathbb { R } ^ { n } \mathbb { R } ^ { d \times n }$ . + +209 It holds by construction that $J ( x ^ { \star } ( \theta ) , \theta ) = \partial x ^ { \star } ( \theta )$ . Computing $J ( \hat { x } , \theta )$ for an approximate solution +210 $\hat { x }$ of $x ^ { \star } ( { \boldsymbol { \theta } } )$ therefore allows to approximate the true Jacobian ${ \partial x ^ { \star } ( \theta ) }$ . In practice, an algorithm used +211 to solve (1) depends on $\theta$ . Note however that, what we compute is not the Jacobian of ${ \hat { x } } ( \theta )$ , unlike +212 works unrolling an algorithm that differentiate through its iterations, but an estimate of ${ \partial x ^ { \star } ( \theta ) }$ . We +213 therefore use the notation $\hat { x }$ , leaving the dependence on $\theta$ implicit. +214 We develop bounds of the form $\| J ( \hat { x } , \theta ) - \partial x ^ { \star } ( \theta ) \| < C \| \hat { x } - x ^ { \star } ( \theta ) \|$ , hence showing that the error +215 on the estimated Jacobian is at most of the same order as that of $\hat { x }$ as an approximation of $x ^ { \star } ( \theta )$ +216 These bounds are based on the following main theorem, whose proof is included in Appendix D. + +![](images/0af66743a2db58959a3b656101274b1470dc7521e9804b31e74545d40ee6ada6.jpg) +Figure 2: CPU runtime comparison of implicit differentiation and unrolling for hyperparameter optimization of multiclass SVMs for multiple problem sizes. Error bars represent $90 \%$ confidence intervals. (a) Mirror descent solver, with mirror descent fixed point for implicit differentiation. $\mathbf { ( b ) }$ Proximal gradient solver, with proximal gradient fixed point for implicit differentiation. (c) Block coordinate descent solver; for implicit differentiation we obtain $x ^ { \star } ( \theta )$ by BCD but perform differentiation with the mirror descent and proximal gradient fixed points. This showcases that the solver and fixed point can be independently chosen. + +Theorem 1 (Jacobian estimate). Let 17 $F : \mathbb { R } ^ { d } \times \mathbb { R } ^ { n } \mathbb { R } ^ { d }$ . Assume that there exist $\alpha , \beta , \gamma , \varepsilon , R > 0$ such that 18 $A = - \partial _ { 1 } F$ and $B = \partial _ { 2 } F$ satisfy, for all $v \in \mathbb { R } ^ { d }$ , $\boldsymbol \theta \in \mathbb { R } ^ { n }$ and $x$ such that $\| x - x ^ { \star } ( \theta ) \| \leq \varepsilon$ : + +$A$ is well-conditioned, Lipschitz: $\| A ( x , \theta ) v \| \geq \alpha \| v \| , \| A ( x , \theta ) - A ( x ^ { \star } ( \theta ) , \theta ) \| _ { o p } \leq \gamma \| x - x ^ { \star } ( \theta ) \| .$ + +20 $B$ is bounded and Lipschitz: $\begin{array} { r } { | B ( x ^ { \star } ( \theta ) , \theta ) | | \leq R , \| B ( x , \theta ) - B ( x ^ { \star } ( \theta ) , \theta ) \| \leq \beta \| x - x ^ { \star } ( \theta ) \| . } \end{array}$ + +Under these conditions, when 21 $\| { \hat { x } } - x ^ { \star } ( \theta ) \| \leq \varepsilon$ , we have + +$$ +\begin{array} { r } { \| J ( \hat { x } , \theta ) - \partial x ^ { \star } ( \theta ) \| \leq \left( \beta \alpha ^ { - 1 } + \gamma R \alpha ^ { - 2 } \right) \| \hat { x } - x ^ { \star } ( \theta ) \| . } \end{array} +$$ + +222 This result is similar to [40, Theorem 7.2], that is concerned with the stability of solutions to inverse +223 problems. Here we consider that $A ( \cdot , \theta )$ is uniformly well-conditioned, rather than only at $x ^ { \star } ( \theta )$ . +224 This does not affect the first order in $\varepsilon$ of this bound, and makes it valid for all $\hat { x }$ . It is also more +225 tailored to applications to equation-specific cases. +26 Indeed, Theorem 1 can be applied to specific functions $F$ or $T$ for some root and fixed-point equations. +27 In particular, for gradient descent fixed point, where $T ( x , \theta ) = x - \eta \nabla _ { 1 } f ( x , \theta )$ , this yields +228 This guarantees precision on the estimated Jacobian under regularity conditions on $f$ directly; see +229 Corollary 1 in Appendix D. + +For proximal gradient descent, where 230 $T ( x , \theta ) = \mathrm { p r o x } _ { \eta g } ( x - \eta \nabla _ { 1 } f ( x , \theta ) , \theta )$ , this yields + +$$ +\begin{array} { r l } & { A ( x , \theta ) = I - \partial _ { 1 } T ( x , \theta ) = I - ( I - \eta \nabla _ { 1 } ^ { 2 } f ( x , \theta ) ) \partial _ { 1 } \mathrm { p r o x } _ { \eta g } ( x - \eta \nabla _ { 1 } f ( x , \theta ) , \theta ) } \\ & { B ( x , \theta ) = \partial _ { 2 } \mathrm { p r o x } _ { \eta g } ( x - \eta \nabla _ { 1 } f ( x , \theta ) , \theta ) - \eta \partial _ { 2 } \nabla _ { 1 } f ( x , \theta ) \partial _ { 1 } \mathrm { p r o x } _ { \eta g } ( x - \eta \nabla _ { 1 } f ( x , \theta ) , \theta ) . } \end{array} +$$ + +231 An important special case is that of a function to minimize in the form $f ( x , \theta ) + g ( x )$ , where the +232 prox function $g$ is smooth, and does not depend on $\theta$ , as is the case in our experiments in $\ S 3 . 2$ . For +233 this setting, we derive similar guarantees in Corollary 2 in Appendix D. Recent work also exploits +234 local smoothness of solutions to derive similar bounds [11, Theorem 13]. + +# 3 Experiments + +To conclude this work, we demonstrate the ease of formulating and solving bi-level optimization problems with our modular framework. We also present an application to the sensitivity analysis of molecular dynamics. + +# 3.1 Hyperparameter optimization of multiclass SVMs + +40 In this example, we consider the hyperparamer optimization of multiclass SVMs [23] trained in the dual. Here, 41 $x ^ { \star } ( \theta )$ is the optimal dual solution, a matrix of shape $m \times k$ , where $m$ is the number of + +Table 2: Mean AUC (and $9 5 \%$ confidence interval) for the cancer survival prediction problem. + +
MethodL1 logregL2 logregDictL + L2 logregTask-driven DictL
AUC (%)71.6 ± 2.072.4± 2.868.3 ± 2.373.2 ± 2.1
+ +242 training examples and $k$ is the number of classes, and $\theta \in \mathbb { R } _ { + }$ is the regularization parameter. The +243 challenge in differentiating $x ^ { \star } ( \theta )$ is that each row of $x ^ { \star } ( \theta )$ is constrained to belong to the probability +244 simplex $\triangle ^ { k }$ . More formally, let $X _ { \mathsf { t r } } \in \mathbb { R } ^ { m \times p }$ be the training feature matrix and $Y _ { \mathrm { t r } } \in \{ 0 , 1 \} ^ { m \times k }$ be +245 the training labels (in row-wise one-hot encoding). Let $W ( x , \theta ) : = X _ { \mathrm { t r } } ^ { \top } ( Y _ { \mathrm { t r } } - x ) / \theta \in \bar { \mathbb { R } } ^ { p \times k }$ be the +246 dual-primal mapping. Then, we consider the following bi-level optimization problem + +$$ +\operatorname * { a r g m i n } _ { \boldsymbol { x } = \mathrm { e x p } ( \boldsymbol { x } ) } \frac { 1 } { 2 } \| X _ { \mathrm { v a l } } W ( \boldsymbol { x } ^ { \star } ( \boldsymbol { \theta } ) , \boldsymbol { \theta } ) - Y _ { \mathrm { v a l } } \| _ { F } ^ { 2 } \quad \mathrm { s u b j e c t ~ t o } \quad \boldsymbol { x } ^ { \star } ( \boldsymbol { \theta } ) = \operatorname * { a r g m i n } _ { \boldsymbol { x } \in \mathcal { C } } f ( \boldsymbol { x } , \boldsymbol { \theta } ) : = \frac { \theta } { 2 } \| W ( \boldsymbol { x } , \boldsymbol { \theta } ) \| _ { F } ^ { 2 } , +$$ + +247 where $\mathcal { C } = \triangle ^ { k } \times \cdot \cdot \cdot \times \triangle ^ { k }$ is the Cartesian product of $m$ probability simplices. We apply the change +248 of variable $\theta = \exp ( \lambda )$ in order to guarantee that the hyper-parameter $\theta$ is positive. The matrix +249 $W ( x ^ { \star } ( \theta ) , \theta ) \in \mathbb { R } ^ { p \times k }$ contains the optimal primal solution, the feature weights for each class. The +250 outer loss is computed against validation data $X _ { \mathtt { v a l } }$ and $Y _ { \tt v a l }$ . +251 In order to differentiate $x ^ { \star } ( \theta )$ , several ways are possible using our framework. The first one would be +252 to map (12) to a quadratic program form (18) and use the KKT conditions to form a mapping $F ( x , \theta )$ . +253 A more direct way is to use proximal gradient fixed point (9). Since $\mathcal { C }$ is a Cartesian product, the +254 projection can be easily computed by row-wise projections on the simplex, which we map over rows +255 (using vectorized operations) via ${ \mathrm { j a x . v m a p } }$ . As we explained in $\ S \mathbf { B } . 1$ , this projection’s Jacobian +256 enjoys a closed form. A third way to differentiate $x ^ { \star } ( \theta )$ is using the mirror descent fixed point +257 (11). Under the KL geometry, proj $\overset { \varphi } { c } ( y , \theta )$ corresponds to a row-wise softmax. It is therefore easy to +258 compute and differentiate. Figure 2 compares the runtime performance of implicit differentiation vs. +259 unrolling for the latter two fixed points. A code example is included in Figure 8 in the Appendix. + +# 3.2 Task-driven dictionary learning + +261 Task-driven dictionary learning was proposed to learn sparse codes for input data in such a way that +262 the codes solve an outer learning problem [47, 64, 70]. Formally, given a data matrix $X _ { \mathsf { t r } } \in \dot { \mathbb { R } } ^ { m \times p }$ +263 and a dictionary of $k$ atoms $\theta \in \mathbb { R } ^ { k \times p }$ , a sparse code is defined as a matrix $\boldsymbol { x } ^ { \star } ( \boldsymbol { \theta } ) \in \mathbb { R } ^ { m \times k }$ that +264 minimizes in $x$ a reconstruction loss $f ( x , \theta ) \mathrel { \mathop : } = \ell ( X _ { \mathrm { t r } } , x \theta )$ regularized by a sparsity-inducing penalty +265 $g ( x )$ . Instead of optimizing the dictionary $\theta$ to minimize the reconstruction loss, [47] proposed to +266 optimize an outer problem that depends on the code. For example, given a set of labels $Y _ { \mathbf { t r } } \in \{ 0 , 1 \} ^ { m }$ +267 we consider a logistic regression problem which results in the bilevel optimization problem: + +$$ +\underbrace { \operatorname* { m i n } _ { \theta \in \mathbb { R } ^ { k \times p } , w \in \mathbb { R } ^ { k } , b \in \mathbb { R } } \sigma ( x ^ { \star } ( \theta ) w + b ; y _ { \mathrm { t r } } ) } _ { \mathrm { o u t e r ~ p r o b l e m } } \mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \star } ( \theta ) \in \underbrace { \mathrm { a r g m i n ~ } f ( x , \theta ) + g ( x ) } _ { \mathrm { i n n e r ~ p r o b l e m } } . +$$ + +268 When $\ell$ is the squared Frobenius distance between matrices, and $g$ the elastic net penalty, [47, Eq. +269 21] derive manually, using optimality conditions (notably the support of the codes selected at the +270 optimum), an explicit re-parameterization of $x ^ { \star } ( \theta )$ as a linear system involving $\theta$ . This closed +271 form allows for a direct computation of the Jacobian of $x ^ { \star }$ w.r.t. $\theta$ . Similarly, [64] derive first +272 order conditions in the case where $\ell$ is a $\beta$ -divergence, while [70] propose to use unrolling of ISTA +273 iterations. Our approach bypasses all of these computations, giving the user more leisure to focus +274 directly on modeling (loss, regularizer) aspects (see code snippet in Figure 9 in Appendix). +275 We illustrate this on a problem of breast cancer survival prediction from gene expression data, +276 framed as a binary classification problem to discriminate patients who survive longer than 5 years +277 $( m _ { 1 } = 2 0 0 )$ vs patients who die within 5 years of diagnosis $m _ { 0 } = 9 9 ,$ ), from $p = 1 , 0 0 0$ gene +278 expression values. As shown in Table 2, solving (13) (Task-driven DictL) reaches a classification +279 performance competitive with state-of-the-art $L _ { 1 }$ or $L _ { 2 }$ regularized logistic regression with 100 times +280 fewer variables. See Appendix E.2 for more details. + +![](images/3ee0f32e6f80a02150d66af9cd3d4abfc0547511f8cbe6272c79b60b2929a87c.jpg) +Figure 3: Distilled MNIST dataset $\boldsymbol { \theta } \in \mathbb { R } ^ { k \times p }$ obtained by solving (14). We learn one image per class such that a logistic regression model trained on $\theta$ achieves the lowest logistic loss on the MNIST training set. Implicit differentiation was 4 times faster than unrolling. + +# 281 3.3 Dataset distillation + +282 Dataset distillation [67, 46] aims to learn a small synthetic training dataset such that a model trained +283 on this learned data set achieves small loss on the original training set. Formally, let $X _ { \mathsf { t r } } \in \mathbb { R } ^ { m \times p }$ and +284 $y _ { \mathrm { t r } } \in [ k ] ^ { m }$ denote the original training set. The distilled dataset will contain one prototype example +285 for each class and therefore $\boldsymbol { \theta } \in \mathbb { R } ^ { k \times p }$ . The dataset distillation problem can then naturally be cast as +286 a bi-level problem, where in the inner problem we estimate a logistic regression model $\dot { { \boldsymbol { x } } } ^ { \star } ( { \boldsymbol { \theta } } ) \in \mathbb { R } ^ { p }$ +287 trained on the distilled images $\boldsymbol { \theta } \in \mathbb { R } ^ { k \times p }$ , while in the outer problem we want to minimize the loss +288 achieved by $x ^ { \star } ( \theta )$ over the training set: + +$$ +\operatorname * { a r g m i n } _ { \theta \in \mathbb { R } ^ { k \times p } } f ( x ^ { \star } ( \theta ) , X _ { \mathrm { t r } } ; y _ { \mathrm { t r } } ) \mathrm { ~ } \mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \star } ( \theta ) \in \underset { x \in \mathbb { R } ^ { p } } { \operatorname { a r g m i n } } f ( x , \theta ; [ k ] ) + \varepsilon \| x \| ^ { 2 } , +$$ + +289 where $f ( x , X ; y ) : = \ell ( X x , y )$ , $\ell$ denotes the multiclass logistic regression loss, and $\varepsilon = 1 0 ^ { - 3 }$ is a +290 regularization parameter that we found had a very positive effect on convergence. +In this problem, and unlike in the general hyperparameter optimization setup, both the inner and outer +2 problems are high-dimensional, making it an ideal test-bed for gradient-based bi-level optimization +93 methods. For this experiment, we use the MNIST dataset. The number of parameters in the inner +4 problem is $p = 2 8 ^ { 2 } \overset { \cdot } { = } 7 8 4$ . while the number of parameters of the outer loss is $k \times p = 7 8 4 0$ . We +95 solve this problem using gradient descent on both the inner and outer problem, with the gradient +96 of the outer loss computed using implicit differentiation, as described in $\ S 2$ . This is fundamentally +7 different from the approach used in the original paper, where they used differentiation of the unrolled +98 iterates instead. For the same solver, we found that the implicit differentiation approach was 4 times +99 faster than the original one. The obtained distilled images $\theta$ are visualized in Figure 3 and a code +00 example is given in Figure 10 in the Appendix. + +# 3.4 Sensitivity analysis of molecular dynamics + +302 Many applications of physical simulations require solving optimiza +303 tion problems, such as energy minimization in molecular [62] and +304 continuum [8] mechanics, structural optimization [41] and data +305 assimilation [32]. However, even fully differentiable simulators +306 may not have efficient or accurate derivatives. We revisit an exam +307 ple from JAX-MD [62], the problem of finding energy minimizing +308 configurations to a system of packed particles in an $m$ -dimensional +309 box of width $\ell$ , + +$$ +x ^ { \star } ( \theta ) = { \underset { x \in \mathbb { R } ^ { k \times m } } { \operatorname { a r g m i n } } } \sum _ { i j } U ( x _ { i j } \mod \ell , \theta ) , +$$ + +![](images/7f44b1e279d58fbab587c01b99912576abba62a2346e36362db11cf427b8a046.jpg) +Figure 4: Particle positions and position sensitivity vectors, with respect to increasing the diameter of the blue particles. + +310 where $U ( x _ { i j } , \theta )$ is the pairwise potential energy function, with half +311 the particles at diameter 1 and half at diameter $\theta = 0 . 6$ , which we +312 optimize with a domain-specific optimizer [13]. Here we consider +313 sensitivity of particle position with respect to diameter ${ \partial x ^ { \star } ( \theta ) }$ , +314 rather than sensitivity of the total energy from the original experi +315 ment. Figure 4 shows results calculated via forward-mode implicit differentiation (JVP). Whereas +316 differentiating the unrolled optimizer happens to work for total energy, here it typically does not even +317 converge (see Appendix Fig. 15), due the discontinuous optimization method. + +[1] M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving, M. Isard, et al. Tensorflow: A system for large-scale machine learning. In 12th $\{ U S E N I X \}$ symposium on operating systems design and implementation $\langle \mathit { 5 O S D I } \} \mathit { 1 6 } \rangle$ , pages 265–283, 2016. +[2] A. Agrawal, B. Amos, S. Barratt, S. Boyd, S. Diamond, and Z. Kolter. Differentiable convex optimization layers. arXiv preprint arXiv:1910.12430, 2019. +[3] A. Agrawal, S. Barratt, S. Boyd, E. Busseti, and W. M. Moursi. Differentiating through a cone program. arXiv preprint arXiv:1904.09043, 2019. +[4] A. Ali, E. Wong, and J. Z. Kolter. A semismooth newton method for fast, generic convex programming. In International Conference on Machine Learning, pages 70–79. PMLR, 2017. +[5] B. Amos. Differentiable optimization-based modeling for machine learning. PhD thesis, PhD thesis. Carnegie Mellon University, 2019. +[6] B. Amos and J. Z. Kolter. Optnet: Differentiable optimization as a layer in neural networks. In Proc. of ICML, pages 136–145, 2017. +[7] S. Bai, J. Z. Kolter, and V. Koltun. Deep equilibrium models. arXiv preprint arXiv:1909.01377, 2019. +[8] A. Beatson, J. Ash, G. Roeder, T. Xue, and R. P. Adams. Learning composable energy surrogates for pde order reduction. In H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, editors, Advances in Neural Information Processing Systems, volume 33, pages 338–348. Curran Associates, Inc., 2020. +[9] Y. Bengio. Gradient-based optimization of hyperparameters. Neural computation, 12(8):1889– 1900, 2000. +[10] Q. Bertrand, Q. Klopfenstein, M. Blondel, S. Vaiter, A. Gramfort, and J. Salmon. Implicit differentiation of lasso-type models for hyperparameter optimization. In Proc. of ICML, pages 810–821, 2020. +[11] Q. Bertrand, Q. Klopfenstein, M. Massias, M. Blondel, S. Vaiter, A. Gramfort, and J. Salmon. Implicit differentiation for fast hyperparameter selection in non-smooth convex learning. arXiv preprint arXiv:2105.01637, 2021. +[12] M. J. Best, N. Chakravarti, and V. A. Ubhaya. Minimizing separable convex functions subject to simple chain constraints. SIAM Journal on Optimization, 10(3):658–672, 2000. +[13] E. Bitzek, P. Koskinen, F. Gähler, M. Moseler, and P. Gumbsch. Structural relaxation made simple. Phys. Rev. Lett., 97:170201, Oct 2006. +[14] M. Blondel. Structured prediction with projection oracles. In Proc. of NeurIPS, 2019. +[15] M. Blondel, V. Seguy, and A. Rolet. Smooth and sparse optimal transport. In Proc. of AISTATS, pages 880–889. PMLR, 2018. +[16] M. Blondel, O. Teboul, Q. Berthet, and J. Djolonga. Fast differentiable sorting and ranking. In Proc. of ICML, pages 950–959, 2020. +[17] J. Bradbury, R. Frostig, P. Hawkins, M. J. Johnson, C. Leary, D. Maclaurin, and S. WandermanMilne. Jax: composable transformations of python $^ +$ numpy programs, 2018. URL http://github. com/google/jax, 4:16, 2020. +[18] P. Brucker. An $O ( n )$ algorithm for quadratic knapsack problems. Operations Research Letters, 3(3):163–166, 1984. +[19] O. Chapelle, V. Vapnik, O. Bousquet, and S. Mukherjee. Choosing multiple parameters for support vector machines. Machine learning, 46(1):131–159, 2002. +[20] X. Chen, Y. Zhang, C. Reisinger, and L. Song. Understanding deep architecture with reasoning layer. Advances in Neural Information Processing Systems, 33, 2020. +[21] H. Cherkaoui, J. Sulam, and T. Moreau. Learning to solve tv regularised problems with unrolled algorithms. Advances in Neural Information Processing Systems, 33, 2020. +[22] L. Condat. Fast projection onto the simplex and the $\ell _ { 1 }$ ball. Mathematical Programming, 158(1-2):575–585, 2016. +[23] K. Crammer and Y. Singer. On the algorithmic implementation of multiclass kernel-based vector machines. Journal of machine learning research, 2(Dec):265–292, 2001. +[24] M. Cuturi. Sinkhorn distances: lightspeed computation of optimal transport. In Advances in Neural Information Processing Systems, volume 2, 2013. +[25] C.-A. Deledalle, S. Vaiter, J. Fadili, and G. Peyré. Stein unbiased gradient estimator of the risk (sugar) for multiple parameter selection. SIAM Journal on Imaging Sciences, 7(4):2448–2487, 2014. +[26] S. Diamond and S. Boyd. Cvxpy: A python-embedded modeling language for convex optimization. The Journal of Machine Learning Research, 17(1):2909–2913, 2016. +[27] J. Djolonga and A. Krause. Differentiable learning of submodular models. Proc. of NeurIPS, 30:1013–1023, 2017. +[28] J. Domke. Generic methods for optimization-based modeling. In Artificial Intelligence and Statistics, pages 318–326. PMLR, 2012. +[29] J. C. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra. Efficient projections onto the $\ell _ { 1 }$ -ball for learning in high dimensions. In Proc. of ICML, 2008. +[30] L. Franceschi, M. Donini, P. Frasconi, and M. Pontil. Forward and reverse gradient-based hyperparameter optimization. In International Conference on Machine Learning, pages 1165– 1173. PMLR, 2017. +[31] L. Franceschi, P. Frasconi, S. Salzo, R. Grazzi, and M. Pontil. Bilevel programming for hyperparameter optimization and meta-learning. In International Conference on Machine Learning, pages 1568–1577. PMLR, 2018. +[32] T. Frerix, D. Kochkov, J. A. Smith, D. Cremers, M. P. Brenner, and S. Hoyer. Variational data assimilation with a learned inverse observation operator. 2021. +[33] R. Frostig, M. Johnson, D. Maclaurin, A. Paszke, and A. Radul. Decomposing reverse-mode automatic differentiation. In LAFI 2021 workshop at POPL, 2021. +[34] R. Frostig, M. J. Johnson, and C. Leary. Compiling machine learning programs via high-level tracing. Machine Learning and Systems (MLSys), 2018. +[35] S. Gould, B. Fernando, A. Cherian, P. Anderson, R. S. Cruz, and E. Guo. On differentiating parameterized argmin and argmax problems with application to bi-level optimization. arXiv preprint arXiv:1607.05447, 2016. +[36] S. Gould, R. Hartley, and D. Campbell. Deep declarative networks: A new hope. arXiv preprint arXiv:1909.04866, 2019. +[37] S. Grotzinger and C. Witzgall. Projections onto order simplexes. Applied mathematics and Optimization, 12(1):247–270, 1984. +[38] I. Guyon. Design of experiments of the nips 2003 variable selection benchmark. In NIPS 2003 workshop on feature extraction and feature selection, volume 253, 2003. +[39] M. R. Hestenes, E. Stiefel, et al. Methods of conjugate gradients for solving linear systems, volume 49. NBS Washington, DC, 1952. +407 [40] N. J. Higham. Accuracy and Stability of Numerical Algorithms. Society for Industrial and Applied Mathematics, second edition, 2002. +409 [41] S. Hoyer, J. Sohl-Dickstein, and S. Greydanus. Neural reparameterization improves structural optimization. 2019. [42] Y. Kim, C. Denton, L. Hoang, and A. M. Rush. Structured attention networks. arXiv preprint arXiv:1702.00887, 2017. +413 [43] D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. +415 [44] S. G. Krantz and H. R. Parks. The implicit function theorem: history, theory, and applications. Springer Science & Business Media, 2012. +417 [45] C. H. Lim and S. J. Wright. Efficient bregman projections onto the permutahedron and related polytopes. In Proc. of AISTATS, pages 1205–1213. PMLR, 2016. +419 [46] J. Lorraine, P. Vicol, and D. Duvenaud. Optimizing millions of hyperparameters by implicit differentiation. In International Conference on Artificial Intelligence and Statistics, pages 1540–1552. PMLR, 2020. +422 [47] J. Mairal, F. Bach, and J. Ponce. Task-driven dictionary learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(4):791–804, 2012. +424 [48] A. F. Martins and R. F. Astudillo. From softmax to sparsemax: A sparse model of attention and multi-label classification. In Proc. of ICML, 2016. +426 [49] C. Michelot. A finite algorithm for finding the projection of a point onto the canonical simplex of $\mathbb { R } ^ { n }$ . Journal of Optimization Theory and Applications, 50(1):195–200, 1986. +428 [50] J.-J. Moreau. Proximité et dualité dans un espace hilbertien. Bulletin de la S.M.F., 93:273–299, 1965. +430 [51] V. Niculae and M. Blondel. A regularized framework for sparse and structured neural attention. In Proc. of NeurIPS, 2017. +432 [52] V. Niculae and A. Martins. Lp-sparsemap: Differentiable relaxed optimization for sparse structured prediction. In International Conference on Machine Learning, pages 7348–7359, 2020. +435 [53] V. Niculae, A. Martins, M. Blondel, and C. Cardie. Sparsemap: Differentiable sparse structured inference. In International Conference on Machine Learning, pages 3799–3808. PMLR, 2018. +437 [54] B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd. Conic optimization via operator splitting and homogeneous self-dual embedding. Journal of Optimization Theory and Applications, 169(3):1042–1068, 2016. +440 [55] N. Parikh and S. Boyd. Proximal algorithms. Foundations and Trends in optimization, 1(3):127– 239, 2014. +442 [56] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, et al. Pytorch: An imperative style, high-performance deep learning library. arXiv preprint arXiv:1912.01703, 2019. +445 [57] F. Pedregosa. Hyperparameter optimization with approximate gradient. In International conference on machine learning. PMLR, 2016. +447 [58] F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay. Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12:2825–2830, 2011. [59] A. Rajeswaran, C. Finn, S. Kakade, and S. Levine. Meta-learning with implicit gradients. arXiv preprint arXiv:1909.04630, 2019. + +453 [60] N. Rappoport and R. Shamir. Multi-omic and multi-view clustering algorithms: review and +454 cancer benchmark. Nucleic Acids Res., 46:10546–10562, 2018. +455 [61] Y. Saad and M. H. Schultz. Gmres: A generalized minimal residual algorithm for solving +456 nonsymmetric linear systems. SIAM Journal on scientific and statistical computing, 7(3):856– +457 869, 1986. +458 [62] S. Schoenholz and E. D. Cubuk. Jax md: A framework for differentiable physics. In +459 H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, editors, Advances in Neural +460 Information Processing Systems, volume 33, pages 11428–11441. Curran Associates, Inc., +461 2020. +462 [63] M. W. Seeger. Cross-validation optimization for large scale structured classification kernel +463 methods. Journal of Machine Learning Research, 9(6), 2008. +464 [64] P. Sprechmann, A. M. Bronstein, and G. Sapiro. Supervised non-euclidean sparse nmf via +465 bilevel optimization with applications to speech enhancement. In 2014 4th Joint Workshop on +466 Hands-free Speech Communication and Microphone Arrays (HSCMA), pages 11–15. IEEE, +467 2014. +468 [65] S. Vaiter, C.-A. Deledalle, G. Peyré, C. Dossal, and J. Fadili. Local behavior of sparse analysis +469 regularization: Applications to risk estimation. Applied and Computational Harmonic Analysis, +470 35(3):433–451, 2013. +471 [66] H. A. v. d. Vorst and H. A. van der Vorst. Bi-CGSTAB: A fast and smoothly converging variant +472 of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and +473 Statistical Computing, 13(2):631–644, 1992. +474 [67] T. Wang, J.-Y. Zhu, A. Torralba, and A. A. Efros. Dataset distillation. arXiv preprint +475 arXiv:1811.10959, 2018. +476 [68] R. E. Wengert. A simple automatic derivative evaluation program. Communications of the ACM, +477 7(8):463–464, 1964. +478 [69] Y. Wu, M. Ren, R. Liao, and R. B. Grosse. Understanding short-horizon bias in stochastic +479 meta-optimization. In 6th International Conference on Learning Representations, ICLR 2018, +480 Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenRe +481 view.net, 2018. +482 [70] J. Zarka, L. Thiry, T. Angles, and S. Mallat. Deep network classification by scattering and +483 homotopy dictionary learning. arXiv preprint arXiv:1910.03561, 2019. + +1. For all authors... + +(a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope? [Yes] Our paper builds on the premise that reinstantiating the implicit function theorem for every optimization problem a user may encounter is cumbersome. We make the case that a modular approach is needed to bypass that issue. This approach raises several challenges, notably in the way these implicit solvers can be automatically instantiated, consistently, across the large corpus of optimization approaches favored by users. +(b) Did you describe the limitations of your work? [Yes] , We discuss several limitations in our work. For instance, implicit differentiation requires $\hat { x }$ to be sufficiently close to $x ^ { \star }$ to be meaningful. This is the main topic of $\ S 2 . 3$ +(c) Did you discuss any potential negative societal impacts of your work? [N/A] As a purely methodological paper, we do not foresee negative societal impacts of our work. +(d) Have you read the ethics review guidelines and ensured that your paper conforms to them? [Yes] We confirm our paper conforms to those guidelines. + +2. If you are including theoretical results... + +(a) Did you state the full set of assumptions of all theoretical results? [Yes] , The paper contains one theoretical section, $\ S 2 . 3$ . +(b) Did you include complete proofs of all theoretical results? [Yes] , All proofs are included in the Appendix D + +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)? [No] At the time of submission, we are in the course of an approval process for open-source release required by our organization. We believe that the library itself comprises a contribution, and will have it available in open source by the time of this paper’s publication (at the latest). +(b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)? [Yes] , Experiments were mostly run with minimal parameter tuning to reflect the simplicity of the approach we advocate. This is reflected in $\ S 3$ and Appendix E +(c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)? [Yes] , see Figure 2 and std for the dictionary learning task. +(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 Appendix E + +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 $\ S 3$ and Appendix E +(b) Did you mention the license of the assets? [Yes] , see Appendix E +(c) Did you include any new assets either in the supplemental material or as a URL? [N/A] +(d) Did you discuss whether and how consent was obtained from people whose data you’re using/curating? [N/A] +(e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content? [N/A] + +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/D8-iwC9UN3/D8-iwC9UN3_content_list.json b/parse/train/D8-iwC9UN3/D8-iwC9UN3_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..8abf3182541da6b12bd3849adfb560e8f390a795 --- /dev/null +++ b/parse/train/D8-iwC9UN3/D8-iwC9UN3_content_list.json @@ -0,0 +1,1544 @@ +[ + { + "type": "text", + "text": "Efficient and Modular Implicit Differentiation ", + "text_level": 1, + "bbox": [ + 217, + 122, + 779, + 147 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Anonymous Author(s) \nAffiliation \nAddress \nemail ", + "bbox": [ + 423, + 200, + 580, + 256 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Abstract ", + "text_level": 1, + "bbox": [ + 462, + 292, + 535, + 309 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 Automatic differentiation (autodiff) has revolutionized machine learning. It allows \n2 expressing complex computations by composing elementary ones in creative ways \n3 and removes the burden of computing their derivatives by hand. More recently, \n4 differentiation of optimization problem solutions has attracted widespread attention \n5 with applications such as optimization as a layer, and in bi-level problems such as \n6 hyper-parameter optimization and meta-learning. However, the formulas for these \n7 derivatives often involve case-by-case tedious mathematical derivations. In this \n8 paper, we propose a unified, efficient and modular approach for implicit differentia \n9 tion of optimization problems. In our approach, the user defines (in Python in the \n10 case of our implementation) a function $F$ capturing the optimality conditions of \n11 the problem to be differentiated. Once this is done, we leverage autodiff of $F$ and \n12 implicit differentiation to automatically differentiate the optimization problem. Our \n13 approach thus combines the benefits of implicit differentiation and autodiff. We \n14 show that seemingly simple principles allow to recover many recently proposed im \n15 plicit differentiation methods and create new ones easily. We demonstrate the ease \n16 of formulating and solving bi-level optimization problems using our framework. \n17 We also showcase an application to the sensitivity analysis of molecular dynamics. ", + "bbox": [ + 148, + 324, + 766, + 559 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "18 1 Introduction ", + "text_level": 1, + "bbox": [ + 148, + 585, + 310, + 603 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "19 Automatic differentiation (autodiff) is now an inherent part of machine learning software. It allows \n20 expressing complex computations by composing elementary ones in creative ways and removes \n21 the tedious burden of computing their derivatives by hand. The differentiation of optimization \n22 problem solutions has found many applications. A classical example is bi-level optimization, which \n23 typically involves computing the derivatives of a nested optimization problem in order to solve \n24 an outer one. Examples of applications in machine learning include hyper-parameter optimization \n25 [19, 63, 57, 30, 10, 11], neural networks [46], and meta-learning [31, 59]. Another line of applications \n26 is “optimization as a layer” [42, 6, 51, 27, 36, 7], which usually includes regularization or constraints \n27 in the optimization problem in order to impose desirable structure on the layer output. In addition \n28 to providing well sought-for interpretability, recent research indicates that such structure could be \n29 beneficial in order to improve generalization of neural networks [20]. \n30 Since optimization problem solutions typically do not enjoy an explicit formula in terms of their \n31 inputs, autodiff cannot be used directly to differentiate these functions. In recent years, two main \n32 approaches have been developed to circumvent this problem. The first one consists in unrolling the \n33 iterations of an optimization algorithm and to use the final iteration as a proxy for the optimization \n34 problem solution [68, 28, 25, 31]. An advantage of this approach is that autodiff through the algorithm \n35 iterates can then be used transparently. However, this requires a reimplementation of the algorithm \n36 using the autodiff system, and not all algorithms are necessarily autodiff friendly. Moreover, forward \n37 mode autodiff has time complexity that scales linearly with the number of variables and reverse-mode \n38 autodiff has memory complexity that scales linearly with the number of algorithm iterations. A second \n39 approach is to see optimization problem solutions as implicitly-defined functions of certain optimality \n40 conditions. Examples include stationary conditions [9, 46], KKT conditions [19, 35, 6, 53, 52] and \n41 the proximal gradient fixed point [51, 10, 11]. An advantage of such implicit differentiation is that \n42 a reimplementation is not needed, allowing to build upon state-of-the-art software. However, so \n43 far, obtaining the implicit differentiation formulas required a case-by-case tedious mathematical \n44 derivation. Recent work [2] attempts to address this issue by adding implicit differentiation on top of \n45 cvxpy [26]. This works by reducing all convex optimization problems to a conic program and using \n46 conic programming’s optimality conditions to derive an implicit differentiation formula. While this \n47 approach is very generic, solving a convex optimization problem using a conic programming solver— \n48 an ADMM-based splitting conic solver [54] in the case of cvxpy—is rarely the state-of-the-art \n49 approach for each particular problem instance. \n50 In this work, we adopt a different strategy, which allows to easily add implicit differentiation on top \n51 of existing solvers. In our approach, the user defines (in Python in the case of our implementation) \n52 a mapping function $F$ capturing the optimality conditions of the problem solved by the algorithm. \n53 Once this is done, we leverage autodiff of $F$ combined with implicit differentiation techniques to \n54 automatically differentiate the optimization problem solution. In this way, our approach is very \n55 generic and still the efficiency of state-of-the-art solvers. It therefore combines the benefits of implicit \n56 differentiation and autodiff. To summarize, we make the following contributions. ", + "bbox": [ + 145, + 617, + 825, + 768 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 147, + 776, + 825, + 900 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 145, + 90, + 825, + 243 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 147, + 250, + 825, + 347 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• We delineate extremely general principles for implicitly differentiating through an optimization problem solution. Our approach can be seen as “hybrid”, in the sense that it combines implicit differentiation with autodiff of the optimality conditions. \n• We show how to instantiate our framework in order to recover many recently-proposed implicit differentiation schemes, thereby providing a unifying perspective. We also obtain new implicit differentiation schemes, such as the one based on the mirror descent fixed point. \n• On the theoretical side, we provide new bounds on the Jacobian error when the optimization problem is only solved approximately. \n• We describe a JAX implementation and provide a blueprint for implementing our approach in other frameworks. We will open-source a full-fledged library for implicit differentiation in JAX. \n• We implement four illustrative applications, demonstrating our framework’s ease of use. ", + "bbox": [ + 163, + 353, + 826, + 526 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "68 In essence, our implementation significantly extends JAX’s default autodiff system in context of the \n69 numerical optimization domain. From an end user’s perspective, autodiff with JAX simply becomes \n70 more efficient if they use solvers with implicit differentiation set up by our framework. \n71 Notation. We denote the gradient and Hessian of $f \\colon { \\mathbb { R } ^ { d } } \\to { \\mathbb { R } }$ evaluated at $x \\in \\mathbb { R } ^ { d }$ by $\\nabla f ( x ) \\in$ \n72 $\\mathbb { R } ^ { d }$ and $\\nabla ^ { 2 } f ( x ) \\ \\in \\ \\mathbb { R } ^ { d \\times d }$ . We denote the Jacobian of $F \\colon \\mathbb { R } ^ { d } \\ \\ \\mathbb { R } ^ { p }$ evaluated at $x \\in \\mathbb { R } ^ { d }$ by \n73 $\\partial F ( x ) \\in \\mathbb { R } ^ { p \\times d }$ . When $f$ or $F$ have several arguments, we denote the gradient, Hessian and Jacobian \n74 in the $i ^ { \\mathrm { { t h } } }$ argument by $\\nabla _ { i }$ , $\\nabla _ { i } ^ { 2 }$ and $\\partial _ { i }$ , respectively. The standard probability simplex is denoted \n75 by $\\triangle ^ { d } : = \\{ x \\in \\mathbb { R } ^ { d } \\colon \\| x \\| _ { 1 } = 1 , x \\geq 0 \\}$ . For any set $\\mathcal { C } \\subset \\mathbb { R } ^ { d }$ , we denote by $I _ { \\mathcal { C } }$ the function \n76 $\\mathbb { R } ^ { d } \\to \\mathbb { R } \\cup \\{ + \\infty \\}$ where $I _ { \\mathit { C } } ( x ) = 0$ if $x \\in { \\mathcal { C } }$ , $I _ { C } ( x ) = + \\infty$ otherwise. For a vector or matrix $A$ , we \n77 note $\\| A \\|$ the Frobenius (or Euclidean) norm, and $\\| A \\| _ { \\mathrm { o } p }$ the operator norm. ", + "bbox": [ + 147, + 531, + 825, + 574 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 147, + 592, + 825, + 696 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 Proposed framework: combining implicit differentiation and autodiff ", + "text_level": 1, + "bbox": [ + 160, + 718, + 784, + 736 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2.1 General principles ", + "text_level": 1, + "bbox": [ + 165, + 752, + 341, + 767 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Overview. Contrary to unrolling of algorithm iterations, implicit differentiation typically involves a manual, sometimes complicated, mathematical derivation. For instance, numerous works [19, 35, 6, 53, 52] use Karush–Kuhn–Tucker (KKT) conditions in order to relate a constrained optimization problem’s solution to its inputs, and to manually derive a formula for its derivatives. The derivation and implementation is typically case-by-case. ", + "bbox": [ + 171, + 780, + 825, + 849 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "85 In this work, we propose a general way to easily add implicit differentiation on top of existing solvers. \n86 In our approach, the user defines (in Python in the case of our implementation) a mapping function \n87 $F$ capturing the optimality conditions of the problem solved by the algorithm. We provide reusable \n88 building blocks to easily express such $F$ . Once this is done, we leverage autodiff of $F$ combined with \n89 implicit differentiation to automatically differentiate the optimization problem solution. A simple \n90 illustrative example is given in Figure 1. ", + "bbox": [ + 148, + 856, + 825, + 911 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/54ed46780257aac9d2be9edbb82db1f5cfb576d08726ad6f832a85f9ef6a61f7.jpg", + "image_caption": [ + "Figure 1: Example: adding implicit differentiation on top of a ridge regression solver. The function $f ( x , \\theta )$ defines the objective function and the mapping $F$ , here simply equation (4), captures the optimality conditions. The decorator @custom_root (provided by our library) automatically adds implicit differentiation to the solver for the user. The last line evaluates the Jacobian at $\\theta = 1 0$ . " + ], + "image_footnote": [], + "bbox": [ + 250, + 89, + 748, + 299 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 150, + 390, + 825, + 421 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "91 Differentiating a root. Let $F \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }$ be a user-provided mapping, capturing the optimality conditions of a problem. An optimal solution, denoted 92 $x ^ { \\star } ( \\theta )$ , should be a root of $F$ : ", + "bbox": [ + 147, + 433, + 826, + 463 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/c0d1311ab5a42c8b5ec24287733a86c3510f65a5d67dfc6b9ad73d6b4061cb22.jpg", + "text": "$$\nF ( x ^ { \\star } ( \\theta ) , \\theta ) = 0 .\n$$", + "text_format": "latex", + "bbox": [ + 437, + 469, + 558, + 488 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "93 We can see $x ^ { \\star } ( \\theta )$ as an implicitly defined function of $\\theta \\in \\mathbb { R } ^ { n }$ , i.e., $x ^ { \\star } \\colon { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }$ . Our goal \n94 is to differentiate $x ^ { \\star } ( \\theta )$ w.r.t. $\\theta$ . From the implicit function theorem [44], if $F$ is continuously \n95 differentiable and the Jacobian $\\partial _ { 1 } F$ evaluated at $x ^ { \\star } ( \\theta ) \\times \\theta$ is a square invertible matrix, then ${ \\partial x ^ { \\star } ( \\theta ) }$ \n96 exists. Using the chain rule, we know that the Jacobian ${ \\partial x ^ { \\star } ( \\theta ) }$ satisfies ", + "bbox": [ + 145, + 494, + 825, + 553 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/274800a6c9b20e4e783661d1373fddeac8575eeb8a60627b067af1c171e4265b.jpg", + "text": "$$\n\\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) \\partial x ^ { \\star } ( \\theta ) + \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = 0 .\n$$", + "text_format": "latex", + "bbox": [ + 352, + 559, + 645, + 577 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Computing 97 ${ \\partial x ^ { \\star } ( \\theta ) }$ boils down to the resolution of the linear system of equations ", + "bbox": [ + 147, + 583, + 702, + 598 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/61fc8e13f9e3f720696ee7ba4a802b9749c90618cf011fd1d2798863de6d8ed0.jpg", + "text": "$$\n\\underbrace { - \\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) } _ { A \\in \\mathbb { R } ^ { d \\times d } } \\underbrace { \\partial x ^ { \\star } ( \\theta ) } _ { J \\in \\mathbb { R } ^ { d \\times n } } = \\underbrace { \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) } _ { B \\in \\mathbb { R } ^ { d \\times n } }\n$$", + "text_format": "latex", + "bbox": [ + 357, + 604, + 640, + 641 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "98 When (1) is a one-dimensional root finding problem $\\dot { d } = 1 \\dot { }$ ), (2) becomes particularly simple since \n99 $\\nabla x ^ { \\star } ( \\theta ) = B ^ { \\top } / A$ , where $A$ is a scalar value. \n100 We will show that existing and new implicit differentiation methods all reduce to this simple principle. \n101 We call our approach hybrid, since it combines implicit differentiation (it involves the resolution of a \n102 linear system) with the autodiff of the optimality conditions $F$ . Our approach is efficient as it can be \n103 added on top of any state-of-the-art solver and modular as the optimality conditon specification is \n104 decoupled from the implicit differentiation mechanism. ", + "bbox": [ + 143, + 647, + 828, + 676 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 142, + 681, + 825, + 752 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Differentiating a fixed point. We will encounter numerous applications where 05 $x ^ { \\star } ( \\theta )$ is implicitly 06 defined through a fixed point iteration: ", + "bbox": [ + 155, + 766, + 823, + 795 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/abe6cf0671c54522fc02fdb793687079a378aeb6f7fb62b05a2af4f58004d60a.jpg", + "text": "$$\nx ^ { \\star } ( \\theta ) = T ( x ^ { \\star } ( \\theta ) , \\theta ) ,\n$$", + "text_format": "latex", + "bbox": [ + 424, + 801, + 571, + 820 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where 107 $T \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }$ . This can be seen as a particular case of (1) with ", + "bbox": [ + 140, + 827, + 666, + 843 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/84cac758b84ac842ae759995b0e5af13c1e749e95958fbe426ac33e2140ff621.jpg", + "text": "$$\nF ( x ^ { \\star } ( \\theta ) , \\theta ) = T ( x ^ { \\star } ( \\theta ) , \\theta ) - x ^ { \\star } ( \\theta ) .\n$$", + "text_format": "latex", + "bbox": [ + 375, + 849, + 622, + 867 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "108 In this case, using the chain rule, we have ", + "bbox": [ + 142, + 873, + 447, + 888 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/10fa8490ec27c72163d7dd399a16f9ec36f0ca85ee2d8bccb24156a8ca15b2f6.jpg", + "text": "$$\nA = - \\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = I - \\partial _ { 1 } T ( x ^ { \\star } ( \\theta ) , \\theta ) \\quad \\mathrm { a n d } \\quad B = \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = \\partial _ { 2 } T ( x ^ { \\star } ( \\theta ) , \\theta ) .\n$$", + "text_format": "latex", + "bbox": [ + 200, + 895, + 794, + 912 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "109 Computing JVPs and VJPs. In practice, all we need to know from $F$ is how to left-multiply or \n110 right-multiply $\\partial _ { 1 } F$ and $\\partial _ { 2 } F$ with a vector of appropriate size. These are called vector-Jacobian \n111 product (VJP) and Jacobian-vector product (JVP), and are useful for integrating $x ^ { \\star } ( \\theta )$ with reverse \n112 mode and forward-mode autodiff, respectively. Often times, $F$ will be explicitly defined. In this case, \n113 computing the VJP or JVP can be done via autodiff. Other times, $F$ may itself be implicitly defined, \n114 for instance when $F$ involves the solution of a variational problem. In this case, computing the VJP \n115 or JVP will itself involve implicit differentiation. \n116 The right-multiplication (JVP) between $J = \\partial x ^ { \\star } ( \\theta )$ and a vector $v$ , $J v$ , can be computed efficiently \n117 by solving $A ( J v ) = B v$ . The left-multiplication (VJP) of $v ^ { \\top }$ with $J , v ^ { \\top } J$ , can be computed by first \n118 solving $A ^ { \\top } u = v$ . Then, we can obtain $v ^ { \\top } J$ by $\\boldsymbol { v } ^ { \\top } \\boldsymbol { J } = \\boldsymbol { u } ^ { \\top } \\boldsymbol { A } \\boldsymbol { J } = \\boldsymbol { u } ^ { \\top } \\boldsymbol { B }$ . Note that when $B$ changes \n119 but $A$ and $v$ remain the same, we do not need to solve $A ^ { \\top } u = v$ once again. This allows to compute \n120 the VJP w.r.t. different variables while solving only one linear system. \n121 To solve these linear systems, we can use the conjugate gradient method [39] when $A$ is positive \n122 semi-definite and GMRES [61] or BiCGSTAB [66] when $A$ is not. All algorithms are matrix-free, \n123 i.e., they only require matrix-vector products (linear maps). Thus, all we need from $F$ is its JVPs \n124 or VJPs. An alternative to GMRES/BiCGSTAB is to solve the normal equation $A A ^ { \\top } u = A v$ using \n125 conjugate gradient, which we find faster in some scenarios. \n126 Pre-processing and post-processing mappings. Often times, the goal is not to differentiate $\\theta$ per \n127 se, but the parameters of a function producing $\\theta$ . One example of such pre-processing is to convert \n128 the parameters to be differentiated from one form to another canonical form, such as a quadratic \n129 program [6] or a conic program [2]. Another example is when $x ^ { \\star } ( \\theta )$ is used as the output of a neural \n130 network layer, in which case $\\theta$ is produced by the previous layer. Likewise, $x ^ { \\star } ( \\theta )$ will often not \n131 be the final output we want to differentiate. One example of such post-processing is when $x ^ { \\star } ( \\theta )$ is \n132 the solution of a dual program and we apply the dual-primal mapping to recover the solution of the \n133 primal program. Another example is the application of a loss function, in order to reduce $x ^ { \\star } ( \\theta )$ to a \n134 scalar value. In all these cases, we leave the differentiation of the pre/post-processing mappings to \n135 the autodiff system, allowing us to compose functions in complex ways. \n136 Usage and implementation details. Our implementation is based on JAX [17, 34]. JAX’s autodiff \n137 features enter the picture in at least two ways: (i) we lean heavily on JAX within our implementation, \n138 and (ii) we integrate the differentiation routines introduced by our framework into JAX’s existing \n139 autodiff system. In doing the latter, we override JAX’s default autodiff behavior (e.g. of differentiating \n140 transparently through an iterative solver’s unrolled iterations). \n141 We delineate here what features are needed from an autodiff system to implement our proposed \n142 framework. As mentioned, we only need access to $F$ through the JVP or VJP of $\\partial _ { 1 } F$ and $\\partial _ { 2 } F$ . \n143 Since the definition of $F$ will often include a gradient mapping $\\nabla _ { 1 } f ( x , \\theta )$ (see examples in $\\ S 2 . 2 \\AA ,$ ), \n144 second-order derivatives need also be supported. Our library provides two decorators, custom_root \n145 and custom_fixed_point, for adding implicit differentiation on top of a solver, given optimality \n146 conditions $F$ or fixed point iteration $T$ . This functionality requires the ability to add custom JVP \n147 and/or VJP to a function. All these features are supported by recent autodiff systems, including JAX \n148 [17], TensorFlow [1] and PyTorch [56]. Our implementation, made in JAX, also uses JAX-specific \n149 features. We make extensive use of automatic batching with ${ \\mathrm { j a x . v m a p } }$ , JAX’s vectorizing map \n150 transformation. In order to solve the normal equation ${ \\bar { A } } A ^ { \\top } u \\stackrel { = } { = } A v$ , we also use JAX’s ability to \n151 automatically transpose a linear map using jax.linear_transpose [33]. ", + "bbox": [ + 140, + 90, + 825, + 189 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 140, + 194, + 825, + 267 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 140, + 273, + 825, + 343 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 142, + 357, + 825, + 496 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 142, + 508, + 825, + 578 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 142, + 584, + 825, + 737 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 Examples ", + "text_level": 1, + "bbox": [ + 174, + 752, + 281, + 766 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We now give various examples of mapping $F$ or fixed point iteration $T$ , recovering existing implicit differentiation methods and creating new ones. Each choice of $F$ or $T$ implies different trade-offs in terms of computational oracles; see Table 1. Source code examples are given in Appendix A. ", + "bbox": [ + 173, + 776, + 825, + 820 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "56 Stationary point condition. The simplest example is to differentiate through the implicit function ", + "bbox": [ + 158, + 833, + 823, + 848 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/b6188a6a7c9a596b50fc8852bc4ccc0f4d16f5bf1e6daa08a88ba4243cf2e32f.jpg", + "text": "$$\nx ^ { \\star } ( \\theta ) = \\operatorname * { a r g m i n } _ { x \\in \\mathbb { R } ^ { d } } f ( x , \\theta ) ,\n$$", + "text_format": "latex", + "bbox": [ + 415, + 849, + 581, + 876 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where 157 $f \\colon { \\mathbb { R } ^ { d } } \\times { \\mathbb { R } ^ { n } } \\to { \\mathbb { R } }$ is twice differentiable. In this case, $F$ is simply the gradient mapping ", + "bbox": [ + 143, + 878, + 795, + 895 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/fb95590bd657f30e56a390a2486618317cd1509a18dbdc55625d4d514240b602.jpg", + "text": "$$\nF ( x , \\theta ) = \\nabla _ { 1 } f ( x , \\theta ) .\n$$", + "text_format": "latex", + "bbox": [ + 424, + 895, + 571, + 912 + ], + "page_idx": 3 + }, + { + "type": "table", + "img_path": "images/92818729040824c8d9ac6081b7c655d31a444d9cdda75c9a80e98036dfe79dcf.jpg", + "table_caption": [ + "Table 1: Summary of optimality condition mappings. Oracles are accessed through their JVP or VJP. " + ], + "table_footnote": [], + "table_body": "
NameEquationSolution neededOracles needed
Stationary(4), (5)PrimalVif
KKT(6)Primal and dualVif,H,G,δH,δG
Proximal gradient(7)PrimalVif,proxng
Projected gradient(9)PrimalVif,projc
Mirror descent(11)PrimalV1f,proje,
Newton(15)Primal[V²f(x,0)]-1,Vif(x,0)
Block proximal gradient(16)Primal[Vif]j,[proXnglj
Conic programming(20)Residual map rootprojRp ×K* ×R+
", + "bbox": [ + 204, + 117, + 794, + 262 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "158 We then have $\\partial _ { 1 } F ( x , \\theta ) = \\nabla _ { 1 } ^ { 2 } f ( x , \\theta )$ and $\\partial _ { 2 } F ( x , \\theta ) = \\partial _ { 2 } \\nabla _ { 1 } f ( x , \\theta )$ , the Hessian of $f$ in its first \n159 argument and the Jacobian in the second argument of $\\nabla _ { 1 } f ( x , \\theta )$ . In practice, we use autodiff to \n160 compute Jacobian products automatically. Equivalently, we can use the gradient descent fixed point ", + "bbox": [ + 142, + 291, + 825, + 335 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/4a2568542c9094dc9999a54b77ab0f3951fb90ef12b03f0894ba673a03eef64a.jpg", + "text": "$$\nT ( x , \\theta ) = x - \\eta \\nabla _ { 1 } f ( x , \\theta ) ,\n$$", + "text_format": "latex", + "bbox": [ + 405, + 340, + 589, + 358 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "161 which holds for all step sizes $\\eta > 0$ . Using (3), it is easy to verify that we end up with the same linear \n162 system since $\\eta$ cancels out. \n163 KKT conditions. We now show that the KKT conditions, manually differentiated in several works \n164 [19, 35, 6, 53, 52], fit our framework. As we will see, the key will be to group the optimal primal and \n65 dual variables as our $x ^ { \\star } ( \\theta )$ . Let us consider the general problem ", + "bbox": [ + 145, + 362, + 830, + 391 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 147, + 404, + 825, + 446 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/eab93968d700bce30435f471dfbff1d3d1392d65707998bdbafa92e7cfbbffdc.jpg", + "text": "$$\n\\operatorname { a r g m i n } _ { z \\in \\mathbb { R } ^ { p } } f ( z , \\theta ) \\quad { \\mathrm { s u b j e c t ~ t o } } \\quad G ( z , \\theta ) \\leq 0 , \\ H ( z , \\theta ) = 0 ,\n$$", + "text_format": "latex", + "bbox": [ + 310, + 452, + 684, + 478 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where166 $z \\in \\mathbb { R } ^ { p }$ is the primal variable, $f \\colon { \\mathbb { R } } ^ { p } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } }$ , $G \\colon \\mathbb { R } ^ { p } \\times \\mathbb { R } ^ { n } \\to \\mathbb { R } ^ { r }$ and $H \\colon \\mathbb { R } ^ { p } \\times \\mathbb { R } ^ { n } \\to \\mathbb { R } ^ { q }$ 167 The stationarity, primal feasibility and complementary slackness conditions give ", + "bbox": [ + 140, + 481, + 825, + 512 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/f51428dc8ea9e213a482c787fc5040608d86096761fc257f08e96afe82f857bb.jpg", + "text": "$$\n\\begin{array} { r } { \\nabla _ { 1 } f ( z , \\theta ) + \\left[ \\partial _ { 1 } G ( z , \\theta ) \\right] ^ { \\top } \\boldsymbol { \\lambda } + \\left[ \\partial _ { 1 } H ( z , \\theta ) \\right] ^ { \\top } \\boldsymbol { \\nu } = 0 } \\\\ { H ( z , \\theta ) = 0 } \\\\ { \\boldsymbol { \\lambda } \\circ G ( z , \\theta ) = 0 , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 331, + 515, + 666, + 573 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "168 where $\\nu \\in \\mathbb { R } ^ { q }$ and $\\lambda \\in \\mathbb { R } _ { + } ^ { r }$ are the dual variables, also known as KKT multipliers. The system of \n169 (potentially nonlinear) equations (6) fits our framework, as we can group the primal and dual solutions \n170 as $x ^ { \\star } ( \\theta ) = ( z ^ { \\star } ( \\theta ) , \\nu ^ { \\star } ( \\theta ) , \\lambda ^ { \\star } ( \\theta ) )$ to form the root of a function $F ( x ^ { \\star } ( \\theta ) , \\theta )$ , where $F \\colon \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } $ \n171 $\\mathbb { R } ^ { d }$ and $d = p + q + r$ . The primal and dual solutions can be obtained from a generic solver, such as \n172 an interior point method. In practice, the above mapping $F$ will be defined directly in Python (see \n173 Figure 6 in Appendix A) and $F$ will be differentiated automatically via autodiff. \n174 Proximal gradient fixed point. Unfortunately, not all algorithms return both primal and dual \n175 solutions. Moreover, if the objective contains non-smooth terms, proximal gradient descent may be \n176 more efficient. We now discuss its fixed point. Let $x ^ { \\star } ( \\theta )$ be implicitly defined as ", + "bbox": [ + 142, + 574, + 825, + 661 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 142, + 674, + 826, + 717 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/2e4230919f90ed7ed51be288843b00db88b4c661b11d934b7a8081ce3f1c4c90.jpg", + "text": "$$\nx ^ { \\star } ( \\theta ) : = \\operatornamewithlimits { a r g m i n } _ { x \\in \\mathbb { R } ^ { d } } f ( x , \\theta ) + g ( x , \\theta ) ,\n$$", + "text_format": "latex", + "bbox": [ + 380, + 720, + 616, + 748 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where 177 $f \\colon { \\mathbb { R } ^ { d } } \\times { \\mathbb { R } ^ { n } } \\to { \\mathbb { R } }$ is twice-differentiable convex and $g \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } }$ is convex but possibly 178 non-smooth. Let us define the proximity operator associated with $g$ by ", + "bbox": [ + 143, + 753, + 825, + 784 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/7e620cbfca8df53ee6d254fd7e1544917ffbf8fedcfd59918e6eab8ecb36240d.jpg", + "text": "$$\n\\operatorname { p r o x } _ { g } ( y , \\theta ) : = \\underset { x \\in \\mathbb { R } ^ { d } } { \\operatorname { a r g m i n } } \\frac { 1 } { 2 } \\| x - y \\| _ { 2 } ^ { 2 } + g ( x , \\theta ) .\n$$", + "text_format": "latex", + "bbox": [ + 348, + 787, + 648, + 821 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To implicitly differentiate through 179 $x ^ { \\star } ( \\theta )$ , we use the fixed point mapping [55, p.150] ", + "bbox": [ + 140, + 827, + 730, + 843 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/d9127dfd0fa20c31c543a2a1122bbff9fd774a71fd22a8ac2eee7a2b5c1014ff.jpg", + "text": "$$\nT ( x , \\theta ) = \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) ,\n$$", + "text_format": "latex", + "bbox": [ + 369, + 847, + 627, + 866 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "180 for any step size $\\eta > 0$ . The proximity operator is 1-Lipschitz continuous [50]. By Rademacher’s \n181 theorem, it is differentiable almost everywhere. Many proximity operators enjoy a closed form and \n182 can easily be differentiated, as discussed in Appendix $\\mathbf { B }$ . \n183 Projected gradient fixed point. As a special case, when $g ( x , \\theta )$ is the indicator function $I _ { C ( \\theta ) } ( x )$ , \n184 where $\\mathcal { C } ( \\boldsymbol { \\theta } )$ is a convex set depending on $\\theta$ , we obtain ", + "bbox": [ + 142, + 869, + 825, + 912 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 143, + 90, + 825, + 121 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/9fc305b7d41cf9840a4da1e9c684a4966948193c4810d7fe8ec45b24659e4c02.jpg", + "text": "$$\nx ^ { \\star } ( \\theta ) = \\operatorname * { a r g m i n } _ { x \\in { \\mathcal { C } } ( \\theta ) } f ( x , \\theta ) .\n$$", + "text_format": "latex", + "bbox": [ + 415, + 127, + 583, + 155 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The proximity operator185 $\\operatorname { p r o x } _ { g }$ becomes the Euclidean projection onto $\\mathcal { C } ( \\boldsymbol { \\theta } )$ ", + "bbox": [ + 137, + 162, + 660, + 179 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/e7c633a19a36233e89826d03e6e9e9d6f4930843a131c7ac91137f5df398e3f5.jpg", + "text": "$$\n{ \\mathrm { p r o x } } _ { g } ( y , \\theta ) = { \\mathrm { p r o j } } _ { \\mathcal { C } } ( y , \\theta ) : = { \\underset { x \\in { \\mathcal { C } } ( \\theta ) } { \\operatorname { a r g m i n } } } \\| x - y \\| _ { 2 } ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 343, + 186, + 655, + 215 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "186 and (7) becomes the projected gradient fixed point ", + "bbox": [ + 142, + 222, + 506, + 238 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/aba5f6e6acfac5cae3bd9be31fa33ca7546d5da43bb42e1db717636e16b40d6f.jpg", + "text": "$$\nT ( x , \\theta ) = \\mathrm { p r o j } _ { \\mathcal { C } } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) .\n$$", + "text_format": "latex", + "bbox": [ + 374, + 243, + 622, + 262 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "187 Compared to the KKT conditions, this fixed point is particularly suitable when the projection enjoys \n188 a closed form. We discuss how to compute the JVP $/$ VJP for a wealth of convex sets in Appendix B. \n189 Mirror descent fixed point. We again consider the case when $x ^ { \\star } ( \\theta )$ is implicitly defined as the \n190 solution of (8). We now generalize the projected gradient fixed point beyond Euclidean geometry. \n191 Let the Bregman divergence $D _ { \\varphi }$ : $\\operatorname { d o m } ( \\bar { \\varphi } ) \\cdot \\operatorname { r e l i n t } ( \\operatorname { d o m } ( \\varphi ) ) \\to \\bar { \\mathbb { R } } _ { + }$ generated by $\\varphi$ be defined by ", + "bbox": [ + 148, + 267, + 826, + 296 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "", + "bbox": [ + 142, + 310, + 826, + 354 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/a088e4de3012dd22930fbf8bbcbaeac60e58c57b50440c99049b46934ecb5603.jpg", + "text": "$$\nD _ { \\varphi } ( x , y ) : = \\varphi ( x ) - \\varphi ( y ) - \\langle \\nabla \\varphi ( y ) , x - y \\rangle .\n$$", + "text_format": "latex", + "bbox": [ + 348, + 359, + 648, + 378 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "192 We define the Bregman projection of $y$ onto ${ \\mathcal { C } } ( \\theta ) \\subseteq \\mathrm { d o m } ( \\varphi )$ by ", + "bbox": [ + 140, + 383, + 593, + 400 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/c7ff71d89425795cdecba2a0366df884c4bad19b5185cd83e5b56608b38f26e4.jpg", + "text": "$$\n\\begin{array} { r } { \\mathrm { p r o j } _ { \\mathcal { C } } ^ { \\varphi } ( y , \\theta ) : = \\underset { x \\in \\mathcal { C } ( \\theta ) } { \\mathrm { a r g m i n } } D _ { \\varphi } ( x , \\nabla \\varphi ^ { \\ast } ( y ) ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 366, + 405, + 630, + 433 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "193 Definition (10) incudes the mirror map $\\nabla \\varphi ^ { * } ( y )$ for convenience. It can be seen as a mapping from \n194 $\\mathbb { R } ^ { d }$ to $\\mathrm { d o m } ( \\varphi )$ , ensuring that (10) is well-defined. The mirror descent fixed point mapping is then ", + "bbox": [ + 140, + 440, + 825, + 472 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/e899366ae5ecf7ce9f01f9380bb80a3429cbbdaeed0d51b4e8a4782c4d4f0680.jpg", + "text": "$$\n\\begin{array} { c } { \\hat { x } = \\nabla \\varphi ( x ) } \\\\ { y = \\hat { x } - \\eta \\nabla _ { 1 } f ( x , \\theta ) } \\\\ { T ( x , \\theta ) = \\mathrm { p r o j } _ { \\mathcal { C } } ^ { \\varphi } ( y , \\theta ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 408, + 476, + 589, + 535 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "195 Because $T$ involves the composition of several functions, manually deriving its JVP/VJP is error \n196 prone. This shows that our approach leveraging autodiff allows to handle more advanced fixed point \n197 mappings. A common example of $\\varphi$ is $\\varphi ( \\bar { x } ) \\stackrel { - } { = } \\langle x , \\log x - 1 \\rangle$ , where $\\mathrm { d o m } ( \\varphi ) = \\mathbb { R } _ { + } ^ { d }$ . In this case, \n198 $D _ { \\varphi }$ is the Kullback-Leibler divergence. An advantage of the Kullback-Leibler projection is that it \n199 sometimes easier to compute than the Euclidean projection, as we detail in Appendix B. ", + "bbox": [ + 142, + 537, + 825, + 608 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "200 Other fixed points. More fixed points are described in Appendix C. ", + "bbox": [ + 147, + 622, + 632, + 637 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "2.3 Jacobian bounds ", + "text_level": 1, + "bbox": [ + 173, + 652, + 331, + 667 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In practice, either by the limitations of finite precision arithmetic or because we perform a finite number of iterations, we rarely reach the exact solution $x ^ { \\star } ( \\theta )$ , but instead only reach an approximate solution $\\hat { x }$ and apply the implicit differentiation equation (2) at this approximate solution. This motivates the need for approximation guarantees of this approach ", + "bbox": [ + 171, + 678, + 825, + 734 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Definition 1. Let $F : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d }$ be an optimality criterion mapping. Let $A : = - \\partial _ { 1 } F$ and $B : = \\partial _ { 2 } F$ . We define the Jacobian estimate at $( x , \\theta )$ as the solution to the following linear equation $A ( x , \\theta ) J ( x , \\theta ) = B ( x , \\theta )$ . It is a function $J : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d \\times n }$ . ", + "bbox": [ + 171, + 738, + 825, + 782 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "209 It holds by construction that $J ( x ^ { \\star } ( \\theta ) , \\theta ) = \\partial x ^ { \\star } ( \\theta )$ . Computing $J ( \\hat { x } , \\theta )$ for an approximate solution \n210 $\\hat { x }$ of $x ^ { \\star } ( { \\boldsymbol { \\theta } } )$ therefore allows to approximate the true Jacobian ${ \\partial x ^ { \\star } ( \\theta ) }$ . In practice, an algorithm used \n211 to solve (1) depends on $\\theta$ . Note however that, what we compute is not the Jacobian of ${ \\hat { x } } ( \\theta )$ , unlike \n212 works unrolling an algorithm that differentiate through its iterations, but an estimate of ${ \\partial x ^ { \\star } ( \\theta ) }$ . We \n213 therefore use the notation $\\hat { x }$ , leaving the dependence on $\\theta$ implicit. \n214 We develop bounds of the form $\\| J ( \\hat { x } , \\theta ) - \\partial x ^ { \\star } ( \\theta ) \\| < C \\| \\hat { x } - x ^ { \\star } ( \\theta ) \\|$ , hence showing that the error \n215 on the estimated Jacobian is at most of the same order as that of $\\hat { x }$ as an approximation of $x ^ { \\star } ( \\theta )$ \n216 These bounds are based on the following main theorem, whose proof is included in Appendix D. ", + "bbox": [ + 140, + 792, + 825, + 863 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "", + "bbox": [ + 142, + 868, + 825, + 912 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/0af66743a2db58959a3b656101274b1470dc7521e9804b31e74545d40ee6ada6.jpg", + "image_caption": [ + "Figure 2: CPU runtime comparison of implicit differentiation and unrolling for hyperparameter optimization of multiclass SVMs for multiple problem sizes. Error bars represent $90 \\%$ confidence intervals. (a) Mirror descent solver, with mirror descent fixed point for implicit differentiation. $\\mathbf { ( b ) }$ Proximal gradient solver, with proximal gradient fixed point for implicit differentiation. (c) Block coordinate descent solver; for implicit differentiation we obtain $x ^ { \\star } ( \\theta )$ by BCD but perform differentiation with the mirror descent and proximal gradient fixed points. This showcases that the solver and fixed point can be independently chosen. " + ], + "image_footnote": [], + "bbox": [ + 174, + 89, + 821, + 224 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Theorem 1 (Jacobian estimate). Let 17 $F : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d }$ . Assume that there exist $\\alpha , \\beta , \\gamma , \\varepsilon , R > 0$ such that 18 $A = - \\partial _ { 1 } F$ and $B = \\partial _ { 2 } F$ satisfy, for all $v \\in \\mathbb { R } ^ { d }$ , $\\boldsymbol \\theta \\in \\mathbb { R } ^ { n }$ and $x$ such that $\\| x - x ^ { \\star } ( \\theta ) \\| \\leq \\varepsilon$ : ", + "bbox": [ + 155, + 353, + 826, + 385 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "$A$ is well-conditioned, Lipschitz: $\\| A ( x , \\theta ) v \\| \\geq \\alpha \\| v \\| , \\| A ( x , \\theta ) - A ( x ^ { \\star } ( \\theta ) , \\theta ) \\| _ { o p } \\leq \\gamma \\| x - x ^ { \\star } ( \\theta ) \\| .$ ", + "bbox": [ + 160, + 388, + 823, + 406 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "20 $B$ is bounded and Lipschitz: $\\begin{array} { r } { | B ( x ^ { \\star } ( \\theta ) , \\theta ) | | \\leq R , \\| B ( x , \\theta ) - B ( x ^ { \\star } ( \\theta ) , \\theta ) \\| \\leq \\beta \\| x - x ^ { \\star } ( \\theta ) \\| . } \\end{array}$ ", + "bbox": [ + 158, + 410, + 797, + 428 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Under these conditions, when 21 $\\| { \\hat { x } } - x ^ { \\star } ( \\theta ) \\| \\leq \\varepsilon$ , we have ", + "bbox": [ + 156, + 431, + 547, + 446 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/15d30cda339469d47f6995eac2392e8290c4da235b4b5eb80eb55d8175757963.jpg", + "text": "$$\n\\begin{array} { r } { \\| J ( \\hat { x } , \\theta ) - \\partial x ^ { \\star } ( \\theta ) \\| \\leq \\left( \\beta \\alpha ^ { - 1 } + \\gamma R \\alpha ^ { - 2 } \\right) \\| \\hat { x } - x ^ { \\star } ( \\theta ) \\| . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 312, + 450, + 684, + 469 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "222 This result is similar to [40, Theorem 7.2], that is concerned with the stability of solutions to inverse \n223 problems. Here we consider that $A ( \\cdot , \\theta )$ is uniformly well-conditioned, rather than only at $x ^ { \\star } ( \\theta )$ . \n224 This does not affect the first order in $\\varepsilon$ of this bound, and makes it valid for all $\\hat { x }$ . It is also more \n225 tailored to applications to equation-specific cases. \n26 Indeed, Theorem 1 can be applied to specific functions $F$ or $T$ for some root and fixed-point equations. \n27 In particular, for gradient descent fixed point, where $T ( x , \\theta ) = x - \\eta \\nabla _ { 1 } f ( x , \\theta )$ , this yields \n228 This guarantees precision on the estimated Jacobian under regularity conditions on $f$ directly; see \n229 Corollary 1 in Appendix D. ", + "bbox": [ + 140, + 478, + 826, + 536 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 153, + 541, + 825, + 570 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 140, + 595, + 831, + 625 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For proximal gradient descent, where 230 $T ( x , \\theta ) = \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta )$ , this yields ", + "bbox": [ + 142, + 628, + 748, + 647 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/fe878e3b82984ab157f104a97b62a728183a6d5ccca5d88bcd2e17a29f7a4920.jpg", + "text": "$$\n\\begin{array} { r l } & { A ( x , \\theta ) = I - \\partial _ { 1 } T ( x , \\theta ) = I - ( I - \\eta \\nabla _ { 1 } ^ { 2 } f ( x , \\theta ) ) \\partial _ { 1 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) } \\\\ & { B ( x , \\theta ) = \\partial _ { 2 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) - \\eta \\partial _ { 2 } \\nabla _ { 1 } f ( x , \\theta ) \\partial _ { 1 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 204, + 650, + 792, + 693 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "231 An important special case is that of a function to minimize in the form $f ( x , \\theta ) + g ( x )$ , where the \n232 prox function $g$ is smooth, and does not depend on $\\theta$ , as is the case in our experiments in $\\ S 3 . 2$ . For \n233 this setting, we derive similar guarantees in Corollary 2 in Appendix D. Recent work also exploits \n234 local smoothness of solutions to derive similar bounds [11, Theorem 13]. ", + "bbox": [ + 140, + 694, + 826, + 751 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3 Experiments ", + "text_level": 1, + "bbox": [ + 165, + 768, + 312, + 786 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To conclude this work, we demonstrate the ease of formulating and solving bi-level optimization problems with our modular framework. We also present an application to the sensitivity analysis of molecular dynamics. ", + "bbox": [ + 173, + 800, + 825, + 842 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3.1 Hyperparameter optimization of multiclass SVMs ", + "text_level": 1, + "bbox": [ + 171, + 857, + 560, + 872 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "40 In this example, we consider the hyperparamer optimization of multiclass SVMs [23] trained in the dual. Here, 41 $x ^ { \\star } ( \\theta )$ is the optimal dual solution, a matrix of shape $m \\times k$ , where $m$ is the number of ", + "bbox": [ + 151, + 883, + 825, + 911 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/b4da6ef103b91449058c5866c3a3686ffb12de8e8375b30e6411a8f9996f2d45.jpg", + "table_caption": [ + "Table 2: Mean AUC (and $9 5 \\%$ confidence interval) for the cancer survival prediction problem. " + ], + "table_footnote": [], + "table_body": "
MethodL1 logregL2 logregDictL + L2 logregTask-driven DictL
AUC (%)71.6 ± 2.072.4± 2.868.3 ± 2.373.2 ± 2.1
", + "bbox": [ + 227, + 117, + 769, + 161 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "242 training examples and $k$ is the number of classes, and $\\theta \\in \\mathbb { R } _ { + }$ is the regularization parameter. The \n243 challenge in differentiating $x ^ { \\star } ( \\theta )$ is that each row of $x ^ { \\star } ( \\theta )$ is constrained to belong to the probability \n244 simplex $\\triangle ^ { k }$ . More formally, let $X _ { \\mathsf { t r } } \\in \\mathbb { R } ^ { m \\times p }$ be the training feature matrix and $Y _ { \\mathrm { t r } } \\in \\{ 0 , 1 \\} ^ { m \\times k }$ be \n245 the training labels (in row-wise one-hot encoding). Let $W ( x , \\theta ) : = X _ { \\mathrm { t r } } ^ { \\top } ( Y _ { \\mathrm { t r } } - x ) / \\theta \\in \\bar { \\mathbb { R } } ^ { p \\times k }$ be the \n246 dual-primal mapping. Then, we consider the following bi-level optimization problem ", + "bbox": [ + 140, + 193, + 825, + 266 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/ce090f883f9650a3f013faea4e29010ebe45ac30fd006c4ccf3142b442503f4e.jpg", + "text": "$$\n\\operatorname * { a r g m i n } _ { \\boldsymbol { x } = \\mathrm { e x p } ( \\boldsymbol { x } ) } \\frac { 1 } { 2 } \\| X _ { \\mathrm { v a l } } W ( \\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) , \\boldsymbol { \\theta } ) - Y _ { \\mathrm { v a l } } \\| _ { F } ^ { 2 } \\quad \\mathrm { s u b j e c t ~ t o } \\quad \\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) = \\operatorname * { a r g m i n } _ { \\boldsymbol { x } \\in \\mathcal { C } } f ( \\boldsymbol { x } , \\boldsymbol { \\theta } ) : = \\frac { \\theta } { 2 } \\| W ( \\boldsymbol { x } , \\boldsymbol { \\theta } ) \\| _ { F } ^ { 2 } ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 272, + 821, + 306 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "247 where $\\mathcal { C } = \\triangle ^ { k } \\times \\cdot \\cdot \\cdot \\times \\triangle ^ { k }$ is the Cartesian product of $m$ probability simplices. We apply the change \n248 of variable $\\theta = \\exp ( \\lambda )$ in order to guarantee that the hyper-parameter $\\theta$ is positive. The matrix \n249 $W ( x ^ { \\star } ( \\theta ) , \\theta ) \\in \\mathbb { R } ^ { p \\times k }$ contains the optimal primal solution, the feature weights for each class. The \n250 outer loss is computed against validation data $X _ { \\mathtt { v a l } }$ and $Y _ { \\tt v a l }$ . \n251 In order to differentiate $x ^ { \\star } ( \\theta )$ , several ways are possible using our framework. The first one would be \n252 to map (12) to a quadratic program form (18) and use the KKT conditions to form a mapping $F ( x , \\theta )$ . \n253 A more direct way is to use proximal gradient fixed point (9). Since $\\mathcal { C }$ is a Cartesian product, the \n254 projection can be easily computed by row-wise projections on the simplex, which we map over rows \n255 (using vectorized operations) via ${ \\mathrm { j a x . v m a p } }$ . As we explained in $\\ S \\mathbf { B } . 1$ , this projection’s Jacobian \n256 enjoys a closed form. A third way to differentiate $x ^ { \\star } ( \\theta )$ is using the mirror descent fixed point \n257 (11). Under the KL geometry, proj $\\overset { \\varphi } { c } ( y , \\theta )$ corresponds to a row-wise softmax. It is therefore easy to \n258 compute and differentiate. Figure 2 compares the runtime performance of implicit differentiation vs. \n259 unrolling for the latter two fixed points. A code example is included in Figure 8 in the Appendix. ", + "bbox": [ + 138, + 337, + 825, + 396 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 142, + 401, + 825, + 527 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "3.2 Task-driven dictionary learning ", + "text_level": 1, + "bbox": [ + 163, + 542, + 433, + 558 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "261 Task-driven dictionary learning was proposed to learn sparse codes for input data in such a way that \n262 the codes solve an outer learning problem [47, 64, 70]. Formally, given a data matrix $X _ { \\mathsf { t r } } \\in \\dot { \\mathbb { R } } ^ { m \\times p }$ \n263 and a dictionary of $k$ atoms $\\theta \\in \\mathbb { R } ^ { k \\times p }$ , a sparse code is defined as a matrix $\\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) \\in \\mathbb { R } ^ { m \\times k }$ that \n264 minimizes in $x$ a reconstruction loss $f ( x , \\theta ) \\mathrel { \\mathop : } = \\ell ( X _ { \\mathrm { t r } } , x \\theta )$ regularized by a sparsity-inducing penalty \n265 $g ( x )$ . Instead of optimizing the dictionary $\\theta$ to minimize the reconstruction loss, [47] proposed to \n266 optimize an outer problem that depends on the code. For example, given a set of labels $Y _ { \\mathbf { t r } } \\in \\{ 0 , 1 \\} ^ { m }$ \n267 we consider a logistic regression problem which results in the bilevel optimization problem: ", + "bbox": [ + 147, + 568, + 823, + 666 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/7241d3046f97175d5f6f55df5911c2960fba9d333333fa547f087a16e16b970d.jpg", + "text": "$$\n\\underbrace { \\operatorname* { m i n } _ { \\theta \\in \\mathbb { R } ^ { k \\times p } , w \\in \\mathbb { R } ^ { k } , b \\in \\mathbb { R } } \\sigma ( x ^ { \\star } ( \\theta ) w + b ; y _ { \\mathrm { t r } } ) } _ { \\mathrm { o u t e r ~ p r o b l e m } } \\mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \\star } ( \\theta ) \\in \\underbrace { \\mathrm { a r g m i n ~ } f ( x , \\theta ) + g ( x ) } _ { \\mathrm { i n n e r ~ p r o b l e m } } .\n$$", + "text_format": "latex", + "bbox": [ + 212, + 670, + 758, + 719 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "268 When $\\ell$ is the squared Frobenius distance between matrices, and $g$ the elastic net penalty, [47, Eq. \n269 21] derive manually, using optimality conditions (notably the support of the codes selected at the \n270 optimum), an explicit re-parameterization of $x ^ { \\star } ( \\theta )$ as a linear system involving $\\theta$ . This closed \n271 form allows for a direct computation of the Jacobian of $x ^ { \\star }$ w.r.t. $\\theta$ . Similarly, [64] derive first \n272 order conditions in the case where $\\ell$ is a $\\beta$ -divergence, while [70] propose to use unrolling of ISTA \n273 iterations. Our approach bypasses all of these computations, giving the user more leisure to focus \n274 directly on modeling (loss, regularizer) aspects (see code snippet in Figure 9 in Appendix). \n275 We illustrate this on a problem of breast cancer survival prediction from gene expression data, \n276 framed as a binary classification problem to discriminate patients who survive longer than 5 years \n277 $( m _ { 1 } = 2 0 0 )$ vs patients who die within 5 years of diagnosis $m _ { 0 } = 9 9 ,$ ), from $p = 1 , 0 0 0$ gene \n278 expression values. As shown in Table 2, solving (13) (Task-driven DictL) reaches a classification \n279 performance competitive with state-of-the-art $L _ { 1 }$ or $L _ { 2 }$ regularized logistic regression with 100 times \n280 fewer variables. See Appendix E.2 for more details. ", + "bbox": [ + 138, + 724, + 826, + 823 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 140, + 827, + 825, + 911 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/3ee0f32e6f80a02150d66af9cd3d4abfc0547511f8cbe6272c79b60b2929a87c.jpg", + "image_caption": [ + "Figure 3: Distilled MNIST dataset $\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }$ obtained by solving (14). We learn one image per class such that a logistic regression model trained on $\\theta$ achieves the lowest logistic loss on the MNIST training set. Implicit differentiation was 4 times faster than unrolling. " + ], + "image_footnote": [], + "bbox": [ + 173, + 98, + 825, + 143 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "281 3.3 Dataset distillation ", + "text_level": 1, + "bbox": [ + 143, + 223, + 344, + 238 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "282 Dataset distillation [67, 46] aims to learn a small synthetic training dataset such that a model trained \n283 on this learned data set achieves small loss on the original training set. Formally, let $X _ { \\mathsf { t r } } \\in \\mathbb { R } ^ { m \\times p }$ and \n284 $y _ { \\mathrm { t r } } \\in [ k ] ^ { m }$ denote the original training set. The distilled dataset will contain one prototype example \n285 for each class and therefore $\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }$ . The dataset distillation problem can then naturally be cast as \n286 a bi-level problem, where in the inner problem we estimate a logistic regression model $\\dot { { \\boldsymbol { x } } } ^ { \\star } ( { \\boldsymbol { \\theta } } ) \\in \\mathbb { R } ^ { p }$ \n287 trained on the distilled images $\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }$ , while in the outer problem we want to minimize the loss \n288 achieved by $x ^ { \\star } ( \\theta )$ over the training set: ", + "bbox": [ + 138, + 250, + 826, + 351 + ], + "page_idx": 8 + }, + { + "type": "equation", + "img_path": "images/eb3fb919fa6543702af101d5071467ce0d6f5193925b921c98563e935264e4eb.jpg", + "text": "$$\n\\operatorname * { a r g m i n } _ { \\theta \\in \\mathbb { R } ^ { k \\times p } } f ( x ^ { \\star } ( \\theta ) , X _ { \\mathrm { t r } } ; y _ { \\mathrm { t r } } ) \\mathrm { ~ } \\mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \\star } ( \\theta ) \\in \\underset { x \\in \\mathbb { R } ^ { p } } { \\operatorname { a r g m i n } } f ( x , \\theta ; [ k ] ) + \\varepsilon \\| x \\| ^ { 2 } ,\n$$", + "text_format": "latex", + "bbox": [ + 240, + 359, + 753, + 390 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "289 where $f ( x , X ; y ) : = \\ell ( X x , y )$ , $\\ell$ denotes the multiclass logistic regression loss, and $\\varepsilon = 1 0 ^ { - 3 }$ is a \n290 regularization parameter that we found had a very positive effect on convergence. \nIn this problem, and unlike in the general hyperparameter optimization setup, both the inner and outer \n2 problems are high-dimensional, making it an ideal test-bed for gradient-based bi-level optimization \n93 methods. For this experiment, we use the MNIST dataset. The number of parameters in the inner \n4 problem is $p = 2 8 ^ { 2 } \\overset { \\cdot } { = } 7 8 4$ . while the number of parameters of the outer loss is $k \\times p = 7 8 4 0$ . We \n95 solve this problem using gradient descent on both the inner and outer problem, with the gradient \n96 of the outer loss computed using implicit differentiation, as described in $\\ S 2$ . This is fundamentally \n7 different from the approach used in the original paper, where they used differentiation of the unrolled \n98 iterates instead. For the same solver, we found that the implicit differentiation approach was 4 times \n99 faster than the original one. The obtained distilled images $\\theta$ are visualized in Figure 3 and a code \n00 example is given in Figure 10 in the Appendix. ", + "bbox": [ + 148, + 417, + 825, + 446 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 155, + 452, + 825, + 590 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "3.4 Sensitivity analysis of molecular dynamics ", + "text_level": 1, + "bbox": [ + 168, + 609, + 506, + 625 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "302 Many applications of physical simulations require solving optimiza \n303 tion problems, such as energy minimization in molecular [62] and \n304 continuum [8] mechanics, structural optimization [41] and data \n305 assimilation [32]. However, even fully differentiable simulators \n306 may not have efficient or accurate derivatives. We revisit an exam \n307 ple from JAX-MD [62], the problem of finding energy minimizing \n308 configurations to a system of packed particles in an $m$ -dimensional \n309 box of width $\\ell$ , ", + "bbox": [ + 147, + 636, + 607, + 747 + ], + "page_idx": 8 + }, + { + "type": "equation", + "img_path": "images/be2b151ec9e3ce51fc1bc171b02954136717cb591e72d602d6c66af1b854b376.jpg", + "text": "$$\nx ^ { \\star } ( \\theta ) = { \\underset { x \\in \\mathbb { R } ^ { k \\times m } } { \\operatorname { a r g m i n } } } \\sum _ { i j } U ( x _ { i j } \\mod \\ell , \\theta ) ,\n$$", + "text_format": "latex", + "bbox": [ + 263, + 756, + 516, + 791 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/7f44b1e279d58fbab587c01b99912576abba62a2346e36362db11cf427b8a046.jpg", + "image_caption": [ + "Figure 4: Particle positions and position sensitivity vectors, with respect to increasing the diameter of the blue particles. " + ], + "image_footnote": [], + "bbox": [ + 624, + 625, + 820, + 776 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "310 where $U ( x _ { i j } , \\theta )$ is the pairwise potential energy function, with half \n311 the particles at diameter 1 and half at diameter $\\theta = 0 . 6$ , which we \n312 optimize with a domain-specific optimizer [13]. Here we consider \n313 sensitivity of particle position with respect to diameter ${ \\partial x ^ { \\star } ( \\theta ) }$ , \n314 rather than sensitivity of the total energy from the original experi \n315 ment. Figure 4 shows results calculated via forward-mode implicit differentiation (JVP). Whereas \n316 differentiating the unrolled optimizer happens to work for total energy, here it typically does not even \n317 converge (see Appendix Fig. 15), due the discontinuous optimization method. ", + "bbox": [ + 140, + 800, + 611, + 869 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 137, + 869, + 818, + 911 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "[1] M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving, M. Isard, et al. Tensorflow: A system for large-scale machine learning. In 12th $\\{ U S E N I X \\}$ symposium on operating systems design and implementation $\\langle \\mathit { 5 O S D I } \\} \\mathit { 1 6 } \\rangle$ , pages 265–283, 2016. \n[2] A. Agrawal, B. Amos, S. Barratt, S. Boyd, S. Diamond, and Z. Kolter. Differentiable convex optimization layers. arXiv preprint arXiv:1910.12430, 2019. \n[3] A. Agrawal, S. Barratt, S. Boyd, E. Busseti, and W. M. Moursi. Differentiating through a cone program. arXiv preprint arXiv:1904.09043, 2019. \n[4] A. Ali, E. Wong, and J. Z. Kolter. A semismooth newton method for fast, generic convex programming. In International Conference on Machine Learning, pages 70–79. PMLR, 2017. \n[5] B. Amos. Differentiable optimization-based modeling for machine learning. PhD thesis, PhD thesis. Carnegie Mellon University, 2019. \n[6] B. Amos and J. Z. Kolter. Optnet: Differentiable optimization as a layer in neural networks. In Proc. of ICML, pages 136–145, 2017. \n[7] S. Bai, J. Z. Kolter, and V. Koltun. Deep equilibrium models. arXiv preprint arXiv:1909.01377, 2019. \n[8] A. Beatson, J. Ash, G. Roeder, T. Xue, and R. P. Adams. Learning composable energy surrogates for pde order reduction. In H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, editors, Advances in Neural Information Processing Systems, volume 33, pages 338–348. Curran Associates, Inc., 2020. \n[9] Y. Bengio. Gradient-based optimization of hyperparameters. Neural computation, 12(8):1889– 1900, 2000. \n[10] Q. Bertrand, Q. Klopfenstein, M. Blondel, S. Vaiter, A. Gramfort, and J. Salmon. Implicit differentiation of lasso-type models for hyperparameter optimization. In Proc. of ICML, pages 810–821, 2020. \n[11] Q. Bertrand, Q. Klopfenstein, M. Massias, M. Blondel, S. Vaiter, A. Gramfort, and J. Salmon. Implicit differentiation for fast hyperparameter selection in non-smooth convex learning. arXiv preprint arXiv:2105.01637, 2021. \n[12] M. J. Best, N. Chakravarti, and V. A. Ubhaya. Minimizing separable convex functions subject to simple chain constraints. SIAM Journal on Optimization, 10(3):658–672, 2000. \n[13] E. Bitzek, P. Koskinen, F. Gähler, M. Moseler, and P. Gumbsch. Structural relaxation made simple. Phys. Rev. Lett., 97:170201, Oct 2006. \n[14] M. Blondel. Structured prediction with projection oracles. In Proc. of NeurIPS, 2019. \n[15] M. Blondel, V. Seguy, and A. Rolet. Smooth and sparse optimal transport. In Proc. of AISTATS, pages 880–889. PMLR, 2018. \n[16] M. Blondel, O. Teboul, Q. Berthet, and J. Djolonga. Fast differentiable sorting and ranking. In Proc. of ICML, pages 950–959, 2020. \n[17] J. Bradbury, R. Frostig, P. Hawkins, M. J. Johnson, C. Leary, D. Maclaurin, and S. WandermanMilne. Jax: composable transformations of python $^ +$ numpy programs, 2018. URL http://github. com/google/jax, 4:16, 2020. \n[18] P. Brucker. An $O ( n )$ algorithm for quadratic knapsack problems. Operations Research Letters, 3(3):163–166, 1984. \n[19] O. Chapelle, V. Vapnik, O. Bousquet, and S. Mukherjee. Choosing multiple parameters for support vector machines. Machine learning, 46(1):131–159, 2002. \n[20] X. Chen, Y. Zhang, C. Reisinger, and L. Song. Understanding deep architecture with reasoning layer. Advances in Neural Information Processing Systems, 33, 2020. \n[21] H. Cherkaoui, J. Sulam, and T. Moreau. Learning to solve tv regularised problems with unrolled algorithms. Advances in Neural Information Processing Systems, 33, 2020. \n[22] L. Condat. Fast projection onto the simplex and the $\\ell _ { 1 }$ ball. Mathematical Programming, 158(1-2):575–585, 2016. \n[23] K. Crammer and Y. Singer. On the algorithmic implementation of multiclass kernel-based vector machines. Journal of machine learning research, 2(Dec):265–292, 2001. \n[24] M. Cuturi. Sinkhorn distances: lightspeed computation of optimal transport. In Advances in Neural Information Processing Systems, volume 2, 2013. \n[25] C.-A. Deledalle, S. Vaiter, J. Fadili, and G. Peyré. Stein unbiased gradient estimator of the risk (sugar) for multiple parameter selection. SIAM Journal on Imaging Sciences, 7(4):2448–2487, 2014. \n[26] S. Diamond and S. Boyd. Cvxpy: A python-embedded modeling language for convex optimization. The Journal of Machine Learning Research, 17(1):2909–2913, 2016. \n[27] J. Djolonga and A. Krause. Differentiable learning of submodular models. Proc. of NeurIPS, 30:1013–1023, 2017. \n[28] J. Domke. Generic methods for optimization-based modeling. In Artificial Intelligence and Statistics, pages 318–326. PMLR, 2012. \n[29] J. C. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra. Efficient projections onto the $\\ell _ { 1 }$ -ball for learning in high dimensions. In Proc. of ICML, 2008. \n[30] L. Franceschi, M. Donini, P. Frasconi, and M. Pontil. Forward and reverse gradient-based hyperparameter optimization. In International Conference on Machine Learning, pages 1165– 1173. PMLR, 2017. \n[31] L. Franceschi, P. Frasconi, S. Salzo, R. Grazzi, and M. Pontil. Bilevel programming for hyperparameter optimization and meta-learning. In International Conference on Machine Learning, pages 1568–1577. PMLR, 2018. \n[32] T. Frerix, D. Kochkov, J. A. Smith, D. Cremers, M. P. Brenner, and S. Hoyer. Variational data assimilation with a learned inverse observation operator. 2021. \n[33] R. Frostig, M. Johnson, D. Maclaurin, A. Paszke, and A. Radul. Decomposing reverse-mode automatic differentiation. In LAFI 2021 workshop at POPL, 2021. \n[34] R. Frostig, M. J. Johnson, and C. Leary. Compiling machine learning programs via high-level tracing. Machine Learning and Systems (MLSys), 2018. \n[35] S. Gould, B. Fernando, A. Cherian, P. Anderson, R. S. Cruz, and E. Guo. On differentiating parameterized argmin and argmax problems with application to bi-level optimization. arXiv preprint arXiv:1607.05447, 2016. \n[36] S. Gould, R. Hartley, and D. Campbell. Deep declarative networks: A new hope. arXiv preprint arXiv:1909.04866, 2019. \n[37] S. Grotzinger and C. Witzgall. Projections onto order simplexes. Applied mathematics and Optimization, 12(1):247–270, 1984. \n[38] I. Guyon. Design of experiments of the nips 2003 variable selection benchmark. In NIPS 2003 workshop on feature extraction and feature selection, volume 253, 2003. \n[39] M. R. Hestenes, E. Stiefel, et al. Methods of conjugate gradients for solving linear systems, volume 49. NBS Washington, DC, 1952. \n407 [40] N. J. Higham. Accuracy and Stability of Numerical Algorithms. Society for Industrial and Applied Mathematics, second edition, 2002. \n409 [41] S. Hoyer, J. Sohl-Dickstein, and S. Greydanus. Neural reparameterization improves structural optimization. 2019. [42] Y. Kim, C. Denton, L. Hoang, and A. M. Rush. Structured attention networks. arXiv preprint arXiv:1702.00887, 2017. \n413 [43] D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. \n415 [44] S. G. Krantz and H. R. Parks. The implicit function theorem: history, theory, and applications. Springer Science & Business Media, 2012. \n417 [45] C. H. Lim and S. J. Wright. Efficient bregman projections onto the permutahedron and related polytopes. In Proc. of AISTATS, pages 1205–1213. PMLR, 2016. \n419 [46] J. Lorraine, P. Vicol, and D. Duvenaud. Optimizing millions of hyperparameters by implicit differentiation. In International Conference on Artificial Intelligence and Statistics, pages 1540–1552. PMLR, 2020. \n422 [47] J. Mairal, F. Bach, and J. Ponce. Task-driven dictionary learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(4):791–804, 2012. \n424 [48] A. F. Martins and R. F. Astudillo. From softmax to sparsemax: A sparse model of attention and multi-label classification. In Proc. of ICML, 2016. \n426 [49] C. Michelot. A finite algorithm for finding the projection of a point onto the canonical simplex of $\\mathbb { R } ^ { n }$ . Journal of Optimization Theory and Applications, 50(1):195–200, 1986. \n428 [50] J.-J. Moreau. Proximité et dualité dans un espace hilbertien. Bulletin de la S.M.F., 93:273–299, 1965. \n430 [51] V. Niculae and M. Blondel. A regularized framework for sparse and structured neural attention. In Proc. of NeurIPS, 2017. \n432 [52] V. Niculae and A. Martins. Lp-sparsemap: Differentiable relaxed optimization for sparse structured prediction. In International Conference on Machine Learning, pages 7348–7359, 2020. \n435 [53] V. Niculae, A. Martins, M. Blondel, and C. Cardie. Sparsemap: Differentiable sparse structured inference. In International Conference on Machine Learning, pages 3799–3808. PMLR, 2018. \n437 [54] B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd. Conic optimization via operator splitting and homogeneous self-dual embedding. Journal of Optimization Theory and Applications, 169(3):1042–1068, 2016. \n440 [55] N. Parikh and S. Boyd. Proximal algorithms. Foundations and Trends in optimization, 1(3):127– 239, 2014. \n442 [56] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, et al. Pytorch: An imperative style, high-performance deep learning library. arXiv preprint arXiv:1912.01703, 2019. \n445 [57] F. Pedregosa. Hyperparameter optimization with approximate gradient. In International conference on machine learning. PMLR, 2016. \n447 [58] F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay. Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12:2825–2830, 2011. [59] A. Rajeswaran, C. Finn, S. Kakade, and S. Levine. Meta-learning with implicit gradients. arXiv preprint arXiv:1909.04630, 2019. ", + "bbox": [ + 161, + 106, + 828, + 922 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "", + "bbox": [ + 166, + 73, + 828, + 921 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "", + "bbox": [ + 150, + 74, + 830, + 920 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "453 [60] N. Rappoport and R. Shamir. Multi-omic and multi-view clustering algorithms: review and \n454 cancer benchmark. Nucleic Acids Res., 46:10546–10562, 2018. \n455 [61] Y. Saad and M. H. Schultz. Gmres: A generalized minimal residual algorithm for solving \n456 nonsymmetric linear systems. SIAM Journal on scientific and statistical computing, 7(3):856– \n457 869, 1986. \n458 [62] S. Schoenholz and E. D. Cubuk. Jax md: A framework for differentiable physics. In \n459 H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, editors, Advances in Neural \n460 Information Processing Systems, volume 33, pages 11428–11441. Curran Associates, Inc., \n461 2020. \n462 [63] M. W. Seeger. Cross-validation optimization for large scale structured classification kernel \n463 methods. Journal of Machine Learning Research, 9(6), 2008. \n464 [64] P. Sprechmann, A. M. Bronstein, and G. Sapiro. Supervised non-euclidean sparse nmf via \n465 bilevel optimization with applications to speech enhancement. In 2014 4th Joint Workshop on \n466 Hands-free Speech Communication and Microphone Arrays (HSCMA), pages 11–15. IEEE, \n467 2014. \n468 [65] S. Vaiter, C.-A. Deledalle, G. Peyré, C. Dossal, and J. Fadili. Local behavior of sparse analysis \n469 regularization: Applications to risk estimation. Applied and Computational Harmonic Analysis, \n470 35(3):433–451, 2013. \n471 [66] H. A. v. d. Vorst and H. A. van der Vorst. Bi-CGSTAB: A fast and smoothly converging variant \n472 of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and \n473 Statistical Computing, 13(2):631–644, 1992. \n474 [67] T. Wang, J.-Y. Zhu, A. Torralba, and A. A. Efros. Dataset distillation. arXiv preprint \n475 arXiv:1811.10959, 2018. \n476 [68] R. E. Wengert. A simple automatic derivative evaluation program. Communications of the ACM, \n477 7(8):463–464, 1964. \n478 [69] Y. Wu, M. Ren, R. Liao, and R. B. Grosse. Understanding short-horizon bias in stochastic \n479 meta-optimization. In 6th International Conference on Learning Representations, ICLR 2018, \n480 Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenRe \n481 view.net, 2018. \n482 [70] J. Zarka, L. Thiry, T. Angles, and S. Mallat. Deep network classification by scattering and \n483 homotopy dictionary learning. arXiv preprint arXiv:1910.03561, 2019. ", + "bbox": [ + 137, + 90, + 828, + 630 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "1. For all authors... ", + "bbox": [ + 214, + 116, + 341, + 130 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "(a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope? [Yes] Our paper builds on the premise that reinstantiating the implicit function theorem for every optimization problem a user may encounter is cumbersome. We make the case that a modular approach is needed to bypass that issue. This approach raises several challenges, notably in the way these implicit solvers can be automatically instantiated, consistently, across the large corpus of optimization approaches favored by users. \n(b) Did you describe the limitations of your work? [Yes] , We discuss several limitations in our work. For instance, implicit differentiation requires $\\hat { x }$ to be sufficiently close to $x ^ { \\star }$ to be meaningful. This is the main topic of $\\ S 2 . 3$ \n(c) Did you discuss any potential negative societal impacts of your work? [N/A] As a purely methodological paper, we do not foresee negative societal impacts of our work. \n(d) Have you read the ethics review guidelines and ensured that your paper conforms to them? [Yes] We confirm our paper conforms to those guidelines. ", + "bbox": [ + 238, + 133, + 825, + 332 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "2. If you are including theoretical results... ", + "bbox": [ + 215, + 335, + 493, + 351 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "(a) Did you state the full set of assumptions of all theoretical results? [Yes] , The paper contains one theoretical section, $\\ S 2 . 3$ . \n(b) Did you include complete proofs of all theoretical results? [Yes] , All proofs are included in the Appendix D ", + "bbox": [ + 238, + 353, + 825, + 411 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "3. If you ran experiments... ", + "bbox": [ + 214, + 415, + 393, + 429 + ], + "page_idx": 13 + }, + { + "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)? [No] At the time of submission, we are in the course of an approval process for open-source release required by our organization. We believe that the library itself comprises a contribution, and will have it available in open source by the time of this paper’s publication (at the latest). \n(b) Did you specify all the training details (e.g., data splits, hyperparameters, how they were chosen)? [Yes] , Experiments were mostly run with minimal parameter tuning to reflect the simplicity of the approach we advocate. This is reflected in $\\ S 3$ and Appendix E \n(c) Did you report error bars (e.g., with respect to the random seed after running experiments multiple times)? [Yes] , see Figure 2 and std for the dictionary learning task. \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 Appendix E ", + "bbox": [ + 235, + 434, + 825, + 645 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "4. If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... ", + "bbox": [ + 215, + 648, + 823, + 664 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "(a) If your work uses existing assets, did you cite the creators? [Yes] , see $\\ S 3$ and Appendix E \n(b) Did you mention the license of the assets? [Yes] , see Appendix E \n(c) Did you include any new assets either in the supplemental material or as a URL? [N/A] \n(d) Did you discuss whether and how consent was obtained from people whose data you’re using/curating? [N/A] \n(e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content? [N/A] ", + "bbox": [ + 238, + 666, + 825, + 799 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "5. If you used crowdsourcing or conducted research with human subjects... ", + "bbox": [ + 215, + 801, + 705, + 816 + ], + "page_idx": 13 + }, + { + "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": 13 + } +] \ No newline at end of file diff --git a/parse/train/D8-iwC9UN3/D8-iwC9UN3_middle.json b/parse/train/D8-iwC9UN3/D8-iwC9UN3_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..edfbea7055fe010ed6149298d94de28b3de4af9b --- /dev/null +++ b/parse/train/D8-iwC9UN3/D8-iwC9UN3_middle.json @@ -0,0 +1,53874 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 133, + 97, + 477, + 117 + ], + "lines": [ + { + "bbox": [ + 134, + 97, + 477, + 118 + ], + "spans": [ + { + "bbox": [ + 134, + 97, + 477, + 118 + ], + "score": 1.0, + "content": "Efficient and Modular Implicit Differentiation", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 259, + 159, + 355, + 203 + ], + "lines": [ + { + "bbox": [ + 258, + 159, + 356, + 171 + ], + "spans": [ + { + "bbox": [ + 258, + 159, + 356, + 171 + ], + "score": 1.0, + "content": "Anonymous Author(s)", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 283, + 169, + 328, + 182 + ], + "spans": [ + { + "bbox": [ + 283, + 169, + 328, + 182 + ], + "score": 1.0, + "content": "Affiliation", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 287, + 180, + 324, + 193 + ], + "spans": [ + { + "bbox": [ + 287, + 180, + 324, + 193 + ], + "score": 1.0, + "content": "Address", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 290, + 193, + 320, + 203 + ], + "spans": [ + { + "bbox": [ + 290, + 193, + 320, + 203 + ], + "score": 1.0, + "content": "email", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 283, + 232, + 328, + 245 + ], + "lines": [ + { + "bbox": [ + 281, + 231, + 331, + 246 + ], + "spans": [ + { + "bbox": [ + 281, + 231, + 331, + 246 + ], + "score": 1.0, + "content": "Abstract", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 91, + 257, + 469, + 443 + ], + "lines": [ + { + "bbox": [ + 93, + 258, + 469, + 270 + ], + "spans": [ + { + "bbox": [ + 93, + 261, + 99, + 269 + ], + "score": 1.0, + "content": "1", + "type": "text" + }, + { + "bbox": [ + 142, + 258, + 469, + 270 + ], + "score": 1.0, + "content": "Automatic differentiation (autodiff) has revolutionized machine learning. It allows", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 93, + 268, + 469, + 280 + ], + "spans": [ + { + "bbox": [ + 93, + 271, + 99, + 279 + ], + "score": 1.0, + "content": "2", + "type": "text" + }, + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "score": 1.0, + "content": "expressing complex computations by composing elementary ones in creative ways", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 93, + 278, + 470, + 292 + ], + "spans": [ + { + "bbox": [ + 93, + 282, + 99, + 290 + ], + "score": 1.0, + "content": "3", + "type": "text" + }, + { + "bbox": [ + 142, + 278, + 470, + 292 + ], + "score": 1.0, + "content": "and removes the burden of computing their derivatives by hand. More recently,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 93, + 290, + 470, + 302 + ], + "spans": [ + { + "bbox": [ + 93, + 293, + 99, + 302 + ], + "score": 1.0, + "content": "4", + "type": "text" + }, + { + "bbox": [ + 141, + 290, + 470, + 302 + ], + "score": 1.0, + "content": "differentiation of optimization problem solutions has attracted widespread attention", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 93, + 301, + 470, + 313 + ], + "spans": [ + { + "bbox": [ + 93, + 304, + 99, + 312 + ], + "score": 1.0, + "content": "5", + "type": "text" + }, + { + "bbox": [ + 142, + 301, + 470, + 313 + ], + "score": 1.0, + "content": "with applications such as optimization as a layer, and in bi-level problems such as", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 92, + 312, + 470, + 324 + ], + "spans": [ + { + "bbox": [ + 92, + 315, + 99, + 323 + ], + "score": 1.0, + "content": "6", + "type": "text" + }, + { + "bbox": [ + 141, + 312, + 470, + 324 + ], + "score": 1.0, + "content": "hyper-parameter optimization and meta-learning. However, the formulas for these", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 92, + 323, + 470, + 335 + ], + "spans": [ + { + "bbox": [ + 92, + 325, + 99, + 334 + ], + "score": 1.0, + "content": "7", + "type": "text" + }, + { + "bbox": [ + 141, + 323, + 470, + 335 + ], + "score": 1.0, + "content": "derivatives often involve case-by-case tedious mathematical derivations. In this", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 92, + 334, + 470, + 347 + ], + "spans": [ + { + "bbox": [ + 92, + 336, + 100, + 345 + ], + "score": 1.0, + "content": "8", + "type": "text" + }, + { + "bbox": [ + 141, + 334, + 470, + 347 + ], + "score": 1.0, + "content": "paper, we propose a unified, efficient and modular approach for implicit differentia-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 92, + 345, + 470, + 357 + ], + "spans": [ + { + "bbox": [ + 92, + 347, + 99, + 356 + ], + "score": 1.0, + "content": "9", + "type": "text" + }, + { + "bbox": [ + 142, + 345, + 470, + 357 + ], + "score": 1.0, + "content": "tion of optimization problems. In our approach, the user defines (in Python in the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 90, + 355, + 470, + 369 + ], + "spans": [ + { + "bbox": [ + 90, + 357, + 99, + 367 + ], + "score": 1.0, + "content": "10", + "type": "text" + }, + { + "bbox": [ + 141, + 355, + 303, + 369 + ], + "score": 1.0, + "content": "case of our implementation) a function", + "type": "text" + }, + { + "bbox": [ + 303, + 356, + 312, + 365 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 355, + 470, + 369 + ], + "score": 1.0, + "content": "capturing the optimality conditions of", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 89, + 367, + 470, + 379 + ], + "spans": [ + { + "bbox": [ + 89, + 369, + 100, + 379 + ], + "score": 1.0, + "content": "11", + "type": "text" + }, + { + "bbox": [ + 142, + 367, + 442, + 379 + ], + "score": 1.0, + "content": "the problem to be differentiated. Once this is done, we leverage autodiff of", + "type": "text" + }, + { + "bbox": [ + 442, + 367, + 451, + 376 + ], + "score": 0.84, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 367, + 470, + 379 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 89, + 377, + 469, + 389 + ], + "spans": [ + { + "bbox": [ + 89, + 379, + 100, + 389 + ], + "score": 1.0, + "content": "12", + "type": "text" + }, + { + "bbox": [ + 142, + 377, + 469, + 389 + ], + "score": 1.0, + "content": "implicit differentiation to automatically differentiate the optimization problem. Our", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 89, + 388, + 470, + 401 + ], + "spans": [ + { + "bbox": [ + 89, + 390, + 100, + 401 + ], + "score": 1.0, + "content": "13", + "type": "text" + }, + { + "bbox": [ + 141, + 388, + 470, + 401 + ], + "score": 1.0, + "content": "approach thus combines the benefits of implicit differentiation and autodiff. We", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 90, + 399, + 470, + 412 + ], + "spans": [ + { + "bbox": [ + 90, + 402, + 99, + 411 + ], + "score": 1.0, + "content": "14", + "type": "text" + }, + { + "bbox": [ + 141, + 399, + 470, + 412 + ], + "score": 1.0, + "content": "show that seemingly simple principles allow to recover many recently proposed im-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 89, + 410, + 470, + 423 + ], + "spans": [ + { + "bbox": [ + 89, + 412, + 100, + 422 + ], + "score": 1.0, + "content": "15", + "type": "text" + }, + { + "bbox": [ + 142, + 410, + 470, + 423 + ], + "score": 1.0, + "content": "plicit differentiation methods and create new ones easily. We demonstrate the ease", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 89, + 421, + 470, + 433 + ], + "spans": [ + { + "bbox": [ + 89, + 423, + 100, + 433 + ], + "score": 1.0, + "content": "16", + "type": "text" + }, + { + "bbox": [ + 142, + 421, + 470, + 433 + ], + "score": 1.0, + "content": "of formulating and solving bi-level optimization problems using our framework.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 90, + 431, + 466, + 444 + ], + "spans": [ + { + "bbox": [ + 90, + 434, + 99, + 443 + ], + "score": 1.0, + "content": "17", + "type": "text" + }, + { + "bbox": [ + 141, + 431, + 466, + 444 + ], + "score": 1.0, + "content": "We also showcase an application to the sensitivity analysis of molecular dynamics.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 91, + 464, + 190, + 478 + ], + "lines": [ + { + "bbox": [ + 87, + 463, + 192, + 480 + ], + "spans": [ + { + "bbox": [ + 87, + 463, + 192, + 480 + ], + "score": 1.0, + "content": "18 1 Introduction", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 89, + 489, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 90, + 489, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 90, + 491, + 99, + 501 + ], + "score": 1.0, + "content": "19", + "type": "text" + }, + { + "bbox": [ + 105, + 489, + 505, + 501 + ], + "score": 1.0, + "content": "Automatic differentiation (autodiff) is now an inherent part of machine learning software. It allows", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 88, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 88, + 502, + 100, + 512 + ], + "score": 1.0, + "content": "20", + "type": "text" + }, + { + "bbox": [ + 105, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "expressing complex computations by composing elementary ones in creative ways and removes", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 88, + 512, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 88, + 513, + 99, + 523 + ], + "score": 1.0, + "content": "21", + "type": "text" + }, + { + "bbox": [ + 106, + 512, + 505, + 524 + ], + "score": 1.0, + "content": "the tedious burden of computing their derivatives by hand. The differentiation of optimization", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 89, + 522, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 89, + 524, + 100, + 534 + ], + "score": 1.0, + "content": "22", + "type": "text" + }, + { + "bbox": [ + 105, + 522, + 506, + 534 + ], + "score": 1.0, + "content": "problem solutions has found many applications. A classical example is bi-level optimization, which", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 88, + 533, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 88, + 535, + 99, + 545 + ], + "score": 1.0, + "content": "23", + "type": "text" + }, + { + "bbox": [ + 105, + 533, + 505, + 545 + ], + "score": 1.0, + "content": "typically involves computing the derivatives of a nested optimization problem in order to solve", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 88, + 543, + 506, + 557 + ], + "spans": [ + { + "bbox": [ + 88, + 546, + 99, + 556 + ], + "score": 1.0, + "content": "24", + "type": "text" + }, + { + "bbox": [ + 104, + 543, + 506, + 557 + ], + "score": 1.0, + "content": "an outer one. Examples of applications in machine learning include hyper-parameter optimization", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 88, + 554, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 88, + 556, + 100, + 567 + ], + "score": 1.0, + "content": "25", + "type": "text" + }, + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "score": 1.0, + "content": "[19, 63, 57, 30, 10, 11], neural networks [46], and meta-learning [31, 59]. Another line of applications", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 88, + 566, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 88, + 568, + 99, + 578 + ], + "score": 1.0, + "content": "26", + "type": "text" + }, + { + "bbox": [ + 105, + 566, + 506, + 578 + ], + "score": 1.0, + "content": "is “optimization as a layer” [42, 6, 51, 27, 36, 7], which usually includes regularization or constraints", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 89, + 577, + 506, + 589 + ], + "spans": [ + { + "bbox": [ + 89, + 578, + 99, + 588 + ], + "score": 1.0, + "content": "27", + "type": "text" + }, + { + "bbox": [ + 105, + 577, + 506, + 589 + ], + "score": 1.0, + "content": "in the optimization problem in order to impose desirable structure on the layer output. In addition", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 88, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 88, + 590, + 100, + 600 + ], + "score": 1.0, + "content": "28", + "type": "text" + }, + { + "bbox": [ + 105, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "to providing well sought-for interpretability, recent research indicates that such structure could be", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 88, + 598, + 384, + 610 + ], + "spans": [ + { + "bbox": [ + 88, + 600, + 99, + 610 + ], + "score": 1.0, + "content": "29", + "type": "text" + }, + { + "bbox": [ + 105, + 598, + 384, + 610 + ], + "score": 1.0, + "content": "beneficial in order to improve generalization of neural networks [20].", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 90, + 615, + 505, + 713 + ], + "lines": [ + { + "bbox": [ + 89, + 615, + 506, + 627 + ], + "spans": [ + { + "bbox": [ + 89, + 617, + 100, + 626 + ], + "score": 1.0, + "content": "30", + "type": "text" + }, + { + "bbox": [ + 106, + 615, + 506, + 627 + ], + "score": 1.0, + "content": "Since optimization problem solutions typically do not enjoy an explicit formula in terms of their", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 88, + 626, + 505, + 638 + ], + "spans": [ + { + "bbox": [ + 88, + 628, + 99, + 637 + ], + "score": 1.0, + "content": "31", + "type": "text" + }, + { + "bbox": [ + 106, + 626, + 505, + 638 + ], + "score": 1.0, + "content": "inputs, autodiff cannot be used directly to differentiate these functions. In recent years, two main", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 89, + 636, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 89, + 639, + 100, + 648 + ], + "score": 1.0, + "content": "32", + "type": "text" + }, + { + "bbox": [ + 105, + 636, + 506, + 649 + ], + "score": 1.0, + "content": "approaches have been developed to circumvent this problem. The first one consists in unrolling the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 88, + 647, + 506, + 660 + ], + "spans": [ + { + "bbox": [ + 88, + 650, + 100, + 659 + ], + "score": 1.0, + "content": "33", + "type": "text" + }, + { + "bbox": [ + 105, + 647, + 506, + 660 + ], + "score": 1.0, + "content": "iterations of an optimization algorithm and to use the final iteration as a proxy for the optimization", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 89, + 658, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 89, + 661, + 100, + 670 + ], + "score": 1.0, + "content": "34", + "type": "text" + }, + { + "bbox": [ + 105, + 658, + 506, + 672 + ], + "score": 1.0, + "content": "problem solution [68, 28, 25, 31]. An advantage of this approach is that autodiff through the algorithm", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 88, + 670, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 88, + 671, + 100, + 682 + ], + "score": 1.0, + "content": "35", + "type": "text" + }, + { + "bbox": [ + 106, + 670, + 505, + 681 + ], + "score": 1.0, + "content": "iterates can then be used transparently. However, this requires a reimplementation of the algorithm", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 89, + 680, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 89, + 682, + 100, + 692 + ], + "score": 1.0, + "content": "36", + "type": "text" + }, + { + "bbox": [ + 105, + 680, + 506, + 693 + ], + "score": 1.0, + "content": "using the autodiff system, and not all algorithms are necessarily autodiff friendly. Moreover, forward-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 89, + 692, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 89, + 694, + 99, + 703 + ], + "score": 1.0, + "content": "37", + "type": "text" + }, + { + "bbox": [ + 106, + 692, + 505, + 703 + ], + "score": 1.0, + "content": "mode autodiff has time complexity that scales linearly with the number of variables and reverse-mode", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 89, + 702, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 89, + 704, + 100, + 714 + ], + "score": 1.0, + "content": "38", + "type": "text" + }, + { + "bbox": [ + 105, + 702, + 505, + 714 + ], + "score": 1.0, + "content": "autodiff has memory complexity that scales linearly with the number of algorithm iterations. A second", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 39 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 104, + 731, + 499, + 742 + ], + "lines": [ + { + "bbox": [ + 106, + 730, + 500, + 743 + ], + "spans": [ + { + "bbox": [ + 106, + 730, + 500, + 743 + ], + "score": 1.0, + "content": "Submitted to 35th Conference on Neural Information Processing Systems (NeurIPS 2021). Do not distribute.", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 133, + 97, + 477, + 117 + ], + "lines": [ + { + "bbox": [ + 134, + 97, + 477, + 118 + ], + "spans": [ + { + "bbox": [ + 134, + 97, + 477, + 118 + ], + "score": 1.0, + "content": "Efficient and Modular Implicit Differentiation", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "list", + "bbox": [ + 259, + 159, + 355, + 203 + ], + "lines": [ + { + "bbox": [ + 258, + 159, + 356, + 171 + ], + "spans": [ + { + "bbox": [ + 258, + 159, + 356, + 171 + ], + "score": 1.0, + "content": "Anonymous Author(s)", + "type": "text" + } + ], + "index": 1, + "is_list_start_line": true + }, + { + "bbox": [ + 283, + 169, + 328, + 182 + ], + "spans": [ + { + "bbox": [ + 283, + 169, + 328, + 182 + ], + "score": 1.0, + "content": "Affiliation", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 287, + 180, + 324, + 193 + ], + "spans": [ + { + "bbox": [ + 287, + 180, + 324, + 193 + ], + "score": 1.0, + "content": "Address", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 290, + 193, + 320, + 203 + ], + "spans": [ + { + "bbox": [ + 290, + 193, + 320, + 203 + ], + "score": 1.0, + "content": "email", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + } + ], + "index": 2.5, + "bbox_fs": [ + 258, + 159, + 356, + 203 + ] + }, + { + "type": "title", + "bbox": [ + 283, + 232, + 328, + 245 + ], + "lines": [ + { + "bbox": [ + 281, + 231, + 331, + 246 + ], + "spans": [ + { + "bbox": [ + 281, + 231, + 331, + 246 + ], + "score": 1.0, + "content": "Abstract", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "index", + "bbox": [ + 91, + 257, + 469, + 443 + ], + "lines": [ + { + "bbox": [ + 93, + 258, + 469, + 270 + ], + "spans": [ + { + "bbox": [ + 93, + 261, + 99, + 269 + ], + "score": 1.0, + "content": "1", + "type": "text" + }, + { + "bbox": [ + 142, + 258, + 469, + 270 + ], + "score": 1.0, + "content": "Automatic differentiation (autodiff) has revolutionized machine learning. It allows", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 268, + 469, + 280 + ], + "spans": [ + { + "bbox": [ + 93, + 271, + 99, + 279 + ], + "score": 1.0, + "content": "2", + "type": "text" + }, + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "score": 1.0, + "content": "expressing complex computations by composing elementary ones in creative ways", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 278, + 470, + 292 + ], + "spans": [ + { + "bbox": [ + 93, + 282, + 99, + 290 + ], + "score": 1.0, + "content": "3", + "type": "text" + }, + { + "bbox": [ + 142, + 278, + 470, + 292 + ], + "score": 1.0, + "content": "and removes the burden of computing their derivatives by hand. More recently,", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 290, + 470, + 302 + ], + "spans": [ + { + "bbox": [ + 93, + 293, + 99, + 302 + ], + "score": 1.0, + "content": "4", + "type": "text" + }, + { + "bbox": [ + 141, + 290, + 470, + 302 + ], + "score": 1.0, + "content": "differentiation of optimization problem solutions has attracted widespread attention", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 301, + 470, + 313 + ], + "spans": [ + { + "bbox": [ + 93, + 304, + 99, + 312 + ], + "score": 1.0, + "content": "5", + "type": "text" + }, + { + "bbox": [ + 142, + 301, + 470, + 313 + ], + "score": 1.0, + "content": "with applications such as optimization as a layer, and in bi-level problems such as", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 92, + 312, + 470, + 324 + ], + "spans": [ + { + "bbox": [ + 92, + 315, + 99, + 323 + ], + "score": 1.0, + "content": "6", + "type": "text" + }, + { + "bbox": [ + 141, + 312, + 470, + 324 + ], + "score": 1.0, + "content": "hyper-parameter optimization and meta-learning. However, the formulas for these", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 92, + 323, + 470, + 335 + ], + "spans": [ + { + "bbox": [ + 92, + 325, + 99, + 334 + ], + "score": 1.0, + "content": "7", + "type": "text" + }, + { + "bbox": [ + 141, + 323, + 470, + 335 + ], + "score": 1.0, + "content": "derivatives often involve case-by-case tedious mathematical derivations. In this", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 92, + 334, + 470, + 347 + ], + "spans": [ + { + "bbox": [ + 92, + 336, + 100, + 345 + ], + "score": 1.0, + "content": "8", + "type": "text" + }, + { + "bbox": [ + 141, + 334, + 470, + 347 + ], + "score": 1.0, + "content": "paper, we propose a unified, efficient and modular approach for implicit differentia-", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 92, + 345, + 470, + 357 + ], + "spans": [ + { + "bbox": [ + 92, + 347, + 99, + 356 + ], + "score": 1.0, + "content": "9", + "type": "text" + }, + { + "bbox": [ + 142, + 345, + 470, + 357 + ], + "score": 1.0, + "content": "tion of optimization problems. In our approach, the user defines (in Python in the", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 90, + 355, + 470, + 369 + ], + "spans": [ + { + "bbox": [ + 90, + 357, + 99, + 367 + ], + "score": 1.0, + "content": "10", + "type": "text" + }, + { + "bbox": [ + 141, + 355, + 303, + 369 + ], + "score": 1.0, + "content": "case of our implementation) a function", + "type": "text" + }, + { + "bbox": [ + 303, + 356, + 312, + 365 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 355, + 470, + 369 + ], + "score": 1.0, + "content": "capturing the optimality conditions of", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 367, + 470, + 379 + ], + "spans": [ + { + "bbox": [ + 89, + 369, + 100, + 379 + ], + "score": 1.0, + "content": "11", + "type": "text" + }, + { + "bbox": [ + 142, + 367, + 442, + 379 + ], + "score": 1.0, + "content": "the problem to be differentiated. Once this is done, we leverage autodiff of", + "type": "text" + }, + { + "bbox": [ + 442, + 367, + 451, + 376 + ], + "score": 0.84, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 367, + 470, + 379 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 377, + 469, + 389 + ], + "spans": [ + { + "bbox": [ + 89, + 379, + 100, + 389 + ], + "score": 1.0, + "content": "12", + "type": "text" + }, + { + "bbox": [ + 142, + 377, + 469, + 389 + ], + "score": 1.0, + "content": "implicit differentiation to automatically differentiate the optimization problem. Our", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 388, + 470, + 401 + ], + "spans": [ + { + "bbox": [ + 89, + 390, + 100, + 401 + ], + "score": 1.0, + "content": "13", + "type": "text" + }, + { + "bbox": [ + 141, + 388, + 470, + 401 + ], + "score": 1.0, + "content": "approach thus combines the benefits of implicit differentiation and autodiff. We", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 90, + 399, + 470, + 412 + ], + "spans": [ + { + "bbox": [ + 90, + 402, + 99, + 411 + ], + "score": 1.0, + "content": "14", + "type": "text" + }, + { + "bbox": [ + 141, + 399, + 470, + 412 + ], + "score": 1.0, + "content": "show that seemingly simple principles allow to recover many recently proposed im-", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 410, + 470, + 423 + ], + "spans": [ + { + "bbox": [ + 89, + 412, + 100, + 422 + ], + "score": 1.0, + "content": "15", + "type": "text" + }, + { + "bbox": [ + 142, + 410, + 470, + 423 + ], + "score": 1.0, + "content": "plicit differentiation methods and create new ones easily. We demonstrate the ease", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 421, + 470, + 433 + ], + "spans": [ + { + "bbox": [ + 89, + 423, + 100, + 433 + ], + "score": 1.0, + "content": "16", + "type": "text" + }, + { + "bbox": [ + 142, + 421, + 470, + 433 + ], + "score": 1.0, + "content": "of formulating and solving bi-level optimization problems using our framework.", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 90, + 431, + 466, + 444 + ], + "spans": [ + { + "bbox": [ + 90, + 434, + 99, + 443 + ], + "score": 1.0, + "content": "17", + "type": "text" + }, + { + "bbox": [ + 141, + 431, + 466, + 444 + ], + "score": 1.0, + "content": "We also showcase an application to the sensitivity analysis of molecular dynamics.", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + } + ], + "index": 14, + "bbox_fs": [ + 89, + 258, + 470, + 444 + ] + }, + { + "type": "title", + "bbox": [ + 91, + 464, + 190, + 478 + ], + "lines": [ + { + "bbox": [ + 87, + 463, + 192, + 480 + ], + "spans": [ + { + "bbox": [ + 87, + 463, + 192, + 480 + ], + "score": 1.0, + "content": "18 1 Introduction", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "index", + "bbox": [ + 89, + 489, + 505, + 609 + ], + "lines": [ + { + "bbox": [ + 90, + 489, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 90, + 491, + 99, + 501 + ], + "score": 1.0, + "content": "19", + "type": "text" + }, + { + "bbox": [ + 105, + 489, + 505, + 501 + ], + "score": 1.0, + "content": "Automatic differentiation (autodiff) is now an inherent part of machine learning software. It allows", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 88, + 502, + 100, + 512 + ], + "score": 1.0, + "content": "20", + "type": "text" + }, + { + "bbox": [ + 105, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "expressing complex computations by composing elementary ones in creative ways and removes", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 512, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 88, + 513, + 99, + 523 + ], + "score": 1.0, + "content": "21", + "type": "text" + }, + { + "bbox": [ + 106, + 512, + 505, + 524 + ], + "score": 1.0, + "content": "the tedious burden of computing their derivatives by hand. The differentiation of optimization", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 522, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 89, + 524, + 100, + 534 + ], + "score": 1.0, + "content": "22", + "type": "text" + }, + { + "bbox": [ + 105, + 522, + 506, + 534 + ], + "score": 1.0, + "content": "problem solutions has found many applications. A classical example is bi-level optimization, which", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 533, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 88, + 535, + 99, + 545 + ], + "score": 1.0, + "content": "23", + "type": "text" + }, + { + "bbox": [ + 105, + 533, + 505, + 545 + ], + "score": 1.0, + "content": "typically involves computing the derivatives of a nested optimization problem in order to solve", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 543, + 506, + 557 + ], + "spans": [ + { + "bbox": [ + 88, + 546, + 99, + 556 + ], + "score": 1.0, + "content": "24", + "type": "text" + }, + { + "bbox": [ + 104, + 543, + 506, + 557 + ], + "score": 1.0, + "content": "an outer one. Examples of applications in machine learning include hyper-parameter optimization", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 554, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 88, + 556, + 100, + 567 + ], + "score": 1.0, + "content": "25", + "type": "text" + }, + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "score": 1.0, + "content": "[19, 63, 57, 30, 10, 11], neural networks [46], and meta-learning [31, 59]. Another line of applications", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 566, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 88, + 568, + 99, + 578 + ], + "score": 1.0, + "content": "26", + "type": "text" + }, + { + "bbox": [ + 105, + 566, + 506, + 578 + ], + "score": 1.0, + "content": "is “optimization as a layer” [42, 6, 51, 27, 36, 7], which usually includes regularization or constraints", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 577, + 506, + 589 + ], + "spans": [ + { + "bbox": [ + 89, + 578, + 99, + 588 + ], + "score": 1.0, + "content": "27", + "type": "text" + }, + { + "bbox": [ + 105, + 577, + 506, + 589 + ], + "score": 1.0, + "content": "in the optimization problem in order to impose desirable structure on the layer output. In addition", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 88, + 590, + 100, + 600 + ], + "score": 1.0, + "content": "28", + "type": "text" + }, + { + "bbox": [ + 105, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "to providing well sought-for interpretability, recent research indicates that such structure could be", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 598, + 384, + 610 + ], + "spans": [ + { + "bbox": [ + 88, + 600, + 99, + 610 + ], + "score": 1.0, + "content": "29", + "type": "text" + }, + { + "bbox": [ + 105, + 598, + 384, + 610 + ], + "score": 1.0, + "content": "beneficial in order to improve generalization of neural networks [20].", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 615, + 506, + 627 + ], + "spans": [ + { + "bbox": [ + 89, + 617, + 100, + 626 + ], + "score": 1.0, + "content": "30", + "type": "text" + }, + { + "bbox": [ + 106, + 615, + 506, + 627 + ], + "score": 1.0, + "content": "Since optimization problem solutions typically do not enjoy an explicit formula in terms of their", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 626, + 505, + 638 + ], + "spans": [ + { + "bbox": [ + 88, + 628, + 99, + 637 + ], + "score": 1.0, + "content": "31", + "type": "text" + }, + { + "bbox": [ + 106, + 626, + 505, + 638 + ], + "score": 1.0, + "content": "inputs, autodiff cannot be used directly to differentiate these functions. In recent years, two main", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 636, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 89, + 639, + 100, + 648 + ], + "score": 1.0, + "content": "32", + "type": "text" + }, + { + "bbox": [ + 105, + 636, + 506, + 649 + ], + "score": 1.0, + "content": "approaches have been developed to circumvent this problem. The first one consists in unrolling the", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 647, + 506, + 660 + ], + "spans": [ + { + "bbox": [ + 88, + 650, + 100, + 659 + ], + "score": 1.0, + "content": "33", + "type": "text" + }, + { + "bbox": [ + 105, + 647, + 506, + 660 + ], + "score": 1.0, + "content": "iterations of an optimization algorithm and to use the final iteration as a proxy for the optimization", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 658, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 89, + 661, + 100, + 670 + ], + "score": 1.0, + "content": "34", + "type": "text" + }, + { + "bbox": [ + 105, + 658, + 506, + 672 + ], + "score": 1.0, + "content": "problem solution [68, 28, 25, 31]. An advantage of this approach is that autodiff through the algorithm", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 670, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 88, + 671, + 100, + 682 + ], + "score": 1.0, + "content": "35", + "type": "text" + }, + { + "bbox": [ + 106, + 670, + 505, + 681 + ], + "score": 1.0, + "content": "iterates can then be used transparently. However, this requires a reimplementation of the algorithm", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 680, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 89, + 682, + 100, + 692 + ], + "score": 1.0, + "content": "36", + "type": "text" + }, + { + "bbox": [ + 105, + 680, + 506, + 693 + ], + "score": 1.0, + "content": "using the autodiff system, and not all algorithms are necessarily autodiff friendly. Moreover, forward-", + "type": "text" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 692, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 89, + 694, + 99, + 703 + ], + "score": 1.0, + "content": "37", + "type": "text" + }, + { + "bbox": [ + 106, + 692, + 505, + 703 + ], + "score": 1.0, + "content": "mode autodiff has time complexity that scales linearly with the number of variables and reverse-mode", + "type": "text" + } + ], + "index": 42, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 702, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 89, + 704, + 100, + 714 + ], + "score": 1.0, + "content": "38", + "type": "text" + }, + { + "bbox": [ + 105, + 702, + 505, + 714 + ], + "score": 1.0, + "content": "autodiff has memory complexity that scales linearly with the number of algorithm iterations. A second", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 72, + 505, + 86 + ], + "spans": [ + { + "bbox": [ + 89, + 75, + 99, + 84 + ], + "score": 1.0, + "content": "39", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 72, + 505, + 86 + ], + "score": 1.0, + "content": "approach is to see optimization problem solutions as implicitly-defined functions of certain optimality", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 84, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 88, + 85, + 100, + 96 + ], + "score": 1.0, + "content": "40", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 106, + 84, + 505, + 96 + ], + "score": 1.0, + "content": "conditions. Examples include stationary conditions [9, 46], KKT conditions [19, 35, 6, 53, 52] and", + "type": "text", + "cross_page": true + } + ], + "index": 1, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 94, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 88, + 96, + 99, + 106 + ], + "score": 1.0, + "content": "41", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 94, + 506, + 106 + ], + "score": 1.0, + "content": "the proximal gradient fixed point [51, 10, 11]. An advantage of such implicit differentiation is that", + "type": "text", + "cross_page": true + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 105, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 88, + 108, + 99, + 117 + ], + "score": 1.0, + "content": "42", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 104, + 105, + 506, + 118 + ], + "score": 1.0, + "content": "a reimplementation is not needed, allowing to build upon state-of-the-art software. However, so", + "type": "text", + "cross_page": true + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 117, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 88, + 118, + 99, + 128 + ], + "score": 1.0, + "content": "43", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 106, + 117, + 505, + 129 + ], + "score": 1.0, + "content": "far, obtaining the implicit differentiation formulas required a case-by-case tedious mathematical", + "type": "text", + "cross_page": true + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 88, + 129, + 100, + 138 + ], + "score": 1.0, + "content": "44", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "derivation. Recent work [2] attempts to address this issue by adding implicit differentiation on top of", + "type": "text", + "cross_page": true + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 136, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 88, + 140, + 100, + 151 + ], + "score": 1.0, + "content": "45", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 104, + 136, + 506, + 153 + ], + "score": 1.0, + "content": "cvxpy [26]. This works by reducing all convex optimization problems to a conic program and using", + "type": "text", + "cross_page": true + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 88, + 151, + 99, + 161 + ], + "score": 1.0, + "content": "46", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "score": 1.0, + "content": "conic programming’s optimality conditions to derive an implicit differentiation formula. While this", + "type": "text", + "cross_page": true + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 160, + 504, + 173 + ], + "spans": [ + { + "bbox": [ + 88, + 162, + 99, + 172 + ], + "score": 1.0, + "content": "47", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 160, + 504, + 173 + ], + "score": 1.0, + "content": "approach is very generic, solving a convex optimization problem using a conic programming solver—", + "type": "text", + "cross_page": true + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 170, + 506, + 184 + ], + "spans": [ + { + "bbox": [ + 88, + 173, + 99, + 182 + ], + "score": 1.0, + "content": "48", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 170, + 506, + 184 + ], + "score": 1.0, + "content": "an ADMM-based splitting conic solver [54] in the case of cvxpy—is rarely the state-of-the-art", + "type": "text", + "cross_page": true + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 181, + 294, + 195 + ], + "spans": [ + { + "bbox": [ + 88, + 184, + 99, + 193 + ], + "score": 1.0, + "content": "49", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 181, + 294, + 195 + ], + "score": 1.0, + "content": "approach for each particular problem instance.", + "type": "text", + "cross_page": true + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 90, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 90, + 200, + 99, + 209 + ], + "score": 1.0, + "content": "50", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 104, + 197, + 506, + 211 + ], + "score": 1.0, + "content": "In this work, we adopt a different strategy, which allows to easily add implicit differentiation on top", + "type": "text", + "cross_page": true + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 209, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 89, + 211, + 99, + 221 + ], + "score": 1.0, + "content": "51", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 209, + 505, + 221 + ], + "score": 1.0, + "content": "of existing solvers. In our approach, the user defines (in Python in the case of our implementation)", + "type": "text", + "cross_page": true + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 220, + 506, + 232 + ], + "spans": [ + { + "bbox": [ + 89, + 222, + 100, + 232 + ], + "score": 1.0, + "content": "52", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 104, + 220, + 188, + 232 + ], + "score": 1.0, + "content": "a mapping function", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 188, + 221, + 197, + 230 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 198, + 220, + 506, + 232 + ], + "score": 1.0, + "content": "capturing the optimality conditions of the problem solved by the algorithm.", + "type": "text", + "cross_page": true + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 231, + 506, + 244 + ], + "spans": [ + { + "bbox": [ + 89, + 233, + 100, + 242 + ], + "score": 1.0, + "content": "53", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 231, + 279, + 244 + ], + "score": 1.0, + "content": "Once this is done, we leverage autodiff of", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 280, + 231, + 289, + 241 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 289, + 231, + 506, + 244 + ], + "score": 1.0, + "content": "combined with implicit differentiation techniques to", + "type": "text", + "cross_page": true + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 240, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 89, + 244, + 100, + 253 + ], + "score": 1.0, + "content": "54", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 240, + 506, + 255 + ], + "score": 1.0, + "content": "automatically differentiate the optimization problem solution. In this way, our approach is very", + "type": "text", + "cross_page": true + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 252, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 89, + 255, + 100, + 264 + ], + "score": 1.0, + "content": "55", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 252, + 506, + 266 + ], + "score": 1.0, + "content": "generic and still the efficiency of state-of-the-art solvers. It therefore combines the benefits of implicit", + "type": "text", + "cross_page": true + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 263, + 432, + 276 + ], + "spans": [ + { + "bbox": [ + 89, + 266, + 100, + 275 + ], + "score": 1.0, + "content": "56", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 105, + 263, + 432, + 276 + ], + "score": 1.0, + "content": "differentiation and autodiff. To summarize, we make the following contributions.", + "type": "text", + "cross_page": true + } + ], + "index": 17, + "is_list_start_line": true + } + ], + "index": 29, + "bbox_fs": [ + 88, + 489, + 506, + 610 + ] + }, + { + "type": "index", + "bbox": [ + 90, + 615, + 505, + 713 + ], + "lines": [], + "index": 39, + "bbox_fs": [ + 88, + 615, + 506, + 714 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 89, + 72, + 505, + 193 + ], + "lines": [ + { + "bbox": [ + 89, + 72, + 505, + 86 + ], + "spans": [ + { + "bbox": [ + 89, + 75, + 99, + 84 + ], + "score": 1.0, + "content": "39", + "type": "text" + }, + { + "bbox": [ + 105, + 72, + 505, + 86 + ], + "score": 1.0, + "content": "approach is to see optimization problem solutions as implicitly-defined functions of certain optimality", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 88, + 84, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 88, + 85, + 100, + 96 + ], + "score": 1.0, + "content": "40", + "type": "text" + }, + { + "bbox": [ + 106, + 84, + 505, + 96 + ], + "score": 1.0, + "content": "conditions. Examples include stationary conditions [9, 46], KKT conditions [19, 35, 6, 53, 52] and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 88, + 94, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 88, + 96, + 99, + 106 + ], + "score": 1.0, + "content": "41", + "type": "text" + }, + { + "bbox": [ + 105, + 94, + 506, + 106 + ], + "score": 1.0, + "content": "the proximal gradient fixed point [51, 10, 11]. An advantage of such implicit differentiation is that", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 88, + 105, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 88, + 108, + 99, + 117 + ], + "score": 1.0, + "content": "42", + "type": "text" + }, + { + "bbox": [ + 104, + 105, + 506, + 118 + ], + "score": 1.0, + "content": "a reimplementation is not needed, allowing to build upon state-of-the-art software. However, so", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 88, + 117, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 88, + 118, + 99, + 128 + ], + "score": 1.0, + "content": "43", + "type": "text" + }, + { + "bbox": [ + 106, + 117, + 505, + 129 + ], + "score": 1.0, + "content": "far, obtaining the implicit differentiation formulas required a case-by-case tedious mathematical", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 88, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 88, + 129, + 100, + 138 + ], + "score": 1.0, + "content": "44", + "type": "text" + }, + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "derivation. Recent work [2] attempts to address this issue by adding implicit differentiation on top of", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 88, + 136, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 88, + 140, + 100, + 151 + ], + "score": 1.0, + "content": "45", + "type": "text" + }, + { + "bbox": [ + 104, + 136, + 506, + 153 + ], + "score": 1.0, + "content": "cvxpy [26]. This works by reducing all convex optimization problems to a conic program and using", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 88, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 88, + 151, + 99, + 161 + ], + "score": 1.0, + "content": "46", + "type": "text" + }, + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "score": 1.0, + "content": "conic programming’s optimality conditions to derive an implicit differentiation formula. While this", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 88, + 160, + 504, + 173 + ], + "spans": [ + { + "bbox": [ + 88, + 162, + 99, + 172 + ], + "score": 1.0, + "content": "47", + "type": "text" + }, + { + "bbox": [ + 105, + 160, + 504, + 173 + ], + "score": 1.0, + "content": "approach is very generic, solving a convex optimization problem using a conic programming solver—", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 88, + 170, + 506, + 184 + ], + "spans": [ + { + "bbox": [ + 88, + 173, + 99, + 182 + ], + "score": 1.0, + "content": "48", + "type": "text" + }, + { + "bbox": [ + 105, + 170, + 506, + 184 + ], + "score": 1.0, + "content": "an ADMM-based splitting conic solver [54] in the case of cvxpy—is rarely the state-of-the-art", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 88, + 181, + 294, + 195 + ], + "spans": [ + { + "bbox": [ + 88, + 184, + 99, + 193 + ], + "score": 1.0, + "content": "49", + "type": "text" + }, + { + "bbox": [ + 105, + 181, + 294, + 195 + ], + "score": 1.0, + "content": "approach for each particular problem instance.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 90, + 198, + 505, + 275 + ], + "lines": [ + { + "bbox": [ + 90, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 90, + 200, + 99, + 209 + ], + "score": 1.0, + "content": "50", + "type": "text" + }, + { + "bbox": [ + 104, + 197, + 506, + 211 + ], + "score": 1.0, + "content": "In this work, we adopt a different strategy, which allows to easily add implicit differentiation on top", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 89, + 209, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 89, + 211, + 99, + 221 + ], + "score": 1.0, + "content": "51", + "type": "text" + }, + { + "bbox": [ + 105, + 209, + 505, + 221 + ], + "score": 1.0, + "content": "of existing solvers. In our approach, the user defines (in Python in the case of our implementation)", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 89, + 220, + 506, + 232 + ], + "spans": [ + { + "bbox": [ + 89, + 222, + 100, + 232 + ], + "score": 1.0, + "content": "52", + "type": "text" + }, + { + "bbox": [ + 104, + 220, + 188, + 232 + ], + "score": 1.0, + "content": "a mapping function", + "type": "text" + }, + { + "bbox": [ + 188, + 221, + 197, + 230 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 220, + 506, + 232 + ], + "score": 1.0, + "content": "capturing the optimality conditions of the problem solved by the algorithm.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 89, + 231, + 506, + 244 + ], + "spans": [ + { + "bbox": [ + 89, + 233, + 100, + 242 + ], + "score": 1.0, + "content": "53", + "type": "text" + }, + { + "bbox": [ + 105, + 231, + 279, + 244 + ], + "score": 1.0, + "content": "Once this is done, we leverage autodiff of", + "type": "text" + }, + { + "bbox": [ + 280, + 231, + 289, + 241 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 231, + 506, + 244 + ], + "score": 1.0, + "content": "combined with implicit differentiation techniques to", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 89, + 240, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 89, + 244, + 100, + 253 + ], + "score": 1.0, + "content": "54", + "type": "text" + }, + { + "bbox": [ + 105, + 240, + 506, + 255 + ], + "score": 1.0, + "content": "automatically differentiate the optimization problem solution. In this way, our approach is very", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 89, + 252, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 89, + 255, + 100, + 264 + ], + "score": 1.0, + "content": "55", + "type": "text" + }, + { + "bbox": [ + 105, + 252, + 506, + 266 + ], + "score": 1.0, + "content": "generic and still the efficiency of state-of-the-art solvers. It therefore combines the benefits of implicit", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 89, + 263, + 432, + 276 + ], + "spans": [ + { + "bbox": [ + 89, + 266, + 100, + 275 + ], + "score": 1.0, + "content": "56", + "type": "text" + }, + { + "bbox": [ + 105, + 263, + 432, + 276 + ], + "score": 1.0, + "content": "differentiation and autodiff. To summarize, we make the following contributions.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 100, + 280, + 506, + 417 + ], + "lines": [ + { + "bbox": [ + 107, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 107, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "• We delineate extremely general principles for implicitly differentiating through an optimization", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 291, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 115, + 291, + 505, + 303 + ], + "score": 1.0, + "content": "problem solution. Our approach can be seen as “hybrid”, in the sense that it combines implicit", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 301, + 344, + 314 + ], + "spans": [ + { + "bbox": [ + 115, + 301, + 344, + 314 + ], + "score": 1.0, + "content": "differentiation with autodiff of the optimality conditions.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 316, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 505, + 330 + ], + "score": 1.0, + "content": "• We show how to instantiate our framework in order to recover many recently-proposed implicit", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 327, + 506, + 341 + ], + "spans": [ + { + "bbox": [ + 115, + 327, + 506, + 341 + ], + "score": 1.0, + "content": "differentiation schemes, thereby providing a unifying perspective. We also obtain new implicit", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 338, + 438, + 351 + ], + "spans": [ + { + "bbox": [ + 115, + 338, + 438, + 351 + ], + "score": 1.0, + "content": "differentiation schemes, such as the one based on the mirror descent fixed point.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 107, + 353, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 107, + 353, + 505, + 366 + ], + "score": 1.0, + "content": "• On the theoretical side, we provide new bounds on the Jacobian error when the optimization", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 364, + 271, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 364, + 271, + 378 + ], + "score": 1.0, + "content": "problem is only solved approximately.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 378, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 505, + 392 + ], + "score": 1.0, + "content": "• We describe a JAX implementation and provide a blueprint for implementing our approach in", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 390, + 502, + 403 + ], + "spans": [ + { + "bbox": [ + 115, + 390, + 502, + 403 + ], + "score": 1.0, + "content": "other frameworks. We will open-source a full-fledged library for implicit differentiation in JAX.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 404, + 477, + 417 + ], + "spans": [ + { + "bbox": [ + 107, + 404, + 477, + 417 + ], + "score": 1.0, + "content": "• We implement four illustrative applications, demonstrating our framework’s ease of use.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 90, + 421, + 505, + 455 + ], + "lines": [ + { + "bbox": [ + 90, + 421, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 90, + 424, + 100, + 432 + ], + "score": 1.0, + "content": "68", + "type": "text" + }, + { + "bbox": [ + 104, + 421, + 506, + 434 + ], + "score": 1.0, + "content": "In essence, our implementation significantly extends JAX’s default autodiff system in context of the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 90, + 432, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 90, + 436, + 99, + 443 + ], + "score": 1.0, + "content": "69", + "type": "text" + }, + { + "bbox": [ + 105, + 432, + 506, + 446 + ], + "score": 1.0, + "content": "numerical optimization domain. From an end user’s perspective, autodiff with JAX simply becomes", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 90, + 443, + 455, + 456 + ], + "spans": [ + { + "bbox": [ + 90, + 446, + 100, + 455 + ], + "score": 1.0, + "content": "70", + "type": "text" + }, + { + "bbox": [ + 104, + 443, + 455, + 456 + ], + "score": 1.0, + "content": "more efficient if they use solvers with implicit differentiation set up by our framework.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 90, + 469, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 89, + 468, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 89, + 471, + 99, + 480 + ], + "score": 1.0, + "content": "71", + "type": "text" + }, + { + "bbox": [ + 104, + 468, + 317, + 483 + ], + "score": 1.0, + "content": "Notation. We denote the gradient and Hessian of", + "type": "text" + }, + { + "bbox": [ + 317, + 469, + 366, + 481 + ], + "score": 0.92, + "content": "f \\colon { \\mathbb { R } ^ { d } } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 468, + 419, + 483 + ], + "score": 1.0, + "content": "evaluated at", + "type": "text" + }, + { + "bbox": [ + 419, + 469, + 451, + 480 + ], + "score": 0.93, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 468, + 465, + 483 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 465, + 469, + 505, + 482 + ], + "score": 0.89, + "content": "\\nabla f ( x ) \\in", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 89, + 478, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 89, + 482, + 100, + 493 + ], + "score": 1.0, + "content": "72", + "type": "text" + }, + { + "bbox": [ + 106, + 481, + 120, + 492 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 478, + 141, + 495 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 141, + 481, + 213, + 494 + ], + "score": 0.92, + "content": "\\nabla ^ { 2 } f ( x ) \\ \\in \\ \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 478, + 338, + 495 + ], + "score": 1.0, + "content": ". We denote the Jacobian of", + "type": "text" + }, + { + "bbox": [ + 338, + 481, + 398, + 492 + ], + "score": 0.91, + "content": "F \\colon \\mathbb { R } ^ { d } \\ \\ \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 478, + 454, + 495 + ], + "score": 1.0, + "content": "evaluated at", + "type": "text" + }, + { + "bbox": [ + 454, + 482, + 490, + 492 + ], + "score": 0.93, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 478, + 506, + 495 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 89, + 491, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 89, + 495, + 100, + 505 + ], + "score": 1.0, + "content": "73", + "type": "text" + }, + { + "bbox": [ + 107, + 493, + 169, + 505 + ], + "score": 0.89, + "content": "\\partial F ( x ) \\in \\mathbb { R } ^ { p \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 491, + 199, + 507 + ], + "score": 1.0, + "content": ". When", + "type": "text" + }, + { + "bbox": [ + 199, + 494, + 207, + 505 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 491, + 218, + 507 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 218, + 494, + 227, + 504 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 491, + 506, + 507 + ], + "score": 1.0, + "content": "have several arguments, we denote the gradient, Hessian and Jacobian", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 89, + 503, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 89, + 506, + 100, + 516 + ], + "score": 1.0, + "content": "74", + "type": "text" + }, + { + "bbox": [ + 104, + 503, + 133, + 518 + ], + "score": 1.0, + "content": "in the", + "type": "text" + }, + { + "bbox": [ + 133, + 505, + 144, + 515 + ], + "score": 0.86, + "content": "i ^ { \\mathrm { { t h } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 503, + 200, + 518 + ], + "score": 1.0, + "content": "argument by", + "type": "text" + }, + { + "bbox": [ + 200, + 505, + 213, + 516 + ], + "score": 0.81, + "content": "\\nabla _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 503, + 217, + 518 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 218, + 504, + 231, + 516 + ], + "score": 0.86, + "content": "\\nabla _ { i } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 503, + 251, + 518 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 251, + 505, + 261, + 516 + ], + "score": 0.86, + "content": "\\partial _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 503, + 506, + 518 + ], + "score": 1.0, + "content": ", respectively. The standard probability simplex is denoted", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 89, + 514, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 89, + 518, + 101, + 529 + ], + "score": 1.0, + "content": "75", + "type": "text" + }, + { + "bbox": [ + 104, + 514, + 120, + 530 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 120, + 516, + 280, + 528 + ], + "score": 0.9, + "content": "\\triangle ^ { d } : = \\{ x \\in \\mathbb { R } ^ { d } \\colon \\| x \\| _ { 1 } = 1 , x \\geq 0 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 514, + 338, + 530 + ], + "score": 1.0, + "content": ". For any set", + "type": "text" + }, + { + "bbox": [ + 338, + 516, + 374, + 527 + ], + "score": 0.91, + "content": "\\mathcal { C } \\subset \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 514, + 439, + 530 + ], + "score": 1.0, + "content": ", we denote by", + "type": "text" + }, + { + "bbox": [ + 439, + 517, + 450, + 528 + ], + "score": 0.86, + "content": "I _ { \\mathcal { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 514, + 506, + 530 + ], + "score": 1.0, + "content": "the function", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 89, + 526, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 89, + 531, + 100, + 540 + ], + "score": 1.0, + "content": "76", + "type": "text" + }, + { + "bbox": [ + 107, + 528, + 181, + 540 + ], + "score": 0.89, + "content": "\\mathbb { R } ^ { d } \\to \\mathbb { R } \\cup \\{ + \\infty \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 526, + 209, + 542 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 209, + 529, + 252, + 540 + ], + "score": 0.91, + "content": "I _ { \\mathit { C } } ( x ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 526, + 261, + 542 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 261, + 529, + 286, + 539 + ], + "score": 0.82, + "content": "x \\in { \\mathcal { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 526, + 289, + 542 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 290, + 528, + 345, + 540 + ], + "score": 0.88, + "content": "I _ { C } ( x ) = + \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 526, + 479, + 542 + ], + "score": 1.0, + "content": "otherwise. For a vector or matrix", + "type": "text" + }, + { + "bbox": [ + 479, + 529, + 487, + 538 + ], + "score": 0.78, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 526, + 506, + 542 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 89, + 538, + 410, + 552 + ], + "spans": [ + { + "bbox": [ + 89, + 541, + 100, + 551 + ], + "score": 1.0, + "content": "77", + "type": "text" + }, + { + "bbox": [ + 104, + 538, + 126, + 552 + ], + "score": 1.0, + "content": "note", + "type": "text" + }, + { + "bbox": [ + 127, + 540, + 145, + 551 + ], + "score": 0.89, + "content": "\\| A \\|", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 538, + 306, + 552 + ], + "score": 1.0, + "content": "the Frobenius (or Euclidean) norm, and", + "type": "text" + }, + { + "bbox": [ + 306, + 540, + 333, + 552 + ], + "score": 0.91, + "content": "\\| A \\| _ { \\mathrm { o } p }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 538, + 410, + 552 + ], + "score": 1.0, + "content": "the operator norm.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35 + }, + { + "type": "title", + "bbox": [ + 98, + 569, + 480, + 583 + ], + "lines": [ + { + "bbox": [ + 104, + 568, + 482, + 587 + ], + "spans": [ + { + "bbox": [ + 104, + 568, + 482, + 587 + ], + "score": 1.0, + "content": "2 Proposed framework: combining implicit differentiation and autodiff", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "title", + "bbox": [ + 101, + 596, + 209, + 608 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 210, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 210, + 611 + ], + "score": 1.0, + "content": "2.1 General principles", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 105, + 618, + 505, + 673 + ], + "lines": [ + { + "bbox": [ + 106, + 617, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 505, + 629 + ], + "score": 1.0, + "content": "Overview. Contrary to unrolling of algorithm iterations, implicit differentiation typically involves", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 629, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 629, + 505, + 640 + ], + "score": 1.0, + "content": "a manual, sometimes complicated, mathematical derivation. For instance, numerous works [19, 35,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "score": 1.0, + "content": "6, 53, 52] use Karush–Kuhn–Tucker (KKT) conditions in order to relate a constrained optimization", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 650, + 505, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 505, + 663 + ], + "score": 1.0, + "content": "problem’s solution to its inputs, and to manually derive a formula for its derivatives. The derivation", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 662, + 290, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 290, + 675 + ], + "score": 1.0, + "content": "and implementation is typically case-by-case.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 91, + 678, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 89, + 677, + 507, + 691 + ], + "spans": [ + { + "bbox": [ + 89, + 680, + 100, + 690 + ], + "score": 1.0, + "content": "85", + "type": "text" + }, + { + "bbox": [ + 105, + 677, + 507, + 691 + ], + "score": 1.0, + "content": "In this work, we propose a general way to easily add implicit differentiation on top of existing solvers.", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 89, + 689, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 89, + 691, + 100, + 700 + ], + "score": 1.0, + "content": "86", + "type": "text" + }, + { + "bbox": [ + 106, + 689, + 505, + 702 + ], + "score": 1.0, + "content": "In our approach, the user defines (in Python in the case of our implementation) a mapping function", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 89, + 699, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 89, + 702, + 100, + 712 + ], + "score": 1.0, + "content": "87", + "type": "text" + }, + { + "bbox": [ + 106, + 700, + 116, + 710 + ], + "score": 0.74, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 699, + 505, + 713 + ], + "score": 1.0, + "content": "capturing the optimality conditions of the problem solved by the algorithm. We provide reusable", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 89, + 711, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 89, + 713, + 100, + 722 + ], + "score": 1.0, + "content": "88", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 256, + 723 + ], + "score": 1.0, + "content": "building blocks to easily express such", + "type": "text" + }, + { + "bbox": [ + 257, + 713, + 265, + 720 + ], + "score": 0.88, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 711, + 434, + 723 + ], + "score": 1.0, + "content": ". Once this is done, we leverage autodiff of", + "type": "text" + }, + { + "bbox": [ + 434, + 711, + 443, + 721 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 711, + 505, + 723 + ], + "score": 1.0, + "content": "combined with", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 47.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": "index", + "bbox": [ + 89, + 72, + 505, + 193 + ], + "lines": [], + "index": 5, + "bbox_fs": [ + 88, + 72, + 506, + 195 + ], + "lines_deleted": true + }, + { + "type": "index", + "bbox": [ + 90, + 198, + 505, + 275 + ], + "lines": [], + "index": 14, + "bbox_fs": [ + 89, + 197, + 506, + 276 + ], + "lines_deleted": true + }, + { + "type": "list", + "bbox": [ + 100, + 280, + 506, + 417 + ], + "lines": [ + { + "bbox": [ + 107, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 107, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "• We delineate extremely general principles for implicitly differentiating through an optimization", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 291, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 115, + 291, + 505, + 303 + ], + "score": 1.0, + "content": "problem solution. Our approach can be seen as “hybrid”, in the sense that it combines implicit", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 301, + 344, + 314 + ], + "spans": [ + { + "bbox": [ + 115, + 301, + 344, + 314 + ], + "score": 1.0, + "content": "differentiation with autodiff of the optimality conditions.", + "type": "text" + } + ], + "index": 20, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 316, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 505, + 330 + ], + "score": 1.0, + "content": "• We show how to instantiate our framework in order to recover many recently-proposed implicit", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 327, + 506, + 341 + ], + "spans": [ + { + "bbox": [ + 115, + 327, + 506, + 341 + ], + "score": 1.0, + "content": "differentiation schemes, thereby providing a unifying perspective. We also obtain new implicit", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 338, + 438, + 351 + ], + "spans": [ + { + "bbox": [ + 115, + 338, + 438, + 351 + ], + "score": 1.0, + "content": "differentiation schemes, such as the one based on the mirror descent fixed point.", + "type": "text" + } + ], + "index": 23, + "is_list_end_line": true + }, + { + "bbox": [ + 107, + 353, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 107, + 353, + 505, + 366 + ], + "score": 1.0, + "content": "• On the theoretical side, we provide new bounds on the Jacobian error when the optimization", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 364, + 271, + 378 + ], + "spans": [ + { + "bbox": [ + 115, + 364, + 271, + 378 + ], + "score": 1.0, + "content": "problem is only solved approximately.", + "type": "text" + } + ], + "index": 25, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 378, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 378, + 505, + 392 + ], + "score": 1.0, + "content": "• We describe a JAX implementation and provide a blueprint for implementing our approach in", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 390, + 502, + 403 + ], + "spans": [ + { + "bbox": [ + 115, + 390, + 502, + 403 + ], + "score": 1.0, + "content": "other frameworks. We will open-source a full-fledged library for implicit differentiation in JAX.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 404, + 477, + 417 + ], + "spans": [ + { + "bbox": [ + 107, + 404, + 477, + 417 + ], + "score": 1.0, + "content": "• We implement four illustrative applications, demonstrating our framework’s ease of use.", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 23, + "bbox_fs": [ + 106, + 280, + 506, + 417 + ] + }, + { + "type": "index", + "bbox": [ + 90, + 421, + 505, + 455 + ], + "lines": [ + { + "bbox": [ + 90, + 421, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 90, + 424, + 100, + 432 + ], + "score": 1.0, + "content": "68", + "type": "text" + }, + { + "bbox": [ + 104, + 421, + 506, + 434 + ], + "score": 1.0, + "content": "In essence, our implementation significantly extends JAX’s default autodiff system in context of the", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 90, + 432, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 90, + 436, + 99, + 443 + ], + "score": 1.0, + "content": "69", + "type": "text" + }, + { + "bbox": [ + 105, + 432, + 506, + 446 + ], + "score": 1.0, + "content": "numerical optimization domain. From an end user’s perspective, autodiff with JAX simply becomes", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 90, + 443, + 455, + 456 + ], + "spans": [ + { + "bbox": [ + 90, + 446, + 100, + 455 + ], + "score": 1.0, + "content": "70", + "type": "text" + }, + { + "bbox": [ + 104, + 443, + 455, + 456 + ], + "score": 1.0, + "content": "more efficient if they use solvers with implicit differentiation set up by our framework.", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 468, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 89, + 471, + 99, + 480 + ], + "score": 1.0, + "content": "71", + "type": "text" + }, + { + "bbox": [ + 104, + 468, + 317, + 483 + ], + "score": 1.0, + "content": "Notation. We denote the gradient and Hessian of", + "type": "text" + }, + { + "bbox": [ + 317, + 469, + 366, + 481 + ], + "score": 0.92, + "content": "f \\colon { \\mathbb { R } ^ { d } } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 468, + 419, + 483 + ], + "score": 1.0, + "content": "evaluated at", + "type": "text" + }, + { + "bbox": [ + 419, + 469, + 451, + 480 + ], + "score": 0.93, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 468, + 465, + 483 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 465, + 469, + 505, + 482 + ], + "score": 0.89, + "content": "\\nabla f ( x ) \\in", + "type": "inline_equation" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 478, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 89, + 482, + 100, + 493 + ], + "score": 1.0, + "content": "72", + "type": "text" + }, + { + "bbox": [ + 106, + 481, + 120, + 492 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 478, + 141, + 495 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 141, + 481, + 213, + 494 + ], + "score": 0.92, + "content": "\\nabla ^ { 2 } f ( x ) \\ \\in \\ \\mathbb { R } ^ { d \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 478, + 338, + 495 + ], + "score": 1.0, + "content": ". We denote the Jacobian of", + "type": "text" + }, + { + "bbox": [ + 338, + 481, + 398, + 492 + ], + "score": 0.91, + "content": "F \\colon \\mathbb { R } ^ { d } \\ \\ \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 478, + 454, + 495 + ], + "score": 1.0, + "content": "evaluated at", + "type": "text" + }, + { + "bbox": [ + 454, + 482, + 490, + 492 + ], + "score": 0.93, + "content": "x \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 478, + 506, + 495 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 491, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 89, + 495, + 100, + 505 + ], + "score": 1.0, + "content": "73", + "type": "text" + }, + { + "bbox": [ + 107, + 493, + 169, + 505 + ], + "score": 0.89, + "content": "\\partial F ( x ) \\in \\mathbb { R } ^ { p \\times d }", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 491, + 199, + 507 + ], + "score": 1.0, + "content": ". When", + "type": "text" + }, + { + "bbox": [ + 199, + 494, + 207, + 505 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 491, + 218, + 507 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 218, + 494, + 227, + 504 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 491, + 506, + 507 + ], + "score": 1.0, + "content": "have several arguments, we denote the gradient, Hessian and Jacobian", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 503, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 89, + 506, + 100, + 516 + ], + "score": 1.0, + "content": "74", + "type": "text" + }, + { + "bbox": [ + 104, + 503, + 133, + 518 + ], + "score": 1.0, + "content": "in the", + "type": "text" + }, + { + "bbox": [ + 133, + 505, + 144, + 515 + ], + "score": 0.86, + "content": "i ^ { \\mathrm { { t h } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 503, + 200, + 518 + ], + "score": 1.0, + "content": "argument by", + "type": "text" + }, + { + "bbox": [ + 200, + 505, + 213, + 516 + ], + "score": 0.81, + "content": "\\nabla _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 503, + 217, + 518 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 218, + 504, + 231, + 516 + ], + "score": 0.86, + "content": "\\nabla _ { i } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 503, + 251, + 518 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 251, + 505, + 261, + 516 + ], + "score": 0.86, + "content": "\\partial _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 503, + 506, + 518 + ], + "score": 1.0, + "content": ", respectively. The standard probability simplex is denoted", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 514, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 89, + 518, + 101, + 529 + ], + "score": 1.0, + "content": "75", + "type": "text" + }, + { + "bbox": [ + 104, + 514, + 120, + 530 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 120, + 516, + 280, + 528 + ], + "score": 0.9, + "content": "\\triangle ^ { d } : = \\{ x \\in \\mathbb { R } ^ { d } \\colon \\| x \\| _ { 1 } = 1 , x \\geq 0 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 514, + 338, + 530 + ], + "score": 1.0, + "content": ". For any set", + "type": "text" + }, + { + "bbox": [ + 338, + 516, + 374, + 527 + ], + "score": 0.91, + "content": "\\mathcal { C } \\subset \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 514, + 439, + 530 + ], + "score": 1.0, + "content": ", we denote by", + "type": "text" + }, + { + "bbox": [ + 439, + 517, + 450, + 528 + ], + "score": 0.86, + "content": "I _ { \\mathcal { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 514, + 506, + 530 + ], + "score": 1.0, + "content": "the function", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 526, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 89, + 531, + 100, + 540 + ], + "score": 1.0, + "content": "76", + "type": "text" + }, + { + "bbox": [ + 107, + 528, + 181, + 540 + ], + "score": 0.89, + "content": "\\mathbb { R } ^ { d } \\to \\mathbb { R } \\cup \\{ + \\infty \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 526, + 209, + 542 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 209, + 529, + 252, + 540 + ], + "score": 0.91, + "content": "I _ { \\mathit { C } } ( x ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 526, + 261, + 542 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 261, + 529, + 286, + 539 + ], + "score": 0.82, + "content": "x \\in { \\mathcal { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 526, + 289, + 542 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 290, + 528, + 345, + 540 + ], + "score": 0.88, + "content": "I _ { C } ( x ) = + \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 526, + 479, + 542 + ], + "score": 1.0, + "content": "otherwise. For a vector or matrix", + "type": "text" + }, + { + "bbox": [ + 479, + 529, + 487, + 538 + ], + "score": 0.78, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 526, + 506, + 542 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 538, + 410, + 552 + ], + "spans": [ + { + "bbox": [ + 89, + 541, + 100, + 551 + ], + "score": 1.0, + "content": "77", + "type": "text" + }, + { + "bbox": [ + 104, + 538, + 126, + 552 + ], + "score": 1.0, + "content": "note", + "type": "text" + }, + { + "bbox": [ + 127, + 540, + 145, + 551 + ], + "score": 0.89, + "content": "\\| A \\|", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 538, + 306, + 552 + ], + "score": 1.0, + "content": "the Frobenius (or Euclidean) norm, and", + "type": "text" + }, + { + "bbox": [ + 306, + 540, + 333, + 552 + ], + "score": 0.91, + "content": "\\| A \\| _ { \\mathrm { o } p }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 538, + 410, + 552 + ], + "score": 1.0, + "content": "the operator norm.", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + } + ], + "index": 30, + "bbox_fs": [ + 90, + 421, + 506, + 456 + ] + }, + { + "type": "index", + "bbox": [ + 90, + 469, + 505, + 552 + ], + "lines": [], + "index": 35, + "bbox_fs": [ + 89, + 468, + 506, + 552 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 98, + 569, + 480, + 583 + ], + "lines": [ + { + "bbox": [ + 104, + 568, + 482, + 587 + ], + "spans": [ + { + "bbox": [ + 104, + 568, + 482, + 587 + ], + "score": 1.0, + "content": "2 Proposed framework: combining implicit differentiation and autodiff", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "title", + "bbox": [ + 101, + 596, + 209, + 608 + ], + "lines": [ + { + "bbox": [ + 105, + 595, + 210, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 210, + 611 + ], + "score": 1.0, + "content": "2.1 General principles", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 105, + 618, + 505, + 673 + ], + "lines": [ + { + "bbox": [ + 106, + 617, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 505, + 629 + ], + "score": 1.0, + "content": "Overview. Contrary to unrolling of algorithm iterations, implicit differentiation typically involves", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 629, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 629, + 505, + 640 + ], + "score": 1.0, + "content": "a manual, sometimes complicated, mathematical derivation. For instance, numerous works [19, 35,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 652 + ], + "score": 1.0, + "content": "6, 53, 52] use Karush–Kuhn–Tucker (KKT) conditions in order to relate a constrained optimization", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 650, + 505, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 505, + 663 + ], + "score": 1.0, + "content": "problem’s solution to its inputs, and to manually derive a formula for its derivatives. The derivation", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 662, + 290, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 290, + 675 + ], + "score": 1.0, + "content": "and implementation is typically case-by-case.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 617, + 505, + 675 + ] + }, + { + "type": "index", + "bbox": [ + 91, + 678, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 89, + 677, + 507, + 691 + ], + "spans": [ + { + "bbox": [ + 89, + 680, + 100, + 690 + ], + "score": 1.0, + "content": "85", + "type": "text" + }, + { + "bbox": [ + 105, + 677, + 507, + 691 + ], + "score": 1.0, + "content": "In this work, we propose a general way to easily add implicit differentiation on top of existing solvers.", + "type": "text" + } + ], + "index": 46, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 689, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 89, + 691, + 100, + 700 + ], + "score": 1.0, + "content": "86", + "type": "text" + }, + { + "bbox": [ + 106, + 689, + 505, + 702 + ], + "score": 1.0, + "content": "In our approach, the user defines (in Python in the case of our implementation) a mapping function", + "type": "text" + } + ], + "index": 47, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 699, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 89, + 702, + 100, + 712 + ], + "score": 1.0, + "content": "87", + "type": "text" + }, + { + "bbox": [ + 106, + 700, + 116, + 710 + ], + "score": 0.74, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 699, + 505, + 713 + ], + "score": 1.0, + "content": "capturing the optimality conditions of the problem solved by the algorithm. We provide reusable", + "type": "text" + } + ], + "index": 48, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 711, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 89, + 713, + 100, + 722 + ], + "score": 1.0, + "content": "88", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 256, + 723 + ], + "score": 1.0, + "content": "building blocks to easily express such", + "type": "text" + }, + { + "bbox": [ + 257, + 713, + 265, + 720 + ], + "score": 0.88, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 711, + 434, + 723 + ], + "score": 1.0, + "content": ". Once this is done, we leverage autodiff of", + "type": "text" + }, + { + "bbox": [ + 434, + 711, + 443, + 721 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 711, + 505, + 723 + ], + "score": 1.0, + "content": "combined with", + "type": "text" + } + ], + "index": 49, + "is_list_start_line": true + }, + { + "bbox": [ + 90, + 309, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 90, + 313, + 99, + 321 + ], + "score": 1.0, + "content": "89", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 104, + 309, + 506, + 324 + ], + "score": 1.0, + "content": "implicit differentiation to automatically differentiate the optimization problem solution. A simple", + "type": "text", + "cross_page": true + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 90, + 321, + 270, + 334 + ], + "spans": [ + { + "bbox": [ + 90, + 324, + 100, + 333 + ], + "score": 1.0, + "content": "90", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 104, + 321, + 270, + 334 + ], + "score": 1.0, + "content": "illustrative example is given in Figure 1.", + "type": "text", + "cross_page": true + } + ], + "index": 8, + "is_list_start_line": true + } + ], + "index": 47.5, + "bbox_fs": [ + 89, + 677, + 507, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 153, + 71, + 458, + 237 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 153, + 71, + 458, + 237 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 153, + 71, + 458, + 237 + ], + "spans": [ + { + "bbox": [ + 153, + 71, + 458, + 237 + ], + "score": 0.966, + "type": "image", + "image_path": "54ed46780257aac9d2be9edbb82db1f5cfb576d08726ad6f832a85f9ef6a61f7.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 153, + 71, + 458, + 126.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 153, + 126.33333333333334, + 458, + 181.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 153, + 181.66666666666669, + 458, + 237.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 244, + 505, + 289 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "Figure 1: Example: adding implicit differentiation on top of a ridge regression solver. The function", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 107, + 255, + 136, + 267 + ], + "score": 0.92, + "content": "f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 255, + 333, + 268 + ], + "score": 1.0, + "content": "defines the objective function and the mapping", + "type": "text" + }, + { + "bbox": [ + 334, + 256, + 343, + 266 + ], + "score": 0.8, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 255, + 505, + 268 + ], + "score": 1.0, + "content": ", here simply equation (4), captures the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 266, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 506, + 278 + ], + "score": 1.0, + "content": "optimality conditions. The decorator @custom_root (provided by our library) automatically adds", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 277, + 486, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 453, + 289 + ], + "score": 1.0, + "content": "implicit differentiation to the solver for the user. The last line evaluates the Jacobian at", + "type": "text" + }, + { + "bbox": [ + 454, + 277, + 483, + 287 + ], + "score": 0.9, + "content": "\\theta = 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 277, + 486, + 289 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 92, + 309, + 505, + 334 + ], + "lines": [ + { + "bbox": [ + 90, + 309, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 90, + 313, + 99, + 321 + ], + "score": 1.0, + "content": "89", + "type": "text" + }, + { + "bbox": [ + 104, + 309, + 506, + 324 + ], + "score": 1.0, + "content": "implicit differentiation to automatically differentiate the optimization problem solution. A simple", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 90, + 321, + 270, + 334 + ], + "spans": [ + { + "bbox": [ + 90, + 324, + 100, + 333 + ], + "score": 1.0, + "content": "90", + "type": "text" + }, + { + "bbox": [ + 104, + 321, + 270, + 334 + ], + "score": 1.0, + "content": "illustrative example is given in Figure 1.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 90, + 343, + 506, + 367 + ], + "lines": [ + { + "bbox": [ + 89, + 342, + 507, + 358 + ], + "spans": [ + { + "bbox": [ + 89, + 347, + 100, + 356 + ], + "score": 1.0, + "content": "91", + "type": "text" + }, + { + "bbox": [ + 102, + 342, + 226, + 358 + ], + "score": 1.0, + "content": "Differentiating a root. Let", + "type": "text" + }, + { + "bbox": [ + 226, + 344, + 308, + 355 + ], + "score": 0.91, + "content": "F \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 342, + 507, + 358 + ], + "score": 1.0, + "content": "be a user-provided mapping, capturing the opti-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 87, + 355, + 474, + 368 + ], + "spans": [ + { + "bbox": [ + 87, + 355, + 353, + 368 + ], + "score": 1.0, + "content": "mality conditions of a problem. An optimal solution, denoted 92", + "type": "text" + }, + { + "bbox": [ + 354, + 356, + 378, + 368 + ], + "score": 0.94, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 355, + 460, + 368 + ], + "score": 1.0, + "content": ", should be a root of", + "type": "text" + }, + { + "bbox": [ + 461, + 356, + 469, + 366 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 355, + 474, + 368 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "interline_equation", + "bbox": [ + 268, + 372, + 342, + 387 + ], + "lines": [ + { + "bbox": [ + 268, + 372, + 342, + 387 + ], + "spans": [ + { + "bbox": [ + 268, + 372, + 342, + 387 + ], + "score": 0.92, + "content": "F ( x ^ { \\star } ( \\theta ) , \\theta ) = 0 .", + "type": "interline_equation", + "image_path": "c0d1311ab5a42c8b5ec24287733a86c3510f65a5d67dfc6b9ad73d6b4061cb22.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 268, + 372, + 342, + 387 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 89, + 392, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 88, + 392, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 88, + 395, + 100, + 405 + ], + "score": 1.0, + "content": "93", + "type": "text" + }, + { + "bbox": [ + 105, + 392, + 157, + 406 + ], + "score": 1.0, + "content": "We can see", + "type": "text" + }, + { + "bbox": [ + 157, + 393, + 181, + 405 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 392, + 335, + 406 + ], + "score": 1.0, + "content": "as an implicitly defined function of", + "type": "text" + }, + { + "bbox": [ + 335, + 393, + 370, + 403 + ], + "score": 0.91, + "content": "\\theta \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 392, + 394, + 406 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 395, + 392, + 458, + 403 + ], + "score": 0.91, + "content": "x ^ { \\star } \\colon { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 392, + 505, + 406 + ], + "score": 1.0, + "content": ". Our goal", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 88, + 402, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 88, + 406, + 100, + 415 + ], + "score": 1.0, + "content": "94", + "type": "text" + }, + { + "bbox": [ + 104, + 402, + 180, + 417 + ], + "score": 1.0, + "content": "is to differentiate", + "type": "text" + }, + { + "bbox": [ + 181, + 404, + 204, + 416 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 402, + 230, + 417 + ], + "score": 1.0, + "content": "w.r.t.", + "type": "text" + }, + { + "bbox": [ + 230, + 405, + 236, + 414 + ], + "score": 0.74, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 402, + 429, + 417 + ], + "score": 1.0, + "content": ". From the implicit function theorem [44], if", + "type": "text" + }, + { + "bbox": [ + 429, + 405, + 438, + 414 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 402, + 505, + 417 + ], + "score": 1.0, + "content": "is continuously", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 88, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 88, + 416, + 100, + 426 + ], + "score": 1.0, + "content": "95", + "type": "text" + }, + { + "bbox": [ + 105, + 414, + 229, + 428 + ], + "score": 1.0, + "content": "differentiable and the Jacobian", + "type": "text" + }, + { + "bbox": [ + 230, + 415, + 248, + 426 + ], + "score": 0.9, + "content": "\\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 414, + 299, + 428 + ], + "score": 1.0, + "content": "evaluated at", + "type": "text" + }, + { + "bbox": [ + 299, + 415, + 340, + 427 + ], + "score": 0.94, + "content": "x ^ { \\star } ( \\theta ) \\times \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 414, + 475, + 428 + ], + "score": 1.0, + "content": "is a square invertible matrix, then", + "type": "text" + }, + { + "bbox": [ + 475, + 415, + 505, + 427 + ], + "score": 0.91, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 88, + 426, + 393, + 438 + ], + "spans": [ + { + "bbox": [ + 88, + 428, + 100, + 437 + ], + "score": 1.0, + "content": "96", + "type": "text" + }, + { + "bbox": [ + 105, + 426, + 328, + 438 + ], + "score": 1.0, + "content": "exists. Using the chain rule, we know that the Jacobian", + "type": "text" + }, + { + "bbox": [ + 328, + 426, + 358, + 438 + ], + "score": 0.93, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 426, + 393, + 438 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "interline_equation", + "bbox": [ + 216, + 443, + 395, + 457 + ], + "lines": [ + { + "bbox": [ + 216, + 443, + 395, + 457 + ], + "spans": [ + { + "bbox": [ + 216, + 443, + 395, + 457 + ], + "score": 0.9, + "content": "\\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) \\partial x ^ { \\star } ( \\theta ) + \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = 0 .", + "type": "interline_equation", + "image_path": "274800a6c9b20e4e783661d1373fddeac8575eeb8a60627b067af1c171e4265b.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 216, + 443, + 395, + 457 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 90, + 462, + 430, + 474 + ], + "lines": [ + { + "bbox": [ + 87, + 461, + 432, + 476 + ], + "spans": [ + { + "bbox": [ + 87, + 461, + 154, + 476 + ], + "score": 1.0, + "content": "Computing 97", + "type": "text" + }, + { + "bbox": [ + 154, + 462, + 183, + 474 + ], + "score": 0.92, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 461, + 432, + 476 + ], + "score": 1.0, + "content": "boils down to the resolution of the linear system of equations", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 479, + 392, + 508 + ], + "lines": [ + { + "bbox": [ + 219, + 479, + 392, + 508 + ], + "spans": [ + { + "bbox": [ + 219, + 479, + 392, + 508 + ], + "score": 0.93, + "content": "\\underbrace { - \\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) } _ { A \\in \\mathbb { R } ^ { d \\times d } } \\underbrace { \\partial x ^ { \\star } ( \\theta ) } _ { J \\in \\mathbb { R } ^ { d \\times n } } = \\underbrace { \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) } _ { B \\in \\mathbb { R } ^ { d \\times n } }", + "type": "interline_equation", + "image_path": "61fc8e13f9e3f720696ee7ba4a802b9749c90618cf011fd1d2798863de6d8ed0.jpg" + } + ] + } + ], + "index": 18.5, + "virtual_lines": [ + { + "bbox": [ + 219, + 479, + 392, + 493.5 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 219, + 493.5, + 392, + 508.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 88, + 513, + 507, + 536 + ], + "lines": [ + { + "bbox": [ + 89, + 512, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 89, + 516, + 100, + 525 + ], + "score": 1.0, + "content": "98", + "type": "text" + }, + { + "bbox": [ + 105, + 512, + 320, + 526 + ], + "score": 1.0, + "content": "When (1) is a one-dimensional root finding problem", + "type": "text" + }, + { + "bbox": [ + 321, + 514, + 346, + 524 + ], + "score": 0.86, + "content": "\\dot { d } = 1 \\dot { }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 512, + 505, + 526 + ], + "score": 1.0, + "content": "), (2) becomes particularly simple since", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 89, + 523, + 288, + 537 + ], + "spans": [ + { + "bbox": [ + 89, + 526, + 100, + 536 + ], + "score": 1.0, + "content": "99", + "type": "text" + }, + { + "bbox": [ + 107, + 524, + 178, + 537 + ], + "score": 0.91, + "content": "\\nabla x ^ { \\star } ( \\theta ) = B ^ { \\top } / A", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 523, + 209, + 536 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 210, + 525, + 218, + 534 + ], + "score": 0.84, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 523, + 288, + 536 + ], + "score": 1.0, + "content": "is a scalar value.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 87, + 540, + 505, + 596 + ], + "lines": [ + { + "bbox": [ + 86, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 86, + 542, + 99, + 551 + ], + "score": 1.0, + "content": "100", + "type": "text" + }, + { + "bbox": [ + 106, + 540, + 506, + 552 + ], + "score": 1.0, + "content": "We will show that existing and new implicit differentiation methods all reduce to this simple principle.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 86, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 86, + 553, + 99, + 564 + ], + "score": 1.0, + "content": "101", + "type": "text" + }, + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "We call our approach hybrid, since it combines implicit differentiation (it involves the resolution of a", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 86, + 563, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 86, + 565, + 99, + 574 + ], + "score": 1.0, + "content": "102", + "type": "text" + }, + { + "bbox": [ + 106, + 563, + 343, + 575 + ], + "score": 1.0, + "content": "linear system) with the autodiff of the optimality conditions", + "type": "text" + }, + { + "bbox": [ + 344, + 563, + 353, + 572 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 563, + 505, + 575 + ], + "score": 1.0, + "content": ". Our approach is efficient as it can be", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 86, + 572, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 86, + 575, + 100, + 585 + ], + "score": 1.0, + "content": "103", + "type": "text" + }, + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "score": 1.0, + "content": "added on top of any state-of-the-art solver and modular as the optimality conditon specification is", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 86, + 585, + 329, + 596 + ], + "spans": [ + { + "bbox": [ + 86, + 587, + 99, + 596 + ], + "score": 1.0, + "content": "104", + "type": "text" + }, + { + "bbox": [ + 106, + 585, + 329, + 596 + ], + "score": 1.0, + "content": "decoupled from the implicit differentiation mechanism.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 95, + 607, + 504, + 630 + ], + "lines": [ + { + "bbox": [ + 91, + 608, + 504, + 621 + ], + "spans": [ + { + "bbox": [ + 91, + 608, + 430, + 621 + ], + "score": 1.0, + "content": "Differentiating a fixed point. We will encounter numerous applications where 05", + "type": "text" + }, + { + "bbox": [ + 430, + 608, + 454, + 620 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 608, + 504, + 621 + ], + "score": 1.0, + "content": "is implicitly", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 91, + 618, + 268, + 632 + ], + "spans": [ + { + "bbox": [ + 91, + 618, + 268, + 632 + ], + "score": 1.0, + "content": "06 defined through a fixed point iteration:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "interline_equation", + "bbox": [ + 260, + 635, + 350, + 650 + ], + "lines": [ + { + "bbox": [ + 260, + 635, + 350, + 650 + ], + "spans": [ + { + "bbox": [ + 260, + 635, + 350, + 650 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta ) = T ( x ^ { \\star } ( \\theta ) , \\theta ) ,", + "type": "interline_equation", + "image_path": "abe6cf0671c54522fc02fdb793687079a378aeb6f7fb62b05a2af4f58004d60a.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 260, + 635, + 350, + 650 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 655, + 408, + 668 + ], + "lines": [ + { + "bbox": [ + 84, + 653, + 410, + 669 + ], + "spans": [ + { + "bbox": [ + 84, + 653, + 133, + 669 + ], + "score": 1.0, + "content": "where 107", + "type": "text" + }, + { + "bbox": [ + 133, + 655, + 213, + 666 + ], + "score": 0.92, + "content": "T \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 653, + 410, + 669 + ], + "score": 1.0, + "content": ". This can be seen as a particular case of (1) with", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 673, + 381, + 687 + ], + "lines": [ + { + "bbox": [ + 230, + 673, + 381, + 687 + ], + "spans": [ + { + "bbox": [ + 230, + 673, + 381, + 687 + ], + "score": 0.92, + "content": "F ( x ^ { \\star } ( \\theta ) , \\theta ) = T ( x ^ { \\star } ( \\theta ) , \\theta ) - x ^ { \\star } ( \\theta ) .", + "type": "interline_equation", + "image_path": "84cac758b84ac842ae759995b0e5af13c1e749e95958fbe426ac33e2140ff621.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 230, + 673, + 381, + 687 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 87, + 692, + 274, + 704 + ], + "lines": [ + { + "bbox": [ + 86, + 692, + 274, + 705 + ], + "spans": [ + { + "bbox": [ + 86, + 692, + 274, + 705 + ], + "score": 1.0, + "content": "108 In this case, using the chain rule, we have", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 709, + 486, + 723 + ], + "lines": [ + { + "bbox": [ + 123, + 709, + 486, + 723 + ], + "spans": [ + { + "bbox": [ + 123, + 709, + 486, + 723 + ], + "score": 0.89, + "content": "A = - \\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = I - \\partial _ { 1 } T ( x ^ { \\star } ( \\theta ) , \\theta ) \\quad \\mathrm { a n d } \\quad B = \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = \\partial _ { 2 } T ( x ^ { \\star } ( \\theta ) , \\theta ) .", + "type": "interline_equation", + "image_path": "10fa8490ec27c72163d7dd399a16f9ec36f0ca85ee2d8bccb24156a8ca15b2f6.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 123, + 709, + 486, + 723 + ], + "spans": [], + "index": 33 + } + ] + } + ], + "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": "image", + "bbox": [ + 153, + 71, + 458, + 237 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 153, + 71, + 458, + 237 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 153, + 71, + 458, + 237 + ], + "spans": [ + { + "bbox": [ + 153, + 71, + 458, + 237 + ], + "score": 0.966, + "type": "image", + "image_path": "54ed46780257aac9d2be9edbb82db1f5cfb576d08726ad6f832a85f9ef6a61f7.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 153, + 71, + 458, + 126.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 153, + 126.33333333333334, + 458, + 181.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 153, + 181.66666666666669, + 458, + 237.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 244, + 505, + 289 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "Figure 1: Example: adding implicit differentiation on top of a ridge regression solver. The function", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 107, + 255, + 136, + 267 + ], + "score": 0.92, + "content": "f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 255, + 333, + 268 + ], + "score": 1.0, + "content": "defines the objective function and the mapping", + "type": "text" + }, + { + "bbox": [ + 334, + 256, + 343, + 266 + ], + "score": 0.8, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 255, + 505, + 268 + ], + "score": 1.0, + "content": ", here simply equation (4), captures the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 266, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 506, + 278 + ], + "score": 1.0, + "content": "optimality conditions. The decorator @custom_root (provided by our library) automatically adds", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 277, + 486, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 453, + 289 + ], + "score": 1.0, + "content": "implicit differentiation to the solver for the user. The last line evaluates the Jacobian at", + "type": "text" + }, + { + "bbox": [ + 454, + 277, + 483, + 287 + ], + "score": 0.9, + "content": "\\theta = 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 277, + 486, + 289 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "index", + "bbox": [ + 92, + 309, + 505, + 334 + ], + "lines": [], + "index": 7.5, + "bbox_fs": [ + 90, + 309, + 506, + 334 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 90, + 343, + 506, + 367 + ], + "lines": [ + { + "bbox": [ + 89, + 342, + 507, + 358 + ], + "spans": [ + { + "bbox": [ + 89, + 347, + 100, + 356 + ], + "score": 1.0, + "content": "91", + "type": "text" + }, + { + "bbox": [ + 102, + 342, + 226, + 358 + ], + "score": 1.0, + "content": "Differentiating a root. Let", + "type": "text" + }, + { + "bbox": [ + 226, + 344, + 308, + 355 + ], + "score": 0.91, + "content": "F \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 342, + 507, + 358 + ], + "score": 1.0, + "content": "be a user-provided mapping, capturing the opti-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 87, + 355, + 474, + 368 + ], + "spans": [ + { + "bbox": [ + 87, + 355, + 353, + 368 + ], + "score": 1.0, + "content": "mality conditions of a problem. An optimal solution, denoted 92", + "type": "text" + }, + { + "bbox": [ + 354, + 356, + 378, + 368 + ], + "score": 0.94, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 355, + 460, + 368 + ], + "score": 1.0, + "content": ", should be a root of", + "type": "text" + }, + { + "bbox": [ + 461, + 356, + 469, + 366 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 355, + 474, + 368 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 87, + 342, + 507, + 368 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 268, + 372, + 342, + 387 + ], + "lines": [ + { + "bbox": [ + 268, + 372, + 342, + 387 + ], + "spans": [ + { + "bbox": [ + 268, + 372, + 342, + 387 + ], + "score": 0.92, + "content": "F ( x ^ { \\star } ( \\theta ) , \\theta ) = 0 .", + "type": "interline_equation", + "image_path": "c0d1311ab5a42c8b5ec24287733a86c3510f65a5d67dfc6b9ad73d6b4061cb22.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 268, + 372, + 342, + 387 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "index", + "bbox": [ + 89, + 392, + 505, + 438 + ], + "lines": [ + { + "bbox": [ + 88, + 392, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 88, + 395, + 100, + 405 + ], + "score": 1.0, + "content": "93", + "type": "text" + }, + { + "bbox": [ + 105, + 392, + 157, + 406 + ], + "score": 1.0, + "content": "We can see", + "type": "text" + }, + { + "bbox": [ + 157, + 393, + 181, + 405 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 392, + 335, + 406 + ], + "score": 1.0, + "content": "as an implicitly defined function of", + "type": "text" + }, + { + "bbox": [ + 335, + 393, + 370, + 403 + ], + "score": 0.91, + "content": "\\theta \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 392, + 394, + 406 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 395, + 392, + 458, + 403 + ], + "score": 0.91, + "content": "x ^ { \\star } \\colon { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 392, + 505, + 406 + ], + "score": 1.0, + "content": ". Our goal", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 402, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 88, + 406, + 100, + 415 + ], + "score": 1.0, + "content": "94", + "type": "text" + }, + { + "bbox": [ + 104, + 402, + 180, + 417 + ], + "score": 1.0, + "content": "is to differentiate", + "type": "text" + }, + { + "bbox": [ + 181, + 404, + 204, + 416 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 402, + 230, + 417 + ], + "score": 1.0, + "content": "w.r.t.", + "type": "text" + }, + { + "bbox": [ + 230, + 405, + 236, + 414 + ], + "score": 0.74, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 402, + 429, + 417 + ], + "score": 1.0, + "content": ". From the implicit function theorem [44], if", + "type": "text" + }, + { + "bbox": [ + 429, + 405, + 438, + 414 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 402, + 505, + 417 + ], + "score": 1.0, + "content": "is continuously", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 88, + 416, + 100, + 426 + ], + "score": 1.0, + "content": "95", + "type": "text" + }, + { + "bbox": [ + 105, + 414, + 229, + 428 + ], + "score": 1.0, + "content": "differentiable and the Jacobian", + "type": "text" + }, + { + "bbox": [ + 230, + 415, + 248, + 426 + ], + "score": 0.9, + "content": "\\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 414, + 299, + 428 + ], + "score": 1.0, + "content": "evaluated at", + "type": "text" + }, + { + "bbox": [ + 299, + 415, + 340, + 427 + ], + "score": 0.94, + "content": "x ^ { \\star } ( \\theta ) \\times \\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 414, + 475, + 428 + ], + "score": 1.0, + "content": "is a square invertible matrix, then", + "type": "text" + }, + { + "bbox": [ + 475, + 415, + 505, + 427 + ], + "score": 0.91, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 426, + 393, + 438 + ], + "spans": [ + { + "bbox": [ + 88, + 428, + 100, + 437 + ], + "score": 1.0, + "content": "96", + "type": "text" + }, + { + "bbox": [ + 105, + 426, + 328, + 438 + ], + "score": 1.0, + "content": "exists. Using the chain rule, we know that the Jacobian", + "type": "text" + }, + { + "bbox": [ + 328, + 426, + 358, + 438 + ], + "score": 0.93, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 426, + 393, + 438 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + } + ], + "index": 13.5, + "bbox_fs": [ + 88, + 392, + 505, + 438 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 216, + 443, + 395, + 457 + ], + "lines": [ + { + "bbox": [ + 216, + 443, + 395, + 457 + ], + "spans": [ + { + "bbox": [ + 216, + 443, + 395, + 457 + ], + "score": 0.9, + "content": "\\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) \\partial x ^ { \\star } ( \\theta ) + \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = 0 .", + "type": "interline_equation", + "image_path": "274800a6c9b20e4e783661d1373fddeac8575eeb8a60627b067af1c171e4265b.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 216, + 443, + 395, + 457 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 90, + 462, + 430, + 474 + ], + "lines": [ + { + "bbox": [ + 87, + 461, + 432, + 476 + ], + "spans": [ + { + "bbox": [ + 87, + 461, + 154, + 476 + ], + "score": 1.0, + "content": "Computing 97", + "type": "text" + }, + { + "bbox": [ + 154, + 462, + 183, + 474 + ], + "score": 0.92, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 461, + 432, + 476 + ], + "score": 1.0, + "content": "boils down to the resolution of the linear system of equations", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 87, + 461, + 432, + 476 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 479, + 392, + 508 + ], + "lines": [ + { + "bbox": [ + 219, + 479, + 392, + 508 + ], + "spans": [ + { + "bbox": [ + 219, + 479, + 392, + 508 + ], + "score": 0.93, + "content": "\\underbrace { - \\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) } _ { A \\in \\mathbb { R } ^ { d \\times d } } \\underbrace { \\partial x ^ { \\star } ( \\theta ) } _ { J \\in \\mathbb { R } ^ { d \\times n } } = \\underbrace { \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) } _ { B \\in \\mathbb { R } ^ { d \\times n } }", + "type": "interline_equation", + "image_path": "61fc8e13f9e3f720696ee7ba4a802b9749c90618cf011fd1d2798863de6d8ed0.jpg" + } + ] + } + ], + "index": 18.5, + "virtual_lines": [ + { + "bbox": [ + 219, + 479, + 392, + 493.5 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 219, + 493.5, + 392, + 508.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "index", + "bbox": [ + 88, + 513, + 507, + 536 + ], + "lines": [ + { + "bbox": [ + 89, + 512, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 89, + 516, + 100, + 525 + ], + "score": 1.0, + "content": "98", + "type": "text" + }, + { + "bbox": [ + 105, + 512, + 320, + 526 + ], + "score": 1.0, + "content": "When (1) is a one-dimensional root finding problem", + "type": "text" + }, + { + "bbox": [ + 321, + 514, + 346, + 524 + ], + "score": 0.86, + "content": "\\dot { d } = 1 \\dot { }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 512, + 505, + 526 + ], + "score": 1.0, + "content": "), (2) becomes particularly simple since", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 523, + 288, + 537 + ], + "spans": [ + { + "bbox": [ + 89, + 526, + 100, + 536 + ], + "score": 1.0, + "content": "99", + "type": "text" + }, + { + "bbox": [ + 107, + 524, + 178, + 537 + ], + "score": 0.91, + "content": "\\nabla x ^ { \\star } ( \\theta ) = B ^ { \\top } / A", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 523, + 209, + 536 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 210, + 525, + 218, + 534 + ], + "score": 0.84, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 523, + 288, + 536 + ], + "score": 1.0, + "content": "is a scalar value.", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 86, + 542, + 99, + 551 + ], + "score": 1.0, + "content": "100", + "type": "text" + }, + { + "bbox": [ + 106, + 540, + 506, + 552 + ], + "score": 1.0, + "content": "We will show that existing and new implicit differentiation methods all reduce to this simple principle.", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 551, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 86, + 553, + 99, + 564 + ], + "score": 1.0, + "content": "101", + "type": "text" + }, + { + "bbox": [ + 106, + 551, + 505, + 564 + ], + "score": 1.0, + "content": "We call our approach hybrid, since it combines implicit differentiation (it involves the resolution of a", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 563, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 86, + 565, + 99, + 574 + ], + "score": 1.0, + "content": "102", + "type": "text" + }, + { + "bbox": [ + 106, + 563, + 343, + 575 + ], + "score": 1.0, + "content": "linear system) with the autodiff of the optimality conditions", + "type": "text" + }, + { + "bbox": [ + 344, + 563, + 353, + 572 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 563, + 505, + 575 + ], + "score": 1.0, + "content": ". Our approach is efficient as it can be", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 572, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 86, + 575, + 100, + 585 + ], + "score": 1.0, + "content": "103", + "type": "text" + }, + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "score": 1.0, + "content": "added on top of any state-of-the-art solver and modular as the optimality conditon specification is", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 585, + 329, + 596 + ], + "spans": [ + { + "bbox": [ + 86, + 587, + 99, + 596 + ], + "score": 1.0, + "content": "104", + "type": "text" + }, + { + "bbox": [ + 106, + 585, + 329, + 596 + ], + "score": 1.0, + "content": "decoupled from the implicit differentiation mechanism.", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + } + ], + "index": 20.5, + "bbox_fs": [ + 89, + 512, + 505, + 537 + ] + }, + { + "type": "index", + "bbox": [ + 87, + 540, + 505, + 596 + ], + "lines": [], + "index": 24, + "bbox_fs": [ + 86, + 540, + 506, + 596 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 95, + 607, + 504, + 630 + ], + "lines": [ + { + "bbox": [ + 91, + 608, + 504, + 621 + ], + "spans": [ + { + "bbox": [ + 91, + 608, + 430, + 621 + ], + "score": 1.0, + "content": "Differentiating a fixed point. We will encounter numerous applications where 05", + "type": "text" + }, + { + "bbox": [ + 430, + 608, + 454, + 620 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 608, + 504, + 621 + ], + "score": 1.0, + "content": "is implicitly", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 91, + 618, + 268, + 632 + ], + "spans": [ + { + "bbox": [ + 91, + 618, + 268, + 632 + ], + "score": 1.0, + "content": "06 defined through a fixed point iteration:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 91, + 608, + 504, + 632 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 260, + 635, + 350, + 650 + ], + "lines": [ + { + "bbox": [ + 260, + 635, + 350, + 650 + ], + "spans": [ + { + "bbox": [ + 260, + 635, + 350, + 650 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta ) = T ( x ^ { \\star } ( \\theta ) , \\theta ) ,", + "type": "interline_equation", + "image_path": "abe6cf0671c54522fc02fdb793687079a378aeb6f7fb62b05a2af4f58004d60a.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 260, + 635, + 350, + 650 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 655, + 408, + 668 + ], + "lines": [ + { + "bbox": [ + 84, + 653, + 410, + 669 + ], + "spans": [ + { + "bbox": [ + 84, + 653, + 133, + 669 + ], + "score": 1.0, + "content": "where 107", + "type": "text" + }, + { + "bbox": [ + 133, + 655, + 213, + 666 + ], + "score": 0.92, + "content": "T \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 653, + 410, + 669 + ], + "score": 1.0, + "content": ". This can be seen as a particular case of (1) with", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 84, + 653, + 410, + 669 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 673, + 381, + 687 + ], + "lines": [ + { + "bbox": [ + 230, + 673, + 381, + 687 + ], + "spans": [ + { + "bbox": [ + 230, + 673, + 381, + 687 + ], + "score": 0.92, + "content": "F ( x ^ { \\star } ( \\theta ) , \\theta ) = T ( x ^ { \\star } ( \\theta ) , \\theta ) - x ^ { \\star } ( \\theta ) .", + "type": "interline_equation", + "image_path": "84cac758b84ac842ae759995b0e5af13c1e749e95958fbe426ac33e2140ff621.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 230, + 673, + 381, + 687 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 87, + 692, + 274, + 704 + ], + "lines": [ + { + "bbox": [ + 86, + 692, + 274, + 705 + ], + "spans": [ + { + "bbox": [ + 86, + 692, + 274, + 705 + ], + "score": 1.0, + "content": "108 In this case, using the chain rule, we have", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32, + "bbox_fs": [ + 86, + 692, + 274, + 705 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 709, + 486, + 723 + ], + "lines": [ + { + "bbox": [ + 123, + 709, + 486, + 723 + ], + "spans": [ + { + "bbox": [ + 123, + 709, + 486, + 723 + ], + "score": 0.89, + "content": "A = - \\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = I - \\partial _ { 1 } T ( x ^ { \\star } ( \\theta ) , \\theta ) \\quad \\mathrm { a n d } \\quad B = \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = \\partial _ { 2 } T ( x ^ { \\star } ( \\theta ) , \\theta ) .", + "type": "interline_equation", + "image_path": "10fa8490ec27c72163d7dd399a16f9ec36f0ca85ee2d8bccb24156a8ca15b2f6.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 123, + 709, + 486, + 723 + ], + "spans": [], + "index": 33 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 86, + 72, + 505, + 150 + ], + "lines": [ + { + "bbox": [ + 85, + 72, + 506, + 86 + ], + "spans": [ + { + "bbox": [ + 85, + 74, + 100, + 85 + ], + "score": 1.0, + "content": "109", + "type": "text" + }, + { + "bbox": [ + 105, + 72, + 390, + 86 + ], + "score": 1.0, + "content": "Computing JVPs and VJPs. In practice, all we need to know from", + "type": "text" + }, + { + "bbox": [ + 390, + 73, + 399, + 83 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 72, + 506, + 86 + ], + "score": 1.0, + "content": "is how to left-multiply or", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 86, + 83, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 86, + 86, + 100, + 95 + ], + "score": 1.0, + "content": "110", + "type": "text" + }, + { + "bbox": [ + 105, + 83, + 166, + 97 + ], + "score": 1.0, + "content": "right-multiply", + "type": "text" + }, + { + "bbox": [ + 167, + 84, + 186, + 95 + ], + "score": 0.9, + "content": "\\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 83, + 205, + 97 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 205, + 84, + 224, + 95 + ], + "score": 0.9, + "content": "\\partial _ { 2 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 83, + 506, + 97 + ], + "score": 1.0, + "content": "with a vector of appropriate size. These are called vector-Jacobian", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 86, + 94, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 86, + 96, + 99, + 106 + ], + "score": 1.0, + "content": "111", + "type": "text" + }, + { + "bbox": [ + 106, + 94, + 426, + 107 + ], + "score": 1.0, + "content": "product (VJP) and Jacobian-vector product (JVP), and are useful for integrating", + "type": "text" + }, + { + "bbox": [ + 427, + 95, + 451, + 106 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 94, + 506, + 107 + ], + "score": 1.0, + "content": "with reverse-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 86, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 86, + 108, + 100, + 117 + ], + "score": 1.0, + "content": "112", + "type": "text" + }, + { + "bbox": [ + 105, + 105, + 344, + 119 + ], + "score": 1.0, + "content": "mode and forward-mode autodiff, respectively. Often times,", + "type": "text" + }, + { + "bbox": [ + 344, + 106, + 353, + 115 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 105, + 506, + 119 + ], + "score": 1.0, + "content": "will be explicitly defined. In this case,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 85, + 116, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 85, + 118, + 100, + 129 + ], + "score": 1.0, + "content": "113", + "type": "text" + }, + { + "bbox": [ + 106, + 116, + 367, + 129 + ], + "score": 1.0, + "content": "computing the VJP or JVP can be done via autodiff. Other times,", + "type": "text" + }, + { + "bbox": [ + 367, + 117, + 376, + 126 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 116, + 506, + 129 + ], + "score": 1.0, + "content": "may itself be implicitly defined,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 86, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 86, + 129, + 100, + 139 + ], + "score": 1.0, + "content": "114", + "type": "text" + }, + { + "bbox": [ + 106, + 127, + 180, + 140 + ], + "score": 1.0, + "content": "for instance when", + "type": "text" + }, + { + "bbox": [ + 180, + 128, + 189, + 137 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "involves the solution of a variational problem. In this case, computing the VJP", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 86, + 137, + 303, + 150 + ], + "spans": [ + { + "bbox": [ + 86, + 140, + 100, + 149 + ], + "score": 1.0, + "content": "115", + "type": "text" + }, + { + "bbox": [ + 105, + 137, + 303, + 150 + ], + "score": 1.0, + "content": "or JVP will itself involve implicit differentiation.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 86, + 154, + 505, + 212 + ], + "lines": [ + { + "bbox": [ + 86, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 86, + 156, + 100, + 166 + ], + "score": 1.0, + "content": "116", + "type": "text" + }, + { + "bbox": [ + 105, + 154, + 265, + 167 + ], + "score": 1.0, + "content": "The right-multiplication (JVP) between", + "type": "text" + }, + { + "bbox": [ + 265, + 154, + 315, + 167 + ], + "score": 0.93, + "content": "J = \\partial x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 154, + 367, + 167 + ], + "score": 1.0, + "content": "and a vector", + "type": "text" + }, + { + "bbox": [ + 367, + 157, + 373, + 164 + ], + "score": 0.67, + "content": "v", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 154, + 377, + 167 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 377, + 155, + 390, + 165 + ], + "score": 0.78, + "content": "J v", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 154, + 505, + 167 + ], + "score": 1.0, + "content": ", can be computed efficiently", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 86, + 165, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 86, + 168, + 99, + 178 + ], + "score": 1.0, + "content": "117", + "type": "text" + }, + { + "bbox": [ + 105, + 165, + 150, + 179 + ], + "score": 1.0, + "content": "by solving", + "type": "text" + }, + { + "bbox": [ + 151, + 166, + 205, + 178 + ], + "score": 0.92, + "content": "A ( J v ) = B v", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 165, + 336, + 179 + ], + "score": 1.0, + "content": ". The left-multiplication (VJP) of", + "type": "text" + }, + { + "bbox": [ + 337, + 165, + 349, + 176 + ], + "score": 0.89, + "content": "v ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 165, + 371, + 179 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 371, + 166, + 402, + 177 + ], + "score": 0.56, + "content": "J , v ^ { \\top } J", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 165, + 505, + 179 + ], + "score": 1.0, + "content": ", can be computed by first", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 86, + 176, + 505, + 192 + ], + "spans": [ + { + "bbox": [ + 86, + 180, + 100, + 189 + ], + "score": 1.0, + "content": "118", + "type": "text" + }, + { + "bbox": [ + 104, + 176, + 138, + 192 + ], + "score": 1.0, + "content": "solving", + "type": "text" + }, + { + "bbox": [ + 138, + 178, + 178, + 189 + ], + "score": 0.9, + "content": "A ^ { \\top } u = v", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 176, + 266, + 192 + ], + "score": 1.0, + "content": ". Then, we can obtain", + "type": "text" + }, + { + "bbox": [ + 266, + 177, + 285, + 189 + ], + "score": 0.9, + "content": "v ^ { \\top } J", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 176, + 299, + 192 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 299, + 177, + 393, + 189 + ], + "score": 0.9, + "content": "\\boldsymbol { v } ^ { \\top } \\boldsymbol { J } = \\boldsymbol { u } ^ { \\top } \\boldsymbol { A } \\boldsymbol { J } = \\boldsymbol { u } ^ { \\top } \\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 176, + 460, + 192 + ], + "score": 1.0, + "content": ". Note that when", + "type": "text" + }, + { + "bbox": [ + 460, + 178, + 469, + 188 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 176, + 505, + 192 + ], + "score": 1.0, + "content": "changes", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 86, + 187, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 86, + 191, + 100, + 200 + ], + "score": 1.0, + "content": "119", + "type": "text" + }, + { + "bbox": [ + 105, + 187, + 121, + 203 + ], + "score": 1.0, + "content": "but", + "type": "text" + }, + { + "bbox": [ + 122, + 190, + 130, + 199 + ], + "score": 0.74, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 187, + 148, + 203 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 148, + 191, + 155, + 199 + ], + "score": 0.71, + "content": "v", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 187, + 321, + 203 + ], + "score": 1.0, + "content": "remain the same, we do not need to solve", + "type": "text" + }, + { + "bbox": [ + 322, + 189, + 361, + 200 + ], + "score": 0.9, + "content": "A ^ { \\top } u = v", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 187, + 505, + 203 + ], + "score": 1.0, + "content": "once again. This allows to compute", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 85, + 199, + 389, + 213 + ], + "spans": [ + { + "bbox": [ + 85, + 201, + 100, + 212 + ], + "score": 1.0, + "content": "120", + "type": "text" + }, + { + "bbox": [ + 104, + 199, + 389, + 213 + ], + "score": 1.0, + "content": "the VJP w.r.t. different variables while solving only one linear system.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 86, + 217, + 505, + 272 + ], + "lines": [ + { + "bbox": [ + 86, + 216, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 86, + 218, + 99, + 227 + ], + "score": 1.0, + "content": "121", + "type": "text" + }, + { + "bbox": [ + 105, + 216, + 451, + 230 + ], + "score": 1.0, + "content": "To solve these linear systems, we can use the conjugate gradient method [39] when", + "type": "text" + }, + { + "bbox": [ + 451, + 217, + 460, + 227 + ], + "score": 0.76, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 216, + 505, + 230 + ], + "score": 1.0, + "content": "is positive", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 86, + 227, + 506, + 240 + ], + "spans": [ + { + "bbox": [ + 86, + 229, + 100, + 239 + ], + "score": 1.0, + "content": "122", + "type": "text" + }, + { + "bbox": [ + 105, + 227, + 342, + 240 + ], + "score": 1.0, + "content": "semi-definite and GMRES [61] or BiCGSTAB [66] when", + "type": "text" + }, + { + "bbox": [ + 342, + 228, + 351, + 237 + ], + "score": 0.81, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 227, + 506, + 240 + ], + "score": 1.0, + "content": "is not. All algorithms are matrix-free,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 86, + 239, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 86, + 240, + 100, + 249 + ], + "score": 1.0, + "content": "123", + "type": "text" + }, + { + "bbox": [ + 105, + 239, + 449, + 250 + ], + "score": 1.0, + "content": "i.e., they only require matrix-vector products (linear maps). Thus, all we need from", + "type": "text" + }, + { + "bbox": [ + 450, + 239, + 459, + 248 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 239, + 505, + 250 + ], + "score": 1.0, + "content": "is its JVPs", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 85, + 248, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 85, + 251, + 100, + 261 + ], + "score": 1.0, + "content": "124", + "type": "text" + }, + { + "bbox": [ + 104, + 248, + 425, + 263 + ], + "score": 1.0, + "content": "or VJPs. An alternative to GMRES/BiCGSTAB is to solve the normal equation", + "type": "text" + }, + { + "bbox": [ + 425, + 249, + 480, + 259 + ], + "score": 0.91, + "content": "A A ^ { \\top } u = A v", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 248, + 506, + 263 + ], + "score": 1.0, + "content": "using", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 86, + 260, + 345, + 273 + ], + "spans": [ + { + "bbox": [ + 86, + 263, + 100, + 272 + ], + "score": 1.0, + "content": "125", + "type": "text" + }, + { + "bbox": [ + 105, + 260, + 345, + 273 + ], + "score": 1.0, + "content": "conjugate gradient, which we find faster in some scenarios.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 87, + 283, + 505, + 393 + ], + "lines": [ + { + "bbox": [ + 86, + 283, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 86, + 284, + 100, + 294 + ], + "score": 1.0, + "content": "126", + "type": "text" + }, + { + "bbox": [ + 106, + 283, + 482, + 294 + ], + "score": 1.0, + "content": "Pre-processing and post-processing mappings. Often times, the goal is not to differentiate", + "type": "text" + }, + { + "bbox": [ + 483, + 283, + 489, + 293 + ], + "score": 0.75, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 283, + 505, + 294 + ], + "score": 1.0, + "content": "per", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 86, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 86, + 295, + 99, + 306 + ], + "score": 1.0, + "content": "127", + "type": "text" + }, + { + "bbox": [ + 106, + 294, + 293, + 306 + ], + "score": 1.0, + "content": "se, but the parameters of a function producing", + "type": "text" + }, + { + "bbox": [ + 294, + 294, + 300, + 303 + ], + "score": 0.52, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 294, + 505, + 306 + ], + "score": 1.0, + "content": ". One example of such pre-processing is to convert", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 86, + 304, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 86, + 306, + 100, + 316 + ], + "score": 1.0, + "content": "128", + "type": "text" + }, + { + "bbox": [ + 105, + 304, + 505, + 317 + ], + "score": 1.0, + "content": "the parameters to be differentiated from one form to another canonical form, such as a quadratic", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 86, + 315, + 506, + 328 + ], + "spans": [ + { + "bbox": [ + 86, + 317, + 100, + 327 + ], + "score": 1.0, + "content": "129", + "type": "text" + }, + { + "bbox": [ + 105, + 315, + 353, + 328 + ], + "score": 1.0, + "content": "program [6] or a conic program [2]. Another example is when", + "type": "text" + }, + { + "bbox": [ + 353, + 315, + 377, + 327 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 315, + 506, + 328 + ], + "score": 1.0, + "content": "is used as the output of a neural", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 86, + 326, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 86, + 328, + 100, + 338 + ], + "score": 1.0, + "content": "130", + "type": "text" + }, + { + "bbox": [ + 105, + 326, + 227, + 338 + ], + "score": 1.0, + "content": "network layer, in which case", + "type": "text" + }, + { + "bbox": [ + 227, + 327, + 234, + 336 + ], + "score": 0.78, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 326, + 420, + 338 + ], + "score": 1.0, + "content": "is produced by the previous layer. Likewise,", + "type": "text" + }, + { + "bbox": [ + 421, + 326, + 445, + 338 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 326, + 506, + 338 + ], + "score": 1.0, + "content": "will often not", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 86, + 337, + 506, + 349 + ], + "spans": [ + { + "bbox": [ + 86, + 339, + 99, + 349 + ], + "score": 1.0, + "content": "131", + "type": "text" + }, + { + "bbox": [ + 105, + 337, + 470, + 349 + ], + "score": 1.0, + "content": "be the final output we want to differentiate. One example of such post-processing is when", + "type": "text" + }, + { + "bbox": [ + 470, + 337, + 494, + 349 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 337, + 506, + 349 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 86, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 86, + 350, + 100, + 360 + ], + "score": 1.0, + "content": "132", + "type": "text" + }, + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "the solution of a dual program and we apply the dual-primal mapping to recover the solution of the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 86, + 359, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 86, + 361, + 100, + 371 + ], + "score": 1.0, + "content": "133", + "type": "text" + }, + { + "bbox": [ + 105, + 359, + 462, + 371 + ], + "score": 1.0, + "content": "primal program. Another example is the application of a loss function, in order to reduce", + "type": "text" + }, + { + "bbox": [ + 462, + 359, + 486, + 371 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 359, + 506, + 371 + ], + "score": 1.0, + "content": "to a", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 86, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 86, + 371, + 100, + 381 + ], + "score": 1.0, + "content": "134", + "type": "text" + }, + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "scalar value. In all these cases, we leave the differentiation of the pre/post-processing mappings to", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 86, + 380, + 396, + 394 + ], + "spans": [ + { + "bbox": [ + 86, + 383, + 100, + 393 + ], + "score": 1.0, + "content": "135", + "type": "text" + }, + { + "bbox": [ + 105, + 380, + 396, + 394 + ], + "score": 1.0, + "content": "the autodiff system, allowing us to compose functions in complex ways.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 87, + 403, + 505, + 458 + ], + "lines": [ + { + "bbox": [ + 86, + 403, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 86, + 405, + 100, + 415 + ], + "score": 1.0, + "content": "136", + "type": "text" + }, + { + "bbox": [ + 106, + 403, + 505, + 415 + ], + "score": 1.0, + "content": "Usage and implementation details. Our implementation is based on JAX [17, 34]. JAX’s autodiff", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 86, + 413, + 506, + 427 + ], + "spans": [ + { + "bbox": [ + 86, + 416, + 99, + 425 + ], + "score": 1.0, + "content": "137", + "type": "text" + }, + { + "bbox": [ + 105, + 413, + 506, + 427 + ], + "score": 1.0, + "content": "features enter the picture in at least two ways: (i) we lean heavily on JAX within our implementation,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 86, + 423, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 86, + 427, + 99, + 436 + ], + "score": 1.0, + "content": "138", + "type": "text" + }, + { + "bbox": [ + 105, + 423, + 506, + 439 + ], + "score": 1.0, + "content": "and (ii) we integrate the differentiation routines introduced by our framework into JAX’s existing", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 86, + 434, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 86, + 438, + 100, + 448 + ], + "score": 1.0, + "content": "139", + "type": "text" + }, + { + "bbox": [ + 105, + 434, + 506, + 450 + ], + "score": 1.0, + "content": "autodiff system. In doing the latter, we override JAX’s default autodiff behavior (e.g. of differentiating", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 86, + 447, + 355, + 459 + ], + "spans": [ + { + "bbox": [ + 86, + 449, + 99, + 458 + ], + "score": 1.0, + "content": "140", + "type": "text" + }, + { + "bbox": [ + 105, + 447, + 355, + 459 + ], + "score": 1.0, + "content": "transparently through an iterative solver’s unrolled iterations).", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 87, + 463, + 505, + 584 + ], + "lines": [ + { + "bbox": [ + 86, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 86, + 465, + 99, + 475 + ], + "score": 1.0, + "content": "141", + "type": "text" + }, + { + "bbox": [ + 105, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "We delineate here what features are needed from an autodiff system to implement our proposed", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 86, + 474, + 506, + 486 + ], + "spans": [ + { + "bbox": [ + 86, + 475, + 100, + 486 + ], + "score": 1.0, + "content": "142", + "type": "text" + }, + { + "bbox": [ + 105, + 474, + 320, + 486 + ], + "score": 1.0, + "content": "framework. As mentioned, we only need access to", + "type": "text" + }, + { + "bbox": [ + 321, + 475, + 330, + 484 + ], + "score": 0.81, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 474, + 445, + 486 + ], + "score": 1.0, + "content": "through the JVP or VJP of", + "type": "text" + }, + { + "bbox": [ + 446, + 474, + 465, + 485 + ], + "score": 0.91, + "content": "\\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 474, + 484, + 486 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 484, + 474, + 503, + 485 + ], + "score": 0.9, + "content": "\\partial _ { 2 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 474, + 506, + 486 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 86, + 484, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 86, + 487, + 99, + 496 + ], + "score": 1.0, + "content": "143", + "type": "text" + }, + { + "bbox": [ + 105, + 484, + 199, + 498 + ], + "score": 1.0, + "content": "Since the definition of", + "type": "text" + }, + { + "bbox": [ + 200, + 486, + 209, + 495 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 484, + 365, + 498 + ], + "score": 1.0, + "content": "will often include a gradient mapping", + "type": "text" + }, + { + "bbox": [ + 366, + 485, + 408, + 497 + ], + "score": 0.93, + "content": "\\nabla _ { 1 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 484, + 480, + 498 + ], + "score": 1.0, + "content": "(see examples in", + "type": "text" + }, + { + "bbox": [ + 480, + 486, + 500, + 496 + ], + "score": 0.79, + "content": "\\ S 2 . 2 \\AA ,", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 484, + 506, + 498 + ], + "score": 1.0, + "content": "),", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 86, + 495, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 86, + 498, + 100, + 507 + ], + "score": 1.0, + "content": "144", + "type": "text" + }, + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "score": 1.0, + "content": "second-order derivatives need also be supported. Our library provides two decorators, custom_root", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 86, + 506, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 86, + 509, + 100, + 519 + ], + "score": 1.0, + "content": "145", + "type": "text" + }, + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "score": 1.0, + "content": "and custom_fixed_point, for adding implicit differentiation on top of a solver, given optimality", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 86, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 86, + 520, + 100, + 529 + ], + "score": 1.0, + "content": "146", + "type": "text" + }, + { + "bbox": [ + 106, + 518, + 151, + 530 + ], + "score": 1.0, + "content": "conditions", + "type": "text" + }, + { + "bbox": [ + 152, + 518, + 161, + 528 + ], + "score": 0.84, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 518, + 256, + 530 + ], + "score": 1.0, + "content": "or fixed point iteration", + "type": "text" + }, + { + "bbox": [ + 257, + 518, + 265, + 528 + ], + "score": 0.76, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 518, + 505, + 530 + ], + "score": 1.0, + "content": ". This functionality requires the ability to add custom JVP", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 86, + 528, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 86, + 530, + 100, + 541 + ], + "score": 1.0, + "content": "147", + "type": "text" + }, + { + "bbox": [ + 105, + 528, + 506, + 542 + ], + "score": 1.0, + "content": "and/or VJP to a function. All these features are supported by recent autodiff systems, including JAX", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 86, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 86, + 542, + 99, + 551 + ], + "score": 1.0, + "content": "148", + "type": "text" + }, + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "[17], TensorFlow [1] and PyTorch [56]. Our implementation, made in JAX, also uses JAX-specific", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 86, + 548, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 86, + 552, + 99, + 562 + ], + "score": 1.0, + "content": "149", + "type": "text" + }, + { + "bbox": [ + 104, + 548, + 360, + 565 + ], + "score": 1.0, + "content": "features. We make extensive use of automatic batching with", + "type": "text" + }, + { + "bbox": [ + 361, + 551, + 403, + 562 + ], + "score": 0.32, + "content": "{ \\mathrm { j a x . v m a p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 548, + 506, + 565 + ], + "score": 1.0, + "content": ", JAX’s vectorizing map", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 86, + 559, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 86, + 563, + 100, + 574 + ], + "score": 1.0, + "content": "150", + "type": "text" + }, + { + "bbox": [ + 105, + 559, + 328, + 575 + ], + "score": 1.0, + "content": "transformation. In order to solve the normal equation", + "type": "text" + }, + { + "bbox": [ + 328, + 561, + 384, + 572 + ], + "score": 0.9, + "content": "{ \\bar { A } } A ^ { \\top } u \\stackrel { = } { = } A v", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 559, + 506, + 575 + ], + "score": 1.0, + "content": ", we also use JAX’s ability to", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 86, + 572, + 407, + 586 + ], + "spans": [ + { + "bbox": [ + 86, + 575, + 99, + 584 + ], + "score": 1.0, + "content": "151", + "type": "text" + }, + { + "bbox": [ + 105, + 572, + 407, + 586 + ], + "score": 1.0, + "content": "automatically transpose a linear map using jax.linear_transpose [33].", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 37 + }, + { + "type": "title", + "bbox": [ + 107, + 596, + 172, + 607 + ], + "lines": [ + { + "bbox": [ + 105, + 593, + 173, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 173, + 610 + ], + "score": 1.0, + "content": "2.2 Examples", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 106, + 615, + 505, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 279, + 629 + ], + "score": 1.0, + "content": "We now give various examples of mapping", + "type": "text" + }, + { + "bbox": [ + 279, + 617, + 289, + 626 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 615, + 381, + 629 + ], + "score": 1.0, + "content": "or fixed point iteration", + "type": "text" + }, + { + "bbox": [ + 381, + 617, + 389, + 626 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 615, + 506, + 629 + ], + "score": 1.0, + "content": ", recovering existing implicit", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 356, + 639 + ], + "score": 1.0, + "content": "differentiation methods and creating new ones. Each choice of", + "type": "text" + }, + { + "bbox": [ + 356, + 627, + 365, + 637 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 627, + 376, + 639 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 377, + 627, + 385, + 637 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "implies different trade-offs in", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 638, + 481, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 481, + 650 + ], + "score": 1.0, + "content": "terms of computational oracles; see Table 1. Source code examples are given in Appendix A.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45 + }, + { + "type": "text", + "bbox": [ + 97, + 660, + 504, + 672 + ], + "lines": [ + { + "bbox": [ + 93, + 658, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 93, + 658, + 505, + 675 + ], + "score": 1.0, + "content": "56 Stationary point condition. The simplest example is to differentiate through the implicit function", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "interline_equation", + "bbox": [ + 254, + 673, + 356, + 694 + ], + "lines": [ + { + "bbox": [ + 254, + 673, + 356, + 694 + ], + "spans": [ + { + "bbox": [ + 254, + 673, + 356, + 694 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta ) = \\operatorname * { a r g m i n } _ { x \\in \\mathbb { R } ^ { d } } f ( x , \\theta ) ,", + "type": "interline_equation", + "image_path": "b6188a6a7c9a596b50fc8852bc4ccc0f4d16f5bf1e6daa08a88ba4243cf2e32f.jpg" + } + ] + } + ], + "index": 48, + "virtual_lines": [ + { + "bbox": [ + 254, + 673, + 356, + 694 + ], + "spans": [], + "index": 48 + } + ] + }, + { + "type": "text", + "bbox": [ + 88, + 696, + 487, + 709 + ], + "lines": [ + { + "bbox": [ + 84, + 694, + 487, + 712 + ], + "spans": [ + { + "bbox": [ + 84, + 694, + 133, + 712 + ], + "score": 1.0, + "content": "where 157", + "type": "text" + }, + { + "bbox": [ + 133, + 696, + 207, + 709 + ], + "score": 0.92, + "content": "f \\colon { \\mathbb { R } ^ { d } } \\times { \\mathbb { R } ^ { n } } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 694, + 350, + 712 + ], + "score": 1.0, + "content": "is twice differentiable. In this case,", + "type": "text" + }, + { + "bbox": [ + 350, + 698, + 359, + 707 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 694, + 487, + 712 + ], + "score": 1.0, + "content": "is simply the gradient mapping", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 49 + }, + { + "type": "interline_equation", + "bbox": [ + 260, + 709, + 350, + 723 + ], + "lines": [ + { + "bbox": [ + 260, + 709, + 350, + 723 + ], + "spans": [ + { + "bbox": [ + 260, + 709, + 350, + 723 + ], + "score": 0.89, + "content": "F ( x , \\theta ) = \\nabla _ { 1 } f ( x , \\theta ) .", + "type": "interline_equation", + "image_path": "fb95590bd657f30e56a390a2486618317cd1509a18dbdc55625d4d514240b602.jpg" + } + ] + } + ], + "index": 50, + "virtual_lines": [ + { + "bbox": [ + 260, + 709, + 350, + 723 + ], + "spans": [], + "index": 50 + } + ] + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 301, + 741, + 310, + 752 + ], + "spans": [ + { + "bbox": [ + 301, + 741, + 310, + 752 + ], + "score": 1.0, + "content": "4", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "index", + "bbox": [ + 86, + 72, + 505, + 150 + ], + "lines": [ + { + "bbox": [ + 85, + 72, + 506, + 86 + ], + "spans": [ + { + "bbox": [ + 85, + 74, + 100, + 85 + ], + "score": 1.0, + "content": "109", + "type": "text" + }, + { + "bbox": [ + 105, + 72, + 390, + 86 + ], + "score": 1.0, + "content": "Computing JVPs and VJPs. In practice, all we need to know from", + "type": "text" + }, + { + "bbox": [ + 390, + 73, + 399, + 83 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 72, + 506, + 86 + ], + "score": 1.0, + "content": "is how to left-multiply or", + "type": "text" + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 83, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 86, + 86, + 100, + 95 + ], + "score": 1.0, + "content": "110", + "type": "text" + }, + { + "bbox": [ + 105, + 83, + 166, + 97 + ], + "score": 1.0, + "content": "right-multiply", + "type": "text" + }, + { + "bbox": [ + 167, + 84, + 186, + 95 + ], + "score": 0.9, + "content": "\\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 83, + 205, + 97 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 205, + 84, + 224, + 95 + ], + "score": 0.9, + "content": "\\partial _ { 2 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 83, + 506, + 97 + ], + "score": 1.0, + "content": "with a vector of appropriate size. These are called vector-Jacobian", + "type": "text" + } + ], + "index": 1, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 94, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 86, + 96, + 99, + 106 + ], + "score": 1.0, + "content": "111", + "type": "text" + }, + { + "bbox": [ + 106, + 94, + 426, + 107 + ], + "score": 1.0, + "content": "product (VJP) and Jacobian-vector product (JVP), and are useful for integrating", + "type": "text" + }, + { + "bbox": [ + 427, + 95, + 451, + 106 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 94, + 506, + 107 + ], + "score": 1.0, + "content": "with reverse-", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 86, + 108, + 100, + 117 + ], + "score": 1.0, + "content": "112", + "type": "text" + }, + { + "bbox": [ + 105, + 105, + 344, + 119 + ], + "score": 1.0, + "content": "mode and forward-mode autodiff, respectively. Often times,", + "type": "text" + }, + { + "bbox": [ + 344, + 106, + 353, + 115 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 105, + 506, + 119 + ], + "score": 1.0, + "content": "will be explicitly defined. In this case,", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 116, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 85, + 118, + 100, + 129 + ], + "score": 1.0, + "content": "113", + "type": "text" + }, + { + "bbox": [ + 106, + 116, + 367, + 129 + ], + "score": 1.0, + "content": "computing the VJP or JVP can be done via autodiff. Other times,", + "type": "text" + }, + { + "bbox": [ + 367, + 117, + 376, + 126 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 116, + 506, + 129 + ], + "score": 1.0, + "content": "may itself be implicitly defined,", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 86, + 129, + 100, + 139 + ], + "score": 1.0, + "content": "114", + "type": "text" + }, + { + "bbox": [ + 106, + 127, + 180, + 140 + ], + "score": 1.0, + "content": "for instance when", + "type": "text" + }, + { + "bbox": [ + 180, + 128, + 189, + 137 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "involves the solution of a variational problem. In this case, computing the VJP", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 137, + 303, + 150 + ], + "spans": [ + { + "bbox": [ + 86, + 140, + 100, + 149 + ], + "score": 1.0, + "content": "115", + "type": "text" + }, + { + "bbox": [ + 105, + 137, + 303, + 150 + ], + "score": 1.0, + "content": "or JVP will itself involve implicit differentiation.", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 86, + 156, + 100, + 166 + ], + "score": 1.0, + "content": "116", + "type": "text" + }, + { + "bbox": [ + 105, + 154, + 265, + 167 + ], + "score": 1.0, + "content": "The right-multiplication (JVP) between", + "type": "text" + }, + { + "bbox": [ + 265, + 154, + 315, + 167 + ], + "score": 0.93, + "content": "J = \\partial x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 154, + 367, + 167 + ], + "score": 1.0, + "content": "and a vector", + "type": "text" + }, + { + "bbox": [ + 367, + 157, + 373, + 164 + ], + "score": 0.67, + "content": "v", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 154, + 377, + 167 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 377, + 155, + 390, + 165 + ], + "score": 0.78, + "content": "J v", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 154, + 505, + 167 + ], + "score": 1.0, + "content": ", can be computed efficiently", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 165, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 86, + 168, + 99, + 178 + ], + "score": 1.0, + "content": "117", + "type": "text" + }, + { + "bbox": [ + 105, + 165, + 150, + 179 + ], + "score": 1.0, + "content": "by solving", + "type": "text" + }, + { + "bbox": [ + 151, + 166, + 205, + 178 + ], + "score": 0.92, + "content": "A ( J v ) = B v", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 165, + 336, + 179 + ], + "score": 1.0, + "content": ". The left-multiplication (VJP) of", + "type": "text" + }, + { + "bbox": [ + 337, + 165, + 349, + 176 + ], + "score": 0.89, + "content": "v ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 165, + 371, + 179 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 371, + 166, + 402, + 177 + ], + "score": 0.56, + "content": "J , v ^ { \\top } J", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 165, + 505, + 179 + ], + "score": 1.0, + "content": ", can be computed by first", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 176, + 505, + 192 + ], + "spans": [ + { + "bbox": [ + 86, + 180, + 100, + 189 + ], + "score": 1.0, + "content": "118", + "type": "text" + }, + { + "bbox": [ + 104, + 176, + 138, + 192 + ], + "score": 1.0, + "content": "solving", + "type": "text" + }, + { + "bbox": [ + 138, + 178, + 178, + 189 + ], + "score": 0.9, + "content": "A ^ { \\top } u = v", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 176, + 266, + 192 + ], + "score": 1.0, + "content": ". Then, we can obtain", + "type": "text" + }, + { + "bbox": [ + 266, + 177, + 285, + 189 + ], + "score": 0.9, + "content": "v ^ { \\top } J", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 176, + 299, + 192 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 299, + 177, + 393, + 189 + ], + "score": 0.9, + "content": "\\boldsymbol { v } ^ { \\top } \\boldsymbol { J } = \\boldsymbol { u } ^ { \\top } \\boldsymbol { A } \\boldsymbol { J } = \\boldsymbol { u } ^ { \\top } \\boldsymbol { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 176, + 460, + 192 + ], + "score": 1.0, + "content": ". Note that when", + "type": "text" + }, + { + "bbox": [ + 460, + 178, + 469, + 188 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 176, + 505, + 192 + ], + "score": 1.0, + "content": "changes", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 187, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 86, + 191, + 100, + 200 + ], + "score": 1.0, + "content": "119", + "type": "text" + }, + { + "bbox": [ + 105, + 187, + 121, + 203 + ], + "score": 1.0, + "content": "but", + "type": "text" + }, + { + "bbox": [ + 122, + 190, + 130, + 199 + ], + "score": 0.74, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 187, + 148, + 203 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 148, + 191, + 155, + 199 + ], + "score": 0.71, + "content": "v", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 187, + 321, + 203 + ], + "score": 1.0, + "content": "remain the same, we do not need to solve", + "type": "text" + }, + { + "bbox": [ + 322, + 189, + 361, + 200 + ], + "score": 0.9, + "content": "A ^ { \\top } u = v", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 187, + 505, + 203 + ], + "score": 1.0, + "content": "once again. This allows to compute", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 199, + 389, + 213 + ], + "spans": [ + { + "bbox": [ + 85, + 201, + 100, + 212 + ], + "score": 1.0, + "content": "120", + "type": "text" + }, + { + "bbox": [ + 104, + 199, + 389, + 213 + ], + "score": 1.0, + "content": "the VJP w.r.t. different variables while solving only one linear system.", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 216, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 86, + 218, + 99, + 227 + ], + "score": 1.0, + "content": "121", + "type": "text" + }, + { + "bbox": [ + 105, + 216, + 451, + 230 + ], + "score": 1.0, + "content": "To solve these linear systems, we can use the conjugate gradient method [39] when", + "type": "text" + }, + { + "bbox": [ + 451, + 217, + 460, + 227 + ], + "score": 0.76, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 216, + 505, + 230 + ], + "score": 1.0, + "content": "is positive", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 227, + 506, + 240 + ], + "spans": [ + { + "bbox": [ + 86, + 229, + 100, + 239 + ], + "score": 1.0, + "content": "122", + "type": "text" + }, + { + "bbox": [ + 105, + 227, + 342, + 240 + ], + "score": 1.0, + "content": "semi-definite and GMRES [61] or BiCGSTAB [66] when", + "type": "text" + }, + { + "bbox": [ + 342, + 228, + 351, + 237 + ], + "score": 0.81, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 227, + 506, + 240 + ], + "score": 1.0, + "content": "is not. All algorithms are matrix-free,", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 239, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 86, + 240, + 100, + 249 + ], + "score": 1.0, + "content": "123", + "type": "text" + }, + { + "bbox": [ + 105, + 239, + 449, + 250 + ], + "score": 1.0, + "content": "i.e., they only require matrix-vector products (linear maps). Thus, all we need from", + "type": "text" + }, + { + "bbox": [ + 450, + 239, + 459, + 248 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 239, + 505, + 250 + ], + "score": 1.0, + "content": "is its JVPs", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 248, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 85, + 251, + 100, + 261 + ], + "score": 1.0, + "content": "124", + "type": "text" + }, + { + "bbox": [ + 104, + 248, + 425, + 263 + ], + "score": 1.0, + "content": "or VJPs. An alternative to GMRES/BiCGSTAB is to solve the normal equation", + "type": "text" + }, + { + "bbox": [ + 425, + 249, + 480, + 259 + ], + "score": 0.91, + "content": "A A ^ { \\top } u = A v", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 248, + 506, + 263 + ], + "score": 1.0, + "content": "using", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 260, + 345, + 273 + ], + "spans": [ + { + "bbox": [ + 86, + 263, + 100, + 272 + ], + "score": 1.0, + "content": "125", + "type": "text" + }, + { + "bbox": [ + 105, + 260, + 345, + 273 + ], + "score": 1.0, + "content": "conjugate gradient, which we find faster in some scenarios.", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 283, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 86, + 284, + 100, + 294 + ], + "score": 1.0, + "content": "126", + "type": "text" + }, + { + "bbox": [ + 106, + 283, + 482, + 294 + ], + "score": 1.0, + "content": "Pre-processing and post-processing mappings. Often times, the goal is not to differentiate", + "type": "text" + }, + { + "bbox": [ + 483, + 283, + 489, + 293 + ], + "score": 0.75, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 283, + 505, + 294 + ], + "score": 1.0, + "content": "per", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 86, + 295, + 99, + 306 + ], + "score": 1.0, + "content": "127", + "type": "text" + }, + { + "bbox": [ + 106, + 294, + 293, + 306 + ], + "score": 1.0, + "content": "se, but the parameters of a function producing", + "type": "text" + }, + { + "bbox": [ + 294, + 294, + 300, + 303 + ], + "score": 0.52, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 294, + 505, + 306 + ], + "score": 1.0, + "content": ". One example of such pre-processing is to convert", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 304, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 86, + 306, + 100, + 316 + ], + "score": 1.0, + "content": "128", + "type": "text" + }, + { + "bbox": [ + 105, + 304, + 505, + 317 + ], + "score": 1.0, + "content": "the parameters to be differentiated from one form to another canonical form, such as a quadratic", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 315, + 506, + 328 + ], + "spans": [ + { + "bbox": [ + 86, + 317, + 100, + 327 + ], + "score": 1.0, + "content": "129", + "type": "text" + }, + { + "bbox": [ + 105, + 315, + 353, + 328 + ], + "score": 1.0, + "content": "program [6] or a conic program [2]. Another example is when", + "type": "text" + }, + { + "bbox": [ + 353, + 315, + 377, + 327 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 315, + 506, + 328 + ], + "score": 1.0, + "content": "is used as the output of a neural", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 326, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 86, + 328, + 100, + 338 + ], + "score": 1.0, + "content": "130", + "type": "text" + }, + { + "bbox": [ + 105, + 326, + 227, + 338 + ], + "score": 1.0, + "content": "network layer, in which case", + "type": "text" + }, + { + "bbox": [ + 227, + 327, + 234, + 336 + ], + "score": 0.78, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 326, + 420, + 338 + ], + "score": 1.0, + "content": "is produced by the previous layer. Likewise,", + "type": "text" + }, + { + "bbox": [ + 421, + 326, + 445, + 338 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 326, + 506, + 338 + ], + "score": 1.0, + "content": "will often not", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 337, + 506, + 349 + ], + "spans": [ + { + "bbox": [ + 86, + 339, + 99, + 349 + ], + "score": 1.0, + "content": "131", + "type": "text" + }, + { + "bbox": [ + 105, + 337, + 470, + 349 + ], + "score": 1.0, + "content": "be the final output we want to differentiate. One example of such post-processing is when", + "type": "text" + }, + { + "bbox": [ + 470, + 337, + 494, + 349 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 337, + 506, + 349 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 86, + 350, + 100, + 360 + ], + "score": 1.0, + "content": "132", + "type": "text" + }, + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "the solution of a dual program and we apply the dual-primal mapping to recover the solution of the", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 359, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 86, + 361, + 100, + 371 + ], + "score": 1.0, + "content": "133", + "type": "text" + }, + { + "bbox": [ + 105, + 359, + 462, + 371 + ], + "score": 1.0, + "content": "primal program. Another example is the application of a loss function, in order to reduce", + "type": "text" + }, + { + "bbox": [ + 462, + 359, + 486, + 371 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 359, + 506, + 371 + ], + "score": 1.0, + "content": "to a", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 86, + 371, + 100, + 381 + ], + "score": 1.0, + "content": "134", + "type": "text" + }, + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "scalar value. In all these cases, we leave the differentiation of the pre/post-processing mappings to", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 380, + 396, + 394 + ], + "spans": [ + { + "bbox": [ + 86, + 383, + 100, + 393 + ], + "score": 1.0, + "content": "135", + "type": "text" + }, + { + "bbox": [ + 105, + 380, + 396, + 394 + ], + "score": 1.0, + "content": "the autodiff system, allowing us to compose functions in complex ways.", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 403, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 86, + 405, + 100, + 415 + ], + "score": 1.0, + "content": "136", + "type": "text" + }, + { + "bbox": [ + 106, + 403, + 505, + 415 + ], + "score": 1.0, + "content": "Usage and implementation details. Our implementation is based on JAX [17, 34]. JAX’s autodiff", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 413, + 506, + 427 + ], + "spans": [ + { + "bbox": [ + 86, + 416, + 99, + 425 + ], + "score": 1.0, + "content": "137", + "type": "text" + }, + { + "bbox": [ + 105, + 413, + 506, + 427 + ], + "score": 1.0, + "content": "features enter the picture in at least two ways: (i) we lean heavily on JAX within our implementation,", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 423, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 86, + 427, + 99, + 436 + ], + "score": 1.0, + "content": "138", + "type": "text" + }, + { + "bbox": [ + 105, + 423, + 506, + 439 + ], + "score": 1.0, + "content": "and (ii) we integrate the differentiation routines introduced by our framework into JAX’s existing", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 434, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 86, + 438, + 100, + 448 + ], + "score": 1.0, + "content": "139", + "type": "text" + }, + { + "bbox": [ + 105, + 434, + 506, + 450 + ], + "score": 1.0, + "content": "autodiff system. In doing the latter, we override JAX’s default autodiff behavior (e.g. of differentiating", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 447, + 355, + 459 + ], + "spans": [ + { + "bbox": [ + 86, + 449, + 99, + 458 + ], + "score": 1.0, + "content": "140", + "type": "text" + }, + { + "bbox": [ + 105, + 447, + 355, + 459 + ], + "score": 1.0, + "content": "transparently through an iterative solver’s unrolled iterations).", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 86, + 465, + 99, + 475 + ], + "score": 1.0, + "content": "141", + "type": "text" + }, + { + "bbox": [ + 105, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "We delineate here what features are needed from an autodiff system to implement our proposed", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 474, + 506, + 486 + ], + "spans": [ + { + "bbox": [ + 86, + 475, + 100, + 486 + ], + "score": 1.0, + "content": "142", + "type": "text" + }, + { + "bbox": [ + 105, + 474, + 320, + 486 + ], + "score": 1.0, + "content": "framework. As mentioned, we only need access to", + "type": "text" + }, + { + "bbox": [ + 321, + 475, + 330, + 484 + ], + "score": 0.81, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 474, + 445, + 486 + ], + "score": 1.0, + "content": "through the JVP or VJP of", + "type": "text" + }, + { + "bbox": [ + 446, + 474, + 465, + 485 + ], + "score": 0.91, + "content": "\\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 474, + 484, + 486 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 484, + 474, + 503, + 485 + ], + "score": 0.9, + "content": "\\partial _ { 2 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 474, + 506, + 486 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 484, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 86, + 487, + 99, + 496 + ], + "score": 1.0, + "content": "143", + "type": "text" + }, + { + "bbox": [ + 105, + 484, + 199, + 498 + ], + "score": 1.0, + "content": "Since the definition of", + "type": "text" + }, + { + "bbox": [ + 200, + 486, + 209, + 495 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 484, + 365, + 498 + ], + "score": 1.0, + "content": "will often include a gradient mapping", + "type": "text" + }, + { + "bbox": [ + 366, + 485, + 408, + 497 + ], + "score": 0.93, + "content": "\\nabla _ { 1 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 484, + 480, + 498 + ], + "score": 1.0, + "content": "(see examples in", + "type": "text" + }, + { + "bbox": [ + 480, + 486, + 500, + 496 + ], + "score": 0.79, + "content": "\\ S 2 . 2 \\AA ,", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 484, + 506, + 498 + ], + "score": 1.0, + "content": "),", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 495, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 86, + 498, + 100, + 507 + ], + "score": 1.0, + "content": "144", + "type": "text" + }, + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "score": 1.0, + "content": "second-order derivatives need also be supported. Our library provides two decorators, custom_root", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 506, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 86, + 509, + 100, + 519 + ], + "score": 1.0, + "content": "145", + "type": "text" + }, + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "score": 1.0, + "content": "and custom_fixed_point, for adding implicit differentiation on top of a solver, given optimality", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 86, + 520, + 100, + 529 + ], + "score": 1.0, + "content": "146", + "type": "text" + }, + { + "bbox": [ + 106, + 518, + 151, + 530 + ], + "score": 1.0, + "content": "conditions", + "type": "text" + }, + { + "bbox": [ + 152, + 518, + 161, + 528 + ], + "score": 0.84, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 518, + 256, + 530 + ], + "score": 1.0, + "content": "or fixed point iteration", + "type": "text" + }, + { + "bbox": [ + 257, + 518, + 265, + 528 + ], + "score": 0.76, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 518, + 505, + 530 + ], + "score": 1.0, + "content": ". This functionality requires the ability to add custom JVP", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 528, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 86, + 530, + 100, + 541 + ], + "score": 1.0, + "content": "147", + "type": "text" + }, + { + "bbox": [ + 105, + 528, + 506, + 542 + ], + "score": 1.0, + "content": "and/or VJP to a function. All these features are supported by recent autodiff systems, including JAX", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 86, + 542, + 99, + 551 + ], + "score": 1.0, + "content": "148", + "type": "text" + }, + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "[17], TensorFlow [1] and PyTorch [56]. Our implementation, made in JAX, also uses JAX-specific", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 548, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 86, + 552, + 99, + 562 + ], + "score": 1.0, + "content": "149", + "type": "text" + }, + { + "bbox": [ + 104, + 548, + 360, + 565 + ], + "score": 1.0, + "content": "features. We make extensive use of automatic batching with", + "type": "text" + }, + { + "bbox": [ + 361, + 551, + 403, + 562 + ], + "score": 0.32, + "content": "{ \\mathrm { j a x . v m a p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 548, + 506, + 565 + ], + "score": 1.0, + "content": ", JAX’s vectorizing map", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 559, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 86, + 563, + 100, + 574 + ], + "score": 1.0, + "content": "150", + "type": "text" + }, + { + "bbox": [ + 105, + 559, + 328, + 575 + ], + "score": 1.0, + "content": "transformation. In order to solve the normal equation", + "type": "text" + }, + { + "bbox": [ + 328, + 561, + 384, + 572 + ], + "score": 0.9, + "content": "{ \\bar { A } } A ^ { \\top } u \\stackrel { = } { = } A v", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 559, + 506, + 575 + ], + "score": 1.0, + "content": ", we also use JAX’s ability to", + "type": "text" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 572, + 407, + 586 + ], + "spans": [ + { + "bbox": [ + 86, + 575, + 99, + 584 + ], + "score": 1.0, + "content": "151", + "type": "text" + }, + { + "bbox": [ + 105, + 572, + 407, + 586 + ], + "score": 1.0, + "content": "automatically transpose a linear map using jax.linear_transpose [33].", + "type": "text" + } + ], + "index": 42, + "is_list_start_line": true + } + ], + "index": 3, + "bbox_fs": [ + 85, + 72, + 506, + 150 + ] + }, + { + "type": "index", + "bbox": [ + 86, + 154, + 505, + 212 + ], + "lines": [], + "index": 9, + "bbox_fs": [ + 85, + 154, + 505, + 213 + ], + "lines_deleted": true + }, + { + "type": "index", + "bbox": [ + 86, + 217, + 505, + 272 + ], + "lines": [], + "index": 14, + "bbox_fs": [ + 85, + 216, + 506, + 273 + ], + "lines_deleted": true + }, + { + "type": "index", + "bbox": [ + 87, + 283, + 505, + 393 + ], + "lines": [], + "index": 21.5, + "bbox_fs": [ + 86, + 283, + 506, + 394 + ], + "lines_deleted": true + }, + { + "type": "index", + "bbox": [ + 87, + 403, + 505, + 458 + ], + "lines": [], + "index": 29, + "bbox_fs": [ + 86, + 403, + 506, + 459 + ], + "lines_deleted": true + }, + { + "type": "index", + "bbox": [ + 87, + 463, + 505, + 584 + ], + "lines": [], + "index": 37, + "bbox_fs": [ + 86, + 463, + 506, + 586 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 596, + 172, + 607 + ], + "lines": [ + { + "bbox": [ + 105, + 593, + 173, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 173, + 610 + ], + "score": 1.0, + "content": "2.2 Examples", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 106, + 615, + 505, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 279, + 629 + ], + "score": 1.0, + "content": "We now give various examples of mapping", + "type": "text" + }, + { + "bbox": [ + 279, + 617, + 289, + 626 + ], + "score": 0.82, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 615, + 381, + 629 + ], + "score": 1.0, + "content": "or fixed point iteration", + "type": "text" + }, + { + "bbox": [ + 381, + 617, + 389, + 626 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 615, + 506, + 629 + ], + "score": 1.0, + "content": ", recovering existing implicit", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 356, + 639 + ], + "score": 1.0, + "content": "differentiation methods and creating new ones. Each choice of", + "type": "text" + }, + { + "bbox": [ + 356, + 627, + 365, + 637 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 627, + 376, + 639 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 377, + 627, + 385, + 637 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "implies different trade-offs in", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 638, + 481, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 481, + 650 + ], + "score": 1.0, + "content": "terms of computational oracles; see Table 1. Source code examples are given in Appendix A.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 615, + 506, + 650 + ] + }, + { + "type": "text", + "bbox": [ + 97, + 660, + 504, + 672 + ], + "lines": [ + { + "bbox": [ + 93, + 658, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 93, + 658, + 505, + 675 + ], + "score": 1.0, + "content": "56 Stationary point condition. The simplest example is to differentiate through the implicit function", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47, + "bbox_fs": [ + 93, + 658, + 505, + 675 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 254, + 673, + 356, + 694 + ], + "lines": [ + { + "bbox": [ + 254, + 673, + 356, + 694 + ], + "spans": [ + { + "bbox": [ + 254, + 673, + 356, + 694 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta ) = \\operatorname * { a r g m i n } _ { x \\in \\mathbb { R } ^ { d } } f ( x , \\theta ) ,", + "type": "interline_equation", + "image_path": "b6188a6a7c9a596b50fc8852bc4ccc0f4d16f5bf1e6daa08a88ba4243cf2e32f.jpg" + } + ] + } + ], + "index": 48, + "virtual_lines": [ + { + "bbox": [ + 254, + 673, + 356, + 694 + ], + "spans": [], + "index": 48 + } + ] + }, + { + "type": "text", + "bbox": [ + 88, + 696, + 487, + 709 + ], + "lines": [ + { + "bbox": [ + 84, + 694, + 487, + 712 + ], + "spans": [ + { + "bbox": [ + 84, + 694, + 133, + 712 + ], + "score": 1.0, + "content": "where 157", + "type": "text" + }, + { + "bbox": [ + 133, + 696, + 207, + 709 + ], + "score": 0.92, + "content": "f \\colon { \\mathbb { R } ^ { d } } \\times { \\mathbb { R } ^ { n } } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 694, + 350, + 712 + ], + "score": 1.0, + "content": "is twice differentiable. In this case,", + "type": "text" + }, + { + "bbox": [ + 350, + 698, + 359, + 707 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 694, + 487, + 712 + ], + "score": 1.0, + "content": "is simply the gradient mapping", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 49, + "bbox_fs": [ + 84, + 694, + 487, + 712 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 260, + 709, + 350, + 723 + ], + "lines": [ + { + "bbox": [ + 260, + 709, + 350, + 723 + ], + "spans": [ + { + "bbox": [ + 260, + 709, + 350, + 723 + ], + "score": 0.89, + "content": "F ( x , \\theta ) = \\nabla _ { 1 } f ( x , \\theta ) .", + "type": "interline_equation", + "image_path": "fb95590bd657f30e56a390a2486618317cd1509a18dbdc55625d4d514240b602.jpg" + } + ] + } + ], + "index": 50, + "virtual_lines": [ + { + "bbox": [ + 260, + 709, + 350, + 723 + ], + "spans": [], + "index": 50 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 125, + 93, + 486, + 208 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 77, + 504, + 90 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 76, + 505, + 91 + ], + "spans": [ + { + "bbox": [ + 106, + 76, + 505, + 91 + ], + "score": 1.0, + "content": "Table 1: Summary of optimality condition mappings. Oracles are accessed through their JVP or VJP.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 125, + 93, + 486, + 208 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 125, + 93, + 486, + 208 + ], + "spans": [ + { + "bbox": [ + 125, + 93, + 486, + 208 + ], + "score": 0.984, + "html": "
NameEquationSolution neededOracles needed
Stationary(4), (5)PrimalVif
KKT(6)Primal and dualVif,H,G,δH,δG
Proximal gradient(7)PrimalVif,proxng
Projected gradient(9)PrimalVif,projc
Mirror descent(11)PrimalV1f,proje,
Newton(15)Primal[V²f(x,0)]-1,Vif(x,0)
Block proximal gradient(16)Primal[Vif]j,[proXnglj
Conic programming(20)Residual map rootprojRp ×K* ×R+
", + "type": "table", + "image_path": "92818729040824c8d9ac6081b7c655d31a444d9cdda75c9a80e98036dfe79dcf.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 125, + 93, + 486, + 131.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 125, + 131.33333333333334, + 486, + 169.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 125, + 169.66666666666669, + 486, + 208.00000000000003 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "text", + "bbox": [ + 87, + 231, + 505, + 266 + ], + "lines": [ + { + "bbox": [ + 87, + 231, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 87, + 234, + 100, + 243 + ], + "score": 1.0, + "content": "158", + "type": "text" + }, + { + "bbox": [ + 103, + 231, + 164, + 245 + ], + "score": 1.0, + "content": "We then have", + "type": "text" + }, + { + "bbox": [ + 164, + 231, + 262, + 244 + ], + "score": 0.93, + "content": "\\partial _ { 1 } F ( x , \\theta ) = \\nabla _ { 1 } ^ { 2 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 231, + 281, + 245 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 281, + 232, + 388, + 244 + ], + "score": 0.92, + "content": "\\partial _ { 2 } F ( x , \\theta ) = \\partial _ { 2 } \\nabla _ { 1 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 231, + 455, + 245 + ], + "score": 1.0, + "content": ", the Hessian of", + "type": "text" + }, + { + "bbox": [ + 455, + 233, + 462, + 244 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 231, + 506, + 245 + ], + "score": 1.0, + "content": "in its first", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 87, + 243, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 87, + 246, + 99, + 254 + ], + "score": 1.0, + "content": "159", + "type": "text" + }, + { + "bbox": [ + 105, + 243, + 330, + 255 + ], + "score": 1.0, + "content": "argument and the Jacobian in the second argument of", + "type": "text" + }, + { + "bbox": [ + 330, + 244, + 372, + 255 + ], + "score": 0.92, + "content": "\\nabla _ { 1 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 243, + 505, + 255 + ], + "score": 1.0, + "content": ". In practice, we use autodiff to", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 86, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 86, + 257, + 100, + 266 + ], + "score": 1.0, + "content": "160", + "type": "text" + }, + { + "bbox": [ + 104, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "compute Jacobian products automatically. Equivalently, we can use the gradient descent fixed point", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 248, + 270, + 361, + 284 + ], + "lines": [ + { + "bbox": [ + 248, + 270, + 361, + 284 + ], + "spans": [ + { + "bbox": [ + 248, + 270, + 361, + 284 + ], + "score": 0.92, + "content": "T ( x , \\theta ) = x - \\eta \\nabla _ { 1 } f ( x , \\theta ) ,", + "type": "interline_equation", + "image_path": "4a2568542c9094dc9999a54b77ab0f3951fb90ef12b03f0894ba673a03eef64a.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 248, + 270, + 361, + 284 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 89, + 287, + 508, + 310 + ], + "lines": [ + { + "bbox": [ + 84, + 286, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 84, + 286, + 221, + 300 + ], + "score": 1.0, + "content": "161 which holds for all step sizes", + "type": "text" + }, + { + "bbox": [ + 221, + 288, + 246, + 299 + ], + "score": 0.9, + "content": "\\eta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 286, + 506, + 300 + ], + "score": 1.0, + "content": ". Using (3), it is easy to verify that we end up with the same linear", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 85, + 299, + 216, + 310 + ], + "spans": [ + { + "bbox": [ + 85, + 299, + 159, + 310 + ], + "score": 1.0, + "content": "162 system since", + "type": "text" + }, + { + "bbox": [ + 160, + 300, + 166, + 310 + ], + "score": 0.79, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 299, + 216, + 310 + ], + "score": 1.0, + "content": "cancels out.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 90, + 320, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 89, + 321, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 89, + 324, + 100, + 332 + ], + "score": 1.0, + "content": "163", + "type": "text" + }, + { + "bbox": [ + 106, + 321, + 505, + 332 + ], + "score": 1.0, + "content": "KKT conditions. We now show that the KKT conditions, manually differentiated in several works", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 89, + 331, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 89, + 334, + 100, + 343 + ], + "score": 1.0, + "content": "164", + "type": "text" + }, + { + "bbox": [ + 106, + 331, + 505, + 344 + ], + "score": 1.0, + "content": "[19, 35, 6, 53, 52], fit our framework. As we will see, the key will be to group the optimal primal and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 90, + 342, + 365, + 356 + ], + "spans": [ + { + "bbox": [ + 90, + 345, + 101, + 354 + ], + "score": 1.0, + "content": "65", + "type": "text" + }, + { + "bbox": [ + 104, + 342, + 191, + 356 + ], + "score": 1.0, + "content": "dual variables as our", + "type": "text" + }, + { + "bbox": [ + 191, + 343, + 215, + 355 + ], + "score": 0.91, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 342, + 365, + 356 + ], + "score": 1.0, + "content": ". Let us consider the general problem", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 358, + 419, + 379 + ], + "lines": [ + { + "bbox": [ + 190, + 358, + 419, + 379 + ], + "spans": [ + { + "bbox": [ + 190, + 358, + 419, + 379 + ], + "score": 0.9, + "content": "\\operatorname { a r g m i n } _ { z \\in \\mathbb { R } ^ { p } } f ( z , \\theta ) \\quad { \\mathrm { s u b j e c t ~ t o } } \\quad G ( z , \\theta ) \\leq 0 , \\ H ( z , \\theta ) = 0 ,", + "type": "interline_equation", + "image_path": "eab93968d700bce30435f471dfbff1d3d1392d65707998bdbafa92e7cfbbffdc.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 190, + 358, + 419, + 379 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 381, + 505, + 406 + ], + "lines": [ + { + "bbox": [ + 84, + 382, + 503, + 394 + ], + "spans": [ + { + "bbox": [ + 84, + 382, + 132, + 394 + ], + "score": 1.0, + "content": "where166", + "type": "text" + }, + { + "bbox": [ + 132, + 383, + 162, + 393 + ], + "score": 0.9, + "content": "z \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 382, + 251, + 394 + ], + "score": 1.0, + "content": "is the primal variable,", + "type": "text" + }, + { + "bbox": [ + 251, + 383, + 323, + 394 + ], + "score": 0.75, + "content": "f \\colon { \\mathbb { R } } ^ { p } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 382, + 327, + 394 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 327, + 383, + 405, + 393 + ], + "score": 0.86, + "content": "G \\colon \\mathbb { R } ^ { p } \\times \\mathbb { R } ^ { n } \\to \\mathbb { R } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 382, + 423, + 394 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 423, + 383, + 503, + 393 + ], + "score": 0.89, + "content": "H \\colon \\mathbb { R } ^ { p } \\times \\mathbb { R } ^ { n } \\to \\mathbb { R } ^ { q }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 84, + 394, + 429, + 407 + ], + "spans": [ + { + "bbox": [ + 84, + 394, + 429, + 407 + ], + "score": 1.0, + "content": "167 The stationarity, primal feasibility and complementary slackness conditions give", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 408, + 408, + 454 + ], + "lines": [ + { + "bbox": [ + 203, + 408, + 408, + 454 + ], + "spans": [ + { + "bbox": [ + 203, + 408, + 408, + 454 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\nabla _ { 1 } f ( z , \\theta ) + \\left[ \\partial _ { 1 } G ( z , \\theta ) \\right] ^ { \\top } \\boldsymbol { \\lambda } + \\left[ \\partial _ { 1 } H ( z , \\theta ) \\right] ^ { \\top } \\boldsymbol { \\nu } = 0 } \\\\ { H ( z , \\theta ) = 0 } \\\\ { \\boldsymbol { \\lambda } \\circ G ( z , \\theta ) = 0 , } \\end{array}", + "type": "interline_equation", + "image_path": "f51428dc8ea9e213a482c787fc5040608d86096761fc257f08e96afe82f857bb.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 203, + 408, + 408, + 423.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 203, + 423.3333333333333, + 408, + 438.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 203, + 438.66666666666663, + 408, + 453.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 87, + 455, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 86, + 456, + 505, + 468 + ], + "spans": [ + { + "bbox": [ + 86, + 458, + 100, + 467 + ], + "score": 1.0, + "content": "168", + "type": "text" + }, + { + "bbox": [ + 106, + 456, + 133, + 467 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 456, + 165, + 466 + ], + "score": 0.91, + "content": "\\nu \\in \\mathbb { R } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 456, + 183, + 467 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 184, + 456, + 217, + 468 + ], + "score": 0.92, + "content": "\\lambda \\in \\mathbb { R } _ { + } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 456, + 505, + 467 + ], + "score": 1.0, + "content": "are the dual variables, also known as KKT multipliers. The system of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 86, + 466, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 86, + 468, + 100, + 479 + ], + "score": 1.0, + "content": "169", + "type": "text" + }, + { + "bbox": [ + 105, + 466, + 506, + 479 + ], + "score": 1.0, + "content": "(potentially nonlinear) equations (6) fits our framework, as we can group the primal and dual solutions", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 86, + 476, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 86, + 479, + 100, + 490 + ], + "score": 1.0, + "content": "170", + "type": "text" + }, + { + "bbox": [ + 105, + 476, + 117, + 491 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 118, + 478, + 239, + 490 + ], + "score": 0.9, + "content": "x ^ { \\star } ( \\theta ) = ( z ^ { \\star } ( \\theta ) , \\nu ^ { \\star } ( \\theta ) , \\lambda ^ { \\star } ( \\theta ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 476, + 359, + 491 + ], + "score": 1.0, + "content": "to form the root of a function", + "type": "text" + }, + { + "bbox": [ + 359, + 478, + 407, + 490 + ], + "score": 0.93, + "content": "F ( x ^ { \\star } ( \\theta ) , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 476, + 438, + 491 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 438, + 477, + 505, + 488 + ], + "score": 0.9, + "content": "F \\colon \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } ", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 86, + 487, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 86, + 491, + 100, + 501 + ], + "score": 1.0, + "content": "171", + "type": "text" + }, + { + "bbox": [ + 106, + 489, + 119, + 500 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 487, + 137, + 504 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 138, + 491, + 196, + 501 + ], + "score": 0.91, + "content": "d = p + q + r", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 487, + 506, + 504 + ], + "score": 1.0, + "content": ". The primal and dual solutions can be obtained from a generic solver, such as", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 86, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 86, + 502, + 100, + 512 + ], + "score": 1.0, + "content": "172", + "type": "text" + }, + { + "bbox": [ + 105, + 500, + 338, + 513 + ], + "score": 1.0, + "content": "an interior point method. In practice, the above mapping", + "type": "text" + }, + { + "bbox": [ + 338, + 501, + 347, + 510 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "will be defined directly in Python (see", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 86, + 511, + 428, + 523 + ], + "spans": [ + { + "bbox": [ + 86, + 513, + 100, + 523 + ], + "score": 1.0, + "content": "173", + "type": "text" + }, + { + "bbox": [ + 105, + 511, + 224, + 523 + ], + "score": 1.0, + "content": "Figure 6 in Appendix A) and", + "type": "text" + }, + { + "bbox": [ + 225, + 512, + 234, + 521 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 511, + 428, + 523 + ], + "score": 1.0, + "content": "will be differentiated automatically via autodiff.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 87, + 534, + 506, + 568 + ], + "lines": [ + { + "bbox": [ + 86, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 86, + 536, + 100, + 545 + ], + "score": 1.0, + "content": "174", + "type": "text" + }, + { + "bbox": [ + 104, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "Proximal gradient fixed point. Unfortunately, not all algorithms return both primal and dual", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 87, + 545, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 87, + 548, + 100, + 556 + ], + "score": 1.0, + "content": "175", + "type": "text" + }, + { + "bbox": [ + 105, + 545, + 505, + 558 + ], + "score": 1.0, + "content": "solutions. Moreover, if the objective contains non-smooth terms, proximal gradient descent may be", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 86, + 556, + 431, + 569 + ], + "spans": [ + { + "bbox": [ + 86, + 558, + 100, + 568 + ], + "score": 1.0, + "content": "176", + "type": "text" + }, + { + "bbox": [ + 105, + 556, + 309, + 569 + ], + "score": 1.0, + "content": "more efficient. We now discuss its fixed point. Let", + "type": "text" + }, + { + "bbox": [ + 310, + 556, + 334, + 568 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 556, + 431, + 569 + ], + "score": 1.0, + "content": "be implicitly defined as", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 571, + 377, + 593 + ], + "lines": [ + { + "bbox": [ + 233, + 571, + 377, + 593 + ], + "spans": [ + { + "bbox": [ + 233, + 571, + 377, + 593 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta ) : = \\operatornamewithlimits { a r g m i n } _ { x \\in \\mathbb { R } ^ { d } } f ( x , \\theta ) + g ( x , \\theta ) ,", + "type": "interline_equation", + "image_path": "2e4230919f90ed7ed51be288843b00db88b4c661b11d934b7a8081ce3f1c4c90.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 233, + 571, + 377, + 593 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 88, + 597, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 86, + 596, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 86, + 596, + 133, + 612 + ], + "score": 1.0, + "content": "where 177", + "type": "text" + }, + { + "bbox": [ + 133, + 597, + 206, + 610 + ], + "score": 0.92, + "content": "f \\colon { \\mathbb { R } ^ { d } } \\times { \\mathbb { R } ^ { n } } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 596, + 343, + 612 + ], + "score": 1.0, + "content": "is twice-differentiable convex and", + "type": "text" + }, + { + "bbox": [ + 343, + 597, + 415, + 609 + ], + "score": 0.91, + "content": "g \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 596, + 505, + 612 + ], + "score": 1.0, + "content": "is convex but possibly", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 84, + 609, + 389, + 622 + ], + "spans": [ + { + "bbox": [ + 84, + 609, + 369, + 622 + ], + "score": 1.0, + "content": "178 non-smooth. Let us define the proximity operator associated with", + "type": "text" + }, + { + "bbox": [ + 370, + 612, + 376, + 621 + ], + "score": 0.81, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 609, + 389, + 622 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "interline_equation", + "bbox": [ + 213, + 624, + 397, + 651 + ], + "lines": [ + { + "bbox": [ + 213, + 624, + 397, + 651 + ], + "spans": [ + { + "bbox": [ + 213, + 624, + 397, + 651 + ], + "score": 0.94, + "content": "\\operatorname { p r o x } _ { g } ( y , \\theta ) : = \\underset { x \\in \\mathbb { R } ^ { d } } { \\operatorname { a r g m i n } } \\frac { 1 } { 2 } \\| x - y \\| _ { 2 } ^ { 2 } + g ( x , \\theta ) .", + "type": "interline_equation", + "image_path": "7e620cbfca8df53ee6d254fd7e1544917ffbf8fedcfd59918e6eab8ecb36240d.jpg" + } + ] + } + ], + "index": 31.5, + "virtual_lines": [ + { + "bbox": [ + 213, + 624, + 397, + 637.5 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 213, + 637.5, + 397, + 651.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 655, + 447, + 668 + ], + "lines": [ + { + "bbox": [ + 84, + 654, + 447, + 670 + ], + "spans": [ + { + "bbox": [ + 84, + 654, + 245, + 670 + ], + "score": 1.0, + "content": "To implicitly differentiate through 179", + "type": "text" + }, + { + "bbox": [ + 245, + 656, + 268, + 668 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 654, + 447, + 670 + ], + "score": 1.0, + "content": ", we use the fixed point mapping [55, p.150]", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 671, + 384, + 686 + ], + "lines": [ + { + "bbox": [ + 226, + 671, + 384, + 686 + ], + "spans": [ + { + "bbox": [ + 226, + 671, + 384, + 686 + ], + "score": 0.92, + "content": "T ( x , \\theta ) = \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) ,", + "type": "interline_equation", + "image_path": "d9127dfd0fa20c31c543a2a1122bbff9fd774a71fd22a8ac2eee7a2b5c1014ff.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 226, + 671, + 384, + 686 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 87, + 689, + 505, + 723 + ], + "lines": [ + { + "bbox": [ + 87, + 688, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 87, + 691, + 100, + 700 + ], + "score": 1.0, + "content": "180", + "type": "text" + }, + { + "bbox": [ + 104, + 688, + 175, + 702 + ], + "score": 1.0, + "content": "for any step size", + "type": "text" + }, + { + "bbox": [ + 175, + 690, + 200, + 700 + ], + "score": 0.91, + "content": "\\eta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 688, + 506, + 702 + ], + "score": 1.0, + "content": ". The proximity operator is 1-Lipschitz continuous [50]. By Rademacher’s", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 86, + 699, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 86, + 702, + 99, + 711 + ], + "score": 1.0, + "content": "181", + "type": "text" + }, + { + "bbox": [ + 105, + 699, + 506, + 713 + ], + "score": 1.0, + "content": "theorem, it is differentiable almost everywhere. Many proximity operators enjoy a closed form and", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 87, + 711, + 334, + 723 + ], + "spans": [ + { + "bbox": [ + 87, + 713, + 100, + 722 + ], + "score": 1.0, + "content": "182", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 322, + 723 + ], + "score": 1.0, + "content": "can easily be differentiated, as discussed in Appendix", + "type": "text" + }, + { + "bbox": [ + 322, + 712, + 330, + 721 + ], + "score": 0.25, + "content": "\\mathbf { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 711, + 334, + 723 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + } + ], + "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": "table", + "bbox": [ + 125, + 93, + 486, + 208 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 77, + 504, + 90 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 76, + 505, + 91 + ], + "spans": [ + { + "bbox": [ + 106, + 76, + 505, + 91 + ], + "score": 1.0, + "content": "Table 1: Summary of optimality condition mappings. Oracles are accessed through their JVP or VJP.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 125, + 93, + 486, + 208 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 125, + 93, + 486, + 208 + ], + "spans": [ + { + "bbox": [ + 125, + 93, + 486, + 208 + ], + "score": 0.984, + "html": "
NameEquationSolution neededOracles needed
Stationary(4), (5)PrimalVif
KKT(6)Primal and dualVif,H,G,δH,δG
Proximal gradient(7)PrimalVif,proxng
Projected gradient(9)PrimalVif,projc
Mirror descent(11)PrimalV1f,proje,
Newton(15)Primal[V²f(x,0)]-1,Vif(x,0)
Block proximal gradient(16)Primal[Vif]j,[proXnglj
Conic programming(20)Residual map rootprojRp ×K* ×R+
", + "type": "table", + "image_path": "92818729040824c8d9ac6081b7c655d31a444d9cdda75c9a80e98036dfe79dcf.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 125, + 93, + 486, + 131.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 125, + 131.33333333333334, + 486, + 169.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 125, + 169.66666666666669, + 486, + 208.00000000000003 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "index", + "bbox": [ + 87, + 231, + 505, + 266 + ], + "lines": [ + { + "bbox": [ + 87, + 231, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 87, + 234, + 100, + 243 + ], + "score": 1.0, + "content": "158", + "type": "text" + }, + { + "bbox": [ + 103, + 231, + 164, + 245 + ], + "score": 1.0, + "content": "We then have", + "type": "text" + }, + { + "bbox": [ + 164, + 231, + 262, + 244 + ], + "score": 0.93, + "content": "\\partial _ { 1 } F ( x , \\theta ) = \\nabla _ { 1 } ^ { 2 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 231, + 281, + 245 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 281, + 232, + 388, + 244 + ], + "score": 0.92, + "content": "\\partial _ { 2 } F ( x , \\theta ) = \\partial _ { 2 } \\nabla _ { 1 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 231, + 455, + 245 + ], + "score": 1.0, + "content": ", the Hessian of", + "type": "text" + }, + { + "bbox": [ + 455, + 233, + 462, + 244 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 231, + 506, + 245 + ], + "score": 1.0, + "content": "in its first", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 87, + 243, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 87, + 246, + 99, + 254 + ], + "score": 1.0, + "content": "159", + "type": "text" + }, + { + "bbox": [ + 105, + 243, + 330, + 255 + ], + "score": 1.0, + "content": "argument and the Jacobian in the second argument of", + "type": "text" + }, + { + "bbox": [ + 330, + 244, + 372, + 255 + ], + "score": 0.92, + "content": "\\nabla _ { 1 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 243, + 505, + 255 + ], + "score": 1.0, + "content": ". In practice, we use autodiff to", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 86, + 257, + 100, + 266 + ], + "score": 1.0, + "content": "160", + "type": "text" + }, + { + "bbox": [ + 104, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "compute Jacobian products automatically. Equivalently, we can use the gradient descent fixed point", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + } + ], + "index": 5, + "bbox_fs": [ + 86, + 231, + 506, + 267 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 248, + 270, + 361, + 284 + ], + "lines": [ + { + "bbox": [ + 248, + 270, + 361, + 284 + ], + "spans": [ + { + "bbox": [ + 248, + 270, + 361, + 284 + ], + "score": 0.92, + "content": "T ( x , \\theta ) = x - \\eta \\nabla _ { 1 } f ( x , \\theta ) ,", + "type": "interline_equation", + "image_path": "4a2568542c9094dc9999a54b77ab0f3951fb90ef12b03f0894ba673a03eef64a.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 248, + 270, + 361, + 284 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "index", + "bbox": [ + 89, + 287, + 508, + 310 + ], + "lines": [ + { + "bbox": [ + 84, + 286, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 84, + 286, + 221, + 300 + ], + "score": 1.0, + "content": "161 which holds for all step sizes", + "type": "text" + }, + { + "bbox": [ + 221, + 288, + 246, + 299 + ], + "score": 0.9, + "content": "\\eta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 286, + 506, + 300 + ], + "score": 1.0, + "content": ". Using (3), it is easy to verify that we end up with the same linear", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 299, + 216, + 310 + ], + "spans": [ + { + "bbox": [ + 85, + 299, + 159, + 310 + ], + "score": 1.0, + "content": "162 system since", + "type": "text" + }, + { + "bbox": [ + 160, + 300, + 166, + 310 + ], + "score": 0.79, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 299, + 216, + 310 + ], + "score": 1.0, + "content": "cancels out.", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 321, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 89, + 324, + 100, + 332 + ], + "score": 1.0, + "content": "163", + "type": "text" + }, + { + "bbox": [ + 106, + 321, + 505, + 332 + ], + "score": 1.0, + "content": "KKT conditions. We now show that the KKT conditions, manually differentiated in several works", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 331, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 89, + 334, + 100, + 343 + ], + "score": 1.0, + "content": "164", + "type": "text" + }, + { + "bbox": [ + 106, + 331, + 505, + 344 + ], + "score": 1.0, + "content": "[19, 35, 6, 53, 52], fit our framework. As we will see, the key will be to group the optimal primal and", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 90, + 342, + 365, + 356 + ], + "spans": [ + { + "bbox": [ + 90, + 345, + 101, + 354 + ], + "score": 1.0, + "content": "65", + "type": "text" + }, + { + "bbox": [ + 104, + 342, + 191, + 356 + ], + "score": 1.0, + "content": "dual variables as our", + "type": "text" + }, + { + "bbox": [ + 191, + 343, + 215, + 355 + ], + "score": 0.91, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 342, + 365, + 356 + ], + "score": 1.0, + "content": ". Let us consider the general problem", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + } + ], + "index": 8.5, + "bbox_fs": [ + 84, + 286, + 506, + 310 + ] + }, + { + "type": "index", + "bbox": [ + 90, + 320, + 505, + 354 + ], + "lines": [], + "index": 11, + "bbox_fs": [ + 89, + 321, + 505, + 356 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 358, + 419, + 379 + ], + "lines": [ + { + "bbox": [ + 190, + 358, + 419, + 379 + ], + "spans": [ + { + "bbox": [ + 190, + 358, + 419, + 379 + ], + "score": 0.9, + "content": "\\operatorname { a r g m i n } _ { z \\in \\mathbb { R } ^ { p } } f ( z , \\theta ) \\quad { \\mathrm { s u b j e c t ~ t o } } \\quad G ( z , \\theta ) \\leq 0 , \\ H ( z , \\theta ) = 0 ,", + "type": "interline_equation", + "image_path": "eab93968d700bce30435f471dfbff1d3d1392d65707998bdbafa92e7cfbbffdc.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 190, + 358, + 419, + 379 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 381, + 505, + 406 + ], + "lines": [ + { + "bbox": [ + 84, + 382, + 503, + 394 + ], + "spans": [ + { + "bbox": [ + 84, + 382, + 132, + 394 + ], + "score": 1.0, + "content": "where166", + "type": "text" + }, + { + "bbox": [ + 132, + 383, + 162, + 393 + ], + "score": 0.9, + "content": "z \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 382, + 251, + 394 + ], + "score": 1.0, + "content": "is the primal variable,", + "type": "text" + }, + { + "bbox": [ + 251, + 383, + 323, + 394 + ], + "score": 0.75, + "content": "f \\colon { \\mathbb { R } } ^ { p } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 382, + 327, + 394 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 327, + 383, + 405, + 393 + ], + "score": 0.86, + "content": "G \\colon \\mathbb { R } ^ { p } \\times \\mathbb { R } ^ { n } \\to \\mathbb { R } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 382, + 423, + 394 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 423, + 383, + 503, + 393 + ], + "score": 0.89, + "content": "H \\colon \\mathbb { R } ^ { p } \\times \\mathbb { R } ^ { n } \\to \\mathbb { R } ^ { q }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 84, + 394, + 429, + 407 + ], + "spans": [ + { + "bbox": [ + 84, + 394, + 429, + 407 + ], + "score": 1.0, + "content": "167 The stationarity, primal feasibility and complementary slackness conditions give", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 84, + 382, + 503, + 407 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 408, + 408, + 454 + ], + "lines": [ + { + "bbox": [ + 203, + 408, + 408, + 454 + ], + "spans": [ + { + "bbox": [ + 203, + 408, + 408, + 454 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\nabla _ { 1 } f ( z , \\theta ) + \\left[ \\partial _ { 1 } G ( z , \\theta ) \\right] ^ { \\top } \\boldsymbol { \\lambda } + \\left[ \\partial _ { 1 } H ( z , \\theta ) \\right] ^ { \\top } \\boldsymbol { \\nu } = 0 } \\\\ { H ( z , \\theta ) = 0 } \\\\ { \\boldsymbol { \\lambda } \\circ G ( z , \\theta ) = 0 , } \\end{array}", + "type": "interline_equation", + "image_path": "f51428dc8ea9e213a482c787fc5040608d86096761fc257f08e96afe82f857bb.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 203, + 408, + 408, + 423.3333333333333 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 203, + 423.3333333333333, + 408, + 438.66666666666663 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 203, + 438.66666666666663, + 408, + 453.99999999999994 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "index", + "bbox": [ + 87, + 455, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 86, + 456, + 505, + 468 + ], + "spans": [ + { + "bbox": [ + 86, + 458, + 100, + 467 + ], + "score": 1.0, + "content": "168", + "type": "text" + }, + { + "bbox": [ + 106, + 456, + 133, + 467 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 456, + 165, + 466 + ], + "score": 0.91, + "content": "\\nu \\in \\mathbb { R } ^ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 456, + 183, + 467 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 184, + 456, + 217, + 468 + ], + "score": 0.92, + "content": "\\lambda \\in \\mathbb { R } _ { + } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 456, + 505, + 467 + ], + "score": 1.0, + "content": "are the dual variables, also known as KKT multipliers. The system of", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 466, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 86, + 468, + 100, + 479 + ], + "score": 1.0, + "content": "169", + "type": "text" + }, + { + "bbox": [ + 105, + 466, + 506, + 479 + ], + "score": 1.0, + "content": "(potentially nonlinear) equations (6) fits our framework, as we can group the primal and dual solutions", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 476, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 86, + 479, + 100, + 490 + ], + "score": 1.0, + "content": "170", + "type": "text" + }, + { + "bbox": [ + 105, + 476, + 117, + 491 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 118, + 478, + 239, + 490 + ], + "score": 0.9, + "content": "x ^ { \\star } ( \\theta ) = ( z ^ { \\star } ( \\theta ) , \\nu ^ { \\star } ( \\theta ) , \\lambda ^ { \\star } ( \\theta ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 476, + 359, + 491 + ], + "score": 1.0, + "content": "to form the root of a function", + "type": "text" + }, + { + "bbox": [ + 359, + 478, + 407, + 490 + ], + "score": 0.93, + "content": "F ( x ^ { \\star } ( \\theta ) , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 476, + 438, + 491 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 438, + 477, + 505, + 488 + ], + "score": 0.9, + "content": "F \\colon \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } ", + "type": "inline_equation" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 487, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 86, + 491, + 100, + 501 + ], + "score": 1.0, + "content": "171", + "type": "text" + }, + { + "bbox": [ + 106, + 489, + 119, + 500 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 487, + 137, + 504 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 138, + 491, + 196, + 501 + ], + "score": 0.91, + "content": "d = p + q + r", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 487, + 506, + 504 + ], + "score": 1.0, + "content": ". The primal and dual solutions can be obtained from a generic solver, such as", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 86, + 502, + 100, + 512 + ], + "score": 1.0, + "content": "172", + "type": "text" + }, + { + "bbox": [ + 105, + 500, + 338, + 513 + ], + "score": 1.0, + "content": "an interior point method. In practice, the above mapping", + "type": "text" + }, + { + "bbox": [ + 338, + 501, + 347, + 510 + ], + "score": 0.83, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "will be defined directly in Python (see", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 511, + 428, + 523 + ], + "spans": [ + { + "bbox": [ + 86, + 513, + 100, + 523 + ], + "score": 1.0, + "content": "173", + "type": "text" + }, + { + "bbox": [ + 105, + 511, + 224, + 523 + ], + "score": 1.0, + "content": "Figure 6 in Appendix A) and", + "type": "text" + }, + { + "bbox": [ + 225, + 512, + 234, + 521 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 511, + 428, + 523 + ], + "score": 1.0, + "content": "will be differentiated automatically via autodiff.", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 86, + 536, + 100, + 545 + ], + "score": 1.0, + "content": "174", + "type": "text" + }, + { + "bbox": [ + 104, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "Proximal gradient fixed point. Unfortunately, not all algorithms return both primal and dual", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 87, + 545, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 87, + 548, + 100, + 556 + ], + "score": 1.0, + "content": "175", + "type": "text" + }, + { + "bbox": [ + 105, + 545, + 505, + 558 + ], + "score": 1.0, + "content": "solutions. Moreover, if the objective contains non-smooth terms, proximal gradient descent may be", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 556, + 431, + 569 + ], + "spans": [ + { + "bbox": [ + 86, + 558, + 100, + 568 + ], + "score": 1.0, + "content": "176", + "type": "text" + }, + { + "bbox": [ + 105, + 556, + 309, + 569 + ], + "score": 1.0, + "content": "more efficient. We now discuss its fixed point. Let", + "type": "text" + }, + { + "bbox": [ + 310, + 556, + 334, + 568 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 556, + 431, + 569 + ], + "score": 1.0, + "content": "be implicitly defined as", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + } + ], + "index": 21.5, + "bbox_fs": [ + 86, + 456, + 506, + 523 + ] + }, + { + "type": "index", + "bbox": [ + 87, + 534, + 506, + 568 + ], + "lines": [], + "index": 26, + "bbox_fs": [ + 86, + 534, + 505, + 569 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 233, + 571, + 377, + 593 + ], + "lines": [ + { + "bbox": [ + 233, + 571, + 377, + 593 + ], + "spans": [ + { + "bbox": [ + 233, + 571, + 377, + 593 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta ) : = \\operatornamewithlimits { a r g m i n } _ { x \\in \\mathbb { R } ^ { d } } f ( x , \\theta ) + g ( x , \\theta ) ,", + "type": "interline_equation", + "image_path": "2e4230919f90ed7ed51be288843b00db88b4c661b11d934b7a8081ce3f1c4c90.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 233, + 571, + 377, + 593 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 88, + 597, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 86, + 596, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 86, + 596, + 133, + 612 + ], + "score": 1.0, + "content": "where 177", + "type": "text" + }, + { + "bbox": [ + 133, + 597, + 206, + 610 + ], + "score": 0.92, + "content": "f \\colon { \\mathbb { R } ^ { d } } \\times { \\mathbb { R } ^ { n } } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 596, + 343, + 612 + ], + "score": 1.0, + "content": "is twice-differentiable convex and", + "type": "text" + }, + { + "bbox": [ + 343, + 597, + 415, + 609 + ], + "score": 0.91, + "content": "g \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 596, + 505, + 612 + ], + "score": 1.0, + "content": "is convex but possibly", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 84, + 609, + 389, + 622 + ], + "spans": [ + { + "bbox": [ + 84, + 609, + 369, + 622 + ], + "score": 1.0, + "content": "178 non-smooth. Let us define the proximity operator associated with", + "type": "text" + }, + { + "bbox": [ + 370, + 612, + 376, + 621 + ], + "score": 0.81, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 609, + 389, + 622 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 84, + 596, + 505, + 622 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 213, + 624, + 397, + 651 + ], + "lines": [ + { + "bbox": [ + 213, + 624, + 397, + 651 + ], + "spans": [ + { + "bbox": [ + 213, + 624, + 397, + 651 + ], + "score": 0.94, + "content": "\\operatorname { p r o x } _ { g } ( y , \\theta ) : = \\underset { x \\in \\mathbb { R } ^ { d } } { \\operatorname { a r g m i n } } \\frac { 1 } { 2 } \\| x - y \\| _ { 2 } ^ { 2 } + g ( x , \\theta ) .", + "type": "interline_equation", + "image_path": "7e620cbfca8df53ee6d254fd7e1544917ffbf8fedcfd59918e6eab8ecb36240d.jpg" + } + ] + } + ], + "index": 31.5, + "virtual_lines": [ + { + "bbox": [ + 213, + 624, + 397, + 637.5 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 213, + 637.5, + 397, + 651.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 655, + 447, + 668 + ], + "lines": [ + { + "bbox": [ + 84, + 654, + 447, + 670 + ], + "spans": [ + { + "bbox": [ + 84, + 654, + 245, + 670 + ], + "score": 1.0, + "content": "To implicitly differentiate through 179", + "type": "text" + }, + { + "bbox": [ + 245, + 656, + 268, + 668 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 654, + 447, + 670 + ], + "score": 1.0, + "content": ", we use the fixed point mapping [55, p.150]", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33, + "bbox_fs": [ + 84, + 654, + 447, + 670 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 671, + 384, + 686 + ], + "lines": [ + { + "bbox": [ + 226, + 671, + 384, + 686 + ], + "spans": [ + { + "bbox": [ + 226, + 671, + 384, + 686 + ], + "score": 0.92, + "content": "T ( x , \\theta ) = \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) ,", + "type": "interline_equation", + "image_path": "d9127dfd0fa20c31c543a2a1122bbff9fd774a71fd22a8ac2eee7a2b5c1014ff.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 226, + 671, + 384, + 686 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "index", + "bbox": [ + 87, + 689, + 505, + 723 + ], + "lines": [ + { + "bbox": [ + 87, + 688, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 87, + 691, + 100, + 700 + ], + "score": 1.0, + "content": "180", + "type": "text" + }, + { + "bbox": [ + 104, + 688, + 175, + 702 + ], + "score": 1.0, + "content": "for any step size", + "type": "text" + }, + { + "bbox": [ + 175, + 690, + 200, + 700 + ], + "score": 0.91, + "content": "\\eta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 688, + 506, + 702 + ], + "score": 1.0, + "content": ". The proximity operator is 1-Lipschitz continuous [50]. By Rademacher’s", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 699, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 86, + 702, + 99, + 711 + ], + "score": 1.0, + "content": "181", + "type": "text" + }, + { + "bbox": [ + 105, + 699, + 506, + 713 + ], + "score": 1.0, + "content": "theorem, it is differentiable almost everywhere. Many proximity operators enjoy a closed form and", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 87, + 711, + 334, + 723 + ], + "spans": [ + { + "bbox": [ + 87, + 713, + 100, + 722 + ], + "score": 1.0, + "content": "182", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 322, + 723 + ], + "score": 1.0, + "content": "can easily be differentiated, as discussed in Appendix", + "type": "text" + }, + { + "bbox": [ + 322, + 712, + 330, + 721 + ], + "score": 0.25, + "content": "\\mathbf { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 711, + 334, + 723 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 87, + 70, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 87, + 70, + 341, + 87 + ], + "score": 1.0, + "content": "183 Projected gradient fixed point. As a special case, when", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 342, + 73, + 370, + 85 + ], + "score": 0.93, + "content": "g ( x , \\theta )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 371, + 70, + 468, + 87 + ], + "score": 1.0, + "content": "is the indicator function", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 468, + 73, + 502, + 86 + ], + "score": 0.93, + "content": "I _ { C ( \\theta ) } ( x )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 502, + 70, + 506, + 87 + ], + "score": 1.0, + "content": ",", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 84, + 322, + 98 + ], + "spans": [ + { + "bbox": [ + 85, + 84, + 133, + 98 + ], + "score": 1.0, + "content": "184 where", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 133, + 84, + 153, + 97 + ], + "score": 0.91, + "content": "\\mathcal { C } ( \\boldsymbol { \\theta } )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 153, + 84, + 271, + 98 + ], + "score": 1.0, + "content": "is a convex set depending on", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 271, + 85, + 277, + 95 + ], + "score": 0.81, + "content": "\\theta", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 277, + 84, + 322, + 98 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text", + "cross_page": true + } + ], + "index": 1, + "is_list_start_line": true + } + ], + "index": 36, + "bbox_fs": [ + 86, + 688, + 506, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 88, + 72, + 505, + 96 + ], + "lines": [ + { + "bbox": [ + 87, + 70, + 506, + 87 + ], + "spans": [ + { + "bbox": [ + 87, + 70, + 341, + 87 + ], + "score": 1.0, + "content": "183 Projected gradient fixed point. As a special case, when", + "type": "text" + }, + { + "bbox": [ + 342, + 73, + 370, + 85 + ], + "score": 0.93, + "content": "g ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 70, + 468, + 87 + ], + "score": 1.0, + "content": "is the indicator function", + "type": "text" + }, + { + "bbox": [ + 468, + 73, + 502, + 86 + ], + "score": 0.93, + "content": "I _ { C ( \\theta ) } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 70, + 506, + 87 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 85, + 84, + 322, + 98 + ], + "spans": [ + { + "bbox": [ + 85, + 84, + 133, + 98 + ], + "score": 1.0, + "content": "184 where", + "type": "text" + }, + { + "bbox": [ + 133, + 84, + 153, + 97 + ], + "score": 0.91, + "content": "\\mathcal { C } ( \\boldsymbol { \\theta } )", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 84, + 271, + 98 + ], + "score": 1.0, + "content": "is a convex set depending on", + "type": "text" + }, + { + "bbox": [ + 271, + 85, + 277, + 95 + ], + "score": 0.81, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 84, + 322, + 98 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 254, + 101, + 357, + 123 + ], + "lines": [ + { + "bbox": [ + 254, + 101, + 357, + 123 + ], + "spans": [ + { + "bbox": [ + 254, + 101, + 357, + 123 + ], + "score": 0.94, + "content": "x ^ { \\star } ( \\theta ) = \\operatorname * { a r g m i n } _ { x \\in { \\mathcal { C } } ( \\theta ) } f ( x , \\theta ) .", + "type": "interline_equation", + "image_path": "9fc305b7d41cf9840a4da1e9c684a4966948193c4810d7fe8ec45b24659e4c02.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 254, + 101, + 357, + 123 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 84, + 129, + 404, + 142 + ], + "lines": [ + { + "bbox": [ + 84, + 128, + 404, + 144 + ], + "spans": [ + { + "bbox": [ + 84, + 128, + 201, + 144 + ], + "score": 1.0, + "content": "The proximity operator185", + "type": "text" + }, + { + "bbox": [ + 202, + 131, + 226, + 144 + ], + "score": 0.77, + "content": "\\operatorname { p r o x } _ { g }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 128, + 384, + 144 + ], + "score": 1.0, + "content": "becomes the Euclidean projection onto", + "type": "text" + }, + { + "bbox": [ + 385, + 130, + 404, + 142 + ], + "score": 0.91, + "content": "\\mathcal { C } ( \\boldsymbol { \\theta } )", + "type": "inline_equation" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 148, + 401, + 171 + ], + "lines": [ + { + "bbox": [ + 210, + 148, + 401, + 171 + ], + "spans": [ + { + "bbox": [ + 210, + 148, + 401, + 171 + ], + "score": 0.92, + "content": "{ \\mathrm { p r o x } } _ { g } ( y , \\theta ) = { \\mathrm { p r o j } } _ { \\mathcal { C } } ( y , \\theta ) : = { \\underset { x \\in { \\mathcal { C } } ( \\theta ) } { \\operatorname { a r g m i n } } } \\| x - y \\| _ { 2 } ^ { 2 }", + "type": "interline_equation", + "image_path": "e7c633a19a36233e89826d03e6e9e9d6f4930843a131c7ac91137f5df398e3f5.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 210, + 148, + 401, + 171 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 87, + 176, + 310, + 189 + ], + "lines": [ + { + "bbox": [ + 85, + 176, + 310, + 190 + ], + "spans": [ + { + "bbox": [ + 85, + 176, + 310, + 190 + ], + "score": 1.0, + "content": "186 and (7) becomes the projected gradient fixed point", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 229, + 193, + 381, + 208 + ], + "lines": [ + { + "bbox": [ + 229, + 193, + 381, + 208 + ], + "spans": [ + { + "bbox": [ + 229, + 193, + 381, + 208 + ], + "score": 0.91, + "content": "T ( x , \\theta ) = \\mathrm { p r o j } _ { \\mathcal { C } } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) .", + "type": "interline_equation", + "image_path": "aba5f6e6acfac5cae3bd9be31fa33ca7546d5da43bb42e1db717636e16b40d6f.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 229, + 193, + 381, + 208 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 91, + 212, + 506, + 235 + ], + "lines": [ + { + "bbox": [ + 89, + 211, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 89, + 214, + 101, + 224 + ], + "score": 1.0, + "content": "187", + "type": "text" + }, + { + "bbox": [ + 103, + 211, + 505, + 227 + ], + "score": 1.0, + "content": "Compared to the KKT conditions, this fixed point is particularly suitable when the projection enjoys", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 87, + 223, + 507, + 236 + ], + "spans": [ + { + "bbox": [ + 87, + 223, + 311, + 236 + ], + "score": 1.0, + "content": "188 a closed form. We discuss how to compute the JVP", + "type": "text" + }, + { + "bbox": [ + 311, + 225, + 316, + 234 + ], + "score": 0.27, + "content": "/", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 223, + 507, + 236 + ], + "score": 1.0, + "content": "VJP for a wealth of convex sets in Appendix B.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 87, + 246, + 506, + 281 + ], + "lines": [ + { + "bbox": [ + 86, + 246, + 506, + 260 + ], + "spans": [ + { + "bbox": [ + 86, + 249, + 100, + 259 + ], + "score": 1.0, + "content": "189", + "type": "text" + }, + { + "bbox": [ + 105, + 246, + 369, + 260 + ], + "score": 1.0, + "content": "Mirror descent fixed point. We again consider the case when", + "type": "text" + }, + { + "bbox": [ + 369, + 247, + 393, + 259 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 246, + 506, + 260 + ], + "score": 1.0, + "content": "is implicitly defined as the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 87, + 257, + 507, + 271 + ], + "spans": [ + { + "bbox": [ + 87, + 260, + 100, + 269 + ], + "score": 1.0, + "content": "190", + "type": "text" + }, + { + "bbox": [ + 104, + 257, + 507, + 271 + ], + "score": 1.0, + "content": "solution of (8). We now generalize the projected gradient fixed point beyond Euclidean geometry.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 87, + 268, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 87, + 271, + 99, + 280 + ], + "score": 1.0, + "content": "191", + "type": "text" + }, + { + "bbox": [ + 104, + 268, + 221, + 282 + ], + "score": 1.0, + "content": "Let the Bregman divergence", + "type": "text" + }, + { + "bbox": [ + 221, + 269, + 237, + 281 + ], + "score": 0.76, + "content": "D _ { \\varphi }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 268, + 242, + 282 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 243, + 268, + 384, + 281 + ], + "score": 0.88, + "content": "\\operatorname { d o m } ( \\bar { \\varphi } ) \\cdot \\operatorname { r e l i n t } ( \\operatorname { d o m } ( \\varphi ) ) \\to \\bar { \\mathbb { R } } _ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 268, + 439, + 282 + ], + "score": 1.0, + "content": "generated by", + "type": "text" + }, + { + "bbox": [ + 439, + 270, + 447, + 280 + ], + "score": 0.8, + "content": "\\varphi", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 268, + 505, + 282 + ], + "score": 1.0, + "content": "be defined by", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 213, + 285, + 397, + 300 + ], + "lines": [ + { + "bbox": [ + 213, + 285, + 397, + 300 + ], + "spans": [ + { + "bbox": [ + 213, + 285, + 397, + 300 + ], + "score": 0.9, + "content": "D _ { \\varphi } ( x , y ) : = \\varphi ( x ) - \\varphi ( y ) - \\langle \\nabla \\varphi ( y ) , x - y \\rangle .", + "type": "interline_equation", + "image_path": "a088e4de3012dd22930fbf8bbcbaeac60e58c57b50440c99049b46934ecb5603.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 213, + 285, + 397, + 300 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 304, + 363, + 317 + ], + "lines": [ + { + "bbox": [ + 84, + 302, + 363, + 319 + ], + "spans": [ + { + "bbox": [ + 84, + 302, + 255, + 319 + ], + "score": 1.0, + "content": "192 We define the Bregman projection of", + "type": "text" + }, + { + "bbox": [ + 255, + 307, + 262, + 316 + ], + "score": 0.82, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 302, + 284, + 319 + ], + "score": 1.0, + "content": "onto", + "type": "text" + }, + { + "bbox": [ + 284, + 304, + 349, + 317 + ], + "score": 0.92, + "content": "{ \\mathcal { C } } ( \\theta ) \\subseteq \\mathrm { d o m } ( \\varphi )", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 302, + 363, + 319 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 224, + 321, + 386, + 343 + ], + "lines": [ + { + "bbox": [ + 224, + 321, + 386, + 343 + ], + "spans": [ + { + "bbox": [ + 224, + 321, + 386, + 343 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathrm { p r o j } _ { \\mathcal { C } } ^ { \\varphi } ( y , \\theta ) : = \\underset { x \\in \\mathcal { C } ( \\theta ) } { \\mathrm { a r g m i n } } D _ { \\varphi } ( x , \\nabla \\varphi ^ { \\ast } ( y ) ) . } \\end{array}", + "type": "interline_equation", + "image_path": "c7ff71d89425795cdecba2a0366df884c4bad19b5185cd83e5b56608b38f26e4.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 224, + 321, + 386, + 343 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 349, + 505, + 374 + ], + "lines": [ + { + "bbox": [ + 87, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 87, + 352, + 100, + 361 + ], + "score": 1.0, + "content": "193", + "type": "text" + }, + { + "bbox": [ + 104, + 349, + 265, + 362 + ], + "score": 1.0, + "content": "Definition (10) incudes the mirror map", + "type": "text" + }, + { + "bbox": [ + 265, + 349, + 299, + 362 + ], + "score": 0.93, + "content": "\\nabla \\varphi ^ { * } ( y )", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "for convenience. It can be seen as a mapping from", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 84, + 360, + 497, + 375 + ], + "spans": [ + { + "bbox": [ + 84, + 360, + 106, + 375 + ], + "score": 1.0, + "content": "194", + "type": "text" + }, + { + "bbox": [ + 106, + 361, + 119, + 371 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 360, + 131, + 375 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 131, + 361, + 165, + 374 + ], + "score": 0.88, + "content": "\\mathrm { d o m } ( \\varphi )", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 360, + 497, + 375 + ], + "score": 1.0, + "content": ", ensuring that (10) is well-defined. The mirror descent fixed point mapping is then", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "interline_equation", + "bbox": [ + 250, + 377, + 361, + 424 + ], + "lines": [ + { + "bbox": [ + 250, + 377, + 361, + 424 + ], + "spans": [ + { + "bbox": [ + 250, + 377, + 361, + 424 + ], + "score": 0.92, + "content": "\\begin{array} { c } { \\hat { x } = \\nabla \\varphi ( x ) } \\\\ { y = \\hat { x } - \\eta \\nabla _ { 1 } f ( x , \\theta ) } \\\\ { T ( x , \\theta ) = \\mathrm { p r o j } _ { \\mathcal { C } } ^ { \\varphi } ( y , \\theta ) . } \\end{array}", + "type": "interline_equation", + "image_path": "e899366ae5ecf7ce9f01f9380bb80a3429cbbdaeed0d51b4e8a4782c4d4f0680.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 250, + 377, + 361, + 400.5 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 250, + 400.5, + 361, + 424.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 87, + 426, + 505, + 482 + ], + "lines": [ + { + "bbox": [ + 86, + 427, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 86, + 429, + 100, + 438 + ], + "score": 1.0, + "content": "195", + "type": "text" + }, + { + "bbox": [ + 106, + 427, + 143, + 439 + ], + "score": 1.0, + "content": "Because", + "type": "text" + }, + { + "bbox": [ + 143, + 427, + 152, + 437 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 427, + 506, + 439 + ], + "score": 1.0, + "content": "involves the composition of several functions, manually deriving its JVP/VJP is error", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 86, + 438, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 86, + 440, + 100, + 449 + ], + "score": 1.0, + "content": "196", + "type": "text" + }, + { + "bbox": [ + 106, + 438, + 505, + 450 + ], + "score": 1.0, + "content": "prone. This shows that our approach leveraging autodiff allows to handle more advanced fixed point", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 86, + 446, + 508, + 462 + ], + "spans": [ + { + "bbox": [ + 86, + 450, + 100, + 460 + ], + "score": 1.0, + "content": "197", + "type": "text" + }, + { + "bbox": [ + 104, + 446, + 248, + 462 + ], + "score": 1.0, + "content": "mappings. A common example of", + "type": "text" + }, + { + "bbox": [ + 248, + 450, + 256, + 460 + ], + "score": 0.83, + "content": "\\varphi", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 446, + 266, + 462 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 267, + 448, + 357, + 460 + ], + "score": 0.92, + "content": "\\varphi ( \\bar { x } ) \\stackrel { - } { = } \\langle x , \\log x - 1 \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 446, + 389, + 462 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 389, + 447, + 450, + 461 + ], + "score": 0.92, + "content": "\\mathrm { d o m } ( \\varphi ) = \\mathbb { R } _ { + } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 446, + 508, + 462 + ], + "score": 1.0, + "content": ". In this case,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 86, + 458, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 86, + 461, + 100, + 471 + ], + "score": 1.0, + "content": "198", + "type": "text" + }, + { + "bbox": [ + 106, + 459, + 122, + 471 + ], + "score": 0.9, + "content": "D _ { \\varphi }", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 458, + 506, + 472 + ], + "score": 1.0, + "content": "is the Kullback-Leibler divergence. An advantage of the Kullback-Leibler projection is that it", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 86, + 470, + 460, + 483 + ], + "spans": [ + { + "bbox": [ + 86, + 472, + 100, + 482 + ], + "score": 1.0, + "content": "199", + "type": "text" + }, + { + "bbox": [ + 105, + 470, + 460, + 483 + ], + "score": 1.0, + "content": "sometimes easier to compute than the Euclidean projection, as we detail in Appendix B.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 90, + 493, + 387, + 505 + ], + "lines": [ + { + "bbox": [ + 86, + 491, + 388, + 507 + ], + "spans": [ + { + "bbox": [ + 86, + 491, + 388, + 507 + ], + "score": 1.0, + "content": "200 Other fixed points. More fixed points are described in Appendix C.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "title", + "bbox": [ + 106, + 517, + 203, + 529 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 203, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 203, + 530 + ], + "score": 1.0, + "content": "2.3 Jacobian bounds", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 105, + 537, + 505, + 582 + ], + "lines": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "score": 1.0, + "content": "In practice, either by the limitations of finite precision arithmetic or because we perform a finite", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 325, + 561 + ], + "score": 1.0, + "content": "number of iterations, we rarely reach the exact solution", + "type": "text" + }, + { + "bbox": [ + 325, + 549, + 349, + 560 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 549, + 505, + 561 + ], + "score": 1.0, + "content": ", but instead only reach an approximate", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 560, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 142, + 572 + ], + "score": 1.0, + "content": "solution", + "type": "text" + }, + { + "bbox": [ + 142, + 560, + 150, + 570 + ], + "score": 0.81, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 560, + 505, + 572 + ], + "score": 1.0, + "content": "and apply the implicit differentiation equation (2) at this approximate solution. This", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 571, + 370, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 370, + 583 + ], + "score": 1.0, + "content": "motivates the need for approximation guarantees of this approach", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 105, + 585, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 105, + 583, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 180, + 598 + ], + "score": 1.0, + "content": "Definition 1. Let", + "type": "text" + }, + { + "bbox": [ + 181, + 584, + 266, + 596 + ], + "score": 0.91, + "content": "F : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 583, + 434, + 598 + ], + "score": 1.0, + "content": "be an optimality criterion mapping. Let", + "type": "text" + }, + { + "bbox": [ + 434, + 586, + 486, + 597 + ], + "score": 0.91, + "content": "A : = - \\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 583, + 506, + 598 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 149, + 608 + ], + "score": 0.89, + "content": "B : = \\partial _ { 2 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 596, + 294, + 609 + ], + "score": 1.0, + "content": ". We define the Jacobian estimate at", + "type": "text" + }, + { + "bbox": [ + 294, + 597, + 317, + 608 + ], + "score": 0.9, + "content": "( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 596, + 505, + 609 + ], + "score": 1.0, + "content": "as the solution to the following linear equation", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 607, + 371, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 211, + 621 + ], + "score": 0.91, + "content": "A ( x , \\theta ) J ( x , \\theta ) = B ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 607, + 276, + 621 + ], + "score": 1.0, + "content": ". It is a function", + "type": "text" + }, + { + "bbox": [ + 276, + 608, + 367, + 619 + ], + "score": 0.91, + "content": "J : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d \\times n }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 607, + 371, + 621 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 86, + 628, + 505, + 684 + ], + "lines": [ + { + "bbox": [ + 86, + 628, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 86, + 630, + 100, + 641 + ], + "score": 1.0, + "content": "209", + "type": "text" + }, + { + "bbox": [ + 105, + 628, + 220, + 642 + ], + "score": 1.0, + "content": "It holds by construction that", + "type": "text" + }, + { + "bbox": [ + 221, + 629, + 310, + 641 + ], + "score": 0.93, + "content": "J ( x ^ { \\star } ( \\theta ) , \\theta ) = \\partial x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 628, + 361, + 642 + ], + "score": 1.0, + "content": ". Computing", + "type": "text" + }, + { + "bbox": [ + 362, + 629, + 391, + 641 + ], + "score": 0.92, + "content": "J ( \\hat { x } , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 628, + 505, + 642 + ], + "score": 1.0, + "content": "for an approximate solution", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 86, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 86, + 642, + 99, + 651 + ], + "score": 1.0, + "content": "210", + "type": "text" + }, + { + "bbox": [ + 106, + 640, + 114, + 650 + ], + "score": 0.76, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 639, + 126, + 653 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 126, + 640, + 149, + 651 + ], + "score": 0.92, + "content": "x ^ { \\star } ( { \\boldsymbol { \\theta } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 639, + 349, + 653 + ], + "score": 1.0, + "content": "therefore allows to approximate the true Jacobian", + "type": "text" + }, + { + "bbox": [ + 350, + 640, + 379, + 651 + ], + "score": 0.91, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 639, + 505, + 653 + ], + "score": 1.0, + "content": ". In practice, an algorithm used", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 86, + 650, + 505, + 663 + ], + "spans": [ + { + "bbox": [ + 86, + 653, + 99, + 662 + ], + "score": 1.0, + "content": "211", + "type": "text" + }, + { + "bbox": [ + 105, + 650, + 203, + 663 + ], + "score": 1.0, + "content": "to solve (1) depends on", + "type": "text" + }, + { + "bbox": [ + 203, + 651, + 209, + 660 + ], + "score": 0.69, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 650, + 454, + 663 + ], + "score": 1.0, + "content": ". Note however that, what we compute is not the Jacobian of", + "type": "text" + }, + { + "bbox": [ + 454, + 651, + 473, + 662 + ], + "score": 0.9, + "content": "{ \\hat { x } } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 650, + 505, + 663 + ], + "score": 1.0, + "content": ", unlike", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 85, + 661, + 506, + 675 + ], + "spans": [ + { + "bbox": [ + 85, + 663, + 100, + 673 + ], + "score": 1.0, + "content": "212", + "type": "text" + }, + { + "bbox": [ + 105, + 661, + 455, + 675 + ], + "score": 1.0, + "content": "works unrolling an algorithm that differentiate through its iterations, but an estimate of", + "type": "text" + }, + { + "bbox": [ + 455, + 662, + 484, + 674 + ], + "score": 0.91, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 661, + 506, + 675 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 85, + 672, + 373, + 685 + ], + "spans": [ + { + "bbox": [ + 85, + 674, + 100, + 685 + ], + "score": 1.0, + "content": "213", + "type": "text" + }, + { + "bbox": [ + 105, + 672, + 210, + 685 + ], + "score": 1.0, + "content": "therefore use the notation", + "type": "text" + }, + { + "bbox": [ + 210, + 673, + 217, + 682 + ], + "score": 0.82, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 672, + 330, + 685 + ], + "score": 1.0, + "content": ", leaving the dependence on", + "type": "text" + }, + { + "bbox": [ + 330, + 674, + 335, + 682 + ], + "score": 0.83, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 672, + 373, + 685 + ], + "score": 1.0, + "content": "implicit.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 87, + 688, + 505, + 723 + ], + "lines": [ + { + "bbox": [ + 86, + 687, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 86, + 691, + 100, + 699 + ], + "score": 1.0, + "content": "214", + "type": "text" + }, + { + "bbox": [ + 103, + 687, + 233, + 702 + ], + "score": 1.0, + "content": "We develop bounds of the form", + "type": "text" + }, + { + "bbox": [ + 234, + 689, + 386, + 701 + ], + "score": 0.92, + "content": "\\| J ( \\hat { x } , \\theta ) - \\partial x ^ { \\star } ( \\theta ) \\| < C \\| \\hat { x } - x ^ { \\star } ( \\theta ) \\|", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 687, + 506, + 702 + ], + "score": 1.0, + "content": ", hence showing that the error", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 86, + 699, + 502, + 713 + ], + "spans": [ + { + "bbox": [ + 86, + 703, + 100, + 711 + ], + "score": 1.0, + "content": "215", + "type": "text" + }, + { + "bbox": [ + 104, + 699, + 373, + 713 + ], + "score": 1.0, + "content": "on the estimated Jacobian is at most of the same order as that of", + "type": "text" + }, + { + "bbox": [ + 374, + 702, + 380, + 710 + ], + "score": 0.82, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 699, + 479, + 713 + ], + "score": 1.0, + "content": "as an approximation of", + "type": "text" + }, + { + "bbox": [ + 479, + 700, + 502, + 712 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 85, + 711, + 493, + 723 + ], + "spans": [ + { + "bbox": [ + 85, + 712, + 100, + 722 + ], + "score": 1.0, + "content": "216", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 493, + 723 + ], + "score": 1.0, + "content": "These bounds are based on the following main theorem, whose proof is included in Appendix D.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 309, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 310, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 310, + 752 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "index", + "bbox": [ + 88, + 72, + 505, + 96 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 85, + 70, + 506, + 98 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 254, + 101, + 357, + 123 + ], + "lines": [ + { + "bbox": [ + 254, + 101, + 357, + 123 + ], + "spans": [ + { + "bbox": [ + 254, + 101, + 357, + 123 + ], + "score": 0.94, + "content": "x ^ { \\star } ( \\theta ) = \\operatorname * { a r g m i n } _ { x \\in { \\mathcal { C } } ( \\theta ) } f ( x , \\theta ) .", + "type": "interline_equation", + "image_path": "9fc305b7d41cf9840a4da1e9c684a4966948193c4810d7fe8ec45b24659e4c02.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 254, + 101, + 357, + 123 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 84, + 129, + 404, + 142 + ], + "lines": [ + { + "bbox": [ + 84, + 128, + 404, + 144 + ], + "spans": [ + { + "bbox": [ + 84, + 128, + 201, + 144 + ], + "score": 1.0, + "content": "The proximity operator185", + "type": "text" + }, + { + "bbox": [ + 202, + 131, + 226, + 144 + ], + "score": 0.77, + "content": "\\operatorname { p r o x } _ { g }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 128, + 384, + 144 + ], + "score": 1.0, + "content": "becomes the Euclidean projection onto", + "type": "text" + }, + { + "bbox": [ + 385, + 130, + 404, + 142 + ], + "score": 0.91, + "content": "\\mathcal { C } ( \\boldsymbol { \\theta } )", + "type": "inline_equation" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 84, + 128, + 404, + 144 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 148, + 401, + 171 + ], + "lines": [ + { + "bbox": [ + 210, + 148, + 401, + 171 + ], + "spans": [ + { + "bbox": [ + 210, + 148, + 401, + 171 + ], + "score": 0.92, + "content": "{ \\mathrm { p r o x } } _ { g } ( y , \\theta ) = { \\mathrm { p r o j } } _ { \\mathcal { C } } ( y , \\theta ) : = { \\underset { x \\in { \\mathcal { C } } ( \\theta ) } { \\operatorname { a r g m i n } } } \\| x - y \\| _ { 2 } ^ { 2 }", + "type": "interline_equation", + "image_path": "e7c633a19a36233e89826d03e6e9e9d6f4930843a131c7ac91137f5df398e3f5.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 210, + 148, + 401, + 171 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 87, + 176, + 310, + 189 + ], + "lines": [ + { + "bbox": [ + 85, + 176, + 310, + 190 + ], + "spans": [ + { + "bbox": [ + 85, + 176, + 310, + 190 + ], + "score": 1.0, + "content": "186 and (7) becomes the projected gradient fixed point", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 85, + 176, + 310, + 190 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 229, + 193, + 381, + 208 + ], + "lines": [ + { + "bbox": [ + 229, + 193, + 381, + 208 + ], + "spans": [ + { + "bbox": [ + 229, + 193, + 381, + 208 + ], + "score": 0.91, + "content": "T ( x , \\theta ) = \\mathrm { p r o j } _ { \\mathcal { C } } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) .", + "type": "interline_equation", + "image_path": "aba5f6e6acfac5cae3bd9be31fa33ca7546d5da43bb42e1db717636e16b40d6f.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 229, + 193, + 381, + 208 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "index", + "bbox": [ + 91, + 212, + 506, + 235 + ], + "lines": [ + { + "bbox": [ + 89, + 211, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 89, + 214, + 101, + 224 + ], + "score": 1.0, + "content": "187", + "type": "text" + }, + { + "bbox": [ + 103, + 211, + 505, + 227 + ], + "score": 1.0, + "content": "Compared to the KKT conditions, this fixed point is particularly suitable when the projection enjoys", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 87, + 223, + 507, + 236 + ], + "spans": [ + { + "bbox": [ + 87, + 223, + 311, + 236 + ], + "score": 1.0, + "content": "188 a closed form. We discuss how to compute the JVP", + "type": "text" + }, + { + "bbox": [ + 311, + 225, + 316, + 234 + ], + "score": 0.27, + "content": "/", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 223, + 507, + 236 + ], + "score": 1.0, + "content": "VJP for a wealth of convex sets in Appendix B.", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 246, + 506, + 260 + ], + "spans": [ + { + "bbox": [ + 86, + 249, + 100, + 259 + ], + "score": 1.0, + "content": "189", + "type": "text" + }, + { + "bbox": [ + 105, + 246, + 369, + 260 + ], + "score": 1.0, + "content": "Mirror descent fixed point. We again consider the case when", + "type": "text" + }, + { + "bbox": [ + 369, + 247, + 393, + 259 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 246, + 506, + 260 + ], + "score": 1.0, + "content": "is implicitly defined as the", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 87, + 257, + 507, + 271 + ], + "spans": [ + { + "bbox": [ + 87, + 260, + 100, + 269 + ], + "score": 1.0, + "content": "190", + "type": "text" + }, + { + "bbox": [ + 104, + 257, + 507, + 271 + ], + "score": 1.0, + "content": "solution of (8). We now generalize the projected gradient fixed point beyond Euclidean geometry.", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 87, + 268, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 87, + 271, + 99, + 280 + ], + "score": 1.0, + "content": "191", + "type": "text" + }, + { + "bbox": [ + 104, + 268, + 221, + 282 + ], + "score": 1.0, + "content": "Let the Bregman divergence", + "type": "text" + }, + { + "bbox": [ + 221, + 269, + 237, + 281 + ], + "score": 0.76, + "content": "D _ { \\varphi }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 268, + 242, + 282 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 243, + 268, + 384, + 281 + ], + "score": 0.88, + "content": "\\operatorname { d o m } ( \\bar { \\varphi } ) \\cdot \\operatorname { r e l i n t } ( \\operatorname { d o m } ( \\varphi ) ) \\to \\bar { \\mathbb { R } } _ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 268, + 439, + 282 + ], + "score": 1.0, + "content": "generated by", + "type": "text" + }, + { + "bbox": [ + 439, + 270, + 447, + 280 + ], + "score": 0.8, + "content": "\\varphi", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 268, + 505, + 282 + ], + "score": 1.0, + "content": "be defined by", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + } + ], + "index": 7.5, + "bbox_fs": [ + 87, + 211, + 507, + 236 + ] + }, + { + "type": "index", + "bbox": [ + 87, + 246, + 506, + 281 + ], + "lines": [], + "index": 10, + "bbox_fs": [ + 86, + 246, + 507, + 282 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 213, + 285, + 397, + 300 + ], + "lines": [ + { + "bbox": [ + 213, + 285, + 397, + 300 + ], + "spans": [ + { + "bbox": [ + 213, + 285, + 397, + 300 + ], + "score": 0.9, + "content": "D _ { \\varphi } ( x , y ) : = \\varphi ( x ) - \\varphi ( y ) - \\langle \\nabla \\varphi ( y ) , x - y \\rangle .", + "type": "interline_equation", + "image_path": "a088e4de3012dd22930fbf8bbcbaeac60e58c57b50440c99049b46934ecb5603.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 213, + 285, + 397, + 300 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 304, + 363, + 317 + ], + "lines": [ + { + "bbox": [ + 84, + 302, + 363, + 319 + ], + "spans": [ + { + "bbox": [ + 84, + 302, + 255, + 319 + ], + "score": 1.0, + "content": "192 We define the Bregman projection of", + "type": "text" + }, + { + "bbox": [ + 255, + 307, + 262, + 316 + ], + "score": 0.82, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 302, + 284, + 319 + ], + "score": 1.0, + "content": "onto", + "type": "text" + }, + { + "bbox": [ + 284, + 304, + 349, + 317 + ], + "score": 0.92, + "content": "{ \\mathcal { C } } ( \\theta ) \\subseteq \\mathrm { d o m } ( \\varphi )", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 302, + 363, + 319 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 84, + 302, + 363, + 319 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 224, + 321, + 386, + 343 + ], + "lines": [ + { + "bbox": [ + 224, + 321, + 386, + 343 + ], + "spans": [ + { + "bbox": [ + 224, + 321, + 386, + 343 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathrm { p r o j } _ { \\mathcal { C } } ^ { \\varphi } ( y , \\theta ) : = \\underset { x \\in \\mathcal { C } ( \\theta ) } { \\mathrm { a r g m i n } } D _ { \\varphi } ( x , \\nabla \\varphi ^ { \\ast } ( y ) ) . } \\end{array}", + "type": "interline_equation", + "image_path": "c7ff71d89425795cdecba2a0366df884c4bad19b5185cd83e5b56608b38f26e4.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 224, + 321, + 386, + 343 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "index", + "bbox": [ + 86, + 349, + 505, + 374 + ], + "lines": [ + { + "bbox": [ + 87, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 87, + 352, + 100, + 361 + ], + "score": 1.0, + "content": "193", + "type": "text" + }, + { + "bbox": [ + 104, + 349, + 265, + 362 + ], + "score": 1.0, + "content": "Definition (10) incudes the mirror map", + "type": "text" + }, + { + "bbox": [ + 265, + 349, + 299, + 362 + ], + "score": 0.93, + "content": "\\nabla \\varphi ^ { * } ( y )", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "for convenience. It can be seen as a mapping from", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 84, + 360, + 497, + 375 + ], + "spans": [ + { + "bbox": [ + 84, + 360, + 106, + 375 + ], + "score": 1.0, + "content": "194", + "type": "text" + }, + { + "bbox": [ + 106, + 361, + 119, + 371 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 360, + 131, + 375 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 131, + 361, + 165, + 374 + ], + "score": 0.88, + "content": "\\mathrm { d o m } ( \\varphi )", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 360, + 497, + 375 + ], + "score": 1.0, + "content": ", ensuring that (10) is well-defined. The mirror descent fixed point mapping is then", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + } + ], + "index": 15.5, + "bbox_fs": [ + 84, + 349, + 505, + 375 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 250, + 377, + 361, + 424 + ], + "lines": [ + { + "bbox": [ + 250, + 377, + 361, + 424 + ], + "spans": [ + { + "bbox": [ + 250, + 377, + 361, + 424 + ], + "score": 0.92, + "content": "\\begin{array} { c } { \\hat { x } = \\nabla \\varphi ( x ) } \\\\ { y = \\hat { x } - \\eta \\nabla _ { 1 } f ( x , \\theta ) } \\\\ { T ( x , \\theta ) = \\mathrm { p r o j } _ { \\mathcal { C } } ^ { \\varphi } ( y , \\theta ) . } \\end{array}", + "type": "interline_equation", + "image_path": "e899366ae5ecf7ce9f01f9380bb80a3429cbbdaeed0d51b4e8a4782c4d4f0680.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 250, + 377, + 361, + 400.5 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 250, + 400.5, + 361, + 424.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "index", + "bbox": [ + 87, + 426, + 505, + 482 + ], + "lines": [ + { + "bbox": [ + 86, + 427, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 86, + 429, + 100, + 438 + ], + "score": 1.0, + "content": "195", + "type": "text" + }, + { + "bbox": [ + 106, + 427, + 143, + 439 + ], + "score": 1.0, + "content": "Because", + "type": "text" + }, + { + "bbox": [ + 143, + 427, + 152, + 437 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 427, + 506, + 439 + ], + "score": 1.0, + "content": "involves the composition of several functions, manually deriving its JVP/VJP is error", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 438, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 86, + 440, + 100, + 449 + ], + "score": 1.0, + "content": "196", + "type": "text" + }, + { + "bbox": [ + 106, + 438, + 505, + 450 + ], + "score": 1.0, + "content": "prone. This shows that our approach leveraging autodiff allows to handle more advanced fixed point", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 446, + 508, + 462 + ], + "spans": [ + { + "bbox": [ + 86, + 450, + 100, + 460 + ], + "score": 1.0, + "content": "197", + "type": "text" + }, + { + "bbox": [ + 104, + 446, + 248, + 462 + ], + "score": 1.0, + "content": "mappings. A common example of", + "type": "text" + }, + { + "bbox": [ + 248, + 450, + 256, + 460 + ], + "score": 0.83, + "content": "\\varphi", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 446, + 266, + 462 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 267, + 448, + 357, + 460 + ], + "score": 0.92, + "content": "\\varphi ( \\bar { x } ) \\stackrel { - } { = } \\langle x , \\log x - 1 \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 446, + 389, + 462 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 389, + 447, + 450, + 461 + ], + "score": 0.92, + "content": "\\mathrm { d o m } ( \\varphi ) = \\mathbb { R } _ { + } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 446, + 508, + 462 + ], + "score": 1.0, + "content": ". In this case,", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 458, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 86, + 461, + 100, + 471 + ], + "score": 1.0, + "content": "198", + "type": "text" + }, + { + "bbox": [ + 106, + 459, + 122, + 471 + ], + "score": 0.9, + "content": "D _ { \\varphi }", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 458, + 506, + 472 + ], + "score": 1.0, + "content": "is the Kullback-Leibler divergence. An advantage of the Kullback-Leibler projection is that it", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 470, + 460, + 483 + ], + "spans": [ + { + "bbox": [ + 86, + 472, + 100, + 482 + ], + "score": 1.0, + "content": "199", + "type": "text" + }, + { + "bbox": [ + 105, + 470, + 460, + 483 + ], + "score": 1.0, + "content": "sometimes easier to compute than the Euclidean projection, as we detail in Appendix B.", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + } + ], + "index": 21, + "bbox_fs": [ + 86, + 427, + 508, + 483 + ] + }, + { + "type": "text", + "bbox": [ + 90, + 493, + 387, + 505 + ], + "lines": [ + { + "bbox": [ + 86, + 491, + 388, + 507 + ], + "spans": [ + { + "bbox": [ + 86, + 491, + 388, + 507 + ], + "score": 1.0, + "content": "200 Other fixed points. More fixed points are described in Appendix C.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 86, + 491, + 388, + 507 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 517, + 203, + 529 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 203, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 203, + 530 + ], + "score": 1.0, + "content": "2.3 Jacobian bounds", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 105, + 537, + 505, + 582 + ], + "lines": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "score": 1.0, + "content": "In practice, either by the limitations of finite precision arithmetic or because we perform a finite", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 325, + 561 + ], + "score": 1.0, + "content": "number of iterations, we rarely reach the exact solution", + "type": "text" + }, + { + "bbox": [ + 325, + 549, + 349, + 560 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 549, + 505, + 561 + ], + "score": 1.0, + "content": ", but instead only reach an approximate", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 560, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 142, + 572 + ], + "score": 1.0, + "content": "solution", + "type": "text" + }, + { + "bbox": [ + 142, + 560, + 150, + 570 + ], + "score": 0.81, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 560, + 505, + 572 + ], + "score": 1.0, + "content": "and apply the implicit differentiation equation (2) at this approximate solution. This", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 571, + 370, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 370, + 583 + ], + "score": 1.0, + "content": "motivates the need for approximation guarantees of this approach", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 537, + 505, + 583 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 585, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 105, + 583, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 180, + 598 + ], + "score": 1.0, + "content": "Definition 1. Let", + "type": "text" + }, + { + "bbox": [ + 181, + 584, + 266, + 596 + ], + "score": 0.91, + "content": "F : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 583, + 434, + 598 + ], + "score": 1.0, + "content": "be an optimality criterion mapping. Let", + "type": "text" + }, + { + "bbox": [ + 434, + 586, + 486, + 597 + ], + "score": 0.91, + "content": "A : = - \\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 583, + 506, + 598 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 149, + 608 + ], + "score": 0.89, + "content": "B : = \\partial _ { 2 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 596, + 294, + 609 + ], + "score": 1.0, + "content": ". We define the Jacobian estimate at", + "type": "text" + }, + { + "bbox": [ + 294, + 597, + 317, + 608 + ], + "score": 0.9, + "content": "( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 596, + 505, + 609 + ], + "score": 1.0, + "content": "as the solution to the following linear equation", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 607, + 371, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 211, + 621 + ], + "score": 0.91, + "content": "A ( x , \\theta ) J ( x , \\theta ) = B ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 607, + 276, + 621 + ], + "score": 1.0, + "content": ". It is a function", + "type": "text" + }, + { + "bbox": [ + 276, + 608, + 367, + 619 + ], + "score": 0.91, + "content": "J : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d \\times n }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 607, + 371, + 621 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 583, + 506, + 621 + ] + }, + { + "type": "index", + "bbox": [ + 86, + 628, + 505, + 684 + ], + "lines": [ + { + "bbox": [ + 86, + 628, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 86, + 630, + 100, + 641 + ], + "score": 1.0, + "content": "209", + "type": "text" + }, + { + "bbox": [ + 105, + 628, + 220, + 642 + ], + "score": 1.0, + "content": "It holds by construction that", + "type": "text" + }, + { + "bbox": [ + 221, + 629, + 310, + 641 + ], + "score": 0.93, + "content": "J ( x ^ { \\star } ( \\theta ) , \\theta ) = \\partial x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 628, + 361, + 642 + ], + "score": 1.0, + "content": ". Computing", + "type": "text" + }, + { + "bbox": [ + 362, + 629, + 391, + 641 + ], + "score": 0.92, + "content": "J ( \\hat { x } , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 628, + 505, + 642 + ], + "score": 1.0, + "content": "for an approximate solution", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 86, + 642, + 99, + 651 + ], + "score": 1.0, + "content": "210", + "type": "text" + }, + { + "bbox": [ + 106, + 640, + 114, + 650 + ], + "score": 0.76, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 639, + 126, + 653 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 126, + 640, + 149, + 651 + ], + "score": 0.92, + "content": "x ^ { \\star } ( { \\boldsymbol { \\theta } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 639, + 349, + 653 + ], + "score": 1.0, + "content": "therefore allows to approximate the true Jacobian", + "type": "text" + }, + { + "bbox": [ + 350, + 640, + 379, + 651 + ], + "score": 0.91, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 639, + 505, + 653 + ], + "score": 1.0, + "content": ". In practice, an algorithm used", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 650, + 505, + 663 + ], + "spans": [ + { + "bbox": [ + 86, + 653, + 99, + 662 + ], + "score": 1.0, + "content": "211", + "type": "text" + }, + { + "bbox": [ + 105, + 650, + 203, + 663 + ], + "score": 1.0, + "content": "to solve (1) depends on", + "type": "text" + }, + { + "bbox": [ + 203, + 651, + 209, + 660 + ], + "score": 0.69, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 650, + 454, + 663 + ], + "score": 1.0, + "content": ". Note however that, what we compute is not the Jacobian of", + "type": "text" + }, + { + "bbox": [ + 454, + 651, + 473, + 662 + ], + "score": 0.9, + "content": "{ \\hat { x } } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 650, + 505, + 663 + ], + "score": 1.0, + "content": ", unlike", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 661, + 506, + 675 + ], + "spans": [ + { + "bbox": [ + 85, + 663, + 100, + 673 + ], + "score": 1.0, + "content": "212", + "type": "text" + }, + { + "bbox": [ + 105, + 661, + 455, + 675 + ], + "score": 1.0, + "content": "works unrolling an algorithm that differentiate through its iterations, but an estimate of", + "type": "text" + }, + { + "bbox": [ + 455, + 662, + 484, + 674 + ], + "score": 0.91, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 661, + 506, + 675 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 672, + 373, + 685 + ], + "spans": [ + { + "bbox": [ + 85, + 674, + 100, + 685 + ], + "score": 1.0, + "content": "213", + "type": "text" + }, + { + "bbox": [ + 105, + 672, + 210, + 685 + ], + "score": 1.0, + "content": "therefore use the notation", + "type": "text" + }, + { + "bbox": [ + 210, + 673, + 217, + 682 + ], + "score": 0.82, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 672, + 330, + 685 + ], + "score": 1.0, + "content": ", leaving the dependence on", + "type": "text" + }, + { + "bbox": [ + 330, + 674, + 335, + 682 + ], + "score": 0.83, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 672, + 373, + 685 + ], + "score": 1.0, + "content": "implicit.", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 687, + 506, + 702 + ], + "spans": [ + { + "bbox": [ + 86, + 691, + 100, + 699 + ], + "score": 1.0, + "content": "214", + "type": "text" + }, + { + "bbox": [ + 103, + 687, + 233, + 702 + ], + "score": 1.0, + "content": "We develop bounds of the form", + "type": "text" + }, + { + "bbox": [ + 234, + 689, + 386, + 701 + ], + "score": 0.92, + "content": "\\| J ( \\hat { x } , \\theta ) - \\partial x ^ { \\star } ( \\theta ) \\| < C \\| \\hat { x } - x ^ { \\star } ( \\theta ) \\|", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 687, + 506, + 702 + ], + "score": 1.0, + "content": ", hence showing that the error", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 699, + 502, + 713 + ], + "spans": [ + { + "bbox": [ + 86, + 703, + 100, + 711 + ], + "score": 1.0, + "content": "215", + "type": "text" + }, + { + "bbox": [ + 104, + 699, + 373, + 713 + ], + "score": 1.0, + "content": "on the estimated Jacobian is at most of the same order as that of", + "type": "text" + }, + { + "bbox": [ + 374, + 702, + 380, + 710 + ], + "score": 0.82, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 699, + 479, + 713 + ], + "score": 1.0, + "content": "as an approximation of", + "type": "text" + }, + { + "bbox": [ + 479, + 700, + 502, + 712 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 711, + 493, + 723 + ], + "spans": [ + { + "bbox": [ + 85, + 712, + 100, + 722 + ], + "score": 1.0, + "content": "216", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 493, + 723 + ], + "score": 1.0, + "content": "These bounds are based on the following main theorem, whose proof is included in Appendix D.", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + } + ], + "index": 35, + "bbox_fs": [ + 85, + 628, + 506, + 685 + ] + }, + { + "type": "index", + "bbox": [ + 87, + 688, + 505, + 723 + ], + "lines": [], + "index": 39, + "bbox_fs": [ + 85, + 687, + 506, + 723 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 71, + 503, + 178 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 71, + 503, + 178 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 71, + 503, + 178 + ], + "spans": [ + { + "bbox": [ + 107, + 71, + 503, + 178 + ], + "score": 0.97, + "type": "image", + "image_path": "0af66743a2db58959a3b656101274b1470dc7521e9804b31e74545d40ee6ada6.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 71, + 503, + 106.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 106.66666666666666, + 503, + 142.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 142.33333333333331, + 503, + 177.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 185, + 506, + 262 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 185, + 506, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 506, + 199 + ], + "score": 1.0, + "content": "Figure 2: CPU runtime comparison of implicit differentiation and unrolling for hyperparameter", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 196, + 506, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 437, + 210 + ], + "score": 1.0, + "content": "optimization of multiclass SVMs for multiple problem sizes. Error bars represent", + "type": "text" + }, + { + "bbox": [ + 438, + 196, + 457, + 207 + ], + "score": 0.91, + "content": "90 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 196, + 506, + 210 + ], + "score": 1.0, + "content": "confidence", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 207, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 506, + 219 + ], + "score": 1.0, + "content": "intervals. (a) Mirror descent solver, with mirror descent fixed point for implicit differentiation.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 217, + 506, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 120, + 229 + ], + "score": 0.26, + "content": "\\mathbf { ( b ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 217, + 506, + 232 + ], + "score": 1.0, + "content": "Proximal gradient solver, with proximal gradient fixed point for implicit differentiation. (c)", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 228, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 393, + 241 + ], + "score": 1.0, + "content": "Block coordinate descent solver; for implicit differentiation we obtain", + "type": "text" + }, + { + "bbox": [ + 393, + 229, + 417, + 241 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 228, + 505, + 241 + ], + "score": 1.0, + "content": "by BCD but perform", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 505, + 253 + ], + "score": 1.0, + "content": "differentiation with the mirror descent and proximal gradient fixed points. This showcases that the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 250, + 316, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 316, + 263 + ], + "score": 1.0, + "content": "solver and fixed point can be independently chosen.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 95, + 280, + 506, + 305 + ], + "lines": [ + { + "bbox": [ + 91, + 279, + 504, + 295 + ], + "spans": [ + { + "bbox": [ + 91, + 279, + 255, + 295 + ], + "score": 1.0, + "content": "Theorem 1 (Jacobian estimate). Let 17", + "type": "text" + }, + { + "bbox": [ + 256, + 281, + 337, + 292 + ], + "score": 0.92, + "content": "F : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 279, + 436, + 295 + ], + "score": 1.0, + "content": ". Assume that there exist", + "type": "text" + }, + { + "bbox": [ + 437, + 282, + 504, + 293 + ], + "score": 0.89, + "content": "\\alpha , \\beta , \\gamma , \\varepsilon , R > 0", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 90, + 291, + 507, + 307 + ], + "spans": [ + { + "bbox": [ + 90, + 291, + 144, + 307 + ], + "score": 1.0, + "content": "such that 18", + "type": "text" + }, + { + "bbox": [ + 144, + 293, + 191, + 304 + ], + "score": 0.92, + "content": "A = - \\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 291, + 209, + 307 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 209, + 293, + 249, + 304 + ], + "score": 0.92, + "content": "B = \\partial _ { 2 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 291, + 306, + 307 + ], + "score": 1.0, + "content": "satisfy, for all", + "type": "text" + }, + { + "bbox": [ + 306, + 293, + 336, + 303 + ], + "score": 0.86, + "content": "v \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 291, + 339, + 307 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 340, + 293, + 370, + 303 + ], + "score": 0.88, + "content": "\\boldsymbol \\theta \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 291, + 388, + 307 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 389, + 295, + 396, + 303 + ], + "score": 0.67, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 291, + 434, + 307 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 435, + 293, + 502, + 305 + ], + "score": 0.9, + "content": "\\| x - x ^ { \\star } ( \\theta ) \\| \\leq \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 291, + 507, + 307 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 98, + 308, + 504, + 322 + ], + "lines": [ + { + "bbox": [ + 107, + 307, + 504, + 324 + ], + "spans": [ + { + "bbox": [ + 107, + 310, + 115, + 319 + ], + "score": 0.35, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 307, + 234, + 324 + ], + "score": 1.0, + "content": "is well-conditioned, Lipschitz:", + "type": "text" + }, + { + "bbox": [ + 235, + 308, + 504, + 322 + ], + "score": 0.78, + "content": "\\| A ( x , \\theta ) v \\| \\geq \\alpha \\| v \\| , \\| A ( x , \\theta ) - A ( x ^ { \\star } ( \\theta ) , \\theta ) \\| _ { o p } \\leq \\gamma \\| x - x ^ { \\star } ( \\theta ) \\| .", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 97, + 325, + 488, + 339 + ], + "lines": [ + { + "bbox": [ + 93, + 324, + 491, + 340 + ], + "spans": [ + { + "bbox": [ + 93, + 324, + 106, + 340 + ], + "score": 1.0, + "content": "20", + "type": "text" + }, + { + "bbox": [ + 106, + 326, + 116, + 336 + ], + "score": 0.66, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 324, + 223, + 340 + ], + "score": 1.0, + "content": "is bounded and Lipschitz:", + "type": "text" + }, + { + "bbox": [ + 226, + 325, + 491, + 338 + ], + "score": 0.79, + "content": "\\begin{array} { r } { | B ( x ^ { \\star } ( \\theta ) , \\theta ) | | \\leq R , \\| B ( x , \\theta ) - B ( x ^ { \\star } ( \\theta ) , \\theta ) \\| \\leq \\beta \\| x - x ^ { \\star } ( \\theta ) \\| . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 96, + 342, + 335, + 354 + ], + "lines": [ + { + "bbox": [ + 93, + 340, + 336, + 355 + ], + "spans": [ + { + "bbox": [ + 93, + 340, + 227, + 355 + ], + "score": 1.0, + "content": "Under these conditions, when 21", + "type": "text" + }, + { + "bbox": [ + 228, + 342, + 297, + 354 + ], + "score": 0.92, + "content": "\\| { \\hat { x } } - x ^ { \\star } ( \\theta ) \\| \\leq \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 340, + 336, + 355 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 357, + 419, + 372 + ], + "lines": [ + { + "bbox": [ + 191, + 357, + 419, + 372 + ], + "spans": [ + { + "bbox": [ + 191, + 357, + 419, + 372 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\| J ( \\hat { x } , \\theta ) - \\partial x ^ { \\star } ( \\theta ) \\| \\leq \\left( \\beta \\alpha ^ { - 1 } + \\gamma R \\alpha ^ { - 2 } \\right) \\| \\hat { x } - x ^ { \\star } ( \\theta ) \\| . } \\end{array}", + "type": "interline_equation", + "image_path": "15d30cda339469d47f6995eac2392e8290c4da235b4b5eb80eb55d8175757963.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 191, + 357, + 419, + 372 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 379, + 506, + 425 + ], + "lines": [ + { + "bbox": [ + 86, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 86, + 382, + 99, + 391 + ], + "score": 1.0, + "content": "222", + "type": "text" + }, + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "This result is similar to [40, Theorem 7.2], that is concerned with the stability of solutions to inverse", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 86, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 86, + 393, + 100, + 402 + ], + "score": 1.0, + "content": "223", + "type": "text" + }, + { + "bbox": [ + 105, + 390, + 243, + 403 + ], + "score": 1.0, + "content": "problems. Here we consider that", + "type": "text" + }, + { + "bbox": [ + 244, + 391, + 272, + 403 + ], + "score": 0.93, + "content": "A ( \\cdot , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 390, + 479, + 403 + ], + "score": 1.0, + "content": "is uniformly well-conditioned, rather than only at", + "type": "text" + }, + { + "bbox": [ + 479, + 391, + 502, + 403 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 390, + 506, + 403 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 86, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 86, + 404, + 99, + 413 + ], + "score": 1.0, + "content": "224", + "type": "text" + }, + { + "bbox": [ + 105, + 401, + 258, + 414 + ], + "score": 1.0, + "content": "This does not affect the first order in", + "type": "text" + }, + { + "bbox": [ + 259, + 404, + 265, + 412 + ], + "score": 0.77, + "content": "\\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 401, + 431, + 414 + ], + "score": 1.0, + "content": "of this bound, and makes it valid for all", + "type": "text" + }, + { + "bbox": [ + 432, + 402, + 438, + 412 + ], + "score": 0.82, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 401, + 506, + 414 + ], + "score": 1.0, + "content": ". It is also more", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 86, + 412, + 307, + 425 + ], + "spans": [ + { + "bbox": [ + 86, + 415, + 99, + 424 + ], + "score": 1.0, + "content": "225", + "type": "text" + }, + { + "bbox": [ + 105, + 412, + 307, + 425 + ], + "score": 1.0, + "content": "tailored to applications to equation-specific cases.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 94, + 429, + 505, + 452 + ], + "lines": [ + { + "bbox": [ + 91, + 429, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 91, + 429, + 320, + 442 + ], + "score": 1.0, + "content": "26 Indeed, Theorem 1 can be applied to specific functions", + "type": "text" + }, + { + "bbox": [ + 320, + 430, + 329, + 439 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 429, + 340, + 442 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 340, + 430, + 349, + 439 + ], + "score": 0.82, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 429, + 506, + 442 + ], + "score": 1.0, + "content": "for some root and fixed-point equations.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 92, + 440, + 473, + 453 + ], + "spans": [ + { + "bbox": [ + 92, + 440, + 316, + 453 + ], + "score": 1.0, + "content": "27 In particular, for gradient descent fixed point, where", + "type": "text" + }, + { + "bbox": [ + 316, + 440, + 425, + 452 + ], + "score": 0.92, + "content": "T ( x , \\theta ) = x - \\eta \\nabla _ { 1 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 440, + 473, + 453 + ], + "score": 1.0, + "content": ", this yields", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 86, + 472, + 509, + 495 + ], + "lines": [ + { + "bbox": [ + 86, + 471, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 86, + 474, + 100, + 484 + ], + "score": 1.0, + "content": "228", + "type": "text" + }, + { + "bbox": [ + 104, + 471, + 444, + 486 + ], + "score": 1.0, + "content": "This guarantees precision on the estimated Jacobian under regularity conditions on", + "type": "text" + }, + { + "bbox": [ + 445, + 473, + 452, + 484 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 471, + 505, + 486 + ], + "score": 1.0, + "content": "directly; see", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 86, + 483, + 219, + 496 + ], + "spans": [ + { + "bbox": [ + 86, + 485, + 101, + 495 + ], + "score": 1.0, + "content": "229", + "type": "text" + }, + { + "bbox": [ + 103, + 483, + 219, + 496 + ], + "score": 1.0, + "content": "Corollary 1 in Appendix D.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 87, + 498, + 458, + 513 + ], + "lines": [ + { + "bbox": [ + 84, + 498, + 459, + 514 + ], + "spans": [ + { + "bbox": [ + 84, + 498, + 258, + 514 + ], + "score": 1.0, + "content": "For proximal gradient descent, where 230", + "type": "text" + }, + { + "bbox": [ + 258, + 499, + 412, + 513 + ], + "score": 0.93, + "content": "T ( x , \\theta ) = \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 498, + 459, + 514 + ], + "score": 1.0, + "content": ", this yields", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 125, + 515, + 485, + 549 + ], + "lines": [ + { + "bbox": [ + 125, + 515, + 485, + 549 + ], + "spans": [ + { + "bbox": [ + 125, + 515, + 485, + 549 + ], + "score": 0.8, + "content": "\\begin{array} { r l } & { A ( x , \\theta ) = I - \\partial _ { 1 } T ( x , \\theta ) = I - ( I - \\eta \\nabla _ { 1 } ^ { 2 } f ( x , \\theta ) ) \\partial _ { 1 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) } \\\\ & { B ( x , \\theta ) = \\partial _ { 2 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) - \\eta \\partial _ { 2 } \\nabla _ { 1 } f ( x , \\theta ) \\partial _ { 1 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) . } \\end{array}", + "type": "interline_equation", + "image_path": "fe878e3b82984ab157f104a97b62a728183a6d5ccca5d88bcd2e17a29f7a4920.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 125, + 515, + 485, + 526.3333333333334 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 125, + 526.3333333333334, + 485, + 537.6666666666667 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 125, + 537.6666666666667, + 485, + 549.0000000000001 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 86, + 550, + 506, + 595 + ], + "lines": [ + { + "bbox": [ + 86, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 86, + 552, + 99, + 562 + ], + "score": 1.0, + "content": "231", + "type": "text" + }, + { + "bbox": [ + 106, + 550, + 397, + 563 + ], + "score": 1.0, + "content": "An important special case is that of a function to minimize in the form", + "type": "text" + }, + { + "bbox": [ + 398, + 550, + 458, + 563 + ], + "score": 0.93, + "content": "f ( x , \\theta ) + g ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 550, + 505, + 563 + ], + "score": 1.0, + "content": ", where the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 86, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 86, + 563, + 99, + 573 + ], + "score": 1.0, + "content": "232", + "type": "text" + }, + { + "bbox": [ + 106, + 561, + 163, + 574 + ], + "score": 1.0, + "content": "prox function", + "type": "text" + }, + { + "bbox": [ + 163, + 563, + 170, + 573 + ], + "score": 0.82, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 561, + 312, + 574 + ], + "score": 1.0, + "content": "is smooth, and does not depend on", + "type": "text" + }, + { + "bbox": [ + 313, + 562, + 319, + 571 + ], + "score": 0.79, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 561, + 465, + 574 + ], + "score": 1.0, + "content": ", as is the case in our experiments in", + "type": "text" + }, + { + "bbox": [ + 466, + 562, + 485, + 572 + ], + "score": 0.88, + "content": "\\ S 3 . 2", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 561, + 506, + 574 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 86, + 572, + 504, + 583 + ], + "spans": [ + { + "bbox": [ + 86, + 574, + 99, + 583 + ], + "score": 1.0, + "content": "233", + "type": "text" + }, + { + "bbox": [ + 106, + 572, + 504, + 583 + ], + "score": 1.0, + "content": "this setting, we derive similar guarantees in Corollary 2 in Appendix D. Recent work also exploits", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 86, + 582, + 401, + 597 + ], + "spans": [ + { + "bbox": [ + 86, + 585, + 99, + 595 + ], + "score": 1.0, + "content": "234", + "type": "text" + }, + { + "bbox": [ + 105, + 582, + 401, + 597 + ], + "score": 1.0, + "content": "local smoothness of solutions to derive similar bounds [11, Theorem 13].", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29.5 + }, + { + "type": "title", + "bbox": [ + 101, + 609, + 191, + 623 + ], + "lines": [ + { + "bbox": [ + 103, + 607, + 193, + 627 + ], + "spans": [ + { + "bbox": [ + 103, + 607, + 193, + 627 + ], + "score": 1.0, + "content": "3 Experiments", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 106, + 634, + 505, + 667 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "To conclude this work, we demonstrate the ease of formulating and solving bi-level optimization", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "problems with our modular framework. We also present an application to the sensitivity analysis of", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 656, + 192, + 668 + ], + "spans": [ + { + "bbox": [ + 106, + 656, + 192, + 668 + ], + "score": 1.0, + "content": "molecular dynamics.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "title", + "bbox": [ + 105, + 679, + 343, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 678, + 344, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 344, + 694 + ], + "score": 1.0, + "content": "3.1 Hyperparameter optimization of multiclass SVMs", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 93, + 700, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 90, + 700, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 90, + 700, + 505, + 712 + ], + "score": 1.0, + "content": "40 In this example, we consider the hyperparamer optimization of multiclass SVMs [23] trained in the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 90, + 710, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 90, + 710, + 154, + 723 + ], + "score": 1.0, + "content": "dual. Here, 41", + "type": "text" + }, + { + "bbox": [ + 154, + 711, + 178, + 723 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 710, + 367, + 723 + ], + "score": 1.0, + "content": "is the optimal dual solution, a matrix of shape", + "type": "text" + }, + { + "bbox": [ + 367, + 711, + 394, + 721 + ], + "score": 0.9, + "content": "m \\times k", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 710, + 425, + 723 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 425, + 713, + 435, + 721 + ], + "score": 0.75, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 710, + 506, + 723 + ], + "score": 1.0, + "content": "is the number of", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 741, + 308, + 750 + ], + "lines": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "spans": [ + { + "bbox": [ + 302, + 741, + 309, + 752 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 71, + 503, + 178 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 71, + 503, + 178 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 71, + 503, + 178 + ], + "spans": [ + { + "bbox": [ + 107, + 71, + 503, + 178 + ], + "score": 0.97, + "type": "image", + "image_path": "0af66743a2db58959a3b656101274b1470dc7521e9804b31e74545d40ee6ada6.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 71, + 503, + 106.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 106.66666666666666, + 503, + 142.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 142.33333333333331, + 503, + 177.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 185, + 506, + 262 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 185, + 506, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 506, + 199 + ], + "score": 1.0, + "content": "Figure 2: CPU runtime comparison of implicit differentiation and unrolling for hyperparameter", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 196, + 506, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 437, + 210 + ], + "score": 1.0, + "content": "optimization of multiclass SVMs for multiple problem sizes. Error bars represent", + "type": "text" + }, + { + "bbox": [ + 438, + 196, + 457, + 207 + ], + "score": 0.91, + "content": "90 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 196, + 506, + 210 + ], + "score": 1.0, + "content": "confidence", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 207, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 506, + 219 + ], + "score": 1.0, + "content": "intervals. (a) Mirror descent solver, with mirror descent fixed point for implicit differentiation.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 217, + 506, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 120, + 229 + ], + "score": 0.26, + "content": "\\mathbf { ( b ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 217, + 506, + 232 + ], + "score": 1.0, + "content": "Proximal gradient solver, with proximal gradient fixed point for implicit differentiation. (c)", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 228, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 228, + 393, + 241 + ], + "score": 1.0, + "content": "Block coordinate descent solver; for implicit differentiation we obtain", + "type": "text" + }, + { + "bbox": [ + 393, + 229, + 417, + 241 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 228, + 505, + 241 + ], + "score": 1.0, + "content": "by BCD but perform", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 505, + 253 + ], + "score": 1.0, + "content": "differentiation with the mirror descent and proximal gradient fixed points. This showcases that the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 250, + 316, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 316, + 263 + ], + "score": 1.0, + "content": "solver and fixed point can be independently chosen.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 95, + 280, + 506, + 305 + ], + "lines": [ + { + "bbox": [ + 91, + 279, + 504, + 295 + ], + "spans": [ + { + "bbox": [ + 91, + 279, + 255, + 295 + ], + "score": 1.0, + "content": "Theorem 1 (Jacobian estimate). Let 17", + "type": "text" + }, + { + "bbox": [ + 256, + 281, + 337, + 292 + ], + "score": 0.92, + "content": "F : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 279, + 436, + 295 + ], + "score": 1.0, + "content": ". Assume that there exist", + "type": "text" + }, + { + "bbox": [ + 437, + 282, + 504, + 293 + ], + "score": 0.89, + "content": "\\alpha , \\beta , \\gamma , \\varepsilon , R > 0", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 90, + 291, + 507, + 307 + ], + "spans": [ + { + "bbox": [ + 90, + 291, + 144, + 307 + ], + "score": 1.0, + "content": "such that 18", + "type": "text" + }, + { + "bbox": [ + 144, + 293, + 191, + 304 + ], + "score": 0.92, + "content": "A = - \\partial _ { 1 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 291, + 209, + 307 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 209, + 293, + 249, + 304 + ], + "score": 0.92, + "content": "B = \\partial _ { 2 } F", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 291, + 306, + 307 + ], + "score": 1.0, + "content": "satisfy, for all", + "type": "text" + }, + { + "bbox": [ + 306, + 293, + 336, + 303 + ], + "score": 0.86, + "content": "v \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 291, + 339, + 307 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 340, + 293, + 370, + 303 + ], + "score": 0.88, + "content": "\\boldsymbol \\theta \\in \\mathbb { R } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 291, + 388, + 307 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 389, + 295, + 396, + 303 + ], + "score": 0.67, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 291, + 434, + 307 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 435, + 293, + 502, + 305 + ], + "score": 0.9, + "content": "\\| x - x ^ { \\star } ( \\theta ) \\| \\leq \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 291, + 507, + 307 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 90, + 279, + 507, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 98, + 308, + 504, + 322 + ], + "lines": [ + { + "bbox": [ + 107, + 307, + 504, + 324 + ], + "spans": [ + { + "bbox": [ + 107, + 310, + 115, + 319 + ], + "score": 0.35, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 307, + 234, + 324 + ], + "score": 1.0, + "content": "is well-conditioned, Lipschitz:", + "type": "text" + }, + { + "bbox": [ + 235, + 308, + 504, + 322 + ], + "score": 0.78, + "content": "\\| A ( x , \\theta ) v \\| \\geq \\alpha \\| v \\| , \\| A ( x , \\theta ) - A ( x ^ { \\star } ( \\theta ) , \\theta ) \\| _ { o p } \\leq \\gamma \\| x - x ^ { \\star } ( \\theta ) \\| .", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 107, + 307, + 504, + 324 + ] + }, + { + "type": "text", + "bbox": [ + 97, + 325, + 488, + 339 + ], + "lines": [ + { + "bbox": [ + 93, + 324, + 491, + 340 + ], + "spans": [ + { + "bbox": [ + 93, + 324, + 106, + 340 + ], + "score": 1.0, + "content": "20", + "type": "text" + }, + { + "bbox": [ + 106, + 326, + 116, + 336 + ], + "score": 0.66, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 324, + 223, + 340 + ], + "score": 1.0, + "content": "is bounded and Lipschitz:", + "type": "text" + }, + { + "bbox": [ + 226, + 325, + 491, + 338 + ], + "score": 0.79, + "content": "\\begin{array} { r } { | B ( x ^ { \\star } ( \\theta ) , \\theta ) | | \\leq R , \\| B ( x , \\theta ) - B ( x ^ { \\star } ( \\theta ) , \\theta ) \\| \\leq \\beta \\| x - x ^ { \\star } ( \\theta ) \\| . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 93, + 324, + 491, + 340 + ] + }, + { + "type": "text", + "bbox": [ + 96, + 342, + 335, + 354 + ], + "lines": [ + { + "bbox": [ + 93, + 340, + 336, + 355 + ], + "spans": [ + { + "bbox": [ + 93, + 340, + 227, + 355 + ], + "score": 1.0, + "content": "Under these conditions, when 21", + "type": "text" + }, + { + "bbox": [ + 228, + 342, + 297, + 354 + ], + "score": 0.92, + "content": "\\| { \\hat { x } } - x ^ { \\star } ( \\theta ) \\| \\leq \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 340, + 336, + 355 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 93, + 340, + 336, + 355 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 357, + 419, + 372 + ], + "lines": [ + { + "bbox": [ + 191, + 357, + 419, + 372 + ], + "spans": [ + { + "bbox": [ + 191, + 357, + 419, + 372 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\| J ( \\hat { x } , \\theta ) - \\partial x ^ { \\star } ( \\theta ) \\| \\leq \\left( \\beta \\alpha ^ { - 1 } + \\gamma R \\alpha ^ { - 2 } \\right) \\| \\hat { x } - x ^ { \\star } ( \\theta ) \\| . } \\end{array}", + "type": "interline_equation", + "image_path": "15d30cda339469d47f6995eac2392e8290c4da235b4b5eb80eb55d8175757963.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 191, + 357, + 419, + 372 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "index", + "bbox": [ + 86, + 379, + 506, + 425 + ], + "lines": [ + { + "bbox": [ + 86, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 86, + 382, + 99, + 391 + ], + "score": 1.0, + "content": "222", + "type": "text" + }, + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "This result is similar to [40, Theorem 7.2], that is concerned with the stability of solutions to inverse", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 86, + 393, + 100, + 402 + ], + "score": 1.0, + "content": "223", + "type": "text" + }, + { + "bbox": [ + 105, + 390, + 243, + 403 + ], + "score": 1.0, + "content": "problems. Here we consider that", + "type": "text" + }, + { + "bbox": [ + 244, + 391, + 272, + 403 + ], + "score": 0.93, + "content": "A ( \\cdot , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 390, + 479, + 403 + ], + "score": 1.0, + "content": "is uniformly well-conditioned, rather than only at", + "type": "text" + }, + { + "bbox": [ + 479, + 391, + 502, + 403 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 390, + 506, + 403 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 401, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 86, + 404, + 99, + 413 + ], + "score": 1.0, + "content": "224", + "type": "text" + }, + { + "bbox": [ + 105, + 401, + 258, + 414 + ], + "score": 1.0, + "content": "This does not affect the first order in", + "type": "text" + }, + { + "bbox": [ + 259, + 404, + 265, + 412 + ], + "score": 0.77, + "content": "\\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 401, + 431, + 414 + ], + "score": 1.0, + "content": "of this bound, and makes it valid for all", + "type": "text" + }, + { + "bbox": [ + 432, + 402, + 438, + 412 + ], + "score": 0.82, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 401, + 506, + 414 + ], + "score": 1.0, + "content": ". It is also more", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 412, + 307, + 425 + ], + "spans": [ + { + "bbox": [ + 86, + 415, + 99, + 424 + ], + "score": 1.0, + "content": "225", + "type": "text" + }, + { + "bbox": [ + 105, + 412, + 307, + 425 + ], + "score": 1.0, + "content": "tailored to applications to equation-specific cases.", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 91, + 429, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 91, + 429, + 320, + 442 + ], + "score": 1.0, + "content": "26 Indeed, Theorem 1 can be applied to specific functions", + "type": "text" + }, + { + "bbox": [ + 320, + 430, + 329, + 439 + ], + "score": 0.85, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 429, + 340, + 442 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 340, + 430, + 349, + 439 + ], + "score": 0.82, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 429, + 506, + 442 + ], + "score": 1.0, + "content": "for some root and fixed-point equations.", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 92, + 440, + 473, + 453 + ], + "spans": [ + { + "bbox": [ + 92, + 440, + 316, + 453 + ], + "score": 1.0, + "content": "27 In particular, for gradient descent fixed point, where", + "type": "text" + }, + { + "bbox": [ + 316, + 440, + 425, + 452 + ], + "score": 0.92, + "content": "T ( x , \\theta ) = x - \\eta \\nabla _ { 1 } f ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 440, + 473, + 453 + ], + "score": 1.0, + "content": ", this yields", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 471, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 86, + 474, + 100, + 484 + ], + "score": 1.0, + "content": "228", + "type": "text" + }, + { + "bbox": [ + 104, + 471, + 444, + 486 + ], + "score": 1.0, + "content": "This guarantees precision on the estimated Jacobian under regularity conditions on", + "type": "text" + }, + { + "bbox": [ + 445, + 473, + 452, + 484 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 471, + 505, + 486 + ], + "score": 1.0, + "content": "directly; see", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 483, + 219, + 496 + ], + "spans": [ + { + "bbox": [ + 86, + 485, + 101, + 495 + ], + "score": 1.0, + "content": "229", + "type": "text" + }, + { + "bbox": [ + 103, + 483, + 219, + 496 + ], + "score": 1.0, + "content": "Corollary 1 in Appendix D.", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + } + ], + "index": 17.5, + "bbox_fs": [ + 86, + 379, + 506, + 425 + ] + }, + { + "type": "index", + "bbox": [ + 94, + 429, + 505, + 452 + ], + "lines": [], + "index": 20.5, + "bbox_fs": [ + 91, + 429, + 506, + 453 + ], + "lines_deleted": true + }, + { + "type": "index", + "bbox": [ + 86, + 472, + 509, + 495 + ], + "lines": [], + "index": 22.5, + "bbox_fs": [ + 86, + 471, + 505, + 496 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 87, + 498, + 458, + 513 + ], + "lines": [ + { + "bbox": [ + 84, + 498, + 459, + 514 + ], + "spans": [ + { + "bbox": [ + 84, + 498, + 258, + 514 + ], + "score": 1.0, + "content": "For proximal gradient descent, where 230", + "type": "text" + }, + { + "bbox": [ + 258, + 499, + 412, + 513 + ], + "score": 0.93, + "content": "T ( x , \\theta ) = \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 498, + 459, + 514 + ], + "score": 1.0, + "content": ", this yields", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 84, + 498, + 459, + 514 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 125, + 515, + 485, + 549 + ], + "lines": [ + { + "bbox": [ + 125, + 515, + 485, + 549 + ], + "spans": [ + { + "bbox": [ + 125, + 515, + 485, + 549 + ], + "score": 0.8, + "content": "\\begin{array} { r l } & { A ( x , \\theta ) = I - \\partial _ { 1 } T ( x , \\theta ) = I - ( I - \\eta \\nabla _ { 1 } ^ { 2 } f ( x , \\theta ) ) \\partial _ { 1 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) } \\\\ & { B ( x , \\theta ) = \\partial _ { 2 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) - \\eta \\partial _ { 2 } \\nabla _ { 1 } f ( x , \\theta ) \\partial _ { 1 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) . } \\end{array}", + "type": "interline_equation", + "image_path": "fe878e3b82984ab157f104a97b62a728183a6d5ccca5d88bcd2e17a29f7a4920.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 125, + 515, + 485, + 526.3333333333334 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 125, + 526.3333333333334, + 485, + 537.6666666666667 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 125, + 537.6666666666667, + 485, + 549.0000000000001 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "index", + "bbox": [ + 86, + 550, + 506, + 595 + ], + "lines": [ + { + "bbox": [ + 86, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 86, + 552, + 99, + 562 + ], + "score": 1.0, + "content": "231", + "type": "text" + }, + { + "bbox": [ + 106, + 550, + 397, + 563 + ], + "score": 1.0, + "content": "An important special case is that of a function to minimize in the form", + "type": "text" + }, + { + "bbox": [ + 398, + 550, + 458, + 563 + ], + "score": 0.93, + "content": "f ( x , \\theta ) + g ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 550, + 505, + 563 + ], + "score": 1.0, + "content": ", where the", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 86, + 563, + 99, + 573 + ], + "score": 1.0, + "content": "232", + "type": "text" + }, + { + "bbox": [ + 106, + 561, + 163, + 574 + ], + "score": 1.0, + "content": "prox function", + "type": "text" + }, + { + "bbox": [ + 163, + 563, + 170, + 573 + ], + "score": 0.82, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 561, + 312, + 574 + ], + "score": 1.0, + "content": "is smooth, and does not depend on", + "type": "text" + }, + { + "bbox": [ + 313, + 562, + 319, + 571 + ], + "score": 0.79, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 561, + 465, + 574 + ], + "score": 1.0, + "content": ", as is the case in our experiments in", + "type": "text" + }, + { + "bbox": [ + 466, + 562, + 485, + 572 + ], + "score": 0.88, + "content": "\\ S 3 . 2", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 561, + 506, + 574 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 572, + 504, + 583 + ], + "spans": [ + { + "bbox": [ + 86, + 574, + 99, + 583 + ], + "score": 1.0, + "content": "233", + "type": "text" + }, + { + "bbox": [ + 106, + 572, + 504, + 583 + ], + "score": 1.0, + "content": "this setting, we derive similar guarantees in Corollary 2 in Appendix D. Recent work also exploits", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 582, + 401, + 597 + ], + "spans": [ + { + "bbox": [ + 86, + 585, + 99, + 595 + ], + "score": 1.0, + "content": "234", + "type": "text" + }, + { + "bbox": [ + 105, + 582, + 401, + 597 + ], + "score": 1.0, + "content": "local smoothness of solutions to derive similar bounds [11, Theorem 13].", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + } + ], + "index": 29.5, + "bbox_fs": [ + 86, + 550, + 506, + 597 + ] + }, + { + "type": "title", + "bbox": [ + 101, + 609, + 191, + 623 + ], + "lines": [ + { + "bbox": [ + 103, + 607, + 193, + 627 + ], + "spans": [ + { + "bbox": [ + 103, + 607, + 193, + 627 + ], + "score": 1.0, + "content": "3 Experiments", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 106, + 634, + 505, + 667 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "To conclude this work, we demonstrate the ease of formulating and solving bi-level optimization", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "problems with our modular framework. We also present an application to the sensitivity analysis of", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 656, + 192, + 668 + ], + "spans": [ + { + "bbox": [ + 106, + 656, + 192, + 668 + ], + "score": 1.0, + "content": "molecular dynamics.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 633, + 506, + 668 + ] + }, + { + "type": "title", + "bbox": [ + 105, + 679, + 343, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 678, + 344, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 678, + 344, + 694 + ], + "score": 1.0, + "content": "3.1 Hyperparameter optimization of multiclass SVMs", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 93, + 700, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 90, + 700, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 90, + 700, + 505, + 712 + ], + "score": 1.0, + "content": "40 In this example, we consider the hyperparamer optimization of multiclass SVMs [23] trained in the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 90, + 710, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 90, + 710, + 154, + 723 + ], + "score": 1.0, + "content": "dual. Here, 41", + "type": "text" + }, + { + "bbox": [ + 154, + 711, + 178, + 723 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 710, + 367, + 723 + ], + "score": 1.0, + "content": "is the optimal dual solution, a matrix of shape", + "type": "text" + }, + { + "bbox": [ + 367, + 711, + 394, + 721 + ], + "score": 0.9, + "content": "m \\times k", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 710, + 425, + 723 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 425, + 713, + 435, + 721 + ], + "score": 0.75, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 710, + 506, + 723 + ], + "score": 1.0, + "content": "is the number of", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 90, + 700, + 506, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 139, + 93, + 471, + 128 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 111, + 77, + 493, + 89 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 115, + 75, + 494, + 91 + ], + "spans": [ + { + "bbox": [ + 115, + 75, + 219, + 91 + ], + "score": 1.0, + "content": "Table 2: Mean AUC (and", + "type": "text" + }, + { + "bbox": [ + 220, + 78, + 240, + 88 + ], + "score": 0.86, + "content": "9 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 75, + 494, + 91 + ], + "score": 1.0, + "content": "confidence interval) for the cancer survival prediction problem.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 139, + 93, + 471, + 128 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 139, + 93, + 471, + 128 + ], + "spans": [ + { + "bbox": [ + 139, + 93, + 471, + 128 + ], + "score": 0.966, + "html": "
MethodL1 logregL2 logregDictL + L2 logregTask-driven DictL
AUC (%)71.6 ± 2.072.4± 2.868.3 ± 2.373.2 ± 2.1
", + "type": "table", + "image_path": "b4da6ef103b91449058c5866c3a3686ffb12de8e8375b30e6411a8f9996f2d45.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 139, + 93, + 471, + 104.66666666666667 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 139, + 104.66666666666667, + 471, + 116.33333333333334 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 139, + 116.33333333333334, + 471, + 128.0 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "text", + "bbox": [ + 86, + 153, + 505, + 211 + ], + "lines": [ + { + "bbox": [ + 85, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 85, + 155, + 100, + 165 + ], + "score": 1.0, + "content": "242", + "type": "text" + }, + { + "bbox": [ + 105, + 154, + 198, + 166 + ], + "score": 1.0, + "content": "training examples and", + "type": "text" + }, + { + "bbox": [ + 198, + 154, + 205, + 164 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 154, + 325, + 166 + ], + "score": 1.0, + "content": "is the number of classes, and", + "type": "text" + }, + { + "bbox": [ + 325, + 154, + 357, + 165 + ], + "score": 0.91, + "content": "\\theta \\in \\mathbb { R } _ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "is the regularization parameter. The", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 85, + 163, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 85, + 166, + 100, + 176 + ], + "score": 1.0, + "content": "243", + "type": "text" + }, + { + "bbox": [ + 105, + 163, + 214, + 178 + ], + "score": 1.0, + "content": "challenge in differentiating", + "type": "text" + }, + { + "bbox": [ + 214, + 164, + 239, + 177 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 163, + 315, + 178 + ], + "score": 1.0, + "content": "is that each row of", + "type": "text" + }, + { + "bbox": [ + 315, + 165, + 339, + 177 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 163, + 505, + 178 + ], + "score": 1.0, + "content": "is constrained to belong to the probability", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 85, + 174, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 85, + 178, + 100, + 188 + ], + "score": 1.0, + "content": "244", + "type": "text" + }, + { + "bbox": [ + 104, + 174, + 140, + 190 + ], + "score": 1.0, + "content": "simplex", + "type": "text" + }, + { + "bbox": [ + 140, + 176, + 155, + 187 + ], + "score": 0.88, + "content": "\\triangle ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 174, + 233, + 190 + ], + "score": 1.0, + "content": ". More formally, let", + "type": "text" + }, + { + "bbox": [ + 233, + 176, + 288, + 187 + ], + "score": 0.93, + "content": "X _ { \\mathsf { t r } } \\in \\mathbb { R } ^ { m \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 174, + 422, + 190 + ], + "score": 1.0, + "content": "be the training feature matrix and", + "type": "text" + }, + { + "bbox": [ + 423, + 176, + 492, + 188 + ], + "score": 0.91, + "content": "Y _ { \\mathrm { t r } } \\in \\{ 0 , 1 \\} ^ { m \\times k }", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 174, + 506, + 190 + ], + "score": 1.0, + "content": "be", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 86, + 186, + 506, + 202 + ], + "spans": [ + { + "bbox": [ + 86, + 190, + 100, + 200 + ], + "score": 1.0, + "content": "245", + "type": "text" + }, + { + "bbox": [ + 104, + 186, + 327, + 202 + ], + "score": 1.0, + "content": "the training labels (in row-wise one-hot encoding). Let", + "type": "text" + }, + { + "bbox": [ + 327, + 187, + 477, + 200 + ], + "score": 0.91, + "content": "W ( x , \\theta ) : = X _ { \\mathrm { t r } } ^ { \\top } ( Y _ { \\mathrm { t r } } - x ) / \\theta \\in \\bar { \\mathbb { R } } ^ { p \\times k }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 186, + 506, + 202 + ], + "score": 1.0, + "content": "be the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 86, + 199, + 449, + 213 + ], + "spans": [ + { + "bbox": [ + 86, + 202, + 100, + 211 + ], + "score": 1.0, + "content": "246", + "type": "text" + }, + { + "bbox": [ + 104, + 199, + 449, + 213 + ], + "score": 1.0, + "content": "dual-primal mapping. Then, we consider the following bi-level optimization problem", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 216, + 503, + 243 + ], + "lines": [ + { + "bbox": [ + 111, + 216, + 503, + 243 + ], + "spans": [ + { + "bbox": [ + 111, + 216, + 503, + 243 + ], + "score": 0.75, + "content": "\\operatorname * { a r g m i n } _ { \\boldsymbol { x } = \\mathrm { e x p } ( \\boldsymbol { x } ) } \\frac { 1 } { 2 } \\| X _ { \\mathrm { v a l } } W ( \\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) , \\boldsymbol { \\theta } ) - Y _ { \\mathrm { v a l } } \\| _ { F } ^ { 2 } \\quad \\mathrm { s u b j e c t ~ t o } \\quad \\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) = \\operatorname * { a r g m i n } _ { \\boldsymbol { x } \\in \\mathcal { C } } f ( \\boldsymbol { x } , \\boldsymbol { \\theta } ) : = \\frac { \\theta } { 2 } \\| W ( \\boldsymbol { x } , \\boldsymbol { \\theta } ) \\| _ { F } ^ { 2 } ,", + "type": "interline_equation", + "image_path": "ce090f883f9650a3f013faea4e29010ebe45ac30fd006c4ccf3142b442503f4e.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 111, + 216, + 503, + 243 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 85, + 267, + 505, + 314 + ], + "lines": [ + { + "bbox": [ + 86, + 266, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 86, + 270, + 100, + 280 + ], + "score": 1.0, + "content": "247", + "type": "text" + }, + { + "bbox": [ + 105, + 266, + 132, + 282 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 268, + 215, + 279 + ], + "score": 0.92, + "content": "\\mathcal { C } = \\triangle ^ { k } \\times \\cdot \\cdot \\cdot \\times \\triangle ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 266, + 322, + 282 + ], + "score": 1.0, + "content": "is the Cartesian product of", + "type": "text" + }, + { + "bbox": [ + 322, + 271, + 332, + 279 + ], + "score": 0.73, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 266, + 505, + 282 + ], + "score": 1.0, + "content": "probability simplices. We apply the change", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 86, + 278, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 86, + 281, + 100, + 291 + ], + "score": 1.0, + "content": "248", + "type": "text" + }, + { + "bbox": [ + 105, + 278, + 153, + 293 + ], + "score": 1.0, + "content": "of variable", + "type": "text" + }, + { + "bbox": [ + 154, + 280, + 204, + 291 + ], + "score": 0.9, + "content": "\\theta = \\exp ( \\lambda )", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 278, + 399, + 293 + ], + "score": 1.0, + "content": "in order to guarantee that the hyper-parameter", + "type": "text" + }, + { + "bbox": [ + 400, + 280, + 406, + 289 + ], + "score": 0.79, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 278, + 505, + 293 + ], + "score": 1.0, + "content": "is positive. The matrix", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 86, + 288, + 506, + 305 + ], + "spans": [ + { + "bbox": [ + 86, + 293, + 100, + 303 + ], + "score": 1.0, + "content": "249", + "type": "text" + }, + { + "bbox": [ + 107, + 291, + 193, + 303 + ], + "score": 0.92, + "content": "W ( x ^ { \\star } ( \\theta ) , \\theta ) \\in \\mathbb { R } ^ { p \\times k }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 288, + 506, + 305 + ], + "score": 1.0, + "content": "contains the optimal primal solution, the feature weights for each class. The", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 86, + 300, + 352, + 317 + ], + "spans": [ + { + "bbox": [ + 86, + 304, + 100, + 314 + ], + "score": 1.0, + "content": "250", + "type": "text" + }, + { + "bbox": [ + 104, + 300, + 290, + 317 + ], + "score": 1.0, + "content": "outer loss is computed against validation data", + "type": "text" + }, + { + "bbox": [ + 290, + 303, + 311, + 314 + ], + "score": 0.92, + "content": "X _ { \\mathtt { v a l } }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 300, + 329, + 317 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 330, + 303, + 348, + 314 + ], + "score": 0.91, + "content": "Y _ { \\tt v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 300, + 352, + 317 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 87, + 318, + 505, + 418 + ], + "lines": [ + { + "bbox": [ + 86, + 318, + 506, + 331 + ], + "spans": [ + { + "bbox": [ + 86, + 320, + 99, + 330 + ], + "score": 1.0, + "content": "251", + "type": "text" + }, + { + "bbox": [ + 105, + 318, + 200, + 331 + ], + "score": 1.0, + "content": "In order to differentiate", + "type": "text" + }, + { + "bbox": [ + 200, + 318, + 223, + 331 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 318, + 506, + 331 + ], + "score": 1.0, + "content": ", several ways are possible using our framework. The first one would be", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 85, + 329, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 85, + 331, + 99, + 342 + ], + "score": 1.0, + "content": "252", + "type": "text" + }, + { + "bbox": [ + 105, + 329, + 471, + 343 + ], + "score": 1.0, + "content": "to map (12) to a quadratic program form (18) and use the KKT conditions to form a mapping", + "type": "text" + }, + { + "bbox": [ + 471, + 330, + 503, + 342 + ], + "score": 0.93, + "content": "F ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 329, + 506, + 343 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 85, + 340, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 85, + 342, + 99, + 353 + ], + "score": 1.0, + "content": "253", + "type": "text" + }, + { + "bbox": [ + 105, + 340, + 387, + 353 + ], + "score": 1.0, + "content": "A more direct way is to use proximal gradient fixed point (9). Since", + "type": "text" + }, + { + "bbox": [ + 387, + 341, + 394, + 351 + ], + "score": 0.68, + "content": "\\mathcal { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 340, + 506, + 353 + ], + "score": 1.0, + "content": "is a Cartesian product, the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 85, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 85, + 353, + 100, + 363 + ], + "score": 1.0, + "content": "254", + "type": "text" + }, + { + "bbox": [ + 104, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "projection can be easily computed by row-wise projections on the simplex, which we map over rows", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 85, + 362, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 85, + 364, + 100, + 374 + ], + "score": 1.0, + "content": "255", + "type": "text" + }, + { + "bbox": [ + 105, + 362, + 243, + 375 + ], + "score": 1.0, + "content": "(using vectorized operations) via", + "type": "text" + }, + { + "bbox": [ + 244, + 363, + 286, + 374 + ], + "score": 0.73, + "content": "{ \\mathrm { j a x . v m a p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 362, + 373, + 375 + ], + "score": 1.0, + "content": ". As we explained in", + "type": "text" + }, + { + "bbox": [ + 374, + 362, + 394, + 373 + ], + "score": 0.87, + "content": "\\ S \\mathbf { B } . 1", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 362, + 506, + 375 + ], + "score": 1.0, + "content": ", this projection’s Jacobian", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 85, + 372, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 85, + 375, + 100, + 386 + ], + "score": 1.0, + "content": "256", + "type": "text" + }, + { + "bbox": [ + 105, + 372, + 318, + 386 + ], + "score": 1.0, + "content": "enjoys a closed form. A third way to differentiate", + "type": "text" + }, + { + "bbox": [ + 318, + 374, + 342, + 385 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 372, + 505, + 386 + ], + "score": 1.0, + "content": "is using the mirror descent fixed point", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 85, + 383, + 506, + 398 + ], + "spans": [ + { + "bbox": [ + 85, + 386, + 100, + 397 + ], + "score": 1.0, + "content": "257", + "type": "text" + }, + { + "bbox": [ + 104, + 383, + 244, + 398 + ], + "score": 1.0, + "content": "(11). Under the KL geometry, proj", + "type": "text" + }, + { + "bbox": [ + 244, + 384, + 273, + 396 + ], + "score": 0.88, + "content": "\\overset { \\varphi } { c } ( y , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 383, + 506, + 398 + ], + "score": 1.0, + "content": "corresponds to a row-wise softmax. It is therefore easy to", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 86, + 395, + 507, + 407 + ], + "spans": [ + { + "bbox": [ + 86, + 397, + 99, + 406 + ], + "score": 1.0, + "content": "258", + "type": "text" + }, + { + "bbox": [ + 105, + 395, + 507, + 407 + ], + "score": 1.0, + "content": "compute and differentiate. Figure 2 compares the runtime performance of implicit differentiation vs.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 86, + 406, + 495, + 419 + ], + "spans": [ + { + "bbox": [ + 86, + 409, + 99, + 418 + ], + "score": 1.0, + "content": "259", + "type": "text" + }, + { + "bbox": [ + 105, + 406, + 495, + 419 + ], + "score": 1.0, + "content": "unrolling for the latter two fixed points. A code example is included in Figure 8 in the Appendix.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 18 + }, + { + "type": "title", + "bbox": [ + 100, + 430, + 265, + 442 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 267, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 267, + 444 + ], + "score": 1.0, + "content": "3.2 Task-driven dictionary learning", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 90, + 450, + 504, + 528 + ], + "lines": [ + { + "bbox": [ + 89, + 450, + 506, + 463 + ], + "spans": [ + { + "bbox": [ + 89, + 452, + 100, + 461 + ], + "score": 1.0, + "content": "261", + "type": "text" + }, + { + "bbox": [ + 104, + 450, + 506, + 463 + ], + "score": 1.0, + "content": "Task-driven dictionary learning was proposed to learn sparse codes for input data in such a way that", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 88, + 460, + 503, + 474 + ], + "spans": [ + { + "bbox": [ + 88, + 462, + 100, + 473 + ], + "score": 1.0, + "content": "262", + "type": "text" + }, + { + "bbox": [ + 104, + 460, + 449, + 474 + ], + "score": 1.0, + "content": "the codes solve an outer learning problem [47, 64, 70]. Formally, given a data matrix", + "type": "text" + }, + { + "bbox": [ + 449, + 461, + 503, + 472 + ], + "score": 0.91, + "content": "X _ { \\mathsf { t r } } \\in \\dot { \\mathbb { R } } ^ { m \\times p }", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 88, + 470, + 506, + 486 + ], + "spans": [ + { + "bbox": [ + 88, + 475, + 100, + 484 + ], + "score": 1.0, + "content": "263", + "type": "text" + }, + { + "bbox": [ + 104, + 470, + 187, + 486 + ], + "score": 1.0, + "content": "and a dictionary of", + "type": "text" + }, + { + "bbox": [ + 188, + 473, + 195, + 482 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 470, + 223, + 486 + ], + "score": 1.0, + "content": "atoms", + "type": "text" + }, + { + "bbox": [ + 224, + 472, + 266, + 483 + ], + "score": 0.92, + "content": "\\theta \\in \\mathbb { R } ^ { k \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 470, + 421, + 486 + ], + "score": 1.0, + "content": ", a sparse code is defined as a matrix", + "type": "text" + }, + { + "bbox": [ + 422, + 472, + 485, + 484 + ], + "score": 0.92, + "content": "\\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) \\in \\mathbb { R } ^ { m \\times k }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 470, + 506, + 486 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 88, + 482, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 88, + 486, + 100, + 494 + ], + "score": 1.0, + "content": "264", + "type": "text" + }, + { + "bbox": [ + 104, + 482, + 159, + 496 + ], + "score": 1.0, + "content": "minimizes in", + "type": "text" + }, + { + "bbox": [ + 159, + 485, + 167, + 493 + ], + "score": 0.73, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 482, + 250, + 496 + ], + "score": 1.0, + "content": "a reconstruction loss", + "type": "text" + }, + { + "bbox": [ + 250, + 483, + 338, + 495 + ], + "score": 0.92, + "content": "f ( x , \\theta ) \\mathrel { \\mathop : } = \\ell ( X _ { \\mathrm { t r } } , x \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 482, + 505, + 496 + ], + "score": 1.0, + "content": "regularized by a sparsity-inducing penalty", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 88, + 493, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 88, + 496, + 100, + 506 + ], + "score": 1.0, + "content": "265", + "type": "text" + }, + { + "bbox": [ + 106, + 494, + 126, + 506 + ], + "score": 0.9, + "content": "g ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 493, + 279, + 507 + ], + "score": 1.0, + "content": ". Instead of optimizing the dictionary", + "type": "text" + }, + { + "bbox": [ + 280, + 495, + 286, + 504 + ], + "score": 0.77, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 493, + 506, + 507 + ], + "score": 1.0, + "content": "to minimize the reconstruction loss, [47] proposed to", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 89, + 502, + 502, + 520 + ], + "spans": [ + { + "bbox": [ + 89, + 507, + 100, + 516 + ], + "score": 1.0, + "content": "266", + "type": "text" + }, + { + "bbox": [ + 104, + 502, + 443, + 520 + ], + "score": 1.0, + "content": "optimize an outer problem that depends on the code. For example, given a set of labels", + "type": "text" + }, + { + "bbox": [ + 444, + 505, + 502, + 517 + ], + "score": 0.93, + "content": "Y _ { \\mathbf { t r } } \\in \\{ 0 , 1 \\} ^ { m }", + "type": "inline_equation" + } + ], + "index": 29 + }, + { + "bbox": [ + 89, + 516, + 475, + 528 + ], + "spans": [ + { + "bbox": [ + 89, + 519, + 100, + 528 + ], + "score": 1.0, + "content": "267", + "type": "text" + }, + { + "bbox": [ + 105, + 516, + 475, + 528 + ], + "score": 1.0, + "content": "we consider a logistic regression problem which results in the bilevel optimization problem:", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 27 + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 531, + 464, + 570 + ], + "lines": [ + { + "bbox": [ + 130, + 531, + 464, + 570 + ], + "spans": [ + { + "bbox": [ + 130, + 531, + 464, + 570 + ], + "score": 0.58, + "content": "\\underbrace { \\operatorname* { m i n } _ { \\theta \\in \\mathbb { R } ^ { k \\times p } , w \\in \\mathbb { R } ^ { k } , b \\in \\mathbb { R } } \\sigma ( x ^ { \\star } ( \\theta ) w + b ; y _ { \\mathrm { t r } } ) } _ { \\mathrm { o u t e r ~ p r o b l e m } } \\mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \\star } ( \\theta ) \\in \\underbrace { \\mathrm { a r g m i n ~ } f ( x , \\theta ) + g ( x ) } _ { \\mathrm { i n n e r ~ p r o b l e m } } .", + "type": "interline_equation", + "image_path": "7241d3046f97175d5f6f55df5911c2960fba9d333333fa547f087a16e16b970d.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 130, + 531, + 464, + 544.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 130, + 544.0, + 464, + 557.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 130, + 557.0, + 464, + 570.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 85, + 574, + 506, + 652 + ], + "lines": [ + { + "bbox": [ + 86, + 572, + 507, + 589 + ], + "spans": [ + { + "bbox": [ + 86, + 576, + 99, + 586 + ], + "score": 1.0, + "content": "268", + "type": "text" + }, + { + "bbox": [ + 104, + 572, + 133, + 589 + ], + "score": 1.0, + "content": "When", + "type": "text" + }, + { + "bbox": [ + 133, + 575, + 139, + 584 + ], + "score": 0.69, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 572, + 370, + 589 + ], + "score": 1.0, + "content": "is the squared Frobenius distance between matrices, and", + "type": "text" + }, + { + "bbox": [ + 371, + 576, + 378, + 586 + ], + "score": 0.81, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 572, + 507, + 589 + ], + "score": 1.0, + "content": "the elastic net penalty, [47, Eq.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 86, + 585, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 86, + 587, + 99, + 596 + ], + "score": 1.0, + "content": "269", + "type": "text" + }, + { + "bbox": [ + 105, + 585, + 506, + 597 + ], + "score": 1.0, + "content": "21] derive manually, using optimality conditions (notably the support of the codes selected at the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 86, + 596, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 86, + 598, + 99, + 608 + ], + "score": 1.0, + "content": "270", + "type": "text" + }, + { + "bbox": [ + 106, + 596, + 294, + 609 + ], + "score": 1.0, + "content": "optimum), an explicit re-parameterization of", + "type": "text" + }, + { + "bbox": [ + 294, + 596, + 318, + 608 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 596, + 440, + 609 + ], + "score": 1.0, + "content": "as a linear system involving", + "type": "text" + }, + { + "bbox": [ + 440, + 596, + 447, + 606 + ], + "score": 0.69, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 596, + 506, + 609 + ], + "score": 1.0, + "content": ". This closed-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 86, + 607, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 86, + 609, + 99, + 618 + ], + "score": 1.0, + "content": "271", + "type": "text" + }, + { + "bbox": [ + 106, + 607, + 342, + 619 + ], + "score": 1.0, + "content": "form allows for a direct computation of the Jacobian of", + "type": "text" + }, + { + "bbox": [ + 342, + 608, + 354, + 617 + ], + "score": 0.86, + "content": "x ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 607, + 381, + 619 + ], + "score": 1.0, + "content": "w.r.t.", + "type": "text" + }, + { + "bbox": [ + 381, + 607, + 388, + 617 + ], + "score": 0.66, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 607, + 506, + 619 + ], + "score": 1.0, + "content": ". Similarly, [64] derive first", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 86, + 617, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 86, + 620, + 99, + 630 + ], + "score": 1.0, + "content": "272", + "type": "text" + }, + { + "bbox": [ + 104, + 617, + 246, + 631 + ], + "score": 1.0, + "content": "order conditions in the case where", + "type": "text" + }, + { + "bbox": [ + 246, + 618, + 252, + 628 + ], + "score": 0.73, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 617, + 269, + 631 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 269, + 618, + 276, + 629 + ], + "score": 0.85, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 617, + 506, + 631 + ], + "score": 1.0, + "content": "-divergence, while [70] propose to use unrolling of ISTA", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 86, + 628, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 86, + 631, + 99, + 641 + ], + "score": 1.0, + "content": "273", + "type": "text" + }, + { + "bbox": [ + 106, + 628, + 506, + 641 + ], + "score": 1.0, + "content": "iterations. Our approach bypasses all of these computations, giving the user more leisure to focus", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 86, + 638, + 471, + 653 + ], + "spans": [ + { + "bbox": [ + 86, + 642, + 99, + 651 + ], + "score": 1.0, + "content": "274", + "type": "text" + }, + { + "bbox": [ + 105, + 638, + 471, + 653 + ], + "score": 1.0, + "content": "directly on modeling (loss, regularizer) aspects (see code snippet in Figure 9 in Appendix).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 86, + 655, + 505, + 722 + ], + "lines": [ + { + "bbox": [ + 86, + 655, + 507, + 669 + ], + "spans": [ + { + "bbox": [ + 86, + 658, + 99, + 667 + ], + "score": 1.0, + "content": "275", + "type": "text" + }, + { + "bbox": [ + 105, + 655, + 507, + 669 + ], + "score": 1.0, + "content": "We illustrate this on a problem of breast cancer survival prediction from gene expression data,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 85, + 667, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 85, + 669, + 100, + 679 + ], + "score": 1.0, + "content": "276", + "type": "text" + }, + { + "bbox": [ + 105, + 667, + 505, + 679 + ], + "score": 1.0, + "content": "framed as a binary classification problem to discriminate patients who survive longer than 5 years", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 85, + 677, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 85, + 679, + 100, + 689 + ], + "score": 1.0, + "content": "277", + "type": "text" + }, + { + "bbox": [ + 109, + 678, + 157, + 689 + ], + "score": 0.88, + "content": "( m _ { 1 } = 2 0 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 677, + 362, + 691 + ], + "score": 1.0, + "content": "vs patients who die within 5 years of diagnosis", + "type": "text" + }, + { + "bbox": [ + 363, + 678, + 405, + 689 + ], + "score": 0.87, + "content": "m _ { 0 } = 9 9 ,", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 677, + 434, + 691 + ], + "score": 1.0, + "content": "), from", + "type": "text" + }, + { + "bbox": [ + 434, + 678, + 482, + 690 + ], + "score": 0.91, + "content": "p = 1 , 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 677, + 505, + 691 + ], + "score": 1.0, + "content": "gene", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 85, + 689, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 85, + 690, + 100, + 700 + ], + "score": 1.0, + "content": "278", + "type": "text" + }, + { + "bbox": [ + 105, + 689, + 505, + 701 + ], + "score": 1.0, + "content": "expression values. As shown in Table 2, solving (13) (Task-driven DictL) reaches a classification", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 86, + 700, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 86, + 702, + 99, + 711 + ], + "score": 1.0, + "content": "279", + "type": "text" + }, + { + "bbox": [ + 105, + 700, + 286, + 712 + ], + "score": 1.0, + "content": "performance competitive with state-of-the-art", + "type": "text" + }, + { + "bbox": [ + 287, + 700, + 299, + 711 + ], + "score": 0.88, + "content": "L _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 700, + 311, + 712 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 311, + 700, + 323, + 711 + ], + "score": 0.88, + "content": "L _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 700, + 506, + 712 + ], + "score": 1.0, + "content": "regularized logistic regression with 100 times", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 85, + 711, + 316, + 723 + ], + "spans": [ + { + "bbox": [ + 85, + 712, + 100, + 722 + ], + "score": 1.0, + "content": "280", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 316, + 723 + ], + "score": 1.0, + "content": "fewer variables. See Appendix E.2 for more details.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43.5 + } + ], + "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": "table", + "bbox": [ + 139, + 93, + 471, + 128 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 111, + 77, + 493, + 89 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 115, + 75, + 494, + 91 + ], + "spans": [ + { + "bbox": [ + 115, + 75, + 219, + 91 + ], + "score": 1.0, + "content": "Table 2: Mean AUC (and", + "type": "text" + }, + { + "bbox": [ + 220, + 78, + 240, + 88 + ], + "score": 0.86, + "content": "9 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 75, + 494, + 91 + ], + "score": 1.0, + "content": "confidence interval) for the cancer survival prediction problem.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 139, + 93, + 471, + 128 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 139, + 93, + 471, + 128 + ], + "spans": [ + { + "bbox": [ + 139, + 93, + 471, + 128 + ], + "score": 0.966, + "html": "
MethodL1 logregL2 logregDictL + L2 logregTask-driven DictL
AUC (%)71.6 ± 2.072.4± 2.868.3 ± 2.373.2 ± 2.1
", + "type": "table", + "image_path": "b4da6ef103b91449058c5866c3a3686ffb12de8e8375b30e6411a8f9996f2d45.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 139, + 93, + 471, + 104.66666666666667 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 139, + 104.66666666666667, + 471, + 116.33333333333334 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 139, + 116.33333333333334, + 471, + 128.0 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "index", + "bbox": [ + 86, + 153, + 505, + 211 + ], + "lines": [ + { + "bbox": [ + 85, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 85, + 155, + 100, + 165 + ], + "score": 1.0, + "content": "242", + "type": "text" + }, + { + "bbox": [ + 105, + 154, + 198, + 166 + ], + "score": 1.0, + "content": "training examples and", + "type": "text" + }, + { + "bbox": [ + 198, + 154, + 205, + 164 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 154, + 325, + 166 + ], + "score": 1.0, + "content": "is the number of classes, and", + "type": "text" + }, + { + "bbox": [ + 325, + 154, + 357, + 165 + ], + "score": 0.91, + "content": "\\theta \\in \\mathbb { R } _ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "is the regularization parameter. The", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 163, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 85, + 166, + 100, + 176 + ], + "score": 1.0, + "content": "243", + "type": "text" + }, + { + "bbox": [ + 105, + 163, + 214, + 178 + ], + "score": 1.0, + "content": "challenge in differentiating", + "type": "text" + }, + { + "bbox": [ + 214, + 164, + 239, + 177 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 163, + 315, + 178 + ], + "score": 1.0, + "content": "is that each row of", + "type": "text" + }, + { + "bbox": [ + 315, + 165, + 339, + 177 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 163, + 505, + 178 + ], + "score": 1.0, + "content": "is constrained to belong to the probability", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 174, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 85, + 178, + 100, + 188 + ], + "score": 1.0, + "content": "244", + "type": "text" + }, + { + "bbox": [ + 104, + 174, + 140, + 190 + ], + "score": 1.0, + "content": "simplex", + "type": "text" + }, + { + "bbox": [ + 140, + 176, + 155, + 187 + ], + "score": 0.88, + "content": "\\triangle ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 174, + 233, + 190 + ], + "score": 1.0, + "content": ". More formally, let", + "type": "text" + }, + { + "bbox": [ + 233, + 176, + 288, + 187 + ], + "score": 0.93, + "content": "X _ { \\mathsf { t r } } \\in \\mathbb { R } ^ { m \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 174, + 422, + 190 + ], + "score": 1.0, + "content": "be the training feature matrix and", + "type": "text" + }, + { + "bbox": [ + 423, + 176, + 492, + 188 + ], + "score": 0.91, + "content": "Y _ { \\mathrm { t r } } \\in \\{ 0 , 1 \\} ^ { m \\times k }", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 174, + 506, + 190 + ], + "score": 1.0, + "content": "be", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 186, + 506, + 202 + ], + "spans": [ + { + "bbox": [ + 86, + 190, + 100, + 200 + ], + "score": 1.0, + "content": "245", + "type": "text" + }, + { + "bbox": [ + 104, + 186, + 327, + 202 + ], + "score": 1.0, + "content": "the training labels (in row-wise one-hot encoding). Let", + "type": "text" + }, + { + "bbox": [ + 327, + 187, + 477, + 200 + ], + "score": 0.91, + "content": "W ( x , \\theta ) : = X _ { \\mathrm { t r } } ^ { \\top } ( Y _ { \\mathrm { t r } } - x ) / \\theta \\in \\bar { \\mathbb { R } } ^ { p \\times k }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 186, + 506, + 202 + ], + "score": 1.0, + "content": "be the", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 199, + 449, + 213 + ], + "spans": [ + { + "bbox": [ + 86, + 202, + 100, + 211 + ], + "score": 1.0, + "content": "246", + "type": "text" + }, + { + "bbox": [ + 104, + 199, + 449, + 213 + ], + "score": 1.0, + "content": "dual-primal mapping. Then, we consider the following bi-level optimization problem", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + } + ], + "index": 6, + "bbox_fs": [ + 85, + 154, + 506, + 213 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 216, + 503, + 243 + ], + "lines": [ + { + "bbox": [ + 111, + 216, + 503, + 243 + ], + "spans": [ + { + "bbox": [ + 111, + 216, + 503, + 243 + ], + "score": 0.75, + "content": "\\operatorname * { a r g m i n } _ { \\boldsymbol { x } = \\mathrm { e x p } ( \\boldsymbol { x } ) } \\frac { 1 } { 2 } \\| X _ { \\mathrm { v a l } } W ( \\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) , \\boldsymbol { \\theta } ) - Y _ { \\mathrm { v a l } } \\| _ { F } ^ { 2 } \\quad \\mathrm { s u b j e c t ~ t o } \\quad \\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) = \\operatorname * { a r g m i n } _ { \\boldsymbol { x } \\in \\mathcal { C } } f ( \\boldsymbol { x } , \\boldsymbol { \\theta } ) : = \\frac { \\theta } { 2 } \\| W ( \\boldsymbol { x } , \\boldsymbol { \\theta } ) \\| _ { F } ^ { 2 } ,", + "type": "interline_equation", + "image_path": "ce090f883f9650a3f013faea4e29010ebe45ac30fd006c4ccf3142b442503f4e.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 111, + 216, + 503, + 243 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "index", + "bbox": [ + 85, + 267, + 505, + 314 + ], + "lines": [ + { + "bbox": [ + 86, + 266, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 86, + 270, + 100, + 280 + ], + "score": 1.0, + "content": "247", + "type": "text" + }, + { + "bbox": [ + 105, + 266, + 132, + 282 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 268, + 215, + 279 + ], + "score": 0.92, + "content": "\\mathcal { C } = \\triangle ^ { k } \\times \\cdot \\cdot \\cdot \\times \\triangle ^ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 266, + 322, + 282 + ], + "score": 1.0, + "content": "is the Cartesian product of", + "type": "text" + }, + { + "bbox": [ + 322, + 271, + 332, + 279 + ], + "score": 0.73, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 266, + 505, + 282 + ], + "score": 1.0, + "content": "probability simplices. We apply the change", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 278, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 86, + 281, + 100, + 291 + ], + "score": 1.0, + "content": "248", + "type": "text" + }, + { + "bbox": [ + 105, + 278, + 153, + 293 + ], + "score": 1.0, + "content": "of variable", + "type": "text" + }, + { + "bbox": [ + 154, + 280, + 204, + 291 + ], + "score": 0.9, + "content": "\\theta = \\exp ( \\lambda )", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 278, + 399, + 293 + ], + "score": 1.0, + "content": "in order to guarantee that the hyper-parameter", + "type": "text" + }, + { + "bbox": [ + 400, + 280, + 406, + 289 + ], + "score": 0.79, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 278, + 505, + 293 + ], + "score": 1.0, + "content": "is positive. The matrix", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 288, + 506, + 305 + ], + "spans": [ + { + "bbox": [ + 86, + 293, + 100, + 303 + ], + "score": 1.0, + "content": "249", + "type": "text" + }, + { + "bbox": [ + 107, + 291, + 193, + 303 + ], + "score": 0.92, + "content": "W ( x ^ { \\star } ( \\theta ) , \\theta ) \\in \\mathbb { R } ^ { p \\times k }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 288, + 506, + 305 + ], + "score": 1.0, + "content": "contains the optimal primal solution, the feature weights for each class. The", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 300, + 352, + 317 + ], + "spans": [ + { + "bbox": [ + 86, + 304, + 100, + 314 + ], + "score": 1.0, + "content": "250", + "type": "text" + }, + { + "bbox": [ + 104, + 300, + 290, + 317 + ], + "score": 1.0, + "content": "outer loss is computed against validation data", + "type": "text" + }, + { + "bbox": [ + 290, + 303, + 311, + 314 + ], + "score": 0.92, + "content": "X _ { \\mathtt { v a l } }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 300, + 329, + 317 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 330, + 303, + 348, + 314 + ], + "score": 0.91, + "content": "Y _ { \\tt v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 300, + 352, + 317 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 318, + 506, + 331 + ], + "spans": [ + { + "bbox": [ + 86, + 320, + 99, + 330 + ], + "score": 1.0, + "content": "251", + "type": "text" + }, + { + "bbox": [ + 105, + 318, + 200, + 331 + ], + "score": 1.0, + "content": "In order to differentiate", + "type": "text" + }, + { + "bbox": [ + 200, + 318, + 223, + 331 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 318, + 506, + 331 + ], + "score": 1.0, + "content": ", several ways are possible using our framework. The first one would be", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 329, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 85, + 331, + 99, + 342 + ], + "score": 1.0, + "content": "252", + "type": "text" + }, + { + "bbox": [ + 105, + 329, + 471, + 343 + ], + "score": 1.0, + "content": "to map (12) to a quadratic program form (18) and use the KKT conditions to form a mapping", + "type": "text" + }, + { + "bbox": [ + 471, + 330, + 503, + 342 + ], + "score": 0.93, + "content": "F ( x , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 329, + 506, + 343 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 340, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 85, + 342, + 99, + 353 + ], + "score": 1.0, + "content": "253", + "type": "text" + }, + { + "bbox": [ + 105, + 340, + 387, + 353 + ], + "score": 1.0, + "content": "A more direct way is to use proximal gradient fixed point (9). Since", + "type": "text" + }, + { + "bbox": [ + 387, + 341, + 394, + 351 + ], + "score": 0.68, + "content": "\\mathcal { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 340, + 506, + 353 + ], + "score": 1.0, + "content": "is a Cartesian product, the", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 351, + 506, + 365 + ], + "spans": [ + { + "bbox": [ + 85, + 353, + 100, + 363 + ], + "score": 1.0, + "content": "254", + "type": "text" + }, + { + "bbox": [ + 104, + 351, + 506, + 365 + ], + "score": 1.0, + "content": "projection can be easily computed by row-wise projections on the simplex, which we map over rows", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 362, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 85, + 364, + 100, + 374 + ], + "score": 1.0, + "content": "255", + "type": "text" + }, + { + "bbox": [ + 105, + 362, + 243, + 375 + ], + "score": 1.0, + "content": "(using vectorized operations) via", + "type": "text" + }, + { + "bbox": [ + 244, + 363, + 286, + 374 + ], + "score": 0.73, + "content": "{ \\mathrm { j a x . v m a p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 362, + 373, + 375 + ], + "score": 1.0, + "content": ". As we explained in", + "type": "text" + }, + { + "bbox": [ + 374, + 362, + 394, + 373 + ], + "score": 0.87, + "content": "\\ S \\mathbf { B } . 1", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 362, + 506, + 375 + ], + "score": 1.0, + "content": ", this projection’s Jacobian", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 372, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 85, + 375, + 100, + 386 + ], + "score": 1.0, + "content": "256", + "type": "text" + }, + { + "bbox": [ + 105, + 372, + 318, + 386 + ], + "score": 1.0, + "content": "enjoys a closed form. A third way to differentiate", + "type": "text" + }, + { + "bbox": [ + 318, + 374, + 342, + 385 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 372, + 505, + 386 + ], + "score": 1.0, + "content": "is using the mirror descent fixed point", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 383, + 506, + 398 + ], + "spans": [ + { + "bbox": [ + 85, + 386, + 100, + 397 + ], + "score": 1.0, + "content": "257", + "type": "text" + }, + { + "bbox": [ + 104, + 383, + 244, + 398 + ], + "score": 1.0, + "content": "(11). Under the KL geometry, proj", + "type": "text" + }, + { + "bbox": [ + 244, + 384, + 273, + 396 + ], + "score": 0.88, + "content": "\\overset { \\varphi } { c } ( y , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 383, + 506, + 398 + ], + "score": 1.0, + "content": "corresponds to a row-wise softmax. It is therefore easy to", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 395, + 507, + 407 + ], + "spans": [ + { + "bbox": [ + 86, + 397, + 99, + 406 + ], + "score": 1.0, + "content": "258", + "type": "text" + }, + { + "bbox": [ + 105, + 395, + 507, + 407 + ], + "score": 1.0, + "content": "compute and differentiate. Figure 2 compares the runtime performance of implicit differentiation vs.", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 406, + 495, + 419 + ], + "spans": [ + { + "bbox": [ + 86, + 409, + 99, + 418 + ], + "score": 1.0, + "content": "259", + "type": "text" + }, + { + "bbox": [ + 105, + 406, + 495, + 419 + ], + "score": 1.0, + "content": "unrolling for the latter two fixed points. A code example is included in Figure 8 in the Appendix.", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + } + ], + "index": 11.5, + "bbox_fs": [ + 86, + 266, + 506, + 317 + ] + }, + { + "type": "index", + "bbox": [ + 87, + 318, + 505, + 418 + ], + "lines": [], + "index": 18, + "bbox_fs": [ + 85, + 318, + 507, + 419 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 100, + 430, + 265, + 442 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 267, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 267, + 444 + ], + "score": 1.0, + "content": "3.2 Task-driven dictionary learning", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "index", + "bbox": [ + 90, + 450, + 504, + 528 + ], + "lines": [ + { + "bbox": [ + 89, + 450, + 506, + 463 + ], + "spans": [ + { + "bbox": [ + 89, + 452, + 100, + 461 + ], + "score": 1.0, + "content": "261", + "type": "text" + }, + { + "bbox": [ + 104, + 450, + 506, + 463 + ], + "score": 1.0, + "content": "Task-driven dictionary learning was proposed to learn sparse codes for input data in such a way that", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 460, + 503, + 474 + ], + "spans": [ + { + "bbox": [ + 88, + 462, + 100, + 473 + ], + "score": 1.0, + "content": "262", + "type": "text" + }, + { + "bbox": [ + 104, + 460, + 449, + 474 + ], + "score": 1.0, + "content": "the codes solve an outer learning problem [47, 64, 70]. Formally, given a data matrix", + "type": "text" + }, + { + "bbox": [ + 449, + 461, + 503, + 472 + ], + "score": 0.91, + "content": "X _ { \\mathsf { t r } } \\in \\dot { \\mathbb { R } } ^ { m \\times p }", + "type": "inline_equation" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 470, + 506, + 486 + ], + "spans": [ + { + "bbox": [ + 88, + 475, + 100, + 484 + ], + "score": 1.0, + "content": "263", + "type": "text" + }, + { + "bbox": [ + 104, + 470, + 187, + 486 + ], + "score": 1.0, + "content": "and a dictionary of", + "type": "text" + }, + { + "bbox": [ + 188, + 473, + 195, + 482 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 470, + 223, + 486 + ], + "score": 1.0, + "content": "atoms", + "type": "text" + }, + { + "bbox": [ + 224, + 472, + 266, + 483 + ], + "score": 0.92, + "content": "\\theta \\in \\mathbb { R } ^ { k \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 470, + 421, + 486 + ], + "score": 1.0, + "content": ", a sparse code is defined as a matrix", + "type": "text" + }, + { + "bbox": [ + 422, + 472, + 485, + 484 + ], + "score": 0.92, + "content": "\\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) \\in \\mathbb { R } ^ { m \\times k }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 470, + 506, + 486 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 482, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 88, + 486, + 100, + 494 + ], + "score": 1.0, + "content": "264", + "type": "text" + }, + { + "bbox": [ + 104, + 482, + 159, + 496 + ], + "score": 1.0, + "content": "minimizes in", + "type": "text" + }, + { + "bbox": [ + 159, + 485, + 167, + 493 + ], + "score": 0.73, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 482, + 250, + 496 + ], + "score": 1.0, + "content": "a reconstruction loss", + "type": "text" + }, + { + "bbox": [ + 250, + 483, + 338, + 495 + ], + "score": 0.92, + "content": "f ( x , \\theta ) \\mathrel { \\mathop : } = \\ell ( X _ { \\mathrm { t r } } , x \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 482, + 505, + 496 + ], + "score": 1.0, + "content": "regularized by a sparsity-inducing penalty", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 493, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 88, + 496, + 100, + 506 + ], + "score": 1.0, + "content": "265", + "type": "text" + }, + { + "bbox": [ + 106, + 494, + 126, + 506 + ], + "score": 0.9, + "content": "g ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 493, + 279, + 507 + ], + "score": 1.0, + "content": ". Instead of optimizing the dictionary", + "type": "text" + }, + { + "bbox": [ + 280, + 495, + 286, + 504 + ], + "score": 0.77, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 493, + 506, + 507 + ], + "score": 1.0, + "content": "to minimize the reconstruction loss, [47] proposed to", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 502, + 502, + 520 + ], + "spans": [ + { + "bbox": [ + 89, + 507, + 100, + 516 + ], + "score": 1.0, + "content": "266", + "type": "text" + }, + { + "bbox": [ + 104, + 502, + 443, + 520 + ], + "score": 1.0, + "content": "optimize an outer problem that depends on the code. For example, given a set of labels", + "type": "text" + }, + { + "bbox": [ + 444, + 505, + 502, + 517 + ], + "score": 0.93, + "content": "Y _ { \\mathbf { t r } } \\in \\{ 0 , 1 \\} ^ { m }", + "type": "inline_equation" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 89, + 516, + 475, + 528 + ], + "spans": [ + { + "bbox": [ + 89, + 519, + 100, + 528 + ], + "score": 1.0, + "content": "267", + "type": "text" + }, + { + "bbox": [ + 105, + 516, + 475, + 528 + ], + "score": 1.0, + "content": "we consider a logistic regression problem which results in the bilevel optimization problem:", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + } + ], + "index": 27, + "bbox_fs": [ + 88, + 450, + 506, + 528 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 531, + 464, + 570 + ], + "lines": [ + { + "bbox": [ + 130, + 531, + 464, + 570 + ], + "spans": [ + { + "bbox": [ + 130, + 531, + 464, + 570 + ], + "score": 0.58, + "content": "\\underbrace { \\operatorname* { m i n } _ { \\theta \\in \\mathbb { R } ^ { k \\times p } , w \\in \\mathbb { R } ^ { k } , b \\in \\mathbb { R } } \\sigma ( x ^ { \\star } ( \\theta ) w + b ; y _ { \\mathrm { t r } } ) } _ { \\mathrm { o u t e r ~ p r o b l e m } } \\mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \\star } ( \\theta ) \\in \\underbrace { \\mathrm { a r g m i n ~ } f ( x , \\theta ) + g ( x ) } _ { \\mathrm { i n n e r ~ p r o b l e m } } .", + "type": "interline_equation", + "image_path": "7241d3046f97175d5f6f55df5911c2960fba9d333333fa547f087a16e16b970d.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 130, + 531, + 464, + 544.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 130, + 544.0, + 464, + 557.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 130, + 557.0, + 464, + 570.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "index", + "bbox": [ + 85, + 574, + 506, + 652 + ], + "lines": [ + { + "bbox": [ + 86, + 572, + 507, + 589 + ], + "spans": [ + { + "bbox": [ + 86, + 576, + 99, + 586 + ], + "score": 1.0, + "content": "268", + "type": "text" + }, + { + "bbox": [ + 104, + 572, + 133, + 589 + ], + "score": 1.0, + "content": "When", + "type": "text" + }, + { + "bbox": [ + 133, + 575, + 139, + 584 + ], + "score": 0.69, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 572, + 370, + 589 + ], + "score": 1.0, + "content": "is the squared Frobenius distance between matrices, and", + "type": "text" + }, + { + "bbox": [ + 371, + 576, + 378, + 586 + ], + "score": 0.81, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 572, + 507, + 589 + ], + "score": 1.0, + "content": "the elastic net penalty, [47, Eq.", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 585, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 86, + 587, + 99, + 596 + ], + "score": 1.0, + "content": "269", + "type": "text" + }, + { + "bbox": [ + 105, + 585, + 506, + 597 + ], + "score": 1.0, + "content": "21] derive manually, using optimality conditions (notably the support of the codes selected at the", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 596, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 86, + 598, + 99, + 608 + ], + "score": 1.0, + "content": "270", + "type": "text" + }, + { + "bbox": [ + 106, + 596, + 294, + 609 + ], + "score": 1.0, + "content": "optimum), an explicit re-parameterization of", + "type": "text" + }, + { + "bbox": [ + 294, + 596, + 318, + 608 + ], + "score": 0.92, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 596, + 440, + 609 + ], + "score": 1.0, + "content": "as a linear system involving", + "type": "text" + }, + { + "bbox": [ + 440, + 596, + 447, + 606 + ], + "score": 0.69, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 596, + 506, + 609 + ], + "score": 1.0, + "content": ". This closed-", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 607, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 86, + 609, + 99, + 618 + ], + "score": 1.0, + "content": "271", + "type": "text" + }, + { + "bbox": [ + 106, + 607, + 342, + 619 + ], + "score": 1.0, + "content": "form allows for a direct computation of the Jacobian of", + "type": "text" + }, + { + "bbox": [ + 342, + 608, + 354, + 617 + ], + "score": 0.86, + "content": "x ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 607, + 381, + 619 + ], + "score": 1.0, + "content": "w.r.t.", + "type": "text" + }, + { + "bbox": [ + 381, + 607, + 388, + 617 + ], + "score": 0.66, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 607, + 506, + 619 + ], + "score": 1.0, + "content": ". Similarly, [64] derive first", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 617, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 86, + 620, + 99, + 630 + ], + "score": 1.0, + "content": "272", + "type": "text" + }, + { + "bbox": [ + 104, + 617, + 246, + 631 + ], + "score": 1.0, + "content": "order conditions in the case where", + "type": "text" + }, + { + "bbox": [ + 246, + 618, + 252, + 628 + ], + "score": 0.73, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 617, + 269, + 631 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 269, + 618, + 276, + 629 + ], + "score": 0.85, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 617, + 506, + 631 + ], + "score": 1.0, + "content": "-divergence, while [70] propose to use unrolling of ISTA", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 628, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 86, + 631, + 99, + 641 + ], + "score": 1.0, + "content": "273", + "type": "text" + }, + { + "bbox": [ + 106, + 628, + 506, + 641 + ], + "score": 1.0, + "content": "iterations. Our approach bypasses all of these computations, giving the user more leisure to focus", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 638, + 471, + 653 + ], + "spans": [ + { + "bbox": [ + 86, + 642, + 99, + 651 + ], + "score": 1.0, + "content": "274", + "type": "text" + }, + { + "bbox": [ + 105, + 638, + 471, + 653 + ], + "score": 1.0, + "content": "directly on modeling (loss, regularizer) aspects (see code snippet in Figure 9 in Appendix).", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 655, + 507, + 669 + ], + "spans": [ + { + "bbox": [ + 86, + 658, + 99, + 667 + ], + "score": 1.0, + "content": "275", + "type": "text" + }, + { + "bbox": [ + 105, + 655, + 507, + 669 + ], + "score": 1.0, + "content": "We illustrate this on a problem of breast cancer survival prediction from gene expression data,", + "type": "text" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 667, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 85, + 669, + 100, + 679 + ], + "score": 1.0, + "content": "276", + "type": "text" + }, + { + "bbox": [ + 105, + 667, + 505, + 679 + ], + "score": 1.0, + "content": "framed as a binary classification problem to discriminate patients who survive longer than 5 years", + "type": "text" + } + ], + "index": 42, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 677, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 85, + 679, + 100, + 689 + ], + "score": 1.0, + "content": "277", + "type": "text" + }, + { + "bbox": [ + 109, + 678, + 157, + 689 + ], + "score": 0.88, + "content": "( m _ { 1 } = 2 0 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 677, + 362, + 691 + ], + "score": 1.0, + "content": "vs patients who die within 5 years of diagnosis", + "type": "text" + }, + { + "bbox": [ + 363, + 678, + 405, + 689 + ], + "score": 0.87, + "content": "m _ { 0 } = 9 9 ,", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 677, + 434, + 691 + ], + "score": 1.0, + "content": "), from", + "type": "text" + }, + { + "bbox": [ + 434, + 678, + 482, + 690 + ], + "score": 0.91, + "content": "p = 1 , 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 677, + 505, + 691 + ], + "score": 1.0, + "content": "gene", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 689, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 85, + 690, + 100, + 700 + ], + "score": 1.0, + "content": "278", + "type": "text" + }, + { + "bbox": [ + 105, + 689, + 505, + 701 + ], + "score": 1.0, + "content": "expression values. As shown in Table 2, solving (13) (Task-driven DictL) reaches a classification", + "type": "text" + } + ], + "index": 44, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 700, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 86, + 702, + 99, + 711 + ], + "score": 1.0, + "content": "279", + "type": "text" + }, + { + "bbox": [ + 105, + 700, + 286, + 712 + ], + "score": 1.0, + "content": "performance competitive with state-of-the-art", + "type": "text" + }, + { + "bbox": [ + 287, + 700, + 299, + 711 + ], + "score": 0.88, + "content": "L _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 700, + 311, + 712 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 311, + 700, + 323, + 711 + ], + "score": 0.88, + "content": "L _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 700, + 506, + 712 + ], + "score": 1.0, + "content": "regularized logistic regression with 100 times", + "type": "text" + } + ], + "index": 45, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 711, + 316, + 723 + ], + "spans": [ + { + "bbox": [ + 85, + 712, + 100, + 722 + ], + "score": 1.0, + "content": "280", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 316, + 723 + ], + "score": 1.0, + "content": "fewer variables. See Appendix E.2 for more details.", + "type": "text" + } + ], + "index": 46, + "is_list_start_line": true + } + ], + "index": 37, + "bbox_fs": [ + 86, + 572, + 507, + 653 + ] + }, + { + "type": "index", + "bbox": [ + 86, + 655, + 505, + 722 + ], + "lines": [], + "index": 43.5, + "bbox_fs": [ + 85, + 655, + 507, + 723 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 106, + 78, + 505, + 114 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 78, + 505, + 114 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 78, + 505, + 114 + ], + "spans": [ + { + "bbox": [ + 106, + 78, + 505, + 114 + ], + "score": 0.946, + "type": "image", + "image_path": "3ee0f32e6f80a02150d66af9cd3d4abfc0547511f8cbe6272c79b60b2929a87c.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 78, + 505, + 90.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 90.0, + 505, + 102.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 102.0, + 505, + 114.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 119, + 505, + 154 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 118, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 244, + 134 + ], + "score": 1.0, + "content": "Figure 3: Distilled MNIST dataset", + "type": "text" + }, + { + "bbox": [ + 244, + 119, + 285, + 131 + ], + "score": 0.93, + "content": "\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 118, + 506, + 134 + ], + "score": 1.0, + "content": "obtained by solving (14). We learn one image per class", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 131, + 505, + 143 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 302, + 143 + ], + "score": 1.0, + "content": "such that a logistic regression model trained on", + "type": "text" + }, + { + "bbox": [ + 302, + 132, + 309, + 141 + ], + "score": 0.75, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 131, + 505, + 143 + ], + "score": 1.0, + "content": "achieves the lowest logistic loss on the MNIST", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 385, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 385, + 155 + ], + "score": 1.0, + "content": "training set. Implicit differentiation was 4 times faster than unrolling.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 88, + 177, + 211, + 189 + ], + "lines": [ + { + "bbox": [ + 85, + 177, + 212, + 190 + ], + "spans": [ + { + "bbox": [ + 85, + 177, + 212, + 190 + ], + "score": 1.0, + "content": "281 3.3 Dataset distillation", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 85, + 198, + 506, + 278 + ], + "lines": [ + { + "bbox": [ + 85, + 199, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 85, + 200, + 100, + 210 + ], + "score": 1.0, + "content": "282", + "type": "text" + }, + { + "bbox": [ + 105, + 199, + 505, + 210 + ], + "score": 1.0, + "content": "Dataset distillation [67, 46] aims to learn a small synthetic training dataset such that a model trained", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 85, + 209, + 506, + 221 + ], + "spans": [ + { + "bbox": [ + 85, + 211, + 100, + 221 + ], + "score": 1.0, + "content": "283", + "type": "text" + }, + { + "bbox": [ + 105, + 209, + 433, + 221 + ], + "score": 1.0, + "content": "on this learned data set achieves small loss on the original training set. Formally, let", + "type": "text" + }, + { + "bbox": [ + 433, + 209, + 487, + 221 + ], + "score": 0.94, + "content": "X _ { \\mathsf { t r } } \\in \\mathbb { R } ^ { m \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 209, + 506, + 221 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 85, + 219, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 85, + 222, + 100, + 232 + ], + "score": 1.0, + "content": "284", + "type": "text" + }, + { + "bbox": [ + 107, + 220, + 151, + 232 + ], + "score": 0.93, + "content": "y _ { \\mathrm { t r } } \\in [ k ] ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 219, + 505, + 234 + ], + "score": 1.0, + "content": "denote the original training set. The distilled dataset will contain one prototype example", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 85, + 230, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 85, + 234, + 100, + 244 + ], + "score": 1.0, + "content": "285", + "type": "text" + }, + { + "bbox": [ + 104, + 230, + 218, + 245 + ], + "score": 1.0, + "content": "for each class and therefore", + "type": "text" + }, + { + "bbox": [ + 218, + 231, + 258, + 243 + ], + "score": 0.92, + "content": "\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 230, + 506, + 245 + ], + "score": 1.0, + "content": ". The dataset distillation problem can then naturally be cast as", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 85, + 243, + 504, + 255 + ], + "spans": [ + { + "bbox": [ + 85, + 245, + 100, + 255 + ], + "score": 1.0, + "content": "286", + "type": "text" + }, + { + "bbox": [ + 105, + 243, + 455, + 255 + ], + "score": 1.0, + "content": "a bi-level problem, where in the inner problem we estimate a logistic regression model", + "type": "text" + }, + { + "bbox": [ + 456, + 243, + 504, + 255 + ], + "score": 0.92, + "content": "\\dot { { \\boldsymbol { x } } } ^ { \\star } ( { \\boldsymbol { \\theta } } ) \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 86, + 253, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 86, + 257, + 99, + 266 + ], + "score": 1.0, + "content": "287", + "type": "text" + }, + { + "bbox": [ + 104, + 253, + 230, + 268 + ], + "score": 1.0, + "content": "trained on the distilled images", + "type": "text" + }, + { + "bbox": [ + 231, + 254, + 271, + 265 + ], + "score": 0.92, + "content": "\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 253, + 506, + 268 + ], + "score": 1.0, + "content": ", while in the outer problem we want to minimize the loss", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 86, + 266, + 267, + 279 + ], + "spans": [ + { + "bbox": [ + 86, + 269, + 99, + 277 + ], + "score": 1.0, + "content": "288", + "type": "text" + }, + { + "bbox": [ + 104, + 266, + 156, + 279 + ], + "score": 1.0, + "content": "achieved by", + "type": "text" + }, + { + "bbox": [ + 156, + 266, + 181, + 278 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 266, + 267, + 279 + ], + "score": 1.0, + "content": "over the training set:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 285, + 461, + 309 + ], + "lines": [ + { + "bbox": [ + 147, + 285, + 461, + 309 + ], + "spans": [ + { + "bbox": [ + 147, + 285, + 461, + 309 + ], + "score": 0.49, + "content": "\\operatorname * { a r g m i n } _ { \\theta \\in \\mathbb { R } ^ { k \\times p } } f ( x ^ { \\star } ( \\theta ) , X _ { \\mathrm { t r } } ; y _ { \\mathrm { t r } } ) \\mathrm { ~ } \\mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \\star } ( \\theta ) \\in \\underset { x \\in \\mathbb { R } ^ { p } } { \\operatorname { a r g m i n } } f ( x , \\theta ; [ k ] ) + \\varepsilon \\| x \\| ^ { 2 } ,", + "type": "interline_equation", + "image_path": "eb3fb919fa6543702af101d5071467ce0d6f5193925b921c98563e935264e4eb.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 147, + 285, + 461, + 309 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 91, + 331, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 89, + 330, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 89, + 334, + 101, + 342 + ], + "score": 1.0, + "content": "289", + "type": "text" + }, + { + "bbox": [ + 103, + 330, + 133, + 343 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 331, + 230, + 343 + ], + "score": 0.89, + "content": "f ( x , X ; y ) : = \\ell ( X x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 330, + 233, + 343 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 233, + 332, + 239, + 341 + ], + "score": 0.6, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 330, + 447, + 343 + ], + "score": 1.0, + "content": "denotes the multiclass logistic regression loss, and", + "type": "text" + }, + { + "bbox": [ + 447, + 331, + 487, + 342 + ], + "score": 0.91, + "content": "\\varepsilon = 1 0 ^ { - 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 330, + 506, + 343 + ], + "score": 1.0, + "content": "is a", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 87, + 342, + 434, + 355 + ], + "spans": [ + { + "bbox": [ + 87, + 342, + 434, + 355 + ], + "score": 1.0, + "content": "290 regularization parameter that we found had a very positive effect on convergence.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 95, + 358, + 505, + 468 + ], + "lines": [ + { + "bbox": [ + 104, + 358, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 104, + 358, + 506, + 371 + ], + "score": 1.0, + "content": "In this problem, and unlike in the general hyperparameter optimization setup, both the inner and outer", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 94, + 369, + 506, + 382 + ], + "spans": [ + { + "bbox": [ + 94, + 373, + 99, + 379 + ], + "score": 1.0, + "content": "2", + "type": "text" + }, + { + "bbox": [ + 104, + 369, + 506, + 382 + ], + "score": 1.0, + "content": "problems are high-dimensional, making it an ideal test-bed for gradient-based bi-level optimization", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 93, + 380, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 93, + 384, + 99, + 390 + ], + "score": 1.0, + "content": "93", + "type": "text" + }, + { + "bbox": [ + 104, + 380, + 506, + 393 + ], + "score": 1.0, + "content": "methods. For this experiment, we use the MNIST dataset. The number of parameters in the inner", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 94, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 94, + 395, + 99, + 401 + ], + "score": 1.0, + "content": "4", + "type": "text" + }, + { + "bbox": [ + 104, + 390, + 152, + 403 + ], + "score": 1.0, + "content": "problem is", + "type": "text" + }, + { + "bbox": [ + 153, + 390, + 214, + 402 + ], + "score": 0.93, + "content": "p = 2 8 ^ { 2 } \\overset { \\cdot } { = } 7 8 4", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 390, + 428, + 403 + ], + "score": 1.0, + "content": ". while the number of parameters of the outer loss is", + "type": "text" + }, + { + "bbox": [ + 428, + 391, + 485, + 402 + ], + "score": 0.91, + "content": "k \\times p = 7 8 4 0", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 390, + 506, + 403 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 93, + 402, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 93, + 406, + 99, + 412 + ], + "score": 1.0, + "content": "95", + "type": "text" + }, + { + "bbox": [ + 105, + 402, + 506, + 415 + ], + "score": 1.0, + "content": "solve this problem using gradient descent on both the inner and outer problem, with the gradient", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 93, + 413, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 93, + 417, + 99, + 423 + ], + "score": 1.0, + "content": "96", + "type": "text" + }, + { + "bbox": [ + 106, + 414, + 399, + 425 + ], + "score": 1.0, + "content": "of the outer loss computed using implicit differentiation, as described in", + "type": "text" + }, + { + "bbox": [ + 399, + 413, + 411, + 424 + ], + "score": 0.82, + "content": "\\ S 2", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 414, + 505, + 425 + ], + "score": 1.0, + "content": ". This is fundamentally", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 94, + 424, + 506, + 436 + ], + "spans": [ + { + "bbox": [ + 94, + 428, + 98, + 432 + ], + "score": 0.999, + "content": "7", + "type": "text" + }, + { + "bbox": [ + 105, + 424, + 506, + 436 + ], + "score": 1.0, + "content": "different from the approach used in the original paper, where they used differentiation of the unrolled", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 93, + 435, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 93, + 439, + 99, + 445 + ], + "score": 1.0, + "content": "98", + "type": "text" + }, + { + "bbox": [ + 106, + 435, + 505, + 447 + ], + "score": 1.0, + "content": "iterates instead. For the same solver, we found that the implicit differentiation approach was 4 times", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 93, + 446, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 93, + 449, + 99, + 456 + ], + "score": 1.0, + "content": "99", + "type": "text" + }, + { + "bbox": [ + 105, + 446, + 344, + 458 + ], + "score": 1.0, + "content": "faster than the original one. The obtained distilled images", + "type": "text" + }, + { + "bbox": [ + 345, + 446, + 351, + 456 + ], + "score": 0.79, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 446, + 506, + 458 + ], + "score": 1.0, + "content": "are visualized in Figure 3 and a code", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 93, + 457, + 295, + 468 + ], + "spans": [ + { + "bbox": [ + 93, + 460, + 99, + 466 + ], + "score": 1.0, + "content": "00", + "type": "text" + }, + { + "bbox": [ + 105, + 457, + 295, + 468 + ], + "score": 1.0, + "content": "example is given in Figure 10 in the Appendix.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 21.5 + }, + { + "type": "title", + "bbox": [ + 103, + 483, + 310, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 311, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 311, + 497 + ], + "score": 1.0, + "content": "3.4 Sensitivity analysis of molecular dynamics", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 90, + 504, + 372, + 592 + ], + "lines": [ + { + "bbox": [ + 88, + 504, + 374, + 517 + ], + "spans": [ + { + "bbox": [ + 88, + 506, + 100, + 516 + ], + "score": 1.0, + "content": "302", + "type": "text" + }, + { + "bbox": [ + 104, + 504, + 374, + 517 + ], + "score": 1.0, + "content": "Many applications of physical simulations require solving optimiza-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 88, + 515, + 373, + 527 + ], + "spans": [ + { + "bbox": [ + 88, + 517, + 100, + 527 + ], + "score": 1.0, + "content": "303", + "type": "text" + }, + { + "bbox": [ + 105, + 515, + 373, + 527 + ], + "score": 1.0, + "content": "tion problems, such as energy minimization in molecular [62] and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 88, + 527, + 372, + 537 + ], + "spans": [ + { + "bbox": [ + 88, + 529, + 99, + 537 + ], + "score": 1.0, + "content": "304", + "type": "text" + }, + { + "bbox": [ + 106, + 527, + 372, + 537 + ], + "score": 1.0, + "content": "continuum [8] mechanics, structural optimization [41] and data", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 88, + 538, + 372, + 549 + ], + "spans": [ + { + "bbox": [ + 88, + 540, + 99, + 548 + ], + "score": 1.0, + "content": "305", + "type": "text" + }, + { + "bbox": [ + 106, + 538, + 372, + 549 + ], + "score": 1.0, + "content": "assimilation [32]. However, even fully differentiable simulators", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 87, + 548, + 373, + 559 + ], + "spans": [ + { + "bbox": [ + 87, + 551, + 99, + 559 + ], + "score": 1.0, + "content": "306", + "type": "text" + }, + { + "bbox": [ + 106, + 548, + 373, + 559 + ], + "score": 1.0, + "content": "may not have efficient or accurate derivatives. We revisit an exam-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 88, + 558, + 373, + 572 + ], + "spans": [ + { + "bbox": [ + 88, + 561, + 99, + 570 + ], + "score": 1.0, + "content": "307", + "type": "text" + }, + { + "bbox": [ + 105, + 558, + 373, + 572 + ], + "score": 1.0, + "content": "ple from JAX-MD [62], the problem of finding energy minimizing", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 88, + 570, + 372, + 582 + ], + "spans": [ + { + "bbox": [ + 88, + 573, + 99, + 581 + ], + "score": 1.0, + "content": "308", + "type": "text" + }, + { + "bbox": [ + 105, + 570, + 309, + 582 + ], + "score": 1.0, + "content": "configurations to a system of packed particles in an", + "type": "text" + }, + { + "bbox": [ + 310, + 572, + 320, + 580 + ], + "score": 0.78, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 570, + 372, + 582 + ], + "score": 1.0, + "content": "-dimensional", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 88, + 581, + 169, + 592 + ], + "spans": [ + { + "bbox": [ + 88, + 583, + 99, + 592 + ], + "score": 1.0, + "content": "309", + "type": "text" + }, + { + "bbox": [ + 105, + 581, + 160, + 592 + ], + "score": 1.0, + "content": "box of width", + "type": "text" + }, + { + "bbox": [ + 160, + 581, + 165, + 591 + ], + "score": 0.68, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 581, + 169, + 592 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 31.5 + }, + { + "type": "interline_equation", + "bbox": [ + 161, + 599, + 316, + 627 + ], + "lines": [ + { + "bbox": [ + 161, + 599, + 316, + 627 + ], + "spans": [ + { + "bbox": [ + 161, + 599, + 316, + 627 + ], + "score": 0.94, + "content": "x ^ { \\star } ( \\theta ) = { \\underset { x \\in \\mathbb { R } ^ { k \\times m } } { \\operatorname { a r g m i n } } } \\sum _ { i j } U ( x _ { i j } \\mod \\ell , \\theta ) ,", + "type": "interline_equation", + "image_path": "be2b151ec9e3ce51fc1bc171b02954136717cb591e72d602d6c66af1b854b376.jpg" + } + ] + } + ], + "index": 38.5, + "virtual_lines": [ + { + "bbox": [ + 161, + 599, + 316, + 613.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 161, + 613.0, + 316, + 627.0 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "image", + "bbox": [ + 382, + 495, + 502, + 615 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 382, + 495, + 502, + 615 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 382, + 495, + 502, + 615 + ], + "spans": [ + { + "bbox": [ + 382, + 495, + 502, + 615 + ], + "score": 0.968, + "type": "image", + "image_path": "7f44b1e279d58fbab587c01b99912576abba62a2346e36362db11cf427b8a046.jpg" + } + ] + } + ], + "index": 36.5, + "virtual_lines": [ + { + "bbox": [ + 382, + 495, + 502, + 555.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 382, + 555.0, + 502, + 615.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 379, + 621, + 505, + 665 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 379, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 379, + 620, + 505, + 633 + ], + "score": 1.0, + "content": "Figure 4: Particle positions", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 379, + 632, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 379, + 632, + 506, + 643 + ], + "score": 1.0, + "content": "and position sensitivity vectors,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 379, + 643, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 379, + 643, + 505, + 654 + ], + "score": 1.0, + "content": "with respect to increasing the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 379, + 653, + 501, + 666 + ], + "spans": [ + { + "bbox": [ + 379, + 653, + 501, + 666 + ], + "score": 1.0, + "content": "diameter of the blue particles.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 46.5 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 86, + 634, + 374, + 689 + ], + "lines": [ + { + "bbox": [ + 86, + 633, + 373, + 646 + ], + "spans": [ + { + "bbox": [ + 86, + 636, + 99, + 645 + ], + "score": 1.0, + "content": "310", + "type": "text" + }, + { + "bbox": [ + 104, + 633, + 132, + 646 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 634, + 171, + 646 + ], + "score": 0.93, + "content": "U ( x _ { i j } , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 633, + 373, + 646 + ], + "score": 1.0, + "content": "is the pairwise potential energy function, with half", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 85, + 645, + 373, + 657 + ], + "spans": [ + { + "bbox": [ + 85, + 647, + 99, + 657 + ], + "score": 1.0, + "content": "311", + "type": "text" + }, + { + "bbox": [ + 105, + 645, + 295, + 657 + ], + "score": 1.0, + "content": "the particles at diameter 1 and half at diameter", + "type": "text" + }, + { + "bbox": [ + 295, + 645, + 327, + 655 + ], + "score": 0.89, + "content": "\\theta = 0 . 6", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 645, + 373, + 657 + ], + "score": 1.0, + "content": ", which we", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 86, + 656, + 373, + 667 + ], + "spans": [ + { + "bbox": [ + 86, + 658, + 99, + 667 + ], + "score": 1.0, + "content": "312", + "type": "text" + }, + { + "bbox": [ + 105, + 656, + 373, + 667 + ], + "score": 1.0, + "content": "optimize with a domain-specific optimizer [13]. Here we consider", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 86, + 666, + 373, + 680 + ], + "spans": [ + { + "bbox": [ + 86, + 669, + 100, + 678 + ], + "score": 1.0, + "content": "313", + "type": "text" + }, + { + "bbox": [ + 105, + 666, + 339, + 680 + ], + "score": 1.0, + "content": "sensitivity of particle position with respect to diameter", + "type": "text" + }, + { + "bbox": [ + 340, + 667, + 369, + 679 + ], + "score": 0.92, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 666, + 373, + 680 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 86, + 678, + 374, + 691 + ], + "spans": [ + { + "bbox": [ + 86, + 680, + 100, + 689 + ], + "score": 1.0, + "content": "314", + "type": "text" + }, + { + "bbox": [ + 105, + 678, + 374, + 691 + ], + "score": 1.0, + "content": "rather than sensitivity of the total energy from the original experi-", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 84, + 689, + 501, + 722 + ], + "lines": [ + { + "bbox": [ + 86, + 688, + 504, + 702 + ], + "spans": [ + { + "bbox": [ + 86, + 691, + 100, + 700 + ], + "score": 1.0, + "content": "315", + "type": "text" + }, + { + "bbox": [ + 105, + 688, + 504, + 702 + ], + "score": 1.0, + "content": "ment. Figure 4 shows results calculated via forward-mode implicit differentiation (JVP). Whereas", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 85, + 700, + 503, + 712 + ], + "spans": [ + { + "bbox": [ + 85, + 702, + 100, + 712 + ], + "score": 1.0, + "content": "316", + "type": "text" + }, + { + "bbox": [ + 106, + 700, + 503, + 712 + ], + "score": 1.0, + "content": "differentiating the unrolled optimizer happens to work for total energy, here it typically does not even", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 86, + 711, + 419, + 723 + ], + "spans": [ + { + "bbox": [ + 86, + 714, + 99, + 722 + ], + "score": 1.0, + "content": "317", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 419, + 723 + ], + "score": 1.0, + "content": "converge (see Appendix Fig. 15), due the discontinuous optimization method.", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 50 + } + ], + "page_idx": 8, + "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": "9", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 213, + 70, + 388, + 78 + ], + "lines": [ + { + "bbox": [ + 212, + 71, + 387, + 78 + ], + "spans": [ + { + "bbox": [ + 212, + 71, + 387, + 78 + ], + "score": 1.0, + "content": "Dataset Distillation (MNIST). Generalization Accuracy: 0.8556", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 106, + 78, + 505, + 114 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 78, + 505, + 114 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 78, + 505, + 114 + ], + "spans": [ + { + "bbox": [ + 106, + 78, + 505, + 114 + ], + "score": 0.946, + "type": "image", + "image_path": "3ee0f32e6f80a02150d66af9cd3d4abfc0547511f8cbe6272c79b60b2929a87c.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 78, + 505, + 90.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 90.0, + 505, + 102.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 102.0, + 505, + 114.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 119, + 505, + 154 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 118, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 244, + 134 + ], + "score": 1.0, + "content": "Figure 3: Distilled MNIST dataset", + "type": "text" + }, + { + "bbox": [ + 244, + 119, + 285, + 131 + ], + "score": 0.93, + "content": "\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 118, + 506, + 134 + ], + "score": 1.0, + "content": "obtained by solving (14). We learn one image per class", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 131, + 505, + 143 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 302, + 143 + ], + "score": 1.0, + "content": "such that a logistic regression model trained on", + "type": "text" + }, + { + "bbox": [ + 302, + 132, + 309, + 141 + ], + "score": 0.75, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 131, + 505, + 143 + ], + "score": 1.0, + "content": "achieves the lowest logistic loss on the MNIST", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 142, + 385, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 385, + 155 + ], + "score": 1.0, + "content": "training set. Implicit differentiation was 4 times faster than unrolling.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 88, + 177, + 211, + 189 + ], + "lines": [ + { + "bbox": [ + 85, + 177, + 212, + 190 + ], + "spans": [ + { + "bbox": [ + 85, + 177, + 212, + 190 + ], + "score": 1.0, + "content": "281 3.3 Dataset distillation", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "index", + "bbox": [ + 85, + 198, + 506, + 278 + ], + "lines": [ + { + "bbox": [ + 85, + 199, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 85, + 200, + 100, + 210 + ], + "score": 1.0, + "content": "282", + "type": "text" + }, + { + "bbox": [ + 105, + 199, + 505, + 210 + ], + "score": 1.0, + "content": "Dataset distillation [67, 46] aims to learn a small synthetic training dataset such that a model trained", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 209, + 506, + 221 + ], + "spans": [ + { + "bbox": [ + 85, + 211, + 100, + 221 + ], + "score": 1.0, + "content": "283", + "type": "text" + }, + { + "bbox": [ + 105, + 209, + 433, + 221 + ], + "score": 1.0, + "content": "on this learned data set achieves small loss on the original training set. Formally, let", + "type": "text" + }, + { + "bbox": [ + 433, + 209, + 487, + 221 + ], + "score": 0.94, + "content": "X _ { \\mathsf { t r } } \\in \\mathbb { R } ^ { m \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 209, + 506, + 221 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 219, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 85, + 222, + 100, + 232 + ], + "score": 1.0, + "content": "284", + "type": "text" + }, + { + "bbox": [ + 107, + 220, + 151, + 232 + ], + "score": 0.93, + "content": "y _ { \\mathrm { t r } } \\in [ k ] ^ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 219, + 505, + 234 + ], + "score": 1.0, + "content": "denote the original training set. The distilled dataset will contain one prototype example", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 230, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 85, + 234, + 100, + 244 + ], + "score": 1.0, + "content": "285", + "type": "text" + }, + { + "bbox": [ + 104, + 230, + 218, + 245 + ], + "score": 1.0, + "content": "for each class and therefore", + "type": "text" + }, + { + "bbox": [ + 218, + 231, + 258, + 243 + ], + "score": 0.92, + "content": "\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 230, + 506, + 245 + ], + "score": 1.0, + "content": ". The dataset distillation problem can then naturally be cast as", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 243, + 504, + 255 + ], + "spans": [ + { + "bbox": [ + 85, + 245, + 100, + 255 + ], + "score": 1.0, + "content": "286", + "type": "text" + }, + { + "bbox": [ + 105, + 243, + 455, + 255 + ], + "score": 1.0, + "content": "a bi-level problem, where in the inner problem we estimate a logistic regression model", + "type": "text" + }, + { + "bbox": [ + 456, + 243, + 504, + 255 + ], + "score": 0.92, + "content": "\\dot { { \\boldsymbol { x } } } ^ { \\star } ( { \\boldsymbol { \\theta } } ) \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 253, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 86, + 257, + 99, + 266 + ], + "score": 1.0, + "content": "287", + "type": "text" + }, + { + "bbox": [ + 104, + 253, + 230, + 268 + ], + "score": 1.0, + "content": "trained on the distilled images", + "type": "text" + }, + { + "bbox": [ + 231, + 254, + 271, + 265 + ], + "score": 0.92, + "content": "\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 253, + 506, + 268 + ], + "score": 1.0, + "content": ", while in the outer problem we want to minimize the loss", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 266, + 267, + 279 + ], + "spans": [ + { + "bbox": [ + 86, + 269, + 99, + 277 + ], + "score": 1.0, + "content": "288", + "type": "text" + }, + { + "bbox": [ + 104, + 266, + 156, + 279 + ], + "score": 1.0, + "content": "achieved by", + "type": "text" + }, + { + "bbox": [ + 156, + 266, + 181, + 278 + ], + "score": 0.93, + "content": "x ^ { \\star } ( \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 266, + 267, + 279 + ], + "score": 1.0, + "content": "over the training set:", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + } + ], + "index": 10, + "bbox_fs": [ + 85, + 199, + 506, + 279 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 285, + 461, + 309 + ], + "lines": [ + { + "bbox": [ + 147, + 285, + 461, + 309 + ], + "spans": [ + { + "bbox": [ + 147, + 285, + 461, + 309 + ], + "score": 0.49, + "content": "\\operatorname * { a r g m i n } _ { \\theta \\in \\mathbb { R } ^ { k \\times p } } f ( x ^ { \\star } ( \\theta ) , X _ { \\mathrm { t r } } ; y _ { \\mathrm { t r } } ) \\mathrm { ~ } \\mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \\star } ( \\theta ) \\in \\underset { x \\in \\mathbb { R } ^ { p } } { \\operatorname { a r g m i n } } f ( x , \\theta ; [ k ] ) + \\varepsilon \\| x \\| ^ { 2 } ,", + "type": "interline_equation", + "image_path": "eb3fb919fa6543702af101d5071467ce0d6f5193925b921c98563e935264e4eb.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 147, + 285, + 461, + 309 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "index", + "bbox": [ + 91, + 331, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 89, + 330, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 89, + 334, + 101, + 342 + ], + "score": 1.0, + "content": "289", + "type": "text" + }, + { + "bbox": [ + 103, + 330, + 133, + 343 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 331, + 230, + 343 + ], + "score": 0.89, + "content": "f ( x , X ; y ) : = \\ell ( X x , y )", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 330, + 233, + 343 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 233, + 332, + 239, + 341 + ], + "score": 0.6, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 330, + 447, + 343 + ], + "score": 1.0, + "content": "denotes the multiclass logistic regression loss, and", + "type": "text" + }, + { + "bbox": [ + 447, + 331, + 487, + 342 + ], + "score": 0.91, + "content": "\\varepsilon = 1 0 ^ { - 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 330, + 506, + 343 + ], + "score": 1.0, + "content": "is a", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 87, + 342, + 434, + 355 + ], + "spans": [ + { + "bbox": [ + 87, + 342, + 434, + 355 + ], + "score": 1.0, + "content": "290 regularization parameter that we found had a very positive effect on convergence.", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 104, + 358, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 104, + 358, + 506, + 371 + ], + "score": 1.0, + "content": "In this problem, and unlike in the general hyperparameter optimization setup, both the inner and outer", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 94, + 369, + 506, + 382 + ], + "spans": [ + { + "bbox": [ + 94, + 373, + 99, + 379 + ], + "score": 1.0, + "content": "2", + "type": "text" + }, + { + "bbox": [ + 104, + 369, + 506, + 382 + ], + "score": 1.0, + "content": "problems are high-dimensional, making it an ideal test-bed for gradient-based bi-level optimization", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 380, + 506, + 393 + ], + "spans": [ + { + "bbox": [ + 93, + 384, + 99, + 390 + ], + "score": 1.0, + "content": "93", + "type": "text" + }, + { + "bbox": [ + 104, + 380, + 506, + 393 + ], + "score": 1.0, + "content": "methods. For this experiment, we use the MNIST dataset. The number of parameters in the inner", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 94, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 94, + 395, + 99, + 401 + ], + "score": 1.0, + "content": "4", + "type": "text" + }, + { + "bbox": [ + 104, + 390, + 152, + 403 + ], + "score": 1.0, + "content": "problem is", + "type": "text" + }, + { + "bbox": [ + 153, + 390, + 214, + 402 + ], + "score": 0.93, + "content": "p = 2 8 ^ { 2 } \\overset { \\cdot } { = } 7 8 4", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 390, + 428, + 403 + ], + "score": 1.0, + "content": ". while the number of parameters of the outer loss is", + "type": "text" + }, + { + "bbox": [ + 428, + 391, + 485, + 402 + ], + "score": 0.91, + "content": "k \\times p = 7 8 4 0", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 390, + 506, + 403 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 402, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 93, + 406, + 99, + 412 + ], + "score": 1.0, + "content": "95", + "type": "text" + }, + { + "bbox": [ + 105, + 402, + 506, + 415 + ], + "score": 1.0, + "content": "solve this problem using gradient descent on both the inner and outer problem, with the gradient", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 413, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 93, + 417, + 99, + 423 + ], + "score": 1.0, + "content": "96", + "type": "text" + }, + { + "bbox": [ + 106, + 414, + 399, + 425 + ], + "score": 1.0, + "content": "of the outer loss computed using implicit differentiation, as described in", + "type": "text" + }, + { + "bbox": [ + 399, + 413, + 411, + 424 + ], + "score": 0.82, + "content": "\\ S 2", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 414, + 505, + 425 + ], + "score": 1.0, + "content": ". This is fundamentally", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 94, + 424, + 506, + 436 + ], + "spans": [ + { + "bbox": [ + 94, + 428, + 98, + 432 + ], + "score": 0.999, + "content": "7", + "type": "text" + }, + { + "bbox": [ + 105, + 424, + 506, + 436 + ], + "score": 1.0, + "content": "different from the approach used in the original paper, where they used differentiation of the unrolled", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 435, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 93, + 439, + 99, + 445 + ], + "score": 1.0, + "content": "98", + "type": "text" + }, + { + "bbox": [ + 106, + 435, + 505, + 447 + ], + "score": 1.0, + "content": "iterates instead. For the same solver, we found that the implicit differentiation approach was 4 times", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 446, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 93, + 449, + 99, + 456 + ], + "score": 1.0, + "content": "99", + "type": "text" + }, + { + "bbox": [ + 105, + 446, + 344, + 458 + ], + "score": 1.0, + "content": "faster than the original one. The obtained distilled images", + "type": "text" + }, + { + "bbox": [ + 345, + 446, + 351, + 456 + ], + "score": 0.79, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 446, + 506, + 458 + ], + "score": 1.0, + "content": "are visualized in Figure 3 and a code", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 93, + 457, + 295, + 468 + ], + "spans": [ + { + "bbox": [ + 93, + 460, + 99, + 466 + ], + "score": 1.0, + "content": "00", + "type": "text" + }, + { + "bbox": [ + 105, + 457, + 295, + 468 + ], + "score": 1.0, + "content": "example is given in Figure 10 in the Appendix.", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + } + ], + "index": 15.5, + "bbox_fs": [ + 87, + 330, + 506, + 355 + ] + }, + { + "type": "index", + "bbox": [ + 95, + 358, + 505, + 468 + ], + "lines": [], + "index": 21.5, + "bbox_fs": [ + 93, + 358, + 506, + 468 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 103, + 483, + 310, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 311, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 311, + 497 + ], + "score": 1.0, + "content": "3.4 Sensitivity analysis of molecular dynamics", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "index", + "bbox": [ + 90, + 504, + 372, + 592 + ], + "lines": [ + { + "bbox": [ + 88, + 504, + 374, + 517 + ], + "spans": [ + { + "bbox": [ + 88, + 506, + 100, + 516 + ], + "score": 1.0, + "content": "302", + "type": "text" + }, + { + "bbox": [ + 104, + 504, + 374, + 517 + ], + "score": 1.0, + "content": "Many applications of physical simulations require solving optimiza-", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 515, + 373, + 527 + ], + "spans": [ + { + "bbox": [ + 88, + 517, + 100, + 527 + ], + "score": 1.0, + "content": "303", + "type": "text" + }, + { + "bbox": [ + 105, + 515, + 373, + 527 + ], + "score": 1.0, + "content": "tion problems, such as energy minimization in molecular [62] and", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 527, + 372, + 537 + ], + "spans": [ + { + "bbox": [ + 88, + 529, + 99, + 537 + ], + "score": 1.0, + "content": "304", + "type": "text" + }, + { + "bbox": [ + 106, + 527, + 372, + 537 + ], + "score": 1.0, + "content": "continuum [8] mechanics, structural optimization [41] and data", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 538, + 372, + 549 + ], + "spans": [ + { + "bbox": [ + 88, + 540, + 99, + 548 + ], + "score": 1.0, + "content": "305", + "type": "text" + }, + { + "bbox": [ + 106, + 538, + 372, + 549 + ], + "score": 1.0, + "content": "assimilation [32]. However, even fully differentiable simulators", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 87, + 548, + 373, + 559 + ], + "spans": [ + { + "bbox": [ + 87, + 551, + 99, + 559 + ], + "score": 1.0, + "content": "306", + "type": "text" + }, + { + "bbox": [ + 106, + 548, + 373, + 559 + ], + "score": 1.0, + "content": "may not have efficient or accurate derivatives. We revisit an exam-", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 558, + 373, + 572 + ], + "spans": [ + { + "bbox": [ + 88, + 561, + 99, + 570 + ], + "score": 1.0, + "content": "307", + "type": "text" + }, + { + "bbox": [ + 105, + 558, + 373, + 572 + ], + "score": 1.0, + "content": "ple from JAX-MD [62], the problem of finding energy minimizing", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 570, + 372, + 582 + ], + "spans": [ + { + "bbox": [ + 88, + 573, + 99, + 581 + ], + "score": 1.0, + "content": "308", + "type": "text" + }, + { + "bbox": [ + 105, + 570, + 309, + 582 + ], + "score": 1.0, + "content": "configurations to a system of packed particles in an", + "type": "text" + }, + { + "bbox": [ + 310, + 572, + 320, + 580 + ], + "score": 0.78, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 570, + 372, + 582 + ], + "score": 1.0, + "content": "-dimensional", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 88, + 581, + 169, + 592 + ], + "spans": [ + { + "bbox": [ + 88, + 583, + 99, + 592 + ], + "score": 1.0, + "content": "309", + "type": "text" + }, + { + "bbox": [ + 105, + 581, + 160, + 592 + ], + "score": 1.0, + "content": "box of width", + "type": "text" + }, + { + "bbox": [ + 160, + 581, + 165, + 591 + ], + "score": 0.68, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 581, + 169, + 592 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + } + ], + "index": 31.5, + "bbox_fs": [ + 87, + 504, + 374, + 592 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 161, + 599, + 316, + 627 + ], + "lines": [ + { + "bbox": [ + 161, + 599, + 316, + 627 + ], + "spans": [ + { + "bbox": [ + 161, + 599, + 316, + 627 + ], + "score": 0.94, + "content": "x ^ { \\star } ( \\theta ) = { \\underset { x \\in \\mathbb { R } ^ { k \\times m } } { \\operatorname { a r g m i n } } } \\sum _ { i j } U ( x _ { i j } \\mod \\ell , \\theta ) ,", + "type": "interline_equation", + "image_path": "be2b151ec9e3ce51fc1bc171b02954136717cb591e72d602d6c66af1b854b376.jpg" + } + ] + } + ], + "index": 38.5, + "virtual_lines": [ + { + "bbox": [ + 161, + 599, + 316, + 613.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 161, + 613.0, + 316, + 627.0 + ], + "spans": [], + "index": 39 + } + ] + }, + { + "type": "image", + "bbox": [ + 382, + 495, + 502, + 615 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 382, + 495, + 502, + 615 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 382, + 495, + 502, + 615 + ], + "spans": [ + { + "bbox": [ + 382, + 495, + 502, + 615 + ], + "score": 0.968, + "type": "image", + "image_path": "7f44b1e279d58fbab587c01b99912576abba62a2346e36362db11cf427b8a046.jpg" + } + ] + } + ], + "index": 36.5, + "virtual_lines": [ + { + "bbox": [ + 382, + 495, + 502, + 555.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 382, + 555.0, + 502, + 615.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 379, + 621, + 505, + 665 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 379, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 379, + 620, + 505, + 633 + ], + "score": 1.0, + "content": "Figure 4: Particle positions", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 379, + 632, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 379, + 632, + 506, + 643 + ], + "score": 1.0, + "content": "and position sensitivity vectors,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 379, + 643, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 379, + 643, + 505, + 654 + ], + "score": 1.0, + "content": "with respect to increasing the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 379, + 653, + 501, + 666 + ], + "spans": [ + { + "bbox": [ + 379, + 653, + 501, + 666 + ], + "score": 1.0, + "content": "diameter of the blue particles.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 46.5 + } + ], + "index": 41.5 + }, + { + "type": "index", + "bbox": [ + 86, + 634, + 374, + 689 + ], + "lines": [ + { + "bbox": [ + 86, + 633, + 373, + 646 + ], + "spans": [ + { + "bbox": [ + 86, + 636, + 99, + 645 + ], + "score": 1.0, + "content": "310", + "type": "text" + }, + { + "bbox": [ + 104, + 633, + 132, + 646 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 634, + 171, + 646 + ], + "score": 0.93, + "content": "U ( x _ { i j } , \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 633, + 373, + 646 + ], + "score": 1.0, + "content": "is the pairwise potential energy function, with half", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 645, + 373, + 657 + ], + "spans": [ + { + "bbox": [ + 85, + 647, + 99, + 657 + ], + "score": 1.0, + "content": "311", + "type": "text" + }, + { + "bbox": [ + 105, + 645, + 295, + 657 + ], + "score": 1.0, + "content": "the particles at diameter 1 and half at diameter", + "type": "text" + }, + { + "bbox": [ + 295, + 645, + 327, + 655 + ], + "score": 0.89, + "content": "\\theta = 0 . 6", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 645, + 373, + 657 + ], + "score": 1.0, + "content": ", which we", + "type": "text" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 656, + 373, + 667 + ], + "spans": [ + { + "bbox": [ + 86, + 658, + 99, + 667 + ], + "score": 1.0, + "content": "312", + "type": "text" + }, + { + "bbox": [ + 105, + 656, + 373, + 667 + ], + "score": 1.0, + "content": "optimize with a domain-specific optimizer [13]. Here we consider", + "type": "text" + } + ], + "index": 42, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 666, + 373, + 680 + ], + "spans": [ + { + "bbox": [ + 86, + 669, + 100, + 678 + ], + "score": 1.0, + "content": "313", + "type": "text" + }, + { + "bbox": [ + 105, + 666, + 339, + 680 + ], + "score": 1.0, + "content": "sensitivity of particle position with respect to diameter", + "type": "text" + }, + { + "bbox": [ + 340, + 667, + 369, + 679 + ], + "score": 0.92, + "content": "{ \\partial x ^ { \\star } ( \\theta ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 666, + 373, + 680 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 678, + 374, + 691 + ], + "spans": [ + { + "bbox": [ + 86, + 680, + 100, + 689 + ], + "score": 1.0, + "content": "314", + "type": "text" + }, + { + "bbox": [ + 105, + 678, + 374, + 691 + ], + "score": 1.0, + "content": "rather than sensitivity of the total energy from the original experi-", + "type": "text" + } + ], + "index": 44, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 688, + 504, + 702 + ], + "spans": [ + { + "bbox": [ + 86, + 691, + 100, + 700 + ], + "score": 1.0, + "content": "315", + "type": "text" + }, + { + "bbox": [ + 105, + 688, + 504, + 702 + ], + "score": 1.0, + "content": "ment. Figure 4 shows results calculated via forward-mode implicit differentiation (JVP). Whereas", + "type": "text" + } + ], + "index": 49, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 700, + 503, + 712 + ], + "spans": [ + { + "bbox": [ + 85, + 702, + 100, + 712 + ], + "score": 1.0, + "content": "316", + "type": "text" + }, + { + "bbox": [ + 106, + 700, + 503, + 712 + ], + "score": 1.0, + "content": "differentiating the unrolled optimizer happens to work for total energy, here it typically does not even", + "type": "text" + } + ], + "index": 50, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 711, + 419, + 723 + ], + "spans": [ + { + "bbox": [ + 86, + 714, + 99, + 722 + ], + "score": 1.0, + "content": "317", + "type": "text" + }, + { + "bbox": [ + 105, + 711, + 419, + 723 + ], + "score": 1.0, + "content": "converge (see Appendix Fig. 15), due the discontinuous optimization method.", + "type": "text" + } + ], + "index": 51, + "is_list_start_line": true + } + ], + "index": 42, + "bbox_fs": [ + 85, + 633, + 374, + 691 + ] + }, + { + "type": "index", + "bbox": [ + 84, + 689, + 501, + 722 + ], + "lines": [], + "index": 50, + "bbox_fs": [ + 85, + 688, + 504, + 723 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 99, + 84, + 507, + 731 + ], + "lines": [ + { + "bbox": [ + 108, + 88, + 507, + 106 + ], + "spans": [ + { + "bbox": [ + 108, + 88, + 507, + 106 + ], + "score": 1.0, + "content": "[1] M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 126, + 100, + 504, + 115 + ], + "spans": [ + { + "bbox": [ + 126, + 100, + 458, + 115 + ], + "score": 1.0, + "content": "M. Isard, et al. Tensorflow: A system for large-scale machine learning. In 12th", + "type": "text" + }, + { + "bbox": [ + 459, + 101, + 504, + 113 + ], + "score": 0.63, + "content": "\\{ U S E N I X \\}", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 126, + 112, + 507, + 126 + ], + "spans": [ + { + "bbox": [ + 126, + 112, + 383, + 126 + ], + "score": 1.0, + "content": "symposium on operating systems design and implementation", + "type": "text" + }, + { + "bbox": [ + 383, + 112, + 434, + 124 + ], + "score": 0.55, + "content": "\\langle \\mathit { 5 O S D I } \\} \\mathit { 1 6 } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 112, + 507, + 126 + ], + "score": 1.0, + "content": ", pages 265–283,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 126, + 120, + 155, + 137 + ], + "spans": [ + { + "bbox": [ + 126, + 120, + 155, + 137 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 111, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 111, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "[2] A. Agrawal, B. Amos, S. Barratt, S. Boyd, S. Diamond, and Z. Kolter. Differentiable convex", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 126, + 153, + 373, + 167 + ], + "spans": [ + { + "bbox": [ + 126, + 153, + 373, + 167 + ], + "score": 1.0, + "content": "optimization layers. arXiv preprint arXiv:1910.12430, 2019.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 110, + 172, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 110, + 172, + 506, + 187 + ], + "score": 1.0, + "content": "[3] A. Agrawal, S. Barratt, S. Boyd, E. Busseti, and W. M. Moursi. Differentiating through a cone", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 125, + 183, + 332, + 198 + ], + "spans": [ + { + "bbox": [ + 125, + 183, + 332, + 198 + ], + "score": 1.0, + "content": "program. arXiv preprint arXiv:1904.09043, 2019.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 111, + 202, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 111, + 202, + 505, + 216 + ], + "score": 1.0, + "content": "[4] A. Ali, E. Wong, and J. Z. Kolter. A semismooth newton method for fast, generic convex", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 124, + 212, + 507, + 229 + ], + "spans": [ + { + "bbox": [ + 124, + 212, + 507, + 229 + ], + "score": 1.0, + "content": "programming. In International Conference on Machine Learning, pages 70–79. PMLR, 2017.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 111, + 233, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 111, + 233, + 505, + 246 + ], + "score": 1.0, + "content": "[5] B. Amos. Differentiable optimization-based modeling for machine learning. PhD thesis, PhD", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 127, + 244, + 295, + 256 + ], + "spans": [ + { + "bbox": [ + 127, + 244, + 295, + 256 + ], + "score": 1.0, + "content": "thesis. Carnegie Mellon University, 2019.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 109, + 262, + 507, + 277 + ], + "spans": [ + { + "bbox": [ + 109, + 262, + 507, + 277 + ], + "score": 1.0, + "content": "[6] B. Amos and J. Z. Kolter. Optnet: Differentiable optimization as a layer in neural networks. In", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 126, + 273, + 282, + 289 + ], + "spans": [ + { + "bbox": [ + 126, + 273, + 282, + 289 + ], + "score": 1.0, + "content": "Proc. of ICML, pages 136–145, 2017.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 109, + 292, + 507, + 308 + ], + "spans": [ + { + "bbox": [ + 109, + 292, + 507, + 308 + ], + "score": 1.0, + "content": "[7] S. Bai, J. Z. Kolter, and V. Koltun. Deep equilibrium models. arXiv preprint arXiv:1909.01377,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 126, + 304, + 154, + 319 + ], + "spans": [ + { + "bbox": [ + 126, + 304, + 154, + 319 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 110, + 322, + 507, + 338 + ], + "spans": [ + { + "bbox": [ + 110, + 322, + 507, + 338 + ], + "score": 1.0, + "content": "[8] A. Beatson, J. Ash, G. Roeder, T. Xue, and R. P. Adams. Learning composable energy surrogates", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 126, + 333, + 507, + 349 + ], + "spans": [ + { + "bbox": [ + 126, + 333, + 507, + 349 + ], + "score": 1.0, + "content": "for pde order reduction. In H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 127, + 346, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 127, + 346, + 505, + 360 + ], + "score": 1.0, + "content": "editors, Advances in Neural Information Processing Systems, volume 33, pages 338–348. Curran", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 126, + 357, + 219, + 369 + ], + "spans": [ + { + "bbox": [ + 126, + 357, + 219, + 369 + ], + "score": 1.0, + "content": "Associates, Inc., 2020.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 110, + 375, + 506, + 391 + ], + "spans": [ + { + "bbox": [ + 110, + 375, + 506, + 391 + ], + "score": 1.0, + "content": "[9] Y. Bengio. Gradient-based optimization of hyperparameters. Neural computation, 12(8):1889–", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 127, + 387, + 178, + 400 + ], + "spans": [ + { + "bbox": [ + 127, + 387, + 178, + 400 + ], + "score": 1.0, + "content": "1900, 2000.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 405, + 507, + 420 + ], + "spans": [ + { + "bbox": [ + 104, + 405, + 507, + 420 + ], + "score": 1.0, + "content": "[10] Q. Bertrand, Q. Klopfenstein, M. Blondel, S. Vaiter, A. Gramfort, and J. Salmon. Implicit", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 126, + 415, + 506, + 432 + ], + "spans": [ + { + "bbox": [ + 126, + 415, + 506, + 432 + ], + "score": 1.0, + "content": "differentiation of lasso-type models for hyperparameter optimization. In Proc. of ICML, pages", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 128, + 429, + 193, + 440 + ], + "spans": [ + { + "bbox": [ + 128, + 429, + 193, + 440 + ], + "score": 1.0, + "content": "810–821, 2020.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 446, + 507, + 461 + ], + "spans": [ + { + "bbox": [ + 104, + 446, + 507, + 461 + ], + "score": 1.0, + "content": "[11] Q. Bertrand, Q. Klopfenstein, M. Massias, M. Blondel, S. Vaiter, A. Gramfort, and J. Salmon.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 127, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 127, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "Implicit differentiation for fast hyperparameter selection in non-smooth convex learning. arXiv", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 125, + 469, + 267, + 482 + ], + "spans": [ + { + "bbox": [ + 125, + 469, + 267, + 482 + ], + "score": 1.0, + "content": "preprint arXiv:2105.01637, 2021.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 487, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 506, + 502 + ], + "score": 1.0, + "content": "[12] M. J. Best, N. Chakravarti, and V. A. Ubhaya. Minimizing separable convex functions subject", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 127, + 498, + 457, + 512 + ], + "spans": [ + { + "bbox": [ + 127, + 498, + 457, + 512 + ], + "score": 1.0, + "content": "to simple chain constraints. SIAM Journal on Optimization, 10(3):658–672, 2000.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 518, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 532 + ], + "score": 1.0, + "content": "[13] E. Bitzek, P. Koskinen, F. Gähler, M. Moseler, and P. Gumbsch. Structural relaxation made", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 127, + 529, + 317, + 543 + ], + "spans": [ + { + "bbox": [ + 127, + 529, + 317, + 543 + ], + "score": 1.0, + "content": "simple. Phys. Rev. Lett., 97:170201, Oct 2006.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 549, + 473, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 473, + 562 + ], + "score": 1.0, + "content": "[14] M. Blondel. Structured prediction with projection oracles. In Proc. of NeurIPS, 2019.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 567, + 507, + 583 + ], + "spans": [ + { + "bbox": [ + 104, + 567, + 507, + 583 + ], + "score": 1.0, + "content": "[15] M. Blondel, V. Seguy, and A. Rolet. Smooth and sparse optimal transport. In Proc. of AISTATS,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 126, + 579, + 251, + 592 + ], + "spans": [ + { + "bbox": [ + 126, + 579, + 251, + 592 + ], + "score": 1.0, + "content": "pages 880–889. PMLR, 2018.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "[16] M. Blondel, O. Teboul, Q. Berthet, and J. Djolonga. Fast differentiable sorting and ranking. In", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 128, + 609, + 281, + 623 + ], + "spans": [ + { + "bbox": [ + 128, + 609, + 281, + 623 + ], + "score": 1.0, + "content": "Proc. of ICML, pages 950–959, 2020.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "score": 1.0, + "content": "[17] J. Bradbury, R. Frostig, P. Hawkins, M. J. Johnson, C. Leary, D. Maclaurin, and S. Wanderman-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 126, + 640, + 506, + 653 + ], + "spans": [ + { + "bbox": [ + 126, + 640, + 327, + 653 + ], + "score": 1.0, + "content": "Milne. Jax: composable transformations of python", + "type": "text" + }, + { + "bbox": [ + 328, + 641, + 335, + 649 + ], + "score": 0.56, + "content": "^ +", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 640, + 506, + 653 + ], + "score": 1.0, + "content": "numpy programs, 2018. URL http://github.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 127, + 650, + 244, + 664 + ], + "spans": [ + { + "bbox": [ + 127, + 650, + 244, + 664 + ], + "score": 1.0, + "content": "com/google/jax, 4:16, 2020.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 104, + 668, + 507, + 685 + ], + "spans": [ + { + "bbox": [ + 104, + 668, + 189, + 685 + ], + "score": 1.0, + "content": "[18] P. Brucker. An", + "type": "text" + }, + { + "bbox": [ + 189, + 671, + 212, + 682 + ], + "score": 0.9, + "content": "O ( n )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 668, + 507, + 685 + ], + "score": 1.0, + "content": "algorithm for quadratic knapsack problems. Operations Research Letters,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 127, + 680, + 212, + 694 + ], + "spans": [ + { + "bbox": [ + 127, + 680, + 212, + 694 + ], + "score": 1.0, + "content": "3(3):163–166, 1984.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 700, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 506, + 713 + ], + "score": 1.0, + "content": "[19] O. Chapelle, V. Vapnik, O. Bousquet, and S. Mukherjee. Choosing multiple parameters for", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 126, + 711, + 397, + 723 + ], + "spans": [ + { + "bbox": [ + 126, + 711, + 397, + 723 + ], + "score": 1.0, + "content": "support vector machines. Machine learning, 46(1):131–159, 2002.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 21.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 312, + 751 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 86, + 78, + 103, + 736 + ], + "lines": [ + { + "bbox": [ + 84, + 75, + 102, + 87 + ], + "spans": [ + { + "bbox": [ + 84, + 75, + 102, + 87 + ], + "score": 1.0, + "content": "318", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 92, + 101, + 103 + ], + "spans": [ + { + "bbox": [ + 84, + 92, + 101, + 103 + ], + "score": 1.0, + "content": "319", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 102, + 102, + 116 + ], + "spans": [ + { + "bbox": [ + 83, + 102, + 102, + 116 + ], + "score": 1.0, + "content": "320", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 114, + 100, + 126 + ], + "spans": [ + { + "bbox": [ + 84, + 114, + 100, + 126 + ], + "score": 1.0, + "content": "321", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 125, + 101, + 137 + ], + "spans": [ + { + "bbox": [ + 85, + 125, + 101, + 137 + ], + "score": 1.0, + "content": "322", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 144, + 101, + 155 + ], + "spans": [ + { + "bbox": [ + 85, + 144, + 101, + 155 + ], + "score": 1.0, + "content": "323", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 154, + 102, + 171 + ], + "spans": [ + { + "bbox": [ + 84, + 154, + 102, + 171 + ], + "score": 1.0, + "content": "324", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 174, + 101, + 186 + ], + "spans": [ + { + "bbox": [ + 84, + 174, + 101, + 186 + ], + "score": 1.0, + "content": "325", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 184, + 102, + 199 + ], + "spans": [ + { + "bbox": [ + 84, + 184, + 102, + 199 + ], + "score": 1.0, + "content": "326", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 204, + 100, + 216 + ], + "spans": [ + { + "bbox": [ + 85, + 204, + 100, + 216 + ], + "score": 1.0, + "content": "327", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 215, + 102, + 231 + ], + "spans": [ + { + "bbox": [ + 84, + 215, + 102, + 231 + ], + "score": 1.0, + "content": "328", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 234, + 101, + 246 + ], + "spans": [ + { + "bbox": [ + 85, + 234, + 101, + 246 + ], + "score": 1.0, + "content": "329", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 245, + 102, + 260 + ], + "spans": [ + { + "bbox": [ + 84, + 245, + 102, + 260 + ], + "score": 1.0, + "content": "330", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 264, + 100, + 277 + ], + "spans": [ + { + "bbox": [ + 84, + 264, + 100, + 277 + ], + "score": 1.0, + "content": "331", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 276, + 101, + 289 + ], + "spans": [ + { + "bbox": [ + 85, + 276, + 101, + 289 + ], + "score": 1.0, + "content": "332", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 294, + 102, + 308 + ], + "spans": [ + { + "bbox": [ + 84, + 294, + 102, + 308 + ], + "score": 1.0, + "content": "333", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 305, + 102, + 321 + ], + "spans": [ + { + "bbox": [ + 84, + 305, + 102, + 321 + ], + "score": 1.0, + "content": "334", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 324, + 102, + 338 + ], + "spans": [ + { + "bbox": [ + 83, + 324, + 102, + 338 + ], + "score": 1.0, + "content": "335", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 335, + 102, + 349 + ], + "spans": [ + { + "bbox": [ + 83, + 335, + 102, + 349 + ], + "score": 1.0, + "content": "336", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 347, + 101, + 358 + ], + "spans": [ + { + "bbox": [ + 85, + 347, + 101, + 358 + ], + "score": 1.0, + "content": "337", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 357, + 102, + 372 + ], + "spans": [ + { + "bbox": [ + 84, + 357, + 102, + 372 + ], + "score": 1.0, + "content": "338", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 377, + 101, + 389 + ], + "spans": [ + { + "bbox": [ + 85, + 377, + 101, + 389 + ], + "score": 1.0, + "content": "339", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 387, + 102, + 406 + ], + "spans": [ + { + "bbox": [ + 83, + 387, + 102, + 406 + ], + "score": 1.0, + "content": "340", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 407, + 100, + 419 + ], + "spans": [ + { + "bbox": [ + 84, + 407, + 100, + 419 + ], + "score": 1.0, + "content": "341", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 419, + 101, + 430 + ], + "spans": [ + { + "bbox": [ + 84, + 419, + 101, + 430 + ], + "score": 1.0, + "content": "342", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 448, + 100, + 461 + ], + "spans": [ + { + "bbox": [ + 84, + 448, + 100, + 461 + ], + "score": 1.0, + "content": "344", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 459, + 102, + 472 + ], + "spans": [ + { + "bbox": [ + 83, + 459, + 102, + 472 + ], + "score": 1.0, + "content": "345", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 470, + 102, + 486 + ], + "spans": [ + { + "bbox": [ + 84, + 470, + 102, + 486 + ], + "score": 1.0, + "content": "346", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 489, + 101, + 502 + ], + "spans": [ + { + "bbox": [ + 85, + 489, + 101, + 502 + ], + "score": 1.0, + "content": "347", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 500, + 102, + 515 + ], + "spans": [ + { + "bbox": [ + 84, + 500, + 102, + 515 + ], + "score": 1.0, + "content": "348", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 520, + 101, + 531 + ], + "spans": [ + { + "bbox": [ + 85, + 520, + 101, + 531 + ], + "score": 1.0, + "content": "349", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 531, + 102, + 547 + ], + "spans": [ + { + "bbox": [ + 84, + 531, + 102, + 547 + ], + "score": 1.0, + "content": "350", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 550, + 101, + 564 + ], + "spans": [ + { + "bbox": [ + 85, + 550, + 101, + 564 + ], + "score": 1.0, + "content": "351", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 569, + 101, + 581 + ], + "spans": [ + { + "bbox": [ + 85, + 569, + 101, + 581 + ], + "score": 1.0, + "content": "352", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 580, + 102, + 596 + ], + "spans": [ + { + "bbox": [ + 84, + 580, + 102, + 596 + ], + "score": 1.0, + "content": "353", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 599, + 102, + 612 + ], + "spans": [ + { + "bbox": [ + 83, + 599, + 102, + 612 + ], + "score": 1.0, + "content": "354", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 610, + 102, + 625 + ], + "spans": [ + { + "bbox": [ + 83, + 610, + 102, + 625 + ], + "score": 1.0, + "content": "355", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 629, + 102, + 643 + ], + "spans": [ + { + "bbox": [ + 83, + 629, + 102, + 643 + ], + "score": 1.0, + "content": "356", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 640, + 102, + 654 + ], + "spans": [ + { + "bbox": [ + 83, + 640, + 102, + 654 + ], + "score": 1.0, + "content": "357", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 651, + 102, + 667 + ], + "spans": [ + { + "bbox": [ + 83, + 651, + 102, + 667 + ], + "score": 1.0, + "content": "358", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 671, + 101, + 682 + ], + "spans": [ + { + "bbox": [ + 84, + 671, + 101, + 682 + ], + "score": 1.0, + "content": "359", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 681, + 102, + 695 + ], + "spans": [ + { + "bbox": [ + 84, + 681, + 102, + 695 + ], + "score": 1.0, + "content": "360", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 700, + 100, + 713 + ], + "spans": [ + { + "bbox": [ + 84, + 700, + 100, + 713 + ], + "score": 1.0, + "content": "361", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 712, + 102, + 725 + ], + "spans": [ + { + "bbox": [ + 83, + 712, + 102, + 725 + ], + "score": 1.0, + "content": "362", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 86, + 71, + 164, + 84 + ], + "lines": [ + { + "bbox": [ + 105, + 70, + 165, + 86 + ], + "spans": [ + { + "bbox": [ + 105, + 70, + 165, + 86 + ], + "score": 1.0, + "content": "References", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 99, + 84, + 507, + 731 + ], + "lines": [ + { + "bbox": [ + 108, + 88, + 507, + 106 + ], + "spans": [ + { + "bbox": [ + 108, + 88, + 507, + 106 + ], + "score": 1.0, + "content": "[1] M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving,", + "type": "text" + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 100, + 504, + 115 + ], + "spans": [ + { + "bbox": [ + 126, + 100, + 458, + 115 + ], + "score": 1.0, + "content": "M. Isard, et al. Tensorflow: A system for large-scale machine learning. In 12th", + "type": "text" + }, + { + "bbox": [ + 459, + 101, + 504, + 113 + ], + "score": 0.63, + "content": "\\{ U S E N I X \\}", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 126, + 112, + 507, + 126 + ], + "spans": [ + { + "bbox": [ + 126, + 112, + 383, + 126 + ], + "score": 1.0, + "content": "symposium on operating systems design and implementation", + "type": "text" + }, + { + "bbox": [ + 383, + 112, + 434, + 124 + ], + "score": 0.55, + "content": "\\langle \\mathit { 5 O S D I } \\} \\mathit { 1 6 } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 112, + 507, + 126 + ], + "score": 1.0, + "content": ", pages 265–283,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 126, + 120, + 155, + 137 + ], + "spans": [ + { + "bbox": [ + 126, + 120, + 155, + 137 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 3, + "is_list_end_line": true + }, + { + "bbox": [ + 111, + 142, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 111, + 142, + 505, + 156 + ], + "score": 1.0, + "content": "[2] A. Agrawal, B. Amos, S. Barratt, S. Boyd, S. Diamond, and Z. Kolter. Differentiable convex", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 153, + 373, + 167 + ], + "spans": [ + { + "bbox": [ + 126, + 153, + 373, + 167 + ], + "score": 1.0, + "content": "optimization layers. arXiv preprint arXiv:1910.12430, 2019.", + "type": "text" + } + ], + "index": 5, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 172, + 506, + 187 + ], + "spans": [ + { + "bbox": [ + 110, + 172, + 506, + 187 + ], + "score": 1.0, + "content": "[3] A. Agrawal, S. Barratt, S. Boyd, E. Busseti, and W. M. Moursi. Differentiating through a cone", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 125, + 183, + 332, + 198 + ], + "spans": [ + { + "bbox": [ + 125, + 183, + 332, + 198 + ], + "score": 1.0, + "content": "program. arXiv preprint arXiv:1904.09043, 2019.", + "type": "text" + } + ], + "index": 7, + "is_list_end_line": true + }, + { + "bbox": [ + 111, + 202, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 111, + 202, + 505, + 216 + ], + "score": 1.0, + "content": "[4] A. Ali, E. Wong, and J. Z. Kolter. A semismooth newton method for fast, generic convex", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 124, + 212, + 507, + 229 + ], + "spans": [ + { + "bbox": [ + 124, + 212, + 507, + 229 + ], + "score": 1.0, + "content": "programming. In International Conference on Machine Learning, pages 70–79. PMLR, 2017.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 111, + 233, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 111, + 233, + 505, + 246 + ], + "score": 1.0, + "content": "[5] B. Amos. Differentiable optimization-based modeling for machine learning. PhD thesis, PhD", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 244, + 295, + 256 + ], + "spans": [ + { + "bbox": [ + 127, + 244, + 295, + 256 + ], + "score": 1.0, + "content": "thesis. Carnegie Mellon University, 2019.", + "type": "text" + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 109, + 262, + 507, + 277 + ], + "spans": [ + { + "bbox": [ + 109, + 262, + 507, + 277 + ], + "score": 1.0, + "content": "[6] B. Amos and J. Z. Kolter. Optnet: Differentiable optimization as a layer in neural networks. In", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 273, + 282, + 289 + ], + "spans": [ + { + "bbox": [ + 126, + 273, + 282, + 289 + ], + "score": 1.0, + "content": "Proc. of ICML, pages 136–145, 2017.", + "type": "text" + } + ], + "index": 13, + "is_list_end_line": true + }, + { + "bbox": [ + 109, + 292, + 507, + 308 + ], + "spans": [ + { + "bbox": [ + 109, + 292, + 507, + 308 + ], + "score": 1.0, + "content": "[7] S. Bai, J. Z. Kolter, and V. Koltun. Deep equilibrium models. arXiv preprint arXiv:1909.01377,", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 304, + 154, + 319 + ], + "spans": [ + { + "bbox": [ + 126, + 304, + 154, + 319 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 15, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 322, + 507, + 338 + ], + "spans": [ + { + "bbox": [ + 110, + 322, + 507, + 338 + ], + "score": 1.0, + "content": "[8] A. Beatson, J. Ash, G. Roeder, T. Xue, and R. P. Adams. Learning composable energy surrogates", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 333, + 507, + 349 + ], + "spans": [ + { + "bbox": [ + 126, + 333, + 507, + 349 + ], + "score": 1.0, + "content": "for pde order reduction. In H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 127, + 346, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 127, + 346, + 505, + 360 + ], + "score": 1.0, + "content": "editors, Advances in Neural Information Processing Systems, volume 33, pages 338–348. Curran", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 126, + 357, + 219, + 369 + ], + "spans": [ + { + "bbox": [ + 126, + 357, + 219, + 369 + ], + "score": 1.0, + "content": "Associates, Inc., 2020.", + "type": "text" + } + ], + "index": 19, + "is_list_end_line": true + }, + { + "bbox": [ + 110, + 375, + 506, + 391 + ], + "spans": [ + { + "bbox": [ + 110, + 375, + 506, + 391 + ], + "score": 1.0, + "content": "[9] Y. Bengio. Gradient-based optimization of hyperparameters. Neural computation, 12(8):1889–", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 387, + 178, + 400 + ], + "spans": [ + { + "bbox": [ + 127, + 387, + 178, + 400 + ], + "score": 1.0, + "content": "1900, 2000.", + "type": "text" + } + ], + "index": 21, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 405, + 507, + 420 + ], + "spans": [ + { + "bbox": [ + 104, + 405, + 507, + 420 + ], + "score": 1.0, + "content": "[10] Q. Bertrand, Q. Klopfenstein, M. Blondel, S. Vaiter, A. Gramfort, and J. Salmon. Implicit", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 415, + 506, + 432 + ], + "spans": [ + { + "bbox": [ + 126, + 415, + 506, + 432 + ], + "score": 1.0, + "content": "differentiation of lasso-type models for hyperparameter optimization. In Proc. of ICML, pages", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 128, + 429, + 193, + 440 + ], + "spans": [ + { + "bbox": [ + 128, + 429, + 193, + 440 + ], + "score": 1.0, + "content": "810–821, 2020.", + "type": "text" + } + ], + "index": 24, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 446, + 507, + 461 + ], + "spans": [ + { + "bbox": [ + 104, + 446, + 507, + 461 + ], + "score": 1.0, + "content": "[11] Q. Bertrand, Q. Klopfenstein, M. Massias, M. Blondel, S. Vaiter, A. Gramfort, and J. Salmon.", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 127, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "Implicit differentiation for fast hyperparameter selection in non-smooth convex learning. arXiv", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 125, + 469, + 267, + 482 + ], + "spans": [ + { + "bbox": [ + 125, + 469, + 267, + 482 + ], + "score": 1.0, + "content": "preprint arXiv:2105.01637, 2021.", + "type": "text" + } + ], + "index": 27, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 487, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 506, + 502 + ], + "score": 1.0, + "content": "[12] M. J. Best, N. Chakravarti, and V. A. Ubhaya. Minimizing separable convex functions subject", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 498, + 457, + 512 + ], + "spans": [ + { + "bbox": [ + 127, + 498, + 457, + 512 + ], + "score": 1.0, + "content": "to simple chain constraints. SIAM Journal on Optimization, 10(3):658–672, 2000.", + "type": "text" + } + ], + "index": 29, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 518, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 532 + ], + "score": 1.0, + "content": "[13] E. Bitzek, P. Koskinen, F. Gähler, M. Moseler, and P. Gumbsch. Structural relaxation made", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 529, + 317, + 543 + ], + "spans": [ + { + "bbox": [ + 127, + 529, + 317, + 543 + ], + "score": 1.0, + "content": "simple. Phys. Rev. Lett., 97:170201, Oct 2006.", + "type": "text" + } + ], + "index": 31, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 549, + 473, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 473, + 562 + ], + "score": 1.0, + "content": "[14] M. Blondel. Structured prediction with projection oracles. In Proc. of NeurIPS, 2019.", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 567, + 507, + 583 + ], + "spans": [ + { + "bbox": [ + 104, + 567, + 507, + 583 + ], + "score": 1.0, + "content": "[15] M. Blondel, V. Seguy, and A. Rolet. Smooth and sparse optimal transport. In Proc. of AISTATS,", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 579, + 251, + 592 + ], + "spans": [ + { + "bbox": [ + 126, + 579, + 251, + 592 + ], + "score": 1.0, + "content": "pages 880–889. PMLR, 2018.", + "type": "text" + } + ], + "index": 34, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "[16] M. Blondel, O. Teboul, Q. Berthet, and J. Djolonga. Fast differentiable sorting and ranking. In", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 128, + 609, + 281, + 623 + ], + "spans": [ + { + "bbox": [ + 128, + 609, + 281, + 623 + ], + "score": 1.0, + "content": "Proc. of ICML, pages 950–959, 2020.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 506, + 642 + ], + "score": 1.0, + "content": "[17] J. Bradbury, R. Frostig, P. Hawkins, M. J. Johnson, C. Leary, D. Maclaurin, and S. Wanderman-", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 640, + 506, + 653 + ], + "spans": [ + { + "bbox": [ + 126, + 640, + 327, + 653 + ], + "score": 1.0, + "content": "Milne. Jax: composable transformations of python", + "type": "text" + }, + { + "bbox": [ + 328, + 641, + 335, + 649 + ], + "score": 0.56, + "content": "^ +", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 640, + 506, + 653 + ], + "score": 1.0, + "content": "numpy programs, 2018. URL http://github.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 127, + 650, + 244, + 664 + ], + "spans": [ + { + "bbox": [ + 127, + 650, + 244, + 664 + ], + "score": 1.0, + "content": "com/google/jax, 4:16, 2020.", + "type": "text" + } + ], + "index": 39, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 668, + 507, + 685 + ], + "spans": [ + { + "bbox": [ + 104, + 668, + 189, + 685 + ], + "score": 1.0, + "content": "[18] P. Brucker. An", + "type": "text" + }, + { + "bbox": [ + 189, + 671, + 212, + 682 + ], + "score": 0.9, + "content": "O ( n )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 668, + 507, + 685 + ], + "score": 1.0, + "content": "algorithm for quadratic knapsack problems. Operations Research Letters,", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 680, + 212, + 694 + ], + "spans": [ + { + "bbox": [ + 127, + 680, + 212, + 694 + ], + "score": 1.0, + "content": "3(3):163–166, 1984.", + "type": "text" + } + ], + "index": 41, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 700, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 106, + 700, + 506, + 713 + ], + "score": 1.0, + "content": "[19] O. Chapelle, V. Vapnik, O. Bousquet, and S. Mukherjee. Choosing multiple parameters for", + "type": "text" + } + ], + "index": 42, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 711, + 397, + 723 + ], + "spans": [ + { + "bbox": [ + 126, + 711, + 397, + 723 + ], + "score": 1.0, + "content": "support vector machines. Machine learning, 46(1):131–159, 2002.", + "type": "text" + } + ], + "index": 43, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 70, + 506, + 88 + ], + "spans": [ + { + "bbox": [ + 104, + 70, + 506, + 88 + ], + "score": 1.0, + "content": "[20] X. Chen, Y. Zhang, C. Reisinger, and L. Song. Understanding deep architecture with reasoning", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 84, + 407, + 97 + ], + "spans": [ + { + "bbox": [ + 127, + 84, + 407, + 97 + ], + "score": 1.0, + "content": "layer. Advances in Neural Information Processing Systems, 33, 2020.", + "type": "text", + "cross_page": true + } + ], + "index": 1, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 102, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 506, + 117 + ], + "score": 1.0, + "content": "[21] H. Cherkaoui, J. Sulam, and T. Moreau. Learning to solve tv regularised problems with unrolled", + "type": "text", + "cross_page": true + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 113, + 431, + 129 + ], + "spans": [ + { + "bbox": [ + 126, + 113, + 431, + 129 + ], + "score": 1.0, + "content": "algorithms. Advances in Neural Information Processing Systems, 33, 2020.", + "type": "text", + "cross_page": true + } + ], + "index": 3, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 132, + 506, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 349, + 149 + ], + "score": 1.0, + "content": "[22] L. Condat. Fast projection onto the simplex and the", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 349, + 135, + 359, + 145 + ], + "score": 0.87, + "content": "\\ell _ { 1 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 359, + 132, + 506, + 149 + ], + "score": 1.0, + "content": "ball. Mathematical Programming,", + "type": "text", + "cross_page": true + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 128, + 146, + 230, + 158 + ], + "spans": [ + { + "bbox": [ + 128, + 146, + 230, + 158 + ], + "score": 1.0, + "content": "158(1-2):575–585, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 5, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "[23] K. Crammer and Y. Singer. On the algorithmic implementation of multiclass kernel-based", + "type": "text", + "cross_page": true + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 176, + 448, + 188 + ], + "spans": [ + { + "bbox": [ + 127, + 176, + 448, + 188 + ], + "score": 1.0, + "content": "vector machines. Journal of machine learning research, 2(Dec):265–292, 2001.", + "type": "text", + "cross_page": true + } + ], + "index": 7, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 194, + 507, + 210 + ], + "spans": [ + { + "bbox": [ + 104, + 194, + 507, + 210 + ], + "score": 1.0, + "content": "[24] M. Cuturi. Sinkhorn distances: lightspeed computation of optimal transport. In Advances in", + "type": "text", + "cross_page": true + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 206, + 358, + 220 + ], + "spans": [ + { + "bbox": [ + 127, + 206, + 358, + 220 + ], + "score": 1.0, + "content": "Neural Information Processing Systems, volume 2, 2013.", + "type": "text", + "cross_page": true + } + ], + "index": 9, + "is_list_end_line": true + }, + { + "bbox": [ + 107, + 227, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 107, + 227, + 505, + 239 + ], + "score": 1.0, + "content": "[25] C.-A. Deledalle, S. Vaiter, J. Fadili, and G. Peyré. Stein unbiased gradient estimator of the risk", + "type": "text", + "cross_page": true + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 237, + 506, + 251 + ], + "spans": [ + { + "bbox": [ + 127, + 237, + 506, + 251 + ], + "score": 1.0, + "content": "(sugar) for multiple parameter selection. SIAM Journal on Imaging Sciences, 7(4):2448–2487,", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 126, + 248, + 155, + 262 + ], + "spans": [ + { + "bbox": [ + 126, + 248, + 155, + 262 + ], + "score": 1.0, + "content": "2014.", + "type": "text", + "cross_page": true + } + ], + "index": 12, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 267, + 507, + 282 + ], + "spans": [ + { + "bbox": [ + 104, + 267, + 507, + 282 + ], + "score": 1.0, + "content": "[26] S. Diamond and S. Boyd. Cvxpy: A python-embedded modeling language for convex optimiza-", + "type": "text", + "cross_page": true + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 279, + 428, + 293 + ], + "spans": [ + { + "bbox": [ + 127, + 279, + 428, + 293 + ], + "score": 1.0, + "content": "tion. The Journal of Machine Learning Research, 17(1):2909–2913, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 14, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 298, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 506, + 312 + ], + "score": 1.0, + "content": "[27] J. Djolonga and A. Krause. Differentiable learning of submodular models. Proc. of NeurIPS,", + "type": "text", + "cross_page": true + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 309, + 217, + 323 + ], + "spans": [ + { + "bbox": [ + 127, + 309, + 217, + 323 + ], + "score": 1.0, + "content": "30:1013–1023, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 329, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 506, + 343 + ], + "score": 1.0, + "content": "[28] J. Domke. Generic methods for optimization-based modeling. In Artificial Intelligence and", + "type": "text", + "cross_page": true + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 340, + 292, + 354 + ], + "spans": [ + { + "bbox": [ + 127, + 340, + 292, + 354 + ], + "score": 1.0, + "content": "Statistics, pages 318–326. PMLR, 2012.", + "type": "text", + "cross_page": true + } + ], + "index": 18, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 359, + 506, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 475, + 374 + ], + "score": 1.0, + "content": "[29] J. C. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra. Efficient projections onto the", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 476, + 361, + 486, + 371 + ], + "score": 0.87, + "content": "\\ell _ { 1 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 486, + 359, + 506, + 374 + ], + "score": 1.0, + "content": "-ball", + "type": "text", + "cross_page": true + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 128, + 371, + 358, + 383 + ], + "spans": [ + { + "bbox": [ + 128, + 371, + 358, + 383 + ], + "score": 1.0, + "content": "for learning in high dimensions. In Proc. of ICML, 2008.", + "type": "text", + "cross_page": true + } + ], + "index": 20, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "score": 1.0, + "content": "[30] L. Franceschi, M. Donini, P. Frasconi, and M. Pontil. Forward and reverse gradient-based", + "type": "text", + "cross_page": true + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 402, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 127, + 402, + 506, + 416 + ], + "score": 1.0, + "content": "hyperparameter optimization. In International Conference on Machine Learning, pages 1165–", + "type": "text", + "cross_page": true + } + ], + "index": 22 + }, + { + "bbox": [ + 127, + 413, + 209, + 425 + ], + "spans": [ + { + "bbox": [ + 127, + 413, + 209, + 425 + ], + "score": 1.0, + "content": "1173. PMLR, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 23, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 431, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 104, + 431, + 506, + 447 + ], + "score": 1.0, + "content": "[31] L. Franceschi, P. Frasconi, S. Salzo, R. Grazzi, and M. Pontil. Bilevel programming for", + "type": "text", + "cross_page": true + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 443, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 127, + 443, + 506, + 457 + ], + "score": 1.0, + "content": "hyperparameter optimization and meta-learning. In International Conference on Machine", + "type": "text", + "cross_page": true + } + ], + "index": 25 + }, + { + "bbox": [ + 127, + 454, + 302, + 468 + ], + "spans": [ + { + "bbox": [ + 127, + 454, + 302, + 468 + ], + "score": 1.0, + "content": "Learning, pages 1568–1577. PMLR, 2018.", + "type": "text", + "cross_page": true + } + ], + "index": 26, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "score": 1.0, + "content": "[32] T. Frerix, D. Kochkov, J. A. Smith, D. Cremers, M. P. Brenner, and S. Hoyer. Variational data", + "type": "text", + "cross_page": true + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 486, + 381, + 497 + ], + "spans": [ + { + "bbox": [ + 127, + 486, + 381, + 497 + ], + "score": 1.0, + "content": "assimilation with a learned inverse observation operator. 2021.", + "type": "text", + "cross_page": true + } + ], + "index": 28, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 504, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 506, + 520 + ], + "score": 1.0, + "content": "[33] R. Frostig, M. Johnson, D. Maclaurin, A. Paszke, and A. Radul. Decomposing reverse-mode", + "type": "text", + "cross_page": true + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 517, + 396, + 528 + ], + "spans": [ + { + "bbox": [ + 127, + 517, + 396, + 528 + ], + "score": 1.0, + "content": "automatic differentiation. In LAFI 2021 workshop at POPL, 2021.", + "type": "text", + "cross_page": true + } + ], + "index": 30, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 535, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 535, + 506, + 549 + ], + "score": 1.0, + "content": "[34] R. Frostig, M. J. Johnson, and C. Leary. Compiling machine learning programs via high-level", + "type": "text", + "cross_page": true + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 546, + 353, + 559 + ], + "spans": [ + { + "bbox": [ + 127, + 546, + 353, + 559 + ], + "score": 1.0, + "content": "tracing. Machine Learning and Systems (MLSys), 2018.", + "type": "text", + "cross_page": true + } + ], + "index": 32, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 564, + 506, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 506, + 581 + ], + "score": 1.0, + "content": "[35] S. Gould, B. Fernando, A. Cherian, P. Anderson, R. S. Cruz, and E. Guo. On differentiating", + "type": "text", + "cross_page": true + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 577, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 127, + 577, + 506, + 591 + ], + "score": 1.0, + "content": "parameterized argmin and argmax problems with application to bi-level optimization. arXiv", + "type": "text", + "cross_page": true + } + ], + "index": 34 + }, + { + "bbox": [ + 124, + 587, + 268, + 602 + ], + "spans": [ + { + "bbox": [ + 124, + 587, + 268, + 602 + ], + "score": 1.0, + "content": "preprint arXiv:1607.05447, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 35, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 608, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 506, + 622 + ], + "score": 1.0, + "content": "[36] S. Gould, R. Hartley, and D. Campbell. Deep declarative networks: A new hope. arXiv preprint", + "type": "text", + "cross_page": true + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 618, + 231, + 632 + ], + "spans": [ + { + "bbox": [ + 126, + 618, + 231, + 632 + ], + "score": 1.0, + "content": "arXiv:1909.04866, 2019.", + "type": "text", + "cross_page": true + } + ], + "index": 37, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 637, + 507, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 507, + 653 + ], + "score": 1.0, + "content": "[37] S. Grotzinger and C. Witzgall. Projections onto order simplexes. Applied mathematics and", + "type": "text", + "cross_page": true + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 649, + 275, + 663 + ], + "spans": [ + { + "bbox": [ + 127, + 649, + 275, + 663 + ], + "score": 1.0, + "content": "Optimization, 12(1):247–270, 1984.", + "type": "text", + "cross_page": true + } + ], + "index": 39, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 669, + 506, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 506, + 683 + ], + "score": 1.0, + "content": "[38] I. Guyon. Design of experiments of the nips 2003 variable selection benchmark. In NIPS 2003", + "type": "text", + "cross_page": true + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 680, + 421, + 694 + ], + "spans": [ + { + "bbox": [ + 126, + 680, + 421, + 694 + ], + "score": 1.0, + "content": "workshop on feature extraction and feature selection, volume 253, 2003.", + "type": "text", + "cross_page": true + } + ], + "index": 41, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 698, + 508, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 508, + 715 + ], + "score": 1.0, + "content": "[39] M. R. Hestenes, E. Stiefel, et al. Methods of conjugate gradients for solving linear systems,", + "type": "text", + "cross_page": true + } + ], + "index": 42, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 710, + 294, + 724 + ], + "spans": [ + { + "bbox": [ + 127, + 710, + 294, + 724 + ], + "score": 1.0, + "content": "volume 49. NBS Washington, DC, 1952.", + "type": "text", + "cross_page": true + } + ], + "index": 43, + "is_list_end_line": true + }, + { + "bbox": [ + 89, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 89, + 72, + 506, + 85 + ], + "score": 1.0, + "content": "407 [40] N. J. Higham. Accuracy and Stability of Numerical Algorithms. Society for Industrial and", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 83, + 307, + 97 + ], + "spans": [ + { + "bbox": [ + 127, + 83, + 307, + 97 + ], + "score": 1.0, + "content": "Applied Mathematics, second edition, 2002.", + "type": "text", + "cross_page": true + } + ], + "index": 1, + "is_list_end_line": true + }, + { + "bbox": [ + 86, + 101, + 507, + 117 + ], + "spans": [ + { + "bbox": [ + 86, + 101, + 507, + 117 + ], + "score": 1.0, + "content": "409 [41] S. Hoyer, J. Sohl-Dickstein, and S. Greydanus. Neural reparameterization improves structural", + "type": "text", + "cross_page": true + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 113, + 210, + 126 + ], + "spans": [ + { + "bbox": [ + 127, + 113, + 210, + 126 + ], + "score": 1.0, + "content": "optimization. 2019.", + "type": "text", + "cross_page": true + } + ], + "index": 3, + "is_list_end_line": true + }, + { + "bbox": [ + 103, + 130, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 103, + 130, + 506, + 146 + ], + "score": 1.0, + "content": "[42] Y. Kim, C. Denton, L. Hoang, and A. M. Rush. Structured attention networks. arXiv preprint", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 127, + 142, + 232, + 156 + ], + "spans": [ + { + "bbox": [ + 127, + 142, + 232, + 156 + ], + "score": 1.0, + "content": "arXiv:1702.00887, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 5, + "is_list_end_line": true + }, + { + "bbox": [ + 88, + 161, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 88, + 161, + 505, + 175 + ], + "score": 1.0, + "content": "413 [43] D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. arXiv preprint", + "type": "text", + "cross_page": true + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 171, + 227, + 185 + ], + "spans": [ + { + "bbox": [ + 126, + 171, + 227, + 185 + ], + "score": 1.0, + "content": "arXiv:1412.6980, 2014.", + "type": "text", + "cross_page": true + } + ], + "index": 7, + "is_list_end_line": true + }, + { + "bbox": [ + 86, + 189, + 507, + 206 + ], + "spans": [ + { + "bbox": [ + 86, + 189, + 507, + 206 + ], + "score": 1.0, + "content": "415 [44] S. G. Krantz and H. R. Parks. The implicit function theorem: history, theory, and applications.", + "type": "text", + "cross_page": true + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 201, + 303, + 215 + ], + "spans": [ + { + "bbox": [ + 126, + 201, + 303, + 215 + ], + "score": 1.0, + "content": "Springer Science & Business Media, 2012.", + "type": "text", + "cross_page": true + } + ], + "index": 9, + "is_list_end_line": true + }, + { + "bbox": [ + 88, + 220, + 506, + 234 + ], + "spans": [ + { + "bbox": [ + 88, + 220, + 506, + 234 + ], + "score": 1.0, + "content": "417 [45] C. H. Lim and S. J. Wright. Efficient bregman projections onto the permutahedron and related", + "type": "text", + "cross_page": true + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 125, + 231, + 392, + 245 + ], + "spans": [ + { + "bbox": [ + 125, + 231, + 392, + 245 + ], + "score": 1.0, + "content": "polytopes. In Proc. of AISTATS, pages 1205–1213. PMLR, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 87, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 87, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "419 [46] J. Lorraine, P. Vicol, and D. Duvenaud. Optimizing millions of hyperparameters by implicit", + "type": "text", + "cross_page": true + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 259, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 127, + 259, + 506, + 276 + ], + "score": 1.0, + "content": "differentiation. In International Conference on Artificial Intelligence and Statistics, pages", + "type": "text", + "cross_page": true + } + ], + "index": 13 + }, + { + "bbox": [ + 126, + 271, + 235, + 285 + ], + "spans": [ + { + "bbox": [ + 126, + 271, + 235, + 285 + ], + "score": 1.0, + "content": "1540–1552. PMLR, 2020.", + "type": "text", + "cross_page": true + } + ], + "index": 14, + "is_list_end_line": true + }, + { + "bbox": [ + 88, + 290, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 88, + 290, + 505, + 304 + ], + "score": 1.0, + "content": "422 [47] J. Mairal, F. Bach, and J. Ponce. Task-driven dictionary learning. IEEE Transactions on Pattern", + "type": "text", + "cross_page": true + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 302, + 360, + 314 + ], + "spans": [ + { + "bbox": [ + 127, + 302, + 360, + 314 + ], + "score": 1.0, + "content": "Analysis and Machine Intelligence, 34(4):791–804, 2012.", + "type": "text", + "cross_page": true + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 88, + 320, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 88, + 320, + 506, + 334 + ], + "score": 1.0, + "content": "424 [48] A. F. Martins and R. F. Astudillo. From softmax to sparsemax: A sparse model of attention and", + "type": "text", + "cross_page": true + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 331, + 330, + 343 + ], + "spans": [ + { + "bbox": [ + 127, + 331, + 330, + 343 + ], + "score": 1.0, + "content": "multi-label classification. In Proc. of ICML, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 18, + "is_list_end_line": true + }, + { + "bbox": [ + 88, + 349, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 88, + 349, + 505, + 363 + ], + "score": 1.0, + "content": "426 [49] C. Michelot. A finite algorithm for finding the projection of a point onto the canonical simplex", + "type": "text", + "cross_page": true + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 360, + 449, + 374 + ], + "spans": [ + { + "bbox": [ + 126, + 360, + 139, + 374 + ], + "score": 1.0, + "content": "of", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 140, + 362, + 152, + 370 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { n }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 153, + 360, + 449, + 374 + ], + "score": 1.0, + "content": ". Journal of Optimization Theory and Applications, 50(1):195–200, 1986.", + "type": "text", + "cross_page": true + } + ], + "index": 20, + "is_list_end_line": true + }, + { + "bbox": [ + 87, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 87, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "428 [50] J.-J. Moreau. Proximité et dualité dans un espace hilbertien. Bulletin de la S.M.F., 93:273–299,", + "type": "text", + "cross_page": true + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 125, + 389, + 154, + 403 + ], + "spans": [ + { + "bbox": [ + 125, + 389, + 154, + 403 + ], + "score": 1.0, + "content": "1965.", + "type": "text", + "cross_page": true + } + ], + "index": 22, + "is_list_end_line": true + }, + { + "bbox": [ + 86, + 407, + 507, + 423 + ], + "spans": [ + { + "bbox": [ + 86, + 407, + 507, + 423 + ], + "score": 1.0, + "content": "430 [51] V. Niculae and M. Blondel. A regularized framework for sparse and structured neural attention.", + "type": "text", + "cross_page": true + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 420, + 239, + 432 + ], + "spans": [ + { + "bbox": [ + 127, + 420, + 239, + 432 + ], + "score": 1.0, + "content": "In Proc. of NeurIPS, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 24, + "is_list_end_line": true + }, + { + "bbox": [ + 87, + 438, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 87, + 438, + 506, + 452 + ], + "score": 1.0, + "content": "432 [52] V. Niculae and A. Martins. Lp-sparsemap: Differentiable relaxed optimization for sparse", + "type": "text", + "cross_page": true + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 450, + 506, + 464 + ], + "spans": [ + { + "bbox": [ + 127, + 450, + 506, + 464 + ], + "score": 1.0, + "content": "structured prediction. In International Conference on Machine Learning, pages 7348–7359,", + "type": "text", + "cross_page": true + } + ], + "index": 26 + }, + { + "bbox": [ + 126, + 459, + 155, + 474 + ], + "spans": [ + { + "bbox": [ + 126, + 459, + 155, + 474 + ], + "score": 1.0, + "content": "2020.", + "type": "text", + "cross_page": true + } + ], + "index": 27, + "is_list_end_line": true + }, + { + "bbox": [ + 87, + 478, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 87, + 478, + 506, + 492 + ], + "score": 1.0, + "content": "435 [53] V. Niculae, A. Martins, M. Blondel, and C. Cardie. Sparsemap: Differentiable sparse structured", + "type": "text", + "cross_page": true + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 489, + 507, + 504 + ], + "spans": [ + { + "bbox": [ + 127, + 489, + 507, + 504 + ], + "score": 1.0, + "content": "inference. In International Conference on Machine Learning, pages 3799–3808. PMLR, 2018.", + "type": "text", + "cross_page": true + } + ], + "index": 29 + }, + { + "bbox": [ + 88, + 506, + 506, + 523 + ], + "spans": [ + { + "bbox": [ + 88, + 506, + 506, + 523 + ], + "score": 1.0, + "content": "437 [54] B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd. Conic optimization via operator splitting", + "type": "text", + "cross_page": true + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 519, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 127, + 519, + 506, + 533 + ], + "score": 1.0, + "content": "and homogeneous self-dual embedding. Journal of Optimization Theory and Applications,", + "type": "text", + "cross_page": true + } + ], + "index": 31 + }, + { + "bbox": [ + 127, + 531, + 231, + 542 + ], + "spans": [ + { + "bbox": [ + 127, + 531, + 231, + 542 + ], + "score": 1.0, + "content": "169(3):1042–1068, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 32, + "is_list_end_line": true + }, + { + "bbox": [ + 87, + 547, + 507, + 564 + ], + "spans": [ + { + "bbox": [ + 87, + 547, + 507, + 564 + ], + "score": 1.0, + "content": "440 [55] N. Parikh and S. Boyd. Proximal algorithms. Foundations and Trends in optimization, 1(3):127–", + "type": "text", + "cross_page": true + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 559, + 175, + 573 + ], + "spans": [ + { + "bbox": [ + 127, + 559, + 175, + 573 + ], + "score": 1.0, + "content": "239, 2014.", + "type": "text", + "cross_page": true + } + ], + "index": 34, + "is_list_end_line": true + }, + { + "bbox": [ + 89, + 578, + 507, + 591 + ], + "spans": [ + { + "bbox": [ + 89, + 578, + 507, + 591 + ], + "score": 1.0, + "content": "442 [56] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin,", + "type": "text", + "cross_page": true + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 588, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 126, + 588, + 506, + 604 + ], + "score": 1.0, + "content": "N. Gimelshein, L. Antiga, et al. Pytorch: An imperative style, high-performance deep learning", + "type": "text", + "cross_page": true + } + ], + "index": 36 + }, + { + "bbox": [ + 126, + 599, + 322, + 613 + ], + "spans": [ + { + "bbox": [ + 126, + 599, + 322, + 613 + ], + "score": 1.0, + "content": "library. arXiv preprint arXiv:1912.01703, 2019.", + "type": "text", + "cross_page": true + } + ], + "index": 37, + "is_list_end_line": true + }, + { + "bbox": [ + 89, + 617, + 507, + 633 + ], + "spans": [ + { + "bbox": [ + 89, + 617, + 507, + 633 + ], + "score": 1.0, + "content": "445 [57] F. Pedregosa. Hyperparameter optimization with approximate gradient. In International", + "type": "text", + "cross_page": true + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 127, + 629, + 318, + 643 + ], + "spans": [ + { + "bbox": [ + 127, + 629, + 318, + 643 + ], + "score": 1.0, + "content": "conference on machine learning. PMLR, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 39, + "is_list_end_line": true + }, + { + "bbox": [ + 89, + 647, + 507, + 662 + ], + "spans": [ + { + "bbox": [ + 89, + 647, + 507, + 662 + ], + "score": 1.0, + "content": "447 [58] F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel,", + "type": "text", + "cross_page": true + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 659, + 507, + 673 + ], + "spans": [ + { + "bbox": [ + 126, + 659, + 507, + 673 + ], + "score": 1.0, + "content": "P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher,", + "type": "text", + "cross_page": true + } + ], + "index": 41 + }, + { + "bbox": [ + 127, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 127, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "M. Perrot, and E. Duchesnay. Scikit-learn: Machine learning in Python. Journal of Machine", + "type": "text", + "cross_page": true + } + ], + "index": 42 + }, + { + "bbox": [ + 127, + 682, + 296, + 694 + ], + "spans": [ + { + "bbox": [ + 127, + 682, + 296, + 694 + ], + "score": 1.0, + "content": "Learning Research, 12:2825–2830, 2011.", + "type": "text", + "cross_page": true + } + ], + "index": 43, + "is_list_end_line": true + }, + { + "bbox": [ + 103, + 699, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 103, + 699, + 505, + 713 + ], + "score": 1.0, + "content": "[59] A. Rajeswaran, C. Finn, S. Kakade, and S. Levine. Meta-learning with implicit gradients. arXiv", + "type": "text", + "cross_page": true + } + ], + "index": 44 + }, + { + "bbox": [ + 124, + 710, + 266, + 725 + ], + "spans": [ + { + "bbox": [ + 124, + 710, + 266, + 725 + ], + "score": 1.0, + "content": "preprint arXiv:1909.04630, 2019.", + "type": "text", + "cross_page": true + } + ], + "index": 45, + "is_list_end_line": true + } + ], + "index": 21.5, + "bbox_fs": [ + 104, + 88, + 507, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 102, + 58, + 507, + 730 + ], + "lines": [ + { + "bbox": [ + 104, + 70, + 506, + 88 + ], + "spans": [ + { + "bbox": [ + 104, + 70, + 506, + 88 + ], + "score": 1.0, + "content": "[20] X. Chen, Y. Zhang, C. Reisinger, and L. Song. Understanding deep architecture with reasoning", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 127, + 84, + 407, + 97 + ], + "spans": [ + { + "bbox": [ + 127, + 84, + 407, + 97 + ], + "score": 1.0, + "content": "layer. Advances in Neural Information Processing Systems, 33, 2020.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 102, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 506, + 117 + ], + "score": 1.0, + "content": "[21] H. Cherkaoui, J. Sulam, and T. Moreau. Learning to solve tv regularised problems with unrolled", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 126, + 113, + 431, + 129 + ], + "spans": [ + { + "bbox": [ + 126, + 113, + 431, + 129 + ], + "score": 1.0, + "content": "algorithms. Advances in Neural Information Processing Systems, 33, 2020.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 349, + 149 + ], + "score": 1.0, + "content": "[22] L. Condat. Fast projection onto the simplex and the", + "type": "text" + }, + { + "bbox": [ + 349, + 135, + 359, + 145 + ], + "score": 0.87, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 132, + 506, + 149 + ], + "score": 1.0, + "content": "ball. Mathematical Programming,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 128, + 146, + 230, + 158 + ], + "spans": [ + { + "bbox": [ + 128, + 146, + 230, + 158 + ], + "score": 1.0, + "content": "158(1-2):575–585, 2016.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "[23] K. Crammer and Y. Singer. On the algorithmic implementation of multiclass kernel-based", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 127, + 176, + 448, + 188 + ], + "spans": [ + { + "bbox": [ + 127, + 176, + 448, + 188 + ], + "score": 1.0, + "content": "vector machines. Journal of machine learning research, 2(Dec):265–292, 2001.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 194, + 507, + 210 + ], + "spans": [ + { + "bbox": [ + 104, + 194, + 507, + 210 + ], + "score": 1.0, + "content": "[24] M. Cuturi. Sinkhorn distances: lightspeed computation of optimal transport. In Advances in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 127, + 206, + 358, + 220 + ], + "spans": [ + { + "bbox": [ + 127, + 206, + 358, + 220 + ], + "score": 1.0, + "content": "Neural Information Processing Systems, volume 2, 2013.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 227, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 107, + 227, + 505, + 239 + ], + "score": 1.0, + "content": "[25] C.-A. Deledalle, S. Vaiter, J. Fadili, and G. Peyré. Stein unbiased gradient estimator of the risk", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 127, + 237, + 506, + 251 + ], + "spans": [ + { + "bbox": [ + 127, + 237, + 506, + 251 + ], + "score": 1.0, + "content": "(sugar) for multiple parameter selection. SIAM Journal on Imaging Sciences, 7(4):2448–2487,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 126, + 248, + 155, + 262 + ], + "spans": [ + { + "bbox": [ + 126, + 248, + 155, + 262 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 267, + 507, + 282 + ], + "spans": [ + { + "bbox": [ + 104, + 267, + 507, + 282 + ], + "score": 1.0, + "content": "[26] S. Diamond and S. Boyd. Cvxpy: A python-embedded modeling language for convex optimiza-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 127, + 279, + 428, + 293 + ], + "spans": [ + { + "bbox": [ + 127, + 279, + 428, + 293 + ], + "score": 1.0, + "content": "tion. The Journal of Machine Learning Research, 17(1):2909–2913, 2016.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 298, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 506, + 312 + ], + "score": 1.0, + "content": "[27] J. Djolonga and A. Krause. Differentiable learning of submodular models. Proc. of NeurIPS,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 127, + 309, + 217, + 323 + ], + "spans": [ + { + "bbox": [ + 127, + 309, + 217, + 323 + ], + "score": 1.0, + "content": "30:1013–1023, 2017.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 329, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 506, + 343 + ], + "score": 1.0, + "content": "[28] J. Domke. Generic methods for optimization-based modeling. In Artificial Intelligence and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 127, + 340, + 292, + 354 + ], + "spans": [ + { + "bbox": [ + 127, + 340, + 292, + 354 + ], + "score": 1.0, + "content": "Statistics, pages 318–326. PMLR, 2012.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 359, + 506, + 374 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 475, + 374 + ], + "score": 1.0, + "content": "[29] J. C. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra. Efficient projections onto the", + "type": "text" + }, + { + "bbox": [ + 476, + 361, + 486, + 371 + ], + "score": 0.87, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 359, + 506, + 374 + ], + "score": 1.0, + "content": "-ball", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 128, + 371, + 358, + 383 + ], + "spans": [ + { + "bbox": [ + 128, + 371, + 358, + 383 + ], + "score": 1.0, + "content": "for learning in high dimensions. In Proc. of ICML, 2008.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 404 + ], + "score": 1.0, + "content": "[30] L. Franceschi, M. Donini, P. Frasconi, and M. Pontil. Forward and reverse gradient-based", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 127, + 402, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 127, + 402, + 506, + 416 + ], + "score": 1.0, + "content": "hyperparameter optimization. In International Conference on Machine Learning, pages 1165–", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 127, + 413, + 209, + 425 + ], + "spans": [ + { + "bbox": [ + 127, + 413, + 209, + 425 + ], + "score": 1.0, + "content": "1173. PMLR, 2017.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 431, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 104, + 431, + 506, + 447 + ], + "score": 1.0, + "content": "[31] L. Franceschi, P. Frasconi, S. Salzo, R. Grazzi, and M. Pontil. Bilevel programming for", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 127, + 443, + 506, + 457 + ], + "spans": [ + { + "bbox": [ + 127, + 443, + 506, + 457 + ], + "score": 1.0, + "content": "hyperparameter optimization and meta-learning. In International Conference on Machine", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 127, + 454, + 302, + 468 + ], + "spans": [ + { + "bbox": [ + 127, + 454, + 302, + 468 + ], + "score": 1.0, + "content": "Learning, pages 1568–1577. PMLR, 2018.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "score": 1.0, + "content": "[32] T. Frerix, D. Kochkov, J. A. Smith, D. Cremers, M. P. Brenner, and S. Hoyer. Variational data", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 127, + 486, + 381, + 497 + ], + "spans": [ + { + "bbox": [ + 127, + 486, + 381, + 497 + ], + "score": 1.0, + "content": "assimilation with a learned inverse observation operator. 2021.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 504, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 506, + 520 + ], + "score": 1.0, + "content": "[33] R. Frostig, M. Johnson, D. Maclaurin, A. Paszke, and A. Radul. Decomposing reverse-mode", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 127, + 517, + 396, + 528 + ], + "spans": [ + { + "bbox": [ + 127, + 517, + 396, + 528 + ], + "score": 1.0, + "content": "automatic differentiation. In LAFI 2021 workshop at POPL, 2021.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 535, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 535, + 506, + 549 + ], + "score": 1.0, + "content": "[34] R. Frostig, M. J. Johnson, and C. Leary. Compiling machine learning programs via high-level", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 127, + 546, + 353, + 559 + ], + "spans": [ + { + "bbox": [ + 127, + 546, + 353, + 559 + ], + "score": 1.0, + "content": "tracing. Machine Learning and Systems (MLSys), 2018.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 564, + 506, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 506, + 581 + ], + "score": 1.0, + "content": "[35] S. Gould, B. Fernando, A. Cherian, P. Anderson, R. S. Cruz, and E. Guo. On differentiating", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 127, + 577, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 127, + 577, + 506, + 591 + ], + "score": 1.0, + "content": "parameterized argmin and argmax problems with application to bi-level optimization. arXiv", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 124, + 587, + 268, + 602 + ], + "spans": [ + { + "bbox": [ + 124, + 587, + 268, + 602 + ], + "score": 1.0, + "content": "preprint arXiv:1607.05447, 2016.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 608, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 506, + 622 + ], + "score": 1.0, + "content": "[36] S. Gould, R. Hartley, and D. Campbell. Deep declarative networks: A new hope. arXiv preprint", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 126, + 618, + 231, + 632 + ], + "spans": [ + { + "bbox": [ + 126, + 618, + 231, + 632 + ], + "score": 1.0, + "content": "arXiv:1909.04866, 2019.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 637, + 507, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 507, + 653 + ], + "score": 1.0, + "content": "[37] S. Grotzinger and C. Witzgall. Projections onto order simplexes. Applied mathematics and", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 127, + 649, + 275, + 663 + ], + "spans": [ + { + "bbox": [ + 127, + 649, + 275, + 663 + ], + "score": 1.0, + "content": "Optimization, 12(1):247–270, 1984.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 669, + 506, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 506, + 683 + ], + "score": 1.0, + "content": "[38] I. Guyon. Design of experiments of the nips 2003 variable selection benchmark. In NIPS 2003", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 126, + 680, + 421, + 694 + ], + "spans": [ + { + "bbox": [ + 126, + 680, + 421, + 694 + ], + "score": 1.0, + "content": "workshop on feature extraction and feature selection, volume 253, 2003.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 698, + 508, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 508, + 715 + ], + "score": 1.0, + "content": "[39] M. R. Hestenes, E. Stiefel, et al. Methods of conjugate gradients for solving linear systems,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 127, + 710, + 294, + 724 + ], + "spans": [ + { + "bbox": [ + 127, + 710, + 294, + 724 + ], + "score": 1.0, + "content": "volume 49. NBS Washington, DC, 1952.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 21.5 + } + ], + "page_idx": 10, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 311, + 751 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 312, + 754 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 312, + 754 + ], + "score": 1.0, + "content": "11", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 85, + 75, + 103, + 732 + ], + "lines": [ + { + "bbox": [ + 84, + 74, + 101, + 86 + ], + "spans": [ + { + "bbox": [ + 84, + 74, + 101, + 86 + ], + "score": 1.0, + "content": "363", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 84, + 102, + 99 + ], + "spans": [ + { + "bbox": [ + 83, + 84, + 102, + 99 + ], + "score": 1.0, + "content": "364", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 104, + 102, + 118 + ], + "spans": [ + { + "bbox": [ + 83, + 104, + 102, + 118 + ], + "score": 1.0, + "content": "365", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 115, + 102, + 130 + ], + "spans": [ + { + "bbox": [ + 83, + 115, + 102, + 130 + ], + "score": 1.0, + "content": "366", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 134, + 102, + 148 + ], + "spans": [ + { + "bbox": [ + 83, + 134, + 102, + 148 + ], + "score": 1.0, + "content": "367", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 146, + 102, + 160 + ], + "spans": [ + { + "bbox": [ + 83, + 146, + 102, + 160 + ], + "score": 1.0, + "content": "368", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 167, + 101, + 178 + ], + "spans": [ + { + "bbox": [ + 84, + 167, + 101, + 178 + ], + "score": 1.0, + "content": "369", + "type": "text" + } + ] + }, + { + "bbox": [ + 82, + 176, + 102, + 194 + ], + "spans": [ + { + "bbox": [ + 82, + 176, + 102, + 194 + ], + "score": 1.0, + "content": "370", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 195, + 102, + 210 + ], + "spans": [ + { + "bbox": [ + 83, + 195, + 102, + 210 + ], + "score": 1.0, + "content": "371", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 206, + 102, + 226 + ], + "spans": [ + { + "bbox": [ + 83, + 206, + 102, + 226 + ], + "score": 1.0, + "content": "372", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 226, + 102, + 240 + ], + "spans": [ + { + "bbox": [ + 83, + 226, + 102, + 240 + ], + "score": 1.0, + "content": "373", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 239, + 101, + 250 + ], + "spans": [ + { + "bbox": [ + 84, + 239, + 101, + 250 + ], + "score": 1.0, + "content": "374", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 249, + 102, + 264 + ], + "spans": [ + { + "bbox": [ + 84, + 249, + 102, + 264 + ], + "score": 1.0, + "content": "375", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 268, + 102, + 282 + ], + "spans": [ + { + "bbox": [ + 83, + 268, + 102, + 282 + ], + "score": 1.0, + "content": "376", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 279, + 102, + 298 + ], + "spans": [ + { + "bbox": [ + 83, + 279, + 102, + 298 + ], + "score": 1.0, + "content": "377", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 299, + 102, + 313 + ], + "spans": [ + { + "bbox": [ + 84, + 299, + 102, + 313 + ], + "score": 1.0, + "content": "378", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 310, + 102, + 326 + ], + "spans": [ + { + "bbox": [ + 84, + 310, + 102, + 326 + ], + "score": 1.0, + "content": "379", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 330, + 102, + 343 + ], + "spans": [ + { + "bbox": [ + 83, + 330, + 102, + 343 + ], + "score": 1.0, + "content": "380", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 342, + 101, + 356 + ], + "spans": [ + { + "bbox": [ + 85, + 342, + 101, + 356 + ], + "score": 1.0, + "content": "381", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 360, + 102, + 374 + ], + "spans": [ + { + "bbox": [ + 83, + 360, + 102, + 374 + ], + "score": 1.0, + "content": "382", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 371, + 102, + 390 + ], + "spans": [ + { + "bbox": [ + 83, + 371, + 102, + 390 + ], + "score": 1.0, + "content": "383", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 392, + 101, + 404 + ], + "spans": [ + { + "bbox": [ + 85, + 392, + 101, + 404 + ], + "score": 1.0, + "content": "384", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 402, + 102, + 416 + ], + "spans": [ + { + "bbox": [ + 83, + 402, + 102, + 416 + ], + "score": 1.0, + "content": "385", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 414, + 102, + 430 + ], + "spans": [ + { + "bbox": [ + 84, + 414, + 102, + 430 + ], + "score": 1.0, + "content": "386", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 433, + 102, + 447 + ], + "spans": [ + { + "bbox": [ + 83, + 433, + 102, + 447 + ], + "score": 1.0, + "content": "387", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 443, + 102, + 457 + ], + "spans": [ + { + "bbox": [ + 84, + 443, + 102, + 457 + ], + "score": 1.0, + "content": "388", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 455, + 102, + 470 + ], + "spans": [ + { + "bbox": [ + 84, + 455, + 102, + 470 + ], + "score": 1.0, + "content": "389", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 475, + 100, + 487 + ], + "spans": [ + { + "bbox": [ + 84, + 475, + 100, + 487 + ], + "score": 1.0, + "content": "390", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 486, + 101, + 502 + ], + "spans": [ + { + "bbox": [ + 84, + 486, + 101, + 502 + ], + "score": 1.0, + "content": "391", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 505, + 102, + 519 + ], + "spans": [ + { + "bbox": [ + 83, + 505, + 102, + 519 + ], + "score": 1.0, + "content": "392", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 516, + 102, + 531 + ], + "spans": [ + { + "bbox": [ + 83, + 516, + 102, + 531 + ], + "score": 1.0, + "content": "393", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 536, + 102, + 549 + ], + "spans": [ + { + "bbox": [ + 83, + 536, + 102, + 549 + ], + "score": 1.0, + "content": "394", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 547, + 102, + 563 + ], + "spans": [ + { + "bbox": [ + 84, + 547, + 102, + 563 + ], + "score": 1.0, + "content": "395", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 566, + 102, + 581 + ], + "spans": [ + { + "bbox": [ + 83, + 566, + 102, + 581 + ], + "score": 1.0, + "content": "396", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 578, + 102, + 591 + ], + "spans": [ + { + "bbox": [ + 83, + 578, + 102, + 591 + ], + "score": 1.0, + "content": "397", + "type": "text" + } + ] + }, + { + "bbox": [ + 82, + 588, + 102, + 606 + ], + "spans": [ + { + "bbox": [ + 82, + 588, + 102, + 606 + ], + "score": 1.0, + "content": "398", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 609, + 101, + 621 + ], + "spans": [ + { + "bbox": [ + 85, + 609, + 101, + 621 + ], + "score": 1.0, + "content": "399", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 619, + 102, + 635 + ], + "spans": [ + { + "bbox": [ + 84, + 619, + 102, + 635 + ], + "score": 1.0, + "content": "400", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 639, + 101, + 653 + ], + "spans": [ + { + "bbox": [ + 85, + 639, + 101, + 653 + ], + "score": 1.0, + "content": "401", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 649, + 102, + 668 + ], + "spans": [ + { + "bbox": [ + 83, + 649, + 102, + 668 + ], + "score": 1.0, + "content": "402", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 671, + 101, + 682 + ], + "spans": [ + { + "bbox": [ + 84, + 671, + 101, + 682 + ], + "score": 1.0, + "content": "403", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 681, + 102, + 696 + ], + "spans": [ + { + "bbox": [ + 83, + 681, + 102, + 696 + ], + "score": 1.0, + "content": "404", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 700, + 102, + 714 + ], + "spans": [ + { + "bbox": [ + 83, + 700, + 102, + 714 + ], + "score": 1.0, + "content": "405", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 712, + 102, + 726 + ], + "spans": [ + { + "bbox": [ + 83, + 712, + 102, + 726 + ], + "score": 1.0, + "content": "406", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 102, + 58, + 507, + 730 + ], + "lines": [], + "index": 21.5, + "bbox_fs": [ + 104, + 70, + 508, + 724 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 92, + 59, + 508, + 729 + ], + "lines": [ + { + "bbox": [ + 89, + 72, + 506, + 85 + ], + "spans": [ + { + "bbox": [ + 89, + 72, + 506, + 85 + ], + "score": 1.0, + "content": "407 [40] N. J. Higham. Accuracy and Stability of Numerical Algorithms. Society for Industrial and", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 127, + 83, + 307, + 97 + ], + "spans": [ + { + "bbox": [ + 127, + 83, + 307, + 97 + ], + "score": 1.0, + "content": "Applied Mathematics, second edition, 2002.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 86, + 101, + 507, + 117 + ], + "spans": [ + { + "bbox": [ + 86, + 101, + 507, + 117 + ], + "score": 1.0, + "content": "409 [41] S. Hoyer, J. Sohl-Dickstein, and S. Greydanus. Neural reparameterization improves structural", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 127, + 113, + 210, + 126 + ], + "spans": [ + { + "bbox": [ + 127, + 113, + 210, + 126 + ], + "score": 1.0, + "content": "optimization. 2019.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 103, + 130, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 103, + 130, + 506, + 146 + ], + "score": 1.0, + "content": "[42] Y. Kim, C. Denton, L. Hoang, and A. M. Rush. Structured attention networks. arXiv preprint", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 127, + 142, + 232, + 156 + ], + "spans": [ + { + "bbox": [ + 127, + 142, + 232, + 156 + ], + "score": 1.0, + "content": "arXiv:1702.00887, 2017.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 88, + 161, + 505, + 175 + ], + "spans": [ + { + "bbox": [ + 88, + 161, + 505, + 175 + ], + "score": 1.0, + "content": "413 [43] D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. arXiv preprint", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 126, + 171, + 227, + 185 + ], + "spans": [ + { + "bbox": [ + 126, + 171, + 227, + 185 + ], + "score": 1.0, + "content": "arXiv:1412.6980, 2014.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 86, + 189, + 507, + 206 + ], + "spans": [ + { + "bbox": [ + 86, + 189, + 507, + 206 + ], + "score": 1.0, + "content": "415 [44] S. G. Krantz and H. R. Parks. The implicit function theorem: history, theory, and applications.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 126, + 201, + 303, + 215 + ], + "spans": [ + { + "bbox": [ + 126, + 201, + 303, + 215 + ], + "score": 1.0, + "content": "Springer Science & Business Media, 2012.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 88, + 220, + 506, + 234 + ], + "spans": [ + { + "bbox": [ + 88, + 220, + 506, + 234 + ], + "score": 1.0, + "content": "417 [45] C. H. Lim and S. J. Wright. Efficient bregman projections onto the permutahedron and related", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 125, + 231, + 392, + 245 + ], + "spans": [ + { + "bbox": [ + 125, + 231, + 392, + 245 + ], + "score": 1.0, + "content": "polytopes. In Proc. of AISTATS, pages 1205–1213. PMLR, 2016.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 87, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 87, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "419 [46] J. Lorraine, P. Vicol, and D. Duvenaud. Optimizing millions of hyperparameters by implicit", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 127, + 259, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 127, + 259, + 506, + 276 + ], + "score": 1.0, + "content": "differentiation. In International Conference on Artificial Intelligence and Statistics, pages", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 126, + 271, + 235, + 285 + ], + "spans": [ + { + "bbox": [ + 126, + 271, + 235, + 285 + ], + "score": 1.0, + "content": "1540–1552. PMLR, 2020.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 88, + 290, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 88, + 290, + 505, + 304 + ], + "score": 1.0, + "content": "422 [47] J. Mairal, F. Bach, and J. Ponce. Task-driven dictionary learning. IEEE Transactions on Pattern", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 127, + 302, + 360, + 314 + ], + "spans": [ + { + "bbox": [ + 127, + 302, + 360, + 314 + ], + "score": 1.0, + "content": "Analysis and Machine Intelligence, 34(4):791–804, 2012.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 88, + 320, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 88, + 320, + 506, + 334 + ], + "score": 1.0, + "content": "424 [48] A. F. Martins and R. F. Astudillo. From softmax to sparsemax: A sparse model of attention and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 127, + 331, + 330, + 343 + ], + "spans": [ + { + "bbox": [ + 127, + 331, + 330, + 343 + ], + "score": 1.0, + "content": "multi-label classification. In Proc. of ICML, 2016.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 88, + 349, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 88, + 349, + 505, + 363 + ], + "score": 1.0, + "content": "426 [49] C. Michelot. A finite algorithm for finding the projection of a point onto the canonical simplex", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 126, + 360, + 449, + 374 + ], + "spans": [ + { + "bbox": [ + 126, + 360, + 139, + 374 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 140, + 362, + 152, + 370 + ], + "score": 0.86, + "content": "\\mathbb { R } ^ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 360, + 449, + 374 + ], + "score": 1.0, + "content": ". Journal of Optimization Theory and Applications, 50(1):195–200, 1986.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 87, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 87, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "428 [50] J.-J. Moreau. Proximité et dualité dans un espace hilbertien. Bulletin de la S.M.F., 93:273–299,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 125, + 389, + 154, + 403 + ], + "spans": [ + { + "bbox": [ + 125, + 389, + 154, + 403 + ], + "score": 1.0, + "content": "1965.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 86, + 407, + 507, + 423 + ], + "spans": [ + { + "bbox": [ + 86, + 407, + 507, + 423 + ], + "score": 1.0, + "content": "430 [51] V. Niculae and M. Blondel. A regularized framework for sparse and structured neural attention.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 127, + 420, + 239, + 432 + ], + "spans": [ + { + "bbox": [ + 127, + 420, + 239, + 432 + ], + "score": 1.0, + "content": "In Proc. of NeurIPS, 2017.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 87, + 438, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 87, + 438, + 506, + 452 + ], + "score": 1.0, + "content": "432 [52] V. Niculae and A. Martins. Lp-sparsemap: Differentiable relaxed optimization for sparse", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 127, + 450, + 506, + 464 + ], + "spans": [ + { + "bbox": [ + 127, + 450, + 506, + 464 + ], + "score": 1.0, + "content": "structured prediction. In International Conference on Machine Learning, pages 7348–7359,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 126, + 459, + 155, + 474 + ], + "spans": [ + { + "bbox": [ + 126, + 459, + 155, + 474 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 87, + 478, + 506, + 492 + ], + "spans": [ + { + "bbox": [ + 87, + 478, + 506, + 492 + ], + "score": 1.0, + "content": "435 [53] V. Niculae, A. Martins, M. Blondel, and C. Cardie. Sparsemap: Differentiable sparse structured", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 127, + 489, + 507, + 504 + ], + "spans": [ + { + "bbox": [ + 127, + 489, + 507, + 504 + ], + "score": 1.0, + "content": "inference. In International Conference on Machine Learning, pages 3799–3808. PMLR, 2018.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 88, + 506, + 506, + 523 + ], + "spans": [ + { + "bbox": [ + 88, + 506, + 506, + 523 + ], + "score": 1.0, + "content": "437 [54] B. O’Donoghue, E. Chu, N. Parikh, and S. Boyd. Conic optimization via operator splitting", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 127, + 519, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 127, + 519, + 506, + 533 + ], + "score": 1.0, + "content": "and homogeneous self-dual embedding. Journal of Optimization Theory and Applications,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 127, + 531, + 231, + 542 + ], + "spans": [ + { + "bbox": [ + 127, + 531, + 231, + 542 + ], + "score": 1.0, + "content": "169(3):1042–1068, 2016.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 87, + 547, + 507, + 564 + ], + "spans": [ + { + "bbox": [ + 87, + 547, + 507, + 564 + ], + "score": 1.0, + "content": "440 [55] N. Parikh and S. Boyd. Proximal algorithms. Foundations and Trends in optimization, 1(3):127–", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 127, + 559, + 175, + 573 + ], + "spans": [ + { + "bbox": [ + 127, + 559, + 175, + 573 + ], + "score": 1.0, + "content": "239, 2014.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 89, + 578, + 507, + 591 + ], + "spans": [ + { + "bbox": [ + 89, + 578, + 507, + 591 + ], + "score": 1.0, + "content": "442 [56] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 126, + 588, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 126, + 588, + 506, + 604 + ], + "score": 1.0, + "content": "N. Gimelshein, L. Antiga, et al. Pytorch: An imperative style, high-performance deep learning", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 126, + 599, + 322, + 613 + ], + "spans": [ + { + "bbox": [ + 126, + 599, + 322, + 613 + ], + "score": 1.0, + "content": "library. arXiv preprint arXiv:1912.01703, 2019.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 89, + 617, + 507, + 633 + ], + "spans": [ + { + "bbox": [ + 89, + 617, + 507, + 633 + ], + "score": 1.0, + "content": "445 [57] F. Pedregosa. Hyperparameter optimization with approximate gradient. In International", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 127, + 629, + 318, + 643 + ], + "spans": [ + { + "bbox": [ + 127, + 629, + 318, + 643 + ], + "score": 1.0, + "content": "conference on machine learning. PMLR, 2016.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 89, + 647, + 507, + 662 + ], + "spans": [ + { + "bbox": [ + 89, + 647, + 507, + 662 + ], + "score": 1.0, + "content": "447 [58] F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 126, + 659, + 507, + 673 + ], + "spans": [ + { + "bbox": [ + 126, + 659, + 507, + 673 + ], + "score": 1.0, + "content": "P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 127, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 127, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "M. Perrot, and E. Duchesnay. Scikit-learn: Machine learning in Python. Journal of Machine", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 127, + 682, + 296, + 694 + ], + "spans": [ + { + "bbox": [ + 127, + 682, + 296, + 694 + ], + "score": 1.0, + "content": "Learning Research, 12:2825–2830, 2011.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 103, + 699, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 103, + 699, + 505, + 713 + ], + "score": 1.0, + "content": "[59] A. Rajeswaran, C. Finn, S. Kakade, and S. Levine. Meta-learning with implicit gradients. arXiv", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 124, + 710, + 266, + 725 + ], + "spans": [ + { + "bbox": [ + 124, + 710, + 266, + 725 + ], + "score": 1.0, + "content": "preprint arXiv:1909.04630, 2019.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 22.5 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 741, + 311, + 751 + ], + "lines": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "spans": [ + { + "bbox": [ + 299, + 740, + 313, + 754 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 86, + 74, + 102, + 737 + ], + "lines": [ + { + "bbox": [ + 84, + 74, + 101, + 86 + ], + "spans": [ + { + "bbox": [ + 84, + 74, + 101, + 86 + ], + "score": 1.0, + "content": "407", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 84, + 101, + 100 + ], + "spans": [ + { + "bbox": [ + 84, + 84, + 101, + 100 + ], + "score": 1.0, + "content": "408", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 114, + 101, + 129 + ], + "spans": [ + { + "bbox": [ + 84, + 114, + 101, + 129 + ], + "score": 1.0, + "content": "410", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 133, + 101, + 145 + ], + "spans": [ + { + "bbox": [ + 85, + 133, + 101, + 145 + ], + "score": 1.0, + "content": "411", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 144, + 101, + 159 + ], + "spans": [ + { + "bbox": [ + 84, + 144, + 101, + 159 + ], + "score": 1.0, + "content": "412", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 173, + 101, + 188 + ], + "spans": [ + { + "bbox": [ + 84, + 173, + 101, + 188 + ], + "score": 1.0, + "content": "414", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 203, + 101, + 217 + ], + "spans": [ + { + "bbox": [ + 84, + 203, + 101, + 217 + ], + "score": 1.0, + "content": "416", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 232, + 101, + 249 + ], + "spans": [ + { + "bbox": [ + 84, + 232, + 101, + 249 + ], + "score": 1.0, + "content": "418", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 263, + 101, + 275 + ], + "spans": [ + { + "bbox": [ + 85, + 263, + 101, + 275 + ], + "score": 1.0, + "content": "420", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 274, + 100, + 286 + ], + "spans": [ + { + "bbox": [ + 85, + 274, + 100, + 286 + ], + "score": 1.0, + "content": "421", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 302, + 101, + 319 + ], + "spans": [ + { + "bbox": [ + 84, + 302, + 101, + 319 + ], + "score": 1.0, + "content": "423", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 332, + 101, + 347 + ], + "spans": [ + { + "bbox": [ + 84, + 332, + 101, + 347 + ], + "score": 1.0, + "content": "425", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 361, + 101, + 377 + ], + "spans": [ + { + "bbox": [ + 84, + 361, + 101, + 377 + ], + "score": 1.0, + "content": "427", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 391, + 101, + 406 + ], + "spans": [ + { + "bbox": [ + 84, + 391, + 101, + 406 + ], + "score": 1.0, + "content": "429", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 422, + 101, + 435 + ], + "spans": [ + { + "bbox": [ + 85, + 422, + 101, + 435 + ], + "score": 1.0, + "content": "431", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 451, + 101, + 462 + ], + "spans": [ + { + "bbox": [ + 85, + 451, + 101, + 462 + ], + "score": 1.0, + "content": "433", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 461, + 101, + 476 + ], + "spans": [ + { + "bbox": [ + 84, + 461, + 101, + 476 + ], + "score": 1.0, + "content": "434", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 491, + 101, + 505 + ], + "spans": [ + { + "bbox": [ + 84, + 491, + 101, + 505 + ], + "score": 1.0, + "content": "436", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 521, + 101, + 532 + ], + "spans": [ + { + "bbox": [ + 85, + 521, + 101, + 532 + ], + "score": 1.0, + "content": "438", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 532, + 101, + 546 + ], + "spans": [ + { + "bbox": [ + 84, + 532, + 101, + 546 + ], + "score": 1.0, + "content": "439", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 561, + 101, + 575 + ], + "spans": [ + { + "bbox": [ + 85, + 561, + 101, + 575 + ], + "score": 1.0, + "content": "441", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 591, + 101, + 602 + ], + "spans": [ + { + "bbox": [ + 85, + 591, + 101, + 602 + ], + "score": 1.0, + "content": "443", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 601, + 101, + 616 + ], + "spans": [ + { + "bbox": [ + 84, + 601, + 101, + 616 + ], + "score": 1.0, + "content": "444", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 631, + 101, + 645 + ], + "spans": [ + { + "bbox": [ + 84, + 631, + 101, + 645 + ], + "score": 1.0, + "content": "446", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 649, + 101, + 663 + ], + "spans": [ + { + "bbox": [ + 83, + 649, + 101, + 663 + ], + "score": 0.974, + "content": "447", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 660, + 101, + 672 + ], + "spans": [ + { + "bbox": [ + 84, + 660, + 101, + 672 + ], + "score": 1.0, + "content": "448", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 672, + 101, + 684 + ], + "spans": [ + { + "bbox": [ + 84, + 672, + 101, + 684 + ], + "score": 1.0, + "content": "449", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 683, + 101, + 695 + ], + "spans": [ + { + "bbox": [ + 85, + 683, + 101, + 695 + ], + "score": 1.0, + "content": "450", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 701, + 100, + 713 + ], + "spans": [ + { + "bbox": [ + 85, + 701, + 100, + 713 + ], + "score": 1.0, + "content": "451", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 712, + 101, + 726 + ], + "spans": [ + { + "bbox": [ + 84, + 712, + 101, + 726 + ], + "score": 1.0, + "content": "452", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 92, + 59, + 508, + 729 + ], + "lines": [], + "index": 22.5, + "bbox_fs": [ + 86, + 72, + 507, + 725 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 84, + 72, + 507, + 499 + ], + "lines": [ + { + "bbox": [ + 86, + 73, + 505, + 85 + ], + "spans": [ + { + "bbox": [ + 86, + 75, + 99, + 84 + ], + "score": 1.0, + "content": "453", + "type": "text" + }, + { + "bbox": [ + 106, + 73, + 505, + 85 + ], + "score": 1.0, + "content": "[60] N. Rappoport and R. Shamir. Multi-omic and multi-view clustering algorithms: review and", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 85, + 84, + 383, + 96 + ], + "spans": [ + { + "bbox": [ + 85, + 85, + 100, + 96 + ], + "score": 1.0, + "content": "454", + "type": "text" + }, + { + "bbox": [ + 127, + 84, + 383, + 96 + ], + "score": 1.0, + "content": "cancer benchmark. Nucleic Acids Res., 46:10546–10562, 2018.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 86, + 100, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 86, + 104, + 99, + 114 + ], + "score": 1.0, + "content": "455", + "type": "text" + }, + { + "bbox": [ + 104, + 100, + 506, + 117 + ], + "score": 1.0, + "content": "[61] Y. Saad and M. H. Schultz. Gmres: A generalized minimal residual algorithm for solving", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 86, + 114, + 506, + 126 + ], + "spans": [ + { + "bbox": [ + 86, + 114, + 101, + 126 + ], + "score": 1.0, + "content": "456", + "type": "text" + }, + { + "bbox": [ + 127, + 114, + 506, + 126 + ], + "score": 1.0, + "content": "nonsymmetric linear systems. SIAM Journal on scientific and statistical computing, 7(3):856–", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 85, + 124, + 173, + 137 + ], + "spans": [ + { + "bbox": [ + 85, + 126, + 100, + 137 + ], + "score": 1.0, + "content": "457", + "type": "text" + }, + { + "bbox": [ + 128, + 124, + 173, + 136 + ], + "score": 1.0, + "content": "869, 1986.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 85, + 142, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 85, + 144, + 100, + 155 + ], + "score": 1.0, + "content": "458", + "type": "text" + }, + { + "bbox": [ + 105, + 142, + 506, + 156 + ], + "score": 1.0, + "content": "[62] S. Schoenholz and E. D. Cubuk. Jax md: A framework for differentiable physics. In", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 85, + 153, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 85, + 156, + 100, + 167 + ], + "score": 1.0, + "content": "459", + "type": "text" + }, + { + "bbox": [ + 126, + 153, + 506, + 167 + ], + "score": 1.0, + "content": "H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, editors, Advances in Neural", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 85, + 164, + 507, + 179 + ], + "spans": [ + { + "bbox": [ + 85, + 167, + 100, + 178 + ], + "score": 1.0, + "content": "460", + "type": "text" + }, + { + "bbox": [ + 126, + 164, + 507, + 179 + ], + "score": 1.0, + "content": "Information Processing Systems, volume 33, pages 11428–11441. Curran Associates, Inc.,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 85, + 175, + 154, + 188 + ], + "spans": [ + { + "bbox": [ + 85, + 178, + 100, + 188 + ], + "score": 1.0, + "content": "461", + "type": "text" + }, + { + "bbox": [ + 127, + 175, + 154, + 188 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 85, + 195, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 85, + 196, + 100, + 207 + ], + "score": 1.0, + "content": "462", + "type": "text" + }, + { + "bbox": [ + 105, + 195, + 506, + 208 + ], + "score": 1.0, + "content": "[63] M. W. Seeger. Cross-validation optimization for large scale structured classification kernel", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 85, + 206, + 375, + 218 + ], + "spans": [ + { + "bbox": [ + 85, + 208, + 100, + 218 + ], + "score": 1.0, + "content": "463", + "type": "text" + }, + { + "bbox": [ + 127, + 206, + 375, + 218 + ], + "score": 1.0, + "content": "methods. Journal of Machine Learning Research, 9(6), 2008.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 85, + 225, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 85, + 226, + 100, + 237 + ], + "score": 1.0, + "content": "464", + "type": "text" + }, + { + "bbox": [ + 106, + 225, + 505, + 237 + ], + "score": 1.0, + "content": "[64] P. Sprechmann, A. M. Bronstein, and G. Sapiro. Supervised non-euclidean sparse nmf via", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 85, + 235, + 506, + 249 + ], + "spans": [ + { + "bbox": [ + 85, + 237, + 100, + 248 + ], + "score": 1.0, + "content": "465", + "type": "text" + }, + { + "bbox": [ + 127, + 235, + 506, + 249 + ], + "score": 1.0, + "content": "bilevel optimization with applications to speech enhancement. In 2014 4th Joint Workshop on", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 86, + 245, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 86, + 249, + 100, + 258 + ], + "score": 1.0, + "content": "466", + "type": "text" + }, + { + "bbox": [ + 126, + 245, + 506, + 259 + ], + "score": 1.0, + "content": "Hands-free Speech Communication and Microphone Arrays (HSCMA), pages 11–15. IEEE,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 85, + 257, + 154, + 270 + ], + "spans": [ + { + "bbox": [ + 85, + 259, + 100, + 270 + ], + "score": 1.0, + "content": "467", + "type": "text" + }, + { + "bbox": [ + 126, + 257, + 154, + 270 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 85, + 276, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 85, + 277, + 100, + 289 + ], + "score": 1.0, + "content": "468", + "type": "text" + }, + { + "bbox": [ + 106, + 276, + 505, + 289 + ], + "score": 1.0, + "content": "[65] S. Vaiter, C.-A. Deledalle, G. Peyré, C. Dossal, and J. Fadili. Local behavior of sparse analysis", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 85, + 286, + 507, + 301 + ], + "spans": [ + { + "bbox": [ + 85, + 289, + 100, + 299 + ], + "score": 1.0, + "content": "469", + "type": "text" + }, + { + "bbox": [ + 126, + 286, + 507, + 301 + ], + "score": 1.0, + "content": "regularization: Applications to risk estimation. Applied and Computational Harmonic Analysis,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 85, + 298, + 217, + 311 + ], + "spans": [ + { + "bbox": [ + 85, + 300, + 100, + 311 + ], + "score": 1.0, + "content": "470", + "type": "text" + }, + { + "bbox": [ + 128, + 298, + 217, + 310 + ], + "score": 1.0, + "content": "35(3):433–451, 2013.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 85, + 316, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 85, + 318, + 99, + 329 + ], + "score": 1.0, + "content": "471", + "type": "text" + }, + { + "bbox": [ + 105, + 316, + 506, + 330 + ], + "score": 1.0, + "content": "[66] H. A. v. d. Vorst and H. A. van der Vorst. Bi-CGSTAB: A fast and smoothly converging variant", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 85, + 327, + 506, + 341 + ], + "spans": [ + { + "bbox": [ + 85, + 329, + 100, + 340 + ], + "score": 1.0, + "content": "472", + "type": "text" + }, + { + "bbox": [ + 126, + 327, + 506, + 341 + ], + "score": 1.0, + "content": "of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 85, + 339, + 308, + 352 + ], + "spans": [ + { + "bbox": [ + 85, + 341, + 100, + 352 + ], + "score": 1.0, + "content": "473", + "type": "text" + }, + { + "bbox": [ + 127, + 339, + 308, + 351 + ], + "score": 1.0, + "content": "Statistical Computing, 13(2):631–644, 1992.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 85, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 85, + 359, + 100, + 369 + ], + "score": 1.0, + "content": "474", + "type": "text" + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "[67] T. Wang, J.-Y. Zhu, A. Torralba, and A. A. Efros. Dataset distillation. arXiv preprint", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 85, + 369, + 230, + 381 + ], + "spans": [ + { + "bbox": [ + 85, + 370, + 100, + 381 + ], + "score": 1.0, + "content": "475", + "type": "text" + }, + { + "bbox": [ + 127, + 369, + 230, + 380 + ], + "score": 1.0, + "content": "arXiv:1811.10959, 2018.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 85, + 387, + 507, + 401 + ], + "spans": [ + { + "bbox": [ + 85, + 389, + 100, + 400 + ], + "score": 1.0, + "content": "476", + "type": "text" + }, + { + "bbox": [ + 105, + 387, + 507, + 401 + ], + "score": 1.0, + "content": "[68] R. E. Wengert. A simple automatic derivative evaluation program. Communications of the ACM,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 85, + 397, + 212, + 412 + ], + "spans": [ + { + "bbox": [ + 85, + 399, + 101, + 412 + ], + "score": 1.0, + "content": "477", + "type": "text" + }, + { + "bbox": [ + 127, + 397, + 212, + 411 + ], + "score": 1.0, + "content": "7(8):463–464, 1964.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 85, + 416, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 85, + 419, + 100, + 430 + ], + "score": 1.0, + "content": "478", + "type": "text" + }, + { + "bbox": [ + 104, + 416, + 506, + 430 + ], + "score": 1.0, + "content": "[69] Y. Wu, M. Ren, R. Liao, and R. B. Grosse. Understanding short-horizon bias in stochastic", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 85, + 428, + 507, + 441 + ], + "spans": [ + { + "bbox": [ + 85, + 430, + 100, + 441 + ], + "score": 1.0, + "content": "479", + "type": "text" + }, + { + "bbox": [ + 126, + 428, + 507, + 441 + ], + "score": 1.0, + "content": "meta-optimization. In 6th International Conference on Learning Representations, ICLR 2018,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 85, + 438, + 507, + 452 + ], + "spans": [ + { + "bbox": [ + 85, + 441, + 100, + 451 + ], + "score": 1.0, + "content": "480", + "type": "text" + }, + { + "bbox": [ + 126, + 438, + 507, + 452 + ], + "score": 1.0, + "content": "Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenRe-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 85, + 450, + 191, + 462 + ], + "spans": [ + { + "bbox": [ + 85, + 451, + 100, + 462 + ], + "score": 1.0, + "content": "481", + "type": "text" + }, + { + "bbox": [ + 127, + 450, + 191, + 462 + ], + "score": 1.0, + "content": "view.net, 2018.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 85, + 468, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 85, + 470, + 100, + 481 + ], + "score": 1.0, + "content": "482", + "type": "text" + }, + { + "bbox": [ + 105, + 468, + 506, + 482 + ], + "score": 1.0, + "content": "[70] J. Zarka, L. Thiry, T. Angles, and S. Mallat. Deep network classification by scattering and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 85, + 479, + 415, + 492 + ], + "spans": [ + { + "bbox": [ + 85, + 481, + 100, + 492 + ], + "score": 1.0, + "content": "483", + "type": "text" + }, + { + "bbox": [ + 126, + 479, + 415, + 492 + ], + "score": 1.0, + "content": "homotopy dictionary learning. arXiv preprint arXiv:1910.03561, 2019.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 15 + } + ], + "page_idx": 12, + "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": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "index", + "bbox": [ + 84, + 72, + 507, + 499 + ], + "lines": [ + { + "bbox": [ + 86, + 73, + 505, + 85 + ], + "spans": [ + { + "bbox": [ + 86, + 75, + 99, + 84 + ], + "score": 1.0, + "content": "453", + "type": "text" + }, + { + "bbox": [ + 106, + 73, + 505, + 85 + ], + "score": 1.0, + "content": "[60] N. Rappoport and R. Shamir. Multi-omic and multi-view clustering algorithms: review and", + "type": "text" + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 84, + 383, + 96 + ], + "spans": [ + { + "bbox": [ + 85, + 85, + 100, + 96 + ], + "score": 1.0, + "content": "454", + "type": "text" + }, + { + "bbox": [ + 127, + 84, + 383, + 96 + ], + "score": 1.0, + "content": "cancer benchmark. Nucleic Acids Res., 46:10546–10562, 2018.", + "type": "text" + } + ], + "index": 1, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 100, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 86, + 104, + 99, + 114 + ], + "score": 1.0, + "content": "455", + "type": "text" + }, + { + "bbox": [ + 104, + 100, + 506, + 117 + ], + "score": 1.0, + "content": "[61] Y. Saad and M. H. Schultz. Gmres: A generalized minimal residual algorithm for solving", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 114, + 506, + 126 + ], + "spans": [ + { + "bbox": [ + 86, + 114, + 101, + 126 + ], + "score": 1.0, + "content": "456", + "type": "text" + }, + { + "bbox": [ + 127, + 114, + 506, + 126 + ], + "score": 1.0, + "content": "nonsymmetric linear systems. SIAM Journal on scientific and statistical computing, 7(3):856–", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 124, + 173, + 137 + ], + "spans": [ + { + "bbox": [ + 85, + 126, + 100, + 137 + ], + "score": 1.0, + "content": "457", + "type": "text" + }, + { + "bbox": [ + 128, + 124, + 173, + 136 + ], + "score": 1.0, + "content": "869, 1986.", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 142, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 85, + 144, + 100, + 155 + ], + "score": 1.0, + "content": "458", + "type": "text" + }, + { + "bbox": [ + 105, + 142, + 506, + 156 + ], + "score": 1.0, + "content": "[62] S. Schoenholz and E. D. Cubuk. Jax md: A framework for differentiable physics. In", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 153, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 85, + 156, + 100, + 167 + ], + "score": 1.0, + "content": "459", + "type": "text" + }, + { + "bbox": [ + 126, + 153, + 506, + 167 + ], + "score": 1.0, + "content": "H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, editors, Advances in Neural", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 164, + 507, + 179 + ], + "spans": [ + { + "bbox": [ + 85, + 167, + 100, + 178 + ], + "score": 1.0, + "content": "460", + "type": "text" + }, + { + "bbox": [ + 126, + 164, + 507, + 179 + ], + "score": 1.0, + "content": "Information Processing Systems, volume 33, pages 11428–11441. Curran Associates, Inc.,", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 175, + 154, + 188 + ], + "spans": [ + { + "bbox": [ + 85, + 178, + 100, + 188 + ], + "score": 1.0, + "content": "461", + "type": "text" + }, + { + "bbox": [ + 127, + 175, + 154, + 188 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 195, + 506, + 208 + ], + "spans": [ + { + "bbox": [ + 85, + 196, + 100, + 207 + ], + "score": 1.0, + "content": "462", + "type": "text" + }, + { + "bbox": [ + 105, + 195, + 506, + 208 + ], + "score": 1.0, + "content": "[63] M. W. Seeger. Cross-validation optimization for large scale structured classification kernel", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 206, + 375, + 218 + ], + "spans": [ + { + "bbox": [ + 85, + 208, + 100, + 218 + ], + "score": 1.0, + "content": "463", + "type": "text" + }, + { + "bbox": [ + 127, + 206, + 375, + 218 + ], + "score": 1.0, + "content": "methods. Journal of Machine Learning Research, 9(6), 2008.", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 225, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 85, + 226, + 100, + 237 + ], + "score": 1.0, + "content": "464", + "type": "text" + }, + { + "bbox": [ + 106, + 225, + 505, + 237 + ], + "score": 1.0, + "content": "[64] P. Sprechmann, A. M. Bronstein, and G. Sapiro. Supervised non-euclidean sparse nmf via", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 235, + 506, + 249 + ], + "spans": [ + { + "bbox": [ + 85, + 237, + 100, + 248 + ], + "score": 1.0, + "content": "465", + "type": "text" + }, + { + "bbox": [ + 127, + 235, + 506, + 249 + ], + "score": 1.0, + "content": "bilevel optimization with applications to speech enhancement. In 2014 4th Joint Workshop on", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 86, + 245, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 86, + 249, + 100, + 258 + ], + "score": 1.0, + "content": "466", + "type": "text" + }, + { + "bbox": [ + 126, + 245, + 506, + 259 + ], + "score": 1.0, + "content": "Hands-free Speech Communication and Microphone Arrays (HSCMA), pages 11–15. IEEE,", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 257, + 154, + 270 + ], + "spans": [ + { + "bbox": [ + 85, + 259, + 100, + 270 + ], + "score": 1.0, + "content": "467", + "type": "text" + }, + { + "bbox": [ + 126, + 257, + 154, + 270 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 276, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 85, + 277, + 100, + 289 + ], + "score": 1.0, + "content": "468", + "type": "text" + }, + { + "bbox": [ + 106, + 276, + 505, + 289 + ], + "score": 1.0, + "content": "[65] S. Vaiter, C.-A. Deledalle, G. Peyré, C. Dossal, and J. Fadili. Local behavior of sparse analysis", + "type": "text" + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 286, + 507, + 301 + ], + "spans": [ + { + "bbox": [ + 85, + 289, + 100, + 299 + ], + "score": 1.0, + "content": "469", + "type": "text" + }, + { + "bbox": [ + 126, + 286, + 507, + 301 + ], + "score": 1.0, + "content": "regularization: Applications to risk estimation. Applied and Computational Harmonic Analysis,", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 298, + 217, + 311 + ], + "spans": [ + { + "bbox": [ + 85, + 300, + 100, + 311 + ], + "score": 1.0, + "content": "470", + "type": "text" + }, + { + "bbox": [ + 128, + 298, + 217, + 310 + ], + "score": 1.0, + "content": "35(3):433–451, 2013.", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 316, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 85, + 318, + 99, + 329 + ], + "score": 1.0, + "content": "471", + "type": "text" + }, + { + "bbox": [ + 105, + 316, + 506, + 330 + ], + "score": 1.0, + "content": "[66] H. A. v. d. Vorst and H. A. van der Vorst. Bi-CGSTAB: A fast and smoothly converging variant", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 327, + 506, + 341 + ], + "spans": [ + { + "bbox": [ + 85, + 329, + 100, + 340 + ], + "score": 1.0, + "content": "472", + "type": "text" + }, + { + "bbox": [ + 126, + 327, + 506, + 341 + ], + "score": 1.0, + "content": "of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 339, + 308, + 352 + ], + "spans": [ + { + "bbox": [ + 85, + 341, + 100, + 352 + ], + "score": 1.0, + "content": "473", + "type": "text" + }, + { + "bbox": [ + 127, + 339, + 308, + 351 + ], + "score": 1.0, + "content": "Statistical Computing, 13(2):631–644, 1992.", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 85, + 359, + 100, + 369 + ], + "score": 1.0, + "content": "474", + "type": "text" + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "[67] T. Wang, J.-Y. Zhu, A. Torralba, and A. A. Efros. Dataset distillation. arXiv preprint", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 369, + 230, + 381 + ], + "spans": [ + { + "bbox": [ + 85, + 370, + 100, + 381 + ], + "score": 1.0, + "content": "475", + "type": "text" + }, + { + "bbox": [ + 127, + 369, + 230, + 380 + ], + "score": 1.0, + "content": "arXiv:1811.10959, 2018.", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 387, + 507, + 401 + ], + "spans": [ + { + "bbox": [ + 85, + 389, + 100, + 400 + ], + "score": 1.0, + "content": "476", + "type": "text" + }, + { + "bbox": [ + 105, + 387, + 507, + 401 + ], + "score": 1.0, + "content": "[68] R. E. Wengert. A simple automatic derivative evaluation program. Communications of the ACM,", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 397, + 212, + 412 + ], + "spans": [ + { + "bbox": [ + 85, + 399, + 101, + 412 + ], + "score": 1.0, + "content": "477", + "type": "text" + }, + { + "bbox": [ + 127, + 397, + 212, + 411 + ], + "score": 1.0, + "content": "7(8):463–464, 1964.", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 416, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 85, + 419, + 100, + 430 + ], + "score": 1.0, + "content": "478", + "type": "text" + }, + { + "bbox": [ + 104, + 416, + 506, + 430 + ], + "score": 1.0, + "content": "[69] Y. Wu, M. Ren, R. Liao, and R. B. Grosse. Understanding short-horizon bias in stochastic", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 428, + 507, + 441 + ], + "spans": [ + { + "bbox": [ + 85, + 430, + 100, + 441 + ], + "score": 1.0, + "content": "479", + "type": "text" + }, + { + "bbox": [ + 126, + 428, + 507, + 441 + ], + "score": 1.0, + "content": "meta-optimization. In 6th International Conference on Learning Representations, ICLR 2018,", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 438, + 507, + 452 + ], + "spans": [ + { + "bbox": [ + 85, + 441, + 100, + 451 + ], + "score": 1.0, + "content": "480", + "type": "text" + }, + { + "bbox": [ + 126, + 438, + 507, + 452 + ], + "score": 1.0, + "content": "Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings. OpenRe-", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 450, + 191, + 462 + ], + "spans": [ + { + "bbox": [ + 85, + 451, + 100, + 462 + ], + "score": 1.0, + "content": "481", + "type": "text" + }, + { + "bbox": [ + 127, + 450, + 191, + 462 + ], + "score": 1.0, + "content": "view.net, 2018.", + "type": "text" + } + ], + "index": 28, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 468, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 85, + 470, + 100, + 481 + ], + "score": 1.0, + "content": "482", + "type": "text" + }, + { + "bbox": [ + 105, + 468, + 506, + 482 + ], + "score": 1.0, + "content": "[70] J. Zarka, L. Thiry, T. Angles, and S. Mallat. Deep network classification by scattering and", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 85, + 479, + 415, + 492 + ], + "spans": [ + { + "bbox": [ + 85, + 481, + 100, + 492 + ], + "score": 1.0, + "content": "483", + "type": "text" + }, + { + "bbox": [ + 126, + 479, + 415, + 492 + ], + "score": 1.0, + "content": "homotopy dictionary learning. arXiv preprint arXiv:1910.03561, 2019.", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + } + ], + "index": 15, + "bbox_fs": [ + 85, + 73, + 507, + 492 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 131, + 92, + 209, + 103 + ], + "lines": [ + { + "bbox": [ + 129, + 90, + 210, + 104 + ], + "spans": [ + { + "bbox": [ + 129, + 90, + 210, + 104 + ], + "score": 1.0, + "content": "1. For all authors...", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 146, + 106, + 505, + 263 + ], + "lines": [ + { + "bbox": [ + 146, + 106, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 146, + 106, + 505, + 119 + ], + "score": 1.0, + "content": "(a) Do the main claims made in the abstract and introduction accurately reflect the paper’s", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 162, + 116, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 162, + 116, + 505, + 130 + ], + "score": 1.0, + "content": "contributions and scope? [Yes] Our paper builds on the premise that reinstantiating", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 161, + 127, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 161, + 127, + 506, + 140 + ], + "score": 1.0, + "content": "the implicit function theorem for every optimization problem a user may encounter", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 161, + 139, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 161, + 139, + 505, + 150 + ], + "score": 1.0, + "content": "is cumbersome. We make the case that a modular approach is needed to bypass that", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 162, + 150, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 162, + 150, + 505, + 162 + ], + "score": 1.0, + "content": "issue. This approach raises several challenges, notably in the way these implicit solvers", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 161, + 160, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 161, + 160, + 505, + 173 + ], + "score": 1.0, + "content": "can be automatically instantiated, consistently, across the large corpus of optimization", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 161, + 172, + 280, + 184 + ], + "spans": [ + { + "bbox": [ + 161, + 172, + 280, + 184 + ], + "score": 1.0, + "content": "approaches favored by users.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 145, + 184, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 145, + 184, + 505, + 196 + ], + "score": 1.0, + "content": "(b) Did you describe the limitations of your work? [Yes] , We discuss several limitations", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 161, + 195, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 161, + 195, + 394, + 207 + ], + "score": 1.0, + "content": "in our work. For instance, implicit differentiation requires", + "type": "text" + }, + { + "bbox": [ + 395, + 195, + 402, + 204 + ], + "score": 0.81, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 195, + 505, + 207 + ], + "score": 1.0, + "content": "to be sufficiently close to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 162, + 205, + 367, + 217 + ], + "spans": [ + { + "bbox": [ + 162, + 206, + 174, + 216 + ], + "score": 0.85, + "content": "x ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 205, + 348, + 217 + ], + "score": 1.0, + "content": "to be meaningful. This is the main topic of", + "type": "text" + }, + { + "bbox": [ + 348, + 205, + 367, + 217 + ], + "score": 0.87, + "content": "\\ S 2 . 3", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 147, + 217, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 147, + 217, + 506, + 230 + ], + "score": 1.0, + "content": "(c) Did you discuss any potential negative societal impacts of your work? [N/A] As a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 161, + 229, + 506, + 241 + ], + "spans": [ + { + "bbox": [ + 161, + 229, + 506, + 241 + ], + "score": 1.0, + "content": "purely methodological paper, we do not foresee negative societal impacts of our work.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 144, + 240, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 144, + 240, + 505, + 255 + ], + "score": 1.0, + "content": "(d) Have you read the ethics review guidelines and ensured that your paper conforms to", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 162, + 251, + 422, + 264 + ], + "spans": [ + { + "bbox": [ + 162, + 251, + 422, + 264 + ], + "score": 1.0, + "content": "them? [Yes] We confirm our paper conforms to those guidelines.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 132, + 266, + 302, + 278 + ], + "lines": [ + { + "bbox": [ + 130, + 265, + 304, + 280 + ], + "spans": [ + { + "bbox": [ + 130, + 265, + 304, + 280 + ], + "score": 1.0, + "content": "2. If you are including theoretical results...", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 146, + 280, + 505, + 326 + ], + "lines": [ + { + "bbox": [ + 145, + 279, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 145, + 279, + 506, + 294 + ], + "score": 1.0, + "content": "(a) Did you state the full set of assumptions of all theoretical results? [Yes] , The paper", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 162, + 291, + 315, + 303 + ], + "spans": [ + { + "bbox": [ + 162, + 291, + 292, + 303 + ], + "score": 1.0, + "content": "contains one theoretical section,", + "type": "text" + }, + { + "bbox": [ + 293, + 291, + 311, + 303 + ], + "score": 0.87, + "content": "\\ S 2 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 291, + 315, + 303 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 146, + 303, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 146, + 303, + 505, + 316 + ], + "score": 1.0, + "content": "(b) Did you include complete proofs of all theoretical results? [Yes] , All proofs are", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 162, + 314, + 276, + 326 + ], + "spans": [ + { + "bbox": [ + 162, + 314, + 276, + 326 + ], + "score": 1.0, + "content": "included in the Appendix D", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 131, + 329, + 241, + 340 + ], + "lines": [ + { + "bbox": [ + 128, + 327, + 242, + 343 + ], + "spans": [ + { + "bbox": [ + 128, + 327, + 242, + 343 + ], + "score": 1.0, + "content": "3. If you ran experiments...", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 144, + 344, + 505, + 511 + ], + "lines": [ + { + "bbox": [ + 147, + 342, + 507, + 356 + ], + "spans": [ + { + "bbox": [ + 147, + 342, + 507, + 356 + ], + "score": 1.0, + "content": "(a) Did you include the code, data, and instructions needed to reproduce the main exper-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 162, + 354, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 162, + 354, + 505, + 366 + ], + "score": 1.0, + "content": "imental results (either in the supplemental material or as a URL)? [No] At the time", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 162, + 365, + 505, + 377 + ], + "spans": [ + { + "bbox": [ + 162, + 365, + 505, + 377 + ], + "score": 1.0, + "content": "of submission, we are in the course of an approval process for open-source release", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 161, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 161, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "required by our organization. We believe that the library itself comprises a contribution,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 161, + 386, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 161, + 386, + 505, + 399 + ], + "score": 1.0, + "content": "and will have it available in open source by the time of this paper’s publication (at the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 161, + 397, + 191, + 409 + ], + "spans": [ + { + "bbox": [ + 161, + 397, + 191, + 409 + ], + "score": 1.0, + "content": "latest).", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 145, + 410, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 145, + 410, + 505, + 423 + ], + "score": 1.0, + "content": "(b) Did you specify all the training details (e.g., data splits, hyperparameters, how they", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 162, + 421, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 162, + 421, + 505, + 434 + ], + "score": 1.0, + "content": "were chosen)? [Yes] , Experiments were mostly run with minimal parameter tuning to", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 162, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 162, + 432, + 435, + 444 + ], + "score": 1.0, + "content": "reflect the simplicity of the approach we advocate. This is reflected in", + "type": "text" + }, + { + "bbox": [ + 436, + 432, + 447, + 443 + ], + "score": 0.5, + "content": "\\ S 3", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "and Appendix", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 161, + 443, + 172, + 454 + ], + "spans": [ + { + "bbox": [ + 161, + 443, + 172, + 454 + ], + "score": 1.0, + "content": "E", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 146, + 455, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 146, + 456, + 160, + 467 + ], + "score": 1.0, + "content": "(c)", + "type": "text" + }, + { + "bbox": [ + 161, + 455, + 506, + 467 + ], + "score": 1.0, + "content": "Did you report error bars (e.g., with respect to the random seed after running ex-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 160, + 465, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 160, + 465, + 506, + 480 + ], + "score": 1.0, + "content": "periments multiple times)? [Yes] , see Figure 2 and std for the dictionary learning", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 161, + 477, + 183, + 488 + ], + "spans": [ + { + "bbox": [ + 161, + 477, + 183, + 488 + ], + "score": 1.0, + "content": "task.", + "type": "text" + } + ], + "index": 33 + }, + { + "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": 34 + }, + { + "bbox": [ + 162, + 500, + 441, + 513 + ], + "spans": [ + { + "bbox": [ + 162, + 500, + 441, + 513 + ], + "score": 1.0, + "content": "of GPUs, internal cluster, or cloud provider)? [Yes] , see Appendix E", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 132, + 514, + 504, + 526 + ], + "lines": [ + { + "bbox": [ + 129, + 513, + 506, + 528 + ], + "spans": [ + { + "bbox": [ + 129, + 513, + 506, + 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": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 146, + 528, + 505, + 633 + ], + "lines": [ + { + "bbox": [ + 145, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 145, + 528, + 435, + 541 + ], + "score": 1.0, + "content": "(a) If your work uses existing assets, did you cite the creators? [Yes] , see", + "type": "text" + }, + { + "bbox": [ + 436, + 529, + 447, + 540 + ], + "score": 0.64, + "content": "\\ S 3", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "and Appendix", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 161, + 539, + 172, + 551 + ], + "spans": [ + { + "bbox": [ + 161, + 539, + 172, + 551 + ], + "score": 1.0, + "content": "E", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 145, + 551, + 428, + 565 + ], + "spans": [ + { + "bbox": [ + 145, + 551, + 428, + 565 + ], + "score": 1.0, + "content": "(b) Did you mention the license of the assets? [Yes] , see Appendix E", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 145, + 564, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 145, + 564, + 505, + 577 + ], + "score": 1.0, + "content": "(c) Did you include any new assets either in the supplemental material or as a URL? [N/A]", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 145, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 145, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "(d) Did you discuss whether and how consent was obtained from people whose data you’re", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 162, + 598, + 253, + 611 + ], + "spans": [ + { + "bbox": [ + 162, + 598, + 253, + 611 + ], + "score": 1.0, + "content": "using/curating? [N/A]", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 145, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 145, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "(e) Did you discuss whether the data you are using/curating contains personally identifiable", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 162, + 622, + 325, + 634 + ], + "spans": [ + { + "bbox": [ + 162, + 622, + 325, + 634 + ], + "score": 1.0, + "content": "information or offensive content? [N/A]", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 132, + 635, + 432, + 647 + ], + "lines": [ + { + "bbox": [ + 128, + 634, + 433, + 649 + ], + "spans": [ + { + "bbox": [ + 128, + 634, + 433, + 649 + ], + "score": 1.0, + "content": "5. If you used crowdsourcing or conducted research with human subjects...", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45 + }, + { + "type": "text", + "bbox": [ + 146, + 650, + 505, + 720 + ], + "lines": [ + { + "bbox": [ + 145, + 649, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 145, + 649, + 506, + 663 + ], + "score": 1.0, + "content": "(a) Did you include the full text of instructions given to participants and screenshots, if", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 161, + 660, + 237, + 673 + ], + "spans": [ + { + "bbox": [ + 161, + 660, + 237, + 673 + ], + "score": 1.0, + "content": "applicable? [N/A]", + "type": "text" + } + ], + "index": 47 + }, + { + "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": 48 + }, + { + "bbox": [ + 161, + 684, + 342, + 697 + ], + "spans": [ + { + "bbox": [ + 161, + 684, + 342, + 697 + ], + "score": 1.0, + "content": "Board (IRB) approvals, if applicable? [N/A]", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 146, + 696, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 146, + 696, + 505, + 709 + ], + "score": 1.0, + "content": "(c) Did you include the estimated hourly wage paid to participants and the total amount", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 161, + 708, + 333, + 720 + ], + "spans": [ + { + "bbox": [ + 161, + 708, + 333, + 720 + ], + "score": 1.0, + "content": "spent on participant compensation? [N/A]", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 48.5 + } + ], + "page_idx": 13, + "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": "14", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 87, + 71, + 156, + 84 + ], + "lines": [ + { + "bbox": [ + 84, + 70, + 158, + 87 + ], + "spans": [ + { + "bbox": [ + 84, + 76, + 101, + 87 + ], + "score": 1.0, + "content": "484", + "type": "text" + }, + { + "bbox": [ + 105, + 70, + 158, + 86 + ], + "score": 1.0, + "content": "Checklist", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 84, + 80, + 103, + 731 + ], + "lines": [ + { + "bbox": [ + 84, + 93, + 100, + 104 + ], + "spans": [ + { + "bbox": [ + 84, + 93, + 100, + 104 + ], + "score": 1.0, + "content": "485", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 108, + 100, + 118 + ], + "spans": [ + { + "bbox": [ + 84, + 108, + 100, + 118 + ], + "score": 1.0, + "content": "486", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 118, + 100, + 129 + ], + "spans": [ + { + "bbox": [ + 84, + 118, + 100, + 129 + ], + "score": 1.0, + "content": "487", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 129, + 101, + 140 + ], + "spans": [ + { + "bbox": [ + 84, + 129, + 101, + 140 + ], + "score": 1.0, + "content": "488", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 140, + 100, + 150 + ], + "spans": [ + { + "bbox": [ + 85, + 140, + 100, + 150 + ], + "score": 1.0, + "content": "489", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 151, + 100, + 162 + ], + "spans": [ + { + "bbox": [ + 84, + 151, + 100, + 162 + ], + "score": 1.0, + "content": "490", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 162, + 100, + 173 + ], + "spans": [ + { + "bbox": [ + 84, + 162, + 100, + 173 + ], + "score": 1.0, + "content": "491", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 173, + 100, + 183 + ], + "spans": [ + { + "bbox": [ + 84, + 173, + 100, + 183 + ], + "score": 1.0, + "content": "492", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 186, + 100, + 196 + ], + "spans": [ + { + "bbox": [ + 84, + 186, + 100, + 196 + ], + "score": 1.0, + "content": "493", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 196, + 100, + 207 + ], + "spans": [ + { + "bbox": [ + 84, + 196, + 100, + 207 + ], + "score": 1.0, + "content": "494", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 207, + 100, + 218 + ], + "spans": [ + { + "bbox": [ + 84, + 207, + 100, + 218 + ], + "score": 1.0, + "content": "495", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 219, + 100, + 230 + ], + "spans": [ + { + "bbox": [ + 84, + 219, + 100, + 230 + ], + "score": 1.0, + "content": "496", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 230, + 100, + 241 + ], + "spans": [ + { + "bbox": [ + 84, + 230, + 100, + 241 + ], + "score": 1.0, + "content": "497", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 243, + 100, + 254 + ], + "spans": [ + { + "bbox": [ + 84, + 243, + 100, + 254 + ], + "score": 1.0, + "content": "498", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 254, + 100, + 265 + ], + "spans": [ + { + "bbox": [ + 85, + 254, + 100, + 265 + ], + "score": 1.0, + "content": "499", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 268, + 100, + 279 + ], + "spans": [ + { + "bbox": [ + 84, + 268, + 100, + 279 + ], + "score": 1.0, + "content": "500", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 282, + 100, + 293 + ], + "spans": [ + { + "bbox": [ + 84, + 282, + 100, + 293 + ], + "score": 1.0, + "content": "501", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 293, + 100, + 304 + ], + "spans": [ + { + "bbox": [ + 84, + 293, + 100, + 304 + ], + "score": 1.0, + "content": "502", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 305, + 100, + 317 + ], + "spans": [ + { + "bbox": [ + 84, + 305, + 100, + 317 + ], + "score": 1.0, + "content": "503", + "type": "text" + } + ] + }, + { + "bbox": [ + 83, + 315, + 102, + 329 + ], + "spans": [ + { + "bbox": [ + 83, + 315, + 102, + 329 + ], + "score": 1.0, + "content": "504", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 330, + 100, + 342 + ], + "spans": [ + { + "bbox": [ + 84, + 330, + 100, + 342 + ], + "score": 1.0, + "content": "505", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 344, + 100, + 356 + ], + "spans": [ + { + "bbox": [ + 84, + 344, + 100, + 356 + ], + "score": 1.0, + "content": "506", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 356, + 100, + 367 + ], + "spans": [ + { + "bbox": [ + 84, + 356, + 100, + 367 + ], + "score": 1.0, + "content": "507", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 367, + 101, + 378 + ], + "spans": [ + { + "bbox": [ + 84, + 367, + 101, + 378 + ], + "score": 1.0, + "content": "508", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 377, + 100, + 389 + ], + "spans": [ + { + "bbox": [ + 84, + 377, + 100, + 389 + ], + "score": 1.0, + "content": "509", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 388, + 100, + 399 + ], + "spans": [ + { + "bbox": [ + 84, + 388, + 100, + 399 + ], + "score": 1.0, + "content": "510", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 399, + 100, + 410 + ], + "spans": [ + { + "bbox": [ + 84, + 399, + 100, + 410 + ], + "score": 1.0, + "content": "511", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 412, + 101, + 423 + ], + "spans": [ + { + "bbox": [ + 84, + 412, + 101, + 423 + ], + "score": 1.0, + "content": "512", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 423, + 101, + 434 + ], + "spans": [ + { + "bbox": [ + 84, + 423, + 101, + 434 + ], + "score": 1.0, + "content": "513", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 433, + 101, + 444 + ], + "spans": [ + { + "bbox": [ + 84, + 433, + 101, + 444 + ], + "score": 1.0, + "content": "514", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 444, + 101, + 455 + ], + "spans": [ + { + "bbox": [ + 84, + 444, + 101, + 455 + ], + "score": 1.0, + "content": "515", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 456, + 101, + 468 + ], + "spans": [ + { + "bbox": [ + 84, + 456, + 101, + 468 + ], + "score": 1.0, + "content": "516", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 468, + 100, + 478 + ], + "spans": [ + { + "bbox": [ + 84, + 468, + 100, + 478 + ], + "score": 1.0, + "content": "517", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 478, + 101, + 489 + ], + "spans": [ + { + "bbox": [ + 84, + 478, + 101, + 489 + ], + "score": 1.0, + "content": "518", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 491, + 101, + 501 + ], + "spans": [ + { + "bbox": [ + 84, + 491, + 101, + 501 + ], + "score": 1.0, + "content": "519", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 501, + 100, + 513 + ], + "spans": [ + { + "bbox": [ + 84, + 501, + 100, + 513 + ], + "score": 1.0, + "content": "520", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 515, + 100, + 527 + ], + "spans": [ + { + "bbox": [ + 84, + 515, + 100, + 527 + ], + "score": 1.0, + "content": "521", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 530, + 100, + 541 + ], + "spans": [ + { + "bbox": [ + 84, + 530, + 100, + 541 + ], + "score": 1.0, + "content": "522", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 541, + 100, + 552 + ], + "spans": [ + { + "bbox": [ + 84, + 541, + 100, + 552 + ], + "score": 1.0, + "content": "523", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 552, + 100, + 565 + ], + "spans": [ + { + "bbox": [ + 84, + 552, + 100, + 565 + ], + "score": 1.0, + "content": "524", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 565, + 100, + 577 + ], + "spans": [ + { + "bbox": [ + 84, + 565, + 100, + 577 + ], + "score": 1.0, + "content": "525", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 576, + 100, + 588 + ], + "spans": [ + { + "bbox": [ + 84, + 576, + 100, + 588 + ], + "score": 1.0, + "content": "526", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 589, + 100, + 600 + ], + "spans": [ + { + "bbox": [ + 84, + 589, + 100, + 600 + ], + "score": 1.0, + "content": "527", + "type": "text" + } + ] + }, + { + "bbox": [ + 85, + 600, + 100, + 611 + ], + "spans": [ + { + "bbox": [ + 85, + 600, + 100, + 611 + ], + "score": 1.0, + "content": "528", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 612, + 100, + 623 + ], + "spans": [ + { + "bbox": [ + 84, + 612, + 100, + 623 + ], + "score": 1.0, + "content": "529", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 623, + 100, + 634 + ], + "spans": [ + { + "bbox": [ + 84, + 623, + 100, + 634 + ], + "score": 1.0, + "content": "530", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 637, + 100, + 649 + ], + "spans": [ + { + "bbox": [ + 84, + 637, + 100, + 649 + ], + "score": 1.0, + "content": "531", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 651, + 101, + 663 + ], + "spans": [ + { + "bbox": [ + 84, + 651, + 101, + 663 + ], + "score": 1.0, + "content": "532", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 662, + 100, + 673 + ], + "spans": [ + { + "bbox": [ + 84, + 662, + 100, + 673 + ], + "score": 1.0, + "content": "533", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 675, + 101, + 686 + ], + "spans": [ + { + "bbox": [ + 84, + 675, + 101, + 686 + ], + "score": 1.0, + "content": "534", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 686, + 100, + 697 + ], + "spans": [ + { + "bbox": [ + 84, + 686, + 100, + 697 + ], + "score": 1.0, + "content": "535", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 698, + 100, + 709 + ], + "spans": [ + { + "bbox": [ + 84, + 698, + 100, + 709 + ], + "score": 1.0, + "content": "536", + "type": "text" + } + ] + }, + { + "bbox": [ + 84, + 709, + 100, + 720 + ], + "spans": [ + { + "bbox": [ + 84, + 709, + 100, + 720 + ], + "score": 1.0, + "content": "537", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 131, + 92, + 209, + 103 + ], + "lines": [ + { + "bbox": [ + 129, + 90, + 210, + 104 + ], + "spans": [ + { + "bbox": [ + 129, + 90, + 210, + 104 + ], + "score": 1.0, + "content": "1. For all authors...", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 129, + 90, + 210, + 104 + ] + }, + { + "type": "list", + "bbox": [ + 146, + 106, + 505, + 263 + ], + "lines": [ + { + "bbox": [ + 146, + 106, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 146, + 106, + 505, + 119 + ], + "score": 1.0, + "content": "(a) Do the main claims made in the abstract and introduction accurately reflect the paper’s", + "type": "text" + } + ], + "index": 1, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 116, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 162, + 116, + 505, + 130 + ], + "score": 1.0, + "content": "contributions and scope? [Yes] Our paper builds on the premise that reinstantiating", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 161, + 127, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 161, + 127, + 506, + 140 + ], + "score": 1.0, + "content": "the implicit function theorem for every optimization problem a user may encounter", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 161, + 139, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 161, + 139, + 505, + 150 + ], + "score": 1.0, + "content": "is cumbersome. We make the case that a modular approach is needed to bypass that", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 162, + 150, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 162, + 150, + 505, + 162 + ], + "score": 1.0, + "content": "issue. This approach raises several challenges, notably in the way these implicit solvers", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 161, + 160, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 161, + 160, + 505, + 173 + ], + "score": 1.0, + "content": "can be automatically instantiated, consistently, across the large corpus of optimization", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 161, + 172, + 280, + 184 + ], + "spans": [ + { + "bbox": [ + 161, + 172, + 280, + 184 + ], + "score": 1.0, + "content": "approaches favored by users.", + "type": "text" + } + ], + "index": 7, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 184, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 145, + 184, + 505, + 196 + ], + "score": 1.0, + "content": "(b) Did you describe the limitations of your work? [Yes] , We discuss several limitations", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 195, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 161, + 195, + 394, + 207 + ], + "score": 1.0, + "content": "in our work. For instance, implicit differentiation requires", + "type": "text" + }, + { + "bbox": [ + 395, + 195, + 402, + 204 + ], + "score": 0.81, + "content": "\\hat { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 195, + 505, + 207 + ], + "score": 1.0, + "content": "to be sufficiently close to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 162, + 205, + 367, + 217 + ], + "spans": [ + { + "bbox": [ + 162, + 206, + 174, + 216 + ], + "score": 0.85, + "content": "x ^ { \\star }", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 205, + 348, + 217 + ], + "score": 1.0, + "content": "to be meaningful. This is the main topic of", + "type": "text" + }, + { + "bbox": [ + 348, + 205, + 367, + 217 + ], + "score": 0.87, + "content": "\\ S 2 . 3", + "type": "inline_equation" + } + ], + "index": 10, + "is_list_end_line": true + }, + { + "bbox": [ + 147, + 217, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 147, + 217, + 506, + 230 + ], + "score": 1.0, + "content": "(c) Did you discuss any potential negative societal impacts of your work? [N/A] As a", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 229, + 506, + 241 + ], + "spans": [ + { + "bbox": [ + 161, + 229, + 506, + 241 + ], + "score": 1.0, + "content": "purely methodological paper, we do not foresee negative societal impacts of our work.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 144, + 240, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 144, + 240, + 505, + 255 + ], + "score": 1.0, + "content": "(d) Have you read the ethics review guidelines and ensured that your paper conforms to", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 251, + 422, + 264 + ], + "spans": [ + { + "bbox": [ + 162, + 251, + 422, + 264 + ], + "score": 1.0, + "content": "them? [Yes] We confirm our paper conforms to those guidelines.", + "type": "text" + } + ], + "index": 14, + "is_list_end_line": true + } + ], + "index": 7.5, + "bbox_fs": [ + 144, + 106, + 506, + 264 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 266, + 302, + 278 + ], + "lines": [ + { + "bbox": [ + 130, + 265, + 304, + 280 + ], + "spans": [ + { + "bbox": [ + 130, + 265, + 304, + 280 + ], + "score": 1.0, + "content": "2. If you are including theoretical results...", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 130, + 265, + 304, + 280 + ] + }, + { + "type": "list", + "bbox": [ + 146, + 280, + 505, + 326 + ], + "lines": [ + { + "bbox": [ + 145, + 279, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 145, + 279, + 506, + 294 + ], + "score": 1.0, + "content": "(a) Did you state the full set of assumptions of all theoretical results? [Yes] , The paper", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 291, + 315, + 303 + ], + "spans": [ + { + "bbox": [ + 162, + 291, + 292, + 303 + ], + "score": 1.0, + "content": "contains one theoretical section,", + "type": "text" + }, + { + "bbox": [ + 293, + 291, + 311, + 303 + ], + "score": 0.87, + "content": "\\ S 2 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 291, + 315, + 303 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17, + "is_list_end_line": true + }, + { + "bbox": [ + 146, + 303, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 146, + 303, + 505, + 316 + ], + "score": 1.0, + "content": "(b) Did you include complete proofs of all theoretical results? [Yes] , All proofs are", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 314, + 276, + 326 + ], + "spans": [ + { + "bbox": [ + 162, + 314, + 276, + 326 + ], + "score": 1.0, + "content": "included in the Appendix D", + "type": "text" + } + ], + "index": 19, + "is_list_end_line": true + } + ], + "index": 17.5, + "bbox_fs": [ + 145, + 279, + 506, + 326 + ] + }, + { + "type": "text", + "bbox": [ + 131, + 329, + 241, + 340 + ], + "lines": [ + { + "bbox": [ + 128, + 327, + 242, + 343 + ], + "spans": [ + { + "bbox": [ + 128, + 327, + 242, + 343 + ], + "score": 1.0, + "content": "3. If you ran experiments...", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 128, + 327, + 242, + 343 + ] + }, + { + "type": "list", + "bbox": [ + 144, + 344, + 505, + 511 + ], + "lines": [ + { + "bbox": [ + 147, + 342, + 507, + 356 + ], + "spans": [ + { + "bbox": [ + 147, + 342, + 507, + 356 + ], + "score": 1.0, + "content": "(a) Did you include the code, data, and instructions needed to reproduce the main exper-", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 354, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 162, + 354, + 505, + 366 + ], + "score": 1.0, + "content": "imental results (either in the supplemental material or as a URL)? [No] At the time", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 162, + 365, + 505, + 377 + ], + "spans": [ + { + "bbox": [ + 162, + 365, + 505, + 377 + ], + "score": 1.0, + "content": "of submission, we are in the course of an approval process for open-source release", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 161, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 161, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "required by our organization. We believe that the library itself comprises a contribution,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 161, + 386, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 161, + 386, + 505, + 399 + ], + "score": 1.0, + "content": "and will have it available in open source by the time of this paper’s publication (at the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 161, + 397, + 191, + 409 + ], + "spans": [ + { + "bbox": [ + 161, + 397, + 191, + 409 + ], + "score": 1.0, + "content": "latest).", + "type": "text" + } + ], + "index": 26, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 410, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 145, + 410, + 505, + 423 + ], + "score": 1.0, + "content": "(b) Did you specify all the training details (e.g., data splits, hyperparameters, how they", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 421, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 162, + 421, + 505, + 434 + ], + "score": 1.0, + "content": "were chosen)? [Yes] , Experiments were mostly run with minimal parameter tuning to", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 162, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 162, + 432, + 435, + 444 + ], + "score": 1.0, + "content": "reflect the simplicity of the approach we advocate. This is reflected in", + "type": "text" + }, + { + "bbox": [ + 436, + 432, + 447, + 443 + ], + "score": 0.5, + "content": "\\ S 3", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "and Appendix", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 161, + 443, + 172, + 454 + ], + "spans": [ + { + "bbox": [ + 161, + 443, + 172, + 454 + ], + "score": 1.0, + "content": "E", + "type": "text" + } + ], + "index": 30, + "is_list_end_line": true + }, + { + "bbox": [ + 146, + 455, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 146, + 456, + 160, + 467 + ], + "score": 1.0, + "content": "(c)", + "type": "text" + }, + { + "bbox": [ + 161, + 455, + 506, + 467 + ], + "score": 1.0, + "content": "Did you report error bars (e.g., with respect to the random seed after running ex-", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 160, + 465, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 160, + 465, + 506, + 480 + ], + "score": 1.0, + "content": "periments multiple times)? [Yes] , see Figure 2 and std for the dictionary learning", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 161, + 477, + 183, + 488 + ], + "spans": [ + { + "bbox": [ + 161, + 477, + 183, + 488 + ], + "score": 1.0, + "content": "task.", + "type": "text" + } + ], + "index": 33, + "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": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 500, + 441, + 513 + ], + "spans": [ + { + "bbox": [ + 162, + 500, + 441, + 513 + ], + "score": 1.0, + "content": "of GPUs, internal cluster, or cloud provider)? [Yes] , see Appendix E", + "type": "text" + } + ], + "index": 35, + "is_list_end_line": true + } + ], + "index": 28, + "bbox_fs": [ + 145, + 342, + 507, + 513 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 514, + 504, + 526 + ], + "lines": [ + { + "bbox": [ + 129, + 513, + 506, + 528 + ], + "spans": [ + { + "bbox": [ + 129, + 513, + 506, + 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": 36 + } + ], + "index": 36, + "bbox_fs": [ + 129, + 513, + 506, + 528 + ] + }, + { + "type": "list", + "bbox": [ + 146, + 528, + 505, + 633 + ], + "lines": [ + { + "bbox": [ + 145, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 145, + 528, + 435, + 541 + ], + "score": 1.0, + "content": "(a) If your work uses existing assets, did you cite the creators? [Yes] , see", + "type": "text" + }, + { + "bbox": [ + 436, + 529, + 447, + 540 + ], + "score": 0.64, + "content": "\\ S 3", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "and Appendix", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 539, + 172, + 551 + ], + "spans": [ + { + "bbox": [ + 161, + 539, + 172, + 551 + ], + "score": 1.0, + "content": "E", + "type": "text" + } + ], + "index": 38, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 551, + 428, + 565 + ], + "spans": [ + { + "bbox": [ + 145, + 551, + 428, + 565 + ], + "score": 1.0, + "content": "(b) Did you mention the license of the assets? [Yes] , see Appendix E", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 564, + 505, + 577 + ], + "spans": [ + { + "bbox": [ + 145, + 564, + 505, + 577 + ], + "score": 1.0, + "content": "(c) Did you include any new assets either in the supplemental material or as a URL? [N/A]", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 145, + 587, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 145, + 587, + 505, + 600 + ], + "score": 1.0, + "content": "(d) Did you discuss whether and how consent was obtained from people whose data you’re", + "type": "text" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 598, + 253, + 611 + ], + "spans": [ + { + "bbox": [ + 162, + 598, + 253, + 611 + ], + "score": 1.0, + "content": "using/curating? [N/A]", + "type": "text" + } + ], + "index": 42, + "is_list_end_line": true + }, + { + "bbox": [ + 145, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 145, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "(e) Did you discuss whether the data you are using/curating contains personally identifiable", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 162, + 622, + 325, + 634 + ], + "spans": [ + { + "bbox": [ + 162, + 622, + 325, + 634 + ], + "score": 1.0, + "content": "information or offensive content? [N/A]", + "type": "text" + } + ], + "index": 44, + "is_list_end_line": true + } + ], + "index": 40.5, + "bbox_fs": [ + 145, + 528, + 505, + 634 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 635, + 432, + 647 + ], + "lines": [ + { + "bbox": [ + 128, + 634, + 433, + 649 + ], + "spans": [ + { + "bbox": [ + 128, + 634, + 433, + 649 + ], + "score": 1.0, + "content": "5. If you used crowdsourcing or conducted research with human subjects...", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45, + "bbox_fs": [ + 128, + 634, + 433, + 649 + ] + }, + { + "type": "list", + "bbox": [ + 146, + 650, + 505, + 720 + ], + "lines": [ + { + "bbox": [ + 145, + 649, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 145, + 649, + 506, + 663 + ], + "score": 1.0, + "content": "(a) Did you include the full text of instructions given to participants and screenshots, if", + "type": "text" + } + ], + "index": 46, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 660, + 237, + 673 + ], + "spans": [ + { + "bbox": [ + 161, + 660, + 237, + 673 + ], + "score": 1.0, + "content": "applicable? [N/A]", + "type": "text" + } + ], + "index": 47, + "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": 48, + "is_list_start_line": true + }, + { + "bbox": [ + 161, + 684, + 342, + 697 + ], + "spans": [ + { + "bbox": [ + 161, + 684, + 342, + 697 + ], + "score": 1.0, + "content": "Board (IRB) approvals, if applicable? [N/A]", + "type": "text" + } + ], + "index": 49, + "is_list_end_line": true + }, + { + "bbox": [ + 146, + 696, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 146, + 696, + 505, + 709 + ], + "score": 1.0, + "content": "(c) Did you include the estimated hourly wage paid to participants and the total amount", + "type": "text" + } + ], + "index": 50, + "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": 51, + "is_list_end_line": true + } + ], + "index": 48.5, + "bbox_fs": [ + 145, + 649, + 506, + 720 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/D8-iwC9UN3/D8-iwC9UN3_model.json b/parse/train/D8-iwC9UN3/D8-iwC9UN3_model.json new file mode 100644 index 0000000000000000000000000000000000000000..ebd9539f4f5ecb94e171d8d2ea9e1a84eecc5e3b --- /dev/null +++ b/parse/train/D8-iwC9UN3/D8-iwC9UN3_model.json @@ -0,0 +1,29478 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 254, + 716, + 1305, + 716, + 1305, + 1232, + 254, + 1232 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 249, + 1360, + 1404, + 1360, + 1404, + 1694, + 249, + 1694 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 250, + 1709, + 1404, + 1709, + 1404, + 1983, + 250, + 1983 + ], + "score": 0.96 + }, + { + "category_id": 0, + "poly": [ + 371, + 270, + 1326, + 270, + 1326, + 327, + 371, + 327 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 720, + 444, + 987, + 444, + 987, + 565, + 720, + 565 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 254, + 1290, + 530, + 1290, + 530, + 1328, + 254, + 1328 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 788, + 645, + 913, + 645, + 913, + 681, + 788, + 681 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 289, + 2033, + 1387, + 2033, + 1387, + 2062, + 289, + 2062 + ], + "score": 0.622 + }, + { + "category_id": 1, + "poly": [ + 289, + 2033, + 1387, + 2033, + 1387, + 2062, + 289, + 2062 + ], + "score": 0.25 + }, + { + "category_id": 13, + "poly": [ + 1230, + 1021, + 1254, + 1021, + 1254, + 1047, + 1230, + 1047 + ], + "score": 0.84, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 843, + 990, + 868, + 990, + 868, + 1016, + 843, + 1016 + ], + "score": 0.82, + "latex": "F" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 270.0, + 1325.0, + 270.0, + 1325.0, + 330.0, + 373.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 243.0, + 1288.0, + 536.0, + 1288.0, + 536.0, + 1334.0, + 243.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 642.0, + 920.0, + 642.0, + 920.0, + 686.0, + 782.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2029.0, + 1390.0, + 2029.0, + 1390.0, + 2066.0, + 295.0, + 2066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 259.0, + 725.0, + 277.0, + 725.0, + 277.0, + 748.0, + 259.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 717.0, + 1305.0, + 717.0, + 1305.0, + 750.0, + 396.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 259.0, + 754.0, + 277.0, + 754.0, + 277.0, + 777.0, + 259.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 747.0, + 1305.0, + 747.0, + 1305.0, + 780.0, + 396.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 259.0, + 784.0, + 277.0, + 784.0, + 277.0, + 808.0, + 259.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 773.0, + 1307.0, + 773.0, + 1307.0, + 813.0, + 395.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 259.0, + 814.0, + 277.0, + 814.0, + 277.0, + 839.0, + 259.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 806.0, + 1306.0, + 806.0, + 1306.0, + 840.0, + 393.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 259.0, + 845.0, + 277.0, + 845.0, + 277.0, + 868.0, + 259.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 838.0, + 1306.0, + 838.0, + 1306.0, + 872.0, + 395.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 258.0, + 875.0, + 277.0, + 875.0, + 277.0, + 899.0, + 258.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 868.0, + 1306.0, + 868.0, + 1306.0, + 902.0, + 393.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 258.0, + 905.0, + 277.0, + 905.0, + 277.0, + 929.0, + 258.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 898.0, + 1306.0, + 898.0, + 1306.0, + 932.0, + 393.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 257.0, + 934.0, + 280.0, + 934.0, + 280.0, + 961.0, + 257.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 928.0, + 1308.0, + 928.0, + 1308.0, + 964.0, + 392.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 258.0, + 966.0, + 277.0, + 966.0, + 277.0, + 990.0, + 258.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 960.0, + 1306.0, + 960.0, + 1306.0, + 993.0, + 395.0, + 993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 251.0, + 994.0, + 277.0, + 994.0, + 277.0, + 1021.0, + 251.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 987.0, + 842.0, + 987.0, + 842.0, + 1025.0, + 392.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 987.0, + 1308.0, + 987.0, + 1308.0, + 1025.0, + 869.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1025.0, + 278.0, + 1025.0, + 278.0, + 1053.0, + 248.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1020.0, + 1229.0, + 1020.0, + 1229.0, + 1053.0, + 395.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 1020.0, + 1307.0, + 1020.0, + 1307.0, + 1053.0, + 1255.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1055.0, + 278.0, + 1055.0, + 278.0, + 1083.0, + 248.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1049.0, + 1305.0, + 1049.0, + 1305.0, + 1082.0, + 395.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1086.0, + 280.0, + 1086.0, + 280.0, + 1114.0, + 248.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1079.0, + 1308.0, + 1079.0, + 1308.0, + 1114.0, + 392.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 250.0, + 1117.0, + 277.0, + 1117.0, + 277.0, + 1142.0, + 250.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1110.0, + 1307.0, + 1110.0, + 1307.0, + 1145.0, + 393.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1146.0, + 280.0, + 1146.0, + 280.0, + 1174.0, + 248.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1141.0, + 1306.0, + 1141.0, + 1306.0, + 1175.0, + 395.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1176.0, + 280.0, + 1176.0, + 280.0, + 1204.0, + 248.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1171.0, + 1307.0, + 1171.0, + 1307.0, + 1205.0, + 395.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 250.0, + 1207.0, + 277.0, + 1207.0, + 277.0, + 1233.0, + 250.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1199.0, + 1297.0, + 1199.0, + 1297.0, + 1236.0, + 393.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 250.0, + 1366.0, + 277.0, + 1366.0, + 277.0, + 1393.0, + 250.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1360.0, + 1404.0, + 1360.0, + 1404.0, + 1394.0, + 293.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1397.0, + 279.0, + 1397.0, + 279.0, + 1424.0, + 247.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1390.0, + 1407.0, + 1390.0, + 1407.0, + 1427.0, + 292.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1427.0, + 277.0, + 1427.0, + 277.0, + 1454.0, + 247.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1423.0, + 1404.0, + 1423.0, + 1404.0, + 1456.0, + 296.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1456.0, + 279.0, + 1456.0, + 279.0, + 1485.0, + 249.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1450.0, + 1406.0, + 1450.0, + 1406.0, + 1486.0, + 293.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1488.0, + 277.0, + 1488.0, + 277.0, + 1515.0, + 247.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1482.0, + 1404.0, + 1482.0, + 1404.0, + 1516.0, + 294.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1518.0, + 277.0, + 1518.0, + 277.0, + 1545.0, + 247.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1509.0, + 1406.0, + 1509.0, + 1406.0, + 1549.0, + 291.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 246.0, + 1546.0, + 280.0, + 1546.0, + 280.0, + 1577.0, + 246.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1541.0, + 1406.0, + 1541.0, + 1406.0, + 1579.0, + 294.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1579.0, + 277.0, + 1579.0, + 277.0, + 1606.0, + 247.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1573.0, + 1406.0, + 1573.0, + 1406.0, + 1607.0, + 293.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1608.0, + 277.0, + 1608.0, + 277.0, + 1636.0, + 249.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1603.0, + 1406.0, + 1603.0, + 1406.0, + 1637.0, + 293.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1640.0, + 279.0, + 1640.0, + 279.0, + 1667.0, + 247.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1633.0, + 1404.0, + 1633.0, + 1404.0, + 1667.0, + 293.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1669.0, + 277.0, + 1669.0, + 277.0, + 1695.0, + 247.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1663.0, + 1068.0, + 1663.0, + 1068.0, + 1697.0, + 294.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1715.0, + 278.0, + 1715.0, + 278.0, + 1741.0, + 248.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1711.0, + 1406.0, + 1711.0, + 1406.0, + 1743.0, + 297.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1745.0, + 277.0, + 1745.0, + 277.0, + 1772.0, + 247.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1741.0, + 1404.0, + 1741.0, + 1404.0, + 1773.0, + 297.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1776.0, + 278.0, + 1776.0, + 278.0, + 1802.0, + 248.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1769.0, + 1406.0, + 1769.0, + 1406.0, + 1804.0, + 293.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1806.0, + 278.0, + 1806.0, + 278.0, + 1832.0, + 247.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1799.0, + 1406.0, + 1799.0, + 1406.0, + 1836.0, + 294.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1837.0, + 278.0, + 1837.0, + 278.0, + 1863.0, + 248.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1830.0, + 1406.0, + 1830.0, + 1406.0, + 1867.0, + 294.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 246.0, + 1864.0, + 280.0, + 1864.0, + 280.0, + 1895.0, + 246.0, + 1895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1862.0, + 1404.0, + 1862.0, + 1404.0, + 1894.0, + 295.0, + 1894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1897.0, + 278.0, + 1897.0, + 278.0, + 1924.0, + 248.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1890.0, + 1407.0, + 1890.0, + 1407.0, + 1925.0, + 293.0, + 1925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1928.0, + 277.0, + 1928.0, + 277.0, + 1954.0, + 248.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1923.0, + 1403.0, + 1923.0, + 1403.0, + 1955.0, + 295.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1958.0, + 278.0, + 1958.0, + 278.0, + 1984.0, + 248.0, + 1984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1952.0, + 1404.0, + 1952.0, + 1404.0, + 1985.0, + 294.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 444.0, + 989.0, + 444.0, + 989.0, + 476.0, + 718.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 471.0, + 913.0, + 471.0, + 913.0, + 507.0, + 787.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 500.0, + 902.0, + 500.0, + 902.0, + 538.0, + 798.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 538.0, + 891.0, + 538.0, + 891.0, + 564.0, + 807.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2029.0, + 1390.0, + 2029.0, + 1390.0, + 2066.0, + 295.0, + 2066.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 249, + 202, + 1405, + 202, + 1405, + 537, + 249, + 537 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 251, + 1305, + 1404, + 1305, + 1404, + 1534, + 251, + 1534 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 294, + 1717, + 1403, + 1717, + 1403, + 1871, + 294, + 1871 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 254, + 1884, + 1403, + 1884, + 1403, + 2008, + 254, + 2008 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 252, + 1171, + 1404, + 1171, + 1404, + 1265, + 252, + 1265 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 250, + 551, + 1404, + 551, + 1404, + 765, + 250, + 765 + ], + "score": 0.932 + }, + { + "category_id": 0, + "poly": [ + 273, + 1583, + 1334, + 1583, + 1334, + 1622, + 273, + 1622 + ], + "score": 0.908 + }, + { + "category_id": 0, + "poly": [ + 282, + 1658, + 583, + 1658, + 583, + 1690, + 282, + 1690 + ], + "score": 0.876 + }, + { + "category_id": 1, + "poly": [ + 279, + 779, + 1407, + 779, + 1407, + 1160, + 279, + 1160 + ], + "score": 0.754 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 859, + 2061, + 859, + 2085, + 841, + 2085 + ], + "score": 0.712 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 859, + 2061, + 859, + 2085, + 841, + 2085 + ], + "score": 0.143 + }, + { + "category_id": 13, + "poly": [ + 1263, + 1340, + 1363, + 1340, + 1363, + 1369, + 1263, + 1369 + ], + "score": 0.93, + "latex": "x \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1165, + 1304, + 1253, + 1304, + 1253, + 1335, + 1165, + 1335 + ], + "score": 0.93, + "latex": "x \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 393, + 1337, + 594, + 1337, + 594, + 1373, + 393, + 1373 + ], + "score": 0.92, + "latex": "\\nabla ^ { 2 } f ( x ) \\ \\in \\ \\mathbb { R } ^ { d \\times d }" + }, + { + "category_id": 13, + "poly": [ + 882, + 1304, + 1019, + 1304, + 1019, + 1338, + 882, + 1338 + ], + "score": 0.92, + "latex": "f \\colon { \\mathbb { R } ^ { d } } \\to { \\mathbb { R } }" + }, + { + "category_id": 13, + "poly": [ + 940, + 1338, + 1107, + 1338, + 1107, + 1368, + 940, + 1368 + ], + "score": 0.91, + "latex": "F \\colon \\mathbb { R } ^ { d } \\ \\ \\mathbb { R } ^ { p }" + }, + { + "category_id": 13, + "poly": [ + 941, + 1434, + 1041, + 1434, + 1041, + 1466, + 941, + 1466 + ], + "score": 0.91, + "latex": "\\mathcal { C } \\subset \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 852, + 1501, + 925, + 1501, + 925, + 1535, + 852, + 1535 + ], + "score": 0.91, + "latex": "\\| A \\| _ { \\mathrm { o } p }" + }, + { + "category_id": 13, + "poly": [ + 582, + 1470, + 700, + 1470, + 700, + 1502, + 582, + 1502 + ], + "score": 0.91, + "latex": "I _ { \\mathit { C } } ( x ) = 0" + }, + { + "category_id": 13, + "poly": [ + 335, + 1435, + 780, + 1435, + 780, + 1469, + 335, + 1469 + ], + "score": 0.9, + "latex": "\\triangle ^ { d } : = \\{ x \\in \\mathbb { R } ^ { d } \\colon \\| x \\| _ { 1 } = 1 , x \\geq 0 \\}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1372, + 470, + 1372, + 470, + 1404, + 298, + 1404 + ], + "score": 0.89, + "latex": "\\partial F ( x ) \\in \\mathbb { R } ^ { p \\times d }" + }, + { + "category_id": 13, + "poly": [ + 353, + 1501, + 403, + 1501, + 403, + 1533, + 353, + 1533 + ], + "score": 0.89, + "latex": "\\| A \\|" + }, + { + "category_id": 13, + "poly": [ + 1294, + 1305, + 1403, + 1305, + 1403, + 1339, + 1294, + 1339 + ], + "score": 0.89, + "latex": "\\nabla f ( x ) \\in" + }, + { + "category_id": 13, + "poly": [ + 298, + 1469, + 504, + 1469, + 504, + 1502, + 298, + 1502 + ], + "score": 0.89, + "latex": "\\mathbb { R } ^ { d } \\to \\mathbb { R } \\cup \\{ + \\infty \\}" + }, + { + "category_id": 13, + "poly": [ + 714, + 1982, + 737, + 1982, + 737, + 2002, + 714, + 2002 + ], + "score": 0.88, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 806, + 1469, + 960, + 1469, + 960, + 1501, + 806, + 1501 + ], + "score": 0.88, + "latex": "I _ { C } ( x ) = + \\infty" + }, + { + "category_id": 13, + "poly": [ + 699, + 1404, + 726, + 1404, + 726, + 1434, + 699, + 1434 + ], + "score": 0.86, + "latex": "\\partial _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1222, + 1437, + 1252, + 1437, + 1252, + 1468, + 1222, + 1468 + ], + "score": 0.86, + "latex": "I _ { \\mathcal { C } }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1337, + 334, + 1337, + 334, + 1368, + 297, + 1368 + ], + "score": 0.86, + "latex": "\\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 371, + 1404, + 401, + 1404, + 401, + 1431, + 371, + 1431 + ], + "score": 0.86, + "latex": "i ^ { \\mathrm { { t h } } }" + }, + { + "category_id": 13, + "poly": [ + 606, + 1402, + 644, + 1402, + 644, + 1436, + 606, + 1436 + ], + "score": 0.86, + "latex": "\\nabla _ { i } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 555, + 1374, + 575, + 1374, + 575, + 1404, + 555, + 1404 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 1208, + 1977, + 1232, + 1977, + 1232, + 2003, + 1208, + 2003 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 608, + 1374, + 633, + 1374, + 633, + 1400, + 608, + 1400 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 778, + 644, + 803, + 644, + 803, + 670, + 778, + 670 + ], + "score": 0.82, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 727, + 1471, + 795, + 1471, + 795, + 1499, + 727, + 1499 + ], + "score": 0.82, + "latex": "x \\in { \\mathcal { C } }" + }, + { + "category_id": 13, + "poly": [ + 524, + 614, + 549, + 614, + 549, + 640, + 524, + 640 + ], + "score": 0.82, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 557, + 1404, + 592, + 1404, + 592, + 1434, + 557, + 1434 + ], + "score": 0.81, + "latex": "\\nabla _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1470, + 1355, + 1470, + 1355, + 1497, + 1332, + 1497 + ], + "score": 0.78, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 297, + 1947, + 323, + 1947, + 323, + 1973, + 297, + 1973 + ], + "score": 0.74, + "latex": "F" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1580.0, + 1340.0, + 1580.0, + 1340.0, + 1631.0, + 290.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1653.0, + 586.0, + 1653.0, + 586.0, + 1699.0, + 293.0, + 1699.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": [ + 838.0, + 2058.0, + 862.0, + 2058.0, + 862.0, + 2093.0, + 838.0, + 2093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 209.0, + 277.0, + 209.0, + 277.0, + 236.0, + 249.0, + 236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 202.0, + 1404.0, + 202.0, + 1404.0, + 240.0, + 293.0, + 240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 246.0, + 238.0, + 280.0, + 238.0, + 280.0, + 269.0, + 246.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 234.0, + 1404.0, + 234.0, + 1404.0, + 268.0, + 295.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 269.0, + 276.0, + 269.0, + 276.0, + 296.0, + 247.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 262.0, + 1407.0, + 262.0, + 1407.0, + 297.0, + 293.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 300.0, + 277.0, + 300.0, + 277.0, + 327.0, + 247.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 293.0, + 1407.0, + 293.0, + 1407.0, + 330.0, + 291.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 330.0, + 277.0, + 330.0, + 277.0, + 357.0, + 247.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 325.0, + 1405.0, + 325.0, + 1405.0, + 359.0, + 295.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 360.0, + 279.0, + 360.0, + 279.0, + 386.0, + 247.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 355.0, + 1405.0, + 355.0, + 1405.0, + 389.0, + 295.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 246.0, + 389.0, + 280.0, + 389.0, + 280.0, + 420.0, + 246.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 380.0, + 1407.0, + 380.0, + 1407.0, + 425.0, + 291.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 421.0, + 277.0, + 421.0, + 277.0, + 448.0, + 247.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 414.0, + 1405.0, + 414.0, + 1405.0, + 451.0, + 293.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 451.0, + 277.0, + 451.0, + 277.0, + 478.0, + 247.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 446.0, + 1401.0, + 446.0, + 1401.0, + 481.0, + 292.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 481.0, + 277.0, + 481.0, + 277.0, + 508.0, + 247.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 473.0, + 1407.0, + 473.0, + 1407.0, + 512.0, + 292.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 512.0, + 277.0, + 512.0, + 277.0, + 538.0, + 247.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 505.0, + 819.0, + 505.0, + 819.0, + 543.0, + 293.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1310.0, + 277.0, + 1310.0, + 277.0, + 1336.0, + 249.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1300.0, + 881.0, + 1300.0, + 881.0, + 1342.0, + 290.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 1300.0, + 1164.0, + 1300.0, + 1164.0, + 1342.0, + 1020.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 1300.0, + 1293.0, + 1300.0, + 1293.0, + 1342.0, + 1254.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 1300.0, + 1407.0, + 1300.0, + 1407.0, + 1342.0, + 1404.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1340.0, + 279.0, + 1340.0, + 279.0, + 1372.0, + 248.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1330.0, + 296.0, + 1330.0, + 296.0, + 1377.0, + 289.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1330.0, + 392.0, + 1330.0, + 392.0, + 1377.0, + 335.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 1330.0, + 939.0, + 1330.0, + 939.0, + 1377.0, + 595.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 1330.0, + 1262.0, + 1330.0, + 1262.0, + 1377.0, + 1108.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 1330.0, + 1407.0, + 1330.0, + 1407.0, + 1377.0, + 1364.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1377.0, + 278.0, + 1377.0, + 278.0, + 1404.0, + 249.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1365.0, + 297.0, + 1365.0, + 297.0, + 1409.0, + 291.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 1365.0, + 554.0, + 1365.0, + 554.0, + 1409.0, + 471.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1365.0, + 607.0, + 1365.0, + 607.0, + 1409.0, + 576.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 1365.0, + 1406.0, + 1365.0, + 1406.0, + 1409.0, + 634.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1408.0, + 278.0, + 1408.0, + 278.0, + 1434.0, + 249.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1398.0, + 370.0, + 1398.0, + 370.0, + 1440.0, + 290.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 1398.0, + 556.0, + 1398.0, + 556.0, + 1440.0, + 402.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1398.0, + 605.0, + 1398.0, + 605.0, + 1440.0, + 593.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 1398.0, + 698.0, + 1398.0, + 698.0, + 1440.0, + 645.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 1398.0, + 1407.0, + 1398.0, + 1407.0, + 1440.0, + 727.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1440.0, + 281.0, + 1440.0, + 281.0, + 1471.0, + 248.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1430.0, + 334.0, + 1430.0, + 334.0, + 1473.0, + 290.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1430.0, + 940.0, + 1430.0, + 940.0, + 1473.0, + 781.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 1430.0, + 1221.0, + 1430.0, + 1221.0, + 1473.0, + 1042.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 1430.0, + 1408.0, + 1430.0, + 1408.0, + 1473.0, + 1253.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1475.0, + 279.0, + 1475.0, + 279.0, + 1500.0, + 249.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1463.0, + 297.0, + 1463.0, + 297.0, + 1507.0, + 291.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 1463.0, + 581.0, + 1463.0, + 581.0, + 1507.0, + 505.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 1463.0, + 726.0, + 1463.0, + 726.0, + 1507.0, + 701.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1463.0, + 805.0, + 1463.0, + 805.0, + 1507.0, + 796.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 1463.0, + 1331.0, + 1463.0, + 1331.0, + 1507.0, + 961.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1356.0, + 1463.0, + 1408.0, + 1463.0, + 1408.0, + 1507.0, + 1356.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1504.0, + 279.0, + 1504.0, + 279.0, + 1531.0, + 249.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1497.0, + 352.0, + 1497.0, + 352.0, + 1535.0, + 291.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1497.0, + 851.0, + 1497.0, + 851.0, + 1535.0, + 404.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 1497.0, + 1141.0, + 1497.0, + 1141.0, + 1535.0, + 926.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1716.0, + 1403.0, + 1716.0, + 1403.0, + 1749.0, + 297.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1749.0, + 1405.0, + 1749.0, + 1405.0, + 1779.0, + 292.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1777.0, + 1405.0, + 1777.0, + 1405.0, + 1813.0, + 294.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1807.0, + 1405.0, + 1807.0, + 1405.0, + 1843.0, + 293.0, + 1843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1839.0, + 808.0, + 1839.0, + 808.0, + 1875.0, + 296.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1890.0, + 278.0, + 1890.0, + 278.0, + 1918.0, + 248.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1883.0, + 1410.0, + 1883.0, + 1410.0, + 1922.0, + 294.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1921.0, + 279.0, + 1921.0, + 279.0, + 1947.0, + 248.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1915.0, + 1405.0, + 1915.0, + 1405.0, + 1950.0, + 295.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1950.0, + 278.0, + 1950.0, + 278.0, + 1978.0, + 248.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1982.0, + 324.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1981.0, + 278.0, + 1981.0, + 278.0, + 2008.0, + 248.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1975.0, + 713.0, + 1975.0, + 713.0, + 2010.0, + 294.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1975.0, + 1207.0, + 1975.0, + 1207.0, + 2010.0, + 738.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 1975.0, + 1404.0, + 1975.0, + 1404.0, + 2010.0, + 1233.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 250.0, + 1178.0, + 279.0, + 1178.0, + 279.0, + 1202.0, + 250.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1170.0, + 1407.0, + 1170.0, + 1407.0, + 1206.0, + 291.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 252.0, + 1212.0, + 276.0, + 1212.0, + 276.0, + 1233.0, + 252.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1201.0, + 1406.0, + 1201.0, + 1406.0, + 1239.0, + 292.0, + 1239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 250.0, + 1240.0, + 279.0, + 1240.0, + 279.0, + 1264.0, + 250.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1233.0, + 1264.0, + 1233.0, + 1264.0, + 1267.0, + 291.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 250.0, + 557.0, + 277.0, + 557.0, + 277.0, + 583.0, + 250.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 549.0, + 1406.0, + 549.0, + 1406.0, + 588.0, + 290.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 588.0, + 277.0, + 588.0, + 277.0, + 614.0, + 248.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 582.0, + 1404.0, + 582.0, + 1404.0, + 616.0, + 294.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 619.0, + 278.0, + 619.0, + 278.0, + 645.0, + 248.0, + 645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 613.0, + 523.0, + 613.0, + 523.0, + 647.0, + 291.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 613.0, + 1407.0, + 613.0, + 1407.0, + 647.0, + 550.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 648.0, + 278.0, + 648.0, + 278.0, + 674.0, + 248.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 642.0, + 777.0, + 642.0, + 777.0, + 678.0, + 293.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 642.0, + 1406.0, + 642.0, + 1406.0, + 678.0, + 804.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 679.0, + 278.0, + 679.0, + 278.0, + 705.0, + 248.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 669.0, + 1407.0, + 669.0, + 1407.0, + 711.0, + 292.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 710.0, + 278.0, + 710.0, + 278.0, + 735.0, + 248.0, + 735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 702.0, + 1406.0, + 702.0, + 1406.0, + 739.0, + 293.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 739.0, + 278.0, + 739.0, + 278.0, + 765.0, + 248.0, + 765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 732.0, + 1202.0, + 732.0, + 1202.0, + 768.0, + 293.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 779.0, + 1405.0, + 779.0, + 1405.0, + 814.0, + 299.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 809.0, + 1405.0, + 809.0, + 1405.0, + 844.0, + 322.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 838.0, + 958.0, + 838.0, + 958.0, + 874.0, + 322.0, + 874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 879.0, + 1405.0, + 879.0, + 1405.0, + 917.0, + 297.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 911.0, + 1407.0, + 911.0, + 1407.0, + 949.0, + 321.0, + 949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 939.0, + 1217.0, + 939.0, + 1217.0, + 977.0, + 321.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 981.0, + 1403.0, + 981.0, + 1403.0, + 1018.0, + 299.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1013.0, + 755.0, + 1013.0, + 755.0, + 1051.0, + 320.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1052.0, + 1405.0, + 1052.0, + 1405.0, + 1090.0, + 297.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1086.0, + 1396.0, + 1086.0, + 1396.0, + 1121.0, + 320.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1124.0, + 1327.0, + 1124.0, + 1327.0, + 1161.0, + 298.0, + 1161.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 242, + 1500, + 1404, + 1500, + 1404, + 1658, + 242, + 1658 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 249, + 1091, + 1405, + 1091, + 1405, + 1217, + 249, + 1217 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 425, + 198, + 1273, + 198, + 1273, + 661, + 425, + 661 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 611, + 1331, + 1088, + 1331, + 1088, + 1412, + 611, + 1412 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 258, + 861, + 1404, + 861, + 1404, + 928, + 258, + 928 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 245, + 1426, + 1410, + 1426, + 1410, + 1490, + 245, + 1490 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 264, + 1687, + 1401, + 1687, + 1401, + 1752, + 264, + 1752 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 252, + 955, + 1406, + 955, + 1406, + 1022, + 252, + 1022 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 643, + 1870, + 1057, + 1870, + 1057, + 1910, + 643, + 1910 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 723, + 1767, + 975, + 1767, + 975, + 1807, + 723, + 1807 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 749, + 1037, + 949, + 1037, + 949, + 1076, + 749, + 1076 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 598, + 1232, + 1098, + 1232, + 1098, + 1270, + 598, + 1270 + ], + "score": 0.938 + }, + { + "category_id": 4, + "poly": [ + 296, + 678, + 1403, + 678, + 1403, + 803, + 296, + 803 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 243, + 1924, + 762, + 1924, + 762, + 1957, + 243, + 1957 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 240, + 1820, + 1136, + 1820, + 1136, + 1856, + 240, + 1856 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 252, + 1284, + 1197, + 1284, + 1197, + 1318, + 252, + 1318 + ], + "score": 0.924 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1042, + 1400, + 1042, + 1400, + 1072, + 1366, + 1072 + ], + "score": 0.895 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1337, + 1400, + 1337, + 1400, + 1368, + 1366, + 1368 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1876, + 1401, + 1876, + 1401, + 1906, + 1365, + 1906 + ], + "score": 0.859 + }, + { + "category_id": 8, + "poly": [ + 341, + 1972, + 1352, + 1972, + 1352, + 2011, + 341, + 2011 + ], + "score": 0.85 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 859, + 2061, + 859, + 2085, + 841, + 2085 + ], + "score": 0.664 + }, + { + "category_id": 2, + "poly": [ + 841, + 2061, + 859, + 2061, + 859, + 2085, + 841, + 2085 + ], + "score": 0.534 + }, + { + "category_id": 13, + "poly": [ + 832, + 1154, + 947, + 1154, + 947, + 1187, + 832, + 1187 + ], + "score": 0.94, + "latex": "x ^ { \\star } ( \\theta ) \\times \\theta" + }, + { + "category_id": 13, + "poly": [ + 984, + 990, + 1050, + 990, + 1050, + 1023, + 984, + 1023 + ], + "score": 0.94, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 14, + "poly": [ + 609, + 1331, + 1090, + 1331, + 1090, + 1413, + 609, + 1413 + ], + "score": 0.93, + "latex": "\\underbrace { - \\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) } _ { A \\in \\mathbb { R } ^ { d \\times d } } \\underbrace { \\partial x ^ { \\star } ( \\theta ) } _ { J \\in \\mathbb { R } ^ { d \\times n } } = \\underbrace { \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) } _ { B \\in \\mathbb { R } ^ { d \\times n } }" + }, + { + "category_id": 13, + "poly": [ + 913, + 1185, + 996, + 1185, + 996, + 1218, + 913, + 1218 + ], + "score": 0.93, + "latex": "{ \\partial x ^ { \\star } ( \\theta ) }" + }, + { + "category_id": 13, + "poly": [ + 1196, + 1689, + 1262, + 1689, + 1262, + 1723, + 1196, + 1723 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 429, + 1285, + 511, + 1285, + 511, + 1319, + 429, + 1319 + ], + "score": 0.92, + "latex": "{ \\partial x ^ { \\star } ( \\theta ) }" + }, + { + "category_id": 13, + "poly": [ + 503, + 1124, + 569, + 1124, + 569, + 1156, + 503, + 1156 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 14, + "poly": [ + 641, + 1870, + 1059, + 1870, + 1059, + 1910, + 641, + 1910 + ], + "score": 0.92, + "latex": "F ( x ^ { \\star } ( \\theta ) , \\theta ) = T ( x ^ { \\star } ( \\theta ) , \\theta ) - x ^ { \\star } ( \\theta ) ." + }, + { + "category_id": 14, + "poly": [ + 724, + 1766, + 973, + 1766, + 973, + 1806, + 724, + 1806 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta ) = T ( x ^ { \\star } ( \\theta ) , \\theta ) ," + }, + { + "category_id": 13, + "poly": [ + 298, + 710, + 380, + 710, + 380, + 744, + 298, + 744 + ], + "score": 0.92, + "latex": "f ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 438, + 1093, + 505, + 1093, + 505, + 1126, + 438, + 1126 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 14, + "poly": [ + 747, + 1036, + 952, + 1036, + 952, + 1076, + 747, + 1076 + ], + "score": 0.92, + "latex": "F ( x ^ { \\star } ( \\theta ) , \\theta ) = 0 ." + }, + { + "category_id": 13, + "poly": [ + 371, + 1820, + 593, + 1820, + 593, + 1852, + 371, + 1852 + ], + "score": 0.92, + "latex": "T \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1321, + 1154, + 1403, + 1154, + 1403, + 1188, + 1321, + 1188 + ], + "score": 0.91, + "latex": "{ \\partial x ^ { \\star } ( \\theta ) }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1456, + 497, + 1456, + 497, + 1492, + 298, + 1492 + ], + "score": 0.91, + "latex": "\\nabla x ^ { \\star } ( \\theta ) = B ^ { \\top } / A" + }, + { + "category_id": 13, + "poly": [ + 630, + 957, + 856, + 957, + 856, + 988, + 630, + 988 + ], + "score": 0.91, + "latex": "F \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1098, + 1091, + 1273, + 1091, + 1273, + 1122, + 1098, + 1122 + ], + "score": 0.91, + "latex": "x ^ { \\star } \\colon { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 933, + 1094, + 1030, + 1094, + 1030, + 1122, + 933, + 1122 + ], + "score": 0.91, + "latex": "\\theta \\in \\mathbb { R } ^ { n }" + }, + { + "category_id": 14, + "poly": [ + 600, + 1231, + 1098, + 1231, + 1098, + 1271, + 600, + 1271 + ], + "score": 0.9, + "latex": "\\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) \\partial x ^ { \\star } ( \\theta ) + \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = 0 ." + }, + { + "category_id": 13, + "poly": [ + 1262, + 771, + 1343, + 771, + 1343, + 799, + 1262, + 799 + ], + "score": 0.9, + "latex": "\\theta = 1 0" + }, + { + "category_id": 13, + "poly": [ + 639, + 1155, + 691, + 1155, + 691, + 1185, + 639, + 1185 + ], + "score": 0.9, + "latex": "\\partial _ { 1 } F" + }, + { + "category_id": 14, + "poly": [ + 344, + 1971, + 1350, + 1971, + 1350, + 2010, + 344, + 2010 + ], + "score": 0.89, + "latex": "A = - \\partial _ { 1 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = I - \\partial _ { 1 } T ( x ^ { \\star } ( \\theta ) , \\theta ) \\quad \\mathrm { a n d } \\quad B = \\partial _ { 2 } F ( x ^ { \\star } ( \\theta ) , \\theta ) = \\partial _ { 2 } T ( x ^ { \\star } ( \\theta ) , \\theta ) ." + }, + { + "category_id": 13, + "poly": [ + 892, + 1428, + 962, + 1428, + 962, + 1457, + 892, + 1457 + ], + "score": 0.86, + "latex": "\\dot { d } = 1 \\dot { }" + }, + { + "category_id": 13, + "poly": [ + 1194, + 1125, + 1219, + 1125, + 1219, + 1151, + 1194, + 1151 + ], + "score": 0.85, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 1281, + 991, + 1305, + 991, + 1305, + 1017, + 1281, + 1017 + ], + "score": 0.85, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 584, + 1459, + 608, + 1459, + 608, + 1485, + 584, + 1485 + ], + "score": 0.84, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 956, + 1565, + 981, + 1565, + 981, + 1591, + 956, + 1591 + ], + "score": 0.82, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 928, + 712, + 953, + 712, + 953, + 739, + 928, + 739 + ], + "score": 0.8, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 640, + 1125, + 657, + 1125, + 657, + 1151, + 640, + 1151 + ], + "score": 0.74, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 574, + 292, + 597, + 292, + 597, + 313, + 574, + 313 + ], + "score": 0.72, + "latex": "=" + }, + { + "category_id": 13, + "poly": [ + 847, + 321, + 868, + 321, + 868, + 342, + 847, + 342 + ], + "score": 0.64, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 465, + 516, + 524, + 516, + 524, + 542, + 465, + 542 + ], + "score": 0.54, + "latex": "\\tt X y \\mathrm { ~ = ~ }" + }, + { + "category_id": 13, + "poly": [ + 798, + 575, + 818, + 575, + 818, + 595, + 798, + 595 + ], + "score": 0.51, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 774, + 320, + 806, + 320, + 806, + 343, + 774, + 343 + ], + "score": 0.5, + "latex": "^ { * * }" + }, + { + "category_id": 13, + "poly": [ + 465, + 488, + 524, + 488, + 524, + 513, + 465, + 513 + ], + "score": 0.5, + "latex": "{ \\texttt { X X } } =" + }, + { + "category_id": 13, + "poly": [ + 465, + 545, + 512, + 545, + 512, + 569, + 465, + 569 + ], + "score": 0.48, + "latex": "\\mathrm { ~ T ~ } =" + }, + { + "category_id": 13, + "poly": [ + 573, + 209, + 598, + 209, + 598, + 229, + 573, + 229 + ], + "score": 0.48, + "latex": "=" + }, + { + "category_id": 13, + "poly": [ + 947, + 321, + 967, + 321, + 967, + 342, + 947, + 342 + ], + "score": 0.4, + "latex": "^ *" + }, + { + "category_id": 13, + "poly": [ + 440, + 375, + 485, + 375, + 485, + 400, + 440, + 400 + ], + "score": 0.26, + "latex": "\\begin{array} { r l } { \\mathbb { F } } & { { } = } \\end{array}" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 204.0, + 572.0, + 204.0, + 572.0, + 234.0, + 438.0, + 234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 204.0, + 740.0, + 204.0, + 740.0, + 234.0, + 599.0, + 234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 260.0, + 643.0, + 260.0, + 643.0, + 288.0, + 441.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 288.0, + 573.0, + 288.0, + 573.0, + 318.0, + 463.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 288.0, + 894.0, + 288.0, + 894.0, + 318.0, + 598.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 316.0, + 773.0, + 316.0, + 773.0, + 346.0, + 463.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 316.0, + 846.0, + 316.0, + 846.0, + 346.0, + 807.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 316.0, + 946.0, + 316.0, + 946.0, + 346.0, + 869.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 316.0, + 1226.0, + 316.0, + 1226.0, + 346.0, + 968.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 372.0, + 631.0, + 372.0, + 631.0, + 403.0, + 486.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 430.0, + 631.0, + 430.0, + 631.0, + 458.0, + 440.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 459.0, + 741.0, + 459.0, + 741.0, + 486.0, + 441.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 486.0, + 791.0, + 486.0, + 791.0, + 514.0, + 525.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 515.0, + 792.0, + 515.0, + 792.0, + 544.0, + 525.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 543.0, + 792.0, + 543.0, + 792.0, + 571.0, + 513.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 571.0, + 797.0, + 571.0, + 797.0, + 602.0, + 464.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 571.0, + 1000.0, + 571.0, + 1000.0, + 602.0, + 819.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 627.0, + 927.0, + 627.0, + 927.0, + 656.0, + 438.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 678.0, + 1405.0, + 678.0, + 1405.0, + 715.0, + 294.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 709.0, + 927.0, + 709.0, + 927.0, + 745.0, + 381.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 709.0, + 1404.0, + 709.0, + 1404.0, + 745.0, + 954.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 741.0, + 1406.0, + 741.0, + 1406.0, + 774.0, + 294.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 771.0, + 1261.0, + 771.0, + 1261.0, + 803.0, + 294.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 771.0, + 1352.0, + 771.0, + 1352.0, + 803.0, + 1344.0, + 803.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": [ + 838.0, + 2058.0, + 862.0, + 2058.0, + 862.0, + 2091.0, + 838.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1508.0, + 277.0, + 1508.0, + 277.0, + 1533.0, + 241.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1502.0, + 1408.0, + 1502.0, + 1408.0, + 1536.0, + 295.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1537.0, + 277.0, + 1537.0, + 277.0, + 1567.0, + 239.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1533.0, + 1405.0, + 1533.0, + 1405.0, + 1567.0, + 296.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1570.0, + 277.0, + 1570.0, + 277.0, + 1595.0, + 241.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1564.0, + 955.0, + 1564.0, + 955.0, + 1598.0, + 295.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 1564.0, + 1404.0, + 1564.0, + 1404.0, + 1598.0, + 982.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1598.0, + 279.0, + 1598.0, + 279.0, + 1627.0, + 239.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1591.0, + 1407.0, + 1591.0, + 1407.0, + 1630.0, + 293.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1631.0, + 277.0, + 1631.0, + 277.0, + 1657.0, + 241.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1625.0, + 915.0, + 1625.0, + 915.0, + 1658.0, + 295.0, + 1658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1099.0, + 279.0, + 1099.0, + 279.0, + 1126.0, + 247.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1089.0, + 437.0, + 1089.0, + 437.0, + 1129.0, + 293.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 1089.0, + 932.0, + 1089.0, + 932.0, + 1129.0, + 506.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 1089.0, + 1097.0, + 1089.0, + 1097.0, + 1129.0, + 1031.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1089.0, + 1405.0, + 1089.0, + 1405.0, + 1129.0, + 1274.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1129.0, + 279.0, + 1129.0, + 279.0, + 1155.0, + 247.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1119.0, + 502.0, + 1119.0, + 502.0, + 1160.0, + 291.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 1119.0, + 639.0, + 1119.0, + 639.0, + 1160.0, + 570.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1119.0, + 1193.0, + 1119.0, + 1193.0, + 1160.0, + 658.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 1119.0, + 1405.0, + 1119.0, + 1405.0, + 1160.0, + 1220.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1158.0, + 279.0, + 1158.0, + 279.0, + 1186.0, + 247.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1150.0, + 638.0, + 1150.0, + 638.0, + 1191.0, + 292.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 1150.0, + 831.0, + 1150.0, + 831.0, + 1191.0, + 692.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 1150.0, + 1320.0, + 1150.0, + 1320.0, + 1191.0, + 948.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 1150.0, + 1407.0, + 1150.0, + 1407.0, + 1191.0, + 1404.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1189.0, + 279.0, + 1189.0, + 279.0, + 1216.0, + 247.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1184.0, + 912.0, + 1184.0, + 912.0, + 1219.0, + 293.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1184.0, + 1094.0, + 1184.0, + 1094.0, + 1219.0, + 997.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 252.0, + 871.0, + 277.0, + 871.0, + 277.0, + 893.0, + 252.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 859.0, + 1406.0, + 859.0, + 1406.0, + 901.0, + 290.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 251.0, + 901.0, + 279.0, + 901.0, + 279.0, + 926.0, + 251.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 893.0, + 752.0, + 893.0, + 752.0, + 930.0, + 291.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1434.0, + 278.0, + 1434.0, + 278.0, + 1459.0, + 248.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1423.0, + 891.0, + 1423.0, + 891.0, + 1463.0, + 293.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 1423.0, + 1405.0, + 1423.0, + 1405.0, + 1463.0, + 963.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1463.0, + 279.0, + 1463.0, + 279.0, + 1489.0, + 249.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1455.0, + 297.0, + 1455.0, + 297.0, + 1491.0, + 293.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1455.0, + 583.0, + 1455.0, + 583.0, + 1491.0, + 498.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 1455.0, + 801.0, + 1455.0, + 801.0, + 1491.0, + 609.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 253.0, + 1689.0, + 1195.0, + 1689.0, + 1195.0, + 1725.0, + 253.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 1689.0, + 1402.0, + 1689.0, + 1402.0, + 1725.0, + 1263.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 253.0, + 1719.0, + 746.0, + 1719.0, + 746.0, + 1756.0, + 253.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 965.0, + 279.0, + 965.0, + 279.0, + 990.0, + 249.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 286.0, + 952.0, + 629.0, + 952.0, + 629.0, + 996.0, + 286.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 952.0, + 1409.0, + 952.0, + 1409.0, + 996.0, + 857.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 987.0, + 983.0, + 987.0, + 983.0, + 1024.0, + 242.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 987.0, + 1280.0, + 987.0, + 1280.0, + 1024.0, + 1051.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 987.0, + 1319.0, + 987.0, + 1319.0, + 1024.0, + 1306.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1923.0, + 763.0, + 1923.0, + 763.0, + 1959.0, + 241.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1816.0, + 370.0, + 1816.0, + 370.0, + 1861.0, + 235.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1816.0, + 1139.0, + 1816.0, + 1139.0, + 1861.0, + 594.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 1281.0, + 428.0, + 1281.0, + 428.0, + 1323.0, + 242.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1281.0, + 1201.0, + 1281.0, + 1201.0, + 1323.0, + 512.0, + 1323.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 244, + 1288, + 1405, + 1288, + 1405, + 1624, + 244, + 1624 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 242, + 787, + 1404, + 787, + 1404, + 1092, + 242, + 1092 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 241, + 603, + 1404, + 603, + 1404, + 756, + 241, + 756 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 241, + 202, + 1405, + 202, + 1405, + 417, + 241, + 417 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 242, + 1121, + 1404, + 1121, + 1404, + 1273, + 242, + 1273 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 241, + 429, + 1403, + 429, + 1403, + 590, + 241, + 590 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 707, + 1872, + 990, + 1872, + 990, + 1927, + 707, + 1927 + ], + "score": 0.928 + }, + { + "category_id": 8, + "poly": [ + 725, + 1973, + 973, + 1973, + 973, + 2011, + 725, + 2011 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 246, + 1936, + 1353, + 1936, + 1353, + 1970, + 246, + 1970 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 270, + 1834, + 1400, + 1834, + 1400, + 1868, + 270, + 1868 + ], + "score": 0.904 + }, + { + "category_id": 0, + "poly": [ + 298, + 1656, + 479, + 1656, + 479, + 1688, + 298, + 1688 + ], + "score": 0.867 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1978, + 1400, + 1978, + 1400, + 2006, + 1366, + 2006 + ], + "score": 0.831 + }, + { + "category_id": 1, + "poly": [ + 296, + 1711, + 1404, + 1711, + 1404, + 1806, + 296, + 1806 + ], + "score": 0.83 + }, + { + "category_id": 2, + "poly": [ + 840, + 2061, + 859, + 2061, + 859, + 2084, + 840, + 2084 + ], + "score": 0.78 + }, + { + "category_id": 14, + "poly": [ + 707, + 1870, + 989, + 1870, + 989, + 1929, + 707, + 1929 + ], + "score": 0.93, + "latex": "x ^ { \\star } ( \\theta ) = \\operatorname * { a r g m i n } _ { x \\in \\mathbb { R } ^ { d } } f ( x , \\theta ) ," + }, + { + "category_id": 13, + "poly": [ + 1017, + 1348, + 1135, + 1348, + 1135, + 1382, + 1017, + 1382 + ], + "score": 0.93, + "latex": "\\nabla _ { 1 } f ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 738, + 430, + 875, + 430, + 875, + 464, + 738, + 464 + ], + "score": 0.93, + "latex": "J = \\partial x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1308, + 937, + 1374, + 937, + 1374, + 971, + 1308, + 971 + ], + "score": 0.93, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1286, + 998, + 1352, + 998, + 1352, + 1031, + 1286, + 1031 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1170, + 907, + 1238, + 907, + 1238, + 940, + 1170, + 940 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 420, + 463, + 570, + 463, + 570, + 496, + 420, + 496 + ], + "score": 0.92, + "latex": "A ( J v ) = B v" + }, + { + "category_id": 13, + "poly": [ + 982, + 877, + 1048, + 877, + 1048, + 910, + 982, + 910 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1187, + 264, + 1253, + 264, + 1253, + 297, + 1187, + 297 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 372, + 1935, + 575, + 1935, + 575, + 1970, + 372, + 1970 + ], + "score": 0.92, + "latex": "f \\colon { \\mathbb { R } ^ { d } } \\times { \\mathbb { R } ^ { n } } \\to { \\mathbb { R } }" + }, + { + "category_id": 13, + "poly": [ + 1183, + 692, + 1334, + 692, + 1334, + 722, + 1183, + 722 + ], + "score": 0.91, + "latex": "A A ^ { \\top } u = A v" + }, + { + "category_id": 13, + "poly": [ + 1239, + 1319, + 1292, + 1319, + 1292, + 1349, + 1239, + 1349 + ], + "score": 0.91, + "latex": "\\partial _ { 1 } F" + }, + { + "category_id": 13, + "poly": [ + 572, + 234, + 624, + 234, + 624, + 264, + 572, + 264 + ], + "score": 0.9, + "latex": "\\partial _ { 2 } F" + }, + { + "category_id": 13, + "poly": [ + 386, + 495, + 496, + 495, + 496, + 525, + 386, + 525 + ], + "score": 0.9, + "latex": "A ^ { \\top } u = v" + }, + { + "category_id": 13, + "poly": [ + 740, + 494, + 794, + 494, + 794, + 525, + 740, + 525 + ], + "score": 0.9, + "latex": "v ^ { \\top } J" + }, + { + "category_id": 13, + "poly": [ + 832, + 494, + 1092, + 494, + 1092, + 525, + 832, + 525 + ], + "score": 0.9, + "latex": "\\boldsymbol { v } ^ { \\top } \\boldsymbol { J } = \\boldsymbol { u } ^ { \\top } \\boldsymbol { A } \\boldsymbol { J } = \\boldsymbol { u } ^ { \\top } \\boldsymbol { B }" + }, + { + "category_id": 13, + "poly": [ + 1346, + 1319, + 1398, + 1319, + 1398, + 1348, + 1346, + 1348 + ], + "score": 0.9, + "latex": "\\partial _ { 2 } F" + }, + { + "category_id": 13, + "poly": [ + 464, + 234, + 517, + 234, + 517, + 264, + 464, + 264 + ], + "score": 0.9, + "latex": "\\partial _ { 1 } F" + }, + { + "category_id": 13, + "poly": [ + 895, + 526, + 1005, + 526, + 1005, + 556, + 895, + 556 + ], + "score": 0.9, + "latex": "A ^ { \\top } u = v" + }, + { + "category_id": 13, + "poly": [ + 913, + 1559, + 1067, + 1559, + 1067, + 1590, + 913, + 1590 + ], + "score": 0.9, + "latex": "{ \\bar { A } } A ^ { \\top } u \\stackrel { = } { = } A v" + }, + { + "category_id": 14, + "poly": [ + 724, + 1972, + 974, + 1972, + 974, + 2010, + 724, + 2010 + ], + "score": 0.89, + "latex": "F ( x , \\theta ) = \\nabla _ { 1 } f ( x , \\theta ) ." + }, + { + "category_id": 13, + "poly": [ + 937, + 461, + 972, + 461, + 972, + 491, + 937, + 491 + ], + "score": 0.89, + "latex": "v ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 990, + 1744, + 1015, + 1744, + 1015, + 1770, + 990, + 1770 + ], + "score": 0.85, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 423, + 1441, + 448, + 1441, + 448, + 1467, + 423, + 1467 + ], + "score": 0.84, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 974, + 1939, + 998, + 1939, + 998, + 1965, + 974, + 1965 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 957, + 296, + 982, + 296, + 982, + 322, + 957, + 322 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 556, + 1350, + 581, + 1350, + 581, + 1376, + 556, + 1376 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 501, + 356, + 526, + 356, + 526, + 382, + 501, + 382 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 1022, + 326, + 1046, + 326, + 1046, + 352, + 1022, + 352 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 1250, + 665, + 1275, + 665, + 1275, + 690, + 1250, + 690 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 777, + 1714, + 803, + 1714, + 803, + 1741, + 777, + 1741 + ], + "score": 0.82, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 1086, + 205, + 1110, + 205, + 1110, + 231, + 1086, + 231 + ], + "score": 0.82, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 892, + 1320, + 917, + 1320, + 917, + 1346, + 892, + 1346 + ], + "score": 0.81, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 1048, + 1744, + 1071, + 1744, + 1071, + 1770, + 1048, + 1770 + ], + "score": 0.81, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1060, + 1714, + 1083, + 1714, + 1083, + 1741, + 1060, + 1741 + ], + "score": 0.81, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 951, + 635, + 975, + 635, + 975, + 661, + 951, + 661 + ], + "score": 0.81, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 1279, + 497, + 1305, + 497, + 1305, + 524, + 1279, + 524 + ], + "score": 0.81, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 1335, + 1350, + 1391, + 1350, + 1391, + 1380, + 1335, + 1380 + ], + "score": 0.79, + "latex": "\\ S 2 . 2 \\AA ," + }, + { + "category_id": 13, + "poly": [ + 1049, + 432, + 1084, + 432, + 1084, + 459, + 1049, + 459 + ], + "score": 0.78, + "latex": "J v" + }, + { + "category_id": 13, + "poly": [ + 632, + 909, + 650, + 909, + 650, + 935, + 632, + 935 + ], + "score": 0.78, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1254, + 605, + 1278, + 605, + 1278, + 631, + 1254, + 631 + ], + "score": 0.76, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 714, + 1441, + 738, + 1441, + 738, + 1467, + 714, + 1467 + ], + "score": 0.76, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1342, + 788, + 1360, + 788, + 1360, + 814, + 1342, + 814 + ], + "score": 0.75, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 339, + 529, + 363, + 529, + 363, + 555, + 339, + 555 + ], + "score": 0.74, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 413, + 533, + 431, + 533, + 431, + 555, + 413, + 555 + ], + "score": 0.71, + "latex": "v" + }, + { + "category_id": 13, + "poly": [ + 1021, + 437, + 1038, + 437, + 1038, + 458, + 1021, + 458 + ], + "score": 0.67, + "latex": "v" + }, + { + "category_id": 13, + "poly": [ + 1033, + 462, + 1118, + 462, + 1118, + 493, + 1033, + 493 + ], + "score": 0.56, + "latex": "J , v ^ { \\top } J" + }, + { + "category_id": 13, + "poly": [ + 817, + 818, + 834, + 818, + 834, + 844, + 817, + 844 + ], + "score": 0.52, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1003, + 1533, + 1121, + 1533, + 1121, + 1562, + 1003, + 1562 + ], + "score": 0.32, + "latex": "{ \\mathrm { j a x . v m a p } }" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1649.0, + 483.0, + 1649.0, + 483.0, + 1696.0, + 292.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 2059.0, + 863.0, + 2059.0, + 863.0, + 2091.0, + 838.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1294.0, + 275.0, + 1294.0, + 275.0, + 1320.0, + 240.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1287.0, + 1404.0, + 1287.0, + 1404.0, + 1321.0, + 294.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1322.0, + 278.0, + 1322.0, + 278.0, + 1352.0, + 239.0, + 1352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1317.0, + 891.0, + 1317.0, + 891.0, + 1351.0, + 292.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1317.0, + 1238.0, + 1317.0, + 1238.0, + 1351.0, + 918.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1293.0, + 1317.0, + 1345.0, + 1317.0, + 1345.0, + 1351.0, + 1293.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1317.0, + 1408.0, + 1317.0, + 1408.0, + 1351.0, + 1399.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1354.0, + 277.0, + 1354.0, + 277.0, + 1380.0, + 240.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1347.0, + 555.0, + 1347.0, + 555.0, + 1385.0, + 294.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 1347.0, + 1016.0, + 1347.0, + 1016.0, + 1385.0, + 582.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1347.0, + 1334.0, + 1347.0, + 1334.0, + 1385.0, + 1136.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1392.0, + 1347.0, + 1408.0, + 1347.0, + 1408.0, + 1385.0, + 1392.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1384.0, + 278.0, + 1384.0, + 278.0, + 1410.0, + 240.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1377.0, + 1405.0, + 1377.0, + 1405.0, + 1415.0, + 294.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1414.0, + 278.0, + 1414.0, + 278.0, + 1444.0, + 239.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1407.0, + 1405.0, + 1407.0, + 1405.0, + 1446.0, + 293.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1445.0, + 278.0, + 1445.0, + 278.0, + 1471.0, + 240.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1440.0, + 422.0, + 1440.0, + 422.0, + 1474.0, + 295.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1440.0, + 713.0, + 1440.0, + 713.0, + 1474.0, + 449.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1440.0, + 1405.0, + 1440.0, + 1405.0, + 1474.0, + 739.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1474.0, + 278.0, + 1474.0, + 278.0, + 1504.0, + 239.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1468.0, + 1408.0, + 1468.0, + 1408.0, + 1506.0, + 294.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1506.0, + 277.0, + 1506.0, + 277.0, + 1532.0, + 239.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1501.0, + 1405.0, + 1501.0, + 1405.0, + 1535.0, + 295.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1536.0, + 277.0, + 1536.0, + 277.0, + 1562.0, + 240.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1524.0, + 1002.0, + 1524.0, + 1002.0, + 1571.0, + 291.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 1524.0, + 1406.0, + 1524.0, + 1406.0, + 1571.0, + 1122.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1565.0, + 278.0, + 1565.0, + 278.0, + 1595.0, + 239.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1555.0, + 912.0, + 1555.0, + 912.0, + 1598.0, + 293.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1068.0, + 1555.0, + 1406.0, + 1555.0, + 1406.0, + 1598.0, + 1068.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1598.0, + 277.0, + 1598.0, + 277.0, + 1624.0, + 240.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1591.0, + 1133.0, + 1591.0, + 1133.0, + 1629.0, + 293.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 791.0, + 279.0, + 791.0, + 279.0, + 819.0, + 241.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 788.0, + 1341.0, + 788.0, + 1341.0, + 819.0, + 295.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1361.0, + 788.0, + 1404.0, + 788.0, + 1404.0, + 819.0, + 1361.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 821.0, + 277.0, + 821.0, + 277.0, + 850.0, + 239.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 818.0, + 816.0, + 818.0, + 816.0, + 850.0, + 295.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 818.0, + 1405.0, + 818.0, + 1405.0, + 850.0, + 835.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 851.0, + 279.0, + 851.0, + 279.0, + 879.0, + 239.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 846.0, + 1405.0, + 846.0, + 1405.0, + 881.0, + 293.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 883.0, + 279.0, + 883.0, + 279.0, + 910.0, + 239.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 876.0, + 981.0, + 876.0, + 981.0, + 912.0, + 292.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 876.0, + 1407.0, + 876.0, + 1407.0, + 912.0, + 1049.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 913.0, + 279.0, + 913.0, + 279.0, + 941.0, + 239.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 907.0, + 631.0, + 907.0, + 631.0, + 941.0, + 292.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 907.0, + 1169.0, + 907.0, + 1169.0, + 941.0, + 651.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 907.0, + 1407.0, + 907.0, + 1407.0, + 941.0, + 1239.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 942.0, + 277.0, + 942.0, + 277.0, + 970.0, + 239.0, + 970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 937.0, + 1307.0, + 937.0, + 1307.0, + 972.0, + 293.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 937.0, + 1407.0, + 937.0, + 1407.0, + 972.0, + 1375.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 974.0, + 279.0, + 974.0, + 279.0, + 1002.0, + 239.0, + 1002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 969.0, + 1405.0, + 969.0, + 1405.0, + 1004.0, + 293.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1004.0, + 279.0, + 1004.0, + 279.0, + 1032.0, + 239.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 998.0, + 1285.0, + 998.0, + 1285.0, + 1033.0, + 293.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 998.0, + 1407.0, + 998.0, + 1407.0, + 1033.0, + 1353.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1033.0, + 280.0, + 1033.0, + 280.0, + 1061.0, + 239.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1029.0, + 1405.0, + 1029.0, + 1405.0, + 1065.0, + 292.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1065.0, + 279.0, + 1065.0, + 279.0, + 1093.0, + 239.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1058.0, + 1100.0, + 1058.0, + 1100.0, + 1096.0, + 292.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 608.0, + 277.0, + 608.0, + 277.0, + 633.0, + 241.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 602.0, + 1253.0, + 602.0, + 1253.0, + 639.0, + 294.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 602.0, + 1405.0, + 602.0, + 1405.0, + 639.0, + 1279.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 637.0, + 279.0, + 637.0, + 279.0, + 666.0, + 240.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 631.0, + 950.0, + 631.0, + 950.0, + 669.0, + 292.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 631.0, + 1408.0, + 631.0, + 1408.0, + 669.0, + 976.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 669.0, + 278.0, + 669.0, + 278.0, + 694.0, + 241.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 664.0, + 1249.0, + 664.0, + 1249.0, + 697.0, + 292.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 664.0, + 1405.0, + 664.0, + 1405.0, + 697.0, + 1276.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 698.0, + 280.0, + 698.0, + 280.0, + 727.0, + 238.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 689.0, + 1182.0, + 689.0, + 1182.0, + 732.0, + 291.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 689.0, + 1407.0, + 689.0, + 1407.0, + 732.0, + 1335.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 731.0, + 278.0, + 731.0, + 278.0, + 756.0, + 241.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 724.0, + 959.0, + 724.0, + 959.0, + 760.0, + 292.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 207.0, + 279.0, + 207.0, + 279.0, + 238.0, + 238.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 200.0, + 1085.0, + 200.0, + 1085.0, + 241.0, + 292.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 200.0, + 1406.0, + 200.0, + 1406.0, + 241.0, + 1111.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 239.0, + 278.0, + 239.0, + 278.0, + 266.0, + 240.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 231.0, + 463.0, + 231.0, + 463.0, + 270.0, + 292.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 231.0, + 571.0, + 231.0, + 571.0, + 270.0, + 518.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 231.0, + 1406.0, + 231.0, + 1406.0, + 270.0, + 625.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 269.0, + 275.0, + 269.0, + 275.0, + 295.0, + 240.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 263.0, + 1186.0, + 263.0, + 1186.0, + 298.0, + 295.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 263.0, + 1406.0, + 263.0, + 1406.0, + 298.0, + 1254.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 300.0, + 278.0, + 300.0, + 278.0, + 326.0, + 240.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 293.0, + 956.0, + 293.0, + 956.0, + 332.0, + 294.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 293.0, + 1408.0, + 293.0, + 1408.0, + 332.0, + 983.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 328.0, + 279.0, + 328.0, + 279.0, + 359.0, + 238.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 324.0, + 1021.0, + 324.0, + 1021.0, + 359.0, + 295.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 324.0, + 1406.0, + 324.0, + 1406.0, + 359.0, + 1047.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 360.0, + 278.0, + 360.0, + 278.0, + 387.0, + 240.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 354.0, + 500.0, + 354.0, + 500.0, + 390.0, + 295.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 527.0, + 354.0, + 1405.0, + 354.0, + 1405.0, + 390.0, + 527.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 390.0, + 278.0, + 390.0, + 278.0, + 416.0, + 240.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 383.0, + 844.0, + 383.0, + 844.0, + 419.0, + 292.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1126.0, + 279.0, + 1126.0, + 279.0, + 1155.0, + 239.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1121.0, + 1405.0, + 1121.0, + 1405.0, + 1154.0, + 296.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1158.0, + 277.0, + 1158.0, + 277.0, + 1183.0, + 241.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1148.0, + 1408.0, + 1148.0, + 1408.0, + 1187.0, + 292.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1188.0, + 277.0, + 1188.0, + 277.0, + 1213.0, + 241.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1177.0, + 1407.0, + 1177.0, + 1407.0, + 1221.0, + 292.0, + 1221.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1217.0, + 279.0, + 1217.0, + 279.0, + 1246.0, + 239.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1207.0, + 1407.0, + 1207.0, + 1407.0, + 1251.0, + 292.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1249.0, + 277.0, + 1249.0, + 277.0, + 1274.0, + 241.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1243.0, + 987.0, + 1243.0, + 987.0, + 1276.0, + 293.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 436.0, + 278.0, + 436.0, + 278.0, + 462.0, + 241.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 428.0, + 737.0, + 428.0, + 737.0, + 466.0, + 292.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 428.0, + 1020.0, + 428.0, + 1020.0, + 466.0, + 876.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 428.0, + 1048.0, + 428.0, + 1048.0, + 466.0, + 1039.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 428.0, + 1404.0, + 428.0, + 1404.0, + 466.0, + 1085.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 469.0, + 276.0, + 469.0, + 276.0, + 495.0, + 241.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 461.0, + 419.0, + 461.0, + 419.0, + 499.0, + 292.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 571.0, + 461.0, + 936.0, + 461.0, + 936.0, + 499.0, + 571.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 461.0, + 1032.0, + 461.0, + 1032.0, + 499.0, + 973.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 461.0, + 1404.0, + 461.0, + 1404.0, + 499.0, + 1119.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 501.0, + 278.0, + 501.0, + 278.0, + 527.0, + 241.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 490.0, + 385.0, + 490.0, + 385.0, + 534.0, + 291.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 490.0, + 739.0, + 490.0, + 739.0, + 534.0, + 497.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 490.0, + 831.0, + 490.0, + 831.0, + 534.0, + 795.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 490.0, + 1278.0, + 490.0, + 1278.0, + 534.0, + 1093.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 490.0, + 1404.0, + 490.0, + 1404.0, + 534.0, + 1306.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 533.0, + 278.0, + 533.0, + 278.0, + 558.0, + 240.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 522.0, + 338.0, + 522.0, + 338.0, + 565.0, + 292.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 522.0, + 412.0, + 522.0, + 412.0, + 565.0, + 364.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 522.0, + 894.0, + 522.0, + 894.0, + 565.0, + 432.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 522.0, + 1404.0, + 522.0, + 1404.0, + 565.0, + 1006.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 561.0, + 280.0, + 561.0, + 280.0, + 590.0, + 238.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 553.0, + 1082.0, + 553.0, + 1082.0, + 594.0, + 291.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1929.0, + 371.0, + 1929.0, + 371.0, + 1980.0, + 236.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1929.0, + 973.0, + 1929.0, + 973.0, + 1980.0, + 576.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 1929.0, + 1354.0, + 1929.0, + 1354.0, + 1980.0, + 999.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 260.0, + 1829.0, + 1405.0, + 1829.0, + 1405.0, + 1875.0, + 260.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1709.0, + 776.0, + 1709.0, + 776.0, + 1749.0, + 293.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1709.0, + 1059.0, + 1709.0, + 1059.0, + 1749.0, + 804.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 1709.0, + 1406.0, + 1709.0, + 1406.0, + 1749.0, + 1084.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1743.0, + 989.0, + 1743.0, + 989.0, + 1777.0, + 296.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 1743.0, + 1047.0, + 1743.0, + 1047.0, + 1777.0, + 1016.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1743.0, + 1405.0, + 1743.0, + 1405.0, + 1777.0, + 1072.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1774.0, + 1337.0, + 1774.0, + 1337.0, + 1808.0, + 295.0, + 1808.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 348, + 259, + 1351, + 259, + 1351, + 580, + 348, + 580 + ], + "score": 0.984, + "html": "
NameEquationSolution neededOracles needed
Stationary(4), (5)PrimalVif
KKT(6)Primal and dualVif,H,G,δH,δG
Proximal gradient(7)PrimalVif,proxng
Projected gradient(9)PrimalVif,projc
Mirror descent(11)PrimalV1f,proje,
Newton(15)Primal[V²f(x,0)]-1,Vif(x,0)
Block proximal gradient(16)Primal[Vif]j,[proXnglj
Conic programming(20)Residual map rootprojRp ×K* ×R+
" + }, + { + "category_id": 1, + "poly": [ + 242, + 643, + 1404, + 643, + 1404, + 740, + 242, + 740 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 242, + 1265, + 1405, + 1265, + 1405, + 1456, + 242, + 1456 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 242, + 1484, + 1406, + 1484, + 1406, + 1578, + 242, + 1578 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 251, + 891, + 1405, + 891, + 1405, + 986, + 251, + 986 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 242, + 1914, + 1403, + 1914, + 1403, + 2009, + 242, + 2009 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 567, + 1137, + 1135, + 1137, + 1135, + 1255, + 567, + 1255 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 649, + 1589, + 1049, + 1589, + 1049, + 1647, + 649, + 1647 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 245, + 1661, + 1405, + 1661, + 1405, + 1727, + 245, + 1727 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 692, + 750, + 1006, + 750, + 1006, + 789, + 692, + 789 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 240, + 1061, + 1405, + 1061, + 1405, + 1128, + 240, + 1128 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 633, + 1865, + 1067, + 1865, + 1067, + 1906, + 633, + 1906 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 248, + 798, + 1413, + 798, + 1413, + 862, + 248, + 862 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 594, + 1739, + 1103, + 1739, + 1103, + 1808, + 594, + 1808 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 239, + 1821, + 1243, + 1821, + 1243, + 1857, + 239, + 1857 + ], + "score": 0.927 + }, + { + "category_id": 6, + "poly": [ + 298, + 216, + 1400, + 216, + 1400, + 250, + 298, + 250 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1869, + 1400, + 1869, + 1400, + 1900, + 1366, + 1900 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1223, + 1400, + 1223, + 1400, + 1252, + 1366, + 1252 + ], + "score": 0.883 + }, + { + "category_id": 9, + "poly": [ + 1366, + 755, + 1400, + 755, + 1400, + 785, + 1366, + 785 + ], + "score": 0.877 + }, + { + "category_id": 8, + "poly": [ + 528, + 996, + 1170, + 996, + 1170, + 1052, + 528, + 1052 + ], + "score": 0.847 + }, + { + "category_id": 2, + "poly": [ + 840, + 2060, + 859, + 2060, + 859, + 2085, + 840, + 2085 + ], + "score": 0.747 + }, + { + "category_id": 8, + "poly": [ + 529, + 996, + 1169, + 996, + 1169, + 1051, + 529, + 1051 + ], + "score": 0.231 + }, + { + "category_id": 2, + "poly": [ + 840, + 2060, + 860, + 2060, + 860, + 2085, + 840, + 2085 + ], + "score": 0.11 + }, + { + "category_id": 14, + "poly": [ + 592, + 1734, + 1104, + 1734, + 1104, + 1810, + 592, + 1810 + ], + "score": 0.94, + "latex": "\\operatorname { p r o x } _ { g } ( y , \\theta ) : = \\underset { x \\in \\mathbb { R } ^ { d } } { \\operatorname { a r g m i n } } \\frac { 1 } { 2 } \\| x - y \\| _ { 2 } ^ { 2 } + g ( x , \\theta ) ." + }, + { + "category_id": 14, + "poly": [ + 648, + 1588, + 1049, + 1588, + 1049, + 1648, + 648, + 1648 + ], + "score": 0.93, + "latex": "x ^ { \\star } ( \\theta ) : = \\operatornamewithlimits { a r g m i n } _ { x \\in \\mathbb { R } ^ { d } } f ( x , \\theta ) + g ( x , \\theta ) ," + }, + { + "category_id": 13, + "poly": [ + 999, + 1328, + 1133, + 1328, + 1133, + 1362, + 999, + 1362 + ], + "score": 0.93, + "latex": "F ( x ^ { \\star } ( \\theta ) , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 458, + 644, + 728, + 644, + 728, + 680, + 458, + 680 + ], + "score": 0.93, + "latex": "\\partial _ { 1 } F ( x , \\theta ) = \\nabla _ { 1 } ^ { 2 } f ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 682, + 1823, + 747, + 1823, + 747, + 1857, + 682, + 1857 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 14, + "poly": [ + 691, + 750, + 1005, + 750, + 1005, + 789, + 691, + 789 + ], + "score": 0.92, + "latex": "T ( x , \\theta ) = x - \\eta \\nabla _ { 1 } f ( x , \\theta ) ," + }, + { + "category_id": 13, + "poly": [ + 862, + 1546, + 928, + 1546, + 928, + 1580, + 862, + 1580 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 14, + "poly": [ + 630, + 1865, + 1067, + 1865, + 1067, + 1908, + 630, + 1908 + ], + "score": 0.92, + "latex": "T ( x , \\theta ) = \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) ," + }, + { + "category_id": 14, + "poly": [ + 566, + 1135, + 1134, + 1135, + 1134, + 1262, + 566, + 1262 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\nabla _ { 1 } f ( z , \\theta ) + \\left[ \\partial _ { 1 } G ( z , \\theta ) \\right] ^ { \\top } \\boldsymbol { \\lambda } + \\left[ \\partial _ { 1 } H ( z , \\theta ) \\right] ^ { \\top } \\boldsymbol { \\nu } = 0 } \\\\ { H ( z , \\theta ) = 0 } \\\\ { \\boldsymbol { \\lambda } \\circ G ( z , \\theta ) = 0 , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 512, + 1269, + 604, + 1269, + 604, + 1302, + 512, + 1302 + ], + "score": 0.92, + "latex": "\\lambda \\in \\mathbb { R } _ { + } ^ { r }" + }, + { + "category_id": 13, + "poly": [ + 918, + 679, + 1036, + 679, + 1036, + 711, + 918, + 711 + ], + "score": 0.92, + "latex": "\\nabla _ { 1 } f ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 371, + 1661, + 574, + 1661, + 574, + 1695, + 371, + 1695 + ], + "score": 0.92, + "latex": "f \\colon { \\mathbb { R } ^ { d } } \\times { \\mathbb { R } ^ { n } } \\to { \\mathbb { R } }" + }, + { + "category_id": 13, + "poly": [ + 783, + 646, + 1079, + 646, + 1079, + 679, + 783, + 679 + ], + "score": 0.92, + "latex": "\\partial _ { 2 } F ( x , \\theta ) = \\partial _ { 2 } \\nabla _ { 1 } f ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 384, + 1364, + 547, + 1364, + 547, + 1394, + 384, + 1394 + ], + "score": 0.91, + "latex": "d = p + q + r" + }, + { + "category_id": 13, + "poly": [ + 532, + 954, + 598, + 954, + 598, + 987, + 532, + 987 + ], + "score": 0.91, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 488, + 1917, + 558, + 1917, + 558, + 1946, + 488, + 1946 + ], + "score": 0.91, + "latex": "\\eta > 0" + }, + { + "category_id": 13, + "poly": [ + 954, + 1661, + 1155, + 1661, + 1155, + 1693, + 954, + 1693 + ], + "score": 0.91, + "latex": "g \\colon { \\mathbb { R } } ^ { d } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } }" + }, + { + "category_id": 13, + "poly": [ + 373, + 1269, + 459, + 1269, + 459, + 1296, + 373, + 1296 + ], + "score": 0.91, + "latex": "\\nu \\in \\mathbb { R } ^ { q }" + }, + { + "category_id": 14, + "poly": [ + 529, + 995, + 1165, + 995, + 1165, + 1053, + 529, + 1053 + ], + "score": 0.9, + "latex": "\\operatorname { a r g m i n } _ { z \\in \\mathbb { R } ^ { p } } f ( z , \\theta ) \\quad { \\mathrm { s u b j e c t ~ t o } } \\quad G ( z , \\theta ) \\leq 0 , \\ H ( z , \\theta ) = 0 ," + }, + { + "category_id": 13, + "poly": [ + 328, + 1328, + 665, + 1328, + 665, + 1362, + 328, + 1362 + ], + "score": 0.9, + "latex": "x ^ { \\star } ( \\theta ) = ( z ^ { \\star } ( \\theta ) , \\nu ^ { \\star } ( \\theta ) , \\lambda ^ { \\star } ( \\theta ) )" + }, + { + "category_id": 13, + "poly": [ + 369, + 1066, + 452, + 1066, + 452, + 1093, + 369, + 1093 + ], + "score": 0.9, + "latex": "z \\in \\mathbb { R } ^ { p }" + }, + { + "category_id": 13, + "poly": [ + 616, + 801, + 685, + 801, + 685, + 831, + 616, + 831 + ], + "score": 0.9, + "latex": "\\eta > 0" + }, + { + "category_id": 13, + "poly": [ + 1219, + 1327, + 1404, + 1327, + 1404, + 1358, + 1219, + 1358 + ], + "score": 0.9, + "latex": "F \\colon \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } " + }, + { + "category_id": 13, + "poly": [ + 1177, + 1065, + 1398, + 1065, + 1398, + 1093, + 1177, + 1093 + ], + "score": 0.89, + "latex": "H \\colon \\mathbb { R } ^ { p } \\times \\mathbb { R } ^ { n } \\to \\mathbb { R } ^ { q }" + }, + { + "category_id": 13, + "poly": [ + 910, + 1065, + 1127, + 1065, + 1127, + 1093, + 910, + 1093 + ], + "score": 0.86, + "latex": "G \\colon \\mathbb { R } ^ { p } \\times \\mathbb { R } ^ { n } \\to \\mathbb { R } ^ { r }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1360, + 333, + 1360, + 333, + 1390, + 297, + 1390 + ], + "score": 0.86, + "latex": "\\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1265, + 648, + 1285, + 648, + 1285, + 679, + 1265, + 679 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 625, + 1423, + 650, + 1423, + 650, + 1449, + 625, + 1449 + ], + "score": 0.85, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 940, + 1393, + 965, + 1393, + 965, + 1419, + 940, + 1419 + ], + "score": 0.83, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 1028, + 1700, + 1046, + 1700, + 1046, + 1726, + 1028, + 1726 + ], + "score": 0.81, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 445, + 836, + 463, + 836, + 463, + 862, + 445, + 862 + ], + "score": 0.79, + "latex": "\\eta" + }, + { + "category_id": 13, + "poly": [ + 699, + 1065, + 898, + 1065, + 898, + 1097, + 699, + 1097 + ], + "score": 0.75, + "latex": "f \\colon { \\mathbb { R } } ^ { p } \\times { \\mathbb { R } } ^ { n } \\to { \\mathbb { R } }" + }, + { + "category_id": 13, + "poly": [ + 897, + 1978, + 918, + 1978, + 918, + 2003, + 897, + 2003 + ], + "score": 0.25, + "latex": "\\mathbf { B }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 213.0, + 1404.0, + 213.0, + 1404.0, + 253.0, + 296.0, + 253.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": [ + 839.0, + 2059.0, + 860.0, + 2059.0, + 860.0, + 2091.0, + 839.0, + 2091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 652.0, + 279.0, + 652.0, + 279.0, + 675.0, + 242.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 643.0, + 457.0, + 643.0, + 457.0, + 682.0, + 288.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 643.0, + 782.0, + 643.0, + 782.0, + 682.0, + 729.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 643.0, + 1264.0, + 643.0, + 1264.0, + 682.0, + 1080.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 643.0, + 1407.0, + 643.0, + 1407.0, + 682.0, + 1286.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 684.0, + 277.0, + 684.0, + 277.0, + 708.0, + 242.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 675.0, + 917.0, + 675.0, + 917.0, + 710.0, + 292.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 675.0, + 1404.0, + 675.0, + 1404.0, + 710.0, + 1037.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 714.0, + 280.0, + 714.0, + 280.0, + 741.0, + 241.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 708.0, + 1404.0, + 708.0, + 1404.0, + 742.0, + 289.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1273.0, + 279.0, + 1273.0, + 279.0, + 1298.0, + 241.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1267.0, + 372.0, + 1267.0, + 372.0, + 1299.0, + 295.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 1267.0, + 511.0, + 1267.0, + 511.0, + 1299.0, + 460.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 1267.0, + 1405.0, + 1267.0, + 1405.0, + 1299.0, + 605.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1302.0, + 279.0, + 1302.0, + 279.0, + 1331.0, + 239.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1297.0, + 1406.0, + 1297.0, + 1406.0, + 1333.0, + 293.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1333.0, + 279.0, + 1333.0, + 279.0, + 1362.0, + 239.0, + 1362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1324.0, + 327.0, + 1324.0, + 327.0, + 1364.0, + 292.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 666.0, + 1324.0, + 998.0, + 1324.0, + 998.0, + 1364.0, + 666.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1324.0, + 1218.0, + 1324.0, + 1218.0, + 1364.0, + 1134.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1364.0, + 278.0, + 1364.0, + 278.0, + 1394.0, + 239.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1355.0, + 296.0, + 1355.0, + 296.0, + 1401.0, + 291.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 1355.0, + 383.0, + 1355.0, + 383.0, + 1401.0, + 334.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 1355.0, + 1408.0, + 1355.0, + 1408.0, + 1401.0, + 548.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1396.0, + 279.0, + 1396.0, + 279.0, + 1424.0, + 239.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1390.0, + 939.0, + 1390.0, + 939.0, + 1427.0, + 293.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 1390.0, + 1406.0, + 1390.0, + 1406.0, + 1427.0, + 966.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1427.0, + 279.0, + 1427.0, + 279.0, + 1455.0, + 239.0, + 1455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1422.0, + 624.0, + 1422.0, + 624.0, + 1454.0, + 293.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 1422.0, + 1189.0, + 1422.0, + 1189.0, + 1454.0, + 651.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1490.0, + 280.0, + 1490.0, + 280.0, + 1516.0, + 241.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1485.0, + 1405.0, + 1485.0, + 1405.0, + 1519.0, + 291.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 1523.0, + 279.0, + 1523.0, + 279.0, + 1546.0, + 242.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1516.0, + 1405.0, + 1516.0, + 1405.0, + 1550.0, + 292.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1552.0, + 280.0, + 1552.0, + 280.0, + 1578.0, + 241.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1547.0, + 861.0, + 1547.0, + 861.0, + 1581.0, + 292.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 1547.0, + 1199.0, + 1547.0, + 1199.0, + 1581.0, + 929.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 900.0, + 278.0, + 900.0, + 278.0, + 924.0, + 249.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 893.0, + 1403.0, + 893.0, + 1403.0, + 924.0, + 295.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 930.0, + 279.0, + 930.0, + 279.0, + 953.0, + 249.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 921.0, + 1405.0, + 921.0, + 1405.0, + 958.0, + 295.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 251.0, + 959.0, + 282.0, + 959.0, + 282.0, + 984.0, + 251.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 952.0, + 531.0, + 952.0, + 531.0, + 989.0, + 291.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 952.0, + 1015.0, + 952.0, + 1015.0, + 989.0, + 599.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 1920.0, + 279.0, + 1920.0, + 279.0, + 1947.0, + 242.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1913.0, + 487.0, + 1913.0, + 487.0, + 1951.0, + 291.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1913.0, + 1406.0, + 1913.0, + 1406.0, + 1951.0, + 559.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1951.0, + 277.0, + 1951.0, + 277.0, + 1977.0, + 239.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1944.0, + 1406.0, + 1944.0, + 1406.0, + 1982.0, + 292.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 1983.0, + 279.0, + 1983.0, + 279.0, + 2007.0, + 242.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1976.0, + 896.0, + 1976.0, + 896.0, + 2010.0, + 292.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1976.0, + 930.0, + 1976.0, + 930.0, + 2010.0, + 919.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1656.0, + 370.0, + 1656.0, + 370.0, + 1701.0, + 241.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1656.0, + 953.0, + 1656.0, + 953.0, + 1701.0, + 575.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1656.0, + 1405.0, + 1656.0, + 1405.0, + 1701.0, + 1156.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1693.0, + 1027.0, + 1693.0, + 1027.0, + 1729.0, + 236.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 1693.0, + 1082.0, + 1693.0, + 1082.0, + 1729.0, + 1047.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1062.0, + 368.0, + 1062.0, + 368.0, + 1097.0, + 236.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1062.0, + 698.0, + 1062.0, + 698.0, + 1097.0, + 453.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 1062.0, + 909.0, + 1062.0, + 909.0, + 1097.0, + 899.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 1062.0, + 1176.0, + 1062.0, + 1176.0, + 1097.0, + 1128.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1062.0, + 1410.0, + 1062.0, + 1410.0, + 1097.0, + 1399.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1095.0, + 1194.0, + 1095.0, + 1194.0, + 1131.0, + 236.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 797.0, + 615.0, + 797.0, + 615.0, + 836.0, + 236.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 797.0, + 1408.0, + 797.0, + 1408.0, + 836.0, + 686.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 831.0, + 444.0, + 831.0, + 444.0, + 863.0, + 237.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 831.0, + 602.0, + 831.0, + 602.0, + 863.0, + 464.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1818.0, + 681.0, + 1818.0, + 681.0, + 1863.0, + 235.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 1818.0, + 1244.0, + 1818.0, + 1244.0, + 1863.0, + 748.0, + 1863.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 242, + 1185, + 1405, + 1185, + 1405, + 1340, + 242, + 1340 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 242, + 1912, + 1405, + 1912, + 1405, + 2009, + 242, + 2009 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 240, + 1746, + 1404, + 1746, + 1404, + 1902, + 240, + 1902 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 242, + 685, + 1406, + 685, + 1406, + 781, + 242, + 781 + ], + "score": 0.963 + }, + { + "category_id": 8, + "poly": [ + 694, + 1052, + 1004, + 1052, + 1004, + 1174, + 694, + 1174 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 292, + 1494, + 1404, + 1494, + 1404, + 1619, + 292, + 1619 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 294, + 1625, + 1403, + 1625, + 1403, + 1724, + 294, + 1724 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 239, + 970, + 1404, + 970, + 1404, + 1039, + 239, + 1039 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 255, + 591, + 1407, + 591, + 1407, + 655, + 255, + 655 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 247, + 201, + 1405, + 201, + 1405, + 269, + 247, + 269 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 707, + 283, + 989, + 283, + 989, + 343, + 707, + 343 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 639, + 540, + 1059, + 540, + 1059, + 579, + 639, + 579 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 584, + 415, + 1113, + 415, + 1113, + 475, + 584, + 475 + ], + "score": 0.94 + }, + { + "category_id": 8, + "poly": [ + 593, + 794, + 1103, + 794, + 1103, + 834, + 593, + 834 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 236, + 359, + 1124, + 359, + 1124, + 396, + 236, + 396 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 242, + 491, + 862, + 491, + 862, + 525, + 242, + 525 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 241, + 846, + 1010, + 846, + 1010, + 881, + 241, + 881 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 251, + 1370, + 1076, + 1370, + 1076, + 1404, + 251, + 1404 + ], + "score": 0.923 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1136, + 1399, + 1136, + 1399, + 1168, + 1352, + 1168 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 297, + 1438, + 564, + 1438, + 564, + 1471, + 297, + 1471 + ], + "score": 0.906 + }, + { + "category_id": 9, + "poly": [ + 1352, + 897, + 1400, + 897, + 1400, + 928, + 1352, + 928 + ], + "score": 0.9 + }, + { + "category_id": 9, + "poly": [ + 1366, + 543, + 1400, + 543, + 1400, + 573, + 1366, + 573 + ], + "score": 0.874 + }, + { + "category_id": 9, + "poly": [ + 1365, + 288, + 1400, + 288, + 1400, + 318, + 1365, + 318 + ], + "score": 0.864 + }, + { + "category_id": 2, + "poly": [ + 840, + 2061, + 859, + 2061, + 859, + 2085, + 840, + 2085 + ], + "score": 0.796 + }, + { + "category_id": 8, + "poly": [ + 627, + 893, + 1072, + 893, + 1072, + 954, + 627, + 954 + ], + "score": 0.623 + }, + { + "category_id": 8, + "poly": [ + 624, + 893, + 1071, + 893, + 1071, + 953, + 624, + 953 + ], + "score": 0.092 + }, + { + "category_id": 14, + "poly": [ + 706, + 282, + 993, + 282, + 993, + 344, + 706, + 344 + ], + "score": 0.94, + "latex": "x ^ { \\star } ( \\theta ) = \\operatorname * { a r g m i n } _ { x \\in { \\mathcal { C } } ( \\theta ) } f ( x , \\theta ) ." + }, + { + "category_id": 13, + "poly": [ + 950, + 204, + 1030, + 204, + 1030, + 237, + 950, + 237 + ], + "score": 0.93, + "latex": "g ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 614, + 1748, + 862, + 1748, + 862, + 1782, + 614, + 1782 + ], + "score": 0.93, + "latex": "J ( x ^ { \\star } ( \\theta ) , \\theta ) = \\partial x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1302, + 204, + 1396, + 204, + 1396, + 240, + 1302, + 240 + ], + "score": 0.93, + "latex": "I _ { C ( \\theta ) } ( x )" + }, + { + "category_id": 13, + "poly": [ + 738, + 972, + 831, + 972, + 831, + 1006, + 738, + 1006 + ], + "score": 0.93, + "latex": "\\nabla \\varphi ^ { * } ( y )" + }, + { + "category_id": 13, + "poly": [ + 742, + 1246, + 993, + 1246, + 993, + 1280, + 742, + 1280 + ], + "score": 0.92, + "latex": "\\varphi ( \\bar { x } ) \\stackrel { - } { = } \\langle x , \\log x - 1 \\rangle" + }, + { + "category_id": 13, + "poly": [ + 1027, + 688, + 1093, + 688, + 1093, + 720, + 1027, + 720 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1083, + 1244, + 1252, + 1244, + 1252, + 1282, + 1083, + 1282 + ], + "score": 0.92, + "latex": "\\mathrm { d o m } ( \\varphi ) = \\mathbb { R } _ { + } ^ { d }" + }, + { + "category_id": 14, + "poly": [ + 584, + 412, + 1115, + 412, + 1115, + 477, + 584, + 477 + ], + "score": 0.92, + "latex": "{ \\mathrm { p r o x } } _ { g } ( y , \\theta ) = { \\mathrm { p r o j } } _ { \\mathcal { C } } ( y , \\theta ) : = { \\underset { x \\in { \\mathcal { C } } ( \\theta ) } { \\operatorname { a r g m i n } } } \\| x - y \\| _ { 2 } ^ { 2 }" + }, + { + "category_id": 14, + "poly": [ + 623, + 893, + 1074, + 893, + 1074, + 955, + 623, + 955 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\mathrm { p r o j } _ { \\mathcal { C } } ^ { \\varphi } ( y , \\theta ) : = \\underset { x \\in \\mathcal { C } ( \\theta ) } { \\mathrm { a r g m i n } } D _ { \\varphi } ( x , \\nabla \\varphi ^ { \\ast } ( y ) ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 351, + 1778, + 416, + 1778, + 416, + 1811, + 351, + 1811 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( { \\boldsymbol { \\theta } } )" + }, + { + "category_id": 13, + "poly": [ + 650, + 1914, + 1074, + 1914, + 1074, + 1948, + 650, + 1948 + ], + "score": 0.92, + "latex": "\\| J ( \\hat { x } , \\theta ) - \\partial x ^ { \\star } ( \\theta ) \\| < C \\| \\hat { x } - x ^ { \\star } ( \\theta ) \\|" + }, + { + "category_id": 13, + "poly": [ + 905, + 1526, + 971, + 1526, + 971, + 1558, + 905, + 1558 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 790, + 846, + 972, + 846, + 972, + 882, + 790, + 882 + ], + "score": 0.92, + "latex": "{ \\mathcal { C } } ( \\theta ) \\subseteq \\mathrm { d o m } ( \\varphi )" + }, + { + "category_id": 14, + "poly": [ + 696, + 1049, + 1004, + 1049, + 1004, + 1178, + 696, + 1178 + ], + "score": 0.92, + "latex": "\\begin{array} { c } { \\hat { x } = \\nabla \\varphi ( x ) } \\\\ { y = \\hat { x } - \\eta \\nabla _ { 1 } f ( x , \\theta ) } \\\\ { T ( x , \\theta ) = \\mathrm { p r o j } _ { \\mathcal { C } } ^ { \\varphi } ( y , \\theta ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1006, + 1748, + 1088, + 1748, + 1088, + 1781, + 1006, + 1781 + ], + "score": 0.92, + "latex": "J ( \\hat { x } , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1945, + 1397, + 1945, + 1397, + 1979, + 1332, + 1979 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1208, + 1628, + 1351, + 1628, + 1351, + 1659, + 1208, + 1659 + ], + "score": 0.91, + "latex": "A : = - \\partial _ { 1 } F" + }, + { + "category_id": 13, + "poly": [ + 1266, + 1840, + 1347, + 1840, + 1347, + 1873, + 1266, + 1873 + ], + "score": 0.91, + "latex": "{ \\partial x ^ { \\star } ( \\theta ) }" + }, + { + "category_id": 13, + "poly": [ + 371, + 236, + 425, + 236, + 425, + 270, + 371, + 270 + ], + "score": 0.91, + "latex": "\\mathcal { C } ( \\boldsymbol { \\theta } )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1691, + 588, + 1691, + 588, + 1725, + 297, + 1725 + ], + "score": 0.91, + "latex": "A ( x , \\theta ) J ( x , \\theta ) = B ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 973, + 1780, + 1055, + 1780, + 1055, + 1811, + 973, + 1811 + ], + "score": 0.91, + "latex": "{ \\partial x ^ { \\star } ( \\theta ) }" + }, + { + "category_id": 13, + "poly": [ + 769, + 1690, + 1020, + 1690, + 1020, + 1720, + 769, + 1720 + ], + "score": 0.91, + "latex": "J : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d \\times n }" + }, + { + "category_id": 13, + "poly": [ + 1070, + 362, + 1123, + 362, + 1123, + 395, + 1070, + 395 + ], + "score": 0.91, + "latex": "\\mathcal { C } ( \\boldsymbol { \\theta } )" + }, + { + "category_id": 14, + "poly": [ + 638, + 538, + 1061, + 538, + 1061, + 578, + 638, + 578 + ], + "score": 0.91, + "latex": "T ( x , \\theta ) = \\mathrm { p r o j } _ { \\mathcal { C } } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) ." + }, + { + "category_id": 13, + "poly": [ + 503, + 1624, + 739, + 1624, + 739, + 1657, + 503, + 1657 + ], + "score": 0.91, + "latex": "F : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 818, + 1659, + 882, + 1659, + 882, + 1691, + 818, + 1691 + ], + "score": 0.9, + "latex": "( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1263, + 1809, + 1316, + 1809, + 1316, + 1840, + 1263, + 1840 + ], + "score": 0.9, + "latex": "{ \\hat { x } } ( \\theta )" + }, + { + "category_id": 14, + "poly": [ + 592, + 794, + 1105, + 794, + 1105, + 834, + 592, + 834 + ], + "score": 0.9, + "latex": "D _ { \\varphi } ( x , y ) : = \\varphi ( x ) - \\varphi ( y ) - \\langle \\nabla \\varphi ( y ) , x - y \\rangle ." + }, + { + "category_id": 13, + "poly": [ + 297, + 1277, + 339, + 1277, + 339, + 1311, + 297, + 1311 + ], + "score": 0.9, + "latex": "D _ { \\varphi }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1658, + 414, + 1658, + 414, + 1689, + 297, + 1689 + ], + "score": 0.89, + "latex": "B : = \\partial _ { 2 } F" + }, + { + "category_id": 13, + "poly": [ + 366, + 1005, + 460, + 1005, + 460, + 1039, + 366, + 1039 + ], + "score": 0.88, + "latex": "\\mathrm { d o m } ( \\varphi )" + }, + { + "category_id": 13, + "poly": [ + 675, + 747, + 1068, + 747, + 1068, + 782, + 675, + 782 + ], + "score": 0.88, + "latex": "\\operatorname { d o m } ( \\bar { \\varphi } ) \\cdot \\operatorname { r e l i n t } ( \\operatorname { d o m } ( \\varphi ) ) \\to \\bar { \\mathbb { R } } _ { + }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1003, + 333, + 1003, + 333, + 1033, + 297, + 1033 + ], + "score": 0.86, + "latex": "\\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 918, + 1873, + 933, + 1873, + 933, + 1896, + 918, + 1896 + ], + "score": 0.83, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 691, + 1250, + 712, + 1250, + 712, + 1279, + 691, + 1279 + ], + "score": 0.83, + "latex": "\\varphi" + }, + { + "category_id": 13, + "poly": [ + 1039, + 1950, + 1056, + 1950, + 1056, + 1973, + 1039, + 1973 + ], + "score": 0.82, + "latex": "\\hat { x }" + }, + { + "category_id": 13, + "poly": [ + 586, + 1871, + 605, + 1871, + 605, + 1897, + 586, + 1897 + ], + "score": 0.82, + "latex": "\\hat { x }" + }, + { + "category_id": 13, + "poly": [ + 711, + 853, + 730, + 853, + 730, + 880, + 711, + 880 + ], + "score": 0.82, + "latex": "y" + }, + { + "category_id": 13, + "poly": [ + 397, + 1558, + 417, + 1558, + 417, + 1584, + 397, + 1584 + ], + "score": 0.81, + "latex": "\\hat { x }" + }, + { + "category_id": 13, + "poly": [ + 754, + 238, + 770, + 238, + 770, + 264, + 754, + 264 + ], + "score": 0.81, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 399, + 1188, + 423, + 1188, + 423, + 1214, + 399, + 1214 + ], + "score": 0.8, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1221, + 752, + 1242, + 752, + 1242, + 780, + 1221, + 780 + ], + "score": 0.8, + "latex": "\\varphi" + }, + { + "category_id": 13, + "poly": [ + 562, + 366, + 628, + 366, + 628, + 400, + 562, + 400 + ], + "score": 0.77, + "latex": "\\operatorname { p r o x } _ { g }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1780, + 317, + 1780, + 317, + 1806, + 297, + 1806 + ], + "score": 0.76, + "latex": "\\hat { x }" + }, + { + "category_id": 13, + "poly": [ + 616, + 748, + 659, + 748, + 659, + 782, + 616, + 782 + ], + "score": 0.76, + "latex": "D _ { \\varphi }" + }, + { + "category_id": 13, + "poly": [ + 565, + 1810, + 582, + 1810, + 582, + 1836, + 565, + 1836 + ], + "score": 0.69, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 865, + 625, + 880, + 625, + 880, + 650, + 865, + 650 + ], + "score": 0.27, + "latex": "/" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1436.0, + 566.0, + 1436.0, + 566.0, + 1473.0, + 292.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2059.0, + 862.0, + 2059.0, + 862.0, + 2089.0, + 840.0, + 2089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1192.0, + 278.0, + 1192.0, + 278.0, + 1217.0, + 241.0, + 1217.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1187.0, + 398.0, + 1187.0, + 398.0, + 1220.0, + 295.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1187.0, + 1406.0, + 1187.0, + 1406.0, + 1220.0, + 424.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1223.0, + 278.0, + 1223.0, + 278.0, + 1248.0, + 241.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1217.0, + 1404.0, + 1217.0, + 1404.0, + 1251.0, + 295.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1251.0, + 279.0, + 1251.0, + 279.0, + 1280.0, + 239.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1241.0, + 690.0, + 1241.0, + 690.0, + 1286.0, + 291.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 1241.0, + 741.0, + 1241.0, + 741.0, + 1286.0, + 713.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 1241.0, + 1082.0, + 1241.0, + 1082.0, + 1286.0, + 994.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 1241.0, + 1412.0, + 1241.0, + 1412.0, + 1286.0, + 1253.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1281.0, + 279.0, + 1281.0, + 279.0, + 1310.0, + 239.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 1274.0, + 1408.0, + 1274.0, + 1408.0, + 1312.0, + 340.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1312.0, + 280.0, + 1312.0, + 280.0, + 1341.0, + 239.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1306.0, + 1279.0, + 1306.0, + 1279.0, + 1344.0, + 293.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1921.0, + 279.0, + 1921.0, + 279.0, + 1944.0, + 241.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1909.0, + 649.0, + 1909.0, + 649.0, + 1951.0, + 287.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 1909.0, + 1406.0, + 1909.0, + 1406.0, + 1951.0, + 1075.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1953.0, + 279.0, + 1953.0, + 279.0, + 1975.0, + 241.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1943.0, + 1038.0, + 1943.0, + 1038.0, + 1981.0, + 291.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 1943.0, + 1331.0, + 1943.0, + 1331.0, + 1981.0, + 1057.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 1943.0, + 1410.0, + 1943.0, + 1410.0, + 1981.0, + 1398.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1980.0, + 280.0, + 1980.0, + 280.0, + 2006.0, + 238.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1975.0, + 1372.0, + 1975.0, + 1372.0, + 2010.0, + 293.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1752.0, + 278.0, + 1752.0, + 278.0, + 1781.0, + 239.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1747.0, + 613.0, + 1747.0, + 613.0, + 1784.0, + 293.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 1747.0, + 1005.0, + 1747.0, + 1005.0, + 1784.0, + 863.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 1747.0, + 1405.0, + 1747.0, + 1405.0, + 1784.0, + 1089.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1784.0, + 277.0, + 1784.0, + 277.0, + 1809.0, + 240.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1777.0, + 296.0, + 1777.0, + 296.0, + 1815.0, + 293.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1777.0, + 350.0, + 1777.0, + 350.0, + 1815.0, + 318.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 1777.0, + 972.0, + 1777.0, + 972.0, + 1815.0, + 417.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1777.0, + 1405.0, + 1777.0, + 1405.0, + 1815.0, + 1056.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1815.0, + 277.0, + 1815.0, + 277.0, + 1840.0, + 239.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1807.0, + 564.0, + 1807.0, + 564.0, + 1844.0, + 293.0, + 1844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 1807.0, + 1262.0, + 1807.0, + 1262.0, + 1844.0, + 583.0, + 1844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1317.0, + 1807.0, + 1405.0, + 1807.0, + 1405.0, + 1844.0, + 1317.0, + 1844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1844.0, + 280.0, + 1844.0, + 280.0, + 1872.0, + 237.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1837.0, + 1265.0, + 1837.0, + 1265.0, + 1875.0, + 293.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 1837.0, + 1407.0, + 1837.0, + 1407.0, + 1875.0, + 1348.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1873.0, + 280.0, + 1873.0, + 280.0, + 1903.0, + 237.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1868.0, + 585.0, + 1868.0, + 585.0, + 1905.0, + 293.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 1868.0, + 917.0, + 1868.0, + 917.0, + 1905.0, + 606.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 1868.0, + 1037.0, + 1868.0, + 1037.0, + 1905.0, + 934.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 693.0, + 279.0, + 693.0, + 279.0, + 720.0, + 241.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 685.0, + 1026.0, + 685.0, + 1026.0, + 723.0, + 292.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 685.0, + 1406.0, + 685.0, + 1406.0, + 723.0, + 1094.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 724.0, + 278.0, + 724.0, + 278.0, + 748.0, + 242.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 715.0, + 1409.0, + 715.0, + 1409.0, + 755.0, + 289.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 755.0, + 276.0, + 755.0, + 276.0, + 778.0, + 242.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 745.0, + 615.0, + 745.0, + 615.0, + 784.0, + 289.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 745.0, + 674.0, + 745.0, + 674.0, + 784.0, + 660.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1069.0, + 745.0, + 1220.0, + 745.0, + 1220.0, + 784.0, + 1069.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 745.0, + 1403.0, + 745.0, + 1403.0, + 784.0, + 1243.0, + 784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1493.0, + 1405.0, + 1493.0, + 1405.0, + 1531.0, + 294.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1525.0, + 904.0, + 1525.0, + 904.0, + 1560.0, + 294.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 1525.0, + 1404.0, + 1525.0, + 1404.0, + 1560.0, + 972.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1558.0, + 396.0, + 1558.0, + 396.0, + 1590.0, + 294.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1558.0, + 1403.0, + 1558.0, + 1403.0, + 1590.0, + 418.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1587.0, + 1030.0, + 1587.0, + 1030.0, + 1621.0, + 292.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1621.0, + 502.0, + 1621.0, + 502.0, + 1663.0, + 293.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 1621.0, + 1207.0, + 1621.0, + 1207.0, + 1663.0, + 740.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1621.0, + 1406.0, + 1621.0, + 1406.0, + 1663.0, + 1352.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 1656.0, + 817.0, + 1656.0, + 817.0, + 1693.0, + 415.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 1656.0, + 1405.0, + 1656.0, + 1405.0, + 1693.0, + 883.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1687.0, + 296.0, + 1687.0, + 296.0, + 1725.0, + 292.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 1687.0, + 768.0, + 1687.0, + 768.0, + 1725.0, + 589.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 1687.0, + 1032.0, + 1687.0, + 1032.0, + 1725.0, + 1021.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 242.0, + 978.0, + 280.0, + 978.0, + 280.0, + 1003.0, + 242.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 971.0, + 737.0, + 971.0, + 737.0, + 1008.0, + 289.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 971.0, + 1405.0, + 971.0, + 1405.0, + 1008.0, + 832.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1002.0, + 296.0, + 1002.0, + 296.0, + 1043.0, + 236.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 1002.0, + 365.0, + 1002.0, + 365.0, + 1043.0, + 334.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 1002.0, + 1383.0, + 1002.0, + 1383.0, + 1043.0, + 461.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 597.0, + 281.0, + 597.0, + 281.0, + 623.0, + 249.0, + 623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 587.0, + 1405.0, + 587.0, + 1405.0, + 631.0, + 287.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 244.0, + 622.0, + 864.0, + 622.0, + 864.0, + 658.0, + 244.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 622.0, + 1409.0, + 622.0, + 1409.0, + 658.0, + 881.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 243.0, + 197.0, + 949.0, + 197.0, + 949.0, + 243.0, + 243.0, + 243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 197.0, + 1301.0, + 197.0, + 1301.0, + 243.0, + 1031.0, + 243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 197.0, + 1407.0, + 197.0, + 1407.0, + 243.0, + 1397.0, + 243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 236.0, + 370.0, + 236.0, + 370.0, + 273.0, + 238.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 236.0, + 753.0, + 236.0, + 753.0, + 273.0, + 426.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 236.0, + 897.0, + 236.0, + 897.0, + 273.0, + 771.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 356.0, + 561.0, + 356.0, + 561.0, + 402.0, + 235.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 356.0, + 1069.0, + 356.0, + 1069.0, + 402.0, + 629.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 356.0, + 1127.0, + 356.0, + 1127.0, + 402.0, + 1124.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 490.0, + 862.0, + 490.0, + 862.0, + 529.0, + 237.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 841.0, + 710.0, + 841.0, + 710.0, + 888.0, + 236.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 841.0, + 789.0, + 841.0, + 789.0, + 888.0, + 731.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 841.0, + 1010.0, + 841.0, + 1010.0, + 888.0, + 973.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1366.0, + 1079.0, + 1366.0, + 1079.0, + 1410.0, + 239.0, + 1410.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 298, + 199, + 1399, + 199, + 1399, + 497, + 298, + 497 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 295, + 516, + 1406, + 516, + 1406, + 730, + 295, + 730 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 297, + 1762, + 1405, + 1762, + 1405, + 1854, + 297, + 1854 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 239, + 1529, + 1406, + 1529, + 1406, + 1654, + 239, + 1654 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 529, + 992, + 1165, + 992, + 1165, + 1036, + 529, + 1036 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 261, + 1945, + 1404, + 1945, + 1404, + 2008, + 261, + 2008 + ], + "score": 0.942 + }, + { + "category_id": 0, + "poly": [ + 293, + 1888, + 954, + 1888, + 954, + 1922, + 293, + 1922 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 265, + 780, + 1406, + 780, + 1406, + 848, + 265, + 848 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 263, + 1192, + 1404, + 1192, + 1404, + 1257, + 263, + 1257 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 241, + 1313, + 1414, + 1313, + 1414, + 1376, + 241, + 1376 + ], + "score": 0.921 + }, + { + "category_id": 8, + "poly": [ + 537, + 1265, + 1160, + 1265, + 1160, + 1305, + 537, + 1305 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 281, + 1694, + 533, + 1694, + 533, + 1732, + 281, + 1732 + ], + "score": 0.899 + }, + { + "category_id": 1, + "poly": [ + 244, + 1386, + 1274, + 1386, + 1274, + 1425, + 244, + 1425 + ], + "score": 0.897 + }, + { + "category_id": 1, + "poly": [ + 240, + 1054, + 1407, + 1054, + 1407, + 1181, + 240, + 1181 + ], + "score": 0.888 + }, + { + "category_id": 1, + "poly": [ + 267, + 950, + 931, + 950, + 931, + 984, + 267, + 984 + ], + "score": 0.87 + }, + { + "category_id": 8, + "poly": [ + 352, + 1434, + 1303, + 1434, + 1303, + 1521, + 352, + 1521 + ], + "score": 0.862 + }, + { + "category_id": 1, + "poly": [ + 274, + 857, + 1402, + 857, + 1402, + 896, + 274, + 896 + ], + "score": 0.858 + }, + { + "category_id": 2, + "poly": [ + 841, + 2060, + 858, + 2060, + 858, + 2084, + 841, + 2084 + ], + "score": 0.725 + }, + { + "category_id": 1, + "poly": [ + 270, + 903, + 1356, + 903, + 1356, + 942, + 270, + 942 + ], + "score": 0.651 + }, + { + "category_id": 8, + "poly": [ + 270, + 903, + 1356, + 903, + 1356, + 942, + 270, + 942 + ], + "score": 0.218 + }, + { + "category_id": 13, + "poly": [ + 678, + 1088, + 756, + 1088, + 756, + 1120, + 678, + 1120 + ], + "score": 0.93, + "latex": "A ( \\cdot , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 719, + 1387, + 1145, + 1387, + 1145, + 1427, + 719, + 1427 + ], + "score": 0.93, + "latex": "T ( x , \\theta ) = \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1106, + 1530, + 1274, + 1530, + 1274, + 1564, + 1106, + 1564 + ], + "score": 0.93, + "latex": "f ( x , \\theta ) + g ( x )" + }, + { + "category_id": 13, + "poly": [ + 634, + 950, + 826, + 950, + 826, + 986, + 634, + 986 + ], + "score": 0.92, + "latex": "\\| { \\hat { x } } - x ^ { \\star } ( \\theta ) \\| \\leq \\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1087, + 1397, + 1087, + 1397, + 1121, + 1332, + 1121 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 583, + 816, + 694, + 816, + 694, + 846, + 583, + 846 + ], + "score": 0.92, + "latex": "B = \\partial _ { 2 } F" + }, + { + "category_id": 13, + "poly": [ + 1093, + 638, + 1159, + 638, + 1159, + 670, + 1093, + 670 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 430, + 1976, + 496, + 1976, + 496, + 2009, + 430, + 2009 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 880, + 1224, + 1183, + 1224, + 1183, + 1257, + 880, + 1257 + ], + "score": 0.92, + "latex": "T ( x , \\theta ) = x - \\eta \\nabla _ { 1 } f ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 712, + 782, + 937, + 782, + 937, + 813, + 712, + 813 + ], + "score": 0.92, + "latex": "F : \\mathbb { R } ^ { d } \\times \\mathbb { R } ^ { n } \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 402, + 816, + 532, + 816, + 532, + 846, + 402, + 846 + ], + "score": 0.92, + "latex": "A = - \\partial _ { 1 } F" + }, + { + "category_id": 13, + "poly": [ + 1217, + 547, + 1272, + 547, + 1272, + 576, + 1217, + 576 + ], + "score": 0.91, + "latex": "90 \\%" + }, + { + "category_id": 13, + "poly": [ + 1209, + 816, + 1396, + 816, + 1396, + 849, + 1209, + 849 + ], + "score": 0.9, + "latex": "\\| x - x ^ { \\star } ( \\theta ) \\| \\leq \\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 1021, + 1977, + 1096, + 1977, + 1096, + 2005, + 1021, + 2005 + ], + "score": 0.9, + "latex": "m \\times k" + }, + { + "category_id": 13, + "poly": [ + 1214, + 785, + 1402, + 785, + 1402, + 816, + 1214, + 816 + ], + "score": 0.89, + "latex": "\\alpha , \\beta , \\gamma , \\varepsilon , R > 0" + }, + { + "category_id": 13, + "poly": [ + 842, + 1268, + 1153, + 1268, + 1153, + 1304, + 842, + 1304 + ], + "score": 0.88, + "latex": "B ( x , \\theta ) = - \\eta \\partial _ { 2 } \\nabla _ { 1 } f ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 945, + 815, + 1030, + 815, + 1030, + 844, + 945, + 844 + ], + "score": 0.88, + "latex": "\\boldsymbol \\theta \\in \\mathbb { R } ^ { n }" + }, + { + "category_id": 13, + "poly": [ + 1295, + 1562, + 1348, + 1562, + 1348, + 1591, + 1295, + 1591 + ], + "score": 0.88, + "latex": "\\ S 3 . 2" + }, + { + "category_id": 14, + "poly": [ + 532, + 992, + 1164, + 992, + 1164, + 1036, + 532, + 1036 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\| J ( \\hat { x } , \\theta ) - \\partial x ^ { \\star } ( \\theta ) \\| \\leq \\left( \\beta \\alpha ^ { - 1 } + \\gamma R \\alpha ^ { - 2 } \\right) \\| \\hat { x } - x ^ { \\star } ( \\theta ) \\| . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 851, + 814, + 934, + 814, + 934, + 844, + 851, + 844 + ], + "score": 0.86, + "latex": "v \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1237, + 1315, + 1257, + 1315, + 1257, + 1346, + 1237, + 1346 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 891, + 1195, + 915, + 1195, + 915, + 1221, + 891, + 1221 + ], + "score": 0.85, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 455, + 1566, + 474, + 1566, + 474, + 1593, + 455, + 1593 + ], + "score": 0.82, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 1200, + 1119, + 1219, + 1119, + 1219, + 1145, + 1200, + 1145 + ], + "score": 0.82, + "latex": "\\hat { x }" + }, + { + "category_id": 13, + "poly": [ + 946, + 1195, + 970, + 1195, + 970, + 1221, + 946, + 1221 + ], + "score": 0.82, + "latex": "T" + }, + { + "category_id": 14, + "poly": [ + 349, + 1433, + 1348, + 1433, + 1348, + 1525, + 349, + 1525 + ], + "score": 0.8, + "latex": "\\begin{array} { r l } & { A ( x , \\theta ) = I - \\partial _ { 1 } T ( x , \\theta ) = I - ( I - \\eta \\nabla _ { 1 } ^ { 2 } f ( x , \\theta ) ) \\partial _ { 1 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) } \\\\ & { B ( x , \\theta ) = \\partial _ { 2 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) - \\eta \\partial _ { 2 } \\nabla _ { 1 } f ( x , \\theta ) \\partial _ { 1 } \\mathrm { p r o x } _ { \\eta g } ( x - \\eta \\nabla _ { 1 } f ( x , \\theta ) , \\theta ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 628, + 905, + 1366, + 905, + 1366, + 941, + 628, + 941 + ], + "score": 0.79, + "latex": "\\begin{array} { r } { | B ( x ^ { \\star } ( \\theta ) , \\theta ) | | \\leq R , \\| B ( x , \\theta ) - B ( x ^ { \\star } ( \\theta ) , \\theta ) \\| \\leq \\beta \\| x - x ^ { \\star } ( \\theta ) \\| . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 870, + 1562, + 887, + 1562, + 887, + 1588, + 870, + 1588 + ], + "score": 0.79, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 655, + 858, + 1401, + 858, + 1401, + 896, + 655, + 896 + ], + "score": 0.78, + "latex": "\\| A ( x , \\theta ) v \\| \\geq \\alpha \\| v \\| , \\| A ( x , \\theta ) - A ( x ^ { \\star } ( \\theta ) , \\theta ) \\| _ { o p } \\leq \\gamma \\| x - x ^ { \\star } ( \\theta ) \\| ." + }, + { + "category_id": 13, + "poly": [ + 720, + 1124, + 738, + 1124, + 738, + 1145, + 720, + 1145 + ], + "score": 0.77, + "latex": "\\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 1183, + 1981, + 1211, + 1981, + 1211, + 2003, + 1183, + 2003 + ], + "score": 0.75, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 538, + 1266, + 793, + 1266, + 793, + 1304, + 538, + 1304 + ], + "score": 0.75, + "latex": "A ( x , \\theta ) = \\eta \\nabla _ { 1 } ^ { 2 } f ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 621, + 905, + 846, + 905, + 846, + 941, + 621, + 941 + ], + "score": 0.7, + "latex": "\\| B ( x ^ { \\star } ( \\theta ) , \\theta ) \\| \\leq R" + }, + { + "category_id": 13, + "poly": [ + 1081, + 821, + 1100, + 821, + 1100, + 843, + 1081, + 843 + ], + "score": 0.67, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 297, + 908, + 323, + 908, + 323, + 934, + 297, + 934 + ], + "score": 0.66, + "latex": "B" + }, + { + "category_id": 14, + "poly": [ + 653, + 858, + 1401, + 858, + 1401, + 895, + 653, + 895 + ], + "score": 0.42, + "latex": "\\| A ( x , \\theta ) v \\| \\geq \\alpha \\| v \\| , \\| A ( x , \\theta ) - A ( x ^ { \\star } ( \\theta ) , \\theta ) \\| _ { o p } \\leq \\gamma \\| x - x ^ { \\star } ( \\theta ) \\| ." + }, + { + "category_id": 13, + "poly": [ + 298, + 862, + 322, + 862, + 322, + 888, + 298, + 888 + ], + "score": 0.35, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 297, + 608, + 334, + 608, + 334, + 638, + 297, + 638 + ], + "score": 0.26, + "latex": "\\mathbf { ( b ) }" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 204.0, + 586.0, + 204.0, + 586.0, + 227.0, + 414.0, + 227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 199.0, + 961.0, + 199.0, + 961.0, + 222.0, + 761.0, + 222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 199.0, + 1370.0, + 199.0, + 1370.0, + 222.0, + 1090.0, + 222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 219.0, + 349.0, + 219.0, + 349.0, + 420.0, + 298.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 232.0, + 488.0, + 232.0, + 488.0, + 271.0, + 363.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 666.0, + 216.0, + 847.0, + 216.0, + 847.0, + 278.0, + 666.0, + 278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 240.0, + 1072.0, + 240.0, + 1072.0, + 262.0, + 1035.0, + 262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 223.0, + 1244.0, + 223.0, + 1244.0, + 283.0, + 1077.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 271.0, + 1072.0, + 271.0, + 1072.0, + 295.0, + 1036.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 666.0, + 288.0, + 706.0, + 288.0, + 706.0, + 314.0, + 666.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 302.0, + 348.0, + 302.0, + 348.0, + 324.0, + 316.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 302.0, + 1072.0, + 302.0, + 1072.0, + 326.0, + 1036.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 326.0, + 703.0, + 326.0, + 703.0, + 349.0, + 667.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 334.0, + 1071.0, + 334.0, + 1071.0, + 357.0, + 1036.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 349.0, + 347.0, + 349.0, + 347.0, + 369.0, + 324.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 360.0, + 451.0, + 360.0, + 451.0, + 370.0, + 437.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 360.0, + 703.0, + 360.0, + 703.0, + 384.0, + 667.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 365.0, + 1071.0, + 365.0, + 1071.0, + 389.0, + 1036.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1369.0, + 372.0, + 1379.0, + 372.0, + 1379.0, + 382.0, + 1369.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1290.0, + 387.0, + 1319.0, + 387.0, + 1319.0, + 399.0, + 1290.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 398.0, + 347.0, + 398.0, + 347.0, + 413.0, + 332.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 395.0, + 376.0, + 395.0, + 376.0, + 405.0, + 366.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 393.0, + 750.0, + 393.0, + 750.0, + 419.0, + 685.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 400.0, + 1070.0, + 400.0, + 1070.0, + 418.0, + 1054.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 397.0, + 1114.0, + 397.0, + 1114.0, + 414.0, + 1080.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 413.0, + 367.0, + 413.0, + 367.0, + 430.0, + 352.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 411.0, + 436.0, + 411.0, + 436.0, + 433.0, + 396.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 411.0, + 493.0, + 411.0, + 493.0, + 433.0, + 449.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 411.0, + 548.0, + 411.0, + 548.0, + 433.0, + 507.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 411.0, + 605.0, + 411.0, + 605.0, + 433.0, + 563.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 411.0, + 663.0, + 411.0, + 663.0, + 433.0, + 615.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 416.0, + 723.0, + 416.0, + 723.0, + 438.0, + 703.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 415.0, + 793.0, + 415.0, + 793.0, + 438.0, + 751.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 418.0, + 851.0, + 418.0, + 851.0, + 435.0, + 811.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 418.0, + 910.0, + 418.0, + 910.0, + 435.0, + 870.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 416.0, + 971.0, + 416.0, + 971.0, + 438.0, + 927.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 414.0, + 1031.0, + 414.0, + 1031.0, + 436.0, + 978.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 418.0, + 1090.0, + 418.0, + 1090.0, + 435.0, + 1074.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 415.0, + 1161.0, + 415.0, + 1161.0, + 438.0, + 1120.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 418.0, + 1220.0, + 418.0, + 1220.0, + 435.0, + 1179.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 415.0, + 1279.0, + 415.0, + 1279.0, + 436.0, + 1236.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 415.0, + 1339.0, + 415.0, + 1339.0, + 438.0, + 1295.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 418.0, + 1398.0, + 418.0, + 1398.0, + 435.0, + 1351.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 425.0, + 573.0, + 425.0, + 573.0, + 449.0, + 429.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 786.0, + 430.0, + 939.0, + 430.0, + 939.0, + 454.0, + 786.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 430.0, + 1306.0, + 430.0, + 1306.0, + 454.0, + 1155.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 461.0, + 502.0, + 461.0, + 502.0, + 496.0, + 461.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 465.0, + 872.0, + 465.0, + 872.0, + 503.0, + 827.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 465.0, + 1240.0, + 465.0, + 1240.0, + 503.0, + 1195.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 324.0, + 532.0, + 324.0, + 532.0, + 337.0, + 486.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 324.0, + 920.0, + 324.0, + 920.0, + 348.5, + 842.0, + 348.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 351.5, + 846.0, + 351.5, + 846.0, + 368.5, + 797.0, + 368.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 335.5, + 1260.0, + 335.5, + 1260.0, + 359.5, + 1172.0, + 359.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.75, + 379.0, + 1380.75, + 379.0, + 1380.75, + 395.0, + 1336.75, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 514.0, + 1407.0, + 514.0, + 1407.0, + 553.0, + 293.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 546.0, + 1216.0, + 546.0, + 1216.0, + 584.0, + 294.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 546.0, + 1406.0, + 546.0, + 1406.0, + 584.0, + 1273.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 576.0, + 1408.0, + 576.0, + 1408.0, + 611.0, + 294.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 605.0, + 296.0, + 605.0, + 296.0, + 645.0, + 293.0, + 645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 605.0, + 1407.0, + 605.0, + 1407.0, + 645.0, + 335.0, + 645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 635.0, + 1092.0, + 635.0, + 1092.0, + 672.0, + 293.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 635.0, + 1404.0, + 635.0, + 1404.0, + 672.0, + 1160.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 666.0, + 1404.0, + 666.0, + 1404.0, + 703.0, + 294.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 697.0, + 878.0, + 697.0, + 878.0, + 733.0, + 294.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1886.0, + 958.0, + 1886.0, + 958.0, + 1929.0, + 294.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1688.0, + 537.0, + 1688.0, + 537.0, + 1742.0, + 288.0, + 1742.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": [ + 294.0, + 1760.0, + 1405.0, + 1760.0, + 1405.0, + 1797.0, + 294.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1791.0, + 1407.0, + 1791.0, + 1407.0, + 1827.0, + 292.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1824.0, + 535.0, + 1824.0, + 535.0, + 1857.0, + 295.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1535.0, + 276.0, + 1535.0, + 276.0, + 1562.0, + 239.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1530.0, + 1105.0, + 1530.0, + 1105.0, + 1565.0, + 295.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1530.0, + 1405.0, + 1530.0, + 1405.0, + 1565.0, + 1275.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1566.0, + 277.0, + 1566.0, + 277.0, + 1593.0, + 239.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1561.0, + 454.0, + 1561.0, + 454.0, + 1596.0, + 295.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 475.0, + 1561.0, + 869.0, + 1561.0, + 869.0, + 1596.0, + 475.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1561.0, + 1294.0, + 1561.0, + 1294.0, + 1596.0, + 888.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 1561.0, + 1406.0, + 1561.0, + 1406.0, + 1596.0, + 1349.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1597.0, + 277.0, + 1597.0, + 277.0, + 1622.0, + 239.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1591.0, + 1402.0, + 1591.0, + 1402.0, + 1622.0, + 297.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1627.0, + 277.0, + 1627.0, + 277.0, + 1653.0, + 239.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1617.0, + 1114.0, + 1617.0, + 1114.0, + 1659.0, + 292.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 252.0, + 1945.0, + 1405.0, + 1945.0, + 1405.0, + 1980.0, + 252.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 252.0, + 1974.0, + 429.0, + 1974.0, + 429.0, + 2010.0, + 252.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1974.0, + 1020.0, + 1974.0, + 1020.0, + 2010.0, + 497.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 1974.0, + 1182.0, + 1974.0, + 1182.0, + 2010.0, + 1097.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1212.0, + 1974.0, + 1406.0, + 1974.0, + 1406.0, + 2010.0, + 1212.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 254.0, + 777.0, + 711.0, + 777.0, + 711.0, + 821.0, + 254.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 777.0, + 1213.0, + 777.0, + 1213.0, + 821.0, + 938.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 777.0, + 1408.0, + 777.0, + 1408.0, + 821.0, + 1403.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 251.0, + 810.0, + 401.0, + 810.0, + 401.0, + 853.0, + 251.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 810.0, + 582.0, + 810.0, + 582.0, + 853.0, + 533.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 810.0, + 850.0, + 810.0, + 850.0, + 853.0, + 695.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 810.0, + 944.0, + 810.0, + 944.0, + 853.0, + 935.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 810.0, + 1080.0, + 810.0, + 1080.0, + 853.0, + 1031.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 810.0, + 1208.0, + 810.0, + 1208.0, + 853.0, + 1101.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 810.0, + 1411.0, + 810.0, + 1411.0, + 853.0, + 1397.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 253.0, + 1192.0, + 890.0, + 1192.0, + 890.0, + 1228.0, + 253.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1192.0, + 945.0, + 1192.0, + 945.0, + 1228.0, + 916.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1192.0, + 1407.0, + 1192.0, + 1407.0, + 1228.0, + 971.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 256.0, + 1223.0, + 879.0, + 1223.0, + 879.0, + 1259.0, + 256.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1223.0, + 1314.0, + 1223.0, + 1314.0, + 1259.0, + 1184.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1318.0, + 279.0, + 1318.0, + 279.0, + 1346.0, + 239.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1309.0, + 1236.0, + 1309.0, + 1236.0, + 1351.0, + 289.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 1309.0, + 1404.0, + 1309.0, + 1404.0, + 1351.0, + 1258.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1348.0, + 281.0, + 1348.0, + 281.0, + 1376.0, + 240.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1342.0, + 610.0, + 1342.0, + 610.0, + 1378.0, + 288.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1384.0, + 718.0, + 1384.0, + 718.0, + 1428.0, + 235.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 1384.0, + 1277.0, + 1384.0, + 1277.0, + 1428.0, + 1146.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1062.0, + 277.0, + 1062.0, + 277.0, + 1088.0, + 240.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1054.0, + 1406.0, + 1054.0, + 1406.0, + 1091.0, + 293.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1092.0, + 278.0, + 1092.0, + 278.0, + 1119.0, + 240.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1086.0, + 677.0, + 1086.0, + 677.0, + 1122.0, + 294.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 1086.0, + 1331.0, + 1086.0, + 1331.0, + 1122.0, + 757.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 1086.0, + 1407.0, + 1086.0, + 1407.0, + 1122.0, + 1398.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1123.0, + 277.0, + 1123.0, + 277.0, + 1149.0, + 240.0, + 1149.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1115.0, + 719.0, + 1115.0, + 719.0, + 1152.0, + 294.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1115.0, + 1199.0, + 1115.0, + 1199.0, + 1152.0, + 739.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 1115.0, + 1406.0, + 1115.0, + 1406.0, + 1152.0, + 1220.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1153.0, + 277.0, + 1153.0, + 277.0, + 1179.0, + 240.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1146.0, + 854.0, + 1146.0, + 854.0, + 1183.0, + 293.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 259.0, + 947.0, + 633.0, + 947.0, + 633.0, + 988.0, + 259.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 947.0, + 934.0, + 947.0, + 934.0, + 988.0, + 827.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 853.0, + 297.0, + 853.0, + 297.0, + 901.0, + 293.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 853.0, + 652.0, + 853.0, + 652.0, + 901.0, + 323.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 853.0, + 1407.0, + 853.0, + 1407.0, + 901.0, + 1402.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 260.0, + 902.0, + 296.0, + 902.0, + 296.0, + 945.0, + 260.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 902.0, + 620.0, + 902.0, + 620.0, + 945.0, + 324.0, + 945.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 240, + 427, + 1404, + 427, + 1404, + 588, + 240, + 588 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 243, + 885, + 1405, + 885, + 1405, + 1163, + 243, + 1163 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 237, + 1595, + 1406, + 1595, + 1406, + 1812, + 237, + 1812 + ], + "score": 0.966 + }, + { + "category_id": 5, + "poly": [ + 388, + 259, + 1310, + 259, + 1310, + 358, + 388, + 358 + ], + "score": 0.966, + "html": "
MethodL1 logregL2 logregDictL + L2 logregTask-driven DictL
AUC (%)71.6 ± 2.072.4± 2.868.3 ± 2.373.2 ± 2.1
" + }, + { + "category_id": 1, + "poly": [ + 252, + 1252, + 1402, + 1252, + 1402, + 1467, + 252, + 1467 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 238, + 744, + 1404, + 744, + 1404, + 874, + 238, + 874 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 239, + 1822, + 1404, + 1822, + 1404, + 2008, + 239, + 2008 + ], + "score": 0.964 + }, + { + "category_id": 8, + "poly": [ + 300, + 599, + 1399, + 599, + 1399, + 720, + 300, + 720 + ], + "score": 0.928 + }, + { + "category_id": 0, + "poly": [ + 279, + 1196, + 738, + 1196, + 738, + 1230, + 279, + 1230 + ], + "score": 0.915 + }, + { + "category_id": 6, + "poly": [ + 309, + 216, + 1370, + 216, + 1370, + 249, + 309, + 249 + ], + "score": 0.897 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1484, + 1400, + 1484, + 1400, + 1515, + 1352, + 1515 + ], + "score": 0.869 + }, + { + "category_id": 9, + "poly": [ + 1352, + 718, + 1400, + 718, + 1400, + 747, + 1352, + 747 + ], + "score": 0.845 + }, + { + "category_id": 2, + "poly": [ + 840, + 2061, + 859, + 2061, + 859, + 2085, + 840, + 2085 + ], + "score": 0.806 + }, + { + "category_id": 3, + "poly": [ + 362, + 1479, + 1285, + 1479, + 1285, + 1579, + 362, + 1579 + ], + "score": 0.661 + }, + { + "category_id": 8, + "poly": [ + 362, + 1479, + 1285, + 1479, + 1285, + 1579, + 362, + 1579 + ], + "score": 0.346 + }, + { + "category_id": 13, + "poly": [ + 1234, + 1404, + 1396, + 1404, + 1396, + 1438, + 1234, + 1438 + ], + "score": 0.93, + "latex": "Y _ { \\mathbf { t r } } \\in \\{ 0 , 1 \\} ^ { m }" + }, + { + "category_id": 13, + "poly": [ + 1311, + 917, + 1398, + 917, + 1398, + 951, + 1311, + 951 + ], + "score": 0.93, + "latex": "F ( x , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 885, + 1039, + 951, + 1039, + 951, + 1071, + 885, + 1071 + ], + "score": 0.93, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 597, + 458, + 664, + 458, + 664, + 492, + 597, + 492 + ], + "score": 0.93, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 649, + 490, + 800, + 490, + 800, + 522, + 649, + 522 + ], + "score": 0.93, + "latex": "X _ { \\mathsf { t r } } \\in \\mathbb { R } ^ { m \\times p }" + }, + { + "category_id": 13, + "poly": [ + 819, + 1658, + 885, + 1658, + 885, + 1690, + 819, + 1690 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 696, + 1343, + 940, + 1343, + 940, + 1376, + 696, + 1376 + ], + "score": 0.92, + "latex": "f ( x , \\theta ) \\mathrel { \\mathop : } = \\ell ( X _ { \\mathrm { t r } } , x \\theta )" + }, + { + "category_id": 13, + "poly": [ + 808, + 842, + 866, + 842, + 866, + 873, + 808, + 873 + ], + "score": 0.92, + "latex": "X _ { \\mathtt { v a l } }" + }, + { + "category_id": 13, + "poly": [ + 1173, + 1313, + 1349, + 1313, + 1349, + 1346, + 1173, + 1346 + ], + "score": 0.92, + "latex": "\\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) \\in \\mathbb { R } ^ { m \\times k }" + }, + { + "category_id": 13, + "poly": [ + 876, + 459, + 942, + 459, + 942, + 492, + 876, + 492 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 557, + 886, + 622, + 886, + 622, + 920, + 557, + 920 + ], + "score": 0.92, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 298, + 809, + 538, + 809, + 538, + 844, + 298, + 844 + ], + "score": 0.92, + "latex": "W ( x ^ { \\star } ( \\theta ) , \\theta ) \\in \\mathbb { R } ^ { p \\times k }" + }, + { + "category_id": 13, + "poly": [ + 623, + 1312, + 741, + 1312, + 741, + 1342, + 623, + 1342 + ], + "score": 0.92, + "latex": "\\theta \\in \\mathbb { R } ^ { k \\times p }" + }, + { + "category_id": 13, + "poly": [ + 370, + 745, + 599, + 745, + 599, + 776, + 370, + 776 + ], + "score": 0.92, + "latex": "\\mathcal { C } = \\triangle ^ { k } \\times \\cdot \\cdot \\cdot \\times \\triangle ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 904, + 429, + 993, + 429, + 993, + 461, + 904, + 461 + ], + "score": 0.91, + "latex": "\\theta \\in \\mathbb { R } _ { + }" + }, + { + "category_id": 13, + "poly": [ + 911, + 522, + 1326, + 522, + 1326, + 558, + 911, + 558 + ], + "score": 0.91, + "latex": "W ( x , \\theta ) : = X _ { \\mathrm { t r } } ^ { \\top } ( Y _ { \\mathrm { t r } } - x ) / \\theta \\in \\bar { \\mathbb { R } } ^ { p \\times k }" + }, + { + "category_id": 13, + "poly": [ + 1175, + 489, + 1367, + 489, + 1367, + 524, + 1175, + 524 + ], + "score": 0.91, + "latex": "Y _ { \\mathrm { t r } } \\in \\{ 0 , 1 \\} ^ { m \\times k }" + }, + { + "category_id": 13, + "poly": [ + 917, + 842, + 967, + 842, + 967, + 873, + 917, + 873 + ], + "score": 0.91, + "latex": "Y _ { \\tt v a l }" + }, + { + "category_id": 13, + "poly": [ + 1208, + 1886, + 1339, + 1886, + 1339, + 1917, + 1208, + 1917 + ], + "score": 0.91, + "latex": "p = 1 , 0 0 0" + }, + { + "category_id": 13, + "poly": [ + 1249, + 1282, + 1399, + 1282, + 1399, + 1312, + 1249, + 1312 + ], + "score": 0.91, + "latex": "X _ { \\mathsf { t r } } \\in \\dot { \\mathbb { R } } ^ { m \\times p }" + }, + { + "category_id": 13, + "poly": [ + 428, + 778, + 569, + 778, + 569, + 810, + 428, + 810 + ], + "score": 0.9, + "latex": "\\theta = \\exp ( \\lambda )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1374, + 351, + 1374, + 351, + 1407, + 297, + 1407 + ], + "score": 0.9, + "latex": "g ( x )" + }, + { + "category_id": 13, + "poly": [ + 865, + 1947, + 899, + 1947, + 899, + 1976, + 865, + 1976 + ], + "score": 0.88, + "latex": "L _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 390, + 489, + 431, + 489, + 431, + 520, + 390, + 520 + ], + "score": 0.88, + "latex": "\\triangle ^ { k }" + }, + { + "category_id": 13, + "poly": [ + 798, + 1947, + 832, + 1947, + 832, + 1976, + 798, + 1976 + ], + "score": 0.88, + "latex": "L _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 680, + 1068, + 759, + 1068, + 759, + 1102, + 680, + 1102 + ], + "score": 0.88, + "latex": "\\overset { \\varphi } { c } ( y , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 304, + 1885, + 437, + 1885, + 437, + 1916, + 304, + 1916 + ], + "score": 0.88, + "latex": "( m _ { 1 } = 2 0 0 )" + }, + { + "category_id": 13, + "poly": [ + 1039, + 1008, + 1096, + 1008, + 1096, + 1038, + 1039, + 1038 + ], + "score": 0.87, + "latex": "\\ S \\mathbf { B } . 1" + }, + { + "category_id": 13, + "poly": [ + 1009, + 1886, + 1126, + 1886, + 1126, + 1916, + 1009, + 1916 + ], + "score": 0.87, + "latex": "m _ { 0 } = 9 9 ," + }, + { + "category_id": 13, + "poly": [ + 612, + 217, + 667, + 217, + 667, + 246, + 612, + 246 + ], + "score": 0.86, + "latex": "9 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 951, + 1689, + 984, + 1689, + 984, + 1715, + 951, + 1715 + ], + "score": 0.86, + "latex": "x ^ { \\star }" + }, + { + "category_id": 13, + "poly": [ + 749, + 1719, + 769, + 1719, + 769, + 1749, + 749, + 1749 + ], + "score": 0.85, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 523, + 1315, + 542, + 1315, + 542, + 1341, + 523, + 1341 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1031, + 1602, + 1050, + 1602, + 1050, + 1629, + 1031, + 1629 + ], + "score": 0.81, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 552, + 430, + 571, + 430, + 571, + 456, + 552, + 456 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1112, + 779, + 1130, + 779, + 1130, + 805, + 1112, + 805 + ], + "score": 0.79, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 778, + 1377, + 796, + 1377, + 796, + 1401, + 778, + 1401 + ], + "score": 0.77, + "latex": "\\theta" + }, + { + "category_id": 14, + "poly": [ + 310, + 600, + 1399, + 600, + 1399, + 676, + 310, + 676 + ], + "score": 0.75, + "latex": "\\operatorname * { a r g m i n } _ { \\boldsymbol { x } = \\mathrm { e x p } ( \\boldsymbol { x } ) } \\frac { 1 } { 2 } \\| X _ { \\mathrm { v a l } } W ( \\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) , \\boldsymbol { \\theta } ) - Y _ { \\mathrm { v a l } } \\| _ { F } ^ { 2 } \\quad \\mathrm { s u b j e c t ~ t o } \\quad \\boldsymbol { x } ^ { \\star } ( \\boldsymbol { \\theta } ) = \\operatorname * { a r g m i n } _ { \\boldsymbol { x } \\in \\mathcal { C } } f ( \\boldsymbol { x } , \\boldsymbol { \\theta } ) : = \\frac { \\theta } { 2 } \\| W ( \\boldsymbol { x } , \\boldsymbol { \\theta } ) \\| _ { F } ^ { 2 } ," + }, + { + "category_id": 13, + "poly": [ + 685, + 1719, + 701, + 1719, + 701, + 1745, + 685, + 1745 + ], + "score": 0.73, + "latex": "\\ell" + }, + { + "category_id": 13, + "poly": [ + 678, + 1011, + 797, + 1011, + 797, + 1040, + 678, + 1040 + ], + "score": 0.73, + "latex": "{ \\mathrm { j a x . v m a p } }" + }, + { + "category_id": 13, + "poly": [ + 897, + 753, + 924, + 753, + 924, + 776, + 897, + 776 + ], + "score": 0.73, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 444, + 1349, + 464, + 1349, + 464, + 1371, + 444, + 1371 + ], + "score": 0.73, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 371, + 1598, + 387, + 1598, + 387, + 1624, + 371, + 1624 + ], + "score": 0.69, + "latex": "\\ell" + }, + { + "category_id": 13, + "poly": [ + 1224, + 1658, + 1242, + 1658, + 1242, + 1686, + 1224, + 1686 + ], + "score": 0.69, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1076, + 949, + 1097, + 949, + 1097, + 975, + 1076, + 975 + ], + "score": 0.68, + "latex": "\\mathcal { C }" + }, + { + "category_id": 13, + "poly": [ + 1061, + 1688, + 1079, + 1688, + 1079, + 1715, + 1061, + 1715 + ], + "score": 0.66, + "latex": "\\theta" + }, + { + "category_id": 14, + "poly": [ + 362, + 1476, + 1289, + 1476, + 1289, + 1584, + 362, + 1584 + ], + "score": 0.58, + "latex": "\\underbrace { \\operatorname* { m i n } _ { \\theta \\in \\mathbb { R } ^ { k \\times p } , w \\in \\mathbb { R } ^ { k } , b \\in \\mathbb { R } } \\sigma ( x ^ { \\star } ( \\theta ) w + b ; y _ { \\mathrm { t r } } ) } _ { \\mathrm { o u t e r ~ p r o b l e m } } \\mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \\star } ( \\theta ) \\in \\underbrace { \\mathrm { a r g m i n ~ } f ( x , \\theta ) + g ( x ) } _ { \\mathrm { i n n e r ~ p r o b l e m } } ." + }, + { + "category_id": 14, + "poly": [ + 363, + 1478, + 785, + 1478, + 785, + 1580, + 363, + 1580 + ], + "score": 0.25, + "latex": "\\underbrace { \\operatorname* { m i n } _ { \\theta \\in \\mathbb { R } ^ { k \\times p } , w \\in \\mathbb { R } ^ { k } , b \\in \\mathbb { R } } } _ { \\mathrm { o u t e r ~ p r o b l e m } } \\sigma ( x ^ { \\star } ( \\theta ) w + b ; y _ { \\mathrm { t r } } )" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1192.0, + 742.0, + 1192.0, + 742.0, + 1236.0, + 293.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 210.0, + 611.0, + 210.0, + 611.0, + 253.0, + 322.0, + 253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 210.0, + 1374.0, + 210.0, + 1374.0, + 253.0, + 668.0, + 253.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": [ + 237.0, + 433.0, + 280.0, + 433.0, + 280.0, + 461.0, + 237.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 429.0, + 551.0, + 429.0, + 551.0, + 463.0, + 294.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 429.0, + 903.0, + 429.0, + 903.0, + 463.0, + 572.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 429.0, + 1404.0, + 429.0, + 1404.0, + 463.0, + 994.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 463.0, + 280.0, + 463.0, + 280.0, + 491.0, + 237.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 454.0, + 596.0, + 454.0, + 596.0, + 495.0, + 293.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 454.0, + 875.0, + 454.0, + 875.0, + 495.0, + 665.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 454.0, + 1404.0, + 454.0, + 1404.0, + 495.0, + 943.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 495.0, + 280.0, + 495.0, + 280.0, + 524.0, + 237.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 486.0, + 389.0, + 486.0, + 389.0, + 528.0, + 291.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 486.0, + 648.0, + 486.0, + 648.0, + 528.0, + 432.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 486.0, + 1174.0, + 486.0, + 1174.0, + 528.0, + 801.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1368.0, + 486.0, + 1407.0, + 486.0, + 1407.0, + 528.0, + 1368.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 528.0, + 280.0, + 528.0, + 280.0, + 558.0, + 239.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 518.0, + 910.0, + 518.0, + 910.0, + 563.0, + 290.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 518.0, + 1408.0, + 518.0, + 1408.0, + 563.0, + 1327.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 562.0, + 278.0, + 562.0, + 278.0, + 588.0, + 240.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 554.0, + 1249.0, + 554.0, + 1249.0, + 592.0, + 291.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 890.0, + 277.0, + 890.0, + 277.0, + 919.0, + 239.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 885.0, + 556.0, + 885.0, + 556.0, + 922.0, + 292.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 885.0, + 1406.0, + 885.0, + 1406.0, + 922.0, + 623.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 922.0, + 277.0, + 922.0, + 277.0, + 952.0, + 238.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 916.0, + 1310.0, + 916.0, + 1310.0, + 953.0, + 293.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 916.0, + 1408.0, + 916.0, + 1408.0, + 953.0, + 1399.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 952.0, + 277.0, + 952.0, + 277.0, + 981.0, + 238.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 947.0, + 1075.0, + 947.0, + 1075.0, + 983.0, + 292.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 947.0, + 1406.0, + 947.0, + 1406.0, + 983.0, + 1098.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 982.0, + 278.0, + 982.0, + 278.0, + 1011.0, + 238.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 975.0, + 1408.0, + 975.0, + 1408.0, + 1015.0, + 290.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1012.0, + 278.0, + 1012.0, + 278.0, + 1041.0, + 238.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1007.0, + 677.0, + 1007.0, + 677.0, + 1042.0, + 293.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1007.0, + 1038.0, + 1007.0, + 1038.0, + 1042.0, + 798.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 1007.0, + 1406.0, + 1007.0, + 1406.0, + 1042.0, + 1097.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1044.0, + 278.0, + 1044.0, + 278.0, + 1073.0, + 238.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1036.0, + 884.0, + 1036.0, + 884.0, + 1073.0, + 294.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1036.0, + 1405.0, + 1036.0, + 1405.0, + 1073.0, + 952.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1073.0, + 278.0, + 1073.0, + 278.0, + 1103.0, + 238.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1065.0, + 679.0, + 1065.0, + 679.0, + 1107.0, + 290.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 1065.0, + 1408.0, + 1065.0, + 1408.0, + 1107.0, + 760.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1105.0, + 277.0, + 1105.0, + 277.0, + 1130.0, + 239.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1099.0, + 1409.0, + 1099.0, + 1409.0, + 1132.0, + 294.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1137.0, + 277.0, + 1137.0, + 277.0, + 1162.0, + 239.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1129.0, + 1376.0, + 1129.0, + 1376.0, + 1166.0, + 294.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1602.0, + 277.0, + 1602.0, + 277.0, + 1628.0, + 240.0, + 1628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1589.0, + 370.0, + 1589.0, + 370.0, + 1637.0, + 290.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1589.0, + 1030.0, + 1589.0, + 1030.0, + 1637.0, + 388.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 1589.0, + 1411.0, + 1589.0, + 1411.0, + 1637.0, + 1051.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1633.0, + 277.0, + 1633.0, + 277.0, + 1658.0, + 240.0, + 1658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1626.0, + 1406.0, + 1626.0, + 1406.0, + 1661.0, + 294.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1662.0, + 277.0, + 1662.0, + 277.0, + 1689.0, + 240.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1657.0, + 818.0, + 1657.0, + 818.0, + 1692.0, + 295.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1657.0, + 1223.0, + 1657.0, + 1223.0, + 1692.0, + 886.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 1657.0, + 1407.0, + 1657.0, + 1407.0, + 1692.0, + 1243.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1692.0, + 276.0, + 1692.0, + 276.0, + 1719.0, + 240.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1687.0, + 950.0, + 1687.0, + 950.0, + 1722.0, + 295.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1687.0, + 1060.0, + 1687.0, + 1060.0, + 1722.0, + 985.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 1687.0, + 1407.0, + 1687.0, + 1407.0, + 1722.0, + 1080.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1723.0, + 277.0, + 1723.0, + 277.0, + 1750.0, + 240.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1715.0, + 684.0, + 1715.0, + 684.0, + 1753.0, + 291.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 702.0, + 1715.0, + 748.0, + 1715.0, + 748.0, + 1753.0, + 702.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 1715.0, + 1407.0, + 1715.0, + 1407.0, + 1753.0, + 770.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1754.0, + 277.0, + 1754.0, + 277.0, + 1781.0, + 240.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1747.0, + 1406.0, + 1747.0, + 1406.0, + 1783.0, + 295.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1784.0, + 277.0, + 1784.0, + 277.0, + 1810.0, + 240.0, + 1810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1774.0, + 1309.0, + 1774.0, + 1309.0, + 1815.0, + 293.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1257.0, + 278.0, + 1257.0, + 278.0, + 1283.0, + 248.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1250.0, + 1406.0, + 1250.0, + 1406.0, + 1287.0, + 289.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 246.0, + 1286.0, + 280.0, + 1286.0, + 280.0, + 1315.0, + 246.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1278.0, + 1248.0, + 1278.0, + 1248.0, + 1319.0, + 289.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1400.0, + 1278.0, + 1408.0, + 1278.0, + 1408.0, + 1319.0, + 1400.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 246.0, + 1320.0, + 279.0, + 1320.0, + 279.0, + 1345.0, + 246.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1308.0, + 522.0, + 1308.0, + 522.0, + 1350.0, + 291.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 1308.0, + 622.0, + 1308.0, + 622.0, + 1350.0, + 543.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 1308.0, + 1172.0, + 1308.0, + 1172.0, + 1350.0, + 742.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1350.0, + 1308.0, + 1408.0, + 1308.0, + 1408.0, + 1350.0, + 1350.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 246.0, + 1351.0, + 279.0, + 1351.0, + 279.0, + 1374.0, + 246.0, + 1374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1340.0, + 443.0, + 1340.0, + 443.0, + 1380.0, + 291.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1340.0, + 695.0, + 1340.0, + 695.0, + 1380.0, + 465.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 1340.0, + 1405.0, + 1340.0, + 1405.0, + 1380.0, + 941.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 246.0, + 1378.0, + 280.0, + 1378.0, + 280.0, + 1406.0, + 246.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1372.0, + 296.0, + 1372.0, + 296.0, + 1409.0, + 292.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1372.0, + 777.0, + 1372.0, + 777.0, + 1409.0, + 352.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1372.0, + 1406.0, + 1372.0, + 1406.0, + 1409.0, + 797.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1411.0, + 279.0, + 1411.0, + 279.0, + 1436.0, + 248.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1395.0, + 1233.0, + 1395.0, + 1233.0, + 1446.0, + 289.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 1395.0, + 1410.0, + 1395.0, + 1410.0, + 1446.0, + 1397.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 1442.0, + 279.0, + 1442.0, + 279.0, + 1467.0, + 248.0, + 1467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1435.0, + 1320.0, + 1435.0, + 1320.0, + 1469.0, + 293.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 752.0, + 278.0, + 752.0, + 278.0, + 779.0, + 239.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 740.0, + 369.0, + 740.0, + 369.0, + 786.0, + 292.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 740.0, + 896.0, + 740.0, + 896.0, + 786.0, + 600.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 740.0, + 1405.0, + 740.0, + 1405.0, + 786.0, + 925.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 782.0, + 278.0, + 782.0, + 278.0, + 809.0, + 239.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 773.0, + 427.0, + 773.0, + 427.0, + 815.0, + 292.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 773.0, + 1111.0, + 773.0, + 1111.0, + 815.0, + 570.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 773.0, + 1404.0, + 773.0, + 1404.0, + 815.0, + 1131.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 815.0, + 278.0, + 815.0, + 278.0, + 842.0, + 239.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 802.0, + 297.0, + 802.0, + 297.0, + 849.0, + 292.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 802.0, + 1407.0, + 802.0, + 1407.0, + 849.0, + 539.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 846.0, + 278.0, + 846.0, + 278.0, + 874.0, + 239.0, + 874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 836.0, + 807.0, + 836.0, + 807.0, + 881.0, + 291.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 836.0, + 916.0, + 836.0, + 916.0, + 881.0, + 867.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 836.0, + 979.0, + 836.0, + 979.0, + 881.0, + 968.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1829.0, + 277.0, + 1829.0, + 277.0, + 1854.0, + 239.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1820.0, + 1409.0, + 1820.0, + 1409.0, + 1859.0, + 292.0, + 1859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1859.0, + 279.0, + 1859.0, + 279.0, + 1887.0, + 238.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1854.0, + 1405.0, + 1854.0, + 1405.0, + 1888.0, + 293.0, + 1888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1888.0, + 279.0, + 1888.0, + 279.0, + 1916.0, + 238.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1883.0, + 303.0, + 1883.0, + 303.0, + 1920.0, + 292.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 1883.0, + 1008.0, + 1883.0, + 1008.0, + 1920.0, + 438.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 1883.0, + 1207.0, + 1883.0, + 1207.0, + 1920.0, + 1127.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1883.0, + 1405.0, + 1883.0, + 1405.0, + 1920.0, + 1340.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1919.0, + 279.0, + 1919.0, + 279.0, + 1947.0, + 238.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1914.0, + 1405.0, + 1914.0, + 1405.0, + 1949.0, + 293.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1952.0, + 277.0, + 1952.0, + 277.0, + 1976.0, + 239.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1946.0, + 797.0, + 1946.0, + 797.0, + 1980.0, + 292.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 1946.0, + 864.0, + 1946.0, + 864.0, + 1980.0, + 833.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 1946.0, + 1407.0, + 1946.0, + 1407.0, + 1980.0, + 900.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1980.0, + 279.0, + 1980.0, + 279.0, + 2008.0, + 238.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1975.0, + 878.0, + 1975.0, + 878.0, + 2011.0, + 294.0, + 2011.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 238, + 551, + 1406, + 551, + 1406, + 773, + 238, + 773 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 265, + 995, + 1405, + 995, + 1405, + 1302, + 265, + 1302 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 252, + 1401, + 1036, + 1401, + 1036, + 1646, + 252, + 1646 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 1062, + 1377, + 1396, + 1377, + 1396, + 1709, + 1062, + 1709 + ], + "score": 0.968 + }, + { + "category_id": 4, + "poly": [ + 1055, + 1725, + 1405, + 1725, + 1405, + 1848, + 1055, + 1848 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 449, + 1667, + 878, + 1667, + 878, + 1740, + 449, + 1740 + ], + "score": 0.95 + }, + { + "category_id": 3, + "poly": [ + 297, + 219, + 1403, + 219, + 1403, + 319, + 297, + 319 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 254, + 920, + 1403, + 920, + 1403, + 984, + 254, + 984 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 235, + 1916, + 1393, + 1916, + 1393, + 2008, + 235, + 2008 + ], + "score": 0.931 + }, + { + "category_id": 4, + "poly": [ + 295, + 333, + 1404, + 333, + 1404, + 430, + 295, + 430 + ], + "score": 0.924 + }, + { + "category_id": 0, + "poly": [ + 288, + 1343, + 863, + 1343, + 863, + 1377, + 288, + 1377 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 247, + 494, + 587, + 494, + 587, + 526, + 247, + 526 + ], + "score": 0.913 + }, + { + "category_id": 9, + "poly": [ + 1352, + 799, + 1400, + 799, + 1400, + 829, + 1352, + 829 + ], + "score": 0.865 + }, + { + "category_id": 1, + "poly": [ + 240, + 1762, + 1039, + 1762, + 1039, + 1915, + 240, + 1915 + ], + "score": 0.854 + }, + { + "category_id": 2, + "poly": [ + 840, + 2061, + 859, + 2061, + 859, + 2084, + 840, + 2084 + ], + "score": 0.804 + }, + { + "category_id": 8, + "poly": [ + 412, + 794, + 1281, + 794, + 1281, + 896, + 412, + 896 + ], + "score": 0.637 + }, + { + "category_id": 2, + "poly": [ + 593, + 197, + 1077, + 197, + 1077, + 217, + 593, + 217 + ], + "score": 0.629 + }, + { + "category_id": 3, + "poly": [ + 412, + 794, + 1281, + 794, + 1281, + 896, + 412, + 896 + ], + "score": 0.561 + }, + { + "category_id": 2, + "poly": [ + 593, + 197, + 1078, + 197, + 1078, + 217, + 593, + 217 + ], + "score": 0.135 + }, + { + "category_id": 14, + "poly": [ + 449, + 1664, + 878, + 1664, + 878, + 1742, + 449, + 1742 + ], + "score": 0.94, + "latex": "x ^ { \\star } ( \\theta ) = { \\underset { x \\in \\mathbb { R } ^ { k \\times m } } { \\operatorname { a r g m i n } } } \\sum _ { i j } U ( x _ { i j } \\mod \\ell , \\theta ) ," + }, + { + "category_id": 13, + "poly": [ + 1204, + 582, + 1354, + 582, + 1354, + 614, + 1204, + 614 + ], + "score": 0.94, + "latex": "X _ { \\mathsf { t r } } \\in \\mathbb { R } ^ { m \\times p }" + }, + { + "category_id": 13, + "poly": [ + 370, + 1763, + 477, + 1763, + 477, + 1797, + 370, + 1797 + ], + "score": 0.93, + "latex": "U ( x _ { i j } , \\theta )" + }, + { + "category_id": 13, + "poly": [ + 425, + 1086, + 597, + 1086, + 597, + 1119, + 425, + 1119 + ], + "score": 0.93, + "latex": "p = 2 8 ^ { 2 } \\overset { \\cdot } { = } 7 8 4" + }, + { + "category_id": 13, + "poly": [ + 298, + 613, + 421, + 613, + 421, + 647, + 298, + 647 + ], + "score": 0.93, + "latex": "y _ { \\mathrm { t r } } \\in [ k ] ^ { m }" + }, + { + "category_id": 13, + "poly": [ + 680, + 332, + 793, + 332, + 793, + 364, + 680, + 364 + ], + "score": 0.93, + "latex": "\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }" + }, + { + "category_id": 13, + "poly": [ + 436, + 740, + 503, + 740, + 503, + 774, + 436, + 774 + ], + "score": 0.93, + "latex": "x ^ { \\star } ( \\theta )" + }, + { + "category_id": 13, + "poly": [ + 1267, + 676, + 1400, + 676, + 1400, + 710, + 1267, + 710 + ], + "score": 0.92, + "latex": "\\dot { { \\boldsymbol { x } } } ^ { \\star } ( { \\boldsymbol { \\theta } } ) \\in \\mathbb { R } ^ { p }" + }, + { + "category_id": 13, + "poly": [ + 642, + 707, + 754, + 707, + 754, + 738, + 642, + 738 + ], + "score": 0.92, + "latex": "\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }" + }, + { + "category_id": 13, + "poly": [ + 607, + 644, + 719, + 644, + 719, + 675, + 607, + 675 + ], + "score": 0.92, + "latex": "\\boldsymbol { \\theta } \\in \\mathbb { R } ^ { k \\times p }" + }, + { + "category_id": 13, + "poly": [ + 945, + 1854, + 1027, + 1854, + 1027, + 1888, + 945, + 1888 + ], + "score": 0.92, + "latex": "{ \\partial x ^ { \\star } ( \\theta ) }" + }, + { + "category_id": 13, + "poly": [ + 1190, + 1088, + 1348, + 1088, + 1348, + 1119, + 1190, + 1119 + ], + "score": 0.91, + "latex": "k \\times p = 7 8 4 0" + }, + { + "category_id": 13, + "poly": [ + 1243, + 920, + 1354, + 920, + 1354, + 950, + 1243, + 950 + ], + "score": 0.91, + "latex": "\\varepsilon = 1 0 ^ { - 3 }" + }, + { + "category_id": 13, + "poly": [ + 373, + 921, + 639, + 921, + 639, + 955, + 373, + 955 + ], + "score": 0.89, + "latex": "f ( x , X ; y ) : = \\ell ( X x , y )" + }, + { + "category_id": 13, + "poly": [ + 821, + 1794, + 910, + 1794, + 910, + 1822, + 821, + 1822 + ], + "score": 0.89, + "latex": "\\theta = 0 . 6" + }, + { + "category_id": 13, + "poly": [ + 1110, + 1149, + 1142, + 1149, + 1142, + 1179, + 1110, + 1179 + ], + "score": 0.82, + "latex": "\\ S 2" + }, + { + "category_id": 13, + "poly": [ + 959, + 1241, + 977, + 1241, + 977, + 1267, + 959, + 1267 + ], + "score": 0.79, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 862, + 1589, + 890, + 1589, + 890, + 1613, + 862, + 1613 + ], + "score": 0.78, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 841, + 367, + 860, + 367, + 860, + 394, + 841, + 394 + ], + "score": 0.75, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 446, + 1616, + 460, + 1616, + 460, + 1642, + 446, + 1642 + ], + "score": 0.68, + "latex": "\\ell" + }, + { + "category_id": 13, + "poly": [ + 649, + 923, + 665, + 923, + 665, + 949, + 649, + 949 + ], + "score": 0.6, + "latex": "\\ell" + }, + { + "category_id": 14, + "poly": [ + 411, + 793, + 1283, + 793, + 1283, + 859, + 411, + 859 + ], + "score": 0.49, + "latex": "\\operatorname * { a r g m i n } _ { \\theta \\in \\mathbb { R } ^ { k \\times p } } f ( x ^ { \\star } ( \\theta ) , X _ { \\mathrm { t r } } ; y _ { \\mathrm { t r } } ) \\mathrm { ~ } \\mathrm { ~ s u b j e c t ~ t o ~ } x ^ { \\star } ( \\theta ) \\in \\underset { x \\in \\mathbb { R } ^ { p } } { \\operatorname { a r g m i n } } f ( x , \\theta ; [ k ] ) + \\varepsilon \\| x \\| ^ { 2 } ," + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 1392.0, + 1126.0, + 1392.0, + 1126.0, + 1406.0, + 1105.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1380.0, + 1348.0, + 1380.0, + 1348.0, + 1421.0, + 1187.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 1401.0, + 1322.0, + 1401.0, + 1322.0, + 1459.0, + 1295.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 1418.0, + 1263.0, + 1418.0, + 1263.0, + 1447.0, + 1230.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1314.0, + 1418.0, + 1344.0, + 1418.0, + 1344.0, + 1446.0, + 1314.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 1432.0, + 1239.0, + 1432.0, + 1239.0, + 1475.0, + 1190.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 1441.0, + 1116.0, + 1441.0, + 1116.0, + 1449.0, + 1103.0, + 1449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 1464.0, + 1134.0, + 1464.0, + 1134.0, + 1482.0, + 1116.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 1453.0, + 1255.0, + 1453.0, + 1255.0, + 1485.0, + 1220.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 1476.0, + 1168.0, + 1476.0, + 1168.0, + 1503.0, + 1145.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 1477.0, + 1222.0, + 1477.0, + 1222.0, + 1498.0, + 1201.0, + 1498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 1480.0, + 1275.0, + 1480.0, + 1275.0, + 1493.0, + 1261.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 1497.0, + 1193.0, + 1497.0, + 1193.0, + 1512.0, + 1173.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 1493.0, + 1254.0, + 1493.0, + 1254.0, + 1518.0, + 1230.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1502.0, + 1338.0, + 1502.0, + 1338.0, + 1513.0, + 1323.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 1509.0, + 1222.0, + 1509.0, + 1222.0, + 1538.0, + 1192.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1529.0, + 1145.0, + 1529.0, + 1145.0, + 1541.0, + 1133.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1228.0, + 1530.0, + 1251.0, + 1530.0, + 1251.0, + 1550.0, + 1228.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 1533.0, + 1115.0, + 1533.0, + 1115.0, + 1544.0, + 1107.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 1580.0, + 1105.0, + 1580.0, + 1105.0, + 1606.0, + 1083.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 1558.0, + 1146.0, + 1558.0, + 1146.0, + 1589.0, + 1116.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 1557.0, + 1274.0, + 1557.0, + 1274.0, + 1564.0, + 1262.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 1578.0, + 1330.0, + 1578.0, + 1330.0, + 1593.0, + 1310.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 1596.0, + 1364.0, + 1596.0, + 1364.0, + 1611.0, + 1345.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1293.0, + 1636.0, + 1309.0, + 1636.0, + 1309.0, + 1651.0, + 1293.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1196.0, + 1649.0, + 1209.0, + 1649.0, + 1209.0, + 1661.0, + 1196.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 1647.0, + 1273.0, + 1647.0, + 1273.0, + 1664.0, + 1261.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1368.0, + 1667.0, + 1383.0, + 1667.0, + 1383.0, + 1678.0, + 1368.0, + 1678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.75, + 1386.0, + 1188.75, + 1386.0, + 1188.75, + 1407.0, + 1156.75, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 1398.0, + 1240.0, + 1398.0, + 1240.0, + 1455.5, + 1147.0, + 1455.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.25, + 1441.5, + 1188.25, + 1441.5, + 1188.25, + 1481.5, + 1146.25, + 1481.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 1511.0, + 1166.0, + 1511.0, + 1166.0, + 1526.5, + 1145.0, + 1526.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1541.5, + 1184.0, + 1541.5, + 1184.0, + 1565.5, + 1135.0, + 1565.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 1723.0, + 1405.0, + 1723.0, + 1405.0, + 1760.0, + 1053.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 1757.0, + 1407.0, + 1757.0, + 1407.0, + 1788.0, + 1055.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 1787.0, + 1403.0, + 1787.0, + 1403.0, + 1818.0, + 1055.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 1814.0, + 1393.0, + 1814.0, + 1393.0, + 1851.0, + 1055.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 206.0, + 1409.0, + 206.0, + 1409.0, + 328.0, + 292.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 329.0, + 679.0, + 329.0, + 679.0, + 373.0, + 293.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 794.0, + 329.0, + 1406.0, + 329.0, + 1406.0, + 373.0, + 794.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 366.0, + 840.0, + 366.0, + 840.0, + 399.0, + 294.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 366.0, + 1405.0, + 366.0, + 1405.0, + 399.0, + 861.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 395.0, + 1070.0, + 395.0, + 1070.0, + 432.0, + 294.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1340.0, + 865.0, + 1340.0, + 865.0, + 1383.0, + 294.0, + 1383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 492.0, + 589.0, + 492.0, + 589.0, + 528.0, + 237.0, + 528.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": [ + 590.0, + 198.0, + 1077.0, + 198.0, + 1077.0, + 218.0, + 590.0, + 218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 866.0, + 628.0, + 866.0, + 628.0, + 897.0, + 507.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 864.0, + 1173.0, + 864.0, + 1173.0, + 894.0, + 1052.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 198.0, + 1075.0, + 198.0, + 1075.0, + 218.0, + 590.0, + 218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 556.0, + 278.0, + 556.0, + 278.0, + 584.0, + 238.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 553.0, + 1404.0, + 553.0, + 1404.0, + 584.0, + 294.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 587.0, + 278.0, + 587.0, + 278.0, + 614.0, + 238.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 582.0, + 1203.0, + 582.0, + 1203.0, + 615.0, + 292.0, + 615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 582.0, + 1406.0, + 582.0, + 1406.0, + 615.0, + 1355.0, + 615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 618.0, + 278.0, + 618.0, + 278.0, + 647.0, + 238.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 610.0, + 297.0, + 610.0, + 297.0, + 651.0, + 291.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 610.0, + 1404.0, + 610.0, + 1404.0, + 651.0, + 422.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 651.0, + 278.0, + 651.0, + 278.0, + 678.0, + 238.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 641.0, + 606.0, + 641.0, + 606.0, + 682.0, + 291.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 641.0, + 1407.0, + 641.0, + 1407.0, + 682.0, + 720.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 681.0, + 278.0, + 681.0, + 278.0, + 709.0, + 238.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 676.0, + 1266.0, + 676.0, + 1266.0, + 711.0, + 294.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 676.0, + 1404.0, + 676.0, + 1404.0, + 711.0, + 1401.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 716.0, + 276.0, + 716.0, + 276.0, + 740.0, + 240.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 705.0, + 641.0, + 705.0, + 641.0, + 746.0, + 290.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 705.0, + 1407.0, + 705.0, + 1407.0, + 746.0, + 755.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 748.0, + 276.0, + 748.0, + 276.0, + 771.0, + 240.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 739.0, + 435.0, + 739.0, + 435.0, + 776.0, + 291.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 739.0, + 743.0, + 739.0, + 743.0, + 776.0, + 504.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 996.0, + 1407.0, + 996.0, + 1407.0, + 1031.0, + 289.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 262.0, + 1038.0, + 276.0, + 1038.0, + 276.0, + 1054.0, + 262.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1026.0, + 1406.0, + 1026.0, + 1406.0, + 1063.0, + 290.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 260.0, + 1067.0, + 276.0, + 1067.0, + 276.0, + 1086.0, + 260.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1056.0, + 1407.0, + 1056.0, + 1407.0, + 1093.0, + 290.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 262.0, + 1099.0, + 276.0, + 1099.0, + 276.0, + 1115.0, + 262.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1085.0, + 424.0, + 1085.0, + 424.0, + 1122.0, + 290.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 1085.0, + 1189.0, + 1085.0, + 1189.0, + 1122.0, + 598.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 1085.0, + 1407.0, + 1085.0, + 1407.0, + 1122.0, + 1349.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 260.0, + 1128.0, + 276.0, + 1128.0, + 276.0, + 1147.0, + 260.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1118.0, + 1406.0, + 1118.0, + 1406.0, + 1154.0, + 293.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 260.0, + 1159.0, + 276.0, + 1159.0, + 276.0, + 1176.0, + 260.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1150.0, + 1109.0, + 1150.0, + 1109.0, + 1182.0, + 295.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 1150.0, + 1405.0, + 1150.0, + 1405.0, + 1182.0, + 1143.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 262.0, + 1190.0, + 273.0, + 1190.0, + 273.0, + 1202.0, + 262.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1178.0, + 1406.0, + 1178.0, + 1406.0, + 1213.0, + 294.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 260.0, + 1220.0, + 276.0, + 1220.0, + 276.0, + 1238.0, + 260.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1211.0, + 1405.0, + 1211.0, + 1405.0, + 1243.0, + 295.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 260.0, + 1249.0, + 276.0, + 1249.0, + 276.0, + 1268.0, + 260.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1239.0, + 958.0, + 1239.0, + 958.0, + 1274.0, + 293.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 1239.0, + 1406.0, + 1239.0, + 1406.0, + 1274.0, + 978.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 260.0, + 1280.0, + 276.0, + 1280.0, + 276.0, + 1297.0, + 260.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1271.0, + 822.0, + 1271.0, + 822.0, + 1302.0, + 292.0, + 1302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1408.0, + 278.0, + 1408.0, + 278.0, + 1434.0, + 247.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1400.0, + 1040.0, + 1400.0, + 1040.0, + 1438.0, + 291.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1438.0, + 278.0, + 1438.0, + 278.0, + 1465.0, + 247.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1432.0, + 1037.0, + 1432.0, + 1037.0, + 1466.0, + 294.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1470.0, + 277.0, + 1470.0, + 277.0, + 1493.0, + 247.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1464.0, + 1035.0, + 1464.0, + 1035.0, + 1494.0, + 295.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1501.0, + 277.0, + 1501.0, + 277.0, + 1524.0, + 247.0, + 1524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1495.0, + 1035.0, + 1495.0, + 1035.0, + 1525.0, + 296.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 244.0, + 1531.0, + 276.0, + 1531.0, + 276.0, + 1554.0, + 244.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1524.0, + 1038.0, + 1524.0, + 1038.0, + 1555.0, + 295.0, + 1555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1561.0, + 276.0, + 1561.0, + 276.0, + 1584.0, + 247.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1551.0, + 1037.0, + 1551.0, + 1037.0, + 1590.0, + 293.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1592.0, + 276.0, + 1592.0, + 276.0, + 1616.0, + 247.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1584.0, + 861.0, + 1584.0, + 861.0, + 1618.0, + 293.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 1584.0, + 1036.0, + 1584.0, + 1036.0, + 1618.0, + 891.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1622.0, + 277.0, + 1622.0, + 277.0, + 1645.0, + 247.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1615.0, + 445.0, + 1615.0, + 445.0, + 1646.0, + 294.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 1615.0, + 471.0, + 1615.0, + 471.0, + 1646.0, + 461.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 248.0, + 928.0, + 281.0, + 928.0, + 281.0, + 952.0, + 248.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 917.0, + 372.0, + 917.0, + 372.0, + 955.0, + 287.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 917.0, + 648.0, + 917.0, + 648.0, + 955.0, + 640.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 666.0, + 917.0, + 1242.0, + 917.0, + 1242.0, + 955.0, + 666.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 917.0, + 1407.0, + 917.0, + 1407.0, + 955.0, + 1355.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 243.0, + 951.0, + 1206.0, + 951.0, + 1206.0, + 987.0, + 243.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1920.0, + 278.0, + 1920.0, + 278.0, + 1946.0, + 239.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1913.0, + 1400.0, + 1913.0, + 1400.0, + 1950.0, + 292.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1951.0, + 279.0, + 1951.0, + 279.0, + 1978.0, + 237.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1945.0, + 1398.0, + 1945.0, + 1398.0, + 1979.0, + 296.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 1984.0, + 277.0, + 1984.0, + 277.0, + 2006.0, + 240.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1976.0, + 1165.0, + 1976.0, + 1165.0, + 2009.0, + 294.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1768.0, + 277.0, + 1768.0, + 277.0, + 1794.0, + 239.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1761.0, + 369.0, + 1761.0, + 369.0, + 1797.0, + 291.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 1761.0, + 1038.0, + 1761.0, + 1038.0, + 1797.0, + 478.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1798.0, + 277.0, + 1798.0, + 277.0, + 1827.0, + 237.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1793.0, + 820.0, + 1793.0, + 820.0, + 1826.0, + 294.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 911.0, + 1793.0, + 1037.0, + 1793.0, + 1037.0, + 1826.0, + 911.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1830.0, + 277.0, + 1830.0, + 277.0, + 1855.0, + 239.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1824.0, + 1037.0, + 1824.0, + 1037.0, + 1855.0, + 294.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1860.0, + 278.0, + 1860.0, + 278.0, + 1886.0, + 239.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1852.0, + 944.0, + 1852.0, + 944.0, + 1890.0, + 293.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 1852.0, + 1038.0, + 1852.0, + 1038.0, + 1890.0, + 1028.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 1891.0, + 278.0, + 1891.0, + 278.0, + 1916.0, + 239.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1884.0, + 1039.0, + 1884.0, + 1039.0, + 1920.0, + 292.0, + 1920.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 277, + 234, + 1411, + 234, + 1411, + 2031, + 277, + 2031 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 867, + 2061, + 867, + 2087, + 836, + 2087 + ], + "score": 0.84 + }, + { + "category_id": 0, + "poly": [ + 241, + 199, + 457, + 199, + 457, + 235, + 241, + 235 + ], + "score": 0.726 + }, + { + "category_id": 2, + "poly": [ + 239, + 218, + 287, + 218, + 287, + 2046, + 239, + 2046 + ], + "score": 0.177 + }, + { + "category_id": 2, + "poly": [ + 241, + 199, + 457, + 199, + 457, + 235, + 241, + 235 + ], + "score": 0.169 + }, + { + "category_id": 13, + "poly": [ + 527, + 1865, + 589, + 1865, + 589, + 1895, + 527, + 1895 + ], + "score": 0.9, + "latex": "O ( n )" + }, + { + "category_id": 13, + "poly": [ + 1275, + 282, + 1400, + 282, + 1400, + 316, + 1275, + 316 + ], + "score": 0.63, + "latex": "\\{ U S E N I X \\}" + }, + { + "category_id": 13, + "poly": [ + 912, + 1783, + 931, + 1783, + 931, + 1805, + 912, + 1805 + ], + "score": 0.56, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 1065, + 313, + 1208, + 313, + 1208, + 347, + 1065, + 347 + ], + "score": 0.55, + "latex": "\\langle \\mathit { 5 O S D I } \\} \\mathit { 1 6 } \\rangle" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2057.0, + 871.0, + 2057.0, + 871.0, + 2095.0, + 832.0, + 2095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 207.0, + 278.0, + 207.0, + 278.0, + 235.0, + 238.0, + 235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 196.0, + 461.0, + 196.0, + 461.0, + 239.0, + 294.0, + 239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 210.0, + 284.0, + 210.0, + 284.0, + 242.0, + 235.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 256.0, + 281.0, + 256.0, + 281.0, + 288.0, + 235.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 284.0, + 284.0, + 284.0, + 284.0, + 323.0, + 233.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 317.0, + 279.0, + 317.0, + 279.0, + 351.0, + 235.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 349.0, + 281.0, + 349.0, + 281.0, + 383.0, + 238.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 401.0, + 281.0, + 401.0, + 281.0, + 433.0, + 238.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 429.0, + 284.0, + 429.0, + 284.0, + 475.0, + 235.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 485.0, + 281.0, + 485.0, + 281.0, + 517.0, + 235.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 513.0, + 284.0, + 513.0, + 284.0, + 554.0, + 235.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 568.0, + 279.0, + 568.0, + 279.0, + 602.0, + 238.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 598.0, + 284.0, + 598.0, + 284.0, + 644.0, + 235.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 652.0, + 281.0, + 652.0, + 281.0, + 686.0, + 238.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 682.0, + 284.0, + 682.0, + 284.0, + 724.0, + 235.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 736.0, + 279.0, + 736.0, + 279.0, + 770.0, + 235.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 768.0, + 281.0, + 768.0, + 281.0, + 803.0, + 238.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 817.0, + 284.0, + 817.0, + 284.0, + 857.0, + 235.0, + 857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 849.0, + 284.0, + 849.0, + 284.0, + 893.0, + 235.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 901.0, + 284.0, + 901.0, + 284.0, + 941.0, + 233.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 933.0, + 284.0, + 933.0, + 284.0, + 971.0, + 233.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 965.0, + 281.0, + 965.0, + 281.0, + 997.0, + 238.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 993.0, + 284.0, + 993.0, + 284.0, + 1036.0, + 235.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1048.0, + 281.0, + 1048.0, + 281.0, + 1082.0, + 238.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1076.0, + 286.0, + 1076.0, + 286.0, + 1128.0, + 233.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1132.0, + 279.0, + 1132.0, + 279.0, + 1166.0, + 235.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1164.0, + 281.0, + 1164.0, + 281.0, + 1196.0, + 235.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1246.0, + 279.0, + 1246.0, + 279.0, + 1281.0, + 235.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1275.0, + 284.0, + 1275.0, + 284.0, + 1313.0, + 233.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1307.0, + 284.0, + 1307.0, + 284.0, + 1351.0, + 235.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1361.0, + 281.0, + 1361.0, + 281.0, + 1395.0, + 238.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1391.0, + 284.0, + 1391.0, + 284.0, + 1431.0, + 235.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1445.0, + 281.0, + 1445.0, + 281.0, + 1477.0, + 238.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1475.0, + 284.0, + 1475.0, + 284.0, + 1520.0, + 235.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1530.0, + 281.0, + 1530.0, + 281.0, + 1568.0, + 238.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1582.0, + 281.0, + 1582.0, + 281.0, + 1616.0, + 238.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1612.0, + 284.0, + 1612.0, + 284.0, + 1656.0, + 235.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1664.0, + 284.0, + 1664.0, + 284.0, + 1702.0, + 233.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1696.0, + 284.0, + 1696.0, + 284.0, + 1737.0, + 233.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1749.0, + 284.0, + 1749.0, + 284.0, + 1787.0, + 233.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1779.0, + 284.0, + 1779.0, + 284.0, + 1817.0, + 233.0, + 1817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1811.0, + 284.0, + 1811.0, + 284.0, + 1855.0, + 233.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1865.0, + 281.0, + 1865.0, + 281.0, + 1897.0, + 235.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1893.0, + 284.0, + 1893.0, + 284.0, + 1933.0, + 235.0, + 1933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1947.0, + 279.0, + 1947.0, + 279.0, + 1982.0, + 235.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1978.0, + 284.0, + 1978.0, + 284.0, + 2016.0, + 233.0, + 2016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 207.0, + 278.0, + 207.0, + 278.0, + 235.0, + 238.0, + 235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 196.0, + 461.0, + 196.0, + 461.0, + 239.0, + 294.0, + 239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 245.0, + 1411.0, + 245.0, + 1411.0, + 297.0, + 302.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 279.0, + 1274.0, + 279.0, + 1274.0, + 322.0, + 352.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 312.0, + 1064.0, + 312.0, + 1064.0, + 352.0, + 350.0, + 352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1209.0, + 312.0, + 1409.0, + 312.0, + 1409.0, + 352.0, + 1209.0, + 352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 335.0, + 432.0, + 335.0, + 432.0, + 382.0, + 352.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 397.0, + 1405.0, + 397.0, + 1405.0, + 435.0, + 310.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 427.0, + 1037.0, + 427.0, + 1037.0, + 466.0, + 352.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 478.0, + 1407.0, + 478.0, + 1407.0, + 520.0, + 306.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 510.0, + 923.0, + 510.0, + 923.0, + 551.0, + 348.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 563.0, + 1405.0, + 563.0, + 1405.0, + 601.0, + 310.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 591.0, + 1409.0, + 591.0, + 1409.0, + 638.0, + 347.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 648.0, + 1405.0, + 648.0, + 1405.0, + 686.0, + 310.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 680.0, + 821.0, + 680.0, + 821.0, + 712.0, + 354.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 729.0, + 1409.0, + 729.0, + 1409.0, + 771.0, + 304.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 761.0, + 786.0, + 761.0, + 786.0, + 804.0, + 352.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 812.0, + 1411.0, + 812.0, + 1411.0, + 858.0, + 304.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 846.0, + 429.0, + 846.0, + 429.0, + 887.0, + 350.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 895.0, + 1409.0, + 895.0, + 1409.0, + 941.0, + 306.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 927.0, + 1409.0, + 927.0, + 1409.0, + 972.0, + 350.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 963.0, + 1405.0, + 963.0, + 1405.0, + 1000.0, + 354.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 994.0, + 611.0, + 994.0, + 611.0, + 1026.0, + 352.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1044.0, + 1407.0, + 1044.0, + 1407.0, + 1087.0, + 308.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1075.0, + 495.0, + 1075.0, + 495.0, + 1113.0, + 354.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1127.0, + 1409.0, + 1127.0, + 1409.0, + 1168.0, + 291.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1154.0, + 1407.0, + 1154.0, + 1407.0, + 1202.0, + 351.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1192.0, + 537.0, + 1192.0, + 537.0, + 1223.0, + 356.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1241.0, + 1411.0, + 1241.0, + 1411.0, + 1283.0, + 289.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1275.0, + 1405.0, + 1275.0, + 1405.0, + 1312.0, + 354.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1305.0, + 743.0, + 1305.0, + 743.0, + 1340.0, + 348.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1354.0, + 1407.0, + 1354.0, + 1407.0, + 1397.0, + 293.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1385.0, + 1270.0, + 1385.0, + 1270.0, + 1423.0, + 354.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1441.0, + 1405.0, + 1441.0, + 1405.0, + 1478.0, + 294.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1472.0, + 881.0, + 1472.0, + 881.0, + 1510.0, + 354.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1526.0, + 1314.0, + 1526.0, + 1314.0, + 1563.0, + 294.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1575.0, + 1409.0, + 1575.0, + 1409.0, + 1621.0, + 291.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1609.0, + 699.0, + 1609.0, + 699.0, + 1646.0, + 350.0, + 1646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1664.0, + 1405.0, + 1664.0, + 1405.0, + 1702.0, + 296.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1694.0, + 782.0, + 1694.0, + 782.0, + 1731.0, + 356.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1747.0, + 1407.0, + 1747.0, + 1407.0, + 1785.0, + 294.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1779.0, + 911.0, + 1779.0, + 911.0, + 1816.0, + 352.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1779.0, + 1407.0, + 1779.0, + 1407.0, + 1816.0, + 932.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1808.0, + 678.0, + 1808.0, + 678.0, + 1846.0, + 354.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1858.0, + 526.0, + 1858.0, + 526.0, + 1903.0, + 291.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 1858.0, + 1409.0, + 1858.0, + 1409.0, + 1903.0, + 590.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1891.0, + 591.0, + 1891.0, + 591.0, + 1929.0, + 354.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1945.0, + 1407.0, + 1945.0, + 1407.0, + 1982.0, + 296.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1976.0, + 1104.0, + 1976.0, + 1104.0, + 2010.0, + 352.0, + 2010.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 286, + 163, + 1410, + 163, + 1410, + 2030, + 286, + 2030 + ], + "score": 0.878 + }, + { + "category_id": 2, + "poly": [ + 835, + 2060, + 864, + 2060, + 864, + 2087, + 835, + 2087 + ], + "score": 0.825 + }, + { + "category_id": 2, + "poly": [ + 238, + 209, + 288, + 209, + 288, + 2035, + 238, + 2035 + ], + "score": 0.197 + }, + { + "category_id": 13, + "poly": [ + 1323, + 1003, + 1350, + 1003, + 1350, + 1032, + 1323, + 1032 + ], + "score": 0.87, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 971, + 375, + 998, + 375, + 998, + 404, + 971, + 404 + ], + "score": 0.87, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2058.0, + 869.0, + 2058.0, + 869.0, + 2097.0, + 831.0, + 2097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 207.0, + 282.0, + 207.0, + 282.0, + 239.0, + 235.0, + 239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 235.0, + 284.0, + 235.0, + 284.0, + 275.0, + 233.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 289.0, + 284.0, + 289.0, + 284.0, + 328.0, + 233.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 322.0, + 284.0, + 322.0, + 284.0, + 362.0, + 233.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 374.0, + 284.0, + 374.0, + 284.0, + 412.0, + 233.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 406.0, + 284.0, + 406.0, + 284.0, + 446.0, + 233.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 464.0, + 282.0, + 464.0, + 282.0, + 496.0, + 235.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 230.0, + 490.0, + 286.0, + 490.0, + 286.0, + 540.0, + 230.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 544.0, + 284.0, + 544.0, + 284.0, + 584.0, + 233.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 574.0, + 286.0, + 574.0, + 286.0, + 628.0, + 233.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 630.0, + 284.0, + 630.0, + 284.0, + 669.0, + 233.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 665.0, + 282.0, + 665.0, + 282.0, + 697.0, + 235.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 693.0, + 284.0, + 693.0, + 284.0, + 735.0, + 235.0, + 735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 747.0, + 284.0, + 747.0, + 284.0, + 785.0, + 233.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 775.0, + 286.0, + 775.0, + 286.0, + 829.0, + 233.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 831.0, + 284.0, + 831.0, + 284.0, + 871.0, + 235.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 863.0, + 284.0, + 863.0, + 284.0, + 907.0, + 235.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 917.0, + 284.0, + 917.0, + 284.0, + 955.0, + 233.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 951.0, + 282.0, + 951.0, + 282.0, + 990.0, + 237.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1002.0, + 284.0, + 1002.0, + 284.0, + 1040.0, + 233.0, + 1040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1032.0, + 286.0, + 1032.0, + 286.0, + 1084.0, + 233.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1090.0, + 282.0, + 1090.0, + 282.0, + 1124.0, + 237.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1118.0, + 284.0, + 1118.0, + 284.0, + 1156.0, + 233.0, + 1156.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1150.0, + 284.0, + 1150.0, + 284.0, + 1196.0, + 235.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1204.0, + 284.0, + 1204.0, + 284.0, + 1242.0, + 233.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1232.0, + 284.0, + 1232.0, + 284.0, + 1272.0, + 235.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1264.0, + 284.0, + 1264.0, + 284.0, + 1307.0, + 235.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1321.0, + 279.0, + 1321.0, + 279.0, + 1355.0, + 235.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1351.0, + 282.0, + 1351.0, + 282.0, + 1397.0, + 235.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1405.0, + 284.0, + 1405.0, + 284.0, + 1443.0, + 233.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1435.0, + 284.0, + 1435.0, + 284.0, + 1475.0, + 233.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1489.0, + 284.0, + 1489.0, + 284.0, + 1527.0, + 233.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1521.0, + 284.0, + 1521.0, + 284.0, + 1565.0, + 235.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1573.0, + 284.0, + 1573.0, + 284.0, + 1614.0, + 233.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1606.0, + 284.0, + 1606.0, + 284.0, + 1644.0, + 233.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 230.0, + 1636.0, + 286.0, + 1636.0, + 286.0, + 1686.0, + 230.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1692.0, + 282.0, + 1692.0, + 282.0, + 1726.0, + 237.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1722.0, + 284.0, + 1722.0, + 284.0, + 1764.0, + 235.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1776.0, + 282.0, + 1776.0, + 282.0, + 1814.0, + 237.0, + 1814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1804.0, + 286.0, + 1804.0, + 286.0, + 1856.0, + 233.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1864.0, + 282.0, + 1864.0, + 282.0, + 1896.0, + 235.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1894.0, + 284.0, + 1894.0, + 284.0, + 1935.0, + 233.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1947.0, + 284.0, + 1947.0, + 284.0, + 1985.0, + 233.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1979.0, + 284.0, + 1979.0, + 284.0, + 2017.0, + 233.0, + 2017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 197.0, + 1408.0, + 197.0, + 1408.0, + 246.0, + 290.0, + 246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 234.0, + 1132.0, + 234.0, + 1132.0, + 271.0, + 353.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 285.0, + 1408.0, + 285.0, + 1408.0, + 326.0, + 292.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 316.0, + 1198.0, + 316.0, + 1198.0, + 359.0, + 351.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 369.0, + 970.0, + 369.0, + 970.0, + 416.0, + 292.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 369.0, + 1408.0, + 369.0, + 1408.0, + 416.0, + 999.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 406.0, + 641.0, + 406.0, + 641.0, + 439.0, + 357.0, + 439.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": [ + 355.0, + 490.0, + 1245.0, + 490.0, + 1245.0, + 523.0, + 355.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 541.0, + 1410.0, + 541.0, + 1410.0, + 584.0, + 290.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 574.0, + 997.0, + 574.0, + 997.0, + 613.0, + 353.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 631.0, + 1404.0, + 631.0, + 1404.0, + 664.0, + 298.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 660.0, + 1408.0, + 660.0, + 1408.0, + 699.0, + 353.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 689.0, + 431.0, + 689.0, + 431.0, + 730.0, + 351.0, + 730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 742.0, + 1410.0, + 742.0, + 1410.0, + 785.0, + 290.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 775.0, + 1190.0, + 775.0, + 1190.0, + 814.0, + 353.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 830.0, + 1408.0, + 830.0, + 1408.0, + 869.0, + 296.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 859.0, + 604.0, + 859.0, + 604.0, + 898.0, + 355.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 914.0, + 1408.0, + 914.0, + 1408.0, + 953.0, + 296.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 947.0, + 812.0, + 947.0, + 812.0, + 986.0, + 353.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 998.0, + 1322.0, + 998.0, + 1322.0, + 1039.0, + 292.0, + 1039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 998.0, + 1408.0, + 998.0, + 1408.0, + 1039.0, + 1351.0, + 1039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 1033.0, + 995.0, + 1033.0, + 995.0, + 1066.0, + 357.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1086.0, + 1406.0, + 1086.0, + 1406.0, + 1123.0, + 292.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1117.0, + 1408.0, + 1117.0, + 1408.0, + 1156.0, + 353.0, + 1156.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1148.0, + 582.0, + 1148.0, + 582.0, + 1181.0, + 355.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1199.0, + 1408.0, + 1199.0, + 1408.0, + 1242.0, + 290.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1232.0, + 1406.0, + 1232.0, + 1406.0, + 1271.0, + 353.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1262.0, + 840.0, + 1262.0, + 840.0, + 1301.0, + 353.0, + 1301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1316.0, + 1406.0, + 1316.0, + 1406.0, + 1355.0, + 294.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1351.0, + 1059.0, + 1351.0, + 1059.0, + 1383.0, + 355.0, + 1383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1400.0, + 1408.0, + 1400.0, + 1408.0, + 1445.0, + 292.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1437.0, + 1102.0, + 1437.0, + 1102.0, + 1469.0, + 355.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1488.0, + 1406.0, + 1488.0, + 1406.0, + 1527.0, + 294.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1517.0, + 981.0, + 1517.0, + 981.0, + 1555.0, + 353.0, + 1555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1568.0, + 1408.0, + 1568.0, + 1408.0, + 1615.0, + 292.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1605.0, + 1408.0, + 1605.0, + 1408.0, + 1644.0, + 353.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 1633.0, + 745.0, + 1633.0, + 745.0, + 1674.0, + 347.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1689.0, + 1406.0, + 1689.0, + 1406.0, + 1728.0, + 294.0, + 1728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1719.0, + 642.0, + 1719.0, + 642.0, + 1756.0, + 351.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1771.0, + 1410.0, + 1771.0, + 1410.0, + 1816.0, + 294.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1803.0, + 765.0, + 1803.0, + 765.0, + 1842.0, + 355.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1859.0, + 1406.0, + 1859.0, + 1406.0, + 1898.0, + 294.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1889.0, + 1170.0, + 1889.0, + 1170.0, + 1928.0, + 351.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1941.0, + 1412.0, + 1941.0, + 1412.0, + 1988.0, + 292.0, + 1988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1973.0, + 818.0, + 1973.0, + 818.0, + 2012.0, + 353.0, + 2012.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 256, + 166, + 1413, + 166, + 1413, + 2025, + 256, + 2025 + ], + "score": 0.873 + }, + { + "category_id": 2, + "poly": [ + 835, + 2060, + 866, + 2060, + 866, + 2087, + 835, + 2087 + ], + "score": 0.831 + }, + { + "category_id": 2, + "poly": [ + 239, + 207, + 286, + 207, + 286, + 2049, + 239, + 2049 + ], + "score": 0.164 + }, + { + "category_id": 13, + "poly": [ + 389, + 1008, + 424, + 1008, + 424, + 1030, + 389, + 1030 + ], + "score": 0.86, + "latex": "\\mathbb { R } ^ { n }" + }, + { + "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": [ + 235.0, + 208.0, + 281.0, + 208.0, + 281.0, + 240.0, + 235.0, + 240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 236.0, + 283.0, + 236.0, + 283.0, + 278.0, + 235.0, + 278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 288.0, + 281.0, + 288.0, + 281.0, + 323.0, + 237.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 319.0, + 283.0, + 319.0, + 283.0, + 361.0, + 235.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 371.0, + 281.0, + 371.0, + 281.0, + 404.0, + 237.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 400.0, + 283.0, + 400.0, + 283.0, + 442.0, + 235.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 452.0, + 281.0, + 452.0, + 281.0, + 487.0, + 237.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 483.0, + 283.0, + 483.0, + 283.0, + 523.0, + 235.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 531.0, + 283.0, + 531.0, + 283.0, + 570.0, + 233.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 564.0, + 283.0, + 564.0, + 283.0, + 604.0, + 235.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 616.0, + 281.0, + 616.0, + 281.0, + 651.0, + 237.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 647.0, + 283.0, + 647.0, + 283.0, + 693.0, + 235.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 699.0, + 281.0, + 699.0, + 281.0, + 732.0, + 237.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 732.0, + 281.0, + 732.0, + 281.0, + 764.0, + 237.0, + 764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 762.0, + 279.0, + 762.0, + 279.0, + 796.0, + 237.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 812.0, + 281.0, + 812.0, + 281.0, + 845.0, + 237.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 841.0, + 283.0, + 841.0, + 283.0, + 887.0, + 235.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 893.0, + 281.0, + 893.0, + 281.0, + 928.0, + 237.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 924.0, + 283.0, + 924.0, + 283.0, + 964.0, + 235.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 976.0, + 281.0, + 976.0, + 281.0, + 1009.0, + 237.0, + 1009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1005.0, + 281.0, + 1005.0, + 281.0, + 1049.0, + 235.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1057.0, + 281.0, + 1057.0, + 281.0, + 1092.0, + 237.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1088.0, + 283.0, + 1088.0, + 283.0, + 1130.0, + 235.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1138.0, + 281.0, + 1138.0, + 281.0, + 1173.0, + 237.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1173.0, + 281.0, + 1173.0, + 281.0, + 1211.0, + 237.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1221.0, + 281.0, + 1221.0, + 281.0, + 1255.0, + 237.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1253.0, + 281.0, + 1253.0, + 281.0, + 1286.0, + 237.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1282.0, + 283.0, + 1282.0, + 283.0, + 1324.0, + 235.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1334.0, + 281.0, + 1334.0, + 281.0, + 1369.0, + 237.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1365.0, + 283.0, + 1365.0, + 283.0, + 1405.0, + 235.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1415.0, + 281.0, + 1415.0, + 281.0, + 1450.0, + 237.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1448.0, + 281.0, + 1448.0, + 281.0, + 1480.0, + 237.0, + 1480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1478.0, + 283.0, + 1478.0, + 283.0, + 1518.0, + 235.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1527.0, + 281.0, + 1527.0, + 281.0, + 1561.0, + 237.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1561.0, + 281.0, + 1561.0, + 281.0, + 1599.0, + 237.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1609.0, + 281.0, + 1609.0, + 281.0, + 1644.0, + 237.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1642.0, + 281.0, + 1642.0, + 281.0, + 1674.0, + 237.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1672.0, + 283.0, + 1672.0, + 283.0, + 1713.0, + 235.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1723.0, + 281.0, + 1723.0, + 281.0, + 1757.0, + 237.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1753.0, + 283.0, + 1753.0, + 283.0, + 1794.0, + 235.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 1804.0, + 283.0, + 1804.0, + 283.0, + 1842.0, + 233.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1836.0, + 281.0, + 1836.0, + 281.0, + 1868.0, + 235.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1868.0, + 281.0, + 1868.0, + 281.0, + 1901.0, + 235.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1899.0, + 281.0, + 1899.0, + 281.0, + 1933.0, + 237.0, + 1933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1949.0, + 279.0, + 1949.0, + 279.0, + 1982.0, + 237.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 235.0, + 1978.0, + 283.0, + 1978.0, + 283.0, + 2018.0, + 235.0, + 2018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 202.0, + 1407.0, + 202.0, + 1407.0, + 238.0, + 249.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 238.0, + 280.0, + 238.0, + 280.0, + 271.0, + 247.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 232.0, + 853.0, + 232.0, + 853.0, + 271.0, + 353.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 281.0, + 1409.0, + 281.0, + 1409.0, + 326.0, + 241.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 320.0, + 280.0, + 320.0, + 280.0, + 353.0, + 247.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 314.0, + 586.0, + 314.0, + 586.0, + 350.0, + 353.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 371.0, + 282.0, + 371.0, + 282.0, + 402.0, + 247.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 363.0, + 1407.0, + 363.0, + 1407.0, + 408.0, + 287.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 402.0, + 280.0, + 402.0, + 280.0, + 434.0, + 247.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 396.0, + 646.0, + 396.0, + 646.0, + 434.0, + 353.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 245.0, + 449.0, + 1405.0, + 449.0, + 1405.0, + 487.0, + 245.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 483.0, + 280.0, + 483.0, + 280.0, + 516.0, + 247.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 475.0, + 632.0, + 475.0, + 632.0, + 514.0, + 351.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 526.0, + 1411.0, + 526.0, + 1411.0, + 573.0, + 239.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 565.0, + 280.0, + 565.0, + 280.0, + 598.0, + 247.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 561.0, + 843.0, + 561.0, + 843.0, + 598.0, + 351.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 245.0, + 612.0, + 1407.0, + 612.0, + 1407.0, + 651.0, + 245.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 649.0, + 280.0, + 649.0, + 280.0, + 683.0, + 247.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 643.0, + 1091.0, + 643.0, + 1091.0, + 683.0, + 349.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 243.0, + 693.0, + 1407.0, + 693.0, + 1407.0, + 732.0, + 243.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 728.0, + 280.0, + 728.0, + 280.0, + 763.0, + 247.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 722.0, + 1407.0, + 722.0, + 1407.0, + 767.0, + 353.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 763.0, + 276.0, + 763.0, + 276.0, + 791.0, + 249.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 753.0, + 653.0, + 753.0, + 653.0, + 794.0, + 351.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 245.0, + 806.0, + 1403.0, + 806.0, + 1403.0, + 845.0, + 245.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 842.0, + 280.0, + 842.0, + 280.0, + 875.0, + 247.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 840.0, + 1002.0, + 840.0, + 1002.0, + 873.0, + 353.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 889.0, + 1407.0, + 889.0, + 1407.0, + 928.0, + 247.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 924.0, + 280.0, + 924.0, + 280.0, + 957.0, + 247.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 922.0, + 919.0, + 922.0, + 919.0, + 955.0, + 355.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 245.0, + 971.0, + 1405.0, + 971.0, + 1405.0, + 1010.0, + 245.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1006.0, + 280.0, + 1006.0, + 280.0, + 1038.0, + 247.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1002.0, + 388.0, + 1002.0, + 388.0, + 1040.0, + 351.0, + 1040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1002.0, + 1248.0, + 1002.0, + 1248.0, + 1040.0, + 425.0, + 1040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 243.0, + 1053.0, + 1407.0, + 1053.0, + 1407.0, + 1091.0, + 243.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1089.0, + 280.0, + 1089.0, + 280.0, + 1122.0, + 247.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1081.0, + 429.0, + 1081.0, + 429.0, + 1122.0, + 349.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 1132.0, + 1411.0, + 1132.0, + 1411.0, + 1177.0, + 241.0, + 1177.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1171.0, + 278.0, + 1171.0, + 278.0, + 1206.0, + 247.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1169.0, + 665.0, + 1169.0, + 665.0, + 1202.0, + 353.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 243.0, + 1218.0, + 1407.0, + 1218.0, + 1407.0, + 1257.0, + 243.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1253.0, + 280.0, + 1253.0, + 280.0, + 1285.0, + 247.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1251.0, + 1407.0, + 1251.0, + 1407.0, + 1289.0, + 355.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1283.0, + 280.0, + 1283.0, + 280.0, + 1316.0, + 247.0, + 1316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1277.0, + 433.0, + 1277.0, + 433.0, + 1318.0, + 351.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 243.0, + 1330.0, + 1407.0, + 1330.0, + 1407.0, + 1369.0, + 243.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1365.0, + 280.0, + 1365.0, + 280.0, + 1398.0, + 247.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1361.0, + 1409.0, + 1361.0, + 1409.0, + 1400.0, + 353.0, + 1400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1408.0, + 1407.0, + 1408.0, + 1407.0, + 1455.0, + 247.0, + 1455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1446.0, + 280.0, + 1446.0, + 280.0, + 1479.0, + 247.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1442.0, + 1407.0, + 1442.0, + 1407.0, + 1481.0, + 353.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1479.0, + 280.0, + 1479.0, + 280.0, + 1512.0, + 247.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1475.0, + 644.0, + 1475.0, + 644.0, + 1508.0, + 355.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 243.0, + 1522.0, + 1411.0, + 1522.0, + 1411.0, + 1567.0, + 243.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1561.0, + 280.0, + 1561.0, + 280.0, + 1593.0, + 247.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1555.0, + 487.0, + 1555.0, + 487.0, + 1593.0, + 353.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1606.0, + 1409.0, + 1606.0, + 1409.0, + 1644.0, + 249.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1642.0, + 280.0, + 1642.0, + 280.0, + 1675.0, + 247.0, + 1675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1634.0, + 1407.0, + 1634.0, + 1407.0, + 1679.0, + 351.0, + 1679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1675.0, + 278.0, + 1675.0, + 278.0, + 1702.0, + 249.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1665.0, + 897.0, + 1665.0, + 897.0, + 1704.0, + 351.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1714.0, + 1409.0, + 1714.0, + 1409.0, + 1761.0, + 249.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1759.0, + 278.0, + 1759.0, + 278.0, + 1785.0, + 249.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1748.0, + 886.0, + 1748.0, + 886.0, + 1787.0, + 353.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 249.0, + 1798.0, + 1411.0, + 1798.0, + 1411.0, + 1840.0, + 249.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1836.0, + 280.0, + 1836.0, + 280.0, + 1869.0, + 247.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1832.0, + 1409.0, + 1832.0, + 1409.0, + 1871.0, + 351.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1867.0, + 280.0, + 1867.0, + 280.0, + 1900.0, + 247.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1863.0, + 1405.0, + 1863.0, + 1405.0, + 1902.0, + 353.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1897.0, + 280.0, + 1897.0, + 280.0, + 1930.0, + 247.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1895.0, + 824.0, + 1895.0, + 824.0, + 1928.0, + 353.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1948.0, + 282.0, + 1948.0, + 282.0, + 1979.0, + 247.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1983.0, + 287.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 247.0, + 1979.0, + 280.0, + 1979.0, + 280.0, + 2012.0, + 247.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1973.0, + 741.0, + 1973.0, + 741.0, + 2014.0, + 346.0, + 2014.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 235, + 202, + 1409, + 202, + 1409, + 1387, + 235, + 1387 + ], + "score": 0.899 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 865, + 2061, + 865, + 2086, + 836, + 2086 + ], + "score": 0.783 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 865, + 2061, + 865, + 2086, + 836, + 2086 + ], + "score": 0.162 + }, + { + "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": [ + 832.0, + 2058.0, + 870.0, + 2058.0, + 870.0, + 2096.0, + 832.0, + 2096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 241.0, + 210.0, + 277.0, + 210.0, + 277.0, + 235.0, + 241.0, + 235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 204.0, + 1403.0, + 204.0, + 1403.0, + 238.0, + 295.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 238.0, + 279.0, + 238.0, + 279.0, + 267.0, + 238.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 234.0, + 1066.0, + 234.0, + 1066.0, + 267.0, + 354.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 291.0, + 277.0, + 291.0, + 277.0, + 317.0, + 239.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 280.0, + 1407.0, + 280.0, + 1407.0, + 326.0, + 291.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 318.0, + 281.0, + 318.0, + 281.0, + 352.0, + 239.0, + 352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 318.0, + 1407.0, + 318.0, + 1407.0, + 351.0, + 354.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 351.0, + 279.0, + 351.0, + 279.0, + 382.0, + 238.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 347.0, + 481.0, + 347.0, + 481.0, + 378.0, + 356.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 402.0, + 278.0, + 402.0, + 278.0, + 432.0, + 238.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 397.0, + 1406.0, + 397.0, + 1406.0, + 434.0, + 292.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 434.0, + 279.0, + 434.0, + 279.0, + 464.0, + 238.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 426.0, + 1407.0, + 426.0, + 1407.0, + 465.0, + 352.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 464.0, + 279.0, + 464.0, + 279.0, + 495.0, + 238.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 456.0, + 1410.0, + 456.0, + 1410.0, + 499.0, + 352.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 495.0, + 278.0, + 495.0, + 278.0, + 524.0, + 238.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 488.0, + 428.0, + 488.0, + 428.0, + 524.0, + 354.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 547.0, + 279.0, + 547.0, + 279.0, + 576.0, + 238.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 542.0, + 1406.0, + 542.0, + 1406.0, + 579.0, + 294.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 578.0, + 279.0, + 578.0, + 279.0, + 607.0, + 238.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 574.0, + 1044.0, + 574.0, + 1044.0, + 607.0, + 355.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 630.0, + 278.0, + 630.0, + 278.0, + 659.0, + 238.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 627.0, + 1405.0, + 627.0, + 1405.0, + 661.0, + 295.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 661.0, + 279.0, + 661.0, + 279.0, + 690.0, + 238.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 655.0, + 1406.0, + 655.0, + 1406.0, + 693.0, + 354.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 239.0, + 693.0, + 278.0, + 693.0, + 278.0, + 718.0, + 239.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 682.0, + 1407.0, + 682.0, + 1407.0, + 722.0, + 351.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 721.0, + 279.0, + 721.0, + 279.0, + 750.0, + 238.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 714.0, + 429.0, + 714.0, + 429.0, + 750.0, + 352.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 772.0, + 278.0, + 772.0, + 278.0, + 803.0, + 238.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 769.0, + 1405.0, + 769.0, + 1405.0, + 803.0, + 295.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 804.0, + 279.0, + 804.0, + 279.0, + 833.0, + 238.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 797.0, + 1410.0, + 797.0, + 1410.0, + 837.0, + 350.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 835.0, + 279.0, + 835.0, + 279.0, + 865.0, + 238.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 829.0, + 604.0, + 829.0, + 604.0, + 863.0, + 356.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 886.0, + 277.0, + 886.0, + 277.0, + 915.0, + 238.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 879.0, + 1407.0, + 879.0, + 1407.0, + 919.0, + 293.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 916.0, + 279.0, + 916.0, + 279.0, + 947.0, + 238.0, + 947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 910.0, + 1406.0, + 910.0, + 1406.0, + 948.0, + 352.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 948.0, + 279.0, + 948.0, + 279.0, + 978.0, + 238.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 943.0, + 858.0, + 943.0, + 858.0, + 977.0, + 354.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 998.0, + 279.0, + 998.0, + 279.0, + 1027.0, + 238.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 993.0, + 1403.0, + 993.0, + 1403.0, + 1030.0, + 294.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1030.0, + 279.0, + 1030.0, + 279.0, + 1060.0, + 238.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1025.0, + 641.0, + 1025.0, + 641.0, + 1057.0, + 353.0, + 1057.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1082.0, + 279.0, + 1082.0, + 279.0, + 1112.0, + 238.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1077.0, + 1409.0, + 1077.0, + 1409.0, + 1114.0, + 292.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 237.0, + 1110.0, + 281.0, + 1110.0, + 281.0, + 1145.0, + 237.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1105.0, + 591.0, + 1105.0, + 591.0, + 1143.0, + 355.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1164.0, + 278.0, + 1164.0, + 278.0, + 1195.0, + 238.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1157.0, + 1407.0, + 1157.0, + 1407.0, + 1197.0, + 291.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1195.0, + 279.0, + 1195.0, + 279.0, + 1226.0, + 238.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1191.0, + 1409.0, + 1191.0, + 1409.0, + 1225.0, + 352.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1226.0, + 279.0, + 1226.0, + 279.0, + 1255.0, + 238.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1217.0, + 1410.0, + 1217.0, + 1410.0, + 1256.0, + 352.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1255.0, + 278.0, + 1255.0, + 278.0, + 1286.0, + 238.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 1251.0, + 533.0, + 1251.0, + 533.0, + 1284.0, + 354.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1307.0, + 279.0, + 1307.0, + 279.0, + 1337.0, + 238.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1300.0, + 1406.0, + 1300.0, + 1406.0, + 1341.0, + 294.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1338.0, + 279.0, + 1338.0, + 279.0, + 1367.0, + 238.0, + 1367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1333.0, + 1154.0, + 1333.0, + 1154.0, + 1369.0, + 352.0, + 1369.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 408, + 1807, + 1404, + 1807, + 1404, + 2000, + 408, + 2000 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 407, + 779, + 1404, + 779, + 1404, + 907, + 407, + 907 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 406, + 1469, + 1404, + 1469, + 1404, + 1759, + 406, + 1759 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 406, + 297, + 1404, + 297, + 1404, + 733, + 406, + 733 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 365, + 915, + 671, + 915, + 671, + 947, + 365, + 947 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 369, + 741, + 841, + 741, + 841, + 773, + 369, + 773 + ], + "score": 0.913 + }, + { + "category_id": 1, + "poly": [ + 365, + 256, + 581, + 256, + 581, + 287, + 365, + 287 + ], + "score": 0.892 + }, + { + "category_id": 1, + "poly": [ + 400, + 956, + 1405, + 956, + 1405, + 1421, + 400, + 1421 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 836, + 2061, + 865, + 2061, + 865, + 2085, + 836, + 2085 + ], + "score": 0.842 + }, + { + "category_id": 1, + "poly": [ + 367, + 1766, + 1200, + 1766, + 1200, + 1799, + 367, + 1799 + ], + "score": 0.795 + }, + { + "category_id": 1, + "poly": [ + 367, + 1430, + 1401, + 1430, + 1401, + 1462, + 367, + 1462 + ], + "score": 0.793 + }, + { + "category_id": 2, + "poly": [ + 242, + 199, + 435, + 199, + 435, + 234, + 242, + 234 + ], + "score": 0.612 + }, + { + "category_id": 2, + "poly": [ + 236, + 223, + 287, + 223, + 287, + 2031, + 236, + 2031 + ], + "score": 0.323 + }, + { + "category_id": 0, + "poly": [ + 242, + 199, + 435, + 199, + 435, + 234, + 242, + 234 + ], + "score": 0.285 + }, + { + "category_id": 13, + "poly": [ + 814, + 811, + 866, + 811, + 866, + 842, + 814, + 842 + ], + "score": 0.87, + "latex": "\\ S 2 . 3" + }, + { + "category_id": 13, + "poly": [ + 968, + 572, + 1020, + 572, + 1020, + 603, + 968, + 603 + ], + "score": 0.87, + "latex": "\\ S 2 . 3" + }, + { + "category_id": 13, + "poly": [ + 451, + 573, + 484, + 573, + 484, + 600, + 451, + 600 + ], + "score": 0.85, + "latex": "x ^ { \\star }" + }, + { + "category_id": 13, + "poly": [ + 1098, + 543, + 1117, + 543, + 1117, + 569, + 1098, + 569 + ], + "score": 0.81, + "latex": "\\hat { x }" + }, + { + "category_id": 13, + "poly": [ + 1212, + 1470, + 1243, + 1470, + 1243, + 1500, + 1212, + 1500 + ], + "score": 0.64, + "latex": "\\ S 3" + }, + { + "category_id": 13, + "poly": [ + 1212, + 1202, + 1243, + 1202, + 1243, + 1231, + 1212, + 1231 + ], + "score": 0.5, + "latex": "\\ S 3" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2057.0, + 871.0, + 2057.0, + 871.0, + 2095.0, + 832.0, + 2095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 207.0, + 282.0, + 207.0, + 282.0, + 234.0, + 240.0, + 234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 196.0, + 440.0, + 196.0, + 440.0, + 241.0, + 292.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 213.0, + 283.0, + 213.0, + 283.0, + 243.0, + 236.0, + 243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 260.0, + 280.0, + 260.0, + 280.0, + 290.0, + 236.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 300.0, + 280.0, + 300.0, + 280.0, + 330.0, + 236.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 330.0, + 280.0, + 330.0, + 280.0, + 360.0, + 236.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 360.0, + 283.0, + 360.0, + 283.0, + 390.0, + 236.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 390.0, + 280.0, + 390.0, + 280.0, + 419.0, + 238.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 421.0, + 280.0, + 421.0, + 280.0, + 451.0, + 236.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 451.0, + 278.0, + 451.0, + 278.0, + 481.0, + 236.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 481.0, + 280.0, + 481.0, + 280.0, + 511.0, + 236.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 517.0, + 280.0, + 517.0, + 280.0, + 547.0, + 236.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 547.0, + 280.0, + 547.0, + 280.0, + 576.0, + 236.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 576.0, + 280.0, + 576.0, + 280.0, + 606.0, + 236.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 610.0, + 280.0, + 610.0, + 280.0, + 640.0, + 236.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 640.0, + 280.0, + 640.0, + 280.0, + 672.0, + 236.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 676.0, + 280.0, + 676.0, + 280.0, + 706.0, + 236.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 706.0, + 280.0, + 706.0, + 280.0, + 737.0, + 238.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 745.0, + 280.0, + 745.0, + 280.0, + 777.0, + 236.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 785.0, + 278.0, + 785.0, + 278.0, + 815.0, + 236.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 815.0, + 280.0, + 815.0, + 280.0, + 847.0, + 236.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 849.0, + 280.0, + 849.0, + 280.0, + 881.0, + 236.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 233.0, + 877.0, + 285.0, + 877.0, + 285.0, + 914.0, + 233.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 918.0, + 280.0, + 918.0, + 280.0, + 952.0, + 236.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 958.0, + 280.0, + 958.0, + 280.0, + 990.0, + 236.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 990.0, + 280.0, + 990.0, + 280.0, + 1020.0, + 236.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1020.0, + 283.0, + 1020.0, + 283.0, + 1051.0, + 236.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1049.0, + 280.0, + 1049.0, + 280.0, + 1081.0, + 236.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1079.0, + 280.0, + 1079.0, + 280.0, + 1111.0, + 236.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1109.0, + 280.0, + 1109.0, + 280.0, + 1141.0, + 236.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1145.0, + 283.0, + 1145.0, + 283.0, + 1175.0, + 236.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1175.0, + 283.0, + 1175.0, + 283.0, + 1207.0, + 236.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1205.0, + 283.0, + 1205.0, + 283.0, + 1234.0, + 236.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1234.0, + 283.0, + 1234.0, + 283.0, + 1266.0, + 236.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1268.0, + 283.0, + 1268.0, + 283.0, + 1300.0, + 236.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1300.0, + 280.0, + 1300.0, + 280.0, + 1330.0, + 236.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1330.0, + 283.0, + 1330.0, + 283.0, + 1360.0, + 236.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1364.0, + 283.0, + 1364.0, + 283.0, + 1393.0, + 236.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1393.0, + 280.0, + 1393.0, + 280.0, + 1425.0, + 236.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1433.0, + 278.0, + 1433.0, + 278.0, + 1465.0, + 236.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1473.0, + 280.0, + 1473.0, + 280.0, + 1505.0, + 236.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1505.0, + 280.0, + 1505.0, + 280.0, + 1536.0, + 236.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1536.0, + 280.0, + 1536.0, + 280.0, + 1570.0, + 236.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1572.0, + 280.0, + 1572.0, + 280.0, + 1604.0, + 236.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1602.0, + 280.0, + 1602.0, + 280.0, + 1634.0, + 236.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1638.0, + 280.0, + 1638.0, + 280.0, + 1668.0, + 236.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 238.0, + 1668.0, + 280.0, + 1668.0, + 280.0, + 1699.0, + 238.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1701.0, + 280.0, + 1701.0, + 280.0, + 1731.0, + 236.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1733.0, + 280.0, + 1733.0, + 280.0, + 1763.0, + 236.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1771.0, + 278.0, + 1771.0, + 278.0, + 1803.0, + 236.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1811.0, + 283.0, + 1811.0, + 283.0, + 1843.0, + 236.0, + 1843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1841.0, + 280.0, + 1841.0, + 280.0, + 1872.0, + 236.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1876.0, + 283.0, + 1876.0, + 283.0, + 1906.0, + 236.0, + 1906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1906.0, + 280.0, + 1906.0, + 280.0, + 1938.0, + 236.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1940.0, + 280.0, + 1940.0, + 280.0, + 1970.0, + 236.0, + 1970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 236.0, + 1970.0, + 280.0, + 1970.0, + 280.0, + 2000.0, + 236.0, + 2000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 240.0, + 207.0, + 282.0, + 207.0, + 282.0, + 234.0, + 240.0, + 234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 196.0, + 440.0, + 196.0, + 440.0, + 241.0, + 292.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1804.0, + 1408.0, + 1804.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, + 1870.0, + 449.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1870.0, + 1405.0, + 1870.0, + 1405.0, + 1906.0, + 405.0, + 1906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1901.0, + 952.0, + 1901.0, + 952.0, + 1937.0, + 449.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 1934.0, + 1405.0, + 1934.0, + 1405.0, + 1970.0, + 408.0, + 1970.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1967.0, + 926.0, + 1967.0, + 926.0, + 2001.0, + 449.0, + 2001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 776.0, + 1406.0, + 776.0, + 1406.0, + 817.0, + 404.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 810.0, + 813.0, + 810.0, + 813.0, + 843.0, + 451.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 810.0, + 876.0, + 810.0, + 876.0, + 843.0, + 867.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 843.0, + 1404.0, + 843.0, + 1404.0, + 880.0, + 406.0, + 880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 874.0, + 767.0, + 874.0, + 767.0, + 907.0, + 451.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1468.0, + 1211.0, + 1468.0, + 1211.0, + 1505.0, + 405.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 1468.0, + 1404.0, + 1468.0, + 1404.0, + 1505.0, + 1244.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1499.0, + 480.0, + 1499.0, + 480.0, + 1531.0, + 448.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 1532.0, + 1191.0, + 1532.0, + 1191.0, + 1570.0, + 403.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1567.0, + 1405.0, + 1567.0, + 1405.0, + 1603.0, + 404.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 1632.0, + 1405.0, + 1632.0, + 1405.0, + 1669.0, + 403.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1663.0, + 705.0, + 1663.0, + 705.0, + 1698.0, + 450.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1695.0, + 1405.0, + 1695.0, + 1405.0, + 1733.0, + 404.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1728.0, + 905.0, + 1728.0, + 905.0, + 1762.0, + 450.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 296.0, + 1405.0, + 296.0, + 1405.0, + 331.0, + 406.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 323.0, + 1405.0, + 323.0, + 1405.0, + 363.0, + 450.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 354.0, + 1407.0, + 354.0, + 1407.0, + 391.0, + 448.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 387.0, + 1403.0, + 387.0, + 1403.0, + 418.0, + 449.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 419.0, + 1404.0, + 419.0, + 1404.0, + 450.0, + 450.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 446.0, + 1404.0, + 446.0, + 1404.0, + 483.0, + 449.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 478.0, + 780.0, + 478.0, + 780.0, + 512.0, + 449.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 512.0, + 1404.0, + 512.0, + 1404.0, + 546.0, + 405.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 542.0, + 1097.0, + 542.0, + 1097.0, + 576.0, + 449.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 542.0, + 1405.0, + 542.0, + 1405.0, + 576.0, + 1118.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 571.0, + 450.0, + 571.0, + 450.0, + 605.0, + 447.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 485.0, + 571.0, + 967.0, + 571.0, + 967.0, + 605.0, + 485.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 571.0, + 1024.0, + 571.0, + 1024.0, + 605.0, + 1021.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 605.0, + 1407.0, + 605.0, + 1407.0, + 640.0, + 409.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 638.0, + 1407.0, + 638.0, + 1407.0, + 672.0, + 449.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 667.0, + 1405.0, + 667.0, + 1405.0, + 709.0, + 402.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 699.0, + 1174.0, + 699.0, + 1174.0, + 735.0, + 450.0, + 735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 909.0, + 674.0, + 909.0, + 674.0, + 954.0, + 358.0, + 954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 738.0, + 846.0, + 738.0, + 846.0, + 778.0, + 362.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 251.0, + 586.0, + 251.0, + 586.0, + 290.0, + 361.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 952.0, + 1409.0, + 952.0, + 1409.0, + 991.0, + 410.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 985.0, + 1404.0, + 985.0, + 1404.0, + 1018.0, + 450.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1015.0, + 1403.0, + 1015.0, + 1403.0, + 1048.0, + 450.0, + 1048.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1045.0, + 1408.0, + 1045.0, + 1408.0, + 1081.0, + 449.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1073.0, + 1403.0, + 1073.0, + 1403.0, + 1111.0, + 448.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1103.0, + 532.0, + 1103.0, + 532.0, + 1138.0, + 449.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1139.0, + 1404.0, + 1139.0, + 1404.0, + 1176.0, + 405.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1171.0, + 1404.0, + 1171.0, + 1404.0, + 1206.0, + 450.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1201.0, + 1211.0, + 1201.0, + 1211.0, + 1234.0, + 450.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 1201.0, + 1404.0, + 1201.0, + 1404.0, + 1234.0, + 1244.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1231.0, + 478.0, + 1231.0, + 478.0, + 1263.0, + 449.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 1267.0, + 446.0, + 1267.0, + 446.0, + 1298.0, + 408.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1266.0, + 1407.0, + 1266.0, + 1407.0, + 1299.0, + 449.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 1292.0, + 1406.0, + 1292.0, + 1406.0, + 1334.0, + 446.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1326.0, + 511.0, + 1326.0, + 511.0, + 1358.0, + 449.0, + 1358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 1356.0, + 1404.0, + 1356.0, + 1404.0, + 1397.0, + 406.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1389.0, + 1226.0, + 1389.0, + 1226.0, + 1425.0, + 450.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 1762.0, + 1204.0, + 1762.0, + 1204.0, + 1805.0, + 357.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 1425.0, + 1408.0, + 1425.0, + 1408.0, + 1468.0, + 360.0, + 1468.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/DMxOBm06HUx/DMxOBm06HUx_layout.pdf b/parse/train/DMxOBm06HUx/DMxOBm06HUx_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3cb680b6e60f6fade3d6a384c3141af655a11d69 --- /dev/null +++ b/parse/train/DMxOBm06HUx/DMxOBm06HUx_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:da746a129724014a39c973502e8927d9a3292bc1dd64617ba14a0db88aaf88cf +size 2679051 diff --git a/parse/train/DMxOBm06HUx/DMxOBm06HUx_origin.pdf b/parse/train/DMxOBm06HUx/DMxOBm06HUx_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..08e2cf363a36dc46a501b78c0fe45055f6e78ab6 --- /dev/null +++ b/parse/train/DMxOBm06HUx/DMxOBm06HUx_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1d2ad6ee34f549c1228a7c85a7b97372a9044129ef8702fa7116116dc8b38f4c +size 2505262 diff --git a/parse/train/DMxOBm06HUx/DMxOBm06HUx_span.pdf b/parse/train/DMxOBm06HUx/DMxOBm06HUx_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4ec17afb3abe96127a233cbc10ed36280ca0092f --- /dev/null +++ b/parse/train/DMxOBm06HUx/DMxOBm06HUx_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a5166ede1b07c89a09676dfd8c2bc7c4615b1f057df06fa364cf9b6ef1c5da41 +size 2677709 diff --git a/parse/train/EdXhmWvvQV/EdXhmWvvQV_layout.pdf b/parse/train/EdXhmWvvQV/EdXhmWvvQV_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..08e475a1cc566b9fa300af9b740a38c7e278c7ec --- /dev/null +++ b/parse/train/EdXhmWvvQV/EdXhmWvvQV_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2e4f04f45e949a145a5ebe4a9f4673971a365611f34ae71893276e3a144bcfba +size 702911 diff --git a/parse/train/EdXhmWvvQV/EdXhmWvvQV_origin.pdf b/parse/train/EdXhmWvvQV/EdXhmWvvQV_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3bca562d41d58ee8205ab5857710162b9dd24bc7 --- /dev/null +++ b/parse/train/EdXhmWvvQV/EdXhmWvvQV_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9e4b07b4812991a2d13fcdeefe2290668df823b6b219ea8fbb6d143798d57951 +size 571241 diff --git a/parse/train/EdXhmWvvQV/EdXhmWvvQV_span.pdf b/parse/train/EdXhmWvvQV/EdXhmWvvQV_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..18420c83c80d32b750696be5251aa25daaa4734b --- /dev/null +++ b/parse/train/EdXhmWvvQV/EdXhmWvvQV_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c4aee2d5901d4155672f34aaa9ca5f5c4f9b59414eeeab3967e877b9864c1026 +size 707348 diff --git a/parse/train/F3s69XzWOia/F3s69XzWOia_layout.pdf b/parse/train/F3s69XzWOia/F3s69XzWOia_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..46bd8d288c0e71cb8572a754a4d640934b4f91ce --- /dev/null +++ b/parse/train/F3s69XzWOia/F3s69XzWOia_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ca7f8e386c0e4544c0d0d1e4dbda9edcf26a734a44a09b5f007fb392309d1f4b +size 3328009 diff --git a/parse/train/F3s69XzWOia/F3s69XzWOia_origin.pdf b/parse/train/F3s69XzWOia/F3s69XzWOia_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2eca7e8b3f00a5b74cafb2b7daa1cff9a2a15d08 --- /dev/null +++ b/parse/train/F3s69XzWOia/F3s69XzWOia_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ff49f0bd6eac2c0581b9d559012ffc716da54dfc3152a98c5db8479d62755c67 +size 2926485 diff --git a/parse/train/F3s69XzWOia/F3s69XzWOia_span.pdf b/parse/train/F3s69XzWOia/F3s69XzWOia_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ca8b5fc3b2b90502c85ea0f002a51b11ed35e2c1 --- /dev/null +++ b/parse/train/F3s69XzWOia/F3s69XzWOia_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5fb626b18d98ba647e68d7fb28797ce607df6495cdf5e04c8c67fb8c5bad66d7 +size 3327362 diff --git a/parse/train/H1Gq5Q9el/H1Gq5Q9el_layout.pdf b/parse/train/H1Gq5Q9el/H1Gq5Q9el_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..29748dc90b84e7e7579446eb353c19ec78cd4383 --- /dev/null +++ b/parse/train/H1Gq5Q9el/H1Gq5Q9el_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c4a915e41fe062f63bf4e61cef7afe1c179df9f3ff78c836fd5cfd93bc017620 +size 502049 diff --git a/parse/train/H1Gq5Q9el/H1Gq5Q9el_origin.pdf b/parse/train/H1Gq5Q9el/H1Gq5Q9el_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..bc540b794bb539e8fb9ff633f191979e05f3a3cc --- /dev/null +++ b/parse/train/H1Gq5Q9el/H1Gq5Q9el_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:605c6e1c4ec21e5ee75aca8cc6e7665601e1f575852a22ca7b41ae40fc022db7 +size 318043 diff --git a/parse/train/H1Gq5Q9el/H1Gq5Q9el_span.pdf b/parse/train/H1Gq5Q9el/H1Gq5Q9el_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..97aa3bf7c360424bc8b0a1d63e002f89dedfcc8d --- /dev/null +++ b/parse/train/H1Gq5Q9el/H1Gq5Q9el_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0582a59a699a552217b9c4766d05b61a1116eaa7aefa702bf826be7bcf643a37 +size 498566 diff --git a/parse/train/H1MOqeHYvB/H1MOqeHYvB_layout.pdf b/parse/train/H1MOqeHYvB/H1MOqeHYvB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..fc75d6408bdb020d1d9f2d15e06b5e5d9ebf3d24 --- /dev/null +++ b/parse/train/H1MOqeHYvB/H1MOqeHYvB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a142ed4db90df925c5c0fc5d14ed312b24ed0ffd39c994e39b10b3f01c6493af +size 4486989 diff --git a/parse/train/H1MOqeHYvB/H1MOqeHYvB_origin.pdf b/parse/train/H1MOqeHYvB/H1MOqeHYvB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a35162b149e31ebfa30939e87cee0742889b6341 --- /dev/null +++ b/parse/train/H1MOqeHYvB/H1MOqeHYvB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e5f88c4c37edb3ba652da755a7cb626c3b1f36bf0bfca222604703dad1a558a5 +size 4383773 diff --git a/parse/train/H1MOqeHYvB/H1MOqeHYvB_span.pdf b/parse/train/H1MOqeHYvB/H1MOqeHYvB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9a696d6e4bcd384d6b7684eea7d9e693164096f1 --- /dev/null +++ b/parse/train/H1MOqeHYvB/H1MOqeHYvB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:29396351f6dd68d7fc60d6dd55c13d6ca624147844f7efee192a550541afbb6c +size 4485986 diff --git a/parse/train/H1VyHY9gg/H1VyHY9gg_layout.pdf b/parse/train/H1VyHY9gg/H1VyHY9gg_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..010061aa947533b5b2ac1222d0f1e35831e879c1 --- /dev/null +++ b/parse/train/H1VyHY9gg/H1VyHY9gg_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8d9f48fe46083188b053e2cc57970091a1f49a6479f8343bf83d487a42133de8 +size 485591 diff --git a/parse/train/H1VyHY9gg/H1VyHY9gg_origin.pdf b/parse/train/H1VyHY9gg/H1VyHY9gg_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..503078bcac7d2e9568b320dd01ea1163f07ddddb --- /dev/null +++ b/parse/train/H1VyHY9gg/H1VyHY9gg_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f3807a4bdf6720a3236084423fb24590162f0cb4897ce969cd62b05163aa2288 +size 360711 diff --git a/parse/train/H1VyHY9gg/H1VyHY9gg_span.pdf b/parse/train/H1VyHY9gg/H1VyHY9gg_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d66384cc2ca24affff66b93474fa19c3928f1b7e --- /dev/null +++ b/parse/train/H1VyHY9gg/H1VyHY9gg_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6dc520e7894f1a6330ae5e1c9a46c6d8a2726f3f6622872874f265766e8b9528 +size 487013 diff --git a/parse/train/H1lNPxHKDH/H1lNPxHKDH_layout.pdf b/parse/train/H1lNPxHKDH/H1lNPxHKDH_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3c87eb2ff702743b2d9e0c244938e1c3501eba6f --- /dev/null +++ b/parse/train/H1lNPxHKDH/H1lNPxHKDH_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6e42989789a84ff570b605d29cf6984b169b1955f721ab182a6d142bbefc1f57 +size 1728242 diff --git a/parse/train/H1lNPxHKDH/H1lNPxHKDH_origin.pdf b/parse/train/H1lNPxHKDH/H1lNPxHKDH_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..82b966c4d8f8ef56778e85c892ec79e6410a0304 --- /dev/null +++ b/parse/train/H1lNPxHKDH/H1lNPxHKDH_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:eda80011c1a23ee7340cf167086fa89f9e9acd93940627d53ef0141206bc5ceb +size 1095713 diff --git a/parse/train/H1lNPxHKDH/H1lNPxHKDH_span.pdf b/parse/train/H1lNPxHKDH/H1lNPxHKDH_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9471d98a40455e361e61cec48776b6295b66204f --- /dev/null +++ b/parse/train/H1lNPxHKDH/H1lNPxHKDH_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5c6e6bca90542dbb33db4893967aba801b75905574fde54f98b5fccb7257ad5c +size 1775900 diff --git a/parse/train/H1lZJpVFvr/H1lZJpVFvr_layout.pdf b/parse/train/H1lZJpVFvr/H1lZJpVFvr_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d37ab44857047b1d20ed3c179a43eb7893026b04 --- /dev/null +++ b/parse/train/H1lZJpVFvr/H1lZJpVFvr_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d11eca04b562740031cbfd07b8de353afa3656b61c0b6cdb2bd87cd6b9f91458 +size 3261085 diff --git a/parse/train/H1lZJpVFvr/H1lZJpVFvr_origin.pdf b/parse/train/H1lZJpVFvr/H1lZJpVFvr_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..1f77024f9b9e19d1ca6783e98223170d5ad3a559 --- /dev/null +++ b/parse/train/H1lZJpVFvr/H1lZJpVFvr_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ac1719c84f7c2e9c4967f32e9e1aefa62164eac77242f1ba06b541ae4b50a2cd +size 3147192 diff --git a/parse/train/H1lZJpVFvr/H1lZJpVFvr_span.pdf b/parse/train/H1lZJpVFvr/H1lZJpVFvr_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..eccdb2bb99aa6499c176faee15654b46b0a649b1 --- /dev/null +++ b/parse/train/H1lZJpVFvr/H1lZJpVFvr_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:70cb65f23c75dd1455f356780cb70a80ee8313bd5332362483b31953f0532a90 +size 3259292 diff --git a/parse/train/H1tSsb-AW/H1tSsb-AW_layout.pdf b/parse/train/H1tSsb-AW/H1tSsb-AW_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..602adf6cedd5d6e4c4f2c5b84cb980e2dfaf0401 --- /dev/null +++ b/parse/train/H1tSsb-AW/H1tSsb-AW_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:021c1691d5cc82cb71136cc952b4d8ef0cfe405e0d18026df8f85aca1dc9201a +size 1176478 diff --git a/parse/train/H1tSsb-AW/H1tSsb-AW_origin.pdf b/parse/train/H1tSsb-AW/H1tSsb-AW_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ac6488bdadb9f7bf179f45beb14a0db9f0198da6 --- /dev/null +++ b/parse/train/H1tSsb-AW/H1tSsb-AW_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c9a3ff6329f415dcf4412c90c926d1240836d01840ac6f9fc2492693cc44a28a +size 928506 diff --git a/parse/train/H1tSsb-AW/H1tSsb-AW_span.pdf b/parse/train/H1tSsb-AW/H1tSsb-AW_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a6e96d41e8d2395d92c12e93ea42dbad48289277 --- /dev/null +++ b/parse/train/H1tSsb-AW/H1tSsb-AW_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:61ffe9e6635cd3e43c60a216a65676c5d5735743b239479898c99b8fea3ab0c5 +size 1174677 diff --git a/parse/train/H1xPR3NtPB/H1xPR3NtPB_layout.pdf b/parse/train/H1xPR3NtPB/H1xPR3NtPB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c8197e03ca53429267ef4b4fc7a43fee8734ebe2 --- /dev/null +++ b/parse/train/H1xPR3NtPB/H1xPR3NtPB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:989bcb2579a3bd65f58cbaa213f41c22a54b5142a5719699db723ab1c5e8f122 +size 1197934 diff --git a/parse/train/H1xPR3NtPB/H1xPR3NtPB_origin.pdf b/parse/train/H1xPR3NtPB/H1xPR3NtPB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..14106147b8ae3ede27911f8068b05899a430f910 --- /dev/null +++ b/parse/train/H1xPR3NtPB/H1xPR3NtPB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ccd16d92af1e6504d08ca1e5e1a25aa43cd55fb0ae0729bc8d5d72faddeb67f0 +size 1035591 diff --git a/parse/train/H1xPR3NtPB/H1xPR3NtPB_span.pdf b/parse/train/H1xPR3NtPB/H1xPR3NtPB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..286a1aa9f5c88415f4510cf2c32fb2aaf349bc9f --- /dev/null +++ b/parse/train/H1xPR3NtPB/H1xPR3NtPB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:dfb7d594aab244d9596ef78a9e7f3d8d8edcaa40f439176a8d28e9c84005366e +size 1204260 diff --git a/parse/train/H1zxjsCqKQ/H1zxjsCqKQ_layout.pdf b/parse/train/H1zxjsCqKQ/H1zxjsCqKQ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..74d8b9c50d12c594a58ba217ac73733a1e0169dc --- /dev/null +++ b/parse/train/H1zxjsCqKQ/H1zxjsCqKQ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:be9edbb9ff5bed06abaf5ebd2082d60b25b9f1da9841e3c982ebd8ecb03a0cca +size 518755 diff --git a/parse/train/H1zxjsCqKQ/H1zxjsCqKQ_origin.pdf b/parse/train/H1zxjsCqKQ/H1zxjsCqKQ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e277e741c76a680ffa6a18700a3e85348dca8bee --- /dev/null +++ b/parse/train/H1zxjsCqKQ/H1zxjsCqKQ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6bbc0d38981abff394b0a228a5c6007323ed46aae7531acd81ef3cbf95aef700 +size 293293 diff --git a/parse/train/H1zxjsCqKQ/H1zxjsCqKQ_span.pdf b/parse/train/H1zxjsCqKQ/H1zxjsCqKQ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ba3ec22b740051c552e3b4679d625d4d35ae952b --- /dev/null +++ b/parse/train/H1zxjsCqKQ/H1zxjsCqKQ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7c367be60a37a7c06ad2a7047fd11889fd2d3803f74385011318b98344b51f68 +size 522183 diff --git a/parse/train/HJ0NvFzxl/HJ0NvFzxl_layout.pdf b/parse/train/HJ0NvFzxl/HJ0NvFzxl_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..61aab392a11e69df0254b37bebf92b676493224e --- /dev/null +++ b/parse/train/HJ0NvFzxl/HJ0NvFzxl_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:df286e7691f35bdf4a47c9e87ce8c185d0a8211611f2e76b0a0856d308aa194f +size 1800009 diff --git a/parse/train/HJ0NvFzxl/HJ0NvFzxl_origin.pdf b/parse/train/HJ0NvFzxl/HJ0NvFzxl_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6d55aa13a03df8ffe3c887c1cbe15200095fa5d0 --- /dev/null +++ b/parse/train/HJ0NvFzxl/HJ0NvFzxl_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c6783f8665897b03b91b816c0b1a8eb49be75649ee53ad618a1c45154a4474e6 +size 1576599 diff --git a/parse/train/HJ0NvFzxl/HJ0NvFzxl_span.pdf b/parse/train/HJ0NvFzxl/HJ0NvFzxl_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b0c28c1d7329e2ba881d2aad039b670c7af8cd4d --- /dev/null +++ b/parse/train/HJ0NvFzxl/HJ0NvFzxl_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:35421cd304bf1fbab93ea40a4a2bd9dbdbf27f2c93050c9ef291e01d8d791b03 +size 1808905 diff --git a/parse/train/HJCXZQbAZ/HJCXZQbAZ_layout.pdf b/parse/train/HJCXZQbAZ/HJCXZQbAZ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..dd99060adc609e06b3a4113247df2491975c2b54 --- /dev/null +++ b/parse/train/HJCXZQbAZ/HJCXZQbAZ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d569428af236eb287f9b9402ddaebd56d5469b0d44115f2edadcb478013dc78b +size 1183470 diff --git a/parse/train/HJCXZQbAZ/HJCXZQbAZ_origin.pdf b/parse/train/HJCXZQbAZ/HJCXZQbAZ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b830351c68510aace16a1063c7aac9f421f309eb --- /dev/null +++ b/parse/train/HJCXZQbAZ/HJCXZQbAZ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:272cc7a020972f8f2c3f3cfe9158ceefc8ff473058b9063d9aff48ccd01e6947 +size 997588 diff --git a/parse/train/HJCXZQbAZ/HJCXZQbAZ_span.pdf b/parse/train/HJCXZQbAZ/HJCXZQbAZ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d4b558f44950c135fc9b810144aa5e08eb808b78 --- /dev/null +++ b/parse/train/HJCXZQbAZ/HJCXZQbAZ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e5f0d1a772b4abf59d8fa1ef3a6ca4fe9fc2ec4eac06465068d6be95b0f7323f +size 1193721 diff --git a/parse/train/HJeTo2VFwH/HJeTo2VFwH_layout.pdf b/parse/train/HJeTo2VFwH/HJeTo2VFwH_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ea231b30dbee183be6b92120fb1e9ad610c9a098 --- /dev/null +++ b/parse/train/HJeTo2VFwH/HJeTo2VFwH_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8dc566b39b2735c8b71656495d0b32c0b8bbf2fb1a71acb96a49d63f01573813 +size 2431972 diff --git a/parse/train/HJeTo2VFwH/HJeTo2VFwH_origin.pdf b/parse/train/HJeTo2VFwH/HJeTo2VFwH_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a2044139293180f1c10919ad63f514b020066f95 --- /dev/null +++ b/parse/train/HJeTo2VFwH/HJeTo2VFwH_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a80592bfc855471a9e88b53ac353105c3ed8ad2de52fdd7f53848323d82abb85 +size 2238956 diff --git a/parse/train/HJeTo2VFwH/HJeTo2VFwH_span.pdf b/parse/train/HJeTo2VFwH/HJeTo2VFwH_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ff45ec0f3ab61088a9ce1fe6499bfc33ee7a3e96 --- /dev/null +++ b/parse/train/HJeTo2VFwH/HJeTo2VFwH_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:18c2dc87e130a8ffbb1dad94659a09236f989df4e5c472e8b2cef8c3ba5f29cc +size 2439647 diff --git a/parse/train/HJnQJXbC-/HJnQJXbC-.md b/parse/train/HJnQJXbC-/HJnQJXbC-.md new file mode 100644 index 0000000000000000000000000000000000000000..5a049762b1a7ebc010beeb223755dcea97d77689 --- /dev/null +++ b/parse/train/HJnQJXbC-/HJnQJXbC-.md @@ -0,0 +1,268 @@ +# AMPNET: ASYNCHRONOUS MODEL-PARALLEL TRAINING FOR DYNAMIC NEURAL NETWORKS + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +New types of compute hardware in development and entering the market hold the promise of revolutionizing deep learning in a manner as profound as GPUs. However, existing software frameworks and training algorithms for deep learning have yet to evolve to fully leverage the capability of the new wave of silicon. In particular, models that exploit structured input via complex and instance-dependent control flow are difficult to accelerate using existing algorithms and hardware that typically rely on minibatching. We present an asynchronous model-parallel (AMP) training algorithm that is specifically motivated by training on networks of interconnected devices. Through an implementation on multi-core CPUs, we show that AMP training converges to the same accuracy as conventional synchronous training algorithms in a similar number of epochs, but utilizes the available hardware more efficiently, even for small minibatch sizes, resulting in shorter overall training times. Our framework opens the door for scaling up a new class of deep learning models that cannot be efficiently trained today. + +# 1 INTRODUCTION + +An emerging category of neural networks show the common trait of reacting in dynamic and unique ways to properties of their input. Networks like tree-structured recursive neural networks (Socher et al., 2013; Tai et al., 2015) and graph neural networks (GNNs) (Scarselli et al., 2009; Li et al., 2015; Gilmer et al., 2017) take structured data types as input and and execute a computation that depends on the input structure. This defies the moden GPU-driven paradigm of minibatch-based processing, and we refer to this new class of models with dynamic control flow as dynamic neural networks. + +The development of dynamic neural network frameworks – Chainer (Tokui et al., 2015), DyNet (Neubig et al., 2017a), and PyTorch (PyTorch core team) – speaks to the importance of this class of models and highlights the challenge of how to make it easy for users to describe them. Yet there is another big challenge: how can we train these models efficiently? + +Managing minibatches to keep GPUs fully utilized is typically considered a user’s responsibility in these dynamic frameworks (with the exception of DyNet’s autobatching feature; see Sec. 7). This means that users have to think about how to change their data feeding pipeline or even the model itself to run efficiently on GPUs, rather spending time innovating to improve the model accuracy. + +What if we had a hypothetical device with low memory overhead that allows perfect scaling without batching; i.e., processing 1 item is simply $1 0 0 \mathrm { x }$ faster than processing 100 items? Recent work on FPGAs and other specialized hardware (Farabet et al., 2011; Caulfield et al., 2016; Jouppi et al., 2017) for deep learning encourages us to investigate this question. Our premises are + +1. No batching is required for efficient processing. 2. Each device may not have enough memory to hold the entire model (this is a realistic constraint for current memory systems that approach the perfect scaling we require) + +Based on these premises, we propose an asynchronous model-parallel (AMP) training algorithm. Our idea is illustrated in Figure 1. We need model parallelism because each device may be too small to hold the entire model (premise 2). However, if we perform synchronous parameter updates following the full forward and backward propagations, the only way to increase device utilization is by pipelining multiple instances into the system (see e.g., Chen et al., 2012). Pipeline parallelism with synchronous updates is at odds with convergence speed due to a decreased parameter update frequency; compare Fig. 1 (a) and (b). + +![](images/7852ac9eac92bbdd64cbafe7eac5fba75ec33dbe3ccd6ef94eaaffd20d2bb990.jpg) +Figure 1: Gantt charts comparing pipelined synchronous model parallelism and asynchronous model parallelism. Orange, blue, and yellow boxes correspond to forward, backward, and parameter update operations, respectively. The numbers in the boxes indicate instance IDs. + +To overcome this problem, we propose asynchronous parameter updates that occur without global synchronization whenever a pre-specified number of gradients have been accumulated; see Fig. 1 (c). With this design we aim for both high device utilization and update frequency. + +In this setting, however, model parameters may be updated between the forward and the backward computation of an instance, introducing gradient “staleness”. Despite staleness, we show that AMP training can converge fast with good hardware utilization. Specifically, our contributions are: + +• We present the asynchronous model parallel training algorithm for efficient distributed training of dynamic networks. We present an intermediate representation (IR) with explicit constructs for branching and joining control flow that supports AMP training. Unlike previous work that considers static computation graphs for static control flow (e.g., Caffe), and dynamic computation graphs for dynamic control flow (e.g., Chainer), our IR encodes a static computation graph to execute dynamic control flow1. This makes training easy to distribute and parallelize. We show that our IR can readily encode replicas, a form of data parallelism (see Sec. 5). In addition, our IR includes operators for data aggregation, which recover a form of batching, enabling our methods to be applied even on hardware where batching is beneficial. • We implement AMP training on a multi-core CPU and empirically demonstrate that AMP training converges to similar accuracies as synchronous algorithms on a variety of dynamic neural network models including Tree RNN and gated graph neural networks (GGNN). + +In summary, our work demonstrates the benefits of AMP training and gives a novel way to design and deploy neural network libraries with dynamic control flow. In addition, we use our implementation to estimate the performance on a hypothetical device satisfying premises 1 & 2, with 1TFLOPS compute capability (see Appendix C). Together, these contributions open up new ways to scale up dynamic networks on interconnected compute devices. + +# 2 NEURAL NETWORKS WITH DYNAMIC CONTROL FLOW + +Below we highlight three models with dynamic control flow that will be studied in depth in this paper: + +Variable-length RNNs iterate over the tokens of variable-length sequences. Pseudo-code for a simple vanilla RNN is given in Figure 2. The linear (fully connected) layer and rectified linear unit (ReLU) can be substituted with a more sophisticated unit such as a gated recurrent unit (Chung et al., 2014). Though each instance has a different length, it is possible to add padding to enable batching. However this may lead to significant redundant compute due to variability in sequence lengths. + +![](images/217149a2d1737896fff3ba084e656184671f3a0db8cb74837b1d30ac15635f63.jpg) +Figure 2: Variable-length RNN in IR and pseudocode (colors denote IR node types) + +
Algorithm 1 Asynchronous Model-Parallel training
while training not done do
for all workers in parallel do
Wait until a message arrives
msg ←the highest priority message from the input queue
op ← sink node of the message msg
if msg is forward type then Compute forward: out_msgs ← op(msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the child nodes.
else if msg is backward type then
Compute backward: out_msgs ← op*(msg,fwd_msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the parent nodes.
else if msg isupdate type then
Perform parameter updates on op
end if
end for
end while
+ +Tree-structured neural networks are powerful models used for parsing of natural language and images, semantic representation, and sentiment analysis (Socher et al., 2011; Bowman et al., 2016; Socher et al., 2013; Tai et al., 2015). They require evaluation of (potentially multiple) trees with shared parameters but different topology for each instance. Each tree structure is instance-specific and batching requires nontrivial planning (Looks et al., 2017). A simple form of tree neural network performs a bottom up traversal of the instance, starting from an embedding of the leaves. At each level the values from the child nodes are concatenated and sent through a specialized unit (e.g. LSTM). The result is then propagated further up the tree. Backpropagation over the tree structure is known as backpropagation through structure (Goller and Kuchler, 1996). + +Graph neural networks (Scarselli et al., 2009; Li et al., 2015; Gilmer et al., 2017) combine both the temporal recurrence and recurrence over the structure. GNNs can be seen as performing aggregation/distribution operations over a general graph structure with shared parameters. + +Apart from the models above, there exist many recently proposed models with flexible control flow (e.g. hierarchical memory networks (Chandar et al., 2016), neural programmer interpreters (Reed and De Freitas, 2015), adaptive computation networks (Graves, 2016; Figurnov et al., 2016), and sparsely-gated mixture of experts (Shazeer et al., 2017), to which our framework can be applied. + +# 3 ASYNCHRONOUS MODEL-PARALLEL TRAINING + +In AMP training, each node of a computation graph (including control flow nodes – see next section) is associated with a worker, which is an abstraction of a compute device. Neural network training and inference is carried out by message passing among workers following algorithm 1. All workers run in parallel without synchronization. Each message contains a payload (float or int tensor), as well as a state that includes the IDs of the source and sink nodes and a label indicating the type of message (forward, backward, or update). The state is used to keep track of algorithm and control flow information. For example, in a variable-length RNN the state also contains the instance identifier, the current position in the sequence, and the total sequence length for the instance. More generally, if the neural model use (possibly nested) loops, then the state for the messages that arrive to and are produced from nodes that logically belong in loop bodies will contain sets of loop counters that together with the instance id uniquely identify the messages throughout the course of the computation. + +When a worker receives a message labeled as forward (or backward) then it performs the operation of the node indicated by the sink node ID on the supplied payload. This produces one or more outgoing messages that are then enqueued into the queues of the workers hosting the next sink nodes in the computation graph. The final loss layer initiates backward propagation. If the message type is update, the worker will carry out weight updates on the sink node using gradients accumulated in the appropriate slot in the worker’s local memory. Since both the operation weights and weight gradients can be stored locally on the worker then workers only need to communicate activations and activation gradients, which are typically an order of magnitude smaller than the weights. The update message is typically sent from the sink node to itself as part of the backward process but it can also be sent from a controller node to simulate synchronous pipelined training. + +There are two important details that are not fully spelled out in Algorithm 1. First, since the messages arrive asynchronously (and possibly out of order), any operation that has more than one parent nodes need to store the payload into its local cache until all the parents send the corresponding payloads. Thus output message(s) can only be produced when all the payloads become available. The cache needs to be able to distinguish payloads received from different parents and payloads with different instance ID, and different counters (all encoded in the message states). The same is true in the backward pass for a node with multiple child nodes. Second, ${ \tt o p } ^ { * }$ denotes the adjoint operation of op and takes the backward message msg and potentially the forward message fwd msg stored in the cache. For a nonlinear activation node (e.g., ReLU), the node will not change the state of the message in the forward pass. Thus in the backward pass, the adjoint operation will just multiply the partial derivative of the activation function to the payload of the received backward message keeping the state unchanged. By contrast, an operation that only changes the state of the message in the forward pass (e.g., increment the loop counter) will reverse the change in the backward pass leaving the payload unchanged. + +In the experiments we vary two hyper parameters to control the effect of asynchrony: + +min update interval: determines the minimum number of gradients that a parameterized operation needs to accumulate before it can update its parameters (using the update message). The staleness of a gradient can be measured by the number of updates between the forward and backward computation that produces the gradient. Small min update interval may increase gradient staleness. On the other hand, large min update interval can reduce the variance of the gradient but can result in very infrequent updates and also slow down convergence. + +max active keys: controls the maximum number of active instances that are in-flight at any point in time. By setting max active key $\mathbf { \boldsymbol { s } } = 1$ we restrict to single-instance processing, typically equivalent to synchronous training. More in-flight messages generally increase hardware utilization, but may also increase gradient staleness. Section 6 demonstrates the effects of these parameters in a multi-core CPU runtime. + +# 3.1 WORKER AFFINITY + +In our asynchronous execution model, the optimal assignment of $N$ neural network computation graph nodes to $W$ workers (referred to as affinitization) is in general a non-trivial scheduling problem. We investigated several heuristics for assigning affinities (for example $\mathbf { k }$ -hop coloring (Ichrak et al., 2012) to ensure subsequent heavy operations were assigned different workers). However, we find that the following procedure achieves high performance in practice in our multi-core CPU implementation, and is adopted throughout our experiments for simplicity. We first partition the nodes into $H$ ’heavy’ operations (namely matrix multiplies) and $( N - H )$ ’light’ operations, and then balance the heavy nodes across the workers by affinitizing the $h ^ { \mathrm { t h } }$ with the $( h \mod W ) ^ { \mathrm { t h } }$ worker. Finally, the light operations are affinitized randomly among the rest of the workers. Note that in scenarios where communication is over a physical network affinitization will become more critical for high performance. + +![](images/05546d60c49a3bb63bc9a2abaa8d81d264c7b6f479acb7c5ca1109ff70b82680.jpg) +Figure 3: Distribution based on dynamic information + +# 4 A STATIC INTERMEDIATE REPRESENTATION FOR DYNAMIC CONTROL FLOW + +Overview Computation graphs are expressed using a static intermediate representation (IR) that can be a compilation target for high-level libraries (e.g. TensorFlow or our own Python and $\mathrm { C } { + + }$ frontends), and can itself admit multiple backends (e.g. the multi-core CPU runtime in this paper, or a network of accelerators). Static means that the IR graph is instance-independent. Nevertheless, it can execute dynamic and instance-dependent control flow decisions, in a forward and backward manner, by storing instance- and iteration-dependent information as the computation evolves. Each IR node comes with a forward and a backward semantics. A model is specified by (i) an IR graph, and (ii) a specialized controller loop that pumps instances and other data (e.g. initial hidden states or labels), and is responsible for throttling asynchrony. In the rest of this section we discuss the most important IR nodes along with their operational semantics, and show how they are used in the example models. + +Payload transformations Parameterized payload transform (PPT) nodes can be used to encode, for instance, fully connected layers. They apply a transform in the forward pass, but also record the activation in order to use it to compute gradients in the backward pass. An activation is recorded by keying on the state of the message, allowing thus to process forward and backwards messages completely asynchronously, and – in the extreme case – out of order. A PPT node requires specification of the forward and the backward transformation. It may decide to independently apply accumulated gradients to update its parameters. For transformations that do not involve parameters (e.g. ReLUs) our IR offers a simpler non-parameterized payload transform. + +Loops, state, and control flow A condition node (Cond $f$ ) is parameterized by a function $f$ that queries the state (but not the payload) of the incoming message and, based on the response, routes the input to one of the successor nodes. A join node (Phi) propagates the messages it receives from each of its ancestor nodes but records the origin (using the state of the message as the key) so that in the backward pass it can backpropagate them to the correct origin. An invertible state update node $( \mathtt { I s u } \ f \ f ^ { - 1 } )$ is parameterized by two functions $f$ and $f ^ { - 1 }$ that operate on the state of a message, and satisfy $\bar { f } ^ { - 1 } ( f ( \bar { x } ) ) = x$ . Typically these are loop counter update functions. + +Figure 2 shows how to encode an RNN. The loop at the heart of the RNN is implemented with Cond, Phi and Isu nodes. The controller pumps sequences in a lookup table (just another PPT layer), and our Ungroup node (to be described in the next section) generates a stream of tensors each corresponding to a single token, tagged with the current time-step (loop counter). For each forward message, the Isu node increments the time-step, and the conditional node tests whether the end of the sequence has been reached. Depending on the answer it either propagates the hidden state back to Phi, or pushes the hidden state to the final linear and loss layers. In backward mode, messages pass through the Isu (which decrements the time-step), and reach the Phi node. The Phi node will (based on information from the forward phase) either back-propagate to the Cond node, or to the controller to terminate. Hence the loop is executed in both the forward and backward direction. + +![](images/09f7aa446951696f32af43edccbcf5dc7b775fea5217c39a8ac79143df2a7033.jpg) +Figure 4: IR graphs for (a) Gated Graph Neural Network and (b) RNN-with-replicas. The RNNCell in (a) denotes a recurrent structure (e.g. GRU, LSTM), the details of which we omit. Cond modId in (b) implements a round-robin branching to different replicas by computing (instance ID mod 3). + +Aggregation and disaggregation Our IR offers several constructs for aggregation and disagreggation; for example RNN requires us to concatenate (Concat) hidden states and embeddings with matching timesteps and instance ids (states). We offer a construct for broadcasting (Bcast) a message to multiple successors. We offer an ungrouping construct (Ungroup) that ungroups a matrix and emits all resulting messages tagged with an extra user-provided increasing loop counter. This allows us to insert the stream of token embeddings in the middle of the RNN loop in Figure 2. In backward mode Ungroup groups back all the incoming gradients. A simpler variant of Ungroup is Replicate, which replicates a message with an extra loop counter in the state. In backwards mode Replicate sums up all incoming gradients that correspond to the state without the extra loop counter. + +Figure 4(a) describes a GNN that combines aggregation on the structure of a graph instance with an outer loop. The controller pumps data that contain the feature embeddings of all nodes of an input graph. In addition it pumps in a map specifiying graph topology. The Distribute node uses that information along with the graph itself to create sub-matrices (here each corresponding to edge types) and pass them through linear (fully connected) layers. The Collect node collects and re-groups the results based on graph topology. These nodes correspond to a form of dynamic partition and merging. Schematically the Distribute behaviour is given in Figure 3. In backward mode, based on the control information received during the forward pass (gray line) re-groups the gradients and sums together those that correspond to the same index. The Collect operator is essentially symmetric. + +# 5 DATA PARALLELISM IN MODEL PARALLELISM + +Pipelined model parallelism can often be augmented with forms of data parallelism. Consider the RNN in Fig. 2. The only heavy operation (Linear-1) in the body of the loop will act as a bottleneck for computation. One solution is to split the linear layer into smaller tiles and compute them in parallel. This is expressible in our IR but the linear operation needs to be large enough to benefit from tiling in this way. Another approach is to replicate the linear layer in full. This requires only minimal new machinery – we can replicate the linear layer and place the replicas inside Cond and Phi nodes as in Figure 4(b). Different instances or messages from the same instance but with different position in the sequence can be processed in an (pipeline-)parallel fashion by being sent to one of the replicas chosen by a random or deterministic function of the message state. To enable parameters to be shared among the replicas, we use infrequent end-of-epoch replica synchronization (averaging) that incurs negligible communication cost. We also tried more elaborate message-passing protocols for group synchronization, but found that infrequent global synchronization was sufficient for fast convergence. + +# 6 EXPERIMENTS + +We evaluate AMPNet using the dynamic models introduced in Section 2. For completeness, we additionally consider a multi-layer perceptron (MLP) as an example of a static, batched network + +that AMPNet is not specifically designed to tackle. Brief details of the models and data sets in the experiments are presented below, and further details are given in Appendix B. + +
ModelData setDifficultyExperiment purpose
MLPMNISTtoyThe standard deep learning bench- mark (for which AMPNet is not
RNNList reductiontoyspecifically designed) The simplest architecture with dy-
Tree-LSTMStanford Sentiment Treebankreal-worldnamic control flow (a for loop) The TensorFlow Fold benchmark for
GNNQM9real-worldbackpropagation through structure Complex control flow with loops over time and structure
+ +Results Our asynchronous runtime is motivated by the promise of emerging hardware (e.g. FPGA accelerators) that fulfill the premises in section 1 and are well suited to dynamic neural network execution. Here we are primarily interested in how the performance of our runtime improves as we increase the degree of asynchrony (by varying max active keys) while keeping other factors fixed. The aim is to answer the question of whether AMP training is a promising direction for novel distributed hardware that deviates from the CPU/GPU batching paradigm. To answer this question using resources available today we run the AMPNet training using a multi-core CPU runtime where each worker is a hardware thread (see Appendix A). Additionally we forecast the performance on a hypothetical 1TFLOPS device satisfying our premises by replacing all computation nodes by configurable sleep nodes. This allows us to estimate the performance on a new hardware keeping the control flow decisions dynamic. See Appendix C. + +It is also interesting to compare how the raw CPU performance of the AMP runtime compares with existing frameworks (TensorFlow, TensorFlow Fold and DyNet) to see that our implementation is already competitive with state of the art methods even on CPUs that do not conform to our target hardware model. We provide additional analysis for each experiment below. + +On MNIST, Table 1 shows $_ { 3 \mathrm { X } }$ speedup from synchrony (max active keys $: = 1$ ) to asynchrony (max active key $s = 4$ ) in terms of throughput. This is almost ideal as the first three linear layers are the heaviest operations. The number of epochs to reach the target validation accuracy increases from 3 to 4 but the overall speedup in terms of the wall clock time is $2 . 2 \mathbf { x }$ . We have also compared AMP training against pipeline parallel training (Fig. 1 (b)). Figure 5(a) shows that while AMP training achieves 3x throughput gain already with $\mathtt { m a x \mathrm { _ { - } a c t i v e \mathrm { _ { - } k e y s = 4 } } }$ , pipeline parallelism can only achieve $2 \mathbf { x }$ (in fact from Fig. 1 (b), $3 m / ( m + 2 )$ is the best case for max active key $s = m$ ) + +Table 1: Time to convergence to target validation accuracy. The time to convergence can be broken down into number of epochs and the throughput (instances/s). The target accuracy is shown inside parentheses next to each dataset. mak is a short-hand for max active keys defined in Sec. 3; $\mathrm { m a k } = 1$ corresponds to synchronous training for MNIST and minimal asynchrony arising from just one in-flight instance for other models with recursive structures. + +
AMPTensorFlow
maktime (s)epochsinst/stime (s)epochsinst/s
MNIST (97%)191.13207634.535880
440.4 (2.2x)46268
List reduction (97%)1781013k46718k
466 (1.2x)10.516k
1660 (1.3x)9.516k
(2 replicas)438(2x)1235k
(4 replicas)821 (3.8x)1371k
Sentiment (82%)118521022085265
882 (2.3x)2222
16104 (1.8x)3258
QM9 (4.6)4N/AN/A9886696661217
16522776.51797
+ +![](images/05af97a8258c4fd509b6b362b27a58a6b87d9eab74790a022c39a54270e8b031.jpg) +(a) Comparison against pipeline parallelism (Fig. 1 (b)) (b) Performance of an 8-replica RNN model on the list reducfor 4-layer MLP on MNIST. tion dataset as a function of asynchrony hyperparameters. +Figure 5: Throughput-convergence trade-off as a function of mode of parallelism and asynchrony hyper-parameters. Solid gray lines show constant convergence time trajectories; mak and mui stand for max active keys and min update interval, respectively. + +and higher throughput at max active keys $= 8$ is achieved at the cost of the sharp increase in the number of epochs to convergence. + +The list reduction dataset demonstrates the power of replicas. As there is only one heavy operation (Linear-1, Figure 2), the speedup from asynchrony is mild (1.3x). However we get $2 . 5 \mathrm { x }$ and $3 . 5 \mathrm { x }$ speedup for 2 and 4 replicas, respectively, which is nearly ideal. Again, the # of epochs to convergence is not affected by increasing max active keys. The slowdown in convergence for 4 replicas is due to the increased effective minibatch size – also commonly observed in data parallel training. + +Next the sentiment tree-RNN dataset shows that our runtime is competitive without batching to TensorFlow Fold (Looks et al., 2017) using dynamic batching of batch size 100. It is worth mentioning that our runtime allows us to specify different min update interval parameter for each parameterized operation. We set this parameter to 1000 for the embedding layer, which is initialized by Glove vectors, and 50 for all other layers. This reduced gradient staleness in the embedding layer. + +The QM9 dataset demonstrates that increasing asynchrony helps on real-world tasks with complex control flow, and our method outperforms an efficient TensorFlow implementation on CPUs. + +Finally, we have implemented the BiLSTM w/ char model in Neubig et al. (2017b) on Wikiner dataset Nothman et al. (2013). Our preliminary implementation without any batching achieves 130 sentences/s at max active keys $= 3 2$ without any noticeable loss in accuracy (around $94 \%$ after one epoch). This is competitive with DyNet’s performance on the same machine (23 sentences/s without and 220 with autobatching, respectively); See Sec. B.5 for details. + +Asynchrony Finally we provide additional analysis on the effect of asynchrony. The degree of asynchrony is controlled by hyperparameters min update interval and max active keys. In Fig. 5(b) we use an 8-replica RNN model on the list reduction dataset to investigate how these parameters affect the data and time required to converge to $96 \%$ validation accuracy. We find, in analogy with minibatch size in traditional systems, that min update interval must neither be too large nor too small. Increasing max active keys (increasing asynchrony) monotonically increases performance when the number of keys is similar to the number of individually affinitized heavy operations in the model 8 in this case). Increasing max active keys significantly beyond this point produces diminishing returns. + +# 7 RELATED WORK + +One approach to the task of training networks with instance dependent control flow is to define the computation graph dynamically per-instance. This approach is taken in Chainer (Tokui et al., + +2015), DyNet (Neubig et al., 2017a), and PyTorch (PyTorch core team). There are key challenges in accelerating this approach: Model parallelism would require the dynamically generated computation graph to be scheduled on-the-fly, and BLAS level parallelism would require operations to be batched on-the-fly. Automatic dynamic batching has been implemented in DyNet (Neubig et al., 2017a), and is an interesting alternative to our asynchronous execution. Similar methods are used in TensorFlow Fold (Looks et al., 2017). The basic idea is to inspect and merge together (by depth) the unrolled computation graphs of several instances to create batched BLAS operations. The effectiveness of automatic batching greatly depends on the model – for example, it would not perform well on random permutations of a sequence of operations. By contrast, our IR would very succinctly express and achieve pipeline parallelism using a static computation graph that is easy to distribute and optimize. + +Theano (Al-Rfou et al., 2016) and TensorFlow (TF)(Abadi et al., 2016) can syntactically handle instance dependent control flow with abstractions for conditional execution (ifelse in Theano and cond in TF) and loops (scan and while loop, respectively); TF also provides higher-order functions, such as map, foldl, foldr, and scan. The main difference between AMPNet and the above frameworks is that AMPNet is streaming and asynchronous whereas Theano is non-streaming and synchronous. Although not designed for streaming, TF can support streaming programmatically as it exposes first-class queues, as well as data prefetching with so called input pipelines. In our IR, all the queuing is implicit and stream-based execution is the default. TF additionally does support static description of dynamic control flow and state update, but we depart from the classic dataflow architecture that TF follows (Arvind and Culler, 1986): First, instead of having nodes that represent mutable reference cells, we encapsulate the state with which a message should be processed through the graph in the message itself. Second, because we encapsulate algorithmic state in the messages, we do not introduce the notion of control dependencies (which can be used to impose a specific execution order on TF operations). Our choices complicate algorithmic state management from a programming point of view and make the task of designing a high-level compiler non-trivial, but allow every node to run asynchronously and independently without a scheduler and without the need for control messages: For example, nodes that dynamically take a control flow path or split the data simply consult the state of the incoming message, instead of having to accept additional control inputs. For “small” states (e.g. nested loop counters or edge and node ids) this might be preferable than out-of-band signaling. Our IR can implement loops by simply using state-update, conditional, and phi nodes, because the state accompanies the payload throughout its lifetime, whereas TF introduces specialized operators from timely dataflow (Murray et al., 2016) to achieve the same effect. + +Asynchronous data parallel training (Recht et al., 2011; Dean et al., 2012; Chilimbi et al., 2014) is another popular approach to scale out optimization by removing synchronization (orthogonal to and combinable with model-parallel training). For example, convolutional layers are more amenable to data-parallel training than fully connected layers, because the weights are smaller than the activations. Moreover, when control flow differs per data instance, data parallelism is one way to get an effective minibatch size $> 1$ , which may improve convergence by reducing variance. The impact of staleness on convergence (Recht et al., 2011) and optimization dynamics (Mitliagkas et al., 2016) have been studied for data parallelism. It would be interesting to extend those results to our setting. + +Jaderberg et al. (2016), like us, aim to to train different parts of a model in a decoupled or asynchronous manner. More precisely, their goal is to approximate a gradient with a synthetic gradient computed by a small neural network that is locally attached to each layer. Hence, the local gradient calculation becomes independent of other layers (except for the training of the gradient predictor network) and allows asynchronous parameter updates. This would be especially useful if the evaluation of the local network is cheaper than the computation of the real gradient; for example, if the computation of the real gradient required significant communication of forward/backward messages between devices. + +# 8 CONCLUSION AND OUTLOOK + +We have presented an asynchronous model-parallel SGD algorithm for distributed neural network training. We have described an IR and multi-core CPU runtime for models with irregular and/or instance-dependent control flow. Looking forward, we aim to deploy our system on specialized hardware. Equally importantly, we plan to build a compiler that automatically deduces the information to be placed in the states and generates state keying functions from a higher-level description of the models. By unlocking scalable distributed training of dynamic models, we hope to enable exploration of this class of models that are currently only on the horizon but may become more mainstream in the future. + +REFERENCES +M. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin, et al. TensorFlow: Large-scale machine learning on heterogeneous distributed systems. arXiv preprint arXiv:1603.04467, 2016. +R. Al-Rfou, G. Alain, A. Almahairi, C. Angermueller, D. Bahdanau, N. Ballas, F. Bastien, J. Bayer, A. Belikov, et al. Theano: A python framework for fast computation of mathematical expressions. arXiv preprint arXiv:1605.02688, 2016. +Arvind and D. E. Culler. Dataflow architectures. Annual Review of Computer Science, 1(1):225–253, 1986. URL http://csg.csail.mit.edu/pubs/memos/Memo-261-1/Memo-261-2.pdf. +S. R. Bowman, J. Gauthier, A. Rastogi, R. Gupta, C. D. Manning, and C. Potts. A fast unified model for parsing and sentence understanding. arXiv preprint arXiv:1603.06021, 2016. +A. M. Caulfield, E. S. Chung, A. Putnam, H. Angepat, J. Fowers, M. Haselman, S. Heil, M. Humphrey, P. Kaur, J.-Y. Kim, et al. A cloud-scale acceleration architecture. In Microarchitecture (MICRO), 2016 49th Annual IEEE/ACM International Symposium on, pages 1–13. IEEE, 2016. +S. Chandar, S. Ahn, H. Larochelle, P. Vincent, G. Tesauro, and Y. Bengio. Hierarchical memory networks. arXiv preprint arXiv:1605.07427, 2016. +X. Chen, A. Eversole, G. Li, D. Yu, and F. Seide. Pipelined back-propagation for context-dependent deep neural networks. In Interspeech, pages 26–29, 2012. +T. M. Chilimbi, Y. Suzue, J. Apacible, and K. Kalyanaraman. Project Adam: Building an efficient and scalable deep learning training system. In OSDI, volume 14, pages 571–582, 2014. +J. Chung, C. Gulcehre, K. Cho, and Y. Bengio. Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555, 2014. +J. Dean, G. Corrado, R. Monga, K. Chen, M. Devin, M. Mao, A. Senior, P. Tucker, K. Yang, Q. V. Le, et al. Large scale distributed deep networks. In Advances in neural information processing systems, pages 1223–1231, 2012. +C. Farabet, Y. LeCun, K. Kavukcuoglu, E. Culurciello, B. Martini, P. Akselrod, and S. Talay. Large-scale FPGA-based convolutional networks. Scaling up Machine Learning: Parallel and Distributed Approaches, pages 399–419, 2011. +M. Figurnov, M. D. Collins, Y. Zhu, L. Zhang, J. Huang, D. Vetrov, and R. Salakhutdinov. Spatially adaptive computation time for residual networks. arXiv preprint arXiv:1612.02297, 2016. +J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl. Neural message passing for quantum chemistry. arXiv preprint arXiv:1704.01212, 2017. +C. Goller and A. Kuchler. Learning task-dependent distributed representations by backpropagation through structure. In Neural Networks, 1996., IEEE International Conference on, volume 1, pages 347–352. IEEE, 1996. +A. Graves. Adaptive computation time for recurrent neural networks. arXiv preprint arXiv:1603.08983, 2016. +A. Ichrak, P. Minet, and C. Adjih. Node coloring in wireless networks: Complexity results and grid coloring. 09 2012. +M. Jaderberg, W. M. Czarnecki, S. Osindero, O. Vinyals, A. Graves, and K. Kavukcuoglu. Decoupled neural interfaces using synthetic gradients. arXiv preprint arXiv:1608.05343, 2016. +N. P. Jouppi, C. Young, N. Patil, D. Patterson, G. Agrawal, R. Bajwa, S. Bates, S. Bhatia, N. Boden, A. Borchers, et al. In-datacenter performance analysis of a tensor processing unit. arXiv preprint arXiv:1704.04760, 2017. +D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. CoRR, abs/1412.6980, 2014. URL http://arxiv.org/abs/1412.6980. +Y. LeCun and C. Cortes. The MNIST database of handwritten digits, 1998. +Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel. Gated graph sequence neural networks. arXiv preprint arXiv:1511.05493, 2015. +M. Looks, M. Herreshoff, D. Hutchins, and P. Norvig. Deep learning with dynamic computation graphs. arXiv preprint arXiv:1702.02181, 2017. Sentiment Tree Bank example: https://github.com/ tensorflow/fold/blob/master/tensorflow_fold/g3doc/sentiment.ipynb. +I. Mitliagkas, C. Zhang, S. Hadjis, and C. Re. Asynchrony begets momentum, with an application to deep ´ learning. arXiv preprint arXiv:1605.09774, 2016. +D. G. Murray, F. McSherry, M. Isard, R. Isaacs, P. Barham, and M. Abadi. Incremental, iterative data processing with timely dataflow. Commun. ACM, 59(10):75–83, Sept. 2016. ISSN 0001-0782. +G. Neubig, C. Dyer, Y. Goldberg, A. Matthews, W. Ammar, A. Anastasopoulos, M. Ballesteros, D. Chiang, D. Clothiaux, T. Cohn, et al. Dynet: The dynamic neural network toolkit. arXiv preprint arXiv:1701.03980, 2017a. +G. Neubig, Y. Goldberg, and C. Dyer. On-the-fly operation batching in dynamic computation graphs. arXiv preprint arXiv:1705.07860, 2017b. +J. Nothman, N. Ringland, W. Radford, T. Murphy, and J. R. Curran. Learning multilingual named entity recognition from wikipedia. Artificial Intelligence, 194:151–175, 2013. +PyTorch core team. PyTorch. URL http://pytorch.org/. +R. Ramakrishnan, P. O. Dral, M. Rupp, and O. A. von Lilienfeld. Quantum chemistry structures and properties of 134 kilo molecules. Scientific Data, 1, 2014. +B. Recht, C. Re, S. Wright, and F. Niu. Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In Advances in Neural Information Processing Systems, pages 693–701, 2011. +S. Reed and N. De Freitas. Neural programmer-interpreters. arXiv preprint arXiv:1511.06279, 2015. +L. Ruddigkeit, R. Van Deursen, L. C. Blum, and J.-L. Reymond. Enumeration of 166 billion organic small molecules in the chemical universe database gdb-17. Journal of chemical information and modeling, 52(11): 2864–2875, 2012. +F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini. The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61–80, 2009. +S. Semeniuta, A. Severyn, and E. Barth. Recurrent dropout without memory loss. arXiv preprint arXiv:1603.05118, 2016. +N. Shazeer, A. Mirhoseini, K. Maziarz, A. Davis, Q. Le, G. Hinton, and J. Dean. Outrageously large neural networks: The sparsely-gated mixture-of-experts layer. arXiv preprint arXiv:1701.06538, 2017. +R. Socher, C. C. Lin, C. Manning, and A. Y. Ng. Parsing natural scenes and natural language with recursive neural networks. In Proceedings of the 28th international conference on machine learning (ICML-11), pages 129–136, 2011. +R. Socher, A. Perelygin, J. Y. Wu, J. Chuang, C. D. Manning, A. Y. Ng, C. Potts, et al. Recursive deep models for semantic compositionality over a sentiment treebank. In Proceedings of the conference on empirical methods in natural language processing (EMNLP), volume 1631, page 1642, 2013. Dataset: https://nlp.stanford.edu/sentiment/treebank.html. +K. S. Tai, R. Socher, and C. D. Manning. Improved semantic representations from tree-structured long short-term memory networks. arXiv preprint arXiv:1503.00075, 2015. +S. Tokui, K. Oono, S. Hido, and J. Clayton. Chainer: a next-generation open source framework for deep learning. In Proceedings of workshop on machine learning systems (LearningSys) in the twenty-ninth annual conference on neural information processing systems (NIPS), 2015. + +# A AMPNET RUNTIME IMPLEMENTATION + +We have implemented an AMPNet runtime for multi-core CPUs. Our runtime spawns multiple workers each associated with a hardware thread and hosting one or more IR nodes – in a more general setting each worker corresponds to a compute device. To remain faithful to a distributed environment communication is only through message passing. Each worker is equipped with a multiple-producer single-consumer queue that can accept messages for any IR node hosted on that worker. + +The main worker loop periodically offloads messages from the concurrent queue to a worker-local priority queue that assigns higher priority to backward messages. Backward prioritization is designed for situations when multiple IR nodes with a dependency on the IR graph end up hosted on the same worker. As a consequence, backpropagation can complete faster and new instances can be pumped in by the controller. We dequeue the top message and invoke the forward or backward method of the target IR node. These methods may update internal IR node state (such as cache the state of the incoming message and wait for more messages) or post new forward or backward messages. + +How to update the parameters using the gradients is a configuration option that selects amongst a range of optimization algorithms. We have implemented runtime configuration options for selecting several well-known schemes such as (momentum-)SGD and Adam Kingma and Ba (2014), and for controlling the training hyper-parameters. + +# B DETAILS OF THE EXPERIMENTAL RESULTS + +We provide more details of the experiment and analysis in this section. All experiments were carried out on machines with 16 cores and 112 GB of RAM. The validation curves were averaged over at least 20 independent runs. The time/epoch to reach a target accuracy was calculated as median of the time an algorithm takes to reach the target accuracy over the repetitions. We found this approach to be more reliable than reporting the time/epoch when the averaged accuracy reaches the target. Table 2 shows both the training and validation throughputs we obtained with AMPNet and our TensorFlow baselines. + +# B.1 MNIST + +We train a 4-layer perceptron with ReLUs and 784-dimensional hidden units on MNIST (LeCun and Cortes, 1998). Both the AMP runtime and a TensorFlow baseline use SGD with learning rate 0.1 and batch size of 100. + +Figure 6(a) shows the validation accuracy vs. time, validation accuracy vs. epochs, and throughputs of synchronous and asynchronous versions of AMPNet as well as TensorFlow. The throughput greatly increases from synchronous (max active key $\mathfrak { s } = 1$ ) to asynchronous (max active key $s = 4$ ) while the speed of convergence (middle panel) is hardly affected for mild amount of asynchrony. Taking higher max active keys $= 8$ increase throughput only very little (because there is no more work) and seems to rather make the convergence more unstable. This is due to the fact that our current scheduler is greedy and pumps in a forward message whenever the first layer is unoccupied, which leads to large gradient staleness. Clearly a better scheduling will remove this sensitivity. + +# B.2 LIST REDUCTION DATASET + +We train a vanilla RNN to perform reduction operations on variable length lists of digits. Each training instance is a sequence of at most 10 tokens: The first token indicates which of 4 reduction operations 2 is to be performed, and the remaining tokens represent the list of digits. The output is the result of the calculation rounded modulo 10. The dataset consists of $1 0 ^ { 5 }$ training and $1 0 ^ { 4 }$ validation instances. + +We present this task as a classification problem to a vanilla RNN with ReLU activation and a hidden dimension of 128. All parameterized operations are affinitized on individual workers. We bucket training instances into batches of 100 sequences (in the baseline and in AMPNet). + +![](images/eef9ddeeba17a3a2c8c533667c6147d6a90efc0b4984c54160c37bc192ed5d3c.jpg) +Figure 6(b) shows the validation accuracy vs. time and the number of epochs, and throughputs of the methods we discussed in the main text on the list reduction dataset. We first notice that increasing the asynchrony from synchronous (max active key $\tt { 3 = } 1$ ) to max active key $ \textrm { s } = 4$ and max active keys $= 1 6$ affects the convergence very little at least in average. However, there + +![](images/72284ee41911113dff20759ede8d779a56a39d05d8a8ea74bd770e08d983f2f4.jpg) + +![](images/384dac4f026f5bd54a93a05e1e5522d9b18a335185869785c99e0132fddf2c6a.jpg) + +is also very little speedup without introducing replicas as we discussed in the main text. Increasing the number of replicas increases the throughput almost linearly from $1 3 \mathrm { k }$ sequences/s (synchronous) to 35k sequences/s (2 replicas) and over 70k sequences/s (4 replicas). Convergence is almost unaffected for 2 replicas. This was rather surprising because the parameters of the replicas are only synchronized after each epoch as we described in Sec. 5. A slight slow-down in convergence can be noticed for 4 replicas. Since even max active keys $= 1 6$ has almost no effect on the convergence without replicas, this is not due to asynchrony. We also tried to synchronize more frequently but this did not help. Thus we believe that the slow-down is due to the increase in the effective minibatch size resulting in reduced number of updates per epoch, which is commonly observed in data parallel training. + +![](images/807d41ca3470b0323dc9b32f9915103be995b92e029053f3c0a82a7b00aa78f1.jpg) +Figure 6: Convergence plots. + +Table 2: Training and validation throughputs. + +
number of instancesAMPTensorFlow
trainvalidmaktrain inst/svalid inst/strain inst/svalid inst/s
MNIST (97%)60k10k12076609458808037
4626818973
List reduction (97%)100k10k113k39k18k43k
416k55k
1616k56k
(2 replicas)435k100k
(4 replicas) Sentiment (82%)871k178k
8511110111022802651583
4188692
QM9 (4.6)16258822
117k13k130271012173218
410072585
1617974845
Wikiner (94 %)142k1.7k141101
486284
32130426
+ +# B.3 SENTIMENT TREE BANK DATASET + +We consider the sentiment classification dataset from Socher et al. (2013) consisting of binarized constituency parse trees of English sentences with sentiment labels at each node. Following Tai et al. Tai et al. (2015), we use 8,544 trees for training, 1,101 trees for validation, and 2,210 trees for testing. + +We use a Tree LSTM for this classification task based on the TensorFlow Fold Looks et al. (2017) benchmark model. Both the AMP and Fold models are trained following Tai et al. (2015) with the additional architectural modifications proposed by Looks et al. (2017); Semeniuta et al. (2016). Furthermore, we split our Tree-LSTM cell into Leaf LSTM and Branch LSTM cells. This does not affect the expressiveness of the model because the LSTM cell receives either zero input (on branch) or zero hidden states (on leaves); i.e., the two cells do not share weights except for the bias parameters, which are learned independently in our implementation. We compare the time to reach $82 \%$ fine grained (5 classes) accuracy (averaged over all the nodes) on the validation set. + +Figure 6(c) shows the averaged fine grained validation accuracy for the tree RNN model with different max active keyson the Stanford Sentiment Tree Bank dataset. Interestingly although TensorFlow Fold achieves higher throughput, AMPNet converges faster (in terms of the number of epochs). This speedup is mainly due to the fact that we are not batching and updating whenever we have accumulated 50 gradients (except for the lookup table node that updates every 1000 gradients); 50 gradients correspond to roughly 2 trees. The reason for the lower throughput compared to + +TensorFlow Fold is that we are only grouping the leaf operations and not the branch operations. Grouping the branch operations is possible by extending our IR nodes and we are actively working on it. + +Figure 6(d) shows the same information for fixed max active keys $\qquad = \quad 1 6$ and different min update interval. We can see that as we increase min update interval from the originally used 50 to larger values, the peak of the validation accuracy shifts later and lower becoming closer to the curve obtained by TensorFlow Fold. This is consistent with the parallels between min update interval and minibatch size we drew in Section 6. The min update interval parameter has marginal influence on the training throughput. + +# B.4 QM9 DATASET + +We study a real-world application for GNNs: prediction of organic molecule properties from structural formulae in the QM9 dataset Ruddigkeit et al. (2012); Ramakrishnan et al. (2014). GNNs have previously been applied to this task in Gilmer et al. (2017). + +We concentrate on prediction of the norm of a molecule’s dipole moment using a regression layer build on the propagation model from Li et al. (2015) (corresponding to the simplest setting in Gilmer et al. (2017)). We use a hidden dimension of 100 and 4 propagation steps, initializing the graph nodes (atoms) following Gilmer et al. (2017). The molecules contain up to 29 atoms and in a TensorFlow baseline we bucket molecules into batches of 20 with atom counts differing by at most 1 within a batch. Following Gilmer et al. (2017), we report regression accuracies in multiples of a target accuracy from the chemistry community. + +Figure 6(e) shows that GGNN can tolerate relatively large max active key $s = 1 6$ , and increased the throughput significantly from 300 graphs/s (synchronous) to 1797 graphs/s (see Table 2). + +# B.5 WIKINER DATASET + +We compare the performance of AMP training with DyNet with and without autobatching using the BiLSTM tagger w/ char model from the DyNet benchmark suite3. This model consists of both character-level and word-level bidirectional LSTMs. The model uses a learnable word embedding for frequent words (more than 5 times in the corpus) and character-level bidirectional LSTMs for infrequent words. We use our Distribute and Collect nodes to dynamically route the messages depending on the word frequencies. + +Wikiner dataset4 is a named entity recognition dataset extracted from Wikipedia by Nothman et al. (2013). We use the training/validation split provided by the DyNet benchmark suite with 142,153 and 1,696 sentences, respectively. + +The result is shown in Fig. 6(f). We achieve more than $3 \mathbf { x }$ in throughput from max active keys $=$ 1 to max active key $s = 3 2$ without any noticeable loss in the validation accuracy after 2 or 3 epochs. The slight decrease in the validation accuracy after the third epoch is due to overfitting and it is not related to asynchrony. + +# C THROUGHPUT ESTIMATION FOR A HYPOTHETICAL 1 TFLOPS DEVICE + +In order to estimate the performance of AMPNet on a hypothetical device with 1 TFLOPS compute capability, we replaced all fully connected layers in the network with a dummy operation that simply waits for a specified time. The dummy operation waits for $2 \cdot k \cdot d _ { \mathrm { i n } } \cdot d _ { \mathrm { o u t } } \cdot 1 0 ^ { - 1 2 }$ seconds when the input is $k \times d _ { \mathrm { i n } }$ and the weight matrix is $d _ { \mathrm { i n } } \times d _ { \mathrm { o u t } }$ for forward, backward, and gradient accumulation operation. It waits for $d _ { \mathrm { i n } } \cdot \dot { d } _ { \mathrm { o u t } } \cdot 1 0 ^ { - 1 2 }$ seconds for weight update. In this way we can maintain all the data-dependent control decisions (e.g., sequence length) identical to the original network and also measure the real time spent for all the other operations. In order to calculate the time to reach target accuracy, we take the median number of epochs the original network required to reach the target + +accuracy and calculate the time as + +$$ +\mathrm { \Delta t \ i m e = e p o c h s \cdot \left( \frac { { n _ { \mathrm { t r a i n } } } } { t h r o u g h p u t _ { \mathrm { t r a i n } } } + \frac { { n _ { \mathrm { v a l } } } } { t h r o u g h p u t _ { \mathrm { v a l } } } \right) , } +$$ + +where $n _ { \mathrm { t r a i n } }$ and $n _ { \mathrm { v a l } }$ are the number of training and validation instances, respectively, and throughput $\operatorname { t r a i n }$ and throughput $\mathrm { v a l }$ are the throughput for training and validation, respectively. + +The results are shown in Table 3. For the 4-way replicated RNN, we estimate roughly 260k instances/s, which is a $3 . 7 \mathbf { x }$ speedup compared to our CPU runtime. For tree RNN and GGSNN, we estimate milder $30 - 7 0 \%$ speedups mainly due to the fact that they have more complicated operations like Distribute and Collect, which we did not attempt to extrapolate the computation time because the implementation on a new hardware may be drastically different from the current CPU runtime. + +Table 3: Estimated time to convergence to target validation accuracy and training throughput with a hypothetical 1 TFLOPS device. mak is a short-hand for max active keys defined in Sec. 3; $\mathrm { m a k } = 1$ corresponds to synchronous training for MNIST and minimal asynchrony arising from just one in-flight instance for other models with recursive structures. + +
AMP1 TFLOPS (estimated)
targetaccuracymaktime (s)epochsinst/stime (s)inst/s
List reduction97%1781013k
(4 replicas) Sentiment8211371k5.15268k
82%11852102
16104325860.6440
QM94.616522776.5179738272455
\ No newline at end of file diff --git a/parse/train/HJnQJXbC-/HJnQJXbC-_content_list.json b/parse/train/HJnQJXbC-/HJnQJXbC-_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..06b561aab9700a4dcede0087598942180b83f1c3 --- /dev/null +++ b/parse/train/HJnQJXbC-/HJnQJXbC-_content_list.json @@ -0,0 +1,1300 @@ +[ + { + "type": "text", + "text": "AMPNET: ASYNCHRONOUS MODEL-PARALLEL TRAINING FOR DYNAMIC NEURAL NETWORKS ", + "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": "New types of compute hardware in development and entering the market hold the promise of revolutionizing deep learning in a manner as profound as GPUs. However, existing software frameworks and training algorithms for deep learning have yet to evolve to fully leverage the capability of the new wave of silicon. In particular, models that exploit structured input via complex and instance-dependent control flow are difficult to accelerate using existing algorithms and hardware that typically rely on minibatching. We present an asynchronous model-parallel (AMP) training algorithm that is specifically motivated by training on networks of interconnected devices. Through an implementation on multi-core CPUs, we show that AMP training converges to the same accuracy as conventional synchronous training algorithms in a similar number of epochs, but utilizes the available hardware more efficiently, even for small minibatch sizes, resulting in shorter overall training times. Our framework opens the door for scaling up a new class of deep learning models that cannot be efficiently trained today. ", + "bbox": [ + 233, + 267, + 766, + 462 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 489, + 336, + 506 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "An emerging category of neural networks show the common trait of reacting in dynamic and unique ways to properties of their input. Networks like tree-structured recursive neural networks (Socher et al., 2013; Tai et al., 2015) and graph neural networks (GNNs) (Scarselli et al., 2009; Li et al., 2015; Gilmer et al., 2017) take structured data types as input and and execute a computation that depends on the input structure. This defies the moden GPU-driven paradigm of minibatch-based processing, and we refer to this new class of models with dynamic control flow as dynamic neural networks. ", + "bbox": [ + 174, + 522, + 825, + 606 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The development of dynamic neural network frameworks – Chainer (Tokui et al., 2015), DyNet (Neubig et al., 2017a), and PyTorch (PyTorch core team) – speaks to the importance of this class of models and highlights the challenge of how to make it easy for users to describe them. Yet there is another big challenge: how can we train these models efficiently? ", + "bbox": [ + 174, + 613, + 825, + 669 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Managing minibatches to keep GPUs fully utilized is typically considered a user’s responsibility in these dynamic frameworks (with the exception of DyNet’s autobatching feature; see Sec. 7). This means that users have to think about how to change their data feeding pipeline or even the model itself to run efficiently on GPUs, rather spending time innovating to improve the model accuracy. ", + "bbox": [ + 174, + 675, + 825, + 732 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "What if we had a hypothetical device with low memory overhead that allows perfect scaling without batching; i.e., processing 1 item is simply $1 0 0 \\mathrm { x }$ faster than processing 100 items? Recent work on FPGAs and other specialized hardware (Farabet et al., 2011; Caulfield et al., 2016; Jouppi et al., 2017) for deep learning encourages us to investigate this question. Our premises are ", + "bbox": [ + 176, + 738, + 825, + 795 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1. No batching is required for efficient processing. 2. Each device may not have enough memory to hold the entire model (this is a realistic constraint for current memory systems that approach the perfect scaling we require) ", + "bbox": [ + 202, + 808, + 823, + 856 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Based on these premises, we propose an asynchronous model-parallel (AMP) training algorithm. Our idea is illustrated in Figure 1. We need model parallelism because each device may be too small to hold the entire model (premise 2). However, if we perform synchronous parameter updates following the full forward and backward propagations, the only way to increase device utilization is by pipelining multiple instances into the system (see e.g., Chen et al., 2012). Pipeline parallelism with synchronous updates is at odds with convergence speed due to a decreased parameter update frequency; compare Fig. 1 (a) and (b). ", + "bbox": [ + 176, + 868, + 825, + 924 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/7852ac9eac92bbdd64cbafe7eac5fba75ec33dbe3ccd6ef94eaaffd20d2bb990.jpg", + "image_caption": [ + "Figure 1: Gantt charts comparing pipelined synchronous model parallelism and asynchronous model parallelism. Orange, blue, and yellow boxes correspond to forward, backward, and parameter update operations, respectively. The numbers in the boxes indicate instance IDs. " + ], + "image_footnote": [], + "bbox": [ + 171, + 98, + 816, + 205 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 309, + 825, + 351 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To overcome this problem, we propose asynchronous parameter updates that occur without global synchronization whenever a pre-specified number of gradients have been accumulated; see Fig. 1 (c). With this design we aim for both high device utilization and update frequency. ", + "bbox": [ + 174, + 358, + 825, + 400 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this setting, however, model parameters may be updated between the forward and the backward computation of an instance, introducing gradient “staleness”. Despite staleness, we show that AMP training can converge fast with good hardware utilization. Specifically, our contributions are: ", + "bbox": [ + 176, + 406, + 825, + 449 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• We present the asynchronous model parallel training algorithm for efficient distributed training of dynamic networks. We present an intermediate representation (IR) with explicit constructs for branching and joining control flow that supports AMP training. Unlike previous work that considers static computation graphs for static control flow (e.g., Caffe), and dynamic computation graphs for dynamic control flow (e.g., Chainer), our IR encodes a static computation graph to execute dynamic control flow1. This makes training easy to distribute and parallelize. We show that our IR can readily encode replicas, a form of data parallelism (see Sec. 5). In addition, our IR includes operators for data aggregation, which recover a form of batching, enabling our methods to be applied even on hardware where batching is beneficial. • We implement AMP training on a multi-core CPU and empirically demonstrate that AMP training converges to similar accuracies as synchronous algorithms on a variety of dynamic neural network models including Tree RNN and gated graph neural networks (GGNN). ", + "bbox": [ + 215, + 462, + 825, + 665 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In summary, our work demonstrates the benefits of AMP training and gives a novel way to design and deploy neural network libraries with dynamic control flow. In addition, we use our implementation to estimate the performance on a hypothetical device satisfying premises 1 & 2, with 1TFLOPS compute capability (see Appendix C). Together, these contributions open up new ways to scale up dynamic networks on interconnected compute devices. ", + "bbox": [ + 174, + 678, + 825, + 747 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 NEURAL NETWORKS WITH DYNAMIC CONTROL FLOW ", + "text_level": 1, + "bbox": [ + 176, + 772, + 647, + 786 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Below we highlight three models with dynamic control flow that will be studied in depth in this paper: ", + "bbox": [ + 171, + 803, + 825, + 818 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Variable-length RNNs iterate over the tokens of variable-length sequences. Pseudo-code for a simple vanilla RNN is given in Figure 2. The linear (fully connected) layer and rectified linear unit (ReLU) can be substituted with a more sophisticated unit such as a gated recurrent unit (Chung et al., 2014). Though each instance has a different length, it is possible to add padding to enable batching. However this may lead to significant redundant compute due to variability in sequence lengths. ", + "bbox": [ + 174, + 825, + 826, + 895 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/217149a2d1737896fff3ba084e656184671f3a0db8cb74837b1d30ac15635f63.jpg", + "image_caption": [ + "Figure 2: Variable-length RNN in IR and pseudocode (colors denote IR node types) " + ], + "image_footnote": [], + "bbox": [ + 251, + 101, + 743, + 273 + ], + "page_idx": 2 + }, + { + "type": "table", + "img_path": "images/324147a02a4a76163a46afa798988ef82d657efd69e7002117e16b7b1816e5d3.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Algorithm 1 Asynchronous Model-Parallel training
while training not done do
for all workers in parallel do
Wait until a message arrives
msg ←the highest priority message from the input queue
op ← sink node of the message msg
if msg is forward type then Compute forward: out_msgs ← op(msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the child nodes.
else if msg is backward type then
Compute backward: out_msgs ← op*(msg,fwd_msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the parent nodes.
else if msg isupdate type then
Perform parameter updates on op
end if
end for
end while
", + "bbox": [ + 173, + 324, + 797, + 547 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Tree-structured neural networks are powerful models used for parsing of natural language and images, semantic representation, and sentiment analysis (Socher et al., 2011; Bowman et al., 2016; Socher et al., 2013; Tai et al., 2015). They require evaluation of (potentially multiple) trees with shared parameters but different topology for each instance. Each tree structure is instance-specific and batching requires nontrivial planning (Looks et al., 2017). A simple form of tree neural network performs a bottom up traversal of the instance, starting from an embedding of the leaves. At each level the values from the child nodes are concatenated and sent through a specialized unit (e.g. LSTM). The result is then propagated further up the tree. Backpropagation over the tree structure is known as backpropagation through structure (Goller and Kuchler, 1996). ", + "bbox": [ + 173, + 575, + 825, + 700 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Graph neural networks (Scarselli et al., 2009; Li et al., 2015; Gilmer et al., 2017) combine both the temporal recurrence and recurrence over the structure. GNNs can be seen as performing aggregation/distribution operations over a general graph structure with shared parameters. ", + "bbox": [ + 174, + 707, + 825, + 750 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Apart from the models above, there exist many recently proposed models with flexible control flow (e.g. hierarchical memory networks (Chandar et al., 2016), neural programmer interpreters (Reed and De Freitas, 2015), adaptive computation networks (Graves, 2016; Figurnov et al., 2016), and sparsely-gated mixture of experts (Shazeer et al., 2017), to which our framework can be applied. ", + "bbox": [ + 174, + 756, + 825, + 813 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 ASYNCHRONOUS MODEL-PARALLEL TRAINING ", + "text_level": 1, + "bbox": [ + 176, + 837, + 596, + 852 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In AMP training, each node of a computation graph (including control flow nodes – see next section) is associated with a worker, which is an abstraction of a compute device. Neural network training and inference is carried out by message passing among workers following algorithm 1. All workers run in parallel without synchronization. Each message contains a payload (float or int tensor), as well as a state that includes the IDs of the source and sink nodes and a label indicating the type of message (forward, backward, or update). The state is used to keep track of algorithm and control flow information. For example, in a variable-length RNN the state also contains the instance identifier, the current position in the sequence, and the total sequence length for the instance. More generally, if the neural model use (possibly nested) loops, then the state for the messages that arrive to and are produced from nodes that logically belong in loop bodies will contain sets of loop counters that together with the instance id uniquely identify the messages throughout the course of the computation. ", + "bbox": [ + 174, + 867, + 825, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 202 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "When a worker receives a message labeled as forward (or backward) then it performs the operation of the node indicated by the sink node ID on the supplied payload. This produces one or more outgoing messages that are then enqueued into the queues of the workers hosting the next sink nodes in the computation graph. The final loss layer initiates backward propagation. If the message type is update, the worker will carry out weight updates on the sink node using gradients accumulated in the appropriate slot in the worker’s local memory. Since both the operation weights and weight gradients can be stored locally on the worker then workers only need to communicate activations and activation gradients, which are typically an order of magnitude smaller than the weights. The update message is typically sent from the sink node to itself as part of the backward process but it can also be sent from a controller node to simulate synchronous pipelined training. ", + "bbox": [ + 174, + 208, + 825, + 347 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "There are two important details that are not fully spelled out in Algorithm 1. First, since the messages arrive asynchronously (and possibly out of order), any operation that has more than one parent nodes need to store the payload into its local cache until all the parents send the corresponding payloads. Thus output message(s) can only be produced when all the payloads become available. The cache needs to be able to distinguish payloads received from different parents and payloads with different instance ID, and different counters (all encoded in the message states). The same is true in the backward pass for a node with multiple child nodes. Second, ${ \\tt o p } ^ { * }$ denotes the adjoint operation of op and takes the backward message msg and potentially the forward message fwd msg stored in the cache. For a nonlinear activation node (e.g., ReLU), the node will not change the state of the message in the forward pass. Thus in the backward pass, the adjoint operation will just multiply the partial derivative of the activation function to the payload of the received backward message keeping the state unchanged. By contrast, an operation that only changes the state of the message in the forward pass (e.g., increment the loop counter) will reverse the change in the backward pass leaving the payload unchanged. ", + "bbox": [ + 174, + 354, + 825, + 549 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In the experiments we vary two hyper parameters to control the effect of asynchrony: ", + "bbox": [ + 178, + 555, + 728, + 570 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "min update interval: determines the minimum number of gradients that a parameterized operation needs to accumulate before it can update its parameters (using the update message). The staleness of a gradient can be measured by the number of updates between the forward and backward computation that produces the gradient. Small min update interval may increase gradient staleness. On the other hand, large min update interval can reduce the variance of the gradient but can result in very infrequent updates and also slow down convergence. ", + "bbox": [ + 174, + 577, + 825, + 660 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "max active keys: controls the maximum number of active instances that are in-flight at any point in time. By setting max active key $\\mathbf { \\boldsymbol { s } } = 1$ we restrict to single-instance processing, typically equivalent to synchronous training. More in-flight messages generally increase hardware utilization, but may also increase gradient staleness. Section 6 demonstrates the effects of these parameters in a multi-core CPU runtime. ", + "bbox": [ + 174, + 667, + 825, + 737 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 WORKER AFFINITY ", + "text_level": 1, + "bbox": [ + 176, + 767, + 348, + 781 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In our asynchronous execution model, the optimal assignment of $N$ neural network computation graph nodes to $W$ workers (referred to as affinitization) is in general a non-trivial scheduling problem. We investigated several heuristics for assigning affinities (for example $\\mathbf { k }$ -hop coloring (Ichrak et al., 2012) to ensure subsequent heavy operations were assigned different workers). However, we find that the following procedure achieves high performance in practice in our multi-core CPU implementation, and is adopted throughout our experiments for simplicity. We first partition the nodes into $H$ ’heavy’ operations (namely matrix multiplies) and $( N - H )$ ’light’ operations, and then balance the heavy nodes across the workers by affinitizing the $h ^ { \\mathrm { t h } }$ with the $( h \\mod W ) ^ { \\mathrm { t h } }$ worker. Finally, the light operations are affinitized randomly among the rest of the workers. Note that in scenarios where communication is over a physical network affinitization will become more critical for high performance. ", + "bbox": [ + 174, + 797, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/05546d60c49a3bb63bc9a2abaa8d81d264c7b6f479acb7c5ca1109ff70b82680.jpg", + "image_caption": [ + "Figure 3: Distribution based on dynamic information " + ], + "image_footnote": [], + "bbox": [ + 284, + 102, + 712, + 241 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 304, + 823, + 333 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 A STATIC INTERMEDIATE REPRESENTATION FOR DYNAMIC CONTROL FLOW ", + "text_level": 1, + "bbox": [ + 173, + 358, + 821, + 373 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Overview Computation graphs are expressed using a static intermediate representation (IR) that can be a compilation target for high-level libraries (e.g. TensorFlow or our own Python and $\\mathrm { C } { + + }$ frontends), and can itself admit multiple backends (e.g. the multi-core CPU runtime in this paper, or a network of accelerators). Static means that the IR graph is instance-independent. Nevertheless, it can execute dynamic and instance-dependent control flow decisions, in a forward and backward manner, by storing instance- and iteration-dependent information as the computation evolves. Each IR node comes with a forward and a backward semantics. A model is specified by (i) an IR graph, and (ii) a specialized controller loop that pumps instances and other data (e.g. initial hidden states or labels), and is responsible for throttling asynchrony. In the rest of this section we discuss the most important IR nodes along with their operational semantics, and show how they are used in the example models. ", + "bbox": [ + 173, + 390, + 825, + 530 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Payload transformations Parameterized payload transform (PPT) nodes can be used to encode, for instance, fully connected layers. They apply a transform in the forward pass, but also record the activation in order to use it to compute gradients in the backward pass. An activation is recorded by keying on the state of the message, allowing thus to process forward and backwards messages completely asynchronously, and – in the extreme case – out of order. A PPT node requires specification of the forward and the backward transformation. It may decide to independently apply accumulated gradients to update its parameters. For transformations that do not involve parameters (e.g. ReLUs) our IR offers a simpler non-parameterized payload transform. ", + "bbox": [ + 174, + 549, + 826, + 661 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Loops, state, and control flow A condition node (Cond $f$ ) is parameterized by a function $f$ that queries the state (but not the payload) of the incoming message and, based on the response, routes the input to one of the successor nodes. A join node (Phi) propagates the messages it receives from each of its ancestor nodes but records the origin (using the state of the message as the key) so that in the backward pass it can backpropagate them to the correct origin. An invertible state update node $( \\mathtt { I s u } \\ f \\ f ^ { - 1 } )$ is parameterized by two functions $f$ and $f ^ { - 1 }$ that operate on the state of a message, and satisfy $\\bar { f } ^ { - 1 } ( f ( \\bar { x } ) ) = x$ . Typically these are loop counter update functions. ", + "bbox": [ + 173, + 680, + 825, + 779 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Figure 2 shows how to encode an RNN. The loop at the heart of the RNN is implemented with Cond, Phi and Isu nodes. The controller pumps sequences in a lookup table (just another PPT layer), and our Ungroup node (to be described in the next section) generates a stream of tensors each corresponding to a single token, tagged with the current time-step (loop counter). For each forward message, the Isu node increments the time-step, and the conditional node tests whether the end of the sequence has been reached. Depending on the answer it either propagates the hidden state back to Phi, or pushes the hidden state to the final linear and loss layers. In backward mode, messages pass through the Isu (which decrements the time-step), and reach the Phi node. The Phi node will (based on information from the forward phase) either back-propagate to the Cond node, or to the controller to terminate. Hence the loop is executed in both the forward and backward direction. ", + "bbox": [ + 173, + 784, + 825, + 924 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/09f7aa446951696f32af43edccbcf5dc7b775fea5217c39a8ac79143df2a7033.jpg", + "image_caption": [ + "Figure 4: IR graphs for (a) Gated Graph Neural Network and (b) RNN-with-replicas. The RNNCell in (a) denotes a recurrent structure (e.g. GRU, LSTM), the details of which we omit. Cond modId in (b) implements a round-robin branching to different replicas by computing (instance ID mod 3). " + ], + "image_footnote": [], + "bbox": [ + 178, + 108, + 772, + 285 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Aggregation and disaggregation Our IR offers several constructs for aggregation and disagreggation; for example RNN requires us to concatenate (Concat) hidden states and embeddings with matching timesteps and instance ids (states). We offer a construct for broadcasting (Bcast) a message to multiple successors. We offer an ungrouping construct (Ungroup) that ungroups a matrix and emits all resulting messages tagged with an extra user-provided increasing loop counter. This allows us to insert the stream of token embeddings in the middle of the RNN loop in Figure 2. In backward mode Ungroup groups back all the incoming gradients. A simpler variant of Ungroup is Replicate, which replicates a message with an extra loop counter in the state. In backwards mode Replicate sums up all incoming gradients that correspond to the state without the extra loop counter. ", + "bbox": [ + 174, + 368, + 825, + 494 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Figure 4(a) describes a GNN that combines aggregation on the structure of a graph instance with an outer loop. The controller pumps data that contain the feature embeddings of all nodes of an input graph. In addition it pumps in a map specifiying graph topology. The Distribute node uses that information along with the graph itself to create sub-matrices (here each corresponding to edge types) and pass them through linear (fully connected) layers. The Collect node collects and re-groups the results based on graph topology. These nodes correspond to a form of dynamic partition and merging. Schematically the Distribute behaviour is given in Figure 3. In backward mode, based on the control information received during the forward pass (gray line) re-groups the gradients and sums together those that correspond to the same index. The Collect operator is essentially symmetric. ", + "bbox": [ + 174, + 501, + 825, + 626 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "5 DATA PARALLELISM IN MODEL PARALLELISM ", + "text_level": 1, + "bbox": [ + 174, + 647, + 584, + 661 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Pipelined model parallelism can often be augmented with forms of data parallelism. Consider the RNN in Fig. 2. The only heavy operation (Linear-1) in the body of the loop will act as a bottleneck for computation. One solution is to split the linear layer into smaller tiles and compute them in parallel. This is expressible in our IR but the linear operation needs to be large enough to benefit from tiling in this way. Another approach is to replicate the linear layer in full. This requires only minimal new machinery – we can replicate the linear layer and place the replicas inside Cond and Phi nodes as in Figure 4(b). Different instances or messages from the same instance but with different position in the sequence can be processed in an (pipeline-)parallel fashion by being sent to one of the replicas chosen by a random or deterministic function of the message state. To enable parameters to be shared among the replicas, we use infrequent end-of-epoch replica synchronization (averaging) that incurs negligible communication cost. We also tried more elaborate message-passing protocols for group synchronization, but found that infrequent global synchronization was sufficient for fast convergence. ", + "bbox": [ + 173, + 678, + 825, + 843 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "6 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 864, + 326, + 880 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We evaluate AMPNet using the dynamic models introduced in Section 2. For completeness, we additionally consider a multi-layer perceptron (MLP) as an example of a static, batched network ", + "bbox": [ + 174, + 895, + 823, + 924 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/61b96a9172c549ef7fac0f812fcfd89bc724c88ddab6413e94a05f94193bdbdb.jpg", + "table_caption": [ + "that AMPNet is not specifically designed to tackle. Brief details of the models and data sets in the experiments are presented below, and further details are given in Appendix B. " + ], + "table_footnote": [], + "table_body": "
ModelData setDifficultyExperiment purpose
MLPMNISTtoyThe standard deep learning bench- mark (for which AMPNet is not
RNNList reductiontoyspecifically designed) The simplest architecture with dy-
Tree-LSTMStanford Sentiment Treebankreal-worldnamic control flow (a for loop) The TensorFlow Fold benchmark for
GNNQM9real-worldbackpropagation through structure Complex control flow with loops over time and structure
", + "bbox": [ + 174, + 137, + 825, + 295 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Results Our asynchronous runtime is motivated by the promise of emerging hardware (e.g. FPGA accelerators) that fulfill the premises in section 1 and are well suited to dynamic neural network execution. Here we are primarily interested in how the performance of our runtime improves as we increase the degree of asynchrony (by varying max active keys) while keeping other factors fixed. The aim is to answer the question of whether AMP training is a promising direction for novel distributed hardware that deviates from the CPU/GPU batching paradigm. To answer this question using resources available today we run the AMPNet training using a multi-core CPU runtime where each worker is a hardware thread (see Appendix A). Additionally we forecast the performance on a hypothetical 1TFLOPS device satisfying our premises by replacing all computation nodes by configurable sleep nodes. This allows us to estimate the performance on a new hardware keeping the control flow decisions dynamic. See Appendix C. ", + "bbox": [ + 173, + 320, + 825, + 474 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "It is also interesting to compare how the raw CPU performance of the AMP runtime compares with existing frameworks (TensorFlow, TensorFlow Fold and DyNet) to see that our implementation is already competitive with state of the art methods even on CPUs that do not conform to our target hardware model. We provide additional analysis for each experiment below. ", + "bbox": [ + 174, + 481, + 825, + 536 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "On MNIST, Table 1 shows $_ { 3 \\mathrm { X } }$ speedup from synchrony (max active keys $: = 1$ ) to asynchrony (max active key $s = 4$ ) in terms of throughput. This is almost ideal as the first three linear layers are the heaviest operations. The number of epochs to reach the target validation accuracy increases from 3 to 4 but the overall speedup in terms of the wall clock time is $2 . 2 \\mathbf { x }$ . We have also compared AMP training against pipeline parallel training (Fig. 1 (b)). Figure 5(a) shows that while AMP training achieves 3x throughput gain already with $\\mathtt { m a x \\mathrm { _ { - } a c t i v e \\mathrm { _ { - } k e y s = 4 } } }$ , pipeline parallelism can only achieve $2 \\mathbf { x }$ (in fact from Fig. 1 (b), $3 m / ( m + 2 )$ is the best case for max active key $s = m$ ) ", + "bbox": [ + 173, + 542, + 825, + 642 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/b36b62f595db551df610919c01f9c46efec1e65e97f68e88b14659169967f9a9.jpg", + "table_caption": [ + "Table 1: Time to convergence to target validation accuracy. The time to convergence can be broken down into number of epochs and the throughput (instances/s). The target accuracy is shown inside parentheses next to each dataset. mak is a short-hand for max active keys defined in Sec. 3; $\\mathrm { m a k } = 1$ corresponds to synchronous training for MNIST and minimal asynchrony arising from just one in-flight instance for other models with recursive structures. " + ], + "table_footnote": [], + "table_body": "
AMPTensorFlow
maktime (s)epochsinst/stime (s)epochsinst/s
MNIST (97%)191.13207634.535880
440.4 (2.2x)46268
List reduction (97%)1781013k46718k
466 (1.2x)10.516k
1660 (1.3x)9.516k
(2 replicas)438(2x)1235k
(4 replicas)821 (3.8x)1371k
Sentiment (82%)118521022085265
882 (2.3x)2222
16104 (1.8x)3258
QM9 (4.6)4N/AN/A9886696661217
16522776.51797
", + "bbox": [ + 204, + 757, + 794, + 940 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/05af97a8258c4fd509b6b362b27a58a6b87d9eab74790a022c39a54270e8b031.jpg", + "image_caption": [ + "(a) Comparison against pipeline parallelism (Fig. 1 (b)) (b) Performance of an 8-replica RNN model on the list reducfor 4-layer MLP on MNIST. tion dataset as a function of asynchrony hyperparameters. ", + "Figure 5: Throughput-convergence trade-off as a function of mode of parallelism and asynchrony hyper-parameters. Solid gray lines show constant convergence time trajectories; mak and mui stand for max active keys and min update interval, respectively. " + ], + "image_footnote": [], + "bbox": [ + 176, + 111, + 828, + 287 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "and higher throughput at max active keys $= 8$ is achieved at the cost of the sharp increase in the number of epochs to convergence. ", + "bbox": [ + 174, + 410, + 823, + 438 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The list reduction dataset demonstrates the power of replicas. As there is only one heavy operation (Linear-1, Figure 2), the speedup from asynchrony is mild (1.3x). However we get $2 . 5 \\mathrm { x }$ and $3 . 5 \\mathrm { x }$ speedup for 2 and 4 replicas, respectively, which is nearly ideal. Again, the # of epochs to convergence is not affected by increasing max active keys. The slowdown in convergence for 4 replicas is due to the increased effective minibatch size – also commonly observed in data parallel training. ", + "bbox": [ + 174, + 445, + 825, + 515 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Next the sentiment tree-RNN dataset shows that our runtime is competitive without batching to TensorFlow Fold (Looks et al., 2017) using dynamic batching of batch size 100. It is worth mentioning that our runtime allows us to specify different min update interval parameter for each parameterized operation. We set this parameter to 1000 for the embedding layer, which is initialized by Glove vectors, and 50 for all other layers. This reduced gradient staleness in the embedding layer. ", + "bbox": [ + 174, + 521, + 825, + 592 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The QM9 dataset demonstrates that increasing asynchrony helps on real-world tasks with complex control flow, and our method outperforms an efficient TensorFlow implementation on CPUs. ", + "bbox": [ + 176, + 598, + 823, + 626 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Finally, we have implemented the BiLSTM w/ char model in Neubig et al. (2017b) on Wikiner dataset Nothman et al. (2013). Our preliminary implementation without any batching achieves 130 sentences/s at max active keys $= 3 2$ without any noticeable loss in accuracy (around $94 \\%$ after one epoch). This is competitive with DyNet’s performance on the same machine (23 sentences/s without and 220 with autobatching, respectively); See Sec. B.5 for details. ", + "bbox": [ + 174, + 633, + 825, + 704 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Asynchrony Finally we provide additional analysis on the effect of asynchrony. The degree of asynchrony is controlled by hyperparameters min update interval and max active keys. In Fig. 5(b) we use an 8-replica RNN model on the list reduction dataset to investigate how these parameters affect the data and time required to converge to $96 \\%$ validation accuracy. We find, in analogy with minibatch size in traditional systems, that min update interval must neither be too large nor too small. Increasing max active keys (increasing asynchrony) monotonically increases performance when the number of keys is similar to the number of individually affinitized heavy operations in the model 8 in this case). Increasing max active keys significantly beyond this point produces diminishing returns. ", + "bbox": [ + 174, + 718, + 826, + 844 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "7 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 863, + 344, + 880 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "One approach to the task of training networks with instance dependent control flow is to define the computation graph dynamically per-instance. This approach is taken in Chainer (Tokui et al., ", + "bbox": [ + 174, + 895, + 823, + 924 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "2015), DyNet (Neubig et al., 2017a), and PyTorch (PyTorch core team). There are key challenges in accelerating this approach: Model parallelism would require the dynamically generated computation graph to be scheduled on-the-fly, and BLAS level parallelism would require operations to be batched on-the-fly. Automatic dynamic batching has been implemented in DyNet (Neubig et al., 2017a), and is an interesting alternative to our asynchronous execution. Similar methods are used in TensorFlow Fold (Looks et al., 2017). The basic idea is to inspect and merge together (by depth) the unrolled computation graphs of several instances to create batched BLAS operations. The effectiveness of automatic batching greatly depends on the model – for example, it would not perform well on random permutations of a sequence of operations. By contrast, our IR would very succinctly express and achieve pipeline parallelism using a static computation graph that is easy to distribute and optimize. ", + "bbox": [ + 174, + 103, + 825, + 242 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Theano (Al-Rfou et al., 2016) and TensorFlow (TF)(Abadi et al., 2016) can syntactically handle instance dependent control flow with abstractions for conditional execution (ifelse in Theano and cond in TF) and loops (scan and while loop, respectively); TF also provides higher-order functions, such as map, foldl, foldr, and scan. The main difference between AMPNet and the above frameworks is that AMPNet is streaming and asynchronous whereas Theano is non-streaming and synchronous. Although not designed for streaming, TF can support streaming programmatically as it exposes first-class queues, as well as data prefetching with so called input pipelines. In our IR, all the queuing is implicit and stream-based execution is the default. TF additionally does support static description of dynamic control flow and state update, but we depart from the classic dataflow architecture that TF follows (Arvind and Culler, 1986): First, instead of having nodes that represent mutable reference cells, we encapsulate the state with which a message should be processed through the graph in the message itself. Second, because we encapsulate algorithmic state in the messages, we do not introduce the notion of control dependencies (which can be used to impose a specific execution order on TF operations). Our choices complicate algorithmic state management from a programming point of view and make the task of designing a high-level compiler non-trivial, but allow every node to run asynchronously and independently without a scheduler and without the need for control messages: For example, nodes that dynamically take a control flow path or split the data simply consult the state of the incoming message, instead of having to accept additional control inputs. For “small” states (e.g. nested loop counters or edge and node ids) this might be preferable than out-of-band signaling. Our IR can implement loops by simply using state-update, conditional, and phi nodes, because the state accompanies the payload throughout its lifetime, whereas TF introduces specialized operators from timely dataflow (Murray et al., 2016) to achieve the same effect. ", + "bbox": [ + 174, + 248, + 825, + 554 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Asynchronous data parallel training (Recht et al., 2011; Dean et al., 2012; Chilimbi et al., 2014) is another popular approach to scale out optimization by removing synchronization (orthogonal to and combinable with model-parallel training). For example, convolutional layers are more amenable to data-parallel training than fully connected layers, because the weights are smaller than the activations. Moreover, when control flow differs per data instance, data parallelism is one way to get an effective minibatch size $> 1$ , which may improve convergence by reducing variance. The impact of staleness on convergence (Recht et al., 2011) and optimization dynamics (Mitliagkas et al., 2016) have been studied for data parallelism. It would be interesting to extend those results to our setting. ", + "bbox": [ + 174, + 560, + 825, + 672 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Jaderberg et al. (2016), like us, aim to to train different parts of a model in a decoupled or asynchronous manner. More precisely, their goal is to approximate a gradient with a synthetic gradient computed by a small neural network that is locally attached to each layer. Hence, the local gradient calculation becomes independent of other layers (except for the training of the gradient predictor network) and allows asynchronous parameter updates. This would be especially useful if the evaluation of the local network is cheaper than the computation of the real gradient; for example, if the computation of the real gradient required significant communication of forward/backward messages between devices. ", + "bbox": [ + 174, + 679, + 825, + 777 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "8 CONCLUSION AND OUTLOOK ", + "text_level": 1, + "bbox": [ + 176, + 804, + 449, + 820 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We have presented an asynchronous model-parallel SGD algorithm for distributed neural network training. We have described an IR and multi-core CPU runtime for models with irregular and/or instance-dependent control flow. Looking forward, we aim to deploy our system on specialized hardware. Equally importantly, we plan to build a compiler that automatically deduces the information to be placed in the states and generates state keying functions from a higher-level description of the models. By unlocking scalable distributed training of dynamic models, we hope to enable exploration of this class of models that are currently only on the horizon but may become more mainstream in the future. ", + "bbox": [ + 174, + 839, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 825, + 132 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "REFERENCES \nM. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin, et al. TensorFlow: Large-scale machine learning on heterogeneous distributed systems. arXiv preprint arXiv:1603.04467, 2016. \nR. Al-Rfou, G. Alain, A. Almahairi, C. Angermueller, D. Bahdanau, N. Ballas, F. Bastien, J. Bayer, A. Belikov, et al. Theano: A python framework for fast computation of mathematical expressions. arXiv preprint arXiv:1605.02688, 2016. \nArvind and D. E. Culler. Dataflow architectures. Annual Review of Computer Science, 1(1):225–253, 1986. URL http://csg.csail.mit.edu/pubs/memos/Memo-261-1/Memo-261-2.pdf. \nS. R. Bowman, J. Gauthier, A. Rastogi, R. Gupta, C. D. Manning, and C. Potts. A fast unified model for parsing and sentence understanding. arXiv preprint arXiv:1603.06021, 2016. \nA. M. Caulfield, E. S. Chung, A. Putnam, H. Angepat, J. Fowers, M. Haselman, S. Heil, M. Humphrey, P. Kaur, J.-Y. Kim, et al. A cloud-scale acceleration architecture. In Microarchitecture (MICRO), 2016 49th Annual IEEE/ACM International Symposium on, pages 1–13. IEEE, 2016. \nS. Chandar, S. Ahn, H. Larochelle, P. Vincent, G. Tesauro, and Y. Bengio. Hierarchical memory networks. arXiv preprint arXiv:1605.07427, 2016. \nX. Chen, A. Eversole, G. Li, D. Yu, and F. Seide. Pipelined back-propagation for context-dependent deep neural networks. In Interspeech, pages 26–29, 2012. \nT. M. Chilimbi, Y. Suzue, J. Apacible, and K. Kalyanaraman. Project Adam: Building an efficient and scalable deep learning training system. In OSDI, volume 14, pages 571–582, 2014. \nJ. Chung, C. Gulcehre, K. Cho, and Y. Bengio. Empirical evaluation of gated recurrent neural networks on sequence modeling. arXiv preprint arXiv:1412.3555, 2014. \nJ. Dean, G. Corrado, R. Monga, K. Chen, M. Devin, M. Mao, A. Senior, P. Tucker, K. Yang, Q. V. Le, et al. Large scale distributed deep networks. In Advances in neural information processing systems, pages 1223–1231, 2012. \nC. Farabet, Y. LeCun, K. Kavukcuoglu, E. Culurciello, B. Martini, P. Akselrod, and S. Talay. Large-scale FPGA-based convolutional networks. Scaling up Machine Learning: Parallel and Distributed Approaches, pages 399–419, 2011. \nM. Figurnov, M. D. Collins, Y. Zhu, L. Zhang, J. Huang, D. Vetrov, and R. Salakhutdinov. Spatially adaptive computation time for residual networks. arXiv preprint arXiv:1612.02297, 2016. \nJ. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl. Neural message passing for quantum chemistry. arXiv preprint arXiv:1704.01212, 2017. \nC. Goller and A. Kuchler. Learning task-dependent distributed representations by backpropagation through structure. In Neural Networks, 1996., IEEE International Conference on, volume 1, pages 347–352. IEEE, 1996. \nA. Graves. Adaptive computation time for recurrent neural networks. arXiv preprint arXiv:1603.08983, 2016. \nA. Ichrak, P. Minet, and C. Adjih. Node coloring in wireless networks: Complexity results and grid coloring. 09 2012. \nM. Jaderberg, W. M. Czarnecki, S. Osindero, O. Vinyals, A. Graves, and K. Kavukcuoglu. Decoupled neural interfaces using synthetic gradients. arXiv preprint arXiv:1608.05343, 2016. \nN. P. Jouppi, C. Young, N. Patil, D. Patterson, G. Agrawal, R. Bajwa, S. Bates, S. Bhatia, N. Boden, A. Borchers, et al. In-datacenter performance analysis of a tensor processing unit. arXiv preprint arXiv:1704.04760, 2017. \nD. P. Kingma and J. Ba. Adam: A method for stochastic optimization. CoRR, abs/1412.6980, 2014. URL http://arxiv.org/abs/1412.6980. \nY. LeCun and C. Cortes. The MNIST database of handwritten digits, 1998. \nY. Li, D. Tarlow, M. Brockschmidt, and R. Zemel. Gated graph sequence neural networks. arXiv preprint arXiv:1511.05493, 2015. \nM. Looks, M. Herreshoff, D. Hutchins, and P. Norvig. Deep learning with dynamic computation graphs. arXiv preprint arXiv:1702.02181, 2017. Sentiment Tree Bank example: https://github.com/ tensorflow/fold/blob/master/tensorflow_fold/g3doc/sentiment.ipynb. \nI. Mitliagkas, C. Zhang, S. Hadjis, and C. Re. Asynchrony begets momentum, with an application to deep ´ learning. arXiv preprint arXiv:1605.09774, 2016. \nD. G. Murray, F. McSherry, M. Isard, R. Isaacs, P. Barham, and M. Abadi. Incremental, iterative data processing with timely dataflow. Commun. ACM, 59(10):75–83, Sept. 2016. ISSN 0001-0782. \nG. Neubig, C. Dyer, Y. Goldberg, A. Matthews, W. Ammar, A. Anastasopoulos, M. Ballesteros, D. Chiang, D. Clothiaux, T. Cohn, et al. Dynet: The dynamic neural network toolkit. arXiv preprint arXiv:1701.03980, 2017a. \nG. Neubig, Y. Goldberg, and C. Dyer. On-the-fly operation batching in dynamic computation graphs. arXiv preprint arXiv:1705.07860, 2017b. \nJ. Nothman, N. Ringland, W. Radford, T. Murphy, and J. R. Curran. Learning multilingual named entity recognition from wikipedia. Artificial Intelligence, 194:151–175, 2013. \nPyTorch core team. PyTorch. URL http://pytorch.org/. \nR. Ramakrishnan, P. O. Dral, M. Rupp, and O. A. von Lilienfeld. Quantum chemistry structures and properties of 134 kilo molecules. Scientific Data, 1, 2014. \nB. Recht, C. Re, S. Wright, and F. Niu. Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In Advances in Neural Information Processing Systems, pages 693–701, 2011. \nS. Reed and N. De Freitas. Neural programmer-interpreters. arXiv preprint arXiv:1511.06279, 2015. \nL. Ruddigkeit, R. Van Deursen, L. C. Blum, and J.-L. Reymond. Enumeration of 166 billion organic small molecules in the chemical universe database gdb-17. Journal of chemical information and modeling, 52(11): 2864–2875, 2012. \nF. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini. The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61–80, 2009. \nS. Semeniuta, A. Severyn, and E. Barth. Recurrent dropout without memory loss. arXiv preprint arXiv:1603.05118, 2016. \nN. Shazeer, A. Mirhoseini, K. Maziarz, A. Davis, Q. Le, G. Hinton, and J. Dean. Outrageously large neural networks: The sparsely-gated mixture-of-experts layer. arXiv preprint arXiv:1701.06538, 2017. \nR. Socher, C. C. Lin, C. Manning, and A. Y. Ng. Parsing natural scenes and natural language with recursive neural networks. In Proceedings of the 28th international conference on machine learning (ICML-11), pages 129–136, 2011. \nR. Socher, A. Perelygin, J. Y. Wu, J. Chuang, C. D. Manning, A. Y. Ng, C. Potts, et al. Recursive deep models for semantic compositionality over a sentiment treebank. In Proceedings of the conference on empirical methods in natural language processing (EMNLP), volume 1631, page 1642, 2013. Dataset: https://nlp.stanford.edu/sentiment/treebank.html. \nK. S. Tai, R. Socher, and C. D. Manning. Improved semantic representations from tree-structured long short-term memory networks. arXiv preprint arXiv:1503.00075, 2015. \nS. Tokui, K. Oono, S. Hido, and J. Clayton. Chainer: a next-generation open source framework for deep learning. In Proceedings of workshop on machine learning systems (LearningSys) in the twenty-ninth annual conference on neural information processing systems (NIPS), 2015. ", + "bbox": [ + 171, + 151, + 828, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 88, + 828, + 839 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A AMPNET RUNTIME IMPLEMENTATION ", + "text_level": 1, + "bbox": [ + 176, + 102, + 529, + 117 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We have implemented an AMPNet runtime for multi-core CPUs. Our runtime spawns multiple workers each associated with a hardware thread and hosting one or more IR nodes – in a more general setting each worker corresponds to a compute device. To remain faithful to a distributed environment communication is only through message passing. Each worker is equipped with a multiple-producer single-consumer queue that can accept messages for any IR node hosted on that worker. ", + "bbox": [ + 174, + 133, + 823, + 203 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The main worker loop periodically offloads messages from the concurrent queue to a worker-local priority queue that assigns higher priority to backward messages. Backward prioritization is designed for situations when multiple IR nodes with a dependency on the IR graph end up hosted on the same worker. As a consequence, backpropagation can complete faster and new instances can be pumped in by the controller. We dequeue the top message and invoke the forward or backward method of the target IR node. These methods may update internal IR node state (such as cache the state of the incoming message and wait for more messages) or post new forward or backward messages. ", + "bbox": [ + 174, + 210, + 825, + 308 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "How to update the parameters using the gradients is a configuration option that selects amongst a range of optimization algorithms. We have implemented runtime configuration options for selecting several well-known schemes such as (momentum-)SGD and Adam Kingma and Ba (2014), and for controlling the training hyper-parameters. ", + "bbox": [ + 174, + 315, + 825, + 371 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "B DETAILS OF THE EXPERIMENTAL RESULTS ", + "text_level": 1, + "bbox": [ + 174, + 392, + 560, + 407 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We provide more details of the experiment and analysis in this section. All experiments were carried out on machines with 16 cores and 112 GB of RAM. The validation curves were averaged over at least 20 independent runs. The time/epoch to reach a target accuracy was calculated as median of the time an algorithm takes to reach the target accuracy over the repetitions. We found this approach to be more reliable than reporting the time/epoch when the averaged accuracy reaches the target. Table 2 shows both the training and validation throughputs we obtained with AMPNet and our TensorFlow baselines. ", + "bbox": [ + 174, + 422, + 825, + 520 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "B.1 MNIST ", + "text_level": 1, + "bbox": [ + 174, + 537, + 272, + 553 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We train a 4-layer perceptron with ReLUs and 784-dimensional hidden units on MNIST (LeCun and Cortes, 1998). Both the AMP runtime and a TensorFlow baseline use SGD with learning rate 0.1 and batch size of 100. ", + "bbox": [ + 174, + 564, + 825, + 606 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Figure 6(a) shows the validation accuracy vs. time, validation accuracy vs. epochs, and throughputs of synchronous and asynchronous versions of AMPNet as well as TensorFlow. The throughput greatly increases from synchronous (max active key $\\mathfrak { s } = 1$ ) to asynchronous (max active key $s = 4$ ) while the speed of convergence (middle panel) is hardly affected for mild amount of asynchrony. Taking higher max active keys $= 8$ increase throughput only very little (because there is no more work) and seems to rather make the convergence more unstable. This is due to the fact that our current scheduler is greedy and pumps in a forward message whenever the first layer is unoccupied, which leads to large gradient staleness. Clearly a better scheduling will remove this sensitivity. ", + "bbox": [ + 174, + 613, + 825, + 724 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "B.2 LIST REDUCTION DATASET ", + "text_level": 1, + "bbox": [ + 176, + 742, + 401, + 756 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We train a vanilla RNN to perform reduction operations on variable length lists of digits. Each training instance is a sequence of at most 10 tokens: The first token indicates which of 4 reduction operations 2 is to be performed, and the remaining tokens represent the list of digits. The output is the result of the calculation rounded modulo 10. The dataset consists of $1 0 ^ { 5 }$ training and $1 0 ^ { 4 }$ validation instances. ", + "bbox": [ + 174, + 767, + 825, + 837 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We present this task as a classification problem to a vanilla RNN with ReLU activation and a hidden dimension of 128. All parameterized operations are affinitized on individual workers. We bucket training instances into batches of 100 sequences (in the baseline and in AMPNet). ", + "bbox": [ + 174, + 844, + 825, + 887 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/eef9ddeeba17a3a2c8c533667c6147d6a90efc0b4984c54160c37bc192ed5d3c.jpg", + "image_caption": [ + "Figure 6(b) shows the validation accuracy vs. time and the number of epochs, and throughputs of the methods we discussed in the main text on the list reduction dataset. We first notice that increasing the asynchrony from synchronous (max active key $\\tt { 3 = } 1$ ) to max active key $ \\textrm { s } = 4$ and max active keys $= 1 6$ affects the convergence very little at least in average. However, there " + ], + "image_footnote": [], + "bbox": [ + 183, + 50, + 820, + 837 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/72284ee41911113dff20759ede8d779a56a39d05d8a8ea74bd770e08d983f2f4.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 184, + 108, + 821, + 344 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/384dac4f026f5bd54a93a05e1e5522d9b18a335185869785c99e0132fddf2c6a.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 187, + 416, + 813, + 707 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "is also very little speedup without introducing replicas as we discussed in the main text. Increasing the number of replicas increases the throughput almost linearly from $1 3 \\mathrm { k }$ sequences/s (synchronous) to 35k sequences/s (2 replicas) and over 70k sequences/s (4 replicas). Convergence is almost unaffected for 2 replicas. This was rather surprising because the parameters of the replicas are only synchronized after each epoch as we described in Sec. 5. A slight slow-down in convergence can be noticed for 4 replicas. Since even max active keys $= 1 6$ has almost no effect on the convergence without replicas, this is not due to asynchrony. We also tried to synchronize more frequently but this did not help. Thus we believe that the slow-down is due to the increase in the effective minibatch size resulting in reduced number of updates per epoch, which is commonly observed in data parallel training. ", + "bbox": [ + 173, + 784, + 825, + 924 + ], + "page_idx": 13 + }, + { + "type": "image", + "img_path": "images/807d41ca3470b0323dc9b32f9915103be995b92e029053f3c0a82a7b00aa78f1.jpg", + "image_caption": [ + "Figure 6: Convergence plots. " + ], + "image_footnote": [], + "bbox": [ + 179, + 107, + 818, + 290 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/424d62ee02deca3e639dfd1ac72d5bd64f8c4fdd4a9728d7259a4d7a64f3e33d.jpg", + "table_caption": [ + "Table 2: Training and validation throughputs. " + ], + "table_footnote": [], + "table_body": "
number of instancesAMPTensorFlow
trainvalidmaktrain inst/svalid inst/strain inst/svalid inst/s
MNIST (97%)60k10k12076609458808037
4626818973
List reduction (97%)100k10k113k39k18k43k
416k55k
1616k56k
(2 replicas)435k100k
(4 replicas) Sentiment (82%)871k178k
8511110111022802651583
4188692
QM9 (4.6)16258822
117k13k130271012173218
410072585
1617974845
Wikiner (94 %)142k1.7k141101
486284
32130426
", + "bbox": [ + 171, + 380, + 851, + 614 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "B.3 SENTIMENT TREE BANK DATASET ", + "text_level": 1, + "bbox": [ + 176, + 646, + 454, + 660 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We consider the sentiment classification dataset from Socher et al. (2013) consisting of binarized constituency parse trees of English sentences with sentiment labels at each node. Following Tai et al. Tai et al. (2015), we use 8,544 trees for training, 1,101 trees for validation, and 2,210 trees for testing. ", + "bbox": [ + 174, + 672, + 826, + 714 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We use a Tree LSTM for this classification task based on the TensorFlow Fold Looks et al. (2017) benchmark model. Both the AMP and Fold models are trained following Tai et al. (2015) with the additional architectural modifications proposed by Looks et al. (2017); Semeniuta et al. (2016). Furthermore, we split our Tree-LSTM cell into Leaf LSTM and Branch LSTM cells. This does not affect the expressiveness of the model because the LSTM cell receives either zero input (on branch) or zero hidden states (on leaves); i.e., the two cells do not share weights except for the bias parameters, which are learned independently in our implementation. We compare the time to reach $82 \\%$ fine grained (5 classes) accuracy (averaged over all the nodes) on the validation set. ", + "bbox": [ + 173, + 720, + 825, + 833 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Figure 6(c) shows the averaged fine grained validation accuracy for the tree RNN model with different max active keyson the Stanford Sentiment Tree Bank dataset. Interestingly although TensorFlow Fold achieves higher throughput, AMPNet converges faster (in terms of the number of epochs). This speedup is mainly due to the fact that we are not batching and updating whenever we have accumulated 50 gradients (except for the lookup table node that updates every 1000 gradients); 50 gradients correspond to roughly 2 trees. The reason for the lower throughput compared to ", + "bbox": [ + 174, + 840, + 825, + 924 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "TensorFlow Fold is that we are only grouping the leaf operations and not the branch operations. Grouping the branch operations is possible by extending our IR nodes and we are actively working on it. ", + "bbox": [ + 173, + 103, + 823, + 145 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Figure 6(d) shows the same information for fixed max active keys $\\qquad = \\quad 1 6$ and different min update interval. We can see that as we increase min update interval from the originally used 50 to larger values, the peak of the validation accuracy shifts later and lower becoming closer to the curve obtained by TensorFlow Fold. This is consistent with the parallels between min update interval and minibatch size we drew in Section 6. The min update interval parameter has marginal influence on the training throughput. ", + "bbox": [ + 174, + 152, + 825, + 236 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "B.4 QM9 DATASET ", + "text_level": 1, + "bbox": [ + 176, + 257, + 320, + 271 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We study a real-world application for GNNs: prediction of organic molecule properties from structural formulae in the QM9 dataset Ruddigkeit et al. (2012); Ramakrishnan et al. (2014). GNNs have previously been applied to this task in Gilmer et al. (2017). ", + "bbox": [ + 174, + 285, + 825, + 327 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We concentrate on prediction of the norm of a molecule’s dipole moment using a regression layer build on the propagation model from Li et al. (2015) (corresponding to the simplest setting in Gilmer et al. (2017)). We use a hidden dimension of 100 and 4 propagation steps, initializing the graph nodes (atoms) following Gilmer et al. (2017). The molecules contain up to 29 atoms and in a TensorFlow baseline we bucket molecules into batches of 20 with atom counts differing by at most 1 within a batch. Following Gilmer et al. (2017), we report regression accuracies in multiples of a target accuracy from the chemistry community. ", + "bbox": [ + 174, + 333, + 825, + 431 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Figure 6(e) shows that GGNN can tolerate relatively large max active key $s = 1 6$ , and increased the throughput significantly from 300 graphs/s (synchronous) to 1797 graphs/s (see Table 2). ", + "bbox": [ + 173, + 438, + 823, + 467 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "B.5 WIKINER DATASET ", + "text_level": 1, + "bbox": [ + 176, + 487, + 348, + 501 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We compare the performance of AMP training with DyNet with and without autobatching using the BiLSTM tagger w/ char model from the DyNet benchmark suite3. This model consists of both character-level and word-level bidirectional LSTMs. The model uses a learnable word embedding for frequent words (more than 5 times in the corpus) and character-level bidirectional LSTMs for infrequent words. We use our Distribute and Collect nodes to dynamically route the messages depending on the word frequencies. ", + "bbox": [ + 174, + 513, + 825, + 598 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Wikiner dataset4 is a named entity recognition dataset extracted from Wikipedia by Nothman et al. (2013). We use the training/validation split provided by the DyNet benchmark suite with 142,153 and 1,696 sentences, respectively. ", + "bbox": [ + 176, + 604, + 821, + 647 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "The result is shown in Fig. 6(f). We achieve more than $3 \\mathbf { x }$ in throughput from max active keys $=$ 1 to max active key $s = 3 2$ without any noticeable loss in the validation accuracy after 2 or 3 epochs. The slight decrease in the validation accuracy after the third epoch is due to overfitting and it is not related to asynchrony. ", + "bbox": [ + 174, + 654, + 825, + 710 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "C THROUGHPUT ESTIMATION FOR A HYPOTHETICAL 1 TFLOPS DEVICE", + "text_level": 1, + "bbox": [ + 173, + 734, + 789, + 751 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "In order to estimate the performance of AMPNet on a hypothetical device with 1 TFLOPS compute capability, we replaced all fully connected layers in the network with a dummy operation that simply waits for a specified time. The dummy operation waits for $2 \\cdot k \\cdot d _ { \\mathrm { i n } } \\cdot d _ { \\mathrm { o u t } } \\cdot 1 0 ^ { - 1 2 }$ seconds when the input is $k \\times d _ { \\mathrm { i n } }$ and the weight matrix is $d _ { \\mathrm { i n } } \\times d _ { \\mathrm { o u t } }$ for forward, backward, and gradient accumulation operation. It waits for $d _ { \\mathrm { i n } } \\cdot \\dot { d } _ { \\mathrm { o u t } } \\cdot 1 0 ^ { - 1 2 }$ seconds for weight update. In this way we can maintain all the data-dependent control decisions (e.g., sequence length) identical to the original network and also measure the real time spent for all the other operations. In order to calculate the time to reach target accuracy, we take the median number of epochs the original network required to reach the target ", + "bbox": [ + 174, + 767, + 825, + 880 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "accuracy and calculate the time as ", + "bbox": [ + 173, + 103, + 400, + 117 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/cc3fd68ece76db3ba886ecd6597520737554cd64b79bff35def6f9b211eceac4.jpg", + "text": "$$\n\\mathrm { \\Delta t \\ i m e = e p o c h s \\cdot \\left( \\frac { { n _ { \\mathrm { t r a i n } } } } { t h r o u g h p u t _ { \\mathrm { t r a i n } } } + \\frac { { n _ { \\mathrm { v a l } } } } { t h r o u g h p u t _ { \\mathrm { v a l } } } \\right) , }\n$$", + "text_format": "latex", + "bbox": [ + 279, + 125, + 715, + 160 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "where $n _ { \\mathrm { t r a i n } }$ and $n _ { \\mathrm { v a l } }$ are the number of training and validation instances, respectively, and throughput $\\operatorname { t r a i n }$ and throughput $\\mathrm { v a l }$ are the throughput for training and validation, respectively. ", + "bbox": [ + 174, + 165, + 825, + 208 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "The results are shown in Table 3. For the 4-way replicated RNN, we estimate roughly 260k instances/s, which is a $3 . 7 \\mathbf { x }$ speedup compared to our CPU runtime. For tree RNN and GGSNN, we estimate milder $30 - 7 0 \\%$ speedups mainly due to the fact that they have more complicated operations like Distribute and Collect, which we did not attempt to extrapolate the computation time because the implementation on a new hardware may be drastically different from the current CPU runtime. ", + "bbox": [ + 173, + 214, + 826, + 285 + ], + "page_idx": 16 + }, + { + "type": "table", + "img_path": "images/580e3e3fe2a4292fecd7c721fb02f2c7ea4e12aaf6d6178346fc25940d586b23.jpg", + "table_caption": [ + "Table 3: Estimated time to convergence to target validation accuracy and training throughput with a hypothetical 1 TFLOPS device. mak is a short-hand for max active keys defined in Sec. 3; $\\mathrm { m a k } = 1$ corresponds to synchronous training for MNIST and minimal asynchrony arising from just one in-flight instance for other models with recursive structures. " + ], + "table_footnote": [], + "table_body": "
AMP1 TFLOPS (estimated)
targetaccuracymaktime (s)epochsinst/stime (s)inst/s
List reduction97%1781013k
(4 replicas) Sentiment8211371k5.15268k
82%11852102
16104325860.6440
QM94.616522776.5179738272455
", + "bbox": [ + 187, + 366, + 808, + 460 + ], + "page_idx": 16 + } +] \ No newline at end of file diff --git a/parse/train/HJnQJXbC-/HJnQJXbC-_middle.json b/parse/train/HJnQJXbC-/HJnQJXbC-_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..65517187d5da274bf60faa3ad2bac0f567d5b2c1 --- /dev/null +++ b/parse/train/HJnQJXbC-/HJnQJXbC-_middle.json @@ -0,0 +1,35146 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 185, + 97 + ], + "score": 1.0, + "content": "AMPNET:", + "type": "text" + }, + { + "bbox": [ + 217, + 78, + 506, + 97 + ], + "score": 1.0, + "content": "ASYNCHRONOUS MODEL-PARALLEL", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 104, + 97, + 453, + 118 + ], + "spans": [ + { + "bbox": [ + 104, + 97, + 453, + 118 + ], + "score": 1.0, + "content": "TRAINING FOR DYNAMIC NEURAL NETWORKS", + "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, + 469, + 366 + ], + "lines": [ + { + "bbox": [ + 141, + 212, + 470, + 225 + ], + "spans": [ + { + "bbox": [ + 141, + 212, + 470, + 225 + ], + "score": 1.0, + "content": "New types of compute hardware in development and entering the market hold", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 223, + 471, + 236 + ], + "spans": [ + { + "bbox": [ + 141, + 223, + 471, + 236 + ], + "score": 1.0, + "content": "the promise of revolutionizing deep learning in a manner as profound as GPUs.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 233, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 141, + 233, + 470, + 248 + ], + "score": 1.0, + "content": "However, existing software frameworks and training algorithms for deep learning", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 245, + 470, + 258 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 470, + 258 + ], + "score": 1.0, + "content": "have yet to evolve to fully leverage the capability of the new wave of silicon. In", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 256, + 470, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 256, + 470, + 268 + ], + "score": 1.0, + "content": "particular, models that exploit structured input via complex and instance-dependent", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 267, + 470, + 280 + ], + "spans": [ + { + "bbox": [ + 141, + 267, + 470, + 280 + ], + "score": 1.0, + "content": "control flow are difficult to accelerate using existing algorithms and hardware that", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 278, + 470, + 291 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 470, + 291 + ], + "score": 1.0, + "content": "typically rely on minibatching. We present an asynchronous model-parallel (AMP)", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "score": 1.0, + "content": "training algorithm that is specifically motivated by training on networks of inter-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 470, + 312 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 470, + 312 + ], + "score": 1.0, + "content": "connected devices. Through an implementation on multi-core CPUs, we show that", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 311, + 470, + 324 + ], + "spans": [ + { + "bbox": [ + 141, + 311, + 470, + 324 + ], + "score": 1.0, + "content": "AMP training converges to the same accuracy as conventional synchronous training", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 322, + 469, + 334 + ], + "spans": [ + { + "bbox": [ + 142, + 322, + 469, + 334 + ], + "score": 1.0, + "content": "algorithms in a similar number of epochs, but utilizes the available hardware more", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 333, + 471, + 345 + ], + "spans": [ + { + "bbox": [ + 141, + 333, + 471, + 345 + ], + "score": 1.0, + "content": "efficiently, even for small minibatch sizes, resulting in shorter overall training times.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 343, + 470, + 357 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 470, + 357 + ], + "score": 1.0, + "content": "Our framework opens the door for scaling up a new class of deep learning models", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 353, + 300, + 368 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 300, + 368 + ], + "score": 1.0, + "content": "that cannot be efficiently trained today.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 11.5 + }, + { + "type": "title", + "bbox": [ + 108, + 388, + 206, + 401 + ], + "lines": [ + { + "bbox": [ + 105, + 387, + 208, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 208, + 404 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 414, + 505, + 480 + ], + "lines": [ + { + "bbox": [ + 106, + 414, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "An emerging category of neural networks show the common trait of reacting in dynamic and unique", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 425, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 506, + 437 + ], + "score": 1.0, + "content": "ways to properties of their input. Networks like tree-structured recursive neural networks (Socher", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 436, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 506, + 448 + ], + "score": 1.0, + "content": "et al., 2013; Tai et al., 2015) and graph neural networks (GNNs) (Scarselli et al., 2009; Li et al., 2015;", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 446, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 460 + ], + "score": 1.0, + "content": "Gilmer et al., 2017) take structured data types as input and and execute a computation that depends", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 455, + 507, + 473 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 507, + 473 + ], + "score": 1.0, + "content": "on the input structure. This defies the moden GPU-driven paradigm of minibatch-based processing,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 470, + 492, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 492, + 481 + ], + "score": 1.0, + "content": "and we refer to this new class of models with dynamic control flow as dynamic neural networks.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 107, + 486, + 505, + 530 + ], + "lines": [ + { + "bbox": [ + 105, + 486, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 506, + 498 + ], + "score": 1.0, + "content": "The development of dynamic neural network frameworks – Chainer (Tokui et al., 2015), DyNet", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "(Neubig et al., 2017a), and PyTorch (PyTorch core team) – speaks to the importance of this class of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 508, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 505, + 519 + ], + "score": 1.0, + "content": "models and highlights the challenge of how to make it easy for users to describe them. Yet there is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 519, + 372, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 372, + 532 + ], + "score": 1.0, + "content": "another big challenge: how can we train these models efficiently?", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 535, + 505, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 535, + 506, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 535, + 506, + 548 + ], + "score": 1.0, + "content": "Managing minibatches to keep GPUs fully utilized is typically considered a user’s responsibility in", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 546, + 506, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 506, + 559 + ], + "score": 1.0, + "content": "these dynamic frameworks (with the exception of DyNet’s autobatching feature; see Sec. 7). This", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 558, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 506, + 570 + ], + "score": 1.0, + "content": "means that users have to think about how to change their data feeding pipeline or even the model", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 568, + 496, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 496, + 582 + ], + "score": 1.0, + "content": "itself to run efficiently on GPUs, rather spending time innovating to improve the model accuracy.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 108, + 585, + 505, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 585, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 506, + 598 + ], + "score": 1.0, + "content": "What if we had a hypothetical device with low memory overhead that allows perfect scaling without", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 597, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 278, + 609 + ], + "score": 1.0, + "content": "batching; i.e., processing 1 item is simply", + "type": "text" + }, + { + "bbox": [ + 278, + 597, + 299, + 607 + ], + "score": 0.55, + "content": "1 0 0 \\mathrm { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 597, + 505, + 609 + ], + "score": 1.0, + "content": "faster than processing 100 items? Recent work on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 607, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 506, + 620 + ], + "score": 1.0, + "content": "FPGAs and other specialized hardware (Farabet et al., 2011; Caulfield et al., 2016; Jouppi et al.,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 618, + 444, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 444, + 632 + ], + "score": 1.0, + "content": "2017) for deep learning encourages us to investigate this question. Our premises are", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 124, + 640, + 504, + 678 + ], + "lines": [ + { + "bbox": [ + 129, + 638, + 335, + 653 + ], + "spans": [ + { + "bbox": [ + 129, + 638, + 335, + 653 + ], + "score": 1.0, + "content": "1. No batching is required for efficient processing.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 128, + 653, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 128, + 653, + 505, + 668 + ], + "score": 1.0, + "content": "2. Each device may not have enough memory to hold the entire model (this is a realistic", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 141, + 666, + 478, + 679 + ], + "spans": [ + { + "bbox": [ + 141, + 666, + 478, + 679 + ], + "score": 1.0, + "content": "constraint for current memory systems that approach the perfect scaling we require)", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 108, + 688, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "Based on these premises, we propose an asynchronous model-parallel (AMP) training algorithm.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Our idea is illustrated in Figure 1. We need model parallelism because each device may be too", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "small to hold the entire model (premise 2). However, if we perform synchronous parameter updates", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "following the full forward and backward propagations, the only way to increase device utilization is", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.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": [ + 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, + 78, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 79, + 185, + 97 + ], + "score": 1.0, + "content": "AMPNET:", + "type": "text" + }, + { + "bbox": [ + 217, + 78, + 506, + 97 + ], + "score": 1.0, + "content": "ASYNCHRONOUS MODEL-PARALLEL", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 104, + 97, + 453, + 118 + ], + "spans": [ + { + "bbox": [ + 104, + 97, + 453, + 118 + ], + "score": 1.0, + "content": "TRAINING FOR DYNAMIC NEURAL NETWORKS", + "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, + 469, + 366 + ], + "lines": [ + { + "bbox": [ + 141, + 212, + 470, + 225 + ], + "spans": [ + { + "bbox": [ + 141, + 212, + 470, + 225 + ], + "score": 1.0, + "content": "New types of compute hardware in development and entering the market hold", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 223, + 471, + 236 + ], + "spans": [ + { + "bbox": [ + 141, + 223, + 471, + 236 + ], + "score": 1.0, + "content": "the promise of revolutionizing deep learning in a manner as profound as GPUs.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 233, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 141, + 233, + 470, + 248 + ], + "score": 1.0, + "content": "However, existing software frameworks and training algorithms for deep learning", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 245, + 470, + 258 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 470, + 258 + ], + "score": 1.0, + "content": "have yet to evolve to fully leverage the capability of the new wave of silicon. In", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 256, + 470, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 256, + 470, + 268 + ], + "score": 1.0, + "content": "particular, models that exploit structured input via complex and instance-dependent", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 267, + 470, + 280 + ], + "spans": [ + { + "bbox": [ + 141, + 267, + 470, + 280 + ], + "score": 1.0, + "content": "control flow are difficult to accelerate using existing algorithms and hardware that", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 278, + 470, + 291 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 470, + 291 + ], + "score": 1.0, + "content": "typically rely on minibatching. We present an asynchronous model-parallel (AMP)", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "score": 1.0, + "content": "training algorithm that is specifically motivated by training on networks of inter-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 470, + 312 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 470, + 312 + ], + "score": 1.0, + "content": "connected devices. Through an implementation on multi-core CPUs, we show that", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 311, + 470, + 324 + ], + "spans": [ + { + "bbox": [ + 141, + 311, + 470, + 324 + ], + "score": 1.0, + "content": "AMP training converges to the same accuracy as conventional synchronous training", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 322, + 469, + 334 + ], + "spans": [ + { + "bbox": [ + 142, + 322, + 469, + 334 + ], + "score": 1.0, + "content": "algorithms in a similar number of epochs, but utilizes the available hardware more", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 333, + 471, + 345 + ], + "spans": [ + { + "bbox": [ + 141, + 333, + 471, + 345 + ], + "score": 1.0, + "content": "efficiently, even for small minibatch sizes, resulting in shorter overall training times.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 343, + 470, + 357 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 470, + 357 + ], + "score": 1.0, + "content": "Our framework opens the door for scaling up a new class of deep learning models", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 353, + 300, + 368 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 300, + 368 + ], + "score": 1.0, + "content": "that cannot be efficiently trained today.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 11.5, + "bbox_fs": [ + 141, + 212, + 471, + 368 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 388, + 206, + 401 + ], + "lines": [ + { + "bbox": [ + 105, + 387, + 208, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 208, + 404 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 414, + 505, + 480 + ], + "lines": [ + { + "bbox": [ + 106, + 414, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "An emerging category of neural networks show the common trait of reacting in dynamic and unique", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 425, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 506, + 437 + ], + "score": 1.0, + "content": "ways to properties of their input. Networks like tree-structured recursive neural networks (Socher", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 436, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 506, + 448 + ], + "score": 1.0, + "content": "et al., 2013; Tai et al., 2015) and graph neural networks (GNNs) (Scarselli et al., 2009; Li et al., 2015;", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 446, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 460 + ], + "score": 1.0, + "content": "Gilmer et al., 2017) take structured data types as input and and execute a computation that depends", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 455, + 507, + 473 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 507, + 473 + ], + "score": 1.0, + "content": "on the input structure. This defies the moden GPU-driven paradigm of minibatch-based processing,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 470, + 492, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 492, + 481 + ], + "score": 1.0, + "content": "and we refer to this new class of models with dynamic control flow as dynamic neural networks.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5, + "bbox_fs": [ + 104, + 414, + 507, + 481 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 486, + 505, + 530 + ], + "lines": [ + { + "bbox": [ + 105, + 486, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 506, + 498 + ], + "score": 1.0, + "content": "The development of dynamic neural network frameworks – Chainer (Tokui et al., 2015), DyNet", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "(Neubig et al., 2017a), and PyTorch (PyTorch core team) – speaks to the importance of this class of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 508, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 505, + 519 + ], + "score": 1.0, + "content": "models and highlights the challenge of how to make it easy for users to describe them. Yet there is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 519, + 372, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 372, + 532 + ], + "score": 1.0, + "content": "another big challenge: how can we train these models efficiently?", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 486, + 506, + 532 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 535, + 505, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 535, + 506, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 535, + 506, + 548 + ], + "score": 1.0, + "content": "Managing minibatches to keep GPUs fully utilized is typically considered a user’s responsibility in", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 546, + 506, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 506, + 559 + ], + "score": 1.0, + "content": "these dynamic frameworks (with the exception of DyNet’s autobatching feature; see Sec. 7). This", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 558, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 506, + 570 + ], + "score": 1.0, + "content": "means that users have to think about how to change their data feeding pipeline or even the model", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 568, + 496, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 496, + 582 + ], + "score": 1.0, + "content": "itself to run efficiently on GPUs, rather spending time innovating to improve the model accuracy.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 535, + 506, + 582 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 585, + 505, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 585, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 506, + 598 + ], + "score": 1.0, + "content": "What if we had a hypothetical device with low memory overhead that allows perfect scaling without", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 597, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 278, + 609 + ], + "score": 1.0, + "content": "batching; i.e., processing 1 item is simply", + "type": "text" + }, + { + "bbox": [ + 278, + 597, + 299, + 607 + ], + "score": 0.55, + "content": "1 0 0 \\mathrm { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 597, + 505, + 609 + ], + "score": 1.0, + "content": "faster than processing 100 items? Recent work on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 607, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 607, + 506, + 620 + ], + "score": 1.0, + "content": "FPGAs and other specialized hardware (Farabet et al., 2011; Caulfield et al., 2016; Jouppi et al.,", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 618, + 444, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 444, + 632 + ], + "score": 1.0, + "content": "2017) for deep learning encourages us to investigate this question. Our premises are", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 585, + 506, + 632 + ] + }, + { + "type": "text", + "bbox": [ + 124, + 640, + 504, + 678 + ], + "lines": [ + { + "bbox": [ + 129, + 638, + 335, + 653 + ], + "spans": [ + { + "bbox": [ + 129, + 638, + 335, + 653 + ], + "score": 1.0, + "content": "1. No batching is required for efficient processing.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 128, + 653, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 128, + 653, + 505, + 668 + ], + "score": 1.0, + "content": "2. Each device may not have enough memory to hold the entire model (this is a realistic", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 141, + 666, + 478, + 679 + ], + "spans": [ + { + "bbox": [ + 141, + 666, + 478, + 679 + ], + "score": 1.0, + "content": "constraint for current memory systems that approach the perfect scaling we require)", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 128, + 638, + 505, + 679 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 688, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "Based on these premises, we propose an asynchronous model-parallel (AMP) training algorithm.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Our idea is illustrated in Figure 1. We need model parallelism because each device may be too", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "small to hold the entire model (premise 2). However, if we perform synchronous parameter updates", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "following the full forward and backward propagations, the only way to increase device utilization is", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 244, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 258 + ], + "score": 1.0, + "content": "by pipelining multiple instances into the system (see e.g., Chen et al., 2012). Pipeline parallelism", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 255, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 505, + 269 + ], + "score": 1.0, + "content": "with synchronous updates is at odds with convergence speed due to a decreased parameter update", + "type": "text", + "cross_page": true + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 267, + 261, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 261, + 280 + ], + "score": 1.0, + "content": "frequency; compare Fig. 1 (a) and (b).", + "type": "text", + "cross_page": true + } + ], + "index": 8 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 687, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 105, + 78, + 500, + 163 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 105, + 78, + 500, + 163 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 78, + 500, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 500, + 163 + ], + "score": 0.952, + "type": "image", + "image_path": "7852ac9eac92bbdd64cbafe7eac5fba75ec33dbe3ccd6ef94eaaffd20d2bb990.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 105, + 78, + 500, + 106.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 105, + 106.33333333333333, + 500, + 134.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 105, + 134.66666666666666, + 500, + 163.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 184, + 505, + 217 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 183, + 505, + 197 + ], + "spans": [ + { + "bbox": [ + 106, + 183, + 505, + 197 + ], + "score": 1.0, + "content": "Figure 1: Gantt charts comparing pipelined synchronous model parallelism and asynchronous model", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "score": 1.0, + "content": "parallelism. Orange, blue, and yellow boxes correspond to forward, backward, and parameter update", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 207, + 400, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 400, + 218 + ], + "score": 1.0, + "content": "operations, respectively. The numbers in the boxes indicate instance IDs.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 245, + 505, + 278 + ], + "lines": [ + { + "bbox": [ + 105, + 244, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 258 + ], + "score": 1.0, + "content": "by pipelining multiple instances into the system (see e.g., Chen et al., 2012). Pipeline parallelism", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 255, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 505, + 269 + ], + "score": 1.0, + "content": "with synchronous updates is at odds with convergence speed due to a decreased parameter update", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 267, + 261, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 261, + 280 + ], + "score": 1.0, + "content": "frequency; compare Fig. 1 (a) and (b).", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 284, + 505, + 317 + ], + "lines": [ + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "score": 1.0, + "content": "To overcome this problem, we propose asynchronous parameter updates that occur without global", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 295, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 307 + ], + "score": 1.0, + "content": "synchronization whenever a pre-specified number of gradients have been accumulated; see Fig. 1 (c).", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 304, + 421, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 421, + 320 + ], + "score": 1.0, + "content": "With this design we aim for both high device utilization and update frequency.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 108, + 322, + 505, + 356 + ], + "lines": [ + { + "bbox": [ + 106, + 323, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 505, + 335 + ], + "score": 1.0, + "content": "In this setting, however, model parameters may be updated between the forward and the backward", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 334, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 505, + 345 + ], + "score": 1.0, + "content": "computation of an instance, introducing gradient “staleness”. Despite staleness, we show that AMP", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 344, + 479, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 479, + 358 + ], + "score": 1.0, + "content": "training can converge fast with good hardware utilization. Specifically, our contributions are:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 132, + 366, + 505, + 527 + ], + "lines": [ + { + "bbox": [ + 133, + 366, + 505, + 380 + ], + "spans": [ + { + "bbox": [ + 133, + 366, + 505, + 380 + ], + "score": 1.0, + "content": "• We present the asynchronous model parallel training algorithm for efficient distributed", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 378, + 265, + 390 + ], + "spans": [ + { + "bbox": [ + 142, + 378, + 265, + 390 + ], + "score": 1.0, + "content": "training of dynamic networks.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 394, + 505, + 407 + ], + "score": 1.0, + "content": "We present an intermediate representation (IR) with explicit constructs for branching and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 405, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 141, + 405, + 506, + 417 + ], + "score": 1.0, + "content": "joining control flow that supports AMP training. Unlike previous work that considers static", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 416, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 141, + 416, + 505, + 429 + ], + "score": 1.0, + "content": "computation graphs for static control flow (e.g., Caffe), and dynamic computation graphs for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 428, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 142, + 428, + 505, + 440 + ], + "score": 1.0, + "content": "dynamic control flow (e.g., Chainer), our IR encodes a static computation graph to execute", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 437, + 453, + 451 + ], + "spans": [ + { + "bbox": [ + 141, + 437, + 453, + 451 + ], + "score": 1.0, + "content": "dynamic control flow1. This makes training easy to distribute and parallelize.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 138, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 138, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "We show that our IR can readily encode replicas, a form of data parallelism (see Sec. 5). In", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 464, + 507, + 480 + ], + "spans": [ + { + "bbox": [ + 141, + 464, + 507, + 480 + ], + "score": 1.0, + "content": "addition, our IR includes operators for data aggregation, which recover a form of batching,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 477, + 474, + 489 + ], + "spans": [ + { + "bbox": [ + 141, + 477, + 474, + 489 + ], + "score": 1.0, + "content": "enabling our methods to be applied even on hardware where batching is beneficial.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 132, + 493, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 132, + 493, + 505, + 507 + ], + "score": 1.0, + "content": "• We implement AMP training on a multi-core CPU and empirically demonstrate that AMP", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 505, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 141, + 505, + 505, + 517 + ], + "score": 1.0, + "content": "training converges to similar accuracies as synchronous algorithms on a variety of dynamic", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 516, + 492, + 528 + ], + "spans": [ + { + "bbox": [ + 141, + 516, + 492, + 528 + ], + "score": 1.0, + "content": "neural network models including Tree RNN and gated graph neural networks (GGNN).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 107, + 537, + 505, + 592 + ], + "lines": [ + { + "bbox": [ + 106, + 537, + 504, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 504, + 549 + ], + "score": 1.0, + "content": "In summary, our work demonstrates the benefits of AMP training and gives a novel way to design and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 549, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 505, + 560 + ], + "score": 1.0, + "content": "deploy neural network libraries with dynamic control flow. In addition, we use our implementation", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "to estimate the performance on a hypothetical device satisfying premises 1 & 2, with 1TFLOPS", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 569, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 505, + 585 + ], + "score": 1.0, + "content": "compute capability (see Appendix C). Together, these contributions open up new ways to scale up", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 581, + 327, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 327, + 595 + ], + "score": 1.0, + "content": "dynamic networks on interconnected compute devices.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30 + }, + { + "type": "title", + "bbox": [ + 108, + 612, + 396, + 623 + ], + "lines": [ + { + "bbox": [ + 104, + 609, + 398, + 626 + ], + "spans": [ + { + "bbox": [ + 104, + 609, + 398, + 626 + ], + "score": 1.0, + "content": "2 NEURAL NETWORKS WITH DYNAMIC CONTROL FLOW", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 105, + 636, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 506, + 651 + ], + "score": 1.0, + "content": "Below we highlight three models with dynamic control flow that will be studied in depth in this paper:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 506, + 709 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 505, + 666 + ], + "score": 1.0, + "content": "Variable-length RNNs iterate over the tokens of variable-length sequences. Pseudo-code for a simple", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 665, + 506, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 506, + 677 + ], + "score": 1.0, + "content": "vanilla RNN is given in Figure 2. The linear (fully connected) layer and rectified linear unit (ReLU)", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 675, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 506, + 689 + ], + "score": 1.0, + "content": "can be substituted with a more sophisticated unit such as a gated recurrent unit (Chung et al., 2014).", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "score": 1.0, + "content": "Though each instance has a different length, it is possible to add padding to enable batching. However", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 698, + 448, + 710 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 448, + 710 + ], + "score": 1.0, + "content": "this may lead to significant redundant compute due to variability in sequence lengths.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 118, + 721, + 404, + 731 + ], + "lines": [ + { + "bbox": [ + 119, + 720, + 406, + 733 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 406, + 733 + ], + "score": 1.0, + "content": "1Our IR bears similarity to TensorFlow but we discuss differences in Section 7.", + "type": "text" + } + ] + } + ] + }, + { + "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": [ + 105, + 78, + 500, + 163 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 105, + 78, + 500, + 163 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 78, + 500, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 500, + 163 + ], + "score": 0.952, + "type": "image", + "image_path": "7852ac9eac92bbdd64cbafe7eac5fba75ec33dbe3ccd6ef94eaaffd20d2bb990.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 105, + 78, + 500, + 106.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 105, + 106.33333333333333, + 500, + 134.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 105, + 134.66666666666666, + 500, + 163.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 184, + 505, + 217 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 183, + 505, + 197 + ], + "spans": [ + { + "bbox": [ + 106, + 183, + 505, + 197 + ], + "score": 1.0, + "content": "Figure 1: Gantt charts comparing pipelined synchronous model parallelism and asynchronous model", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "score": 1.0, + "content": "parallelism. Orange, blue, and yellow boxes correspond to forward, backward, and parameter update", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 207, + 400, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 400, + 218 + ], + "score": 1.0, + "content": "operations, respectively. The numbers in the boxes indicate instance IDs.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 245, + 505, + 278 + ], + "lines": [], + "index": 7, + "bbox_fs": [ + 105, + 244, + 505, + 280 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 284, + 505, + 317 + ], + "lines": [ + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 506, + 297 + ], + "score": 1.0, + "content": "To overcome this problem, we propose asynchronous parameter updates that occur without global", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 295, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 307 + ], + "score": 1.0, + "content": "synchronization whenever a pre-specified number of gradients have been accumulated; see Fig. 1 (c).", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 304, + 421, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 421, + 320 + ], + "score": 1.0, + "content": "With this design we aim for both high device utilization and update frequency.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 283, + 506, + 320 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 322, + 505, + 356 + ], + "lines": [ + { + "bbox": [ + 106, + 323, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 505, + 335 + ], + "score": 1.0, + "content": "In this setting, however, model parameters may be updated between the forward and the backward", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 334, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 505, + 345 + ], + "score": 1.0, + "content": "computation of an instance, introducing gradient “staleness”. Despite staleness, we show that AMP", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 344, + 479, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 479, + 358 + ], + "score": 1.0, + "content": "training can converge fast with good hardware utilization. Specifically, our contributions are:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 323, + 505, + 358 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 366, + 505, + 527 + ], + "lines": [ + { + "bbox": [ + 133, + 366, + 505, + 380 + ], + "spans": [ + { + "bbox": [ + 133, + 366, + 505, + 380 + ], + "score": 1.0, + "content": "• We present the asynchronous model parallel training algorithm for efficient distributed", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 378, + 265, + 390 + ], + "spans": [ + { + "bbox": [ + 142, + 378, + 265, + 390 + ], + "score": 1.0, + "content": "training of dynamic networks.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 138, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 138, + 394, + 505, + 407 + ], + "score": 1.0, + "content": "We present an intermediate representation (IR) with explicit constructs for branching and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 405, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 141, + 405, + 506, + 417 + ], + "score": 1.0, + "content": "joining control flow that supports AMP training. Unlike previous work that considers static", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 416, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 141, + 416, + 505, + 429 + ], + "score": 1.0, + "content": "computation graphs for static control flow (e.g., Caffe), and dynamic computation graphs for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 142, + 428, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 142, + 428, + 505, + 440 + ], + "score": 1.0, + "content": "dynamic control flow (e.g., Chainer), our IR encodes a static computation graph to execute", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 437, + 453, + 451 + ], + "spans": [ + { + "bbox": [ + 141, + 437, + 453, + 451 + ], + "score": 1.0, + "content": "dynamic control flow1. This makes training easy to distribute and parallelize.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 138, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 138, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "We show that our IR can readily encode replicas, a form of data parallelism (see Sec. 5). In", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 464, + 507, + 480 + ], + "spans": [ + { + "bbox": [ + 141, + 464, + 507, + 480 + ], + "score": 1.0, + "content": "addition, our IR includes operators for data aggregation, which recover a form of batching,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 477, + 474, + 489 + ], + "spans": [ + { + "bbox": [ + 141, + 477, + 474, + 489 + ], + "score": 1.0, + "content": "enabling our methods to be applied even on hardware where batching is beneficial.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 132, + 493, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 132, + 493, + 505, + 507 + ], + "score": 1.0, + "content": "• We implement AMP training on a multi-core CPU and empirically demonstrate that AMP", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 505, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 141, + 505, + 505, + 517 + ], + "score": 1.0, + "content": "training converges to similar accuracies as synchronous algorithms on a variety of dynamic", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 516, + 492, + 528 + ], + "spans": [ + { + "bbox": [ + 141, + 516, + 492, + 528 + ], + "score": 1.0, + "content": "neural network models including Tree RNN and gated graph neural networks (GGNN).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 21, + "bbox_fs": [ + 132, + 366, + 507, + 528 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 537, + 505, + 592 + ], + "lines": [ + { + "bbox": [ + 106, + 537, + 504, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 504, + 549 + ], + "score": 1.0, + "content": "In summary, our work demonstrates the benefits of AMP training and gives a novel way to design and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 549, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 505, + 560 + ], + "score": 1.0, + "content": "deploy neural network libraries with dynamic control flow. In addition, we use our implementation", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "to estimate the performance on a hypothetical device satisfying premises 1 & 2, with 1TFLOPS", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 569, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 505, + 585 + ], + "score": 1.0, + "content": "compute capability (see Appendix C). Together, these contributions open up new ways to scale up", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 581, + 327, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 327, + 595 + ], + "score": 1.0, + "content": "dynamic networks on interconnected compute devices.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 537, + 505, + 595 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 612, + 396, + 623 + ], + "lines": [ + { + "bbox": [ + 104, + 609, + 398, + 626 + ], + "spans": [ + { + "bbox": [ + 104, + 609, + 398, + 626 + ], + "score": 1.0, + "content": "2 NEURAL NETWORKS WITH DYNAMIC CONTROL FLOW", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 105, + 636, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 506, + 651 + ], + "score": 1.0, + "content": "Below we highlight three models with dynamic control flow that will be studied in depth in this paper:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 635, + 506, + 651 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 506, + 709 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 505, + 666 + ], + "score": 1.0, + "content": "Variable-length RNNs iterate over the tokens of variable-length sequences. Pseudo-code for a simple", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 665, + 506, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 665, + 506, + 677 + ], + "score": 1.0, + "content": "vanilla RNN is given in Figure 2. The linear (fully connected) layer and rectified linear unit (ReLU)", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 675, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 506, + 689 + ], + "score": 1.0, + "content": "can be substituted with a more sophisticated unit such as a gated recurrent unit (Chung et al., 2014).", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "score": 1.0, + "content": "Though each instance has a different length, it is possible to add padding to enable batching. However", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 698, + 448, + 710 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 448, + 710 + ], + "score": 1.0, + "content": "this may lead to significant redundant compute due to variability in sequence lengths.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 654, + 506, + 710 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 154, + 80, + 455, + 217 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 154, + 80, + 455, + 217 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 154, + 80, + 455, + 217 + ], + "spans": [ + { + "bbox": [ + 154, + 80, + 455, + 217 + ], + "score": 0.972, + "type": "image", + "image_path": "217149a2d1737896fff3ba084e656184671f3a0db8cb74837b1d30ac15635f63.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 154, + 80, + 455, + 125.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 154, + 125.66666666666666, + 455, + 171.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 154, + 171.33333333333331, + 455, + 216.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 138, + 227, + 473, + 240 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 136, + 226, + 474, + 242 + ], + "spans": [ + { + "bbox": [ + 136, + 226, + 474, + 242 + ], + "score": 1.0, + "content": "Figure 2: Variable-length RNN in IR and pseudocode (colors denote IR node types)", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "table", + "bbox": [ + 106, + 257, + 488, + 434 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 257, + 488, + 434 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 257, + 488, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 488, + 434 + ], + "score": 0.832, + "html": "
Algorithm 1 Asynchronous Model-Parallel training
while training not done do
for all workers in parallel do
Wait until a message arrives
msg ←the highest priority message from the input queue
op ← sink node of the message msg
if msg is forward type then Compute forward: out_msgs ← op(msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the child nodes.
else if msg is backward type then
Compute backward: out_msgs ← op*(msg,fwd_msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the parent nodes.
else if msg isupdate type then
Perform parameter updates on op
end if
end for
end while
", + "type": "table", + "image_path": "324147a02a4a76163a46afa798988ef82d657efd69e7002117e16b7b1816e5d3.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 106, + 257, + 488, + 316.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 106, + 316.0, + 488, + 375.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 375.0, + 488, + 434.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 456, + 505, + 555 + ], + "lines": [ + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "score": 1.0, + "content": "Tree-structured neural networks are powerful models used for parsing of natural language and images,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 467, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 506, + 479 + ], + "score": 1.0, + "content": "semantic representation, and sentiment analysis (Socher et al., 2011; Bowman et al., 2016; Socher", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "score": 1.0, + "content": "et al., 2013; Tai et al., 2015). They require evaluation of (potentially multiple) trees with shared", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "score": 1.0, + "content": "parameters but different topology for each instance. Each tree structure is instance-specific and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "batching requires nontrivial planning (Looks et al., 2017). A simple form of tree neural network", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "performs a bottom up traversal of the instance, starting from an embedding of the leaves. At each level", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 522, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 506, + 534 + ], + "score": 1.0, + "content": "the values from the child nodes are concatenated and sent through a specialized unit (e.g. LSTM).", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 532, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 546 + ], + "score": 1.0, + "content": "The result is then propagated further up the tree. Backpropagation over the tree structure is known as", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 543, + 359, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 359, + 556 + ], + "score": 1.0, + "content": "backpropagation through structure (Goller and Kuchler, 1996).", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 560, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 560, + 505, + 573 + ], + "score": 1.0, + "content": "Graph neural networks (Scarselli et al., 2009; Li et al., 2015; Gilmer et al., 2017) combine both the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 571, + 507, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 507, + 585 + ], + "score": 1.0, + "content": "temporal recurrence and recurrence over the structure. GNNs can be seen as performing aggrega-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 583, + 435, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 435, + 595 + ], + "score": 1.0, + "content": "tion/distribution operations over a general graph structure with shared parameters.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 599, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "Apart from the models above, there exist many recently proposed models with flexible control flow", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "score": 1.0, + "content": "(e.g. hierarchical memory networks (Chandar et al., 2016), neural programmer interpreters (Reed", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "and De Freitas, 2015), adaptive computation networks (Graves, 2016; Figurnov et al., 2016), and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 633, + 493, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 493, + 645 + ], + "score": 1.0, + "content": "sparsely-gated mixture of experts (Shazeer et al., 2017), to which our framework can be applied.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5 + }, + { + "type": "title", + "bbox": [ + 108, + 663, + 365, + 675 + ], + "lines": [ + { + "bbox": [ + 104, + 661, + 366, + 677 + ], + "spans": [ + { + "bbox": [ + 104, + 661, + 366, + 677 + ], + "score": 1.0, + "content": "3 ASYNCHRONOUS MODEL-PARALLEL TRAINING", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "score": 1.0, + "content": "In AMP training, each node of a computation graph (including control flow nodes – see next section)", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "is associated with a worker, which is an abstraction of a compute device. Neural network training", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "and inference is carried out by message passing among workers following algorithm 1. All workers", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "run in parallel without synchronization. Each message contains a payload (float or int tensor), as", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25.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": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 154, + 80, + 455, + 217 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 154, + 80, + 455, + 217 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 154, + 80, + 455, + 217 + ], + "spans": [ + { + "bbox": [ + 154, + 80, + 455, + 217 + ], + "score": 0.972, + "type": "image", + "image_path": "217149a2d1737896fff3ba084e656184671f3a0db8cb74837b1d30ac15635f63.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 154, + 80, + 455, + 125.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 154, + 125.66666666666666, + 455, + 171.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 154, + 171.33333333333331, + 455, + 216.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 138, + 227, + 473, + 240 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 136, + 226, + 474, + 242 + ], + "spans": [ + { + "bbox": [ + 136, + 226, + 474, + 242 + ], + "score": 1.0, + "content": "Figure 2: Variable-length RNN in IR and pseudocode (colors denote IR node types)", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "table", + "bbox": [ + 106, + 257, + 488, + 434 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 257, + 488, + 434 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 257, + 488, + 434 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 488, + 434 + ], + "score": 0.832, + "html": "
Algorithm 1 Asynchronous Model-Parallel training
while training not done do
for all workers in parallel do
Wait until a message arrives
msg ←the highest priority message from the input queue
op ← sink node of the message msg
if msg is forward type then Compute forward: out_msgs ← op(msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the child nodes.
else if msg is backward type then
Compute backward: out_msgs ← op*(msg,fwd_msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the parent nodes.
else if msg isupdate type then
Perform parameter updates on op
end if
end for
end while
", + "type": "table", + "image_path": "324147a02a4a76163a46afa798988ef82d657efd69e7002117e16b7b1816e5d3.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 106, + 257, + 488, + 316.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 106, + 316.0, + 488, + 375.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 106, + 375.0, + 488, + 434.0 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 456, + 505, + 555 + ], + "lines": [ + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "score": 1.0, + "content": "Tree-structured neural networks are powerful models used for parsing of natural language and images,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 467, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 506, + 479 + ], + "score": 1.0, + "content": "semantic representation, and sentiment analysis (Socher et al., 2011; Bowman et al., 2016; Socher", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "score": 1.0, + "content": "et al., 2013; Tai et al., 2015). They require evaluation of (potentially multiple) trees with shared", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 501 + ], + "score": 1.0, + "content": "parameters but different topology for each instance. Each tree structure is instance-specific and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 500, + 506, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 506, + 513 + ], + "score": 1.0, + "content": "batching requires nontrivial planning (Looks et al., 2017). A simple form of tree neural network", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 510, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 505, + 523 + ], + "score": 1.0, + "content": "performs a bottom up traversal of the instance, starting from an embedding of the leaves. At each level", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 522, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 522, + 506, + 534 + ], + "score": 1.0, + "content": "the values from the child nodes are concatenated and sent through a specialized unit (e.g. LSTM).", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 532, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 546 + ], + "score": 1.0, + "content": "The result is then propagated further up the tree. Backpropagation over the tree structure is known as", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 543, + 359, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 359, + 556 + ], + "score": 1.0, + "content": "backpropagation through structure (Goller and Kuchler, 1996).", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 456, + 506, + 556 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 560, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 560, + 505, + 573 + ], + "score": 1.0, + "content": "Graph neural networks (Scarselli et al., 2009; Li et al., 2015; Gilmer et al., 2017) combine both the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 571, + 507, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 507, + 585 + ], + "score": 1.0, + "content": "temporal recurrence and recurrence over the structure. GNNs can be seen as performing aggrega-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 583, + 435, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 435, + 595 + ], + "score": 1.0, + "content": "tion/distribution operations over a general graph structure with shared parameters.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 560, + 507, + 595 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 599, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "Apart from the models above, there exist many recently proposed models with flexible control flow", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "score": 1.0, + "content": "(e.g. hierarchical memory networks (Chandar et al., 2016), neural programmer interpreters (Reed", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "and De Freitas, 2015), adaptive computation networks (Graves, 2016; Figurnov et al., 2016), and", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 633, + 493, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 493, + 645 + ], + "score": 1.0, + "content": "sparsely-gated mixture of experts (Shazeer et al., 2017), to which our framework can be applied.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 599, + 506, + 645 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 663, + 365, + 675 + ], + "lines": [ + { + "bbox": [ + 104, + 661, + 366, + 677 + ], + "spans": [ + { + "bbox": [ + 104, + 661, + 366, + 677 + ], + "score": 1.0, + "content": "3 ASYNCHRONOUS MODEL-PARALLEL TRAINING", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "score": 1.0, + "content": "In AMP training, each node of a computation graph (including control flow nodes – see next section)", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "is associated with a worker, which is an abstraction of a compute device. Neural network training", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "and inference is carried out by message passing among workers following algorithm 1. All workers", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "run in parallel without synchronization. Each message contains a payload (float or int tensor), as", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "well as a state that includes the IDs of the source and sink nodes and a label indicating the type of", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 506, + 106 + ], + "score": 1.0, + "content": "message (forward, backward, or update). The state is used to keep track of algorithm and control flow", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "information. For example, in a variable-length RNN the state also contains the instance identifier,", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "the current position in the sequence, and the total sequence length for the instance. More generally,", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 125, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 506, + 140 + ], + "score": 1.0, + "content": "if the neural model use (possibly nested) loops, then the state for the messages that arrive to and", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 136, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 506, + 151 + ], + "score": 1.0, + "content": "are produced from nodes that logically belong in loop bodies will contain sets of loop counters that", + "type": "text", + "cross_page": true + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 149, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 506, + 161 + ], + "score": 1.0, + "content": "together with the instance id uniquely identify the messages throughout the course of the computation.", + "type": "text", + "cross_page": true + } + ], + "index": 6 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 688, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 160 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "well as a state that includes the IDs of the source and sink nodes and a label indicating the type of", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 506, + 106 + ], + "score": 1.0, + "content": "message (forward, backward, or update). The state is used to keep track of algorithm and control flow", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "information. For example, in a variable-length RNN the state also contains the instance identifier,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "the current position in the sequence, and the total sequence length for the instance. More generally,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 125, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 506, + 140 + ], + "score": 1.0, + "content": "if the neural model use (possibly nested) loops, then the state for the messages that arrive to and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 136, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 506, + 151 + ], + "score": 1.0, + "content": "are produced from nodes that logically belong in loop bodies will contain sets of loop counters that", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 149, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 506, + 161 + ], + "score": 1.0, + "content": "together with the instance id uniquely identify the messages throughout the course of the computation.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 165, + 505, + 275 + ], + "lines": [ + { + "bbox": [ + 105, + 164, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 178 + ], + "score": 1.0, + "content": "When a worker receives a message labeled as forward (or backward) then it performs the operation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "of the node indicated by the sink node ID on the supplied payload. This produces one or more", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "outgoing messages that are then enqueued into the queues of the workers hosting the next sink nodes", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 196, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 505, + 212 + ], + "score": 1.0, + "content": "in the computation graph. The final loss layer initiates backward propagation. If the message type", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "is update, the worker will carry out weight updates on the sink node using gradients accumulated", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 221, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 232 + ], + "score": 1.0, + "content": "in the appropriate slot in the worker’s local memory. Since both the operation weights and weight", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 506, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 506, + 244 + ], + "score": 1.0, + "content": "gradients can be stored locally on the worker then workers only need to communicate activations and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "activation gradients, which are typically an order of magnitude smaller than the weights. The update", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "message is typically sent from the sink node to itself as part of the backward process but it can also", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 262, + 404, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 404, + 278 + ], + "score": 1.0, + "content": "be sent from a controller node to simulate synchronous pipelined training.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 281, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 280, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 506, + 294 + ], + "score": 1.0, + "content": "There are two important details that are not fully spelled out in Algorithm 1. First, since the messages", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 292, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 106, + 292, + 505, + 303 + ], + "score": 1.0, + "content": "arrive asynchronously (and possibly out of order), any operation that has more than one parent nodes", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 303, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 506, + 316 + ], + "score": 1.0, + "content": "need to store the payload into its local cache until all the parents send the corresponding payloads.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 313, + 504, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 504, + 326 + ], + "score": 1.0, + "content": "Thus output message(s) can only be produced when all the payloads become available. The cache", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 325, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 506, + 338 + ], + "score": 1.0, + "content": "needs to be able to distinguish payloads received from different parents and payloads with different", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "instance ID, and different counters (all encoded in the message states). The same is true in the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 355, + 359 + ], + "score": 1.0, + "content": "backward pass for a node with multiple child nodes. Second,", + "type": "text" + }, + { + "bbox": [ + 356, + 347, + 373, + 358 + ], + "score": 0.89, + "content": "{ \\tt o p } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 346, + 506, + 359 + ], + "score": 1.0, + "content": "denotes the adjoint operation of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 358, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 371 + ], + "score": 1.0, + "content": "op and takes the backward message msg and potentially the forward message fwd msg stored in", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "score": 1.0, + "content": "the cache. For a nonlinear activation node (e.g., ReLU), the node will not change the state of the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 380, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 392 + ], + "score": 1.0, + "content": "message in the forward pass. Thus in the backward pass, the adjoint operation will just multiply the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 389, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 104, + 389, + 506, + 404 + ], + "score": 1.0, + "content": "partial derivative of the activation function to the payload of the received backward message keeping", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 505, + 414 + ], + "score": 1.0, + "content": "the state unchanged. By contrast, an operation that only changes the state of the message in the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "score": 1.0, + "content": "forward pass (e.g., increment the loop counter) will reverse the change in the backward pass leaving", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 424, + 203, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 203, + 436 + ], + "score": 1.0, + "content": "the payload unchanged.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 109, + 440, + 446, + 452 + ], + "lines": [ + { + "bbox": [ + 105, + 438, + 449, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 449, + 455 + ], + "score": 1.0, + "content": "In the experiments we vary two hyper parameters to control the effect of asynchrony:", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 457, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "min update interval: determines the minimum number of gradients that a parameterized", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "operation needs to accumulate before it can update its parameters (using the update message). The", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "staleness of a gradient can be measured by the number of updates between the forward and backward", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 491, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 505, + 502 + ], + "score": 1.0, + "content": "computation that produces the gradient. Small min update interval may increase gradient", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 501, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 506, + 514 + ], + "score": 1.0, + "content": "staleness. On the other hand, large min update interval can reduce the variance of the gradient", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 512, + 405, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 405, + 525 + ], + "score": 1.0, + "content": "but can result in very infrequent updates and also slow down convergence.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 529, + 505, + 584 + ], + "lines": [ + { + "bbox": [ + 105, + 529, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 542 + ], + "score": 1.0, + "content": "max active keys: controls the maximum number of active instances that are in-flight at any", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 540, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 282, + 553 + ], + "score": 1.0, + "content": "point in time. By setting max active key", + "type": "text" + }, + { + "bbox": [ + 282, + 540, + 308, + 551 + ], + "score": 0.67, + "content": "\\mathbf { \\boldsymbol { s } } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 540, + 505, + 553 + ], + "score": 1.0, + "content": "we restrict to single-instance processing, typically", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 551, + 507, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 507, + 564 + ], + "score": 1.0, + "content": "equivalent to synchronous training. More in-flight messages generally increase hardware utilization,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 562, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 562, + 506, + 574 + ], + "score": 1.0, + "content": "but may also increase gradient staleness. Section 6 demonstrates the effects of these parameters in a", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 573, + 208, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 208, + 585 + ], + "score": 1.0, + "content": "multi-core CPU runtime.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40 + }, + { + "type": "title", + "bbox": [ + 108, + 608, + 213, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 608, + 215, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 215, + 620 + ], + "score": 1.0, + "content": "3.1 WORKER AFFINITY", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 358, + 646 + ], + "score": 1.0, + "content": "In our asynchronous execution model, the optimal assignment of", + "type": "text" + }, + { + "bbox": [ + 358, + 633, + 369, + 643 + ], + "score": 0.79, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "neural network computation graph", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 142, + 656 + ], + "score": 1.0, + "content": "nodes to", + "type": "text" + }, + { + "bbox": [ + 142, + 644, + 154, + 654 + ], + "score": 0.51, + "content": "W", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "workers (referred to as affinitization) is in general a non-trivial scheduling problem. We", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 655, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 365, + 667 + ], + "score": 1.0, + "content": "investigated several heuristics for assigning affinities (for example", + "type": "text" + }, + { + "bbox": [ + 366, + 655, + 372, + 665 + ], + "score": 0.34, + "content": "\\mathbf { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 655, + 506, + 667 + ], + "score": 1.0, + "content": "-hop coloring (Ichrak et al., 2012)", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "to ensure subsequent heavy operations were assigned different workers). However, we find that the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "following procedure achieves high performance in practice in our multi-core CPU implementation,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 687, + 504, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 493, + 700 + ], + "score": 1.0, + "content": "and is adopted throughout our experiments for simplicity. We first partition the nodes into", + "type": "text" + }, + { + "bbox": [ + 493, + 688, + 504, + 698 + ], + "score": 0.69, + "content": "H", + "type": "inline_equation" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 316, + 711 + ], + "score": 1.0, + "content": "’heavy’ operations (namely matrix multiplies) and", + "type": "text" + }, + { + "bbox": [ + 316, + 699, + 355, + 710 + ], + "score": 0.89, + "content": "( N - H )", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "’light’ operations, and then balance", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 707, + 507, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 324, + 723 + ], + "score": 1.0, + "content": "the heavy nodes across the workers by affinitizing the", + "type": "text" + }, + { + "bbox": [ + 325, + 710, + 339, + 720 + ], + "score": 0.83, + "content": "h ^ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 707, + 376, + 723 + ], + "score": 1.0, + "content": "with the", + "type": "text" + }, + { + "bbox": [ + 377, + 709, + 438, + 722 + ], + "score": 0.81, + "content": "( h \\mod W ) ^ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 707, + 507, + 723 + ], + "score": 1.0, + "content": "worker. Finally,", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "the light operations are affinitized randomly among the rest of the workers. Note that in scenarios", + "type": "text" + } + ], + "index": 52 + } + ], + "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, + 160 + ], + "lines": [], + "index": 3, + "bbox_fs": [ + 105, + 81, + 506, + 161 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 165, + 505, + 275 + ], + "lines": [ + { + "bbox": [ + 105, + 164, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 178 + ], + "score": 1.0, + "content": "When a worker receives a message labeled as forward (or backward) then it performs the operation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "of the node indicated by the sink node ID on the supplied payload. This produces one or more", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "outgoing messages that are then enqueued into the queues of the workers hosting the next sink nodes", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 196, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 196, + 505, + 212 + ], + "score": 1.0, + "content": "in the computation graph. The final loss layer initiates backward propagation. If the message type", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "is update, the worker will carry out weight updates on the sink node using gradients accumulated", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 221, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 232 + ], + "score": 1.0, + "content": "in the appropriate slot in the worker’s local memory. Since both the operation weights and weight", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 506, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 506, + 244 + ], + "score": 1.0, + "content": "gradients can be stored locally on the worker then workers only need to communicate activations and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "activation gradients, which are typically an order of magnitude smaller than the weights. The update", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "message is typically sent from the sink node to itself as part of the backward process but it can also", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 262, + 404, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 404, + 278 + ], + "score": 1.0, + "content": "be sent from a controller node to simulate synchronous pipelined training.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 164, + 506, + 278 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 281, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 280, + 506, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 506, + 294 + ], + "score": 1.0, + "content": "There are two important details that are not fully spelled out in Algorithm 1. First, since the messages", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 292, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 106, + 292, + 505, + 303 + ], + "score": 1.0, + "content": "arrive asynchronously (and possibly out of order), any operation that has more than one parent nodes", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 303, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 506, + 316 + ], + "score": 1.0, + "content": "need to store the payload into its local cache until all the parents send the corresponding payloads.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 313, + 504, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 504, + 326 + ], + "score": 1.0, + "content": "Thus output message(s) can only be produced when all the payloads become available. The cache", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 325, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 506, + 338 + ], + "score": 1.0, + "content": "needs to be able to distinguish payloads received from different parents and payloads with different", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "instance ID, and different counters (all encoded in the message states). The same is true in the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 355, + 359 + ], + "score": 1.0, + "content": "backward pass for a node with multiple child nodes. Second,", + "type": "text" + }, + { + "bbox": [ + 356, + 347, + 373, + 358 + ], + "score": 0.89, + "content": "{ \\tt o p } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 346, + 506, + 359 + ], + "score": 1.0, + "content": "denotes the adjoint operation of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 358, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 371 + ], + "score": 1.0, + "content": "op and takes the backward message msg and potentially the forward message fwd msg stored in", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "score": 1.0, + "content": "the cache. For a nonlinear activation node (e.g., ReLU), the node will not change the state of the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 380, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 392 + ], + "score": 1.0, + "content": "message in the forward pass. Thus in the backward pass, the adjoint operation will just multiply the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 389, + 506, + 404 + ], + "spans": [ + { + "bbox": [ + 104, + 389, + 506, + 404 + ], + "score": 1.0, + "content": "partial derivative of the activation function to the payload of the received backward message keeping", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 402, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 505, + 414 + ], + "score": 1.0, + "content": "the state unchanged. By contrast, an operation that only changes the state of the message in the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 506, + 426 + ], + "score": 1.0, + "content": "forward pass (e.g., increment the loop counter) will reverse the change in the backward pass leaving", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 424, + 203, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 203, + 436 + ], + "score": 1.0, + "content": "the payload unchanged.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 23.5, + "bbox_fs": [ + 104, + 280, + 506, + 436 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 440, + 446, + 452 + ], + "lines": [ + { + "bbox": [ + 105, + 438, + 449, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 449, + 455 + ], + "score": 1.0, + "content": "In the experiments we vary two hyper parameters to control the effect of asynchrony:", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 438, + 449, + 455 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 457, + 505, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "min update interval: determines the minimum number of gradients that a parameterized", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "operation needs to accumulate before it can update its parameters (using the update message). The", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 479, + 505, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 505, + 491 + ], + "score": 1.0, + "content": "staleness of a gradient can be measured by the number of updates between the forward and backward", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 491, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 505, + 502 + ], + "score": 1.0, + "content": "computation that produces the gradient. Small min update interval may increase gradient", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 501, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 501, + 506, + 514 + ], + "score": 1.0, + "content": "staleness. On the other hand, large min update interval can reduce the variance of the gradient", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 512, + 405, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 405, + 525 + ], + "score": 1.0, + "content": "but can result in very infrequent updates and also slow down convergence.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 457, + 506, + 525 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 529, + 505, + 584 + ], + "lines": [ + { + "bbox": [ + 105, + 529, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 542 + ], + "score": 1.0, + "content": "max active keys: controls the maximum number of active instances that are in-flight at any", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 540, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 282, + 553 + ], + "score": 1.0, + "content": "point in time. By setting max active key", + "type": "text" + }, + { + "bbox": [ + 282, + 540, + 308, + 551 + ], + "score": 0.67, + "content": "\\mathbf { \\boldsymbol { s } } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 540, + 505, + 553 + ], + "score": 1.0, + "content": "we restrict to single-instance processing, typically", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 551, + 507, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 551, + 507, + 564 + ], + "score": 1.0, + "content": "equivalent to synchronous training. More in-flight messages generally increase hardware utilization,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 562, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 562, + 506, + 574 + ], + "score": 1.0, + "content": "but may also increase gradient staleness. Section 6 demonstrates the effects of these parameters in a", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 573, + 208, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 208, + 585 + ], + "score": 1.0, + "content": "multi-core CPU runtime.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 529, + 507, + 585 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 608, + 213, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 608, + 215, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 215, + 620 + ], + "score": 1.0, + "content": "3.1 WORKER AFFINITY", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 358, + 646 + ], + "score": 1.0, + "content": "In our asynchronous execution model, the optimal assignment of", + "type": "text" + }, + { + "bbox": [ + 358, + 633, + 369, + 643 + ], + "score": 0.79, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "neural network computation graph", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 142, + 656 + ], + "score": 1.0, + "content": "nodes to", + "type": "text" + }, + { + "bbox": [ + 142, + 644, + 154, + 654 + ], + "score": 0.51, + "content": "W", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "workers (referred to as affinitization) is in general a non-trivial scheduling problem. We", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 655, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 365, + 667 + ], + "score": 1.0, + "content": "investigated several heuristics for assigning affinities (for example", + "type": "text" + }, + { + "bbox": [ + 366, + 655, + 372, + 665 + ], + "score": 0.34, + "content": "\\mathbf { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 655, + 506, + 667 + ], + "score": 1.0, + "content": "-hop coloring (Ichrak et al., 2012)", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "to ensure subsequent heavy operations were assigned different workers). However, we find that the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "following procedure achieves high performance in practice in our multi-core CPU implementation,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 687, + 504, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 493, + 700 + ], + "score": 1.0, + "content": "and is adopted throughout our experiments for simplicity. We first partition the nodes into", + "type": "text" + }, + { + "bbox": [ + 493, + 688, + 504, + 698 + ], + "score": 0.69, + "content": "H", + "type": "inline_equation" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 316, + 711 + ], + "score": 1.0, + "content": "’heavy’ operations (namely matrix multiplies) and", + "type": "text" + }, + { + "bbox": [ + 316, + 699, + 355, + 710 + ], + "score": 0.89, + "content": "( N - H )", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "’light’ operations, and then balance", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 707, + 507, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 324, + 723 + ], + "score": 1.0, + "content": "the heavy nodes across the workers by affinitizing the", + "type": "text" + }, + { + "bbox": [ + 325, + 710, + 339, + 720 + ], + "score": 0.83, + "content": "h ^ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 707, + 376, + 723 + ], + "score": 1.0, + "content": "with the", + "type": "text" + }, + { + "bbox": [ + 377, + 709, + 438, + 722 + ], + "score": 0.81, + "content": "( h \\mod W ) ^ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 707, + 507, + 723 + ], + "score": 1.0, + "content": "worker. Finally,", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "the light operations are affinitized randomly among the rest of the workers. Note that in scenarios", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 240, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 254 + ], + "score": 1.0, + "content": "where communication is over a physical network affinitization will become more critical for high", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 252, + 162, + 264 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 162, + 264 + ], + "score": 1.0, + "content": "performance.", + "type": "text", + "cross_page": true + } + ], + "index": 5 + } + ], + "index": 48, + "bbox_fs": [ + 105, + 633, + 507, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 174, + 81, + 436, + 191 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 174, + 81, + 436, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 174, + 81, + 436, + 191 + ], + "spans": [ + { + "bbox": [ + 174, + 81, + 436, + 191 + ], + "score": 0.969, + "type": "image", + "image_path": "05546d60c49a3bb63bc9a2abaa8d81d264c7b6f479acb7c5ca1109ff70b82680.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 174, + 81, + 436, + 117.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 174, + 117.66666666666666, + 436, + 154.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 174, + 154.33333333333331, + 436, + 190.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 199, + 201, + 412, + 213 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 198, + 200, + 412, + 214 + ], + "spans": [ + { + "bbox": [ + 198, + 200, + 412, + 214 + ], + "score": 1.0, + "content": "Figure 3: Distribution based on dynamic information", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 504, + 264 + ], + "lines": [ + { + "bbox": [ + 105, + 240, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 254 + ], + "score": 1.0, + "content": "where communication is over a physical network affinitization will become more critical for high", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 252, + 162, + 264 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 162, + 264 + ], + "score": 1.0, + "content": "performance.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "title", + "bbox": [ + 106, + 284, + 503, + 296 + ], + "lines": [ + { + "bbox": [ + 106, + 283, + 504, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 504, + 297 + ], + "score": 1.0, + "content": "4 A STATIC INTERMEDIATE REPRESENTATION FOR DYNAMIC CONTROL FLOW", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 309, + 505, + 420 + ], + "lines": [ + { + "bbox": [ + 105, + 309, + 506, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 506, + 323 + ], + "score": 1.0, + "content": "Overview Computation graphs are expressed using a static intermediate representation (IR) that", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 321, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 485, + 333 + ], + "score": 1.0, + "content": "can be a compilation target for high-level libraries (e.g. TensorFlow or our own Python and", + "type": "text" + }, + { + "bbox": [ + 486, + 321, + 506, + 331 + ], + "score": 0.86, + "content": "\\mathrm { C } { + + }", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 331, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 506, + 345 + ], + "score": 1.0, + "content": "frontends), and can itself admit multiple backends (e.g. the multi-core CPU runtime in this paper, or a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 343, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 506, + 356 + ], + "score": 1.0, + "content": "network of accelerators). Static means that the IR graph is instance-independent. Nevertheless, it can", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 354, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 506, + 367 + ], + "score": 1.0, + "content": "execute dynamic and instance-dependent control flow decisions, in a forward and backward manner,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 365, + 506, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 506, + 377 + ], + "score": 1.0, + "content": "by storing instance- and iteration-dependent information as the computation evolves. Each IR node", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "comes with a forward and a backward semantics. A model is specified by (i) an IR graph, and (ii) a", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 386, + 507, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 507, + 399 + ], + "score": 1.0, + "content": "specialized controller loop that pumps instances and other data (e.g. initial hidden states or labels),", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 398, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 398, + 506, + 410 + ], + "score": 1.0, + "content": "and is responsible for throttling asynchrony. In the rest of this section we discuss the most important", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 409, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 506, + 421 + ], + "score": 1.0, + "content": "IR nodes along with their operational semantics, and show how they are used in the example models.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 435, + 506, + 524 + ], + "lines": [ + { + "bbox": [ + 106, + 436, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 506, + 448 + ], + "score": 1.0, + "content": "Payload transformations Parameterized payload transform (PPT) nodes can be used to encode,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 446, + 506, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 506, + 460 + ], + "score": 1.0, + "content": "for instance, fully connected layers. They apply a transform in the forward pass, but also record the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "score": 1.0, + "content": "activation in order to use it to compute gradients in the backward pass. An activation is recorded by", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 469, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 506, + 481 + ], + "score": 1.0, + "content": "keying on the state of the message, allowing thus to process forward and backwards messages com-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 480, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 106, + 480, + 505, + 492 + ], + "score": 1.0, + "content": "pletely asynchronously, and – in the extreme case – out of order. A PPT node requires specification", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 490, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 505, + 502 + ], + "score": 1.0, + "content": "of the forward and the backward transformation. It may decide to independently apply accumulated", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 501, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 506, + 514 + ], + "score": 1.0, + "content": "gradients to update its parameters. For transformations that do not involve parameters (e.g. ReLUs)", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 513, + 356, + 525 + ], + "spans": [ + { + "bbox": [ + 106, + 513, + 356, + 525 + ], + "score": 1.0, + "content": "our IR offers a simpler non-parameterized payload transform.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 341, + 552 + ], + "score": 1.0, + "content": "Loops, state, and control flow A condition node (Cond", + "type": "text" + }, + { + "bbox": [ + 342, + 540, + 349, + 551 + ], + "score": 0.77, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 540, + 479, + 552 + ], + "score": 1.0, + "content": ") is parameterized by a function", + "type": "text" + }, + { + "bbox": [ + 479, + 540, + 486, + 551 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 540, + 506, + 552 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "queries the state (but not the payload) of the incoming message and, based on the response, routes", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 562, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 562, + 505, + 574 + ], + "score": 1.0, + "content": "the input to one of the successor nodes. A join node (Phi) propagates the messages it receives from", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "each of its ancestor nodes but records the origin (using the state of the message as the key) so that in", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "the backward pass it can backpropagate them to the correct origin. An invertible state update node", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 593, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 156, + 605 + ], + "score": 0.65, + "content": "( \\mathtt { I s u } \\ f \\ f ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 593, + 293, + 608 + ], + "score": 1.0, + "content": "is parameterized by two functions", + "type": "text" + }, + { + "bbox": [ + 293, + 594, + 301, + 606 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 593, + 318, + 608 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 318, + 594, + 336, + 606 + ], + "score": 0.92, + "content": "f ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 593, + 506, + 608 + ], + "score": 1.0, + "content": "that operate on the state of a message, and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 604, + 405, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 135, + 618 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + }, + { + "bbox": [ + 135, + 605, + 199, + 617 + ], + "score": 0.92, + "content": "\\bar { f } ^ { - 1 } ( f ( \\bar { x } ) ) = x", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 604, + 405, + 618 + ], + "score": 1.0, + "content": ". Typically these are loop counter update functions.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "Figure 2 shows how to encode an RNN. The loop at the heart of the RNN is implemented with", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 633, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 506, + 646 + ], + "score": 1.0, + "content": "Cond, Phi and Isu nodes. The controller pumps sequences in a lookup table (just another PPT", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "layer), and our Ungroup node (to be described in the next section) generates a stream of tensors each", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "corresponding to a single token, tagged with the current time-step (loop counter). For each forward", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "message, the Isu node increments the time-step, and the conditional node tests whether the end of", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "the sequence has been reached. Depending on the answer it either propagates the hidden state back", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 686, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 506, + 701 + ], + "score": 1.0, + "content": "to Phi, or pushes the hidden state to the final linear and loss layers. In backward mode, messages", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "pass through the Isu (which decrements the time-step), and reach the Phi node. The Phi node will", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "(based on information from the forward phase) either back-propagate to the Cond node, or to the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 721, + 488, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 488, + 732 + ], + "score": 1.0, + "content": "controller to terminate. Hence the loop is executed in both the forward and backward direction.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 36.5 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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" + } + ] + } + ] + }, + { + "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" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 174, + 81, + 436, + 191 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 174, + 81, + 436, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 174, + 81, + 436, + 191 + ], + "spans": [ + { + "bbox": [ + 174, + 81, + 436, + 191 + ], + "score": 0.969, + "type": "image", + "image_path": "05546d60c49a3bb63bc9a2abaa8d81d264c7b6f479acb7c5ca1109ff70b82680.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 174, + 81, + 436, + 117.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 174, + 117.66666666666666, + 436, + 154.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 174, + 154.33333333333331, + 436, + 190.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 199, + 201, + 412, + 213 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 198, + 200, + 412, + 214 + ], + "spans": [ + { + "bbox": [ + 198, + 200, + 412, + 214 + ], + "score": 1.0, + "content": "Figure 3: Distribution based on dynamic information", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 504, + 264 + ], + "lines": [], + "index": 4.5, + "bbox_fs": [ + 105, + 240, + 505, + 264 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 106, + 284, + 503, + 296 + ], + "lines": [ + { + "bbox": [ + 106, + 283, + 504, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 504, + 297 + ], + "score": 1.0, + "content": "4 A STATIC INTERMEDIATE REPRESENTATION FOR DYNAMIC CONTROL FLOW", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 309, + 505, + 420 + ], + "lines": [ + { + "bbox": [ + 105, + 309, + 506, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 506, + 323 + ], + "score": 1.0, + "content": "Overview Computation graphs are expressed using a static intermediate representation (IR) that", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 321, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 485, + 333 + ], + "score": 1.0, + "content": "can be a compilation target for high-level libraries (e.g. TensorFlow or our own Python and", + "type": "text" + }, + { + "bbox": [ + 486, + 321, + 506, + 331 + ], + "score": 0.86, + "content": "\\mathrm { C } { + + }", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 331, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 506, + 345 + ], + "score": 1.0, + "content": "frontends), and can itself admit multiple backends (e.g. the multi-core CPU runtime in this paper, or a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 343, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 506, + 356 + ], + "score": 1.0, + "content": "network of accelerators). Static means that the IR graph is instance-independent. Nevertheless, it can", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 354, + 506, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 506, + 367 + ], + "score": 1.0, + "content": "execute dynamic and instance-dependent control flow decisions, in a forward and backward manner,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 365, + 506, + 377 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 506, + 377 + ], + "score": 1.0, + "content": "by storing instance- and iteration-dependent information as the computation evolves. Each IR node", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "comes with a forward and a backward semantics. A model is specified by (i) an IR graph, and (ii) a", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 386, + 507, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 507, + 399 + ], + "score": 1.0, + "content": "specialized controller loop that pumps instances and other data (e.g. initial hidden states or labels),", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 398, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 398, + 506, + 410 + ], + "score": 1.0, + "content": "and is responsible for throttling asynchrony. In the rest of this section we discuss the most important", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 409, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 506, + 421 + ], + "score": 1.0, + "content": "IR nodes along with their operational semantics, and show how they are used in the example models.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 309, + 507, + 421 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 435, + 506, + 524 + ], + "lines": [ + { + "bbox": [ + 106, + 436, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 506, + 448 + ], + "score": 1.0, + "content": "Payload transformations Parameterized payload transform (PPT) nodes can be used to encode,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 446, + 506, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 506, + 460 + ], + "score": 1.0, + "content": "for instance, fully connected layers. They apply a transform in the forward pass, but also record the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "score": 1.0, + "content": "activation in order to use it to compute gradients in the backward pass. An activation is recorded by", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 469, + 506, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 506, + 481 + ], + "score": 1.0, + "content": "keying on the state of the message, allowing thus to process forward and backwards messages com-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 480, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 106, + 480, + 505, + 492 + ], + "score": 1.0, + "content": "pletely asynchronously, and – in the extreme case – out of order. A PPT node requires specification", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 490, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 505, + 502 + ], + "score": 1.0, + "content": "of the forward and the backward transformation. It may decide to independently apply accumulated", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 501, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 506, + 514 + ], + "score": 1.0, + "content": "gradients to update its parameters. For transformations that do not involve parameters (e.g. ReLUs)", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 513, + 356, + 525 + ], + "spans": [ + { + "bbox": [ + 106, + 513, + 356, + 525 + ], + "score": 1.0, + "content": "our IR offers a simpler non-parameterized payload transform.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 436, + 506, + 525 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 540, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 341, + 552 + ], + "score": 1.0, + "content": "Loops, state, and control flow A condition node (Cond", + "type": "text" + }, + { + "bbox": [ + 342, + 540, + 349, + 551 + ], + "score": 0.77, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 540, + 479, + 552 + ], + "score": 1.0, + "content": ") is parameterized by a function", + "type": "text" + }, + { + "bbox": [ + 479, + 540, + 486, + 551 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 540, + 506, + 552 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "queries the state (but not the payload) of the incoming message and, based on the response, routes", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 562, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 562, + 505, + 574 + ], + "score": 1.0, + "content": "the input to one of the successor nodes. A join node (Phi) propagates the messages it receives from", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "each of its ancestor nodes but records the origin (using the state of the message as the key) so that in", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "the backward pass it can backpropagate them to the correct origin. An invertible state update node", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 593, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 156, + 605 + ], + "score": 0.65, + "content": "( \\mathtt { I s u } \\ f \\ f ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 593, + 293, + 608 + ], + "score": 1.0, + "content": "is parameterized by two functions", + "type": "text" + }, + { + "bbox": [ + 293, + 594, + 301, + 606 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 593, + 318, + 608 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 318, + 594, + 336, + 606 + ], + "score": 0.92, + "content": "f ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 593, + 506, + 608 + ], + "score": 1.0, + "content": "that operate on the state of a message, and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 604, + 405, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 135, + 618 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + }, + { + "bbox": [ + 135, + 605, + 199, + 617 + ], + "score": 0.92, + "content": "\\bar { f } ^ { - 1 } ( f ( \\bar { x } ) ) = x", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 604, + 405, + 618 + ], + "score": 1.0, + "content": ". Typically these are loop counter update functions.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 540, + 506, + 618 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "Figure 2 shows how to encode an RNN. The loop at the heart of the RNN is implemented with", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 633, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 506, + 646 + ], + "score": 1.0, + "content": "Cond, Phi and Isu nodes. The controller pumps sequences in a lookup table (just another PPT", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "layer), and our Ungroup node (to be described in the next section) generates a stream of tensors each", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "corresponding to a single token, tagged with the current time-step (loop counter). For each forward", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "message, the Isu node increments the time-step, and the conditional node tests whether the end of", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "the sequence has been reached. Depending on the answer it either propagates the hidden state back", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 686, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 506, + 701 + ], + "score": 1.0, + "content": "to Phi, or pushes the hidden state to the final linear and loss layers. In backward mode, messages", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "pass through the Isu (which decrements the time-step), and reach the Phi node. The Phi node will", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "(based on information from the forward phase) either back-propagate to the Cond node, or to the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 721, + 488, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 488, + 732 + ], + "score": 1.0, + "content": "controller to terminate. Hence the loop is executed in both the forward and backward direction.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 36.5, + "bbox_fs": [ + 104, + 622, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 86, + 473, + 226 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 86, + 473, + 226 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 86, + 473, + 226 + ], + "spans": [ + { + "bbox": [ + 109, + 86, + 473, + 226 + ], + "score": 0.972, + "type": "image", + "image_path": "09f7aa446951696f32af43edccbcf5dc7b775fea5217c39a8ac79143df2a7033.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 86, + 473, + 132.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 132.66666666666666, + 473, + 179.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 179.33333333333331, + 473, + 225.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 239, + 504, + 273 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 239, + 506, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 506, + 253 + ], + "score": 1.0, + "content": "Figure 4: IR graphs for (a) Gated Graph Neural Network and (b) RNN-with-replicas. The RNNCell", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 250, + 506, + 264 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 506, + 264 + ], + "score": 1.0, + "content": "in (a) denotes a recurrent structure (e.g. GRU, LSTM), the details of which we omit. Cond modId in", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 261, + 491, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 491, + 275 + ], + "score": 1.0, + "content": "(b) implements a round-robin branching to different replicas by computing (instance ID mod 3).", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 292, + 505, + 392 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 506, + 307 + ], + "score": 1.0, + "content": "Aggregation and disaggregation Our IR offers several constructs for aggregation and disagreg-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 303, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 505, + 316 + ], + "score": 1.0, + "content": "gation; for example RNN requires us to concatenate (Concat) hidden states and embeddings with", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 314, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 506, + 329 + ], + "score": 1.0, + "content": "matching timesteps and instance ids (states). We offer a construct for broadcasting (Bcast) a message", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "to multiple successors. We offer an ungrouping construct (Ungroup) that ungroups a matrix and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 337, + 506, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 506, + 350 + ], + "score": 1.0, + "content": "emits all resulting messages tagged with an extra user-provided increasing loop counter. This allows", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 348, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 505, + 360 + ], + "score": 1.0, + "content": "us to insert the stream of token embeddings in the middle of the RNN loop in Figure 2. In backward", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 357, + 507, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 507, + 372 + ], + "score": 1.0, + "content": "mode Ungroup groups back all the incoming gradients. A simpler variant of Ungroup is Replicate,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 369, + 506, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 506, + 382 + ], + "score": 1.0, + "content": "which replicates a message with an extra loop counter in the state. In backwards mode Replicate", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 380, + 468, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 468, + 394 + ], + "score": 1.0, + "content": "sums up all incoming gradients that correspond to the state without the extra loop counter.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 397, + 505, + 496 + ], + "lines": [ + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "score": 1.0, + "content": "Figure 4(a) describes a GNN that combines aggregation on the structure of a graph instance with an", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 408, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 505, + 421 + ], + "score": 1.0, + "content": "outer loop. The controller pumps data that contain the feature embeddings of all nodes of an input", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 419, + 506, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 506, + 432 + ], + "score": 1.0, + "content": "graph. In addition it pumps in a map specifiying graph topology. The Distribute node uses that", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "score": 1.0, + "content": "information along with the graph itself to create sub-matrices (here each corresponding to edge types)", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 441, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 506, + 454 + ], + "score": 1.0, + "content": "and pass them through linear (fully connected) layers. The Collect node collects and re-groups the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 451, + 507, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 507, + 466 + ], + "score": 1.0, + "content": "results based on graph topology. These nodes correspond to a form of dynamic partition and merging.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 464, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 505, + 475 + ], + "score": 1.0, + "content": "Schematically the Distribute behaviour is given in Figure 3. In backward mode, based on the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 474, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 486 + ], + "score": 1.0, + "content": "control information received during the forward pass (gray line) re-groups the gradients and sums", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 485, + 499, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 499, + 498 + ], + "score": 1.0, + "content": "together those that correspond to the same index. The Collect operator is essentially symmetric.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 19 + }, + { + "type": "title", + "bbox": [ + 107, + 513, + 358, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 360, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 360, + 527 + ], + "score": 1.0, + "content": "5 DATA PARALLELISM IN MODEL PARALLELISM", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 537, + 505, + 668 + ], + "lines": [ + { + "bbox": [ + 106, + 537, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 505, + 550 + ], + "score": 1.0, + "content": "Pipelined model parallelism can often be augmented with forms of data parallelism. Consider the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 548, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 505, + 560 + ], + "score": 1.0, + "content": "RNN in Fig. 2. The only heavy operation (Linear-1) in the body of the loop will act as a bottleneck for", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 559, + 506, + 571 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 506, + 571 + ], + "score": 1.0, + "content": "computation. One solution is to split the linear layer into smaller tiles and compute them in parallel.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "score": 1.0, + "content": "This is expressible in our IR but the linear operation needs to be large enough to benefit from tiling in", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "score": 1.0, + "content": "this way. Another approach is to replicate the linear layer in full. This requires only minimal new", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 592, + 505, + 604 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 505, + 604 + ], + "score": 1.0, + "content": "machinery – we can replicate the linear layer and place the replicas inside Cond and Phi nodes as in", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "score": 1.0, + "content": "Figure 4(b). Different instances or messages from the same instance but with different position in", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 614, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 505, + 626 + ], + "score": 1.0, + "content": "the sequence can be processed in an (pipeline-)parallel fashion by being sent to one of the replicas", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 625, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 106, + 625, + 505, + 637 + ], + "score": 1.0, + "content": "chosen by a random or deterministic function of the message state. To enable parameters to be shared", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 635, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 505, + 648 + ], + "score": 1.0, + "content": "among the replicas, we use infrequent end-of-epoch replica synchronization (averaging) that incurs", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 645, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 505, + 660 + ], + "score": 1.0, + "content": "negligible communication cost. We also tried more elaborate message-passing protocols for group", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 658, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 506, + 670 + ], + "score": 1.0, + "content": "synchronization, but found that infrequent global synchronization was sufficient for fast convergence.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 30.5 + }, + { + "type": "title", + "bbox": [ + 108, + 685, + 200, + 697 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 201, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 201, + 699 + ], + "score": 1.0, + "content": "6 EXPERIMENTS", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 722 + ], + "score": 1.0, + "content": "We evaluate AMPNet using the dynamic models introduced in Section 2. For completeness, we", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "additionally consider a multi-layer perceptron (MLP) as an example of a static, batched network", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.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": [ + 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" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 86, + 473, + 226 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 86, + 473, + 226 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 86, + 473, + 226 + ], + "spans": [ + { + "bbox": [ + 109, + 86, + 473, + 226 + ], + "score": 0.972, + "type": "image", + "image_path": "09f7aa446951696f32af43edccbcf5dc7b775fea5217c39a8ac79143df2a7033.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 86, + 473, + 132.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 132.66666666666666, + 473, + 179.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 179.33333333333331, + 473, + 225.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 239, + 504, + 273 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 239, + 506, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 239, + 506, + 253 + ], + "score": 1.0, + "content": "Figure 4: IR graphs for (a) Gated Graph Neural Network and (b) RNN-with-replicas. The RNNCell", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 250, + 506, + 264 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 506, + 264 + ], + "score": 1.0, + "content": "in (a) denotes a recurrent structure (e.g. GRU, LSTM), the details of which we omit. Cond modId in", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 261, + 491, + 275 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 491, + 275 + ], + "score": 1.0, + "content": "(b) implements a round-robin branching to different replicas by computing (instance ID mod 3).", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 292, + 505, + 392 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 506, + 307 + ], + "score": 1.0, + "content": "Aggregation and disaggregation Our IR offers several constructs for aggregation and disagreg-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 303, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 505, + 316 + ], + "score": 1.0, + "content": "gation; for example RNN requires us to concatenate (Concat) hidden states and embeddings with", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 314, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 506, + 329 + ], + "score": 1.0, + "content": "matching timesteps and instance ids (states). We offer a construct for broadcasting (Bcast) a message", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "to multiple successors. We offer an ungrouping construct (Ungroup) that ungroups a matrix and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 337, + 506, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 506, + 350 + ], + "score": 1.0, + "content": "emits all resulting messages tagged with an extra user-provided increasing loop counter. This allows", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 348, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 505, + 360 + ], + "score": 1.0, + "content": "us to insert the stream of token embeddings in the middle of the RNN loop in Figure 2. In backward", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 357, + 507, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 507, + 372 + ], + "score": 1.0, + "content": "mode Ungroup groups back all the incoming gradients. A simpler variant of Ungroup is Replicate,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 369, + 506, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 506, + 382 + ], + "score": 1.0, + "content": "which replicates a message with an extra loop counter in the state. In backwards mode Replicate", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 380, + 468, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 468, + 394 + ], + "score": 1.0, + "content": "sums up all incoming gradients that correspond to the state without the extra loop counter.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 291, + 507, + 394 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 397, + 505, + 496 + ], + "lines": [ + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "score": 1.0, + "content": "Figure 4(a) describes a GNN that combines aggregation on the structure of a graph instance with an", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 408, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 505, + 421 + ], + "score": 1.0, + "content": "outer loop. The controller pumps data that contain the feature embeddings of all nodes of an input", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 419, + 506, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 506, + 432 + ], + "score": 1.0, + "content": "graph. In addition it pumps in a map specifiying graph topology. The Distribute node uses that", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 506, + 443 + ], + "score": 1.0, + "content": "information along with the graph itself to create sub-matrices (here each corresponding to edge types)", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 441, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 506, + 454 + ], + "score": 1.0, + "content": "and pass them through linear (fully connected) layers. The Collect node collects and re-groups the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 451, + 507, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 507, + 466 + ], + "score": 1.0, + "content": "results based on graph topology. These nodes correspond to a form of dynamic partition and merging.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 464, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 505, + 475 + ], + "score": 1.0, + "content": "Schematically the Distribute behaviour is given in Figure 3. In backward mode, based on the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 474, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 486 + ], + "score": 1.0, + "content": "control information received during the forward pass (gray line) re-groups the gradients and sums", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 485, + 499, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 499, + 498 + ], + "score": 1.0, + "content": "together those that correspond to the same index. The Collect operator is essentially symmetric.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 397, + 507, + 498 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 513, + 358, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 360, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 360, + 527 + ], + "score": 1.0, + "content": "5 DATA PARALLELISM IN MODEL PARALLELISM", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 537, + 505, + 668 + ], + "lines": [ + { + "bbox": [ + 106, + 537, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 505, + 550 + ], + "score": 1.0, + "content": "Pipelined model parallelism can often be augmented with forms of data parallelism. Consider the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 548, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 505, + 560 + ], + "score": 1.0, + "content": "RNN in Fig. 2. The only heavy operation (Linear-1) in the body of the loop will act as a bottleneck for", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 559, + 506, + 571 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 506, + 571 + ], + "score": 1.0, + "content": "computation. One solution is to split the linear layer into smaller tiles and compute them in parallel.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "score": 1.0, + "content": "This is expressible in our IR but the linear operation needs to be large enough to benefit from tiling in", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "score": 1.0, + "content": "this way. Another approach is to replicate the linear layer in full. This requires only minimal new", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 592, + 505, + 604 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 505, + 604 + ], + "score": 1.0, + "content": "machinery – we can replicate the linear layer and place the replicas inside Cond and Phi nodes as in", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 506, + 616 + ], + "score": 1.0, + "content": "Figure 4(b). Different instances or messages from the same instance but with different position in", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 614, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 505, + 626 + ], + "score": 1.0, + "content": "the sequence can be processed in an (pipeline-)parallel fashion by being sent to one of the replicas", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 625, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 106, + 625, + 505, + 637 + ], + "score": 1.0, + "content": "chosen by a random or deterministic function of the message state. To enable parameters to be shared", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 635, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 505, + 648 + ], + "score": 1.0, + "content": "among the replicas, we use infrequent end-of-epoch replica synchronization (averaging) that incurs", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 645, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 505, + 660 + ], + "score": 1.0, + "content": "negligible communication cost. We also tried more elaborate message-passing protocols for group", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 658, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 506, + 670 + ], + "score": 1.0, + "content": "synchronization, but found that infrequent global synchronization was sufficient for fast convergence.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 537, + 506, + 670 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 685, + 200, + 697 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 201, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 201, + 699 + ], + "score": 1.0, + "content": "6 EXPERIMENTS", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 722 + ], + "score": 1.0, + "content": "We evaluate AMPNet using the dynamic models introduced in Section 2. For completeness, we", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "additionally consider a multi-layer perceptron (MLP) as an example of a static, batched network", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 708, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 107, + 109, + 505, + 234 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 103, + 82, + 505, + 106 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 94 + ], + "score": 1.0, + "content": "that AMPNet is not specifically designed to tackle. Brief details of the models and data sets in the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 419, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 419, + 106 + ], + "score": 1.0, + "content": "experiments are presented below, and further details are given in Appendix B.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 107, + 109, + 505, + 234 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 109, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 107, + 109, + 505, + 234 + ], + "score": 0.981, + "html": "
ModelData setDifficultyExperiment purpose
MLPMNISTtoyThe standard deep learning bench- mark (for which AMPNet is not
RNNList reductiontoyspecifically designed) The simplest architecture with dy-
Tree-LSTMStanford Sentiment Treebankreal-worldnamic control flow (a for loop) The TensorFlow Fold benchmark for
GNNQM9real-worldbackpropagation through structure Complex control flow with loops over time and structure
", + "type": "table", + "image_path": "61b96a9172c549ef7fac0f812fcfd89bc724c88ddab6413e94a05f94193bdbdb.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 107, + 109, + 505, + 150.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 107, + 150.66666666666666, + 505, + 192.33333333333331 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 107, + 192.33333333333331, + 505, + 233.99999999999997 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 505, + 376 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "Results Our asynchronous runtime is motivated by the promise of emerging hardware (e.g. FPGA", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 265, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 506, + 278 + ], + "score": 1.0, + "content": "accelerators) that fulfill the premises in section 1 and are well suited to dynamic neural network", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 276, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 506, + 290 + ], + "score": 1.0, + "content": "execution. Here we are primarily interested in how the performance of our runtime improves as we", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 288, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 288, + 505, + 300 + ], + "score": 1.0, + "content": "increase the degree of asynchrony (by varying max active keys) while keeping other factors", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 298, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 505, + 311 + ], + "score": 1.0, + "content": "fixed. The aim is to answer the question of whether AMP training is a promising direction for novel", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 308, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 505, + 322 + ], + "score": 1.0, + "content": "distributed hardware that deviates from the CPU/GPU batching paradigm. To answer this question", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 320, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 505, + 333 + ], + "score": 1.0, + "content": "using resources available today we run the AMPNet training using a multi-core CPU runtime where", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 331, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 506, + 344 + ], + "score": 1.0, + "content": "each worker is a hardware thread (see Appendix A). Additionally we forecast the performance on", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "score": 1.0, + "content": "a hypothetical 1TFLOPS device satisfying our premises by replacing all computation nodes by", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 353, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 505, + 365 + ], + "score": 1.0, + "content": "configurable sleep nodes. This allows us to estimate the performance on a new hardware keeping the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 364, + 307, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 307, + 376 + ], + "score": 1.0, + "content": "control flow decisions dynamic. See Appendix C.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 381, + 505, + 425 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "It is also interesting to compare how the raw CPU performance of the AMP runtime compares with", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 391, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 506, + 405 + ], + "score": 1.0, + "content": "existing frameworks (TensorFlow, TensorFlow Fold and DyNet) to see that our implementation is", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 402, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 506, + 416 + ], + "score": 1.0, + "content": "already competitive with state of the art methods even on CPUs that do not conform to our target", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 414, + 412, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 412, + 426 + ], + "score": 1.0, + "content": "hardware model. We provide additional analysis for each experiment below.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 430, + 505, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 430, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 217, + 443 + ], + "score": 1.0, + "content": "On MNIST, Table 1 shows", + "type": "text" + }, + { + "bbox": [ + 217, + 431, + 229, + 441 + ], + "score": 0.62, + "content": "_ { 3 \\mathrm { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 430, + 421, + 443 + ], + "score": 1.0, + "content": "speedup from synchrony (max active keys", + "type": "text" + }, + { + "bbox": [ + 421, + 432, + 441, + 441 + ], + "score": 0.33, + "content": ": = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 430, + 505, + 443 + ], + "score": 1.0, + "content": ") to asynchrony", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 441, + 504, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 189, + 453 + ], + "score": 1.0, + "content": "(max active key", + "type": "text" + }, + { + "bbox": [ + 189, + 442, + 214, + 452 + ], + "score": 0.29, + "content": "s = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 441, + 504, + 453 + ], + "score": 1.0, + "content": ") in terms of throughput. This is almost ideal as the first three linear layers", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "score": 1.0, + "content": "are the heaviest operations. The number of epochs to reach the target validation accuracy increases", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 464, + 506, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 384, + 476 + ], + "score": 1.0, + "content": "from 3 to 4 but the overall speedup in terms of the wall clock time is", + "type": "text" + }, + { + "bbox": [ + 384, + 464, + 403, + 474 + ], + "score": 0.74, + "content": "2 . 2 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 464, + 506, + 476 + ], + "score": 1.0, + "content": ". We have also compared", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 474, + 506, + 488 + ], + "spans": [ + { + "bbox": [ + 104, + 474, + 506, + 488 + ], + "score": 1.0, + "content": "AMP training against pipeline parallel training (Fig. 1 (b)). Figure 5(a) shows that while AMP", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 486, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 301, + 498 + ], + "score": 1.0, + "content": "training achieves 3x throughput gain already with", + "type": "text" + }, + { + "bbox": [ + 301, + 486, + 406, + 497 + ], + "score": 0.36, + "content": "\\mathtt { m a x \\mathrm { _ { - } a c t i v e \\mathrm { _ { - } k e y s = 4 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 486, + 506, + 498 + ], + "score": 1.0, + "content": ", pipeline parallelism can", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 496, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 158, + 509 + ], + "score": 1.0, + "content": "only achieve", + "type": "text" + }, + { + "bbox": [ + 158, + 497, + 170, + 507 + ], + "score": 0.47, + "content": "2 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 497, + 264, + 509 + ], + "score": 1.0, + "content": "(in fact from Fig. 1 (b),", + "type": "text" + }, + { + "bbox": [ + 264, + 496, + 317, + 509 + ], + "score": 0.92, + "content": "3 m / ( m + 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 497, + 473, + 509 + ], + "score": 1.0, + "content": "is the best case for max active key", + "type": "text" + }, + { + "bbox": [ + 473, + 497, + 501, + 507 + ], + "score": 0.61, + "content": "s = m", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 497, + 506, + 509 + ], + "score": 1.0, + "content": ")", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23 + }, + { + "type": "table", + "bbox": [ + 125, + 600, + 486, + 745 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 544, + 505, + 600 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 545, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 505, + 557 + ], + "score": 1.0, + "content": "Table 1: Time to convergence to target validation accuracy. The time to convergence can be broken", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "score": 1.0, + "content": "down into number of epochs and the throughput (instances/s). The target accuracy is shown inside", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 566, + 507, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 507, + 580 + ], + "score": 1.0, + "content": "parentheses next to each dataset. mak is a short-hand for max active keys defined in Sec. 3;", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 577, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 144, + 588 + ], + "score": 0.87, + "content": "\\mathrm { m a k } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 577, + 506, + 591 + ], + "score": 1.0, + "content": "corresponds to synchronous training for MNIST and minimal asynchrony arising from just", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 588, + 365, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 365, + 602 + ], + "score": 1.0, + "content": "one in-flight instance for other models with recursive structures.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29 + }, + { + "type": "table_body", + "bbox": [ + 125, + 600, + 486, + 745 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 125, + 600, + 486, + 745 + ], + "spans": [ + { + "bbox": [ + 125, + 600, + 486, + 745 + ], + "score": 0.984, + "html": "
AMPTensorFlow
maktime (s)epochsinst/stime (s)epochsinst/s
MNIST (97%)191.13207634.535880
440.4 (2.2x)46268
List reduction (97%)1781013k46718k
466 (1.2x)10.516k
1660 (1.3x)9.516k
(2 replicas)438(2x)1235k
(4 replicas)821 (3.8x)1371k
Sentiment (82%)118521022085265
882 (2.3x)2222
16104 (1.8x)3258
QM9 (4.6)4N/AN/A9886696661217
16522776.51797
", + "type": "table", + "image_path": "b36b62f595db551df610919c01f9c46efec1e65e97f68e88b14659169967f9a9.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 125, + 600, + 486, + 648.3333333333334 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 125, + 648.3333333333334, + 486, + 696.6666666666667 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 125, + 696.6666666666667, + 486, + 745.0000000000001 + ], + "spans": [], + "index": 34 + } + ] + } + ], + "index": 31.0 + } + ], + "page_idx": 6, + "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, + 750, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "7", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 107, + 109, + 505, + 234 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 103, + 82, + 505, + 106 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 94 + ], + "score": 1.0, + "content": "that AMPNet is not specifically designed to tackle. Brief details of the models and data sets in the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 419, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 419, + 106 + ], + "score": 1.0, + "content": "experiments are presented below, and further details are given in Appendix B.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "table_body", + "bbox": [ + 107, + 109, + 505, + 234 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 109, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 107, + 109, + 505, + 234 + ], + "score": 0.981, + "html": "
ModelData setDifficultyExperiment purpose
MLPMNISTtoyThe standard deep learning bench- mark (for which AMPNet is not
RNNList reductiontoyspecifically designed) The simplest architecture with dy-
Tree-LSTMStanford Sentiment Treebankreal-worldnamic control flow (a for loop) The TensorFlow Fold benchmark for
GNNQM9real-worldbackpropagation through structure Complex control flow with loops over time and structure
", + "type": "table", + "image_path": "61b96a9172c549ef7fac0f812fcfd89bc724c88ddab6413e94a05f94193bdbdb.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 107, + 109, + 505, + 150.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 107, + 150.66666666666666, + 505, + 192.33333333333331 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 107, + 192.33333333333331, + 505, + 233.99999999999997 + ], + "spans": [], + "index": 4 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 505, + 376 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 267 + ], + "score": 1.0, + "content": "Results Our asynchronous runtime is motivated by the promise of emerging hardware (e.g. FPGA", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 265, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 506, + 278 + ], + "score": 1.0, + "content": "accelerators) that fulfill the premises in section 1 and are well suited to dynamic neural network", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 276, + 506, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 506, + 290 + ], + "score": 1.0, + "content": "execution. Here we are primarily interested in how the performance of our runtime improves as we", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 288, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 288, + 505, + 300 + ], + "score": 1.0, + "content": "increase the degree of asynchrony (by varying max active keys) while keeping other factors", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 298, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 505, + 311 + ], + "score": 1.0, + "content": "fixed. The aim is to answer the question of whether AMP training is a promising direction for novel", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 308, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 505, + 322 + ], + "score": 1.0, + "content": "distributed hardware that deviates from the CPU/GPU batching paradigm. To answer this question", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 320, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 505, + 333 + ], + "score": 1.0, + "content": "using resources available today we run the AMPNet training using a multi-core CPU runtime where", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 331, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 506, + 344 + ], + "score": 1.0, + "content": "each worker is a hardware thread (see Appendix A). Additionally we forecast the performance on", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 506, + 356 + ], + "score": 1.0, + "content": "a hypothetical 1TFLOPS device satisfying our premises by replacing all computation nodes by", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 353, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 505, + 365 + ], + "score": 1.0, + "content": "configurable sleep nodes. This allows us to estimate the performance on a new hardware keeping the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 364, + 307, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 307, + 376 + ], + "score": 1.0, + "content": "control flow decisions dynamic. See Appendix C.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 254, + 506, + 376 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 381, + 505, + 425 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "It is also interesting to compare how the raw CPU performance of the AMP runtime compares with", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 391, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 506, + 405 + ], + "score": 1.0, + "content": "existing frameworks (TensorFlow, TensorFlow Fold and DyNet) to see that our implementation is", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 402, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 506, + 416 + ], + "score": 1.0, + "content": "already competitive with state of the art methods even on CPUs that do not conform to our target", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 414, + 412, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 412, + 426 + ], + "score": 1.0, + "content": "hardware model. We provide additional analysis for each experiment below.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 381, + 506, + 426 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 430, + 505, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 430, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 217, + 443 + ], + "score": 1.0, + "content": "On MNIST, Table 1 shows", + "type": "text" + }, + { + "bbox": [ + 217, + 431, + 229, + 441 + ], + "score": 0.62, + "content": "_ { 3 \\mathrm { X } }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 430, + 421, + 443 + ], + "score": 1.0, + "content": "speedup from synchrony (max active keys", + "type": "text" + }, + { + "bbox": [ + 421, + 432, + 441, + 441 + ], + "score": 0.33, + "content": ": = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 430, + 505, + 443 + ], + "score": 1.0, + "content": ") to asynchrony", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 441, + 504, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 189, + 453 + ], + "score": 1.0, + "content": "(max active key", + "type": "text" + }, + { + "bbox": [ + 189, + 442, + 214, + 452 + ], + "score": 0.29, + "content": "s = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 441, + 504, + 453 + ], + "score": 1.0, + "content": ") in terms of throughput. This is almost ideal as the first three linear layers", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "score": 1.0, + "content": "are the heaviest operations. The number of epochs to reach the target validation accuracy increases", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 464, + 506, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 384, + 476 + ], + "score": 1.0, + "content": "from 3 to 4 but the overall speedup in terms of the wall clock time is", + "type": "text" + }, + { + "bbox": [ + 384, + 464, + 403, + 474 + ], + "score": 0.74, + "content": "2 . 2 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 464, + 506, + 476 + ], + "score": 1.0, + "content": ". We have also compared", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 474, + 506, + 488 + ], + "spans": [ + { + "bbox": [ + 104, + 474, + 506, + 488 + ], + "score": 1.0, + "content": "AMP training against pipeline parallel training (Fig. 1 (b)). Figure 5(a) shows that while AMP", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 486, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 301, + 498 + ], + "score": 1.0, + "content": "training achieves 3x throughput gain already with", + "type": "text" + }, + { + "bbox": [ + 301, + 486, + 406, + 497 + ], + "score": 0.36, + "content": "\\mathtt { m a x \\mathrm { _ { - } a c t i v e \\mathrm { _ { - } k e y s = 4 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 486, + 506, + 498 + ], + "score": 1.0, + "content": ", pipeline parallelism can", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 496, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 158, + 509 + ], + "score": 1.0, + "content": "only achieve", + "type": "text" + }, + { + "bbox": [ + 158, + 497, + 170, + 507 + ], + "score": 0.47, + "content": "2 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 497, + 264, + 509 + ], + "score": 1.0, + "content": "(in fact from Fig. 1 (b),", + "type": "text" + }, + { + "bbox": [ + 264, + 496, + 317, + 509 + ], + "score": 0.92, + "content": "3 m / ( m + 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 497, + 473, + 509 + ], + "score": 1.0, + "content": "is the best case for max active key", + "type": "text" + }, + { + "bbox": [ + 473, + 497, + 501, + 507 + ], + "score": 0.61, + "content": "s = m", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 497, + 506, + 509 + ], + "score": 1.0, + "content": ")", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23, + "bbox_fs": [ + 104, + 430, + 506, + 509 + ] + }, + { + "type": "table", + "bbox": [ + 125, + 600, + 486, + 745 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 544, + 505, + 600 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 545, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 505, + 557 + ], + "score": 1.0, + "content": "Table 1: Time to convergence to target validation accuracy. The time to convergence can be broken", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "score": 1.0, + "content": "down into number of epochs and the throughput (instances/s). The target accuracy is shown inside", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 566, + 507, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 507, + 580 + ], + "score": 1.0, + "content": "parentheses next to each dataset. mak is a short-hand for max active keys defined in Sec. 3;", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 577, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 144, + 588 + ], + "score": 0.87, + "content": "\\mathrm { m a k } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 577, + 506, + 591 + ], + "score": 1.0, + "content": "corresponds to synchronous training for MNIST and minimal asynchrony arising from just", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 588, + 365, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 365, + 602 + ], + "score": 1.0, + "content": "one in-flight instance for other models with recursive structures.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29 + }, + { + "type": "table_body", + "bbox": [ + 125, + 600, + 486, + 745 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 125, + 600, + 486, + 745 + ], + "spans": [ + { + "bbox": [ + 125, + 600, + 486, + 745 + ], + "score": 0.984, + "html": "
AMPTensorFlow
maktime (s)epochsinst/stime (s)epochsinst/s
MNIST (97%)191.13207634.535880
440.4 (2.2x)46268
List reduction (97%)1781013k46718k
466 (1.2x)10.516k
1660 (1.3x)9.516k
(2 replicas)438(2x)1235k
(4 replicas)821 (3.8x)1371k
Sentiment (82%)118521022085265
882 (2.3x)2222
16104 (1.8x)3258
QM9 (4.6)4N/AN/A9886696661217
16522776.51797
", + "type": "table", + "image_path": "b36b62f595db551df610919c01f9c46efec1e65e97f68e88b14659169967f9a9.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 125, + 600, + 486, + 648.3333333333334 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 125, + 648.3333333333334, + 486, + 696.6666666666667 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 125, + 696.6666666666667, + 486, + 745.0000000000001 + ], + "spans": [], + "index": 34 + } + ] + } + ], + "index": 31.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 88, + 507, + 228 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 88, + 507, + 228 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 88, + 507, + 228 + ], + "spans": [ + { + "bbox": [ + 108, + 88, + 507, + 228 + ], + "score": 0.623, + "type": "image", + "image_path": "05af97a8258c4fd509b6b362b27a58a6b87d9eab74790a022c39a54270e8b031.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 88, + 507, + 134.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 134.66666666666666, + 507, + 181.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 181.33333333333331, + 507, + 227.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 101, + 233, + 524, + 254 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 233, + 525, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 233, + 525, + 245 + ], + "score": 1.0, + "content": "(a) Comparison against pipeline parallelism (Fig. 1 (b)) (b) Performance of an 8-replica RNN model on the list reduc-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 242, + 511, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 210, + 253 + ], + "score": 1.0, + "content": "for 4-layer MLP on MNIST.", + "type": "text" + }, + { + "bbox": [ + 302, + 242, + 511, + 255 + ], + "score": 1.0, + "content": "tion dataset as a function of asynchrony hyperparameters.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "image_caption", + "bbox": [ + 106, + 271, + 505, + 305 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "score": 1.0, + "content": "Figure 5: Throughput-convergence trade-off as a function of mode of parallelism and asynchrony", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 282, + 506, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 506, + 296 + ], + "score": 1.0, + "content": "hyper-parameters. Solid gray lines show constant convergence time trajectories; mak and mui stand", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 292, + 391, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 391, + 307 + ], + "score": 1.0, + "content": "for max active keys and min update interval, respectively.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 325, + 504, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 324, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 324, + 295, + 337 + ], + "score": 1.0, + "content": "and higher throughput at max active keys", + "type": "text" + }, + { + "bbox": [ + 296, + 325, + 315, + 335 + ], + "score": 0.59, + "content": "= 8", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 324, + 505, + 337 + ], + "score": 1.0, + "content": "is achieved at the cost of the sharp increase in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 336, + 259, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 259, + 348 + ], + "score": 1.0, + "content": "the number of epochs to convergence.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 353, + 505, + 408 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "score": 1.0, + "content": "The list reduction dataset demonstrates the power of replicas. As there is only one heavy operation", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 363, + 504, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 447, + 376 + ], + "score": 1.0, + "content": "(Linear-1, Figure 2), the speedup from asynchrony is mild (1.3x). However we get", + "type": "text" + }, + { + "bbox": [ + 447, + 364, + 466, + 374 + ], + "score": 0.64, + "content": "2 . 5 \\mathrm { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 363, + 484, + 376 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 485, + 364, + 504, + 374 + ], + "score": 0.69, + "content": "3 . 5 \\mathrm { x }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 374, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 506, + 389 + ], + "score": 1.0, + "content": "speedup for 2 and 4 replicas, respectively, which is nearly ideal. Again, the # of epochs to convergence", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 385, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 399 + ], + "score": 1.0, + "content": "is not affected by increasing max active keys. The slowdown in convergence for 4 replicas is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 396, + 491, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 491, + 410 + ], + "score": 1.0, + "content": "due to the increased effective minibatch size – also commonly observed in data parallel training.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 413, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "score": 1.0, + "content": "Next the sentiment tree-RNN dataset shows that our runtime is competitive without batching to", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "score": 1.0, + "content": "TensorFlow Fold (Looks et al., 2017) using dynamic batching of batch size 100. It is worth men-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "tioning that our runtime allows us to specify different min update interval parameter for each", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "parameterized operation. We set this parameter to 1000 for the embedding layer, which is initialized", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 457, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 506, + 470 + ], + "score": 1.0, + "content": "by Glove vectors, and 50 for all other layers. This reduced gradient staleness in the embedding layer.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 108, + 474, + 504, + 496 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "The QM9 dataset demonstrates that increasing asynchrony helps on real-world tasks with complex", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 485, + 478, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 478, + 498 + ], + "score": 1.0, + "content": "control flow, and our method outperforms an efficient TensorFlow implementation on CPUs.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 502, + 505, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 502, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 505, + 514 + ], + "score": 1.0, + "content": "Finally, we have implemented the BiLSTM w/ char model in Neubig et al. (2017b) on Wikiner", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 512, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 526 + ], + "score": 1.0, + "content": "dataset Nothman et al. (2013). Our preliminary implementation without any batching achieves 130", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 524, + 506, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 248, + 537 + ], + "score": 1.0, + "content": "sentences/s at max active keys", + "type": "text" + }, + { + "bbox": [ + 249, + 525, + 272, + 535 + ], + "score": 0.65, + "content": "= 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 524, + 461, + 537 + ], + "score": 1.0, + "content": "without any noticeable loss in accuracy (around", + "type": "text" + }, + { + "bbox": [ + 462, + 524, + 484, + 534 + ], + "score": 0.85, + "content": "94 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 524, + 506, + 537 + ], + "score": 1.0, + "content": "after", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 534, + 506, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 506, + 548 + ], + "score": 1.0, + "content": "one epoch). This is competitive with DyNet’s performance on the same machine (23 sentences/s", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 546, + 405, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 405, + 559 + ], + "score": 1.0, + "content": "without and 220 with autobatching, respectively); See Sec. B.5 for details.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 569, + 506, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "score": 1.0, + "content": "Asynchrony Finally we provide additional analysis on the effect of asynchrony. The degree of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 580, + 417, + 593 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 417, + 593 + ], + "score": 1.0, + "content": "asynchrony is controlled by hyperparameters min update interval and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 591, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 591, + 506, + 604 + ], + "score": 1.0, + "content": "max active keys. In Fig. 5(b) we use an 8-replica RNN model on the list reduction dataset to", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 601, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 421, + 615 + ], + "score": 1.0, + "content": "investigate how these parameters affect the data and time required to converge to", + "type": "text" + }, + { + "bbox": [ + 421, + 603, + 441, + 613 + ], + "score": 0.86, + "content": "96 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 601, + 506, + 615 + ], + "score": 1.0, + "content": "validation accu-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "racy. We find, in analogy with minibatch size in traditional systems, that min update interval", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 624, + 506, + 638 + ], + "spans": [ + { + "bbox": [ + 106, + 624, + 506, + 638 + ], + "score": 1.0, + "content": "must neither be too large nor too small. Increasing max active keys (increasing asynchrony)", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 636, + 506, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 636, + 506, + 648 + ], + "score": 1.0, + "content": "monotonically increases performance when the number of keys is similar to the number of indi-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 645, + 506, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 506, + 661 + ], + "score": 1.0, + "content": "vidually affinitized heavy operations in the model 8 in this case). Increasing max active keys", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 658, + 351, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 351, + 671 + ], + "score": 1.0, + "content": "significantly beyond this point produces diminishing returns.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 31 + }, + { + "type": "title", + "bbox": [ + 108, + 684, + 211, + 697 + ], + "lines": [ + { + "bbox": [ + 105, + 683, + 213, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 683, + 213, + 699 + ], + "score": 1.0, + "content": "7 RELATED WORK", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "One approach to the task of training networks with instance dependent control flow is to define", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "the computation graph dynamically per-instance. This approach is taken in Chainer (Tokui et al.,", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + } + ], + "page_idx": 7, + "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, + 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": "image", + "bbox": [ + 108, + 88, + 507, + 228 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 88, + 507, + 228 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 88, + 507, + 228 + ], + "spans": [ + { + "bbox": [ + 108, + 88, + 507, + 228 + ], + "score": 0.623, + "type": "image", + "image_path": "05af97a8258c4fd509b6b362b27a58a6b87d9eab74790a022c39a54270e8b031.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 88, + 507, + 134.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 134.66666666666666, + 507, + 181.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 181.33333333333331, + 507, + 227.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 101, + 233, + 524, + 254 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 233, + 525, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 233, + 525, + 245 + ], + "score": 1.0, + "content": "(a) Comparison against pipeline parallelism (Fig. 1 (b)) (b) Performance of an 8-replica RNN model on the list reduc-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 242, + 511, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 210, + 253 + ], + "score": 1.0, + "content": "for 4-layer MLP on MNIST.", + "type": "text" + }, + { + "bbox": [ + 302, + 242, + 511, + 255 + ], + "score": 1.0, + "content": "tion dataset as a function of asynchrony hyperparameters.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "image_caption", + "bbox": [ + 106, + 271, + 505, + 305 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "score": 1.0, + "content": "Figure 5: Throughput-convergence trade-off as a function of mode of parallelism and asynchrony", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 282, + 506, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 506, + 296 + ], + "score": 1.0, + "content": "hyper-parameters. Solid gray lines show constant convergence time trajectories; mak and mui stand", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 292, + 391, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 391, + 307 + ], + "score": 1.0, + "content": "for max active keys and min update interval, respectively.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 325, + 504, + 347 + ], + "lines": [ + { + "bbox": [ + 106, + 324, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 324, + 295, + 337 + ], + "score": 1.0, + "content": "and higher throughput at max active keys", + "type": "text" + }, + { + "bbox": [ + 296, + 325, + 315, + 335 + ], + "score": 0.59, + "content": "= 8", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 324, + 505, + 337 + ], + "score": 1.0, + "content": "is achieved at the cost of the sharp increase in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 336, + 259, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 259, + 348 + ], + "score": 1.0, + "content": "the number of epochs to convergence.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 324, + 505, + 348 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 353, + 505, + 408 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 505, + 366 + ], + "score": 1.0, + "content": "The list reduction dataset demonstrates the power of replicas. As there is only one heavy operation", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 363, + 504, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 447, + 376 + ], + "score": 1.0, + "content": "(Linear-1, Figure 2), the speedup from asynchrony is mild (1.3x). However we get", + "type": "text" + }, + { + "bbox": [ + 447, + 364, + 466, + 374 + ], + "score": 0.64, + "content": "2 . 5 \\mathrm { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 363, + 484, + 376 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 485, + 364, + 504, + 374 + ], + "score": 0.69, + "content": "3 . 5 \\mathrm { x }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 374, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 506, + 389 + ], + "score": 1.0, + "content": "speedup for 2 and 4 replicas, respectively, which is nearly ideal. Again, the # of epochs to convergence", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 385, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 399 + ], + "score": 1.0, + "content": "is not affected by increasing max active keys. The slowdown in convergence for 4 replicas is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 396, + 491, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 491, + 410 + ], + "score": 1.0, + "content": "due to the increased effective minibatch size – also commonly observed in data parallel training.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 352, + 506, + 410 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 413, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "score": 1.0, + "content": "Next the sentiment tree-RNN dataset shows that our runtime is competitive without batching to", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "score": 1.0, + "content": "TensorFlow Fold (Looks et al., 2017) using dynamic batching of batch size 100. It is worth men-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "tioning that our runtime allows us to specify different min update interval parameter for each", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "parameterized operation. We set this parameter to 1000 for the embedding layer, which is initialized", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 457, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 506, + 470 + ], + "score": 1.0, + "content": "by Glove vectors, and 50 for all other layers. This reduced gradient staleness in the embedding layer.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 413, + 506, + 470 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 474, + 504, + 496 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "The QM9 dataset demonstrates that increasing asynchrony helps on real-world tasks with complex", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 485, + 478, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 478, + 498 + ], + "score": 1.0, + "content": "control flow, and our method outperforms an efficient TensorFlow implementation on CPUs.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 106, + 474, + 505, + 498 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 502, + 505, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 502, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 505, + 514 + ], + "score": 1.0, + "content": "Finally, we have implemented the BiLSTM w/ char model in Neubig et al. (2017b) on Wikiner", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 512, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 526 + ], + "score": 1.0, + "content": "dataset Nothman et al. (2013). Our preliminary implementation without any batching achieves 130", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 524, + 506, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 248, + 537 + ], + "score": 1.0, + "content": "sentences/s at max active keys", + "type": "text" + }, + { + "bbox": [ + 249, + 525, + 272, + 535 + ], + "score": 0.65, + "content": "= 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 524, + 461, + 537 + ], + "score": 1.0, + "content": "without any noticeable loss in accuracy (around", + "type": "text" + }, + { + "bbox": [ + 462, + 524, + 484, + 534 + ], + "score": 0.85, + "content": "94 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 524, + 506, + 537 + ], + "score": 1.0, + "content": "after", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 534, + 506, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 506, + 548 + ], + "score": 1.0, + "content": "one epoch). This is competitive with DyNet’s performance on the same machine (23 sentences/s", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 546, + 405, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 405, + 559 + ], + "score": 1.0, + "content": "without and 220 with autobatching, respectively); See Sec. B.5 for details.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 502, + 506, + 559 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 569, + 506, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 582 + ], + "score": 1.0, + "content": "Asynchrony Finally we provide additional analysis on the effect of asynchrony. The degree of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 580, + 417, + 593 + ], + "spans": [ + { + "bbox": [ + 105, + 580, + 417, + 593 + ], + "score": 1.0, + "content": "asynchrony is controlled by hyperparameters min update interval and", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 591, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 591, + 506, + 604 + ], + "score": 1.0, + "content": "max active keys. In Fig. 5(b) we use an 8-replica RNN model on the list reduction dataset to", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 601, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 421, + 615 + ], + "score": 1.0, + "content": "investigate how these parameters affect the data and time required to converge to", + "type": "text" + }, + { + "bbox": [ + 421, + 603, + 441, + 613 + ], + "score": 0.86, + "content": "96 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 601, + 506, + 615 + ], + "score": 1.0, + "content": "validation accu-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 614, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 614, + 505, + 627 + ], + "score": 1.0, + "content": "racy. We find, in analogy with minibatch size in traditional systems, that min update interval", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 624, + 506, + 638 + ], + "spans": [ + { + "bbox": [ + 106, + 624, + 506, + 638 + ], + "score": 1.0, + "content": "must neither be too large nor too small. Increasing max active keys (increasing asynchrony)", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 636, + 506, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 636, + 506, + 648 + ], + "score": 1.0, + "content": "monotonically increases performance when the number of keys is similar to the number of indi-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 645, + 506, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 506, + 661 + ], + "score": 1.0, + "content": "vidually affinitized heavy operations in the model 8 in this case). Increasing max active keys", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 658, + 351, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 351, + 671 + ], + "score": 1.0, + "content": "significantly beyond this point produces diminishing returns.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 569, + 506, + 671 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 684, + 211, + 697 + ], + "lines": [ + { + "bbox": [ + 105, + 683, + 213, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 683, + 213, + 699 + ], + "score": 1.0, + "content": "7 RELATED WORK", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "One approach to the task of training networks with instance dependent control flow is to define", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "the computation graph dynamically per-instance. This approach is taken in Chainer (Tokui et al.,", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 106, + 709, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 192 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "2015), DyNet (Neubig et al., 2017a), and PyTorch (PyTorch core team). There are key challenges in", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "accelerating this approach: Model parallelism would require the dynamically generated computation", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 103, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 104, + 103, + 506, + 118 + ], + "score": 1.0, + "content": "graph to be scheduled on-the-fly, and BLAS level parallelism would require operations to be batched", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "on-the-fly. Automatic dynamic batching has been implemented in DyNet (Neubig et al., 2017a), and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 138 + ], + "score": 1.0, + "content": "is an interesting alternative to our asynchronous execution. Similar methods are used in TensorFlow", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "score": 1.0, + "content": "Fold (Looks et al., 2017). The basic idea is to inspect and merge together (by depth) the unrolled", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "score": 1.0, + "content": "computation graphs of several instances to create batched BLAS operations. The effectiveness of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 505, + 172 + ], + "score": 1.0, + "content": "automatic batching greatly depends on the model – for example, it would not perform well on random", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "score": 1.0, + "content": "permutations of a sequence of operations. By contrast, our IR would very succinctly express and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "achieve pipeline parallelism using a static computation graph that is easy to distribute and optimize.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 107, + 197, + 505, + 439 + ], + "lines": [ + { + "bbox": [ + 106, + 198, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 505, + 211 + ], + "score": 1.0, + "content": "Theano (Al-Rfou et al., 2016) and TensorFlow (TF)(Abadi et al., 2016) can syntactically handle", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "instance dependent control flow with abstractions for conditional execution (ifelse in Theano", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 220, + 506, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 506, + 233 + ], + "score": 1.0, + "content": "and cond in TF) and loops (scan and while loop, respectively); TF also provides higher-order", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "functions, such as map, foldl, foldr, and scan. The main difference between AMPNet and the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 240, + 506, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 506, + 256 + ], + "score": 1.0, + "content": "above frameworks is that AMPNet is streaming and asynchronous whereas Theano is non-streaming", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "and synchronous. Although not designed for streaming, TF can support streaming programmatically", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 264, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 264, + 506, + 277 + ], + "score": 1.0, + "content": "as it exposes first-class queues, as well as data prefetching with so called input pipelines. In our IR,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 274, + 506, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 274, + 506, + 289 + ], + "score": 1.0, + "content": "all the queuing is implicit and stream-based execution is the default. TF additionally does support", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 286, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 506, + 299 + ], + "score": 1.0, + "content": "static description of dynamic control flow and state update, but we depart from the classic dataflow", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 297, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 505, + 309 + ], + "score": 1.0, + "content": "architecture that TF follows (Arvind and Culler, 1986): First, instead of having nodes that represent", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "mutable reference cells, we encapsulate the state with which a message should be processed through", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 318, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 506, + 333 + ], + "score": 1.0, + "content": "the graph in the message itself. Second, because we encapsulate algorithmic state in the messages,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "we do not introduce the notion of control dependencies (which can be used to impose a specific", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 341, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 506, + 353 + ], + "score": 1.0, + "content": "execution order on TF operations). Our choices complicate algorithmic state management from a", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 352, + 506, + 363 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 506, + 363 + ], + "score": 1.0, + "content": "programming point of view and make the task of designing a high-level compiler non-trivial, but", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 363, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 506, + 375 + ], + "score": 1.0, + "content": "allow every node to run asynchronously and independently without a scheduler and without the need", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 374, + 506, + 385 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 506, + 385 + ], + "score": 1.0, + "content": "for control messages: For example, nodes that dynamically take a control flow path or split the data", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 385, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 506, + 397 + ], + "score": 1.0, + "content": "simply consult the state of the incoming message, instead of having to accept additional control inputs.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 506, + 408 + ], + "score": 1.0, + "content": "For “small” states (e.g. nested loop counters or edge and node ids) this might be preferable than", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 406, + 506, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 506, + 420 + ], + "score": 1.0, + "content": "out-of-band signaling. Our IR can implement loops by simply using state-update, conditional, and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 418, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 106, + 418, + 505, + 429 + ], + "score": 1.0, + "content": "phi nodes, because the state accompanies the payload throughout its lifetime, whereas TF introduces", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 428, + 473, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 473, + 441 + ], + "score": 1.0, + "content": "specialized operators from timely dataflow (Murray et al., 2016) to achieve the same effect.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 444, + 505, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 445, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 505, + 457 + ], + "score": 1.0, + "content": "Asynchronous data parallel training (Recht et al., 2011; Dean et al., 2012; Chilimbi et al., 2014) is", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 456, + 504, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 504, + 468 + ], + "score": 1.0, + "content": "another popular approach to scale out optimization by removing synchronization (orthogonal to and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 467, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 505, + 479 + ], + "score": 1.0, + "content": "combinable with model-parallel training). For example, convolutional layers are more amenable to", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 478, + 506, + 490 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 506, + 490 + ], + "score": 1.0, + "content": "data-parallel training than fully connected layers, because the weights are smaller than the activations.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "score": 1.0, + "content": "Moreover, when control flow differs per data instance, data parallelism is one way to get an effective", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 166, + 513 + ], + "score": 1.0, + "content": "minibatch size", + "type": "text" + }, + { + "bbox": [ + 166, + 501, + 183, + 511 + ], + "score": 0.81, + "content": "> 1", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 500, + 505, + 513 + ], + "score": 1.0, + "content": ", which may improve convergence by reducing variance. The impact of staleness", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "score": 1.0, + "content": "on convergence (Recht et al., 2011) and optimization dynamics (Mitliagkas et al., 2016) have been", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 521, + 461, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 461, + 534 + ], + "score": 1.0, + "content": "studied for data parallelism. It would be interesting to extend those results to our setting.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 107, + 538, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 551 + ], + "score": 1.0, + "content": "Jaderberg et al. (2016), like us, aim to to train different parts of a model in a decoupled or asynchronous", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "manner. More precisely, their goal is to approximate a gradient with a synthetic gradient computed", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "by a small neural network that is locally attached to each layer. Hence, the local gradient calculation", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "becomes independent of other layers (except for the training of the gradient predictor network) and", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "score": 1.0, + "content": "allows asynchronous parameter updates. This would be especially useful if the evaluation of the local", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "network is cheaper than the computation of the real gradient; for example, if the computation of the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 605, + 500, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 500, + 617 + ], + "score": 1.0, + "content": "real gradient required significant communication of forward/backward messages between devices.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43 + }, + { + "type": "title", + "bbox": [ + 108, + 637, + 275, + 650 + ], + "lines": [ + { + "bbox": [ + 104, + 635, + 277, + 653 + ], + "spans": [ + { + "bbox": [ + 104, + 635, + 277, + 653 + ], + "score": 1.0, + "content": "8 CONCLUSION AND OUTLOOK", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "text", + "bbox": [ + 107, + 665, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "We have presented an asynchronous model-parallel SGD algorithm for distributed neural network", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "training. We have described an IR and multi-core CPU runtime for models with irregular and/or", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "instance-dependent control flow. Looking forward, we aim to deploy our system on specialized", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "hardware. Equally importantly, we plan to build a compiler that automatically deduces the information", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "to be placed in the states and generates state keying functions from a higher-level description of the", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "models. By unlocking scalable distributed training of dynamic models, we hope to enable exploration", + "type": "text" + } + ], + "index": 53 + } + ], + "index": 50.5 + } + ], + "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, + 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, + 192 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "2015), DyNet (Neubig et al., 2017a), and PyTorch (PyTorch core team). There are key challenges in", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "accelerating this approach: Model parallelism would require the dynamically generated computation", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 103, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 104, + 103, + 506, + 118 + ], + "score": 1.0, + "content": "graph to be scheduled on-the-fly, and BLAS level parallelism would require operations to be batched", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "on-the-fly. Automatic dynamic batching has been implemented in DyNet (Neubig et al., 2017a), and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 138 + ], + "score": 1.0, + "content": "is an interesting alternative to our asynchronous execution. Similar methods are used in TensorFlow", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "score": 1.0, + "content": "Fold (Looks et al., 2017). The basic idea is to inspect and merge together (by depth) the unrolled", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "score": 1.0, + "content": "computation graphs of several instances to create batched BLAS operations. The effectiveness of", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 505, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 505, + 172 + ], + "score": 1.0, + "content": "automatic batching greatly depends on the model – for example, it would not perform well on random", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "score": 1.0, + "content": "permutations of a sequence of operations. By contrast, our IR would very succinctly express and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "achieve pipeline parallelism using a static computation graph that is easy to distribute and optimize.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 4.5, + "bbox_fs": [ + 104, + 82, + 506, + 194 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 197, + 505, + 439 + ], + "lines": [ + { + "bbox": [ + 106, + 198, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 505, + 211 + ], + "score": 1.0, + "content": "Theano (Al-Rfou et al., 2016) and TensorFlow (TF)(Abadi et al., 2016) can syntactically handle", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "instance dependent control flow with abstractions for conditional execution (ifelse in Theano", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 220, + 506, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 506, + 233 + ], + "score": 1.0, + "content": "and cond in TF) and loops (scan and while loop, respectively); TF also provides higher-order", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "functions, such as map, foldl, foldr, and scan. The main difference between AMPNet and the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 240, + 506, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 506, + 256 + ], + "score": 1.0, + "content": "above frameworks is that AMPNet is streaming and asynchronous whereas Theano is non-streaming", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "and synchronous. Although not designed for streaming, TF can support streaming programmatically", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 264, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 264, + 506, + 277 + ], + "score": 1.0, + "content": "as it exposes first-class queues, as well as data prefetching with so called input pipelines. In our IR,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 274, + 506, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 274, + 506, + 289 + ], + "score": 1.0, + "content": "all the queuing is implicit and stream-based execution is the default. TF additionally does support", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 286, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 506, + 299 + ], + "score": 1.0, + "content": "static description of dynamic control flow and state update, but we depart from the classic dataflow", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 297, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 505, + 309 + ], + "score": 1.0, + "content": "architecture that TF follows (Arvind and Culler, 1986): First, instead of having nodes that represent", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "mutable reference cells, we encapsulate the state with which a message should be processed through", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 318, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 506, + 333 + ], + "score": 1.0, + "content": "the graph in the message itself. Second, because we encapsulate algorithmic state in the messages,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 330, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 505, + 343 + ], + "score": 1.0, + "content": "we do not introduce the notion of control dependencies (which can be used to impose a specific", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 341, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 106, + 341, + 506, + 353 + ], + "score": 1.0, + "content": "execution order on TF operations). Our choices complicate algorithmic state management from a", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 352, + 506, + 363 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 506, + 363 + ], + "score": 1.0, + "content": "programming point of view and make the task of designing a high-level compiler non-trivial, but", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 363, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 506, + 375 + ], + "score": 1.0, + "content": "allow every node to run asynchronously and independently without a scheduler and without the need", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 374, + 506, + 385 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 506, + 385 + ], + "score": 1.0, + "content": "for control messages: For example, nodes that dynamically take a control flow path or split the data", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 385, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 506, + 397 + ], + "score": 1.0, + "content": "simply consult the state of the incoming message, instead of having to accept additional control inputs.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 506, + 408 + ], + "score": 1.0, + "content": "For “small” states (e.g. nested loop counters or edge and node ids) this might be preferable than", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 406, + 506, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 506, + 420 + ], + "score": 1.0, + "content": "out-of-band signaling. Our IR can implement loops by simply using state-update, conditional, and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 418, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 106, + 418, + 505, + 429 + ], + "score": 1.0, + "content": "phi nodes, because the state accompanies the payload throughout its lifetime, whereas TF introduces", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 428, + 473, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 473, + 441 + ], + "score": 1.0, + "content": "specialized operators from timely dataflow (Murray et al., 2016) to achieve the same effect.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 198, + 506, + 441 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 444, + 505, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 445, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 505, + 457 + ], + "score": 1.0, + "content": "Asynchronous data parallel training (Recht et al., 2011; Dean et al., 2012; Chilimbi et al., 2014) is", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 456, + 504, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 504, + 468 + ], + "score": 1.0, + "content": "another popular approach to scale out optimization by removing synchronization (orthogonal to and", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 467, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 505, + 479 + ], + "score": 1.0, + "content": "combinable with model-parallel training). For example, convolutional layers are more amenable to", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 478, + 506, + 490 + ], + "spans": [ + { + "bbox": [ + 106, + 478, + 506, + 490 + ], + "score": 1.0, + "content": "data-parallel training than fully connected layers, because the weights are smaller than the activations.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "score": 1.0, + "content": "Moreover, when control flow differs per data instance, data parallelism is one way to get an effective", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 166, + 513 + ], + "score": 1.0, + "content": "minibatch size", + "type": "text" + }, + { + "bbox": [ + 166, + 501, + 183, + 511 + ], + "score": 0.81, + "content": "> 1", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 500, + 505, + 513 + ], + "score": 1.0, + "content": ", which may improve convergence by reducing variance. The impact of staleness", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "score": 1.0, + "content": "on convergence (Recht et al., 2011) and optimization dynamics (Mitliagkas et al., 2016) have been", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 521, + 461, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 461, + 534 + ], + "score": 1.0, + "content": "studied for data parallelism. It would be interesting to extend those results to our setting.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 445, + 506, + 534 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 538, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 551 + ], + "score": 1.0, + "content": "Jaderberg et al. (2016), like us, aim to to train different parts of a model in a decoupled or asynchronous", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "manner. More precisely, their goal is to approximate a gradient with a synthetic gradient computed", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "by a small neural network that is locally attached to each layer. Hence, the local gradient calculation", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "becomes independent of other layers (except for the training of the gradient predictor network) and", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "score": 1.0, + "content": "allows asynchronous parameter updates. This would be especially useful if the evaluation of the local", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "network is cheaper than the computation of the real gradient; for example, if the computation of the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 605, + 500, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 500, + 617 + ], + "score": 1.0, + "content": "real gradient required significant communication of forward/backward messages between devices.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 539, + 505, + 617 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 637, + 275, + 650 + ], + "lines": [ + { + "bbox": [ + 104, + 635, + 277, + 653 + ], + "spans": [ + { + "bbox": [ + 104, + 635, + 277, + 653 + ], + "score": 1.0, + "content": "8 CONCLUSION AND OUTLOOK", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + }, + { + "type": "text", + "bbox": [ + 107, + 665, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "We have presented an asynchronous model-parallel SGD algorithm for distributed neural network", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "training. We have described an IR and multi-core CPU runtime for models with irregular and/or", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "instance-dependent control flow. Looking forward, we aim to deploy our system on specialized", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "hardware. Equally importantly, we plan to build a compiler that automatically deduces the information", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "to be placed in the states and generates state keying functions from a higher-level description of the", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "models. By unlocking scalable distributed training of dynamic models, we hope to enable exploration", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "of this class of models that are currently only on the horizon but may become more mainstream in the", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 136, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 136, + 106 + ], + "score": 1.0, + "content": "future.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 50.5, + "bbox_fs": [ + 105, + 666, + 505, + 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": "of this class of models that are currently only on the horizon but may become more mainstream in the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 136, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 136, + 106 + ], + "score": 1.0, + "content": "future.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 105, + 120, + 507, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 121, + 176, + 134 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 176, + 134 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 137, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 151 + ], + "score": 1.0, + "content": "M. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 113, + 147, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 113, + 147, + 506, + 163 + ], + "score": 1.0, + "content": "et al. TensorFlow: Large-scale machine learning on heterogeneous distributed systems. arXiv preprint", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 158, + 210, + 171 + ], + "spans": [ + { + "bbox": [ + 115, + 158, + 210, + 171 + ], + "score": 1.0, + "content": "arXiv:1603.04467, 2016.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 176, + 506, + 189 + ], + "spans": [ + { + "bbox": [ + 104, + 176, + 506, + 189 + ], + "score": 1.0, + "content": "R. Al-Rfou, G. Alain, A. Almahairi, C. Angermueller, D. Bahdanau, N. Ballas, F. Bastien, J. Bayer, A. Belikov,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 186, + 506, + 199 + ], + "spans": [ + { + "bbox": [ + 115, + 186, + 506, + 199 + ], + "score": 1.0, + "content": "et al. Theano: A python framework for fast computation of mathematical expressions. arXiv preprint", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 114, + 196, + 209, + 208 + ], + "spans": [ + { + "bbox": [ + 114, + 196, + 209, + 208 + ], + "score": 1.0, + "content": "arXiv:1605.02688, 2016.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 213, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 506, + 226 + ], + "score": 1.0, + "content": "Arvind and D. E. Culler. Dataflow architectures. Annual Review of Computer Science, 1(1):225–253, 1986.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 226, + 471, + 236 + ], + "spans": [ + { + "bbox": [ + 116, + 226, + 471, + 236 + ], + "score": 1.0, + "content": "URL http://csg.csail.mit.edu/pubs/memos/Memo-261-1/Memo-261-2.pdf.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 240, + 506, + 257 + ], + "spans": [ + { + "bbox": [ + 104, + 240, + 506, + 257 + ], + "score": 1.0, + "content": "S. R. Bowman, J. Gauthier, A. Rastogi, R. Gupta, C. D. Manning, and C. Potts. A fast unified model for parsing", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 114, + 253, + 367, + 264 + ], + "spans": [ + { + "bbox": [ + 114, + 253, + 367, + 264 + ], + "score": 1.0, + "content": "and sentence understanding. arXiv preprint arXiv:1603.06021, 2016.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "score": 1.0, + "content": "A. M. Caulfield, E. S. Chung, A. Putnam, H. Angepat, J. Fowers, M. Haselman, S. Heil, M. Humphrey, P. Kaur,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 280, + 506, + 293 + ], + "spans": [ + { + "bbox": [ + 115, + 280, + 506, + 293 + ], + "score": 1.0, + "content": "J.-Y. Kim, et al. A cloud-scale acceleration architecture. In Microarchitecture (MICRO), 2016 49th Annual", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 114, + 290, + 358, + 304 + ], + "spans": [ + { + "bbox": [ + 114, + 290, + 358, + 304 + ], + "score": 1.0, + "content": "IEEE/ACM International Symposium on, pages 1–13. IEEE, 2016.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 309, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 505, + 320 + ], + "score": 1.0, + "content": "S. Chandar, S. Ahn, H. Larochelle, P. Vincent, G. Tesauro, and Y. Bengio. Hierarchical memory networks. arXiv", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 113, + 319, + 241, + 331 + ], + "spans": [ + { + "bbox": [ + 113, + 319, + 241, + 331 + ], + "score": 1.0, + "content": "preprint arXiv:1605.07427, 2016.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 335, + 506, + 351 + ], + "spans": [ + { + "bbox": [ + 104, + 335, + 506, + 351 + ], + "score": 1.0, + "content": "X. Chen, A. Eversole, G. Li, D. Yu, and F. Seide. Pipelined back-propagation for context-dependent deep neural", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 347, + 284, + 359 + ], + "spans": [ + { + "bbox": [ + 115, + 347, + 284, + 359 + ], + "score": 1.0, + "content": "networks. In Interspeech, pages 26–29, 2012.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 365, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 506, + 378 + ], + "score": 1.0, + "content": "T. M. Chilimbi, Y. Suzue, J. Apacible, and K. Kalyanaraman. Project Adam: Building an efficient and scalable", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 375, + 387, + 388 + ], + "spans": [ + { + "bbox": [ + 115, + 375, + 387, + 388 + ], + "score": 1.0, + "content": "deep learning training system. In OSDI, volume 14, pages 571–582, 2014.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 392, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 506, + 405 + ], + "score": 1.0, + "content": "J. Chung, C. Gulcehre, K. Cho, and Y. Bengio. Empirical evaluation of gated recurrent neural networks on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 113, + 402, + 334, + 415 + ], + "spans": [ + { + "bbox": [ + 113, + 402, + 334, + 415 + ], + "score": 1.0, + "content": "sequence modeling. arXiv preprint arXiv:1412.3555, 2014.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 421, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 506, + 434 + ], + "score": 1.0, + "content": "J. Dean, G. Corrado, R. Monga, K. Chen, M. Devin, M. Mao, A. Senior, P. Tucker, K. Yang, Q. V. Le, et al. Large", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 431, + 507, + 444 + ], + "spans": [ + { + "bbox": [ + 115, + 431, + 507, + 444 + ], + "score": 1.0, + "content": "scale distributed deep networks. In Advances in neural information processing systems, pages 1223–1231,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 440, + 141, + 454 + ], + "spans": [ + { + "bbox": [ + 115, + 440, + 141, + 454 + ], + "score": 1.0, + "content": "2012.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 459, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 471 + ], + "score": 1.0, + "content": "C. Farabet, Y. LeCun, K. Kavukcuoglu, E. Culurciello, B. Martini, P. Akselrod, and S. Talay. Large-scale", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 469, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 115, + 469, + 506, + 482 + ], + "score": 1.0, + "content": "FPGA-based convolutional networks. Scaling up Machine Learning: Parallel and Distributed Approaches,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 479, + 198, + 491 + ], + "spans": [ + { + "bbox": [ + 115, + 479, + 198, + 491 + ], + "score": 1.0, + "content": "pages 399–419, 2011.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "M. Figurnov, M. D. Collins, Y. Zhu, L. Zhang, J. Huang, D. Vetrov, and R. Salakhutdinov. Spatially adaptive", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 507, + 410, + 520 + ], + "spans": [ + { + "bbox": [ + 115, + 507, + 410, + 520 + ], + "score": 1.0, + "content": "computation time for residual networks. arXiv preprint arXiv:1612.02297, 2016.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 525, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 538 + ], + "score": 1.0, + "content": "J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl. Neural message passing for quantum", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 113, + 534, + 305, + 548 + ], + "spans": [ + { + "bbox": [ + 113, + 534, + 305, + 548 + ], + "score": 1.0, + "content": "chemistry. arXiv preprint arXiv:1704.01212, 2017.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 552, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 565 + ], + "score": 1.0, + "content": "C. Goller and A. Kuchler. Learning task-dependent distributed representations by backpropagation through", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 563, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 115, + 563, + 506, + 576 + ], + "score": 1.0, + "content": "structure. In Neural Networks, 1996., IEEE International Conference on, volume 1, pages 347–352. IEEE,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 571, + 140, + 585 + ], + "spans": [ + { + "bbox": [ + 115, + 571, + 140, + 585 + ], + "score": 1.0, + "content": "1996.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 592, + 504, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 504, + 603 + ], + "score": 1.0, + "content": "A. Graves. Adaptive computation time for recurrent neural networks. arXiv preprint arXiv:1603.08983, 2016.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 608, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 104, + 608, + 506, + 622 + ], + "score": 1.0, + "content": "A. Ichrak, P. Minet, and C. Adjih. Node coloring in wireless networks: Complexity results and grid coloring. 09", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 114, + 618, + 141, + 632 + ], + "spans": [ + { + "bbox": [ + 114, + 618, + 141, + 632 + ], + "score": 1.0, + "content": "2012.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 637, + 504, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 504, + 650 + ], + "score": 1.0, + "content": "M. Jaderberg, W. M. Czarnecki, S. Osindero, O. Vinyals, A. Graves, and K. Kavukcuoglu. Decoupled neural", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 647, + 395, + 660 + ], + "spans": [ + { + "bbox": [ + 115, + 647, + 395, + 660 + ], + "score": 1.0, + "content": "interfaces using synthetic gradients. arXiv preprint arXiv:1608.05343, 2016.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 666, + 506, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 677 + ], + "score": 1.0, + "content": "N. P. Jouppi, C. Young, N. Patil, D. Patterson, G. Agrawal, R. Bajwa, S. Bates, S. Bhatia, N. Boden, A. Borchers,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 676, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 115, + 676, + 506, + 687 + ], + "score": 1.0, + "content": "et al. In-datacenter performance analysis of a tensor processing unit. arXiv preprint arXiv:1704.04760, 2017.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 693, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 693, + 506, + 705 + ], + "score": 1.0, + "content": "D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. CoRR, abs/1412.6980, 2014. URL", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 703, + 283, + 715 + ], + "spans": [ + { + "bbox": [ + 115, + 703, + 283, + 715 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1412.6980.", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 721, + 379, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 379, + 734 + ], + "score": 1.0, + "content": "Y. LeCun and C. Cortes. The MNIST database of handwritten digits, 1998.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 24 + } + ], + "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, + 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": [], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "list", + "bbox": [ + 105, + 120, + 507, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 121, + 176, + 134 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 176, + 134 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 137, + 506, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 151 + ], + "score": 1.0, + "content": "M. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin,", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 147, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 113, + 147, + 506, + 163 + ], + "score": 1.0, + "content": "et al. TensorFlow: Large-scale machine learning on heterogeneous distributed systems. arXiv preprint", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 158, + 210, + 171 + ], + "spans": [ + { + "bbox": [ + 115, + 158, + 210, + 171 + ], + "score": 1.0, + "content": "arXiv:1603.04467, 2016.", + "type": "text" + } + ], + "index": 5, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 176, + 506, + 189 + ], + "spans": [ + { + "bbox": [ + 104, + 176, + 506, + 189 + ], + "score": 1.0, + "content": "R. Al-Rfou, G. Alain, A. Almahairi, C. Angermueller, D. Bahdanau, N. Ballas, F. Bastien, J. Bayer, A. Belikov,", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 186, + 506, + 199 + ], + "spans": [ + { + "bbox": [ + 115, + 186, + 506, + 199 + ], + "score": 1.0, + "content": "et al. Theano: A python framework for fast computation of mathematical expressions. arXiv preprint", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 114, + 196, + 209, + 208 + ], + "spans": [ + { + "bbox": [ + 114, + 196, + 209, + 208 + ], + "score": 1.0, + "content": "arXiv:1605.02688, 2016.", + "type": "text" + } + ], + "index": 8, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 213, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 506, + 226 + ], + "score": 1.0, + "content": "Arvind and D. E. Culler. Dataflow architectures. Annual Review of Computer Science, 1(1):225–253, 1986.", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 226, + 471, + 236 + ], + "spans": [ + { + "bbox": [ + 116, + 226, + 471, + 236 + ], + "score": 1.0, + "content": "URL http://csg.csail.mit.edu/pubs/memos/Memo-261-1/Memo-261-2.pdf.", + "type": "text" + } + ], + "index": 10, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 240, + 506, + 257 + ], + "spans": [ + { + "bbox": [ + 104, + 240, + 506, + 257 + ], + "score": 1.0, + "content": "S. R. Bowman, J. Gauthier, A. Rastogi, R. Gupta, C. D. Manning, and C. Potts. A fast unified model for parsing", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 253, + 367, + 264 + ], + "spans": [ + { + "bbox": [ + 114, + 253, + 367, + 264 + ], + "score": 1.0, + "content": "and sentence understanding. arXiv preprint arXiv:1603.06021, 2016.", + "type": "text" + } + ], + "index": 12, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "score": 1.0, + "content": "A. M. Caulfield, E. S. Chung, A. Putnam, H. Angepat, J. Fowers, M. Haselman, S. Heil, M. Humphrey, P. Kaur,", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 280, + 506, + 293 + ], + "spans": [ + { + "bbox": [ + 115, + 280, + 506, + 293 + ], + "score": 1.0, + "content": "J.-Y. Kim, et al. A cloud-scale acceleration architecture. In Microarchitecture (MICRO), 2016 49th Annual", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 114, + 290, + 358, + 304 + ], + "spans": [ + { + "bbox": [ + 114, + 290, + 358, + 304 + ], + "score": 1.0, + "content": "IEEE/ACM International Symposium on, pages 1–13. IEEE, 2016.", + "type": "text" + } + ], + "index": 15, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 309, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 309, + 505, + 320 + ], + "score": 1.0, + "content": "S. Chandar, S. Ahn, H. Larochelle, P. Vincent, G. Tesauro, and Y. Bengio. Hierarchical memory networks. arXiv", + "type": "text" + } + ], + "index": 16, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 319, + 241, + 331 + ], + "spans": [ + { + "bbox": [ + 113, + 319, + 241, + 331 + ], + "score": 1.0, + "content": "preprint arXiv:1605.07427, 2016.", + "type": "text" + } + ], + "index": 17, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 335, + 506, + 351 + ], + "spans": [ + { + "bbox": [ + 104, + 335, + 506, + 351 + ], + "score": 1.0, + "content": "X. Chen, A. Eversole, G. Li, D. Yu, and F. Seide. Pipelined back-propagation for context-dependent deep neural", + "type": "text" + } + ], + "index": 18, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 347, + 284, + 359 + ], + "spans": [ + { + "bbox": [ + 115, + 347, + 284, + 359 + ], + "score": 1.0, + "content": "networks. In Interspeech, pages 26–29, 2012.", + "type": "text" + } + ], + "index": 19, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 365, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 506, + 378 + ], + "score": 1.0, + "content": "T. M. Chilimbi, Y. Suzue, J. Apacible, and K. Kalyanaraman. Project Adam: Building an efficient and scalable", + "type": "text" + } + ], + "index": 20, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 375, + 387, + 388 + ], + "spans": [ + { + "bbox": [ + 115, + 375, + 387, + 388 + ], + "score": 1.0, + "content": "deep learning training system. In OSDI, volume 14, pages 571–582, 2014.", + "type": "text" + } + ], + "index": 21, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 392, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 506, + 405 + ], + "score": 1.0, + "content": "J. Chung, C. Gulcehre, K. Cho, and Y. Bengio. Empirical evaluation of gated recurrent neural networks on", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 402, + 334, + 415 + ], + "spans": [ + { + "bbox": [ + 113, + 402, + 334, + 415 + ], + "score": 1.0, + "content": "sequence modeling. arXiv preprint arXiv:1412.3555, 2014.", + "type": "text" + } + ], + "index": 23, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 421, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 506, + 434 + ], + "score": 1.0, + "content": "J. Dean, G. Corrado, R. Monga, K. Chen, M. Devin, M. Mao, A. Senior, P. Tucker, K. Yang, Q. V. Le, et al. Large", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 431, + 507, + 444 + ], + "spans": [ + { + "bbox": [ + 115, + 431, + 507, + 444 + ], + "score": 1.0, + "content": "scale distributed deep networks. In Advances in neural information processing systems, pages 1223–1231,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 440, + 141, + 454 + ], + "spans": [ + { + "bbox": [ + 115, + 440, + 141, + 454 + ], + "score": 1.0, + "content": "2012.", + "type": "text" + } + ], + "index": 26, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 459, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 471 + ], + "score": 1.0, + "content": "C. Farabet, Y. LeCun, K. Kavukcuoglu, E. Culurciello, B. Martini, P. Akselrod, and S. Talay. Large-scale", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 469, + 506, + 482 + ], + "spans": [ + { + "bbox": [ + 115, + 469, + 506, + 482 + ], + "score": 1.0, + "content": "FPGA-based convolutional networks. Scaling up Machine Learning: Parallel and Distributed Approaches,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 479, + 198, + 491 + ], + "spans": [ + { + "bbox": [ + 115, + 479, + 198, + 491 + ], + "score": 1.0, + "content": "pages 399–419, 2011.", + "type": "text" + } + ], + "index": 29, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "M. Figurnov, M. D. Collins, Y. Zhu, L. Zhang, J. Huang, D. Vetrov, and R. Salakhutdinov. Spatially adaptive", + "type": "text" + } + ], + "index": 30, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 507, + 410, + 520 + ], + "spans": [ + { + "bbox": [ + 115, + 507, + 410, + 520 + ], + "score": 1.0, + "content": "computation time for residual networks. arXiv preprint arXiv:1612.02297, 2016.", + "type": "text" + } + ], + "index": 31, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 525, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 538 + ], + "score": 1.0, + "content": "J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl. Neural message passing for quantum", + "type": "text" + } + ], + "index": 32, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 534, + 305, + 548 + ], + "spans": [ + { + "bbox": [ + 113, + 534, + 305, + 548 + ], + "score": 1.0, + "content": "chemistry. arXiv preprint arXiv:1704.01212, 2017.", + "type": "text" + } + ], + "index": 33, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 552, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 565 + ], + "score": 1.0, + "content": "C. Goller and A. Kuchler. Learning task-dependent distributed representations by backpropagation through", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 563, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 115, + 563, + 506, + 576 + ], + "score": 1.0, + "content": "structure. In Neural Networks, 1996., IEEE International Conference on, volume 1, pages 347–352. IEEE,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 571, + 140, + 585 + ], + "spans": [ + { + "bbox": [ + 115, + 571, + 140, + 585 + ], + "score": 1.0, + "content": "1996.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 592, + 504, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 504, + 603 + ], + "score": 1.0, + "content": "A. Graves. Adaptive computation time for recurrent neural networks. arXiv preprint arXiv:1603.08983, 2016.", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 104, + 608, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 104, + 608, + 506, + 622 + ], + "score": 1.0, + "content": "A. Ichrak, P. Minet, and C. Adjih. Node coloring in wireless networks: Complexity results and grid coloring. 09", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 618, + 141, + 632 + ], + "spans": [ + { + "bbox": [ + 114, + 618, + 141, + 632 + ], + "score": 1.0, + "content": "2012.", + "type": "text" + } + ], + "index": 39, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 637, + 504, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 504, + 650 + ], + "score": 1.0, + "content": "M. Jaderberg, W. M. Czarnecki, S. Osindero, O. Vinyals, A. Graves, and K. Kavukcuoglu. Decoupled neural", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 647, + 395, + 660 + ], + "spans": [ + { + "bbox": [ + 115, + 647, + 395, + 660 + ], + "score": 1.0, + "content": "interfaces using synthetic gradients. arXiv preprint arXiv:1608.05343, 2016.", + "type": "text" + } + ], + "index": 41, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 666, + 506, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 677 + ], + "score": 1.0, + "content": "N. P. Jouppi, C. Young, N. Patil, D. Patterson, G. Agrawal, R. Bajwa, S. Bates, S. Bhatia, N. Boden, A. Borchers,", + "type": "text" + } + ], + "index": 42, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 676, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 115, + 676, + 506, + 687 + ], + "score": 1.0, + "content": "et al. In-datacenter performance analysis of a tensor processing unit. arXiv preprint arXiv:1704.04760, 2017.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 693, + 506, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 693, + 506, + 705 + ], + "score": 1.0, + "content": "D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. CoRR, abs/1412.6980, 2014. URL", + "type": "text" + } + ], + "index": 44, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 703, + 283, + 715 + ], + "spans": [ + { + "bbox": [ + 115, + 703, + 283, + 715 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1412.6980.", + "type": "text" + } + ], + "index": 45, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 721, + 379, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 379, + 734 + ], + "score": 1.0, + "content": "Y. LeCun and C. Cortes. The MNIST database of handwritten digits, 1998.", + "type": "text" + } + ], + "index": 46, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 96 + ], + "score": 1.0, + "content": "Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel. Gated graph sequence neural networks. arXiv preprint", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 93, + 210, + 105 + ], + "spans": [ + { + "bbox": [ + 114, + 93, + 210, + 105 + ], + "score": 1.0, + "content": "arXiv:1511.05493, 2015.", + "type": "text", + "cross_page": true + } + ], + "index": 1, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "score": 1.0, + "content": "M. Looks, M. Herreshoff, D. Hutchins, and P. Norvig. Deep learning with dynamic computation graphs.", + "type": "text", + "cross_page": true + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 120, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 114, + 120, + 505, + 134 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1702.02181, 2017. Sentiment Tree Bank example: https://github.com/", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 131, + 471, + 144 + ], + "spans": [ + { + "bbox": [ + 116, + 131, + 471, + 144 + ], + "score": 1.0, + "content": "tensorflow/fold/blob/master/tensorflow_fold/g3doc/sentiment.ipynb.", + "type": "text", + "cross_page": true + } + ], + "index": 4, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 147, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 104, + 147, + 506, + 163 + ], + "score": 1.0, + "content": "I. Mitliagkas, C. Zhang, S. Hadjis, and C. Re. Asynchrony begets momentum, with an application to deep ´", + "type": "text", + "cross_page": true + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 158, + 298, + 172 + ], + "spans": [ + { + "bbox": [ + 114, + 158, + 298, + 172 + ], + "score": 1.0, + "content": "learning. arXiv preprint arXiv:1605.09774, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 6, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "D. G. Murray, F. McSherry, M. Isard, R. Isaacs, P. Barham, and M. Abadi. Incremental, iterative data processing", + "type": "text", + "cross_page": true + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 117, + 188, + 416, + 198 + ], + "spans": [ + { + "bbox": [ + 117, + 188, + 416, + 198 + ], + "score": 1.0, + "content": "with timely dataflow. Commun. ACM, 59(10):75–83, Sept. 2016. ISSN 0001-0782.", + "type": "text", + "cross_page": true + } + ], + "index": 8, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 203, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 104, + 203, + 506, + 219 + ], + "score": 1.0, + "content": "G. Neubig, C. Dyer, Y. Goldberg, A. Matthews, W. Ammar, A. Anastasopoulos, M. Ballesteros, D. Chiang,", + "type": "text", + "cross_page": true + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 215, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 115, + 215, + 506, + 227 + ], + "score": 1.0, + "content": "D. Clothiaux, T. Cohn, et al. Dynet: The dynamic neural network toolkit. arXiv preprint arXiv:1701.03980,", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 223, + 145, + 238 + ], + "spans": [ + { + "bbox": [ + 115, + 223, + 145, + 238 + ], + "score": 1.0, + "content": "2017a.", + "type": "text", + "cross_page": true + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 243, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 505, + 255 + ], + "score": 1.0, + "content": "G. Neubig, Y. Goldberg, and C. Dyer. On-the-fly operation batching in dynamic computation graphs. arXiv", + "type": "text", + "cross_page": true + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 252, + 246, + 266 + ], + "spans": [ + { + "bbox": [ + 114, + 252, + 246, + 266 + ], + "score": 1.0, + "content": "preprint arXiv:1705.07860, 2017b.", + "type": "text", + "cross_page": true + } + ], + "index": 13, + "is_list_end_line": true + }, + { + "bbox": [ + 103, + 269, + 506, + 284 + ], + "spans": [ + { + "bbox": [ + 103, + 269, + 506, + 284 + ], + "score": 1.0, + "content": "J. Nothman, N. Ringland, W. Radford, T. Murphy, and J. R. Curran. Learning multilingual named entity", + "type": "text", + "cross_page": true + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 281, + 375, + 293 + ], + "spans": [ + { + "bbox": [ + 115, + 281, + 375, + 293 + ], + "score": 1.0, + "content": "recognition from wikipedia. Artificial Intelligence, 194:151–175, 2013.", + "type": "text", + "cross_page": true + } + ], + "index": 15, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 298, + 343, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 343, + 311 + ], + "score": 1.0, + "content": "PyTorch core team. PyTorch. URL http://pytorch.org/.", + "type": "text", + "cross_page": true + } + ], + "index": 16, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 315, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 104, + 315, + 506, + 330 + ], + "score": 1.0, + "content": "R. Ramakrishnan, P. O. Dral, M. Rupp, and O. A. von Lilienfeld. Quantum chemistry structures and properties", + "type": "text", + "cross_page": true + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 327, + 289, + 338 + ], + "spans": [ + { + "bbox": [ + 116, + 327, + 289, + 338 + ], + "score": 1.0, + "content": "of 134 kilo molecules. Scientific Data, 1, 2014.", + "type": "text", + "cross_page": true + } + ], + "index": 18, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "score": 1.0, + "content": "B. Recht, C. Re, S. Wright, and F. Niu. Hogwild: A lock-free approach to parallelizing stochastic gradient", + "type": "text", + "cross_page": true + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 354, + 433, + 368 + ], + "spans": [ + { + "bbox": [ + 115, + 354, + 433, + 368 + ], + "score": 1.0, + "content": "descent. In Advances in Neural Information Processing Systems, pages 693–701, 2011.", + "type": "text", + "cross_page": true + } + ], + "index": 20, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 371, + 472, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 472, + 385 + ], + "score": 1.0, + "content": "S. Reed and N. De Freitas. Neural programmer-interpreters. arXiv preprint arXiv:1511.06279, 2015.", + "type": "text", + "cross_page": true + } + ], + "index": 21, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 390, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 402 + ], + "score": 1.0, + "content": "L. Ruddigkeit, R. Van Deursen, L. C. Blum, and J.-L. Reymond. Enumeration of 166 billion organic small", + "type": "text", + "cross_page": true + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 400, + 506, + 413 + ], + "spans": [ + { + "bbox": [ + 115, + 400, + 506, + 413 + ], + "score": 1.0, + "content": "molecules in the chemical universe database gdb-17. Journal of chemical information and modeling, 52(11):", + "type": "text", + "cross_page": true + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 410, + 185, + 423 + ], + "spans": [ + { + "bbox": [ + 116, + 410, + 185, + 423 + ], + "score": 1.0, + "content": "2864–2875, 2012.", + "type": "text", + "cross_page": true + } + ], + "index": 24, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 428, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 505, + 441 + ], + "score": 1.0, + "content": "F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini. The graph neural network model. IEEE", + "type": "text", + "cross_page": true + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 117, + 439, + 312, + 450 + ], + "spans": [ + { + "bbox": [ + 117, + 439, + 312, + 450 + ], + "score": 1.0, + "content": "Transactions on Neural Networks, 20(1):61–80, 2009.", + "type": "text", + "cross_page": true + } + ], + "index": 26, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 454, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 506, + 469 + ], + "score": 1.0, + "content": "S. Semeniuta, A. Severyn, and E. Barth. Recurrent dropout without memory loss. arXiv preprint", + "type": "text", + "cross_page": true + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 467, + 211, + 477 + ], + "spans": [ + { + "bbox": [ + 116, + 467, + 211, + 477 + ], + "score": 1.0, + "content": "arXiv:1603.05118, 2016.", + "type": "text", + "cross_page": true + } + ], + "index": 28, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 482, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 104, + 482, + 506, + 498 + ], + "score": 1.0, + "content": "N. Shazeer, A. Mirhoseini, K. Maziarz, A. Davis, Q. Le, G. Hinton, and J. Dean. Outrageously large neural", + "type": "text", + "cross_page": true + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 494, + 462, + 506 + ], + "spans": [ + { + "bbox": [ + 115, + 494, + 462, + 506 + ], + "score": 1.0, + "content": "networks: The sparsely-gated mixture-of-experts layer. arXiv preprint arXiv:1701.06538, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 30, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "score": 1.0, + "content": "R. Socher, C. C. Lin, C. Manning, and A. Y. Ng. Parsing natural scenes and natural language with recursive", + "type": "text", + "cross_page": true + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 521, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 114, + 521, + 506, + 536 + ], + "score": 1.0, + "content": "neural networks. In Proceedings of the 28th international conference on machine learning (ICML-11), pages", + "type": "text", + "cross_page": true + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 531, + 176, + 544 + ], + "spans": [ + { + "bbox": [ + 116, + 531, + 176, + 544 + ], + "score": 1.0, + "content": "129–136, 2011.", + "type": "text", + "cross_page": true + } + ], + "index": 33, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 548, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 104, + 548, + 506, + 564 + ], + "score": 1.0, + "content": "R. Socher, A. Perelygin, J. Y. Wu, J. Chuang, C. D. Manning, A. Y. Ng, C. Potts, et al. Recursive deep", + "type": "text", + "cross_page": true + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 560, + 506, + 572 + ], + "spans": [ + { + "bbox": [ + 115, + 560, + 506, + 572 + ], + "score": 1.0, + "content": "models for semantic compositionality over a sentiment treebank. In Proceedings of the conference on", + "type": "text", + "cross_page": true + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 569, + 507, + 583 + ], + "spans": [ + { + "bbox": [ + 115, + 569, + 507, + 583 + ], + "score": 1.0, + "content": "empirical methods in natural language processing (EMNLP), volume 1631, page 1642, 2013. Dataset:", + "type": "text", + "cross_page": true + } + ], + "index": 36 + }, + { + "bbox": [ + 117, + 581, + 379, + 591 + ], + "spans": [ + { + "bbox": [ + 117, + 581, + 379, + 591 + ], + "score": 1.0, + "content": "https://nlp.stanford.edu/sentiment/treebank.html.", + "type": "text", + "cross_page": true + } + ], + "index": 37, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 596, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 104, + 596, + 506, + 611 + ], + "score": 1.0, + "content": "K. S. Tai, R. Socher, and C. D. Manning. Improved semantic representations from tree-structured long short-term", + "type": "text", + "cross_page": true + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 608, + 333, + 620 + ], + "spans": [ + { + "bbox": [ + 115, + 608, + 333, + 620 + ], + "score": 1.0, + "content": "memory networks. arXiv preprint arXiv:1503.00075, 2015.", + "type": "text", + "cross_page": true + } + ], + "index": 39, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 623, + 507, + 639 + ], + "spans": [ + { + "bbox": [ + 104, + 623, + 507, + 639 + ], + "score": 1.0, + "content": "S. Tokui, K. Oono, S. Hido, and J. Clayton. Chainer: a next-generation open source framework for deep learning.", + "type": "text", + "cross_page": true + } + ], + "index": 40, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 634, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 114, + 634, + 506, + 649 + ], + "score": 1.0, + "content": "In Proceedings of workshop on machine learning systems (LearningSys) in the twenty-ninth annual conference", + "type": "text", + "cross_page": true + } + ], + "index": 41 + }, + { + "bbox": [ + 114, + 644, + 321, + 658 + ], + "spans": [ + { + "bbox": [ + 114, + 644, + 321, + 658 + ], + "score": 1.0, + "content": "on neural information processing systems (NIPS), 2015.", + "type": "text", + "cross_page": true + } + ], + "index": 42, + "is_list_end_line": true + } + ], + "index": 24, + "bbox_fs": [ + 104, + 121, + 507, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 70, + 507, + 665 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 96 + ], + "score": 1.0, + "content": "Y. Li, D. Tarlow, M. Brockschmidt, and R. Zemel. Gated graph sequence neural networks. arXiv preprint", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 114, + 93, + 210, + 105 + ], + "spans": [ + { + "bbox": [ + 114, + 93, + 210, + 105 + ], + "score": 1.0, + "content": "arXiv:1511.05493, 2015.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "score": 1.0, + "content": "M. Looks, M. Herreshoff, D. Hutchins, and P. Norvig. Deep learning with dynamic computation graphs.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 114, + 120, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 114, + 120, + 505, + 134 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1702.02181, 2017. Sentiment Tree Bank example: https://github.com/", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 131, + 471, + 144 + ], + "spans": [ + { + "bbox": [ + 116, + 131, + 471, + 144 + ], + "score": 1.0, + "content": "tensorflow/fold/blob/master/tensorflow_fold/g3doc/sentiment.ipynb.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 147, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 104, + 147, + 506, + 163 + ], + "score": 1.0, + "content": "I. Mitliagkas, C. Zhang, S. Hadjis, and C. Re. Asynchrony begets momentum, with an application to deep ´", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 114, + 158, + 298, + 172 + ], + "spans": [ + { + "bbox": [ + 114, + 158, + 298, + 172 + ], + "score": 1.0, + "content": "learning. arXiv preprint arXiv:1605.09774, 2016.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "D. G. Murray, F. McSherry, M. Isard, R. Isaacs, P. Barham, and M. Abadi. Incremental, iterative data processing", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 117, + 188, + 416, + 198 + ], + "spans": [ + { + "bbox": [ + 117, + 188, + 416, + 198 + ], + "score": 1.0, + "content": "with timely dataflow. Commun. ACM, 59(10):75–83, Sept. 2016. ISSN 0001-0782.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 203, + 506, + 219 + ], + "spans": [ + { + "bbox": [ + 104, + 203, + 506, + 219 + ], + "score": 1.0, + "content": "G. Neubig, C. Dyer, Y. Goldberg, A. Matthews, W. Ammar, A. Anastasopoulos, M. Ballesteros, D. Chiang,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 215, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 115, + 215, + 506, + 227 + ], + "score": 1.0, + "content": "D. Clothiaux, T. Cohn, et al. Dynet: The dynamic neural network toolkit. arXiv preprint arXiv:1701.03980,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 223, + 145, + 238 + ], + "spans": [ + { + "bbox": [ + 115, + 223, + 145, + 238 + ], + "score": 1.0, + "content": "2017a.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 243, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 243, + 505, + 255 + ], + "score": 1.0, + "content": "G. Neubig, Y. Goldberg, and C. Dyer. On-the-fly operation batching in dynamic computation graphs. arXiv", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 114, + 252, + 246, + 266 + ], + "spans": [ + { + "bbox": [ + 114, + 252, + 246, + 266 + ], + "score": 1.0, + "content": "preprint arXiv:1705.07860, 2017b.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 103, + 269, + 506, + 284 + ], + "spans": [ + { + "bbox": [ + 103, + 269, + 506, + 284 + ], + "score": 1.0, + "content": "J. Nothman, N. Ringland, W. Radford, T. Murphy, and J. R. Curran. Learning multilingual named entity", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 281, + 375, + 293 + ], + "spans": [ + { + "bbox": [ + 115, + 281, + 375, + 293 + ], + "score": 1.0, + "content": "recognition from wikipedia. Artificial Intelligence, 194:151–175, 2013.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 298, + 343, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 298, + 343, + 311 + ], + "score": 1.0, + "content": "PyTorch core team. PyTorch. URL http://pytorch.org/.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 315, + 506, + 330 + ], + "spans": [ + { + "bbox": [ + 104, + 315, + 506, + 330 + ], + "score": 1.0, + "content": "R. Ramakrishnan, P. O. Dral, M. Rupp, and O. A. von Lilienfeld. Quantum chemistry structures and properties", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 327, + 289, + 338 + ], + "spans": [ + { + "bbox": [ + 116, + 327, + 289, + 338 + ], + "score": 1.0, + "content": "of 134 kilo molecules. Scientific Data, 1, 2014.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 506, + 357 + ], + "score": 1.0, + "content": "B. Recht, C. Re, S. Wright, and F. Niu. Hogwild: A lock-free approach to parallelizing stochastic gradient", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 354, + 433, + 368 + ], + "spans": [ + { + "bbox": [ + 115, + 354, + 433, + 368 + ], + "score": 1.0, + "content": "descent. In Advances in Neural Information Processing Systems, pages 693–701, 2011.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 371, + 472, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 472, + 385 + ], + "score": 1.0, + "content": "S. Reed and N. De Freitas. Neural programmer-interpreters. arXiv preprint arXiv:1511.06279, 2015.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 390, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 402 + ], + "score": 1.0, + "content": "L. Ruddigkeit, R. Van Deursen, L. C. Blum, and J.-L. Reymond. Enumeration of 166 billion organic small", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 400, + 506, + 413 + ], + "spans": [ + { + "bbox": [ + 115, + 400, + 506, + 413 + ], + "score": 1.0, + "content": "molecules in the chemical universe database gdb-17. Journal of chemical information and modeling, 52(11):", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 410, + 185, + 423 + ], + "spans": [ + { + "bbox": [ + 116, + 410, + 185, + 423 + ], + "score": 1.0, + "content": "2864–2875, 2012.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 428, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 505, + 441 + ], + "score": 1.0, + "content": "F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini. The graph neural network model. IEEE", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 117, + 439, + 312, + 450 + ], + "spans": [ + { + "bbox": [ + 117, + 439, + 312, + 450 + ], + "score": 1.0, + "content": "Transactions on Neural Networks, 20(1):61–80, 2009.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 454, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 506, + 469 + ], + "score": 1.0, + "content": "S. Semeniuta, A. Severyn, and E. Barth. Recurrent dropout without memory loss. arXiv preprint", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 467, + 211, + 477 + ], + "spans": [ + { + "bbox": [ + 116, + 467, + 211, + 477 + ], + "score": 1.0, + "content": "arXiv:1603.05118, 2016.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 482, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 104, + 482, + 506, + 498 + ], + "score": 1.0, + "content": "N. Shazeer, A. Mirhoseini, K. Maziarz, A. Davis, Q. Le, G. Hinton, and J. Dean. Outrageously large neural", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 494, + 462, + 506 + ], + "spans": [ + { + "bbox": [ + 115, + 494, + 462, + 506 + ], + "score": 1.0, + "content": "networks: The sparsely-gated mixture-of-experts layer. arXiv preprint arXiv:1701.06538, 2017.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 524 + ], + "score": 1.0, + "content": "R. Socher, C. C. Lin, C. Manning, and A. Y. Ng. Parsing natural scenes and natural language with recursive", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 114, + 521, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 114, + 521, + 506, + 536 + ], + "score": 1.0, + "content": "neural networks. In Proceedings of the 28th international conference on machine learning (ICML-11), pages", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 531, + 176, + 544 + ], + "spans": [ + { + "bbox": [ + 116, + 531, + 176, + 544 + ], + "score": 1.0, + "content": "129–136, 2011.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 548, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 104, + 548, + 506, + 564 + ], + "score": 1.0, + "content": "R. Socher, A. Perelygin, J. Y. Wu, J. Chuang, C. D. Manning, A. Y. Ng, C. Potts, et al. Recursive deep", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 560, + 506, + 572 + ], + "spans": [ + { + "bbox": [ + 115, + 560, + 506, + 572 + ], + "score": 1.0, + "content": "models for semantic compositionality over a sentiment treebank. In Proceedings of the conference on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 569, + 507, + 583 + ], + "spans": [ + { + "bbox": [ + 115, + 569, + 507, + 583 + ], + "score": 1.0, + "content": "empirical methods in natural language processing (EMNLP), volume 1631, page 1642, 2013. Dataset:", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 117, + 581, + 379, + 591 + ], + "spans": [ + { + "bbox": [ + 117, + 581, + 379, + 591 + ], + "score": 1.0, + "content": "https://nlp.stanford.edu/sentiment/treebank.html.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 596, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 104, + 596, + 506, + 611 + ], + "score": 1.0, + "content": "K. S. Tai, R. Socher, and C. D. Manning. Improved semantic representations from tree-structured long short-term", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 608, + 333, + 620 + ], + "spans": [ + { + "bbox": [ + 115, + 608, + 333, + 620 + ], + "score": 1.0, + "content": "memory networks. arXiv preprint arXiv:1503.00075, 2015.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 104, + 623, + 507, + 639 + ], + "spans": [ + { + "bbox": [ + 104, + 623, + 507, + 639 + ], + "score": 1.0, + "content": "S. Tokui, K. Oono, S. Hido, and J. Clayton. Chainer: a next-generation open source framework for deep learning.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 114, + 634, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 114, + 634, + 506, + 649 + ], + "score": 1.0, + "content": "In Proceedings of workshop on machine learning systems (LearningSys) in the twenty-ninth annual conference", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 114, + 644, + 321, + 658 + ], + "spans": [ + { + "bbox": [ + 114, + 644, + 321, + 658 + ], + "score": 1.0, + "content": "on neural information processing systems (NIPS), 2015.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 21 + } + ], + "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": [ + 105, + 70, + 507, + 665 + ], + "lines": [], + "index": 21, + "bbox_fs": [ + 103, + 83, + 507, + 658 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 324, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 325, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 325, + 95 + ], + "score": 1.0, + "content": "A AMPNET RUNTIME IMPLEMENTATION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 106, + 504, + 161 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 506, + 119 + ], + "score": 1.0, + "content": "We have implemented an AMPNet runtime for multi-core CPUs. Our runtime spawns multiple", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 118, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 106, + 118, + 505, + 129 + ], + "score": 1.0, + "content": "workers each associated with a hardware thread and hosting one or more IR nodes – in a more general", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 128, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 141 + ], + "score": 1.0, + "content": "setting each worker corresponds to a compute device. To remain faithful to a distributed environment", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 139, + 506, + 152 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 506, + 152 + ], + "score": 1.0, + "content": "communication is only through message passing. Each worker is equipped with a multiple-producer", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 150, + 459, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 459, + 163 + ], + "score": 1.0, + "content": "single-consumer queue that can accept messages for any IR node hosted on that worker.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 167, + 505, + 244 + ], + "lines": [ + { + "bbox": [ + 105, + 167, + 505, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 167, + 505, + 180 + ], + "score": 1.0, + "content": "The main worker loop periodically offloads messages from the concurrent queue to a worker-local", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 178, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 505, + 191 + ], + "score": 1.0, + "content": "priority queue that assigns higher priority to backward messages. Backward prioritization is designed", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 189, + 506, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 506, + 201 + ], + "score": 1.0, + "content": "for situations when multiple IR nodes with a dependency on the IR graph end up hosted on the same", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 201, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 505, + 212 + ], + "score": 1.0, + "content": "worker. As a consequence, backpropagation can complete faster and new instances can be pumped", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "score": 1.0, + "content": "in by the controller. We dequeue the top message and invoke the forward or backward method of", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 222, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 234 + ], + "score": 1.0, + "content": "the target IR node. These methods may update internal IR node state (such as cache the state of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 233, + 477, + 247 + ], + "spans": [ + { + "bbox": [ + 105, + 233, + 477, + 247 + ], + "score": 1.0, + "content": "incoming message and wait for more messages) or post new forward or backward messages.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 250, + 505, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "How to update the parameters using the gradients is a configuration option that selects amongst a", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 260, + 505, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 505, + 274 + ], + "score": 1.0, + "content": "range of optimization algorithms. We have implemented runtime configuration options for selecting", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 272, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 285 + ], + "score": 1.0, + "content": "several well-known schemes such as (momentum-)SGD and Adam Kingma and Ba (2014), and for", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 283, + 275, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 275, + 295 + ], + "score": 1.0, + "content": "controlling the training hyper-parameters.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5 + }, + { + "type": "title", + "bbox": [ + 107, + 311, + 343, + 323 + ], + "lines": [ + { + "bbox": [ + 105, + 310, + 344, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 344, + 325 + ], + "score": 1.0, + "content": "B DETAILS OF THE EXPERIMENTAL RESULTS", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 335, + 505, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "score": 1.0, + "content": "We provide more details of the experiment and analysis in this section. All experiments were carried", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "score": 1.0, + "content": "out on machines with 16 cores and 112 GB of RAM. The validation curves were averaged over at", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 370 + ], + "score": 1.0, + "content": "least 20 independent runs. The time/epoch to reach a target accuracy was calculated as median of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "score": 1.0, + "content": "time an algorithm takes to reach the target accuracy over the repetitions. We found this approach to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 379, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 505, + 391 + ], + "score": 1.0, + "content": "be more reliable than reporting the time/epoch when the averaged accuracy reaches the target. Table", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 403 + ], + "score": 1.0, + "content": "2 shows both the training and validation throughputs we obtained with AMPNet and our TensorFlow", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 401, + 149, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 149, + 414 + ], + "score": 1.0, + "content": "baselines.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21 + }, + { + "type": "title", + "bbox": [ + 107, + 426, + 167, + 438 + ], + "lines": [ + { + "bbox": [ + 105, + 425, + 168, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 168, + 439 + ], + "score": 1.0, + "content": "B.1 MNIST", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 447, + 505, + 480 + ], + "lines": [ + { + "bbox": [ + 106, + 447, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 505, + 459 + ], + "score": 1.0, + "content": "We train a 4-layer perceptron with ReLUs and 784-dimensional hidden units on MNIST (LeCun and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "score": 1.0, + "content": "Cortes, 1998). Both the AMP runtime and a TensorFlow baseline use SGD with learning rate 0.1 and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 469, + 179, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 179, + 480 + ], + "score": 1.0, + "content": "batch size of 100.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 486, + 505, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "Figure 6(a) shows the validation accuracy vs. time, validation accuracy vs. epochs, and throughputs", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "of synchronous and asynchronous versions of AMPNet as well as TensorFlow. The throughput greatly", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 509, + 506, + 521 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 303, + 521 + ], + "score": 1.0, + "content": "increases from synchronous (max active key", + "type": "text" + }, + { + "bbox": [ + 303, + 509, + 324, + 519 + ], + "score": 0.33, + "content": "\\mathfrak { s } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 509, + 476, + 521 + ], + "score": 1.0, + "content": ") to asynchronous (max active key", + "type": "text" + }, + { + "bbox": [ + 476, + 509, + 501, + 519 + ], + "score": 0.61, + "content": "s = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 509, + 506, + 521 + ], + "score": 1.0, + "content": ")", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 518, + 507, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 507, + 532 + ], + "score": 1.0, + "content": "while the speed of convergence (middle panel) is hardly affected for mild amount of asynchrony.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 529, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 252, + 543 + ], + "score": 1.0, + "content": "Taking higher max active keys", + "type": "text" + }, + { + "bbox": [ + 253, + 531, + 272, + 541 + ], + "score": 0.55, + "content": "= 8", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 529, + 506, + 543 + ], + "score": 1.0, + "content": "increase throughput only very little (because there is no", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 541, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 554 + ], + "score": 1.0, + "content": "more work) and seems to rather make the convergence more unstable. This is due to the fact that our", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 552, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 564 + ], + "score": 1.0, + "content": "current scheduler is greedy and pumps in a forward message whenever the first layer is unoccupied,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 562, + 486, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 486, + 576 + ], + "score": 1.0, + "content": "which leads to large gradient staleness. Clearly a better scheduling will remove this sensitivity.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 32.5 + }, + { + "type": "title", + "bbox": [ + 108, + 588, + 246, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 587, + 248, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 248, + 600 + ], + "score": 1.0, + "content": "B.2 LIST REDUCTION DATASET", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 608, + 505, + 663 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 505, + 621 + ], + "score": 1.0, + "content": "We train a vanilla RNN to perform reduction operations on variable length lists of digits. Each", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 106, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "training instance is a sequence of at most 10 tokens: The first token indicates which of 4 reduction", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 630, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 644 + ], + "score": 1.0, + "content": "operations 2 is to be performed, and the remaining tokens represent the list of digits. The output is the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 379, + 655 + ], + "score": 1.0, + "content": "result of the calculation rounded modulo 10. The dataset consists of", + "type": "text" + }, + { + "bbox": [ + 379, + 641, + 394, + 651 + ], + "score": 0.88, + "content": "1 0 ^ { 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 639, + 446, + 655 + ], + "score": 1.0, + "content": "training and", + "type": "text" + }, + { + "bbox": [ + 446, + 641, + 462, + 651 + ], + "score": 0.88, + "content": "1 0 ^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 639, + 506, + 655 + ], + "score": 1.0, + "content": "validation", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 652, + 148, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 148, + 664 + ], + "score": 1.0, + "content": "instances.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "We present this task as a classification problem to a vanilla RNN with ReLU activation and a hidden", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 680, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 506, + 693 + ], + "score": 1.0, + "content": "dimension of 128. All parameterized operations are affinitized on individual workers. We bucket", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 691, + 435, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 691, + 435, + 704 + ], + "score": 1.0, + "content": "training instances into batches of 100 sequences (in the baseline and in AMPNet).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 712, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 709, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 118, + 709, + 319, + 724 + ], + "score": 1.0, + "content": "2The operations considered in our toy dataset act on a list", + "type": "text" + }, + { + "bbox": [ + 320, + 712, + 327, + 720 + ], + "score": 0.79, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 709, + 486, + 724 + ], + "score": 1.0, + "content": "and are expressed in python syntax as: mean", + "type": "text" + }, + { + "bbox": [ + 487, + 712, + 501, + 722 + ], + "score": 0.7, + "content": "( L )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 709, + 506, + 724 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 721, + 386, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 131, + 732 + ], + "score": 1.0, + "content": "mean", + "type": "text" + }, + { + "bbox": [ + 132, + 722, + 173, + 732 + ], + "score": 0.39, + "content": "( L [ 0 : : 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 721, + 279, + 732 + ], + "score": 1.0, + "content": ")-mean(L[1::2]), max(", + "type": "text" + }, + { + "bbox": [ + 279, + 722, + 288, + 731 + ], + "score": 0.41, + "content": "L", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 721, + 315, + 732 + ], + "score": 1.0, + "content": ")-min", + "type": "text" + }, + { + "bbox": [ + 316, + 722, + 329, + 731 + ], + "score": 0.53, + "content": "( L )", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 721, + 365, + 732 + ], + "score": 1.0, + "content": "and len", + "type": "text" + }, + { + "bbox": [ + 366, + 722, + 380, + 731 + ], + "score": 0.71, + "content": "( L )", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 721, + 386, + 732 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 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, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 324, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 325, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 325, + 95 + ], + "score": 1.0, + "content": "A AMPNET RUNTIME IMPLEMENTATION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 106, + 504, + 161 + ], + "lines": [ + { + "bbox": [ + 105, + 105, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 506, + 119 + ], + "score": 1.0, + "content": "We have implemented an AMPNet runtime for multi-core CPUs. Our runtime spawns multiple", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 118, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 106, + 118, + 505, + 129 + ], + "score": 1.0, + "content": "workers each associated with a hardware thread and hosting one or more IR nodes – in a more general", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 128, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 506, + 141 + ], + "score": 1.0, + "content": "setting each worker corresponds to a compute device. To remain faithful to a distributed environment", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 139, + 506, + 152 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 506, + 152 + ], + "score": 1.0, + "content": "communication is only through message passing. Each worker is equipped with a multiple-producer", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 150, + 459, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 150, + 459, + 163 + ], + "score": 1.0, + "content": "single-consumer queue that can accept messages for any IR node hosted on that worker.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 105, + 506, + 163 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 167, + 505, + 244 + ], + "lines": [ + { + "bbox": [ + 105, + 167, + 505, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 167, + 505, + 180 + ], + "score": 1.0, + "content": "The main worker loop periodically offloads messages from the concurrent queue to a worker-local", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 178, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 505, + 191 + ], + "score": 1.0, + "content": "priority queue that assigns higher priority to backward messages. Backward prioritization is designed", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 189, + 506, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 506, + 201 + ], + "score": 1.0, + "content": "for situations when multiple IR nodes with a dependency on the IR graph end up hosted on the same", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 201, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 505, + 212 + ], + "score": 1.0, + "content": "worker. As a consequence, backpropagation can complete faster and new instances can be pumped", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 211, + 506, + 223 + ], + "score": 1.0, + "content": "in by the controller. We dequeue the top message and invoke the forward or backward method of", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 222, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 234 + ], + "score": 1.0, + "content": "the target IR node. These methods may update internal IR node state (such as cache the state of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 233, + 477, + 247 + ], + "spans": [ + { + "bbox": [ + 105, + 233, + 477, + 247 + ], + "score": 1.0, + "content": "incoming message and wait for more messages) or post new forward or backward messages.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 167, + 506, + 247 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 250, + 505, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "How to update the parameters using the gradients is a configuration option that selects amongst a", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 260, + 505, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 505, + 274 + ], + "score": 1.0, + "content": "range of optimization algorithms. We have implemented runtime configuration options for selecting", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 272, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 285 + ], + "score": 1.0, + "content": "several well-known schemes such as (momentum-)SGD and Adam Kingma and Ba (2014), and for", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 283, + 275, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 283, + 275, + 295 + ], + "score": 1.0, + "content": "controlling the training hyper-parameters.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 249, + 506, + 295 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 311, + 343, + 323 + ], + "lines": [ + { + "bbox": [ + 105, + 310, + 344, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 344, + 325 + ], + "score": 1.0, + "content": "B DETAILS OF THE EXPERIMENTAL RESULTS", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 335, + 505, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 348 + ], + "score": 1.0, + "content": "We provide more details of the experiment and analysis in this section. All experiments were carried", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 506, + 359 + ], + "score": 1.0, + "content": "out on machines with 16 cores and 112 GB of RAM. The validation curves were averaged over at", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 358, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 370 + ], + "score": 1.0, + "content": "least 20 independent runs. The time/epoch to reach a target accuracy was calculated as median of the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 506, + 381 + ], + "score": 1.0, + "content": "time an algorithm takes to reach the target accuracy over the repetitions. We found this approach to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 379, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 505, + 391 + ], + "score": 1.0, + "content": "be more reliable than reporting the time/epoch when the averaged accuracy reaches the target. Table", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 390, + 506, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 506, + 403 + ], + "score": 1.0, + "content": "2 shows both the training and validation throughputs we obtained with AMPNet and our TensorFlow", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 401, + 149, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 149, + 414 + ], + "score": 1.0, + "content": "baselines.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 336, + 506, + 414 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 426, + 167, + 438 + ], + "lines": [ + { + "bbox": [ + 105, + 425, + 168, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 168, + 439 + ], + "score": 1.0, + "content": "B.1 MNIST", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 447, + 505, + 480 + ], + "lines": [ + { + "bbox": [ + 106, + 447, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 505, + 459 + ], + "score": 1.0, + "content": "We train a 4-layer perceptron with ReLUs and 784-dimensional hidden units on MNIST (LeCun and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "score": 1.0, + "content": "Cortes, 1998). Both the AMP runtime and a TensorFlow baseline use SGD with learning rate 0.1 and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 469, + 179, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 179, + 480 + ], + "score": 1.0, + "content": "batch size of 100.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 447, + 505, + 480 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 486, + 505, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "Figure 6(a) shows the validation accuracy vs. time, validation accuracy vs. epochs, and throughputs", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "of synchronous and asynchronous versions of AMPNet as well as TensorFlow. The throughput greatly", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 509, + 506, + 521 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 303, + 521 + ], + "score": 1.0, + "content": "increases from synchronous (max active key", + "type": "text" + }, + { + "bbox": [ + 303, + 509, + 324, + 519 + ], + "score": 0.33, + "content": "\\mathfrak { s } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 509, + 476, + 521 + ], + "score": 1.0, + "content": ") to asynchronous (max active key", + "type": "text" + }, + { + "bbox": [ + 476, + 509, + 501, + 519 + ], + "score": 0.61, + "content": "s = 4", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 509, + 506, + 521 + ], + "score": 1.0, + "content": ")", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 518, + 507, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 507, + 532 + ], + "score": 1.0, + "content": "while the speed of convergence (middle panel) is hardly affected for mild amount of asynchrony.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 529, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 252, + 543 + ], + "score": 1.0, + "content": "Taking higher max active keys", + "type": "text" + }, + { + "bbox": [ + 253, + 531, + 272, + 541 + ], + "score": 0.55, + "content": "= 8", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 529, + 506, + 543 + ], + "score": 1.0, + "content": "increase throughput only very little (because there is no", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 541, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 554 + ], + "score": 1.0, + "content": "more work) and seems to rather make the convergence more unstable. This is due to the fact that our", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 552, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 506, + 564 + ], + "score": 1.0, + "content": "current scheduler is greedy and pumps in a forward message whenever the first layer is unoccupied,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 562, + 486, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 486, + 576 + ], + "score": 1.0, + "content": "which leads to large gradient staleness. Clearly a better scheduling will remove this sensitivity.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 486, + 507, + 576 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 588, + 246, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 587, + 248, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 248, + 600 + ], + "score": 1.0, + "content": "B.2 LIST REDUCTION DATASET", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 608, + 505, + 663 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 505, + 621 + ], + "score": 1.0, + "content": "We train a vanilla RNN to perform reduction operations on variable length lists of digits. Each", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 106, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "training instance is a sequence of at most 10 tokens: The first token indicates which of 4 reduction", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 630, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 644 + ], + "score": 1.0, + "content": "operations 2 is to be performed, and the remaining tokens represent the list of digits. The output is the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 639, + 506, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 379, + 655 + ], + "score": 1.0, + "content": "result of the calculation rounded modulo 10. The dataset consists of", + "type": "text" + }, + { + "bbox": [ + 379, + 641, + 394, + 651 + ], + "score": 0.88, + "content": "1 0 ^ { 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 639, + 446, + 655 + ], + "score": 1.0, + "content": "training and", + "type": "text" + }, + { + "bbox": [ + 446, + 641, + 462, + 651 + ], + "score": 0.88, + "content": "1 0 ^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 639, + 506, + 655 + ], + "score": 1.0, + "content": "validation", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 652, + 148, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 148, + 664 + ], + "score": 1.0, + "content": "instances.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 609, + 506, + 664 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 669, + 505, + 703 + ], + "lines": [ + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "We present this task as a classification problem to a vanilla RNN with ReLU activation and a hidden", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 680, + 506, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 506, + 693 + ], + "score": 1.0, + "content": "dimension of 128. All parameterized operations are affinitized on individual workers. We bucket", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 691, + 435, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 691, + 435, + 704 + ], + "score": 1.0, + "content": "training instances into batches of 100 sequences (in the baseline and in AMPNet).", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44, + "bbox_fs": [ + 106, + 669, + 506, + 704 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 112, + 40, + 502, + 663 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 112, + 40, + 502, + 663 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 112, + 40, + 502, + 663 + ], + "spans": [ + { + "bbox": [ + 112, + 40, + 502, + 663 + ], + "score": 0.956, + "type": "image", + "image_path": "eef9ddeeba17a3a2c8c533667c6147d6a90efc0b4984c54160c37bc192ed5d3c.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 112, + 40, + 502, + 247.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 112, + 247.66666666666666, + 502, + 455.3333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 112, + 455.3333333333333, + 502, + 663.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 687, + 506, + 732 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "Figure 6(b) shows the validation accuracy vs. time and the number of epochs, and throughputs", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "of the methods we discussed in the main text on the list reduction dataset. We first notice that", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 371, + 722 + ], + "score": 1.0, + "content": "increasing the asynchrony from synchronous (max active key", + "type": "text" + }, + { + "bbox": [ + 371, + 711, + 385, + 720 + ], + "score": 0.45, + "content": "\\tt { 3 = } 1", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 710, + 482, + 722 + ], + "score": 1.0, + "content": ") to max active key", + "type": "text" + }, + { + "bbox": [ + 483, + 710, + 505, + 720 + ], + "score": 0.55, + "content": " \\textrm { s } = 4", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 208, + 733 + ], + "score": 1.0, + "content": "and max active keys", + "type": "text" + }, + { + "bbox": [ + 209, + 721, + 232, + 731 + ], + "score": 0.58, + "content": "= 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "affects the convergence very little at least in average. However, there", + "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": [ + 107, + 25, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 107, + 25, + 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, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 112, + 40, + 502, + 663 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 112, + 40, + 502, + 663 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 112, + 40, + 502, + 663 + ], + "spans": [ + { + "bbox": [ + 112, + 40, + 502, + 663 + ], + "score": 0.956, + "type": "image", + "image_path": "eef9ddeeba17a3a2c8c533667c6147d6a90efc0b4984c54160c37bc192ed5d3c.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 112, + 40, + 502, + 247.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 112, + 247.66666666666666, + 502, + 455.3333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 112, + 455.3333333333333, + 502, + 663.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 687, + 506, + 732 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "Figure 6(b) shows the validation accuracy vs. time and the number of epochs, and throughputs", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "of the methods we discussed in the main text on the list reduction dataset. We first notice that", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 371, + 722 + ], + "score": 1.0, + "content": "increasing the asynchrony from synchronous (max active key", + "type": "text" + }, + { + "bbox": [ + 371, + 711, + 385, + 720 + ], + "score": 0.45, + "content": "\\tt { 3 = } 1", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 710, + 482, + 722 + ], + "score": 1.0, + "content": ") to max active key", + "type": "text" + }, + { + "bbox": [ + 483, + 710, + 505, + 720 + ], + "score": 0.55, + "content": " \\textrm { s } = 4", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 208, + 733 + ], + "score": 1.0, + "content": "and max active keys", + "type": "text" + }, + { + "bbox": [ + 209, + 721, + 232, + 731 + ], + "score": 0.58, + "content": "= 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "affects the convergence very little at least in average. However, there", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 113, + 86, + 503, + 273 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 113, + 86, + 503, + 273 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 86, + 503, + 273 + ], + "spans": [ + { + "bbox": [ + 113, + 86, + 503, + 273 + ], + "score": 0.95, + "type": "image", + "image_path": "72284ee41911113dff20759ede8d779a56a39d05d8a8ea74bd770e08d983f2f4.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 113, + 86, + 503, + 148.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 113, + 148.33333333333334, + 503, + 210.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 113, + 210.66666666666669, + 503, + 273.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "image", + "bbox": [ + 115, + 330, + 498, + 560 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 115, + 330, + 498, + 560 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 115, + 330, + 498, + 558 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 498, + 558 + ], + "score": 0.949, + "type": "image", + "image_path": "384dac4f026f5bd54a93a05e1e5522d9b18a335185869785c99e0132fddf2c6a.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 115, + 330, + 498, + 406.6666666666667 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 115, + 406.6666666666667, + 498, + 483.33333333333337 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 115, + 483.33333333333337, + 498, + 560.0 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "is also very little speedup without introducing replicas as we discussed in the main text. Increasing the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 368, + 645 + ], + "score": 1.0, + "content": "number of replicas increases the throughput almost linearly from", + "type": "text" + }, + { + "bbox": [ + 369, + 633, + 385, + 644 + ], + "score": 0.44, + "content": "1 3 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "sequences/s (synchronous) to", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "35k sequences/s (2 replicas) and over 70k sequences/s (4 replicas). Convergence is almost unaffected", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "for 2 replicas. This was rather surprising because the parameters of the replicas are only synchronized", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "after each epoch as we described in Sec. 5. A slight slow-down in convergence can be noticed for", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 282, + 690 + ], + "score": 1.0, + "content": "4 replicas. Since even max active keys", + "type": "text" + }, + { + "bbox": [ + 282, + 677, + 307, + 687 + ], + "score": 0.49, + "content": "= 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "has almost no effect on the convergence without", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "score": 1.0, + "content": "replicas, this is not due to asynchrony. We also tried to synchronize more frequently but this did", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "not help. Thus we believe that the slow-down is due to the increase in the effective minibatch size", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "resulting in reduced number of updates per epoch, which is commonly observed in data parallel", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 719, + 143, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 143, + 735 + ], + "score": 1.0, + "content": "training.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10.5 + } + ], + "page_idx": 13, + "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, + 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": [ + 113, + 86, + 503, + 273 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 113, + 86, + 503, + 273 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 86, + 503, + 273 + ], + "spans": [ + { + "bbox": [ + 113, + 86, + 503, + 273 + ], + "score": 0.95, + "type": "image", + "image_path": "72284ee41911113dff20759ede8d779a56a39d05d8a8ea74bd770e08d983f2f4.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 113, + 86, + 503, + 148.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 113, + 148.33333333333334, + 503, + 210.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 113, + 210.66666666666669, + 503, + 273.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "image", + "bbox": [ + 115, + 330, + 498, + 560 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 115, + 330, + 498, + 560 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 115, + 330, + 498, + 558 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 498, + 558 + ], + "score": 0.949, + "type": "image", + "image_path": "384dac4f026f5bd54a93a05e1e5522d9b18a335185869785c99e0132fddf2c6a.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 115, + 330, + 498, + 406.6666666666667 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 115, + 406.6666666666667, + 498, + 483.33333333333337 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 115, + 483.33333333333337, + 498, + 560.0 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "is also very little speedup without introducing replicas as we discussed in the main text. Increasing the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 368, + 645 + ], + "score": 1.0, + "content": "number of replicas increases the throughput almost linearly from", + "type": "text" + }, + { + "bbox": [ + 369, + 633, + 385, + 644 + ], + "score": 0.44, + "content": "1 3 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "sequences/s (synchronous) to", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "35k sequences/s (2 replicas) and over 70k sequences/s (4 replicas). Convergence is almost unaffected", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "for 2 replicas. This was rather surprising because the parameters of the replicas are only synchronized", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 678 + ], + "score": 1.0, + "content": "after each epoch as we described in Sec. 5. A slight slow-down in convergence can be noticed for", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 282, + 690 + ], + "score": 1.0, + "content": "4 replicas. Since even max active keys", + "type": "text" + }, + { + "bbox": [ + 282, + 677, + 307, + 687 + ], + "score": 0.49, + "content": "= 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "has almost no effect on the convergence without", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "score": 1.0, + "content": "replicas, this is not due to asynchrony. We also tried to synchronize more frequently but this did", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "not help. Thus we believe that the slow-down is due to the increase in the effective minibatch size", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "resulting in reduced number of updates per epoch, which is commonly observed in data parallel", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 719, + 143, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 143, + 735 + ], + "score": 1.0, + "content": "training.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 622, + 506, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 110, + 85, + 501, + 230 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 85, + 501, + 230 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 85, + 501, + 230 + ], + "spans": [ + { + "bbox": [ + 110, + 85, + 501, + 230 + ], + "score": 0.967, + "type": "image", + "image_path": "807d41ca3470b0323dc9b32f9915103be995b92e029053f3c0a82a7b00aa78f1.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 110, + 85, + 501, + 133.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 110, + 133.33333333333334, + 501, + 181.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 181.66666666666669, + 501, + 230.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 246, + 245, + 364, + 257 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 245, + 243, + 365, + 259 + ], + "spans": [ + { + "bbox": [ + 245, + 243, + 365, + 259 + ], + "score": 1.0, + "content": "Figure 6: Convergence plots.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "table", + "bbox": [ + 105, + 301, + 521, + 487 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 213, + 281, + 394, + 293 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 211, + 280, + 396, + 295 + ], + "spans": [ + { + "bbox": [ + 211, + 280, + 396, + 295 + ], + "score": 1.0, + "content": "Table 2: Training and validation throughputs.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "table_body", + "bbox": [ + 105, + 301, + 521, + 487 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 301, + 521, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 521, + 487 + ], + "score": 0.983, + "html": "
number of instancesAMPTensorFlow
trainvalidmaktrain inst/svalid inst/strain inst/svalid inst/s
MNIST (97%)60k10k12076609458808037
4626818973
List reduction (97%)100k10k113k39k18k43k
416k55k
1616k56k
(2 replicas)435k100k
(4 replicas) Sentiment (82%)871k178k
8511110111022802651583
4188692
QM9 (4.6)16258822
117k13k130271012173218
410072585
1617974845
Wikiner (94 %)142k1.7k141101
486284
32130426
", + "type": "table", + "image_path": "424d62ee02deca3e639dfd1ac72d5bd64f8c4fdd4a9728d7259a4d7a64f3e33d.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 105, + 301, + 521, + 363.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 105, + 363.0, + 521, + 425.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 105, + 425.0, + 521, + 487.0 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 5.0 + }, + { + "type": "title", + "bbox": [ + 108, + 512, + 278, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 279, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 279, + 525 + ], + "score": 1.0, + "content": "B.3 SENTIMENT TREE BANK DATASET", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 533, + 506, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "score": 1.0, + "content": "We consider the sentiment classification dataset from Socher et al. (2013) consisting of binarized", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 545, + 507, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 507, + 556 + ], + "score": 1.0, + "content": "constituency parse trees of English sentences with sentiment labels at each node. Following Tai et al.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 554, + 507, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 507, + 569 + ], + "score": 1.0, + "content": "Tai et al. (2015), we use 8,544 trees for training, 1,101 trees for validation, and 2,210 trees for testing.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 571, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "We use a Tree LSTM for this classification task based on the TensorFlow Fold Looks et al. (2017)", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 583, + 506, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 506, + 595 + ], + "score": 1.0, + "content": "benchmark model. Both the AMP and Fold models are trained following Tai et al. (2015) with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "the additional architectural modifications proposed by Looks et al. (2017); Semeniuta et al. (2016).", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 605, + 506, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 506, + 617 + ], + "score": 1.0, + "content": "Furthermore, we split our Tree-LSTM cell into Leaf LSTM and Branch LSTM cells. This does not", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "score": 1.0, + "content": "affect the expressiveness of the model because the LSTM cell receives either zero input (on branch) or", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 626, + 507, + 640 + ], + "spans": [ + { + "bbox": [ + 104, + 626, + 507, + 640 + ], + "score": 1.0, + "content": "zero hidden states (on leaves); i.e., the two cells do not share weights except for the bias parameters,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 463, + 650 + ], + "score": 1.0, + "content": "which are learned independently in our implementation. We compare the time to reach", + "type": "text" + }, + { + "bbox": [ + 463, + 638, + 486, + 648 + ], + "score": 0.84, + "content": "82 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 638, + 506, + 650 + ], + "score": 1.0, + "content": "fine", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 649, + 424, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 424, + 660 + ], + "score": 1.0, + "content": "grained (5 classes) accuracy (averaged over all the nodes) on the validation set.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "Figure 6(c) shows the averaged fine grained validation accuracy for the tree RNN model with", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "different max active keyson the Stanford Sentiment Tree Bank dataset. Interestingly although", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "TensorFlow Fold achieves higher throughput, AMPNet converges faster (in terms of the number of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "epochs). This speedup is mainly due to the fact that we are not batching and updating whenever we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "have accumulated 50 gradients (except for the lookup table node that updates every 1000 gradients);", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "50 gradients correspond to roughly 2 trees. The reason for the lower throughput compared to", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5 + } + ], + "page_idx": 14, + "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": [ + 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": [ + 110, + 85, + 501, + 230 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 110, + 85, + 501, + 230 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 85, + 501, + 230 + ], + "spans": [ + { + "bbox": [ + 110, + 85, + 501, + 230 + ], + "score": 0.967, + "type": "image", + "image_path": "807d41ca3470b0323dc9b32f9915103be995b92e029053f3c0a82a7b00aa78f1.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 110, + 85, + 501, + 133.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 110, + 133.33333333333334, + 501, + 181.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 110, + 181.66666666666669, + 501, + 230.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 246, + 245, + 364, + 257 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 245, + 243, + 365, + 259 + ], + "spans": [ + { + "bbox": [ + 245, + 243, + 365, + 259 + ], + "score": 1.0, + "content": "Figure 6: Convergence plots.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "table", + "bbox": [ + 105, + 301, + 521, + 487 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 213, + 281, + 394, + 293 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 211, + 280, + 396, + 295 + ], + "spans": [ + { + "bbox": [ + 211, + 280, + 396, + 295 + ], + "score": 1.0, + "content": "Table 2: Training and validation throughputs.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "table_body", + "bbox": [ + 105, + 301, + 521, + 487 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 301, + 521, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 521, + 487 + ], + "score": 0.983, + "html": "
number of instancesAMPTensorFlow
trainvalidmaktrain inst/svalid inst/strain inst/svalid inst/s
MNIST (97%)60k10k12076609458808037
4626818973
List reduction (97%)100k10k113k39k18k43k
416k55k
1616k56k
(2 replicas)435k100k
(4 replicas) Sentiment (82%)871k178k
8511110111022802651583
4188692
QM9 (4.6)16258822
117k13k130271012173218
410072585
1617974845
Wikiner (94 %)142k1.7k141101
486284
32130426
", + "type": "table", + "image_path": "424d62ee02deca3e639dfd1ac72d5bd64f8c4fdd4a9728d7259a4d7a64f3e33d.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 105, + 301, + 521, + 363.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 105, + 363.0, + 521, + 425.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 105, + 425.0, + 521, + 487.0 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 5.0 + }, + { + "type": "title", + "bbox": [ + 108, + 512, + 278, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 279, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 279, + 525 + ], + "score": 1.0, + "content": "B.3 SENTIMENT TREE BANK DATASET", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 533, + 506, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 546 + ], + "score": 1.0, + "content": "We consider the sentiment classification dataset from Socher et al. (2013) consisting of binarized", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 545, + 507, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 507, + 556 + ], + "score": 1.0, + "content": "constituency parse trees of English sentences with sentiment labels at each node. Following Tai et al.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 554, + 507, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 507, + 569 + ], + "score": 1.0, + "content": "Tai et al. (2015), we use 8,544 trees for training, 1,101 trees for validation, and 2,210 trees for testing.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 533, + 507, + 569 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 571, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "We use a Tree LSTM for this classification task based on the TensorFlow Fold Looks et al. (2017)", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 583, + 506, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 506, + 595 + ], + "score": 1.0, + "content": "benchmark model. Both the AMP and Fold models are trained following Tai et al. (2015) with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 506, + 606 + ], + "score": 1.0, + "content": "the additional architectural modifications proposed by Looks et al. (2017); Semeniuta et al. (2016).", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 605, + 506, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 506, + 617 + ], + "score": 1.0, + "content": "Furthermore, we split our Tree-LSTM cell into Leaf LSTM and Branch LSTM cells. This does not", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 506, + 628 + ], + "score": 1.0, + "content": "affect the expressiveness of the model because the LSTM cell receives either zero input (on branch) or", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 626, + 507, + 640 + ], + "spans": [ + { + "bbox": [ + 104, + 626, + 507, + 640 + ], + "score": 1.0, + "content": "zero hidden states (on leaves); i.e., the two cells do not share weights except for the bias parameters,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 638, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 463, + 650 + ], + "score": 1.0, + "content": "which are learned independently in our implementation. We compare the time to reach", + "type": "text" + }, + { + "bbox": [ + 463, + 638, + 486, + 648 + ], + "score": 0.84, + "content": "82 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 638, + 506, + 650 + ], + "score": 1.0, + "content": "fine", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 649, + 424, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 424, + 660 + ], + "score": 1.0, + "content": "grained (5 classes) accuracy (averaged over all the nodes) on the validation set.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15.5, + "bbox_fs": [ + 104, + 572, + 507, + 660 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "Figure 6(c) shows the averaged fine grained validation accuracy for the tree RNN model with", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "different max active keyson the Stanford Sentiment Tree Bank dataset. Interestingly although", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "TensorFlow Fold achieves higher throughput, AMPNet converges faster (in terms of the number of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "epochs). This speedup is mainly due to the fact that we are not batching and updating whenever we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "have accumulated 50 gradients (except for the lookup table node that updates every 1000 gradients);", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "50 gradients correspond to roughly 2 trees. The reason for the lower throughput compared to", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 665, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "TensorFlow Fold is that we are only grouping the leaf operations and not the branch operations.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 506, + 108 + ], + "score": 1.0, + "content": "Grouping the branch operations is possible by extending our IR nodes and we are actively working", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 131, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 131, + 117 + ], + "score": 1.0, + "content": "on it.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 416, + 134 + ], + "score": 1.0, + "content": "Figure 6(d) shows the same information for fixed max active keys", + "type": "text" + }, + { + "bbox": [ + 416, + 122, + 445, + 132 + ], + "score": 0.46, + "content": "\\qquad = \\quad 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 121, + 506, + 134 + ], + "score": 1.0, + "content": "and different", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "min update interval. We can see that as we increase min update interval from the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "originally used 50 to larger values, the peak of the validation accuracy shifts later and lower becom-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "ing closer to the curve obtained by TensorFlow Fold. This is consistent with the parallels between", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "min update interval and minibatch size we drew in Section 6. The min update interval", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 351, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 351, + 190 + ], + "score": 1.0, + "content": "parameter has marginal influence on the training throughput.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + }, + { + "type": "title", + "bbox": [ + 108, + 204, + 196, + 215 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 198, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 198, + 218 + ], + "score": 1.0, + "content": "B.4 QM9 DATASET", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 226, + 505, + 259 + ], + "lines": [ + { + "bbox": [ + 105, + 225, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 505, + 239 + ], + "score": 1.0, + "content": "We study a real-world application for GNNs: prediction of organic molecule properties from structural", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "formulae in the QM9 dataset Ruddigkeit et al. (2012); Ramakrishnan et al. (2014). GNNs have", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 248, + 344, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 344, + 260 + ], + "score": 1.0, + "content": "previously been applied to this task in Gilmer et al. (2017).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 264, + 505, + 342 + ], + "lines": [ + { + "bbox": [ + 105, + 264, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 506, + 278 + ], + "score": 1.0, + "content": "We concentrate on prediction of the norm of a molecule’s dipole moment using a regression layer", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 276, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 506, + 288 + ], + "score": 1.0, + "content": "build on the propagation model from Li et al. (2015) (corresponding to the simplest setting in Gilmer", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 286, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 104, + 286, + 506, + 300 + ], + "score": 1.0, + "content": "et al. (2017)). We use a hidden dimension of 100 and 4 propagation steps, initializing the graph nodes", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 298, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 310 + ], + "score": 1.0, + "content": "(atoms) following Gilmer et al. (2017). The molecules contain up to 29 atoms and in a TensorFlow", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 308, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 505, + 321 + ], + "score": 1.0, + "content": "baseline we bucket molecules into batches of 20 with atom counts differing by at most 1 within", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 318, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 104, + 318, + 506, + 333 + ], + "score": 1.0, + "content": "a batch. Following Gilmer et al. (2017), we report regression accuracies in multiples of a target", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 331, + 272, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 272, + 343 + ], + "score": 1.0, + "content": "accuracy from the chemistry community.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 347, + 504, + 370 + ], + "lines": [ + { + "bbox": [ + 106, + 347, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 415, + 360 + ], + "score": 1.0, + "content": "Figure 6(e) shows that GGNN can tolerate relatively large max active key", + "type": "text" + }, + { + "bbox": [ + 415, + 348, + 445, + 358 + ], + "score": 0.85, + "content": "s = 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 347, + 505, + 360 + ], + "score": 1.0, + "content": ", and increased", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 358, + 478, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 478, + 371 + ], + "score": 1.0, + "content": "the throughput significantly from 300 graphs/s (synchronous) to 1797 graphs/s (see Table 2).", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "title", + "bbox": [ + 108, + 386, + 213, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 386, + 214, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 386, + 214, + 398 + ], + "score": 1.0, + "content": "B.5 WIKINER DATASET", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 407, + 505, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 407, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 421 + ], + "score": 1.0, + "content": "We compare the performance of AMP training with DyNet with and without autobatching using", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "the BiLSTM tagger w/ char model from the DyNet benchmark suite3. This model consists of both", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 428, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 506, + 443 + ], + "score": 1.0, + "content": "character-level and word-level bidirectional LSTMs. The model uses a learnable word embedding", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "score": 1.0, + "content": "for frequent words (more than 5 times in the corpus) and character-level bidirectional LSTMs for", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 451, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 505, + 465 + ], + "score": 1.0, + "content": "infrequent words. We use our Distribute and Collect nodes to dynamically route the messages", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 463, + 251, + 476 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 251, + 476 + ], + "score": 1.0, + "content": "depending on the word frequencies.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 108, + 479, + 503, + 513 + ], + "lines": [ + { + "bbox": [ + 105, + 478, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 505, + 492 + ], + "score": 1.0, + "content": "Wikiner dataset4 is a named entity recognition dataset extracted from Wikipedia by Nothman et al.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 490, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 505, + 503 + ], + "score": 1.0, + "content": "(2013). We use the training/validation split provided by the DyNet benchmark suite with 142,153 and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 501, + 226, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 226, + 515 + ], + "score": 1.0, + "content": "1,696 sentences, respectively.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 107, + 518, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 318, + 531 + ], + "score": 1.0, + "content": "The result is shown in Fig. 6(f). We achieve more than", + "type": "text" + }, + { + "bbox": [ + 319, + 519, + 330, + 529 + ], + "score": 0.39, + "content": "3 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 517, + 493, + 531 + ], + "score": 1.0, + "content": "in throughput from max active keys", + "type": "text" + }, + { + "bbox": [ + 493, + 520, + 505, + 529 + ], + "score": 0.29, + "content": "=", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 207, + 541 + ], + "score": 1.0, + "content": "1 to max active key", + "type": "text" + }, + { + "bbox": [ + 207, + 530, + 235, + 540 + ], + "score": 0.66, + "content": "s = 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "without any noticeable loss in the validation accuracy after 2 or 3", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 541, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 552 + ], + "score": 1.0, + "content": "epochs. The slight decrease in the validation accuracy after the third epoch is due to overfitting and it", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 550, + 221, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 221, + 565 + ], + "score": 1.0, + "content": "is not related to asynchrony.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33.5 + }, + { + "type": "title", + "bbox": [ + 106, + 582, + 483, + 595 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 484, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 484, + 596 + ], + "score": 1.0, + "content": "C THROUGHPUT ESTIMATION FOR A HYPOTHETICAL 1 TFLOPS DEVICE", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 608, + 505, + 697 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 505, + 621 + ], + "score": 1.0, + "content": "In order to estimate the performance of AMPNet on a hypothetical device with 1 TFLOPS compute", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "capability, we replaced all fully connected layers in the network with a dummy operation that simply", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 630, + 506, + 644 + ], + "spans": [ + { + "bbox": [ + 104, + 630, + 338, + 644 + ], + "score": 1.0, + "content": "waits for a specified time. The dummy operation waits for", + "type": "text" + }, + { + "bbox": [ + 338, + 631, + 432, + 642 + ], + "score": 0.91, + "content": "2 \\cdot k \\cdot d _ { \\mathrm { i n } } \\cdot d _ { \\mathrm { o u t } } \\cdot 1 0 ^ { - 1 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 630, + 506, + 644 + ], + "score": 1.0, + "content": "seconds when the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 642, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 642, + 137, + 654 + ], + "score": 1.0, + "content": "input is", + "type": "text" + }, + { + "bbox": [ + 138, + 642, + 168, + 653 + ], + "score": 0.91, + "content": "k \\times d _ { \\mathrm { i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 642, + 265, + 654 + ], + "score": 1.0, + "content": "and the weight matrix is", + "type": "text" + }, + { + "bbox": [ + 265, + 642, + 306, + 653 + ], + "score": 0.91, + "content": "d _ { \\mathrm { i n } } \\times d _ { \\mathrm { o u t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 642, + 505, + 654 + ], + "score": 1.0, + "content": "for forward, backward, and gradient accumulation", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 104, + 650, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 104, + 650, + 196, + 667 + ], + "score": 1.0, + "content": "operation. It waits for", + "type": "text" + }, + { + "bbox": [ + 196, + 652, + 266, + 664 + ], + "score": 0.91, + "content": "d _ { \\mathrm { i n } } \\cdot \\dot { d } _ { \\mathrm { o u t } } \\cdot 1 0 ^ { - 1 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 650, + 506, + 667 + ], + "score": 1.0, + "content": "seconds for weight update. In this way we can maintain all", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 663, + 505, + 676 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 505, + 676 + ], + "score": 1.0, + "content": "the data-dependent control decisions (e.g., sequence length) identical to the original network and also", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 674, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 506, + 687 + ], + "score": 1.0, + "content": "measure the real time spent for all the other operations. In order to calculate the time to reach target", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 686, + 505, + 698 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 698 + ], + "score": 1.0, + "content": "accuracy, we take the median number of epochs the original network required to reach the target", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 40.5 + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 118, + 711, + 382, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 708, + 352, + 723 + ], + "spans": [ + { + "bbox": [ + 118, + 708, + 352, + 723 + ], + "score": 1.0, + "content": "3https://github.com/neulab/dynet-benchmark/", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 719, + 384, + 733 + ], + "spans": [ + { + "bbox": [ + 118, + 719, + 384, + 733 + ], + "score": 1.0, + "content": "4http://schwa.org/projects/resources/wiki/Wikiner", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 27, + 308, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 309, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 309, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2018", + "type": "text" + } + ] + } + ] + }, + { + "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 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "TensorFlow Fold is that we are only grouping the leaf operations and not the branch operations.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 506, + 108 + ], + "score": 1.0, + "content": "Grouping the branch operations is possible by extending our IR nodes and we are actively working", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 131, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 131, + 117 + ], + "score": 1.0, + "content": "on it.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 506, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 416, + 134 + ], + "score": 1.0, + "content": "Figure 6(d) shows the same information for fixed max active keys", + "type": "text" + }, + { + "bbox": [ + 416, + 122, + 445, + 132 + ], + "score": 0.46, + "content": "\\qquad = \\quad 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 121, + 506, + 134 + ], + "score": 1.0, + "content": "and different", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "min update interval. We can see that as we increase min update interval from the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "originally used 50 to larger values, the peak of the validation accuracy shifts later and lower becom-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "ing closer to the curve obtained by TensorFlow Fold. This is consistent with the parallels between", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "min update interval and minibatch size we drew in Section 6. The min update interval", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 351, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 351, + 190 + ], + "score": 1.0, + "content": "parameter has marginal influence on the training throughput.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 121, + 506, + 190 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 204, + 196, + 215 + ], + "lines": [ + { + "bbox": [ + 105, + 202, + 198, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 198, + 218 + ], + "score": 1.0, + "content": "B.4 QM9 DATASET", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 226, + 505, + 259 + ], + "lines": [ + { + "bbox": [ + 105, + 225, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 505, + 239 + ], + "score": 1.0, + "content": "We study a real-world application for GNNs: prediction of organic molecule properties from structural", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "formulae in the QM9 dataset Ruddigkeit et al. (2012); Ramakrishnan et al. (2014). GNNs have", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 248, + 344, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 344, + 260 + ], + "score": 1.0, + "content": "previously been applied to this task in Gilmer et al. (2017).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 225, + 505, + 260 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 264, + 505, + 342 + ], + "lines": [ + { + "bbox": [ + 105, + 264, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 506, + 278 + ], + "score": 1.0, + "content": "We concentrate on prediction of the norm of a molecule’s dipole moment using a regression layer", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 276, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 506, + 288 + ], + "score": 1.0, + "content": "build on the propagation model from Li et al. (2015) (corresponding to the simplest setting in Gilmer", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 286, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 104, + 286, + 506, + 300 + ], + "score": 1.0, + "content": "et al. (2017)). We use a hidden dimension of 100 and 4 propagation steps, initializing the graph nodes", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 298, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 310 + ], + "score": 1.0, + "content": "(atoms) following Gilmer et al. (2017). The molecules contain up to 29 atoms and in a TensorFlow", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 308, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 505, + 321 + ], + "score": 1.0, + "content": "baseline we bucket molecules into batches of 20 with atom counts differing by at most 1 within", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 318, + 506, + 333 + ], + "spans": [ + { + "bbox": [ + 104, + 318, + 506, + 333 + ], + "score": 1.0, + "content": "a batch. Following Gilmer et al. (2017), we report regression accuracies in multiples of a target", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 331, + 272, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 272, + 343 + ], + "score": 1.0, + "content": "accuracy from the chemistry community.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16, + "bbox_fs": [ + 104, + 264, + 506, + 343 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 347, + 504, + 370 + ], + "lines": [ + { + "bbox": [ + 106, + 347, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 415, + 360 + ], + "score": 1.0, + "content": "Figure 6(e) shows that GGNN can tolerate relatively large max active key", + "type": "text" + }, + { + "bbox": [ + 415, + 348, + 445, + 358 + ], + "score": 0.85, + "content": "s = 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 347, + 505, + 360 + ], + "score": 1.0, + "content": ", and increased", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 358, + 478, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 478, + 371 + ], + "score": 1.0, + "content": "the throughput significantly from 300 graphs/s (synchronous) to 1797 graphs/s (see Table 2).", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 347, + 505, + 371 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 386, + 213, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 386, + 214, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 386, + 214, + 398 + ], + "score": 1.0, + "content": "B.5 WIKINER DATASET", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 407, + 505, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 407, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 421 + ], + "score": 1.0, + "content": "We compare the performance of AMP training with DyNet with and without autobatching using", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 419, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 505, + 432 + ], + "score": 1.0, + "content": "the BiLSTM tagger w/ char model from the DyNet benchmark suite3. This model consists of both", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 428, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 506, + 443 + ], + "score": 1.0, + "content": "character-level and word-level bidirectional LSTMs. The model uses a learnable word embedding", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "score": 1.0, + "content": "for frequent words (more than 5 times in the corpus) and character-level bidirectional LSTMs for", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 451, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 505, + 465 + ], + "score": 1.0, + "content": "infrequent words. We use our Distribute and Collect nodes to dynamically route the messages", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 463, + 251, + 476 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 251, + 476 + ], + "score": 1.0, + "content": "depending on the word frequencies.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 407, + 506, + 476 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 479, + 503, + 513 + ], + "lines": [ + { + "bbox": [ + 105, + 478, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 505, + 492 + ], + "score": 1.0, + "content": "Wikiner dataset4 is a named entity recognition dataset extracted from Wikipedia by Nothman et al.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 490, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 505, + 503 + ], + "score": 1.0, + "content": "(2013). We use the training/validation split provided by the DyNet benchmark suite with 142,153 and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 501, + 226, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 226, + 515 + ], + "score": 1.0, + "content": "1,696 sentences, respectively.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 478, + 505, + 515 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 518, + 505, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 318, + 531 + ], + "score": 1.0, + "content": "The result is shown in Fig. 6(f). We achieve more than", + "type": "text" + }, + { + "bbox": [ + 319, + 519, + 330, + 529 + ], + "score": 0.39, + "content": "3 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 517, + 493, + 531 + ], + "score": 1.0, + "content": "in throughput from max active keys", + "type": "text" + }, + { + "bbox": [ + 493, + 520, + 505, + 529 + ], + "score": 0.29, + "content": "=", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 207, + 541 + ], + "score": 1.0, + "content": "1 to max active key", + "type": "text" + }, + { + "bbox": [ + 207, + 530, + 235, + 540 + ], + "score": 0.66, + "content": "s = 3 2", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "without any noticeable loss in the validation accuracy after 2 or 3", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 541, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 506, + 552 + ], + "score": 1.0, + "content": "epochs. The slight decrease in the validation accuracy after the third epoch is due to overfitting and it", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 550, + 221, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 221, + 565 + ], + "score": 1.0, + "content": "is not related to asynchrony.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 517, + 506, + 565 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 582, + 483, + 595 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 484, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 484, + 596 + ], + "score": 1.0, + "content": "C THROUGHPUT ESTIMATION FOR A HYPOTHETICAL 1 TFLOPS DEVICE", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 608, + 505, + 697 + ], + "lines": [ + { + "bbox": [ + 106, + 609, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 505, + 621 + ], + "score": 1.0, + "content": "In order to estimate the performance of AMPNet on a hypothetical device with 1 TFLOPS compute", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "capability, we replaced all fully connected layers in the network with a dummy operation that simply", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 630, + 506, + 644 + ], + "spans": [ + { + "bbox": [ + 104, + 630, + 338, + 644 + ], + "score": 1.0, + "content": "waits for a specified time. The dummy operation waits for", + "type": "text" + }, + { + "bbox": [ + 338, + 631, + 432, + 642 + ], + "score": 0.91, + "content": "2 \\cdot k \\cdot d _ { \\mathrm { i n } } \\cdot d _ { \\mathrm { o u t } } \\cdot 1 0 ^ { - 1 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 630, + 506, + 644 + ], + "score": 1.0, + "content": "seconds when the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 642, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 642, + 137, + 654 + ], + "score": 1.0, + "content": "input is", + "type": "text" + }, + { + "bbox": [ + 138, + 642, + 168, + 653 + ], + "score": 0.91, + "content": "k \\times d _ { \\mathrm { i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 642, + 265, + 654 + ], + "score": 1.0, + "content": "and the weight matrix is", + "type": "text" + }, + { + "bbox": [ + 265, + 642, + 306, + 653 + ], + "score": 0.91, + "content": "d _ { \\mathrm { i n } } \\times d _ { \\mathrm { o u t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 642, + 505, + 654 + ], + "score": 1.0, + "content": "for forward, backward, and gradient accumulation", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 104, + 650, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 104, + 650, + 196, + 667 + ], + "score": 1.0, + "content": "operation. It waits for", + "type": "text" + }, + { + "bbox": [ + 196, + 652, + 266, + 664 + ], + "score": 0.91, + "content": "d _ { \\mathrm { i n } } \\cdot \\dot { d } _ { \\mathrm { o u t } } \\cdot 1 0 ^ { - 1 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 650, + 506, + 667 + ], + "score": 1.0, + "content": "seconds for weight update. In this way we can maintain all", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 663, + 505, + 676 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 505, + 676 + ], + "score": 1.0, + "content": "the data-dependent control decisions (e.g., sequence length) identical to the original network and also", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 674, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 506, + 687 + ], + "score": 1.0, + "content": "measure the real time spent for all the other operations. In order to calculate the time to reach target", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 686, + 505, + 698 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 698 + ], + "score": 1.0, + "content": "accuracy, we take the median number of epochs the original network required to reach the target", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 40.5, + "bbox_fs": [ + 104, + 609, + 506, + 698 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 245, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 245, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 245, + 95 + ], + "score": 1.0, + "content": "accuracy and calculate the time as", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 171, + 99, + 438, + 127 + ], + "lines": [ + { + "bbox": [ + 171, + 99, + 438, + 127 + ], + "spans": [ + { + "bbox": [ + 171, + 99, + 438, + 127 + ], + "score": 0.91, + "content": "\\mathrm { \\Delta t \\ i m e = e p o c h s \\cdot \\left( \\frac { { n _ { \\mathrm { t r a i n } } } } { t h r o u g h p u t _ { \\mathrm { t r a i n } } } + \\frac { { n _ { \\mathrm { v a l } } } } { t h r o u g h p u t _ { \\mathrm { v a l } } } \\right) , }", + "type": "interline_equation", + "image_path": "cc3fd68ece76db3ba886ecd6597520737554cd64b79bff35def6f9b211eceac4.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 171, + 99, + 438, + 108.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 171, + 108.33333333333333, + 438, + 117.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 171, + 117.66666666666666, + 438, + 126.99999999999999 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 131, + 505, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 130, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 130, + 135, + 145 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 136, + 133, + 160, + 143 + ], + "score": 0.88, + "content": "n _ { \\mathrm { t r a i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 130, + 182, + 145 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 183, + 133, + 201, + 142 + ], + "score": 0.88, + "content": "n _ { \\mathrm { v a l } }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 130, + 506, + 145 + ], + "score": 1.0, + "content": "are the number of training and validation instances, respectively, and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 141, + 507, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 167, + 156 + ], + "score": 1.0, + "content": "throughput", + "type": "text" + }, + { + "bbox": [ + 167, + 144, + 185, + 154 + ], + "score": 0.76, + "content": "\\operatorname { t r a i n }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 141, + 265, + 156 + ], + "score": 1.0, + "content": "and throughput", + "type": "text" + }, + { + "bbox": [ + 266, + 144, + 277, + 154 + ], + "score": 0.83, + "content": "\\mathrm { v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 141, + 507, + 156 + ], + "score": 1.0, + "content": "are the throughput for training and validation, respec-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 151, + 135, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 135, + 168 + ], + "score": 1.0, + "content": "tively.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 170, + 506, + 226 + ], + "lines": [ + { + "bbox": [ + 106, + 171, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 506, + 182 + ], + "score": 1.0, + "content": "The results are shown in Table 3. For the 4-way replicated RNN, we estimate roughly 260k instances/s,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 150, + 194 + ], + "score": 1.0, + "content": "which is a", + "type": "text" + }, + { + "bbox": [ + 150, + 181, + 170, + 191 + ], + "score": 0.74, + "content": "3 . 7 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "speedup compared to our CPU runtime. For tree RNN and GGSNN, we estimate", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 191, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 135, + 205 + ], + "score": 1.0, + "content": "milder", + "type": "text" + }, + { + "bbox": [ + 136, + 192, + 176, + 203 + ], + "score": 0.89, + "content": "30 - 7 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 191, + 505, + 205 + ], + "score": 1.0, + "content": "speedups mainly due to the fact that they have more complicated operations like", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 202, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 505, + 216 + ], + "score": 1.0, + "content": "Distribute and Collect, which we did not attempt to extrapolate the computation time because", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 214, + 501, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 214, + 501, + 226 + ], + "score": 1.0, + "content": "the implementation on a new hardware may be drastically different from the current CPU runtime.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9 + }, + { + "type": "table", + "bbox": [ + 115, + 290, + 495, + 365 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 245, + 505, + 289 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 245, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 258 + ], + "score": 1.0, + "content": "Table 3: Estimated time to convergence to target validation accuracy and training throughput with", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 256, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 506, + 268 + ], + "score": 1.0, + "content": "a hypothetical 1 TFLOPS device. mak is a short-hand for max active keys defined in Sec. 3;", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 267, + 506, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 144, + 277 + ], + "score": 0.9, + "content": "\\mathrm { m a k } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 267, + 506, + 280 + ], + "score": 1.0, + "content": "corresponds to synchronous training for MNIST and minimal asynchrony arising from just", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 278, + 364, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 364, + 290 + ], + "score": 1.0, + "content": "one in-flight instance for other models with recursive structures.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "table_body", + "bbox": [ + 115, + 290, + 495, + 365 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 115, + 290, + 495, + 365 + ], + "spans": [ + { + "bbox": [ + 115, + 290, + 495, + 365 + ], + "score": 0.98, + "html": "
AMP1 TFLOPS (estimated)
targetaccuracymaktime (s)epochsinst/stime (s)inst/s
List reduction97%1781013k
(4 replicas) Sentiment8211371k5.15268k
82%11852102
16104325860.6440
QM94.616522776.5179738272455
", + "type": "table", + "image_path": "580e3e3fe2a4292fecd7c721fb02f2c7ea4e12aaf6d6178346fc25940d586b23.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 115, + 290, + 495, + 315.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 115, + 315.0, + 495, + 340.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 115, + 340.0, + 495, + 365.0 + ], + "spans": [], + "index": 18 + } + ] + } + ], + "index": 15.25 + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 308, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 309, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 309, + 39 + ], + "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, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 245, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 245, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 245, + 95 + ], + "score": 1.0, + "content": "accuracy and calculate the time as", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 82, + 245, + 95 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 171, + 99, + 438, + 127 + ], + "lines": [ + { + "bbox": [ + 171, + 99, + 438, + 127 + ], + "spans": [ + { + "bbox": [ + 171, + 99, + 438, + 127 + ], + "score": 0.91, + "content": "\\mathrm { \\Delta t \\ i m e = e p o c h s \\cdot \\left( \\frac { { n _ { \\mathrm { t r a i n } } } } { t h r o u g h p u t _ { \\mathrm { t r a i n } } } + \\frac { { n _ { \\mathrm { v a l } } } } { t h r o u g h p u t _ { \\mathrm { v a l } } } \\right) , }", + "type": "interline_equation", + "image_path": "cc3fd68ece76db3ba886ecd6597520737554cd64b79bff35def6f9b211eceac4.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 171, + 99, + 438, + 108.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 171, + 108.33333333333333, + 438, + 117.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 171, + 117.66666666666666, + 438, + 126.99999999999999 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 131, + 505, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 130, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 130, + 135, + 145 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 136, + 133, + 160, + 143 + ], + "score": 0.88, + "content": "n _ { \\mathrm { t r a i n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 130, + 182, + 145 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 183, + 133, + 201, + 142 + ], + "score": 0.88, + "content": "n _ { \\mathrm { v a l } }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 130, + 506, + 145 + ], + "score": 1.0, + "content": "are the number of training and validation instances, respectively, and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 141, + 507, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 167, + 156 + ], + "score": 1.0, + "content": "throughput", + "type": "text" + }, + { + "bbox": [ + 167, + 144, + 185, + 154 + ], + "score": 0.76, + "content": "\\operatorname { t r a i n }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 141, + 265, + 156 + ], + "score": 1.0, + "content": "and throughput", + "type": "text" + }, + { + "bbox": [ + 266, + 144, + 277, + 154 + ], + "score": 0.83, + "content": "\\mathrm { v a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 141, + 507, + 156 + ], + "score": 1.0, + "content": "are the throughput for training and validation, respec-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 151, + 135, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 135, + 168 + ], + "score": 1.0, + "content": "tively.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 130, + 507, + 168 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 170, + 506, + 226 + ], + "lines": [ + { + "bbox": [ + 106, + 171, + 506, + 182 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 506, + 182 + ], + "score": 1.0, + "content": "The results are shown in Table 3. For the 4-way replicated RNN, we estimate roughly 260k instances/s,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 150, + 194 + ], + "score": 1.0, + "content": "which is a", + "type": "text" + }, + { + "bbox": [ + 150, + 181, + 170, + 191 + ], + "score": 0.74, + "content": "3 . 7 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "speedup compared to our CPU runtime. For tree RNN and GGSNN, we estimate", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 191, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 135, + 205 + ], + "score": 1.0, + "content": "milder", + "type": "text" + }, + { + "bbox": [ + 136, + 192, + 176, + 203 + ], + "score": 0.89, + "content": "30 - 7 0 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 191, + 505, + 205 + ], + "score": 1.0, + "content": "speedups mainly due to the fact that they have more complicated operations like", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 202, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 505, + 216 + ], + "score": 1.0, + "content": "Distribute and Collect, which we did not attempt to extrapolate the computation time because", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 214, + 501, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 214, + 501, + 226 + ], + "score": 1.0, + "content": "the implementation on a new hardware may be drastically different from the current CPU runtime.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 171, + 506, + 226 + ] + }, + { + "type": "table", + "bbox": [ + 115, + 290, + 495, + 365 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 106, + 245, + 505, + 289 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 245, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 258 + ], + "score": 1.0, + "content": "Table 3: Estimated time to convergence to target validation accuracy and training throughput with", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 256, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 506, + 268 + ], + "score": 1.0, + "content": "a hypothetical 1 TFLOPS device. mak is a short-hand for max active keys defined in Sec. 3;", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 267, + 506, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 144, + 277 + ], + "score": 0.9, + "content": "\\mathrm { m a k } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 267, + 506, + 280 + ], + "score": 1.0, + "content": "corresponds to synchronous training for MNIST and minimal asynchrony arising from just", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 278, + 364, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 364, + 290 + ], + "score": 1.0, + "content": "one in-flight instance for other models with recursive structures.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "table_body", + "bbox": [ + 115, + 290, + 495, + 365 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 115, + 290, + 495, + 365 + ], + "spans": [ + { + "bbox": [ + 115, + 290, + 495, + 365 + ], + "score": 0.98, + "html": "
AMP1 TFLOPS (estimated)
targetaccuracymaktime (s)epochsinst/stime (s)inst/s
List reduction97%1781013k
(4 replicas) Sentiment8211371k5.15268k
82%11852102
16104325860.6440
QM94.616522776.5179738272455
", + "type": "table", + "image_path": "580e3e3fe2a4292fecd7c721fb02f2c7ea4e12aaf6d6178346fc25940d586b23.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 115, + 290, + 495, + 315.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 115, + 315.0, + 495, + 340.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 115, + 340.0, + 495, + 365.0 + ], + "spans": [], + "index": 18 + } + ] + } + ], + "index": 15.25 + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/HJnQJXbC-/HJnQJXbC-_model.json b/parse/train/HJnQJXbC-/HJnQJXbC-_model.json new file mode 100644 index 0000000000000000000000000000000000000000..6f39c165cfb62cc0aa71fac9f7262cc59c0863e3 --- /dev/null +++ b/parse/train/HJnQJXbC-/HJnQJXbC-_model.json @@ -0,0 +1,21214 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 590, + 1304, + 590, + 1304, + 1018, + 398, + 1018 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1150, + 1405, + 1150, + 1405, + 1335, + 298, + 1335 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1351, + 1403, + 1351, + 1403, + 1473, + 299, + 1473 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 1488, + 1403, + 1488, + 1403, + 1612, + 299, + 1612 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 300, + 1627, + 1404, + 1627, + 1404, + 1751, + 300, + 1751 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 300, + 1912, + 1403, + 1912, + 1403, + 2034, + 300, + 2034 + ], + "score": 0.968 + }, + { + "category_id": 0, + "poly": [ + 300, + 218, + 1400, + 218, + 1400, + 324, + 300, + 324 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 313, + 378, + 680, + 378, + 680, + 438, + 313, + 438 + ], + "score": 0.936 + }, + { + "category_id": 0, + "poly": [ + 302, + 1080, + 573, + 1080, + 573, + 1115, + 302, + 1115 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 105, + 298, + 105 + ], + "score": 0.9 + }, + { + "category_id": 1, + "poly": [ + 347, + 1778, + 1401, + 1778, + 1401, + 1885, + 347, + 1885 + ], + "score": 0.871 + }, + { + "category_id": 0, + "poly": [ + 773, + 519, + 927, + 519, + 927, + 553, + 773, + 553 + ], + "score": 0.869 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 856, + 2088, + 856, + 2112, + 841, + 2112 + ], + "score": 0.72 + }, + { + "category_id": 13, + "poly": [ + 774, + 1659, + 833, + 1659, + 833, + 1688, + 774, + 1688 + ], + "score": 0.55, + "latex": "1 0 0 \\mathrm { x }" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 220.0, + 516.0, + 220.0, + 516.0, + 270.0, + 294.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 217.0, + 1408.0, + 217.0, + 1408.0, + 272.0, + 605.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 271.0, + 1260.0, + 271.0, + 1260.0, + 329.0, + 291.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1077.0, + 579.0, + 1077.0, + 579.0, + 1124.0, + 294.0, + 1124.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": [ + 770.0, + 518.0, + 932.0, + 518.0, + 932.0, + 556.0, + 770.0, + 556.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": [ + 393.0, + 591.0, + 1306.0, + 591.0, + 1306.0, + 626.0, + 393.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 621.0, + 1309.0, + 621.0, + 1309.0, + 657.0, + 394.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 649.0, + 1306.0, + 649.0, + 1306.0, + 689.0, + 392.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 682.0, + 1306.0, + 682.0, + 1306.0, + 717.0, + 393.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 713.0, + 1306.0, + 713.0, + 1306.0, + 746.0, + 392.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 743.0, + 1307.0, + 743.0, + 1307.0, + 778.0, + 393.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 774.0, + 1307.0, + 774.0, + 1307.0, + 809.0, + 394.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 805.0, + 1308.0, + 805.0, + 1308.0, + 836.0, + 393.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 836.0, + 1306.0, + 836.0, + 1306.0, + 868.0, + 394.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 864.0, + 1306.0, + 864.0, + 1306.0, + 902.0, + 393.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 897.0, + 1305.0, + 897.0, + 1305.0, + 929.0, + 395.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 926.0, + 1309.0, + 926.0, + 1309.0, + 961.0, + 394.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 955.0, + 1306.0, + 955.0, + 1306.0, + 992.0, + 393.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 983.0, + 834.0, + 983.0, + 834.0, + 1024.0, + 393.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1151.0, + 1405.0, + 1151.0, + 1405.0, + 1187.0, + 295.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1183.0, + 1407.0, + 1183.0, + 1407.0, + 1216.0, + 292.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1213.0, + 1406.0, + 1213.0, + 1406.0, + 1245.0, + 295.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1241.0, + 1405.0, + 1241.0, + 1405.0, + 1279.0, + 293.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1265.0, + 1411.0, + 1265.0, + 1411.0, + 1315.0, + 291.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1306.0, + 1367.0, + 1306.0, + 1367.0, + 1338.0, + 296.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1350.0, + 1407.0, + 1350.0, + 1407.0, + 1385.0, + 294.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1381.0, + 1407.0, + 1381.0, + 1407.0, + 1417.0, + 294.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1412.0, + 1405.0, + 1412.0, + 1405.0, + 1444.0, + 294.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1442.0, + 1034.0, + 1442.0, + 1034.0, + 1478.0, + 294.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1488.0, + 1407.0, + 1488.0, + 1407.0, + 1524.0, + 294.0, + 1524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1519.0, + 1407.0, + 1519.0, + 1407.0, + 1553.0, + 293.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1550.0, + 1407.0, + 1550.0, + 1407.0, + 1585.0, + 293.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1578.0, + 1378.0, + 1578.0, + 1378.0, + 1618.0, + 293.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1625.0, + 1406.0, + 1625.0, + 1406.0, + 1662.0, + 294.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1660.0, + 773.0, + 1660.0, + 773.0, + 1693.0, + 295.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 1660.0, + 1404.0, + 1660.0, + 1404.0, + 1693.0, + 834.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1688.0, + 1408.0, + 1688.0, + 1408.0, + 1723.0, + 294.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1718.0, + 1235.0, + 1718.0, + 1235.0, + 1756.0, + 294.0, + 1756.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, + 1405.0, + 1942.0, + 1405.0, + 1976.0, + 295.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 1405.0, + 2004.0, + 1405.0, + 2037.0, + 295.0, + 2037.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": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1774.0, + 932.0, + 1774.0, + 932.0, + 1816.0, + 361.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 1816.0, + 1405.0, + 1816.0, + 1405.0, + 1857.0, + 357.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1852.0, + 1330.0, + 1852.0, + 1330.0, + 1888.0, + 393.0, + 1888.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1493, + 1404, + 1493, + 1404, + 1646, + 298, + 1646 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 367, + 1018, + 1404, + 1018, + 1404, + 1465, + 367, + 1465 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 299, + 681, + 1404, + 681, + 1404, + 774, + 299, + 774 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 299, + 790, + 1405, + 790, + 1405, + 882, + 299, + 882 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 298, + 1817, + 1406, + 1817, + 1406, + 1970, + 298, + 1970 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 300, + 897, + 1405, + 897, + 1405, + 990, + 300, + 990 + ], + "score": 0.96 + }, + { + "category_id": 3, + "poly": [ + 294, + 219, + 1391, + 219, + 1391, + 455, + 294, + 455 + ], + "score": 0.952 + }, + { + "category_id": 4, + "poly": [ + 296, + 512, + 1404, + 512, + 1404, + 605, + 296, + 605 + ], + "score": 0.932 + }, + { + "category_id": 2, + "poly": [ + 330, + 2004, + 1124, + 2004, + 1124, + 2033, + 330, + 2033 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 293, + 1768, + 1403, + 1768, + 1403, + 1802, + 293, + 1802 + ], + "score": 0.886 + }, + { + "category_id": 0, + "poly": [ + 300, + 1700, + 1101, + 1700, + 1101, + 1732, + 300, + 1732 + ], + "score": 0.858 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 857, + 76, + 857, + 104, + 297, + 104 + ], + "score": 0.854 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.736 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 855, + 76, + 855, + 104, + 299, + 104 + ], + "score": 0.167 + }, + { + "category_id": 15, + "poly": [ + 429.0, + 217.0, + 486.0, + 217.0, + 486.0, + 254.0, + 429.0, + 254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 218.0, + 884.0, + 218.0, + 884.0, + 254.0, + 828.0, + 254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1202.0, + 216.0, + 1258.0, + 216.0, + 1258.0, + 251.0, + 1202.0, + 251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 275.0, + 341.0, + 275.0, + 341.0, + 287.0, + 331.0, + 287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 571.0, + 273.0, + 581.0, + 273.0, + 581.0, + 285.0, + 571.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 260.0, + 745.0, + 260.0, + 745.0, + 295.0, + 664.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 270.0, + 851.0, + 270.0, + 851.0, + 288.0, + 838.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 266.0, + 917.0, + 266.0, + 917.0, + 292.0, + 855.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 261.0, + 1011.0, + 261.0, + 1011.0, + 295.0, + 921.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 263.0, + 1208.0, + 263.0, + 1208.0, + 294.0, + 1101.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 273.0, + 1223.0, + 273.0, + 1223.0, + 283.0, + 1213.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1238.0, + 270.0, + 1254.0, + 270.0, + 1254.0, + 288.0, + 1238.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 267.0, + 1276.0, + 267.0, + 1276.0, + 290.0, + 1258.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 271.0, + 1300.0, + 271.0, + 1300.0, + 285.0, + 1289.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 269.0, + 1325.0, + 269.0, + 1325.0, + 288.0, + 1310.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 295.0, + 323.0, + 295.0, + 323.0, + 393.0, + 294.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 295.0, + 663.0, + 295.0, + 663.0, + 395.0, + 634.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 325.0, + 700.0, + 325.0, + 700.0, + 337.0, + 690.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 323.0, + 727.0, + 323.0, + 727.0, + 340.0, + 709.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 321.0, + 748.0, + 321.0, + 748.0, + 342.0, + 728.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 325.0, + 765.0, + 325.0, + 765.0, + 337.0, + 753.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 323.0, + 852.0, + 323.0, + 852.0, + 341.0, + 836.0, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 320.0, + 875.0, + 320.0, + 875.0, + 344.0, + 855.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 321.0, + 896.0, + 321.0, + 896.0, + 342.0, + 876.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 319.0, + 1030.0, + 319.0, + 1030.0, + 345.0, + 947.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 292.0, + 1102.0, + 292.0, + 1102.0, + 396.0, + 1070.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 325.0, + 1139.0, + 325.0, + 1139.0, + 336.0, + 1129.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 320.0, + 1183.0, + 320.0, + 1183.0, + 338.0, + 1168.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 323.0, + 1203.0, + 323.0, + 1203.0, + 338.0, + 1188.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 324.0, + 1232.0, + 324.0, + 1232.0, + 336.0, + 1219.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 324.0, + 1251.0, + 324.0, + 1251.0, + 336.0, + 1239.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 324.0, + 1280.0, + 324.0, + 1280.0, + 337.0, + 1269.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 323.0, + 1303.0, + 323.0, + 1303.0, + 338.0, + 1288.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1319.0, + 324.0, + 1329.0, + 324.0, + 1329.0, + 337.0, + 1319.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 330.0, + 624.0, + 330.0, + 624.0, + 345.0, + 606.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 333.0, + 1059.0, + 333.0, + 1059.0, + 342.0, + 1044.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 378.0, + 382.0, + 378.0, + 382.0, + 389.0, + 372.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 374.0, + 518.0, + 374.0, + 518.0, + 392.0, + 503.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 375.0, + 541.0, + 375.0, + 541.0, + 392.0, + 526.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 369.0, + 877.0, + 369.0, + 877.0, + 400.0, + 709.0, + 400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 367.0, + 1056.0, + 367.0, + 1056.0, + 401.0, + 963.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 378.0, + 1159.0, + 378.0, + 1159.0, + 388.0, + 1149.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1169.0, + 376.0, + 1179.0, + 376.0, + 1179.0, + 389.0, + 1169.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 371.0, + 1235.0, + 371.0, + 1235.0, + 392.0, + 1215.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 371.0, + 1261.0, + 371.0, + 1261.0, + 392.0, + 1241.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 370.0, + 1284.0, + 370.0, + 1284.0, + 393.0, + 1264.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1293.0, + 372.0, + 1309.0, + 372.0, + 1309.0, + 388.0, + 1293.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 375.0, + 1329.0, + 375.0, + 1329.0, + 387.0, + 1318.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 418.0, + 1032.0, + 418.0, + 1032.0, + 454.0, + 314.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 422.0, + 1396.0, + 422.0, + 1396.0, + 451.0, + 1093.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 319.5, + 1160.0, + 319.5, + 1160.0, + 340.0, + 1150.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 511.0, + 1405.0, + 511.0, + 1405.0, + 549.0, + 295.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 543.0, + 1405.0, + 543.0, + 1405.0, + 579.0, + 294.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 575.0, + 1112.0, + 575.0, + 1112.0, + 607.0, + 296.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 2000.0, + 1129.0, + 2000.0, + 1129.0, + 2038.0, + 332.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1694.0, + 1107.0, + 1694.0, + 1107.0, + 1739.0, + 291.0, + 1739.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": [ + 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, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1493.0, + 1402.0, + 1493.0, + 1402.0, + 1526.0, + 296.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1525.0, + 1404.0, + 1525.0, + 1404.0, + 1558.0, + 296.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1554.0, + 1404.0, + 1554.0, + 1404.0, + 1591.0, + 294.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1581.0, + 1405.0, + 1581.0, + 1405.0, + 1626.0, + 292.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1614.0, + 911.0, + 1614.0, + 911.0, + 1653.0, + 293.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1018.0, + 1405.0, + 1018.0, + 1405.0, + 1056.0, + 371.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1050.0, + 737.0, + 1050.0, + 737.0, + 1084.0, + 395.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 1095.0, + 1405.0, + 1095.0, + 1405.0, + 1133.0, + 385.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1127.0, + 1407.0, + 1127.0, + 1407.0, + 1161.0, + 392.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1158.0, + 1404.0, + 1158.0, + 1404.0, + 1193.0, + 394.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1189.0, + 1405.0, + 1189.0, + 1405.0, + 1223.0, + 395.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1216.0, + 1259.0, + 1216.0, + 1259.0, + 1254.0, + 394.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 1265.0, + 1404.0, + 1265.0, + 1404.0, + 1299.0, + 386.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1290.0, + 1409.0, + 1290.0, + 1409.0, + 1336.0, + 392.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1325.0, + 1318.0, + 1325.0, + 1318.0, + 1361.0, + 394.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1371.0, + 1405.0, + 1371.0, + 1405.0, + 1409.0, + 369.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1404.0, + 1404.0, + 1404.0, + 1404.0, + 1437.0, + 394.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1434.0, + 1368.0, + 1434.0, + 1368.0, + 1469.0, + 394.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 678.0, + 1405.0, + 678.0, + 1405.0, + 719.0, + 292.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 709.0, + 1405.0, + 709.0, + 1405.0, + 748.0, + 293.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 742.0, + 726.0, + 742.0, + 726.0, + 779.0, + 295.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 788.0, + 1406.0, + 788.0, + 1406.0, + 825.0, + 293.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 820.0, + 1408.0, + 820.0, + 1408.0, + 854.0, + 294.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 847.0, + 1170.0, + 847.0, + 1170.0, + 889.0, + 293.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1818.0, + 1403.0, + 1818.0, + 1403.0, + 1851.0, + 297.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1849.0, + 1406.0, + 1849.0, + 1406.0, + 1882.0, + 296.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1876.0, + 1408.0, + 1876.0, + 1408.0, + 1915.0, + 292.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1907.0, + 1407.0, + 1907.0, + 1407.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1941.0, + 1246.0, + 1941.0, + 1246.0, + 1974.0, + 296.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 898.0, + 1405.0, + 898.0, + 1405.0, + 931.0, + 295.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 929.0, + 1405.0, + 929.0, + 1405.0, + 960.0, + 295.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 956.0, + 1333.0, + 956.0, + 1333.0, + 997.0, + 294.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1764.0, + 1406.0, + 1764.0, + 1406.0, + 1810.0, + 292.0, + 1810.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1267, + 1405, + 1267, + 1405, + 1543, + 297, + 1543 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1666, + 1404, + 1666, + 1404, + 1790, + 299, + 1790 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1403, + 1911, + 1403, + 2034, + 299, + 2034 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 428, + 224, + 1264, + 224, + 1264, + 603, + 428, + 603 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 1557, + 1405, + 1557, + 1405, + 1651, + 299, + 1651 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 384, + 633, + 1314, + 633, + 1314, + 667, + 384, + 667 + ], + "score": 0.897 + }, + { + "category_id": 0, + "poly": [ + 300, + 1842, + 1015, + 1842, + 1015, + 1875, + 300, + 1875 + ], + "score": 0.866 + }, + { + "category_id": 5, + "poly": [ + 297, + 716, + 1358, + 716, + 1358, + 1206, + 297, + 1206 + ], + "score": 0.832, + "html": "
Algorithm 1 Asynchronous Model-Parallel training
while training not done do
for all workers in parallel do
Wait until a message arrives
msg ←the highest priority message from the input queue
op ← sink node of the message msg
if msg is forward type then Compute forward: out_msgs ← op(msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the child nodes.
else if msg is backward type then
Compute backward: out_msgs ← op*(msg,fwd_msg)
Enqueue the resulting message(s) into the queue(s) of the workers hosting the parent nodes.
else if msg isupdate type then
Perform parameter updates on op
end if
end for
end while
" + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 857, + 76, + 857, + 104, + 298, + 104 + ], + "score": 0.773 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.594 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 859, + 2088, + 859, + 2112, + 842, + 2112 + ], + "score": 0.403 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 855, + 76, + 855, + 104, + 299, + 104 + ], + "score": 0.37 + }, + { + "category_id": 13, + "poly": [ + 737, + 923, + 876, + 923, + 876, + 953, + 737, + 953 + ], + "score": 0.86, + "latex": "\\mathrel { \\mathop : } \\gets \\infty \\mathrm { { p } } ( \\mathrm { { m s g } } )" + }, + { + "category_id": 13, + "poly": [ + 397, + 871, + 464, + 871, + 464, + 896, + 397, + 896 + ], + "score": 0.84, + "latex": "\\mathrm { \\tt O p } " + }, + { + "category_id": 13, + "poly": [ + 447, + 843, + 476, + 843, + 476, + 866, + 447, + 866 + ], + "score": 0.76, + "latex": "" + }, + { + "category_id": 13, + "poly": [ + 755, + 1006, + 840, + 1006, + 840, + 1035, + 755, + 1035 + ], + "score": 0.54, + "latex": "\\boldsymbol { \\wp } \\boldsymbol { \\circ } \\boldsymbol { \\mathrm { p } } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1061, + 290, + 1128, + 290, + 1128, + 310, + 1061, + 310 + ], + "score": 0.5, + "latex": "x _ { j \\in 1 \\ldots T }" + }, + { + "category_id": 13, + "poly": [ + 878, + 308, + 928, + 308, + 928, + 329, + 878, + 329 + ], + "score": 0.41, + "latex": "h _ { 0 } \\gets" + }, + { + "category_id": 13, + "poly": [ + 908, + 330, + 1014, + 330, + 1014, + 351, + 908, + 351 + ], + "score": 0.36, + "latex": "j = 1 , \\dots , T" + }, + { + "category_id": 13, + "poly": [ + 1178, + 292, + 1192, + 292, + 1192, + 309, + 1178, + 309 + ], + "score": 0.25, + "latex": "y" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 258.0, + 660.0, + 258.0, + 660.0, + 284.0, + 548.0, + 284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 258.0, + 717.0, + 258.0, + 717.0, + 283.0, + 680.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 258.0, + 771.0, + 258.0, + 771.0, + 283.0, + 730.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 294.0, + 618.0, + 294.0, + 618.0, + 315.0, + 584.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 284.0, + 1060.0, + 284.0, + 1060.0, + 312.0, + 875.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 284.0, + 1177.0, + 284.0, + 1177.0, + 312.0, + 1129.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 284.0, + 1196.0, + 284.0, + 1196.0, + 312.0, + 1193.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 310.0, + 608.0, + 310.0, + 608.0, + 326.0, + 592.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 308.0, + 1127.0, + 308.0, + 1127.0, + 330.0, + 929.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 327.0, + 641.0, + 327.0, + 641.0, + 370.0, + 560.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 322.0, + 774.0, + 322.0, + 774.0, + 357.0, + 727.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 327.0, + 907.0, + 327.0, + 907.0, + 378.0, + 876.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 327.0, + 1046.0, + 327.0, + 1046.0, + 378.0, + 1015.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 417.0, + 521.0, + 417.0, + 521.0, + 441.0, + 477.0, + 441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 370.0, + 663.0, + 370.0, + 663.0, + 427.0, + 570.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 361.0, + 778.0, + 361.0, + 778.0, + 446.0, + 723.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 371.0, + 1104.0, + 371.0, + 1104.0, + 439.0, + 875.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 453.0, + 571.0, + 453.0, + 571.0, + 480.0, + 517.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 456.0, + 684.0, + 456.0, + 684.0, + 478.0, + 587.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 446.0, + 797.0, + 446.0, + 797.0, + 469.0, + 701.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 434.0, + 1121.0, + 434.0, + 1121.0, + 463.0, + 875.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 469.0, + 571.0, + 469.0, + 571.0, + 496.0, + 517.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 471.0, + 685.0, + 471.0, + 685.0, + 493.0, + 588.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 469.0, + 759.0, + 469.0, + 759.0, + 487.0, + 742.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 485.0, + 685.0, + 485.0, + 685.0, + 510.0, + 517.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 487.0, + 799.0, + 487.0, + 799.0, + 516.0, + 701.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 493.0, + 989.0, + 493.0, + 989.0, + 523.0, + 880.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 497.0, + 1200.0, + 497.0, + 1200.0, + 519.0, + 1011.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 516.0, + 758.0, + 516.0, + 758.0, + 533.0, + 741.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 524.0, + 877.0, + 524.0, + 877.0, + 536.0, + 865.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 523.0, + 964.0, + 523.0, + 964.0, + 543.0, + 888.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 522.0, + 1226.0, + 522.0, + 1226.0, + 545.0, + 1011.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 535.0, + 650.0, + 535.0, + 650.0, + 562.0, + 605.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 537.0, + 779.0, + 537.0, + 779.0, + 561.0, + 723.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 545.0, + 979.0, + 545.0, + 979.0, + 567.0, + 885.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 379.0, + 628.0, + 1319.0, + 628.0, + 1319.0, + 674.0, + 379.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1837.0, + 1018.0, + 1837.0, + 1018.0, + 1881.0, + 291.0, + 1881.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": [ + 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, + 861.0, + 2085.0, + 861.0, + 2118.0, + 838.0, + 2118.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": [ + 294.0, + 1267.0, + 1408.0, + 1267.0, + 1408.0, + 1304.0, + 294.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1299.0, + 1406.0, + 1299.0, + 1406.0, + 1332.0, + 295.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1329.0, + 1406.0, + 1329.0, + 1406.0, + 1366.0, + 294.0, + 1366.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": [ + 295.0, + 1391.0, + 1407.0, + 1391.0, + 1407.0, + 1427.0, + 295.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1419.0, + 1405.0, + 1419.0, + 1405.0, + 1455.0, + 295.0, + 1455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1452.0, + 1406.0, + 1452.0, + 1406.0, + 1485.0, + 296.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1479.0, + 1407.0, + 1479.0, + 1407.0, + 1517.0, + 294.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1511.0, + 999.0, + 1511.0, + 999.0, + 1547.0, + 295.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1666.0, + 1405.0, + 1666.0, + 1405.0, + 1702.0, + 294.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1698.0, + 1406.0, + 1698.0, + 1406.0, + 1731.0, + 292.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1727.0, + 1405.0, + 1727.0, + 1405.0, + 1763.0, + 293.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1760.0, + 1370.0, + 1760.0, + 1370.0, + 1792.0, + 293.0, + 1792.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": [ + 292.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1978.0, + 292.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1407.0, + 1972.0, + 1407.0, + 2009.0, + 294.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 1405.0, + 2004.0, + 1405.0, + 2036.0, + 295.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1558.0, + 1403.0, + 1558.0, + 1403.0, + 1592.0, + 295.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1587.0, + 1409.0, + 1587.0, + 1409.0, + 1627.0, + 293.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1621.0, + 1211.0, + 1621.0, + 1211.0, + 1655.0, + 295.0, + 1655.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 781, + 1404, + 781, + 1404, + 1209, + 298, + 1209 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 460, + 1403, + 460, + 1403, + 766, + 298, + 766 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1758, + 1405, + 1758, + 1405, + 2034, + 298, + 2034 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 445, + 298, + 445 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1271, + 1403, + 1271, + 1403, + 1455, + 299, + 1455 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1471, + 1404, + 1471, + 1404, + 1623, + 299, + 1623 + ], + "score": 0.976 + }, + { + "category_id": 0, + "poly": [ + 300, + 1689, + 594, + 1689, + 594, + 1721, + 300, + 1721 + ], + "score": 0.901 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 857, + 76, + 857, + 104, + 298, + 104 + ], + "score": 0.881 + }, + { + "category_id": 1, + "poly": [ + 303, + 1224, + 1241, + 1224, + 1241, + 1256, + 303, + 1256 + ], + "score": 0.873 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 857, + 2089, + 857, + 2111, + 840, + 2111 + ], + "score": 0.773 + }, + { + "category_id": 13, + "poly": [ + 989, + 965, + 1037, + 965, + 1037, + 995, + 989, + 995 + ], + "score": 0.89, + "latex": "{ \\tt o p } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 879, + 1943, + 987, + 1943, + 987, + 1974, + 879, + 1974 + ], + "score": 0.89, + "latex": "( N - H )" + }, + { + "category_id": 13, + "poly": [ + 903, + 1974, + 944, + 1974, + 944, + 2001, + 903, + 2001 + ], + "score": 0.83, + "latex": "h ^ { \\mathrm { t h } }" + }, + { + "category_id": 13, + "poly": [ + 1048, + 1972, + 1219, + 1972, + 1219, + 2006, + 1048, + 2006 + ], + "score": 0.81, + "latex": "( h \\mod W ) ^ { \\mathrm { t h } }" + }, + { + "category_id": 13, + "poly": [ + 996, + 1761, + 1025, + 1761, + 1025, + 1787, + 996, + 1787 + ], + "score": 0.79, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1372, + 1912, + 1402, + 1912, + 1402, + 1940, + 1372, + 1940 + ], + "score": 0.69, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 786, + 1502, + 856, + 1502, + 856, + 1531, + 786, + 1531 + ], + "score": 0.67, + "latex": "\\mathbf { \\boldsymbol { s } } = 1" + }, + { + "category_id": 13, + "poly": [ + 397, + 1790, + 430, + 1790, + 430, + 1818, + 397, + 1818 + ], + "score": 0.51, + "latex": "W" + }, + { + "category_id": 13, + "poly": [ + 1017, + 1822, + 1036, + 1822, + 1036, + 1849, + 1017, + 1849 + ], + "score": 0.34, + "latex": "\\mathbf { k }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1690.0, + 598.0, + 1690.0, + 598.0, + 1723.0, + 295.0, + 1723.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": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 779.0, + 1406.0, + 779.0, + 1406.0, + 817.0, + 293.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 812.0, + 1404.0, + 812.0, + 1404.0, + 844.0, + 296.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 843.0, + 1406.0, + 843.0, + 1406.0, + 878.0, + 294.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 872.0, + 1402.0, + 872.0, + 1402.0, + 907.0, + 294.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 904.0, + 1406.0, + 904.0, + 1406.0, + 939.0, + 294.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 932.0, + 1406.0, + 932.0, + 1406.0, + 968.0, + 293.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 963.0, + 988.0, + 963.0, + 988.0, + 999.0, + 294.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 963.0, + 1406.0, + 963.0, + 1406.0, + 999.0, + 1038.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 995.0, + 1405.0, + 995.0, + 1405.0, + 1031.0, + 294.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1024.0, + 1406.0, + 1024.0, + 1406.0, + 1060.0, + 294.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1056.0, + 1404.0, + 1056.0, + 1404.0, + 1091.0, + 293.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1083.0, + 1406.0, + 1083.0, + 1406.0, + 1124.0, + 291.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1117.0, + 1405.0, + 1117.0, + 1405.0, + 1152.0, + 294.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1143.0, + 1406.0, + 1143.0, + 1406.0, + 1185.0, + 292.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1178.0, + 566.0, + 1178.0, + 566.0, + 1213.0, + 294.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 458.0, + 1405.0, + 458.0, + 1405.0, + 495.0, + 293.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 489.0, + 1405.0, + 489.0, + 1405.0, + 527.0, + 293.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 522.0, + 1405.0, + 522.0, + 1405.0, + 556.0, + 293.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 547.0, + 1405.0, + 547.0, + 1405.0, + 590.0, + 292.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 583.0, + 1405.0, + 583.0, + 1405.0, + 618.0, + 293.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 614.0, + 1404.0, + 614.0, + 1404.0, + 646.0, + 294.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 642.0, + 1408.0, + 642.0, + 1408.0, + 678.0, + 292.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 674.0, + 1405.0, + 674.0, + 1405.0, + 709.0, + 294.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 704.0, + 1405.0, + 704.0, + 1405.0, + 739.0, + 292.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 730.0, + 1124.0, + 730.0, + 1124.0, + 774.0, + 293.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1759.0, + 995.0, + 1759.0, + 995.0, + 1795.0, + 295.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1026.0, + 1759.0, + 1405.0, + 1759.0, + 1405.0, + 1795.0, + 1026.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1790.0, + 396.0, + 1790.0, + 396.0, + 1823.0, + 296.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 1790.0, + 1405.0, + 1790.0, + 1405.0, + 1823.0, + 431.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1822.0, + 1016.0, + 1822.0, + 1016.0, + 1854.0, + 296.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1822.0, + 1406.0, + 1822.0, + 1406.0, + 1854.0, + 1037.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1852.0, + 1403.0, + 1852.0, + 1403.0, + 1884.0, + 296.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1882.0, + 1407.0, + 1882.0, + 1407.0, + 1918.0, + 295.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1910.0, + 1371.0, + 1910.0, + 1371.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1940.0, + 878.0, + 1940.0, + 878.0, + 1977.0, + 295.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1977.0, + 988.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1966.0, + 902.0, + 1966.0, + 902.0, + 2011.0, + 292.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 1966.0, + 1047.0, + 1966.0, + 1047.0, + 2011.0, + 945.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 1966.0, + 1410.0, + 1966.0, + 1410.0, + 2011.0, + 1220.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2000.0, + 1405.0, + 2000.0, + 1405.0, + 2041.0, + 293.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 226.0, + 1408.0, + 226.0, + 1408.0, + 267.0, + 292.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 262.0, + 1406.0, + 262.0, + 1406.0, + 295.0, + 293.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 291.0, + 1408.0, + 291.0, + 1408.0, + 326.0, + 294.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 321.0, + 1406.0, + 321.0, + 1406.0, + 357.0, + 293.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 349.0, + 1406.0, + 349.0, + 1406.0, + 389.0, + 292.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 380.0, + 1408.0, + 380.0, + 1408.0, + 420.0, + 292.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 415.0, + 1408.0, + 415.0, + 1408.0, + 449.0, + 296.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1270.0, + 1405.0, + 1270.0, + 1405.0, + 1305.0, + 292.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1302.0, + 1405.0, + 1302.0, + 1405.0, + 1335.0, + 294.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1333.0, + 1404.0, + 1333.0, + 1404.0, + 1364.0, + 297.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1364.0, + 1404.0, + 1364.0, + 1404.0, + 1396.0, + 297.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1392.0, + 1407.0, + 1392.0, + 1407.0, + 1428.0, + 295.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1423.0, + 1126.0, + 1423.0, + 1126.0, + 1459.0, + 293.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1470.0, + 1405.0, + 1470.0, + 1405.0, + 1506.0, + 293.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1500.0, + 785.0, + 1500.0, + 785.0, + 1537.0, + 294.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 1500.0, + 1405.0, + 1500.0, + 1405.0, + 1537.0, + 857.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1531.0, + 1409.0, + 1531.0, + 1409.0, + 1568.0, + 294.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1563.0, + 1406.0, + 1563.0, + 1406.0, + 1596.0, + 295.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1593.0, + 578.0, + 1593.0, + 578.0, + 1626.0, + 295.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1219.0, + 1248.0, + 1219.0, + 1248.0, + 1264.0, + 294.0, + 1264.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 861, + 1405, + 861, + 1405, + 1168, + 297, + 1168 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1727, + 1404, + 1727, + 1404, + 2034, + 297, + 2034 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1210, + 1406, + 1210, + 1406, + 1456, + 298, + 1456 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1498, + 1404, + 1498, + 1404, + 1714, + 297, + 1714 + ], + "score": 0.98 + }, + { + "category_id": 3, + "poly": [ + 484, + 225, + 1212, + 225, + 1212, + 533, + 484, + 533 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 295, + 670, + 1402, + 670, + 1402, + 734, + 295, + 734 + ], + "score": 0.944 + }, + { + "category_id": 4, + "poly": [ + 554, + 560, + 1145, + 560, + 1145, + 593, + 554, + 593 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 295, + 790, + 1398, + 790, + 1398, + 823, + 295, + 823 + ], + "score": 0.855 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 857, + 75, + 857, + 105, + 297, + 105 + ], + "score": 0.824 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.727 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 857, + 75, + 857, + 104, + 297, + 104 + ], + "score": 0.114 + }, + { + "category_id": 13, + "poly": [ + 377, + 1681, + 554, + 1681, + 554, + 1715, + 377, + 1715 + ], + "score": 0.92, + "latex": "\\bar { f } ^ { - 1 } ( f ( \\bar { x } ) ) = x" + }, + { + "category_id": 13, + "poly": [ + 886, + 1650, + 935, + 1650, + 935, + 1684, + 886, + 1684 + ], + "score": 0.92, + "latex": "f ^ { - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1350, + 894, + 1406, + 894, + 1406, + 922, + 1350, + 922 + ], + "score": 0.86, + "latex": "\\mathrm { C } { + + }" + }, + { + "category_id": 13, + "poly": [ + 816, + 1652, + 837, + 1652, + 837, + 1684, + 816, + 1684 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1501, + 1352, + 1501, + 1352, + 1532, + 1332, + 1532 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 950, + 1501, + 970, + 1501, + 970, + 1531, + 950, + 1531 + ], + "score": 0.77, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 297, + 1650, + 436, + 1650, + 436, + 1683, + 297, + 1683 + ], + "score": 0.65, + "latex": "( \\mathtt { I s u } \\ f \\ f ^ { - 1 } )" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 238.0, + 935.0, + 238.0, + 935.0, + 254.0, + 920.0, + 254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 250.0, + 566.0, + 250.0, + 566.0, + 291.0, + 538.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 276.0, + 644.0, + 276.0, + 644.0, + 290.0, + 632.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 250.0, + 710.0, + 250.0, + 710.0, + 298.0, + 654.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 255.0, + 987.0, + 255.0, + 987.0, + 300.0, + 893.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 255.0, + 1101.0, + 255.0, + 1101.0, + 303.0, + 1045.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 501.0, + 294.0, + 513.0, + 294.0, + 513.0, + 306.0, + 501.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 288.0, + 566.0, + 288.0, + 566.0, + 310.0, + 538.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 289.0, + 709.0, + 289.0, + 709.0, + 315.0, + 655.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 302.0, + 868.0, + 302.0, + 868.0, + 310.0, + 858.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 293.0, + 976.0, + 293.0, + 976.0, + 318.0, + 906.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1024.0, + 283.0, + 1037.0, + 283.0, + 1037.0, + 296.0, + 1024.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 295.0, + 1101.0, + 295.0, + 1101.0, + 321.0, + 1047.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 307.0, + 566.0, + 307.0, + 566.0, + 330.0, + 538.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 311.0, + 961.0, + 311.0, + 961.0, + 340.0, + 922.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 326.0, + 566.0, + 326.0, + 566.0, + 350.0, + 538.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 330.0, + 961.0, + 330.0, + 961.0, + 358.0, + 922.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 364.0, + 620.0, + 364.0, + 620.0, + 377.0, + 608.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 380.0, + 647.0, + 380.0, + 647.0, + 406.0, + 574.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 388.0, + 686.0, + 388.0, + 686.0, + 401.0, + 675.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 386.0, + 1039.0, + 386.0, + 1039.0, + 412.0, + 965.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 467.0, + 519.0, + 467.0, + 519.0, + 479.0, + 507.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 442.0, + 572.0, + 442.0, + 572.0, + 503.0, + 542.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 458.0, + 632.0, + 458.0, + 632.0, + 471.0, + 620.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 442.0, + 686.0, + 442.0, + 686.0, + 484.0, + 656.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 471.0, + 747.0, + 471.0, + 747.0, + 483.0, + 736.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 447.0, + 801.0, + 447.0, + 801.0, + 506.0, + 772.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 474.0, + 910.0, + 474.0, + 910.0, + 486.0, + 898.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 448.0, + 967.0, + 448.0, + 967.0, + 508.0, + 928.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 464.0, + 1024.0, + 464.0, + 1024.0, + 476.0, + 1011.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 467.0, + 1080.0, + 467.0, + 1080.0, + 489.0, + 1041.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 478.0, + 1138.0, + 478.0, + 1138.0, + 487.0, + 1129.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 449.0, + 1198.0, + 449.0, + 1198.0, + 515.0, + 1158.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 510.0, + 635.0, + 510.0, + 635.0, + 520.0, + 626.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 763.0, + 507.0, + 779.0, + 507.0, + 779.0, + 525.0, + 763.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 447.0, + 1083.0, + 447.0, + 1083.0, + 471.0, + 1041.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 531.0, + 508.0, + 538.0, + 508.0, + 538.0, + 529.0, + 531.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 558.0, + 1147.0, + 558.0, + 1147.0, + 596.0, + 550.0, + 596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 787.0, + 1402.0, + 787.0, + 1402.0, + 825.0, + 295.0, + 825.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, + 861.0, + 2085.0, + 861.0, + 2120.0, + 839.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 859.0, + 72.0, + 859.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 861.0, + 1407.0, + 861.0, + 1407.0, + 898.0, + 294.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 892.0, + 1349.0, + 892.0, + 1349.0, + 927.0, + 294.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 920.0, + 1407.0, + 920.0, + 1407.0, + 960.0, + 294.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 953.0, + 1406.0, + 953.0, + 1406.0, + 989.0, + 294.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 984.0, + 1408.0, + 984.0, + 1408.0, + 1021.0, + 292.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1015.0, + 1407.0, + 1015.0, + 1407.0, + 1049.0, + 294.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1045.0, + 1407.0, + 1045.0, + 1407.0, + 1081.0, + 294.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1074.0, + 1410.0, + 1074.0, + 1410.0, + 1111.0, + 292.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1107.0, + 1406.0, + 1107.0, + 1406.0, + 1139.0, + 296.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1138.0, + 1407.0, + 1138.0, + 1407.0, + 1170.0, + 296.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1729.0, + 1404.0, + 1729.0, + 1404.0, + 1761.0, + 296.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1760.0, + 1406.0, + 1760.0, + 1406.0, + 1795.0, + 295.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1791.0, + 1405.0, + 1791.0, + 1405.0, + 1823.0, + 296.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1822.0, + 1405.0, + 1822.0, + 1405.0, + 1854.0, + 295.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1850.0, + 1406.0, + 1850.0, + 1406.0, + 1884.0, + 292.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1882.0, + 1407.0, + 1882.0, + 1407.0, + 1917.0, + 295.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1908.0, + 1407.0, + 1908.0, + 1407.0, + 1949.0, + 291.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1942.0, + 1404.0, + 1942.0, + 1404.0, + 1977.0, + 292.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1404.0, + 1972.0, + 1404.0, + 2006.0, + 294.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 1356.0, + 2004.0, + 1356.0, + 2036.0, + 295.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1212.0, + 1408.0, + 1212.0, + 1408.0, + 1245.0, + 295.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1240.0, + 1407.0, + 1240.0, + 1407.0, + 1278.0, + 293.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1272.0, + 1404.0, + 1272.0, + 1404.0, + 1307.0, + 293.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1303.0, + 1408.0, + 1303.0, + 1408.0, + 1338.0, + 292.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1334.0, + 1404.0, + 1334.0, + 1404.0, + 1368.0, + 295.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1363.0, + 1404.0, + 1363.0, + 1404.0, + 1397.0, + 295.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1393.0, + 1407.0, + 1393.0, + 1407.0, + 1429.0, + 292.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1426.0, + 990.0, + 1426.0, + 990.0, + 1459.0, + 295.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1500.0, + 949.0, + 1500.0, + 949.0, + 1534.0, + 295.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1500.0, + 1331.0, + 1500.0, + 1331.0, + 1534.0, + 971.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 1500.0, + 1406.0, + 1500.0, + 1406.0, + 1534.0, + 1353.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1529.0, + 1407.0, + 1529.0, + 1407.0, + 1566.0, + 292.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1562.0, + 1405.0, + 1562.0, + 1405.0, + 1596.0, + 295.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1591.0, + 1405.0, + 1591.0, + 1405.0, + 1626.0, + 295.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1621.0, + 1404.0, + 1621.0, + 1404.0, + 1655.0, + 295.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1648.0, + 296.0, + 1648.0, + 296.0, + 1689.0, + 291.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 1648.0, + 815.0, + 1648.0, + 815.0, + 1689.0, + 437.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 1648.0, + 885.0, + 1648.0, + 885.0, + 1689.0, + 838.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 1648.0, + 1406.0, + 1648.0, + 1406.0, + 1689.0, + 936.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1680.0, + 376.0, + 1680.0, + 376.0, + 1718.0, + 294.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 555.0, + 1680.0, + 1127.0, + 1680.0, + 1127.0, + 1718.0, + 555.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 667.0, + 1405.0, + 667.0, + 1405.0, + 707.0, + 293.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 701.0, + 452.0, + 701.0, + 452.0, + 735.0, + 293.0, + 735.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1493, + 1405, + 1493, + 1405, + 1858, + 297, + 1858 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1104, + 1405, + 1104, + 1405, + 1380, + 298, + 1380 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 813, + 1404, + 813, + 1404, + 1089, + 298, + 1089 + ], + "score": 0.981 + }, + { + "category_id": 3, + "poly": [ + 305, + 239, + 1315, + 239, + 1315, + 630, + 305, + 630 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 294, + 666, + 1400, + 666, + 1400, + 761, + 294, + 761 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 299, + 1972, + 1402, + 1972, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.944 + }, + { + "category_id": 0, + "poly": [ + 299, + 1426, + 995, + 1426, + 995, + 1458, + 299, + 1458 + ], + "score": 0.893 + }, + { + "category_id": 0, + "poly": [ + 300, + 1903, + 557, + 1903, + 557, + 1938, + 300, + 1938 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2112, + 841, + 2112 + ], + "score": 0.767 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 857, + 76, + 857, + 104, + 298, + 104 + ], + "score": 0.737 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 855, + 76, + 855, + 104, + 300, + 104 + ], + "score": 0.433 + }, + { + "category_id": 15, + "poly": [ + 356.0, + 249.0, + 438.0, + 249.0, + 438.0, + 270.0, + 356.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 250.0, + 606.0, + 250.0, + 606.0, + 270.0, + 568.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 249.0, + 772.0, + 249.0, + 772.0, + 270.0, + 739.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 244.0, + 1012.0, + 244.0, + 1012.0, + 268.0, + 929.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 246.0, + 1179.0, + 246.0, + 1179.0, + 267.0, + 1151.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 268.0, + 511.0, + 268.0, + 511.0, + 292.0, + 453.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 272.0, + 761.0, + 272.0, + 761.0, + 281.0, + 750.0, + 281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 269.0, + 1010.0, + 269.0, + 1010.0, + 295.0, + 967.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 285.0, + 501.0, + 285.0, + 501.0, + 305.0, + 462.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 281.0, + 781.0, + 281.0, + 781.0, + 305.0, + 730.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 277.0, + 1146.0, + 277.0, + 1146.0, + 304.0, + 1078.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 302.0, + 563.0, + 302.0, + 563.0, + 325.0, + 478.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 300.0, + 1015.0, + 300.0, + 1015.0, + 319.0, + 926.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 300.0, + 1271.0, + 300.0, + 1271.0, + 320.0, + 1239.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 321.0, + 1142.0, + 321.0, + 1142.0, + 345.0, + 1082.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 350.0, + 452.0, + 350.0, + 452.0, + 385.0, + 393.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 549.0, + 352.0, + 640.0, + 352.0, + 640.0, + 378.0, + 549.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 360.0, + 1008.0, + 360.0, + 1008.0, + 383.0, + 920.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 367.0, + 1156.0, + 367.0, + 1156.0, + 394.0, + 1067.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 393.0, + 529.0, + 393.0, + 529.0, + 420.0, + 472.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 396.0, + 715.0, + 396.0, + 715.0, + 419.0, + 655.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 410.0, + 1029.0, + 410.0, + 1029.0, + 432.0, + 953.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 410.0, + 1146.0, + 410.0, + 1146.0, + 432.0, + 1072.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 409.0, + 1266.0, + 409.0, + 1266.0, + 432.0, + 1190.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 431.0, + 345.0, + 431.0, + 345.0, + 455.0, + 301.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 442.0, + 626.0, + 442.0, + 626.0, + 462.0, + 566.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 452.0, + 793.0, + 452.0, + 793.0, + 481.0, + 721.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 444.0, + 916.0, + 444.0, + 916.0, + 469.0, + 871.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 451.0, + 1126.0, + 451.0, + 1126.0, + 468.0, + 1096.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 479.0, + 485.0, + 479.0, + 485.0, + 502.0, + 397.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 490.0, + 1133.0, + 490.0, + 1133.0, + 514.0, + 1087.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 509.0, + 801.0, + 509.0, + 801.0, + 532.0, + 705.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 519.0, + 983.0, + 519.0, + 983.0, + 541.0, + 943.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 524.0, + 1161.0, + 524.0, + 1161.0, + 550.0, + 1056.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 551.0, + 1116.0, + 551.0, + 1116.0, + 560.0, + 1105.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 560.0, + 405.0, + 560.0, + 405.0, + 575.0, + 391.0, + 575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 430.0, + 556.0, + 470.0, + 556.0, + 470.0, + 581.0, + 430.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 563.0, + 506.0, + 563.0, + 506.0, + 574.0, + 498.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 557.0, + 628.0, + 557.0, + 628.0, + 581.0, + 581.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 558.0, + 800.0, + 558.0, + 800.0, + 581.0, + 708.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 563.0, + 1041.0, + 563.0, + 1041.0, + 587.0, + 976.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 564.0, + 1160.0, + 564.0, + 1160.0, + 587.0, + 1061.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 599.0, + 581.0, + 599.0, + 581.0, + 635.0, + 537.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1068.0, + 597.0, + 1111.0, + 597.0, + 1111.0, + 635.0, + 1068.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 666.0, + 1406.0, + 666.0, + 1406.0, + 704.0, + 294.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 696.0, + 1407.0, + 696.0, + 1407.0, + 734.0, + 292.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 727.0, + 1366.0, + 727.0, + 1366.0, + 766.0, + 293.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1421.0, + 1000.0, + 1421.0, + 1000.0, + 1464.0, + 293.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1900.0, + 561.0, + 1900.0, + 561.0, + 1944.0, + 293.0, + 1944.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": [ + 298.0, + 73.0, + 859.0, + 73.0, + 859.0, + 108.0, + 298.0, + 108.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, + 1494.0, + 1405.0, + 1494.0, + 1405.0, + 1528.0, + 296.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1524.0, + 1405.0, + 1524.0, + 1405.0, + 1558.0, + 295.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1554.0, + 1406.0, + 1554.0, + 1406.0, + 1588.0, + 295.0, + 1588.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": [ + 295.0, + 1614.0, + 1403.0, + 1614.0, + 1403.0, + 1648.0, + 295.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1646.0, + 1405.0, + 1646.0, + 1405.0, + 1680.0, + 295.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1673.0, + 1406.0, + 1673.0, + 1406.0, + 1713.0, + 292.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1707.0, + 1405.0, + 1707.0, + 1405.0, + 1741.0, + 295.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1737.0, + 1405.0, + 1737.0, + 1405.0, + 1771.0, + 295.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1766.0, + 1403.0, + 1766.0, + 1403.0, + 1800.0, + 295.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1794.0, + 1405.0, + 1794.0, + 1405.0, + 1835.0, + 292.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1829.0, + 1408.0, + 1829.0, + 1408.0, + 1863.0, + 295.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1105.0, + 1403.0, + 1105.0, + 1403.0, + 1138.0, + 296.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1135.0, + 1405.0, + 1135.0, + 1405.0, + 1170.0, + 293.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1164.0, + 1408.0, + 1164.0, + 1408.0, + 1201.0, + 292.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1194.0, + 1407.0, + 1194.0, + 1407.0, + 1233.0, + 293.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1226.0, + 1406.0, + 1226.0, + 1406.0, + 1263.0, + 295.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1254.0, + 1409.0, + 1254.0, + 1409.0, + 1297.0, + 292.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1289.0, + 1403.0, + 1289.0, + 1403.0, + 1322.0, + 296.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1319.0, + 1403.0, + 1319.0, + 1403.0, + 1352.0, + 296.0, + 1352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1349.0, + 1387.0, + 1349.0, + 1387.0, + 1386.0, + 296.0, + 1386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 810.0, + 1408.0, + 810.0, + 1408.0, + 854.0, + 293.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 844.0, + 1404.0, + 844.0, + 1404.0, + 879.0, + 294.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 873.0, + 1406.0, + 873.0, + 1406.0, + 914.0, + 292.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 905.0, + 1405.0, + 905.0, + 1405.0, + 942.0, + 294.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 937.0, + 1406.0, + 937.0, + 1406.0, + 973.0, + 294.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 967.0, + 1405.0, + 967.0, + 1405.0, + 1002.0, + 293.0, + 1002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 994.0, + 1410.0, + 994.0, + 1410.0, + 1036.0, + 292.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1027.0, + 1406.0, + 1027.0, + 1406.0, + 1063.0, + 294.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1058.0, + 1301.0, + 1058.0, + 1301.0, + 1095.0, + 294.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1969.0, + 1406.0, + 1969.0, + 1406.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 1406.0, + 2002.0, + 1406.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 348, + 1669, + 1351, + 1669, + 1351, + 2071, + 348, + 2071 + ], + "score": 0.984, + "html": "
AMPTensorFlow
maktime (s)epochsinst/stime (s)epochsinst/s
MNIST (97%)191.13207634.535880
440.4 (2.2x)46268
List reduction (97%)1781013k46718k
466 (1.2x)10.516k
1660 (1.3x)9.516k
(2 replicas)438(2x)1235k
(4 replicas)821 (3.8x)1371k
Sentiment (82%)118521022085265
882 (2.3x)2222
16104 (1.8x)3258
QM9 (4.6)4N/AN/A9886696661217
16522776.51797
" + }, + { + "category_id": 1, + "poly": [ + 297, + 706, + 1405, + 706, + 1405, + 1045, + 297, + 1045 + ], + "score": 0.983 + }, + { + "category_id": 5, + "poly": [ + 299, + 304, + 1403, + 304, + 1403, + 650, + 299, + 650 + ], + "score": 0.981, + "html": "
ModelData setDifficultyExperiment purpose
MLPMNISTtoyThe standard deep learning bench- mark (for which AMPNet is not
RNNList reductiontoyspecifically designed) The simplest architecture with dy-
Tree-LSTMStanford Sentiment Treebankreal-worldnamic control flow (a for loop) The TensorFlow Fold benchmark for
GNNQM9real-worldbackpropagation through structure Complex control flow with loops over time and structure
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1059, + 1404, + 1059, + 1404, + 1182, + 298, + 1182 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1197, + 1405, + 1197, + 1405, + 1415, + 297, + 1415 + ], + "score": 0.973 + }, + { + "category_id": 6, + "poly": [ + 297, + 1512, + 1404, + 1512, + 1404, + 1667, + 297, + 1667 + ], + "score": 0.969 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 105, + 298, + 105 + ], + "score": 0.918 + }, + { + "category_id": 6, + "poly": [ + 288, + 229, + 1403, + 229, + 1403, + 295, + 288, + 295 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 840, + 2086, + 859, + 2086, + 859, + 2112, + 840, + 2112 + ], + "score": 0.764 + }, + { + "category_id": 13, + "poly": [ + 735, + 1380, + 881, + 1380, + 881, + 1414, + 735, + 1414 + ], + "score": 0.92, + "latex": "3 m / ( m + 2 )" + }, + { + "category_id": 13, + "poly": [ + 296, + 1607, + 402, + 1607, + 402, + 1635, + 296, + 1635 + ], + "score": 0.87, + "latex": "\\mathrm { m a k } = 1" + }, + { + "category_id": 13, + "poly": [ + 1068, + 1289, + 1121, + 1289, + 1121, + 1318, + 1068, + 1318 + ], + "score": 0.74, + "latex": "2 . 2 \\mathbf { x }" + }, + { + "category_id": 13, + "poly": [ + 605, + 1199, + 638, + 1199, + 638, + 1226, + 605, + 1226 + ], + "score": 0.62, + "latex": "_ { 3 \\mathrm { X } }" + }, + { + "category_id": 13, + "poly": [ + 1315, + 1383, + 1394, + 1383, + 1394, + 1411, + 1315, + 1411 + ], + "score": 0.61, + "latex": "s = m" + }, + { + "category_id": 13, + "poly": [ + 440, + 1382, + 473, + 1382, + 473, + 1409, + 440, + 1409 + ], + "score": 0.47, + "latex": "2 \\mathbf { x }" + }, + { + "category_id": 13, + "poly": [ + 1059, + 1352, + 1129, + 1352, + 1129, + 1380, + 1059, + 1380 + ], + "score": 0.46, + "latex": "s = 4" + }, + { + "category_id": 13, + "poly": [ + 838, + 1352, + 1129, + 1352, + 1129, + 1381, + 838, + 1381 + ], + "score": 0.36, + "latex": "\\mathtt { m a x \\mathrm { _ { - } a c t i v e \\mathrm { _ { - } k e y s = 4 } } }" + }, + { + "category_id": 13, + "poly": [ + 1171, + 1200, + 1226, + 1200, + 1226, + 1227, + 1171, + 1227 + ], + "score": 0.33, + "latex": ": = 1" + }, + { + "category_id": 13, + "poly": [ + 526, + 1229, + 596, + 1229, + 596, + 1258, + 526, + 1258 + ], + "score": 0.29, + "latex": "s = 4" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1515.0, + 1404.0, + 1515.0, + 1404.0, + 1548.0, + 296.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1546.0, + 1405.0, + 1546.0, + 1405.0, + 1579.0, + 296.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1574.0, + 1409.0, + 1574.0, + 1409.0, + 1612.0, + 292.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1603.0, + 295.0, + 1603.0, + 295.0, + 1644.0, + 292.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 1603.0, + 1407.0, + 1603.0, + 1407.0, + 1644.0, + 403.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1636.0, + 1014.0, + 1636.0, + 1014.0, + 1673.0, + 295.0, + 1673.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": [ + 297.0, + 231.0, + 1404.0, + 231.0, + 1404.0, + 263.0, + 297.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 261.0, + 1164.0, + 261.0, + 1164.0, + 296.0, + 294.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2086.0, + 861.0, + 2086.0, + 861.0, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 707.0, + 1405.0, + 707.0, + 1405.0, + 742.0, + 295.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 738.0, + 1406.0, + 738.0, + 1406.0, + 773.0, + 295.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 767.0, + 1406.0, + 767.0, + 1406.0, + 807.0, + 292.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 801.0, + 1403.0, + 801.0, + 1403.0, + 836.0, + 295.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 829.0, + 1405.0, + 829.0, + 1405.0, + 864.0, + 295.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 858.0, + 1405.0, + 858.0, + 1405.0, + 895.0, + 294.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 890.0, + 1405.0, + 890.0, + 1405.0, + 925.0, + 295.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 920.0, + 1406.0, + 920.0, + 1406.0, + 957.0, + 294.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 950.0, + 1406.0, + 950.0, + 1406.0, + 989.0, + 292.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 982.0, + 1405.0, + 982.0, + 1405.0, + 1016.0, + 295.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1013.0, + 855.0, + 1013.0, + 855.0, + 1046.0, + 294.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1059.0, + 1405.0, + 1059.0, + 1405.0, + 1095.0, + 293.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1088.0, + 1406.0, + 1088.0, + 1406.0, + 1125.0, + 292.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1119.0, + 1406.0, + 1119.0, + 1406.0, + 1157.0, + 292.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1152.0, + 1146.0, + 1152.0, + 1146.0, + 1184.0, + 294.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1195.0, + 604.0, + 1195.0, + 604.0, + 1233.0, + 295.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1195.0, + 1170.0, + 1195.0, + 1170.0, + 1233.0, + 639.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 1195.0, + 1403.0, + 1195.0, + 1403.0, + 1233.0, + 1227.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1227.0, + 525.0, + 1227.0, + 525.0, + 1261.0, + 295.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1227.0, + 1402.0, + 1227.0, + 1402.0, + 1261.0, + 597.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1259.0, + 1405.0, + 1259.0, + 1405.0, + 1294.0, + 295.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1289.0, + 1067.0, + 1289.0, + 1067.0, + 1323.0, + 294.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 1289.0, + 1406.0, + 1289.0, + 1406.0, + 1323.0, + 1122.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1317.0, + 1406.0, + 1317.0, + 1406.0, + 1356.0, + 291.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1351.0, + 837.0, + 1351.0, + 837.0, + 1385.0, + 295.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 1351.0, + 1406.0, + 1351.0, + 1406.0, + 1385.0, + 1130.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1381.0, + 439.0, + 1381.0, + 439.0, + 1415.0, + 296.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 474.0, + 1381.0, + 734.0, + 1381.0, + 734.0, + 1415.0, + 474.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 1381.0, + 1314.0, + 1381.0, + 1314.0, + 1415.0, + 882.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1381.0, + 1406.0, + 1381.0, + 1406.0, + 1415.0, + 1395.0, + 1415.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1149, + 1404, + 1149, + 1404, + 1303, + 299, + 1303 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1583, + 1406, + 1583, + 1406, + 1860, + 298, + 1860 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1395, + 1404, + 1395, + 1404, + 1550, + 299, + 1550 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 981, + 1403, + 981, + 1403, + 1134, + 298, + 1134 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 904, + 1401, + 904, + 1401, + 966, + 299, + 966 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 300, + 1318, + 1400, + 1318, + 1400, + 1380, + 300, + 1380 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 298, + 1972, + 1402, + 1972, + 1402, + 2035, + 298, + 2035 + ], + "score": 0.942 + }, + { + "category_id": 4, + "poly": [ + 296, + 754, + 1405, + 754, + 1405, + 848, + 296, + 848 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 301, + 1902, + 587, + 1902, + 587, + 1937, + 301, + 1937 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 857, + 76, + 857, + 104, + 298, + 104 + ], + "score": 0.85 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.789 + }, + { + "category_id": 4, + "poly": [ + 282, + 648, + 1456, + 648, + 1456, + 708, + 282, + 708 + ], + "score": 0.697 + }, + { + "category_id": 3, + "poly": [ + 302, + 246, + 1411, + 246, + 1411, + 636, + 302, + 636 + ], + "score": 0.623 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 855, + 76, + 855, + 104, + 300, + 104 + ], + "score": 0.135 + }, + { + "category_id": 13, + "poly": [ + 1172, + 1675, + 1226, + 1675, + 1226, + 1704, + 1172, + 1704 + ], + "score": 0.86, + "latex": "96 \\%" + }, + { + "category_id": 13, + "poly": [ + 1284, + 1458, + 1345, + 1458, + 1345, + 1486, + 1284, + 1486 + ], + "score": 0.85, + "latex": "94 \\%" + }, + { + "category_id": 13, + "poly": [ + 1348, + 1012, + 1402, + 1012, + 1402, + 1041, + 1348, + 1041 + ], + "score": 0.69, + "latex": "3 . 5 \\mathrm { x }" + }, + { + "category_id": 13, + "poly": [ + 692, + 1459, + 756, + 1459, + 756, + 1487, + 692, + 1487 + ], + "score": 0.65, + "latex": "= 3 2" + }, + { + "category_id": 13, + "poly": [ + 1243, + 1013, + 1297, + 1013, + 1297, + 1041, + 1243, + 1041 + ], + "score": 0.64, + "latex": "2 . 5 \\mathrm { x }" + }, + { + "category_id": 13, + "poly": [ + 823, + 905, + 876, + 905, + 876, + 933, + 823, + 933 + ], + "score": 0.59, + "latex": "= 8" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 751.0, + 1405.0, + 751.0, + 1405.0, + 791.0, + 293.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 785.0, + 1406.0, + 785.0, + 1406.0, + 823.0, + 294.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 813.0, + 1087.0, + 813.0, + 1087.0, + 853.0, + 293.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1899.0, + 593.0, + 1899.0, + 593.0, + 1943.0, + 293.0, + 1943.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": [ + 838.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2117.0, + 838.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 648.0, + 1461.0, + 648.0, + 1461.0, + 682.0, + 293.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 676.0, + 586.0, + 676.0, + 586.0, + 705.0, + 293.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 674.0, + 1421.0, + 674.0, + 1421.0, + 709.0, + 839.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 262.0, + 1168.0, + 262.0, + 1168.0, + 302.0, + 1025.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 266.0, + 1233.0, + 266.0, + 1233.0, + 299.0, + 1185.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 273.0, + 930.0, + 273.0, + 930.0, + 308.0, + 888.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 281.0, + 906.0, + 281.0, + 906.0, + 545.0, + 858.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 284.0, + 342.0, + 284.0, + 342.0, + 574.0, + 301.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 293.0, + 639.0, + 293.0, + 639.0, + 317.0, + 602.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 294.0, + 591.0, + 294.0, + 591.0, + 316.0, + 524.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 294.0, + 699.0, + 294.0, + 699.0, + 318.0, + 664.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 294.0, + 783.0, + 294.0, + 783.0, + 317.0, + 749.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 315.0, + 351.0, + 315.0, + 351.0, + 341.0, + 333.0, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 310.0, + 740.0, + 310.0, + 740.0, + 359.0, + 634.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 321.0, + 931.0, + 321.0, + 931.0, + 361.0, + 887.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 308.0, + 1276.0, + 308.0, + 1276.0, + 338.0, + 1213.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 320.0, + 1393.0, + 320.0, + 1393.0, + 353.0, + 1306.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 346.0, + 806.0, + 346.0, + 806.0, + 375.0, + 711.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1280.0, + 343.0, + 1334.0, + 343.0, + 1334.0, + 380.0, + 1280.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 950.0, + 361.0, + 967.0, + 361.0, + 967.0, + 386.0, + 950.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 377.0, + 931.0, + 377.0, + 931.0, + 412.0, + 888.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 400.0, + 353.0, + 400.0, + 353.0, + 421.0, + 333.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 408.0, + 1300.0, + 408.0, + 1300.0, + 444.0, + 1234.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 427.0, + 807.0, + 427.0, + 807.0, + 461.0, + 714.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 431.0, + 930.0, + 431.0, + 930.0, + 464.0, + 887.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 436.0, + 1246.0, + 436.0, + 1246.0, + 455.0, + 1224.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 478.0, + 354.0, + 478.0, + 354.0, + 509.0, + 331.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 472.0, + 487.0, + 472.0, + 487.0, + 525.0, + 386.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 475.0, + 648.0, + 475.0, + 648.0, + 525.0, + 542.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 482.0, + 931.0, + 482.0, + 931.0, + 516.0, + 887.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 463.0, + 956.0, + 463.0, + 956.0, + 487.0, + 935.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 538.0, + 423.0, + 538.0, + 423.0, + 560.0, + 401.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 532.0, + 522.0, + 532.0, + 522.0, + 567.0, + 436.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 532.0, + 702.0, + 532.0, + 702.0, + 563.0, + 537.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 541.0, + 720.0, + 541.0, + 720.0, + 557.0, + 703.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 529.0, + 795.0, + 529.0, + 795.0, + 565.0, + 736.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 534.0, + 931.0, + 534.0, + 931.0, + 569.0, + 901.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 538.0, + 1053.0, + 538.0, + 1053.0, + 567.0, + 982.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 547.0, + 1126.0, + 547.0, + 1126.0, + 558.0, + 1113.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 537.0, + 1212.0, + 537.0, + 1212.0, + 567.0, + 1142.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 547.0, + 1286.0, + 547.0, + 1286.0, + 560.0, + 1266.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 538.0, + 1378.0, + 538.0, + 1378.0, + 564.0, + 1298.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 558.0, + 354.0, + 558.0, + 354.0, + 589.0, + 330.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 575.0, + 436.0, + 575.0, + 436.0, + 609.0, + 365.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 572.0, + 760.0, + 572.0, + 760.0, + 609.0, + 443.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 576.0, + 835.0, + 576.0, + 835.0, + 607.0, + 761.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 575.0, + 1419.0, + 575.0, + 1419.0, + 611.0, + 962.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 599.0, + 712.0, + 599.0, + 712.0, + 639.0, + 446.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1024.0, + 603.0, + 1292.0, + 603.0, + 1292.0, + 639.0, + 1024.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.75, + 249.0, + 1378.75, + 249.0, + 1378.75, + 295.5, + 1285.75, + 295.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.25, + 397.5, + 763.25, + 397.5, + 763.25, + 424.0, + 727.25, + 424.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": [ + 295.0, + 1148.0, + 1405.0, + 1148.0, + 1405.0, + 1184.0, + 295.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1177.0, + 1408.0, + 1177.0, + 1408.0, + 1215.0, + 294.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1210.0, + 1405.0, + 1210.0, + 1405.0, + 1247.0, + 295.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1241.0, + 1405.0, + 1241.0, + 1405.0, + 1276.0, + 293.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1271.0, + 1408.0, + 1271.0, + 1408.0, + 1308.0, + 295.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1583.0, + 1404.0, + 1583.0, + 1404.0, + 1619.0, + 296.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1613.0, + 1159.0, + 1613.0, + 1159.0, + 1648.0, + 293.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1643.0, + 1406.0, + 1643.0, + 1406.0, + 1680.0, + 293.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1672.0, + 1171.0, + 1672.0, + 1171.0, + 1711.0, + 293.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 1672.0, + 1408.0, + 1672.0, + 1408.0, + 1711.0, + 1227.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1706.0, + 1404.0, + 1706.0, + 1404.0, + 1742.0, + 295.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1736.0, + 1406.0, + 1736.0, + 1406.0, + 1773.0, + 295.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1767.0, + 1407.0, + 1767.0, + 1407.0, + 1800.0, + 295.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1792.0, + 1406.0, + 1792.0, + 1406.0, + 1837.0, + 292.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1828.0, + 977.0, + 1828.0, + 977.0, + 1864.0, + 295.0, + 1864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1395.0, + 1405.0, + 1395.0, + 1405.0, + 1429.0, + 295.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1423.0, + 1405.0, + 1423.0, + 1405.0, + 1462.0, + 294.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1457.0, + 691.0, + 1457.0, + 691.0, + 1494.0, + 294.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 1457.0, + 1283.0, + 1457.0, + 1283.0, + 1494.0, + 757.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 1457.0, + 1406.0, + 1457.0, + 1406.0, + 1494.0, + 1346.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1486.0, + 1406.0, + 1486.0, + 1406.0, + 1523.0, + 294.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1518.0, + 1126.0, + 1518.0, + 1126.0, + 1555.0, + 294.0, + 1555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 978.0, + 1405.0, + 978.0, + 1405.0, + 1018.0, + 293.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1010.0, + 1242.0, + 1010.0, + 1242.0, + 1047.0, + 294.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 1010.0, + 1347.0, + 1010.0, + 1347.0, + 1047.0, + 1298.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1040.0, + 1407.0, + 1040.0, + 1407.0, + 1081.0, + 293.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1072.0, + 1405.0, + 1072.0, + 1405.0, + 1109.0, + 294.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1102.0, + 1366.0, + 1102.0, + 1366.0, + 1139.0, + 294.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 902.0, + 822.0, + 902.0, + 822.0, + 938.0, + 295.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 902.0, + 1405.0, + 902.0, + 1405.0, + 938.0, + 877.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 934.0, + 722.0, + 934.0, + 722.0, + 969.0, + 295.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1317.0, + 1404.0, + 1317.0, + 1404.0, + 1353.0, + 296.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1348.0, + 1328.0, + 1348.0, + 1328.0, + 1384.0, + 295.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2007.0, + 296.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2002.0, + 1408.0, + 2002.0, + 1408.0, + 2038.0, + 296.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 549, + 1405, + 549, + 1405, + 1222, + 298, + 1222 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 1497, + 1404, + 1497, + 1404, + 1712, + 298, + 1712 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1403, + 229, + 1403, + 536, + 298, + 536 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1236, + 1404, + 1236, + 1404, + 1482, + 298, + 1482 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1849, + 1403, + 1849, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.979 + }, + { + "category_id": 0, + "poly": [ + 301, + 1771, + 764, + 1771, + 764, + 1806, + 301, + 1806 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 856, + 76, + 856, + 104, + 298, + 104 + ], + "score": 0.832 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2111, + 841, + 2111 + ], + "score": 0.783 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 855, + 76, + 855, + 104, + 300, + 104 + ], + "score": 0.234 + }, + { + "category_id": 13, + "poly": [ + 463, + 1392, + 510, + 1392, + 510, + 1420, + 463, + 1420 + ], + "score": 0.81, + "latex": "> 1" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1765.0, + 772.0, + 1765.0, + 772.0, + 1814.0, + 291.0, + 1814.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": [ + 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, + 859.0, + 73.0, + 859.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 551.0, + 1405.0, + 551.0, + 1405.0, + 587.0, + 295.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 582.0, + 1405.0, + 582.0, + 1405.0, + 619.0, + 293.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 612.0, + 1406.0, + 612.0, + 1406.0, + 648.0, + 295.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 643.0, + 1405.0, + 643.0, + 1405.0, + 678.0, + 295.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 668.0, + 1406.0, + 668.0, + 1406.0, + 713.0, + 292.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 704.0, + 1405.0, + 704.0, + 1405.0, + 739.0, + 296.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 734.0, + 1407.0, + 734.0, + 1407.0, + 770.0, + 295.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 762.0, + 1407.0, + 762.0, + 1407.0, + 803.0, + 292.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 795.0, + 1406.0, + 795.0, + 1406.0, + 831.0, + 295.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 827.0, + 1405.0, + 827.0, + 1405.0, + 859.0, + 296.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 855.0, + 1403.0, + 855.0, + 1403.0, + 892.0, + 293.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 884.0, + 1408.0, + 884.0, + 1408.0, + 925.0, + 292.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 917.0, + 1405.0, + 917.0, + 1405.0, + 953.0, + 295.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 948.0, + 1408.0, + 948.0, + 1408.0, + 983.0, + 295.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 978.0, + 1407.0, + 978.0, + 1407.0, + 1011.0, + 292.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1010.0, + 1406.0, + 1010.0, + 1406.0, + 1042.0, + 296.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1041.0, + 1406.0, + 1041.0, + 1406.0, + 1072.0, + 296.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1070.0, + 1408.0, + 1070.0, + 1408.0, + 1105.0, + 296.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1099.0, + 1406.0, + 1099.0, + 1406.0, + 1135.0, + 295.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1128.0, + 1406.0, + 1128.0, + 1406.0, + 1168.0, + 292.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1163.0, + 1403.0, + 1163.0, + 1403.0, + 1194.0, + 296.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1191.0, + 1314.0, + 1191.0, + 1314.0, + 1225.0, + 294.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1499.0, + 1404.0, + 1499.0, + 1404.0, + 1533.0, + 293.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1529.0, + 1405.0, + 1529.0, + 1405.0, + 1564.0, + 293.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1559.0, + 1404.0, + 1559.0, + 1404.0, + 1593.0, + 294.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1590.0, + 1404.0, + 1590.0, + 1404.0, + 1624.0, + 294.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1619.0, + 1405.0, + 1619.0, + 1405.0, + 1654.0, + 294.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1651.0, + 1404.0, + 1651.0, + 1404.0, + 1686.0, + 294.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1682.0, + 1391.0, + 1682.0, + 1391.0, + 1716.0, + 294.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 230.0, + 1404.0, + 230.0, + 1404.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 262.0, + 1405.0, + 262.0, + 1405.0, + 297.0, + 294.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 288.0, + 1408.0, + 288.0, + 1408.0, + 328.0, + 291.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 321.0, + 1405.0, + 321.0, + 1405.0, + 356.0, + 293.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 355.0, + 1405.0, + 355.0, + 1405.0, + 386.0, + 293.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 383.0, + 1407.0, + 383.0, + 1407.0, + 418.0, + 293.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 413.0, + 1407.0, + 413.0, + 1407.0, + 449.0, + 293.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 444.0, + 1405.0, + 444.0, + 1405.0, + 479.0, + 294.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 474.0, + 1407.0, + 474.0, + 1407.0, + 511.0, + 292.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 503.0, + 1407.0, + 503.0, + 1407.0, + 541.0, + 293.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1238.0, + 1404.0, + 1238.0, + 1404.0, + 1271.0, + 296.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1268.0, + 1402.0, + 1268.0, + 1402.0, + 1301.0, + 294.0, + 1301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1298.0, + 1405.0, + 1298.0, + 1405.0, + 1333.0, + 293.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1329.0, + 1406.0, + 1329.0, + 1406.0, + 1363.0, + 296.0, + 1363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1357.0, + 1404.0, + 1357.0, + 1404.0, + 1396.0, + 293.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1391.0, + 462.0, + 1391.0, + 462.0, + 1425.0, + 294.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1391.0, + 1404.0, + 1391.0, + 1404.0, + 1425.0, + 511.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1420.0, + 1406.0, + 1420.0, + 1406.0, + 1458.0, + 293.0, + 1458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1449.0, + 1283.0, + 1449.0, + 1283.0, + 1486.0, + 293.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1851.0, + 1405.0, + 1851.0, + 1405.0, + 1883.0, + 297.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1883.0, + 1405.0, + 1883.0, + 1405.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, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1977.0, + 293.0, + 1977.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": [ + 294.0, + 2003.0, + 1405.0, + 2003.0, + 1405.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 292, + 334, + 1411, + 334, + 1411, + 2036, + 292, + 2036 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 292, + 229, + 1404, + 229, + 1404, + 294, + 292, + 294 + ], + "score": 0.913 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 105, + 298, + 105 + ], + "score": 0.902 + }, + { + "category_id": 0, + "poly": [ + 298, + 337, + 489, + 337, + 489, + 370, + 298, + 370 + ], + "score": 0.864 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2113, + 836, + 2113 + ], + "score": 0.841 + }, + { + "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": [ + 297.0, + 337.0, + 491.0, + 337.0, + 491.0, + 374.0, + 297.0, + 374.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, + 338.0, + 493.0, + 338.0, + 493.0, + 374.0, + 295.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 382.0, + 1408.0, + 382.0, + 1408.0, + 421.0, + 292.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 410.0, + 1408.0, + 410.0, + 1408.0, + 453.0, + 316.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 440.0, + 585.0, + 440.0, + 585.0, + 475.0, + 320.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 489.0, + 1408.0, + 489.0, + 1408.0, + 526.0, + 290.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 519.0, + 1406.0, + 519.0, + 1406.0, + 554.0, + 320.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 547.0, + 583.0, + 547.0, + 583.0, + 580.0, + 318.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 594.0, + 1408.0, + 594.0, + 1408.0, + 629.0, + 295.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 628.0, + 1311.0, + 628.0, + 1311.0, + 658.0, + 324.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 669.0, + 1408.0, + 669.0, + 1408.0, + 714.0, + 290.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 705.0, + 1021.0, + 705.0, + 1021.0, + 734.0, + 318.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 751.0, + 1408.0, + 751.0, + 1408.0, + 787.0, + 293.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 780.0, + 1406.0, + 780.0, + 1406.0, + 815.0, + 320.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 806.0, + 996.0, + 806.0, + 996.0, + 845.0, + 318.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 860.0, + 1404.0, + 860.0, + 1404.0, + 890.0, + 295.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 887.0, + 670.0, + 887.0, + 670.0, + 920.0, + 316.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 932.0, + 1408.0, + 932.0, + 1408.0, + 975.0, + 290.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 964.0, + 789.0, + 964.0, + 789.0, + 999.0, + 320.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1014.0, + 1406.0, + 1014.0, + 1406.0, + 1050.0, + 293.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1042.0, + 1076.0, + 1042.0, + 1076.0, + 1078.0, + 320.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1091.0, + 1406.0, + 1091.0, + 1406.0, + 1127.0, + 292.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1118.0, + 928.0, + 1118.0, + 928.0, + 1155.0, + 316.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1170.0, + 1406.0, + 1170.0, + 1406.0, + 1206.0, + 293.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1198.0, + 1410.0, + 1198.0, + 1410.0, + 1234.0, + 320.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1224.0, + 392.0, + 1224.0, + 392.0, + 1262.0, + 320.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1275.0, + 1408.0, + 1275.0, + 1408.0, + 1311.0, + 293.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1303.0, + 1408.0, + 1303.0, + 1408.0, + 1339.0, + 320.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1332.0, + 552.0, + 1332.0, + 552.0, + 1365.0, + 320.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1382.0, + 1406.0, + 1382.0, + 1406.0, + 1418.0, + 293.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1410.0, + 1139.0, + 1410.0, + 1139.0, + 1446.0, + 320.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1459.0, + 1406.0, + 1459.0, + 1406.0, + 1495.0, + 292.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1484.0, + 848.0, + 1484.0, + 848.0, + 1523.0, + 316.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1534.0, + 1406.0, + 1534.0, + 1406.0, + 1572.0, + 292.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1564.0, + 1408.0, + 1564.0, + 1408.0, + 1600.0, + 322.0, + 1600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1588.0, + 390.0, + 1588.0, + 390.0, + 1627.0, + 322.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1645.0, + 1402.0, + 1645.0, + 1402.0, + 1675.0, + 295.0, + 1675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1690.0, + 1406.0, + 1690.0, + 1406.0, + 1729.0, + 290.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1718.0, + 392.0, + 1718.0, + 392.0, + 1758.0, + 318.0, + 1758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1771.0, + 1402.0, + 1771.0, + 1402.0, + 1806.0, + 293.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1799.0, + 1099.0, + 1799.0, + 1099.0, + 1834.0, + 320.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1851.0, + 1406.0, + 1851.0, + 1406.0, + 1881.0, + 295.0, + 1881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1880.0, + 1406.0, + 1880.0, + 1406.0, + 1910.0, + 322.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1925.0, + 1408.0, + 1925.0, + 1408.0, + 1960.0, + 292.0, + 1960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1955.0, + 787.0, + 1955.0, + 787.0, + 1988.0, + 320.0, + 1988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2003.0, + 1053.0, + 2003.0, + 1053.0, + 2039.0, + 295.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 1404.0, + 227.0, + 1404.0, + 265.0, + 293.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 257.0, + 380.0, + 257.0, + 380.0, + 297.0, + 294.0, + 297.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.892 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 862, + 2088, + 862, + 2113, + 835, + 2113 + ], + "score": 0.832 + }, + { + "category_id": 1, + "poly": [ + 293, + 195, + 1411, + 195, + 1411, + 1849, + 293, + 1849 + ], + "score": 0.738 + }, + { + "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": [ + 831.0, + 2085.0, + 867.0, + 2085.0, + 867.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 233.0, + 1403.0, + 233.0, + 1403.0, + 267.0, + 296.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 260.0, + 584.0, + 260.0, + 584.0, + 293.0, + 319.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 306.0, + 1407.0, + 306.0, + 1407.0, + 346.0, + 292.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 335.0, + 1405.0, + 335.0, + 1405.0, + 373.0, + 319.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 366.0, + 1311.0, + 366.0, + 1311.0, + 401.0, + 323.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 410.0, + 1407.0, + 410.0, + 1407.0, + 454.0, + 290.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 441.0, + 830.0, + 441.0, + 830.0, + 479.0, + 319.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 488.0, + 1405.0, + 488.0, + 1405.0, + 529.0, + 292.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 523.0, + 1158.0, + 523.0, + 1158.0, + 552.0, + 325.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 565.0, + 1408.0, + 565.0, + 1408.0, + 609.0, + 290.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 598.0, + 1408.0, + 598.0, + 1408.0, + 633.0, + 321.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 621.0, + 403.0, + 621.0, + 403.0, + 663.0, + 321.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 675.0, + 1405.0, + 675.0, + 1405.0, + 710.0, + 294.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 702.0, + 685.0, + 702.0, + 685.0, + 739.0, + 317.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 748.0, + 1407.0, + 748.0, + 1407.0, + 790.0, + 288.0, + 790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 781.0, + 1044.0, + 781.0, + 1044.0, + 816.0, + 321.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 830.0, + 955.0, + 830.0, + 955.0, + 865.0, + 296.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 876.0, + 1408.0, + 876.0, + 1408.0, + 918.0, + 290.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 911.0, + 803.0, + 911.0, + 803.0, + 940.0, + 323.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 958.0, + 1407.0, + 958.0, + 1407.0, + 993.0, + 294.0, + 993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 984.0, + 1205.0, + 984.0, + 1205.0, + 1024.0, + 321.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1033.0, + 1312.0, + 1033.0, + 1312.0, + 1071.0, + 292.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1084.0, + 1405.0, + 1084.0, + 1405.0, + 1119.0, + 294.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1113.0, + 1407.0, + 1113.0, + 1407.0, + 1148.0, + 321.0, + 1148.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1141.0, + 515.0, + 1141.0, + 515.0, + 1175.0, + 323.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1190.0, + 1405.0, + 1190.0, + 1405.0, + 1225.0, + 294.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1221.0, + 867.0, + 1221.0, + 867.0, + 1250.0, + 325.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1263.0, + 1407.0, + 1263.0, + 1407.0, + 1305.0, + 292.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1298.0, + 587.0, + 1298.0, + 587.0, + 1327.0, + 323.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1340.0, + 1407.0, + 1340.0, + 1407.0, + 1384.0, + 290.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1373.0, + 1285.0, + 1373.0, + 1285.0, + 1408.0, + 321.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1422.0, + 1407.0, + 1422.0, + 1407.0, + 1457.0, + 294.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1448.0, + 1407.0, + 1448.0, + 1407.0, + 1490.0, + 319.0, + 1490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1477.0, + 490.0, + 1477.0, + 490.0, + 1512.0, + 323.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1523.0, + 1407.0, + 1523.0, + 1407.0, + 1567.0, + 290.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1556.0, + 1407.0, + 1556.0, + 1407.0, + 1590.0, + 321.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1581.0, + 1410.0, + 1581.0, + 1410.0, + 1621.0, + 321.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1614.0, + 1055.0, + 1614.0, + 1055.0, + 1643.0, + 325.0, + 1643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1656.0, + 1408.0, + 1656.0, + 1408.0, + 1698.0, + 290.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1689.0, + 926.0, + 1689.0, + 926.0, + 1724.0, + 321.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1733.0, + 1409.0, + 1733.0, + 1409.0, + 1777.0, + 290.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1762.0, + 1407.0, + 1762.0, + 1407.0, + 1804.0, + 317.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1791.0, + 894.0, + 1791.0, + 894.0, + 1830.0, + 319.0, + 1830.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 465, + 1404, + 465, + 1404, + 680, + 298, + 680 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 932, + 1404, + 932, + 1404, + 1146, + 298, + 1146 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1350, + 1405, + 1350, + 1405, + 1596, + 298, + 1596 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 695, + 1404, + 695, + 1404, + 818, + 298, + 818 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 295, + 1402, + 295, + 1402, + 449, + 298, + 449 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1691, + 1403, + 1691, + 1403, + 1843, + 299, + 1843 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 299, + 1243, + 1403, + 1243, + 1403, + 1334, + 299, + 1334 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 299, + 1860, + 1404, + 1860, + 1404, + 1953, + 299, + 1953 + ], + "score": 0.969 + }, + { + "category_id": 2, + "poly": [ + 295, + 1978, + 1405, + 1978, + 1405, + 2034, + 295, + 2034 + ], + "score": 0.944 + }, + { + "category_id": 0, + "poly": [ + 299, + 1185, + 464, + 1185, + 464, + 1217, + 299, + 1217 + ], + "score": 0.885 + }, + { + "category_id": 0, + "poly": [ + 301, + 1634, + 686, + 1634, + 686, + 1664, + 301, + 1664 + ], + "score": 0.877 + }, + { + "category_id": 0, + "poly": [ + 299, + 865, + 955, + 865, + 955, + 898, + 299, + 898 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 104, + 298, + 104 + ], + "score": 0.868 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2112, + 835, + 2112 + ], + "score": 0.858 + }, + { + "category_id": 0, + "poly": [ + 300, + 227, + 902, + 227, + 902, + 261, + 300, + 261 + ], + "score": 0.829 + }, + { + "category_id": 13, + "poly": [ + 1055, + 1781, + 1097, + 1781, + 1097, + 1811, + 1055, + 1811 + ], + "score": 0.88, + "latex": "1 0 ^ { 5 }" + }, + { + "category_id": 13, + "poly": [ + 1241, + 1782, + 1284, + 1782, + 1284, + 1811, + 1241, + 1811 + ], + "score": 0.88, + "latex": "1 0 ^ { 4 }" + }, + { + "category_id": 13, + "poly": [ + 889, + 1980, + 909, + 1980, + 909, + 2002, + 889, + 2002 + ], + "score": 0.79, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 1017, + 2006, + 1057, + 2006, + 1057, + 2033, + 1017, + 2033 + ], + "score": 0.71, + "latex": "( L )" + }, + { + "category_id": 13, + "poly": [ + 1353, + 1979, + 1394, + 1979, + 1394, + 2006, + 1353, + 2006 + ], + "score": 0.7, + "latex": "( L )" + }, + { + "category_id": 13, + "poly": [ + 1324, + 1414, + 1394, + 1414, + 1394, + 1443, + 1324, + 1443 + ], + "score": 0.61, + "latex": "s = 4" + }, + { + "category_id": 13, + "poly": [ + 703, + 1475, + 758, + 1475, + 758, + 1503, + 703, + 1503 + ], + "score": 0.55, + "latex": "= 8" + }, + { + "category_id": 13, + "poly": [ + 878, + 2006, + 914, + 2006, + 914, + 2032, + 878, + 2032 + ], + "score": 0.53, + "latex": "( L )" + }, + { + "category_id": 13, + "poly": [ + 777, + 2007, + 800, + 2007, + 800, + 2031, + 777, + 2031 + ], + "score": 0.41, + "latex": "L" + }, + { + "category_id": 13, + "poly": [ + 367, + 2006, + 482, + 2006, + 482, + 2034, + 367, + 2034 + ], + "score": 0.39, + "latex": "( L [ 0 : : 2 ]" + }, + { + "category_id": 13, + "poly": [ + 843, + 1414, + 902, + 1414, + 902, + 1442, + 843, + 1442 + ], + "score": 0.33, + "latex": "\\mathfrak { s } = 1" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1972.0, + 888.0, + 1972.0, + 888.0, + 2012.0, + 330.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 1972.0, + 1352.0, + 1972.0, + 1352.0, + 2012.0, + 910.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1972.0, + 1408.0, + 1972.0, + 1408.0, + 2012.0, + 1395.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2004.0, + 366.0, + 2004.0, + 366.0, + 2036.0, + 293.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 2004.0, + 776.0, + 2004.0, + 776.0, + 2036.0, + 483.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 2004.0, + 877.0, + 2004.0, + 877.0, + 2036.0, + 801.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 2004.0, + 1016.0, + 2004.0, + 1016.0, + 2036.0, + 915.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 2004.0, + 1074.0, + 2004.0, + 1074.0, + 2036.0, + 1058.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1182.0, + 469.0, + 1182.0, + 469.0, + 1222.0, + 292.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1633.0, + 690.0, + 1633.0, + 690.0, + 1668.0, + 294.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 862.0, + 957.0, + 862.0, + 957.0, + 903.0, + 292.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 859.0, + 72.0, + 859.0, + 108.0, + 297.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": [ + 295.0, + 226.0, + 904.0, + 226.0, + 904.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 465.0, + 1405.0, + 465.0, + 1405.0, + 500.0, + 294.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 495.0, + 1405.0, + 495.0, + 1405.0, + 531.0, + 294.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 527.0, + 1406.0, + 527.0, + 1406.0, + 561.0, + 294.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 559.0, + 1405.0, + 559.0, + 1405.0, + 590.0, + 296.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 587.0, + 1406.0, + 587.0, + 1406.0, + 622.0, + 294.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 618.0, + 1405.0, + 618.0, + 1405.0, + 652.0, + 294.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 649.0, + 1327.0, + 649.0, + 1327.0, + 687.0, + 293.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 934.0, + 1405.0, + 934.0, + 1405.0, + 968.0, + 294.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 962.0, + 1406.0, + 962.0, + 1406.0, + 999.0, + 292.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 995.0, + 1404.0, + 995.0, + 1404.0, + 1029.0, + 294.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1023.0, + 1406.0, + 1023.0, + 1406.0, + 1060.0, + 293.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1055.0, + 1405.0, + 1055.0, + 1405.0, + 1088.0, + 293.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1086.0, + 1406.0, + 1086.0, + 1406.0, + 1120.0, + 293.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1115.0, + 414.0, + 1115.0, + 414.0, + 1151.0, + 293.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1352.0, + 1405.0, + 1352.0, + 1405.0, + 1385.0, + 295.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1382.0, + 1405.0, + 1382.0, + 1405.0, + 1415.0, + 295.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1414.0, + 842.0, + 1414.0, + 842.0, + 1448.0, + 295.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1414.0, + 1323.0, + 1414.0, + 1323.0, + 1448.0, + 903.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1414.0, + 1407.0, + 1414.0, + 1407.0, + 1448.0, + 1395.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1439.0, + 1409.0, + 1439.0, + 1409.0, + 1479.0, + 292.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1472.0, + 702.0, + 1472.0, + 702.0, + 1510.0, + 293.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 1472.0, + 1406.0, + 1472.0, + 1406.0, + 1510.0, + 759.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1503.0, + 1407.0, + 1503.0, + 1407.0, + 1539.0, + 293.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1535.0, + 1408.0, + 1535.0, + 1408.0, + 1567.0, + 293.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1562.0, + 1352.0, + 1562.0, + 1352.0, + 1602.0, + 293.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 694.0, + 1408.0, + 694.0, + 1408.0, + 731.0, + 293.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 724.0, + 1405.0, + 724.0, + 1405.0, + 762.0, + 292.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 757.0, + 1405.0, + 757.0, + 1405.0, + 793.0, + 293.0, + 793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 787.0, + 766.0, + 787.0, + 766.0, + 822.0, + 294.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 293.0, + 1406.0, + 293.0, + 1406.0, + 332.0, + 294.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 328.0, + 1404.0, + 328.0, + 1404.0, + 361.0, + 296.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 356.0, + 1406.0, + 356.0, + 1406.0, + 393.0, + 294.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 387.0, + 1406.0, + 387.0, + 1406.0, + 424.0, + 294.0, + 424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 418.0, + 1276.0, + 418.0, + 1276.0, + 454.0, + 293.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1692.0, + 1404.0, + 1692.0, + 1404.0, + 1725.0, + 297.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1721.0, + 1405.0, + 1721.0, + 1405.0, + 1758.0, + 295.0, + 1758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1750.0, + 1405.0, + 1750.0, + 1405.0, + 1789.0, + 292.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1777.0, + 1054.0, + 1777.0, + 1054.0, + 1820.0, + 292.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 1777.0, + 1240.0, + 1777.0, + 1240.0, + 1820.0, + 1098.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 1777.0, + 1407.0, + 1777.0, + 1407.0, + 1820.0, + 1285.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1813.0, + 412.0, + 1813.0, + 412.0, + 1847.0, + 293.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1243.0, + 1405.0, + 1243.0, + 1405.0, + 1277.0, + 295.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1272.0, + 1405.0, + 1272.0, + 1405.0, + 1306.0, + 294.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1304.0, + 499.0, + 1304.0, + 499.0, + 1335.0, + 295.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1861.0, + 1405.0, + 1861.0, + 1405.0, + 1894.0, + 295.0, + 1894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1891.0, + 1406.0, + 1891.0, + 1406.0, + 1925.0, + 295.0, + 1925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1922.0, + 1209.0, + 1922.0, + 1209.0, + 1956.0, + 295.0, + 1956.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 313, + 113, + 1396, + 113, + 1396, + 1842, + 313, + 1842 + ], + "score": 0.956 + }, + { + "category_id": 4, + "poly": [ + 296, + 1910, + 1406, + 1910, + 1406, + 2036, + 296, + 2036 + ], + "score": 0.917 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 857, + 76, + 857, + 105, + 297, + 105 + ], + "score": 0.881 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2113, + 835, + 2113 + ], + "score": 0.856 + }, + { + "category_id": 13, + "poly": [ + 1090, + 1775, + 1151, + 1775, + 1151, + 1802, + 1090, + 1802 + ], + "score": 0.66, + "latex": "= 5 0" + }, + { + "category_id": 13, + "poly": [ + 581, + 2003, + 647, + 2003, + 647, + 2033, + 581, + 2033 + ], + "score": 0.58, + "latex": "= 1 6" + }, + { + "category_id": 13, + "poly": [ + 1342, + 1974, + 1403, + 1974, + 1403, + 2002, + 1342, + 2002 + ], + "score": 0.55, + "latex": " \\textrm { s } = 4" + }, + { + "category_id": 13, + "poly": [ + 1032, + 1975, + 1071, + 1975, + 1071, + 2001, + 1032, + 2001 + ], + "score": 0.45, + "latex": "\\tt { 3 = } 1" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 257.0, + 388.0, + 257.0, + 388.0, + 290.0, + 333.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 259.0, + 747.0, + 259.0, + 747.0, + 288.0, + 699.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 269.0, + 1113.0, + 269.0, + 1113.0, + 301.0, + 1055.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 302.0, + 774.0, + 302.0, + 774.0, + 540.0, + 655.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 311.0, + 1070.0, + 311.0, + 1070.0, + 532.0, + 1034.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 318.0, + 1113.0, + 318.0, + 1113.0, + 353.0, + 1055.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 372.0, + 1113.0, + 372.0, + 1113.0, + 404.0, + 1055.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 398.0, + 386.0, + 398.0, + 386.0, + 433.0, + 335.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 396.0, + 747.0, + 396.0, + 747.0, + 433.0, + 699.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 425.0, + 1111.0, + 425.0, + 1111.0, + 452.0, + 1059.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 473.0, + 384.0, + 473.0, + 384.0, + 501.0, + 337.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 473.0, + 746.0, + 473.0, + 746.0, + 501.0, + 699.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 473.0, + 1115.0, + 473.0, + 1115.0, + 507.0, + 1055.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 505.0, + 948.0, + 505.0, + 948.0, + 532.0, + 901.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 541.0, + 388.0, + 541.0, + 388.0, + 574.0, + 333.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 543.0, + 747.0, + 543.0, + 747.0, + 572.0, + 699.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 520.0, + 1022.0, + 520.0, + 1022.0, + 570.0, + 901.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 526.0, + 1115.0, + 526.0, + 1115.0, + 558.0, + 1057.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 558.0, + 989.0, + 558.0, + 989.0, + 589.0, + 899.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 583.0, + 1107.0, + 583.0, + 1107.0, + 602.0, + 1090.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 593.0, + 409.0, + 593.0, + 409.0, + 617.0, + 384.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 591.0, + 512.0, + 591.0, + 512.0, + 619.0, + 467.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 593.0, + 604.0, + 593.0, + 604.0, + 619.0, + 559.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 593.0, + 800.0, + 593.0, + 800.0, + 617.0, + 777.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 593.0, + 856.0, + 593.0, + 856.0, + 617.0, + 833.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 593.0, + 913.0, + 593.0, + 913.0, + 617.0, + 890.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 593.0, + 969.0, + 593.0, + 969.0, + 617.0, + 946.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 591.0, + 1032.0, + 591.0, + 1032.0, + 619.0, + 995.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 608.0, + 553.0, + 608.0, + 553.0, + 640.0, + 495.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 608.0, + 926.0, + 608.0, + 926.0, + 640.0, + 847.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 722.0, + 957.0, + 722.0, + 957.0, + 756.0, + 749.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 789.0, + 397.0, + 789.0, + 397.0, + 823.0, + 335.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 789.0, + 759.0, + 789.0, + 759.0, + 823.0, + 697.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 808.0, + 1119.0, + 808.0, + 1119.0, + 840.0, + 1053.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 826.0, + 1140.0, + 826.0, + 1140.0, + 988.0, + 1003.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 827.0, + 395.0, + 827.0, + 395.0, + 861.0, + 333.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 827.0, + 757.0, + 827.0, + 757.0, + 861.0, + 695.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 834.0, + 789.0, + 834.0, + 789.0, + 1083.0, + 647.0, + 1083.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 857.0, + 520.0, + 857.0, + 520.0, + 867.0, + 510.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 894.0, + 1115.0, + 894.0, + 1115.0, + 920.0, + 1055.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 905.0, + 395.0, + 905.0, + 395.0, + 937.0, + 333.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 905.0, + 757.0, + 905.0, + 757.0, + 937.0, + 697.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 945.0, + 395.0, + 945.0, + 395.0, + 1012.0, + 335.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 694.0, + 944.0, + 755.0, + 944.0, + 755.0, + 1016.0, + 694.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 987.0, + 995.0, + 987.0, + 995.0, + 1014.0, + 930.0, + 1014.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 927.0, + 1119.0, + 927.0, + 1119.0, + 1071.0, + 1032.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1023.0, + 393.0, + 1023.0, + 393.0, + 1050.0, + 335.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1023.0, + 753.0, + 1023.0, + 753.0, + 1050.0, + 699.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 1006.0, + 1006.0, + 1006.0, + 1006.0, + 1054.0, + 930.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 1016.0, + 1117.0, + 1016.0, + 1117.0, + 1048.0, + 1053.0, + 1048.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1042.0, + 1012.0, + 1042.0, + 1012.0, + 1073.0, + 928.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1059.0, + 395.0, + 1059.0, + 395.0, + 1092.0, + 335.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 1059.0, + 755.0, + 1059.0, + 755.0, + 1092.0, + 695.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1061.0, + 1014.0, + 1061.0, + 1014.0, + 1092.0, + 928.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 1058.0, + 1119.0, + 1058.0, + 1119.0, + 1090.0, + 1053.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1080.0, + 1018.0, + 1080.0, + 1018.0, + 1113.0, + 928.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1098.0, + 397.0, + 1098.0, + 397.0, + 1130.0, + 333.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1101.0, + 755.0, + 1101.0, + 755.0, + 1128.0, + 699.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 1105.0, + 1115.0, + 1105.0, + 1115.0, + 1124.0, + 1098.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1115.0, + 417.0, + 1115.0, + 417.0, + 1139.0, + 393.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1113.0, + 485.0, + 1113.0, + 485.0, + 1141.0, + 450.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 1113.0, + 551.0, + 1113.0, + 551.0, + 1141.0, + 504.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 1113.0, + 611.0, + 1113.0, + 611.0, + 1141.0, + 567.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1113.0, + 670.0, + 1113.0, + 670.0, + 1141.0, + 625.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1117.0, + 829.0, + 1117.0, + 829.0, + 1141.0, + 806.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 864.0, + 1113.0, + 899.0, + 1113.0, + 899.0, + 1141.0, + 864.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 1113.0, + 963.0, + 1113.0, + 963.0, + 1141.0, + 930.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 1113.0, + 1028.0, + 1113.0, + 1028.0, + 1141.0, + 993.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 1130.0, + 928.0, + 1130.0, + 928.0, + 1162.0, + 851.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 1219.0, + 989.0, + 1219.0, + 989.0, + 1250.0, + 726.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1299.0, + 388.0, + 1299.0, + 388.0, + 1334.0, + 333.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 1299.0, + 753.0, + 1299.0, + 753.0, + 1334.0, + 701.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 1319.0, + 1119.0, + 1319.0, + 1119.0, + 1347.0, + 1074.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1347.0, + 388.0, + 1347.0, + 388.0, + 1379.0, + 333.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 1349.0, + 751.0, + 1349.0, + 751.0, + 1378.0, + 703.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1363.0, + 412.0, + 1363.0, + 412.0, + 1599.0, + 291.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1363.0, + 779.0, + 1363.0, + 779.0, + 1600.0, + 658.0, + 1600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 1370.0, + 1090.0, + 1370.0, + 1090.0, + 1597.0, + 1047.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 1381.0, + 1119.0, + 1381.0, + 1119.0, + 1418.0, + 1074.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1439.0, + 389.0, + 1439.0, + 389.0, + 1471.0, + 333.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 1440.0, + 751.0, + 1440.0, + 751.0, + 1469.0, + 703.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 1450.0, + 1117.0, + 1450.0, + 1117.0, + 1480.0, + 1076.0, + 1480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 1488.0, + 386.0, + 1488.0, + 386.0, + 1517.0, + 337.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 1484.0, + 753.0, + 1484.0, + 753.0, + 1520.0, + 701.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 1519.0, + 1117.0, + 1519.0, + 1117.0, + 1549.0, + 1078.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1532.0, + 388.0, + 1532.0, + 388.0, + 1564.0, + 333.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1532.0, + 753.0, + 1532.0, + 753.0, + 1564.0, + 699.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1560.0, + 993.0, + 1560.0, + 993.0, + 1587.0, + 928.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1580.0, + 388.0, + 1580.0, + 388.0, + 1612.0, + 333.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 1578.0, + 751.0, + 1578.0, + 751.0, + 1612.0, + 701.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 1578.0, + 995.0, + 1578.0, + 995.0, + 1623.0, + 924.0, + 1623.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 1587.0, + 1117.0, + 1587.0, + 1117.0, + 1616.0, + 1084.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1625.0, + 388.0, + 1625.0, + 388.0, + 1658.0, + 333.0, + 1658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1625.0, + 753.0, + 1625.0, + 753.0, + 1658.0, + 699.0, + 1658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 1615.0, + 1018.0, + 1615.0, + 1018.0, + 1665.0, + 926.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 1669.0, + 397.0, + 1669.0, + 397.0, + 1692.0, + 374.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 1667.0, + 461.0, + 1667.0, + 461.0, + 1694.0, + 415.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1667.0, + 516.0, + 1667.0, + 516.0, + 1694.0, + 469.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 1667.0, + 568.0, + 1667.0, + 568.0, + 1694.0, + 524.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.0, + 1667.0, + 681.0, + 1667.0, + 681.0, + 1694.0, + 578.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 1669.0, + 825.0, + 1669.0, + 825.0, + 1694.0, + 802.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 864.0, + 1669.0, + 895.0, + 1669.0, + 895.0, + 1692.0, + 864.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 1665.0, + 962.0, + 1665.0, + 962.0, + 1696.0, + 926.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 1665.0, + 1026.0, + 1665.0, + 1026.0, + 1696.0, + 991.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 1660.0, + 1117.0, + 1660.0, + 1117.0, + 1677.0, + 1100.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 1684.0, + 551.0, + 1684.0, + 551.0, + 1717.0, + 489.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1684.0, + 926.0, + 1684.0, + 926.0, + 1717.0, + 847.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 549.0, + 1770.0, + 1089.0, + 1770.0, + 1089.0, + 1806.0, + 549.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1770.0, + 1166.0, + 1770.0, + 1166.0, + 1806.0, + 1152.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.25, + 274.5, + 478.25, + 274.5, + 478.25, + 296.0, + 440.25, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.25, + 606.5, + 1188.25, + 606.5, + 1188.25, + 631.0, + 1117.25, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1290.25, + 623.0, + 1393.25, + 623.0, + 1393.25, + 648.0, + 1290.25, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 635.5, + 1285.0, + 635.5, + 1285.0, + 662.5, + 1148.0, + 662.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 636.0, + 1344.0, + 636.0, + 1344.0, + 664.0, + 1211.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.25, + 1129.0, + 553.25, + 1129.0, + 553.25, + 1163.5, + 500.25, + 1163.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1110.25, + 1139.0, + 1185.25, + 1139.0, + 1185.25, + 1160.0, + 1110.25, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.25, + 1138.0, + 1226.25, + 1138.0, + 1226.25, + 1159.0, + 1149.25, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1182.25, + 1139.5, + 1274.25, + 1139.5, + 1274.25, + 1164.0, + 1182.25, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1142.0, + 1320.0, + 1142.0, + 1320.0, + 1169.0, + 1216.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.25, + 1141.5, + 1358.25, + 1141.5, + 1358.25, + 1168.5, + 1256.25, + 1168.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 1145.0, + 1401.0, + 1145.0, + 1401.0, + 1170.0, + 1296.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 1689.5, + 1195.0, + 1689.5, + 1195.0, + 1715.5, + 1109.0, + 1715.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 1689.5, + 1246.0, + 1689.5, + 1246.0, + 1715.5, + 1160.0, + 1715.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.25, + 1689.0, + 1294.25, + 1689.0, + 1294.25, + 1714.5, + 1208.25, + 1714.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.25, + 1693.0, + 1347.25, + 1693.0, + 1347.25, + 1719.5, + 1251.25, + 1719.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 1698.5, + 1401.0, + 1698.5, + 1401.0, + 1724.5, + 1294.0, + 1724.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1912.0, + 1403.0, + 1912.0, + 1403.0, + 1945.0, + 295.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 1407.0, + 1941.0, + 1407.0, + 1975.0, + 294.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 1031.0, + 1974.0, + 1031.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1974.0, + 1341.0, + 1974.0, + 1341.0, + 2007.0, + 1072.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 1974.0, + 1407.0, + 1974.0, + 1407.0, + 2007.0, + 1404.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 580.0, + 2004.0, + 580.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 2004.0, + 1404.0, + 2004.0, + 1404.0, + 2037.0, + 648.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 72.0, + 859.0, + 72.0, + 859.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": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1727, + 1405, + 1727, + 1405, + 2035, + 297, + 2035 + ], + "score": 0.98 + }, + { + "category_id": 3, + "poly": [ + 314, + 239, + 1399, + 239, + 1399, + 759, + 314, + 759 + ], + "score": 0.95 + }, + { + "category_id": 3, + "poly": [ + 322, + 918, + 1386, + 918, + 1386, + 1550, + 322, + 1550 + ], + "score": 0.949 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 858, + 76, + 858, + 104, + 297, + 104 + ], + "score": 0.881 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2112, + 835, + 2112 + ], + "score": 0.847 + }, + { + "category_id": 4, + "poly": [ + 766, + 1526, + 939, + 1526, + 939, + 1556, + 766, + 1556 + ], + "score": 0.306 + }, + { + "category_id": 4, + "poly": [ + 581, + 726, + 1130, + 726, + 1130, + 758, + 581, + 758 + ], + "score": 0.096 + }, + { + "category_id": 13, + "poly": [ + 1059, + 728, + 1122, + 728, + 1122, + 754, + 1059, + 754 + ], + "score": 0.66, + "latex": "= 1 6" + }, + { + "category_id": 13, + "poly": [ + 786, + 1882, + 853, + 1882, + 853, + 1911, + 786, + 1911 + ], + "score": 0.49, + "latex": "= 1 6" + }, + { + "category_id": 13, + "poly": [ + 1025, + 1760, + 1070, + 1760, + 1070, + 1789, + 1025, + 1789 + ], + "score": 0.44, + "latex": "1 3 \\mathrm { k }" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 254.0, + 385.0, + 254.0, + 385.0, + 283.0, + 334.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 256.0, + 752.0, + 256.0, + 752.0, + 283.0, + 703.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 253.0, + 1119.0, + 253.0, + 1119.0, + 283.0, + 1074.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 300.0, + 386.0, + 300.0, + 386.0, + 331.0, + 336.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 702.0, + 300.0, + 752.0, + 300.0, + 752.0, + 331.0, + 702.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 314.0, + 1117.0, + 314.0, + 1117.0, + 342.0, + 1076.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 324.0, + 1087.0, + 324.0, + 1087.0, + 544.0, + 1052.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 340.0, + 353.0, + 340.0, + 353.0, + 530.0, + 314.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 340.0, + 720.0, + 340.0, + 720.0, + 531.0, + 680.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 348.0, + 752.0, + 348.0, + 752.0, + 378.0, + 701.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 349.0, + 384.0, + 349.0, + 384.0, + 377.0, + 336.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 373.0, + 1117.0, + 373.0, + 1117.0, + 400.0, + 1076.0, + 400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 394.0, + 385.0, + 394.0, + 385.0, + 424.0, + 334.0, + 424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 702.0, + 392.0, + 752.0, + 392.0, + 752.0, + 424.0, + 702.0, + 424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 440.0, + 385.0, + 440.0, + 385.0, + 470.0, + 334.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 440.0, + 752.0, + 440.0, + 752.0, + 471.0, + 703.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 431.0, + 1118.0, + 431.0, + 1118.0, + 458.0, + 1076.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 487.0, + 386.0, + 487.0, + 386.0, + 517.0, + 334.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 484.0, + 753.0, + 484.0, + 753.0, + 518.0, + 703.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 491.0, + 1117.0, + 491.0, + 1117.0, + 518.0, + 1076.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 513.0, + 999.0, + 513.0, + 999.0, + 537.0, + 926.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 532.0, + 385.0, + 532.0, + 385.0, + 563.0, + 334.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 702.0, + 532.0, + 752.0, + 532.0, + 752.0, + 563.0, + 702.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 529.0, + 1006.0, + 529.0, + 1006.0, + 557.0, + 926.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 549.0, + 1008.0, + 549.0, + 1008.0, + 579.0, + 928.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 549.0, + 1118.0, + 549.0, + 1118.0, + 578.0, + 1085.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 568.0, + 1008.0, + 568.0, + 1008.0, + 594.0, + 926.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 579.0, + 386.0, + 579.0, + 386.0, + 610.0, + 336.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 702.0, + 579.0, + 753.0, + 579.0, + 753.0, + 610.0, + 702.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 587.0, + 1016.0, + 587.0, + 1016.0, + 618.0, + 928.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 621.0, + 395.0, + 621.0, + 395.0, + 644.0, + 374.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 620.0, + 460.0, + 620.0, + 460.0, + 647.0, + 415.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 620.0, + 516.0, + 620.0, + 516.0, + 648.0, + 468.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 620.0, + 569.0, + 620.0, + 569.0, + 647.0, + 524.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 619.0, + 680.0, + 619.0, + 680.0, + 647.0, + 576.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 621.0, + 824.0, + 621.0, + 824.0, + 646.0, + 805.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 619.0, + 896.0, + 619.0, + 896.0, + 647.0, + 861.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 618.0, + 960.0, + 618.0, + 960.0, + 648.0, + 927.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 620.0, + 1026.0, + 620.0, + 1026.0, + 649.0, + 991.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 610.0, + 1117.0, + 610.0, + 1117.0, + 632.0, + 1097.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 639.0, + 548.0, + 639.0, + 548.0, + 669.0, + 491.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 639.0, + 923.0, + 639.0, + 923.0, + 668.0, + 846.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 579.0, + 722.0, + 1058.0, + 722.0, + 1058.0, + 759.0, + 579.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 722.0, + 1133.0, + 722.0, + 1133.0, + 759.0, + 1123.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 645.5, + 1196.0, + 645.5, + 1196.0, + 668.5, + 1112.0, + 668.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 648.5, + 1248.0, + 648.5, + 1248.0, + 672.5, + 1155.0, + 672.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1203.0, + 649.0, + 1298.0, + 649.0, + 1298.0, + 674.0, + 1203.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 648.5, + 1348.0, + 648.5, + 1348.0, + 673.5, + 1252.0, + 673.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1301.0, + 655.5, + 1395.0, + 655.5, + 1395.0, + 676.0, + 1301.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 933.0, + 362.0, + 933.0, + 362.0, + 1113.0, + 327.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 944.0, + 387.0, + 944.0, + 387.0, + 963.0, + 373.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 931.0, + 1356.0, + 931.0, + 1356.0, + 975.0, + 1211.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 970.0, + 1300.0, + 970.0, + 1300.0, + 994.0, + 1218.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1016.0, + 365.0, + 1016.0, + 365.0, + 1035.0, + 351.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1073.0, + 364.0, + 1073.0, + 364.0, + 1093.0, + 350.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 1091.0, + 1363.0, + 1091.0, + 1363.0, + 1115.0, + 1307.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 359.0, + 1121.0, + 377.0, + 1121.0, + 377.0, + 1142.0, + 359.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 1117.0, + 593.0, + 1117.0, + 593.0, + 1146.0, + 539.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1117.0, + 791.0, + 1117.0, + 791.0, + 1146.0, + 738.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 1117.0, + 990.0, + 1117.0, + 990.0, + 1146.0, + 936.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1117.0, + 1189.0, + 1117.0, + 1189.0, + 1146.0, + 1135.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1329.0, + 1118.0, + 1391.0, + 1118.0, + 1391.0, + 1146.0, + 1329.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1135.0, + 893.0, + 1135.0, + 893.0, + 1165.0, + 836.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 1169.0, + 866.0, + 1169.0, + 866.0, + 1381.0, + 831.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1186.0, + 356.0, + 1186.0, + 356.0, + 1368.0, + 324.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 1199.0, + 393.0, + 1199.0, + 393.0, + 1215.0, + 384.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1215.0, + 362.0, + 1215.0, + 362.0, + 1230.0, + 352.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 1206.0, + 906.0, + 1206.0, + 906.0, + 1232.0, + 856.0, + 1232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 1223.0, + 397.0, + 1223.0, + 397.0, + 1242.0, + 385.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1270.0, + 367.0, + 1270.0, + 367.0, + 1292.0, + 348.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 1257.0, + 907.0, + 1257.0, + 907.0, + 1286.0, + 855.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1309.0, + 906.0, + 1309.0, + 906.0, + 1335.0, + 865.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1327.0, + 364.0, + 1327.0, + 364.0, + 1347.0, + 350.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 377.0, + 1375.0, + 397.0, + 1375.0, + 397.0, + 1397.0, + 377.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1372.0, + 472.0, + 1372.0, + 472.0, + 1400.0, + 439.0, + 1400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 1372.0, + 546.0, + 1372.0, + 546.0, + 1399.0, + 504.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 571.0, + 1370.0, + 618.0, + 1370.0, + 618.0, + 1400.0, + 571.0, + 1400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 641.0, + 1371.0, + 685.0, + 1371.0, + 685.0, + 1401.0, + 641.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1371.0, + 755.0, + 1371.0, + 755.0, + 1401.0, + 710.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 1372.0, + 821.0, + 1372.0, + 821.0, + 1399.0, + 780.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1365.0, + 904.0, + 1365.0, + 904.0, + 1382.0, + 888.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 1389.0, + 633.0, + 1389.0, + 633.0, + 1422.0, + 558.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 1525.0, + 943.0, + 1525.0, + 943.0, + 1557.0, + 765.0, + 1557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 970.5, + 396.0, + 970.5, + 396.0, + 981.0, + 388.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.25, + 1347.0, + 512.25, + 1347.0, + 512.25, + 1360.5, + 497.25, + 1360.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.75, + 1405.5, + 1279.75, + 1405.5, + 1279.75, + 1426.0, + 1188.75, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.75, + 1426.0, + 1054.75, + 1426.0, + 1054.75, + 1449.0, + 918.75, + 1449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.75, + 1428.5, + 1183.75, + 1428.5, + 1183.75, + 1452.5, + 1040.75, + 1452.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": [ + 831.0, + 2084.0, + 869.0, + 2084.0, + 869.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 1524.0, + 941.0, + 1524.0, + 941.0, + 1559.0, + 765.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 723.0, + 1058.0, + 723.0, + 1058.0, + 761.0, + 580.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 723.0, + 1133.0, + 723.0, + 1133.0, + 761.0, + 1123.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1729.0, + 1403.0, + 1729.0, + 1403.0, + 1761.0, + 295.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1761.0, + 1024.0, + 1761.0, + 1024.0, + 1793.0, + 295.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1761.0, + 1405.0, + 1761.0, + 1405.0, + 1793.0, + 1071.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1787.0, + 1406.0, + 1787.0, + 1406.0, + 1825.0, + 294.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1819.0, + 1407.0, + 1819.0, + 1407.0, + 1856.0, + 294.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1848.0, + 1407.0, + 1848.0, + 1407.0, + 1886.0, + 292.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1880.0, + 785.0, + 1880.0, + 785.0, + 1917.0, + 292.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 1880.0, + 1407.0, + 1880.0, + 1407.0, + 1917.0, + 854.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1912.0, + 1406.0, + 1912.0, + 1406.0, + 1946.0, + 292.0, + 1946.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": [ + 292.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2007.0, + 292.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1999.0, + 399.0, + 1999.0, + 399.0, + 2042.0, + 292.0, + 2042.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 294, + 837, + 1448, + 837, + 1448, + 1353, + 294, + 1353 + ], + "score": 0.983, + "html": "
number of instancesAMPTensorFlow
trainvalidmaktrain inst/svalid inst/strain inst/svalid inst/s
MNIST (97%)60k10k12076609458808037
4626818973
List reduction (97%)100k10k113k39k18k43k
416k55k
1616k56k
(2 replicas)435k100k
(4 replicas) Sentiment (82%)871k178k
8511110111022802651583
4188692
QM9 (4.6)16258822
117k13k130271012173218
410072585
1617974845
Wikiner (94 %)142k1.7k141101
486284
32130426
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1588, + 1405, + 1588, + 1405, + 1836, + 297, + 1836 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1850, + 1404, + 1850, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1482, + 1406, + 1482, + 1406, + 1574, + 299, + 1574 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 308, + 237, + 1392, + 237, + 1392, + 640, + 308, + 640 + ], + "score": 0.967 + }, + { + "category_id": 6, + "poly": [ + 592, + 783, + 1097, + 783, + 1097, + 816, + 592, + 816 + ], + "score": 0.918 + }, + { + "category_id": 4, + "poly": [ + 686, + 681, + 1012, + 681, + 1012, + 715, + 686, + 715 + ], + "score": 0.903 + }, + { + "category_id": 0, + "poly": [ + 301, + 1423, + 773, + 1423, + 773, + 1455, + 301, + 1455 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 857, + 76, + 857, + 104, + 297, + 104 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2112, + 836, + 2112 + ], + "score": 0.855 + }, + { + "category_id": 13, + "poly": [ + 1288, + 1774, + 1351, + 1774, + 1351, + 1802, + 1288, + 1802 + ], + "score": 0.84, + "latex": "82 \\%" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 234.0, + 389.0, + 234.0, + 389.0, + 267.0, + 330.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 237.0, + 750.0, + 237.0, + 750.0, + 267.0, + 691.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 270.0, + 1110.0, + 270.0, + 1110.0, + 297.0, + 1070.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 274.0, + 1078.0, + 274.0, + 1078.0, + 487.0, + 1046.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 280.0, + 388.0, + 280.0, + 388.0, + 309.0, + 330.0, + 309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 280.0, + 749.0, + 280.0, + 749.0, + 309.0, + 691.0, + 309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 287.0, + 341.0, + 287.0, + 341.0, + 475.0, + 307.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 287.0, + 702.0, + 287.0, + 702.0, + 475.0, + 670.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 307.0, + 1110.0, + 307.0, + 1110.0, + 335.0, + 1070.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 324.0, + 389.0, + 324.0, + 389.0, + 353.0, + 330.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 324.0, + 749.0, + 324.0, + 749.0, + 353.0, + 692.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 345.0, + 1111.0, + 345.0, + 1111.0, + 373.0, + 1078.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 367.0, + 389.0, + 367.0, + 389.0, + 396.0, + 328.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 367.0, + 750.0, + 367.0, + 750.0, + 396.0, + 692.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 384.0, + 1111.0, + 384.0, + 1111.0, + 412.0, + 1078.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 409.0, + 389.0, + 409.0, + 389.0, + 439.0, + 328.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 409.0, + 750.0, + 409.0, + 750.0, + 439.0, + 692.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 422.0, + 1007.0, + 422.0, + 1007.0, + 446.0, + 944.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1079.0, + 423.0, + 1109.0, + 423.0, + 1109.0, + 447.0, + 1079.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 942.0, + 439.0, + 1009.0, + 439.0, + 1009.0, + 466.0, + 942.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 453.0, + 389.0, + 453.0, + 389.0, + 482.0, + 330.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 453.0, + 749.0, + 453.0, + 749.0, + 482.0, + 692.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 458.0, + 1015.0, + 458.0, + 1015.0, + 486.0, + 941.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1079.0, + 460.0, + 1109.0, + 460.0, + 1109.0, + 484.0, + 1079.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 475.0, + 1018.0, + 475.0, + 1018.0, + 507.0, + 941.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 498.0, + 388.0, + 498.0, + 388.0, + 523.0, + 331.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 497.0, + 750.0, + 497.0, + 750.0, + 526.0, + 692.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 500.0, + 1109.0, + 500.0, + 1109.0, + 521.0, + 1089.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 509.0, + 463.0, + 509.0, + 463.0, + 538.0, + 408.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 509.0, + 545.0, + 509.0, + 545.0, + 538.0, + 491.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 509.0, + 628.0, + 509.0, + 628.0, + 538.0, + 574.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 517.0, + 769.0, + 517.0, + 769.0, + 532.0, + 754.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 511.0, + 854.0, + 511.0, + 854.0, + 534.0, + 834.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.0, + 509.0, + 939.0, + 509.0, + 939.0, + 535.0, + 914.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 511.0, + 1019.0, + 511.0, + 1019.0, + 534.0, + 999.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 527.0, + 552.0, + 527.0, + 552.0, + 557.0, + 495.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 527.0, + 924.0, + 527.0, + 924.0, + 559.0, + 848.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 602.0, + 956.0, + 602.0, + 956.0, + 637.0, + 754.0, + 637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 533.5, + 1192.0, + 533.5, + 1192.0, + 556.5, + 1115.0, + 556.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.25, + 533.5, + 1251.25, + 533.5, + 1251.25, + 552.5, + 1176.25, + 552.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 535.5, + 1321.0, + 535.5, + 1321.0, + 560.5, + 1231.0, + 560.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 535.0, + 1382.0, + 535.0, + 1382.0, + 559.5, + 1294.0, + 559.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 778.0, + 1100.0, + 778.0, + 1100.0, + 820.0, + 588.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 676.0, + 1015.0, + 676.0, + 1015.0, + 721.0, + 683.0, + 721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1421.0, + 777.0, + 1421.0, + 777.0, + 1459.0, + 293.0, + 1459.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": [ + 832.0, + 2085.0, + 867.0, + 2085.0, + 867.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1590.0, + 1405.0, + 1590.0, + 1405.0, + 1624.0, + 295.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1620.0, + 1406.0, + 1620.0, + 1406.0, + 1654.0, + 295.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1652.0, + 1407.0, + 1652.0, + 1407.0, + 1685.0, + 295.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1681.0, + 1407.0, + 1681.0, + 1407.0, + 1716.0, + 294.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1713.0, + 1406.0, + 1713.0, + 1406.0, + 1747.0, + 295.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1740.0, + 1410.0, + 1740.0, + 1410.0, + 1780.0, + 291.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1774.0, + 1287.0, + 1774.0, + 1287.0, + 1807.0, + 294.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1774.0, + 1406.0, + 1774.0, + 1406.0, + 1807.0, + 1352.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1805.0, + 1178.0, + 1805.0, + 1178.0, + 1836.0, + 295.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": [ + 293.0, + 1879.0, + 1405.0, + 1879.0, + 1405.0, + 1917.0, + 293.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1909.0, + 1406.0, + 1909.0, + 1406.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1942.0, + 1407.0, + 1942.0, + 1407.0, + 1979.0, + 292.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1408.0, + 1971.0, + 1408.0, + 2008.0, + 293.0, + 2008.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": [ + 294.0, + 1481.0, + 1406.0, + 1481.0, + 1406.0, + 1518.0, + 294.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1514.0, + 1409.0, + 1514.0, + 1409.0, + 1547.0, + 294.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1539.0, + 1410.0, + 1539.0, + 1410.0, + 1581.0, + 292.0, + 1581.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1133, + 1404, + 1133, + 1404, + 1317, + 298, + 1317 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 735, + 1404, + 735, + 1404, + 951, + 298, + 951 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1690, + 1405, + 1690, + 1405, + 1938, + 298, + 1938 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 338, + 1404, + 338, + 1404, + 522, + 298, + 522 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1440, + 1404, + 1440, + 1404, + 1565, + 298, + 1565 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 628, + 1403, + 628, + 1403, + 720, + 299, + 720 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 300, + 1333, + 1399, + 1333, + 1399, + 1426, + 300, + 1426 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 1401, + 229, + 1401, + 322, + 297, + 322 + ], + "score": 0.956 + }, + { + "category_id": 2, + "poly": [ + 329, + 1975, + 1063, + 1975, + 1063, + 2034, + 329, + 2034 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 295, + 966, + 1402, + 966, + 1402, + 1028, + 295, + 1028 + ], + "score": 0.946 + }, + { + "category_id": 0, + "poly": [ + 300, + 1073, + 593, + 1073, + 593, + 1105, + 300, + 1105 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 857, + 75, + 857, + 104, + 298, + 104 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 295, + 1617, + 1344, + 1617, + 1344, + 1653, + 295, + 1653 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 836, + 2089, + 864, + 2089, + 864, + 2112, + 836, + 2112 + ], + "score": 0.866 + }, + { + "category_id": 0, + "poly": [ + 300, + 567, + 546, + 567, + 546, + 599, + 300, + 599 + ], + "score": 0.77 + }, + { + "category_id": 0, + "poly": [ + 299, + 567, + 545, + 567, + 545, + 599, + 299, + 599 + ], + "score": 0.434 + }, + { + "category_id": 13, + "poly": [ + 384, + 1784, + 467, + 1784, + 467, + 1814, + 384, + 1814 + ], + "score": 0.91, + "latex": "k \\times d _ { \\mathrm { i n } }" + }, + { + "category_id": 13, + "poly": [ + 940, + 1753, + 1200, + 1753, + 1200, + 1784, + 940, + 1784 + ], + "score": 0.91, + "latex": "2 \\cdot k \\cdot d _ { \\mathrm { i n } } \\cdot d _ { \\mathrm { o u t } } \\cdot 1 0 ^ { - 1 2 }" + }, + { + "category_id": 13, + "poly": [ + 547, + 1813, + 739, + 1813, + 739, + 1845, + 547, + 1845 + ], + "score": 0.91, + "latex": "d _ { \\mathrm { i n } } \\cdot \\dot { d } _ { \\mathrm { o u t } } \\cdot 1 0 ^ { - 1 2 }" + }, + { + "category_id": 13, + "poly": [ + 738, + 1784, + 852, + 1784, + 852, + 1814, + 738, + 1814 + ], + "score": 0.91, + "latex": "d _ { \\mathrm { i n } } \\times d _ { \\mathrm { o u t } }" + }, + { + "category_id": 13, + "poly": [ + 1155, + 968, + 1238, + 968, + 1238, + 996, + 1155, + 996 + ], + "score": 0.85, + "latex": "s = 1 6" + }, + { + "category_id": 13, + "poly": [ + 577, + 1474, + 653, + 1474, + 653, + 1502, + 577, + 1502 + ], + "score": 0.66, + "latex": "s = 3 2" + }, + { + "category_id": 13, + "poly": [ + 1157, + 340, + 1237, + 340, + 1237, + 368, + 1157, + 368 + ], + "score": 0.46, + "latex": "\\qquad = \\quad 1 6" + }, + { + "category_id": 13, + "poly": [ + 887, + 1443, + 919, + 1443, + 919, + 1470, + 887, + 1470 + ], + "score": 0.39, + "latex": "3 \\mathbf { x }" + }, + { + "category_id": 13, + "poly": [ + 1371, + 1445, + 1404, + 1445, + 1404, + 1471, + 1371, + 1471 + ], + "score": 0.29, + "latex": "=" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1968.0, + 978.0, + 1968.0, + 978.0, + 2010.0, + 328.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1999.0, + 1067.0, + 1999.0, + 1067.0, + 2038.0, + 329.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1074.0, + 597.0, + 1074.0, + 597.0, + 1107.0, + 295.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 859.0, + 72.0, + 859.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1616.0, + 1347.0, + 1616.0, + 1347.0, + 1657.0, + 294.0, + 1657.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, + 563.0, + 552.0, + 563.0, + 552.0, + 606.0, + 292.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 563.0, + 552.0, + 563.0, + 552.0, + 606.0, + 292.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1131.0, + 1404.0, + 1131.0, + 1404.0, + 1171.0, + 293.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1164.0, + 1405.0, + 1164.0, + 1405.0, + 1200.0, + 294.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1191.0, + 1406.0, + 1191.0, + 1406.0, + 1233.0, + 292.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1225.0, + 1406.0, + 1225.0, + 1406.0, + 1261.0, + 294.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1254.0, + 1405.0, + 1254.0, + 1405.0, + 1293.0, + 293.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1287.0, + 699.0, + 1287.0, + 699.0, + 1323.0, + 296.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 734.0, + 1406.0, + 734.0, + 1406.0, + 773.0, + 293.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 768.0, + 1406.0, + 768.0, + 1406.0, + 802.0, + 294.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 795.0, + 1406.0, + 795.0, + 1406.0, + 834.0, + 291.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 828.0, + 1405.0, + 828.0, + 1405.0, + 862.0, + 293.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 857.0, + 1404.0, + 857.0, + 1404.0, + 894.0, + 293.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 886.0, + 1408.0, + 886.0, + 1408.0, + 926.0, + 291.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 921.0, + 757.0, + 921.0, + 757.0, + 955.0, + 294.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1692.0, + 1405.0, + 1692.0, + 1405.0, + 1726.0, + 295.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1722.0, + 1405.0, + 1722.0, + 1405.0, + 1758.0, + 292.0, + 1758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1751.0, + 939.0, + 1751.0, + 939.0, + 1790.0, + 289.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 1751.0, + 1408.0, + 1751.0, + 1408.0, + 1790.0, + 1201.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1784.0, + 383.0, + 1784.0, + 383.0, + 1818.0, + 295.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 1784.0, + 737.0, + 1784.0, + 737.0, + 1818.0, + 468.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 1784.0, + 1405.0, + 1784.0, + 1405.0, + 1818.0, + 853.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1808.0, + 546.0, + 1808.0, + 546.0, + 1853.0, + 289.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 1808.0, + 1408.0, + 1808.0, + 1408.0, + 1853.0, + 740.0, + 1853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1844.0, + 1405.0, + 1844.0, + 1405.0, + 1878.0, + 295.0, + 1878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1874.0, + 1406.0, + 1874.0, + 1406.0, + 1909.0, + 293.0, + 1909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1906.0, + 1405.0, + 1906.0, + 1405.0, + 1941.0, + 293.0, + 1941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 337.0, + 1156.0, + 337.0, + 1156.0, + 373.0, + 294.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1238.0, + 337.0, + 1406.0, + 337.0, + 1406.0, + 373.0, + 1238.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 368.0, + 1405.0, + 368.0, + 1405.0, + 402.0, + 292.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 398.0, + 1408.0, + 398.0, + 1408.0, + 435.0, + 293.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 427.0, + 1405.0, + 427.0, + 1405.0, + 465.0, + 293.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 460.0, + 1404.0, + 460.0, + 1404.0, + 496.0, + 293.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 490.0, + 975.0, + 490.0, + 975.0, + 528.0, + 293.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1438.0, + 886.0, + 1438.0, + 886.0, + 1477.0, + 292.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 1438.0, + 1370.0, + 1438.0, + 1370.0, + 1477.0, + 920.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1472.0, + 576.0, + 1472.0, + 576.0, + 1505.0, + 292.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 1472.0, + 1405.0, + 1472.0, + 1405.0, + 1505.0, + 654.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1503.0, + 1407.0, + 1503.0, + 1407.0, + 1536.0, + 292.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1530.0, + 615.0, + 1530.0, + 615.0, + 1571.0, + 294.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 627.0, + 1405.0, + 627.0, + 1405.0, + 664.0, + 294.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 660.0, + 1405.0, + 660.0, + 1405.0, + 693.0, + 295.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 690.0, + 956.0, + 690.0, + 956.0, + 724.0, + 293.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1329.0, + 1404.0, + 1329.0, + 1404.0, + 1369.0, + 294.0, + 1369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1363.0, + 1404.0, + 1363.0, + 1404.0, + 1399.0, + 295.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1394.0, + 629.0, + 1394.0, + 629.0, + 1431.0, + 294.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 228.0, + 1406.0, + 228.0, + 1406.0, + 266.0, + 293.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 256.0, + 1406.0, + 256.0, + 1406.0, + 301.0, + 293.0, + 301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 291.0, + 364.0, + 291.0, + 364.0, + 325.0, + 293.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 965.0, + 1154.0, + 965.0, + 1154.0, + 1001.0, + 295.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 965.0, + 1404.0, + 965.0, + 1404.0, + 1001.0, + 1239.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 996.0, + 1329.0, + 996.0, + 1329.0, + 1031.0, + 294.0, + 1031.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 473, + 1406, + 473, + 1406, + 628, + 297, + 628 + ], + "score": 0.981 + }, + { + "category_id": 5, + "poly": [ + 321, + 806, + 1377, + 806, + 1377, + 1014, + 321, + 1014 + ], + "score": 0.98, + "html": "
AMP1 TFLOPS (estimated)
targetaccuracymaktime (s)epochsinst/stime (s)inst/s
List reduction97%1781013k
(4 replicas) Sentiment8211371k5.15268k
82%11852102
16104325860.6440
QM94.616522776.5179738272455
" + }, + { + "category_id": 6, + "poly": [ + 297, + 681, + 1405, + 681, + 1405, + 803, + 297, + 803 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 366, + 1404, + 366, + 1404, + 459, + 299, + 459 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 479, + 277, + 1217, + 277, + 1217, + 354, + 479, + 354 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 297, + 230, + 681, + 230, + 681, + 261, + 297, + 261 + ], + "score": 0.924 + }, + { + "category_id": 2, + "poly": [ + 297, + 74, + 857, + 74, + 857, + 106, + 297, + 106 + ], + "score": 0.922 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2112, + 835, + 2112 + ], + "score": 0.844 + }, + { + "category_id": 14, + "poly": [ + 477, + 275, + 1218, + 275, + 1218, + 354, + 477, + 354 + ], + "score": 0.91, + "latex": "\\mathrm { \\Delta t \\ i m e = e p o c h s \\cdot \\left( \\frac { { n _ { \\mathrm { t r a i n } } } } { t h r o u g h p u t _ { \\mathrm { t r a i n } } } + \\frac { { n _ { \\mathrm { v a l } } } } { t h r o u g h p u t _ { \\mathrm { v a l } } } \\right) , }" + }, + { + "category_id": 13, + "poly": [ + 296, + 744, + 402, + 744, + 402, + 771, + 296, + 771 + ], + "score": 0.9, + "latex": "\\mathrm { m a k } = 1" + }, + { + "category_id": 13, + "poly": [ + 378, + 535, + 490, + 535, + 490, + 564, + 378, + 564 + ], + "score": 0.89, + "latex": "30 - 7 0 \\%" + }, + { + "category_id": 13, + "poly": [ + 378, + 372, + 447, + 372, + 447, + 398, + 378, + 398 + ], + "score": 0.88, + "latex": "n _ { \\mathrm { t r a i n } }" + }, + { + "category_id": 13, + "poly": [ + 509, + 372, + 559, + 372, + 559, + 397, + 509, + 397 + ], + "score": 0.88, + "latex": "n _ { \\mathrm { v a l } }" + }, + { + "category_id": 13, + "poly": [ + 739, + 401, + 771, + 401, + 771, + 430, + 739, + 430 + ], + "score": 0.83, + "latex": "\\mathrm { v a l }" + }, + { + "category_id": 13, + "poly": [ + 465, + 402, + 515, + 402, + 515, + 430, + 465, + 430 + ], + "score": 0.76, + "latex": "\\operatorname { t r a i n }" + }, + { + "category_id": 13, + "poly": [ + 419, + 505, + 473, + 505, + 473, + 533, + 419, + 533 + ], + "score": 0.74, + "latex": "3 . 7 \\mathbf { x }" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 681.0, + 1405.0, + 681.0, + 1405.0, + 717.0, + 292.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 712.0, + 1408.0, + 712.0, + 1408.0, + 747.0, + 292.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 743.0, + 295.0, + 743.0, + 295.0, + 779.0, + 292.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 403.0, + 743.0, + 1406.0, + 743.0, + 1406.0, + 779.0, + 403.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 774.0, + 1012.0, + 774.0, + 1012.0, + 806.0, + 294.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 859.0, + 72.0, + 859.0, + 109.0, + 297.0, + 109.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": [ + 296.0, + 475.0, + 1406.0, + 475.0, + 1406.0, + 508.0, + 296.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 503.0, + 418.0, + 503.0, + 418.0, + 540.0, + 295.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 474.0, + 503.0, + 1406.0, + 503.0, + 1406.0, + 540.0, + 474.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 533.0, + 377.0, + 533.0, + 377.0, + 570.0, + 294.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 533.0, + 1404.0, + 533.0, + 1404.0, + 570.0, + 491.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 562.0, + 1404.0, + 562.0, + 1404.0, + 602.0, + 292.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 596.0, + 1393.0, + 596.0, + 1393.0, + 629.0, + 295.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 363.0, + 377.0, + 363.0, + 377.0, + 404.0, + 293.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 363.0, + 508.0, + 363.0, + 508.0, + 404.0, + 448.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 363.0, + 1408.0, + 363.0, + 1408.0, + 404.0, + 560.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 394.0, + 464.0, + 394.0, + 464.0, + 435.0, + 293.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 394.0, + 738.0, + 394.0, + 738.0, + 435.0, + 516.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 394.0, + 1410.0, + 394.0, + 1410.0, + 435.0, + 772.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 420.0, + 377.0, + 420.0, + 377.0, + 468.0, + 292.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 230.0, + 682.0, + 230.0, + 682.0, + 264.0, + 294.0, + 264.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/Hk1iOLcle/Hk1iOLcle_layout.pdf b/parse/train/Hk1iOLcle/Hk1iOLcle_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d10fde8991d308e7223231a2c9843cd84407d6d4 --- /dev/null +++ b/parse/train/Hk1iOLcle/Hk1iOLcle_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1819473954183bb2742b7f69b4744e4215ce310031e7f3fe135ea74ff202c3a4 +size 434050 diff --git a/parse/train/Hk1iOLcle/Hk1iOLcle_origin.pdf b/parse/train/Hk1iOLcle/Hk1iOLcle_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b96b3109ce9867b32a1144ebe9286142a29be6b9 --- /dev/null +++ b/parse/train/Hk1iOLcle/Hk1iOLcle_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:aab57a9ad912568eb39954558684193f572fe55bc43547fa65e6a73033299345 +size 350192 diff --git a/parse/train/Hk1iOLcle/Hk1iOLcle_span.pdf b/parse/train/Hk1iOLcle/Hk1iOLcle_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9e9029edfe130b9856958e9f6d15ed5ba23f08d3 --- /dev/null +++ b/parse/train/Hk1iOLcle/Hk1iOLcle_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:03e1cac8cc9b6998219fe7624d7a8a6bfeb560cafa4d6421fb89f7e23ebe79bb +size 432874 diff --git a/parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_layout.pdf b/parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..14e5652985f3b6b9a4a0229f961223d35a0a9430 --- /dev/null +++ b/parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:81037b0022bb56c63212d4233a71b61f81998b84ff5a50b41ef792c6fd4201db +size 689632 diff --git a/parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_origin.pdf b/parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..afe12d3026530d4445c7b3eb975e88543b16fb38 --- /dev/null +++ b/parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fa838d81d330c96c416ee1128ab00fa083af6777d24772d09758991fef196bbb +size 562211 diff --git a/parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_span.pdf b/parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..38fe19f78eb692b67a86aee42cc8ded5f144eb95 --- /dev/null +++ b/parse/train/HkUfnZFt1Rw/HkUfnZFt1Rw_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f6f78a0be3932b42096b50f9278c958d7364f4422bdc9f556b4fb1a07cf200a2 +size 690041 diff --git a/parse/train/HklSf3CqKm/HklSf3CqKm_layout.pdf b/parse/train/HklSf3CqKm/HklSf3CqKm_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..711f7763c62cd779333bceeff115b156268d4359 --- /dev/null +++ b/parse/train/HklSf3CqKm/HklSf3CqKm_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:afff36f4068b91ecafa289abcccfb19eb2f9a841d2ee50b25f3f538e9548cc10 +size 2410332 diff --git a/parse/train/HklSf3CqKm/HklSf3CqKm_origin.pdf b/parse/train/HklSf3CqKm/HklSf3CqKm_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..bdb1aaf685da4bea4ed53424dde6cd1861bbf95e --- /dev/null +++ b/parse/train/HklSf3CqKm/HklSf3CqKm_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:511075af916adeb7847eaa1849b7d08d798d2787797be08ef661fc05aa633879 +size 1601829 diff --git a/parse/train/HklSf3CqKm/HklSf3CqKm_span.pdf b/parse/train/HklSf3CqKm/HklSf3CqKm_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..11fb2e279b38d7cc1bbdc80a50c1ea6c8d04377f --- /dev/null +++ b/parse/train/HklSf3CqKm/HklSf3CqKm_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4ee8461ad2320ca7a81bafcb33cb816847565fdb0353c51158bbc9c56a3751b6 +size 2408173 diff --git a/parse/train/HyEeMu_xx/HyEeMu_xx_layout.pdf b/parse/train/HyEeMu_xx/HyEeMu_xx_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a5b844457f00d0e158405e08c4db9add05635cb9 --- /dev/null +++ b/parse/train/HyEeMu_xx/HyEeMu_xx_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e11f6be0f35ba9b43f97637437f9393a5147aa5abfd73020d789f7ac4887a5ba +size 3768669 diff --git a/parse/train/HyEeMu_xx/HyEeMu_xx_origin.pdf b/parse/train/HyEeMu_xx/HyEeMu_xx_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f40cbb5d2109b43e13b1b4feb3042f958307afdb --- /dev/null +++ b/parse/train/HyEeMu_xx/HyEeMu_xx_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2d106ef2f687dd32b7b0d49a5ee37a61a6ac809fd1c09944ff06a6f8be285c74 +size 3642136 diff --git a/parse/train/HyEeMu_xx/HyEeMu_xx_span.pdf b/parse/train/HyEeMu_xx/HyEeMu_xx_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a2f83595415dfc9f3971524d272a16380458de35 --- /dev/null +++ b/parse/train/HyEeMu_xx/HyEeMu_xx_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:949a26061dfab6dca84cd2dfdbece8e3ef2ac08653aed270d4899cff07c9eddc +size 3769914 diff --git a/parse/train/HyGBdo0qFm/HyGBdo0qFm_layout.pdf b/parse/train/HyGBdo0qFm/HyGBdo0qFm_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5217fd04a74edefbfe9885f7187d2ba3f5d9f31d --- /dev/null +++ b/parse/train/HyGBdo0qFm/HyGBdo0qFm_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f9adf2b2d5e5b2c06f1f9b268d7eece5d81da11b1ba52caf95f3b47ba4be6928 +size 1263006 diff --git a/parse/train/HyGBdo0qFm/HyGBdo0qFm_origin.pdf b/parse/train/HyGBdo0qFm/HyGBdo0qFm_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..dd47e22059748cf790911b2e021666992089d3b3 --- /dev/null +++ b/parse/train/HyGBdo0qFm/HyGBdo0qFm_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f2edf32e1d9407c78fced130174bb4a09303ec0bad4e5b374c7a887ed039fdd8 +size 502655 diff --git a/parse/train/HyGBdo0qFm/HyGBdo0qFm_span.pdf b/parse/train/HyGBdo0qFm/HyGBdo0qFm_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f6e6942e6d32c007580d541336215d93786608fb --- /dev/null +++ b/parse/train/HyGBdo0qFm/HyGBdo0qFm_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4d15923b849e868f2f30222f8e296752ee2b4b8e851290ac421ca16ded9347f1 +size 1309754 diff --git a/parse/train/Hyg_X2C5FX/Hyg_X2C5FX_layout.pdf b/parse/train/Hyg_X2C5FX/Hyg_X2C5FX_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..40ce626cbb8700a6f1dc7d6b7e0774701a75f874 --- /dev/null +++ b/parse/train/Hyg_X2C5FX/Hyg_X2C5FX_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f28e47568c3b1d2f816379d635060e34397d8719cb110a203de9cb0f0beded65 +size 7603474 diff --git a/parse/train/Hyg_X2C5FX/Hyg_X2C5FX_origin.pdf b/parse/train/Hyg_X2C5FX/Hyg_X2C5FX_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..eecf24e301a2944fa8e3155aec3f4ecef63b49b7 --- /dev/null +++ b/parse/train/Hyg_X2C5FX/Hyg_X2C5FX_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:043c6fa72771d9d6d560fa4e23446fecefe2a4237b284541c6d4a2696a3f725f +size 7431669 diff --git a/parse/train/Hyg_X2C5FX/Hyg_X2C5FX_span.pdf b/parse/train/Hyg_X2C5FX/Hyg_X2C5FX_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..875b28ded0fafb9a9b6a9af845ac762caafa3a91 --- /dev/null +++ b/parse/train/Hyg_X2C5FX/Hyg_X2C5FX_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:60fb306d9da8db926628b01e620a6dad95aee2ad7629c16044d4b3c0b656fe1c +size 7607186 diff --git a/parse/train/HygnDhEtvr/HygnDhEtvr_layout.pdf b/parse/train/HygnDhEtvr/HygnDhEtvr_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..0cbf72829433bc3800962f2470da626fe3f7ff03 --- /dev/null +++ b/parse/train/HygnDhEtvr/HygnDhEtvr_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b8ea7b82ba6b02d9f6c824cd2fc2eda48426248591eebb53d3534632336b7c80 +size 1637212 diff --git a/parse/train/HygnDhEtvr/HygnDhEtvr_origin.pdf b/parse/train/HygnDhEtvr/HygnDhEtvr_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..964793a4b8b3398d15e655e5ab8e7fe588d7b550 --- /dev/null +++ b/parse/train/HygnDhEtvr/HygnDhEtvr_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6faa9b54b7bcb228091e1a2d21a1ed3b8ab6ed5a27c3df2913bb5ab23103cfd7 +size 1465439 diff --git a/parse/train/HygnDhEtvr/HygnDhEtvr_span.pdf b/parse/train/HygnDhEtvr/HygnDhEtvr_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..bc4414ed8c5d58842d0fa66c2918719d40581fdf --- /dev/null +++ b/parse/train/HygnDhEtvr/HygnDhEtvr_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0bc058a4f7949e8c2ab651835e0a323bf0d53de288bae45e6e6d4a53c8eeab45 +size 1636681 diff --git a/parse/train/HygrdpVKvr/HygrdpVKvr_layout.pdf b/parse/train/HygrdpVKvr/HygrdpVKvr_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7e3c8e06a81e08f4b00aca3edc86918cf1596a00 --- /dev/null +++ b/parse/train/HygrdpVKvr/HygrdpVKvr_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:245b333814765f6520a491d53bb4c8736ebe622dd36651dc561ff4e51fdf7792 +size 1206972 diff --git a/parse/train/HygrdpVKvr/HygrdpVKvr_origin.pdf b/parse/train/HygrdpVKvr/HygrdpVKvr_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c0156f9651db7caa21cb94fe4a0f29319128cb2f --- /dev/null +++ b/parse/train/HygrdpVKvr/HygrdpVKvr_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:73d3003223706d153867198fb01f919bb6d8b26d14b59fdfa546e9bba5a5758a +size 1083295 diff --git a/parse/train/HygrdpVKvr/HygrdpVKvr_span.pdf b/parse/train/HygrdpVKvr/HygrdpVKvr_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..63136900a653e5c054a63ac16c4801bcb9683fa1 --- /dev/null +++ b/parse/train/HygrdpVKvr/HygrdpVKvr_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a80c64e3ebb0f908bf3096f407df2afd40b933d1d6c84612751f9b604dc011c6 +size 1206627 diff --git a/parse/train/HyjC5yWCW/HyjC5yWCW_layout.pdf b/parse/train/HyjC5yWCW/HyjC5yWCW_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b5a87b1f49342bf5a265da396584c7809a4ee926 --- /dev/null +++ b/parse/train/HyjC5yWCW/HyjC5yWCW_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:60728d6954a5b89b20459c6e0ced00fbf938bf48e278ae6f0df9b93fa1fe32c9 +size 1168445 diff --git a/parse/train/HyjC5yWCW/HyjC5yWCW_origin.pdf b/parse/train/HyjC5yWCW/HyjC5yWCW_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..dd9ae3503190d6bbc9551fe313c768b172c3cd9b --- /dev/null +++ b/parse/train/HyjC5yWCW/HyjC5yWCW_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8c01ded55e375f74dc54d24395c2bb4f2ddce1a5f4114214c60e43d9298dde67 +size 851114 diff --git a/parse/train/HyjC5yWCW/HyjC5yWCW_span.pdf b/parse/train/HyjC5yWCW/HyjC5yWCW_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..350f337b882d496133bb3d6237582c30304354e9 --- /dev/null +++ b/parse/train/HyjC5yWCW/HyjC5yWCW_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2e685f360d57114dd2e16580220f66e616d920c618afcbbf8e990d06b3e9b587 +size 1194028 diff --git a/parse/train/HylsgnCcFQ/HylsgnCcFQ_layout.pdf b/parse/train/HylsgnCcFQ/HylsgnCcFQ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a68c1d767b07b9c6519cdc4e888870525bd9b3d7 --- /dev/null +++ b/parse/train/HylsgnCcFQ/HylsgnCcFQ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:96d2df27e436760159648ee53c787e19a411d009895339e866e773563172688b +size 639220 diff --git a/parse/train/HylsgnCcFQ/HylsgnCcFQ_origin.pdf b/parse/train/HylsgnCcFQ/HylsgnCcFQ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ae0dd39e354ca07aacd813688b1f428fdfaf2ac5 --- /dev/null +++ b/parse/train/HylsgnCcFQ/HylsgnCcFQ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7b0ec96707f89e1946e9359eb819ef56abc643ace0508239f3e4ca2fbb28c9ae +size 445046 diff --git a/parse/train/HylsgnCcFQ/HylsgnCcFQ_span.pdf b/parse/train/HylsgnCcFQ/HylsgnCcFQ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..500595c6c6222637a1ce2a71477b4b98f7d00895 --- /dev/null +++ b/parse/train/HylsgnCcFQ/HylsgnCcFQ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b1aad6b25a519ff1b3adb1c55132991822eff35e58063485ebd740afe99eead3 +size 645861 diff --git a/parse/train/Iz3zU3M316D/Iz3zU3M316D_layout.pdf b/parse/train/Iz3zU3M316D/Iz3zU3M316D_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d12ddae4e57c19203c7022bb29e35ea3d8f58707 --- /dev/null +++ b/parse/train/Iz3zU3M316D/Iz3zU3M316D_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:625945cf2f0766a4f6c2489a14ba1d007de8673686a0e0cc05180b63afd8e588 +size 3054804 diff --git a/parse/train/Iz3zU3M316D/Iz3zU3M316D_origin.pdf b/parse/train/Iz3zU3M316D/Iz3zU3M316D_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..168af94e6f1b2fd0baa63bcce2be279bebee5603 --- /dev/null +++ b/parse/train/Iz3zU3M316D/Iz3zU3M316D_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:35b31c56efa72a47728a47cdff905e8f6c3997adf80eea9e62c04c4ebecd3fa7 +size 2690139 diff --git a/parse/train/Iz3zU3M316D/Iz3zU3M316D_span.pdf b/parse/train/Iz3zU3M316D/Iz3zU3M316D_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9628bcdcc19a309ca8b6bd37d116096fbaa58ded --- /dev/null +++ b/parse/train/Iz3zU3M316D/Iz3zU3M316D_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7f326fef3e0c543c54e71587b44eefc6895521fbb81781c2cbfb018cab380c62 +size 3061014 diff --git a/parse/train/JCodE7xOcc5/JCodE7xOcc5_layout.pdf b/parse/train/JCodE7xOcc5/JCodE7xOcc5_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d9feaf038abf18f2df9a3fde63a9e883a4a0d422 --- /dev/null +++ b/parse/train/JCodE7xOcc5/JCodE7xOcc5_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:233b46cedd5a59aa55bef21f4087ed35c6344562ba07b54e4698bada10ed6781 +size 1112676 diff --git a/parse/train/JCodE7xOcc5/JCodE7xOcc5_origin.pdf b/parse/train/JCodE7xOcc5/JCodE7xOcc5_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..aa570bb5a6bb04e922cfdbc612a43e29c70b6bc0 --- /dev/null +++ b/parse/train/JCodE7xOcc5/JCodE7xOcc5_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:dcd55fdfb798393b552ed9ef8f4d6f3cbe8ef7791157b47bdfedcd6104774b3c +size 949881 diff --git a/parse/train/JCodE7xOcc5/JCodE7xOcc5_span.pdf b/parse/train/JCodE7xOcc5/JCodE7xOcc5_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d4b1e3a1b53482630fd8fb76b473d98e9430224b --- /dev/null +++ b/parse/train/JCodE7xOcc5/JCodE7xOcc5_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ea056a2a58ff54db5851c70867866be09dccd9ad52661469bef26fedba189231 +size 1125012 diff --git a/parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_layout.pdf b/parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..91878f58bf7a00a5280d69761b89d65e9c51c262 --- /dev/null +++ b/parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7607c742d5607c1c2bdfe2f8944161e5ed515b20d0e83b5f212267d2ad3698d9 +size 1611204 diff --git a/parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_origin.pdf b/parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ee9e1bda115820290453a7b41453d81b996401c2 --- /dev/null +++ b/parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:808805c736c2e651dec624f02ac30b5c199b8e8da041c04d2876a6139c41c025 +size 1284450 diff --git a/parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_span.pdf b/parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f4cefcda66637e1257a0002f4fcca48129eea3fd --- /dev/null +++ b/parse/train/J_pvI6ap5Mn/J_pvI6ap5Mn_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:cae5605b6e9c1911dd7ba9e7fdf59b6787e094bb9138558f9a1b50b0c2e57128 +size 1631286 diff --git a/parse/train/KLH36ELmwIB/KLH36ELmwIB_layout.pdf b/parse/train/KLH36ELmwIB/KLH36ELmwIB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d0c977ba8cfe31c607507e1d95ac2c008bbdd34b --- /dev/null +++ b/parse/train/KLH36ELmwIB/KLH36ELmwIB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ca64c7e13f345f9887768969339a6822b30db35dca987f5d085b92ac8baf7ac2 +size 3096895 diff --git a/parse/train/KLH36ELmwIB/KLH36ELmwIB_origin.pdf b/parse/train/KLH36ELmwIB/KLH36ELmwIB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..92e00c36486b3f4ddc88c9487e457d8e2858719b --- /dev/null +++ b/parse/train/KLH36ELmwIB/KLH36ELmwIB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3bf48d0dcf5d328b083566dc9c8ea6b1d77f033643b1a96c73f19d0dbd2713db +size 2895123 diff --git a/parse/train/KLH36ELmwIB/KLH36ELmwIB_span.pdf b/parse/train/KLH36ELmwIB/KLH36ELmwIB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6707574386c1aa222ca4c2ccc4aa85dc1d635a4e --- /dev/null +++ b/parse/train/KLH36ELmwIB/KLH36ELmwIB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:64a684f028f1b301dba335035a168355e043371701505660a759f49429953a91 +size 3098202 diff --git a/parse/train/MudT1U2eIY/MudT1U2eIY_layout.pdf b/parse/train/MudT1U2eIY/MudT1U2eIY_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4ebb61867d7f251f2455b90fbe7dafd73b2e9657 --- /dev/null +++ b/parse/train/MudT1U2eIY/MudT1U2eIY_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fe6ca2314c87070d7e5971128e64b36c986a564a2c3fa368331c99dda5ac3cd0 +size 4288100 diff --git a/parse/train/MudT1U2eIY/MudT1U2eIY_origin.pdf b/parse/train/MudT1U2eIY/MudT1U2eIY_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b1731277528cd3fad69e3b6472fc2c3dabf2c64a --- /dev/null +++ b/parse/train/MudT1U2eIY/MudT1U2eIY_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:089d1d7ee54718a6dc98e1ec4279dff658b9a1845d4f860d207f9557fe69afe8 +size 4148991 diff --git a/parse/train/MudT1U2eIY/MudT1U2eIY_span.pdf b/parse/train/MudT1U2eIY/MudT1U2eIY_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..773dfe5a0ba77e61771dd21abf7d0bf7ad709090 --- /dev/null +++ b/parse/train/MudT1U2eIY/MudT1U2eIY_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1548b2a84e88d7fdbece26a660266af2df8e9a90aa320a85f5b2e52f7978b6fe +size 4296934 diff --git a/parse/train/OPyWRrcjVQw/OPyWRrcjVQw_layout.pdf b/parse/train/OPyWRrcjVQw/OPyWRrcjVQw_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..aebe549a1169cb3e20268734bf25f09548ce9ceb --- /dev/null +++ b/parse/train/OPyWRrcjVQw/OPyWRrcjVQw_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:46f60abe913eee32f8a99e195170564c24bd559a94351b85b6c214e65e76016c +size 1836321 diff --git a/parse/train/OPyWRrcjVQw/OPyWRrcjVQw_origin.pdf b/parse/train/OPyWRrcjVQw/OPyWRrcjVQw_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..bad435158f66e5baff2259332eda386e3b9e633b --- /dev/null +++ b/parse/train/OPyWRrcjVQw/OPyWRrcjVQw_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3ee7e59ea8e21e008df62f02868de9f50c9baf2b1b9dd925c8ce9ec65f93941f +size 1674720 diff --git a/parse/train/OPyWRrcjVQw/OPyWRrcjVQw_span.pdf b/parse/train/OPyWRrcjVQw/OPyWRrcjVQw_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..81911b26606742114641d2cc101df769f81b98b8 --- /dev/null +++ b/parse/train/OPyWRrcjVQw/OPyWRrcjVQw_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:29cad414e039e3f994798633ed8d34edc1efe06f697c92129275f8368a50b6c1 +size 1839973 diff --git a/parse/train/P9TYG0j-wtG/P9TYG0j-wtG_layout.pdf b/parse/train/P9TYG0j-wtG/P9TYG0j-wtG_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..eca148dd174910090d3530195a581be9e4b82992 --- /dev/null +++ b/parse/train/P9TYG0j-wtG/P9TYG0j-wtG_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:059c4db66cef56cfada1f0406a397975e5efee8c9db5be02f54874392e9bdbc7 +size 2490156 diff --git a/parse/train/P9TYG0j-wtG/P9TYG0j-wtG_origin.pdf b/parse/train/P9TYG0j-wtG/P9TYG0j-wtG_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f6b875e92ff046d215216707bb603d8c4a8eea43 --- /dev/null +++ b/parse/train/P9TYG0j-wtG/P9TYG0j-wtG_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a29471d5ba4b5ac58e3d747ff4ff4feaf06833f7ef55cb6fc00f2c36ac327328 +size 2197268 diff --git a/parse/train/P9TYG0j-wtG/P9TYG0j-wtG_span.pdf b/parse/train/P9TYG0j-wtG/P9TYG0j-wtG_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e76c55c3f7023bd65c13d7c10b74839bfba3ad54 --- /dev/null +++ b/parse/train/P9TYG0j-wtG/P9TYG0j-wtG_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6e2e196a5d50e715e8dee237e02a1ff0a4a9b15d2bb0bca7699c9fb4a8748672 +size 2505825 diff --git a/parse/train/QIRlze3I6hX/QIRlze3I6hX_layout.pdf b/parse/train/QIRlze3I6hX/QIRlze3I6hX_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2b4c916872e97c65949ae1b7425cc756ab7332a1 --- /dev/null +++ b/parse/train/QIRlze3I6hX/QIRlze3I6hX_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b6aeac3558710d7baaf9f6cdcd3103702235c8678d1141db0213fd52ae98c4b0 +size 2287076 diff --git a/parse/train/QIRlze3I6hX/QIRlze3I6hX_origin.pdf b/parse/train/QIRlze3I6hX/QIRlze3I6hX_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..59df425bf3567cc0222a35b3d136f8867f313525 --- /dev/null +++ b/parse/train/QIRlze3I6hX/QIRlze3I6hX_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9a739cf2325cdaa0b2b9651e2ae39611f1c62459978ca920255709af79e12e47 +size 2094180 diff --git a/parse/train/QIRlze3I6hX/QIRlze3I6hX_span.pdf b/parse/train/QIRlze3I6hX/QIRlze3I6hX_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9a521cd2c1e13f043747a977ec3576d85bb887e5 --- /dev/null +++ b/parse/train/QIRlze3I6hX/QIRlze3I6hX_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4dea83ff52077940f107cf7fd8350166961160beda775e3af36d9c41f407d54f +size 2301833 diff --git a/parse/train/QmxFsofRvW9/QmxFsofRvW9_layout.pdf b/parse/train/QmxFsofRvW9/QmxFsofRvW9_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8c1ae017eb4f9fb035db681689c059eecbbbd11a --- /dev/null +++ b/parse/train/QmxFsofRvW9/QmxFsofRvW9_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f7fba7aa62ae72b3f0aa0bafe77fbc54d8a897b2e5d91d7d4cba6a5fd14b8107 +size 912507 diff --git a/parse/train/QmxFsofRvW9/QmxFsofRvW9_origin.pdf b/parse/train/QmxFsofRvW9/QmxFsofRvW9_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..78a7220760bcbf9710a770eac709314e43c21558 --- /dev/null +++ b/parse/train/QmxFsofRvW9/QmxFsofRvW9_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a20ce3126153d052e20d99c1bab9bc4718b6d87405bd6ef4e4fa5032a86d6d5d +size 746514 diff --git a/parse/train/QmxFsofRvW9/QmxFsofRvW9_span.pdf b/parse/train/QmxFsofRvW9/QmxFsofRvW9_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..1306f976e98e7f45bca79b6128547a10492de114 --- /dev/null +++ b/parse/train/QmxFsofRvW9/QmxFsofRvW9_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8cd8a94f055d8f60dc21694ff1bf53e294e1f59f163642edc111fcdc78a1e026 +size 921931 diff --git a/parse/train/S1eik6EtPB/S1eik6EtPB_layout.pdf b/parse/train/S1eik6EtPB/S1eik6EtPB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..862985aac2b047d6cadced86465cbd03b5a76b37 --- /dev/null +++ b/parse/train/S1eik6EtPB/S1eik6EtPB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:545baf511480557cbb6baa6ae2d4d762a3d0c1a7c5953c5f4879fd57767198b8 +size 1802068 diff --git a/parse/train/S1eik6EtPB/S1eik6EtPB_origin.pdf b/parse/train/S1eik6EtPB/S1eik6EtPB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3e53dc77cc0b503135877803879b6dc061620ed5 --- /dev/null +++ b/parse/train/S1eik6EtPB/S1eik6EtPB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0f18ad69b20b72f99b26487c32ab4fc84d81e94b3601d3611509a610098d1861 +size 1302723 diff --git a/parse/train/S1eik6EtPB/S1eik6EtPB_span.pdf b/parse/train/S1eik6EtPB/S1eik6EtPB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..de06bcd5525bdf54621ac28fbac44598215ff8f8 --- /dev/null +++ b/parse/train/S1eik6EtPB/S1eik6EtPB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0442cab747c50a9ecbddcea67b1b94a7ef271c5ba09868895ec85822c6860602 +size 1820042 diff --git a/parse/train/SJJinbWRZ/SJJinbWRZ_layout.pdf b/parse/train/SJJinbWRZ/SJJinbWRZ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c9a7f93b6c7c6d7940b88e20caf0068291269220 --- /dev/null +++ b/parse/train/SJJinbWRZ/SJJinbWRZ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f15bc03ca8eceef4cb496b26a607f3b377e205da8773d0b6f8bb94d760fcb9dd +size 14430149 diff --git a/parse/train/SJJinbWRZ/SJJinbWRZ_origin.pdf b/parse/train/SJJinbWRZ/SJJinbWRZ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4af7861d6e3ed989bc72ffe1f76a5a5b86b38b2e --- /dev/null +++ b/parse/train/SJJinbWRZ/SJJinbWRZ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5e71a700b96c7ba5be0609bf000a241db46f0b12894c7325562870b8ea7f2c39 +size 14295446 diff --git a/parse/train/SJJinbWRZ/SJJinbWRZ_span.pdf b/parse/train/SJJinbWRZ/SJJinbWRZ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..09a8888abd348860af596fc75e8648a7467d2f1c --- /dev/null +++ b/parse/train/SJJinbWRZ/SJJinbWRZ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9103efa8699ac9c3f0d90d45c13d98be54e29cf6fa89f385b97f19f894f76cb6 +size 14430783 diff --git a/parse/train/SJeXSo09FQ/SJeXSo09FQ_layout.pdf b/parse/train/SJeXSo09FQ/SJeXSo09FQ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..0e553fe1fc9297dd84161285e9d61c9a790dede4 --- /dev/null +++ b/parse/train/SJeXSo09FQ/SJeXSo09FQ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:67aa960a7ef6331feec2d3907b77a278ee486458dc68a1919982a53621f281ef +size 33728440 diff --git a/parse/train/SJeXSo09FQ/SJeXSo09FQ_origin.pdf b/parse/train/SJeXSo09FQ/SJeXSo09FQ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..75c3fe7b66ca52b4a7921b8aa591ed74715b0362 --- /dev/null +++ b/parse/train/SJeXSo09FQ/SJeXSo09FQ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c2af7cab40f1ec45fb339c3c5e725e718b20e225ec318707098b957fe8d0da12 +size 9116974 diff --git a/parse/train/SJeXSo09FQ/SJeXSo09FQ_span.pdf b/parse/train/SJeXSo09FQ/SJeXSo09FQ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..91f0a6bd294a2a238758cd510c766ac0711efdf4 --- /dev/null +++ b/parse/train/SJeXSo09FQ/SJeXSo09FQ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e5f4e89382d4c4a452a74bb5fff6646ad96d5c56952e954bc93557a6f7f92c69 +size 33730877 diff --git a/parse/train/SJlKrkSFPH/SJlKrkSFPH.md b/parse/train/SJlKrkSFPH/SJlKrkSFPH.md new file mode 100644 index 0000000000000000000000000000000000000000..0af81b6ec8bb602a5dc1091ca45ff374c5753c3e --- /dev/null +++ b/parse/train/SJlKrkSFPH/SJlKrkSFPH.md @@ -0,0 +1,1038 @@ +# A FRAMEWORK FOR ROBUSTNESS CERTIFICATION OF SMOOTHED CLASSIFIERS USING F-DIVERGENCES + +Krishnamurthy (Dj) Dvijotham† Jamie Hayes†‡∗ Borja Balle† J. Zico Kolterac +Chongli Qin† Andras Gy ´ orgy ¨ † Kai Xiaob†∗ Sven Gowal† Pushmeet Kohli† +†DeepMind, London, UK ‡University College London, UK +a Carnegie Mellon University, USA b Massachusetts Institute of Technology, USA +c Bosch Center for AI, USA +{dvij, bballe, chongliqin, agyorgy, sgowal, pushmeet}@google.com +{zkolter}@cs.cmu.edu {j.hayes}@ucl.ac.uk {kaix}@mit.edu + +# ABSTRACT + +Formal verification techniques that compute provable guarantees on properties of machine learning models, like robustness to norm-bounded adversarial perturbations, have yielded impressive results. Although most techniques developed so far require knowledge of the architecture of the machine learning model and remain hard to scale to complex prediction pipelines, the method of randomized smoothing has been shown to overcome many of these obstacles. By requiring only black-box access to the underlying model, randomized smoothing scales to large architectures and is agnostic to the internals of the network. However, past work on randomized smoothing has focused on restricted classes of smoothing measures or perturbations (like Gaussian or discrete) and has only been able to prove robustness with respect to simple norm bounds. In this paper we introduce a general framework for proving robustness properties of smoothed machine learning models in the black-box setting. Specifically, we extend randomized smoothing procedures to handle arbitrary smoothing measures and prove robustness of the smoothed classifier by using $f$ -divergences. Our methodology improves upon the state of the art in terms of computation time or certified robustness on several image classification tasks and an audio classification task, with respect to several classes of adversarial perturbations. + +# 1 INTRODUCTION + +Predictors obtained from machine learning algorithms have been shown to be vulnerable to making errors when the inputs are perturbed by carefully chosen small but imperceptible amounts (Szegedy et al., 2014; Biggio et al., 2013). This has motivated significant amount of research in improving adversarial robustness of a machine learning model (see, e.g. Goodfellow et al., 2015; Madry et al., 2018). While significant advances have been made, it has been shown that models that were estimated to be robust have later been broken by stronger attacks (Athalye et al., 2018; Uesato et al., 2018). This has led to the need for methods that offer provable guarantees that the predictor cannot be forced to misclassify an example by any attack algorithm restricted to produce perturbations within a certain set (for example, within an $\ell _ { p }$ norm ball). While progress has been made leading to methods that are able to compute provable guarantees for several image and text classification tasks (Wong & Kolter, 2018; Wong et al., 2018; Raghunathan et al., 2018; Dvijotham et al., 2018; Katz et al., 2017; Huang et al., 2019; Jia et al., 2019), these methods require extensive knowledge of the architecture of the predictor and are not easy to extend to new models or architectures, requiring specialized algorithms for each new class of models. Furthermore, the computational complexity of these methods grows significantly with input dimension and model size. + +To deal with these obstacles, recent work has proposed the randomized smoothing strategy for verifying the robustness of classifiers. Specifically, Lecuyer et al. (2019) and Cohen et al. (2019) + +have shown that robustness properties can be more easily verified for the smoothed version of a base classifier $h$ producing labels in some set $\mathcal { V }$ : + +$$ +h _ { s } ( x ) = \underset { y \in \mathcal { V } } { \arg \operatorname* { m a x } } \ \underset { X \sim \mu ( x ) } { \mathbb { P } } \big [ h ( X ) = y \big ] \ , +$$ + +where the labels returned by the smoothed classifier $h _ { s }$ are obtained by taking a “majority vote” over the predictions of the original classifier $h$ on random inputs drawn from a probability distribution $\mu ( x )$ , called the smoothing measure. Lecuyer et al. (2019) showed that verifying the robustness of this smoothed classifier is significantly simpler than verifying the original classifier $h$ and only requires estimating the distribution of outputs of the classifier under random perturbations of the input, but does not require access to the internals of the classifier $h$ . We refer to this as black-box verification. + +In this work, we develop a general framework for black-box verification that recovers prior work as special cases, and improves upon previous results in various ways. + +Contributions Our contributions are summarized as follows: + +1. We formulate the general problem of black-box verification via a generalized randomized smoothing procedure, which extends existing approaches to allow for arbitrary smoothing measures. Specifically, we show that robustness certificates for smoothed classifiers can be obtained by solving a small convex optimization problem when allowed adversarial perturbations can be characterized via divergence-based bounds on the smoothing measure. + +2. We prove that our certificates generalize previous results obtained in related work (Lecuyer et al., 2019; Cohen et al., 2019; Li et al., 2019), and vastly extend the class of perturbations and smoothing measures that can be used while still allowing certifiable guarantees. + +3. We introduce the notion of full-information and information-limited settings, and show that the information-limited setting that has been the main focus of prior work leads to weaker certificates for smoothed probabilistic classifiers, and can be improved by using additional information (the distribution of label scores under randomized smoothing). + +4. We evaluate our framework experimentally on image and classification tasks, obtaining robustness certificates that improve upon other black-box methods either in terms of certificate tightness or computation time on robustness to $\ell _ { 0 } , \ell _ { 1 }$ or $\ell _ { 2 }$ perturbations on MNIST, CIFAR-10 and ImageNet. $\ell _ { 2 }$ perturbations result from worst-case realizations of white noise that is common in many image, speech and video processing. $\ell _ { 0 }$ perturbations can model missing data (missing pixels in an image, or samples in a time-domain audio signal) while $\ell _ { 1 }$ perturbations can be used to model convex combinations of discrete perturbations in text classification (Jia et al., 2019). We also obtain the first, to the best of our knowledge, certifiably robust model for an audio classification task, Librispeech (Panayotov et al., 2015), with variable-length inputs. + +# 2 BLACK-BOX VERIFICATION FOR SMOOTHED CLASSIFIERS + +Consider a binary classifier $h : \mathcal { X } \{ \pm 1 \}$ given to us as a black box, so we can only access the inputs and outputs of $h$ but not its internals. We are interested in investigating the robustness of the smoothed classifier $h _ { s }$ (defined in Eq. 1) against adversarial perturbations of size at most $\epsilon$ with respect to a given norm $\left\| \cdot \right\|$ . To determine whether a norm-bounded adversarial attack on a fixed input $x \in \mathcal { X }$ with $h _ { s } ( x ) = + 1$ could be successful, we can solve the optimization problem + +$$ +\operatorname* { m i n } _ { \| \boldsymbol { x ^ { \prime } } - \boldsymbol { x } \| \le \epsilon { \boldsymbol X ^ { \prime } } \sim \mu ( \boldsymbol { x ^ { \prime } } ) } [ h ( \boldsymbol { X ^ { \prime } } ) = + 1 ] , +$$ + +and check whether the minimum value can be smaller than $\frac { 1 } { 2 }$ . This is a non-convex optimization problem for which we may not even be able to compute gradients since we only have black-box access to $h$ . While techniques have been developed to address this problem, obtaining provable guarantees on whether these algorithms actually find the worst-case adversarial perturbation is difficult since we do not know anything about the nature of $h$ . + +Motivated by this difficulty, we take a different approach: Rather than studying the adversarial attack in the input space $\mathcal { X }$ , we study it in the space of probability measures over inputs, denoted by $\mathcal { P } ( \mathcal { X } )$ . + +Formally, this amounts to rewriting Eq. 2 as + +$$ +\operatorname* { m i n } _ { \nu \in \{ \mu ( x ^ { \prime } ) \colon \| x ^ { \prime } - x \| \leq \epsilon \} } \operatorname* { l p } _ { X ^ { \prime } \sim \nu } [ h ( X ^ { \prime } ) = + 1 ] . +$$ + +This is an infinite dimensional optimization problem over the space of probability measures $\nu \in { \mathcal { P } } ( { \mathcal { X } } )$ subject to the constraint $\nu \in \mathcal { D } = \{ \mu ( x ^ { \prime } ) : \| x ^ { \prime } - x \| \leq \epsilon \}$ . While this set is still intractable to deal with, we can consider relaxations of this set defined by divergence constraints between $\nu$ and $\rho = \mu ( x )$ , i.e., $\mathcal { D } \subseteq \{ \nu : D ( \nu \| \rho ) \leq \epsilon _ { D } \}$ where $D$ denotes some divergence between probability distributions. We will show in Section 3 that for several commonly used divergences (in fact, for any $f$ -divergence; cf. Ali & Silvey, 1966), the relaxed problem can be solved efficiently. + +# 2.1 A GENERAL FRAMEWORK FOR ROBUSTNESS CERTIFICATION + +To formulate the general verification problem, consider a specification $\phi : \mathcal { X } \to \mathcal { Z } \subseteq \mathbb { R }$ : a generic function over the input space (that typically is a function of the classifier output) that we want to verify has certain properties. Unless otherwise specified, we will assume that $\mathcal { \hat { X } } \subseteq \mathbb { R } ^ { d }$ (we work in a $d$ dimensional input space). Our framework also involves a reference measure $\rho$ (in the above example we would take $\rho = \mu ( x ) )$ and a collection of perturbed distributions $\mathcal { D }$ (in the above example we would take $\mathcal { D } = \mathcal { D } _ { x , \epsilon } = \{ \mu ( x ^ { \prime } ) : \| x ^ { \prime } - x \| \le \bar { \epsilon } \}$ ). + +Verifying that a given specification $\phi$ is robustly certified is equivalent to checking whether the optimal value of the optimization problem + +$$ +{ \mathrm { O P T } } ( \phi , \rho , { \mathcal { D } } ) : = \operatorname* { m i n } _ { \nu \in { \mathcal { D } } } \operatorname { E } _ { X \sim \nu } [ \phi ( X ) ] \ , +$$ + +is non-negative. Solving problems of this form is the key workhorse of our general framework for black-box certification of adversarial robustness for smoothed classifiers. + +Using these ingredients we introduce two closely related certification problems: information-limited robust certification and full-information robust certification. In the former case, we assume that we are given only given access to $\mathbb { P } _ { X \sim \rho } [ \phi ( X ) = + 1 ] , \mathbb { P } _ { X \sim \nu } [ \phi ( X ) = + 1 ]$ . In the latter case, we are given full-access to specification $\phi$ . The definitions are below. + +Definition 2.1 (Information-limited robust certification). Given reference distribution $\rho \in { \mathcal { P } } ( { \mathcal { X } } )$ , probabilities $\theta _ { a } , \theta _ { b }$ that satisfy $\theta _ { a } , \theta _ { b } \geq 0 , \theta _ { a } + \theta _ { b } \leq 1$ and collection of perturbed distributions $\mathcal { D } \subset \mathcal { P } ( \mathcal { X } )$ containing $\rho$ , define the class of specifications $S$ as + +$$ +S = \left\{ \phi : \mathcal { X } \to \{ - 1 , 0 , + 1 \} \mathrm { ~ s . t . ~ } \operatorname { \mathbb { P } } _ { X \sim \rho } [ \phi ( X ) = + 1 ] \geq \theta _ { a } , \operatorname { \mathbb { P } } _ { X \sim \rho } [ \phi ( X ) = - 1 ] \leq \theta _ { b } \right\} +$$ + +We say that $S$ is information-limited robustly certified at $\rho$ with respect to $\mathcal { D }$ if the following condition holds: $\operatorname { E } _ { X \sim \nu } [ \phi ( X ) ] \geq 0$ for all $\nu \in \mathcal { D } , \phi \in S$ . + +Note since we don’t have access to $\phi$ , we need to prove that ${ \mathrm { E } } _ { X \sim \nu } [ \phi ( X ) ] \geq 0 \quad \forall \nu \in { \mathcal { D } }$ is satisfied for all specifications in set $S$ . Although the information-limited case may seem challenging because we need to provide guarantees that hold simultaneously over a whole class of specifications, it turns out that, for perturbation sets $\mathcal { D }$ specified by an $f$ -divergence bound, this certification task can be solved efficiently using convex optimization. + +Definition 2.2 (Full-information robust certification). Given a reference distribution $\rho \in { \mathcal { P } } ( { \mathcal { X } } )$ , a specification $\phi : \mathcal { X } \to \mathcal { Z } \subseteq \mathbb { R }$ and a collection of perturbed distributions $\mathcal { D } \subset \mathcal { P } ( \mathcal { X } )$ containing $\rho$ , we say that $\phi$ is full-information robustly certified at $\rho$ with respect to $\mathcal { D }$ if the following condition holds: $\operatorname { E } _ { X \sim \nu } [ \phi ( X ) ] \geq 0$ for all $\nu \in \mathcal { D }$ . + +Most often we are dealing with the case where we have full access to the specification $\phi$ , thus we should be able to certify using full-information robust certification. However, prior works, Cohen et al. (2019) and Lecuyer et al. (2019), have only provided solutions to certify with respect to the information-limited case where we cannot use all of the information about $\phi$ . The framework we develop is a more general method that can be used in both information-limited and full-information scenarios. We will demonstrate that our framework recovers certificates provided by Cohen et al. (2019), Li et al. (2019) and dominates Lecuyer et al. (2019) in the information-limited setting (see section 5). Further, it can utilize full-information about the specification $\phi$ to provide tighter certificates for smoothed probabilistic classifiers (see section 6). + +We first note that the definitions above are sufficient to capture the standard usage of randomized smoothing as it has been used in past work (e.g. Lecuyer et al., 2019; Cohen et al., 2019) to verify the robustness of smoothed multi-class classifiers. Specifically, consider smoothing a classifier $h : \mathcal { X } \to \mathcal { Y }$ with a finite set of labels $\mathcal { V }$ using a smoothing measure $\mu : \mathcal X \mapsto \mathcal P ( \mathcal X )$ . The resulting randomly smoothed classifier $h _ { s }$ is defined in Eq. 1. Our goal is to certify that the prediction $h _ { s } ( x )$ is robust to perturbations of size at most $\epsilon$ measured by distance function1 $d : \mathcal { X } \times \mathcal { X } \mapsto \mathbb { R } _ { + }$ , i.e., + +$$ +h _ { s } ( x ^ { \prime } ) = h _ { s } ( x ) \quad \forall x ^ { \prime } \ \mathrm { s u c h ~ t h a t } \ d ( x , x ^ { \prime } ) \leq \epsilon . +$$ + +To pose this question within our framework, we choose the reference distribution $\rho = \mu ( x )$ , the set of perturbed distributions $\mathcal { D } _ { x , \epsilon } = \{ \mu ( x ^ { \prime } ) : d ( x , x ^ { \prime } ) \leq \epsilon \}$ , and the following specifications. Let $c = h _ { s } ( x )$ . For every $c ^ { \prime } \in \mathcal { V } \setminus \{ c \}$ , we define the specification $\phi _ { c , c ^ { \prime } } : \mathcal { X } \mapsto \{ - \bar { 1 } , \bar { 0 } , + 1 \}$ as follows: + +$$ +\phi _ { c , c ^ { \prime } } ( x ) = \left\{ \begin{array} { l l } { { + 1 } } & { { \mathrm { ~ i f ~ } h ( x ) = c ~ , } } \\ { { - 1 } } & { { \mathrm { ~ i f ~ } h ( x ) = c ^ { \prime } ~ , } } \\ { { 0 } } & { { \mathrm { ~ o t h e r w i s e ~ . } } } \end{array} \right. +$$ + +Then, Eq. 5 holds if and only if every $\phi _ { c , c ^ { \prime } }$ , $c ^ { \prime } \neq c$ , is robustly certified at $\mu ( x )$ with respect to $\mathcal { D } _ { x , \epsilon }$ (see Appendix A.1). + +# 2.2 CONSTRAINT SETS FROM F-DIVERGENCES + +Dealing with the set $\mathcal { D } _ { x , \epsilon }$ directly is difficult due to its possibly non-convex geometry. In this section, we discuss specific relaxations of this set, i.e., choices for sets $\mathcal { D }$ such that $\mathcal { D } _ { x , \epsilon } \subseteq \mathcal { D }$ that are easier to optimize over. In particular, we focus on a general family of constraint sets defined in terms of $f$ -divergences. These divergences satisfy a number of useful properties and include many well-known instances (e.g. relative entropy, total variation); see Appendix A.2 for details. + +Definition 2.3. $f$ -divergence constraint set). Given $\rho , \nu \in \mathcal { P } ( \mathcal { X } )$ , their $f$ -divergence is defined as + +$$ +D _ { f } ( \nu \| \rho ) = \underset { X \sim \rho } { \mathrm { E } } \Bigg [ f \Bigg ( \frac { \nu ( X ) } { \rho ( X ) } \Bigg ) \Bigg ] ~ , +$$ + +where $f : \mathbb { R } _ { + } \mapsto \mathbb { R }$ is a convex function with $f ( 1 ) = 0$ . Given a reference distribution $\rho$ , an $f$ -divergence $D _ { f }$ and a bound $\epsilon _ { f } \geq 0$ , we define the $f$ -divergence constraint set to be: + +$$ +\mathcal { D } _ { f } = \{ \nu \in \mathcal { P } ( \mathcal { X } ) : D _ { f } ( \nu \| \rho ) \leq \epsilon _ { f } \} \ . +$$ + +Technically, this definition depends on the Radon-Nikodym derivative of $\nu$ with respect to $\rho$ , but we ignore measure-theoretic issues in this paper for simplicity of exposition. For continuous distributions, $\nu$ and $\rho$ should be treated as densities, and for discrete distributions as probability mass functions. + +Relaxations using $f$ -divergence This construction immediately allows us to obtain relaxations of $\mathcal { D } _ { x , \epsilon }$ . For example, by choosing $f ( u ) = u \log ( u )$ , we have the KL-divergence. Using KL-divergence yields the following relaxation between norm-based and divergence-based constraint sets for Gaussian smoothing measures, i.e. $\mu ( x ) = \mathcal { N } ( x , \sigma ^ { 2 } I )$ : + +$$ +\begin{array} { r } { { \mathcal { D } } _ { x , \epsilon } = \{ \mu ( x ^ { \prime } ) : \| x - x ^ { \prime } \| _ { 2 } \leq \epsilon \} \subseteq \left\{ \nu : \mathrm { K L } ( \nu \| \mu ( x ) ) \leq \epsilon ^ { 2 } / ( 2 \sigma ^ { 2 } ) \right\} \ . } \end{array} +$$ + +Tighter relaxations can be constructed by combining multiple divergence-based constraints. In particular, suppose $\mathcal { F }$ is a collection of convex functions each defining an $f$ -divergence, and assume each $f \in { \mathcal { F } }$ has a bound $\epsilon _ { f }$ associated with it. Then we can define the constraint set containing perturbed distributions where all the bounds hold simultaneously (Fig. 1): + +$$ +{ \mathcal { D } } _ { { \mathcal { F } } } : = \bigcap _ { f \in { \mathcal { F } } } { \mathcal { D } } _ { f } = \left\{ \nu : \forall f \in { \mathcal { F } } \ D _ { f } ( \nu \| \rho ) \leq \epsilon _ { f } \right\} \ . +$$ + +![](images/780bf0bf4f2c683a963451dd5c5948364e7681d2494ad1b2600b2a70aae3d94a.jpg) +Figure 1: Intersecting $f$ -divergence constraints to obtain better relaxations g. \`0). $\mathcal { D } _ { \mathcal { F } }$ (depicted by the orange region) of $\mathcal { D } _ { x , \epsilon }$ . + +In this paper, we work with the following divergences: + +(1) Renyi: ´ $R _ { \alpha } ( \nu | | \rho ) = \log ( 1 + D _ { f } ( \nu | | \rho ) ) / ( \alpha - 1 )$ where $f ( x ) = x ^ { \alpha } - 1$ (for $\alpha \geq 1 \gamma$ ), and $\tilde { R _ { \alpha } } ( \rho \| \nu ) = \log ( 1 - D _ { f } ( \nu \| \rho ) ) / ( \alpha - 1 )$ with $f ( x ) = 1 - x ^ { \alpha }$ (for $0 \leq$ $\alpha \leq 1 _ { \cdot }$ ). The limit $\alpha \to \infty$ yields the infinite order Renyi divergence ´ $R _ { \infty } ( \nu \| \rho ) = \operatorname* { s u p } _ { x } ( \nu ( x ) / \rho ( x ) )$ . + +(2) $\mathrm { K L } ( \nu \| \rho ) = D _ { f } ( \nu \| \rho )$ with $f ( x ) = x \log ( x )$ + +(3) Hockey-Stick: $D _ { \mathrm { H S } , \beta } ( \nu \| \rho ) = D _ { f } ( \nu \| \rho )$ with $f ( x ) = \mathrm { m a x } ( x - \beta , 0 ) - \mathrm { m a x } ( 1 - \beta , 0 ) .$ + +It turns out that the Renyi and KL divergences are computationally attractive for a broad class of ´ smoothing measures, while the Hockey-Stick divergences are theoretically attractive as they lead to optimal certificates in the information-limited setting. However, Hockey-Stick divergences are harder to estimate in general, so we only use them for Gaussian smoothing measures. + +# 2.3 COMPUTING F-DIVERGENCE BOUNDS + +In general, our framework can be used with any family of smoothing measures and any family of $f$ divergences such that an upper bound on $\mathrm { m a x } _ { \nu \in \mathcal { D } _ { x , \epsilon } } D _ { f } ( \nu \| \rho )$ can be estimated efficiently. We describe how $f$ -divergence bounds can be obtained for several classes of smoothing measures: + +Product measures Product measures are of the form $\mu ( \boldsymbol { x } ) = \otimes _ { i = 1 } ^ { d } \mu _ { i } ( x _ { i } )$ where $\begin{array} { r } { \mathcal { X } = \prod _ { i = 1 } ^ { d } \mathcal { X } _ { i } } \end{array}$ and $\mu _ { i }$ is a smoothing measure on $\mathcal { X } _ { i }$ . We note that the discrete smoothing measure used in (Lee et al., 2019), the Gaussian measure used in (Cohen et al., 2019) and the Laplacian measure used in (Li et al., 2019) are all of this form. For such measures, one can construct bounds on Renyi- ´ divergences subject to any $\ell _ { p }$ norm constraint using a Lagrangian relaxation of the optimization problem $\begin{array} { r } { \operatorname { 1 a x } _ { x ^ { \prime } : \| x - x ^ { \prime } \| _ { p } \leq \epsilon } R _ { \alpha } ( \mu ( x ^ { \prime } ) \| \mu ( x ) ) } \end{array}$ (see Appendix A.3 for details). + +Norm-based smoothing measures Appendix A.9.1 also shows how we can obtain bounds on the infinite-order Renyi divergence ´ $R _ { \infty }$ , as well as on several classes of $f$ -divergences, for norm-based smoothing measures of the form $\mu ( x ) [ X ] \propto \exp ( { - \| X - x \| } )$ . + +# 3 OUR CERTIFICATION PROCEDURES + +We now show how to reduce the problems of full-information and information-limited robust blackbox certification to simple convex optimization problems for general constraint sets $\mathcal { D }$ defined in terms of $f$ -divergences. This allows us, by extension, to solve the problem for related divergences like Renyi divergences. The following two theorems provide the main foundation for the verification ´ procedures in the paper. + +Theorem 1 (Verifying full-information robust certification). Let $\mathcal { D } _ { \mathcal { F } }$ be the constraint set defined by $\mathcal { F } = \{ f _ { 1 } , \ldots , f _ { M } \}$ and $\epsilon _ { f _ { i } } = \epsilon _ { i }$ . Define $\begin{array} { r } { f _ { \lambda } ( u ) = \sum _ { i = 1 } ^ { M } \lambda _ { i } f _ { i } ( u ) } \end{array}$ and denote its convex conjugate2 by $f _ { \lambda } ^ { * }$ . The specification $\phi$ is robustly certified at $\rho$ with respect to $\mathcal { D } _ { \mathcal { F } }$ (cf. Definition 2.2) if and only $i f$ the optimal value of the following convex optimization problem is non-negative: + +$$ +\operatorname* { m a x } _ { \lambda _ { 1 } , \dots , \lambda _ { M } \ge 0 , \kappa } \kappa - \sum _ { i = 1 } ^ { M } \lambda _ { i } \epsilon _ { i } - \underset { X \sim \rho } { \mathrm { E } } [ f _ { \lambda } ^ { * } ( \kappa - \phi ( X ) ) ] . +$$ + +The proof of Theorem 1, given in Appendix A.4, uses standard duality results to show that the dual of the verification optimization problem has the desired form. We note that the special case where $M = 1$ reduces to Proposition 1 of Duchi & Namkoong (2018), although the result is used in a completely different context in that work. + +To build a practical certification algorithm from Theorem 1, we must do two things: 1) compute the optimal values of $\lambda$ and $\kappa$ ; and 2) estimate the expectation in Eq. 6. Since the estimation of the expectation cannot be done in closed form (due to the black-box nature of $\phi$ ), we must rely on sampling. In step 1 of Algorithm 1, we use $N$ samples taken independently from $\rho$ to estimate the expectation and solve the “sampled” optimization problem using an off-the-shelf solver (Diamond + +Algorithm 1 Full information certification (see appendix A.9 for details of subroutines) + +Inputs: Query access to specification $\phi : \mathcal { X } [ a , b ]$ , sampling access to reference distribution $\rho$ , divergences $f _ { i }$ and bounds $\epsilon _ { i }$ , sample sizes $N$ , $\tilde { N }$ , confidence level $\zeta$ . +1: $\kappa ^ { * }$ $\lambda ^ { * } \gets \mathrm { E S T I M A T E O P T } ( \rho , \phi , N , \{ f _ { i } \} _ { i = 1 } ^ { M } , \{ \epsilon _ { i } \} _ { i = 1 } ^ { M } ) .$ . +2: $E _ { u b } \gets$ UPPERCONFIDENCEBOUND(ρ, φ, N, ˜ {fi}Mi=1, $\{ \epsilon _ { i } \} _ { i = 1 } ^ { M } , a , b , \lambda ^ { * } , \kappa ^ { * } , \zeta ) .$ +3: If $\begin{array} { r } { \kappa ^ { * } - \sum _ { i = 1 } ^ { M } \lambda _ { i } ^ { * } \epsilon _ { i } - E _ { u b } \geq 0 } \end{array}$ return CERTIFIED else return NOT CERTIFIED. + +& Boyd, 2016). This gives us $\kappa ^ { * } , \lambda ^ { * }$ , the estimated optimal values of $\kappa$ and $\lambda$ , respectively. Then we take these values and compute a high-confidence lower bound on the objective function of Eq. 6, which is then used to verify robustness. In particular, in step 2, we compute a high-confidence upper bound $E _ { u b }$ on the expectation term in the objective such that $E _ { u b } \ge \mathrm { E } _ { X \sim \rho } [ f _ { \lambda } ^ { * } ( \kappa ^ { * } - \phi ( X ) ) ]$ with probability at least $\zeta$ ; this computation involves taking $\tilde { N }$ independent samples from $\rho$ and finding a confidence interval around the resulting empirical estimate of the expectation (for details, see Eq. 25 in Appendix A.9.1). Plugging in this estimate back into Eq. 6 gives the desired high-confidence lower bound in step 3. Details of both subroutines ESTIMATEOPT and UPPERCONFIDENCEBOUND used in Algorithm 1 are given in Algorithm 3 in Appendix A.9.2. + +Our next theorem concerns the specialization of this verification procedure to the information-limited setting. + +Theorem 2 (Verifying information-limited robust certification). Let $\mathcal { D } _ { \mathcal { F } }$ be as in Theorem 1, and $S$ and $\theta _ { a }$ , $\theta _ { b }$ be as in Definition 2.1. The class of specifications $S$ is information-limited robustly certified at $\rho$ with respect to $\mathcal { D } _ { \mathcal { F } }$ (cf. Definition 2.1) if and only if the optimal value of the following convex optimization problem is non-negative: + +$$ +\begin{array} { r l } { \underset { \zeta _ { a } , \zeta _ { b } , \zeta _ { c } \geq 0 } { \operatorname* { m i n } } } & { \zeta _ { a } - \zeta _ { b } } \\ { \mathrm { S u b j e c t ~ t o } } & { \zeta _ { a } + \zeta _ { b } + \zeta _ { c } = 1 } \end{array} , \quad D _ { f _ { i } } ( \zeta \| \theta ) \leq \epsilon _ { i } \quad i = 1 , \dots , M \ , +$$ + +where $\theta = ( \theta _ { a } , \theta _ { b } , 1 - \theta _ { a } - \theta _ { b } )$ and $\zeta = ( \zeta _ { a } , \zeta _ { b } , \zeta _ { c } )$ are interpreted as probability distributions. + +The proof of Theorem 2 is presented in Appendix A.5. It is based on the fact that in the informationlimited setting, it is possible to directly compute the expectation in Eq. 6, and in fact this expectation only depends on $\phi$ via the probabilities $\theta _ { a }$ and $\theta _ { b }$ . + +Theorem 2 naturally leads to a certification algorithm, presented in Algorithm 2. It simply uses the same procedure as Cohen et al. (2019, Section 3.2) to compute a high-confidence lower bound $\underline { { \theta } } _ { a }$ on the probability of the correct class under randomized smoothing and then solves the convex optimization problem Eq. 7. Again, we can use an off-the-shelf solver CVXPY (Diamond & Boyd, 2016) in step 2 for the general $M > 1$ case, but closed-form solutions are also available for $M = 1$ ; these are given in Table 4 in Appendix A.6. + +# Algorithm 2 Information-limited certification + +Inputs: Query access to classifier $h$ , correct label $y$ , sampling access to reference distribution $\rho$ divergences $f _ { i }$ and bounds $\epsilon _ { i }$ , sample sizes $N , { \tilde { N } }$ , confidence level $\zeta$ . + +1: Sample $X ^ { 1 } , \ldots , X ^ { N } \sim \rho$ and test3 whether $y = \arg \operatorname* { m a x } _ { y ^ { \prime } \in \mathcal { V } } \mathbb { P } _ { X \sim \rho } [ h ( X ) = y ^ { \prime } ] .$ . +2: Sample $X ^ { 1 } , \dotsc , X ^ { \tilde { N } } \dotsc \rho$ and compute4 a bound $\mathbb { P } _ { X \sim \rho } [ h ( X ) = y ^ { \prime } ] \geq \underline { { \theta } } _ { a }$ with confidence $\zeta$ . +3: Obtain $o ^ { * }$ by solving Eq. 7 with $\theta _ { a } \gets \underline { { \theta _ { a } } }$ and $\theta _ { b } \gets 1 - \theta _ { a }$ . +4: If $o ^ { * } \geq 0$ return CERTIFIED else return NOT CERTIFIED. + +# 4 THEORETICAL ANALYSIS OF CERTIFICATION METHODS + +We now present theoretical results characterizing our certification methods and show the following: + +1. For smoothed probabilistic classifiers, the full-information certificate dominates the informationlimited one. +2. In the information-limited setting, if we define the $f$ -divergence relaxation $\mathcal { D } _ { \mathcal { F } }$ using HockeyStick divergences with specific parameters, then the computed certificate is provably tight. + +# 4.1 ADVANTAGE OF FULL-INFORMATION CERTIFICATION + +Consider a soft binary classifier $H : \mathcal { X } [ 0 , 1 ]$ that outputs the probability of label $+ 1$ and consider a point $x \in \mathcal { X }$ with $\dot { H } ( x ) > 1 / 2$ . We define the specification $\begin{array} { r } { \phi ( \bar { x } ) = H ( x ) - \frac { 1 } { 2 } } \end{array}$ . Then, the smoothed classifier $H _ { s } ( x ) = \operatorname { E } _ { X \sim \mu ( x ) } [ H ( X ) ]$ predicts label $+ 1$ for all $x ^ { \prime }$ with $\left\| x ^ { \prime } - x \right\| ^ { - } \leq \epsilon$ if and only if $\phi$ is full-information robustly certified at $\mu ( x )$ with respect to $\mathcal { D } _ { x , \epsilon } = \{ \mu ( x ^ { \prime } ) : \| x ^ { \prime } - x \| \le \epsilon \}$ . Note that the optimization in Theorem 1 depends on the full distribution of $\phi ( X ) \in [ - 1 / 2 , 1 / 2 ]$ , $X \sim \mu ( x )$ . On the other hand, to certify this robustness in the information-limited setting is equivalent to taking the specification $\phi ( x ) = 1 [ \dot { H } ( x ) > 1 / 2 ]$ (the indicator function of the event $\mathbf { \bar { \boldsymbol { H } } } ( x ) \mathbf { \bar { \boldsymbol { { \Sigma } } } } > 1 / 2$ ), in which case the only information available is $\begin{array} { r } { \dot { \theta _ { a } } = H _ { s } ( x ) = \operatorname { E } _ { X \sim \mu ( x ) } [ H ( X ) ] } \end{array}$ . + +To compare the two approaches, consider the objective of Eq. 6 with a single $f$ -divergence constraint $D _ { f } ( \nu \| \bar { \rho } ) \leq \epsilon$ . Then, we have + +$$ +\begin{array} { l } { { \displaystyle \kappa - \lambda \epsilon - \underset { X \sim \mu ( x ) } { \mathrm { E } } [ f _ { \lambda } ^ { * } ( \kappa - \phi ( X ) ) ] = \kappa - \lambda \epsilon - \underset { X \sim \mu ( x ) } { \mathrm { E } } \biggl [ f _ { \lambda } ^ { * } \biggl ( \kappa - H ( X ) + \frac 1 2 \biggr ) \biggr ] } } \\ { { \displaystyle = \kappa - \lambda \epsilon - \underset { X \sim \mu ( x ) } { \mathrm { E } } \biggl [ f _ { \lambda } ^ { * } \biggl ( \biggl ( \kappa + \frac 1 2 - 1 \biggr ) H ( X ) + \biggl ( \kappa + \frac 1 2 \biggr ) ( 1 - H ( X ) ) \biggr ) \biggr ] } } \\ { { \displaystyle \geq \kappa - \lambda \epsilon - \underset { X \sim \mu ( X ) } { \mathrm { E } } \biggl [ f _ { \lambda } ^ { * } \biggl ( \kappa - \frac 1 2 \biggr ) H ( X ) + f _ { \lambda } ^ { * } \biggl ( \kappa + \frac 1 2 \biggr ) ( 1 - H ( X ) ) \biggr ] } } \\ { { \displaystyle = \kappa - \lambda \epsilon - \theta _ { a } f _ { \lambda } ^ { * } \biggl ( \kappa - \frac 1 2 \biggr ) - ( 1 - \theta _ { a } ) f _ { \lambda } ^ { * } \biggl ( \kappa + \frac 1 2 \biggr ) \enspace , } } \end{array} +$$ + +where the third line follows from Jensen’s inequality. The proof of Theorem 2 shows that maximizing the final expression above with respect to $\kappa , \lambda$ is equivalent to the dual of the information-limited certification problem Eq. 7. Thus, the information-limited setting computes a weaker certificate than the full-information setting for soft classifiers: + +Corollary 3. The optimization problem of Eq. 6 with the specification $\phi$ defined above has an optimal value that is greater than or equal to that of the optimization problem defined in Eq. 7. + +# 4.2 TIGHT RELAXATIONS FOR INFORMATION-LIMITED ROBUST CERTIFICATION + +Ideally, we would like to certify robustness of specifications with respect to sets of the form $\mathcal { D } _ { x , \epsilon } =$ $\{ \mu ( x ^ { \prime } ) : d ( x , x ^ { \prime } ) \leq \epsilon \}$ . The following result shows that the gap between the ideal $\mathcal { D } _ { x , \epsilon }$ and the tractable constraint sets $\mathcal { D } _ { \mathcal { F } }$ can be closed in the context of information-limited robust certification provided that we can measure hockey-stick divergences of every non-negative order $\beta \geq 0$ . The proof is given in Appendix A.7. + +Theorem 4. Let $\theta _ { a } , \theta _ { b } , \rho , \mathcal { D } , S$ be as in Definition 2.1. Define $\begin{array} { r } { \epsilon _ { \beta } = \operatorname* { m a x } _ { \nu \in \mathcal { D } } D _ { \mathrm { H S } , \beta } ( \nu \| \rho ) } \end{array}$ for all $\beta \geq 0$ and let $\beta _ { a } ^ { * } , \beta _ { b } ^ { * }$ be chosen as follows: + +$$ +\beta _ { a } ^ { * } , \beta _ { b } ^ { * } = \operatorname * { a r g m a x } _ { \beta _ { a } \ge \beta _ { b } \ge 0 } ~ 1 - \beta _ { a } ( 1 - \theta _ { a } ) - \beta _ { b } \theta _ { b } - \left( \epsilon _ { \beta _ { a } } + [ 1 - \beta _ { a } ] _ { + } \right) - \left( \epsilon _ { \beta _ { b } } + [ 1 - \beta _ { b } ] _ { + } \right) ~ . +$$ + +Define the constraint set + +$$ +\begin{array} { r } { \mathcal { D } _ { \mathrm { H S } } = \left\{ \nu \in \mathcal { P } ( \mathcal { X } ) : D _ { \mathrm { H S } ; \beta _ { \alpha } ^ { * } } \left( \nu \mid \mid \rho \right) \leq \epsilon _ { \beta _ { \alpha } ^ { * } } \right\} \cap \left\{ \nu \in \mathcal { P } ( \mathcal { X } ) : D _ { \mathrm { H S } ; \beta _ { b } ^ { * } } \left( \nu \mid \mid \rho \right) \leq \epsilon _ { \beta _ { b } ^ { * } } \right\} \ . } \end{array} +$$ + +Then, $S$ is information-limited robustly certified at $\rho$ with respect to $\mathcal { D }$ if and only if $S$ is informationlimited robustly certified at $\rho$ with respect to ${ \mathcal { D } } _ { \mathrm { H S } }$ . Thus, the optimal information-limited certificate in this case can be obtained by applying theorem 2 to ${ \mathcal { D } } _ { \mathrm { H S } }$ . + +# 5 CONNECTIONS WITH PRIOR WORK + +Table 1 summarizes the differences between our work and prior work in terms of the set of smoothing measures admitted, the offline computation cost of the certification procedure (which needs to be performed once for every possible perturbation size and choice of smoothing measure), the perturbations considered, whether they can use information beyond $\theta _ { a } , \theta _ { b }$ to improve the certificates and whether they compute optimal certificates for a given smoothing measure in the informationlimited setting. + +Table 1: Comparison between black-box verification methods. \* Technically, Lee et al. (2019) can handle smoothing measures such that the likelihood ratios take a finite set of values, but most practical instances of this correspond to finite-support distributions. + +
μ(x))Computation-IUse additionalinformation?Optimal
Cohen et al. (2019)Gaussian0(1)l2XYes
Lee et al. (2019)FiniteSupport*0(d3)lOnly decision treesYes
Li et al. (2019)GaussianLaplacian0(1)l2lXNo
Lecuyer et al. (2019)Arbitrary0(1)AllepXNo
Our workArbitrary0(1)AllepArbitrary classifiersYes
+ +Cohen et al. (2019) study the problem of verifying hard classifiers smoothed by Gaussian noise, and derive optimal certificates with respect to $\ell _ { 2 }$ perturbations of the input. Their results can be recovered as a special case of our framework when applied to sets defined via constraints on hockey-stick divergences. Theorem 4 shows that the optimal certificate in the information-limited setting can be computed by applying theorem 2 to a constraint set with two hockey-stick divergences. + +For the Gaussian measure $\mu ( x ) \ : = \ : \mathcal { N } \big ( x , \sigma ^ { 2 } I \big )$ , the HS divergence $D _ { \mathrm { H S } , \beta } ( \mu ( x ) \| \mu ( x ^ { \prime } ) )$ can be computed in closed form and is purely a function of the $\ell _ { 2 }$ distance $\| x - x ^ { \prime } \| _ { 2 }$ . This enables us to efficienctly compute the $\beta _ { a } ^ { * } , \beta _ { b } ^ { * }$ in theorem 4. Thus, we obtain the following result (see Appendix A.7.2 for a proof): + +Corollary 5. Let $\rho = { \mathcal { N } } ( x , \sigma ^ { 2 } I )$ , $\mathcal { D } _ { x , \epsilon } = \{ \mathcal { N } \big ( x ^ { \prime } , \sigma ^ { 2 } I \big ) : \| x - x ^ { \prime } \| _ { 2 } \le \epsilon \}$ and $1 \geq \theta _ { a } \geq \theta _ { b } \geq 0 .$ Let $\mathcal { D } _ { \mathrm { H S } }$ be defined as in theorem 4. Then, applying theorem 2 to the constraint set ${ \mathcal { D } } _ { \mathrm { H S } }$ gives the following condition for robust certification: + +$$ +\Psi _ { g } \Big ( \Psi _ { g } ^ { - 1 } ( \theta _ { a } ) - \frac { \epsilon } { \sigma } \Big ) + \Psi _ { g } \Big ( \Psi _ { g } ^ { - 1 } ( 1 - \theta _ { b } ) - \frac { \epsilon } { \sigma } \Big ) \geq 1 , +$$ + +where $\Psi _ { g }$ is the CDF of a standard normal random variable $\mathcal { N } ( 0 , 1 )$ . With straightforward algebra (worked out in appendix A.7.2) , this can be shown to be equivalent to + +$$ +\Psi _ { g } ^ { - 1 } ( \theta _ { a } ) - \Psi _ { g } ^ { - 1 } ( \theta _ { b } ) \geq \frac { 2 \epsilon } { \sigma } , +$$ + +which is the certificate from Theorem 1 of Cohen et al. (2019). + +Lee et al. (2019) derive optimal certificates in the information-limited setting under the assumption that the likelihood ratio between measures $\frac { \nu ( X ) } { \rho ( X ) }$ (where $\nu = \mu ( \boldsymbol { x } ^ { \prime } ) , \rho = \mu ( \boldsymbol { x } ) )$ can only take values from a finite set. This is a restrictive assumption that prevents the authors from accommodating natural smoothing measures like Gaussian or Laplacian measures. Further, the complexity of computing the certificates in their framework is significant: $O ( d ^ { 3 } )$ computation (where $d$ is the input dimension) is needed to certify smoothness to $\ell _ { 0 }$ perturbations. The authors also derive tighter certificates for the special case of certain classes of decision trees by exploiting the tree structure. In contrast, our framework can derive tighter certificates in the full-information setting for arbitrary classifiers. + +Li et al. (2019) use properties of Renyi divergences to derive robustness certificates for classifiers ´ smoothed by Gaussian (resp. Laplacian) noise under $\ell _ { 2 }$ (resp. $\ell _ { 1 }$ ) perturbations. Their results can be obtained as special cases of ours; in particular, the Renyi divergence certificates in Table 4 (in ´ Appendix A.6) recover the results of Lemma 1 of Li et al. (2019), but the latter are only applicable for Gaussian and Laplacian smoothing measures. + +Lecuyer et al. (2019) introduce the notion of pixel differential privacy (pixelDP) and show that smoothing measures $\mu$ satisfying pixelDP with respect to a certain type of perturbations lead to adversarially robust classifiers. We can show that pixelDP can be viewed as a special instance of our certification framework with two specific hockey-stick divergences, and that the certificates derived from the pixelDP are provably dominated by the certificates from our framework (Theorem 1) with the same choice of divergences (see Corollary 7 in Appendix A.7.3). + +# 6 EXPERIMENTS + +6.1 FULL-INFORMATION IMPROVES UPON INFORMATION-LIMITED CERTIFICATION + +To compare full-information certificates with limitedinformation certificates, we trained a ResNet-152 model on ImageNet with data augmentation by adding noise via sampling from a zero-mean Gaussian with variance 0.5 for each coordinate; during certification we sample from the same distribution to estimate lower bounds on the probability of the top predicted class. For the fullinformation certificate, we use two hockey-stick divergences for the certificate and tune the parameters $\beta$ to obtain the highest value in the optimization problem in step 2 of Algorithm 1. For the infromation-limited certificate, our approach reduces to that of (Cohen et al., 2019) and we follow the same certification procedure. We use $N = 1 0 0 0 , \tilde { N } = 1 0 0 0 0 0 , \zeta = . 9 9$ for both certification procedures. + +Figure 2 shows the difference between the two certificates. The certificate provided by the full-information method is always stronger than the one given by the informationlimited method. The difference is often substantial – for one of the test samples, the full-information setting can certify robustness to $\ell _ { 2 }$ perturbations of radius $\epsilon = 9 . 4 2$ in the full-information case while the limited-information certificate can only be provided for perturbation radius $\epsilon = 2 . 6 9$ . + +![](images/27abe4bd89aec0a79207152ac4aab0cd74feeb3c0907b124f56b118683dab4c3.jpg) +Figure 2: Information-limited vs fullinformation certificates for ImageNet for $\ell _ { 2 }$ perturbations. The dashed line represents equal certificates and every point below the dashed line has a stronger certificate from the full information verification setting. We run the comparison on 50 randomly selected examples from the validation set. Each blue dot in Figure 2 corresponds to one test point, with its x coordinate representing the radius for full information certificate (from Algorithm 1) and y coordinate the informationlimited certificate (which is equivalent to the certification procedure of Cohen et al., 2019). The running time of the full-information certification procedure is .2s per example (excluding the sampling cost) while the limitedinformation certification takes .002s per example. Both procedures incur the same sampling cost as they use the same number of samples. + +# 6.2 SCALABILITY AND TIGHTNESS + +In this section we consider $\ell _ { 0 }$ perturbations for both ImageNet and Binary MNIST (that is, we consider the number of pixels that can be perturbed without changing the prediction). To test for scalability and tightness trade-offs of our framework, we compare our methodology to that of + +Lee et al. (2019), as their work obtains the optimal bound for $\ell _ { 0 }$ . We computed certificates for a single model for each classification task; for Binary MNIST we used the same model and training procedure as Lee et al. (2019) and for ImageNet, we used the model released in the Github code accompanying the paper of Lee et al. (2019). We use the discrete smoothing measure (appendix A.10) with parameter $p = 0 . 8$ for Binary MNIST certification, and $p = 0 . 2$ for ImageNet certification. + +In our experiments we ran the certification procedures on all test examples from the Binary MNIST dataset, while for ImageNet, following prior work (Lee et al., 2019; Cohen et al., 2019), on every 100th example from validation set. The proportion of the examples for which $\epsilon$ accuracy can be certified are reported in Table 2 for various values of $\epsilon$ . Comparing with the optimal certificates obtained by the certification method of Lee et al. (2019), the table shows that our bounds remains tight for Binary MNIST up until $\epsilon = 3$ , and we do so with 130 times speed-up. For ImageNet, our bounds differ only about $7- 1 5 \%$ in terms of accuracy, and we obtain this with approximately 20 million times speed-up. + +Table 2: Proportion of the examples with verified $\ell _ { 0 }$ -robustness for different accuracy () parameters. + +
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
e=1e=2e=3e=4e=5∈=6∈=7
Binary MNISTLee et al. (2019) Ours0.83.68s 0.028s0.919 0.9190.767 0.7670.530 0.5300.513 0.2960.348 0.1620.194 0.0800.095 0.015
ImageNetLee et al. (2019) Ours0.24 days 0.028s0.488 0.3620.418 0.2620.310 0.2240.250 0.1860.244 0.1360.234 00.224 0
+ +# 6.3 CERTIFICATION FOR AUDIO CLASSIFICATION: LIBRISPEECH + +Audio classification systems have been shown to be susceptible to adversarial attacks (Qin et al., 2019). However, building audio classifiers that are provably robust to adversarial attacks has been hard due to the complexity of audio processing architectures. We take a step towards provably robust audio classifiers by showing that our approach can certify robustness of a classifier trained for speaker recognition on a state-of-the-art model for this task. We focus on $\ell _ { 0 }$ perturbations that zero out a fraction of the audio sample, as they correspond to missing data in an audio signal. Missing data can occur due to errors in recording audio or packets dropped while transmitting an audio signal over a network and is a common issue (Turner, 2010; Smaragdis et al., 2009). + +In principle, the method of Lee et al. (2019) is applicable to compute robustness certificates, but at an impractically large computational cost, since the computation needs to be repeated whenever an input of a new length (for which a certificate has not previously been computed) arrives. Concretely, this constitutes an $\mathrm { \bar { \it O } } ( d ^ { 3 } )$ computation for the length $d$ ranging from 38 to 522,320 (the set of audio sequence lengths observed in the Librispeech test dataset (Panayotov et al., 2015)). + +The results are shown in Table 3. To the best of our knowledge, these are the first results showing certified robustness of an audio classifier. We believe this is a significant advance towards certification of classifiers in audio and classifiers operating on variable-length inputs more generally. + +
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
∈=0∈=1e=2e=3e=4e=5e=6e=7
0.50.5110.2250.0910.0910.0910.0910.0910
LibrispeechOurs0.70.028s0.8850.6340.4050.4050.4050.40500
0.90.8720.7720.7110.7110.711000
+ +Table 3: $\ell _ { 0 }$ robustness results for Librispeech (Panayotov et al., 2015). From the Librispeech dataset, we created a corpus of sentence utterances from ten different speakers. The classification task is, given an audio sample, to predict whom is speaking. The test set consisted of 30 audio samples for each of the ten speakers. We use a DeepSpeaker architecture (Li et al., 2017), trained with the Adam optimizer $\beta _ { 1 } = 0 . 9$ , $\beta _ { 2 } = 0 . 5$ ) for 50,000 steps with a learning rate of 0.0001. The architecture is the same as that of Li et al. (2017), except for changing the number of neurons in the final layer for speaker identification with ten classes. Three models were trained with smoothing values of $p = 0 . 5$ , $p = 0 . 7$ , and $p = 0 . 9$ , respectively, and we used the same values for certification. Certification was performed using $N = 1 0 0 0 , \tilde { N } = 1 0 0 0 0 0 , \zeta = . 9 9$ using $M = 1$ Renyi ´ divergence, with $\alpha$ tuned to obtain the best certificate. The proportion of samples with certified robustness for different accuracy values are reported, computed on 300 test set samples. + +# 7 CONCLUSION + +We have introduced a general framework for black-box verification using $f$ -divergence constraints. The framework improves upon state-of-the-art results on both image classification and audio tasks by a significant margin in terms of robustness certificates or computation time. We believe that our framework can potentially enable scalable computation of robustness verification for more complex predictors and structured perturbations that can be modeled using f-divergence constraints. + +# REFERENCES + +Syed Mumtaz Ali and Samuel D Silvey. A general class of coefficients of divergence of one distribution from another. Journal of the Royal Statistical Society: Series B (Methodological), 28 + +(1):131–142, 1966. + +Anish Athalye, Nicholas Carlini, and David Wagner. Obfuscated gradients give a false sense of security: Circumventing defenses to adversarial examples. In International Conference on Machine Learning, 2018. + +Jean-Yves Audibert, Remi Munos, and Csaba Szepesv ´ ari. Exploration-exploitation tradeoff using ´ variance estimates in multi-armed bandits. Theoretical Computer Science, 410(19):1876–1902, 2009. + +Borja Balle and Yu-Xiang Wang. Improving the gaussian mechanism for differential privacy: Analytical calibration and optimal denoising. In International Conference on Machine Learning, pp. 403–412, 2018. + +Gilles Barthe and Federico Olmedo. Beyond differential privacy: Composition theorems and relational logic for f-divergences between probabilistic programs. In International Colloquium on Automata, Languages, and Programming, pp. 49–60. Springer, 2013. + +Battista Biggio, Igino Corona, Davide Maiorca, Blaine Nelson, Nedim Srndic, Pavel Laskov, Giorgio Giacinto, and Fabio Roli. Evasion attacks against machine learning at test time. In Joint European conference on machine learning and knowledge discovery in databases, pp. 387–402. Springer, 2013. + +Sebastian Bubeck. Orf523 (advanced optimization): Introduction. https://blogs.princeton.edu/imabandit/2013/02/05/orf523-advanced-optimization-introduction/, 2013. + +Charles J Clopper and Egon S Pearson. The use of confidence or fiducial limits illustrated in the case of the binomial. Biometrika, 26(4):404–413, 1934. + +Jeremy M Cohen, Elan Rosenfeld, and J Zico Kolter. Certified adversarial robustness via randomized smoothing. arXiv preprint arXiv:1902.02918, 2019. + +Imre Csiszar, Paul C Shields, et al. Information theory and statistics: A tutorial. ´ Foundations and Trends $\textsuperscript { \textregistered }$ in Communications and Information Theory, 1(4):417–528, 2004. + +Steven Diamond and Stephen Boyd. Cvxpy: A python-embedded modeling language for convex optimization. The Journal of Machine Learning Research, 17(1):2909–2913, 2016. + +John Duchi and Hongseok Namkoong. Learning models with uniform performance via distributionally robust optimization. arXiv preprint arXiv:1810.08750, 2018. + +Krishnamuthy Dvijotham, Robert Stanforth, Sven Gowal, Timothy Mann, and Pushmeet Kohli. Towards scalable verification of neural networks: A dual approach. In Conference on Uncertainty in Artificial Intelligence, 2018. + +Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. In International Conference on Machine Learning, 2015. + +Po-Sen Huang, Robert Stanforth, Johannes Welbl, Chris Dyer, Dani Yogatama, Sven Gowal, Krishnamurthy Dvijotham, and Pushmeet Kohli. Achieving verified robustness to symbol substitutions via interval bound propagation. arXiv preprint arXiv:1909.01492, 2019. + +Kenneth Hung and William Fithian. Rank verification for exponential families. The Annals of Statistics, 47(2):758–782, 2019. + +Robin Jia, Aditi Raghunathan, Kerem Goksel, and Percy Liang. Certified robustness to adversarial ¨ word substitutions. arXiv preprint arXiv:1909.00986, 2019. + +Guy Katz, Clark Barrett, David L Dill, Kyle Julian, and Mykel J Kochenderfer. Reluplex: An efficient smt solver for verifying deep neural networks. In International Conference on Computer Aided Verification, pp. 97–117. Springer, 2017. + +Mathias Lecuyer, Vaggelis Atlidakis, Roxana Geambasu, Daniel Hsu, and Suman Jana. Certified robustness to adversarial examples with differential privacy. In 2019 IEEE Symposium on Security and Privacy $( S P )$ , pp. 656–672. IEEE, 2019. + +Guang-He Lee, Yang Yuan, Shiyu Chang, and Tommi S Jaakkola. A stratified approach to robustness for randomly smoothed classifiers. arXiv preprint arXiv:1906.04948, 2019. + +Bai Li, Changyou Chen, Wenlin Wang, and Lawrence Carin. Certified adversarial robustness with additive noises. In Advances in Neural Information Processing Systems, 2019. + +Chao Li, Xiaokong Ma, Bing Jiang, Xiangang Li, Xuewei Zhang, Xiao Liu, Ying Cao, Ajay Kannan, and Zhenyao Zhu. Deep speaker: an end-to-end neural speaker embedding system. arXiv preprint arXiv:1705.02304, 2017. + +Friedrich Liese and Igor Vajda. On divergences and informations in statistics and information theory. IEEE Transactions on Information Theory, 52(10):4394–4412, 2006. + +Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards deep learning models resistant to adversarial attacks. In International Conference on Learning Representations, 2018. + +V. Panayotov, G. Chen, D. Povey, and S. Khudanpur. Librispeech: An asr corpus based on public domain audio books. In 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5206–5210, April 2015. doi: 10.1109/ICASSP.2015.7178964. + +Yao Qin, Nicholas Carlini, Ian Goodfellow, Garrison Cottrell, and Colin Raffel. Imperceptible, robust, and targeted adversarial examples for automatic speech recognition. arXiv preprint arXiv:1903.10346, 2019. + +Aditi Raghunathan, Jacob Steinhardt, and Percy Liang. Certified defenses against adversarial examples. In International Conference on Learning Representations, 2018. URL https:// openreview.net/forum?id $\underline { { \underline { { \mathbf { \Pi } } } } } =$ Bys4ob-Rb. + +Paris Smaragdis, Bhiksha Raj, and Madhusudana Shashanka. Missing data imputation for spectral audio signals. In 2009 IEEE International Workshop on Machine Learning for Signal Processing, pp. 1–6. IEEE, 2009. + +Thomas Steinke and Jonathan Ullman. Between pure and approximate differential privacy. Journal of Privacy and Confidentiality, 7(2), 2016. + +Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. Intriguing properties of neural networks. In International Conference on Learning Representations, 2014. + +Richard E Turner. Statistical models for natural sounds. PhD thesis, UCL (University College London), 2010. + +Jonathan Uesato, Brendan O’Donoghue, Aaron van den Oord, and Pushmeet Kohli. Adversarial risk and the dangers of evaluating against weak attacks. In International Conference on Machine Learning, 2018. + +Eric Wong and J Zico Kolter. Provable defenses against adversarial examples via the convex outer adversarial polytope. International Conference on Machine Learning, 2018. + +Eric Wong, Frank Schmidt, Jan Hendrik Metzen, and J Zico Kolter. Scaling provable adversarial defenses. In Advances in Neural Information Processing Systems, pp. 8400–8409, 2018. + +# A APPENDIX + +# A.1 ADVERSARIAL SPECIFICATION FOR SMOOTHED CLASSIFIERS + +Note that for any $\nu \in \mathcal { D } _ { x , \epsilon }$ we have + +$$ +\operatorname { E } _ { X \sim \nu } [ \phi _ { c , c ^ { \prime } } ( X ) ] = \operatorname * { \mathbb { P } } _ { X \sim \nu } [ h ( X ) = c ] - \operatorname { \mathbb { P } } _ { X \sim \nu } [ h ( X ) = c ^ { \prime } ] ~ . +$$ + +Therefore, $\begin{array} { r l r } { \operatorname { E } _ { X \sim \nu } [ \phi _ { c , c ^ { \prime } } ( X ) ] } & { { } \geq } & { 0 } \end{array}$ for all $c ^ { \prime } \in \mathcal { V } \setminus \{ c \}$ is equivalent to $c \in$ arg $\mathrm { m a x } _ { y \in \mathcal { Y } } \mathbb { P } _ { X \sim \nu } [ h ( X ) = y ]$ . For $\nu = \mu ( x ^ { \prime } )$ , this means that $h _ { s } ( x ^ { \prime } ) = c$ (assuming the argmax is unique). In other words, $\operatorname { E } _ { X \sim \nu } [ \phi _ { c , c ^ { \prime } } ( X ) ] \geq 0$ for all $c ^ { \prime } \in \mathcal { V } \setminus \{ c \}$ and all $\mu ( x ^ { \prime } ) \in \mathcal { D } _ { x , \epsilon }$ if and only if $h _ { s } ( x ^ { \prime } ) = c$ for all $x ^ { \prime }$ such that $d ( x , x ^ { \prime } ) \leq \epsilon$ , proving the required robustness certificate. + +# A.1.1 ROBUSTNESS SPECIFICATION FOR SMOOTHED SOFT CLASSIFIERS + +Consider a soft classifier $H : \mathcal { X } \to \mathcal { P } ( \mathcal { Y } )$ that for each input $x$ returns a probability distribution $H ( x )$ over the set of potential labels $\mathcal { V }$ (e.g. $H$ might represent the outputs of the soft-max layer of a neural network). As in the case of hard classifiers, our methodology can be used to provide robustness guarantees for smoothed soft classifiers obtained by applying a smoothing measure $\mu ( x )$ to the input. In this case, the smoothed classifier is again a soft classifier given by $H _ { s } ( x ) = \operatorname { E } _ { X \sim \mu ( x ) } [ H ( X ) ]$ . + +Let $x$ be a fixed input point and write $p = H _ { s } ( x ) \in \mathcal { P } ( \mathcal { V } )$ to denote the distribution over labels. A number of robustness properties about the soft classifier $H _ { s }$ at $x$ can be phrased in terms of Definition 2.2. For example, let $\mathcal { V } = \{ 1 , \ldots , K \}$ and suppose that $p _ { 1 } \ge p _ { 2 } \ge \cdots \ge p _ { K }$ so that $\{ 1 , \ldots , k \}$ are the top $k$ labels at $x$ . Then we can verify that the set of top $k$ labels will not change when moving the input from $x$ to $x ^ { \prime }$ with $\| x - x ^ { \prime } \| \leq \epsilon$ by defining the specifications $\begin{array} { r } { \phi _ { i , j } ( \bar { z } ) = H ( z ) _ { i } - \bar { H } ( z ) _ { j } } \end{array}$ for $i \in [ 1 , k ]$ and $j \in [ k + 1 , K ]$ , and showing that all of these $\phi _ { i , j }$ are robustly certified at $\mu ( x )$ with respect to the set $\mathcal { D } _ { x , \epsilon }$ defined above. The case $k = 1$ corresponds to robustness of the standard classification rule outputting the label with the largest score. + +Another example is robustness of classifiers which are allowed to abstain. For example, suppose we build a hard classifier $\tilde { h }$ out of $H _ { s }$ which returns the label with the maximum score as long as the gap between this score and the score of any other label is at least $\gamma$ ; otherwise it produces no output. Then we can certify that $\tilde { h }$ will not abstain and return the label $c = \arg \operatorname* { m a x } _ { y \in \mathcal { y } } p _ { y }$ at any point close to $x$ by showing that every $\phi _ { c ^ { \prime } } ( z ) = H ( z ) _ { c } - H ( z ) _ { c ^ { \prime } } - \gamma , c ^ { \prime } \neq c$ , is robustly certified at $\mu ( x )$ with respect to $\mathcal { D } _ { x , \epsilon }$ . + +# A.2 BACKGROUND ON F-DIVERGENCES + +A number of well-known properties about $f$ -divergences are used throughout the paper, both explicitly and implicitly. Here we review such properties for the readers’ convenience. Proofs and further details can be found in, e.g., (Csiszar et al., 2004; Liese & Vajda, 2006). ´ + +Recall that the $f$ -divergences can be defined for any convex function $f : \mathbb { R } _ { + } \to \mathbb { R }$ such that $f ( 1 ) = 0$ . We note that this requirement holds without loss of generality as the map $x \mapsto f ( x ) - f ( 1 )$ is convex whenever $f$ is convex. Any $f$ -divergence $D _ { f }$ satisfies the following: + +1. $D _ { f } ( \nu \| \rho ) \geq 0$ . +2. $D _ { f } ( \rho \| \rho ) = 0$ , and $D _ { f } ( \nu \| \rho ) = 0$ implies $\nu = \rho$ whenever $f$ is strictly convex at 1. +3. $D _ { f } ( F _ { * } ( \nu ) \| F _ { * } ( \rho ) ) \le D _ { f } ( \nu \| \rho )$ for any function $F$ , where $F _ { * } ( \rho )$ is the push-forward of $\rho$ . +4. $D _ { f } ( \nu \| \rho ) = D _ { \bar { f } } ( \rho \| \nu )$ where $\begin{array} { r } { \bar { f } ( u ) = u f \left( \frac { 1 } { u } \right) } \end{array}$ is again convex with ${ \bar { f } } ( 1 ) = 0$ . + +# A.3 BOUNDING RENYI DIVERGENCES + +We being with the optimization problem + +$$ +\begin{array} { r } { \underset { x ^ { \prime } } { \operatorname* { m a x } } R _ { \alpha } ( \mu ( x ^ { \prime } ) \| \mu ( x ) ) } \\ { \mathrm { s u b j e c t ~ t o ~ } \| x - x ^ { \prime } \| _ { p } \leq \epsilon } \end{array} +$$ + +Since we have $\begin{array} { r } { R _ { \alpha } ( \mu ( { x ^ { \prime } } ) \| \mu ( x ) ) = \sum _ { i } R _ { \alpha } ( \mu _ { i } ( { x _ { i } ^ { \prime } } ) \| \mu _ { i } ( x _ { i } ) ) } \end{array}$ . The constraint can be rewritten as + +$$ +\sum _ { i } | x _ { i } - x _ { i } ^ { \prime } | ^ { P } \leq \epsilon ^ { p } +$$ + +Forming the Lagrangian relaxation, we obtain + +$$ +\operatorname* { m a x } _ { x ^ { \prime } \colon | x _ { i } ^ { \prime } - x _ { i } | \leq \epsilon } \sum _ { i } R _ { \alpha } ( \mu _ { i } ( x _ { i } ^ { \prime } ) \| \mu _ { i } ( x _ { i } ) ) + \gamma \left( \sum _ { i } | x _ { i } ^ { \prime } - x _ { i } | ^ { p } - \epsilon ^ { p } \right) \ . +$$ + +where the constraint $| x _ { i } ^ { \prime } - x _ { i } | \leq \epsilon$ is implied by $\| x ^ { \prime } - x \| _ { p } \leq \epsilon$ . We can maximize separately over each $\boldsymbol { x } _ { i } ^ { \prime }$ to obtain + +$$ +- \gamma \epsilon ^ { p } + \sum _ { i } \operatorname* { m a x } _ { x _ { i } ^ { \prime } \in [ x _ { i } - \epsilon , x _ { i } + \epsilon ] } R _ { \alpha } ( \mu _ { i } ( x _ { i } ^ { \prime } ) \| \mu _ { i } ( x _ { i } ) ) + \gamma | x _ { i } ^ { \prime } - x _ { i } | ^ { p } . +$$ + +By weak duality, for any $\gamma \geq 0$ , this is an upper bound on Eq. 10. We can minimize this bound over $\gamma \geq 0$ to obtain the tightest bound. + +The minimization over $\boldsymbol { x } _ { i } ^ { \prime }$ for each $i$ can be solved in closed-form or via as simple 1-dimensional minimization problem for most smoothing measures. + +# A.4 PROOF OF THEOREM 1 + +For simplicity of exposition (and to avoid measure theoretic issues), we focus on the case where $\nu , \rho$ have well defined densities $\nu ( x ) , \rho ( x )$ such that $\rho ( x ) > 0$ whenever $\nu ( x ) > 0$ . + +We begin by rewriting the optimization problem in terms of the likelihood ratio $\begin{array} { r } { r ( X ) = \frac { \nu ( X ) } { \rho ( X ) } } \end{array}$ : We have + +$$ +\operatorname { \mathrm { ~ \underset { X \sim \nu } { E } ~ } } [ \phi ( X ) ] = \operatorname { \mathrm { ~ \underset { X \sim \rho } { E } ~ } } [ r ( X ) \phi ( X ) ] ~ , \quad D _ { f _ { i } } ( \rho | | \nu ) = \operatorname { \mathrm { ~ \underset { X \sim \rho } { E } ~ } } [ f _ { i } ( r ( X ) ) ] ~ , \quad \operatorname { \mathrm { ~ \underset { X \sim \rho } { E } ~ } } [ r ( X ) ] = 1 ~ , +$$ + +where the first two equalities follow directly by plugging in $\nu ( X ) = \rho ( X ) r ( X )$ and the third is obtained using the fact that $\nu$ is a probability measure. Using these relations, the optimization over $\nu$ can be rewritten as + +$$ +\begin{array} { r } { \underset { r \geq 0 } { \mathrm { m i n } } \underset { X \sim \rho } { \mathrm { E } } [ r ( X ) \phi ( X ) ] \qquad } \\ { \mathrm { s u b j e c t ~ t o } \underset { X \sim \rho } { \mathrm { E } } [ f _ { i } ( r ( X ) ) ] \leq \epsilon _ { i } , \quad \underset { X \sim \rho } { \mathrm { E } } [ r ( X ) ] = 1 \ , } \end{array} +$$ + +where $r \geq 0$ denotes that $r ( x ) \geq 0 \quad \forall x \in \mathcal { X }$ . The optimization over $r$ is a convex optimization problem and can be solved using Lagrangian duality as follows – we first dualize the constraints on $r$ to obtain + +$$ +\begin{array} { l } { \displaystyle \operatorname* { m i n } _ { r > 0 } \ \operatorname { E } _ { \gamma \to 0 } \big [ r ( X ) \phi ( X ) \big ] + \sum _ { i } \lambda _ { i } \bigg ( \underbrace { \mathrm { F } _ { \mathrm { f } } \left[ f _ { i } ( r ( X ) ) \right] - \epsilon } _ { X \sim \rho } \bigg ) + \kappa \bigg ( 1 - \underbrace { \mathrm { F } _ { \mathrm { c } } \left[ r ( X ) \right] } _ { X \sim \rho } \bigg ) } \\ { = \displaystyle \operatorname* { m i n } _ { r \ge 0 } \ \mathrm { E } _ { r \to 0 } \bigg [ r ( X ) \phi ( X ) + \sum _ { i } \lambda _ { i } f _ { i } ( r ( X ) ) - \kappa r ( X ) \bigg ] + \kappa - \sum _ { i } \lambda _ { i } \epsilon } \\ { = \kappa - \sum _ { i } \lambda _ { i } \epsilon _ { i } - \underbrace { \mathrm { F } } _ { X \sim \rho } \bigg [ \operatorname* { m a x } _ { r \to 0 } \kappa r - r \phi ( X ) - \sum _ { i } \lambda _ { i } f _ { i } ( r ) \bigg ] } \\ { = \kappa - \sum _ { i } \lambda _ { i } \epsilon _ { i } - \underbrace { \mathrm { ~ E } } _ { X \sim \rho } \bigg [ \operatorname* { m a x } _ { r \to 0 } \big ( r ( \kappa - \phi ( X ) ) - f _ { \lambda } ( r ) \big ) \bigg ] } \\ { = \kappa - \sum _ { i } \lambda _ { i } \epsilon _ { i } - \underbrace { \mathrm { ~ E } } _ { X \sim \rho } \bigg [ r \xi ( \kappa - \phi ( X ) ) \big ] \ . } \end{array} +$$ + +By strong duality, it holds that maximizing the final expression with respect to $\lambda \geq 0 , \kappa$ achieves the optimal value in Eq. 11. Thus, if the optimal value is smaller than 0, the specification is not robustly certified and if it is larger than 0, the specification is robustly certified. Finally, since we are ultimately interested in proving that the objective is non-negative, we can restrict ourselves to $\lambda \geq 0$ such that $\textstyle \sum _ { i } \lambda _ { i } = 1$ (since if the optimal $\lambda$ added up to something larger, we could simply rescale the values to add up to 1 and multiply $\kappa$ by the same scaling factor without changing the sign of the objective function). + +This concludes the proof of correctness of the certificate Eq. 6. + +# A.5 PROOF OF THEOREM 2 + +For the next result, we observe that when $\phi$ is ternary valued, the optimization over $\kappa , \lambda$ above can be written as + +$$ +\begin{array} { r l r } { { \stackrel { \mathrm { m a x } } { = } } } & { \displaystyle \operatorname* { m a x } _ { \kappa , \lambda \geq 0 } \kappa - \sum _ { i } \lambda _ { i } \epsilon _ { i } - \theta _ { a } f _ { \lambda } ^ { * } \big ( \kappa - 1 \big ) - \theta _ { b } f _ { \lambda } ^ { * } \big ( \kappa + 1 \big ) - \theta _ { c } f _ { \lambda } ^ { * } \big ( \kappa \big ) \ , } \\ & { } & \\ & { \displaystyle _ { \imath } = \mathbb { P } _ { X \sim \rho } [ \phi ( X ) = + 1 ] , \theta _ { b } = \mathbb { P } _ { X \sim \rho } [ \phi ( X ) = - 1 ] , \theta _ { c } = \mathbb { P } _ { X \sim \rho } [ \phi ( X ) = 0 ] . } \end{array} +$$ + +Writing out the expression for $f ^ { * }$ , we obtain + +$$ +\begin{array} { r l } & { \underset { \lambda \geq 0 , \kappa } { \mathrm { m a x ~ m i n } } \kappa - \displaystyle \sum _ { i } \lambda _ { i } \epsilon _ { i } - \theta _ { a } \Bigg ( ( \kappa - 1 ) \gamma _ { a } - \sum _ { i } \lambda _ { i } f _ { i } ( \gamma _ { a } ) \Bigg ) - \theta _ { b } \Bigg ( ( \kappa + 1 ) \gamma _ { b } - \sum _ { i } \lambda _ { i } f _ { i } ( \gamma _ { b } ) \Bigg ) } \\ & { \quad \quad \quad \quad \quad - \theta _ { c } \Bigg ( \kappa \gamma _ { c } - \sum _ { i } \lambda _ { i } f _ { i } ( \gamma _ { a } ) \Bigg ) } \\ & { = \underset { \gamma \geq 0 } { \mathrm { m i n } } \underset { \lambda \geq 0 , \kappa } { \mathrm { m a x } } \kappa \big ( 1 - \theta _ { a } \gamma _ { a } - \theta _ { b } \gamma _ { b } - \theta _ { c } \gamma _ { c } \big ) + \displaystyle \sum _ { i } \lambda _ { i } \Bigg ( \displaystyle \sum _ { y \in \{ a , b , c \} } \theta _ { y } f _ { i } ( \gamma _ { y } ) - \epsilon _ { i } \Bigg ) + \theta _ { a } \gamma _ { a } - \theta _ { b } \gamma _ { b } \ , } \end{array} +$$ + +where the second inequality follows from strong duality. The inner maximization is unbounded unless + +$$ +\sum _ { y \in \{ a , b , c \} } \gamma _ { y } \theta _ { y } = 1 , \quad \sum _ { y \in \{ a , b , c \} } \theta _ { y } f _ { i } ( \gamma _ { y } ) \leq \epsilon _ { i } . +$$ + +One thing to note is that, we can rewrite these constraints in terms of $\zeta = \theta \odot \gamma$ , i.e. $\zeta _ { y } = \theta _ { y } \gamma _ { y }$ for $y \in \{ a , b , c \}$ . These constraints ensure that $\zeta$ is a probability distribution over $\{ + 1 , 0 , - 1 \}$ and furthermore + +$$ +\sum _ { y \in \{ a , b , c \} } \theta _ { y } f _ { i } ( \gamma _ { y } ) = D _ { f _ { i } } ( \zeta \| \theta ) . +$$ + +Thus, the second constraint above is equivalent to $D _ { f _ { i } } ( \zeta \| \theta ) \leq \epsilon _ { i }$ . Writing the optimization problem in terms of $\zeta$ , we obtain + +$$ +\begin{array} { r c l } { \displaystyle \operatorname* { m i n } _ { \zeta _ { a } , \zeta _ { b } , \zeta _ { c } \geq 0 } } & { \zeta _ { a } - \zeta _ { b } } \\ { \mathrm { s u b j e c t ~ t o } D _ { f _ { i } } ( \zeta \| \theta ) \leq \epsilon _ { i } } & { i = 1 , \ldots , M } \\ { \displaystyle \zeta _ { a } + \zeta _ { b } + \zeta _ { c } = 1 } & { . } \end{array} +$$ + +# A.6 CLOSED-FORM CERTIFICATES FOR THE INFORMATION-LIMITED SETTING + +In this section we present closed-form certificates for the information-limited setting which can be derived from Theorem 2 for $M = 1$ . The results are summarized in Table 4. In the next subsections we present the derivation of the certificates for Hockey-Stick and Renyi divergences. The certificates ´ for the KL and infinite Renyi divergence can be derived by taking limits of the R ´ enyi certificate (as ´ $\alpha 1 , \infty$ respectively). + +# A.6.1 CALCULATION OF CERTIFICATE FOR HOCKEY-STICK DIVERGENCE + +The function $f ( u ) = \mathrm { m a x } ( u - \beta , 0 ) - \mathrm { m a x } ( 1 - \beta , 0 )$ is a convex function with $f ( 1 ) = 0$ . Then, we have + +$$ +\begin{array} { r l r } & { } & { f _ { \lambda } ^ { * } ( u ) = \underset { v \geq 0 } { \operatorname* { m a x } } \left( u v - \lambda \operatorname* { m a x } ( v - \beta , 0 ) \right) + \lambda \operatorname* { m a x } ( 1 - \beta , 0 ) } \\ & { } & { \quad = \left\{ \begin{array} { l l } { \operatorname* { m a x } ( \beta u , 0 ) + \lambda \operatorname* { m a x } ( 1 - \beta , 0 ) \quad } & { \mathrm { ~ i f ~ } u \leq \lambda \mathrm { ~ , ~ } } \\ { \infty \quad } & { \mathrm { ~ i f ~ } u > \lambda \mathrm { ~ . ~ } } \end{array} \right. } \end{array} +$$ + +Table 4: Certificates for various $f$ -divergences for the information-limited setting. Note that the Renyi ´ divergences are not proper $f$ -divergences, but are defined as $\begin{array} { r } { R _ { \alpha } ( \nu \| \rho ) = \frac { \breve { 1 } } { \alpha - 1 } \log ( 1 + D _ { f } ( \nu \| \rho \breve { ) } ) } \end{array}$ . The infinite Renyi divergence, defined as ´ $\begin{array} { r } { \operatorname* { s u p } _ { x } \log ( \nu ( x ) / \rho ( x ) ) } \end{array}$ , is obtained by taking the limit $\alpha \to \infty$ . All certificates depend on the gap between $\theta _ { a }$ and $\theta _ { b }$ . Notation: $[ u ] _ { + } = \operatorname* { m a x } ( u , 0 )$ . + +
Divergence constraintf(u)Certificate
KL divergenceKL(νllρ)≤∈κLulog(u)∈KL≤-log(1-(√θa-√6)²)
Rényi divergences (α ≥ 0)Ra(vllp)≤∈r,αsign(a - 1)(uα - 1)∈R,a≤-log(1-0a-0b+2n)n=((1-+(1-a)()2
Infinite Renyi divergenceRo(vllp)≤∈R,∞∈R,∞≤-log(1-(0a-0b))
Hockey-stick divergences (β ≥ 0)DHS,β(vllp)≤HS,β[u- β]+-[1-β]+€Hs,β≤β(0a-06)-1β-112土
+ +The certificate given by Eq. 6 in Theorem 1 for this divergence in the case of a smoothed hard classifier takes the form + +$$ +\operatorname* { m a x } _ { \kappa \in \mathbb { R } , \lambda \geq 0 } \left( \kappa - \operatorname { \mathrm { ~ E ~ } } _ { X \sim \rho } [ f _ { \lambda } ^ { * } ( \kappa - \phi ( X ) ) ] \right) - \lambda \epsilon \geq 0 \mathrm { ~ , ~ } +$$ + +where the specification takes the values + +$$ +\phi ( X ) = \left\{ \begin{array} { l l } { { + 1 } } & { { \quad \mathrm { w . p . ~ } \theta _ { a } ~ , } } \\ { { - 1 } } & { { \quad \mathrm { w . p . ~ } \theta _ { b } ~ , } } \\ { { 0 } } & { { \quad \mathrm { w . p . ~ } 1 - \theta _ { a } - \theta _ { b } ~ . } } \end{array} \right. +$$ + +Plugging in the expression for $f ^ { * }$ the objective function above takes the form + +$$ +\kappa - \beta \big ( \theta _ { a } [ \kappa - 1 ] _ { + } + \theta _ { b } [ \kappa + 1 ] _ { + } + ( 1 - \theta _ { a } - \theta _ { b } ) [ \kappa ] _ { + } \big ) - \lambda ( \epsilon + \operatorname* { m a x } ( 1 - \beta , 0 ) ) ~ , +$$ + +where we use the notation $[ u ] _ { + } = \operatorname* { m a x } ( u , 0 )$ and assumed the constraints $\kappa \leq \lambda - 1$ since the objective is $- \infty$ otherwise. If $\beta \leq 1$ , the objective is increasing monotonically in $\kappa$ , so the optimal value is to set $\kappa$ to its upper bound $\lambda - 1$ . Plugging this in, the possible values of the derivative with respect to $\lambda$ are + +$$ +\begin{array} { r } { \left\{ \begin{array} { l l } { \beta ( 1 - \theta _ { b } ) - \epsilon \quad } & { \mathrm { i f ~ 0 \leq \lambda < 1 ~ } , } \\ { \beta \theta _ { a } - \epsilon \quad } & { \mathrm { i f ~ 1 < \lambda < 2 ~ } , } \\ { - \epsilon \quad } & { \mathrm { i f ~ } \lambda > 2 . } \end{array} \right. } \end{array} +$$ + +Thus, if $\epsilon \leq \beta \theta _ { a }$ , the maximum is attained at 2, if $\beta \theta _ { a } \le \epsilon \le \beta ( 1 - \theta _ { b } )$ , the maximum is attained at 1, else the maximum is attained at 0, leading to the certificate: + +$$ +\begin{array} { r } { \left\{ \begin{array} { l l } { - 1 } & { \mathrm { i f } \epsilon \geq \beta ( 1 - \theta _ { b } ) , } \\ { \beta ( 1 - \theta _ { b } ) - \epsilon - 1 } & { \mathrm { i f } \beta \theta _ { a } \leq \epsilon \leq \beta ( 1 - \theta _ { b } ) , } \\ { \beta ( 1 + ( \theta _ { a } - \theta _ { b } ) ) - 2 \epsilon - 1 } & { \mathrm { i f } \epsilon \leq \beta \theta _ { a } . } \end{array} \right. , } \end{array} +$$ + +Thus, the certificate is non-negative only if + +$$ +\epsilon \le \operatorname* { m a x } \left( \frac { \beta ( 1 + ( \theta _ { a } - \theta _ { b } ) ) - 1 } { 2 } , 0 \right) \ . +$$ + +The case $\beta \geq 1$ can be worked out similarly, leading to + +$$ +\epsilon \le \operatorname* { m a x } \biggl ( \frac { \beta ( - 1 + ( \theta _ { a } - \theta _ { b } ) ) + 1 } { 2 } , 0 \biggr ) . +$$ + +The two cases can be combined as + +$$ +\epsilon \leq \operatorname* { m a x } \mathopen { } \mathclose \bgroup \left( \frac { \beta ( \theta _ { a } - \theta _ { b } ) - | \beta - 1 | } { 2 } , 0 \aftergroup \egroup \right) ~ . +$$ + +# A.6.2 CALCULATION OF CERTIFICATE FOR RENYI DIVERGENCE ´ + +We consider the cases $\alpha \geq 1$ and $\alpha \leq 1$ separately. + +Case 1 $( \alpha \geq 1 )$ ) If $\alpha \geq 1$ , the function $f ( u ) = \left( u ^ { \alpha } - 1 \right)$ is a convex function with $f ( 1 ) = 0$ . Then, we have + +$$ +\begin{array} { r l } & { f _ { \lambda } ^ { * } ( u ) = \underset { v \geq 0 } { \operatorname* { m a x } } u v - \lambda ( v ^ { \alpha } - 1 ) = \{ \lambda \atop \lambda + \lambda ( \alpha - 1 ) ( \frac { u } { \lambda \alpha } ) ^ { \frac { \alpha } { \alpha - 1 } } } \quad \quad \mathrm { i f } u \leq 0 \\ & { \quad \quad = \lambda + \lambda ( \alpha - 1 ) ( \frac { \operatorname* { m a x } ( u , 0 ) } { \lambda \alpha } ) ^ { \frac { \alpha } { \alpha - 1 } } \ . } \end{array} +$$ + +Suppose we have a bound on the Renyi divergence ´ $R _ { \alpha } ( \nu \| \rho ) \leq \epsilon$ . Then we know $D _ { f } ( \nu \| \rho ) \leq$ $\mathrm { e x p } \bar { ( } ( \alpha - 1 ) \epsilon ) - 1$ . Let $\begin{array} { r } { \beta = \frac { \alpha } { \alpha - 1 } } \end{array}$ and + +$$ +B = \theta _ { a } ( \operatorname* { m a x } ( 0 , \kappa - 1 ) ) ^ { \beta } + \theta _ { b } ( \operatorname* { m a x } ( 0 , \kappa + 1 ) ) ^ { \beta } + ( 1 - \theta _ { a } - \theta _ { b } ) ( \operatorname* { m a x } ( 0 , \kappa ) ) ^ { \beta } \ . +$$ + +Then the certificate Eq. 6 simplifies to (after some algebra) + +$$ +\operatorname* { m a x } _ { \lambda \ge 0 , \kappa } \kappa - \lambda \exp ( ( \alpha - 1 ) \epsilon ) - B \lambda ^ { 1 - \beta } \frac { ( \alpha - 1 ) } { \alpha ^ { \beta } } . +$$ + +Setting the derivative with respect to $\lambda$ to $0$ and solving for $\lambda$ , we obtain + +$$ +\lambda = \frac { 1 } { \alpha } \left( \frac { B } { \exp ( ( \alpha - 1 ) \epsilon ) } \right) ^ { \left( \frac { 1 } { \beta } \right) } \ , +$$ + +and the optimal certificate reduces to + +$$ +\operatorname* { m a x } _ { \kappa } \kappa - B ^ { \frac { 1 } { \beta } } \exp \biggl ( \frac { \epsilon } { \beta } \biggr ) . +$$ + +For this number to be positive, we need that $\kappa \geq 0$ and + +$$ +\frac { \kappa } { B ^ { \frac { 1 } { \beta } } } \geq \exp \left( \frac { \epsilon } { \beta } \right) . +$$ + +The LHS above evaluates to + +$$ +\Big ( \theta _ { a } \operatorname* { m a x } ( 0 , 1 - \gamma ) ^ { \beta } + \theta _ { b } \operatorname* { m a x } ( 0 , 1 + \gamma ) ^ { \beta } + 1 - \theta _ { a } - \theta _ { b } \Big ) ^ { - \frac { 1 } { \beta } } \ . +$$ + +where $\begin{array} { r } { \gamma = \frac { 1 } { \kappa } \geq 0 } \end{array}$ . Maximizing this expression with respect to $\gamma$ , we obtain + +$$ +\gamma = \frac { \theta _ { a } ^ { \alpha - 1 } - \theta _ { b } ^ { \alpha - 1 } } { \theta _ { a } ^ { \alpha - 1 } + \theta _ { b } ^ { \alpha - 1 } } \mathrm { ~ , ~ } +$$ + +so that the certificate reduces to + +$$ +\left( 2 ^ { \beta } \theta _ { a } \theta _ { b } \bigl ( \theta _ { a } ^ { \alpha - 1 } + \theta _ { b } ^ { \alpha - 1 } \bigr ) ^ { \left( - \frac { 1 } { \alpha - 1 } \right) } + 1 - \theta _ { a } - \theta _ { b } \right) ^ { \left( \frac { 1 } { \beta } \right) } \geq \exp \left( \frac { \epsilon } { \beta } \right) \ . +$$ + +Taking logarithms now gives the result. + +Case 2 $0 \leq \alpha \leq 1 \}$ ) When $0 \leq \alpha \leq 1$ , the function $f ( u ) = \left( 1 - u ^ { \alpha } \right)$ is a convex function with $f ( 1 ) = 0$ . Then, we have + +$$ +f _ { \lambda } ^ { * } ( u ) = \operatorname* { m a x } _ { v \geq 0 } u v - \lambda ( 1 - v ^ { \alpha } ) = \left\{ \begin{array} { l l } { - \lambda + \lambda ^ { \frac { 1 } { 1 - \alpha } } ( 1 - \alpha ) { \left( \frac { - u } { \alpha } \right) } ^ { \left( - \frac { \alpha } { 1 - \alpha } \right) } } & { \mathrm { ~ i f ~ } u \leq 0 } \\ { \infty } & { \mathrm { ~ o t h e r w i s e ~ . } } \end{array} \right. +$$ + +Further, a bound $R _ { \alpha } ( \nu \| \rho ) \leq \epsilon$ implies + +$$ +D _ { f } ( \nu \vert \vert \rho ) \leq 1 - \exp ( ( \alpha - 1 ) \epsilon ) . +$$ + +Then the certificate from Eq. 6 reduces to + +$$ +\operatorname* { m a x } _ { \cdot , \lambda \geq 0 } \kappa + \lambda \exp ( ( \alpha - 1 ) \epsilon ) - ( 1 - \alpha ) \lambda ^ { \frac { 1 } { 1 - \alpha } } \alpha ^ { \frac { \alpha } { 1 - \alpha } } \Big ( \theta _ { a } ( 1 - \kappa ) ^ { - \frac { \alpha } { 1 - \alpha } } + \theta _ { b } ( - 1 - \kappa ) ^ { - \frac { \alpha } { 1 - \alpha } } + \theta _ { c } ( - \kappa ) ^ { - \frac { \alpha } { 1 - \alpha } } \Big ) +$$ + +with the constraint $\kappa \leq - 1$ (otherwise the certificate is $- \infty ,$ ). Setting the derivative with respect to $\lambda$ to 0 and solving for $\lambda$ , we obtain + +$$ +\lambda = \frac { \exp \big ( ( \alpha - 1 ) \epsilon \big ( \frac { 1 - \alpha } { \alpha } \big ) \big ) } { \alpha \omega } \mathrm { ~ , ~ } +$$ + +where + +$$ +\omega = \left( \theta _ { a } ( 1 - \kappa ) ^ { - \frac { \alpha } { 1 - \alpha } } + \theta _ { b } ( - 1 - \kappa ) ^ { - \frac { \alpha } { 1 - \alpha } } + \theta _ { c } ( - \kappa ) ^ { - \frac { \alpha } { 1 - \alpha } } \right) ^ { \left( \frac { 1 - \alpha } { \alpha } \right) } \ . +$$ + +$\begin{array} { r } { \beta = \frac { \alpha } { 1 - \alpha } } \end{array}$ + +$$ +\kappa + \frac { \exp \Bigl ( - \frac { \epsilon } { \beta } \Bigr ) } { \omega } \ . +$$ + +For this number to be positive, we require that + +$$ +\frac { 1 } { \not { p } - \kappa \omega } \geq \exp \left( \frac { \epsilon } { \beta } \right) . +$$ + +The LHS of the above expression evaluates to + +$$ +\left( \theta _ { a } \bigl ( 1 + \gamma \bigr ) ^ { ( - \beta ) } + \theta _ { b } \bigl ( 1 - \gamma \bigr ) ^ { ( - \beta ) } + 1 - \theta _ { a } - \theta _ { b } \right) ^ { \left( \frac { - 1 } { \beta } \right) } \ , +$$ + +where $\begin{array} { r } { \gamma = - \frac { 1 } { \kappa } } \end{array}$ . Maximizing this expression over $\gamma \in [ 0 , 1 ]$ , we obtain the final certificate to be + +$$ +\left( 1 - \theta _ { a } - \theta _ { b } + 2 \left( \frac { \theta _ { a } ^ { 1 - \alpha } + \theta _ { b } ^ { 1 - \alpha } } { 2 } \right) ^ { \left( \frac { 1 } { 1 - \alpha } \right) } \right) ^ { \left( - \frac { 1 } { \beta } \right) } \ge \exp \left( \frac { \epsilon } { \beta } \right) \ . +$$ + +Taking logarithms, we obtain + +$$ +\epsilon \leq - \log \left( 1 - \theta _ { a } - \theta _ { b } + 2 \bigg ( \frac { \theta _ { a } ^ { 1 - \alpha } + \theta _ { b } ^ { 1 - \alpha } } { 2 } \bigg ) ^ { \left( \frac { 1 } { 1 - \alpha } \right) } \right) \ . +$$ + +A.7 INFORMATION-LIMITED ROBUST CERTIFICATION AND TIGHT RELAXATIONS + +# A.7.1 PROOF OF THEOREM 4 + +At a high level, the proof shows that, in the information-limited case, to achieve robust certification under an arbitrary set of constraints $\mathcal { D }$ it suffices to know the “envelope” of $\mathcal { D }$ with respect to all hockey-stick divergences of order $\beta \geq 0$ , i.e. the function $\beta \mapsto \operatorname* { m a x } _ { \nu \in \mathcal { D } } D _ { \mathrm { H S } , \beta } ( \nu \| \rho )$ captures all the necessary information to provide information-limited robust certification with respect to $\mathcal { D }$ . + +We start by considering the following optimization problem: + +$$ +\begin{array} { r l } { \underset { \Psi : \mathcal { X } \mapsto \{ - 1 , 0 , + 1 \} , \nu \in \mathcal { D } } { \mathrm { m i n } } \underset { X \sim \nu } { \mathrm { E } } [ \Psi ( X ) ] } & { } \\ { \mathrm { s u b j e c t ~ t o ~ } \underset { X \sim \rho } { \mathrm { E } } [ 1 [ \Psi ( X ) = + 1 ] ] \geq \theta _ { a } } & { , } \\ { \underset { X \sim \rho } { \mathrm { E } } [ 1 [ \Psi ( X ) = - 1 ] ] \leq \theta _ { b } } & { . } \end{array} +$$ + +In the information-limited setting, this problem attains the minimum expected value over $\phi \in S$ . +Here $1 [ \phi ( X ) = 1 ]$ denotes the indicator function. + +It will be convenient to write this in a slightly different form: Rather than looking at the outputs of $\Psi$ as the $+ 1 , 0 , - 1$ , we look at them as vectors in $\mathbb { R } ^ { 3 }$ : + +$$ +\mathcal { Z } = \left\{ \left( 0 \atop 0 \right) , \left( 1 \atop 0 \right) , \left( 0 \atop 1 \right) \right\} +$$ + +and define + +$$ +{ \bf a } = \left( \begin{array} { l } { { 1 } } \\ { { 0 } } \\ { { - 1 } } \end{array} \right) , { \bf a } _ { + } = \left( \begin{array} { l } { { 1 } } \\ { { 0 } } \\ { { 0 } } \end{array} \right) , { \bf a } _ { - } = \left( \begin{array} { l } { { 0 } } \\ { { 0 } } \\ { { 1 } } \end{array} \right) . +$$ + +Then, we can write the optimization problem Eq. 12 equivalently as + +$$ +\begin{array} { r l } & { \underset { \Psi : \mathcal { X } \mapsto \mathcal { Z } , \nu \in \mathcal { D } } { \mathrm { m i n } } \underset { X \sim \nu } { \mathrm { E } } \big [ \mathbf { a } ^ { T } \Psi ( X ) \big ] } \\ & { \quad \mathrm { s u b j e c t ~ t o ~ } \underset { X \sim \rho } { \mathrm { E } } \big [ \mathbf { a } _ { + } { } ^ { T } \Psi ( X ) \big ] \geq \theta _ { a } ~ , } \\ & { \qquad \underset { X \sim \rho } { \mathrm { E } } \big [ \mathbf { a } _ { - } { } ^ { T } \Psi ( X ) \big ] \leq \theta _ { b } ~ . } \end{array} +$$ + +We first consider the minimization over $\Psi$ for a fixed value of $\nu$ . We begin by observing that since the objective is linear, the optimization over $\Psi$ can be replaced with the optimization over the convex hull of the set of $\Psi$ that satisfy the constraints (Bubeck, 2013). Since each input $x \in \mathcal { X }$ can be mapped independently of the rest, the convex hull is simply the cross product of the convex hull at every $x$ , to obtain the constraint set + +$$ +\left\{ \Psi : \mathcal { X } \mapsto \mathcal { P } ( \mathcal { Z } ) \mathrm { ~ s u c h ~ t h a t ~ } \underset { X \sim \rho } { \mathrm { E } } \big [ \mathbf { a } _ { + } ^ { T } \Psi ( X ) \big ] \geq \theta _ { a } , \underset { X \sim \rho } { \mathrm { E } } \big [ \mathbf { a } _ { - } ^ { T } \Psi ( X ) \big ] \leq \theta _ { b } \right\} \ . +$$ + +Therefore, the optimization problem reduces to + +$$ +\begin{array} { r l } & { \underset { \Psi : \mathcal K \mapsto \mathcal P ( \mathcal Z ) } { \mathrm { m i n } } \underset { X \sim \nu } { \mathrm { E } } \big [ \mathbf a ^ { T } \Psi ( X ) \big ] } \\ & { \mathrm { s u b j e c t ~ t o ~ } \underset { X \sim \rho } { \mathrm { E } } \big [ \mathbf a _ { + } { } ^ { T } \Psi ( X ) \big ] \geq \theta _ { a } ~ , } \\ & { \qquad \underset { X \sim \rho } { \mathrm { E } } \big [ \mathbf a _ { - } { } ^ { T } \Psi ( X ) \big ] \leq \theta _ { b } ~ . } \end{array} +$$ + +This is a convex optimization problem in $\Psi$ . Denote + +$$ +r ( X ) = \frac { \nu ( X ) } { \rho ( X ) } \ . +$$ + +Considering the dual of this optimization problem with respect to the optimization variable $\Psi$ , we obtain + +$$ +\begin{array} { r l } & { \underset { \Psi } { \mathop { \operatorname* { m i n } } } \underset { X \sim \rho } { \mathrm { ~ \cal { E } ~ } } \big [ \mathbf { a } ^ { T } \Psi ( X ) r ( X ) \big ] - \lambda _ { a } \bigg ( \underset { X \sim \rho } { \mathrm { ~ \cal { E } ~ } } \big [ \mathbf { a } _ { + } { } ^ { T } \Psi ( X ) \big ] - \theta _ { a } \bigg ) + \lambda _ { b } \bigg ( \underset { X \sim \rho } { \mathrm { ~ \cal { E } ~ } } \big [ \mathbf { a } _ { - } { } ^ { T } \Psi ( X ) \big ] - \theta _ { b } \bigg ) } \\ & { = \underset { \Psi } { \mathop { \operatorname* { m i n } } } \lambda _ { a } \theta _ { a } - \lambda _ { b } \theta _ { b } + \underset { X \sim \rho } { \mathrm { ~ \cal { E } ~ } } \Big [ ( r ( X ) \mathbf { a } - \lambda _ { a } \mathbf { a } _ { + } + \lambda _ { b } \mathbf { a } _ { - } ) ^ { \top } \Psi ( X ) \Big ] } \\ & { = \underset { \Psi } { \mathop { \operatorname* { m i n } } } \lambda _ { a } \theta _ { a } - \lambda _ { b } \theta _ { b } + \underset { X \sim \rho } { \mathrm { ~ \cal { E } ~ } } \left[ \binom { r ( X ) - \lambda _ { a } } { - r ( X ) + \lambda _ { b } } ^ { T } \Psi ( X ) \right] \ . } \end{array} +$$ + +Since we can choose $\Psi ( x )$ independently for each $x \in \mathcal { X }$ , we can minimize each term in the expectation independently to obtain + +$$ +\operatorname* { m i n } _ { \Psi ( x ) \in \mathcal { P } ( \mathcal { Z } ) } { \binom { r ( x ) - \lambda _ { a } } { r ( x ) + \lambda _ { b } } } ^ { T } \Psi ( x ) = \operatorname* { m i n } ( r ( x ) - \lambda _ { a } , 0 , - r ( x ) + \lambda _ { b } ) . +$$ + +This implies that the Lagrangian evaluates to + +$$ +\lambda _ { a } \theta _ { a } - \lambda _ { b } \theta _ { b } + \underbrace { \mathrm { ~ E ~ } } _ { X \sim \rho } [ \mathrm { m i n } ( r ( X ) - \lambda _ { a } , 0 , r ( X ) + \lambda _ { b } ) ] \ . +$$ + +We now consider two cases: + +Case 1 $( \lambda _ { a } \ge \lambda _ { b } \ge 0 )$ ) In this case, we can see that + +$$ +\begin{array} { r l } & { \operatorname* { m i n } ( r ( X ) - \lambda _ { a } , 0 , - r ( X ) + \lambda _ { b } ) = \operatorname* { m i n } ( r ( X ) - \lambda _ { a } , 0 ) + \operatorname* { m i n } ( - r ( X ) + \lambda _ { b } , 0 ) } \\ & { = r ( X ) - \lambda _ { a } - \operatorname* { m a x } ( r ( X ) - \lambda _ { a } , 0 ) - \operatorname* { m a x } ( r ( X ) - \lambda _ { b } , 0 ) \ . } \end{array} +$$ + +Then, the Lagrangian reduces to + +$$ +\begin{array} { r l } & { \underset { \mathbf { \theta } } { \mathrm { \mathop { A } } } a \theta _ { a } - \lambda _ { b } \theta _ { b } + \underset { X \sim \rho } { \mathrm { \mathop { F } } } [ r ( X ) - \lambda _ { a } ] - \underset { X \sim \rho } { \mathrm { \mathop { F } } } [ \operatorname* { m a x } ( r ( X ) - \lambda _ { a } , 0 ) ] - \underset { X \sim \rho } { \mathrm { \mathop { F } } } [ \operatorname* { m a x } ( r ( X ) - \lambda _ { b } , 0 ) ] } \\ & { = 1 - \lambda _ { a } ( 1 - \theta _ { a } ) - \lambda _ { b } \theta _ { b } - ( D _ { \mathrm { H S } , \lambda _ { a } } ( \nu \| \rho ) + \operatorname* { m a x } ( 1 - \lambda _ { a } , 0 ) ) - ( D _ { \mathrm { H S } , \lambda _ { b } } ( \nu \| \rho ) + \operatorname* { m a x } ( 1 - \lambda _ { b } , 0 ) ) } \end{array} +$$ + +Case 2 $( \lambda _ { b } \ge \lambda _ { a } \ge 0 )$ ) In this case, we can see that + +$$ +\begin{array} { l } { \operatorname* { m i n } ( r ( X ) - \lambda _ { a } , 0 , - r ( X ) + \lambda _ { b } ) = \operatorname* { m i n } ( r ( X ) - \lambda _ { a } , - r ( X ) + \lambda _ { b } ) } \\ { = r ( X ) - \lambda _ { a } + 2 \operatorname* { m i n } \biggr ( 0 , \frac { \lambda _ { a } + \lambda _ { b } } { 2 } - r ( X ) \biggr ) } \\ { = r ( X ) - \lambda _ { a } - 2 \operatorname* { m a x } \biggr ( r ( X ) - \frac { \lambda _ { a } + \lambda _ { b } } { 2 } , 0 \biggr ) \ . } \end{array} +$$ + +Then, the Lagrangian reduces to + +$$ +\begin{array} { r l } & { \lambda _ { a } \theta _ { a } - \lambda _ { b } \theta _ { b } + \underset { X \sim \rho } { \mathrm { E } } [ r ( X ) - \lambda _ { a } ] - 2 \underset { X \sim \rho } { \mathrm { E } } \bigg [ \operatorname* { m a x } \bigg ( r ( X ) - \frac { \lambda _ { a } + \lambda _ { b } } { 2 } , 0 \bigg ) \bigg ] } \\ & { = 1 - \lambda _ { a } ( 1 - \theta _ { a } ) - \lambda _ { b } \theta _ { b } - 2 \bigg ( D _ { \mathrm { H S } , \frac { \lambda _ { a } + \lambda _ { b } } { 2 } } ( \nu \| \rho ) + \operatorname* { m a x } \bigg ( 1 - \frac { \lambda _ { a } + \lambda _ { b } } { 2 } , 0 \bigg ) \bigg ) \ . } \end{array} +$$ + +We know that $1 - \theta _ { a } \ge \theta _ { b }$ and $\lambda _ { b } \geq \lambda _ { a }$ . If $\lambda _ { b } > \lambda _ { a }$ , by choosing $\lambda _ { a } ^ { \prime } = \lambda _ { a } + \kappa$ and $\lambda _ { b } ^ { \prime } = \lambda _ { b } - \kappa$ for some small $\kappa > 0$ , we know that the the sum of the first three terms would reduce while the final term would remain unchanged. Thus, at the the optimum in this case, we can assume $\lambda _ { a } = \lambda _ { b }$ and we obtain + +$$ +1 - \lambda _ { a } ( 1 - \theta _ { a } ) - \lambda _ { a } \theta _ { b } - 2 ( D _ { \mathrm { H S } , \lambda _ { a } } ( \nu \| \rho ) + \operatorname* { m a x } ( 1 - \lambda _ { a } , 0 ) ) \ . +$$ + +Final analysis of the Lagrangian Combining the two cases we can write the dual problem as + +$$ +\begin{array} { r l } & { \underset { \lambda _ { a } \geq \lambda _ { b } \geq 0 } { \operatorname* { m a x } } 1 - \lambda _ { a } ( 1 - \theta _ { a } ) - \lambda _ { b } \theta _ { b } - ( D _ { \mathrm { H S } , \lambda _ { a } } ( \nu \| \rho ) + \operatorname* { m a x } ( 1 - \lambda _ { a } , 0 ) ) } \\ & { } \\ & { \quad \quad - \left( D _ { \mathrm { H S } , \lambda _ { b } } ( \nu \| \rho ) + \operatorname* { m a x } ( 1 - \lambda _ { b } , 0 ) \right) . } \end{array} +$$ + +By strong duality, the optimal value of the above problem precisely matches the optimal value of Eq. 14 (and hence Eq. 12). Thus, information limited robust certification with respect to $\mathcal { D }$ holds if and only if Eq. 15 has a non-negative optimal value for each $\nu \in \mathcal { D }$ . Since we have that + +$$ +\operatorname* { m a x } _ { \nu \in \mathcal { D } } D _ { \mathrm { H S } , \lambda _ { a } } ( \nu \| \rho ) = \epsilon _ { \lambda _ { a } } , \ : \ : \ : \operatorname* { m a x } _ { \nu \in \mathcal { D } } D _ { \mathrm { H S } , \lambda _ { b } } ( \nu \| \rho ) = \epsilon _ { \lambda _ { b } } , +$$ + +information-limited robust certification holds if and only if the optimal value of + +$$ +\operatorname* { m a x } _ { \lambda _ { a } \ge \lambda _ { b } \ge 0 } 1 - \lambda _ { a } ( 1 - \theta _ { a } ) - \lambda _ { b } \theta _ { b } - ( \epsilon _ { \lambda _ { a } } + \operatorname* { m a x } ( 1 - \lambda _ { a } , 0 ) ) - ( \epsilon _ { \lambda _ { b } } + \operatorname* { m a x } ( 1 - \lambda _ { b } , 0 ) ) +$$ + +is non-negative. Further, since the optimal value only depended on the value of $D _ { \mathrm { H S } , \beta } ( \nu \| \rho )$ for $\beta \geq 0$ , it is equivalent to information-limited robust certification with respect to $\mathcal { D } _ { \mathrm { H S } }$ . + +The above argument also shows that in this case, information-limited robust certification with respect to $\mathcal { D }$ is equivalent to requiring that the following convex optimization problem has a non-negative optimal value: + +$$ +\operatorname * { m a x } _ { \lambda _ { a } \ge \lambda _ { b } \ge 0 } ~ 1 - \lambda _ { a } ( 1 - \theta _ { a } ) - \lambda _ { b } \theta _ { b } - \left( \epsilon _ { \lambda _ { a } } + [ 1 - \lambda _ { a } ] _ { + } \right) - \left( \epsilon _ { \lambda _ { b } } + [ 1 - \lambda _ { b } ] _ { + } \right) ~ . +$$ + +Let $\lambda _ { a } ^ { * } , \lambda _ { b } ^ { * }$ be the optimal values attained. Since this certificate depends only on the value of two Hockey-stick divergences at $\lambda _ { a } ^ { * } , \lambda _ { b } ^ { * }$ , it must coincide with the application of theorem 2 to the constraint set ${ \mathcal { D } } _ { \mathrm { H S } }$ defined by constraints on these hockey-stick divergences (as we know that 2 computes the optimal certificate for any constraint set defined only by a set of f-divergences). This observation completes the proof. + +Theorem 4 gives us the optimal limited-information certificate problem provided that we can compute + +$$ +\operatorname* { m a x } _ { x ^ { \prime } : d ( x , x ^ { \prime } ) \leq \epsilon } D _ { \mathrm { H S } , \beta } ( \mu ( x ^ { \prime } ) | | \mu ( x ) ) +$$ + +for each $\beta \geq 0$ . In particular, when $\mu$ is a Gaussian measure $\mu ( x ) = \mathcal { N } \big ( x , \sigma ^ { 2 } I \big )$ , we can leverage the following result from Balle & Wang (2018). + +Lemma 6. Let $\Psi _ { g }$ be the CDF of a standard normal random variable $\mathcal { N } ( 0 , 1 )$ . For any $\beta \geq 0$ and $\boldsymbol { x } \in \mathbb { R } ^ { d }$ we have + +$$ +\operatorname* { m a x } _ { \substack { \tau _ { * } \Vert x - x ^ { \prime } \Vert _ { 2 } \leq \epsilon } } D _ { \mathrm { H S , \beta } } ( \mu ( x ^ { \prime } ) \Vert \mu ( x ) ) = \Psi _ { g } \left( \frac { \epsilon } { 2 \sigma } - \frac { \log ( \beta ) \sigma } { 2 \epsilon } \right) - \beta \Psi _ { g } \left( - \frac { \epsilon } { 2 \sigma } - \frac { \log ( \beta ) \sigma } { 2 \epsilon } \right) - [ 1 - \beta ] _ { + } \ . +$$ + +Applying Eq. 17 to the expression in Lemma 6 proves Corollary 5. + +Proof of Corollary 5. With the notation from Theorem 4 we have, for $\beta \geq 0$ , + +$$ +\epsilon _ { \beta } = \Psi _ { g } \bigg ( \frac { \epsilon } { 2 \sigma } - \frac { \log ( \beta ) \sigma } { 2 \epsilon } \bigg ) - \beta \Psi _ { g } \bigg ( - \frac { \epsilon } { 2 \sigma } - \frac { \log ( \beta ) \sigma } { 2 \epsilon } \bigg ) - \operatorname* { m a x } ( 1 - \beta , 0 ) . +$$ + +Plugging this expression into Eq. 17 allows us to verify information-limited robust certification of $\mathcal { N } ( \breve { x ^ { \prime } } , \sigma ^ { \top } I )$ with respect to $\mathcal { D } _ { x , \epsilon } \overset { \cdot } { = } \{ \mathcal { N } \big ( x ^ { \prime } , \sigma ^ { 2 } I \big ) : \| x - x ^ { \prime } \| _ { 2 } \leq \epsilon \}$ by solving + +$$ +\begin{array} { r l } & { \displaystyle \operatorname* { m a x } _ { \lambda _ { a } \ge \lambda _ { b } \ge 0 } 1 - \lambda _ { a } ( 1 - \theta _ { a } ) - \lambda _ { b } \theta _ { b } } \\ & { \displaystyle - \left( \Psi _ { g } \left( \frac { \epsilon } { 2 \sigma } - \frac { \log ( \lambda _ { a } ) \sigma } { 2 \epsilon } \right) - \lambda _ { a } \Psi _ { g } \left( - \frac { \epsilon } { 2 \sigma } - \frac { \log ( \lambda _ { a } ) \sigma } { 2 \epsilon } \right) \right) } \\ & { \displaystyle - \left( \Psi _ { g } \left( \frac { \epsilon } { 2 \sigma } - \frac { \log ( \lambda _ { b } ) \sigma } { 2 \epsilon } \right) - \lambda _ { b } \Psi _ { g } \left( - \frac { \epsilon } { 2 \sigma } - \frac { \log ( \lambda _ { b } ) \sigma } { 2 \epsilon } \right) \right) \ . } \end{array} +$$ + +Eq. 9 then follows from setting the derivatives of this expression to 0 with respect to $\lambda _ { a } , \lambda _ { b }$ and imposing the condition that the optimal solution is non-negative. □ + +To check that Corollary 5 is equivalent to the optimal certification in (Cohen et al., 2019, Theorem 1) we first recall that, in our notation, their result can be stated as: the class of specifications $S$ in Definition 2.1 is information-limited robustly certified at $\rho = { \mathcal { N } } ( x , \sigma ^ { 2 } I )$ with respect to $\mathcal { D } _ { { x } , \epsilon } = \{ \mathcal { N } \big ( x ^ { \prime } , \sigma ^ { 2 } I \big ) : \| x - x ^ { \prime } \| _ { 2 } \leq \epsilon \}$ if and only if + +$$ +\frac { 2 \epsilon } { \sigma } \leq \Psi _ { g } ^ { - 1 } ( \theta _ { a } ) - \Psi _ { g } ^ { - 1 } ( \theta _ { b } ) . +$$ + +The equivalence between Eq. 9 and Eq. 18 now follows from the identity $1 - \Psi _ { g } ( \theta ) = \Psi _ { g } ( - \theta )$ and the monotonicity of $\Psi _ { g }$ : + +$$ +\begin{array} { r l } & { \Psi _ { g } \Big ( \Psi _ { g } ^ { - 1 } ( \theta _ { a } ) - \frac { \epsilon } { \sigma } \Big ) + \Psi _ { g } \Big ( \Psi _ { g } ^ { - 1 } ( 1 - \theta _ { b } ) - \frac { \epsilon } { \sigma } \Big ) \geq 1 } \\ & { \iff \Psi _ { g } \Big ( \Psi _ { g } ^ { - 1 } ( \theta _ { a } ) - \frac { \epsilon } { \sigma } \Big ) \geq 1 - \Psi _ { g } \Big ( \Psi _ { g } ^ { - 1 } ( 1 - \theta _ { b } ) - \frac { \epsilon } { \sigma } \Big ) } \\ & { \iff \Psi _ { g } \Big ( \Psi _ { g } ^ { - 1 } ( \theta _ { a } ) - \frac { \epsilon } { \sigma } \Big ) \geq \Psi _ { g } \Big ( \frac { \epsilon } { \sigma } - \Psi _ { g } ^ { - 1 } ( 1 - \theta _ { b } ) \Big ) } \\ & { \iff \Psi _ { g } ^ { - 1 } ( \theta _ { a } ) - \frac { \epsilon } { \sigma } \geq \frac { \epsilon } { \sigma } - \Psi _ { g } ^ { - 1 } ( 1 - \theta _ { b } ) } \\ & { \iff \Psi _ { g } ^ { - 1 } ( \theta _ { a } ) + \Psi _ { g } ^ { - 1 } ( 1 - \theta _ { b } ) \geq \frac { 2 \epsilon } { \sigma } } \\ & { \iff \Psi _ { g } ^ { - 1 } ( \theta _ { a } ) - \Psi _ { g } ^ { - 1 } ( \theta _ { b } ) \geq \frac { 2 \epsilon } { \sigma } ~ . } \end{array} +$$ + +# A.7.3 RELATION TO PIXELDP + +Pixel differential privacy (pixelDP) was introduced in Lecuyer et al. (2019) using the same similarity measure between distributions used in differential privacy: a distribution-valued function $G : \mathbb { R } ^ { d } \overset { } { }$ $\mathcal { P } ( \mathcal { Z } )$ satisfies $( \varepsilon , \tau )$ -pixelDP with respect to $\ell _ { p }$ perturbations if for any $\| x - x ^ { \prime } \| _ { p } \leq 1$ it holds that $D _ { \mathrm { D P } , e ^ { \varepsilon } } ( G ( x ) \| G ( x ^ { \prime } ) ) \leq \tau$ , where + +$$ +D _ { \mathrm { D P } , e ^ { \varepsilon } } ( G ( x ) \| G ( x ^ { \prime } ) ) = \operatorname* { s u p } _ { E } \left( \operatorname* { l i p } _ { X \sim G ( x ) } [ X \in E ] - e ^ { \varepsilon } \operatorname* { l i p } _ { X ^ { \prime } \sim G ( x ^ { \prime } ) } [ X ^ { \prime } \in E ] \right) +$$ + +and the supremum is over all (measurable) subsets $E$ of $\mathcal { Z }$ . In particular, Lecuyer et al. show that using a smoothing measure $\mu$ satisfying pixelDP with respect to $\ell ^ { p \ }$ leads to adversarially robust classifiers against $\ell ^ { p \ }$ perturbations. + +To show that their result fits as a particular instance of our framework, take $\rho = \mu ( x )$ and fix $\varepsilon \geq 0$ and $\tau \in [ 0 , 1 ]$ . Due to the symmetry of the constraint $\| x - x ^ { \prime } \| _ { p } \leq 1$ , if $\mu$ satisfies $( \varepsilon , \tau )$ -pixelDP with respect to $\ell _ { p }$ perturbations, then we have the relaxation condition $\{ \mu ( x ^ { \prime } ) : \| x - x ^ { \prime } \| _ { p } \leq 1 \} \subseteq { \mathcal { D } } _ { \varepsilon , \tau }$ , where + +$$ +\mathscr { D } _ { \varepsilon , \tau } = \{ \nu : D _ { \mathrm { D P } , e ^ { \varepsilon } } ( \nu \| \rho ) \leq \tau \ \mathrm { a n d } \ D _ { \mathrm { D P } , e ^ { \varepsilon } } ( \rho \| \nu ) \leq \tau \} . +$$ + +Now we recall that Barthe & Olmedo (2013) noticed that $D _ { \mathrm { D P } , e ^ { \varepsilon } }$ is equivalent to the hockey-stick divergence $D _ { \mathrm { H S } , \beta }$ of order $\beta = e ^ { \varepsilon }$ . Thus, since $f$ -divergences are closed under reversal (property 4 in Appendix A.2), we see that the constraint set $\mathcal { D } _ { \varepsilon , \tau }$ can be directly written in the form $\mathcal { D } _ { \mathcal { F } }$ (cf. Section 2.2). + +The main result in Lecuyer et al. (2019) is a limited-information black-box certification method for smoothed classifiers. The resulting certificate for, which provides certification with respect to $\mathcal { D } _ { \varepsilon , \tau }$ , is given by + +$$ +\tau \leq \frac { \theta _ { a } - e ^ { 2 \varepsilon } \theta _ { b } } { e ^ { \varepsilon } + 1 } \ . +$$ + +For comparison, the certificate we obtain for the relaxation $\{ \nu : D _ { \mathrm { D P } , e ^ { \varepsilon } } ( \nu \| \rho ) \leq \tau \}$ of $\mathcal { D } _ { \varepsilon , \tau }$ (HS certificate in Table 4) already improves on the certificate by Lecuyer et al. whenever $\theta _ { a } - \theta _ { b } \geq$ $( \beta - 1 ) ( 1 - \theta _ { a } - \theta _ { b } )$ , which, e.g., always holds in the binary classification case. Furthermore, since Theorem 2 provides optimal certificates for $\mathcal { D }$ , we have the following result. + +Corollary 7. The optimal certificates for the constraint set $\mathcal { D }$ (cf. Eq. 20) obtained from Theorem 2 are stronger than those obtained from Eq. 21. + +# A.8 EFFICIENT SAMPLING AND F-DIVERGENCE COMPUTATION FOR NORM-BASED SMOOTHING MEASURES + +Lemma 8. The smoothing measure $\mu : \mathcal { X } \mapsto \mathcal { P } ( \mathcal { X } )$ with density $\mu ( x ) [ z ] \propto \exp ( - \| z - x \| )$ satisfies + +$$ +\operatorname* { m a x } _ { \| \delta \| \leq \epsilon } R _ { \infty } ( \mu ( x + \delta ) \| \mu ( x ) ) \leq \epsilon . +$$ + +if $\| x \|$ is any norm. Further, if $f$ is convex function with $f ( 1 ) = 0$ such that $f { \bigl ( } { \frac { 1 } { u } } { \bigr ) }$ is convex and monotonically increasing in $u$ , then + +$$ +\operatorname* { m a x } _ { \| \delta \| \leq \epsilon } D _ { f } ( \mu ( x + \delta ) \| \mu ( x ) ) \leq \operatorname* { m a x } _ { \| \delta \| = \epsilon } \mathrm { ~ E ~ } _ { \sim \mu ( 0 ) } [ f ( \exp ( - \| X - \delta \| + \| X \| ) ) ] \enspace . +$$ + +Proof. By the triangle inequality, we have + +$$ +\frac { \mu ( x ^ { \prime } ) [ z ] } { \mu ( x ) [ z ] } = \exp ( \| z - x \| - \| z - x ^ { \prime } \| ) \leq \exp ( \| x - x ^ { \prime } \| ) +$$ + +so that + +$$ +R _ { \infty } ( \mu ( x ^ { \prime } ) \| \mu ( x ) ) \leq \| x - x ^ { \prime } \| . +$$ + +Similarly, for $f$ that satisfy the conditions of the theorem, it can be shown that $D _ { f } ( \mu ( x ^ { \prime } ) \| \mu ( x ) )$ is convex in $x ^ { \prime }$ so that its maximum over the convex set $\| x ^ { \prime } - x \| \leq \epsilon$ is attained on the boundary. + +For several norms, the optimization problem in Eq. 22 can be solved in closed form. These include $\ell _ { 1 } , \ell _ { 2 } , \ell _ { \infty }$ norms and the matrix spectral norm and nuclear norm (the final two are relevant when $\mathcal { X }$ is a space of matrices). The results are documented in Table 5. Thus, every $f$ -divergence that meets the conditions of Lemma 8 can be estimated efficiently for these norms. In particular, the divergences that are induced by the functions $\tilde { f } ( u ^ { - \alpha } )$ for any monotonic convex function $\tilde { f }$ and $\alpha \geq 0$ satisfy this constraint. This gives us a very flexible class of $f$ -divergences that can be efficiently estimated for these norm-based smoothing measures. + +Table 5: Bounds on $f$ -divergences: $e _ { 0 }$ is the vector with 1 in the first coordinate and zeros in all other coordinates and 1 is the vector with all coordinates equal to 1. $\mu _ { p }$ refers to the smoothing measure induced by the $\ell _ { p }$ norm, $\mathcal { U } ( S )$ refers to the uniform measure over the set $S$ , $\mathcal { O }$ is the set of orthogonal matrices and $\hat { B _ { p } } { = } \left\{ \| z \| _ { p } \leq 1 \right\}$ is the unit ball in the $\ell _ { p }$ norm. + +
Constraint on δ|Bound on Eq. 22Constraint on δ|Bound on Eq. 22Sampling from X ~ μ(0)
|δl ≤εE[f(exp(-eoll-X))]X~μ1(0)Xi ~ Lap(0,1) iid
1l2≤ eE(o[f(exp(IX-eoll-X2))]X~μ2(0)X=RuR~Γ(d,1)u ~U(aB2)
≤eE[f(exp(X-e1|-X)]X~μ(0)X=RuR~ Γ(d+1,1)u EU(B)
|/ lnuc ≤ e[f(exp(||U[[s]]vT-e[[eo]|lnuc- |slli)]s~μ1(0)U,v~u(O)X=U[s]]VTs ~ μ1,U,V ~U(O)
≤eE [f(exp(|IU[[s]]vT-∈[e]|l, - |sll)]s~μ∞(x)U,v~u(O)X=U[[s]IVTs ~ μ∞,U,V ~U(O)
+ +Efficient sampling The only other requirement for obtaining a certificate computationally is to be able to sample from $\mu ( x )$ to estimate $\theta _ { a } , \theta _ { b }$ . Since $\mu ( x )$ is log-concave, there are general purpose polynomial time algorithms for sampling from this measure. However, for most norms, more efficient methods exist, as outlined below. + +The random variable $X \sim \mu ( x )$ can be obtained as $X = x + Z$ with $Z \sim \mu ( 0 )$ . Thus, to sample from $\mu ( x )$ for any $x$ it is enough to be able to sample from $\mu ( 0 )$ . For $\left\| \cdot \right\| _ { 1 }$ , this reduces to sampling from a Laplace distribution which can be done easily. For $\left\| \cdot \right\| _ { \infty }$ , (Steinke & Ullman, 2016) give the following efficient sampling procedure: first sample $r$ from a Gamma distribution with shape $d + 1$ and mean $d + 1$ , i.e. $\bar { r } \sim \bar { \Gamma } ( \bar { d } + 1 , 1 )$ , and then sample each $Z _ { i }$ , $i \in [ d ]$ , uniformly from $[ - r , r ]$ . Theorem 9 gives a short proof of correctness for this procedure. Theorem 10 also has a similar result for the case of $\lVert \cdot \rVert _ { 2 }$ and Table 5 lists the sampling procedures for several norms. + +Theorem 9. The random variable $Z \in \mathbb { R } ^ { d }$ obtained by first sampling $R \sim \Gamma ( d + 1 , 1 )$ and then sampling each $Z _ { i }$ , $i \in [ d ]$ , uniformly from $[ - R , R ]$ has density $\propto e ^ { - \| z \| _ { \infty } }$ . + +Proof. We first compute the normalization constant for a density of the form $\propto e ^ { - \| z \| _ { \infty } }$ as follows: + +$$ +\int _ { \mathbb { R } ^ { d } } e ^ { - \| z \| _ { \infty } } d z = \int _ { 0 } ^ { \infty } \left( \int _ { \mathbb { R } ^ { d } } 1 [ \| z \| _ { \infty } = t ] d z \right) e ^ { - t } d t = \int _ { 0 } ^ { \infty } 2 ^ { d } d t ^ { d - 1 } e ^ { - t } d t = d ! 2 ^ { d } \ . +$$ + +Next we show the density of $Z$ satisfies $p _ { Z } ( z ) = e ^ { - \| z \| _ { \infty } } / ( d ! 2 ^ { d } )$ by noting that conditioned on $R = r$ we have $p _ { Z | R = r } ( \bar { z } ) = 1 [ \| z \| _ { \infty } \leq r ] / ( 2 r ) ^ { d }$ because of the uniform sampling used in each + +coordinate, and integrating over $R$ sampled from a Gamma distribution with shape $d + 1$ and mean $d + 1$ yields + +$$ +_ { _ { D G } } ( z ) = \int _ { 0 } ^ { \infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r = \int _ { 0 } ^ { \infty } \frac { 1 [ \| z \| _ { \infty } \leq r ] } { ( 2 r ) ^ { d } } \frac { r ^ { d } e ^ { - r } } { d ! } d r = \frac { 1 } { d ! 2 ^ { d } } \int _ { \| z \| _ { \infty } } ^ { \infty } e ^ { - r } d r = \frac { e ^ { - \| z \| _ { \infty } } } { d ! 2 ^ { d } } . +$$ + +Theorem 10. The random variable $Z \in \mathbb { R } ^ { d }$ obtained by first sampling $Z ^ { \prime } \sim \mathcal { N } ( 0 , I )$ and $R \sim$ $\Gamma _ { p } ( d , 1 )$ and then taking $\begin{array} { r } { Z = R \frac { Z ^ { \prime } } { \Vert Z ^ { \prime } \Vert _ { 2 } } } \end{array}$ has density $\propto e ^ { - \| z \| _ { 2 } ^ { p } }$ . Here $\Gamma _ { p } ( d , a )$ denotes the generalized Gamma distribution of order $p > 0$ with shape $d$ and scale $a$ . + +Proof. First note that $\begin{array} { r } { W = \frac { Z ^ { \prime } } { \left. Z ^ { \prime } \right. _ { 2 } } \sim \mathcal { U } ( B _ { 2 } ) } \end{array}$ ; i.e. it is uniform on the $\ell _ { 2 }$ ball of radius 1. Therefore, $R W$ is uniform on the $\ell _ { 2 }$ ball of radius $R$ and the conditional density of $Z$ given $R$ is given by $\begin{array} { r } { p _ { Z | R = r } ( z ) = \frac { 1 [ \| z \| _ { 2 } = r ] \Gamma ( d / 2 ) } { 2 \pi ^ { d / 2 } r ^ { d - 1 } } } \end{array}$ . Since $R$ has density $p _ { R } ( r ) \propto r ^ { d - 1 } e ^ { - r ^ { p } }$ , we get + +$$ +\begin{array} { l } { { \displaystyle p _ { Z } ( z ) = \int _ { 0 } ^ { \infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r } } \\ { { \displaystyle \propto \int _ { 0 } ^ { \infty } \frac { 1 [ \| z \| _ { 2 } = r ] \Gamma ( d / 2 ) } { 2 \pi ^ { d / 2 } r ^ { d - 1 } } r ^ { d - 1 } e ^ { - r ^ { p } } d r } } \\ { { \displaystyle \propto e ^ { - \| z \| _ { 2 } ^ { p } } } . } \end{array} +$$ + +# A.9 ALGORITHM FOR FULL-INFORMATION CERTIFICATION + +In this section we describe the subroutines used in Algorithm 1. First we describe a generic procedure to provide high-probability confidence intervals for estimating expectations, then we give a detailed description of the subroutines. + +# A.9.1 HIGH-CONFIDENCE ESTIMATES OF EXPECTED VALUES + +Let Let $Z _ { 1 } , \dots , Z _ { N }$ be indepel mean be distributed random variables and the empirical variance be $R$ $m$ $\begin{array} { r } { \bar { Z } = \frac { 1 } { N } \sum _ { i = 1 } ^ { N } \bar { Z _ { i } } } \end{array}$ $\begin{array} { r } { \bar { \sigma } ^ { 2 } = \frac { 1 } { N } \sum _ { i = 1 } ^ { N } ( Z _ { i } - \bar { Z } ) ^ { 2 } } \end{array}$ Applying Bernstein’s inequality to the sum and the sum of the squares of these random variables, we get the empirical Bernstein bound (Audibert et al., 2009), which states that with probability at least $1 - \zeta$ , + +$$ +| \bar { Z } - m | \leq \sqrt { \frac { 2 \bar { \sigma } ^ { 2 } \log ( 3 / \zeta ) } { N } } + \frac { 3 R \log ( 3 / \zeta ) } { t } . +$$ + +The main benefit of the above inequality is that as long as the variance of the sample $Z _ { 1 } , \dots , Z _ { N }$ is small, the convergence rate becomes essentially $O ( 1 / N )$ instead of the standard $O ( 1 / \sqrt { N } )$ . Also, since Eq. 23 only contains empirical quantities apart from the range $R$ , it can be used to obtain computable bounds for the expectation $\mu$ : with probability at least $1 - \zeta$ , + +$$ +\bar { Z } - \sqrt { \frac { 2 \bar { \sigma } ^ { 2 } \log ( 3 / \zeta ) } { N } } - \frac { 3 R \log ( 3 / \zeta ) } { N } \leq m \leq \bar { Z } + \sqrt { \frac { 2 \bar { \sigma } ^ { 2 } \log ( 3 / \zeta ) } { N } } + \frac { 3 R \log ( 3 / \zeta ) } { N } . +$$ + +# A.9.2 SUBROUTINES FOR ALGORITHM 1 + +The bound in Eq. 24 can be applied to approximate the expectation in Eq. 6 with high probability for given values of $\lambda$ and $\kappa$ . More specifically, if the function $f _ { \lambda } ^ { * } ( \kappa - \phi ( \cdot ) )$ is bounded with range $R$ , then taking $N$ samples $X _ { 1 } , \ldots , X _ { N }$ independently from $\rho$ , and defining $Z _ { i } = f _ { \lambda } ^ { * } ( \kappa - \phi ( X _ { i } ) )$ , and $\bar { Z }$ and $\bar { \sigma } ^ { 2 }$ as above, Eq. 24 implies that with probability at least $1 - \zeta$ , + +$$ +\operatorname { E } _ { X \sim \rho } ^ { } [ f _ { \lambda } ^ { * } ( \kappa - \phi ( X _ { i } ) ) ] \leq \bar { Z } + \sqrt { \frac { 2 \bar { \sigma } ^ { 2 } \log ( 3 / \zeta ) } { N } } + \frac { 3 R \log ( 3 / \zeta ) } { N } . +$$ + +Plugging in this bound to Eq. 6 gives a high-probability lower bound for the function to be maximized for any given $\lambda$ and $\kappa$ . + +Details of the above procedures are given in Algorithm 3. We use an off-the-shelf convex optimization solver (Diamond & Boyd, 2016) in the ESTIMETEOPT subroutine. + +# Algorithm 3 Subroutines for Algorithm 1 + +function ESTIMAT $\mathrm { E O P T } ( \rho , \phi , N , \{ f _ { i } \} , \{ \epsilon _ { i } \} )$ + +Sample $X ^ { 1 } , \ldots , X ^ { N } \sim \rho$ and obtain $\kappa ^ { * }$ and $\lambda ^ { * }$ by solving Eq. 6 with $\operatorname { E } _ { X \sim \rho } [ f _ { \lambda } ^ { * } ( \kappa - \phi ( X ) ) ]$ replaced by $\begin{array} { r } { \frac { 1 } { N } \sum _ { i = 1 } ^ { N } f _ { \lambda } ^ { * } \big ( \kappa - \phi \big ( X ^ { i } \big ) \big ) } \end{array}$ and the additional constraints $f _ { \lambda ^ { * } } ^ { * } ( \kappa - a ) < \infty , f _ { \lambda ^ { * } } ^ { * } ( \kappa - b ) <$ $\infty$ . + +return $\kappa ^ { * } , \lambda ^ { * }$ + +function UPPERCON $\mathrm { F I D E N C E B O U N D } ( \rho , \phi , \tilde { N } , \{ f _ { i } \} _ { i = 1 } ^ { M } , \{ \epsilon _ { i } \} _ { i = 1 } ^ { M } , a , b , \lambda , \kappa , \zeta )$ + +Sample $X ^ { 1 } , \dotsc , X ^ { \tilde { N } } \dotsc \rho$ and compute $Z ^ { i } \gets f _ { \lambda } ^ { * } \big ( \kappa - \phi \big ( X ^ { i } \big ) \big )$ for $i = 1 , \ldots , \tilde { N }$ + +$$ +E _ { u b } \bar { Z } + \sqrt { \frac { 2 \bar { \sigma } ^ { 2 } \log ( 3 / \zeta ) } { \tilde { N } } } + \frac { 3 R \log ( 3 / \zeta ) } { \tilde { N } } . +$$ + +return $E _ { u b }$ end function + +# A.10 $\ell _ { 0 }$ SMOOTHING MEASURE + +We can also handle discrete perturbations in our framework. A natural case to consider is $\ell _ { 0 }$ perturbations. In this case, we assume that $\mathcal { X } = A ^ { d }$ where + +$$ +A = \{ 1 , \ldots , K \} +$$ + +is a discrete set. Then, we can choose + +$$ +\mu ( x ) [ z ] = \prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } { \left( { \frac { q } { K - 1 } } \right) } ^ { 1 [ z _ { i } \neq x _ { i } ] } +$$ + +where and $\frac { q } { K - 1 }$ $p + q = 1$ denotes a uniform probability of switching it to a different value. In this case, it can be , $p \geq q \geq 0$ , and $p$ denotes the probability that the measure retains the value of $x$ shown that for every $\alpha > 0$ that + +$$ +R _ { \alpha } ( \mu ( x ^ { \prime } ) \| \mu ( x ) ) = \| x - x ^ { \prime } \| _ { 0 } \left( \frac { \log \left( p \left( \frac { q } { ( K - 1 ) p } \right) ^ { ( \alpha ) } + \frac { q } { K - 1 } \left( \frac { ( K - 1 ) p } { q } \right) ^ { ( \alpha ) } + \left( \frac { K - 2 } { K - 1 } \right) q \right) } { \alpha - 1 } \right) +$$ + +so that we can derive a certificate with respect to $\ell _ { 0 }$ perturbations using any set of Renyi divergences ´ (or combinations of theses). + +This can be extended to structured discrete perturbations by introducing coupling terms between the perturbations: + +$$ +\mu ( x ) [ z ] \propto \prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } \bigg ( \frac { q } { K - 1 } \bigg ) ^ { 1 [ z _ { i } \neq x _ { i } ] } \exp \left( \sum _ { i = 1 } ^ { d - 1 } \eta 1 [ z _ { i } = x _ { i } ] 1 [ z _ { i + 1 } = x _ { i + 1 } ] \right) \ . +$$ + +This would correlate perturbations between adjacent features (which for example may be useful to model correlated perturbations for time series data). Since this can be viewed as a Markov Chain, Renyi divergences between ´ $\mu ( x ) , \mu ( x ^ { \prime } )$ are still easy to compute. + +A.11 COMPARISON WITH LECUYER ET AL. (2019) ON $\ell _ { 1 }$ PERTURBATIONS + +Here we compare our certificates to Lecuyer et al. (2019) on the MNIST, CIFAR-10 and ImageNet datasets. The smoothing distribution is as described in A.8; a zero mean Laplacian distribution with smoothing value defined by the scale of the distribution. We first describe the hyperparameters used in training and certification for each of the datasets. For all datasets, images were normalized into a [0,1] range. + +MNIST hyperparameters: We trained a standard three layer CNN ReLU classifier for 50,000 steps with a batch size of 128 and a learning rate of 0.001. The smoothing value during training was set to 1.0. For certification we use $N \overset { \cdot } { = } 1 K , \tilde { N } = 1 0 M , \zeta = . 9 9$ , and sweep over a range of smoothing values between 0.5 and 1.5 and report the best certificate found. Certified accuracy is reported on 1,000 MNIST test set images. + +CIFAR-10 hyperparameters: We trained a Wide ResNet classifier for 50,000 training steps with a batch size of 32 and a learning rate of 0.001. The smoothing value during training was set to 0.2. For certification we use $N = 1 K , \tilde { N } = 1 M , \zeta = . 9 9$ , and sweep over a range of smoothing values between 0.1 and 0.5 and report the best certificate found. Certified accuracy is reported on 1,000 CIFAR-10 test set images. + +ImageNet hyperparameters: We trained a ResNet-152 classifier for 1 million training steps with a batch size of 16 and an initial learning rate of 0.1 that is decayed by a factor of ten every 25,000 steps. The smoothing value during training was set to 0.1. For certification we use $N = 1 K , \tilde { N } =$ $1 0 0 K , \zeta = . 9 9$ , and sweep over a range of smoothing values between 0.05 and 0.25 and report the best certificate found. Certified accuracy is reported on 500 ImageNet validation set images. + +![](images/91632107e779409bf7a1723095f72ac1b1035eae560bf1b3ef171f5a1d760330.jpg) +Figure 3: Certified accuracy under $\ell _ { 1 }$ perturbations on CIFAR-10 and ImageNet. + +Results for MNIST can be seen in Table 6, CIFAR-10 and ImageNet results are shown in Figure 3. +We significantly outperform Lecuyer et al. (2019) on all three datasets. \ No newline at end of file diff --git a/parse/train/SJlKrkSFPH/SJlKrkSFPH_content_list.json b/parse/train/SJlKrkSFPH/SJlKrkSFPH_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..133bc986ec1a3c6ffe630f0a7a74f65ed93522bb --- /dev/null +++ b/parse/train/SJlKrkSFPH/SJlKrkSFPH_content_list.json @@ -0,0 +1,4743 @@ +[ + { + "type": "text", + "text": "A FRAMEWORK FOR ROBUSTNESS CERTIFICATION OF SMOOTHED CLASSIFIERS USING F-DIVERGENCES ", + "text_level": 1, + "bbox": [ + 174, + 99, + 823, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Krishnamurthy (Dj) Dvijotham† Jamie Hayes†‡∗ Borja Balle† J. Zico Kolterac \nChongli Qin† Andras Gy ´ orgy ¨ † Kai Xiaob†∗ Sven Gowal† Pushmeet Kohli† \n†DeepMind, London, UK ‡University College London, UK \na Carnegie Mellon University, USA b Massachusetts Institute of Technology, USA \nc Bosch Center for AI, USA \n{dvij, bballe, chongliqin, agyorgy, sgowal, pushmeet}@google.com \n{zkolter}@cs.cmu.edu {j.hayes}@ucl.ac.uk {kaix}@mit.edu ", + "bbox": [ + 181, + 169, + 802, + 272 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 308, + 544, + 321 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Formal verification techniques that compute provable guarantees on properties of machine learning models, like robustness to norm-bounded adversarial perturbations, have yielded impressive results. Although most techniques developed so far require knowledge of the architecture of the machine learning model and remain hard to scale to complex prediction pipelines, the method of randomized smoothing has been shown to overcome many of these obstacles. By requiring only black-box access to the underlying model, randomized smoothing scales to large architectures and is agnostic to the internals of the network. However, past work on randomized smoothing has focused on restricted classes of smoothing measures or perturbations (like Gaussian or discrete) and has only been able to prove robustness with respect to simple norm bounds. In this paper we introduce a general framework for proving robustness properties of smoothed machine learning models in the black-box setting. Specifically, we extend randomized smoothing procedures to handle arbitrary smoothing measures and prove robustness of the smoothed classifier by using $f$ -divergences. Our methodology improves upon the state of the art in terms of computation time or certified robustness on several image classification tasks and an audio classification task, with respect to several classes of adversarial perturbations. ", + "bbox": [ + 233, + 339, + 766, + 590 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 621, + 336, + 636 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Predictors obtained from machine learning algorithms have been shown to be vulnerable to making errors when the inputs are perturbed by carefully chosen small but imperceptible amounts (Szegedy et al., 2014; Biggio et al., 2013). This has motivated significant amount of research in improving adversarial robustness of a machine learning model (see, e.g. Goodfellow et al., 2015; Madry et al., 2018). While significant advances have been made, it has been shown that models that were estimated to be robust have later been broken by stronger attacks (Athalye et al., 2018; Uesato et al., 2018). This has led to the need for methods that offer provable guarantees that the predictor cannot be forced to misclassify an example by any attack algorithm restricted to produce perturbations within a certain set (for example, within an $\\ell _ { p }$ norm ball). While progress has been made leading to methods that are able to compute provable guarantees for several image and text classification tasks (Wong & Kolter, 2018; Wong et al., 2018; Raghunathan et al., 2018; Dvijotham et al., 2018; Katz et al., 2017; Huang et al., 2019; Jia et al., 2019), these methods require extensive knowledge of the architecture of the predictor and are not easy to extend to new models or architectures, requiring specialized algorithms for each new class of models. Furthermore, the computational complexity of these methods grows significantly with input dimension and model size. ", + "bbox": [ + 174, + 655, + 825, + 861 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "To deal with these obstacles, recent work has proposed the randomized smoothing strategy for verifying the robustness of classifiers. Specifically, Lecuyer et al. (2019) and Cohen et al. (2019) ", + "bbox": [ + 176, + 869, + 823, + 897 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "have shown that robustness properties can be more easily verified for the smoothed version of a base classifier $h$ producing labels in some set $\\mathcal { V }$ : ", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/ffae80575ac3e04b65ca0265c693acd9bbebfd42241c9d584e622d28c70312fe.jpg", + "text": "$$\nh _ { s } ( x ) = \\underset { y \\in \\mathcal { V } } { \\arg \\operatorname* { m a x } } \\ \\underset { X \\sim \\mu ( x ) } { \\mathbb { P } } \\big [ h ( X ) = y \\big ] \\ ,\n$$", + "text_format": "latex", + "bbox": [ + 369, + 138, + 627, + 165 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "where the labels returned by the smoothed classifier $h _ { s }$ are obtained by taking a “majority vote” over the predictions of the original classifier $h$ on random inputs drawn from a probability distribution $\\mu ( x )$ , called the smoothing measure. Lecuyer et al. (2019) showed that verifying the robustness of this smoothed classifier is significantly simpler than verifying the original classifier $h$ and only requires estimating the distribution of outputs of the classifier under random perturbations of the input, but does not require access to the internals of the classifier $h$ . We refer to this as black-box verification. ", + "bbox": [ + 173, + 172, + 825, + 270 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this work, we develop a general framework for black-box verification that recovers prior work as special cases, and improves upon previous results in various ways. ", + "bbox": [ + 173, + 276, + 823, + 306 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Contributions Our contributions are summarized as follows: ", + "bbox": [ + 174, + 320, + 586, + 335 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1. We formulate the general problem of black-box verification via a generalized randomized smoothing procedure, which extends existing approaches to allow for arbitrary smoothing measures. Specifically, we show that robustness certificates for smoothed classifiers can be obtained by solving a small convex optimization problem when allowed adversarial perturbations can be characterized via divergence-based bounds on the smoothing measure. ", + "bbox": [ + 186, + 347, + 825, + 417 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2. We prove that our certificates generalize previous results obtained in related work (Lecuyer et al., 2019; Cohen et al., 2019; Li et al., 2019), and vastly extend the class of perturbations and smoothing measures that can be used while still allowing certifiable guarantees. ", + "bbox": [ + 184, + 422, + 821, + 464 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "3. We introduce the notion of full-information and information-limited settings, and show that the information-limited setting that has been the main focus of prior work leads to weaker certificates for smoothed probabilistic classifiers, and can be improved by using additional information (the distribution of label scores under randomized smoothing). ", + "bbox": [ + 186, + 469, + 826, + 525 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "4. We evaluate our framework experimentally on image and classification tasks, obtaining robustness certificates that improve upon other black-box methods either in terms of certificate tightness or computation time on robustness to $\\ell _ { 0 } , \\ell _ { 1 }$ or $\\ell _ { 2 }$ perturbations on MNIST, CIFAR-10 and ImageNet. $\\ell _ { 2 }$ perturbations result from worst-case realizations of white noise that is common in many image, speech and video processing. $\\ell _ { 0 }$ perturbations can model missing data (missing pixels in an image, or samples in a time-domain audio signal) while $\\ell _ { 1 }$ perturbations can be used to model convex combinations of discrete perturbations in text classification (Jia et al., 2019). We also obtain the first, to the best of our knowledge, certifiably robust model for an audio classification task, Librispeech (Panayotov et al., 2015), with variable-length inputs. ", + "bbox": [ + 186, + 530, + 825, + 655 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 BLACK-BOX VERIFICATION FOR SMOOTHED CLASSIFIERS ", + "text_level": 1, + "bbox": [ + 174, + 676, + 679, + 691 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Consider a binary classifier $h : \\mathcal { X } \\{ \\pm 1 \\}$ given to us as a black box, so we can only access the inputs and outputs of $h$ but not its internals. We are interested in investigating the robustness of the smoothed classifier $h _ { s }$ (defined in Eq. 1) against adversarial perturbations of size at most $\\epsilon$ with respect to a given norm $\\left\\| \\cdot \\right\\|$ . To determine whether a norm-bounded adversarial attack on a fixed input $x \\in \\mathcal { X }$ with $h _ { s } ( x ) = + 1$ could be successful, we can solve the optimization problem ", + "bbox": [ + 173, + 705, + 825, + 777 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/488b1e3ac23c10ba3be97a0376ce5ef0c389de876510b99f1269c2115dfd78f1.jpg", + "text": "$$\n\\operatorname* { m i n } _ { \\| \\boldsymbol { x ^ { \\prime } } - \\boldsymbol { x } \\| \\le \\epsilon { \\boldsymbol X ^ { \\prime } } \\sim \\mu ( \\boldsymbol { x ^ { \\prime } } ) } [ h ( \\boldsymbol { X ^ { \\prime } } ) = + 1 ] ,\n$$", + "text_format": "latex", + "bbox": [ + 385, + 784, + 611, + 809 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "and check whether the minimum value can be smaller than $\\frac { 1 } { 2 }$ . This is a non-convex optimization problem for which we may not even be able to compute gradients since we only have black-box access to $h$ . While techniques have been developed to address this problem, obtaining provable guarantees on whether these algorithms actually find the worst-case adversarial perturbation is difficult since we do not know anything about the nature of $h$ . ", + "bbox": [ + 174, + 818, + 825, + 888 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Motivated by this difficulty, we take a different approach: Rather than studying the adversarial attack in the input space $\\mathcal { X }$ , we study it in the space of probability measures over inputs, denoted by $\\mathcal { P } ( \\mathcal { X } )$ . ", + "bbox": [ + 173, + 895, + 825, + 924 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Formally, this amounts to rewriting Eq. 2 as ", + "bbox": [ + 174, + 103, + 462, + 118 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/406031201bef6a18ca0d598138c006751f745df1e6b0807723299cd2dc109d75.jpg", + "text": "$$\n\\operatorname* { m i n } _ { \\nu \\in \\{ \\mu ( x ^ { \\prime } ) \\colon \\| x ^ { \\prime } - x \\| \\leq \\epsilon \\} } \\operatorname* { l p } _ { X ^ { \\prime } \\sim \\nu } [ h ( X ^ { \\prime } ) = + 1 ] .\n$$", + "text_format": "latex", + "bbox": [ + 364, + 123, + 632, + 148 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "This is an infinite dimensional optimization problem over the space of probability measures $\\nu \\in { \\mathcal { P } } ( { \\mathcal { X } } )$ subject to the constraint $\\nu \\in \\mathcal { D } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\leq \\epsilon \\}$ . While this set is still intractable to deal with, we can consider relaxations of this set defined by divergence constraints between $\\nu$ and $\\rho = \\mu ( x )$ , i.e., $\\mathcal { D } \\subseteq \\{ \\nu : D ( \\nu \\| \\rho ) \\leq \\epsilon _ { D } \\}$ where $D$ denotes some divergence between probability distributions. We will show in Section 3 that for several commonly used divergences (in fact, for any $f$ -divergence; cf. Ali & Silvey, 1966), the relaxed problem can be solved efficiently. ", + "bbox": [ + 173, + 155, + 825, + 239 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2.1 A GENERAL FRAMEWORK FOR ROBUSTNESS CERTIFICATION ", + "text_level": 1, + "bbox": [ + 174, + 256, + 630, + 270 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To formulate the general verification problem, consider a specification $\\phi : \\mathcal { X } \\to \\mathcal { Z } \\subseteq \\mathbb { R }$ : a generic function over the input space (that typically is a function of the classifier output) that we want to verify has certain properties. Unless otherwise specified, we will assume that $\\mathcal { \\hat { X } } \\subseteq \\mathbb { R } ^ { d }$ (we work in a $d$ dimensional input space). Our framework also involves a reference measure $\\rho$ (in the above example we would take $\\rho = \\mu ( x ) )$ and a collection of perturbed distributions $\\mathcal { D }$ (in the above example we would take $\\mathcal { D } = \\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\le \\bar { \\epsilon } \\}$ ). ", + "bbox": [ + 174, + 281, + 825, + 367 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Verifying that a given specification $\\phi$ is robustly certified is equivalent to checking whether the optimal value of the optimization problem ", + "bbox": [ + 173, + 372, + 823, + 401 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/35fc9d3f11482f78fa99ee5d084323f2aec2d43ac4feba6a89099cfae2a7e1a3.jpg", + "text": "$$\n{ \\mathrm { O P T } } ( \\phi , \\rho , { \\mathcal { D } } ) : = \\operatorname* { m i n } _ { \\nu \\in { \\mathcal { D } } } \\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\ ,\n$$", + "text_format": "latex", + "bbox": [ + 379, + 406, + 617, + 430 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "is non-negative. Solving problems of this form is the key workhorse of our general framework for black-box certification of adversarial robustness for smoothed classifiers. ", + "bbox": [ + 173, + 435, + 825, + 463 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Using these ingredients we introduce two closely related certification problems: information-limited robust certification and full-information robust certification. In the former case, we assume that we are given only given access to $\\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] , \\mathbb { P } _ { X \\sim \\nu } [ \\phi ( X ) = + 1 ]$ . In the latter case, we are given full-access to specification $\\phi$ . The definitions are below. ", + "bbox": [ + 174, + 469, + 825, + 526 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Definition 2.1 (Information-limited robust certification). Given reference distribution $\\rho \\in { \\mathcal { P } } ( { \\mathcal { X } } )$ , probabilities $\\theta _ { a } , \\theta _ { b }$ that satisfy $\\theta _ { a } , \\theta _ { b } \\geq 0 , \\theta _ { a } + \\theta _ { b } \\leq 1$ and collection of perturbed distributions $\\mathcal { D } \\subset \\mathcal { P } ( \\mathcal { X } )$ containing $\\rho$ , define the class of specifications $S$ as ", + "bbox": [ + 173, + 530, + 826, + 573 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/fa2b5ecc9101a201a2d31b04eca2bee40ec61351ed76c8f5010a8bdb06885eef.jpg", + "text": "$$\nS = \\left\\{ \\phi : \\mathcal { X } \\to \\{ - 1 , 0 , + 1 \\} \\mathrm { ~ s . t . ~ } \\operatorname { \\mathbb { P } } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] \\geq \\theta _ { a } , \\operatorname { \\mathbb { P } } _ { X \\sim \\rho } [ \\phi ( X ) = - 1 ] \\leq \\theta _ { b } \\right\\}\n$$", + "text_format": "latex", + "bbox": [ + 223, + 578, + 774, + 613 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We say that $S$ is information-limited robustly certified at $\\rho$ with respect to $\\mathcal { D }$ if the following condition holds: $\\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0$ for all $\\nu \\in \\mathcal { D } , \\phi \\in S$ . ", + "bbox": [ + 173, + 617, + 823, + 647 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Note since we don’t have access to $\\phi$ , we need to prove that ${ \\mathrm { E } } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0 \\quad \\forall \\nu \\in { \\mathcal { D } }$ is satisfied for all specifications in set $S$ . Although the information-limited case may seem challenging because we need to provide guarantees that hold simultaneously over a whole class of specifications, it turns out that, for perturbation sets $\\mathcal { D }$ specified by an $f$ -divergence bound, this certification task can be solved efficiently using convex optimization. ", + "bbox": [ + 174, + 656, + 825, + 728 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Definition 2.2 (Full-information robust certification). Given a reference distribution $\\rho \\in { \\mathcal { P } } ( { \\mathcal { X } } )$ , a specification $\\phi : \\mathcal { X } \\to \\mathcal { Z } \\subseteq \\mathbb { R }$ and a collection of perturbed distributions $\\mathcal { D } \\subset \\mathcal { P } ( \\mathcal { X } )$ containing $\\rho$ , we say that $\\phi$ is full-information robustly certified at $\\rho$ with respect to $\\mathcal { D }$ if the following condition holds: $\\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0$ for all $\\nu \\in \\mathcal { D }$ . ", + "bbox": [ + 174, + 731, + 825, + 787 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Most often we are dealing with the case where we have full access to the specification $\\phi$ , thus we should be able to certify using full-information robust certification. However, prior works, Cohen et al. (2019) and Lecuyer et al. (2019), have only provided solutions to certify with respect to the information-limited case where we cannot use all of the information about $\\phi$ . The framework we develop is a more general method that can be used in both information-limited and full-information scenarios. We will demonstrate that our framework recovers certificates provided by Cohen et al. (2019), Li et al. (2019) and dominates Lecuyer et al. (2019) in the information-limited setting (see section 5). Further, it can utilize full-information about the specification $\\phi$ to provide tighter certificates for smoothed probabilistic classifiers (see section 6). ", + "bbox": [ + 173, + 797, + 826, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We first note that the definitions above are sufficient to capture the standard usage of randomized smoothing as it has been used in past work (e.g. Lecuyer et al., 2019; Cohen et al., 2019) to verify the robustness of smoothed multi-class classifiers. Specifically, consider smoothing a classifier $h : \\mathcal { X } \\to \\mathcal { Y }$ with a finite set of labels $\\mathcal { V }$ using a smoothing measure $\\mu : \\mathcal X \\mapsto \\mathcal P ( \\mathcal X )$ . The resulting randomly smoothed classifier $h _ { s }$ is defined in Eq. 1. Our goal is to certify that the prediction $h _ { s } ( x )$ is robust to perturbations of size at most $\\epsilon$ measured by distance function1 $d : \\mathcal { X } \\times \\mathcal { X } \\mapsto \\mathbb { R } _ { + }$ , i.e., ", + "bbox": [ + 173, + 127, + 825, + 212 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/6d041ce45084b5b6fb732d7b7aad962753203e718f12289be9047943f9a87cc2.jpg", + "text": "$$\nh _ { s } ( x ^ { \\prime } ) = h _ { s } ( x ) \\quad \\forall x ^ { \\prime } \\ \\mathrm { s u c h ~ t h a t } \\ d ( x , x ^ { \\prime } ) \\leq \\epsilon .\n$$", + "text_format": "latex", + "bbox": [ + 344, + 215, + 648, + 234 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "To pose this question within our framework, we choose the reference distribution $\\rho = \\mu ( x )$ , the set of perturbed distributions $\\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : d ( x , x ^ { \\prime } ) \\leq \\epsilon \\}$ , and the following specifications. Let $c = h _ { s } ( x )$ . For every $c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}$ , we define the specification $\\phi _ { c , c ^ { \\prime } } : \\mathcal { X } \\mapsto \\{ - \\bar { 1 } , \\bar { 0 } , + 1 \\}$ as follows: ", + "bbox": [ + 173, + 246, + 825, + 290 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/fe93ac917d79b02f57844b93d8fe67d8556ab29168ca91ebb86f6afb067adec4.jpg", + "text": "$$\n\\phi _ { c , c ^ { \\prime } } ( x ) = \\left\\{ \\begin{array} { l l } { { + 1 } } & { { \\mathrm { ~ i f ~ } h ( x ) = c ~ , } } \\\\ { { - 1 } } & { { \\mathrm { ~ i f ~ } h ( x ) = c ^ { \\prime } ~ , } } \\\\ { { 0 } } & { { \\mathrm { ~ o t h e r w i s e ~ . } } } \\end{array} \\right.\n$$", + "text_format": "latex", + "bbox": [ + 385, + 296, + 607, + 347 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Then, Eq. 5 holds if and only if every $\\phi _ { c , c ^ { \\prime } }$ , $c ^ { \\prime } \\neq c$ , is robustly certified at $\\mu ( x )$ with respect to $\\mathcal { D } _ { x , \\epsilon }$ (see Appendix A.1). ", + "bbox": [ + 171, + 353, + 823, + 382 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2.2 CONSTRAINT SETS FROM F-DIVERGENCES ", + "text_level": 1, + "bbox": [ + 174, + 398, + 508, + 414 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Dealing with the set $\\mathcal { D } _ { x , \\epsilon }$ directly is difficult due to its possibly non-convex geometry. In this section, we discuss specific relaxations of this set, i.e., choices for sets $\\mathcal { D }$ such that $\\mathcal { D } _ { x , \\epsilon } \\subseteq \\mathcal { D }$ that are easier to optimize over. In particular, we focus on a general family of constraint sets defined in terms of $f$ -divergences. These divergences satisfy a number of useful properties and include many well-known instances (e.g. relative entropy, total variation); see Appendix A.2 for details. ", + "bbox": [ + 173, + 424, + 826, + 494 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Definition 2.3. $f$ -divergence constraint set). Given $\\rho , \\nu \\in \\mathcal { P } ( \\mathcal { X } )$ , their $f$ -divergence is defined as ", + "bbox": [ + 173, + 497, + 818, + 513 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/7f706cb311365f08edf41f889402305ab852238209c17f47c7d7e33c3bcc14b0.jpg", + "text": "$$\nD _ { f } ( \\nu \\| \\rho ) = \\underset { X \\sim \\rho } { \\mathrm { E } } \\Bigg [ f \\Bigg ( \\frac { \\nu ( X ) } { \\rho ( X ) } \\Bigg ) \\Bigg ] ~ ,\n$$", + "text_format": "latex", + "bbox": [ + 390, + 517, + 606, + 554 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $f : \\mathbb { R } _ { + } \\mapsto \\mathbb { R }$ is a convex function with $f ( 1 ) = 0$ . Given a reference distribution $\\rho$ , an $f$ -divergence $D _ { f }$ and a bound $\\epsilon _ { f } \\geq 0$ , we define the $f$ -divergence constraint set to be: ", + "bbox": [ + 174, + 558, + 821, + 587 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/7bc8b829094e9328942d7d0933e99f3451dc314e5751265217f87799f89e2202.jpg", + "text": "$$\n\\mathcal { D } _ { f } = \\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { f } ( \\nu \\| \\rho ) \\leq \\epsilon _ { f } \\} \\ .\n$$", + "text_format": "latex", + "bbox": [ + 370, + 592, + 625, + 609 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Technically, this definition depends on the Radon-Nikodym derivative of $\\nu$ with respect to $\\rho$ , but we ignore measure-theoretic issues in this paper for simplicity of exposition. For continuous distributions, $\\nu$ and $\\rho$ should be treated as densities, and for discrete distributions as probability mass functions. ", + "bbox": [ + 173, + 621, + 826, + 664 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Relaxations using $f$ -divergence This construction immediately allows us to obtain relaxations of $\\mathcal { D } _ { x , \\epsilon }$ . For example, by choosing $f ( u ) = u \\log ( u )$ , we have the KL-divergence. Using KL-divergence yields the following relaxation between norm-based and divergence-based constraint sets for Gaussian smoothing measures, i.e. $\\mu ( x ) = \\mathcal { N } ( x , \\sigma ^ { 2 } I )$ : ", + "bbox": [ + 173, + 678, + 825, + 734 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/497076acbf7ca0680384e81321a4d54f8679a7044a4fdc43971d505af2085111.jpg", + "text": "$$\n\\begin{array} { r } { { \\mathcal { D } } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\} \\subseteq \\left\\{ \\nu : \\mathrm { K L } ( \\nu \\| \\mu ( x ) ) \\leq \\epsilon ^ { 2 } / ( 2 \\sigma ^ { 2 } ) \\right\\} \\ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 267, + 741, + 728, + 760 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Tighter relaxations can be constructed by combining multiple divergence-based constraints. In particular, suppose $\\mathcal { F }$ is a collection of convex functions each defining an $f$ -divergence, and assume each $f \\in { \\mathcal { F } }$ has a bound $\\epsilon _ { f }$ associated with it. Then we can define the constraint set containing perturbed distributions where all the bounds hold simultaneously (Fig. 1): ", + "bbox": [ + 173, + 763, + 550, + 861 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/98620b7fba5964d5dbf009ba2e3ff8fdb0a5649329055a39bbc24b6fc8922a2f.jpg", + "text": "$$\n{ \\mathcal { D } } _ { { \\mathcal { F } } } : = \\bigcap _ { f \\in { \\mathcal { F } } } { \\mathcal { D } } _ { f } = \\left\\{ \\nu : \\forall f \\in { \\mathcal { F } } \\ D _ { f } ( \\nu \\| \\rho ) \\leq \\epsilon _ { f } \\right\\} \\ .\n$$", + "text_format": "latex", + "bbox": [ + 191, + 866, + 532, + 901 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/780bf0bf4f2c683a963451dd5c5948364e7681d2494ad1b2600b2a70aae3d94a.jpg", + "image_caption": [ + "Figure 1: Intersecting $f$ -divergence constraints to obtain better relaxations g. \\`0). $\\mathcal { D } _ { \\mathcal { F } }$ (depicted by the orange region) of $\\mathcal { D } _ { x , \\epsilon }$ . " + ], + "image_footnote": [], + "bbox": [ + 580, + 767, + 803, + 886 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this paper, we work with the following divergences: ", + "bbox": [ + 176, + 103, + 531, + 117 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "(1) Renyi: ´ $R _ { \\alpha } ( \\nu | | \\rho ) = \\log ( 1 + D _ { f } ( \\nu | | \\rho ) ) / ( \\alpha - 1 )$ where $f ( x ) = x ^ { \\alpha } - 1$ (for $\\alpha \\geq 1 \\gamma$ ), and $\\tilde { R _ { \\alpha } } ( \\rho \\| \\nu ) = \\log ( 1 - D _ { f } ( \\nu \\| \\rho ) ) / ( \\alpha - 1 )$ with $f ( x ) = 1 - x ^ { \\alpha }$ (for $0 \\leq$ $\\alpha \\leq 1 _ { \\cdot }$ ). The limit $\\alpha \\to \\infty$ yields the infinite order Renyi divergence ´ $R _ { \\infty } ( \\nu \\| \\rho ) = \\operatorname* { s u p } _ { x } ( \\nu ( x ) / \\rho ( x ) )$ . ", + "bbox": [ + 173, + 118, + 826, + 160 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "(2) $\\mathrm { K L } ( \\nu \\| \\rho ) = D _ { f } ( \\nu \\| \\rho )$ with $f ( x ) = x \\log ( x )$ ", + "bbox": [ + 173, + 165, + 490, + 183 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "(3) Hockey-Stick: $D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho ) = D _ { f } ( \\nu \\| \\rho )$ with $f ( x ) = \\mathrm { m a x } ( x - \\beta , 0 ) - \\mathrm { m a x } ( 1 - \\beta , 0 ) .$ ", + "bbox": [ + 169, + 186, + 769, + 204 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "It turns out that the Renyi and KL divergences are computationally attractive for a broad class of ´ smoothing measures, while the Hockey-Stick divergences are theoretically attractive as they lead to optimal certificates in the information-limited setting. However, Hockey-Stick divergences are harder to estimate in general, so we only use them for Gaussian smoothing measures. ", + "bbox": [ + 174, + 209, + 826, + 265 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2.3 COMPUTING F-DIVERGENCE BOUNDS ", + "text_level": 1, + "bbox": [ + 176, + 284, + 473, + 297 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In general, our framework can be used with any family of smoothing measures and any family of $f$ divergences such that an upper bound on $\\mathrm { m a x } _ { \\nu \\in \\mathcal { D } _ { x , \\epsilon } } D _ { f } ( \\nu \\| \\rho )$ can be estimated efficiently. We describe how $f$ -divergence bounds can be obtained for several classes of smoothing measures: ", + "bbox": [ + 174, + 309, + 825, + 352 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Product measures Product measures are of the form $\\mu ( \\boldsymbol { x } ) = \\otimes _ { i = 1 } ^ { d } \\mu _ { i } ( x _ { i } )$ where $\\begin{array} { r } { \\mathcal { X } = \\prod _ { i = 1 } ^ { d } \\mathcal { X } _ { i } } \\end{array}$ and $\\mu _ { i }$ is a smoothing measure on $\\mathcal { X } _ { i }$ . We note that the discrete smoothing measure used in (Lee et al., 2019), the Gaussian measure used in (Cohen et al., 2019) and the Laplacian measure used in (Li et al., 2019) are all of this form. For such measures, one can construct bounds on Renyi- ´ divergences subject to any $\\ell _ { p }$ norm constraint using a Lagrangian relaxation of the optimization problem $\\begin{array} { r } { \\operatorname { 1 a x } _ { x ^ { \\prime } : \\| x - x ^ { \\prime } \\| _ { p } \\leq \\epsilon } R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) } \\end{array}$ (see Appendix A.3 for details). ", + "bbox": [ + 173, + 369, + 825, + 457 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Norm-based smoothing measures Appendix A.9.1 also shows how we can obtain bounds on the infinite-order Renyi divergence ´ $R _ { \\infty }$ , as well as on several classes of $f$ -divergences, for norm-based smoothing measures of the form $\\mu ( x ) [ X ] \\propto \\exp ( { - \\| X - x \\| } )$ . ", + "bbox": [ + 174, + 472, + 825, + 516 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3 OUR CERTIFICATION PROCEDURES ", + "text_level": 1, + "bbox": [ + 174, + 536, + 493, + 551 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We now show how to reduce the problems of full-information and information-limited robust blackbox certification to simple convex optimization problems for general constraint sets $\\mathcal { D }$ defined in terms of $f$ -divergences. This allows us, by extension, to solve the problem for related divergences like Renyi divergences. The following two theorems provide the main foundation for the verification ´ procedures in the paper. ", + "bbox": [ + 173, + 566, + 825, + 637 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Theorem 1 (Verifying full-information robust certification). Let $\\mathcal { D } _ { \\mathcal { F } }$ be the constraint set defined by $\\mathcal { F } = \\{ f _ { 1 } , \\ldots , f _ { M } \\}$ and $\\epsilon _ { f _ { i } } = \\epsilon _ { i }$ . Define $\\begin{array} { r } { f _ { \\lambda } ( u ) = \\sum _ { i = 1 } ^ { M } \\lambda _ { i } f _ { i } ( u ) } \\end{array}$ and denote its convex conjugate2 by $f _ { \\lambda } ^ { * }$ . The specification $\\phi$ is robustly certified at $\\rho$ with respect to $\\mathcal { D } _ { \\mathcal { F } }$ (cf. Definition 2.2) if and only $i f$ the optimal value of the following convex optimization problem is non-negative: ", + "bbox": [ + 173, + 642, + 825, + 702 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/d09b0f98805b182956667fae3f6d7cf5ed5e474dedec02afe488e65d2c27a26f.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\lambda _ { 1 } , \\dots , \\lambda _ { M } \\ge 0 , \\kappa } \\kappa - \\sum _ { i = 1 } ^ { M } \\lambda _ { i } \\epsilon _ { i } - \\underset { X \\sim \\rho } { \\mathrm { E } } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] .\n$$", + "text_format": "latex", + "bbox": [ + 321, + 708, + 674, + 752 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The proof of Theorem 1, given in Appendix A.4, uses standard duality results to show that the dual of the verification optimization problem has the desired form. We note that the special case where $M = 1$ reduces to Proposition 1 of Duchi & Namkoong (2018), although the result is used in a completely different context in that work. ", + "bbox": [ + 173, + 765, + 825, + 821 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To build a practical certification algorithm from Theorem 1, we must do two things: 1) compute the optimal values of $\\lambda$ and $\\kappa$ ; and 2) estimate the expectation in Eq. 6. Since the estimation of the expectation cannot be done in closed form (due to the black-box nature of $\\phi$ ), we must rely on sampling. In step 1 of Algorithm 1, we use $N$ samples taken independently from $\\rho$ to estimate the expectation and solve the “sampled” optimization problem using an off-the-shelf solver (Diamond ", + "bbox": [ + 174, + 828, + 825, + 900 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Algorithm 1 Full information certification (see appendix A.9 for details of subroutines) ", + "bbox": [ + 171, + 103, + 746, + 118 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Inputs: Query access to specification $\\phi : \\mathcal { X } [ a , b ]$ , sampling access to reference distribution $\\rho$ , divergences $f _ { i }$ and bounds $\\epsilon _ { i }$ , sample sizes $N$ , $\\tilde { N }$ , confidence level $\\zeta$ . \n1: $\\kappa ^ { * }$ $\\lambda ^ { * } \\gets \\mathrm { E S T I M A T E O P T } ( \\rho , \\phi , N , \\{ f _ { i } \\} _ { i = 1 } ^ { M } , \\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } ) .$ . \n2: $E _ { u b } \\gets$ UPPERCONFIDENCEBOUND(ρ, φ, N, ˜ {fi}Mi=1, $\\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } , a , b , \\lambda ^ { * } , \\kappa ^ { * } , \\zeta ) .$ \n3: If $\\begin{array} { r } { \\kappa ^ { * } - \\sum _ { i = 1 } ^ { M } \\lambda _ { i } ^ { * } \\epsilon _ { i } - E _ { u b } \\geq 0 } \\end{array}$ return CERTIFIED else return NOT CERTIFIED. ", + "bbox": [ + 171, + 119, + 826, + 204 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "& Boyd, 2016). This gives us $\\kappa ^ { * } , \\lambda ^ { * }$ , the estimated optimal values of $\\kappa$ and $\\lambda$ , respectively. Then we take these values and compute a high-confidence lower bound on the objective function of Eq. 6, which is then used to verify robustness. In particular, in step 2, we compute a high-confidence upper bound $E _ { u b }$ on the expectation term in the objective such that $E _ { u b } \\ge \\mathrm { E } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa ^ { * } - \\phi ( X ) ) ]$ with probability at least $\\zeta$ ; this computation involves taking $\\tilde { N }$ independent samples from $\\rho$ and finding a confidence interval around the resulting empirical estimate of the expectation (for details, see Eq. 25 in Appendix A.9.1). Plugging in this estimate back into Eq. 6 gives the desired high-confidence lower bound in step 3. Details of both subroutines ESTIMATEOPT and UPPERCONFIDENCEBOUND used in Algorithm 1 are given in Algorithm 3 in Appendix A.9.2. ", + "bbox": [ + 173, + 233, + 826, + 363 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Our next theorem concerns the specialization of this verification procedure to the information-limited setting. ", + "bbox": [ + 173, + 368, + 823, + 397 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorem 2 (Verifying information-limited robust certification). Let $\\mathcal { D } _ { \\mathcal { F } }$ be as in Theorem 1, and $S$ and $\\theta _ { a }$ , $\\theta _ { b }$ be as in Definition 2.1. The class of specifications $S$ is information-limited robustly certified at $\\rho$ with respect to $\\mathcal { D } _ { \\mathcal { F } }$ (cf. Definition 2.1) if and only if the optimal value of the following convex optimization problem is non-negative: ", + "bbox": [ + 174, + 401, + 825, + 458 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/392c4613b2cdeb1d1f9c9bca7fa2a97540eb13589960aba2f5a78dfa03703916.jpg", + "text": "$$\n\\begin{array} { r l } { \\underset { \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } \\geq 0 } { \\operatorname* { m i n } } } & { \\zeta _ { a } - \\zeta _ { b } } \\\\ { \\mathrm { S u b j e c t ~ t o } } & { \\zeta _ { a } + \\zeta _ { b } + \\zeta _ { c } = 1 } \\end{array} , \\quad D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i } \\quad i = 1 , \\dots , M \\ ,\n$$", + "text_format": "latex", + "bbox": [ + 272, + 464, + 723, + 511 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\theta = ( \\theta _ { a } , \\theta _ { b } , 1 - \\theta _ { a } - \\theta _ { b } )$ and $\\zeta = ( \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } )$ are interpreted as probability distributions. ", + "bbox": [ + 173, + 517, + 795, + 534 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The proof of Theorem 2 is presented in Appendix A.5. It is based on the fact that in the informationlimited setting, it is possible to directly compute the expectation in Eq. 6, and in fact this expectation only depends on $\\phi$ via the probabilities $\\theta _ { a }$ and $\\theta _ { b }$ . ", + "bbox": [ + 174, + 544, + 825, + 587 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorem 2 naturally leads to a certification algorithm, presented in Algorithm 2. It simply uses the same procedure as Cohen et al. (2019, Section 3.2) to compute a high-confidence lower bound $\\underline { { \\theta } } _ { a }$ on the probability of the correct class under randomized smoothing and then solves the convex optimization problem Eq. 7. Again, we can use an off-the-shelf solver CVXPY (Diamond & Boyd, 2016) in step 2 for the general $M > 1$ case, but closed-form solutions are also available for $M = 1$ ; these are given in Table 4 in Appendix A.6. ", + "bbox": [ + 173, + 593, + 826, + 678 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Algorithm 2 Information-limited certification ", + "text_level": 1, + "bbox": [ + 176, + 694, + 475, + 708 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Inputs: Query access to classifier $h$ , correct label $y$ , sampling access to reference distribution $\\rho$ divergences $f _ { i }$ and bounds $\\epsilon _ { i }$ , sample sizes $N , { \\tilde { N } }$ , confidence level $\\zeta$ . ", + "bbox": [ + 173, + 710, + 825, + 741 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "1: Sample $X ^ { 1 } , \\ldots , X ^ { N } \\sim \\rho$ and test3 whether $y = \\arg \\operatorname* { m a x } _ { y ^ { \\prime } \\in \\mathcal { V } } \\mathbb { P } _ { X \\sim \\rho } [ h ( X ) = y ^ { \\prime } ] .$ . \n2: Sample $X ^ { 1 } , \\dotsc , X ^ { \\tilde { N } } \\dotsc \\rho$ and compute4 a bound $\\mathbb { P } _ { X \\sim \\rho } [ h ( X ) = y ^ { \\prime } ] \\geq \\underline { { \\theta } } _ { a }$ with confidence $\\zeta$ . \n3: Obtain $o ^ { * }$ by solving Eq. 7 with $\\theta _ { a } \\gets \\underline { { \\theta _ { a } } }$ and $\\theta _ { b } \\gets 1 - \\theta _ { a }$ . \n4: If $o ^ { * } \\geq 0$ return CERTIFIED else return NOT CERTIFIED. ", + "bbox": [ + 179, + 741, + 818, + 804 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 THEORETICAL ANALYSIS OF CERTIFICATION METHODS ", + "text_level": 1, + "bbox": [ + 176, + 838, + 661, + 854 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We now present theoretical results characterizing our certification methods and show the following: ", + "bbox": [ + 174, + 869, + 821, + 885 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "1. For smoothed probabilistic classifiers, the full-information certificate dominates the informationlimited one. \n2. In the information-limited setting, if we define the $f$ -divergence relaxation $\\mathcal { D } _ { \\mathcal { F } }$ using HockeyStick divergences with specific parameters, then the computed certificate is provably tight. ", + "bbox": [ + 183, + 103, + 826, + 165 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 ADVANTAGE OF FULL-INFORMATION CERTIFICATION ", + "text_level": 1, + "bbox": [ + 173, + 180, + 580, + 195 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Consider a soft binary classifier $H : \\mathcal { X } [ 0 , 1 ]$ that outputs the probability of label $+ 1$ and consider a point $x \\in \\mathcal { X }$ with $\\dot { H } ( x ) > 1 / 2$ . We define the specification $\\begin{array} { r } { \\phi ( \\bar { x } ) = H ( x ) - \\frac { 1 } { 2 } } \\end{array}$ . Then, the smoothed classifier $H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ]$ predicts label $+ 1$ for all $x ^ { \\prime }$ with $\\left\\| x ^ { \\prime } - x \\right\\| ^ { - } \\leq \\epsilon$ if and only if $\\phi$ is full-information robustly certified at $\\mu ( x )$ with respect to $\\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\le \\epsilon \\}$ . Note that the optimization in Theorem 1 depends on the full distribution of $\\phi ( X ) \\in [ - 1 / 2 , 1 / 2 ]$ , $X \\sim \\mu ( x )$ . On the other hand, to certify this robustness in the information-limited setting is equivalent to taking the specification $\\phi ( x ) = 1 [ \\dot { H } ( x ) > 1 / 2 ]$ (the indicator function of the event $\\mathbf { \\bar { \\boldsymbol { H } } } ( x ) \\mathbf { \\bar { \\boldsymbol { { \\Sigma } } } } > 1 / 2$ ), in which case the only information available is $\\begin{array} { r } { \\dot { \\theta _ { a } } = H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ] } \\end{array}$ . ", + "bbox": [ + 173, + 205, + 825, + 320 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To compare the two approaches, consider the objective of Eq. 6 with a single $f$ -divergence constraint $D _ { f } ( \\nu \\| \\bar { \\rho } ) \\leq \\epsilon$ . Then, we have ", + "bbox": [ + 173, + 325, + 823, + 354 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/b5bd4199b09b54ebba6a7b65ec6c4c9d5a46818a3714bff2523de2703bc1fbe9.jpg", + "text": "$$\n\\begin{array} { l } { { \\displaystyle \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] = \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\kappa - H ( X ) + \\frac 1 2 \\biggr ) \\biggr ] } } \\\\ { { \\displaystyle = \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\biggl ( \\kappa + \\frac 1 2 - 1 \\biggr ) H ( X ) + \\biggl ( \\kappa + \\frac 1 2 \\biggr ) ( 1 - H ( X ) ) \\biggr ) \\biggr ] } } \\\\ { { \\displaystyle \\geq \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( X ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\kappa - \\frac 1 2 \\biggr ) H ( X ) + f _ { \\lambda } ^ { * } \\biggl ( \\kappa + \\frac 1 2 \\biggr ) ( 1 - H ( X ) ) \\biggr ] } } \\\\ { { \\displaystyle = \\kappa - \\lambda \\epsilon - \\theta _ { a } f _ { \\lambda } ^ { * } \\biggl ( \\kappa - \\frac 1 2 \\biggr ) - ( 1 - \\theta _ { a } ) f _ { \\lambda } ^ { * } \\biggl ( \\kappa + \\frac 1 2 \\biggr ) \\enspace , } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 238, + 358, + 758, + 500 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "where the third line follows from Jensen’s inequality. The proof of Theorem 2 shows that maximizing the final expression above with respect to $\\kappa , \\lambda$ is equivalent to the dual of the information-limited certification problem Eq. 7. Thus, the information-limited setting computes a weaker certificate than the full-information setting for soft classifiers: ", + "bbox": [ + 173, + 501, + 825, + 556 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Corollary 3. The optimization problem of Eq. 6 with the specification $\\phi$ defined above has an optimal value that is greater than or equal to that of the optimization problem defined in Eq. 7. ", + "bbox": [ + 173, + 559, + 825, + 588 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 TIGHT RELAXATIONS FOR INFORMATION-LIMITED ROBUST CERTIFICATION ", + "text_level": 1, + "bbox": [ + 176, + 603, + 735, + 618 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Ideally, we would like to certify robustness of specifications with respect to sets of the form $\\mathcal { D } _ { x , \\epsilon } =$ $\\{ \\mu ( x ^ { \\prime } ) : d ( x , x ^ { \\prime } ) \\leq \\epsilon \\}$ . The following result shows that the gap between the ideal $\\mathcal { D } _ { x , \\epsilon }$ and the tractable constraint sets $\\mathcal { D } _ { \\mathcal { F } }$ can be closed in the context of information-limited robust certification provided that we can measure hockey-stick divergences of every non-negative order $\\beta \\geq 0$ . The proof is given in Appendix A.7. ", + "bbox": [ + 173, + 628, + 825, + 700 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Theorem 4. Let $\\theta _ { a } , \\theta _ { b } , \\rho , \\mathcal { D } , S$ be as in Definition 2.1. Define $\\begin{array} { r } { \\epsilon _ { \\beta } = \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho ) } \\end{array}$ for all $\\beta \\geq 0$ and let $\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * }$ be chosen as follows: ", + "bbox": [ + 174, + 702, + 823, + 731 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/114ff4f4e0e4030ba88d6244efaca0e87b9cf2bc6c97faac81a34fbad909d29f.jpg", + "text": "$$\n\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * } = \\operatorname * { a r g m a x } _ { \\beta _ { a } \\ge \\beta _ { b } \\ge 0 } ~ 1 - \\beta _ { a } ( 1 - \\theta _ { a } ) - \\beta _ { b } \\theta _ { b } - \\left( \\epsilon _ { \\beta _ { a } } + [ 1 - \\beta _ { a } ] _ { + } \\right) - \\left( \\epsilon _ { \\beta _ { b } } + [ 1 - \\beta _ { b } ] _ { + } \\right) ~ .\n$$", + "text_format": "latex", + "bbox": [ + 197, + 734, + 782, + 763 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Define the constraint set ", + "bbox": [ + 174, + 766, + 334, + 780 + ], + "page_idx": 6 + }, + { + "type": "equation", + "img_path": "images/05c76d3cca17d0e7601088a458bb148e7c8408896dc247c73aa909fd7020141b.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { D } _ { \\mathrm { H S } } = \\left\\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { \\mathrm { H S } ; \\beta _ { \\alpha } ^ { * } } \\left( \\nu \\mid \\mid \\rho \\right) \\leq \\epsilon _ { \\beta _ { \\alpha } ^ { * } } \\right\\} \\cap \\left\\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { \\mathrm { H S } ; \\beta _ { b } ^ { * } } \\left( \\nu \\mid \\mid \\rho \\right) \\leq \\epsilon _ { \\beta _ { b } ^ { * } } \\right\\} \\ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 212, + 782, + 781, + 801 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Then, $S$ is information-limited robustly certified at $\\rho$ with respect to $\\mathcal { D }$ if and only if $S$ is informationlimited robustly certified at $\\rho$ with respect to ${ \\mathcal { D } } _ { \\mathrm { H S } }$ . Thus, the optimal information-limited certificate in this case can be obtained by applying theorem 2 to ${ \\mathcal { D } } _ { \\mathrm { H S } }$ . ", + "bbox": [ + 174, + 803, + 825, + 845 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5 CONNECTIONS WITH PRIOR WORK ", + "text_level": 1, + "bbox": [ + 174, + 864, + 490, + 881 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Table 1 summarizes the differences between our work and prior work in terms of the set of smoothing measures admitted, the offline computation cost of the certification procedure (which needs to be performed once for every possible perturbation size and choice of smoothing measure), the perturbations considered, whether they can use information beyond $\\theta _ { a } , \\theta _ { b }$ to improve the certificates and whether they compute optimal certificates for a given smoothing measure in the informationlimited setting. ", + "bbox": [ + 173, + 895, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 160 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/c57508577dadb223b408c2d9202c2b305bd1a1d469a5199fd5b315e5304ed52b.jpg", + "table_caption": [ + "Table 1: Comparison between black-box verification methods. \\* Technically, Lee et al. (2019) can handle smoothing measures such that the likelihood ratios take a finite set of values, but most practical instances of this correspond to finite-support distributions. " + ], + "table_footnote": [], + "table_body": "
μ(x))Computation-IUse additionalinformation?Optimal
Cohen et al. (2019)Gaussian0(1)l2XYes
Lee et al. (2019)FiniteSupport*0(d3)lOnly decision treesYes
Li et al. (2019)GaussianLaplacian0(1)l2lXNo
Lecuyer et al. (2019)Arbitrary0(1)AllepXNo
Our workArbitrary0(1)AllepArbitrary classifiersYes
", + "bbox": [ + 183, + 171, + 815, + 304 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Cohen et al. (2019) study the problem of verifying hard classifiers smoothed by Gaussian noise, and derive optimal certificates with respect to $\\ell _ { 2 }$ perturbations of the input. Their results can be recovered as a special case of our framework when applied to sets defined via constraints on hockey-stick divergences. Theorem 4 shows that the optimal certificate in the information-limited setting can be computed by applying theorem 2 to a constraint set with two hockey-stick divergences. ", + "bbox": [ + 173, + 368, + 825, + 439 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "For the Gaussian measure $\\mu ( x ) \\ : = \\ : \\mathcal { N } \\big ( x , \\sigma ^ { 2 } I \\big )$ , the HS divergence $D _ { \\mathrm { H S } , \\beta } ( \\mu ( x ) \\| \\mu ( x ^ { \\prime } ) )$ can be computed in closed form and is purely a function of the $\\ell _ { 2 }$ distance $\\| x - x ^ { \\prime } \\| _ { 2 }$ . This enables us to efficienctly compute the $\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * }$ in theorem 4. Thus, we obtain the following result (see Appendix A.7.2 for a proof): ", + "bbox": [ + 173, + 444, + 825, + 503 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Corollary 5. Let $\\rho = { \\mathcal { N } } ( x , \\sigma ^ { 2 } I )$ , $\\mathcal { D } _ { x , \\epsilon } = \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\le \\epsilon \\}$ and $1 \\geq \\theta _ { a } \\geq \\theta _ { b } \\geq 0 .$ Let $\\mathcal { D } _ { \\mathrm { H S } }$ be defined as in theorem 4. Then, applying theorem 2 to the constraint set ${ \\mathcal { D } } _ { \\mathrm { H S } }$ gives the following condition for robust certification: ", + "bbox": [ + 174, + 506, + 825, + 549 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/90e4972d8248ab2660ab422c82f2d31f2c4a99b3083973681f95a5a6546a4dbc.jpg", + "text": "$$\n\\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) + \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 ,\n$$", + "text_format": "latex", + "bbox": [ + 320, + 554, + 676, + 582 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\Psi _ { g }$ is the CDF of a standard normal random variable $\\mathcal { N } ( 0 , 1 )$ . With straightforward algebra (worked out in appendix A.7.2) , this can be shown to be equivalent to ", + "bbox": [ + 173, + 587, + 826, + 616 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/afd002e1852d49c3cb66d94ed45f36a01beded8fade67e4f7071433ea0590528.jpg", + "text": "$$\n\\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } ,\n$$", + "text_format": "latex", + "bbox": [ + 403, + 621, + 594, + 651 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "which is the certificate from Theorem 1 of Cohen et al. (2019). ", + "bbox": [ + 173, + 655, + 584, + 670 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Lee et al. (2019) derive optimal certificates in the information-limited setting under the assumption that the likelihood ratio between measures $\\frac { \\nu ( X ) } { \\rho ( X ) }$ (where $\\nu = \\mu ( \\boldsymbol { x } ^ { \\prime } ) , \\rho = \\mu ( \\boldsymbol { x } ) )$ can only take values from a finite set. This is a restrictive assumption that prevents the authors from accommodating natural smoothing measures like Gaussian or Laplacian measures. Further, the complexity of computing the certificates in their framework is significant: $O ( d ^ { 3 } )$ computation (where $d$ is the input dimension) is needed to certify smoothness to $\\ell _ { 0 }$ perturbations. The authors also derive tighter certificates for the special case of certain classes of decision trees by exploiting the tree structure. In contrast, our framework can derive tighter certificates in the full-information setting for arbitrary classifiers. ", + "bbox": [ + 173, + 680, + 825, + 799 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Li et al. (2019) use properties of Renyi divergences to derive robustness certificates for classifiers ´ smoothed by Gaussian (resp. Laplacian) noise under $\\ell _ { 2 }$ (resp. $\\ell _ { 1 }$ ) perturbations. Their results can be obtained as special cases of ours; in particular, the Renyi divergence certificates in Table 4 (in ´ Appendix A.6) recover the results of Lemma 1 of Li et al. (2019), but the latter are only applicable for Gaussian and Laplacian smoothing measures. ", + "bbox": [ + 174, + 804, + 825, + 875 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Lecuyer et al. (2019) introduce the notion of pixel differential privacy (pixelDP) and show that smoothing measures $\\mu$ satisfying pixelDP with respect to a certain type of perturbations lead to adversarially robust classifiers. We can show that pixelDP can be viewed as a special instance of our certification framework with two specific hockey-stick divergences, and that the certificates derived from the pixelDP are provably dominated by the certificates from our framework (Theorem 1) with the same choice of divergences (see Corollary 7 in Appendix A.7.3). ", + "bbox": [ + 174, + 881, + 823, + 924 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 146 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "6 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 184, + 326, + 199 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "6.1 FULL-INFORMATION IMPROVES UPON INFORMATION-LIMITED CERTIFICATION ", + "bbox": [ + 171, + 226, + 754, + 239 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To compare full-information certificates with limitedinformation certificates, we trained a ResNet-152 model on ImageNet with data augmentation by adding noise via sampling from a zero-mean Gaussian with variance 0.5 for each coordinate; during certification we sample from the same distribution to estimate lower bounds on the probability of the top predicted class. For the fullinformation certificate, we use two hockey-stick divergences for the certificate and tune the parameters $\\beta$ to obtain the highest value in the optimization problem in step 2 of Algorithm 1. For the infromation-limited certificate, our approach reduces to that of (Cohen et al., 2019) and we follow the same certification procedure. We use $N = 1 0 0 0 , \\tilde { N } = 1 0 0 0 0 0 , \\zeta = . 9 9$ for both certification procedures. ", + "bbox": [ + 174, + 258, + 549, + 467 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Figure 2 shows the difference between the two certificates. The certificate provided by the full-information method is always stronger than the one given by the informationlimited method. The difference is often substantial – for one of the test samples, the full-information setting can certify robustness to $\\ell _ { 2 }$ perturbations of radius $\\epsilon = 9 . 4 2$ in the full-information case while the limited-information certificate can only be provided for perturbation radius $\\epsilon = 2 . 6 9$ . ", + "bbox": [ + 174, + 474, + 549, + 598 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/27abe4bd89aec0a79207152ac4aab0cd74feeb3c0907b124f56b118683dab4c3.jpg", + "image_caption": [ + "Figure 2: Information-limited vs fullinformation certificates for ImageNet for $\\ell _ { 2 }$ perturbations. The dashed line represents equal certificates and every point below the dashed line has a stronger certificate from the full information verification setting. We run the comparison on 50 randomly selected examples from the validation set. Each blue dot in Figure 2 corresponds to one test point, with its x coordinate representing the radius for full information certificate (from Algorithm 1) and y coordinate the informationlimited certificate (which is equivalent to the certification procedure of Cohen et al., 2019). The running time of the full-information certification procedure is .2s per example (excluding the sampling cost) while the limitedinformation certification takes .002s per example. Both procedures incur the same sampling cost as they use the same number of samples. " + ], + "image_footnote": [], + "bbox": [ + 593, + 272, + 790, + 422 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "6.2 SCALABILITY AND TIGHTNESS ", + "text_level": 1, + "bbox": [ + 176, + 633, + 429, + 647 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this section we consider $\\ell _ { 0 }$ perturbations for both ImageNet and Binary MNIST (that is, we consider the number of pixels that can be perturbed without changing the prediction). To test for scalability and tightness trade-offs of our framework, we compare our methodology to that of ", + "bbox": [ + 174, + 666, + 550, + 736 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Lee et al. (2019), as their work obtains the optimal bound for $\\ell _ { 0 }$ . We computed certificates for a single model for each classification task; for Binary MNIST we used the same model and training procedure as Lee et al. (2019) and for ImageNet, we used the model released in the Github code accompanying the paper of Lee et al. (2019). We use the discrete smoothing measure (appendix A.10) with parameter $p = 0 . 8$ for Binary MNIST certification, and $p = 0 . 2$ for ImageNet certification. ", + "bbox": [ + 174, + 736, + 825, + 805 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In our experiments we ran the certification procedures on all test examples from the Binary MNIST dataset, while for ImageNet, following prior work (Lee et al., 2019; Cohen et al., 2019), on every 100th example from validation set. The proportion of the examples for which $\\epsilon$ accuracy can be certified are reported in Table 2 for various values of $\\epsilon$ . Comparing with the optimal certificates obtained by the certification method of Lee et al. (2019), the table shows that our bounds remains tight for Binary MNIST up until $\\epsilon = 3$ , and we do so with 130 times speed-up. For ImageNet, our bounds differ only about $7- 1 5 \\%$ in terms of accuracy, and we obtain this with approximately 20 million times speed-up. ", + "bbox": [ + 174, + 813, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "table", + "img_path": "images/b94e8b3ff271c994562eef0af521ce36804ae30a3a922b4c4af9f43002597d66.jpg", + "table_caption": [ + "Table 2: Proportion of the examples with verified $\\ell _ { 0 }$ -robustness for different accuracy (\u000f) parameters. " + ], + "table_footnote": [], + "table_body": "
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
e=1e=2e=3e=4e=5∈=6∈=7
Binary MNISTLee et al. (2019) Ours0.83.68s 0.028s0.919 0.9190.767 0.7670.530 0.5300.513 0.2960.348 0.1620.194 0.0800.095 0.015
ImageNetLee et al. (2019) Ours0.24 days 0.028s0.488 0.3620.418 0.2620.310 0.2240.250 0.1860.244 0.1360.234 00.224 0
", + "bbox": [ + 173, + 101, + 825, + 199 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "6.3 CERTIFICATION FOR AUDIO CLASSIFICATION: LIBRISPEECH ", + "text_level": 1, + "bbox": [ + 173, + 236, + 632, + 251 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Audio classification systems have been shown to be susceptible to adversarial attacks (Qin et al., 2019). However, building audio classifiers that are provably robust to adversarial attacks has been hard due to the complexity of audio processing architectures. We take a step towards provably robust audio classifiers by showing that our approach can certify robustness of a classifier trained for speaker recognition on a state-of-the-art model for this task. We focus on $\\ell _ { 0 }$ perturbations that zero out a fraction of the audio sample, as they correspond to missing data in an audio signal. Missing data can occur due to errors in recording audio or packets dropped while transmitting an audio signal over a network and is a common issue (Turner, 2010; Smaragdis et al., 2009). ", + "bbox": [ + 173, + 262, + 825, + 373 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "In principle, the method of Lee et al. (2019) is applicable to compute robustness certificates, but at an impractically large computational cost, since the computation needs to be repeated whenever an input of a new length (for which a certificate has not previously been computed) arrives. Concretely, this constitutes an $\\mathrm { \\bar { \\it O } } ( d ^ { 3 } )$ computation for the length $d$ ranging from 38 to 522,320 (the set of audio sequence lengths observed in the Librispeech test dataset (Panayotov et al., 2015)). ", + "bbox": [ + 174, + 380, + 825, + 450 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The results are shown in Table 3. To the best of our knowledge, these are the first results showing certified robustness of an audio classifier. We believe this is a significant advance towards certification of classifiers in audio and classifiers operating on variable-length inputs more generally. ", + "bbox": [ + 173, + 457, + 825, + 500 + ], + "page_idx": 9 + }, + { + "type": "table", + "img_path": "images/e9c677106e107223e320ee90a274f5a92791d1060911dc9a42d3454a3594d467.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
∈=0∈=1e=2e=3e=4e=5e=6e=7
0.50.5110.2250.0910.0910.0910.0910.0910
LibrispeechOurs0.70.028s0.8850.6340.4050.4050.4050.40500
0.90.8720.7720.7110.7110.711000
", + "bbox": [ + 173, + 511, + 825, + 594 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Table 3: $\\ell _ { 0 }$ robustness results for Librispeech (Panayotov et al., 2015). From the Librispeech dataset, we created a corpus of sentence utterances from ten different speakers. The classification task is, given an audio sample, to predict whom is speaking. The test set consisted of 30 audio samples for each of the ten speakers. We use a DeepSpeaker architecture (Li et al., 2017), trained with the Adam optimizer $\\beta _ { 1 } = 0 . 9$ , $\\beta _ { 2 } = 0 . 5$ ) for 50,000 steps with a learning rate of 0.0001. The architecture is the same as that of Li et al. (2017), except for changing the number of neurons in the final layer for speaker identification with ten classes. Three models were trained with smoothing values of $p = 0 . 5$ , $p = 0 . 7$ , and $p = 0 . 9$ , respectively, and we used the same values for certification. Certification was performed using $N = 1 0 0 0 , \\tilde { N } = 1 0 0 0 0 0 , \\zeta = . 9 9$ using $M = 1$ Renyi ´ divergence, with $\\alpha$ tuned to obtain the best certificate. The proportion of samples with certified robustness for different accuracy values are reported, computed on 300 test set samples. ", + "bbox": [ + 173, + 603, + 825, + 732 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "7 CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 750, + 318, + 766 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We have introduced a general framework for black-box verification using $f$ -divergence constraints. The framework improves upon state-of-the-art results on both image classification and audio tasks by a significant margin in terms of robustness certificates or computation time. We believe that our framework can potentially enable scalable computation of robustness verification for more complex predictors and structured perturbations that can be modeled using f-divergence constraints. ", + "bbox": [ + 174, + 781, + 825, + 852 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 176, + 872, + 285, + 887 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Syed Mumtaz Ali and Samuel D Silvey. A general class of coefficients of divergence of one distribution from another. Journal of the Royal Statistical Society: Series B (Methodological), 28 ", + "bbox": [ + 176, + 895, + 823, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "(1):131–142, 1966. ", + "bbox": [ + 189, + 103, + 316, + 117 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Anish Athalye, Nicholas Carlini, and David Wagner. Obfuscated gradients give a false sense of security: Circumventing defenses to adversarial examples. In International Conference on Machine Learning, 2018. ", + "bbox": [ + 174, + 128, + 823, + 171 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jean-Yves Audibert, Remi Munos, and Csaba Szepesv ´ ari. Exploration-exploitation tradeoff using ´ variance estimates in multi-armed bandits. Theoretical Computer Science, 410(19):1876–1902, 2009. ", + "bbox": [ + 173, + 181, + 826, + 223 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Borja Balle and Yu-Xiang Wang. Improving the gaussian mechanism for differential privacy: Analytical calibration and optimal denoising. In International Conference on Machine Learning, pp. 403–412, 2018. ", + "bbox": [ + 173, + 234, + 826, + 277 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Gilles Barthe and Federico Olmedo. Beyond differential privacy: Composition theorems and relational logic for f-divergences between probabilistic programs. In International Colloquium on Automata, Languages, and Programming, pp. 49–60. Springer, 2013. ", + "bbox": [ + 174, + 287, + 825, + 332 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Battista Biggio, Igino Corona, Davide Maiorca, Blaine Nelson, Nedim Srndic, Pavel Laskov, Giorgio Giacinto, and Fabio Roli. Evasion attacks against machine learning at test time. In Joint European conference on machine learning and knowledge discovery in databases, pp. 387–402. Springer, 2013. ", + "bbox": [ + 174, + 340, + 826, + 397 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Sebastian Bubeck. Orf523 (advanced optimization): Introduction. https://blogs.princeton.edu/imabandit/2013/02/05/orf523-advanced-optimization-introduction/, 2013. ", + "bbox": [ + 173, + 407, + 826, + 450 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Charles J Clopper and Egon S Pearson. The use of confidence or fiducial limits illustrated in the case of the binomial. Biometrika, 26(4):404–413, 1934. ", + "bbox": [ + 173, + 460, + 823, + 491 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jeremy M Cohen, Elan Rosenfeld, and J Zico Kolter. Certified adversarial robustness via randomized smoothing. arXiv preprint arXiv:1902.02918, 2019. ", + "bbox": [ + 173, + 500, + 825, + 530 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Imre Csiszar, Paul C Shields, et al. Information theory and statistics: A tutorial. ´ Foundations and Trends $\\textsuperscript { \\textregistered }$ in Communications and Information Theory, 1(4):417–528, 2004. ", + "bbox": [ + 171, + 540, + 823, + 569 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Steven Diamond and Stephen Boyd. Cvxpy: A python-embedded modeling language for convex optimization. The Journal of Machine Learning Research, 17(1):2909–2913, 2016. ", + "bbox": [ + 174, + 579, + 823, + 608 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "John Duchi and Hongseok Namkoong. Learning models with uniform performance via distributionally robust optimization. arXiv preprint arXiv:1810.08750, 2018. ", + "bbox": [ + 171, + 617, + 823, + 647 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Krishnamuthy Dvijotham, Robert Stanforth, Sven Gowal, Timothy Mann, and Pushmeet Kohli. Towards scalable verification of neural networks: A dual approach. In Conference on Uncertainty in Artificial Intelligence, 2018. ", + "bbox": [ + 174, + 656, + 825, + 700 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. In International Conference on Machine Learning, 2015. ", + "bbox": [ + 173, + 710, + 825, + 739 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Po-Sen Huang, Robert Stanforth, Johannes Welbl, Chris Dyer, Dani Yogatama, Sven Gowal, Krishnamurthy Dvijotham, and Pushmeet Kohli. Achieving verified robustness to symbol substitutions via interval bound propagation. arXiv preprint arXiv:1909.01492, 2019. ", + "bbox": [ + 173, + 750, + 826, + 792 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Kenneth Hung and William Fithian. Rank verification for exponential families. The Annals of Statistics, 47(2):758–782, 2019. ", + "bbox": [ + 171, + 803, + 825, + 832 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Robin Jia, Aditi Raghunathan, Kerem Goksel, and Percy Liang. Certified robustness to adversarial ¨ word substitutions. arXiv preprint arXiv:1909.00986, 2019. ", + "bbox": [ + 169, + 842, + 825, + 871 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Guy Katz, Clark Barrett, David L Dill, Kyle Julian, and Mykel J Kochenderfer. Reluplex: An efficient smt solver for verifying deep neural networks. In International Conference on Computer Aided Verification, pp. 97–117. Springer, 2017. ", + "bbox": [ + 174, + 881, + 825, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Mathias Lecuyer, Vaggelis Atlidakis, Roxana Geambasu, Daniel Hsu, and Suman Jana. Certified robustness to adversarial examples with differential privacy. In 2019 IEEE Symposium on Security and Privacy $( S P )$ , pp. 656–672. IEEE, 2019. ", + "bbox": [ + 176, + 103, + 823, + 146 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Guang-He Lee, Yang Yuan, Shiyu Chang, and Tommi S Jaakkola. A stratified approach to robustness for randomly smoothed classifiers. arXiv preprint arXiv:1906.04948, 2019. ", + "bbox": [ + 173, + 155, + 823, + 184 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Bai Li, Changyou Chen, Wenlin Wang, and Lawrence Carin. Certified adversarial robustness with additive noises. In Advances in Neural Information Processing Systems, 2019. ", + "bbox": [ + 171, + 193, + 823, + 222 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Chao Li, Xiaokong Ma, Bing Jiang, Xiangang Li, Xuewei Zhang, Xiao Liu, Ying Cao, Ajay Kannan, and Zhenyao Zhu. Deep speaker: an end-to-end neural speaker embedding system. arXiv preprint arXiv:1705.02304, 2017. ", + "bbox": [ + 173, + 229, + 823, + 272 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Friedrich Liese and Igor Vajda. On divergences and informations in statistics and information theory. IEEE Transactions on Information Theory, 52(10):4394–4412, 2006. ", + "bbox": [ + 171, + 281, + 825, + 310 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards deep learning models resistant to adversarial attacks. In International Conference on Learning Representations, 2018. ", + "bbox": [ + 174, + 319, + 825, + 363 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "V. Panayotov, G. Chen, D. Povey, and S. Khudanpur. Librispeech: An asr corpus based on public domain audio books. In 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5206–5210, April 2015. doi: 10.1109/ICASSP.2015.7178964. ", + "bbox": [ + 174, + 371, + 825, + 414 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yao Qin, Nicholas Carlini, Ian Goodfellow, Garrison Cottrell, and Colin Raffel. Imperceptible, robust, and targeted adversarial examples for automatic speech recognition. arXiv preprint arXiv:1903.10346, 2019. ", + "bbox": [ + 174, + 422, + 826, + 465 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Aditi Raghunathan, Jacob Steinhardt, and Percy Liang. Certified defenses against adversarial examples. In International Conference on Learning Representations, 2018. URL https:// openreview.net/forum?id $\\underline { { \\underline { { \\mathbf { \\Pi } } } } } =$ Bys4ob-Rb. ", + "bbox": [ + 174, + 473, + 825, + 517 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Paris Smaragdis, Bhiksha Raj, and Madhusudana Shashanka. Missing data imputation for spectral audio signals. In 2009 IEEE International Workshop on Machine Learning for Signal Processing, pp. 1–6. IEEE, 2009. ", + "bbox": [ + 174, + 525, + 823, + 569 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Thomas Steinke and Jonathan Ullman. Between pure and approximate differential privacy. Journal of Privacy and Confidentiality, 7(2), 2016. ", + "bbox": [ + 169, + 577, + 825, + 607 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. Intriguing properties of neural networks. In International Conference on Learning Representations, 2014. ", + "bbox": [ + 171, + 614, + 825, + 657 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Richard E Turner. Statistical models for natural sounds. PhD thesis, UCL (University College London), 2010. ", + "bbox": [ + 169, + 666, + 825, + 695 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Jonathan Uesato, Brendan O’Donoghue, Aaron van den Oord, and Pushmeet Kohli. Adversarial risk and the dangers of evaluating against weak attacks. In International Conference on Machine Learning, 2018. ", + "bbox": [ + 173, + 704, + 823, + 747 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Eric Wong and J Zico Kolter. Provable defenses against adversarial examples via the convex outer adversarial polytope. International Conference on Machine Learning, 2018. ", + "bbox": [ + 171, + 756, + 823, + 785 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Eric Wong, Frank Schmidt, Jan Hendrik Metzen, and J Zico Kolter. Scaling provable adversarial defenses. In Advances in Neural Information Processing Systems, pp. 8400–8409, 2018. ", + "bbox": [ + 174, + 792, + 821, + 823 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A APPENDIX ", + "text_level": 1, + "bbox": [ + 176, + 102, + 299, + 117 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.1 ADVERSARIAL SPECIFICATION FOR SMOOTHED CLASSIFIERS", + "text_level": 1, + "bbox": [ + 174, + 135, + 637, + 148 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Note that for any $\\nu \\in \\mathcal { D } _ { x , \\epsilon }$ we have ", + "bbox": [ + 176, + 160, + 408, + 175 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/5887b450649865eea016184c4c5a13304c9900c37a76019922292c68371f1580.jpg", + "text": "$$\n\\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] = \\operatorname * { \\mathbb { P } } _ { X \\sim \\nu } [ h ( X ) = c ] - \\operatorname { \\mathbb { P } } _ { X \\sim \\nu } [ h ( X ) = c ^ { \\prime } ] ~ .\n$$", + "text_format": "latex", + "bbox": [ + 315, + 181, + 681, + 204 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Therefore, $\\begin{array} { r l r } { \\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] } & { { } \\geq } & { 0 } \\end{array}$ for all $c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}$ is equivalent to $c \\in$ arg $\\mathrm { m a x } _ { y \\in \\mathcal { Y } } \\mathbb { P } _ { X \\sim \\nu } [ h ( X ) = y ]$ . For $\\nu = \\mu ( x ^ { \\prime } )$ , this means that $h _ { s } ( x ^ { \\prime } ) = c$ (assuming the argmax is unique). In other words, $\\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] \\geq 0$ for all $c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}$ and all $\\mu ( x ^ { \\prime } ) \\in \\mathcal { D } _ { x , \\epsilon }$ if and only if $h _ { s } ( x ^ { \\prime } ) = c$ for all $x ^ { \\prime }$ such that $d ( x , x ^ { \\prime } ) \\leq \\epsilon$ , proving the required robustness certificate. ", + "bbox": [ + 173, + 212, + 826, + 271 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.1.1 ROBUSTNESS SPECIFICATION FOR SMOOTHED SOFT CLASSIFIERS", + "text_level": 1, + "bbox": [ + 174, + 286, + 679, + 301 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Consider a soft classifier $H : \\mathcal { X } \\to \\mathcal { P } ( \\mathcal { Y } )$ that for each input $x$ returns a probability distribution $H ( x )$ over the set of potential labels $\\mathcal { V }$ (e.g. $H$ might represent the outputs of the soft-max layer of a neural network). As in the case of hard classifiers, our methodology can be used to provide robustness guarantees for smoothed soft classifiers obtained by applying a smoothing measure $\\mu ( x )$ to the input. In this case, the smoothed classifier is again a soft classifier given by $H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ]$ . ", + "bbox": [ + 174, + 310, + 825, + 382 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Let $x$ be a fixed input point and write $p = H _ { s } ( x ) \\in \\mathcal { P } ( \\mathcal { V } )$ to denote the distribution over labels. A number of robustness properties about the soft classifier $H _ { s }$ at $x$ can be phrased in terms of Definition 2.2. For example, let $\\mathcal { V } = \\{ 1 , \\ldots , K \\}$ and suppose that $p _ { 1 } \\ge p _ { 2 } \\ge \\cdots \\ge p _ { K }$ so that $\\{ 1 , \\ldots , k \\}$ are the top $k$ labels at $x$ . Then we can verify that the set of top $k$ labels will not change when moving the input from $x$ to $x ^ { \\prime }$ with $\\| x - x ^ { \\prime } \\| \\leq \\epsilon$ by defining the specifications $\\begin{array} { r } { \\phi _ { i , j } ( \\bar { z } ) = H ( z ) _ { i } - \\bar { H } ( z ) _ { j } } \\end{array}$ for $i \\in [ 1 , k ]$ and $j \\in [ k + 1 , K ]$ , and showing that all of these $\\phi _ { i , j }$ are robustly certified at $\\mu ( x )$ with respect to the set $\\mathcal { D } _ { x , \\epsilon }$ defined above. The case $k = 1$ corresponds to robustness of the standard classification rule outputting the label with the largest score. ", + "bbox": [ + 173, + 388, + 825, + 501 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Another example is robustness of classifiers which are allowed to abstain. For example, suppose we build a hard classifier $\\tilde { h }$ out of $H _ { s }$ which returns the label with the maximum score as long as the gap between this score and the score of any other label is at least $\\gamma$ ; otherwise it produces no output. Then we can certify that $\\tilde { h }$ will not abstain and return the label $c = \\arg \\operatorname* { m a x } _ { y \\in \\mathcal { y } } p _ { y }$ at any point close to $x$ by showing that every $\\phi _ { c ^ { \\prime } } ( z ) = H ( z ) _ { c } - H ( z ) _ { c ^ { \\prime } } - \\gamma , c ^ { \\prime } \\neq c$ , is robustly certified at $\\mu ( x )$ with respect to $\\mathcal { D } _ { x , \\epsilon }$ . ", + "bbox": [ + 173, + 507, + 826, + 598 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.2 BACKGROUND ON F-DIVERGENCES ", + "text_level": 1, + "bbox": [ + 178, + 614, + 460, + 628 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A number of well-known properties about $f$ -divergences are used throughout the paper, both explicitly and implicitly. Here we review such properties for the readers’ convenience. Proofs and further details can be found in, e.g., (Csiszar et al., 2004; Liese & Vajda, 2006). ´ ", + "bbox": [ + 176, + 640, + 825, + 683 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Recall that the $f$ -divergences can be defined for any convex function $f : \\mathbb { R } _ { + } \\to \\mathbb { R }$ such that $f ( 1 ) = 0$ . We note that this requirement holds without loss of generality as the map $x \\mapsto f ( x ) - f ( 1 )$ is convex whenever $f$ is convex. Any $f$ -divergence $D _ { f }$ satisfies the following: ", + "bbox": [ + 174, + 689, + 826, + 732 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "1. $D _ { f } ( \\nu \\| \\rho ) \\geq 0$ . \n2. $D _ { f } ( \\rho \\| \\rho ) = 0$ , and $D _ { f } ( \\nu \\| \\rho ) = 0$ implies $\\nu = \\rho$ whenever $f$ is strictly convex at 1. \n3. $D _ { f } ( F _ { * } ( \\nu ) \\| F _ { * } ( \\rho ) ) \\le D _ { f } ( \\nu \\| \\rho )$ for any function $F$ , where $F _ { * } ( \\rho )$ is the push-forward of $\\rho$ . \n4. $D _ { f } ( \\nu \\| \\rho ) = D _ { \\bar { f } } ( \\rho \\| \\nu )$ where $\\begin{array} { r } { \\bar { f } ( u ) = u f \\left( \\frac { 1 } { u } \\right) } \\end{array}$ is again convex with ${ \\bar { f } } ( 1 ) = 0$ . ", + "bbox": [ + 210, + 742, + 821, + 820 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.3 BOUNDING RENYI DIVERGENCES ", + "text_level": 1, + "bbox": [ + 176, + 835, + 450, + 851 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We being with the optimization problem ", + "bbox": [ + 174, + 862, + 439, + 877 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/ffd4570ca1f1d8a57429322349f103fa2b73834471d68c3191af1e0e499e0456.jpg", + "text": "$$\n\\begin{array} { r } { \\underset { x ^ { \\prime } } { \\operatorname* { m a x } } R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) } \\\\ { \\mathrm { s u b j e c t ~ t o ~ } \\| x - x ^ { \\prime } \\| _ { p } \\leq \\epsilon } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 421, + 883, + 583, + 929 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Since we have $\\begin{array} { r } { R _ { \\alpha } ( \\mu ( { x ^ { \\prime } } ) \\| \\mu ( x ) ) = \\sum _ { i } R _ { \\alpha } ( \\mu _ { i } ( { x _ { i } ^ { \\prime } } ) \\| \\mu _ { i } ( x _ { i } ) ) } \\end{array}$ . The constraint can be rewritten as ", + "bbox": [ + 173, + 102, + 790, + 121 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/8640be02edda35a95b909d821382652f8e044e860066fdd2dd7ebc201dd91ef7.jpg", + "text": "$$\n\\sum _ { i } | x _ { i } - x _ { i } ^ { \\prime } | ^ { P } \\leq \\epsilon ^ { p }\n$$", + "text_format": "latex", + "bbox": [ + 429, + 126, + 566, + 159 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Forming the Lagrangian relaxation, we obtain ", + "bbox": [ + 173, + 165, + 475, + 180 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/5f4ee11168acbdbcc5eb8a5d0bc4f520d3272316c4f12d412eed823e647b7fe6.jpg", + "text": "$$\n\\operatorname* { m a x } _ { x ^ { \\prime } \\colon | x _ { i } ^ { \\prime } - x _ { i } | \\leq \\epsilon } \\sum _ { i } R _ { \\alpha } ( \\mu _ { i } ( x _ { i } ^ { \\prime } ) \\| \\mu _ { i } ( x _ { i } ) ) + \\gamma \\left( \\sum _ { i } | x _ { i } ^ { \\prime } - x _ { i } | ^ { p } - \\epsilon ^ { p } \\right) \\ .\n$$", + "text_format": "latex", + "bbox": [ + 284, + 185, + 715, + 228 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "where the constraint $| x _ { i } ^ { \\prime } - x _ { i } | \\leq \\epsilon$ is implied by $\\| x ^ { \\prime } - x \\| _ { p } \\leq \\epsilon$ . We can maximize separately over each $\\boldsymbol { x } _ { i } ^ { \\prime }$ to obtain ", + "bbox": [ + 173, + 234, + 821, + 266 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/566fda9e095d69a8fc674803a81098eecf683ee421ca022de244a8038923ca36.jpg", + "text": "$$\n- \\gamma \\epsilon ^ { p } + \\sum _ { i } \\operatorname* { m a x } _ { x _ { i } ^ { \\prime } \\in [ x _ { i } - \\epsilon , x _ { i } + \\epsilon ] } R _ { \\alpha } ( \\mu _ { i } ( x _ { i } ^ { \\prime } ) \\| \\mu _ { i } ( x _ { i } ) ) + \\gamma | x _ { i } ^ { \\prime } - x _ { i } | ^ { p } .\n$$", + "text_format": "latex", + "bbox": [ + 289, + 272, + 709, + 306 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "By weak duality, for any $\\gamma \\geq 0$ , this is an upper bound on Eq. 10. We can minimize this bound over $\\gamma \\geq 0$ to obtain the tightest bound. ", + "bbox": [ + 173, + 311, + 821, + 342 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The minimization over $\\boldsymbol { x } _ { i } ^ { \\prime }$ for each $i$ can be solved in closed-form or via as simple 1-dimensional minimization problem for most smoothing measures. ", + "bbox": [ + 173, + 347, + 825, + 377 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "A.4 PROOF OF THEOREM 1 ", + "text_level": 1, + "bbox": [ + 174, + 392, + 372, + 407 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For simplicity of exposition (and to avoid measure theoretic issues), we focus on the case where $\\nu , \\rho$ have well defined densities $\\nu ( x ) , \\rho ( x )$ such that $\\rho ( x ) > 0$ whenever $\\nu ( x ) > 0$ . ", + "bbox": [ + 174, + 419, + 823, + 449 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We begin by rewriting the optimization problem in terms of the likelihood ratio $\\begin{array} { r } { r ( X ) = \\frac { \\nu ( X ) } { \\rho ( X ) } } \\end{array}$ : We have ", + "bbox": [ + 173, + 457, + 823, + 488 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/acd22004c7df47fc2ad1d9b81b0d410782d499d42e235d68fe25274677c7ada6.jpg", + "text": "$$\n\\operatorname { \\mathrm { ~ \\underset { X \\sim \\nu } { E } ~ } } [ \\phi ( X ) ] = \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ r ( X ) \\phi ( X ) ] ~ , \\quad D _ { f _ { i } } ( \\rho | | \\nu ) = \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ f _ { i } ( r ( X ) ) ] ~ , \\quad \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ r ( X ) ] = 1 ~ ,\n$$", + "text_format": "latex", + "bbox": [ + 212, + 494, + 784, + 520 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "where the first two equalities follow directly by plugging in $\\nu ( X ) = \\rho ( X ) r ( X )$ and the third is obtained using the fact that $\\nu$ is a probability measure. Using these relations, the optimization over $\\nu$ can be rewritten as ", + "bbox": [ + 174, + 526, + 825, + 569 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/3e870f9b6f06b6121e050ae11b8e4b06170ad94bbbe46cdb8ec78eba93b6b289.jpg", + "text": "$$\n\\begin{array} { r } { \\underset { r \\geq 0 } { \\mathrm { m i n } } \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) \\phi ( X ) ] \\qquad } \\\\ { \\mathrm { s u b j e c t ~ t o } \\underset { X \\sim \\rho } { \\mathrm { E } } [ f _ { i } ( r ( X ) ) ] \\leq \\epsilon _ { i } , \\quad \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) ] = 1 \\ , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 323, + 571, + 671, + 625 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "where $r \\geq 0$ denotes that $r ( x ) \\geq 0 \\quad \\forall x \\in \\mathcal { X }$ . The optimization over $r$ is a convex optimization problem and can be solved using Lagrangian duality as follows – we first dualize the constraints on $r$ to obtain ", + "bbox": [ + 174, + 630, + 825, + 672 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/20495ef31304d6fdc887ffbdc180c63cbf3edc10bc19f8183ebaef1589141650.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle \\operatorname* { m i n } _ { r > 0 } \\ \\operatorname { E } _ { \\gamma \\to 0 } \\big [ r ( X ) \\phi ( X ) \\big ] + \\sum _ { i } \\lambda _ { i } \\bigg ( \\underbrace { \\mathrm { F } _ { \\mathrm { f } } \\left[ f _ { i } ( r ( X ) ) \\right] - \\epsilon } _ { X \\sim \\rho } \\bigg ) + \\kappa \\bigg ( 1 - \\underbrace { \\mathrm { F } _ { \\mathrm { c } } \\left[ r ( X ) \\right] } _ { X \\sim \\rho } \\bigg ) } \\\\ { = \\displaystyle \\operatorname* { m i n } _ { r \\ge 0 } \\ \\mathrm { E } _ { r \\to 0 } \\bigg [ r ( X ) \\phi ( X ) + \\sum _ { i } \\lambda _ { i } f _ { i } ( r ( X ) ) - \\kappa r ( X ) \\bigg ] + \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { F } } _ { X \\sim \\rho } \\bigg [ \\operatorname* { m a x } _ { r \\to 0 } \\kappa r - r \\phi ( X ) - \\sum _ { i } \\lambda _ { i } f _ { i } ( r ) \\bigg ] } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { ~ E } } _ { X \\sim \\rho } \\bigg [ \\operatorname* { m a x } _ { r \\to 0 } \\big ( r ( \\kappa - \\phi ( X ) ) - f _ { \\lambda } ( r ) \\big ) \\bigg ] } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { ~ E } } _ { X \\sim \\rho } \\bigg [ r \\xi ( \\kappa - \\phi ( X ) ) \\big ] \\ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 243, + 676, + 754, + 877 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "By strong duality, it holds that maximizing the final expression with respect to $\\lambda \\geq 0 , \\kappa$ achieves the optimal value in Eq. 11. Thus, if the optimal value is smaller than 0, the specification is not robustly certified and if it is larger than 0, the specification is robustly certified. Finally, since we are ultimately interested in proving that the objective is non-negative, we can restrict ourselves to $\\lambda \\geq 0$ such that $\\textstyle \\sum _ { i } \\lambda _ { i } = 1$ (since if the optimal $\\lambda$ added up to something larger, we could simply rescale the values to add up to 1 and multiply $\\kappa$ by the same scaling factor without changing the sign of the objective function). ", + "bbox": [ + 174, + 881, + 825, + 924 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 160 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "This concludes the proof of correctness of the certificate Eq. 6. ", + "bbox": [ + 173, + 165, + 584, + 181 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "A.5 PROOF OF THEOREM 2 ", + "text_level": 1, + "bbox": [ + 176, + 196, + 374, + 212 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "For the next result, we observe that when $\\phi$ is ternary valued, the optimization over $\\kappa , \\lambda$ above can be written as ", + "bbox": [ + 173, + 223, + 825, + 250 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/c87cee6dbec3e420756cd91d667ba82a8e1b8aa75be3add8f2f08cde51774c05.jpg", + "text": "$$\n\\begin{array} { r l r } { { \\stackrel { \\mathrm { m a x } } { = } } } & { \\displaystyle \\operatorname* { m a x } _ { \\kappa , \\lambda \\geq 0 } \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\theta _ { a } f _ { \\lambda } ^ { * } \\big ( \\kappa - 1 \\big ) - \\theta _ { b } f _ { \\lambda } ^ { * } \\big ( \\kappa + 1 \\big ) - \\theta _ { c } f _ { \\lambda } ^ { * } \\big ( \\kappa \\big ) \\ , } \\\\ & { } & \\\\ & { \\displaystyle _ { \\imath } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] , \\theta _ { b } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = - 1 ] , \\theta _ { c } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = 0 ] . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 230, + 246, + 720, + 299 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Writing out the expression for $f ^ { * }$ , we obtain ", + "bbox": [ + 176, + 301, + 465, + 316 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/c769fc052652243517d9995b4e16260154251ba864425434f67c2f3dca33d2bb.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { \\lambda \\geq 0 , \\kappa } { \\mathrm { m a x ~ m i n } } \\kappa - \\displaystyle \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\theta _ { a } \\Bigg ( ( \\kappa - 1 ) \\gamma _ { a } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { a } ) \\Bigg ) - \\theta _ { b } \\Bigg ( ( \\kappa + 1 ) \\gamma _ { b } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { b } ) \\Bigg ) } \\\\ & { \\quad \\quad \\quad \\quad \\quad - \\theta _ { c } \\Bigg ( \\kappa \\gamma _ { c } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { a } ) \\Bigg ) } \\\\ & { = \\underset { \\gamma \\geq 0 } { \\mathrm { m i n } } \\underset { \\lambda \\geq 0 , \\kappa } { \\mathrm { m a x } } \\kappa \\big ( 1 - \\theta _ { a } \\gamma _ { a } - \\theta _ { b } \\gamma _ { b } - \\theta _ { c } \\gamma _ { c } \\big ) + \\displaystyle \\sum _ { i } \\lambda _ { i } \\Bigg ( \\displaystyle \\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) - \\epsilon _ { i } \\Bigg ) + \\theta _ { a } \\gamma _ { a } - \\theta _ { b } \\gamma _ { b } \\ , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 187, + 319, + 812, + 455 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "where the second inequality follows from strong duality. The inner maximization is unbounded unless ", + "bbox": [ + 174, + 457, + 823, + 472 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/da4806625633cffe981d687f382d205030e2ad81df321eb72edf587eca5b358c.jpg", + "text": "$$\n\\sum _ { y \\in \\{ a , b , c \\} } \\gamma _ { y } \\theta _ { y } = 1 , \\quad \\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) \\leq \\epsilon _ { i } .\n$$", + "text_format": "latex", + "bbox": [ + 339, + 474, + 656, + 510 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "One thing to note is that, we can rewrite these constraints in terms of $\\zeta = \\theta \\odot \\gamma$ , i.e. $\\zeta _ { y } = \\theta _ { y } \\gamma _ { y }$ for $y \\in \\{ a , b , c \\}$ . These constraints ensure that $\\zeta$ is a probability distribution over $\\{ + 1 , 0 , - 1 \\}$ and furthermore ", + "bbox": [ + 173, + 512, + 826, + 553 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/b065cfbf25d99bcffe1de400f53c467321b6cbd08612bd546c9c292ed5c185aa.jpg", + "text": "$$\n\\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) = D _ { f _ { i } } ( \\zeta \\| \\theta ) .\n$$", + "text_format": "latex", + "bbox": [ + 388, + 547, + 607, + 585 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Thus, the second constraint above is equivalent to $D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i }$ . Writing the optimization problem in terms of $\\zeta$ , we obtain ", + "bbox": [ + 173, + 585, + 823, + 614 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/59cde473effbd4aa1dd48d42ce21f192a0976ef8b81bba8060cbf93f6c58fbcb.jpg", + "text": "$$\n\\begin{array} { r c l } { \\displaystyle \\operatorname* { m i n } _ { \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } \\geq 0 } } & { \\zeta _ { a } - \\zeta _ { b } } \\\\ { \\mathrm { s u b j e c t ~ t o } D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i } } & { i = 1 , \\ldots , M } \\\\ { \\displaystyle \\zeta _ { a } + \\zeta _ { b } + \\zeta _ { c } = 1 } & { . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 349, + 617, + 645, + 680 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "A.6 CLOSED-FORM CERTIFICATES FOR THE INFORMATION-LIMITED SETTING ", + "text_level": 1, + "bbox": [ + 174, + 693, + 720, + 708 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "In this section we present closed-form certificates for the information-limited setting which can be derived from Theorem 2 for $M = 1$ . The results are summarized in Table 4. In the next subsections we present the derivation of the certificates for Hockey-Stick and Renyi divergences. The certificates ´ for the KL and infinite Renyi divergence can be derived by taking limits of the R ´ enyi certificate (as ´ $\\alpha 1 , \\infty$ respectively). ", + "bbox": [ + 173, + 718, + 826, + 790 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "A.6.1 CALCULATION OF CERTIFICATE FOR HOCKEY-STICK DIVERGENCE ", + "text_level": 1, + "bbox": [ + 174, + 803, + 687, + 818 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "The function $f ( u ) = \\mathrm { m a x } ( u - \\beta , 0 ) - \\mathrm { m a x } ( 1 - \\beta , 0 )$ is a convex function with $f ( 1 ) = 0$ . Then, we have ", + "bbox": [ + 173, + 827, + 823, + 856 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/5c437001bcad52ace990a66975b82ca399e29cc2465fd1122239e18eedc61db4.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { f _ { \\lambda } ^ { * } ( u ) = \\underset { v \\geq 0 } { \\operatorname* { m a x } } \\left( u v - \\lambda \\operatorname* { m a x } ( v - \\beta , 0 ) \\right) + \\lambda \\operatorname* { m a x } ( 1 - \\beta , 0 ) } \\\\ & { } & { \\quad = \\left\\{ \\begin{array} { l l } { \\operatorname* { m a x } ( \\beta u , 0 ) + \\lambda \\operatorname* { m a x } ( 1 - \\beta , 0 ) \\quad } & { \\mathrm { ~ i f ~ } u \\leq \\lambda \\mathrm { ~ , ~ } } \\\\ { \\infty \\quad } & { \\mathrm { ~ i f ~ } u > \\lambda \\mathrm { ~ . ~ } } \\end{array} \\right. } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 303, + 857, + 692, + 921 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/8369ade9373c62933df1644ed72e853897f42f76271603b1fd45645297336f1b.jpg", + "table_caption": [ + "Table 4: Certificates for various $f$ -divergences for the information-limited setting. Note that the Renyi ´ divergences are not proper $f$ -divergences, but are defined as $\\begin{array} { r } { R _ { \\alpha } ( \\nu \\| \\rho ) = \\frac { \\breve { 1 } } { \\alpha - 1 } \\log ( 1 + D _ { f } ( \\nu \\| \\rho \\breve { ) } ) } \\end{array}$ . The infinite Renyi divergence, defined as ´ $\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\log ( \\nu ( x ) / \\rho ( x ) ) } \\end{array}$ , is obtained by taking the limit $\\alpha \\to \\infty$ . All certificates depend on the gap between $\\theta _ { a }$ and $\\theta _ { b }$ . Notation: $[ u ] _ { + } = \\operatorname* { m a x } ( u , 0 )$ . " + ], + "table_footnote": [], + "table_body": "
Divergence constraintf(u)Certificate
KL divergenceKL(νllρ)≤∈κLulog(u)∈KL≤-log(1-(√θa-√6)²)
Rényi divergences (α ≥ 0)Ra(vllp)≤∈r,αsign(a - 1)(uα - 1)∈R,a≤-log(1-0a-0b+2n)n=((1-+(1-a)()2
Infinite Renyi divergenceRo(vllp)≤∈R,∞∈R,∞≤-log(1-(0a-0b))
Hockey-stick divergences (β ≥ 0)DHS,β(vllp)≤HS,β[u- β]+-[1-β]+€Hs,β≤β(0a-06)-1β-112土
", + "bbox": [ + 173, + 99, + 826, + 241 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "The certificate given by Eq. 6 in Theorem 1 for this divergence in the case of a smoothed hard classifier takes the form ", + "bbox": [ + 174, + 337, + 821, + 366 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/44f41bb0b307cc38f5b315580443c7ff0fe516979f001cb0352d698b78ec3623.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\kappa \\in \\mathbb { R } , \\lambda \\geq 0 } \\left( \\kappa - \\operatorname { \\mathrm { ~ E ~ } } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] \\right) - \\lambda \\epsilon \\geq 0 \\mathrm { ~ , ~ }\n$$", + "text_format": "latex", + "bbox": [ + 334, + 369, + 658, + 405 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where the specification takes the values ", + "bbox": [ + 173, + 411, + 433, + 425 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/8f1fcae7cdda27af19e818d78300770354fd769874e269ddfe345d0513c74f68.jpg", + "text": "$$\n\\phi ( X ) = \\left\\{ \\begin{array} { l l } { { + 1 } } & { { \\quad \\mathrm { w . p . ~ } \\theta _ { a } ~ , } } \\\\ { { - 1 } } & { { \\quad \\mathrm { w . p . ~ } \\theta _ { b } ~ , } } \\\\ { { 0 } } & { { \\quad \\mathrm { w . p . ~ } 1 - \\theta _ { a } - \\theta _ { b } ~ . } } \\end{array} \\right.\n$$", + "text_format": "latex", + "bbox": [ + 369, + 434, + 625, + 486 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Plugging in the expression for $f ^ { * }$ the objective function above takes the form ", + "bbox": [ + 173, + 492, + 679, + 508 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/8bd1a1c119b106e4192692af213a74615db283bb235bdb0bb46c9d7f86869888.jpg", + "text": "$$\n\\kappa - \\beta \\big ( \\theta _ { a } [ \\kappa - 1 ] _ { + } + \\theta _ { b } [ \\kappa + 1 ] _ { + } + ( 1 - \\theta _ { a } - \\theta _ { b } ) [ \\kappa ] _ { + } \\big ) - \\lambda ( \\epsilon + \\operatorname* { m a x } ( 1 - \\beta , 0 ) ) ~ ,\n$$", + "text_format": "latex", + "bbox": [ + 228, + 513, + 767, + 534 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where we use the notation $[ u ] _ { + } = \\operatorname* { m a x } ( u , 0 )$ and assumed the constraints $\\kappa \\leq \\lambda - 1$ since the objective is $- \\infty$ otherwise. If $\\beta \\leq 1$ , the objective is increasing monotonically in $\\kappa$ , so the optimal value is to set $\\kappa$ to its upper bound $\\lambda - 1$ . Plugging this in, the possible values of the derivative with respect to $\\lambda$ are ", + "bbox": [ + 173, + 540, + 826, + 597 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/95e8785c2b931e88ce22db0e09efaba12bba2d5992b408c00deb22245aae8b7e.jpg", + "text": "$$\n\\begin{array} { r } { \\left\\{ \\begin{array} { l l } { \\beta ( 1 - \\theta _ { b } ) - \\epsilon \\quad } & { \\mathrm { i f ~ 0 \\leq \\lambda < 1 ~ } , } \\\\ { \\beta \\theta _ { a } - \\epsilon \\quad } & { \\mathrm { i f ~ 1 < \\lambda < 2 ~ } , } \\\\ { - \\epsilon \\quad } & { \\mathrm { i f ~ } \\lambda > 2 . } \\end{array} \\right. } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 377, + 597, + 619, + 648 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Thus, if $\\epsilon \\leq \\beta \\theta _ { a }$ , the maximum is attained at 2, if $\\beta \\theta _ { a } \\le \\epsilon \\le \\beta ( 1 - \\theta _ { b } )$ , the maximum is attained at 1, else the maximum is attained at 0, leading to the certificate: ", + "bbox": [ + 169, + 652, + 825, + 683 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/af46de3752ce66b5b39deee5882d5ea7f9a004bb0a3f7e5f6628d70cb5d9868f.jpg", + "text": "$$\n\\begin{array} { r } { \\left\\{ \\begin{array} { l l } { - 1 } & { \\mathrm { i f } \\epsilon \\geq \\beta ( 1 - \\theta _ { b } ) , } \\\\ { \\beta ( 1 - \\theta _ { b } ) - \\epsilon - 1 } & { \\mathrm { i f } \\beta \\theta _ { a } \\leq \\epsilon \\leq \\beta ( 1 - \\theta _ { b } ) , } \\\\ { \\beta ( 1 + ( \\theta _ { a } - \\theta _ { b } ) ) - 2 \\epsilon - 1 } & { \\mathrm { i f } \\epsilon \\leq \\beta \\theta _ { a } . } \\end{array} \\right. , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 299, + 690, + 696, + 742 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Thus, the certificate is non-negative only if ", + "bbox": [ + 174, + 750, + 455, + 765 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/cb69b8fc1fa95eb4f6ec9f2f0916e303ccc48e7e0bafb806afcaeef0bfcd503b.jpg", + "text": "$$\n\\epsilon \\le \\operatorname* { m a x } \\left( \\frac { \\beta ( 1 + ( \\theta _ { a } - \\theta _ { b } ) ) - 1 } { 2 } , 0 \\right) \\ .\n$$", + "text_format": "latex", + "bbox": [ + 369, + 770, + 629, + 806 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "The case $\\beta \\geq 1$ can be worked out similarly, leading to ", + "bbox": [ + 173, + 811, + 537, + 827 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/ef310b95e365f8d557b2ce04e3a258ee87dd634eab5dbeb868a44624be811aca.jpg", + "text": "$$\n\\epsilon \\le \\operatorname* { m a x } \\biggl ( \\frac { \\beta ( - 1 + ( \\theta _ { a } - \\theta _ { b } ) ) + 1 } { 2 } , 0 \\biggr ) .\n$$", + "text_format": "latex", + "bbox": [ + 362, + 833, + 635, + 868 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "The two cases can be combined as ", + "bbox": [ + 173, + 875, + 400, + 888 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/a89dfcf911ec88f0e5a438e315f7592893c71f1c3c40ec1ccb529727bbc8c5d9.jpg", + "text": "$$\n\\epsilon \\leq \\operatorname* { m a x } \\mathopen { } \\mathclose \\bgroup \\left( \\frac { \\beta ( \\theta _ { a } - \\theta _ { b } ) - | \\beta - 1 | } { 2 } , 0 \\aftergroup \\egroup \\right) ~ .\n$$", + "text_format": "latex", + "bbox": [ + 369, + 893, + 629, + 929 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "A.6.2 CALCULATION OF CERTIFICATE FOR RENYI DIVERGENCE ´ ", + "text_level": 1, + "bbox": [ + 174, + 102, + 629, + 118 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "We consider the cases $\\alpha \\geq 1$ and $\\alpha \\leq 1$ separately. ", + "bbox": [ + 173, + 127, + 509, + 143 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Case 1 $( \\alpha \\geq 1 )$ ) If $\\alpha \\geq 1$ , the function $f ( u ) = \\left( u ^ { \\alpha } - 1 \\right)$ is a convex function with $f ( 1 ) = 0$ . Then, we have ", + "bbox": [ + 174, + 156, + 826, + 185 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/fece719ad8ff22ddd87d1f25d7f848321070fe7755f2cb7f75e0c8f371bfd2e2.jpg", + "text": "$$\n\\begin{array} { r l } & { f _ { \\lambda } ^ { * } ( u ) = \\underset { v \\geq 0 } { \\operatorname* { m a x } } u v - \\lambda ( v ^ { \\alpha } - 1 ) = \\{ \\lambda \\atop \\lambda + \\lambda ( \\alpha - 1 ) ( \\frac { u } { \\lambda \\alpha } ) ^ { \\frac { \\alpha } { \\alpha - 1 } } } \\quad \\quad \\mathrm { i f } u \\leq 0 \\\\ & { \\quad \\quad = \\lambda + \\lambda ( \\alpha - 1 ) ( \\frac { \\operatorname* { m a x } ( u , 0 ) } { \\lambda \\alpha } ) ^ { \\frac { \\alpha } { \\alpha - 1 } } \\ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 254, + 189, + 743, + 271 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Suppose we have a bound on the Renyi divergence ´ $R _ { \\alpha } ( \\nu \\| \\rho ) \\leq \\epsilon$ . Then we know $D _ { f } ( \\nu \\| \\rho ) \\leq$ $\\mathrm { e x p } \\bar { ( } ( \\alpha - 1 ) \\epsilon ) - 1$ . Let $\\begin{array} { r } { \\beta = \\frac { \\alpha } { \\alpha - 1 } } \\end{array}$ and ", + "bbox": [ + 173, + 275, + 825, + 308 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/625f107169b1cb9503f90c2c5e2ac5ce50f92252a722c5b896f170690b2142d3.jpg", + "text": "$$\nB = \\theta _ { a } ( \\operatorname* { m a x } ( 0 , \\kappa - 1 ) ) ^ { \\beta } + \\theta _ { b } ( \\operatorname* { m a x } ( 0 , \\kappa + 1 ) ) ^ { \\beta } + ( 1 - \\theta _ { a } - \\theta _ { b } ) ( \\operatorname* { m a x } ( 0 , \\kappa ) ) ^ { \\beta } \\ .\n$$", + "text_format": "latex", + "bbox": [ + 230, + 313, + 766, + 334 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Then the certificate Eq. 6 simplifies to (after some algebra) ", + "bbox": [ + 173, + 339, + 563, + 354 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/80cf64ca28af5300158831e64e6d2781620576652433746e86f95c5776e3d16f.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\lambda \\ge 0 , \\kappa } \\kappa - \\lambda \\exp ( ( \\alpha - 1 ) \\epsilon ) - B \\lambda ^ { 1 - \\beta } \\frac { ( \\alpha - 1 ) } { \\alpha ^ { \\beta } } .\n$$", + "text_format": "latex", + "bbox": [ + 339, + 361, + 656, + 393 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Setting the derivative with respect to $\\lambda$ to $0$ and solving for $\\lambda$ , we obtain ", + "bbox": [ + 176, + 400, + 647, + 415 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/e7fcec2bad074f8f9506d8354fa7372f3b2cd472f82858ac145871e5515719e6.jpg", + "text": "$$\n\\lambda = \\frac { 1 } { \\alpha } \\left( \\frac { B } { \\exp ( ( \\alpha - 1 ) \\epsilon ) } \\right) ^ { \\left( \\frac { 1 } { \\beta } \\right) } \\ ,\n$$", + "text_format": "latex", + "bbox": [ + 393, + 420, + 602, + 460 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "and the optimal certificate reduces to ", + "bbox": [ + 173, + 467, + 418, + 481 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/4b864a7a9fcf431e2e1b6744122dc09c30b6bcf219e1ba856b2f6af4c57837a5.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\kappa } \\kappa - B ^ { \\frac { 1 } { \\beta } } \\exp \\biggl ( \\frac { \\epsilon } { \\beta } \\biggr ) .\n$$", + "text_format": "latex", + "bbox": [ + 413, + 486, + 584, + 522 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "For this number to be positive, we need that $\\kappa \\geq 0$ and ", + "bbox": [ + 173, + 526, + 534, + 541 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/df14aeb5143b289a2ae1c8880593a0484492bb8a3e34c60bd8d5d79da5e71256.jpg", + "text": "$$\n\\frac { \\kappa } { B ^ { \\frac { 1 } { \\beta } } } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 434, + 546, + 563, + 583 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "The LHS above evaluates to ", + "bbox": [ + 173, + 588, + 361, + 602 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/664920295df38b687a42e8c7673651e9afe561d64096b92b04316cd49030a8c7.jpg", + "text": "$$\n\\Big ( \\theta _ { a } \\operatorname* { m a x } ( 0 , 1 - \\gamma ) ^ { \\beta } + \\theta _ { b } \\operatorname* { m a x } ( 0 , 1 + \\gamma ) ^ { \\beta } + 1 - \\theta _ { a } - \\theta _ { b } \\Big ) ^ { - \\frac { 1 } { \\beta } } \\ .\n$$", + "text_format": "latex", + "bbox": [ + 289, + 606, + 709, + 637 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "where $\\begin{array} { r } { \\gamma = \\frac { 1 } { \\kappa } \\geq 0 } \\end{array}$ . Maximizing this expression with respect to $\\gamma$ , we obtain ", + "bbox": [ + 173, + 643, + 668, + 660 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/ea44b98a067ceecdd25c7ebb27011a53536a3d1ddc6eb36077a3352585832a86.jpg", + "text": "$$\n\\gamma = \\frac { \\theta _ { a } ^ { \\alpha - 1 } - \\theta _ { b } ^ { \\alpha - 1 } } { \\theta _ { a } ^ { \\alpha - 1 } + \\theta _ { b } ^ { \\alpha - 1 } } \\mathrm { ~ , ~ }\n$$", + "text_format": "latex", + "bbox": [ + 428, + 666, + 568, + 704 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "so that the certificate reduces to ", + "bbox": [ + 173, + 710, + 383, + 724 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/8ab5f597d4fc5f6e1d7e63049dfc86169b4fb803d36fad4b343b20538a73ddb2.jpg", + "text": "$$\n\\left( 2 ^ { \\beta } \\theta _ { a } \\theta _ { b } \\bigl ( \\theta _ { a } ^ { \\alpha - 1 } + \\theta _ { b } ^ { \\alpha - 1 } \\bigr ) ^ { \\left( - \\frac { 1 } { \\alpha - 1 } \\right) } + 1 - \\theta _ { a } - \\theta _ { b } \\right) ^ { \\left( \\frac { 1 } { \\beta } \\right) } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) \\ .\n$$", + "text_format": "latex", + "bbox": [ + 276, + 728, + 722, + 768 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Taking logarithms now gives the result. ", + "bbox": [ + 174, + 773, + 431, + 789 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Case 2 $0 \\leq \\alpha \\leq 1 \\}$ ) When $0 \\leq \\alpha \\leq 1$ , the function $f ( u ) = \\left( 1 - u ^ { \\alpha } \\right)$ is a convex function with $f ( 1 ) = 0$ . Then, we have ", + "bbox": [ + 168, + 803, + 825, + 833 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/2a749e47bcbe8c72b42cd5a7f37693a59ddafa0c99b66fb0e12a752f5f58b7ac.jpg", + "text": "$$\nf _ { \\lambda } ^ { * } ( u ) = \\operatorname* { m a x } _ { v \\geq 0 } u v - \\lambda ( 1 - v ^ { \\alpha } ) = \\left\\{ \\begin{array} { l l } { - \\lambda + \\lambda ^ { \\frac { 1 } { 1 - \\alpha } } ( 1 - \\alpha ) { \\left( \\frac { - u } { \\alpha } \\right) } ^ { \\left( - \\frac { \\alpha } { 1 - \\alpha } \\right) } } & { \\mathrm { ~ i f ~ } u \\leq 0 } \\\\ { \\infty } & { \\mathrm { ~ o t h e r w i s e ~ . } } \\end{array} \\right.\n$$", + "text_format": "latex", + "bbox": [ + 222, + 838, + 767, + 881 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Further, a bound $R _ { \\alpha } ( \\nu \\| \\rho ) \\leq \\epsilon$ implies ", + "bbox": [ + 173, + 886, + 429, + 902 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/d988e02e31c61f1ea5e1970fbd2eb6566aa88362dad7e3afffb1178887c30df5.jpg", + "text": "$$\nD _ { f } ( \\nu \\vert \\vert \\rho ) \\leq 1 - \\exp ( ( \\alpha - 1 ) \\epsilon ) .\n$$", + "text_format": "latex", + "bbox": [ + 387, + 907, + 609, + 926 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Then the certificate from Eq. 6 reduces to ", + "bbox": [ + 174, + 103, + 447, + 118 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/089233e1c654506bb3809b68a020167c88b07ac93cf2cb59fae093647ee978eb.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\cdot , \\lambda \\geq 0 } \\kappa + \\lambda \\exp ( ( \\alpha - 1 ) \\epsilon ) - ( 1 - \\alpha ) \\lambda ^ { \\frac { 1 } { 1 - \\alpha } } \\alpha ^ { \\frac { \\alpha } { 1 - \\alpha } } \\Big ( \\theta _ { a } ( 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { b } ( - 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { c } ( - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } \\Big )\n$$", + "text_format": "latex", + "bbox": [ + 181, + 126, + 839, + 154 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "with the constraint $\\kappa \\leq - 1$ (otherwise the certificate is $- \\infty ,$ ). Setting the derivative with respect to $\\lambda$ to 0 and solving for $\\lambda$ , we obtain ", + "bbox": [ + 173, + 162, + 831, + 193 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/9655fc26855442653c9e22fc286189a0043f5d485e474c81f313bae525d55a7f.jpg", + "text": "$$\n\\lambda = \\frac { \\exp \\big ( ( \\alpha - 1 ) \\epsilon \\big ( \\frac { 1 - \\alpha } { \\alpha } \\big ) \\big ) } { \\alpha \\omega } \\mathrm { ~ , ~ }\n$$", + "text_format": "latex", + "bbox": [ + 401, + 199, + 594, + 233 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "where ", + "bbox": [ + 173, + 241, + 217, + 255 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/d7b7b99f68b7d80f9e369d5e3baf3e58bdb01f2ea5ba71daa6781a85477fd1f0.jpg", + "text": "$$\n\\omega = \\left( \\theta _ { a } ( 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { b } ( - 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { c } ( - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } \\right) ^ { \\left( \\frac { 1 - \\alpha } { \\alpha } \\right) } \\ .\n$$", + "text_format": "latex", + "bbox": [ + 274, + 252, + 723, + 285 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "$\\begin{array} { r } { \\beta = \\frac { \\alpha } { 1 - \\alpha } } \\end{array}$ ", + "bbox": [ + 173, + 289, + 633, + 305 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/bab086f508e15a6614676d8da8d6489bf66478778856c5acc763c5bfe231f3ec.jpg", + "text": "$$\n\\kappa + \\frac { \\exp \\Bigl ( - \\frac { \\epsilon } { \\beta } \\Bigr ) } { \\omega } \\ .\n$$", + "text_format": "latex", + "bbox": [ + 437, + 314, + 558, + 356 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "For this number to be positive, we require that ", + "bbox": [ + 174, + 362, + 478, + 377 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/366d36c82991595efc8022c46e3c8300f3f0b0eab38b8c065d0d02afcd3d99b4.jpg", + "text": "$$\n\\frac { 1 } { \\not { p } - \\kappa \\omega } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 428, + 383, + 568, + 420 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "The LHS of the above expression evaluates to ", + "bbox": [ + 174, + 426, + 475, + 440 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/74f87d563e1b2f6b0c942aeae4da7cfd91f1b0ea2a77a68b4a7a2f50564e66f0.jpg", + "text": "$$\n\\left( \\theta _ { a } \\bigl ( 1 + \\gamma \\bigr ) ^ { ( - \\beta ) } + \\theta _ { b } \\bigl ( 1 - \\gamma \\bigr ) ^ { ( - \\beta ) } + 1 - \\theta _ { a } - \\theta _ { b } \\right) ^ { \\left( \\frac { - 1 } { \\beta } \\right) } \\ ,\n$$", + "text_format": "latex", + "bbox": [ + 312, + 449, + 686, + 482 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "where $\\begin{array} { r } { \\gamma = - \\frac { 1 } { \\kappa } } \\end{array}$ . Maximizing this expression over $\\gamma \\in [ 0 , 1 ]$ , we obtain the final certificate to be ", + "bbox": [ + 168, + 489, + 799, + 507 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/a5f7a1a3df4b06b8cc665fd822f252ac49c35a54cfa589a63e2b6709b932fa75.jpg", + "text": "$$\n\\left( 1 - \\theta _ { a } - \\theta _ { b } + 2 \\left( \\frac { \\theta _ { a } ^ { 1 - \\alpha } + \\theta _ { b } ^ { 1 - \\alpha } } { 2 } \\right) ^ { \\left( \\frac { 1 } { 1 - \\alpha } \\right) } \\right) ^ { \\left( - \\frac { 1 } { \\beta } \\right) } \\ge \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) \\ .\n$$", + "text_format": "latex", + "bbox": [ + 285, + 513, + 712, + 570 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Taking logarithms, we obtain ", + "bbox": [ + 174, + 577, + 367, + 592 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/2dff26f61667701e3b7cb9427d8dfe89722c532ffd0ff3e07121c8c948d460d1.jpg", + "text": "$$\n\\epsilon \\leq - \\log \\left( 1 - \\theta _ { a } - \\theta _ { b } + 2 \\bigg ( \\frac { \\theta _ { a } ^ { 1 - \\alpha } + \\theta _ { b } ^ { 1 - \\alpha } } { 2 } \\bigg ) ^ { \\left( \\frac { 1 } { 1 - \\alpha } \\right) } \\right) \\ .\n$$", + "text_format": "latex", + "bbox": [ + 313, + 599, + 684, + 650 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "A.7 INFORMATION-LIMITED ROBUST CERTIFICATION AND TIGHT RELAXATIONS ", + "bbox": [ + 174, + 665, + 738, + 681 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "A.7.1 PROOF OF THEOREM 4 ", + "text_level": 1, + "bbox": [ + 174, + 691, + 388, + 707 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "At a high level, the proof shows that, in the information-limited case, to achieve robust certification under an arbitrary set of constraints $\\mathcal { D }$ it suffices to know the “envelope” of $\\mathcal { D }$ with respect to all hockey-stick divergences of order $\\beta \\geq 0$ , i.e. the function $\\beta \\mapsto \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho )$ captures all the necessary information to provide information-limited robust certification with respect to $\\mathcal { D }$ . ", + "bbox": [ + 173, + 717, + 826, + 773 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "We start by considering the following optimization problem: ", + "bbox": [ + 174, + 780, + 570, + 795 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/32e9f9c7f47689eac9b122ebb32fa01cec13b7454977abf6090187412a18bc6f.jpg", + "text": "$$\n\\begin{array} { r l } { \\underset { \\Psi : \\mathcal { X } \\mapsto \\{ - 1 , 0 , + 1 \\} , \\nu \\in \\mathcal { D } } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } [ \\Psi ( X ) ] } & { } \\\\ { \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } [ 1 [ \\Psi ( X ) = + 1 ] ] \\geq \\theta _ { a } } & { , } \\\\ { \\underset { X \\sim \\rho } { \\mathrm { E } } [ 1 [ \\Psi ( X ) = - 1 ] ] \\leq \\theta _ { b } } & { . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 338, + 801, + 658, + 881 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "In the information-limited setting, this problem attains the minimum expected value over $\\phi \\in S$ . \nHere $1 [ \\phi ( X ) = 1 ]$ denotes the indicator function. ", + "bbox": [ + 173, + 895, + 826, + 924 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "It will be convenient to write this in a slightly different form: Rather than looking at the outputs of $\\Psi$ as the $+ 1 , 0 , - 1$ , we look at them as vectors in $\\mathbb { R } ^ { 3 }$ : ", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/b010e1378b1c9974e20c57a2772b52ab17f4f78939d52e5156c6bc00c264fea2.jpg", + "text": "$$\n\\mathcal { Z } = \\left\\{ \\left( 0 \\atop 0 \\right) , \\left( 1 \\atop 0 \\right) , \\left( 0 \\atop 1 \\right) \\right\\}\n$$", + "text_format": "latex", + "bbox": [ + 405, + 136, + 593, + 180 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "and define ", + "bbox": [ + 173, + 184, + 245, + 198 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/cd6d0153778eac2b289b9db9a661934550408533925de045754b8470a577ef56.jpg", + "text": "$$\n{ \\bf a } = \\left( \\begin{array} { l } { { 1 } } \\\\ { { 0 } } \\\\ { { - 1 } } \\end{array} \\right) , { \\bf a } _ { + } = \\left( \\begin{array} { l } { { 1 } } \\\\ { { 0 } } \\\\ { { 0 } } \\end{array} \\right) , { \\bf a } _ { - } = \\left( \\begin{array} { l } { { 0 } } \\\\ { { 0 } } \\\\ { { 1 } } \\end{array} \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 339, + 199, + 656, + 243 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Then, we can write the optimization problem Eq. 12 equivalently as ", + "bbox": [ + 173, + 247, + 617, + 262 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/c5199a36b9c02cb105cff79d51922fdd844543c1ea3bd1e62e451654ad03df34.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { \\Psi : \\mathcal { X } \\mapsto \\mathcal { Z } , \\nu \\in \\mathcal { D } } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } \\big [ \\mathbf { a } ^ { T } \\Psi ( X ) \\big ] } \\\\ & { \\quad \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { + } { } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } ~ , } \\\\ & { \\qquad \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { - } { } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } ~ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 375, + 265, + 622, + 348 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "We first consider the minimization over $\\Psi$ for a fixed value of $\\nu$ . We begin by observing that since the objective is linear, the optimization over $\\Psi$ can be replaced with the optimization over the convex hull of the set of $\\Psi$ that satisfy the constraints (Bubeck, 2013). Since each input $x \\in \\mathcal { X }$ can be mapped independently of the rest, the convex hull is simply the cross product of the convex hull at every $x$ , to obtain the constraint set ", + "bbox": [ + 173, + 356, + 825, + 426 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/dad715d8a56b8b3b84c450f73c083343d6cc83c9cdfff8910bc81cae8eba9fd4.jpg", + "text": "$$\n\\left\\{ \\Psi : \\mathcal { X } \\mapsto \\mathcal { P } ( \\mathcal { Z } ) \\mathrm { ~ s u c h ~ t h a t ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { + } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } , \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { - } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } \\right\\} \\ .\n$$", + "text_format": "latex", + "bbox": [ + 248, + 428, + 750, + 462 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Therefore, the optimization problem reduces to ", + "bbox": [ + 173, + 465, + 485, + 481 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/d08851ea057fcd71dd089a39090c2e53c3aadd2e7eaafd031694eb4c29819011.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { \\Psi : \\mathcal K \\mapsto \\mathcal P ( \\mathcal Z ) } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } \\big [ \\mathbf a ^ { T } \\Psi ( X ) \\big ] } \\\\ & { \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf a _ { + } { } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } ~ , } \\\\ & { \\qquad \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf a _ { - } { } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } ~ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 379, + 483, + 617, + 565 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "This is a convex optimization problem in $\\Psi$ . Denote ", + "bbox": [ + 173, + 568, + 517, + 583 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/05facb749248735b360f6b2235275969b6e5f8d3c8d8f553a29af8e3b39e65a8.jpg", + "text": "$$\nr ( X ) = \\frac { \\nu ( X ) } { \\rho ( X ) } \\ .\n$$", + "text_format": "latex", + "bbox": [ + 442, + 585, + 557, + 621 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Considering the dual of this optimization problem with respect to the optimization variable $\\Psi$ , we obtain ", + "bbox": [ + 174, + 622, + 825, + 651 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/e911337bbe32b32f83cb729d2b1fcd98ba2fb3f53dd2d03f5c0fa95e7e82c97e.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } ^ { T } \\Psi ( X ) r ( X ) \\big ] - \\lambda _ { a } \\bigg ( \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } _ { + } { } ^ { T } \\Psi ( X ) \\big ] - \\theta _ { a } \\bigg ) + \\lambda _ { b } \\bigg ( \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } _ { - } { } ^ { T } \\Psi ( X ) \\big ] - \\theta _ { b } \\bigg ) } \\\\ & { = \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\Big [ ( r ( X ) \\mathbf { a } - \\lambda _ { a } \\mathbf { a } _ { + } + \\lambda _ { b } \\mathbf { a } _ { - } ) ^ { \\top } \\Psi ( X ) \\Big ] } \\\\ & { = \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\left[ \\binom { r ( X ) - \\lambda _ { a } } { - r ( X ) + \\lambda _ { b } } ^ { T } \\Psi ( X ) \\right] \\ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 205, + 651, + 794, + 770 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Since we can choose $\\Psi ( x )$ independently for each $x \\in \\mathcal { X }$ , we can minimize each term in the expectation independently to obtain ", + "bbox": [ + 174, + 772, + 825, + 801 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/84cc8a64cd9511c407fbef81e1b311e67299425a016f6375296a09d9a4c1c047.jpg", + "text": "$$\n\\operatorname* { m i n } _ { \\Psi ( x ) \\in \\mathcal { P } ( \\mathcal { Z } ) } { \\binom { r ( x ) - \\lambda _ { a } } { r ( x ) + \\lambda _ { b } } } ^ { T } \\Psi ( x ) = \\operatorname* { m i n } ( r ( x ) - \\lambda _ { a } , 0 , - r ( x ) + \\lambda _ { b } ) .\n$$", + "text_format": "latex", + "bbox": [ + 269, + 803, + 727, + 852 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "This implies that the Lagrangian evaluates to ", + "bbox": [ + 174, + 856, + 468, + 871 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/6b6241d5da54cb47088cc14516905d129e06ca44509c430d63a77891ca288ae5.jpg", + "text": "$$\n\\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underbrace { \\mathrm { ~ E ~ } } _ { X \\sim \\rho } [ \\mathrm { m i n } ( r ( X ) - \\lambda _ { a } , 0 , r ( X ) + \\lambda _ { b } ) ] \\ .\n$$", + "text_format": "latex", + "bbox": [ + 316, + 873, + 679, + 897 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "We now consider two cases: ", + "bbox": [ + 173, + 909, + 359, + 924 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Case 1 $( \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 )$ ) In this case, we can see that ", + "bbox": [ + 173, + 103, + 519, + 119 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/f2c9d4942dfe1270f1144a81ddc7b36c7642491bd5e8fd8d329fa88a552bfb83.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 , - r ( X ) + \\lambda _ { b } ) = \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 ) + \\operatorname* { m i n } ( - r ( X ) + \\lambda _ { b } , 0 ) } \\\\ & { = r ( X ) - \\lambda _ { a } - \\operatorname* { m a x } ( r ( X ) - \\lambda _ { a } , 0 ) - \\operatorname* { m a x } ( r ( X ) - \\lambda _ { b } , 0 ) \\ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 233, + 122, + 764, + 160 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Then, the Lagrangian reduces to ", + "bbox": [ + 174, + 164, + 387, + 178 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/ba0782d471f2ca66e3dee6b9fff1caa8badca4c26656ee154ecc077570db8121.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { \\mathbf { \\theta } } { \\mathrm { \\mathop { A } } } a \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ r ( X ) - \\lambda _ { a } ] - \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ \\operatorname* { m a x } ( r ( X ) - \\lambda _ { a } , 0 ) ] - \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ \\operatorname* { m a x } ( r ( X ) - \\lambda _ { b } , 0 ) ] } \\\\ & { = 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) - ( D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 181, + 839, + 229 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Case 2 $( \\lambda _ { b } \\ge \\lambda _ { a } \\ge 0 )$ ) In this case, we can see that ", + "bbox": [ + 173, + 238, + 519, + 255 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/f424ad5e3f72d4ff1f28943d252385a9faaa22ae2c4109aed216a5c01b1f43a5.jpg", + "text": "$$\n\\begin{array} { l } { \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 , - r ( X ) + \\lambda _ { b } ) = \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , - r ( X ) + \\lambda _ { b } ) } \\\\ { = r ( X ) - \\lambda _ { a } + 2 \\operatorname* { m i n } \\biggr ( 0 , \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } - r ( X ) \\biggr ) } \\\\ { = r ( X ) - \\lambda _ { a } - 2 \\operatorname* { m a x } \\biggr ( r ( X ) - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\biggr ) \\ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 274, + 257, + 723, + 349 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Then, the Lagrangian reduces to ", + "bbox": [ + 173, + 353, + 387, + 367 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/e89da55d0410a5a5a92c429dc20076a6ad13e8ceefdf6fced95bca71e25394cb.jpg", + "text": "$$\n\\begin{array} { r l } & { \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) - \\lambda _ { a } ] - 2 \\underset { X \\sim \\rho } { \\mathrm { E } } \\bigg [ \\operatorname* { m a x } \\bigg ( r ( X ) - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\bigg ) \\bigg ] } \\\\ & { = 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - 2 \\bigg ( D _ { \\mathrm { H S } , \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } \\bigg ( 1 - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\bigg ) \\bigg ) \\ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 232, + 372, + 764, + 443 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "We know that $1 - \\theta _ { a } \\ge \\theta _ { b }$ and $\\lambda _ { b } \\geq \\lambda _ { a }$ . If $\\lambda _ { b } > \\lambda _ { a }$ , by choosing $\\lambda _ { a } ^ { \\prime } = \\lambda _ { a } + \\kappa$ and $\\lambda _ { b } ^ { \\prime } = \\lambda _ { b } - \\kappa$ for some small $\\kappa > 0$ , we know that the the sum of the first three terms would reduce while the final term would remain unchanged. Thus, at the the optimum in this case, we can assume $\\lambda _ { a } = \\lambda _ { b }$ and we obtain ", + "bbox": [ + 173, + 446, + 826, + 503 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/64097b9478fe4dadb214d79d432b46633f94ee547755aba6f5412eb050971b47.jpg", + "text": "$$\n1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { a } \\theta _ { b } - 2 ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) \\ .\n$$", + "text_format": "latex", + "bbox": [ + 285, + 508, + 710, + 526 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Final analysis of the Lagrangian Combining the two cases we can write the dual problem as ", + "bbox": [ + 171, + 537, + 800, + 554 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/36d6d5bb2caa8792c3144f0c1baf377377263c4e21b6668cf5c5718dfdfca1be.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { \\lambda _ { a } \\geq \\lambda _ { b } \\geq 0 } { \\operatorname* { m a x } } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) } \\\\ & { } \\\\ & { \\quad \\quad - \\left( D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) \\right) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 269, + 558, + 727, + 604 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "By strong duality, the optimal value of the above problem precisely matches the optimal value of Eq. 14 (and hence Eq. 12). Thus, information limited robust certification with respect to $\\mathcal { D }$ holds if and only if Eq. 15 has a non-negative optimal value for each $\\nu \\in \\mathcal { D }$ . Since we have that ", + "bbox": [ + 174, + 607, + 825, + 650 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/2b4e9a8667517b28c2f94acdc82d24296a97b3b5e3ad169e843fcdf16c533134.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) = \\epsilon _ { \\lambda _ { a } } , \\ : \\ : \\ : \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) = \\epsilon _ { \\lambda _ { b } } ,\n$$", + "text_format": "latex", + "bbox": [ + 310, + 654, + 686, + 678 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "information-limited robust certification holds if and only if the optimal value of ", + "bbox": [ + 176, + 683, + 696, + 698 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/86f768362bad2dfa81e49c1f88cdd5f96fb47717b74d83a15baa7ee58d821c30.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( \\epsilon _ { \\lambda _ { a } } + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) - ( \\epsilon _ { \\lambda _ { b } } + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) )\n$$", + "text_format": "latex", + "bbox": [ + 200, + 703, + 769, + 728 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "is non-negative. Further, since the optimal value only depended on the value of $D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho )$ for $\\beta \\geq 0$ , it is equivalent to information-limited robust certification with respect to $\\mathcal { D } _ { \\mathrm { H S } }$ . ", + "bbox": [ + 173, + 733, + 823, + 762 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "The above argument also shows that in this case, information-limited robust certification with respect to $\\mathcal { D }$ is equivalent to requiring that the following convex optimization problem has a non-negative optimal value: ", + "bbox": [ + 173, + 768, + 825, + 810 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/52f9adfa712ea7be5634441e37781060a025bb0999a5d8abcfb2c424e1fca816.jpg", + "text": "$$\n\\operatorname * { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } ~ 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - \\left( \\epsilon _ { \\lambda _ { a } } + [ 1 - \\lambda _ { a } ] _ { + } \\right) - \\left( \\epsilon _ { \\lambda _ { b } } + [ 1 - \\lambda _ { b } ] _ { + } \\right) ~ .\n$$", + "text_format": "latex", + "bbox": [ + 236, + 815, + 761, + 842 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Let $\\lambda _ { a } ^ { * } , \\lambda _ { b } ^ { * }$ be the optimal values attained. Since this certificate depends only on the value of two Hockey-stick divergences at $\\lambda _ { a } ^ { * } , \\lambda _ { b } ^ { * }$ , it must coincide with the application of theorem 2 to the constraint set ${ \\mathcal { D } } _ { \\mathrm { H S } }$ defined by constraints on these hockey-stick divergences (as we know that 2 computes the optimal certificate for any constraint set defined only by a set of f-divergences). This observation completes the proof. ", + "bbox": [ + 173, + 853, + 825, + 924 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Theorem 4 gives us the optimal limited-information certificate problem provided that we can compute ", + "bbox": [ + 171, + 128, + 826, + 145 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/7af7e3c544bab88c576e7759fcf0a05143fb5330d747045314849d1cd97abb82.jpg", + "text": "$$\n\\operatorname* { m a x } _ { x ^ { \\prime } : d ( x , x ^ { \\prime } ) \\leq \\epsilon } D _ { \\mathrm { H S } , \\beta } ( \\mu ( x ^ { \\prime } ) | | \\mu ( x ) )\n$$", + "text_format": "latex", + "bbox": [ + 393, + 151, + 604, + 178 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "for each $\\beta \\geq 0$ . In particular, when $\\mu$ is a Gaussian measure $\\mu ( x ) = \\mathcal { N } \\big ( x , \\sigma ^ { 2 } I \\big )$ , we can leverage the following result from Balle & Wang (2018). ", + "bbox": [ + 173, + 188, + 825, + 218 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Lemma 6. Let $\\Psi _ { g }$ be the CDF of a standard normal random variable $\\mathcal { N } ( 0 , 1 )$ . For any $\\beta \\geq 0$ and $\\boldsymbol { x } \\in \\mathbb { R } ^ { d }$ we have ", + "bbox": [ + 173, + 223, + 825, + 253 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/20d081454e8b813aecdd66bf010a6796eeb388004b0726f37eafc37c97b4948b.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\substack { \\tau _ { * } \\Vert x - x ^ { \\prime } \\Vert _ { 2 } \\leq \\epsilon } } D _ { \\mathrm { H S , \\beta } } ( \\mu ( x ^ { \\prime } ) \\Vert \\mu ( x ) ) = \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\right) - \\beta \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\right) - [ 1 - \\beta ] _ { + } \\ .\n$$", + "text_format": "latex", + "bbox": [ + 181, + 260, + 834, + 295 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Applying Eq. 17 to the expression in Lemma 6 proves Corollary 5. ", + "bbox": [ + 173, + 310, + 611, + 327 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Proof of Corollary 5. With the notation from Theorem 4 we have, for $\\beta \\geq 0$ , ", + "bbox": [ + 173, + 348, + 679, + 364 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/b0f13d1ff63e5d26db3d4c8dd0bd16e518e4fd2fa4d1ad0e459b257bd3d03319.jpg", + "text": "$$\n\\epsilon _ { \\beta } = \\Psi _ { g } \\bigg ( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\bigg ) - \\beta \\Psi _ { g } \\bigg ( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\bigg ) - \\operatorname* { m a x } ( 1 - \\beta , 0 ) .\n$$", + "text_format": "latex", + "bbox": [ + 248, + 372, + 748, + 407 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Plugging this expression into Eq. 17 allows us to verify information-limited robust certification of $\\mathcal { N } ( \\breve { x ^ { \\prime } } , \\sigma ^ { \\top } I )$ with respect to $\\mathcal { D } _ { x , \\epsilon } \\overset { \\cdot } { = } \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\}$ by solving ", + "bbox": [ + 171, + 415, + 825, + 445 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/b33f2657508c22be78dbafcd31668616a1ba89761c066f4b8e674558164c05e3.jpg", + "text": "$$\n\\begin{array} { r l } & { \\displaystyle \\operatorname* { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } } \\\\ & { \\displaystyle - \\left( \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { a } ) \\sigma } { 2 \\epsilon } \\right) - \\lambda _ { a } \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { a } ) \\sigma } { 2 \\epsilon } \\right) \\right) } \\\\ & { \\displaystyle - \\left( \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { b } ) \\sigma } { 2 \\epsilon } \\right) - \\lambda _ { b } \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { b } ) \\sigma } { 2 \\epsilon } \\right) \\right) \\ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 256, + 453, + 738, + 553 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Eq. 9 then follows from setting the derivatives of this expression to 0 with respect to $\\lambda _ { a } , \\lambda _ { b }$ and imposing the condition that the optimal solution is non-negative. □ ", + "bbox": [ + 173, + 558, + 823, + 587 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "To check that Corollary 5 is equivalent to the optimal certification in (Cohen et al., 2019, Theorem 1) we first recall that, in our notation, their result can be stated as: the class of specifications $S$ in Definition 2.1 is information-limited robustly certified at $\\rho = { \\mathcal { N } } ( x , \\sigma ^ { 2 } I )$ with respect to $\\mathcal { D } _ { { x } , \\epsilon } = \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\}$ if and only if ", + "bbox": [ + 173, + 609, + 825, + 670 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/a8625d3a57b74a32527755b9ddcd1dbcc72cbead19fff8b037d5818bb01afe03.jpg", + "text": "$$\n\\frac { 2 \\epsilon } { \\sigma } \\leq \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) .\n$$", + "text_format": "latex", + "bbox": [ + 403, + 679, + 596, + 709 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "The equivalence between Eq. 9 and Eq. 18 now follows from the identity $1 - \\Psi _ { g } ( \\theta ) = \\Psi _ { g } ( - \\theta )$ and the monotonicity of $\\Psi _ { g }$ : ", + "bbox": [ + 171, + 717, + 826, + 748 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/4d80a7976e68909109e1cc49626132aafc1a6bd8ab300b430d407f112e083c27.jpg", + "text": "$$\n\\begin{array} { r l } & { \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) + \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 } \\\\ & { \\iff \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 - \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) } \\\\ & { \\iff \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq \\Psi _ { g } \\Big ( \\frac { \\epsilon } { \\sigma } - \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) \\Big ) } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\geq \\frac { \\epsilon } { \\sigma } - \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) + \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } ~ . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 312, + 756, + 694, + 931 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "A.7.3 RELATION TO PIXELDP ", + "text_level": 1, + "bbox": [ + 176, + 103, + 397, + 118 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Pixel differential privacy (pixelDP) was introduced in Lecuyer et al. (2019) using the same similarity measure between distributions used in differential privacy: a distribution-valued function $G : \\mathbb { R } ^ { d } \\overset { } { }$ $\\mathcal { P } ( \\mathcal { Z } )$ satisfies $( \\varepsilon , \\tau )$ -pixelDP with respect to $\\ell _ { p }$ perturbations if for any $\\| x - x ^ { \\prime } \\| _ { p } \\leq 1$ it holds that $D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( G ( x ) \\| G ( x ^ { \\prime } ) ) \\leq \\tau$ , where ", + "bbox": [ + 173, + 127, + 825, + 188 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/9f1b689031d3bcfe71fe78902acdf6b49b08ab29dca1a223d37cf55541f12bb5.jpg", + "text": "$$\nD _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( G ( x ) \\| G ( x ^ { \\prime } ) ) = \\operatorname* { s u p } _ { E } \\left( \\operatorname* { l i p } _ { X \\sim G ( x ) } [ X \\in E ] - e ^ { \\varepsilon } \\operatorname* { l i p } _ { X ^ { \\prime } \\sim G ( x ^ { \\prime } ) } [ X ^ { \\prime } \\in E ] \\right)\n$$", + "text_format": "latex", + "bbox": [ + 256, + 193, + 740, + 228 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "and the supremum is over all (measurable) subsets $E$ of $\\mathcal { Z }$ . In particular, Lecuyer et al. show that using a smoothing measure $\\mu$ satisfying pixelDP with respect to $\\ell ^ { p \\ }$ leads to adversarially robust classifiers against $\\ell ^ { p \\ }$ perturbations. ", + "bbox": [ + 173, + 234, + 825, + 276 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "To show that their result fits as a particular instance of our framework, take $\\rho = \\mu ( x )$ and fix $\\varepsilon \\geq 0$ and $\\tau \\in [ 0 , 1 ]$ . Due to the symmetry of the constraint $\\| x - x ^ { \\prime } \\| _ { p } \\leq 1$ , if $\\mu$ satisfies $( \\varepsilon , \\tau )$ -pixelDP with respect to $\\ell _ { p }$ perturbations, then we have the relaxation condition $\\{ \\mu ( x ^ { \\prime } ) : \\| x - x ^ { \\prime } \\| _ { p } \\leq 1 \\} \\subseteq { \\mathcal { D } } _ { \\varepsilon , \\tau }$ , where ", + "bbox": [ + 173, + 282, + 826, + 343 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/9fd634058add18330f3e465e3f2ec16708c99ced0c3f42b06e12595a9bf2d871.jpg", + "text": "$$\n\\mathscr { D } _ { \\varepsilon , \\tau } = \\{ \\nu : D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\nu \\| \\rho ) \\leq \\tau \\ \\mathrm { a n d } \\ D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\rho \\| \\nu ) \\leq \\tau \\} .\n$$", + "text_format": "latex", + "bbox": [ + 310, + 349, + 686, + 367 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Now we recall that Barthe & Olmedo (2013) noticed that $D _ { \\mathrm { D P } , e ^ { \\varepsilon } }$ is equivalent to the hockey-stick divergence $D _ { \\mathrm { H S } , \\beta }$ of order $\\beta = e ^ { \\varepsilon }$ . Thus, since $f$ -divergences are closed under reversal (property 4 in Appendix A.2), we see that the constraint set $\\mathcal { D } _ { \\varepsilon , \\tau }$ can be directly written in the form $\\mathcal { D } _ { \\mathcal { F } }$ (cf. Section 2.2). ", + "bbox": [ + 173, + 373, + 826, + 430 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "The main result in Lecuyer et al. (2019) is a limited-information black-box certification method for smoothed classifiers. The resulting certificate for, which provides certification with respect to $\\mathcal { D } _ { \\varepsilon , \\tau }$ , is given by ", + "bbox": [ + 173, + 436, + 826, + 479 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/fa36bad6cb3deed37e6fede9c5cae78ad71ded04ffe4167d5788bd473783ceb0.jpg", + "text": "$$\n\\tau \\leq \\frac { \\theta _ { a } - e ^ { 2 \\varepsilon } \\theta _ { b } } { e ^ { \\varepsilon } + 1 } \\ .\n$$", + "text_format": "latex", + "bbox": [ + 437, + 486, + 560, + 518 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "For comparison, the certificate we obtain for the relaxation $\\{ \\nu : D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\nu \\| \\rho ) \\leq \\tau \\}$ of $\\mathcal { D } _ { \\varepsilon , \\tau }$ (HS certificate in Table 4) already improves on the certificate by Lecuyer et al. whenever $\\theta _ { a } - \\theta _ { b } \\geq$ $( \\beta - 1 ) ( 1 - \\theta _ { a } - \\theta _ { b } )$ , which, e.g., always holds in the binary classification case. Furthermore, since Theorem 2 provides optimal certificates for $\\mathcal { D }$ , we have the following result. ", + "bbox": [ + 173, + 525, + 825, + 582 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Corollary 7. The optimal certificates for the constraint set $\\mathcal { D }$ (cf. Eq. 20) obtained from Theorem 2 are stronger than those obtained from Eq. 21. ", + "bbox": [ + 173, + 585, + 825, + 614 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "A.8 EFFICIENT SAMPLING AND F-DIVERGENCE COMPUTATION FOR NORM-BASED SMOOTHING MEASURES ", + "text_level": 1, + "bbox": [ + 174, + 631, + 748, + 659 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Lemma 8. The smoothing measure $\\mu : \\mathcal { X } \\mapsto \\mathcal { P } ( \\mathcal { X } )$ with density $\\mu ( x ) [ z ] \\propto \\exp ( - \\| z - x \\| )$ satisfies ", + "bbox": [ + 174, + 670, + 821, + 686 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/e140f53b9f929f4368bb935dc78a486b96910daff8e9c2d9b5cdc1927cf73670.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } R _ { \\infty } ( \\mu ( x + \\delta ) \\| \\mu ( x ) ) \\leq \\epsilon .\n$$", + "text_format": "latex", + "bbox": [ + 387, + 691, + 606, + 718 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "if $\\| x \\|$ is any norm. Further, if $f$ is convex function with $f ( 1 ) = 0$ such that $f { \\bigl ( } { \\frac { 1 } { u } } { \\bigr ) }$ is convex and monotonically increasing in $u$ , then ", + "bbox": [ + 173, + 726, + 825, + 756 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/5d753c572a0cc98ddbb204871c09c2e4f75ab341a3709973bd7461f7332d52f4.jpg", + "text": "$$\n\\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } D _ { f } ( \\mu ( x + \\delta ) \\| \\mu ( x ) ) \\leq \\operatorname* { m a x } _ { \\| \\delta \\| = \\epsilon } \\mathrm { ~ E ~ } _ { \\sim \\mu ( 0 ) } [ f ( \\exp ( - \\| X - \\delta \\| + \\| X \\| ) ) ] \\enspace .\n$$", + "text_format": "latex", + "bbox": [ + 254, + 761, + 741, + 787 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Proof. By the triangle inequality, we have ", + "bbox": [ + 174, + 801, + 452, + 816 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/78916c1986f847acc445737353a19404b81ce36c38e005cc176f21d363977ec6.jpg", + "text": "$$\n\\frac { \\mu ( x ^ { \\prime } ) [ z ] } { \\mu ( x ) [ z ] } = \\exp ( \\| z - x \\| - \\| z - x ^ { \\prime } \\| ) \\leq \\exp ( \\| x - x ^ { \\prime } \\| )\n$$", + "text_format": "latex", + "bbox": [ + 313, + 821, + 686, + 857 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "so that ", + "bbox": [ + 173, + 863, + 220, + 877 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/0bda3f23e0d06d5cb501f45f2a47b68740e8b4fc95e9388244a0169adf013bd7.jpg", + "text": "$$\nR _ { \\infty } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) \\leq \\| x - x ^ { \\prime } \\| .\n$$", + "text_format": "latex", + "bbox": [ + 392, + 875, + 606, + 892 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Similarly, for $f$ that satisfy the conditions of the theorem, it can be shown that $D _ { f } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) )$ is convex in $x ^ { \\prime }$ so that its maximum over the convex set $\\| x ^ { \\prime } - x \\| \\leq \\epsilon$ is attained on the boundary. ", + "bbox": [ + 171, + 895, + 828, + 924 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "For several norms, the optimization problem in Eq. 22 can be solved in closed form. These include $\\ell _ { 1 } , \\ell _ { 2 } , \\ell _ { \\infty }$ norms and the matrix spectral norm and nuclear norm (the final two are relevant when $\\mathcal { X }$ is a space of matrices). The results are documented in Table 5. Thus, every $f$ -divergence that meets the conditions of Lemma 8 can be estimated efficiently for these norms. In particular, the divergences that are induced by the functions $\\tilde { f } ( u ^ { - \\alpha } )$ for any monotonic convex function $\\tilde { f }$ and $\\alpha \\geq 0$ satisfy this constraint. This gives us a very flexible class of $f$ -divergences that can be efficiently estimated for these norm-based smoothing measures. ", + "bbox": [ + 173, + 103, + 826, + 204 + ], + "page_idx": 22 + }, + { + "type": "table", + "img_path": "images/8893e040d5a4027982ce145fe311f9b6b73c059b06165522586c1618fdbeb732.jpg", + "table_caption": [ + "Table 5: Bounds on $f$ -divergences: $e _ { 0 }$ is the vector with 1 in the first coordinate and zeros in all other coordinates and 1 is the vector with all coordinates equal to 1. $\\mu _ { p }$ refers to the smoothing measure induced by the $\\ell _ { p }$ norm, $\\mathcal { U } ( S )$ refers to the uniform measure over the set $S$ , $\\mathcal { O }$ is the set of orthogonal matrices and $\\hat { B _ { p } } { = } \\left\\{ \\| z \\| _ { p } \\leq 1 \\right\\}$ is the unit ball in the $\\ell _ { p }$ norm. " + ], + "table_footnote": [], + "table_body": "
Constraint on δ|Bound on Eq. 22Constraint on δ|Bound on Eq. 22Sampling from X ~ μ(0)
|δl ≤εE[f(exp(-eoll-X))]X~μ1(0)Xi ~ Lap(0,1) iid
1l2≤ eE(o[f(exp(IX-eoll-X2))]X~μ2(0)X=RuR~Γ(d,1)u ~U(aB2)
≤eE[f(exp(X-e1|-X)]X~μ(0)X=RuR~ Γ(d+1,1)u EU(B)
|/ lnuc ≤ e[f(exp(||U[[s]]vT-e[[eo]|lnuc- |slli)]s~μ1(0)U,v~u(O)X=U[s]]VTs ~ μ1,U,V ~U(O)
≤eE [f(exp(|IU[[s]]vT-∈[e]|l, - |sll)]s~μ∞(x)U,v~u(O)X=U[[s]IVTs ~ μ∞,U,V ~U(O)
", + "bbox": [ + 171, + 214, + 867, + 521 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Efficient sampling The only other requirement for obtaining a certificate computationally is to be able to sample from $\\mu ( x )$ to estimate $\\theta _ { a } , \\theta _ { b }$ . Since $\\mu ( x )$ is log-concave, there are general purpose polynomial time algorithms for sampling from this measure. However, for most norms, more efficient methods exist, as outlined below. ", + "bbox": [ + 174, + 613, + 825, + 669 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "The random variable $X \\sim \\mu ( x )$ can be obtained as $X = x + Z$ with $Z \\sim \\mu ( 0 )$ . Thus, to sample from $\\mu ( x )$ for any $x$ it is enough to be able to sample from $\\mu ( 0 )$ . For $\\left\\| \\cdot \\right\\| _ { 1 }$ , this reduces to sampling from a Laplace distribution which can be done easily. For $\\left\\| \\cdot \\right\\| _ { \\infty }$ , (Steinke & Ullman, 2016) give the following efficient sampling procedure: first sample $r$ from a Gamma distribution with shape $d + 1$ and mean $d + 1$ , i.e. $\\bar { r } \\sim \\bar { \\Gamma } ( \\bar { d } + 1 , 1 )$ , and then sample each $Z _ { i }$ , $i \\in [ d ]$ , uniformly from $[ - r , r ]$ . Theorem 9 gives a short proof of correctness for this procedure. Theorem 10 also has a similar result for the case of $\\lVert \\cdot \\rVert _ { 2 }$ and Table 5 lists the sampling procedures for several norms. ", + "bbox": [ + 173, + 675, + 825, + 775 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Theorem 9. The random variable $Z \\in \\mathbb { R } ^ { d }$ obtained by first sampling $R \\sim \\Gamma ( d + 1 , 1 )$ and then sampling each $Z _ { i }$ , $i \\in [ d ]$ , uniformly from $[ - R , R ]$ has density $\\propto e ^ { - \\| z \\| _ { \\infty } }$ . ", + "bbox": [ + 173, + 780, + 820, + 811 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Proof. We first compute the normalization constant for a density of the form $\\propto e ^ { - \\| z \\| _ { \\infty } }$ as follows: ", + "bbox": [ + 174, + 829, + 823, + 844 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/b760f4fd1dd9d5eb592c9d225b8a48b89541f8684a236f84bb1a025ea84d30c9.jpg", + "text": "$$\n\\int _ { \\mathbb { R } ^ { d } } e ^ { - \\| z \\| _ { \\infty } } d z = \\int _ { 0 } ^ { \\infty } \\left( \\int _ { \\mathbb { R } ^ { d } } 1 [ \\| z \\| _ { \\infty } = t ] d z \\right) e ^ { - t } d t = \\int _ { 0 } ^ { \\infty } 2 ^ { d } d t ^ { d - 1 } e ^ { - t } d t = d ! 2 ^ { d } \\ .\n$$", + "text_format": "latex", + "bbox": [ + 218, + 852, + 777, + 887 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Next we show the density of $Z$ satisfies $p _ { Z } ( z ) = e ^ { - \\| z \\| _ { \\infty } } / ( d ! 2 ^ { d } )$ by noting that conditioned on $R = r$ we have $p _ { Z | R = r } ( \\bar { z } ) = 1 [ \\| z \\| _ { \\infty } \\leq r ] / ( 2 r ) ^ { d }$ because of the uniform sampling used in each ", + "bbox": [ + 171, + 893, + 828, + 926 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "coordinate, and integrating over $R$ sampled from a Gamma distribution with shape $d + 1$ and mean $d + 1$ yields ", + "bbox": [ + 171, + 102, + 825, + 132 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/0ac67627adfa178cf788354344afd6452f56064aa85ab1a8f8ad1232f6020a93.jpg", + "text": "$$\n_ { _ { D G } } ( z ) = \\int _ { 0 } ^ { \\infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r = \\int _ { 0 } ^ { \\infty } \\frac { 1 [ \\| z \\| _ { \\infty } \\leq r ] } { ( 2 r ) ^ { d } } \\frac { r ^ { d } e ^ { - r } } { d ! } d r = \\frac { 1 } { d ! 2 ^ { d } } \\int _ { \\| z \\| _ { \\infty } } ^ { \\infty } e ^ { - r } d r = \\frac { e ^ { - \\| z \\| _ { \\infty } } } { d ! 2 ^ { d } } .\n$$", + "text_format": "latex", + "bbox": [ + 181, + 138, + 831, + 178 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "Theorem 10. The random variable $Z \\in \\mathbb { R } ^ { d }$ obtained by first sampling $Z ^ { \\prime } \\sim \\mathcal { N } ( 0 , I )$ and $R \\sim$ $\\Gamma _ { p } ( d , 1 )$ and then taking $\\begin{array} { r } { Z = R \\frac { Z ^ { \\prime } } { \\Vert Z ^ { \\prime } \\Vert _ { 2 } } } \\end{array}$ has density $\\propto e ^ { - \\| z \\| _ { 2 } ^ { p } }$ . Here $\\Gamma _ { p } ( d , a )$ denotes the generalized Gamma distribution of order $p > 0$ with shape $d$ and scale $a$ . ", + "bbox": [ + 173, + 207, + 825, + 257 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "Proof. First note that $\\begin{array} { r } { W = \\frac { Z ^ { \\prime } } { \\left. Z ^ { \\prime } \\right. _ { 2 } } \\sim \\mathcal { U } ( B _ { 2 } ) } \\end{array}$ ; i.e. it is uniform on the $\\ell _ { 2 }$ ball of radius 1. Therefore, $R W$ is uniform on the $\\ell _ { 2 }$ ball of radius $R$ and the conditional density of $Z$ given $R$ is given by $\\begin{array} { r } { p _ { Z | R = r } ( z ) = \\frac { 1 [ \\| z \\| _ { 2 } = r ] \\Gamma ( d / 2 ) } { 2 \\pi ^ { d / 2 } r ^ { d - 1 } } } \\end{array}$ . Since $R$ has density $p _ { R } ( r ) \\propto r ^ { d - 1 } e ^ { - r ^ { p } }$ , we get ", + "bbox": [ + 176, + 273, + 823, + 328 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/3c852d1069c9943e6818d72302d180128c04ff20a2be5610c75d134675538dc6.jpg", + "text": "$$\n\\begin{array} { l } { { \\displaystyle p _ { Z } ( z ) = \\int _ { 0 } ^ { \\infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r } } \\\\ { { \\displaystyle \\propto \\int _ { 0 } ^ { \\infty } \\frac { 1 [ \\| z \\| _ { 2 } = r ] \\Gamma ( d / 2 ) } { 2 \\pi ^ { d / 2 } r ^ { d - 1 } } r ^ { d - 1 } e ^ { - r ^ { p } } d r } } \\\\ { { \\displaystyle \\propto e ^ { - \\| z \\| _ { 2 } ^ { p } } } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 343, + 334, + 655, + 422 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "A.9 ALGORITHM FOR FULL-INFORMATION CERTIFICATION ", + "text_level": 1, + "bbox": [ + 173, + 463, + 593, + 478 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "In this section we describe the subroutines used in Algorithm 1. First we describe a generic procedure to provide high-probability confidence intervals for estimating expectations, then we give a detailed description of the subroutines. ", + "bbox": [ + 173, + 488, + 825, + 531 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "A.9.1 HIGH-CONFIDENCE ESTIMATES OF EXPECTED VALUES ", + "text_level": 1, + "bbox": [ + 173, + 546, + 606, + 561 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "Let Let $Z _ { 1 } , \\dots , Z _ { N }$ be indepel mean be distributed random variables and the empirical variance be $R$ $m$ $\\begin{array} { r } { \\bar { Z } = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\bar { Z _ { i } } } \\end{array}$ $\\begin{array} { r } { \\bar { \\sigma } ^ { 2 } = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } ( Z _ { i } - \\bar { Z } ) ^ { 2 } } \\end{array}$ Applying Bernstein’s inequality to the sum and the sum of the squares of these random variables, we get the empirical Bernstein bound (Audibert et al., 2009), which states that with probability at least $1 - \\zeta$ , ", + "bbox": [ + 173, + 570, + 826, + 643 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/57c33c4c03407ee96d70bb3c1faeb9501ffd08b9fcf5773302345e225440939f.jpg", + "text": "$$\n| \\bar { Z } - m | \\leq \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { t } .\n$$", + "text_format": "latex", + "bbox": [ + 349, + 642, + 648, + 678 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "The main benefit of the above inequality is that as long as the variance of the sample $Z _ { 1 } , \\dots , Z _ { N }$ is small, the convergence rate becomes essentially $O ( 1 / N )$ instead of the standard $O ( 1 / \\sqrt { N } )$ . Also, since Eq. 23 only contains empirical quantities apart from the range $R$ , it can be used to obtain computable bounds for the expectation $\\mu$ : with probability at least $1 - \\zeta$ , ", + "bbox": [ + 173, + 688, + 826, + 747 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/6b35b4b94705b5c8b51d00880eb401c78ce8321e95f2eb370fcd9327286ded27.jpg", + "text": "$$\n\\bar { Z } - \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } - \\frac { 3 R \\log ( 3 / \\zeta ) } { N } \\leq m \\leq \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { N } .\n$$", + "text_format": "latex", + "bbox": [ + 205, + 753, + 764, + 789 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "A.9.2 SUBROUTINES FOR ALGORITHM 1 ", + "text_level": 1, + "bbox": [ + 176, + 801, + 467, + 816 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "The bound in Eq. 24 can be applied to approximate the expectation in Eq. 6 with high probability for given values of $\\lambda$ and $\\kappa$ . More specifically, if the function $f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( \\cdot ) )$ is bounded with range $R$ , then taking $N$ samples $X _ { 1 } , \\ldots , X _ { N }$ independently from $\\rho$ , and defining $Z _ { i } = f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X _ { i } ) )$ , and $\\bar { Z }$ and $\\bar { \\sigma } ^ { 2 }$ as above, Eq. 24 implies that with probability at least $1 - \\zeta$ , ", + "bbox": [ + 173, + 825, + 826, + 885 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/1aee9b25cb65041a4d9c7abaece9b937ebe0f666843838ed656046d1bffa9793.jpg", + "text": "$$\n\\operatorname { E } _ { X \\sim \\rho } ^ { } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X _ { i } ) ) ] \\leq \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { N } .\n$$", + "text_format": "latex", + "bbox": [ + 290, + 892, + 709, + 928 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "Plugging in this bound to Eq. 6 gives a high-probability lower bound for the function to be maximized for any given $\\lambda$ and $\\kappa$ . ", + "bbox": [ + 173, + 103, + 825, + 132 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "Details of the above procedures are given in Algorithm 3. We use an off-the-shelf convex optimization solver (Diamond & Boyd, 2016) in the ESTIMETEOPT subroutine. ", + "bbox": [ + 173, + 138, + 823, + 167 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "Algorithm 3 Subroutines for Algorithm 1 ", + "text_level": 1, + "bbox": [ + 176, + 183, + 446, + 196 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "function ESTIMAT $\\mathrm { E O P T } ( \\rho , \\phi , N , \\{ f _ { i } \\} , \\{ \\epsilon _ { i } \\} )$ ", + "bbox": [ + 187, + 203, + 486, + 217 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "Sample $X ^ { 1 } , \\ldots , X ^ { N } \\sim \\rho$ and obtain $\\kappa ^ { * }$ and $\\lambda ^ { * }$ by solving Eq. 6 with $\\operatorname { E } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ]$ replaced by $\\begin{array} { r } { \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } f _ { \\lambda } ^ { * } \\big ( \\kappa - \\phi \\big ( X ^ { i } \\big ) \\big ) } \\end{array}$ and the additional constraints $f _ { \\lambda ^ { * } } ^ { * } ( \\kappa - a ) < \\infty , f _ { \\lambda ^ { * } } ^ { * } ( \\kappa - b ) <$ $\\infty$ . ", + "bbox": [ + 184, + 218, + 825, + 262 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "return $\\kappa ^ { * } , \\lambda ^ { * }$ ", + "bbox": [ + 214, + 262, + 308, + 275 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "function UPPERCON $\\mathrm { F I D E N C E B O U N D } ( \\rho , \\phi , \\tilde { N } , \\{ f _ { i } \\} _ { i = 1 } ^ { M } , \\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } , a , b , \\lambda , \\kappa , \\zeta )$ ", + "bbox": [ + 197, + 287, + 702, + 304 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "Sample $X ^ { 1 } , \\dotsc , X ^ { \\tilde { N } } \\dotsc \\rho$ and compute $Z ^ { i } \\gets f _ { \\lambda } ^ { * } \\big ( \\kappa - \\phi \\big ( X ^ { i } \\big ) \\big )$ for $i = 1 , \\ldots , \\tilde { N }$ ", + "bbox": [ + 212, + 306, + 745, + 321 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/7d72494dae529baa82ecf6ea3a088348f3a05f1141002622c8fdb97ada2ace9b.jpg", + "text": "$$\nE _ { u b } \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { \\tilde { N } } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { \\tilde { N } } .\n$$", + "text_format": "latex", + "bbox": [ + 352, + 388, + 661, + 433 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "return $E _ { u b }$ end function ", + "bbox": [ + 189, + 434, + 295, + 462 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "A.10 $\\ell _ { 0 }$ SMOOTHING MEASURE ", + "text_level": 1, + "bbox": [ + 176, + 489, + 403, + 503 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "We can also handle discrete perturbations in our framework. A natural case to consider is $\\ell _ { 0 }$ perturbations. In this case, we assume that $\\mathcal { X } = A ^ { d }$ where ", + "bbox": [ + 171, + 515, + 823, + 542 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/cea5d711d195f35f310834b24d85e9c6b736ed0db6ee0de5dcb1fdf6906edb2a.jpg", + "text": "$$\nA = \\{ 1 , \\ldots , K \\}\n$$", + "text_format": "latex", + "bbox": [ + 442, + 550, + 555, + 568 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "is a discrete set. Then, we can choose ", + "bbox": [ + 173, + 573, + 421, + 588 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/7f25e890aa7379fa47b542e73bf5911cba9434f4d79201da2ace60eff6f84953.jpg", + "text": "$$\n\\mu ( x ) [ z ] = \\prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } { \\left( { \\frac { q } { K - 1 } } \\right) } ^ { 1 [ z _ { i } \\neq x _ { i } ] }\n$$", + "text_format": "latex", + "bbox": [ + 361, + 593, + 637, + 636 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "where and $\\frac { q } { K - 1 }$ $p + q = 1$ denotes a uniform probability of switching it to a different value. In this case, it can be , $p \\geq q \\geq 0$ , and $p$ denotes the probability that the measure retains the value of $x$ shown that for every $\\alpha > 0$ that ", + "bbox": [ + 174, + 641, + 823, + 685 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/6cfaf7e14b50761ec8aa248e1c83a6b460e78bc0acba5504bb9f04f2bd97d7a3.jpg", + "text": "$$\nR _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) = \\| x - x ^ { \\prime } \\| _ { 0 } \\left( \\frac { \\log \\left( p \\left( \\frac { q } { ( K - 1 ) p } \\right) ^ { ( \\alpha ) } + \\frac { q } { K - 1 } \\left( \\frac { ( K - 1 ) p } { q } \\right) ^ { ( \\alpha ) } + \\left( \\frac { K - 2 } { K - 1 } \\right) q \\right) } { \\alpha - 1 } \\right)\n$$", + "text_format": "latex", + "bbox": [ + 199, + 690, + 799, + 758 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "so that we can derive a certificate with respect to $\\ell _ { 0 }$ perturbations using any set of Renyi divergences ´ (or combinations of theses). ", + "bbox": [ + 173, + 762, + 823, + 791 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "This can be extended to structured discrete perturbations by introducing coupling terms between the perturbations: ", + "bbox": [ + 173, + 797, + 825, + 827 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/a0ccb5711642ec7beafcae2380d3f5dfddbc1bc38b99f59477022e38d21c6d96.jpg", + "text": "$$\n\\mu ( x ) [ z ] \\propto \\prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } \\bigg ( \\frac { q } { K - 1 } \\bigg ) ^ { 1 [ z _ { i } \\neq x _ { i } ] } \\exp \\left( \\sum _ { i = 1 } ^ { d - 1 } \\eta 1 [ z _ { i } = x _ { i } ] 1 [ z _ { i + 1 } = x _ { i + 1 } ] \\right) \\ .\n$$", + "text_format": "latex", + "bbox": [ + 227, + 833, + 769, + 877 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "This would correlate perturbations between adjacent features (which for example may be useful to model correlated perturbations for time series data). Since this can be viewed as a Markov Chain, Renyi divergences between ´ $\\mu ( x ) , \\mu ( x ^ { \\prime } )$ are still easy to compute. ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "A.11 COMPARISON WITH LECUYER ET AL. (2019) ON $\\ell _ { 1 }$ PERTURBATIONS ", + "bbox": [ + 173, + 103, + 697, + 118 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "Here we compare our certificates to Lecuyer et al. (2019) on the MNIST, CIFAR-10 and ImageNet datasets. The smoothing distribution is as described in A.8; a zero mean Laplacian distribution with smoothing value defined by the scale of the distribution. We first describe the hyperparameters used in training and certification for each of the datasets. For all datasets, images were normalized into a [0,1] range. ", + "bbox": [ + 174, + 128, + 825, + 200 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "MNIST hyperparameters: We trained a standard three layer CNN ReLU classifier for 50,000 steps with a batch size of 128 and a learning rate of 0.001. The smoothing value during training was set to 1.0. For certification we use $N \\overset { \\cdot } { = } 1 K , \\tilde { N } = 1 0 M , \\zeta = . 9 9$ , and sweep over a range of smoothing values between 0.5 and 1.5 and report the best certificate found. Certified accuracy is reported on 1,000 MNIST test set images. ", + "bbox": [ + 173, + 214, + 825, + 286 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "CIFAR-10 hyperparameters: We trained a Wide ResNet classifier for 50,000 training steps with a batch size of 32 and a learning rate of 0.001. The smoothing value during training was set to 0.2. For certification we use $N = 1 K , \\tilde { N } = 1 M , \\zeta = . 9 9$ , and sweep over a range of smoothing values between 0.1 and 0.5 and report the best certificate found. Certified accuracy is reported on 1,000 CIFAR-10 test set images. ", + "bbox": [ + 173, + 301, + 825, + 373 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "ImageNet hyperparameters: We trained a ResNet-152 classifier for 1 million training steps with a batch size of 16 and an initial learning rate of 0.1 that is decayed by a factor of ten every 25,000 steps. The smoothing value during training was set to 0.1. For certification we use $N = 1 K , \\tilde { N } =$ $1 0 0 K , \\zeta = . 9 9$ , and sweep over a range of smoothing values between 0.05 and 0.25 and report the best certificate found. Certified accuracy is reported on 500 ImageNet validation set images. ", + "bbox": [ + 173, + 388, + 825, + 460 + ], + "page_idx": 25 + }, + { + "type": "image", + "img_path": "images/91632107e779409bf7a1723095f72ac1b1035eae560bf1b3ef171f5a1d760330.jpg", + "image_caption": [ + "Figure 3: Certified accuracy under $\\ell _ { 1 }$ perturbations on CIFAR-10 and ImageNet. " + ], + "image_footnote": [], + "bbox": [ + 173, + 500, + 795, + 844 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "Results for MNIST can be seen in Table 6, CIFAR-10 and ImageNet results are shown in Figure 3. \nWe significantly outperform Lecuyer et al. (2019) on all three datasets. ", + "bbox": [ + 171, + 886, + 825, + 914 + ], + "page_idx": 25 + } +] \ No newline at end of file diff --git a/parse/train/SJlKrkSFPH/SJlKrkSFPH_middle.json b/parse/train/SJlKrkSFPH/SJlKrkSFPH_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..3b74677d7b10941a1b398cff58436b5d2715f635 --- /dev/null +++ b/parse/train/SJlKrkSFPH/SJlKrkSFPH_middle.json @@ -0,0 +1,89405 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 79, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 506, + 97 + ], + "score": 1.0, + "content": "A FRAMEWORK FOR ROBUSTNESS CERTIFICATION OF", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 98, + 471, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 98, + 471, + 118 + ], + "score": 1.0, + "content": "SMOOTHED CLASSIFIERS USING F-DIVERGENCES", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 111, + 134, + 491, + 216 + ], + "lines": [ + { + "bbox": [ + 111, + 133, + 473, + 147 + ], + "spans": [ + { + "bbox": [ + 111, + 134, + 253, + 147 + ], + "score": 1.0, + "content": "Krishnamurthy (Dj) Dvijotham†", + "type": "text" + }, + { + "bbox": [ + 261, + 133, + 473, + 147 + ], + "score": 1.0, + "content": "Jamie Hayes†‡∗ Borja Balle† J. Zico Kolterac", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 145, + 462, + 160 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 255, + 160 + ], + "score": 1.0, + "content": "Chongli Qin† Andras Gy ´ orgy ¨ †", + "type": "text" + }, + { + "bbox": [ + 262, + 145, + 462, + 159 + ], + "score": 1.0, + "content": "Kai Xiaob†∗ Sven Gowal† Pushmeet Kohli†", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 112, + 157, + 362, + 173 + ], + "spans": [ + { + "bbox": [ + 112, + 157, + 362, + 173 + ], + "score": 1.0, + "content": "†DeepMind, London, UK ‡University College London, UK", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 110, + 168, + 454, + 184 + ], + "spans": [ + { + "bbox": [ + 110, + 168, + 454, + 184 + ], + "score": 1.0, + "content": "a Carnegie Mellon University, USA b Massachusetts Institute of Technology, USA", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 110, + 180, + 228, + 195 + ], + "spans": [ + { + "bbox": [ + 110, + 180, + 228, + 195 + ], + "score": 1.0, + "content": "c Bosch Center for AI, USA", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 112, + 191, + 494, + 206 + ], + "spans": [ + { + "bbox": [ + 112, + 191, + 494, + 206 + ], + "score": 1.0, + "content": "{dvij, bballe, chongliqin, agyorgy, sgowal, pushmeet}@google.com", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 113, + 203, + 451, + 216 + ], + "spans": [ + { + "bbox": [ + 113, + 203, + 451, + 216 + ], + "score": 1.0, + "content": "{zkolter}@cs.cmu.edu {j.hayes}@ucl.ac.uk {kaix}@mit.edu", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 278, + 244, + 333, + 255 + ], + "lines": [ + { + "bbox": [ + 276, + 242, + 336, + 258 + ], + "spans": [ + { + "bbox": [ + 276, + 242, + 336, + 258 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 143, + 269, + 469, + 468 + ], + "lines": [ + { + "bbox": [ + 141, + 270, + 469, + 283 + ], + "spans": [ + { + "bbox": [ + 141, + 270, + 469, + 283 + ], + "score": 1.0, + "content": "Formal verification techniques that compute provable guarantees on properties", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 281, + 470, + 293 + ], + "spans": [ + { + "bbox": [ + 142, + 281, + 470, + 293 + ], + "score": 1.0, + "content": "of machine learning models, like robustness to norm-bounded adversarial pertur-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 292, + 470, + 304 + ], + "spans": [ + { + "bbox": [ + 141, + 292, + 470, + 304 + ], + "score": 1.0, + "content": "bations, have yielded impressive results. Although most techniques developed", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 303, + 470, + 315 + ], + "spans": [ + { + "bbox": [ + 141, + 303, + 470, + 315 + ], + "score": 1.0, + "content": "so far require knowledge of the architecture of the machine learning model and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 314, + 470, + 327 + ], + "spans": [ + { + "bbox": [ + 141, + 314, + 470, + 327 + ], + "score": 1.0, + "content": "remain hard to scale to complex prediction pipelines, the method of randomized", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 324, + 469, + 338 + ], + "spans": [ + { + "bbox": [ + 141, + 324, + 469, + 338 + ], + "score": 1.0, + "content": "smoothing has been shown to overcome many of these obstacles. By requiring", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 336, + 470, + 349 + ], + "spans": [ + { + "bbox": [ + 141, + 336, + 470, + 349 + ], + "score": 1.0, + "content": "only black-box access to the underlying model, randomized smoothing scales to", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 347, + 470, + 360 + ], + "spans": [ + { + "bbox": [ + 141, + 347, + 470, + 360 + ], + "score": 1.0, + "content": "large architectures and is agnostic to the internals of the network. However, past", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 357, + 469, + 371 + ], + "spans": [ + { + "bbox": [ + 141, + 357, + 469, + 371 + ], + "score": 1.0, + "content": "work on randomized smoothing has focused on restricted classes of smoothing", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 369, + 469, + 381 + ], + "spans": [ + { + "bbox": [ + 141, + 369, + 469, + 381 + ], + "score": 1.0, + "content": "measures or perturbations (like Gaussian or discrete) and has only been able to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 380, + 470, + 392 + ], + "spans": [ + { + "bbox": [ + 141, + 380, + 470, + 392 + ], + "score": 1.0, + "content": "prove robustness with respect to simple norm bounds. In this paper we introduce a", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 391, + 469, + 404 + ], + "spans": [ + { + "bbox": [ + 141, + 391, + 469, + 404 + ], + "score": 1.0, + "content": "general framework for proving robustness properties of smoothed machine learning", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 401, + 469, + 415 + ], + "spans": [ + { + "bbox": [ + 141, + 401, + 469, + 415 + ], + "score": 1.0, + "content": "models in the black-box setting. Specifically, we extend randomized smoothing", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 413, + 470, + 426 + ], + "spans": [ + { + "bbox": [ + 141, + 413, + 470, + 426 + ], + "score": 1.0, + "content": "procedures to handle arbitrary smoothing measures and prove robustness of the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 424, + 469, + 437 + ], + "spans": [ + { + "bbox": [ + 141, + 424, + 258, + 437 + ], + "score": 1.0, + "content": "smoothed classifier by using", + "type": "text" + }, + { + "bbox": [ + 258, + 424, + 265, + 435 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 424, + 469, + 437 + ], + "score": 1.0, + "content": "-divergences. Our methodology improves upon the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 433, + 469, + 448 + ], + "spans": [ + { + "bbox": [ + 141, + 433, + 469, + 448 + ], + "score": 1.0, + "content": "state of the art in terms of computation time or certified robustness on several image", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 445, + 469, + 458 + ], + "spans": [ + { + "bbox": [ + 141, + 445, + 469, + 458 + ], + "score": 1.0, + "content": "classification tasks and an audio classification task, with respect to several classes", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 142, + 456, + 256, + 469 + ], + "spans": [ + { + "bbox": [ + 142, + 456, + 256, + 469 + ], + "score": 1.0, + "content": "of adversarial perturbations.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 108, + 492, + 206, + 504 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 208, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 208, + 507 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 519, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 505, + 532 + ], + "score": 1.0, + "content": "Predictors obtained from machine learning algorithms have been shown to be vulnerable to making", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 530, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 530, + 505, + 542 + ], + "score": 1.0, + "content": "errors when the inputs are perturbed by carefully chosen small but imperceptible amounts (Szegedy", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 539, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 104, + 539, + 506, + 554 + ], + "score": 1.0, + "content": "et al., 2014; Biggio et al., 2013). This has motivated significant amount of research in improving", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 551, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 506, + 564 + ], + "score": 1.0, + "content": "adversarial robustness of a machine learning model (see, e.g. Goodfellow et al., 2015; Madry et al.,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "2018). While significant advances have been made, it has been shown that models that were estimated", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "score": 1.0, + "content": "to be robust have later been broken by stronger attacks (Athalye et al., 2018; Uesato et al., 2018).", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 583, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 597 + ], + "score": 1.0, + "content": "This has led to the need for methods that offer provable guarantees that the predictor cannot be forced", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 596, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 607 + ], + "score": 1.0, + "content": "to misclassify an example by any attack algorithm restricted to produce perturbations within a certain", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 605, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 214, + 619 + ], + "score": 1.0, + "content": "set (for example, within an", + "type": "text" + }, + { + "bbox": [ + 214, + 606, + 225, + 618 + ], + "score": 0.89, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 605, + 506, + 619 + ], + "score": 1.0, + "content": "norm ball). While progress has been made leading to methods that are", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 617, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 506, + 630 + ], + "score": 1.0, + "content": "able to compute provable guarantees for several image and text classification tasks (Wong & Kolter,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 626, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 642 + ], + "score": 1.0, + "content": "2018; Wong et al., 2018; Raghunathan et al., 2018; Dvijotham et al., 2018; Katz et al., 2017; Huang", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "et al., 2019; Jia et al., 2019), these methods require extensive knowledge of the architecture of the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 650, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 505, + 662 + ], + "score": 1.0, + "content": "predictor and are not easy to extend to new models or architectures, requiring specialized algorithms", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "score": 1.0, + "content": "for each new class of models. Furthermore, the computational complexity of these methods grows", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 672, + 311, + 684 + ], + "spans": [ + { + "bbox": [ + 106, + 672, + 311, + 684 + ], + "score": 1.0, + "content": "significantly with input dimension and model size.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 108, + 689, + 504, + 711 + ], + "lines": [ + { + "bbox": [ + 106, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "To deal with these obstacles, recent work has proposed the randomized smoothing strategy for", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "verifying the robustness of classifiers. Specifically, Lecuyer et al. (2019) and Cohen et al. (2019)", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 722, + 289, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 719, + 290, + 734 + ], + "spans": [ + { + "bbox": [ + 118, + 719, + 290, + 734 + ], + "score": 1.0, + "content": "∗Work done during an internship at DeepMind.", + "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": [ + 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": [ + 107, + 79, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 506, + 97 + ], + "score": 1.0, + "content": "A FRAMEWORK FOR ROBUSTNESS CERTIFICATION OF", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 98, + 471, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 98, + 471, + 118 + ], + "score": 1.0, + "content": "SMOOTHED CLASSIFIERS USING F-DIVERGENCES", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "list", + "bbox": [ + 111, + 134, + 491, + 216 + ], + "lines": [ + { + "bbox": [ + 111, + 133, + 473, + 147 + ], + "spans": [ + { + "bbox": [ + 111, + 134, + 253, + 147 + ], + "score": 1.0, + "content": "Krishnamurthy (Dj) Dvijotham†", + "type": "text" + }, + { + "bbox": [ + 261, + 133, + 473, + 147 + ], + "score": 1.0, + "content": "Jamie Hayes†‡∗ Borja Balle† J. Zico Kolterac", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 145, + 462, + 160 + ], + "spans": [ + { + "bbox": [ + 112, + 146, + 255, + 160 + ], + "score": 1.0, + "content": "Chongli Qin† Andras Gy ´ orgy ¨ †", + "type": "text" + }, + { + "bbox": [ + 262, + 145, + 462, + 159 + ], + "score": 1.0, + "content": "Kai Xiaob†∗ Sven Gowal† Pushmeet Kohli†", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 157, + 362, + 173 + ], + "spans": [ + { + "bbox": [ + 112, + 157, + 362, + 173 + ], + "score": 1.0, + "content": "†DeepMind, London, UK ‡University College London, UK", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 168, + 454, + 184 + ], + "spans": [ + { + "bbox": [ + 110, + 168, + 454, + 184 + ], + "score": 1.0, + "content": "a Carnegie Mellon University, USA b Massachusetts Institute of Technology, USA", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 180, + 228, + 195 + ], + "spans": [ + { + "bbox": [ + 110, + 180, + 228, + 195 + ], + "score": 1.0, + "content": "c Bosch Center for AI, USA", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 191, + 494, + 206 + ], + "spans": [ + { + "bbox": [ + 112, + 191, + 494, + 206 + ], + "score": 1.0, + "content": "{dvij, bballe, chongliqin, agyorgy, sgowal, pushmeet}@google.com", + "type": "text" + } + ], + "index": 7, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 203, + 451, + 216 + ], + "spans": [ + { + "bbox": [ + 113, + 203, + 451, + 216 + ], + "score": 1.0, + "content": "{zkolter}@cs.cmu.edu {j.hayes}@ucl.ac.uk {kaix}@mit.edu", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + } + ], + "index": 5, + "bbox_fs": [ + 110, + 133, + 494, + 216 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 244, + 333, + 255 + ], + "lines": [ + { + "bbox": [ + 276, + 242, + 336, + 258 + ], + "spans": [ + { + "bbox": [ + 276, + 242, + 336, + 258 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 143, + 269, + 469, + 468 + ], + "lines": [ + { + "bbox": [ + 141, + 270, + 469, + 283 + ], + "spans": [ + { + "bbox": [ + 141, + 270, + 469, + 283 + ], + "score": 1.0, + "content": "Formal verification techniques that compute provable guarantees on properties", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 281, + 470, + 293 + ], + "spans": [ + { + "bbox": [ + 142, + 281, + 470, + 293 + ], + "score": 1.0, + "content": "of machine learning models, like robustness to norm-bounded adversarial pertur-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 292, + 470, + 304 + ], + "spans": [ + { + "bbox": [ + 141, + 292, + 470, + 304 + ], + "score": 1.0, + "content": "bations, have yielded impressive results. Although most techniques developed", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 303, + 470, + 315 + ], + "spans": [ + { + "bbox": [ + 141, + 303, + 470, + 315 + ], + "score": 1.0, + "content": "so far require knowledge of the architecture of the machine learning model and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 314, + 470, + 327 + ], + "spans": [ + { + "bbox": [ + 141, + 314, + 470, + 327 + ], + "score": 1.0, + "content": "remain hard to scale to complex prediction pipelines, the method of randomized", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 324, + 469, + 338 + ], + "spans": [ + { + "bbox": [ + 141, + 324, + 469, + 338 + ], + "score": 1.0, + "content": "smoothing has been shown to overcome many of these obstacles. By requiring", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 336, + 470, + 349 + ], + "spans": [ + { + "bbox": [ + 141, + 336, + 470, + 349 + ], + "score": 1.0, + "content": "only black-box access to the underlying model, randomized smoothing scales to", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 347, + 470, + 360 + ], + "spans": [ + { + "bbox": [ + 141, + 347, + 470, + 360 + ], + "score": 1.0, + "content": "large architectures and is agnostic to the internals of the network. However, past", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 357, + 469, + 371 + ], + "spans": [ + { + "bbox": [ + 141, + 357, + 469, + 371 + ], + "score": 1.0, + "content": "work on randomized smoothing has focused on restricted classes of smoothing", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 369, + 469, + 381 + ], + "spans": [ + { + "bbox": [ + 141, + 369, + 469, + 381 + ], + "score": 1.0, + "content": "measures or perturbations (like Gaussian or discrete) and has only been able to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 380, + 470, + 392 + ], + "spans": [ + { + "bbox": [ + 141, + 380, + 470, + 392 + ], + "score": 1.0, + "content": "prove robustness with respect to simple norm bounds. In this paper we introduce a", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 391, + 469, + 404 + ], + "spans": [ + { + "bbox": [ + 141, + 391, + 469, + 404 + ], + "score": 1.0, + "content": "general framework for proving robustness properties of smoothed machine learning", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 401, + 469, + 415 + ], + "spans": [ + { + "bbox": [ + 141, + 401, + 469, + 415 + ], + "score": 1.0, + "content": "models in the black-box setting. Specifically, we extend randomized smoothing", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 413, + 470, + 426 + ], + "spans": [ + { + "bbox": [ + 141, + 413, + 470, + 426 + ], + "score": 1.0, + "content": "procedures to handle arbitrary smoothing measures and prove robustness of the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 424, + 469, + 437 + ], + "spans": [ + { + "bbox": [ + 141, + 424, + 258, + 437 + ], + "score": 1.0, + "content": "smoothed classifier by using", + "type": "text" + }, + { + "bbox": [ + 258, + 424, + 265, + 435 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 424, + 469, + 437 + ], + "score": 1.0, + "content": "-divergences. Our methodology improves upon the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 433, + 469, + 448 + ], + "spans": [ + { + "bbox": [ + 141, + 433, + 469, + 448 + ], + "score": 1.0, + "content": "state of the art in terms of computation time or certified robustness on several image", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 141, + 445, + 469, + 458 + ], + "spans": [ + { + "bbox": [ + 141, + 445, + 469, + 458 + ], + "score": 1.0, + "content": "classification tasks and an audio classification task, with respect to several classes", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 142, + 456, + 256, + 469 + ], + "spans": [ + { + "bbox": [ + 142, + 456, + 256, + 469 + ], + "score": 1.0, + "content": "of adversarial perturbations.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 18.5, + "bbox_fs": [ + 141, + 270, + 470, + 469 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 492, + 206, + 504 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 208, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 208, + 507 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 519, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 505, + 532 + ], + "score": 1.0, + "content": "Predictors obtained from machine learning algorithms have been shown to be vulnerable to making", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 530, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 530, + 505, + 542 + ], + "score": 1.0, + "content": "errors when the inputs are perturbed by carefully chosen small but imperceptible amounts (Szegedy", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 539, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 104, + 539, + 506, + 554 + ], + "score": 1.0, + "content": "et al., 2014; Biggio et al., 2013). This has motivated significant amount of research in improving", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 551, + 506, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 506, + 564 + ], + "score": 1.0, + "content": "adversarial robustness of a machine learning model (see, e.g. Goodfellow et al., 2015; Madry et al.,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 506, + 574 + ], + "score": 1.0, + "content": "2018). While significant advances have been made, it has been shown that models that were estimated", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 506, + 586 + ], + "score": 1.0, + "content": "to be robust have later been broken by stronger attacks (Athalye et al., 2018; Uesato et al., 2018).", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 583, + 506, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 597 + ], + "score": 1.0, + "content": "This has led to the need for methods that offer provable guarantees that the predictor cannot be forced", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 596, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 607 + ], + "score": 1.0, + "content": "to misclassify an example by any attack algorithm restricted to produce perturbations within a certain", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 605, + 506, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 214, + 619 + ], + "score": 1.0, + "content": "set (for example, within an", + "type": "text" + }, + { + "bbox": [ + 214, + 606, + 225, + 618 + ], + "score": 0.89, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 605, + 506, + 619 + ], + "score": 1.0, + "content": "norm ball). While progress has been made leading to methods that are", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 617, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 506, + 630 + ], + "score": 1.0, + "content": "able to compute provable guarantees for several image and text classification tasks (Wong & Kolter,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 626, + 506, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 642 + ], + "score": 1.0, + "content": "2018; Wong et al., 2018; Raghunathan et al., 2018; Dvijotham et al., 2018; Katz et al., 2017; Huang", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "et al., 2019; Jia et al., 2019), these methods require extensive knowledge of the architecture of the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 650, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 505, + 662 + ], + "score": 1.0, + "content": "predictor and are not easy to extend to new models or architectures, requiring specialized algorithms", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "score": 1.0, + "content": "for each new class of models. Furthermore, the computational complexity of these methods grows", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 672, + 311, + 684 + ], + "spans": [ + { + "bbox": [ + 106, + 672, + 311, + 684 + ], + "score": 1.0, + "content": "significantly with input dimension and model size.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 36, + "bbox_fs": [ + 104, + 517, + 506, + 684 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 689, + 504, + 711 + ], + "lines": [ + { + "bbox": [ + 106, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "To deal with these obstacles, recent work has proposed the randomized smoothing strategy for", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "verifying the robustness of classifiers. Specifically, Lecuyer et al. (2019) and Cohen et al. (2019)", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 687, + 506, + 712 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "have shown that robustness properties can be more easily verified for the smoothed version of a base", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 281, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 144, + 106 + ], + "score": 1.0, + "content": "classifier", + "type": "text" + }, + { + "bbox": [ + 145, + 94, + 151, + 104 + ], + "score": 0.77, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 93, + 268, + 106 + ], + "score": 1.0, + "content": "producing labels in some set", + "type": "text" + }, + { + "bbox": [ + 269, + 94, + 277, + 105 + ], + "score": 0.77, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 93, + 281, + 106 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 110, + 384, + 131 + ], + "lines": [ + { + "bbox": [ + 226, + 110, + 384, + 131 + ], + "spans": [ + { + "bbox": [ + 226, + 110, + 384, + 131 + ], + "score": 0.94, + "content": "h _ { s } ( x ) = \\underset { y \\in \\mathcal { V } } { \\arg \\operatorname* { m a x } } \\ \\underset { X \\sim \\mu ( x ) } { \\mathbb { P } } \\big [ h ( X ) = y \\big ] \\ ,", + "type": "interline_equation", + "image_path": "ffae80575ac3e04b65ca0265c693acd9bbebfd42241c9d584e622d28c70312fe.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 226, + 110, + 384, + 131 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 137, + 505, + 214 + ], + "lines": [ + { + "bbox": [ + 105, + 136, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 312, + 150 + ], + "score": 1.0, + "content": "where the labels returned by the smoothed classifier", + "type": "text" + }, + { + "bbox": [ + 312, + 138, + 324, + 149 + ], + "score": 0.9, + "content": "h _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 136, + 505, + 150 + ], + "score": 1.0, + "content": "are obtained by taking a “majority vote” over", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 268, + 161 + ], + "score": 1.0, + "content": "the predictions of the original classifier", + "type": "text" + }, + { + "bbox": [ + 269, + 149, + 276, + 158 + ], + "score": 0.83, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 149, + 505, + 161 + ], + "score": 1.0, + "content": "on random inputs drawn from a probability distribution", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 107, + 159, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 107, + 159, + 127, + 171 + ], + "score": 0.91, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 159, + 506, + 172 + ], + "score": 1.0, + "content": ", called the smoothing measure. Lecuyer et al. (2019) showed that verifying the robustness", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 170, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 459, + 183 + ], + "score": 1.0, + "content": "of this smoothed classifier is significantly simpler than verifying the original classifier", + "type": "text" + }, + { + "bbox": [ + 459, + 171, + 466, + 180 + ], + "score": 0.79, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 170, + 505, + 183 + ], + "score": 1.0, + "content": "and only", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 181, + 505, + 193 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 505, + 193 + ], + "score": 1.0, + "content": "requires estimating the distribution of outputs of the classifier under random perturbations of the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 374, + 205 + ], + "score": 1.0, + "content": "input, but does not require access to the internals of the classifier", + "type": "text" + }, + { + "bbox": [ + 374, + 193, + 380, + 202 + ], + "score": 0.77, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 192, + 506, + 205 + ], + "score": 1.0, + "content": ". We refer to this as black-box", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 204, + 157, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 157, + 216 + ], + "score": 1.0, + "content": "verification.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 219, + 504, + 243 + ], + "lines": [ + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "score": 1.0, + "content": "In this work, we develop a general framework for black-box verification that recovers prior work as", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 231, + 374, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 231, + 374, + 244 + ], + "score": 1.0, + "content": "special cases, and improves upon previous results in various ways.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 254, + 359, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 361, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 361, + 268 + ], + "score": 1.0, + "content": "Contributions Our contributions are summarized as follows:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 114, + 275, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 114, + 276, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 114, + 276, + 505, + 288 + ], + "score": 1.0, + "content": "1. We formulate the general problem of black-box verification via a generalized randomized", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 126, + 287, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 126, + 287, + 505, + 300 + ], + "score": 1.0, + "content": "smoothing procedure, which extends existing approaches to allow for arbitrary smoothing", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 125, + 298, + 506, + 310 + ], + "spans": [ + { + "bbox": [ + 125, + 298, + 506, + 310 + ], + "score": 1.0, + "content": "measures. Specifically, we show that robustness certificates for smoothed classifiers can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 126, + 308, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 126, + 308, + 506, + 322 + ], + "score": 1.0, + "content": "obtained by solving a small convex optimization problem when allowed adversarial perturbations", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 126, + 320, + 437, + 333 + ], + "spans": [ + { + "bbox": [ + 126, + 320, + 437, + 333 + ], + "score": 1.0, + "content": "can be characterized via divergence-based bounds on the smoothing measure.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 113, + 335, + 503, + 368 + ], + "lines": [ + { + "bbox": [ + 113, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 113, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "2. We prove that our certificates generalize previous results obtained in related work (Lecuyer", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 126, + 346, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 126, + 346, + 505, + 358 + ], + "score": 1.0, + "content": "et al., 2019; Cohen et al., 2019; Li et al., 2019), and vastly extend the class of perturbations and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 126, + 356, + 446, + 370 + ], + "spans": [ + { + "bbox": [ + 126, + 356, + 446, + 370 + ], + "score": 1.0, + "content": "smoothing measures that can be used while still allowing certifiable guarantees.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 114, + 372, + 506, + 416 + ], + "lines": [ + { + "bbox": [ + 113, + 372, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 113, + 372, + 505, + 383 + ], + "score": 1.0, + "content": "3. We introduce the notion of full-information and information-limited settings, and show that the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 126, + 383, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 126, + 383, + 505, + 395 + ], + "score": 1.0, + "content": "information-limited setting that has been the main focus of prior work leads to weaker certificates", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 126, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 126, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "for smoothed probabilistic classifiers, and can be improved by using additional information (the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 126, + 405, + 360, + 417 + ], + "spans": [ + { + "bbox": [ + 126, + 405, + 360, + 417 + ], + "score": 1.0, + "content": "distribution of label scores under randomized smoothing).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 114, + 420, + 505, + 519 + ], + "lines": [ + { + "bbox": [ + 112, + 419, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 112, + 419, + 506, + 433 + ], + "score": 1.0, + "content": "4. We evaluate our framework experimentally on image and classification tasks, obtaining ro-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 125, + 430, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 125, + 430, + 506, + 444 + ], + "score": 1.0, + "content": "bustness certificates that improve upon other black-box methods either in terms of certificate", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 125, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 125, + 442, + 313, + 455 + ], + "score": 1.0, + "content": "tightness or computation time on robustness to", + "type": "text" + }, + { + "bbox": [ + 313, + 442, + 336, + 453 + ], + "score": 0.92, + "content": "\\ell _ { 0 } , \\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 442, + 348, + 455 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 348, + 442, + 358, + 453 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "perturbations on MNIST, CIFAR-10", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 126, + 453, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 126, + 453, + 186, + 465 + ], + "score": 1.0, + "content": "and ImageNet.", + "type": "text" + }, + { + "bbox": [ + 186, + 453, + 196, + 464 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 453, + 505, + 465 + ], + "score": 1.0, + "content": "perturbations result from worst-case realizations of white noise that is common", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 124, + 463, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 124, + 463, + 307, + 478 + ], + "score": 1.0, + "content": "in many image, speech and video processing.", + "type": "text" + }, + { + "bbox": [ + 307, + 464, + 318, + 475 + ], + "score": 0.87, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 463, + 506, + 478 + ], + "score": 1.0, + "content": "perturbations can model missing data (missing", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 125, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 125, + 475, + 407, + 487 + ], + "score": 1.0, + "content": "pixels in an image, or samples in a time-domain audio signal) while", + "type": "text" + }, + { + "bbox": [ + 408, + 475, + 418, + 486 + ], + "score": 0.85, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "perturbations can be", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 126, + 486, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 126, + 486, + 506, + 497 + ], + "score": 1.0, + "content": "used to model convex combinations of discrete perturbations in text classification (Jia et al.,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 125, + 497, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 125, + 497, + 505, + 510 + ], + "score": 1.0, + "content": "2019). We also obtain the first, to the best of our knowledge, certifiably robust model for an", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 125, + 507, + 488, + 521 + ], + "spans": [ + { + "bbox": [ + 125, + 507, + 488, + 521 + ], + "score": 1.0, + "content": "audio classification task, Librispeech (Panayotov et al., 2015), with variable-length inputs.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29 + }, + { + "type": "title", + "bbox": [ + 107, + 536, + 416, + 548 + ], + "lines": [ + { + "bbox": [ + 104, + 534, + 417, + 550 + ], + "spans": [ + { + "bbox": [ + 104, + 534, + 417, + 550 + ], + "score": 1.0, + "content": "2 BLACK-BOX VERIFICATION FOR SMOOTHED CLASSIFIERS", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 559, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 106, + 560, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 221, + 573 + ], + "score": 1.0, + "content": "Consider a binary classifier", + "type": "text" + }, + { + "bbox": [ + 221, + 560, + 285, + 573 + ], + "score": 0.93, + "content": "h : \\mathcal { X } \\{ \\pm 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "given to us as a black box, so we can only access the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 571, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 571, + 196, + 583 + ], + "score": 1.0, + "content": "inputs and outputs of", + "type": "text" + }, + { + "bbox": [ + 197, + 572, + 204, + 582 + ], + "score": 0.82, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 571, + 505, + 583 + ], + "score": 1.0, + "content": "but not its internals. We are interested in investigating the robustness of", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 200, + 596 + ], + "score": 1.0, + "content": "the smoothed classifier", + "type": "text" + }, + { + "bbox": [ + 201, + 583, + 212, + 594 + ], + "score": 0.86, + "content": "h _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 582, + 478, + 596 + ], + "score": 1.0, + "content": "(defined in Eq. 1) against adversarial perturbations of size at most", + "type": "text" + }, + { + "bbox": [ + 478, + 585, + 484, + 592 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 582, + 506, + 596 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 593, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 206, + 606 + ], + "score": 1.0, + "content": "respect to a given norm", + "type": "text" + }, + { + "bbox": [ + 206, + 594, + 219, + 605 + ], + "score": 0.83, + "content": "\\left\\| \\cdot \\right\\|", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 593, + 506, + 606 + ], + "score": 1.0, + "content": ". To determine whether a norm-bounded adversarial attack on a fixed", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 604, + 470, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 129, + 617 + ], + "score": 1.0, + "content": "input", + "type": "text" + }, + { + "bbox": [ + 130, + 605, + 157, + 615 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 604, + 178, + 617 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 179, + 605, + 230, + 617 + ], + "score": 0.92, + "content": "h _ { s } ( x ) = + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 604, + 470, + 617 + ], + "score": 1.0, + "content": "could be successful, we can solve the optimization problem", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 621, + 374, + 641 + ], + "lines": [ + { + "bbox": [ + 236, + 621, + 374, + 641 + ], + "spans": [ + { + "bbox": [ + 236, + 621, + 374, + 641 + ], + "score": 0.94, + "content": "\\operatorname* { m i n } _ { \\| \\boldsymbol { x ^ { \\prime } } - \\boldsymbol { x } \\| \\le \\epsilon { \\boldsymbol X ^ { \\prime } } \\sim \\mu ( \\boldsymbol { x ^ { \\prime } } ) } [ h ( \\boldsymbol { X ^ { \\prime } } ) = + 1 ] ,", + "type": "interline_equation", + "image_path": "488b1e3ac23c10ba3be97a0376ce5ef0c389de876510b99f1269c2115dfd78f1.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 236, + 621, + 374, + 641 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 505, + 704 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 351, + 663 + ], + "score": 1.0, + "content": "and check whether the minimum value can be smaller than", + "type": "text" + }, + { + "bbox": [ + 351, + 648, + 358, + 662 + ], + "score": 0.83, + "content": "\\frac { 1 } { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 647, + 506, + 663 + ], + "score": 1.0, + "content": ". This is a non-convex optimization", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "score": 1.0, + "content": "problem for which we may not even be able to compute gradients since we only have black-box access", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 117, + 684 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 671, + 124, + 681 + ], + "score": 0.79, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 124, + 670, + 505, + 684 + ], + "score": 1.0, + "content": ". While techniques have been developed to address this problem, obtaining provable guarantees", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 681, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 505, + 694 + ], + "score": 1.0, + "content": "on whether these algorithms actually find the worst-case adversarial perturbation is difficult since we", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 693, + 283, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 273, + 704 + ], + "score": 1.0, + "content": "do not know anything about the nature of", + "type": "text" + }, + { + "bbox": [ + 274, + 694, + 280, + 703 + ], + "score": 0.85, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 693, + 283, + 704 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Motivated by this difficulty, we take a different approach: Rather than studying the adversarial attack", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 178, + 733 + ], + "score": 1.0, + "content": "in the input space", + "type": "text" + }, + { + "bbox": [ + 178, + 721, + 188, + 730 + ], + "score": 0.8, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 720, + 478, + 733 + ], + "score": 1.0, + "content": ", we study it in the space of probability measures over inputs, denoted by", + "type": "text" + }, + { + "bbox": [ + 478, + 721, + 502, + 732 + ], + "score": 0.92, + "content": "\\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 720, + 506, + 733 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5 + } + ], + "page_idx": 1, + "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": [ + 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": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "have shown that robustness properties can be more easily verified for the smoothed version of a base", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 281, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 144, + 106 + ], + "score": 1.0, + "content": "classifier", + "type": "text" + }, + { + "bbox": [ + 145, + 94, + 151, + 104 + ], + "score": 0.77, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 93, + 268, + 106 + ], + "score": 1.0, + "content": "producing labels in some set", + "type": "text" + }, + { + "bbox": [ + 269, + 94, + 277, + 105 + ], + "score": 0.77, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 93, + 281, + 106 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 106 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 110, + 384, + 131 + ], + "lines": [ + { + "bbox": [ + 226, + 110, + 384, + 131 + ], + "spans": [ + { + "bbox": [ + 226, + 110, + 384, + 131 + ], + "score": 0.94, + "content": "h _ { s } ( x ) = \\underset { y \\in \\mathcal { V } } { \\arg \\operatorname* { m a x } } \\ \\underset { X \\sim \\mu ( x ) } { \\mathbb { P } } \\big [ h ( X ) = y \\big ] \\ ,", + "type": "interline_equation", + "image_path": "ffae80575ac3e04b65ca0265c693acd9bbebfd42241c9d584e622d28c70312fe.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 226, + 110, + 384, + 131 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 137, + 505, + 214 + ], + "lines": [ + { + "bbox": [ + 105, + 136, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 312, + 150 + ], + "score": 1.0, + "content": "where the labels returned by the smoothed classifier", + "type": "text" + }, + { + "bbox": [ + 312, + 138, + 324, + 149 + ], + "score": 0.9, + "content": "h _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 136, + 505, + 150 + ], + "score": 1.0, + "content": "are obtained by taking a “majority vote” over", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 268, + 161 + ], + "score": 1.0, + "content": "the predictions of the original classifier", + "type": "text" + }, + { + "bbox": [ + 269, + 149, + 276, + 158 + ], + "score": 0.83, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 149, + 505, + 161 + ], + "score": 1.0, + "content": "on random inputs drawn from a probability distribution", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 107, + 159, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 107, + 159, + 127, + 171 + ], + "score": 0.91, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 159, + 506, + 172 + ], + "score": 1.0, + "content": ", called the smoothing measure. Lecuyer et al. (2019) showed that verifying the robustness", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 170, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 459, + 183 + ], + "score": 1.0, + "content": "of this smoothed classifier is significantly simpler than verifying the original classifier", + "type": "text" + }, + { + "bbox": [ + 459, + 171, + 466, + 180 + ], + "score": 0.79, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 170, + 505, + 183 + ], + "score": 1.0, + "content": "and only", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 181, + 505, + 193 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 505, + 193 + ], + "score": 1.0, + "content": "requires estimating the distribution of outputs of the classifier under random perturbations of the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 374, + 205 + ], + "score": 1.0, + "content": "input, but does not require access to the internals of the classifier", + "type": "text" + }, + { + "bbox": [ + 374, + 193, + 380, + 202 + ], + "score": 0.77, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 192, + 506, + 205 + ], + "score": 1.0, + "content": ". We refer to this as black-box", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 204, + 157, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 157, + 216 + ], + "score": 1.0, + "content": "verification.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 136, + 506, + 216 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 219, + 504, + 243 + ], + "lines": [ + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "score": 1.0, + "content": "In this work, we develop a general framework for black-box verification that recovers prior work as", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 231, + 374, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 231, + 374, + 244 + ], + "score": 1.0, + "content": "special cases, and improves upon previous results in various ways.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 219, + 505, + 244 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 254, + 359, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 361, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 361, + 268 + ], + "score": 1.0, + "content": "Contributions Our contributions are summarized as follows:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 253, + 361, + 268 + ] + }, + { + "type": "text", + "bbox": [ + 114, + 275, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 114, + 276, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 114, + 276, + 505, + 288 + ], + "score": 1.0, + "content": "1. We formulate the general problem of black-box verification via a generalized randomized", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 126, + 287, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 126, + 287, + 505, + 300 + ], + "score": 1.0, + "content": "smoothing procedure, which extends existing approaches to allow for arbitrary smoothing", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 125, + 298, + 506, + 310 + ], + "spans": [ + { + "bbox": [ + 125, + 298, + 506, + 310 + ], + "score": 1.0, + "content": "measures. Specifically, we show that robustness certificates for smoothed classifiers can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 126, + 308, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 126, + 308, + 506, + 322 + ], + "score": 1.0, + "content": "obtained by solving a small convex optimization problem when allowed adversarial perturbations", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 126, + 320, + 437, + 333 + ], + "spans": [ + { + "bbox": [ + 126, + 320, + 437, + 333 + ], + "score": 1.0, + "content": "can be characterized via divergence-based bounds on the smoothing measure.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15, + "bbox_fs": [ + 114, + 276, + 506, + 333 + ] + }, + { + "type": "text", + "bbox": [ + 113, + 335, + 503, + 368 + ], + "lines": [ + { + "bbox": [ + 113, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 113, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "2. We prove that our certificates generalize previous results obtained in related work (Lecuyer", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 126, + 346, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 126, + 346, + 505, + 358 + ], + "score": 1.0, + "content": "et al., 2019; Cohen et al., 2019; Li et al., 2019), and vastly extend the class of perturbations and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 126, + 356, + 446, + 370 + ], + "spans": [ + { + "bbox": [ + 126, + 356, + 446, + 370 + ], + "score": 1.0, + "content": "smoothing measures that can be used while still allowing certifiable guarantees.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 113, + 334, + 505, + 370 + ] + }, + { + "type": "text", + "bbox": [ + 114, + 372, + 506, + 416 + ], + "lines": [ + { + "bbox": [ + 113, + 372, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 113, + 372, + 505, + 383 + ], + "score": 1.0, + "content": "3. We introduce the notion of full-information and information-limited settings, and show that the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 126, + 383, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 126, + 383, + 505, + 395 + ], + "score": 1.0, + "content": "information-limited setting that has been the main focus of prior work leads to weaker certificates", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 126, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 126, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "for smoothed probabilistic classifiers, and can be improved by using additional information (the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 126, + 405, + 360, + 417 + ], + "spans": [ + { + "bbox": [ + 126, + 405, + 360, + 417 + ], + "score": 1.0, + "content": "distribution of label scores under randomized smoothing).", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5, + "bbox_fs": [ + 113, + 372, + 505, + 417 + ] + }, + { + "type": "text", + "bbox": [ + 114, + 420, + 505, + 519 + ], + "lines": [ + { + "bbox": [ + 112, + 419, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 112, + 419, + 506, + 433 + ], + "score": 1.0, + "content": "4. We evaluate our framework experimentally on image and classification tasks, obtaining ro-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 125, + 430, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 125, + 430, + 506, + 444 + ], + "score": 1.0, + "content": "bustness certificates that improve upon other black-box methods either in terms of certificate", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 125, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 125, + 442, + 313, + 455 + ], + "score": 1.0, + "content": "tightness or computation time on robustness to", + "type": "text" + }, + { + "bbox": [ + 313, + 442, + 336, + 453 + ], + "score": 0.92, + "content": "\\ell _ { 0 } , \\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 442, + 348, + 455 + ], + "score": 1.0, + "content": "or", + "type": "text" + }, + { + "bbox": [ + 348, + 442, + 358, + 453 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "perturbations on MNIST, CIFAR-10", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 126, + 453, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 126, + 453, + 186, + 465 + ], + "score": 1.0, + "content": "and ImageNet.", + "type": "text" + }, + { + "bbox": [ + 186, + 453, + 196, + 464 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 453, + 505, + 465 + ], + "score": 1.0, + "content": "perturbations result from worst-case realizations of white noise that is common", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 124, + 463, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 124, + 463, + 307, + 478 + ], + "score": 1.0, + "content": "in many image, speech and video processing.", + "type": "text" + }, + { + "bbox": [ + 307, + 464, + 318, + 475 + ], + "score": 0.87, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 463, + 506, + 478 + ], + "score": 1.0, + "content": "perturbations can model missing data (missing", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 125, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 125, + 475, + 407, + 487 + ], + "score": 1.0, + "content": "pixels in an image, or samples in a time-domain audio signal) while", + "type": "text" + }, + { + "bbox": [ + 408, + 475, + 418, + 486 + ], + "score": 0.85, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "perturbations can be", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 126, + 486, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 126, + 486, + 506, + 497 + ], + "score": 1.0, + "content": "used to model convex combinations of discrete perturbations in text classification (Jia et al.,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 125, + 497, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 125, + 497, + 505, + 510 + ], + "score": 1.0, + "content": "2019). We also obtain the first, to the best of our knowledge, certifiably robust model for an", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 125, + 507, + 488, + 521 + ], + "spans": [ + { + "bbox": [ + 125, + 507, + 488, + 521 + ], + "score": 1.0, + "content": "audio classification task, Librispeech (Panayotov et al., 2015), with variable-length inputs.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29, + "bbox_fs": [ + 112, + 419, + 506, + 521 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 536, + 416, + 548 + ], + "lines": [ + { + "bbox": [ + 104, + 534, + 417, + 550 + ], + "spans": [ + { + "bbox": [ + 104, + 534, + 417, + 550 + ], + "score": 1.0, + "content": "2 BLACK-BOX VERIFICATION FOR SMOOTHED CLASSIFIERS", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 559, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 106, + 560, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 221, + 573 + ], + "score": 1.0, + "content": "Consider a binary classifier", + "type": "text" + }, + { + "bbox": [ + 221, + 560, + 285, + 573 + ], + "score": 0.93, + "content": "h : \\mathcal { X } \\{ \\pm 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "given to us as a black box, so we can only access the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 571, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 571, + 196, + 583 + ], + "score": 1.0, + "content": "inputs and outputs of", + "type": "text" + }, + { + "bbox": [ + 197, + 572, + 204, + 582 + ], + "score": 0.82, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 571, + 505, + 583 + ], + "score": 1.0, + "content": "but not its internals. We are interested in investigating the robustness of", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 582, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 200, + 596 + ], + "score": 1.0, + "content": "the smoothed classifier", + "type": "text" + }, + { + "bbox": [ + 201, + 583, + 212, + 594 + ], + "score": 0.86, + "content": "h _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 582, + 478, + 596 + ], + "score": 1.0, + "content": "(defined in Eq. 1) against adversarial perturbations of size at most", + "type": "text" + }, + { + "bbox": [ + 478, + 585, + 484, + 592 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 582, + 506, + 596 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 593, + 506, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 206, + 606 + ], + "score": 1.0, + "content": "respect to a given norm", + "type": "text" + }, + { + "bbox": [ + 206, + 594, + 219, + 605 + ], + "score": 0.83, + "content": "\\left\\| \\cdot \\right\\|", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 593, + 506, + 606 + ], + "score": 1.0, + "content": ". To determine whether a norm-bounded adversarial attack on a fixed", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 604, + 470, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 129, + 617 + ], + "score": 1.0, + "content": "input", + "type": "text" + }, + { + "bbox": [ + 130, + 605, + 157, + 615 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 604, + 178, + 617 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 179, + 605, + 230, + 617 + ], + "score": 0.92, + "content": "h _ { s } ( x ) = + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 604, + 470, + 617 + ], + "score": 1.0, + "content": "could be successful, we can solve the optimization problem", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 560, + 506, + 617 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 621, + 374, + 641 + ], + "lines": [ + { + "bbox": [ + 236, + 621, + 374, + 641 + ], + "spans": [ + { + "bbox": [ + 236, + 621, + 374, + 641 + ], + "score": 0.94, + "content": "\\operatorname* { m i n } _ { \\| \\boldsymbol { x ^ { \\prime } } - \\boldsymbol { x } \\| \\le \\epsilon { \\boldsymbol X ^ { \\prime } } \\sim \\mu ( \\boldsymbol { x ^ { \\prime } } ) } [ h ( \\boldsymbol { X ^ { \\prime } } ) = + 1 ] ,", + "type": "interline_equation", + "image_path": "488b1e3ac23c10ba3be97a0376ce5ef0c389de876510b99f1269c2115dfd78f1.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 236, + 621, + 374, + 641 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 505, + 704 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 506, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 351, + 663 + ], + "score": 1.0, + "content": "and check whether the minimum value can be smaller than", + "type": "text" + }, + { + "bbox": [ + 351, + 648, + 358, + 662 + ], + "score": 0.83, + "content": "\\frac { 1 } { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 647, + 506, + 663 + ], + "score": 1.0, + "content": ". This is a non-convex optimization", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 673 + ], + "score": 1.0, + "content": "problem for which we may not even be able to compute gradients since we only have black-box access", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 117, + 684 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 671, + 124, + 681 + ], + "score": 0.79, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 124, + 670, + 505, + 684 + ], + "score": 1.0, + "content": ". While techniques have been developed to address this problem, obtaining provable guarantees", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 681, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 505, + 694 + ], + "score": 1.0, + "content": "on whether these algorithms actually find the worst-case adversarial perturbation is difficult since we", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 693, + 283, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 273, + 704 + ], + "score": 1.0, + "content": "do not know anything about the nature of", + "type": "text" + }, + { + "bbox": [ + 274, + 694, + 280, + 703 + ], + "score": 0.85, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 693, + 283, + 704 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 647, + 506, + 704 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Motivated by this difficulty, we take a different approach: Rather than studying the adversarial attack", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 178, + 733 + ], + "score": 1.0, + "content": "in the input space", + "type": "text" + }, + { + "bbox": [ + 178, + 721, + 188, + 730 + ], + "score": 0.8, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 720, + 478, + 733 + ], + "score": 1.0, + "content": ", we study it in the space of probability measures over inputs, denoted by", + "type": "text" + }, + { + "bbox": [ + 478, + 721, + 502, + 732 + ], + "score": 0.92, + "content": "\\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 720, + 506, + 733 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 709, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 283, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 284, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 284, + 96 + ], + "score": 1.0, + "content": "Formally, this amounts to rewriting Eq. 2 as", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 223, + 98, + 387, + 118 + ], + "lines": [ + { + "bbox": [ + 223, + 98, + 387, + 118 + ], + "spans": [ + { + "bbox": [ + 223, + 98, + 387, + 118 + ], + "score": 0.92, + "content": "\\operatorname* { m i n } _ { \\nu \\in \\{ \\mu ( x ^ { \\prime } ) \\colon \\| x ^ { \\prime } - x \\| \\leq \\epsilon \\} } \\operatorname* { l p } _ { X ^ { \\prime } \\sim \\nu } [ h ( X ^ { \\prime } ) = + 1 ] .", + "type": "interline_equation", + "image_path": "406031201bef6a18ca0d598138c006751f745df1e6b0807723299cd2dc109d75.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 223, + 98, + 387, + 118 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 505, + 190 + ], + "lines": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 462, + 136 + ], + "score": 1.0, + "content": "This is an infinite dimensional optimization problem over the space of probability measures", + "type": "text" + }, + { + "bbox": [ + 462, + 123, + 505, + 136 + ], + "score": 0.92, + "content": "\\nu \\in { \\mathcal { P } } ( { \\mathcal { X } } )", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 134, + 506, + 147 + ], + "spans": [ + { + "bbox": [ + 106, + 134, + 208, + 147 + ], + "score": 1.0, + "content": "subject to the constraint", + "type": "text" + }, + { + "bbox": [ + 209, + 135, + 353, + 147 + ], + "score": 0.92, + "content": "\\nu \\in \\mathcal { D } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 134, + 506, + 147 + ], + "score": 1.0, + "content": ". While this set is still intractable to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 145, + 506, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 479, + 158 + ], + "score": 1.0, + "content": "deal with, we can consider relaxations of this set defined by divergence constraints between", + "type": "text" + }, + { + "bbox": [ + 480, + 147, + 487, + 155 + ], + "score": 0.74, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 145, + 506, + 158 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 107, + 155, + 506, + 169 + ], + "spans": [ + { + "bbox": [ + 107, + 156, + 147, + 168 + ], + "score": 0.92, + "content": "\\rho = \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 155, + 169, + 169 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 169, + 156, + 276, + 168 + ], + "score": 0.91, + "content": "\\mathcal { D } \\subseteq \\{ \\nu : D ( \\nu \\| \\rho ) \\leq \\epsilon _ { D } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 155, + 305, + 169 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 305, + 157, + 315, + 167 + ], + "score": 0.8, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 155, + 506, + 169 + ], + "score": 1.0, + "content": "denotes some divergence between probability", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 165, + 506, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 181 + ], + "score": 1.0, + "content": "distributions. We will show in Section 3 that for several commonly used divergences (in fact, for any", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 178, + 444, + 191 + ], + "spans": [ + { + "bbox": [ + 107, + 179, + 114, + 190 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 178, + 444, + 191 + ], + "score": 1.0, + "content": "-divergence; cf. Ali & Silvey, 1966), the relaxed problem can be solved efficiently.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4.5 + }, + { + "type": "title", + "bbox": [ + 107, + 203, + 386, + 214 + ], + "lines": [ + { + "bbox": [ + 106, + 203, + 387, + 215 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 387, + 215 + ], + "score": 1.0, + "content": "2.1 A GENERAL FRAMEWORK FOR ROBUSTNESS CERTIFICATION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 505, + 291 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 393, + 236 + ], + "score": 1.0, + "content": "To formulate the general verification problem, consider a specification", + "type": "text" + }, + { + "bbox": [ + 393, + 224, + 461, + 235 + ], + "score": 0.91, + "content": "\\phi : \\mathcal { X } \\to \\mathcal { Z } \\subseteq \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 223, + 505, + 236 + ], + "score": 1.0, + "content": ": a generic", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 235, + 505, + 247 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 505, + 247 + ], + "score": 1.0, + "content": "function over the input space (that typically is a function of the classifier output) that we want to verify", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 245, + 504, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 399, + 258 + ], + "score": 1.0, + "content": "has certain properties. Unless otherwise specified, we will assume that", + "type": "text" + }, + { + "bbox": [ + 400, + 245, + 436, + 257 + ], + "score": 0.94, + "content": "\\mathcal { \\hat { X } } \\subseteq \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 245, + 497, + 258 + ], + "score": 1.0, + "content": "(we work in a", + "type": "text" + }, + { + "bbox": [ + 497, + 246, + 504, + 255 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 256, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 408, + 269 + ], + "score": 1.0, + "content": "dimensional input space). Our framework also involves a reference measure", + "type": "text" + }, + { + "bbox": [ + 408, + 259, + 415, + 268 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 256, + 505, + 269 + ], + "score": 1.0, + "content": "(in the above example", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 168, + 280 + ], + "score": 1.0, + "content": "we would take", + "type": "text" + }, + { + "bbox": [ + 168, + 268, + 210, + 279 + ], + "score": 0.9, + "content": "\\rho = \\mu ( x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 267, + 387, + 280 + ], + "score": 1.0, + "content": "and a collection of perturbed distributions", + "type": "text" + }, + { + "bbox": [ + 387, + 268, + 396, + 277 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "(in the above example we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 278, + 308, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 152, + 291 + ], + "score": 1.0, + "content": "would take", + "type": "text" + }, + { + "bbox": [ + 153, + 278, + 302, + 291 + ], + "score": 0.9, + "content": "\\mathcal { D } = \\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\le \\bar { \\epsilon } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 278, + 308, + 291 + ], + "score": 1.0, + "content": ").", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 295, + 504, + 318 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 254, + 309 + ], + "score": 1.0, + "content": "Verifying that a given specification", + "type": "text" + }, + { + "bbox": [ + 255, + 296, + 262, + 307 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 294, + 505, + 309 + ], + "score": 1.0, + "content": "is robustly certified is equivalent to checking whether the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 307, + 277, + 319 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 277, + 319 + ], + "score": 1.0, + "content": "optimal value of the optimization problem", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 322, + 378, + 341 + ], + "lines": [ + { + "bbox": [ + 232, + 322, + 378, + 341 + ], + "spans": [ + { + "bbox": [ + 232, + 322, + 378, + 341 + ], + "score": 0.93, + "content": "{ \\mathrm { O P T } } ( \\phi , \\rho , { \\mathcal { D } } ) : = \\operatorname* { m i n } _ { \\nu \\in { \\mathcal { D } } } \\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\ ,", + "type": "interline_equation", + "image_path": "35fc9d3f11482f78fa99ee5d084323f2aec2d43ac4feba6a89099cfae2a7e1a3.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 232, + 322, + 378, + 341 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 345, + 505, + 367 + ], + "lines": [ + { + "bbox": [ + 106, + 345, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 345, + 505, + 357 + ], + "score": 1.0, + "content": "is non-negative. Solving problems of this form is the key workhorse of our general framework for", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 356, + 399, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 356, + 399, + 367 + ], + "score": 1.0, + "content": "black-box certification of adversarial robustness for smoothed classifiers.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 107, + 372, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 373, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 106, + 373, + 505, + 385 + ], + "score": 1.0, + "content": "Using these ingredients we introduce two closely related certification problems: information-limited", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "robust certification and full-information robust certification. In the former case, we assume that we", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 233, + 408 + ], + "score": 1.0, + "content": "are given only given access to", + "type": "text" + }, + { + "bbox": [ + 233, + 395, + 395, + 407 + ], + "score": 0.65, + "content": "\\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] , \\mathbb { P } _ { X \\sim \\nu } [ \\phi ( X ) = + 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 395, + 506, + 408 + ], + "score": 1.0, + "content": ". In the latter case, we are", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 406, + 356, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 239, + 418 + ], + "score": 1.0, + "content": "given full-access to specification", + "type": "text" + }, + { + "bbox": [ + 239, + 407, + 246, + 417 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 406, + 356, + 418 + ], + "score": 1.0, + "content": ". The definitions are below.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 506, + 454 + ], + "lines": [ + { + "bbox": [ + 105, + 419, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 459, + 434 + ], + "score": 1.0, + "content": "Definition 2.1 (Information-limited robust certification). Given reference distribution", + "type": "text" + }, + { + "bbox": [ + 459, + 420, + 502, + 433 + ], + "score": 0.92, + "content": "\\rho \\in { \\mathcal { P } } ( { \\mathcal { X } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 419, + 506, + 434 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 160, + 444 + ], + "score": 1.0, + "content": "probabilities", + "type": "text" + }, + { + "bbox": [ + 160, + 432, + 184, + 443 + ], + "score": 0.92, + "content": "\\theta _ { a } , \\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 431, + 234, + 444 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + }, + { + "bbox": [ + 234, + 432, + 334, + 443 + ], + "score": 0.92, + "content": "\\theta _ { a } , \\theta _ { b } \\geq 0 , \\theta _ { a } + \\theta _ { b } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 431, + 506, + 444 + ], + "score": 1.0, + "content": "and collection of perturbed distributions", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 442, + 361, + 456 + ], + "spans": [ + { + "bbox": [ + 107, + 442, + 153, + 455 + ], + "score": 0.92, + "content": "\\mathcal { D } \\subset \\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 442, + 199, + 456 + ], + "score": 1.0, + "content": "containing", + "type": "text" + }, + { + "bbox": [ + 199, + 445, + 205, + 454 + ], + "score": 0.77, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 442, + 340, + 456 + ], + "score": 1.0, + "content": ", define the class of specifications", + "type": "text" + }, + { + "bbox": [ + 340, + 443, + 348, + 452 + ], + "score": 0.83, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 442, + 361, + 456 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "interline_equation", + "bbox": [ + 137, + 458, + 474, + 486 + ], + "lines": [ + { + "bbox": [ + 137, + 458, + 474, + 486 + ], + "spans": [ + { + "bbox": [ + 137, + 458, + 474, + 486 + ], + "score": 0.88, + "content": "S = \\left\\{ \\phi : \\mathcal { X } \\to \\{ - 1 , 0 , + 1 \\} \\mathrm { ~ s . t . ~ } \\operatorname { \\mathbb { P } } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] \\geq \\theta _ { a } , \\operatorname { \\mathbb { P } } _ { X \\sim \\rho } [ \\phi ( X ) = - 1 ] \\leq \\theta _ { b } \\right\\}", + "type": "interline_equation", + "image_path": "fa2b5ecc9101a201a2d31b04eca2bee40ec61351ed76c8f5010a8bdb06885eef.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 137, + 458, + 474, + 467.3333333333333 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 137, + 467.3333333333333, + 474, + 476.66666666666663 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 137, + 476.66666666666663, + 474, + 485.99999999999994 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 489, + 504, + 513 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 153, + 502 + ], + "score": 1.0, + "content": "We say that", + "type": "text" + }, + { + "bbox": [ + 153, + 490, + 161, + 500 + ], + "score": 0.84, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 488, + 326, + 502 + ], + "score": 1.0, + "content": "is information-limited robustly certified at", + "type": "text" + }, + { + "bbox": [ + 327, + 492, + 333, + 501 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 488, + 393, + 502 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 393, + 490, + 403, + 500 + ], + "score": 0.83, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 488, + 505, + 502 + ], + "score": 1.0, + "content": "if the following condition", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 500, + 295, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 134, + 513 + ], + "score": 1.0, + "content": "holds:", + "type": "text" + }, + { + "bbox": [ + 134, + 501, + 207, + 513 + ], + "score": 0.93, + "content": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 500, + 235, + 513 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 235, + 501, + 290, + 512 + ], + "score": 0.92, + "content": "\\nu \\in \\mathcal { D } , \\phi \\in S", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 500, + 295, + 513 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 577 + ], + "lines": [ + { + "bbox": [ + 105, + 520, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 247, + 533 + ], + "score": 1.0, + "content": "Note since we don’t have access to", + "type": "text" + }, + { + "bbox": [ + 247, + 522, + 254, + 532 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 520, + 346, + 533 + ], + "score": 1.0, + "content": ", we need to prove that", + "type": "text" + }, + { + "bbox": [ + 346, + 521, + 460, + 533 + ], + "score": 0.89, + "content": "{ \\mathrm { E } } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0 \\quad \\forall \\nu \\in { \\mathcal { D } }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 520, + 505, + 533 + ], + "score": 1.0, + "content": "is satisfied", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 213, + 545 + ], + "score": 1.0, + "content": "for all specifications in set", + "type": "text" + }, + { + "bbox": [ + 213, + 533, + 221, + 542 + ], + "score": 0.78, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 531, + 505, + 545 + ], + "score": 1.0, + "content": ". Although the information-limited case may seem challenging because", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 542, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 505, + 556 + ], + "score": 1.0, + "content": "we need to provide guarantees that hold simultaneously over a whole class of specifications, it turns", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 227, + 567 + ], + "score": 1.0, + "content": "out that, for perturbation sets", + "type": "text" + }, + { + "bbox": [ + 227, + 555, + 237, + 564 + ], + "score": 0.8, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 554, + 302, + 567 + ], + "score": 1.0, + "content": "specified by an", + "type": "text" + }, + { + "bbox": [ + 302, + 555, + 309, + 565 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 554, + 505, + 567 + ], + "score": 1.0, + "content": "-divergence bound, this certification task can be", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 565, + 287, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 287, + 577 + ], + "score": 1.0, + "content": "solved efficiently using convex optimization.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 579, + 505, + 624 + ], + "lines": [ + { + "bbox": [ + 105, + 578, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 451, + 592 + ], + "score": 1.0, + "content": "Definition 2.2 (Full-information robust certification). Given a reference distribution", + "type": "text" + }, + { + "bbox": [ + 452, + 579, + 494, + 591 + ], + "score": 0.93, + "content": "\\rho \\in { \\mathcal { P } } ( { \\mathcal { X } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 578, + 506, + 592 + ], + "score": 1.0, + "content": ", a", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 588, + 507, + 605 + ], + "spans": [ + { + "bbox": [ + 104, + 588, + 160, + 605 + ], + "score": 1.0, + "content": "specification", + "type": "text" + }, + { + "bbox": [ + 161, + 591, + 228, + 601 + ], + "score": 0.92, + "content": "\\phi : \\mathcal { X } \\to \\mathcal { Z } \\subseteq \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 588, + 403, + 605 + ], + "score": 1.0, + "content": "and a collection of perturbed distributions", + "type": "text" + }, + { + "bbox": [ + 403, + 591, + 450, + 603 + ], + "score": 0.92, + "content": "\\mathcal { D } \\subset \\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 588, + 496, + 605 + ], + "score": 1.0, + "content": "containing", + "type": "text" + }, + { + "bbox": [ + 496, + 593, + 502, + 602 + ], + "score": 0.76, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 588, + 507, + 605 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 601, + 504, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 154, + 613 + ], + "score": 1.0, + "content": "we say that", + "type": "text" + }, + { + "bbox": [ + 154, + 602, + 161, + 613 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 601, + 319, + 613 + ], + "score": 1.0, + "content": "is full-information robustly certified at", + "type": "text" + }, + { + "bbox": [ + 319, + 603, + 326, + 613 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 601, + 389, + 613 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 389, + 602, + 398, + 611 + ], + "score": 0.83, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 601, + 504, + 613 + ], + "score": 1.0, + "content": "if the following condition", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 612, + 266, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 134, + 625 + ], + "score": 1.0, + "content": "holds:", + "type": "text" + }, + { + "bbox": [ + 134, + 613, + 207, + 624 + ], + "score": 0.93, + "content": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 612, + 234, + 625 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 235, + 613, + 261, + 623 + ], + "score": 0.9, + "content": "\\nu \\in \\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 612, + 266, + 625 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 106, + 632, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 460, + 646 + ], + "score": 1.0, + "content": "Most often we are dealing with the case where we have full access to the specification", + "type": "text" + }, + { + "bbox": [ + 460, + 633, + 467, + 644 + ], + "score": 0.83, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 632, + 506, + 646 + ], + "score": 1.0, + "content": ", thus we", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "should be able to certify using full-information robust certification. However, prior works, Cohen", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "et al. (2019) and Lecuyer et al. (2019), have only provided solutions to certify with respect to the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 412, + 678 + ], + "score": 1.0, + "content": "information-limited case where we cannot use all of the information about", + "type": "text" + }, + { + "bbox": [ + 413, + 666, + 420, + 677 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 666, + 506, + 678 + ], + "score": 1.0, + "content": ". The framework we", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "develop is a more general method that can be used in both information-limited and full-information", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "scenarios. We will demonstrate that our framework recovers certificates provided by Cohen et al.", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 104, + 697, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 104, + 697, + 506, + 713 + ], + "score": 1.0, + "content": "(2019), Li et al. (2019) and dominates Lecuyer et al. (2019) in the information-limited setting", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 423, + 723 + ], + "score": 1.0, + "content": "(see section 5). Further, it can utilize full-information about the specification", + "type": "text" + }, + { + "bbox": [ + 423, + 710, + 430, + 721 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "to provide tighter", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 721, + 364, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 364, + 732 + ], + "score": 1.0, + "content": "certificates for smoothed probabilistic classifiers (see section 6).", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 45 + } + ], + "page_idx": 2, + "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 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": "text", + "bbox": [ + 107, + 82, + 283, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 284, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 284, + 96 + ], + "score": 1.0, + "content": "Formally, this amounts to rewriting Eq. 2 as", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 81, + 284, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 223, + 98, + 387, + 118 + ], + "lines": [ + { + "bbox": [ + 223, + 98, + 387, + 118 + ], + "spans": [ + { + "bbox": [ + 223, + 98, + 387, + 118 + ], + "score": 0.92, + "content": "\\operatorname* { m i n } _ { \\nu \\in \\{ \\mu ( x ^ { \\prime } ) \\colon \\| x ^ { \\prime } - x \\| \\leq \\epsilon \\} } \\operatorname* { l p } _ { X ^ { \\prime } \\sim \\nu } [ h ( X ^ { \\prime } ) = + 1 ] .", + "type": "interline_equation", + "image_path": "406031201bef6a18ca0d598138c006751f745df1e6b0807723299cd2dc109d75.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 223, + 98, + 387, + 118 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 505, + 190 + ], + "lines": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 462, + 136 + ], + "score": 1.0, + "content": "This is an infinite dimensional optimization problem over the space of probability measures", + "type": "text" + }, + { + "bbox": [ + 462, + 123, + 505, + 136 + ], + "score": 0.92, + "content": "\\nu \\in { \\mathcal { P } } ( { \\mathcal { X } } )", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 134, + 506, + 147 + ], + "spans": [ + { + "bbox": [ + 106, + 134, + 208, + 147 + ], + "score": 1.0, + "content": "subject to the constraint", + "type": "text" + }, + { + "bbox": [ + 209, + 135, + 353, + 147 + ], + "score": 0.92, + "content": "\\nu \\in \\mathcal { D } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 134, + 506, + 147 + ], + "score": 1.0, + "content": ". While this set is still intractable to", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 145, + 506, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 479, + 158 + ], + "score": 1.0, + "content": "deal with, we can consider relaxations of this set defined by divergence constraints between", + "type": "text" + }, + { + "bbox": [ + 480, + 147, + 487, + 155 + ], + "score": 0.74, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 145, + 506, + 158 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 107, + 155, + 506, + 169 + ], + "spans": [ + { + "bbox": [ + 107, + 156, + 147, + 168 + ], + "score": 0.92, + "content": "\\rho = \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 155, + 169, + 169 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 169, + 156, + 276, + 168 + ], + "score": 0.91, + "content": "\\mathcal { D } \\subseteq \\{ \\nu : D ( \\nu \\| \\rho ) \\leq \\epsilon _ { D } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 155, + 305, + 169 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 305, + 157, + 315, + 167 + ], + "score": 0.8, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 155, + 506, + 169 + ], + "score": 1.0, + "content": "denotes some divergence between probability", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 165, + 506, + 181 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 181 + ], + "score": 1.0, + "content": "distributions. We will show in Section 3 that for several commonly used divergences (in fact, for any", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 178, + 444, + 191 + ], + "spans": [ + { + "bbox": [ + 107, + 179, + 114, + 190 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 178, + 444, + 191 + ], + "score": 1.0, + "content": "-divergence; cf. Ali & Silvey, 1966), the relaxed problem can be solved efficiently.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 123, + 506, + 191 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 203, + 386, + 214 + ], + "lines": [ + { + "bbox": [ + 106, + 203, + 387, + 215 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 387, + 215 + ], + "score": 1.0, + "content": "2.1 A GENERAL FRAMEWORK FOR ROBUSTNESS CERTIFICATION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 223, + 505, + 291 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 393, + 236 + ], + "score": 1.0, + "content": "To formulate the general verification problem, consider a specification", + "type": "text" + }, + { + "bbox": [ + 393, + 224, + 461, + 235 + ], + "score": 0.91, + "content": "\\phi : \\mathcal { X } \\to \\mathcal { Z } \\subseteq \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 223, + 505, + 236 + ], + "score": 1.0, + "content": ": a generic", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 235, + 505, + 247 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 505, + 247 + ], + "score": 1.0, + "content": "function over the input space (that typically is a function of the classifier output) that we want to verify", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 245, + 504, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 399, + 258 + ], + "score": 1.0, + "content": "has certain properties. Unless otherwise specified, we will assume that", + "type": "text" + }, + { + "bbox": [ + 400, + 245, + 436, + 257 + ], + "score": 0.94, + "content": "\\mathcal { \\hat { X } } \\subseteq \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 245, + 497, + 258 + ], + "score": 1.0, + "content": "(we work in a", + "type": "text" + }, + { + "bbox": [ + 497, + 246, + 504, + 255 + ], + "score": 0.78, + "content": "d", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 256, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 408, + 269 + ], + "score": 1.0, + "content": "dimensional input space). Our framework also involves a reference measure", + "type": "text" + }, + { + "bbox": [ + 408, + 259, + 415, + 268 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 256, + 505, + 269 + ], + "score": 1.0, + "content": "(in the above example", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 168, + 280 + ], + "score": 1.0, + "content": "we would take", + "type": "text" + }, + { + "bbox": [ + 168, + 268, + 210, + 279 + ], + "score": 0.9, + "content": "\\rho = \\mu ( x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 267, + 387, + 280 + ], + "score": 1.0, + "content": "and a collection of perturbed distributions", + "type": "text" + }, + { + "bbox": [ + 387, + 268, + 396, + 277 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "(in the above example we", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 278, + 308, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 152, + 291 + ], + "score": 1.0, + "content": "would take", + "type": "text" + }, + { + "bbox": [ + 153, + 278, + 302, + 291 + ], + "score": 0.9, + "content": "\\mathcal { D } = \\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\le \\bar { \\epsilon } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 278, + 308, + 291 + ], + "score": 1.0, + "content": ").", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 223, + 505, + 291 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 295, + 504, + 318 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 254, + 309 + ], + "score": 1.0, + "content": "Verifying that a given specification", + "type": "text" + }, + { + "bbox": [ + 255, + 296, + 262, + 307 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 294, + 505, + 309 + ], + "score": 1.0, + "content": "is robustly certified is equivalent to checking whether the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 307, + 277, + 319 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 277, + 319 + ], + "score": 1.0, + "content": "optimal value of the optimization problem", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 106, + 294, + 505, + 319 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 322, + 378, + 341 + ], + "lines": [ + { + "bbox": [ + 232, + 322, + 378, + 341 + ], + "spans": [ + { + "bbox": [ + 232, + 322, + 378, + 341 + ], + "score": 0.93, + "content": "{ \\mathrm { O P T } } ( \\phi , \\rho , { \\mathcal { D } } ) : = \\operatorname* { m i n } _ { \\nu \\in { \\mathcal { D } } } \\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\ ,", + "type": "interline_equation", + "image_path": "35fc9d3f11482f78fa99ee5d084323f2aec2d43ac4feba6a89099cfae2a7e1a3.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 232, + 322, + 378, + 341 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 345, + 505, + 367 + ], + "lines": [ + { + "bbox": [ + 106, + 345, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 345, + 505, + 357 + ], + "score": 1.0, + "content": "is non-negative. Solving problems of this form is the key workhorse of our general framework for", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 356, + 399, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 356, + 399, + 367 + ], + "score": 1.0, + "content": "black-box certification of adversarial robustness for smoothed classifiers.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 106, + 345, + 505, + 367 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 372, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 373, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 106, + 373, + 505, + 385 + ], + "score": 1.0, + "content": "Using these ingredients we introduce two closely related certification problems: information-limited", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "robust certification and full-information robust certification. In the former case, we assume that we", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 233, + 408 + ], + "score": 1.0, + "content": "are given only given access to", + "type": "text" + }, + { + "bbox": [ + 233, + 395, + 395, + 407 + ], + "score": 0.65, + "content": "\\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] , \\mathbb { P } _ { X \\sim \\nu } [ \\phi ( X ) = + 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 395, + 506, + 408 + ], + "score": 1.0, + "content": ". In the latter case, we are", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 406, + 356, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 239, + 418 + ], + "score": 1.0, + "content": "given full-access to specification", + "type": "text" + }, + { + "bbox": [ + 239, + 407, + 246, + 417 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 406, + 356, + 418 + ], + "score": 1.0, + "content": ". The definitions are below.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 373, + 506, + 418 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 506, + 454 + ], + "lines": [ + { + "bbox": [ + 105, + 419, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 459, + 434 + ], + "score": 1.0, + "content": "Definition 2.1 (Information-limited robust certification). Given reference distribution", + "type": "text" + }, + { + "bbox": [ + 459, + 420, + 502, + 433 + ], + "score": 0.92, + "content": "\\rho \\in { \\mathcal { P } } ( { \\mathcal { X } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 419, + 506, + 434 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 431, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 160, + 444 + ], + "score": 1.0, + "content": "probabilities", + "type": "text" + }, + { + "bbox": [ + 160, + 432, + 184, + 443 + ], + "score": 0.92, + "content": "\\theta _ { a } , \\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 431, + 234, + 444 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + }, + { + "bbox": [ + 234, + 432, + 334, + 443 + ], + "score": 0.92, + "content": "\\theta _ { a } , \\theta _ { b } \\geq 0 , \\theta _ { a } + \\theta _ { b } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 431, + 506, + 444 + ], + "score": 1.0, + "content": "and collection of perturbed distributions", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 442, + 361, + 456 + ], + "spans": [ + { + "bbox": [ + 107, + 442, + 153, + 455 + ], + "score": 0.92, + "content": "\\mathcal { D } \\subset \\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 442, + 199, + 456 + ], + "score": 1.0, + "content": "containing", + "type": "text" + }, + { + "bbox": [ + 199, + 445, + 205, + 454 + ], + "score": 0.77, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 442, + 340, + 456 + ], + "score": 1.0, + "content": ", define the class of specifications", + "type": "text" + }, + { + "bbox": [ + 340, + 443, + 348, + 452 + ], + "score": 0.83, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 442, + 361, + 456 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 419, + 506, + 456 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 137, + 458, + 474, + 486 + ], + "lines": [ + { + "bbox": [ + 137, + 458, + 474, + 486 + ], + "spans": [ + { + "bbox": [ + 137, + 458, + 474, + 486 + ], + "score": 0.88, + "content": "S = \\left\\{ \\phi : \\mathcal { X } \\to \\{ - 1 , 0 , + 1 \\} \\mathrm { ~ s . t . ~ } \\operatorname { \\mathbb { P } } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] \\geq \\theta _ { a } , \\operatorname { \\mathbb { P } } _ { X \\sim \\rho } [ \\phi ( X ) = - 1 ] \\leq \\theta _ { b } \\right\\}", + "type": "interline_equation", + "image_path": "fa2b5ecc9101a201a2d31b04eca2bee40ec61351ed76c8f5010a8bdb06885eef.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 137, + 458, + 474, + 467.3333333333333 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 137, + 467.3333333333333, + 474, + 476.66666666666663 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 137, + 476.66666666666663, + 474, + 485.99999999999994 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 489, + 504, + 513 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 153, + 502 + ], + "score": 1.0, + "content": "We say that", + "type": "text" + }, + { + "bbox": [ + 153, + 490, + 161, + 500 + ], + "score": 0.84, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 488, + 326, + 502 + ], + "score": 1.0, + "content": "is information-limited robustly certified at", + "type": "text" + }, + { + "bbox": [ + 327, + 492, + 333, + 501 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 488, + 393, + 502 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 393, + 490, + 403, + 500 + ], + "score": 0.83, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 488, + 505, + 502 + ], + "score": 1.0, + "content": "if the following condition", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 500, + 295, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 134, + 513 + ], + "score": 1.0, + "content": "holds:", + "type": "text" + }, + { + "bbox": [ + 134, + 501, + 207, + 513 + ], + "score": 0.93, + "content": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 500, + 235, + 513 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 235, + 501, + 290, + 512 + ], + "score": 0.92, + "content": "\\nu \\in \\mathcal { D } , \\phi \\in S", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 500, + 295, + 513 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 488, + 505, + 513 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 577 + ], + "lines": [ + { + "bbox": [ + 105, + 520, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 247, + 533 + ], + "score": 1.0, + "content": "Note since we don’t have access to", + "type": "text" + }, + { + "bbox": [ + 247, + 522, + 254, + 532 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 520, + 346, + 533 + ], + "score": 1.0, + "content": ", we need to prove that", + "type": "text" + }, + { + "bbox": [ + 346, + 521, + 460, + 533 + ], + "score": 0.89, + "content": "{ \\mathrm { E } } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0 \\quad \\forall \\nu \\in { \\mathcal { D } }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 520, + 505, + 533 + ], + "score": 1.0, + "content": "is satisfied", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 213, + 545 + ], + "score": 1.0, + "content": "for all specifications in set", + "type": "text" + }, + { + "bbox": [ + 213, + 533, + 221, + 542 + ], + "score": 0.78, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 531, + 505, + 545 + ], + "score": 1.0, + "content": ". Although the information-limited case may seem challenging because", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 542, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 505, + 556 + ], + "score": 1.0, + "content": "we need to provide guarantees that hold simultaneously over a whole class of specifications, it turns", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 227, + 567 + ], + "score": 1.0, + "content": "out that, for perturbation sets", + "type": "text" + }, + { + "bbox": [ + 227, + 555, + 237, + 564 + ], + "score": 0.8, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 554, + 302, + 567 + ], + "score": 1.0, + "content": "specified by an", + "type": "text" + }, + { + "bbox": [ + 302, + 555, + 309, + 565 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 554, + 505, + 567 + ], + "score": 1.0, + "content": "-divergence bound, this certification task can be", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 565, + 287, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 287, + 577 + ], + "score": 1.0, + "content": "solved efficiently using convex optimization.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 520, + 505, + 577 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 579, + 505, + 624 + ], + "lines": [ + { + "bbox": [ + 105, + 578, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 451, + 592 + ], + "score": 1.0, + "content": "Definition 2.2 (Full-information robust certification). Given a reference distribution", + "type": "text" + }, + { + "bbox": [ + 452, + 579, + 494, + 591 + ], + "score": 0.93, + "content": "\\rho \\in { \\mathcal { P } } ( { \\mathcal { X } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 578, + 506, + 592 + ], + "score": 1.0, + "content": ", a", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 104, + 588, + 507, + 605 + ], + "spans": [ + { + "bbox": [ + 104, + 588, + 160, + 605 + ], + "score": 1.0, + "content": "specification", + "type": "text" + }, + { + "bbox": [ + 161, + 591, + 228, + 601 + ], + "score": 0.92, + "content": "\\phi : \\mathcal { X } \\to \\mathcal { Z } \\subseteq \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 588, + 403, + 605 + ], + "score": 1.0, + "content": "and a collection of perturbed distributions", + "type": "text" + }, + { + "bbox": [ + 403, + 591, + 450, + 603 + ], + "score": 0.92, + "content": "\\mathcal { D } \\subset \\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 588, + 496, + 605 + ], + "score": 1.0, + "content": "containing", + "type": "text" + }, + { + "bbox": [ + 496, + 593, + 502, + 602 + ], + "score": 0.76, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 588, + 507, + 605 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 601, + 504, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 154, + 613 + ], + "score": 1.0, + "content": "we say that", + "type": "text" + }, + { + "bbox": [ + 154, + 602, + 161, + 613 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 601, + 319, + 613 + ], + "score": 1.0, + "content": "is full-information robustly certified at", + "type": "text" + }, + { + "bbox": [ + 319, + 603, + 326, + 613 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 601, + 389, + 613 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 389, + 602, + 398, + 611 + ], + "score": 0.83, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 601, + 504, + 613 + ], + "score": 1.0, + "content": "if the following condition", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 612, + 266, + 625 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 134, + 625 + ], + "score": 1.0, + "content": "holds:", + "type": "text" + }, + { + "bbox": [ + 134, + 613, + 207, + 624 + ], + "score": 0.93, + "content": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 612, + 234, + 625 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 235, + 613, + 261, + 623 + ], + "score": 0.9, + "content": "\\nu \\in \\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 612, + 266, + 625 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5, + "bbox_fs": [ + 104, + 578, + 507, + 625 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 632, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 632, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 460, + 646 + ], + "score": 1.0, + "content": "Most often we are dealing with the case where we have full access to the specification", + "type": "text" + }, + { + "bbox": [ + 460, + 633, + 467, + 644 + ], + "score": 0.83, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 632, + 506, + 646 + ], + "score": 1.0, + "content": ", thus we", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "should be able to certify using full-information robust certification. However, prior works, Cohen", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "et al. (2019) and Lecuyer et al. (2019), have only provided solutions to certify with respect to the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 412, + 678 + ], + "score": 1.0, + "content": "information-limited case where we cannot use all of the information about", + "type": "text" + }, + { + "bbox": [ + 413, + 666, + 420, + 677 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 666, + 506, + 678 + ], + "score": 1.0, + "content": ". The framework we", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "develop is a more general method that can be used in both information-limited and full-information", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "scenarios. We will demonstrate that our framework recovers certificates provided by Cohen et al.", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 104, + 697, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 104, + 697, + 506, + 713 + ], + "score": 1.0, + "content": "(2019), Li et al. (2019) and dominates Lecuyer et al. (2019) in the information-limited setting", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 423, + 723 + ], + "score": 1.0, + "content": "(see section 5). Further, it can utilize full-information about the specification", + "type": "text" + }, + { + "bbox": [ + 423, + 710, + 430, + 721 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "to provide tighter", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 721, + 364, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 364, + 732 + ], + "score": 1.0, + "content": "certificates for smoothed probabilistic classifiers (see section 6).", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 45, + "bbox_fs": [ + 104, + 632, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 101, + 505, + 168 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 505, + 113 + ], + "score": 1.0, + "content": "We first note that the definitions above are sufficient to capture the standard usage of randomized", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 112, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 112, + 505, + 125 + ], + "score": 1.0, + "content": "smoothing as it has been used in past work (e.g. Lecuyer et al., 2019; Cohen et al., 2019) to verify", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 123, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 506, + 136 + ], + "score": 1.0, + "content": "the robustness of smoothed multi-class classifiers. Specifically, consider smoothing a classifier", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 133, + 506, + 149 + ], + "spans": [ + { + "bbox": [ + 107, + 135, + 154, + 146 + ], + "score": 0.91, + "content": "h : \\mathcal { X } \\to \\mathcal { Y }", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 133, + 257, + 149 + ], + "score": 1.0, + "content": "with a finite set of labels", + "type": "text" + }, + { + "bbox": [ + 257, + 135, + 266, + 146 + ], + "score": 0.84, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 133, + 380, + 149 + ], + "score": 1.0, + "content": "using a smoothing measure", + "type": "text" + }, + { + "bbox": [ + 380, + 135, + 444, + 146 + ], + "score": 0.94, + "content": "\\mu : \\mathcal X \\mapsto \\mathcal P ( \\mathcal X )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 133, + 506, + 149 + ], + "score": 1.0, + "content": ". The resulting", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 146, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 146, + 223, + 158 + ], + "score": 1.0, + "content": "randomly smoothed classifier", + "type": "text" + }, + { + "bbox": [ + 224, + 146, + 235, + 156 + ], + "score": 0.89, + "content": "h _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 146, + 470, + 158 + ], + "score": 1.0, + "content": "is defined in Eq. 1. Our goal is to certify that the prediction", + "type": "text" + }, + { + "bbox": [ + 470, + 146, + 495, + 158 + ], + "score": 0.92, + "content": "h _ { s } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 146, + 505, + 158 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 156, + 488, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 259, + 170 + ], + "score": 1.0, + "content": "robust to perturbations of size at most", + "type": "text" + }, + { + "bbox": [ + 259, + 159, + 265, + 167 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 157, + 393, + 170 + ], + "score": 1.0, + "content": "measured by distance function1", + "type": "text" + }, + { + "bbox": [ + 394, + 156, + 467, + 168 + ], + "score": 0.89, + "content": "d : \\mathcal { X } \\times \\mathcal { X } \\mapsto \\mathbb { R } _ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 157, + 488, + 170 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5 + }, + { + "type": "interline_equation", + "bbox": [ + 211, + 171, + 397, + 186 + ], + "lines": [ + { + "bbox": [ + 211, + 171, + 397, + 186 + ], + "spans": [ + { + "bbox": [ + 211, + 171, + 397, + 186 + ], + "score": 0.86, + "content": "h _ { s } ( x ^ { \\prime } ) = h _ { s } ( x ) \\quad \\forall x ^ { \\prime } \\ \\mathrm { s u c h ~ t h a t } \\ d ( x , x ^ { \\prime } ) \\leq \\epsilon .", + "type": "interline_equation", + "image_path": "6d041ce45084b5b6fb732d7b7aad962753203e718f12289be9047943f9a87cc2.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 211, + 171, + 397, + 186 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 195, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 444, + 208 + ], + "score": 1.0, + "content": "To pose this question within our framework, we choose the reference distribution", + "type": "text" + }, + { + "bbox": [ + 444, + 195, + 485, + 208 + ], + "score": 0.92, + "content": "\\rho = \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 195, + 505, + 208 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 206, + 506, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 206, + 226, + 220 + ], + "score": 1.0, + "content": "set of perturbed distributions", + "type": "text" + }, + { + "bbox": [ + 226, + 207, + 349, + 219 + ], + "score": 0.92, + "content": "\\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : d ( x , x ^ { \\prime } ) \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 206, + 506, + 220 + ], + "score": 1.0, + "content": ", and the following specifications. Let", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 217, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 107, + 218, + 148, + 230 + ], + "score": 0.93, + "content": "c = h _ { s } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 217, + 194, + 230 + ], + "score": 1.0, + "content": ". For every", + "type": "text" + }, + { + "bbox": [ + 194, + 217, + 245, + 230 + ], + "score": 0.92, + "content": "c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 217, + 357, + 230 + ], + "score": 1.0, + "content": ", we define the specification", + "type": "text" + }, + { + "bbox": [ + 358, + 217, + 459, + 230 + ], + "score": 0.93, + "content": "\\phi _ { c , c ^ { \\prime } } : \\mathcal { X } \\mapsto \\{ - \\bar { 1 } , \\bar { 0 } , + 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 217, + 506, + 230 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 235, + 372, + 275 + ], + "lines": [ + { + "bbox": [ + 236, + 235, + 372, + 275 + ], + "spans": [ + { + "bbox": [ + 236, + 235, + 372, + 275 + ], + "score": 0.93, + "content": "\\phi _ { c , c ^ { \\prime } } ( x ) = \\left\\{ \\begin{array} { l l } { { + 1 } } & { { \\mathrm { ~ i f ~ } h ( x ) = c ~ , } } \\\\ { { - 1 } } & { { \\mathrm { ~ i f ~ } h ( x ) = c ^ { \\prime } ~ , } } \\\\ { { 0 } } & { { \\mathrm { ~ o t h e r w i s e ~ . } } } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "fe93ac917d79b02f57844b93d8fe67d8556ab29168ca91ebb86f6afb067adec4.jpg" + } + ] + } + ], + "index": 10.5, + "virtual_lines": [ + { + "bbox": [ + 236, + 235, + 372, + 255.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 236, + 255.0, + 372, + 275.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 280, + 504, + 303 + ], + "lines": [ + { + "bbox": [ + 104, + 277, + 504, + 295 + ], + "spans": [ + { + "bbox": [ + 104, + 277, + 258, + 295 + ], + "score": 1.0, + "content": "Then, Eq. 5 holds if and only if every", + "type": "text" + }, + { + "bbox": [ + 258, + 281, + 277, + 293 + ], + "score": 0.71, + "content": "\\phi _ { c , c ^ { \\prime } }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 277, + 281, + 295 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 282, + 280, + 308, + 293 + ], + "score": 0.5, + "content": "c ^ { \\prime } \\neq c", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 277, + 401, + 295 + ], + "score": 1.0, + "content": ", is robustly certified at", + "type": "text" + }, + { + "bbox": [ + 401, + 281, + 421, + 293 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 277, + 484, + 295 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 484, + 281, + 504, + 293 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 291, + 189, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 189, + 304 + ], + "score": 1.0, + "content": "(see Appendix A.1).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "title", + "bbox": [ + 107, + 316, + 311, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 316, + 311, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 311, + 329 + ], + "score": 1.0, + "content": "2.2 CONSTRAINT SETS FROM F-DIVERGENCES", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 336, + 506, + 392 + ], + "lines": [ + { + "bbox": [ + 106, + 336, + 506, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 187, + 350 + ], + "score": 1.0, + "content": "Dealing with the set", + "type": "text" + }, + { + "bbox": [ + 188, + 338, + 207, + 349 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 336, + 506, + 350 + ], + "score": 1.0, + "content": "directly is difficult due to its possibly non-convex geometry. In this section,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 347, + 506, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 356, + 361 + ], + "score": 1.0, + "content": "we discuss specific relaxations of this set, i.e., choices for sets", + "type": "text" + }, + { + "bbox": [ + 356, + 348, + 366, + 358 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 347, + 405, + 361 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 405, + 348, + 446, + 360 + ], + "score": 0.93, + "content": "\\mathcal { D } _ { x , \\epsilon } \\subseteq \\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 347, + 506, + 361 + ], + "score": 1.0, + "content": "that are easier", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 358, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 506, + 371 + ], + "score": 1.0, + "content": "to optimize over. In particular, we focus on a general family of constraint sets defined in terms of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 107, + 370, + 506, + 383 + ], + "spans": [ + { + "bbox": [ + 107, + 370, + 114, + 381 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 370, + 506, + 383 + ], + "score": 1.0, + "content": "-divergences. These divergences satisfy a number of useful properties and include many well-known", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 381, + 415, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 415, + 393 + ], + "score": 1.0, + "content": "instances (e.g. relative entropy, total variation); see Appendix A.2 for details.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 394, + 501, + 407 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 502, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 174, + 408 + ], + "score": 1.0, + "content": "Definition 2.3.", + "type": "text" + }, + { + "bbox": [ + 175, + 396, + 181, + 407 + ], + "score": 0.77, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 393, + 317, + 408 + ], + "score": 1.0, + "content": "-divergence constraint set). Given", + "type": "text" + }, + { + "bbox": [ + 318, + 395, + 370, + 407 + ], + "score": 0.93, + "content": "\\rho , \\nu \\in \\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 393, + 394, + 408 + ], + "score": 1.0, + "content": ", their", + "type": "text" + }, + { + "bbox": [ + 395, + 396, + 402, + 407 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 393, + 502, + 408 + ], + "score": 1.0, + "content": "-divergence is defined as", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 239, + 410, + 371, + 439 + ], + "lines": [ + { + "bbox": [ + 239, + 410, + 371, + 439 + ], + "spans": [ + { + "bbox": [ + 239, + 410, + 371, + 439 + ], + "score": 0.94, + "content": "D _ { f } ( \\nu \\| \\rho ) = \\underset { X \\sim \\rho } { \\mathrm { E } } \\Bigg [ f \\Bigg ( \\frac { \\nu ( X ) } { \\rho ( X ) } \\Bigg ) \\Bigg ] ~ ,", + "type": "interline_equation", + "image_path": "7f706cb311365f08edf41f889402305ab852238209c17f47c7d7e33c3bcc14b0.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 239, + 410, + 371, + 424.5 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 239, + 424.5, + 371, + 439.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 442, + 503, + 465 + ], + "lines": [ + { + "bbox": [ + 105, + 440, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 134, + 456 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 442, + 194, + 454 + ], + "score": 0.92, + "content": "f : \\mathbb { R } _ { + } \\mapsto \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 440, + 305, + 456 + ], + "score": 1.0, + "content": "is a convex function with", + "type": "text" + }, + { + "bbox": [ + 306, + 442, + 347, + 454 + ], + "score": 0.92, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 440, + 482, + 456 + ], + "score": 1.0, + "content": ". Given a reference distribution", + "type": "text" + }, + { + "bbox": [ + 482, + 445, + 488, + 454 + ], + "score": 0.78, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 440, + 505, + 456 + ], + "score": 1.0, + "content": ", an", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 107, + 453, + 452, + 466 + ], + "spans": [ + { + "bbox": [ + 107, + 454, + 114, + 465 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 453, + 161, + 466 + ], + "score": 1.0, + "content": "-divergence", + "type": "text" + }, + { + "bbox": [ + 162, + 454, + 176, + 466 + ], + "score": 0.9, + "content": "D _ { f }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 453, + 228, + 466 + ], + "score": 1.0, + "content": "and a bound", + "type": "text" + }, + { + "bbox": [ + 228, + 454, + 257, + 466 + ], + "score": 0.92, + "content": "\\epsilon _ { f } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 453, + 316, + 466 + ], + "score": 1.0, + "content": ", we define the", + "type": "text" + }, + { + "bbox": [ + 317, + 454, + 324, + 465 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 453, + 452, + 466 + ], + "score": 1.0, + "content": "-divergence constraint set to be:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 469, + 383, + 483 + ], + "lines": [ + { + "bbox": [ + 227, + 469, + 383, + 483 + ], + "spans": [ + { + "bbox": [ + 227, + 469, + 383, + 483 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { f } = \\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { f } ( \\nu \\| \\rho ) \\leq \\epsilon _ { f } \\} \\ .", + "type": "interline_equation", + "image_path": "7bc8b829094e9328942d7d0933e99f3451dc314e5751265217f87799f89e2202.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 227, + 469, + 383, + 483 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 506, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 397, + 505 + ], + "score": 1.0, + "content": "Technically, this definition depends on the Radon-Nikodym derivative of", + "type": "text" + }, + { + "bbox": [ + 397, + 495, + 404, + 502 + ], + "score": 0.76, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 491, + 466, + 505 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 466, + 495, + 472, + 504 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 491, + 506, + 505 + ], + "score": 1.0, + "content": ", but we", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 503, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 506, + 515 + ], + "score": 1.0, + "content": "ignore measure-theoretic issues in this paper for simplicity of exposition. For continuous distributions,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 514, + 498, + 527 + ], + "spans": [ + { + "bbox": [ + 107, + 516, + 113, + 524 + ], + "score": 0.71, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 514, + 131, + 527 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 131, + 516, + 138, + 525 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 514, + 498, + 527 + ], + "score": 1.0, + "content": "should be treated as densities, and for discrete distributions as probability mass functions.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 537, + 505, + 582 + ], + "lines": [ + { + "bbox": [ + 106, + 537, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 184, + 549 + ], + "score": 1.0, + "content": "Relaxations using", + "type": "text" + }, + { + "bbox": [ + 184, + 538, + 191, + 549 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 537, + 506, + 549 + ], + "score": 1.0, + "content": "-divergence This construction immediately allows us to obtain relaxations of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 107, + 549, + 506, + 561 + ], + "spans": [ + { + "bbox": [ + 107, + 549, + 126, + 561 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 549, + 233, + 561 + ], + "score": 1.0, + "content": ". For example, by choosing", + "type": "text" + }, + { + "bbox": [ + 234, + 549, + 300, + 561 + ], + "score": 0.92, + "content": "f ( u ) = u \\log ( u )", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 549, + 506, + 561 + ], + "score": 1.0, + "content": ", we have the KL-divergence. Using KL-divergence", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 560, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 505, + 572 + ], + "score": 1.0, + "content": "yields the following relaxation between norm-based and divergence-based constraint sets for Gaussian", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 570, + 290, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 208, + 583 + ], + "score": 1.0, + "content": "smoothing measures, i.e.", + "type": "text" + }, + { + "bbox": [ + 209, + 570, + 286, + 583 + ], + "score": 0.92, + "content": "\\mu ( x ) = \\mathcal { N } ( x , \\sigma ^ { 2 } I )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 570, + 290, + 583 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 587, + 446, + 602 + ], + "lines": [ + { + "bbox": [ + 164, + 587, + 446, + 602 + ], + "spans": [ + { + "bbox": [ + 164, + 587, + 446, + 602 + ], + "score": 0.88, + "content": "\\begin{array} { r } { { \\mathcal { D } } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\} \\subseteq \\left\\{ \\nu : \\mathrm { K L } ( \\nu \\| \\mu ( x ) ) \\leq \\epsilon ^ { 2 } / ( 2 \\sigma ^ { 2 } ) \\right\\} \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "497076acbf7ca0680384e81321a4d54f8679a7044a4fdc43971d505af2085111.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 164, + 587, + 446, + 602 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 605, + 337, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 338, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 338, + 617 + ], + "score": 1.0, + "content": "Tighter relaxations can be constructed by combining mul-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 615, + 337, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 615, + 337, + 629 + ], + "score": 1.0, + "content": "tiple divergence-based constraints. In particular, suppose", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 107, + 626, + 336, + 639 + ], + "spans": [ + { + "bbox": [ + 107, + 627, + 116, + 637 + ], + "score": 0.82, + "content": "\\mathcal { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 626, + 336, + 639 + ], + "score": 1.0, + "content": "is a collection of convex functions each defining an", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 635, + 335, + 651 + ], + "spans": [ + { + "bbox": [ + 107, + 638, + 114, + 649 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 635, + 239, + 651 + ], + "score": 1.0, + "content": "-divergence, and assume each", + "type": "text" + }, + { + "bbox": [ + 239, + 638, + 270, + 649 + ], + "score": 0.92, + "content": "f \\in { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 635, + 324, + 651 + ], + "score": 1.0, + "content": "has a bound", + "type": "text" + }, + { + "bbox": [ + 325, + 640, + 335, + 650 + ], + "score": 0.84, + "content": "\\epsilon _ { f }", + "type": "inline_equation" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 649, + 337, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 337, + 660 + ], + "score": 1.0, + "content": "associated with it. Then we can define the constraint set", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 660, + 336, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 336, + 670 + ], + "score": 1.0, + "content": "containing perturbed distributions where all the bounds", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 670, + 224, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 224, + 683 + ], + "score": 1.0, + "content": "hold simultaneously (Fig. 1):", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37 + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 686, + 326, + 714 + ], + "lines": [ + { + "bbox": [ + 117, + 686, + 326, + 714 + ], + "spans": [ + { + "bbox": [ + 117, + 686, + 326, + 714 + ], + "score": 0.9, + "content": "{ \\mathcal { D } } _ { { \\mathcal { F } } } : = \\bigcap _ { f \\in { \\mathcal { F } } } { \\mathcal { D } } _ { f } = \\left\\{ \\nu : \\forall f \\in { \\mathcal { F } } \\ D _ { f } ( \\nu \\| \\rho ) \\leq \\epsilon _ { f } \\right\\} \\ .", + "type": "interline_equation", + "image_path": "98620b7fba5964d5dbf009ba2e3ff8fdb0a5649329055a39bbc24b6fc8922a2f.jpg" + } + ] + } + ], + "index": 42.5, + "virtual_lines": [ + { + "bbox": [ + 117, + 686, + 326, + 700.0 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 117, + 700.0, + 326, + 714.0 + ], + "spans": [], + "index": 43 + } + ] + }, + { + "type": "image", + "bbox": [ + 355, + 608, + 492, + 702 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 355, + 608, + 492, + 702 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 355, + 608, + 492, + 702 + ], + "spans": [ + { + "bbox": [ + 355, + 608, + 492, + 702 + ], + "score": 0.959, + "type": "image", + "image_path": "780bf0bf4f2c683a963451dd5c5948364e7681d2494ad1b2600b2a70aae3d94a.jpg" + } + ] + } + ], + "index": 42.5, + "virtual_lines": [ + { + "bbox": [ + 355, + 608, + 492, + 655.0 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 355, + 655.0, + 492, + 702.0 + ], + "spans": [], + "index": 44 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 343, + 713, + 506, + 745 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 343, + 713, + 506, + 725 + ], + "spans": [ + { + "bbox": [ + 343, + 713, + 435, + 725 + ], + "score": 1.0, + "content": "Figure 1: Intersecting", + "type": "text" + }, + { + "bbox": [ + 436, + 714, + 443, + 725 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 713, + 506, + 725 + ], + "score": 1.0, + "content": "-divergence con-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 342, + 722, + 506, + 735 + ], + "spans": [ + { + "bbox": [ + 342, + 722, + 473, + 735 + ], + "score": 1.0, + "content": "straints to obtain better relaxations g. `0).", + "type": "text" + }, + { + "bbox": [ + 473, + 724, + 488, + 734 + ], + "score": 0.88, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 722, + 506, + 735 + ], + "score": 1.0, + "content": "(de-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 343, + 732, + 480, + 747 + ], + "spans": [ + { + "bbox": [ + 343, + 732, + 457, + 747 + ], + "score": 1.0, + "content": "picted by the orange region) of", + "type": "text" + }, + { + "bbox": [ + 457, + 734, + 475, + 745 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 732, + 480, + 747 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47 + } + ], + "index": 44.75 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 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, + 308, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 12, + "width": 9 + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 82, + 417, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 418, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 418, + 95 + ], + "score": 1.0, + "content": "2.1.1 ROBUSTNESS SPECIFICATION FOR SMOOTHED HARD CLASSIFIERS", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 119, + 721, + 342, + 744 + ], + "lines": [ + { + "bbox": [ + 119, + 720, + 343, + 733 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 123, + 733 + ], + "score": 1.0, + "content": "1", + "type": "text" + }, + { + "bbox": [ + 123, + 721, + 129, + 730 + ], + "score": 0.62, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 720, + 343, + 733 + ], + "score": 1.0, + "content": "is an arbitrary distance function (not necessarily a metric e.", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 101, + 505, + 168 + ], + "lines": [ + { + "bbox": [ + 106, + 102, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 102, + 505, + 113 + ], + "score": 1.0, + "content": "We first note that the definitions above are sufficient to capture the standard usage of randomized", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 112, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 112, + 505, + 125 + ], + "score": 1.0, + "content": "smoothing as it has been used in past work (e.g. Lecuyer et al., 2019; Cohen et al., 2019) to verify", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 123, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 506, + 136 + ], + "score": 1.0, + "content": "the robustness of smoothed multi-class classifiers. Specifically, consider smoothing a classifier", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 133, + 506, + 149 + ], + "spans": [ + { + "bbox": [ + 107, + 135, + 154, + 146 + ], + "score": 0.91, + "content": "h : \\mathcal { X } \\to \\mathcal { Y }", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 133, + 257, + 149 + ], + "score": 1.0, + "content": "with a finite set of labels", + "type": "text" + }, + { + "bbox": [ + 257, + 135, + 266, + 146 + ], + "score": 0.84, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 133, + 380, + 149 + ], + "score": 1.0, + "content": "using a smoothing measure", + "type": "text" + }, + { + "bbox": [ + 380, + 135, + 444, + 146 + ], + "score": 0.94, + "content": "\\mu : \\mathcal X \\mapsto \\mathcal P ( \\mathcal X )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 133, + 506, + 149 + ], + "score": 1.0, + "content": ". The resulting", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 146, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 146, + 223, + 158 + ], + "score": 1.0, + "content": "randomly smoothed classifier", + "type": "text" + }, + { + "bbox": [ + 224, + 146, + 235, + 156 + ], + "score": 0.89, + "content": "h _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 146, + 470, + 158 + ], + "score": 1.0, + "content": "is defined in Eq. 1. Our goal is to certify that the prediction", + "type": "text" + }, + { + "bbox": [ + 470, + 146, + 495, + 158 + ], + "score": 0.92, + "content": "h _ { s } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 146, + 505, + 158 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 156, + 488, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 259, + 170 + ], + "score": 1.0, + "content": "robust to perturbations of size at most", + "type": "text" + }, + { + "bbox": [ + 259, + 159, + 265, + 167 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 157, + 393, + 170 + ], + "score": 1.0, + "content": "measured by distance function1", + "type": "text" + }, + { + "bbox": [ + 394, + 156, + 467, + 168 + ], + "score": 0.89, + "content": "d : \\mathcal { X } \\times \\mathcal { X } \\mapsto \\mathbb { R } _ { + }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 157, + 488, + 170 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 102, + 506, + 170 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 211, + 171, + 397, + 186 + ], + "lines": [ + { + "bbox": [ + 211, + 171, + 397, + 186 + ], + "spans": [ + { + "bbox": [ + 211, + 171, + 397, + 186 + ], + "score": 0.86, + "content": "h _ { s } ( x ^ { \\prime } ) = h _ { s } ( x ) \\quad \\forall x ^ { \\prime } \\ \\mathrm { s u c h ~ t h a t } \\ d ( x , x ^ { \\prime } ) \\leq \\epsilon .", + "type": "interline_equation", + "image_path": "6d041ce45084b5b6fb732d7b7aad962753203e718f12289be9047943f9a87cc2.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 211, + 171, + 397, + 186 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 195, + 505, + 230 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 444, + 208 + ], + "score": 1.0, + "content": "To pose this question within our framework, we choose the reference distribution", + "type": "text" + }, + { + "bbox": [ + 444, + 195, + 485, + 208 + ], + "score": 0.92, + "content": "\\rho = \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 195, + 505, + 208 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 206, + 506, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 206, + 226, + 220 + ], + "score": 1.0, + "content": "set of perturbed distributions", + "type": "text" + }, + { + "bbox": [ + 226, + 207, + 349, + 219 + ], + "score": 0.92, + "content": "\\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : d ( x , x ^ { \\prime } ) \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 206, + 506, + 220 + ], + "score": 1.0, + "content": ", and the following specifications. Let", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 217, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 107, + 218, + 148, + 230 + ], + "score": 0.93, + "content": "c = h _ { s } ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 217, + 194, + 230 + ], + "score": 1.0, + "content": ". For every", + "type": "text" + }, + { + "bbox": [ + 194, + 217, + 245, + 230 + ], + "score": 0.92, + "content": "c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 217, + 357, + 230 + ], + "score": 1.0, + "content": ", we define the specification", + "type": "text" + }, + { + "bbox": [ + 358, + 217, + 459, + 230 + ], + "score": 0.93, + "content": "\\phi _ { c , c ^ { \\prime } } : \\mathcal { X } \\mapsto \\{ - \\bar { 1 } , \\bar { 0 } , + 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 217, + 506, + 230 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 195, + 506, + 230 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 235, + 372, + 275 + ], + "lines": [ + { + "bbox": [ + 236, + 235, + 372, + 275 + ], + "spans": [ + { + "bbox": [ + 236, + 235, + 372, + 275 + ], + "score": 0.93, + "content": "\\phi _ { c , c ^ { \\prime } } ( x ) = \\left\\{ \\begin{array} { l l } { { + 1 } } & { { \\mathrm { ~ i f ~ } h ( x ) = c ~ , } } \\\\ { { - 1 } } & { { \\mathrm { ~ i f ~ } h ( x ) = c ^ { \\prime } ~ , } } \\\\ { { 0 } } & { { \\mathrm { ~ o t h e r w i s e ~ . } } } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "fe93ac917d79b02f57844b93d8fe67d8556ab29168ca91ebb86f6afb067adec4.jpg" + } + ] + } + ], + "index": 10.5, + "virtual_lines": [ + { + "bbox": [ + 236, + 235, + 372, + 255.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 236, + 255.0, + 372, + 275.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 280, + 504, + 303 + ], + "lines": [ + { + "bbox": [ + 104, + 277, + 504, + 295 + ], + "spans": [ + { + "bbox": [ + 104, + 277, + 258, + 295 + ], + "score": 1.0, + "content": "Then, Eq. 5 holds if and only if every", + "type": "text" + }, + { + "bbox": [ + 258, + 281, + 277, + 293 + ], + "score": 0.71, + "content": "\\phi _ { c , c ^ { \\prime } }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 277, + 281, + 295 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 282, + 280, + 308, + 293 + ], + "score": 0.5, + "content": "c ^ { \\prime } \\neq c", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 277, + 401, + 295 + ], + "score": 1.0, + "content": ", is robustly certified at", + "type": "text" + }, + { + "bbox": [ + 401, + 281, + 421, + 293 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 277, + 484, + 295 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 484, + 281, + 504, + 293 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 291, + 189, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 189, + 304 + ], + "score": 1.0, + "content": "(see Appendix A.1).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 277, + 504, + 304 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 316, + 311, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 316, + 311, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 311, + 329 + ], + "score": 1.0, + "content": "2.2 CONSTRAINT SETS FROM F-DIVERGENCES", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 336, + 506, + 392 + ], + "lines": [ + { + "bbox": [ + 106, + 336, + 506, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 187, + 350 + ], + "score": 1.0, + "content": "Dealing with the set", + "type": "text" + }, + { + "bbox": [ + 188, + 338, + 207, + 349 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 336, + 506, + 350 + ], + "score": 1.0, + "content": "directly is difficult due to its possibly non-convex geometry. In this section,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 347, + 506, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 356, + 361 + ], + "score": 1.0, + "content": "we discuss specific relaxations of this set, i.e., choices for sets", + "type": "text" + }, + { + "bbox": [ + 356, + 348, + 366, + 358 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 347, + 405, + 361 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 405, + 348, + 446, + 360 + ], + "score": 0.93, + "content": "\\mathcal { D } _ { x , \\epsilon } \\subseteq \\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 347, + 506, + 361 + ], + "score": 1.0, + "content": "that are easier", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 358, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 506, + 371 + ], + "score": 1.0, + "content": "to optimize over. In particular, we focus on a general family of constraint sets defined in terms of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 107, + 370, + 506, + 383 + ], + "spans": [ + { + "bbox": [ + 107, + 370, + 114, + 381 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 370, + 506, + 383 + ], + "score": 1.0, + "content": "-divergences. These divergences satisfy a number of useful properties and include many well-known", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 381, + 415, + 393 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 415, + 393 + ], + "score": 1.0, + "content": "instances (e.g. relative entropy, total variation); see Appendix A.2 for details.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 336, + 506, + 393 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 394, + 501, + 407 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 502, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 174, + 408 + ], + "score": 1.0, + "content": "Definition 2.3.", + "type": "text" + }, + { + "bbox": [ + 175, + 396, + 181, + 407 + ], + "score": 0.77, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 393, + 317, + 408 + ], + "score": 1.0, + "content": "-divergence constraint set). Given", + "type": "text" + }, + { + "bbox": [ + 318, + 395, + 370, + 407 + ], + "score": 0.93, + "content": "\\rho , \\nu \\in \\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 393, + 394, + 408 + ], + "score": 1.0, + "content": ", their", + "type": "text" + }, + { + "bbox": [ + 395, + 396, + 402, + 407 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 393, + 502, + 408 + ], + "score": 1.0, + "content": "-divergence is defined as", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 393, + 502, + 408 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 239, + 410, + 371, + 439 + ], + "lines": [ + { + "bbox": [ + 239, + 410, + 371, + 439 + ], + "spans": [ + { + "bbox": [ + 239, + 410, + 371, + 439 + ], + "score": 0.94, + "content": "D _ { f } ( \\nu \\| \\rho ) = \\underset { X \\sim \\rho } { \\mathrm { E } } \\Bigg [ f \\Bigg ( \\frac { \\nu ( X ) } { \\rho ( X ) } \\Bigg ) \\Bigg ] ~ ,", + "type": "interline_equation", + "image_path": "7f706cb311365f08edf41f889402305ab852238209c17f47c7d7e33c3bcc14b0.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 239, + 410, + 371, + 424.5 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 239, + 424.5, + 371, + 439.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 442, + 503, + 465 + ], + "lines": [ + { + "bbox": [ + 105, + 440, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 134, + 456 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 442, + 194, + 454 + ], + "score": 0.92, + "content": "f : \\mathbb { R } _ { + } \\mapsto \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 440, + 305, + 456 + ], + "score": 1.0, + "content": "is a convex function with", + "type": "text" + }, + { + "bbox": [ + 306, + 442, + 347, + 454 + ], + "score": 0.92, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 440, + 482, + 456 + ], + "score": 1.0, + "content": ". Given a reference distribution", + "type": "text" + }, + { + "bbox": [ + 482, + 445, + 488, + 454 + ], + "score": 0.78, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 440, + 505, + 456 + ], + "score": 1.0, + "content": ", an", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 107, + 453, + 452, + 466 + ], + "spans": [ + { + "bbox": [ + 107, + 454, + 114, + 465 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 453, + 161, + 466 + ], + "score": 1.0, + "content": "-divergence", + "type": "text" + }, + { + "bbox": [ + 162, + 454, + 176, + 466 + ], + "score": 0.9, + "content": "D _ { f }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 453, + 228, + 466 + ], + "score": 1.0, + "content": "and a bound", + "type": "text" + }, + { + "bbox": [ + 228, + 454, + 257, + 466 + ], + "score": 0.92, + "content": "\\epsilon _ { f } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 453, + 316, + 466 + ], + "score": 1.0, + "content": ", we define the", + "type": "text" + }, + { + "bbox": [ + 317, + 454, + 324, + 465 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 453, + 452, + 466 + ], + "score": 1.0, + "content": "-divergence constraint set to be:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 440, + 505, + 466 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 227, + 469, + 383, + 483 + ], + "lines": [ + { + "bbox": [ + 227, + 469, + 383, + 483 + ], + "spans": [ + { + "bbox": [ + 227, + 469, + 383, + 483 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { f } = \\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { f } ( \\nu \\| \\rho ) \\leq \\epsilon _ { f } \\} \\ .", + "type": "interline_equation", + "image_path": "7bc8b829094e9328942d7d0933e99f3451dc314e5751265217f87799f89e2202.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 227, + 469, + 383, + 483 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 506, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 397, + 505 + ], + "score": 1.0, + "content": "Technically, this definition depends on the Radon-Nikodym derivative of", + "type": "text" + }, + { + "bbox": [ + 397, + 495, + 404, + 502 + ], + "score": 0.76, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 491, + 466, + 505 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 466, + 495, + 472, + 504 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 491, + 506, + 505 + ], + "score": 1.0, + "content": ", but we", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 503, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 506, + 515 + ], + "score": 1.0, + "content": "ignore measure-theoretic issues in this paper for simplicity of exposition. For continuous distributions,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 514, + 498, + 527 + ], + "spans": [ + { + "bbox": [ + 107, + 516, + 113, + 524 + ], + "score": 0.71, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 514, + 131, + 527 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 131, + 516, + 138, + 525 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 514, + 498, + 527 + ], + "score": 1.0, + "content": "should be treated as densities, and for discrete distributions as probability mass functions.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 491, + 506, + 527 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 537, + 505, + 582 + ], + "lines": [ + { + "bbox": [ + 106, + 537, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 184, + 549 + ], + "score": 1.0, + "content": "Relaxations using", + "type": "text" + }, + { + "bbox": [ + 184, + 538, + 191, + 549 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 537, + 506, + 549 + ], + "score": 1.0, + "content": "-divergence This construction immediately allows us to obtain relaxations of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 107, + 549, + 506, + 561 + ], + "spans": [ + { + "bbox": [ + 107, + 549, + 126, + 561 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 126, + 549, + 233, + 561 + ], + "score": 1.0, + "content": ". For example, by choosing", + "type": "text" + }, + { + "bbox": [ + 234, + 549, + 300, + 561 + ], + "score": 0.92, + "content": "f ( u ) = u \\log ( u )", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 549, + 506, + 561 + ], + "score": 1.0, + "content": ", we have the KL-divergence. Using KL-divergence", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 560, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 505, + 572 + ], + "score": 1.0, + "content": "yields the following relaxation between norm-based and divergence-based constraint sets for Gaussian", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 570, + 290, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 208, + 583 + ], + "score": 1.0, + "content": "smoothing measures, i.e.", + "type": "text" + }, + { + "bbox": [ + 209, + 570, + 286, + 583 + ], + "score": 0.92, + "content": "\\mu ( x ) = \\mathcal { N } ( x , \\sigma ^ { 2 } I )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 570, + 290, + 583 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 537, + 506, + 583 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 587, + 446, + 602 + ], + "lines": [ + { + "bbox": [ + 164, + 587, + 446, + 602 + ], + "spans": [ + { + "bbox": [ + 164, + 587, + 446, + 602 + ], + "score": 0.88, + "content": "\\begin{array} { r } { { \\mathcal { D } } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\} \\subseteq \\left\\{ \\nu : \\mathrm { K L } ( \\nu \\| \\mu ( x ) ) \\leq \\epsilon ^ { 2 } / ( 2 \\sigma ^ { 2 } ) \\right\\} \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "497076acbf7ca0680384e81321a4d54f8679a7044a4fdc43971d505af2085111.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 164, + 587, + 446, + 602 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 605, + 337, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 338, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 338, + 617 + ], + "score": 1.0, + "content": "Tighter relaxations can be constructed by combining mul-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 615, + 337, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 615, + 337, + 629 + ], + "score": 1.0, + "content": "tiple divergence-based constraints. In particular, suppose", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 107, + 626, + 336, + 639 + ], + "spans": [ + { + "bbox": [ + 107, + 627, + 116, + 637 + ], + "score": 0.82, + "content": "\\mathcal { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 626, + 336, + 639 + ], + "score": 1.0, + "content": "is a collection of convex functions each defining an", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 635, + 335, + 651 + ], + "spans": [ + { + "bbox": [ + 107, + 638, + 114, + 649 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 635, + 239, + 651 + ], + "score": 1.0, + "content": "-divergence, and assume each", + "type": "text" + }, + { + "bbox": [ + 239, + 638, + 270, + 649 + ], + "score": 0.92, + "content": "f \\in { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 635, + 324, + 651 + ], + "score": 1.0, + "content": "has a bound", + "type": "text" + }, + { + "bbox": [ + 325, + 640, + 335, + 650 + ], + "score": 0.84, + "content": "\\epsilon _ { f }", + "type": "inline_equation" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 649, + 337, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 337, + 660 + ], + "score": 1.0, + "content": "associated with it. Then we can define the constraint set", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 660, + 336, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 336, + 670 + ], + "score": 1.0, + "content": "containing perturbed distributions where all the bounds", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 670, + 224, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 224, + 683 + ], + "score": 1.0, + "content": "hold simultaneously (Fig. 1):", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 604, + 338, + 683 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 686, + 326, + 714 + ], + "lines": [ + { + "bbox": [ + 117, + 686, + 326, + 714 + ], + "spans": [ + { + "bbox": [ + 117, + 686, + 326, + 714 + ], + "score": 0.9, + "content": "{ \\mathcal { D } } _ { { \\mathcal { F } } } : = \\bigcap _ { f \\in { \\mathcal { F } } } { \\mathcal { D } } _ { f } = \\left\\{ \\nu : \\forall f \\in { \\mathcal { F } } \\ D _ { f } ( \\nu \\| \\rho ) \\leq \\epsilon _ { f } \\right\\} \\ .", + "type": "interline_equation", + "image_path": "98620b7fba5964d5dbf009ba2e3ff8fdb0a5649329055a39bbc24b6fc8922a2f.jpg" + } + ] + } + ], + "index": 42.5, + "virtual_lines": [ + { + "bbox": [ + 117, + 686, + 326, + 700.0 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 117, + 700.0, + 326, + 714.0 + ], + "spans": [], + "index": 43 + } + ] + }, + { + "type": "image", + "bbox": [ + 355, + 608, + 492, + 702 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 355, + 608, + 492, + 702 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 355, + 608, + 492, + 702 + ], + "spans": [ + { + "bbox": [ + 355, + 608, + 492, + 702 + ], + "score": 0.959, + "type": "image", + "image_path": "780bf0bf4f2c683a963451dd5c5948364e7681d2494ad1b2600b2a70aae3d94a.jpg" + } + ] + } + ], + "index": 42.5, + "virtual_lines": [ + { + "bbox": [ + 355, + 608, + 492, + 655.0 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 355, + 655.0, + 492, + 702.0 + ], + "spans": [], + "index": 44 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 343, + 713, + 506, + 745 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 343, + 713, + 506, + 725 + ], + "spans": [ + { + "bbox": [ + 343, + 713, + 435, + 725 + ], + "score": 1.0, + "content": "Figure 1: Intersecting", + "type": "text" + }, + { + "bbox": [ + 436, + 714, + 443, + 725 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 713, + 506, + 725 + ], + "score": 1.0, + "content": "-divergence con-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 342, + 722, + 506, + 735 + ], + "spans": [ + { + "bbox": [ + 342, + 722, + 473, + 735 + ], + "score": 1.0, + "content": "straints to obtain better relaxations g. `0).", + "type": "text" + }, + { + "bbox": [ + 473, + 724, + 488, + 734 + ], + "score": 0.88, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 722, + 506, + 735 + ], + "score": 1.0, + "content": "(de-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 343, + 732, + 480, + 747 + ], + "spans": [ + { + "bbox": [ + 343, + 732, + 457, + 747 + ], + "score": 1.0, + "content": "picted by the orange region) of", + "type": "text" + }, + { + "bbox": [ + 457, + 734, + 475, + 745 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 732, + 480, + 747 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47 + } + ], + "index": 44.75 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 325, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 326, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 326, + 96 + ], + "score": 1.0, + "content": "In this paper, we work with the following divergences:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 94, + 506, + 127 + ], + "lines": [ + { + "bbox": [ + 105, + 92, + 337, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 149, + 107 + ], + "score": 1.0, + "content": "(1) Renyi: ´", + "type": "text" + }, + { + "bbox": [ + 149, + 93, + 309, + 105 + ], + "score": 0.91, + "content": "R _ { \\alpha } ( \\nu | | \\rho ) = \\log ( 1 + D _ { f } ( \\nu | | \\rho ) ) / ( \\alpha - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 92, + 337, + 107 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 107, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 107, + 105, + 165, + 116 + ], + "score": 0.91, + "content": "f ( x ) = x ^ { \\alpha } - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 104, + 183, + 117 + ], + "score": 1.0, + "content": "(for", + "type": "text" + }, + { + "bbox": [ + 183, + 106, + 210, + 116 + ], + "score": 0.85, + "content": "\\alpha \\geq 1 \\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 104, + 231, + 117 + ], + "score": 1.0, + "content": "), and", + "type": "text" + }, + { + "bbox": [ + 232, + 105, + 390, + 117 + ], + "score": 0.9, + "content": "\\tilde { R _ { \\alpha } } ( \\rho \\| \\nu ) = \\log ( 1 - D _ { f } ( \\nu \\| \\rho ) ) / ( \\alpha - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 104, + 411, + 117 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 411, + 104, + 469, + 116 + ], + "score": 0.89, + "content": "f ( x ) = 1 - x ^ { \\alpha }", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 104, + 487, + 117 + ], + "score": 1.0, + "content": "(for", + "type": "text" + }, + { + "bbox": [ + 487, + 105, + 506, + 115 + ], + "score": 0.8, + "content": "0 \\leq", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 114, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 107, + 117, + 133, + 127 + ], + "score": 0.86, + "content": "\\alpha \\leq 1 _ { \\cdot }", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 114, + 179, + 128 + ], + "score": 1.0, + "content": "). The limit", + "type": "text" + }, + { + "bbox": [ + 179, + 117, + 212, + 126 + ], + "score": 0.88, + "content": "\\alpha \\to \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 114, + 379, + 128 + ], + "score": 1.0, + "content": "yields the infinite order Renyi divergence ´", + "type": "text" + }, + { + "bbox": [ + 379, + 116, + 503, + 127 + ], + "score": 0.9, + "content": "R _ { \\infty } ( \\nu \\| \\rho ) = \\operatorname* { s u p } _ { x } ( \\nu ( x ) / \\rho ( x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 114, + 506, + 128 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 131, + 300, + 145 + ], + "lines": [ + { + "bbox": [ + 106, + 131, + 298, + 147 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 120, + 147 + ], + "score": 1.0, + "content": "(2)", + "type": "text" + }, + { + "bbox": [ + 120, + 132, + 209, + 145 + ], + "score": 0.91, + "content": "\\mathrm { K L } ( \\nu \\| \\rho ) = D _ { f } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 131, + 231, + 147 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 231, + 132, + 298, + 144 + ], + "score": 0.92, + "content": "f ( x ) = x \\log ( x )", + "type": "inline_equation" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 104, + 148, + 471, + 162 + ], + "lines": [ + { + "bbox": [ + 105, + 147, + 470, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 180, + 163 + ], + "score": 1.0, + "content": "(3) Hockey-Stick:", + "type": "text" + }, + { + "bbox": [ + 181, + 149, + 281, + 162 + ], + "score": 0.92, + "content": "D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho ) = D _ { f } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 147, + 303, + 163 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 304, + 149, + 470, + 162 + ], + "score": 0.87, + "content": "f ( x ) = \\mathrm { m a x } ( x - \\beta , 0 ) - \\mathrm { m a x } ( 1 - \\beta , 0 ) .", + "type": "inline_equation" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 166, + 506, + 210 + ], + "lines": [ + { + "bbox": [ + 105, + 166, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 506, + 179 + ], + "score": 1.0, + "content": "It turns out that the Renyi and KL divergences are computationally attractive for a broad class of ´", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 177, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 177, + 506, + 190 + ], + "score": 1.0, + "content": "smoothing measures, while the Hockey-Stick divergences are theoretically attractive as they lead to", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 189, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 506, + 200 + ], + "score": 1.0, + "content": "optimal certificates in the information-limited setting. However, Hockey-Stick divergences are harder", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 200, + 420, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 420, + 211 + ], + "score": 1.0, + "content": "to estimate in general, so we only use them for Gaussian smoothing measures.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5 + }, + { + "type": "title", + "bbox": [ + 108, + 225, + 290, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 224, + 291, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 291, + 237 + ], + "score": 1.0, + "content": "2.3 COMPUTING F-DIVERGENCE BOUNDS", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 245, + 505, + 279 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 506, + 259 + ], + "score": 1.0, + "content": "In general, our framework can be used with any family of smoothing measures and any family of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 107, + 254, + 507, + 271 + ], + "spans": [ + { + "bbox": [ + 107, + 257, + 114, + 268 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 254, + 285, + 271 + ], + "score": 1.0, + "content": "divergences such that an upper bound on", + "type": "text" + }, + { + "bbox": [ + 285, + 257, + 370, + 269 + ], + "score": 0.75, + "content": "\\mathrm { m a x } _ { \\nu \\in \\mathcal { D } _ { x , \\epsilon } } D _ { f } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 254, + 507, + 271 + ], + "score": 1.0, + "content": "can be estimated efficiently. We", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 268, + 485, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 162, + 280 + ], + "score": 1.0, + "content": "describe how", + "type": "text" + }, + { + "bbox": [ + 162, + 268, + 169, + 279 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 268, + 485, + 280 + ], + "score": 1.0, + "content": "-divergence bounds can be obtained for several classes of smoothing measures:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 293, + 505, + 362 + ], + "lines": [ + { + "bbox": [ + 103, + 289, + 504, + 310 + ], + "spans": [ + { + "bbox": [ + 103, + 289, + 333, + 310 + ], + "score": 1.0, + "content": "Product measures Product measures are of the form", + "type": "text" + }, + { + "bbox": [ + 333, + 293, + 415, + 306 + ], + "score": 0.95, + "content": "\\mu ( \\boldsymbol { x } ) = \\otimes _ { i = 1 } ^ { d } \\mu _ { i } ( x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 289, + 444, + 310 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 445, + 291, + 504, + 306 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal { X } = \\prod _ { i = 1 } ^ { d } \\mathcal { X } _ { i } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 305, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 106, + 305, + 123, + 317 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 306, + 135, + 316 + ], + "score": 0.85, + "content": "\\mu _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 305, + 248, + 317 + ], + "score": 1.0, + "content": "is a smoothing measure on", + "type": "text" + }, + { + "bbox": [ + 248, + 305, + 260, + 316 + ], + "score": 0.88, + "content": "\\mathcal { X } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 305, + 505, + 317 + ], + "score": 1.0, + "content": ". We note that the discrete smoothing measure used in (Lee", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 314, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 505, + 327 + ], + "score": 1.0, + "content": "et al., 2019), the Gaussian measure used in (Cohen et al., 2019) and the Laplacian measure used", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 326, + 506, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 506, + 339 + ], + "score": 1.0, + "content": "in (Li et al., 2019) are all of this form. For such measures, one can construct bounds on Renyi- ´", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 336, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 218, + 351 + ], + "score": 1.0, + "content": "divergences subject to any", + "type": "text" + }, + { + "bbox": [ + 218, + 338, + 228, + 349 + ], + "score": 0.86, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 336, + 505, + 351 + ], + "score": 1.0, + "content": "norm constraint using a Lagrangian relaxation of the optimization", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 347, + 409, + 363 + ], + "spans": [ + { + "bbox": [ + 104, + 347, + 142, + 363 + ], + "score": 1.0, + "content": "problem", + "type": "text" + }, + { + "bbox": [ + 148, + 349, + 280, + 363 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\operatorname { 1 a x } _ { x ^ { \\prime } : \\| x - x ^ { \\prime } \\| _ { p } \\leq \\epsilon } R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 347, + 409, + 363 + ], + "score": 1.0, + "content": "(see Appendix A.3 for details).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 107, + 374, + 505, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "score": 1.0, + "content": "Norm-based smoothing measures Appendix A.9.1 also shows how we can obtain bounds on the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 385, + 504, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 234, + 398 + ], + "score": 1.0, + "content": "infinite-order Renyi divergence ´", + "type": "text" + }, + { + "bbox": [ + 234, + 386, + 250, + 397 + ], + "score": 0.89, + "content": "R _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 385, + 380, + 398 + ], + "score": 1.0, + "content": ", as well as on several classes of", + "type": "text" + }, + { + "bbox": [ + 380, + 386, + 387, + 397 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 385, + 504, + 398 + ], + "score": 1.0, + "content": "-divergences, for norm-based", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 396, + 357, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 397, + 238, + 409 + ], + "score": 1.0, + "content": "smoothing measures of the form", + "type": "text" + }, + { + "bbox": [ + 239, + 396, + 354, + 408 + ], + "score": 0.9, + "content": "\\mu ( x ) [ X ] \\propto \\exp ( { - \\| X - x \\| } )", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 397, + 357, + 409 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "title", + "bbox": [ + 107, + 425, + 302, + 437 + ], + "lines": [ + { + "bbox": [ + 104, + 423, + 303, + 441 + ], + "spans": [ + { + "bbox": [ + 104, + 423, + 303, + 441 + ], + "score": 1.0, + "content": "3 OUR CERTIFICATION PROCEDURES", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 449, + 505, + 505 + ], + "lines": [ + { + "bbox": [ + 106, + 450, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 450, + 506, + 461 + ], + "score": 1.0, + "content": "We now show how to reduce the problems of full-information and information-limited robust black-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 461, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 461, + 451, + 473 + ], + "score": 1.0, + "content": "box certification to simple convex optimization problems for general constraint sets", + "type": "text" + }, + { + "bbox": [ + 451, + 461, + 461, + 471 + ], + "score": 0.79, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 461, + 505, + 473 + ], + "score": 1.0, + "content": "defined in", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 473, + 142, + 484 + ], + "score": 1.0, + "content": "terms of", + "type": "text" + }, + { + "bbox": [ + 143, + 473, + 150, + 484 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 473, + 505, + 484 + ], + "score": 1.0, + "content": "-divergences. This allows us, by extension, to solve the problem for related divergences", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 481, + 506, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 506, + 496 + ], + "score": 1.0, + "content": "like Renyi divergences. The following two theorems provide the main foundation for the verification ´", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 493, + 204, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 204, + 508 + ], + "score": 1.0, + "content": "procedures in the paper.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 509, + 505, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 363, + 522 + ], + "score": 1.0, + "content": "Theorem 1 (Verifying full-information robust certification). Let", + "type": "text" + }, + { + "bbox": [ + 363, + 510, + 380, + 520 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 508, + 505, + 522 + ], + "score": 1.0, + "content": "be the constraint set defined by", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 107, + 519, + 507, + 538 + ], + "spans": [ + { + "bbox": [ + 107, + 522, + 185, + 534 + ], + "score": 0.92, + "content": "\\mathcal { F } = \\{ f _ { 1 } , \\ldots , f _ { M } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 519, + 203, + 538 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 204, + 523, + 237, + 534 + ], + "score": 0.89, + "content": "\\epsilon _ { f _ { i } } = \\epsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 519, + 272, + 538 + ], + "score": 1.0, + "content": ". Define", + "type": "text" + }, + { + "bbox": [ + 273, + 520, + 367, + 534 + ], + "score": 0.92, + "content": "\\begin{array} { r } { f _ { \\lambda } ( u ) = \\sum _ { i = 1 } ^ { M } \\lambda _ { i } f _ { i } ( u ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 519, + 507, + 538 + ], + "score": 1.0, + "content": "and denote its convex conjugate2", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 119, + 546 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 119, + 534, + 130, + 545 + ], + "score": 0.88, + "content": "f _ { \\lambda } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 533, + 204, + 546 + ], + "score": 1.0, + "content": ". The specification", + "type": "text" + }, + { + "bbox": [ + 204, + 534, + 212, + 544 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 533, + 300, + 546 + ], + "score": 1.0, + "content": "is robustly certified at", + "type": "text" + }, + { + "bbox": [ + 300, + 535, + 307, + 545 + ], + "score": 0.83, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 533, + 367, + 546 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 368, + 533, + 384, + 545 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "(cf. Definition 2.2) if and only", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 107, + 543, + 439, + 557 + ], + "spans": [ + { + "bbox": [ + 107, + 545, + 115, + 556 + ], + "score": 0.76, + "content": "i f", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 543, + 439, + 557 + ], + "score": 1.0, + "content": "the optimal value of the following convex optimization problem is non-negative:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + }, + { + "type": "interline_equation", + "bbox": [ + 197, + 561, + 413, + 596 + ], + "lines": [ + { + "bbox": [ + 197, + 561, + 413, + 596 + ], + "spans": [ + { + "bbox": [ + 197, + 561, + 413, + 596 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { \\lambda _ { 1 } , \\dots , \\lambda _ { M } \\ge 0 , \\kappa } \\kappa - \\sum _ { i = 1 } ^ { M } \\lambda _ { i } \\epsilon _ { i } - \\underset { X \\sim \\rho } { \\mathrm { E } } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] .", + "type": "interline_equation", + "image_path": "d09b0f98805b182956667fae3f6d7cf5ed5e474dedec02afe488e65d2c27a26f.jpg" + } + ] + } + ], + "index": 33.5, + "virtual_lines": [ + { + "bbox": [ + 197, + 561, + 413, + 578.5 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 197, + 578.5, + 413, + 596.0 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 606, + 505, + 651 + ], + "lines": [ + { + "bbox": [ + 106, + 607, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 505, + 619 + ], + "score": 1.0, + "content": "The proof of Theorem 1, given in Appendix A.4, uses standard duality results to show that the dual", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 617, + 505, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 505, + 630 + ], + "score": 1.0, + "content": "of the verification optimization problem has the desired form. We note that the special case where", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 628, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 107, + 629, + 139, + 639 + ], + "score": 0.89, + "content": "M = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 628, + 506, + 641 + ], + "score": 1.0, + "content": "reduces to Proposition 1 of Duchi & Namkoong (2018), although the result is used in a", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 640, + 275, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 275, + 651 + ], + "score": 1.0, + "content": "completely different context in that work.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 107, + 656, + 505, + 713 + ], + "lines": [ + { + "bbox": [ + 106, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "To build a practical certification algorithm from Theorem 1, we must do two things: 1) compute", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 668, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 196, + 680 + ], + "score": 1.0, + "content": "the optimal values of", + "type": "text" + }, + { + "bbox": [ + 196, + 668, + 204, + 678 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 668, + 223, + 680 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 223, + 669, + 230, + 678 + ], + "score": 0.72, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 668, + 505, + 680 + ], + "score": 1.0, + "content": "; and 2) estimate the expectation in Eq. 6. Since the estimation of", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 677, + 506, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 423, + 692 + ], + "score": 1.0, + "content": "the expectation cannot be done in closed form (due to the black-box nature of", + "type": "text" + }, + { + "bbox": [ + 423, + 679, + 430, + 690 + ], + "score": 0.8, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 677, + 506, + 692 + ], + "score": 1.0, + "content": "), we must rely on", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 689, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 282, + 702 + ], + "score": 1.0, + "content": "sampling. In step 1 of Algorithm 1, we use", + "type": "text" + }, + { + "bbox": [ + 283, + 691, + 293, + 699 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 689, + 435, + 702 + ], + "score": 1.0, + "content": "samples taken independently from", + "type": "text" + }, + { + "bbox": [ + 436, + 691, + 443, + 701 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 689, + 505, + 702 + ], + "score": 1.0, + "content": "to estimate the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 700, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 700, + 505, + 713 + ], + "score": 1.0, + "content": "expectation and solve the “sampled” optimization problem using an off-the-shelf solver (Diamond", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 115, + 721, + 474, + 732 + ], + "lines": [ + { + "bbox": [ + 117, + 718, + 475, + 735 + ], + "spans": [ + { + "bbox": [ + 117, + 718, + 184, + 735 + ], + "score": 1.0, + "content": "2For any function", + "type": "text" + }, + { + "bbox": [ + 185, + 721, + 232, + 732 + ], + "score": 0.89, + "content": "f : \\mathbb { R } _ { + } \\mapsto \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 718, + 357, + 735 + ], + "score": 1.0, + "content": ", its convex conjugate is defined as", + "type": "text" + }, + { + "bbox": [ + 357, + 721, + 471, + 732 + ], + "score": 0.86, + "content": "f ^ { * } ( u ) = \\operatorname* { m a x } _ { v \\geq 0 } \\left( u v - f ( v ) \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 718, + 475, + 735 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 17, + "width": 4 + } + ] + } + ] + }, + { + "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, + 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": [ + 108, + 82, + 325, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 326, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 326, + 96 + ], + "score": 1.0, + "content": "In this paper, we work with the following divergences:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 81, + 326, + 96 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 94, + 506, + 127 + ], + "lines": [ + { + "bbox": [ + 105, + 92, + 337, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 149, + 107 + ], + "score": 1.0, + "content": "(1) Renyi: ´", + "type": "text" + }, + { + "bbox": [ + 149, + 93, + 309, + 105 + ], + "score": 0.91, + "content": "R _ { \\alpha } ( \\nu | | \\rho ) = \\log ( 1 + D _ { f } ( \\nu | | \\rho ) ) / ( \\alpha - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 92, + 337, + 107 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 107, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 107, + 105, + 165, + 116 + ], + "score": 0.91, + "content": "f ( x ) = x ^ { \\alpha } - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 104, + 183, + 117 + ], + "score": 1.0, + "content": "(for", + "type": "text" + }, + { + "bbox": [ + 183, + 106, + 210, + 116 + ], + "score": 0.85, + "content": "\\alpha \\geq 1 \\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 104, + 231, + 117 + ], + "score": 1.0, + "content": "), and", + "type": "text" + }, + { + "bbox": [ + 232, + 105, + 390, + 117 + ], + "score": 0.9, + "content": "\\tilde { R _ { \\alpha } } ( \\rho \\| \\nu ) = \\log ( 1 - D _ { f } ( \\nu \\| \\rho ) ) / ( \\alpha - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 104, + 411, + 117 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 411, + 104, + 469, + 116 + ], + "score": 0.89, + "content": "f ( x ) = 1 - x ^ { \\alpha }", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 104, + 487, + 117 + ], + "score": 1.0, + "content": "(for", + "type": "text" + }, + { + "bbox": [ + 487, + 105, + 506, + 115 + ], + "score": 0.8, + "content": "0 \\leq", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 114, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 107, + 117, + 133, + 127 + ], + "score": 0.86, + "content": "\\alpha \\leq 1 _ { \\cdot }", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 114, + 179, + 128 + ], + "score": 1.0, + "content": "). The limit", + "type": "text" + }, + { + "bbox": [ + 179, + 117, + 212, + 126 + ], + "score": 0.88, + "content": "\\alpha \\to \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 114, + 379, + 128 + ], + "score": 1.0, + "content": "yields the infinite order Renyi divergence ´", + "type": "text" + }, + { + "bbox": [ + 379, + 116, + 503, + 127 + ], + "score": 0.9, + "content": "R _ { \\infty } ( \\nu \\| \\rho ) = \\operatorname* { s u p } _ { x } ( \\nu ( x ) / \\rho ( x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 114, + 506, + 128 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 92, + 506, + 128 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 131, + 300, + 145 + ], + "lines": [ + { + "bbox": [ + 106, + 131, + 298, + 147 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 120, + 147 + ], + "score": 1.0, + "content": "(2)", + "type": "text" + }, + { + "bbox": [ + 120, + 132, + 209, + 145 + ], + "score": 0.91, + "content": "\\mathrm { K L } ( \\nu \\| \\rho ) = D _ { f } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 131, + 231, + 147 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 231, + 132, + 298, + 144 + ], + "score": 0.92, + "content": "f ( x ) = x \\log ( x )", + "type": "inline_equation" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 131, + 298, + 147 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 148, + 471, + 162 + ], + "lines": [ + { + "bbox": [ + 105, + 147, + 470, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 180, + 163 + ], + "score": 1.0, + "content": "(3) Hockey-Stick:", + "type": "text" + }, + { + "bbox": [ + 181, + 149, + 281, + 162 + ], + "score": 0.92, + "content": "D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho ) = D _ { f } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 147, + 303, + 163 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 304, + 149, + 470, + 162 + ], + "score": 0.87, + "content": "f ( x ) = \\mathrm { m a x } ( x - \\beta , 0 ) - \\mathrm { m a x } ( 1 - \\beta , 0 ) .", + "type": "inline_equation" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 147, + 470, + 163 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 166, + 506, + 210 + ], + "lines": [ + { + "bbox": [ + 105, + 166, + 506, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 506, + 179 + ], + "score": 1.0, + "content": "It turns out that the Renyi and KL divergences are computationally attractive for a broad class of ´", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 177, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 177, + 506, + 190 + ], + "score": 1.0, + "content": "smoothing measures, while the Hockey-Stick divergences are theoretically attractive as they lead to", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 189, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 506, + 200 + ], + "score": 1.0, + "content": "optimal certificates in the information-limited setting. However, Hockey-Stick divergences are harder", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 200, + 420, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 420, + 211 + ], + "score": 1.0, + "content": "to estimate in general, so we only use them for Gaussian smoothing measures.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 166, + 506, + 211 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 225, + 290, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 224, + 291, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 291, + 237 + ], + "score": 1.0, + "content": "2.3 COMPUTING F-DIVERGENCE BOUNDS", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 245, + 505, + 279 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 506, + 259 + ], + "score": 1.0, + "content": "In general, our framework can be used with any family of smoothing measures and any family of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 107, + 254, + 507, + 271 + ], + "spans": [ + { + "bbox": [ + 107, + 257, + 114, + 268 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 254, + 285, + 271 + ], + "score": 1.0, + "content": "divergences such that an upper bound on", + "type": "text" + }, + { + "bbox": [ + 285, + 257, + 370, + 269 + ], + "score": 0.75, + "content": "\\mathrm { m a x } _ { \\nu \\in \\mathcal { D } _ { x , \\epsilon } } D _ { f } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 254, + 507, + 271 + ], + "score": 1.0, + "content": "can be estimated efficiently. We", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 268, + 485, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 162, + 280 + ], + "score": 1.0, + "content": "describe how", + "type": "text" + }, + { + "bbox": [ + 162, + 268, + 169, + 279 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 268, + 485, + 280 + ], + "score": 1.0, + "content": "-divergence bounds can be obtained for several classes of smoothing measures:", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 245, + 507, + 280 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 293, + 505, + 362 + ], + "lines": [ + { + "bbox": [ + 103, + 289, + 504, + 310 + ], + "spans": [ + { + "bbox": [ + 103, + 289, + 333, + 310 + ], + "score": 1.0, + "content": "Product measures Product measures are of the form", + "type": "text" + }, + { + "bbox": [ + 333, + 293, + 415, + 306 + ], + "score": 0.95, + "content": "\\mu ( \\boldsymbol { x } ) = \\otimes _ { i = 1 } ^ { d } \\mu _ { i } ( x _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 289, + 444, + 310 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 445, + 291, + 504, + 306 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal { X } = \\prod _ { i = 1 } ^ { d } \\mathcal { X } _ { i } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 305, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 106, + 305, + 123, + 317 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 306, + 135, + 316 + ], + "score": 0.85, + "content": "\\mu _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 305, + 248, + 317 + ], + "score": 1.0, + "content": "is a smoothing measure on", + "type": "text" + }, + { + "bbox": [ + 248, + 305, + 260, + 316 + ], + "score": 0.88, + "content": "\\mathcal { X } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 305, + 505, + 317 + ], + "score": 1.0, + "content": ". We note that the discrete smoothing measure used in (Lee", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 314, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 314, + 505, + 327 + ], + "score": 1.0, + "content": "et al., 2019), the Gaussian measure used in (Cohen et al., 2019) and the Laplacian measure used", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 326, + 506, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 506, + 339 + ], + "score": 1.0, + "content": "in (Li et al., 2019) are all of this form. For such measures, one can construct bounds on Renyi- ´", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 336, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 218, + 351 + ], + "score": 1.0, + "content": "divergences subject to any", + "type": "text" + }, + { + "bbox": [ + 218, + 338, + 228, + 349 + ], + "score": 0.86, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 336, + 505, + 351 + ], + "score": 1.0, + "content": "norm constraint using a Lagrangian relaxation of the optimization", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 347, + 409, + 363 + ], + "spans": [ + { + "bbox": [ + 104, + 347, + 142, + 363 + ], + "score": 1.0, + "content": "problem", + "type": "text" + }, + { + "bbox": [ + 148, + 349, + 280, + 363 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\operatorname { 1 a x } _ { x ^ { \\prime } : \\| x - x ^ { \\prime } \\| _ { p } \\leq \\epsilon } R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 347, + 409, + 363 + ], + "score": 1.0, + "content": "(see Appendix A.3 for details).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16.5, + "bbox_fs": [ + 103, + 289, + 506, + 363 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 374, + 505, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 505, + 387 + ], + "score": 1.0, + "content": "Norm-based smoothing measures Appendix A.9.1 also shows how we can obtain bounds on the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 385, + 504, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 234, + 398 + ], + "score": 1.0, + "content": "infinite-order Renyi divergence ´", + "type": "text" + }, + { + "bbox": [ + 234, + 386, + 250, + 397 + ], + "score": 0.89, + "content": "R _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 385, + 380, + 398 + ], + "score": 1.0, + "content": ", as well as on several classes of", + "type": "text" + }, + { + "bbox": [ + 380, + 386, + 387, + 397 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 385, + 504, + 398 + ], + "score": 1.0, + "content": "-divergences, for norm-based", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 396, + 357, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 397, + 238, + 409 + ], + "score": 1.0, + "content": "smoothing measures of the form", + "type": "text" + }, + { + "bbox": [ + 239, + 396, + 354, + 408 + ], + "score": 0.9, + "content": "\\mu ( x ) [ X ] \\propto \\exp ( { - \\| X - x \\| } )", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 397, + 357, + 409 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 374, + 505, + 409 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 425, + 302, + 437 + ], + "lines": [ + { + "bbox": [ + 104, + 423, + 303, + 441 + ], + "spans": [ + { + "bbox": [ + 104, + 423, + 303, + 441 + ], + "score": 1.0, + "content": "3 OUR CERTIFICATION PROCEDURES", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 449, + 505, + 505 + ], + "lines": [ + { + "bbox": [ + 106, + 450, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 450, + 506, + 461 + ], + "score": 1.0, + "content": "We now show how to reduce the problems of full-information and information-limited robust black-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 461, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 461, + 451, + 473 + ], + "score": 1.0, + "content": "box certification to simple convex optimization problems for general constraint sets", + "type": "text" + }, + { + "bbox": [ + 451, + 461, + 461, + 471 + ], + "score": 0.79, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 461, + 505, + 473 + ], + "score": 1.0, + "content": "defined in", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 473, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 473, + 142, + 484 + ], + "score": 1.0, + "content": "terms of", + "type": "text" + }, + { + "bbox": [ + 143, + 473, + 150, + 484 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 473, + 505, + 484 + ], + "score": 1.0, + "content": "-divergences. This allows us, by extension, to solve the problem for related divergences", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 481, + 506, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 506, + 496 + ], + "score": 1.0, + "content": "like Renyi divergences. The following two theorems provide the main foundation for the verification ´", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 493, + 204, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 204, + 508 + ], + "score": 1.0, + "content": "procedures in the paper.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 450, + 506, + 508 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 509, + 505, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 363, + 522 + ], + "score": 1.0, + "content": "Theorem 1 (Verifying full-information robust certification). Let", + "type": "text" + }, + { + "bbox": [ + 363, + 510, + 380, + 520 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 508, + 505, + 522 + ], + "score": 1.0, + "content": "be the constraint set defined by", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 107, + 519, + 507, + 538 + ], + "spans": [ + { + "bbox": [ + 107, + 522, + 185, + 534 + ], + "score": 0.92, + "content": "\\mathcal { F } = \\{ f _ { 1 } , \\ldots , f _ { M } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 519, + 203, + 538 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 204, + 523, + 237, + 534 + ], + "score": 0.89, + "content": "\\epsilon _ { f _ { i } } = \\epsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 519, + 272, + 538 + ], + "score": 1.0, + "content": ". Define", + "type": "text" + }, + { + "bbox": [ + 273, + 520, + 367, + 534 + ], + "score": 0.92, + "content": "\\begin{array} { r } { f _ { \\lambda } ( u ) = \\sum _ { i = 1 } ^ { M } \\lambda _ { i } f _ { i } ( u ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 519, + 507, + 538 + ], + "score": 1.0, + "content": "and denote its convex conjugate2", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 119, + 546 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 119, + 534, + 130, + 545 + ], + "score": 0.88, + "content": "f _ { \\lambda } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 533, + 204, + 546 + ], + "score": 1.0, + "content": ". The specification", + "type": "text" + }, + { + "bbox": [ + 204, + 534, + 212, + 544 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 533, + 300, + 546 + ], + "score": 1.0, + "content": "is robustly certified at", + "type": "text" + }, + { + "bbox": [ + 300, + 535, + 307, + 545 + ], + "score": 0.83, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 533, + 367, + 546 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 368, + 533, + 384, + 545 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "(cf. Definition 2.2) if and only", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 107, + 543, + 439, + 557 + ], + "spans": [ + { + "bbox": [ + 107, + 545, + 115, + 556 + ], + "score": 0.76, + "content": "i f", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 543, + 439, + 557 + ], + "score": 1.0, + "content": "the optimal value of the following convex optimization problem is non-negative:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 508, + 507, + 557 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 197, + 561, + 413, + 596 + ], + "lines": [ + { + "bbox": [ + 197, + 561, + 413, + 596 + ], + "spans": [ + { + "bbox": [ + 197, + 561, + 413, + 596 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { \\lambda _ { 1 } , \\dots , \\lambda _ { M } \\ge 0 , \\kappa } \\kappa - \\sum _ { i = 1 } ^ { M } \\lambda _ { i } \\epsilon _ { i } - \\underset { X \\sim \\rho } { \\mathrm { E } } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] .", + "type": "interline_equation", + "image_path": "d09b0f98805b182956667fae3f6d7cf5ed5e474dedec02afe488e65d2c27a26f.jpg" + } + ] + } + ], + "index": 33.5, + "virtual_lines": [ + { + "bbox": [ + 197, + 561, + 413, + 578.5 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 197, + 578.5, + 413, + 596.0 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 606, + 505, + 651 + ], + "lines": [ + { + "bbox": [ + 106, + 607, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 505, + 619 + ], + "score": 1.0, + "content": "The proof of Theorem 1, given in Appendix A.4, uses standard duality results to show that the dual", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 617, + 505, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 505, + 630 + ], + "score": 1.0, + "content": "of the verification optimization problem has the desired form. We note that the special case where", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 628, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 107, + 629, + 139, + 639 + ], + "score": 0.89, + "content": "M = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 628, + 506, + 641 + ], + "score": 1.0, + "content": "reduces to Proposition 1 of Duchi & Namkoong (2018), although the result is used in a", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 640, + 275, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 275, + 651 + ], + "score": 1.0, + "content": "completely different context in that work.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 607, + 506, + 651 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 656, + 505, + 713 + ], + "lines": [ + { + "bbox": [ + 106, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "To build a practical certification algorithm from Theorem 1, we must do two things: 1) compute", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 668, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 196, + 680 + ], + "score": 1.0, + "content": "the optimal values of", + "type": "text" + }, + { + "bbox": [ + 196, + 668, + 204, + 678 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 668, + 223, + 680 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 223, + 669, + 230, + 678 + ], + "score": 0.72, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 668, + 505, + 680 + ], + "score": 1.0, + "content": "; and 2) estimate the expectation in Eq. 6. Since the estimation of", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 677, + 506, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 423, + 692 + ], + "score": 1.0, + "content": "the expectation cannot be done in closed form (due to the black-box nature of", + "type": "text" + }, + { + "bbox": [ + 423, + 679, + 430, + 690 + ], + "score": 0.8, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 677, + 506, + 692 + ], + "score": 1.0, + "content": "), we must rely on", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 689, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 282, + 702 + ], + "score": 1.0, + "content": "sampling. In step 1 of Algorithm 1, we use", + "type": "text" + }, + { + "bbox": [ + 283, + 691, + 293, + 699 + ], + "score": 0.82, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 689, + 435, + 702 + ], + "score": 1.0, + "content": "samples taken independently from", + "type": "text" + }, + { + "bbox": [ + 436, + 691, + 443, + 701 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 689, + 505, + 702 + ], + "score": 1.0, + "content": "to estimate the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 700, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 105, + 700, + 505, + 713 + ], + "score": 1.0, + "content": "expectation and solve the “sampled” optimization problem using an off-the-shelf solver (Diamond", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 657, + 506, + 713 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 457, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 459, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 459, + 95 + ], + "score": 1.0, + "content": "Algorithm 1 Full information certification (see appendix A.9 for details of subroutines)", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 105, + 95, + 506, + 162 + ], + "lines": [ + { + "bbox": [ + 105, + 95, + 507, + 110 + ], + "spans": [ + { + "bbox": [ + 105, + 95, + 262, + 110 + ], + "score": 1.0, + "content": "Inputs: Query access to specification", + "type": "text" + }, + { + "bbox": [ + 263, + 96, + 323, + 108 + ], + "score": 0.89, + "content": "\\phi : \\mathcal { X } [ a , b ]", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 95, + 496, + 110 + ], + "score": 1.0, + "content": ", sampling access to reference distribution", + "type": "text" + }, + { + "bbox": [ + 496, + 99, + 502, + 108 + ], + "score": 0.71, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 95, + 507, + 110 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 108, + 385, + 121 + ], + "spans": [ + { + "bbox": [ + 106, + 108, + 156, + 121 + ], + "score": 1.0, + "content": "divergences", + "type": "text" + }, + { + "bbox": [ + 156, + 109, + 165, + 120 + ], + "score": 0.88, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 108, + 214, + 121 + ], + "score": 1.0, + "content": "and bounds", + "type": "text" + }, + { + "bbox": [ + 215, + 110, + 223, + 120 + ], + "score": 0.84, + "content": "\\epsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 108, + 279, + 121 + ], + "score": 1.0, + "content": ", sample sizes", + "type": "text" + }, + { + "bbox": [ + 280, + 109, + 290, + 119 + ], + "score": 0.58, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 108, + 293, + 121 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 294, + 108, + 304, + 119 + ], + "score": 0.74, + "content": "\\tilde { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 108, + 375, + 121 + ], + "score": 1.0, + "content": ", confidence level", + "type": "text" + }, + { + "bbox": [ + 375, + 109, + 381, + 120 + ], + "score": 0.8, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 108, + 385, + 121 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 108, + 118, + 340, + 138 + ], + "spans": [ + { + "bbox": [ + 108, + 118, + 123, + 138 + ], + "score": 1.0, + "content": "1:", + "type": "text" + }, + { + "bbox": [ + 123, + 122, + 135, + 132 + ], + "score": 0.58, + "content": "\\kappa ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 121, + 335, + 134 + ], + "score": 0.44, + "content": "\\lambda ^ { * } \\gets \\mathrm { E S T I M A T E O P T } ( \\rho , \\phi , N , \\{ f _ { i } \\} _ { i = 1 } ^ { M } , \\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } ) .", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 118, + 340, + 138 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 109, + 132, + 440, + 149 + ], + "spans": [ + { + "bbox": [ + 109, + 132, + 123, + 149 + ], + "score": 1.0, + "content": "2:", + "type": "text" + }, + { + "bbox": [ + 123, + 135, + 155, + 146 + ], + "score": 0.78, + "content": "E _ { u b } \\gets", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 132, + 345, + 149 + ], + "score": 1.0, + "content": "UPPERCONFIDENCEBOUND(ρ, φ, N, ˜ {fi}Mi=1,", + "type": "text" + }, + { + "bbox": [ + 345, + 133, + 440, + 147 + ], + "score": 0.42, + "content": "\\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } , a , b , \\lambda ^ { * } , \\kappa ^ { * } , \\zeta ) .", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 109, + 146, + 457, + 163 + ], + "spans": [ + { + "bbox": [ + 109, + 146, + 132, + 163 + ], + "score": 1.0, + "content": "3: If", + "type": "text" + }, + { + "bbox": [ + 133, + 146, + 246, + 161 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\kappa ^ { * } - \\sum _ { i = 1 } ^ { M } \\lambda _ { i } ^ { * } \\epsilon _ { i } - E _ { u b } \\geq 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 146, + 457, + 163 + ], + "score": 1.0, + "content": "return CERTIFIED else return NOT CERTIFIED.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 185, + 506, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 230, + 199 + ], + "score": 1.0, + "content": "& Boyd, 2016). This gives us", + "type": "text" + }, + { + "bbox": [ + 230, + 186, + 256, + 197 + ], + "score": 0.76, + "content": "\\kappa ^ { * } , \\lambda ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 185, + 390, + 199 + ], + "score": 1.0, + "content": ", the estimated optimal values of", + "type": "text" + }, + { + "bbox": [ + 390, + 188, + 398, + 196 + ], + "score": 0.78, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 185, + 416, + 199 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 416, + 186, + 423, + 196 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 185, + 505, + 199 + ], + "score": 1.0, + "content": ", respectively. Then", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 197, + 506, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 506, + 209 + ], + "score": 1.0, + "content": "we take these values and compute a high-confidence lower bound on the objective function of Eq. 6,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 207, + 506, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 506, + 221 + ], + "score": 1.0, + "content": "which is then used to verify robustness. In particular, in step 2, we compute a high-confidence upper", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 218, + 506, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 135, + 233 + ], + "score": 1.0, + "content": "bound", + "type": "text" + }, + { + "bbox": [ + 135, + 219, + 152, + 230 + ], + "score": 0.9, + "content": "E _ { u b }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 218, + 357, + 233 + ], + "score": 1.0, + "content": "on the expectation term in the objective such that", + "type": "text" + }, + { + "bbox": [ + 358, + 219, + 483, + 231 + ], + "score": 0.94, + "content": "E _ { u b } \\ge \\mathrm { E } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa ^ { * } - \\phi ( X ) ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 218, + 506, + 233 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 230, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 182, + 245 + ], + "score": 1.0, + "content": "probability at least", + "type": "text" + }, + { + "bbox": [ + 183, + 232, + 189, + 243 + ], + "score": 0.8, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 232, + 324, + 245 + ], + "score": 1.0, + "content": "; this computation involves taking", + "type": "text" + }, + { + "bbox": [ + 325, + 230, + 335, + 242 + ], + "score": 0.86, + "content": "\\tilde { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 232, + 443, + 245 + ], + "score": 1.0, + "content": "independent samples from", + "type": "text" + }, + { + "bbox": [ + 443, + 234, + 450, + 243 + ], + "score": 0.8, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 232, + 506, + 245 + ], + "score": 1.0, + "content": "and finding a", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 243, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 505, + 255 + ], + "score": 1.0, + "content": "confidence interval around the resulting empirical estimate of the expectation (for details, see Eq. 25", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 253, + 506, + 267 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 506, + 267 + ], + "score": 1.0, + "content": "in Appendix A.9.1). Plugging in this estimate back into Eq. 6 gives the desired high-confidence lower", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 264, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 506, + 278 + ], + "score": 1.0, + "content": "bound in step 3. Details of both subroutines ESTIMATEOPT and UPPERCONFIDENCEBOUND used", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 276, + 347, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 347, + 288 + ], + "score": 1.0, + "content": "in Algorithm 1 are given in Algorithm 3 in Appendix A.9.2.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 504, + 315 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 306 + ], + "score": 1.0, + "content": "Our next theorem concerns the specialization of this verification procedure to the information-limited", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 301, + 140, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 140, + 319 + ], + "score": 1.0, + "content": "setting.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 318, + 505, + 363 + ], + "lines": [ + { + "bbox": [ + 106, + 318, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 386, + 330 + ], + "score": 1.0, + "content": "Theorem 2 (Verifying information-limited robust certification). Let", + "type": "text" + }, + { + "bbox": [ + 387, + 320, + 402, + 330 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 318, + 505, + 330 + ], + "score": 1.0, + "content": "be as in Theorem 1, and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 107, + 330, + 505, + 342 + ], + "spans": [ + { + "bbox": [ + 107, + 330, + 115, + 340 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 330, + 133, + 342 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 133, + 330, + 144, + 341 + ], + "score": 0.82, + "content": "\\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 330, + 148, + 342 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 148, + 330, + 158, + 341 + ], + "score": 0.79, + "content": "\\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 330, + 368, + 342 + ], + "score": 1.0, + "content": "be as in Definition 2.1. The class of specifications", + "type": "text" + }, + { + "bbox": [ + 368, + 330, + 376, + 340 + ], + "score": 0.84, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 330, + 505, + 342 + ], + "score": 1.0, + "content": "is information-limited robustly", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 151, + 354 + ], + "score": 1.0, + "content": "certified at", + "type": "text" + }, + { + "bbox": [ + 151, + 343, + 158, + 352 + ], + "score": 0.83, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 340, + 219, + 354 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 219, + 342, + 236, + 352 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 340, + 505, + 354 + ], + "score": 1.0, + "content": "(cf. Definition 2.1) if and only if the optimal value of the following", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 352, + 291, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 291, + 364 + ], + "score": 1.0, + "content": "convex optimization problem is non-negative:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 167, + 368, + 443, + 405 + ], + "lines": [ + { + "bbox": [ + 167, + 368, + 443, + 405 + ], + "spans": [ + { + "bbox": [ + 167, + 368, + 443, + 405 + ], + "score": 0.91, + "content": "\\begin{array} { r l } { \\underset { \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } \\geq 0 } { \\operatorname* { m i n } } } & { \\zeta _ { a } - \\zeta _ { b } } \\\\ { \\mathrm { S u b j e c t ~ t o } } & { \\zeta _ { a } + \\zeta _ { b } + \\zeta _ { c } = 1 } \\end{array} , \\quad D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i } \\quad i = 1 , \\dots , M \\ ,", + "type": "interline_equation", + "image_path": "392c4613b2cdeb1d1f9c9bca7fa2a97540eb13589960aba2f5a78dfa03703916.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 167, + 368, + 443, + 380.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 167, + 380.3333333333333, + 443, + 392.66666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 167, + 392.66666666666663, + 443, + 404.99999999999994 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 410, + 487, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 409, + 488, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 133, + 424 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 410, + 235, + 422 + ], + "score": 0.91, + "content": "\\theta = ( \\theta _ { a } , \\theta _ { b } , 1 - \\theta _ { a } - \\theta _ { b } )", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 409, + 253, + 424 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 253, + 410, + 315, + 422 + ], + "score": 0.93, + "content": "\\zeta = ( \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } )", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 409, + 488, + 424 + ], + "score": 1.0, + "content": "are interpreted as probability distributions.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 431, + 505, + 465 + ], + "lines": [ + { + "bbox": [ + 106, + 432, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 506, + 444 + ], + "score": 1.0, + "content": "The proof of Theorem 2 is presented in Appendix A.5. It is based on the fact that in the information-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "limited setting, it is possible to directly compute the expectation in Eq. 6, and in fact this expectation", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 452, + 308, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 174, + 466 + ], + "score": 1.0, + "content": "only depends on", + "type": "text" + }, + { + "bbox": [ + 174, + 454, + 182, + 465 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 452, + 264, + 466 + ], + "score": 1.0, + "content": "via the probabilities", + "type": "text" + }, + { + "bbox": [ + 264, + 454, + 275, + 465 + ], + "score": 0.88, + "content": "\\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 452, + 293, + 466 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 293, + 453, + 303, + 465 + ], + "score": 0.88, + "content": "\\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 452, + 308, + 466 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 470, + 506, + 537 + ], + "lines": [ + { + "bbox": [ + 106, + 471, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 471, + 505, + 482 + ], + "score": 1.0, + "content": "Theorem 2 naturally leads to a certification algorithm, presented in Algorithm 2. It simply uses", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 482, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 482, + 505, + 493 + ], + "score": 1.0, + "content": "the same procedure as Cohen et al. (2019, Section 3.2) to compute a high-confidence lower bound", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 491, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 118, + 505 + ], + "score": 0.86, + "content": "\\underline { { \\theta } } _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 491, + 506, + 506 + ], + "score": 1.0, + "content": "on the probability of the correct class under randomized smoothing and then solves the convex", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 503, + 507, + 516 + ], + "spans": [ + { + "bbox": [ + 104, + 503, + 507, + 516 + ], + "score": 1.0, + "content": "optimization problem Eq. 7. Again, we can use an off-the-shelf solver CVXPY (Diamond & Boyd,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 514, + 507, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 228, + 527 + ], + "score": 1.0, + "content": "2016) in step 2 for the general", + "type": "text" + }, + { + "bbox": [ + 229, + 515, + 259, + 525 + ], + "score": 0.9, + "content": "M > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 514, + 471, + 527 + ], + "score": 1.0, + "content": "case, but closed-form solutions are also available for", + "type": "text" + }, + { + "bbox": [ + 472, + 515, + 502, + 524 + ], + "score": 0.9, + "content": "M = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 514, + 507, + 527 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 525, + 282, + 538 + ], + "spans": [ + { + "bbox": [ + 106, + 525, + 282, + 538 + ], + "score": 1.0, + "content": "these are given in Table 4 in Appendix A.6.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30.5 + }, + { + "type": "title", + "bbox": [ + 108, + 550, + 291, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 549, + 293, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 293, + 561 + ], + "score": 1.0, + "content": "Algorithm 2 Information-limited certification", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 563, + 505, + 587 + ], + "lines": [ + { + "bbox": [ + 105, + 561, + 502, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 249, + 577 + ], + "score": 1.0, + "content": "Inputs: Query access to classifier", + "type": "text" + }, + { + "bbox": [ + 249, + 564, + 256, + 573 + ], + "score": 0.79, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 561, + 314, + 577 + ], + "score": 1.0, + "content": ", correct label", + "type": "text" + }, + { + "bbox": [ + 315, + 566, + 321, + 575 + ], + "score": 0.77, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 561, + 496, + 577 + ], + "score": 1.0, + "content": ", sampling access to reference distribution", + "type": "text" + }, + { + "bbox": [ + 496, + 566, + 502, + 575 + ], + "score": 0.75, + "content": "\\rho", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 574, + 385, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 156, + 588 + ], + "score": 1.0, + "content": "divergences", + "type": "text" + }, + { + "bbox": [ + 156, + 576, + 165, + 587 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 575, + 214, + 588 + ], + "score": 1.0, + "content": "and bounds", + "type": "text" + }, + { + "bbox": [ + 215, + 577, + 223, + 586 + ], + "score": 0.83, + "content": "\\epsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 575, + 279, + 588 + ], + "score": 1.0, + "content": ", sample sizes", + "type": "text" + }, + { + "bbox": [ + 280, + 574, + 304, + 586 + ], + "score": 0.26, + "content": "N , { \\tilde { N } }", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 575, + 375, + 588 + ], + "score": 1.0, + "content": ", confidence level", + "type": "text" + }, + { + "bbox": [ + 375, + 576, + 381, + 587 + ], + "score": 0.79, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 575, + 385, + 588 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 110, + 587, + 501, + 637 + ], + "lines": [ + { + "bbox": [ + 110, + 586, + 452, + 602 + ], + "spans": [ + { + "bbox": [ + 110, + 586, + 156, + 602 + ], + "score": 1.0, + "content": "1: Sample", + "type": "text" + }, + { + "bbox": [ + 156, + 587, + 228, + 600 + ], + "score": 0.91, + "content": "X ^ { 1 } , \\ldots , X ^ { N } \\sim \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 586, + 300, + 602 + ], + "score": 1.0, + "content": "and test3 whether", + "type": "text" + }, + { + "bbox": [ + 300, + 588, + 449, + 601 + ], + "score": 0.88, + "content": "y = \\arg \\operatorname* { m a x } _ { y ^ { \\prime } \\in \\mathcal { V } } \\mathbb { P } _ { X \\sim \\rho } [ h ( X ) = y ^ { \\prime } ] .", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 586, + 452, + 602 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 109, + 600, + 496, + 617 + ], + "spans": [ + { + "bbox": [ + 109, + 600, + 155, + 617 + ], + "score": 1.0, + "content": "2: Sample", + "type": "text" + }, + { + "bbox": [ + 156, + 600, + 228, + 615 + ], + "score": 0.94, + "content": "X ^ { 1 } , \\dotsc , X ^ { \\tilde { N } } \\dotsc \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 600, + 321, + 617 + ], + "score": 1.0, + "content": "and compute4 a bound", + "type": "text" + }, + { + "bbox": [ + 321, + 603, + 419, + 615 + ], + "score": 0.9, + "content": "\\mathbb { P } _ { X \\sim \\rho } [ h ( X ) = y ^ { \\prime } ] \\geq \\underline { { \\theta } } _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 600, + 485, + 617 + ], + "score": 1.0, + "content": "with confidence", + "type": "text" + }, + { + "bbox": [ + 486, + 604, + 492, + 615 + ], + "score": 0.83, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 600, + 496, + 617 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 110, + 613, + 363, + 627 + ], + "spans": [ + { + "bbox": [ + 110, + 613, + 153, + 627 + ], + "score": 1.0, + "content": "3: Obtain", + "type": "text" + }, + { + "bbox": [ + 153, + 615, + 164, + 624 + ], + "score": 0.87, + "content": "o ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 613, + 253, + 627 + ], + "score": 1.0, + "content": "by solving Eq. 7 with", + "type": "text" + }, + { + "bbox": [ + 253, + 614, + 289, + 626 + ], + "score": 0.93, + "content": "\\theta _ { a } \\gets \\underline { { \\theta _ { a } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 613, + 307, + 627 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 307, + 615, + 359, + 626 + ], + "score": 0.9, + "content": "\\theta _ { b } \\gets 1 - \\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 613, + 363, + 627 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 110, + 624, + 371, + 637 + ], + "spans": [ + { + "bbox": [ + 110, + 624, + 132, + 637 + ], + "score": 1.0, + "content": "4: If", + "type": "text" + }, + { + "bbox": [ + 133, + 626, + 162, + 636 + ], + "score": 0.9, + "content": "o ^ { * } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 624, + 371, + 637 + ], + "score": 1.0, + "content": "return CERTIFIED else return NOT CERTIFIED.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5 + }, + { + "type": "title", + "bbox": [ + 108, + 664, + 405, + 677 + ], + "lines": [ + { + "bbox": [ + 104, + 663, + 405, + 679 + ], + "spans": [ + { + "bbox": [ + 104, + 663, + 405, + 679 + ], + "score": 1.0, + "content": "4 THEORETICAL ANALYSIS OF CERTIFICATION METHODS", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 503, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 703 + ], + "score": 1.0, + "content": "We now present theoretical results characterizing our certification methods and show the following:", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 710, + 315, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 709, + 303, + 722 + ], + "spans": [ + { + "bbox": [ + 118, + 709, + 303, + 722 + ], + "score": 1.0, + "content": "3Using the algorithm from Hung & Fithian (2019).", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 720, + 316, + 733 + ], + "spans": [ + { + "bbox": [ + 118, + 720, + 316, + 733 + ], + "score": 1.0, + "content": "4Using the algorithm from Clopper & Pearson (1934).", + "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, + 309, + 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": [ + 105, + 82, + 457, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 459, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 459, + 95 + ], + "score": 1.0, + "content": "Algorithm 1 Full information certification (see appendix A.9 for details of subroutines)", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 459, + 95 + ] + }, + { + "type": "list", + "bbox": [ + 105, + 95, + 506, + 162 + ], + "lines": [ + { + "bbox": [ + 105, + 95, + 507, + 110 + ], + "spans": [ + { + "bbox": [ + 105, + 95, + 262, + 110 + ], + "score": 1.0, + "content": "Inputs: Query access to specification", + "type": "text" + }, + { + "bbox": [ + 263, + 96, + 323, + 108 + ], + "score": 0.89, + "content": "\\phi : \\mathcal { X } [ a , b ]", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 95, + 496, + 110 + ], + "score": 1.0, + "content": ", sampling access to reference distribution", + "type": "text" + }, + { + "bbox": [ + 496, + 99, + 502, + 108 + ], + "score": 0.71, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 95, + 507, + 110 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 108, + 385, + 121 + ], + "spans": [ + { + "bbox": [ + 106, + 108, + 156, + 121 + ], + "score": 1.0, + "content": "divergences", + "type": "text" + }, + { + "bbox": [ + 156, + 109, + 165, + 120 + ], + "score": 0.88, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 108, + 214, + 121 + ], + "score": 1.0, + "content": "and bounds", + "type": "text" + }, + { + "bbox": [ + 215, + 110, + 223, + 120 + ], + "score": 0.84, + "content": "\\epsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 108, + 279, + 121 + ], + "score": 1.0, + "content": ", sample sizes", + "type": "text" + }, + { + "bbox": [ + 280, + 109, + 290, + 119 + ], + "score": 0.58, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 108, + 293, + 121 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 294, + 108, + 304, + 119 + ], + "score": 0.74, + "content": "\\tilde { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 108, + 375, + 121 + ], + "score": 1.0, + "content": ", confidence level", + "type": "text" + }, + { + "bbox": [ + 375, + 109, + 381, + 120 + ], + "score": 0.8, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 108, + 385, + 121 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2, + "is_list_end_line": true + }, + { + "bbox": [ + 108, + 118, + 340, + 138 + ], + "spans": [ + { + "bbox": [ + 108, + 118, + 123, + 138 + ], + "score": 1.0, + "content": "1:", + "type": "text" + }, + { + "bbox": [ + 123, + 122, + 135, + 132 + ], + "score": 0.58, + "content": "\\kappa ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 121, + 335, + 134 + ], + "score": 0.44, + "content": "\\lambda ^ { * } \\gets \\mathrm { E S T I M A T E O P T } ( \\rho , \\phi , N , \\{ f _ { i } \\} _ { i = 1 } ^ { M } , \\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } ) .", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 118, + 340, + 138 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 109, + 132, + 440, + 149 + ], + "spans": [ + { + "bbox": [ + 109, + 132, + 123, + 149 + ], + "score": 1.0, + "content": "2:", + "type": "text" + }, + { + "bbox": [ + 123, + 135, + 155, + 146 + ], + "score": 0.78, + "content": "E _ { u b } \\gets", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 132, + 345, + 149 + ], + "score": 1.0, + "content": "UPPERCONFIDENCEBOUND(ρ, φ, N, ˜ {fi}Mi=1,", + "type": "text" + }, + { + "bbox": [ + 345, + 133, + 440, + 147 + ], + "score": 0.42, + "content": "\\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } , a , b , \\lambda ^ { * } , \\kappa ^ { * } , \\zeta ) .", + "type": "inline_equation" + } + ], + "index": 4, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 109, + 146, + 457, + 163 + ], + "spans": [ + { + "bbox": [ + 109, + 146, + 132, + 163 + ], + "score": 1.0, + "content": "3: If", + "type": "text" + }, + { + "bbox": [ + 133, + 146, + 246, + 161 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\kappa ^ { * } - \\sum _ { i = 1 } ^ { M } \\lambda _ { i } ^ { * } \\epsilon _ { i } - E _ { u b } \\geq 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 146, + 457, + 163 + ], + "score": 1.0, + "content": "return CERTIFIED else return NOT CERTIFIED.", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 3, + "bbox_fs": [ + 105, + 95, + 507, + 163 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 185, + 506, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 230, + 199 + ], + "score": 1.0, + "content": "& Boyd, 2016). This gives us", + "type": "text" + }, + { + "bbox": [ + 230, + 186, + 256, + 197 + ], + "score": 0.76, + "content": "\\kappa ^ { * } , \\lambda ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 185, + 390, + 199 + ], + "score": 1.0, + "content": ", the estimated optimal values of", + "type": "text" + }, + { + "bbox": [ + 390, + 188, + 398, + 196 + ], + "score": 0.78, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 185, + 416, + 199 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 416, + 186, + 423, + 196 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 185, + 505, + 199 + ], + "score": 1.0, + "content": ", respectively. Then", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 197, + 506, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 506, + 209 + ], + "score": 1.0, + "content": "we take these values and compute a high-confidence lower bound on the objective function of Eq. 6,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 207, + 506, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 506, + 221 + ], + "score": 1.0, + "content": "which is then used to verify robustness. In particular, in step 2, we compute a high-confidence upper", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 218, + 506, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 135, + 233 + ], + "score": 1.0, + "content": "bound", + "type": "text" + }, + { + "bbox": [ + 135, + 219, + 152, + 230 + ], + "score": 0.9, + "content": "E _ { u b }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 218, + 357, + 233 + ], + "score": 1.0, + "content": "on the expectation term in the objective such that", + "type": "text" + }, + { + "bbox": [ + 358, + 219, + 483, + 231 + ], + "score": 0.94, + "content": "E _ { u b } \\ge \\mathrm { E } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa ^ { * } - \\phi ( X ) ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 218, + 506, + 233 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 230, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 182, + 245 + ], + "score": 1.0, + "content": "probability at least", + "type": "text" + }, + { + "bbox": [ + 183, + 232, + 189, + 243 + ], + "score": 0.8, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 232, + 324, + 245 + ], + "score": 1.0, + "content": "; this computation involves taking", + "type": "text" + }, + { + "bbox": [ + 325, + 230, + 335, + 242 + ], + "score": 0.86, + "content": "\\tilde { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 232, + 443, + 245 + ], + "score": 1.0, + "content": "independent samples from", + "type": "text" + }, + { + "bbox": [ + 443, + 234, + 450, + 243 + ], + "score": 0.8, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 232, + 506, + 245 + ], + "score": 1.0, + "content": "and finding a", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 243, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 505, + 255 + ], + "score": 1.0, + "content": "confidence interval around the resulting empirical estimate of the expectation (for details, see Eq. 25", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 253, + 506, + 267 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 506, + 267 + ], + "score": 1.0, + "content": "in Appendix A.9.1). Plugging in this estimate back into Eq. 6 gives the desired high-confidence lower", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 264, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 506, + 278 + ], + "score": 1.0, + "content": "bound in step 3. Details of both subroutines ESTIMATEOPT and UPPERCONFIDENCEBOUND used", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 276, + 347, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 347, + 288 + ], + "score": 1.0, + "content": "in Algorithm 1 are given in Algorithm 3 in Appendix A.9.2.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 10, + "bbox_fs": [ + 104, + 185, + 506, + 288 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 504, + 315 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 306 + ], + "score": 1.0, + "content": "Our next theorem concerns the specialization of this verification procedure to the information-limited", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 301, + 140, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 301, + 140, + 319 + ], + "score": 1.0, + "content": "setting.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 291, + 505, + 319 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 318, + 505, + 363 + ], + "lines": [ + { + "bbox": [ + 106, + 318, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 386, + 330 + ], + "score": 1.0, + "content": "Theorem 2 (Verifying information-limited robust certification). Let", + "type": "text" + }, + { + "bbox": [ + 387, + 320, + 402, + 330 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 318, + 505, + 330 + ], + "score": 1.0, + "content": "be as in Theorem 1, and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 107, + 330, + 505, + 342 + ], + "spans": [ + { + "bbox": [ + 107, + 330, + 115, + 340 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 330, + 133, + 342 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 133, + 330, + 144, + 341 + ], + "score": 0.82, + "content": "\\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 330, + 148, + 342 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 148, + 330, + 158, + 341 + ], + "score": 0.79, + "content": "\\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 330, + 368, + 342 + ], + "score": 1.0, + "content": "be as in Definition 2.1. The class of specifications", + "type": "text" + }, + { + "bbox": [ + 368, + 330, + 376, + 340 + ], + "score": 0.84, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 330, + 505, + 342 + ], + "score": 1.0, + "content": "is information-limited robustly", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 151, + 354 + ], + "score": 1.0, + "content": "certified at", + "type": "text" + }, + { + "bbox": [ + 151, + 343, + 158, + 352 + ], + "score": 0.83, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 340, + 219, + 354 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 219, + 342, + 236, + 352 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 340, + 505, + 354 + ], + "score": 1.0, + "content": "(cf. Definition 2.1) if and only if the optimal value of the following", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 352, + 291, + 364 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 291, + 364 + ], + "score": 1.0, + "content": "convex optimization problem is non-negative:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 318, + 505, + 364 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 167, + 368, + 443, + 405 + ], + "lines": [ + { + "bbox": [ + 167, + 368, + 443, + 405 + ], + "spans": [ + { + "bbox": [ + 167, + 368, + 443, + 405 + ], + "score": 0.91, + "content": "\\begin{array} { r l } { \\underset { \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } \\geq 0 } { \\operatorname* { m i n } } } & { \\zeta _ { a } - \\zeta _ { b } } \\\\ { \\mathrm { S u b j e c t ~ t o } } & { \\zeta _ { a } + \\zeta _ { b } + \\zeta _ { c } = 1 } \\end{array} , \\quad D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i } \\quad i = 1 , \\dots , M \\ ,", + "type": "interline_equation", + "image_path": "392c4613b2cdeb1d1f9c9bca7fa2a97540eb13589960aba2f5a78dfa03703916.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 167, + 368, + 443, + 380.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 167, + 380.3333333333333, + 443, + 392.66666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 167, + 392.66666666666663, + 443, + 404.99999999999994 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 410, + 487, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 409, + 488, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 133, + 424 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 410, + 235, + 422 + ], + "score": 0.91, + "content": "\\theta = ( \\theta _ { a } , \\theta _ { b } , 1 - \\theta _ { a } - \\theta _ { b } )", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 409, + 253, + 424 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 253, + 410, + 315, + 422 + ], + "score": 0.93, + "content": "\\zeta = ( \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } )", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 409, + 488, + 424 + ], + "score": 1.0, + "content": "are interpreted as probability distributions.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 409, + 488, + 424 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 431, + 505, + 465 + ], + "lines": [ + { + "bbox": [ + 106, + 432, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 506, + 444 + ], + "score": 1.0, + "content": "The proof of Theorem 2 is presented in Appendix A.5. It is based on the fact that in the information-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "limited setting, it is possible to directly compute the expectation in Eq. 6, and in fact this expectation", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 452, + 308, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 174, + 466 + ], + "score": 1.0, + "content": "only depends on", + "type": "text" + }, + { + "bbox": [ + 174, + 454, + 182, + 465 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 452, + 264, + 466 + ], + "score": 1.0, + "content": "via the probabilities", + "type": "text" + }, + { + "bbox": [ + 264, + 454, + 275, + 465 + ], + "score": 0.88, + "content": "\\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 452, + 293, + 466 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 293, + 453, + 303, + 465 + ], + "score": 0.88, + "content": "\\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 452, + 308, + 466 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 432, + 506, + 466 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 470, + 506, + 537 + ], + "lines": [ + { + "bbox": [ + 106, + 471, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 106, + 471, + 505, + 482 + ], + "score": 1.0, + "content": "Theorem 2 naturally leads to a certification algorithm, presented in Algorithm 2. It simply uses", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 482, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 482, + 505, + 493 + ], + "score": 1.0, + "content": "the same procedure as Cohen et al. (2019, Section 3.2) to compute a high-confidence lower bound", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 491, + 506, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 118, + 505 + ], + "score": 0.86, + "content": "\\underline { { \\theta } } _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 491, + 506, + 506 + ], + "score": 1.0, + "content": "on the probability of the correct class under randomized smoothing and then solves the convex", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 503, + 507, + 516 + ], + "spans": [ + { + "bbox": [ + 104, + 503, + 507, + 516 + ], + "score": 1.0, + "content": "optimization problem Eq. 7. Again, we can use an off-the-shelf solver CVXPY (Diamond & Boyd,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 514, + 507, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 228, + 527 + ], + "score": 1.0, + "content": "2016) in step 2 for the general", + "type": "text" + }, + { + "bbox": [ + 229, + 515, + 259, + 525 + ], + "score": 0.9, + "content": "M > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 514, + 471, + 527 + ], + "score": 1.0, + "content": "case, but closed-form solutions are also available for", + "type": "text" + }, + { + "bbox": [ + 472, + 515, + 502, + 524 + ], + "score": 0.9, + "content": "M = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 514, + 507, + 527 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 525, + 282, + 538 + ], + "spans": [ + { + "bbox": [ + 106, + 525, + 282, + 538 + ], + "score": 1.0, + "content": "these are given in Table 4 in Appendix A.6.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30.5, + "bbox_fs": [ + 104, + 471, + 507, + 538 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 550, + 291, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 549, + 293, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 293, + 561 + ], + "score": 1.0, + "content": "Algorithm 2 Information-limited certification", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 563, + 505, + 587 + ], + "lines": [ + { + "bbox": [ + 105, + 561, + 502, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 249, + 577 + ], + "score": 1.0, + "content": "Inputs: Query access to classifier", + "type": "text" + }, + { + "bbox": [ + 249, + 564, + 256, + 573 + ], + "score": 0.79, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 561, + 314, + 577 + ], + "score": 1.0, + "content": ", correct label", + "type": "text" + }, + { + "bbox": [ + 315, + 566, + 321, + 575 + ], + "score": 0.77, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 561, + 496, + 577 + ], + "score": 1.0, + "content": ", sampling access to reference distribution", + "type": "text" + }, + { + "bbox": [ + 496, + 566, + 502, + 575 + ], + "score": 0.75, + "content": "\\rho", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 574, + 385, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 156, + 588 + ], + "score": 1.0, + "content": "divergences", + "type": "text" + }, + { + "bbox": [ + 156, + 576, + 165, + 587 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 575, + 214, + 588 + ], + "score": 1.0, + "content": "and bounds", + "type": "text" + }, + { + "bbox": [ + 215, + 577, + 223, + 586 + ], + "score": 0.83, + "content": "\\epsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 575, + 279, + 588 + ], + "score": 1.0, + "content": ", sample sizes", + "type": "text" + }, + { + "bbox": [ + 280, + 574, + 304, + 586 + ], + "score": 0.26, + "content": "N , { \\tilde { N } }", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 575, + 375, + 588 + ], + "score": 1.0, + "content": ", confidence level", + "type": "text" + }, + { + "bbox": [ + 375, + 576, + 381, + 587 + ], + "score": 0.79, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 575, + 385, + 588 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 561, + 502, + 588 + ] + }, + { + "type": "index", + "bbox": [ + 110, + 587, + 501, + 637 + ], + "lines": [ + { + "bbox": [ + 110, + 586, + 452, + 602 + ], + "spans": [ + { + "bbox": [ + 110, + 586, + 156, + 602 + ], + "score": 1.0, + "content": "1: Sample", + "type": "text" + }, + { + "bbox": [ + 156, + 587, + 228, + 600 + ], + "score": 0.91, + "content": "X ^ { 1 } , \\ldots , X ^ { N } \\sim \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 586, + 300, + 602 + ], + "score": 1.0, + "content": "and test3 whether", + "type": "text" + }, + { + "bbox": [ + 300, + 588, + 449, + 601 + ], + "score": 0.88, + "content": "y = \\arg \\operatorname* { m a x } _ { y ^ { \\prime } \\in \\mathcal { V } } \\mathbb { P } _ { X \\sim \\rho } [ h ( X ) = y ^ { \\prime } ] .", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 586, + 452, + 602 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 109, + 600, + 496, + 617 + ], + "spans": [ + { + "bbox": [ + 109, + 600, + 155, + 617 + ], + "score": 1.0, + "content": "2: Sample", + "type": "text" + }, + { + "bbox": [ + 156, + 600, + 228, + 615 + ], + "score": 0.94, + "content": "X ^ { 1 } , \\dotsc , X ^ { \\tilde { N } } \\dotsc \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 600, + 321, + 617 + ], + "score": 1.0, + "content": "and compute4 a bound", + "type": "text" + }, + { + "bbox": [ + 321, + 603, + 419, + 615 + ], + "score": 0.9, + "content": "\\mathbb { P } _ { X \\sim \\rho } [ h ( X ) = y ^ { \\prime } ] \\geq \\underline { { \\theta } } _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 600, + 485, + 617 + ], + "score": 1.0, + "content": "with confidence", + "type": "text" + }, + { + "bbox": [ + 486, + 604, + 492, + 615 + ], + "score": 0.83, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 600, + 496, + 617 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 613, + 363, + 627 + ], + "spans": [ + { + "bbox": [ + 110, + 613, + 153, + 627 + ], + "score": 1.0, + "content": "3: Obtain", + "type": "text" + }, + { + "bbox": [ + 153, + 615, + 164, + 624 + ], + "score": 0.87, + "content": "o ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 613, + 253, + 627 + ], + "score": 1.0, + "content": "by solving Eq. 7 with", + "type": "text" + }, + { + "bbox": [ + 253, + 614, + 289, + 626 + ], + "score": 0.93, + "content": "\\theta _ { a } \\gets \\underline { { \\theta _ { a } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 613, + 307, + 627 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 307, + 615, + 359, + 626 + ], + "score": 0.9, + "content": "\\theta _ { b } \\gets 1 - \\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 613, + 363, + 627 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 110, + 624, + 371, + 637 + ], + "spans": [ + { + "bbox": [ + 110, + 624, + 132, + 637 + ], + "score": 1.0, + "content": "4: If", + "type": "text" + }, + { + "bbox": [ + 133, + 626, + 162, + 636 + ], + "score": 0.9, + "content": "o ^ { * } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 624, + 371, + 637 + ], + "score": 1.0, + "content": "return CERTIFIED else return NOT CERTIFIED.", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true + } + ], + "index": 38.5, + "bbox_fs": [ + 109, + 586, + 496, + 637 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 664, + 405, + 677 + ], + "lines": [ + { + "bbox": [ + 104, + 663, + 405, + 679 + ], + "spans": [ + { + "bbox": [ + 104, + 663, + 405, + 679 + ], + "score": 1.0, + "content": "4 THEORETICAL ANALYSIS OF CERTIFICATION METHODS", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 689, + 503, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 703 + ], + "score": 1.0, + "content": "We now present theoretical results characterizing our certification methods and show the following:", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 687, + 505, + 703 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 112, + 82, + 506, + 131 + ], + "lines": [ + { + "bbox": [ + 114, + 82, + 506, + 94 + ], + "spans": [ + { + "bbox": [ + 114, + 82, + 506, + 94 + ], + "score": 1.0, + "content": "1. For smoothed probabilistic classifiers, the full-information certificate dominates the information-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 125, + 93, + 176, + 106 + ], + "spans": [ + { + "bbox": [ + 125, + 93, + 176, + 106 + ], + "score": 1.0, + "content": "limited one.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 112, + 106, + 506, + 121 + ], + "spans": [ + { + "bbox": [ + 112, + 106, + 330, + 121 + ], + "score": 1.0, + "content": "2. In the information-limited setting, if we define the", + "type": "text" + }, + { + "bbox": [ + 330, + 108, + 338, + 119 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 106, + 428, + 121 + ], + "score": 1.0, + "content": "-divergence relaxation", + "type": "text" + }, + { + "bbox": [ + 429, + 108, + 444, + 119 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 106, + 506, + 121 + ], + "score": 1.0, + "content": "using Hockey-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 126, + 119, + 488, + 131 + ], + "spans": [ + { + "bbox": [ + 126, + 119, + 488, + 131 + ], + "score": 1.0, + "content": "Stick divergences with specific parameters, then the computed certificate is provably tight.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "title", + "bbox": [ + 106, + 143, + 355, + 155 + ], + "lines": [ + { + "bbox": [ + 106, + 143, + 356, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 356, + 156 + ], + "score": 1.0, + "content": "4.1 ADVANTAGE OF FULL-INFORMATION CERTIFICATION", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 163, + 505, + 254 + ], + "lines": [ + { + "bbox": [ + 105, + 162, + 506, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 233, + 177 + ], + "score": 1.0, + "content": "Consider a soft binary classifier", + "type": "text" + }, + { + "bbox": [ + 233, + 164, + 296, + 176 + ], + "score": 0.92, + "content": "H : \\mathcal { X } [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 162, + 438, + 177 + ], + "score": 1.0, + "content": "that outputs the probability of label", + "type": "text" + }, + { + "bbox": [ + 438, + 165, + 452, + 174 + ], + "score": 0.81, + "content": "+ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 162, + 506, + 177 + ], + "score": 1.0, + "content": "and consider", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 173, + 507, + 189 + ], + "spans": [ + { + "bbox": [ + 104, + 173, + 136, + 189 + ], + "score": 1.0, + "content": "a point", + "type": "text" + }, + { + "bbox": [ + 136, + 175, + 163, + 185 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 173, + 184, + 189 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 184, + 174, + 236, + 186 + ], + "score": 0.89, + "content": "\\dot { H } ( x ) > 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 173, + 348, + 189 + ], + "score": 1.0, + "content": ". We define the specification", + "type": "text" + }, + { + "bbox": [ + 348, + 174, + 421, + 186 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\phi ( \\bar { x } ) = H ( x ) - \\frac { 1 } { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 173, + 507, + 189 + ], + "score": 1.0, + "content": ". Then, the smoothed", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 184, + 507, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 184, + 144, + 200 + ], + "score": 1.0, + "content": "classifier", + "type": "text" + }, + { + "bbox": [ + 144, + 186, + 251, + 199 + ], + "score": 0.9, + "content": "H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 184, + 307, + 200 + ], + "score": 1.0, + "content": "predicts label", + "type": "text" + }, + { + "bbox": [ + 307, + 186, + 321, + 196 + ], + "score": 0.85, + "content": "+ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 184, + 348, + 200 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 349, + 187, + 358, + 196 + ], + "score": 0.86, + "content": "x ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 184, + 379, + 200 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 380, + 187, + 434, + 198 + ], + "score": 0.89, + "content": "\\left\\| x ^ { \\prime } - x \\right\\| ^ { - } \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 184, + 488, + 200 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + }, + { + "bbox": [ + 488, + 186, + 495, + 198 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 184, + 507, + 200 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 252, + 211 + ], + "score": 1.0, + "content": "full-information robustly certified at", + "type": "text" + }, + { + "bbox": [ + 252, + 198, + 272, + 209 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 197, + 334, + 211 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 335, + 198, + 461, + 210 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\le \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 197, + 506, + 211 + ], + "score": 1.0, + "content": ". Note that", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 207, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 372, + 222 + ], + "score": 1.0, + "content": "the optimization in Theorem 1 depends on the full distribution of", + "type": "text" + }, + { + "bbox": [ + 373, + 209, + 456, + 221 + ], + "score": 0.87, + "content": "\\phi ( X ) \\in [ - 1 / 2 , 1 / 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 207, + 460, + 222 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 460, + 209, + 503, + 221 + ], + "score": 0.89, + "content": "X \\sim \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 207, + 506, + 222 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "score": 1.0, + "content": "On the other hand, to certify this robustness in the information-limited setting is equivalent to taking", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 230, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 173, + 243 + ], + "score": 1.0, + "content": "the specification", + "type": "text" + }, + { + "bbox": [ + 174, + 230, + 268, + 243 + ], + "score": 0.93, + "content": "\\phi ( x ) = 1 [ \\dot { H } ( x ) > 1 / 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 230, + 409, + 243 + ], + "score": 1.0, + "content": "(the indicator function of the event", + "type": "text" + }, + { + "bbox": [ + 410, + 230, + 462, + 243 + ], + "score": 0.92, + "content": "\\mathbf { \\bar { \\boldsymbol { H } } } ( x ) \\mathbf { \\bar { \\boldsymbol { { \\Sigma } } } } > 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 230, + 505, + 243 + ], + "score": 1.0, + "content": "), in which", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 241, + 393, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 258, + 255 + ], + "score": 1.0, + "content": "case the only information available is", + "type": "text" + }, + { + "bbox": [ + 258, + 241, + 388, + 255 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\dot { \\theta _ { a } } = H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 241, + 393, + 255 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 258, + 504, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 410, + 272 + ], + "score": 1.0, + "content": "To compare the two approaches, consider the objective of Eq. 6 with a single", + "type": "text" + }, + { + "bbox": [ + 410, + 259, + 417, + 270 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 257, + 505, + 272 + ], + "score": 1.0, + "content": "-divergence constraint", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 269, + 227, + 282 + ], + "spans": [ + { + "bbox": [ + 107, + 269, + 162, + 282 + ], + "score": 0.92, + "content": "D _ { f } ( \\nu \\| \\bar { \\rho } ) \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 269, + 227, + 282 + ], + "score": 1.0, + "content": ". Then, we have", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "interline_equation", + "bbox": [ + 146, + 284, + 464, + 396 + ], + "lines": [ + { + "bbox": [ + 146, + 284, + 464, + 396 + ], + "spans": [ + { + "bbox": [ + 146, + 284, + 464, + 396 + ], + "score": 0.96, + "content": "\\begin{array} { l } { { \\displaystyle \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] = \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\kappa - H ( X ) + \\frac 1 2 \\biggr ) \\biggr ] } } \\\\ { { \\displaystyle = \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\biggl ( \\kappa + \\frac 1 2 - 1 \\biggr ) H ( X ) + \\biggl ( \\kappa + \\frac 1 2 \\biggr ) ( 1 - H ( X ) ) \\biggr ) \\biggr ] } } \\\\ { { \\displaystyle \\geq \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( X ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\kappa - \\frac 1 2 \\biggr ) H ( X ) + f _ { \\lambda } ^ { * } \\biggl ( \\kappa + \\frac 1 2 \\biggr ) ( 1 - H ( X ) ) \\biggr ] } } \\\\ { { \\displaystyle = \\kappa - \\lambda \\epsilon - \\theta _ { a } f _ { \\lambda } ^ { * } \\biggl ( \\kappa - \\frac 1 2 \\biggr ) - ( 1 - \\theta _ { a } ) f _ { \\lambda } ^ { * } \\biggl ( \\kappa + \\frac 1 2 \\biggr ) \\enspace , } } \\end{array}", + "type": "interline_equation", + "image_path": "b5bd4199b09b54ebba6a7b65ec6c4c9d5a46818a3714bff2523de2703bc1fbe9.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 146, + 284, + 464, + 321.3333333333333 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 146, + 321.3333333333333, + 464, + 358.66666666666663 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 146, + 358.66666666666663, + 464, + 395.99999999999994 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 397, + 505, + 441 + ], + "lines": [ + { + "bbox": [ + 105, + 396, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 506, + 410 + ], + "score": 1.0, + "content": "where the third line follows from Jensen’s inequality. The proof of Theorem 2 shows that maximizing", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 408, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 408, + 277, + 420 + ], + "score": 1.0, + "content": "the final expression above with respect to", + "type": "text" + }, + { + "bbox": [ + 278, + 408, + 295, + 419 + ], + "score": 0.85, + "content": "\\kappa , \\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 408, + 505, + 420 + ], + "score": 1.0, + "content": "is equivalent to the dual of the information-limited", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 419, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 431 + ], + "score": 1.0, + "content": "certification problem Eq. 7. Thus, the information-limited setting computes a weaker certificate than", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 430, + 293, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 293, + 442 + ], + "score": 1.0, + "content": "the full-information setting for soft classifiers:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 106, + 443, + 505, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 442, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 405, + 456 + ], + "score": 1.0, + "content": "Corollary 3. The optimization problem of Eq. 6 with the specification", + "type": "text" + }, + { + "bbox": [ + 406, + 444, + 413, + 455 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 442, + 505, + 456 + ], + "score": 1.0, + "content": "defined above has an", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 454, + 484, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 454, + 484, + 467 + ], + "score": 1.0, + "content": "optimal value that is greater than or equal to that of the optimization problem defined in Eq. 7.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "title", + "bbox": [ + 108, + 478, + 450, + 490 + ], + "lines": [ + { + "bbox": [ + 106, + 479, + 450, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 450, + 491 + ], + "score": 1.0, + "content": "4.2 TIGHT RELAXATIONS FOR INFORMATION-LIMITED ROBUST CERTIFICATION", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 498, + 505, + 555 + ], + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 474, + 513 + ], + "score": 1.0, + "content": "Ideally, we would like to certify robustness of specifications with respect to sets of the form", + "type": "text" + }, + { + "bbox": [ + 474, + 500, + 505, + 511 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { x , \\epsilon } =", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 509, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 107, + 510, + 202, + 523 + ], + "score": 0.91, + "content": "\\{ \\mu ( x ^ { \\prime } ) : d ( x , x ^ { \\prime } ) \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 509, + 451, + 525 + ], + "score": 1.0, + "content": ". The following result shows that the gap between the ideal", + "type": "text" + }, + { + "bbox": [ + 451, + 511, + 470, + 523 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 509, + 506, + 525 + ], + "score": 1.0, + "content": "and the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 520, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 203, + 534 + ], + "score": 1.0, + "content": "tractable constraint sets", + "type": "text" + }, + { + "bbox": [ + 204, + 522, + 219, + 533 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 520, + 506, + 534 + ], + "score": 1.0, + "content": "can be closed in the context of information-limited robust certification", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 532, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 453, + 545 + ], + "score": 1.0, + "content": "provided that we can measure hockey-stick divergences of every non-negative order", + "type": "text" + }, + { + "bbox": [ + 454, + 532, + 481, + 543 + ], + "score": 0.91, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 532, + 505, + 545 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 543, + 236, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 236, + 556 + ], + "score": 1.0, + "content": "proof is given in Appendix A.7.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 556, + 504, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 556, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 176, + 570 + ], + "score": 1.0, + "content": "Theorem 4. Let", + "type": "text" + }, + { + "bbox": [ + 177, + 557, + 234, + 568 + ], + "score": 0.91, + "content": "\\theta _ { a } , \\theta _ { b } , \\rho , \\mathcal { D } , S", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 556, + 363, + 570 + ], + "score": 1.0, + "content": "be as in Definition 2.1. Define", + "type": "text" + }, + { + "bbox": [ + 364, + 557, + 476, + 569 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\epsilon _ { \\beta } = \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 556, + 506, + 570 + ], + "score": 1.0, + "content": "for all", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 107, + 567, + 280, + 581 + ], + "spans": [ + { + "bbox": [ + 107, + 568, + 132, + 579 + ], + "score": 0.91, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 567, + 162, + 581 + ], + "score": 1.0, + "content": "and let", + "type": "text" + }, + { + "bbox": [ + 163, + 568, + 189, + 580 + ], + "score": 0.85, + "content": "\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 567, + 280, + 581 + ], + "score": 1.0, + "content": "be chosen as follows:", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 582, + 479, + 605 + ], + "lines": [ + { + "bbox": [ + 121, + 582, + 479, + 605 + ], + "spans": [ + { + "bbox": [ + 121, + 582, + 479, + 605 + ], + "score": 0.88, + "content": "\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * } = \\operatorname * { a r g m a x } _ { \\beta _ { a } \\ge \\beta _ { b } \\ge 0 } ~ 1 - \\beta _ { a } ( 1 - \\theta _ { a } ) - \\beta _ { b } \\theta _ { b } - \\left( \\epsilon _ { \\beta _ { a } } + [ 1 - \\beta _ { a } ] _ { + } \\right) - \\left( \\epsilon _ { \\beta _ { b } } + [ 1 - \\beta _ { b } ] _ { + } \\right) ~ .", + "type": "interline_equation", + "image_path": "114ff4f4e0e4030ba88d6244efaca0e87b9cf2bc6c97faac81a34fbad909d29f.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 121, + 582, + 479, + 605 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 607, + 205, + 618 + ], + "lines": [ + { + "bbox": [ + 106, + 605, + 206, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 206, + 619 + ], + "score": 1.0, + "content": "Define the constraint set", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 620, + 478, + 635 + ], + "lines": [ + { + "bbox": [ + 130, + 620, + 478, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 620, + 478, + 635 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\mathcal { D } _ { \\mathrm { H S } } = \\left\\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { \\mathrm { H S } ; \\beta _ { \\alpha } ^ { * } } \\left( \\nu \\mid \\mid \\rho \\right) \\leq \\epsilon _ { \\beta _ { \\alpha } ^ { * } } \\right\\} \\cap \\left\\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { \\mathrm { H S } ; \\beta _ { b } ^ { * } } \\left( \\nu \\mid \\mid \\rho \\right) \\leq \\epsilon _ { \\beta _ { b } ^ { * } } \\right\\} \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "05c76d3cca17d0e7601088a458bb148e7c8408896dc247c73aa909fd7020141b.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 130, + 620, + 478, + 635 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 505, + 670 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 507, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 131, + 649 + ], + "score": 1.0, + "content": "Then,", + "type": "text" + }, + { + "bbox": [ + 131, + 637, + 139, + 646 + ], + "score": 0.81, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 635, + 306, + 649 + ], + "score": 1.0, + "content": "is information-limited robustly certified at", + "type": "text" + }, + { + "bbox": [ + 306, + 638, + 313, + 648 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 635, + 373, + 649 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 374, + 637, + 383, + 646 + ], + "score": 0.79, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 635, + 437, + 649 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + }, + { + "bbox": [ + 437, + 637, + 445, + 646 + ], + "score": 0.78, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 635, + 507, + 649 + ], + "score": 1.0, + "content": "is information-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 217, + 660 + ], + "score": 1.0, + "content": "limited robustly certified at", + "type": "text" + }, + { + "bbox": [ + 217, + 649, + 223, + 659 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 648, + 285, + 660 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 286, + 648, + 305, + 658 + ], + "score": 0.9, + "content": "{ \\mathcal { D } } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 648, + 505, + 660 + ], + "score": 1.0, + "content": ". Thus, the optimal information-limited certificate", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 657, + 345, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 321, + 672 + ], + "score": 1.0, + "content": "in this case can be obtained by applying theorem 2 to", + "type": "text" + }, + { + "bbox": [ + 321, + 659, + 340, + 669 + ], + "score": 0.9, + "content": "{ \\mathcal { D } } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 657, + 345, + 672 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "title", + "bbox": [ + 107, + 685, + 300, + 698 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 302, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 302, + 700 + ], + "score": 1.0, + "content": "5 CONNECTIONS WITH PRIOR WORK", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "Table 1 summarizes the differences between our work and prior work in terms of the set of smoothing", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "measures admitted, the offline computation cost of the certification procedure (which needs to", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.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 2020", + "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": "list", + "bbox": [ + 112, + 82, + 506, + 131 + ], + "lines": [ + { + "bbox": [ + 114, + 82, + 506, + 94 + ], + "spans": [ + { + "bbox": [ + 114, + 82, + 506, + 94 + ], + "score": 1.0, + "content": "1. For smoothed probabilistic classifiers, the full-information certificate dominates the information-", + "type": "text" + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 125, + 93, + 176, + 106 + ], + "spans": [ + { + "bbox": [ + 125, + 93, + 176, + 106 + ], + "score": 1.0, + "content": "limited one.", + "type": "text" + } + ], + "index": 1, + "is_list_end_line": true + }, + { + "bbox": [ + 112, + 106, + 506, + 121 + ], + "spans": [ + { + "bbox": [ + 112, + 106, + 330, + 121 + ], + "score": 1.0, + "content": "2. In the information-limited setting, if we define the", + "type": "text" + }, + { + "bbox": [ + 330, + 108, + 338, + 119 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 106, + 428, + 121 + ], + "score": 1.0, + "content": "-divergence relaxation", + "type": "text" + }, + { + "bbox": [ + 429, + 108, + 444, + 119 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 106, + 506, + 121 + ], + "score": 1.0, + "content": "using Hockey-", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 126, + 119, + 488, + 131 + ], + "spans": [ + { + "bbox": [ + 126, + 119, + 488, + 131 + ], + "score": 1.0, + "content": "Stick divergences with specific parameters, then the computed certificate is provably tight.", + "type": "text" + } + ], + "index": 3, + "is_list_end_line": true + } + ], + "index": 1.5, + "bbox_fs": [ + 112, + 82, + 506, + 131 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 143, + 355, + 155 + ], + "lines": [ + { + "bbox": [ + 106, + 143, + 356, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 356, + 156 + ], + "score": 1.0, + "content": "4.1 ADVANTAGE OF FULL-INFORMATION CERTIFICATION", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 163, + 505, + 254 + ], + "lines": [ + { + "bbox": [ + 105, + 162, + 506, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 233, + 177 + ], + "score": 1.0, + "content": "Consider a soft binary classifier", + "type": "text" + }, + { + "bbox": [ + 233, + 164, + 296, + 176 + ], + "score": 0.92, + "content": "H : \\mathcal { X } [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 162, + 438, + 177 + ], + "score": 1.0, + "content": "that outputs the probability of label", + "type": "text" + }, + { + "bbox": [ + 438, + 165, + 452, + 174 + ], + "score": 0.81, + "content": "+ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 162, + 506, + 177 + ], + "score": 1.0, + "content": "and consider", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 173, + 507, + 189 + ], + "spans": [ + { + "bbox": [ + 104, + 173, + 136, + 189 + ], + "score": 1.0, + "content": "a point", + "type": "text" + }, + { + "bbox": [ + 136, + 175, + 163, + 185 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 173, + 184, + 189 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 184, + 174, + 236, + 186 + ], + "score": 0.89, + "content": "\\dot { H } ( x ) > 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 173, + 348, + 189 + ], + "score": 1.0, + "content": ". We define the specification", + "type": "text" + }, + { + "bbox": [ + 348, + 174, + 421, + 186 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\phi ( \\bar { x } ) = H ( x ) - \\frac { 1 } { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 173, + 507, + 189 + ], + "score": 1.0, + "content": ". Then, the smoothed", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 184, + 507, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 184, + 144, + 200 + ], + "score": 1.0, + "content": "classifier", + "type": "text" + }, + { + "bbox": [ + 144, + 186, + 251, + 199 + ], + "score": 0.9, + "content": "H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 184, + 307, + 200 + ], + "score": 1.0, + "content": "predicts label", + "type": "text" + }, + { + "bbox": [ + 307, + 186, + 321, + 196 + ], + "score": 0.85, + "content": "+ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 184, + 348, + 200 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 349, + 187, + 358, + 196 + ], + "score": 0.86, + "content": "x ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 184, + 379, + 200 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 380, + 187, + 434, + 198 + ], + "score": 0.89, + "content": "\\left\\| x ^ { \\prime } - x \\right\\| ^ { - } \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 184, + 488, + 200 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + }, + { + "bbox": [ + 488, + 186, + 495, + 198 + ], + "score": 0.85, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 184, + 507, + 200 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 252, + 211 + ], + "score": 1.0, + "content": "full-information robustly certified at", + "type": "text" + }, + { + "bbox": [ + 252, + 198, + 272, + 209 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 197, + 334, + 211 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 335, + 198, + 461, + 210 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\le \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 197, + 506, + 211 + ], + "score": 1.0, + "content": ". Note that", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 207, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 372, + 222 + ], + "score": 1.0, + "content": "the optimization in Theorem 1 depends on the full distribution of", + "type": "text" + }, + { + "bbox": [ + 373, + 209, + 456, + 221 + ], + "score": 0.87, + "content": "\\phi ( X ) \\in [ - 1 / 2 , 1 / 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 207, + 460, + 222 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 460, + 209, + 503, + 221 + ], + "score": 0.89, + "content": "X \\sim \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 207, + 506, + 222 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "score": 1.0, + "content": "On the other hand, to certify this robustness in the information-limited setting is equivalent to taking", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 230, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 173, + 243 + ], + "score": 1.0, + "content": "the specification", + "type": "text" + }, + { + "bbox": [ + 174, + 230, + 268, + 243 + ], + "score": 0.93, + "content": "\\phi ( x ) = 1 [ \\dot { H } ( x ) > 1 / 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 230, + 409, + 243 + ], + "score": 1.0, + "content": "(the indicator function of the event", + "type": "text" + }, + { + "bbox": [ + 410, + 230, + 462, + 243 + ], + "score": 0.92, + "content": "\\mathbf { \\bar { \\boldsymbol { H } } } ( x ) \\mathbf { \\bar { \\boldsymbol { { \\Sigma } } } } > 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 230, + 505, + 243 + ], + "score": 1.0, + "content": "), in which", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 241, + 393, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 258, + 255 + ], + "score": 1.0, + "content": "case the only information available is", + "type": "text" + }, + { + "bbox": [ + 258, + 241, + 388, + 255 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\dot { \\theta _ { a } } = H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 241, + 393, + 255 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8.5, + "bbox_fs": [ + 104, + 162, + 507, + 255 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 258, + 504, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 410, + 272 + ], + "score": 1.0, + "content": "To compare the two approaches, consider the objective of Eq. 6 with a single", + "type": "text" + }, + { + "bbox": [ + 410, + 259, + 417, + 270 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 257, + 505, + 272 + ], + "score": 1.0, + "content": "-divergence constraint", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 269, + 227, + 282 + ], + "spans": [ + { + "bbox": [ + 107, + 269, + 162, + 282 + ], + "score": 0.92, + "content": "D _ { f } ( \\nu \\| \\bar { \\rho } ) \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 269, + 227, + 282 + ], + "score": 1.0, + "content": ". Then, we have", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 257, + 505, + 282 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 146, + 284, + 464, + 396 + ], + "lines": [ + { + "bbox": [ + 146, + 284, + 464, + 396 + ], + "spans": [ + { + "bbox": [ + 146, + 284, + 464, + 396 + ], + "score": 0.96, + "content": "\\begin{array} { l } { { \\displaystyle \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] = \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\kappa - H ( X ) + \\frac 1 2 \\biggr ) \\biggr ] } } \\\\ { { \\displaystyle = \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\biggl ( \\kappa + \\frac 1 2 - 1 \\biggr ) H ( X ) + \\biggl ( \\kappa + \\frac 1 2 \\biggr ) ( 1 - H ( X ) ) \\biggr ) \\biggr ] } } \\\\ { { \\displaystyle \\geq \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( X ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\kappa - \\frac 1 2 \\biggr ) H ( X ) + f _ { \\lambda } ^ { * } \\biggl ( \\kappa + \\frac 1 2 \\biggr ) ( 1 - H ( X ) ) \\biggr ] } } \\\\ { { \\displaystyle = \\kappa - \\lambda \\epsilon - \\theta _ { a } f _ { \\lambda } ^ { * } \\biggl ( \\kappa - \\frac 1 2 \\biggr ) - ( 1 - \\theta _ { a } ) f _ { \\lambda } ^ { * } \\biggl ( \\kappa + \\frac 1 2 \\biggr ) \\enspace , } } \\end{array}", + "type": "interline_equation", + "image_path": "b5bd4199b09b54ebba6a7b65ec6c4c9d5a46818a3714bff2523de2703bc1fbe9.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 146, + 284, + 464, + 321.3333333333333 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 146, + 321.3333333333333, + 464, + 358.66666666666663 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 146, + 358.66666666666663, + 464, + 395.99999999999994 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 397, + 505, + 441 + ], + "lines": [ + { + "bbox": [ + 105, + 396, + 506, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 506, + 410 + ], + "score": 1.0, + "content": "where the third line follows from Jensen’s inequality. The proof of Theorem 2 shows that maximizing", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 408, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 408, + 277, + 420 + ], + "score": 1.0, + "content": "the final expression above with respect to", + "type": "text" + }, + { + "bbox": [ + 278, + 408, + 295, + 419 + ], + "score": 0.85, + "content": "\\kappa , \\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 408, + 505, + 420 + ], + "score": 1.0, + "content": "is equivalent to the dual of the information-limited", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 419, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 431 + ], + "score": 1.0, + "content": "certification problem Eq. 7. Thus, the information-limited setting computes a weaker certificate than", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 430, + 293, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 430, + 293, + 442 + ], + "score": 1.0, + "content": "the full-information setting for soft classifiers:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 396, + 506, + 442 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 443, + 505, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 442, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 405, + 456 + ], + "score": 1.0, + "content": "Corollary 3. The optimization problem of Eq. 6 with the specification", + "type": "text" + }, + { + "bbox": [ + 406, + 444, + 413, + 455 + ], + "score": 0.84, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 442, + 505, + 456 + ], + "score": 1.0, + "content": "defined above has an", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 454, + 484, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 454, + 484, + 467 + ], + "score": 1.0, + "content": "optimal value that is greater than or equal to that of the optimization problem defined in Eq. 7.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 106, + 442, + 505, + 467 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 478, + 450, + 490 + ], + "lines": [ + { + "bbox": [ + 106, + 479, + 450, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 450, + 491 + ], + "score": 1.0, + "content": "4.2 TIGHT RELAXATIONS FOR INFORMATION-LIMITED ROBUST CERTIFICATION", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 498, + 505, + 555 + ], + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 474, + 513 + ], + "score": 1.0, + "content": "Ideally, we would like to certify robustness of specifications with respect to sets of the form", + "type": "text" + }, + { + "bbox": [ + 474, + 500, + 505, + 511 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { x , \\epsilon } =", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 509, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 107, + 510, + 202, + 523 + ], + "score": 0.91, + "content": "\\{ \\mu ( x ^ { \\prime } ) : d ( x , x ^ { \\prime } ) \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 509, + 451, + 525 + ], + "score": 1.0, + "content": ". The following result shows that the gap between the ideal", + "type": "text" + }, + { + "bbox": [ + 451, + 511, + 470, + 523 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 509, + 506, + 525 + ], + "score": 1.0, + "content": "and the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 520, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 203, + 534 + ], + "score": 1.0, + "content": "tractable constraint sets", + "type": "text" + }, + { + "bbox": [ + 204, + 522, + 219, + 533 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 520, + 506, + 534 + ], + "score": 1.0, + "content": "can be closed in the context of information-limited robust certification", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 532, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 453, + 545 + ], + "score": 1.0, + "content": "provided that we can measure hockey-stick divergences of every non-negative order", + "type": "text" + }, + { + "bbox": [ + 454, + 532, + 481, + 543 + ], + "score": 0.91, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 532, + 505, + 545 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 543, + 236, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 236, + 556 + ], + "score": 1.0, + "content": "proof is given in Appendix A.7.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 498, + 506, + 556 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 556, + 504, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 556, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 176, + 570 + ], + "score": 1.0, + "content": "Theorem 4. Let", + "type": "text" + }, + { + "bbox": [ + 177, + 557, + 234, + 568 + ], + "score": 0.91, + "content": "\\theta _ { a } , \\theta _ { b } , \\rho , \\mathcal { D } , S", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 556, + 363, + 570 + ], + "score": 1.0, + "content": "be as in Definition 2.1. Define", + "type": "text" + }, + { + "bbox": [ + 364, + 557, + 476, + 569 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\epsilon _ { \\beta } = \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 556, + 506, + 570 + ], + "score": 1.0, + "content": "for all", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 107, + 567, + 280, + 581 + ], + "spans": [ + { + "bbox": [ + 107, + 568, + 132, + 579 + ], + "score": 0.91, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 567, + 162, + 581 + ], + "score": 1.0, + "content": "and let", + "type": "text" + }, + { + "bbox": [ + 163, + 568, + 189, + 580 + ], + "score": 0.85, + "content": "\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 567, + 280, + 581 + ], + "score": 1.0, + "content": "be chosen as follows:", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 556, + 506, + 581 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 582, + 479, + 605 + ], + "lines": [ + { + "bbox": [ + 121, + 582, + 479, + 605 + ], + "spans": [ + { + "bbox": [ + 121, + 582, + 479, + 605 + ], + "score": 0.88, + "content": "\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * } = \\operatorname * { a r g m a x } _ { \\beta _ { a } \\ge \\beta _ { b } \\ge 0 } ~ 1 - \\beta _ { a } ( 1 - \\theta _ { a } ) - \\beta _ { b } \\theta _ { b } - \\left( \\epsilon _ { \\beta _ { a } } + [ 1 - \\beta _ { a } ] _ { + } \\right) - \\left( \\epsilon _ { \\beta _ { b } } + [ 1 - \\beta _ { b } ] _ { + } \\right) ~ .", + "type": "interline_equation", + "image_path": "114ff4f4e0e4030ba88d6244efaca0e87b9cf2bc6c97faac81a34fbad909d29f.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 121, + 582, + 479, + 605 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 607, + 205, + 618 + ], + "lines": [ + { + "bbox": [ + 106, + 605, + 206, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 206, + 619 + ], + "score": 1.0, + "content": "Define the constraint set", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33, + "bbox_fs": [ + 106, + 605, + 206, + 619 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 620, + 478, + 635 + ], + "lines": [ + { + "bbox": [ + 130, + 620, + 478, + 635 + ], + "spans": [ + { + "bbox": [ + 130, + 620, + 478, + 635 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\mathcal { D } _ { \\mathrm { H S } } = \\left\\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { \\mathrm { H S } ; \\beta _ { \\alpha } ^ { * } } \\left( \\nu \\mid \\mid \\rho \\right) \\leq \\epsilon _ { \\beta _ { \\alpha } ^ { * } } \\right\\} \\cap \\left\\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { \\mathrm { H S } ; \\beta _ { b } ^ { * } } \\left( \\nu \\mid \\mid \\rho \\right) \\leq \\epsilon _ { \\beta _ { b } ^ { * } } \\right\\} \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "05c76d3cca17d0e7601088a458bb148e7c8408896dc247c73aa909fd7020141b.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 130, + 620, + 478, + 635 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 505, + 670 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 507, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 131, + 649 + ], + "score": 1.0, + "content": "Then,", + "type": "text" + }, + { + "bbox": [ + 131, + 637, + 139, + 646 + ], + "score": 0.81, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 635, + 306, + 649 + ], + "score": 1.0, + "content": "is information-limited robustly certified at", + "type": "text" + }, + { + "bbox": [ + 306, + 638, + 313, + 648 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 635, + 373, + 649 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 374, + 637, + 383, + 646 + ], + "score": 0.79, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 635, + 437, + 649 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + }, + { + "bbox": [ + 437, + 637, + 445, + 646 + ], + "score": 0.78, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 635, + 507, + 649 + ], + "score": 1.0, + "content": "is information-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 648, + 217, + 660 + ], + "score": 1.0, + "content": "limited robustly certified at", + "type": "text" + }, + { + "bbox": [ + 217, + 649, + 223, + 659 + ], + "score": 0.82, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 648, + 285, + 660 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 286, + 648, + 305, + 658 + ], + "score": 0.9, + "content": "{ \\mathcal { D } } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 648, + 505, + 660 + ], + "score": 1.0, + "content": ". Thus, the optimal information-limited certificate", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 657, + 345, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 321, + 672 + ], + "score": 1.0, + "content": "in this case can be obtained by applying theorem 2 to", + "type": "text" + }, + { + "bbox": [ + 321, + 659, + 340, + 669 + ], + "score": 0.9, + "content": "{ \\mathcal { D } } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 657, + 345, + 672 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 635, + 507, + 672 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 685, + 300, + 698 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 302, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 302, + 700 + ], + "score": 1.0, + "content": "5 CONNECTIONS WITH PRIOR WORK", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "Table 1 summarizes the differences between our work and prior work in terms of the set of smoothing", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "measures admitted, the offline computation cost of the certification procedure (which needs to", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 83, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 504, + 95 + ], + "score": 1.0, + "content": "be performed once for every possible perturbation size and choice of smoothing measure), the", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 374, + 106 + ], + "score": 1.0, + "content": "perturbations considered, whether they can use information beyond", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 375, + 94, + 398, + 105 + ], + "score": 0.92, + "content": "\\theta _ { a } , \\theta _ { b }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 399, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "to improve the certificates", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 507, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 507, + 118 + ], + "score": 1.0, + "content": "and whether they compute optimal certificates for a given smoothing measure in the information-", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 169, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 169, + 128 + ], + "score": 1.0, + "content": "limited setting.", + "type": "text", + "cross_page": true + } + ], + "index": 3 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 708, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 127 + ], + "lines": [ + { + "bbox": [ + 105, + 83, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 504, + 95 + ], + "score": 1.0, + "content": "be performed once for every possible perturbation size and choice of smoothing measure), the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 374, + 106 + ], + "score": 1.0, + "content": "perturbations considered, whether they can use information beyond", + "type": "text" + }, + { + "bbox": [ + 375, + 94, + 398, + 105 + ], + "score": 0.92, + "content": "\\theta _ { a } , \\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "to improve the certificates", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 507, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 507, + 118 + ], + "score": 1.0, + "content": "and whether they compute optimal certificates for a given smoothing measure in the information-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 169, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 169, + 128 + ], + "score": 1.0, + "content": "limited setting.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "table", + "bbox": [ + 112, + 136, + 499, + 241 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 112, + 136, + 499, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 112, + 136, + 499, + 241 + ], + "spans": [ + { + "bbox": [ + 112, + 136, + 499, + 241 + ], + "score": 0.983, + "html": "
μ(x))Computation-IUse additionalinformation?Optimal
Cohen et al. (2019)Gaussian0(1)l2XYes
Lee et al. (2019)FiniteSupport*0(d3)lOnly decision treesYes
Li et al. (2019)GaussianLaplacian0(1)l2lXNo
Lecuyer et al. (2019)Arbitrary0(1)AllepXNo
Our workArbitrary0(1)AllepArbitrary classifiersYes
", + "type": "table", + "image_path": "c57508577dadb223b408c2d9202c2b305bd1a1d469a5199fd5b315e5304ed52b.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 112, + 136, + 499, + 171.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 112, + 171.0, + 499, + 206.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 112, + 206.0, + 499, + 241.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 108, + 250, + 504, + 281 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 505, + 262 + ], + "score": 1.0, + "content": "Table 1: Comparison between black-box verification methods. * Technically, Lee et al. (2019) can handle", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 260, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 505, + 271 + ], + "score": 1.0, + "content": "smoothing measures such that the likelihood ratios take a finite set of values, but most practical instances of this", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 270, + 258, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 258, + 281 + ], + "score": 1.0, + "content": "correspond to finite-support distributions.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 505, + 348 + ], + "lines": [ + { + "bbox": [ + 106, + 293, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 106, + 293, + 505, + 305 + ], + "score": 1.0, + "content": "Cohen et al. (2019) study the problem of verifying hard classifiers smoothed by Gaussian noise, and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 303, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 106, + 303, + 269, + 317 + ], + "score": 1.0, + "content": "derive optimal certificates with respect to", + "type": "text" + }, + { + "bbox": [ + 270, + 304, + 280, + 315 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 303, + 505, + 317 + ], + "score": 1.0, + "content": "perturbations of the input. Their results can be recovered", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 315, + 506, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 506, + 327 + ], + "score": 1.0, + "content": "as a special case of our framework when applied to sets defined via constraints on hockey-stick", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "divergences. Theorem 4 shows that the optimal certificate in the information-limited setting can be", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 336, + 456, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 456, + 350 + ], + "score": 1.0, + "content": "computed by applying theorem 2 to a constraint set with two hockey-stick divergences.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 352, + 505, + 399 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 219, + 367 + ], + "score": 1.0, + "content": "For the Gaussian measure", + "type": "text" + }, + { + "bbox": [ + 220, + 352, + 303, + 366 + ], + "score": 0.92, + "content": "\\mu ( x ) \\ : = \\ : \\mathcal { N } \\big ( x , \\sigma ^ { 2 } I \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 352, + 390, + 367 + ], + "score": 1.0, + "content": ", the HS divergence", + "type": "text" + }, + { + "bbox": [ + 390, + 353, + 472, + 366 + ], + "score": 0.92, + "content": "D _ { \\mathrm { H S } , \\beta } ( \\mu ( x ) \\| \\mu ( x ^ { \\prime } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 352, + 505, + 367 + ], + "score": 1.0, + "content": "can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 335, + 378 + ], + "score": 1.0, + "content": "computed in closed form and is purely a function of the", + "type": "text" + }, + { + "bbox": [ + 335, + 366, + 345, + 376 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 365, + 383, + 378 + ], + "score": 1.0, + "content": "distance", + "type": "text" + }, + { + "bbox": [ + 383, + 366, + 425, + 378 + ], + "score": 0.92, + "content": "\\| x - x ^ { \\prime } \\| _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 365, + 505, + 378 + ], + "score": 1.0, + "content": ". This enables us to", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 207, + 390 + ], + "score": 1.0, + "content": "efficienctly compute the", + "type": "text" + }, + { + "bbox": [ + 207, + 377, + 234, + 389 + ], + "score": 0.91, + "content": "\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 376, + 505, + 390 + ], + "score": 1.0, + "content": "in theorem 4. Thus, we obtain the following result (see Appendix", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 388, + 182, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 182, + 399 + ], + "score": 1.0, + "content": "A.7.2 for a proof):", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 106, + 401, + 504, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 180, + 414 + ], + "score": 1.0, + "content": "Corollary 5. Let", + "type": "text" + }, + { + "bbox": [ + 180, + 401, + 245, + 415 + ], + "score": 0.88, + "content": "\\rho = { \\mathcal { N } } ( x , \\sigma ^ { 2 } I )", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 401, + 250, + 414 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 250, + 401, + 410, + 415 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon } = \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\le \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 401, + 430, + 414 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 430, + 402, + 504, + 413 + ], + "score": 0.91, + "content": "1 \\geq \\theta _ { a } \\geq \\theta _ { b } \\geq 0 .", + "type": "inline_equation" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 412, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 122, + 426 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 413, + 142, + 424 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 412, + 446, + 426 + ], + "score": 1.0, + "content": "be defined as in theorem 4. Then, applying theorem 2 to the constraint set", + "type": "text" + }, + { + "bbox": [ + 446, + 414, + 465, + 424 + ], + "score": 0.88, + "content": "{ \\mathcal { D } } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 412, + 505, + 426 + ], + "score": 1.0, + "content": "gives the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 424, + 282, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 282, + 436 + ], + "score": 1.0, + "content": "following condition for robust certification:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 439, + 414, + 461 + ], + "lines": [ + { + "bbox": [ + 196, + 439, + 414, + 461 + ], + "spans": [ + { + "bbox": [ + 196, + 439, + 414, + 461 + ], + "score": 0.93, + "content": "\\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) + \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 ,", + "type": "interline_equation", + "image_path": "90e4972d8248ab2660ab422c82f2d31f2c4a99b3083973681f95a5a6546a4dbc.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 196, + 439, + 414, + 461 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 465, + 506, + 488 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 133, + 479 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 466, + 147, + 478 + ], + "score": 0.89, + "content": "\\Psi _ { g }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 464, + 348, + 479 + ], + "score": 1.0, + "content": "is the CDF of a standard normal random variable", + "type": "text" + }, + { + "bbox": [ + 348, + 465, + 381, + 478 + ], + "score": 0.93, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 464, + 505, + 479 + ], + "score": 1.0, + "content": ". With straightforward algebra", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 477, + 391, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 391, + 489 + ], + "score": 1.0, + "content": "(worked out in appendix A.7.2) , this can be shown to be equivalent to", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "interline_equation", + "bbox": [ + 247, + 492, + 364, + 516 + ], + "lines": [ + { + "bbox": [ + 247, + 492, + 364, + 516 + ], + "spans": [ + { + "bbox": [ + 247, + 492, + 364, + 516 + ], + "score": 0.93, + "content": "\\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } ,", + "type": "interline_equation", + "image_path": "afd002e1852d49c3cb66d94ed45f36a01beded8fade67e4f7071433ea0590528.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 247, + 492, + 364, + 516 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 519, + 358, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 518, + 359, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 359, + 533 + ], + "score": 1.0, + "content": "which is the certificate from Theorem 1 of Cohen et al. (2019).", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 505, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "Lee et al. (2019) derive optimal certificates in the information-limited setting under the assumption", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 550, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 279, + 568 + ], + "score": 1.0, + "content": "that the likelihood ratio between measures", + "type": "text" + }, + { + "bbox": [ + 280, + 552, + 300, + 568 + ], + "score": 0.93, + "content": "\\frac { \\nu ( X ) } { \\rho ( X ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 550, + 332, + 568 + ], + "score": 1.0, + "content": "(where", + "type": "text" + }, + { + "bbox": [ + 332, + 552, + 419, + 565 + ], + "score": 0.91, + "content": "\\nu = \\mu ( \\boldsymbol { x } ^ { \\prime } ) , \\rho = \\mu ( \\boldsymbol { x } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 550, + 506, + 568 + ], + "score": 1.0, + "content": "can only take values", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "score": 1.0, + "content": "from a finite set. This is a restrictive assumption that prevents the authors from accommodating natural", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "smoothing measures like Gaussian or Laplacian measures. Further, the complexity of computing the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 587, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 289, + 601 + ], + "score": 1.0, + "content": "certificates in their framework is significant:", + "type": "text" + }, + { + "bbox": [ + 290, + 588, + 316, + 600 + ], + "score": 0.91, + "content": "O ( d ^ { 3 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 587, + 402, + 601 + ], + "score": 1.0, + "content": "computation (where", + "type": "text" + }, + { + "bbox": [ + 402, + 588, + 408, + 598 + ], + "score": 0.8, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 587, + 506, + 601 + ], + "score": 1.0, + "content": "is the input dimension)", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 599, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 247, + 612 + ], + "score": 1.0, + "content": "is needed to certify smoothness to", + "type": "text" + }, + { + "bbox": [ + 248, + 600, + 257, + 610 + ], + "score": 0.86, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 599, + 506, + 612 + ], + "score": 1.0, + "content": "perturbations. The authors also derive tighter certificates for", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 610, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 506, + 622 + ], + "score": 1.0, + "content": "the special case of certain classes of decision trees by exploiting the tree structure. In contrast, our", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 621, + 485, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 485, + 633 + ], + "score": 1.0, + "content": "framework can derive tighter certificates in the full-information setting for arbitrary classifiers.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 107, + 637, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Li et al. (2019) use properties of Renyi divergences to derive robustness certificates for classifiers ´", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 649, + 504, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 323, + 660 + ], + "score": 1.0, + "content": "smoothed by Gaussian (resp. Laplacian) noise under", + "type": "text" + }, + { + "bbox": [ + 323, + 649, + 333, + 660 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 649, + 360, + 660 + ], + "score": 1.0, + "content": "(resp.", + "type": "text" + }, + { + "bbox": [ + 360, + 649, + 370, + 660 + ], + "score": 0.81, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 649, + 504, + 660 + ], + "score": 1.0, + "content": ") perturbations. Their results can", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "score": 1.0, + "content": "be obtained as special cases of ours; in particular, the Renyi divergence certificates in Table 4 (in ´", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "Appendix A.6) recover the results of Lemma 1 of Li et al. (2019), but the latter are only applicable", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 681, + 304, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 681, + 304, + 694 + ], + "score": 1.0, + "content": "for Gaussian and Laplacian smoothing measures.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "Lecuyer et al. (2019) introduce the notion of pixel differential privacy (pixelDP) and show that", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 193, + 723 + ], + "score": 1.0, + "content": "smoothing measures", + "type": "text" + }, + { + "bbox": [ + 194, + 712, + 201, + 721 + ], + "score": 0.79, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "satisfying pixelDP with respect to a certain type of perturbations lead to", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "adversarially robust classifiers. We can show that pixelDP can be viewed as a special instance of our", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + } + ], + "page_idx": 7, + "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": [ + 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": "text", + "bbox": [ + 107, + 82, + 505, + 127 + ], + "lines": [], + "index": 1.5, + "bbox_fs": [ + 105, + 83, + 507, + 128 + ], + "lines_deleted": true + }, + { + "type": "table", + "bbox": [ + 112, + 136, + 499, + 241 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 112, + 136, + 499, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 112, + 136, + 499, + 241 + ], + "spans": [ + { + "bbox": [ + 112, + 136, + 499, + 241 + ], + "score": 0.983, + "html": "
μ(x))Computation-IUse additionalinformation?Optimal
Cohen et al. (2019)Gaussian0(1)l2XYes
Lee et al. (2019)FiniteSupport*0(d3)lOnly decision treesYes
Li et al. (2019)GaussianLaplacian0(1)l2lXNo
Lecuyer et al. (2019)Arbitrary0(1)AllepXNo
Our workArbitrary0(1)AllepArbitrary classifiersYes
", + "type": "table", + "image_path": "c57508577dadb223b408c2d9202c2b305bd1a1d469a5199fd5b315e5304ed52b.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 112, + 136, + 499, + 171.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 112, + 171.0, + 499, + 206.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 112, + 206.0, + 499, + 241.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 108, + 250, + 504, + 281 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 505, + 262 + ], + "score": 1.0, + "content": "Table 1: Comparison between black-box verification methods. * Technically, Lee et al. (2019) can handle", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 260, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 505, + 271 + ], + "score": 1.0, + "content": "smoothing measures such that the likelihood ratios take a finite set of values, but most practical instances of this", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 270, + 258, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 258, + 281 + ], + "score": 1.0, + "content": "correspond to finite-support distributions.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 505, + 348 + ], + "lines": [ + { + "bbox": [ + 106, + 293, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 106, + 293, + 505, + 305 + ], + "score": 1.0, + "content": "Cohen et al. (2019) study the problem of verifying hard classifiers smoothed by Gaussian noise, and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 303, + 505, + 317 + ], + "spans": [ + { + "bbox": [ + 106, + 303, + 269, + 317 + ], + "score": 1.0, + "content": "derive optimal certificates with respect to", + "type": "text" + }, + { + "bbox": [ + 270, + 304, + 280, + 315 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 303, + 505, + 317 + ], + "score": 1.0, + "content": "perturbations of the input. Their results can be recovered", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 315, + 506, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 506, + 327 + ], + "score": 1.0, + "content": "as a special case of our framework when applied to sets defined via constraints on hockey-stick", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "divergences. Theorem 4 shows that the optimal certificate in the information-limited setting can be", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 336, + 456, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 456, + 350 + ], + "score": 1.0, + "content": "computed by applying theorem 2 to a constraint set with two hockey-stick divergences.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 293, + 506, + 350 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 352, + 505, + 399 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 219, + 367 + ], + "score": 1.0, + "content": "For the Gaussian measure", + "type": "text" + }, + { + "bbox": [ + 220, + 352, + 303, + 366 + ], + "score": 0.92, + "content": "\\mu ( x ) \\ : = \\ : \\mathcal { N } \\big ( x , \\sigma ^ { 2 } I \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 352, + 390, + 367 + ], + "score": 1.0, + "content": ", the HS divergence", + "type": "text" + }, + { + "bbox": [ + 390, + 353, + 472, + 366 + ], + "score": 0.92, + "content": "D _ { \\mathrm { H S } , \\beta } ( \\mu ( x ) \\| \\mu ( x ^ { \\prime } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 352, + 505, + 367 + ], + "score": 1.0, + "content": "can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 335, + 378 + ], + "score": 1.0, + "content": "computed in closed form and is purely a function of the", + "type": "text" + }, + { + "bbox": [ + 335, + 366, + 345, + 376 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 365, + 383, + 378 + ], + "score": 1.0, + "content": "distance", + "type": "text" + }, + { + "bbox": [ + 383, + 366, + 425, + 378 + ], + "score": 0.92, + "content": "\\| x - x ^ { \\prime } \\| _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 365, + 505, + 378 + ], + "score": 1.0, + "content": ". This enables us to", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 376, + 505, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 207, + 390 + ], + "score": 1.0, + "content": "efficienctly compute the", + "type": "text" + }, + { + "bbox": [ + 207, + 377, + 234, + 389 + ], + "score": 0.91, + "content": "\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 376, + 505, + 390 + ], + "score": 1.0, + "content": "in theorem 4. Thus, we obtain the following result (see Appendix", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 388, + 182, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 182, + 399 + ], + "score": 1.0, + "content": "A.7.2 for a proof):", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 352, + 505, + 399 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 401, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 106, + 401, + 504, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 180, + 414 + ], + "score": 1.0, + "content": "Corollary 5. Let", + "type": "text" + }, + { + "bbox": [ + 180, + 401, + 245, + 415 + ], + "score": 0.88, + "content": "\\rho = { \\mathcal { N } } ( x , \\sigma ^ { 2 } I )", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 401, + 250, + 414 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 250, + 401, + 410, + 415 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon } = \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\le \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 401, + 430, + 414 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 430, + 402, + 504, + 413 + ], + "score": 0.91, + "content": "1 \\geq \\theta _ { a } \\geq \\theta _ { b } \\geq 0 .", + "type": "inline_equation" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 412, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 122, + 426 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 413, + 142, + 424 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 412, + 446, + 426 + ], + "score": 1.0, + "content": "be defined as in theorem 4. Then, applying theorem 2 to the constraint set", + "type": "text" + }, + { + "bbox": [ + 446, + 414, + 465, + 424 + ], + "score": 0.88, + "content": "{ \\mathcal { D } } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 412, + 505, + 426 + ], + "score": 1.0, + "content": "gives the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 424, + 282, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 282, + 436 + ], + "score": 1.0, + "content": "following condition for robust certification:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 401, + 505, + 436 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 439, + 414, + 461 + ], + "lines": [ + { + "bbox": [ + 196, + 439, + 414, + 461 + ], + "spans": [ + { + "bbox": [ + 196, + 439, + 414, + 461 + ], + "score": 0.93, + "content": "\\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) + \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 ,", + "type": "interline_equation", + "image_path": "90e4972d8248ab2660ab422c82f2d31f2c4a99b3083973681f95a5a6546a4dbc.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 196, + 439, + 414, + 461 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 465, + 506, + 488 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 133, + 479 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 466, + 147, + 478 + ], + "score": 0.89, + "content": "\\Psi _ { g }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 464, + 348, + 479 + ], + "score": 1.0, + "content": "is the CDF of a standard normal random variable", + "type": "text" + }, + { + "bbox": [ + 348, + 465, + 381, + 478 + ], + "score": 0.93, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 464, + 505, + 479 + ], + "score": 1.0, + "content": ". With straightforward algebra", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 477, + 391, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 391, + 489 + ], + "score": 1.0, + "content": "(worked out in appendix A.7.2) , this can be shown to be equivalent to", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 464, + 505, + 489 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 247, + 492, + 364, + 516 + ], + "lines": [ + { + "bbox": [ + 247, + 492, + 364, + 516 + ], + "spans": [ + { + "bbox": [ + 247, + 492, + 364, + 516 + ], + "score": 0.93, + "content": "\\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } ,", + "type": "interline_equation", + "image_path": "afd002e1852d49c3cb66d94ed45f36a01beded8fade67e4f7071433ea0590528.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 247, + 492, + 364, + 516 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 519, + 358, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 518, + 359, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 359, + 533 + ], + "score": 1.0, + "content": "which is the certificate from Theorem 1 of Cohen et al. (2019).", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 518, + 359, + 533 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 505, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 505, + 552 + ], + "score": 1.0, + "content": "Lee et al. (2019) derive optimal certificates in the information-limited setting under the assumption", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 550, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 279, + 568 + ], + "score": 1.0, + "content": "that the likelihood ratio between measures", + "type": "text" + }, + { + "bbox": [ + 280, + 552, + 300, + 568 + ], + "score": 0.93, + "content": "\\frac { \\nu ( X ) } { \\rho ( X ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 550, + 332, + 568 + ], + "score": 1.0, + "content": "(where", + "type": "text" + }, + { + "bbox": [ + 332, + 552, + 419, + 565 + ], + "score": 0.91, + "content": "\\nu = \\mu ( \\boldsymbol { x } ^ { \\prime } ) , \\rho = \\mu ( \\boldsymbol { x } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 550, + 506, + 568 + ], + "score": 1.0, + "content": "can only take values", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "score": 1.0, + "content": "from a finite set. This is a restrictive assumption that prevents the authors from accommodating natural", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "smoothing measures like Gaussian or Laplacian measures. Further, the complexity of computing the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 587, + 506, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 289, + 601 + ], + "score": 1.0, + "content": "certificates in their framework is significant:", + "type": "text" + }, + { + "bbox": [ + 290, + 588, + 316, + 600 + ], + "score": 0.91, + "content": "O ( d ^ { 3 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 587, + 402, + 601 + ], + "score": 1.0, + "content": "computation (where", + "type": "text" + }, + { + "bbox": [ + 402, + 588, + 408, + 598 + ], + "score": 0.8, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 587, + 506, + 601 + ], + "score": 1.0, + "content": "is the input dimension)", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 599, + 506, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 247, + 612 + ], + "score": 1.0, + "content": "is needed to certify smoothness to", + "type": "text" + }, + { + "bbox": [ + 248, + 600, + 257, + 610 + ], + "score": 0.86, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 599, + 506, + 612 + ], + "score": 1.0, + "content": "perturbations. The authors also derive tighter certificates for", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 610, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 506, + 622 + ], + "score": 1.0, + "content": "the special case of certain classes of decision trees by exploiting the tree structure. In contrast, our", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 621, + 485, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 621, + 485, + 633 + ], + "score": 1.0, + "content": "framework can derive tighter certificates in the full-information setting for arbitrary classifiers.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 540, + 506, + 633 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 637, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Li et al. (2019) use properties of Renyi divergences to derive robustness certificates for classifiers ´", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 649, + 504, + 660 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 323, + 660 + ], + "score": 1.0, + "content": "smoothed by Gaussian (resp. Laplacian) noise under", + "type": "text" + }, + { + "bbox": [ + 323, + 649, + 333, + 660 + ], + "score": 0.86, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 649, + 360, + 660 + ], + "score": 1.0, + "content": "(resp.", + "type": "text" + }, + { + "bbox": [ + 360, + 649, + 370, + 660 + ], + "score": 0.81, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 649, + 504, + 660 + ], + "score": 1.0, + "content": ") perturbations. Their results can", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "score": 1.0, + "content": "be obtained as special cases of ours; in particular, the Renyi divergence certificates in Table 4 (in ´", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "Appendix A.6) recover the results of Lemma 1 of Li et al. (2019), but the latter are only applicable", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 681, + 304, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 681, + 304, + 694 + ], + "score": 1.0, + "content": "for Gaussian and Laplacian smoothing measures.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 638, + 505, + 694 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "Lecuyer et al. (2019) introduce the notion of pixel differential privacy (pixelDP) and show that", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 193, + 723 + ], + "score": 1.0, + "content": "smoothing measures", + "type": "text" + }, + { + "bbox": [ + 194, + 712, + 201, + 721 + ], + "score": 0.79, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "satisfying pixelDP with respect to a certain type of perturbations lead to", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "adversarially robust classifiers. We can show that pixelDP can be viewed as a special instance of our", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "certification framework with two specific hockey-stick divergences, and that the certificates derived", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "from the pixelDP are provably dominated by the certificates from our framework (Theorem 1) with", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 382, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 382, + 117 + ], + "score": 1.0, + "content": "the same choice of divergences (see Corollary 7 in Appendix A.7.3).", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 698, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "certification framework with two specific hockey-stick divergences, and that the certificates derived", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "from the pixelDP are provably dominated by the certificates from our framework (Theorem 1) with", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 382, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 382, + 117 + ], + "score": 1.0, + "content": "the same choice of divergences (see Corollary 7 in Appendix A.7.3).", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 107, + 146, + 200, + 158 + ], + "lines": [ + { + "bbox": [ + 105, + 144, + 202, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 202, + 160 + ], + "score": 1.0, + "content": "6 EXPERIMENTS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 105, + 179, + 462, + 190 + ], + "lines": [ + { + "bbox": [ + 106, + 179, + 464, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 179, + 464, + 190 + ], + "score": 1.0, + "content": "6.1 FULL-INFORMATION IMPROVES UPON INFORMATION-LIMITED CERTIFICATION", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 205, + 336, + 370 + ], + "lines": [ + { + "bbox": [ + 105, + 204, + 338, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 338, + 216 + ], + "score": 1.0, + "content": "To compare full-information certificates with limited-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 216, + 337, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 337, + 227 + ], + "score": 1.0, + "content": "information certificates, we trained a ResNet-152 model", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 227, + 336, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 336, + 239 + ], + "score": 1.0, + "content": "on ImageNet with data augmentation by adding noise", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 238, + 337, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 337, + 249 + ], + "score": 1.0, + "content": "via sampling from a zero-mean Gaussian with variance", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 248, + 337, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 337, + 261 + ], + "score": 1.0, + "content": "0.5 for each coordinate; during certification we sample", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 259, + 337, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 337, + 270 + ], + "score": 1.0, + "content": "from the same distribution to estimate lower bounds on", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 269, + 338, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 269, + 338, + 282 + ], + "score": 1.0, + "content": "the probability of the top predicted class. For the full-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 281, + 338, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 338, + 293 + ], + "score": 1.0, + "content": "information certificate, we use two hockey-stick diver-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 292, + 338, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 316, + 304 + ], + "score": 1.0, + "content": "gences for the certificate and tune the parameters", + "type": "text" + }, + { + "bbox": [ + 316, + 292, + 324, + 304 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 292, + 338, + 304 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 303, + 337, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 303, + 337, + 315 + ], + "score": 1.0, + "content": "obtain the highest value in the optimization problem in", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 314, + 338, + 325 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 338, + 325 + ], + "score": 1.0, + "content": "step 2 of Algorithm 1. For the infromation-limited certifi-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 325, + 337, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 337, + 337 + ], + "score": 1.0, + "content": "cate, our approach reduces to that of (Cohen et al., 2019)", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 335, + 337, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 337, + 348 + ], + "score": 1.0, + "content": "and we follow the same certification procedure. We use", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 347, + 336, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 250, + 360 + ], + "score": 0.91, + "content": "N = 1 0 0 0 , \\tilde { N } = 1 0 0 0 0 0 , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 348, + 336, + 360 + ], + "score": 1.0, + "content": "for both certification", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 360, + 155, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 155, + 371 + ], + "score": 1.0, + "content": "procedures.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 376, + 336, + 474 + ], + "lines": [ + { + "bbox": [ + 106, + 376, + 338, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 338, + 388 + ], + "score": 1.0, + "content": "Figure 2 shows the difference between the two certificates.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 387, + 336, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 336, + 398 + ], + "score": 1.0, + "content": "The certificate provided by the full-information method", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 398, + 338, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 338, + 410 + ], + "score": 1.0, + "content": "is always stronger than the one given by the information-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 409, + 337, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 337, + 420 + ], + "score": 1.0, + "content": "limited method. The difference is often substantial – for", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 420, + 336, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 336, + 432 + ], + "score": 1.0, + "content": "one of the test samples, the full-information setting can", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 431, + 336, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 191, + 442 + ], + "score": 1.0, + "content": "certify robustness to", + "type": "text" + }, + { + "bbox": [ + 192, + 432, + 202, + 442 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 431, + 298, + 442 + ], + "score": 1.0, + "content": "perturbations of radius", + "type": "text" + }, + { + "bbox": [ + 298, + 432, + 336, + 442 + ], + "score": 0.86, + "content": "\\epsilon = 9 . 4 2", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 442, + 336, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 336, + 453 + ], + "score": 1.0, + "content": "in the full-information case while the limited-information", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 453, + 336, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 336, + 465 + ], + "score": 1.0, + "content": "certificate can only be provided for perturbation radius", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 464, + 147, + 475 + ], + "spans": [ + { + "bbox": [ + 107, + 464, + 142, + 474 + ], + "score": 0.86, + "content": "\\epsilon = 2 . 6 9", + "type": "inline_equation" + }, + { + "bbox": [ + 143, + 464, + 147, + 475 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26 + }, + { + "type": "image", + "bbox": [ + 363, + 216, + 484, + 335 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 363, + 216, + 484, + 335 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 363, + 216, + 484, + 335 + ], + "spans": [ + { + "bbox": [ + 363, + 216, + 484, + 335 + ], + "score": 0.651, + "type": "image", + "image_path": "27abe4bd89aec0a79207152ac4aab0cd74feeb3c0907b124f56b118683dab4c3.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 363, + 216, + 484, + 275.5 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 363, + 275.5, + 484, + 335.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 344, + 344, + 505, + 555 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 344, + 344, + 507, + 356 + ], + "spans": [ + { + "bbox": [ + 344, + 344, + 507, + 356 + ], + "score": 1.0, + "content": "Figure 2: Information-limited vs full-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 343, + 354, + 504, + 366 + ], + "spans": [ + { + "bbox": [ + 343, + 354, + 495, + 366 + ], + "score": 1.0, + "content": "information certificates for ImageNet for", + "type": "text" + }, + { + "bbox": [ + 495, + 355, + 504, + 365 + ], + "score": 0.82, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 343, + 365, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 343, + 365, + 505, + 376 + ], + "score": 1.0, + "content": "perturbations. The dashed line represents", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 344, + 375, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 344, + 375, + 505, + 385 + ], + "score": 1.0, + "content": "equal certificates and every point below the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 344, + 385, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 344, + 385, + 505, + 395 + ], + "score": 1.0, + "content": "dashed line has a stronger certificate from", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 344, + 395, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 344, + 395, + 505, + 405 + ], + "score": 1.0, + "content": "the full information verification setting. We", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 343, + 405, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 343, + 405, + 505, + 415 + ], + "score": 1.0, + "content": "run the comparison on 50 randomly selected", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 343, + 414, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 343, + 414, + 505, + 425 + ], + "score": 1.0, + "content": "examples from the validation set. Each blue", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 343, + 425, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 343, + 425, + 505, + 435 + ], + "score": 1.0, + "content": "dot in Figure 2 corresponds to one test point,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 343, + 434, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 343, + 434, + 505, + 445 + ], + "score": 1.0, + "content": "with its x coordinate representing the radius", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 343, + 444, + 506, + 455 + ], + "spans": [ + { + "bbox": [ + 343, + 444, + 506, + 455 + ], + "score": 1.0, + "content": "for full information certificate (from Algo-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 344, + 455, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 344, + 455, + 506, + 465 + ], + "score": 1.0, + "content": "rithm 1) and y coordinate the information-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 344, + 465, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 344, + 465, + 505, + 474 + ], + "score": 1.0, + "content": "limited certificate (which is equivalent to the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 344, + 474, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 344, + 474, + 506, + 485 + ], + "score": 1.0, + "content": "certification procedure of Cohen et al., 2019).", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 343, + 484, + 507, + 496 + ], + "spans": [ + { + "bbox": [ + 343, + 484, + 507, + 496 + ], + "score": 1.0, + "content": "The running time of the full-information cer-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 343, + 493, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 343, + 493, + 506, + 505 + ], + "score": 1.0, + "content": "tification procedure is .2s per example (ex-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 343, + 504, + 507, + 515 + ], + "spans": [ + { + "bbox": [ + 343, + 504, + 507, + 515 + ], + "score": 1.0, + "content": "cluding the sampling cost) while the limited-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 344, + 515, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 344, + 515, + 506, + 525 + ], + "score": 1.0, + "content": "information certification takes .002s per ex-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 343, + 524, + 507, + 535 + ], + "spans": [ + { + "bbox": [ + 343, + 524, + 507, + 535 + ], + "score": 1.0, + "content": "ample. Both procedures incur the same sam-", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 343, + 534, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 343, + 534, + 506, + 545 + ], + "score": 1.0, + "content": "pling cost as they use the same number of", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 343, + 545, + 378, + 556 + ], + "spans": [ + { + "bbox": [ + 343, + 545, + 378, + 556 + ], + "score": 1.0, + "content": "samples.", + "type": "text" + } + ], + "index": 53 + } + ], + "index": 41 + } + ], + "index": 32.25 + }, + { + "type": "title", + "bbox": [ + 108, + 502, + 263, + 513 + ], + "lines": [ + { + "bbox": [ + 106, + 502, + 264, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 264, + 514 + ], + "score": 1.0, + "content": "6.2 SCALABILITY AND TIGHTNESS", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 49 + }, + { + "type": "text", + "bbox": [ + 107, + 528, + 337, + 583 + ], + "lines": [ + { + "bbox": [ + 106, + 528, + 338, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 216, + 540 + ], + "score": 1.0, + "content": "In this section we consider", + "type": "text" + }, + { + "bbox": [ + 216, + 529, + 226, + 540 + ], + "score": 0.86, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 528, + 338, + 540 + ], + "score": 1.0, + "content": "perturbations for both Ima-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 539, + 338, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 338, + 551 + ], + "score": 1.0, + "content": "geNet and Binary MNIST (that is, we consider the number", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 106, + 550, + 338, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 338, + 562 + ], + "score": 1.0, + "content": "of pixels that can be perturbed without changing the pre-", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 105, + 561, + 338, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 338, + 573 + ], + "score": 1.0, + "content": "diction). To test for scalability and tightness trade-offs of", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 106, + 572, + 338, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 338, + 585 + ], + "score": 1.0, + "content": "our framework, we compare our methodology to that of", + "type": "text" + } + ], + "index": 57 + } + ], + "index": 55 + }, + { + "type": "text", + "bbox": [ + 107, + 583, + 505, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 361, + 595 + ], + "score": 1.0, + "content": "Lee et al. (2019), as their work obtains the optimal bound for", + "type": "text" + }, + { + "bbox": [ + 361, + 583, + 371, + 594 + ], + "score": 0.87, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 583, + 505, + 595 + ], + "score": 1.0, + "content": ". We computed certificates for a", + "type": "text" + } + ], + "index": 58 + }, + { + "bbox": [ + 105, + 592, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 506, + 608 + ], + "score": 1.0, + "content": "single model for each classification task; for Binary MNIST we used the same model and training", + "type": "text" + } + ], + "index": 59 + }, + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "score": 1.0, + "content": "procedure as Lee et al. (2019) and for ImageNet, we used the model released in the Github code", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "score": 1.0, + "content": "accompanying the paper of Lee et al. (2019). We use the discrete smoothing measure (appendix A.10)", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 105, + 626, + 490, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 168, + 640 + ], + "score": 1.0, + "content": "with parameter", + "type": "text" + }, + { + "bbox": [ + 169, + 627, + 201, + 639 + ], + "score": 0.91, + "content": "p = 0 . 8", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 626, + 348, + 640 + ], + "score": 1.0, + "content": "for Binary MNIST certification, and", + "type": "text" + }, + { + "bbox": [ + 349, + 627, + 381, + 639 + ], + "score": 0.91, + "content": "p = 0 . 2", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 626, + 490, + 640 + ], + "score": 1.0, + "content": "for ImageNet certification.", + "type": "text" + } + ], + "index": 62 + } + ], + "index": 60 + }, + { + "type": "text", + "bbox": [ + 107, + 644, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "In our experiments we ran the certification procedures on all test examples from the Binary MNIST", + "type": "text" + } + ], + "index": 63 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "dataset, while for ImageNet, following prior work (Lee et al., 2019; Cohen et al., 2019), on every", + "type": "text" + } + ], + "index": 64 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 429, + 678 + ], + "score": 1.0, + "content": "100th example from validation set. The proportion of the examples for which", + "type": "text" + }, + { + "bbox": [ + 429, + 668, + 436, + 676 + ], + "score": 0.41, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "accuracy can be", + "type": "text" + } + ], + "index": 65 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 327, + 689 + ], + "score": 1.0, + "content": "certified are reported in Table 2 for various values of", + "type": "text" + }, + { + "bbox": [ + 328, + 679, + 333, + 687 + ], + "score": 0.5, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 677, + 505, + 689 + ], + "score": 1.0, + "content": ". Comparing with the optimal certificates", + "type": "text" + } + ], + "index": 66 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "obtained by the certification method of Lee et al. (2019), the table shows that our bounds remains", + "type": "text" + } + ], + "index": 67 + }, + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 240, + 712 + ], + "score": 1.0, + "content": "tight for Binary MNIST up until", + "type": "text" + }, + { + "bbox": [ + 240, + 699, + 263, + 709 + ], + "score": 0.88, + "content": "\\epsilon = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 698, + 506, + 712 + ], + "score": 1.0, + "content": ", and we do so with 130 times speed-up. For ImageNet, our", + "type": "text" + } + ], + "index": 68 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 210, + 723 + ], + "score": 1.0, + "content": "bounds differ only about", + "type": "text" + }, + { + "bbox": [ + 211, + 710, + 241, + 720 + ], + "score": 0.88, + "content": "7- 1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "in terms of accuracy, and we obtain this with approximately 20", + "type": "text" + } + ], + "index": 69 + }, + { + "bbox": [ + 105, + 720, + 202, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 202, + 734 + ], + "score": 1.0, + "content": "million times speed-up.", + "type": "text" + } + ], + "index": 70 + } + ], + "index": 66.5 + } + ], + "page_idx": 8, + "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 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, + 116 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 106, + 82, + 505, + 117 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 146, + 200, + 158 + ], + "lines": [ + { + "bbox": [ + 105, + 144, + 202, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 202, + 160 + ], + "score": 1.0, + "content": "6 EXPERIMENTS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 105, + 179, + 462, + 190 + ], + "lines": [ + { + "bbox": [ + 106, + 179, + 464, + 190 + ], + "spans": [ + { + "bbox": [ + 106, + 179, + 464, + 190 + ], + "score": 1.0, + "content": "6.1 FULL-INFORMATION IMPROVES UPON INFORMATION-LIMITED CERTIFICATION", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 179, + 464, + 190 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 205, + 336, + 370 + ], + "lines": [ + { + "bbox": [ + 105, + 204, + 338, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 338, + 216 + ], + "score": 1.0, + "content": "To compare full-information certificates with limited-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 216, + 337, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 337, + 227 + ], + "score": 1.0, + "content": "information certificates, we trained a ResNet-152 model", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 227, + 336, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 336, + 239 + ], + "score": 1.0, + "content": "on ImageNet with data augmentation by adding noise", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 238, + 337, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 337, + 249 + ], + "score": 1.0, + "content": "via sampling from a zero-mean Gaussian with variance", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 248, + 337, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 337, + 261 + ], + "score": 1.0, + "content": "0.5 for each coordinate; during certification we sample", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 259, + 337, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 337, + 270 + ], + "score": 1.0, + "content": "from the same distribution to estimate lower bounds on", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 269, + 338, + 282 + ], + "spans": [ + { + "bbox": [ + 105, + 269, + 338, + 282 + ], + "score": 1.0, + "content": "the probability of the top predicted class. For the full-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 281, + 338, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 338, + 293 + ], + "score": 1.0, + "content": "information certificate, we use two hockey-stick diver-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 292, + 338, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 316, + 304 + ], + "score": 1.0, + "content": "gences for the certificate and tune the parameters", + "type": "text" + }, + { + "bbox": [ + 316, + 292, + 324, + 304 + ], + "score": 0.83, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 292, + 338, + 304 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 303, + 337, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 303, + 337, + 315 + ], + "score": 1.0, + "content": "obtain the highest value in the optimization problem in", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 314, + 338, + 325 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 338, + 325 + ], + "score": 1.0, + "content": "step 2 of Algorithm 1. For the infromation-limited certifi-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 325, + 337, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 337, + 337 + ], + "score": 1.0, + "content": "cate, our approach reduces to that of (Cohen et al., 2019)", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 335, + 337, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 337, + 348 + ], + "score": 1.0, + "content": "and we follow the same certification procedure. We use", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 347, + 336, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 250, + 360 + ], + "score": 0.91, + "content": "N = 1 0 0 0 , \\tilde { N } = 1 0 0 0 0 0 , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 348, + 336, + 360 + ], + "score": 1.0, + "content": "for both certification", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 360, + 155, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 155, + 371 + ], + "score": 1.0, + "content": "procedures.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 204, + 338, + 371 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 376, + 336, + 474 + ], + "lines": [ + { + "bbox": [ + 106, + 376, + 338, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 338, + 388 + ], + "score": 1.0, + "content": "Figure 2 shows the difference between the two certificates.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 387, + 336, + 398 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 336, + 398 + ], + "score": 1.0, + "content": "The certificate provided by the full-information method", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 398, + 338, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 338, + 410 + ], + "score": 1.0, + "content": "is always stronger than the one given by the information-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 409, + 337, + 420 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 337, + 420 + ], + "score": 1.0, + "content": "limited method. The difference is often substantial – for", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 420, + 336, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 336, + 432 + ], + "score": 1.0, + "content": "one of the test samples, the full-information setting can", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 431, + 336, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 191, + 442 + ], + "score": 1.0, + "content": "certify robustness to", + "type": "text" + }, + { + "bbox": [ + 192, + 432, + 202, + 442 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 431, + 298, + 442 + ], + "score": 1.0, + "content": "perturbations of radius", + "type": "text" + }, + { + "bbox": [ + 298, + 432, + 336, + 442 + ], + "score": 0.86, + "content": "\\epsilon = 9 . 4 2", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 442, + 336, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 336, + 453 + ], + "score": 1.0, + "content": "in the full-information case while the limited-information", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 453, + 336, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 336, + 465 + ], + "score": 1.0, + "content": "certificate can only be provided for perturbation radius", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 464, + 147, + 475 + ], + "spans": [ + { + "bbox": [ + 107, + 464, + 142, + 474 + ], + "score": 0.86, + "content": "\\epsilon = 2 . 6 9", + "type": "inline_equation" + }, + { + "bbox": [ + 143, + 464, + 147, + 475 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 376, + 338, + 475 + ] + }, + { + "type": "image", + "bbox": [ + 363, + 216, + 484, + 335 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 363, + 216, + 484, + 335 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 363, + 216, + 484, + 335 + ], + "spans": [ + { + "bbox": [ + 363, + 216, + 484, + 335 + ], + "score": 0.651, + "type": "image", + "image_path": "27abe4bd89aec0a79207152ac4aab0cd74feeb3c0907b124f56b118683dab4c3.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 363, + 216, + 484, + 275.5 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 363, + 275.5, + 484, + 335.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 344, + 344, + 505, + 555 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 344, + 344, + 507, + 356 + ], + "spans": [ + { + "bbox": [ + 344, + 344, + 507, + 356 + ], + "score": 1.0, + "content": "Figure 2: Information-limited vs full-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 343, + 354, + 504, + 366 + ], + "spans": [ + { + "bbox": [ + 343, + 354, + 495, + 366 + ], + "score": 1.0, + "content": "information certificates for ImageNet for", + "type": "text" + }, + { + "bbox": [ + 495, + 355, + 504, + 365 + ], + "score": 0.82, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 343, + 365, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 343, + 365, + 505, + 376 + ], + "score": 1.0, + "content": "perturbations. The dashed line represents", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 344, + 375, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 344, + 375, + 505, + 385 + ], + "score": 1.0, + "content": "equal certificates and every point below the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 344, + 385, + 505, + 395 + ], + "spans": [ + { + "bbox": [ + 344, + 385, + 505, + 395 + ], + "score": 1.0, + "content": "dashed line has a stronger certificate from", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 344, + 395, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 344, + 395, + 505, + 405 + ], + "score": 1.0, + "content": "the full information verification setting. We", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 343, + 405, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 343, + 405, + 505, + 415 + ], + "score": 1.0, + "content": "run the comparison on 50 randomly selected", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 343, + 414, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 343, + 414, + 505, + 425 + ], + "score": 1.0, + "content": "examples from the validation set. Each blue", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 343, + 425, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 343, + 425, + 505, + 435 + ], + "score": 1.0, + "content": "dot in Figure 2 corresponds to one test point,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 343, + 434, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 343, + 434, + 505, + 445 + ], + "score": 1.0, + "content": "with its x coordinate representing the radius", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 343, + 444, + 506, + 455 + ], + "spans": [ + { + "bbox": [ + 343, + 444, + 506, + 455 + ], + "score": 1.0, + "content": "for full information certificate (from Algo-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 344, + 455, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 344, + 455, + 506, + 465 + ], + "score": 1.0, + "content": "rithm 1) and y coordinate the information-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 344, + 465, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 344, + 465, + 505, + 474 + ], + "score": 1.0, + "content": "limited certificate (which is equivalent to the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 344, + 474, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 344, + 474, + 506, + 485 + ], + "score": 1.0, + "content": "certification procedure of Cohen et al., 2019).", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 343, + 484, + 507, + 496 + ], + "spans": [ + { + "bbox": [ + 343, + 484, + 507, + 496 + ], + "score": 1.0, + "content": "The running time of the full-information cer-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 343, + 493, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 343, + 493, + 506, + 505 + ], + "score": 1.0, + "content": "tification procedure is .2s per example (ex-", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 343, + 504, + 507, + 515 + ], + "spans": [ + { + "bbox": [ + 343, + 504, + 507, + 515 + ], + "score": 1.0, + "content": "cluding the sampling cost) while the limited-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 344, + 515, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 344, + 515, + 506, + 525 + ], + "score": 1.0, + "content": "information certification takes .002s per ex-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 343, + 524, + 507, + 535 + ], + "spans": [ + { + "bbox": [ + 343, + 524, + 507, + 535 + ], + "score": 1.0, + "content": "ample. Both procedures incur the same sam-", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 343, + 534, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 343, + 534, + 506, + 545 + ], + "score": 1.0, + "content": "pling cost as they use the same number of", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 343, + 545, + 378, + 556 + ], + "spans": [ + { + "bbox": [ + 343, + 545, + 378, + 556 + ], + "score": 1.0, + "content": "samples.", + "type": "text" + } + ], + "index": 53 + } + ], + "index": 41 + } + ], + "index": 32.25 + }, + { + "type": "title", + "bbox": [ + 108, + 502, + 263, + 513 + ], + "lines": [ + { + "bbox": [ + 106, + 502, + 264, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 264, + 514 + ], + "score": 1.0, + "content": "6.2 SCALABILITY AND TIGHTNESS", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 49 + }, + { + "type": "text", + "bbox": [ + 107, + 528, + 337, + 583 + ], + "lines": [ + { + "bbox": [ + 106, + 528, + 338, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 216, + 540 + ], + "score": 1.0, + "content": "In this section we consider", + "type": "text" + }, + { + "bbox": [ + 216, + 529, + 226, + 540 + ], + "score": 0.86, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 528, + 338, + 540 + ], + "score": 1.0, + "content": "perturbations for both Ima-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 539, + 338, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 338, + 551 + ], + "score": 1.0, + "content": "geNet and Binary MNIST (that is, we consider the number", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 106, + 550, + 338, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 338, + 562 + ], + "score": 1.0, + "content": "of pixels that can be perturbed without changing the pre-", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 105, + 561, + 338, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 338, + 573 + ], + "score": 1.0, + "content": "diction). To test for scalability and tightness trade-offs of", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 106, + 572, + 338, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 338, + 585 + ], + "score": 1.0, + "content": "our framework, we compare our methodology to that of", + "type": "text" + } + ], + "index": 57 + } + ], + "index": 55, + "bbox_fs": [ + 105, + 528, + 338, + 585 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 583, + 505, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 361, + 595 + ], + "score": 1.0, + "content": "Lee et al. (2019), as their work obtains the optimal bound for", + "type": "text" + }, + { + "bbox": [ + 361, + 583, + 371, + 594 + ], + "score": 0.87, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 583, + 505, + 595 + ], + "score": 1.0, + "content": ". We computed certificates for a", + "type": "text" + } + ], + "index": 58 + }, + { + "bbox": [ + 105, + 592, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 506, + 608 + ], + "score": 1.0, + "content": "single model for each classification task; for Binary MNIST we used the same model and training", + "type": "text" + } + ], + "index": 59 + }, + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 617 + ], + "score": 1.0, + "content": "procedure as Lee et al. (2019) and for ImageNet, we used the model released in the Github code", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 629 + ], + "score": 1.0, + "content": "accompanying the paper of Lee et al. (2019). We use the discrete smoothing measure (appendix A.10)", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 105, + 626, + 490, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 168, + 640 + ], + "score": 1.0, + "content": "with parameter", + "type": "text" + }, + { + "bbox": [ + 169, + 627, + 201, + 639 + ], + "score": 0.91, + "content": "p = 0 . 8", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 626, + 348, + 640 + ], + "score": 1.0, + "content": "for Binary MNIST certification, and", + "type": "text" + }, + { + "bbox": [ + 349, + 627, + 381, + 639 + ], + "score": 0.91, + "content": "p = 0 . 2", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 626, + 490, + 640 + ], + "score": 1.0, + "content": "for ImageNet certification.", + "type": "text" + } + ], + "index": 62 + } + ], + "index": 60, + "bbox_fs": [ + 105, + 583, + 506, + 640 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 644, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "In our experiments we ran the certification procedures on all test examples from the Binary MNIST", + "type": "text" + } + ], + "index": 63 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "dataset, while for ImageNet, following prior work (Lee et al., 2019; Cohen et al., 2019), on every", + "type": "text" + } + ], + "index": 64 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 429, + 678 + ], + "score": 1.0, + "content": "100th example from validation set. The proportion of the examples for which", + "type": "text" + }, + { + "bbox": [ + 429, + 668, + 436, + 676 + ], + "score": 0.41, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "accuracy can be", + "type": "text" + } + ], + "index": 65 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 327, + 689 + ], + "score": 1.0, + "content": "certified are reported in Table 2 for various values of", + "type": "text" + }, + { + "bbox": [ + 328, + 679, + 333, + 687 + ], + "score": 0.5, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 677, + 505, + 689 + ], + "score": 1.0, + "content": ". Comparing with the optimal certificates", + "type": "text" + } + ], + "index": 66 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "obtained by the certification method of Lee et al. (2019), the table shows that our bounds remains", + "type": "text" + } + ], + "index": 67 + }, + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 240, + 712 + ], + "score": 1.0, + "content": "tight for Binary MNIST up until", + "type": "text" + }, + { + "bbox": [ + 240, + 699, + 263, + 709 + ], + "score": 0.88, + "content": "\\epsilon = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 698, + 506, + 712 + ], + "score": 1.0, + "content": ", and we do so with 130 times speed-up. For ImageNet, our", + "type": "text" + } + ], + "index": 68 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 210, + 723 + ], + "score": 1.0, + "content": "bounds differ only about", + "type": "text" + }, + { + "bbox": [ + 211, + 710, + 241, + 720 + ], + "score": 0.88, + "content": "7- 1 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "in terms of accuracy, and we obtain this with approximately 20", + "type": "text" + } + ], + "index": 69 + }, + { + "bbox": [ + 105, + 720, + 202, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 202, + 734 + ], + "score": 1.0, + "content": "million times speed-up.", + "type": "text" + } + ], + "index": 70 + } + ], + "index": 66.5, + "bbox_fs": [ + 105, + 643, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 80, + 505, + 158 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 80, + 505, + 158 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 80, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 505, + 158 + ], + "score": 0.979, + "html": "
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
e=1e=2e=3e=4e=5∈=6∈=7
Binary MNISTLee et al. (2019) Ours0.83.68s 0.028s0.919 0.9190.767 0.7670.530 0.5300.513 0.2960.348 0.1620.194 0.0800.095 0.015
ImageNetLee et al. (2019) Ours0.24 days 0.028s0.488 0.3620.418 0.2620.310 0.2240.250 0.1860.244 0.1360.234 00.224 0
", + "type": "table", + "image_path": "b94e8b3ff271c994562eef0af521ce36804ae30a3a922b4c4af9f43002597d66.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 80, + 505, + 106.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 106.0, + 505, + 132.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 132.0, + 505, + 158.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 116, + 170, + 487, + 180 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 119, + 168, + 488, + 182 + ], + "spans": [ + { + "bbox": [ + 119, + 168, + 302, + 182 + ], + "score": 1.0, + "content": "Table 2: Proportion of the examples with verified", + "type": "text" + }, + { + "bbox": [ + 302, + 171, + 311, + 180 + ], + "score": 0.87, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 168, + 488, + 182 + ], + "score": 1.0, + "content": "-robustness for different accuracy (\u000f) parameters.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "title", + "bbox": [ + 106, + 187, + 387, + 199 + ], + "lines": [ + { + "bbox": [ + 105, + 186, + 388, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 388, + 200 + ], + "score": 1.0, + "content": "6.3 CERTIFICATION FOR AUDIO CLASSIFICATION: LIBRISPEECH", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 208, + 505, + 296 + ], + "lines": [ + { + "bbox": [ + 106, + 208, + 506, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 506, + 220 + ], + "score": 1.0, + "content": "Audio classification systems have been shown to be susceptible to adversarial attacks (Qin et al.,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 218, + 506, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 506, + 232 + ], + "score": 1.0, + "content": "2019). However, building audio classifiers that are provably robust to adversarial attacks has been", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 230, + 506, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 506, + 243 + ], + "score": 1.0, + "content": "hard due to the complexity of audio processing architectures. We take a step towards provably robust", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 241, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 506, + 254 + ], + "score": 1.0, + "content": "audio classifiers by showing that our approach can certify robustness of a classifier trained for speaker", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 252, + 506, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 376, + 264 + ], + "score": 1.0, + "content": "recognition on a state-of-the-art model for this task. We focus on", + "type": "text" + }, + { + "bbox": [ + 376, + 252, + 386, + 263 + ], + "score": 0.87, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 252, + 506, + 264 + ], + "score": 1.0, + "content": "perturbations that zero out a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 262, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 104, + 262, + 506, + 276 + ], + "score": 1.0, + "content": "fraction of the audio sample, as they correspond to missing data in an audio signal. Missing data can", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 274, + 506, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 274, + 506, + 286 + ], + "score": 1.0, + "content": "occur due to errors in recording audio or packets dropped while transmitting an audio signal over a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 285, + 391, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 391, + 297 + ], + "score": 1.0, + "content": "network and is a common issue (Turner, 2010; Smaragdis et al., 2009).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 301, + 505, + 357 + ], + "lines": [ + { + "bbox": [ + 106, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "In principle, the method of Lee et al. (2019) is applicable to compute robustness certificates, but at", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 312, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 505, + 326 + ], + "score": 1.0, + "content": "an impractically large computational cost, since the computation needs to be repeated whenever an", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 323, + 506, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 506, + 337 + ], + "score": 1.0, + "content": "input of a new length (for which a certificate has not previously been computed) arrives. Concretely,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 181, + 347 + ], + "score": 1.0, + "content": "this constitutes an", + "type": "text" + }, + { + "bbox": [ + 181, + 334, + 207, + 347 + ], + "score": 0.93, + "content": "\\mathrm { \\bar { \\it O } } ( d ^ { 3 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 334, + 317, + 347 + ], + "score": 1.0, + "content": "computation for the length", + "type": "text" + }, + { + "bbox": [ + 317, + 335, + 324, + 345 + ], + "score": 0.73, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 334, + 505, + 347 + ], + "score": 1.0, + "content": "ranging from 38 to 522,320 (the set of audio", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 345, + 442, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 442, + 358 + ], + "score": 1.0, + "content": "sequence lengths observed in the Librispeech test dataset (Panayotov et al., 2015)).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 362, + 505, + 396 + ], + "lines": [ + { + "bbox": [ + 105, + 361, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 376 + ], + "score": 1.0, + "content": "The results are shown in Table 3. To the best of our knowledge, these are the first results showing", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 374, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 505, + 386 + ], + "score": 1.0, + "content": "certified robustness of an audio classifier. We believe this is a significant advance towards certification", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 384, + 459, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 459, + 397 + ], + "score": 1.0, + "content": "of classifiers in audio and classifiers operating on variable-length inputs more generally.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "table", + "bbox": [ + 106, + 405, + 505, + 471 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 405, + 505, + 471 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 405, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 505, + 471 + ], + "score": 0.979, + "html": "
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
∈=0∈=1e=2e=3e=4e=5e=6e=7
0.50.5110.2250.0910.0910.0910.0910.0910
LibrispeechOurs0.70.028s0.8850.6340.4050.4050.4050.40500
0.90.8720.7720.7110.7110.711000
", + "type": "table", + "image_path": "e9c677106e107223e320ee90a274f5a92791d1060911dc9a42d3454a3594d467.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 106, + 405, + 505, + 427.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 106, + 427.0, + 505, + 449.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 106, + 449.0, + 505, + 471.0 + ], + "spans": [], + "index": 23 + } + ] + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 478, + 505, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 144, + 490 + ], + "score": 1.0, + "content": "Table 3:", + "type": "text" + }, + { + "bbox": [ + 144, + 479, + 153, + 489 + ], + "score": 0.81, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "robustness results for Librispeech (Panayotov et al., 2015). From the Librispeech dataset, we", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 489, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 505, + 500 + ], + "score": 1.0, + "content": "created a corpus of sentence utterances from ten different speakers. The classification task is, given an audio", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 498, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 506, + 510 + ], + "score": 1.0, + "content": "sample, to predict whom is speaking. The test set consisted of 30 audio samples for each of the ten speakers.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 507, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 416, + 520 + ], + "score": 1.0, + "content": "We use a DeepSpeaker architecture (Li et al., 2017), trained with the Adam optimizer", + "type": "text" + }, + { + "bbox": [ + 416, + 509, + 451, + 519 + ], + "score": 0.8, + "content": "\\beta _ { 1 } = 0 . 9", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 507, + 453, + 520 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 454, + 509, + 489, + 519 + ], + "score": 0.71, + "content": "\\beta _ { 2 } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 507, + 506, + 520 + ], + "score": 1.0, + "content": ") for", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 517, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 104, + 517, + 506, + 531 + ], + "score": 1.0, + "content": "50,000 steps with a learning rate of 0.0001. The architecture is the same as that of Li et al. (2017), except for", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 529, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 540 + ], + "score": 1.0, + "content": "changing the number of neurons in the final layer for speaker identification with ten classes. Three models were", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 538, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 230, + 549 + ], + "score": 1.0, + "content": "trained with smoothing values of", + "type": "text" + }, + { + "bbox": [ + 230, + 539, + 261, + 549 + ], + "score": 0.88, + "content": "p = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 538, + 263, + 549 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 264, + 539, + 295, + 549 + ], + "score": 0.88, + "content": "p = 0 . 7", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 538, + 314, + 549 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 314, + 539, + 345, + 549 + ], + "score": 0.88, + "content": "p = 0 . 9", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 538, + 505, + 549 + ], + "score": 1.0, + "content": ", respectively, and we used the same values", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 296, + 561 + ], + "score": 1.0, + "content": "for certification. Certification was performed using", + "type": "text" + }, + { + "bbox": [ + 296, + 549, + 429, + 560 + ], + "score": 0.85, + "content": "N = 1 0 0 0 , \\tilde { N } = 1 0 0 0 0 0 , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 549, + 451, + 561 + ], + "score": 1.0, + "content": "using", + "type": "text" + }, + { + "bbox": [ + 451, + 549, + 480, + 559 + ], + "score": 0.87, + "content": "M = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 549, + 505, + 561 + ], + "score": 1.0, + "content": "Renyi ´", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 559, + 506, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 168, + 572 + ], + "score": 1.0, + "content": "divergence, with", + "type": "text" + }, + { + "bbox": [ + 169, + 561, + 176, + 569 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 559, + 506, + 572 + ], + "score": 1.0, + "content": "tuned to obtain the best certificate. The proportion of samples with certified robustness for", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 570, + 370, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 370, + 581 + ], + "score": 1.0, + "content": "different accuracy values are reported, computed on 300 test set samples.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 28.5 + }, + { + "type": "title", + "bbox": [ + 108, + 594, + 195, + 607 + ], + "lines": [ + { + "bbox": [ + 104, + 592, + 198, + 610 + ], + "spans": [ + { + "bbox": [ + 104, + 592, + 198, + 610 + ], + "score": 1.0, + "content": "7 CONCLUSION", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 505, + 675 + ], + "lines": [ + { + "bbox": [ + 105, + 618, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 403, + 632 + ], + "score": 1.0, + "content": "We have introduced a general framework for black-box verification using", + "type": "text" + }, + { + "bbox": [ + 403, + 620, + 410, + 631 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 618, + 506, + 632 + ], + "score": 1.0, + "content": "-divergence constraints.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 629, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 629, + 505, + 643 + ], + "score": 1.0, + "content": "The framework improves upon state-of-the-art results on both image classification and audio tasks", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 641, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 506, + 654 + ], + "score": 1.0, + "content": "by a significant margin in terms of robustness certificates or computation time. We believe that our", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 652, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 505, + 666 + ], + "score": 1.0, + "content": "framework can potentially enable scalable computation of robustness verification for more complex", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 663, + 470, + 676 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 470, + 676 + ], + "score": 1.0, + "content": "predictors and structured perturbations that can be modeled using f-divergence constraints.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37 + }, + { + "type": "title", + "bbox": [ + 108, + 691, + 175, + 703 + ], + "lines": [ + { + "bbox": [ + 106, + 691, + 176, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 691, + 176, + 704 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Syed Mumtaz Ali and Samuel D Silvey. A general class of coefficients of divergence of one", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "distribution from another. Journal of the Royal Statistical Society: Series B (Methodological), 28", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5 + } + ], + "page_idx": 9, + "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, + 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 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 80, + 505, + 158 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 80, + 505, + 158 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 80, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 505, + 158 + ], + "score": 0.979, + "html": "
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
e=1e=2e=3e=4e=5∈=6∈=7
Binary MNISTLee et al. (2019) Ours0.83.68s 0.028s0.919 0.9190.767 0.7670.530 0.5300.513 0.2960.348 0.1620.194 0.0800.095 0.015
ImageNetLee et al. (2019) Ours0.24 days 0.028s0.488 0.3620.418 0.2620.310 0.2240.250 0.1860.244 0.1360.234 00.224 0
", + "type": "table", + "image_path": "b94e8b3ff271c994562eef0af521ce36804ae30a3a922b4c4af9f43002597d66.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 80, + 505, + 106.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 106.0, + 505, + 132.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 132.0, + 505, + 158.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 116, + 170, + 487, + 180 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 119, + 168, + 488, + 182 + ], + "spans": [ + { + "bbox": [ + 119, + 168, + 302, + 182 + ], + "score": 1.0, + "content": "Table 2: Proportion of the examples with verified", + "type": "text" + }, + { + "bbox": [ + 302, + 171, + 311, + 180 + ], + "score": 0.87, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 168, + 488, + 182 + ], + "score": 1.0, + "content": "-robustness for different accuracy (\u000f) parameters.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "title", + "bbox": [ + 106, + 187, + 387, + 199 + ], + "lines": [ + { + "bbox": [ + 105, + 186, + 388, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 388, + 200 + ], + "score": 1.0, + "content": "6.3 CERTIFICATION FOR AUDIO CLASSIFICATION: LIBRISPEECH", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 208, + 505, + 296 + ], + "lines": [ + { + "bbox": [ + 106, + 208, + 506, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 506, + 220 + ], + "score": 1.0, + "content": "Audio classification systems have been shown to be susceptible to adversarial attacks (Qin et al.,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 218, + 506, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 506, + 232 + ], + "score": 1.0, + "content": "2019). However, building audio classifiers that are provably robust to adversarial attacks has been", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 230, + 506, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 506, + 243 + ], + "score": 1.0, + "content": "hard due to the complexity of audio processing architectures. We take a step towards provably robust", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 241, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 506, + 254 + ], + "score": 1.0, + "content": "audio classifiers by showing that our approach can certify robustness of a classifier trained for speaker", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 252, + 506, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 376, + 264 + ], + "score": 1.0, + "content": "recognition on a state-of-the-art model for this task. We focus on", + "type": "text" + }, + { + "bbox": [ + 376, + 252, + 386, + 263 + ], + "score": 0.87, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 252, + 506, + 264 + ], + "score": 1.0, + "content": "perturbations that zero out a", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 262, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 104, + 262, + 506, + 276 + ], + "score": 1.0, + "content": "fraction of the audio sample, as they correspond to missing data in an audio signal. Missing data can", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 274, + 506, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 274, + 506, + 286 + ], + "score": 1.0, + "content": "occur due to errors in recording audio or packets dropped while transmitting an audio signal over a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 285, + 391, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 391, + 297 + ], + "score": 1.0, + "content": "network and is a common issue (Turner, 2010; Smaragdis et al., 2009).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8.5, + "bbox_fs": [ + 104, + 208, + 506, + 297 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 301, + 505, + 357 + ], + "lines": [ + { + "bbox": [ + 106, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "In principle, the method of Lee et al. (2019) is applicable to compute robustness certificates, but at", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 312, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 505, + 326 + ], + "score": 1.0, + "content": "an impractically large computational cost, since the computation needs to be repeated whenever an", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 323, + 506, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 506, + 337 + ], + "score": 1.0, + "content": "input of a new length (for which a certificate has not previously been computed) arrives. Concretely,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 181, + 347 + ], + "score": 1.0, + "content": "this constitutes an", + "type": "text" + }, + { + "bbox": [ + 181, + 334, + 207, + 347 + ], + "score": 0.93, + "content": "\\mathrm { \\bar { \\it O } } ( d ^ { 3 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 334, + 317, + 347 + ], + "score": 1.0, + "content": "computation for the length", + "type": "text" + }, + { + "bbox": [ + 317, + 335, + 324, + 345 + ], + "score": 0.73, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 334, + 505, + 347 + ], + "score": 1.0, + "content": "ranging from 38 to 522,320 (the set of audio", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 345, + 442, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 442, + 358 + ], + "score": 1.0, + "content": "sequence lengths observed in the Librispeech test dataset (Panayotov et al., 2015)).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 302, + 506, + 358 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 362, + 505, + 396 + ], + "lines": [ + { + "bbox": [ + 105, + 361, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 376 + ], + "score": 1.0, + "content": "The results are shown in Table 3. To the best of our knowledge, these are the first results showing", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 374, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 505, + 386 + ], + "score": 1.0, + "content": "certified robustness of an audio classifier. We believe this is a significant advance towards certification", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 384, + 459, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 459, + 397 + ], + "score": 1.0, + "content": "of classifiers in audio and classifiers operating on variable-length inputs more generally.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 361, + 505, + 397 + ] + }, + { + "type": "table", + "bbox": [ + 106, + 405, + 505, + 471 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 405, + 505, + 471 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 405, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 505, + 471 + ], + "score": 0.979, + "html": "
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
∈=0∈=1e=2e=3e=4e=5e=6e=7
0.50.5110.2250.0910.0910.0910.0910.0910
LibrispeechOurs0.70.028s0.8850.6340.4050.4050.4050.40500
0.90.8720.7720.7110.7110.711000
", + "type": "table", + "image_path": "e9c677106e107223e320ee90a274f5a92791d1060911dc9a42d3454a3594d467.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 106, + 405, + 505, + 427.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 106, + 427.0, + 505, + 449.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 106, + 449.0, + 505, + 471.0 + ], + "spans": [], + "index": 23 + } + ] + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 106, + 478, + 505, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 144, + 490 + ], + "score": 1.0, + "content": "Table 3:", + "type": "text" + }, + { + "bbox": [ + 144, + 479, + 153, + 489 + ], + "score": 0.81, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "robustness results for Librispeech (Panayotov et al., 2015). From the Librispeech dataset, we", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 489, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 489, + 505, + 500 + ], + "score": 1.0, + "content": "created a corpus of sentence utterances from ten different speakers. The classification task is, given an audio", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 498, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 506, + 510 + ], + "score": 1.0, + "content": "sample, to predict whom is speaking. The test set consisted of 30 audio samples for each of the ten speakers.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 507, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 416, + 520 + ], + "score": 1.0, + "content": "We use a DeepSpeaker architecture (Li et al., 2017), trained with the Adam optimizer", + "type": "text" + }, + { + "bbox": [ + 416, + 509, + 451, + 519 + ], + "score": 0.8, + "content": "\\beta _ { 1 } = 0 . 9", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 507, + 453, + 520 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 454, + 509, + 489, + 519 + ], + "score": 0.71, + "content": "\\beta _ { 2 } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 507, + 506, + 520 + ], + "score": 1.0, + "content": ") for", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 517, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 104, + 517, + 506, + 531 + ], + "score": 1.0, + "content": "50,000 steps with a learning rate of 0.0001. The architecture is the same as that of Li et al. (2017), except for", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 529, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 540 + ], + "score": 1.0, + "content": "changing the number of neurons in the final layer for speaker identification with ten classes. Three models were", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 538, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 230, + 549 + ], + "score": 1.0, + "content": "trained with smoothing values of", + "type": "text" + }, + { + "bbox": [ + 230, + 539, + 261, + 549 + ], + "score": 0.88, + "content": "p = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 538, + 263, + 549 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 264, + 539, + 295, + 549 + ], + "score": 0.88, + "content": "p = 0 . 7", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 538, + 314, + 549 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 314, + 539, + 345, + 549 + ], + "score": 0.88, + "content": "p = 0 . 9", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 538, + 505, + 549 + ], + "score": 1.0, + "content": ", respectively, and we used the same values", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 296, + 561 + ], + "score": 1.0, + "content": "for certification. Certification was performed using", + "type": "text" + }, + { + "bbox": [ + 296, + 549, + 429, + 560 + ], + "score": 0.85, + "content": "N = 1 0 0 0 , \\tilde { N } = 1 0 0 0 0 0 , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 549, + 451, + 561 + ], + "score": 1.0, + "content": "using", + "type": "text" + }, + { + "bbox": [ + 451, + 549, + 480, + 559 + ], + "score": 0.87, + "content": "M = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 549, + 505, + 561 + ], + "score": 1.0, + "content": "Renyi ´", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 559, + 506, + 572 + ], + "spans": [ + { + "bbox": [ + 106, + 559, + 168, + 572 + ], + "score": 1.0, + "content": "divergence, with", + "type": "text" + }, + { + "bbox": [ + 169, + 561, + 176, + 569 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 559, + 506, + 572 + ], + "score": 1.0, + "content": "tuned to obtain the best certificate. The proportion of samples with certified robustness for", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 570, + 370, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 370, + 581 + ], + "score": 1.0, + "content": "different accuracy values are reported, computed on 300 test set samples.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 28.5, + "bbox_fs": [ + 104, + 477, + 506, + 581 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 594, + 195, + 607 + ], + "lines": [ + { + "bbox": [ + 104, + 592, + 198, + 610 + ], + "spans": [ + { + "bbox": [ + 104, + 592, + 198, + 610 + ], + "score": 1.0, + "content": "7 CONCLUSION", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 505, + 675 + ], + "lines": [ + { + "bbox": [ + 105, + 618, + 506, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 403, + 632 + ], + "score": 1.0, + "content": "We have introduced a general framework for black-box verification using", + "type": "text" + }, + { + "bbox": [ + 403, + 620, + 410, + 631 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 618, + 506, + 632 + ], + "score": 1.0, + "content": "-divergence constraints.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 629, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 629, + 505, + 643 + ], + "score": 1.0, + "content": "The framework improves upon state-of-the-art results on both image classification and audio tasks", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 641, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 506, + 654 + ], + "score": 1.0, + "content": "by a significant margin in terms of robustness certificates or computation time. We believe that our", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 652, + 505, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 652, + 505, + 666 + ], + "score": 1.0, + "content": "framework can potentially enable scalable computation of robustness verification for more complex", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 663, + 470, + 676 + ], + "spans": [ + { + "bbox": [ + 106, + 663, + 470, + 676 + ], + "score": 1.0, + "content": "predictors and structured perturbations that can be modeled using f-divergence constraints.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 618, + 506, + 676 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 691, + 175, + 703 + ], + "lines": [ + { + "bbox": [ + 106, + 691, + 176, + 704 + ], + "spans": [ + { + "bbox": [ + 106, + 691, + 176, + 704 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Syed Mumtaz Ali and Samuel D Silvey. A general class of coefficients of divergence of one", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "distribution from another. Journal of the Royal Statistical Society: Series B (Methodological), 28", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5, + "bbox_fs": [ + 106, + 709, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 116, + 82, + 194, + 93 + ], + "lines": [ + { + "bbox": [ + 115, + 82, + 195, + 95 + ], + "spans": [ + { + "bbox": [ + 115, + 82, + 195, + 95 + ], + "score": 1.0, + "content": "(1):131–142, 1966.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 101, + 506, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 101, + 506, + 115 + ], + "score": 1.0, + "content": "Anish Athalye, Nicholas Carlini, and David Wagner. Obfuscated gradients give a false sense of", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 114, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 116, + 114, + 505, + 126 + ], + "score": 1.0, + "content": "security: Circumventing defenses to adversarial examples. In International Conference on Machine", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 124, + 183, + 137 + ], + "spans": [ + { + "bbox": [ + 116, + 124, + 183, + 137 + ], + "score": 1.0, + "content": "Learning, 2018.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 144, + 506, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 143, + 506, + 158 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 158 + ], + "score": 1.0, + "content": "Jean-Yves Audibert, Remi Munos, and Csaba Szepesv ´ ari. Exploration-exploitation tradeoff using ´", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 156, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 116, + 156, + 506, + 168 + ], + "score": 1.0, + "content": "variance estimates in multi-armed bandits. Theoretical Computer Science, 410(19):1876–1902,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 166, + 142, + 178 + ], + "spans": [ + { + "bbox": [ + 115, + 166, + 142, + 178 + ], + "score": 1.0, + "content": "2009.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 506, + 220 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 506, + 200 + ], + "score": 1.0, + "content": "Borja Balle and Yu-Xiang Wang. Improving the gaussian mechanism for differential privacy:", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 197, + 507, + 211 + ], + "spans": [ + { + "bbox": [ + 115, + 197, + 507, + 211 + ], + "score": 1.0, + "content": "Analytical calibration and optimal denoising. In International Conference on Machine Learning,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 208, + 197, + 220 + ], + "spans": [ + { + "bbox": [ + 115, + 208, + 197, + 220 + ], + "score": 1.0, + "content": "pp. 403–412, 2018.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 263 + ], + "lines": [ + { + "bbox": [ + 106, + 228, + 506, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 506, + 241 + ], + "score": 1.0, + "content": "Gilles Barthe and Federico Olmedo. Beyond differential privacy: Composition theorems and relational", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 239, + 507, + 253 + ], + "spans": [ + { + "bbox": [ + 115, + 239, + 507, + 253 + ], + "score": 1.0, + "content": "logic for f-divergences between probabilistic programs. In International Colloquium on Automata,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 250, + 351, + 264 + ], + "spans": [ + { + "bbox": [ + 115, + 250, + 351, + 264 + ], + "score": 1.0, + "content": "Languages, and Programming, pp. 49–60. Springer, 2013.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 270, + 506, + 315 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "score": 1.0, + "content": "Battista Biggio, Igino Corona, Davide Maiorca, Blaine Nelson, Nedim Srndic, Pavel Laskov, Giorgio", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 281, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 115, + 281, + 505, + 294 + ], + "score": 1.0, + "content": "Giacinto, and Fabio Roli. Evasion attacks against machine learning at test time. In Joint European", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 292, + 507, + 306 + ], + "spans": [ + { + "bbox": [ + 115, + 292, + 507, + 306 + ], + "score": 1.0, + "content": "conference on machine learning and knowledge discovery in databases, pp. 387–402. Springer,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 302, + 143, + 316 + ], + "spans": [ + { + "bbox": [ + 115, + 302, + 143, + 316 + ], + "score": 1.0, + "content": "2013.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 323, + 506, + 357 + ], + "lines": [ + { + "bbox": [ + 106, + 323, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 149, + 335 + ], + "score": 1.0, + "content": "Sebastian", + "type": "text" + }, + { + "bbox": [ + 165, + 323, + 202, + 335 + ], + "score": 1.0, + "content": "Bubeck.", + "type": "text" + }, + { + "bbox": [ + 261, + 323, + 294, + 335 + ], + "score": 1.0, + "content": "Orf523", + "type": "text" + }, + { + "bbox": [ + 310, + 324, + 356, + 335 + ], + "score": 1.0, + "content": "(advanced", + "type": "text" + }, + { + "bbox": [ + 370, + 323, + 506, + 335 + ], + "score": 1.0, + "content": "optimization): Introduction.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 114, + 333, + 507, + 348 + ], + "spans": [ + { + "bbox": [ + 114, + 333, + 507, + 348 + ], + "score": 1.0, + "content": "https://blogs.princeton.edu/imabandit/2013/02/05/orf523-advanced-optimization-introduction/,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 343, + 144, + 358 + ], + "spans": [ + { + "bbox": [ + 115, + 343, + 144, + 358 + ], + "score": 1.0, + "content": "2013.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 365, + 504, + 389 + ], + "lines": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "score": 1.0, + "content": "Charles J Clopper and Egon S Pearson. The use of confidence or fiducial limits illustrated in the case", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 376, + 321, + 388 + ], + "spans": [ + { + "bbox": [ + 116, + 376, + 321, + 388 + ], + "score": 1.0, + "content": "of the binomial. Biometrika, 26(4):404–413, 1934.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 505, + 420 + ], + "lines": [ + { + "bbox": [ + 106, + 396, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 505, + 409 + ], + "score": 1.0, + "content": "Jeremy M Cohen, Elan Rosenfeld, and J Zico Kolter. Certified adversarial robustness via randomized", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 408, + 326, + 419 + ], + "spans": [ + { + "bbox": [ + 116, + 408, + 326, + 419 + ], + "score": 1.0, + "content": "smoothing. arXiv preprint arXiv:1902.02918, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 105, + 428, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 106, + 428, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 428, + 506, + 441 + ], + "score": 1.0, + "content": "Imre Csiszar, Paul C Shields, et al. Information theory and statistics: A tutorial. ´ Foundations and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 438, + 420, + 451 + ], + "spans": [ + { + "bbox": [ + 115, + 438, + 143, + 451 + ], + "score": 1.0, + "content": "Trends", + "type": "text" + }, + { + "bbox": [ + 144, + 439, + 154, + 450 + ], + "score": 0.7, + "content": "\\textsuperscript { \\textregistered }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 438, + 420, + 451 + ], + "score": 1.0, + "content": "in Communications and Information Theory, 1(4):417–528, 2004.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 504, + 482 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "Steven Diamond and Stephen Boyd. Cvxpy: A python-embedded modeling language for convex", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 470, + 451, + 483 + ], + "spans": [ + { + "bbox": [ + 116, + 470, + 451, + 483 + ], + "score": 1.0, + "content": "optimization. The Journal of Machine Learning Research, 17(1):2909–2913, 2016.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 105, + 489, + 504, + 513 + ], + "lines": [ + { + "bbox": [ + 106, + 490, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 505, + 503 + ], + "score": 1.0, + "content": "John Duchi and Hongseok Namkoong. Learning models with uniform performance via distributionally", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 501, + 362, + 513 + ], + "spans": [ + { + "bbox": [ + 115, + 501, + 362, + 513 + ], + "score": 1.0, + "content": "robust optimization. arXiv preprint arXiv:1810.08750, 2018.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 555 + ], + "lines": [ + { + "bbox": [ + 106, + 521, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 506, + 533 + ], + "score": 1.0, + "content": "Krishnamuthy Dvijotham, Robert Stanforth, Sven Gowal, Timothy Mann, and Pushmeet Kohli.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 532, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 115, + 532, + 505, + 545 + ], + "score": 1.0, + "content": "Towards scalable verification of neural networks: A dual approach. In Conference on Uncertainty", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 543, + 242, + 555 + ], + "spans": [ + { + "bbox": [ + 115, + 543, + 242, + 555 + ], + "score": 1.0, + "content": "in Artificial Intelligence, 2018.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 563, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 106, + 563, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 505, + 576 + ], + "score": 1.0, + "content": "Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 574, + 390, + 586 + ], + "spans": [ + { + "bbox": [ + 115, + 574, + 390, + 586 + ], + "score": 1.0, + "content": "examples. In International Conference on Machine Learning, 2015.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 106, + 594, + 506, + 628 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 607 + ], + "score": 1.0, + "content": "Po-Sen Huang, Robert Stanforth, Johannes Welbl, Chris Dyer, Dani Yogatama, Sven Gowal, Krishna-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 116, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "murthy Dvijotham, and Pushmeet Kohli. Achieving verified robustness to symbol substitutions via", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 617, + 392, + 629 + ], + "spans": [ + { + "bbox": [ + 116, + 617, + 392, + 629 + ], + "score": 1.0, + "content": "interval bound propagation. arXiv preprint arXiv:1909.01492, 2019.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 105, + 636, + 505, + 659 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 506, + 650 + ], + "score": 1.0, + "content": "Kenneth Hung and William Fithian. Rank verification for exponential families. The Annals of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 647, + 246, + 659 + ], + "spans": [ + { + "bbox": [ + 116, + 647, + 246, + 659 + ], + "score": 1.0, + "content": "Statistics, 47(2):758–782, 2019.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 104, + 667, + 505, + 690 + ], + "lines": [ + { + "bbox": [ + 106, + 667, + 504, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 504, + 680 + ], + "score": 1.0, + "content": "Robin Jia, Aditi Raghunathan, Kerem Goksel, and Percy Liang. Certified robustness to adversarial ¨", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 678, + 358, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 678, + 358, + 691 + ], + "score": 1.0, + "content": "word substitutions. arXiv preprint arXiv:1909.00986, 2019.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Guy Katz, Clark Barrett, David L Dill, Kyle Julian, and Mykel J Kochenderfer. Reluplex: An efficient", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 711, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 116, + 711, + 505, + 721 + ], + "score": 1.0, + "content": "smt solver for verifying deep neural networks. In International Conference on Computer Aided", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 719, + 281, + 733 + ], + "spans": [ + { + "bbox": [ + 115, + 719, + 281, + 733 + ], + "score": 1.0, + "content": "Verification, pp. 97–117. Springer, 2017.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + } + ], + "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 2020", + "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, + 194, + 93 + ], + "lines": [ + { + "bbox": [ + 115, + 82, + 195, + 95 + ], + "spans": [ + { + "bbox": [ + 115, + 82, + 195, + 95 + ], + "score": 1.0, + "content": "(1):131–142, 1966.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 115, + 82, + 195, + 95 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 101, + 506, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 101, + 506, + 115 + ], + "score": 1.0, + "content": "Anish Athalye, Nicholas Carlini, and David Wagner. Obfuscated gradients give a false sense of", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 114, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 116, + 114, + 505, + 126 + ], + "score": 1.0, + "content": "security: Circumventing defenses to adversarial examples. In International Conference on Machine", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 124, + 183, + 137 + ], + "spans": [ + { + "bbox": [ + 116, + 124, + 183, + 137 + ], + "score": 1.0, + "content": "Learning, 2018.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 101, + 506, + 137 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 144, + 506, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 143, + 506, + 158 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 158 + ], + "score": 1.0, + "content": "Jean-Yves Audibert, Remi Munos, and Csaba Szepesv ´ ari. Exploration-exploitation tradeoff using ´", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 156, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 116, + 156, + 506, + 168 + ], + "score": 1.0, + "content": "variance estimates in multi-armed bandits. Theoretical Computer Science, 410(19):1876–1902,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 166, + 142, + 178 + ], + "spans": [ + { + "bbox": [ + 115, + 166, + 142, + 178 + ], + "score": 1.0, + "content": "2009.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 143, + 506, + 178 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 506, + 220 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 506, + 200 + ], + "score": 1.0, + "content": "Borja Balle and Yu-Xiang Wang. Improving the gaussian mechanism for differential privacy:", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 197, + 507, + 211 + ], + "spans": [ + { + "bbox": [ + 115, + 197, + 507, + 211 + ], + "score": 1.0, + "content": "Analytical calibration and optimal denoising. In International Conference on Machine Learning,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 208, + 197, + 220 + ], + "spans": [ + { + "bbox": [ + 115, + 208, + 197, + 220 + ], + "score": 1.0, + "content": "pp. 403–412, 2018.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 185, + 507, + 220 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 263 + ], + "lines": [ + { + "bbox": [ + 106, + 228, + 506, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 228, + 506, + 241 + ], + "score": 1.0, + "content": "Gilles Barthe and Federico Olmedo. Beyond differential privacy: Composition theorems and relational", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 239, + 507, + 253 + ], + "spans": [ + { + "bbox": [ + 115, + 239, + 507, + 253 + ], + "score": 1.0, + "content": "logic for f-divergences between probabilistic programs. In International Colloquium on Automata,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 250, + 351, + 264 + ], + "spans": [ + { + "bbox": [ + 115, + 250, + 351, + 264 + ], + "score": 1.0, + "content": "Languages, and Programming, pp. 49–60. Springer, 2013.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 228, + 507, + 264 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 270, + 506, + 315 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 505, + 284 + ], + "score": 1.0, + "content": "Battista Biggio, Igino Corona, Davide Maiorca, Blaine Nelson, Nedim Srndic, Pavel Laskov, Giorgio", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 281, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 115, + 281, + 505, + 294 + ], + "score": 1.0, + "content": "Giacinto, and Fabio Roli. Evasion attacks against machine learning at test time. In Joint European", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 292, + 507, + 306 + ], + "spans": [ + { + "bbox": [ + 115, + 292, + 507, + 306 + ], + "score": 1.0, + "content": "conference on machine learning and knowledge discovery in databases, pp. 387–402. Springer,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 302, + 143, + 316 + ], + "spans": [ + { + "bbox": [ + 115, + 302, + 143, + 316 + ], + "score": 1.0, + "content": "2013.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 270, + 507, + 316 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 323, + 506, + 357 + ], + "lines": [ + { + "bbox": [ + 106, + 323, + 506, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 323, + 149, + 335 + ], + "score": 1.0, + "content": "Sebastian", + "type": "text" + }, + { + "bbox": [ + 165, + 323, + 202, + 335 + ], + "score": 1.0, + "content": "Bubeck.", + "type": "text" + }, + { + "bbox": [ + 261, + 323, + 294, + 335 + ], + "score": 1.0, + "content": "Orf523", + "type": "text" + }, + { + "bbox": [ + 310, + 324, + 356, + 335 + ], + "score": 1.0, + "content": "(advanced", + "type": "text" + }, + { + "bbox": [ + 370, + 323, + 506, + 335 + ], + "score": 1.0, + "content": "optimization): Introduction.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 114, + 333, + 507, + 348 + ], + "spans": [ + { + "bbox": [ + 114, + 333, + 507, + 348 + ], + "score": 1.0, + "content": "https://blogs.princeton.edu/imabandit/2013/02/05/orf523-advanced-optimization-introduction/,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 343, + 144, + 358 + ], + "spans": [ + { + "bbox": [ + 115, + 343, + 144, + 358 + ], + "score": 1.0, + "content": "2013.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 106, + 323, + 507, + 358 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 365, + 504, + 389 + ], + "lines": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "score": 1.0, + "content": "Charles J Clopper and Egon S Pearson. The use of confidence or fiducial limits illustrated in the case", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 376, + 321, + 388 + ], + "spans": [ + { + "bbox": [ + 116, + 376, + 321, + 388 + ], + "score": 1.0, + "content": "of the binomial. Biometrika, 26(4):404–413, 1934.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 106, + 365, + 505, + 388 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 505, + 420 + ], + "lines": [ + { + "bbox": [ + 106, + 396, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 505, + 409 + ], + "score": 1.0, + "content": "Jeremy M Cohen, Elan Rosenfeld, and J Zico Kolter. Certified adversarial robustness via randomized", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 408, + 326, + 419 + ], + "spans": [ + { + "bbox": [ + 116, + 408, + 326, + 419 + ], + "score": 1.0, + "content": "smoothing. arXiv preprint arXiv:1902.02918, 2019.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 106, + 396, + 505, + 419 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 428, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 106, + 428, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 428, + 506, + 441 + ], + "score": 1.0, + "content": "Imre Csiszar, Paul C Shields, et al. Information theory and statistics: A tutorial. ´ Foundations and", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 438, + 420, + 451 + ], + "spans": [ + { + "bbox": [ + 115, + 438, + 143, + 451 + ], + "score": 1.0, + "content": "Trends", + "type": "text" + }, + { + "bbox": [ + 144, + 439, + 154, + 450 + ], + "score": 0.7, + "content": "\\textsuperscript { \\textregistered }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 438, + 420, + 451 + ], + "score": 1.0, + "content": "in Communications and Information Theory, 1(4):417–528, 2004.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 106, + 428, + 506, + 451 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 504, + 482 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "Steven Diamond and Stephen Boyd. Cvxpy: A python-embedded modeling language for convex", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 470, + 451, + 483 + ], + "spans": [ + { + "bbox": [ + 116, + 470, + 451, + 483 + ], + "score": 1.0, + "content": "optimization. The Journal of Machine Learning Research, 17(1):2909–2913, 2016.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 459, + 505, + 483 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 489, + 504, + 513 + ], + "lines": [ + { + "bbox": [ + 106, + 490, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 505, + 503 + ], + "score": 1.0, + "content": "John Duchi and Hongseok Namkoong. Learning models with uniform performance via distributionally", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 501, + 362, + 513 + ], + "spans": [ + { + "bbox": [ + 115, + 501, + 362, + 513 + ], + "score": 1.0, + "content": "robust optimization. arXiv preprint arXiv:1810.08750, 2018.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 106, + 490, + 505, + 513 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 555 + ], + "lines": [ + { + "bbox": [ + 106, + 521, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 506, + 533 + ], + "score": 1.0, + "content": "Krishnamuthy Dvijotham, Robert Stanforth, Sven Gowal, Timothy Mann, and Pushmeet Kohli.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 532, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 115, + 532, + 505, + 545 + ], + "score": 1.0, + "content": "Towards scalable verification of neural networks: A dual approach. In Conference on Uncertainty", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 543, + 242, + 555 + ], + "spans": [ + { + "bbox": [ + 115, + 543, + 242, + 555 + ], + "score": 1.0, + "content": "in Artificial Intelligence, 2018.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 106, + 521, + 506, + 555 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 563, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 106, + 563, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 505, + 576 + ], + "score": 1.0, + "content": "Ian J Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 574, + 390, + 586 + ], + "spans": [ + { + "bbox": [ + 115, + 574, + 390, + 586 + ], + "score": 1.0, + "content": "examples. In International Conference on Machine Learning, 2015.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 106, + 563, + 505, + 586 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 594, + 506, + 628 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 607 + ], + "score": 1.0, + "content": "Po-Sen Huang, Robert Stanforth, Johannes Welbl, Chris Dyer, Dani Yogatama, Sven Gowal, Krishna-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 116, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "murthy Dvijotham, and Pushmeet Kohli. Achieving verified robustness to symbol substitutions via", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 617, + 392, + 629 + ], + "spans": [ + { + "bbox": [ + 116, + 617, + 392, + 629 + ], + "score": 1.0, + "content": "interval bound propagation. arXiv preprint arXiv:1909.01492, 2019.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 594, + 506, + 629 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 636, + 505, + 659 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 506, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 506, + 650 + ], + "score": 1.0, + "content": "Kenneth Hung and William Fithian. Rank verification for exponential families. The Annals of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 647, + 246, + 659 + ], + "spans": [ + { + "bbox": [ + 116, + 647, + 246, + 659 + ], + "score": 1.0, + "content": "Statistics, 47(2):758–782, 2019.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 635, + 506, + 659 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 667, + 505, + 690 + ], + "lines": [ + { + "bbox": [ + 106, + 667, + 504, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 504, + 680 + ], + "score": 1.0, + "content": "Robin Jia, Aditi Raghunathan, Kerem Goksel, and Percy Liang. Certified robustness to adversarial ¨", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 115, + 678, + 358, + 691 + ], + "spans": [ + { + "bbox": [ + 115, + 678, + 358, + 691 + ], + "score": 1.0, + "content": "word substitutions. arXiv preprint arXiv:1909.00986, 2019.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 106, + 667, + 504, + 691 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Guy Katz, Clark Barrett, David L Dill, Kyle Julian, and Mykel J Kochenderfer. Reluplex: An efficient", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 711, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 116, + 711, + 505, + 721 + ], + "score": 1.0, + "content": "smt solver for verifying deep neural networks. In International Conference on Computer Aided", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 719, + 281, + 733 + ], + "spans": [ + { + "bbox": [ + 115, + 719, + 281, + 733 + ], + "score": 1.0, + "content": "Verification, pp. 97–117. Springer, 2017.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 106, + 699, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Mathias Lecuyer, Vaggelis Atlidakis, Roxana Geambasu, Daniel Hsu, and Suman Jana. Certified", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 505, + 108 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 505, + 108 + ], + "score": 1.0, + "content": "robustness to adversarial examples with differential privacy. In 2019 IEEE Symposium on Security", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 105, + 296, + 117 + ], + "spans": [ + { + "bbox": [ + 116, + 105, + 168, + 117 + ], + "score": 1.0, + "content": "and Privacy", + "type": "text" + }, + { + "bbox": [ + 168, + 105, + 186, + 116 + ], + "score": 0.38, + "content": "( S P )", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 105, + 296, + 117 + ], + "score": 1.0, + "content": ", pp. 656–672. IEEE, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Guang-He Lee, Yang Yuan, Shiyu Chang, and Tommi S Jaakkola. A stratified approach to robustness", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 420, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 420, + 146 + ], + "score": 1.0, + "content": "for randomly smoothed classifiers. arXiv preprint arXiv:1906.04948, 2019.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 105, + 153, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 153, + 505, + 165 + ], + "score": 1.0, + "content": "Bai Li, Changyou Chen, Wenlin Wang, and Lawrence Carin. Certified adversarial robustness with", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 431, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 431, + 177 + ], + "score": 1.0, + "content": "additive noises. In Advances in Neural Information Processing Systems, 2019.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 182, + 504, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 182, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 505, + 196 + ], + "score": 1.0, + "content": "Chao Li, Xiaokong Ma, Bing Jiang, Xiangang Li, Xuewei Zhang, Xiao Liu, Ying Cao, Ajay Kannan,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 505, + 207 + ], + "score": 1.0, + "content": "and Zhenyao Zhu. Deep speaker: an end-to-end neural speaker embedding system. arXiv preprint", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 205, + 219, + 216 + ], + "spans": [ + { + "bbox": [ + 116, + 205, + 219, + 216 + ], + "score": 1.0, + "content": "arXiv:1705.02304, 2017.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 105, + 223, + 505, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 507, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 507, + 238 + ], + "score": 1.0, + "content": "Friedrich Liese and Igor Vajda. On divergences and informations in statistics and information theory.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 117, + 235, + 393, + 246 + ], + "spans": [ + { + "bbox": [ + 117, + 235, + 393, + 246 + ], + "score": 1.0, + "content": "IEEE Transactions on Information Theory, 52(10):4394–4412, 2006.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 505, + 288 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 506, + 266 + ], + "score": 1.0, + "content": "Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 265, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 116, + 265, + 505, + 277 + ], + "score": 1.0, + "content": "Towards deep learning models resistant to adversarial attacks. In International Conference on", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 276, + 249, + 288 + ], + "spans": [ + { + "bbox": [ + 115, + 276, + 249, + 288 + ], + "score": 1.0, + "content": "Learning Representations, 2018.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 107, + 294, + 505, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 295, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 295, + 505, + 307 + ], + "score": 1.0, + "content": "V. Panayotov, G. Chen, D. Povey, and S. Khudanpur. Librispeech: An asr corpus based on public", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 306, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 116, + 306, + 505, + 318 + ], + "score": 1.0, + "content": "domain audio books. In 2015 IEEE International Conference on Acoustics, Speech and Signal", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 316, + 472, + 329 + ], + "spans": [ + { + "bbox": [ + 115, + 316, + 472, + 329 + ], + "score": 1.0, + "content": "Processing (ICASSP), pp. 5206–5210, April 2015. doi: 10.1109/ICASSP.2015.7178964.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 335, + 506, + 369 + ], + "lines": [ + { + "bbox": [ + 106, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "Yao Qin, Nicholas Carlini, Ian Goodfellow, Garrison Cottrell, and Colin Raffel. Imperceptible,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 346, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 115, + 346, + 505, + 359 + ], + "score": 1.0, + "content": "robust, and targeted adversarial examples for automatic speech recognition. arXiv preprint", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 357, + 219, + 369 + ], + "spans": [ + { + "bbox": [ + 115, + 357, + 219, + 369 + ], + "score": 1.0, + "content": "arXiv:1903.10346, 2019.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 375, + 505, + 410 + ], + "lines": [ + { + "bbox": [ + 105, + 375, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 505, + 389 + ], + "score": 1.0, + "content": "Aditi Raghunathan, Jacob Steinhardt, and Percy Liang. Certified defenses against adversarial", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 387, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 116, + 387, + 505, + 400 + ], + "score": 1.0, + "content": "examples. In International Conference on Learning Representations, 2018. URL https://", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 117, + 399, + 319, + 411 + ], + "spans": [ + { + "bbox": [ + 117, + 399, + 254, + 411 + ], + "score": 1.0, + "content": "openreview.net/forum?id", + "type": "text" + }, + { + "bbox": [ + 254, + 399, + 261, + 408 + ], + "score": 0.6, + "content": "\\underline { { \\underline { { \\mathbf { \\Pi } } } } } =", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 399, + 319, + 411 + ], + "score": 1.0, + "content": "Bys4ob-Rb.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 416, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "score": 1.0, + "content": "Paris Smaragdis, Bhiksha Raj, and Madhusudana Shashanka. Missing data imputation for spectral", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 427, + 507, + 442 + ], + "spans": [ + { + "bbox": [ + 115, + 427, + 507, + 442 + ], + "score": 1.0, + "content": "audio signals. In 2009 IEEE International Workshop on Machine Learning for Signal Processing,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 440, + 203, + 451 + ], + "spans": [ + { + "bbox": [ + 115, + 440, + 203, + 451 + ], + "score": 1.0, + "content": "pp. 1–6. IEEE, 2009.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 104, + 457, + 505, + 481 + ], + "lines": [ + { + "bbox": [ + 105, + 456, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 471 + ], + "score": 1.0, + "content": "Thomas Steinke and Jonathan Ullman. Between pure and approximate differential privacy. Journal", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 469, + 288, + 481 + ], + "spans": [ + { + "bbox": [ + 115, + 469, + 288, + 481 + ], + "score": 1.0, + "content": "of Privacy and Confidentiality, 7(2), 2016.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 105, + 487, + 505, + 521 + ], + "lines": [ + { + "bbox": [ + 106, + 487, + 507, + 501 + ], + "spans": [ + { + "bbox": [ + 106, + 487, + 507, + 501 + ], + "score": 1.0, + "content": "Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 498, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 115, + 498, + 505, + 513 + ], + "score": 1.0, + "content": "and Rob Fergus. Intriguing properties of neural networks. In International Conference on Learning", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 510, + 210, + 522 + ], + "spans": [ + { + "bbox": [ + 115, + 510, + 210, + 522 + ], + "score": 1.0, + "content": "Representations, 2014.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 104, + 528, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 104, + 526, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 104, + 526, + 506, + 543 + ], + "score": 1.0, + "content": "Richard E Turner. Statistical models for natural sounds. PhD thesis, UCL (University College", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 539, + 181, + 551 + ], + "spans": [ + { + "bbox": [ + 115, + 539, + 181, + 551 + ], + "score": 1.0, + "content": "London), 2010.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 106, + 558, + 504, + 592 + ], + "lines": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "Jonathan Uesato, Brendan O’Donoghue, Aaron van den Oord, and Pushmeet Kohli. Adversarial", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 115, + 569, + 505, + 582 + ], + "score": 1.0, + "content": "risk and the dangers of evaluating against weak attacks. In International Conference on Machine", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 580, + 183, + 593 + ], + "spans": [ + { + "bbox": [ + 115, + 580, + 183, + 593 + ], + "score": 1.0, + "content": "Learning, 2018.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 105, + 599, + 504, + 622 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 505, + 613 + ], + "score": 1.0, + "content": "Eric Wong and J Zico Kolter. Provable defenses against adversarial examples via the convex outer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 610, + 423, + 623 + ], + "spans": [ + { + "bbox": [ + 115, + 610, + 423, + 623 + ], + "score": 1.0, + "content": "adversarial polytope. International Conference on Machine Learning, 2018.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 628, + 503, + 652 + ], + "lines": [ + { + "bbox": [ + 106, + 629, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 106, + 629, + 505, + 642 + ], + "score": 1.0, + "content": "Eric Wong, Frank Schmidt, Jan Hendrik Metzen, and J Zico Kolter. Scaling provable adversarial", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 640, + 471, + 653 + ], + "spans": [ + { + "bbox": [ + 116, + 640, + 471, + 653 + ], + "score": 1.0, + "content": "defenses. In Advances in Neural Information Processing Systems, pp. 8400–8409, 2018.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.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, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Mathias Lecuyer, Vaggelis Atlidakis, Roxana Geambasu, Daniel Hsu, and Suman Jana. Certified", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 505, + 108 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 505, + 108 + ], + "score": 1.0, + "content": "robustness to adversarial examples with differential privacy. In 2019 IEEE Symposium on Security", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 105, + 296, + 117 + ], + "spans": [ + { + "bbox": [ + 116, + 105, + 168, + 117 + ], + "score": 1.0, + "content": "and Privacy", + "type": "text" + }, + { + "bbox": [ + 168, + 105, + 186, + 116 + ], + "score": 0.38, + "content": "( S P )", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 105, + 296, + 117 + ], + "score": 1.0, + "content": ", pp. 656–672. IEEE, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 82, + 505, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Guang-He Lee, Yang Yuan, Shiyu Chang, and Tommi S Jaakkola. A stratified approach to robustness", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 420, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 420, + 146 + ], + "score": 1.0, + "content": "for randomly smoothed classifiers. arXiv preprint arXiv:1906.04948, 2019.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 106, + 123, + 505, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 153, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 106, + 153, + 505, + 165 + ], + "score": 1.0, + "content": "Bai Li, Changyou Chen, Wenlin Wang, and Lawrence Carin. Certified adversarial robustness with", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 431, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 431, + 177 + ], + "score": 1.0, + "content": "additive noises. In Advances in Neural Information Processing Systems, 2019.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 106, + 153, + 505, + 177 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 182, + 504, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 182, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 505, + 196 + ], + "score": 1.0, + "content": "Chao Li, Xiaokong Ma, Bing Jiang, Xiangang Li, Xuewei Zhang, Xiao Liu, Ying Cao, Ajay Kannan,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 505, + 207 + ], + "score": 1.0, + "content": "and Zhenyao Zhu. Deep speaker: an end-to-end neural speaker embedding system. arXiv preprint", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 205, + 219, + 216 + ], + "spans": [ + { + "bbox": [ + 116, + 205, + 219, + 216 + ], + "score": 1.0, + "content": "arXiv:1705.02304, 2017.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 182, + 505, + 216 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 223, + 505, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 507, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 507, + 238 + ], + "score": 1.0, + "content": "Friedrich Liese and Igor Vajda. On divergences and informations in statistics and information theory.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 117, + 235, + 393, + 246 + ], + "spans": [ + { + "bbox": [ + 117, + 235, + 393, + 246 + ], + "score": 1.0, + "content": "IEEE Transactions on Information Theory, 52(10):4394–4412, 2006.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 222, + 507, + 246 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 505, + 288 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 506, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 506, + 266 + ], + "score": 1.0, + "content": "Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 265, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 116, + 265, + 505, + 277 + ], + "score": 1.0, + "content": "Towards deep learning models resistant to adversarial attacks. In International Conference on", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 276, + 249, + 288 + ], + "spans": [ + { + "bbox": [ + 115, + 276, + 249, + 288 + ], + "score": 1.0, + "content": "Learning Representations, 2018.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 253, + 506, + 288 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 294, + 505, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 295, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 295, + 505, + 307 + ], + "score": 1.0, + "content": "V. Panayotov, G. Chen, D. Povey, and S. Khudanpur. Librispeech: An asr corpus based on public", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 306, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 116, + 306, + 505, + 318 + ], + "score": 1.0, + "content": "domain audio books. In 2015 IEEE International Conference on Acoustics, Speech and Signal", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 316, + 472, + 329 + ], + "spans": [ + { + "bbox": [ + 115, + 316, + 472, + 329 + ], + "score": 1.0, + "content": "Processing (ICASSP), pp. 5206–5210, April 2015. doi: 10.1109/ICASSP.2015.7178964.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 295, + 505, + 329 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 335, + 506, + 369 + ], + "lines": [ + { + "bbox": [ + 106, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "Yao Qin, Nicholas Carlini, Ian Goodfellow, Garrison Cottrell, and Colin Raffel. Imperceptible,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 346, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 115, + 346, + 505, + 359 + ], + "score": 1.0, + "content": "robust, and targeted adversarial examples for automatic speech recognition. arXiv preprint", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 357, + 219, + 369 + ], + "spans": [ + { + "bbox": [ + 115, + 357, + 219, + 369 + ], + "score": 1.0, + "content": "arXiv:1903.10346, 2019.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 106, + 335, + 506, + 369 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 375, + 505, + 410 + ], + "lines": [ + { + "bbox": [ + 105, + 375, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 505, + 389 + ], + "score": 1.0, + "content": "Aditi Raghunathan, Jacob Steinhardt, and Percy Liang. Certified defenses against adversarial", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 387, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 116, + 387, + 505, + 400 + ], + "score": 1.0, + "content": "examples. In International Conference on Learning Representations, 2018. URL https://", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 117, + 399, + 319, + 411 + ], + "spans": [ + { + "bbox": [ + 117, + 399, + 254, + 411 + ], + "score": 1.0, + "content": "openreview.net/forum?id", + "type": "text" + }, + { + "bbox": [ + 254, + 399, + 261, + 408 + ], + "score": 0.6, + "content": "\\underline { { \\underline { { \\mathbf { \\Pi } } } } } =", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 399, + 319, + 411 + ], + "score": 1.0, + "content": "Bys4ob-Rb.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 375, + 505, + 411 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 416, + 504, + 451 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 505, + 430 + ], + "score": 1.0, + "content": "Paris Smaragdis, Bhiksha Raj, and Madhusudana Shashanka. Missing data imputation for spectral", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 427, + 507, + 442 + ], + "spans": [ + { + "bbox": [ + 115, + 427, + 507, + 442 + ], + "score": 1.0, + "content": "audio signals. In 2009 IEEE International Workshop on Machine Learning for Signal Processing,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 440, + 203, + 451 + ], + "spans": [ + { + "bbox": [ + 115, + 440, + 203, + 451 + ], + "score": 1.0, + "content": "pp. 1–6. IEEE, 2009.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 416, + 507, + 451 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 457, + 505, + 481 + ], + "lines": [ + { + "bbox": [ + 105, + 456, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 471 + ], + "score": 1.0, + "content": "Thomas Steinke and Jonathan Ullman. Between pure and approximate differential privacy. Journal", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 469, + 288, + 481 + ], + "spans": [ + { + "bbox": [ + 115, + 469, + 288, + 481 + ], + "score": 1.0, + "content": "of Privacy and Confidentiality, 7(2), 2016.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 456, + 506, + 481 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 487, + 505, + 521 + ], + "lines": [ + { + "bbox": [ + 106, + 487, + 507, + 501 + ], + "spans": [ + { + "bbox": [ + 106, + 487, + 507, + 501 + ], + "score": 1.0, + "content": "Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 498, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 115, + 498, + 505, + 513 + ], + "score": 1.0, + "content": "and Rob Fergus. Intriguing properties of neural networks. In International Conference on Learning", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 510, + 210, + 522 + ], + "spans": [ + { + "bbox": [ + 115, + 510, + 210, + 522 + ], + "score": 1.0, + "content": "Representations, 2014.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 487, + 507, + 522 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 528, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 104, + 526, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 104, + 526, + 506, + 543 + ], + "score": 1.0, + "content": "Richard E Turner. Statistical models for natural sounds. PhD thesis, UCL (University College", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 539, + 181, + 551 + ], + "spans": [ + { + "bbox": [ + 115, + 539, + 181, + 551 + ], + "score": 1.0, + "content": "London), 2010.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 104, + 526, + 506, + 551 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 558, + 504, + 592 + ], + "lines": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "Jonathan Uesato, Brendan O’Donoghue, Aaron van den Oord, and Pushmeet Kohli. Adversarial", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 569, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 115, + 569, + 505, + 582 + ], + "score": 1.0, + "content": "risk and the dangers of evaluating against weak attacks. In International Conference on Machine", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 580, + 183, + 593 + ], + "spans": [ + { + "bbox": [ + 115, + 580, + 183, + 593 + ], + "score": 1.0, + "content": "Learning, 2018.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 106, + 558, + 505, + 593 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 599, + 504, + 622 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 505, + 613 + ], + "score": 1.0, + "content": "Eric Wong and J Zico Kolter. Provable defenses against adversarial examples via the convex outer", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 610, + 423, + 623 + ], + "spans": [ + { + "bbox": [ + 115, + 610, + 423, + 623 + ], + "score": 1.0, + "content": "adversarial polytope. International Conference on Machine Learning, 2018.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 598, + 505, + 623 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 628, + 503, + 652 + ], + "lines": [ + { + "bbox": [ + 106, + 629, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 106, + 629, + 505, + 642 + ], + "score": 1.0, + "content": "Eric Wong, Frank Schmidt, Jan Hendrik Metzen, and J Zico Kolter. Scaling provable adversarial", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 640, + 471, + 653 + ], + "spans": [ + { + "bbox": [ + 116, + 640, + 471, + 653 + ], + "score": 1.0, + "content": "defenses. In Advances in Neural Information Processing Systems, pp. 8400–8409, 2018.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 106, + 629, + 505, + 653 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 183, + 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": "title", + "bbox": [ + 107, + 107, + 390, + 118 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 391, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 391, + 119 + ], + "score": 1.0, + "content": "A.1 ADVERSARIAL SPECIFICATION FOR SMOOTHED CLASSIFIERS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 108, + 127, + 250, + 139 + ], + "lines": [ + { + "bbox": [ + 105, + 125, + 250, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 177, + 141 + ], + "score": 1.0, + "content": "Note that for any", + "type": "text" + }, + { + "bbox": [ + 177, + 128, + 214, + 140 + ], + "score": 0.92, + "content": "\\nu \\in \\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 125, + 250, + 141 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 193, + 144, + 417, + 162 + ], + "lines": [ + { + "bbox": [ + 193, + 144, + 417, + 162 + ], + "spans": [ + { + "bbox": [ + 193, + 144, + 417, + 162 + ], + "score": 0.9, + "content": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] = \\operatorname * { \\mathbb { P } } _ { X \\sim \\nu } [ h ( X ) = c ] - \\operatorname { \\mathbb { P } } _ { X \\sim \\nu } [ h ( X ) = c ^ { \\prime } ] ~ .", + "type": "interline_equation", + "image_path": "5887b450649865eea016184c4c5a13304c9900c37a76019922292c68371f1580.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 193, + 144, + 417, + 162 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 168, + 506, + 215 + ], + "lines": [ + { + "bbox": [ + 104, + 166, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 104, + 166, + 158, + 183 + ], + "score": 1.0, + "content": "Therefore,", + "type": "text" + }, + { + "bbox": [ + 158, + 168, + 265, + 181 + ], + "score": 0.89, + "content": "\\begin{array} { r l r } { \\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] } & { { } \\geq } & { 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 166, + 309, + 183 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 309, + 168, + 391, + 181 + ], + "score": 0.88, + "content": "c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 166, + 478, + 183 + ], + "score": 1.0, + "content": "is equivalent to", + "type": "text" + }, + { + "bbox": [ + 478, + 169, + 505, + 180 + ], + "score": 0.82, + "content": "c \\in", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 180, + 506, + 193 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 122, + 192 + ], + "score": 1.0, + "content": "arg", + "type": "text" + }, + { + "bbox": [ + 123, + 181, + 230, + 193 + ], + "score": 0.86, + "content": "\\mathrm { m a x } _ { y \\in \\mathcal { Y } } \\mathbb { P } _ { X \\sim \\nu } [ h ( X ) = y ]", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 180, + 251, + 192 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 251, + 180, + 293, + 192 + ], + "score": 0.94, + "content": "\\nu = \\mu ( x ^ { \\prime } )", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 180, + 359, + 192 + ], + "score": 1.0, + "content": ", this means that", + "type": "text" + }, + { + "bbox": [ + 360, + 181, + 405, + 192 + ], + "score": 0.92, + "content": "h _ { s } ( x ^ { \\prime } ) = c", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 180, + 506, + 192 + ], + "score": 1.0, + "content": "(assuming the argmax is", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 191, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 203, + 205 + ], + "score": 1.0, + "content": "unique). In other words,", + "type": "text" + }, + { + "bbox": [ + 204, + 192, + 289, + 204 + ], + "score": 0.9, + "content": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 191, + 316, + 205 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 316, + 192, + 367, + 204 + ], + "score": 0.92, + "content": "c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 191, + 397, + 205 + ], + "score": 1.0, + "content": "and all", + "type": "text" + }, + { + "bbox": [ + 397, + 192, + 451, + 204 + ], + "score": 0.92, + "content": "\\mu ( x ^ { \\prime } ) \\in \\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 191, + 506, + 205 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 202, + 455, + 216 + ], + "spans": [ + { + "bbox": [ + 107, + 203, + 152, + 215 + ], + "score": 0.92, + "content": "h _ { s } ( x ^ { \\prime } ) = c", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 202, + 180, + 216 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 180, + 204, + 189, + 213 + ], + "score": 0.86, + "content": "x ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 202, + 228, + 216 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 229, + 204, + 279, + 215 + ], + "score": 0.91, + "content": "d ( x , x ^ { \\prime } ) \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 202, + 455, + 216 + ], + "score": 1.0, + "content": ", proving the required robustness certificate.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "title", + "bbox": [ + 107, + 227, + 416, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 226, + 417, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 226, + 417, + 240 + ], + "score": 1.0, + "content": "A.1.1 ROBUSTNESS SPECIFICATION FOR SMOOTHED SOFT CLASSIFIERS", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 246, + 505, + 303 + ], + "lines": [ + { + "bbox": [ + 106, + 245, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 205, + 260 + ], + "score": 1.0, + "content": "Consider a soft classifier", + "type": "text" + }, + { + "bbox": [ + 205, + 247, + 270, + 258 + ], + "score": 0.92, + "content": "H : \\mathcal { X } \\to \\mathcal { P } ( \\mathcal { Y } )", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 245, + 344, + 260 + ], + "score": 1.0, + "content": "that for each input", + "type": "text" + }, + { + "bbox": [ + 345, + 249, + 352, + 257 + ], + "score": 0.76, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 245, + 481, + 260 + ], + "score": 1.0, + "content": "returns a probability distribution", + "type": "text" + }, + { + "bbox": [ + 482, + 247, + 505, + 258 + ], + "score": 0.91, + "content": "H ( x )", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 257, + 506, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 226, + 271 + ], + "score": 1.0, + "content": "over the set of potential labels", + "type": "text" + }, + { + "bbox": [ + 226, + 259, + 235, + 269 + ], + "score": 0.82, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 257, + 256, + 271 + ], + "score": 1.0, + "content": "(e.g.", + "type": "text" + }, + { + "bbox": [ + 256, + 259, + 266, + 268 + ], + "score": 0.78, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 257, + 506, + 271 + ], + "score": 1.0, + "content": "might represent the outputs of the soft-max layer of a neural", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "score": 1.0, + "content": "network). As in the case of hard classifiers, our methodology can be used to provide robustness", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 279, + 507, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 435, + 293 + ], + "score": 1.0, + "content": "guarantees for smoothed soft classifiers obtained by applying a smoothing measure", + "type": "text" + }, + { + "bbox": [ + 435, + 280, + 456, + 291 + ], + "score": 0.91, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 279, + 507, + 293 + ], + "score": 1.0, + "content": "to the input.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 290, + 495, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 382, + 305 + ], + "score": 1.0, + "content": "In this case, the smoothed classifier is again a soft classifier given by", + "type": "text" + }, + { + "bbox": [ + 382, + 291, + 490, + 304 + ], + "score": 0.92, + "content": "H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 290, + 495, + 305 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 505, + 397 + ], + "lines": [ + { + "bbox": [ + 105, + 308, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 123, + 321 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 311, + 130, + 318 + ], + "score": 0.75, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 308, + 264, + 321 + ], + "score": 1.0, + "content": "be a fixed input point and write", + "type": "text" + }, + { + "bbox": [ + 265, + 308, + 349, + 321 + ], + "score": 0.92, + "content": "p = H _ { s } ( x ) \\in \\mathcal { P } ( \\mathcal { V } )", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 308, + 506, + 321 + ], + "score": 1.0, + "content": "to denote the distribution over labels.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 319, + 506, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 354, + 331 + ], + "score": 1.0, + "content": "A number of robustness properties about the soft classifier", + "type": "text" + }, + { + "bbox": [ + 354, + 320, + 368, + 330 + ], + "score": 0.89, + "content": "H _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 319, + 381, + 331 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 381, + 321, + 388, + 329 + ], + "score": 0.76, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 319, + 506, + 331 + ], + "score": 1.0, + "content": "can be phrased in terms of", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 329, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 104, + 329, + 245, + 344 + ], + "score": 1.0, + "content": "Definition 2.2. For example, let", + "type": "text" + }, + { + "bbox": [ + 245, + 330, + 318, + 343 + ], + "score": 0.93, + "content": "\\mathcal { V } = \\{ 1 , \\ldots , K \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 329, + 393, + 344 + ], + "score": 1.0, + "content": "and suppose that", + "type": "text" + }, + { + "bbox": [ + 393, + 331, + 491, + 342 + ], + "score": 0.9, + "content": "p _ { 1 } \\ge p _ { 2 } \\ge \\cdots \\ge p _ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 329, + 506, + 344 + ], + "score": 1.0, + "content": "so", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 340, + 506, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 125, + 354 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 125, + 342, + 169, + 353 + ], + "score": 0.93, + "content": "\\{ 1 , \\ldots , k \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 340, + 217, + 354 + ], + "score": 1.0, + "content": "are the top", + "type": "text" + }, + { + "bbox": [ + 217, + 342, + 225, + 352 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 340, + 263, + 354 + ], + "score": 1.0, + "content": "labels at", + "type": "text" + }, + { + "bbox": [ + 263, + 344, + 270, + 351 + ], + "score": 0.8, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 340, + 435, + 354 + ], + "score": 1.0, + "content": ". Then we can verify that the set of top", + "type": "text" + }, + { + "bbox": [ + 435, + 342, + 442, + 352 + ], + "score": 0.77, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 340, + 506, + 354 + ], + "score": 1.0, + "content": "labels will not", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 352, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 263, + 365 + ], + "score": 1.0, + "content": "change when moving the input from", + "type": "text" + }, + { + "bbox": [ + 263, + 355, + 271, + 362 + ], + "score": 0.77, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 352, + 284, + 365 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 284, + 353, + 294, + 362 + ], + "score": 0.86, + "content": "x ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 352, + 318, + 365 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 319, + 352, + 378, + 364 + ], + "score": 0.92, + "content": "\\| x - x ^ { \\prime } \\| \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 352, + 505, + 365 + ], + "score": 1.0, + "content": "by defining the specifications", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 362, + 506, + 377 + ], + "spans": [ + { + "bbox": [ + 107, + 363, + 213, + 376 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\phi _ { i , j } ( \\bar { z } ) = H ( z ) _ { i } - \\bar { H } ( z ) _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 362, + 230, + 377 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 230, + 363, + 268, + 375 + ], + "score": 0.92, + "content": "i \\in [ 1 , k ]", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 362, + 287, + 377 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 287, + 364, + 348, + 375 + ], + "score": 0.91, + "content": "j \\in [ k + 1 , K ]", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 362, + 471, + 377 + ], + "score": 1.0, + "content": ", and showing that all of these", + "type": "text" + }, + { + "bbox": [ + 472, + 364, + 488, + 376 + ], + "score": 0.9, + "content": "\\phi _ { i , j }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 362, + 506, + 377 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 374, + 506, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 186, + 387 + ], + "score": 1.0, + "content": "robustly certified at", + "type": "text" + }, + { + "bbox": [ + 187, + 375, + 207, + 386 + ], + "score": 0.91, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 374, + 298, + 387 + ], + "score": 1.0, + "content": "with respect to the set", + "type": "text" + }, + { + "bbox": [ + 298, + 375, + 318, + 387 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 374, + 417, + 387 + ], + "score": 1.0, + "content": "defined above. The case", + "type": "text" + }, + { + "bbox": [ + 417, + 375, + 443, + 385 + ], + "score": 0.9, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 374, + 506, + 387 + ], + "score": 1.0, + "content": "corresponds to", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 384, + 455, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 455, + 398 + ], + "score": 1.0, + "content": "robustness of the standard classification rule outputting the label with the largest score.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 402, + 506, + 474 + ], + "lines": [ + { + "bbox": [ + 106, + 401, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 505, + 415 + ], + "score": 1.0, + "content": "Another example is robustness of classifiers which are allowed to abstain. For example, suppose we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 413, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 196, + 427 + ], + "score": 1.0, + "content": "build a hard classifier", + "type": "text" + }, + { + "bbox": [ + 196, + 413, + 204, + 425 + ], + "score": 0.83, + "content": "\\tilde { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 414, + 232, + 427 + ], + "score": 1.0, + "content": "out of", + "type": "text" + }, + { + "bbox": [ + 232, + 415, + 246, + 426 + ], + "score": 0.89, + "content": "H _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "which returns the label with the maximum score as long as the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 425, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 365, + 439 + ], + "score": 1.0, + "content": "gap between this score and the score of any other label is at least", + "type": "text" + }, + { + "bbox": [ + 366, + 428, + 373, + 437 + ], + "score": 0.82, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 425, + 506, + 439 + ], + "score": 1.0, + "content": "; otherwise it produces no output.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 436, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 104, + 437, + 203, + 453 + ], + "score": 1.0, + "content": "Then we can certify that", + "type": "text" + }, + { + "bbox": [ + 204, + 436, + 211, + 448 + ], + "score": 0.83, + "content": "\\tilde { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 437, + 352, + 453 + ], + "score": 1.0, + "content": "will not abstain and return the label", + "type": "text" + }, + { + "bbox": [ + 352, + 439, + 433, + 451 + ], + "score": 0.9, + "content": "c = \\arg \\operatorname* { m a x } _ { y \\in \\mathcal { y } } p _ { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 437, + 506, + 453 + ], + "score": 1.0, + "content": "at any point close", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 117, + 463 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 452, + 124, + 460 + ], + "score": 0.76, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 124, + 450, + 215, + 463 + ], + "score": 1.0, + "content": "by showing that every", + "type": "text" + }, + { + "bbox": [ + 216, + 450, + 370, + 462 + ], + "score": 0.91, + "content": "\\phi _ { c ^ { \\prime } } ( z ) = H ( z ) _ { c } - H ( z ) _ { c ^ { \\prime } } - \\gamma , c ^ { \\prime } \\neq c", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 450, + 462, + 463 + ], + "score": 1.0, + "content": ", is robustly certified at", + "type": "text" + }, + { + "bbox": [ + 463, + 450, + 483, + 462 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 450, + 505, + 463 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 461, + 171, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 147, + 475 + ], + "score": 1.0, + "content": "respect to", + "type": "text" + }, + { + "bbox": [ + 147, + 462, + 167, + 474 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 461, + 171, + 475 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24.5 + }, + { + "type": "title", + "bbox": [ + 109, + 487, + 282, + 498 + ], + "lines": [ + { + "bbox": [ + 106, + 486, + 283, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 283, + 499 + ], + "score": 1.0, + "content": "A.2 BACKGROUND ON F-DIVERGENCES", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 108, + 507, + 505, + 541 + ], + "lines": [ + { + "bbox": [ + 106, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 271, + 520 + ], + "score": 1.0, + "content": "A number of well-known properties about", + "type": "text" + }, + { + "bbox": [ + 271, + 508, + 278, + 519 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "-divergences are used throughout the paper, both explicitly", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "and implicitly. Here we review such properties for the readers’ convenience. Proofs and further", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 529, + 396, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 396, + 542 + ], + "score": 1.0, + "content": "details can be found in, e.g., (Csiszar et al., 2004; Liese & Vajda, 2006). ´", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 107, + 546, + 506, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 546, + 507, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 164, + 559 + ], + "score": 1.0, + "content": "Recall that the", + "type": "text" + }, + { + "bbox": [ + 165, + 547, + 172, + 558 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 546, + 375, + 559 + ], + "score": 1.0, + "content": "-divergences can be defined for any convex function", + "type": "text" + }, + { + "bbox": [ + 375, + 546, + 427, + 558 + ], + "score": 0.92, + "content": "f : \\mathbb { R } _ { + } \\to \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 546, + 465, + 559 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 465, + 546, + 503, + 558 + ], + "score": 0.93, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 546, + 507, + 559 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 557, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 393, + 570 + ], + "score": 1.0, + "content": "We note that this requirement holds without loss of generality as the map", + "type": "text" + }, + { + "bbox": [ + 393, + 557, + 465, + 569 + ], + "score": 0.93, + "content": "x \\mapsto f ( x ) - f ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 557, + 505, + 570 + ], + "score": 1.0, + "content": "is convex", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 567, + 381, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 147, + 582 + ], + "score": 1.0, + "content": "whenever", + "type": "text" + }, + { + "bbox": [ + 147, + 569, + 154, + 580 + ], + "score": 0.87, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 567, + 218, + 582 + ], + "score": 1.0, + "content": "is convex. Any", + "type": "text" + }, + { + "bbox": [ + 218, + 569, + 225, + 580 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 567, + 272, + 582 + ], + "score": 1.0, + "content": "-divergence", + "type": "text" + }, + { + "bbox": [ + 273, + 569, + 287, + 581 + ], + "score": 0.9, + "content": "D _ { f }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 567, + 381, + 582 + ], + "score": 1.0, + "content": "satisfies the following:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 129, + 588, + 503, + 650 + ], + "lines": [ + { + "bbox": [ + 129, + 588, + 203, + 602 + ], + "spans": [ + { + "bbox": [ + 129, + 588, + 142, + 602 + ], + "score": 1.0, + "content": "1.", + "type": "text" + }, + { + "bbox": [ + 142, + 589, + 199, + 602 + ], + "score": 0.89, + "content": "D _ { f } ( \\nu \\| \\rho ) \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 588, + 203, + 602 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 128, + 603, + 474, + 619 + ], + "spans": [ + { + "bbox": [ + 128, + 603, + 142, + 619 + ], + "score": 1.0, + "content": "2.", + "type": "text" + }, + { + "bbox": [ + 142, + 604, + 198, + 617 + ], + "score": 0.91, + "content": "D _ { f } ( \\rho \\| \\rho ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 603, + 219, + 619 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 219, + 605, + 275, + 617 + ], + "score": 0.95, + "content": "D _ { f } ( \\nu \\| \\rho ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 603, + 308, + 619 + ], + "score": 1.0, + "content": "implies", + "type": "text" + }, + { + "bbox": [ + 308, + 606, + 334, + 617 + ], + "score": 0.92, + "content": "\\nu = \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 603, + 375, + 619 + ], + "score": 1.0, + "content": "whenever", + "type": "text" + }, + { + "bbox": [ + 376, + 606, + 383, + 617 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 603, + 474, + 619 + ], + "score": 1.0, + "content": "is strictly convex at 1.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 128, + 619, + 503, + 634 + ], + "spans": [ + { + "bbox": [ + 128, + 619, + 142, + 634 + ], + "score": 1.0, + "content": "3.", + "type": "text" + }, + { + "bbox": [ + 142, + 620, + 268, + 633 + ], + "score": 0.93, + "content": "D _ { f } ( F _ { * } ( \\nu ) \\| F _ { * } ( \\rho ) ) \\le D _ { f } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 619, + 336, + 634 + ], + "score": 1.0, + "content": "for any function", + "type": "text" + }, + { + "bbox": [ + 336, + 621, + 345, + 630 + ], + "score": 0.84, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 619, + 375, + 634 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 375, + 620, + 400, + 632 + ], + "score": 0.93, + "content": "F _ { * } ( \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 619, + 492, + 634 + ], + "score": 1.0, + "content": "is the push-forward of", + "type": "text" + }, + { + "bbox": [ + 493, + 623, + 499, + 632 + ], + "score": 0.81, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 499, + 619, + 503, + 634 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 128, + 636, + 448, + 651 + ], + "spans": [ + { + "bbox": [ + 128, + 636, + 142, + 651 + ], + "score": 1.0, + "content": "4.", + "type": "text" + }, + { + "bbox": [ + 142, + 636, + 231, + 650 + ], + "score": 0.92, + "content": "D _ { f } ( \\nu \\| \\rho ) = D _ { \\bar { f } } ( \\rho \\| \\nu )", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 636, + 259, + 651 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 259, + 636, + 320, + 650 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\bar { f } ( u ) = u f \\left( \\frac { 1 } { u } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 636, + 406, + 651 + ], + "score": 1.0, + "content": "is again convex with", + "type": "text" + }, + { + "bbox": [ + 406, + 636, + 444, + 649 + ], + "score": 0.93, + "content": "{ \\bar { f } } ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 636, + 448, + 651 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5 + }, + { + "type": "title", + "bbox": [ + 108, + 662, + 276, + 674 + ], + "lines": [ + { + "bbox": [ + 106, + 662, + 277, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 277, + 675 + ], + "score": 1.0, + "content": "A.3 BOUNDING RENYI DIVERGENCES", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 683, + 269, + 695 + ], + "lines": [ + { + "bbox": [ + 106, + 681, + 270, + 697 + ], + "spans": [ + { + "bbox": [ + 106, + 681, + 270, + 697 + ], + "score": 1.0, + "content": "We being with the optimization problem", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "interline_equation", + "bbox": [ + 258, + 700, + 357, + 736 + ], + "lines": [ + { + "bbox": [ + 258, + 700, + 357, + 736 + ], + "spans": [ + { + "bbox": [ + 258, + 700, + 357, + 736 + ], + "score": 0.64, + "content": "\\begin{array} { r } { \\underset { x ^ { \\prime } } { \\operatorname* { m a x } } R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) } \\\\ { \\mathrm { s u b j e c t ~ t o ~ } \\| x - x ^ { \\prime } \\| _ { p } \\leq \\epsilon } \\end{array}", + "type": "interline_equation", + "image_path": "ffd4570ca1f1d8a57429322349f103fa2b73834471d68c3191af1e0e499e0456.jpg" + } + ] + } + ], + "index": 41.5, + "virtual_lines": [ + { + "bbox": [ + 258, + 700, + 357, + 718.0 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 258, + 718.0, + 357, + 736.0 + ], + "spans": [], + "index": 42 + } + ] + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 294, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "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, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 183, + 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": "title", + "bbox": [ + 107, + 107, + 390, + 118 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 391, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 391, + 119 + ], + "score": 1.0, + "content": "A.1 ADVERSARIAL SPECIFICATION FOR SMOOTHED CLASSIFIERS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 108, + 127, + 250, + 139 + ], + "lines": [ + { + "bbox": [ + 105, + 125, + 250, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 125, + 177, + 141 + ], + "score": 1.0, + "content": "Note that for any", + "type": "text" + }, + { + "bbox": [ + 177, + 128, + 214, + 140 + ], + "score": 0.92, + "content": "\\nu \\in \\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 125, + 250, + 141 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 125, + 250, + 141 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 193, + 144, + 417, + 162 + ], + "lines": [ + { + "bbox": [ + 193, + 144, + 417, + 162 + ], + "spans": [ + { + "bbox": [ + 193, + 144, + 417, + 162 + ], + "score": 0.9, + "content": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] = \\operatorname * { \\mathbb { P } } _ { X \\sim \\nu } [ h ( X ) = c ] - \\operatorname { \\mathbb { P } } _ { X \\sim \\nu } [ h ( X ) = c ^ { \\prime } ] ~ .", + "type": "interline_equation", + "image_path": "5887b450649865eea016184c4c5a13304c9900c37a76019922292c68371f1580.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 193, + 144, + 417, + 162 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 168, + 506, + 215 + ], + "lines": [ + { + "bbox": [ + 104, + 166, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 104, + 166, + 158, + 183 + ], + "score": 1.0, + "content": "Therefore,", + "type": "text" + }, + { + "bbox": [ + 158, + 168, + 265, + 181 + ], + "score": 0.89, + "content": "\\begin{array} { r l r } { \\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] } & { { } \\geq } & { 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 166, + 309, + 183 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 309, + 168, + 391, + 181 + ], + "score": 0.88, + "content": "c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 166, + 478, + 183 + ], + "score": 1.0, + "content": "is equivalent to", + "type": "text" + }, + { + "bbox": [ + 478, + 169, + 505, + 180 + ], + "score": 0.82, + "content": "c \\in", + "type": "inline_equation" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 180, + 506, + 193 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 122, + 192 + ], + "score": 1.0, + "content": "arg", + "type": "text" + }, + { + "bbox": [ + 123, + 181, + 230, + 193 + ], + "score": 0.86, + "content": "\\mathrm { m a x } _ { y \\in \\mathcal { Y } } \\mathbb { P } _ { X \\sim \\nu } [ h ( X ) = y ]", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 180, + 251, + 192 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 251, + 180, + 293, + 192 + ], + "score": 0.94, + "content": "\\nu = \\mu ( x ^ { \\prime } )", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 180, + 359, + 192 + ], + "score": 1.0, + "content": ", this means that", + "type": "text" + }, + { + "bbox": [ + 360, + 181, + 405, + 192 + ], + "score": 0.92, + "content": "h _ { s } ( x ^ { \\prime } ) = c", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 180, + 506, + 192 + ], + "score": 1.0, + "content": "(assuming the argmax is", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 191, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 203, + 205 + ], + "score": 1.0, + "content": "unique). In other words,", + "type": "text" + }, + { + "bbox": [ + 204, + 192, + 289, + 204 + ], + "score": 0.9, + "content": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 191, + 316, + 205 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 316, + 192, + 367, + 204 + ], + "score": 0.92, + "content": "c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 191, + 397, + 205 + ], + "score": 1.0, + "content": "and all", + "type": "text" + }, + { + "bbox": [ + 397, + 192, + 451, + 204 + ], + "score": 0.92, + "content": "\\mu ( x ^ { \\prime } ) \\in \\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 191, + 506, + 205 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 202, + 455, + 216 + ], + "spans": [ + { + "bbox": [ + 107, + 203, + 152, + 215 + ], + "score": 0.92, + "content": "h _ { s } ( x ^ { \\prime } ) = c", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 202, + 180, + 216 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 180, + 204, + 189, + 213 + ], + "score": 0.86, + "content": "x ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 202, + 228, + 216 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 229, + 204, + 279, + 215 + ], + "score": 0.91, + "content": "d ( x , x ^ { \\prime } ) \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 202, + 455, + 216 + ], + "score": 1.0, + "content": ", proving the required robustness certificate.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5, + "bbox_fs": [ + 104, + 166, + 506, + 216 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 227, + 416, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 226, + 417, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 226, + 417, + 240 + ], + "score": 1.0, + "content": "A.1.1 ROBUSTNESS SPECIFICATION FOR SMOOTHED SOFT CLASSIFIERS", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 246, + 505, + 303 + ], + "lines": [ + { + "bbox": [ + 106, + 245, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 205, + 260 + ], + "score": 1.0, + "content": "Consider a soft classifier", + "type": "text" + }, + { + "bbox": [ + 205, + 247, + 270, + 258 + ], + "score": 0.92, + "content": "H : \\mathcal { X } \\to \\mathcal { P } ( \\mathcal { Y } )", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 245, + 344, + 260 + ], + "score": 1.0, + "content": "that for each input", + "type": "text" + }, + { + "bbox": [ + 345, + 249, + 352, + 257 + ], + "score": 0.76, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 245, + 481, + 260 + ], + "score": 1.0, + "content": "returns a probability distribution", + "type": "text" + }, + { + "bbox": [ + 482, + 247, + 505, + 258 + ], + "score": 0.91, + "content": "H ( x )", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 257, + 506, + 271 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 226, + 271 + ], + "score": 1.0, + "content": "over the set of potential labels", + "type": "text" + }, + { + "bbox": [ + 226, + 259, + 235, + 269 + ], + "score": 0.82, + "content": "\\mathcal { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 257, + 256, + 271 + ], + "score": 1.0, + "content": "(e.g.", + "type": "text" + }, + { + "bbox": [ + 256, + 259, + 266, + 268 + ], + "score": 0.78, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 257, + 506, + 271 + ], + "score": 1.0, + "content": "might represent the outputs of the soft-max layer of a neural", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 505, + 281 + ], + "score": 1.0, + "content": "network). As in the case of hard classifiers, our methodology can be used to provide robustness", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 279, + 507, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 435, + 293 + ], + "score": 1.0, + "content": "guarantees for smoothed soft classifiers obtained by applying a smoothing measure", + "type": "text" + }, + { + "bbox": [ + 435, + 280, + 456, + 291 + ], + "score": 0.91, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 279, + 507, + 293 + ], + "score": 1.0, + "content": "to the input.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 290, + 495, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 382, + 305 + ], + "score": 1.0, + "content": "In this case, the smoothed classifier is again a soft classifier given by", + "type": "text" + }, + { + "bbox": [ + 382, + 291, + 490, + 304 + ], + "score": 0.92, + "content": "H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 290, + 495, + 305 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 245, + 507, + 305 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 505, + 397 + ], + "lines": [ + { + "bbox": [ + 105, + 308, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 123, + 321 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 311, + 130, + 318 + ], + "score": 0.75, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 308, + 264, + 321 + ], + "score": 1.0, + "content": "be a fixed input point and write", + "type": "text" + }, + { + "bbox": [ + 265, + 308, + 349, + 321 + ], + "score": 0.92, + "content": "p = H _ { s } ( x ) \\in \\mathcal { P } ( \\mathcal { V } )", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 308, + 506, + 321 + ], + "score": 1.0, + "content": "to denote the distribution over labels.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 319, + 506, + 331 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 354, + 331 + ], + "score": 1.0, + "content": "A number of robustness properties about the soft classifier", + "type": "text" + }, + { + "bbox": [ + 354, + 320, + 368, + 330 + ], + "score": 0.89, + "content": "H _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 319, + 381, + 331 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 381, + 321, + 388, + 329 + ], + "score": 0.76, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 319, + 506, + 331 + ], + "score": 1.0, + "content": "can be phrased in terms of", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 329, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 104, + 329, + 245, + 344 + ], + "score": 1.0, + "content": "Definition 2.2. For example, let", + "type": "text" + }, + { + "bbox": [ + 245, + 330, + 318, + 343 + ], + "score": 0.93, + "content": "\\mathcal { V } = \\{ 1 , \\ldots , K \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 329, + 393, + 344 + ], + "score": 1.0, + "content": "and suppose that", + "type": "text" + }, + { + "bbox": [ + 393, + 331, + 491, + 342 + ], + "score": 0.9, + "content": "p _ { 1 } \\ge p _ { 2 } \\ge \\cdots \\ge p _ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 329, + 506, + 344 + ], + "score": 1.0, + "content": "so", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 340, + 506, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 125, + 354 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 125, + 342, + 169, + 353 + ], + "score": 0.93, + "content": "\\{ 1 , \\ldots , k \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 340, + 217, + 354 + ], + "score": 1.0, + "content": "are the top", + "type": "text" + }, + { + "bbox": [ + 217, + 342, + 225, + 352 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 340, + 263, + 354 + ], + "score": 1.0, + "content": "labels at", + "type": "text" + }, + { + "bbox": [ + 263, + 344, + 270, + 351 + ], + "score": 0.8, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 340, + 435, + 354 + ], + "score": 1.0, + "content": ". Then we can verify that the set of top", + "type": "text" + }, + { + "bbox": [ + 435, + 342, + 442, + 352 + ], + "score": 0.77, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 340, + 506, + 354 + ], + "score": 1.0, + "content": "labels will not", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 352, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 263, + 365 + ], + "score": 1.0, + "content": "change when moving the input from", + "type": "text" + }, + { + "bbox": [ + 263, + 355, + 271, + 362 + ], + "score": 0.77, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 352, + 284, + 365 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 284, + 353, + 294, + 362 + ], + "score": 0.86, + "content": "x ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 352, + 318, + 365 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 319, + 352, + 378, + 364 + ], + "score": 0.92, + "content": "\\| x - x ^ { \\prime } \\| \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 352, + 505, + 365 + ], + "score": 1.0, + "content": "by defining the specifications", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 362, + 506, + 377 + ], + "spans": [ + { + "bbox": [ + 107, + 363, + 213, + 376 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\phi _ { i , j } ( \\bar { z } ) = H ( z ) _ { i } - \\bar { H } ( z ) _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 362, + 230, + 377 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 230, + 363, + 268, + 375 + ], + "score": 0.92, + "content": "i \\in [ 1 , k ]", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 362, + 287, + 377 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 287, + 364, + 348, + 375 + ], + "score": 0.91, + "content": "j \\in [ k + 1 , K ]", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 362, + 471, + 377 + ], + "score": 1.0, + "content": ", and showing that all of these", + "type": "text" + }, + { + "bbox": [ + 472, + 364, + 488, + 376 + ], + "score": 0.9, + "content": "\\phi _ { i , j }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 362, + 506, + 377 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 374, + 506, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 186, + 387 + ], + "score": 1.0, + "content": "robustly certified at", + "type": "text" + }, + { + "bbox": [ + 187, + 375, + 207, + 386 + ], + "score": 0.91, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 374, + 298, + 387 + ], + "score": 1.0, + "content": "with respect to the set", + "type": "text" + }, + { + "bbox": [ + 298, + 375, + 318, + 387 + ], + "score": 0.9, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 374, + 417, + 387 + ], + "score": 1.0, + "content": "defined above. The case", + "type": "text" + }, + { + "bbox": [ + 417, + 375, + 443, + 385 + ], + "score": 0.9, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 374, + 506, + 387 + ], + "score": 1.0, + "content": "corresponds to", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 384, + 455, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 455, + 398 + ], + "score": 1.0, + "content": "robustness of the standard classification rule outputting the label with the largest score.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5, + "bbox_fs": [ + 104, + 308, + 506, + 398 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 402, + 506, + 474 + ], + "lines": [ + { + "bbox": [ + 106, + 401, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 401, + 505, + 415 + ], + "score": 1.0, + "content": "Another example is robustness of classifiers which are allowed to abstain. For example, suppose we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 413, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 196, + 427 + ], + "score": 1.0, + "content": "build a hard classifier", + "type": "text" + }, + { + "bbox": [ + 196, + 413, + 204, + 425 + ], + "score": 0.83, + "content": "\\tilde { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 414, + 232, + 427 + ], + "score": 1.0, + "content": "out of", + "type": "text" + }, + { + "bbox": [ + 232, + 415, + 246, + 426 + ], + "score": 0.89, + "content": "H _ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "which returns the label with the maximum score as long as the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 425, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 365, + 439 + ], + "score": 1.0, + "content": "gap between this score and the score of any other label is at least", + "type": "text" + }, + { + "bbox": [ + 366, + 428, + 373, + 437 + ], + "score": 0.82, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 425, + 506, + 439 + ], + "score": 1.0, + "content": "; otherwise it produces no output.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 436, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 104, + 437, + 203, + 453 + ], + "score": 1.0, + "content": "Then we can certify that", + "type": "text" + }, + { + "bbox": [ + 204, + 436, + 211, + 448 + ], + "score": 0.83, + "content": "\\tilde { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 437, + 352, + 453 + ], + "score": 1.0, + "content": "will not abstain and return the label", + "type": "text" + }, + { + "bbox": [ + 352, + 439, + 433, + 451 + ], + "score": 0.9, + "content": "c = \\arg \\operatorname* { m a x } _ { y \\in \\mathcal { y } } p _ { y }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 437, + 506, + 453 + ], + "score": 1.0, + "content": "at any point close", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 450, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 117, + 463 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 452, + 124, + 460 + ], + "score": 0.76, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 124, + 450, + 215, + 463 + ], + "score": 1.0, + "content": "by showing that every", + "type": "text" + }, + { + "bbox": [ + 216, + 450, + 370, + 462 + ], + "score": 0.91, + "content": "\\phi _ { c ^ { \\prime } } ( z ) = H ( z ) _ { c } - H ( z ) _ { c ^ { \\prime } } - \\gamma , c ^ { \\prime } \\neq c", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 450, + 462, + 463 + ], + "score": 1.0, + "content": ", is robustly certified at", + "type": "text" + }, + { + "bbox": [ + 463, + 450, + 483, + 462 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 450, + 505, + 463 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 461, + 171, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 147, + 475 + ], + "score": 1.0, + "content": "respect to", + "type": "text" + }, + { + "bbox": [ + 147, + 462, + 167, + 474 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { x , \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 461, + 171, + 475 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24.5, + "bbox_fs": [ + 104, + 401, + 506, + 475 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 487, + 282, + 498 + ], + "lines": [ + { + "bbox": [ + 106, + 486, + 283, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 283, + 499 + ], + "score": 1.0, + "content": "A.2 BACKGROUND ON F-DIVERGENCES", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 108, + 507, + 505, + 541 + ], + "lines": [ + { + "bbox": [ + 106, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 271, + 520 + ], + "score": 1.0, + "content": "A number of well-known properties about", + "type": "text" + }, + { + "bbox": [ + 271, + 508, + 278, + 519 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "-divergences are used throughout the paper, both explicitly", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "and implicitly. Here we review such properties for the readers’ convenience. Proofs and further", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 529, + 396, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 396, + 542 + ], + "score": 1.0, + "content": "details can be found in, e.g., (Csiszar et al., 2004; Liese & Vajda, 2006). ´", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 507, + 505, + 542 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 546, + 506, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 546, + 507, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 164, + 559 + ], + "score": 1.0, + "content": "Recall that the", + "type": "text" + }, + { + "bbox": [ + 165, + 547, + 172, + 558 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 546, + 375, + 559 + ], + "score": 1.0, + "content": "-divergences can be defined for any convex function", + "type": "text" + }, + { + "bbox": [ + 375, + 546, + 427, + 558 + ], + "score": 0.92, + "content": "f : \\mathbb { R } _ { + } \\to \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 546, + 465, + 559 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 465, + 546, + 503, + 558 + ], + "score": 0.93, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 546, + 507, + 559 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 557, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 393, + 570 + ], + "score": 1.0, + "content": "We note that this requirement holds without loss of generality as the map", + "type": "text" + }, + { + "bbox": [ + 393, + 557, + 465, + 569 + ], + "score": 0.93, + "content": "x \\mapsto f ( x ) - f ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 557, + 505, + 570 + ], + "score": 1.0, + "content": "is convex", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 567, + 381, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 147, + 582 + ], + "score": 1.0, + "content": "whenever", + "type": "text" + }, + { + "bbox": [ + 147, + 569, + 154, + 580 + ], + "score": 0.87, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 567, + 218, + 582 + ], + "score": 1.0, + "content": "is convex. Any", + "type": "text" + }, + { + "bbox": [ + 218, + 569, + 225, + 580 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 567, + 272, + 582 + ], + "score": 1.0, + "content": "-divergence", + "type": "text" + }, + { + "bbox": [ + 273, + 569, + 287, + 581 + ], + "score": 0.9, + "content": "D _ { f }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 567, + 381, + 582 + ], + "score": 1.0, + "content": "satisfies the following:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 546, + 507, + 582 + ] + }, + { + "type": "index", + "bbox": [ + 129, + 588, + 503, + 650 + ], + "lines": [ + { + "bbox": [ + 129, + 588, + 203, + 602 + ], + "spans": [ + { + "bbox": [ + 129, + 588, + 142, + 602 + ], + "score": 1.0, + "content": "1.", + "type": "text" + }, + { + "bbox": [ + 142, + 589, + 199, + 602 + ], + "score": 0.89, + "content": "D _ { f } ( \\nu \\| \\rho ) \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 588, + 203, + 602 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 128, + 603, + 474, + 619 + ], + "spans": [ + { + "bbox": [ + 128, + 603, + 142, + 619 + ], + "score": 1.0, + "content": "2.", + "type": "text" + }, + { + "bbox": [ + 142, + 604, + 198, + 617 + ], + "score": 0.91, + "content": "D _ { f } ( \\rho \\| \\rho ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 603, + 219, + 619 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 219, + 605, + 275, + 617 + ], + "score": 0.95, + "content": "D _ { f } ( \\nu \\| \\rho ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 603, + 308, + 619 + ], + "score": 1.0, + "content": "implies", + "type": "text" + }, + { + "bbox": [ + 308, + 606, + 334, + 617 + ], + "score": 0.92, + "content": "\\nu = \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 603, + 375, + 619 + ], + "score": 1.0, + "content": "whenever", + "type": "text" + }, + { + "bbox": [ + 376, + 606, + 383, + 617 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 603, + 474, + 619 + ], + "score": 1.0, + "content": "is strictly convex at 1.", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 128, + 619, + 503, + 634 + ], + "spans": [ + { + "bbox": [ + 128, + 619, + 142, + 634 + ], + "score": 1.0, + "content": "3.", + "type": "text" + }, + { + "bbox": [ + 142, + 620, + 268, + 633 + ], + "score": 0.93, + "content": "D _ { f } ( F _ { * } ( \\nu ) \\| F _ { * } ( \\rho ) ) \\le D _ { f } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 619, + 336, + 634 + ], + "score": 1.0, + "content": "for any function", + "type": "text" + }, + { + "bbox": [ + 336, + 621, + 345, + 630 + ], + "score": 0.84, + "content": "F", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 619, + 375, + 634 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 375, + 620, + 400, + 632 + ], + "score": 0.93, + "content": "F _ { * } ( \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 619, + 492, + 634 + ], + "score": 1.0, + "content": "is the push-forward of", + "type": "text" + }, + { + "bbox": [ + 493, + 623, + 499, + 632 + ], + "score": 0.81, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 499, + 619, + 503, + 634 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 128, + 636, + 448, + 651 + ], + "spans": [ + { + "bbox": [ + 128, + 636, + 142, + 651 + ], + "score": 1.0, + "content": "4.", + "type": "text" + }, + { + "bbox": [ + 142, + 636, + 231, + 650 + ], + "score": 0.92, + "content": "D _ { f } ( \\nu \\| \\rho ) = D _ { \\bar { f } } ( \\rho \\| \\nu )", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 636, + 259, + 651 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 259, + 636, + 320, + 650 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\bar { f } ( u ) = u f \\left( \\frac { 1 } { u } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 636, + 406, + 651 + ], + "score": 1.0, + "content": "is again convex with", + "type": "text" + }, + { + "bbox": [ + 406, + 636, + 444, + 649 + ], + "score": 0.93, + "content": "{ \\bar { f } } ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 636, + 448, + 651 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true + } + ], + "index": 36.5, + "bbox_fs": [ + 128, + 588, + 503, + 651 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 662, + 276, + 674 + ], + "lines": [ + { + "bbox": [ + 106, + 662, + 277, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 277, + 675 + ], + "score": 1.0, + "content": "A.3 BOUNDING RENYI DIVERGENCES", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 683, + 269, + 695 + ], + "lines": [ + { + "bbox": [ + 106, + 681, + 270, + 697 + ], + "spans": [ + { + "bbox": [ + 106, + 681, + 270, + 697 + ], + "score": 1.0, + "content": "We being with the optimization problem", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40, + "bbox_fs": [ + 106, + 681, + 270, + 697 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 258, + 700, + 357, + 736 + ], + "lines": [ + { + "bbox": [ + 258, + 700, + 357, + 736 + ], + "spans": [ + { + "bbox": [ + 258, + 700, + 357, + 736 + ], + "score": 0.64, + "content": "\\begin{array} { r } { \\underset { x ^ { \\prime } } { \\operatorname* { m a x } } R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) } \\\\ { \\mathrm { s u b j e c t ~ t o ~ } \\| x - x ^ { \\prime } \\| _ { p } \\leq \\epsilon } \\end{array}", + "type": "interline_equation", + "image_path": "ffd4570ca1f1d8a57429322349f103fa2b73834471d68c3191af1e0e499e0456.jpg" + } + ] + } + ], + "index": 41.5, + "virtual_lines": [ + { + "bbox": [ + 258, + 700, + 357, + 718.0 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 258, + 718.0, + 357, + 736.0 + ], + "spans": [], + "index": 42 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 484, + 96 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 484, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 166, + 96 + ], + "score": 1.0, + "content": "Since we have", + "type": "text" + }, + { + "bbox": [ + 166, + 82, + 342, + 95 + ], + "score": 0.92, + "content": "\\begin{array} { r } { R _ { \\alpha } ( \\mu ( { x ^ { \\prime } } ) \\| \\mu ( x ) ) = \\sum _ { i } R _ { \\alpha } ( \\mu _ { i } ( { x _ { i } ^ { \\prime } } ) \\| \\mu _ { i } ( x _ { i } ) ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 81, + 484, + 96 + ], + "score": 1.0, + "content": ". The constraint can be rewritten as", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 263, + 100, + 347, + 126 + ], + "lines": [ + { + "bbox": [ + 263, + 100, + 347, + 126 + ], + "spans": [ + { + "bbox": [ + 263, + 100, + 347, + 126 + ], + "score": 0.89, + "content": "\\sum _ { i } | x _ { i } - x _ { i } ^ { \\prime } | ^ { P } \\leq \\epsilon ^ { p }", + "type": "interline_equation", + "image_path": "8640be02edda35a95b909d821382652f8e044e860066fdd2dd7ebc201dd91ef7.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 263, + 100, + 347, + 126 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 131, + 291, + 143 + ], + "lines": [ + { + "bbox": [ + 106, + 131, + 292, + 144 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 292, + 144 + ], + "score": 1.0, + "content": "Forming the Lagrangian relaxation, we obtain", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 174, + 147, + 438, + 181 + ], + "lines": [ + { + "bbox": [ + 174, + 147, + 438, + 181 + ], + "spans": [ + { + "bbox": [ + 174, + 147, + 438, + 181 + ], + "score": 0.94, + "content": "\\operatorname* { m a x } _ { x ^ { \\prime } \\colon | x _ { i } ^ { \\prime } - x _ { i } | \\leq \\epsilon } \\sum _ { i } R _ { \\alpha } ( \\mu _ { i } ( x _ { i } ^ { \\prime } ) \\| \\mu _ { i } ( x _ { i } ) ) + \\gamma \\left( \\sum _ { i } | x _ { i } ^ { \\prime } - x _ { i } | ^ { p } - \\epsilon ^ { p } \\right) \\ .", + "type": "interline_equation", + "image_path": "5f4ee11168acbdbcc5eb8a5d0bc4f520d3272316c4f12d412eed823e647b7fe6.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 174, + 147, + 438, + 158.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 174, + 158.33333333333334, + 438, + 169.66666666666669 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 174, + 169.66666666666669, + 438, + 181.00000000000003 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 503, + 211 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 191, + 200 + ], + "score": 1.0, + "content": "where the constraint", + "type": "text" + }, + { + "bbox": [ + 191, + 186, + 246, + 199 + ], + "score": 0.94, + "content": "| x _ { i } ^ { \\prime } - x _ { i } | \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 185, + 303, + 200 + ], + "score": 1.0, + "content": "is implied by", + "type": "text" + }, + { + "bbox": [ + 303, + 186, + 362, + 201 + ], + "score": 0.94, + "content": "\\| x ^ { \\prime } - x \\| _ { p } \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 185, + 505, + 200 + ], + "score": 1.0, + "content": ". We can maximize separately over", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 199, + 177, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 127, + 213 + ], + "score": 1.0, + "content": "each", + "type": "text" + }, + { + "bbox": [ + 127, + 200, + 137, + 212 + ], + "score": 0.88, + "content": "\\boldsymbol { x } _ { i } ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 199, + 177, + 213 + ], + "score": 1.0, + "content": "to obtain", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 216, + 434, + 243 + ], + "lines": [ + { + "bbox": [ + 177, + 216, + 434, + 243 + ], + "spans": [ + { + "bbox": [ + 177, + 216, + 434, + 243 + ], + "score": 0.91, + "content": "- \\gamma \\epsilon ^ { p } + \\sum _ { i } \\operatorname* { m a x } _ { x _ { i } ^ { \\prime } \\in [ x _ { i } - \\epsilon , x _ { i } + \\epsilon ] } R _ { \\alpha } ( \\mu _ { i } ( x _ { i } ^ { \\prime } ) \\| \\mu _ { i } ( x _ { i } ) ) + \\gamma | x _ { i } ^ { \\prime } - x _ { i } | ^ { p } .", + "type": "interline_equation", + "image_path": "566fda9e095d69a8fc674803a81098eecf683ee421ca022de244a8038923ca36.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 177, + 216, + 434, + 225.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 177, + 225.0, + 434, + 234.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 177, + 234.0, + 434, + 243.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 247, + 503, + 271 + ], + "lines": [ + { + "bbox": [ + 105, + 247, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 207, + 261 + ], + "score": 1.0, + "content": "By weak duality, for any", + "type": "text" + }, + { + "bbox": [ + 207, + 248, + 232, + 260 + ], + "score": 0.9, + "content": "\\gamma \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 247, + 505, + 261 + ], + "score": 1.0, + "content": ", this is an upper bound on Eq. 10. We can minimize this bound over", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 107, + 259, + 248, + 271 + ], + "spans": [ + { + "bbox": [ + 107, + 260, + 132, + 271 + ], + "score": 0.89, + "content": "\\gamma \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 259, + 248, + 271 + ], + "score": 1.0, + "content": "to obtain the tightest bound.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 505, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 202, + 288 + ], + "score": 1.0, + "content": "The minimization over", + "type": "text" + }, + { + "bbox": [ + 203, + 277, + 212, + 288 + ], + "score": 0.89, + "content": "\\boldsymbol { x } _ { i } ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 275, + 250, + 288 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 250, + 277, + 255, + 286 + ], + "score": 0.72, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "can be solved in closed-form or via as simple 1-dimensional", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 287, + 320, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 320, + 299 + ], + "score": 1.0, + "content": "minimization problem for most smoothing measures.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "title", + "bbox": [ + 107, + 311, + 228, + 323 + ], + "lines": [ + { + "bbox": [ + 106, + 311, + 230, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 230, + 324 + ], + "score": 1.0, + "content": "A.4 PROOF OF THEOREM 1", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 107, + 332, + 504, + 356 + ], + "lines": [ + { + "bbox": [ + 104, + 329, + 504, + 347 + ], + "spans": [ + { + "bbox": [ + 104, + 329, + 488, + 347 + ], + "score": 1.0, + "content": "For simplicity of exposition (and to avoid measure theoretic issues), we focus on the case where", + "type": "text" + }, + { + "bbox": [ + 488, + 335, + 504, + 344 + ], + "score": 0.86, + "content": "\\nu , \\rho", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 343, + 421, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 216, + 356 + ], + "score": 1.0, + "content": "have well defined densities", + "type": "text" + }, + { + "bbox": [ + 217, + 343, + 259, + 356 + ], + "score": 0.93, + "content": "\\nu ( x ) , \\rho ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 343, + 299, + 356 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 299, + 343, + 337, + 356 + ], + "score": 0.93, + "content": "\\rho ( x ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 343, + 379, + 356 + ], + "score": 1.0, + "content": "whenever", + "type": "text" + }, + { + "bbox": [ + 379, + 343, + 417, + 356 + ], + "score": 0.93, + "content": "\\nu ( x ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 343, + 421, + 356 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 362, + 504, + 387 + ], + "lines": [ + { + "bbox": [ + 105, + 355, + 509, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 428, + 383 + ], + "score": 1.0, + "content": "We begin by rewriting the optimization problem in terms of the likelihood ratio", + "type": "text" + }, + { + "bbox": [ + 429, + 360, + 484, + 378 + ], + "score": 0.94, + "content": "\\begin{array} { r } { r ( X ) = \\frac { \\nu ( X ) } { \\rho ( X ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 355, + 509, + 383 + ], + "score": 1.0, + "content": ": We", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 374, + 129, + 389 + ], + "spans": [ + { + "bbox": [ + 104, + 374, + 129, + 389 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 392, + 480, + 412 + ], + "lines": [ + { + "bbox": [ + 130, + 392, + 480, + 412 + ], + "spans": [ + { + "bbox": [ + 130, + 392, + 480, + 412 + ], + "score": 0.89, + "content": "\\operatorname { \\mathrm { ~ \\underset { X \\sim \\nu } { E } ~ } } [ \\phi ( X ) ] = \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ r ( X ) \\phi ( X ) ] ~ , \\quad D _ { f _ { i } } ( \\rho | | \\nu ) = \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ f _ { i } ( r ( X ) ) ] ~ , \\quad \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ r ( X ) ] = 1 ~ ,", + "type": "interline_equation", + "image_path": "acd22004c7df47fc2ad1d9b81b0d410782d499d42e235d68fe25274677c7ada6.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 130, + 392, + 480, + 412 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 417, + 505, + 451 + ], + "lines": [ + { + "bbox": [ + 106, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 418, + 356, + 430 + ], + "score": 1.0, + "content": "where the first two equalities follow directly by plugging in", + "type": "text" + }, + { + "bbox": [ + 356, + 417, + 438, + 430 + ], + "score": 0.93, + "content": "\\nu ( X ) = \\rho ( X ) r ( X )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 418, + 505, + 430 + ], + "score": 1.0, + "content": "and the third is", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 428, + 504, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 215, + 441 + ], + "score": 1.0, + "content": "obtained using the fact that", + "type": "text" + }, + { + "bbox": [ + 216, + 431, + 222, + 439 + ], + "score": 0.78, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 428, + 497, + 441 + ], + "score": 1.0, + "content": "is a probability measure. Using these relations, the optimization over", + "type": "text" + }, + { + "bbox": [ + 497, + 431, + 504, + 438 + ], + "score": 0.74, + "content": "\\nu", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 439, + 184, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 184, + 452 + ], + "score": 1.0, + "content": "can be rewritten as", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 453, + 411, + 495 + ], + "lines": [ + { + "bbox": [ + 198, + 453, + 411, + 495 + ], + "spans": [ + { + "bbox": [ + 198, + 453, + 411, + 495 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\underset { r \\geq 0 } { \\mathrm { m i n } } \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) \\phi ( X ) ] \\qquad } \\\\ { \\mathrm { s u b j e c t ~ t o } \\underset { X \\sim \\rho } { \\mathrm { E } } [ f _ { i } ( r ( X ) ) ] \\leq \\epsilon _ { i } , \\quad \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) ] = 1 \\ , } \\end{array}", + "type": "interline_equation", + "image_path": "3e870f9b6f06b6121e050ae11b8e4b06170ad94bbbe46cdb8ec78eba93b6b289.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 198, + 453, + 411, + 467.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 198, + 467.0, + 411, + 481.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 198, + 481.0, + 411, + 495.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 499, + 505, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 133, + 513 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 501, + 160, + 511 + ], + "score": 0.9, + "content": "r \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 498, + 213, + 513 + ], + "score": 1.0, + "content": "denotes that", + "type": "text" + }, + { + "bbox": [ + 214, + 500, + 295, + 512 + ], + "score": 0.88, + "content": "r ( x ) \\geq 0 \\quad \\forall x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 498, + 394, + 513 + ], + "score": 1.0, + "content": ". The optimization over", + "type": "text" + }, + { + "bbox": [ + 395, + 503, + 401, + 510 + ], + "score": 0.77, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 498, + 505, + 513 + ], + "score": 1.0, + "content": "is a convex optimization", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 511, + 504, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 498, + 523 + ], + "score": 1.0, + "content": "problem and can be solved using Lagrangian duality as follows – we first dualize the constraints on", + "type": "text" + }, + { + "bbox": [ + 498, + 514, + 504, + 520 + ], + "score": 0.68, + "content": "r", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 522, + 144, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 144, + 534 + ], + "score": 1.0, + "content": "to obtain", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 536, + 462, + 695 + ], + "lines": [ + { + "bbox": [ + 149, + 536, + 462, + 695 + ], + "spans": [ + { + "bbox": [ + 149, + 536, + 462, + 695 + ], + "score": 0.95, + "content": "\\begin{array} { l } { \\displaystyle \\operatorname* { m i n } _ { r > 0 } \\ \\operatorname { E } _ { \\gamma \\to 0 } \\big [ r ( X ) \\phi ( X ) \\big ] + \\sum _ { i } \\lambda _ { i } \\bigg ( \\underbrace { \\mathrm { F } _ { \\mathrm { f } } \\left[ f _ { i } ( r ( X ) ) \\right] - \\epsilon } _ { X \\sim \\rho } \\bigg ) + \\kappa \\bigg ( 1 - \\underbrace { \\mathrm { F } _ { \\mathrm { c } } \\left[ r ( X ) \\right] } _ { X \\sim \\rho } \\bigg ) } \\\\ { = \\displaystyle \\operatorname* { m i n } _ { r \\ge 0 } \\ \\mathrm { E } _ { r \\to 0 } \\bigg [ r ( X ) \\phi ( X ) + \\sum _ { i } \\lambda _ { i } f _ { i } ( r ( X ) ) - \\kappa r ( X ) \\bigg ] + \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { F } } _ { X \\sim \\rho } \\bigg [ \\operatorname* { m a x } _ { r \\to 0 } \\kappa r - r \\phi ( X ) - \\sum _ { i } \\lambda _ { i } f _ { i } ( r ) \\bigg ] } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { ~ E } } _ { X \\sim \\rho } \\bigg [ \\operatorname* { m a x } _ { r \\to 0 } \\big ( r ( \\kappa - \\phi ( X ) ) - f _ { \\lambda } ( r ) \\big ) \\bigg ] } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { ~ E } } _ { X \\sim \\rho } \\bigg [ r \\xi ( \\kappa - \\phi ( X ) ) \\big ] \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "20495ef31304d6fdc887ffbdc180c63cbf3edc10bc19f8183ebaef1589141650.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 149, + 536, + 462, + 589.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 149, + 589.0, + 462, + 642.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 149, + 642.0, + 462, + 695.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 430, + 712 + ], + "score": 1.0, + "content": "By strong duality, it holds that maximizing the final expression with respect to", + "type": "text" + }, + { + "bbox": [ + 430, + 699, + 466, + 710 + ], + "score": 0.91, + "content": "\\lambda \\geq 0 , \\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "achieves", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "the optimal value in Eq. 11. Thus, if the optimal value is smaller than 0, the specification is not", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "robustly certified and if it is larger than 0, the specification is robustly certified. Finally, since we are", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + } + ], + "page_idx": 13, + "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 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": "14", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 484, + 96 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 484, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 166, + 96 + ], + "score": 1.0, + "content": "Since we have", + "type": "text" + }, + { + "bbox": [ + 166, + 82, + 342, + 95 + ], + "score": 0.92, + "content": "\\begin{array} { r } { R _ { \\alpha } ( \\mu ( { x ^ { \\prime } } ) \\| \\mu ( x ) ) = \\sum _ { i } R _ { \\alpha } ( \\mu _ { i } ( { x _ { i } ^ { \\prime } } ) \\| \\mu _ { i } ( x _ { i } ) ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 81, + 484, + 96 + ], + "score": 1.0, + "content": ". The constraint can be rewritten as", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 81, + 484, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 263, + 100, + 347, + 126 + ], + "lines": [ + { + "bbox": [ + 263, + 100, + 347, + 126 + ], + "spans": [ + { + "bbox": [ + 263, + 100, + 347, + 126 + ], + "score": 0.89, + "content": "\\sum _ { i } | x _ { i } - x _ { i } ^ { \\prime } | ^ { P } \\leq \\epsilon ^ { p }", + "type": "interline_equation", + "image_path": "8640be02edda35a95b909d821382652f8e044e860066fdd2dd7ebc201dd91ef7.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 263, + 100, + 347, + 126 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 131, + 291, + 143 + ], + "lines": [ + { + "bbox": [ + 106, + 131, + 292, + 144 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 292, + 144 + ], + "score": 1.0, + "content": "Forming the Lagrangian relaxation, we obtain", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 131, + 292, + 144 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 174, + 147, + 438, + 181 + ], + "lines": [ + { + "bbox": [ + 174, + 147, + 438, + 181 + ], + "spans": [ + { + "bbox": [ + 174, + 147, + 438, + 181 + ], + "score": 0.94, + "content": "\\operatorname* { m a x } _ { x ^ { \\prime } \\colon | x _ { i } ^ { \\prime } - x _ { i } | \\leq \\epsilon } \\sum _ { i } R _ { \\alpha } ( \\mu _ { i } ( x _ { i } ^ { \\prime } ) \\| \\mu _ { i } ( x _ { i } ) ) + \\gamma \\left( \\sum _ { i } | x _ { i } ^ { \\prime } - x _ { i } | ^ { p } - \\epsilon ^ { p } \\right) \\ .", + "type": "interline_equation", + "image_path": "5f4ee11168acbdbcc5eb8a5d0bc4f520d3272316c4f12d412eed823e647b7fe6.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 174, + 147, + 438, + 158.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 174, + 158.33333333333334, + 438, + 169.66666666666669 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 174, + 169.66666666666669, + 438, + 181.00000000000003 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 503, + 211 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 191, + 200 + ], + "score": 1.0, + "content": "where the constraint", + "type": "text" + }, + { + "bbox": [ + 191, + 186, + 246, + 199 + ], + "score": 0.94, + "content": "| x _ { i } ^ { \\prime } - x _ { i } | \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 185, + 303, + 200 + ], + "score": 1.0, + "content": "is implied by", + "type": "text" + }, + { + "bbox": [ + 303, + 186, + 362, + 201 + ], + "score": 0.94, + "content": "\\| x ^ { \\prime } - x \\| _ { p } \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 185, + 505, + 200 + ], + "score": 1.0, + "content": ". We can maximize separately over", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 199, + 177, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 127, + 213 + ], + "score": 1.0, + "content": "each", + "type": "text" + }, + { + "bbox": [ + 127, + 200, + 137, + 212 + ], + "score": 0.88, + "content": "\\boldsymbol { x } _ { i } ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 199, + 177, + 213 + ], + "score": 1.0, + "content": "to obtain", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 185, + 505, + 213 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 216, + 434, + 243 + ], + "lines": [ + { + "bbox": [ + 177, + 216, + 434, + 243 + ], + "spans": [ + { + "bbox": [ + 177, + 216, + 434, + 243 + ], + "score": 0.91, + "content": "- \\gamma \\epsilon ^ { p } + \\sum _ { i } \\operatorname* { m a x } _ { x _ { i } ^ { \\prime } \\in [ x _ { i } - \\epsilon , x _ { i } + \\epsilon ] } R _ { \\alpha } ( \\mu _ { i } ( x _ { i } ^ { \\prime } ) \\| \\mu _ { i } ( x _ { i } ) ) + \\gamma | x _ { i } ^ { \\prime } - x _ { i } | ^ { p } .", + "type": "interline_equation", + "image_path": "566fda9e095d69a8fc674803a81098eecf683ee421ca022de244a8038923ca36.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 177, + 216, + 434, + 225.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 177, + 225.0, + 434, + 234.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 177, + 234.0, + 434, + 243.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 247, + 503, + 271 + ], + "lines": [ + { + "bbox": [ + 105, + 247, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 207, + 261 + ], + "score": 1.0, + "content": "By weak duality, for any", + "type": "text" + }, + { + "bbox": [ + 207, + 248, + 232, + 260 + ], + "score": 0.9, + "content": "\\gamma \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 247, + 505, + 261 + ], + "score": 1.0, + "content": ", this is an upper bound on Eq. 10. We can minimize this bound over", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 107, + 259, + 248, + 271 + ], + "spans": [ + { + "bbox": [ + 107, + 260, + 132, + 271 + ], + "score": 0.89, + "content": "\\gamma \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 259, + 248, + 271 + ], + "score": 1.0, + "content": "to obtain the tightest bound.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 247, + 505, + 271 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 505, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 202, + 288 + ], + "score": 1.0, + "content": "The minimization over", + "type": "text" + }, + { + "bbox": [ + 203, + 277, + 212, + 288 + ], + "score": 0.89, + "content": "\\boldsymbol { x } _ { i } ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 275, + 250, + 288 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 250, + 277, + 255, + 286 + ], + "score": 0.72, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "can be solved in closed-form or via as simple 1-dimensional", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 287, + 320, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 320, + 299 + ], + "score": 1.0, + "content": "minimization problem for most smoothing measures.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 106, + 275, + 505, + 299 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 311, + 228, + 323 + ], + "lines": [ + { + "bbox": [ + 106, + 311, + 230, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 230, + 324 + ], + "score": 1.0, + "content": "A.4 PROOF OF THEOREM 1", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 107, + 332, + 504, + 356 + ], + "lines": [ + { + "bbox": [ + 104, + 329, + 504, + 347 + ], + "spans": [ + { + "bbox": [ + 104, + 329, + 488, + 347 + ], + "score": 1.0, + "content": "For simplicity of exposition (and to avoid measure theoretic issues), we focus on the case where", + "type": "text" + }, + { + "bbox": [ + 488, + 335, + 504, + 344 + ], + "score": 0.86, + "content": "\\nu , \\rho", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 343, + 421, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 216, + 356 + ], + "score": 1.0, + "content": "have well defined densities", + "type": "text" + }, + { + "bbox": [ + 217, + 343, + 259, + 356 + ], + "score": 0.93, + "content": "\\nu ( x ) , \\rho ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 343, + 299, + 356 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 299, + 343, + 337, + 356 + ], + "score": 0.93, + "content": "\\rho ( x ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 343, + 379, + 356 + ], + "score": 1.0, + "content": "whenever", + "type": "text" + }, + { + "bbox": [ + 379, + 343, + 417, + 356 + ], + "score": 0.93, + "content": "\\nu ( x ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 343, + 421, + 356 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 104, + 329, + 504, + 356 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 362, + 504, + 387 + ], + "lines": [ + { + "bbox": [ + 105, + 355, + 509, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 428, + 383 + ], + "score": 1.0, + "content": "We begin by rewriting the optimization problem in terms of the likelihood ratio", + "type": "text" + }, + { + "bbox": [ + 429, + 360, + 484, + 378 + ], + "score": 0.94, + "content": "\\begin{array} { r } { r ( X ) = \\frac { \\nu ( X ) } { \\rho ( X ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 355, + 509, + 383 + ], + "score": 1.0, + "content": ": We", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 374, + 129, + 389 + ], + "spans": [ + { + "bbox": [ + 104, + 374, + 129, + 389 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 104, + 355, + 509, + 389 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 392, + 480, + 412 + ], + "lines": [ + { + "bbox": [ + 130, + 392, + 480, + 412 + ], + "spans": [ + { + "bbox": [ + 130, + 392, + 480, + 412 + ], + "score": 0.89, + "content": "\\operatorname { \\mathrm { ~ \\underset { X \\sim \\nu } { E } ~ } } [ \\phi ( X ) ] = \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ r ( X ) \\phi ( X ) ] ~ , \\quad D _ { f _ { i } } ( \\rho | | \\nu ) = \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ f _ { i } ( r ( X ) ) ] ~ , \\quad \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ r ( X ) ] = 1 ~ ,", + "type": "interline_equation", + "image_path": "acd22004c7df47fc2ad1d9b81b0d410782d499d42e235d68fe25274677c7ada6.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 130, + 392, + 480, + 412 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 417, + 505, + 451 + ], + "lines": [ + { + "bbox": [ + 106, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 418, + 356, + 430 + ], + "score": 1.0, + "content": "where the first two equalities follow directly by plugging in", + "type": "text" + }, + { + "bbox": [ + 356, + 417, + 438, + 430 + ], + "score": 0.93, + "content": "\\nu ( X ) = \\rho ( X ) r ( X )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 418, + 505, + 430 + ], + "score": 1.0, + "content": "and the third is", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 428, + 504, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 215, + 441 + ], + "score": 1.0, + "content": "obtained using the fact that", + "type": "text" + }, + { + "bbox": [ + 216, + 431, + 222, + 439 + ], + "score": 0.78, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 428, + 497, + 441 + ], + "score": 1.0, + "content": "is a probability measure. Using these relations, the optimization over", + "type": "text" + }, + { + "bbox": [ + 497, + 431, + 504, + 438 + ], + "score": 0.74, + "content": "\\nu", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 439, + 184, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 184, + 452 + ], + "score": 1.0, + "content": "can be rewritten as", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 417, + 505, + 452 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 198, + 453, + 411, + 495 + ], + "lines": [ + { + "bbox": [ + 198, + 453, + 411, + 495 + ], + "spans": [ + { + "bbox": [ + 198, + 453, + 411, + 495 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\underset { r \\geq 0 } { \\mathrm { m i n } } \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) \\phi ( X ) ] \\qquad } \\\\ { \\mathrm { s u b j e c t ~ t o } \\underset { X \\sim \\rho } { \\mathrm { E } } [ f _ { i } ( r ( X ) ) ] \\leq \\epsilon _ { i } , \\quad \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) ] = 1 \\ , } \\end{array}", + "type": "interline_equation", + "image_path": "3e870f9b6f06b6121e050ae11b8e4b06170ad94bbbe46cdb8ec78eba93b6b289.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 198, + 453, + 411, + 467.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 198, + 467.0, + 411, + 481.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 198, + 481.0, + 411, + 495.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 499, + 505, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 498, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 133, + 513 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 501, + 160, + 511 + ], + "score": 0.9, + "content": "r \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 498, + 213, + 513 + ], + "score": 1.0, + "content": "denotes that", + "type": "text" + }, + { + "bbox": [ + 214, + 500, + 295, + 512 + ], + "score": 0.88, + "content": "r ( x ) \\geq 0 \\quad \\forall x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 498, + 394, + 513 + ], + "score": 1.0, + "content": ". The optimization over", + "type": "text" + }, + { + "bbox": [ + 395, + 503, + 401, + 510 + ], + "score": 0.77, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 498, + 505, + 513 + ], + "score": 1.0, + "content": "is a convex optimization", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 511, + 504, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 498, + 523 + ], + "score": 1.0, + "content": "problem and can be solved using Lagrangian duality as follows – we first dualize the constraints on", + "type": "text" + }, + { + "bbox": [ + 498, + 514, + 504, + 520 + ], + "score": 0.68, + "content": "r", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 522, + 144, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 144, + 534 + ], + "score": 1.0, + "content": "to obtain", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 498, + 505, + 534 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 536, + 462, + 695 + ], + "lines": [ + { + "bbox": [ + 149, + 536, + 462, + 695 + ], + "spans": [ + { + "bbox": [ + 149, + 536, + 462, + 695 + ], + "score": 0.95, + "content": "\\begin{array} { l } { \\displaystyle \\operatorname* { m i n } _ { r > 0 } \\ \\operatorname { E } _ { \\gamma \\to 0 } \\big [ r ( X ) \\phi ( X ) \\big ] + \\sum _ { i } \\lambda _ { i } \\bigg ( \\underbrace { \\mathrm { F } _ { \\mathrm { f } } \\left[ f _ { i } ( r ( X ) ) \\right] - \\epsilon } _ { X \\sim \\rho } \\bigg ) + \\kappa \\bigg ( 1 - \\underbrace { \\mathrm { F } _ { \\mathrm { c } } \\left[ r ( X ) \\right] } _ { X \\sim \\rho } \\bigg ) } \\\\ { = \\displaystyle \\operatorname* { m i n } _ { r \\ge 0 } \\ \\mathrm { E } _ { r \\to 0 } \\bigg [ r ( X ) \\phi ( X ) + \\sum _ { i } \\lambda _ { i } f _ { i } ( r ( X ) ) - \\kappa r ( X ) \\bigg ] + \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { F } } _ { X \\sim \\rho } \\bigg [ \\operatorname* { m a x } _ { r \\to 0 } \\kappa r - r \\phi ( X ) - \\sum _ { i } \\lambda _ { i } f _ { i } ( r ) \\bigg ] } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { ~ E } } _ { X \\sim \\rho } \\bigg [ \\operatorname* { m a x } _ { r \\to 0 } \\big ( r ( \\kappa - \\phi ( X ) ) - f _ { \\lambda } ( r ) \\big ) \\bigg ] } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { ~ E } } _ { X \\sim \\rho } \\bigg [ r \\xi ( \\kappa - \\phi ( X ) ) \\big ] \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "20495ef31304d6fdc887ffbdc180c63cbf3edc10bc19f8183ebaef1589141650.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 149, + 536, + 462, + 589.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 149, + 589.0, + 462, + 642.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 149, + 642.0, + 462, + 695.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 430, + 712 + ], + "score": 1.0, + "content": "By strong duality, it holds that maximizing the final expression with respect to", + "type": "text" + }, + { + "bbox": [ + 430, + 699, + 466, + 710 + ], + "score": 0.91, + "content": "\\lambda \\geq 0 , \\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "achieves", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "the optimal value in Eq. 11. Thus, if the optimal value is smaller than 0, the specification is not", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "robustly certified and if it is larger than 0, the specification is robustly certified. Finally, since we are", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 478, + 95 + ], + "score": 1.0, + "content": "ultimately interested in proving that the objective is non-negative, we can restrict ourselves to", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 479, + 82, + 504, + 93 + ], + "score": 0.9, + "content": "\\lambda \\geq 0", + "type": "inline_equation", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 145, + 106 + ], + "score": 1.0, + "content": "such that", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 145, + 93, + 190, + 106 + ], + "score": 0.92, + "content": "\\textstyle \\sum _ { i } \\lambda _ { i } = 1", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 190, + 93, + 274, + 106 + ], + "score": 1.0, + "content": "(since if the optimal", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 275, + 94, + 281, + 104 + ], + "score": 0.75, + "content": "\\lambda", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 282, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "added up to something larger, we could simply rescale", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 259, + 117 + ], + "score": 1.0, + "content": "the values to add up to 1 and multiply", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 259, + 106, + 266, + 114 + ], + "score": 0.77, + "content": "\\kappa", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 267, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "by the same scaling factor without changing the sign of the", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 116, + 186, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 186, + 127 + ], + "score": 1.0, + "content": "objective function).", + "type": "text", + "cross_page": true + } + ], + "index": 3 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 698, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 127 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 478, + 95 + ], + "score": 1.0, + "content": "ultimately interested in proving that the objective is non-negative, we can restrict ourselves to", + "type": "text" + }, + { + "bbox": [ + 479, + 82, + 504, + 93 + ], + "score": 0.9, + "content": "\\lambda \\geq 0", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 145, + 106 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 145, + 93, + 190, + 106 + ], + "score": 0.92, + "content": "\\textstyle \\sum _ { i } \\lambda _ { i } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 93, + 274, + 106 + ], + "score": 1.0, + "content": "(since if the optimal", + "type": "text" + }, + { + "bbox": [ + 275, + 94, + 281, + 104 + ], + "score": 0.75, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 93, + 506, + 106 + ], + "score": 1.0, + "content": "added up to something larger, we could simply rescale", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 259, + 117 + ], + "score": 1.0, + "content": "the values to add up to 1 and multiply", + "type": "text" + }, + { + "bbox": [ + 259, + 106, + 266, + 114 + ], + "score": 0.77, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "by the same scaling factor without changing the sign of the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 116, + 186, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 116, + 186, + 127 + ], + "score": 1.0, + "content": "objective function).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 106, + 131, + 358, + 144 + ], + "lines": [ + { + "bbox": [ + 105, + 131, + 358, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 358, + 146 + ], + "score": 1.0, + "content": "This concludes the proof of correctness of the certificate Eq. 6.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "title", + "bbox": [ + 108, + 156, + 229, + 168 + ], + "lines": [ + { + "bbox": [ + 106, + 155, + 231, + 169 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 231, + 169 + ], + "score": 1.0, + "content": "A.5 PROOF OF THEOREM 2", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 177, + 505, + 198 + ], + "lines": [ + { + "bbox": [ + 105, + 176, + 504, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 270, + 190 + ], + "score": 1.0, + "content": "For the next result, we observe that when", + "type": "text" + }, + { + "bbox": [ + 270, + 178, + 277, + 189 + ], + "score": 0.86, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 176, + 433, + 190 + ], + "score": 1.0, + "content": "is ternary valued, the optimization over", + "type": "text" + }, + { + "bbox": [ + 434, + 178, + 451, + 188 + ], + "score": 0.89, + "content": "\\kappa , \\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 176, + 504, + 190 + ], + "score": 1.0, + "content": "above can be", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 189, + 149, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 149, + 200 + ], + "score": 1.0, + "content": "written as", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 195, + 441, + 237 + ], + "lines": [ + { + "bbox": [ + 141, + 195, + 441, + 237 + ], + "spans": [ + { + "bbox": [ + 141, + 195, + 441, + 237 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } { { \\stackrel { \\mathrm { m a x } } { = } } } & { \\displaystyle \\operatorname* { m a x } _ { \\kappa , \\lambda \\geq 0 } \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\theta _ { a } f _ { \\lambda } ^ { * } \\big ( \\kappa - 1 \\big ) - \\theta _ { b } f _ { \\lambda } ^ { * } \\big ( \\kappa + 1 \\big ) - \\theta _ { c } f _ { \\lambda } ^ { * } \\big ( \\kappa \\big ) \\ , } \\\\ & { } & \\\\ & { \\displaystyle _ { \\imath } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] , \\theta _ { b } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = - 1 ] , \\theta _ { c } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = 0 ] . } \\end{array}", + "type": "interline_equation", + "image_path": "c87cee6dbec3e420756cd91d667ba82a8e1b8aa75be3add8f2f08cde51774c05.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 141, + 195, + 441, + 209.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 141, + 209.0, + 441, + 223.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 141, + 223.0, + 441, + 237.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 239, + 285, + 251 + ], + "lines": [ + { + "bbox": [ + 106, + 238, + 285, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 228, + 253 + ], + "score": 1.0, + "content": "Writing out the expression for", + "type": "text" + }, + { + "bbox": [ + 228, + 240, + 240, + 251 + ], + "score": 0.89, + "content": "f ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 238, + 285, + 253 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 253, + 497, + 361 + ], + "lines": [ + { + "bbox": [ + 115, + 253, + 497, + 361 + ], + "spans": [ + { + "bbox": [ + 115, + 253, + 497, + 361 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\underset { \\lambda \\geq 0 , \\kappa } { \\mathrm { m a x ~ m i n } } \\kappa - \\displaystyle \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\theta _ { a } \\Bigg ( ( \\kappa - 1 ) \\gamma _ { a } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { a } ) \\Bigg ) - \\theta _ { b } \\Bigg ( ( \\kappa + 1 ) \\gamma _ { b } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { b } ) \\Bigg ) } \\\\ & { \\quad \\quad \\quad \\quad \\quad - \\theta _ { c } \\Bigg ( \\kappa \\gamma _ { c } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { a } ) \\Bigg ) } \\\\ & { = \\underset { \\gamma \\geq 0 } { \\mathrm { m i n } } \\underset { \\lambda \\geq 0 , \\kappa } { \\mathrm { m a x } } \\kappa \\big ( 1 - \\theta _ { a } \\gamma _ { a } - \\theta _ { b } \\gamma _ { b } - \\theta _ { c } \\gamma _ { c } \\big ) + \\displaystyle \\sum _ { i } \\lambda _ { i } \\Bigg ( \\displaystyle \\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) - \\epsilon _ { i } \\Bigg ) + \\theta _ { a } \\gamma _ { a } - \\theta _ { b } \\gamma _ { b } \\ , } \\end{array}", + "type": "interline_equation", + "image_path": "c769fc052652243517d9995b4e16260154251ba864425434f67c2f3dca33d2bb.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 115, + 253, + 497, + 289.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 115, + 289.0, + 497, + 325.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 115, + 325.0, + 497, + 361.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 362, + 504, + 374 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 505, + 375 + ], + "score": 1.0, + "content": "where the second inequality follows from strong duality. The inner maximization is unbounded unless", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 376, + 402, + 404 + ], + "lines": [ + { + "bbox": [ + 208, + 376, + 402, + 404 + ], + "spans": [ + { + "bbox": [ + 208, + 376, + 402, + 404 + ], + "score": 0.91, + "content": "\\sum _ { y \\in \\{ a , b , c \\} } \\gamma _ { y } \\theta _ { y } = 1 , \\quad \\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) \\leq \\epsilon _ { i } .", + "type": "interline_equation", + "image_path": "da4806625633cffe981d687f382d205030e2ad81df321eb72edf587eca5b358c.jpg" + } + ] + } + ], + "index": 16.5, + "virtual_lines": [ + { + "bbox": [ + 208, + 376, + 402, + 390.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 208, + 390.0, + 402, + 404.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 406, + 506, + 438 + ], + "lines": [ + { + "bbox": [ + 104, + 403, + 504, + 421 + ], + "spans": [ + { + "bbox": [ + 104, + 403, + 394, + 421 + ], + "score": 1.0, + "content": "One thing to note is that, we can rewrite these constraints in terms of", + "type": "text" + }, + { + "bbox": [ + 394, + 406, + 439, + 418 + ], + "score": 0.91, + "content": "\\zeta = \\theta \\odot \\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 403, + 459, + 421 + ], + "score": 1.0, + "content": ", i.e.", + "type": "text" + }, + { + "bbox": [ + 459, + 406, + 504, + 418 + ], + "score": 0.9, + "content": "\\zeta _ { y } = \\theta _ { y } \\gamma _ { y }", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 417, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 121, + 430 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 121, + 417, + 172, + 429 + ], + "score": 0.93, + "content": "y \\in \\{ a , b , c \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 417, + 296, + 430 + ], + "score": 1.0, + "content": ". These constraints ensure that", + "type": "text" + }, + { + "bbox": [ + 296, + 418, + 303, + 429 + ], + "score": 0.84, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 417, + 437, + 430 + ], + "score": 1.0, + "content": "is a probability distribution over", + "type": "text" + }, + { + "bbox": [ + 437, + 418, + 486, + 429 + ], + "score": 0.93, + "content": "\\{ + 1 , 0 , - 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 417, + 506, + 430 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 427, + 158, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 158, + 441 + ], + "score": 1.0, + "content": "furthermore", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "interline_equation", + "bbox": [ + 238, + 434, + 372, + 464 + ], + "lines": [ + { + "bbox": [ + 238, + 434, + 372, + 464 + ], + "spans": [ + { + "bbox": [ + 238, + 434, + 372, + 464 + ], + "score": 0.93, + "content": "\\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) = D _ { f _ { i } } ( \\zeta \\| \\theta ) .", + "type": "interline_equation", + "image_path": "b065cfbf25d99bcffe1de400f53c467321b6cbd08612bd546c9c292ed5c185aa.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 238, + 434, + 372, + 449.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 238, + 449.0, + 372, + 464.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 464, + 504, + 487 + ], + "lines": [ + { + "bbox": [ + 104, + 463, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 104, + 463, + 304, + 479 + ], + "score": 1.0, + "content": "Thus, the second constraint above is equivalent to", + "type": "text" + }, + { + "bbox": [ + 305, + 465, + 365, + 477 + ], + "score": 0.93, + "content": "D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 463, + 506, + 479 + ], + "score": 1.0, + "content": ". Writing the optimization problem", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 476, + 204, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 476, + 152, + 487 + ], + "score": 1.0, + "content": "in terms of", + "type": "text" + }, + { + "bbox": [ + 153, + 476, + 158, + 487 + ], + "score": 0.83, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 476, + 204, + 487 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 489, + 395, + 539 + ], + "lines": [ + { + "bbox": [ + 214, + 489, + 395, + 539 + ], + "spans": [ + { + "bbox": [ + 214, + 489, + 395, + 539 + ], + "score": 0.71, + "content": "\\begin{array} { r c l } { \\displaystyle \\operatorname* { m i n } _ { \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } \\geq 0 } } & { \\zeta _ { a } - \\zeta _ { b } } \\\\ { \\mathrm { s u b j e c t ~ t o } D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i } } & { i = 1 , \\ldots , M } \\\\ { \\displaystyle \\zeta _ { a } + \\zeta _ { b } + \\zeta _ { c } = 1 } & { . } \\end{array}", + "type": "interline_equation", + "image_path": "59cde473effbd4aa1dd48d42ce21f192a0976ef8b81bba8060cbf93f6c58fbcb.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 214, + 489, + 395, + 505.6666666666667 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 214, + 505.6666666666667, + 395, + 522.3333333333334 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 214, + 522.3333333333334, + 395, + 539.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 549, + 441, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 550, + 442, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 442, + 561 + ], + "score": 1.0, + "content": "A.6 CLOSED-FORM CERTIFICATES FOR THE INFORMATION-LIMITED SETTING", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 506, + 626 + ], + "lines": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "score": 1.0, + "content": "In this section we present closed-form certificates for the information-limited setting which can be", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 581, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 220, + 592 + ], + "score": 1.0, + "content": "derived from Theorem 2 for", + "type": "text" + }, + { + "bbox": [ + 220, + 581, + 250, + 591 + ], + "score": 0.9, + "content": "M = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 581, + 505, + 592 + ], + "score": 1.0, + "content": ". The results are summarized in Table 4. In the next subsections", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 591, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 104, + 591, + 506, + 604 + ], + "score": 1.0, + "content": "we present the derivation of the certificates for Hockey-Stick and Renyi divergences. The certificates ´", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 601, + 506, + 617 + ], + "spans": [ + { + "bbox": [ + 104, + 601, + 506, + 617 + ], + "score": 1.0, + "content": "for the KL and infinite Renyi divergence can be derived by taking limits of the R ´ enyi certificate (as ´", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 107, + 613, + 206, + 627 + ], + "spans": [ + { + "bbox": [ + 107, + 614, + 149, + 625 + ], + "score": 0.91, + "content": "\\alpha 1 , \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 613, + 206, + 627 + ], + "score": 1.0, + "content": "respectively).", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31 + }, + { + "type": "title", + "bbox": [ + 107, + 636, + 421, + 648 + ], + "lines": [ + { + "bbox": [ + 106, + 636, + 422, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 636, + 422, + 649 + ], + "score": 1.0, + "content": "A.6.1 CALCULATION OF CERTIFICATE FOR HOCKEY-STICK DIVERGENCE", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 655, + 504, + 678 + ], + "lines": [ + { + "bbox": [ + 104, + 653, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 104, + 653, + 159, + 670 + ], + "score": 1.0, + "content": "The function", + "type": "text" + }, + { + "bbox": [ + 159, + 656, + 322, + 668 + ], + "score": 0.93, + "content": "f ( u ) = \\mathrm { m a x } ( u - \\beta , 0 ) - \\mathrm { m a x } ( 1 - \\beta , 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 653, + 424, + 670 + ], + "score": 1.0, + "content": "is a convex function with", + "type": "text" + }, + { + "bbox": [ + 424, + 656, + 462, + 668 + ], + "score": 0.92, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 653, + 506, + 670 + ], + "score": 1.0, + "content": ". Then, we", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 666, + 129, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 129, + 679 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 679, + 424, + 730 + ], + "lines": [ + { + "bbox": [ + 186, + 679, + 424, + 730 + ], + "spans": [ + { + "bbox": [ + 186, + 679, + 424, + 730 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } & { } & { f _ { \\lambda } ^ { * } ( u ) = \\underset { v \\geq 0 } { \\operatorname* { m a x } } \\left( u v - \\lambda \\operatorname* { m a x } ( v - \\beta , 0 ) \\right) + \\lambda \\operatorname* { m a x } ( 1 - \\beta , 0 ) } \\\\ & { } & { \\quad = \\left\\{ \\begin{array} { l l } { \\operatorname* { m a x } ( \\beta u , 0 ) + \\lambda \\operatorname* { m a x } ( 1 - \\beta , 0 ) \\quad } & { \\mathrm { ~ i f ~ } u \\leq \\lambda \\mathrm { ~ , ~ } } \\\\ { \\infty \\quad } & { \\mathrm { ~ i f ~ } u > \\lambda \\mathrm { ~ . ~ } } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "5c437001bcad52ace990a66975b82ca399e29cc2465fd1122239e18eedc61db4.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 186, + 679, + 424, + 696.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 186, + 696.0, + 424, + 713.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 186, + 713.0, + 424, + 730.0 + ], + "spans": [], + "index": 39 + } + ] + } + ], + "page_idx": 14, + "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 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": "15", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 127 + ], + "lines": [], + "index": 1.5, + "bbox_fs": [ + 105, + 82, + 506, + 127 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 131, + 358, + 144 + ], + "lines": [ + { + "bbox": [ + 105, + 131, + 358, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 358, + 146 + ], + "score": 1.0, + "content": "This concludes the proof of correctness of the certificate Eq. 6.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 131, + 358, + 146 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 156, + 229, + 168 + ], + "lines": [ + { + "bbox": [ + 106, + 155, + 231, + 169 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 231, + 169 + ], + "score": 1.0, + "content": "A.5 PROOF OF THEOREM 2", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 177, + 505, + 198 + ], + "lines": [ + { + "bbox": [ + 105, + 176, + 504, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 270, + 190 + ], + "score": 1.0, + "content": "For the next result, we observe that when", + "type": "text" + }, + { + "bbox": [ + 270, + 178, + 277, + 189 + ], + "score": 0.86, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 176, + 433, + 190 + ], + "score": 1.0, + "content": "is ternary valued, the optimization over", + "type": "text" + }, + { + "bbox": [ + 434, + 178, + 451, + 188 + ], + "score": 0.89, + "content": "\\kappa , \\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 176, + 504, + 190 + ], + "score": 1.0, + "content": "above can be", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 189, + 149, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 149, + 200 + ], + "score": 1.0, + "content": "written as", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 176, + 504, + 200 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 195, + 441, + 237 + ], + "lines": [ + { + "bbox": [ + 141, + 195, + 441, + 237 + ], + "spans": [ + { + "bbox": [ + 141, + 195, + 441, + 237 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } { { \\stackrel { \\mathrm { m a x } } { = } } } & { \\displaystyle \\operatorname* { m a x } _ { \\kappa , \\lambda \\geq 0 } \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\theta _ { a } f _ { \\lambda } ^ { * } \\big ( \\kappa - 1 \\big ) - \\theta _ { b } f _ { \\lambda } ^ { * } \\big ( \\kappa + 1 \\big ) - \\theta _ { c } f _ { \\lambda } ^ { * } \\big ( \\kappa \\big ) \\ , } \\\\ & { } & \\\\ & { \\displaystyle _ { \\imath } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] , \\theta _ { b } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = - 1 ] , \\theta _ { c } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = 0 ] . } \\end{array}", + "type": "interline_equation", + "image_path": "c87cee6dbec3e420756cd91d667ba82a8e1b8aa75be3add8f2f08cde51774c05.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 141, + 195, + 441, + 209.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 141, + 209.0, + 441, + 223.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 141, + 223.0, + 441, + 237.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 239, + 285, + 251 + ], + "lines": [ + { + "bbox": [ + 106, + 238, + 285, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 228, + 253 + ], + "score": 1.0, + "content": "Writing out the expression for", + "type": "text" + }, + { + "bbox": [ + 228, + 240, + 240, + 251 + ], + "score": 0.89, + "content": "f ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 238, + 285, + 253 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 238, + 285, + 253 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 253, + 497, + 361 + ], + "lines": [ + { + "bbox": [ + 115, + 253, + 497, + 361 + ], + "spans": [ + { + "bbox": [ + 115, + 253, + 497, + 361 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\underset { \\lambda \\geq 0 , \\kappa } { \\mathrm { m a x ~ m i n } } \\kappa - \\displaystyle \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\theta _ { a } \\Bigg ( ( \\kappa - 1 ) \\gamma _ { a } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { a } ) \\Bigg ) - \\theta _ { b } \\Bigg ( ( \\kappa + 1 ) \\gamma _ { b } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { b } ) \\Bigg ) } \\\\ & { \\quad \\quad \\quad \\quad \\quad - \\theta _ { c } \\Bigg ( \\kappa \\gamma _ { c } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { a } ) \\Bigg ) } \\\\ & { = \\underset { \\gamma \\geq 0 } { \\mathrm { m i n } } \\underset { \\lambda \\geq 0 , \\kappa } { \\mathrm { m a x } } \\kappa \\big ( 1 - \\theta _ { a } \\gamma _ { a } - \\theta _ { b } \\gamma _ { b } - \\theta _ { c } \\gamma _ { c } \\big ) + \\displaystyle \\sum _ { i } \\lambda _ { i } \\Bigg ( \\displaystyle \\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) - \\epsilon _ { i } \\Bigg ) + \\theta _ { a } \\gamma _ { a } - \\theta _ { b } \\gamma _ { b } \\ , } \\end{array}", + "type": "interline_equation", + "image_path": "c769fc052652243517d9995b4e16260154251ba864425434f67c2f3dca33d2bb.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 115, + 253, + 497, + 289.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 115, + 289.0, + 497, + 325.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 115, + 325.0, + 497, + 361.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 362, + 504, + 374 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 505, + 375 + ], + "score": 1.0, + "content": "where the second inequality follows from strong duality. The inner maximization is unbounded unless", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 106, + 361, + 505, + 375 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 376, + 402, + 404 + ], + "lines": [ + { + "bbox": [ + 208, + 376, + 402, + 404 + ], + "spans": [ + { + "bbox": [ + 208, + 376, + 402, + 404 + ], + "score": 0.91, + "content": "\\sum _ { y \\in \\{ a , b , c \\} } \\gamma _ { y } \\theta _ { y } = 1 , \\quad \\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) \\leq \\epsilon _ { i } .", + "type": "interline_equation", + "image_path": "da4806625633cffe981d687f382d205030e2ad81df321eb72edf587eca5b358c.jpg" + } + ] + } + ], + "index": 16.5, + "virtual_lines": [ + { + "bbox": [ + 208, + 376, + 402, + 390.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 208, + 390.0, + 402, + 404.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 406, + 506, + 438 + ], + "lines": [ + { + "bbox": [ + 104, + 403, + 504, + 421 + ], + "spans": [ + { + "bbox": [ + 104, + 403, + 394, + 421 + ], + "score": 1.0, + "content": "One thing to note is that, we can rewrite these constraints in terms of", + "type": "text" + }, + { + "bbox": [ + 394, + 406, + 439, + 418 + ], + "score": 0.91, + "content": "\\zeta = \\theta \\odot \\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 403, + 459, + 421 + ], + "score": 1.0, + "content": ", i.e.", + "type": "text" + }, + { + "bbox": [ + 459, + 406, + 504, + 418 + ], + "score": 0.9, + "content": "\\zeta _ { y } = \\theta _ { y } \\gamma _ { y }", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 417, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 121, + 430 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 121, + 417, + 172, + 429 + ], + "score": 0.93, + "content": "y \\in \\{ a , b , c \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 417, + 296, + 430 + ], + "score": 1.0, + "content": ". These constraints ensure that", + "type": "text" + }, + { + "bbox": [ + 296, + 418, + 303, + 429 + ], + "score": 0.84, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 417, + 437, + 430 + ], + "score": 1.0, + "content": "is a probability distribution over", + "type": "text" + }, + { + "bbox": [ + 437, + 418, + 486, + 429 + ], + "score": 0.93, + "content": "\\{ + 1 , 0 , - 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 417, + 506, + 430 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 427, + 158, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 158, + 441 + ], + "score": 1.0, + "content": "furthermore", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 104, + 403, + 506, + 441 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 238, + 434, + 372, + 464 + ], + "lines": [ + { + "bbox": [ + 238, + 434, + 372, + 464 + ], + "spans": [ + { + "bbox": [ + 238, + 434, + 372, + 464 + ], + "score": 0.93, + "content": "\\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) = D _ { f _ { i } } ( \\zeta \\| \\theta ) .", + "type": "interline_equation", + "image_path": "b065cfbf25d99bcffe1de400f53c467321b6cbd08612bd546c9c292ed5c185aa.jpg" + } + ] + } + ], + "index": 21.5, + "virtual_lines": [ + { + "bbox": [ + 238, + 434, + 372, + 449.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 238, + 449.0, + 372, + 464.0 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 464, + 504, + 487 + ], + "lines": [ + { + "bbox": [ + 104, + 463, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 104, + 463, + 304, + 479 + ], + "score": 1.0, + "content": "Thus, the second constraint above is equivalent to", + "type": "text" + }, + { + "bbox": [ + 305, + 465, + 365, + 477 + ], + "score": 0.93, + "content": "D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 463, + 506, + 479 + ], + "score": 1.0, + "content": ". Writing the optimization problem", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 476, + 204, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 476, + 152, + 487 + ], + "score": 1.0, + "content": "in terms of", + "type": "text" + }, + { + "bbox": [ + 153, + 476, + 158, + 487 + ], + "score": 0.83, + "content": "\\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 476, + 204, + 487 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 104, + 463, + 506, + 487 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 489, + 395, + 539 + ], + "lines": [ + { + "bbox": [ + 214, + 489, + 395, + 539 + ], + "spans": [ + { + "bbox": [ + 214, + 489, + 395, + 539 + ], + "score": 0.71, + "content": "\\begin{array} { r c l } { \\displaystyle \\operatorname* { m i n } _ { \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } \\geq 0 } } & { \\zeta _ { a } - \\zeta _ { b } } \\\\ { \\mathrm { s u b j e c t ~ t o } D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i } } & { i = 1 , \\ldots , M } \\\\ { \\displaystyle \\zeta _ { a } + \\zeta _ { b } + \\zeta _ { c } = 1 } & { . } \\end{array}", + "type": "interline_equation", + "image_path": "59cde473effbd4aa1dd48d42ce21f192a0976ef8b81bba8060cbf93f6c58fbcb.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 214, + 489, + 395, + 505.6666666666667 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 214, + 505.6666666666667, + 395, + 522.3333333333334 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 214, + 522.3333333333334, + 395, + 539.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 549, + 441, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 550, + 442, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 442, + 561 + ], + "score": 1.0, + "content": "A.6 CLOSED-FORM CERTIFICATES FOR THE INFORMATION-LIMITED SETTING", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 569, + 506, + 626 + ], + "lines": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 505, + 582 + ], + "score": 1.0, + "content": "In this section we present closed-form certificates for the information-limited setting which can be", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 581, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 220, + 592 + ], + "score": 1.0, + "content": "derived from Theorem 2 for", + "type": "text" + }, + { + "bbox": [ + 220, + 581, + 250, + 591 + ], + "score": 0.9, + "content": "M = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 581, + 505, + 592 + ], + "score": 1.0, + "content": ". The results are summarized in Table 4. In the next subsections", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 591, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 104, + 591, + 506, + 604 + ], + "score": 1.0, + "content": "we present the derivation of the certificates for Hockey-Stick and Renyi divergences. The certificates ´", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 601, + 506, + 617 + ], + "spans": [ + { + "bbox": [ + 104, + 601, + 506, + 617 + ], + "score": 1.0, + "content": "for the KL and infinite Renyi divergence can be derived by taking limits of the R ´ enyi certificate (as ´", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 107, + 613, + 206, + 627 + ], + "spans": [ + { + "bbox": [ + 107, + 614, + 149, + 625 + ], + "score": 0.91, + "content": "\\alpha 1 , \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 613, + 206, + 627 + ], + "score": 1.0, + "content": "respectively).", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31, + "bbox_fs": [ + 104, + 570, + 506, + 627 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 636, + 421, + 648 + ], + "lines": [ + { + "bbox": [ + 106, + 636, + 422, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 636, + 422, + 649 + ], + "score": 1.0, + "content": "A.6.1 CALCULATION OF CERTIFICATE FOR HOCKEY-STICK DIVERGENCE", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 655, + 504, + 678 + ], + "lines": [ + { + "bbox": [ + 104, + 653, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 104, + 653, + 159, + 670 + ], + "score": 1.0, + "content": "The function", + "type": "text" + }, + { + "bbox": [ + 159, + 656, + 322, + 668 + ], + "score": 0.93, + "content": "f ( u ) = \\mathrm { m a x } ( u - \\beta , 0 ) - \\mathrm { m a x } ( 1 - \\beta , 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 653, + 424, + 670 + ], + "score": 1.0, + "content": "is a convex function with", + "type": "text" + }, + { + "bbox": [ + 424, + 656, + 462, + 668 + ], + "score": 0.92, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 653, + 506, + 670 + ], + "score": 1.0, + "content": ". Then, we", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 666, + 129, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 129, + 679 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 104, + 653, + 506, + 679 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 679, + 424, + 730 + ], + "lines": [ + { + "bbox": [ + 186, + 679, + 424, + 730 + ], + "spans": [ + { + "bbox": [ + 186, + 679, + 424, + 730 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } & { } & { f _ { \\lambda } ^ { * } ( u ) = \\underset { v \\geq 0 } { \\operatorname* { m a x } } \\left( u v - \\lambda \\operatorname* { m a x } ( v - \\beta , 0 ) \\right) + \\lambda \\operatorname* { m a x } ( 1 - \\beta , 0 ) } \\\\ & { } & { \\quad = \\left\\{ \\begin{array} { l l } { \\operatorname* { m a x } ( \\beta u , 0 ) + \\lambda \\operatorname* { m a x } ( 1 - \\beta , 0 ) \\quad } & { \\mathrm { ~ i f ~ } u \\leq \\lambda \\mathrm { ~ , ~ } } \\\\ { \\infty \\quad } & { \\mathrm { ~ i f ~ } u > \\lambda \\mathrm { ~ . ~ } } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "5c437001bcad52ace990a66975b82ca399e29cc2465fd1122239e18eedc61db4.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 186, + 679, + 424, + 696.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 186, + 696.0, + 424, + 713.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 186, + 713.0, + 424, + 730.0 + ], + "spans": [], + "index": 39 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 79, + 506, + 191 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 79, + 506, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 79, + 506, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 506, + 191 + ], + "score": 0.982, + "html": "
Divergence constraintf(u)Certificate
KL divergenceKL(νllρ)≤∈κLulog(u)∈KL≤-log(1-(√θa-√6)²)
Rényi divergences (α ≥ 0)Ra(vllp)≤∈r,αsign(a - 1)(uα - 1)∈R,a≤-log(1-0a-0b+2n)n=((1-+(1-a)()2
Infinite Renyi divergenceRo(vllp)≤∈R,∞∈R,∞≤-log(1-(0a-0b))
Hockey-stick divergences (β ≥ 0)DHS,β(vllp)≤HS,β[u- β]+-[1-β]+€Hs,β≤β(0a-06)-1β-112土
", + "type": "table", + "image_path": "8369ade9373c62933df1644ed72e853897f42f76271603b1fd45645297336f1b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 79, + 506, + 116.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 116.33333333333334, + 506, + 153.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 153.66666666666669, + 506, + 191.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 198, + 506, + 246 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 198, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 231, + 212 + ], + "score": 1.0, + "content": "Table 4: Certificates for various", + "type": "text" + }, + { + "bbox": [ + 232, + 199, + 238, + 210 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 198, + 505, + 212 + ], + "score": 1.0, + "content": "-divergences for the information-limited setting. Note that the Renyi ´", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 208, + 507, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 218, + 225 + ], + "score": 1.0, + "content": "divergences are not proper", + "type": "text" + }, + { + "bbox": [ + 218, + 210, + 225, + 221 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 208, + 356, + 225 + ], + "score": 1.0, + "content": "-divergences, but are defined as", + "type": "text" + }, + { + "bbox": [ + 356, + 209, + 503, + 223 + ], + "score": 0.92, + "content": "\\begin{array} { r } { R _ { \\alpha } ( \\nu \\| \\rho ) = \\frac { \\breve { 1 } } { \\alpha - 1 } \\log ( 1 + D _ { f } ( \\nu \\| \\rho \\breve { ) } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 208, + 507, + 225 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 222, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 282, + 236 + ], + "score": 1.0, + "content": "The infinite Renyi divergence, defined as ´", + "type": "text" + }, + { + "bbox": [ + 283, + 222, + 369, + 235 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\log ( \\nu ( x ) / \\rho ( x ) ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 222, + 506, + 236 + ], + "score": 1.0, + "content": ", is obtained by taking the limit", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 233, + 477, + 247 + ], + "spans": [ + { + "bbox": [ + 107, + 235, + 140, + 243 + ], + "score": 0.86, + "content": "\\alpha \\to \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 233, + 316, + 247 + ], + "score": 1.0, + "content": ". All certificates depend on the gap between", + "type": "text" + }, + { + "bbox": [ + 316, + 234, + 326, + 244 + ], + "score": 0.87, + "content": "\\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 233, + 344, + 247 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 344, + 234, + 354, + 244 + ], + "score": 0.85, + "content": "\\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 233, + 399, + 247 + ], + "score": 1.0, + "content": ". Notation:", + "type": "text" + }, + { + "bbox": [ + 400, + 234, + 473, + 246 + ], + "score": 0.92, + "content": "[ u ] _ { + } = \\operatorname* { m a x } ( u , 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 233, + 477, + 247 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 107, + 267, + 503, + 290 + ], + "lines": [ + { + "bbox": [ + 106, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "The certificate given by Eq. 6 in Theorem 1 for this divergence in the case of a smoothed hard", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 278, + 204, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 278, + 204, + 290 + ], + "score": 1.0, + "content": "classifier takes the form", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 293, + 403, + 321 + ], + "lines": [ + { + "bbox": [ + 205, + 293, + 403, + 321 + ], + "spans": [ + { + "bbox": [ + 205, + 293, + 403, + 321 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { \\kappa \\in \\mathbb { R } , \\lambda \\geq 0 } \\left( \\kappa - \\operatorname { \\mathrm { ~ E ~ } } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] \\right) - \\lambda \\epsilon \\geq 0 \\mathrm { ~ , ~ }", + "type": "interline_equation", + "image_path": "44f41bb0b307cc38f5b315580443c7ff0fe516979f001cb0352d698b78ec3623.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 205, + 293, + 403, + 321 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 326, + 265, + 337 + ], + "lines": [ + { + "bbox": [ + 106, + 326, + 266, + 338 + ], + "spans": [ + { + "bbox": [ + 106, + 326, + 266, + 338 + ], + "score": 1.0, + "content": "where the specification takes the values", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 344, + 383, + 385 + ], + "lines": [ + { + "bbox": [ + 226, + 344, + 383, + 385 + ], + "spans": [ + { + "bbox": [ + 226, + 344, + 383, + 385 + ], + "score": 0.93, + "content": "\\phi ( X ) = \\left\\{ \\begin{array} { l l } { { + 1 } } & { { \\quad \\mathrm { w . p . ~ } \\theta _ { a } ~ , } } \\\\ { { - 1 } } & { { \\quad \\mathrm { w . p . ~ } \\theta _ { b } ~ , } } \\\\ { { 0 } } & { { \\quad \\mathrm { w . p . ~ } 1 - \\theta _ { a } - \\theta _ { b } ~ . } } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "8f1fcae7cdda27af19e818d78300770354fd769874e269ddfe345d0513c74f68.jpg" + } + ] + } + ], + "index": 11.5, + "virtual_lines": [ + { + "bbox": [ + 226, + 344, + 383, + 364.5 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 226, + 364.5, + 383, + 385.0 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 390, + 416, + 403 + ], + "lines": [ + { + "bbox": [ + 105, + 389, + 417, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 229, + 404 + ], + "score": 1.0, + "content": "Plugging in the expression for", + "type": "text" + }, + { + "bbox": [ + 229, + 392, + 240, + 403 + ], + "score": 0.9, + "content": "f ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 389, + 417, + 404 + ], + "score": 1.0, + "content": "the objective function above takes the form", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 140, + 407, + 470, + 423 + ], + "lines": [ + { + "bbox": [ + 140, + 407, + 470, + 423 + ], + "spans": [ + { + "bbox": [ + 140, + 407, + 470, + 423 + ], + "score": 0.88, + "content": "\\kappa - \\beta \\big ( \\theta _ { a } [ \\kappa - 1 ] _ { + } + \\theta _ { b } [ \\kappa + 1 ] _ { + } + ( 1 - \\theta _ { a } - \\theta _ { b } ) [ \\kappa ] _ { + } \\big ) - \\lambda ( \\epsilon + \\operatorname* { m a x } ( 1 - \\beta , 0 ) ) ~ ,", + "type": "interline_equation", + "image_path": "8bd1a1c119b106e4192692af213a74615db283bb235bdb0bb46c9d7f86869888.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 140, + 407, + 470, + 423 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 506, + 473 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 218, + 442 + ], + "score": 1.0, + "content": "where we use the notation", + "type": "text" + }, + { + "bbox": [ + 219, + 429, + 295, + 441 + ], + "score": 0.9, + "content": "[ u ] _ { + } = \\operatorname* { m a x } ( u , 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 429, + 416, + 442 + ], + "score": 1.0, + "content": "and assumed the constraints", + "type": "text" + }, + { + "bbox": [ + 416, + 429, + 464, + 440 + ], + "score": 0.91, + "content": "\\kappa \\leq \\lambda - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 429, + 506, + 442 + ], + "score": 1.0, + "content": "since the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 440, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 154, + 452 + ], + "score": 1.0, + "content": "objective is", + "type": "text" + }, + { + "bbox": [ + 155, + 441, + 174, + 451 + ], + "score": 0.89, + "content": "- \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 440, + 228, + 452 + ], + "score": 1.0, + "content": "otherwise. If", + "type": "text" + }, + { + "bbox": [ + 228, + 441, + 254, + 451 + ], + "score": 0.86, + "content": "\\beta \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 440, + 435, + 452 + ], + "score": 1.0, + "content": ", the objective is increasing monotonically in", + "type": "text" + }, + { + "bbox": [ + 435, + 442, + 442, + 450 + ], + "score": 0.76, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 440, + 505, + 452 + ], + "score": 1.0, + "content": ", so the optimal", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 451, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 162, + 462 + ], + "score": 1.0, + "content": "value is to set", + "type": "text" + }, + { + "bbox": [ + 163, + 453, + 170, + 461 + ], + "score": 0.81, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 451, + 245, + 462 + ], + "score": 1.0, + "content": "to its upper bound", + "type": "text" + }, + { + "bbox": [ + 245, + 452, + 269, + 461 + ], + "score": 0.86, + "content": "\\lambda - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 451, + 505, + 462 + ], + "score": 1.0, + "content": ". Plugging this in, the possible values of the derivative with", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 462, + 171, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 147, + 474 + ], + "score": 1.0, + "content": "respect to", + "type": "text" + }, + { + "bbox": [ + 148, + 462, + 155, + 471 + ], + "score": 0.82, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 462, + 171, + 474 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 473, + 379, + 514 + ], + "lines": [ + { + "bbox": [ + 231, + 473, + 379, + 514 + ], + "spans": [ + { + "bbox": [ + 231, + 473, + 379, + 514 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\left\\{ \\begin{array} { l l } { \\beta ( 1 - \\theta _ { b } ) - \\epsilon \\quad } & { \\mathrm { i f ~ 0 \\leq \\lambda < 1 ~ } , } \\\\ { \\beta \\theta _ { a } - \\epsilon \\quad } & { \\mathrm { i f ~ 1 < \\lambda < 2 ~ } , } \\\\ { - \\epsilon \\quad } & { \\mathrm { i f ~ } \\lambda > 2 . } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "95e8785c2b931e88ce22db0e09efaba12bba2d5992b408c00deb22245aae8b7e.jpg" + } + ] + } + ], + "index": 19.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 473, + 379, + 493.5 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 231, + 493.5, + 379, + 514.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 517, + 505, + 541 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 139, + 531 + ], + "score": 1.0, + "content": "Thus, if", + "type": "text" + }, + { + "bbox": [ + 140, + 518, + 173, + 529 + ], + "score": 0.92, + "content": "\\epsilon \\leq \\beta \\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 517, + 305, + 531 + ], + "score": 1.0, + "content": ", the maximum is attained at 2, if", + "type": "text" + }, + { + "bbox": [ + 305, + 518, + 392, + 530 + ], + "score": 0.92, + "content": "\\beta \\theta _ { a } \\le \\epsilon \\le \\beta ( 1 - \\theta _ { b } )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 517, + 506, + 531 + ], + "score": 1.0, + "content": ", the maximum is attained at", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 528, + 356, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 356, + 542 + ], + "score": 1.0, + "content": "1, else the maximum is attained at 0, leading to the certificate:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "interline_equation", + "bbox": [ + 183, + 547, + 426, + 588 + ], + "lines": [ + { + "bbox": [ + 183, + 547, + 426, + 588 + ], + "spans": [ + { + "bbox": [ + 183, + 547, + 426, + 588 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\left\\{ \\begin{array} { l l } { - 1 } & { \\mathrm { i f } \\epsilon \\geq \\beta ( 1 - \\theta _ { b } ) , } \\\\ { \\beta ( 1 - \\theta _ { b } ) - \\epsilon - 1 } & { \\mathrm { i f } \\beta \\theta _ { a } \\leq \\epsilon \\leq \\beta ( 1 - \\theta _ { b } ) , } \\\\ { \\beta ( 1 + ( \\theta _ { a } - \\theta _ { b } ) ) - 2 \\epsilon - 1 } & { \\mathrm { i f } \\epsilon \\leq \\beta \\theta _ { a } . } \\end{array} \\right. , } \\end{array}", + "type": "interline_equation", + "image_path": "af46de3752ce66b5b39deee5882d5ea7f9a004bb0a3f7e5f6628d70cb5d9868f.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 183, + 547, + 426, + 567.5 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 183, + 567.5, + 426, + 588.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 279, + 606 + ], + "lines": [ + { + "bbox": [ + 105, + 592, + 281, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 281, + 608 + ], + "score": 1.0, + "content": "Thus, the certificate is non-negative only if", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 610, + 385, + 639 + ], + "lines": [ + { + "bbox": [ + 226, + 610, + 385, + 639 + ], + "spans": [ + { + "bbox": [ + 226, + 610, + 385, + 639 + ], + "score": 0.94, + "content": "\\epsilon \\le \\operatorname* { m a x } \\left( \\frac { \\beta ( 1 + ( \\theta _ { a } - \\theta _ { b } ) ) - 1 } { 2 } , 0 \\right) \\ .", + "type": "interline_equation", + "image_path": "cb69b8fc1fa95eb4f6ec9f2f0916e303ccc48e7e0bafb806afcaeef0bfcd503b.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 226, + 610, + 385, + 624.5 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 226, + 624.5, + 385, + 639.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 643, + 329, + 655 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 328, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 144, + 658 + ], + "score": 1.0, + "content": "The case", + "type": "text" + }, + { + "bbox": [ + 144, + 644, + 169, + 655 + ], + "score": 0.9, + "content": "\\beta \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 641, + 328, + 658 + ], + "score": 1.0, + "content": "can be worked out similarly, leading to", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 660, + 389, + 688 + ], + "lines": [ + { + "bbox": [ + 222, + 660, + 389, + 688 + ], + "spans": [ + { + "bbox": [ + 222, + 660, + 389, + 688 + ], + "score": 0.94, + "content": "\\epsilon \\le \\operatorname* { m a x } \\biggl ( \\frac { \\beta ( - 1 + ( \\theta _ { a } - \\theta _ { b } ) ) + 1 } { 2 } , 0 \\biggr ) .", + "type": "interline_equation", + "image_path": "ef310b95e365f8d557b2ce04e3a258ee87dd634eab5dbeb868a44624be811aca.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 222, + 660, + 389, + 688 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 693, + 245, + 704 + ], + "lines": [ + { + "bbox": [ + 105, + 691, + 246, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 246, + 705 + ], + "score": 1.0, + "content": "The two cases can be combined as", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 708, + 385, + 736 + ], + "lines": [ + { + "bbox": [ + 226, + 708, + 385, + 736 + ], + "spans": [ + { + "bbox": [ + 226, + 708, + 385, + 736 + ], + "score": 0.93, + "content": "\\epsilon \\leq \\operatorname* { m a x } \\mathopen { } \\mathclose \\bgroup \\left( \\frac { \\beta ( \\theta _ { a } - \\theta _ { b } ) - | \\beta - 1 | } { 2 } , 0 \\aftergroup \\egroup \\right) ~ .", + "type": "interline_equation", + "image_path": "a89dfcf911ec88f0e5a438e315f7592893c71f1c3c40ec1ccb529727bbc8c5d9.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 226, + 708, + 385, + 736 + ], + "spans": [], + "index": 31 + } + ] + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "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": "16", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 79, + 506, + 191 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 79, + 506, + 191 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 79, + 506, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 506, + 191 + ], + "score": 0.982, + "html": "
Divergence constraintf(u)Certificate
KL divergenceKL(νllρ)≤∈κLulog(u)∈KL≤-log(1-(√θa-√6)²)
Rényi divergences (α ≥ 0)Ra(vllp)≤∈r,αsign(a - 1)(uα - 1)∈R,a≤-log(1-0a-0b+2n)n=((1-+(1-a)()2
Infinite Renyi divergenceRo(vllp)≤∈R,∞∈R,∞≤-log(1-(0a-0b))
Hockey-stick divergences (β ≥ 0)DHS,β(vllp)≤HS,β[u- β]+-[1-β]+€Hs,β≤β(0a-06)-1β-112土
", + "type": "table", + "image_path": "8369ade9373c62933df1644ed72e853897f42f76271603b1fd45645297336f1b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 79, + 506, + 116.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 116.33333333333334, + 506, + 153.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 153.66666666666669, + 506, + 191.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 198, + 506, + 246 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 198, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 231, + 212 + ], + "score": 1.0, + "content": "Table 4: Certificates for various", + "type": "text" + }, + { + "bbox": [ + 232, + 199, + 238, + 210 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 198, + 505, + 212 + ], + "score": 1.0, + "content": "-divergences for the information-limited setting. Note that the Renyi ´", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 208, + 507, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 218, + 225 + ], + "score": 1.0, + "content": "divergences are not proper", + "type": "text" + }, + { + "bbox": [ + 218, + 210, + 225, + 221 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 208, + 356, + 225 + ], + "score": 1.0, + "content": "-divergences, but are defined as", + "type": "text" + }, + { + "bbox": [ + 356, + 209, + 503, + 223 + ], + "score": 0.92, + "content": "\\begin{array} { r } { R _ { \\alpha } ( \\nu \\| \\rho ) = \\frac { \\breve { 1 } } { \\alpha - 1 } \\log ( 1 + D _ { f } ( \\nu \\| \\rho \\breve { ) } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 208, + 507, + 225 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 222, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 282, + 236 + ], + "score": 1.0, + "content": "The infinite Renyi divergence, defined as ´", + "type": "text" + }, + { + "bbox": [ + 283, + 222, + 369, + 235 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\log ( \\nu ( x ) / \\rho ( x ) ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 222, + 506, + 236 + ], + "score": 1.0, + "content": ", is obtained by taking the limit", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 233, + 477, + 247 + ], + "spans": [ + { + "bbox": [ + 107, + 235, + 140, + 243 + ], + "score": 0.86, + "content": "\\alpha \\to \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 233, + 316, + 247 + ], + "score": 1.0, + "content": ". All certificates depend on the gap between", + "type": "text" + }, + { + "bbox": [ + 316, + 234, + 326, + 244 + ], + "score": 0.87, + "content": "\\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 233, + 344, + 247 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 344, + 234, + 354, + 244 + ], + "score": 0.85, + "content": "\\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 233, + 399, + 247 + ], + "score": 1.0, + "content": ". Notation:", + "type": "text" + }, + { + "bbox": [ + 400, + 234, + 473, + 246 + ], + "score": 0.92, + "content": "[ u ] _ { + } = \\operatorname* { m a x } ( u , 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 233, + 477, + 247 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "text", + "bbox": [ + 107, + 267, + 503, + 290 + ], + "lines": [ + { + "bbox": [ + 106, + 267, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 505, + 280 + ], + "score": 1.0, + "content": "The certificate given by Eq. 6 in Theorem 1 for this divergence in the case of a smoothed hard", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 278, + 204, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 278, + 204, + 290 + ], + "score": 1.0, + "content": "classifier takes the form", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 106, + 267, + 505, + 290 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 293, + 403, + 321 + ], + "lines": [ + { + "bbox": [ + 205, + 293, + 403, + 321 + ], + "spans": [ + { + "bbox": [ + 205, + 293, + 403, + 321 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { \\kappa \\in \\mathbb { R } , \\lambda \\geq 0 } \\left( \\kappa - \\operatorname { \\mathrm { ~ E ~ } } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] \\right) - \\lambda \\epsilon \\geq 0 \\mathrm { ~ , ~ }", + "type": "interline_equation", + "image_path": "44f41bb0b307cc38f5b315580443c7ff0fe516979f001cb0352d698b78ec3623.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 205, + 293, + 403, + 321 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 326, + 265, + 337 + ], + "lines": [ + { + "bbox": [ + 106, + 326, + 266, + 338 + ], + "spans": [ + { + "bbox": [ + 106, + 326, + 266, + 338 + ], + "score": 1.0, + "content": "where the specification takes the values", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 106, + 326, + 266, + 338 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 344, + 383, + 385 + ], + "lines": [ + { + "bbox": [ + 226, + 344, + 383, + 385 + ], + "spans": [ + { + "bbox": [ + 226, + 344, + 383, + 385 + ], + "score": 0.93, + "content": "\\phi ( X ) = \\left\\{ \\begin{array} { l l } { { + 1 } } & { { \\quad \\mathrm { w . p . ~ } \\theta _ { a } ~ , } } \\\\ { { - 1 } } & { { \\quad \\mathrm { w . p . ~ } \\theta _ { b } ~ , } } \\\\ { { 0 } } & { { \\quad \\mathrm { w . p . ~ } 1 - \\theta _ { a } - \\theta _ { b } ~ . } } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "8f1fcae7cdda27af19e818d78300770354fd769874e269ddfe345d0513c74f68.jpg" + } + ] + } + ], + "index": 11.5, + "virtual_lines": [ + { + "bbox": [ + 226, + 344, + 383, + 364.5 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 226, + 364.5, + 383, + 385.0 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 390, + 416, + 403 + ], + "lines": [ + { + "bbox": [ + 105, + 389, + 417, + 404 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 229, + 404 + ], + "score": 1.0, + "content": "Plugging in the expression for", + "type": "text" + }, + { + "bbox": [ + 229, + 392, + 240, + 403 + ], + "score": 0.9, + "content": "f ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 389, + 417, + 404 + ], + "score": 1.0, + "content": "the objective function above takes the form", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 389, + 417, + 404 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 140, + 407, + 470, + 423 + ], + "lines": [ + { + "bbox": [ + 140, + 407, + 470, + 423 + ], + "spans": [ + { + "bbox": [ + 140, + 407, + 470, + 423 + ], + "score": 0.88, + "content": "\\kappa - \\beta \\big ( \\theta _ { a } [ \\kappa - 1 ] _ { + } + \\theta _ { b } [ \\kappa + 1 ] _ { + } + ( 1 - \\theta _ { a } - \\theta _ { b } ) [ \\kappa ] _ { + } \\big ) - \\lambda ( \\epsilon + \\operatorname* { m a x } ( 1 - \\beta , 0 ) ) ~ ,", + "type": "interline_equation", + "image_path": "8bd1a1c119b106e4192692af213a74615db283bb235bdb0bb46c9d7f86869888.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 140, + 407, + 470, + 423 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 506, + 473 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 218, + 442 + ], + "score": 1.0, + "content": "where we use the notation", + "type": "text" + }, + { + "bbox": [ + 219, + 429, + 295, + 441 + ], + "score": 0.9, + "content": "[ u ] _ { + } = \\operatorname* { m a x } ( u , 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 429, + 416, + 442 + ], + "score": 1.0, + "content": "and assumed the constraints", + "type": "text" + }, + { + "bbox": [ + 416, + 429, + 464, + 440 + ], + "score": 0.91, + "content": "\\kappa \\leq \\lambda - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 429, + 506, + 442 + ], + "score": 1.0, + "content": "since the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 440, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 154, + 452 + ], + "score": 1.0, + "content": "objective is", + "type": "text" + }, + { + "bbox": [ + 155, + 441, + 174, + 451 + ], + "score": 0.89, + "content": "- \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 440, + 228, + 452 + ], + "score": 1.0, + "content": "otherwise. If", + "type": "text" + }, + { + "bbox": [ + 228, + 441, + 254, + 451 + ], + "score": 0.86, + "content": "\\beta \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 440, + 435, + 452 + ], + "score": 1.0, + "content": ", the objective is increasing monotonically in", + "type": "text" + }, + { + "bbox": [ + 435, + 442, + 442, + 450 + ], + "score": 0.76, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 440, + 505, + 452 + ], + "score": 1.0, + "content": ", so the optimal", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 451, + 505, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 162, + 462 + ], + "score": 1.0, + "content": "value is to set", + "type": "text" + }, + { + "bbox": [ + 163, + 453, + 170, + 461 + ], + "score": 0.81, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 451, + 245, + 462 + ], + "score": 1.0, + "content": "to its upper bound", + "type": "text" + }, + { + "bbox": [ + 245, + 452, + 269, + 461 + ], + "score": 0.86, + "content": "\\lambda - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 451, + 505, + 462 + ], + "score": 1.0, + "content": ". Plugging this in, the possible values of the derivative with", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 462, + 171, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 147, + 474 + ], + "score": 1.0, + "content": "respect to", + "type": "text" + }, + { + "bbox": [ + 148, + 462, + 155, + 471 + ], + "score": 0.82, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 462, + 171, + 474 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 429, + 506, + 474 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 473, + 379, + 514 + ], + "lines": [ + { + "bbox": [ + 231, + 473, + 379, + 514 + ], + "spans": [ + { + "bbox": [ + 231, + 473, + 379, + 514 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\left\\{ \\begin{array} { l l } { \\beta ( 1 - \\theta _ { b } ) - \\epsilon \\quad } & { \\mathrm { i f ~ 0 \\leq \\lambda < 1 ~ } , } \\\\ { \\beta \\theta _ { a } - \\epsilon \\quad } & { \\mathrm { i f ~ 1 < \\lambda < 2 ~ } , } \\\\ { - \\epsilon \\quad } & { \\mathrm { i f ~ } \\lambda > 2 . } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "95e8785c2b931e88ce22db0e09efaba12bba2d5992b408c00deb22245aae8b7e.jpg" + } + ] + } + ], + "index": 19.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 473, + 379, + 493.5 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 231, + 493.5, + 379, + 514.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 517, + 505, + 541 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 139, + 531 + ], + "score": 1.0, + "content": "Thus, if", + "type": "text" + }, + { + "bbox": [ + 140, + 518, + 173, + 529 + ], + "score": 0.92, + "content": "\\epsilon \\leq \\beta \\theta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 517, + 305, + 531 + ], + "score": 1.0, + "content": ", the maximum is attained at 2, if", + "type": "text" + }, + { + "bbox": [ + 305, + 518, + 392, + 530 + ], + "score": 0.92, + "content": "\\beta \\theta _ { a } \\le \\epsilon \\le \\beta ( 1 - \\theta _ { b } )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 517, + 506, + 531 + ], + "score": 1.0, + "content": ", the maximum is attained at", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 528, + 356, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 356, + 542 + ], + "score": 1.0, + "content": "1, else the maximum is attained at 0, leading to the certificate:", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 517, + 506, + 542 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 183, + 547, + 426, + 588 + ], + "lines": [ + { + "bbox": [ + 183, + 547, + 426, + 588 + ], + "spans": [ + { + "bbox": [ + 183, + 547, + 426, + 588 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\left\\{ \\begin{array} { l l } { - 1 } & { \\mathrm { i f } \\epsilon \\geq \\beta ( 1 - \\theta _ { b } ) , } \\\\ { \\beta ( 1 - \\theta _ { b } ) - \\epsilon - 1 } & { \\mathrm { i f } \\beta \\theta _ { a } \\leq \\epsilon \\leq \\beta ( 1 - \\theta _ { b } ) , } \\\\ { \\beta ( 1 + ( \\theta _ { a } - \\theta _ { b } ) ) - 2 \\epsilon - 1 } & { \\mathrm { i f } \\epsilon \\leq \\beta \\theta _ { a } . } \\end{array} \\right. , } \\end{array}", + "type": "interline_equation", + "image_path": "af46de3752ce66b5b39deee5882d5ea7f9a004bb0a3f7e5f6628d70cb5d9868f.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 183, + 547, + 426, + 567.5 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 183, + 567.5, + 426, + 588.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 279, + 606 + ], + "lines": [ + { + "bbox": [ + 105, + 592, + 281, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 281, + 608 + ], + "score": 1.0, + "content": "Thus, the certificate is non-negative only if", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 592, + 281, + 608 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 610, + 385, + 639 + ], + "lines": [ + { + "bbox": [ + 226, + 610, + 385, + 639 + ], + "spans": [ + { + "bbox": [ + 226, + 610, + 385, + 639 + ], + "score": 0.94, + "content": "\\epsilon \\le \\operatorname* { m a x } \\left( \\frac { \\beta ( 1 + ( \\theta _ { a } - \\theta _ { b } ) ) - 1 } { 2 } , 0 \\right) \\ .", + "type": "interline_equation", + "image_path": "cb69b8fc1fa95eb4f6ec9f2f0916e303ccc48e7e0bafb806afcaeef0bfcd503b.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 226, + 610, + 385, + 624.5 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 226, + 624.5, + 385, + 639.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 643, + 329, + 655 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 328, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 144, + 658 + ], + "score": 1.0, + "content": "The case", + "type": "text" + }, + { + "bbox": [ + 144, + 644, + 169, + 655 + ], + "score": 0.9, + "content": "\\beta \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 641, + 328, + 658 + ], + "score": 1.0, + "content": "can be worked out similarly, leading to", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 641, + 328, + 658 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 222, + 660, + 389, + 688 + ], + "lines": [ + { + "bbox": [ + 222, + 660, + 389, + 688 + ], + "spans": [ + { + "bbox": [ + 222, + 660, + 389, + 688 + ], + "score": 0.94, + "content": "\\epsilon \\le \\operatorname* { m a x } \\biggl ( \\frac { \\beta ( - 1 + ( \\theta _ { a } - \\theta _ { b } ) ) + 1 } { 2 } , 0 \\biggr ) .", + "type": "interline_equation", + "image_path": "ef310b95e365f8d557b2ce04e3a258ee87dd634eab5dbeb868a44624be811aca.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 222, + 660, + 389, + 688 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 693, + 245, + 704 + ], + "lines": [ + { + "bbox": [ + 105, + 691, + 246, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 246, + 705 + ], + "score": 1.0, + "content": "The two cases can be combined as", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 691, + 246, + 705 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 708, + 385, + 736 + ], + "lines": [ + { + "bbox": [ + 226, + 708, + 385, + 736 + ], + "spans": [ + { + "bbox": [ + 226, + 708, + 385, + 736 + ], + "score": 0.93, + "content": "\\epsilon \\leq \\operatorname* { m a x } \\mathopen { } \\mathclose \\bgroup \\left( \\frac { \\beta ( \\theta _ { a } - \\theta _ { b } ) - | \\beta - 1 | } { 2 } , 0 \\aftergroup \\egroup \\right) ~ .", + "type": "interline_equation", + "image_path": "a89dfcf911ec88f0e5a438e315f7592893c71f1c3c40ec1ccb529727bbc8c5d9.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 226, + 708, + 385, + 736 + ], + "spans": [], + "index": 31 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 385, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 385, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 385, + 95 + ], + "score": 1.0, + "content": "A.6.2 CALCULATION OF CERTIFICATE FOR RENYI DIVERGENCE ´", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 101, + 312, + 114 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 312, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 196, + 116 + ], + "score": 1.0, + "content": "We consider the cases", + "type": "text" + }, + { + "bbox": [ + 196, + 102, + 222, + 113 + ], + "score": 0.91, + "content": "\\alpha \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 99, + 240, + 116 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 240, + 102, + 266, + 113 + ], + "score": 0.9, + "content": "\\alpha \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 99, + 312, + 116 + ], + "score": 1.0, + "content": "separately.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 124, + 506, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 123, + 507, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 138, + 138 + ], + "score": 1.0, + "content": "Case 1", + "type": "text" + }, + { + "bbox": [ + 139, + 126, + 167, + 137 + ], + "score": 0.78, + "content": "( \\alpha \\geq 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 123, + 187, + 138 + ], + "score": 1.0, + "content": ") If", + "type": "text" + }, + { + "bbox": [ + 187, + 126, + 213, + 136 + ], + "score": 0.9, + "content": "\\alpha \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 123, + 266, + 138 + ], + "score": 1.0, + "content": ", the function", + "type": "text" + }, + { + "bbox": [ + 267, + 125, + 336, + 137 + ], + "score": 0.92, + "content": "f ( u ) = \\left( u ^ { \\alpha } - 1 \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 123, + 439, + 138 + ], + "score": 1.0, + "content": "is a convex function with", + "type": "text" + }, + { + "bbox": [ + 439, + 125, + 477, + 137 + ], + "score": 0.92, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 123, + 507, + 138 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 136, + 142, + 148 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 142, + 148 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "interline_equation", + "bbox": [ + 156, + 150, + 455, + 215 + ], + "lines": [ + { + "bbox": [ + 156, + 150, + 455, + 215 + ], + "spans": [ + { + "bbox": [ + 156, + 150, + 455, + 215 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { f _ { \\lambda } ^ { * } ( u ) = \\underset { v \\geq 0 } { \\operatorname* { m a x } } u v - \\lambda ( v ^ { \\alpha } - 1 ) = \\{ \\lambda \\atop \\lambda + \\lambda ( \\alpha - 1 ) ( \\frac { u } { \\lambda \\alpha } ) ^ { \\frac { \\alpha } { \\alpha - 1 } } } \\quad \\quad \\mathrm { i f } u \\leq 0 \\\\ & { \\quad \\quad = \\lambda + \\lambda ( \\alpha - 1 ) ( \\frac { \\operatorname* { m a x } ( u , 0 ) } { \\lambda \\alpha } ) ^ { \\frac { \\alpha } { \\alpha - 1 } } \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "fece719ad8ff22ddd87d1f25d7f848321070fe7755f2cb7f75e0c8f371bfd2e2.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 156, + 150, + 455, + 171.66666666666666 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 156, + 171.66666666666666, + 455, + 193.33333333333331 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 156, + 193.33333333333331, + 455, + 214.99999999999997 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 218, + 505, + 244 + ], + "lines": [ + { + "bbox": [ + 105, + 217, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 217, + 322, + 233 + ], + "score": 1.0, + "content": "Suppose we have a bound on the Renyi divergence ´", + "type": "text" + }, + { + "bbox": [ + 323, + 219, + 381, + 231 + ], + "score": 0.92, + "content": "R _ { \\alpha } ( \\nu \\| \\rho ) \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 217, + 453, + 233 + ], + "score": 1.0, + "content": ". Then we know", + "type": "text" + }, + { + "bbox": [ + 454, + 219, + 505, + 232 + ], + "score": 0.92, + "content": "D _ { f } ( \\nu \\| \\rho ) \\leq", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 226, + 264, + 247 + ], + "spans": [ + { + "bbox": [ + 107, + 230, + 184, + 243 + ], + "score": 0.9, + "content": "\\mathrm { e x p } \\bar { ( } ( \\alpha - 1 ) \\epsilon ) - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 226, + 203, + 247 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 203, + 230, + 241, + 244 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\beta = \\frac { \\alpha } { \\alpha - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 226, + 264, + 247 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 248, + 469, + 265 + ], + "lines": [ + { + "bbox": [ + 141, + 248, + 469, + 265 + ], + "spans": [ + { + "bbox": [ + 141, + 248, + 469, + 265 + ], + "score": 0.89, + "content": "B = \\theta _ { a } ( \\operatorname* { m a x } ( 0 , \\kappa - 1 ) ) ^ { \\beta } + \\theta _ { b } ( \\operatorname* { m a x } ( 0 , \\kappa + 1 ) ) ^ { \\beta } + ( 1 - \\theta _ { a } - \\theta _ { b } ) ( \\operatorname* { m a x } ( 0 , \\kappa ) ) ^ { \\beta } \\ .", + "type": "interline_equation", + "image_path": "625f107169b1cb9503f90c2c5e2ac5ce50f92252a722c5b896f170690b2142d3.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 141, + 248, + 469, + 265 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 269, + 345, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 268, + 343, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 343, + 283 + ], + "score": 1.0, + "content": "Then the certificate Eq. 6 simplifies to (after some algebra)", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 286, + 402, + 312 + ], + "lines": [ + { + "bbox": [ + 208, + 286, + 402, + 312 + ], + "spans": [ + { + "bbox": [ + 208, + 286, + 402, + 312 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { \\lambda \\ge 0 , \\kappa } \\kappa - \\lambda \\exp ( ( \\alpha - 1 ) \\epsilon ) - B \\lambda ^ { 1 - \\beta } \\frac { ( \\alpha - 1 ) } { \\alpha ^ { \\beta } } .", + "type": "interline_equation", + "image_path": "80cf64ca28af5300158831e64e6d2781620576652433746e86f95c5776e3d16f.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 208, + 286, + 402, + 312 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 317, + 396, + 329 + ], + "lines": [ + { + "bbox": [ + 106, + 316, + 396, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 254, + 330 + ], + "score": 1.0, + "content": "Setting the derivative with respect to", + "type": "text" + }, + { + "bbox": [ + 255, + 318, + 262, + 327 + ], + "score": 0.84, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 316, + 273, + 330 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 273, + 318, + 279, + 327 + ], + "score": 0.26, + "content": "0", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 316, + 343, + 330 + ], + "score": 1.0, + "content": "and solving for", + "type": "text" + }, + { + "bbox": [ + 344, + 318, + 350, + 327 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 316, + 396, + 330 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 333, + 369, + 365 + ], + "lines": [ + { + "bbox": [ + 241, + 333, + 369, + 365 + ], + "spans": [ + { + "bbox": [ + 241, + 333, + 369, + 365 + ], + "score": 0.95, + "content": "\\lambda = \\frac { 1 } { \\alpha } \\left( \\frac { B } { \\exp ( ( \\alpha - 1 ) \\epsilon ) } \\right) ^ { \\left( \\frac { 1 } { \\beta } \\right) } \\ ,", + "type": "interline_equation", + "image_path": "e7fcec2bad074f8f9506d8354fa7372f3b2cd472f82858ac145871e5515719e6.jpg" + } + ] + } + ], + "index": 13.5, + "virtual_lines": [ + { + "bbox": [ + 241, + 333, + 369, + 349.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 241, + 349.0, + 369, + 365.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 370, + 256, + 381 + ], + "lines": [ + { + "bbox": [ + 106, + 369, + 255, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 255, + 382 + ], + "score": 1.0, + "content": "and the optimal certificate reduces to", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 253, + 385, + 358, + 414 + ], + "lines": [ + { + "bbox": [ + 253, + 385, + 358, + 414 + ], + "spans": [ + { + "bbox": [ + 253, + 385, + 358, + 414 + ], + "score": 0.94, + "content": "\\operatorname* { m a x } _ { \\kappa } \\kappa - B ^ { \\frac { 1 } { \\beta } } \\exp \\biggl ( \\frac { \\epsilon } { \\beta } \\biggr ) .", + "type": "interline_equation", + "image_path": "4b864a7a9fcf431e2e1b6744122dc09c30b6bcf219e1ba856b2f6af4c57837a5.jpg" + } + ] + } + ], + "index": 16.5, + "virtual_lines": [ + { + "bbox": [ + 253, + 385, + 358, + 399.5 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 253, + 399.5, + 358, + 414.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 417, + 327, + 429 + ], + "lines": [ + { + "bbox": [ + 106, + 417, + 327, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 417, + 284, + 430 + ], + "score": 1.0, + "content": "For this number to be positive, we need that", + "type": "text" + }, + { + "bbox": [ + 284, + 418, + 309, + 429 + ], + "score": 0.91, + "content": "\\kappa \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 417, + 327, + 430 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "interline_equation", + "bbox": [ + 266, + 433, + 345, + 462 + ], + "lines": [ + { + "bbox": [ + 266, + 433, + 345, + 462 + ], + "spans": [ + { + "bbox": [ + 266, + 433, + 345, + 462 + ], + "score": 0.94, + "content": "\\frac { \\kappa } { B ^ { \\frac { 1 } { \\beta } } } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) .", + "type": "interline_equation", + "image_path": "df14aeb5143b289a2ae1c8880593a0484492bb8a3e34c60bd8d5d79da5e71256.jpg" + } + ] + } + ], + "index": 19.5, + "virtual_lines": [ + { + "bbox": [ + 266, + 433, + 345, + 447.5 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 266, + 447.5, + 345, + 462.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 466, + 221, + 477 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 221, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 221, + 478 + ], + "score": 1.0, + "content": "The LHS above evaluates to", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 480, + 434, + 505 + ], + "lines": [ + { + "bbox": [ + 177, + 480, + 434, + 505 + ], + "spans": [ + { + "bbox": [ + 177, + 480, + 434, + 505 + ], + "score": 0.91, + "content": "\\Big ( \\theta _ { a } \\operatorname* { m a x } ( 0 , 1 - \\gamma ) ^ { \\beta } + \\theta _ { b } \\operatorname* { m a x } ( 0 , 1 + \\gamma ) ^ { \\beta } + 1 - \\theta _ { a } - \\theta _ { b } \\Big ) ^ { - \\frac { 1 } { \\beta } } \\ .", + "type": "interline_equation", + "image_path": "664920295df38b687a42e8c7673651e9afe561d64096b92b04316cd49030a8c7.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 177, + 480, + 434, + 505 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 510, + 409, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 410, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 132, + 525 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 510, + 178, + 524 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\gamma = \\frac { 1 } { \\kappa } \\geq 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 509, + 357, + 525 + ], + "score": 1.0, + "content": ". Maximizing this expression with respect to", + "type": "text" + }, + { + "bbox": [ + 357, + 514, + 364, + 523 + ], + "score": 0.81, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 509, + 410, + 525 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "interline_equation", + "bbox": [ + 262, + 528, + 348, + 558 + ], + "lines": [ + { + "bbox": [ + 262, + 528, + 348, + 558 + ], + "spans": [ + { + "bbox": [ + 262, + 528, + 348, + 558 + ], + "score": 0.94, + "content": "\\gamma = \\frac { \\theta _ { a } ^ { \\alpha - 1 } - \\theta _ { b } ^ { \\alpha - 1 } } { \\theta _ { a } ^ { \\alpha - 1 } + \\theta _ { b } ^ { \\alpha - 1 } } \\mathrm { ~ , ~ }", + "type": "interline_equation", + "image_path": "ea44b98a067ceecdd25c7ebb27011a53536a3d1ddc6eb36077a3352585832a86.jpg" + } + ] + } + ], + "index": 24.5, + "virtual_lines": [ + { + "bbox": [ + 262, + 528, + 348, + 543.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 262, + 543.0, + 348, + 558.0 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 563, + 235, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 563, + 235, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 235, + 574 + ], + "score": 1.0, + "content": "so that the certificate reduces to", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 577, + 442, + 609 + ], + "lines": [ + { + "bbox": [ + 169, + 577, + 442, + 609 + ], + "spans": [ + { + "bbox": [ + 169, + 577, + 442, + 609 + ], + "score": 0.94, + "content": "\\left( 2 ^ { \\beta } \\theta _ { a } \\theta _ { b } \\bigl ( \\theta _ { a } ^ { \\alpha - 1 } + \\theta _ { b } ^ { \\alpha - 1 } \\bigr ) ^ { \\left( - \\frac { 1 } { \\alpha - 1 } \\right) } + 1 - \\theta _ { a } - \\theta _ { b } \\right) ^ { \\left( \\frac { 1 } { \\beta } \\right) } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) \\ .", + "type": "interline_equation", + "image_path": "8ab5f597d4fc5f6e1d7e63049dfc86169b4fb803d36fad4b343b20538a73ddb2.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 169, + 577, + 442, + 587.6666666666666 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 169, + 587.6666666666666, + 442, + 598.3333333333333 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 169, + 598.3333333333333, + 442, + 608.9999999999999 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 613, + 264, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 613, + 265, + 626 + ], + "spans": [ + { + "bbox": [ + 106, + 613, + 265, + 626 + ], + "score": 1.0, + "content": "Taking logarithms now gives the result.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 103, + 636, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 140, + 650 + ], + "score": 1.0, + "content": "Case 2", + "type": "text" + }, + { + "bbox": [ + 141, + 637, + 188, + 648 + ], + "score": 0.8, + "content": "0 \\leq \\alpha \\leq 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 635, + 225, + 650 + ], + "score": 1.0, + "content": ") When", + "type": "text" + }, + { + "bbox": [ + 226, + 637, + 271, + 648 + ], + "score": 0.9, + "content": "0 \\leq \\alpha \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 635, + 327, + 650 + ], + "score": 1.0, + "content": ", the function", + "type": "text" + }, + { + "bbox": [ + 327, + 637, + 398, + 649 + ], + "score": 0.95, + "content": "f ( u ) = \\left( 1 - u ^ { \\alpha } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 635, + 505, + 650 + ], + "score": 1.0, + "content": "is a convex function with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 107, + 647, + 210, + 660 + ], + "spans": [ + { + "bbox": [ + 107, + 648, + 145, + 660 + ], + "score": 0.92, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 647, + 210, + 660 + ], + "score": 1.0, + "content": ". Then, we have", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "interline_equation", + "bbox": [ + 136, + 664, + 470, + 698 + ], + "lines": [ + { + "bbox": [ + 136, + 664, + 470, + 698 + ], + "spans": [ + { + "bbox": [ + 136, + 664, + 470, + 698 + ], + "score": 0.93, + "content": "f _ { \\lambda } ^ { * } ( u ) = \\operatorname* { m a x } _ { v \\geq 0 } u v - \\lambda ( 1 - v ^ { \\alpha } ) = \\left\\{ \\begin{array} { l l } { - \\lambda + \\lambda ^ { \\frac { 1 } { 1 - \\alpha } } ( 1 - \\alpha ) { \\left( \\frac { - u } { \\alpha } \\right) } ^ { \\left( - \\frac { \\alpha } { 1 - \\alpha } \\right) } } & { \\mathrm { ~ i f ~ } u \\leq 0 } \\\\ { \\infty } & { \\mathrm { ~ o t h e r w i s e ~ . } } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "2a749e47bcbe8c72b42cd5a7f37693a59ddafa0c99b66fb0e12a752f5f58b7ac.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 136, + 664, + 470, + 675.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 136, + 675.3333333333334, + 470, + 686.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 136, + 686.6666666666667, + 470, + 698.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 702, + 263, + 715 + ], + "lines": [ + { + "bbox": [ + 106, + 702, + 263, + 716 + ], + "spans": [ + { + "bbox": [ + 106, + 702, + 174, + 716 + ], + "score": 1.0, + "content": "Further, a bound", + "type": "text" + }, + { + "bbox": [ + 175, + 703, + 230, + 715 + ], + "score": 0.93, + "content": "R _ { \\alpha } ( \\nu \\| \\rho ) \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 702, + 263, + 716 + ], + "score": 1.0, + "content": "implies", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "interline_equation", + "bbox": [ + 237, + 719, + 373, + 734 + ], + "lines": [ + { + "bbox": [ + 237, + 719, + 373, + 734 + ], + "spans": [ + { + "bbox": [ + 237, + 719, + 373, + 734 + ], + "score": 0.9, + "content": "D _ { f } ( \\nu \\vert \\vert \\rho ) \\leq 1 - \\exp ( ( \\alpha - 1 ) \\epsilon ) .", + "type": "interline_equation", + "image_path": "d988e02e31c61f1ea5e1970fbd2eb6566aa88362dad7e3afffb1178887c30df5.jpg" + } + ] + } + ], + "index": 37, + "virtual_lines": [ + { + "bbox": [ + 237, + 719, + 373, + 734 + ], + "spans": [], + "index": 37 + } + ] + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 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 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "17", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 385, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 385, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 385, + 95 + ], + "score": 1.0, + "content": "A.6.2 CALCULATION OF CERTIFICATE FOR RENYI DIVERGENCE ´", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 101, + 312, + 114 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 312, + 116 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 196, + 116 + ], + "score": 1.0, + "content": "We consider the cases", + "type": "text" + }, + { + "bbox": [ + 196, + 102, + 222, + 113 + ], + "score": 0.91, + "content": "\\alpha \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 99, + 240, + 116 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 240, + 102, + 266, + 113 + ], + "score": 0.9, + "content": "\\alpha \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 99, + 312, + 116 + ], + "score": 1.0, + "content": "separately.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 99, + 312, + 116 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 124, + 506, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 123, + 507, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 138, + 138 + ], + "score": 1.0, + "content": "Case 1", + "type": "text" + }, + { + "bbox": [ + 139, + 126, + 167, + 137 + ], + "score": 0.78, + "content": "( \\alpha \\geq 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 123, + 187, + 138 + ], + "score": 1.0, + "content": ") If", + "type": "text" + }, + { + "bbox": [ + 187, + 126, + 213, + 136 + ], + "score": 0.9, + "content": "\\alpha \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 123, + 266, + 138 + ], + "score": 1.0, + "content": ", the function", + "type": "text" + }, + { + "bbox": [ + 267, + 125, + 336, + 137 + ], + "score": 0.92, + "content": "f ( u ) = \\left( u ^ { \\alpha } - 1 \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 123, + 439, + 138 + ], + "score": 1.0, + "content": "is a convex function with", + "type": "text" + }, + { + "bbox": [ + 439, + 125, + 477, + 137 + ], + "score": 0.92, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 123, + 507, + 138 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 136, + 142, + 148 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 142, + 148 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 123, + 507, + 148 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 156, + 150, + 455, + 215 + ], + "lines": [ + { + "bbox": [ + 156, + 150, + 455, + 215 + ], + "spans": [ + { + "bbox": [ + 156, + 150, + 455, + 215 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { f _ { \\lambda } ^ { * } ( u ) = \\underset { v \\geq 0 } { \\operatorname* { m a x } } u v - \\lambda ( v ^ { \\alpha } - 1 ) = \\{ \\lambda \\atop \\lambda + \\lambda ( \\alpha - 1 ) ( \\frac { u } { \\lambda \\alpha } ) ^ { \\frac { \\alpha } { \\alpha - 1 } } } \\quad \\quad \\mathrm { i f } u \\leq 0 \\\\ & { \\quad \\quad = \\lambda + \\lambda ( \\alpha - 1 ) ( \\frac { \\operatorname* { m a x } ( u , 0 ) } { \\lambda \\alpha } ) ^ { \\frac { \\alpha } { \\alpha - 1 } } \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "fece719ad8ff22ddd87d1f25d7f848321070fe7755f2cb7f75e0c8f371bfd2e2.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 156, + 150, + 455, + 171.66666666666666 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 156, + 171.66666666666666, + 455, + 193.33333333333331 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 156, + 193.33333333333331, + 455, + 214.99999999999997 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 218, + 505, + 244 + ], + "lines": [ + { + "bbox": [ + 105, + 217, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 217, + 322, + 233 + ], + "score": 1.0, + "content": "Suppose we have a bound on the Renyi divergence ´", + "type": "text" + }, + { + "bbox": [ + 323, + 219, + 381, + 231 + ], + "score": 0.92, + "content": "R _ { \\alpha } ( \\nu \\| \\rho ) \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 217, + 453, + 233 + ], + "score": 1.0, + "content": ". Then we know", + "type": "text" + }, + { + "bbox": [ + 454, + 219, + 505, + 232 + ], + "score": 0.92, + "content": "D _ { f } ( \\nu \\| \\rho ) \\leq", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 226, + 264, + 247 + ], + "spans": [ + { + "bbox": [ + 107, + 230, + 184, + 243 + ], + "score": 0.9, + "content": "\\mathrm { e x p } \\bar { ( } ( \\alpha - 1 ) \\epsilon ) - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 226, + 203, + 247 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 203, + 230, + 241, + 244 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\beta = \\frac { \\alpha } { \\alpha - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 226, + 264, + 247 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 217, + 505, + 247 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 248, + 469, + 265 + ], + "lines": [ + { + "bbox": [ + 141, + 248, + 469, + 265 + ], + "spans": [ + { + "bbox": [ + 141, + 248, + 469, + 265 + ], + "score": 0.89, + "content": "B = \\theta _ { a } ( \\operatorname* { m a x } ( 0 , \\kappa - 1 ) ) ^ { \\beta } + \\theta _ { b } ( \\operatorname* { m a x } ( 0 , \\kappa + 1 ) ) ^ { \\beta } + ( 1 - \\theta _ { a } - \\theta _ { b } ) ( \\operatorname* { m a x } ( 0 , \\kappa ) ) ^ { \\beta } \\ .", + "type": "interline_equation", + "image_path": "625f107169b1cb9503f90c2c5e2ac5ce50f92252a722c5b896f170690b2142d3.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 141, + 248, + 469, + 265 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 269, + 345, + 281 + ], + "lines": [ + { + "bbox": [ + 105, + 268, + 343, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 343, + 283 + ], + "score": 1.0, + "content": "Then the certificate Eq. 6 simplifies to (after some algebra)", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 268, + 343, + 283 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 286, + 402, + 312 + ], + "lines": [ + { + "bbox": [ + 208, + 286, + 402, + 312 + ], + "spans": [ + { + "bbox": [ + 208, + 286, + 402, + 312 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { \\lambda \\ge 0 , \\kappa } \\kappa - \\lambda \\exp ( ( \\alpha - 1 ) \\epsilon ) - B \\lambda ^ { 1 - \\beta } \\frac { ( \\alpha - 1 ) } { \\alpha ^ { \\beta } } .", + "type": "interline_equation", + "image_path": "80cf64ca28af5300158831e64e6d2781620576652433746e86f95c5776e3d16f.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 208, + 286, + 402, + 312 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 317, + 396, + 329 + ], + "lines": [ + { + "bbox": [ + 106, + 316, + 396, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 254, + 330 + ], + "score": 1.0, + "content": "Setting the derivative with respect to", + "type": "text" + }, + { + "bbox": [ + 255, + 318, + 262, + 327 + ], + "score": 0.84, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 316, + 273, + 330 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 273, + 318, + 279, + 327 + ], + "score": 0.26, + "content": "0", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 316, + 343, + 330 + ], + "score": 1.0, + "content": "and solving for", + "type": "text" + }, + { + "bbox": [ + 344, + 318, + 350, + 327 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 316, + 396, + 330 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 316, + 396, + 330 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 333, + 369, + 365 + ], + "lines": [ + { + "bbox": [ + 241, + 333, + 369, + 365 + ], + "spans": [ + { + "bbox": [ + 241, + 333, + 369, + 365 + ], + "score": 0.95, + "content": "\\lambda = \\frac { 1 } { \\alpha } \\left( \\frac { B } { \\exp ( ( \\alpha - 1 ) \\epsilon ) } \\right) ^ { \\left( \\frac { 1 } { \\beta } \\right) } \\ ,", + "type": "interline_equation", + "image_path": "e7fcec2bad074f8f9506d8354fa7372f3b2cd472f82858ac145871e5515719e6.jpg" + } + ] + } + ], + "index": 13.5, + "virtual_lines": [ + { + "bbox": [ + 241, + 333, + 369, + 349.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 241, + 349.0, + 369, + 365.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 370, + 256, + 381 + ], + "lines": [ + { + "bbox": [ + 106, + 369, + 255, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 255, + 382 + ], + "score": 1.0, + "content": "and the optimal certificate reduces to", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 106, + 369, + 255, + 382 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 253, + 385, + 358, + 414 + ], + "lines": [ + { + "bbox": [ + 253, + 385, + 358, + 414 + ], + "spans": [ + { + "bbox": [ + 253, + 385, + 358, + 414 + ], + "score": 0.94, + "content": "\\operatorname* { m a x } _ { \\kappa } \\kappa - B ^ { \\frac { 1 } { \\beta } } \\exp \\biggl ( \\frac { \\epsilon } { \\beta } \\biggr ) .", + "type": "interline_equation", + "image_path": "4b864a7a9fcf431e2e1b6744122dc09c30b6bcf219e1ba856b2f6af4c57837a5.jpg" + } + ] + } + ], + "index": 16.5, + "virtual_lines": [ + { + "bbox": [ + 253, + 385, + 358, + 399.5 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 253, + 399.5, + 358, + 414.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 417, + 327, + 429 + ], + "lines": [ + { + "bbox": [ + 106, + 417, + 327, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 417, + 284, + 430 + ], + "score": 1.0, + "content": "For this number to be positive, we need that", + "type": "text" + }, + { + "bbox": [ + 284, + 418, + 309, + 429 + ], + "score": 0.91, + "content": "\\kappa \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 417, + 327, + 430 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18, + "bbox_fs": [ + 106, + 417, + 327, + 430 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 266, + 433, + 345, + 462 + ], + "lines": [ + { + "bbox": [ + 266, + 433, + 345, + 462 + ], + "spans": [ + { + "bbox": [ + 266, + 433, + 345, + 462 + ], + "score": 0.94, + "content": "\\frac { \\kappa } { B ^ { \\frac { 1 } { \\beta } } } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) .", + "type": "interline_equation", + "image_path": "df14aeb5143b289a2ae1c8880593a0484492bb8a3e34c60bd8d5d79da5e71256.jpg" + } + ] + } + ], + "index": 19.5, + "virtual_lines": [ + { + "bbox": [ + 266, + 433, + 345, + 447.5 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 266, + 447.5, + 345, + 462.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 466, + 221, + 477 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 221, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 221, + 478 + ], + "score": 1.0, + "content": "The LHS above evaluates to", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 464, + 221, + 478 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 480, + 434, + 505 + ], + "lines": [ + { + "bbox": [ + 177, + 480, + 434, + 505 + ], + "spans": [ + { + "bbox": [ + 177, + 480, + 434, + 505 + ], + "score": 0.91, + "content": "\\Big ( \\theta _ { a } \\operatorname* { m a x } ( 0 , 1 - \\gamma ) ^ { \\beta } + \\theta _ { b } \\operatorname* { m a x } ( 0 , 1 + \\gamma ) ^ { \\beta } + 1 - \\theta _ { a } - \\theta _ { b } \\Big ) ^ { - \\frac { 1 } { \\beta } } \\ .", + "type": "interline_equation", + "image_path": "664920295df38b687a42e8c7673651e9afe561d64096b92b04316cd49030a8c7.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 177, + 480, + 434, + 505 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 510, + 409, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 410, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 132, + 525 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 510, + 178, + 524 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\gamma = \\frac { 1 } { \\kappa } \\geq 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 509, + 357, + 525 + ], + "score": 1.0, + "content": ". Maximizing this expression with respect to", + "type": "text" + }, + { + "bbox": [ + 357, + 514, + 364, + 523 + ], + "score": 0.81, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 509, + 410, + 525 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 509, + 410, + 525 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 262, + 528, + 348, + 558 + ], + "lines": [ + { + "bbox": [ + 262, + 528, + 348, + 558 + ], + "spans": [ + { + "bbox": [ + 262, + 528, + 348, + 558 + ], + "score": 0.94, + "content": "\\gamma = \\frac { \\theta _ { a } ^ { \\alpha - 1 } - \\theta _ { b } ^ { \\alpha - 1 } } { \\theta _ { a } ^ { \\alpha - 1 } + \\theta _ { b } ^ { \\alpha - 1 } } \\mathrm { ~ , ~ }", + "type": "interline_equation", + "image_path": "ea44b98a067ceecdd25c7ebb27011a53536a3d1ddc6eb36077a3352585832a86.jpg" + } + ] + } + ], + "index": 24.5, + "virtual_lines": [ + { + "bbox": [ + 262, + 528, + 348, + 543.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 262, + 543.0, + 348, + 558.0 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 563, + 235, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 563, + 235, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 235, + 574 + ], + "score": 1.0, + "content": "so that the certificate reduces to", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26, + "bbox_fs": [ + 106, + 563, + 235, + 574 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 577, + 442, + 609 + ], + "lines": [ + { + "bbox": [ + 169, + 577, + 442, + 609 + ], + "spans": [ + { + "bbox": [ + 169, + 577, + 442, + 609 + ], + "score": 0.94, + "content": "\\left( 2 ^ { \\beta } \\theta _ { a } \\theta _ { b } \\bigl ( \\theta _ { a } ^ { \\alpha - 1 } + \\theta _ { b } ^ { \\alpha - 1 } \\bigr ) ^ { \\left( - \\frac { 1 } { \\alpha - 1 } \\right) } + 1 - \\theta _ { a } - \\theta _ { b } \\right) ^ { \\left( \\frac { 1 } { \\beta } \\right) } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) \\ .", + "type": "interline_equation", + "image_path": "8ab5f597d4fc5f6e1d7e63049dfc86169b4fb803d36fad4b343b20538a73ddb2.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 169, + 577, + 442, + 587.6666666666666 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 169, + 587.6666666666666, + 442, + 598.3333333333333 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 169, + 598.3333333333333, + 442, + 608.9999999999999 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 613, + 264, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 613, + 265, + 626 + ], + "spans": [ + { + "bbox": [ + 106, + 613, + 265, + 626 + ], + "score": 1.0, + "content": "Taking logarithms now gives the result.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 613, + 265, + 626 + ] + }, + { + "type": "text", + "bbox": [ + 103, + 636, + 505, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 140, + 650 + ], + "score": 1.0, + "content": "Case 2", + "type": "text" + }, + { + "bbox": [ + 141, + 637, + 188, + 648 + ], + "score": 0.8, + "content": "0 \\leq \\alpha \\leq 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 188, + 635, + 225, + 650 + ], + "score": 1.0, + "content": ") When", + "type": "text" + }, + { + "bbox": [ + 226, + 637, + 271, + 648 + ], + "score": 0.9, + "content": "0 \\leq \\alpha \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 635, + 327, + 650 + ], + "score": 1.0, + "content": ", the function", + "type": "text" + }, + { + "bbox": [ + 327, + 637, + 398, + 649 + ], + "score": 0.95, + "content": "f ( u ) = \\left( 1 - u ^ { \\alpha } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 635, + 505, + 650 + ], + "score": 1.0, + "content": "is a convex function with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 107, + 647, + 210, + 660 + ], + "spans": [ + { + "bbox": [ + 107, + 648, + 145, + 660 + ], + "score": 0.92, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 647, + 210, + 660 + ], + "score": 1.0, + "content": ". Then, we have", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 635, + 505, + 660 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 136, + 664, + 470, + 698 + ], + "lines": [ + { + "bbox": [ + 136, + 664, + 470, + 698 + ], + "spans": [ + { + "bbox": [ + 136, + 664, + 470, + 698 + ], + "score": 0.93, + "content": "f _ { \\lambda } ^ { * } ( u ) = \\operatorname* { m a x } _ { v \\geq 0 } u v - \\lambda ( 1 - v ^ { \\alpha } ) = \\left\\{ \\begin{array} { l l } { - \\lambda + \\lambda ^ { \\frac { 1 } { 1 - \\alpha } } ( 1 - \\alpha ) { \\left( \\frac { - u } { \\alpha } \\right) } ^ { \\left( - \\frac { \\alpha } { 1 - \\alpha } \\right) } } & { \\mathrm { ~ i f ~ } u \\leq 0 } \\\\ { \\infty } & { \\mathrm { ~ o t h e r w i s e ~ . } } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "2a749e47bcbe8c72b42cd5a7f37693a59ddafa0c99b66fb0e12a752f5f58b7ac.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 136, + 664, + 470, + 675.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 136, + 675.3333333333334, + 470, + 686.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 136, + 686.6666666666667, + 470, + 698.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 702, + 263, + 715 + ], + "lines": [ + { + "bbox": [ + 106, + 702, + 263, + 716 + ], + "spans": [ + { + "bbox": [ + 106, + 702, + 174, + 716 + ], + "score": 1.0, + "content": "Further, a bound", + "type": "text" + }, + { + "bbox": [ + 175, + 703, + 230, + 715 + ], + "score": 0.93, + "content": "R _ { \\alpha } ( \\nu \\| \\rho ) \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 702, + 263, + 716 + ], + "score": 1.0, + "content": "implies", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36, + "bbox_fs": [ + 106, + 702, + 263, + 716 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 237, + 719, + 373, + 734 + ], + "lines": [ + { + "bbox": [ + 237, + 719, + 373, + 734 + ], + "spans": [ + { + "bbox": [ + 237, + 719, + 373, + 734 + ], + "score": 0.9, + "content": "D _ { f } ( \\nu \\vert \\vert \\rho ) \\leq 1 - \\exp ( ( \\alpha - 1 ) \\epsilon ) .", + "type": "interline_equation", + "image_path": "d988e02e31c61f1ea5e1970fbd2eb6566aa88362dad7e3afffb1178887c30df5.jpg" + } + ] + } + ], + "index": 37, + "virtual_lines": [ + { + "bbox": [ + 237, + 719, + 373, + 734 + ], + "spans": [], + "index": 37 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 274, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 274, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 274, + 96 + ], + "score": 1.0, + "content": "Then the certificate from Eq. 6 reduces to", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 100, + 514, + 122 + ], + "lines": [ + { + "bbox": [ + 111, + 100, + 514, + 122 + ], + "spans": [ + { + "bbox": [ + 111, + 100, + 514, + 122 + ], + "score": 0.86, + "content": "\\operatorname* { m a x } _ { \\cdot , \\lambda \\geq 0 } \\kappa + \\lambda \\exp ( ( \\alpha - 1 ) \\epsilon ) - ( 1 - \\alpha ) \\lambda ^ { \\frac { 1 } { 1 - \\alpha } } \\alpha ^ { \\frac { \\alpha } { 1 - \\alpha } } \\Big ( \\theta _ { a } ( 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { b } ( - 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { c } ( - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } \\Big )", + "type": "interline_equation", + "image_path": "089233e1c654506bb3809b68a020167c88b07ac93cf2cb59fae093647ee978eb.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 111, + 100, + 514, + 122 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 129, + 509, + 153 + ], + "lines": [ + { + "bbox": [ + 105, + 129, + 504, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 129, + 181, + 142 + ], + "score": 1.0, + "content": "with the constraint", + "type": "text" + }, + { + "bbox": [ + 182, + 131, + 215, + 141 + ], + "score": 0.91, + "content": "\\kappa \\leq - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 129, + 324, + 142 + ], + "score": 1.0, + "content": "(otherwise the certificate is", + "type": "text" + }, + { + "bbox": [ + 325, + 131, + 344, + 141 + ], + "score": 0.83, + "content": "- \\infty ,", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 129, + 497, + 142 + ], + "score": 1.0, + "content": "). Setting the derivative with respect to", + "type": "text" + }, + { + "bbox": [ + 497, + 131, + 504, + 140 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 141, + 239, + 153 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 187, + 153 + ], + "score": 1.0, + "content": "to 0 and solving for", + "type": "text" + }, + { + "bbox": [ + 187, + 142, + 194, + 151 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 141, + 239, + 153 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 158, + 364, + 185 + ], + "lines": [ + { + "bbox": [ + 246, + 158, + 364, + 185 + ], + "spans": [ + { + "bbox": [ + 246, + 158, + 364, + 185 + ], + "score": 0.93, + "content": "\\lambda = \\frac { \\exp \\big ( ( \\alpha - 1 ) \\epsilon \\big ( \\frac { 1 - \\alpha } { \\alpha } \\big ) \\big ) } { \\alpha \\omega } \\mathrm { ~ , ~ }", + "type": "interline_equation", + "image_path": "9655fc26855442653c9e22fc286189a0043f5d485e474c81f313bae525d55a7f.jpg" + } + ] + } + ], + "index": 4.5, + "virtual_lines": [ + { + "bbox": [ + 246, + 158, + 364, + 171.5 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 246, + 171.5, + 364, + 185.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 191, + 133, + 202 + ], + "lines": [ + { + "bbox": [ + 105, + 189, + 135, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 135, + 203 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 200, + 443, + 226 + ], + "lines": [ + { + "bbox": [ + 168, + 200, + 443, + 226 + ], + "spans": [ + { + "bbox": [ + 168, + 200, + 443, + 226 + ], + "score": 0.89, + "content": "\\omega = \\left( \\theta _ { a } ( 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { b } ( - 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { c } ( - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } \\right) ^ { \\left( \\frac { 1 - \\alpha } { \\alpha } \\right) } \\ .", + "type": "interline_equation", + "image_path": "d7b7b99f68b7d80f9e369d5e3baf3e58bdb01f2ea5ba71daa6781a85477fd1f0.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 168, + 200, + 443, + 226 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 229, + 388, + 242 + ], + "lines": [ + { + "bbox": [ + 304, + 230, + 342, + 243 + ], + "spans": [ + { + "bbox": [ + 304, + 230, + 342, + 243 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\beta = \\frac { \\alpha } { 1 - \\alpha } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 268, + 249, + 342, + 282 + ], + "lines": [ + { + "bbox": [ + 268, + 249, + 342, + 282 + ], + "spans": [ + { + "bbox": [ + 268, + 249, + 342, + 282 + ], + "score": 0.92, + "content": "\\kappa + \\frac { \\exp \\Bigl ( - \\frac { \\epsilon } { \\beta } \\Bigr ) } { \\omega } \\ .", + "type": "interline_equation", + "image_path": "bab086f508e15a6614676d8da8d6489bf66478778856c5acc763c5bfe231f3ec.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 268, + 249, + 342, + 265.5 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 268, + 265.5, + 342, + 282.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 287, + 293, + 299 + ], + "lines": [ + { + "bbox": [ + 105, + 286, + 293, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 293, + 300 + ], + "score": 1.0, + "content": "For this number to be positive, we require that", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 262, + 304, + 348, + 333 + ], + "lines": [ + { + "bbox": [ + 262, + 304, + 348, + 333 + ], + "spans": [ + { + "bbox": [ + 262, + 304, + 348, + 333 + ], + "score": 0.94, + "content": "\\frac { 1 } { \\not { p } - \\kappa \\omega } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) .", + "type": "interline_equation", + "image_path": "366d36c82991595efc8022c46e3c8300f3f0b0eab38b8c065d0d02afcd3d99b4.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 262, + 304, + 348, + 318.5 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 262, + 318.5, + 348, + 333.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 338, + 291, + 349 + ], + "lines": [ + { + "bbox": [ + 105, + 337, + 291, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 291, + 351 + ], + "score": 1.0, + "content": "The LHS of the above expression evaluates to", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 356, + 420, + 382 + ], + "lines": [ + { + "bbox": [ + 191, + 356, + 420, + 382 + ], + "spans": [ + { + "bbox": [ + 191, + 356, + 420, + 382 + ], + "score": 0.92, + "content": "\\left( \\theta _ { a } \\bigl ( 1 + \\gamma \\bigr ) ^ { ( - \\beta ) } + \\theta _ { b } \\bigl ( 1 - \\gamma \\bigr ) ^ { ( - \\beta ) } + 1 - \\theta _ { a } - \\theta _ { b } \\right) ^ { \\left( \\frac { - 1 } { \\beta } \\right) } \\ ,", + "type": "interline_equation", + "image_path": "74f87d563e1b2f6b0c942aeae4da7cfd91f1b0ea2a77a68b4a7a2f50564e66f0.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 191, + 356, + 420, + 382 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 388, + 489, + 402 + ], + "lines": [ + { + "bbox": [ + 102, + 385, + 492, + 408 + ], + "spans": [ + { + "bbox": [ + 102, + 385, + 133, + 408 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 388, + 168, + 402 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\gamma = - \\frac { 1 } { \\kappa } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 385, + 305, + 408 + ], + "score": 1.0, + "content": ". Maximizing this expression over", + "type": "text" + }, + { + "bbox": [ + 305, + 389, + 344, + 401 + ], + "score": 0.92, + "content": "\\gamma \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 385, + 492, + 408 + ], + "score": 1.0, + "content": ", we obtain the final certificate to be", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 407, + 436, + 452 + ], + "lines": [ + { + "bbox": [ + 175, + 407, + 436, + 452 + ], + "spans": [ + { + "bbox": [ + 175, + 407, + 436, + 452 + ], + "score": 0.94, + "content": "\\left( 1 - \\theta _ { a } - \\theta _ { b } + 2 \\left( \\frac { \\theta _ { a } ^ { 1 - \\alpha } + \\theta _ { b } ^ { 1 - \\alpha } } { 2 } \\right) ^ { \\left( \\frac { 1 } { 1 - \\alpha } \\right) } \\right) ^ { \\left( - \\frac { 1 } { \\beta } \\right) } \\ge \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) \\ .", + "type": "interline_equation", + "image_path": "a5f7a1a3df4b06b8cc665fd822f252ac49c35a54cfa589a63e2b6709b932fa75.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 175, + 407, + 436, + 422.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 175, + 422.0, + 436, + 437.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 175, + 437.0, + 436, + 452.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 457, + 225, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 456, + 225, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 225, + 471 + ], + "score": 1.0, + "content": "Taking logarithms, we obtain", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 475, + 419, + 515 + ], + "lines": [ + { + "bbox": [ + 192, + 475, + 419, + 515 + ], + "spans": [ + { + "bbox": [ + 192, + 475, + 419, + 515 + ], + "score": 0.93, + "content": "\\epsilon \\leq - \\log \\left( 1 - \\theta _ { a } - \\theta _ { b } + 2 \\bigg ( \\frac { \\theta _ { a } ^ { 1 - \\alpha } + \\theta _ { b } ^ { 1 - \\alpha } } { 2 } \\bigg ) ^ { \\left( \\frac { 1 } { 1 - \\alpha } \\right) } \\right) \\ .", + "type": "interline_equation", + "image_path": "2dff26f61667701e3b7cb9427d8dfe89722c532ffd0ff3e07121c8c948d460d1.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 192, + 475, + 419, + 488.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 192, + 488.3333333333333, + 419, + 501.66666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 192, + 501.66666666666663, + 419, + 515.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 527, + 452, + 540 + ], + "lines": [ + { + "bbox": [ + 106, + 527, + 452, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 452, + 540 + ], + "score": 1.0, + "content": "A.7 INFORMATION-LIMITED ROBUST CERTIFICATION AND TIGHT RELAXATIONS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "title", + "bbox": [ + 107, + 548, + 238, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 548, + 239, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 239, + 561 + ], + "score": 1.0, + "content": "A.7.1 PROOF OF THEOREM 4", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 568, + 506, + 613 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 580 + ], + "score": 1.0, + "content": "At a high level, the proof shows that, in the information-limited case, to achieve robust certification", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 255, + 591 + ], + "score": 1.0, + "content": "under an arbitrary set of constraints", + "type": "text" + }, + { + "bbox": [ + 255, + 580, + 264, + 589 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 579, + 418, + 591 + ], + "score": 1.0, + "content": "it suffices to know the “envelope” of", + "type": "text" + }, + { + "bbox": [ + 419, + 580, + 428, + 589 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "with respect to all", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 104, + 590, + 246, + 603 + ], + "score": 1.0, + "content": "hockey-stick divergences of order", + "type": "text" + }, + { + "bbox": [ + 247, + 591, + 273, + 602 + ], + "score": 0.9, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 590, + 344, + 603 + ], + "score": 1.0, + "content": ", i.e. the function", + "type": "text" + }, + { + "bbox": [ + 344, + 591, + 454, + 603 + ], + "score": 0.91, + "content": "\\beta \\mapsto \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "captures all", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 601, + 487, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 474, + 614 + ], + "score": 1.0, + "content": "the necessary information to provide information-limited robust certification with respect to", + "type": "text" + }, + { + "bbox": [ + 475, + 603, + 483, + 611 + ], + "score": 0.84, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 601, + 487, + 614 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 618, + 349, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 617, + 349, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 349, + 632 + ], + "score": 1.0, + "content": "We start by considering the following optimization problem:", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 635, + 403, + 698 + ], + "lines": [ + { + "bbox": [ + 207, + 635, + 403, + 698 + ], + "spans": [ + { + "bbox": [ + 207, + 635, + 403, + 698 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { \\underset { \\Psi : \\mathcal { X } \\mapsto \\{ - 1 , 0 , + 1 \\} , \\nu \\in \\mathcal { D } } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } [ \\Psi ( X ) ] } & { } \\\\ { \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } [ 1 [ \\Psi ( X ) = + 1 ] ] \\geq \\theta _ { a } } & { , } \\\\ { \\underset { X \\sim \\rho } { \\mathrm { E } } [ 1 [ \\Psi ( X ) = - 1 ] ] \\leq \\theta _ { b } } & { . } \\end{array}", + "type": "interline_equation", + "image_path": "32e9f9c7f47689eac9b122ebb32fa01cec13b7454977abf6090187412a18bc6f.jpg" + } + ] + } + ], + "index": 32.5, + "virtual_lines": [ + { + "bbox": [ + 207, + 635, + 403, + 650.75 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 207, + 650.75, + 403, + 666.5 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 207, + 666.5, + 403, + 682.25 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 207, + 682.25, + 403, + 698.0 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 507, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 475, + 722 + ], + "score": 1.0, + "content": "In the information-limited setting, this problem attains the minimum expected value over", + "type": "text" + }, + { + "bbox": [ + 475, + 710, + 503, + 721 + ], + "score": 0.94, + "content": "\\phi \\in S", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 708, + 507, + 722 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 720, + 307, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 128, + 733 + ], + "score": 1.0, + "content": "Here", + "type": "text" + }, + { + "bbox": [ + 129, + 720, + 181, + 732 + ], + "score": 0.91, + "content": "1 [ \\phi ( X ) = 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 720, + 307, + 733 + ], + "score": 1.0, + "content": "denotes the indicator function.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + } + ], + "page_idx": 17, + "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 2020", + "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": "text", + "bbox": [ + 107, + 82, + 274, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 274, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 274, + 96 + ], + "score": 1.0, + "content": "Then the certificate from Eq. 6 reduces to", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 80, + 274, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 100, + 514, + 122 + ], + "lines": [ + { + "bbox": [ + 111, + 100, + 514, + 122 + ], + "spans": [ + { + "bbox": [ + 111, + 100, + 514, + 122 + ], + "score": 0.86, + "content": "\\operatorname* { m a x } _ { \\cdot , \\lambda \\geq 0 } \\kappa + \\lambda \\exp ( ( \\alpha - 1 ) \\epsilon ) - ( 1 - \\alpha ) \\lambda ^ { \\frac { 1 } { 1 - \\alpha } } \\alpha ^ { \\frac { \\alpha } { 1 - \\alpha } } \\Big ( \\theta _ { a } ( 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { b } ( - 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { c } ( - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } \\Big )", + "type": "interline_equation", + "image_path": "089233e1c654506bb3809b68a020167c88b07ac93cf2cb59fae093647ee978eb.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 111, + 100, + 514, + 122 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 129, + 509, + 153 + ], + "lines": [ + { + "bbox": [ + 105, + 129, + 504, + 142 + ], + "spans": [ + { + "bbox": [ + 105, + 129, + 181, + 142 + ], + "score": 1.0, + "content": "with the constraint", + "type": "text" + }, + { + "bbox": [ + 182, + 131, + 215, + 141 + ], + "score": 0.91, + "content": "\\kappa \\leq - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 129, + 324, + 142 + ], + "score": 1.0, + "content": "(otherwise the certificate is", + "type": "text" + }, + { + "bbox": [ + 325, + 131, + 344, + 141 + ], + "score": 0.83, + "content": "- \\infty ,", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 129, + 497, + 142 + ], + "score": 1.0, + "content": "). Setting the derivative with respect to", + "type": "text" + }, + { + "bbox": [ + 497, + 131, + 504, + 140 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 141, + 239, + 153 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 187, + 153 + ], + "score": 1.0, + "content": "to 0 and solving for", + "type": "text" + }, + { + "bbox": [ + 187, + 142, + 194, + 151 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 141, + 239, + 153 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 129, + 504, + 153 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 158, + 364, + 185 + ], + "lines": [ + { + "bbox": [ + 246, + 158, + 364, + 185 + ], + "spans": [ + { + "bbox": [ + 246, + 158, + 364, + 185 + ], + "score": 0.93, + "content": "\\lambda = \\frac { \\exp \\big ( ( \\alpha - 1 ) \\epsilon \\big ( \\frac { 1 - \\alpha } { \\alpha } \\big ) \\big ) } { \\alpha \\omega } \\mathrm { ~ , ~ }", + "type": "interline_equation", + "image_path": "9655fc26855442653c9e22fc286189a0043f5d485e474c81f313bae525d55a7f.jpg" + } + ] + } + ], + "index": 4.5, + "virtual_lines": [ + { + "bbox": [ + 246, + 158, + 364, + 171.5 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 246, + 171.5, + 364, + 185.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 191, + 133, + 202 + ], + "lines": [ + { + "bbox": [ + 105, + 189, + 135, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 135, + 203 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 189, + 135, + 203 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 200, + 443, + 226 + ], + "lines": [ + { + "bbox": [ + 168, + 200, + 443, + 226 + ], + "spans": [ + { + "bbox": [ + 168, + 200, + 443, + 226 + ], + "score": 0.89, + "content": "\\omega = \\left( \\theta _ { a } ( 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { b } ( - 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { c } ( - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } \\right) ^ { \\left( \\frac { 1 - \\alpha } { \\alpha } \\right) } \\ .", + "type": "interline_equation", + "image_path": "d7b7b99f68b7d80f9e369d5e3baf3e58bdb01f2ea5ba71daa6781a85477fd1f0.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 168, + 200, + 443, + 226 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 229, + 388, + 242 + ], + "lines": [ + { + "bbox": [ + 304, + 230, + 342, + 243 + ], + "spans": [ + { + "bbox": [ + 304, + 230, + 342, + 243 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\beta = \\frac { \\alpha } { 1 - \\alpha } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 304, + 230, + 342, + 243 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 268, + 249, + 342, + 282 + ], + "lines": [ + { + "bbox": [ + 268, + 249, + 342, + 282 + ], + "spans": [ + { + "bbox": [ + 268, + 249, + 342, + 282 + ], + "score": 0.92, + "content": "\\kappa + \\frac { \\exp \\Bigl ( - \\frac { \\epsilon } { \\beta } \\Bigr ) } { \\omega } \\ .", + "type": "interline_equation", + "image_path": "bab086f508e15a6614676d8da8d6489bf66478778856c5acc763c5bfe231f3ec.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 268, + 249, + 342, + 265.5 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 268, + 265.5, + 342, + 282.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 287, + 293, + 299 + ], + "lines": [ + { + "bbox": [ + 105, + 286, + 293, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 293, + 300 + ], + "score": 1.0, + "content": "For this number to be positive, we require that", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 286, + 293, + 300 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 262, + 304, + 348, + 333 + ], + "lines": [ + { + "bbox": [ + 262, + 304, + 348, + 333 + ], + "spans": [ + { + "bbox": [ + 262, + 304, + 348, + 333 + ], + "score": 0.94, + "content": "\\frac { 1 } { \\not { p } - \\kappa \\omega } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) .", + "type": "interline_equation", + "image_path": "366d36c82991595efc8022c46e3c8300f3f0b0eab38b8c065d0d02afcd3d99b4.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 262, + 304, + 348, + 318.5 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 262, + 318.5, + 348, + 333.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 338, + 291, + 349 + ], + "lines": [ + { + "bbox": [ + 105, + 337, + 291, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 291, + 351 + ], + "score": 1.0, + "content": "The LHS of the above expression evaluates to", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 337, + 291, + 351 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 356, + 420, + 382 + ], + "lines": [ + { + "bbox": [ + 191, + 356, + 420, + 382 + ], + "spans": [ + { + "bbox": [ + 191, + 356, + 420, + 382 + ], + "score": 0.92, + "content": "\\left( \\theta _ { a } \\bigl ( 1 + \\gamma \\bigr ) ^ { ( - \\beta ) } + \\theta _ { b } \\bigl ( 1 - \\gamma \\bigr ) ^ { ( - \\beta ) } + 1 - \\theta _ { a } - \\theta _ { b } \\right) ^ { \\left( \\frac { - 1 } { \\beta } \\right) } \\ ,", + "type": "interline_equation", + "image_path": "74f87d563e1b2f6b0c942aeae4da7cfd91f1b0ea2a77a68b4a7a2f50564e66f0.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 191, + 356, + 420, + 382 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 103, + 388, + 489, + 402 + ], + "lines": [ + { + "bbox": [ + 102, + 385, + 492, + 408 + ], + "spans": [ + { + "bbox": [ + 102, + 385, + 133, + 408 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 388, + 168, + 402 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\gamma = - \\frac { 1 } { \\kappa } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 385, + 305, + 408 + ], + "score": 1.0, + "content": ". Maximizing this expression over", + "type": "text" + }, + { + "bbox": [ + 305, + 389, + 344, + 401 + ], + "score": 0.92, + "content": "\\gamma \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 385, + 492, + 408 + ], + "score": 1.0, + "content": ", we obtain the final certificate to be", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 102, + 385, + 492, + 408 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 407, + 436, + 452 + ], + "lines": [ + { + "bbox": [ + 175, + 407, + 436, + 452 + ], + "spans": [ + { + "bbox": [ + 175, + 407, + 436, + 452 + ], + "score": 0.94, + "content": "\\left( 1 - \\theta _ { a } - \\theta _ { b } + 2 \\left( \\frac { \\theta _ { a } ^ { 1 - \\alpha } + \\theta _ { b } ^ { 1 - \\alpha } } { 2 } \\right) ^ { \\left( \\frac { 1 } { 1 - \\alpha } \\right) } \\right) ^ { \\left( - \\frac { 1 } { \\beta } \\right) } \\ge \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) \\ .", + "type": "interline_equation", + "image_path": "a5f7a1a3df4b06b8cc665fd822f252ac49c35a54cfa589a63e2b6709b932fa75.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 175, + 407, + 436, + 422.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 175, + 422.0, + 436, + 437.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 175, + 437.0, + 436, + 452.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 457, + 225, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 456, + 225, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 225, + 471 + ], + "score": 1.0, + "content": "Taking logarithms, we obtain", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 456, + 225, + 471 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 475, + 419, + 515 + ], + "lines": [ + { + "bbox": [ + 192, + 475, + 419, + 515 + ], + "spans": [ + { + "bbox": [ + 192, + 475, + 419, + 515 + ], + "score": 0.93, + "content": "\\epsilon \\leq - \\log \\left( 1 - \\theta _ { a } - \\theta _ { b } + 2 \\bigg ( \\frac { \\theta _ { a } ^ { 1 - \\alpha } + \\theta _ { b } ^ { 1 - \\alpha } } { 2 } \\bigg ) ^ { \\left( \\frac { 1 } { 1 - \\alpha } \\right) } \\right) \\ .", + "type": "interline_equation", + "image_path": "2dff26f61667701e3b7cb9427d8dfe89722c532ffd0ff3e07121c8c948d460d1.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 192, + 475, + 419, + 488.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 192, + 488.3333333333333, + 419, + 501.66666666666663 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 192, + 501.66666666666663, + 419, + 515.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 527, + 452, + 540 + ], + "lines": [ + { + "bbox": [ + 106, + 527, + 452, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 452, + 540 + ], + "score": 1.0, + "content": "A.7 INFORMATION-LIMITED ROBUST CERTIFICATION AND TIGHT RELAXATIONS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 106, + 527, + 452, + 540 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 548, + 238, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 548, + 239, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 548, + 239, + 561 + ], + "score": 1.0, + "content": "A.7.1 PROOF OF THEOREM 4", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 568, + 506, + 613 + ], + "lines": [ + { + "bbox": [ + 106, + 569, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 505, + 580 + ], + "score": 1.0, + "content": "At a high level, the proof shows that, in the information-limited case, to achieve robust certification", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 579, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 255, + 591 + ], + "score": 1.0, + "content": "under an arbitrary set of constraints", + "type": "text" + }, + { + "bbox": [ + 255, + 580, + 264, + 589 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 579, + 418, + 591 + ], + "score": 1.0, + "content": "it suffices to know the “envelope” of", + "type": "text" + }, + { + "bbox": [ + 419, + 580, + 428, + 589 + ], + "score": 0.82, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 579, + 505, + 591 + ], + "score": 1.0, + "content": "with respect to all", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 104, + 590, + 246, + 603 + ], + "score": 1.0, + "content": "hockey-stick divergences of order", + "type": "text" + }, + { + "bbox": [ + 247, + 591, + 273, + 602 + ], + "score": 0.9, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 590, + 344, + 603 + ], + "score": 1.0, + "content": ", i.e. the function", + "type": "text" + }, + { + "bbox": [ + 344, + 591, + 454, + 603 + ], + "score": 0.91, + "content": "\\beta \\mapsto \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "captures all", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 601, + 487, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 474, + 614 + ], + "score": 1.0, + "content": "the necessary information to provide information-limited robust certification with respect to", + "type": "text" + }, + { + "bbox": [ + 475, + 603, + 483, + 611 + ], + "score": 0.84, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 601, + 487, + 614 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5, + "bbox_fs": [ + 104, + 569, + 506, + 614 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 618, + 349, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 617, + 349, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 349, + 632 + ], + "score": 1.0, + "content": "We start by considering the following optimization problem:", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 617, + 349, + 632 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 207, + 635, + 403, + 698 + ], + "lines": [ + { + "bbox": [ + 207, + 635, + 403, + 698 + ], + "spans": [ + { + "bbox": [ + 207, + 635, + 403, + 698 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { \\underset { \\Psi : \\mathcal { X } \\mapsto \\{ - 1 , 0 , + 1 \\} , \\nu \\in \\mathcal { D } } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } [ \\Psi ( X ) ] } & { } \\\\ { \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } [ 1 [ \\Psi ( X ) = + 1 ] ] \\geq \\theta _ { a } } & { , } \\\\ { \\underset { X \\sim \\rho } { \\mathrm { E } } [ 1 [ \\Psi ( X ) = - 1 ] ] \\leq \\theta _ { b } } & { . } \\end{array}", + "type": "interline_equation", + "image_path": "32e9f9c7f47689eac9b122ebb32fa01cec13b7454977abf6090187412a18bc6f.jpg" + } + ] + } + ], + "index": 32.5, + "virtual_lines": [ + { + "bbox": [ + 207, + 635, + 403, + 650.75 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 207, + 650.75, + 403, + 666.5 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 207, + 666.5, + 403, + 682.25 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 207, + 682.25, + 403, + 698.0 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "list", + "bbox": [ + 106, + 709, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 507, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 475, + 722 + ], + "score": 1.0, + "content": "In the information-limited setting, this problem attains the minimum expected value over", + "type": "text" + }, + { + "bbox": [ + 475, + 710, + 503, + 721 + ], + "score": 0.94, + "content": "\\phi \\in S", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 708, + 507, + 722 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 720, + 307, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 128, + 733 + ], + "score": 1.0, + "content": "Here", + "type": "text" + }, + { + "bbox": [ + 129, + 720, + 181, + 732 + ], + "score": 0.91, + "content": "1 [ \\phi ( X ) = 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 720, + 307, + 733 + ], + "score": 1.0, + "content": "denotes the indicator function.", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 708, + 507, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 495, + 95 + ], + "score": 1.0, + "content": "It will be convenient to write this in a slightly different form: Rather than looking at the outputs of", + "type": "text" + }, + { + "bbox": [ + 496, + 83, + 504, + 92 + ], + "score": 0.76, + "content": "\\Psi", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 313, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 132, + 105 + ], + "score": 1.0, + "content": "as the", + "type": "text" + }, + { + "bbox": [ + 132, + 94, + 172, + 105 + ], + "score": 0.91, + "content": "+ 1 , 0 , - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 93, + 294, + 105 + ], + "score": 1.0, + "content": ", we look at them as vectors in", + "type": "text" + }, + { + "bbox": [ + 295, + 93, + 307, + 104 + ], + "score": 0.89, + "content": "\\mathbb { R } ^ { 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 93, + 313, + 105 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 248, + 108, + 363, + 143 + ], + "lines": [ + { + "bbox": [ + 248, + 108, + 363, + 143 + ], + "spans": [ + { + "bbox": [ + 248, + 108, + 363, + 143 + ], + "score": 0.94, + "content": "\\mathcal { Z } = \\left\\{ \\left( 0 \\atop 0 \\right) , \\left( 1 \\atop 0 \\right) , \\left( 0 \\atop 1 \\right) \\right\\}", + "type": "interline_equation", + "image_path": "b010e1378b1c9974e20c57a2772b52ab17f4f78939d52e5156c6bc00c264fea2.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 248, + 108, + 363, + 125.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 248, + 125.5, + 363, + 143.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 146, + 150, + 157 + ], + "lines": [ + { + "bbox": [ + 106, + 145, + 151, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 151, + 158 + ], + "score": 1.0, + "content": "and define", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 158, + 402, + 193 + ], + "lines": [ + { + "bbox": [ + 208, + 158, + 402, + 193 + ], + "spans": [ + { + "bbox": [ + 208, + 158, + 402, + 193 + ], + "score": 0.93, + "content": "{ \\bf a } = \\left( \\begin{array} { l } { { 1 } } \\\\ { { 0 } } \\\\ { { - 1 } } \\end{array} \\right) , { \\bf a } _ { + } = \\left( \\begin{array} { l } { { 1 } } \\\\ { { 0 } } \\\\ { { 0 } } \\end{array} \\right) , { \\bf a } _ { - } = \\left( \\begin{array} { l } { { 0 } } \\\\ { { 0 } } \\\\ { { 1 } } \\end{array} \\right) .", + "type": "interline_equation", + "image_path": "cd6d0153778eac2b289b9db9a661934550408533925de045754b8470a577ef56.jpg" + } + ] + } + ], + "index": 5.5, + "virtual_lines": [ + { + "bbox": [ + 208, + 158, + 402, + 175.5 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 208, + 175.5, + 402, + 193.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 196, + 378, + 208 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 379, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 379, + 211 + ], + "score": 1.0, + "content": "Then, we can write the optimization problem Eq. 12 equivalently as", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 210, + 381, + 276 + ], + "lines": [ + { + "bbox": [ + 230, + 210, + 381, + 276 + ], + "spans": [ + { + "bbox": [ + 230, + 210, + 381, + 276 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\underset { \\Psi : \\mathcal { X } \\mapsto \\mathcal { Z } , \\nu \\in \\mathcal { D } } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } \\big [ \\mathbf { a } ^ { T } \\Psi ( X ) \\big ] } \\\\ & { \\quad \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { + } { } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } ~ , } \\\\ & { \\qquad \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { - } { } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } ~ . } \\end{array}", + "type": "interline_equation", + "image_path": "c5199a36b9c02cb105cff79d51922fdd844543c1ea3bd1e62e451654ad03df34.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 230, + 210, + 381, + 243.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 230, + 243.0, + 381, + 276.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 282, + 505, + 338 + ], + "lines": [ + { + "bbox": [ + 106, + 283, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 262, + 295 + ], + "score": 1.0, + "content": "We first consider the minimization over", + "type": "text" + }, + { + "bbox": [ + 263, + 284, + 271, + 293 + ], + "score": 0.85, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 283, + 348, + 295 + ], + "score": 1.0, + "content": "for a fixed value of", + "type": "text" + }, + { + "bbox": [ + 348, + 285, + 355, + 293 + ], + "score": 0.76, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 283, + 505, + 295 + ], + "score": 1.0, + "content": ". We begin by observing that since the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 265, + 306 + ], + "score": 1.0, + "content": "objective is linear, the optimization over", + "type": "text" + }, + { + "bbox": [ + 266, + 295, + 274, + 304 + ], + "score": 0.83, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "can be replaced with the optimization over the convex hull", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 304, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 157, + 318 + ], + "score": 1.0, + "content": "of the set of", + "type": "text" + }, + { + "bbox": [ + 157, + 306, + 166, + 315 + ], + "score": 0.83, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 304, + 413, + 318 + ], + "score": 1.0, + "content": "that satisfy the constraints (Bubeck, 2013). Since each input", + "type": "text" + }, + { + "bbox": [ + 413, + 306, + 441, + 316 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 304, + 506, + 318 + ], + "score": 1.0, + "content": "can be mapped", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 315, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 484, + 329 + ], + "score": 1.0, + "content": "independently of the rest, the convex hull is simply the cross product of the convex hull at every", + "type": "text" + }, + { + "bbox": [ + 484, + 318, + 491, + 326 + ], + "score": 0.74, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 315, + 506, + 329 + ], + "score": 1.0, + "content": ", to", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 326, + 205, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 205, + 339 + ], + "score": 1.0, + "content": "obtain the constraint set", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 152, + 339, + 459, + 366 + ], + "lines": [ + { + "bbox": [ + 152, + 339, + 459, + 366 + ], + "spans": [ + { + "bbox": [ + 152, + 339, + 459, + 366 + ], + "score": 0.87, + "content": "\\left\\{ \\Psi : \\mathcal { X } \\mapsto \\mathcal { P } ( \\mathcal { Z } ) \\mathrm { ~ s u c h ~ t h a t ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { + } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } , \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { - } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } \\right\\} \\ .", + "type": "interline_equation", + "image_path": "dad715d8a56b8b3b84c450f73c083343d6cc83c9cdfff8910bc81cae8eba9fd4.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 152, + 339, + 459, + 366 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 369, + 297, + 381 + ], + "lines": [ + { + "bbox": [ + 105, + 367, + 297, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 297, + 383 + ], + "score": 1.0, + "content": "Therefore, the optimization problem reduces to", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 383, + 378, + 448 + ], + "lines": [ + { + "bbox": [ + 232, + 383, + 378, + 448 + ], + "spans": [ + { + "bbox": [ + 232, + 383, + 378, + 448 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { \\Psi : \\mathcal K \\mapsto \\mathcal P ( \\mathcal Z ) } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } \\big [ \\mathbf a ^ { T } \\Psi ( X ) \\big ] } \\\\ & { \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf a _ { + } { } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } ~ , } \\\\ & { \\qquad \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf a _ { - } { } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } ~ . } \\end{array}", + "type": "interline_equation", + "image_path": "d08851ea057fcd71dd089a39090c2e53c3aadd2e7eaafd031694eb4c29819011.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 232, + 383, + 378, + 415.5 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 232, + 415.5, + 378, + 448.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 450, + 317, + 462 + ], + "lines": [ + { + "bbox": [ + 106, + 450, + 316, + 463 + ], + "spans": [ + { + "bbox": [ + 106, + 450, + 272, + 463 + ], + "score": 1.0, + "content": "This is a convex optimization problem in", + "type": "text" + }, + { + "bbox": [ + 272, + 451, + 281, + 460 + ], + "score": 0.84, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 450, + 316, + 463 + ], + "score": 1.0, + "content": ". Denote", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "interline_equation", + "bbox": [ + 271, + 464, + 341, + 492 + ], + "lines": [ + { + "bbox": [ + 271, + 464, + 341, + 492 + ], + "spans": [ + { + "bbox": [ + 271, + 464, + 341, + 492 + ], + "score": 0.95, + "content": "r ( X ) = \\frac { \\nu ( X ) } { \\rho ( X ) } \\ .", + "type": "interline_equation", + "image_path": "05facb749248735b360f6b2235275969b6e5f8d3c8d8f553a29af8e3b39e65a8.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 271, + 464, + 341, + 492 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 493, + 505, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 478, + 507 + ], + "score": 1.0, + "content": "Considering the dual of this optimization problem with respect to the optimization variable", + "type": "text" + }, + { + "bbox": [ + 478, + 495, + 487, + 504 + ], + "score": 0.84, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 492, + 506, + 507 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 503, + 136, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 136, + 518 + ], + "score": 1.0, + "content": "obtain", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 516, + 486, + 610 + ], + "lines": [ + { + "bbox": [ + 126, + 516, + 486, + 610 + ], + "spans": [ + { + "bbox": [ + 126, + 516, + 486, + 610 + ], + "score": 0.96, + "content": "\\begin{array} { r l } & { \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } ^ { T } \\Psi ( X ) r ( X ) \\big ] - \\lambda _ { a } \\bigg ( \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } _ { + } { } ^ { T } \\Psi ( X ) \\big ] - \\theta _ { a } \\bigg ) + \\lambda _ { b } \\bigg ( \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } _ { - } { } ^ { T } \\Psi ( X ) \\big ] - \\theta _ { b } \\bigg ) } \\\\ & { = \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\Big [ ( r ( X ) \\mathbf { a } - \\lambda _ { a } \\mathbf { a } _ { + } + \\lambda _ { b } \\mathbf { a } _ { - } ) ^ { \\top } \\Psi ( X ) \\Big ] } \\\\ & { = \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\left[ \\binom { r ( X ) - \\lambda _ { a } } { - r ( X ) + \\lambda _ { b } } ^ { T } \\Psi ( X ) \\right] \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "e911337bbe32b32f83cb729d2b1fcd98ba2fb3f53dd2d03f5c0fa95e7e82c97e.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 126, + 516, + 486, + 547.3333333333334 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 126, + 547.3333333333334, + 486, + 578.6666666666667 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 126, + 578.6666666666667, + 486, + 610.0000000000001 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 612, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 198, + 625 + ], + "score": 1.0, + "content": "Since we can choose", + "type": "text" + }, + { + "bbox": [ + 198, + 612, + 220, + 624 + ], + "score": 0.93, + "content": "\\Psi ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 610, + 321, + 625 + ], + "score": 1.0, + "content": "independently for each", + "type": "text" + }, + { + "bbox": [ + 321, + 612, + 353, + 623 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 610, + 505, + 625 + ], + "score": 1.0, + "content": ", we can minimize each term in the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 623, + 252, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 252, + 636 + ], + "score": 1.0, + "content": "expectation independently to obtain", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 636, + 445, + 675 + ], + "lines": [ + { + "bbox": [ + 165, + 636, + 445, + 675 + ], + "spans": [ + { + "bbox": [ + 165, + 636, + 445, + 675 + ], + "score": 0.94, + "content": "\\operatorname* { m i n } _ { \\Psi ( x ) \\in \\mathcal { P } ( \\mathcal { Z } ) } { \\binom { r ( x ) - \\lambda _ { a } } { r ( x ) + \\lambda _ { b } } } ^ { T } \\Psi ( x ) = \\operatorname* { m i n } ( r ( x ) - \\lambda _ { a } , 0 , - r ( x ) + \\lambda _ { b } ) .", + "type": "interline_equation", + "image_path": "84cc8a64cd9511c407fbef81e1b311e67299425a016f6375296a09d9a4c1c047.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 165, + 636, + 445, + 649.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 165, + 649.0, + 445, + 662.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 165, + 662.0, + 445, + 675.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 678, + 287, + 690 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 288, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 288, + 692 + ], + "score": 1.0, + "content": "This implies that the Lagrangian evaluates to", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 692, + 416, + 711 + ], + "lines": [ + { + "bbox": [ + 194, + 692, + 416, + 711 + ], + "spans": [ + { + "bbox": [ + 194, + 692, + 416, + 711 + ], + "score": 0.91, + "content": "\\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underbrace { \\mathrm { ~ E ~ } } _ { X \\sim \\rho } [ \\mathrm { m i n } ( r ( X ) - \\lambda _ { a } , 0 , r ( X ) + \\lambda _ { b } ) ] \\ .", + "type": "interline_equation", + "image_path": "6b6241d5da54cb47088cc14516905d129e06ca44509c430d63a77891ca288ae5.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 194, + 692, + 416, + 711 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 220, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 719, + 221, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 719, + 221, + 733 + ], + "score": 1.0, + "content": "We now consider two cases:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + } + ], + "page_idx": 18, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 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 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "19", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 495, + 95 + ], + "score": 1.0, + "content": "It will be convenient to write this in a slightly different form: Rather than looking at the outputs of", + "type": "text" + }, + { + "bbox": [ + 496, + 83, + 504, + 92 + ], + "score": 0.76, + "content": "\\Psi", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 313, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 132, + 105 + ], + "score": 1.0, + "content": "as the", + "type": "text" + }, + { + "bbox": [ + 132, + 94, + 172, + 105 + ], + "score": 0.91, + "content": "+ 1 , 0 , - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 93, + 294, + 105 + ], + "score": 1.0, + "content": ", we look at them as vectors in", + "type": "text" + }, + { + "bbox": [ + 295, + 93, + 307, + 104 + ], + "score": 0.89, + "content": "\\mathbb { R } ^ { 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 93, + 313, + 105 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 504, + 105 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 248, + 108, + 363, + 143 + ], + "lines": [ + { + "bbox": [ + 248, + 108, + 363, + 143 + ], + "spans": [ + { + "bbox": [ + 248, + 108, + 363, + 143 + ], + "score": 0.94, + "content": "\\mathcal { Z } = \\left\\{ \\left( 0 \\atop 0 \\right) , \\left( 1 \\atop 0 \\right) , \\left( 0 \\atop 1 \\right) \\right\\}", + "type": "interline_equation", + "image_path": "b010e1378b1c9974e20c57a2772b52ab17f4f78939d52e5156c6bc00c264fea2.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 248, + 108, + 363, + 125.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 248, + 125.5, + 363, + 143.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 146, + 150, + 157 + ], + "lines": [ + { + "bbox": [ + 106, + 145, + 151, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 151, + 158 + ], + "score": 1.0, + "content": "and define", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 145, + 151, + 158 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 158, + 402, + 193 + ], + "lines": [ + { + "bbox": [ + 208, + 158, + 402, + 193 + ], + "spans": [ + { + "bbox": [ + 208, + 158, + 402, + 193 + ], + "score": 0.93, + "content": "{ \\bf a } = \\left( \\begin{array} { l } { { 1 } } \\\\ { { 0 } } \\\\ { { - 1 } } \\end{array} \\right) , { \\bf a } _ { + } = \\left( \\begin{array} { l } { { 1 } } \\\\ { { 0 } } \\\\ { { 0 } } \\end{array} \\right) , { \\bf a } _ { - } = \\left( \\begin{array} { l } { { 0 } } \\\\ { { 0 } } \\\\ { { 1 } } \\end{array} \\right) .", + "type": "interline_equation", + "image_path": "cd6d0153778eac2b289b9db9a661934550408533925de045754b8470a577ef56.jpg" + } + ] + } + ], + "index": 5.5, + "virtual_lines": [ + { + "bbox": [ + 208, + 158, + 402, + 175.5 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 208, + 175.5, + 402, + 193.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 196, + 378, + 208 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 379, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 379, + 211 + ], + "score": 1.0, + "content": "Then, we can write the optimization problem Eq. 12 equivalently as", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 195, + 379, + 211 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 230, + 210, + 381, + 276 + ], + "lines": [ + { + "bbox": [ + 230, + 210, + 381, + 276 + ], + "spans": [ + { + "bbox": [ + 230, + 210, + 381, + 276 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\underset { \\Psi : \\mathcal { X } \\mapsto \\mathcal { Z } , \\nu \\in \\mathcal { D } } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } \\big [ \\mathbf { a } ^ { T } \\Psi ( X ) \\big ] } \\\\ & { \\quad \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { + } { } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } ~ , } \\\\ & { \\qquad \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { - } { } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } ~ . } \\end{array}", + "type": "interline_equation", + "image_path": "c5199a36b9c02cb105cff79d51922fdd844543c1ea3bd1e62e451654ad03df34.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 230, + 210, + 381, + 243.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 230, + 243.0, + 381, + 276.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 282, + 505, + 338 + ], + "lines": [ + { + "bbox": [ + 106, + 283, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 262, + 295 + ], + "score": 1.0, + "content": "We first consider the minimization over", + "type": "text" + }, + { + "bbox": [ + 263, + 284, + 271, + 293 + ], + "score": 0.85, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 283, + 348, + 295 + ], + "score": 1.0, + "content": "for a fixed value of", + "type": "text" + }, + { + "bbox": [ + 348, + 285, + 355, + 293 + ], + "score": 0.76, + "content": "\\nu", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 283, + 505, + 295 + ], + "score": 1.0, + "content": ". We begin by observing that since the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 265, + 306 + ], + "score": 1.0, + "content": "objective is linear, the optimization over", + "type": "text" + }, + { + "bbox": [ + 266, + 295, + 274, + 304 + ], + "score": 0.83, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "can be replaced with the optimization over the convex hull", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 304, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 304, + 157, + 318 + ], + "score": 1.0, + "content": "of the set of", + "type": "text" + }, + { + "bbox": [ + 157, + 306, + 166, + 315 + ], + "score": 0.83, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 304, + 413, + 318 + ], + "score": 1.0, + "content": "that satisfy the constraints (Bubeck, 2013). Since each input", + "type": "text" + }, + { + "bbox": [ + 413, + 306, + 441, + 316 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 304, + 506, + 318 + ], + "score": 1.0, + "content": "can be mapped", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 315, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 484, + 329 + ], + "score": 1.0, + "content": "independently of the rest, the convex hull is simply the cross product of the convex hull at every", + "type": "text" + }, + { + "bbox": [ + 484, + 318, + 491, + 326 + ], + "score": 0.74, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 315, + 506, + 329 + ], + "score": 1.0, + "content": ", to", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 326, + 205, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 205, + 339 + ], + "score": 1.0, + "content": "obtain the constraint set", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 283, + 506, + 339 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 152, + 339, + 459, + 366 + ], + "lines": [ + { + "bbox": [ + 152, + 339, + 459, + 366 + ], + "spans": [ + { + "bbox": [ + 152, + 339, + 459, + 366 + ], + "score": 0.87, + "content": "\\left\\{ \\Psi : \\mathcal { X } \\mapsto \\mathcal { P } ( \\mathcal { Z } ) \\mathrm { ~ s u c h ~ t h a t ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { + } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } , \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { - } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } \\right\\} \\ .", + "type": "interline_equation", + "image_path": "dad715d8a56b8b3b84c450f73c083343d6cc83c9cdfff8910bc81cae8eba9fd4.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 152, + 339, + 459, + 366 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 369, + 297, + 381 + ], + "lines": [ + { + "bbox": [ + 105, + 367, + 297, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 297, + 383 + ], + "score": 1.0, + "content": "Therefore, the optimization problem reduces to", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 367, + 297, + 383 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 383, + 378, + 448 + ], + "lines": [ + { + "bbox": [ + 232, + 383, + 378, + 448 + ], + "spans": [ + { + "bbox": [ + 232, + 383, + 378, + 448 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { \\Psi : \\mathcal K \\mapsto \\mathcal P ( \\mathcal Z ) } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } \\big [ \\mathbf a ^ { T } \\Psi ( X ) \\big ] } \\\\ & { \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf a _ { + } { } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } ~ , } \\\\ & { \\qquad \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf a _ { - } { } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } ~ . } \\end{array}", + "type": "interline_equation", + "image_path": "d08851ea057fcd71dd089a39090c2e53c3aadd2e7eaafd031694eb4c29819011.jpg" + } + ] + } + ], + "index": 17.5, + "virtual_lines": [ + { + "bbox": [ + 232, + 383, + 378, + 415.5 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 232, + 415.5, + 378, + 448.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 450, + 317, + 462 + ], + "lines": [ + { + "bbox": [ + 106, + 450, + 316, + 463 + ], + "spans": [ + { + "bbox": [ + 106, + 450, + 272, + 463 + ], + "score": 1.0, + "content": "This is a convex optimization problem in", + "type": "text" + }, + { + "bbox": [ + 272, + 451, + 281, + 460 + ], + "score": 0.84, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 450, + 316, + 463 + ], + "score": 1.0, + "content": ". Denote", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 106, + 450, + 316, + 463 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 271, + 464, + 341, + 492 + ], + "lines": [ + { + "bbox": [ + 271, + 464, + 341, + 492 + ], + "spans": [ + { + "bbox": [ + 271, + 464, + 341, + 492 + ], + "score": 0.95, + "content": "r ( X ) = \\frac { \\nu ( X ) } { \\rho ( X ) } \\ .", + "type": "interline_equation", + "image_path": "05facb749248735b360f6b2235275969b6e5f8d3c8d8f553a29af8e3b39e65a8.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 271, + 464, + 341, + 492 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 493, + 505, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 492, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 478, + 507 + ], + "score": 1.0, + "content": "Considering the dual of this optimization problem with respect to the optimization variable", + "type": "text" + }, + { + "bbox": [ + 478, + 495, + 487, + 504 + ], + "score": 0.84, + "content": "\\Psi", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 492, + 506, + 507 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 503, + 136, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 136, + 518 + ], + "score": 1.0, + "content": "obtain", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 492, + 506, + 518 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 516, + 486, + 610 + ], + "lines": [ + { + "bbox": [ + 126, + 516, + 486, + 610 + ], + "spans": [ + { + "bbox": [ + 126, + 516, + 486, + 610 + ], + "score": 0.96, + "content": "\\begin{array} { r l } & { \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } ^ { T } \\Psi ( X ) r ( X ) \\big ] - \\lambda _ { a } \\bigg ( \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } _ { + } { } ^ { T } \\Psi ( X ) \\big ] - \\theta _ { a } \\bigg ) + \\lambda _ { b } \\bigg ( \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } _ { - } { } ^ { T } \\Psi ( X ) \\big ] - \\theta _ { b } \\bigg ) } \\\\ & { = \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\Big [ ( r ( X ) \\mathbf { a } - \\lambda _ { a } \\mathbf { a } _ { + } + \\lambda _ { b } \\mathbf { a } _ { - } ) ^ { \\top } \\Psi ( X ) \\Big ] } \\\\ & { = \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\left[ \\binom { r ( X ) - \\lambda _ { a } } { - r ( X ) + \\lambda _ { b } } ^ { T } \\Psi ( X ) \\right] \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "e911337bbe32b32f83cb729d2b1fcd98ba2fb3f53dd2d03f5c0fa95e7e82c97e.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 126, + 516, + 486, + 547.3333333333334 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 126, + 547.3333333333334, + 486, + 578.6666666666667 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 126, + 578.6666666666667, + 486, + 610.0000000000001 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 612, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 505, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 198, + 625 + ], + "score": 1.0, + "content": "Since we can choose", + "type": "text" + }, + { + "bbox": [ + 198, + 612, + 220, + 624 + ], + "score": 0.93, + "content": "\\Psi ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 610, + 321, + 625 + ], + "score": 1.0, + "content": "independently for each", + "type": "text" + }, + { + "bbox": [ + 321, + 612, + 353, + 623 + ], + "score": 0.9, + "content": "x \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 610, + 505, + 625 + ], + "score": 1.0, + "content": ", we can minimize each term in the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 623, + 252, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 252, + 636 + ], + "score": 1.0, + "content": "expectation independently to obtain", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 610, + 505, + 636 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 636, + 445, + 675 + ], + "lines": [ + { + "bbox": [ + 165, + 636, + 445, + 675 + ], + "spans": [ + { + "bbox": [ + 165, + 636, + 445, + 675 + ], + "score": 0.94, + "content": "\\operatorname* { m i n } _ { \\Psi ( x ) \\in \\mathcal { P } ( \\mathcal { Z } ) } { \\binom { r ( x ) - \\lambda _ { a } } { r ( x ) + \\lambda _ { b } } } ^ { T } \\Psi ( x ) = \\operatorname* { m i n } ( r ( x ) - \\lambda _ { a } , 0 , - r ( x ) + \\lambda _ { b } ) .", + "type": "interline_equation", + "image_path": "84cc8a64cd9511c407fbef81e1b311e67299425a016f6375296a09d9a4c1c047.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 165, + 636, + 445, + 649.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 165, + 649.0, + 445, + 662.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 165, + 662.0, + 445, + 675.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 678, + 287, + 690 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 288, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 288, + 692 + ], + "score": 1.0, + "content": "This implies that the Lagrangian evaluates to", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 677, + 288, + 692 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 692, + 416, + 711 + ], + "lines": [ + { + "bbox": [ + 194, + 692, + 416, + 711 + ], + "spans": [ + { + "bbox": [ + 194, + 692, + 416, + 711 + ], + "score": 0.91, + "content": "\\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underbrace { \\mathrm { ~ E ~ } } _ { X \\sim \\rho } [ \\mathrm { m i n } ( r ( X ) - \\lambda _ { a } , 0 , r ( X ) + \\lambda _ { b } ) ] \\ .", + "type": "interline_equation", + "image_path": "6b6241d5da54cb47088cc14516905d129e06ca44509c430d63a77891ca288ae5.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 194, + 692, + 416, + 711 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 220, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 719, + 221, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 719, + 221, + 733 + ], + "score": 1.0, + "content": "We now consider two cases:", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33, + "bbox_fs": [ + 106, + 719, + 221, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 318, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 319, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 139, + 96 + ], + "score": 1.0, + "content": "Case 1", + "type": "text" + }, + { + "bbox": [ + 140, + 83, + 194, + 94 + ], + "score": 0.85, + "content": "( \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 81, + 319, + 96 + ], + "score": 1.0, + "content": ") In this case, we can see that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 143, + 97, + 468, + 127 + ], + "lines": [ + { + "bbox": [ + 143, + 97, + 468, + 127 + ], + "spans": [ + { + "bbox": [ + 143, + 97, + 468, + 127 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 , - r ( X ) + \\lambda _ { b } ) = \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 ) + \\operatorname* { m i n } ( - r ( X ) + \\lambda _ { b } , 0 ) } \\\\ & { = r ( X ) - \\lambda _ { a } - \\operatorname* { m a x } ( r ( X ) - \\lambda _ { a } , 0 ) - \\operatorname* { m a x } ( r ( X ) - \\lambda _ { b } , 0 ) \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "f2c9d4942dfe1270f1144a81ddc7b36c7642491bd5e8fd8d329fa88a552bfb83.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 143, + 97, + 468, + 107.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 143, + 107.0, + 468, + 117.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 143, + 117.0, + 468, + 127.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 130, + 237, + 141 + ], + "lines": [ + { + "bbox": [ + 105, + 128, + 238, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 238, + 144 + ], + "score": 1.0, + "content": "Then, the Lagrangian reduces to", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 144, + 514, + 182 + ], + "lines": [ + { + "bbox": [ + 111, + 144, + 514, + 182 + ], + "spans": [ + { + "bbox": [ + 111, + 144, + 514, + 182 + ], + "score": 0.89, + "content": "\\begin{array} { r l } & { \\underset { \\mathbf { \\theta } } { \\mathrm { \\mathop { A } } } a \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ r ( X ) - \\lambda _ { a } ] - \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ \\operatorname* { m a x } ( r ( X ) - \\lambda _ { a } , 0 ) ] - \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ \\operatorname* { m a x } ( r ( X ) - \\lambda _ { b } , 0 ) ] } \\\\ & { = 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) - ( D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) ) } \\end{array}", + "type": "interline_equation", + "image_path": "ba0782d471f2ca66e3dee6b9fff1caa8badca4c26656ee154ecc077570db8121.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 111, + 144, + 514, + 156.66666666666666 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 111, + 156.66666666666666, + 514, + 169.33333333333331 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 111, + 169.33333333333331, + 514, + 181.99999999999997 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 189, + 318, + 202 + ], + "lines": [ + { + "bbox": [ + 107, + 190, + 319, + 203 + ], + "spans": [ + { + "bbox": [ + 107, + 190, + 139, + 203 + ], + "score": 1.0, + "content": "Case 2", + "type": "text" + }, + { + "bbox": [ + 139, + 190, + 194, + 201 + ], + "score": 0.81, + "content": "( \\lambda _ { b } \\ge \\lambda _ { a } \\ge 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 190, + 319, + 203 + ], + "score": 1.0, + "content": ") In this case, we can see that", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 204, + 443, + 277 + ], + "lines": [ + { + "bbox": [ + 168, + 204, + 443, + 277 + ], + "spans": [ + { + "bbox": [ + 168, + 204, + 443, + 277 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 , - r ( X ) + \\lambda _ { b } ) = \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , - r ( X ) + \\lambda _ { b } ) } \\\\ { = r ( X ) - \\lambda _ { a } + 2 \\operatorname* { m i n } \\biggr ( 0 , \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } - r ( X ) \\biggr ) } \\\\ { = r ( X ) - \\lambda _ { a } - 2 \\operatorname* { m a x } \\biggr ( r ( X ) - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\biggr ) \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "f424ad5e3f72d4ff1f28943d252385a9faaa22ae2c4109aed216a5c01b1f43a5.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 168, + 204, + 443, + 228.33333333333334 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 168, + 228.33333333333334, + 443, + 252.66666666666669 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 168, + 252.66666666666669, + 443, + 277.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 280, + 237, + 291 + ], + "lines": [ + { + "bbox": [ + 105, + 278, + 237, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 237, + 293 + ], + "score": 1.0, + "content": "Then, the Lagrangian reduces to", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 142, + 295, + 468, + 351 + ], + "lines": [ + { + "bbox": [ + 142, + 295, + 468, + 351 + ], + "spans": [ + { + "bbox": [ + 142, + 295, + 468, + 351 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) - \\lambda _ { a } ] - 2 \\underset { X \\sim \\rho } { \\mathrm { E } } \\bigg [ \\operatorname* { m a x } \\bigg ( r ( X ) - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\bigg ) \\bigg ] } \\\\ & { = 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - 2 \\bigg ( D _ { \\mathrm { H S } , \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } \\bigg ( 1 - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\bigg ) \\bigg ) \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "e89da55d0410a5a5a92c429dc20076a6ad13e8ceefdf6fced95bca71e25394cb.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 142, + 295, + 468, + 313.6666666666667 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 142, + 313.6666666666667, + 468, + 332.33333333333337 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 142, + 332.33333333333337, + 468, + 351.00000000000006 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 354, + 506, + 399 + ], + "lines": [ + { + "bbox": [ + 105, + 353, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 163, + 368 + ], + "score": 1.0, + "content": "We know that", + "type": "text" + }, + { + "bbox": [ + 163, + 355, + 212, + 366 + ], + "score": 0.92, + "content": "1 - \\theta _ { a } \\ge \\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 353, + 230, + 368 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 230, + 355, + 265, + 366 + ], + "score": 0.92, + "content": "\\lambda _ { b } \\geq \\lambda _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 353, + 278, + 368 + ], + "score": 1.0, + "content": ". If", + "type": "text" + }, + { + "bbox": [ + 278, + 355, + 313, + 366 + ], + "score": 0.92, + "content": "\\lambda _ { b } > \\lambda _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 353, + 367, + 368 + ], + "score": 1.0, + "content": ", by choosing", + "type": "text" + }, + { + "bbox": [ + 367, + 354, + 420, + 367 + ], + "score": 0.93, + "content": "\\lambda _ { a } ^ { \\prime } = \\lambda _ { a } + \\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 353, + 438, + 368 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 438, + 354, + 490, + 367 + ], + "score": 0.92, + "content": "\\lambda _ { b } ^ { \\prime } = \\lambda _ { b } - \\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 353, + 506, + 368 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 366, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 155, + 378 + ], + "score": 1.0, + "content": "some small", + "type": "text" + }, + { + "bbox": [ + 156, + 367, + 181, + 376 + ], + "score": 0.89, + "content": "\\kappa > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 366, + 506, + 378 + ], + "score": 1.0, + "content": ", we know that the the sum of the first three terms would reduce while the final", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 377, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 106, + 377, + 451, + 389 + ], + "score": 1.0, + "content": "term would remain unchanged. Thus, at the the optimum in this case, we can assume", + "type": "text" + }, + { + "bbox": [ + 452, + 377, + 487, + 388 + ], + "score": 0.92, + "content": "\\lambda _ { a } = \\lambda _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 377, + 505, + 389 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 388, + 149, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 149, + 400 + ], + "score": 1.0, + "content": "we obtain", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 403, + 435, + 417 + ], + "lines": [ + { + "bbox": [ + 175, + 403, + 435, + 417 + ], + "spans": [ + { + "bbox": [ + 175, + 403, + 435, + 417 + ], + "score": 0.84, + "content": "1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { a } \\theta _ { b } - 2 ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) \\ .", + "type": "interline_equation", + "image_path": "64097b9478fe4dadb214d79d432b46633f94ee547755aba6f5412eb050971b47.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 175, + 403, + 435, + 417 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 426, + 490, + 439 + ], + "lines": [ + { + "bbox": [ + 106, + 426, + 491, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 491, + 441 + ], + "score": 1.0, + "content": "Final analysis of the Lagrangian Combining the two cases we can write the dual problem as", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 442, + 445, + 479 + ], + "lines": [ + { + "bbox": [ + 165, + 442, + 445, + 479 + ], + "spans": [ + { + "bbox": [ + 165, + 442, + 445, + 479 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { \\lambda _ { a } \\geq \\lambda _ { b } \\geq 0 } { \\operatorname* { m a x } } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) } \\\\ & { } \\\\ & { \\quad \\quad - \\left( D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) \\right) . } \\end{array}", + "type": "interline_equation", + "image_path": "36d6d5bb2caa8792c3144f0c1baf377377263c4e21b6668cf5c5718dfdfca1be.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 165, + 442, + 445, + 454.3333333333333 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 165, + 454.3333333333333, + 445, + 466.66666666666663 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 165, + 466.66666666666663, + 445, + 478.99999999999994 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 481, + 505, + 515 + ], + "lines": [ + { + "bbox": [ + 106, + 481, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 481, + 506, + 495 + ], + "score": 1.0, + "content": "By strong duality, the optimal value of the above problem precisely matches the optimal value of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 492, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 461, + 505 + ], + "score": 1.0, + "content": "Eq. 14 (and hence Eq. 12). Thus, information limited robust certification with respect to", + "type": "text" + }, + { + "bbox": [ + 462, + 493, + 471, + 502 + ], + "score": 0.83, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 492, + 506, + 505 + ], + "score": 1.0, + "content": "holds if", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 503, + 459, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 349, + 516 + ], + "score": 1.0, + "content": "and only if Eq. 15 has a non-negative optimal value for each", + "type": "text" + }, + { + "bbox": [ + 349, + 504, + 376, + 514 + ], + "score": 0.9, + "content": "\\nu \\in \\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 503, + 459, + 516 + ], + "score": 1.0, + "content": ". Since we have that", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 518, + 420, + 537 + ], + "lines": [ + { + "bbox": [ + 190, + 518, + 420, + 537 + ], + "spans": [ + { + "bbox": [ + 190, + 518, + 420, + 537 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) = \\epsilon _ { \\lambda _ { a } } , \\ : \\ : \\ : \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) = \\epsilon _ { \\lambda _ { b } } ,", + "type": "interline_equation", + "image_path": "2b4e9a8667517b28c2f94acdc82d24296a97b3b5e3ad169e843fcdf16c533134.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 190, + 518, + 420, + 537 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 541, + 426, + 553 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 426, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 426, + 555 + ], + "score": 1.0, + "content": "information-limited robust certification holds if and only if the optimal value of", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 557, + 471, + 577 + ], + "lines": [ + { + "bbox": [ + 123, + 557, + 471, + 577 + ], + "spans": [ + { + "bbox": [ + 123, + 557, + 471, + 577 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( \\epsilon _ { \\lambda _ { a } } + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) - ( \\epsilon _ { \\lambda _ { b } } + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) )", + "type": "interline_equation", + "image_path": "86f768362bad2dfa81e49c1f88cdd5f96fb47717b74d83a15baa7ee58d821c30.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 123, + 557, + 471, + 577 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 581, + 504, + 604 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 438, + 594 + ], + "score": 1.0, + "content": "is non-negative. Further, since the optimal value only depended on the value of", + "type": "text" + }, + { + "bbox": [ + 438, + 581, + 489, + 594 + ], + "score": 0.92, + "content": "D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 107, + 591, + 450, + 606 + ], + "spans": [ + { + "bbox": [ + 107, + 593, + 132, + 604 + ], + "score": 0.89, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 591, + 426, + 606 + ], + "score": 1.0, + "content": ", it is equivalent to information-limited robust certification with respect to", + "type": "text" + }, + { + "bbox": [ + 426, + 593, + 446, + 604 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 591, + 450, + 606 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 609, + 505, + 642 + ], + "lines": [ + { + "bbox": [ + 105, + 608, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 506, + 622 + ], + "score": 1.0, + "content": "The above argument also shows that in this case, information-limited robust certification with respect", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 117, + 633 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 621, + 126, + 630 + ], + "score": 0.83, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 620, + 505, + 633 + ], + "score": 1.0, + "content": "is equivalent to requiring that the following convex optimization problem has a non-negative", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 631, + 166, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 166, + 644 + ], + "score": 1.0, + "content": "optimal value:", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 646, + 466, + 667 + ], + "lines": [ + { + "bbox": [ + 145, + 646, + 466, + 667 + ], + "spans": [ + { + "bbox": [ + 145, + 646, + 466, + 667 + ], + "score": 0.88, + "content": "\\operatorname * { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } ~ 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - \\left( \\epsilon _ { \\lambda _ { a } } + [ 1 - \\lambda _ { a } ] _ { + } \\right) - \\left( \\epsilon _ { \\lambda _ { b } } + [ 1 - \\lambda _ { b } ] _ { + } \\right) ~ .", + "type": "interline_equation", + "image_path": "52f9adfa712ea7be5634441e37781060a025bb0999a5d8abcfb2c424e1fca816.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 145, + 646, + 466, + 667 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 123, + 689 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 677, + 150, + 689 + ], + "score": 0.9, + "content": "\\lambda _ { a } ^ { * } , \\lambda _ { b } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "be the optimal values attained. Since this certificate depends only on the value of two", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 686, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 217, + 701 + ], + "score": 1.0, + "content": "Hockey-stick divergences at", + "type": "text" + }, + { + "bbox": [ + 217, + 688, + 244, + 700 + ], + "score": 0.29, + "content": "\\lambda _ { a } ^ { * } , \\lambda _ { b } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 686, + 506, + 701 + ], + "score": 1.0, + "content": ", it must coincide with the application of theorem 2 to the constraint", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 120, + 712 + ], + "score": 1.0, + "content": "set", + "type": "text" + }, + { + "bbox": [ + 120, + 699, + 140, + 710 + ], + "score": 0.9, + "content": "{ \\mathcal { D } } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "defined by constraints on these hockey-stick divergences (as we know that 2 computes the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "optimal certificate for any constraint set defined only by a set of f-divergences). This observation", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 720, + 191, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 191, + 733 + ], + "score": 1.0, + "content": "completes the proof.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39 + } + ], + "page_idx": 19, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 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 2020", + "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": [ + 106, + 82, + 318, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 319, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 139, + 96 + ], + "score": 1.0, + "content": "Case 1", + "type": "text" + }, + { + "bbox": [ + 140, + 83, + 194, + 94 + ], + "score": 0.85, + "content": "( \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 81, + 319, + 96 + ], + "score": 1.0, + "content": ") In this case, we can see that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 319, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 143, + 97, + 468, + 127 + ], + "lines": [ + { + "bbox": [ + 143, + 97, + 468, + 127 + ], + "spans": [ + { + "bbox": [ + 143, + 97, + 468, + 127 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 , - r ( X ) + \\lambda _ { b } ) = \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 ) + \\operatorname* { m i n } ( - r ( X ) + \\lambda _ { b } , 0 ) } \\\\ & { = r ( X ) - \\lambda _ { a } - \\operatorname* { m a x } ( r ( X ) - \\lambda _ { a } , 0 ) - \\operatorname* { m a x } ( r ( X ) - \\lambda _ { b } , 0 ) \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "f2c9d4942dfe1270f1144a81ddc7b36c7642491bd5e8fd8d329fa88a552bfb83.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 143, + 97, + 468, + 107.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 143, + 107.0, + 468, + 117.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 143, + 117.0, + 468, + 127.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 130, + 237, + 141 + ], + "lines": [ + { + "bbox": [ + 105, + 128, + 238, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 128, + 238, + 144 + ], + "score": 1.0, + "content": "Then, the Lagrangian reduces to", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 128, + 238, + 144 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 144, + 514, + 182 + ], + "lines": [ + { + "bbox": [ + 111, + 144, + 514, + 182 + ], + "spans": [ + { + "bbox": [ + 111, + 144, + 514, + 182 + ], + "score": 0.89, + "content": "\\begin{array} { r l } & { \\underset { \\mathbf { \\theta } } { \\mathrm { \\mathop { A } } } a \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ r ( X ) - \\lambda _ { a } ] - \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ \\operatorname* { m a x } ( r ( X ) - \\lambda _ { a } , 0 ) ] - \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ \\operatorname* { m a x } ( r ( X ) - \\lambda _ { b } , 0 ) ] } \\\\ & { = 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) - ( D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) ) } \\end{array}", + "type": "interline_equation", + "image_path": "ba0782d471f2ca66e3dee6b9fff1caa8badca4c26656ee154ecc077570db8121.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 111, + 144, + 514, + 156.66666666666666 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 111, + 156.66666666666666, + 514, + 169.33333333333331 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 111, + 169.33333333333331, + 514, + 181.99999999999997 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 189, + 318, + 202 + ], + "lines": [ + { + "bbox": [ + 107, + 190, + 319, + 203 + ], + "spans": [ + { + "bbox": [ + 107, + 190, + 139, + 203 + ], + "score": 1.0, + "content": "Case 2", + "type": "text" + }, + { + "bbox": [ + 139, + 190, + 194, + 201 + ], + "score": 0.81, + "content": "( \\lambda _ { b } \\ge \\lambda _ { a } \\ge 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 190, + 319, + 203 + ], + "score": 1.0, + "content": ") In this case, we can see that", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 107, + 190, + 319, + 203 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 204, + 443, + 277 + ], + "lines": [ + { + "bbox": [ + 168, + 204, + 443, + 277 + ], + "spans": [ + { + "bbox": [ + 168, + 204, + 443, + 277 + ], + "score": 0.94, + "content": "\\begin{array} { l } { \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 , - r ( X ) + \\lambda _ { b } ) = \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , - r ( X ) + \\lambda _ { b } ) } \\\\ { = r ( X ) - \\lambda _ { a } + 2 \\operatorname* { m i n } \\biggr ( 0 , \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } - r ( X ) \\biggr ) } \\\\ { = r ( X ) - \\lambda _ { a } - 2 \\operatorname* { m a x } \\biggr ( r ( X ) - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\biggr ) \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "f424ad5e3f72d4ff1f28943d252385a9faaa22ae2c4109aed216a5c01b1f43a5.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 168, + 204, + 443, + 228.33333333333334 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 168, + 228.33333333333334, + 443, + 252.66666666666669 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 168, + 252.66666666666669, + 443, + 277.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 280, + 237, + 291 + ], + "lines": [ + { + "bbox": [ + 105, + 278, + 237, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 237, + 293 + ], + "score": 1.0, + "content": "Then, the Lagrangian reduces to", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 278, + 237, + 293 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 142, + 295, + 468, + 351 + ], + "lines": [ + { + "bbox": [ + 142, + 295, + 468, + 351 + ], + "spans": [ + { + "bbox": [ + 142, + 295, + 468, + 351 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) - \\lambda _ { a } ] - 2 \\underset { X \\sim \\rho } { \\mathrm { E } } \\bigg [ \\operatorname* { m a x } \\bigg ( r ( X ) - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\bigg ) \\bigg ] } \\\\ & { = 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - 2 \\bigg ( D _ { \\mathrm { H S } , \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } \\bigg ( 1 - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\bigg ) \\bigg ) \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "e89da55d0410a5a5a92c429dc20076a6ad13e8ceefdf6fced95bca71e25394cb.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 142, + 295, + 468, + 313.6666666666667 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 142, + 313.6666666666667, + 468, + 332.33333333333337 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 142, + 332.33333333333337, + 468, + 351.00000000000006 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 354, + 506, + 399 + ], + "lines": [ + { + "bbox": [ + 105, + 353, + 506, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 163, + 368 + ], + "score": 1.0, + "content": "We know that", + "type": "text" + }, + { + "bbox": [ + 163, + 355, + 212, + 366 + ], + "score": 0.92, + "content": "1 - \\theta _ { a } \\ge \\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 353, + 230, + 368 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 230, + 355, + 265, + 366 + ], + "score": 0.92, + "content": "\\lambda _ { b } \\geq \\lambda _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 353, + 278, + 368 + ], + "score": 1.0, + "content": ". If", + "type": "text" + }, + { + "bbox": [ + 278, + 355, + 313, + 366 + ], + "score": 0.92, + "content": "\\lambda _ { b } > \\lambda _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 353, + 367, + 368 + ], + "score": 1.0, + "content": ", by choosing", + "type": "text" + }, + { + "bbox": [ + 367, + 354, + 420, + 367 + ], + "score": 0.93, + "content": "\\lambda _ { a } ^ { \\prime } = \\lambda _ { a } + \\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 353, + 438, + 368 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 438, + 354, + 490, + 367 + ], + "score": 0.92, + "content": "\\lambda _ { b } ^ { \\prime } = \\lambda _ { b } - \\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 353, + 506, + 368 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 366, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 155, + 378 + ], + "score": 1.0, + "content": "some small", + "type": "text" + }, + { + "bbox": [ + 156, + 367, + 181, + 376 + ], + "score": 0.89, + "content": "\\kappa > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 366, + 506, + 378 + ], + "score": 1.0, + "content": ", we know that the the sum of the first three terms would reduce while the final", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 377, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 106, + 377, + 451, + 389 + ], + "score": 1.0, + "content": "term would remain unchanged. Thus, at the the optimum in this case, we can assume", + "type": "text" + }, + { + "bbox": [ + 452, + 377, + 487, + 388 + ], + "score": 0.92, + "content": "\\lambda _ { a } = \\lambda _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 377, + 505, + 389 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 388, + 149, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 149, + 400 + ], + "score": 1.0, + "content": "we obtain", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 353, + 506, + 400 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 403, + 435, + 417 + ], + "lines": [ + { + "bbox": [ + 175, + 403, + 435, + 417 + ], + "spans": [ + { + "bbox": [ + 175, + 403, + 435, + 417 + ], + "score": 0.84, + "content": "1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { a } \\theta _ { b } - 2 ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) \\ .", + "type": "interline_equation", + "image_path": "64097b9478fe4dadb214d79d432b46633f94ee547755aba6f5412eb050971b47.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 175, + 403, + 435, + 417 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 426, + 490, + 439 + ], + "lines": [ + { + "bbox": [ + 106, + 426, + 491, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 491, + 441 + ], + "score": 1.0, + "content": "Final analysis of the Lagrangian Combining the two cases we can write the dual problem as", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 426, + 491, + 441 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 442, + 445, + 479 + ], + "lines": [ + { + "bbox": [ + 165, + 442, + 445, + 479 + ], + "spans": [ + { + "bbox": [ + 165, + 442, + 445, + 479 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { \\lambda _ { a } \\geq \\lambda _ { b } \\geq 0 } { \\operatorname* { m a x } } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) } \\\\ & { } \\\\ & { \\quad \\quad - \\left( D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) \\right) . } \\end{array}", + "type": "interline_equation", + "image_path": "36d6d5bb2caa8792c3144f0c1baf377377263c4e21b6668cf5c5718dfdfca1be.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 165, + 442, + 445, + 454.3333333333333 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 165, + 454.3333333333333, + 445, + 466.66666666666663 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 165, + 466.66666666666663, + 445, + 478.99999999999994 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 481, + 505, + 515 + ], + "lines": [ + { + "bbox": [ + 106, + 481, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 481, + 506, + 495 + ], + "score": 1.0, + "content": "By strong duality, the optimal value of the above problem precisely matches the optimal value of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 492, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 461, + 505 + ], + "score": 1.0, + "content": "Eq. 14 (and hence Eq. 12). Thus, information limited robust certification with respect to", + "type": "text" + }, + { + "bbox": [ + 462, + 493, + 471, + 502 + ], + "score": 0.83, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 492, + 506, + 505 + ], + "score": 1.0, + "content": "holds if", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 503, + 459, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 349, + 516 + ], + "score": 1.0, + "content": "and only if Eq. 15 has a non-negative optimal value for each", + "type": "text" + }, + { + "bbox": [ + 349, + 504, + 376, + 514 + ], + "score": 0.9, + "content": "\\nu \\in \\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 503, + 459, + 516 + ], + "score": 1.0, + "content": ". Since we have that", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 481, + 506, + 516 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 518, + 420, + 537 + ], + "lines": [ + { + "bbox": [ + 190, + 518, + 420, + 537 + ], + "spans": [ + { + "bbox": [ + 190, + 518, + 420, + 537 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) = \\epsilon _ { \\lambda _ { a } } , \\ : \\ : \\ : \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) = \\epsilon _ { \\lambda _ { b } } ,", + "type": "interline_equation", + "image_path": "2b4e9a8667517b28c2f94acdc82d24296a97b3b5e3ad169e843fcdf16c533134.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 190, + 518, + 420, + 537 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 541, + 426, + 553 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 426, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 426, + 555 + ], + "score": 1.0, + "content": "information-limited robust certification holds if and only if the optimal value of", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 540, + 426, + 555 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 557, + 471, + 577 + ], + "lines": [ + { + "bbox": [ + 123, + 557, + 471, + 577 + ], + "spans": [ + { + "bbox": [ + 123, + 557, + 471, + 577 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( \\epsilon _ { \\lambda _ { a } } + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) - ( \\epsilon _ { \\lambda _ { b } } + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) )", + "type": "interline_equation", + "image_path": "86f768362bad2dfa81e49c1f88cdd5f96fb47717b74d83a15baa7ee58d821c30.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 123, + 557, + 471, + 577 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 581, + 504, + 604 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 438, + 594 + ], + "score": 1.0, + "content": "is non-negative. Further, since the optimal value only depended on the value of", + "type": "text" + }, + { + "bbox": [ + 438, + 581, + 489, + 594 + ], + "score": 0.92, + "content": "D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho )", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 107, + 591, + 450, + 606 + ], + "spans": [ + { + "bbox": [ + 107, + 593, + 132, + 604 + ], + "score": 0.89, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 591, + 426, + 606 + ], + "score": 1.0, + "content": ", it is equivalent to information-limited robust certification with respect to", + "type": "text" + }, + { + "bbox": [ + 426, + 593, + 446, + 604 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 591, + 450, + 606 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 581, + 505, + 606 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 609, + 505, + 642 + ], + "lines": [ + { + "bbox": [ + 105, + 608, + 506, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 506, + 622 + ], + "score": 1.0, + "content": "The above argument also shows that in this case, information-limited robust certification with respect", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 117, + 633 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 621, + 126, + 630 + ], + "score": 0.83, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 620, + 505, + 633 + ], + "score": 1.0, + "content": "is equivalent to requiring that the following convex optimization problem has a non-negative", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 631, + 166, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 166, + 644 + ], + "score": 1.0, + "content": "optimal value:", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 608, + 506, + 644 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 646, + 466, + 667 + ], + "lines": [ + { + "bbox": [ + 145, + 646, + 466, + 667 + ], + "spans": [ + { + "bbox": [ + 145, + 646, + 466, + 667 + ], + "score": 0.88, + "content": "\\operatorname * { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } ~ 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - \\left( \\epsilon _ { \\lambda _ { a } } + [ 1 - \\lambda _ { a } ] _ { + } \\right) - \\left( \\epsilon _ { \\lambda _ { b } } + [ 1 - \\lambda _ { b } ] _ { + } \\right) ~ .", + "type": "interline_equation", + "image_path": "52f9adfa712ea7be5634441e37781060a025bb0999a5d8abcfb2c424e1fca816.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 145, + 646, + 466, + 667 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 123, + 689 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 677, + 150, + 689 + ], + "score": 0.9, + "content": "\\lambda _ { a } ^ { * } , \\lambda _ { b } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "be the optimal values attained. Since this certificate depends only on the value of two", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 686, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 217, + 701 + ], + "score": 1.0, + "content": "Hockey-stick divergences at", + "type": "text" + }, + { + "bbox": [ + 217, + 688, + 244, + 700 + ], + "score": 0.29, + "content": "\\lambda _ { a } ^ { * } , \\lambda _ { b } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 686, + 506, + 701 + ], + "score": 1.0, + "content": ", it must coincide with the application of theorem 2 to the constraint", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 120, + 712 + ], + "score": 1.0, + "content": "set", + "type": "text" + }, + { + "bbox": [ + 120, + 699, + 140, + 710 + ], + "score": 0.9, + "content": "{ \\mathcal { D } } _ { \\mathrm { H S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "defined by constraints on these hockey-stick divergences (as we know that 2 computes the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "optimal certificate for any constraint set defined only by a set of f-divergences). This observation", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 720, + 191, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 191, + 733 + ], + "score": 1.0, + "content": "completes the proof.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 676, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 102, + 506, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 506, + 117 + ], + "score": 1.0, + "content": "Theorem 4 gives us the optimal limited-information certificate problem provided that we can compute", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 120, + 370, + 141 + ], + "lines": [ + { + "bbox": [ + 241, + 120, + 370, + 141 + ], + "spans": [ + { + "bbox": [ + 241, + 120, + 370, + 141 + ], + "score": 0.92, + "content": "\\operatorname* { m a x } _ { x ^ { \\prime } : d ( x , x ^ { \\prime } ) \\leq \\epsilon } D _ { \\mathrm { H S } , \\beta } ( \\mu ( x ^ { \\prime } ) | | \\mu ( x ) )", + "type": "interline_equation", + "image_path": "7af7e3c544bab88c576e7759fcf0a05143fb5330d747045314849d1cd97abb82.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 241, + 120, + 370, + 141 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 149, + 505, + 173 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 505, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 140, + 163 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 141, + 150, + 166, + 162 + ], + "score": 0.9, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 149, + 246, + 163 + ], + "score": 1.0, + "content": ". In particular, when", + "type": "text" + }, + { + "bbox": [ + 246, + 153, + 254, + 162 + ], + "score": 0.83, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 149, + 343, + 163 + ], + "score": 1.0, + "content": "is a Gaussian measure", + "type": "text" + }, + { + "bbox": [ + 344, + 149, + 422, + 163 + ], + "score": 0.93, + "content": "\\mu ( x ) = \\mathcal { N } \\big ( x , \\sigma ^ { 2 } I \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 149, + 505, + 163 + ], + "score": 1.0, + "content": ", we can leverage the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 161, + 285, + 174 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 285, + 174 + ], + "score": 1.0, + "content": "following result from Balle & Wang (2018).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 106, + 177, + 505, + 201 + ], + "lines": [ + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 170, + 190 + ], + "score": 1.0, + "content": "Lemma 6. Let", + "type": "text" + }, + { + "bbox": [ + 171, + 177, + 184, + 190 + ], + "score": 0.89, + "content": "\\Psi _ { g }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 175, + 389, + 190 + ], + "score": 1.0, + "content": "be the CDF of a standard normal random variable", + "type": "text" + }, + { + "bbox": [ + 389, + 177, + 422, + 189 + ], + "score": 0.93, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 175, + 460, + 190 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + }, + { + "bbox": [ + 461, + 177, + 487, + 189 + ], + "score": 0.91, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 107, + 186, + 175, + 203 + ], + "spans": [ + { + "bbox": [ + 107, + 189, + 137, + 200 + ], + "score": 0.91, + "content": "\\boldsymbol { x } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 186, + 175, + 203 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 206, + 511, + 234 + ], + "lines": [ + { + "bbox": [ + 111, + 206, + 511, + 234 + ], + "spans": [ + { + "bbox": [ + 111, + 206, + 511, + 234 + ], + "score": 0.94, + "content": "\\operatorname* { m a x } _ { \\substack { \\tau _ { * } \\Vert x - x ^ { \\prime } \\Vert _ { 2 } \\leq \\epsilon } } D _ { \\mathrm { H S , \\beta } } ( \\mu ( x ^ { \\prime } ) \\Vert \\mu ( x ) ) = \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\right) - \\beta \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\right) - [ 1 - \\beta ] _ { + } \\ .", + "type": "interline_equation", + "image_path": "20d081454e8b813aecdd66bf010a6796eeb388004b0726f37eafc37c97b4948b.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 111, + 206, + 511, + 234 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 246, + 374, + 259 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 375, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 375, + 261 + ], + "score": 1.0, + "content": "Applying Eq. 17 to the expression in Lemma 6 proves Corollary 5.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 276, + 416, + 289 + ], + "lines": [ + { + "bbox": [ + 106, + 276, + 416, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 386, + 290 + ], + "score": 1.0, + "content": "Proof of Corollary 5. With the notation from Theorem 4 we have, for", + "type": "text" + }, + { + "bbox": [ + 387, + 277, + 412, + 289 + ], + "score": 0.92, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 276, + 416, + 290 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 152, + 295, + 458, + 323 + ], + "lines": [ + { + "bbox": [ + 152, + 295, + 458, + 323 + ], + "spans": [ + { + "bbox": [ + 152, + 295, + 458, + 323 + ], + "score": 0.93, + "content": "\\epsilon _ { \\beta } = \\Psi _ { g } \\bigg ( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\bigg ) - \\beta \\Psi _ { g } \\bigg ( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\bigg ) - \\operatorname* { m a x } ( 1 - \\beta , 0 ) .", + "type": "interline_equation", + "image_path": "b0f13d1ff63e5d26db3d4c8dd0bd16e518e4fd2fa4d1ad0e459b257bd3d03319.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 152, + 295, + 458, + 323 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 329, + 505, + 353 + ], + "lines": [ + { + "bbox": [ + 105, + 328, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 328, + 506, + 343 + ], + "score": 1.0, + "content": "Plugging this expression into Eq. 17 allows us to verify information-limited robust certification of", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 338, + 420, + 354 + ], + "spans": [ + { + "bbox": [ + 107, + 339, + 154, + 353 + ], + "score": 0.92, + "content": "\\mathcal { N } ( \\breve { x ^ { \\prime } } , \\sigma ^ { \\top } I )", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 338, + 218, + 354 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 218, + 340, + 374, + 353 + ], + "score": 0.93, + "content": "\\mathcal { D } _ { x , \\epsilon } \\overset { \\cdot } { = } \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 338, + 420, + 354 + ], + "score": 1.0, + "content": "by solving", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 359, + 452, + 438 + ], + "lines": [ + { + "bbox": [ + 157, + 359, + 452, + 438 + ], + "spans": [ + { + "bbox": [ + 157, + 359, + 452, + 438 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\displaystyle \\operatorname* { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } } \\\\ & { \\displaystyle - \\left( \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { a } ) \\sigma } { 2 \\epsilon } \\right) - \\lambda _ { a } \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { a } ) \\sigma } { 2 \\epsilon } \\right) \\right) } \\\\ & { \\displaystyle - \\left( \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { b } ) \\sigma } { 2 \\epsilon } \\right) - \\lambda _ { b } \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { b } ) \\sigma } { 2 \\epsilon } \\right) \\right) \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "b33f2657508c22be78dbafcd31668616a1ba89761c066f4b8e674558164c05e3.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 157, + 359, + 452, + 385.3333333333333 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 157, + 385.3333333333333, + 452, + 411.66666666666663 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 157, + 411.66666666666663, + 452, + 437.99999999999994 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 442, + 504, + 465 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 460, + 456 + ], + "score": 1.0, + "content": "Eq. 9 then follows from setting the derivatives of this expression to 0 with respect to", + "type": "text" + }, + { + "bbox": [ + 460, + 443, + 486, + 454 + ], + "score": 0.92, + "content": "\\lambda _ { a } , \\lambda _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 442, + 506, + 456 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 454, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 454, + 366, + 467 + ], + "score": 1.0, + "content": "imposing the condition that the optimal solution is non-negative.", + "type": "text" + }, + { + "bbox": [ + 495, + 455, + 505, + 464 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 106, + 483, + 505, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 504, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 504, + 496 + ], + "score": 1.0, + "content": "To check that Corollary 5 is equivalent to the optimal certification in (Cohen et al., 2019, Theorem", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 495, + 504, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 504, + 506 + ], + "score": 1.0, + "content": "1) we first recall that, in our notation, their result can be stated as: the class of specifications", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 505, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 107, + 506, + 115, + 515 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 505, + 369, + 519 + ], + "score": 1.0, + "content": "in Definition 2.1 is information-limited robustly certified at", + "type": "text" + }, + { + "bbox": [ + 369, + 505, + 437, + 519 + ], + "score": 0.94, + "content": "\\rho = { \\mathcal { N } } ( x , \\sigma ^ { 2 } I )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 505, + 505, + 519 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 517, + 320, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 263, + 532 + ], + "score": 0.93, + "content": "\\mathcal { D } _ { { x } , \\epsilon } = \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 518, + 320, + 531 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 247, + 538, + 365, + 562 + ], + "lines": [ + { + "bbox": [ + 247, + 538, + 365, + 562 + ], + "spans": [ + { + "bbox": [ + 247, + 538, + 365, + 562 + ], + "score": 0.93, + "content": "\\frac { 2 \\epsilon } { \\sigma } \\leq \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) .", + "type": "interline_equation", + "image_path": "a8625d3a57b74a32527755b9ddcd1dbcc72cbead19fff8b037d5818bb01afe03.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 247, + 538, + 365, + 562 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 568, + 506, + 593 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 398, + 583 + ], + "score": 1.0, + "content": "The equivalence between Eq. 9 and Eq. 18 now follows from the identity", + "type": "text" + }, + { + "bbox": [ + 398, + 569, + 487, + 582 + ], + "score": 0.93, + "content": "1 - \\Psi _ { g } ( \\theta ) = \\Psi _ { g } ( - \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 568, + 505, + 583 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 578, + 207, + 596 + ], + "spans": [ + { + "bbox": [ + 104, + 578, + 187, + 596 + ], + "score": 1.0, + "content": "the monotonicity of", + "type": "text" + }, + { + "bbox": [ + 188, + 581, + 201, + 593 + ], + "score": 0.89, + "content": "\\Psi _ { g }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 578, + 207, + 596 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 599, + 425, + 738 + ], + "lines": [ + { + "bbox": [ + 191, + 599, + 425, + 738 + ], + "spans": [ + { + "bbox": [ + 191, + 599, + 425, + 738 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) + \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 } \\\\ & { \\iff \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 - \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) } \\\\ & { \\iff \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq \\Psi _ { g } \\Big ( \\frac { \\epsilon } { \\sigma } - \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) \\Big ) } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\geq \\frac { \\epsilon } { \\sigma } - \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) + \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } ~ . } \\end{array}", + "type": "interline_equation", + "image_path": "4d80a7976e68909109e1cc49626132aafc1a6bd8ab300b430d407f112e083c27.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 191, + 599, + 425, + 614.4444444444445 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 191, + 614.4444444444445, + 425, + 629.8888888888889 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 191, + 629.8888888888889, + 425, + 645.3333333333334 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 191, + 645.3333333333334, + 425, + 660.7777777777778 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 191, + 660.7777777777778, + 425, + 676.2222222222223 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 191, + 676.2222222222223, + 425, + 691.6666666666667 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 191, + 691.6666666666667, + 425, + 707.1111111111112 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 191, + 707.1111111111112, + 425, + 722.5555555555557 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 191, + 722.5555555555557, + 425, + 738.0000000000001 + ], + "spans": [], + "index": 32 + } + ] + } + ], + "page_idx": 20, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 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 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 761 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "21", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 108, + 82, + 291, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 292, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 292, + 95 + ], + "score": 1.0, + "content": "A.7.2 GAUSSIAN SMOOTHING MEASURES", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 102, + 506, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 506, + 117 + ], + "score": 1.0, + "content": "Theorem 4 gives us the optimal limited-information certificate problem provided that we can compute", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 100, + 506, + 117 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 120, + 370, + 141 + ], + "lines": [ + { + "bbox": [ + 241, + 120, + 370, + 141 + ], + "spans": [ + { + "bbox": [ + 241, + 120, + 370, + 141 + ], + "score": 0.92, + "content": "\\operatorname* { m a x } _ { x ^ { \\prime } : d ( x , x ^ { \\prime } ) \\leq \\epsilon } D _ { \\mathrm { H S } , \\beta } ( \\mu ( x ^ { \\prime } ) | | \\mu ( x ) )", + "type": "interline_equation", + "image_path": "7af7e3c544bab88c576e7759fcf0a05143fb5330d747045314849d1cd97abb82.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 241, + 120, + 370, + 141 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 149, + 505, + 173 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 505, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 140, + 163 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 141, + 150, + 166, + 162 + ], + "score": 0.9, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 149, + 246, + 163 + ], + "score": 1.0, + "content": ". In particular, when", + "type": "text" + }, + { + "bbox": [ + 246, + 153, + 254, + 162 + ], + "score": 0.83, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 149, + 343, + 163 + ], + "score": 1.0, + "content": "is a Gaussian measure", + "type": "text" + }, + { + "bbox": [ + 344, + 149, + 422, + 163 + ], + "score": 0.93, + "content": "\\mu ( x ) = \\mathcal { N } \\big ( x , \\sigma ^ { 2 } I \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 149, + 505, + 163 + ], + "score": 1.0, + "content": ", we can leverage the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 161, + 285, + 174 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 285, + 174 + ], + "score": 1.0, + "content": "following result from Balle & Wang (2018).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 149, + 505, + 174 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 177, + 505, + 201 + ], + "lines": [ + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 170, + 190 + ], + "score": 1.0, + "content": "Lemma 6. Let", + "type": "text" + }, + { + "bbox": [ + 171, + 177, + 184, + 190 + ], + "score": 0.89, + "content": "\\Psi _ { g }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 175, + 389, + 190 + ], + "score": 1.0, + "content": "be the CDF of a standard normal random variable", + "type": "text" + }, + { + "bbox": [ + 389, + 177, + 422, + 189 + ], + "score": 0.93, + "content": "\\mathcal { N } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 175, + 460, + 190 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + }, + { + "bbox": [ + 461, + 177, + 487, + 189 + ], + "score": 0.91, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 107, + 186, + 175, + 203 + ], + "spans": [ + { + "bbox": [ + 107, + 189, + 137, + 200 + ], + "score": 0.91, + "content": "\\boldsymbol { x } \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 186, + 175, + 203 + ], + "score": 1.0, + "content": "we have", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 175, + 505, + 203 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 206, + 511, + 234 + ], + "lines": [ + { + "bbox": [ + 111, + 206, + 511, + 234 + ], + "spans": [ + { + "bbox": [ + 111, + 206, + 511, + 234 + ], + "score": 0.94, + "content": "\\operatorname* { m a x } _ { \\substack { \\tau _ { * } \\Vert x - x ^ { \\prime } \\Vert _ { 2 } \\leq \\epsilon } } D _ { \\mathrm { H S , \\beta } } ( \\mu ( x ^ { \\prime } ) \\Vert \\mu ( x ) ) = \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\right) - \\beta \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\right) - [ 1 - \\beta ] _ { + } \\ .", + "type": "interline_equation", + "image_path": "20d081454e8b813aecdd66bf010a6796eeb388004b0726f37eafc37c97b4948b.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 111, + 206, + 511, + 234 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 246, + 374, + 259 + ], + "lines": [ + { + "bbox": [ + 105, + 245, + 375, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 375, + 261 + ], + "score": 1.0, + "content": "Applying Eq. 17 to the expression in Lemma 6 proves Corollary 5.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 245, + 375, + 261 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 276, + 416, + 289 + ], + "lines": [ + { + "bbox": [ + 106, + 276, + 416, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 386, + 290 + ], + "score": 1.0, + "content": "Proof of Corollary 5. With the notation from Theorem 4 we have, for", + "type": "text" + }, + { + "bbox": [ + 387, + 277, + 412, + 289 + ], + "score": 0.92, + "content": "\\beta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 276, + 416, + 290 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 276, + 416, + 290 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 152, + 295, + 458, + 323 + ], + "lines": [ + { + "bbox": [ + 152, + 295, + 458, + 323 + ], + "spans": [ + { + "bbox": [ + 152, + 295, + 458, + 323 + ], + "score": 0.93, + "content": "\\epsilon _ { \\beta } = \\Psi _ { g } \\bigg ( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\bigg ) - \\beta \\Psi _ { g } \\bigg ( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\bigg ) - \\operatorname* { m a x } ( 1 - \\beta , 0 ) .", + "type": "interline_equation", + "image_path": "b0f13d1ff63e5d26db3d4c8dd0bd16e518e4fd2fa4d1ad0e459b257bd3d03319.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 152, + 295, + 458, + 323 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 329, + 505, + 353 + ], + "lines": [ + { + "bbox": [ + 105, + 328, + 506, + 343 + ], + "spans": [ + { + "bbox": [ + 105, + 328, + 506, + 343 + ], + "score": 1.0, + "content": "Plugging this expression into Eq. 17 allows us to verify information-limited robust certification of", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 338, + 420, + 354 + ], + "spans": [ + { + "bbox": [ + 107, + 339, + 154, + 353 + ], + "score": 0.92, + "content": "\\mathcal { N } ( \\breve { x ^ { \\prime } } , \\sigma ^ { \\top } I )", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 338, + 218, + 354 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 218, + 340, + 374, + 353 + ], + "score": 0.93, + "content": "\\mathcal { D } _ { x , \\epsilon } \\overset { \\cdot } { = } \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 338, + 420, + 354 + ], + "score": 1.0, + "content": "by solving", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 328, + 506, + 354 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 359, + 452, + 438 + ], + "lines": [ + { + "bbox": [ + 157, + 359, + 452, + 438 + ], + "spans": [ + { + "bbox": [ + 157, + 359, + 452, + 438 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\displaystyle \\operatorname* { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } } \\\\ & { \\displaystyle - \\left( \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { a } ) \\sigma } { 2 \\epsilon } \\right) - \\lambda _ { a } \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { a } ) \\sigma } { 2 \\epsilon } \\right) \\right) } \\\\ & { \\displaystyle - \\left( \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { b } ) \\sigma } { 2 \\epsilon } \\right) - \\lambda _ { b } \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { b } ) \\sigma } { 2 \\epsilon } \\right) \\right) \\ . } \\end{array}", + "type": "interline_equation", + "image_path": "b33f2657508c22be78dbafcd31668616a1ba89761c066f4b8e674558164c05e3.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 157, + 359, + 452, + 385.3333333333333 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 157, + 385.3333333333333, + 452, + 411.66666666666663 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 157, + 411.66666666666663, + 452, + 437.99999999999994 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 442, + 504, + 465 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 460, + 456 + ], + "score": 1.0, + "content": "Eq. 9 then follows from setting the derivatives of this expression to 0 with respect to", + "type": "text" + }, + { + "bbox": [ + 460, + 443, + 486, + 454 + ], + "score": 0.92, + "content": "\\lambda _ { a } , \\lambda _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 442, + 506, + 456 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 454, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 454, + 366, + 467 + ], + "score": 1.0, + "content": "imposing the condition that the optimal solution is non-negative.", + "type": "text" + }, + { + "bbox": [ + 495, + 455, + 505, + 464 + ], + "score": 0.999, + "content": "□", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 442, + 506, + 467 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 483, + 505, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 483, + 504, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 504, + 496 + ], + "score": 1.0, + "content": "To check that Corollary 5 is equivalent to the optimal certification in (Cohen et al., 2019, Theorem", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 495, + 504, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 504, + 506 + ], + "score": 1.0, + "content": "1) we first recall that, in our notation, their result can be stated as: the class of specifications", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 505, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 107, + 506, + 115, + 515 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 505, + 369, + 519 + ], + "score": 1.0, + "content": "in Definition 2.1 is information-limited robustly certified at", + "type": "text" + }, + { + "bbox": [ + 369, + 505, + 437, + 519 + ], + "score": 0.94, + "content": "\\rho = { \\mathcal { N } } ( x , \\sigma ^ { 2 } I )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 505, + 505, + 519 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 517, + 320, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 263, + 532 + ], + "score": 0.93, + "content": "\\mathcal { D } _ { { x } , \\epsilon } = \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 518, + 320, + 531 + ], + "score": 1.0, + "content": "if and only if", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 483, + 505, + 532 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 247, + 538, + 365, + 562 + ], + "lines": [ + { + "bbox": [ + 247, + 538, + 365, + 562 + ], + "spans": [ + { + "bbox": [ + 247, + 538, + 365, + 562 + ], + "score": 0.93, + "content": "\\frac { 2 \\epsilon } { \\sigma } \\leq \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) .", + "type": "interline_equation", + "image_path": "a8625d3a57b74a32527755b9ddcd1dbcc72cbead19fff8b037d5818bb01afe03.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 247, + 538, + 365, + 562 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 568, + 506, + 593 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 398, + 583 + ], + "score": 1.0, + "content": "The equivalence between Eq. 9 and Eq. 18 now follows from the identity", + "type": "text" + }, + { + "bbox": [ + 398, + 569, + 487, + 582 + ], + "score": 0.93, + "content": "1 - \\Psi _ { g } ( \\theta ) = \\Psi _ { g } ( - \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 568, + 505, + 583 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 578, + 207, + 596 + ], + "spans": [ + { + "bbox": [ + 104, + 578, + 187, + 596 + ], + "score": 1.0, + "content": "the monotonicity of", + "type": "text" + }, + { + "bbox": [ + 188, + 581, + 201, + 593 + ], + "score": 0.89, + "content": "\\Psi _ { g }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 578, + 207, + 596 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 104, + 568, + 505, + 596 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 599, + 425, + 738 + ], + "lines": [ + { + "bbox": [ + 191, + 599, + 425, + 738 + ], + "spans": [ + { + "bbox": [ + 191, + 599, + 425, + 738 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) + \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 } \\\\ & { \\iff \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 - \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) } \\\\ & { \\iff \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq \\Psi _ { g } \\Big ( \\frac { \\epsilon } { \\sigma } - \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) \\Big ) } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\geq \\frac { \\epsilon } { \\sigma } - \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) + \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } ~ . } \\end{array}", + "type": "interline_equation", + "image_path": "4d80a7976e68909109e1cc49626132aafc1a6bd8ab300b430d407f112e083c27.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 191, + 599, + 425, + 614.4444444444445 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 191, + 614.4444444444445, + 425, + 629.8888888888889 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 191, + 629.8888888888889, + 425, + 645.3333333333334 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 191, + 645.3333333333334, + 425, + 660.7777777777778 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 191, + 660.7777777777778, + 425, + 676.2222222222223 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 191, + 676.2222222222223, + 425, + 691.6666666666667 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 191, + 691.6666666666667, + 425, + 707.1111111111112 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 191, + 707.1111111111112, + 425, + 722.5555555555557 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 191, + 722.5555555555557, + 425, + 738.0000000000001 + ], + "spans": [], + "index": 32 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 243, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 244, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 244, + 95 + ], + "score": 1.0, + "content": "A.7.3 RELATION TO PIXELDP", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 101, + 505, + 149 + ], + "lines": [ + { + "bbox": [ + 105, + 101, + 505, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 101, + 505, + 115 + ], + "score": 1.0, + "content": "Pixel differential privacy (pixelDP) was introduced in Lecuyer et al. (2019) using the same similarity", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 112, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 104, + 112, + 462, + 125 + ], + "score": 1.0, + "content": "measure between distributions used in differential privacy: a distribution-valued function", + "type": "text" + }, + { + "bbox": [ + 462, + 112, + 505, + 123 + ], + "score": 0.9, + "content": "G : \\mathbb { R } ^ { d } \\overset { } { }", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 122, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 107, + 123, + 131, + 136 + ], + "score": 0.91, + "content": "\\mathcal { P } ( \\mathcal { Z } )", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 122, + 167, + 137 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 167, + 124, + 190, + 136 + ], + "score": 0.91, + "content": "( \\varepsilon , \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 122, + 287, + 137 + ], + "score": 1.0, + "content": "-pixelDP with respect to", + "type": "text" + }, + { + "bbox": [ + 287, + 124, + 297, + 136 + ], + "score": 0.86, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 122, + 394, + 137 + ], + "score": 1.0, + "content": "perturbations if for any", + "type": "text" + }, + { + "bbox": [ + 395, + 123, + 454, + 138 + ], + "score": 0.93, + "content": "\\| x - x ^ { \\prime } \\| _ { p } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 122, + 506, + 137 + ], + "score": 1.0, + "content": "it holds that", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 136, + 246, + 150 + ], + "spans": [ + { + "bbox": [ + 107, + 136, + 214, + 149 + ], + "score": 0.92, + "content": "D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( G ( x ) \\| G ( x ^ { \\prime } ) ) \\leq \\tau", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 136, + 246, + 150 + ], + "score": 1.0, + "content": ", where", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 153, + 453, + 181 + ], + "lines": [ + { + "bbox": [ + 157, + 153, + 453, + 181 + ], + "spans": [ + { + "bbox": [ + 157, + 153, + 453, + 181 + ], + "score": 0.95, + "content": "D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( G ( x ) \\| G ( x ^ { \\prime } ) ) = \\operatorname* { s u p } _ { E } \\left( \\operatorname* { l i p } _ { X \\sim G ( x ) } [ X \\in E ] - e ^ { \\varepsilon } \\operatorname* { l i p } _ { X ^ { \\prime } \\sim G ( x ^ { \\prime } ) } [ X ^ { \\prime } \\in E ] \\right)", + "type": "interline_equation", + "image_path": "9f1b689031d3bcfe71fe78902acdf6b49b08ab29dca1a223d37cf55541f12bb5.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 157, + 153, + 453, + 181 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 505, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 186, + 506, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 314, + 198 + ], + "score": 1.0, + "content": "and the supremum is over all (measurable) subsets", + "type": "text" + }, + { + "bbox": [ + 315, + 187, + 323, + 196 + ], + "score": 0.84, + "content": "E", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 186, + 336, + 198 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 336, + 187, + 345, + 196 + ], + "score": 0.81, + "content": "\\mathcal { Z }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 186, + 506, + 198 + ], + "score": 1.0, + "content": ". In particular, Lecuyer et al. show that", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 197, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 222, + 209 + ], + "score": 1.0, + "content": "using a smoothing measure", + "type": "text" + }, + { + "bbox": [ + 222, + 199, + 230, + 209 + ], + "score": 0.83, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 197, + 374, + 209 + ], + "score": 1.0, + "content": "satisfying pixelDP with respect to", + "type": "text" + }, + { + "bbox": [ + 375, + 198, + 385, + 207 + ], + "score": 0.85, + "content": "\\ell ^ { p \\ }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 197, + 505, + 209 + ], + "score": 1.0, + "content": "leads to adversarially robust", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 207, + 248, + 221 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 179, + 221 + ], + "score": 1.0, + "content": "classifiers against", + "type": "text" + }, + { + "bbox": [ + 179, + 209, + 189, + 218 + ], + "score": 0.83, + "content": "\\ell ^ { p \\ }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 207, + 248, + 221 + ], + "score": 1.0, + "content": "perturbations.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 224, + 506, + 272 + ], + "lines": [ + { + "bbox": [ + 105, + 224, + 504, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 409, + 237 + ], + "score": 1.0, + "content": "To show that their result fits as a particular instance of our framework, take", + "type": "text" + }, + { + "bbox": [ + 410, + 225, + 448, + 237 + ], + "score": 0.91, + "content": "\\rho = \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 224, + 479, + 237 + ], + "score": 1.0, + "content": "and fix", + "type": "text" + }, + { + "bbox": [ + 480, + 225, + 504, + 236 + ], + "score": 0.88, + "content": "\\varepsilon \\geq 0", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 235, + 506, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 123, + 249 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 236, + 161, + 248 + ], + "score": 0.92, + "content": "\\tau \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 235, + 313, + 249 + ], + "score": 1.0, + "content": ". Due to the symmetry of the constraint", + "type": "text" + }, + { + "bbox": [ + 314, + 236, + 373, + 250 + ], + "score": 0.93, + "content": "\\| x - x ^ { \\prime } \\| _ { p } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 235, + 385, + 249 + ], + "score": 1.0, + "content": ", if", + "type": "text" + }, + { + "bbox": [ + 385, + 237, + 392, + 248 + ], + "score": 0.81, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 235, + 426, + 249 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 426, + 237, + 449, + 248 + ], + "score": 0.9, + "content": "( \\varepsilon , \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 235, + 506, + 249 + ], + "score": 1.0, + "content": "-pixelDP with", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 248, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 104, + 248, + 147, + 263 + ], + "score": 1.0, + "content": "respect to", + "type": "text" + }, + { + "bbox": [ + 147, + 249, + 158, + 261 + ], + "score": 0.88, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 248, + 370, + 263 + ], + "score": 1.0, + "content": "perturbations, then we have the relaxation condition", + "type": "text" + }, + { + "bbox": [ + 370, + 248, + 503, + 263 + ], + "score": 0.92, + "content": "\\{ \\mu ( x ^ { \\prime } ) : \\| x - x ^ { \\prime } \\| _ { p } \\leq 1 \\} \\subseteq { \\mathcal { D } } _ { \\varepsilon , \\tau }", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 248, + 506, + 263 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 259, + 135, + 274 + ], + "spans": [ + { + "bbox": [ + 104, + 259, + 135, + 274 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10.5 + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 277, + 420, + 291 + ], + "lines": [ + { + "bbox": [ + 190, + 277, + 420, + 291 + ], + "spans": [ + { + "bbox": [ + 190, + 277, + 420, + 291 + ], + "score": 0.87, + "content": "\\mathscr { D } _ { \\varepsilon , \\tau } = \\{ \\nu : D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\nu \\| \\rho ) \\leq \\tau \\ \\mathrm { a n d } \\ D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\rho \\| \\nu ) \\leq \\tau \\} .", + "type": "interline_equation", + "image_path": "9fd634058add18330f3e465e3f2ec16708c99ced0c3f42b06e12595a9bf2d871.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 190, + 277, + 420, + 291 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 296, + 506, + 341 + ], + "lines": [ + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 340, + 309 + ], + "score": 1.0, + "content": "Now we recall that Barthe & Olmedo (2013) noticed that", + "type": "text" + }, + { + "bbox": [ + 340, + 297, + 371, + 309 + ], + "score": 0.93, + "content": "D _ { \\mathrm { D P } , e ^ { \\varepsilon } }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "is equivalent to the hockey-stick", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 307, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 153, + 321 + ], + "score": 1.0, + "content": "divergence", + "type": "text" + }, + { + "bbox": [ + 153, + 308, + 180, + 320 + ], + "score": 0.91, + "content": "D _ { \\mathrm { H S } , \\beta }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 307, + 217, + 321 + ], + "score": 1.0, + "content": "of order", + "type": "text" + }, + { + "bbox": [ + 217, + 308, + 247, + 319 + ], + "score": 0.91, + "content": "\\beta = e ^ { \\varepsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 307, + 301, + 321 + ], + "score": 1.0, + "content": ". Thus, since", + "type": "text" + }, + { + "bbox": [ + 302, + 308, + 308, + 319 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 307, + 506, + 321 + ], + "score": 1.0, + "content": "-divergences are closed under reversal (property", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 318, + 507, + 332 + ], + "spans": [ + { + "bbox": [ + 104, + 318, + 309, + 332 + ], + "score": 1.0, + "content": "4 in Appendix A.2), we see that the constraint set", + "type": "text" + }, + { + "bbox": [ + 310, + 319, + 330, + 331 + ], + "score": 0.92, + "content": "\\mathcal { D } _ { \\varepsilon , \\tau }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 318, + 473, + 332 + ], + "score": 1.0, + "content": "can be directly written in the form", + "type": "text" + }, + { + "bbox": [ + 474, + 319, + 489, + 330 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 318, + 507, + 332 + ], + "score": 1.0, + "content": "(cf.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 330, + 159, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 159, + 342 + ], + "score": 1.0, + "content": "Section 2.2).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 106, + 346, + 506, + 380 + ], + "lines": [ + { + "bbox": [ + 106, + 346, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 106, + 346, + 506, + 359 + ], + "score": 1.0, + "content": "The main result in Lecuyer et al. (2019) is a limited-information black-box certification method for", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 356, + 507, + 372 + ], + "spans": [ + { + "bbox": [ + 104, + 356, + 482, + 372 + ], + "score": 1.0, + "content": "smoothed classifiers. The resulting certificate for, which provides certification with respect to", + "type": "text" + }, + { + "bbox": [ + 483, + 358, + 502, + 370 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { \\varepsilon , \\tau }", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 356, + 507, + 372 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 368, + 153, + 383 + ], + "spans": [ + { + "bbox": [ + 104, + 368, + 153, + 383 + ], + "score": 1.0, + "content": "is given by", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "interline_equation", + "bbox": [ + 268, + 385, + 343, + 411 + ], + "lines": [ + { + "bbox": [ + 268, + 385, + 343, + 411 + ], + "spans": [ + { + "bbox": [ + 268, + 385, + 343, + 411 + ], + "score": 0.95, + "content": "\\tau \\leq \\frac { \\theta _ { a } - e ^ { 2 \\varepsilon } \\theta _ { b } } { e ^ { \\varepsilon } + 1 } \\ .", + "type": "interline_equation", + "image_path": "fa36bad6cb3deed37e6fede9c5cae78ad71ded04ffe4167d5788bd473783ceb0.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 268, + 385, + 343, + 411 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 416, + 505, + 461 + ], + "lines": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 351, + 429 + ], + "score": 1.0, + "content": "For comparison, the certificate we obtain for the relaxation", + "type": "text" + }, + { + "bbox": [ + 352, + 416, + 451, + 429 + ], + "score": 0.92, + "content": "\\{ \\nu : D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\nu \\| \\rho ) \\leq \\tau \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 415, + 464, + 429 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 465, + 417, + 484, + 428 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\varepsilon , \\tau }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 415, + 505, + 429 + ], + "score": 1.0, + "content": "(HS", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 427, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 460, + 440 + ], + "score": 1.0, + "content": "certificate in Table 4) already improves on the certificate by Lecuyer et al. whenever", + "type": "text" + }, + { + "bbox": [ + 460, + 428, + 505, + 439 + ], + "score": 0.89, + "content": "\\theta _ { a } - \\theta _ { b } \\geq", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 438, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 106, + 438, + 193, + 451 + ], + "score": 0.9, + "content": "( \\beta - 1 ) ( 1 - \\theta _ { a } - \\theta _ { b } )", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 438, + 506, + 451 + ], + "score": 1.0, + "content": ", which, e.g., always holds in the binary classification case. Furthermore, since", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 449, + 412, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 449, + 281, + 462 + ], + "score": 1.0, + "content": "Theorem 2 provides optimal certificates for", + "type": "text" + }, + { + "bbox": [ + 282, + 450, + 290, + 459 + ], + "score": 0.81, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 449, + 412, + 462 + ], + "score": 1.0, + "content": ", we have the following result.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 464, + 505, + 487 + ], + "lines": [ + { + "bbox": [ + 106, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 343, + 477 + ], + "score": 1.0, + "content": "Corollary 7. The optimal certificates for the constraint set", + "type": "text" + }, + { + "bbox": [ + 343, + 465, + 352, + 474 + ], + "score": 0.81, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "(cf. Eq. 20) obtained from Theorem 2", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 475, + 289, + 488 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 289, + 488 + ], + "score": 1.0, + "content": "are stronger than those obtained from Eq. 21.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "title", + "bbox": [ + 107, + 500, + 458, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 500, + 459, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 127, + 513 + ], + "score": 1.0, + "content": "A.8", + "type": "text" + }, + { + "bbox": [ + 130, + 500, + 459, + 513 + ], + "score": 1.0, + "content": "EFFICIENT SAMPLING AND F-DIVERGENCE COMPUTATION FOR NORM-BASED", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 132, + 513, + 235, + 523 + ], + "spans": [ + { + "bbox": [ + 132, + 513, + 235, + 523 + ], + "score": 1.0, + "content": "SMOOTHING MEASURES", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 531, + 503, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 530, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 248, + 546 + ], + "score": 1.0, + "content": "Lemma 8. The smoothing measure", + "type": "text" + }, + { + "bbox": [ + 249, + 532, + 312, + 544 + ], + "score": 0.93, + "content": "\\mu : \\mathcal { X } \\mapsto \\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 530, + 362, + 546 + ], + "score": 1.0, + "content": "with density", + "type": "text" + }, + { + "bbox": [ + 363, + 532, + 470, + 544 + ], + "score": 0.91, + "content": "\\mu ( x ) [ z ] \\propto \\exp ( - \\| z - x \\| )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 530, + 505, + 546 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 237, + 548, + 371, + 569 + ], + "lines": [ + { + "bbox": [ + 237, + 548, + 371, + 569 + ], + "spans": [ + { + "bbox": [ + 237, + 548, + 371, + 569 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } R _ { \\infty } ( \\mu ( x + \\delta ) \\| \\mu ( x ) ) \\leq \\epsilon .", + "type": "interline_equation", + "image_path": "e140f53b9f929f4368bb935dc78a486b96910daff8e9c2d9b5cdc1927cf73670.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 237, + 548, + 371, + 569 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 575, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 575, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 116, + 589 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 116, + 577, + 132, + 588 + ], + "score": 0.91, + "content": "\\| x \\|", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 575, + 233, + 589 + ], + "score": 1.0, + "content": "is any norm. Further, if", + "type": "text" + }, + { + "bbox": [ + 234, + 577, + 240, + 588 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 575, + 341, + 589 + ], + "score": 1.0, + "content": "is convex function with", + "type": "text" + }, + { + "bbox": [ + 341, + 576, + 380, + 588 + ], + "score": 0.93, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 575, + 421, + 589 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 422, + 575, + 444, + 589 + ], + "score": 0.93, + "content": "f { \\bigl ( } { \\frac { 1 } { u } } { \\bigr ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 575, + 505, + 589 + ], + "score": 1.0, + "content": "is convex and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 586, + 251, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 220, + 599 + ], + "score": 1.0, + "content": "monotonically increasing in", + "type": "text" + }, + { + "bbox": [ + 221, + 590, + 227, + 596 + ], + "score": 0.78, + "content": "u", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 586, + 251, + 599 + ], + "score": 1.0, + "content": ", then", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "interline_equation", + "bbox": [ + 156, + 603, + 454, + 624 + ], + "lines": [ + { + "bbox": [ + 156, + 603, + 454, + 624 + ], + "spans": [ + { + "bbox": [ + 156, + 603, + 454, + 624 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } D _ { f } ( \\mu ( x + \\delta ) \\| \\mu ( x ) ) \\leq \\operatorname* { m a x } _ { \\| \\delta \\| = \\epsilon } \\mathrm { ~ E ~ } _ { \\sim \\mu ( 0 ) } [ f ( \\exp ( - \\| X - \\delta \\| + \\| X \\| ) ) ] \\enspace .", + "type": "interline_equation", + "image_path": "5d753c572a0cc98ddbb204871c09c2e4f75ab341a3709973bd7461f7332d52f4.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 156, + 603, + 454, + 624 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 635, + 277, + 647 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 277, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 277, + 649 + ], + "score": 1.0, + "content": "Proof. By the triangle inequality, we have", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 651, + 420, + 679 + ], + "lines": [ + { + "bbox": [ + 192, + 651, + 420, + 679 + ], + "spans": [ + { + "bbox": [ + 192, + 651, + 420, + 679 + ], + "score": 0.92, + "content": "\\frac { \\mu ( x ^ { \\prime } ) [ z ] } { \\mu ( x ) [ z ] } = \\exp ( \\| z - x \\| - \\| z - x ^ { \\prime } \\| ) \\leq \\exp ( \\| x - x ^ { \\prime } \\| )", + "type": "interline_equation", + "image_path": "78916c1986f847acc445737353a19404b81ce36c38e005cc176f21d363977ec6.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 192, + 651, + 420, + 679 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 684, + 135, + 695 + ], + "lines": [ + { + "bbox": [ + 104, + 682, + 136, + 695 + ], + "spans": [ + { + "bbox": [ + 104, + 682, + 136, + 695 + ], + "score": 1.0, + "content": "so that", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "interline_equation", + "bbox": [ + 240, + 693, + 371, + 707 + ], + "lines": [ + { + "bbox": [ + 240, + 693, + 371, + 707 + ], + "spans": [ + { + "bbox": [ + 240, + 693, + 371, + 707 + ], + "score": 0.91, + "content": "R _ { \\infty } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) \\leq \\| x - x ^ { \\prime } \\| .", + "type": "interline_equation", + "image_path": "0bda3f23e0d06d5cb501f45f2a47b68740e8b4fc95e9388244a0169adf013bd7.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 240, + 693, + 371, + 707 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 709, + 507, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 163, + 723 + ], + "score": 1.0, + "content": "Similarly, for", + "type": "text" + }, + { + "bbox": [ + 163, + 710, + 171, + 721 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 708, + 426, + 723 + ], + "score": 1.0, + "content": "that satisfy the conditions of the theorem, it can be shown that", + "type": "text" + }, + { + "bbox": [ + 426, + 709, + 494, + 722 + ], + "score": 0.91, + "content": "D _ { f } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 147, + 734 + ], + "score": 1.0, + "content": "convex in", + "type": "text" + }, + { + "bbox": [ + 147, + 721, + 156, + 730 + ], + "score": 0.86, + "content": "x ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 720, + 320, + 734 + ], + "score": 1.0, + "content": "so that its maximum over the convex set", + "type": "text" + }, + { + "bbox": [ + 320, + 721, + 374, + 732 + ], + "score": 0.93, + "content": "\\| x ^ { \\prime } - x \\| \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "is attained on the boundary.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + } + ], + "page_idx": 21, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 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": [ + 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": [ + 108, + 82, + 243, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 244, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 244, + 95 + ], + "score": 1.0, + "content": "A.7.3 RELATION TO PIXELDP", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 101, + 505, + 149 + ], + "lines": [ + { + "bbox": [ + 105, + 101, + 505, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 101, + 505, + 115 + ], + "score": 1.0, + "content": "Pixel differential privacy (pixelDP) was introduced in Lecuyer et al. (2019) using the same similarity", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 112, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 104, + 112, + 462, + 125 + ], + "score": 1.0, + "content": "measure between distributions used in differential privacy: a distribution-valued function", + "type": "text" + }, + { + "bbox": [ + 462, + 112, + 505, + 123 + ], + "score": 0.9, + "content": "G : \\mathbb { R } ^ { d } \\overset { } { }", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 122, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 107, + 123, + 131, + 136 + ], + "score": 0.91, + "content": "\\mathcal { P } ( \\mathcal { Z } )", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 122, + 167, + 137 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 167, + 124, + 190, + 136 + ], + "score": 0.91, + "content": "( \\varepsilon , \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 122, + 287, + 137 + ], + "score": 1.0, + "content": "-pixelDP with respect to", + "type": "text" + }, + { + "bbox": [ + 287, + 124, + 297, + 136 + ], + "score": 0.86, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 122, + 394, + 137 + ], + "score": 1.0, + "content": "perturbations if for any", + "type": "text" + }, + { + "bbox": [ + 395, + 123, + 454, + 138 + ], + "score": 0.93, + "content": "\\| x - x ^ { \\prime } \\| _ { p } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 122, + 506, + 137 + ], + "score": 1.0, + "content": "it holds that", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 136, + 246, + 150 + ], + "spans": [ + { + "bbox": [ + 107, + 136, + 214, + 149 + ], + "score": 0.92, + "content": "D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( G ( x ) \\| G ( x ^ { \\prime } ) ) \\leq \\tau", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 136, + 246, + 150 + ], + "score": 1.0, + "content": ", where", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5, + "bbox_fs": [ + 104, + 101, + 506, + 150 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 153, + 453, + 181 + ], + "lines": [ + { + "bbox": [ + 157, + 153, + 453, + 181 + ], + "spans": [ + { + "bbox": [ + 157, + 153, + 453, + 181 + ], + "score": 0.95, + "content": "D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( G ( x ) \\| G ( x ^ { \\prime } ) ) = \\operatorname* { s u p } _ { E } \\left( \\operatorname* { l i p } _ { X \\sim G ( x ) } [ X \\in E ] - e ^ { \\varepsilon } \\operatorname* { l i p } _ { X ^ { \\prime } \\sim G ( x ^ { \\prime } ) } [ X ^ { \\prime } \\in E ] \\right)", + "type": "interline_equation", + "image_path": "9f1b689031d3bcfe71fe78902acdf6b49b08ab29dca1a223d37cf55541f12bb5.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 157, + 153, + 453, + 181 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 505, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 186, + 506, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 314, + 198 + ], + "score": 1.0, + "content": "and the supremum is over all (measurable) subsets", + "type": "text" + }, + { + "bbox": [ + 315, + 187, + 323, + 196 + ], + "score": 0.84, + "content": "E", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 186, + 336, + 198 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 336, + 187, + 345, + 196 + ], + "score": 0.81, + "content": "\\mathcal { Z }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 186, + 506, + 198 + ], + "score": 1.0, + "content": ". In particular, Lecuyer et al. show that", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 197, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 222, + 209 + ], + "score": 1.0, + "content": "using a smoothing measure", + "type": "text" + }, + { + "bbox": [ + 222, + 199, + 230, + 209 + ], + "score": 0.83, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 197, + 374, + 209 + ], + "score": 1.0, + "content": "satisfying pixelDP with respect to", + "type": "text" + }, + { + "bbox": [ + 375, + 198, + 385, + 207 + ], + "score": 0.85, + "content": "\\ell ^ { p \\ }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 197, + 505, + 209 + ], + "score": 1.0, + "content": "leads to adversarially robust", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 207, + 248, + 221 + ], + "spans": [ + { + "bbox": [ + 106, + 207, + 179, + 221 + ], + "score": 1.0, + "content": "classifiers against", + "type": "text" + }, + { + "bbox": [ + 179, + 209, + 189, + 218 + ], + "score": 0.83, + "content": "\\ell ^ { p \\ }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 207, + 248, + 221 + ], + "score": 1.0, + "content": "perturbations.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 186, + 506, + 221 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 224, + 506, + 272 + ], + "lines": [ + { + "bbox": [ + 105, + 224, + 504, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 409, + 237 + ], + "score": 1.0, + "content": "To show that their result fits as a particular instance of our framework, take", + "type": "text" + }, + { + "bbox": [ + 410, + 225, + 448, + 237 + ], + "score": 0.91, + "content": "\\rho = \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 224, + 479, + 237 + ], + "score": 1.0, + "content": "and fix", + "type": "text" + }, + { + "bbox": [ + 480, + 225, + 504, + 236 + ], + "score": 0.88, + "content": "\\varepsilon \\geq 0", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 235, + 506, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 123, + 249 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 236, + 161, + 248 + ], + "score": 0.92, + "content": "\\tau \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 235, + 313, + 249 + ], + "score": 1.0, + "content": ". Due to the symmetry of the constraint", + "type": "text" + }, + { + "bbox": [ + 314, + 236, + 373, + 250 + ], + "score": 0.93, + "content": "\\| x - x ^ { \\prime } \\| _ { p } \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 235, + 385, + 249 + ], + "score": 1.0, + "content": ", if", + "type": "text" + }, + { + "bbox": [ + 385, + 237, + 392, + 248 + ], + "score": 0.81, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 235, + 426, + 249 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 426, + 237, + 449, + 248 + ], + "score": 0.9, + "content": "( \\varepsilon , \\tau )", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 235, + 506, + 249 + ], + "score": 1.0, + "content": "-pixelDP with", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 248, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 104, + 248, + 147, + 263 + ], + "score": 1.0, + "content": "respect to", + "type": "text" + }, + { + "bbox": [ + 147, + 249, + 158, + 261 + ], + "score": 0.88, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 248, + 370, + 263 + ], + "score": 1.0, + "content": "perturbations, then we have the relaxation condition", + "type": "text" + }, + { + "bbox": [ + 370, + 248, + 503, + 263 + ], + "score": 0.92, + "content": "\\{ \\mu ( x ^ { \\prime } ) : \\| x - x ^ { \\prime } \\| _ { p } \\leq 1 \\} \\subseteq { \\mathcal { D } } _ { \\varepsilon , \\tau }", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 248, + 506, + 263 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 259, + 135, + 274 + ], + "spans": [ + { + "bbox": [ + 104, + 259, + 135, + 274 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10.5, + "bbox_fs": [ + 104, + 224, + 506, + 274 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 190, + 277, + 420, + 291 + ], + "lines": [ + { + "bbox": [ + 190, + 277, + 420, + 291 + ], + "spans": [ + { + "bbox": [ + 190, + 277, + 420, + 291 + ], + "score": 0.87, + "content": "\\mathscr { D } _ { \\varepsilon , \\tau } = \\{ \\nu : D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\nu \\| \\rho ) \\leq \\tau \\ \\mathrm { a n d } \\ D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\rho \\| \\nu ) \\leq \\tau \\} .", + "type": "interline_equation", + "image_path": "9fd634058add18330f3e465e3f2ec16708c99ced0c3f42b06e12595a9bf2d871.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 190, + 277, + 420, + 291 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 296, + 506, + 341 + ], + "lines": [ + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 340, + 309 + ], + "score": 1.0, + "content": "Now we recall that Barthe & Olmedo (2013) noticed that", + "type": "text" + }, + { + "bbox": [ + 340, + 297, + 371, + 309 + ], + "score": 0.93, + "content": "D _ { \\mathrm { D P } , e ^ { \\varepsilon } }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "is equivalent to the hockey-stick", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 307, + 506, + 321 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 153, + 321 + ], + "score": 1.0, + "content": "divergence", + "type": "text" + }, + { + "bbox": [ + 153, + 308, + 180, + 320 + ], + "score": 0.91, + "content": "D _ { \\mathrm { H S } , \\beta }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 307, + 217, + 321 + ], + "score": 1.0, + "content": "of order", + "type": "text" + }, + { + "bbox": [ + 217, + 308, + 247, + 319 + ], + "score": 0.91, + "content": "\\beta = e ^ { \\varepsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 307, + 301, + 321 + ], + "score": 1.0, + "content": ". Thus, since", + "type": "text" + }, + { + "bbox": [ + 302, + 308, + 308, + 319 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 307, + 506, + 321 + ], + "score": 1.0, + "content": "-divergences are closed under reversal (property", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 318, + 507, + 332 + ], + "spans": [ + { + "bbox": [ + 104, + 318, + 309, + 332 + ], + "score": 1.0, + "content": "4 in Appendix A.2), we see that the constraint set", + "type": "text" + }, + { + "bbox": [ + 310, + 319, + 330, + 331 + ], + "score": 0.92, + "content": "\\mathcal { D } _ { \\varepsilon , \\tau }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 318, + 473, + 332 + ], + "score": 1.0, + "content": "can be directly written in the form", + "type": "text" + }, + { + "bbox": [ + 474, + 319, + 489, + 330 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 318, + 507, + 332 + ], + "score": 1.0, + "content": "(cf.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 330, + 159, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 159, + 342 + ], + "score": 1.0, + "content": "Section 2.2).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15.5, + "bbox_fs": [ + 104, + 295, + 507, + 342 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 346, + 506, + 380 + ], + "lines": [ + { + "bbox": [ + 106, + 346, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 106, + 346, + 506, + 359 + ], + "score": 1.0, + "content": "The main result in Lecuyer et al. (2019) is a limited-information black-box certification method for", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 356, + 507, + 372 + ], + "spans": [ + { + "bbox": [ + 104, + 356, + 482, + 372 + ], + "score": 1.0, + "content": "smoothed classifiers. The resulting certificate for, which provides certification with respect to", + "type": "text" + }, + { + "bbox": [ + 483, + 358, + 502, + 370 + ], + "score": 0.91, + "content": "\\mathcal { D } _ { \\varepsilon , \\tau }", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 356, + 507, + 372 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 368, + 153, + 383 + ], + "spans": [ + { + "bbox": [ + 104, + 368, + 153, + 383 + ], + "score": 1.0, + "content": "is given by", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 104, + 346, + 507, + 383 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 268, + 385, + 343, + 411 + ], + "lines": [ + { + "bbox": [ + 268, + 385, + 343, + 411 + ], + "spans": [ + { + "bbox": [ + 268, + 385, + 343, + 411 + ], + "score": 0.95, + "content": "\\tau \\leq \\frac { \\theta _ { a } - e ^ { 2 \\varepsilon } \\theta _ { b } } { e ^ { \\varepsilon } + 1 } \\ .", + "type": "interline_equation", + "image_path": "fa36bad6cb3deed37e6fede9c5cae78ad71ded04ffe4167d5788bd473783ceb0.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 268, + 385, + 343, + 411 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 416, + 505, + 461 + ], + "lines": [ + { + "bbox": [ + 105, + 415, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 351, + 429 + ], + "score": 1.0, + "content": "For comparison, the certificate we obtain for the relaxation", + "type": "text" + }, + { + "bbox": [ + 352, + 416, + 451, + 429 + ], + "score": 0.92, + "content": "\\{ \\nu : D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\nu \\| \\rho ) \\leq \\tau \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 415, + 464, + 429 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 465, + 417, + 484, + 428 + ], + "score": 0.89, + "content": "\\mathcal { D } _ { \\varepsilon , \\tau }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 415, + 505, + 429 + ], + "score": 1.0, + "content": "(HS", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 427, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 460, + 440 + ], + "score": 1.0, + "content": "certificate in Table 4) already improves on the certificate by Lecuyer et al. whenever", + "type": "text" + }, + { + "bbox": [ + 460, + 428, + 505, + 439 + ], + "score": 0.89, + "content": "\\theta _ { a } - \\theta _ { b } \\geq", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 438, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 106, + 438, + 193, + 451 + ], + "score": 0.9, + "content": "( \\beta - 1 ) ( 1 - \\theta _ { a } - \\theta _ { b } )", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 438, + 506, + 451 + ], + "score": 1.0, + "content": ", which, e.g., always holds in the binary classification case. Furthermore, since", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 449, + 412, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 449, + 281, + 462 + ], + "score": 1.0, + "content": "Theorem 2 provides optimal certificates for", + "type": "text" + }, + { + "bbox": [ + 282, + 450, + 290, + 459 + ], + "score": 0.81, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 449, + 412, + 462 + ], + "score": 1.0, + "content": ", we have the following result.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 415, + 506, + 462 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 464, + 505, + 487 + ], + "lines": [ + { + "bbox": [ + 106, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 343, + 477 + ], + "score": 1.0, + "content": "Corollary 7. The optimal certificates for the constraint set", + "type": "text" + }, + { + "bbox": [ + 343, + 465, + 352, + 474 + ], + "score": 0.81, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "(cf. Eq. 20) obtained from Theorem 2", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 475, + 289, + 488 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 289, + 488 + ], + "score": 1.0, + "content": "are stronger than those obtained from Eq. 21.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 464, + 505, + 488 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 500, + 458, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 500, + 459, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 127, + 513 + ], + "score": 1.0, + "content": "A.8", + "type": "text" + }, + { + "bbox": [ + 130, + 500, + 459, + 513 + ], + "score": 1.0, + "content": "EFFICIENT SAMPLING AND F-DIVERGENCE COMPUTATION FOR NORM-BASED", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 132, + 513, + 235, + 523 + ], + "spans": [ + { + "bbox": [ + 132, + 513, + 235, + 523 + ], + "score": 1.0, + "content": "SMOOTHING MEASURES", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 531, + 503, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 530, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 530, + 248, + 546 + ], + "score": 1.0, + "content": "Lemma 8. The smoothing measure", + "type": "text" + }, + { + "bbox": [ + 249, + 532, + 312, + 544 + ], + "score": 0.93, + "content": "\\mu : \\mathcal { X } \\mapsto \\mathcal { P } ( \\mathcal { X } )", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 530, + 362, + 546 + ], + "score": 1.0, + "content": "with density", + "type": "text" + }, + { + "bbox": [ + 363, + 532, + 470, + 544 + ], + "score": 0.91, + "content": "\\mu ( x ) [ z ] \\propto \\exp ( - \\| z - x \\| )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 530, + 505, + 546 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 530, + 505, + 546 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 237, + 548, + 371, + 569 + ], + "lines": [ + { + "bbox": [ + 237, + 548, + 371, + 569 + ], + "spans": [ + { + "bbox": [ + 237, + 548, + 371, + 569 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } R _ { \\infty } ( \\mu ( x + \\delta ) \\| \\mu ( x ) ) \\leq \\epsilon .", + "type": "interline_equation", + "image_path": "e140f53b9f929f4368bb935dc78a486b96910daff8e9c2d9b5cdc1927cf73670.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 237, + 548, + 371, + 569 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 575, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 575, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 116, + 589 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 116, + 577, + 132, + 588 + ], + "score": 0.91, + "content": "\\| x \\|", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 575, + 233, + 589 + ], + "score": 1.0, + "content": "is any norm. Further, if", + "type": "text" + }, + { + "bbox": [ + 234, + 577, + 240, + 588 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 575, + 341, + 589 + ], + "score": 1.0, + "content": "is convex function with", + "type": "text" + }, + { + "bbox": [ + 341, + 576, + 380, + 588 + ], + "score": 0.93, + "content": "f ( 1 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 575, + 421, + 589 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 422, + 575, + 444, + 589 + ], + "score": 0.93, + "content": "f { \\bigl ( } { \\frac { 1 } { u } } { \\bigr ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 575, + 505, + 589 + ], + "score": 1.0, + "content": "is convex and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 586, + 251, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 220, + 599 + ], + "score": 1.0, + "content": "monotonically increasing in", + "type": "text" + }, + { + "bbox": [ + 221, + 590, + 227, + 596 + ], + "score": 0.78, + "content": "u", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 586, + 251, + 599 + ], + "score": 1.0, + "content": ", then", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 575, + 505, + 599 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 156, + 603, + 454, + 624 + ], + "lines": [ + { + "bbox": [ + 156, + 603, + 454, + 624 + ], + "spans": [ + { + "bbox": [ + 156, + 603, + 454, + 624 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } D _ { f } ( \\mu ( x + \\delta ) \\| \\mu ( x ) ) \\leq \\operatorname* { m a x } _ { \\| \\delta \\| = \\epsilon } \\mathrm { ~ E ~ } _ { \\sim \\mu ( 0 ) } [ f ( \\exp ( - \\| X - \\delta \\| + \\| X \\| ) ) ] \\enspace .", + "type": "interline_equation", + "image_path": "5d753c572a0cc98ddbb204871c09c2e4f75ab341a3709973bd7461f7332d52f4.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 156, + 603, + 454, + 624 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 635, + 277, + 647 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 277, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 277, + 649 + ], + "score": 1.0, + "content": "Proof. By the triangle inequality, we have", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 633, + 277, + 649 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 651, + 420, + 679 + ], + "lines": [ + { + "bbox": [ + 192, + 651, + 420, + 679 + ], + "spans": [ + { + "bbox": [ + 192, + 651, + 420, + 679 + ], + "score": 0.92, + "content": "\\frac { \\mu ( x ^ { \\prime } ) [ z ] } { \\mu ( x ) [ z ] } = \\exp ( \\| z - x \\| - \\| z - x ^ { \\prime } \\| ) \\leq \\exp ( \\| x - x ^ { \\prime } \\| )", + "type": "interline_equation", + "image_path": "78916c1986f847acc445737353a19404b81ce36c38e005cc176f21d363977ec6.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 192, + 651, + 420, + 679 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 684, + 135, + 695 + ], + "lines": [ + { + "bbox": [ + 104, + 682, + 136, + 695 + ], + "spans": [ + { + "bbox": [ + 104, + 682, + 136, + 695 + ], + "score": 1.0, + "content": "so that", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37, + "bbox_fs": [ + 104, + 682, + 136, + 695 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 240, + 693, + 371, + 707 + ], + "lines": [ + { + "bbox": [ + 240, + 693, + 371, + 707 + ], + "spans": [ + { + "bbox": [ + 240, + 693, + 371, + 707 + ], + "score": 0.91, + "content": "R _ { \\infty } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) \\leq \\| x - x ^ { \\prime } \\| .", + "type": "interline_equation", + "image_path": "0bda3f23e0d06d5cb501f45f2a47b68740e8b4fc95e9388244a0169adf013bd7.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 240, + 693, + 371, + 707 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 709, + 507, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 163, + 723 + ], + "score": 1.0, + "content": "Similarly, for", + "type": "text" + }, + { + "bbox": [ + 163, + 710, + 171, + 721 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 708, + 426, + 723 + ], + "score": 1.0, + "content": "that satisfy the conditions of the theorem, it can be shown that", + "type": "text" + }, + { + "bbox": [ + 426, + 709, + 494, + 722 + ], + "score": 0.91, + "content": "D _ { f } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 708, + 506, + 723 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 147, + 734 + ], + "score": 1.0, + "content": "convex in", + "type": "text" + }, + { + "bbox": [ + 147, + 721, + 156, + 730 + ], + "score": 0.86, + "content": "x ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 720, + 320, + 734 + ], + "score": 1.0, + "content": "so that its maximum over the convex set", + "type": "text" + }, + { + "bbox": [ + 320, + 721, + 374, + 732 + ], + "score": 0.93, + "content": "\\| x ^ { \\prime } - x \\| \\leq \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "is attained on the boundary.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 708, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 506, + 162 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "For several norms, the optimization problem in Eq. 22 can be solved in closed form. These include", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 146, + 105 + ], + "score": 0.92, + "content": "\\ell _ { 1 } , \\ell _ { 2 } , \\ell _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 93, + 485, + 107 + ], + "score": 1.0, + "content": "norms and the matrix spectral norm and nuclear norm (the final two are relevant when", + "type": "text" + }, + { + "bbox": [ + 485, + 94, + 495, + 104 + ], + "score": 0.81, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 93, + 506, + 107 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 104, + 104, + 394, + 118 + ], + "score": 1.0, + "content": "a space of matrices). The results are documented in Table 5. Thus, every", + "type": "text" + }, + { + "bbox": [ + 394, + 105, + 401, + 116 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "-divergence that meets the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "score": 1.0, + "content": "conditions of Lemma 8 can be estimated efficiently for these norms. In particular, the divergences", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 243, + 141 + ], + "score": 1.0, + "content": "that are induced by the functions", + "type": "text" + }, + { + "bbox": [ + 243, + 126, + 275, + 140 + ], + "score": 0.94, + "content": "\\tilde { f } ( u ^ { - \\alpha } )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 127, + 422, + 141 + ], + "score": 1.0, + "content": "for any monotonic convex function", + "type": "text" + }, + { + "bbox": [ + 423, + 126, + 430, + 140 + ], + "score": 0.85, + "content": "\\tilde { f }", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 127, + 448, + 141 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 448, + 128, + 475, + 139 + ], + "score": 0.89, + "content": "\\alpha \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 127, + 506, + 141 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 138, + 506, + 152 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 316, + 152 + ], + "score": 1.0, + "content": "this constraint. This gives us a very flexible class of", + "type": "text" + }, + { + "bbox": [ + 316, + 139, + 323, + 150 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 138, + 506, + 152 + ], + "score": 1.0, + "content": "-divergences that can be efficiently estimated", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 280, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 280, + 163 + ], + "score": 1.0, + "content": "for these norm-based smoothing measures.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3 + }, + { + "type": "table", + "bbox": [ + 105, + 170, + 531, + 413 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 105, + 170, + 531, + 413 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 170, + 531, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 531, + 413 + ], + "score": 0.983, + "html": "
Constraint on δ|Bound on Eq. 22Constraint on δ|Bound on Eq. 22Sampling from X ~ μ(0)
|δl ≤εE[f(exp(-eoll-X))]X~μ1(0)Xi ~ Lap(0,1) iid
1l2≤ eE(o[f(exp(IX-eoll-X2))]X~μ2(0)X=RuR~Γ(d,1)u ~U(aB2)
≤eE[f(exp(X-e1|-X)]X~μ(0)X=RuR~ Γ(d+1,1)u EU(B)
|/ lnuc ≤ e[f(exp(||U[[s]]vT-e[[eo]|lnuc- |slli)]s~μ1(0)U,v~u(O)X=U[s]]VTs ~ μ1,U,V ~U(O)
≤eE [f(exp(|IU[[s]]vT-∈[e]|l, - |sll)]s~μ∞(x)U,v~u(O)X=U[[s]IVTs ~ μ∞,U,V ~U(O)
", + "type": "table", + "image_path": "8893e040d5a4027982ce145fe311f9b6b73c059b06165522586c1618fdbeb732.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 105, + 170, + 531, + 251.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 105, + 251.0, + 531, + 332.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 105, + 332.0, + 531, + 413.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 420, + 506, + 466 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 185, + 433 + ], + "score": 1.0, + "content": "Table 5: Bounds on", + "type": "text" + }, + { + "bbox": [ + 185, + 421, + 192, + 433 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 421, + 246, + 433 + ], + "score": 1.0, + "content": "-divergences:", + "type": "text" + }, + { + "bbox": [ + 246, + 423, + 257, + 432 + ], + "score": 0.85, + "content": "e _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "is the vector with 1 in the first coordinate and zeros in all other", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 359, + 444 + ], + "score": 1.0, + "content": "coordinates and 1 is the vector with all coordinates equal to 1.", + "type": "text" + }, + { + "bbox": [ + 360, + 433, + 372, + 444 + ], + "score": 0.86, + "content": "\\mu _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "refers to the smoothing measure", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 443, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 165, + 455 + ], + "score": 1.0, + "content": "induced by the", + "type": "text" + }, + { + "bbox": [ + 166, + 443, + 176, + 455 + ], + "score": 0.85, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 443, + 202, + 455 + ], + "score": 1.0, + "content": "norm,", + "type": "text" + }, + { + "bbox": [ + 203, + 443, + 226, + 454 + ], + "score": 0.84, + "content": "\\mathcal { U } ( S )", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 443, + 391, + 455 + ], + "score": 1.0, + "content": "refers to the uniform measure over the set", + "type": "text" + }, + { + "bbox": [ + 391, + 443, + 399, + 453 + ], + "score": 0.73, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 443, + 403, + 455 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 403, + 443, + 412, + 453 + ], + "score": 0.7, + "content": "\\mathcal { O }", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 443, + 505, + 455 + ], + "score": 1.0, + "content": "is the set of orthogonal", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 453, + 356, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 159, + 467 + ], + "score": 1.0, + "content": "matrices and", + "type": "text" + }, + { + "bbox": [ + 160, + 454, + 233, + 468 + ], + "score": 0.93, + "content": "\\hat { B _ { p } } { = } \\left\\{ \\| z \\| _ { p } \\leq 1 \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 453, + 318, + 467 + ], + "score": 1.0, + "content": "is the unit ball in the", + "type": "text" + }, + { + "bbox": [ + 318, + 454, + 329, + 466 + ], + "score": 0.88, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 453, + 356, + 467 + ], + "score": 1.0, + "content": "norm.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + } + ], + "index": 9.75 + }, + { + "type": "text", + "bbox": [ + 107, + 486, + 505, + 530 + ], + "lines": [ + { + "bbox": [ + 105, + 486, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 499 + ], + "score": 1.0, + "content": "Efficient sampling The only other requirement for obtaining a certificate computationally is to be", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 190, + 510 + ], + "score": 1.0, + "content": "able to sample from", + "type": "text" + }, + { + "bbox": [ + 191, + 497, + 211, + 510 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 497, + 259, + 510 + ], + "score": 1.0, + "content": "to estimate", + "type": "text" + }, + { + "bbox": [ + 260, + 498, + 283, + 509 + ], + "score": 0.92, + "content": "\\theta _ { a } , \\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 497, + 313, + 510 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 314, + 497, + 334, + 510 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "is log-concave, there are general purpose", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 509, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 506, + 520 + ], + "score": 1.0, + "content": "polynomial time algorithms for sampling from this measure. However, for most norms, more efficient", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 519, + 240, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 240, + 531 + ], + "score": 1.0, + "content": "methods exist, as outlined below.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 106, + 535, + 505, + 614 + ], + "lines": [ + { + "bbox": [ + 105, + 534, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 194, + 549 + ], + "score": 1.0, + "content": "The random variable", + "type": "text" + }, + { + "bbox": [ + 194, + 536, + 238, + 548 + ], + "score": 0.93, + "content": "X \\sim \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 534, + 317, + 549 + ], + "score": 1.0, + "content": "can be obtained as", + "type": "text" + }, + { + "bbox": [ + 318, + 536, + 368, + 546 + ], + "score": 0.91, + "content": "X = x + Z", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 534, + 390, + 549 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 390, + 536, + 432, + 548 + ], + "score": 0.92, + "content": "Z \\sim \\mu ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 534, + 506, + 549 + ], + "score": 1.0, + "content": ". Thus, to sample", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 546, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 128, + 561 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 128, + 547, + 149, + 559 + ], + "score": 0.91, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 546, + 181, + 561 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 181, + 549, + 188, + 557 + ], + "score": 0.74, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 546, + 343, + 561 + ], + "score": 1.0, + "content": "it is enough to be able to sample from", + "type": "text" + }, + { + "bbox": [ + 343, + 547, + 362, + 559 + ], + "score": 0.88, + "content": "\\mu ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 546, + 384, + 561 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 384, + 547, + 401, + 559 + ], + "score": 0.9, + "content": "\\left\\| \\cdot \\right\\| _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 546, + 505, + 561 + ], + "score": 1.0, + "content": ", this reduces to sampling", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 555, + 506, + 572 + ], + "spans": [ + { + "bbox": [ + 104, + 555, + 349, + 572 + ], + "score": 1.0, + "content": "from a Laplace distribution which can be done easily. For", + "type": "text" + }, + { + "bbox": [ + 349, + 559, + 370, + 570 + ], + "score": 0.9, + "content": "\\left\\| \\cdot \\right\\| _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 555, + 506, + 572 + ], + "score": 1.0, + "content": ", (Steinke & Ullman, 2016) give", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 568, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 336, + 582 + ], + "score": 1.0, + "content": "the following efficient sampling procedure: first sample", + "type": "text" + }, + { + "bbox": [ + 337, + 572, + 343, + 579 + ], + "score": 0.73, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 568, + 506, + 582 + ], + "score": 1.0, + "content": "from a Gamma distribution with shape", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 580, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 107, + 580, + 129, + 591 + ], + "score": 0.89, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 130, + 580, + 171, + 592 + ], + "score": 1.0, + "content": "and mean", + "type": "text" + }, + { + "bbox": [ + 171, + 580, + 193, + 591 + ], + "score": 0.89, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 580, + 211, + 592 + ], + "score": 1.0, + "content": ", i.e.", + "type": "text" + }, + { + "bbox": [ + 212, + 580, + 276, + 592 + ], + "score": 0.93, + "content": "\\bar { r } \\sim \\bar { \\Gamma } ( \\bar { d } + 1 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 580, + 366, + 592 + ], + "score": 1.0, + "content": ", and then sample each", + "type": "text" + }, + { + "bbox": [ + 366, + 580, + 377, + 591 + ], + "score": 0.76, + "content": "Z _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 580, + 380, + 592 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 381, + 580, + 408, + 592 + ], + "score": 0.84, + "content": "i \\in [ d ]", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 580, + 475, + 592 + ], + "score": 1.0, + "content": ", uniformly from", + "type": "text" + }, + { + "bbox": [ + 476, + 580, + 503, + 592 + ], + "score": 0.92, + "content": "[ - r , r ]", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 580, + 506, + 592 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "Theorem 9 gives a short proof of correctness for this procedure. Theorem 10 also has a similar result", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 601, + 428, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 166, + 615 + ], + "score": 1.0, + "content": "for the case of", + "type": "text" + }, + { + "bbox": [ + 166, + 602, + 184, + 614 + ], + "score": 0.91, + "content": "\\lVert \\cdot \\rVert _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 601, + 428, + 615 + ], + "score": 1.0, + "content": "and Table 5 lists the sampling procedures for several norms.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 618, + 502, + 643 + ], + "lines": [ + { + "bbox": [ + 105, + 616, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 249, + 632 + ], + "score": 1.0, + "content": "Theorem 9. The random variable", + "type": "text" + }, + { + "bbox": [ + 249, + 617, + 284, + 629 + ], + "score": 0.91, + "content": "Z \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 616, + 396, + 632 + ], + "score": 1.0, + "content": "obtained by first sampling", + "type": "text" + }, + { + "bbox": [ + 396, + 618, + 465, + 631 + ], + "score": 0.92, + "content": "R \\sim \\Gamma ( d + 1 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 616, + 505, + 632 + ], + "score": 1.0, + "content": "and then", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 630, + 407, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 166, + 644 + ], + "score": 1.0, + "content": "sampling each", + "type": "text" + }, + { + "bbox": [ + 167, + 631, + 177, + 642 + ], + "score": 0.77, + "content": "Z _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 630, + 181, + 644 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 181, + 631, + 209, + 643 + ], + "score": 0.78, + "content": "i \\in [ d ]", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 630, + 277, + 644 + ], + "score": 1.0, + "content": ", uniformly from", + "type": "text" + }, + { + "bbox": [ + 277, + 631, + 311, + 643 + ], + "score": 0.92, + "content": "[ - R , R ]", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 630, + 359, + 644 + ], + "score": 1.0, + "content": "has density", + "type": "text" + }, + { + "bbox": [ + 360, + 630, + 401, + 641 + ], + "score": 0.9, + "content": "\\propto e ^ { - \\| z \\| _ { \\infty } }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 630, + 407, + 644 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 657, + 504, + 669 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 504, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 414, + 671 + ], + "score": 1.0, + "content": "Proof. We first compute the normalization constant for a density of the form", + "type": "text" + }, + { + "bbox": [ + 415, + 657, + 456, + 668 + ], + "score": 0.9, + "content": "\\propto e ^ { - \\| z \\| _ { \\infty } }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 655, + 504, + 671 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "interline_equation", + "bbox": [ + 134, + 675, + 476, + 703 + ], + "lines": [ + { + "bbox": [ + 134, + 675, + 476, + 703 + ], + "spans": [ + { + "bbox": [ + 134, + 675, + 476, + 703 + ], + "score": 0.92, + "content": "\\int _ { \\mathbb { R } ^ { d } } e ^ { - \\| z \\| _ { \\infty } } d z = \\int _ { 0 } ^ { \\infty } \\left( \\int _ { \\mathbb { R } ^ { d } } 1 [ \\| z \\| _ { \\infty } = t ] d z \\right) e ^ { - t } d t = \\int _ { 0 } ^ { \\infty } 2 ^ { d } d t ^ { d - 1 } e ^ { - t } d t = d ! 2 ^ { d } \\ .", + "type": "interline_equation", + "image_path": "b760f4fd1dd9d5eb592c9d225b8a48b89541f8684a236f84bb1a025ea84d30c9.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 134, + 675, + 476, + 703 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 708, + 507, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 707, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 229, + 723 + ], + "score": 1.0, + "content": "Next we show the density of", + "type": "text" + }, + { + "bbox": [ + 229, + 710, + 238, + 720 + ], + "score": 0.83, + "content": "Z", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 707, + 275, + 723 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 275, + 708, + 378, + 722 + ], + "score": 0.93, + "content": "p _ { Z } ( z ) = e ^ { - \\| z \\| _ { \\infty } } / ( d ! 2 ^ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 707, + 506, + 723 + ], + "score": 1.0, + "content": "by noting that conditioned on", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 107, + 719, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 107, + 721, + 135, + 731 + ], + "score": 0.89, + "content": "R = r", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 719, + 173, + 734 + ], + "score": 1.0, + "content": "we have", + "type": "text" + }, + { + "bbox": [ + 173, + 720, + 312, + 733 + ], + "score": 0.93, + "content": "p _ { Z | R = r } ( \\bar { z } ) = 1 [ \\| z \\| _ { \\infty } \\leq r ] / ( 2 r ) ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 719, + 506, + 734 + ], + "score": 1.0, + "content": "because of the uniform sampling used in each", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + } + ], + "page_idx": 22, + "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": [ + 298, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 506, + 162 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "For several norms, the optimization problem in Eq. 22 can be solved in closed form. These include", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 146, + 105 + ], + "score": 0.92, + "content": "\\ell _ { 1 } , \\ell _ { 2 } , \\ell _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 93, + 485, + 107 + ], + "score": 1.0, + "content": "norms and the matrix spectral norm and nuclear norm (the final two are relevant when", + "type": "text" + }, + { + "bbox": [ + 485, + 94, + 495, + 104 + ], + "score": 0.81, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 93, + 506, + 107 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 104, + 104, + 394, + 118 + ], + "score": 1.0, + "content": "a space of matrices). The results are documented in Table 5. Thus, every", + "type": "text" + }, + { + "bbox": [ + 394, + 105, + 401, + 116 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "-divergence that meets the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "score": 1.0, + "content": "conditions of Lemma 8 can be estimated efficiently for these norms. In particular, the divergences", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 243, + 141 + ], + "score": 1.0, + "content": "that are induced by the functions", + "type": "text" + }, + { + "bbox": [ + 243, + 126, + 275, + 140 + ], + "score": 0.94, + "content": "\\tilde { f } ( u ^ { - \\alpha } )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 127, + 422, + 141 + ], + "score": 1.0, + "content": "for any monotonic convex function", + "type": "text" + }, + { + "bbox": [ + 423, + 126, + 430, + 140 + ], + "score": 0.85, + "content": "\\tilde { f }", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 127, + 448, + 141 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 448, + 128, + 475, + 139 + ], + "score": 0.89, + "content": "\\alpha \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 127, + 506, + 141 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 138, + 506, + 152 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 316, + 152 + ], + "score": 1.0, + "content": "this constraint. This gives us a very flexible class of", + "type": "text" + }, + { + "bbox": [ + 316, + 139, + 323, + 150 + ], + "score": 0.86, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 138, + 506, + 152 + ], + "score": 1.0, + "content": "-divergences that can be efficiently estimated", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 280, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 280, + 163 + ], + "score": 1.0, + "content": "for these norm-based smoothing measures.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3, + "bbox_fs": [ + 104, + 82, + 506, + 163 + ] + }, + { + "type": "table", + "bbox": [ + 105, + 170, + 531, + 413 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 105, + 170, + 531, + 413 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 170, + 531, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 531, + 413 + ], + "score": 0.983, + "html": "
Constraint on δ|Bound on Eq. 22Constraint on δ|Bound on Eq. 22Sampling from X ~ μ(0)
|δl ≤εE[f(exp(-eoll-X))]X~μ1(0)Xi ~ Lap(0,1) iid
1l2≤ eE(o[f(exp(IX-eoll-X2))]X~μ2(0)X=RuR~Γ(d,1)u ~U(aB2)
≤eE[f(exp(X-e1|-X)]X~μ(0)X=RuR~ Γ(d+1,1)u EU(B)
|/ lnuc ≤ e[f(exp(||U[[s]]vT-e[[eo]|lnuc- |slli)]s~μ1(0)U,v~u(O)X=U[s]]VTs ~ μ1,U,V ~U(O)
≤eE [f(exp(|IU[[s]]vT-∈[e]|l, - |sll)]s~μ∞(x)U,v~u(O)X=U[[s]IVTs ~ μ∞,U,V ~U(O)
", + "type": "table", + "image_path": "8893e040d5a4027982ce145fe311f9b6b73c059b06165522586c1618fdbeb732.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 105, + 170, + 531, + 251.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 105, + 251.0, + 531, + 332.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 105, + 332.0, + 531, + 413.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 420, + 506, + 466 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 185, + 433 + ], + "score": 1.0, + "content": "Table 5: Bounds on", + "type": "text" + }, + { + "bbox": [ + 185, + 421, + 192, + 433 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 421, + 246, + 433 + ], + "score": 1.0, + "content": "-divergences:", + "type": "text" + }, + { + "bbox": [ + 246, + 423, + 257, + 432 + ], + "score": 0.85, + "content": "e _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "is the vector with 1 in the first coordinate and zeros in all other", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 359, + 444 + ], + "score": 1.0, + "content": "coordinates and 1 is the vector with all coordinates equal to 1.", + "type": "text" + }, + { + "bbox": [ + 360, + 433, + 372, + 444 + ], + "score": 0.86, + "content": "\\mu _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "refers to the smoothing measure", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 443, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 165, + 455 + ], + "score": 1.0, + "content": "induced by the", + "type": "text" + }, + { + "bbox": [ + 166, + 443, + 176, + 455 + ], + "score": 0.85, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 443, + 202, + 455 + ], + "score": 1.0, + "content": "norm,", + "type": "text" + }, + { + "bbox": [ + 203, + 443, + 226, + 454 + ], + "score": 0.84, + "content": "\\mathcal { U } ( S )", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 443, + 391, + 455 + ], + "score": 1.0, + "content": "refers to the uniform measure over the set", + "type": "text" + }, + { + "bbox": [ + 391, + 443, + 399, + 453 + ], + "score": 0.73, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 443, + 403, + 455 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 403, + 443, + 412, + 453 + ], + "score": 0.7, + "content": "\\mathcal { O }", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 443, + 505, + 455 + ], + "score": 1.0, + "content": "is the set of orthogonal", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 453, + 356, + 468 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 159, + 467 + ], + "score": 1.0, + "content": "matrices and", + "type": "text" + }, + { + "bbox": [ + 160, + 454, + 233, + 468 + ], + "score": 0.93, + "content": "\\hat { B _ { p } } { = } \\left\\{ \\| z \\| _ { p } \\leq 1 \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 453, + 318, + 467 + ], + "score": 1.0, + "content": "is the unit ball in the", + "type": "text" + }, + { + "bbox": [ + 318, + 454, + 329, + 466 + ], + "score": 0.88, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 453, + 356, + 467 + ], + "score": 1.0, + "content": "norm.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + } + ], + "index": 9.75 + }, + { + "type": "text", + "bbox": [ + 107, + 486, + 505, + 530 + ], + "lines": [ + { + "bbox": [ + 105, + 486, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 499 + ], + "score": 1.0, + "content": "Efficient sampling The only other requirement for obtaining a certificate computationally is to be", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 190, + 510 + ], + "score": 1.0, + "content": "able to sample from", + "type": "text" + }, + { + "bbox": [ + 191, + 497, + 211, + 510 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 497, + 259, + 510 + ], + "score": 1.0, + "content": "to estimate", + "type": "text" + }, + { + "bbox": [ + 260, + 498, + 283, + 509 + ], + "score": 0.92, + "content": "\\theta _ { a } , \\theta _ { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 497, + 313, + 510 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 314, + 497, + 334, + 510 + ], + "score": 0.92, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "is log-concave, there are general purpose", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 509, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 506, + 520 + ], + "score": 1.0, + "content": "polynomial time algorithms for sampling from this measure. However, for most norms, more efficient", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 519, + 240, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 240, + 531 + ], + "score": 1.0, + "content": "methods exist, as outlined below.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 486, + 506, + 531 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 535, + 505, + 614 + ], + "lines": [ + { + "bbox": [ + 105, + 534, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 194, + 549 + ], + "score": 1.0, + "content": "The random variable", + "type": "text" + }, + { + "bbox": [ + 194, + 536, + 238, + 548 + ], + "score": 0.93, + "content": "X \\sim \\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 534, + 317, + 549 + ], + "score": 1.0, + "content": "can be obtained as", + "type": "text" + }, + { + "bbox": [ + 318, + 536, + 368, + 546 + ], + "score": 0.91, + "content": "X = x + Z", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 534, + 390, + 549 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 390, + 536, + 432, + 548 + ], + "score": 0.92, + "content": "Z \\sim \\mu ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 534, + 506, + 549 + ], + "score": 1.0, + "content": ". Thus, to sample", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 546, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 128, + 561 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 128, + 547, + 149, + 559 + ], + "score": 0.91, + "content": "\\mu ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 546, + 181, + 561 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 181, + 549, + 188, + 557 + ], + "score": 0.74, + "content": "x", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 546, + 343, + 561 + ], + "score": 1.0, + "content": "it is enough to be able to sample from", + "type": "text" + }, + { + "bbox": [ + 343, + 547, + 362, + 559 + ], + "score": 0.88, + "content": "\\mu ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 546, + 384, + 561 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 384, + 547, + 401, + 559 + ], + "score": 0.9, + "content": "\\left\\| \\cdot \\right\\| _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 546, + 505, + 561 + ], + "score": 1.0, + "content": ", this reduces to sampling", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 555, + 506, + 572 + ], + "spans": [ + { + "bbox": [ + 104, + 555, + 349, + 572 + ], + "score": 1.0, + "content": "from a Laplace distribution which can be done easily. For", + "type": "text" + }, + { + "bbox": [ + 349, + 559, + 370, + 570 + ], + "score": 0.9, + "content": "\\left\\| \\cdot \\right\\| _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 555, + 506, + 572 + ], + "score": 1.0, + "content": ", (Steinke & Ullman, 2016) give", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 568, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 336, + 582 + ], + "score": 1.0, + "content": "the following efficient sampling procedure: first sample", + "type": "text" + }, + { + "bbox": [ + 337, + 572, + 343, + 579 + ], + "score": 0.73, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 568, + 506, + 582 + ], + "score": 1.0, + "content": "from a Gamma distribution with shape", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 580, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 107, + 580, + 129, + 591 + ], + "score": 0.89, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 130, + 580, + 171, + 592 + ], + "score": 1.0, + "content": "and mean", + "type": "text" + }, + { + "bbox": [ + 171, + 580, + 193, + 591 + ], + "score": 0.89, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 580, + 211, + 592 + ], + "score": 1.0, + "content": ", i.e.", + "type": "text" + }, + { + "bbox": [ + 212, + 580, + 276, + 592 + ], + "score": 0.93, + "content": "\\bar { r } \\sim \\bar { \\Gamma } ( \\bar { d } + 1 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 580, + 366, + 592 + ], + "score": 1.0, + "content": ", and then sample each", + "type": "text" + }, + { + "bbox": [ + 366, + 580, + 377, + 591 + ], + "score": 0.76, + "content": "Z _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 580, + 380, + 592 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 381, + 580, + 408, + 592 + ], + "score": 0.84, + "content": "i \\in [ d ]", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 580, + 475, + 592 + ], + "score": 1.0, + "content": ", uniformly from", + "type": "text" + }, + { + "bbox": [ + 476, + 580, + 503, + 592 + ], + "score": 0.92, + "content": "[ - r , r ]", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 580, + 506, + 592 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "spans": [ + { + "bbox": [ + 105, + 590, + 506, + 603 + ], + "score": 1.0, + "content": "Theorem 9 gives a short proof of correctness for this procedure. Theorem 10 also has a similar result", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 601, + 428, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 166, + 615 + ], + "score": 1.0, + "content": "for the case of", + "type": "text" + }, + { + "bbox": [ + 166, + 602, + 184, + 614 + ], + "score": 0.91, + "content": "\\lVert \\cdot \\rVert _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 601, + 428, + 615 + ], + "score": 1.0, + "content": "and Table 5 lists the sampling procedures for several norms.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21, + "bbox_fs": [ + 104, + 534, + 506, + 615 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 618, + 502, + 643 + ], + "lines": [ + { + "bbox": [ + 105, + 616, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 249, + 632 + ], + "score": 1.0, + "content": "Theorem 9. The random variable", + "type": "text" + }, + { + "bbox": [ + 249, + 617, + 284, + 629 + ], + "score": 0.91, + "content": "Z \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 616, + 396, + 632 + ], + "score": 1.0, + "content": "obtained by first sampling", + "type": "text" + }, + { + "bbox": [ + 396, + 618, + 465, + 631 + ], + "score": 0.92, + "content": "R \\sim \\Gamma ( d + 1 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 616, + 505, + 632 + ], + "score": 1.0, + "content": "and then", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 630, + 407, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 166, + 644 + ], + "score": 1.0, + "content": "sampling each", + "type": "text" + }, + { + "bbox": [ + 167, + 631, + 177, + 642 + ], + "score": 0.77, + "content": "Z _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 630, + 181, + 644 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 181, + 631, + 209, + 643 + ], + "score": 0.78, + "content": "i \\in [ d ]", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 630, + 277, + 644 + ], + "score": 1.0, + "content": ", uniformly from", + "type": "text" + }, + { + "bbox": [ + 277, + 631, + 311, + 643 + ], + "score": 0.92, + "content": "[ - R , R ]", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 630, + 359, + 644 + ], + "score": 1.0, + "content": "has density", + "type": "text" + }, + { + "bbox": [ + 360, + 630, + 401, + 641 + ], + "score": 0.9, + "content": "\\propto e ^ { - \\| z \\| _ { \\infty } }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 630, + 407, + 644 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 616, + 505, + 644 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 657, + 504, + 669 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 504, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 414, + 671 + ], + "score": 1.0, + "content": "Proof. We first compute the normalization constant for a density of the form", + "type": "text" + }, + { + "bbox": [ + 415, + 657, + 456, + 668 + ], + "score": 0.9, + "content": "\\propto e ^ { - \\| z \\| _ { \\infty } }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 655, + 504, + 671 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 655, + 504, + 671 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 134, + 675, + 476, + 703 + ], + "lines": [ + { + "bbox": [ + 134, + 675, + 476, + 703 + ], + "spans": [ + { + "bbox": [ + 134, + 675, + 476, + 703 + ], + "score": 0.92, + "content": "\\int _ { \\mathbb { R } ^ { d } } e ^ { - \\| z \\| _ { \\infty } } d z = \\int _ { 0 } ^ { \\infty } \\left( \\int _ { \\mathbb { R } ^ { d } } 1 [ \\| z \\| _ { \\infty } = t ] d z \\right) e ^ { - t } d t = \\int _ { 0 } ^ { \\infty } 2 ^ { d } d t ^ { d - 1 } e ^ { - t } d t = d ! 2 ^ { d } \\ .", + "type": "interline_equation", + "image_path": "b760f4fd1dd9d5eb592c9d225b8a48b89541f8684a236f84bb1a025ea84d30c9.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 134, + 675, + 476, + 703 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 708, + 507, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 707, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 229, + 723 + ], + "score": 1.0, + "content": "Next we show the density of", + "type": "text" + }, + { + "bbox": [ + 229, + 710, + 238, + 720 + ], + "score": 0.83, + "content": "Z", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 707, + 275, + 723 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 275, + 708, + 378, + 722 + ], + "score": 0.93, + "content": "p _ { Z } ( z ) = e ^ { - \\| z \\| _ { \\infty } } / ( d ! 2 ^ { d } )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 707, + 506, + 723 + ], + "score": 1.0, + "content": "by noting that conditioned on", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 107, + 719, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 107, + 721, + 135, + 731 + ], + "score": 0.89, + "content": "R = r", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 719, + 173, + 734 + ], + "score": 1.0, + "content": "we have", + "type": "text" + }, + { + "bbox": [ + 173, + 720, + 312, + 733 + ], + "score": 0.93, + "content": "p _ { Z | R = r } ( \\bar { z } ) = 1 [ \\| z \\| _ { \\infty } \\leq r ] / ( 2 r ) ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 719, + 506, + 734 + ], + "score": 1.0, + "content": "because of the uniform sampling used in each", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 707, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 81, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 236, + 95 + ], + "score": 1.0, + "content": "coordinate, and integrating over", + "type": "text" + }, + { + "bbox": [ + 236, + 83, + 245, + 92 + ], + "score": 0.81, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 81, + 439, + 95 + ], + "score": 1.0, + "content": "sampled from a Gamma distribution with shape", + "type": "text" + }, + { + "bbox": [ + 439, + 83, + 463, + 93 + ], + "score": 0.89, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "and mean", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 93, + 158, + 105 + ], + "spans": [ + { + "bbox": [ + 107, + 94, + 130, + 104 + ], + "score": 0.88, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 93, + 158, + 105 + ], + "score": 1.0, + "content": "yields", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 110, + 509, + 141 + ], + "lines": [ + { + "bbox": [ + 111, + 110, + 509, + 141 + ], + "spans": [ + { + "bbox": [ + 111, + 110, + 509, + 141 + ], + "score": 0.92, + "content": "_ { _ { D G } } ( z ) = \\int _ { 0 } ^ { \\infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r = \\int _ { 0 } ^ { \\infty } \\frac { 1 [ \\| z \\| _ { \\infty } \\leq r ] } { ( 2 r ) ^ { d } } \\frac { r ^ { d } e ^ { - r } } { d ! } d r = \\frac { 1 } { d ! 2 ^ { d } } \\int _ { \\| z \\| _ { \\infty } } ^ { \\infty } e ^ { - r } d r = \\frac { e ^ { - \\| z \\| _ { \\infty } } } { d ! 2 ^ { d } } .", + "type": "interline_equation", + "image_path": "0ac67627adfa178cf788354344afd6452f56064aa85ab1a8f8ad1232f6020a93.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 111, + 110, + 509, + 120.33333333333333 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 120.33333333333333, + 509, + 130.66666666666666 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 111, + 130.66666666666666, + 509, + 141.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 164, + 505, + 204 + ], + "lines": [ + { + "bbox": [ + 106, + 164, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 106, + 164, + 255, + 177 + ], + "score": 1.0, + "content": "Theorem 10. The random variable", + "type": "text" + }, + { + "bbox": [ + 255, + 165, + 290, + 176 + ], + "score": 0.92, + "content": "Z \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 164, + 403, + 177 + ], + "score": 1.0, + "content": "obtained by first sampling", + "type": "text" + }, + { + "bbox": [ + 404, + 165, + 463, + 178 + ], + "score": 0.93, + "content": "Z ^ { \\prime } \\sim \\mathcal { N } ( 0 , I )", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 164, + 483, + 177 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 483, + 166, + 505, + 177 + ], + "score": 0.85, + "content": "R \\sim", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 176, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 141, + 191 + ], + "score": 0.92, + "content": "\\Gamma _ { p } ( d , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 176, + 206, + 196 + ], + "score": 1.0, + "content": "and then taking", + "type": "text" + }, + { + "bbox": [ + 207, + 177, + 259, + 194 + ], + "score": 0.94, + "content": "\\begin{array} { r } { Z = R \\frac { Z ^ { \\prime } } { \\Vert Z ^ { \\prime } \\Vert _ { 2 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 176, + 307, + 196 + ], + "score": 1.0, + "content": "has density", + "type": "text" + }, + { + "bbox": [ + 307, + 177, + 346, + 189 + ], + "score": 0.89, + "content": "\\propto e ^ { - \\| z \\| _ { 2 } ^ { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 176, + 372, + 196 + ], + "score": 1.0, + "content": ". Here", + "type": "text" + }, + { + "bbox": [ + 373, + 178, + 407, + 191 + ], + "score": 0.93, + "content": "\\Gamma _ { p } ( d , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 176, + 506, + 196 + ], + "score": 1.0, + "content": "denotes the generalized", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 191, + 352, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 223, + 204 + ], + "score": 1.0, + "content": "Gamma distribution of order", + "type": "text" + }, + { + "bbox": [ + 223, + 194, + 248, + 204 + ], + "score": 0.89, + "content": "p > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 191, + 294, + 204 + ], + "score": 1.0, + "content": "with shape", + "type": "text" + }, + { + "bbox": [ + 294, + 193, + 301, + 202 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 191, + 341, + 204 + ], + "score": 1.0, + "content": "and scale", + "type": "text" + }, + { + "bbox": [ + 341, + 195, + 348, + 202 + ], + "score": 0.79, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 191, + 352, + 204 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 108, + 217, + 504, + 260 + ], + "lines": [ + { + "bbox": [ + 106, + 217, + 507, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 195, + 236 + ], + "score": 1.0, + "content": "Proof. First note that", + "type": "text" + }, + { + "bbox": [ + 195, + 217, + 284, + 235 + ], + "score": 0.93, + "content": "\\begin{array} { r } { W = \\frac { Z ^ { \\prime } } { \\left. Z ^ { \\prime } \\right. _ { 2 } } \\sim \\mathcal { U } ( B _ { 2 } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 217, + 383, + 236 + ], + "score": 1.0, + "content": "; i.e. it is uniform on the", + "type": "text" + }, + { + "bbox": [ + 383, + 220, + 393, + 231 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 217, + 507, + 236 + ], + "score": 1.0, + "content": "ball of radius 1. Therefore,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 231, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 107, + 232, + 126, + 243 + ], + "score": 0.43, + "content": "R W", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 231, + 203, + 246 + ], + "score": 1.0, + "content": "is uniform on the", + "type": "text" + }, + { + "bbox": [ + 203, + 234, + 213, + 244 + ], + "score": 0.85, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 231, + 273, + 246 + ], + "score": 1.0, + "content": "ball of radius", + "type": "text" + }, + { + "bbox": [ + 273, + 234, + 282, + 243 + ], + "score": 0.81, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 231, + 410, + 246 + ], + "score": 1.0, + "content": "and the conditional density of", + "type": "text" + }, + { + "bbox": [ + 411, + 233, + 420, + 243 + ], + "score": 0.82, + "content": "Z", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 231, + 446, + 246 + ], + "score": 1.0, + "content": "given", + "type": "text" + }, + { + "bbox": [ + 447, + 233, + 456, + 243 + ], + "score": 0.83, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 231, + 505, + 246 + ], + "score": 1.0, + "content": "is given by", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 243, + 424, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 224, + 260 + ], + "score": 0.93, + "content": "\\begin{array} { r } { p _ { Z | R = r } ( z ) = \\frac { 1 [ \\| z \\| _ { 2 } = r ] \\Gamma ( d / 2 ) } { 2 \\pi ^ { d / 2 } r ^ { d - 1 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 243, + 253, + 261 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 253, + 247, + 262, + 257 + ], + "score": 0.8, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 243, + 310, + 261 + ], + "score": 1.0, + "content": "has density", + "type": "text" + }, + { + "bbox": [ + 310, + 245, + 387, + 259 + ], + "score": 0.93, + "content": "p _ { R } ( r ) \\propto r ^ { d - 1 } e ^ { - r ^ { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 243, + 424, + 261 + ], + "score": 1.0, + "content": ", we get", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 265, + 401, + 335 + ], + "lines": [ + { + "bbox": [ + 210, + 265, + 401, + 335 + ], + "spans": [ + { + "bbox": [ + 210, + 265, + 401, + 335 + ], + "score": 0.93, + "content": "\\begin{array} { l } { { \\displaystyle p _ { Z } ( z ) = \\int _ { 0 } ^ { \\infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r } } \\\\ { { \\displaystyle \\propto \\int _ { 0 } ^ { \\infty } \\frac { 1 [ \\| z \\| _ { 2 } = r ] \\Gamma ( d / 2 ) } { 2 \\pi ^ { d / 2 } r ^ { d - 1 } } r ^ { d - 1 } e ^ { - r ^ { p } } d r } } \\\\ { { \\displaystyle \\propto e ^ { - \\| z \\| _ { 2 } ^ { p } } } . } \\end{array}", + "type": "interline_equation", + "image_path": "3c852d1069c9943e6818d72302d180128c04ff20a2be5610c75d134675538dc6.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 210, + 265, + 401, + 279.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 210, + 279.0, + 401, + 293.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 210, + 293.0, + 401, + 307.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 210, + 307.0, + 401, + 321.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 210, + 321.0, + 401, + 335.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 367, + 363, + 379 + ], + "lines": [ + { + "bbox": [ + 106, + 367, + 364, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 364, + 379 + ], + "score": 1.0, + "content": "A.9 ALGORITHM FOR FULL-INFORMATION CERTIFICATION", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 505, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 388, + 504, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 504, + 400 + ], + "score": 1.0, + "content": "In this section we describe the subroutines used in Algorithm 1. First we describe a generic procedure", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "score": 1.0, + "content": "to provide high-probability confidence intervals for estimating expectations, then we give a detailed", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 410, + 229, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 229, + 422 + ], + "score": 1.0, + "content": "description of the subroutines.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "title", + "bbox": [ + 106, + 433, + 371, + 445 + ], + "lines": [ + { + "bbox": [ + 106, + 434, + 372, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 372, + 446 + ], + "score": 1.0, + "content": "A.9.1 HIGH-CONFIDENCE ESTIMATES OF EXPECTED VALUES", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 452, + 506, + 510 + ], + "lines": [ + { + "bbox": [ + 100, + 453, + 503, + 484 + ], + "spans": [ + { + "bbox": [ + 100, + 453, + 122, + 484 + ], + "score": 1.0, + "content": "Let Let", + "type": "text" + }, + { + "bbox": [ + 122, + 453, + 171, + 465 + ], + "score": 0.92, + "content": "Z _ { 1 } , \\dots , Z _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 453, + 212, + 484 + ], + "score": 1.0, + "content": "be indepel mean be", + "type": "text" + }, + { + "bbox": [ + 281, + 453, + 401, + 484 + ], + "score": 1.0, + "content": "distributed random variables and the empirical variance be", + "type": "text" + }, + { + "bbox": [ + 442, + 454, + 451, + 463 + ], + "score": 0.84, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 456, + 503, + 463 + ], + "score": 0.63, + "content": "m", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 212, + 464, + 502, + 479 + ], + "spans": [ + { + "bbox": [ + 212, + 464, + 281, + 479 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\bar { Z } = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\bar { Z _ { i } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 464, + 502, + 479 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\bar { \\sigma } ^ { 2 } = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } ( Z _ { i } - \\bar { Z } ) ^ { 2 } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 477, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 506, + 491 + ], + "score": 1.0, + "content": "Applying Bernstein’s inequality to the sum and the sum of the squares of these random variables, we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 487, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 104, + 487, + 506, + 502 + ], + "score": 1.0, + "content": "get the empirical Bernstein bound (Audibert et al., 2009), which states that with probability at least", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 498, + 135, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 129, + 511 + ], + "score": 0.89, + "content": "1 - \\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 498, + 135, + 513 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 509, + 397, + 537 + ], + "lines": [ + { + "bbox": [ + 214, + 509, + 397, + 537 + ], + "spans": [ + { + "bbox": [ + 214, + 509, + 397, + 537 + ], + "score": 0.93, + "content": "| \\bar { Z } - m | \\leq \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { t } .", + "type": "interline_equation", + "image_path": "57c33c4c03407ee96d70bb3c1faeb9501ffd08b9fcf5773302345e225440939f.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 214, + 509, + 397, + 537 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 545, + 506, + 592 + ], + "lines": [ + { + "bbox": [ + 105, + 545, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 446, + 558 + ], + "score": 1.0, + "content": "The main benefit of the above inequality is that as long as the variance of the sample", + "type": "text" + }, + { + "bbox": [ + 446, + 546, + 494, + 557 + ], + "score": 0.9, + "content": "Z _ { 1 } , \\dots , Z _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 545, + 506, + 558 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 556, + 507, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 303, + 571 + ], + "score": 1.0, + "content": "small, the convergence rate becomes essentially", + "type": "text" + }, + { + "bbox": [ + 303, + 558, + 338, + 570 + ], + "score": 0.93, + "content": "O ( 1 / N )", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 556, + 433, + 571 + ], + "score": 1.0, + "content": "instead of the standard", + "type": "text" + }, + { + "bbox": [ + 434, + 557, + 477, + 570 + ], + "score": 0.92, + "content": "O ( 1 / \\sqrt { N } )", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 556, + 507, + 571 + ], + "score": 1.0, + "content": ". Also,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 569, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 392, + 582 + ], + "score": 1.0, + "content": "since Eq. 23 only contains empirical quantities apart from the range", + "type": "text" + }, + { + "bbox": [ + 392, + 569, + 400, + 579 + ], + "score": 0.81, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 569, + 506, + 582 + ], + "score": 1.0, + "content": ", it can be used to obtain", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 580, + 401, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 264, + 593 + ], + "score": 1.0, + "content": "computable bounds for the expectation", + "type": "text" + }, + { + "bbox": [ + 264, + 582, + 271, + 592 + ], + "score": 0.75, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 580, + 372, + 593 + ], + "score": 1.0, + "content": ": with probability at least", + "type": "text" + }, + { + "bbox": [ + 372, + 581, + 396, + 592 + ], + "score": 0.89, + "content": "1 - \\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 580, + 401, + 593 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5 + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 597, + 468, + 625 + ], + "lines": [ + { + "bbox": [ + 126, + 597, + 468, + 625 + ], + "spans": [ + { + "bbox": [ + 126, + 597, + 468, + 625 + ], + "score": 0.94, + "content": "\\bar { Z } - \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } - \\frac { 3 R \\log ( 3 / \\zeta ) } { N } \\leq m \\leq \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { N } .", + "type": "interline_equation", + "image_path": "6b35b4b94705b5c8b51d00880eb401c78ce8321e95f2eb370fcd9327286ded27.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 126, + 597, + 468, + 625 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 635, + 286, + 647 + ], + "lines": [ + { + "bbox": [ + 106, + 635, + 288, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 288, + 648 + ], + "score": 1.0, + "content": "A.9.2 SUBROUTINES FOR ALGORITHM 1", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 506, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "The bound in Eq. 24 can be applied to approximate the expectation in Eq. 6 with high probability for", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 666, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 171, + 680 + ], + "score": 1.0, + "content": "given values of", + "type": "text" + }, + { + "bbox": [ + 171, + 667, + 178, + 676 + ], + "score": 0.82, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 666, + 196, + 680 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 197, + 668, + 204, + 676 + ], + "score": 0.74, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 666, + 345, + 680 + ], + "score": 1.0, + "content": ". More specifically, if the function", + "type": "text" + }, + { + "bbox": [ + 345, + 667, + 398, + 678 + ], + "score": 0.92, + "content": "f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( \\cdot ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 666, + 494, + 680 + ], + "score": 1.0, + "content": "is bounded with range", + "type": "text" + }, + { + "bbox": [ + 494, + 668, + 502, + 676 + ], + "score": 0.79, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 666, + 506, + 680 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 154, + 690 + ], + "score": 1.0, + "content": "then taking", + "type": "text" + }, + { + "bbox": [ + 154, + 678, + 164, + 687 + ], + "score": 0.81, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 677, + 201, + 690 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 201, + 679, + 252, + 689 + ], + "score": 0.89, + "content": "X _ { 1 } , \\ldots , X _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 677, + 335, + 690 + ], + "score": 1.0, + "content": "independently from", + "type": "text" + }, + { + "bbox": [ + 336, + 680, + 342, + 689 + ], + "score": 0.78, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 677, + 398, + 690 + ], + "score": 1.0, + "content": ", and defining", + "type": "text" + }, + { + "bbox": [ + 398, + 677, + 484, + 690 + ], + "score": 0.92, + "content": "Z _ { i } = f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X _ { i } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 677, + 506, + 690 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 687, + 388, + 703 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 115, + 699 + ], + "score": 0.84, + "content": "\\bar { Z }", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 687, + 133, + 703 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 133, + 689, + 145, + 699 + ], + "score": 0.88, + "content": "\\bar { \\sigma } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 687, + 360, + 703 + ], + "score": 1.0, + "content": "as above, Eq. 24 implies that with probability at least", + "type": "text" + }, + { + "bbox": [ + 361, + 689, + 383, + 701 + ], + "score": 0.89, + "content": "1 - \\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 687, + 388, + 703 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5 + }, + { + "type": "interline_equation", + "bbox": [ + 178, + 707, + 434, + 735 + ], + "lines": [ + { + "bbox": [ + 178, + 707, + 434, + 735 + ], + "spans": [ + { + "bbox": [ + 178, + 707, + 434, + 735 + ], + "score": 0.93, + "content": "\\operatorname { E } _ { X \\sim \\rho } ^ { } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X _ { i } ) ) ] \\leq \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { N } .", + "type": "interline_equation", + "image_path": "1aee9b25cb65041a4d9c7abaece9b937ebe0f666843838ed656046d1bffa9793.jpg" + } + ] + } + ], + "index": 37, + "virtual_lines": [ + { + "bbox": [ + 178, + 707, + 434, + 735 + ], + "spans": [], + "index": 37 + } + ] + } + ], + "page_idx": 23, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 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 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 749, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 749, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 16, + "width": 15 + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 342, + 505, + 352 + ], + "lines": [ + { + "bbox": [ + 495, + 343, + 505, + 353 + ], + "spans": [ + { + "bbox": [ + 495, + 343, + 505, + 353 + ], + "score": 0.998, + "content": "□", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 146, + 505, + 156 + ], + "lines": [ + { + "bbox": [ + 495, + 147, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 495, + 147, + 505, + 158 + ], + "score": 0.998, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 81, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 236, + 95 + ], + "score": 1.0, + "content": "coordinate, and integrating over", + "type": "text" + }, + { + "bbox": [ + 236, + 83, + 245, + 92 + ], + "score": 0.81, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 81, + 439, + 95 + ], + "score": 1.0, + "content": "sampled from a Gamma distribution with shape", + "type": "text" + }, + { + "bbox": [ + 439, + 83, + 463, + 93 + ], + "score": 0.89, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "and mean", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 93, + 158, + 105 + ], + "spans": [ + { + "bbox": [ + 107, + 94, + 130, + 104 + ], + "score": 0.88, + "content": "d + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 93, + 158, + 105 + ], + "score": 1.0, + "content": "yields", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 105 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 110, + 509, + 141 + ], + "lines": [ + { + "bbox": [ + 111, + 110, + 509, + 141 + ], + "spans": [ + { + "bbox": [ + 111, + 110, + 509, + 141 + ], + "score": 0.92, + "content": "_ { _ { D G } } ( z ) = \\int _ { 0 } ^ { \\infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r = \\int _ { 0 } ^ { \\infty } \\frac { 1 [ \\| z \\| _ { \\infty } \\leq r ] } { ( 2 r ) ^ { d } } \\frac { r ^ { d } e ^ { - r } } { d ! } d r = \\frac { 1 } { d ! 2 ^ { d } } \\int _ { \\| z \\| _ { \\infty } } ^ { \\infty } e ^ { - r } d r = \\frac { e ^ { - \\| z \\| _ { \\infty } } } { d ! 2 ^ { d } } .", + "type": "interline_equation", + "image_path": "0ac67627adfa178cf788354344afd6452f56064aa85ab1a8f8ad1232f6020a93.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 111, + 110, + 509, + 120.33333333333333 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 120.33333333333333, + 509, + 130.66666666666666 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 111, + 130.66666666666666, + 509, + 141.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 164, + 505, + 204 + ], + "lines": [ + { + "bbox": [ + 106, + 164, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 106, + 164, + 255, + 177 + ], + "score": 1.0, + "content": "Theorem 10. The random variable", + "type": "text" + }, + { + "bbox": [ + 255, + 165, + 290, + 176 + ], + "score": 0.92, + "content": "Z \\in \\mathbb { R } ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 164, + 403, + 177 + ], + "score": 1.0, + "content": "obtained by first sampling", + "type": "text" + }, + { + "bbox": [ + 404, + 165, + 463, + 178 + ], + "score": 0.93, + "content": "Z ^ { \\prime } \\sim \\mathcal { N } ( 0 , I )", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 164, + 483, + 177 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 483, + 166, + 505, + 177 + ], + "score": 0.85, + "content": "R \\sim", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 176, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 141, + 191 + ], + "score": 0.92, + "content": "\\Gamma _ { p } ( d , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 176, + 206, + 196 + ], + "score": 1.0, + "content": "and then taking", + "type": "text" + }, + { + "bbox": [ + 207, + 177, + 259, + 194 + ], + "score": 0.94, + "content": "\\begin{array} { r } { Z = R \\frac { Z ^ { \\prime } } { \\Vert Z ^ { \\prime } \\Vert _ { 2 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 176, + 307, + 196 + ], + "score": 1.0, + "content": "has density", + "type": "text" + }, + { + "bbox": [ + 307, + 177, + 346, + 189 + ], + "score": 0.89, + "content": "\\propto e ^ { - \\| z \\| _ { 2 } ^ { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 176, + 372, + 196 + ], + "score": 1.0, + "content": ". Here", + "type": "text" + }, + { + "bbox": [ + 373, + 178, + 407, + 191 + ], + "score": 0.93, + "content": "\\Gamma _ { p } ( d , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 176, + 506, + 196 + ], + "score": 1.0, + "content": "denotes the generalized", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 191, + 352, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 223, + 204 + ], + "score": 1.0, + "content": "Gamma distribution of order", + "type": "text" + }, + { + "bbox": [ + 223, + 194, + 248, + 204 + ], + "score": 0.89, + "content": "p > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 191, + 294, + 204 + ], + "score": 1.0, + "content": "with shape", + "type": "text" + }, + { + "bbox": [ + 294, + 193, + 301, + 202 + ], + "score": 0.81, + "content": "d", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 191, + 341, + 204 + ], + "score": 1.0, + "content": "and scale", + "type": "text" + }, + { + "bbox": [ + 341, + 195, + 348, + 202 + ], + "score": 0.79, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 191, + 352, + 204 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 164, + 506, + 204 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 217, + 504, + 260 + ], + "lines": [ + { + "bbox": [ + 106, + 217, + 507, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 195, + 236 + ], + "score": 1.0, + "content": "Proof. First note that", + "type": "text" + }, + { + "bbox": [ + 195, + 217, + 284, + 235 + ], + "score": 0.93, + "content": "\\begin{array} { r } { W = \\frac { Z ^ { \\prime } } { \\left. Z ^ { \\prime } \\right. _ { 2 } } \\sim \\mathcal { U } ( B _ { 2 } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 217, + 383, + 236 + ], + "score": 1.0, + "content": "; i.e. it is uniform on the", + "type": "text" + }, + { + "bbox": [ + 383, + 220, + 393, + 231 + ], + "score": 0.87, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 217, + 507, + 236 + ], + "score": 1.0, + "content": "ball of radius 1. Therefore,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 231, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 107, + 232, + 126, + 243 + ], + "score": 0.43, + "content": "R W", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 231, + 203, + 246 + ], + "score": 1.0, + "content": "is uniform on the", + "type": "text" + }, + { + "bbox": [ + 203, + 234, + 213, + 244 + ], + "score": 0.85, + "content": "\\ell _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 231, + 273, + 246 + ], + "score": 1.0, + "content": "ball of radius", + "type": "text" + }, + { + "bbox": [ + 273, + 234, + 282, + 243 + ], + "score": 0.81, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 231, + 410, + 246 + ], + "score": 1.0, + "content": "and the conditional density of", + "type": "text" + }, + { + "bbox": [ + 411, + 233, + 420, + 243 + ], + "score": 0.82, + "content": "Z", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 231, + 446, + 246 + ], + "score": 1.0, + "content": "given", + "type": "text" + }, + { + "bbox": [ + 447, + 233, + 456, + 243 + ], + "score": 0.83, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 231, + 505, + 246 + ], + "score": 1.0, + "content": "is given by", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 243, + 424, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 224, + 260 + ], + "score": 0.93, + "content": "\\begin{array} { r } { p _ { Z | R = r } ( z ) = \\frac { 1 [ \\| z \\| _ { 2 } = r ] \\Gamma ( d / 2 ) } { 2 \\pi ^ { d / 2 } r ^ { d - 1 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 243, + 253, + 261 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 253, + 247, + 262, + 257 + ], + "score": 0.8, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 243, + 310, + 261 + ], + "score": 1.0, + "content": "has density", + "type": "text" + }, + { + "bbox": [ + 310, + 245, + 387, + 259 + ], + "score": 0.93, + "content": "p _ { R } ( r ) \\propto r ^ { d - 1 } e ^ { - r ^ { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 243, + 424, + 261 + ], + "score": 1.0, + "content": ", we get", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9, + "bbox_fs": [ + 106, + 217, + 507, + 261 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 265, + 401, + 335 + ], + "lines": [ + { + "bbox": [ + 210, + 265, + 401, + 335 + ], + "spans": [ + { + "bbox": [ + 210, + 265, + 401, + 335 + ], + "score": 0.93, + "content": "\\begin{array} { l } { { \\displaystyle p _ { Z } ( z ) = \\int _ { 0 } ^ { \\infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r } } \\\\ { { \\displaystyle \\propto \\int _ { 0 } ^ { \\infty } \\frac { 1 [ \\| z \\| _ { 2 } = r ] \\Gamma ( d / 2 ) } { 2 \\pi ^ { d / 2 } r ^ { d - 1 } } r ^ { d - 1 } e ^ { - r ^ { p } } d r } } \\\\ { { \\displaystyle \\propto e ^ { - \\| z \\| _ { 2 } ^ { p } } } . } \\end{array}", + "type": "interline_equation", + "image_path": "3c852d1069c9943e6818d72302d180128c04ff20a2be5610c75d134675538dc6.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 210, + 265, + 401, + 279.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 210, + 279.0, + 401, + 293.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 210, + 293.0, + 401, + 307.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 210, + 307.0, + 401, + 321.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 210, + 321.0, + 401, + 335.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 367, + 363, + 379 + ], + "lines": [ + { + "bbox": [ + 106, + 367, + 364, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 364, + 379 + ], + "score": 1.0, + "content": "A.9 ALGORITHM FOR FULL-INFORMATION CERTIFICATION", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 387, + 505, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 388, + 504, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 504, + 400 + ], + "score": 1.0, + "content": "In this section we describe the subroutines used in Algorithm 1. First we describe a generic procedure", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "score": 1.0, + "content": "to provide high-probability confidence intervals for estimating expectations, then we give a detailed", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 410, + 229, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 229, + 422 + ], + "score": 1.0, + "content": "description of the subroutines.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 388, + 505, + 422 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 433, + 371, + 445 + ], + "lines": [ + { + "bbox": [ + 106, + 434, + 372, + 446 + ], + "spans": [ + { + "bbox": [ + 106, + 434, + 372, + 446 + ], + "score": 1.0, + "content": "A.9.1 HIGH-CONFIDENCE ESTIMATES OF EXPECTED VALUES", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 452, + 506, + 510 + ], + "lines": [ + { + "bbox": [ + 100, + 453, + 503, + 484 + ], + "spans": [ + { + "bbox": [ + 100, + 453, + 122, + 484 + ], + "score": 1.0, + "content": "Let Let", + "type": "text" + }, + { + "bbox": [ + 122, + 453, + 171, + 465 + ], + "score": 0.92, + "content": "Z _ { 1 } , \\dots , Z _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 453, + 212, + 484 + ], + "score": 1.0, + "content": "be indepel mean be", + "type": "text" + }, + { + "bbox": [ + 281, + 453, + 401, + 484 + ], + "score": 1.0, + "content": "distributed random variables and the empirical variance be", + "type": "text" + }, + { + "bbox": [ + 442, + 454, + 451, + 463 + ], + "score": 0.84, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 456, + 503, + 463 + ], + "score": 0.63, + "content": "m", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 212, + 464, + 502, + 479 + ], + "spans": [ + { + "bbox": [ + 212, + 464, + 281, + 479 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\bar { Z } = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\bar { Z _ { i } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 464, + 502, + 479 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\bar { \\sigma } ^ { 2 } = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } ( Z _ { i } - \\bar { Z } ) ^ { 2 } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 477, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 506, + 491 + ], + "score": 1.0, + "content": "Applying Bernstein’s inequality to the sum and the sum of the squares of these random variables, we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 487, + 506, + 502 + ], + "spans": [ + { + "bbox": [ + 104, + 487, + 506, + 502 + ], + "score": 1.0, + "content": "get the empirical Bernstein bound (Audibert et al., 2009), which states that with probability at least", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 498, + 135, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 129, + 511 + ], + "score": 0.89, + "content": "1 - \\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 498, + 135, + 513 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 100, + 453, + 506, + 513 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 509, + 397, + 537 + ], + "lines": [ + { + "bbox": [ + 214, + 509, + 397, + 537 + ], + "spans": [ + { + "bbox": [ + 214, + 509, + 397, + 537 + ], + "score": 0.93, + "content": "| \\bar { Z } - m | \\leq \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { t } .", + "type": "interline_equation", + "image_path": "57c33c4c03407ee96d70bb3c1faeb9501ffd08b9fcf5773302345e225440939f.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 214, + 509, + 397, + 537 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 545, + 506, + 592 + ], + "lines": [ + { + "bbox": [ + 105, + 545, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 446, + 558 + ], + "score": 1.0, + "content": "The main benefit of the above inequality is that as long as the variance of the sample", + "type": "text" + }, + { + "bbox": [ + 446, + 546, + 494, + 557 + ], + "score": 0.9, + "content": "Z _ { 1 } , \\dots , Z _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 545, + 506, + 558 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 556, + 507, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 303, + 571 + ], + "score": 1.0, + "content": "small, the convergence rate becomes essentially", + "type": "text" + }, + { + "bbox": [ + 303, + 558, + 338, + 570 + ], + "score": 0.93, + "content": "O ( 1 / N )", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 556, + 433, + 571 + ], + "score": 1.0, + "content": "instead of the standard", + "type": "text" + }, + { + "bbox": [ + 434, + 557, + 477, + 570 + ], + "score": 0.92, + "content": "O ( 1 / \\sqrt { N } )", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 556, + 507, + 571 + ], + "score": 1.0, + "content": ". Also,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 569, + 506, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 392, + 582 + ], + "score": 1.0, + "content": "since Eq. 23 only contains empirical quantities apart from the range", + "type": "text" + }, + { + "bbox": [ + 392, + 569, + 400, + 579 + ], + "score": 0.81, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 569, + 506, + 582 + ], + "score": 1.0, + "content": ", it can be used to obtain", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 580, + 401, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 264, + 593 + ], + "score": 1.0, + "content": "computable bounds for the expectation", + "type": "text" + }, + { + "bbox": [ + 264, + 582, + 271, + 592 + ], + "score": 0.75, + "content": "\\mu", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 580, + 372, + 593 + ], + "score": 1.0, + "content": ": with probability at least", + "type": "text" + }, + { + "bbox": [ + 372, + 581, + 396, + 592 + ], + "score": 0.89, + "content": "1 - \\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 580, + 401, + 593 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 545, + 507, + 593 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 597, + 468, + 625 + ], + "lines": [ + { + "bbox": [ + 126, + 597, + 468, + 625 + ], + "spans": [ + { + "bbox": [ + 126, + 597, + 468, + 625 + ], + "score": 0.94, + "content": "\\bar { Z } - \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } - \\frac { 3 R \\log ( 3 / \\zeta ) } { N } \\leq m \\leq \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { N } .", + "type": "interline_equation", + "image_path": "6b35b4b94705b5c8b51d00880eb401c78ce8321e95f2eb370fcd9327286ded27.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 126, + 597, + 468, + 625 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 635, + 286, + 647 + ], + "lines": [ + { + "bbox": [ + 106, + 635, + 288, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 288, + 648 + ], + "score": 1.0, + "content": "A.9.2 SUBROUTINES FOR ALGORITHM 1", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 506, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "The bound in Eq. 24 can be applied to approximate the expectation in Eq. 6 with high probability for", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 666, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 171, + 680 + ], + "score": 1.0, + "content": "given values of", + "type": "text" + }, + { + "bbox": [ + 171, + 667, + 178, + 676 + ], + "score": 0.82, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 666, + 196, + 680 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 197, + 668, + 204, + 676 + ], + "score": 0.74, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 666, + 345, + 680 + ], + "score": 1.0, + "content": ". More specifically, if the function", + "type": "text" + }, + { + "bbox": [ + 345, + 667, + 398, + 678 + ], + "score": 0.92, + "content": "f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( \\cdot ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 666, + 494, + 680 + ], + "score": 1.0, + "content": "is bounded with range", + "type": "text" + }, + { + "bbox": [ + 494, + 668, + 502, + 676 + ], + "score": 0.79, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 503, + 666, + 506, + 680 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 154, + 690 + ], + "score": 1.0, + "content": "then taking", + "type": "text" + }, + { + "bbox": [ + 154, + 678, + 164, + 687 + ], + "score": 0.81, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 677, + 201, + 690 + ], + "score": 1.0, + "content": "samples", + "type": "text" + }, + { + "bbox": [ + 201, + 679, + 252, + 689 + ], + "score": 0.89, + "content": "X _ { 1 } , \\ldots , X _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 677, + 335, + 690 + ], + "score": 1.0, + "content": "independently from", + "type": "text" + }, + { + "bbox": [ + 336, + 680, + 342, + 689 + ], + "score": 0.78, + "content": "\\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 677, + 398, + 690 + ], + "score": 1.0, + "content": ", and defining", + "type": "text" + }, + { + "bbox": [ + 398, + 677, + 484, + 690 + ], + "score": 0.92, + "content": "Z _ { i } = f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X _ { i } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 677, + 506, + 690 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 687, + 388, + 703 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 115, + 699 + ], + "score": 0.84, + "content": "\\bar { Z }", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 687, + 133, + 703 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 133, + 689, + 145, + 699 + ], + "score": 0.88, + "content": "\\bar { \\sigma } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 687, + 360, + 703 + ], + "score": 1.0, + "content": "as above, Eq. 24 implies that with probability at least", + "type": "text" + }, + { + "bbox": [ + 361, + 689, + 383, + 701 + ], + "score": 0.89, + "content": "1 - \\zeta", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 687, + 388, + 703 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 654, + 506, + 703 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 178, + 707, + 434, + 735 + ], + "lines": [ + { + "bbox": [ + 178, + 707, + 434, + 735 + ], + "spans": [ + { + "bbox": [ + 178, + 707, + 434, + 735 + ], + "score": 0.93, + "content": "\\operatorname { E } _ { X \\sim \\rho } ^ { } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X _ { i } ) ) ] \\leq \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { N } .", + "type": "interline_equation", + "image_path": "1aee9b25cb65041a4d9c7abaece9b937ebe0f666843838ed656046d1bffa9793.jpg" + } + ] + } + ], + "index": 37, + "virtual_lines": [ + { + "bbox": [ + 178, + 707, + 434, + 735 + ], + "spans": [], + "index": 37 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "score": 1.0, + "content": "Plugging in this bound to Eq. 6 gives a high-probability lower bound for the function to be maximized", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 198, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 161, + 106 + ], + "score": 1.0, + "content": "for any given", + "type": "text" + }, + { + "bbox": [ + 162, + 94, + 169, + 104 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 93, + 187, + 106 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 187, + 96, + 194, + 104 + ], + "score": 0.74, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 93, + 198, + 106 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 504, + 133 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 505, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 505, + 124 + ], + "score": 1.0, + "content": "Details of the above procedures are given in Algorithm 3. We use an off-the-shelf convex optimization", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 121, + 380, + 134 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 380, + 134 + ], + "score": 1.0, + "content": "solver (Diamond & Boyd, 2016) in the ESTIMETEOPT subroutine.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 108, + 145, + 273, + 156 + ], + "lines": [ + { + "bbox": [ + 106, + 144, + 275, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 275, + 158 + ], + "score": 1.0, + "content": "Algorithm 3 Subroutines for Algorithm 1", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 115, + 161, + 298, + 172 + ], + "lines": [ + { + "bbox": [ + 115, + 159, + 297, + 174 + ], + "spans": [ + { + "bbox": [ + 115, + 159, + 194, + 174 + ], + "score": 1.0, + "content": "function ESTIMAT", + "type": "text" + }, + { + "bbox": [ + 194, + 161, + 297, + 173 + ], + "score": 0.7, + "content": "\\mathrm { E O P T } ( \\rho , \\phi , N , \\{ f _ { i } \\} , \\{ \\epsilon _ { i } \\} )", + "type": "inline_equation" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 113, + 173, + 505, + 208 + ], + "lines": [ + { + "bbox": [ + 129, + 168, + 504, + 186 + ], + "spans": [ + { + "bbox": [ + 129, + 168, + 164, + 186 + ], + "score": 1.0, + "content": "Sample", + "type": "text" + }, + { + "bbox": [ + 164, + 172, + 236, + 183 + ], + "score": 0.91, + "content": "X ^ { 1 } , \\ldots , X ^ { N } \\sim \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 168, + 281, + 186 + ], + "score": 1.0, + "content": "and obtain", + "type": "text" + }, + { + "bbox": [ + 282, + 173, + 293, + 182 + ], + "score": 0.85, + "content": "\\kappa ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 168, + 311, + 186 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 312, + 172, + 323, + 182 + ], + "score": 0.86, + "content": "\\lambda ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 168, + 413, + 186 + ], + "score": 1.0, + "content": "by solving Eq. 6 with", + "type": "text" + }, + { + "bbox": [ + 414, + 171, + 504, + 185 + ], + "score": 0.89, + "content": "\\operatorname { E } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ]", + "type": "inline_equation" + } + ], + "index": 6 + }, + { + "bbox": [ + 112, + 178, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 112, + 178, + 164, + 204 + ], + "score": 1.0, + "content": "replaced by", + "type": "text" + }, + { + "bbox": [ + 164, + 184, + 266, + 199 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } f _ { \\lambda } ^ { * } \\big ( \\kappa - \\phi \\big ( X ^ { i } \\big ) \\big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 178, + 382, + 204 + ], + "score": 1.0, + "content": "and the additional constraints", + "type": "text" + }, + { + "bbox": [ + 383, + 185, + 505, + 198 + ], + "score": 0.77, + "content": "f _ { \\lambda ^ { * } } ^ { * } ( \\kappa - a ) < \\infty , f _ { \\lambda ^ { * } } ^ { * } ( \\kappa - b ) <", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 117, + 198, + 132, + 209 + ], + "spans": [ + { + "bbox": [ + 117, + 199, + 128, + 207 + ], + "score": 0.62, + "content": "\\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 198, + 132, + 209 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 131, + 208, + 189, + 218 + ], + "lines": [ + { + "bbox": [ + 130, + 207, + 187, + 219 + ], + "spans": [ + { + "bbox": [ + 130, + 207, + 161, + 219 + ], + "score": 1.0, + "content": "return", + "type": "text" + }, + { + "bbox": [ + 161, + 208, + 187, + 219 + ], + "score": 0.88, + "content": "\\kappa ^ { * } , \\lambda ^ { * }", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 121, + 228, + 430, + 241 + ], + "lines": [ + { + "bbox": [ + 118, + 225, + 428, + 245 + ], + "spans": [ + { + "bbox": [ + 118, + 225, + 204, + 245 + ], + "score": 1.0, + "content": "function UPPERCON", + "type": "text" + }, + { + "bbox": [ + 204, + 228, + 428, + 242 + ], + "score": 0.38, + "content": "\\mathrm { F I D E N C E B O U N D } ( \\rho , \\phi , \\tilde { N } , \\{ f _ { i } \\} _ { i = 1 } ^ { M } , \\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } , a , b , \\lambda , \\kappa , \\zeta )", + "type": "inline_equation" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 130, + 243, + 456, + 255 + ], + "lines": [ + { + "bbox": [ + 129, + 239, + 453, + 258 + ], + "spans": [ + { + "bbox": [ + 129, + 239, + 164, + 258 + ], + "score": 1.0, + "content": "Sample", + "type": "text" + }, + { + "bbox": [ + 164, + 241, + 236, + 254 + ], + "score": 0.92, + "content": "X ^ { 1 } , \\dotsc , X ^ { \\tilde { N } } \\dotsc \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 239, + 291, + 258 + ], + "score": 1.0, + "content": "and compute", + "type": "text" + }, + { + "bbox": [ + 291, + 243, + 383, + 256 + ], + "score": 0.91, + "content": "Z ^ { i } \\gets f _ { \\lambda } ^ { * } \\big ( \\kappa - \\phi \\big ( X ^ { i } \\big ) \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 239, + 398, + 258 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 399, + 241, + 453, + 255 + ], + "score": 0.88, + "content": "i = 1 , \\ldots , \\tilde { N }", + "type": "inline_equation" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 289, + 360, + 303 + ], + "lines": [], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 147, + 289, + 360, + 303 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 216, + 308, + 405, + 343 + ], + "lines": [ + { + "bbox": [ + 216, + 308, + 405, + 343 + ], + "spans": [ + { + "bbox": [ + 216, + 308, + 405, + 343 + ], + "score": 0.88, + "content": "E _ { u b } \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { \\tilde { N } } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { \\tilde { N } } .", + "type": "interline_equation", + "image_path": "7d72494dae529baa82ecf6ea3a088348f3a05f1141002622c8fdb97ada2ace9b.jpg" + } + ] + } + ], + "index": 13.5, + "virtual_lines": [ + { + "bbox": [ + 216, + 308, + 405, + 325.5 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 216, + 325.5, + 405, + 343.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 116, + 344, + 181, + 366 + ], + "lines": [ + { + "bbox": [ + 130, + 341, + 178, + 358 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 161, + 358 + ], + "score": 1.0, + "content": "return", + "type": "text" + }, + { + "bbox": [ + 162, + 344, + 178, + 355 + ], + "score": 0.88, + "content": "E _ { u b }", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 354, + 173, + 367 + ], + "spans": [ + { + "bbox": [ + 116, + 354, + 173, + 367 + ], + "score": 1.0, + "content": "end function", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "title", + "bbox": [ + 108, + 388, + 247, + 399 + ], + "lines": [ + { + "bbox": [ + 106, + 388, + 248, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 137, + 401 + ], + "score": 1.0, + "content": "A.10", + "type": "text" + }, + { + "bbox": [ + 137, + 388, + 148, + 399 + ], + "score": 0.82, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 388, + 248, + 401 + ], + "score": 1.0, + "content": "SMOOTHING MEASURE", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 105, + 408, + 504, + 430 + ], + "lines": [ + { + "bbox": [ + 105, + 407, + 504, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 493, + 421 + ], + "score": 1.0, + "content": "We can also handle discrete perturbations in our framework. A natural case to consider is", + "type": "text" + }, + { + "bbox": [ + 494, + 409, + 504, + 420 + ], + "score": 0.85, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 419, + 342, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 278, + 432 + ], + "score": 1.0, + "content": "perturbations. In this case, we assume that", + "type": "text" + }, + { + "bbox": [ + 278, + 419, + 313, + 429 + ], + "score": 0.91, + "content": "\\mathcal { X } = A ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 419, + 342, + 432 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 271, + 436, + 340, + 450 + ], + "lines": [ + { + "bbox": [ + 271, + 436, + 340, + 450 + ], + "spans": [ + { + "bbox": [ + 271, + 436, + 340, + 450 + ], + "score": 0.92, + "content": "A = \\{ 1 , \\ldots , K \\}", + "type": "interline_equation", + "image_path": "cea5d711d195f35f310834b24d85e9c6b736ed0db6ee0de5dcb1fdf6906edb2a.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 271, + 436, + 340, + 450 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 454, + 258, + 466 + ], + "lines": [ + { + "bbox": [ + 105, + 453, + 259, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 259, + 467 + ], + "score": 1.0, + "content": "is a discrete set. Then, we can choose", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 470, + 390, + 504 + ], + "lines": [ + { + "bbox": [ + 221, + 470, + 390, + 504 + ], + "spans": [ + { + "bbox": [ + 221, + 470, + 390, + 504 + ], + "score": 0.94, + "content": "\\mu ( x ) [ z ] = \\prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } { \\left( { \\frac { q } { K - 1 } } \\right) } ^ { 1 [ z _ { i } \\neq x _ { i } ] }", + "type": "interline_equation", + "image_path": "7f25e890aa7379fa47b542e73bf5911cba9434f4d79201da2ace60eff6f84953.jpg" + } + ] + } + ], + "index": 22.5, + "virtual_lines": [ + { + "bbox": [ + 221, + 470, + 390, + 487.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 221, + 487.0, + 390, + 504.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 508, + 504, + 543 + ], + "lines": [ + { + "bbox": [ + 105, + 508, + 509, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 133, + 522 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 106, + 514, + 124, + 534 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 520, + 145, + 533 + ], + "score": 0.91, + "content": "\\frac { q } { K - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 510, + 176, + 520 + ], + "score": 0.85, + "content": "p + q = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 514, + 509, + 534 + ], + "score": 1.0, + "content": "denotes a uniform probability of switching it to a different value. In this case, it can be", + "type": "text" + }, + { + "bbox": [ + 176, + 508, + 179, + 522 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 180, + 509, + 223, + 520 + ], + "score": 0.83, + "content": "p \\geq q \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 508, + 244, + 522 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 244, + 510, + 250, + 520 + ], + "score": 0.8, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 508, + 497, + 522 + ], + "score": 1.0, + "content": "denotes the probability that the measure retains the value of", + "type": "text" + }, + { + "bbox": [ + 497, + 511, + 504, + 519 + ], + "score": 0.73, + "content": "x", + "type": "inline_equation" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 532, + 235, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 190, + 543 + ], + "score": 1.0, + "content": "shown that for every", + "type": "text" + }, + { + "bbox": [ + 191, + 532, + 216, + 542 + ], + "score": 0.9, + "content": "\\alpha > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 532, + 235, + 543 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 122, + 547, + 489, + 601 + ], + "lines": [ + { + "bbox": [ + 122, + 547, + 489, + 601 + ], + "spans": [ + { + "bbox": [ + 122, + 547, + 489, + 601 + ], + "score": 0.94, + "content": "R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) = \\| x - x ^ { \\prime } \\| _ { 0 } \\left( \\frac { \\log \\left( p \\left( \\frac { q } { ( K - 1 ) p } \\right) ^ { ( \\alpha ) } + \\frac { q } { K - 1 } \\left( \\frac { ( K - 1 ) p } { q } \\right) ^ { ( \\alpha ) } + \\left( \\frac { K - 2 } { K - 1 } \\right) q \\right) } { \\alpha - 1 } \\right)", + "type": "interline_equation", + "image_path": "6cfaf7e14b50761ec8aa248e1c83a6b460e78bc0acba5504bb9f04f2bd97d7a3.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 122, + 547, + 489, + 565.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 122, + 565.0, + 489, + 583.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 122, + 583.0, + 489, + 601.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 604, + 504, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 603, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 300, + 619 + ], + "score": 1.0, + "content": "so that we can derive a certificate with respect to", + "type": "text" + }, + { + "bbox": [ + 300, + 605, + 310, + 616 + ], + "score": 0.88, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 603, + 505, + 619 + ], + "score": 1.0, + "content": "perturbations using any set of Renyi divergences ´", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 616, + 219, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 219, + 627 + ], + "score": 1.0, + "content": "(or combinations of theses).", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 106, + 632, + 505, + 655 + ], + "lines": [ + { + "bbox": [ + 106, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "This can be extended to structured discrete perturbations by introducing coupling terms between the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 644, + 164, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 164, + 655 + ], + "score": 1.0, + "content": "perturbations:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "interline_equation", + "bbox": [ + 139, + 660, + 471, + 695 + ], + "lines": [ + { + "bbox": [ + 139, + 660, + 471, + 695 + ], + "spans": [ + { + "bbox": [ + 139, + 660, + 471, + 695 + ], + "score": 0.93, + "content": "\\mu ( x ) [ z ] \\propto \\prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } \\bigg ( \\frac { q } { K - 1 } \\bigg ) ^ { 1 [ z _ { i } \\neq x _ { i } ] } \\exp \\left( \\sum _ { i = 1 } ^ { d - 1 } \\eta 1 [ z _ { i } = x _ { i } ] 1 [ z _ { i + 1 } = x _ { i + 1 } ] \\right) \\ .", + "type": "interline_equation", + "image_path": "a0ccb5711642ec7beafcae2380d3f5dfddbc1bc38b99f59477022e38d21c6d96.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 139, + 660, + 471, + 671.6666666666666 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 139, + 671.6666666666666, + 471, + 683.3333333333333 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 139, + 683.3333333333333, + 471, + 694.9999999999999 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "This would correlate perturbations between adjacent features (which for example may be useful to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "model correlated perturbations for time series data). Since this can be viewed as a Markov Chain,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 720, + 369, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 218, + 734 + ], + "score": 1.0, + "content": "Renyi divergences between ´", + "type": "text" + }, + { + "bbox": [ + 218, + 722, + 265, + 732 + ], + "score": 0.94, + "content": "\\mu ( x ) , \\mu ( x ^ { \\prime } )", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 720, + 369, + 734 + ], + "score": 1.0, + "content": "are still easy to compute.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + } + ], + "page_idx": 24, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 294, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2020", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 749, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 749, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 16, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "score": 1.0, + "content": "Plugging in this bound to Eq. 6 gives a high-probability lower bound for the function to be maximized", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 198, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 161, + 106 + ], + "score": 1.0, + "content": "for any given", + "type": "text" + }, + { + "bbox": [ + 162, + 94, + 169, + 104 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 93, + 187, + 106 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 187, + 96, + 194, + 104 + ], + "score": 0.74, + "content": "\\kappa", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 93, + 198, + 106 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 506, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 504, + 133 + ], + "lines": [ + { + "bbox": [ + 105, + 109, + 505, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 109, + 505, + 124 + ], + "score": 1.0, + "content": "Details of the above procedures are given in Algorithm 3. We use an off-the-shelf convex optimization", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 121, + 380, + 134 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 380, + 134 + ], + "score": 1.0, + "content": "solver (Diamond & Boyd, 2016) in the ESTIMETEOPT subroutine.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 109, + 505, + 134 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 145, + 273, + 156 + ], + "lines": [ + { + "bbox": [ + 106, + 144, + 275, + 158 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 275, + 158 + ], + "score": 1.0, + "content": "Algorithm 3 Subroutines for Algorithm 1", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 115, + 161, + 298, + 172 + ], + "lines": [ + { + "bbox": [ + 115, + 159, + 297, + 174 + ], + "spans": [ + { + "bbox": [ + 115, + 159, + 194, + 174 + ], + "score": 1.0, + "content": "function ESTIMAT", + "type": "text" + }, + { + "bbox": [ + 194, + 161, + 297, + 173 + ], + "score": 0.7, + "content": "\\mathrm { E O P T } ( \\rho , \\phi , N , \\{ f _ { i } \\} , \\{ \\epsilon _ { i } \\} )", + "type": "inline_equation" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 115, + 159, + 297, + 174 + ] + }, + { + "type": "text", + "bbox": [ + 113, + 173, + 505, + 208 + ], + "lines": [ + { + "bbox": [ + 129, + 168, + 504, + 186 + ], + "spans": [ + { + "bbox": [ + 129, + 168, + 164, + 186 + ], + "score": 1.0, + "content": "Sample", + "type": "text" + }, + { + "bbox": [ + 164, + 172, + 236, + 183 + ], + "score": 0.91, + "content": "X ^ { 1 } , \\ldots , X ^ { N } \\sim \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 168, + 281, + 186 + ], + "score": 1.0, + "content": "and obtain", + "type": "text" + }, + { + "bbox": [ + 282, + 173, + 293, + 182 + ], + "score": 0.85, + "content": "\\kappa ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 168, + 311, + 186 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 312, + 172, + 323, + 182 + ], + "score": 0.86, + "content": "\\lambda ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 168, + 413, + 186 + ], + "score": 1.0, + "content": "by solving Eq. 6 with", + "type": "text" + }, + { + "bbox": [ + 414, + 171, + 504, + 185 + ], + "score": 0.89, + "content": "\\operatorname { E } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ]", + "type": "inline_equation" + } + ], + "index": 6 + }, + { + "bbox": [ + 112, + 178, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 112, + 178, + 164, + 204 + ], + "score": 1.0, + "content": "replaced by", + "type": "text" + }, + { + "bbox": [ + 164, + 184, + 266, + 199 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } f _ { \\lambda } ^ { * } \\big ( \\kappa - \\phi \\big ( X ^ { i } \\big ) \\big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 178, + 382, + 204 + ], + "score": 1.0, + "content": "and the additional constraints", + "type": "text" + }, + { + "bbox": [ + 383, + 185, + 505, + 198 + ], + "score": 0.77, + "content": "f _ { \\lambda ^ { * } } ^ { * } ( \\kappa - a ) < \\infty , f _ { \\lambda ^ { * } } ^ { * } ( \\kappa - b ) <", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 117, + 198, + 132, + 209 + ], + "spans": [ + { + "bbox": [ + 117, + 199, + 128, + 207 + ], + "score": 0.62, + "content": "\\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 198, + 132, + 209 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 112, + 168, + 505, + 209 + ] + }, + { + "type": "text", + "bbox": [ + 131, + 208, + 189, + 218 + ], + "lines": [ + { + "bbox": [ + 130, + 207, + 187, + 219 + ], + "spans": [ + { + "bbox": [ + 130, + 207, + 161, + 219 + ], + "score": 1.0, + "content": "return", + "type": "text" + }, + { + "bbox": [ + 161, + 208, + 187, + 219 + ], + "score": 0.88, + "content": "\\kappa ^ { * } , \\lambda ^ { * }", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 130, + 207, + 187, + 219 + ] + }, + { + "type": "text", + "bbox": [ + 121, + 228, + 430, + 241 + ], + "lines": [ + { + "bbox": [ + 118, + 225, + 428, + 245 + ], + "spans": [ + { + "bbox": [ + 118, + 225, + 204, + 245 + ], + "score": 1.0, + "content": "function UPPERCON", + "type": "text" + }, + { + "bbox": [ + 204, + 228, + 428, + 242 + ], + "score": 0.38, + "content": "\\mathrm { F I D E N C E B O U N D } ( \\rho , \\phi , \\tilde { N } , \\{ f _ { i } \\} _ { i = 1 } ^ { M } , \\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } , a , b , \\lambda , \\kappa , \\zeta )", + "type": "inline_equation" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 118, + 225, + 428, + 245 + ] + }, + { + "type": "text", + "bbox": [ + 130, + 243, + 456, + 255 + ], + "lines": [ + { + "bbox": [ + 129, + 239, + 453, + 258 + ], + "spans": [ + { + "bbox": [ + 129, + 239, + 164, + 258 + ], + "score": 1.0, + "content": "Sample", + "type": "text" + }, + { + "bbox": [ + 164, + 241, + 236, + 254 + ], + "score": 0.92, + "content": "X ^ { 1 } , \\dotsc , X ^ { \\tilde { N } } \\dotsc \\rho", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 239, + 291, + 258 + ], + "score": 1.0, + "content": "and compute", + "type": "text" + }, + { + "bbox": [ + 291, + 243, + 383, + 256 + ], + "score": 0.91, + "content": "Z ^ { i } \\gets f _ { \\lambda } ^ { * } \\big ( \\kappa - \\phi \\big ( X ^ { i } \\big ) \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 239, + 398, + 258 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 399, + 241, + 453, + 255 + ], + "score": 0.88, + "content": "i = 1 , \\ldots , \\tilde { N }", + "type": "inline_equation" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 129, + 239, + 453, + 258 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 289, + 360, + 303 + ], + "lines": [], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 147, + 289, + 360, + 303 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 216, + 308, + 405, + 343 + ], + "lines": [ + { + "bbox": [ + 216, + 308, + 405, + 343 + ], + "spans": [ + { + "bbox": [ + 216, + 308, + 405, + 343 + ], + "score": 0.88, + "content": "E _ { u b } \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { \\tilde { N } } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { \\tilde { N } } .", + "type": "interline_equation", + "image_path": "7d72494dae529baa82ecf6ea3a088348f3a05f1141002622c8fdb97ada2ace9b.jpg" + } + ] + } + ], + "index": 13.5, + "virtual_lines": [ + { + "bbox": [ + 216, + 308, + 405, + 325.5 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 216, + 325.5, + 405, + 343.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 116, + 344, + 181, + 366 + ], + "lines": [ + { + "bbox": [ + 130, + 341, + 178, + 358 + ], + "spans": [ + { + "bbox": [ + 130, + 341, + 161, + 358 + ], + "score": 1.0, + "content": "return", + "type": "text" + }, + { + "bbox": [ + 162, + 344, + 178, + 355 + ], + "score": 0.88, + "content": "E _ { u b }", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 354, + 173, + 367 + ], + "spans": [ + { + "bbox": [ + 116, + 354, + 173, + 367 + ], + "score": 1.0, + "content": "end function", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 116, + 341, + 178, + 367 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 388, + 247, + 399 + ], + "lines": [ + { + "bbox": [ + 106, + 388, + 248, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 137, + 401 + ], + "score": 1.0, + "content": "A.10", + "type": "text" + }, + { + "bbox": [ + 137, + 388, + 148, + 399 + ], + "score": 0.82, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 388, + 248, + 401 + ], + "score": 1.0, + "content": "SMOOTHING MEASURE", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 105, + 408, + 504, + 430 + ], + "lines": [ + { + "bbox": [ + 105, + 407, + 504, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 493, + 421 + ], + "score": 1.0, + "content": "We can also handle discrete perturbations in our framework. A natural case to consider is", + "type": "text" + }, + { + "bbox": [ + 494, + 409, + 504, + 420 + ], + "score": 0.85, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 419, + 342, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 278, + 432 + ], + "score": 1.0, + "content": "perturbations. In this case, we assume that", + "type": "text" + }, + { + "bbox": [ + 278, + 419, + 313, + 429 + ], + "score": 0.91, + "content": "\\mathcal { X } = A ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 419, + 342, + 432 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 407, + 504, + 432 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 271, + 436, + 340, + 450 + ], + "lines": [ + { + "bbox": [ + 271, + 436, + 340, + 450 + ], + "spans": [ + { + "bbox": [ + 271, + 436, + 340, + 450 + ], + "score": 0.92, + "content": "A = \\{ 1 , \\ldots , K \\}", + "type": "interline_equation", + "image_path": "cea5d711d195f35f310834b24d85e9c6b736ed0db6ee0de5dcb1fdf6906edb2a.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 271, + 436, + 340, + 450 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 454, + 258, + 466 + ], + "lines": [ + { + "bbox": [ + 105, + 453, + 259, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 259, + 467 + ], + "score": 1.0, + "content": "is a discrete set. Then, we can choose", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 453, + 259, + 467 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 470, + 390, + 504 + ], + "lines": [ + { + "bbox": [ + 221, + 470, + 390, + 504 + ], + "spans": [ + { + "bbox": [ + 221, + 470, + 390, + 504 + ], + "score": 0.94, + "content": "\\mu ( x ) [ z ] = \\prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } { \\left( { \\frac { q } { K - 1 } } \\right) } ^ { 1 [ z _ { i } \\neq x _ { i } ] }", + "type": "interline_equation", + "image_path": "7f25e890aa7379fa47b542e73bf5911cba9434f4d79201da2ace60eff6f84953.jpg" + } + ] + } + ], + "index": 22.5, + "virtual_lines": [ + { + "bbox": [ + 221, + 470, + 390, + 487.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 221, + 487.0, + 390, + 504.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 508, + 504, + 543 + ], + "lines": [ + { + "bbox": [ + 105, + 508, + 509, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 133, + 522 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 106, + 514, + 124, + 534 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 520, + 145, + 533 + ], + "score": 0.91, + "content": "\\frac { q } { K - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 510, + 176, + 520 + ], + "score": 0.85, + "content": "p + q = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 514, + 509, + 534 + ], + "score": 1.0, + "content": "denotes a uniform probability of switching it to a different value. In this case, it can be", + "type": "text" + }, + { + "bbox": [ + 176, + 508, + 179, + 522 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 180, + 509, + 223, + 520 + ], + "score": 0.83, + "content": "p \\geq q \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 508, + 244, + 522 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 244, + 510, + 250, + 520 + ], + "score": 0.8, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 508, + 497, + 522 + ], + "score": 1.0, + "content": "denotes the probability that the measure retains the value of", + "type": "text" + }, + { + "bbox": [ + 497, + 511, + 504, + 519 + ], + "score": 0.73, + "content": "x", + "type": "inline_equation" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 532, + 235, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 190, + 543 + ], + "score": 1.0, + "content": "shown that for every", + "type": "text" + }, + { + "bbox": [ + 191, + 532, + 216, + 542 + ], + "score": 0.9, + "content": "\\alpha > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 532, + 235, + 543 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 508, + 509, + 543 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 122, + 547, + 489, + 601 + ], + "lines": [ + { + "bbox": [ + 122, + 547, + 489, + 601 + ], + "spans": [ + { + "bbox": [ + 122, + 547, + 489, + 601 + ], + "score": 0.94, + "content": "R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) = \\| x - x ^ { \\prime } \\| _ { 0 } \\left( \\frac { \\log \\left( p \\left( \\frac { q } { ( K - 1 ) p } \\right) ^ { ( \\alpha ) } + \\frac { q } { K - 1 } \\left( \\frac { ( K - 1 ) p } { q } \\right) ^ { ( \\alpha ) } + \\left( \\frac { K - 2 } { K - 1 } \\right) q \\right) } { \\alpha - 1 } \\right)", + "type": "interline_equation", + "image_path": "6cfaf7e14b50761ec8aa248e1c83a6b460e78bc0acba5504bb9f04f2bd97d7a3.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 122, + 547, + 489, + 565.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 122, + 565.0, + 489, + 583.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 122, + 583.0, + 489, + 601.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 604, + 504, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 603, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 603, + 300, + 619 + ], + "score": 1.0, + "content": "so that we can derive a certificate with respect to", + "type": "text" + }, + { + "bbox": [ + 300, + 605, + 310, + 616 + ], + "score": 0.88, + "content": "\\ell _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 603, + 505, + 619 + ], + "score": 1.0, + "content": "perturbations using any set of Renyi divergences ´", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 616, + 219, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 219, + 627 + ], + "score": 1.0, + "content": "(or combinations of theses).", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 603, + 505, + 627 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 632, + 505, + 655 + ], + "lines": [ + { + "bbox": [ + 106, + 632, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 505, + 645 + ], + "score": 1.0, + "content": "This can be extended to structured discrete perturbations by introducing coupling terms between the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 644, + 164, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 164, + 655 + ], + "score": 1.0, + "content": "perturbations:", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 632, + 505, + 655 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 139, + 660, + 471, + 695 + ], + "lines": [ + { + "bbox": [ + 139, + 660, + 471, + 695 + ], + "spans": [ + { + "bbox": [ + 139, + 660, + 471, + 695 + ], + "score": 0.93, + "content": "\\mu ( x ) [ z ] \\propto \\prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } \\bigg ( \\frac { q } { K - 1 } \\bigg ) ^ { 1 [ z _ { i } \\neq x _ { i } ] } \\exp \\left( \\sum _ { i = 1 } ^ { d - 1 } \\eta 1 [ z _ { i } = x _ { i } ] 1 [ z _ { i + 1 } = x _ { i + 1 } ] \\right) \\ .", + "type": "interline_equation", + "image_path": "a0ccb5711642ec7beafcae2380d3f5dfddbc1bc38b99f59477022e38d21c6d96.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 139, + 660, + 471, + 671.6666666666666 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 139, + 671.6666666666666, + 471, + 683.3333333333333 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 139, + 683.3333333333333, + 471, + 694.9999999999999 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "This would correlate perturbations between adjacent features (which for example may be useful to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "model correlated perturbations for time series data). Since this can be viewed as a Markov Chain,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 720, + 369, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 218, + 734 + ], + "score": 1.0, + "content": "Renyi divergences between ´", + "type": "text" + }, + { + "bbox": [ + 218, + 722, + 265, + 732 + ], + "score": 0.94, + "content": "\\mu ( x ) , \\mu ( x ^ { \\prime } )", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 720, + 369, + 734 + ], + "score": 1.0, + "content": "are still easy to compute.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 698, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 427, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 429, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 344, + 95 + ], + "score": 1.0, + "content": "A.11 COMPARISON WITH LECUYER ET AL. (2019) ON", + "type": "text" + }, + { + "bbox": [ + 345, + 83, + 354, + 93 + ], + "score": 0.74, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 82, + 429, + 95 + ], + "score": 1.0, + "content": "PERTURBATIONS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 103, + 505, + 115 + ], + "spans": [ + { + "bbox": [ + 106, + 103, + 505, + 115 + ], + "score": 1.0, + "content": "Here we compare our certificates to Lecuyer et al. (2019) on the MNIST, CIFAR-10 and ImageNet", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 114, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 505, + 127 + ], + "score": 1.0, + "content": "datasets. The smoothing distribution is as described in A.8; a zero mean Laplacian distribution with", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 124, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 124, + 505, + 138 + ], + "score": 1.0, + "content": "smoothing value defined by the scale of the distribution. We first describe the hyperparameters used", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 135, + 506, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 135, + 506, + 149 + ], + "score": 1.0, + "content": "in training and certification for each of the datasets. For all datasets, images were normalized into a", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 146, + 155, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 155, + 162 + ], + "score": 1.0, + "content": "[0,1] range.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 170, + 505, + 227 + ], + "lines": [ + { + "bbox": [ + 106, + 170, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 506, + 183 + ], + "score": 1.0, + "content": "MNIST hyperparameters: We trained a standard three layer CNN ReLU classifier for 50,000", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 180, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 505, + 196 + ], + "score": 1.0, + "content": "steps with a batch size of 128 and a learning rate of 0.001. The smoothing value during training", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 192, + 506, + 207 + ], + "spans": [ + { + "bbox": [ + 104, + 192, + 268, + 207 + ], + "score": 1.0, + "content": "was set to 1.0. For certification we use", + "type": "text" + }, + { + "bbox": [ + 268, + 192, + 392, + 205 + ], + "score": 0.92, + "content": "N \\overset { \\cdot } { = } 1 K , \\tilde { N } = 1 0 M , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 192, + 506, + 207 + ], + "score": 1.0, + "content": ", and sweep over a range of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 204, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 506, + 218 + ], + "score": 1.0, + "content": "smoothing values between 0.5 and 1.5 and report the best certificate found. Certified accuracy is", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 216, + 276, + 229 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 276, + 229 + ], + "score": 1.0, + "content": "reported on 1,000 MNIST test set images.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 505, + 296 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "score": 1.0, + "content": "CIFAR-10 hyperparameters: We trained a Wide ResNet classifier for 50,000 training steps with", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 250, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 506, + 263 + ], + "score": 1.0, + "content": "a batch size of 32 and a learning rate of 0.001. The smoothing value during training was set to 0.2.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 261, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 204, + 276 + ], + "score": 1.0, + "content": "For certification we use", + "type": "text" + }, + { + "bbox": [ + 205, + 261, + 320, + 274 + ], + "score": 0.91, + "content": "N = 1 K , \\tilde { N } = 1 M , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 261, + 506, + 276 + ], + "score": 1.0, + "content": ", and sweep over a range of smoothing values", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 505, + 287 + ], + "score": 1.0, + "content": "between 0.1 and 0.5 and report the best certificate found. Certified accuracy is reported on 1,000", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 284, + 214, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 284, + 214, + 297 + ], + "score": 1.0, + "content": "CIFAR-10 test set images.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 505, + 365 + ], + "lines": [ + { + "bbox": [ + 106, + 308, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 505, + 321 + ], + "score": 1.0, + "content": "ImageNet hyperparameters: We trained a ResNet-152 classifier for 1 million training steps with", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 319, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 505, + 333 + ], + "score": 1.0, + "content": "a batch size of 16 and an initial learning rate of 0.1 that is decayed by a factor of ten every 25,000", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 330, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 442, + 344 + ], + "score": 1.0, + "content": "steps. The smoothing value during training was set to 0.1. For certification we use", + "type": "text" + }, + { + "bbox": [ + 442, + 330, + 506, + 343 + ], + "score": 0.91, + "content": "N = 1 K , \\tilde { N } =", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 342, + 504, + 355 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 167, + 354 + ], + "score": 0.87, + "content": "1 0 0 K , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 342, + 504, + 355 + ], + "score": 1.0, + "content": ", and sweep over a range of smoothing values between 0.05 and 0.25 and report the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 352, + 476, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 476, + 367 + ], + "score": 1.0, + "content": "best certificate found. Certified accuracy is reported on 500 ImageNet validation set images.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18 + }, + { + "type": "image", + "bbox": [ + 106, + 396, + 487, + 669 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 396, + 487, + 669 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 396, + 487, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 487, + 669 + ], + "score": 0.78, + "type": "image", + "image_path": "91632107e779409bf7a1723095f72ac1b1035eae560bf1b3ef171f5a1d760330.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 106, + 396, + 487, + 487.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 106, + 487.0, + 487, + 578.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 106, + 578.0, + 487, + 669.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 142, + 678, + 466, + 690 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 143, + 677, + 468, + 691 + ], + "spans": [ + { + "bbox": [ + 143, + 677, + 283, + 691 + ], + "score": 1.0, + "content": "Figure 3: Certified accuracy under", + "type": "text" + }, + { + "bbox": [ + 283, + 678, + 293, + 689 + ], + "score": 0.86, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 677, + 468, + 691 + ], + "score": 1.0, + "content": "perturbations on CIFAR-10 and ImageNet.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + } + ], + "index": 23.0 + }, + { + "type": "text", + "bbox": [ + 105, + 702, + 505, + 724 + ], + "lines": [ + { + "bbox": [ + 105, + 701, + 506, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 701, + 506, + 715 + ], + "score": 1.0, + "content": "Results for MNIST can be seen in Table 6, CIFAR-10 and ImageNet results are shown in Figure 3.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 713, + 390, + 725 + ], + "spans": [ + { + "bbox": [ + 106, + 713, + 390, + 725 + ], + "score": 1.0, + "content": "We significantly outperform Lecuyer et al. (2019) on all three datasets.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + } + ], + "page_idx": 25, + "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": [ + 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": [ + 106, + 82, + 427, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 429, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 344, + 95 + ], + "score": 1.0, + "content": "A.11 COMPARISON WITH LECUYER ET AL. (2019) ON", + "type": "text" + }, + { + "bbox": [ + 345, + 83, + 354, + 93 + ], + "score": 0.74, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 82, + 429, + 95 + ], + "score": 1.0, + "content": "PERTURBATIONS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 82, + 429, + 95 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 102, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 103, + 505, + 115 + ], + "spans": [ + { + "bbox": [ + 106, + 103, + 505, + 115 + ], + "score": 1.0, + "content": "Here we compare our certificates to Lecuyer et al. (2019) on the MNIST, CIFAR-10 and ImageNet", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 114, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 114, + 505, + 127 + ], + "score": 1.0, + "content": "datasets. The smoothing distribution is as described in A.8; a zero mean Laplacian distribution with", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 124, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 124, + 505, + 138 + ], + "score": 1.0, + "content": "smoothing value defined by the scale of the distribution. We first describe the hyperparameters used", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 135, + 506, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 135, + 506, + 149 + ], + "score": 1.0, + "content": "in training and certification for each of the datasets. For all datasets, images were normalized into a", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 146, + 155, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 155, + 162 + ], + "score": 1.0, + "content": "[0,1] range.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 103, + 506, + 162 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 170, + 505, + 227 + ], + "lines": [ + { + "bbox": [ + 106, + 170, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 506, + 183 + ], + "score": 1.0, + "content": "MNIST hyperparameters: We trained a standard three layer CNN ReLU classifier for 50,000", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 180, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 505, + 196 + ], + "score": 1.0, + "content": "steps with a batch size of 128 and a learning rate of 0.001. The smoothing value during training", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 192, + 506, + 207 + ], + "spans": [ + { + "bbox": [ + 104, + 192, + 268, + 207 + ], + "score": 1.0, + "content": "was set to 1.0. For certification we use", + "type": "text" + }, + { + "bbox": [ + 268, + 192, + 392, + 205 + ], + "score": 0.92, + "content": "N \\overset { \\cdot } { = } 1 K , \\tilde { N } = 1 0 M , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 192, + 506, + 207 + ], + "score": 1.0, + "content": ", and sweep over a range of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 204, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 506, + 218 + ], + "score": 1.0, + "content": "smoothing values between 0.5 and 1.5 and report the best certificate found. Certified accuracy is", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 216, + 276, + 229 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 276, + 229 + ], + "score": 1.0, + "content": "reported on 1,000 MNIST test set images.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8, + "bbox_fs": [ + 104, + 170, + 506, + 229 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 239, + 505, + 296 + ], + "lines": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 504, + 252 + ], + "score": 1.0, + "content": "CIFAR-10 hyperparameters: We trained a Wide ResNet classifier for 50,000 training steps with", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 250, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 506, + 263 + ], + "score": 1.0, + "content": "a batch size of 32 and a learning rate of 0.001. The smoothing value during training was set to 0.2.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 261, + 506, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 204, + 276 + ], + "score": 1.0, + "content": "For certification we use", + "type": "text" + }, + { + "bbox": [ + 205, + 261, + 320, + 274 + ], + "score": 0.91, + "content": "N = 1 K , \\tilde { N } = 1 M , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 261, + 506, + 276 + ], + "score": 1.0, + "content": ", and sweep over a range of smoothing values", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 273, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 505, + 287 + ], + "score": 1.0, + "content": "between 0.1 and 0.5 and report the best certificate found. Certified accuracy is reported on 1,000", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 284, + 214, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 284, + 214, + 297 + ], + "score": 1.0, + "content": "CIFAR-10 test set images.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 239, + 506, + 297 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 505, + 365 + ], + "lines": [ + { + "bbox": [ + 106, + 308, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 505, + 321 + ], + "score": 1.0, + "content": "ImageNet hyperparameters: We trained a ResNet-152 classifier for 1 million training steps with", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 319, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 505, + 333 + ], + "score": 1.0, + "content": "a batch size of 16 and an initial learning rate of 0.1 that is decayed by a factor of ten every 25,000", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 330, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 442, + 344 + ], + "score": 1.0, + "content": "steps. The smoothing value during training was set to 0.1. For certification we use", + "type": "text" + }, + { + "bbox": [ + 442, + 330, + 506, + 343 + ], + "score": 0.91, + "content": "N = 1 K , \\tilde { N } =", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 342, + 504, + 355 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 167, + 354 + ], + "score": 0.87, + "content": "1 0 0 K , \\zeta = . 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 342, + 504, + 355 + ], + "score": 1.0, + "content": ", and sweep over a range of smoothing values between 0.05 and 0.25 and report the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 352, + 476, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 476, + 367 + ], + "score": 1.0, + "content": "best certificate found. Certified accuracy is reported on 500 ImageNet validation set images.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 308, + 506, + 367 + ] + }, + { + "type": "image", + "bbox": [ + 106, + 396, + 487, + 669 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 396, + 487, + 669 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 396, + 487, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 487, + 669 + ], + "score": 0.78, + "type": "image", + "image_path": "91632107e779409bf7a1723095f72ac1b1035eae560bf1b3ef171f5a1d760330.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 106, + 396, + 487, + 487.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 106, + 487.0, + 487, + 578.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 106, + 578.0, + 487, + 669.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 142, + 678, + 466, + 690 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 143, + 677, + 468, + 691 + ], + "spans": [ + { + "bbox": [ + 143, + 677, + 283, + 691 + ], + "score": 1.0, + "content": "Figure 3: Certified accuracy under", + "type": "text" + }, + { + "bbox": [ + 283, + 678, + 293, + 689 + ], + "score": 0.86, + "content": "\\ell _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 677, + 468, + 691 + ], + "score": 1.0, + "content": "perturbations on CIFAR-10 and ImageNet.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + } + ], + "index": 23.0 + }, + { + "type": "list", + "bbox": [ + 105, + 702, + 505, + 724 + ], + "lines": [ + { + "bbox": [ + 105, + 701, + 506, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 701, + 506, + 715 + ], + "score": 1.0, + "content": "Results for MNIST can be seen in Table 6, CIFAR-10 and ImageNet results are shown in Figure 3.", + "type": "text" + } + ], + "index": 25, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 713, + 390, + 725 + ], + "spans": [ + { + "bbox": [ + 106, + 713, + 390, + 725 + ], + "score": 1.0, + "content": "We significantly outperform Lecuyer et al. (2019) on all three datasets.", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 701, + 506, + 725 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/SJlKrkSFPH/SJlKrkSFPH_model.json b/parse/train/SJlKrkSFPH/SJlKrkSFPH_model.json new file mode 100644 index 0000000000000000000000000000000000000000..be31e724252ce33cebfb138ee960c259ddc1e19c --- /dev/null +++ b/parse/train/SJlKrkSFPH/SJlKrkSFPH_model.json @@ -0,0 +1,46710 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 749, + 1303, + 749, + 1303, + 1300, + 398, + 1300 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1442, + 1405, + 1442, + 1405, + 1897, + 298, + 1897 + ], + "score": 0.982 + }, + { + "category_id": 0, + "poly": [ + 299, + 220, + 1402, + 220, + 1402, + 323, + 299, + 323 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 300, + 1914, + 1402, + 1914, + 1402, + 1976, + 300, + 1976 + ], + "score": 0.94 + }, + { + "category_id": 2, + "poly": [ + 331, + 2006, + 803, + 2006, + 803, + 2034, + 331, + 2034 + ], + "score": 0.919 + }, + { + "category_id": 0, + "poly": [ + 302, + 1367, + 573, + 1367, + 573, + 1402, + 302, + 1402 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 817, + 75, + 817, + 104, + 300, + 104 + ], + "score": 0.882 + }, + { + "category_id": 0, + "poly": [ + 773, + 678, + 927, + 678, + 927, + 711, + 773, + 711 + ], + "score": 0.872 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 856, + 2088, + 856, + 2112, + 840, + 2112 + ], + "score": 0.738 + }, + { + "category_id": 1, + "poly": [ + 310, + 373, + 1366, + 373, + 1366, + 600, + 310, + 600 + ], + "score": 0.649 + }, + { + "category_id": 13, + "poly": [ + 597, + 1686, + 626, + 1686, + 626, + 1719, + 597, + 1719 + ], + "score": 0.89, + "latex": "\\ell _ { p }" + }, + { + "category_id": 13, + "poly": [ + 719, + 1179, + 738, + 1179, + 738, + 1210, + 719, + 1210 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 218.0, + 1408.0, + 218.0, + 1408.0, + 272.0, + 292.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 274.0, + 1310.0, + 274.0, + 1310.0, + 329.0, + 295.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1999.0, + 807.0, + 1999.0, + 807.0, + 2039.0, + 330.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1364.0, + 579.0, + 1364.0, + 579.0, + 1411.0, + 294.0, + 1411.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": [ + 768.0, + 674.0, + 934.0, + 674.0, + 934.0, + 717.0, + 768.0, + 717.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": [ + 394.0, + 750.0, + 1304.0, + 750.0, + 1304.0, + 787.0, + 394.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 783.0, + 1307.0, + 783.0, + 1307.0, + 816.0, + 395.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 813.0, + 1306.0, + 813.0, + 1306.0, + 846.0, + 394.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 843.0, + 1307.0, + 843.0, + 1307.0, + 877.0, + 393.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 874.0, + 1308.0, + 874.0, + 1308.0, + 910.0, + 392.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 902.0, + 1305.0, + 902.0, + 1305.0, + 941.0, + 393.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 935.0, + 1306.0, + 935.0, + 1306.0, + 971.0, + 394.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 965.0, + 1307.0, + 965.0, + 1307.0, + 1001.0, + 393.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 993.0, + 1305.0, + 993.0, + 1305.0, + 1033.0, + 392.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1027.0, + 1304.0, + 1027.0, + 1304.0, + 1060.0, + 393.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1056.0, + 1308.0, + 1056.0, + 1308.0, + 1091.0, + 392.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1087.0, + 1305.0, + 1087.0, + 1305.0, + 1123.0, + 393.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1114.0, + 1305.0, + 1114.0, + 1305.0, + 1154.0, + 392.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1148.0, + 1306.0, + 1148.0, + 1306.0, + 1184.0, + 393.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1178.0, + 718.0, + 1178.0, + 718.0, + 1214.0, + 393.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 1178.0, + 1305.0, + 1178.0, + 1305.0, + 1214.0, + 739.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1205.0, + 1305.0, + 1205.0, + 1305.0, + 1246.0, + 392.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1238.0, + 1304.0, + 1238.0, + 1304.0, + 1273.0, + 394.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1267.0, + 713.0, + 1267.0, + 713.0, + 1304.0, + 395.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1437.0, + 1405.0, + 1437.0, + 1405.0, + 1478.0, + 292.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1473.0, + 1403.0, + 1473.0, + 1403.0, + 1507.0, + 295.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1499.0, + 1406.0, + 1499.0, + 1406.0, + 1539.0, + 291.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1532.0, + 1407.0, + 1532.0, + 1407.0, + 1567.0, + 295.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1560.0, + 1407.0, + 1560.0, + 1407.0, + 1596.0, + 293.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1591.0, + 1408.0, + 1591.0, + 1408.0, + 1630.0, + 292.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1620.0, + 1406.0, + 1620.0, + 1406.0, + 1660.0, + 293.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1656.0, + 1405.0, + 1656.0, + 1405.0, + 1687.0, + 296.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1682.0, + 596.0, + 1682.0, + 596.0, + 1722.0, + 292.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1682.0, + 1406.0, + 1682.0, + 1406.0, + 1722.0, + 627.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1715.0, + 1408.0, + 1715.0, + 1408.0, + 1750.0, + 295.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1740.0, + 1406.0, + 1740.0, + 1406.0, + 1784.0, + 292.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1774.0, + 1405.0, + 1774.0, + 1405.0, + 1811.0, + 292.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1806.0, + 1403.0, + 1806.0, + 1403.0, + 1840.0, + 295.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1835.0, + 1405.0, + 1835.0, + 1405.0, + 1871.0, + 293.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1868.0, + 864.0, + 1868.0, + 864.0, + 1902.0, + 295.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1911.0, + 1406.0, + 1911.0, + 1406.0, + 1949.0, + 295.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1407.0, + 1942.0, + 1407.0, + 1980.0, + 294.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 374.0, + 705.0, + 374.0, + 705.0, + 410.0, + 311.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 370.0, + 1315.0, + 370.0, + 1315.0, + 411.0, + 726.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 406.0, + 710.0, + 406.0, + 710.0, + 446.0, + 312.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 403.0, + 1286.0, + 403.0, + 1286.0, + 443.0, + 730.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 437.0, + 1007.0, + 437.0, + 1007.0, + 482.0, + 312.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 469.0, + 1263.0, + 469.0, + 1263.0, + 512.0, + 308.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 500.0, + 635.0, + 500.0, + 635.0, + 542.0, + 308.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 531.0, + 1373.0, + 531.0, + 1373.0, + 573.0, + 312.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 566.0, + 1253.0, + 566.0, + 1253.0, + 601.0, + 314.0, + 601.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 381, + 1404, + 381, + 1404, + 597, + 297, + 597 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1555, + 1404, + 1555, + 1404, + 1713, + 297, + 1713 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1801, + 1403, + 1801, + 1403, + 1958, + 298, + 1958 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 295, + 229, + 1401, + 229, + 1401, + 293, + 295, + 293 + ], + "score": 0.955 + }, + { + "category_id": 8, + "poly": [ + 630, + 308, + 1066, + 308, + 1066, + 366, + 630, + 366 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 296, + 611, + 1402, + 611, + 1402, + 675, + 296, + 675 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 659, + 1726, + 1042, + 1726, + 1042, + 1783, + 659, + 1783 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 296, + 1971, + 1403, + 1971, + 1403, + 2035, + 296, + 2035 + ], + "score": 0.948 + }, + { + "category_id": 0, + "poly": [ + 299, + 1490, + 1156, + 1490, + 1156, + 1524, + 299, + 1524 + ], + "score": 0.912 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.911 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1732, + 1399, + 1732, + 1399, + 1761, + 1366, + 1761 + ], + "score": 0.893 + }, + { + "category_id": 9, + "poly": [ + 1366, + 313, + 1399, + 313, + 1399, + 343, + 1366, + 343 + ], + "score": 0.892 + }, + { + "category_id": 1, + "poly": [ + 299, + 708, + 999, + 708, + 999, + 740, + 299, + 740 + ], + "score": 0.854 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.719 + }, + { + "category_id": 1, + "poly": [ + 314, + 931, + 1398, + 931, + 1398, + 1023, + 314, + 1023 + ], + "score": 0.603 + }, + { + "category_id": 1, + "poly": [ + 318, + 766, + 1404, + 766, + 1404, + 921, + 318, + 921 + ], + "score": 0.47 + }, + { + "category_id": 1, + "poly": [ + 319, + 1169, + 1404, + 1169, + 1404, + 1444, + 319, + 1444 + ], + "score": 0.398 + }, + { + "category_id": 1, + "poly": [ + 317, + 1034, + 1407, + 1034, + 1407, + 1157, + 317, + 1157 + ], + "score": 0.393 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.219 + }, + { + "category_id": 14, + "poly": [ + 629, + 308, + 1067, + 308, + 1067, + 366, + 629, + 366 + ], + "score": 0.94, + "latex": "h _ { s } ( x ) = \\underset { y \\in \\mathcal { V } } { \\arg \\operatorname* { m a x } } \\ \\underset { X \\sim \\mu ( x ) } { \\mathbb { P } } \\big [ h ( X ) = y \\big ] \\ ," + }, + { + "category_id": 14, + "poly": [ + 656, + 1726, + 1041, + 1726, + 1041, + 1783, + 656, + 1783 + ], + "score": 0.94, + "latex": "\\operatorname* { m i n } _ { \\| \\boldsymbol { x ^ { \\prime } } - \\boldsymbol { x } \\| \\le \\epsilon { \\boldsymbol X ^ { \\prime } } \\sim \\mu ( \\boldsymbol { x ^ { \\prime } } ) } [ h ( \\boldsymbol { X ^ { \\prime } } ) = + 1 ] ," + }, + { + "category_id": 13, + "poly": [ + 615, + 1558, + 792, + 1558, + 792, + 1592, + 615, + 1592 + ], + "score": 0.93, + "latex": "h : \\mathcal { X } \\{ \\pm 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 1329, + 2003, + 1397, + 2003, + 1397, + 2036, + 1329, + 2036 + ], + "score": 0.92, + "latex": "\\mathcal { P } ( \\mathcal { X } )" + }, + { + "category_id": 13, + "poly": [ + 498, + 1682, + 639, + 1682, + 639, + 1714, + 498, + 1714 + ], + "score": 0.92, + "latex": "h _ { s } ( x ) = + 1" + }, + { + "category_id": 13, + "poly": [ + 871, + 1230, + 934, + 1230, + 934, + 1261, + 871, + 1261 + ], + "score": 0.92, + "latex": "\\ell _ { 0 } , \\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 298, + 444, + 354, + 444, + 354, + 477, + 298, + 477 + ], + "score": 0.91, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 362, + 1682, + 437, + 1682, + 437, + 1709, + 362, + 1709 + ], + "score": 0.9, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 869, + 385, + 900, + 385, + 900, + 414, + 869, + 414 + ], + "score": 0.9, + "latex": "h _ { s }" + }, + { + "category_id": 13, + "poly": [ + 855, + 1290, + 884, + 1290, + 884, + 1322, + 855, + 1322 + ], + "score": 0.87, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 518, + 1261, + 547, + 1261, + 547, + 1291, + 518, + 1291 + ], + "score": 0.86, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 559, + 1621, + 589, + 1621, + 589, + 1650, + 559, + 1650 + ], + "score": 0.86, + "latex": "h _ { s }" + }, + { + "category_id": 13, + "poly": [ + 968, + 1230, + 996, + 1230, + 996, + 1260, + 968, + 1260 + ], + "score": 0.86, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1134, + 1321, + 1162, + 1321, + 1162, + 1351, + 1134, + 1351 + ], + "score": 0.85, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 762, + 1930, + 779, + 1930, + 779, + 1953, + 762, + 1953 + ], + "score": 0.85, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 976, + 1800, + 995, + 1800, + 995, + 1840, + 976, + 1840 + ], + "score": 0.83, + "latex": "\\frac { 1 } { 2 }" + }, + { + "category_id": 13, + "poly": [ + 748, + 415, + 768, + 415, + 768, + 441, + 748, + 441 + ], + "score": 0.83, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 574, + 1650, + 611, + 1650, + 611, + 1682, + 574, + 1682 + ], + "score": 0.83, + "latex": "\\left\\| \\cdot \\right\\|" + }, + { + "category_id": 13, + "poly": [ + 548, + 1591, + 568, + 1591, + 568, + 1617, + 548, + 1617 + ], + "score": 0.82, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 497, + 2004, + 524, + 2004, + 524, + 2030, + 497, + 2030 + ], + "score": 0.8, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 1277, + 476, + 1297, + 476, + 1297, + 502, + 1277, + 502 + ], + "score": 0.79, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 326, + 1866, + 345, + 1866, + 345, + 1892, + 326, + 1892 + ], + "score": 0.79, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 403, + 263, + 422, + 263, + 422, + 289, + 403, + 289 + ], + "score": 0.77, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 1040, + 537, + 1058, + 537, + 1058, + 563, + 1040, + 563 + ], + "score": 0.77, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 748, + 263, + 771, + 263, + 771, + 292, + 748, + 292 + ], + "score": 0.77, + "latex": "\\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 1330, + 1625, + 1345, + 1625, + 1345, + 1647, + 1330, + 1647 + ], + "score": 0.7, + "latex": "\\epsilon" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1485.0, + 1161.0, + 1485.0, + 1161.0, + 1530.0, + 291.0, + 1530.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": [ + 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, + 862.0, + 2085.0, + 862.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 380.0, + 868.0, + 380.0, + 868.0, + 419.0, + 294.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 380.0, + 1405.0, + 380.0, + 1405.0, + 419.0, + 901.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 414.0, + 747.0, + 414.0, + 747.0, + 448.0, + 295.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 414.0, + 1405.0, + 414.0, + 1405.0, + 448.0, + 769.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 442.0, + 297.0, + 442.0, + 297.0, + 480.0, + 294.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 442.0, + 1407.0, + 442.0, + 1407.0, + 480.0, + 355.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 473.0, + 1276.0, + 473.0, + 1276.0, + 510.0, + 294.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 473.0, + 1404.0, + 473.0, + 1404.0, + 510.0, + 1298.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 505.0, + 1404.0, + 505.0, + 1404.0, + 538.0, + 292.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 536.0, + 1039.0, + 536.0, + 1039.0, + 570.0, + 295.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 536.0, + 1406.0, + 536.0, + 1406.0, + 570.0, + 1059.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 568.0, + 437.0, + 568.0, + 437.0, + 600.0, + 295.0, + 600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1559.0, + 614.0, + 1559.0, + 614.0, + 1592.0, + 297.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 1559.0, + 1404.0, + 1559.0, + 1404.0, + 1592.0, + 793.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1588.0, + 547.0, + 1588.0, + 547.0, + 1622.0, + 296.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1588.0, + 1404.0, + 1588.0, + 1404.0, + 1622.0, + 569.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1617.0, + 558.0, + 1617.0, + 558.0, + 1656.0, + 294.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 1617.0, + 1329.0, + 1617.0, + 1329.0, + 1656.0, + 590.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 1617.0, + 1406.0, + 1617.0, + 1406.0, + 1656.0, + 1346.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1649.0, + 573.0, + 1649.0, + 573.0, + 1684.0, + 292.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 1649.0, + 1406.0, + 1649.0, + 1406.0, + 1684.0, + 612.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1680.0, + 361.0, + 1680.0, + 361.0, + 1716.0, + 294.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 1680.0, + 497.0, + 1680.0, + 497.0, + 1716.0, + 438.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 1680.0, + 1307.0, + 1680.0, + 1307.0, + 1716.0, + 640.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1798.0, + 975.0, + 1798.0, + 975.0, + 1843.0, + 292.0, + 1843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 1798.0, + 1408.0, + 1798.0, + 1408.0, + 1843.0, + 996.0, + 1843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1833.0, + 1405.0, + 1833.0, + 1405.0, + 1870.0, + 294.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1862.0, + 325.0, + 1862.0, + 325.0, + 1901.0, + 293.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1862.0, + 1405.0, + 1862.0, + 1405.0, + 1901.0, + 346.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1893.0, + 1405.0, + 1893.0, + 1405.0, + 1930.0, + 294.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1925.0, + 761.0, + 1925.0, + 761.0, + 1958.0, + 296.0, + 1958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 1925.0, + 788.0, + 1925.0, + 788.0, + 1958.0, + 780.0, + 1958.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": [ + 295.0, + 261.0, + 402.0, + 261.0, + 402.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 261.0, + 747.0, + 261.0, + 747.0, + 297.0, + 423.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 261.0, + 781.0, + 261.0, + 781.0, + 297.0, + 772.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 611.0, + 1404.0, + 611.0, + 1404.0, + 647.0, + 294.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 644.0, + 1039.0, + 644.0, + 1039.0, + 680.0, + 296.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1970.0, + 1405.0, + 1970.0, + 1405.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 496.0, + 2002.0, + 496.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 2002.0, + 1328.0, + 2002.0, + 1328.0, + 2038.0, + 525.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 2002.0, + 1408.0, + 2002.0, + 1408.0, + 2038.0, + 1398.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 705.0, + 1004.0, + 705.0, + 1004.0, + 746.0, + 296.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 930.0, + 1404.0, + 930.0, + 1404.0, + 967.0, + 315.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 963.0, + 1404.0, + 963.0, + 1404.0, + 996.0, + 350.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 991.0, + 1240.0, + 991.0, + 1240.0, + 1029.0, + 352.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 768.0, + 1403.0, + 768.0, + 1403.0, + 801.0, + 319.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 798.0, + 1405.0, + 798.0, + 1405.0, + 836.0, + 350.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 828.0, + 1406.0, + 828.0, + 1406.0, + 863.0, + 348.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 858.0, + 1406.0, + 858.0, + 1406.0, + 895.0, + 350.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 889.0, + 1216.0, + 889.0, + 1216.0, + 925.0, + 350.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 1166.0, + 1408.0, + 1166.0, + 1408.0, + 1204.0, + 313.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1196.0, + 1406.0, + 1196.0, + 1406.0, + 1234.0, + 349.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1230.0, + 870.0, + 1230.0, + 870.0, + 1264.0, + 349.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 1230.0, + 967.0, + 1230.0, + 967.0, + 1264.0, + 935.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1230.0, + 1405.0, + 1230.0, + 1405.0, + 1264.0, + 997.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1261.0, + 517.0, + 1261.0, + 517.0, + 1293.0, + 352.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 1261.0, + 1405.0, + 1261.0, + 1405.0, + 1293.0, + 548.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 1287.0, + 854.0, + 1287.0, + 854.0, + 1329.0, + 347.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1287.0, + 1406.0, + 1287.0, + 1406.0, + 1329.0, + 885.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1321.0, + 1133.0, + 1321.0, + 1133.0, + 1355.0, + 348.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1163.0, + 1321.0, + 1405.0, + 1321.0, + 1405.0, + 1355.0, + 1163.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1351.0, + 1406.0, + 1351.0, + 1406.0, + 1383.0, + 350.0, + 1383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1381.0, + 1405.0, + 1381.0, + 1405.0, + 1417.0, + 349.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1409.0, + 1358.0, + 1409.0, + 1358.0, + 1448.0, + 348.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 1034.0, + 1405.0, + 1034.0, + 1405.0, + 1066.0, + 315.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1064.0, + 1405.0, + 1064.0, + 1405.0, + 1099.0, + 350.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 1097.0, + 1405.0, + 1097.0, + 1405.0, + 1129.0, + 351.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1126.0, + 1000.0, + 1126.0, + 1000.0, + 1161.0, + 350.0, + 1161.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1757, + 1406, + 1757, + 1406, + 2035, + 296, + 2035 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 620, + 1404, + 620, + 1404, + 811, + 298, + 811 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 343, + 1405, + 343, + 1405, + 530, + 297, + 530 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1446, + 1404, + 1446, + 1404, + 1603, + 298, + 1603 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1610, + 1404, + 1610, + 1404, + 1735, + 298, + 1735 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1036, + 1405, + 1036, + 1405, + 1161, + 298, + 1161 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 1168, + 1406, + 1168, + 1406, + 1263, + 297, + 1263 + ], + "score": 0.975 + }, + { + "category_id": 8, + "poly": [ + 623, + 274, + 1070, + 274, + 1070, + 331, + 623, + 331 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 297, + 959, + 1404, + 959, + 1404, + 1022, + 297, + 1022 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 297, + 821, + 1401, + 821, + 1401, + 884, + 297, + 884 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 296, + 1360, + 1400, + 1360, + 1400, + 1425, + 296, + 1425 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 649, + 895, + 1048, + 895, + 1048, + 948, + 649, + 948 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 788, + 229, + 788, + 263, + 299, + 263 + ], + "score": 0.929 + }, + { + "category_id": 8, + "poly": [ + 382, + 1275, + 1312, + 1275, + 1312, + 1346, + 382, + 1346 + ], + "score": 0.928 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 816, + 74, + 816, + 105, + 298, + 105 + ], + "score": 0.912 + }, + { + "category_id": 9, + "poly": [ + 1366, + 278, + 1400, + 278, + 1400, + 309, + 1366, + 309 + ], + "score": 0.886 + }, + { + "category_id": 9, + "poly": [ + 1366, + 901, + 1400, + 901, + 1400, + 930, + 1366, + 930 + ], + "score": 0.879 + }, + { + "category_id": 0, + "poly": [ + 299, + 566, + 1074, + 566, + 1074, + 596, + 299, + 596 + ], + "score": 0.862 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.627 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.46 + }, + { + "category_id": 13, + "poly": [ + 1112, + 682, + 1212, + 682, + 1212, + 714, + 1112, + 714 + ], + "score": 0.94, + "latex": "\\mathcal { \\hat { X } } \\subseteq \\mathbb { R } ^ { d }" + }, + { + "category_id": 14, + "poly": [ + 647, + 896, + 1050, + 896, + 1050, + 948, + 647, + 948 + ], + "score": 0.93, + "latex": "{ \\mathrm { O P T } } ( \\phi , \\rho , { \\mathcal { D } } ) : = \\operatorname* { m i n } _ { \\nu \\in { \\mathcal { D } } } \\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\ ," + }, + { + "category_id": 13, + "poly": [ + 1256, + 1611, + 1373, + 1611, + 1373, + 1644, + 1256, + 1644 + ], + "score": 0.93, + "latex": "\\rho \\in { \\mathcal { P } } ( { \\mathcal { X } } )" + }, + { + "category_id": 13, + "poly": [ + 374, + 1392, + 575, + 1392, + 575, + 1425, + 374, + 1425 + ], + "score": 0.93, + "latex": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 374, + 1703, + 575, + 1703, + 575, + 1736, + 374, + 1736 + ], + "score": 0.93, + "latex": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 298, + 1230, + 426, + 1230, + 426, + 1264, + 298, + 1264 + ], + "score": 0.92, + "latex": "\\mathcal { D } \\subset \\mathcal { P } ( \\mathcal { X } )" + }, + { + "category_id": 13, + "poly": [ + 654, + 1393, + 808, + 1393, + 808, + 1423, + 654, + 1423 + ], + "score": 0.92, + "latex": "\\nu \\in \\mathcal { D } , \\phi \\in S" + }, + { + "category_id": 13, + "poly": [ + 1285, + 344, + 1403, + 344, + 1403, + 378, + 1285, + 378 + ], + "score": 0.92, + "latex": "\\nu \\in { \\mathcal { P } } ( { \\mathcal { X } } )" + }, + { + "category_id": 14, + "poly": [ + 622, + 274, + 1076, + 274, + 1076, + 330, + 622, + 330 + ], + "score": 0.92, + "latex": "\\operatorname* { m i n } _ { \\nu \\in \\{ \\mu ( x ^ { \\prime } ) \\colon \\| x ^ { \\prime } - x \\| \\leq \\epsilon \\} } \\operatorname* { l p } _ { X ^ { \\prime } \\sim \\nu } [ h ( X ^ { \\prime } ) = + 1 ] ." + }, + { + "category_id": 13, + "poly": [ + 1276, + 1169, + 1396, + 1169, + 1396, + 1203, + 1276, + 1203 + ], + "score": 0.92, + "latex": "\\rho \\in { \\mathcal { P } } ( { \\mathcal { X } } )" + }, + { + "category_id": 13, + "poly": [ + 448, + 1642, + 636, + 1642, + 636, + 1672, + 448, + 1672 + ], + "score": 0.92, + "latex": "\\phi : \\mathcal { X } \\to \\mathcal { Z } \\subseteq \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 446, + 1200, + 513, + 1200, + 513, + 1231, + 446, + 1231 + ], + "score": 0.92, + "latex": "\\theta _ { a } , \\theta _ { b }" + }, + { + "category_id": 13, + "poly": [ + 298, + 436, + 409, + 436, + 409, + 469, + 298, + 469 + ], + "score": 0.92, + "latex": "\\rho = \\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 1121, + 1642, + 1250, + 1642, + 1250, + 1675, + 1121, + 1675 + ], + "score": 0.92, + "latex": "\\mathcal { D } \\subset \\mathcal { P } ( \\mathcal { X } )" + }, + { + "category_id": 13, + "poly": [ + 652, + 1200, + 929, + 1200, + 929, + 1232, + 652, + 1232 + ], + "score": 0.92, + "latex": "\\theta _ { a } , \\theta _ { b } \\geq 0 , \\theta _ { a } + \\theta _ { b } \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 581, + 375, + 983, + 375, + 983, + 409, + 581, + 409 + ], + "score": 0.92, + "latex": "\\nu \\in \\mathcal { D } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\leq \\epsilon \\}" + }, + { + "category_id": 13, + "poly": [ + 472, + 435, + 768, + 435, + 768, + 469, + 472, + 469 + ], + "score": 0.91, + "latex": "\\mathcal { D } \\subseteq \\{ \\nu : D ( \\nu \\| \\rho ) \\leq \\epsilon _ { D } \\}" + }, + { + "category_id": 13, + "poly": [ + 1094, + 623, + 1282, + 623, + 1282, + 654, + 1094, + 654 + ], + "score": 0.91, + "latex": "\\phi : \\mathcal { X } \\to \\mathcal { Z } \\subseteq \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 469, + 745, + 586, + 745, + 586, + 777, + 469, + 777 + ], + "score": 0.9, + "latex": "\\rho = \\mu ( x ) )" + }, + { + "category_id": 13, + "poly": [ + 425, + 774, + 840, + 774, + 840, + 810, + 425, + 810 + ], + "score": 0.9, + "latex": "\\mathcal { D } = \\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\le \\bar { \\epsilon } \\}" + }, + { + "category_id": 13, + "poly": [ + 653, + 1704, + 727, + 1704, + 727, + 1731, + 653, + 1731 + ], + "score": 0.9, + "latex": "\\nu \\in \\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 963, + 1448, + 1278, + 1448, + 1278, + 1482, + 963, + 1482 + ], + "score": 0.89, + "latex": "{ \\mathrm { E } } _ { X \\sim \\nu } [ \\phi ( X ) ] \\geq 0 \\quad \\forall \\nu \\in { \\mathcal { D } }" + }, + { + "category_id": 14, + "poly": [ + 381, + 1273, + 1318, + 1273, + 1318, + 1350, + 381, + 1350 + ], + "score": 0.88, + "latex": "S = \\left\\{ \\phi : \\mathcal { X } \\to \\{ - 1 , 0 , + 1 \\} \\mathrm { ~ s . t . ~ } \\operatorname { \\mathbb { P } } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] \\geq \\theta _ { a } , \\operatorname { \\mathbb { P } } _ { X \\sim \\rho } [ \\phi ( X ) = - 1 ] \\leq \\theta _ { b } \\right\\}" + }, + { + "category_id": 13, + "poly": [ + 1177, + 1974, + 1197, + 1974, + 1197, + 2005, + 1177, + 2005 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 429, + 1674, + 449, + 1674, + 449, + 1703, + 429, + 1703 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 841, + 1542, + 860, + 1542, + 860, + 1572, + 841, + 1572 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 688, + 1450, + 708, + 1450, + 708, + 1480, + 688, + 1480 + ], + "score": 0.84, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 298, + 498, + 317, + 498, + 317, + 529, + 298, + 529 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 666, + 1132, + 684, + 1132, + 684, + 1161, + 666, + 1161 + ], + "score": 0.84, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 709, + 824, + 729, + 824, + 729, + 854, + 709, + 854 + ], + "score": 0.84, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 427, + 1362, + 449, + 1362, + 449, + 1389, + 427, + 1389 + ], + "score": 0.84, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1148, + 1852, + 1168, + 1852, + 1168, + 1882, + 1148, + 1882 + ], + "score": 0.84, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 1094, + 1363, + 1120, + 1363, + 1120, + 1389, + 1094, + 1389 + ], + "score": 0.83, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 1279, + 1761, + 1299, + 1761, + 1299, + 1791, + 1279, + 1791 + ], + "score": 0.83, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 946, + 1232, + 967, + 1232, + 967, + 1258, + 946, + 1258 + ], + "score": 0.83, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1082, + 1673, + 1107, + 1673, + 1107, + 1699, + 1082, + 1699 + ], + "score": 0.83, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 909, + 1367, + 927, + 1367, + 927, + 1394, + 909, + 1394 + ], + "score": 0.82, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 1135, + 720, + 1154, + 720, + 1154, + 747, + 1135, + 747 + ], + "score": 0.82, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 1077, + 746, + 1102, + 746, + 1102, + 772, + 1077, + 772 + ], + "score": 0.82, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 888, + 1677, + 907, + 1677, + 907, + 1704, + 888, + 1704 + ], + "score": 0.82, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 849, + 437, + 876, + 437, + 876, + 464, + 849, + 464 + ], + "score": 0.8, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 633, + 1542, + 659, + 1542, + 659, + 1568, + 633, + 1568 + ], + "score": 0.8, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 594, + 1481, + 615, + 1481, + 615, + 1507, + 594, + 1507 + ], + "score": 0.78, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1383, + 685, + 1402, + 685, + 1402, + 711, + 1383, + 711 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 554, + 1237, + 571, + 1237, + 571, + 1263, + 554, + 1263 + ], + "score": 0.77, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 1380, + 1649, + 1396, + 1649, + 1396, + 1674, + 1380, + 1674 + ], + "score": 0.76, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 1334, + 411, + 1354, + 411, + 1354, + 433, + 1334, + 433 + ], + "score": 0.74, + "latex": "\\nu" + }, + { + "category_id": 13, + "poly": [ + 649, + 1098, + 1098, + 1098, + 1098, + 1133, + 649, + 1133 + ], + "score": 0.65, + "latex": "\\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] , \\mathbb { P } _ { X \\sim \\nu } [ \\phi ( X ) = + 1 ]" + }, + { + "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, + 565.0, + 1076.0, + 565.0, + 1076.0, + 599.0, + 295.0, + 599.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, + 1757.0, + 1278.0, + 1757.0, + 1278.0, + 1796.0, + 293.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1757.0, + 1406.0, + 1757.0, + 1406.0, + 1796.0, + 1300.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1787.0, + 1406.0, + 1787.0, + 1406.0, + 1825.0, + 293.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1819.0, + 1406.0, + 1819.0, + 1406.0, + 1857.0, + 293.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1850.0, + 1147.0, + 1850.0, + 1147.0, + 1884.0, + 294.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1169.0, + 1850.0, + 1406.0, + 1850.0, + 1406.0, + 1884.0, + 1169.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1883.0, + 1406.0, + 1883.0, + 1406.0, + 1916.0, + 295.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 1408.0, + 1910.0, + 1408.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1937.0, + 1407.0, + 1937.0, + 1407.0, + 1983.0, + 291.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1176.0, + 1971.0, + 1176.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 1971.0, + 1406.0, + 1971.0, + 1406.0, + 2009.0, + 1198.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2004.0, + 1012.0, + 2004.0, + 1012.0, + 2036.0, + 296.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 621.0, + 1093.0, + 621.0, + 1093.0, + 657.0, + 294.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 621.0, + 1405.0, + 621.0, + 1405.0, + 657.0, + 1283.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 654.0, + 1405.0, + 654.0, + 1405.0, + 687.0, + 296.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 682.0, + 1111.0, + 682.0, + 1111.0, + 717.0, + 292.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 682.0, + 1382.0, + 682.0, + 1382.0, + 717.0, + 1213.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 682.0, + 1407.0, + 682.0, + 1407.0, + 717.0, + 1403.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 712.0, + 1134.0, + 712.0, + 1134.0, + 749.0, + 293.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 712.0, + 1404.0, + 712.0, + 1404.0, + 749.0, + 1155.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 744.0, + 468.0, + 744.0, + 468.0, + 780.0, + 294.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 744.0, + 1076.0, + 744.0, + 1076.0, + 780.0, + 587.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 744.0, + 1405.0, + 744.0, + 1405.0, + 780.0, + 1103.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 774.0, + 424.0, + 774.0, + 424.0, + 810.0, + 294.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 774.0, + 856.0, + 774.0, + 856.0, + 810.0, + 841.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 343.0, + 1284.0, + 343.0, + 1284.0, + 379.0, + 294.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 374.0, + 580.0, + 374.0, + 580.0, + 410.0, + 295.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 984.0, + 374.0, + 1407.0, + 374.0, + 1407.0, + 410.0, + 984.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 404.0, + 1333.0, + 404.0, + 1333.0, + 440.0, + 295.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 404.0, + 1406.0, + 404.0, + 1406.0, + 440.0, + 1355.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 433.0, + 297.0, + 433.0, + 297.0, + 471.0, + 291.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 433.0, + 471.0, + 433.0, + 471.0, + 471.0, + 410.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 433.0, + 848.0, + 433.0, + 848.0, + 471.0, + 769.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 433.0, + 1406.0, + 433.0, + 1406.0, + 471.0, + 877.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 461.0, + 1406.0, + 461.0, + 1406.0, + 504.0, + 292.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 495.0, + 1235.0, + 495.0, + 1235.0, + 531.0, + 318.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1446.0, + 687.0, + 1446.0, + 687.0, + 1483.0, + 294.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1446.0, + 962.0, + 1446.0, + 962.0, + 1483.0, + 709.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 1446.0, + 1404.0, + 1446.0, + 1404.0, + 1483.0, + 1279.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1476.0, + 593.0, + 1476.0, + 593.0, + 1516.0, + 293.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 1476.0, + 1405.0, + 1476.0, + 1405.0, + 1516.0, + 616.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1508.0, + 1405.0, + 1508.0, + 1405.0, + 1546.0, + 292.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1539.0, + 632.0, + 1539.0, + 632.0, + 1577.0, + 294.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 1539.0, + 840.0, + 1539.0, + 840.0, + 1577.0, + 660.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 1539.0, + 1405.0, + 1539.0, + 1405.0, + 1577.0, + 861.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1571.0, + 798.0, + 1571.0, + 798.0, + 1605.0, + 296.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1608.0, + 1255.0, + 1608.0, + 1255.0, + 1647.0, + 292.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1374.0, + 1608.0, + 1408.0, + 1608.0, + 1408.0, + 1647.0, + 1374.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1636.0, + 447.0, + 1636.0, + 447.0, + 1683.0, + 291.0, + 1683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 1636.0, + 1120.0, + 1636.0, + 1120.0, + 1683.0, + 637.0, + 1683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1636.0, + 1379.0, + 1636.0, + 1379.0, + 1683.0, + 1251.0, + 1683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 1636.0, + 1411.0, + 1636.0, + 1411.0, + 1683.0, + 1397.0, + 1683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1672.0, + 428.0, + 1672.0, + 428.0, + 1705.0, + 294.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1672.0, + 887.0, + 1672.0, + 887.0, + 1705.0, + 450.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1672.0, + 1081.0, + 1672.0, + 1081.0, + 1705.0, + 908.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 1672.0, + 1402.0, + 1672.0, + 1402.0, + 1705.0, + 1108.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1702.0, + 373.0, + 1702.0, + 373.0, + 1738.0, + 293.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1702.0, + 652.0, + 1702.0, + 652.0, + 1738.0, + 576.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 1702.0, + 739.0, + 1702.0, + 739.0, + 1738.0, + 728.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1038.0, + 1405.0, + 1038.0, + 1405.0, + 1070.0, + 296.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1067.0, + 1405.0, + 1067.0, + 1405.0, + 1103.0, + 295.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1099.0, + 648.0, + 1099.0, + 648.0, + 1134.0, + 292.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 1099.0, + 1406.0, + 1099.0, + 1406.0, + 1134.0, + 1099.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1129.0, + 665.0, + 1129.0, + 665.0, + 1163.0, + 293.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 1129.0, + 990.0, + 1129.0, + 990.0, + 1163.0, + 685.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1164.0, + 1275.0, + 1164.0, + 1275.0, + 1206.0, + 292.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1397.0, + 1164.0, + 1407.0, + 1164.0, + 1407.0, + 1206.0, + 1397.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1198.0, + 445.0, + 1198.0, + 445.0, + 1235.0, + 292.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 1198.0, + 651.0, + 1198.0, + 651.0, + 1235.0, + 514.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 1198.0, + 1407.0, + 1198.0, + 1407.0, + 1235.0, + 930.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1229.0, + 297.0, + 1229.0, + 297.0, + 1267.0, + 294.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 427.0, + 1229.0, + 553.0, + 1229.0, + 553.0, + 1267.0, + 427.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 1229.0, + 945.0, + 1229.0, + 945.0, + 1267.0, + 572.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 1229.0, + 1004.0, + 1229.0, + 1004.0, + 1267.0, + 968.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 961.0, + 1405.0, + 961.0, + 1405.0, + 993.0, + 295.0, + 993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 991.0, + 1110.0, + 991.0, + 1110.0, + 1022.0, + 296.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 819.0, + 708.0, + 819.0, + 708.0, + 859.0, + 295.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 819.0, + 1405.0, + 819.0, + 1405.0, + 859.0, + 730.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 853.0, + 772.0, + 853.0, + 772.0, + 887.0, + 295.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1358.0, + 426.0, + 1358.0, + 426.0, + 1396.0, + 294.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1358.0, + 908.0, + 1358.0, + 908.0, + 1396.0, + 450.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1358.0, + 1093.0, + 1358.0, + 1093.0, + 1396.0, + 928.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 1358.0, + 1404.0, + 1358.0, + 1404.0, + 1396.0, + 1121.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1390.0, + 373.0, + 1390.0, + 373.0, + 1426.0, + 294.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1390.0, + 653.0, + 1390.0, + 653.0, + 1426.0, + 576.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 1390.0, + 822.0, + 1390.0, + 822.0, + 1426.0, + 809.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 226.0, + 791.0, + 226.0, + 791.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 935, + 1406, + 935, + 1406, + 1091, + 297, + 1091 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1681, + 938, + 1681, + 938, + 1897, + 297, + 1897 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 296, + 281, + 1405, + 281, + 1405, + 469, + 296, + 469 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1492, + 1405, + 1492, + 1405, + 1619, + 297, + 1619 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 543, + 1405, + 543, + 1405, + 639, + 297, + 639 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 1368, + 1406, + 1368, + 1406, + 1462, + 297, + 1462 + ], + "score": 0.974 + }, + { + "category_id": 8, + "poly": [ + 655, + 654, + 1038, + 654, + 1038, + 764, + 655, + 764 + ], + "score": 0.961 + }, + { + "category_id": 3, + "poly": [ + 988, + 1690, + 1369, + 1690, + 1369, + 1951, + 988, + 1951 + ], + "score": 0.959 + }, + { + "category_id": 8, + "poly": [ + 666, + 1142, + 1033, + 1142, + 1033, + 1220, + 666, + 1220 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 298, + 1228, + 1398, + 1228, + 1398, + 1293, + 298, + 1293 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 292, + 778, + 1400, + 778, + 1400, + 844, + 292, + 844 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 634, + 1302, + 1062, + 1302, + 1062, + 1344, + 634, + 1344 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 324, + 1910, + 903, + 1910, + 903, + 1983, + 324, + 1983 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 592, + 478, + 1105, + 478, + 1105, + 518, + 592, + 518 + ], + "score": 0.928 + }, + { + "category_id": 8, + "poly": [ + 454, + 1631, + 1234, + 1631, + 1234, + 1673, + 454, + 1673 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 297, + 1096, + 1392, + 1096, + 1392, + 1131, + 297, + 1131 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 298, + 880, + 865, + 880, + 865, + 912, + 298, + 912 + ], + "score": 0.917 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 817, + 74, + 817, + 105, + 299, + 105 + ], + "score": 0.912 + }, + { + "category_id": 4, + "poly": [ + 955, + 1983, + 1406, + 1983, + 1406, + 2070, + 955, + 2070 + ], + "score": 0.907 + }, + { + "category_id": 9, + "poly": [ + 1365, + 484, + 1400, + 484, + 1400, + 513, + 1365, + 513 + ], + "score": 0.882 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.797 + }, + { + "category_id": 2, + "poly": [ + 299, + 230, + 1161, + 230, + 1161, + 262, + 299, + 262 + ], + "score": 0.553 + }, + { + "category_id": 2, + "poly": [ + 332, + 2003, + 950, + 2003, + 950, + 2068, + 332, + 2068 + ], + "score": 0.289 + }, + { + "category_id": 0, + "poly": [ + 299, + 230, + 1161, + 230, + 1161, + 262, + 299, + 262 + ], + "score": 0.253 + }, + { + "category_id": 13, + "poly": [ + 1058, + 375, + 1234, + 375, + 1234, + 408, + 1058, + 408 + ], + "score": 0.94, + "latex": "\\mu : \\mathcal X \\mapsto \\mathcal P ( \\mathcal X )" + }, + { + "category_id": 14, + "poly": [ + 664, + 1141, + 1032, + 1141, + 1032, + 1220, + 664, + 1220 + ], + "score": 0.94, + "latex": "D _ { f } ( \\nu \\| \\rho ) = \\underset { X \\sim \\rho } { \\mathrm { E } } \\Bigg [ f \\Bigg ( \\frac { \\nu ( X ) } { \\rho ( X ) } \\Bigg ) \\Bigg ] ~ ," + }, + { + "category_id": 14, + "poly": [ + 657, + 653, + 1036, + 653, + 1036, + 765, + 657, + 765 + ], + "score": 0.93, + "latex": "\\phi _ { c , c ^ { \\prime } } ( x ) = \\left\\{ \\begin{array} { l l } { { + 1 } } & { { \\mathrm { ~ i f ~ } h ( x ) = c ~ , } } \\\\ { { - 1 } } & { { \\mathrm { ~ i f ~ } h ( x ) = c ^ { \\prime } ~ , } } \\\\ { { 0 } } & { { \\mathrm { ~ o t h e r w i s e ~ . } } } \\end{array} \\right." + }, + { + "category_id": 13, + "poly": [ + 884, + 1098, + 1028, + 1098, + 1028, + 1132, + 884, + 1132 + ], + "score": 0.93, + "latex": "\\rho , \\nu \\in \\mathcal { P } ( \\mathcal { X } )" + }, + { + "category_id": 13, + "poly": [ + 995, + 605, + 1276, + 605, + 1276, + 640, + 995, + 640 + ], + "score": 0.93, + "latex": "\\phi _ { c , c ^ { \\prime } } : \\mathcal { X } \\mapsto \\{ - \\bar { 1 } , \\bar { 0 } , + 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 298, + 606, + 413, + 606, + 413, + 639, + 298, + 639 + ], + "score": 0.93, + "latex": "c = h _ { s } ( x )" + }, + { + "category_id": 13, + "poly": [ + 1127, + 968, + 1240, + 968, + 1240, + 1001, + 1127, + 1001 + ], + "score": 0.93, + "latex": "\\mathcal { D } _ { x , \\epsilon } \\subseteq \\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 1236, + 544, + 1349, + 544, + 1349, + 578, + 1236, + 578 + ], + "score": 0.92, + "latex": "\\rho = \\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 650, + 1525, + 836, + 1525, + 836, + 1559, + 650, + 1559 + ], + "score": 0.92, + "latex": "f ( u ) = u \\log ( u )" + }, + { + "category_id": 13, + "poly": [ + 1307, + 406, + 1375, + 406, + 1375, + 439, + 1307, + 439 + ], + "score": 0.92, + "latex": "h _ { s } ( x )" + }, + { + "category_id": 13, + "poly": [ + 850, + 1228, + 965, + 1228, + 965, + 1262, + 850, + 1262 + ], + "score": 0.92, + "latex": "f ( 1 ) = 0" + }, + { + "category_id": 13, + "poly": [ + 540, + 605, + 681, + 605, + 681, + 639, + 540, + 639 + ], + "score": 0.92, + "latex": "c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}" + }, + { + "category_id": 13, + "poly": [ + 581, + 1585, + 795, + 1585, + 795, + 1620, + 581, + 1620 + ], + "score": 0.92, + "latex": "\\mu ( x ) = \\mathcal { N } ( x , \\sigma ^ { 2 } I )" + }, + { + "category_id": 13, + "poly": [ + 630, + 575, + 971, + 575, + 971, + 609, + 630, + 609 + ], + "score": 0.92, + "latex": "\\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : d ( x , x ^ { \\prime } ) \\leq \\epsilon \\}" + }, + { + "category_id": 13, + "poly": [ + 375, + 1230, + 539, + 1230, + 539, + 1262, + 375, + 1262 + ], + "score": 0.92, + "latex": "f : \\mathbb { R } _ { + } \\mapsto \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 1115, + 781, + 1171, + 781, + 1171, + 814, + 1115, + 814 + ], + "score": 0.92, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 665, + 1773, + 751, + 1773, + 751, + 1804, + 665, + 1804 + ], + "score": 0.92, + "latex": "f \\in { \\mathcal { F } }" + }, + { + "category_id": 13, + "poly": [ + 636, + 1262, + 715, + 1262, + 715, + 1295, + 636, + 1295 + ], + "score": 0.92, + "latex": "\\epsilon _ { f } \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 523, + 939, + 577, + 939, + 577, + 971, + 523, + 971 + ], + "score": 0.91, + "latex": "\\mathcal { D } _ { x , \\epsilon }" + }, + { + "category_id": 13, + "poly": [ + 1271, + 2041, + 1322, + 2041, + 1322, + 2070, + 1271, + 2070 + ], + "score": 0.91, + "latex": "\\mathcal { D } _ { x , \\epsilon }" + }, + { + "category_id": 13, + "poly": [ + 298, + 376, + 429, + 376, + 429, + 406, + 298, + 406 + ], + "score": 0.91, + "latex": "h : \\mathcal { X } \\to \\mathcal { Y }" + }, + { + "category_id": 13, + "poly": [ + 450, + 1263, + 490, + 1263, + 490, + 1295, + 450, + 1295 + ], + "score": 0.9, + "latex": "D _ { f }" + }, + { + "category_id": 13, + "poly": [ + 1347, + 782, + 1401, + 782, + 1401, + 816, + 1347, + 816 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { x , \\epsilon }" + }, + { + "category_id": 14, + "poly": [ + 326, + 1907, + 906, + 1907, + 906, + 1985, + 326, + 1985 + ], + "score": 0.9, + "latex": "{ \\mathcal { D } } _ { { \\mathcal { F } } } : = \\bigcap _ { f \\in { \\mathcal { F } } } { \\mathcal { D } } _ { f } = \\left\\{ \\nu : \\forall f \\in { \\mathcal { F } } \\ D _ { f } ( \\nu \\| \\rho ) \\leq \\epsilon _ { f } \\right\\} \\ ." + }, + { + "category_id": 14, + "poly": [ + 632, + 1303, + 1065, + 1303, + 1065, + 1343, + 632, + 1343 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { f } = \\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { f } ( \\nu \\| \\rho ) \\leq \\epsilon _ { f } \\} \\ ." + }, + { + "category_id": 13, + "poly": [ + 1095, + 436, + 1299, + 436, + 1299, + 469, + 1095, + 469 + ], + "score": 0.89, + "latex": "d : \\mathcal { X } \\times \\mathcal { X } \\mapsto \\mathbb { R } _ { + }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1527, + 351, + 1527, + 351, + 1559, + 298, + 1559 + ], + "score": 0.89, + "latex": "\\mathcal { D } _ { x , \\epsilon }" + }, + { + "category_id": 13, + "poly": [ + 623, + 407, + 654, + 407, + 654, + 436, + 623, + 436 + ], + "score": 0.89, + "latex": "h _ { s }" + }, + { + "category_id": 13, + "poly": [ + 1316, + 2013, + 1357, + 2013, + 1357, + 2039, + 1316, + 2039 + ], + "score": 0.88, + "latex": "\\mathcal { D } _ { \\mathcal { F } }" + }, + { + "category_id": 14, + "poly": [ + 456, + 1631, + 1241, + 1631, + 1241, + 1673, + 456, + 1673 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { { \\mathcal { D } } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\} \\subseteq \\left\\{ \\nu : \\mathrm { K L } ( \\nu \\| \\mu ( x ) ) \\leq \\epsilon ^ { 2 } / ( 2 \\sigma ^ { 2 } ) \\right\\} \\ . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 588, + 477, + 1103, + 477, + 1103, + 518, + 588, + 518 + ], + "score": 0.86, + "latex": "h _ { s } ( x ^ { \\prime } ) = h _ { s } ( x ) \\quad \\forall x ^ { \\prime } \\ \\mathrm { s u c h ~ t h a t } \\ d ( x , x ^ { \\prime } ) \\leq \\epsilon ." + }, + { + "category_id": 13, + "poly": [ + 881, + 1263, + 900, + 1263, + 900, + 1293, + 881, + 1293 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 1098, + 1100, + 1117, + 1100, + 1117, + 1131, + 1098, + 1131 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 513, + 1496, + 532, + 1496, + 532, + 1527, + 513, + 1527 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 298, + 1030, + 317, + 1030, + 317, + 1061, + 298, + 1061 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 1212, + 1986, + 1231, + 1986, + 1231, + 2014, + 1212, + 2014 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 298, + 1262, + 317, + 1262, + 317, + 1293, + 298, + 1293 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 298, + 1774, + 317, + 1774, + 317, + 1805, + 298, + 1805 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 903, + 1778, + 933, + 1778, + 933, + 1807, + 903, + 1807 + ], + "score": 0.84, + "latex": "\\epsilon _ { f }" + }, + { + "category_id": 13, + "poly": [ + 715, + 376, + 740, + 376, + 740, + 406, + 715, + 406 + ], + "score": 0.84, + "latex": "\\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1744, + 324, + 1744, + 324, + 1770, + 298, + 1770 + ], + "score": 0.82, + "latex": "\\mathcal { F }" + }, + { + "category_id": 13, + "poly": [ + 1296, + 1376, + 1313, + 1376, + 1313, + 1402, + 1296, + 1402 + ], + "score": 0.82, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 991, + 969, + 1017, + 969, + 1017, + 995, + 991, + 995 + ], + "score": 0.82, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 366, + 1434, + 385, + 1434, + 385, + 1461, + 366, + 1461 + ], + "score": 0.82, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 1340, + 1237, + 1357, + 1237, + 1357, + 1262, + 1340, + 1262 + ], + "score": 0.78, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 487, + 1100, + 505, + 1100, + 505, + 1131, + 487, + 1131 + ], + "score": 0.77, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 1104, + 1376, + 1124, + 1376, + 1124, + 1397, + 1104, + 1397 + ], + "score": 0.76, + "latex": "\\nu" + }, + { + "category_id": 13, + "poly": [ + 719, + 781, + 772, + 781, + 772, + 816, + 719, + 816 + ], + "score": 0.71, + "latex": "\\phi _ { c , c ^ { \\prime } }" + }, + { + "category_id": 13, + "poly": [ + 299, + 1436, + 316, + 1436, + 316, + 1457, + 299, + 1457 + ], + "score": 0.71, + "latex": "\\nu" + }, + { + "category_id": 13, + "poly": [ + 722, + 443, + 737, + 443, + 737, + 464, + 722, + 464 + ], + "score": 0.7, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 343, + 2005, + 359, + 2005, + 359, + 2030, + 343, + 2030 + ], + "score": 0.62, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 784, + 779, + 857, + 779, + 857, + 814, + 784, + 814 + ], + "score": 0.5, + "latex": "c ^ { \\prime } \\neq c" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 1683.0, + 1238.0, + 1683.0, + 1238.0, + 1743.0, + 1122.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 1744.0, + 1332.0, + 1744.0, + 1332.0, + 1791.5, + 1269.0, + 1791.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.75, + 1767.0, + 1195.75, + 1767.0, + 1195.75, + 1808.5, + 1140.75, + 1808.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 1897.0, + 1219.0, + 1897.0, + 1219.0, + 1949.5, + 1151.0, + 1949.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 878.0, + 866.0, + 878.0, + 866.0, + 915.0, + 295.0, + 915.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": [ + 955.0, + 1982.0, + 1211.0, + 1982.0, + 1211.0, + 2015.0, + 955.0, + 2015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 1982.0, + 1407.0, + 1982.0, + 1407.0, + 2015.0, + 1232.0, + 2015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 950.0, + 2008.0, + 1315.0, + 2008.0, + 1315.0, + 2042.0, + 950.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1358.0, + 2008.0, + 1407.0, + 2008.0, + 1407.0, + 2042.0, + 1358.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 2035.0, + 1270.0, + 2035.0, + 1270.0, + 2075.0, + 953.0, + 2075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 2035.0, + 1334.0, + 2035.0, + 1334.0, + 2075.0, + 1323.0, + 2075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 837.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 1163.0, + 230.0, + 1163.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 2000.0, + 342.0, + 2000.0, + 342.0, + 2038.0, + 333.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 2000.0, + 955.0, + 2000.0, + 955.0, + 2038.0, + 360.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 1163.0, + 230.0, + 1163.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 934.0, + 522.0, + 934.0, + 522.0, + 973.0, + 295.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.0, + 934.0, + 1408.0, + 934.0, + 1408.0, + 973.0, + 578.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 966.0, + 990.0, + 966.0, + 990.0, + 1004.0, + 294.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 966.0, + 1126.0, + 966.0, + 1126.0, + 1004.0, + 1018.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 966.0, + 1407.0, + 966.0, + 1407.0, + 1004.0, + 1241.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 996.0, + 1406.0, + 996.0, + 1406.0, + 1032.0, + 292.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1028.0, + 1406.0, + 1028.0, + 1406.0, + 1065.0, + 318.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1060.0, + 1155.0, + 1060.0, + 1155.0, + 1093.0, + 296.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1679.0, + 940.0, + 1679.0, + 940.0, + 1715.0, + 294.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1711.0, + 937.0, + 1711.0, + 937.0, + 1748.0, + 295.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1741.0, + 936.0, + 1741.0, + 936.0, + 1775.0, + 325.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1766.0, + 297.0, + 1766.0, + 297.0, + 1811.0, + 292.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1766.0, + 664.0, + 1766.0, + 664.0, + 1811.0, + 318.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 1766.0, + 902.0, + 1766.0, + 902.0, + 1811.0, + 752.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 1766.0, + 939.0, + 1766.0, + 939.0, + 1811.0, + 934.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1804.0, + 938.0, + 1804.0, + 938.0, + 1834.0, + 294.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1835.0, + 936.0, + 1835.0, + 936.0, + 1863.0, + 295.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1863.0, + 624.0, + 1863.0, + 624.0, + 1899.0, + 296.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 284.0, + 1405.0, + 284.0, + 1405.0, + 316.0, + 295.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 313.0, + 1405.0, + 313.0, + 1405.0, + 349.0, + 294.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 342.0, + 1407.0, + 342.0, + 1407.0, + 380.0, + 293.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 371.0, + 297.0, + 371.0, + 297.0, + 414.0, + 291.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 430.0, + 371.0, + 714.0, + 371.0, + 714.0, + 414.0, + 430.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 371.0, + 1057.0, + 371.0, + 1057.0, + 414.0, + 741.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1235.0, + 371.0, + 1406.0, + 371.0, + 1406.0, + 414.0, + 1235.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 407.0, + 622.0, + 407.0, + 622.0, + 439.0, + 295.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 407.0, + 1306.0, + 407.0, + 1306.0, + 439.0, + 655.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 407.0, + 1405.0, + 407.0, + 1405.0, + 439.0, + 1376.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 437.0, + 721.0, + 437.0, + 721.0, + 473.0, + 294.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 437.0, + 1094.0, + 437.0, + 1094.0, + 473.0, + 738.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 437.0, + 1358.0, + 437.0, + 1358.0, + 473.0, + 1300.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1494.0, + 512.0, + 1494.0, + 512.0, + 1527.0, + 295.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 1494.0, + 1406.0, + 1494.0, + 1406.0, + 1527.0, + 533.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 1525.0, + 649.0, + 1525.0, + 649.0, + 1561.0, + 352.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 1525.0, + 1406.0, + 1525.0, + 1406.0, + 1561.0, + 837.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1556.0, + 1405.0, + 1556.0, + 1405.0, + 1590.0, + 292.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1586.0, + 580.0, + 1586.0, + 580.0, + 1620.0, + 292.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1586.0, + 806.0, + 1586.0, + 806.0, + 1620.0, + 796.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 542.0, + 1235.0, + 542.0, + 1235.0, + 580.0, + 294.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1350.0, + 542.0, + 1403.0, + 542.0, + 1403.0, + 580.0, + 1350.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 573.0, + 629.0, + 573.0, + 629.0, + 612.0, + 292.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 573.0, + 1407.0, + 573.0, + 1407.0, + 612.0, + 972.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 604.0, + 297.0, + 604.0, + 297.0, + 641.0, + 292.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 604.0, + 539.0, + 604.0, + 539.0, + 641.0, + 414.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 604.0, + 994.0, + 604.0, + 994.0, + 641.0, + 682.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 604.0, + 1408.0, + 604.0, + 1408.0, + 641.0, + 1277.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1366.0, + 1103.0, + 1366.0, + 1103.0, + 1405.0, + 292.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1366.0, + 1295.0, + 1366.0, + 1295.0, + 1405.0, + 1125.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1314.0, + 1366.0, + 1406.0, + 1366.0, + 1406.0, + 1405.0, + 1314.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1399.0, + 1408.0, + 1399.0, + 1408.0, + 1433.0, + 295.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1428.0, + 298.0, + 1428.0, + 298.0, + 1465.0, + 292.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1428.0, + 365.0, + 1428.0, + 365.0, + 1465.0, + 317.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 1428.0, + 1384.0, + 1428.0, + 1384.0, + 1465.0, + 386.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1224.0, + 374.0, + 1224.0, + 374.0, + 1267.0, + 294.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 1224.0, + 849.0, + 1224.0, + 849.0, + 1267.0, + 540.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 1224.0, + 1339.0, + 1224.0, + 1339.0, + 1267.0, + 966.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1358.0, + 1224.0, + 1404.0, + 1224.0, + 1404.0, + 1267.0, + 1358.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1260.0, + 449.0, + 1260.0, + 449.0, + 1297.0, + 318.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 1260.0, + 635.0, + 1260.0, + 635.0, + 1297.0, + 491.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1260.0, + 880.0, + 1260.0, + 880.0, + 1297.0, + 716.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 1260.0, + 1258.0, + 1260.0, + 1258.0, + 1297.0, + 901.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 771.0, + 718.0, + 771.0, + 718.0, + 821.0, + 290.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 771.0, + 783.0, + 771.0, + 783.0, + 821.0, + 773.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 771.0, + 1114.0, + 771.0, + 1114.0, + 821.0, + 858.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 771.0, + 1346.0, + 771.0, + 1346.0, + 821.0, + 1172.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 771.0, + 1405.0, + 771.0, + 1405.0, + 821.0, + 1402.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 810.0, + 527.0, + 810.0, + 527.0, + 846.0, + 294.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1094.0, + 486.0, + 1094.0, + 486.0, + 1136.0, + 294.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 1094.0, + 883.0, + 1094.0, + 883.0, + 1136.0, + 506.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 1094.0, + 1097.0, + 1094.0, + 1097.0, + 1136.0, + 1029.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 1094.0, + 1395.0, + 1094.0, + 1395.0, + 1136.0, + 1118.0, + 1136.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 814, + 1405, + 814, + 1405, + 1008, + 297, + 1008 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1249, + 1405, + 1249, + 1405, + 1405, + 297, + 1405 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1414, + 1403, + 1414, + 1403, + 1545, + 297, + 1545 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1685, + 1404, + 1685, + 1404, + 1810, + 297, + 1810 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 682, + 1405, + 682, + 1405, + 777, + 298, + 777 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1040, + 1404, + 1040, + 1404, + 1137, + 298, + 1137 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1823, + 1404, + 1823, + 1404, + 1981, + 298, + 1981 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 463, + 1406, + 463, + 1406, + 586, + 298, + 586 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 550, + 1563, + 1146, + 1563, + 1146, + 1655, + 550, + 1655 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 295, + 262, + 1407, + 262, + 1407, + 355, + 295, + 355 + ], + "score": 0.928 + }, + { + "category_id": 2, + "poly": [ + 320, + 2004, + 1318, + 2004, + 1318, + 2036, + 320, + 2036 + ], + "score": 0.908 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.899 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1594, + 1400, + 1594, + 1400, + 1623, + 1366, + 1623 + ], + "score": 0.886 + }, + { + "category_id": 0, + "poly": [ + 301, + 625, + 808, + 625, + 808, + 656, + 301, + 656 + ], + "score": 0.885 + }, + { + "category_id": 1, + "poly": [ + 291, + 413, + 1310, + 413, + 1310, + 450, + 291, + 450 + ], + "score": 0.843 + }, + { + "category_id": 0, + "poly": [ + 299, + 1181, + 840, + 1181, + 840, + 1216, + 299, + 1216 + ], + "score": 0.823 + }, + { + "category_id": 1, + "poly": [ + 300, + 230, + 904, + 230, + 904, + 261, + 300, + 261 + ], + "score": 0.803 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.76 + }, + { + "category_id": 1, + "poly": [ + 297, + 365, + 834, + 365, + 834, + 403, + 297, + 403 + ], + "score": 0.627 + }, + { + "category_id": 0, + "poly": [ + 299, + 1181, + 838, + 1181, + 838, + 1216, + 299, + 1216 + ], + "score": 0.121 + }, + { + "category_id": 13, + "poly": [ + 926, + 815, + 1154, + 815, + 1154, + 851, + 926, + 851 + ], + "score": 0.95, + "latex": "\\mu ( \\boldsymbol { x } ) = \\otimes _ { i = 1 } ^ { d } \\mu _ { i } ( x _ { i } )" + }, + { + "category_id": 14, + "poly": [ + 549, + 1559, + 1148, + 1559, + 1148, + 1656, + 549, + 1656 + ], + "score": 0.93, + "latex": "\\operatorname* { m a x } _ { \\lambda _ { 1 } , \\dots , \\lambda _ { M } \\ge 0 , \\kappa } \\kappa - \\sum _ { i = 1 } ^ { M } \\lambda _ { i } \\epsilon _ { i } - \\underset { X \\sim \\rho } { \\mathrm { E } } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] ." + }, + { + "category_id": 13, + "poly": [ + 1237, + 810, + 1401, + 810, + 1401, + 852, + 1237, + 852 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\mathcal { X } = \\prod _ { i = 1 } ^ { d } \\mathcal { X } _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 759, + 1446, + 1021, + 1446, + 1021, + 1486, + 759, + 1486 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { f _ { \\lambda } ( u ) = \\sum _ { i = 1 } ^ { M } \\lambda _ { i } f _ { i } ( u ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 643, + 367, + 828, + 367, + 828, + 402, + 643, + 402 + ], + "score": 0.92, + "latex": "f ( x ) = x \\log ( x )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1450, + 515, + 1450, + 515, + 1485, + 298, + 1485 + ], + "score": 0.92, + "latex": "\\mathcal { F } = \\{ f _ { 1 } , \\ldots , f _ { M } \\}" + }, + { + "category_id": 13, + "poly": [ + 503, + 414, + 783, + 414, + 783, + 451, + 503, + 451 + ], + "score": 0.92, + "latex": "D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho ) = D _ { f } ( \\nu \\| \\rho )" + }, + { + "category_id": 13, + "poly": [ + 335, + 367, + 582, + 367, + 582, + 404, + 335, + 404 + ], + "score": 0.91, + "latex": "\\mathrm { K L } ( \\nu \\| \\rho ) = D _ { f } ( \\nu \\| \\rho )" + }, + { + "category_id": 13, + "poly": [ + 415, + 261, + 859, + 261, + 859, + 294, + 415, + 294 + ], + "score": 0.91, + "latex": "R _ { \\alpha } ( \\nu | | \\rho ) = \\log ( 1 + D _ { f } ( \\nu | | \\rho ) ) / ( \\alpha - 1 )" + }, + { + "category_id": 13, + "poly": [ + 298, + 292, + 461, + 292, + 461, + 324, + 298, + 324 + ], + "score": 0.91, + "latex": "f ( x ) = x ^ { \\alpha } - 1" + }, + { + "category_id": 13, + "poly": [ + 1054, + 323, + 1398, + 323, + 1398, + 355, + 1054, + 355 + ], + "score": 0.9, + "latex": "R _ { \\infty } ( \\nu \\| \\rho ) = \\operatorname* { s u p } _ { x } ( \\nu ( x ) / \\rho ( x ) )" + }, + { + "category_id": 13, + "poly": [ + 1023, + 1483, + 1067, + 1483, + 1067, + 1514, + 1023, + 1514 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { \\mathcal { F } }" + }, + { + "category_id": 13, + "poly": [ + 664, + 1102, + 984, + 1102, + 984, + 1136, + 664, + 1136 + ], + "score": 0.9, + "latex": "\\mu ( x ) [ X ] \\propto \\exp ( { - \\| X - x \\| } )" + }, + { + "category_id": 13, + "poly": [ + 1011, + 1417, + 1056, + 1417, + 1056, + 1446, + 1011, + 1446 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { \\mathcal { F } }" + }, + { + "category_id": 13, + "poly": [ + 645, + 292, + 1085, + 292, + 1085, + 325, + 645, + 325 + ], + "score": 0.9, + "latex": "\\tilde { R _ { \\alpha } } ( \\rho \\| \\nu ) = \\log ( 1 - D _ { f } ( \\nu \\| \\rho ) ) / ( \\alpha - 1 )" + }, + { + "category_id": 13, + "poly": [ + 651, + 1073, + 697, + 1073, + 697, + 1103, + 651, + 1103 + ], + "score": 0.89, + "latex": "R _ { \\infty }" + }, + { + "category_id": 13, + "poly": [ + 567, + 1455, + 661, + 1455, + 661, + 1485, + 567, + 1485 + ], + "score": 0.89, + "latex": "\\epsilon _ { f _ { i } } = \\epsilon _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1143, + 291, + 1305, + 291, + 1305, + 323, + 1143, + 323 + ], + "score": 0.89, + "latex": "f ( x ) = 1 - x ^ { \\alpha }" + }, + { + "category_id": 13, + "poly": [ + 514, + 2005, + 645, + 2005, + 645, + 2034, + 514, + 2034 + ], + "score": 0.89, + "latex": "f : \\mathbb { R } _ { + } \\mapsto \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1748, + 388, + 1748, + 388, + 1776, + 298, + 1776 + ], + "score": 0.89, + "latex": "M = 1" + }, + { + "category_id": 13, + "poly": [ + 691, + 849, + 723, + 849, + 723, + 878, + 691, + 878 + ], + "score": 0.88, + "latex": "\\mathcal { X } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 332, + 1484, + 363, + 1484, + 363, + 1516, + 332, + 1516 + ], + "score": 0.88, + "latex": "f _ { \\lambda } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 499, + 326, + 591, + 326, + 591, + 350, + 499, + 350 + ], + "score": 0.88, + "latex": "\\alpha \\to \\infty" + }, + { + "category_id": 13, + "poly": [ + 845, + 414, + 1306, + 414, + 1306, + 450, + 845, + 450 + ], + "score": 0.87, + "latex": "f ( x ) = \\mathrm { m a x } ( x - \\beta , 0 ) - \\mathrm { m a x } ( 1 - \\beta , 0 ) ." + }, + { + "category_id": 13, + "poly": [ + 993, + 2004, + 1309, + 2004, + 1309, + 2036, + 993, + 2036 + ], + "score": 0.86, + "latex": "f ^ { * } ( u ) = \\operatorname* { m a x } _ { v \\geq 0 } \\left( u v - f ( v ) \\right)" + }, + { + "category_id": 13, + "poly": [ + 1057, + 1074, + 1076, + 1074, + 1076, + 1105, + 1057, + 1105 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 298, + 325, + 371, + 325, + 371, + 353, + 298, + 353 + ], + "score": 0.86, + "latex": "\\alpha \\leq 1 _ { \\cdot }" + }, + { + "category_id": 13, + "poly": [ + 398, + 1314, + 417, + 1314, + 417, + 1345, + 398, + 1345 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 412, + 971, + 780, + 971, + 780, + 1010, + 412, + 1010 + ], + "score": 0.86, + "latex": "\\begin{array} { r } { \\operatorname { 1 a x } _ { x ^ { \\prime } : \\| x - x ^ { \\prime } \\| _ { p } \\leq \\epsilon } R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 607, + 940, + 635, + 940, + 635, + 972, + 607, + 972 + ], + "score": 0.86, + "latex": "\\ell _ { p }" + }, + { + "category_id": 13, + "poly": [ + 510, + 295, + 584, + 295, + 584, + 323, + 510, + 323 + ], + "score": 0.85, + "latex": "\\alpha \\geq 1 \\gamma" + }, + { + "category_id": 13, + "poly": [ + 451, + 746, + 470, + 746, + 470, + 776, + 451, + 776 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 569, + 1485, + 590, + 1485, + 590, + 1513, + 569, + 1513 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 345, + 851, + 375, + 851, + 375, + 879, + 345, + 879 + ], + "score": 0.85, + "latex": "\\mu _ { i }" + }, + { + "category_id": 13, + "poly": [ + 298, + 715, + 318, + 715, + 318, + 746, + 298, + 746 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 835, + 1488, + 853, + 1488, + 853, + 1514, + 835, + 1514 + ], + "score": 0.83, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 787, + 1920, + 815, + 1920, + 815, + 1944, + 787, + 1944 + ], + "score": 0.82, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1212, + 1922, + 1231, + 1922, + 1231, + 1949, + 1212, + 1949 + ], + "score": 0.82, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 1177, + 1888, + 1197, + 1888, + 1197, + 1918, + 1177, + 1918 + ], + "score": 0.8, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 1355, + 293, + 1407, + 293, + 1407, + 322, + 1355, + 322 + ], + "score": 0.8, + "latex": "0 \\leq" + }, + { + "category_id": 13, + "poly": [ + 547, + 1857, + 567, + 1857, + 567, + 1884, + 547, + 1884 + ], + "score": 0.79, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1255, + 1283, + 1281, + 1283, + 1281, + 1309, + 1255, + 1309 + ], + "score": 0.79, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1515, + 320, + 1515, + 320, + 1545, + 298, + 1545 + ], + "score": 0.76, + "latex": "i f" + }, + { + "category_id": 13, + "poly": [ + 794, + 714, + 1028, + 714, + 1028, + 749, + 794, + 749 + ], + "score": 0.75, + "latex": "\\mathrm { m a x } _ { \\nu \\in \\mathcal { D } _ { x , \\epsilon } } D _ { f } ( \\nu \\| \\rho )" + }, + { + "category_id": 13, + "poly": [ + 622, + 1861, + 641, + 1861, + 641, + 1884, + 622, + 1884 + ], + "score": 0.72, + "latex": "\\kappa" + }, + { + "category_id": 13, + "poly": [ + 923, + 713, + 1027, + 713, + 1027, + 748, + 923, + 748 + ], + "score": 0.55, + "latex": "D _ { f } ( \\nu \\| \\rho )" + }, + { + "category_id": 13, + "poly": [ + 397, + 974, + 469, + 974, + 469, + 1004, + 397, + 1004 + ], + "score": 0.37, + "latex": "\\mathrm { m a x } _ { x ^ { \\prime } }" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1996.0, + 513.0, + 1996.0, + 513.0, + 2042.0, + 327.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1996.0, + 992.0, + 1996.0, + 992.0, + 2042.0, + 646.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 1996.0, + 1321.0, + 1996.0, + 1321.0, + 2042.0, + 1310.0, + 2042.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": [ + 295.0, + 624.0, + 810.0, + 624.0, + 810.0, + 660.0, + 295.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1177.0, + 842.0, + 1177.0, + 842.0, + 1225.0, + 291.0, + 1225.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": [ + 291.0, + 1177.0, + 842.0, + 1177.0, + 842.0, + 1226.0, + 291.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 805.0, + 925.0, + 805.0, + 925.0, + 862.0, + 287.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 805.0, + 1236.0, + 805.0, + 1236.0, + 862.0, + 1155.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 805.0, + 1410.0, + 805.0, + 1410.0, + 862.0, + 1402.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 848.0, + 344.0, + 848.0, + 344.0, + 881.0, + 296.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 848.0, + 690.0, + 848.0, + 690.0, + 881.0, + 376.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 848.0, + 1403.0, + 848.0, + 1403.0, + 881.0, + 724.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 874.0, + 1405.0, + 874.0, + 1405.0, + 911.0, + 294.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 907.0, + 1407.0, + 907.0, + 1407.0, + 944.0, + 294.0, + 944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 935.0, + 606.0, + 935.0, + 606.0, + 977.0, + 294.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 935.0, + 1405.0, + 935.0, + 1405.0, + 977.0, + 636.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 966.0, + 396.0, + 966.0, + 396.0, + 1011.0, + 291.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 966.0, + 1138.0, + 966.0, + 1138.0, + 1011.0, + 781.0, + 1011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1251.0, + 1407.0, + 1251.0, + 1407.0, + 1283.0, + 295.0, + 1283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1282.0, + 1254.0, + 1282.0, + 1254.0, + 1315.0, + 295.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1282.0, + 1282.0, + 1405.0, + 1282.0, + 1405.0, + 1315.0, + 1282.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1314.0, + 397.0, + 1314.0, + 397.0, + 1347.0, + 296.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1314.0, + 1403.0, + 1314.0, + 1403.0, + 1347.0, + 418.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1338.0, + 1406.0, + 1338.0, + 1406.0, + 1380.0, + 292.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1371.0, + 568.0, + 1371.0, + 568.0, + 1412.0, + 293.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1413.0, + 1010.0, + 1413.0, + 1010.0, + 1451.0, + 295.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 1413.0, + 1405.0, + 1413.0, + 1405.0, + 1451.0, + 1057.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1443.0, + 297.0, + 1443.0, + 297.0, + 1495.0, + 288.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 1443.0, + 566.0, + 1443.0, + 566.0, + 1495.0, + 516.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 1443.0, + 758.0, + 1443.0, + 758.0, + 1495.0, + 662.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 1443.0, + 1409.0, + 1443.0, + 1409.0, + 1495.0, + 1022.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1481.0, + 331.0, + 1481.0, + 331.0, + 1518.0, + 293.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 1481.0, + 568.0, + 1481.0, + 568.0, + 1518.0, + 364.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1481.0, + 834.0, + 1481.0, + 834.0, + 1518.0, + 591.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 1481.0, + 1022.0, + 1481.0, + 1022.0, + 1518.0, + 854.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1068.0, + 1481.0, + 1404.0, + 1481.0, + 1404.0, + 1518.0, + 1068.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1511.0, + 297.0, + 1511.0, + 297.0, + 1549.0, + 294.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1511.0, + 1222.0, + 1511.0, + 1222.0, + 1549.0, + 321.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1688.0, + 1405.0, + 1688.0, + 1405.0, + 1721.0, + 295.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1716.0, + 1404.0, + 1716.0, + 1404.0, + 1751.0, + 294.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 1746.0, + 1407.0, + 1746.0, + 1407.0, + 1781.0, + 389.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1778.0, + 765.0, + 1778.0, + 765.0, + 1811.0, + 293.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 682.0, + 1407.0, + 682.0, + 1407.0, + 720.0, + 293.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 708.0, + 297.0, + 708.0, + 297.0, + 755.0, + 291.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 708.0, + 793.0, + 708.0, + 793.0, + 755.0, + 319.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 708.0, + 1409.0, + 708.0, + 1409.0, + 755.0, + 1029.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 745.0, + 450.0, + 745.0, + 450.0, + 779.0, + 296.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 745.0, + 1348.0, + 745.0, + 1348.0, + 779.0, + 471.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1039.0, + 1405.0, + 1039.0, + 1405.0, + 1077.0, + 294.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1071.0, + 650.0, + 1071.0, + 650.0, + 1106.0, + 296.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 1071.0, + 1056.0, + 1071.0, + 1056.0, + 1106.0, + 698.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 1071.0, + 1402.0, + 1071.0, + 1402.0, + 1106.0, + 1077.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1103.0, + 663.0, + 1103.0, + 663.0, + 1138.0, + 296.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1103.0, + 994.0, + 1103.0, + 994.0, + 1138.0, + 985.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1825.0, + 1405.0, + 1825.0, + 1405.0, + 1859.0, + 296.0, + 1859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1856.0, + 546.0, + 1856.0, + 546.0, + 1890.0, + 296.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 1856.0, + 621.0, + 1856.0, + 621.0, + 1890.0, + 568.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 1856.0, + 1405.0, + 1856.0, + 1405.0, + 1890.0, + 642.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1883.0, + 1176.0, + 1883.0, + 1176.0, + 1924.0, + 293.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 1883.0, + 1406.0, + 1883.0, + 1406.0, + 1924.0, + 1198.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1915.0, + 786.0, + 1915.0, + 786.0, + 1952.0, + 293.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 816.0, + 1915.0, + 1211.0, + 1915.0, + 1211.0, + 1952.0, + 816.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 1915.0, + 1405.0, + 1915.0, + 1405.0, + 1952.0, + 1232.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1946.0, + 1405.0, + 1946.0, + 1405.0, + 1983.0, + 294.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 463.0, + 1407.0, + 463.0, + 1407.0, + 499.0, + 293.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 493.0, + 1406.0, + 493.0, + 1406.0, + 529.0, + 295.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 526.0, + 1406.0, + 526.0, + 1406.0, + 558.0, + 296.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 556.0, + 1169.0, + 556.0, + 1169.0, + 588.0, + 295.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 258.0, + 414.0, + 258.0, + 414.0, + 299.0, + 292.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 258.0, + 937.0, + 258.0, + 937.0, + 299.0, + 860.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 289.0, + 297.0, + 289.0, + 297.0, + 327.0, + 293.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 289.0, + 509.0, + 289.0, + 509.0, + 327.0, + 462.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 289.0, + 644.0, + 289.0, + 644.0, + 327.0, + 585.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1086.0, + 289.0, + 1142.0, + 289.0, + 1142.0, + 327.0, + 1086.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 289.0, + 1354.0, + 289.0, + 1354.0, + 327.0, + 1306.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 319.0, + 297.0, + 319.0, + 297.0, + 358.0, + 290.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 319.0, + 498.0, + 319.0, + 498.0, + 358.0, + 372.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 319.0, + 1053.0, + 319.0, + 1053.0, + 358.0, + 592.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 319.0, + 1408.0, + 319.0, + 1408.0, + 358.0, + 1399.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 411.0, + 502.0, + 411.0, + 502.0, + 455.0, + 293.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 411.0, + 844.0, + 411.0, + 844.0, + 455.0, + 784.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 411.0, + 1313.0, + 411.0, + 1313.0, + 455.0, + 1307.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 226.0, + 907.0, + 226.0, + 907.0, + 268.0, + 293.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 365.0, + 334.0, + 365.0, + 334.0, + 409.0, + 295.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 365.0, + 642.0, + 365.0, + 642.0, + 409.0, + 583.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 365.0, + 839.0, + 365.0, + 839.0, + 409.0, + 829.0, + 409.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 515, + 1406, + 515, + 1406, + 801, + 297, + 801 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 299, + 886, + 1404, + 886, + 1404, + 1011, + 299, + 1011 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 296, + 1307, + 1406, + 1307, + 1406, + 1492, + 296, + 1492 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1199, + 1404, + 1199, + 1404, + 1293, + 298, + 1293 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 295, + 813, + 1402, + 813, + 1402, + 877, + 295, + 877 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 470, + 1029, + 1230, + 1029, + 1230, + 1125, + 470, + 1125 + ], + "score": 0.939 + }, + { + "category_id": 2, + "poly": [ + 331, + 1973, + 876, + 1973, + 876, + 2035, + 331, + 2035 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 295, + 1139, + 1354, + 1139, + 1354, + 1175, + 295, + 1175 + ], + "score": 0.925 + }, + { + "category_id": 0, + "poly": [ + 300, + 1847, + 1126, + 1847, + 1126, + 1881, + 300, + 1881 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 298, + 1914, + 1399, + 1914, + 1399, + 1948, + 298, + 1948 + ], + "score": 0.914 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.9 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1060, + 1400, + 1060, + 1400, + 1090, + 1366, + 1090 + ], + "score": 0.878 + }, + { + "category_id": 2, + "poly": [ + 839, + 2088, + 859, + 2088, + 859, + 2113, + 839, + 2113 + ], + "score": 0.788 + }, + { + "category_id": 0, + "poly": [ + 301, + 1528, + 811, + 1528, + 811, + 1559, + 301, + 1559 + ], + "score": 0.712 + }, + { + "category_id": 1, + "poly": [ + 306, + 1633, + 1394, + 1633, + 1394, + 1772, + 306, + 1772 + ], + "score": 0.647 + }, + { + "category_id": 1, + "poly": [ + 295, + 1566, + 1403, + 1566, + 1403, + 1631, + 295, + 1631 + ], + "score": 0.631 + }, + { + "category_id": 1, + "poly": [ + 292, + 264, + 1408, + 264, + 1408, + 450, + 292, + 450 + ], + "score": 0.491 + }, + { + "category_id": 1, + "poly": [ + 293, + 228, + 1272, + 228, + 1272, + 262, + 293, + 262 + ], + "score": 0.206 + }, + { + "category_id": 1, + "poly": [ + 301, + 1528, + 811, + 1528, + 811, + 1559, + 301, + 1559 + ], + "score": 0.145 + }, + { + "category_id": 0, + "poly": [ + 293, + 228, + 1272, + 228, + 1272, + 262, + 293, + 262 + ], + "score": 0.1 + }, + { + "category_id": 13, + "poly": [ + 434, + 1669, + 634, + 1669, + 634, + 1709, + 434, + 1709 + ], + "score": 0.94, + "latex": "X ^ { 1 } , \\dotsc , X ^ { \\tilde { N } } \\dotsc \\rho" + }, + { + "category_id": 13, + "poly": [ + 995, + 609, + 1343, + 609, + 1343, + 644, + 995, + 644 + ], + "score": 0.94, + "latex": "E _ { u b } \\ge \\mathrm { E } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa ^ { * } - \\phi ( X ) ) ]" + }, + { + "category_id": 13, + "poly": [ + 704, + 1140, + 876, + 1140, + 876, + 1174, + 704, + 1174 + ], + "score": 0.93, + "latex": "\\zeta = ( \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } )" + }, + { + "category_id": 13, + "poly": [ + 704, + 1708, + 804, + 1708, + 804, + 1741, + 704, + 1741 + ], + "score": 0.93, + "latex": "\\theta _ { a } \\gets \\underline { { \\theta _ { a } } }" + }, + { + "category_id": 13, + "poly": [ + 370, + 407, + 685, + 407, + 685, + 448, + 370, + 448 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\kappa ^ { * } - \\sum _ { i = 1 } ^ { M } \\lambda _ { i } ^ { * } \\epsilon _ { i } - E _ { u b } \\geq 0 } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 465, + 1024, + 1231, + 1024, + 1231, + 1125, + 465, + 1125 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } { \\underset { \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } \\geq 0 } { \\operatorname* { m i n } } } & { \\zeta _ { a } - \\zeta _ { b } } \\\\ { \\mathrm { S u b j e c t ~ t o } } & { \\zeta _ { a } + \\zeta _ { b } + \\zeta _ { c } = 1 } \\end{array} , \\quad D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i } \\quad i = 1 , \\dots , M \\ ," + }, + { + "category_id": 13, + "poly": [ + 371, + 1140, + 653, + 1140, + 653, + 1174, + 371, + 1174 + ], + "score": 0.91, + "latex": "\\theta = ( \\theta _ { a } , \\theta _ { b } , 1 - \\theta _ { a } - \\theta _ { b } )" + }, + { + "category_id": 13, + "poly": [ + 435, + 1633, + 635, + 1633, + 635, + 1667, + 435, + 1667 + ], + "score": 0.91, + "latex": "X ^ { 1 } , \\ldots , X ^ { N } \\sim \\rho" + }, + { + "category_id": 13, + "poly": [ + 376, + 610, + 424, + 610, + 424, + 641, + 376, + 641 + ], + "score": 0.9, + "latex": "E _ { u b }" + }, + { + "category_id": 13, + "poly": [ + 637, + 1431, + 721, + 1431, + 721, + 1459, + 637, + 1459 + ], + "score": 0.9, + "latex": "M > 1" + }, + { + "category_id": 13, + "poly": [ + 854, + 1709, + 998, + 1709, + 998, + 1739, + 854, + 1739 + ], + "score": 0.9, + "latex": "\\theta _ { b } \\gets 1 - \\theta _ { a }" + }, + { + "category_id": 13, + "poly": [ + 611, + 950, + 656, + 950, + 656, + 980, + 611, + 980 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { \\mathcal { F } }" + }, + { + "category_id": 13, + "poly": [ + 370, + 1739, + 450, + 1739, + 450, + 1769, + 370, + 1769 + ], + "score": 0.9, + "latex": "o ^ { * } \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 893, + 1676, + 1166, + 1676, + 1166, + 1711, + 893, + 1711 + ], + "score": 0.9, + "latex": "\\mathbb { P } _ { X \\sim \\rho } [ h ( X ) = y ^ { \\prime } ] \\geq \\underline { { \\theta } } _ { a }" + }, + { + "category_id": 13, + "poly": [ + 1075, + 889, + 1119, + 889, + 1119, + 918, + 1075, + 918 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { \\mathcal { F } }" + }, + { + "category_id": 13, + "poly": [ + 1312, + 1431, + 1395, + 1431, + 1395, + 1458, + 1312, + 1458 + ], + "score": 0.9, + "latex": "M = 1" + }, + { + "category_id": 13, + "poly": [ + 731, + 268, + 898, + 268, + 898, + 301, + 731, + 301 + ], + "score": 0.89, + "latex": "\\phi : \\mathcal { X } [ a , b ]" + }, + { + "category_id": 13, + "poly": [ + 836, + 1636, + 1249, + 1636, + 1249, + 1672, + 836, + 1672 + ], + "score": 0.88, + "latex": "y = \\arg \\operatorname* { m a x } _ { y ^ { \\prime } \\in \\mathcal { V } } \\mathbb { P } _ { X \\sim \\rho } [ h ( X ) = y ^ { \\prime } ] ." + }, + { + "category_id": 13, + "poly": [ + 736, + 1262, + 765, + 1262, + 765, + 1292, + 736, + 1292 + ], + "score": 0.88, + "latex": "\\theta _ { a }" + }, + { + "category_id": 13, + "poly": [ + 816, + 1261, + 843, + 1261, + 843, + 1292, + 816, + 1292 + ], + "score": 0.88, + "latex": "\\theta _ { b }" + }, + { + "category_id": 13, + "poly": [ + 435, + 304, + 461, + 304, + 461, + 336, + 435, + 336 + ], + "score": 0.88, + "latex": "f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 435, + 1600, + 461, + 1600, + 461, + 1632, + 435, + 1632 + ], + "score": 0.87, + "latex": "f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 427, + 1710, + 456, + 1710, + 456, + 1736, + 427, + 1736 + ], + "score": 0.87, + "latex": "o ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1369, + 328, + 1369, + 328, + 1403, + 297, + 1403 + ], + "score": 0.86, + "latex": "\\underline { { \\theta } } _ { a }" + }, + { + "category_id": 13, + "poly": [ + 903, + 641, + 932, + 641, + 932, + 673, + 903, + 673 + ], + "score": 0.86, + "latex": "\\tilde { N }" + }, + { + "category_id": 13, + "poly": [ + 485, + 1262, + 506, + 1262, + 506, + 1292, + 485, + 1292 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 1024, + 919, + 1045, + 919, + 1045, + 945, + 1024, + 945 + ], + "score": 0.84, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 598, + 308, + 621, + 308, + 621, + 334, + 598, + 334 + ], + "score": 0.84, + "latex": "\\epsilon _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1350, + 1678, + 1367, + 1678, + 1367, + 1709, + 1350, + 1709 + ], + "score": 0.83, + "latex": "\\zeta" + }, + { + "category_id": 13, + "poly": [ + 598, + 1605, + 621, + 1605, + 621, + 1630, + 598, + 1630 + ], + "score": 0.83, + "latex": "\\epsilon _ { i }" + }, + { + "category_id": 13, + "poly": [ + 421, + 954, + 439, + 954, + 439, + 980, + 421, + 980 + ], + "score": 0.83, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 298, + 919, + 320, + 919, + 320, + 946, + 298, + 946 + ], + "score": 0.82, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 372, + 918, + 401, + 918, + 401, + 948, + 372, + 948 + ], + "score": 0.82, + "latex": "\\theta _ { a }" + }, + { + "category_id": 13, + "poly": [ + 1043, + 304, + 1060, + 304, + 1060, + 336, + 1043, + 336 + ], + "score": 0.8, + "latex": "\\zeta" + }, + { + "category_id": 13, + "poly": [ + 1232, + 651, + 1251, + 651, + 1251, + 677, + 1232, + 677 + ], + "score": 0.8, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 509, + 646, + 527, + 646, + 527, + 677, + 509, + 677 + ], + "score": 0.8, + "latex": "\\zeta" + }, + { + "category_id": 13, + "poly": [ + 413, + 919, + 441, + 919, + 441, + 948, + 413, + 948 + ], + "score": 0.79, + "latex": "\\theta _ { b }" + }, + { + "category_id": 13, + "poly": [ + 693, + 1567, + 712, + 1567, + 712, + 1594, + 693, + 1594 + ], + "score": 0.79, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 1043, + 1600, + 1061, + 1600, + 1061, + 1632, + 1043, + 1632 + ], + "score": 0.79, + "latex": "\\zeta" + }, + { + "category_id": 13, + "poly": [ + 344, + 375, + 431, + 375, + 431, + 406, + 344, + 406 + ], + "score": 0.78, + "latex": "E _ { u b } \\gets" + }, + { + "category_id": 13, + "poly": [ + 1086, + 523, + 1106, + 523, + 1106, + 545, + 1086, + 545 + ], + "score": 0.78, + "latex": "\\kappa" + }, + { + "category_id": 13, + "poly": [ + 875, + 1573, + 893, + 1573, + 893, + 1598, + 875, + 1598 + ], + "score": 0.77, + "latex": "y" + }, + { + "category_id": 13, + "poly": [ + 1158, + 519, + 1177, + 519, + 1177, + 545, + 1158, + 545 + ], + "score": 0.76, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 640, + 518, + 713, + 518, + 713, + 549, + 640, + 549 + ], + "score": 0.76, + "latex": "\\kappa ^ { * } , \\lambda ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1380, + 1573, + 1397, + 1573, + 1397, + 1598, + 1380, + 1598 + ], + "score": 0.75, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 817, + 301, + 846, + 301, + 846, + 331, + 817, + 331 + ], + "score": 0.74, + "latex": "\\tilde { N }" + }, + { + "category_id": 13, + "poly": [ + 817, + 1595, + 846, + 1595, + 846, + 1628, + 817, + 1628 + ], + "score": 0.74, + "latex": "\\tilde { N }" + }, + { + "category_id": 13, + "poly": [ + 1380, + 276, + 1397, + 276, + 1397, + 301, + 1380, + 301 + ], + "score": 0.71, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 831, + 336, + 928, + 336, + 928, + 373, + 831, + 373 + ], + "score": 0.62, + "latex": "\\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } )" + }, + { + "category_id": 13, + "poly": [ + 343, + 341, + 375, + 341, + 375, + 369, + 343, + 369 + ], + "score": 0.58, + "latex": "\\kappa ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 778, + 303, + 806, + 303, + 806, + 332, + 778, + 332 + ], + "score": 0.58, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 778, + 1597, + 807, + 1597, + 807, + 1628, + 778, + 1628 + ], + "score": 0.52, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 378, + 337, + 931, + 337, + 931, + 374, + 378, + 374 + ], + "score": 0.44, + "latex": "\\lambda ^ { * } \\gets \\mathrm { E S T I M A T E O P T } ( \\rho , \\phi , N , \\{ f _ { i } \\} _ { i = 1 } ^ { M } , \\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } ) ." + }, + { + "category_id": 13, + "poly": [ + 961, + 372, + 1224, + 372, + 1224, + 410, + 961, + 410 + ], + "score": 0.42, + "latex": "\\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } , a , b , \\lambda ^ { * } , \\kappa ^ { * } , \\zeta ) ." + }, + { + "category_id": 13, + "poly": [ + 631, + 337, + 819, + 337, + 819, + 373, + 631, + 373 + ], + "score": 0.4, + "latex": "( \\rho , \\phi , N , \\{ f _ { i } \\} _ { i = 1 } ^ { M }" + }, + { + "category_id": 13, + "poly": [ + 778, + 1595, + 847, + 1595, + 847, + 1630, + 778, + 1630 + ], + "score": 0.26, + "latex": "N , { \\tilde { N } }" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1970.0, + 844.0, + 1970.0, + 844.0, + 2007.0, + 330.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 2001.0, + 878.0, + 2001.0, + 878.0, + 2037.0, + 328.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1842.0, + 1127.0, + 1842.0, + 1127.0, + 1887.0, + 291.0, + 1887.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, + 861.0, + 2087.0, + 861.0, + 2117.0, + 840.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1526.0, + 814.0, + 1526.0, + 814.0, + 1561.0, + 297.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 226.0, + 1275.0, + 226.0, + 1275.0, + 266.0, + 295.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 514.0, + 639.0, + 514.0, + 639.0, + 553.0, + 292.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 514.0, + 1085.0, + 514.0, + 1085.0, + 553.0, + 714.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 514.0, + 1157.0, + 514.0, + 1157.0, + 553.0, + 1107.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 514.0, + 1404.0, + 514.0, + 1404.0, + 553.0, + 1178.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 549.0, + 1407.0, + 549.0, + 1407.0, + 583.0, + 294.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 576.0, + 1407.0, + 576.0, + 1407.0, + 616.0, + 292.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 607.0, + 375.0, + 607.0, + 375.0, + 648.0, + 292.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 607.0, + 994.0, + 607.0, + 994.0, + 648.0, + 425.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 607.0, + 1407.0, + 607.0, + 1407.0, + 648.0, + 1344.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 645.0, + 508.0, + 645.0, + 508.0, + 682.0, + 294.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 645.0, + 902.0, + 645.0, + 902.0, + 682.0, + 528.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 933.0, + 645.0, + 1231.0, + 645.0, + 1231.0, + 682.0, + 933.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 645.0, + 1407.0, + 645.0, + 1407.0, + 682.0, + 1252.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 675.0, + 1403.0, + 675.0, + 1403.0, + 709.0, + 295.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 704.0, + 1407.0, + 704.0, + 1407.0, + 742.0, + 291.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 734.0, + 1407.0, + 734.0, + 1407.0, + 773.0, + 292.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 768.0, + 966.0, + 768.0, + 966.0, + 802.0, + 294.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 886.0, + 1074.0, + 886.0, + 1074.0, + 919.0, + 295.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 886.0, + 1404.0, + 886.0, + 1404.0, + 919.0, + 1120.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 918.0, + 371.0, + 918.0, + 371.0, + 951.0, + 321.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 918.0, + 412.0, + 918.0, + 412.0, + 951.0, + 402.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 442.0, + 918.0, + 1023.0, + 918.0, + 1023.0, + 951.0, + 442.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 918.0, + 1404.0, + 918.0, + 1404.0, + 951.0, + 1046.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 947.0, + 420.0, + 947.0, + 420.0, + 985.0, + 293.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 947.0, + 610.0, + 947.0, + 610.0, + 985.0, + 440.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 947.0, + 1405.0, + 947.0, + 1405.0, + 985.0, + 657.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 980.0, + 811.0, + 980.0, + 811.0, + 1013.0, + 294.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1309.0, + 1403.0, + 1309.0, + 1403.0, + 1341.0, + 295.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1340.0, + 1404.0, + 1340.0, + 1404.0, + 1372.0, + 295.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1366.0, + 296.0, + 1366.0, + 296.0, + 1406.0, + 293.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1366.0, + 1408.0, + 1366.0, + 1408.0, + 1406.0, + 329.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1398.0, + 1409.0, + 1398.0, + 1409.0, + 1435.0, + 291.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1429.0, + 636.0, + 1429.0, + 636.0, + 1464.0, + 294.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 722.0, + 1429.0, + 1311.0, + 1429.0, + 1311.0, + 1464.0, + 722.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1396.0, + 1429.0, + 1409.0, + 1429.0, + 1409.0, + 1464.0, + 1396.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1461.0, + 784.0, + 1461.0, + 784.0, + 1496.0, + 295.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1200.0, + 1406.0, + 1200.0, + 1406.0, + 1234.0, + 296.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1229.0, + 1404.0, + 1229.0, + 1404.0, + 1265.0, + 295.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1258.0, + 484.0, + 1258.0, + 484.0, + 1297.0, + 293.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 1258.0, + 735.0, + 1258.0, + 735.0, + 1297.0, + 507.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 1258.0, + 815.0, + 1258.0, + 815.0, + 1297.0, + 766.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 1258.0, + 856.0, + 1258.0, + 856.0, + 1297.0, + 844.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 810.0, + 1405.0, + 810.0, + 1405.0, + 850.0, + 294.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 838.0, + 390.0, + 838.0, + 390.0, + 887.0, + 292.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1138.0, + 370.0, + 1138.0, + 370.0, + 1178.0, + 294.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 1138.0, + 703.0, + 1138.0, + 703.0, + 1178.0, + 654.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 1138.0, + 1358.0, + 1138.0, + 1358.0, + 1178.0, + 877.0, + 1178.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1910.0, + 1404.0, + 1910.0, + 1404.0, + 1955.0, + 293.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1629.0, + 434.0, + 1629.0, + 434.0, + 1674.0, + 307.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 1629.0, + 835.0, + 1629.0, + 835.0, + 1674.0, + 636.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1250.0, + 1629.0, + 1258.0, + 1629.0, + 1258.0, + 1674.0, + 1250.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 1668.0, + 433.0, + 1668.0, + 433.0, + 1714.0, + 304.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1668.0, + 892.0, + 1668.0, + 892.0, + 1714.0, + 635.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 1668.0, + 1349.0, + 1668.0, + 1349.0, + 1714.0, + 1167.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1368.0, + 1668.0, + 1380.0, + 1668.0, + 1380.0, + 1714.0, + 1368.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1704.0, + 426.0, + 1704.0, + 426.0, + 1742.0, + 306.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 457.0, + 1704.0, + 703.0, + 1704.0, + 703.0, + 1742.0, + 457.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1704.0, + 853.0, + 1704.0, + 853.0, + 1742.0, + 805.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 1704.0, + 1011.0, + 1704.0, + 1011.0, + 1742.0, + 999.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1736.0, + 369.0, + 1736.0, + 369.0, + 1771.0, + 307.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1736.0, + 1031.0, + 1736.0, + 1031.0, + 1771.0, + 451.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1560.0, + 692.0, + 1560.0, + 692.0, + 1605.0, + 294.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 1560.0, + 874.0, + 1560.0, + 874.0, + 1605.0, + 713.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1560.0, + 1379.0, + 1560.0, + 1379.0, + 1605.0, + 894.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 1560.0, + 1409.0, + 1560.0, + 1409.0, + 1605.0, + 1398.0, + 1605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1598.0, + 434.0, + 1598.0, + 434.0, + 1635.0, + 297.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 1598.0, + 597.0, + 1598.0, + 597.0, + 1635.0, + 462.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 1598.0, + 777.0, + 1598.0, + 777.0, + 1635.0, + 622.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 1598.0, + 1042.0, + 1598.0, + 1042.0, + 1635.0, + 848.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 1598.0, + 1070.0, + 1598.0, + 1070.0, + 1635.0, + 1062.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 264.0, + 730.0, + 264.0, + 730.0, + 306.0, + 294.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 264.0, + 1379.0, + 264.0, + 1379.0, + 306.0, + 899.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 264.0, + 1410.0, + 264.0, + 1410.0, + 306.0, + 1398.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 302.0, + 434.0, + 302.0, + 434.0, + 338.0, + 295.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 302.0, + 597.0, + 302.0, + 597.0, + 338.0, + 462.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 302.0, + 777.0, + 302.0, + 777.0, + 338.0, + 622.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 302.0, + 816.0, + 302.0, + 816.0, + 338.0, + 807.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 302.0, + 1042.0, + 302.0, + 1042.0, + 338.0, + 847.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 302.0, + 1072.0, + 302.0, + 1072.0, + 338.0, + 1061.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 328.0, + 342.0, + 328.0, + 342.0, + 384.0, + 300.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 328.0, + 946.0, + 328.0, + 946.0, + 384.0, + 932.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 367.0, + 343.0, + 367.0, + 343.0, + 416.0, + 303.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 367.0, + 960.0, + 367.0, + 960.0, + 416.0, + 432.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 367.0, + 1231.0, + 367.0, + 1231.0, + 416.0, + 1225.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 407.0, + 369.0, + 407.0, + 369.0, + 455.0, + 303.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 407.0, + 1271.0, + 407.0, + 1271.0, + 455.0, + 686.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 226.0, + 1275.0, + 226.0, + 1275.0, + 266.0, + 295.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1526.0, + 814.0, + 1526.0, + 814.0, + 1561.0, + 297.0, + 1561.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 453, + 1405, + 453, + 1405, + 708, + 297, + 708 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 297, + 1386, + 1405, + 1386, + 1405, + 1543, + 297, + 1543 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 296, + 1103, + 1405, + 1103, + 1405, + 1227, + 296, + 1227 + ], + "score": 0.972 + }, + { + "category_id": 8, + "poly": [ + 408, + 789, + 1285, + 789, + 1285, + 1098, + 408, + 1098 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 299, + 1768, + 1404, + 1768, + 1404, + 1863, + 299, + 1863 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 297, + 718, + 1401, + 718, + 1401, + 781, + 297, + 781 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 297, + 1971, + 1405, + 1971, + 1405, + 2035, + 297, + 2035 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 297, + 1233, + 1403, + 1233, + 1403, + 1297, + 297, + 1297 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 299, + 1547, + 1402, + 1547, + 1402, + 1610, + 299, + 1610 + ], + "score": 0.936 + }, + { + "category_id": 8, + "poly": [ + 330, + 1618, + 1320, + 1618, + 1320, + 1678, + 330, + 1678 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 299, + 1687, + 572, + 1687, + 572, + 1717, + 299, + 1717 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 299, + 1905, + 836, + 1905, + 836, + 1940, + 299, + 1940 + ], + "score": 0.914 + }, + { + "category_id": 0, + "poly": [ + 297, + 399, + 987, + 399, + 987, + 431, + 297, + 431 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 105, + 300, + 105 + ], + "score": 0.897 + }, + { + "category_id": 8, + "poly": [ + 341, + 1724, + 1327, + 1724, + 1327, + 1765, + 341, + 1765 + ], + "score": 0.858 + }, + { + "category_id": 0, + "poly": [ + 300, + 1330, + 1250, + 1330, + 1250, + 1363, + 300, + 1363 + ], + "score": 0.836 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1625, + 1400, + 1625, + 1400, + 1654, + 1366, + 1654 + ], + "score": 0.832 + }, + { + "category_id": 1, + "poly": [ + 312, + 228, + 1407, + 228, + 1407, + 364, + 312, + 364 + ], + "score": 0.807 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2111, + 841, + 2111 + ], + "score": 0.77 + }, + { + "category_id": 14, + "poly": [ + 407, + 789, + 1289, + 789, + 1289, + 1102, + 407, + 1102 + ], + "score": 0.96, + "latex": "\\begin{array} { l } { { \\displaystyle \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] = \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\kappa - H ( X ) + \\frac 1 2 \\biggr ) \\biggr ] } } \\\\ { { \\displaystyle = \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( x ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\biggl ( \\kappa + \\frac 1 2 - 1 \\biggr ) H ( X ) + \\biggl ( \\kappa + \\frac 1 2 \\biggr ) ( 1 - H ( X ) ) \\biggr ) \\biggr ] } } \\\\ { { \\displaystyle \\geq \\kappa - \\lambda \\epsilon - \\underset { X \\sim \\mu ( X ) } { \\mathrm { E } } \\biggl [ f _ { \\lambda } ^ { * } \\biggl ( \\kappa - \\frac 1 2 \\biggr ) H ( X ) + f _ { \\lambda } ^ { * } \\biggl ( \\kappa + \\frac 1 2 \\biggr ) ( 1 - H ( X ) ) \\biggr ] } } \\\\ { { \\displaystyle = \\kappa - \\lambda \\epsilon - \\theta _ { a } f _ { \\lambda } ^ { * } \\biggl ( \\kappa - \\frac 1 2 \\biggr ) - ( 1 - \\theta _ { a } ) f _ { \\lambda } ^ { * } \\biggl ( \\kappa + \\frac 1 2 \\biggr ) \\enspace , } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 484, + 641, + 747, + 641, + 747, + 675, + 484, + 675 + ], + "score": 0.93, + "latex": "\\phi ( x ) = 1 [ \\dot { H } ( x ) > 1 / 2 ]" + }, + { + "category_id": 13, + "poly": [ + 649, + 456, + 823, + 456, + 823, + 489, + 649, + 489 + ], + "score": 0.92, + "latex": "H : \\mathcal { X } [ 0 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 298, + 749, + 452, + 749, + 452, + 784, + 298, + 784 + ], + "score": 0.92, + "latex": "D _ { f } ( \\nu \\| \\bar { \\rho } ) \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 702, + 550, + 758, + 550, + 758, + 583, + 702, + 583 + ], + "score": 0.92, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 1139, + 641, + 1285, + 641, + 1285, + 675, + 1139, + 675 + ], + "score": 0.92, + "latex": "\\mathbf { \\bar { \\boldsymbol { H } } } ( x ) \\mathbf { \\bar { \\boldsymbol { { \\Sigma } } } } > 1 / 2" + }, + { + "category_id": 13, + "poly": [ + 968, + 486, + 1171, + 486, + 1171, + 519, + 968, + 519 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\phi ( \\bar { x } ) = H ( x ) - \\frac { 1 } { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1579, + 369, + 1579, + 369, + 1611, + 298, + 1611 + ], + "score": 0.91, + "latex": "\\beta \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 492, + 1548, + 651, + 1548, + 651, + 1580, + 492, + 1580 + ], + "score": 0.91, + "latex": "\\theta _ { a } , \\theta _ { b } , \\rho , \\mathcal { D } , S" + }, + { + "category_id": 13, + "poly": [ + 718, + 672, + 1080, + 672, + 1080, + 709, + 718, + 709 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\dot { \\theta _ { a } } = H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1419, + 562, + 1419, + 562, + 1453, + 298, + 1453 + ], + "score": 0.91, + "latex": "\\{ \\mu ( x ^ { \\prime } ) : d ( x , x ^ { \\prime } ) \\leq \\epsilon \\}" + }, + { + "category_id": 13, + "poly": [ + 1262, + 1480, + 1337, + 1480, + 1337, + 1511, + 1262, + 1511 + ], + "score": 0.91, + "latex": "\\beta \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 1254, + 1421, + 1308, + 1421, + 1308, + 1453, + 1254, + 1453 + ], + "score": 0.91, + "latex": "\\mathcal { D } _ { x , \\epsilon }" + }, + { + "category_id": 13, + "poly": [ + 894, + 1831, + 947, + 1831, + 947, + 1860, + 894, + 1860 + ], + "score": 0.9, + "latex": "{ \\mathcal { D } } _ { \\mathrm { H S } }" + }, + { + "category_id": 13, + "poly": [ + 401, + 518, + 699, + 518, + 699, + 553, + 401, + 553 + ], + "score": 0.9, + "latex": "H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ]" + }, + { + "category_id": 13, + "poly": [ + 379, + 488, + 455, + 488, + 455, + 515, + 379, + 515 + ], + "score": 0.9, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 567, + 1451, + 611, + 1451, + 611, + 1481, + 567, + 1481 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { \\mathcal { F } }" + }, + { + "category_id": 13, + "poly": [ + 795, + 1801, + 849, + 1801, + 849, + 1830, + 795, + 1830 + ], + "score": 0.9, + "latex": "{ \\mathcal { D } } _ { \\mathrm { H S } }" + }, + { + "category_id": 13, + "poly": [ + 1318, + 1390, + 1405, + 1390, + 1405, + 1422, + 1318, + 1422 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { x , \\epsilon } =" + }, + { + "category_id": 13, + "poly": [ + 931, + 550, + 1283, + 550, + 1283, + 584, + 931, + 584 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { x , \\epsilon } = \\{ \\mu ( x ^ { \\prime } ) : \\| x ^ { \\prime } - x \\| \\le \\epsilon \\}" + }, + { + "category_id": 13, + "poly": [ + 1192, + 302, + 1236, + 302, + 1236, + 332, + 1192, + 332 + ], + "score": 0.89, + "latex": "\\mathcal { D } _ { \\mathcal { F } }" + }, + { + "category_id": 13, + "poly": [ + 1056, + 520, + 1207, + 520, + 1207, + 550, + 1056, + 550 + ], + "score": 0.89, + "latex": "\\left\\| x ^ { \\prime } - x \\right\\| ^ { - } \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 513, + 486, + 657, + 486, + 657, + 519, + 513, + 519 + ], + "score": 0.89, + "latex": "\\dot { H } ( x ) > 1 / 2" + }, + { + "category_id": 13, + "poly": [ + 1279, + 581, + 1398, + 581, + 1398, + 614, + 1279, + 614 + ], + "score": 0.89, + "latex": "X \\sim \\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 1012, + 1549, + 1323, + 1549, + 1323, + 1583, + 1012, + 1583 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\epsilon _ { \\beta } = \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 337, + 1617, + 1331, + 1617, + 1331, + 1681, + 337, + 1681 + ], + "score": 0.88, + "latex": "\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * } = \\operatorname * { a r g m a x } _ { \\beta _ { a } \\ge \\beta _ { b } \\ge 0 } ~ 1 - \\beta _ { a } ( 1 - \\theta _ { a } ) - \\beta _ { b } \\theta _ { b } - \\left( \\epsilon _ { \\beta _ { a } } + [ 1 - \\beta _ { a } ] _ { + } \\right) - \\left( \\epsilon _ { \\beta _ { b } } + [ 1 - \\beta _ { b } ] _ { + } \\right) ~ ." + }, + { + "category_id": 13, + "poly": [ + 1037, + 583, + 1268, + 583, + 1268, + 614, + 1037, + 614 + ], + "score": 0.87, + "latex": "\\phi ( X ) \\in [ - 1 / 2 , 1 / 2 ]" + }, + { + "category_id": 13, + "poly": [ + 970, + 520, + 995, + 520, + 995, + 545, + 970, + 545 + ], + "score": 0.86, + "latex": "x ^ { \\prime }" + }, + { + "category_id": 14, + "poly": [ + 363, + 1723, + 1330, + 1723, + 1330, + 1765, + 363, + 1765 + ], + "score": 0.86, + "latex": "\\begin{array} { r } { \\mathcal { D } _ { \\mathrm { H S } } = \\left\\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { \\mathrm { H S } ; \\beta _ { \\alpha } ^ { * } } \\left( \\nu \\mid \\mid \\rho \\right) \\leq \\epsilon _ { \\beta _ { \\alpha } ^ { * } } \\right\\} \\cap \\left\\{ \\nu \\in \\mathcal { P } ( \\mathcal { X } ) : D _ { \\mathrm { H S } ; \\beta _ { b } ^ { * } } \\left( \\nu \\mid \\mid \\rho \\right) \\leq \\epsilon _ { \\beta _ { b } ^ { * } } \\right\\} \\ . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 855, + 519, + 894, + 519, + 894, + 547, + 855, + 547 + ], + "score": 0.85, + "latex": "+ 1" + }, + { + "category_id": 13, + "poly": [ + 1357, + 519, + 1376, + 519, + 1376, + 550, + 1357, + 550 + ], + "score": 0.85, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 919, + 302, + 939, + 302, + 939, + 333, + 919, + 333 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 1141, + 721, + 1159, + 721, + 1159, + 752, + 1141, + 752 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 453, + 1580, + 527, + 1580, + 527, + 1613, + 453, + 1613 + ], + "score": 0.85, + "latex": "\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 773, + 1136, + 821, + 1136, + 821, + 1166, + 773, + 1166 + ], + "score": 0.85, + "latex": "\\kappa , \\lambda" + }, + { + "category_id": 13, + "poly": [ + 1128, + 1235, + 1149, + 1235, + 1149, + 1266, + 1128, + 1266 + ], + "score": 0.84, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 604, + 1805, + 622, + 1805, + 622, + 1832, + 604, + 1832 + ], + "score": 0.82, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 852, + 1774, + 871, + 1774, + 871, + 1800, + 852, + 1800 + ], + "score": 0.82, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 1218, + 459, + 1256, + 459, + 1256, + 485, + 1218, + 485 + ], + "score": 0.81, + "latex": "+ 1" + }, + { + "category_id": 13, + "poly": [ + 366, + 1770, + 388, + 1770, + 388, + 1796, + 366, + 1796 + ], + "score": 0.81, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1039, + 1770, + 1065, + 1770, + 1065, + 1797, + 1039, + 1797 + ], + "score": 0.79, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 1215, + 1770, + 1237, + 1770, + 1237, + 1797, + 1215, + 1797 + ], + "score": 0.78, + "latex": "S" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1902.0, + 841.0, + 1902.0, + 841.0, + 1945.0, + 293.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 399.0, + 991.0, + 399.0, + 991.0, + 434.0, + 295.0, + 434.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, + 1332.0, + 1252.0, + 1332.0, + 1252.0, + 1364.0, + 296.0, + 1364.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, + 452.0, + 648.0, + 452.0, + 648.0, + 494.0, + 294.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 824.0, + 452.0, + 1217.0, + 452.0, + 1217.0, + 494.0, + 824.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1257.0, + 452.0, + 1408.0, + 452.0, + 1408.0, + 494.0, + 1257.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 481.0, + 378.0, + 481.0, + 378.0, + 526.0, + 290.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 481.0, + 512.0, + 481.0, + 512.0, + 526.0, + 456.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 481.0, + 967.0, + 481.0, + 967.0, + 526.0, + 658.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 481.0, + 1410.0, + 481.0, + 1410.0, + 526.0, + 1172.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 513.0, + 400.0, + 513.0, + 400.0, + 558.0, + 291.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 513.0, + 854.0, + 513.0, + 854.0, + 558.0, + 700.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 513.0, + 969.0, + 513.0, + 969.0, + 558.0, + 895.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 513.0, + 1055.0, + 513.0, + 1055.0, + 558.0, + 996.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.0, + 513.0, + 1356.0, + 513.0, + 1356.0, + 558.0, + 1208.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 513.0, + 1410.0, + 513.0, + 1410.0, + 558.0, + 1377.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 548.0, + 701.0, + 548.0, + 701.0, + 587.0, + 294.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 548.0, + 930.0, + 548.0, + 930.0, + 587.0, + 759.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 548.0, + 1407.0, + 548.0, + 1407.0, + 587.0, + 1284.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 577.0, + 1036.0, + 577.0, + 1036.0, + 617.0, + 292.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 577.0, + 1278.0, + 577.0, + 1278.0, + 617.0, + 1269.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 577.0, + 1408.0, + 577.0, + 1408.0, + 617.0, + 1399.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 609.0, + 1405.0, + 609.0, + 1405.0, + 646.0, + 294.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 641.0, + 483.0, + 641.0, + 483.0, + 675.0, + 295.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 748.0, + 641.0, + 1138.0, + 641.0, + 1138.0, + 675.0, + 748.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 641.0, + 1405.0, + 641.0, + 1405.0, + 675.0, + 1286.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 672.0, + 717.0, + 672.0, + 717.0, + 710.0, + 294.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 672.0, + 1093.0, + 672.0, + 1093.0, + 710.0, + 1081.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1384.0, + 1317.0, + 1384.0, + 1317.0, + 1426.0, + 292.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 1415.0, + 1253.0, + 1415.0, + 1253.0, + 1460.0, + 563.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1309.0, + 1415.0, + 1407.0, + 1415.0, + 1407.0, + 1460.0, + 1309.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1447.0, + 566.0, + 1447.0, + 566.0, + 1486.0, + 294.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 1447.0, + 1406.0, + 1447.0, + 1406.0, + 1486.0, + 612.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1479.0, + 1261.0, + 1479.0, + 1261.0, + 1515.0, + 294.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1338.0, + 1479.0, + 1405.0, + 1479.0, + 1405.0, + 1515.0, + 1338.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1510.0, + 657.0, + 1510.0, + 657.0, + 1545.0, + 293.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1100.0, + 1406.0, + 1100.0, + 1406.0, + 1139.0, + 293.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1135.0, + 772.0, + 1135.0, + 772.0, + 1167.0, + 295.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 1135.0, + 1405.0, + 1135.0, + 1405.0, + 1167.0, + 822.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1166.0, + 1403.0, + 1166.0, + 1403.0, + 1199.0, + 296.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1197.0, + 815.0, + 1197.0, + 815.0, + 1229.0, + 295.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1764.0, + 365.0, + 1764.0, + 365.0, + 1805.0, + 293.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 1764.0, + 851.0, + 1764.0, + 851.0, + 1805.0, + 389.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1764.0, + 1038.0, + 1764.0, + 1038.0, + 1805.0, + 872.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 1764.0, + 1214.0, + 1764.0, + 1214.0, + 1805.0, + 1066.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1238.0, + 1764.0, + 1409.0, + 1764.0, + 1409.0, + 1805.0, + 1238.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1800.0, + 603.0, + 1800.0, + 603.0, + 1834.0, + 295.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 1800.0, + 794.0, + 1800.0, + 794.0, + 1834.0, + 623.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 1800.0, + 1404.0, + 1800.0, + 1404.0, + 1834.0, + 850.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1825.0, + 893.0, + 1825.0, + 893.0, + 1868.0, + 293.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 1825.0, + 960.0, + 1825.0, + 960.0, + 1868.0, + 948.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 715.0, + 1140.0, + 715.0, + 1140.0, + 756.0, + 292.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 715.0, + 1405.0, + 715.0, + 1405.0, + 756.0, + 1160.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 748.0, + 632.0, + 748.0, + 632.0, + 785.0, + 453.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1967.0, + 1405.0, + 1967.0, + 1405.0, + 2011.0, + 292.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2000.0, + 1405.0, + 2000.0, + 1405.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1230.0, + 1127.0, + 1230.0, + 1127.0, + 1269.0, + 296.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 1230.0, + 1405.0, + 1230.0, + 1405.0, + 1269.0, + 1150.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1262.0, + 1347.0, + 1262.0, + 1347.0, + 1298.0, + 296.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1545.0, + 491.0, + 1545.0, + 491.0, + 1585.0, + 294.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 1545.0, + 1011.0, + 1545.0, + 1011.0, + 1585.0, + 652.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1324.0, + 1545.0, + 1406.0, + 1545.0, + 1406.0, + 1585.0, + 1324.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1576.0, + 297.0, + 1576.0, + 297.0, + 1615.0, + 294.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1576.0, + 452.0, + 1576.0, + 452.0, + 1615.0, + 370.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 1576.0, + 778.0, + 1576.0, + 778.0, + 1615.0, + 528.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1683.0, + 574.0, + 1683.0, + 574.0, + 1720.0, + 295.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 228.0, + 1406.0, + 228.0, + 1406.0, + 263.0, + 317.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 259.0, + 491.0, + 259.0, + 491.0, + 295.0, + 349.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 297.0, + 918.0, + 297.0, + 918.0, + 338.0, + 312.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 940.0, + 297.0, + 1191.0, + 297.0, + 1191.0, + 338.0, + 940.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1237.0, + 297.0, + 1408.0, + 297.0, + 1408.0, + 338.0, + 1237.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 332.0, + 1356.0, + 332.0, + 1356.0, + 366.0, + 352.0, + 366.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1498, + 1405, + 1498, + 1405, + 1759, + 297, + 1759 + ], + "score": 0.986 + }, + { + "category_id": 5, + "poly": [ + 312, + 380, + 1388, + 380, + 1388, + 672, + 312, + 672 + ], + "score": 0.983, + "html": "
μ(x))Computation-IUse additionalinformation?Optimal
Cohen et al. (2019)Gaussian0(1)l2XYes
Lee et al. (2019)FiniteSupport*0(d3)lOnly decision treesYes
Li et al. (2019)GaussianLaplacian0(1)l2lXNo
Lecuyer et al. (2019)Arbitrary0(1)AllepXNo
Our workArbitrary0(1)AllepArbitrary classifiersYes
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1772, + 1404, + 1772, + 1404, + 1927, + 298, + 1927 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 813, + 1404, + 813, + 1404, + 969, + 297, + 969 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 979, + 1404, + 979, + 1404, + 1111, + 297, + 1111 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1114, + 1405, + 1114, + 1405, + 1210, + 298, + 1210 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1941, + 1402, + 1941, + 1402, + 2035, + 299, + 2035 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 1404, + 228, + 1404, + 354, + 298, + 354 + ], + "score": 0.964 + }, + { + "category_id": 8, + "poly": [ + 687, + 1371, + 1011, + 1371, + 1011, + 1433, + 687, + 1433 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 297, + 1293, + 1407, + 1293, + 1407, + 1357, + 297, + 1357 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 548, + 1222, + 1152, + 1222, + 1152, + 1283, + 548, + 1283 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 297, + 1443, + 997, + 1443, + 997, + 1477, + 297, + 1477 + ], + "score": 0.931 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.908 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1237, + 1400, + 1237, + 1400, + 1266, + 1366, + 1266 + ], + "score": 0.887 + }, + { + "category_id": 6, + "poly": [ + 302, + 695, + 1400, + 695, + 1400, + 781, + 302, + 781 + ], + "score": 0.85 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.801 + }, + { + "category_id": 13, + "poly": [ + 779, + 479, + 850, + 479, + 850, + 512, + 779, + 512 + ], + "score": 0.93, + "latex": "O ( d ^ { 3 } )" + }, + { + "category_id": 14, + "poly": [ + 687, + 1367, + 1012, + 1367, + 1012, + 1434, + 687, + 1434 + ], + "score": 0.93, + "latex": "\\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } ," + }, + { + "category_id": 13, + "poly": [ + 778, + 1534, + 834, + 1534, + 834, + 1579, + 778, + 1579 + ], + "score": 0.93, + "latex": "\\frac { \\nu ( X ) } { \\rho ( X ) }" + }, + { + "category_id": 14, + "poly": [ + 547, + 1221, + 1150, + 1221, + 1150, + 1283, + 547, + 1283 + ], + "score": 0.93, + "latex": "\\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) + \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 ," + }, + { + "category_id": 13, + "poly": [ + 969, + 1293, + 1059, + 1293, + 1059, + 1328, + 969, + 1328 + ], + "score": 0.93, + "latex": "\\mathcal { N } ( 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 1086, + 982, + 1312, + 982, + 1312, + 1017, + 1086, + 1017 + ], + "score": 0.92, + "latex": "D _ { \\mathrm { H S } , \\beta } ( \\mu ( x ) \\| \\mu ( x ^ { \\prime } ) )" + }, + { + "category_id": 13, + "poly": [ + 1065, + 1017, + 1181, + 1017, + 1181, + 1050, + 1065, + 1050 + ], + "score": 0.92, + "latex": "\\| x - x ^ { \\prime } \\| _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 612, + 980, + 843, + 980, + 843, + 1019, + 612, + 1019 + ], + "score": 0.92, + "latex": "\\mu ( x ) \\ : = \\ : \\mathcal { N } \\big ( x , \\sigma ^ { 2 } I \\big )" + }, + { + "category_id": 13, + "poly": [ + 1042, + 262, + 1108, + 262, + 1108, + 293, + 1042, + 293 + ], + "score": 0.92, + "latex": "\\theta _ { a } , \\theta _ { b }" + }, + { + "category_id": 13, + "poly": [ + 785, + 545, + 844, + 545, + 844, + 575, + 785, + 575 + ], + "score": 0.92, + "latex": "O ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 577, + 1048, + 651, + 1048, + 651, + 1081, + 577, + 1081 + ], + "score": 0.91, + "latex": "\\beta _ { a } ^ { * } , \\beta _ { b } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 806, + 1634, + 879, + 1634, + 879, + 1668, + 806, + 1668 + ], + "score": 0.91, + "latex": "O ( d ^ { 3 } )" + }, + { + "category_id": 13, + "poly": [ + 924, + 1536, + 1166, + 1536, + 1166, + 1572, + 924, + 1572 + ], + "score": 0.91, + "latex": "\\nu = \\mu ( \\boldsymbol { x } ^ { \\prime } ) , \\rho = \\mu ( \\boldsymbol { x } ) )" + }, + { + "category_id": 13, + "poly": [ + 1196, + 1118, + 1400, + 1118, + 1400, + 1149, + 1196, + 1149 + ], + "score": 0.91, + "latex": "1 \\geq \\theta _ { a } \\geq \\theta _ { b } \\geq 0 ." + }, + { + "category_id": 13, + "poly": [ + 696, + 1115, + 1141, + 1115, + 1141, + 1153, + 696, + 1153 + ], + "score": 0.91, + "latex": "\\mathcal { D } _ { x , \\epsilon } = \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\le \\epsilon \\}" + }, + { + "category_id": 13, + "poly": [ + 941, + 546, + 966, + 546, + 966, + 572, + 941, + 572 + ], + "score": 0.9, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 785, + 638, + 844, + 638, + 844, + 668, + 785, + 668 + ], + "score": 0.9, + "latex": "O ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 785, + 608, + 843, + 608, + 843, + 637, + 785, + 637 + ], + "score": 0.89, + "latex": "O ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 342, + 1149, + 396, + 1149, + 396, + 1179, + 342, + 1179 + ], + "score": 0.89, + "latex": "\\mathcal { D } _ { \\mathrm { H S } }" + }, + { + "category_id": 13, + "poly": [ + 941, + 577, + 966, + 577, + 966, + 602, + 941, + 602 + ], + "score": 0.89, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 372, + 1296, + 409, + 1296, + 409, + 1330, + 372, + 1330 + ], + "score": 0.89, + "latex": "\\Psi _ { g }" + }, + { + "category_id": 13, + "poly": [ + 941, + 483, + 966, + 483, + 966, + 508, + 941, + 508 + ], + "score": 0.89, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 941, + 449, + 966, + 449, + 966, + 475, + 941, + 475 + ], + "score": 0.88, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 501, + 1115, + 681, + 1115, + 681, + 1153, + 501, + 1153 + ], + "score": 0.88, + "latex": "\\rho = { \\mathcal { N } } ( x , \\sigma ^ { 2 } I )" + }, + { + "category_id": 13, + "poly": [ + 785, + 449, + 844, + 449, + 844, + 478, + 785, + 478 + ], + "score": 0.88, + "latex": "O ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 1240, + 1151, + 1294, + 1151, + 1294, + 1180, + 1240, + 1180 + ], + "score": 0.88, + "latex": "{ \\mathcal { D } } _ { \\mathrm { H S } }" + }, + { + "category_id": 13, + "poly": [ + 932, + 1017, + 961, + 1017, + 961, + 1047, + 932, + 1047 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 750, + 846, + 778, + 846, + 778, + 876, + 750, + 876 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 689, + 1668, + 714, + 1668, + 714, + 1697, + 689, + 1697 + ], + "score": 0.86, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 626, + 386, + 681, + 386, + 681, + 416, + 626, + 416 + ], + "score": 0.86, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 899, + 1805, + 926, + 1805, + 926, + 1834, + 899, + 1834 + ], + "score": 0.86, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1001, + 1805, + 1030, + 1805, + 1030, + 1834, + 1001, + 1834 + ], + "score": 0.81, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1118, + 1636, + 1136, + 1636, + 1136, + 1663, + 1118, + 1663 + ], + "score": 0.8, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 539, + 1978, + 561, + 1978, + 561, + 2005, + 539, + 2005 + ], + "score": 0.79, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 935, + 609, + 988, + 609, + 988, + 638, + 935, + 638 + ], + "score": 0.54, + "latex": "\\underline { { \\mathrm { ~ l l ~ } \\ell _ { p } } }" + }, + { + "category_id": 13, + "poly": [ + 962, + 638, + 988, + 638, + 988, + 669, + 962, + 669 + ], + "score": 0.39, + "latex": "\\underline { { \\ell _ { p } } }" + }, + { + "category_id": 13, + "poly": [ + 920, + 638, + 988, + 638, + 988, + 669, + 920, + 669 + ], + "score": 0.37, + "latex": "\\underline { { \\operatorname { A l l } \\ell _ { p } } }" + }, + { + "category_id": 13, + "poly": [ + 936, + 386, + 972, + 386, + 972, + 416, + 936, + 416 + ], + "score": 0.33, + "latex": "\\lVert \\cdot \\rVert" + }, + { + "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": [ + 296.0, + 694.0, + 1404.0, + 694.0, + 1404.0, + 728.0, + 296.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 724.0, + 1404.0, + 724.0, + 1404.0, + 755.0, + 294.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 752.0, + 717.0, + 752.0, + 717.0, + 783.0, + 296.0, + 783.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, + 1501.0, + 1403.0, + 1501.0, + 1403.0, + 1536.0, + 295.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1529.0, + 777.0, + 1529.0, + 777.0, + 1579.0, + 294.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1529.0, + 923.0, + 1529.0, + 923.0, + 1579.0, + 835.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 1529.0, + 1406.0, + 1529.0, + 1406.0, + 1579.0, + 1167.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1571.0, + 1405.0, + 1571.0, + 1405.0, + 1610.0, + 294.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1605.0, + 1405.0, + 1605.0, + 1405.0, + 1640.0, + 295.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1632.0, + 805.0, + 1632.0, + 805.0, + 1670.0, + 294.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 1632.0, + 1117.0, + 1632.0, + 1117.0, + 1670.0, + 880.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 1632.0, + 1407.0, + 1632.0, + 1407.0, + 1670.0, + 1137.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1665.0, + 688.0, + 1665.0, + 688.0, + 1700.0, + 294.0, + 1700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 1665.0, + 1406.0, + 1665.0, + 1406.0, + 1700.0, + 715.0, + 1700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1697.0, + 1406.0, + 1697.0, + 1406.0, + 1729.0, + 296.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1726.0, + 1349.0, + 1726.0, + 1349.0, + 1761.0, + 295.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1774.0, + 1405.0, + 1774.0, + 1405.0, + 1807.0, + 296.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1803.0, + 898.0, + 1803.0, + 898.0, + 1836.0, + 296.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1803.0, + 1000.0, + 1803.0, + 1000.0, + 1836.0, + 927.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 1803.0, + 1402.0, + 1803.0, + 1402.0, + 1836.0, + 1031.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1834.0, + 1405.0, + 1834.0, + 1405.0, + 1871.0, + 294.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1863.0, + 1405.0, + 1863.0, + 1405.0, + 1900.0, + 294.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1893.0, + 847.0, + 1893.0, + 847.0, + 1929.0, + 295.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 815.0, + 1404.0, + 815.0, + 1404.0, + 848.0, + 297.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 844.0, + 749.0, + 844.0, + 749.0, + 882.0, + 295.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 779.0, + 844.0, + 1405.0, + 844.0, + 1405.0, + 882.0, + 779.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 875.0, + 1406.0, + 875.0, + 1406.0, + 911.0, + 292.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 904.0, + 1405.0, + 904.0, + 1405.0, + 942.0, + 295.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 936.0, + 1267.0, + 936.0, + 1267.0, + 974.0, + 296.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 979.0, + 611.0, + 979.0, + 611.0, + 1020.0, + 292.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 979.0, + 1085.0, + 979.0, + 1085.0, + 1020.0, + 844.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1313.0, + 979.0, + 1404.0, + 979.0, + 1404.0, + 1020.0, + 1313.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1015.0, + 931.0, + 1015.0, + 931.0, + 1052.0, + 294.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 1015.0, + 1064.0, + 1015.0, + 1064.0, + 1052.0, + 962.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1182.0, + 1015.0, + 1405.0, + 1015.0, + 1405.0, + 1052.0, + 1182.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1045.0, + 576.0, + 1045.0, + 576.0, + 1084.0, + 292.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 1045.0, + 1405.0, + 1045.0, + 1405.0, + 1084.0, + 652.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1079.0, + 506.0, + 1079.0, + 506.0, + 1110.0, + 295.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1114.0, + 500.0, + 1114.0, + 500.0, + 1152.0, + 296.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1114.0, + 695.0, + 1114.0, + 695.0, + 1152.0, + 682.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 1114.0, + 1195.0, + 1114.0, + 1195.0, + 1152.0, + 1142.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1114.0, + 1407.0, + 1114.0, + 1407.0, + 1152.0, + 1401.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1145.0, + 341.0, + 1145.0, + 341.0, + 1184.0, + 292.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 1145.0, + 1239.0, + 1145.0, + 1239.0, + 1184.0, + 397.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 1145.0, + 1405.0, + 1145.0, + 1405.0, + 1184.0, + 1295.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1178.0, + 785.0, + 1178.0, + 785.0, + 1212.0, + 296.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 1407.0, + 1941.0, + 1407.0, + 1978.0, + 294.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1972.0, + 538.0, + 1972.0, + 538.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2009.0, + 562.0, + 2009.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": [ + 294.0, + 231.0, + 1402.0, + 231.0, + 1402.0, + 264.0, + 294.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 262.0, + 1041.0, + 262.0, + 1041.0, + 296.0, + 292.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 262.0, + 1405.0, + 262.0, + 1405.0, + 296.0, + 1109.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 292.0, + 1409.0, + 292.0, + 1409.0, + 329.0, + 293.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 320.0, + 471.0, + 320.0, + 471.0, + 358.0, + 294.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1290.0, + 371.0, + 1290.0, + 371.0, + 1331.0, + 292.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 1290.0, + 968.0, + 1290.0, + 968.0, + 1331.0, + 410.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1060.0, + 1290.0, + 1405.0, + 1290.0, + 1405.0, + 1331.0, + 1060.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1325.0, + 1088.0, + 1325.0, + 1088.0, + 1360.0, + 294.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1439.0, + 998.0, + 1439.0, + 998.0, + 1481.0, + 293.0, + 1481.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 570, + 936, + 570, + 936, + 1030, + 299, + 1030 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1789, + 1403, + 1789, + 1403, + 2035, + 298, + 2035 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1046, + 934, + 1046, + 934, + 1319, + 298, + 1319 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1621, + 1403, + 1621, + 1403, + 1774, + 298, + 1774 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 298, + 1469, + 937, + 1469, + 937, + 1621, + 298, + 1621 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 323, + 298, + 323 + ], + "score": 0.956 + }, + { + "category_id": 0, + "poly": [ + 299, + 406, + 557, + 406, + 557, + 440, + 299, + 440 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 104, + 300, + 104 + ], + "score": 0.876 + }, + { + "category_id": 0, + "poly": [ + 301, + 1397, + 731, + 1397, + 731, + 1427, + 301, + 1427 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.78 + }, + { + "category_id": 1, + "poly": [ + 294, + 498, + 1285, + 498, + 1285, + 528, + 294, + 528 + ], + "score": 0.728 + }, + { + "category_id": 3, + "poly": [ + 1009, + 602, + 1347, + 602, + 1347, + 933, + 1009, + 933 + ], + "score": 0.651 + }, + { + "category_id": 4, + "poly": [ + 958, + 956, + 1403, + 956, + 1403, + 1542, + 958, + 1542 + ], + "score": 0.635 + }, + { + "category_id": 1, + "poly": [ + 958, + 956, + 1403, + 956, + 1403, + 1542, + 958, + 1542 + ], + "score": 0.375 + }, + { + "category_id": 0, + "poly": [ + 294, + 498, + 1285, + 498, + 1285, + 528, + 294, + 528 + ], + "score": 0.217 + }, + { + "category_id": 13, + "poly": [ + 970, + 1743, + 1060, + 1743, + 1060, + 1775, + 970, + 1775 + ], + "score": 0.91, + "latex": "p = 0 . 2" + }, + { + "category_id": 13, + "poly": [ + 297, + 964, + 695, + 964, + 695, + 1001, + 297, + 1001 + ], + "score": 0.91, + "latex": "N = 1 0 0 0 , \\tilde { N } = 1 0 0 0 0 0 , \\zeta = . 9 9" + }, + { + "category_id": 13, + "poly": [ + 470, + 1744, + 560, + 1744, + 560, + 1775, + 470, + 1775 + ], + "score": 0.91, + "latex": "p = 0 . 8" + }, + { + "category_id": 13, + "poly": [ + 587, + 1973, + 670, + 1973, + 670, + 2002, + 587, + 2002 + ], + "score": 0.88, + "latex": "7- 1 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 668, + 1944, + 733, + 1944, + 733, + 1971, + 668, + 1971 + ], + "score": 0.88, + "latex": "\\epsilon = 3" + }, + { + "category_id": 13, + "poly": [ + 1005, + 1621, + 1032, + 1621, + 1032, + 1652, + 1005, + 1652 + ], + "score": 0.87, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 534, + 1200, + 562, + 1200, + 562, + 1229, + 534, + 1229 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 601, + 1470, + 628, + 1470, + 628, + 1500, + 601, + 1500 + ], + "score": 0.86, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 830, + 1200, + 934, + 1200, + 934, + 1229, + 830, + 1229 + ], + "score": 0.86, + "latex": "\\epsilon = 9 . 4 2" + }, + { + "category_id": 13, + "poly": [ + 298, + 1290, + 397, + 1290, + 397, + 1319, + 298, + 1319 + ], + "score": 0.86, + "latex": "\\epsilon = 2 . 6 9" + }, + { + "category_id": 13, + "poly": [ + 880, + 813, + 902, + 813, + 902, + 845, + 880, + 845 + ], + "score": 0.83, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 1376, + 987, + 1401, + 987, + 1401, + 1014, + 1376, + 1014 + ], + "score": 0.82, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 912, + 1888, + 926, + 1888, + 926, + 1909, + 912, + 1909 + ], + "score": 0.5, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1194, + 1857, + 1212, + 1857, + 1212, + 1878, + 1194, + 1878 + ], + "score": 0.41, + "latex": "\\epsilon" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 401.0, + 562.0, + 401.0, + 562.0, + 446.0, + 292.0, + 446.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": [ + 296.0, + 1395.0, + 734.0, + 1395.0, + 734.0, + 1430.0, + 296.0, + 1430.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": [ + 1009.0, + 601.0, + 1037.0, + 601.0, + 1037.0, + 889.0, + 1009.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 602.0, + 1075.0, + 602.0, + 1075.0, + 631.0, + 1031.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 623.0, + 1329.0, + 623.0, + 1329.0, + 633.0, + 1320.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 641.0, + 1311.0, + 641.0, + 1311.0, + 655.0, + 1298.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 657.0, + 1065.0, + 657.0, + 1065.0, + 682.0, + 1045.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 670.0, + 1282.0, + 670.0, + 1282.0, + 685.0, + 1269.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 679.0, + 1271.0, + 679.0, + 1271.0, + 693.0, + 1259.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1250.0, + 688.0, + 1262.0, + 688.0, + 1262.0, + 703.0, + 1250.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 709.0, + 1065.0, + 709.0, + 1065.0, + 734.0, + 1045.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1223.0, + 708.0, + 1244.0, + 708.0, + 1244.0, + 729.0, + 1223.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 763.0, + 1065.0, + 763.0, + 1065.0, + 788.0, + 1045.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1315.0, + 806.0, + 1325.0, + 806.0, + 1325.0, + 815.0, + 1315.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 810.0, + 1297.0, + 810.0, + 1297.0, + 821.0, + 1285.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 816.0, + 1064.0, + 816.0, + 1064.0, + 839.0, + 1045.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 816.0, + 1136.0, + 816.0, + 1136.0, + 827.0, + 1127.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 821.0, + 1244.0, + 821.0, + 1244.0, + 834.0, + 1230.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 836.0, + 1116.0, + 836.0, + 1116.0, + 844.0, + 1108.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1163.0, + 836.0, + 1177.0, + 836.0, + 1177.0, + 849.0, + 1163.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 840.0, + 1161.0, + 840.0, + 1161.0, + 852.0, + 1149.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 841.0, + 1143.0, + 841.0, + 1143.0, + 860.0, + 1119.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 846.0, + 1106.0, + 846.0, + 1106.0, + 855.0, + 1098.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 870.0, + 1066.0, + 870.0, + 1066.0, + 892.0, + 1046.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 879.0, + 1073.0, + 879.0, + 1073.0, + 890.0, + 1065.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 887.0, + 1079.0, + 887.0, + 1079.0, + 910.0, + 1061.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 887.0, + 1132.0, + 887.0, + 1132.0, + 912.0, + 1112.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 888.0, + 1185.0, + 888.0, + 1185.0, + 910.0, + 1166.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 888.0, + 1239.0, + 888.0, + 1239.0, + 912.0, + 1219.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 888.0, + 1291.0, + 888.0, + 1291.0, + 912.0, + 1272.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1319.0, + 886.0, + 1351.0, + 886.0, + 1351.0, + 913.0, + 1319.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 907.0, + 1333.0, + 907.0, + 1333.0, + 935.0, + 1077.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1302.0, + 633.0, + 1325.0, + 633.0, + 1325.0, + 643.0, + 1302.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 655.0, + 1307.0, + 655.0, + 1307.0, + 666.5, + 1275.0, + 666.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 698.0, + 1249.0, + 698.0, + 1249.0, + 713.0, + 1244.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 746.0, + 1231.0, + 746.0, + 1231.0, + 759.0, + 1167.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 790.5, + 1182.0, + 790.5, + 1182.0, + 804.5, + 1126.0, + 804.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 810.5, + 1285.0, + 810.5, + 1285.0, + 831.0, + 1244.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 824.5, + 1220.0, + 824.5, + 1220.0, + 843.5, + 1190.0, + 843.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.75, + 862.5, + 1105.75, + 862.5, + 1105.75, + 876.0, + 1066.75, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 957.0, + 1409.0, + 957.0, + 1409.0, + 989.0, + 956.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 984.0, + 1375.0, + 984.0, + 1375.0, + 1018.0, + 955.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1014.0, + 1405.0, + 1014.0, + 1405.0, + 1045.0, + 954.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1043.0, + 1404.0, + 1043.0, + 1404.0, + 1071.0, + 956.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1070.0, + 1404.0, + 1070.0, + 1404.0, + 1099.0, + 956.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1098.0, + 1404.0, + 1098.0, + 1404.0, + 1126.0, + 956.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1125.0, + 1404.0, + 1125.0, + 1404.0, + 1154.0, + 955.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1152.0, + 1404.0, + 1152.0, + 1404.0, + 1183.0, + 954.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1181.0, + 1405.0, + 1181.0, + 1405.0, + 1211.0, + 955.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1207.0, + 1405.0, + 1207.0, + 1405.0, + 1238.0, + 954.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1235.0, + 1407.0, + 1235.0, + 1407.0, + 1265.0, + 955.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1264.0, + 1407.0, + 1264.0, + 1407.0, + 1293.0, + 956.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 957.0, + 1293.0, + 1403.0, + 1293.0, + 1403.0, + 1318.0, + 957.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1319.0, + 1407.0, + 1319.0, + 1407.0, + 1348.0, + 956.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1345.0, + 1409.0, + 1345.0, + 1409.0, + 1379.0, + 954.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1372.0, + 1408.0, + 1372.0, + 1408.0, + 1403.0, + 955.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1401.0, + 1409.0, + 1401.0, + 1409.0, + 1433.0, + 955.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1431.0, + 1408.0, + 1431.0, + 1408.0, + 1459.0, + 956.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1456.0, + 1409.0, + 1456.0, + 1409.0, + 1487.0, + 955.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1485.0, + 1407.0, + 1485.0, + 1407.0, + 1514.0, + 955.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1514.0, + 1050.0, + 1514.0, + 1050.0, + 1545.0, + 955.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 498.0, + 1290.0, + 498.0, + 1290.0, + 529.0, + 296.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 569.0, + 939.0, + 569.0, + 939.0, + 602.0, + 294.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 600.0, + 937.0, + 600.0, + 937.0, + 631.0, + 295.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 631.0, + 936.0, + 631.0, + 936.0, + 664.0, + 294.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 662.0, + 937.0, + 662.0, + 937.0, + 692.0, + 295.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 689.0, + 937.0, + 689.0, + 937.0, + 725.0, + 293.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 722.0, + 937.0, + 722.0, + 937.0, + 752.0, + 295.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 749.0, + 941.0, + 749.0, + 941.0, + 785.0, + 293.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 781.0, + 941.0, + 781.0, + 941.0, + 816.0, + 294.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 812.0, + 879.0, + 812.0, + 879.0, + 847.0, + 294.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 812.0, + 939.0, + 812.0, + 939.0, + 847.0, + 903.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 843.0, + 937.0, + 843.0, + 937.0, + 876.0, + 295.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 874.0, + 940.0, + 874.0, + 940.0, + 905.0, + 295.0, + 905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 904.0, + 938.0, + 904.0, + 938.0, + 938.0, + 295.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 933.0, + 938.0, + 933.0, + 938.0, + 968.0, + 294.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 967.0, + 935.0, + 967.0, + 935.0, + 1001.0, + 696.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1001.0, + 433.0, + 1001.0, + 433.0, + 1032.0, + 292.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1788.0, + 1408.0, + 1788.0, + 1408.0, + 1825.0, + 293.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1818.0, + 1407.0, + 1818.0, + 1407.0, + 1858.0, + 292.0, + 1858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1851.0, + 1193.0, + 1851.0, + 1193.0, + 1884.0, + 294.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 1851.0, + 1404.0, + 1851.0, + 1404.0, + 1884.0, + 1213.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 911.0, + 1882.0, + 911.0, + 1916.0, + 294.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1882.0, + 1405.0, + 1882.0, + 1405.0, + 1916.0, + 927.0, + 1916.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": [ + 292.0, + 1941.0, + 667.0, + 1941.0, + 667.0, + 1979.0, + 292.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1941.0, + 1407.0, + 1941.0, + 1407.0, + 1979.0, + 734.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1972.0, + 586.0, + 1972.0, + 586.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 1972.0, + 1407.0, + 1972.0, + 1407.0, + 2009.0, + 671.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 563.0, + 2002.0, + 563.0, + 2039.0, + 293.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1047.0, + 940.0, + 1047.0, + 940.0, + 1080.0, + 296.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1075.0, + 936.0, + 1075.0, + 936.0, + 1108.0, + 295.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1106.0, + 939.0, + 1106.0, + 939.0, + 1141.0, + 294.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1138.0, + 937.0, + 1138.0, + 937.0, + 1168.0, + 296.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1169.0, + 936.0, + 1169.0, + 936.0, + 1201.0, + 295.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1199.0, + 533.0, + 1199.0, + 533.0, + 1230.0, + 294.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 1199.0, + 829.0, + 1199.0, + 829.0, + 1230.0, + 563.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 1199.0, + 938.0, + 1199.0, + 938.0, + 1230.0, + 935.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1229.0, + 936.0, + 1229.0, + 936.0, + 1261.0, + 295.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1259.0, + 936.0, + 1259.0, + 936.0, + 1292.0, + 295.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 1289.0, + 410.0, + 1289.0, + 410.0, + 1321.0, + 398.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1621.0, + 1004.0, + 1621.0, + 1004.0, + 1654.0, + 294.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 1621.0, + 1405.0, + 1621.0, + 1405.0, + 1654.0, + 1033.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1647.0, + 1407.0, + 1647.0, + 1407.0, + 1690.0, + 292.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1680.0, + 1405.0, + 1680.0, + 1405.0, + 1716.0, + 293.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1709.0, + 1407.0, + 1709.0, + 1407.0, + 1749.0, + 293.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1741.0, + 469.0, + 1741.0, + 469.0, + 1778.0, + 294.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 1741.0, + 969.0, + 1741.0, + 969.0, + 1778.0, + 561.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 1741.0, + 1363.0, + 1741.0, + 1363.0, + 1778.0, + 1061.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1469.0, + 600.0, + 1469.0, + 600.0, + 1500.0, + 296.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1469.0, + 939.0, + 1469.0, + 939.0, + 1500.0, + 629.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1498.0, + 939.0, + 1498.0, + 939.0, + 1532.0, + 294.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1529.0, + 940.0, + 1529.0, + 940.0, + 1563.0, + 295.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1559.0, + 939.0, + 1559.0, + 939.0, + 1592.0, + 294.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1591.0, + 939.0, + 1591.0, + 939.0, + 1625.0, + 295.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 230.0, + 1405.0, + 230.0, + 1405.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 261.0, + 1404.0, + 261.0, + 1404.0, + 295.0, + 296.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 292.0, + 1062.0, + 292.0, + 1062.0, + 326.0, + 296.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 498.0, + 1290.0, + 498.0, + 1290.0, + 529.0, + 296.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 957.0, + 1409.0, + 957.0, + 1409.0, + 989.0, + 956.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 984.0, + 1375.0, + 984.0, + 1375.0, + 1018.0, + 955.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1014.0, + 1405.0, + 1014.0, + 1405.0, + 1045.0, + 954.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1043.0, + 1404.0, + 1043.0, + 1404.0, + 1071.0, + 956.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1070.0, + 1404.0, + 1070.0, + 1404.0, + 1099.0, + 956.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1098.0, + 1404.0, + 1098.0, + 1404.0, + 1126.0, + 956.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1125.0, + 1404.0, + 1125.0, + 1404.0, + 1154.0, + 955.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1152.0, + 1404.0, + 1152.0, + 1404.0, + 1183.0, + 954.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1181.0, + 1405.0, + 1181.0, + 1405.0, + 1211.0, + 955.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1207.0, + 1405.0, + 1207.0, + 1405.0, + 1238.0, + 954.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1235.0, + 1407.0, + 1235.0, + 1407.0, + 1265.0, + 955.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1264.0, + 1407.0, + 1264.0, + 1407.0, + 1293.0, + 956.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 957.0, + 1293.0, + 1403.0, + 1293.0, + 1403.0, + 1318.0, + 957.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1319.0, + 1407.0, + 1319.0, + 1407.0, + 1348.0, + 956.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1345.0, + 1409.0, + 1345.0, + 1409.0, + 1379.0, + 954.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1372.0, + 1408.0, + 1372.0, + 1408.0, + 1403.0, + 955.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1401.0, + 1409.0, + 1401.0, + 1409.0, + 1433.0, + 955.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1431.0, + 1408.0, + 1431.0, + 1408.0, + 1459.0, + 956.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1456.0, + 1409.0, + 1456.0, + 1409.0, + 1487.0, + 955.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1485.0, + 1407.0, + 1485.0, + 1407.0, + 1514.0, + 955.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1514.0, + 1050.0, + 1514.0, + 1050.0, + 1545.0, + 955.0, + 1545.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 297, + 1127, + 1404, + 1127, + 1404, + 1311, + 297, + 1311 + ], + "score": 0.979, + "html": "
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
∈=0∈=1e=2e=3e=4e=5e=6e=7
0.50.5110.2250.0910.0910.0910.0910.0910
LibrispeechOurs0.70.028s0.8850.6340.4050.4050.4050.40500
0.90.8720.7720.7110.7110.711000
" + }, + { + "category_id": 5, + "poly": [ + 297, + 223, + 1404, + 223, + 1404, + 441, + 297, + 441 + ], + "score": 0.979, + "html": "
DatasetCertificateSmoothing ValueComputation TimeCertified Accuracy
e=1e=2e=3e=4e=5∈=6∈=7
Binary MNISTLee et al. (2019) Ours0.83.68s 0.028s0.919 0.9190.767 0.7670.530 0.5300.513 0.2960.348 0.1620.194 0.0800.095 0.015
ImageNetLee et al. (2019) Ours0.24 days 0.028s0.488 0.3620.418 0.2620.310 0.2240.250 0.1860.244 0.1360.234 00.224 0
" + }, + { + "category_id": 1, + "poly": [ + 297, + 578, + 1404, + 578, + 1404, + 824, + 297, + 824 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1721, + 1404, + 1721, + 1404, + 1875, + 299, + 1875 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 838, + 1404, + 838, + 1404, + 994, + 299, + 994 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 300, + 1972, + 1402, + 1972, + 1402, + 2034, + 300, + 2034 + ], + "score": 0.928 + }, + { + "category_id": 0, + "poly": [ + 300, + 1651, + 544, + 1651, + 544, + 1687, + 300, + 1687 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.89 + }, + { + "category_id": 1, + "poly": [ + 297, + 1329, + 1405, + 1329, + 1405, + 1613, + 297, + 1613 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 300, + 1921, + 488, + 1921, + 488, + 1954, + 300, + 1954 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 836, + 2089, + 864, + 2089, + 864, + 2112, + 836, + 2112 + ], + "score": 0.838 + }, + { + "category_id": 1, + "poly": [ + 297, + 1007, + 1403, + 1007, + 1403, + 1102, + 297, + 1102 + ], + "score": 0.65 + }, + { + "category_id": 6, + "poly": [ + 297, + 1007, + 1403, + 1007, + 1403, + 1102, + 297, + 1102 + ], + "score": 0.555 + }, + { + "category_id": 0, + "poly": [ + 297, + 522, + 1076, + 522, + 1076, + 554, + 297, + 554 + ], + "score": 0.373 + }, + { + "category_id": 6, + "poly": [ + 324, + 473, + 1354, + 473, + 1354, + 502, + 324, + 502 + ], + "score": 0.326 + }, + { + "category_id": 1, + "poly": [ + 324, + 473, + 1354, + 473, + 1354, + 502, + 324, + 502 + ], + "score": 0.319 + }, + { + "category_id": 13, + "poly": [ + 504, + 930, + 576, + 930, + 576, + 964, + 504, + 964 + ], + "score": 0.93, + "latex": "\\mathrm { \\bar { \\it O } } ( d ^ { 3 } )" + }, + { + "category_id": 13, + "poly": [ + 640, + 1498, + 725, + 1498, + 725, + 1526, + 640, + 1526 + ], + "score": 0.88, + "latex": "p = 0 . 5" + }, + { + "category_id": 13, + "poly": [ + 734, + 1498, + 821, + 1498, + 821, + 1526, + 734, + 1526 + ], + "score": 0.88, + "latex": "p = 0 . 7" + }, + { + "category_id": 13, + "poly": [ + 874, + 1498, + 959, + 1498, + 959, + 1525, + 874, + 1525 + ], + "score": 0.88, + "latex": "p = 0 . 9" + }, + { + "category_id": 13, + "poly": [ + 1046, + 702, + 1074, + 702, + 1074, + 733, + 1046, + 733 + ], + "score": 0.87, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 840, + 475, + 865, + 475, + 865, + 501, + 840, + 501 + ], + "score": 0.87, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1255, + 1527, + 1334, + 1527, + 1334, + 1554, + 1255, + 1554 + ], + "score": 0.87, + "latex": "M = 1" + }, + { + "category_id": 13, + "poly": [ + 1121, + 1723, + 1140, + 1723, + 1140, + 1754, + 1121, + 1754 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 824, + 1525, + 1192, + 1525, + 1192, + 1557, + 824, + 1557 + ], + "score": 0.85, + "latex": "N = 1 0 0 0 , \\tilde { N } = 1 0 0 0 0 0 , \\zeta = . 9 9" + }, + { + "category_id": 13, + "poly": [ + 401, + 1331, + 426, + 1331, + 426, + 1359, + 401, + 1359 + ], + "score": 0.81, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1158, + 1414, + 1253, + 1414, + 1253, + 1442, + 1158, + 1442 + ], + "score": 0.8, + "latex": "\\beta _ { 1 } = 0 . 9" + }, + { + "category_id": 13, + "poly": [ + 470, + 1561, + 490, + 1561, + 490, + 1581, + 470, + 1581 + ], + "score": 0.77, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 883, + 932, + 902, + 932, + 902, + 959, + 883, + 959 + ], + "score": 0.73, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1262, + 1414, + 1360, + 1414, + 1360, + 1442, + 1262, + 1442 + ], + "score": 0.71, + "latex": "\\beta _ { 2 } = 0 . 5" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1645.0, + 550.0, + 1645.0, + 550.0, + 1697.0, + 291.0, + 1697.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": [ + 295.0, + 1920.0, + 491.0, + 1920.0, + 491.0, + 1958.0, + 295.0, + 1958.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": [ + 292.0, + 1003.0, + 1405.0, + 1003.0, + 1405.0, + 1045.0, + 292.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1039.0, + 1405.0, + 1039.0, + 1405.0, + 1073.0, + 295.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1068.0, + 1275.0, + 1068.0, + 1275.0, + 1105.0, + 294.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 519.0, + 1079.0, + 519.0, + 1079.0, + 558.0, + 294.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 467.0, + 839.0, + 467.0, + 839.0, + 508.0, + 331.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 467.0, + 1357.0, + 467.0, + 1357.0, + 508.0, + 866.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 580.0, + 1407.0, + 580.0, + 1407.0, + 613.0, + 295.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 606.0, + 1407.0, + 606.0, + 1407.0, + 646.0, + 294.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 641.0, + 1406.0, + 641.0, + 1406.0, + 675.0, + 295.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 670.0, + 1407.0, + 670.0, + 1407.0, + 707.0, + 294.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 702.0, + 1045.0, + 702.0, + 1045.0, + 736.0, + 295.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 702.0, + 1406.0, + 702.0, + 1406.0, + 736.0, + 1075.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 730.0, + 1406.0, + 730.0, + 1406.0, + 768.0, + 291.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 763.0, + 1406.0, + 763.0, + 1406.0, + 797.0, + 295.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 794.0, + 1087.0, + 794.0, + 1087.0, + 827.0, + 295.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1719.0, + 1120.0, + 1719.0, + 1120.0, + 1757.0, + 293.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 1719.0, + 1408.0, + 1719.0, + 1408.0, + 1757.0, + 1141.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1749.0, + 1405.0, + 1749.0, + 1405.0, + 1787.0, + 293.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1782.0, + 1406.0, + 1782.0, + 1406.0, + 1819.0, + 294.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1813.0, + 1405.0, + 1813.0, + 1405.0, + 1850.0, + 294.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1843.0, + 1306.0, + 1843.0, + 1306.0, + 1880.0, + 295.0, + 1880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 840.0, + 1405.0, + 840.0, + 1405.0, + 873.0, + 297.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 868.0, + 1405.0, + 868.0, + 1405.0, + 907.0, + 293.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 899.0, + 1406.0, + 899.0, + 1406.0, + 937.0, + 293.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 928.0, + 503.0, + 928.0, + 503.0, + 965.0, + 294.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 928.0, + 882.0, + 928.0, + 882.0, + 965.0, + 577.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 928.0, + 1404.0, + 928.0, + 1404.0, + 965.0, + 903.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 961.0, + 1228.0, + 961.0, + 1228.0, + 997.0, + 294.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2007.0, + 296.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 2000.0, + 1404.0, + 2000.0, + 1404.0, + 2038.0, + 321.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1327.0, + 400.0, + 1327.0, + 400.0, + 1363.0, + 292.0, + 1363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 427.0, + 1327.0, + 1405.0, + 1327.0, + 1405.0, + 1363.0, + 427.0, + 1363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1359.0, + 1403.0, + 1359.0, + 1403.0, + 1389.0, + 295.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1385.0, + 1408.0, + 1385.0, + 1408.0, + 1418.0, + 294.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1411.0, + 1157.0, + 1411.0, + 1157.0, + 1446.0, + 294.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 1411.0, + 1261.0, + 1411.0, + 1261.0, + 1446.0, + 1254.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1361.0, + 1411.0, + 1407.0, + 1411.0, + 1407.0, + 1446.0, + 1361.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1437.0, + 1407.0, + 1437.0, + 1407.0, + 1476.0, + 291.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1470.0, + 1405.0, + 1470.0, + 1405.0, + 1500.0, + 296.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1497.0, + 639.0, + 1497.0, + 639.0, + 1527.0, + 295.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 1497.0, + 733.0, + 1497.0, + 733.0, + 1527.0, + 726.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 1497.0, + 873.0, + 1497.0, + 873.0, + 1527.0, + 822.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 1497.0, + 1405.0, + 1497.0, + 1405.0, + 1527.0, + 960.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1526.0, + 823.0, + 1526.0, + 823.0, + 1560.0, + 294.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 1526.0, + 1254.0, + 1526.0, + 1254.0, + 1560.0, + 1193.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1526.0, + 1403.0, + 1526.0, + 1403.0, + 1560.0, + 1335.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1555.0, + 469.0, + 1555.0, + 469.0, + 1589.0, + 295.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 1555.0, + 1407.0, + 1555.0, + 1407.0, + 1589.0, + 491.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1584.0, + 1030.0, + 1584.0, + 1030.0, + 1614.0, + 296.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1003.0, + 1405.0, + 1003.0, + 1405.0, + 1045.0, + 292.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1039.0, + 1405.0, + 1039.0, + 1405.0, + 1073.0, + 295.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1068.0, + 1275.0, + 1068.0, + 1275.0, + 1105.0, + 294.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 467.0, + 839.0, + 467.0, + 839.0, + 508.0, + 331.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 467.0, + 1357.0, + 467.0, + 1357.0, + 508.0, + 866.0, + 508.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 402, + 1407, + 402, + 1407, + 494, + 297, + 494 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 298, + 285, + 1402, + 285, + 1402, + 378, + 298, + 378 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 298, + 635, + 1405, + 635, + 1405, + 731, + 298, + 731 + ], + "score": 0.907 + }, + { + "category_id": 1, + "poly": [ + 297, + 519, + 1407, + 519, + 1407, + 613, + 297, + 613 + ], + "score": 0.904 + }, + { + "category_id": 1, + "poly": [ + 298, + 751, + 1406, + 751, + 1406, + 876, + 298, + 876 + ], + "score": 0.894 + }, + { + "category_id": 1, + "poly": [ + 295, + 1101, + 1403, + 1101, + 1403, + 1167, + 295, + 1167 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 105, + 300, + 105 + ], + "score": 0.863 + }, + { + "category_id": 1, + "poly": [ + 297, + 1016, + 1400, + 1016, + 1400, + 1081, + 297, + 1081 + ], + "score": 0.86 + }, + { + "category_id": 1, + "poly": [ + 324, + 229, + 540, + 229, + 540, + 261, + 324, + 261 + ], + "score": 0.854 + }, + { + "category_id": 1, + "poly": [ + 295, + 1564, + 1404, + 1564, + 1404, + 1629, + 295, + 1629 + ], + "score": 0.849 + }, + { + "category_id": 1, + "poly": [ + 293, + 1767, + 1405, + 1767, + 1405, + 1832, + 293, + 1832 + ], + "score": 0.848 + }, + { + "category_id": 1, + "poly": [ + 294, + 1189, + 1401, + 1189, + 1401, + 1254, + 294, + 1254 + ], + "score": 0.846 + }, + { + "category_id": 1, + "poly": [ + 297, + 898, + 1406, + 898, + 1406, + 993, + 297, + 993 + ], + "score": 0.839 + }, + { + "category_id": 1, + "poly": [ + 293, + 1361, + 1402, + 1361, + 1402, + 1426, + 293, + 1426 + ], + "score": 0.834 + }, + { + "category_id": 1, + "poly": [ + 298, + 1447, + 1405, + 1447, + 1405, + 1543, + 298, + 1543 + ], + "score": 0.823 + }, + { + "category_id": 1, + "poly": [ + 297, + 1650, + 1407, + 1650, + 1407, + 1746, + 297, + 1746 + ], + "score": 0.823 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 861, + 2088, + 861, + 2113, + 835, + 2113 + ], + "score": 0.819 + }, + { + "category_id": 1, + "poly": [ + 298, + 1275, + 1401, + 1275, + 1401, + 1341, + 298, + 1341 + ], + "score": 0.81 + }, + { + "category_id": 1, + "poly": [ + 289, + 1854, + 1403, + 1854, + 1403, + 1919, + 289, + 1919 + ], + "score": 0.788 + }, + { + "category_id": 1, + "poly": [ + 299, + 1941, + 1404, + 1941, + 1404, + 2035, + 299, + 2035 + ], + "score": 0.752 + }, + { + "category_id": 13, + "poly": [ + 400, + 1221, + 430, + 1221, + 430, + 1252, + 400, + 1252 + ], + "score": 0.7, + "latex": "\\textsuperscript { \\textregistered }" + }, + { + "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, + 867.0, + 2085.0, + 867.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 399.0, + 1407.0, + 399.0, + 1407.0, + 441.0, + 292.0, + 441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 434.0, + 1407.0, + 434.0, + 1407.0, + 467.0, + 323.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 462.0, + 397.0, + 462.0, + 397.0, + 496.0, + 321.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 283.0, + 1407.0, + 283.0, + 1407.0, + 322.0, + 293.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 317.0, + 1404.0, + 317.0, + 1404.0, + 351.0, + 323.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 347.0, + 509.0, + 347.0, + 509.0, + 382.0, + 323.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 634.0, + 1406.0, + 634.0, + 1406.0, + 672.0, + 295.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 665.0, + 1409.0, + 665.0, + 1409.0, + 705.0, + 322.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 696.0, + 977.0, + 696.0, + 977.0, + 734.0, + 321.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 516.0, + 1408.0, + 516.0, + 1408.0, + 558.0, + 294.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 549.0, + 1409.0, + 549.0, + 1409.0, + 587.0, + 321.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 580.0, + 548.0, + 580.0, + 548.0, + 613.0, + 320.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 750.0, + 1404.0, + 750.0, + 1404.0, + 789.0, + 292.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 783.0, + 1404.0, + 783.0, + 1404.0, + 818.0, + 322.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 813.0, + 1409.0, + 813.0, + 1409.0, + 851.0, + 320.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 840.0, + 398.0, + 840.0, + 398.0, + 880.0, + 320.0, + 880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1102.0, + 1405.0, + 1102.0, + 1405.0, + 1138.0, + 295.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1135.0, + 908.0, + 1135.0, + 908.0, + 1166.0, + 323.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1015.0, + 1404.0, + 1015.0, + 1404.0, + 1052.0, + 296.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1047.0, + 894.0, + 1047.0, + 894.0, + 1079.0, + 323.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 228.0, + 544.0, + 228.0, + 544.0, + 265.0, + 322.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1566.0, + 1404.0, + 1566.0, + 1404.0, + 1602.0, + 295.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1597.0, + 1086.0, + 1597.0, + 1086.0, + 1630.0, + 322.0, + 1630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1765.0, + 1408.0, + 1765.0, + 1408.0, + 1806.0, + 294.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1799.0, + 685.0, + 1799.0, + 685.0, + 1832.0, + 323.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1189.0, + 1406.0, + 1189.0, + 1406.0, + 1225.0, + 296.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1219.0, + 399.0, + 1219.0, + 399.0, + 1255.0, + 321.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 1219.0, + 1169.0, + 1219.0, + 1169.0, + 1255.0, + 431.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 899.0, + 414.0, + 899.0, + 414.0, + 931.0, + 296.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 899.0, + 562.0, + 899.0, + 562.0, + 931.0, + 459.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 899.0, + 819.0, + 899.0, + 819.0, + 932.0, + 726.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 900.0, + 990.0, + 900.0, + 990.0, + 932.0, + 862.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 899.0, + 1406.0, + 899.0, + 1406.0, + 933.0, + 1029.0, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 927.0, + 1409.0, + 927.0, + 1409.0, + 967.0, + 319.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 955.0, + 400.0, + 955.0, + 400.0, + 997.0, + 320.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1363.0, + 1404.0, + 1363.0, + 1404.0, + 1399.0, + 295.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1392.0, + 1007.0, + 1392.0, + 1007.0, + 1427.0, + 322.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1448.0, + 1407.0, + 1448.0, + 1407.0, + 1483.0, + 296.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1478.0, + 1403.0, + 1478.0, + 1403.0, + 1515.0, + 322.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1511.0, + 673.0, + 1511.0, + 673.0, + 1544.0, + 322.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1650.0, + 1408.0, + 1650.0, + 1408.0, + 1688.0, + 294.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1682.0, + 1404.0, + 1682.0, + 1404.0, + 1716.0, + 324.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1714.0, + 1090.0, + 1714.0, + 1090.0, + 1748.0, + 324.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1276.0, + 1403.0, + 1276.0, + 1403.0, + 1312.0, + 296.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1307.0, + 1254.0, + 1307.0, + 1254.0, + 1342.0, + 323.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1853.0, + 1402.0, + 1853.0, + 1402.0, + 1889.0, + 295.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1885.0, + 996.0, + 1885.0, + 996.0, + 1920.0, + 321.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1976.0, + 297.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1975.0, + 1404.0, + 1975.0, + 1404.0, + 2005.0, + 323.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1999.0, + 781.0, + 1999.0, + 781.0, + 2038.0, + 322.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 75, + 817, + 75, + 817, + 105, + 299, + 105 + ], + "score": 0.886 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.84 + }, + { + "category_id": 1, + "poly": [ + 291, + 1468, + 1405, + 1468, + 1405, + 1533, + 291, + 1533 + ], + "score": 0.792 + }, + { + "category_id": 1, + "poly": [ + 297, + 1551, + 1402, + 1551, + 1402, + 1646, + 297, + 1646 + ], + "score": 0.771 + }, + { + "category_id": 1, + "poly": [ + 294, + 1354, + 1404, + 1354, + 1404, + 1449, + 294, + 1449 + ], + "score": 0.77 + }, + { + "category_id": 1, + "poly": [ + 299, + 1747, + 1399, + 1747, + 1399, + 1813, + 299, + 1813 + ], + "score": 0.744 + }, + { + "category_id": 1, + "poly": [ + 290, + 1271, + 1405, + 1271, + 1405, + 1338, + 290, + 1338 + ], + "score": 0.721 + }, + { + "category_id": 1, + "poly": [ + 293, + 1665, + 1402, + 1665, + 1402, + 1730, + 293, + 1730 + ], + "score": 0.704 + }, + { + "category_id": 1, + "poly": [ + 300, + 229, + 1401, + 229, + 1401, + 324, + 300, + 324 + ], + "score": 0.693 + }, + { + "category_id": 1, + "poly": [ + 299, + 1158, + 1402, + 1158, + 1402, + 1253, + 299, + 1253 + ], + "score": 0.684 + }, + { + "category_id": 1, + "poly": [ + 299, + 1044, + 1403, + 1044, + 1403, + 1140, + 299, + 1140 + ], + "score": 0.656 + }, + { + "category_id": 1, + "poly": [ + 292, + 425, + 1402, + 425, + 1402, + 490, + 292, + 490 + ], + "score": 0.615 + }, + { + "category_id": 1, + "poly": [ + 295, + 342, + 1400, + 342, + 1400, + 407, + 295, + 407 + ], + "score": 0.613 + }, + { + "category_id": 1, + "poly": [ + 293, + 622, + 1403, + 622, + 1403, + 686, + 293, + 686 + ], + "score": 0.606 + }, + { + "category_id": 1, + "poly": [ + 298, + 704, + 1403, + 704, + 1403, + 800, + 298, + 800 + ], + "score": 0.602 + }, + { + "category_id": 1, + "poly": [ + 297, + 508, + 1400, + 508, + 1400, + 602, + 297, + 602 + ], + "score": 0.575 + }, + { + "category_id": 1, + "poly": [ + 298, + 818, + 1403, + 818, + 1403, + 913, + 298, + 913 + ], + "score": 0.494 + }, + { + "category_id": 1, + "poly": [ + 298, + 931, + 1406, + 931, + 1406, + 1025, + 298, + 1025 + ], + "score": 0.462 + }, + { + "category_id": 13, + "poly": [ + 708, + 1111, + 726, + 1111, + 726, + 1134, + 708, + 1134 + ], + "score": 0.6, + "latex": "\\underline { { \\underline { { \\mathbf { \\Pi } } } } } =" + }, + { + "category_id": 13, + "poly": [ + 468, + 293, + 517, + 293, + 517, + 323, + 468, + 323 + ], + "score": 0.38, + "latex": "( S P )" + }, + { + "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": [ + 290.0, + 1462.0, + 1406.0, + 1462.0, + 1406.0, + 1511.0, + 290.0, + 1511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1498.0, + 503.0, + 1498.0, + 503.0, + 1531.0, + 322.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1552.0, + 1404.0, + 1552.0, + 1404.0, + 1586.0, + 296.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1581.0, + 1404.0, + 1581.0, + 1404.0, + 1618.0, + 322.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1613.0, + 509.0, + 1613.0, + 509.0, + 1648.0, + 322.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1354.0, + 1409.0, + 1354.0, + 1409.0, + 1392.0, + 296.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1384.0, + 1405.0, + 1384.0, + 1405.0, + 1426.0, + 321.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1417.0, + 584.0, + 1417.0, + 584.0, + 1451.0, + 321.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1748.0, + 1404.0, + 1748.0, + 1404.0, + 1784.0, + 295.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1779.0, + 1311.0, + 1779.0, + 1311.0, + 1814.0, + 323.0, + 1814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1268.0, + 1406.0, + 1268.0, + 1406.0, + 1311.0, + 294.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1305.0, + 802.0, + 1305.0, + 802.0, + 1338.0, + 322.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1663.0, + 1405.0, + 1663.0, + 1405.0, + 1703.0, + 293.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1695.0, + 1176.0, + 1695.0, + 1176.0, + 1732.0, + 321.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 230.0, + 1403.0, + 230.0, + 1403.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 258.0, + 1405.0, + 258.0, + 1405.0, + 300.0, + 320.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 292.0, + 467.0, + 292.0, + 467.0, + 326.0, + 324.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 292.0, + 823.0, + 292.0, + 823.0, + 326.0, + 518.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1158.0, + 1404.0, + 1158.0, + 1404.0, + 1195.0, + 294.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1187.0, + 1409.0, + 1187.0, + 1409.0, + 1229.0, + 320.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1223.0, + 564.0, + 1223.0, + 564.0, + 1253.0, + 320.0, + 1253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1044.0, + 1405.0, + 1044.0, + 1405.0, + 1082.0, + 294.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1077.0, + 1404.0, + 1077.0, + 1404.0, + 1112.0, + 323.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1109.0, + 707.0, + 1109.0, + 707.0, + 1143.0, + 326.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 1109.0, + 887.0, + 1109.0, + 887.0, + 1143.0, + 727.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 425.0, + 1404.0, + 425.0, + 1404.0, + 461.0, + 295.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 456.0, + 1199.0, + 456.0, + 1199.0, + 492.0, + 323.0, + 492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 342.0, + 1404.0, + 342.0, + 1404.0, + 380.0, + 295.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 373.0, + 1169.0, + 373.0, + 1169.0, + 408.0, + 322.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 618.0, + 1410.0, + 618.0, + 1410.0, + 662.0, + 292.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 654.0, + 1094.0, + 654.0, + 1094.0, + 686.0, + 325.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 705.0, + 1407.0, + 705.0, + 1407.0, + 740.0, + 296.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 737.0, + 1403.0, + 737.0, + 1403.0, + 772.0, + 323.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 767.0, + 694.0, + 767.0, + 694.0, + 801.0, + 322.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 508.0, + 1405.0, + 508.0, + 1405.0, + 547.0, + 295.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 539.0, + 1404.0, + 539.0, + 1404.0, + 576.0, + 322.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 571.0, + 611.0, + 571.0, + 611.0, + 600.0, + 323.0, + 600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 820.0, + 1404.0, + 820.0, + 1404.0, + 855.0, + 296.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 851.0, + 1405.0, + 851.0, + 1405.0, + 885.0, + 323.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 880.0, + 1312.0, + 880.0, + 1312.0, + 914.0, + 322.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 931.0, + 1406.0, + 931.0, + 1406.0, + 967.0, + 297.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 962.0, + 1404.0, + 962.0, + 1404.0, + 999.0, + 321.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 994.0, + 610.0, + 994.0, + 610.0, + 1025.0, + 322.0, + 1025.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1117, + 1406, + 1117, + 1406, + 1317, + 296, + 1317 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 296, + 856, + 1405, + 856, + 1405, + 1104, + 296, + 1104 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 684, + 1405, + 684, + 1405, + 842, + 298, + 842 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 467, + 1406, + 467, + 1406, + 599, + 297, + 599 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1517, + 1407, + 1517, + 1407, + 1613, + 299, + 1613 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 301, + 1410, + 1403, + 1410, + 1403, + 1504, + 301, + 1504 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 360, + 1636, + 1398, + 1636, + 1398, + 1808, + 360, + 1808 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 538, + 399, + 1158, + 399, + 1158, + 453, + 538, + 453 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 300, + 353, + 696, + 353, + 696, + 387, + 300, + 387 + ], + "score": 0.926 + }, + { + "category_id": 8, + "poly": [ + 706, + 1947, + 993, + 1947, + 993, + 2043, + 706, + 2043 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 299, + 1898, + 748, + 1898, + 748, + 1932, + 299, + 1932 + ], + "score": 0.922 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 817, + 74, + 817, + 106, + 298, + 106 + ], + "score": 0.907 + }, + { + "category_id": 0, + "poly": [ + 303, + 1353, + 786, + 1353, + 786, + 1384, + 303, + 1384 + ], + "score": 0.905 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1980, + 1401, + 1980, + 1401, + 2011, + 1352, + 2011 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 300, + 1840, + 767, + 1840, + 767, + 1873, + 300, + 1873 + ], + "score": 0.886 + }, + { + "category_id": 0, + "poly": [ + 300, + 227, + 509, + 227, + 509, + 261, + 300, + 261 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 863, + 2088, + 863, + 2113, + 835, + 2113 + ], + "score": 0.864 + }, + { + "category_id": 0, + "poly": [ + 299, + 632, + 1158, + 632, + 1158, + 664, + 299, + 664 + ], + "score": 0.812 + }, + { + "category_id": 0, + "poly": [ + 299, + 298, + 1084, + 298, + 1084, + 329, + 299, + 329 + ], + "score": 0.599 + }, + { + "category_id": 1, + "poly": [ + 299, + 298, + 1084, + 298, + 1084, + 329, + 299, + 329 + ], + "score": 0.34 + }, + { + "category_id": 1, + "poly": [ + 299, + 632, + 1158, + 632, + 1158, + 664, + 299, + 664 + ], + "score": 0.101 + }, + { + "category_id": 13, + "poly": [ + 610, + 1681, + 766, + 1681, + 766, + 1716, + 610, + 1716 + ], + "score": 0.95, + "latex": "D _ { f } ( \\nu \\| \\rho ) = 0" + }, + { + "category_id": 13, + "poly": [ + 721, + 1767, + 890, + 1767, + 890, + 1807, + 721, + 1807 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\bar { f } ( u ) = u f \\left( \\frac { 1 } { u } \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 699, + 501, + 816, + 501, + 816, + 534, + 699, + 534 + ], + "score": 0.94, + "latex": "\\nu = \\mu ( x ^ { \\prime } )" + }, + { + "category_id": 13, + "poly": [ + 349, + 950, + 470, + 950, + 470, + 983, + 349, + 983 + ], + "score": 0.93, + "latex": "\\{ 1 , \\ldots , k \\}" + }, + { + "category_id": 13, + "poly": [ + 683, + 919, + 884, + 919, + 884, + 953, + 683, + 953 + ], + "score": 0.93, + "latex": "\\mathcal { V } = \\{ 1 , \\ldots , K \\}" + }, + { + "category_id": 13, + "poly": [ + 1129, + 1767, + 1234, + 1767, + 1234, + 1804, + 1129, + 1804 + ], + "score": 0.93, + "latex": "{ \\bar { f } } ( 1 ) = 0" + }, + { + "category_id": 13, + "poly": [ + 1294, + 1518, + 1398, + 1518, + 1398, + 1551, + 1294, + 1551 + ], + "score": 0.93, + "latex": "f ( 1 ) = 0" + }, + { + "category_id": 13, + "poly": [ + 397, + 1723, + 745, + 1723, + 745, + 1759, + 397, + 1759 + ], + "score": 0.93, + "latex": "D _ { f } ( F _ { * } ( \\nu ) \\| F _ { * } ( \\rho ) ) \\le D _ { f } ( \\nu \\| \\rho )" + }, + { + "category_id": 13, + "poly": [ + 1093, + 1549, + 1292, + 1549, + 1292, + 1583, + 1093, + 1583 + ], + "score": 0.93, + "latex": "x \\mapsto f ( x ) - f ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 1044, + 1724, + 1113, + 1724, + 1113, + 1758, + 1044, + 1758 + ], + "score": 0.93, + "latex": "F _ { * } ( \\rho )" + }, + { + "category_id": 13, + "poly": [ + 571, + 687, + 751, + 687, + 751, + 719, + 571, + 719 + ], + "score": 0.92, + "latex": "H : \\mathcal { X } \\to \\mathcal { P } ( \\mathcal { Y } )" + }, + { + "category_id": 13, + "poly": [ + 493, + 356, + 595, + 356, + 595, + 389, + 493, + 389 + ], + "score": 0.92, + "latex": "\\nu \\in \\mathcal { D } _ { x , \\epsilon }" + }, + { + "category_id": 13, + "poly": [ + 396, + 1769, + 642, + 1769, + 642, + 1808, + 396, + 1808 + ], + "score": 0.92, + "latex": "D _ { f } ( \\nu \\| \\rho ) = D _ { \\bar { f } } ( \\rho \\| \\nu )" + }, + { + "category_id": 13, + "poly": [ + 1063, + 809, + 1362, + 809, + 1362, + 845, + 1063, + 845 + ], + "score": 0.92, + "latex": "H _ { s } ( x ) = \\operatorname { E } _ { X \\sim \\mu ( x ) } [ H ( X ) ]" + }, + { + "category_id": 13, + "poly": [ + 1000, + 503, + 1126, + 503, + 1126, + 535, + 1000, + 535 + ], + "score": 0.92, + "latex": "h _ { s } ( x ^ { \\prime } ) = c" + }, + { + "category_id": 13, + "poly": [ + 737, + 858, + 970, + 858, + 970, + 892, + 737, + 892 + ], + "score": 0.92, + "latex": "p = H _ { s } ( x ) \\in \\mathcal { P } ( \\mathcal { V } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 566, + 423, + 566, + 423, + 599, + 298, + 599 + ], + "score": 0.92, + "latex": "h _ { s } ( x ^ { \\prime } ) = c" + }, + { + "category_id": 13, + "poly": [ + 880, + 535, + 1020, + 535, + 1020, + 569, + 880, + 569 + ], + "score": 0.92, + "latex": "c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}" + }, + { + "category_id": 13, + "poly": [ + 641, + 1010, + 746, + 1010, + 746, + 1044, + 641, + 1044 + ], + "score": 0.92, + "latex": "i \\in [ 1 , k ]" + }, + { + "category_id": 13, + "poly": [ + 1104, + 535, + 1253, + 535, + 1253, + 569, + 1104, + 569 + ], + "score": 0.92, + "latex": "\\mu ( x ^ { \\prime } ) \\in \\mathcal { D } _ { x , \\epsilon }" + }, + { + "category_id": 13, + "poly": [ + 887, + 980, + 1052, + 980, + 1052, + 1013, + 887, + 1013 + ], + "score": 0.92, + "latex": "\\| x - x ^ { \\prime } \\| \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 858, + 1686, + 929, + 1686, + 929, + 1714, + 858, + 1714 + ], + "score": 0.92, + "latex": "\\nu = \\rho" + }, + { + "category_id": 13, + "poly": [ + 1287, + 1252, + 1344, + 1252, + 1344, + 1286, + 1287, + 1286 + ], + "score": 0.92, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 1044, + 1519, + 1187, + 1519, + 1187, + 1551, + 1044, + 1551 + ], + "score": 0.92, + "latex": "f : \\mathbb { R } _ { + } \\to \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 1211, + 778, + 1267, + 778, + 1267, + 809, + 1211, + 809 + ], + "score": 0.91, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 396, + 1680, + 552, + 1680, + 552, + 1716, + 396, + 1716 + ], + "score": 0.91, + "latex": "D _ { f } ( \\rho \\| \\rho ) = 0" + }, + { + "category_id": 13, + "poly": [ + 1339, + 687, + 1403, + 687, + 1403, + 719, + 1339, + 719 + ], + "score": 0.91, + "latex": "H ( x )" + }, + { + "category_id": 13, + "poly": [ + 637, + 568, + 775, + 568, + 775, + 599, + 637, + 599 + ], + "score": 0.91, + "latex": "d ( x , x ^ { \\prime } ) \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 411, + 1284, + 465, + 1284, + 465, + 1317, + 411, + 1317 + ], + "score": 0.91, + "latex": "\\mathcal { D } _ { x , \\epsilon }" + }, + { + "category_id": 13, + "poly": [ + 600, + 1251, + 1029, + 1251, + 1029, + 1286, + 600, + 1286 + ], + "score": 0.91, + "latex": "\\phi _ { c ^ { \\prime } } ( z ) = H ( z ) _ { c } - H ( z ) _ { c ^ { \\prime } } - \\gamma , c ^ { \\prime } \\neq c" + }, + { + "category_id": 13, + "poly": [ + 799, + 1012, + 968, + 1012, + 968, + 1043, + 799, + 1043 + ], + "score": 0.91, + "latex": "j \\in [ k + 1 , K ]" + }, + { + "category_id": 13, + "poly": [ + 520, + 1043, + 576, + 1043, + 576, + 1074, + 520, + 1074 + ], + "score": 0.91, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1010, + 594, + 1010, + 594, + 1045, + 298, + 1045 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\phi _ { i , j } ( \\bar { z } ) = H ( z ) _ { i } - \\bar { H } ( z ) _ { j } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 567, + 536, + 804, + 536, + 804, + 568, + 567, + 568 + ], + "score": 0.9, + "latex": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 1312, + 1012, + 1358, + 1012, + 1358, + 1045, + 1312, + 1045 + ], + "score": 0.9, + "latex": "\\phi _ { i , j }" + }, + { + "category_id": 13, + "poly": [ + 1161, + 1042, + 1231, + 1042, + 1231, + 1070, + 1161, + 1070 + ], + "score": 0.9, + "latex": "k = 1" + }, + { + "category_id": 13, + "poly": [ + 759, + 1581, + 798, + 1581, + 798, + 1614, + 759, + 1614 + ], + "score": 0.9, + "latex": "D _ { f }" + }, + { + "category_id": 13, + "poly": [ + 830, + 1044, + 884, + 1044, + 884, + 1075, + 830, + 1075 + ], + "score": 0.9, + "latex": "\\mathcal { D } _ { x , \\epsilon }" + }, + { + "category_id": 13, + "poly": [ + 980, + 1222, + 1205, + 1222, + 1205, + 1254, + 980, + 1254 + ], + "score": 0.9, + "latex": "c = \\arg \\operatorname* { m a x } _ { y \\in \\mathcal { y } } p _ { y }" + }, + { + "category_id": 13, + "poly": [ + 1094, + 920, + 1365, + 920, + 1365, + 952, + 1094, + 952 + ], + "score": 0.9, + "latex": "p _ { 1 } \\ge p _ { 2 } \\ge \\cdots \\ge p _ { K }" + }, + { + "category_id": 14, + "poly": [ + 537, + 402, + 1159, + 402, + 1159, + 452, + 537, + 452 + ], + "score": 0.9, + "latex": "\\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] = \\operatorname * { \\mathbb { P } } _ { X \\sim \\nu } [ h ( X ) = c ] - \\operatorname { \\mathbb { P } } _ { X \\sim \\nu } [ h ( X ) = c ^ { \\prime } ] ~ ." + }, + { + "category_id": 13, + "poly": [ + 986, + 890, + 1024, + 890, + 1024, + 919, + 986, + 919 + ], + "score": 0.89, + "latex": "H _ { s }" + }, + { + "category_id": 13, + "poly": [ + 440, + 469, + 738, + 469, + 738, + 503, + 440, + 503 + ], + "score": 0.89, + "latex": "\\begin{array} { r l r } { \\operatorname { E } _ { X \\sim \\nu } [ \\phi _ { c , c ^ { \\prime } } ( X ) ] } & { { } \\geq } & { 0 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 396, + 1637, + 554, + 1637, + 554, + 1674, + 396, + 1674 + ], + "score": 0.89, + "latex": "D _ { f } ( \\nu \\| \\rho ) \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 646, + 1153, + 684, + 1153, + 684, + 1184, + 646, + 1184 + ], + "score": 0.89, + "latex": "H _ { s }" + }, + { + "category_id": 13, + "poly": [ + 860, + 468, + 1087, + 468, + 1087, + 503, + 860, + 503 + ], + "score": 0.88, + "latex": "c ^ { \\prime } \\in \\mathcal { V } \\setminus \\{ c \\}" + }, + { + "category_id": 13, + "poly": [ + 410, + 1581, + 430, + 1581, + 430, + 1612, + 410, + 1612 + ], + "score": 0.87, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 754, + 1413, + 773, + 1413, + 773, + 1444, + 754, + 1444 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 607, + 1581, + 626, + 1581, + 626, + 1612, + 607, + 1612 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 501, + 567, + 526, + 567, + 526, + 593, + 501, + 593 + ], + "score": 0.86, + "latex": "x ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 459, + 1520, + 479, + 1520, + 479, + 1551, + 459, + 1551 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 791, + 981, + 819, + 981, + 819, + 1008, + 791, + 1008 + ], + "score": 0.86, + "latex": "x ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 342, + 503, + 641, + 503, + 641, + 537, + 342, + 537 + ], + "score": 0.86, + "latex": "\\mathrm { m a x } _ { y \\in \\mathcal { Y } } \\mathbb { P } _ { X \\sim \\nu } [ h ( X ) = y ]" + }, + { + "category_id": 13, + "poly": [ + 1045, + 1684, + 1065, + 1684, + 1065, + 1714, + 1045, + 1714 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 935, + 1726, + 959, + 1726, + 959, + 1752, + 935, + 1752 + ], + "score": 0.84, + "latex": "F" + }, + { + "category_id": 13, + "poly": [ + 547, + 1148, + 568, + 1148, + 568, + 1181, + 547, + 1181 + ], + "score": 0.83, + "latex": "\\tilde { h }" + }, + { + "category_id": 13, + "poly": [ + 567, + 1213, + 587, + 1213, + 587, + 1246, + 567, + 1246 + ], + "score": 0.83, + "latex": "\\tilde { h }" + }, + { + "category_id": 13, + "poly": [ + 630, + 720, + 655, + 720, + 655, + 748, + 630, + 748 + ], + "score": 0.82, + "latex": "\\mathcal { V }" + }, + { + "category_id": 13, + "poly": [ + 1330, + 472, + 1403, + 472, + 1403, + 502, + 1330, + 502 + ], + "score": 0.82, + "latex": "c \\in" + }, + { + "category_id": 13, + "poly": [ + 1017, + 1189, + 1037, + 1189, + 1037, + 1216, + 1017, + 1216 + ], + "score": 0.82, + "latex": "\\gamma" + }, + { + "category_id": 13, + "poly": [ + 1370, + 1731, + 1387, + 1731, + 1387, + 1757, + 1370, + 1757 + ], + "score": 0.81, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 733, + 956, + 751, + 956, + 751, + 977, + 733, + 977 + ], + "score": 0.8, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 605, + 951, + 625, + 951, + 625, + 978, + 605, + 978 + ], + "score": 0.79, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 713, + 720, + 741, + 720, + 741, + 746, + 713, + 746 + ], + "score": 0.78, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 1210, + 952, + 1230, + 952, + 1230, + 978, + 1210, + 978 + ], + "score": 0.77, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 733, + 987, + 753, + 987, + 753, + 1008, + 733, + 1008 + ], + "score": 0.77, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 326, + 1257, + 345, + 1257, + 345, + 1280, + 326, + 1280 + ], + "score": 0.76, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 959, + 694, + 978, + 694, + 978, + 714, + 959, + 714 + ], + "score": 0.76, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 1061, + 894, + 1080, + 894, + 1080, + 916, + 1061, + 916 + ], + "score": 0.76, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 343, + 864, + 363, + 864, + 363, + 886, + 343, + 886 + ], + "score": 0.75, + "latex": "x" + }, + { + "category_id": 14, + "poly": [ + 717, + 1945, + 992, + 1945, + 992, + 2045, + 717, + 2045 + ], + "score": 0.64, + "latex": "\\begin{array} { r } { \\underset { x ^ { \\prime } } { \\operatorname* { m a x } } R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) } \\\\ { \\mathrm { s u b j e c t ~ t o ~ } \\| x - x ^ { \\prime } \\| _ { p } \\leq \\epsilon } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 824, + 2003, + 990, + 2003, + 990, + 2043, + 824, + 2043 + ], + "score": 0.59, + "latex": "\\| x - x ^ { \\prime } \\| _ { p } \\leq \\epsilon" + }, + { + "category_id": 14, + "poly": [ + 738, + 1947, + 990, + 1947, + 990, + 1996, + 738, + 1996 + ], + "score": 0.39, + "latex": "\\operatorname* { m a x } _ { x ^ { \\prime } } R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) )" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 817.0, + 72.0, + 817.0, + 109.0, + 295.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1352.0, + 788.0, + 1352.0, + 788.0, + 1388.0, + 297.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1840.0, + 771.0, + 1840.0, + 771.0, + 1876.0, + 295.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 222.0, + 513.0, + 222.0, + 513.0, + 268.0, + 295.0, + 268.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, + 630.0, + 1161.0, + 630.0, + 1161.0, + 669.0, + 295.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 297.0, + 1087.0, + 297.0, + 1087.0, + 332.0, + 296.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1115.0, + 1404.0, + 1115.0, + 1404.0, + 1153.0, + 295.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1150.0, + 546.0, + 1150.0, + 546.0, + 1188.0, + 294.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1150.0, + 645.0, + 1150.0, + 645.0, + 1188.0, + 569.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 1150.0, + 1404.0, + 1150.0, + 1404.0, + 1188.0, + 685.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1182.0, + 1016.0, + 1182.0, + 1016.0, + 1220.0, + 294.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1182.0, + 1408.0, + 1182.0, + 1408.0, + 1220.0, + 1038.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1214.0, + 566.0, + 1214.0, + 566.0, + 1259.0, + 291.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1214.0, + 979.0, + 1214.0, + 979.0, + 1259.0, + 588.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1214.0, + 1406.0, + 1214.0, + 1406.0, + 1259.0, + 1206.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1250.0, + 325.0, + 1250.0, + 325.0, + 1288.0, + 294.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 1250.0, + 599.0, + 1250.0, + 599.0, + 1288.0, + 346.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 1250.0, + 1286.0, + 1250.0, + 1286.0, + 1288.0, + 1030.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 1250.0, + 1404.0, + 1250.0, + 1404.0, + 1288.0, + 1345.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1283.0, + 410.0, + 1283.0, + 410.0, + 1321.0, + 294.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1283.0, + 477.0, + 1283.0, + 477.0, + 1321.0, + 466.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 857.0, + 342.0, + 857.0, + 342.0, + 894.0, + 293.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 857.0, + 736.0, + 857.0, + 736.0, + 894.0, + 364.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 857.0, + 1408.0, + 857.0, + 1408.0, + 894.0, + 971.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 888.0, + 985.0, + 888.0, + 985.0, + 922.0, + 294.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 888.0, + 1060.0, + 888.0, + 1060.0, + 922.0, + 1025.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 888.0, + 1406.0, + 888.0, + 1406.0, + 922.0, + 1081.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 916.0, + 682.0, + 916.0, + 682.0, + 957.0, + 291.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 916.0, + 1093.0, + 916.0, + 1093.0, + 957.0, + 885.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 916.0, + 1407.0, + 916.0, + 1407.0, + 957.0, + 1366.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 946.0, + 348.0, + 946.0, + 348.0, + 985.0, + 293.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 946.0, + 604.0, + 946.0, + 604.0, + 985.0, + 471.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 946.0, + 732.0, + 946.0, + 732.0, + 985.0, + 626.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 946.0, + 1209.0, + 946.0, + 1209.0, + 985.0, + 752.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 946.0, + 1407.0, + 946.0, + 1407.0, + 985.0, + 1231.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 979.0, + 732.0, + 979.0, + 732.0, + 1016.0, + 294.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 979.0, + 790.0, + 979.0, + 790.0, + 1016.0, + 754.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 979.0, + 886.0, + 979.0, + 886.0, + 1016.0, + 820.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 979.0, + 1405.0, + 979.0, + 1405.0, + 1016.0, + 1053.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1008.0, + 297.0, + 1008.0, + 297.0, + 1049.0, + 293.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 1008.0, + 640.0, + 1008.0, + 640.0, + 1049.0, + 595.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1008.0, + 798.0, + 1008.0, + 798.0, + 1049.0, + 747.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 1008.0, + 1311.0, + 1008.0, + 1311.0, + 1049.0, + 969.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1359.0, + 1008.0, + 1407.0, + 1008.0, + 1407.0, + 1049.0, + 1359.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1039.0, + 519.0, + 1039.0, + 519.0, + 1077.0, + 293.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 1039.0, + 829.0, + 1039.0, + 829.0, + 1077.0, + 577.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1039.0, + 1160.0, + 1039.0, + 1160.0, + 1077.0, + 885.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 1039.0, + 1406.0, + 1039.0, + 1406.0, + 1077.0, + 1232.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1069.0, + 1264.0, + 1069.0, + 1264.0, + 1106.0, + 293.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 682.0, + 570.0, + 682.0, + 570.0, + 723.0, + 295.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 682.0, + 958.0, + 682.0, + 958.0, + 723.0, + 752.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 979.0, + 682.0, + 1338.0, + 682.0, + 1338.0, + 723.0, + 979.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 716.0, + 629.0, + 716.0, + 629.0, + 754.0, + 295.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 716.0, + 712.0, + 716.0, + 712.0, + 754.0, + 656.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 716.0, + 1406.0, + 716.0, + 1406.0, + 754.0, + 742.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 748.0, + 1405.0, + 748.0, + 1405.0, + 782.0, + 295.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 775.0, + 1210.0, + 775.0, + 1210.0, + 815.0, + 292.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 775.0, + 1410.0, + 775.0, + 1410.0, + 815.0, + 1268.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 806.0, + 1062.0, + 806.0, + 1062.0, + 848.0, + 292.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1363.0, + 806.0, + 1375.0, + 806.0, + 1375.0, + 848.0, + 1363.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 462.0, + 439.0, + 462.0, + 439.0, + 510.0, + 291.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 462.0, + 859.0, + 462.0, + 859.0, + 510.0, + 739.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 462.0, + 1329.0, + 462.0, + 1329.0, + 510.0, + 1088.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 462.0, + 1409.0, + 462.0, + 1409.0, + 510.0, + 1404.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 500.0, + 341.0, + 500.0, + 341.0, + 535.0, + 292.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 500.0, + 698.0, + 500.0, + 698.0, + 535.0, + 642.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 817.0, + 500.0, + 999.0, + 500.0, + 999.0, + 535.0, + 817.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 500.0, + 1406.0, + 500.0, + 1406.0, + 535.0, + 1127.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 533.0, + 566.0, + 533.0, + 566.0, + 570.0, + 294.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 533.0, + 879.0, + 533.0, + 879.0, + 570.0, + 805.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 533.0, + 1103.0, + 533.0, + 1103.0, + 570.0, + 1021.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 533.0, + 1408.0, + 533.0, + 1408.0, + 570.0, + 1254.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 562.0, + 297.0, + 562.0, + 297.0, + 601.0, + 294.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 562.0, + 500.0, + 562.0, + 500.0, + 601.0, + 424.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 527.0, + 562.0, + 636.0, + 562.0, + 636.0, + 601.0, + 527.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 562.0, + 1265.0, + 562.0, + 1265.0, + 601.0, + 776.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1517.0, + 458.0, + 1517.0, + 458.0, + 1553.0, + 293.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 1517.0, + 1043.0, + 1517.0, + 1043.0, + 1553.0, + 480.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1517.0, + 1293.0, + 1517.0, + 1293.0, + 1553.0, + 1188.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1517.0, + 1409.0, + 1517.0, + 1409.0, + 1553.0, + 1399.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1548.0, + 1092.0, + 1548.0, + 1092.0, + 1585.0, + 294.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1293.0, + 1548.0, + 1404.0, + 1548.0, + 1404.0, + 1585.0, + 1293.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1576.0, + 409.0, + 1576.0, + 409.0, + 1618.0, + 293.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 1576.0, + 606.0, + 1576.0, + 606.0, + 1618.0, + 431.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1576.0, + 758.0, + 1576.0, + 758.0, + 1618.0, + 627.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 1576.0, + 1059.0, + 1576.0, + 1059.0, + 1618.0, + 799.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1410.0, + 753.0, + 1410.0, + 753.0, + 1447.0, + 295.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1410.0, + 1404.0, + 1410.0, + 1404.0, + 1447.0, + 774.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1441.0, + 1405.0, + 1441.0, + 1405.0, + 1474.0, + 295.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1472.0, + 1100.0, + 1472.0, + 1100.0, + 1506.0, + 296.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1635.0, + 395.0, + 1635.0, + 395.0, + 1673.0, + 361.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 555.0, + 1635.0, + 564.0, + 1635.0, + 564.0, + 1673.0, + 555.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 1676.0, + 395.0, + 1676.0, + 395.0, + 1720.0, + 357.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 1676.0, + 609.0, + 1676.0, + 609.0, + 1720.0, + 553.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 1676.0, + 857.0, + 1676.0, + 857.0, + 1720.0, + 767.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 1676.0, + 1044.0, + 1676.0, + 1044.0, + 1720.0, + 930.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 1676.0, + 1318.0, + 1676.0, + 1318.0, + 1720.0, + 1066.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 1721.0, + 396.0, + 1721.0, + 396.0, + 1762.0, + 357.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1721.0, + 934.0, + 1721.0, + 934.0, + 1762.0, + 746.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 1721.0, + 1043.0, + 1721.0, + 1043.0, + 1762.0, + 960.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1721.0, + 1369.0, + 1721.0, + 1369.0, + 1762.0, + 1114.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1388.0, + 1721.0, + 1398.0, + 1721.0, + 1398.0, + 1762.0, + 1388.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 1767.0, + 395.0, + 1767.0, + 395.0, + 1809.0, + 357.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.0, + 1767.0, + 720.0, + 1767.0, + 720.0, + 1809.0, + 643.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 1767.0, + 1128.0, + 1767.0, + 1128.0, + 1809.0, + 891.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1235.0, + 1767.0, + 1246.0, + 1767.0, + 1246.0, + 1809.0, + 1235.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 349.0, + 492.0, + 349.0, + 492.0, + 393.0, + 294.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 349.0, + 697.0, + 349.0, + 697.0, + 393.0, + 596.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1893.0, + 751.0, + 1893.0, + 751.0, + 1938.0, + 295.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 297.0, + 1087.0, + 297.0, + 1087.0, + 332.0, + 296.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 630.0, + 1161.0, + 630.0, + 1161.0, + 669.0, + 295.0, + 669.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1941, + 1403, + 1941, + 1403, + 2036, + 298, + 2036 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1388, + 1403, + 1388, + 1403, + 1482, + 298, + 1482 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 416, + 1492, + 1284, + 1492, + 1284, + 1924, + 416, + 1924 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 298, + 1160, + 1405, + 1160, + 1405, + 1254, + 298, + 1254 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 554, + 1263, + 1143, + 1263, + 1143, + 1374, + 554, + 1374 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 298, + 923, + 1402, + 923, + 1402, + 990, + 298, + 990 + ], + "score": 0.955 + }, + { + "category_id": 8, + "poly": [ + 485, + 413, + 1215, + 413, + 1215, + 504, + 485, + 504 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 296, + 766, + 1403, + 766, + 1403, + 832, + 296, + 832 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 295, + 688, + 1399, + 688, + 1399, + 753, + 295, + 753 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 297, + 518, + 1399, + 518, + 1399, + 588, + 297, + 588 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 734, + 280, + 965, + 280, + 965, + 350, + 734, + 350 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 498, + 605, + 1204, + 605, + 1204, + 673, + 498, + 673 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 296, + 1006, + 1401, + 1006, + 1401, + 1076, + 296, + 1076 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 297, + 364, + 811, + 364, + 811, + 398, + 297, + 398 + ], + "score": 0.936 + }, + { + "category_id": 8, + "poly": [ + 357, + 1088, + 1339, + 1088, + 1339, + 1145, + 357, + 1145 + ], + "score": 0.93 + }, + { + "category_id": 0, + "poly": [ + 299, + 866, + 636, + 866, + 636, + 898, + 299, + 898 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 295, + 225, + 1345, + 225, + 1345, + 267, + 295, + 267 + ], + "score": 0.926 + }, + { + "category_id": 2, + "poly": [ + 297, + 73, + 818, + 73, + 818, + 106, + 297, + 106 + ], + "score": 0.921 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1303, + 1400, + 1303, + 1400, + 1335, + 1351, + 1335 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 864, + 2087, + 864, + 2113, + 835, + 2113 + ], + "score": 0.871 + }, + { + "category_id": 14, + "poly": [ + 416, + 1489, + 1285, + 1489, + 1285, + 1931, + 416, + 1931 + ], + "score": 0.95, + "latex": "\\begin{array} { l } { \\displaystyle \\operatorname* { m i n } _ { r > 0 } \\ \\operatorname { E } _ { \\gamma \\to 0 } \\big [ r ( X ) \\phi ( X ) \\big ] + \\sum _ { i } \\lambda _ { i } \\bigg ( \\underbrace { \\mathrm { F } _ { \\mathrm { f } } \\left[ f _ { i } ( r ( X ) ) \\right] - \\epsilon } _ { X \\sim \\rho } \\bigg ) + \\kappa \\bigg ( 1 - \\underbrace { \\mathrm { F } _ { \\mathrm { c } } \\left[ r ( X ) \\right] } _ { X \\sim \\rho } \\bigg ) } \\\\ { = \\displaystyle \\operatorname* { m i n } _ { r \\ge 0 } \\ \\mathrm { E } _ { r \\to 0 } \\bigg [ r ( X ) \\phi ( X ) + \\sum _ { i } \\lambda _ { i } f _ { i } ( r ( X ) ) - \\kappa r ( X ) \\bigg ] + \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { F } } _ { X \\sim \\rho } \\bigg [ \\operatorname* { m a x } _ { r \\to 0 } \\kappa r - r \\phi ( X ) - \\sum _ { i } \\lambda _ { i } f _ { i } ( r ) \\bigg ] } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { ~ E } } _ { X \\sim \\rho } \\bigg [ \\operatorname* { m a x } _ { r \\to 0 } \\big ( r ( \\kappa - \\phi ( X ) ) - f _ { \\lambda } ( r ) \\big ) \\bigg ] } \\\\ { = \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\underbrace { \\mathrm { ~ E } } _ { X \\sim \\rho } \\bigg [ r \\xi ( \\kappa - \\phi ( X ) ) \\big ] \\ . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1192, + 1002, + 1346, + 1002, + 1346, + 1050, + 1192, + 1050 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { r ( X ) = \\frac { \\nu ( X ) } { \\rho ( X ) } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 486, + 410, + 1218, + 410, + 1218, + 505, + 486, + 505 + ], + "score": 0.94, + "latex": "\\operatorname* { m a x } _ { x ^ { \\prime } \\colon | x _ { i } ^ { \\prime } - x _ { i } | \\leq \\epsilon } \\sum _ { i } R _ { \\alpha } ( \\mu _ { i } ( x _ { i } ^ { \\prime } ) \\| \\mu _ { i } ( x _ { i } ) ) + \\gamma \\left( \\sum _ { i } | x _ { i } ^ { \\prime } - x _ { i } | ^ { p } - \\epsilon ^ { p } \\right) \\ ." + }, + { + "category_id": 13, + "poly": [ + 843, + 519, + 1007, + 519, + 1007, + 559, + 843, + 559 + ], + "score": 0.94, + "latex": "\\| x ^ { \\prime } - x \\| _ { p } \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 533, + 519, + 684, + 519, + 684, + 555, + 533, + 555 + ], + "score": 0.94, + "latex": "| x _ { i } ^ { \\prime } - x _ { i } | \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 832, + 955, + 938, + 955, + 938, + 989, + 832, + 989 + ], + "score": 0.93, + "latex": "\\rho ( x ) > 0" + }, + { + "category_id": 13, + "poly": [ + 990, + 1161, + 1218, + 1161, + 1218, + 1196, + 990, + 1196 + ], + "score": 0.93, + "latex": "\\nu ( X ) = \\rho ( X ) r ( X )" + }, + { + "category_id": 13, + "poly": [ + 1055, + 955, + 1161, + 955, + 1161, + 989, + 1055, + 989 + ], + "score": 0.93, + "latex": "\\nu ( x ) > 0" + }, + { + "category_id": 13, + "poly": [ + 603, + 955, + 721, + 955, + 721, + 989, + 603, + 989 + ], + "score": 0.93, + "latex": "\\nu ( x ) , \\rho ( x )" + }, + { + "category_id": 13, + "poly": [ + 463, + 228, + 952, + 228, + 952, + 266, + 463, + 266 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { R _ { \\alpha } ( \\mu ( { x ^ { \\prime } } ) \\| \\mu ( x ) ) = \\sum _ { i } R _ { \\alpha } ( \\mu _ { i } ( { x _ { i } ^ { \\prime } } ) \\| \\mu _ { i } ( x _ { i } ) ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 552, + 1260, + 1143, + 1260, + 1143, + 1376, + 552, + 1376 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\underset { r \\geq 0 } { \\mathrm { m i n } } \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) \\phi ( X ) ] \\qquad } \\\\ { \\mathrm { s u b j e c t ~ t o } \\underset { X \\sim \\rho } { \\mathrm { E } } [ f _ { i } ( r ( X ) ) ] \\leq \\epsilon _ { i } , \\quad \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) ] = 1 \\ , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1196, + 1943, + 1297, + 1943, + 1297, + 1974, + 1196, + 1974 + ], + "score": 0.91, + "latex": "\\lambda \\geq 0 , \\kappa" + }, + { + "category_id": 14, + "poly": [ + 494, + 602, + 1208, + 602, + 1208, + 675, + 494, + 675 + ], + "score": 0.91, + "latex": "- \\gamma \\epsilon ^ { p } + \\sum _ { i } \\operatorname* { m a x } _ { x _ { i } ^ { \\prime } \\in [ x _ { i } - \\epsilon , x _ { i } + \\epsilon ] } R _ { \\alpha } ( \\mu _ { i } ( x _ { i } ^ { \\prime } ) \\| \\mu _ { i } ( x _ { i } ) ) + \\gamma | x _ { i } ^ { \\prime } - x _ { i } | ^ { p } ." + }, + { + "category_id": 13, + "poly": [ + 576, + 691, + 645, + 691, + 645, + 723, + 576, + 723 + ], + "score": 0.9, + "latex": "\\gamma \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 373, + 1392, + 445, + 1392, + 445, + 1421, + 373, + 1421 + ], + "score": 0.9, + "latex": "r \\geq 0" + }, + { + "category_id": 14, + "poly": [ + 363, + 1089, + 1336, + 1089, + 1336, + 1145, + 363, + 1145 + ], + "score": 0.89, + "latex": "\\operatorname { \\mathrm { ~ \\underset { X \\sim \\nu } { E } ~ } } [ \\phi ( X ) ] = \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ r ( X ) \\phi ( X ) ] ~ , \\quad D _ { f _ { i } } ( \\rho | | \\nu ) = \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ f _ { i } ( r ( X ) ) ] ~ , \\quad \\operatorname { \\mathrm { ~ \\underset { X \\sim \\rho } { E } ~ } } [ r ( X ) ] = 1 ~ ," + }, + { + "category_id": 14, + "poly": [ + 732, + 279, + 966, + 279, + 966, + 352, + 732, + 352 + ], + "score": 0.89, + "latex": "\\sum _ { i } | x _ { i } - x _ { i } ^ { \\prime } | ^ { P } \\leq \\epsilon ^ { p }" + }, + { + "category_id": 13, + "poly": [ + 298, + 723, + 367, + 723, + 367, + 753, + 298, + 753 + ], + "score": 0.89, + "latex": "\\gamma \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 564, + 770, + 591, + 770, + 591, + 802, + 564, + 802 + ], + "score": 0.89, + "latex": "\\boldsymbol { x } _ { i } ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 355, + 557, + 383, + 557, + 383, + 590, + 355, + 590 + ], + "score": 0.88, + "latex": "\\boldsymbol { x } _ { i } ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 595, + 1389, + 822, + 1389, + 822, + 1424, + 595, + 1424 + ], + "score": 0.88, + "latex": "r ( x ) \\geq 0 \\quad \\forall x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 1357, + 931, + 1401, + 931, + 1401, + 957, + 1357, + 957 + ], + "score": 0.86, + "latex": "\\nu , \\rho" + }, + { + "category_id": 13, + "poly": [ + 600, + 1198, + 619, + 1198, + 619, + 1220, + 600, + 1220 + ], + "score": 0.78, + "latex": "\\nu" + }, + { + "category_id": 13, + "poly": [ + 1098, + 1398, + 1115, + 1398, + 1115, + 1418, + 1098, + 1418 + ], + "score": 0.77, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 1382, + 1199, + 1401, + 1199, + 1401, + 1219, + 1382, + 1219 + ], + "score": 0.74, + "latex": "\\nu" + }, + { + "category_id": 13, + "poly": [ + 696, + 771, + 709, + 771, + 709, + 795, + 696, + 795 + ], + "score": 0.72, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1385, + 1428, + 1401, + 1428, + 1401, + 1447, + 1385, + 1447 + ], + "score": 0.68, + "latex": "r" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 866.0, + 640.0, + 866.0, + 640.0, + 902.0, + 297.0, + 902.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": [ + 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, + 1941.0, + 1195.0, + 1941.0, + 1195.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1298.0, + 1941.0, + 1405.0, + 1941.0, + 1405.0, + 1979.0, + 1298.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1970.0, + 1407.0, + 1970.0, + 1407.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 1404.0, + 2002.0, + 1404.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1386.0, + 372.0, + 1386.0, + 372.0, + 1425.0, + 292.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 1386.0, + 594.0, + 1386.0, + 594.0, + 1425.0, + 446.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1386.0, + 1097.0, + 1386.0, + 1097.0, + 1425.0, + 823.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 1386.0, + 1405.0, + 1386.0, + 1405.0, + 1425.0, + 1116.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1420.0, + 1384.0, + 1420.0, + 1384.0, + 1454.0, + 294.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1420.0, + 1407.0, + 1420.0, + 1407.0, + 1454.0, + 1402.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1452.0, + 402.0, + 1452.0, + 402.0, + 1484.0, + 293.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1162.0, + 989.0, + 1162.0, + 989.0, + 1196.0, + 296.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 1162.0, + 1405.0, + 1162.0, + 1405.0, + 1196.0, + 1219.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1191.0, + 599.0, + 1191.0, + 599.0, + 1226.0, + 293.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 1191.0, + 1381.0, + 1191.0, + 1381.0, + 1226.0, + 620.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1191.0, + 1405.0, + 1191.0, + 1405.0, + 1226.0, + 1402.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1221.0, + 513.0, + 1221.0, + 513.0, + 1256.0, + 295.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 916.0, + 1356.0, + 916.0, + 1356.0, + 966.0, + 291.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 916.0, + 1408.0, + 916.0, + 1408.0, + 966.0, + 1402.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 953.0, + 602.0, + 953.0, + 602.0, + 989.0, + 294.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 722.0, + 953.0, + 831.0, + 953.0, + 831.0, + 989.0, + 722.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 953.0, + 1054.0, + 953.0, + 1054.0, + 989.0, + 939.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 953.0, + 1172.0, + 953.0, + 1172.0, + 989.0, + 1162.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 765.0, + 563.0, + 765.0, + 563.0, + 802.0, + 295.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 765.0, + 695.0, + 765.0, + 695.0, + 802.0, + 592.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 765.0, + 1404.0, + 765.0, + 1404.0, + 802.0, + 710.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 798.0, + 891.0, + 798.0, + 891.0, + 833.0, + 295.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 687.0, + 575.0, + 687.0, + 575.0, + 727.0, + 294.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 687.0, + 1405.0, + 687.0, + 1405.0, + 727.0, + 646.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 721.0, + 297.0, + 721.0, + 297.0, + 754.0, + 294.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 721.0, + 689.0, + 721.0, + 689.0, + 754.0, + 368.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 514.0, + 532.0, + 514.0, + 532.0, + 558.0, + 292.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 514.0, + 842.0, + 514.0, + 842.0, + 558.0, + 685.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1008.0, + 514.0, + 1405.0, + 514.0, + 1405.0, + 558.0, + 1008.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 553.0, + 354.0, + 553.0, + 354.0, + 592.0, + 295.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 553.0, + 492.0, + 553.0, + 492.0, + 592.0, + 384.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 988.0, + 1191.0, + 988.0, + 1191.0, + 1065.0, + 294.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 988.0, + 1416.0, + 988.0, + 1416.0, + 1065.0, + 1347.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1039.0, + 360.0, + 1039.0, + 360.0, + 1081.0, + 291.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 364.0, + 813.0, + 364.0, + 813.0, + 401.0, + 296.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 225.0, + 462.0, + 225.0, + 462.0, + 268.0, + 293.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 225.0, + 1347.0, + 225.0, + 1347.0, + 268.0, + 953.0, + 268.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1582, + 1406, + 1582, + 1406, + 1739, + 296, + 1739 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 1405, + 228, + 1405, + 354, + 298, + 354 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1129, + 1406, + 1129, + 1406, + 1217, + 297, + 1217 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 518, + 1890, + 1178, + 1890, + 1178, + 2027, + 518, + 2027 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 580, + 1047, + 1118, + 1047, + 1118, + 1122, + 580, + 1122 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 326, + 704, + 1379, + 704, + 1379, + 1001, + 326, + 1001 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 295, + 1291, + 1400, + 1291, + 1400, + 1355, + 295, + 1355 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 297, + 366, + 996, + 366, + 996, + 401, + 297, + 401 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 297, + 1820, + 1402, + 1820, + 1402, + 1884, + 297, + 1884 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 297, + 492, + 1404, + 492, + 1404, + 551, + 297, + 551 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 300, + 665, + 793, + 665, + 793, + 699, + 300, + 699 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 816, + 74, + 816, + 105, + 299, + 105 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 299, + 1006, + 1401, + 1006, + 1401, + 1040, + 299, + 1040 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 864, + 2087, + 864, + 2113, + 835, + 2113 + ], + "score": 0.863 + }, + { + "category_id": 8, + "poly": [ + 493, + 550, + 1201, + 550, + 1201, + 612, + 493, + 612 + ], + "score": 0.789 + }, + { + "category_id": 8, + "poly": [ + 597, + 1364, + 1103, + 1364, + 1103, + 1497, + 597, + 1497 + ], + "score": 0.777 + }, + { + "category_id": 0, + "poly": [ + 299, + 1768, + 1171, + 1768, + 1171, + 1802, + 299, + 1802 + ], + "score": 0.776 + }, + { + "category_id": 8, + "poly": [ + 298, + 617, + 1223, + 617, + 1223, + 656, + 298, + 656 + ], + "score": 0.728 + }, + { + "category_id": 0, + "poly": [ + 300, + 435, + 638, + 435, + 638, + 467, + 300, + 467 + ], + "score": 0.708 + }, + { + "category_id": 0, + "poly": [ + 298, + 1527, + 1227, + 1527, + 1227, + 1560, + 298, + 1560 + ], + "score": 0.591 + }, + { + "category_id": 0, + "poly": [ + 301, + 435, + 639, + 435, + 639, + 467, + 301, + 467 + ], + "score": 0.496 + }, + { + "category_id": 8, + "poly": [ + 668, + 1213, + 1032, + 1213, + 1032, + 1287, + 668, + 1287 + ], + "score": 0.407 + }, + { + "category_id": 1, + "poly": [ + 298, + 1527, + 1227, + 1527, + 1227, + 1560, + 298, + 1560 + ], + "score": 0.4 + }, + { + "category_id": 8, + "poly": [ + 597, + 1363, + 821, + 1363, + 821, + 1414, + 597, + 1414 + ], + "score": 0.204 + }, + { + "category_id": 1, + "poly": [ + 298, + 617, + 1223, + 617, + 1223, + 656, + 298, + 656 + ], + "score": 0.168 + }, + { + "category_id": 1, + "poly": [ + 299, + 1768, + 1171, + 1768, + 1171, + 1802, + 299, + 1802 + ], + "score": 0.16 + }, + { + "category_id": 1, + "poly": [ + 597, + 1364, + 1103, + 1364, + 1103, + 1497, + 597, + 1497 + ], + "score": 0.097 + }, + { + "category_id": 14, + "poly": [ + 321, + 703, + 1382, + 703, + 1382, + 1005, + 321, + 1005 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\underset { \\lambda \\geq 0 , \\kappa } { \\mathrm { m a x ~ m i n } } \\kappa - \\displaystyle \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\theta _ { a } \\Bigg ( ( \\kappa - 1 ) \\gamma _ { a } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { a } ) \\Bigg ) - \\theta _ { b } \\Bigg ( ( \\kappa + 1 ) \\gamma _ { b } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { b } ) \\Bigg ) } \\\\ & { \\quad \\quad \\quad \\quad \\quad - \\theta _ { c } \\Bigg ( \\kappa \\gamma _ { c } - \\sum _ { i } \\lambda _ { i } f _ { i } ( \\gamma _ { a } ) \\Bigg ) } \\\\ & { = \\underset { \\gamma \\geq 0 } { \\mathrm { m i n } } \\underset { \\lambda \\geq 0 , \\kappa } { \\mathrm { m a x } } \\kappa \\big ( 1 - \\theta _ { a } \\gamma _ { a } - \\theta _ { b } \\gamma _ { b } - \\theta _ { c } \\gamma _ { c } \\big ) + \\displaystyle \\sum _ { i } \\lambda _ { i } \\Bigg ( \\displaystyle \\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) - \\epsilon _ { i } \\Bigg ) + \\theta _ { a } \\gamma _ { a } - \\theta _ { b } \\gamma _ { b } \\ , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 662, + 1208, + 1034, + 1208, + 1034, + 1289, + 662, + 1289 + ], + "score": 0.93, + "latex": "\\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) = D _ { f _ { i } } ( \\zeta \\| \\theta ) ." + }, + { + "category_id": 14, + "poly": [ + 517, + 1888, + 1180, + 1888, + 1180, + 2029, + 517, + 2029 + ], + "score": 0.93, + "latex": "\\begin{array} { r l r } & { } & { f _ { \\lambda } ^ { * } ( u ) = \\underset { v \\geq 0 } { \\operatorname* { m a x } } \\left( u v - \\lambda \\operatorname* { m a x } ( v - \\beta , 0 ) \\right) + \\lambda \\operatorname* { m a x } ( 1 - \\beta , 0 ) } \\\\ & { } & { \\quad = \\left\\{ \\begin{array} { l l } { \\operatorname* { m a x } ( \\beta u , 0 ) + \\lambda \\operatorname* { m a x } ( 1 - \\beta , 0 ) \\quad } & { \\mathrm { ~ i f ~ } u \\leq \\lambda \\mathrm { ~ , ~ } } \\\\ { \\infty \\quad } & { \\mathrm { ~ i f ~ } u > \\lambda \\mathrm { ~ . ~ } } \\end{array} \\right. } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 338, + 1160, + 479, + 1160, + 479, + 1194, + 338, + 1194 + ], + "score": 0.93, + "latex": "y \\in \\{ a , b , c \\}" + }, + { + "category_id": 13, + "poly": [ + 443, + 1823, + 897, + 1823, + 897, + 1857, + 443, + 1857 + ], + "score": 0.93, + "latex": "f ( u ) = \\mathrm { m a x } ( u - \\beta , 0 ) - \\mathrm { m a x } ( 1 - \\beta , 0 )" + }, + { + "category_id": 13, + "poly": [ + 1215, + 1162, + 1352, + 1162, + 1352, + 1194, + 1215, + 1194 + ], + "score": 0.93, + "latex": "\\{ + 1 , 0 , - 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 848, + 1292, + 1015, + 1292, + 1015, + 1327, + 848, + 1327 + ], + "score": 0.93, + "latex": "D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1179, + 1823, + 1284, + 1823, + 1284, + 1857, + 1179, + 1857 + ], + "score": 0.92, + "latex": "f ( 1 ) = 0" + }, + { + "category_id": 13, + "poly": [ + 405, + 260, + 528, + 260, + 528, + 296, + 405, + 296 + ], + "score": 0.92, + "latex": "\\textstyle \\sum _ { i } \\lambda _ { i } = 1" + }, + { + "category_id": 14, + "poly": [ + 393, + 543, + 1226, + 543, + 1226, + 659, + 393, + 659 + ], + "score": 0.91, + "latex": "\\begin{array} { r l r } { { \\stackrel { \\mathrm { m a x } } { = } } } & { \\displaystyle \\operatorname* { m a x } _ { \\kappa , \\lambda \\geq 0 } \\kappa - \\sum _ { i } \\lambda _ { i } \\epsilon _ { i } - \\theta _ { a } f _ { \\lambda } ^ { * } \\big ( \\kappa - 1 \\big ) - \\theta _ { b } f _ { \\lambda } ^ { * } \\big ( \\kappa + 1 \\big ) - \\theta _ { c } f _ { \\lambda } ^ { * } \\big ( \\kappa \\big ) \\ , } \\\\ & { } & \\\\ & { \\displaystyle _ { \\imath } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = + 1 ] , \\theta _ { b } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = - 1 ] , \\theta _ { c } = \\mathbb { P } _ { X \\sim \\rho } [ \\phi ( X ) = 0 ] . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 578, + 1045, + 1118, + 1045, + 1118, + 1124, + 578, + 1124 + ], + "score": 0.91, + "latex": "\\sum _ { y \\in \\{ a , b , c \\} } \\gamma _ { y } \\theta _ { y } = 1 , \\quad \\sum _ { y \\in \\{ a , b , c \\} } \\theta _ { y } f _ { i } ( \\gamma _ { y } ) \\leq \\epsilon _ { i } ." + }, + { + "category_id": 13, + "poly": [ + 1097, + 1130, + 1221, + 1130, + 1221, + 1162, + 1097, + 1162 + ], + "score": 0.91, + "latex": "\\zeta = \\theta \\odot \\gamma" + }, + { + "category_id": 13, + "poly": [ + 298, + 1707, + 415, + 1707, + 415, + 1737, + 298, + 1737 + ], + "score": 0.91, + "latex": "\\alpha 1 , \\infty" + }, + { + "category_id": 13, + "poly": [ + 1277, + 1130, + 1400, + 1130, + 1400, + 1163, + 1277, + 1163 + ], + "score": 0.9, + "latex": "\\zeta _ { y } = \\theta _ { y } \\gamma _ { y }" + }, + { + "category_id": 13, + "poly": [ + 613, + 1615, + 696, + 1615, + 696, + 1643, + 613, + 1643 + ], + "score": 0.9, + "latex": "M = 1" + }, + { + "category_id": 13, + "poly": [ + 1331, + 230, + 1402, + 230, + 1402, + 261, + 1331, + 261 + ], + "score": 0.9, + "latex": "\\lambda \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 636, + 668, + 667, + 668, + 667, + 698, + 636, + 698 + ], + "score": 0.89, + "latex": "f ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1206, + 495, + 1253, + 495, + 1253, + 524, + 1206, + 524 + ], + "score": 0.89, + "latex": "\\kappa , \\lambda" + }, + { + "category_id": 13, + "poly": [ + 751, + 496, + 771, + 496, + 771, + 525, + 751, + 525 + ], + "score": 0.86, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 824, + 1162, + 842, + 1162, + 842, + 1192, + 824, + 1192 + ], + "score": 0.84, + "latex": "\\zeta" + }, + { + "category_id": 13, + "poly": [ + 425, + 1324, + 441, + 1324, + 441, + 1354, + 425, + 1354 + ], + "score": 0.83, + "latex": "\\zeta" + }, + { + "category_id": 14, + "poly": [ + 597, + 1361, + 820, + 1361, + 820, + 1414, + 597, + 1414 + ], + "score": 0.81, + "latex": "\\operatorname* { m i n } _ { \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } \\geq 0 } \\quad \\zeta _ { a } - \\zeta _ { b }" + }, + { + "category_id": 13, + "poly": [ + 721, + 297, + 741, + 297, + 741, + 319, + 721, + 319 + ], + "score": 0.77, + "latex": "\\kappa" + }, + { + "category_id": 13, + "poly": [ + 764, + 263, + 783, + 263, + 783, + 289, + 764, + 289 + ], + "score": 0.75, + "latex": "\\lambda" + }, + { + "category_id": 14, + "poly": [ + 595, + 1359, + 1098, + 1359, + 1098, + 1499, + 595, + 1499 + ], + "score": 0.71, + "latex": "\\begin{array} { r c l } { \\displaystyle \\operatorname* { m i n } _ { \\zeta _ { a } , \\zeta _ { b } , \\zeta _ { c } \\geq 0 } } & { \\zeta _ { a } - \\zeta _ { b } } \\\\ { \\mathrm { s u b j e c t ~ t o } D _ { f _ { i } } ( \\zeta \\| \\theta ) \\leq \\epsilon _ { i } } & { i = 1 , \\ldots , M } \\\\ { \\displaystyle \\zeta _ { a } + \\zeta _ { b } + \\zeta _ { c } = 1 } & { . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 730, + 1458, + 939, + 1458, + 939, + 1494, + 730, + 1494 + ], + "score": 0.46, + "latex": "\\zeta _ { a } + \\zeta _ { b } + \\zeta _ { c } = 1" + }, + { + "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, + 868.0, + 2085.0, + 868.0, + 2124.0, + 831.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1768.0, + 1173.0, + 1768.0, + 1173.0, + 1804.0, + 297.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 432.0, + 642.0, + 432.0, + 642.0, + 472.0, + 295.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1528.0, + 1228.0, + 1528.0, + 1228.0, + 1560.0, + 296.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 435.0, + 640.0, + 435.0, + 640.0, + 471.0, + 296.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1584.0, + 1403.0, + 1584.0, + 1403.0, + 1618.0, + 295.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1614.0, + 612.0, + 1614.0, + 612.0, + 1647.0, + 295.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 1614.0, + 1403.0, + 1614.0, + 1403.0, + 1647.0, + 697.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1643.0, + 1406.0, + 1643.0, + 1406.0, + 1679.0, + 291.0, + 1679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1670.0, + 1407.0, + 1670.0, + 1407.0, + 1714.0, + 291.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1705.0, + 297.0, + 1705.0, + 297.0, + 1742.0, + 293.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 1705.0, + 574.0, + 1705.0, + 574.0, + 1742.0, + 416.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 231.0, + 1330.0, + 231.0, + 1330.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 231.0, + 1407.0, + 231.0, + 1407.0, + 264.0, + 1403.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 260.0, + 404.0, + 260.0, + 404.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 260.0, + 763.0, + 260.0, + 763.0, + 297.0, + 529.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 260.0, + 1406.0, + 260.0, + 1406.0, + 297.0, + 784.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 291.0, + 720.0, + 291.0, + 720.0, + 327.0, + 293.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 291.0, + 1406.0, + 291.0, + 1406.0, + 327.0, + 742.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 324.0, + 518.0, + 324.0, + 518.0, + 355.0, + 297.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1120.0, + 1096.0, + 1120.0, + 1096.0, + 1171.0, + 291.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1222.0, + 1120.0, + 1276.0, + 1120.0, + 1276.0, + 1171.0, + 1222.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1120.0, + 1407.0, + 1120.0, + 1407.0, + 1171.0, + 1401.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1159.0, + 337.0, + 1159.0, + 337.0, + 1195.0, + 294.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 1159.0, + 823.0, + 1159.0, + 823.0, + 1195.0, + 480.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 843.0, + 1159.0, + 1214.0, + 1159.0, + 1214.0, + 1195.0, + 843.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 1159.0, + 1406.0, + 1159.0, + 1406.0, + 1195.0, + 1353.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1187.0, + 440.0, + 1187.0, + 440.0, + 1225.0, + 293.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1288.0, + 847.0, + 1288.0, + 847.0, + 1332.0, + 291.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 1288.0, + 1406.0, + 1288.0, + 1406.0, + 1332.0, + 1016.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1323.0, + 424.0, + 1323.0, + 424.0, + 1355.0, + 295.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 442.0, + 1323.0, + 568.0, + 1323.0, + 568.0, + 1355.0, + 442.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 364.0, + 997.0, + 364.0, + 997.0, + 406.0, + 293.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1816.0, + 442.0, + 1816.0, + 442.0, + 1862.0, + 291.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 1816.0, + 1178.0, + 1816.0, + 1178.0, + 1862.0, + 898.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 1816.0, + 1406.0, + 1816.0, + 1406.0, + 1862.0, + 1285.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1852.0, + 359.0, + 1852.0, + 359.0, + 1888.0, + 292.0, + 1888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 489.0, + 750.0, + 489.0, + 750.0, + 529.0, + 294.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 489.0, + 1205.0, + 489.0, + 1205.0, + 529.0, + 772.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 489.0, + 1402.0, + 489.0, + 1402.0, + 529.0, + 1254.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 525.0, + 414.0, + 525.0, + 414.0, + 558.0, + 294.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 663.0, + 635.0, + 663.0, + 635.0, + 703.0, + 296.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 663.0, + 794.0, + 663.0, + 794.0, + 703.0, + 668.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1003.0, + 1403.0, + 1003.0, + 1403.0, + 1043.0, + 295.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1528.0, + 1228.0, + 1528.0, + 1228.0, + 1560.0, + 296.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 611.0, + 392.0, + 611.0, + 392.0, + 662.0, + 293.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1768.0, + 1173.0, + 1768.0, + 1173.0, + 1804.0, + 297.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 1419.0, + 1102.0, + 1419.0, + 1102.0, + 1455.0, + 1099.0, + 1455.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 296, + 222, + 1408, + 222, + 1408, + 532, + 296, + 532 + ], + "score": 0.982, + "html": "
Divergence constraintf(u)Certificate
KL divergenceKL(νllρ)≤∈κLulog(u)∈KL≤-log(1-(√θa-√6)²)
Rényi divergences (α ≥ 0)Ra(vllp)≤∈r,αsign(a - 1)(uα - 1)∈R,a≤-log(1-0a-0b+2n)n=((1-+(1-a)()2
Infinite Renyi divergenceRo(vllp)≤∈R,∞∈R,∞≤-log(1-(0a-0b))
Hockey-stick divergences (β ≥ 0)DHS,β(vllp)≤HS,β[u- β]+-[1-β]+€Hs,β≤β(0a-06)-1β-112土
" + }, + { + "category_id": 1, + "poly": [ + 296, + 1190, + 1407, + 1190, + 1407, + 1315, + 296, + 1315 + ], + "score": 0.975 + }, + { + "category_id": 8, + "poly": [ + 629, + 958, + 1065, + 958, + 1065, + 1070, + 629, + 1070 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 644, + 1318, + 1057, + 1318, + 1057, + 1427, + 644, + 1427 + ], + "score": 0.959 + }, + { + "category_id": 8, + "poly": [ + 618, + 1835, + 1076, + 1835, + 1076, + 1913, + 618, + 1913 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 510, + 1522, + 1184, + 1522, + 1184, + 1636, + 510, + 1636 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 289, + 1438, + 1403, + 1438, + 1403, + 1504, + 289, + 1504 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 628, + 1968, + 1066, + 1968, + 1066, + 2045, + 628, + 2045 + ], + "score": 0.955 + }, + { + "category_id": 8, + "poly": [ + 628, + 1697, + 1061, + 1697, + 1061, + 1774, + 628, + 1774 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 572, + 818, + 1125, + 818, + 1125, + 892, + 572, + 892 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 299, + 742, + 1399, + 742, + 1399, + 807, + 299, + 807 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 296, + 1788, + 914, + 1788, + 914, + 1822, + 296, + 1822 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 297, + 906, + 738, + 906, + 738, + 938, + 297, + 938 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 299, + 1651, + 777, + 1651, + 777, + 1684, + 299, + 1684 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 297, + 1926, + 683, + 1926, + 683, + 1958, + 297, + 1958 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 295, + 1086, + 1157, + 1086, + 1157, + 1120, + 295, + 1120 + ], + "score": 0.928 + }, + { + "category_id": 8, + "poly": [ + 387, + 1133, + 1307, + 1133, + 1307, + 1177, + 387, + 1177 + ], + "score": 0.923 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 816, + 74, + 816, + 106, + 298, + 106 + ], + "score": 0.911 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 864, + 2088, + 864, + 2113, + 835, + 2113 + ], + "score": 0.864 + }, + { + "category_id": 6, + "poly": [ + 295, + 551, + 1408, + 551, + 1408, + 684, + 295, + 684 + ], + "score": 0.483 + }, + { + "category_id": 1, + "poly": [ + 295, + 551, + 1408, + 551, + 1408, + 684, + 295, + 684 + ], + "score": 0.37 + }, + { + "category_id": 14, + "poly": [ + 617, + 1835, + 1082, + 1835, + 1082, + 1913, + 617, + 1913 + ], + "score": 0.94, + "latex": "\\epsilon \\le \\operatorname* { m a x } \\biggl ( \\frac { \\beta ( - 1 + ( \\theta _ { a } - \\theta _ { b } ) ) + 1 } { 2 } , 0 \\biggr ) ." + }, + { + "category_id": 14, + "poly": [ + 629, + 1697, + 1071, + 1697, + 1071, + 1775, + 629, + 1775 + ], + "score": 0.94, + "latex": "\\epsilon \\le \\operatorname* { m a x } \\left( \\frac { \\beta ( 1 + ( \\theta _ { a } - \\theta _ { b } ) ) - 1 } { 2 } , 0 \\right) \\ ." + }, + { + "category_id": 14, + "poly": [ + 630, + 1968, + 1070, + 1968, + 1070, + 2045, + 630, + 2045 + ], + "score": 0.93, + "latex": "\\epsilon \\leq \\operatorname* { m a x } \\mathopen { } \\mathclose \\bgroup \\left( \\frac { \\beta ( \\theta _ { a } - \\theta _ { b } ) - | \\beta - 1 | } { 2 } , 0 \\aftergroup \\egroup \\right) ~ ." + }, + { + "category_id": 14, + "poly": [ + 629, + 956, + 1066, + 956, + 1066, + 1070, + 629, + 1070 + ], + "score": 0.93, + "latex": "\\phi ( X ) = \\left\\{ \\begin{array} { l l } { { + 1 } } & { { \\quad \\mathrm { w . p . ~ } \\theta _ { a } ~ , } } \\\\ { { - 1 } } & { { \\quad \\mathrm { w . p . ~ } \\theta _ { b } ~ , } } \\\\ { { 0 } } & { { \\quad \\mathrm { w . p . ~ } 1 - \\theta _ { a } - \\theta _ { b } ~ . } } \\end{array} \\right." + }, + { + "category_id": 14, + "poly": [ + 509, + 1520, + 1184, + 1520, + 1184, + 1636, + 509, + 1636 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\left\\{ \\begin{array} { l l } { - 1 } & { \\mathrm { i f } \\epsilon \\geq \\beta ( 1 - \\theta _ { b } ) , } \\\\ { \\beta ( 1 - \\theta _ { b } ) - \\epsilon - 1 } & { \\mathrm { i f } \\beta \\theta _ { a } \\leq \\epsilon \\leq \\beta ( 1 - \\theta _ { b } ) , } \\\\ { \\beta ( 1 + ( \\theta _ { a } - \\theta _ { b } ) ) - 2 \\epsilon - 1 } & { \\mathrm { i f } \\epsilon \\leq \\beta \\theta _ { a } . } \\end{array} \\right. , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 642, + 1315, + 1053, + 1315, + 1053, + 1428, + 642, + 1428 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\left\\{ \\begin{array} { l l } { \\beta ( 1 - \\theta _ { b } ) - \\epsilon \\quad } & { \\mathrm { i f ~ 0 \\leq \\lambda < 1 ~ } , } \\\\ { \\beta \\theta _ { a } - \\epsilon \\quad } & { \\mathrm { i f ~ 1 < \\lambda < 2 ~ } , } \\\\ { - \\epsilon \\quad } & { \\mathrm { i f ~ } \\lambda > 2 . } \\end{array} \\right. } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 991, + 581, + 1398, + 581, + 1398, + 621, + 991, + 621 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { R _ { \\alpha } ( \\nu \\| \\rho ) = \\frac { \\breve { 1 } } { \\alpha - 1 } \\log ( 1 + D _ { f } ( \\nu \\| \\rho \\breve { ) } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 389, + 1441, + 482, + 1441, + 482, + 1472, + 389, + 1472 + ], + "score": 0.92, + "latex": "\\epsilon \\leq \\beta \\theta _ { a }" + }, + { + "category_id": 13, + "poly": [ + 1112, + 650, + 1316, + 650, + 1316, + 686, + 1112, + 686 + ], + "score": 0.92, + "latex": "[ u ] _ { + } = \\operatorname* { m a x } ( u , 0 )" + }, + { + "category_id": 13, + "poly": [ + 849, + 1440, + 1090, + 1440, + 1090, + 1474, + 849, + 1474 + ], + "score": 0.92, + "latex": "\\beta \\theta _ { a } \\le \\epsilon \\le \\beta ( 1 - \\theta _ { b } )" + }, + { + "category_id": 13, + "poly": [ + 1158, + 1192, + 1290, + 1192, + 1290, + 1223, + 1158, + 1223 + ], + "score": 0.91, + "latex": "\\kappa \\leq \\lambda - 1" + }, + { + "category_id": 13, + "poly": [ + 787, + 618, + 1026, + 618, + 1026, + 653, + 787, + 653 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\log ( \\nu ( x ) / \\rho ( x ) ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 721, + 229, + 776, + 229, + 776, + 259, + 721, + 259 + ], + "score": 0.91, + "latex": "f ( u )" + }, + { + "category_id": 13, + "poly": [ + 990, + 265, + 1387, + 265, + 1387, + 315, + 990, + 315 + ], + "score": 0.91, + "latex": "\\epsilon _ { K L } \\leq - \\log \\left( 1 - \\left( \\sqrt { \\theta _ { a } } - \\sqrt { \\theta _ { b } } \\right) ^ { 2 } \\right)" + }, + { + "category_id": 13, + "poly": [ + 401, + 1790, + 472, + 1790, + 472, + 1821, + 401, + 1821 + ], + "score": 0.9, + "latex": "\\beta \\geq 1" + }, + { + "category_id": 14, + "poly": [ + 571, + 816, + 1122, + 816, + 1122, + 893, + 571, + 893 + ], + "score": 0.9, + "latex": "\\operatorname* { m a x } _ { \\kappa \\in \\mathbb { R } , \\lambda \\geq 0 } \\left( \\kappa - \\operatorname { \\mathrm { ~ E ~ } } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ] \\right) - \\lambda \\epsilon \\geq 0 \\mathrm { ~ , ~ }" + }, + { + "category_id": 13, + "poly": [ + 609, + 1192, + 821, + 1192, + 821, + 1226, + 609, + 1226 + ], + "score": 0.9, + "latex": "[ u ] _ { + } = \\operatorname* { m a x } ( u , 0 )" + }, + { + "category_id": 13, + "poly": [ + 638, + 1089, + 669, + 1089, + 669, + 1120, + 638, + 1120 + ], + "score": 0.9, + "latex": "f ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 990, + 317, + 1357, + 317, + 1357, + 348, + 990, + 348 + ], + "score": 0.89, + "latex": "\\epsilon _ { R , \\alpha } \\leq - \\log ( 1 - \\theta _ { a } - \\theta _ { b } + 2 \\eta )" + }, + { + "category_id": 13, + "poly": [ + 431, + 1227, + 484, + 1227, + 484, + 1253, + 431, + 1253 + ], + "score": 0.89, + "latex": "- \\infty" + }, + { + "category_id": 13, + "poly": [ + 989, + 351, + 1316, + 351, + 1316, + 413, + 989, + 413 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { \\underline { { \\eta } } = \\left( \\frac { \\underline { { \\theta _ { a } } } ^ { ( 1 - \\alpha ) } + \\theta _ { b } ^ { ( 1 - \\alpha ) } } { 2 } \\right) ^ { \\left( \\frac { 1 } { 1 - \\alpha } \\right) } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 989, + 426, + 1323, + 426, + 1323, + 458, + 989, + 458 + ], + "score": 0.89, + "latex": "\\epsilon _ { R , \\infty } \\leq - \\log ( 1 - ( \\theta _ { a } - \\theta _ { b } ) )" + }, + { + "category_id": 14, + "poly": [ + 391, + 1132, + 1307, + 1132, + 1307, + 1177, + 391, + 1177 + ], + "score": 0.88, + "latex": "\\kappa - \\beta \\big ( \\theta _ { a } [ \\kappa - 1 ] _ { + } + \\theta _ { b } [ \\kappa + 1 ] _ { + } + ( 1 - \\theta _ { a } - \\theta _ { b } ) [ \\kappa ] _ { + } \\big ) - \\lambda ( \\epsilon + \\operatorname* { m a x } ( 1 - \\beta , 0 ) ) ~ ," + }, + { + "category_id": 13, + "poly": [ + 989, + 473, + 1279, + 473, + 1279, + 526, + 989, + 526 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\epsilon _ { \\mathrm { H S } , \\beta } \\leq \\left[ \\frac { \\beta ( \\theta _ { a } - \\theta _ { b } ) - | \\beta - 1 | } { 2 } \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 879, + 652, + 908, + 652, + 908, + 680, + 879, + 680 + ], + "score": 0.87, + "latex": "\\theta _ { a }" + }, + { + "category_id": 13, + "poly": [ + 636, + 1225, + 707, + 1225, + 707, + 1255, + 636, + 1255 + ], + "score": 0.86, + "latex": "\\beta \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 298, + 653, + 389, + 653, + 389, + 677, + 298, + 677 + ], + "score": 0.86, + "latex": "\\alpha \\to \\infty" + }, + { + "category_id": 13, + "poly": [ + 721, + 276, + 815, + 276, + 815, + 305, + 721, + 305 + ], + "score": 0.86, + "latex": "u \\log ( u )" + }, + { + "category_id": 13, + "poly": [ + 683, + 1256, + 749, + 1256, + 749, + 1283, + 683, + 1283 + ], + "score": 0.86, + "latex": "\\lambda - 1" + }, + { + "category_id": 13, + "poly": [ + 958, + 652, + 985, + 652, + 985, + 680, + 958, + 680 + ], + "score": 0.85, + "latex": "\\theta _ { b }" + }, + { + "category_id": 13, + "poly": [ + 607, + 585, + 627, + 585, + 627, + 616, + 607, + 616 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 720, + 478, + 957, + 478, + 957, + 520, + 720, + 520 + ], + "score": 0.85, + "latex": "\\left[ u - \\beta \\right] _ { + } - \\left[ 1 - \\beta \\right] _ { + }" + }, + { + "category_id": 13, + "poly": [ + 645, + 555, + 663, + 555, + 663, + 585, + 645, + 585 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 316, + 436, + 522, + 436, + 522, + 471, + 316, + 471 + ], + "score": 0.82, + "latex": "\\underline { { R _ { \\infty } ( \\nu \\| \\rho ) } } \\overset { < } { \\le } \\epsilon _ { R , \\infty }" + }, + { + "category_id": 13, + "poly": [ + 412, + 1286, + 431, + 1286, + 431, + 1311, + 412, + 1311 + ], + "score": 0.82, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 530, + 331, + 608, + 331, + 608, + 360, + 530, + 360 + ], + "score": 0.81, + "latex": "( \\alpha \\ge 0 )" + }, + { + "category_id": 13, + "poly": [ + 453, + 1260, + 473, + 1260, + 473, + 1281, + 453, + 1281 + ], + "score": 0.81, + "latex": "\\kappa" + }, + { + "category_id": 13, + "poly": [ + 315, + 360, + 508, + 360, + 508, + 395, + 315, + 395 + ], + "score": 0.76, + "latex": "R _ { \\alpha } ( \\nu \\| \\rho ) \\le \\epsilon _ { R , \\alpha }" + }, + { + "category_id": 13, + "poly": [ + 1210, + 1230, + 1229, + 1230, + 1229, + 1251, + 1210, + 1251 + ], + "score": 0.76, + "latex": "\\kappa" + }, + { + "category_id": 13, + "poly": [ + 606, + 466, + 684, + 466, + 684, + 496, + 606, + 496 + ], + "score": 0.7, + "latex": "\\overline { { \\mathcal { B } \\geq 0 } } )" + }, + { + "category_id": 13, + "poly": [ + 315, + 495, + 556, + 495, + 556, + 531, + 315, + 531 + ], + "score": 0.69, + "latex": "\\underline { { D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho ) \\le \\epsilon _ { \\mathrm { H S } , \\beta } } }" + }, + { + "category_id": 13, + "poly": [ + 719, + 351, + 959, + 351, + 959, + 380, + 719, + 380 + ], + "score": 0.61, + "latex": "\\mathrm { s i g n } ( \\alpha - 1 ) ( u ^ { \\alpha } - 1 )" + }, + { + "category_id": 13, + "poly": [ + 315, + 284, + 509, + 284, + 509, + 319, + 315, + 319 + ], + "score": 0.59, + "latex": "\\begin{array} { r } { \\underline { { \\operatorname { K L } ( \\nu \\| \\rho ) } } \\leq \\epsilon _ { K L } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 718, + 435, + 738, + 435, + 738, + 454, + 718, + 454 + ], + "score": 0.44, + "latex": "-" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 109.0, + 296.0, + 109.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, + 550.0, + 644.0, + 550.0, + 644.0, + 590.0, + 293.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 550.0, + 1405.0, + 550.0, + 1405.0, + 590.0, + 664.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 580.0, + 606.0, + 580.0, + 606.0, + 626.0, + 292.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 580.0, + 990.0, + 580.0, + 990.0, + 626.0, + 628.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 580.0, + 1410.0, + 580.0, + 1410.0, + 626.0, + 1399.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 619.0, + 786.0, + 619.0, + 786.0, + 656.0, + 294.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 619.0, + 1406.0, + 619.0, + 1406.0, + 656.0, + 1027.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 649.0, + 297.0, + 649.0, + 297.0, + 687.0, + 293.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 649.0, + 878.0, + 649.0, + 878.0, + 687.0, + 390.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 649.0, + 957.0, + 649.0, + 957.0, + 687.0, + 909.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 649.0, + 1111.0, + 649.0, + 1111.0, + 687.0, + 986.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1317.0, + 649.0, + 1327.0, + 649.0, + 1327.0, + 687.0, + 1317.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1192.0, + 608.0, + 1192.0, + 608.0, + 1228.0, + 294.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 1192.0, + 1157.0, + 1192.0, + 1157.0, + 1228.0, + 822.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 1192.0, + 1407.0, + 1192.0, + 1407.0, + 1228.0, + 1291.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1223.0, + 430.0, + 1223.0, + 430.0, + 1256.0, + 296.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 485.0, + 1223.0, + 635.0, + 1223.0, + 635.0, + 1256.0, + 485.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1223.0, + 1209.0, + 1223.0, + 1209.0, + 1256.0, + 708.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 1223.0, + 1405.0, + 1223.0, + 1405.0, + 1256.0, + 1230.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1254.0, + 452.0, + 1254.0, + 452.0, + 1286.0, + 294.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 474.0, + 1254.0, + 682.0, + 1254.0, + 682.0, + 1286.0, + 474.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 1254.0, + 1405.0, + 1254.0, + 1405.0, + 1286.0, + 750.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1285.0, + 411.0, + 1285.0, + 411.0, + 1318.0, + 292.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 1285.0, + 475.0, + 1285.0, + 475.0, + 1318.0, + 432.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1437.0, + 388.0, + 1437.0, + 388.0, + 1477.0, + 293.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1437.0, + 848.0, + 1437.0, + 848.0, + 1477.0, + 483.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 1437.0, + 1407.0, + 1437.0, + 1407.0, + 1477.0, + 1091.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1467.0, + 990.0, + 1467.0, + 990.0, + 1506.0, + 292.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 742.0, + 1404.0, + 742.0, + 1404.0, + 778.0, + 295.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 774.0, + 569.0, + 774.0, + 569.0, + 807.0, + 295.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1782.0, + 400.0, + 1782.0, + 400.0, + 1828.0, + 293.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 473.0, + 1782.0, + 913.0, + 1782.0, + 913.0, + 1828.0, + 473.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 906.0, + 740.0, + 906.0, + 740.0, + 939.0, + 295.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1645.0, + 781.0, + 1645.0, + 781.0, + 1689.0, + 293.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1922.0, + 684.0, + 1922.0, + 684.0, + 1961.0, + 294.0, + 1961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1083.0, + 637.0, + 1083.0, + 637.0, + 1124.0, + 293.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 1083.0, + 1159.0, + 1083.0, + 1159.0, + 1124.0, + 670.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 550.0, + 644.0, + 550.0, + 644.0, + 590.0, + 293.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 550.0, + 1405.0, + 550.0, + 1405.0, + 590.0, + 664.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 580.0, + 606.0, + 580.0, + 606.0, + 626.0, + 292.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 580.0, + 990.0, + 580.0, + 990.0, + 626.0, + 628.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 580.0, + 1410.0, + 580.0, + 1410.0, + 626.0, + 1399.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 619.0, + 786.0, + 619.0, + 786.0, + 656.0, + 294.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 619.0, + 1406.0, + 619.0, + 1406.0, + 656.0, + 1027.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 649.0, + 297.0, + 649.0, + 297.0, + 687.0, + 293.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 649.0, + 878.0, + 649.0, + 878.0, + 687.0, + 390.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 649.0, + 957.0, + 649.0, + 957.0, + 687.0, + 909.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 649.0, + 1111.0, + 649.0, + 1111.0, + 687.0, + 986.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1317.0, + 649.0, + 1327.0, + 649.0, + 1327.0, + 687.0, + 1317.0, + 687.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 437, + 422, + 1261, + 422, + 1261, + 596, + 437, + 596 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 731, + 1470, + 969, + 1470, + 969, + 1552, + 731, + 1552 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 671, + 929, + 1026, + 929, + 1026, + 1018, + 671, + 1018 + ], + "score": 0.959 + }, + { + "category_id": 8, + "poly": [ + 706, + 1075, + 984, + 1075, + 984, + 1149, + 706, + 1149 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 741, + 1208, + 954, + 1208, + 954, + 1285, + 741, + 1285 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 288, + 1767, + 1405, + 1767, + 1405, + 1835, + 288, + 1835 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 472, + 1606, + 1224, + 1606, + 1224, + 1693, + 472, + 1693 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 297, + 608, + 1404, + 608, + 1404, + 678, + 297, + 678 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 583, + 798, + 1114, + 798, + 1114, + 867, + 583, + 867 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 298, + 346, + 1407, + 346, + 1407, + 411, + 298, + 411 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 663, + 1999, + 1037, + 1999, + 1037, + 2040, + 663, + 2040 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 493, + 1340, + 1194, + 1340, + 1194, + 1403, + 493, + 1403 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 300, + 881, + 1101, + 881, + 1101, + 915, + 300, + 915 + ], + "score": 0.94 + }, + { + "category_id": 8, + "poly": [ + 381, + 1848, + 1303, + 1848, + 1303, + 1938, + 381, + 1938 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 298, + 1704, + 735, + 1704, + 735, + 1737, + 298, + 1737 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 296, + 1564, + 654, + 1564, + 654, + 1596, + 296, + 1596 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 297, + 1295, + 614, + 1295, + 614, + 1327, + 297, + 1327 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 297, + 1028, + 712, + 1028, + 712, + 1059, + 297, + 1059 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 295, + 1160, + 911, + 1160, + 911, + 1194, + 295, + 1194 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 296, + 1952, + 732, + 1952, + 732, + 1987, + 296, + 1987 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 296, + 1419, + 1138, + 1419, + 1138, + 1454, + 296, + 1454 + ], + "score": 0.927 + }, + { + "category_id": 8, + "poly": [ + 392, + 694, + 1301, + 694, + 1301, + 738, + 392, + 738 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 817, + 73, + 817, + 106, + 298, + 106 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 864, + 2087, + 864, + 2113, + 835, + 2113 + ], + "score": 0.874 + }, + { + "category_id": 1, + "poly": [ + 295, + 749, + 959, + 749, + 959, + 783, + 295, + 783 + ], + "score": 0.84 + }, + { + "category_id": 1, + "poly": [ + 296, + 281, + 868, + 281, + 868, + 317, + 296, + 317 + ], + "score": 0.825 + }, + { + "category_id": 0, + "poly": [ + 298, + 227, + 1071, + 227, + 1071, + 263, + 298, + 263 + ], + "score": 0.581 + }, + { + "category_id": 1, + "poly": [ + 298, + 227, + 1071, + 227, + 1071, + 263, + 298, + 263 + ], + "score": 0.406 + }, + { + "category_id": 13, + "poly": [ + 911, + 1770, + 1107, + 1770, + 1107, + 1805, + 911, + 1805 + ], + "score": 0.95, + "latex": "f ( u ) = \\left( 1 - u ^ { \\alpha } \\right)" + }, + { + "category_id": 14, + "poly": [ + 670, + 927, + 1026, + 927, + 1026, + 1016, + 670, + 1016 + ], + "score": 0.95, + "latex": "\\lambda = \\frac { 1 } { \\alpha } \\left( \\frac { B } { \\exp ( ( \\alpha - 1 ) \\epsilon ) } \\right) ^ { \\left( \\frac { 1 } { \\beta } \\right) } \\ ," + }, + { + "category_id": 14, + "poly": [ + 471, + 1604, + 1229, + 1604, + 1229, + 1694, + 471, + 1694 + ], + "score": 0.94, + "latex": "\\left( 2 ^ { \\beta } \\theta _ { a } \\theta _ { b } \\bigl ( \\theta _ { a } ^ { \\alpha - 1 } + \\theta _ { b } ^ { \\alpha - 1 } \\bigr ) ^ { \\left( - \\frac { 1 } { \\alpha - 1 } \\right) } + 1 - \\theta _ { a } - \\theta _ { b } \\right) ^ { \\left( \\frac { 1 } { \\beta } \\right) } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) \\ ." + }, + { + "category_id": 14, + "poly": [ + 436, + 419, + 1264, + 419, + 1264, + 599, + 436, + 599 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { f _ { \\lambda } ^ { * } ( u ) = \\underset { v \\geq 0 } { \\operatorname* { m a x } } u v - \\lambda ( v ^ { \\alpha } - 1 ) = \\{ \\lambda \\atop \\lambda + \\lambda ( \\alpha - 1 ) ( \\frac { u } { \\lambda \\alpha } ) ^ { \\frac { \\alpha } { \\alpha - 1 } } } \\quad \\quad \\mathrm { i f } u \\leq 0 \\\\ & { \\quad \\quad = \\lambda + \\lambda ( \\alpha - 1 ) ( \\frac { \\operatorname* { m a x } ( u , 0 ) } { \\lambda \\alpha } ) ^ { \\frac { \\alpha } { \\alpha - 1 } } \\ . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 704, + 1072, + 995, + 1072, + 995, + 1150, + 704, + 1150 + ], + "score": 0.94, + "latex": "\\operatorname* { m a x } _ { \\kappa } \\kappa - B ^ { \\frac { 1 } { \\beta } } \\exp \\biggl ( \\frac { \\epsilon } { \\beta } \\biggr ) ." + }, + { + "category_id": 14, + "poly": [ + 739, + 1205, + 961, + 1205, + 961, + 1285, + 739, + 1285 + ], + "score": 0.94, + "latex": "\\frac { \\kappa } { B ^ { \\frac { 1 } { \\beta } } } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) ." + }, + { + "category_id": 14, + "poly": [ + 730, + 1469, + 967, + 1469, + 967, + 1552, + 730, + 1552 + ], + "score": 0.94, + "latex": "\\gamma = \\frac { \\theta _ { a } ^ { \\alpha - 1 } - \\theta _ { b } ^ { \\alpha - 1 } } { \\theta _ { a } ^ { \\alpha - 1 } + \\theta _ { b } ^ { \\alpha - 1 } } \\mathrm { ~ , ~ }" + }, + { + "category_id": 14, + "poly": [ + 379, + 1846, + 1308, + 1846, + 1308, + 1941, + 379, + 1941 + ], + "score": 0.93, + "latex": "f _ { \\lambda } ^ { * } ( u ) = \\operatorname* { m a x } _ { v \\geq 0 } u v - \\lambda ( 1 - v ^ { \\alpha } ) = \\left\\{ \\begin{array} { l l } { - \\lambda + \\lambda ^ { \\frac { 1 } { 1 - \\alpha } } ( 1 - \\alpha ) { \\left( \\frac { - u } { \\alpha } \\right) } ^ { \\left( - \\frac { \\alpha } { 1 - \\alpha } \\right) } } & { \\mathrm { ~ i f ~ } u \\leq 0 } \\\\ { \\infty } & { \\mathrm { ~ o t h e r w i s e ~ . } } \\end{array} \\right." + }, + { + "category_id": 13, + "poly": [ + 487, + 1953, + 641, + 1953, + 641, + 1987, + 487, + 1987 + ], + "score": 0.93, + "latex": "R _ { \\alpha } ( \\nu \\| \\rho ) \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 370, + 1417, + 497, + 1417, + 497, + 1457, + 370, + 1457 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\gamma = \\frac { 1 } { \\kappa } \\geq 0 } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 580, + 795, + 1117, + 795, + 1117, + 868, + 580, + 868 + ], + "score": 0.93, + "latex": "\\operatorname* { m a x } _ { \\lambda \\ge 0 , \\kappa } \\kappa - \\lambda \\exp ( ( \\alpha - 1 ) \\epsilon ) - B \\lambda ^ { 1 - \\beta } \\frac { ( \\alpha - 1 ) } { \\alpha ^ { \\beta } } ." + }, + { + "category_id": 13, + "poly": [ + 566, + 641, + 672, + 641, + 672, + 679, + 566, + 679 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\beta = \\frac { \\alpha } { \\alpha - 1 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 742, + 349, + 935, + 349, + 935, + 383, + 742, + 383 + ], + "score": 0.92, + "latex": "f ( u ) = \\left( u ^ { \\alpha } - 1 \\right)" + }, + { + "category_id": 13, + "poly": [ + 1262, + 610, + 1404, + 610, + 1404, + 645, + 1262, + 645 + ], + "score": 0.92, + "latex": "D _ { f } ( \\nu \\| \\rho ) \\leq" + }, + { + "category_id": 13, + "poly": [ + 898, + 610, + 1061, + 610, + 1061, + 644, + 898, + 644 + ], + "score": 0.92, + "latex": "R _ { \\alpha } ( \\nu \\| \\rho ) \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1221, + 349, + 1326, + 349, + 1326, + 383, + 1221, + 383 + ], + "score": 0.92, + "latex": "f ( 1 ) = 0" + }, + { + "category_id": 13, + "poly": [ + 298, + 1800, + 403, + 1800, + 403, + 1834, + 298, + 1834 + ], + "score": 0.92, + "latex": "f ( 1 ) = 0" + }, + { + "category_id": 14, + "poly": [ + 492, + 1334, + 1207, + 1334, + 1207, + 1404, + 492, + 1404 + ], + "score": 0.91, + "latex": "\\Big ( \\theta _ { a } \\operatorname* { m a x } ( 0 , 1 - \\gamma ) ^ { \\beta } + \\theta _ { b } \\operatorname* { m a x } ( 0 , 1 + \\gamma ) ^ { \\beta } + 1 - \\theta _ { a } - \\theta _ { b } \\Big ) ^ { - \\frac { 1 } { \\beta } } \\ ." + }, + { + "category_id": 13, + "poly": [ + 790, + 1163, + 860, + 1163, + 860, + 1192, + 790, + 1192 + ], + "score": 0.91, + "latex": "\\kappa \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 546, + 285, + 618, + 285, + 618, + 314, + 546, + 314 + ], + "score": 0.91, + "latex": "\\alpha \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 522, + 350, + 592, + 350, + 592, + 380, + 522, + 380 + ], + "score": 0.9, + "latex": "\\alpha \\geq 1" + }, + { + "category_id": 14, + "poly": [ + 661, + 1999, + 1037, + 1999, + 1037, + 2040, + 661, + 2040 + ], + "score": 0.9, + "latex": "D _ { f } ( \\nu \\vert \\vert \\rho ) \\leq 1 - \\exp ( ( \\alpha - 1 ) \\epsilon ) ." + }, + { + "category_id": 13, + "poly": [ + 668, + 285, + 740, + 285, + 740, + 314, + 668, + 314 + ], + "score": 0.9, + "latex": "\\alpha \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 628, + 1771, + 755, + 1771, + 755, + 1801, + 628, + 1801 + ], + "score": 0.9, + "latex": "0 \\leq \\alpha \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 298, + 640, + 512, + 640, + 512, + 675, + 298, + 675 + ], + "score": 0.9, + "latex": "\\mathrm { e x p } \\bar { ( } ( \\alpha - 1 ) \\epsilon ) - 1" + }, + { + "category_id": 14, + "poly": [ + 394, + 691, + 1304, + 691, + 1304, + 737, + 394, + 737 + ], + "score": 0.89, + "latex": "B = \\theta _ { a } ( \\operatorname* { m a x } ( 0 , \\kappa - 1 ) ) ^ { \\beta } + \\theta _ { b } ( \\operatorname* { m a x } ( 0 , \\kappa + 1 ) ) ^ { \\beta } + ( 1 - \\theta _ { a } - \\theta _ { b } ) ( \\operatorname* { m a x } ( 0 , \\kappa ) ) ^ { \\beta } \\ ." + }, + { + "category_id": 13, + "poly": [ + 709, + 884, + 728, + 884, + 728, + 910, + 709, + 910 + ], + "score": 0.84, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 956, + 885, + 974, + 885, + 974, + 910, + 956, + 910 + ], + "score": 0.81, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 994, + 1428, + 1012, + 1428, + 1012, + 1453, + 994, + 1453 + ], + "score": 0.81, + "latex": "\\gamma" + }, + { + "category_id": 13, + "poly": [ + 392, + 1771, + 523, + 1771, + 523, + 1802, + 392, + 1802 + ], + "score": 0.8, + "latex": "0 \\leq \\alpha \\leq 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 387, + 350, + 466, + 350, + 466, + 381, + 387, + 381 + ], + "score": 0.78, + "latex": "( \\alpha \\geq 1 )" + }, + { + "category_id": 13, + "poly": [ + 760, + 885, + 777, + 885, + 777, + 910, + 760, + 910 + ], + "score": 0.26, + "latex": "0" + }, + { + "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, + 868.0, + 2085.0, + 868.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 1072.0, + 228.0, + 1072.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1766.0, + 391.0, + 1766.0, + 391.0, + 1806.0, + 294.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 1766.0, + 627.0, + 1766.0, + 627.0, + 1806.0, + 524.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1766.0, + 910.0, + 1766.0, + 910.0, + 1806.0, + 756.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 1766.0, + 1404.0, + 1766.0, + 1404.0, + 1806.0, + 1108.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1798.0, + 585.0, + 1798.0, + 585.0, + 1835.0, + 404.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 604.0, + 897.0, + 604.0, + 897.0, + 648.0, + 294.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 604.0, + 1261.0, + 604.0, + 1261.0, + 648.0, + 1062.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 628.0, + 297.0, + 628.0, + 297.0, + 687.0, + 288.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 628.0, + 565.0, + 628.0, + 565.0, + 687.0, + 513.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 628.0, + 734.0, + 628.0, + 734.0, + 687.0, + 673.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 344.0, + 386.0, + 344.0, + 386.0, + 386.0, + 293.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 344.0, + 521.0, + 344.0, + 521.0, + 386.0, + 467.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 344.0, + 741.0, + 344.0, + 741.0, + 386.0, + 593.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 344.0, + 1220.0, + 344.0, + 1220.0, + 386.0, + 936.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 344.0, + 1409.0, + 344.0, + 1409.0, + 386.0, + 1327.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 378.0, + 397.0, + 378.0, + 397.0, + 413.0, + 293.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 879.0, + 708.0, + 879.0, + 708.0, + 919.0, + 295.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 879.0, + 759.0, + 879.0, + 759.0, + 919.0, + 729.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 879.0, + 955.0, + 879.0, + 955.0, + 919.0, + 778.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 879.0, + 1100.0, + 879.0, + 1100.0, + 919.0, + 975.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1703.0, + 737.0, + 1703.0, + 737.0, + 1739.0, + 295.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1564.0, + 654.0, + 1564.0, + 654.0, + 1597.0, + 295.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1291.0, + 614.0, + 1291.0, + 614.0, + 1330.0, + 294.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1026.0, + 711.0, + 1026.0, + 711.0, + 1062.0, + 296.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1159.0, + 789.0, + 1159.0, + 789.0, + 1196.0, + 295.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 1159.0, + 910.0, + 1159.0, + 910.0, + 1196.0, + 861.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1951.0, + 486.0, + 1951.0, + 486.0, + 1991.0, + 295.0, + 1991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 1951.0, + 732.0, + 1951.0, + 732.0, + 1991.0, + 642.0, + 1991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1414.0, + 369.0, + 1414.0, + 369.0, + 1460.0, + 293.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 1414.0, + 993.0, + 1414.0, + 993.0, + 1460.0, + 498.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1414.0, + 1140.0, + 1414.0, + 1140.0, + 1460.0, + 1013.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 745.0, + 955.0, + 745.0, + 955.0, + 788.0, + 294.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 276.0, + 545.0, + 276.0, + 545.0, + 324.0, + 293.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 276.0, + 667.0, + 276.0, + 667.0, + 324.0, + 619.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 276.0, + 868.0, + 276.0, + 868.0, + 324.0, + 741.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 1072.0, + 228.0, + 1072.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1579, + 1406, + 1579, + 1406, + 1704, + 296, + 1704 + ], + "score": 0.976 + }, + { + "category_id": 8, + "poly": [ + 576, + 1766, + 1124, + 1766, + 1124, + 1938, + 576, + 1938 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 685, + 442, + 1011, + 442, + 1011, + 519, + 685, + 519 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 493, + 1136, + 1204, + 1136, + 1204, + 1255, + 493, + 1255 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 532, + 1321, + 1161, + 1321, + 1161, + 1432, + 532, + 1432 + ], + "score": 0.958 + }, + { + "category_id": 8, + "poly": [ + 749, + 695, + 944, + 695, + 944, + 783, + 749, + 783 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 733, + 849, + 960, + 849, + 960, + 926, + 733, + 926 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 295, + 1970, + 1406, + 1970, + 1406, + 2035, + 295, + 2035 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 533, + 991, + 1165, + 991, + 1165, + 1061, + 533, + 1061 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 297, + 361, + 1415, + 361, + 1415, + 425, + 297, + 425 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 464, + 560, + 1223, + 560, + 1223, + 627, + 464, + 627 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 287, + 1080, + 1361, + 1080, + 1361, + 1117, + 287, + 1117 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 298, + 798, + 814, + 798, + 814, + 831, + 298, + 831 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 298, + 1272, + 626, + 1272, + 626, + 1304, + 298, + 1304 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 296, + 532, + 370, + 532, + 370, + 562, + 296, + 562 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 296, + 637, + 1079, + 637, + 1079, + 674, + 296, + 674 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 298, + 1717, + 972, + 1717, + 972, + 1751, + 298, + 1751 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 298, + 939, + 810, + 939, + 810, + 972, + 298, + 972 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 299, + 1524, + 663, + 1524, + 663, + 1557, + 299, + 1557 + ], + "score": 0.92 + }, + { + "category_id": 2, + "poly": [ + 297, + 73, + 817, + 73, + 817, + 106, + 297, + 106 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 762, + 229, + 762, + 263, + 299, + 263 + ], + "score": 0.915 + }, + { + "category_id": 8, + "poly": [ + 292, + 281, + 1455, + 281, + 1455, + 339, + 292, + 339 + ], + "score": 0.913 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1837, + 1401, + 1837, + 1401, + 1869, + 1351, + 1869 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 864, + 2087, + 864, + 2113, + 835, + 2113 + ], + "score": 0.865 + }, + { + "category_id": 1, + "poly": [ + 298, + 1466, + 1257, + 1466, + 1257, + 1500, + 298, + 1500 + ], + "score": 0.66 + }, + { + "category_id": 0, + "poly": [ + 298, + 1466, + 1257, + 1466, + 1257, + 1500, + 298, + 1500 + ], + "score": 0.305 + }, + { + "category_id": 13, + "poly": [ + 371, + 1080, + 467, + 1080, + 467, + 1118, + 371, + 1118 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\gamma = - \\frac { 1 } { \\kappa } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1322, + 1973, + 1398, + 1973, + 1398, + 2005, + 1322, + 2005 + ], + "score": 0.94, + "latex": "\\phi \\in S" + }, + { + "category_id": 14, + "poly": [ + 730, + 847, + 968, + 847, + 968, + 926, + 730, + 926 + ], + "score": 0.94, + "latex": "\\frac { 1 } { \\not { p } - \\kappa \\omega } \\geq \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) ." + }, + { + "category_id": 14, + "poly": [ + 488, + 1133, + 1213, + 1133, + 1213, + 1257, + 488, + 1257 + ], + "score": 0.94, + "latex": "\\left( 1 - \\theta _ { a } - \\theta _ { b } + 2 \\left( \\frac { \\theta _ { a } ^ { 1 - \\alpha } + \\theta _ { b } ^ { 1 - \\alpha } } { 2 } \\right) ^ { \\left( \\frac { 1 } { 1 - \\alpha } \\right) } \\right) ^ { \\left( - \\frac { 1 } { \\beta } \\right) } \\ge \\exp \\left( \\frac { \\epsilon } { \\beta } \\right) \\ ." + }, + { + "category_id": 14, + "poly": [ + 534, + 1320, + 1165, + 1320, + 1165, + 1431, + 534, + 1431 + ], + "score": 0.93, + "latex": "\\epsilon \\leq - \\log \\left( 1 - \\theta _ { a } - \\theta _ { b } + 2 \\bigg ( \\frac { \\theta _ { a } ^ { 1 - \\alpha } + \\theta _ { b } ^ { 1 - \\alpha } } { 2 } \\bigg ) ^ { \\left( \\frac { 1 } { 1 - \\alpha } \\right) } \\right) \\ ." + }, + { + "category_id": 14, + "poly": [ + 684, + 440, + 1012, + 440, + 1012, + 516, + 684, + 516 + ], + "score": 0.93, + "latex": "\\lambda = \\frac { \\exp \\big ( ( \\alpha - 1 ) \\epsilon \\big ( \\frac { 1 - \\alpha } { \\alpha } \\big ) \\big ) } { \\alpha \\omega } \\mathrm { ~ , ~ }" + }, + { + "category_id": 13, + "poly": [ + 845, + 639, + 950, + 639, + 950, + 676, + 845, + 676 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\beta = \\frac { \\alpha } { 1 - \\alpha } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 575, + 1765, + 1122, + 1765, + 1122, + 1941, + 575, + 1941 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } { \\underset { \\Psi : \\mathcal { X } \\mapsto \\{ - 1 , 0 , + 1 \\} , \\nu \\in \\mathcal { D } } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } [ \\Psi ( X ) ] } & { } \\\\ { \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } [ 1 [ \\Psi ( X ) = + 1 ] ] \\geq \\theta _ { a } } & { , } \\\\ { \\underset { X \\sim \\rho } { \\mathrm { E } } [ 1 [ \\Psi ( X ) = - 1 ] ] \\leq \\theta _ { b } } & { . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 747, + 693, + 951, + 693, + 951, + 784, + 747, + 784 + ], + "score": 0.92, + "latex": "\\kappa + \\frac { \\exp \\Bigl ( - \\frac { \\epsilon } { \\beta } \\Bigr ) } { \\omega } \\ ." + }, + { + "category_id": 14, + "poly": [ + 531, + 989, + 1167, + 989, + 1167, + 1062, + 531, + 1062 + ], + "score": 0.92, + "latex": "\\left( \\theta _ { a } \\bigl ( 1 + \\gamma \\bigr ) ^ { ( - \\beta ) } + \\theta _ { b } \\bigl ( 1 - \\gamma \\bigr ) ^ { ( - \\beta ) } + 1 - \\theta _ { a } - \\theta _ { b } \\right) ^ { \\left( \\frac { - 1 } { \\beta } \\right) } \\ ," + }, + { + "category_id": 13, + "poly": [ + 849, + 1082, + 957, + 1082, + 957, + 1116, + 849, + 1116 + ], + "score": 0.92, + "latex": "\\gamma \\in [ 0 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 506, + 364, + 598, + 364, + 598, + 393, + 506, + 393 + ], + "score": 0.91, + "latex": "\\kappa \\leq - 1" + }, + { + "category_id": 13, + "poly": [ + 359, + 2002, + 503, + 2002, + 503, + 2036, + 359, + 2036 + ], + "score": 0.91, + "latex": "1 [ \\phi ( X ) = 1 ]" + }, + { + "category_id": 13, + "poly": [ + 958, + 1642, + 1263, + 1642, + 1263, + 1675, + 958, + 1675 + ], + "score": 0.91, + "latex": "\\beta \\mapsto \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho )" + }, + { + "category_id": 13, + "poly": [ + 687, + 1642, + 760, + 1642, + 760, + 1673, + 687, + 1673 + ], + "score": 0.9, + "latex": "\\beta \\geq 0" + }, + { + "category_id": 14, + "poly": [ + 468, + 558, + 1233, + 558, + 1233, + 628, + 468, + 628 + ], + "score": 0.89, + "latex": "\\omega = \\left( \\theta _ { a } ( 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { b } ( - 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { c } ( - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } \\right) ^ { \\left( \\frac { 1 - \\alpha } { \\alpha } \\right) } \\ ." + }, + { + "category_id": 14, + "poly": [ + 310, + 278, + 1428, + 278, + 1428, + 340, + 310, + 340 + ], + "score": 0.86, + "latex": "\\operatorname* { m a x } _ { \\cdot , \\lambda \\geq 0 } \\kappa + \\lambda \\exp ( ( \\alpha - 1 ) \\epsilon ) - ( 1 - \\alpha ) \\lambda ^ { \\frac { 1 } { 1 - \\alpha } } \\alpha ^ { \\frac { \\alpha } { 1 - \\alpha } } \\Big ( \\theta _ { a } ( 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { b } ( - 1 - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } + \\theta _ { c } ( - \\kappa ) ^ { - \\frac { \\alpha } { 1 - \\alpha } } \\Big )" + }, + { + "category_id": 13, + "poly": [ + 1320, + 1675, + 1344, + 1675, + 1344, + 1698, + 1320, + 1698 + ], + "score": 0.84, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 903, + 366, + 957, + 366, + 957, + 393, + 903, + 393 + ], + "score": 0.83, + "latex": "- \\infty ," + }, + { + "category_id": 13, + "poly": [ + 710, + 1612, + 735, + 1612, + 735, + 1638, + 710, + 1638 + ], + "score": 0.82, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 1164, + 1612, + 1189, + 1612, + 1189, + 1638, + 1164, + 1638 + ], + "score": 0.82, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 522, + 396, + 540, + 396, + 540, + 421, + 522, + 421 + ], + "score": 0.81, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 1382, + 364, + 1401, + 364, + 1401, + 389, + 1382, + 389 + ], + "score": 0.76, + "latex": "\\lambda" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1523.0, + 665.0, + 1523.0, + 665.0, + 1559.0, + 296.0, + 1559.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": [ + 831.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2122.0, + 831.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1466.0, + 1258.0, + 1466.0, + 1258.0, + 1501.0, + 295.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1581.0, + 1403.0, + 1581.0, + 1403.0, + 1613.0, + 295.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1611.0, + 709.0, + 1611.0, + 709.0, + 1644.0, + 295.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 1611.0, + 1163.0, + 1611.0, + 1163.0, + 1644.0, + 736.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 1611.0, + 1404.0, + 1611.0, + 1404.0, + 1644.0, + 1190.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1640.0, + 686.0, + 1640.0, + 686.0, + 1677.0, + 291.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 1640.0, + 957.0, + 1640.0, + 957.0, + 1677.0, + 761.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 1640.0, + 1406.0, + 1640.0, + 1406.0, + 1677.0, + 1264.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1671.0, + 1319.0, + 1671.0, + 1319.0, + 1707.0, + 294.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 1671.0, + 1354.0, + 1671.0, + 1354.0, + 1707.0, + 1345.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1969.0, + 1321.0, + 1969.0, + 1321.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1969.0, + 1409.0, + 1969.0, + 1409.0, + 2008.0, + 1399.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2001.0, + 358.0, + 2001.0, + 358.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 2001.0, + 853.0, + 2001.0, + 853.0, + 2037.0, + 504.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 361.0, + 505.0, + 361.0, + 505.0, + 397.0, + 294.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 361.0, + 902.0, + 361.0, + 902.0, + 397.0, + 599.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 361.0, + 1381.0, + 361.0, + 1381.0, + 397.0, + 958.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 394.0, + 521.0, + 394.0, + 521.0, + 426.0, + 295.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 394.0, + 666.0, + 394.0, + 666.0, + 426.0, + 541.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1070.0, + 370.0, + 1070.0, + 370.0, + 1134.0, + 285.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 1070.0, + 848.0, + 1070.0, + 848.0, + 1134.0, + 468.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 1070.0, + 1369.0, + 1070.0, + 1369.0, + 1134.0, + 958.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 796.0, + 816.0, + 796.0, + 816.0, + 836.0, + 293.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1269.0, + 627.0, + 1269.0, + 627.0, + 1309.0, + 294.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 527.0, + 375.0, + 527.0, + 375.0, + 566.0, + 294.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 286.0, + 615.0, + 844.0, + 615.0, + 844.0, + 691.0, + 286.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 615.0, + 1084.0, + 615.0, + 1084.0, + 691.0, + 951.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1715.0, + 972.0, + 1715.0, + 972.0, + 1756.0, + 294.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 938.0, + 810.0, + 938.0, + 810.0, + 975.0, + 294.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 224.0, + 763.0, + 224.0, + 763.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1466.0, + 1258.0, + 1466.0, + 1258.0, + 1501.0, + 295.0, + 1501.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 785, + 1404, + 785, + 1404, + 941, + 296, + 941 + ], + "score": 0.977 + }, + { + "category_id": 8, + "poly": [ + 351, + 1440, + 1349, + 1440, + 1349, + 1694, + 351, + 1694 + ], + "score": 0.971 + }, + { + "category_id": 8, + "poly": [ + 640, + 586, + 1061, + 586, + 1061, + 763, + 640, + 763 + ], + "score": 0.963 + }, + { + "category_id": 8, + "poly": [ + 578, + 441, + 1104, + 441, + 1104, + 539, + 578, + 539 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 690, + 301, + 1007, + 301, + 1007, + 400, + 690, + 400 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 648, + 1065, + 1053, + 1065, + 1053, + 1243, + 648, + 1243 + ], + "score": 0.955 + }, + { + "category_id": 8, + "poly": [ + 462, + 1774, + 1234, + 1774, + 1234, + 1876, + 462, + 1876 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 296, + 228, + 1402, + 228, + 1402, + 292, + 296, + 292 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 752, + 1293, + 942, + 1293, + 942, + 1367, + 752, + 1367 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 298, + 1372, + 1405, + 1372, + 1405, + 1435, + 298, + 1435 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 298, + 1700, + 1403, + 1700, + 1403, + 1764, + 298, + 1764 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 297, + 547, + 1052, + 547, + 1052, + 580, + 297, + 580 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 296, + 1252, + 881, + 1252, + 881, + 1284, + 296, + 1284 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 299, + 1885, + 799, + 1885, + 799, + 1918, + 299, + 1918 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 297, + 2002, + 612, + 2002, + 612, + 2034, + 297, + 2034 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 296, + 406, + 418, + 406, + 418, + 438, + 296, + 438 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 297, + 1026, + 826, + 1026, + 826, + 1059, + 297, + 1059 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 817, + 73, + 817, + 106, + 298, + 106 + ], + "score": 0.923 + }, + { + "category_id": 8, + "poly": [ + 427, + 948, + 1271, + 948, + 1271, + 1015, + 427, + 1015 + ], + "score": 0.918 + }, + { + "category_id": 9, + "poly": [ + 1351, + 660, + 1401, + 660, + 1401, + 692, + 1351, + 692 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1141, + 1401, + 1141, + 1401, + 1172, + 1351, + 1172 + ], + "score": 0.897 + }, + { + "category_id": 8, + "poly": [ + 539, + 1924, + 1157, + 1924, + 1157, + 1975, + 539, + 1975 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 864, + 2087, + 864, + 2113, + 835, + 2113 + ], + "score": 0.872 + }, + { + "category_id": 8, + "poly": [ + 540, + 1924, + 1156, + 1924, + 1156, + 1976, + 540, + 1976 + ], + "score": 0.184 + }, + { + "category_id": 14, + "poly": [ + 352, + 1436, + 1350, + 1436, + 1350, + 1697, + 352, + 1697 + ], + "score": 0.96, + "latex": "\\begin{array} { r l } & { \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } ^ { T } \\Psi ( X ) r ( X ) \\big ] - \\lambda _ { a } \\bigg ( \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } _ { + } { } ^ { T } \\Psi ( X ) \\big ] - \\theta _ { a } \\bigg ) + \\lambda _ { b } \\bigg ( \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\big [ \\mathbf { a } _ { - } { } ^ { T } \\Psi ( X ) \\big ] - \\theta _ { b } \\bigg ) } \\\\ & { = \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\Big [ ( r ( X ) \\mathbf { a } - \\lambda _ { a } \\mathbf { a } _ { + } + \\lambda _ { b } \\mathbf { a } _ { - } ) ^ { \\top } \\Psi ( X ) \\Big ] } \\\\ & { = \\underset { \\Psi } { \\mathop { \\operatorname* { m i n } } } \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { ~ \\cal { E } ~ } } \\left[ \\binom { r ( X ) - \\lambda _ { a } } { - r ( X ) + \\lambda _ { b } } ^ { T } \\Psi ( X ) \\right] \\ . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 753, + 1291, + 948, + 1291, + 948, + 1368, + 753, + 1368 + ], + "score": 0.95, + "latex": "r ( X ) = \\frac { \\nu ( X ) } { \\rho ( X ) } \\ ." + }, + { + "category_id": 14, + "poly": [ + 689, + 301, + 1009, + 301, + 1009, + 398, + 689, + 398 + ], + "score": 0.94, + "latex": "\\mathcal { Z } = \\left\\{ \\left( 0 \\atop 0 \\right) , \\left( 1 \\atop 0 \\right) , \\left( 0 \\atop 1 \\right) \\right\\}" + }, + { + "category_id": 14, + "poly": [ + 459, + 1769, + 1238, + 1769, + 1238, + 1877, + 459, + 1877 + ], + "score": 0.94, + "latex": "\\operatorname* { m i n } _ { \\Psi ( x ) \\in \\mathcal { P } ( \\mathcal { Z } ) } { \\binom { r ( x ) - \\lambda _ { a } } { r ( x ) + \\lambda _ { b } } } ^ { T } \\Psi ( x ) = \\operatorname* { m i n } ( r ( x ) - \\lambda _ { a } , 0 , - r ( x ) + \\lambda _ { b } ) ." + }, + { + "category_id": 14, + "poly": [ + 578, + 441, + 1119, + 441, + 1119, + 538, + 578, + 538 + ], + "score": 0.93, + "latex": "{ \\bf a } = \\left( \\begin{array} { l } { { 1 } } \\\\ { { 0 } } \\\\ { { - 1 } } \\end{array} \\right) , { \\bf a } _ { + } = \\left( \\begin{array} { l } { { 1 } } \\\\ { { 0 } } \\\\ { { 0 } } \\end{array} \\right) , { \\bf a } _ { - } = \\left( \\begin{array} { l } { { 0 } } \\\\ { { 0 } } \\\\ { { 1 } } \\end{array} \\right) ." + }, + { + "category_id": 14, + "poly": [ + 639, + 584, + 1060, + 584, + 1060, + 767, + 639, + 767 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\underset { \\Psi : \\mathcal { X } \\mapsto \\mathcal { Z } , \\nu \\in \\mathcal { D } } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } \\big [ \\mathbf { a } ^ { T } \\Psi ( X ) \\big ] } \\\\ & { \\quad \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { + } { } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } ~ , } \\\\ & { \\qquad \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { - } { } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } ~ . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 551, + 1701, + 613, + 1701, + 613, + 1735, + 551, + 1735 + ], + "score": 0.93, + "latex": "\\Psi ( x )" + }, + { + "category_id": 14, + "poly": [ + 646, + 1064, + 1052, + 1064, + 1052, + 1246, + 646, + 1246 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\underset { \\Psi : \\mathcal K \\mapsto \\mathcal P ( \\mathcal Z ) } { \\mathrm { m i n } } \\underset { X \\sim \\nu } { \\mathrm { E } } \\big [ \\mathbf a ^ { T } \\Psi ( X ) \\big ] } \\\\ & { \\mathrm { s u b j e c t ~ t o ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf a _ { + } { } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } ~ , } \\\\ & { \\qquad \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf a _ { - } { } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } ~ . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 368, + 262, + 480, + 262, + 480, + 294, + 368, + 294 + ], + "score": 0.91, + "latex": "+ 1 , 0 , - 1" + }, + { + "category_id": 14, + "poly": [ + 541, + 1924, + 1157, + 1924, + 1157, + 1977, + 541, + 1977 + ], + "score": 0.91, + "latex": "\\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underbrace { \\mathrm { ~ E ~ } } _ { X \\sim \\rho } [ \\mathrm { m i n } ( r ( X ) - \\lambda _ { a } , 0 , r ( X ) + \\lambda _ { b } ) ] \\ ." + }, + { + "category_id": 13, + "poly": [ + 1149, + 850, + 1225, + 850, + 1225, + 878, + 1149, + 878 + ], + "score": 0.9, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 894, + 1702, + 982, + 1702, + 982, + 1731, + 894, + 1731 + ], + "score": 0.9, + "latex": "x \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 820, + 259, + 855, + 259, + 855, + 289, + 820, + 289 + ], + "score": 0.89, + "latex": "\\mathbb { R } ^ { 3 }" + }, + { + "category_id": 14, + "poly": [ + 423, + 942, + 1275, + 942, + 1275, + 1019, + 423, + 1019 + ], + "score": 0.87, + "latex": "\\left\\{ \\Psi : \\mathcal { X } \\mapsto \\mathcal { P } ( \\mathcal { Z } ) \\mathrm { ~ s u c h ~ t h a t ~ } \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { + } ^ { T } \\Psi ( X ) \\big ] \\geq \\theta _ { a } , \\underset { X \\sim \\rho } { \\mathrm { E } } \\big [ \\mathbf { a } _ { - } ^ { T } \\Psi ( X ) \\big ] \\leq \\theta _ { b } \\right\\} \\ ." + }, + { + "category_id": 13, + "poly": [ + 731, + 790, + 755, + 790, + 755, + 816, + 731, + 816 + ], + "score": 0.85, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 757, + 1254, + 781, + 1254, + 781, + 1279, + 757, + 1279 + ], + "score": 0.84, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 1329, + 1375, + 1353, + 1375, + 1353, + 1401, + 1329, + 1401 + ], + "score": 0.84, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 739, + 821, + 763, + 821, + 763, + 847, + 739, + 847 + ], + "score": 0.83, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 438, + 851, + 463, + 851, + 463, + 877, + 438, + 877 + ], + "score": 0.83, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 1378, + 232, + 1402, + 232, + 1402, + 258, + 1378, + 258 + ], + "score": 0.76, + "latex": "\\Psi" + }, + { + "category_id": 13, + "poly": [ + 969, + 794, + 987, + 794, + 987, + 816, + 969, + 816 + ], + "score": 0.76, + "latex": "\\nu" + }, + { + "category_id": 13, + "poly": [ + 1347, + 886, + 1365, + 886, + 1365, + 907, + 1347, + 907 + ], + "score": 0.74, + "latex": "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, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 788.0, + 730.0, + 788.0, + 730.0, + 822.0, + 295.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 788.0, + 968.0, + 788.0, + 968.0, + 822.0, + 756.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 788.0, + 1404.0, + 788.0, + 1404.0, + 822.0, + 988.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 819.0, + 738.0, + 819.0, + 738.0, + 852.0, + 295.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 819.0, + 1404.0, + 819.0, + 1404.0, + 852.0, + 764.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 846.0, + 437.0, + 846.0, + 437.0, + 886.0, + 293.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 846.0, + 1148.0, + 846.0, + 1148.0, + 886.0, + 464.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 846.0, + 1406.0, + 846.0, + 1406.0, + 886.0, + 1226.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 876.0, + 1346.0, + 876.0, + 1346.0, + 916.0, + 293.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1366.0, + 876.0, + 1406.0, + 876.0, + 1406.0, + 916.0, + 1366.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 908.0, + 570.0, + 908.0, + 570.0, + 944.0, + 294.0, + 944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 225.0, + 1377.0, + 225.0, + 1377.0, + 265.0, + 293.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 260.0, + 367.0, + 260.0, + 367.0, + 293.0, + 292.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 481.0, + 260.0, + 819.0, + 260.0, + 819.0, + 293.0, + 481.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 260.0, + 870.0, + 260.0, + 870.0, + 293.0, + 856.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1368.0, + 1328.0, + 1368.0, + 1328.0, + 1411.0, + 292.0, + 1411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1368.0, + 1406.0, + 1368.0, + 1406.0, + 1411.0, + 1354.0, + 1411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1398.0, + 378.0, + 1398.0, + 378.0, + 1440.0, + 292.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1697.0, + 550.0, + 1697.0, + 550.0, + 1737.0, + 296.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 1697.0, + 893.0, + 1697.0, + 893.0, + 1737.0, + 614.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1697.0, + 1405.0, + 1697.0, + 1405.0, + 1737.0, + 983.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1733.0, + 700.0, + 1733.0, + 700.0, + 1767.0, + 293.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 542.0, + 1055.0, + 542.0, + 1055.0, + 587.0, + 292.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1252.0, + 756.0, + 1252.0, + 756.0, + 1288.0, + 295.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 1252.0, + 879.0, + 1252.0, + 879.0, + 1288.0, + 782.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 800.0, + 1882.0, + 800.0, + 1923.0, + 294.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1999.0, + 615.0, + 1999.0, + 615.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 403.0, + 420.0, + 403.0, + 420.0, + 441.0, + 295.0, + 441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1021.0, + 827.0, + 1021.0, + 827.0, + 1065.0, + 294.0, + 1065.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1879, + 1404, + 1879, + 1404, + 2036, + 296, + 2036 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 296, + 984, + 1406, + 984, + 1406, + 1110, + 296, + 1110 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1337, + 1405, + 1337, + 1405, + 1432, + 298, + 1432 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 1693, + 1404, + 1693, + 1404, + 1786, + 296, + 1786 + ], + "score": 0.974 + }, + { + "category_id": 8, + "poly": [ + 471, + 572, + 1233, + 572, + 1233, + 767, + 471, + 767 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 398, + 822, + 1288, + 822, + 1288, + 973, + 398, + 973 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 461, + 1230, + 1237, + 1230, + 1237, + 1328, + 461, + 1328 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 298, + 403, + 1442, + 403, + 1442, + 504, + 298, + 504 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 297, + 1615, + 1401, + 1615, + 1401, + 1680, + 297, + 1680 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 527, + 1443, + 1169, + 1443, + 1169, + 1493, + 527, + 1493 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 396, + 274, + 1306, + 274, + 1306, + 352, + 396, + 352 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 297, + 778, + 661, + 778, + 661, + 810, + 297, + 810 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 293, + 1186, + 1362, + 1186, + 1362, + 1221, + 293, + 1221 + ], + "score": 0.931 + }, + { + "category_id": 8, + "poly": [ + 404, + 1796, + 1284, + 1796, + 1284, + 1849, + 404, + 1849 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 302, + 1504, + 1184, + 1504, + 1184, + 1537, + 302, + 1537 + ], + "score": 0.925 + }, + { + "category_id": 8, + "poly": [ + 341, + 1548, + 1305, + 1548, + 1305, + 1601, + 341, + 1601 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 298, + 362, + 660, + 362, + 660, + 394, + 298, + 394 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 817, + 73, + 817, + 106, + 298, + 106 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 296, + 527, + 886, + 527, + 886, + 562, + 296, + 562 + ], + "score": 0.914 + }, + { + "category_id": 8, + "poly": [ + 488, + 1121, + 1204, + 1121, + 1204, + 1162, + 488, + 1162 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 296, + 228, + 886, + 228, + 886, + 264, + 296, + 264 + ], + "score": 0.902 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1263, + 1400, + 1263, + 1400, + 1294, + 1352, + 1294 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1553, + 1400, + 1553, + 1400, + 1584, + 1352, + 1584 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1801, + 1400, + 1801, + 1400, + 1833, + 1351, + 1833 + ], + "score": 0.882 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 866, + 2087, + 866, + 2113, + 834, + 2113 + ], + "score": 0.876 + }, + { + "category_id": 14, + "poly": [ + 469, + 569, + 1233, + 569, + 1233, + 770, + 469, + 770 + ], + "score": 0.94, + "latex": "\\begin{array} { l } { \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 , - r ( X ) + \\lambda _ { b } ) = \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , - r ( X ) + \\lambda _ { b } ) } \\\\ { = r ( X ) - \\lambda _ { a } + 2 \\operatorname* { m i n } \\biggr ( 0 , \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } - r ( X ) \\biggr ) } \\\\ { = r ( X ) - \\lambda _ { a } - 2 \\operatorname* { m a x } \\biggr ( r ( X ) - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\biggr ) \\ . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 397, + 820, + 1302, + 820, + 1302, + 977, + 397, + 977 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\lambda _ { a } \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { E } } [ r ( X ) - \\lambda _ { a } ] - 2 \\underset { X \\sim \\rho } { \\mathrm { E } } \\bigg [ \\operatorname* { m a x } \\bigg ( r ( X ) - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\bigg ) \\bigg ] } \\\\ & { = 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - 2 \\bigg ( D _ { \\mathrm { H S } , \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } \\bigg ( 1 - \\frac { \\lambda _ { a } + \\lambda _ { b } } { 2 } , 0 \\bigg ) \\bigg ) \\ . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1021, + 986, + 1169, + 986, + 1169, + 1020, + 1021, + 1020 + ], + "score": 0.93, + "latex": "\\lambda _ { a } ^ { \\prime } = \\lambda _ { a } + \\kappa" + }, + { + "category_id": 13, + "poly": [ + 1256, + 1049, + 1353, + 1049, + 1353, + 1078, + 1256, + 1078 + ], + "score": 0.92, + "latex": "\\lambda _ { a } = \\lambda _ { b }" + }, + { + "category_id": 13, + "poly": [ + 1219, + 985, + 1363, + 985, + 1363, + 1021, + 1219, + 1021 + ], + "score": 0.92, + "latex": "\\lambda _ { b } ^ { \\prime } = \\lambda _ { b } - \\kappa" + }, + { + "category_id": 13, + "poly": [ + 1219, + 1616, + 1359, + 1616, + 1359, + 1650, + 1219, + 1650 + ], + "score": 0.92, + "latex": "D _ { \\mathrm { H S } , \\beta } ( \\nu \\| \\rho )" + }, + { + "category_id": 13, + "poly": [ + 454, + 987, + 590, + 987, + 590, + 1018, + 454, + 1018 + ], + "score": 0.92, + "latex": "1 - \\theta _ { a } \\ge \\theta _ { b }" + }, + { + "category_id": 13, + "poly": [ + 640, + 987, + 737, + 987, + 737, + 1018, + 640, + 1018 + ], + "score": 0.92, + "latex": "\\lambda _ { b } \\geq \\lambda _ { a }" + }, + { + "category_id": 13, + "poly": [ + 774, + 987, + 870, + 987, + 870, + 1018, + 774, + 1018 + ], + "score": 0.92, + "latex": "\\lambda _ { b } > \\lambda _ { a }" + }, + { + "category_id": 14, + "poly": [ + 461, + 1229, + 1238, + 1229, + 1238, + 1331, + 461, + 1331 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\underset { \\lambda _ { a } \\geq \\lambda _ { b } \\geq 0 } { \\operatorname* { m a x } } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) } \\\\ & { } \\\\ & { \\quad \\quad - \\left( D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) \\right) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 343, + 1882, + 417, + 1882, + 417, + 1915, + 343, + 1915 + ], + "score": 0.9, + "latex": "\\lambda _ { a } ^ { * } , \\lambda _ { b } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 335, + 1943, + 390, + 1943, + 390, + 1973, + 335, + 1973 + ], + "score": 0.9, + "latex": "{ \\mathcal { D } } _ { \\mathrm { H S } }" + }, + { + "category_id": 13, + "poly": [ + 971, + 1400, + 1045, + 1400, + 1045, + 1428, + 971, + 1428 + ], + "score": 0.9, + "latex": "\\nu \\in \\mathcal { D }" + }, + { + "category_id": 14, + "poly": [ + 398, + 272, + 1302, + 272, + 1302, + 354, + 398, + 354 + ], + "score": 0.9, + "latex": "\\begin{array} { r l } & { \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 , - r ( X ) + \\lambda _ { b } ) = \\operatorname* { m i n } ( r ( X ) - \\lambda _ { a } , 0 ) + \\operatorname* { m i n } ( - r ( X ) + \\lambda _ { b } , 0 ) } \\\\ & { = r ( X ) - \\lambda _ { a } - \\operatorname* { m a x } ( r ( X ) - \\lambda _ { a } , 0 ) - \\operatorname* { m a x } ( r ( X ) - \\lambda _ { b } , 0 ) \\ . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 344, + 1548, + 1311, + 1548, + 1311, + 1604, + 344, + 1604 + ], + "score": 0.9, + "latex": "\\operatorname* { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( \\epsilon _ { \\lambda _ { a } } + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) - ( \\epsilon _ { \\lambda _ { b } } + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) )" + }, + { + "category_id": 14, + "poly": [ + 528, + 1441, + 1168, + 1441, + 1168, + 1494, + 528, + 1494 + ], + "score": 0.9, + "latex": "\\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) = \\epsilon _ { \\lambda _ { a } } , \\ : \\ : \\ : \\operatorname* { m a x } _ { \\nu \\in \\mathcal { D } } D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) = \\epsilon _ { \\lambda _ { b } } ," + }, + { + "category_id": 13, + "poly": [ + 1186, + 1649, + 1240, + 1649, + 1240, + 1678, + 1186, + 1678 + ], + "score": 0.89, + "latex": "\\mathcal { D } _ { \\mathrm { H S } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1648, + 368, + 1648, + 368, + 1680, + 298, + 1680 + ], + "score": 0.89, + "latex": "\\beta \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 434, + 1020, + 505, + 1020, + 505, + 1047, + 434, + 1047 + ], + "score": 0.89, + "latex": "\\kappa > 0" + }, + { + "category_id": 14, + "poly": [ + 310, + 402, + 1428, + 402, + 1428, + 508, + 310, + 508 + ], + "score": 0.89, + "latex": "\\begin{array} { r l } & { \\underset { \\mathbf { \\theta } } { \\mathrm { \\mathop { A } } } a \\theta _ { a } - \\lambda _ { b } \\theta _ { b } + \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ r ( X ) - \\lambda _ { a } ] - \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ \\operatorname* { m a x } ( r ( X ) - \\lambda _ { a } , 0 ) ] - \\underset { X \\sim \\rho } { \\mathrm { \\mathop { F } } } [ \\operatorname* { m a x } ( r ( X ) - \\lambda _ { b } , 0 ) ] } \\\\ & { = 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) - ( D _ { \\mathrm { H S } , \\lambda _ { b } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { b } , 0 ) ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 404, + 1795, + 1295, + 1795, + 1295, + 1854, + 404, + 1854 + ], + "score": 0.88, + "latex": "\\operatorname * { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } ~ 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } - \\left( \\epsilon _ { \\lambda _ { a } } + [ 1 - \\lambda _ { a } ] _ { + } \\right) - \\left( \\epsilon _ { \\lambda _ { b } } + [ 1 - \\lambda _ { b } ] _ { + } \\right) ~ ." + }, + { + "category_id": 13, + "poly": [ + 389, + 231, + 540, + 231, + 540, + 262, + 389, + 262 + ], + "score": 0.85, + "latex": "( \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 )" + }, + { + "category_id": 14, + "poly": [ + 488, + 1120, + 1210, + 1120, + 1210, + 1161, + 488, + 1161 + ], + "score": 0.84, + "latex": "1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { a } \\theta _ { b } - 2 ( D _ { \\mathrm { H S } , \\lambda _ { a } } ( \\nu \\| \\rho ) + \\operatorname* { m a x } ( 1 - \\lambda _ { a } , 0 ) ) \\ ." + }, + { + "category_id": 13, + "poly": [ + 326, + 1726, + 352, + 1726, + 352, + 1752, + 326, + 1752 + ], + "score": 0.83, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 1284, + 1371, + 1309, + 1371, + 1309, + 1396, + 1284, + 1396 + ], + "score": 0.83, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 388, + 530, + 541, + 530, + 541, + 561, + 388, + 561 + ], + "score": 0.81, + "latex": "( \\lambda _ { b } \\ge \\lambda _ { a } \\ge 0 )" + }, + { + "category_id": 13, + "poly": [ + 606, + 1912, + 638, + 1912, + 638, + 1945, + 606, + 1945 + ], + "score": 0.67, + "latex": "\\lambda _ { a } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 647, + 1913, + 678, + 1913, + 678, + 1946, + 647, + 1946 + ], + "score": 0.67, + "latex": "\\lambda _ { b } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 605, + 1912, + 679, + 1912, + 679, + 1946, + 605, + 1946 + ], + "score": 0.29, + "latex": "\\lambda _ { a } ^ { * } , \\lambda _ { b } ^ { * }" + }, + { + "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": [ + 828.0, + 2083.0, + 872.0, + 2083.0, + 872.0, + 2124.0, + 828.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1879.0, + 342.0, + 1879.0, + 342.0, + 1916.0, + 294.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1879.0, + 1405.0, + 1879.0, + 1405.0, + 1916.0, + 418.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1907.0, + 604.0, + 1907.0, + 604.0, + 1949.0, + 293.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 1907.0, + 1406.0, + 1907.0, + 1406.0, + 1949.0, + 680.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 334.0, + 1941.0, + 334.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 1941.0, + 1405.0, + 1941.0, + 1405.0, + 1978.0, + 391.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1970.0, + 1405.0, + 1970.0, + 1405.0, + 2010.0, + 293.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 531.0, + 2002.0, + 531.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 983.0, + 453.0, + 983.0, + 453.0, + 1023.0, + 293.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 983.0, + 639.0, + 983.0, + 639.0, + 1023.0, + 591.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 983.0, + 773.0, + 983.0, + 773.0, + 1023.0, + 738.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 983.0, + 1020.0, + 983.0, + 1020.0, + 1023.0, + 871.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 983.0, + 1218.0, + 983.0, + 1218.0, + 1023.0, + 1170.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1364.0, + 983.0, + 1408.0, + 983.0, + 1408.0, + 1023.0, + 1364.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1018.0, + 433.0, + 1018.0, + 433.0, + 1051.0, + 294.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 1018.0, + 1406.0, + 1018.0, + 1406.0, + 1051.0, + 506.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1048.0, + 1255.0, + 1048.0, + 1255.0, + 1081.0, + 295.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1048.0, + 1403.0, + 1048.0, + 1403.0, + 1081.0, + 1354.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1078.0, + 414.0, + 1078.0, + 414.0, + 1112.0, + 293.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1337.0, + 1407.0, + 1337.0, + 1407.0, + 1375.0, + 295.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1367.0, + 1283.0, + 1367.0, + 1283.0, + 1403.0, + 292.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 1367.0, + 1408.0, + 1367.0, + 1408.0, + 1403.0, + 1310.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1398.0, + 970.0, + 1398.0, + 970.0, + 1436.0, + 293.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 1398.0, + 1275.0, + 1398.0, + 1275.0, + 1436.0, + 1046.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1691.0, + 1406.0, + 1691.0, + 1406.0, + 1730.0, + 293.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1724.0, + 325.0, + 1724.0, + 325.0, + 1761.0, + 294.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1724.0, + 1405.0, + 1724.0, + 1405.0, + 1761.0, + 353.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1754.0, + 463.0, + 1754.0, + 463.0, + 1790.0, + 292.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1615.0, + 1218.0, + 1615.0, + 1218.0, + 1651.0, + 293.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1615.0, + 1405.0, + 1615.0, + 1405.0, + 1651.0, + 1360.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1644.0, + 297.0, + 1644.0, + 297.0, + 1686.0, + 292.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1644.0, + 1185.0, + 1644.0, + 1185.0, + 1686.0, + 369.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 1644.0, + 1252.0, + 1644.0, + 1252.0, + 1686.0, + 1241.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 773.0, + 661.0, + 773.0, + 661.0, + 816.0, + 294.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1185.0, + 1366.0, + 1185.0, + 1366.0, + 1225.0, + 295.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1501.0, + 1186.0, + 1501.0, + 1186.0, + 1542.0, + 294.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 358.0, + 662.0, + 358.0, + 662.0, + 400.0, + 294.0, + 400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 528.0, + 387.0, + 528.0, + 387.0, + 565.0, + 298.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 528.0, + 887.0, + 528.0, + 887.0, + 565.0, + 542.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 227.0, + 388.0, + 227.0, + 388.0, + 267.0, + 297.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 227.0, + 888.0, + 227.0, + 888.0, + 267.0, + 541.0, + 267.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 19, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1342, + 1404, + 1342, + 1404, + 1476, + 296, + 1476 + ], + "score": 0.979 + }, + { + "category_id": 8, + "poly": [ + 440, + 1001, + 1251, + 1001, + 1251, + 1215, + 440, + 1215 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 531, + 1665, + 1182, + 1665, + 1182, + 2046, + 531, + 2046 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 294, + 915, + 1404, + 915, + 1404, + 983, + 294, + 983 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 688, + 1498, + 1008, + 1498, + 1008, + 1563, + 688, + 1563 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 295, + 1230, + 1400, + 1230, + 1400, + 1294, + 295, + 1294 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 423, + 819, + 1272, + 819, + 1272, + 899, + 423, + 899 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 672, + 337, + 1028, + 337, + 1028, + 394, + 672, + 394 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 294, + 1580, + 1406, + 1580, + 1406, + 1649, + 294, + 1649 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 296, + 416, + 1404, + 416, + 1404, + 482, + 296, + 482 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 296, + 492, + 1403, + 492, + 1403, + 559, + 296, + 559 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 295, + 685, + 1040, + 685, + 1040, + 721, + 295, + 721 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 297, + 768, + 1156, + 768, + 1156, + 804, + 297, + 804 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 294, + 284, + 1408, + 284, + 1408, + 321, + 294, + 321 + ], + "score": 0.923 + }, + { + "category_id": 8, + "poly": [ + 299, + 574, + 1409, + 574, + 1409, + 652, + 299, + 652 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 817, + 73, + 817, + 106, + 298, + 106 + ], + "score": 0.916 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1515, + 1400, + 1515, + 1400, + 1547, + 1351, + 1547 + ], + "score": 0.901 + }, + { + "category_id": 0, + "poly": [ + 300, + 229, + 810, + 229, + 810, + 262, + 300, + 262 + ], + "score": 0.769 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 864, + 2087, + 864, + 2114, + 834, + 2114 + ], + "score": 0.473 + }, + { + "category_id": 2, + "poly": [ + 300, + 229, + 810, + 229, + 810, + 262, + 300, + 262 + ], + "score": 0.112 + }, + { + "category_id": 14, + "poly": [ + 532, + 1664, + 1183, + 1664, + 1183, + 2051, + 532, + 2051 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) + \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 } \\\\ & { \\iff \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq 1 - \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) - \\frac { \\epsilon } { \\sigma } \\Big ) } \\\\ & { \\iff \\Psi _ { g } \\Big ( \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\Big ) \\geq \\Psi _ { g } \\Big ( \\frac { \\epsilon } { \\sigma } - \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) \\Big ) } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\frac { \\epsilon } { \\sigma } \\geq \\frac { \\epsilon } { \\sigma } - \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) + \\Psi _ { g } ^ { - 1 } ( 1 - \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } } \\\\ & { \\iff \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) \\geq \\frac { 2 \\epsilon } { \\sigma } ~ . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 438, + 998, + 1257, + 998, + 1257, + 1219, + 438, + 1219 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\displaystyle \\operatorname* { m a x } _ { \\lambda _ { a } \\ge \\lambda _ { b } \\ge 0 } 1 - \\lambda _ { a } ( 1 - \\theta _ { a } ) - \\lambda _ { b } \\theta _ { b } } \\\\ & { \\displaystyle - \\left( \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { a } ) \\sigma } { 2 \\epsilon } \\right) - \\lambda _ { a } \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { a } ) \\sigma } { 2 \\epsilon } \\right) \\right) } \\\\ & { \\displaystyle - \\left( \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { b } ) \\sigma } { 2 \\epsilon } \\right) - \\lambda _ { b } \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\lambda _ { b } ) \\sigma } { 2 \\epsilon } \\right) \\right) \\ . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1027, + 1404, + 1216, + 1404, + 1216, + 1442, + 1027, + 1442 + ], + "score": 0.94, + "latex": "\\rho = { \\mathcal { N } } ( x , \\sigma ^ { 2 } I )" + }, + { + "category_id": 14, + "poly": [ + 310, + 573, + 1420, + 573, + 1420, + 651, + 310, + 651 + ], + "score": 0.94, + "latex": "\\operatorname* { m a x } _ { \\substack { \\tau _ { * } \\Vert x - x ^ { \\prime } \\Vert _ { 2 } \\leq \\epsilon } } D _ { \\mathrm { H S , \\beta } } ( \\mu ( x ^ { \\prime } ) \\Vert \\mu ( x ) ) = \\Psi _ { g } \\left( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\right) - \\beta \\Psi _ { g } \\left( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\right) - [ 1 - \\beta ] _ { + } \\ ." + }, + { + "category_id": 13, + "poly": [ + 956, + 416, + 1173, + 416, + 1173, + 455, + 956, + 455 + ], + "score": 0.93, + "latex": "\\mu ( x ) = \\mathcal { N } \\big ( x , \\sigma ^ { 2 } I \\big )" + }, + { + "category_id": 13, + "poly": [ + 1107, + 1582, + 1353, + 1582, + 1353, + 1617, + 1107, + 1617 + ], + "score": 0.93, + "latex": "1 - \\Psi _ { g } ( \\theta ) = \\Psi _ { g } ( - \\theta )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1438, + 733, + 1438, + 733, + 1478, + 297, + 1478 + ], + "score": 0.93, + "latex": "\\mathcal { D } _ { { x } , \\epsilon } = \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\}" + }, + { + "category_id": 13, + "poly": [ + 1083, + 493, + 1174, + 493, + 1174, + 527, + 1083, + 527 + ], + "score": 0.93, + "latex": "\\mathcal { N } ( 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 607, + 945, + 1041, + 945, + 1041, + 983, + 607, + 983 + ], + "score": 0.93, + "latex": "\\mathcal { D } _ { x , \\epsilon } \\overset { \\cdot } { = } \\{ \\mathcal { N } \\big ( x ^ { \\prime } , \\sigma ^ { 2 } I \\big ) : \\| x - x ^ { \\prime } \\| _ { 2 } \\leq \\epsilon \\}" + }, + { + "category_id": 14, + "poly": [ + 687, + 1496, + 1014, + 1496, + 1014, + 1563, + 687, + 1563 + ], + "score": 0.93, + "latex": "\\frac { 2 \\epsilon } { \\sigma } \\leq \\Psi _ { g } ^ { - 1 } ( \\theta _ { a } ) - \\Psi _ { g } ^ { - 1 } ( \\theta _ { b } ) ." + }, + { + "category_id": 14, + "poly": [ + 423, + 820, + 1273, + 820, + 1273, + 898, + 423, + 898 + ], + "score": 0.93, + "latex": "\\epsilon _ { \\beta } = \\Psi _ { g } \\bigg ( \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\bigg ) - \\beta \\Psi _ { g } \\bigg ( - \\frac { \\epsilon } { 2 \\sigma } - \\frac { \\log ( \\beta ) \\sigma } { 2 \\epsilon } \\bigg ) - \\operatorname* { m a x } ( 1 - \\beta , 0 ) ." + }, + { + "category_id": 13, + "poly": [ + 298, + 944, + 430, + 944, + 430, + 983, + 298, + 983 + ], + "score": 0.92, + "latex": "\\mathcal { N } ( \\breve { x ^ { \\prime } } , \\sigma ^ { \\top } I )" + }, + { + "category_id": 13, + "poly": [ + 1075, + 771, + 1146, + 771, + 1146, + 803, + 1075, + 803 + ], + "score": 0.92, + "latex": "\\beta \\geq 0" + }, + { + "category_id": 14, + "poly": [ + 670, + 336, + 1028, + 336, + 1028, + 394, + 670, + 394 + ], + "score": 0.92, + "latex": "\\operatorname* { m a x } _ { x ^ { \\prime } : d ( x , x ^ { \\prime } ) \\leq \\epsilon } D _ { \\mathrm { H S } , \\beta } ( \\mu ( x ^ { \\prime } ) | | \\mu ( x ) )" + }, + { + "category_id": 13, + "poly": [ + 1279, + 1232, + 1351, + 1232, + 1351, + 1263, + 1279, + 1263 + ], + "score": 0.92, + "latex": "\\lambda _ { a } , \\lambda _ { b }" + }, + { + "category_id": 13, + "poly": [ + 1281, + 494, + 1353, + 494, + 1353, + 526, + 1281, + 526 + ], + "score": 0.91, + "latex": "\\beta \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 298, + 525, + 383, + 525, + 383, + 556, + 298, + 556 + ], + "score": 0.91, + "latex": "\\boldsymbol { x } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 392, + 419, + 463, + 419, + 463, + 450, + 392, + 450 + ], + "score": 0.9, + "latex": "\\beta \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 523, + 1614, + 559, + 1614, + 559, + 1648, + 523, + 1648 + ], + "score": 0.89, + "latex": "\\Psi _ { g }" + }, + { + "category_id": 13, + "poly": [ + 475, + 494, + 512, + 494, + 512, + 528, + 475, + 528 + ], + "score": 0.89, + "latex": "\\Psi _ { g }" + }, + { + "category_id": 13, + "poly": [ + 686, + 425, + 707, + 425, + 707, + 451, + 686, + 451 + ], + "score": 0.83, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 298, + 1407, + 320, + 1407, + 320, + 1433, + 298, + 1433 + ], + "score": 0.82, + "latex": "S" + }, + { + "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, + 229.0, + 813.0, + 229.0, + 813.0, + 265.0, + 296.0, + 265.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": [ + 296.0, + 229.0, + 813.0, + 229.0, + 813.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1342.0, + 1402.0, + 1342.0, + 1402.0, + 1379.0, + 293.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1377.0, + 1402.0, + 1377.0, + 1402.0, + 1408.0, + 296.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1404.0, + 297.0, + 1404.0, + 297.0, + 1442.0, + 294.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1404.0, + 1026.0, + 1404.0, + 1026.0, + 1442.0, + 321.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 1404.0, + 1404.0, + 1404.0, + 1404.0, + 1442.0, + 1217.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1439.0, + 890.0, + 1439.0, + 890.0, + 1477.0, + 734.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 912.0, + 1407.0, + 912.0, + 1407.0, + 953.0, + 293.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 941.0, + 297.0, + 941.0, + 297.0, + 984.0, + 292.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 941.0, + 606.0, + 941.0, + 606.0, + 984.0, + 431.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 941.0, + 1168.0, + 941.0, + 1168.0, + 984.0, + 1042.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1229.0, + 1278.0, + 1229.0, + 1278.0, + 1268.0, + 294.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1229.0, + 1406.0, + 1229.0, + 1406.0, + 1268.0, + 1352.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1262.0, + 1017.0, + 1262.0, + 1017.0, + 1298.0, + 295.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 1266.0, + 1404.0, + 1266.0, + 1404.0, + 1291.0, + 1377.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1579.0, + 1106.0, + 1579.0, + 1106.0, + 1620.0, + 293.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1579.0, + 1405.0, + 1579.0, + 1405.0, + 1620.0, + 1354.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1606.0, + 522.0, + 1606.0, + 522.0, + 1656.0, + 291.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 1606.0, + 575.0, + 1606.0, + 575.0, + 1656.0, + 560.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 415.0, + 391.0, + 415.0, + 391.0, + 455.0, + 294.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 415.0, + 685.0, + 415.0, + 685.0, + 455.0, + 464.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 415.0, + 955.0, + 415.0, + 955.0, + 455.0, + 708.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 415.0, + 1404.0, + 415.0, + 1404.0, + 455.0, + 1174.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 448.0, + 792.0, + 448.0, + 792.0, + 484.0, + 295.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 488.0, + 474.0, + 488.0, + 474.0, + 529.0, + 293.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 488.0, + 1082.0, + 488.0, + 1082.0, + 529.0, + 513.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1175.0, + 488.0, + 1280.0, + 488.0, + 1280.0, + 529.0, + 1175.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 488.0, + 1405.0, + 488.0, + 1405.0, + 529.0, + 1354.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 519.0, + 297.0, + 519.0, + 297.0, + 564.0, + 292.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 519.0, + 488.0, + 519.0, + 488.0, + 564.0, + 384.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 682.0, + 1043.0, + 682.0, + 1043.0, + 727.0, + 293.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 767.0, + 1074.0, + 767.0, + 1074.0, + 807.0, + 296.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 767.0, + 1158.0, + 767.0, + 1158.0, + 807.0, + 1147.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 280.0, + 1407.0, + 280.0, + 1407.0, + 325.0, + 293.0, + 325.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 20, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 281, + 1405, + 281, + 1405, + 414, + 296, + 414 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 624, + 1406, + 624, + 1406, + 756, + 297, + 756 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 296, + 1156, + 1405, + 1156, + 1405, + 1282, + 296, + 1282 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 296, + 823, + 1406, + 823, + 1406, + 949, + 296, + 949 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 517, + 1405, + 517, + 1405, + 611, + 297, + 611 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 962, + 1406, + 962, + 1406, + 1058, + 296, + 1058 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 746, + 1073, + 948, + 1073, + 948, + 1145, + 746, + 1145 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 297, + 1290, + 1403, + 1290, + 1403, + 1354, + 297, + 1354 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 294, + 1972, + 1411, + 1972, + 1411, + 2036, + 294, + 2036 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 438, + 430, + 1259, + 430, + 1259, + 504, + 438, + 504 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 664, + 1525, + 1033, + 1525, + 1033, + 1580, + 664, + 1580 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 671, + 1926, + 1026, + 1926, + 1026, + 1966, + 671, + 1966 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 534, + 1813, + 1166, + 1813, + 1166, + 1887, + 534, + 1887 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 296, + 1599, + 1405, + 1599, + 1405, + 1664, + 296, + 1664 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 435, + 1677, + 1260, + 1677, + 1260, + 1734, + 435, + 1734 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 527, + 772, + 1167, + 772, + 1167, + 813, + 527, + 813 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 299, + 1764, + 770, + 1764, + 770, + 1798, + 299, + 1798 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 298, + 1475, + 1399, + 1475, + 1399, + 1512, + 298, + 1512 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 297, + 1902, + 376, + 1902, + 376, + 1931, + 297, + 1931 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 817, + 74, + 817, + 105, + 299, + 105 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 300, + 228, + 677, + 228, + 677, + 262, + 300, + 262 + ], + "score": 0.913 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1094, + 1400, + 1094, + 1400, + 1125, + 1351, + 1125 + ], + "score": 0.907 + }, + { + "category_id": 9, + "poly": [ + 1352, + 450, + 1400, + 450, + 1400, + 481, + 1352, + 481 + ], + "score": 0.899 + }, + { + "category_id": 9, + "poly": [ + 1352, + 775, + 1400, + 775, + 1400, + 806, + 1352, + 806 + ], + "score": 0.888 + }, + { + "category_id": 0, + "poly": [ + 299, + 1390, + 1274, + 1390, + 1274, + 1452, + 299, + 1452 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.877 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1681, + 1400, + 1681, + 1400, + 1713, + 1351, + 1713 + ], + "score": 0.873 + }, + { + "category_id": 14, + "poly": [ + 745, + 1070, + 954, + 1070, + 954, + 1144, + 745, + 1144 + ], + "score": 0.95, + "latex": "\\tau \\leq \\frac { \\theta _ { a } - e ^ { 2 \\varepsilon } \\theta _ { b } } { e ^ { \\varepsilon } + 1 } \\ ." + }, + { + "category_id": 14, + "poly": [ + 437, + 427, + 1260, + 427, + 1260, + 505, + 437, + 505 + ], + "score": 0.95, + "latex": "D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( G ( x ) \\| G ( x ^ { \\prime } ) ) = \\operatorname* { s u p } _ { E } \\left( \\operatorname* { l i p } _ { X \\sim G ( x ) } [ X \\in E ] - e ^ { \\varepsilon } \\operatorname* { l i p } _ { X ^ { \\prime } \\sim G ( x ^ { \\prime } ) } [ X ^ { \\prime } \\in E ] \\right)" + }, + { + "category_id": 13, + "poly": [ + 1098, + 344, + 1263, + 344, + 1263, + 384, + 1098, + 384 + ], + "score": 0.93, + "latex": "\\| x - x ^ { \\prime } \\| _ { p } \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 891, + 2003, + 1041, + 2003, + 1041, + 2036, + 891, + 2036 + ], + "score": 0.93, + "latex": "\\| x ^ { \\prime } - x \\| \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1173, + 1598, + 1236, + 1598, + 1236, + 1637, + 1173, + 1637 + ], + "score": 0.93, + "latex": "f { \\bigl ( } { \\frac { 1 } { u } } { \\bigr ) }" + }, + { + "category_id": 13, + "poly": [ + 946, + 826, + 1031, + 826, + 1031, + 859, + 946, + 859 + ], + "score": 0.93, + "latex": "D _ { \\mathrm { D P } , e ^ { \\varepsilon } }" + }, + { + "category_id": 13, + "poly": [ + 873, + 656, + 1038, + 656, + 1038, + 696, + 873, + 696 + ], + "score": 0.93, + "latex": "\\| x - x ^ { \\prime } \\| _ { p } \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 949, + 1601, + 1058, + 1601, + 1058, + 1635, + 949, + 1635 + ], + "score": 0.93, + "latex": "f ( 1 ) = 0" + }, + { + "category_id": 13, + "poly": [ + 692, + 1479, + 867, + 1479, + 867, + 1512, + 692, + 1512 + ], + "score": 0.93, + "latex": "\\mu : \\mathcal { X } \\mapsto \\mathcal { P } ( \\mathcal { X } )" + }, + { + "category_id": 13, + "poly": [ + 978, + 1158, + 1255, + 1158, + 1255, + 1192, + 978, + 1192 + ], + "score": 0.92, + "latex": "\\{ \\nu : D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\nu \\| \\rho ) \\leq \\tau \\}" + }, + { + "category_id": 14, + "poly": [ + 534, + 1810, + 1167, + 1810, + 1167, + 1887, + 534, + 1887 + ], + "score": 0.92, + "latex": "\\frac { \\mu ( x ^ { \\prime } ) [ z ] } { \\mu ( x ) [ z ] } = \\exp ( \\| z - x \\| - \\| z - x ^ { \\prime } \\| ) \\leq \\exp ( \\| x - x ^ { \\prime } \\| )" + }, + { + "category_id": 13, + "poly": [ + 298, + 380, + 597, + 380, + 597, + 415, + 298, + 415 + ], + "score": 0.92, + "latex": "D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( G ( x ) \\| G ( x ^ { \\prime } ) ) \\leq \\tau" + }, + { + "category_id": 13, + "poly": [ + 1029, + 691, + 1398, + 691, + 1398, + 731, + 1029, + 731 + ], + "score": 0.92, + "latex": "\\{ \\mu ( x ^ { \\prime } ) : \\| x - x ^ { \\prime } \\| _ { p } \\leq 1 \\} \\subseteq { \\mathcal { D } } _ { \\varepsilon , \\tau }" + }, + { + "category_id": 13, + "poly": [ + 343, + 657, + 449, + 657, + 449, + 690, + 343, + 690 + ], + "score": 0.92, + "latex": "\\tau \\in [ 0 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 862, + 888, + 918, + 888, + 918, + 920, + 862, + 920 + ], + "score": 0.92, + "latex": "\\mathcal { D } _ { \\varepsilon , \\tau }" + }, + { + "category_id": 13, + "poly": [ + 1185, + 1972, + 1374, + 1972, + 1374, + 2007, + 1185, + 2007 + ], + "score": 0.91, + "latex": "D _ { f } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) )" + }, + { + "category_id": 13, + "poly": [ + 298, + 344, + 365, + 344, + 365, + 378, + 298, + 378 + ], + "score": 0.91, + "latex": "\\mathcal { P } ( \\mathcal { Z } )" + }, + { + "category_id": 13, + "poly": [ + 605, + 857, + 688, + 857, + 688, + 888, + 605, + 888 + ], + "score": 0.91, + "latex": "\\beta = e ^ { \\varepsilon }" + }, + { + "category_id": 13, + "poly": [ + 1139, + 627, + 1247, + 627, + 1247, + 659, + 1139, + 659 + ], + "score": 0.91, + "latex": "\\rho = \\mu ( x )" + }, + { + "category_id": 14, + "poly": [ + 659, + 1524, + 1032, + 1524, + 1032, + 1581, + 659, + 1581 + ], + "score": 0.91, + "latex": "\\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } R _ { \\infty } ( \\mu ( x + \\delta ) \\| \\mu ( x ) ) \\leq \\epsilon ." + }, + { + "category_id": 13, + "poly": [ + 427, + 857, + 502, + 857, + 502, + 890, + 427, + 890 + ], + "score": 0.91, + "latex": "D _ { \\mathrm { H S } , \\beta }" + }, + { + "category_id": 14, + "poly": [ + 669, + 1927, + 1031, + 1927, + 1031, + 1966, + 669, + 1966 + ], + "score": 0.91, + "latex": "R _ { \\infty } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) \\leq \\| x - x ^ { \\prime } \\| ." + }, + { + "category_id": 13, + "poly": [ + 465, + 345, + 528, + 345, + 528, + 378, + 465, + 378 + ], + "score": 0.91, + "latex": "( \\varepsilon , \\tau )" + }, + { + "category_id": 13, + "poly": [ + 324, + 1603, + 368, + 1603, + 368, + 1635, + 324, + 1635 + ], + "score": 0.91, + "latex": "\\| x \\|" + }, + { + "category_id": 13, + "poly": [ + 1009, + 1478, + 1307, + 1478, + 1307, + 1512, + 1009, + 1512 + ], + "score": 0.91, + "latex": "\\mu ( x ) [ z ] \\propto \\exp ( - \\| z - x \\| )" + }, + { + "category_id": 14, + "poly": [ + 434, + 1677, + 1263, + 1677, + 1263, + 1735, + 434, + 1735 + ], + "score": 0.91, + "latex": "\\operatorname* { m a x } _ { \\| \\delta \\| \\leq \\epsilon } D _ { f } ( \\mu ( x + \\delta ) \\| \\mu ( x ) ) \\leq \\operatorname* { m a x } _ { \\| \\delta \\| = \\epsilon } \\mathrm { ~ E ~ } _ { \\sim \\mu ( 0 ) } [ f ( \\exp ( - \\| X - \\delta \\| + \\| X \\| ) ) ] \\enspace ." + }, + { + "category_id": 13, + "poly": [ + 1342, + 996, + 1397, + 996, + 1397, + 1029, + 1342, + 1029 + ], + "score": 0.91, + "latex": "\\mathcal { D } _ { \\varepsilon , \\tau }" + }, + { + "category_id": 13, + "poly": [ + 296, + 1219, + 537, + 1219, + 537, + 1253, + 296, + 1253 + ], + "score": 0.9, + "latex": "( \\beta - 1 ) ( 1 - \\theta _ { a } - \\theta _ { b } )" + }, + { + "category_id": 13, + "poly": [ + 1285, + 313, + 1405, + 313, + 1405, + 343, + 1285, + 343 + ], + "score": 0.9, + "latex": "G : \\mathbb { R } ^ { d } \\overset { } { }" + }, + { + "category_id": 13, + "poly": [ + 1186, + 659, + 1248, + 659, + 1248, + 690, + 1186, + 690 + ], + "score": 0.9, + "latex": "( \\varepsilon , \\tau )" + }, + { + "category_id": 13, + "poly": [ + 1317, + 888, + 1361, + 888, + 1361, + 917, + 1317, + 917 + ], + "score": 0.89, + "latex": "\\mathcal { D } _ { \\mathcal { F } }" + }, + { + "category_id": 13, + "poly": [ + 1279, + 1191, + 1403, + 1191, + 1403, + 1221, + 1279, + 1221 + ], + "score": 0.89, + "latex": "\\theta _ { a } - \\theta _ { b } \\geq" + }, + { + "category_id": 13, + "poly": [ + 1292, + 1160, + 1347, + 1160, + 1347, + 1191, + 1292, + 1191 + ], + "score": 0.89, + "latex": "\\mathcal { D } _ { \\varepsilon , \\tau }" + }, + { + "category_id": 13, + "poly": [ + 1334, + 627, + 1402, + 627, + 1402, + 657, + 1334, + 657 + ], + "score": 0.88, + "latex": "\\varepsilon \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 411, + 694, + 439, + 694, + 439, + 727, + 411, + 727 + ], + "score": 0.88, + "latex": "\\ell _ { p }" + }, + { + "category_id": 14, + "poly": [ + 528, + 772, + 1169, + 772, + 1169, + 811, + 528, + 811 + ], + "score": 0.87, + "latex": "\\mathscr { D } _ { \\varepsilon , \\tau } = \\{ \\nu : D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\nu \\| \\rho ) \\leq \\tau \\ \\mathrm { a n d } \\ D _ { \\mathrm { D P } , e ^ { \\varepsilon } } ( \\rho \\| \\nu ) \\leq \\tau \\} ." + }, + { + "category_id": 13, + "poly": [ + 799, + 345, + 826, + 345, + 826, + 379, + 799, + 379 + ], + "score": 0.86, + "latex": "\\ell _ { p }" + }, + { + "category_id": 13, + "poly": [ + 410, + 2004, + 436, + 2004, + 436, + 2030, + 410, + 2030 + ], + "score": 0.86, + "latex": "x ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 650, + 1603, + 669, + 1603, + 669, + 1634, + 650, + 1634 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 839, + 858, + 858, + 858, + 858, + 888, + 839, + 888 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 455, + 1974, + 475, + 1974, + 475, + 2004, + 455, + 2004 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 1042, + 550, + 1070, + 550, + 1070, + 576, + 1042, + 576 + ], + "score": 0.85, + "latex": "\\ell ^ { p \\ }" + }, + { + "category_id": 13, + "poly": [ + 875, + 521, + 899, + 521, + 899, + 546, + 875, + 546 + ], + "score": 0.84, + "latex": "E" + }, + { + "category_id": 13, + "poly": [ + 619, + 554, + 640, + 554, + 640, + 581, + 619, + 581 + ], + "score": 0.83, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 499, + 581, + 526, + 581, + 526, + 607, + 499, + 607 + ], + "score": 0.83, + "latex": "\\ell ^ { p \\ }" + }, + { + "category_id": 13, + "poly": [ + 784, + 1251, + 808, + 1251, + 808, + 1277, + 784, + 1277 + ], + "score": 0.81, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 935, + 521, + 959, + 521, + 959, + 546, + 935, + 546 + ], + "score": 0.81, + "latex": "\\mathcal { Z }" + }, + { + "category_id": 13, + "poly": [ + 1071, + 660, + 1090, + 660, + 1090, + 689, + 1071, + 689 + ], + "score": 0.81, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 954, + 1293, + 979, + 1293, + 979, + 1319, + 954, + 1319 + ], + "score": 0.81, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 614, + 1639, + 632, + 1639, + 632, + 1658, + 614, + 1658 + ], + "score": 0.78, + "latex": "u" + }, + { + "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, + 226.0, + 680.0, + 226.0, + 680.0, + 264.0, + 294.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1391.0, + 354.0, + 1391.0, + 354.0, + 1425.0, + 297.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 1391.0, + 1277.0, + 1391.0, + 1277.0, + 1425.0, + 362.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1425.0, + 654.0, + 1425.0, + 654.0, + 1453.0, + 369.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2126.0, + 829.0, + 2126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 281.0, + 1405.0, + 281.0, + 1405.0, + 320.0, + 293.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 312.0, + 1284.0, + 312.0, + 1284.0, + 349.0, + 291.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 341.0, + 297.0, + 341.0, + 297.0, + 381.0, + 294.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 341.0, + 464.0, + 341.0, + 464.0, + 381.0, + 366.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 341.0, + 798.0, + 341.0, + 798.0, + 381.0, + 529.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 341.0, + 1097.0, + 341.0, + 1097.0, + 381.0, + 827.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 341.0, + 1406.0, + 341.0, + 1406.0, + 381.0, + 1264.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 379.0, + 684.0, + 379.0, + 684.0, + 417.0, + 598.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 624.0, + 1138.0, + 624.0, + 1138.0, + 660.0, + 294.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1248.0, + 624.0, + 1333.0, + 624.0, + 1333.0, + 660.0, + 1248.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 624.0, + 1406.0, + 624.0, + 1406.0, + 660.0, + 1403.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 655.0, + 342.0, + 655.0, + 342.0, + 692.0, + 294.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 655.0, + 872.0, + 655.0, + 872.0, + 692.0, + 450.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 655.0, + 1070.0, + 655.0, + 1070.0, + 692.0, + 1039.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 655.0, + 1185.0, + 655.0, + 1185.0, + 692.0, + 1091.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1249.0, + 655.0, + 1406.0, + 655.0, + 1406.0, + 692.0, + 1249.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 690.0, + 410.0, + 690.0, + 410.0, + 731.0, + 291.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 690.0, + 1028.0, + 690.0, + 1028.0, + 731.0, + 440.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 690.0, + 1408.0, + 690.0, + 1408.0, + 731.0, + 1399.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 721.0, + 375.0, + 721.0, + 375.0, + 762.0, + 291.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1155.0, + 977.0, + 1155.0, + 977.0, + 1194.0, + 293.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 1155.0, + 1291.0, + 1155.0, + 1291.0, + 1194.0, + 1256.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 1155.0, + 1405.0, + 1155.0, + 1405.0, + 1194.0, + 1348.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1188.0, + 1278.0, + 1188.0, + 1278.0, + 1224.0, + 294.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1219.0, + 1406.0, + 1219.0, + 1406.0, + 1255.0, + 538.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1248.0, + 783.0, + 1248.0, + 783.0, + 1285.0, + 294.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 1248.0, + 1146.0, + 1248.0, + 1146.0, + 1285.0, + 809.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 822.0, + 945.0, + 822.0, + 945.0, + 861.0, + 293.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 822.0, + 1406.0, + 822.0, + 1406.0, + 861.0, + 1032.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 854.0, + 426.0, + 854.0, + 426.0, + 892.0, + 294.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 854.0, + 604.0, + 854.0, + 604.0, + 892.0, + 503.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 854.0, + 838.0, + 854.0, + 838.0, + 892.0, + 689.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 854.0, + 1406.0, + 854.0, + 1406.0, + 892.0, + 859.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 884.0, + 861.0, + 884.0, + 861.0, + 923.0, + 290.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 884.0, + 1316.0, + 884.0, + 1316.0, + 923.0, + 919.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1362.0, + 884.0, + 1411.0, + 884.0, + 1411.0, + 923.0, + 1362.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 917.0, + 444.0, + 917.0, + 444.0, + 951.0, + 294.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 518.0, + 874.0, + 518.0, + 874.0, + 552.0, + 295.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 518.0, + 934.0, + 518.0, + 934.0, + 552.0, + 900.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 518.0, + 1406.0, + 518.0, + 1406.0, + 552.0, + 960.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 549.0, + 618.0, + 549.0, + 618.0, + 581.0, + 294.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 641.0, + 549.0, + 1041.0, + 549.0, + 1041.0, + 581.0, + 641.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 549.0, + 1405.0, + 549.0, + 1405.0, + 581.0, + 1071.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 577.0, + 498.0, + 577.0, + 498.0, + 614.0, + 295.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 527.0, + 577.0, + 689.0, + 577.0, + 689.0, + 614.0, + 527.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 963.0, + 1406.0, + 963.0, + 1406.0, + 998.0, + 295.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 989.0, + 1341.0, + 989.0, + 1341.0, + 1035.0, + 290.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 989.0, + 1411.0, + 989.0, + 1411.0, + 1035.0, + 1398.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1023.0, + 426.0, + 1023.0, + 426.0, + 1064.0, + 291.0, + 1064.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1290.0, + 953.0, + 1290.0, + 953.0, + 1326.0, + 297.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1290.0, + 1405.0, + 1290.0, + 1405.0, + 1326.0, + 980.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1321.0, + 805.0, + 1321.0, + 805.0, + 1357.0, + 295.0, + 1357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1967.0, + 454.0, + 1967.0, + 454.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 1967.0, + 1184.0, + 1967.0, + 1184.0, + 2009.0, + 476.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 1967.0, + 1407.0, + 1967.0, + 1407.0, + 2009.0, + 1375.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2000.0, + 409.0, + 2000.0, + 409.0, + 2040.0, + 293.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 2000.0, + 890.0, + 2000.0, + 890.0, + 2040.0, + 437.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 2000.0, + 1406.0, + 2000.0, + 1406.0, + 2040.0, + 1042.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1598.0, + 323.0, + 1598.0, + 323.0, + 1638.0, + 294.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1598.0, + 649.0, + 1598.0, + 649.0, + 1638.0, + 369.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 1598.0, + 948.0, + 1598.0, + 948.0, + 1638.0, + 670.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 1598.0, + 1172.0, + 1598.0, + 1172.0, + 1638.0, + 1059.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1237.0, + 1598.0, + 1405.0, + 1598.0, + 1405.0, + 1638.0, + 1237.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1630.0, + 613.0, + 1630.0, + 613.0, + 1666.0, + 294.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 1630.0, + 698.0, + 1630.0, + 698.0, + 1666.0, + 633.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1759.0, + 772.0, + 1759.0, + 772.0, + 1804.0, + 294.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1474.0, + 691.0, + 1474.0, + 691.0, + 1518.0, + 294.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1474.0, + 1008.0, + 1474.0, + 1008.0, + 1518.0, + 868.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1308.0, + 1474.0, + 1405.0, + 1474.0, + 1405.0, + 1518.0, + 1308.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1897.0, + 380.0, + 1897.0, + 380.0, + 1933.0, + 291.0, + 1933.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 21, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 294, + 473, + 1476, + 473, + 1476, + 1148, + 294, + 1148 + ], + "score": 0.983, + "html": "
Constraint on δ|Bound on Eq. 22Constraint on δ|Bound on Eq. 22Sampling from X ~ μ(0)
|δl ≤εE[f(exp(-eoll-X))]X~μ1(0)Xi ~ Lap(0,1) iid
1l2≤ eE(o[f(exp(IX-eoll-X2))]X~μ2(0)X=RuR~Γ(d,1)u ~U(aB2)
≤eE[f(exp(X-e1|-X)]X~μ(0)X=RuR~ Γ(d+1,1)u EU(B)
|/ lnuc ≤ e[f(exp(||U[[s]]vT-e[[eo]|lnuc- |slli)]s~μ1(0)U,v~u(O)X=U[s]]VTs ~ μ1,U,V ~U(O)
≤eE [f(exp(|IU[[s]]vT-∈[e]|l, - |sll)]s~μ∞(x)U,v~u(O)X=U[[s]IVTs ~ μ∞,U,V ~U(O)
" + }, + { + "category_id": 1, + "poly": [ + 296, + 1488, + 1405, + 1488, + 1405, + 1707, + 296, + 1707 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1351, + 1405, + 1351, + 1405, + 1474, + 298, + 1474 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 296, + 228, + 1406, + 228, + 1406, + 450, + 296, + 450 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 297, + 1717, + 1397, + 1717, + 1397, + 1788, + 297, + 1788 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 293, + 1969, + 1409, + 1969, + 1409, + 2039, + 293, + 2039 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 377, + 1875, + 1314, + 1875, + 1314, + 1954, + 377, + 1954 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 298, + 1825, + 1401, + 1825, + 1401, + 1861, + 298, + 1861 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.869 + }, + { + "category_id": 6, + "poly": [ + 296, + 1169, + 1407, + 1169, + 1407, + 1296, + 296, + 1296 + ], + "score": 0.805 + }, + { + "category_id": 1, + "poly": [ + 296, + 1169, + 1407, + 1169, + 1407, + 1296, + 296, + 1296 + ], + "score": 0.126 + }, + { + "category_id": 13, + "poly": [ + 676, + 352, + 765, + 352, + 765, + 390, + 676, + 390 + ], + "score": 0.94, + "latex": "\\tilde { f } ( u ^ { - \\alpha } )" + }, + { + "category_id": 13, + "poly": [ + 445, + 1262, + 648, + 1262, + 648, + 1300, + 445, + 1300 + ], + "score": 0.93, + "latex": "\\hat { B _ { p } } { = } \\left\\{ \\| z \\| _ { p } \\leq 1 \\right\\}" + }, + { + "category_id": 13, + "poly": [ + 589, + 1612, + 767, + 1612, + 767, + 1646, + 589, + 1646 + ], + "score": 0.93, + "latex": "\\bar { r } \\sim \\bar { \\Gamma } ( \\bar { d } + 1 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 766, + 1968, + 1051, + 1968, + 1051, + 2006, + 766, + 2006 + ], + "score": 0.93, + "latex": "p _ { Z } ( z ) = e ^ { - \\| z \\| _ { \\infty } } / ( d ! 2 ^ { d } )" + }, + { + "category_id": 13, + "poly": [ + 482, + 2002, + 869, + 2002, + 869, + 2038, + 482, + 2038 + ], + "score": 0.93, + "latex": "p _ { Z | R = r } ( \\bar { z } ) = 1 [ \\| z \\| _ { \\infty } \\leq r ] / ( 2 r ) ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 540, + 1490, + 662, + 1490, + 662, + 1523, + 540, + 1523 + ], + "score": 0.93, + "latex": "X \\sim \\mu ( x )" + }, + { + "category_id": 14, + "poly": [ + 373, + 1875, + 1323, + 1875, + 1323, + 1953, + 373, + 1953 + ], + "score": 0.92, + "latex": "\\int _ { \\mathbb { R } ^ { d } } e ^ { - \\| z \\| _ { \\infty } } d z = \\int _ { 0 } ^ { \\infty } \\left( \\int _ { \\mathbb { R } ^ { d } } 1 [ \\| z \\| _ { \\infty } = t ] d z \\right) e ^ { - t } d t = \\int _ { 0 } ^ { \\infty } 2 ^ { d } d t ^ { d - 1 } e ^ { - t } d t = d ! 2 ^ { d } \\ ." + }, + { + "category_id": 13, + "poly": [ + 1323, + 1613, + 1398, + 1613, + 1398, + 1646, + 1323, + 1646 + ], + "score": 0.92, + "latex": "[ - r , r ]" + }, + { + "category_id": 13, + "poly": [ + 772, + 1754, + 865, + 1754, + 865, + 1788, + 772, + 1788 + ], + "score": 0.92, + "latex": "[ - R , R ]" + }, + { + "category_id": 13, + "poly": [ + 873, + 1383, + 930, + 1383, + 930, + 1417, + 873, + 1417 + ], + "score": 0.92, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 1086, + 1490, + 1201, + 1490, + 1201, + 1523, + 1086, + 1523 + ], + "score": 0.92, + "latex": "Z \\sim \\mu ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 297, + 261, + 408, + 261, + 408, + 294, + 297, + 294 + ], + "score": 0.92, + "latex": "\\ell _ { 1 } , \\ell _ { 2 } , \\ell _ { \\infty }" + }, + { + "category_id": 13, + "poly": [ + 1101, + 1719, + 1294, + 1719, + 1294, + 1753, + 1101, + 1753 + ], + "score": 0.92, + "latex": "R \\sim \\Gamma ( d + 1 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 723, + 1384, + 788, + 1384, + 788, + 1415, + 723, + 1415 + ], + "score": 0.92, + "latex": "\\theta _ { a } , \\theta _ { b }" + }, + { + "category_id": 13, + "poly": [ + 531, + 1383, + 587, + 1383, + 587, + 1417, + 531, + 1417 + ], + "score": 0.92, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 316, + 767, + 429, + 767, + 429, + 796, + 316, + 796 + ], + "score": 0.91, + "latex": "\\| \\delta \\| _ { \\infty } \\le \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 693, + 1716, + 789, + 1716, + 789, + 1748, + 693, + 1748 + ], + "score": 0.91, + "latex": "Z \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 358, + 1521, + 415, + 1521, + 415, + 1554, + 358, + 1554 + ], + "score": 0.91, + "latex": "\\mu ( x )" + }, + { + "category_id": 13, + "poly": [ + 884, + 1491, + 1024, + 1491, + 1024, + 1519, + 884, + 1519 + ], + "score": 0.91, + "latex": "X = x + Z" + }, + { + "category_id": 13, + "poly": [ + 463, + 1673, + 513, + 1673, + 513, + 1708, + 463, + 1708 + ], + "score": 0.91, + "latex": "\\lVert \\cdot \\rVert _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 316, + 911, + 444, + 911, + 444, + 940, + 316, + 940 + ], + "score": 0.91, + "latex": "\\| \\delta \\| _ { n u c } \\le \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1000, + 1751, + 1116, + 1751, + 1116, + 1783, + 1000, + 1783 + ], + "score": 0.9, + "latex": "\\propto e ^ { - \\| z \\| _ { \\infty } }" + }, + { + "category_id": 13, + "poly": [ + 971, + 1553, + 1030, + 1553, + 1030, + 1586, + 971, + 1586 + ], + "score": 0.9, + "latex": "\\left\\| \\cdot \\right\\| _ { \\infty }" + }, + { + "category_id": 13, + "poly": [ + 1153, + 1825, + 1269, + 1825, + 1269, + 1856, + 1153, + 1856 + ], + "score": 0.9, + "latex": "\\propto e ^ { - \\| z \\| _ { \\infty } }" + }, + { + "category_id": 13, + "poly": [ + 1068, + 1522, + 1116, + 1522, + 1116, + 1555, + 1068, + 1555 + ], + "score": 0.9, + "latex": "\\left\\| \\cdot \\right\\| _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 476, + 1613, + 538, + 1613, + 538, + 1642, + 476, + 1642 + ], + "score": 0.89, + "latex": "d + 1" + }, + { + "category_id": 13, + "poly": [ + 298, + 1613, + 361, + 1613, + 361, + 1642, + 298, + 1642 + ], + "score": 0.89, + "latex": "d + 1" + }, + { + "category_id": 13, + "poly": [ + 1247, + 356, + 1322, + 356, + 1322, + 387, + 1247, + 387 + ], + "score": 0.89, + "latex": "\\alpha \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 298, + 2003, + 376, + 2003, + 376, + 2031, + 298, + 2031 + ], + "score": 0.89, + "latex": "R = r" + }, + { + "category_id": 13, + "poly": [ + 954, + 1522, + 1008, + 1522, + 1008, + 1553, + 954, + 1553 + ], + "score": 0.88, + "latex": "\\mu ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 886, + 1263, + 914, + 1263, + 914, + 1296, + 886, + 1296 + ], + "score": 0.88, + "latex": "\\ell _ { p }" + }, + { + "category_id": 13, + "poly": [ + 1339, + 479, + 1455, + 479, + 1455, + 513, + 1339, + 513 + ], + "score": 0.86, + "latex": "X \\sim \\mu ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 1000, + 1204, + 1034, + 1204, + 1034, + 1234, + 1000, + 1234 + ], + "score": 0.86, + "latex": "\\mu _ { p }" + }, + { + "category_id": 13, + "poly": [ + 880, + 388, + 899, + 388, + 899, + 419, + 880, + 419 + ], + "score": 0.86, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 516, + 1172, + 536, + 1172, + 536, + 1203, + 516, + 1203 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 462, + 1233, + 490, + 1233, + 490, + 1264, + 462, + 1264 + ], + "score": 0.85, + "latex": "\\ell _ { p }" + }, + { + "category_id": 13, + "poly": [ + 1096, + 293, + 1115, + 293, + 1115, + 324, + 1096, + 324 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 685, + 1175, + 714, + 1175, + 714, + 1201, + 685, + 1201 + ], + "score": 0.85, + "latex": "e _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1175, + 352, + 1196, + 352, + 1196, + 389, + 1175, + 389 + ], + "score": 0.85, + "latex": "\\tilde { f }" + }, + { + "category_id": 13, + "poly": [ + 564, + 1231, + 628, + 1231, + 628, + 1263, + 564, + 1263 + ], + "score": 0.84, + "latex": "\\mathcal { U } ( S )" + }, + { + "category_id": 13, + "poly": [ + 1059, + 1612, + 1136, + 1612, + 1136, + 1645, + 1059, + 1645 + ], + "score": 0.84, + "latex": "i \\in [ d ]" + }, + { + "category_id": 13, + "poly": [ + 638, + 1974, + 662, + 1974, + 662, + 2000, + 638, + 2000 + ], + "score": 0.83, + "latex": "Z" + }, + { + "category_id": 13, + "poly": [ + 1165, + 704, + 1308, + 704, + 1308, + 733, + 1165, + 733 + ], + "score": 0.82, + "latex": "u \\sim \\mathcal { U } ( \\partial B _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1349, + 263, + 1376, + 263, + 1376, + 289, + 1349, + 289 + ], + "score": 0.81, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 518, + 766, + 986, + 766, + 986, + 813, + 518, + 813 + ], + "score": 0.79, + "latex": "\\underset { X \\sim \\mu _ { \\infty } ( 0 ) } { \\mathrm { E } } [ f ( \\exp ( \\| X - \\epsilon \\mathbf { 1 } \\| _ { \\infty } - \\| X \\| _ { \\infty } ) ) ]" + }, + { + "category_id": 13, + "poly": [ + 505, + 1753, + 581, + 1753, + 581, + 1788, + 505, + 1788 + ], + "score": 0.78, + "latex": "i \\in [ d ]" + }, + { + "category_id": 13, + "poly": [ + 464, + 1755, + 494, + 1755, + 494, + 1785, + 464, + 1785 + ], + "score": 0.77, + "latex": "Z _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1166, + 814, + 1352, + 814, + 1352, + 843, + 1166, + 843 + ], + "score": 0.77, + "latex": "R \\sim \\Gamma ( d + 1 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 1018, + 1613, + 1049, + 1613, + 1049, + 1643, + 1018, + 1643 + ], + "score": 0.76, + "latex": "Z _ { i }" + }, + { + "category_id": 13, + "poly": [ + 505, + 1527, + 524, + 1527, + 524, + 1549, + 505, + 1549 + ], + "score": 0.74, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 1088, + 1233, + 1110, + 1233, + 1110, + 1259, + 1088, + 1259 + ], + "score": 0.73, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 937, + 1589, + 954, + 1589, + 954, + 1610, + 937, + 1610 + ], + "score": 0.73, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 1165, + 768, + 1267, + 768, + 1267, + 789, + 1165, + 789 + ], + "score": 0.73, + "latex": "X = R u" + }, + { + "category_id": 13, + "poly": [ + 1166, + 673, + 1304, + 673, + 1304, + 701, + 1166, + 701 + ], + "score": 0.72, + "latex": "R \\sim \\Gamma ( d , 1 )" + }, + { + "category_id": 13, + "poly": [ + 516, + 905, + 1133, + 905, + 1133, + 958, + 516, + 958 + ], + "score": 0.71, + "latex": "\\begin{array} { r } { \\underset { s \\sim \\mu _ { 1 } ( 0 ) } { \\mathrm { E } } \\left[ f \\big ( \\exp \\big ( \\big \\| U \\left[ \\left[ s \\right] \\right] V ^ { T } - \\epsilon \\left[ \\left[ e _ { 0 } \\right] \\right] \\big \\| _ { n u c } - \\left\\| s \\right\\| _ { 1 } \\big ) \\big ) \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1121, + 1232, + 1146, + 1232, + 1146, + 1260, + 1121, + 1260 + ], + "score": 0.7, + "latex": "\\mathcal { O }" + }, + { + "category_id": 13, + "poly": [ + 471, + 480, + 488, + 480, + 488, + 507, + 471, + 507 + ], + "score": 0.69, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 1166, + 845, + 1300, + 845, + 1300, + 873, + 1166, + 873 + ], + "score": 0.65, + "latex": "u \\in \\mathcal { U } ( B _ { \\infty } )" + }, + { + "category_id": 13, + "poly": [ + 1166, + 908, + 1339, + 908, + 1339, + 939, + 1166, + 939 + ], + "score": 0.6, + "latex": "X = U \\left[ [ s ] \\right] V ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 1163, + 540, + 1345, + 540, + 1345, + 576, + 1163, + 576 + ], + "score": 0.59, + "latex": "X _ { i } \\sim \\mathrm { L a p } ( 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 315, + 621, + 419, + 621, + 419, + 657, + 315, + 657 + ], + "score": 0.58, + "latex": "\\lVert \\delta \\rVert _ { 2 } \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1165, + 975, + 1415, + 975, + 1415, + 1008, + 1165, + 1008 + ], + "score": 0.54, + "latex": "s \\sim \\mu _ { 1 } , U , V \\sim \\mathcal { U } ( \\mathcal { O } )" + }, + { + "category_id": 13, + "poly": [ + 314, + 1040, + 420, + 1040, + 420, + 1076, + 314, + 1076 + ], + "score": 0.52, + "latex": "\\lVert \\delta \\rVert _ { \\star } \\leq \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1163, + 1109, + 1426, + 1109, + 1426, + 1144, + 1163, + 1144 + ], + "score": 0.48, + "latex": "s \\sim \\mu _ { \\infty } , U , V \\sim \\mathcal { U } ( \\mathcal { O } )" + }, + { + "category_id": 13, + "poly": [ + 518, + 538, + 966, + 538, + 966, + 593, + 518, + 593 + ], + "score": 0.48, + "latex": "\\underset { X \\sim \\mu _ { 1 } ( 0 ) } { \\mathrm { E } } [ f ( \\exp ( \\| X - \\epsilon e _ { 0 } \\| _ { 1 } - \\| X \\| _ { 1 } ) ) ]" + }, + { + "category_id": 13, + "poly": [ + 519, + 616, + 966, + 616, + 966, + 672, + 519, + 672 + ], + "score": 0.43, + "latex": "\\underset { X \\sim \\mu _ { 2 } ( 0 ) } { \\mathrm { E } } [ f ( \\exp ( \\| X - \\epsilon e _ { 0 } \\| _ { 2 } - \\| X \\| _ { 2 } ) ) ]" + }, + { + "category_id": 14, + "poly": [ + 518, + 538, + 965, + 538, + 965, + 593, + 518, + 593 + ], + "score": 0.38, + "latex": "\\underset { X \\sim \\mu _ { 1 } ( 0 ) } { \\mathrm { E } } [ f ( \\exp ( \\| X - \\epsilon e _ { 0 } \\| _ { 1 } - \\| X \\| _ { 1 } ) ) ]" + }, + { + "category_id": 13, + "poly": [ + 1163, + 810, + 1353, + 810, + 1353, + 876, + 1163, + 876 + ], + "score": 0.34, + "latex": "\\begin{array} { l } { R \\sim \\Gamma ( d + 1 , 1 ) } \\\\ { u \\in \\mathcal { U } ( B _ { \\infty } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 314, + 539, + 421, + 539, + 421, + 577, + 314, + 577 + ], + "score": 0.34, + "latex": "\\| \\delta \\| _ { 1 } \\le \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1166, + 625, + 1268, + 625, + 1268, + 648, + 1166, + 648 + ], + "score": 0.32, + "latex": "X = R u" + }, + { + "category_id": 13, + "poly": [ + 520, + 958, + 629, + 958, + 629, + 978, + 520, + 978 + ], + "score": 0.31, + "latex": "U , V { \\sim } \\mathcal U ( { \\mathcal O } )" + }, + { + "category_id": 14, + "poly": [ + 518, + 616, + 967, + 616, + 967, + 673, + 518, + 673 + ], + "score": 0.31, + "latex": "\\underset { X \\sim \\mu _ { 2 } ( 0 ) } { \\mathrm { E } } [ f ( \\exp ( \\| X - \\epsilon e _ { 0 } \\| _ { 2 } - \\| X \\| _ { 2 } ) ) ]" + }, + { + "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": [ + 830.0, + 2084.0, + 870.0, + 2084.0, + 870.0, + 2123.0, + 830.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1170.0, + 515.0, + 1170.0, + 515.0, + 1203.0, + 294.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 1170.0, + 684.0, + 1170.0, + 684.0, + 1203.0, + 537.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 1170.0, + 1405.0, + 1170.0, + 1405.0, + 1203.0, + 715.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1202.0, + 999.0, + 1202.0, + 999.0, + 1235.0, + 295.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1202.0, + 1405.0, + 1202.0, + 1405.0, + 1235.0, + 1035.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1232.0, + 461.0, + 1232.0, + 461.0, + 1266.0, + 295.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 1232.0, + 563.0, + 1232.0, + 563.0, + 1266.0, + 491.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1232.0, + 1087.0, + 1232.0, + 1087.0, + 1266.0, + 629.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 1232.0, + 1120.0, + 1232.0, + 1120.0, + 1266.0, + 1111.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 1232.0, + 1405.0, + 1232.0, + 1405.0, + 1266.0, + 1147.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1261.0, + 444.0, + 1261.0, + 444.0, + 1298.0, + 293.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 1261.0, + 885.0, + 1261.0, + 885.0, + 1298.0, + 649.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1261.0, + 989.0, + 1261.0, + 989.0, + 1298.0, + 915.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1485.0, + 539.0, + 1485.0, + 539.0, + 1526.0, + 293.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 1485.0, + 883.0, + 1485.0, + 883.0, + 1526.0, + 663.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 1485.0, + 1085.0, + 1485.0, + 1085.0, + 1526.0, + 1025.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1202.0, + 1485.0, + 1406.0, + 1485.0, + 1406.0, + 1526.0, + 1202.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1518.0, + 357.0, + 1518.0, + 357.0, + 1559.0, + 293.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 1518.0, + 504.0, + 1518.0, + 504.0, + 1559.0, + 416.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 1518.0, + 953.0, + 1518.0, + 953.0, + 1559.0, + 525.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1518.0, + 1067.0, + 1518.0, + 1067.0, + 1559.0, + 1009.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 1518.0, + 1405.0, + 1518.0, + 1405.0, + 1559.0, + 1117.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1544.0, + 970.0, + 1544.0, + 970.0, + 1591.0, + 290.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1031.0, + 1544.0, + 1407.0, + 1544.0, + 1407.0, + 1591.0, + 1031.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1580.0, + 936.0, + 1580.0, + 936.0, + 1617.0, + 294.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1580.0, + 1406.0, + 1580.0, + 1406.0, + 1617.0, + 955.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1612.0, + 297.0, + 1612.0, + 297.0, + 1647.0, + 294.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 1612.0, + 475.0, + 1612.0, + 475.0, + 1647.0, + 362.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 1612.0, + 588.0, + 1612.0, + 588.0, + 1647.0, + 539.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 1612.0, + 1017.0, + 1612.0, + 1017.0, + 1647.0, + 768.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 1612.0, + 1058.0, + 1612.0, + 1058.0, + 1647.0, + 1050.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 1612.0, + 1322.0, + 1612.0, + 1322.0, + 1647.0, + 1137.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1612.0, + 1408.0, + 1612.0, + 1408.0, + 1647.0, + 1399.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1641.0, + 1407.0, + 1641.0, + 1407.0, + 1677.0, + 293.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1670.0, + 462.0, + 1670.0, + 462.0, + 1711.0, + 293.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 1670.0, + 1189.0, + 1670.0, + 1189.0, + 1711.0, + 514.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1350.0, + 1405.0, + 1350.0, + 1405.0, + 1387.0, + 293.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1383.0, + 530.0, + 1383.0, + 530.0, + 1419.0, + 293.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 1383.0, + 722.0, + 1383.0, + 722.0, + 1419.0, + 588.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1383.0, + 872.0, + 1383.0, + 872.0, + 1419.0, + 789.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 931.0, + 1383.0, + 1406.0, + 1383.0, + 1406.0, + 1419.0, + 931.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1414.0, + 1407.0, + 1414.0, + 1407.0, + 1447.0, + 293.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1443.0, + 668.0, + 1443.0, + 668.0, + 1475.0, + 295.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 228.0, + 1407.0, + 228.0, + 1407.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 260.0, + 1348.0, + 260.0, + 1348.0, + 299.0, + 409.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 260.0, + 1407.0, + 260.0, + 1407.0, + 299.0, + 1377.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 290.0, + 1095.0, + 290.0, + 1095.0, + 328.0, + 291.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 290.0, + 1404.0, + 290.0, + 1404.0, + 328.0, + 1116.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 319.0, + 1404.0, + 319.0, + 1404.0, + 358.0, + 293.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 354.0, + 675.0, + 354.0, + 675.0, + 393.0, + 293.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 354.0, + 1174.0, + 354.0, + 1174.0, + 393.0, + 766.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 354.0, + 1246.0, + 354.0, + 1246.0, + 393.0, + 1197.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 354.0, + 1406.0, + 354.0, + 1406.0, + 393.0, + 1323.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 384.0, + 879.0, + 384.0, + 879.0, + 423.0, + 294.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 384.0, + 1406.0, + 384.0, + 1406.0, + 423.0, + 900.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 416.0, + 779.0, + 416.0, + 779.0, + 454.0, + 293.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1712.0, + 692.0, + 1712.0, + 692.0, + 1757.0, + 293.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1712.0, + 1100.0, + 1712.0, + 1100.0, + 1757.0, + 790.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 1712.0, + 1405.0, + 1712.0, + 1405.0, + 1757.0, + 1295.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1751.0, + 463.0, + 1751.0, + 463.0, + 1789.0, + 294.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 1751.0, + 504.0, + 1751.0, + 504.0, + 1789.0, + 495.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 1751.0, + 771.0, + 1751.0, + 771.0, + 1789.0, + 582.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1751.0, + 999.0, + 1751.0, + 999.0, + 1789.0, + 866.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 1751.0, + 1131.0, + 1751.0, + 1131.0, + 1789.0, + 1117.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1964.0, + 637.0, + 1964.0, + 637.0, + 2009.0, + 292.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 1964.0, + 765.0, + 1964.0, + 765.0, + 2009.0, + 663.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1964.0, + 1407.0, + 1964.0, + 1407.0, + 2009.0, + 1052.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 377.0, + 1999.0, + 481.0, + 1999.0, + 481.0, + 2040.0, + 377.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 1999.0, + 1406.0, + 1999.0, + 1406.0, + 2040.0, + 870.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1822.0, + 1152.0, + 1822.0, + 1152.0, + 1866.0, + 293.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 1822.0, + 1401.0, + 1822.0, + 1401.0, + 1866.0, + 1270.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1170.0, + 515.0, + 1170.0, + 515.0, + 1203.0, + 294.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 1170.0, + 684.0, + 1170.0, + 684.0, + 1203.0, + 537.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 1170.0, + 1405.0, + 1170.0, + 1405.0, + 1203.0, + 715.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1202.0, + 999.0, + 1202.0, + 999.0, + 1235.0, + 295.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1202.0, + 1405.0, + 1202.0, + 1405.0, + 1235.0, + 1035.0, + 1235.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1232.0, + 461.0, + 1232.0, + 461.0, + 1266.0, + 295.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 1232.0, + 563.0, + 1232.0, + 563.0, + 1266.0, + 491.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1232.0, + 1087.0, + 1232.0, + 1087.0, + 1266.0, + 629.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 1232.0, + 1120.0, + 1232.0, + 1120.0, + 1266.0, + 1111.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 1232.0, + 1405.0, + 1232.0, + 1405.0, + 1266.0, + 1147.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1261.0, + 444.0, + 1261.0, + 444.0, + 1298.0, + 293.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 1261.0, + 885.0, + 1261.0, + 885.0, + 1298.0, + 649.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1261.0, + 989.0, + 1261.0, + 989.0, + 1298.0, + 915.0, + 1298.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 22, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 295, + 1258, + 1408, + 1258, + 1408, + 1418, + 295, + 1418 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1819, + 1406, + 1819, + 1406, + 1949, + 297, + 1949 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 296, + 1514, + 1406, + 1514, + 1406, + 1645, + 296, + 1645 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 296, + 458, + 1405, + 458, + 1405, + 569, + 296, + 569 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 1077, + 1404, + 1077, + 1404, + 1172, + 297, + 1172 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 300, + 603, + 1402, + 603, + 1402, + 724, + 300, + 724 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 585, + 739, + 1112, + 739, + 1112, + 931, + 585, + 931 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 597, + 1419, + 1100, + 1419, + 1100, + 1495, + 597, + 1495 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 498, + 1965, + 1206, + 1965, + 1206, + 2042, + 498, + 2042 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 292, + 227, + 1404, + 227, + 1404, + 294, + 292, + 294 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 352, + 1661, + 1302, + 1661, + 1302, + 1738, + 352, + 1738 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 298, + 308, + 1403, + 308, + 1403, + 392, + 298, + 392 + ], + "score": 0.942 + }, + { + "category_id": 2, + "poly": [ + 298, + 73, + 817, + 73, + 817, + 106, + 298, + 106 + ], + "score": 0.921 + }, + { + "category_id": 0, + "poly": [ + 300, + 1766, + 796, + 1766, + 796, + 1799, + 300, + 1799 + ], + "score": 0.918 + }, + { + "category_id": 0, + "poly": [ + 297, + 1205, + 1033, + 1205, + 1033, + 1238, + 297, + 1238 + ], + "score": 0.911 + }, + { + "category_id": 0, + "poly": [ + 297, + 1022, + 1011, + 1022, + 1011, + 1053, + 297, + 1053 + ], + "score": 0.909 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1445, + 1400, + 1445, + 1400, + 1476, + 1351, + 1476 + ], + "score": 0.892 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1992, + 1401, + 1992, + 1401, + 2024, + 1351, + 2024 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.877 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1689, + 1400, + 1689, + 1400, + 1719, + 1351, + 1719 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 1374, + 950, + 1403, + 950, + 1403, + 980, + 1374, + 980 + ], + "score": 0.838 + }, + { + "category_id": 2, + "poly": [ + 1374, + 408, + 1403, + 408, + 1403, + 436, + 1374, + 436 + ], + "score": 0.818 + }, + { + "category_id": 13, + "poly": [ + 575, + 492, + 720, + 492, + 720, + 539, + 575, + 539 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { Z = R \\frac { Z ^ { \\prime } } { \\Vert Z ^ { \\prime } \\Vert _ { 2 } } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 350, + 1659, + 1302, + 1659, + 1302, + 1738, + 350, + 1738 + ], + "score": 0.94, + "latex": "\\bar { Z } - \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } - \\frac { 3 R \\log ( 3 / \\zeta ) } { N } \\leq m \\leq \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { N } ." + }, + { + "category_id": 14, + "poly": [ + 596, + 1416, + 1103, + 1416, + 1103, + 1494, + 596, + 1494 + ], + "score": 0.93, + "latex": "| \\bar { Z } - m | \\leq \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { t } ." + }, + { + "category_id": 13, + "poly": [ + 1123, + 460, + 1287, + 460, + 1287, + 495, + 1123, + 495 + ], + "score": 0.93, + "latex": "Z ^ { \\prime } \\sim \\mathcal { N } ( 0 , I )" + }, + { + "category_id": 13, + "poly": [ + 544, + 605, + 789, + 605, + 789, + 653, + 544, + 653 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { W = \\frac { Z ^ { \\prime } } { \\left. Z ^ { \\prime } \\right. _ { 2 } } \\sim \\mathcal { U } ( B _ { 2 } ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 586, + 738, + 1114, + 738, + 1114, + 933, + 586, + 933 + ], + "score": 0.93, + "latex": "\\begin{array} { l } { { \\displaystyle p _ { Z } ( z ) = \\int _ { 0 } ^ { \\infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r } } \\\\ { { \\displaystyle \\propto \\int _ { 0 } ^ { \\infty } \\frac { 1 [ \\| z \\| _ { 2 } = r ] \\Gamma ( d / 2 ) } { 2 \\pi ^ { d / 2 } r ^ { d - 1 } } r ^ { d - 1 } e ^ { - r ^ { p } } d r } } \\\\ { { \\displaystyle \\propto e ^ { - \\| z \\| _ { 2 } ^ { p } } } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 679, + 623, + 679, + 623, + 724, + 297, + 724 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { p _ { Z | R = r } ( z ) = \\frac { 1 [ \\| z \\| _ { 2 } = r ] \\Gamma ( d / 2 ) } { 2 \\pi ^ { d / 2 } r ^ { d - 1 } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 591, + 1290, + 781, + 1290, + 781, + 1333, + 591, + 1333 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\bar { Z } = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } \\bar { Z _ { i } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 863, + 682, + 1077, + 682, + 1077, + 721, + 863, + 721 + ], + "score": 0.93, + "latex": "p _ { R } ( r ) \\propto r ^ { d - 1 } e ^ { - r ^ { p } }" + }, + { + "category_id": 13, + "poly": [ + 843, + 1550, + 940, + 1550, + 940, + 1585, + 843, + 1585 + ], + "score": 0.93, + "latex": "O ( 1 / N )" + }, + { + "category_id": 13, + "poly": [ + 1037, + 496, + 1133, + 496, + 1133, + 532, + 1037, + 532 + ], + "score": 0.93, + "latex": "\\Gamma _ { p } ( d , a )" + }, + { + "category_id": 14, + "poly": [ + 497, + 1964, + 1208, + 1964, + 1208, + 2042, + 497, + 2042 + ], + "score": 0.93, + "latex": "\\operatorname { E } _ { X \\sim \\rho } ^ { } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X _ { i } ) ) ] \\leq \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { N } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { N } ." + }, + { + "category_id": 13, + "poly": [ + 1206, + 1548, + 1327, + 1548, + 1327, + 1585, + 1206, + 1585 + ], + "score": 0.92, + "latex": "O ( 1 / \\sqrt { N } )" + }, + { + "category_id": 13, + "poly": [ + 1108, + 1882, + 1345, + 1882, + 1345, + 1917, + 1108, + 1917 + ], + "score": 0.92, + "latex": "Z _ { i } = f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X _ { i } ) )" + }, + { + "category_id": 14, + "poly": [ + 310, + 307, + 1416, + 307, + 1416, + 393, + 310, + 393 + ], + "score": 0.92, + "latex": "_ { _ { D G } } ( z ) = \\int _ { 0 } ^ { \\infty } p _ { Z | R = r } ( z ) p _ { R } ( r ) d r = \\int _ { 0 } ^ { \\infty } \\frac { 1 [ \\| z \\| _ { \\infty } \\leq r ] } { ( 2 r ) ^ { d } } \\frac { r ^ { d } e ^ { - r } } { d ! } d r = \\frac { 1 } { d ! 2 ^ { d } } \\int _ { \\| z \\| _ { \\infty } } ^ { \\infty } e ^ { - r } d r = \\frac { e ^ { - \\| z \\| _ { \\infty } } } { d ! 2 ^ { d } } ." + }, + { + "category_id": 13, + "poly": [ + 961, + 1853, + 1108, + 1853, + 1108, + 1886, + 961, + 1886 + ], + "score": 0.92, + "latex": "f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( \\cdot ) )" + }, + { + "category_id": 13, + "poly": [ + 297, + 496, + 392, + 496, + 392, + 532, + 297, + 532 + ], + "score": 0.92, + "latex": "\\Gamma _ { p } ( d , 1 )" + }, + { + "category_id": 13, + "poly": [ + 341, + 1261, + 477, + 1261, + 477, + 1293, + 341, + 1293 + ], + "score": 0.92, + "latex": "Z _ { 1 } , \\dots , Z _ { N }" + }, + { + "category_id": 13, + "poly": [ + 710, + 459, + 808, + 459, + 808, + 490, + 710, + 490 + ], + "score": 0.92, + "latex": "Z \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 1116, + 1291, + 1397, + 1291, + 1397, + 1333, + 1116, + 1333 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\bar { \\sigma } ^ { 2 } = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } ( Z _ { i } - \\bar { Z } ) ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1240, + 1517, + 1374, + 1517, + 1374, + 1548, + 1240, + 1548 + ], + "score": 0.9, + "latex": "Z _ { 1 } , \\dots , Z _ { N }" + }, + { + "category_id": 13, + "poly": [ + 1221, + 232, + 1287, + 232, + 1287, + 260, + 1221, + 260 + ], + "score": 0.89, + "latex": "d + 1" + }, + { + "category_id": 13, + "poly": [ + 855, + 493, + 963, + 493, + 963, + 526, + 855, + 526 + ], + "score": 0.89, + "latex": "\\propto e ^ { - \\| z \\| _ { 2 } ^ { p } }" + }, + { + "category_id": 13, + "poly": [ + 296, + 1389, + 360, + 1389, + 360, + 1421, + 296, + 1421 + ], + "score": 0.89, + "latex": "1 - \\zeta" + }, + { + "category_id": 13, + "poly": [ + 621, + 539, + 689, + 539, + 689, + 567, + 621, + 567 + ], + "score": 0.89, + "latex": "p > 0" + }, + { + "category_id": 13, + "poly": [ + 560, + 1887, + 702, + 1887, + 702, + 1914, + 560, + 1914 + ], + "score": 0.89, + "latex": "X _ { 1 } , \\ldots , X _ { N }" + }, + { + "category_id": 13, + "poly": [ + 1036, + 1614, + 1101, + 1614, + 1101, + 1645, + 1036, + 1645 + ], + "score": 0.89, + "latex": "1 - \\zeta" + }, + { + "category_id": 13, + "poly": [ + 1003, + 1916, + 1066, + 1916, + 1066, + 1948, + 1003, + 1948 + ], + "score": 0.89, + "latex": "1 - \\zeta" + }, + { + "category_id": 13, + "poly": [ + 298, + 262, + 363, + 262, + 363, + 291, + 298, + 291 + ], + "score": 0.88, + "latex": "d + 1" + }, + { + "category_id": 13, + "poly": [ + 372, + 1914, + 404, + 1914, + 404, + 1943, + 372, + 1943 + ], + "score": 0.88, + "latex": "\\bar { \\sigma } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1065, + 613, + 1092, + 613, + 1092, + 642, + 1065, + 642 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 565, + 651, + 592, + 651, + 592, + 679, + 565, + 679 + ], + "score": 0.85, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1343, + 462, + 1403, + 462, + 1403, + 492, + 1343, + 492 + ], + "score": 0.85, + "latex": "R \\sim" + }, + { + "category_id": 13, + "poly": [ + 297, + 1913, + 321, + 1913, + 321, + 1943, + 297, + 1943 + ], + "score": 0.84, + "latex": "\\bar { Z }" + }, + { + "category_id": 13, + "poly": [ + 1230, + 1262, + 1254, + 1262, + 1254, + 1288, + 1230, + 1288 + ], + "score": 0.84, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 1242, + 649, + 1267, + 649, + 1267, + 676, + 1242, + 676 + ], + "score": 0.83, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 1142, + 649, + 1167, + 649, + 1167, + 676, + 1142, + 676 + ], + "score": 0.82, + "latex": "Z" + }, + { + "category_id": 13, + "poly": [ + 476, + 1855, + 496, + 1855, + 496, + 1880, + 476, + 1880 + ], + "score": 0.82, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 658, + 232, + 683, + 232, + 683, + 258, + 658, + 258 + ], + "score": 0.81, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 430, + 1884, + 458, + 1884, + 458, + 1910, + 430, + 1910 + ], + "score": 0.81, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 819, + 537, + 837, + 537, + 837, + 563, + 819, + 563 + ], + "score": 0.81, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 761, + 651, + 785, + 651, + 785, + 676, + 761, + 676 + ], + "score": 0.81, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 1090, + 1583, + 1113, + 1583, + 1113, + 1609, + 1090, + 1609 + ], + "score": 0.81, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 705, + 688, + 729, + 688, + 729, + 715, + 705, + 715 + ], + "score": 0.8, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 1374, + 1856, + 1397, + 1856, + 1397, + 1880, + 1374, + 1880 + ], + "score": 0.79, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 949, + 542, + 967, + 542, + 967, + 563, + 949, + 563 + ], + "score": 0.79, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 934, + 1891, + 950, + 1891, + 950, + 1915, + 934, + 1915 + ], + "score": 0.78, + "latex": "\\rho" + }, + { + "category_id": 13, + "poly": [ + 735, + 1619, + 754, + 1619, + 754, + 1645, + 735, + 1645 + ], + "score": 0.75, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 548, + 1858, + 567, + 1858, + 567, + 1880, + 548, + 1880 + ], + "score": 0.74, + "latex": "\\kappa" + }, + { + "category_id": 13, + "poly": [ + 1371, + 1269, + 1398, + 1269, + 1398, + 1288, + 1371, + 1288 + ], + "score": 0.63, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 298, + 647, + 352, + 647, + 352, + 677, + 298, + 677 + ], + "score": 0.43, + "latex": "R W" + }, + { + "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, + 1766.0, + 800.0, + 1766.0, + 800.0, + 1801.0, + 296.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1206.0, + 1036.0, + 1206.0, + 1036.0, + 1241.0, + 296.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1022.0, + 1012.0, + 1022.0, + 1012.0, + 1054.0, + 297.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2083.0, + 871.0, + 2083.0, + 871.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 955.0, + 1403.0, + 955.0, + 1403.0, + 982.0, + 1377.0, + 982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 411.0, + 1403.0, + 411.0, + 1403.0, + 439.0, + 1377.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 279.0, + 1259.0, + 340.0, + 1259.0, + 340.0, + 1347.0, + 279.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 1259.0, + 590.0, + 1259.0, + 590.0, + 1347.0, + 478.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 1259.0, + 1115.0, + 1259.0, + 1115.0, + 1347.0, + 782.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1259.0, + 1419.0, + 1259.0, + 1419.0, + 1347.0, + 1399.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1326.0, + 1406.0, + 1326.0, + 1406.0, + 1364.0, + 293.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1354.0, + 1407.0, + 1354.0, + 1407.0, + 1395.0, + 290.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1385.0, + 295.0, + 1385.0, + 295.0, + 1427.0, + 290.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1385.0, + 375.0, + 1385.0, + 375.0, + 1427.0, + 361.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1819.0, + 1406.0, + 1819.0, + 1406.0, + 1856.0, + 294.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1852.0, + 475.0, + 1852.0, + 475.0, + 1889.0, + 295.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1852.0, + 547.0, + 1852.0, + 547.0, + 1889.0, + 497.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 1852.0, + 960.0, + 1852.0, + 960.0, + 1889.0, + 568.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 1852.0, + 1373.0, + 1852.0, + 1373.0, + 1889.0, + 1109.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 1852.0, + 1407.0, + 1852.0, + 1407.0, + 1889.0, + 1398.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 429.0, + 1882.0, + 429.0, + 1919.0, + 294.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 1882.0, + 559.0, + 1882.0, + 559.0, + 1919.0, + 459.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 1882.0, + 933.0, + 1882.0, + 933.0, + 1919.0, + 703.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 1882.0, + 1107.0, + 1882.0, + 1107.0, + 1919.0, + 951.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 1882.0, + 1406.0, + 1882.0, + 1406.0, + 1919.0, + 1346.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1910.0, + 371.0, + 1910.0, + 371.0, + 1954.0, + 322.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1910.0, + 1002.0, + 1910.0, + 1002.0, + 1954.0, + 405.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 1910.0, + 1080.0, + 1910.0, + 1080.0, + 1954.0, + 1067.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1515.0, + 1239.0, + 1515.0, + 1239.0, + 1552.0, + 294.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 1515.0, + 1407.0, + 1515.0, + 1407.0, + 1552.0, + 1375.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1547.0, + 842.0, + 1547.0, + 842.0, + 1588.0, + 294.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 1547.0, + 1205.0, + 1547.0, + 1205.0, + 1588.0, + 941.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 1547.0, + 1409.0, + 1547.0, + 1409.0, + 1588.0, + 1328.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1581.0, + 1089.0, + 1581.0, + 1089.0, + 1618.0, + 294.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1581.0, + 1407.0, + 1581.0, + 1407.0, + 1618.0, + 1114.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1612.0, + 734.0, + 1612.0, + 734.0, + 1649.0, + 295.0, + 1649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 1612.0, + 1035.0, + 1612.0, + 1035.0, + 1649.0, + 755.0, + 1649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.0, + 1612.0, + 1116.0, + 1612.0, + 1116.0, + 1649.0, + 1102.0, + 1649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 457.0, + 709.0, + 457.0, + 709.0, + 494.0, + 295.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 457.0, + 1122.0, + 457.0, + 1122.0, + 494.0, + 809.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 457.0, + 1342.0, + 457.0, + 1342.0, + 494.0, + 1288.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 490.0, + 296.0, + 490.0, + 296.0, + 547.0, + 293.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 490.0, + 574.0, + 490.0, + 574.0, + 547.0, + 393.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 490.0, + 854.0, + 490.0, + 854.0, + 547.0, + 721.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 964.0, + 490.0, + 1036.0, + 490.0, + 1036.0, + 547.0, + 964.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 490.0, + 1406.0, + 490.0, + 1406.0, + 547.0, + 1134.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 533.0, + 620.0, + 533.0, + 620.0, + 569.0, + 295.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 533.0, + 818.0, + 533.0, + 818.0, + 569.0, + 690.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 533.0, + 948.0, + 533.0, + 948.0, + 569.0, + 838.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 533.0, + 978.0, + 533.0, + 978.0, + 569.0, + 968.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1078.0, + 1402.0, + 1078.0, + 1402.0, + 1112.0, + 294.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1110.0, + 1405.0, + 1110.0, + 1405.0, + 1144.0, + 295.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1140.0, + 637.0, + 1140.0, + 637.0, + 1173.0, + 295.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 604.0, + 543.0, + 604.0, + 543.0, + 656.0, + 295.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 604.0, + 1064.0, + 604.0, + 1064.0, + 656.0, + 790.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 604.0, + 1410.0, + 604.0, + 1410.0, + 656.0, + 1093.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 642.0, + 297.0, + 642.0, + 297.0, + 685.0, + 294.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 642.0, + 564.0, + 642.0, + 564.0, + 685.0, + 353.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 642.0, + 760.0, + 642.0, + 760.0, + 685.0, + 593.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 786.0, + 642.0, + 1141.0, + 642.0, + 1141.0, + 685.0, + 786.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 642.0, + 1241.0, + 642.0, + 1241.0, + 685.0, + 1168.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 642.0, + 1404.0, + 642.0, + 1404.0, + 685.0, + 1268.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 624.0, + 675.0, + 704.0, + 675.0, + 704.0, + 727.0, + 624.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 675.0, + 862.0, + 675.0, + 862.0, + 727.0, + 730.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 675.0, + 1178.0, + 675.0, + 1178.0, + 727.0, + 1078.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 683.5, + 466.0, + 683.5, + 466.0, + 724.5, + 289.0, + 724.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 225.0, + 657.0, + 225.0, + 657.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 225.0, + 1220.0, + 225.0, + 1220.0, + 266.0, + 684.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 225.0, + 1403.0, + 225.0, + 1403.0, + 266.0, + 1288.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 259.0, + 439.0, + 259.0, + 439.0, + 293.0, + 364.0, + 293.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 23, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1413, + 1402, + 1413, + 1402, + 1510, + 299, + 1510 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1401, + 1942, + 1401, + 2036, + 300, + 2036 + ], + "score": 0.972 + }, + { + "category_id": 8, + "poly": [ + 342, + 1523, + 1353, + 1523, + 1353, + 1667, + 342, + 1667 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 614, + 1310, + 1082, + 1310, + 1082, + 1400, + 614, + 1400 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 384, + 1835, + 1305, + 1835, + 1305, + 1930, + 384, + 1930 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 293, + 1135, + 1401, + 1135, + 1401, + 1197, + 293, + 1197 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 295, + 228, + 1403, + 228, + 1403, + 293, + 295, + 293 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 297, + 1757, + 1403, + 1757, + 1403, + 1821, + 297, + 1821 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 297, + 1680, + 1402, + 1680, + 1402, + 1744, + 297, + 1744 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 297, + 307, + 1402, + 307, + 1402, + 371, + 297, + 371 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 754, + 1212, + 945, + 1212, + 945, + 1251, + 754, + 1251 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 297, + 1263, + 719, + 1263, + 719, + 1295, + 297, + 1295 + ], + "score": 0.924 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 817, + 74, + 817, + 106, + 298, + 106 + ], + "score": 0.918 + }, + { + "category_id": 0, + "poly": [ + 300, + 1078, + 687, + 1078, + 687, + 1111, + 300, + 1111 + ], + "score": 0.902 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1339, + 1400, + 1339, + 1400, + 1370, + 1352, + 1370 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.876 + }, + { + "category_id": 0, + "poly": [ + 300, + 403, + 761, + 403, + 761, + 436, + 300, + 436 + ], + "score": 0.861 + }, + { + "category_id": 1, + "poly": [ + 322, + 448, + 829, + 448, + 829, + 479, + 322, + 479 + ], + "score": 0.78 + }, + { + "category_id": 1, + "poly": [ + 316, + 481, + 1405, + 481, + 1405, + 579, + 316, + 579 + ], + "score": 0.748 + }, + { + "category_id": 8, + "poly": [ + 603, + 862, + 1122, + 862, + 1122, + 949, + 603, + 949 + ], + "score": 0.415 + }, + { + "category_id": 1, + "poly": [ + 363, + 675, + 1267, + 675, + 1267, + 711, + 363, + 711 + ], + "score": 0.376 + }, + { + "category_id": 1, + "poly": [ + 323, + 957, + 503, + 957, + 503, + 1019, + 323, + 1019 + ], + "score": 0.275 + }, + { + "category_id": 1, + "poly": [ + 338, + 634, + 1197, + 634, + 1197, + 672, + 338, + 672 + ], + "score": 0.182 + }, + { + "category_id": 1, + "poly": [ + 365, + 579, + 527, + 579, + 527, + 608, + 365, + 608 + ], + "score": 0.096 + }, + { + "category_id": 14, + "poly": [ + 341, + 1521, + 1360, + 1521, + 1360, + 1671, + 341, + 1671 + ], + "score": 0.94, + "latex": "R _ { \\alpha } ( \\mu ( x ^ { \\prime } ) \\| \\mu ( x ) ) = \\| x - x ^ { \\prime } \\| _ { 0 } \\left( \\frac { \\log \\left( p \\left( \\frac { q } { ( K - 1 ) p } \\right) ^ { ( \\alpha ) } + \\frac { q } { K - 1 } \\left( \\frac { ( K - 1 ) p } { q } \\right) ^ { ( \\alpha ) } + \\left( \\frac { K - 2 } { K - 1 } \\right) q \\right) } { \\alpha - 1 } \\right)" + }, + { + "category_id": 14, + "poly": [ + 615, + 1306, + 1086, + 1306, + 1086, + 1402, + 615, + 1402 + ], + "score": 0.94, + "latex": "\\mu ( x ) [ z ] = \\prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } { \\left( { \\frac { q } { K - 1 } } \\right) } ^ { 1 [ z _ { i } \\neq x _ { i } ] }" + }, + { + "category_id": 13, + "poly": [ + 608, + 2007, + 737, + 2007, + 737, + 2036, + 608, + 2036 + ], + "score": 0.94, + "latex": "\\mu ( x ) , \\mu ( x ^ { \\prime } )" + }, + { + "category_id": 14, + "poly": [ + 388, + 1834, + 1311, + 1834, + 1311, + 1931, + 388, + 1931 + ], + "score": 0.93, + "latex": "\\mu ( x ) [ z ] \\propto \\prod _ { i = 1 } ^ { d } p ^ { 1 [ z _ { i } = x _ { i } ] } \\bigg ( \\frac { q } { K - 1 } \\bigg ) ^ { 1 [ z _ { i } \\neq x _ { i } ] } \\exp \\left( \\sum _ { i = 1 } ^ { d - 1 } \\eta 1 [ z _ { i } = x _ { i } ] 1 [ z _ { i + 1 } = x _ { i + 1 } ] \\right) \\ ." + }, + { + "category_id": 13, + "poly": [ + 409, + 711, + 566, + 711, + 566, + 761, + 409, + 761 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\bar { Z } \\frac { \\sum _ { i = 1 } ^ { \\tilde { N } } Z ^ { i } } { N } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 753, + 1212, + 946, + 1212, + 946, + 1250, + 753, + 1250 + ], + "score": 0.92, + "latex": "A = \\{ 1 , \\ldots , K \\}" + }, + { + "category_id": 13, + "poly": [ + 457, + 670, + 656, + 670, + 656, + 708, + 457, + 708 + ], + "score": 0.92, + "latex": "X ^ { 1 } , \\dotsc , X ^ { \\tilde { N } } \\dotsc \\rho" + }, + { + "category_id": 13, + "poly": [ + 774, + 1165, + 871, + 1165, + 871, + 1194, + 774, + 1194 + ], + "score": 0.91, + "latex": "\\mathcal { X } = A ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 347, + 1446, + 403, + 1446, + 403, + 1482, + 347, + 1482 + ], + "score": 0.91, + "latex": "\\frac { q } { K - 1 }" + }, + { + "category_id": 13, + "poly": [ + 810, + 675, + 1066, + 675, + 1066, + 712, + 810, + 712 + ], + "score": 0.91, + "latex": "Z ^ { i } \\gets f _ { \\lambda } ^ { * } \\big ( \\kappa - \\phi \\big ( X ^ { i } \\big ) \\big )" + }, + { + "category_id": 13, + "poly": [ + 458, + 478, + 657, + 478, + 657, + 510, + 458, + 510 + ], + "score": 0.91, + "latex": "X ^ { 1 } , \\ldots , X ^ { N } \\sim \\rho" + }, + { + "category_id": 13, + "poly": [ + 457, + 512, + 739, + 512, + 739, + 554, + 457, + 554 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } f _ { \\lambda } ^ { * } \\big ( \\kappa - \\phi \\big ( X ^ { i } \\big ) \\big ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 531, + 1480, + 602, + 1480, + 602, + 1507, + 531, + 1507 + ], + "score": 0.9, + "latex": "\\alpha > 0" + }, + { + "category_id": 13, + "poly": [ + 1150, + 477, + 1401, + 477, + 1401, + 514, + 1150, + 514 + ], + "score": 0.89, + "latex": "\\operatorname { E } _ { X \\sim \\rho } [ f _ { \\lambda } ^ { * } ( \\kappa - \\phi ( X ) ) ]" + }, + { + "category_id": 13, + "poly": [ + 408, + 806, + 996, + 806, + 996, + 843, + 408, + 843 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { R = \\operatorname* { m a x } _ { x \\in ( a , b ) } f _ { \\lambda } ^ { * } ( \\kappa - x ) - \\operatorname* { m i n } _ { x \\in ( a , b ) } f _ { \\lambda } ^ { * } ( \\kappa - x ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 450, + 958, + 497, + 958, + 497, + 988, + 450, + 988 + ], + "score": 0.88, + "latex": "E _ { u b }" + }, + { + "category_id": 14, + "poly": [ + 601, + 858, + 1127, + 858, + 1127, + 953, + 601, + 953 + ], + "score": 0.88, + "latex": "E _ { u b } \\bar { Z } + \\sqrt { \\frac { 2 \\bar { \\sigma } ^ { 2 } \\log ( 3 / \\zeta ) } { \\tilde { N } } } + \\frac { 3 R \\log ( 3 / \\zeta ) } { \\tilde { N } } ." + }, + { + "category_id": 13, + "poly": [ + 449, + 578, + 521, + 578, + 521, + 609, + 449, + 609 + ], + "score": 0.88, + "latex": "\\kappa ^ { * } , \\lambda ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 836, + 1683, + 862, + 1683, + 862, + 1713, + 836, + 1713 + ], + "score": 0.88, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1109, + 672, + 1259, + 672, + 1259, + 709, + 1109, + 709 + ], + "score": 0.88, + "latex": "i = 1 , \\ldots , \\tilde { N }" + }, + { + "category_id": 13, + "poly": [ + 867, + 479, + 899, + 479, + 899, + 507, + 867, + 507 + ], + "score": 0.86, + "latex": "\\lambda ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 410, + 760, + 626, + 760, + 626, + 811, + 410, + 811 + ], + "score": 0.86, + "latex": "\\bar { \\sigma } \\frac { \\sum _ { i = 1 } ^ { \\tilde { N } } ( Z ^ { i } - \\bar { Z } ) ^ { 2 } } { N }" + }, + { + "category_id": 13, + "poly": [ + 784, + 481, + 816, + 481, + 816, + 507, + 784, + 507 + ], + "score": 0.85, + "latex": "\\kappa ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1373, + 1137, + 1401, + 1137, + 1401, + 1168, + 1373, + 1168 + ], + "score": 0.85, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 372, + 1417, + 489, + 1417, + 489, + 1446, + 372, + 1446 + ], + "score": 0.85, + "latex": "p + q = 1" + }, + { + "category_id": 13, + "poly": [ + 500, + 1416, + 620, + 1416, + 620, + 1447, + 500, + 1447 + ], + "score": 0.83, + "latex": "p \\geq q \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 383, + 1080, + 412, + 1080, + 412, + 1111, + 383, + 1111 + ], + "score": 0.82, + "latex": "\\ell _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 679, + 1419, + 697, + 1419, + 697, + 1446, + 679, + 1446 + ], + "score": 0.8, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1064, + 516, + 1403, + 516, + 1403, + 551, + 1064, + 551 + ], + "score": 0.77, + "latex": "f _ { \\lambda ^ { * } } ^ { * } ( \\kappa - a ) < \\infty , f _ { \\lambda ^ { * } } ^ { * } ( \\kappa - b ) <" + }, + { + "category_id": 13, + "poly": [ + 450, + 263, + 470, + 263, + 470, + 289, + 450, + 289 + ], + "score": 0.76, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 521, + 268, + 539, + 268, + 539, + 289, + 521, + 289 + ], + "score": 0.74, + "latex": "\\kappa" + }, + { + "category_id": 13, + "poly": [ + 1382, + 1421, + 1401, + 1421, + 1401, + 1442, + 1382, + 1442 + ], + "score": 0.73, + "latex": "x" + }, + { + "category_id": 13, + "poly": [ + 540, + 448, + 826, + 448, + 826, + 481, + 540, + 481 + ], + "score": 0.7, + "latex": "\\mathrm { E O P T } ( \\rho , \\phi , N , \\{ f _ { i } \\} , \\{ \\epsilon _ { i } \\} )" + }, + { + "category_id": 13, + "poly": [ + 325, + 553, + 356, + 553, + 356, + 576, + 325, + 576 + ], + "score": 0.62, + "latex": "\\infty" + }, + { + "category_id": 13, + "poly": [ + 569, + 634, + 1190, + 634, + 1190, + 673, + 569, + 673 + ], + "score": 0.38, + "latex": "\\mathrm { F I D E N C E B O U N D } ( \\rho , \\phi , \\tilde { N } , \\{ f _ { i } \\} _ { i = 1 } ^ { M } , \\{ \\epsilon _ { i } \\} _ { i = 1 } ^ { M } , a , b , \\lambda , \\kappa , \\zeta )" + }, + { + "category_id": 14, + "poly": [ + 409, + 804, + 1000, + 804, + 1000, + 844, + 409, + 844 + ], + "score": 0.33, + "latex": "\\begin{array} { r } { R = \\operatorname* { m a x } _ { x \\in ( a , b ) } f _ { \\lambda } ^ { * } ( \\kappa - x ) - \\operatorname* { m i n } _ { x \\in ( a , b ) } f _ { \\lambda } ^ { * } ( \\kappa - x ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1255, + 517, + 1403, + 517, + 1403, + 551, + 1255, + 551 + ], + "score": 0.27, + "latex": "f _ { \\lambda ^ { * } } ^ { * } ( \\kappa - b ) <" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 817.0, + 72.0, + 817.0, + 109.0, + 295.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1078.0, + 382.0, + 1078.0, + 382.0, + 1114.0, + 297.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 1078.0, + 690.0, + 1078.0, + 690.0, + 1114.0, + 413.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2083.0, + 871.0, + 2083.0, + 871.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 401.0, + 765.0, + 401.0, + 765.0, + 440.0, + 296.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1412.0, + 371.0, + 1412.0, + 371.0, + 1450.0, + 294.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 490.0, + 1412.0, + 499.0, + 1412.0, + 499.0, + 1450.0, + 490.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 621.0, + 1412.0, + 678.0, + 1412.0, + 678.0, + 1450.0, + 621.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 1412.0, + 1381.0, + 1412.0, + 1381.0, + 1450.0, + 698.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1412.0, + 1407.0, + 1412.0, + 1407.0, + 1450.0, + 1402.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1430.0, + 346.0, + 1430.0, + 346.0, + 1486.0, + 297.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1430.0, + 1416.0, + 1430.0, + 1416.0, + 1486.0, + 404.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1480.0, + 530.0, + 1480.0, + 530.0, + 1511.0, + 297.0, + 1511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 1480.0, + 655.0, + 1480.0, + 655.0, + 1511.0, + 603.0, + 1511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1939.0, + 1406.0, + 1939.0, + 1406.0, + 1978.0, + 294.0, + 1978.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": [ + 295.0, + 2002.0, + 607.0, + 2002.0, + 607.0, + 2040.0, + 295.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 2002.0, + 1026.0, + 2002.0, + 1026.0, + 2040.0, + 738.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1131.0, + 1372.0, + 1131.0, + 1372.0, + 1172.0, + 292.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1131.0, + 1406.0, + 1131.0, + 1406.0, + 1172.0, + 1402.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1166.0, + 773.0, + 1166.0, + 773.0, + 1200.0, + 293.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1166.0, + 950.0, + 1166.0, + 950.0, + 1200.0, + 872.0, + 1200.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, + 449.0, + 260.0, + 449.0, + 297.0, + 294.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 260.0, + 520.0, + 260.0, + 520.0, + 297.0, + 471.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 260.0, + 551.0, + 260.0, + 551.0, + 297.0, + 540.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1757.0, + 1403.0, + 1757.0, + 1403.0, + 1793.0, + 295.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1789.0, + 457.0, + 1789.0, + 457.0, + 1822.0, + 292.0, + 1822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1677.0, + 835.0, + 1677.0, + 835.0, + 1720.0, + 292.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 1677.0, + 1404.0, + 1677.0, + 1404.0, + 1720.0, + 863.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1712.0, + 611.0, + 1712.0, + 611.0, + 1744.0, + 295.0, + 1744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 304.0, + 1404.0, + 304.0, + 1404.0, + 345.0, + 292.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 338.0, + 1057.0, + 338.0, + 1057.0, + 374.0, + 295.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1259.0, + 720.0, + 1259.0, + 720.0, + 1298.0, + 294.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 442.0, + 539.0, + 442.0, + 539.0, + 486.0, + 322.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 442.0, + 830.0, + 442.0, + 830.0, + 486.0, + 827.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 469.0, + 457.0, + 469.0, + 457.0, + 518.0, + 360.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 469.0, + 783.0, + 469.0, + 783.0, + 518.0, + 658.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 817.0, + 469.0, + 866.0, + 469.0, + 866.0, + 518.0, + 817.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 469.0, + 1149.0, + 469.0, + 1149.0, + 518.0, + 900.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 469.0, + 1407.0, + 469.0, + 1407.0, + 518.0, + 1402.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 497.0, + 456.0, + 497.0, + 456.0, + 567.0, + 312.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 497.0, + 1063.0, + 497.0, + 1063.0, + 567.0, + 740.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 497.0, + 1414.0, + 497.0, + 1414.0, + 567.0, + 1404.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 550.0, + 369.0, + 550.0, + 369.0, + 582.0, + 357.0, + 582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 665.0, + 456.0, + 665.0, + 456.0, + 717.0, + 361.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 665.0, + 809.0, + 665.0, + 809.0, + 717.0, + 657.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 665.0, + 1108.0, + 665.0, + 1108.0, + 717.0, + 1067.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 665.0, + 1272.0, + 665.0, + 1272.0, + 717.0, + 1260.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 949.0, + 449.0, + 949.0, + 449.0, + 995.0, + 362.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 949.0, + 512.0, + 949.0, + 512.0, + 995.0, + 498.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 985.0, + 481.0, + 985.0, + 481.0, + 1020.0, + 323.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 627.0, + 568.0, + 627.0, + 568.0, + 681.0, + 329.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1191.0, + 627.0, + 1196.0, + 627.0, + 1196.0, + 681.0, + 1191.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 575.0, + 448.0, + 575.0, + 448.0, + 610.0, + 362.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 522.0, + 575.0, + 535.0, + 575.0, + 535.0, + 610.0, + 522.0, + 610.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 24, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 665, + 1404, + 665, + 1404, + 823, + 297, + 823 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 856, + 1404, + 856, + 1404, + 1015, + 297, + 1015 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 474, + 1404, + 474, + 1404, + 632, + 297, + 632 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 285, + 1404, + 285, + 1404, + 442, + 298, + 442 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 294, + 1950, + 1405, + 1950, + 1405, + 2013, + 294, + 2013 + ], + "score": 0.944 + }, + { + "category_id": 4, + "poly": [ + 397, + 1884, + 1297, + 1884, + 1297, + 1918, + 397, + 1918 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 105, + 300, + 105 + ], + "score": 0.895 + }, + { + "category_id": 6, + "poly": [ + 502, + 1043, + 1194, + 1043, + 1194, + 1077, + 502, + 1077 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 865, + 2088, + 865, + 2113, + 835, + 2113 + ], + "score": 0.86 + }, + { + "category_id": 3, + "poly": [ + 297, + 1100, + 1353, + 1100, + 1353, + 1861, + 297, + 1861 + ], + "score": 0.78 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 1188, + 229, + 1188, + 262, + 297, + 262 + ], + "score": 0.65 + }, + { + "category_id": 0, + "poly": [ + 297, + 229, + 1188, + 229, + 1188, + 262, + 297, + 262 + ], + "score": 0.275 + }, + { + "category_id": 5, + "poly": [ + 297, + 1100, + 1353, + 1100, + 1353, + 1861, + 297, + 1861 + ], + "score": 0.197, + "html": "
CertificateCertified Accuracy
Lecuyer et al. (2019) Ours∈=1 ∈=2∈=3 ∈=4∈=5∈=6E=
0.772 0.8600.548 0.7160.424 0.5840.061 0.4470 0.3250 0.2010 0.0
1.01 Vreeeeeepeleeeea 0.8 0.61.01 reeeeeepeieieeea Lecuyer et al., 2018 0.8Ours Lecuyer et al., 2018
" + }, + { + "category_id": 13, + "poly": [ + 746, + 535, + 1089, + 535, + 1089, + 571, + 746, + 571 + ], + "score": 0.92, + "latex": "N \\overset { \\cdot } { = } 1 K , \\tilde { N } = 1 0 M , \\zeta = . 9 9" + }, + { + "category_id": 13, + "poly": [ + 570, + 727, + 889, + 727, + 889, + 763, + 570, + 763 + ], + "score": 0.91, + "latex": "N = 1 K , \\tilde { N } = 1 M , \\zeta = . 9 9" + }, + { + "category_id": 13, + "poly": [ + 1230, + 919, + 1406, + 919, + 1406, + 954, + 1230, + 954 + ], + "score": 0.91, + "latex": "N = 1 K , \\tilde { N } =" + }, + { + "category_id": 13, + "poly": [ + 296, + 953, + 464, + 953, + 464, + 985, + 296, + 985 + ], + "score": 0.87, + "latex": "1 0 0 K , \\zeta = . 9 9" + }, + { + "category_id": 13, + "poly": [ + 788, + 1885, + 816, + 1885, + 816, + 1916, + 788, + 1916 + ], + "score": 0.86, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 601, + 1044, + 629, + 1044, + 629, + 1074, + 601, + 1074 + ], + "score": 0.84, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 959, + 232, + 986, + 232, + 986, + 261, + 959, + 261 + ], + "score": 0.74, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1053, + 1829, + 1079, + 1829, + 1079, + 1856, + 1053, + 1856 + ], + "score": 0.65, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 553, + 1829, + 580, + 1829, + 580, + 1856, + 553, + 1856 + ], + "score": 0.51, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 1882.0, + 787.0, + 1882.0, + 787.0, + 1922.0, + 398.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 817.0, + 1882.0, + 1300.0, + 1882.0, + 1300.0, + 1922.0, + 817.0, + 1922.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": [ + 503.0, + 1042.0, + 600.0, + 1042.0, + 600.0, + 1079.0, + 503.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 1042.0, + 1194.0, + 1042.0, + 1194.0, + 1079.0, + 630.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2083.0, + 871.0, + 2083.0, + 871.0, + 2123.0, + 829.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 379.0, + 1107.0, + 527.0, + 1107.0, + 527.0, + 1154.0, + 379.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1107.0, + 1128.0, + 1107.0, + 1128.0, + 1155.0, + 879.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 1164.0, + 706.0, + 1164.0, + 706.0, + 1201.0, + 612.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 1162.0, + 822.0, + 1162.0, + 822.0, + 1201.0, + 726.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 1160.0, + 937.0, + 1160.0, + 937.0, + 1205.0, + 841.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1163.0, + 1049.0, + 1163.0, + 1049.0, + 1203.0, + 955.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1069.0, + 1161.0, + 1163.0, + 1161.0, + 1163.0, + 1203.0, + 1069.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 1161.0, + 1277.0, + 1161.0, + 1277.0, + 1203.0, + 1181.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 1164.0, + 1361.0, + 1164.0, + 1361.0, + 1203.0, + 1296.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 1213.0, + 594.0, + 1213.0, + 594.0, + 1255.0, + 314.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 1210.0, + 708.0, + 1210.0, + 708.0, + 1255.0, + 613.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 1210.0, + 821.0, + 1210.0, + 821.0, + 1255.0, + 727.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 843.0, + 1211.0, + 933.0, + 1211.0, + 933.0, + 1253.0, + 843.0, + 1253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1210.0, + 1045.0, + 1210.0, + 1045.0, + 1255.0, + 955.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1211.0, + 1134.0, + 1211.0, + 1134.0, + 1254.0, + 1096.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1209.0, + 1211.0, + 1248.0, + 1211.0, + 1248.0, + 1255.0, + 1209.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1325.0, + 1213.0, + 1363.0, + 1213.0, + 1363.0, + 1255.0, + 1325.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 1246.0, + 493.0, + 1246.0, + 493.0, + 1295.0, + 413.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 1247.0, + 708.0, + 1247.0, + 708.0, + 1292.0, + 614.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 1247.0, + 821.0, + 1247.0, + 821.0, + 1292.0, + 727.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 1247.0, + 935.0, + 1247.0, + 935.0, + 1292.0, + 842.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 1246.0, + 1047.0, + 1246.0, + 1047.0, + 1292.0, + 956.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1069.0, + 1246.0, + 1161.0, + 1246.0, + 1161.0, + 1292.0, + 1069.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1246.0, + 1273.0, + 1246.0, + 1273.0, + 1291.0, + 1183.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 1247.0, + 1364.0, + 1247.0, + 1364.0, + 1292.0, + 1297.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 1315.0, + 390.0, + 1315.0, + 390.0, + 1351.0, + 334.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1312.0, + 894.0, + 1312.0, + 894.0, + 1355.0, + 835.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 272.0, + 1333.0, + 421.0, + 1333.0, + 421.0, + 1738.0, + 272.0, + 1738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 1333.0, + 923.0, + 1333.0, + 923.0, + 1739.0, + 772.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 1341.0, + 1099.0, + 1341.0, + 1099.0, + 1378.0, + 1030.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 1342.0, + 605.0, + 1342.0, + 605.0, + 1377.0, + 536.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 535.0, + 1373.0, + 774.0, + 1373.0, + 774.0, + 1409.0, + 535.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1386.0, + 1015.0, + 1386.0, + 1015.0, + 1399.0, + 980.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 1373.0, + 1266.0, + 1373.0, + 1266.0, + 1408.0, + 1029.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 1399.0, + 385.0, + 1399.0, + 385.0, + 1434.0, + 334.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 1400.0, + 885.0, + 1400.0, + 885.0, + 1432.0, + 837.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1483.0, + 883.0, + 1483.0, + 883.0, + 1514.0, + 836.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1565.0, + 382.0, + 1565.0, + 382.0, + 1597.0, + 332.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 1565.0, + 883.0, + 1565.0, + 883.0, + 1597.0, + 833.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 1619.0, + 1002.0, + 1619.0, + 1002.0, + 1650.0, + 986.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1642.0, + 383.0, + 1642.0, + 383.0, + 1682.0, + 332.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 1664.0, + 468.0, + 1664.0, + 468.0, + 1699.0, + 455.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1663.0, + 1033.0, + 1663.0, + 1033.0, + 1746.0, + 1014.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 1750.0, + 454.0, + 1750.0, + 454.0, + 1773.0, + 435.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 501.0, + 1746.0, + 524.0, + 1746.0, + 524.0, + 1774.0, + 501.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 1746.0, + 594.0, + 1746.0, + 594.0, + 1778.0, + 566.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 1748.0, + 660.0, + 1748.0, + 660.0, + 1774.0, + 636.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 702.0, + 1746.0, + 725.0, + 1746.0, + 725.0, + 1775.0, + 702.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1745.0, + 792.0, + 1745.0, + 792.0, + 1774.0, + 771.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 912.0, + 1742.0, + 966.0, + 1742.0, + 966.0, + 1776.0, + 912.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 1745.0, + 1016.0, + 1745.0, + 1016.0, + 1775.0, + 968.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 1745.0, + 1075.0, + 1745.0, + 1075.0, + 1775.0, + 1025.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 1746.0, + 1131.0, + 1746.0, + 1131.0, + 1775.0, + 1080.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1741.0, + 1297.0, + 1741.0, + 1297.0, + 1778.0, + 1134.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 1775.0, + 595.0, + 1775.0, + 595.0, + 1809.0, + 566.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 1776.0, + 1092.0, + 1776.0, + 1092.0, + 1809.0, + 1063.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 1824.0, + 552.0, + 1824.0, + 552.0, + 1860.0, + 398.0, + 1860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 1824.0, + 695.0, + 1824.0, + 695.0, + 1860.0, + 581.0, + 1860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1824.0, + 1052.0, + 1824.0, + 1052.0, + 1863.0, + 902.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 1824.0, + 1197.0, + 1824.0, + 1197.0, + 1863.0, + 1080.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 1723.5, + 385.0, + 1723.5, + 385.0, + 1773.5, + 344.0, + 1773.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 1727.0, + 891.0, + 1727.0, + 891.0, + 1776.5, + 850.0, + 1776.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 958.0, + 228.0, + 958.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 228.0, + 1192.0, + 228.0, + 1192.0, + 265.0, + 987.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 665.0, + 1402.0, + 665.0, + 1402.0, + 701.0, + 295.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 696.0, + 1407.0, + 696.0, + 1407.0, + 733.0, + 294.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 726.0, + 569.0, + 726.0, + 569.0, + 768.0, + 292.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 726.0, + 1406.0, + 726.0, + 1406.0, + 768.0, + 890.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 759.0, + 1405.0, + 759.0, + 1405.0, + 798.0, + 294.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 790.0, + 595.0, + 790.0, + 595.0, + 827.0, + 295.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 856.0, + 1404.0, + 856.0, + 1404.0, + 894.0, + 295.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 887.0, + 1405.0, + 887.0, + 1405.0, + 925.0, + 294.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 921.0, + 1229.0, + 921.0, + 1229.0, + 957.0, + 292.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 950.0, + 1402.0, + 950.0, + 1402.0, + 988.0, + 465.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 980.0, + 1323.0, + 980.0, + 1323.0, + 1021.0, + 292.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 474.0, + 1406.0, + 474.0, + 1406.0, + 511.0, + 295.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 502.0, + 1405.0, + 502.0, + 1405.0, + 545.0, + 292.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 534.0, + 745.0, + 534.0, + 745.0, + 577.0, + 291.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 534.0, + 1407.0, + 534.0, + 1407.0, + 577.0, + 1090.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 569.0, + 1406.0, + 569.0, + 1406.0, + 607.0, + 295.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 600.0, + 769.0, + 600.0, + 769.0, + 638.0, + 295.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 287.0, + 1405.0, + 287.0, + 1405.0, + 321.0, + 296.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 317.0, + 1404.0, + 317.0, + 1404.0, + 353.0, + 296.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 347.0, + 1405.0, + 347.0, + 1405.0, + 385.0, + 294.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 376.0, + 1408.0, + 376.0, + 1408.0, + 416.0, + 292.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 406.0, + 433.0, + 406.0, + 433.0, + 450.0, + 294.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1948.0, + 1408.0, + 1948.0, + 1408.0, + 1987.0, + 294.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1983.0, + 1084.0, + 1983.0, + 1084.0, + 2015.0, + 296.0, + 2015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 958.0, + 228.0, + 958.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 228.0, + 1192.0, + 228.0, + 1192.0, + 265.0, + 987.0, + 265.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 25, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/SJlbGJrtDB/SJlbGJrtDB_layout.pdf b/parse/train/SJlbGJrtDB/SJlbGJrtDB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..213685f0cecd47e5071e32e591caf80138bd648f --- /dev/null +++ b/parse/train/SJlbGJrtDB/SJlbGJrtDB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e0b1f4331fe227cb235d7530acf65e705eaed5276309fae40e38e871898c452c +size 2486501 diff --git a/parse/train/SJlbGJrtDB/SJlbGJrtDB_origin.pdf b/parse/train/SJlbGJrtDB/SJlbGJrtDB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4bd8c99a61c8a7f4666d7e92341826bd2588d960 --- /dev/null +++ b/parse/train/SJlbGJrtDB/SJlbGJrtDB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a2838bfcc4ef5dead0bc71bd80c461e15120d5557c70383ce03c6baae1c0bfa6 +size 2352596 diff --git a/parse/train/SJlbGJrtDB/SJlbGJrtDB_span.pdf b/parse/train/SJlbGJrtDB/SJlbGJrtDB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..da53a3f58060ab7a813b136893ed1ac610435016 --- /dev/null +++ b/parse/train/SJlbGJrtDB/SJlbGJrtDB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:996ab802c4809648791492e0a68b02d300cd7795429e00c55d16fd78033fa11d +size 2495075 diff --git a/parse/train/SJxDDpEKvH/SJxDDpEKvH_layout.pdf b/parse/train/SJxDDpEKvH/SJxDDpEKvH_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..83669fcbb0d33901991a6dda105b8c71be73890c --- /dev/null +++ b/parse/train/SJxDDpEKvH/SJxDDpEKvH_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6348296ab1fcd8702fc5f21c2940c8629edc66a2b0543db0b2b2dca3522a877c +size 20148589 diff --git a/parse/train/SJxDDpEKvH/SJxDDpEKvH_origin.pdf b/parse/train/SJxDDpEKvH/SJxDDpEKvH_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..17ba99fdc213afdbc8535014828002a987b8557d --- /dev/null +++ b/parse/train/SJxDDpEKvH/SJxDDpEKvH_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:69d2261ee9c45d4292252fab77d67a7fac7a322ce9226974c83c32af79e26bb3 +size 19821730 diff --git a/parse/train/SJxDDpEKvH/SJxDDpEKvH_span.pdf b/parse/train/SJxDDpEKvH/SJxDDpEKvH_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8702bc686103e0991c902f156799374b97e92401 --- /dev/null +++ b/parse/train/SJxDDpEKvH/SJxDDpEKvH_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0d69d91f5d68dd39cb2175e959b82eba311be9a232d0b4a78bd9e1c3bf741089 +size 20158779 diff --git a/parse/train/SJxu5iR9KQ/SJxu5iR9KQ_layout.pdf b/parse/train/SJxu5iR9KQ/SJxu5iR9KQ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..58d34cc32cc05b45b75bf6c15a177cee9eadbd11 --- /dev/null +++ b/parse/train/SJxu5iR9KQ/SJxu5iR9KQ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:39537e8be210e9f7d0a9953da817951b2057293e615d4d4175237ccc11144113 +size 1753139 diff --git a/parse/train/SJxu5iR9KQ/SJxu5iR9KQ_origin.pdf b/parse/train/SJxu5iR9KQ/SJxu5iR9KQ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2d7e43ccfd5279882f0e82db00eed4bb3fac83d6 --- /dev/null +++ b/parse/train/SJxu5iR9KQ/SJxu5iR9KQ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8b0aeb1e0114f4971dc252a07f397a67733627899e8ab79268493eda74e6a904 +size 1574908 diff --git a/parse/train/SJxu5iR9KQ/SJxu5iR9KQ_span.pdf b/parse/train/SJxu5iR9KQ/SJxu5iR9KQ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6d5e2029cfc5cab199fcb13e71cca6e6a38a1b0a --- /dev/null +++ b/parse/train/SJxu5iR9KQ/SJxu5iR9KQ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bdad223718ca7795cfeaa5f551a69e814661090dc8b17642903bcc8e5ebc8db5 +size 1764768 diff --git a/parse/train/Sk7KsfW0-/Sk7KsfW0-_content_list.json b/parse/train/Sk7KsfW0-/Sk7KsfW0-_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..199e395ae79e88277e3bfcb0fb5b2d68a54b2a2a --- /dev/null +++ b/parse/train/Sk7KsfW0-/Sk7KsfW0-_content_list.json @@ -0,0 +1,1212 @@ +[ + { + "type": "text", + "text": "LIFELONG LEARNING WITH DYNAMICALLY EXPANDABLE NETWORKS ", + "text_level": 1, + "bbox": [ + 174, + 99, + 676, + 147 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Jaehong $\\mathbf { V o o n } ^ { 1 \\ast }$ , Eunho Yang1,3, Jeongtae Lee2, Sung Ju Hwang1,3 \nKAIST1, Daejeon, South Korea, UNIST2, Ulsan, South Korea, AITrics3, Seoul, South Korea \njaehong.yoon93@gmail.com, jtlee@unist.ac.kr \n{eunhoy, sjhwang82}@kaist.ac.kr ", + "bbox": [ + 183, + 167, + 794, + 227 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 263, + 544, + 279 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We propose a novel deep network architecture for lifelong learning which we refer to as Dynamically Expandable Network (DEN), that can dynamically decide its network capacity as it trains on a sequence of tasks, to learn a compact overlapping knowledge sharing structure among tasks. DEN is efficiently trained in an online manner by performing selective retraining, dynamically expands network capacity upon arrival of each task with only the necessary number of units, and effectively prevents semantic drift by splitting/duplicating units and timestamping them. We validate DEN on multiple public datasets under lifelong learning scenarios, on which it not only significantly outperforms existing lifelong learning methods for deep networks, but also achieves the same level of performance as the batch counterparts with substantially fewer number of parameters. Further, the obtained network fine-tuned on all tasks obtained siginficantly better performance over the batch models, which shows that it can be used to estimate the optimal network structure even when all tasks are available in the first place. ", + "bbox": [ + 233, + 295, + 764, + 489 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 518, + 334, + 535 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Lifelong learning (Thrun, 1995), the problem of continual learning where tasks arrive in sequence, is an important topic in transfer learning. The primary goal of lifelong learning is to leverage knowledge from earlier tasks for obtaining better performance, or faster convergence/training speed on models for later tasks. While there exist many different approaches to tackle this problem, we consider lifelong learning under deep learning to exploit the power of deep neural networks. Fortunately, for deep learning, storing and transferring knowledge can be done in a straightforward manner through the learned network weights. The learned weights can serve as the knowledge for the existing tasks, and the new task can leverage this by simply sharing these weights. ", + "bbox": [ + 174, + 550, + 825, + 662 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Therefore, we can consider lifelong learning simply as a special case of online or incremental learning, in case of deep neural networks. There are multiple ways to perform such incremental learning (Rusu et al., 2016; Zhou et al., 2012). The simplest way is to incrementally fine-tune the network to new tasks by continuing to train the network with new training data. However, such simple retraining of the network can degenerate the performance for both the new tasks and the old ones. If the new task is largely different from the older ones, such as in the case where previous tasks are classifying images of animals and the new task is to classify images of cars, then the features learned on the previous tasks may not be useful for the new one. At the same time, the retrained representations for the new task could adversely affect the old tasks, as they may have drifted from their original meanings and are no longer optimal for them. For example, the feature describing stripe pattern from zebra, may changes its meaning for the later classification task for classes such as striped t-shirt or fence, which can fit to the feature and drastically change its meaning. ", + "bbox": [ + 174, + 670, + 825, + 835 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Then how can we ensure that the knowledge sharing through the network is beneficial for all tasks, in the online/incremental learning of a deep neural network? Recent work suggests to either use a regularizer that prevents the parameters from drastic changes in their values yet still enables to find a good solution for the new task (Kirkpatrick et al., 2017), or block any changes to the old task parameters (Rusu et al., 2016). Our strategy is different from both approaches, since we retrain the network at each task $t$ such that each new task utilizes and changes only the relevant part of the previous trained network, while still allowing to expand the network capacity when necessary. In this way, each task $t$ will use a different subnetwork from the previous tasks, while still sharing a considerable part of the subnetwork with them. Figure 1 illustrates our model in comparison with existing deep lifelong learning methods. ", + "bbox": [ + 174, + 843, + 823, + 898 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/b5c12bb74695a013b25befa9b435a5c5d2bec01656e52c3cf843804c3e51d620.jpg", + "image_caption": [ + "Figure 1: Concept: (a) Retraining models such as Elastic Weight Consoliation Kirkpatrick et al. (2017) retrains the entire network learned on previous tasks while regularizing it to prevent large deviation from the original model. Units and weights colored in red denote the ones that are retrained, and black ones are ones that remain fixed. (b) Non-retraining models such as Progressive Network (Rusu et al., 2016) expands the network for the new task $t$ , while withholding modification of network weights for previous tasks. (c) Our DEN selectively retrains the old network, expanding its capacity when necessary, and thus dynamically deciding its optimal capacity as it trains on. " + ], + "image_footnote": [], + "bbox": [ + 217, + 75, + 745, + 185 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 310, + 825, + 395 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "There are a number of challenges that need to be tackled for such incremental deep learning setting with selective parameter sharing and dynamic layer expansion. ", + "bbox": [ + 173, + 401, + 823, + 430 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1) Achieving scalability and efficiency in training: If the network grows in capacity, training cost per task will increasingly grow as well, since the later tasks will establish connections to a much larger network. Thus, we need a way to keep the computational overhead of retraining to be low. ", + "bbox": [ + 174, + 436, + 825, + 478 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2) Deciding when to expand the network, and how many neurons to add: The network might not need to expand its size, if the old network sufficiently explains the new task. On the other hand, it might need to add in many neurons if the task is very different from the existing ones. Hence, the model needs to dynamically add in only the necessary number of neurons. ", + "bbox": [ + 174, + 486, + 823, + 541 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "3) Preventing semantic drift, or catastrophic forgetting, where the network drifts away from the initial configuration as it trains on, and thus shows degenerate performance for earlier examples/tasks. As our method retrains the network, even partially, to fit to later learned tasks, and add in new neurons which might also negatively affect the prior tasks by establishing connections to old subnetwork, we need a mechanism to prevent potential semantic drift. ", + "bbox": [ + 174, + 549, + 825, + 618 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To overcome such challenges, we propose a novel deep network model along with an efficient and effective incremental learning algorithm, which we name as Dynamically Expandable Networks (DEN). In a lifelong learning scenario, DEN maximally utilizes the network learned on all previous tasks to efficiently learn to predict for the new task, while dynamically increasing the network capacity by adding in or splitting/duplicating neurons when necessary. Our method is applicable to any generic deep networks, including convolutional networks. ", + "bbox": [ + 174, + 626, + 825, + 708 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We validate our incremental deep neural network for lifelong learning on multiple public datasets, on which it achieves similar or better performance than the model that trains a separate network for each task, while using only $1 1 . 9 \\% p - 6 0 . 3 \\% p$ of its parameters. Further, fine-tuning of the learned network on all tasks obtains even better performance, outperforming the batch model by as much as $0 . 0 5 \\% p - 4 . 8 \\% p$ . Thus, our model can be also used for structure estimation to obtain optimal performance over network capacity even when batch training is possible, which is a more general setup. ", + "bbox": [ + 174, + 715, + 825, + 814 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 834, + 344, + 852 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Lifelong learning Lifelong learning (Thrun, 1995) is the learning paradigm for continual learning where the model learns from a sequence of tasks while transferring knowledge obtained from earlier tasks to later ones. Since its inception of idea by Thrun (1995), it has been extensively studied due to its practicality in scenarios where the data arrives in streams, such as in autonomous driving or learning of robotic agents. Lifelong learning is often tackled as an online multi-task learning problem, where the focus is on efficient training as well as on knowledge transfer. Eaton & Ruvolo (2013) suggest an online lifelong learning framework (ELLA) that is based on an existing multi-task learning formulation (Kumar & Daume III, 2012) that efficiently updates latent parameter bases for a sequence of tasks, by removing dependency to previous tasks for the learning of each task predictor, and preventing retraining previous task predictors. Recently, lifelong learning is studied in deep learning frameworks; since lifelong learning of a deep network can be straightforwardly done by simple re-training, the primary focus of research is on overcoming catastrophic forgetting (Kirkpatrick et al., 2017; Rusu et al., 2016; Zenke et al., 2017; Lee et al., 2017). ", + "bbox": [ + 174, + 867, + 823, + 922 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 229 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Preventing catastrophic forgetting Incremental or lifelong learning of deep networks results in the problem known as catastrophic forgetting, which describes the case where the retraining of the network for new tasks results in the network forgetting what are learned for previous tasks. One solution to this problem is to use a regularizer that prevents the new model from deviating too much from the previous one, such as $\\ell _ { 2 }$ -regularizer. However, use of the simple $\\ell _ { 2 }$ -regularizer prevents the model from learning new knowledge for the new tasks, which results in suboptimal performances on later tasks. To overcome this limitation, Kirkpatrick et al. (2017) proposed a method called Elastic Weight Consolidation (EWC) that regularizes the model parameter at each step with the model parameter at previous iteration via the Fisher information matrix for the current task, which enables to find a good solution for both tasks. Zenke et al. (2017) proposed a similar approach, but their approach computes the per-synapse consolidation online, and considers the entire learning trajectory rather than the final parameter value. Another way to prevent catastrophic forgetting is to completely block any modifications to the previous network, as done in Rusu et al. (2016), where at each learning stage the network is expanded with a subnetwork with fixed capacity that is trained with incoming weights from the original network, but without backpropagating to it. ", + "bbox": [ + 174, + 250, + 825, + 458 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Dynamic network expansion There are few existing works that explored neural networks that can dynamically increase its capacity during training. Zhou et al. (2012) propose to incrementally train a denoising autoencoder by adding in new neurons for a group of difficult examples with high loss, and later merging them with other neurons to prevent redundancy. Recently, Philipp & Carbonell (2017) propose a nonparametric neural network model which not only learns to minimize the loss but also find the minimum dimensionality of each layer that can reduce the loss, with the assumption that each layer has infinite number of neurons. Cortes et al. (2016) also propose a network that can adaptively learn both the structure and the weights to minimize the given loss, based on boosting theory. However, none of these work considered multi-task setting and involves iterative process of adding in neurons (or sets of neurons), while our method only needs to train the network once for each task, to decide how many neurons to add. Xiao et al. (2014) propose a method to incrementally train a network for multi-class classification, where the network not only grows in capacity, but forms a hierarchical structure as new classes arrive at the model. The model, however, grows and branches only the topmost layers, while our method can increase the number of neurons at any layer. ", + "bbox": [ + 174, + 479, + 825, + 674 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 INCREMENTAL LEARNING OF A DYNAMICALLY EXPANDABLE NETWORK ", + "text_level": 1, + "bbox": [ + 173, + 700, + 808, + 717 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We consider the problem of incremental training of a deep neural network under the lifelong learning scenario, where unknown number of tasks with unknown distributions of training data arrive at the model in sequence. Specifically, our goal is to learn models for a sequence of $T$ tasks, $t =$ $1 , \\ldots , t , \\ldots , T$ for unbounded $T$ where the task at time point $t$ comes with training data $\\mathcal { D } _ { t } ~ =$ $\\{ x _ { i } , y _ { i } \\} _ { i = 1 } ^ { N _ { t } }$ }Nt . Note that each task $t$ can be either a single task, or comprised of set of subtasks. While our method is generic to any kinds of tasks, for simplification, we only consider the binary classification task, that is, $y \\in \\{ 0 , 1 \\}$ for input feature $\\pmb { x } \\in \\mathbb { R } ^ { d }$ . It is the main challenge in the lifelong learning setting that all the previous training datasets up to $t - 1$ are not available at the current time $t$ (only the model parameters for the previous tasks are accessible, if any). The lifelong learning agent at time $t$ aims to learn the model parameter $\\mathbf { \\mathbf { } } W ^ { t }$ by solving following problem: ", + "bbox": [ + 173, + 736, + 825, + 877 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/f02b58870267d63009eeabdc357d6f2b7fe2a4436ce4f9f7d43211da424b9be7.jpg", + "text": "$$\n\\operatorname* { m i n i m i z e } _ { W ^ { t } } \\mathcal { L } ( W ^ { t } ; W ^ { t - 1 } , \\mathcal { D } _ { t } ) + \\lambda \\Omega ( W ^ { t } ) , \\quad t = 1 , \\dots .\n$$", + "text_format": "latex", + "bbox": [ + 316, + 902, + 679, + 928 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/8238350ec118c4baceeac79fb522eab4689d7e76656397bdfc1686632ac4db74.jpg", + "image_caption": [ + "Figure 2: Incremental learning of a dynamically expandable network: Left: Selective retraining. DEN first identifies neurons that are relevant to the new tasks, and selectively retrains the network parameters associated with them. Center: Dynamic network expansion. If the selective retraining fails to obtain desired loss below set threshold, we expand the network capacity in a top-down manner, while eliminating any unnecessary neurons using group-sparsity regularization. Right: Network split/duplication. DEN calculates the drift $\\rho _ { i } ^ { t }$ for each unit to identify units that have drifted too much from their original values during training and duplicate them. " + ], + "image_footnote": [], + "bbox": [ + 245, + 103, + 751, + 200 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\mathcal { L }$ is task specific loss function, $\\mathbf { \\mathbf { \\mathbf { \\mathbf { W } } ^ { t } } }$ is the parameter for task $t$ , and $\\Omega ( W ^ { t } )$ is the regularization (e.g. element-wise $\\ell _ { 2 }$ norm) to enforce our model $\\mathbf { \\mathbf { \\mathbf { \\mathbf { W } } } ^ { t } }$ appropriately. In case of a neural network which is our primary interest, ${ W ^ { t } = \\{ W _ { l } \\} _ { l = 1 } ^ { L } }$ is the weight tensor. ", + "bbox": [ + 174, + 327, + 825, + 371 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "To tackle these challenges of lifelong learning, we let the network to maximally utilize the knowledge obtained from the previous tasks, while allowing it to dynamically expand its capacity when the accumulated knowledge alone cannot sufficiently explain the new task. Figure 2 and Algorithm 1 describes our incremental learning process. ", + "bbox": [ + 174, + 376, + 825, + 433 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Algorithm 1 Incremental Learning of a Dynamically Expandable Network ", + "text_level": 1, + "bbox": [ + 176, + 450, + 663, + 465 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Input: Dataset $\\mathcal { D } = ( \\mathcal { D } _ { 1 } , \\ldots , \\mathcal { D } _ { T } )$ , Thresholds $\\tau$ , $\\sigma$ \nOutput: $W ^ { T }$ \nfor $t = 1 , \\dots , T$ do if $t = 1$ then Train the network weights $W ^ { 1 }$ using Eq. 2 else W t = SelectiveRetraining $( W ^ { t - 1 } )$ {Selectively retrain the previous network using Algorithm 2 } if $\\mathcal { L } _ { t } > \\tau$ then $\\mathbf { } W ^ { t } = D y n a m i c E x p a n s i o n ( W ^ { t } )$ {Expand the network capacity using Algorithm 3} $\\mathbf { } W ^ { t } = S p l i t ( W ^ { t } )$ {Split and duplicate the units using Algorithm 4 } ", + "bbox": [ + 184, + 469, + 820, + 602 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In following subsections, we describe each component of our incremental learning algorithm in detail: 1) Selective retraining, 2) Dynamic network expansion, and 3) Network split/duplication. ", + "bbox": [ + 173, + 622, + 825, + 650 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Selective Retraining. A most naive way to train the model for a sequence of tasks would be retraining the entire model every time a new task arrives. However, such retraining will be very costly for a deep neural network. Thus, we suggest to perform selective retraining of the model, by retraining only the weights that are affected by the new task. Initially $\\scriptstyle ( t = 1 )$ , we train the network with $\\ell _ { 1 }$ -regularization to promote sparsity in the weights, such that each neuron is connected to only few neurons in the layer below: ", + "bbox": [ + 173, + 667, + 825, + 752 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/b90f9daa935736a429b6e1a21cacffa0f8eff9229d44e6742978b64cfedc69bd.jpg", + "text": "$$\n\\operatorname* { m i n i m i z e } _ { W ^ { t = 1 } } \\mathcal { L } ( W ^ { t = 1 } ; \\mathcal { D } _ { t } ) + \\mu \\sum _ { l = 1 } ^ { L } \\| W _ { l } ^ { t = 1 } \\| _ { 1 }\n$$", + "text_format": "latex", + "bbox": [ + 352, + 773, + 643, + 818 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $1 { \\le } l { \\le } L$ denotes the $l _ { t h }$ layer of the network, $\\mathbf { } W _ { l } ^ { t }$ is the network parameter at layer $l$ , and $\\mu$ is the regularization parameter of the element-wise $\\ell _ { 1 }$ norm for sparsity on $W$ . For convolutional layers, we apply $( 2 , 1 )$ -norm on the filters, to select only few filters from the previous layer. ", + "bbox": [ + 174, + 832, + 825, + 875 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Throughout our incremental learning procedure, we maintain $W ^ { t - 1 }$ to be sparse, thus we can drastically reduce the computation overheads if we can focus on the subnetwork connected new task. To this end, when a new task $t$ arrives at the model, we first fit a sparse linear model to predict task $t$ ", + "bbox": [ + 174, + 881, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "using topmost hidden units of the neural network via solving the following problem: ", + "bbox": [ + 174, + 103, + 725, + 118 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/0ecfd67450e2f7273220a64997bb225c039ee19f0cfc10f4ee68a86e0facf03d.jpg", + "text": "$$\n\\operatorname* { m i n i m i z e } _ { W _ { L , t } ^ { t } } \\mathcal { L } ( W _ { L , t } ^ { t } ; W _ { 1 : L - 1 } ^ { t - 1 } , \\mathcal { D } _ { t } ) + \\mu \\| W _ { L , t } ^ { t } \\| _ { 1 }\n$$", + "text_format": "latex", + "bbox": [ + 341, + 122, + 655, + 151 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where W t−11:L− denotes the set of all other parameters except $W _ { L , t } ^ { t }$ . That is, we solve this optimization to obtain the connections between output unit $o _ { t }$ and the hidden units at layer $L – 1$ (fixing all other parameters up to layer $L – 1$ as $W ^ { t - 1 }$ ). Once we build the sparse connection at this layer, we can identify all units and weights in the network that are affected by the training, while leaving the part of the network that are not connected to $o _ { t }$ unchanged. Specifically, we perform breadth-first search on the network starting from those selected nodes, to identify all units (and input feature) that have paths to $o _ { t }$ . Then, we train only the weights of the selected subnetwork $S$ , denoted as $\\mathbf { } W _ { S } ^ { t }$ : ", + "bbox": [ + 173, + 156, + 825, + 256 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/d984bca639d1847a8ef99c812796947623c6f91ea82fc990dcbf1e925c6deb53.jpg", + "text": "$$\n\\operatorname* { m i n i m i z e } _ { W _ { S } ^ { t } } \\mathcal { L } ( W _ { S } ^ { t } ; W _ { S ^ { c } } ^ { t - 1 } , \\mathcal { D } _ { t } ) + \\mu \\| W _ { S } ^ { t } \\| _ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 356, + 273, + 640, + 301 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We use the element-wise $\\ell _ { 2 }$ regularizer since the sparse connections have been already established1. This partial retraining will result in lower computational overhead and also help with avoiding negative transfer, since neurons that are not selected will not get affected by the retraining process. Algorithm 2 describes the selective retraining process. ", + "bbox": [ + 173, + 305, + 826, + 361 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Algorithm 2 Selective Retraining ", + "text_level": 1, + "bbox": [ + 174, + 377, + 397, + 392 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Input: Datatset $\\mathcal { D } _ { t }$ , Previous parameter $W ^ { t - 1 }$ \nOutput: network parameter $\\hat { W } ^ { t }$ \nInitialize Solve Eq. $l \\gets L - 1$ , n $S = \\{ o _ { t } \\}$ $\\boldsymbol { W } _ { L , t } ^ { t }$ \nAdd neuron $i$ to $S$ if the weight between $i$ and $o _ { t }$ in $W _ { L , t } ^ { t }$ is not zero. \nfor $l = L - 1 , \\ldots , 1$ do Add neuron $_ { i }$ to $S$ if there exists some neuron $j \\in S$ such that $\\mathbf { } W _ { l , i j } ^ { t - 1 } \\neq 0$ \nSolve Eq. 4 to obtain ", + "bbox": [ + 181, + 397, + 643, + 507 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Dynamic Network Expansion. In case where the new task is highly relevant to the old ones, or aggregated partial knowledge obtained from each task is sufficient to explain the new task, selective retraining alone will be sufficient for the new task. However, when the learned features cannot accurately represent the new task, additional neurons need to be introduced to the network, in order to account for the features that are necessary for the new task. Some existing work (Zhou et al., 2012; Rusu et al., 2016) are based on a similar idea. However, they are either inefficient due to iterative training that requires repeated forward pass (Zhou et al., 2012), or adds in constant number of units at each task $t$ without consideration of the task difficulty (Rusu et al., 2016) and thus are suboptimal in terms of performance and network capacity utility. ", + "bbox": [ + 173, + 534, + 825, + 660 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To overcome these limitations, we instead propose an efficient way of using group sparse regularization to dynamically decide how many neurons to add at which layer, for each task without repeated retraining of the network for each unit. Suppose that we expand the $l _ { t h }$ layer of a network with a constant number of units, say $k$ , inducing two parameter matrices expansions: $\\pmb { W _ { l } ^ { t } } = [ \\pmb { W } _ { l } ^ { t - 1 } ; \\pmb { W } _ { l } ^ { \\mathcal { N } } ]$ and $W _ { l - 1 } ^ { t } = [ \\boldsymbol { W } _ { l - 1 } ^ { t - 1 } ; \\boldsymbol { W } _ { l - 1 } ^ { \\mathcal { N } } ]$ for outgoing and incoming layers respectively, where $W ^ { \\mathcal { N } }$ is the expanded weight matrix involved with added neurons. Since we do not always want to add in all $k$ units (depending on the relatedness between the new task and the old tasks), we perform group sparsity regularization on the added parameters as follows: ", + "bbox": [ + 173, + 665, + 826, + 780 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/64804a68025ab28eb87f433f8cc5a30a2e52f2877f7dd27aaed167c2249177df.jpg", + "text": "$$\n\\operatorname* { m i n i m i z e } _ { \\boldsymbol { W } _ { l } ^ { N } } \\mathcal { L } ( \\boldsymbol { W } _ { l } ^ { N } ; \\boldsymbol { W } _ { l } ^ { t - 1 } , \\mathcal { D } _ { t } ) + \\mu \\| \\boldsymbol { W } _ { l } ^ { N } \\| _ { 1 } + \\gamma \\sum _ { g } \\| \\boldsymbol { W } _ { l , g } ^ { N } \\| _ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 290, + 784, + 704, + 819 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $g \\in { \\mathcal { G } }$ is a group defined on the incoming weights for each neuron. For convolutional layers, we defined each group as the activation map for each convolutional filter. This group sparsity regularization was used in Wen et al. (2016) and Alvarez & Salzmann (2016) to find the right number of neurons for a full network, while we apply it to the partial network. Algorithm 3 describes the details on how expansion works. ", + "bbox": [ + 173, + 830, + 825, + 901 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "After selective retraining is done, the network checks if the loss is below certain threshold. If not, then at each layer we expand its capacity by $k$ neurons and solve for Eq. 5. Due to group sparsity regularization in Eq. 5, hidden units (or convolutional filters) that are deemed unnecessary from the training will be dropped altogether. We expect that from this dynamic network expansion process, the model captures new features that were not previously represented by $\\mathbf { \\big . } W _ { l } ^ { t - 1 }$ to minimize residual errors, while maximizing the utilization of the network capacity by avoiding to add in too many units. ", + "bbox": [ + 173, + 103, + 826, + 188 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/d7801d1506fa3cb8d3f363f34c87bc9f0843b2a4385f9275d2bd1502733a6966.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Algorithm3Dynamic Network Expansion
Input: Datatset Dt,Threshold T
Perform Algorithm 2 and compute L
if>Tthen
Add k units hat all layers
Solve for Eq. 5 at all layers
forl= L-1,...,1 do
Remove useless units in h
", + "bbox": [ + 173, + 203, + 823, + 318 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Network Split/Duplication. A crucial challenge in lifelong learning is the problem of semantic drift, or catastrophic forgetting, which describes the problem where the model gradually fits to the later learned tasks and thus forgets what it learned for earlier tasks, resulting in degenerate performance for them. The most popular yet simple way of preventing semantic drift is to regularize the parameters from deviating too much from its original values using $\\ell _ { 2 }$ -regularization, as follows: ", + "bbox": [ + 173, + 333, + 825, + 404 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/fc5efa9eeed16013621268794e19d7f2b135ee0c79bb1936242009d20edd85dc.jpg", + "text": "$$\n\\operatorname* { m i n i m i z e } _ { W ^ { t } } \\mathcal { L } ( W ^ { t } ; \\mathcal { D } _ { t } ) + \\lambda \\| W ^ { t } - W ^ { t - 1 } \\| _ { 2 } ^ { 2 }\n$$", + "text_format": "latex", + "bbox": [ + 352, + 419, + 643, + 443 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $t$ is the current task, and $W ^ { t - 1 }$ is the weight tensor of the network trained for tasks $\\{ 1 , \\ldots , t -$ $1 \\}$ , and $\\lambda$ is the regularization parameter. This $\\ell _ { 2 }$ regularization will enforce the solution $\\mathbf { \\mathbf { \\mathbf { \\mathbf { W } } } ^ { t } }$ to be found close to $\\pmb { W } ^ { \\top - 1 }$ , by the degree given by $\\lambda$ ; if $\\lambda$ is small, then the network will be learned to reflect the new task more while forgetting about the old tasks, and if $\\lambda$ is high, then $\\mathbf { \\mathbf { } } W ^ { t }$ will try to preserve the knowledge learned at previous tasks as much as possible. Rather than placing simple $\\ell _ { 2 }$ regularization, it is also possible to weight each element with Fisher information (Kirkpatrick et al., 2017). Nonetheless, if number of tasks is large, or if the later tasks are semantically disparate from the previous tasks, it may become difficult to find a good solution for both previous and new tasks. ", + "bbox": [ + 173, + 446, + 825, + 560 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "A better solution in such a case, is to split the neuron such that we have features that are optimal for two different tasks. After performing Eq. 6, we measure the amount of semantic drift for each hidden unit $i$ , $\\rho _ { i } ^ { t }$ , as the $\\ell _ { 2 }$ -distance between the incoming weights at $t \\mathrm { - } 1$ and at $t$ . Then if $\\rho _ { i } ^ { t } > \\sigma$ we consider that the meaning of the feature have significantly changed during training, and split this neuron $i$ into two copies (properly introducing new edges from and to duplicate). This operation can be performed for all hidden units in parallel. After this duplication of the neurons, the network needs to train the weights again by solving Eq. 6 since split changes the overall structure. However, in practice this secondary training usually converges fast due to the reasonable parameter initialization from the initial training. Algorithm 4 describes the algorithm for split operation. ", + "bbox": [ + 173, + 566, + 825, + 693 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/76d10bae781cdf156912392875d3d0af1c4755d7f862d14443050161b36b7192.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Algorithm 4 Network Split/Duplication
Input: Weight Wt-1, Threshold σ
Perform Eq.6 to obtain Wt forall hidden uniti do
p=|w-w-12
if p>σthen
Copy i into i’ (w' introduction of edges for i')
Perform Eq. 6 with the initialization of Wt to obtain Wt
", + "bbox": [ + 174, + 708, + 823, + 828 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Timestamped Inference. In both the network expansion and network split procedures, we timestamp each newly added unit $j$ by setting $\\{ z \\} _ { j } = t$ to record the training stage $t$ when it is added to the network, to further prevent semantic drift caused by the introduction of new hidden units. At inference time, each task will only use the parameters that were introduced up to stage $t$ , to prevent the old tasks from using new hidden units added in the training process. This is a more flexible strategy than fixing the weights learned up to each learning stage as in Rusu et al. (2016), since early tasks can still benefit from the learning at later tasks, via units that are further trained, but not split. ", + "bbox": [ + 174, + 853, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4 EXPERIMENT ", + "text_level": 1, + "bbox": [ + 176, + 152, + 316, + 167 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Baselines and our model. 1) DNN-STL. Base deep neural network, either feedforward or convolutional, trained for each task separately. ", + "bbox": [ + 173, + 184, + 823, + 212 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "2) DNN-MTL. Base DNN trained for all tasks at once. ", + "bbox": [ + 181, + 218, + 544, + 233 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3) DNN. Base DNN. All incremental models use $\\ell _ { 2 }$ -regularizations. ", + "bbox": [ + 179, + 239, + 627, + 256 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3) DNN-L2. Base DNN, where at each task $t$ , $\\mathbf { \\mathbf { } } W ^ { t }$ is initialized as $W ^ { t - 1 }$ and continuously trained with $\\ell _ { 2 }$ -regularization between $\\mathbf { \\mathbf { \\mathbf { \\mathbf { W } } } ^ { t } }$ and $W ^ { t - 1 }$ . ", + "bbox": [ + 176, + 261, + 823, + 290 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4) DNN-EWC. Deep network trained with elastic weight consolidation (Kirkpatrick et al., 2017) for regularization. ", + "bbox": [ + 176, + 296, + 823, + 325 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5) DNN-Progressive. Our implementation of the progressive network (Rusu et al., 2016), whose network weights for each task remain fixed for the later arrived tasks. ", + "bbox": [ + 176, + 332, + 821, + 361 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "6) DEN. Our dynamically expandable network. ", + "bbox": [ + 184, + 367, + 495, + 382 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Base network settings. 1) Feedforward networks: We use a two-layer network with 312-128 neurons with ReLU activations. 2) Convolutional networks. For experiments on the CIFAR-100 dataset, we use a modified version of AlexNet (Krizhevsky et al., 2012) that has five convolutional layers (64-128-256-256-128 depth with $5 \\times 5$ filter size), and three fully-connected layers (384-192- 100 neurons at each layer). ", + "bbox": [ + 174, + 397, + 825, + 468 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "All models and algorithms are implemented using the Tensorflow (Abadi et al., 2016) library. We will release our codes upon acceptance of our paper, for reproduction of the results. ", + "bbox": [ + 174, + 474, + 823, + 502 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Datasets. 1) MNIST-Variation. This dataset consists of 62, 000 images of handwritten digits from 0 to 9. Unlike MNIST, the handwritten digits are rotated to arbitrary angles and has noise in the background, which makes the prediction task more challenging. We use $\\bar { 1 , 0 0 0 / 2 0 0 / 5 , 0 0 0 }$ 0 images for train/val/test split for each class. We form each task to be one-versus-rest binary classification. ", + "bbox": [ + 174, + 517, + 825, + 574 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "2) CIFAR-100. This dataset consists of 60, 000 images of 100 generic object classes(Krizhevsky & Hinton, 2009). Each class has 500 images for training and 100 images for test. We used a CNN as the base network for the experiments on this dataset, to show that our method is applicable to a CNN. Further, we considered each task as a set of 10 subtasks, each of which is a binary classification task on each class. ", + "bbox": [ + 174, + 580, + 825, + 650 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "3) AWA (Animals with Attributes). This dataset consists of 30, 475 images of 50 animals (Lampert et al., 2009). For features, we use DECAF features provided with the dataset, whose dimensionality is reduced to 500 by PCA. We use random splits of 30/30/30 images for training/validation/test. ", + "bbox": [ + 174, + 657, + 825, + 700 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 QUANTITATIVE EVALUATION ", + "text_level": 1, + "bbox": [ + 176, + 717, + 413, + 731 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We validate our models for both prediction accuracy and efficiency, where we measure the efficiency by network size at the end of training and training time. We first report the average per-task performance of baselines and our models in the top row of Figure 3. DNN-STL showed best performances on AWA and CIFAR-100 dataset; they are expected to perform well, since they are trained to be optimal for each task, while all other models are trained online which might cause semantic drift. When the number of tasks is small, MTL works the best from knowledge sharing via multi-task learning, but when the number of tasks is large, STL works better since it has larger learning capacity than MTL. Our model, DEN, performs almost the same as these batch models, and even outperforms them on MNIST-Variation dataset. Retraining models combined with regularization, such as L2 and EWC do not perform well, although the latter outperforms the former. This is expected as the two models cannot dynamically increase their capacity. Progressive network works better than the two, but it underperforms DEN on all datasets. The performance gap is most significant on AWA, as larger number of tasks $T = 5 0$ ) may have made it more difficult to find the appropriate network capacity. If the network is too small, then it will not have sufficient learning capacity to represent new tasks, and if too large, it will become prone to overfitting. ", + "bbox": [ + 174, + 743, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/c22c03394cf776bcd0d0798d019152606bd8a0068a8b039b8b2a42afd060af87.jpg", + "image_caption": [ + "Figure 3: Top row:Average per-task performance of the models over number of task $t$ , averaged over five random splits. The numbers in the legend denote average per-task performance after the model has finished learning $t = T$ ). Bottom row: Accuracy over network capacity. The network capacity is given relative to the capacity of MTL, which we consider as $1 0 0 \\%$ . " + ], + "image_footnote": [], + "bbox": [ + 166, + 103, + 810, + 406 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/803e536fdc7a47a07ece54f0aae03adb5021656eadcabdd95711605d85cf0dc8.jpg", + "image_caption": [ + "Figure 4: Effect of selective retraining. (a) shows AUROC over actual training time and (b) shows the number of selected neurons by selective retraining. (c) Expansion performance. We report both the prediction AUROC and network capacity measured by the relative number of parameters to that of DNN-MTL on MNIST-Variance dataset. Reported numbers are mean and standard error for five random splits. " + ], + "image_footnote": [], + "bbox": [ + 181, + 492, + 846, + 599 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 690, + 823, + 719 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We further report the performance of each model over network capacity measured relative to MTL on each dataset, in Figure 3 (bottom row). For baselines, we report the performance of multiple models with different network capacity. DEN obtains much better performance with substantially fewer number of parameters than Progressive network or obtain significantly better performance using similar number of parameters. DEN also obtains the same level of performance as STL using only $1 8 . 0 \\%$ , $6 0 . 3 \\%$ , and $1 1 . 9 \\%$ of its capacity on MNIST-Variation, CIFAR-100, and AWA respectively. This also shows the main advantage of DEN, which is being able to dynamically find its optimal capacity, since it learns a very compact model on MNIST-Variation, whilst learning a substantially large network on CIFAR-100. Further fine-tuning of DEN on all tasks (DEN-Finetune) obtains the best performing model on all datasets, which shows that DEN is not only useful for lifelong learning, but can be also used for network capacity estimation when all tasks are available in the first place. ", + "bbox": [ + 174, + 727, + 825, + 878 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Effect of selective retraining. We further examine how efficient and effective the selective training is, by measuring the training speed and the area under ROC curve on MNIST-Variation dataset. To this end, we compare the model without network expansion, which we refer to as DNN-Selective, against retraining on DNN-L2 and DNN-L1 (Eq.(2)), for both the accuracy and efficiency. Figure 4(a) shows both the accuracy over training time measured as actual time spent with GPU computation, for each model. We observe that selective retraining takes significantly less time than the full retraining of the network, and even less than DNN-L1 that comes with sparse network weights. Further, whereas DNN-L1 obtained slightly less accuracy than DNN-L2, DNN-Selective improves the accuracy over the base network by $2 \\% p$ . This accuracy gain may be due to the suppression of catastrophic forgetting, as DEN trains only a partial subnetwork for each newly introduced task. Figure 4(b) shows the number of selected neurons at each layer with selective retraining. Note that DNN-selective mostly selects less portion of upper level units which are more task-specific, while selecting larger portion of more generic lower layer units. ", + "bbox": [ + 173, + 895, + 823, + 924 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/f2865983a15b8e4cd7f9cc4d2e727d7b8aed31f3471a17a503159a933a6c6575.jpg", + "image_caption": [ + "Figure 5: Semantic drift experiment on the MNIST-Variation dataset. We report the AUROC of different models on $t = 1$ , $t = 4$ , and $t = 7$ at each training stage to see how the model performance changes over time for these tasks. Reported AUROC is the average over five random splits. " + ], + "image_footnote": [], + "bbox": [ + 168, + 83, + 816, + 244 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 333, + 825, + 486 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Effect of network expansion. We also compare the effectiveness of the network expansion against the model with a variant of our model that does selective retraining and layer expansion, but without network split. We refer to this model as DNN-Dynamic. We compare DNN-Dynamic with DNN-L2 used in the main experiment, and DNN-Constant, which is a version of our model that expands its capacity at each layer with fixed number of units, on MNIST-Variation dataset. Figure 4(c) shows the experimetal results. DNN-Dynamic obtains the best mean AU-ROC, significantly outperforming all models including DNN-Constant, while increasing the size of the network substantially less than DNN-Constant $( \\mathrm { k } { = } 2 0 )$ ). This may be because having less number of parameters is not only beneficial in terms of training efficiency, but also advantageous in preventing the model from overfitting. We can set the network capacity of DNN-Constant to be similar $( \\mathrm { k } { = } 1 3 )$ ) to obtain better accuracy, but it still underperforms DEN which can dynamically adjust the number of neurons at each layer. ", + "bbox": [ + 174, + 513, + 825, + 666 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Effect of network split/duplication and timestamped inference. To see how network split/duplication and unit timestamping help prevent semantic drift (or catastrophic forgetting), while allowing to obtain good performances on later tasks, we compare the performance of our model against baselines and also a variant of our DEN without timestamped inference (DEN-No-Stamp) at different learning stages. Each figure in Figure 5 (a), (b), and (c) shows how the performance of the model changes at each training stage $t$ , for tasks $\\scriptstyle t = 1$ , $\\scriptstyle t = 4$ , and $t { = } 7$ . ", + "bbox": [ + 174, + 694, + 825, + 777 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We observe that DNN-L2 prevents semantic drift of the models learned at early stages, but results in increasingly worse performance on later tasks $( t { = } 4 , 7 )$ . DNN-EWC, on the other hand, has better performance on later tasks than DNN-L2, as reported in Kirkpatrick et al. (2017). However, it shows significantly lower performance than both DNN-Progressive and our model, which may be due to its inability to increase network capacity, that may result in limited expressive power. DNN-Progressive shows no semantic drift on old tasks, which is expected because it does not retrain parameters for them. DEN w/o Timestamping works better than DNN-Progressive on later tasks, with slight performance degeneration over time. Finally, our full model with timestamped inference, DEN, shows no sign of noticeable performance degeneration at any learning stage, while significantly outperforming DNN-Progressive. This results show that DEN is highly effective in preventing semantic drift as well. ", + "bbox": [ + 174, + 785, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 102, + 318, + 117 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We proposed a novel deep neural network for lifelong learning, Dynamically Expandable Network (DEN). DEN performs partial retraining of the network trained on old tasks by exploiting task relatedness, while increasing its capacity when necessary to account for new knowledge required to account for new tasks, to find the optimal capacity for itself, while also effectively preventing semantic drift. We implement both feedforward and convolutional neural network version of our DEN, and validate them on multiple classification datasets under lifelong learning scenarios, on which they significantly outperform the existing lifelong learning methods, achieving almost the same performance as the network trained in batch while using as little as $1 1 . 9 \\% p - 6 0 . 3 \\% p$ of its capacity. Further fine-tuning of the models on all tasks results in obtaining models that outperform the batch models, which shows that DEN is useful for network structure estimation as well. ", + "bbox": [ + 174, + 135, + 825, + 273 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Acknowledgements This research was supported by Next-Generation Information Computing Development Program through the National Research Foundation of Korea of the Ministry of Science, ICT & Future Planning (NRF-2016M3C4A7952600), Samsung Research Funding Center of Samsung Electronics (SRFC-IT150203), and the ICT R&D program of MSIP/IITP (2016-0-00563, Research on Adaptive Machine Learning Technology Development for Intelligent Autonomous Digital Companion, and 2017-0-00537, Development of Autonomous IoT Collaboration Framework for Space Intelligence). ", + "bbox": [ + 174, + 281, + 825, + 378 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 401, + 285, + 416 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Mart´ın Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, et al. Tensorflow: Large-scale Machine Learning on Heterogeneous Distributed Systems. arXiv:1603.04467, 2016. ", + "bbox": [ + 174, + 425, + 826, + 467 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jose M Alvarez and Mathieu Salzmann. Learning the number of neurons in deep networks. In Advances in Neural Information Processing Systems, pp. 2262–2270, 2016. ", + "bbox": [ + 171, + 478, + 823, + 508 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Corinna Cortes, Xavi Gonzalvo, Vitaly Kuznetsov, Mehryar Mohri, and Scott Yang. Adanet: Adaptive structural learning of artificial neural networks. arXiv preprint arXiv:1607.01097, 2016. ", + "bbox": [ + 173, + 518, + 823, + 547 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Eric Eaton and Paul L. Ruvolo. ELLA: An efficient lifelong learning algorithm. In Sanjoy Dasgupta and David Mcallester (eds.), ICML, volume 28, pp. 507–515. JMLR Workshop and Conference Proceedings, 2013. ", + "bbox": [ + 174, + 559, + 825, + 602 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "James Kirkpatrick, Razvan Pascanu, Neil Rabinowitz, Joel Veness, Guillaume Desjardins, Andrei A Rusu, Kieran Milan, John Quan, Tiago Ramalho, Agnieszka Grabska-Barwinska, et al. Overcoming catastrophic forgetting in neural networks. Proceedings of the National Academy of Sciences, pp. 201611835, 2017. ", + "bbox": [ + 174, + 613, + 825, + 670 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alex Krizhevsky and Geoffrey Hinton. Learning multiple layers of features from tiny images. 2009. ", + "bbox": [ + 173, + 681, + 825, + 696 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton. ImageNet Classification with Deep Convolutional Neural Networks. In NIPS, 2012. ", + "bbox": [ + 176, + 707, + 821, + 736 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Abhishek Kumar and Hal Daume III. Learning task grouping and overlap in multi-task learning. In ICML, 2012. ", + "bbox": [ + 174, + 747, + 823, + 776 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Christoph Lampert, Hannes Nickisch, and Stefan Harmeling. Learning to Detect Unseen Object Classes by Between-Class Attribute Transfer. In CVPR, 2009. ", + "bbox": [ + 173, + 787, + 825, + 816 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "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. ", + "bbox": [ + 173, + 828, + 823, + 858 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Sang-Woo Lee, Jin-Hwa Kim, Jung-Woo Ha, and Byoung-Tak Zhang. Overcoming catastrophic forgetting by incremental moment matching. arXiv preprint arXiv:1703.08475, 2017. ", + "bbox": [ + 173, + 868, + 825, + 897 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "George Philipp and Jaime G. Carbonell. Nonparametric neural networks. In ICLR, 2017. ", + "bbox": [ + 169, + 909, + 758, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Andrei Rusu, Neil Rabinowitz, Guillaume Desjardins, Hubert Soyer, James Kirkpatrick, Koray Kavukcuoglu, Razvan Pascanu, and Raia Hadsell. Progressive neural networks. arXiv preprint arXiv:1606.04671, 2016. ", + "bbox": [ + 176, + 103, + 823, + 146 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "S. Thrun. A lifelong learning perspective for mobile robot control. In V. Graefe (ed.), Intelligent Robots and Systems. Elsevier, 1995. ", + "bbox": [ + 173, + 155, + 821, + 184 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Wei Wen, Chunpeng Wu, Yandan Wang, Yiran Chen, and Hai Li. Learning structured sparsity in deep neural networks. In NIPS, pp. 2074–2082, 2016. ", + "bbox": [ + 173, + 193, + 823, + 222 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Tianjun Xiao, Jiaxing Zhang, Kuiyuan Yang, Yuxin Peng, and Zheng Zhang. Error-driven incremental learning in deep convolutional neural network for large-scale image classification. In Proceedings of the 22nd ACM international conference on Multimedia, pp. 177–186. ACM, 2014. ", + "bbox": [ + 176, + 229, + 823, + 273 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Friedemann Zenke, Ben Poole, and Surya Ganguli. Continual learning through synaptic intelligence. In ICML, pp. 3987–3995, 2017. ", + "bbox": [ + 176, + 281, + 823, + 310 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Guanyu Zhou, Kihyuk Sohn, and Honglak Lee. Online incremental feature learning with denoising autoencoders. In International Conference on Artificial Intelligence and Statistics, pp. 1453–1461, 2012. ", + "bbox": [ + 174, + 319, + 826, + 362 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "APPENDIX A ", + "text_level": 1, + "bbox": [ + 176, + 388, + 282, + 405 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A.1 RESULTS ON PERMUTED MNIST ", + "text_level": 1, + "bbox": [ + 176, + 420, + 446, + 434 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We provide additional experimental results on Permuted MNIST dataset Lecun et al. (1998). This dataset consists of 70, 000 images of handwritten digits from 0 to 9, where 60, 000 images are used for training, and 10, 000 images for test. The difference of this dataset from the original MNIST is that each of the ten tasks is the multi-class classification of a different random permutation of the input pixels. Figure 6 shows the results of this experiment. Our DEN outperforms all lifelong learning baselines while using only 1.39 times of base network capacity. Further, DEN-Finetune achieves the best AUROC among all models, including DNN-STL and DNN-MTL. ", + "bbox": [ + 173, + 445, + 826, + 544 + ], + "page_idx": 10 + }, + { + "type": "image", + "img_path": "images/9c2dfb6bb52462b10583b22796642314cbb6c58caca19eef0215078cd13c419b.jpg", + "image_caption": [ + "Figure 6: Results on the Permuted MNIST. Average per-task AUROC and network capacity of all models relative to MTL on Permuted MNIST. " + ], + "image_footnote": [], + "bbox": [ + 207, + 559, + 764, + 744 + ], + "page_idx": 10 + } +] \ No newline at end of file diff --git a/parse/train/Sk7KsfW0-/Sk7KsfW0-_model.json b/parse/train/Sk7KsfW0-/Sk7KsfW0-_model.json new file mode 100644 index 0000000000000000000000000000000000000000..71e3c9c4a9fb9b50dc68d3a397df0e8808df6278 --- /dev/null +++ b/parse/train/Sk7KsfW0-/Sk7KsfW0-_model.json @@ -0,0 +1,19564 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 652, + 1302, + 652, + 1302, + 1079, + 398, + 1079 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1475, + 1404, + 1475, + 1404, + 1840, + 298, + 1840 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1213, + 1404, + 1213, + 1404, + 1460, + 298, + 1460 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 1856, + 1402, + 1856, + 1402, + 1980, + 299, + 1980 + ], + "score": 0.971 + }, + { + "category_id": 0, + "poly": [ + 299, + 221, + 1152, + 221, + 1152, + 325, + 299, + 325 + ], + "score": 0.958 + }, + { + "category_id": 2, + "poly": [ + 333, + 2006, + 615, + 2006, + 615, + 2032, + 333, + 2032 + ], + "score": 0.901 + }, + { + "category_id": 0, + "poly": [ + 302, + 1143, + 572, + 1143, + 572, + 1178, + 302, + 1178 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 816, + 76, + 816, + 104, + 299, + 104 + ], + "score": 0.878 + }, + { + "category_id": 0, + "poly": [ + 773, + 581, + 927, + 581, + 927, + 615, + 773, + 615 + ], + "score": 0.877 + }, + { + "category_id": 1, + "poly": [ + 312, + 372, + 1350, + 372, + 1350, + 500, + 312, + 500 + ], + "score": 0.831 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 856, + 2088, + 856, + 2112, + 841, + 2112 + ], + "score": 0.733 + }, + { + "category_id": 13, + "poly": [ + 419, + 374, + 500, + 374, + 500, + 407, + 419, + 407 + ], + "score": 0.27, + "latex": "\\mathbf { V o o n } ^ { 1 \\ast }" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 218.0, + 872.0, + 218.0, + 872.0, + 271.0, + 294.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 270.0, + 1155.0, + 270.0, + 1155.0, + 330.0, + 293.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 2003.0, + 619.0, + 2003.0, + 619.0, + 2035.0, + 332.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1140.0, + 579.0, + 1140.0, + 579.0, + 1187.0, + 293.0, + 1187.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, + 580.0, + 932.0, + 580.0, + 932.0, + 618.0, + 770.0, + 618.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": [ + 396.0, + 652.0, + 1306.0, + 652.0, + 1306.0, + 687.0, + 396.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 683.0, + 1305.0, + 683.0, + 1305.0, + 718.0, + 393.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 711.0, + 1307.0, + 711.0, + 1307.0, + 752.0, + 391.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 744.0, + 1306.0, + 744.0, + 1306.0, + 779.0, + 394.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 777.0, + 1305.0, + 777.0, + 1305.0, + 809.0, + 394.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 805.0, + 1305.0, + 805.0, + 1305.0, + 840.0, + 393.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 836.0, + 1307.0, + 836.0, + 1307.0, + 871.0, + 393.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 865.0, + 1306.0, + 865.0, + 1306.0, + 899.0, + 393.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 896.0, + 1306.0, + 896.0, + 1306.0, + 931.0, + 394.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 926.0, + 1306.0, + 926.0, + 1306.0, + 961.0, + 394.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 959.0, + 1305.0, + 959.0, + 1305.0, + 989.0, + 393.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 989.0, + 1305.0, + 989.0, + 1305.0, + 1021.0, + 394.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1019.0, + 1305.0, + 1019.0, + 1305.0, + 1051.0, + 395.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1047.0, + 1060.0, + 1047.0, + 1060.0, + 1085.0, + 393.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1472.0, + 1409.0, + 1472.0, + 1409.0, + 1513.0, + 292.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1506.0, + 1405.0, + 1506.0, + 1405.0, + 1540.0, + 293.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1534.0, + 1405.0, + 1534.0, + 1405.0, + 1570.0, + 293.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1564.0, + 1405.0, + 1564.0, + 1405.0, + 1604.0, + 292.0, + 1604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1597.0, + 1406.0, + 1597.0, + 1406.0, + 1631.0, + 294.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1625.0, + 1405.0, + 1625.0, + 1405.0, + 1665.0, + 292.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1659.0, + 1404.0, + 1659.0, + 1404.0, + 1693.0, + 294.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1688.0, + 1406.0, + 1688.0, + 1406.0, + 1724.0, + 292.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1717.0, + 1405.0, + 1717.0, + 1405.0, + 1753.0, + 293.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1752.0, + 1402.0, + 1752.0, + 1402.0, + 1782.0, + 296.0, + 1782.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": [ + 292.0, + 1806.0, + 1070.0, + 1806.0, + 1070.0, + 1848.0, + 292.0, + 1848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1214.0, + 1406.0, + 1214.0, + 1406.0, + 1251.0, + 293.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1244.0, + 1405.0, + 1244.0, + 1405.0, + 1282.0, + 292.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1273.0, + 1406.0, + 1273.0, + 1406.0, + 1312.0, + 292.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1305.0, + 1406.0, + 1305.0, + 1406.0, + 1341.0, + 293.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1334.0, + 1406.0, + 1334.0, + 1406.0, + 1373.0, + 292.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1368.0, + 1404.0, + 1368.0, + 1404.0, + 1402.0, + 294.0, + 1402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1397.0, + 1408.0, + 1397.0, + 1408.0, + 1433.0, + 293.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1429.0, + 1048.0, + 1429.0, + 1048.0, + 1463.0, + 296.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1855.0, + 1408.0, + 1855.0, + 1408.0, + 1891.0, + 294.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1886.0, + 1406.0, + 1886.0, + 1406.0, + 1922.0, + 293.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1919.0, + 1406.0, + 1919.0, + 1406.0, + 1952.0, + 294.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1950.0, + 1406.0, + 1950.0, + 1406.0, + 1982.0, + 295.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 371.0, + 418.0, + 371.0, + 418.0, + 413.0, + 306.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 501.0, + 371.0, + 1111.0, + 371.0, + 1111.0, + 413.0, + 501.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 404.0, + 1354.0, + 404.0, + 1354.0, + 444.0, + 309.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 440.0, + 1035.0, + 440.0, + 1035.0, + 473.0, + 314.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 468.0, + 830.0, + 468.0, + 830.0, + 505.0, + 314.0, + 505.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 685, + 1403, + 685, + 1403, + 870, + 299, + 870 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1577, + 1404, + 1577, + 1404, + 1793, + 298, + 1793 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1378, + 1403, + 1378, + 1403, + 1561, + 298, + 1561 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1209, + 1403, + 1209, + 1403, + 1362, + 298, + 1362 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1402, + 1911, + 1402, + 2033, + 299, + 2033 + ], + "score": 0.974 + }, + { + "category_id": 4, + "poly": [ + 297, + 434, + 1404, + 434, + 1404, + 630, + 297, + 630 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 1071, + 1402, + 1071, + 1402, + 1193, + 299, + 1193 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 963, + 1404, + 963, + 1404, + 1055, + 299, + 1055 + ], + "score": 0.968 + }, + { + "category_id": 3, + "poly": [ + 370, + 168, + 1269, + 168, + 1269, + 409, + 370, + 409 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 296, + 884, + 1400, + 884, + 1400, + 948, + 296, + 948 + ], + "score": 0.949 + }, + { + "category_id": 0, + "poly": [ + 301, + 1838, + 587, + 1838, + 587, + 1875, + 301, + 1875 + ], + "score": 0.912 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 815, + 76, + 815, + 104, + 298, + 104 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.703 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.144 + }, + { + "category_id": 13, + "poly": [ + 329, + 1699, + 525, + 1699, + 525, + 1732, + 329, + 1732 + ], + "score": 0.93, + "latex": "0 . 0 5 \\% p - 4 . 8 \\% p" + }, + { + "category_id": 13, + "poly": [ + 607, + 1638, + 817, + 1638, + 817, + 1670, + 607, + 1670 + ], + "score": 0.92, + "latex": "1 1 . 9 \\% p - 6 0 . 3 \\% p" + }, + { + "category_id": 13, + "poly": [ + 541, + 720, + 555, + 720, + 555, + 745, + 541, + 745 + ], + "score": 0.67, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 517, + 781, + 532, + 781, + 532, + 805, + 517, + 805 + ], + "score": 0.56, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 394, + 548, + 407, + 548, + 407, + 571, + 394, + 571 + ], + "score": 0.54, + "latex": "t" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 434.0, + 1405.0, + 434.0, + 1405.0, + 467.0, + 295.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 461.0, + 1404.0, + 461.0, + 1404.0, + 494.0, + 295.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 488.0, + 1405.0, + 488.0, + 1405.0, + 521.0, + 295.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 519.0, + 1404.0, + 519.0, + 1404.0, + 548.0, + 296.0, + 548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 545.0, + 393.0, + 545.0, + 393.0, + 578.0, + 294.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 545.0, + 1404.0, + 545.0, + 1404.0, + 578.0, + 408.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 573.0, + 1404.0, + 573.0, + 1404.0, + 606.0, + 294.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 601.0, + 532.0, + 601.0, + 532.0, + 632.0, + 293.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 172.0, + 443.0, + 172.0, + 443.0, + 189.0, + 422.0, + 189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 172.0, + 801.0, + 172.0, + 801.0, + 189.0, + 780.0, + 189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 170.0, + 1146.0, + 170.0, + 1146.0, + 190.0, + 1122.0, + 190.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 251.0, + 521.0, + 251.0, + 521.0, + 290.0, + 417.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 252.0, + 901.0, + 252.0, + 901.0, + 291.0, + 745.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 300.0, + 531.0, + 300.0, + 531.0, + 331.0, + 405.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 296.0, + 909.0, + 296.0, + 909.0, + 334.0, + 730.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 294.0, + 1247.0, + 294.0, + 1247.0, + 333.0, + 1103.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 341.0, + 522.0, + 341.0, + 522.0, + 373.0, + 419.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 343.0, + 872.0, + 343.0, + 872.0, + 371.0, + 773.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 341.0, + 1224.0, + 341.0, + 1224.0, + 373.0, + 1120.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 375.0, + 1275.0, + 375.0, + 1275.0, + 411.0, + 363.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1836.0, + 593.0, + 1836.0, + 593.0, + 1880.0, + 292.0, + 1880.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": [ + 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, + 686.0, + 1405.0, + 686.0, + 1405.0, + 720.0, + 293.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 719.0, + 540.0, + 719.0, + 540.0, + 751.0, + 295.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 719.0, + 1404.0, + 719.0, + 1404.0, + 751.0, + 556.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 747.0, + 1405.0, + 747.0, + 1405.0, + 783.0, + 294.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 775.0, + 516.0, + 775.0, + 516.0, + 813.0, + 294.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 775.0, + 1407.0, + 775.0, + 1407.0, + 813.0, + 533.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 808.0, + 1405.0, + 808.0, + 1405.0, + 844.0, + 295.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 839.0, + 749.0, + 839.0, + 749.0, + 873.0, + 294.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1575.0, + 1408.0, + 1575.0, + 1408.0, + 1612.0, + 295.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1607.0, + 1406.0, + 1607.0, + 1406.0, + 1643.0, + 293.0, + 1643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1638.0, + 606.0, + 1638.0, + 606.0, + 1673.0, + 294.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1638.0, + 1404.0, + 1638.0, + 1404.0, + 1673.0, + 818.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1670.0, + 1405.0, + 1670.0, + 1405.0, + 1705.0, + 294.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1700.0, + 328.0, + 1700.0, + 328.0, + 1734.0, + 294.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 1700.0, + 1405.0, + 1700.0, + 1405.0, + 1734.0, + 526.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1731.0, + 1406.0, + 1731.0, + 1406.0, + 1765.0, + 293.0, + 1765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1761.0, + 372.0, + 1761.0, + 372.0, + 1799.0, + 293.0, + 1799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1377.0, + 1405.0, + 1377.0, + 1405.0, + 1413.0, + 294.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1406.0, + 1405.0, + 1406.0, + 1405.0, + 1443.0, + 293.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1439.0, + 1405.0, + 1439.0, + 1405.0, + 1475.0, + 294.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1466.0, + 1404.0, + 1466.0, + 1404.0, + 1507.0, + 292.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1499.0, + 1405.0, + 1499.0, + 1405.0, + 1536.0, + 293.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1529.0, + 853.0, + 1529.0, + 853.0, + 1564.0, + 294.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1208.0, + 1405.0, + 1208.0, + 1405.0, + 1243.0, + 293.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1239.0, + 1405.0, + 1239.0, + 1405.0, + 1275.0, + 293.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1270.0, + 1404.0, + 1270.0, + 1404.0, + 1303.0, + 294.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1303.0, + 1404.0, + 1303.0, + 1404.0, + 1336.0, + 296.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1332.0, + 894.0, + 1332.0, + 894.0, + 1365.0, + 293.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1910.0, + 1407.0, + 1910.0, + 1407.0, + 1949.0, + 292.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 1406.0, + 1943.0, + 1406.0, + 1975.0, + 295.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1404.0, + 1972.0, + 1404.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 1407.0, + 2002.0, + 1407.0, + 2039.0, + 293.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1071.0, + 1407.0, + 1071.0, + 1407.0, + 1104.0, + 292.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1101.0, + 1407.0, + 1101.0, + 1407.0, + 1135.0, + 292.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1132.0, + 1406.0, + 1132.0, + 1406.0, + 1167.0, + 293.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1164.0, + 1048.0, + 1164.0, + 1048.0, + 1197.0, + 295.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 961.0, + 1406.0, + 961.0, + 1406.0, + 1001.0, + 293.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 995.0, + 1405.0, + 995.0, + 1405.0, + 1028.0, + 295.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1023.0, + 1303.0, + 1023.0, + 1303.0, + 1059.0, + 293.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 879.0, + 1405.0, + 879.0, + 1405.0, + 924.0, + 292.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 916.0, + 996.0, + 916.0, + 996.0, + 952.0, + 295.0, + 952.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1058, + 1404, + 1058, + 1404, + 1485, + 298, + 1485 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 552, + 1404, + 552, + 1404, + 1011, + 298, + 1011 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 297, + 1621, + 1405, + 1621, + 1405, + 1932, + 297, + 1932 + ], + "score": 0.982 + }, + { + "category_id": 8, + "poly": [ + 542, + 1989, + 1157, + 1989, + 1157, + 2036, + 542, + 2036 + ], + "score": 0.928 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.893 + }, + { + "category_id": 0, + "poly": [ + 297, + 1544, + 1376, + 1544, + 1376, + 1580, + 297, + 1580 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1997, + 1400, + 1997, + 1400, + 2026, + 1366, + 2026 + ], + "score": 0.869 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 506, + 298, + 506 + ], + "score": 0.863 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.605 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.472 + }, + { + "category_id": 13, + "poly": [ + 582, + 1808, + 700, + 1808, + 700, + 1841, + 582, + 1841 + ], + "score": 0.94, + "latex": "y \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 299, + 1745, + 427, + 1745, + 427, + 1782, + 299, + 1782 + ], + "score": 0.91, + "latex": "\\{ x _ { i } , y _ { i } \\} _ { i = 1 } ^ { N _ { t } }" + }, + { + "category_id": 13, + "poly": [ + 887, + 1807, + 974, + 1807, + 974, + 1837, + 887, + 1837 + ], + "score": 0.91, + "latex": "\\pmb { x } \\in \\mathbb { R } ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 296, + 1714, + 466, + 1714, + 466, + 1745, + 296, + 1745 + ], + "score": 0.9, + "latex": "1 , \\ldots , t , \\ldots , T" + }, + { + "category_id": 13, + "poly": [ + 783, + 1899, + 829, + 1899, + 829, + 1928, + 783, + 1928 + ], + "score": 0.89, + "latex": "\\mathbf { \\mathbf { } } W ^ { t }" + }, + { + "category_id": 14, + "poly": [ + 541, + 1988, + 1157, + 1988, + 1157, + 2042, + 541, + 2042 + ], + "score": 0.89, + "latex": "\\operatorname* { m i n i m i z e } _ { W ^ { t } } \\mathcal { L } ( W ^ { t } ; W ^ { t - 1 } , \\mathcal { D } _ { t } ) + \\lambda \\Omega ( W ^ { t } ) , \\quad t = 1 , \\dots ." + }, + { + "category_id": 13, + "poly": [ + 1332, + 1715, + 1404, + 1715, + 1404, + 1745, + 1332, + 1745 + ], + "score": 0.87, + "latex": "\\mathcal { D } _ { t } ~ =" + }, + { + "category_id": 13, + "poly": [ + 1107, + 676, + 1134, + 676, + 1134, + 706, + 1107, + 706 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 638, + 676, + 665, + 676, + 665, + 706, + 638, + 706 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1355, + 1684, + 1403, + 1684, + 1403, + 1714, + 1355, + 1714 + ], + "score": 0.85, + "latex": "t =" + }, + { + "category_id": 13, + "poly": [ + 937, + 1840, + 996, + 1840, + 996, + 1868, + 937, + 1868 + ], + "score": 0.84, + "latex": "t - 1" + }, + { + "category_id": 13, + "poly": [ + 1252, + 1684, + 1276, + 1684, + 1276, + 1710, + 1252, + 1710 + ], + "score": 0.82, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 650, + 1714, + 675, + 1714, + 675, + 1741, + 650, + 1741 + ], + "score": 0.77, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 380, + 1903, + 394, + 1903, + 394, + 1927, + 380, + 1927 + ], + "score": 0.76, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1388, + 1842, + 1401, + 1842, + 1401, + 1866, + 1388, + 1866 + ], + "score": 0.74, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1015, + 1716, + 1031, + 1716, + 1031, + 1742, + 1015, + 1742 + ], + "score": 0.67, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 684, + 1750, + 699, + 1750, + 699, + 1775, + 684, + 1775 + ], + "score": 0.66, + "latex": "t" + }, + { + "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, + 1541.0, + 1383.0, + 1541.0, + 1383.0, + 1585.0, + 292.0, + 1585.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, + 1056.0, + 1405.0, + 1056.0, + 1405.0, + 1094.0, + 295.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1090.0, + 1408.0, + 1090.0, + 1408.0, + 1126.0, + 294.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1116.0, + 1409.0, + 1116.0, + 1409.0, + 1158.0, + 292.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1152.0, + 1405.0, + 1152.0, + 1405.0, + 1184.0, + 296.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1180.0, + 1406.0, + 1180.0, + 1406.0, + 1216.0, + 294.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1208.0, + 1404.0, + 1208.0, + 1404.0, + 1246.0, + 293.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1240.0, + 1406.0, + 1240.0, + 1406.0, + 1277.0, + 293.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1268.0, + 1408.0, + 1268.0, + 1408.0, + 1310.0, + 292.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1301.0, + 1406.0, + 1301.0, + 1406.0, + 1337.0, + 293.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1332.0, + 1406.0, + 1332.0, + 1406.0, + 1368.0, + 294.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1361.0, + 1405.0, + 1361.0, + 1405.0, + 1398.0, + 293.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1392.0, + 1404.0, + 1392.0, + 1404.0, + 1430.0, + 293.0, + 1430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1425.0, + 1405.0, + 1425.0, + 1405.0, + 1460.0, + 293.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1454.0, + 1312.0, + 1454.0, + 1312.0, + 1491.0, + 295.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 553.0, + 1402.0, + 553.0, + 1402.0, + 588.0, + 296.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 584.0, + 1404.0, + 584.0, + 1404.0, + 619.0, + 296.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 614.0, + 1404.0, + 614.0, + 1404.0, + 649.0, + 293.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 645.0, + 1404.0, + 645.0, + 1404.0, + 680.0, + 294.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 673.0, + 637.0, + 673.0, + 637.0, + 713.0, + 292.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 666.0, + 673.0, + 1106.0, + 673.0, + 1106.0, + 713.0, + 666.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 673.0, + 1405.0, + 673.0, + 1405.0, + 713.0, + 1135.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 705.0, + 1406.0, + 705.0, + 1406.0, + 742.0, + 292.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 735.0, + 1405.0, + 735.0, + 1405.0, + 770.0, + 294.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 767.0, + 1404.0, + 767.0, + 1404.0, + 801.0, + 293.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 797.0, + 1406.0, + 797.0, + 1406.0, + 831.0, + 292.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 828.0, + 1406.0, + 828.0, + 1406.0, + 863.0, + 293.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 855.0, + 1406.0, + 855.0, + 1406.0, + 898.0, + 292.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 888.0, + 1405.0, + 888.0, + 1405.0, + 925.0, + 292.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 916.0, + 1405.0, + 916.0, + 1405.0, + 955.0, + 293.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 949.0, + 1404.0, + 949.0, + 1404.0, + 986.0, + 293.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 980.0, + 1071.0, + 980.0, + 1071.0, + 1015.0, + 294.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1616.0, + 1406.0, + 1616.0, + 1406.0, + 1661.0, + 292.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1651.0, + 1407.0, + 1651.0, + 1407.0, + 1688.0, + 292.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1681.0, + 1251.0, + 1681.0, + 1251.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 1681.0, + 1354.0, + 1681.0, + 1354.0, + 1717.0, + 1277.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 1712.0, + 649.0, + 1712.0, + 649.0, + 1748.0, + 467.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 1712.0, + 1014.0, + 1712.0, + 1014.0, + 1748.0, + 676.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 1712.0, + 1331.0, + 1712.0, + 1331.0, + 1748.0, + 1032.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1729.0, + 298.0, + 1729.0, + 298.0, + 1796.0, + 291.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 428.0, + 1729.0, + 683.0, + 1729.0, + 683.0, + 1796.0, + 428.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 1729.0, + 1408.0, + 1729.0, + 1408.0, + 1796.0, + 700.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1775.0, + 1405.0, + 1775.0, + 1405.0, + 1815.0, + 292.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1806.0, + 581.0, + 1806.0, + 581.0, + 1845.0, + 294.0, + 1845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 1806.0, + 886.0, + 1806.0, + 886.0, + 1845.0, + 701.0, + 1845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 1806.0, + 1405.0, + 1806.0, + 1405.0, + 1845.0, + 975.0, + 1845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1839.0, + 936.0, + 1839.0, + 936.0, + 1872.0, + 295.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1839.0, + 1387.0, + 1839.0, + 1387.0, + 1872.0, + 997.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1839.0, + 1406.0, + 1839.0, + 1406.0, + 1872.0, + 1402.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1868.0, + 1406.0, + 1868.0, + 1406.0, + 1905.0, + 292.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1899.0, + 379.0, + 1899.0, + 379.0, + 1934.0, + 294.0, + 1934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1899.0, + 782.0, + 1899.0, + 782.0, + 1934.0, + 395.0, + 1934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 1899.0, + 1177.0, + 1899.0, + 1177.0, + 1934.0, + 830.0, + 1934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1742.0, + 450.0, + 1742.0, + 450.0, + 1773.0, + 383.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 231.0, + 1408.0, + 231.0, + 1408.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 259.0, + 1408.0, + 259.0, + 1408.0, + 297.0, + 293.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 289.0, + 1408.0, + 289.0, + 1408.0, + 331.0, + 291.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 318.0, + 1406.0, + 318.0, + 1406.0, + 358.0, + 293.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 352.0, + 1406.0, + 352.0, + 1406.0, + 387.0, + 292.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 381.0, + 1405.0, + 381.0, + 1405.0, + 421.0, + 292.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 413.0, + 1405.0, + 413.0, + 1405.0, + 450.0, + 294.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 443.0, + 1408.0, + 443.0, + 1408.0, + 480.0, + 293.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 474.0, + 975.0, + 474.0, + 975.0, + 510.0, + 294.0, + 510.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1472, + 1405, + 1472, + 1405, + 1657, + 296, + 1657 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1832, + 1404, + 1832, + 1404, + 1927, + 299, + 1927 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 829, + 1404, + 829, + 1404, + 953, + 298, + 953 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 720, + 1404, + 720, + 1404, + 817, + 298, + 817 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 1941, + 1404, + 1941, + 1404, + 2035, + 299, + 2035 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 296, + 474, + 1406, + 474, + 1406, + 642, + 296, + 642 + ], + "score": 0.967 + }, + { + "category_id": 3, + "poly": [ + 419, + 230, + 1278, + 230, + 1278, + 444, + 419, + 444 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 297, + 1370, + 1404, + 1370, + 1404, + 1433, + 297, + 1433 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 604, + 1708, + 1092, + 1708, + 1092, + 1799, + 604, + 1799 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 316, + 1035, + 1397, + 1035, + 1397, + 1327, + 316, + 1327 + ], + "score": 0.903 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 815, + 76, + 815, + 104, + 299, + 104 + ], + "score": 0.893 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1736, + 1400, + 1736, + 1400, + 1766, + 1366, + 1766 + ], + "score": 0.887 + }, + { + "category_id": 0, + "poly": [ + 301, + 994, + 1129, + 994, + 1129, + 1027, + 301, + 1027 + ], + "score": 0.834 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 857, + 2088, + 857, + 2111, + 840, + 2111 + ], + "score": 0.791 + }, + { + "category_id": 8, + "poly": [ + 604, + 1708, + 1092, + 1708, + 1092, + 1800, + 604, + 1800 + ], + "score": 0.153 + }, + { + "category_id": 5, + "poly": [ + 316, + 1035, + 1397, + 1035, + 1397, + 1327, + 316, + 1327 + ], + "score": 0.096, + "html": "
Input: Dataset D= (D1,...,Dr),Thresholds T,σ Output: WT
for t=1,...,Tdo if t=1then
Train the network weights W1 using Eq. 2 else Wt = SelectiveRetraining(Wt-1) {Selectively retrain the previous network using Algorithm 2 }
" + }, + { + "category_id": 14, + "poly": [ + 602, + 1704, + 1095, + 1704, + 1095, + 1800, + 602, + 1800 + ], + "score": 0.94, + "latex": "\\operatorname* { m i n i m i z e } _ { W ^ { t = 1 } } \\mathcal { L } ( W ^ { t = 1 } ; \\mathcal { D } _ { t } ) + \\mu \\sum _ { l = 1 } ^ { L } \\| W _ { l } ^ { t = 1 } \\| _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 631, + 781, + 817, + 781, + 817, + 819, + 631, + 819 + ], + "score": 0.94, + "latex": "{ W ^ { t } = \\{ W _ { l } \\} _ { l = 1 } ^ { L } }" + }, + { + "category_id": 13, + "poly": [ + 1093, + 722, + 1180, + 722, + 1180, + 756, + 1093, + 756 + ], + "score": 0.92, + "latex": "\\Omega ( W ^ { t } )" + }, + { + "category_id": 13, + "poly": [ + 881, + 1834, + 927, + 1834, + 927, + 1868, + 881, + 1868 + ], + "score": 0.91, + "latex": "\\mathbf { } W _ { l } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 372, + 1835, + 461, + 1835, + 461, + 1865, + 372, + 1865 + ], + "score": 0.9, + "latex": "1 { \\le } l { \\le } L" + }, + { + "category_id": 13, + "poly": [ + 599, + 1836, + 633, + 1836, + 633, + 1865, + 599, + 1865 + ], + "score": 0.89, + "latex": "l _ { t h }" + }, + { + "category_id": 13, + "poly": [ + 486, + 1895, + 549, + 1895, + 549, + 1928, + 486, + 1928 + ], + "score": 0.89, + "latex": "( 2 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 709, + 722, + 755, + 722, + 755, + 750, + 709, + 750 + ], + "score": 0.89, + "latex": "\\mathbf { \\mathbf { \\mathbf { \\mathbf { W } } ^ { t } } }" + }, + { + "category_id": 13, + "poly": [ + 472, + 1037, + 672, + 1037, + 672, + 1068, + 472, + 1068 + ], + "score": 0.89, + "latex": "\\mathcal { D } = ( \\mathcal { D } _ { 1 } , \\ldots , \\mathcal { D } _ { T } )" + }, + { + "category_id": 13, + "poly": [ + 1026, + 1940, + 1100, + 1940, + 1100, + 1970, + 1026, + 1970 + ], + "score": 0.89, + "latex": "W ^ { t - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1244, + 584, + 1269, + 584, + 1269, + 615, + 1244, + 615 + ], + "score": 0.88, + "latex": "\\rho _ { i } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 870, + 752, + 917, + 752, + 917, + 781, + 870, + 781 + ], + "score": 0.88, + "latex": "\\mathbf { \\mathbf { \\mathbf { \\mathbf { W } } } ^ { t } }" + }, + { + "category_id": 13, + "poly": [ + 373, + 1290, + 566, + 1290, + 566, + 1321, + 373, + 1321 + ], + "score": 0.88, + "latex": "\\mathbf { } W ^ { t } = S p l i t ( W ^ { t } )" + }, + { + "category_id": 13, + "poly": [ + 515, + 754, + 543, + 754, + 543, + 783, + 515, + 783 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 879, + 1867, + 905, + 1867, + 905, + 1895, + 879, + 1895 + ], + "score": 0.87, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1596, + 324, + 1596, + 324, + 1627, + 297, + 1627 + ], + "score": 0.86, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 640, + 1150, + 685, + 1150, + 685, + 1177, + 640, + 1177 + ], + "score": 0.86, + "latex": "W ^ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 394, + 1236, + 472, + 1236, + 472, + 1261, + 394, + 1261 + ], + "score": 0.86, + "latex": "\\mathcal { L } _ { t } > \\tau" + }, + { + "category_id": 13, + "poly": [ + 360, + 1098, + 494, + 1098, + 494, + 1125, + 360, + 1125 + ], + "score": 0.86, + "latex": "t = 1 , \\dots , T" + }, + { + "category_id": 13, + "poly": [ + 368, + 1127, + 428, + 1127, + 428, + 1150, + 368, + 1150 + ], + "score": 0.82, + "latex": "t = 1" + }, + { + "category_id": 13, + "poly": [ + 707, + 1261, + 768, + 1261, + 768, + 1292, + 707, + 1292 + ], + "score": 0.81, + "latex": "( W ^ { t } )" + }, + { + "category_id": 13, + "poly": [ + 369, + 724, + 391, + 724, + 391, + 750, + 369, + 750 + ], + "score": 0.8, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 1380, + 1839, + 1402, + 1839, + 1402, + 1867, + 1380, + 1867 + ], + "score": 0.78, + "latex": "\\mu" + }, + { + "category_id": 13, + "poly": [ + 683, + 1205, + 765, + 1205, + 765, + 1237, + 683, + 1237 + ], + "score": 0.75, + "latex": "( W ^ { t - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 408, + 1066, + 458, + 1066, + 458, + 1094, + 408, + 1094 + ], + "score": 0.75, + "latex": "W ^ { T }" + }, + { + "category_id": 13, + "poly": [ + 620, + 2006, + 634, + 2006, + 634, + 2030, + 620, + 2030 + ], + "score": 0.74, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1024, + 726, + 1037, + 726, + 1037, + 750, + 1024, + 750 + ], + "score": 0.72, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1055, + 1566, + 1105, + 1566, + 1105, + 1595, + 1055, + 1595 + ], + "score": 0.72, + "latex": "\\scriptstyle ( t = 1 )" + }, + { + "category_id": 13, + "poly": [ + 1387, + 2005, + 1402, + 2005, + 1402, + 2030, + 1387, + 2030 + ], + "score": 0.65, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1148, + 1865, + 1184, + 1865, + 1184, + 1893, + 1148, + 1893 + ], + "score": 0.57, + "latex": "W" + }, + { + "category_id": 13, + "poly": [ + 1310, + 1837, + 1321, + 1837, + 1321, + 1863, + 1310, + 1863 + ], + "score": 0.56, + "latex": "l" + }, + { + "category_id": 13, + "poly": [ + 800, + 1045, + 817, + 1045, + 817, + 1063, + 800, + 1063 + ], + "score": 0.41, + "latex": "\\tau" + }, + { + "category_id": 13, + "poly": [ + 827, + 1044, + 846, + 1044, + 846, + 1063, + 827, + 1063 + ], + "score": 0.37, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 396, + 1262, + 774, + 1262, + 774, + 1289, + 396, + 1289 + ], + "score": 0.33, + "latex": "\\mathbf { } W ^ { t } = D y n a m i c E x p a n s i o n ( W ^ { t } )" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 472.0, + 1406.0, + 472.0, + 1406.0, + 507.0, + 293.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 502.0, + 1404.0, + 502.0, + 1404.0, + 533.0, + 294.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 530.0, + 1406.0, + 530.0, + 1406.0, + 560.0, + 295.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 556.0, + 1404.0, + 556.0, + 1404.0, + 590.0, + 294.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 586.0, + 1243.0, + 586.0, + 1243.0, + 618.0, + 293.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 586.0, + 1407.0, + 586.0, + 1407.0, + 618.0, + 1270.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 614.0, + 1345.0, + 614.0, + 1345.0, + 644.0, + 295.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 318.0, + 691.0, + 318.0, + 691.0, + 354.0, + 589.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 309.0, + 914.0, + 309.0, + 914.0, + 357.0, + 729.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 317.0, + 1041.0, + 317.0, + 1041.0, + 353.0, + 932.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 319.0, + 1226.0, + 319.0, + 1226.0, + 354.0, + 1067.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 355.0, + 911.0, + 355.0, + 911.0, + 405.0, + 704.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 364.0, + 1251.0, + 364.0, + 1251.0, + 399.0, + 1054.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 412.0, + 867.0, + 412.0, + 867.0, + 441.0, + 744.0, + 441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1164.0, + 420.0, + 1182.0, + 420.0, + 1182.0, + 427.0, + 1164.0, + 427.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": [ + 295.0, + 990.0, + 1134.0, + 990.0, + 1134.0, + 1033.0, + 295.0, + 1033.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": [ + 296.0, + 1474.0, + 1405.0, + 1474.0, + 1405.0, + 1506.0, + 296.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1501.0, + 1406.0, + 1501.0, + 1406.0, + 1543.0, + 291.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1531.0, + 1406.0, + 1531.0, + 1406.0, + 1572.0, + 291.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1565.0, + 1054.0, + 1565.0, + 1054.0, + 1598.0, + 291.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 1565.0, + 1405.0, + 1565.0, + 1405.0, + 1598.0, + 1106.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1595.0, + 1405.0, + 1595.0, + 1405.0, + 1629.0, + 325.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1626.0, + 606.0, + 1626.0, + 606.0, + 1659.0, + 292.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1830.0, + 371.0, + 1830.0, + 371.0, + 1871.0, + 293.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 1830.0, + 598.0, + 1830.0, + 598.0, + 1871.0, + 462.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 1830.0, + 880.0, + 1830.0, + 880.0, + 1871.0, + 634.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 1830.0, + 1309.0, + 1830.0, + 1309.0, + 1871.0, + 928.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1830.0, + 1379.0, + 1830.0, + 1379.0, + 1871.0, + 1322.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1830.0, + 1406.0, + 1830.0, + 1406.0, + 1871.0, + 1403.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1865.0, + 878.0, + 1865.0, + 878.0, + 1899.0, + 293.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1865.0, + 1147.0, + 1865.0, + 1147.0, + 1899.0, + 906.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1865.0, + 1405.0, + 1865.0, + 1405.0, + 1899.0, + 1185.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1895.0, + 485.0, + 1895.0, + 485.0, + 1929.0, + 295.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 1895.0, + 1315.0, + 1895.0, + 1315.0, + 1929.0, + 550.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 827.0, + 1405.0, + 827.0, + 1405.0, + 867.0, + 308.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 862.0, + 1404.0, + 862.0, + 1404.0, + 895.0, + 296.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 891.0, + 1405.0, + 891.0, + 1405.0, + 926.0, + 292.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 921.0, + 783.0, + 921.0, + 783.0, + 956.0, + 295.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 718.0, + 368.0, + 718.0, + 368.0, + 757.0, + 295.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 718.0, + 708.0, + 718.0, + 708.0, + 757.0, + 392.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 718.0, + 1023.0, + 718.0, + 1023.0, + 757.0, + 756.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 718.0, + 1092.0, + 718.0, + 1092.0, + 757.0, + 1038.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 718.0, + 1403.0, + 718.0, + 1403.0, + 757.0, + 1181.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 751.0, + 514.0, + 751.0, + 514.0, + 787.0, + 292.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 751.0, + 869.0, + 751.0, + 869.0, + 787.0, + 544.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 751.0, + 1406.0, + 751.0, + 1406.0, + 787.0, + 918.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 777.0, + 630.0, + 777.0, + 630.0, + 824.0, + 291.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 777.0, + 1053.0, + 777.0, + 1053.0, + 824.0, + 818.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1936.0, + 1025.0, + 1936.0, + 1025.0, + 1980.0, + 308.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 1936.0, + 1408.0, + 1936.0, + 1408.0, + 1980.0, + 1101.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1973.0, + 1406.0, + 1973.0, + 1406.0, + 2004.0, + 297.0, + 2004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 619.0, + 2003.0, + 619.0, + 2037.0, + 294.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 2003.0, + 1386.0, + 2003.0, + 1386.0, + 2037.0, + 635.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 2003.0, + 1406.0, + 2003.0, + 1406.0, + 2037.0, + 1403.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1368.0, + 1404.0, + 1368.0, + 1404.0, + 1405.0, + 309.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1400.0, + 1369.0, + 1400.0, + 1369.0, + 1436.0, + 295.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1033.0, + 471.0, + 1033.0, + 471.0, + 1071.0, + 319.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 1033.0, + 799.0, + 1033.0, + 799.0, + 1071.0, + 673.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1033.0, + 826.0, + 1033.0, + 826.0, + 1071.0, + 818.0, + 1071.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1066.0, + 407.0, + 1066.0, + 407.0, + 1096.0, + 317.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 1066.0, + 462.0, + 1066.0, + 462.0, + 1096.0, + 459.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1095.0, + 359.0, + 1095.0, + 359.0, + 1126.0, + 319.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 1095.0, + 530.0, + 1095.0, + 530.0, + 1126.0, + 495.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 1122.0, + 367.0, + 1122.0, + 367.0, + 1153.0, + 344.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 1122.0, + 486.0, + 1122.0, + 486.0, + 1153.0, + 429.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1147.0, + 639.0, + 1147.0, + 639.0, + 1184.0, + 367.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 1147.0, + 809.0, + 1147.0, + 809.0, + 1184.0, + 686.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 1179.0, + 395.0, + 1179.0, + 395.0, + 1209.0, + 344.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1201.0, + 682.0, + 1201.0, + 682.0, + 1242.0, + 367.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 1201.0, + 1397.0, + 1201.0, + 1397.0, + 1242.0, + 766.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1231.0, + 393.0, + 1231.0, + 393.0, + 1266.0, + 367.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 473.0, + 1231.0, + 531.0, + 1231.0, + 531.0, + 1266.0, + 473.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1256.0, + 395.0, + 1256.0, + 395.0, + 1297.0, + 392.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 775.0, + 1256.0, + 1282.0, + 1256.0, + 1282.0, + 1297.0, + 775.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 1286.0, + 1077.0, + 1286.0, + 1077.0, + 1323.0, + 567.0, + 1323.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1466, + 1406, + 1466, + 1406, + 1718, + 297, + 1718 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 346, + 1405, + 346, + 1405, + 566, + 297, + 566 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 1175, + 1405, + 1175, + 1405, + 1453, + 297, + 1453 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 673, + 1406, + 673, + 1406, + 797, + 297, + 797 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1828, + 1403, + 1828, + 1403, + 1984, + 297, + 1984 + ], + "score": 0.972 + }, + { + "category_id": 8, + "poly": [ + 500, + 1729, + 1198, + 1729, + 1198, + 1802, + 500, + 1802 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 609, + 604, + 1090, + 604, + 1090, + 661, + 609, + 661 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 585, + 270, + 1112, + 270, + 1112, + 330, + 585, + 330 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 299, + 228, + 1234, + 228, + 1234, + 263, + 299, + 263 + ], + "score": 0.929 + }, + { + "category_id": 2, + "poly": [ + 330, + 2004, + 1088, + 2004, + 1088, + 2034, + 330, + 2034 + ], + "score": 0.913 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 815, + 74, + 815, + 105, + 299, + 105 + ], + "score": 0.912 + }, + { + "category_id": 9, + "poly": [ + 1366, + 277, + 1400, + 277, + 1400, + 307, + 1366, + 307 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1366, + 611, + 1400, + 611, + 1400, + 641, + 1366, + 641 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1751, + 1400, + 1751, + 1400, + 1780, + 1366, + 1780 + ], + "score": 0.87 + }, + { + "category_id": 0, + "poly": [ + 298, + 832, + 676, + 832, + 676, + 865, + 298, + 865 + ], + "score": 0.826 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.769 + }, + { + "category_id": 1, + "poly": [ + 310, + 875, + 1095, + 875, + 1095, + 1118, + 310, + 1118 + ], + "score": 0.628 + }, + { + "category_id": 5, + "poly": [ + 310, + 875, + 1095, + 875, + 1095, + 1118, + 310, + 1118 + ], + "score": 0.411, + "html": "
Input: Datatset Dt,Previous parameter Wt-1 Output: network parameter Wt
Initializel←L-1,S={0t}
Solve Eq. 3 to obtain WL,t
Add neuron i to S if the weight between iand ot in Wt,t is not zero.
forl=L-1,...,1do
+0.
Solve Eq. 4 to obtain Wt
" + }, + { + "category_id": 14, + "poly": [ + 582, + 270, + 1114, + 270, + 1114, + 334, + 582, + 334 + ], + "score": 0.93, + "latex": "\\operatorname* { m i n i m i z e } _ { W _ { L , t } ^ { t } } \\mathcal { L } ( W _ { L , t } ^ { t } ; W _ { 1 : L - 1 } ^ { t - 1 } , \\mathcal { D } _ { t } ) + \\mu \\| W _ { L , t } ^ { t } \\| _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 369, + 347, + 463, + 347, + 463, + 386, + 369, + 386 + ], + "score": 0.93, + "latex": "W _ { 1 : L - 1 } ^ { t - 1 }" + }, + { + "category_id": 14, + "poly": [ + 607, + 603, + 1089, + 603, + 1089, + 665, + 607, + 665 + ], + "score": 0.93, + "latex": "\\operatorname* { m i n i m i z e } _ { W _ { S } ^ { t } } \\mathcal { L } ( W _ { S } ^ { t } ; W _ { S ^ { c } } ^ { t - 1 } , \\mathcal { D } _ { t } ) + \\mu \\| W _ { S } ^ { t } \\| _ { 2 }" + }, + { + "category_id": 14, + "poly": [ + 496, + 1726, + 1199, + 1726, + 1199, + 1804, + 496, + 1804 + ], + "score": 0.92, + "latex": "\\operatorname* { m i n i m i z e } _ { \\boldsymbol { W } _ { l } ^ { N } } \\mathcal { L } ( \\boldsymbol { W } _ { l } ^ { N } ; \\boldsymbol { W } _ { l } ^ { t - 1 } , \\mathcal { D } _ { t } ) + \\mu \\| \\boldsymbol { W } _ { l } ^ { N } \\| _ { 1 } + \\gamma \\sum _ { g } \\| \\boldsymbol { W } _ { l , g } ^ { N } \\| _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1160, + 1556, + 1401, + 1556, + 1401, + 1592, + 1160, + 1592 + ], + "score": 0.92, + "latex": "\\pmb { W _ { l } ^ { t } } = [ \\pmb { W } _ { l } ^ { t - 1 } ; \\pmb { W } _ { l } ^ { \\mathcal { N } } ]" + }, + { + "category_id": 13, + "poly": [ + 973, + 1046, + 1089, + 1046, + 1089, + 1085, + 973, + 1085 + ], + "score": 0.92, + "latex": "\\mathbf { } W _ { l , i j } ^ { t - 1 } \\neq 0" + }, + { + "category_id": 13, + "poly": [ + 350, + 1590, + 634, + 1590, + 634, + 1629, + 350, + 1629 + ], + "score": 0.92, + "latex": "W _ { l - 1 } ^ { t } = [ \\boldsymbol { W } _ { l - 1 } ^ { t - 1 } ; \\boldsymbol { W } _ { l - 1 } ^ { \\mathcal { N } } ]" + }, + { + "category_id": 13, + "poly": [ + 843, + 992, + 903, + 992, + 903, + 1026, + 843, + 1026 + ], + "score": 0.92, + "latex": "W _ { L , t } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 392, + 1831, + 471, + 1831, + 471, + 1862, + 392, + 1862 + ], + "score": 0.91, + "latex": "g \\in { \\mathcal { G } }" + }, + { + "category_id": 13, + "poly": [ + 954, + 350, + 1017, + 350, + 1017, + 387, + 954, + 387 + ], + "score": 0.91, + "latex": "W _ { L , t } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 1182, + 532, + 1230, + 532, + 1230, + 567, + 1182, + 567 + ], + "score": 0.91, + "latex": "\\mathbf { } W _ { S } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 810, + 1050, + 873, + 1050, + 873, + 1079, + 810, + 1079 + ], + "score": 0.9, + "latex": "j \\in S" + }, + { + "category_id": 13, + "poly": [ + 639, + 410, + 713, + 410, + 713, + 440, + 639, + 440 + ], + "score": 0.89, + "latex": "W ^ { t - 1 }" + }, + { + "category_id": 13, + "poly": [ + 360, + 1023, + 536, + 1023, + 536, + 1050, + 360, + 1050 + ], + "score": 0.89, + "latex": "l = L - 1 , \\ldots , 1" + }, + { + "category_id": 13, + "poly": [ + 1073, + 1529, + 1108, + 1529, + 1108, + 1559, + 1073, + 1559 + ], + "score": 0.88, + "latex": "l _ { t h }" + }, + { + "category_id": 13, + "poly": [ + 578, + 676, + 606, + 676, + 606, + 705, + 578, + 705 + ], + "score": 0.88, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 539, + 1080, + 584, + 1080, + 584, + 1113, + 539, + 1113 + ], + "score": 0.87, + "latex": "\\mathbf { \\it { W } } _ { S } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 1268, + 1593, + 1327, + 1593, + 1327, + 1622, + 1268, + 1622 + ], + "score": 0.87, + "latex": "W ^ { \\mathcal { N } }" + }, + { + "category_id": 13, + "poly": [ + 818, + 385, + 844, + 385, + 844, + 411, + 818, + 411 + ], + "score": 0.86, + "latex": "o _ { t }" + }, + { + "category_id": 13, + "poly": [ + 711, + 476, + 738, + 476, + 738, + 503, + 711, + 503 + ], + "score": 0.85, + "latex": "o _ { t }" + }, + { + "category_id": 13, + "poly": [ + 486, + 880, + 517, + 880, + 517, + 906, + 486, + 906 + ], + "score": 0.85, + "latex": "\\mathcal { D } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 326, + 537, + 351, + 537, + 351, + 564, + 326, + 564 + ], + "score": 0.84, + "latex": "o _ { t }" + }, + { + "category_id": 13, + "poly": [ + 488, + 2006, + 514, + 2006, + 514, + 2032, + 488, + 2032 + ], + "score": 0.83, + "latex": "\\ell _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 789, + 997, + 814, + 997, + 814, + 1021, + 789, + 1021 + ], + "score": 0.83, + "latex": "o _ { t }" + }, + { + "category_id": 13, + "poly": [ + 610, + 905, + 653, + 905, + 653, + 932, + 610, + 932 + ], + "score": 0.82, + "latex": "\\hat { W } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 1025, + 534, + 1046, + 534, + 1046, + 560, + 1025, + 560 + ], + "score": 0.82, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 488, + 995, + 508, + 995, + 508, + 1019, + 488, + 1019 + ], + "score": 0.81, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 513, + 1052, + 533, + 1052, + 533, + 1075, + 513, + 1075 + ], + "score": 0.81, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 298, + 1656, + 316, + 1656, + 316, + 1682, + 298, + 1682 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 727, + 877, + 795, + 877, + 795, + 904, + 727, + 904 + ], + "score": 0.8, + "latex": "W ^ { t - 1 }" + }, + { + "category_id": 13, + "poly": [ + 626, + 1560, + 645, + 1560, + 645, + 1587, + 626, + 1587 + ], + "score": 0.8, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 418, + 935, + 529, + 935, + 529, + 961, + 418, + 961 + ], + "score": 0.79, + "latex": "l \\gets L - 1" + }, + { + "category_id": 13, + "poly": [ + 447, + 996, + 459, + 996, + 459, + 1019, + 447, + 1019 + ], + "score": 0.76, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 539, + 934, + 641, + 934, + 641, + 965, + 539, + 965 + ], + "score": 0.72, + "latex": "S = \\{ o _ { t } \\}" + }, + { + "category_id": 13, + "poly": [ + 472, + 1053, + 483, + 1053, + 483, + 1074, + 472, + 1074 + ], + "score": 0.71, + "latex": "_ { i }" + }, + { + "category_id": 13, + "poly": [ + 732, + 996, + 744, + 996, + 744, + 1019, + 732, + 1019 + ], + "score": 0.7, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 405, + 1393, + 420, + 1393, + 420, + 1417, + 405, + 1417 + ], + "score": 0.65, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 558, + 412, + 603, + 412, + 603, + 440, + 558, + 440 + ], + "score": 0.63, + "latex": "L – 1" + }, + { + "category_id": 13, + "poly": [ + 539, + 963, + 598, + 963, + 598, + 994, + 539, + 994 + ], + "score": 0.63, + "latex": "\\boldsymbol { W } _ { L , t } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 1174, + 381, + 1220, + 381, + 1220, + 409, + 1174, + 409 + ], + "score": 0.51, + "latex": "L – 1" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 2000.0, + 487.0, + 2000.0, + 487.0, + 2038.0, + 332.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 2000.0, + 1087.0, + 2000.0, + 1087.0, + 2038.0, + 515.0, + 2038.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": [ + 293.0, + 826.0, + 680.0, + 826.0, + 680.0, + 871.0, + 293.0, + 871.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": [ + 309.0, + 1464.0, + 1409.0, + 1464.0, + 1409.0, + 1504.0, + 309.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1498.0, + 1406.0, + 1498.0, + 1406.0, + 1532.0, + 295.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1528.0, + 1072.0, + 1528.0, + 1072.0, + 1563.0, + 294.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 1528.0, + 1404.0, + 1528.0, + 1404.0, + 1563.0, + 1109.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1554.0, + 625.0, + 1554.0, + 625.0, + 1594.0, + 290.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1554.0, + 1159.0, + 1554.0, + 1159.0, + 1594.0, + 646.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1554.0, + 1407.0, + 1554.0, + 1407.0, + 1594.0, + 1402.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1585.0, + 349.0, + 1585.0, + 349.0, + 1631.0, + 288.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1585.0, + 1267.0, + 1585.0, + 1267.0, + 1631.0, + 635.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 1585.0, + 1411.0, + 1585.0, + 1411.0, + 1631.0, + 1328.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1623.0, + 1406.0, + 1623.0, + 1406.0, + 1658.0, + 292.0, + 1658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1651.0, + 297.0, + 1651.0, + 297.0, + 1692.0, + 291.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1651.0, + 1406.0, + 1651.0, + 1406.0, + 1692.0, + 317.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1686.0, + 956.0, + 1686.0, + 956.0, + 1719.0, + 294.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 344.0, + 953.0, + 344.0, + 953.0, + 395.0, + 464.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 344.0, + 1410.0, + 344.0, + 1410.0, + 395.0, + 1018.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 382.0, + 817.0, + 382.0, + 817.0, + 413.0, + 295.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 845.0, + 382.0, + 1173.0, + 382.0, + 1173.0, + 413.0, + 845.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 382.0, + 1406.0, + 382.0, + 1406.0, + 413.0, + 1221.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 406.0, + 557.0, + 406.0, + 557.0, + 448.0, + 290.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 406.0, + 638.0, + 406.0, + 638.0, + 448.0, + 604.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 406.0, + 1408.0, + 406.0, + 1408.0, + 448.0, + 714.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 444.0, + 1405.0, + 444.0, + 1405.0, + 475.0, + 296.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 470.0, + 710.0, + 470.0, + 710.0, + 505.0, + 295.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 470.0, + 1403.0, + 470.0, + 1403.0, + 505.0, + 739.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 502.0, + 1405.0, + 502.0, + 1405.0, + 537.0, + 294.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 528.0, + 325.0, + 528.0, + 325.0, + 572.0, + 292.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 528.0, + 1024.0, + 528.0, + 1024.0, + 572.0, + 352.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 528.0, + 1181.0, + 528.0, + 1181.0, + 572.0, + 1047.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 528.0, + 1244.0, + 528.0, + 1244.0, + 572.0, + 1231.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 340.5, + 458.0, + 340.5, + 458.0, + 390.5, + 288.0, + 390.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1175.0, + 1407.0, + 1175.0, + 1407.0, + 1212.0, + 295.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1206.0, + 1408.0, + 1206.0, + 1408.0, + 1243.0, + 292.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1237.0, + 1407.0, + 1237.0, + 1407.0, + 1272.0, + 292.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1268.0, + 1406.0, + 1268.0, + 1406.0, + 1301.0, + 295.0, + 1301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1300.0, + 1406.0, + 1300.0, + 1406.0, + 1332.0, + 295.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1326.0, + 1407.0, + 1326.0, + 1407.0, + 1364.0, + 292.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1359.0, + 1407.0, + 1359.0, + 1407.0, + 1394.0, + 294.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1390.0, + 404.0, + 1390.0, + 404.0, + 1423.0, + 296.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 1390.0, + 1403.0, + 1390.0, + 1403.0, + 1423.0, + 421.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1419.0, + 864.0, + 1419.0, + 864.0, + 1457.0, + 294.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 672.0, + 577.0, + 672.0, + 577.0, + 707.0, + 292.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 672.0, + 1408.0, + 672.0, + 1408.0, + 707.0, + 607.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 701.0, + 1406.0, + 701.0, + 1406.0, + 741.0, + 292.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 734.0, + 1411.0, + 734.0, + 1411.0, + 771.0, + 292.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 765.0, + 904.0, + 765.0, + 904.0, + 800.0, + 294.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 1829.0, + 391.0, + 1829.0, + 391.0, + 1866.0, + 311.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 1829.0, + 1405.0, + 1829.0, + 1405.0, + 1866.0, + 472.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1858.0, + 1405.0, + 1858.0, + 1405.0, + 1897.0, + 294.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1887.0, + 1408.0, + 1887.0, + 1408.0, + 1929.0, + 292.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1919.0, + 1405.0, + 1919.0, + 1405.0, + 1957.0, + 295.0, + 1957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1950.0, + 663.0, + 1950.0, + 663.0, + 1986.0, + 295.0, + 1986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1240.0, + 227.0, + 1240.0, + 270.0, + 294.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 877.0, + 485.0, + 877.0, + 485.0, + 907.0, + 318.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 877.0, + 726.0, + 877.0, + 726.0, + 907.0, + 518.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 877.0, + 799.0, + 877.0, + 799.0, + 907.0, + 796.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 905.0, + 609.0, + 905.0, + 609.0, + 936.0, + 319.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 905.0, + 657.0, + 905.0, + 657.0, + 936.0, + 654.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 933.0, + 417.0, + 933.0, + 417.0, + 1003.0, + 314.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 933.0, + 538.0, + 933.0, + 538.0, + 1003.0, + 530.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 992.0, + 446.0, + 992.0, + 446.0, + 1025.0, + 319.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 992.0, + 487.0, + 992.0, + 487.0, + 1025.0, + 460.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 992.0, + 731.0, + 992.0, + 731.0, + 1025.0, + 509.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 992.0, + 788.0, + 992.0, + 788.0, + 1025.0, + 745.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 815.0, + 992.0, + 842.0, + 992.0, + 842.0, + 1025.0, + 815.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 992.0, + 1023.0, + 992.0, + 1023.0, + 1025.0, + 904.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1020.0, + 359.0, + 1020.0, + 359.0, + 1050.0, + 319.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 1020.0, + 573.0, + 1020.0, + 573.0, + 1050.0, + 537.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1035.0, + 471.0, + 1035.0, + 471.0, + 1101.0, + 331.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 1035.0, + 512.0, + 1035.0, + 512.0, + 1101.0, + 484.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 1035.0, + 809.0, + 1035.0, + 809.0, + 1101.0, + 534.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 1035.0, + 972.0, + 1035.0, + 972.0, + 1101.0, + 874.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 1035.0, + 1102.0, + 1035.0, + 1102.0, + 1101.0, + 1090.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1080.0, + 538.0, + 1080.0, + 538.0, + 1111.0, + 320.0, + 1111.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1248, + 1405, + 1248, + 1405, + 1525, + 297, + 1525 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 986, + 1405, + 986, + 1405, + 1235, + 297, + 1235 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 734, + 1403, + 734, + 1403, + 890, + 297, + 890 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1880, + 1403, + 1880, + 1403, + 2035, + 298, + 2035 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 228, + 1406, + 228, + 1406, + 415, + 297, + 415 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 605, + 924, + 1094, + 924, + 1094, + 974, + 605, + 974 + ], + "score": 0.942 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.902 + }, + { + "category_id": 9, + "poly": [ + 1366, + 937, + 1399, + 937, + 1399, + 966, + 1366, + 966 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 859, + 2089, + 859, + 2112, + 840, + 2112 + ], + "score": 0.796 + }, + { + "category_id": 5, + "poly": [ + 296, + 448, + 1402, + 448, + 1402, + 701, + 296, + 701 + ], + "score": 0.767, + "html": "
Algorithm3Dynamic Network Expansion
Input: Datatset Dt,Threshold T
Perform Algorithm 2 and compute L
if>Tthen
Add k units hat all layers
Solve for Eq. 5 at all layers
forl= L-1,...,1 do
Remove useless units in h
" + }, + { + "category_id": 5, + "poly": [ + 299, + 1560, + 1401, + 1560, + 1401, + 1824, + 299, + 1824 + ], + "score": 0.371, + "html": "
Algorithm 4 Network Split/Duplication
Input: Weight Wt-1, Threshold σ
Perform Eq.6 to obtain Wt forall hidden uniti do
p=|w-w-12
if p>σthen
Copy i into i’ (w' introduction of edges for i')
Perform Eq. 6 with the initialization of Wt to obtain Wt
" + }, + { + "category_id": 13, + "poly": [ + 1093, + 349, + 1169, + 349, + 1169, + 386, + 1093, + 386 + ], + "score": 0.93, + "latex": "\\mathbf { \\big . } W _ { l } ^ { t - 1 }" + }, + { + "category_id": 13, + "poly": [ + 754, + 1911, + 859, + 1911, + 859, + 1946, + 754, + 1946 + ], + "score": 0.93, + "latex": "\\{ z \\} _ { j } = t" + }, + { + "category_id": 14, + "poly": [ + 602, + 923, + 1096, + 923, + 1096, + 977, + 602, + 977 + ], + "score": 0.92, + "latex": "\\operatorname* { m i n i m i z e } _ { W ^ { t } } \\mathcal { L } ( W ^ { t } ; \\mathcal { D } _ { t } ) + \\lambda \\| W ^ { t } - W ^ { t - 1 } \\| _ { 2 } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1315, + 1310, + 1397, + 1310, + 1397, + 1344, + 1315, + 1344 + ], + "score": 0.92, + "latex": "\\rho _ { i } ^ { t } > \\sigma" + }, + { + "category_id": 13, + "poly": [ + 635, + 987, + 710, + 987, + 710, + 1018, + 635, + 1018 + ], + "score": 0.91, + "latex": "W ^ { t - 1 }" + }, + { + "category_id": 13, + "poly": [ + 466, + 1048, + 541, + 1048, + 541, + 1078, + 466, + 1078 + ], + "score": 0.91, + "latex": "\\pmb { W } ^ { \\top - 1 }" + }, + { + "category_id": 13, + "poly": [ + 1274, + 990, + 1404, + 990, + 1404, + 1021, + 1274, + 1021 + ], + "score": 0.89, + "latex": "\\{ 1 , \\ldots , t -" + }, + { + "category_id": 13, + "poly": [ + 344, + 550, + 413, + 550, + 413, + 576, + 344, + 576 + ], + "score": 0.89, + "latex": "\\mathcal { L } > \\tau" + }, + { + "category_id": 13, + "poly": [ + 819, + 1021, + 846, + 1021, + 846, + 1050, + 819, + 1050 + ], + "score": 0.88, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 471, + 574, + 512, + 574, + 512, + 603, + 471, + 603 + ], + "score": 0.88, + "latex": "h ^ { \\mathcal { N } }" + }, + { + "category_id": 13, + "poly": [ + 1236, + 1080, + 1283, + 1080, + 1283, + 1109, + 1236, + 1109 + ], + "score": 0.88, + "latex": "\\mathbf { \\mathbf { } } W ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 1077, + 858, + 1104, + 858, + 1104, + 888, + 1077, + 888 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1292, + 1021, + 1338, + 1021, + 1338, + 1047, + 1292, + 1047 + ], + "score": 0.87, + "latex": "\\mathbf { \\mathbf { \\mathbf { \\mathbf { W } } } ^ { t } }" + }, + { + "category_id": 13, + "poly": [ + 567, + 1311, + 595, + 1311, + 595, + 1341, + 567, + 1341 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1374, + 1113, + 1401, + 1113, + 1401, + 1141, + 1374, + 1141 + ], + "score": 0.86, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 456, + 1310, + 484, + 1310, + 484, + 1344, + 456, + 1344 + ], + "score": 0.86, + "latex": "\\rho _ { i } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 593, + 657, + 634, + 657, + 634, + 690, + 593, + 690 + ], + "score": 0.84, + "latex": "h _ { l } ^ { \\mathcal { N } }" + }, + { + "category_id": 13, + "poly": [ + 476, + 1606, + 544, + 1606, + 544, + 1635, + 476, + 1635 + ], + "score": 0.84, + "latex": "W ^ { t - 1 }" + }, + { + "category_id": 13, + "poly": [ + 617, + 1914, + 634, + 1914, + 634, + 1944, + 617, + 1944 + ], + "score": 0.83, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 486, + 495, + 517, + 495, + 517, + 522, + 486, + 522 + ], + "score": 0.83, + "latex": "\\mathcal { D } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 385, + 1021, + 405, + 1021, + 405, + 1047, + 385, + 1047 + ], + "score": 0.82, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 875, + 1051, + 895, + 1051, + 895, + 1077, + 875, + 1077 + ], + "score": 0.81, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 716, + 1779, + 759, + 1779, + 759, + 1812, + 716, + 1812 + ], + "score": 0.8, + "latex": "\\widetilde { W } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 1068, + 1082, + 1087, + 1082, + 1087, + 1108, + 1068, + 1108 + ], + "score": 0.8, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 524, + 1752, + 555, + 1752, + 555, + 1779, + 524, + 1779 + ], + "score": 0.8, + "latex": "\\mathbf { \\Delta } _ { w ^ { \\prime } }" + }, + { + "category_id": 13, + "poly": [ + 368, + 993, + 383, + 993, + 383, + 1017, + 368, + 1017 + ], + "score": 0.8, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 492, + 1752, + 511, + 1752, + 511, + 1778, + 492, + 1778 + ], + "score": 0.79, + "latex": "i ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 359, + 634, + 536, + 634, + 536, + 661, + 359, + 661 + ], + "score": 0.78, + "latex": "l = L - 1 , \\ldots , 1" + }, + { + "category_id": 13, + "poly": [ + 396, + 579, + 414, + 579, + 414, + 603, + 396, + 603 + ], + "score": 0.78, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 296, + 1019, + 326, + 1019, + 326, + 1052, + 296, + 1052 + ], + "score": 0.78, + "latex": "1 \\}" + }, + { + "category_id": 13, + "poly": [ + 818, + 1052, + 838, + 1052, + 838, + 1078, + 818, + 1078 + ], + "score": 0.77, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 803, + 262, + 822, + 262, + 822, + 289, + 803, + 289 + ], + "score": 0.75, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 380, + 1373, + 393, + 1373, + 393, + 1398, + 380, + 1398 + ], + "score": 0.73, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1197, + 1313, + 1211, + 1313, + 1211, + 1338, + 1197, + 1338 + ], + "score": 0.69, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 369, + 1726, + 444, + 1726, + 444, + 1754, + 369, + 1754 + ], + "score": 0.67, + "latex": "\\rho _ { i } ^ { t } > \\sigma" + }, + { + "category_id": 13, + "poly": [ + 812, + 1752, + 830, + 1752, + 830, + 1778, + 812, + 1778 + ], + "score": 0.66, + "latex": "i ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 432, + 1756, + 444, + 1756, + 444, + 1778, + 432, + 1778 + ], + "score": 0.65, + "latex": "_ { i }" + }, + { + "category_id": 13, + "poly": [ + 510, + 1672, + 522, + 1672, + 522, + 1694, + 510, + 1694 + ], + "score": 0.64, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1169, + 1915, + 1184, + 1915, + 1184, + 1939, + 1169, + 1939 + ], + "score": 0.59, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 857, + 1784, + 901, + 1784, + 901, + 1812, + 857, + 1812 + ], + "score": 0.58, + "latex": "\\mathbf { \\overline { { W } } } ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 673, + 524, + 694, + 524, + 694, + 548, + 673, + 548 + ], + "score": 0.56, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 663, + 1614, + 682, + 1614, + 682, + 1634, + 663, + 1634 + ], + "score": 0.55, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 1262, + 1976, + 1276, + 1976, + 1276, + 2001, + 1262, + 2001 + ], + "score": 0.54, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 635, + 500, + 653, + 500, + 653, + 520, + 635, + 520 + ], + "score": 0.53, + "latex": "\\tau" + }, + { + "category_id": 13, + "poly": [ + 564, + 1636, + 607, + 1636, + 607, + 1667, + 564, + 1667 + ], + "score": 0.42, + "latex": "\\widetilde { W } ^ { t }" + }, + { + "category_id": 14, + "poly": [ + 346, + 1695, + 565, + 1695, + 565, + 1727, + 346, + 1727 + ], + "score": 0.35, + "latex": "\\rho _ { i } ^ { t } = \\lVert \\mathbf { \\boldsymbol { w } } _ { i } ^ { t } - \\mathbf { \\boldsymbol { w } } _ { i } ^ { t - 1 } \\rVert _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1080, + 1312, + 1118, + 1312, + 1118, + 1339, + 1080, + 1339 + ], + "score": 0.35, + "latex": "t \\mathrm { - } 1" + }, + { + "category_id": 13, + "poly": [ + 432, + 1312, + 445, + 1312, + 445, + 1339, + 432, + 1339 + ], + "score": 0.32, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 346, + 1695, + 565, + 1695, + 565, + 1728, + 346, + 1728 + ], + "score": 0.26, + "latex": "{ \\boldsymbol \\rho } _ { i } ^ { t } = \\| { \\bf { w } } _ { i } ^ { t } - { \\bf { w } } _ { i } ^ { t - 1 } \\| _ { 2 }" + }, + { + "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": [ + 840.0, + 2087.0, + 862.0, + 2087.0, + 862.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1246.0, + 1405.0, + 1246.0, + 1405.0, + 1284.0, + 309.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1278.0, + 1405.0, + 1278.0, + 1405.0, + 1313.0, + 295.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1305.0, + 431.0, + 1305.0, + 431.0, + 1349.0, + 291.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 1305.0, + 455.0, + 1305.0, + 455.0, + 1349.0, + 446.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 485.0, + 1305.0, + 566.0, + 1305.0, + 566.0, + 1349.0, + 485.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 1305.0, + 1079.0, + 1305.0, + 1079.0, + 1349.0, + 596.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 1305.0, + 1196.0, + 1305.0, + 1196.0, + 1349.0, + 1119.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1212.0, + 1305.0, + 1314.0, + 1305.0, + 1314.0, + 1349.0, + 1212.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 1305.0, + 1410.0, + 1305.0, + 1410.0, + 1349.0, + 1398.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1339.0, + 1405.0, + 1339.0, + 1405.0, + 1376.0, + 294.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1372.0, + 379.0, + 1372.0, + 379.0, + 1405.0, + 295.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1372.0, + 1405.0, + 1372.0, + 1405.0, + 1405.0, + 394.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1402.0, + 1403.0, + 1402.0, + 1403.0, + 1435.0, + 296.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1431.0, + 1405.0, + 1431.0, + 1405.0, + 1468.0, + 295.0, + 1468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1462.0, + 1405.0, + 1462.0, + 1405.0, + 1499.0, + 295.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1493.0, + 1192.0, + 1493.0, + 1192.0, + 1529.0, + 295.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 986.0, + 367.0, + 986.0, + 367.0, + 1023.0, + 294.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 986.0, + 634.0, + 986.0, + 634.0, + 1023.0, + 384.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 986.0, + 1273.0, + 986.0, + 1273.0, + 1023.0, + 711.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1018.0, + 384.0, + 1018.0, + 384.0, + 1052.0, + 327.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 1018.0, + 818.0, + 1018.0, + 818.0, + 1052.0, + 406.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1018.0, + 1291.0, + 1018.0, + 1291.0, + 1052.0, + 847.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 1018.0, + 1405.0, + 1018.0, + 1405.0, + 1052.0, + 1339.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1045.0, + 465.0, + 1045.0, + 465.0, + 1086.0, + 292.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 1045.0, + 817.0, + 1045.0, + 817.0, + 1086.0, + 542.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 1045.0, + 874.0, + 1045.0, + 874.0, + 1086.0, + 839.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 896.0, + 1045.0, + 1407.0, + 1045.0, + 1407.0, + 1086.0, + 896.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1078.0, + 1067.0, + 1078.0, + 1067.0, + 1115.0, + 294.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 1078.0, + 1235.0, + 1078.0, + 1235.0, + 1115.0, + 1088.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1078.0, + 1406.0, + 1078.0, + 1406.0, + 1115.0, + 1284.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1109.0, + 1373.0, + 1109.0, + 1373.0, + 1147.0, + 292.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1109.0, + 1406.0, + 1109.0, + 1406.0, + 1147.0, + 1402.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1141.0, + 1408.0, + 1141.0, + 1408.0, + 1177.0, + 291.0, + 1177.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1170.0, + 1405.0, + 1170.0, + 1405.0, + 1206.0, + 294.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1203.0, + 1395.0, + 1203.0, + 1395.0, + 1237.0, + 296.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 736.0, + 1404.0, + 736.0, + 1404.0, + 769.0, + 296.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 765.0, + 1405.0, + 765.0, + 1405.0, + 803.0, + 295.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 792.0, + 1405.0, + 792.0, + 1405.0, + 835.0, + 294.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 823.0, + 1404.0, + 823.0, + 1404.0, + 865.0, + 292.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 857.0, + 1076.0, + 857.0, + 1076.0, + 895.0, + 295.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 857.0, + 1405.0, + 857.0, + 1405.0, + 895.0, + 1105.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1882.0, + 1408.0, + 1882.0, + 1408.0, + 1915.0, + 298.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 616.0, + 1911.0, + 616.0, + 1948.0, + 294.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 1911.0, + 753.0, + 1911.0, + 753.0, + 1948.0, + 635.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 1911.0, + 1168.0, + 1911.0, + 1168.0, + 1948.0, + 860.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1911.0, + 1407.0, + 1911.0, + 1407.0, + 1948.0, + 1185.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1976.0, + 296.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1969.0, + 1261.0, + 1969.0, + 1261.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 1969.0, + 1407.0, + 1969.0, + 1407.0, + 2009.0, + 1277.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2001.0, + 1407.0, + 2001.0, + 1407.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 228.0, + 1408.0, + 228.0, + 1408.0, + 265.0, + 310.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 260.0, + 802.0, + 260.0, + 802.0, + 296.0, + 295.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 260.0, + 1403.0, + 260.0, + 1403.0, + 296.0, + 823.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 289.0, + 1407.0, + 289.0, + 1407.0, + 328.0, + 291.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 322.0, + 1407.0, + 322.0, + 1407.0, + 357.0, + 295.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 346.0, + 1092.0, + 346.0, + 1092.0, + 389.0, + 290.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 346.0, + 1409.0, + 346.0, + 1409.0, + 389.0, + 1170.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 383.0, + 1409.0, + 383.0, + 1409.0, + 418.0, + 294.0, + 418.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1637, + 1405, + 1637, + 1405, + 2034, + 298, + 2034 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 299, + 1280, + 1405, + 1280, + 1405, + 1433, + 299, + 1433 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 876, + 1405, + 876, + 1405, + 1031, + 299, + 1031 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1141, + 1404, + 1141, + 1404, + 1265, + 298, + 1265 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 1448, + 1403, + 1448, + 1403, + 1542, + 299, + 1542 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 292, + 229, + 1402, + 229, + 1402, + 294, + 292, + 294 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 299, + 1046, + 1401, + 1046, + 1401, + 1108, + 299, + 1108 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 300, + 733, + 1398, + 733, + 1398, + 796, + 300, + 796 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 296, + 406, + 1402, + 406, + 1402, + 469, + 296, + 469 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 301, + 655, + 1400, + 655, + 1400, + 718, + 301, + 718 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 302, + 576, + 1402, + 576, + 1402, + 640, + 302, + 640 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 314, + 811, + 843, + 811, + 843, + 843, + 314, + 843 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 306, + 530, + 1069, + 530, + 1069, + 564, + 306, + 564 + ], + "score": 0.907 + }, + { + "category_id": 0, + "poly": [ + 300, + 337, + 541, + 337, + 541, + 372, + 300, + 372 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.9 + }, + { + "category_id": 0, + "poly": [ + 300, + 1580, + 704, + 1580, + 704, + 1611, + 300, + 1611 + ], + "score": 0.89 + }, + { + "category_id": 1, + "poly": [ + 310, + 483, + 925, + 483, + 925, + 516, + 310, + 516 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2111, + 841, + 2111 + ], + "score": 0.74 + }, + { + "category_id": 13, + "poly": [ + 1048, + 576, + 1123, + 576, + 1123, + 607, + 1048, + 607 + ], + "score": 0.9, + "latex": "W ^ { t - 1 }" + }, + { + "category_id": 13, + "poly": [ + 744, + 608, + 818, + 608, + 818, + 638, + 744, + 638 + ], + "score": 0.9, + "latex": "W ^ { t - 1 }" + }, + { + "category_id": 13, + "poly": [ + 739, + 969, + 805, + 969, + 805, + 998, + 739, + 998 + ], + "score": 0.89, + "latex": "5 \\times 5" + }, + { + "category_id": 13, + "poly": [ + 592, + 2003, + 682, + 2003, + 682, + 2032, + 592, + 2032 + ], + "score": 0.88, + "latex": "T = 5 0" + }, + { + "category_id": 13, + "poly": [ + 863, + 533, + 889, + 533, + 889, + 563, + 863, + 563 + ], + "score": 0.88, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 645, + 609, + 692, + 609, + 692, + 638, + 645, + 638 + ], + "score": 0.88, + "latex": "\\mathbf { \\mathbf { \\mathbf { \\mathbf { W } } } ^ { t } }" + }, + { + "category_id": 13, + "poly": [ + 353, + 611, + 379, + 611, + 379, + 640, + 353, + 640 + ], + "score": 0.87, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 826, + 577, + 873, + 577, + 873, + 607, + 826, + 607 + ], + "score": 0.85, + "latex": "\\mathbf { \\mathbf { } } W ^ { t }" + }, + { + "category_id": 13, + "poly": [ + 1107, + 1203, + 1307, + 1203, + 1307, + 1237, + 1107, + 1237 + ], + "score": 0.8, + "latex": "\\bar { 1 , 0 0 0 / 2 0 0 / 5 , 0 0 0 }" + }, + { + "category_id": 13, + "poly": [ + 802, + 580, + 815, + 580, + 815, + 606, + 802, + 606 + ], + "score": 0.64, + "latex": "t" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 334.0, + 545.0, + 334.0, + 545.0, + 378.0, + 293.0, + 378.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, + 1578.0, + 710.0, + 1578.0, + 710.0, + 1617.0, + 293.0, + 1617.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, + 1635.0, + 1403.0, + 1635.0, + 1403.0, + 1674.0, + 293.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1667.0, + 1407.0, + 1667.0, + 1407.0, + 1703.0, + 295.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1697.0, + 1408.0, + 1697.0, + 1408.0, + 1735.0, + 291.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1728.0, + 1405.0, + 1728.0, + 1405.0, + 1764.0, + 295.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1757.0, + 1405.0, + 1757.0, + 1405.0, + 1795.0, + 292.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1784.0, + 1406.0, + 1784.0, + 1406.0, + 1829.0, + 291.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1819.0, + 1407.0, + 1819.0, + 1407.0, + 1856.0, + 292.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1850.0, + 1406.0, + 1850.0, + 1406.0, + 1885.0, + 293.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1881.0, + 1407.0, + 1881.0, + 1407.0, + 1917.0, + 293.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1908.0, + 1407.0, + 1908.0, + 1407.0, + 1949.0, + 292.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1943.0, + 1406.0, + 1943.0, + 1406.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1970.0, + 1409.0, + 1970.0, + 1409.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 591.0, + 2002.0, + 591.0, + 2039.0, + 295.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 2002.0, + 1407.0, + 2002.0, + 1407.0, + 2039.0, + 683.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1280.0, + 1407.0, + 1280.0, + 1407.0, + 1317.0, + 309.0, + 1317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1312.0, + 1405.0, + 1312.0, + 1405.0, + 1345.0, + 294.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1341.0, + 1409.0, + 1341.0, + 1409.0, + 1378.0, + 294.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1370.0, + 1407.0, + 1370.0, + 1407.0, + 1408.0, + 293.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1403.0, + 458.0, + 1403.0, + 458.0, + 1436.0, + 294.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 878.0, + 1405.0, + 878.0, + 1405.0, + 911.0, + 297.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 906.0, + 1405.0, + 906.0, + 1405.0, + 942.0, + 292.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 939.0, + 1403.0, + 939.0, + 1403.0, + 972.0, + 295.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 967.0, + 738.0, + 967.0, + 738.0, + 1004.0, + 294.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 967.0, + 1409.0, + 967.0, + 1409.0, + 1004.0, + 806.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 999.0, + 601.0, + 999.0, + 601.0, + 1036.0, + 293.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1142.0, + 1402.0, + 1142.0, + 1402.0, + 1175.0, + 294.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1171.0, + 1404.0, + 1171.0, + 1404.0, + 1207.0, + 293.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1201.0, + 1106.0, + 1201.0, + 1106.0, + 1240.0, + 292.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1308.0, + 1201.0, + 1405.0, + 1201.0, + 1405.0, + 1240.0, + 1308.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1236.0, + 1386.0, + 1236.0, + 1386.0, + 1268.0, + 294.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1446.0, + 1407.0, + 1446.0, + 1407.0, + 1485.0, + 308.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1479.0, + 1403.0, + 1479.0, + 1403.0, + 1516.0, + 293.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1508.0, + 1363.0, + 1508.0, + 1363.0, + 1547.0, + 292.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 263.0, + 1394.0, + 263.0, + 1394.0, + 295.0, + 296.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 1045.0, + 1403.0, + 1045.0, + 1403.0, + 1081.0, + 312.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1078.0, + 1224.0, + 1078.0, + 1224.0, + 1110.0, + 297.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 733.0, + 1403.0, + 733.0, + 1403.0, + 768.0, + 311.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 765.0, + 1071.0, + 765.0, + 1071.0, + 798.0, + 294.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 403.0, + 1406.0, + 403.0, + 1406.0, + 443.0, + 294.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 435.0, + 751.0, + 435.0, + 751.0, + 473.0, + 293.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 652.0, + 1405.0, + 652.0, + 1405.0, + 693.0, + 308.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 687.0, + 503.0, + 687.0, + 503.0, + 720.0, + 297.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 573.0, + 801.0, + 573.0, + 801.0, + 613.0, + 309.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 816.0, + 573.0, + 825.0, + 573.0, + 825.0, + 613.0, + 816.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 573.0, + 1047.0, + 573.0, + 1047.0, + 613.0, + 874.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 573.0, + 1406.0, + 573.0, + 1406.0, + 613.0, + 1124.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 608.0, + 352.0, + 608.0, + 352.0, + 640.0, + 294.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 608.0, + 644.0, + 608.0, + 644.0, + 640.0, + 380.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 693.0, + 608.0, + 743.0, + 608.0, + 743.0, + 640.0, + 693.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 608.0, + 829.0, + 608.0, + 829.0, + 640.0, + 819.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 808.0, + 846.0, + 808.0, + 846.0, + 849.0, + 310.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 526.0, + 862.0, + 526.0, + 862.0, + 570.0, + 310.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 526.0, + 1075.0, + 526.0, + 1075.0, + 570.0, + 890.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 482.0, + 931.0, + 482.0, + 931.0, + 520.0, + 311.0, + 520.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1601, + 1405, + 1601, + 1405, + 1936, + 298, + 1936 + ], + "score": 0.983 + }, + { + "category_id": 3, + "poly": [ + 286, + 230, + 1378, + 230, + 1378, + 896, + 286, + 896 + ], + "score": 0.971 + }, + { + "category_id": 4, + "poly": [ + 296, + 923, + 1408, + 923, + 1408, + 1035, + 296, + 1035 + ], + "score": 0.963 + }, + { + "category_id": 4, + "poly": [ + 298, + 1350, + 1408, + 1350, + 1408, + 1462, + 298, + 1462 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 296, + 1522, + 1401, + 1522, + 1401, + 1586, + 296, + 1586 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 295, + 1972, + 1402, + 1972, + 1402, + 2034, + 295, + 2034 + ], + "score": 0.943 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.881 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.791 + }, + { + "category_id": 3, + "poly": [ + 310, + 1084, + 1439, + 1084, + 1439, + 1320, + 310, + 1320 + ], + "score": 0.758 + }, + { + "category_id": 13, + "poly": [ + 516, + 1753, + 592, + 1753, + 592, + 1783, + 516, + 1783 + ], + "score": 0.89, + "latex": "1 1 . 9 \\%" + }, + { + "category_id": 13, + "poly": [ + 699, + 1007, + 761, + 1007, + 761, + 1033, + 699, + 1033 + ], + "score": 0.87, + "latex": "1 0 0 \\%" + }, + { + "category_id": 13, + "poly": [ + 382, + 1753, + 458, + 1753, + 458, + 1784, + 382, + 1784 + ], + "score": 0.86, + "latex": "6 0 . 3 \\%" + }, + { + "category_id": 13, + "poly": [ + 296, + 1752, + 371, + 1752, + 371, + 1784, + 296, + 1784 + ], + "score": 0.86, + "latex": "1 8 . 0 \\%" + }, + { + "category_id": 13, + "poly": [ + 394, + 980, + 462, + 980, + 462, + 1007, + 394, + 1007 + ], + "score": 0.86, + "latex": "t = T" + }, + { + "category_id": 13, + "poly": [ + 565, + 867, + 626, + 867, + 626, + 894, + 565, + 894 + ], + "score": 0.7, + "latex": "\\mathrm { { T } = 1 0 }" + }, + { + "category_id": 13, + "poly": [ + 1186, + 927, + 1199, + 927, + 1199, + 949, + 1186, + 949 + ], + "score": 0.49, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1053, + 1221, + 1114, + 1221, + 1114, + 1247, + 1053, + 1247 + ], + "score": 0.43, + "latex": "( \\mathrm { k } { = } 2 0 )" + }, + { + "category_id": 13, + "poly": [ + 911, + 866, + 973, + 866, + 973, + 894, + 911, + 894 + ], + "score": 0.42, + "latex": "\\mathrm { { T } = 1 0 }" + }, + { + "category_id": 13, + "poly": [ + 1253, + 866, + 1315, + 866, + 1315, + 894, + 1253, + 894 + ], + "score": 0.29, + "latex": "\\mathrm { T } { = } 5 0 _ { , }" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 230.0, + 640.0, + 230.0, + 640.0, + 254.0, + 288.0, + 254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 230.0, + 995.0, + 230.0, + 995.0, + 253.0, + 687.0, + 253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 229.0, + 1380.0, + 229.0, + 1380.0, + 249.0, + 1058.0, + 249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 247.0, + 320.0, + 247.0, + 320.0, + 261.0, + 296.0, + 261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 266.0, + 363.0, + 266.0, + 363.0, + 308.0, + 346.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 457.0, + 252.0, + 568.0, + 252.0, + 568.0, + 297.0, + 457.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 246.0, + 714.0, + 246.0, + 714.0, + 292.0, + 673.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 256.0, + 738.0, + 256.0, + 738.0, + 276.0, + 718.0, + 276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 785.0, + 256.0, + 803.0, + 256.0, + 803.0, + 281.0, + 785.0, + 281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 817.0, + 254.0, + 836.0, + 254.0, + 836.0, + 288.0, + 817.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 253.0, + 869.0, + 253.0, + 869.0, + 288.0, + 849.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 253.0, + 902.0, + 253.0, + 902.0, + 290.0, + 882.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 252.0, + 936.0, + 252.0, + 936.0, + 288.0, + 913.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 254.0, + 966.0, + 254.0, + 966.0, + 295.0, + 946.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 982.0, + 253.0, + 996.0, + 253.0, + 996.0, + 292.0, + 982.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 277.0, + 1074.0, + 277.0, + 1074.0, + 292.0, + 1054.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 277.0, + 1104.0, + 277.0, + 1104.0, + 290.0, + 1077.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 288.0, + 322.0, + 288.0, + 322.0, + 302.0, + 302.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 290.0, + 573.0, + 290.0, + 573.0, + 322.0, + 460.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 300.0, + 697.0, + 300.0, + 697.0, + 319.0, + 671.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 298.0, + 734.0, + 298.0, + 734.0, + 310.0, + 724.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 309.0, + 770.0, + 309.0, + 770.0, + 324.0, + 754.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 309.0, + 1075.0, + 309.0, + 1075.0, + 324.0, + 1054.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 329.0, + 320.0, + 329.0, + 320.0, + 403.0, + 284.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 334.0, + 392.0, + 334.0, + 392.0, + 375.0, + 381.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 327.0, + 427.0, + 327.0, + 427.0, + 348.0, + 414.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 315.0, + 604.0, + 315.0, + 604.0, + 387.0, + 445.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 363.0, + 622.0, + 363.0, + 622.0, + 385.0, + 608.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 330.0, + 709.0, + 330.0, + 709.0, + 416.0, + 650.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 725.0, + 319.0, + 735.0, + 319.0, + 735.0, + 331.0, + 725.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 330.0, + 771.0, + 330.0, + 771.0, + 345.0, + 750.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 786.0, + 327.0, + 805.0, + 327.0, + 805.0, + 341.0, + 786.0, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 331.0, + 834.0, + 331.0, + 834.0, + 345.0, + 818.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 339.0, + 948.0, + 339.0, + 948.0, + 384.0, + 838.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 340.0, + 995.0, + 340.0, + 995.0, + 351.0, + 983.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 327.0, + 1092.0, + 327.0, + 1092.0, + 406.0, + 1039.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 346.0, + 1118.0, + 346.0, + 1118.0, + 359.0, + 1108.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 324.0, + 1197.0, + 324.0, + 1197.0, + 335.0, + 1185.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 339.0, + 1232.0, + 339.0, + 1232.0, + 349.0, + 1221.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 322.0, + 1368.0, + 322.0, + 1368.0, + 365.0, + 1334.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 384.0, + 457.0, + 384.0, + 457.0, + 393.0, + 447.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 393.0, + 499.0, + 393.0, + 499.0, + 412.0, + 477.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 387.0, + 695.0, + 387.0, + 695.0, + 402.0, + 677.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 378.0, + 940.0, + 378.0, + 940.0, + 413.0, + 838.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 390.0, + 1277.0, + 390.0, + 1277.0, + 400.0, + 1263.0, + 400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 413.0, + 322.0, + 413.0, + 322.0, + 472.0, + 294.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 409.0, + 392.0, + 409.0, + 392.0, + 421.0, + 383.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 434.0, + 461.0, + 434.0, + 461.0, + 451.0, + 445.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 462.0, + 494.0, + 462.0, + 494.0, + 477.0, + 477.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 463.0, + 527.0, + 463.0, + 527.0, + 477.0, + 507.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 407.0, + 559.0, + 407.0, + 559.0, + 471.0, + 540.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 463.0, + 597.0, + 463.0, + 597.0, + 477.0, + 574.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 422.0, + 621.0, + 422.0, + 621.0, + 489.0, + 610.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 672.0, + 413.0, + 698.0, + 413.0, + 698.0, + 487.0, + 672.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 431.0, + 769.0, + 431.0, + 769.0, + 447.0, + 753.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 786.0, + 432.0, + 803.0, + 432.0, + 803.0, + 448.0, + 786.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 458.0, + 836.0, + 458.0, + 836.0, + 474.0, + 820.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 417.0, + 996.0, + 417.0, + 996.0, + 479.0, + 837.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 404.0, + 1074.0, + 404.0, + 1074.0, + 482.0, + 1052.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 412.0, + 1251.0, + 412.0, + 1251.0, + 496.0, + 1080.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 486.0, + 1106.0, + 486.0, + 1106.0, + 501.0, + 1089.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 485.0, + 1187.0, + 485.0, + 1187.0, + 505.0, + 1114.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 497.0, + 323.0, + 497.0, + 323.0, + 515.0, + 294.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 499.0, + 1073.0, + 499.0, + 1073.0, + 513.0, + 1054.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 497.0, + 1266.0, + 497.0, + 1266.0, + 538.0, + 1168.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 508.0, + 361.0, + 508.0, + 361.0, + 523.0, + 347.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 509.0, + 392.0, + 509.0, + 392.0, + 521.0, + 381.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 510.0, + 425.0, + 510.0, + 425.0, + 520.0, + 415.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 510.0, + 457.0, + 510.0, + 457.0, + 520.0, + 446.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 510.0, + 489.0, + 510.0, + 489.0, + 520.0, + 479.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 510.0, + 522.0, + 510.0, + 522.0, + 519.0, + 512.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 509.0, + 555.0, + 509.0, + 555.0, + 521.0, + 544.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 508.0, + 590.0, + 508.0, + 590.0, + 523.0, + 575.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 508.0, + 622.0, + 508.0, + 622.0, + 523.0, + 606.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 508.0, + 738.0, + 508.0, + 738.0, + 523.0, + 719.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 506.0, + 770.0, + 506.0, + 770.0, + 523.0, + 753.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 505.0, + 805.0, + 505.0, + 805.0, + 524.0, + 784.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 817.0, + 506.0, + 834.0, + 506.0, + 834.0, + 521.0, + 817.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 508.0, + 868.0, + 508.0, + 868.0, + 523.0, + 849.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 508.0, + 900.0, + 508.0, + 900.0, + 523.0, + 883.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 508.0, + 933.0, + 508.0, + 933.0, + 523.0, + 915.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 508.0, + 966.0, + 508.0, + 966.0, + 523.0, + 947.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 979.0, + 508.0, + 1000.0, + 508.0, + 1000.0, + 523.0, + 979.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 508.0, + 1100.0, + 508.0, + 1100.0, + 520.0, + 1089.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 506.0, + 1134.0, + 506.0, + 1134.0, + 521.0, + 1118.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 506.0, + 1165.0, + 506.0, + 1165.0, + 520.0, + 1147.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 506.0, + 1223.0, + 506.0, + 1223.0, + 520.0, + 1206.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1265.0, + 506.0, + 1284.0, + 506.0, + 1284.0, + 520.0, + 1265.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 505.0, + 1313.0, + 505.0, + 1313.0, + 520.0, + 1295.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1325.0, + 505.0, + 1344.0, + 505.0, + 1344.0, + 520.0, + 1325.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 505.0, + 1372.0, + 505.0, + 1372.0, + 520.0, + 1355.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 518.0, + 507.0, + 518.0, + 507.0, + 534.0, + 420.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 516.0, + 888.0, + 516.0, + 888.0, + 539.0, + 796.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 702.0, + 547.0, + 996.0, + 547.0, + 996.0, + 572.0, + 702.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 565.0, + 650.0, + 565.0, + 650.0, + 591.0, + 302.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 566.0, + 704.0, + 566.0, + 704.0, + 579.0, + 681.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 564.0, + 1382.0, + 564.0, + 1382.0, + 593.0, + 1072.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 584.0, + 330.0, + 584.0, + 330.0, + 598.0, + 306.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 579.0, + 765.0, + 579.0, + 765.0, + 596.0, + 749.0, + 596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 582.0, + 1079.0, + 582.0, + 1079.0, + 600.0, + 1052.0, + 600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 594.0, + 384.0, + 594.0, + 384.0, + 611.0, + 368.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 596.0, + 707.0, + 596.0, + 707.0, + 613.0, + 678.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 596.0, + 1132.0, + 596.0, + 1132.0, + 622.0, + 1114.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 597.0, + 1249.0, + 597.0, + 1249.0, + 612.0, + 1232.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 606.0, + 332.0, + 606.0, + 332.0, + 625.0, + 303.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 608.0, + 1083.0, + 608.0, + 1083.0, + 626.0, + 1058.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 608.0, + 1372.0, + 608.0, + 1372.0, + 622.0, + 1355.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 620.0, + 765.0, + 620.0, + 765.0, + 635.0, + 749.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 616.0, + 945.0, + 616.0, + 945.0, + 640.0, + 866.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 630.0, + 332.0, + 630.0, + 332.0, + 649.0, + 303.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 627.0, + 707.0, + 627.0, + 707.0, + 645.0, + 678.0, + 645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 630.0, + 798.0, + 630.0, + 798.0, + 641.0, + 787.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 636.0, + 947.0, + 636.0, + 947.0, + 656.0, + 867.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 635.0, + 1079.0, + 635.0, + 1079.0, + 654.0, + 1051.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 654.0, + 332.0, + 654.0, + 332.0, + 736.0, + 289.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 655.0, + 387.0, + 655.0, + 387.0, + 697.0, + 351.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 666.0, + 660.0, + 705.0, + 660.0, + 705.0, + 726.0, + 666.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 654.0, + 990.0, + 654.0, + 990.0, + 710.0, + 867.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 663.0, + 1090.0, + 663.0, + 1090.0, + 747.0, + 1032.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 700.0, + 332.0, + 700.0, + 332.0, + 719.0, + 309.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 712.0, + 351.0, + 712.0, + 351.0, + 729.0, + 337.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 710.0, + 601.0, + 710.0, + 601.0, + 720.0, + 587.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 709.0, + 782.0, + 709.0, + 782.0, + 724.0, + 764.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 710.0, + 906.0, + 710.0, + 906.0, + 727.0, + 889.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 709.0, + 1094.0, + 709.0, + 1094.0, + 731.0, + 1059.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 724.0, + 330.0, + 724.0, + 330.0, + 743.0, + 304.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 442.0, + 732.0, + 453.0, + 732.0, + 453.0, + 741.0, + 442.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 723.0, + 705.0, + 723.0, + 705.0, + 741.0, + 678.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 727.0, + 740.0, + 727.0, + 740.0, + 742.0, + 724.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 748.0, + 332.0, + 748.0, + 332.0, + 767.0, + 303.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 749.0, + 387.0, + 749.0, + 387.0, + 760.0, + 378.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 738.0, + 568.0, + 738.0, + 568.0, + 762.0, + 488.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 746.0, + 914.0, + 746.0, + 914.0, + 752.0, + 908.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 741.0, + 1079.0, + 741.0, + 1079.0, + 758.0, + 1052.0, + 758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1326.0, + 746.0, + 1336.0, + 746.0, + 1336.0, + 756.0, + 1326.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 754.0, + 570.0, + 754.0, + 570.0, + 778.0, + 488.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 754.0, + 705.0, + 754.0, + 705.0, + 772.0, + 678.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 754.0, + 1177.0, + 754.0, + 1177.0, + 766.0, + 1167.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 772.0, + 330.0, + 772.0, + 330.0, + 791.0, + 303.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 772.0, + 376.0, + 772.0, + 376.0, + 787.0, + 361.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 767.0, + 1082.0, + 767.0, + 1082.0, + 786.0, + 1058.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 763.0, + 1336.0, + 763.0, + 1336.0, + 792.0, + 1269.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 796.0, + 332.0, + 796.0, + 332.0, + 814.0, + 303.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 487.0, + 789.0, + 597.0, + 789.0, + 597.0, + 829.0, + 487.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 787.0, + 705.0, + 787.0, + 705.0, + 805.0, + 678.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 792.0, + 1079.0, + 792.0, + 1079.0, + 811.0, + 1052.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 802.0, + 1092.0, + 802.0, + 1092.0, + 812.0, + 1083.0, + 812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 810.0, + 1128.0, + 810.0, + 1128.0, + 820.0, + 1118.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 785.0, + 1370.0, + 785.0, + 1370.0, + 830.0, + 1270.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 819.0, + 339.0, + 819.0, + 339.0, + 846.0, + 303.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 829.0, + 396.0, + 829.0, + 396.0, + 846.0, + 371.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 829.0, + 513.0, + 829.0, + 513.0, + 862.0, + 425.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 828.0, + 556.0, + 828.0, + 556.0, + 846.0, + 532.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 829.0, + 611.0, + 829.0, + 611.0, + 846.0, + 582.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 819.0, + 710.0, + 819.0, + 710.0, + 844.0, + 678.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 826.0, + 772.0, + 826.0, + 772.0, + 844.0, + 746.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 826.0, + 885.0, + 826.0, + 885.0, + 859.0, + 802.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.0, + 826.0, + 939.0, + 826.0, + 939.0, + 844.0, + 914.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 826.0, + 997.0, + 826.0, + 997.0, + 844.0, + 967.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 819.0, + 1085.0, + 819.0, + 1085.0, + 845.0, + 1058.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 829.0, + 1152.0, + 829.0, + 1152.0, + 846.0, + 1123.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 829.0, + 1269.0, + 829.0, + 1269.0, + 862.0, + 1181.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1299.0, + 829.0, + 1329.0, + 829.0, + 1329.0, + 846.0, + 1299.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1357.0, + 829.0, + 1383.0, + 829.0, + 1383.0, + 846.0, + 1357.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 864.0, + 564.0, + 864.0, + 564.0, + 897.0, + 340.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 864.0, + 636.0, + 864.0, + 636.0, + 897.0, + 627.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 864.0, + 910.0, + 864.0, + 910.0, + 899.0, + 743.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 864.0, + 983.0, + 864.0, + 983.0, + 899.0, + 974.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 863.0, + 1252.0, + 863.0, + 1252.0, + 897.0, + 1147.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1316.0, + 863.0, + 1326.0, + 863.0, + 1326.0, + 897.0, + 1316.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 270.0, + 1373.0, + 270.0, + 1373.0, + 295.5, + 1098.0, + 295.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 294.0, + 1228.0, + 294.0, + 1228.0, + 327.0, + 1100.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 300.0, + 376.0, + 300.0, + 376.0, + 339.0, + 341.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 331.0, + 1113.0, + 331.0, + 1113.0, + 349.0, + 1078.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 359.0, + 1136.0, + 359.0, + 1136.0, + 377.0, + 1113.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.25, + 359.5, + 1148.25, + 359.5, + 1148.25, + 373.5, + 1136.25, + 373.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1163.25, + 360.0, + 1180.25, + 360.0, + 1180.25, + 374.0, + 1163.25, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 379.0, + 1264.0, + 379.0, + 1264.0, + 415.5, + 1143.0, + 415.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 394.0, + 739.0, + 394.0, + 739.0, + 413.5, + 719.0, + 413.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 403.0, + 427.0, + 403.0, + 427.0, + 418.5, + 413.0, + 418.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 402.5, + 952.0, + 402.5, + 952.0, + 426.5, + 839.0, + 426.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1267.0, + 395.0, + 1373.0, + 395.0, + 1373.0, + 418.5, + 1267.0, + 418.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 412.0, + 607.0, + 412.0, + 607.0, + 428.0, + 574.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.75, + 447.0, + 934.75, + 447.0, + 934.75, + 462.5, + 914.75, + 462.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 497.5, + 699.0, + 497.5, + 699.0, + 520.5, + 684.0, + 520.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 629.0, + 1106.0, + 629.0, + 1106.0, + 647.0, + 1097.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.25, + 747.0, + 804.25, + 747.0, + 804.25, + 761.5, + 778.25, + 761.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 485.75, + 771.5, + 616.75, + 771.5, + 616.75, + 795.5, + 485.75, + 795.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 919.0, + 1185.0, + 919.0, + 1185.0, + 958.0, + 294.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 919.0, + 1406.0, + 919.0, + 1406.0, + 958.0, + 1200.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 951.0, + 1405.0, + 951.0, + 1405.0, + 984.0, + 295.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 979.0, + 393.0, + 979.0, + 393.0, + 1012.0, + 295.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 979.0, + 1405.0, + 979.0, + 1405.0, + 1012.0, + 463.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1007.0, + 698.0, + 1007.0, + 698.0, + 1037.0, + 294.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 1007.0, + 770.0, + 1007.0, + 770.0, + 1037.0, + 762.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1346.0, + 1405.0, + 1346.0, + 1405.0, + 1385.0, + 295.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1378.0, + 1405.0, + 1378.0, + 1405.0, + 1411.0, + 295.0, + 1411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1405.0, + 1405.0, + 1405.0, + 1405.0, + 1438.0, + 295.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1432.0, + 1079.0, + 1432.0, + 1079.0, + 1466.0, + 295.0, + 1466.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": [ + 839.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1084.0, + 565.0, + 1084.0, + 565.0, + 1109.0, + 323.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1084.0, + 834.0, + 1084.0, + 834.0, + 1109.0, + 617.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 1100.0, + 362.0, + 1100.0, + 362.0, + 1118.0, + 337.0, + 1118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 1108.0, + 480.0, + 1108.0, + 480.0, + 1130.0, + 426.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 1108.0, + 823.0, + 1108.0, + 823.0, + 1128.0, + 716.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 1100.0, + 982.0, + 1100.0, + 982.0, + 1130.0, + 890.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 1097.0, + 1270.0, + 1097.0, + 1270.0, + 1131.0, + 1168.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1316.0, + 1097.0, + 1428.0, + 1097.0, + 1428.0, + 1135.0, + 1316.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1128.0, + 376.0, + 1128.0, + 376.0, + 1227.0, + 298.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1139.0, + 403.0, + 1139.0, + 403.0, + 1159.0, + 380.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1118.0, + 533.0, + 1118.0, + 533.0, + 1159.0, + 424.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 1122.0, + 642.0, + 1122.0, + 642.0, + 1247.0, + 596.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 1122.0, + 784.0, + 1122.0, + 784.0, + 1143.0, + 727.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 1135.0, + 992.0, + 1135.0, + 992.0, + 1165.0, + 890.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 1136.0, + 1288.0, + 1136.0, + 1288.0, + 1165.0, + 1146.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1361.0, + 1139.0, + 1381.0, + 1139.0, + 1381.0, + 1163.0, + 1361.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 1159.0, + 1092.0, + 1159.0, + 1092.0, + 1196.0, + 889.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 1163.0, + 1287.0, + 1163.0, + 1287.0, + 1193.0, + 1145.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1358.0, + 1163.0, + 1384.0, + 1163.0, + 1384.0, + 1193.0, + 1358.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 1192.0, + 643.0, + 1192.0, + 643.0, + 1212.0, + 620.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 1189.0, + 1127.0, + 1189.0, + 1127.0, + 1222.0, + 890.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 1190.0, + 1288.0, + 1190.0, + 1288.0, + 1220.0, + 1145.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1188.0, + 1399.0, + 1188.0, + 1399.0, + 1220.0, + 1343.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1222.0, + 462.0, + 1222.0, + 462.0, + 1244.0, + 439.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1219.0, + 549.0, + 1219.0, + 549.0, + 1240.0, + 529.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 1216.0, + 1052.0, + 1216.0, + 1052.0, + 1249.0, + 891.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 1216.0, + 1127.0, + 1216.0, + 1127.0, + 1249.0, + 1115.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 1218.0, + 1288.0, + 1218.0, + 1288.0, + 1248.0, + 1146.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1342.0, + 1214.0, + 1401.0, + 1214.0, + 1401.0, + 1251.0, + 1342.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1237.0, + 365.0, + 1237.0, + 365.0, + 1261.0, + 328.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 1251.0, + 398.0, + 1251.0, + 398.0, + 1272.0, + 374.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 1251.0, + 446.0, + 1251.0, + 446.0, + 1272.0, + 420.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1251.0, + 489.0, + 1251.0, + 489.0, + 1272.0, + 464.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1251.0, + 535.0, + 1251.0, + 535.0, + 1272.0, + 510.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1241.0, + 643.0, + 1241.0, + 643.0, + 1257.0, + 627.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 1256.0, + 693.0, + 1256.0, + 693.0, + 1266.0, + 682.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 1253.0, + 791.0, + 1253.0, + 791.0, + 1270.0, + 773.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 1242.0, + 1055.0, + 1242.0, + 1055.0, + 1280.0, + 889.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 1247.0, + 1289.0, + 1247.0, + 1289.0, + 1277.0, + 1146.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1314.0, + 1247.0, + 1428.0, + 1247.0, + 1428.0, + 1277.0, + 1314.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 1262.0, + 487.0, + 1262.0, + 487.0, + 1293.0, + 421.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1264.0, + 758.0, + 1264.0, + 758.0, + 1290.0, + 709.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 1274.0, + 1303.0, + 1274.0, + 1303.0, + 1307.0, + 1020.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1289.0, + 561.0, + 1289.0, + 561.0, + 1321.0, + 325.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1289.0, + 834.0, + 1289.0, + 834.0, + 1321.0, + 618.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.75, + 1098.0, + 639.75, + 1098.0, + 639.75, + 1117.0, + 613.75, + 1117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 1600.0, + 1406.0, + 1600.0, + 1406.0, + 1635.0, + 311.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1633.0, + 1405.0, + 1633.0, + 1405.0, + 1667.0, + 295.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1662.0, + 1403.0, + 1662.0, + 1403.0, + 1697.0, + 295.0, + 1697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1688.0, + 1406.0, + 1688.0, + 1406.0, + 1731.0, + 292.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1720.0, + 1406.0, + 1720.0, + 1406.0, + 1761.0, + 292.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1751.0, + 295.0, + 1751.0, + 295.0, + 1788.0, + 292.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1751.0, + 381.0, + 1751.0, + 381.0, + 1788.0, + 372.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 1751.0, + 515.0, + 1751.0, + 515.0, + 1788.0, + 459.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1751.0, + 1407.0, + 1751.0, + 1407.0, + 1788.0, + 593.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1780.0, + 1406.0, + 1780.0, + 1406.0, + 1820.0, + 292.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1813.0, + 1406.0, + 1813.0, + 1406.0, + 1850.0, + 292.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1843.0, + 1406.0, + 1843.0, + 1406.0, + 1880.0, + 292.0, + 1880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1872.0, + 1407.0, + 1872.0, + 1407.0, + 1913.0, + 293.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1904.0, + 1387.0, + 1904.0, + 1387.0, + 1940.0, + 293.0, + 1940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1519.0, + 1405.0, + 1519.0, + 1405.0, + 1562.0, + 294.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1551.0, + 992.0, + 1551.0, + 992.0, + 1591.0, + 294.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1969.0, + 1406.0, + 1969.0, + 1406.0, + 2008.0, + 294.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 1405.0, + 2002.0, + 1405.0, + 2036.0, + 293.0, + 2036.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1131, + 1404, + 1131, + 1404, + 1469, + 298, + 1469 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 1728, + 1404, + 1728, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 734, + 1405, + 734, + 1405, + 1070, + 298, + 1070 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1529, + 1404, + 1529, + 1404, + 1713, + 298, + 1713 + ], + "score": 0.977 + }, + { + "category_id": 3, + "poly": [ + 288, + 186, + 1389, + 186, + 1389, + 540, + 288, + 540 + ], + "score": 0.968 + }, + { + "category_id": 4, + "poly": [ + 296, + 553, + 1404, + 553, + 1404, + 638, + 296, + 638 + ], + "score": 0.949 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 814, + 76, + 814, + 104, + 299, + 104 + ], + "score": 0.878 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.793 + }, + { + "category_id": 13, + "poly": [ + 518, + 918, + 573, + 918, + 573, + 951, + 518, + 951 + ], + "score": 0.9, + "latex": "2 \\% p" + }, + { + "category_id": 13, + "poly": [ + 586, + 582, + 646, + 582, + 646, + 607, + 586, + 607 + ], + "score": 0.89, + "latex": "t = 7" + }, + { + "category_id": 13, + "poly": [ + 406, + 582, + 466, + 582, + 466, + 607, + 406, + 607 + ], + "score": 0.89, + "latex": "t = 1" + }, + { + "category_id": 13, + "poly": [ + 475, + 582, + 535, + 582, + 535, + 607, + 475, + 607 + ], + "score": 0.88, + "latex": "t = 4" + }, + { + "category_id": 13, + "poly": [ + 889, + 1684, + 932, + 1684, + 932, + 1710, + 889, + 1710 + ], + "score": 0.81, + "latex": "\\scriptstyle t = 4" + }, + { + "category_id": 13, + "poly": [ + 835, + 1684, + 878, + 1684, + 878, + 1710, + 835, + 1710 + ], + "score": 0.81, + "latex": "\\scriptstyle t = 1" + }, + { + "category_id": 13, + "poly": [ + 989, + 1683, + 1033, + 1683, + 1033, + 1710, + 989, + 1710 + ], + "score": 0.81, + "latex": "t { = } 7" + }, + { + "category_id": 13, + "poly": [ + 473, + 1347, + 541, + 1347, + 541, + 1376, + 473, + 1376 + ], + "score": 0.78, + "latex": "( \\mathrm { k } { = } 2 0 )" + }, + { + "category_id": 13, + "poly": [ + 974, + 1408, + 1045, + 1408, + 1045, + 1437, + 974, + 1437 + ], + "score": 0.77, + "latex": "( \\mathrm { k } { = } 1 3 )" + }, + { + "category_id": 13, + "poly": [ + 843, + 1761, + 925, + 1761, + 925, + 1791, + 843, + 1791 + ], + "score": 0.73, + "latex": "( t { = } 4 , 7 )" + }, + { + "category_id": 13, + "poly": [ + 710, + 1685, + 724, + 1685, + 724, + 1710, + 710, + 1710 + ], + "score": 0.54, + "latex": "t" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 186.0, + 583.0, + 186.0, + 583.0, + 215.0, + 343.0, + 215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 186.0, + 961.0, + 186.0, + 961.0, + 213.0, + 720.0, + 213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 186.0, + 1339.0, + 186.0, + 1339.0, + 215.0, + 1097.0, + 215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 204.0, + 332.0, + 204.0, + 332.0, + 224.0, + 303.0, + 224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 206.0, + 708.0, + 206.0, + 708.0, + 224.0, + 678.0, + 224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 222.0, + 1311.0, + 222.0, + 1311.0, + 243.0, + 1255.0, + 243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 248.0, + 331.0, + 248.0, + 331.0, + 266.0, + 296.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 248.0, + 708.0, + 248.0, + 708.0, + 266.0, + 680.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 239.0, + 1086.0, + 239.0, + 1086.0, + 255.0, + 1065.0, + 255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1257.0, + 237.0, + 1350.0, + 237.0, + 1350.0, + 269.0, + 1257.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 264.0, + 767.0, + 264.0, + 767.0, + 279.0, + 750.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 271.0, + 817.0, + 271.0, + 817.0, + 287.0, + 798.0, + 287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 273.0, + 865.0, + 273.0, + 865.0, + 288.0, + 847.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 269.0, + 912.0, + 269.0, + 912.0, + 284.0, + 897.0, + 284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 278.0, + 961.0, + 278.0, + 961.0, + 293.0, + 945.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 257.0, + 1343.0, + 257.0, + 1343.0, + 291.0, + 1255.0, + 291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 291.0, + 336.0, + 291.0, + 336.0, + 309.0, + 303.0, + 309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 293.0, + 371.0, + 293.0, + 371.0, + 305.0, + 361.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 457.0, + 289.0, + 467.0, + 289.0, + 467.0, + 299.0, + 457.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 296.0, + 598.0, + 296.0, + 598.0, + 306.0, + 586.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 291.0, + 708.0, + 291.0, + 708.0, + 309.0, + 680.0, + 309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 297.0, + 1086.0, + 297.0, + 1086.0, + 311.0, + 1059.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 271.0, + 309.0, + 339.0, + 309.0, + 339.0, + 375.0, + 271.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 317.0, + 406.0, + 317.0, + 406.0, + 331.0, + 389.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 314.0, + 437.0, + 314.0, + 437.0, + 329.0, + 419.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 304.0, + 471.0, + 304.0, + 471.0, + 320.0, + 453.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 314.0, + 499.0, + 314.0, + 499.0, + 324.0, + 491.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 318.0, + 688.0, + 318.0, + 688.0, + 368.0, + 667.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 896.0, + 314.0, + 912.0, + 314.0, + 912.0, + 328.0, + 896.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 315.0, + 961.0, + 315.0, + 961.0, + 331.0, + 946.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 318.0, + 1066.0, + 318.0, + 1066.0, + 368.0, + 1045.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 308.0, + 1094.0, + 308.0, + 1094.0, + 319.0, + 1081.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 308.0, + 1193.0, + 308.0, + 1193.0, + 323.0, + 1176.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 311.0, + 1290.0, + 311.0, + 1290.0, + 328.0, + 1275.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1374.0, + 318.0, + 1385.0, + 318.0, + 1385.0, + 328.0, + 1374.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 336.0, + 436.0, + 336.0, + 436.0, + 348.0, + 426.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 333.0, + 715.0, + 333.0, + 715.0, + 353.0, + 686.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 331.0, + 861.0, + 331.0, + 861.0, + 342.0, + 850.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 338.0, + 1188.0, + 338.0, + 1188.0, + 345.0, + 1181.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 336.0, + 1288.0, + 336.0, + 1288.0, + 348.0, + 1276.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 350.0, + 1086.0, + 350.0, + 1086.0, + 369.0, + 1064.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 376.0, + 336.0, + 376.0, + 336.0, + 395.0, + 308.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 376.0, + 708.0, + 376.0, + 708.0, + 395.0, + 680.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 377.0, + 1190.0, + 377.0, + 1190.0, + 388.0, + 1180.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 391.0, + 402.0, + 391.0, + 402.0, + 412.0, + 346.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 391.0, + 812.0, + 391.0, + 812.0, + 408.0, + 758.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 420.0, + 332.0, + 420.0, + 332.0, + 438.0, + 296.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 403.0, + 441.0, + 403.0, + 441.0, + 447.0, + 346.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 420.0, + 710.0, + 420.0, + 710.0, + 438.0, + 680.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 403.0, + 852.0, + 403.0, + 852.0, + 434.0, + 756.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 402.0, + 1094.0, + 402.0, + 1094.0, + 425.0, + 1057.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 411.0, + 1194.0, + 411.0, + 1194.0, + 425.0, + 1176.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 429.0, + 1289.0, + 429.0, + 1289.0, + 443.0, + 1273.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 439.0, + 433.0, + 439.0, + 433.0, + 460.0, + 346.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 437.0, + 845.0, + 437.0, + 845.0, + 457.0, + 757.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 461.0, + 338.0, + 461.0, + 338.0, + 483.0, + 301.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 462.0, + 708.0, + 462.0, + 708.0, + 482.0, + 678.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 462.0, + 1091.0, + 462.0, + 1091.0, + 482.0, + 1064.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 476.0, + 336.0, + 476.0, + 336.0, + 487.0, + 326.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 473.0, + 372.0, + 473.0, + 372.0, + 489.0, + 356.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 474.0, + 406.0, + 474.0, + 406.0, + 489.0, + 388.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 474.0, + 437.0, + 474.0, + 437.0, + 489.0, + 422.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 473.0, + 471.0, + 473.0, + 471.0, + 489.0, + 454.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 474.0, + 502.0, + 474.0, + 502.0, + 489.0, + 486.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.0, + 474.0, + 534.0, + 474.0, + 534.0, + 489.0, + 519.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 474.0, + 567.0, + 474.0, + 567.0, + 489.0, + 551.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 474.0, + 600.0, + 474.0, + 600.0, + 489.0, + 585.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 474.0, + 632.0, + 474.0, + 632.0, + 489.0, + 615.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 475.0, + 715.0, + 475.0, + 715.0, + 488.0, + 703.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 474.0, + 766.0, + 474.0, + 766.0, + 489.0, + 750.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 474.0, + 816.0, + 474.0, + 816.0, + 489.0, + 800.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 475.0, + 860.0, + 475.0, + 860.0, + 487.0, + 850.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 475.0, + 910.0, + 475.0, + 910.0, + 488.0, + 899.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 474.0, + 960.0, + 474.0, + 960.0, + 489.0, + 945.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 474.0, + 1010.0, + 474.0, + 1010.0, + 489.0, + 992.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 475.0, + 1091.0, + 475.0, + 1091.0, + 487.0, + 1081.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 474.0, + 1193.0, + 474.0, + 1193.0, + 489.0, + 1178.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 475.0, + 1286.0, + 475.0, + 1286.0, + 488.0, + 1275.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1370.0, + 474.0, + 1388.0, + 474.0, + 1388.0, + 489.0, + 1370.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 428.0, + 483.0, + 518.0, + 483.0, + 518.0, + 504.0, + 428.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 484.0, + 894.0, + 484.0, + 894.0, + 501.0, + 807.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 484.0, + 1271.0, + 484.0, + 1271.0, + 501.0, + 1184.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 512.0, + 538.0, + 512.0, + 538.0, + 542.0, + 435.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 812.0, + 512.0, + 919.0, + 512.0, + 919.0, + 543.0, + 812.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 513.0, + 1294.0, + 513.0, + 1294.0, + 542.0, + 1190.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 698.0, + 259.0, + 720.0, + 259.0, + 720.0, + 271.0, + 698.0, + 271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.25, + 316.0, + 594.25, + 316.0, + 594.25, + 341.0, + 589.25, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 327.0, + 763.0, + 327.0, + 763.0, + 337.0, + 752.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 425.0, + 797.0, + 425.0, + 797.0, + 444.0, + 760.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 550.0, + 1405.0, + 550.0, + 1405.0, + 585.0, + 294.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 579.0, + 405.0, + 579.0, + 405.0, + 613.0, + 293.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 579.0, + 474.0, + 579.0, + 474.0, + 613.0, + 467.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 579.0, + 585.0, + 579.0, + 585.0, + 613.0, + 536.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 579.0, + 1404.0, + 579.0, + 1404.0, + 613.0, + 647.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 608.0, + 1024.0, + 608.0, + 1024.0, + 641.0, + 295.0, + 641.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": [ + 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, + 1129.0, + 1405.0, + 1129.0, + 1405.0, + 1168.0, + 293.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1162.0, + 1406.0, + 1162.0, + 1406.0, + 1199.0, + 293.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1192.0, + 1406.0, + 1192.0, + 1406.0, + 1228.0, + 292.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1223.0, + 1404.0, + 1223.0, + 1404.0, + 1259.0, + 293.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1254.0, + 1407.0, + 1254.0, + 1407.0, + 1291.0, + 292.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1281.0, + 1405.0, + 1281.0, + 1405.0, + 1324.0, + 292.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1315.0, + 1404.0, + 1315.0, + 1404.0, + 1350.0, + 294.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1346.0, + 472.0, + 1346.0, + 472.0, + 1381.0, + 294.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 1346.0, + 1405.0, + 1346.0, + 1405.0, + 1381.0, + 542.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1377.0, + 1404.0, + 1377.0, + 1404.0, + 1412.0, + 294.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1406.0, + 973.0, + 1406.0, + 973.0, + 1444.0, + 293.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 1406.0, + 1408.0, + 1406.0, + 1408.0, + 1444.0, + 1046.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1438.0, + 1323.0, + 1438.0, + 1323.0, + 1473.0, + 296.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 1727.0, + 1404.0, + 1727.0, + 1404.0, + 1763.0, + 313.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1758.0, + 842.0, + 1758.0, + 842.0, + 1793.0, + 293.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 1758.0, + 1405.0, + 1758.0, + 1405.0, + 1793.0, + 926.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1787.0, + 1408.0, + 1787.0, + 1408.0, + 1826.0, + 293.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1820.0, + 1405.0, + 1820.0, + 1405.0, + 1856.0, + 293.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1851.0, + 1406.0, + 1851.0, + 1406.0, + 1886.0, + 294.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1880.0, + 1408.0, + 1880.0, + 1408.0, + 1917.0, + 293.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1909.0, + 1406.0, + 1909.0, + 1406.0, + 1947.0, + 292.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1939.0, + 1405.0, + 1939.0, + 1405.0, + 1981.0, + 292.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1968.0, + 1405.0, + 1968.0, + 1405.0, + 2012.0, + 292.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 1408.0, + 2003.0, + 1408.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 735.0, + 1408.0, + 735.0, + 1408.0, + 771.0, + 293.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 765.0, + 1407.0, + 765.0, + 1407.0, + 803.0, + 293.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 797.0, + 1405.0, + 797.0, + 1405.0, + 831.0, + 295.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 823.0, + 1406.0, + 823.0, + 1406.0, + 864.0, + 292.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 857.0, + 1405.0, + 857.0, + 1405.0, + 892.0, + 295.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 886.0, + 1407.0, + 886.0, + 1407.0, + 923.0, + 293.0, + 923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 916.0, + 517.0, + 916.0, + 517.0, + 957.0, + 292.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 916.0, + 1409.0, + 916.0, + 1409.0, + 957.0, + 574.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 950.0, + 1403.0, + 950.0, + 1403.0, + 981.0, + 296.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 979.0, + 1405.0, + 979.0, + 1405.0, + 1015.0, + 293.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1009.0, + 1407.0, + 1009.0, + 1407.0, + 1046.0, + 292.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1042.0, + 646.0, + 1042.0, + 646.0, + 1073.0, + 294.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1530.0, + 1405.0, + 1530.0, + 1405.0, + 1561.0, + 296.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1558.0, + 1408.0, + 1558.0, + 1408.0, + 1598.0, + 295.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1588.0, + 1406.0, + 1588.0, + 1406.0, + 1625.0, + 293.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1618.0, + 1407.0, + 1618.0, + 1407.0, + 1656.0, + 292.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1649.0, + 1405.0, + 1649.0, + 1405.0, + 1686.0, + 293.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1681.0, + 709.0, + 1681.0, + 709.0, + 1715.0, + 293.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 725.0, + 1681.0, + 834.0, + 1681.0, + 834.0, + 1715.0, + 725.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1681.0, + 888.0, + 1681.0, + 888.0, + 1715.0, + 879.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 933.0, + 1681.0, + 988.0, + 1681.0, + 988.0, + 1715.0, + 933.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 1681.0, + 1044.0, + 1681.0, + 1044.0, + 1715.0, + 1034.0, + 1715.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 298, + 1404, + 298, + 1404, + 603, + 298, + 603 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 620, + 1405, + 620, + 1405, + 835, + 298, + 835 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1351, + 1405, + 1351, + 1405, + 1475, + 299, + 1475 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 298, + 937, + 1406, + 937, + 1406, + 1030, + 298, + 1030 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.887 + }, + { + "category_id": 0, + "poly": [ + 300, + 226, + 543, + 226, + 543, + 261, + 300, + 261 + ], + "score": 0.882 + }, + { + "category_id": 1, + "poly": [ + 299, + 1647, + 1401, + 1647, + 1401, + 1711, + 299, + 1711 + ], + "score": 0.88 + }, + { + "category_id": 1, + "poly": [ + 300, + 1558, + 1399, + 1558, + 1399, + 1622, + 300, + 1622 + ], + "score": 0.873 + }, + { + "category_id": 1, + "poly": [ + 298, + 1232, + 1405, + 1232, + 1405, + 1326, + 298, + 1326 + ], + "score": 0.867 + }, + { + "category_id": 1, + "poly": [ + 297, + 1501, + 1403, + 1501, + 1403, + 1536, + 297, + 1536 + ], + "score": 0.862 + }, + { + "category_id": 1, + "poly": [ + 296, + 1143, + 1402, + 1143, + 1402, + 1207, + 296, + 1207 + ], + "score": 0.845 + }, + { + "category_id": 0, + "poly": [ + 299, + 884, + 488, + 884, + 488, + 917, + 299, + 917 + ], + "score": 0.843 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.829 + }, + { + "category_id": 1, + "poly": [ + 292, + 1055, + 1401, + 1055, + 1401, + 1120, + 292, + 1120 + ], + "score": 0.812 + }, + { + "category_id": 1, + "poly": [ + 296, + 1824, + 1402, + 1824, + 1402, + 1889, + 296, + 1889 + ], + "score": 0.786 + }, + { + "category_id": 1, + "poly": [ + 296, + 1913, + 1403, + 1913, + 1403, + 1977, + 296, + 1977 + ], + "score": 0.752 + }, + { + "category_id": 1, + "poly": [ + 290, + 2002, + 1289, + 2002, + 1289, + 2034, + 290, + 2034 + ], + "score": 0.736 + }, + { + "category_id": 1, + "poly": [ + 297, + 1736, + 1404, + 1736, + 1404, + 1799, + 297, + 1799 + ], + "score": 0.735 + }, + { + "category_id": 13, + "poly": [ + 1127, + 511, + 1337, + 511, + 1337, + 543, + 1127, + 543 + ], + "score": 0.92, + "latex": "1 1 . 9 \\% p - 6 0 . 3 \\% p" + }, + { + "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, + 222.0, + 549.0, + 222.0, + 549.0, + 270.0, + 292.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 884.0, + 490.0, + 884.0, + 490.0, + 921.0, + 297.0, + 921.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": [ + 294.0, + 297.0, + 1406.0, + 297.0, + 1406.0, + 332.0, + 294.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 329.0, + 1406.0, + 329.0, + 1406.0, + 364.0, + 294.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 358.0, + 1406.0, + 358.0, + 1406.0, + 395.0, + 292.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 385.0, + 1405.0, + 385.0, + 1405.0, + 429.0, + 292.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 421.0, + 1405.0, + 421.0, + 1405.0, + 453.0, + 294.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 448.0, + 1406.0, + 448.0, + 1406.0, + 487.0, + 293.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 481.0, + 1406.0, + 481.0, + 1406.0, + 516.0, + 294.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 510.0, + 1126.0, + 510.0, + 1126.0, + 549.0, + 293.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1338.0, + 510.0, + 1405.0, + 510.0, + 1405.0, + 549.0, + 1338.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 542.0, + 1404.0, + 542.0, + 1404.0, + 577.0, + 294.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 573.0, + 1315.0, + 573.0, + 1315.0, + 605.0, + 296.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 618.0, + 1405.0, + 618.0, + 1405.0, + 657.0, + 293.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 649.0, + 1407.0, + 649.0, + 1407.0, + 688.0, + 292.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 680.0, + 1407.0, + 680.0, + 1407.0, + 718.0, + 293.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 713.0, + 1407.0, + 713.0, + 1407.0, + 747.0, + 295.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 740.0, + 1406.0, + 740.0, + 1406.0, + 779.0, + 291.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 771.0, + 1407.0, + 771.0, + 1407.0, + 811.0, + 292.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 805.0, + 562.0, + 805.0, + 562.0, + 841.0, + 295.0, + 841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1352.0, + 1405.0, + 1352.0, + 1405.0, + 1385.0, + 294.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1379.0, + 1405.0, + 1379.0, + 1405.0, + 1420.0, + 321.0, + 1420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1412.0, + 1410.0, + 1412.0, + 1410.0, + 1452.0, + 321.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1443.0, + 534.0, + 1443.0, + 534.0, + 1477.0, + 323.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 934.0, + 1406.0, + 934.0, + 1406.0, + 974.0, + 293.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 969.0, + 1404.0, + 969.0, + 1404.0, + 1003.0, + 325.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1000.0, + 1164.0, + 1000.0, + 1164.0, + 1032.0, + 322.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1643.0, + 1405.0, + 1643.0, + 1405.0, + 1685.0, + 293.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1679.0, + 474.0, + 1679.0, + 474.0, + 1712.0, + 323.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1554.0, + 1405.0, + 1554.0, + 1405.0, + 1599.0, + 294.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1590.0, + 867.0, + 1590.0, + 867.0, + 1622.0, + 325.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1228.0, + 1405.0, + 1228.0, + 1405.0, + 1272.0, + 292.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1261.0, + 1405.0, + 1261.0, + 1405.0, + 1301.0, + 321.0, + 1301.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1294.0, + 542.0, + 1294.0, + 542.0, + 1329.0, + 322.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1497.0, + 1408.0, + 1497.0, + 1408.0, + 1541.0, + 295.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1144.0, + 1406.0, + 1144.0, + 1406.0, + 1180.0, + 296.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1175.0, + 1306.0, + 1175.0, + 1306.0, + 1208.0, + 323.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1055.0, + 1404.0, + 1055.0, + 1404.0, + 1091.0, + 295.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1086.0, + 1166.0, + 1086.0, + 1166.0, + 1121.0, + 319.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1820.0, + 1406.0, + 1820.0, + 1406.0, + 1863.0, + 294.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1855.0, + 1054.0, + 1855.0, + 1054.0, + 1890.0, + 321.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1910.0, + 1405.0, + 1910.0, + 1405.0, + 1951.0, + 295.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1944.0, + 1282.0, + 1944.0, + 1282.0, + 1978.0, + 321.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1999.0, + 1293.0, + 1999.0, + 1293.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1737.0, + 1404.0, + 1737.0, + 1404.0, + 1773.0, + 297.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1768.0, + 1019.0, + 1768.0, + 1019.0, + 1799.0, + 324.0, + 1799.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 983, + 1406, + 983, + 1406, + 1199, + 297, + 1199 + ], + "score": 0.978 + }, + { + "category_id": 3, + "poly": [ + 354, + 1232, + 1300, + 1232, + 1300, + 1641, + 354, + 1641 + ], + "score": 0.966 + }, + { + "category_id": 4, + "poly": [ + 293, + 1674, + 1404, + 1674, + 1404, + 1733, + 293, + 1733 + ], + "score": 0.934 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.882 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 861, + 2088, + 861, + 2113, + 835, + 2113 + ], + "score": 0.839 + }, + { + "category_id": 0, + "poly": [ + 300, + 926, + 760, + 926, + 760, + 958, + 300, + 958 + ], + "score": 0.833 + }, + { + "category_id": 0, + "poly": [ + 301, + 858, + 482, + 858, + 482, + 893, + 301, + 893 + ], + "score": 0.833 + }, + { + "category_id": 1, + "poly": [ + 301, + 621, + 1400, + 621, + 1400, + 685, + 301, + 685 + ], + "score": 0.61 + }, + { + "category_id": 1, + "poly": [ + 298, + 705, + 1408, + 705, + 1408, + 798, + 298, + 798 + ], + "score": 0.575 + }, + { + "category_id": 1, + "poly": [ + 300, + 229, + 1402, + 229, + 1402, + 323, + 300, + 323 + ], + "score": 0.575 + }, + { + "category_id": 1, + "poly": [ + 300, + 508, + 1401, + 508, + 1401, + 603, + 300, + 603 + ], + "score": 0.539 + }, + { + "category_id": 1, + "poly": [ + 297, + 343, + 1399, + 343, + 1399, + 406, + 297, + 406 + ], + "score": 0.529 + }, + { + "category_id": 1, + "poly": [ + 296, + 425, + 1402, + 425, + 1402, + 490, + 296, + 490 + ], + "score": 0.518 + }, + { + "category_id": 15, + "poly": [ + 409.0, + 1231.0, + 812.0, + 1231.0, + 812.0, + 1290.0, + 409.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 1231.0, + 1294.0, + 1231.0, + 1294.0, + 1272.0, + 926.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 1286.0, + 720.0, + 1286.0, + 720.0, + 1297.0, + 712.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 1286.0, + 766.0, + 1286.0, + 766.0, + 1300.0, + 751.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 794.0, + 1289.0, + 803.0, + 1289.0, + 803.0, + 1300.0, + 794.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 1285.0, + 1288.0, + 1285.0, + 1288.0, + 1307.0, + 1264.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 1306.0, + 479.0, + 1306.0, + 479.0, + 1323.0, + 459.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 377.0, + 1318.0, + 428.0, + 1318.0, + 428.0, + 1347.0, + 377.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 876.0, + 1323.0, + 934.0, + 1323.0, + 934.0, + 1352.0, + 876.0, + 1352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 1365.0, + 446.0, + 1365.0, + 446.0, + 1493.0, + 336.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 1371.0, + 769.0, + 1371.0, + 769.0, + 1387.0, + 749.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 1363.0, + 957.0, + 1363.0, + 957.0, + 1498.0, + 829.0, + 1498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 1369.0, + 993.0, + 1369.0, + 993.0, + 1394.0, + 965.0, + 1394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 1417.0, + 727.0, + 1417.0, + 727.0, + 1452.0, + 544.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1060.0, + 1414.0, + 1202.0, + 1414.0, + 1202.0, + 1448.0, + 1060.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1442.0, + 728.0, + 1442.0, + 728.0, + 1475.0, + 538.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 1444.0, + 1205.0, + 1444.0, + 1205.0, + 1481.0, + 1051.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1465.0, + 736.0, + 1465.0, + 736.0, + 1521.0, + 538.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 1476.0, + 1289.0, + 1476.0, + 1289.0, + 1516.0, + 1050.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 1511.0, + 428.0, + 1511.0, + 428.0, + 1540.0, + 378.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 1513.0, + 788.0, + 1513.0, + 788.0, + 1547.0, + 533.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 1512.0, + 933.0, + 1512.0, + 933.0, + 1537.0, + 877.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1506.0, + 1148.0, + 1506.0, + 1148.0, + 1545.0, + 1054.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 1536.0, + 683.0, + 1536.0, + 683.0, + 1570.0, + 533.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 1537.0, + 998.0, + 1537.0, + 998.0, + 1560.0, + 974.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1060.0, + 1541.0, + 1252.0, + 1541.0, + 1252.0, + 1577.0, + 1060.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1575.0, + 426.0, + 1575.0, + 426.0, + 1603.0, + 388.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1571.0, + 934.0, + 1571.0, + 934.0, + 1602.0, + 885.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 1593.0, + 477.0, + 1593.0, + 477.0, + 1618.0, + 455.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1593.0, + 560.0, + 1593.0, + 560.0, + 1617.0, + 538.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 1593.0, + 644.0, + 1593.0, + 644.0, + 1618.0, + 622.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 1593.0, + 727.0, + 1593.0, + 727.0, + 1618.0, + 706.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 786.0, + 1592.0, + 815.0, + 1592.0, + 815.0, + 1619.0, + 786.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 1591.0, + 941.0, + 1591.0, + 941.0, + 1615.0, + 921.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 1589.0, + 1020.0, + 1589.0, + 1020.0, + 1616.0, + 978.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 1588.0, + 1090.0, + 1588.0, + 1090.0, + 1616.0, + 1047.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 1588.0, + 1159.0, + 1588.0, + 1159.0, + 1616.0, + 1117.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1588.0, + 1228.0, + 1588.0, + 1228.0, + 1616.0, + 1185.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1250.0, + 1587.0, + 1302.0, + 1587.0, + 1302.0, + 1617.0, + 1250.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 1613.0, + 684.0, + 1613.0, + 684.0, + 1642.0, + 539.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 1611.0, + 1179.0, + 1611.0, + 1179.0, + 1645.0, + 1044.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 1273.0, + 997.0, + 1273.0, + 997.0, + 1299.0, + 948.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1368.0, + 808.0, + 1368.0, + 808.0, + 1393.5, + 771.0, + 1393.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1671.0, + 1405.0, + 1671.0, + 1405.0, + 1708.0, + 294.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1702.0, + 683.0, + 1702.0, + 683.0, + 1732.0, + 293.0, + 1732.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, + 867.0, + 2085.0, + 867.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 926.0, + 764.0, + 926.0, + 764.0, + 962.0, + 296.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 857.0, + 487.0, + 857.0, + 487.0, + 898.0, + 297.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 986.0, + 1404.0, + 986.0, + 1404.0, + 1017.0, + 296.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1014.0, + 1406.0, + 1014.0, + 1406.0, + 1049.0, + 295.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1045.0, + 1406.0, + 1045.0, + 1406.0, + 1080.0, + 295.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1077.0, + 1404.0, + 1077.0, + 1404.0, + 1108.0, + 295.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1102.0, + 1406.0, + 1102.0, + 1406.0, + 1144.0, + 292.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1137.0, + 1406.0, + 1137.0, + 1406.0, + 1171.0, + 295.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1166.0, + 1228.0, + 1166.0, + 1228.0, + 1201.0, + 295.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 618.0, + 1404.0, + 618.0, + 1404.0, + 661.0, + 294.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 652.0, + 684.0, + 652.0, + 684.0, + 688.0, + 323.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 702.0, + 1406.0, + 702.0, + 1406.0, + 744.0, + 293.0, + 744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 738.0, + 1408.0, + 738.0, + 1408.0, + 772.0, + 321.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 766.0, + 395.0, + 766.0, + 395.0, + 800.0, + 321.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 226.0, + 1403.0, + 226.0, + 1403.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 260.0, + 1404.0, + 260.0, + 1404.0, + 297.0, + 323.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 291.0, + 611.0, + 291.0, + 611.0, + 325.0, + 323.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 509.0, + 1406.0, + 509.0, + 1406.0, + 547.0, + 295.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 540.0, + 1405.0, + 540.0, + 1405.0, + 576.0, + 321.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 571.0, + 1275.0, + 571.0, + 1275.0, + 605.0, + 324.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 341.0, + 1405.0, + 341.0, + 1405.0, + 381.0, + 293.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 372.0, + 730.0, + 372.0, + 730.0, + 406.0, + 321.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 424.0, + 1404.0, + 424.0, + 1404.0, + 463.0, + 295.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 456.0, + 929.0, + 456.0, + 929.0, + 492.0, + 324.0, + 492.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/SkfMWhAqYQ/SkfMWhAqYQ_layout.pdf b/parse/train/SkfMWhAqYQ/SkfMWhAqYQ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..117f8fbdb7f86da308b6b655dc697d61b0da7a76 --- /dev/null +++ b/parse/train/SkfMWhAqYQ/SkfMWhAqYQ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a48745a54411c475d3a7595932a26e72b3087bbdb6b422d88a45511845d1e689 +size 15497659 diff --git a/parse/train/SkfMWhAqYQ/SkfMWhAqYQ_origin.pdf b/parse/train/SkfMWhAqYQ/SkfMWhAqYQ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..324ed04bd6d34868eaec59d34c0e081ea52a6173 --- /dev/null +++ b/parse/train/SkfMWhAqYQ/SkfMWhAqYQ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f1acfdec819f4d421d65fb2bf5c9de7ebd13b2119e5d924c8497fed32846e886 +size 15350493 diff --git a/parse/train/SkfMWhAqYQ/SkfMWhAqYQ_span.pdf b/parse/train/SkfMWhAqYQ/SkfMWhAqYQ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e3798e255f9729e5683993cf1e27a3bf5dda626e --- /dev/null +++ b/parse/train/SkfMWhAqYQ/SkfMWhAqYQ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b79f46b63eeb80e1bb3d4416f6461ab3e2980dcc91767a9e7fc525cf82a14084 +size 15498170 diff --git a/parse/train/Sklf1yrYDr/Sklf1yrYDr_layout.pdf b/parse/train/Sklf1yrYDr/Sklf1yrYDr_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9361dba2cc6101bccbbc23a99c0fa69c4a295305 --- /dev/null +++ b/parse/train/Sklf1yrYDr/Sklf1yrYDr_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:92d452ca3404fea01e4c71d54b53d4d474305c904887bfaf0ad0a871e4b81a40 +size 937700 diff --git a/parse/train/Sklf1yrYDr/Sklf1yrYDr_origin.pdf b/parse/train/Sklf1yrYDr/Sklf1yrYDr_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..08fa6e27d09a034a2b04ee274d6c365dc9647ee6 --- /dev/null +++ b/parse/train/Sklf1yrYDr/Sklf1yrYDr_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3a9f175c7d1a5965ebcf06f361820fdd79386e88fb6ce6ddcf84e18acdf59de9 +size 750388 diff --git a/parse/train/Sklf1yrYDr/Sklf1yrYDr_span.pdf b/parse/train/Sklf1yrYDr/Sklf1yrYDr_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..338fd3bb5516bea7e3f9a3805729d19215fb69e7 --- /dev/null +++ b/parse/train/Sklf1yrYDr/Sklf1yrYDr_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2a70a9776a7896645ce8af744dff35ab4f76ae72635217224dfaeb0347c52f39 +size 940759 diff --git a/parse/train/SksY3deAW/SksY3deAW_layout.pdf b/parse/train/SksY3deAW/SksY3deAW_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..db0e124efa5f16733ef7452a248fb10a01447a0e --- /dev/null +++ b/parse/train/SksY3deAW/SksY3deAW_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7f5c2ff2267e2490473768f966287b960fa90c3a87292932ecbfa8a7f5962f5e +size 1389221 diff --git a/parse/train/SksY3deAW/SksY3deAW_origin.pdf b/parse/train/SksY3deAW/SksY3deAW_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7b622cf1721ebcb5656440db70e3234ebef9ea2f --- /dev/null +++ b/parse/train/SksY3deAW/SksY3deAW_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:716b4dbf78777a65fcdac31b78d487f259807e3a88784bf4e49172bd3c96c2d5 +size 424187 diff --git a/parse/train/SksY3deAW/SksY3deAW_span.pdf b/parse/train/SksY3deAW/SksY3deAW_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a5f6f750cc296b21b5f563cac0247ebd28dd9820 --- /dev/null +++ b/parse/train/SksY3deAW/SksY3deAW_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6ee27633b3ea909d370f2a0a44dd690b43fd8741818cc5d8436534cbb7ca7bca +size 1396696 diff --git a/parse/train/SyAbZb-0Z/SyAbZb-0Z_layout.pdf b/parse/train/SyAbZb-0Z/SyAbZb-0Z_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e4f279656d10c0ab6de3bf95fd670437173bf336 --- /dev/null +++ b/parse/train/SyAbZb-0Z/SyAbZb-0Z_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3f19323139ff78d8cb3efb6d33f72859f3e5cf768f802222655afcd65d75e2c2 +size 6110107 diff --git a/parse/train/SyAbZb-0Z/SyAbZb-0Z_origin.pdf b/parse/train/SyAbZb-0Z/SyAbZb-0Z_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b39730d811fbbc76732ab9ea7f54974b8c5f2d8c --- /dev/null +++ b/parse/train/SyAbZb-0Z/SyAbZb-0Z_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:229065b9c54f7862e0ba3d5583c1b9baaca182cc630cd0a34f2ec360531ff4c8 +size 6038862 diff --git a/parse/train/SyAbZb-0Z/SyAbZb-0Z_span.pdf b/parse/train/SyAbZb-0Z/SyAbZb-0Z_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..642403c49585df1e6f9b0e53552efbe7d20c7e40 --- /dev/null +++ b/parse/train/SyAbZb-0Z/SyAbZb-0Z_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2b033461941e285f15580d1ae44c0b5e6707f192bd88edf411cd69f2c36fb646 +size 6109271 diff --git a/parse/train/SyMWn05F7/SyMWn05F7.md b/parse/train/SyMWn05F7/SyMWn05F7.md new file mode 100644 index 0000000000000000000000000000000000000000..5fc18d1a7f68054cb0b8100a4a98b8c2cc3d9341 --- /dev/null +++ b/parse/train/SyMWn05F7/SyMWn05F7.md @@ -0,0 +1,275 @@ +# LEARNING EXPLORATION POLICIES FOR NAVIGATION + +Tao Chen1 Saurabh Gupta2 Abhinav Gupta1,2 +1Carnegie Mellon University +2Facebook AI Research + +# ABSTRACT + +Numerous past works have tackled the problem of task-driven navigation. But, how to effectively explore a new environment to enable a variety of down-stream tasks has received much less attention. In this work, we study how agents can autonomously explore realistic and complex 3D environments without the context of task-rewards. We propose a learning-based approach and investigate different policy architectures, reward functions, and training paradigms. We find that use of policies with spatial memory that are bootstrapped with imitation learning and finally finetuned with coverage rewards derived purely from on-board sensors can be effective at exploring novel environments. We show that our learned exploration policies can explore better than classical approaches based on geometry alone and generic learning-based exploration techniques. Finally, we also show how such task-agnostic exploration can be used for down-stream tasks. Videos are available at: https://sites.google.com/view/exploration-for-nav/. + +# 1 INTRODUCTION + +Imagine your first day at a new workplace. If you are like most people, the first task you set for yourself is to become familiar with the office so that the next day when you have to attend meetings and perform tasks, you can navigate efficiently and seamlessly. To achieve that goal, you explore your office without the task context of target locations you have to reach and build a generic understanding of space. This step of task-independent exploration is quite critical yet often ignored in current approaches for navigation. + +When it comes to navigation, currently there are two paradigms: (a) geometric reconstruction and path-planning based approaches (Hartley & Zisserman, 2003; Thrun et al., 2005; LaValle, 2006), and (b) learning-based approaches (Mirowski et al., 2017; Gupta et al., 2017; Savinov et al., 2018; Zhu et al., 2017). SLAM-based approaches, first build a map and then use localization and path planning for navigation. In doing this, one interesting question that is often overlooked is: How does one build a map? How should we explore the environment to build this map? Current approaches either use a human operator to control the robot for building the map (e.g. Thrun et al. (1999)), or use heuristics such as frontier-based exploration (Yamauchi, 1997). On the other hand for approaches that use learning, most only learn policies for specific tasks (Zhu et al., 2017; Mirowski et al., 2017; Gupta et al., 2017), or assume environments have already been explored (Savinov et al., 2018). Moreover, in context of such learning based approaches, the question of exploration is not only important at test time, but also at train time. And once again, this question is largely ignored. Current approaches either use sample inefficient random exploration or make impractical assumptions about full map availability for generating supervision from optimal trajectories. + +Thus, a big bottleneck for both these navigation paradigms is an exploration policy: a task-agnostic policy that explores the environment to either build a map or sample trajectories for learning a navigation policy in a sample-efficient manner. But how do we learn this task-independent policy? What should be the reward for such a policy? First possible way is to not use learning and use heuristic based approaches (Yamauchi, 1997). However, there are four issues with non-learning based approaches: (a) these approaches are brittle and fail when there is noise in ego-estimation or localization; (b) they make strong assumptions about free-space/collisions and fail to generalize when navigation requires interactions such as opening doors etc.; (c) they fail to capture semantic priors that can reduce search-space significantly; and (d) they heavily rely on specialized sensors such as range scanners. Another possibility is to learn exploration policies on training environments. One way is to use reinforcement learning (RL) with intrinsic rewards. Examples of intrinsic rewards can be “curiosity” where prediction error is used as reward signal or “diversity” which discourages the agent from revisiting the same states. While this seems like an effective reward, such approaches are still sample inefficient due to blackbox reward functions that can’t be differentiated to compute gradients effectively. So, what would be an effective way to learn exploration policies for navigation? + +In this paper, we propose an approach for learning policies for exploration for navigation. We explore this problem from multiple perspectives: (a) architectural design, (b) reward function design, and (c) reward optimization. Specifically, from perspective of reward function and optimization, we take the alternative paradigm and use supervision from human explorations in conjunction with intrinsic rewards. We notice that bootstrapping of learning from small amount of human supervision aids learning of semantics (e.g. doors are pathways). It also provides a good initialization for learning using intrinsic rewards. From the perspective of architecture design, we explore how to use 3D information and use it efficiently while doing exploration. We study proxy rewards that characterize coverage and demonstrate how this reward outperforms other rewards such as curiosity. Finally, we show how experience gathered from our learned exploration policies improves performance at down-stream navigation tasks. + +# 2 RELATED WORK + +Our work on learning exploration policies for navigation in real world scenes is related to active SLAM in classical robotics, and intrinsic rewards based exploration in reinforcement learning. As we study the problem of navigation, we also draw upon recent efforts that use learning for this problem. We survey related efforts in these three directions. + +Navigation in Classical Robotics. Classical approaches to navigation operate by building a map of the environment, localizing the agent in this map, and then planning paths to convey the agent to desired target locations. Consequently, the problems of mapping, localization and path-planning have been very thoroughly studied (Hartley & Zisserman, 2003; Thrun et al., 2005; LaValle, 2006). However, most of this research starts from a human-operated traversal of the environment, and falls under the purview of passive SLAM. Active SLAM, or how to automatically traverse a new environment for building spatial representations is much less studied. Cadena et al. (2016) present an excellent review of active SLAM literature, we summarize some key efforts here. Past works have formulated active SLAM as Partially Observable Markov Decision Processes (POMDPs) (MartinezCantin et al., 2009), or as choosing actions that reduce uncertainty in the estimated map (Carrillo et al., 2012). While these formulations enable theoretical analysis, they crucially rely on sensors to build maps and localize. Thus, such approaches are highly susceptible to measurement noise. Additionally, such methods treat exploration purely as a geometry problem, and entirely ignore semantic cues for exploration such as doors. + +Learning for Navigation. In order to leverage such semantic cues for navigation, recent works have formulated navigation as a learning problem (Zhu et al., 2017; Gupta et al., 2017; Mirowski et al., 2017; Savinov et al., 2018). A number of design choices have been investigated. For example, these works have investigated different policy architectures for representing space: Zhu et al. (2017) use feed-forward networks, Mirowski et al. (2017) use vanilla neural network memory, Gupta et al. (2017) use spatial memory and planning modules, and Savinov et al. (2018) use semi-parametric topological memory. Different training paradigms have also been explored: Gupta et al. (2017) learn to imitate behavior of an optimal expert, Mirowski et al. (2017) and Zhu et al. (2017) use extrinsic reward based reinforcement learning, Pathak et al. (2018) learn an inverse dynamics model on the demonstrated trajectory way-points from the expert, while Savinov et al. (2018) use selfsupervision. In our work here, we build on insights from these past works. Our policy architecture and reward definition use spatial memory to achieve long-horizon exploration, and we imitate human exploration demonstrations to boot-strap policy learning. However, in crucial distinction, instead of studying goal-directed navigation (either in the form of going to a particular goal location, or object of interest), we study the problem of autonomous exploration of novel environments in a taskagnostic manner. In doing so, unlike past works, we do not assume access to human demonstrations in the given novel test environment like Savinov et al. (2018), nor do we assume availability of millions of samples of experience or reward signals in the novel test environment like Zhu et al. (2017) or Mirowski et al. (2017). Moreover, we do not depend on extrinsically defined reward signals for training. We derive them using on-board sensors. This makes our proposed approach amenable to real world deployment. Learning based approaches (Gandhi et al., 2017; Sadeghi & Levine, 2017) have also been used to learn low-level collision avoidance policies. While they do not use task-context, they learn to move towards open space, without the intent of exploring the whole environment. Zhang et al. (2017) uses a differentiable map structure to mimic the SLAM techniques. Such works are orthogonal to our effort on exploration as our exploration policy can benefit from their learned maps instead of only using reconstructed occupancy map. + +![](images/a954b8198e004d046aa04a08c0de5ed74c59e46707d404905e4c17c9e20f65fe.jpg) +Figure 1: Policy and Training Architecture: Our scheme for learning exploration policies for navigation. We assume a mobile robot with an RGB-D camera and a bump sensor. We maintain a running estimate of its position $\hat { x } _ { t }$ . These position estimates are used to stitch together an approximate map of the environment using the depth images. The exploration policy $\pi _ { e }$ is a recurrent network takes egocentric crops of this map at two scales, and the current RGB image as input. The policy is trained using an intrinsic coverage reward that is computed from the approximate map and a collision penalty obtained from the bump sensor. + +Exploration for Navigation. A notable few past works share a similar line of thought, and investigate exploration in context of reinforcement learning (Schmidhuber, 1991; Stadie et al., 2015; Pathak et al., 2017; Fu et al., 2017; Lopes et al., 2012; Chentanez et al., 2005). These works design intrinsic reward functions to capture novelty of states or state-action transitions. Exploration policies are then learned by optimizing these reward functions using reinforcement learning. Our work is most similar to these works. However, we focus on this problem in the specific context of navigation in complex and realistic 3D environments, and propose specialized policy architectures and intrinsic reward functions. We experimentally demonstrate that these specializations improve performance, and how learning based exploration techniques may not be too far from real world deployment. Jayaraman & Grauman (2018) use a related reward function (pixel reconstruction) to learn policies to look around (and subsequently solve tasks). However, they do it in context of $3 6 0 ^ { \circ }$ images, and their precise reward can’t be estimated intrinsically. Xu et al. (2017) generate smooth movement path for high-quality camera scan by using time-varying tensor fields. Bai et al. (2016) propose an information-theoretic exploration method using Gaussian Process regression and show experiments on simplistic map environments. Kollar & Roy (2008) assume access to the groundtruth map and learn an optimized trajectory that maximizes the accuracy of the SLAM-derived map. In contrast, our learning policy directly tells the action that the agent should take next and estimates the map on the fly. + +System Identification. Finally, the general idea of exploration prior to goal-driven behavior, is also related to the classical idea of system identification (Ljung, 1987). Recent interest in this idea with end-to-end learning (Yu et al., 2017; Duan et al., 2016; Mishra et al., 2018) has been shown to successfully adapt to novel mazes. In comparison, we tackle navigation in complex and realistic 3D environments, with very long spatio-temporal dependencies. + +# 3 APPROACH + +Let us consider a mobile agent that is equipped with an RGB-D camera and that can execute basic movement macro-actions. This agent has been dropped into a novel environment that it has never been in before. We want to learn an exploration policy $\pi _ { e }$ that enables this agent to efficiently explore this new environment. A successful exploration of the new environment should enable the agent to accomplish down-stream tasks in this new environment efficiently. + +We formulate estimation of $\pi _ { e }$ as a learning problem. We design a reward function that is estimated entirely using on-board sensors, and learn $\pi _ { e }$ using RL. Crucially, $\pi _ { e }$ is learned on a set of environments $\mathcal { E } _ { t r a i n }$ , and tested on a held-out set of environments $\mathcal { E } _ { t e s t }$ , i.e., $\mathcal { E } _ { t r a i n } \cap \mathcal { E } _ { t e s t } = \phi$ . + +The key novelties in our work are: a) the design of the policy $\pi _ { e }$ , b) the design of the reward function $R$ , and c) use of human demonstrations to speed up training of $\pi _ { e }$ . The design of the policy and the reward function depend on a rudimentary map of the environment that we maintain over time. We first describe the map construction procedure, and then detail the aforementioned aspects. + +# 3.1 MAP CONSTRUCTION + +As the agent moves around, it uses its depth camera to build and update a map of the world around it. This is done by maintaining an estimate of the agent’s location over time and projecting 3D points observed in the depth image into an allocentric map of the environment. + +More specifically, let us assume that the agent’s estimate of its current location at time step $t$ is $\hat { x _ { t } }$ , and that the agent starts from origin (i.e. $\hat { x } _ { 0 } = \mathbf { 0 }$ ). When the agent executes an action $a _ { t }$ at time step $t$ , it updates its position estimate through a known transition function $f$ , i.e., $\hat { x } _ { t + 1 } = f ( \hat { x } _ { t } , a _ { t } )$ . + +The depth image observation at time step $t + 1$ , $D _ { t + 1 }$ is back-projected into 3D points using known camera intrinsic parameters. These 3D points are transformed using the estimate $\hat { x } _ { t + 1 }$ , and projected down to generate a 2D map of the environment (that tracks what parts of space are known to be traversable or known to be non-traversable or unknown). Note that, because of slippage in wheels etc., $\hat { x } _ { t + 1 }$ may not be the same as the true relative location of the agent from start of episode $x _ { t + 1 }$ . This leads to aliasing in the generated map. We do not use expensive non-linear optimization (bundle adjustment) to improve our estimate $\hat { x } _ { t + 1 }$ , but instead rely on learning to provide robustness against this mis-alignment. We use the new back-projected 3D points to update the current map $M _ { t }$ and to obtain an updated map $M _ { t + 1 }$ . + +# 3.2 POLICY ARCHITECTURE + +Before we describe our policy architecture, let’s define what are the features that a good exploration policy needs: (a) good exploration of a new environment requires an agent to meaningfully move around by detecting and avoiding obstacles; (b) good policy also requires the agent to identify semantic cues such as doors that may facilitate exploration; (c) finally, it requires the agent to keep track of what parts of the environment have or have not been explored, and to estimate how to get to parts of the environment that may not have been explored. + +This motivates our policy architecture. We fuse information from RGB image observations and occupancy grid-based maps. Information from the RGB image allows recognition of useful semantic cues. While information from the occupancy maps allows the agent to keep track of parts of the environment that have or have not been explored and to plan paths to unexplored regions without bumping into obstacles. + +The policy architecture is shown in Fig. 1. We describe it in detail here: + +1. Information from RGB images: RGB images are processed through a CNN. We use a ResNet18 CNN that has been pre-trained on the ImageNet classification task, and can identify semantic concepts in images. + +2. Information from Occupancy Maps: We derive an occupancy map from past observations (as described in Sec. 3.1), and use it with a ResNet-18 CNN to extract features. To simplify learning, we do not use the allocentric map, but transform it into an egocentric map using the estimated position $\hat { x } _ { t }$ (such that the agent is always at the center of the map, facing upwards). This map canonicalization aids learning. It allows the CNN to not only detect unexplored space but to also locate it with respect to its current location. Additionally, we use two such egocentric maps, a coarse map that captures information about a $4 0 m \times 4 0 m$ area around the agent, and a detailed map that describes a $4 m \times 4 m$ neighborhood. Some of these design choices were inspired by recent work from Gupta et al. (2017), Parisotto & Salakhutdinov (2018) and Henriques & Vedaldi (2018), though we make some simplifications. + +3. Recurrent Policy: Information from the RGB image and maps is fused and passed into an RNN. Recurrence can allow the agent to exhibit coherent behavior. + +# 3.3 COVERAGE REWARD + +We now describe the intrinsic reward function that we use to train our exploration policy. We derive this intrinsic rewards from the map $M _ { t }$ , by computing the coverage. Coverage $C ( { \bar { M } } _ { t } )$ is defined as the total area in the map that is known to be traversable or known to be non-traversable. Reward $R _ { i n t } ^ { c o v } ( t )$ at time step $t$ is obtained via gain in coverage in the map: $C ( M _ { t + 1 } ) - C ( M _ { t } )$ . Intuitively, if the current observation adds no obstacles or free-space to the map then it adds no information and hence no reward is given. We also use a collision penalty, that is estimated using the bump sensor, $R _ { i n t } ^ { c o l l } ( t ) = - B u m \bf { \bar { p } } ( t + 1 )$ , where $B u m p ( t + 1 )$ denotes if a collision occurred while executing action $a _ { t }$ . $R _ { i n t } ^ { c o v }$ and $R _ { i n t } ^ { c o l l }$ are combined to obtain the total reward. + +# 3.4 TRAINING PROCEDURE + +Finally, we describe how we optimize the policy. Navigating in complex realistic 3D houses, requires long-term coherent behavior over multiple time steps, such as exiting a room, going through doors, going down hallways. Such long-term behavior is hard to learn using reinforcement learning, given sparsity in reward. This leads to excessively large sample complexity for learning. To overcome this large sample complexity, we pre-train our policy to imitate human demonstrations of how to explore a new environment. We do this using trajectories collected from AMT workers as they were answering questions in House3D (Das et al., 2018). We ignore the question that was posed to the human, and treat these trajectories as a proxy for how a human will explore a previosuly unseen environment. After this phase of imitation learning, $\pi _ { e }$ is further trained via policy gradients (Williams, 1992) using proximal policy optimization (PPO) from Schulman et al. (2017). + +# 4 EXPERIMENTS + +The goal of this paper is to build agents that can autonomously explore novel complex 3D environments. We want to understand this in context of the different choices we made in our design, as well as how our design compares to alternate existing techniques for exploration. While coverage of the novel environment is a good task-agnostic metric, we also design experiments to additionally quantify the utility of generic task-agnostic exploration for downstream tasks of interest. We first describe our experimental setup that consists of complex realistic 3D environments and emphasizes the study of generalization to novel environments. We then describe experiments that measure task-agnostic exploration via coverage. And finally, we present experiments where we use different exploration schemes for downstream navigation tasks. + +# 4.1 EXPERIMENTAL SETUP + +We conducted our experiments on the House3D simulation environment Wu et al. (2018). House 3D is based on realistic apartment layouts from the SUNCG dataset Song et al. (2017) and simulates first-person observations and actions of a robotic agent embodied in these apartments. We use 20 houses each for training and testing. These sets are sampled from the respective sets in House 3D, and do not overlap. That is, testing is done on a set of houses not seen during training. This allows us to study generalization, i.e., how well our learned policies perform in novel, previously unseen houses. We made one customization to the House 3D environment: by default doors in House 3D are rendered but not used for collision checking. We modified House 3D to also not render doors, in addition to not using them for collision checking. + +Observation Space. We assume that the agent has an RGB-D camera with a field of view of $6 0 ^ { \circ }$ , and a bump sensor. The RGB-D camera returns a regular RGB image and a depth image that records the distance (depth information is clipped at 3m) of each pixel from the camera. The bump sensor returns if a collision happened while executing the previous action. + +Action Space. We followed the same action space as in EmbodiedQA (Das et al., 2018), with 6 motion primitives: move forward $0 . 2 5 \mathrm { m }$ , move backward $0 . 2 5 \mathrm { m }$ , strafe left $0 . 2 5 \mathrm { m }$ , strafe right $0 . 2 5 \mathrm { m }$ , turn left $9 ^ { \circ }$ , and turn right $9 ^ { \circ }$ . + +Extrinsic Environmental Reward. We do not use any externally specified reward signals from the environment: $R _ { e x t } ( t ) = 0$ . + +Intrinsic Reward. As described in Sec. 3.3, the intrinsic reward of the agent is based upon the map that it constructs as it moves around (as described in Sec. 3.1), and readings from the bump sensor. Reward $R _ { i n t } ( t ) = \alpha R _ { i n t } ^ { \mathrm { c o v } } ( t ) + \beta R _ { i n t } ^ { \mathrm { c o l l } } ( t )$ . Here $R _ { i n t } ^ { \mathrm { c o v } }$ is the coverage reward, and $R _ { i n t } ^ { \mathrm { c o l l } }$ is the collision reward. $\alpha , \beta$ are hyper-parameters to trade-off how aggressive the agent is. + +Training. As described in Sec. 3.4, we train policies using imitation of human trajectories and RL. + +1. Imitation from Human Exploration Trajectories. We leverage human exploration trajectories collected from AMT workers as they answered questions for the EmbodiedQA task (Das et al., 2018). We ignore the question that was posed to the AMT worker, and train our policy to simply mimic the actions that the humans took. As the humans were trying to answer these questions in previously unseen environments, we assume that these trajectories largely exhibit exploration behavior. We used a total of 693 human trajectories for this imitation. + +2. Reinforcement Learning: After learning via imitation, we further train the policy using reinforcement learning on the training houses. We use PPO (Schulman et al., 2017) to optimize the intrinsic reward defined above. At the start of each episode, the agent is initialized at a random location inside one of the training houses. Each episode is run for 500 time-steps. We run a total of 6400 episodes which amounts to a total of 3.2M steps of experience. + +Baselines. We next describe the various baseline methods that we experimented with. We implemented a classical baseline that purely reasons using geometry, and a learning baseline that uses curiosity for exploration. + +1. Frontier-based Exploration. As a classical baseline, we experimented with frontier-based exploration (Yamauchi, 1997; Dornhege & Kleiner, 2013). This is a purely geometric method that utilizes the built map $M _ { t }$ . Every iteration, it samples a point in currently unexplored space, and plans a path towards it from the current location (unobserved space is assumed to be free). As the plan is executed, both the map and the plan are updated. Once the chosen point is reached, this process is repeated. + +2. Curiosity-based Exploration. The next baseline we tried was curiosity-based exploration. In particular, we use the version proposed by Pathak et al. (2017) that uses prediction error of a forward model as reward. We use the modifications proposed by Burda et al. (2019), and only train a forward model. We prevent degeneracy in forward model by learning it in the fixed feature space of a ResNet-18 model that has been pre-trained on the ImageNet classification task. + +# 4.2 COVERAGE QUALITY + +We first measure exploration by itself, by measuring the true coverage of the agent. We compute the true coverage using the map as described in Sec. 3.1, except for using the true location of the agent rather than the estimated location (i.e. $x _ { t }$ instead of $\hat { x } _ { t }$ ). We study the following three scenarios: + +Without Estimation Noise: We first evaluate the performance of the agent that is trained and tested without observation noise, that is, $\hat { x } _ { t } = x _ { t }$ . Note that this setting is not very realistic as there is always observation error in an agent’s estimate of its location. It is also highly favorable to the frontier-based exploration agent, which very heavily relies on the accuracy of its maps. Fig. 2(left) presents the performance of different policies for this scenario. We first note that the curiosity based agent $\mathbf { \left( I L + R L \right. }$ with Curiosity) explores better than a random exploration policy (that executes a random action at each time step). Straight is a baseline where the agent moves along a straight line and executes a random number of $9 ^ { \circ }$ turns when a collision occurs, which is a strategy used by many robot vacuums. Such strategy does not require RGB or depth information, and performs better than the curiosity based agent. However, both policies are worse than an RGB only version of our method, an RGB only policy that is trained with our coverage reward $( \mathbf { I L } + \mathbf { R L }$ with RGB). Our full system $\mathbf { I L } + \mathbf { R L }$ with $\mathbf { M a p } + \mathbf { R G B } $ ) that also uses maps as input performs even better. + +![](images/28a1a6c04d78fda6672505548de839f6b5a1f9213538ced1e8dbab28252252c8.jpg) +Figure 2: Coverage Performance. Policies are tested on 100 exploration runs (5 random start locations each on 20 testing houses). Left figure plots average coverage as a function of number of time steps in the episode. Center figure studies impact of noise in state estimation. We plot average coverage at end of episode as a function of amount of noise. Right figure studies the case when there is a mis-match between geometry and affordance, and plots average coverage as a function of time steps in episode. All plots report mean performance over 3 runs, and the shaded area represents the minimum and maximum performance. + +Frontier-based exploration (Frontier-based Explr) has the best performance in this scenario. As noted, this is to expect as this method gets access to perfect, fully-registered maps, and employs optimal path planning algorithm to move from one place to another. It is also worth noting that, it is hard to use such classical techniques in situations where we only have a RGB images. In contrast, learning allows us to easily arrive at policies that can explore using only RGB images at test time. + +With Estimation Noise: We next describe a more realistic scenario that has estimation noise, i.e. $\hat { x } _ { t + 1 }$ is estimated using a noisy dynamics function. In particular, we add truncated Gaussian noise to the transition function $f$ at each time step. The details of the noise generation is elaborated in Appendix C.4. The noise compounds over time. Even though such a noise model leads to compounding errors over time (as in the case of a real robot), we acknowledge that this simple noise model may not perfectly match noise in the real world. Fig. 2(center) presents the coverage area at the end of episode (1000 time steps) as a function of the amount of noise introduced1. When the system suffers from sensor noise, the performance of the frontier-based exploration method drops rapidly. In contrast, our learning-based agent that wasn’t even trained with any noise continues to performs well. Even at relatively modest noise of $4 \%$ our learning based method already does better than the frontier-based agent. We additionally note that our agent can even be trained when the intrinsic reward estimation itself suffers from state estimation noise: for instance performance with $10 \%$ estimation noise (for intrinsic reward computation and map construction) is $9 8 . 9 m ^ { 2 }$ , only a minor degradation from $1 1 7 . 4 m ^ { 2 }$ ( $10 \%$ estimation noise for map construction at test time only). + +Geometry and Affordance Mismatch: Next, to emphasize the utility of learning for this task, we experiment with a scenario where we explicitly create a mismatch between geometry and affordance of the environment. We do this by rendering doors, but not using them for collision checking (i.e. the default House 3D environment). This setting helps us investigate if learning based techniques go beyond simple geometric reasoning in any way. Fig. 2(right) presents performance curves. We see that there is a large drop in performance for the frontier-based agent. This is because it is not able to distinguish doors from other obstacles, leading to path planning failures. However, there is a relatively minor drop in performance of our learning-based agent. This is because it can learn about doors (how to identify them in RGB images and the fact that they can be traversed) from human demonstrations and experience during reinforcement learning. + +# 4.2.1 ABLATION STUDY + +We also conducted ablations of our method to identify what parts of our proposed technique contribute to the performance. We do these ablations in the setting without any estimation noise, and use coverage as the metric. + +Imitation Learning: We check if pre-training with imitation learning is useful for this task. We test this by comparing to the models that were trained only with RL using the coverage reward. The left two plots in Fig. 3 shows performance of agents with following combinations: RL: policy trained with PPO only, $\cal { I L }$ : policy trained with imitation learning, Map: policy uses constructed maps as input, $R G B$ : policy uses RGB images as input. In all settings, pre-training with imitation learning helps improve performance, though training with RL improves coverage further. Also, policies trained using RL have a fairly large variance. Imitation learning also helps reduce the variance. + +![](images/4dc0163dc92fba4085ae5c1fb0ce1899a27b48bc5f66e509491c59059ebadeab.jpg) +Figure 3: Ablation Study: We report average coverage as a function of time step in episode. As before we plot mean over 3 runs and minimum and maximum performance. Left figure shows that using the RGB image helps improve performance, center figure shows that using the map helps improve performance. We can also see that imitation learning improves coverage and reduces the variance in performance. Right figure shows the comparison between different reward design. We can see that our intrinsic reward enables the agent to explore more efficiently in the testing time. + +RGB Observations and Map: Fig. 3 (left) and Fig. 3 (center) respectively show that both RGB images and map inputs improve performance. + +Intrinsic Reward: We also compare our intrinsic reward design with extrinsic reward design, as shown in Fig. 3 (right). The extrinsic reward is setup as follows: we randomly generated a number of locations evenly distributed across the traversable area of the houses, where the agent will get a positive reward if the agent is close to any of these locations. Once the agent gets a reward from a location, this location will be no longer taken into account for future reward calculation. We tried two settings where we place 1 or 4 reward-yielding objects per $m ^ { 2 }$ . We can see that our coverage map reward provides a better reward signal and in fact can be estimated intrinsically without needing to instrument the environment. + +# 4.3 USING EXPLORATION FOR DOWNSTREAM TASK + +Now that we have established how to explore well, we next ask if task-agnostic exploration is even useful for downstream tasks. We show this in context of goal-driven navigation. We execute the learned exploration policy $\pi _ { e }$ (for 1500 time steps) to explore a new house, and collect experience (set of images $\mathcal { T }$ along with their pose p). Once this exploration has finished, the agent is given different navigation tasks. These navigation tasks put the agent at an arbitrary location in the environment, and give it a goal image that it needs to reach. More specifically, we reset the agent to 50 random poses (positions and orientations) in each testing house (20 testing houses in total) and get the RGB camera view. The agent then needs to use the experience of the environment acquired during exploration to efficiently navigate to the desired target location. The efficiency of navigation on these test queries measures the utility of exploration. + +This evaluation requires a navigation policy $\pi _ { n }$ , that uses the exploration experience and the goal image to output actions that can convey the agent to the desired target location. We opt for a simple policy $\pi _ { n }$ . $\pi _ { n }$ first localizes the target image using nearest neighbor matching to the set of collected images $\mathcal { T }$ (in ImageNet pre-trained ResNet-18 feature space). It then plans a path to the this estimated target location using a occupancy map computed from $\mathcal { T }$ . We do this experiment in the setting without any state estimation noise. + +![](images/bc6d99dfdb5f9d8c8baf8104bc2b5634505fe1a806a2827d6ddbce1eb70dcaef.jpg) +Figure 4: Exploration for downstream tasks. We evaluate utility of exploration for the down-stream navigation tasks. Top plots shows effectiveness of the exploration trajectory for localization of goal images in a new environment. Bottom table compares efficiency of reaching goals without and with maps built during exploration. + +We independently measure the effectiveness of exploration data for a) localization of the given target images, and b) path planning efficiency in reaching desired locations. Localization performance: We measure the distance between the agent’s estimate of the goal image location, and the true goal image location. Fig. 4 (top) plots the success at localization as a function of the success threshold (distance at which we consider a localization as correct). We report top-1 and top-5 success rates. We compare to the random exploration baseline and curiosity-driven baseline which serve to measure the hardness of the task. We see our exploration scheme performs well. Path planning efficiency: Next, we measure how efficiently desired goal locations can be reached. We measure performance using the SPL metric as described by Anderson et al. (2018) (described in the appendix, higher is better). We compare against a baseline that does not have any prior experience in this environment and derives all map information on the fly from goal driven behavior (going to the desired test location). Both agents take actions based on the shortest-path motion planning algorithm. Once again these serve as a measure of the hardness of the topology of the underlying environment. As shown in Fig. 4 (bottom), using exploration data from our policy improves efficiency of paths to reach target locations. + +# 5 DISCUSSION + +In this paper, we motivated the need for learning explorations policies for navigation in novel 3D environments. We showed how to design and train such policies, and how experience gathered from such policies enables better performance for downstream tasks. We think we have just scratched the surface of this problem, and hope this inspires future research towards semantic exploration using more expressive policy architectures, reward functions and training techniques. + +# REFERENCES + +Robert G Abbott. Behavioral cloning for simulator validation. In Robot Soccer World Cup, pp. 329–336. Springer, 2007. 14 + +Peter Anderson, Angel Chang, Devendra Singh Chaplot, Alexey Dosovitskiy, Saurabh Gupta, Vladlen Koltun, Jana Kosecka, Jitendra Malik, Roozbeh Mottaghi, Manolis Savva, and Amir Zamir. On evaluation of embodied navigation agents. arXiv preprint arXiv:1807.06757, 2018. 9, +12 Brenna D Argall, Sonia Chernova, Manuela Veloso, and Brett Browning. A survey of robot learning from demonstration. Robotics and autonomous systems, 57(5):469–483, 2009. 14 Shi Bai, Jinkun Wang, Fanfei Chen, and Brendan Englot. Information-theoretic exploration with bayesian optimization. In IROS, 2016. 3 Yuri Burda, Harri Edwards, Deepak Pathak, Amos Storkey, Trevor Darrell, and Alexei A Efros. Large-scale study of curiosity-driven learning. In ICLR, 2019. 6 Cesar Cadena, Luca Carlone, Henry Carrillo, Yasir Latif, Davide Scaramuzza, Jose Neira, Ian Reid, ´ and John J Leonard. Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age. IEEE Transactions on Robotics, 2016. 2 Henry Carrillo, Ian Reid, and Jose A Castellanos. On the comparison of uncertainty criteria for ´ active slam. In ICRA, 2012. 2 Nuttapong Chentanez, Andrew G Barto, and Satinder P Singh. Intrinsically motivated reinforcement learning. In NIPS, 2005. 3 Abhishek Das, Samyak Datta, Georgia Gkioxari, Stefan Lee, Devi Parikh, and Dhruv Batra. Embodied Question Answering. In CVPR, 2018. 5, 6, 14 Christian Dornhege and Alexander Kleiner. A frontier-void-based approach for autonomous exploration in 3D. Advanced Robotics, 2013. 6 Yan Duan, John Schulman, Xi Chen, Peter L Bartlett, Ilya Sutskever, and Pieter Abbeel. RL2: Fast reinforcement learning via slow reinforcement learning. arXiv preprint arXiv:1611.02779, 2016. +3 Justin Fu, John Co-Reyes, and Sergey Levine. EX2: Exploration with exemplar models for deep reinforcement learning. In NIPS, 2017. 3 + +Dhiraj Gandhi, Lerrel Pinto, and Abhinav Gupta. Learning to fly by crashing. In IROS, 2017. 3 + +Saurabh Gupta, James Davidson, Sergey Levine, Rahul Sukthankar, and Jitendra Malik. Cognitive mapping and planning for visual navigation. In CVPR, 2017. 1, 2, 5 + +Richard Hartley and Andrew Zisserman. Multiple view geometry in computer vision. Cambridge university press, 2003. 1, 2, 13 + +Joao F Henriques and Andrea Vedaldi. MapNet: An allocentric spatial memory for mapping environments. In CVPR, 2018. 5 + +Dinesh Jayaraman and Kristen Grauman. Learning to look around: Intelligently exploring unseen environments for unknown tasks. In CVPR, 2018. 3 + +Thomas Kollar and Nicholas Roy. Trajectory optimization using reinforcement learning for map exploration. IJRR, 2008. 3 + +Steven M LaValle. Planning algorithms. Cambridge university press, 2006. 1, 2 + +Lennart Ljung. System identification: theory for the user. Prentice-hall, 1987. 3 + +Manuel Lopes, Tobias Lang, Marc Toussaint, and Pierre-Yves Oudeyer. Exploration in model-based reinforcement learning by empirically estimating learning progress. In NIPS, 2012. 3 + +Ruben Martinez-Cantin, Nando de Freitas, Eric Brochu, Jose Castellanos, and Arnaud Doucet. A ´ bayesian exploration-exploitation approach for optimal online sensing and planning with a visually guided mobile robot. Autonomous Robots, 2009. 2 + +Ryszard S Michalski, Ivan Bratko, and Avan Bratko. Machine learning and data mining; methods and applications. John Wiley & Sons, Inc., 1998. 14 + +Piotr Mirowski, Razvan Pascanu, Fabio Viola, Hubert Soyer, Andy Ballard, Andrea Banino, Misha Denil, Ross Goroshin, Laurent Sifre, Koray Kavukcuoglu, et al. Learning to navigate in complex environments. In ICLR, 2017. 1, 2 + +Nikhil Mishra, Mostafa Rohaninejad, Xi Chen, and Pieter Abbeel. A simple neural attentive metalearner. In ICLR, 2018. 3 + +Emilio Parisotto and Ruslan Salakhutdinov. Neural map: Structured memory for deep reinforcement learning. In ICLR, 2018. 5 + +Deepak Pathak, Pulkit Agrawal, Alexei A Efros, and Trevor Darrell. Curiosity-driven exploration by self-supervised prediction. In ICML, 2017. 3, 6 + +Deepak Pathak, Parsa Mahmoudieh, Guanghao Luo, Pulkit Agrawal, Dian Chen, Yide Shentu, Evan Shelhamer, Jitendra Malik, Alexei A. Efros, and Trevor Darrell. Zero-shot visual imitation. In ICLR, 2018. 2 + +Fereshteh Sadeghi and Sergey Levine. CAD2RL: Real single-image flight without a single real image. In RSS, 2017. 3 + +Nikolay Savinov, Alexey Dosovitskiy, and Vladlen Koltun. Semi-parametric topological memory for navigation. In ICLR, 2018. 1, 2 + +Jurgen Schmidhuber. A possibility for implementing curiosity and boredom in model-building neu- ¨ ral controllers. In International Conference on Simulation of Adaptive Behavior: From Animals to Animats, 1991. 3 + +John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347, 2017. 5, 6 + +Shuran Song, Fisher Yu, Andy Zeng, Angel X Chang, Manolis Savva, and Thomas Funkhouser. Semantic scene completion from a single depth image. In CVPR, 2017. 5 + +Bradly C Stadie, Sergey Levine, and Pieter Abbeel. Incentivizing exploration in reinforcement learning with deep predictive models. arXiv preprint arXiv:1507.00814, 2015. 3 + +Sebastian Thrun, Maren Bennewitz, Wolfram Burgard, Armin B Cremers, Frank Dellaert, Dieter Fox, Dirk Hahnel, Charles Rosenberg, Nicholas Roy, Jamieson Schulte, et al. MINERVA: A second-generation museum tour-guide robot. In ICRA, 1999. 1 + +Sebastian Thrun, Wolfram Burgard, and Dieter Fox. Probabilistic robotics. MIT press, 2005. 1, 2 + +Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning, 1992. 5 + +Yi Wu, Yuxin Wu, Georgia Gkioxari, and Yuandong Tian. Building generalizable agents with a realistic and rich 3d environment. arXiv preprint arXiv:1801.02209, 2018. 5, 13 + +Kai Xu, Lintao Zheng, Zihao Yan, Guohang Yan, Eugene Zhang, Matthias Niessner, Oliver Deussen, Daniel Cohen-Or, and Hui Huang. Autonomous reconstruction of unknown indoor scenes guided by time-varying tensor fields. In SIGGRAPH Asia, 2017. 3 + +Brian Yamauchi. A frontier-based approach for autonomous exploration. In Computational Intelligence in Robotics and Automation (CIRA), 1997. 1, 6 + +Wenhao Yu, Jie Tan, C Karen Liu, and Greg Turk. Preparing for the unknown: Learning a universal policy with online system identification. In RSS, 2017. 3 + +Jingwei Zhang, Lei Tai, Joschka Boedecker, Wolfram Burgard, and Ming Liu. Neural slam: Learning to explore with external memory. arXiv preprint, 2017. URL http://arxiv.org/abs/1706.09520. 3 + +Yuke Zhu, Roozbeh Mottaghi, Eric Kolve, Joseph J Lim, Abhinav Gupta, Li Fei-Fei, and Ali Farhadi. Target-driven visual navigation in indoor scenes using deep reinforcement learning. In ICRA, 2017. 1, 2 + +# APPENDIX A SPL METRIC + +As defined by Anderson et al. (2018), Success weighted by (normalized inverse) Path Length or SPL is computed as follows. Here, $\ell _ { i }$ is the shortest-path distance between the starting and goal position, $p _ { i }$ is the length of the path actually executed by the agent, and $S _ { i }$ is a binary variable that indicates if the agent succeeded. SPL is computed over $N$ trials as follows: + +$$ +S P L = \frac { 1 } { N } \sum _ { i = 1 } ^ { N } S _ { i } \frac { \ell _ { i } } { \operatorname* { m a x } ( p _ { i } , \ell _ { i } ) } . +$$ + +# APPENDIX B EXAMPLES OF POLICY INPUTS AND MAPS + +We show an example of the policy inputs (RGB image and maps in two different scales) at time $t$ and $t + 1 0$ in Fig. B.1. Green area means the known(seen) traversable area, blue area means known non-traversable area, and the white area means unknown area. Fig. B.2 shows how the map evolves and the agent moves as it explores a new house. + +![](images/fcdc4d42458a52a98f01afaf12535efd9e16eb11677ced891f5f275f3d3f10b6.jpg) + +![](images/0db49537d45b51474ca20063e92cc26cb745626da254b893980ac177bcae917f.jpg) +Figure B.1: Examples of policy inputs at time step $t$ and $t + 1 0$ . (a) and (d) are the RGB images, (b) and (e) are the coarse maps, and (c) and (f) are the fine maps. +Figure B.2: Snapshots of the built map as the agent explores the house + +# APPENDIX C EXPERIMENTAL DETAILS + +# C.1 ENVIRONMENT DETAILS + +In this paper, we simulated the agent in House3D environment Wu et al. (2018) and used 20 houses for training and 20 new houses for testing. Fig. C.1 shows the distribution of the total traversable area of these houses. Fig. C.2 shows some examples of the top-down views for training and testing houses (white is traversable, black is occupied). + +![](images/b560d434f3321dbe20fdd4229d761a54fddc9afae255d0b9360287666d7711c6.jpg) + +![](images/3528259f82349e65d518beeff522e87ce7c1925368c19dc77c8d35c0d26f92ae.jpg) +Figure C.1: Area distribution of training and testing houses (20 houses in each case). The average movable area of the training houses is $2 8 9 . 7 \mathrm { m } ^ { 2 }$ . The average movable area of the testing houses is $\mathrm { 3 2 7 . 9 ~ m ^ { \mathrm { 2 } } }$ . +Figure C.2: Examples of house layouts (top-down views). The left three figures show 3 examples of the training houses. The right three figures show 3 examples of the testing houses. White regions indicate traversable area, black regions represent occupied area. + +# C.2 MAP RECONSTRUCTION + +Given a sequence of camera poses (extrinsics) $( [ R _ { 1 } , t _ { 1 } ] , [ R _ { 2 } , t _ { 2 } ] , . . . , [ R _ { N } , t _ { N } ] )$ , and the corresponding depth images $( D _ { 1 } , D _ { 2 } , . . . , D _ { N } )$ at each time step as well as the camera intrinsics $\pmb { K } \in \mathbb { R } ^ { 3 \times 3 }$ , we can reconstruct the point cloud of the scene based on the principle of mulitple-view geometry (Hartley & Zisserman, 2003). We can convert the points from pixel space to the camera space and then to the world space. More specifically, the formulas to achieve this can be summarized as follows: + +$$ +\begin{array} { c } { { \lambda _ { i j } { \pmb x } _ { i j } = K \left[ { \pmb R } _ { i } , { \pmb t } _ { i } \right] { \pmb w } _ { i j } \quad \forall j \in \{ 1 , 2 , . . . , S \} , i \in \{ 1 , . . . , N \} } } \\ { { N \mathrm { ~ } _ { i } \mathrm { ~ } _ { j } } } \\ { { \pmb W } = \displaystyle \bigcup _ { i = 1 } ^ { N } \displaystyle \bigcup _ { j = 1 } ^ { S } { \pmb w } _ { i j } } \end{array} +$$ + +where $S$ is the total number of pixels in each depth image, $\pmb { x } _ { i j } \in \mathbb { R } ^ { 3 }$ is the homogeneous coordinates for $j _ { \mathrm { t h } }$ pixel on $i _ { \mathrm { t h } }$ depth image $D _ { i }$ , $\lambda _ { i j } \in \mathbb { R }$ is the depth value of the $j _ { \mathrm { t h } }$ pixel on $i _ { \mathrm { t h } }$ depth image $D _ { i }$ , and $\ b w _ { i j } \in \mathbb { R } ^ { 4 }$ is the homogeneous coordinates for the corresponding point in the world coordinate system. We can get ${ \pmb w } _ { i j }$ from $\mathbf { \boldsymbol { x } } _ { i j }$ based on Equation (2). And we can merge points via Equation (3). + +# C.3 TRAINING DETAILS + +The occupancy map generated by the agent itself uses a resolution of $0 . 0 5 \mathrm { m }$ . Our policy uses a coarse map, and a detailed map. The coarse map captures information about a $4 0 \mathrm { m } \times 4 0 \mathrm { m }$ area around the agent, at a resolution of of $0 . 5 m$ . The occupancy map is down-sampled from $8 0 0 \times 8 0 0$ to $8 0 \times 8 0$ to generate the coarse map that is fed into the policy network. The detailed map captures information about a $4 \mathrm { m } \times 4 \mathrm { m }$ area around the agent at a $0 . 0 5 m$ resolution. RGB images are rendered at $2 2 4 \times 2 2 4$ resolution in House3D and re-sized into $8 0 \times 8 0$ before they are fed into the policy network. + +The size of the last fully-connected layer in ResNet18 architecture is modified to 128. Outputs of the three ResNet18 networks are concatenated into a 384-dimensional vector. This is transformed into a 128-dimensional vector via a fully-connected layer. Next, it’s fed into a single-layer RNN(GRU) layer with 128 hidden layer size. The output of RNN layer is followed by two heads. One head (the policy head) has two fully-connected layers $( 1 2 8 - 3 2 - 6 )$ . The other head (the value head) has two fully-connected layers $( 1 2 8 - 3 2 - 1 )$ . We use ELU as the nonlinear activation function for the fully-connected layers after ResNet18. + +Each episode consists of 500 steps in training. RNN time sequence length is 20. Coverage area $C ( M _ { t } )$ is measured by the number of covered grids in the occupancy map. Coefficient $\alpha$ for the coverage reward $R _ { i n t } ^ { \mathrm { c o v } } ( t )$ is 0.0005, coefficient $\beta$ for $R _ { i n t } ^ { \mathrm { c o l l } } ( t )$ is 0.006. PPO entropy loss coefficient is 0.01. Network is optimized via Adam optimizer with a learning rate of 0.00001. + +# C.4 NOISE MODEL + +Details of noise generation for experiments with estimation noise in Section 4.2: + +1. Without loss of generality, we initialize the agent at the origin, that is ${ \hat { x } } _ { 0 } = x _ { 0 } = \mathbf { 0 }$ . +2. The agent takes an action $a _ { t }$ . We add truncated Gaussian noise to the action primitive(e.g., move forward $0 . 2 5 \mathrm { m } )$ to get the estimated pose $\hat { x } _ { t + 1 }$ , i.e., $\hat { x } _ { t + 1 } = \hat { x } _ { t } + \tilde { a } _ { t }$ where $\hat { x } _ { t }$ is the estimated pose in time step t and $\tilde { a } _ { t }$ is the action primitive $a _ { t }$ with added noise. +3. Iterate the second step until the maximum number of steps is reached. + +Thus, in this noise model, the agent estimates its new pose based on the estimated pose from the last time step and the executed action. Thus, we dont use oracle odometry in the noise experiments. This noise model leads to compounding errors over time (as in the case of a real robot), though we acknowledge that this simple noise model may not perfectly match noise in the real world. + +# C.5 IMITATION LEARNING DETAILS + +We use behavioral cloning technique (Argall et al., 2009; Michalski et al., 1998; Abbott, 2007) to imitate the human behaviors in exploring the environments. We got the human demonstration trajectories from (Das et al., 2018). We ignored the question-answering part of the data and only used the exploration trajectories. We cleaned up the data by removing the trajectories that have less than 100 time steps. The trajectories are then converted into short sequences of trajectory segments $( \left( { { s _ { i } } , { a _ { i } } , { s _ { i + 1 } } , { a _ { i + 1 } } , . . . , { s _ { i + T } } , { a _ { i + T } } } \right)$ , where $T$ is based on the RNN sequence length). The policy is pretrained with behavioral cloning by imitating actions $( a _ { i } , a _ { i + 1 } , . . . , a _ { i + T } )$ from the human demonstrations given the states $( s _ { i } , s _ { i + 1 } , . . . , s _ { i + T } )$ . \ No newline at end of file diff --git a/parse/train/SyMWn05F7/SyMWn05F7_content_list.json b/parse/train/SyMWn05F7/SyMWn05F7_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..b31a0857641c15d2e487f48ce8249ecff55684b4 --- /dev/null +++ b/parse/train/SyMWn05F7/SyMWn05F7_content_list.json @@ -0,0 +1,1545 @@ +[ + { + "type": "text", + "text": "LEARNING EXPLORATION POLICIES FOR NAVIGATION ", + "text_level": 1, + "bbox": [ + 171, + 98, + 820, + 121 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Tao Chen1 Saurabh Gupta2 Abhinav Gupta1,2 \n1Carnegie Mellon University \n2Facebook AI Research ", + "bbox": [ + 183, + 143, + 549, + 188 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 224, + 544, + 239 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Numerous past works have tackled the problem of task-driven navigation. But, how to effectively explore a new environment to enable a variety of down-stream tasks has received much less attention. In this work, we study how agents can autonomously explore realistic and complex 3D environments without the context of task-rewards. We propose a learning-based approach and investigate different policy architectures, reward functions, and training paradigms. We find that use of policies with spatial memory that are bootstrapped with imitation learning and finally finetuned with coverage rewards derived purely from on-board sensors can be effective at exploring novel environments. We show that our learned exploration policies can explore better than classical approaches based on geometry alone and generic learning-based exploration techniques. Finally, we also show how such task-agnostic exploration can be used for down-stream tasks. Videos are available at: https://sites.google.com/view/exploration-for-nav/. ", + "bbox": [ + 233, + 256, + 764, + 435 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 462, + 336, + 478 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Imagine your first day at a new workplace. If you are like most people, the first task you set for yourself is to become familiar with the office so that the next day when you have to attend meetings and perform tasks, you can navigate efficiently and seamlessly. To achieve that goal, you explore your office without the task context of target locations you have to reach and build a generic understanding of space. This step of task-independent exploration is quite critical yet often ignored in current approaches for navigation. ", + "bbox": [ + 174, + 492, + 825, + 577 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "When it comes to navigation, currently there are two paradigms: (a) geometric reconstruction and path-planning based approaches (Hartley & Zisserman, 2003; Thrun et al., 2005; LaValle, 2006), and (b) learning-based approaches (Mirowski et al., 2017; Gupta et al., 2017; Savinov et al., 2018; Zhu et al., 2017). SLAM-based approaches, first build a map and then use localization and path planning for navigation. In doing this, one interesting question that is often overlooked is: How does one build a map? How should we explore the environment to build this map? Current approaches either use a human operator to control the robot for building the map (e.g. Thrun et al. (1999)), or use heuristics such as frontier-based exploration (Yamauchi, 1997). On the other hand for approaches that use learning, most only learn policies for specific tasks (Zhu et al., 2017; Mirowski et al., 2017; Gupta et al., 2017), or assume environments have already been explored (Savinov et al., 2018). Moreover, in context of such learning based approaches, the question of exploration is not only important at test time, but also at train time. And once again, this question is largely ignored. Current approaches either use sample inefficient random exploration or make impractical assumptions about full map availability for generating supervision from optimal trajectories. ", + "bbox": [ + 173, + 584, + 825, + 777 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Thus, a big bottleneck for both these navigation paradigms is an exploration policy: a task-agnostic policy that explores the environment to either build a map or sample trajectories for learning a navigation policy in a sample-efficient manner. But how do we learn this task-independent policy? What should be the reward for such a policy? First possible way is to not use learning and use heuristic based approaches (Yamauchi, 1997). However, there are four issues with non-learning based approaches: (a) these approaches are brittle and fail when there is noise in ego-estimation or localization; (b) they make strong assumptions about free-space/collisions and fail to generalize when navigation requires interactions such as opening doors etc.; (c) they fail to capture semantic priors that can reduce search-space significantly; and (d) they heavily rely on specialized sensors such as range scanners. Another possibility is to learn exploration policies on training environments. One way is to use reinforcement learning (RL) with intrinsic rewards. Examples of intrinsic rewards can be “curiosity” where prediction error is used as reward signal or “diversity” which discourages the agent from revisiting the same states. While this seems like an effective reward, such approaches are still sample inefficient due to blackbox reward functions that can’t be differentiated to compute gradients effectively. So, what would be an effective way to learn exploration policies for navigation? ", + "bbox": [ + 174, + 785, + 825, + 924 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 172 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we propose an approach for learning policies for exploration for navigation. We explore this problem from multiple perspectives: (a) architectural design, (b) reward function design, and (c) reward optimization. Specifically, from perspective of reward function and optimization, we take the alternative paradigm and use supervision from human explorations in conjunction with intrinsic rewards. We notice that bootstrapping of learning from small amount of human supervision aids learning of semantics (e.g. doors are pathways). It also provides a good initialization for learning using intrinsic rewards. From the perspective of architecture design, we explore how to use 3D information and use it efficiently while doing exploration. We study proxy rewards that characterize coverage and demonstrate how this reward outperforms other rewards such as curiosity. Finally, we show how experience gathered from our learned exploration policies improves performance at down-stream navigation tasks. ", + "bbox": [ + 174, + 180, + 825, + 333 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 359, + 343, + 376 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our work on learning exploration policies for navigation in real world scenes is related to active SLAM in classical robotics, and intrinsic rewards based exploration in reinforcement learning. As we study the problem of navigation, we also draw upon recent efforts that use learning for this problem. We survey related efforts in these three directions. ", + "bbox": [ + 174, + 396, + 823, + 452 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Navigation in Classical Robotics. Classical approaches to navigation operate by building a map of the environment, localizing the agent in this map, and then planning paths to convey the agent to desired target locations. Consequently, the problems of mapping, localization and path-planning have been very thoroughly studied (Hartley & Zisserman, 2003; Thrun et al., 2005; LaValle, 2006). However, most of this research starts from a human-operated traversal of the environment, and falls under the purview of passive SLAM. Active SLAM, or how to automatically traverse a new environment for building spatial representations is much less studied. Cadena et al. (2016) present an excellent review of active SLAM literature, we summarize some key efforts here. Past works have formulated active SLAM as Partially Observable Markov Decision Processes (POMDPs) (MartinezCantin et al., 2009), or as choosing actions that reduce uncertainty in the estimated map (Carrillo et al., 2012). While these formulations enable theoretical analysis, they crucially rely on sensors to build maps and localize. Thus, such approaches are highly susceptible to measurement noise. Additionally, such methods treat exploration purely as a geometry problem, and entirely ignore semantic cues for exploration such as doors. ", + "bbox": [ + 174, + 459, + 825, + 652 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Learning for Navigation. In order to leverage such semantic cues for navigation, recent works have formulated navigation as a learning problem (Zhu et al., 2017; Gupta et al., 2017; Mirowski et al., 2017; Savinov et al., 2018). A number of design choices have been investigated. For example, these works have investigated different policy architectures for representing space: Zhu et al. (2017) use feed-forward networks, Mirowski et al. (2017) use vanilla neural network memory, Gupta et al. (2017) use spatial memory and planning modules, and Savinov et al. (2018) use semi-parametric topological memory. Different training paradigms have also been explored: Gupta et al. (2017) learn to imitate behavior of an optimal expert, Mirowski et al. (2017) and Zhu et al. (2017) use extrinsic reward based reinforcement learning, Pathak et al. (2018) learn an inverse dynamics model on the demonstrated trajectory way-points from the expert, while Savinov et al. (2018) use selfsupervision. In our work here, we build on insights from these past works. Our policy architecture and reward definition use spatial memory to achieve long-horizon exploration, and we imitate human exploration demonstrations to boot-strap policy learning. However, in crucial distinction, instead of studying goal-directed navigation (either in the form of going to a particular goal location, or object of interest), we study the problem of autonomous exploration of novel environments in a taskagnostic manner. In doing so, unlike past works, we do not assume access to human demonstrations in the given novel test environment like Savinov et al. (2018), nor do we assume availability of millions of samples of experience or reward signals in the novel test environment like Zhu et al. (2017) or Mirowski et al. (2017). Moreover, we do not depend on extrinsically defined reward signals for training. We derive them using on-board sensors. This makes our proposed approach amenable to real world deployment. Learning based approaches (Gandhi et al., 2017; Sadeghi & Levine, 2017) have also been used to learn low-level collision avoidance policies. While they do not use task-context, they learn to move towards open space, without the intent of exploring the whole environment. Zhang et al. (2017) uses a differentiable map structure to mimic the SLAM techniques. Such works are orthogonal to our effort on exploration as our exploration policy can benefit from their learned maps instead of only using reconstructed occupancy map. ", + "bbox": [ + 174, + 660, + 825, + 924 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/a954b8198e004d046aa04a08c0de5ed74c59e46707d404905e4c17c9e20f65fe.jpg", + "image_caption": [ + "Figure 1: Policy and Training Architecture: Our scheme for learning exploration policies for navigation. We assume a mobile robot with an RGB-D camera and a bump sensor. We maintain a running estimate of its position $\\hat { x } _ { t }$ . These position estimates are used to stitch together an approximate map of the environment using the depth images. The exploration policy $\\pi _ { e }$ is a recurrent network takes egocentric crops of this map at two scales, and the current RGB image as input. The policy is trained using an intrinsic coverage reward that is computed from the approximate map and a collision penalty obtained from the bump sensor. " + ], + "image_footnote": [], + "bbox": [ + 210, + 56, + 790, + 301 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 397, + 825, + 496 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Exploration for Navigation. A notable few past works share a similar line of thought, and investigate exploration in context of reinforcement learning (Schmidhuber, 1991; Stadie et al., 2015; Pathak et al., 2017; Fu et al., 2017; Lopes et al., 2012; Chentanez et al., 2005). These works design intrinsic reward functions to capture novelty of states or state-action transitions. Exploration policies are then learned by optimizing these reward functions using reinforcement learning. Our work is most similar to these works. However, we focus on this problem in the specific context of navigation in complex and realistic 3D environments, and propose specialized policy architectures and intrinsic reward functions. We experimentally demonstrate that these specializations improve performance, and how learning based exploration techniques may not be too far from real world deployment. Jayaraman & Grauman (2018) use a related reward function (pixel reconstruction) to learn policies to look around (and subsequently solve tasks). However, they do it in context of $3 6 0 ^ { \\circ }$ images, and their precise reward can’t be estimated intrinsically. Xu et al. (2017) generate smooth movement path for high-quality camera scan by using time-varying tensor fields. Bai et al. (2016) propose an information-theoretic exploration method using Gaussian Process regression and show experiments on simplistic map environments. Kollar & Roy (2008) assume access to the groundtruth map and learn an optimized trajectory that maximizes the accuracy of the SLAM-derived map. In contrast, our learning policy directly tells the action that the agent should take next and estimates the map on the fly. ", + "bbox": [ + 173, + 503, + 825, + 752 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "System Identification. Finally, the general idea of exploration prior to goal-driven behavior, is also related to the classical idea of system identification (Ljung, 1987). Recent interest in this idea with end-to-end learning (Yu et al., 2017; Duan et al., 2016; Mishra et al., 2018) has been shown to successfully adapt to novel mazes. In comparison, we tackle navigation in complex and realistic 3D environments, with very long spatio-temporal dependencies. ", + "bbox": [ + 174, + 758, + 823, + 829 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 APPROACH", + "text_level": 1, + "bbox": [ + 176, + 849, + 297, + 866 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Let us consider a mobile agent that is equipped with an RGB-D camera and that can execute basic movement macro-actions. This agent has been dropped into a novel environment that it has never been in before. We want to learn an exploration policy $\\pi _ { e }$ that enables this agent to efficiently explore this new environment. A successful exploration of the new environment should enable the agent to accomplish down-stream tasks in this new environment efficiently. ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We formulate estimation of $\\pi _ { e }$ as a learning problem. We design a reward function that is estimated entirely using on-board sensors, and learn $\\pi _ { e }$ using RL. Crucially, $\\pi _ { e }$ is learned on a set of environments $\\mathcal { E } _ { t r a i n }$ , and tested on a held-out set of environments $\\mathcal { E } _ { t e s t }$ , i.e., $\\mathcal { E } _ { t r a i n } \\cap \\mathcal { E } _ { t e s t } = \\phi$ . ", + "bbox": [ + 176, + 138, + 823, + 181 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The key novelties in our work are: a) the design of the policy $\\pi _ { e }$ , b) the design of the reward function $R$ , and c) use of human demonstrations to speed up training of $\\pi _ { e }$ . The design of the policy and the reward function depend on a rudimentary map of the environment that we maintain over time. We first describe the map construction procedure, and then detail the aforementioned aspects. ", + "bbox": [ + 176, + 188, + 825, + 243 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 MAP CONSTRUCTION ", + "text_level": 1, + "bbox": [ + 176, + 265, + 364, + 280 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "As the agent moves around, it uses its depth camera to build and update a map of the world around it. This is done by maintaining an estimate of the agent’s location over time and projecting 3D points observed in the depth image into an allocentric map of the environment. ", + "bbox": [ + 174, + 292, + 825, + 335 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "More specifically, let us assume that the agent’s estimate of its current location at time step $t$ is $\\hat { x _ { t } }$ , and that the agent starts from origin (i.e. $\\hat { x } _ { 0 } = \\mathbf { 0 }$ ). When the agent executes an action $a _ { t }$ at time step $t$ , it updates its position estimate through a known transition function $f$ , i.e., $\\hat { x } _ { t + 1 } = f ( \\hat { x } _ { t } , a _ { t } )$ . ", + "bbox": [ + 176, + 342, + 823, + 385 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The depth image observation at time step $t + 1$ , $D _ { t + 1 }$ is back-projected into 3D points using known camera intrinsic parameters. These 3D points are transformed using the estimate $\\hat { x } _ { t + 1 }$ , and projected down to generate a 2D map of the environment (that tracks what parts of space are known to be traversable or known to be non-traversable or unknown). Note that, because of slippage in wheels etc., $\\hat { x } _ { t + 1 }$ may not be the same as the true relative location of the agent from start of episode $x _ { t + 1 }$ . This leads to aliasing in the generated map. We do not use expensive non-linear optimization (bundle adjustment) to improve our estimate $\\hat { x } _ { t + 1 }$ , but instead rely on learning to provide robustness against this mis-alignment. We use the new back-projected 3D points to update the current map $M _ { t }$ and to obtain an updated map $M _ { t + 1 }$ . ", + "bbox": [ + 173, + 391, + 825, + 517 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 POLICY ARCHITECTURE ", + "text_level": 1, + "bbox": [ + 176, + 537, + 383, + 553 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Before we describe our policy architecture, let’s define what are the features that a good exploration policy needs: (a) good exploration of a new environment requires an agent to meaningfully move around by detecting and avoiding obstacles; (b) good policy also requires the agent to identify semantic cues such as doors that may facilitate exploration; (c) finally, it requires the agent to keep track of what parts of the environment have or have not been explored, and to estimate how to get to parts of the environment that may not have been explored. ", + "bbox": [ + 174, + 565, + 825, + 650 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "This motivates our policy architecture. We fuse information from RGB image observations and occupancy grid-based maps. Information from the RGB image allows recognition of useful semantic cues. While information from the occupancy maps allows the agent to keep track of parts of the environment that have or have not been explored and to plan paths to unexplored regions without bumping into obstacles. ", + "bbox": [ + 174, + 656, + 825, + 727 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The policy architecture is shown in Fig. 1. We describe it in detail here: ", + "bbox": [ + 176, + 733, + 642, + 747 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "1. Information from RGB images: RGB images are processed through a CNN. We use a ResNet18 CNN that has been pre-trained on the ImageNet classification task, and can identify semantic concepts in images. ", + "bbox": [ + 176, + 762, + 825, + 804 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "2. Information from Occupancy Maps: We derive an occupancy map from past observations (as described in Sec. 3.1), and use it with a ResNet-18 CNN to extract features. To simplify learning, we do not use the allocentric map, but transform it into an egocentric map using the estimated position $\\hat { x } _ { t }$ (such that the agent is always at the center of the map, facing upwards). This map canonicalization aids learning. It allows the CNN to not only detect unexplored space but to also locate it with respect to its current location. Additionally, we use two such egocentric maps, a coarse map that captures information about a $4 0 m \\times 4 0 m$ area around the agent, and a detailed map that describes a $4 m \\times 4 m$ neighborhood. Some of these design choices were inspired by recent work from Gupta et al. (2017), Parisotto & Salakhutdinov (2018) and Henriques & Vedaldi (2018), though we make some simplifications. ", + "bbox": [ + 176, + 811, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 186, + 103, + 823, + 132 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3. Recurrent Policy: Information from the RGB image and maps is fused and passed into an RNN. Recurrence can allow the agent to exhibit coherent behavior. ", + "bbox": [ + 179, + 137, + 821, + 166 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.3 COVERAGE REWARD ", + "text_level": 1, + "bbox": [ + 176, + 185, + 359, + 199 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We now describe the intrinsic reward function that we use to train our exploration policy. We derive this intrinsic rewards from the map $M _ { t }$ , by computing the coverage. Coverage $C ( { \\bar { M } } _ { t } )$ is defined as the total area in the map that is known to be traversable or known to be non-traversable. Reward $R _ { i n t } ^ { c o v } ( t )$ at time step $t$ is obtained via gain in coverage in the map: $C ( M _ { t + 1 } ) - C ( M _ { t } )$ . Intuitively, if the current observation adds no obstacles or free-space to the map then it adds no information and hence no reward is given. We also use a collision penalty, that is estimated using the bump sensor, $R _ { i n t } ^ { c o l l } ( t ) = - B u m \\bf { \\bar { p } } ( t + 1 )$ , where $B u m p ( t + 1 )$ denotes if a collision occurred while executing action $a _ { t }$ . $R _ { i n t } ^ { c o v }$ and $R _ { i n t } ^ { c o l l }$ are combined to obtain the total reward. ", + "bbox": [ + 174, + 212, + 825, + 325 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.4 TRAINING PROCEDURE ", + "text_level": 1, + "bbox": [ + 176, + 344, + 377, + 358 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Finally, we describe how we optimize the policy. Navigating in complex realistic 3D houses, requires long-term coherent behavior over multiple time steps, such as exiting a room, going through doors, going down hallways. Such long-term behavior is hard to learn using reinforcement learning, given sparsity in reward. This leads to excessively large sample complexity for learning. To overcome this large sample complexity, we pre-train our policy to imitate human demonstrations of how to explore a new environment. We do this using trajectories collected from AMT workers as they were answering questions in House3D (Das et al., 2018). We ignore the question that was posed to the human, and treat these trajectories as a proxy for how a human will explore a previosuly unseen environment. After this phase of imitation learning, $\\pi _ { e }$ is further trained via policy gradients (Williams, 1992) using proximal policy optimization (PPO) from Schulman et al. (2017). ", + "bbox": [ + 173, + 371, + 825, + 510 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 532, + 326, + 547 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The goal of this paper is to build agents that can autonomously explore novel complex 3D environments. We want to understand this in context of the different choices we made in our design, as well as how our design compares to alternate existing techniques for exploration. While coverage of the novel environment is a good task-agnostic metric, we also design experiments to additionally quantify the utility of generic task-agnostic exploration for downstream tasks of interest. We first describe our experimental setup that consists of complex realistic 3D environments and emphasizes the study of generalization to novel environments. We then describe experiments that measure task-agnostic exploration via coverage. And finally, we present experiments where we use different exploration schemes for downstream navigation tasks. ", + "bbox": [ + 174, + 564, + 825, + 690 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.1 EXPERIMENTAL SETUP ", + "text_level": 1, + "bbox": [ + 176, + 709, + 375, + 723 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We conducted our experiments on the House3D simulation environment Wu et al. (2018). House 3D is based on realistic apartment layouts from the SUNCG dataset Song et al. (2017) and simulates first-person observations and actions of a robotic agent embodied in these apartments. We use 20 houses each for training and testing. These sets are sampled from the respective sets in House 3D, and do not overlap. That is, testing is done on a set of houses not seen during training. This allows us to study generalization, i.e., how well our learned policies perform in novel, previously unseen houses. We made one customization to the House 3D environment: by default doors in House 3D are rendered but not used for collision checking. We modified House 3D to also not render doors, in addition to not using them for collision checking. ", + "bbox": [ + 174, + 734, + 825, + 861 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Observation Space. We assume that the agent has an RGB-D camera with a field of view of $6 0 ^ { \\circ }$ , and a bump sensor. The RGB-D camera returns a regular RGB image and a depth image that records the distance (depth information is clipped at 3m) of each pixel from the camera. The bump sensor returns if a collision happened while executing the previous action. ", + "bbox": [ + 174, + 868, + 823, + 924 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Action Space. We followed the same action space as in EmbodiedQA (Das et al., 2018), with 6 motion primitives: move forward $0 . 2 5 \\mathrm { m }$ , move backward $0 . 2 5 \\mathrm { m }$ , strafe left $0 . 2 5 \\mathrm { m }$ , strafe right $0 . 2 5 \\mathrm { m }$ , turn left $9 ^ { \\circ }$ , and turn right $9 ^ { \\circ }$ . ", + "bbox": [ + 173, + 103, + 823, + 145 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Extrinsic Environmental Reward. We do not use any externally specified reward signals from the environment: $R _ { e x t } ( t ) = 0$ . ", + "bbox": [ + 171, + 152, + 823, + 181 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Intrinsic Reward. As described in Sec. 3.3, the intrinsic reward of the agent is based upon the map that it constructs as it moves around (as described in Sec. 3.1), and readings from the bump sensor. Reward $R _ { i n t } ( t ) = \\alpha R _ { i n t } ^ { \\mathrm { c o v } } ( t ) + \\beta R _ { i n t } ^ { \\mathrm { c o l l } } ( t )$ . Here $R _ { i n t } ^ { \\mathrm { c o v } }$ is the coverage reward, and $R _ { i n t } ^ { \\mathrm { c o l l } }$ is the collision reward. $\\alpha , \\beta$ are hyper-parameters to trade-off how aggressive the agent is. ", + "bbox": [ + 174, + 188, + 823, + 244 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Training. As described in Sec. 3.4, we train policies using imitation of human trajectories and RL. ", + "bbox": [ + 171, + 251, + 818, + 265 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "1. Imitation from Human Exploration Trajectories. We leverage human exploration trajectories collected from AMT workers as they answered questions for the EmbodiedQA task (Das et al., 2018). We ignore the question that was posed to the AMT worker, and train our policy to simply mimic the actions that the humans took. As the humans were trying to answer these questions in previously unseen environments, we assume that these trajectories largely exhibit exploration behavior. We used a total of 693 human trajectories for this imitation. ", + "bbox": [ + 176, + 277, + 825, + 361 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "2. Reinforcement Learning: After learning via imitation, we further train the policy using reinforcement learning on the training houses. We use PPO (Schulman et al., 2017) to optimize the intrinsic reward defined above. At the start of each episode, the agent is initialized at a random location inside one of the training houses. Each episode is run for 500 time-steps. We run a total of 6400 episodes which amounts to a total of 3.2M steps of experience. ", + "bbox": [ + 174, + 367, + 823, + 436 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Baselines. We next describe the various baseline methods that we experimented with. We implemented a classical baseline that purely reasons using geometry, and a learning baseline that uses curiosity for exploration. ", + "bbox": [ + 173, + 449, + 825, + 491 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "1. Frontier-based Exploration. As a classical baseline, we experimented with frontier-based exploration (Yamauchi, 1997; Dornhege & Kleiner, 2013). This is a purely geometric method that utilizes the built map $M _ { t }$ . Every iteration, it samples a point in currently unexplored space, and plans a path towards it from the current location (unobserved space is assumed to be free). As the plan is executed, both the map and the plan are updated. Once the chosen point is reached, this process is repeated. ", + "bbox": [ + 174, + 503, + 825, + 588 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "2. Curiosity-based Exploration. The next baseline we tried was curiosity-based exploration. In particular, we use the version proposed by Pathak et al. (2017) that uses prediction error of a forward model as reward. We use the modifications proposed by Burda et al. (2019), and only train a forward model. We prevent degeneracy in forward model by learning it in the fixed feature space of a ResNet-18 model that has been pre-trained on the ImageNet classification task. ", + "bbox": [ + 174, + 593, + 825, + 662 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.2 COVERAGE QUALITY ", + "text_level": 1, + "bbox": [ + 174, + 681, + 361, + 695 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We first measure exploration by itself, by measuring the true coverage of the agent. We compute the true coverage using the map as described in Sec. 3.1, except for using the true location of the agent rather than the estimated location (i.e. $x _ { t }$ instead of $\\hat { x } _ { t }$ ). We study the following three scenarios: ", + "bbox": [ + 174, + 708, + 825, + 750 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Without Estimation Noise: We first evaluate the performance of the agent that is trained and tested without observation noise, that is, $\\hat { x } _ { t } = x _ { t }$ . Note that this setting is not very realistic as there is always observation error in an agent’s estimate of its location. It is also highly favorable to the frontier-based exploration agent, which very heavily relies on the accuracy of its maps. Fig. 2(left) presents the performance of different policies for this scenario. We first note that the curiosity based agent $\\mathbf { \\left( I L + R L \\right. }$ with Curiosity) explores better than a random exploration policy (that executes a random action at each time step). Straight is a baseline where the agent moves along a straight line and executes a random number of $9 ^ { \\circ }$ turns when a collision occurs, which is a strategy used by many robot vacuums. Such strategy does not require RGB or depth information, and performs better than the curiosity based agent. However, both policies are worse than an RGB only version of our method, an RGB only policy that is trained with our coverage reward $( \\mathbf { I L } + \\mathbf { R L }$ with RGB). Our full system $\\mathbf { I L } + \\mathbf { R L }$ with $\\mathbf { M a p } + \\mathbf { R G B } $ ) that also uses maps as input performs even better. ", + "bbox": [ + 174, + 757, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/28a1a6c04d78fda6672505548de839f6b5a1f9213538ced1e8dbab28252252c8.jpg", + "image_caption": [ + "Figure 2: Coverage Performance. Policies are tested on 100 exploration runs (5 random start locations each on 20 testing houses). Left figure plots average coverage as a function of number of time steps in the episode. Center figure studies impact of noise in state estimation. We plot average coverage at end of episode as a function of amount of noise. Right figure studies the case when there is a mis-match between geometry and affordance, and plots average coverage as a function of time steps in episode. All plots report mean performance over 3 runs, and the shaded area represents the minimum and maximum performance. " + ], + "image_footnote": [], + "bbox": [ + 205, + 64, + 795, + 214 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Frontier-based exploration (Frontier-based Explr) has the best performance in this scenario. As noted, this is to expect as this method gets access to perfect, fully-registered maps, and employs optimal path planning algorithm to move from one place to another. It is also worth noting that, it is hard to use such classical techniques in situations where we only have a RGB images. In contrast, learning allows us to easily arrive at policies that can explore using only RGB images at test time. ", + "bbox": [ + 174, + 323, + 825, + 392 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "With Estimation Noise: We next describe a more realistic scenario that has estimation noise, i.e. $\\hat { x } _ { t + 1 }$ is estimated using a noisy dynamics function. In particular, we add truncated Gaussian noise to the transition function $f$ at each time step. The details of the noise generation is elaborated in Appendix C.4. The noise compounds over time. Even though such a noise model leads to compounding errors over time (as in the case of a real robot), we acknowledge that this simple noise model may not perfectly match noise in the real world. Fig. 2(center) presents the coverage area at the end of episode (1000 time steps) as a function of the amount of noise introduced1. When the system suffers from sensor noise, the performance of the frontier-based exploration method drops rapidly. In contrast, our learning-based agent that wasn’t even trained with any noise continues to performs well. Even at relatively modest noise of $4 \\%$ our learning based method already does better than the frontier-based agent. We additionally note that our agent can even be trained when the intrinsic reward estimation itself suffers from state estimation noise: for instance performance with $10 \\%$ estimation noise (for intrinsic reward computation and map construction) is $9 8 . 9 m ^ { 2 }$ , only a minor degradation from $1 1 7 . 4 m ^ { 2 }$ ( $10 \\%$ estimation noise for map construction at test time only). ", + "bbox": [ + 173, + 400, + 825, + 593 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Geometry and Affordance Mismatch: Next, to emphasize the utility of learning for this task, we experiment with a scenario where we explicitly create a mismatch between geometry and affordance of the environment. We do this by rendering doors, but not using them for collision checking (i.e. the default House 3D environment). This setting helps us investigate if learning based techniques go beyond simple geometric reasoning in any way. Fig. 2(right) presents performance curves. We see that there is a large drop in performance for the frontier-based agent. This is because it is not able to distinguish doors from other obstacles, leading to path planning failures. However, there is a relatively minor drop in performance of our learning-based agent. This is because it can learn about doors (how to identify them in RGB images and the fact that they can be traversed) from human demonstrations and experience during reinforcement learning. ", + "bbox": [ + 173, + 601, + 825, + 739 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2.1 ABLATION STUDY ", + "text_level": 1, + "bbox": [ + 176, + 756, + 354, + 770 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We also conducted ablations of our method to identify what parts of our proposed technique contribute to the performance. We do these ablations in the setting without any estimation noise, and use coverage as the metric. ", + "bbox": [ + 174, + 781, + 825, + 823 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Imitation Learning: We check if pre-training with imitation learning is useful for this task. We test this by comparing to the models that were trained only with RL using the coverage reward. The left two plots in Fig. 3 shows performance of agents with following combinations: RL: policy trained with PPO only, $\\cal { I L }$ : policy trained with imitation learning, Map: policy uses constructed maps as input, $R G B$ : policy uses RGB images as input. In all settings, pre-training with imitation learning helps improve performance, though training with RL improves coverage further. Also, policies trained using RL have a fairly large variance. Imitation learning also helps reduce the variance. ", + "bbox": [ + 176, + 830, + 821, + 872 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/4dc0163dc92fba4085ae5c1fb0ce1899a27b48bc5f66e509491c59059ebadeab.jpg", + "image_caption": [ + "Figure 3: Ablation Study: We report average coverage as a function of time step in episode. As before we plot mean over 3 runs and minimum and maximum performance. Left figure shows that using the RGB image helps improve performance, center figure shows that using the map helps improve performance. We can also see that imitation learning improves coverage and reduces the variance in performance. Right figure shows the comparison between different reward design. We can see that our intrinsic reward enables the agent to explore more efficiently in the testing time. " + ], + "image_footnote": [], + "bbox": [ + 199, + 64, + 792, + 178 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 266, + 825, + 321 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "RGB Observations and Map: Fig. 3 (left) and Fig. 3 (center) respectively show that both RGB images and map inputs improve performance. ", + "bbox": [ + 173, + 329, + 821, + 358 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Intrinsic Reward: We also compare our intrinsic reward design with extrinsic reward design, as shown in Fig. 3 (right). The extrinsic reward is setup as follows: we randomly generated a number of locations evenly distributed across the traversable area of the houses, where the agent will get a positive reward if the agent is close to any of these locations. Once the agent gets a reward from a location, this location will be no longer taken into account for future reward calculation. We tried two settings where we place 1 or 4 reward-yielding objects per $m ^ { 2 }$ . We can see that our coverage map reward provides a better reward signal and in fact can be estimated intrinsically without needing to instrument the environment. ", + "bbox": [ + 173, + 364, + 825, + 476 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.3 USING EXPLORATION FOR DOWNSTREAM TASK ", + "text_level": 1, + "bbox": [ + 174, + 494, + 547, + 507 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Now that we have established how to explore well, we next ask if task-agnostic exploration is even useful for downstream tasks. We show this in context of goal-driven navigation. We execute the learned exploration policy $\\pi _ { e }$ (for 1500 time steps) to explore a new house, and collect experience (set of images $\\mathcal { T }$ along with their pose p). Once this exploration has finished, the agent is given different navigation tasks. These navigation tasks put the agent at an arbitrary location in the environment, and give it a goal image that it needs to reach. More specifically, we reset the agent to 50 random poses (positions and orientations) in each testing house (20 testing houses in total) and get the RGB camera view. The agent then needs to use the experience of the environment acquired during exploration to efficiently navigate to the desired target location. The efficiency of navigation on these test queries measures the utility of exploration. ", + "bbox": [ + 174, + 520, + 588, + 728 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "This evaluation requires a navigation policy $\\pi _ { n }$ , that uses the exploration experience and the goal image to output actions that can convey the agent to the desired target location. We opt for a simple policy $\\pi _ { n }$ . $\\pi _ { n }$ first localizes the target image using nearest neighbor matching to the set of collected images $\\mathcal { T }$ (in ImageNet pre-trained ResNet-18 feature space). It then plans a path to the this estimated target location using a occupancy map computed from $\\mathcal { T }$ . We do this experiment in the setting without any state estimation noise. ", + "bbox": [ + 176, + 736, + 588, + 861 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/bc6d99dfdb5f9d8c8baf8104bc2b5634505fe1a806a2827d6ddbce1eb70dcaef.jpg", + "image_caption": [ + "Figure 4: Exploration for downstream tasks. We evaluate utility of exploration for the down-stream navigation tasks. Top plots shows effectiveness of the exploration trajectory for localization of goal images in a new environment. Bottom table compares efficiency of reaching goals without and with maps built during exploration. " + ], + "image_footnote": [], + "bbox": [ + 598, + 531, + 818, + 699 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We independently measure the effectiveness of exploration data for a) localization of the given target images, and b) path planning efficiency in reaching desired locations. Localization performance: We measure the distance between the agent’s estimate of the goal image location, and the true goal image location. Fig. 4 (top) plots the success at localization as a function of the success threshold (distance at which we consider a localization as correct). We report top-1 and top-5 success rates. We compare to the random exploration baseline and curiosity-driven baseline which serve to measure the hardness of the task. We see our exploration scheme performs well. Path planning efficiency: Next, we measure how efficiently desired goal locations can be reached. We measure performance using the SPL metric as described by Anderson et al. (2018) (described in the appendix, higher is better). We compare against a baseline that does not have any prior experience in this environment and derives all map information on the fly from goal driven behavior (going to the desired test location). Both agents take actions based on the shortest-path motion planning algorithm. Once again these serve as a measure of the hardness of the topology of the underlying environment. As shown in Fig. 4 (bottom), using exploration data from our policy improves efficiency of paths to reach target locations. ", + "bbox": [ + 176, + 867, + 825, + 924 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 256 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 DISCUSSION ", + "text_level": 1, + "bbox": [ + 174, + 276, + 310, + 292 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this paper, we motivated the need for learning explorations policies for navigation in novel 3D environments. We showed how to design and train such policies, and how experience gathered from such policies enables better performance for downstream tasks. We think we have just scratched the surface of this problem, and hope this inspires future research towards semantic exploration using more expressive policy architectures, reward functions and training techniques. ", + "bbox": [ + 174, + 309, + 825, + 378 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 176, + 400, + 285, + 415 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Robert G Abbott. Behavioral cloning for simulator validation. In Robot Soccer World Cup, pp. 329–336. Springer, 2007. 14 ", + "bbox": [ + 173, + 422, + 823, + 452 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Peter Anderson, Angel Chang, Devendra Singh Chaplot, Alexey Dosovitskiy, Saurabh Gupta, Vladlen Koltun, Jana Kosecka, Jitendra Malik, Roozbeh Mottaghi, Manolis Savva, and Amir Zamir. On evaluation of embodied navigation agents. arXiv preprint arXiv:1807.06757, 2018. 9, \n12 Brenna D Argall, Sonia Chernova, Manuela Veloso, and Brett Browning. A survey of robot learning from demonstration. Robotics and autonomous systems, 57(5):469–483, 2009. 14 Shi Bai, Jinkun Wang, Fanfei Chen, and Brendan Englot. Information-theoretic exploration with bayesian optimization. In IROS, 2016. 3 Yuri Burda, Harri Edwards, Deepak Pathak, Amos Storkey, Trevor Darrell, and Alexei A Efros. Large-scale study of curiosity-driven learning. In ICLR, 2019. 6 Cesar Cadena, Luca Carlone, Henry Carrillo, Yasir Latif, Davide Scaramuzza, Jose Neira, Ian Reid, ´ and John J Leonard. Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age. IEEE Transactions on Robotics, 2016. 2 Henry Carrillo, Ian Reid, and Jose A Castellanos. On the comparison of uncertainty criteria for ´ active slam. In ICRA, 2012. 2 Nuttapong Chentanez, Andrew G Barto, and Satinder P Singh. Intrinsically motivated reinforcement learning. In NIPS, 2005. 3 Abhishek Das, Samyak Datta, Georgia Gkioxari, Stefan Lee, Devi Parikh, and Dhruv Batra. Embodied Question Answering. In CVPR, 2018. 5, 6, 14 Christian Dornhege and Alexander Kleiner. A frontier-void-based approach for autonomous exploration in 3D. Advanced Robotics, 2013. 6 Yan Duan, John Schulman, Xi Chen, Peter L Bartlett, Ilya Sutskever, and Pieter Abbeel. RL2: Fast reinforcement learning via slow reinforcement learning. arXiv preprint arXiv:1611.02779, 2016. \n3 Justin Fu, John Co-Reyes, and Sergey Levine. EX2: Exploration with exemplar models for deep reinforcement learning. In NIPS, 2017. 3 ", + "bbox": [ + 171, + 438, + 826, + 922 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Dhiraj Gandhi, Lerrel Pinto, and Abhinav Gupta. Learning to fly by crashing. In IROS, 2017. 3 ", + "bbox": [ + 169, + 102, + 800, + 119 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Saurabh Gupta, James Davidson, Sergey Levine, Rahul Sukthankar, and Jitendra Malik. Cognitive mapping and planning for visual navigation. In CVPR, 2017. 1, 2, 5 ", + "bbox": [ + 173, + 127, + 823, + 159 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Richard Hartley and Andrew Zisserman. Multiple view geometry in computer vision. Cambridge university press, 2003. 1, 2, 13 ", + "bbox": [ + 174, + 166, + 823, + 196 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Joao F Henriques and Andrea Vedaldi. MapNet: An allocentric spatial memory for mapping environments. In CVPR, 2018. 5 ", + "bbox": [ + 176, + 205, + 823, + 234 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Dinesh Jayaraman and Kristen Grauman. Learning to look around: Intelligently exploring unseen environments for unknown tasks. In CVPR, 2018. 3 ", + "bbox": [ + 174, + 244, + 821, + 273 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Thomas Kollar and Nicholas Roy. Trajectory optimization using reinforcement learning for map exploration. IJRR, 2008. 3 ", + "bbox": [ + 174, + 284, + 821, + 313 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Steven M LaValle. Planning algorithms. Cambridge university press, 2006. 1, 2 ", + "bbox": [ + 173, + 321, + 702, + 338 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Lennart Ljung. System identification: theory for the user. Prentice-hall, 1987. 3 ", + "bbox": [ + 173, + 347, + 700, + 363 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Manuel Lopes, Tobias Lang, Marc Toussaint, and Pierre-Yves Oudeyer. Exploration in model-based reinforcement learning by empirically estimating learning progress. In NIPS, 2012. 3 ", + "bbox": [ + 173, + 372, + 823, + 402 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ruben Martinez-Cantin, Nando de Freitas, Eric Brochu, Jose Castellanos, and Arnaud Doucet. A ´ bayesian exploration-exploitation approach for optimal online sensing and planning with a visually guided mobile robot. Autonomous Robots, 2009. 2 ", + "bbox": [ + 174, + 411, + 823, + 454 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ryszard S Michalski, Ivan Bratko, and Avan Bratko. Machine learning and data mining; methods and applications. John Wiley & Sons, Inc., 1998. 14 ", + "bbox": [ + 171, + 464, + 823, + 493 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Piotr Mirowski, Razvan Pascanu, Fabio Viola, Hubert Soyer, Andy Ballard, Andrea Banino, Misha Denil, Ross Goroshin, Laurent Sifre, Koray Kavukcuoglu, et al. Learning to navigate in complex environments. In ICLR, 2017. 1, 2 ", + "bbox": [ + 176, + 502, + 823, + 546 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Nikhil Mishra, Mostafa Rohaninejad, Xi Chen, and Pieter Abbeel. A simple neural attentive metalearner. In ICLR, 2018. 3 ", + "bbox": [ + 171, + 555, + 823, + 585 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Emilio Parisotto and Ruslan Salakhutdinov. Neural map: Structured memory for deep reinforcement learning. In ICLR, 2018. 5 ", + "bbox": [ + 173, + 594, + 823, + 625 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Deepak Pathak, Pulkit Agrawal, Alexei A Efros, and Trevor Darrell. Curiosity-driven exploration by self-supervised prediction. In ICML, 2017. 3, 6 ", + "bbox": [ + 173, + 633, + 821, + 664 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Deepak Pathak, Parsa Mahmoudieh, Guanghao Luo, Pulkit Agrawal, Dian Chen, Yide Shentu, Evan Shelhamer, Jitendra Malik, Alexei A. Efros, and Trevor Darrell. Zero-shot visual imitation. In ICLR, 2018. 2 ", + "bbox": [ + 173, + 671, + 826, + 715 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Fereshteh Sadeghi and Sergey Levine. CAD2RL: Real single-image flight without a single real image. In RSS, 2017. 3 ", + "bbox": [ + 171, + 724, + 825, + 755 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Nikolay Savinov, Alexey Dosovitskiy, and Vladlen Koltun. Semi-parametric topological memory for navigation. In ICLR, 2018. 1, 2 ", + "bbox": [ + 169, + 765, + 823, + 794 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jurgen Schmidhuber. A possibility for implementing curiosity and boredom in model-building neu- ¨ ral controllers. In International Conference on Simulation of Adaptive Behavior: From Animals to Animats, 1991. 3 ", + "bbox": [ + 174, + 803, + 823, + 845 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347, 2017. 5, 6 ", + "bbox": [ + 173, + 856, + 823, + 886 + ], + "page_idx": 9 + }, + { + "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. In CVPR, 2017. 5 ", + "bbox": [ + 176, + 895, + 821, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Bradly C Stadie, Sergey Levine, and Pieter Abbeel. Incentivizing exploration in reinforcement learning with deep predictive models. arXiv preprint arXiv:1507.00814, 2015. 3 ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Sebastian Thrun, Maren Bennewitz, Wolfram Burgard, Armin B Cremers, Frank Dellaert, Dieter Fox, Dirk Hahnel, Charles Rosenberg, Nicholas Roy, Jamieson Schulte, et al. MINERVA: A second-generation museum tour-guide robot. In ICRA, 1999. 1 ", + "bbox": [ + 178, + 141, + 821, + 184 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Sebastian Thrun, Wolfram Burgard, and Dieter Fox. Probabilistic robotics. MIT press, 2005. 1, 2 ", + "bbox": [ + 174, + 193, + 816, + 208 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning, 1992. 5 ", + "bbox": [ + 173, + 217, + 823, + 246 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yi Wu, Yuxin Wu, Georgia Gkioxari, and Yuandong Tian. Building generalizable agents with a realistic and rich 3d environment. arXiv preprint arXiv:1801.02209, 2018. 5, 13 ", + "bbox": [ + 173, + 253, + 823, + 284 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Kai Xu, Lintao Zheng, Zihao Yan, Guohang Yan, Eugene Zhang, Matthias Niessner, Oliver Deussen, Daniel Cohen-Or, and Hui Huang. Autonomous reconstruction of unknown indoor scenes guided by time-varying tensor fields. In SIGGRAPH Asia, 2017. 3 ", + "bbox": [ + 176, + 291, + 823, + 335 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Brian Yamauchi. A frontier-based approach for autonomous exploration. In Computational Intelligence in Robotics and Automation (CIRA), 1997. 1, 6 ", + "bbox": [ + 171, + 343, + 823, + 372 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Wenhao Yu, Jie Tan, C Karen Liu, and Greg Turk. Preparing for the unknown: Learning a universal policy with online system identification. In RSS, 2017. 3 ", + "bbox": [ + 169, + 381, + 823, + 410 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jingwei Zhang, Lei Tai, Joschka Boedecker, Wolfram Burgard, and Ming Liu. Neural slam: Learning to explore with external memory. arXiv preprint, 2017. URL http://arxiv.org/abs/1706.09520. 3 ", + "bbox": [ + 174, + 419, + 821, + 460 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yuke Zhu, Roozbeh Mottaghi, Eric Kolve, Joseph J Lim, Abhinav Gupta, Li Fei-Fei, and Ali Farhadi. Target-driven visual navigation in indoor scenes using deep reinforcement learning. In ICRA, 2017. 1, 2 ", + "bbox": [ + 174, + 470, + 825, + 513 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "APPENDIX A SPL METRIC ", + "text_level": 1, + "bbox": [ + 176, + 102, + 413, + 118 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "As defined by Anderson et al. (2018), Success weighted by (normalized inverse) Path Length or SPL is computed as follows. Here, $\\ell _ { i }$ is the shortest-path distance between the starting and goal position, $p _ { i }$ is the length of the path actually executed by the agent, and $S _ { i }$ is a binary variable that indicates if the agent succeeded. SPL is computed over $N$ trials as follows: ", + "bbox": [ + 173, + 135, + 825, + 190 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/c67dd8960c61c4c3be6c0a53ef5aa00b9d499abd497614c8cf40724a47694f7b.jpg", + "text": "$$\nS P L = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } S _ { i } \\frac { \\ell _ { i } } { \\operatorname* { m a x } ( p _ { i } , \\ell _ { i } ) } .\n$$", + "text_format": "latex", + "bbox": [ + 393, + 199, + 602, + 243 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "APPENDIX B EXAMPLES OF POLICY INPUTS AND MAPS ", + "text_level": 1, + "bbox": [ + 176, + 260, + 655, + 277 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We show an example of the policy inputs (RGB image and maps in two different scales) at time $t$ and $t + 1 0$ in Fig. B.1. Green area means the known(seen) traversable area, blue area means known non-traversable area, and the white area means unknown area. Fig. B.2 shows how the map evolves and the agent moves as it explores a new house. ", + "bbox": [ + 174, + 292, + 825, + 349 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/fcdc4d42458a52a98f01afaf12535efd9e16eb11677ced891f5f275f3d3f10b6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 227, + 352, + 774, + 667 + ], + "page_idx": 11 + }, + { + "type": "image", + "img_path": "images/0db49537d45b51474ca20063e92cc26cb745626da254b893980ac177bcae917f.jpg", + "image_caption": [ + "Figure B.1: Examples of policy inputs at time step $t$ and $t + 1 0$ . (a) and (d) are the RGB images, (b) and (e) are the coarse maps, and (c) and (f) are the fine maps. ", + "Figure B.2: Snapshots of the built map as the agent explores the house " + ], + "image_footnote": [], + "bbox": [ + 186, + 700, + 812, + 902 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "APPENDIX C EXPERIMENTAL DETAILS ", + "text_level": 1, + "bbox": [ + 176, + 102, + 514, + 118 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "C.1 ENVIRONMENT DETAILS ", + "text_level": 1, + "bbox": [ + 174, + 133, + 388, + 147 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In this paper, we simulated the agent in House3D environment Wu et al. (2018) and used 20 houses for training and 20 new houses for testing. Fig. C.1 shows the distribution of the total traversable area of these houses. Fig. C.2 shows some examples of the top-down views for training and testing houses (white is traversable, black is occupied). ", + "bbox": [ + 174, + 159, + 825, + 214 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/b560d434f3321dbe20fdd4229d761a54fddc9afae255d0b9360287666d7711c6.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 370, + 218, + 622, + 362 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/3528259f82349e65d518beeff522e87ce7c1925368c19dc77c8d35c0d26f92ae.jpg", + "image_caption": [ + "Figure C.1: Area distribution of training and testing houses (20 houses in each case). The average movable area of the training houses is $2 8 9 . 7 \\mathrm { m } ^ { 2 }$ . The average movable area of the testing houses is $\\mathrm { 3 2 7 . 9 ~ m ^ { \\mathrm { 2 } } }$ . ", + "Figure C.2: Examples of house layouts (top-down views). The left three figures show 3 examples of the training houses. The right three figures show 3 examples of the testing houses. White regions indicate traversable area, black regions represent occupied area. " + ], + "image_footnote": [], + "bbox": [ + 184, + 398, + 812, + 489 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "C.2 MAP RECONSTRUCTION ", + "text_level": 1, + "bbox": [ + 174, + 553, + 385, + 568 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Given a sequence of camera poses (extrinsics) $( [ R _ { 1 } , t _ { 1 } ] , [ R _ { 2 } , t _ { 2 } ] , . . . , [ R _ { N } , t _ { N } ] )$ , and the corresponding depth images $( D _ { 1 } , D _ { 2 } , . . . , D _ { N } )$ at each time step as well as the camera intrinsics $\\pmb { K } \\in \\mathbb { R } ^ { 3 \\times 3 }$ , we can reconstruct the point cloud of the scene based on the principle of mulitple-view geometry (Hartley & Zisserman, 2003). We can convert the points from pixel space to the camera space and then to the world space. More specifically, the formulas to achieve this can be summarized as follows: ", + "bbox": [ + 176, + 578, + 823, + 648 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/02867036a31307abff4f8537cd5d33bb5d6e45bace2b311592896c490d9aa5ab.jpg", + "text": "$$\n\\begin{array} { c } { { \\lambda _ { i j } { \\pmb x } _ { i j } = K \\left[ { \\pmb R } _ { i } , { \\pmb t } _ { i } \\right] { \\pmb w } _ { i j } \\quad \\forall j \\in \\{ 1 , 2 , . . . , S \\} , i \\in \\{ 1 , . . . , N \\} } } \\\\ { { N \\mathrm { ~ } _ { i } \\mathrm { ~ } _ { j } } } \\\\ { { \\pmb W } = \\displaystyle \\bigcup _ { i = 1 } ^ { N } \\displaystyle \\bigcup _ { j = 1 } ^ { S } { \\pmb w } _ { i j } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 300, + 654, + 697, + 720 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "where $S$ is the total number of pixels in each depth image, $\\pmb { x } _ { i j } \\in \\mathbb { R } ^ { 3 }$ is the homogeneous coordinates for $j _ { \\mathrm { t h } }$ pixel on $i _ { \\mathrm { t h } }$ depth image $D _ { i }$ , $\\lambda _ { i j } \\in \\mathbb { R }$ is the depth value of the $j _ { \\mathrm { t h } }$ pixel on $i _ { \\mathrm { t h } }$ depth image $D _ { i }$ , and $\\ b w _ { i j } \\in \\mathbb { R } ^ { 4 }$ is the homogeneous coordinates for the corresponding point in the world coordinate system. We can get ${ \\pmb w } _ { i j }$ from $\\mathbf { \\boldsymbol { x } } _ { i j }$ based on Equation (2). And we can merge points via Equation (3). ", + "bbox": [ + 173, + 726, + 825, + 785 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "C.3 TRAINING DETAILS ", + "text_level": 1, + "bbox": [ + 174, + 800, + 354, + 814 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The occupancy map generated by the agent itself uses a resolution of $0 . 0 5 \\mathrm { m }$ . Our policy uses a coarse map, and a detailed map. The coarse map captures information about a $4 0 \\mathrm { m } \\times 4 0 \\mathrm { m }$ area around the agent, at a resolution of of $0 . 5 m$ . The occupancy map is down-sampled from $8 0 0 \\times 8 0 0$ to $8 0 \\times 8 0$ to generate the coarse map that is fed into the policy network. The detailed map captures information about a $4 \\mathrm { m } \\times 4 \\mathrm { m }$ area around the agent at a $0 . 0 5 m$ resolution. RGB images are rendered at $2 2 4 \\times 2 2 4$ resolution in House3D and re-sized into $8 0 \\times 8 0$ before they are fed into the policy network. ", + "bbox": [ + 173, + 825, + 825, + 924 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The size of the last fully-connected layer in ResNet18 architecture is modified to 128. Outputs of the three ResNet18 networks are concatenated into a 384-dimensional vector. This is transformed into a 128-dimensional vector via a fully-connected layer. Next, it’s fed into a single-layer RNN(GRU) layer with 128 hidden layer size. The output of RNN layer is followed by two heads. One head (the policy head) has two fully-connected layers $( 1 2 8 - 3 2 - 6 )$ . The other head (the value head) has two fully-connected layers $( 1 2 8 - 3 2 - 1 )$ . We use ELU as the nonlinear activation function for the fully-connected layers after ResNet18. ", + "bbox": [ + 174, + 103, + 825, + 200 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Each episode consists of 500 steps in training. RNN time sequence length is 20. Coverage area $C ( M _ { t } )$ is measured by the number of covered grids in the occupancy map. Coefficient $\\alpha$ for the coverage reward $R _ { i n t } ^ { \\mathrm { c o v } } ( t )$ is 0.0005, coefficient $\\beta$ for $R _ { i n t } ^ { \\mathrm { c o l l } } ( t )$ is 0.006. PPO entropy loss coefficient is 0.01. Network is optimized via Adam optimizer with a learning rate of 0.00001. ", + "bbox": [ + 174, + 208, + 825, + 263 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C.4 NOISE MODEL ", + "text_level": 1, + "bbox": [ + 174, + 281, + 318, + 295 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Details of noise generation for experiments with estimation noise in Section 4.2: ", + "bbox": [ + 176, + 308, + 699, + 321 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "1. Without loss of generality, we initialize the agent at the origin, that is ${ \\hat { x } } _ { 0 } = x _ { 0 } = \\mathbf { 0 }$ . \n2. The agent takes an action $a _ { t }$ . We add truncated Gaussian noise to the action primitive(e.g., move forward $0 . 2 5 \\mathrm { m } )$ to get the estimated pose $\\hat { x } _ { t + 1 }$ , i.e., $\\hat { x } _ { t + 1 } = \\hat { x } _ { t } + \\tilde { a } _ { t }$ where $\\hat { x } _ { t }$ is the estimated pose in time step t and $\\tilde { a } _ { t }$ is the action primitive $a _ { t }$ with added noise. \n3. Iterate the second step until the maximum number of steps is reached. ", + "bbox": [ + 174, + 333, + 826, + 414 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Thus, in this noise model, the agent estimates its new pose based on the estimated pose from the last time step and the executed action. Thus, we dont use oracle odometry in the noise experiments. This noise model leads to compounding errors over time (as in the case of a real robot), though we acknowledge that this simple noise model may not perfectly match noise in the real world. ", + "bbox": [ + 174, + 425, + 825, + 481 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C.5 IMITATION LEARNING DETAILS ", + "text_level": 1, + "bbox": [ + 176, + 498, + 436, + 512 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We use behavioral cloning technique (Argall et al., 2009; Michalski et al., 1998; Abbott, 2007) to imitate the human behaviors in exploring the environments. We got the human demonstration trajectories from (Das et al., 2018). We ignored the question-answering part of the data and only used the exploration trajectories. We cleaned up the data by removing the trajectories that have less than 100 time steps. The trajectories are then converted into short sequences of trajectory segments $( \\left( { { s _ { i } } , { a _ { i } } , { s _ { i + 1 } } , { a _ { i + 1 } } , . . . , { s _ { i + T } } , { a _ { i + T } } } \\right)$ , where $T$ is based on the RNN sequence length). The policy is pretrained with behavioral cloning by imitating actions $( a _ { i } , a _ { i + 1 } , . . . , a _ { i + T } )$ from the human demonstrations given the states $( s _ { i } , s _ { i + 1 } , . . . , s _ { i + T } )$ . ", + "bbox": [ + 174, + 523, + 825, + 637 + ], + "page_idx": 13 + } +] \ No newline at end of file diff --git a/parse/train/SyMWn05F7/SyMWn05F7_middle.json b/parse/train/SyMWn05F7/SyMWn05F7_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..2f0bcd6ee091a7db3e9559b0b976955b1b152556 --- /dev/null +++ b/parse/train/SyMWn05F7/SyMWn05F7_middle.json @@ -0,0 +1,37700 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 105, + 78, + 502, + 96 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 506, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 506, + 98 + ], + "score": 1.0, + "content": "LEARNING EXPLORATION POLICIES FOR NAVIGATION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 112, + 114, + 336, + 149 + ], + "lines": [ + { + "bbox": [ + 112, + 114, + 337, + 127 + ], + "spans": [ + { + "bbox": [ + 112, + 114, + 246, + 127 + ], + "score": 1.0, + "content": "Tao Chen1 Saurabh Gupta2", + "type": "text" + }, + { + "bbox": [ + 257, + 114, + 337, + 127 + ], + "score": 1.0, + "content": "Abhinav Gupta1,2", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 111, + 124, + 231, + 140 + ], + "spans": [ + { + "bbox": [ + 111, + 124, + 231, + 140 + ], + "score": 1.0, + "content": "1Carnegie Mellon University", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 112, + 137, + 210, + 150 + ], + "spans": [ + { + "bbox": [ + 112, + 137, + 210, + 150 + ], + "score": 1.0, + "content": "2Facebook AI Research", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "title", + "bbox": [ + 278, + 178, + 333, + 190 + ], + "lines": [ + { + "bbox": [ + 277, + 177, + 335, + 191 + ], + "spans": [ + { + "bbox": [ + 277, + 177, + 335, + 191 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 203, + 468, + 345 + ], + "lines": [ + { + "bbox": [ + 141, + 202, + 469, + 216 + ], + "spans": [ + { + "bbox": [ + 141, + 202, + 469, + 216 + ], + "score": 1.0, + "content": "Numerous past works have tackled the problem of task-driven navigation. But,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 213, + 469, + 227 + ], + "spans": [ + { + "bbox": [ + 141, + 213, + 469, + 227 + ], + "score": 1.0, + "content": "how to effectively explore a new environment to enable a variety of down-stream", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 225, + 469, + 237 + ], + "spans": [ + { + "bbox": [ + 141, + 225, + 469, + 237 + ], + "score": 1.0, + "content": "tasks has received much less attention. In this work, we study how agents can", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 142, + 236, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 142, + 236, + 470, + 248 + ], + "score": 1.0, + "content": "autonomously explore realistic and complex 3D environments without the context", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 247, + 470, + 259 + ], + "spans": [ + { + "bbox": [ + 141, + 247, + 470, + 259 + ], + "score": 1.0, + "content": "of task-rewards. We propose a learning-based approach and investigate different", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 258, + 470, + 270 + ], + "spans": [ + { + "bbox": [ + 141, + 258, + 470, + 270 + ], + "score": 1.0, + "content": "policy architectures, reward functions, and training paradigms. We find that use", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 269, + 470, + 281 + ], + "spans": [ + { + "bbox": [ + 141, + 269, + 470, + 281 + ], + "score": 1.0, + "content": "of policies with spatial memory that are bootstrapped with imitation learning and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 279, + 470, + 293 + ], + "spans": [ + { + "bbox": [ + 141, + 279, + 470, + 293 + ], + "score": 1.0, + "content": "finally finetuned with coverage rewards derived purely from on-board sensors can", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 290, + 469, + 303 + ], + "spans": [ + { + "bbox": [ + 141, + 290, + 469, + 303 + ], + "score": 1.0, + "content": "be effective at exploring novel environments. We show that our learned explo-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 301, + 469, + 314 + ], + "spans": [ + { + "bbox": [ + 141, + 301, + 469, + 314 + ], + "score": 1.0, + "content": "ration policies can explore better than classical approaches based on geometry", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 313, + 469, + 325 + ], + "spans": [ + { + "bbox": [ + 142, + 313, + 469, + 325 + ], + "score": 1.0, + "content": "alone and generic learning-based exploration techniques. Finally, we also show", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 323, + 469, + 335 + ], + "spans": [ + { + "bbox": [ + 141, + 323, + 469, + 335 + ], + "score": 1.0, + "content": "how such task-agnostic exploration can be used for down-stream tasks. Videos", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 334, + 413, + 346 + ], + "spans": [ + { + "bbox": [ + 141, + 334, + 413, + 346 + ], + "score": 1.0, + "content": "are available at: https://sites.google.com/view/exploration-for-nav/.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 108, + 366, + 206, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 365, + 208, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 208, + 381 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 390, + 505, + 457 + ], + "lines": [ + { + "bbox": [ + 106, + 391, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 391, + 505, + 403 + ], + "score": 1.0, + "content": "Imagine your first day at a new workplace. If you are like most people, the first task you set for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 401, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 415 + ], + "score": 1.0, + "content": "yourself is to become familiar with the office so that the next day when you have to attend meetings", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "and perform tasks, you can navigate efficiently and seamlessly. To achieve that goal, you explore", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 424, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 505, + 436 + ], + "score": 1.0, + "content": "your office without the task context of target locations you have to reach and build a generic un-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "derstanding of space. This step of task-independent exploration is quite critical yet often ignored in", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 446, + 245, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 245, + 458 + ], + "score": 1.0, + "content": "current approaches for navigation.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 463, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 106, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "When it comes to navigation, currently there are two paradigms: (a) geometric reconstruction and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 473, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 485 + ], + "score": 1.0, + "content": "path-planning based approaches (Hartley & Zisserman, 2003; Thrun et al., 2005; LaValle, 2006), and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 484, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 506, + 497 + ], + "score": 1.0, + "content": "(b) learning-based approaches (Mirowski et al., 2017; Gupta et al., 2017; Savinov et al., 2018; Zhu", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 493, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 104, + 493, + 506, + 509 + ], + "score": 1.0, + "content": "et al., 2017). SLAM-based approaches, first build a map and then use localization and path planning", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 506, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 506, + 518 + ], + "score": 1.0, + "content": "for navigation. In doing this, one interesting question that is often overlooked is: How does one build", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 517, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 506, + 530 + ], + "score": 1.0, + "content": "a map? How should we explore the environment to build this map? Current approaches either use a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "human operator to control the robot for building the map (e.g. Thrun et al. (1999)), or use heuristics", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 538, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 552 + ], + "score": 1.0, + "content": "such as frontier-based exploration (Yamauchi, 1997). On the other hand for approaches that use", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "learning, most only learn policies for specific tasks (Zhu et al., 2017; Mirowski et al., 2017; Gupta", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 560, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 104, + 560, + 506, + 574 + ], + "score": 1.0, + "content": "et al., 2017), or assume environments have already been explored (Savinov et al., 2018). Moreover,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 572, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 583 + ], + "score": 1.0, + "content": "in context of such learning based approaches, the question of exploration is not only important at", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "test time, but also at train time. And once again, this question is largely ignored. Current approaches", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 593, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 505, + 607 + ], + "score": 1.0, + "content": "either use sample inefficient random exploration or make impractical assumptions about full map", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 605, + 365, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 365, + 618 + ], + "score": 1.0, + "content": "availability for generating supervision from optimal trajectories.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "Thus, a big bottleneck for both these navigation paradigms is an exploration policy: a task-agnostic", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "policy that explores the environment to either build a map or sample trajectories for learning a navi-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "gation policy in a sample-efficient manner. But how do we learn this task-independent policy? What", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "should be the reward for such a policy? First possible way is to not use learning and use heuris-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "tic based approaches (Yamauchi, 1997). However, there are four issues with non-learning based", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "approaches: (a) these approaches are brittle and fail when there is noise in ego-estimation or local-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "ization; (b) they make strong assumptions about free-space/collisions and fail to generalize when", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "navigation requires interactions such as opening doors etc.; (c) they fail to capture semantic priors", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "that can reduce search-space significantly; and (d) they heavily rely on specialized sensors such as", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "range scanners. Another possibility is to learn exploration policies on training environments. One", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 43.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 2019", + "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": [ + 105, + 78, + 502, + 96 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 506, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 506, + 98 + ], + "score": 1.0, + "content": "LEARNING EXPLORATION POLICIES FOR NAVIGATION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "list", + "bbox": [ + 112, + 114, + 336, + 149 + ], + "lines": [ + { + "bbox": [ + 112, + 114, + 337, + 127 + ], + "spans": [ + { + "bbox": [ + 112, + 114, + 246, + 127 + ], + "score": 1.0, + "content": "Tao Chen1 Saurabh Gupta2", + "type": "text" + }, + { + "bbox": [ + 257, + 114, + 337, + 127 + ], + "score": 1.0, + "content": "Abhinav Gupta1,2", + "type": "text" + } + ], + "index": 1, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 124, + 231, + 140 + ], + "spans": [ + { + "bbox": [ + 111, + 124, + 231, + 140 + ], + "score": 1.0, + "content": "1Carnegie Mellon University", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 137, + 210, + 150 + ], + "spans": [ + { + "bbox": [ + 112, + 137, + 210, + 150 + ], + "score": 1.0, + "content": "2Facebook AI Research", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + } + ], + "index": 2, + "bbox_fs": [ + 111, + 114, + 337, + 150 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 178, + 333, + 190 + ], + "lines": [ + { + "bbox": [ + 277, + 177, + 335, + 191 + ], + "spans": [ + { + "bbox": [ + 277, + 177, + 335, + 191 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 143, + 203, + 468, + 345 + ], + "lines": [ + { + "bbox": [ + 141, + 202, + 469, + 216 + ], + "spans": [ + { + "bbox": [ + 141, + 202, + 469, + 216 + ], + "score": 1.0, + "content": "Numerous past works have tackled the problem of task-driven navigation. But,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 213, + 469, + 227 + ], + "spans": [ + { + "bbox": [ + 141, + 213, + 469, + 227 + ], + "score": 1.0, + "content": "how to effectively explore a new environment to enable a variety of down-stream", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 225, + 469, + 237 + ], + "spans": [ + { + "bbox": [ + 141, + 225, + 469, + 237 + ], + "score": 1.0, + "content": "tasks has received much less attention. In this work, we study how agents can", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 142, + 236, + 470, + 248 + ], + "spans": [ + { + "bbox": [ + 142, + 236, + 470, + 248 + ], + "score": 1.0, + "content": "autonomously explore realistic and complex 3D environments without the context", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 247, + 470, + 259 + ], + "spans": [ + { + "bbox": [ + 141, + 247, + 470, + 259 + ], + "score": 1.0, + "content": "of task-rewards. We propose a learning-based approach and investigate different", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 258, + 470, + 270 + ], + "spans": [ + { + "bbox": [ + 141, + 258, + 470, + 270 + ], + "score": 1.0, + "content": "policy architectures, reward functions, and training paradigms. We find that use", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 269, + 470, + 281 + ], + "spans": [ + { + "bbox": [ + 141, + 269, + 470, + 281 + ], + "score": 1.0, + "content": "of policies with spatial memory that are bootstrapped with imitation learning and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 279, + 470, + 293 + ], + "spans": [ + { + "bbox": [ + 141, + 279, + 470, + 293 + ], + "score": 1.0, + "content": "finally finetuned with coverage rewards derived purely from on-board sensors can", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 290, + 469, + 303 + ], + "spans": [ + { + "bbox": [ + 141, + 290, + 469, + 303 + ], + "score": 1.0, + "content": "be effective at exploring novel environments. We show that our learned explo-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 301, + 469, + 314 + ], + "spans": [ + { + "bbox": [ + 141, + 301, + 469, + 314 + ], + "score": 1.0, + "content": "ration policies can explore better than classical approaches based on geometry", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 313, + 469, + 325 + ], + "spans": [ + { + "bbox": [ + 142, + 313, + 469, + 325 + ], + "score": 1.0, + "content": "alone and generic learning-based exploration techniques. Finally, we also show", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 323, + 469, + 335 + ], + "spans": [ + { + "bbox": [ + 141, + 323, + 469, + 335 + ], + "score": 1.0, + "content": "how such task-agnostic exploration can be used for down-stream tasks. Videos", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 334, + 413, + 346 + ], + "spans": [ + { + "bbox": [ + 141, + 334, + 413, + 346 + ], + "score": 1.0, + "content": "are available at: https://sites.google.com/view/exploration-for-nav/.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 11, + "bbox_fs": [ + 141, + 202, + 470, + 346 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 366, + 206, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 365, + 208, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 208, + 381 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 390, + 505, + 457 + ], + "lines": [ + { + "bbox": [ + 106, + 391, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 391, + 505, + 403 + ], + "score": 1.0, + "content": "Imagine your first day at a new workplace. If you are like most people, the first task you set for", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 401, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 415 + ], + "score": 1.0, + "content": "yourself is to become familiar with the office so that the next day when you have to attend meetings", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "and perform tasks, you can navigate efficiently and seamlessly. To achieve that goal, you explore", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 424, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 505, + 436 + ], + "score": 1.0, + "content": "your office without the task context of target locations you have to reach and build a generic un-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "derstanding of space. This step of task-independent exploration is quite critical yet often ignored in", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 446, + 245, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 245, + 458 + ], + "score": 1.0, + "content": "current approaches for navigation.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 391, + 505, + 458 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 463, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 106, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "When it comes to navigation, currently there are two paradigms: (a) geometric reconstruction and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 473, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 485 + ], + "score": 1.0, + "content": "path-planning based approaches (Hartley & Zisserman, 2003; Thrun et al., 2005; LaValle, 2006), and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 484, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 506, + 497 + ], + "score": 1.0, + "content": "(b) learning-based approaches (Mirowski et al., 2017; Gupta et al., 2017; Savinov et al., 2018; Zhu", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 493, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 104, + 493, + 506, + 509 + ], + "score": 1.0, + "content": "et al., 2017). SLAM-based approaches, first build a map and then use localization and path planning", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 506, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 506, + 518 + ], + "score": 1.0, + "content": "for navigation. In doing this, one interesting question that is often overlooked is: How does one build", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 517, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 506, + 530 + ], + "score": 1.0, + "content": "a map? How should we explore the environment to build this map? Current approaches either use a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "human operator to control the robot for building the map (e.g. Thrun et al. (1999)), or use heuristics", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 538, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 505, + 552 + ], + "score": 1.0, + "content": "such as frontier-based exploration (Yamauchi, 1997). On the other hand for approaches that use", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "learning, most only learn policies for specific tasks (Zhu et al., 2017; Mirowski et al., 2017; Gupta", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 560, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 104, + 560, + 506, + 574 + ], + "score": 1.0, + "content": "et al., 2017), or assume environments have already been explored (Savinov et al., 2018). Moreover,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 572, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 583 + ], + "score": 1.0, + "content": "in context of such learning based approaches, the question of exploration is not only important at", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "test time, but also at train time. And once again, this question is largely ignored. Current approaches", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 593, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 505, + 607 + ], + "score": 1.0, + "content": "either use sample inefficient random exploration or make impractical assumptions about full map", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 605, + 365, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 365, + 618 + ], + "score": 1.0, + "content": "availability for generating supervision from optimal trajectories.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 31.5, + "bbox_fs": [ + 104, + 462, + 506, + 618 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "Thus, a big bottleneck for both these navigation paradigms is an exploration policy: a task-agnostic", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "policy that explores the environment to either build a map or sample trajectories for learning a navi-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "gation policy in a sample-efficient manner. But how do we learn this task-independent policy? What", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 668 + ], + "score": 1.0, + "content": "should be the reward for such a policy? First possible way is to not use learning and use heuris-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "tic based approaches (Yamauchi, 1997). However, there are four issues with non-learning based", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "approaches: (a) these approaches are brittle and fail when there is noise in ego-estimation or local-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "ization; (b) they make strong assumptions about free-space/collisions and fail to generalize when", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "navigation requires interactions such as opening doors etc.; (c) they fail to capture semantic priors", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "that can reduce search-space significantly; and (d) they heavily rely on specialized sensors such as", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "range scanners. Another possibility is to learn exploration policies on training environments. One", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "way is to use reinforcement learning (RL) with intrinsic rewards. Examples of intrinsic rewards can", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "be “curiosity” where prediction error is used as reward signal or “diversity” which discourages the", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "agent from revisiting the same states. While this seems like an effective reward, such approaches are", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 505, + 129 + ], + "score": 1.0, + "content": "still sample inefficient due to blackbox reward functions that can’t be differentiated to compute gra-", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 126, + 501, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 126, + 501, + 139 + ], + "score": 1.0, + "content": "dients effectively. So, what would be an effective way to learn exploration policies for navigation?", + "type": "text", + "cross_page": true + } + ], + "index": 4 + } + ], + "index": 43.5, + "bbox_fs": [ + 105, + 621, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 137 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "way is to use reinforcement learning (RL) with intrinsic rewards. Examples of intrinsic rewards can", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "be “curiosity” where prediction error is used as reward signal or “diversity” which discourages the", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "agent from revisiting the same states. While this seems like an effective reward, such approaches are", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 505, + 129 + ], + "score": 1.0, + "content": "still sample inefficient due to blackbox reward functions that can’t be differentiated to compute gra-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 126, + 501, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 126, + 501, + 139 + ], + "score": 1.0, + "content": "dients effectively. So, what would be an effective way to learn exploration policies for navigation?", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 143, + 505, + 264 + ], + "lines": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "In this paper, we propose an approach for learning policies for exploration for navigation. We ex-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 168 + ], + "score": 1.0, + "content": "plore this problem from multiple perspectives: (a) architectural design, (b) reward function design,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 164, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 179 + ], + "score": 1.0, + "content": "and (c) reward optimization. Specifically, from perspective of reward function and optimization,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "we take the alternative paradigm and use supervision from human explorations in conjunction with", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "intrinsic rewards. We notice that bootstrapping of learning from small amount of human supervision", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "score": 1.0, + "content": "aids learning of semantics (e.g. doors are pathways). It also provides a good initialization for learn-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "ing using intrinsic rewards. From the perspective of architecture design, we explore how to use 3D", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 219, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 505, + 232 + ], + "score": 1.0, + "content": "information and use it efficiently while doing exploration. We study proxy rewards that characterize", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "coverage and demonstrate how this reward outperforms other rewards such as curiosity. Finally,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 243, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 506, + 255 + ], + "score": 1.0, + "content": "we show how experience gathered from our learned exploration policies improves performance at", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 229, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 229, + 264 + ], + "score": 1.0, + "content": "down-stream navigation tasks.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10 + }, + { + "type": "title", + "bbox": [ + 108, + 285, + 210, + 298 + ], + "lines": [ + { + "bbox": [ + 104, + 284, + 213, + 301 + ], + "spans": [ + { + "bbox": [ + 104, + 284, + 213, + 301 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 314, + 504, + 358 + ], + "lines": [ + { + "bbox": [ + 106, + 314, + 506, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 506, + 326 + ], + "score": 1.0, + "content": "Our work on learning exploration policies for navigation in real world scenes is related to active", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 325, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 505, + 337 + ], + "score": 1.0, + "content": "SLAM in classical robotics, and intrinsic rewards based exploration in reinforcement learning. As", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 336, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 506, + 348 + ], + "score": 1.0, + "content": "we study the problem of navigation, we also draw upon recent efforts that use learning for this", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 347, + 348, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 348, + 360 + ], + "score": 1.0, + "content": "problem. We survey related efforts in these three directions.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 107, + 364, + 505, + 517 + ], + "lines": [ + { + "bbox": [ + 105, + 362, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 505, + 378 + ], + "score": 1.0, + "content": "Navigation in Classical Robotics. Classical approaches to navigation operate by building a map", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 374, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 505, + 388 + ], + "score": 1.0, + "content": "of the environment, localizing the agent in this map, and then planning paths to convey the agent", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 384, + 506, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 506, + 400 + ], + "score": 1.0, + "content": "to desired target locations. Consequently, the problems of mapping, localization and path-planning", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 396, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 505, + 409 + ], + "score": 1.0, + "content": "have been very thoroughly studied (Hartley & Zisserman, 2003; Thrun et al., 2005; LaValle, 2006).", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "score": 1.0, + "content": "However, most of this research starts from a human-operated traversal of the environment, and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 419, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 430 + ], + "score": 1.0, + "content": "falls under the purview of passive SLAM. Active SLAM, or how to automatically traverse a new", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 429, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 505, + 442 + ], + "score": 1.0, + "content": "environment for building spatial representations is much less studied. Cadena et al. (2016) present", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "an excellent review of active SLAM literature, we summarize some key efforts here. Past works have", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 451, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 505, + 464 + ], + "score": 1.0, + "content": "formulated active SLAM as Partially Observable Markov Decision Processes (POMDPs) (Martinez-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "Cantin et al., 2009), or as choosing actions that reduce uncertainty in the estimated map (Carrillo", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 472, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 505, + 486 + ], + "score": 1.0, + "content": "et al., 2012). While these formulations enable theoretical analysis, they crucially rely on sensors", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "score": 1.0, + "content": "to build maps and localize. Thus, such approaches are highly susceptible to measurement noise.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "score": 1.0, + "content": "Additionally, such methods treat exploration purely as a geometry problem, and entirely ignore", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 507, + 285, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 285, + 518 + ], + "score": 1.0, + "content": "semantic cues for exploration such as doors.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 523, + 504, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 504, + 535 + ], + "score": 1.0, + "content": "Learning for Navigation. In order to leverage such semantic cues for navigation, recent works", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "have formulated navigation as a learning problem (Zhu et al., 2017; Gupta et al., 2017; Mirowski", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 544, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 558 + ], + "score": 1.0, + "content": "et al., 2017; Savinov et al., 2018). A number of design choices have been investigated. For example,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 556, + 504, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 504, + 569 + ], + "score": 1.0, + "content": "these works have investigated different policy architectures for representing space: Zhu et al. (2017)", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 567, + 504, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 504, + 579 + ], + "score": 1.0, + "content": "use feed-forward networks, Mirowski et al. (2017) use vanilla neural network memory, Gupta et al.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "(2017) use spatial memory and planning modules, and Savinov et al. (2018) use semi-parametric", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 589, + 504, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 504, + 601 + ], + "score": 1.0, + "content": "topological memory. Different training paradigms have also been explored: Gupta et al. (2017)", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "learn to imitate behavior of an optimal expert, Mirowski et al. (2017) and Zhu et al. (2017) use", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "extrinsic reward based reinforcement learning, Pathak et al. (2018) learn an inverse dynamics model", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "on the demonstrated trajectory way-points from the expert, while Savinov et al. (2018) use self-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "supervision. In our work here, we build on insights from these past works. Our policy architecture", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 644, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 656 + ], + "score": 1.0, + "content": "and reward definition use spatial memory to achieve long-horizon exploration, and we imitate human", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "exploration demonstrations to boot-strap policy learning. However, in crucial distinction, instead", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "of studying goal-directed navigation (either in the form of going to a particular goal location, or", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "object of interest), we study the problem of autonomous exploration of novel environments in a task-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "agnostic manner. In doing so, unlike past works, we do not assume access to human demonstrations", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "in the given novel test environment like Savinov et al. (2018), nor do we assume availability of", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 709, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 721 + ], + "score": 1.0, + "content": "millions of samples of experience or reward signals in the novel test environment like Zhu et al.", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 720, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 732 + ], + "score": 1.0, + "content": "(2017) or Mirowski et al. (2017). Moreover, we do not depend on extrinsically defined reward", + "type": "text" + } + ], + "index": 53 + } + ], + "index": 44 + } + ], + "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 2019", + "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": [ + 107, + 82, + 504, + 137 + ], + "lines": [], + "index": 2, + "bbox_fs": [ + 105, + 82, + 506, + 139 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 143, + 505, + 264 + ], + "lines": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "In this paper, we propose an approach for learning policies for exploration for navigation. We ex-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 168 + ], + "score": 1.0, + "content": "plore this problem from multiple perspectives: (a) architectural design, (b) reward function design,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 164, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 179 + ], + "score": 1.0, + "content": "and (c) reward optimization. Specifically, from perspective of reward function and optimization,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 505, + 189 + ], + "score": 1.0, + "content": "we take the alternative paradigm and use supervision from human explorations in conjunction with", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "intrinsic rewards. We notice that bootstrapping of learning from small amount of human supervision", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 212 + ], + "score": 1.0, + "content": "aids learning of semantics (e.g. doors are pathways). It also provides a good initialization for learn-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "ing using intrinsic rewards. From the perspective of architecture design, we explore how to use 3D", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 219, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 505, + 232 + ], + "score": 1.0, + "content": "information and use it efficiently while doing exploration. We study proxy rewards that characterize", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "coverage and demonstrate how this reward outperforms other rewards such as curiosity. Finally,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 243, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 506, + 255 + ], + "score": 1.0, + "content": "we show how experience gathered from our learned exploration policies improves performance at", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 229, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 229, + 264 + ], + "score": 1.0, + "content": "down-stream navigation tasks.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 144, + 506, + 264 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 285, + 210, + 298 + ], + "lines": [ + { + "bbox": [ + 104, + 284, + 213, + 301 + ], + "spans": [ + { + "bbox": [ + 104, + 284, + 213, + 301 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 314, + 504, + 358 + ], + "lines": [ + { + "bbox": [ + 106, + 314, + 506, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 506, + 326 + ], + "score": 1.0, + "content": "Our work on learning exploration policies for navigation in real world scenes is related to active", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 325, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 505, + 337 + ], + "score": 1.0, + "content": "SLAM in classical robotics, and intrinsic rewards based exploration in reinforcement learning. As", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 336, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 506, + 348 + ], + "score": 1.0, + "content": "we study the problem of navigation, we also draw upon recent efforts that use learning for this", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 347, + 348, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 348, + 360 + ], + "score": 1.0, + "content": "problem. We survey related efforts in these three directions.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 314, + 506, + 360 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 364, + 505, + 517 + ], + "lines": [ + { + "bbox": [ + 105, + 362, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 505, + 378 + ], + "score": 1.0, + "content": "Navigation in Classical Robotics. Classical approaches to navigation operate by building a map", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 374, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 374, + 505, + 388 + ], + "score": 1.0, + "content": "of the environment, localizing the agent in this map, and then planning paths to convey the agent", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 384, + 506, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 506, + 400 + ], + "score": 1.0, + "content": "to desired target locations. Consequently, the problems of mapping, localization and path-planning", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 396, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 505, + 409 + ], + "score": 1.0, + "content": "have been very thoroughly studied (Hartley & Zisserman, 2003; Thrun et al., 2005; LaValle, 2006).", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 505, + 420 + ], + "score": 1.0, + "content": "However, most of this research starts from a human-operated traversal of the environment, and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 419, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 106, + 419, + 505, + 430 + ], + "score": 1.0, + "content": "falls under the purview of passive SLAM. Active SLAM, or how to automatically traverse a new", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 429, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 505, + 442 + ], + "score": 1.0, + "content": "environment for building spatial representations is much less studied. Cadena et al. (2016) present", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "an excellent review of active SLAM literature, we summarize some key efforts here. Past works have", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 451, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 505, + 464 + ], + "score": 1.0, + "content": "formulated active SLAM as Partially Observable Markov Decision Processes (POMDPs) (Martinez-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "Cantin et al., 2009), or as choosing actions that reduce uncertainty in the estimated map (Carrillo", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 472, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 505, + 486 + ], + "score": 1.0, + "content": "et al., 2012). While these formulations enable theoretical analysis, they crucially rely on sensors", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "score": 1.0, + "content": "to build maps and localize. Thus, such approaches are highly susceptible to measurement noise.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 505, + 509 + ], + "score": 1.0, + "content": "Additionally, such methods treat exploration purely as a geometry problem, and entirely ignore", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 507, + 285, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 285, + 518 + ], + "score": 1.0, + "content": "semantic cues for exploration such as doors.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 362, + 506, + 518 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 523, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 523, + 504, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 504, + 535 + ], + "score": 1.0, + "content": "Learning for Navigation. In order to leverage such semantic cues for navigation, recent works", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 534, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 534, + 505, + 546 + ], + "score": 1.0, + "content": "have formulated navigation as a learning problem (Zhu et al., 2017; Gupta et al., 2017; Mirowski", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 544, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 558 + ], + "score": 1.0, + "content": "et al., 2017; Savinov et al., 2018). A number of design choices have been investigated. For example,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 556, + 504, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 504, + 569 + ], + "score": 1.0, + "content": "these works have investigated different policy architectures for representing space: Zhu et al. (2017)", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 567, + 504, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 504, + 579 + ], + "score": 1.0, + "content": "use feed-forward networks, Mirowski et al. (2017) use vanilla neural network memory, Gupta et al.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 106, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "(2017) use spatial memory and planning modules, and Savinov et al. (2018) use semi-parametric", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 589, + 504, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 589, + 504, + 601 + ], + "score": 1.0, + "content": "topological memory. Different training paradigms have also been explored: Gupta et al. (2017)", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "learn to imitate behavior of an optimal expert, Mirowski et al. (2017) and Zhu et al. (2017) use", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "extrinsic reward based reinforcement learning, Pathak et al. (2018) learn an inverse dynamics model", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 621, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 633 + ], + "score": 1.0, + "content": "on the demonstrated trajectory way-points from the expert, while Savinov et al. (2018) use self-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "supervision. In our work here, we build on insights from these past works. Our policy architecture", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 644, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 656 + ], + "score": 1.0, + "content": "and reward definition use spatial memory to achieve long-horizon exploration, and we imitate human", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "exploration demonstrations to boot-strap policy learning. However, in crucial distinction, instead", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "of studying goal-directed navigation (either in the form of going to a particular goal location, or", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "object of interest), we study the problem of autonomous exploration of novel environments in a task-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "agnostic manner. In doing so, unlike past works, we do not assume access to human demonstrations", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 506, + 711 + ], + "score": 1.0, + "content": "in the given novel test environment like Savinov et al. (2018), nor do we assume availability of", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 709, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 721 + ], + "score": 1.0, + "content": "millions of samples of experience or reward signals in the novel test environment like Zhu et al.", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 720, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 505, + 732 + ], + "score": 1.0, + "content": "(2017) or Mirowski et al. (2017). Moreover, we do not depend on extrinsically defined reward", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "score": 1.0, + "content": "signals for training. We derive them using on-board sensors. This makes our proposed approach", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 326, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 338 + ], + "score": 1.0, + "content": "amenable to real world deployment. Learning based approaches (Gandhi et al., 2017; Sadeghi &", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 337, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 349 + ], + "score": 1.0, + "content": "Levine, 2017) have also been used to learn low-level collision avoidance policies. While they do not", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "use task-context, they learn to move towards open space, without the intent of exploring the whole", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 358, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 372 + ], + "score": 1.0, + "content": "environment. Zhang et al. (2017) uses a differentiable map structure to mimic the SLAM techniques.", + "type": "text", + "cross_page": true + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "Such works are orthogonal to our effort on exploration as our exploration policy can benefit from", + "type": "text", + "cross_page": true + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 380, + 392, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 392, + 394 + ], + "score": 1.0, + "content": "their learned maps instead of only using reconstructed occupancy map.", + "type": "text", + "cross_page": true + } + ], + "index": 15 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 523, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 129, + 45, + 484, + 239 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 129, + 45, + 484, + 239 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 129, + 45, + 484, + 239 + ], + "spans": [ + { + "bbox": [ + 129, + 45, + 484, + 239 + ], + "score": 0.976, + "type": "image", + "image_path": "a954b8198e004d046aa04a08c0de5ed74c59e46707d404905e4c17c9e20f65fe.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 129, + 45, + 484, + 109.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 129, + 109.66666666666667, + 484, + 174.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 129, + 174.33333333333334, + 484, + 239.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 245, + 505, + 305 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 244, + 504, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 504, + 256 + ], + "score": 1.0, + "content": "Figure 1: Policy and Training Architecture: Our scheme for learning exploration policies for navigation.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 255, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 505, + 266 + ], + "score": 1.0, + "content": "We assume a mobile robot with an RGB-D camera and a bump sensor. We maintain a running estimate of its", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 264, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 137, + 277 + ], + "score": 1.0, + "content": "position", + "type": "text" + }, + { + "bbox": [ + 138, + 265, + 147, + 275 + ], + "score": 0.87, + "content": "\\hat { x } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 264, + 506, + 277 + ], + "score": 1.0, + "content": ". These position estimates are used to stitch together an approximate map of the environment using", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 259, + 286 + ], + "score": 1.0, + "content": "the depth images. The exploration policy", + "type": "text" + }, + { + "bbox": [ + 259, + 276, + 270, + 285 + ], + "score": 0.86, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "is a recurrent network takes egocentric crops of this map at two", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 285, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 506, + 297 + ], + "score": 1.0, + "content": "scales, and the current RGB image as input. The policy is trained using an intrinsic coverage reward that is", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 295, + 441, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 441, + 306 + ], + "score": 1.0, + "content": "computed from the approximate map and a collision penalty obtained from the bump sensor.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 107, + 315, + 505, + 393 + ], + "lines": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "score": 1.0, + "content": "signals for training. We derive them using on-board sensors. This makes our proposed approach", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 326, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 338 + ], + "score": 1.0, + "content": "amenable to real world deployment. Learning based approaches (Gandhi et al., 2017; Sadeghi &", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 337, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 349 + ], + "score": 1.0, + "content": "Levine, 2017) have also been used to learn low-level collision avoidance policies. While they do not", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "use task-context, they learn to move towards open space, without the intent of exploring the whole", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 358, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 372 + ], + "score": 1.0, + "content": "environment. Zhang et al. (2017) uses a differentiable map structure to mimic the SLAM techniques.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 383 + ], + "score": 1.0, + "content": "Such works are orthogonal to our effort on exploration as our exploration policy can benefit from", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 380, + 392, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 392, + 394 + ], + "score": 1.0, + "content": "their learned maps instead of only using reconstructed occupancy map.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 399, + 505, + 596 + ], + "lines": [ + { + "bbox": [ + 106, + 398, + 505, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 398, + 505, + 410 + ], + "score": 1.0, + "content": "Exploration for Navigation. A notable few past works share a similar line of thought, and in-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 408, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 505, + 421 + ], + "score": 1.0, + "content": "vestigate exploration in context of reinforcement learning (Schmidhuber, 1991; Stadie et al., 2015;", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 420, + 504, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 504, + 432 + ], + "score": 1.0, + "content": "Pathak et al., 2017; Fu et al., 2017; Lopes et al., 2012; Chentanez et al., 2005). These works de-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "score": 1.0, + "content": "sign intrinsic reward functions to capture novelty of states or state-action transitions. Exploration", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 442, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 453 + ], + "score": 1.0, + "content": "policies are then learned by optimizing these reward functions using reinforcement learning. Our", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "score": 1.0, + "content": "work is most similar to these works. However, we focus on this problem in the specific context of", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 464, + 506, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 506, + 476 + ], + "score": 1.0, + "content": "navigation in complex and realistic 3D environments, and propose specialized policy architectures", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "and intrinsic reward functions. We experimentally demonstrate that these specializations improve", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 486, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 506, + 498 + ], + "score": 1.0, + "content": "performance, and how learning based exploration techniques may not be too far from real world", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "deployment. Jayaraman & Grauman (2018) use a related reward function (pixel reconstruction) to", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 508, + 504, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 483, + 519 + ], + "score": 1.0, + "content": "learn policies to look around (and subsequently solve tasks). However, they do it in context of", + "type": "text" + }, + { + "bbox": [ + 483, + 508, + 504, + 518 + ], + "score": 0.85, + "content": "3 6 0 ^ { \\circ }", + "type": "inline_equation" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "images, and their precise reward can’t be estimated intrinsically. Xu et al. (2017) generate smooth", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 529, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 542 + ], + "score": 1.0, + "content": "movement path for high-quality camera scan by using time-varying tensor fields. Bai et al. (2016)", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 541, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 505, + 552 + ], + "score": 1.0, + "content": "propose an information-theoretic exploration method using Gaussian Process regression and show", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 552, + 504, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 504, + 563 + ], + "score": 1.0, + "content": "experiments on simplistic map environments. Kollar & Roy (2008) assume access to the ground-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 562, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 505, + 575 + ], + "score": 1.0, + "content": "truth map and learn an optimized trajectory that maximizes the accuracy of the SLAM-derived map.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 573, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 505, + 586 + ], + "score": 1.0, + "content": "In contrast, our learning policy directly tells the action that the agent should take next and estimates", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 584, + 183, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 584, + 183, + 597 + ], + "score": 1.0, + "content": "the map on the fly.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 601, + 504, + 657 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "score": 1.0, + "content": "System Identification. Finally, the general idea of exploration prior to goal-driven behavior, is", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 612, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 505, + 624 + ], + "score": 1.0, + "content": "also related to the classical idea of system identification (Ljung, 1987). Recent interest in this idea", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 623, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 506, + 635 + ], + "score": 1.0, + "content": "with end-to-end learning (Yu et al., 2017; Duan et al., 2016; Mishra et al., 2018) has been shown to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 634, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 505, + 645 + ], + "score": 1.0, + "content": "successfully adapt to novel mazes. In comparison, we tackle navigation in complex and realistic 3D", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 645, + 349, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 349, + 657 + ], + "score": 1.0, + "content": "environments, with very long spatio-temporal dependencies.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36 + }, + { + "type": "title", + "bbox": [ + 108, + 673, + 182, + 686 + ], + "lines": [ + { + "bbox": [ + 105, + 671, + 185, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 185, + 689 + ], + "score": 1.0, + "content": "3 APPROACH", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "Let us consider a mobile agent that is equipped with an RGB-D camera and that can execute basic", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 711, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 711, + 505, + 721 + ], + "score": 1.0, + "content": "movement macro-actions. This agent has been dropped into a novel environment that it has never", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 720, + 504, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 341, + 733 + ], + "score": 1.0, + "content": "been in before. We want to learn an exploration policy", + "type": "text" + }, + { + "bbox": [ + 342, + 722, + 352, + 732 + ], + "score": 0.84, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 720, + 504, + 733 + ], + "score": 1.0, + "content": "that enables this agent to efficiently", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + } + ], + "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 2019", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 309, + 762 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 129, + 45, + 484, + 239 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 129, + 45, + 484, + 239 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 129, + 45, + 484, + 239 + ], + "spans": [ + { + "bbox": [ + 129, + 45, + 484, + 239 + ], + "score": 0.976, + "type": "image", + "image_path": "a954b8198e004d046aa04a08c0de5ed74c59e46707d404905e4c17c9e20f65fe.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 129, + 45, + 484, + 109.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 129, + 109.66666666666667, + 484, + 174.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 129, + 174.33333333333334, + 484, + 239.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 245, + 505, + 305 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 244, + 504, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 504, + 256 + ], + "score": 1.0, + "content": "Figure 1: Policy and Training Architecture: Our scheme for learning exploration policies for navigation.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 255, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 505, + 266 + ], + "score": 1.0, + "content": "We assume a mobile robot with an RGB-D camera and a bump sensor. We maintain a running estimate of its", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 264, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 137, + 277 + ], + "score": 1.0, + "content": "position", + "type": "text" + }, + { + "bbox": [ + 138, + 265, + 147, + 275 + ], + "score": 0.87, + "content": "\\hat { x } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 264, + 506, + 277 + ], + "score": 1.0, + "content": ". These position estimates are used to stitch together an approximate map of the environment using", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 259, + 286 + ], + "score": 1.0, + "content": "the depth images. The exploration policy", + "type": "text" + }, + { + "bbox": [ + 259, + 276, + 270, + 285 + ], + "score": 0.86, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "is a recurrent network takes egocentric crops of this map at two", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 285, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 506, + 297 + ], + "score": 1.0, + "content": "scales, and the current RGB image as input. The policy is trained using an intrinsic coverage reward that is", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 295, + 441, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 441, + 306 + ], + "score": 1.0, + "content": "computed from the approximate map and a collision penalty obtained from the bump sensor.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 107, + 315, + 505, + 393 + ], + "lines": [], + "index": 12, + "bbox_fs": [ + 105, + 315, + 505, + 394 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 399, + 505, + 596 + ], + "lines": [ + { + "bbox": [ + 106, + 398, + 505, + 410 + ], + "spans": [ + { + "bbox": [ + 106, + 398, + 505, + 410 + ], + "score": 1.0, + "content": "Exploration for Navigation. A notable few past works share a similar line of thought, and in-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 408, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 505, + 421 + ], + "score": 1.0, + "content": "vestigate exploration in context of reinforcement learning (Schmidhuber, 1991; Stadie et al., 2015;", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 420, + 504, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 504, + 432 + ], + "score": 1.0, + "content": "Pathak et al., 2017; Fu et al., 2017; Lopes et al., 2012; Chentanez et al., 2005). These works de-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 505, + 443 + ], + "score": 1.0, + "content": "sign intrinsic reward functions to capture novelty of states or state-action transitions. Exploration", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 442, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 453 + ], + "score": 1.0, + "content": "policies are then learned by optimizing these reward functions using reinforcement learning. Our", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "score": 1.0, + "content": "work is most similar to these works. However, we focus on this problem in the specific context of", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 464, + 506, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 506, + 476 + ], + "score": 1.0, + "content": "navigation in complex and realistic 3D environments, and propose specialized policy architectures", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "and intrinsic reward functions. We experimentally demonstrate that these specializations improve", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 486, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 506, + 498 + ], + "score": 1.0, + "content": "performance, and how learning based exploration techniques may not be too far from real world", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "deployment. Jayaraman & Grauman (2018) use a related reward function (pixel reconstruction) to", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 508, + 504, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 483, + 519 + ], + "score": 1.0, + "content": "learn policies to look around (and subsequently solve tasks). However, they do it in context of", + "type": "text" + }, + { + "bbox": [ + 483, + 508, + 504, + 518 + ], + "score": 0.85, + "content": "3 6 0 ^ { \\circ }", + "type": "inline_equation" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "images, and their precise reward can’t be estimated intrinsically. Xu et al. (2017) generate smooth", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 529, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 542 + ], + "score": 1.0, + "content": "movement path for high-quality camera scan by using time-varying tensor fields. Bai et al. (2016)", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 541, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 505, + 552 + ], + "score": 1.0, + "content": "propose an information-theoretic exploration method using Gaussian Process regression and show", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 552, + 504, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 504, + 563 + ], + "score": 1.0, + "content": "experiments on simplistic map environments. Kollar & Roy (2008) assume access to the ground-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 562, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 505, + 575 + ], + "score": 1.0, + "content": "truth map and learn an optimized trajectory that maximizes the accuracy of the SLAM-derived map.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 573, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 505, + 586 + ], + "score": 1.0, + "content": "In contrast, our learning policy directly tells the action that the agent should take next and estimates", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 584, + 183, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 584, + 183, + 597 + ], + "score": 1.0, + "content": "the map on the fly.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 398, + 506, + 597 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 601, + 504, + 657 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 613 + ], + "score": 1.0, + "content": "System Identification. Finally, the general idea of exploration prior to goal-driven behavior, is", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 612, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 505, + 624 + ], + "score": 1.0, + "content": "also related to the classical idea of system identification (Ljung, 1987). Recent interest in this idea", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 623, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 506, + 635 + ], + "score": 1.0, + "content": "with end-to-end learning (Yu et al., 2017; Duan et al., 2016; Mishra et al., 2018) has been shown to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 634, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 505, + 645 + ], + "score": 1.0, + "content": "successfully adapt to novel mazes. In comparison, we tackle navigation in complex and realistic 3D", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 645, + 349, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 349, + 657 + ], + "score": 1.0, + "content": "environments, with very long spatio-temporal dependencies.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36, + "bbox_fs": [ + 106, + 600, + 506, + 657 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 673, + 182, + 686 + ], + "lines": [ + { + "bbox": [ + 105, + 671, + 185, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 185, + 689 + ], + "score": 1.0, + "content": "3 APPROACH", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "Let us consider a mobile agent that is equipped with an RGB-D camera and that can execute basic", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 711, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 711, + 505, + 721 + ], + "score": 1.0, + "content": "movement macro-actions. This agent has been dropped into a novel environment that it has never", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 720, + 504, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 341, + 733 + ], + "score": 1.0, + "content": "been in before. We want to learn an exploration policy", + "type": "text" + }, + { + "bbox": [ + 342, + 722, + 352, + 732 + ], + "score": 0.84, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 720, + 504, + 733 + ], + "score": 1.0, + "content": "that enables this agent to efficiently", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "explore this new environment. A successful exploration of the new environment should enable the", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 408, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 408, + 106 + ], + "score": 1.0, + "content": "agent to accomplish down-stream tasks in this new environment efficiently.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 699, + 506, + 733 + ] + } + ] + }, + { + "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": "explore this new environment. A successful exploration of the new environment should enable the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 408, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 408, + 106 + ], + "score": 1.0, + "content": "agent to accomplish down-stream tasks in this new environment efficiently.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 108, + 110, + 504, + 144 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 222, + 123 + ], + "score": 1.0, + "content": "We formulate estimation of", + "type": "text" + }, + { + "bbox": [ + 222, + 113, + 234, + 122 + ], + "score": 0.86, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "as a learning problem. We design a reward function that is esti-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 121, + 506, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 306, + 133 + ], + "score": 1.0, + "content": "mated entirely using on-board sensors, and learn", + "type": "text" + }, + { + "bbox": [ + 306, + 123, + 318, + 132 + ], + "score": 0.85, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 121, + 404, + 133 + ], + "score": 1.0, + "content": "using RL. Crucially,", + "type": "text" + }, + { + "bbox": [ + 405, + 123, + 416, + 132 + ], + "score": 0.85, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 121, + 506, + 133 + ], + "score": 1.0, + "content": "is learned on a set of", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 132, + 493, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 163, + 146 + ], + "score": 1.0, + "content": "environments", + "type": "text" + }, + { + "bbox": [ + 163, + 133, + 189, + 144 + ], + "score": 0.91, + "content": "\\mathcal { E } _ { t r a i n }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 132, + 371, + 146 + ], + "score": 1.0, + "content": ", and tested on a held-out set of environments", + "type": "text" + }, + { + "bbox": [ + 371, + 132, + 391, + 144 + ], + "score": 0.91, + "content": "\\mathcal { E } _ { t e s t }", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 132, + 412, + 146 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 412, + 132, + 488, + 145 + ], + "score": 0.91, + "content": "\\mathcal { E } _ { t r a i n } \\cap \\mathcal { E } _ { t e s t } = \\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 132, + 493, + 146 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 108, + 149, + 505, + 193 + ], + "lines": [ + { + "bbox": [ + 106, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 347, + 162 + ], + "score": 1.0, + "content": "The key novelties in our work are: a) the design of the policy", + "type": "text" + }, + { + "bbox": [ + 348, + 151, + 358, + 160 + ], + "score": 0.85, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 149, + 505, + 162 + ], + "score": 1.0, + "content": ", b) the design of the reward function", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 160, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 107, + 161, + 115, + 170 + ], + "score": 0.75, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 160, + 358, + 173 + ], + "score": 1.0, + "content": ", and c) use of human demonstrations to speed up training of", + "type": "text" + }, + { + "bbox": [ + 358, + 162, + 369, + 171 + ], + "score": 0.86, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 160, + 505, + 173 + ], + "score": 1.0, + "content": ". The design of the policy and the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "reward function depend on a rudimentary map of the environment that we maintain over time. We", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 183, + 466, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 183, + 466, + 194 + ], + "score": 1.0, + "content": "first describe the map construction procedure, and then detail the aforementioned aspects.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5 + }, + { + "type": "title", + "bbox": [ + 108, + 210, + 223, + 222 + ], + "lines": [ + { + "bbox": [ + 105, + 210, + 225, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 225, + 223 + ], + "score": 1.0, + "content": "3.1 MAP CONSTRUCTION", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 232, + 505, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 233, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 505, + 245 + ], + "score": 1.0, + "content": "As the agent moves around, it uses its depth camera to build and update a map of the world around", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "it. This is done by maintaining an estimate of the agent’s location over time and projecting 3D points", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 254, + 396, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 396, + 268 + ], + "score": 1.0, + "content": "observed in the depth image into an allocentric map of the environment.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 108, + 271, + 504, + 305 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 475, + 285 + ], + "score": 1.0, + "content": "More specifically, let us assume that the agent’s estimate of its current location at time step", + "type": "text" + }, + { + "bbox": [ + 475, + 273, + 480, + 281 + ], + "score": 0.73, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 270, + 491, + 285 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 491, + 272, + 501, + 282 + ], + "score": 0.87, + "content": "\\hat { x _ { t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 270, + 505, + 285 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 268, + 295 + ], + "score": 1.0, + "content": "and that the agent starts from origin (i.e.", + "type": "text" + }, + { + "bbox": [ + 268, + 283, + 299, + 294 + ], + "score": 0.89, + "content": "\\hat { x } _ { 0 } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 282, + 446, + 295 + ], + "score": 1.0, + "content": "). When the agent executes an action", + "type": "text" + }, + { + "bbox": [ + 446, + 284, + 456, + 294 + ], + "score": 0.84, + "content": "a _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 282, + 505, + 295 + ], + "score": 1.0, + "content": "at time step", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 293, + 486, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 295, + 111, + 304 + ], + "score": 0.67, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 111, + 293, + 384, + 307 + ], + "score": 1.0, + "content": ", it updates its position estimate through a known transition function", + "type": "text" + }, + { + "bbox": [ + 384, + 294, + 391, + 305 + ], + "score": 0.78, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 293, + 411, + 307 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 412, + 294, + 482, + 306 + ], + "score": 0.93, + "content": "\\hat { x } _ { t + 1 } = f ( \\hat { x } _ { t } , a _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 293, + 486, + 307 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 310, + 505, + 410 + ], + "lines": [ + { + "bbox": [ + 106, + 311, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 272, + 322 + ], + "score": 1.0, + "content": "The depth image observation at time step", + "type": "text" + }, + { + "bbox": [ + 272, + 311, + 294, + 321 + ], + "score": 0.82, + "content": "t + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 311, + 297, + 322 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 298, + 311, + 320, + 322 + ], + "score": 0.9, + "content": "D _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 311, + 505, + 322 + ], + "score": 1.0, + "content": "is back-projected into 3D points using known", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 425, + 334 + ], + "score": 1.0, + "content": "camera intrinsic parameters. These 3D points are transformed using the estimate", + "type": "text" + }, + { + "bbox": [ + 425, + 322, + 446, + 333 + ], + "score": 0.91, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 322, + 506, + 334 + ], + "score": 1.0, + "content": ", and projected", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 333, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 345 + ], + "score": 1.0, + "content": "down to generate a 2D map of the environment (that tracks what parts of space are known to be", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "traversable or known to be non-traversable or unknown). Note that, because of slippage in wheels", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 353, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 104, + 353, + 126, + 369 + ], + "score": 1.0, + "content": "etc.,", + "type": "text" + }, + { + "bbox": [ + 126, + 355, + 146, + 366 + ], + "score": 0.91, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 353, + 480, + 369 + ], + "score": 1.0, + "content": "may not be the same as the true relative location of the agent from start of episode", + "type": "text" + }, + { + "bbox": [ + 480, + 356, + 501, + 366 + ], + "score": 0.89, + "content": "x _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 353, + 505, + 369 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 364, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 505, + 378 + ], + "score": 1.0, + "content": "This leads to aliasing in the generated map. We do not use expensive non-linear optimization (bundle", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 376, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 252, + 388 + ], + "score": 1.0, + "content": "adjustment) to improve our estimate", + "type": "text" + }, + { + "bbox": [ + 253, + 377, + 273, + 388 + ], + "score": 0.91, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 376, + 505, + 388 + ], + "score": 1.0, + "content": ", but instead rely on learning to provide robustness against", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 387, + 506, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 462, + 400 + ], + "score": 1.0, + "content": "this mis-alignment. We use the new back-projected 3D points to update the current map", + "type": "text" + }, + { + "bbox": [ + 462, + 388, + 476, + 398 + ], + "score": 0.88, + "content": "M _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 387, + 506, + 400 + ], + "score": 1.0, + "content": "and to", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 397, + 228, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 199, + 412 + ], + "score": 1.0, + "content": "obtain an updated map", + "type": "text" + }, + { + "bbox": [ + 200, + 398, + 223, + 410 + ], + "score": 0.91, + "content": "M _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 397, + 228, + 412 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20 + }, + { + "type": "title", + "bbox": [ + 108, + 426, + 235, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 426, + 236, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 236, + 439 + ], + "score": 1.0, + "content": "3.2 POLICY ARCHITECTURE", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 448, + 505, + 515 + ], + "lines": [ + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "score": 1.0, + "content": "Before we describe our policy architecture, let’s define what are the features that a good exploration", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "policy needs: (a) good exploration of a new environment requires an agent to meaningfully move", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 471, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 483 + ], + "score": 1.0, + "content": "around by detecting and avoiding obstacles; (b) good policy also requires the agent to identify se-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 481, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 505, + 495 + ], + "score": 1.0, + "content": "mantic cues such as doors that may facilitate exploration; (c) finally, it requires the agent to keep", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 492, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 506, + 505 + ], + "score": 1.0, + "content": "track of what parts of the environment have or have not been explored, and to estimate how to get to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 504, + 340, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 340, + 516 + ], + "score": 1.0, + "content": "parts of the environment that may not have been explored.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "score": 1.0, + "content": "This motivates our policy architecture. We fuse information from RGB image observations and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "score": 1.0, + "content": "occupancy grid-based maps. Information from the RGB image allows recognition of useful semantic", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 542, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 505, + 555 + ], + "score": 1.0, + "content": "cues. While information from the occupancy maps allows the agent to keep track of parts of the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 553, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 505, + 567 + ], + "score": 1.0, + "content": "environment that have or have not been explored and to plan paths to unexplored regions without", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 565, + 204, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 204, + 577 + ], + "score": 1.0, + "content": "bumping into obstacles.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 108, + 581, + 393, + 592 + ], + "lines": [ + { + "bbox": [ + 105, + 579, + 395, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 395, + 594 + ], + "score": 1.0, + "content": "The policy architecture is shown in Fig. 1. We describe it in detail here:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 108, + 604, + 505, + 637 + ], + "lines": [ + { + "bbox": [ + 106, + 604, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 106, + 604, + 505, + 616 + ], + "score": 1.0, + "content": "1. Information from RGB images: RGB images are processed through a CNN. We use a ResNet-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 119, + 615, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 119, + 615, + 505, + 627 + ], + "score": 1.0, + "content": "18 CNN that has been pre-trained on the ImageNet classification task, and can identify semantic", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 119, + 626, + 199, + 639 + ], + "spans": [ + { + "bbox": [ + 119, + 626, + 199, + 639 + ], + "score": 1.0, + "content": "concepts in images.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 108, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "score": 1.0, + "content": "2. Information from Occupancy Maps: We derive an occupancy map from past observations (as", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 118, + 654, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 118, + 654, + 505, + 668 + ], + "score": 1.0, + "content": "described in Sec. 3.1), and use it with a ResNet-18 CNN to extract features. To simplify learning,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 118, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 118, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "we do not use the allocentric map, but transform it into an egocentric map using the estimated", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 117, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 117, + 676, + 154, + 690 + ], + "score": 1.0, + "content": "position", + "type": "text" + }, + { + "bbox": [ + 154, + 677, + 164, + 688 + ], + "score": 0.86, + "content": "\\hat { x } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "(such that the agent is always at the center of the map, facing upwards). This map", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 118, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 118, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "canonicalization aids learning. It allows the CNN to not only detect unexplored space but to also", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 117, + 698, + 507, + 712 + ], + "spans": [ + { + "bbox": [ + 117, + 698, + 507, + 712 + ], + "score": 1.0, + "content": "locate it with respect to its current location. Additionally, we use two such egocentric maps, a", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 118, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 118, + 710, + 302, + 722 + ], + "score": 1.0, + "content": "coarse map that captures information about a", + "type": "text" + }, + { + "bbox": [ + 302, + 710, + 354, + 720 + ], + "score": 0.9, + "content": "4 0 m \\times 4 0 m", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "area around the agent, and a detailed", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 117, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 117, + 720, + 205, + 734 + ], + "score": 1.0, + "content": "map that describes a", + "type": "text" + }, + { + "bbox": [ + 205, + 721, + 247, + 731 + ], + "score": 0.9, + "content": "4 m \\times 4 m", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "neighborhood. Some of these design choices were inspired by", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 44.5 + } + ], + "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 2019", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 82, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 108, + 110, + 504, + 144 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 222, + 123 + ], + "score": 1.0, + "content": "We formulate estimation of", + "type": "text" + }, + { + "bbox": [ + 222, + 113, + 234, + 122 + ], + "score": 0.86, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "as a learning problem. We design a reward function that is esti-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 121, + 506, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 306, + 133 + ], + "score": 1.0, + "content": "mated entirely using on-board sensors, and learn", + "type": "text" + }, + { + "bbox": [ + 306, + 123, + 318, + 132 + ], + "score": 0.85, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 121, + 404, + 133 + ], + "score": 1.0, + "content": "using RL. Crucially,", + "type": "text" + }, + { + "bbox": [ + 405, + 123, + 416, + 132 + ], + "score": 0.85, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 121, + 506, + 133 + ], + "score": 1.0, + "content": "is learned on a set of", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 132, + 493, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 163, + 146 + ], + "score": 1.0, + "content": "environments", + "type": "text" + }, + { + "bbox": [ + 163, + 133, + 189, + 144 + ], + "score": 0.91, + "content": "\\mathcal { E } _ { t r a i n }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 132, + 371, + 146 + ], + "score": 1.0, + "content": ", and tested on a held-out set of environments", + "type": "text" + }, + { + "bbox": [ + 371, + 132, + 391, + 144 + ], + "score": 0.91, + "content": "\\mathcal { E } _ { t e s t }", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 132, + 412, + 146 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 412, + 132, + 488, + 145 + ], + "score": 0.91, + "content": "\\mathcal { E } _ { t r a i n } \\cap \\mathcal { E } _ { t e s t } = \\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 132, + 493, + 146 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 106, + 110, + 506, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 149, + 505, + 193 + ], + "lines": [ + { + "bbox": [ + 106, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 347, + 162 + ], + "score": 1.0, + "content": "The key novelties in our work are: a) the design of the policy", + "type": "text" + }, + { + "bbox": [ + 348, + 151, + 358, + 160 + ], + "score": 0.85, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 149, + 505, + 162 + ], + "score": 1.0, + "content": ", b) the design of the reward function", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 160, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 107, + 161, + 115, + 170 + ], + "score": 0.75, + "content": "R", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 160, + 358, + 173 + ], + "score": 1.0, + "content": ", and c) use of human demonstrations to speed up training of", + "type": "text" + }, + { + "bbox": [ + 358, + 162, + 369, + 171 + ], + "score": 0.86, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 160, + 505, + 173 + ], + "score": 1.0, + "content": ". The design of the policy and the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "reward function depend on a rudimentary map of the environment that we maintain over time. We", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 183, + 466, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 183, + 466, + 194 + ], + "score": 1.0, + "content": "first describe the map construction procedure, and then detail the aforementioned aspects.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 149, + 505, + 194 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 210, + 223, + 222 + ], + "lines": [ + { + "bbox": [ + 105, + 210, + 225, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 225, + 223 + ], + "score": 1.0, + "content": "3.1 MAP CONSTRUCTION", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 232, + 505, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 233, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 233, + 505, + 245 + ], + "score": 1.0, + "content": "As the agent moves around, it uses its depth camera to build and update a map of the world around", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "it. This is done by maintaining an estimate of the agent’s location over time and projecting 3D points", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 254, + 396, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 396, + 268 + ], + "score": 1.0, + "content": "observed in the depth image into an allocentric map of the environment.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 233, + 505, + 268 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 271, + 504, + 305 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 475, + 285 + ], + "score": 1.0, + "content": "More specifically, let us assume that the agent’s estimate of its current location at time step", + "type": "text" + }, + { + "bbox": [ + 475, + 273, + 480, + 281 + ], + "score": 0.73, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 270, + 491, + 285 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 491, + 272, + 501, + 282 + ], + "score": 0.87, + "content": "\\hat { x _ { t } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 270, + 505, + 285 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 268, + 295 + ], + "score": 1.0, + "content": "and that the agent starts from origin (i.e.", + "type": "text" + }, + { + "bbox": [ + 268, + 283, + 299, + 294 + ], + "score": 0.89, + "content": "\\hat { x } _ { 0 } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 282, + 446, + 295 + ], + "score": 1.0, + "content": "). When the agent executes an action", + "type": "text" + }, + { + "bbox": [ + 446, + 284, + 456, + 294 + ], + "score": 0.84, + "content": "a _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 282, + 505, + 295 + ], + "score": 1.0, + "content": "at time step", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 293, + 486, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 295, + 111, + 304 + ], + "score": 0.67, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 111, + 293, + 384, + 307 + ], + "score": 1.0, + "content": ", it updates its position estimate through a known transition function", + "type": "text" + }, + { + "bbox": [ + 384, + 294, + 391, + 305 + ], + "score": 0.78, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 293, + 411, + 307 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 412, + 294, + 482, + 306 + ], + "score": 0.93, + "content": "\\hat { x } _ { t + 1 } = f ( \\hat { x } _ { t } , a _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 293, + 486, + 307 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 270, + 505, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 310, + 505, + 410 + ], + "lines": [ + { + "bbox": [ + 106, + 311, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 272, + 322 + ], + "score": 1.0, + "content": "The depth image observation at time step", + "type": "text" + }, + { + "bbox": [ + 272, + 311, + 294, + 321 + ], + "score": 0.82, + "content": "t + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 311, + 297, + 322 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 298, + 311, + 320, + 322 + ], + "score": 0.9, + "content": "D _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 311, + 505, + 322 + ], + "score": 1.0, + "content": "is back-projected into 3D points using known", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 425, + 334 + ], + "score": 1.0, + "content": "camera intrinsic parameters. These 3D points are transformed using the estimate", + "type": "text" + }, + { + "bbox": [ + 425, + 322, + 446, + 333 + ], + "score": 0.91, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 322, + 506, + 334 + ], + "score": 1.0, + "content": ", and projected", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 333, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 505, + 345 + ], + "score": 1.0, + "content": "down to generate a 2D map of the environment (that tracks what parts of space are known to be", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "traversable or known to be non-traversable or unknown). Note that, because of slippage in wheels", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 353, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 104, + 353, + 126, + 369 + ], + "score": 1.0, + "content": "etc.,", + "type": "text" + }, + { + "bbox": [ + 126, + 355, + 146, + 366 + ], + "score": 0.91, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 353, + 480, + 369 + ], + "score": 1.0, + "content": "may not be the same as the true relative location of the agent from start of episode", + "type": "text" + }, + { + "bbox": [ + 480, + 356, + 501, + 366 + ], + "score": 0.89, + "content": "x _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 353, + 505, + 369 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 364, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 505, + 378 + ], + "score": 1.0, + "content": "This leads to aliasing in the generated map. We do not use expensive non-linear optimization (bundle", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 376, + 505, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 252, + 388 + ], + "score": 1.0, + "content": "adjustment) to improve our estimate", + "type": "text" + }, + { + "bbox": [ + 253, + 377, + 273, + 388 + ], + "score": 0.91, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 376, + 505, + 388 + ], + "score": 1.0, + "content": ", but instead rely on learning to provide robustness against", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 387, + 506, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 462, + 400 + ], + "score": 1.0, + "content": "this mis-alignment. We use the new back-projected 3D points to update the current map", + "type": "text" + }, + { + "bbox": [ + 462, + 388, + 476, + 398 + ], + "score": 0.88, + "content": "M _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 387, + 506, + 400 + ], + "score": 1.0, + "content": "and to", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 397, + 228, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 199, + 412 + ], + "score": 1.0, + "content": "obtain an updated map", + "type": "text" + }, + { + "bbox": [ + 200, + 398, + 223, + 410 + ], + "score": 0.91, + "content": "M _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 397, + 228, + 412 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 20, + "bbox_fs": [ + 104, + 311, + 506, + 412 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 426, + 235, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 426, + 236, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 236, + 439 + ], + "score": 1.0, + "content": "3.2 POLICY ARCHITECTURE", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 448, + 505, + 515 + ], + "lines": [ + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "score": 1.0, + "content": "Before we describe our policy architecture, let’s define what are the features that a good exploration", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "policy needs: (a) good exploration of a new environment requires an agent to meaningfully move", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 471, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 483 + ], + "score": 1.0, + "content": "around by detecting and avoiding obstacles; (b) good policy also requires the agent to identify se-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 481, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 505, + 495 + ], + "score": 1.0, + "content": "mantic cues such as doors that may facilitate exploration; (c) finally, it requires the agent to keep", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 492, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 506, + 505 + ], + "score": 1.0, + "content": "track of what parts of the environment have or have not been explored, and to estimate how to get to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 504, + 340, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 340, + 516 + ], + "score": 1.0, + "content": "parts of the environment that may not have been explored.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 448, + 506, + 516 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 520, + 505, + 576 + ], + "lines": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 520, + 505, + 533 + ], + "score": 1.0, + "content": "This motivates our policy architecture. We fuse information from RGB image observations and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 505, + 545 + ], + "score": 1.0, + "content": "occupancy grid-based maps. Information from the RGB image allows recognition of useful semantic", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 542, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 505, + 555 + ], + "score": 1.0, + "content": "cues. While information from the occupancy maps allows the agent to keep track of parts of the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 553, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 553, + 505, + 567 + ], + "score": 1.0, + "content": "environment that have or have not been explored and to plan paths to unexplored regions without", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 565, + 204, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 565, + 204, + 577 + ], + "score": 1.0, + "content": "bumping into obstacles.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 520, + 505, + 577 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 581, + 393, + 592 + ], + "lines": [ + { + "bbox": [ + 105, + 579, + 395, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 579, + 395, + 594 + ], + "score": 1.0, + "content": "The policy architecture is shown in Fig. 1. We describe it in detail here:", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 579, + 395, + 594 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 604, + 505, + 637 + ], + "lines": [ + { + "bbox": [ + 106, + 604, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 106, + 604, + 505, + 616 + ], + "score": 1.0, + "content": "1. Information from RGB images: RGB images are processed through a CNN. We use a ResNet-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 119, + 615, + 505, + 627 + ], + "spans": [ + { + "bbox": [ + 119, + 615, + 505, + 627 + ], + "score": 1.0, + "content": "18 CNN that has been pre-trained on the ImageNet classification task, and can identify semantic", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 119, + 626, + 199, + 639 + ], + "spans": [ + { + "bbox": [ + 119, + 626, + 199, + 639 + ], + "score": 1.0, + "content": "concepts in images.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 106, + 604, + 505, + 639 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 643, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 657 + ], + "score": 1.0, + "content": "2. Information from Occupancy Maps: We derive an occupancy map from past observations (as", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 118, + 654, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 118, + 654, + 505, + 668 + ], + "score": 1.0, + "content": "described in Sec. 3.1), and use it with a ResNet-18 CNN to extract features. To simplify learning,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 118, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 118, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "we do not use the allocentric map, but transform it into an egocentric map using the estimated", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 117, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 117, + 676, + 154, + 690 + ], + "score": 1.0, + "content": "position", + "type": "text" + }, + { + "bbox": [ + 154, + 677, + 164, + 688 + ], + "score": 0.86, + "content": "\\hat { x } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "(such that the agent is always at the center of the map, facing upwards). This map", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 118, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 118, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "canonicalization aids learning. It allows the CNN to not only detect unexplored space but to also", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 117, + 698, + 507, + 712 + ], + "spans": [ + { + "bbox": [ + 117, + 698, + 507, + 712 + ], + "score": 1.0, + "content": "locate it with respect to its current location. Additionally, we use two such egocentric maps, a", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 118, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 118, + 710, + 302, + 722 + ], + "score": 1.0, + "content": "coarse map that captures information about a", + "type": "text" + }, + { + "bbox": [ + 302, + 710, + 354, + 720 + ], + "score": 0.9, + "content": "4 0 m \\times 4 0 m", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "area around the agent, and a detailed", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 117, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 117, + 720, + 205, + 734 + ], + "score": 1.0, + "content": "map that describes a", + "type": "text" + }, + { + "bbox": [ + 205, + 721, + 247, + 731 + ], + "score": 0.9, + "content": "4 m \\times 4 m", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "neighborhood. Some of these design choices were inspired by", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 117, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 117, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "recent work from Gupta et al. (2017), Parisotto & Salakhutdinov (2018) and Henriques & Vedaldi", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 119, + 93, + 306, + 106 + ], + "spans": [ + { + "bbox": [ + 119, + 93, + 306, + 106 + ], + "score": 1.0, + "content": "(2018), though we make some simplifications.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 643, + 507, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 114, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 117, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 117, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "recent work from Gupta et al. (2017), Parisotto & Salakhutdinov (2018) and Henriques & Vedaldi", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 119, + 93, + 306, + 106 + ], + "spans": [ + { + "bbox": [ + 119, + 93, + 306, + 106 + ], + "score": 1.0, + "content": "(2018), though we make some simplifications.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 110, + 109, + 503, + 132 + ], + "lines": [ + { + "bbox": [ + 107, + 110, + 504, + 122 + ], + "spans": [ + { + "bbox": [ + 107, + 110, + 504, + 122 + ], + "score": 1.0, + "content": "3. Recurrent Policy: Information from the RGB image and maps is fused and passed into an RNN.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 118, + 121, + 362, + 132 + ], + "spans": [ + { + "bbox": [ + 118, + 121, + 362, + 132 + ], + "score": 1.0, + "content": "Recurrence can allow the agent to exhibit coherent behavior.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 108, + 147, + 220, + 158 + ], + "lines": [ + { + "bbox": [ + 105, + 146, + 221, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 221, + 160 + ], + "score": 1.0, + "content": "3.3 COVERAGE REWARD", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 168, + 505, + 258 + ], + "lines": [ + { + "bbox": [ + 106, + 168, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 168, + 505, + 181 + ], + "score": 1.0, + "content": "We now describe the intrinsic reward function that we use to train our exploration policy. We derive", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 179, + 506, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 179, + 249, + 192 + ], + "score": 1.0, + "content": "this intrinsic rewards from the map", + "type": "text" + }, + { + "bbox": [ + 249, + 180, + 263, + 190 + ], + "score": 0.9, + "content": "M _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 179, + 421, + 192 + ], + "score": 1.0, + "content": ", by computing the coverage. Coverage", + "type": "text" + }, + { + "bbox": [ + 422, + 179, + 451, + 191 + ], + "score": 0.93, + "content": "C ( { \\bar { M } } _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 179, + 506, + 192 + ], + "score": 1.0, + "content": "is defined as", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 190, + 505, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 505, + 202 + ], + "score": 1.0, + "content": "the total area in the map that is known to be traversable or known to be non-traversable. Reward", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 200, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 107, + 201, + 138, + 213 + ], + "score": 0.91, + "content": "R _ { i n t } ^ { c o v } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 200, + 189, + 216 + ], + "score": 1.0, + "content": "at time step", + "type": "text" + }, + { + "bbox": [ + 189, + 203, + 194, + 211 + ], + "score": 0.7, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 200, + 374, + 216 + ], + "score": 1.0, + "content": "is obtained via gain in coverage in the map:", + "type": "text" + }, + { + "bbox": [ + 374, + 201, + 455, + 213 + ], + "score": 0.92, + "content": "C ( M _ { t + 1 } ) - C ( M _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 200, + 505, + 216 + ], + "score": 1.0, + "content": ". Intuitively,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 212, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 225 + ], + "score": 1.0, + "content": "if the current observation adds no obstacles or free-space to the map then it adds no information and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 222, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 236 + ], + "score": 1.0, + "content": "hence no reward is given. We also use a collision penalty, that is estimated using the bump sensor,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 228, + 509, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 220, + 246 + ], + "score": 0.91, + "content": "R _ { i n t } ^ { c o l l } ( t ) = - B u m \\bf { \\bar { p } } ( t + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 228, + 253, + 253 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 253, + 234, + 311, + 246 + ], + "score": 0.93, + "content": "B u m p ( t + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 228, + 509, + 253 + ], + "score": 1.0, + "content": "denotes if a collision occurred while executing", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 103, + 242, + 371, + 263 + ], + "spans": [ + { + "bbox": [ + 103, + 242, + 133, + 263 + ], + "score": 1.0, + "content": "action", + "type": "text" + }, + { + "bbox": [ + 133, + 248, + 143, + 258 + ], + "score": 0.74, + "content": "a _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 242, + 147, + 263 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 148, + 247, + 168, + 258 + ], + "score": 0.84, + "content": "R _ { i n t } ^ { c o v }", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 242, + 187, + 263 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 187, + 246, + 208, + 258 + ], + "score": 0.91, + "content": "R _ { i n t } ^ { c o l l }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 242, + 371, + 263 + ], + "score": 1.0, + "content": "are combined to obtain the total reward.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8.5 + }, + { + "type": "title", + "bbox": [ + 108, + 273, + 231, + 284 + ], + "lines": [ + { + "bbox": [ + 106, + 272, + 232, + 285 + ], + "spans": [ + { + "bbox": [ + 106, + 272, + 232, + 285 + ], + "score": 1.0, + "content": "3.4 TRAINING PROCEDURE", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 505, + 404 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "score": 1.0, + "content": "Finally, we describe how we optimize the policy. Navigating in complex realistic 3D houses, re-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 304, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 104, + 304, + 505, + 318 + ], + "score": 1.0, + "content": "quires long-term coherent behavior over multiple time steps, such as exiting a room, going through", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "score": 1.0, + "content": "doors, going down hallways. Such long-term behavior is hard to learn using reinforcement learn-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "ing, given sparsity in reward. This leads to excessively large sample complexity for learning. To", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "overcome this large sample complexity, we pre-train our policy to imitate human demonstrations", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "of how to explore a new environment. We do this using trajectories collected from AMT workers", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 359, + 506, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 506, + 373 + ], + "score": 1.0, + "content": "as they were answering questions in House3D (Das et al., 2018). We ignore the question that was", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 370, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 384 + ], + "score": 1.0, + "content": "posed to the human, and treat these trajectories as a proxy for how a human will explore a previosuly", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 343, + 394 + ], + "score": 1.0, + "content": "unseen environment. After this phase of imitation learning,", + "type": "text" + }, + { + "bbox": [ + 343, + 383, + 355, + 393 + ], + "score": 0.85, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "is further trained via policy gradients", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 392, + 464, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 392, + 464, + 405 + ], + "score": 1.0, + "content": "(Williams, 1992) using proximal policy optimization (PPO) from Schulman et al. (2017).", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 108, + 422, + 200, + 434 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 201, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 201, + 436 + ], + "score": 1.0, + "content": "4 EXPERIMENTS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 447, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 106, + 448, + 504, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 504, + 460 + ], + "score": 1.0, + "content": "The goal of this paper is to build agents that can autonomously explore novel complex 3D environ-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 458, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 506, + 472 + ], + "score": 1.0, + "content": "ments. We want to understand this in context of the different choices we made in our design, as", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 468, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 506, + 484 + ], + "score": 1.0, + "content": "well as how our design compares to alternate existing techniques for exploration. While coverage", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "of the novel environment is a good task-agnostic metric, we also design experiments to addition-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 491, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 505, + 504 + ], + "score": 1.0, + "content": "ally quantify the utility of generic task-agnostic exploration for downstream tasks of interest. We", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 503, + 504, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 504, + 515 + ], + "score": 1.0, + "content": "first describe our experimental setup that consists of complex realistic 3D environments and empha-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 514, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 106, + 514, + 505, + 525 + ], + "score": 1.0, + "content": "sizes the study of generalization to novel environments. We then describe experiments that measure", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 525, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 538 + ], + "score": 1.0, + "content": "task-agnostic exploration via coverage. And finally, we present experiments where we use different", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 325, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 325, + 548 + ], + "score": 1.0, + "content": "exploration schemes for downstream navigation tasks.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29 + }, + { + "type": "title", + "bbox": [ + 108, + 562, + 230, + 573 + ], + "lines": [ + { + "bbox": [ + 106, + 561, + 231, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 231, + 574 + ], + "score": 1.0, + "content": "4.1 EXPERIMENTAL SETUP", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 582, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 582, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 106, + 582, + 506, + 596 + ], + "score": 1.0, + "content": "We conducted our experiments on the House3D simulation environment Wu et al. (2018). House", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "3D is based on realistic apartment layouts from the SUNCG dataset Song et al. (2017) and simulates", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 606, + 504, + 616 + ], + "spans": [ + { + "bbox": [ + 106, + 606, + 504, + 616 + ], + "score": 1.0, + "content": "first-person observations and actions of a robotic agent embodied in these apartments. We use 20", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 614, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 505, + 629 + ], + "score": 1.0, + "content": "houses each for training and testing. These sets are sampled from the respective sets in House 3D,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "score": 1.0, + "content": "and do not overlap. That is, testing is done on a set of houses not seen during training. This allows", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 638, + 504, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 504, + 650 + ], + "score": 1.0, + "content": "us to study generalization, i.e., how well our learned policies perform in novel, previously unseen", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 649, + 504, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 504, + 661 + ], + "score": 1.0, + "content": "houses. We made one customization to the House 3D environment: by default doors in House 3D", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "score": 1.0, + "content": "are rendered but not used for collision checking. We modified House 3D to also not render doors, in", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 670, + 305, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 305, + 684 + ], + "score": 1.0, + "content": "addition to not using them for collision checking.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 688, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 485, + 699 + ], + "score": 1.0, + "content": "Observation Space. We assume that the agent has an RGB-D camera with a field of view of", + "type": "text" + }, + { + "bbox": [ + 486, + 688, + 501, + 698 + ], + "score": 0.86, + "content": "6 0 ^ { \\circ }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 688, + 505, + 699 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "and a bump sensor. The RGB-D camera returns a regular RGB image and a depth image that records", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "the distance (depth information is clipped at 3m) of each pixel from the camera. The bump sensor", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 721, + 376, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 376, + 733 + ], + "score": 1.0, + "content": "returns if a collision happened while executing the previous action.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45.5 + } + ], + "page_idx": 4, + "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 2019", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 309, + 763 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 309, + 763 + ], + "score": 1.0, + "content": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 114, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 117, + 82, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 110, + 109, + 503, + 132 + ], + "lines": [ + { + "bbox": [ + 107, + 110, + 504, + 122 + ], + "spans": [ + { + "bbox": [ + 107, + 110, + 504, + 122 + ], + "score": 1.0, + "content": "3. Recurrent Policy: Information from the RGB image and maps is fused and passed into an RNN.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 118, + 121, + 362, + 132 + ], + "spans": [ + { + "bbox": [ + 118, + 121, + 362, + 132 + ], + "score": 1.0, + "content": "Recurrence can allow the agent to exhibit coherent behavior.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 107, + 110, + 504, + 132 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 147, + 220, + 158 + ], + "lines": [ + { + "bbox": [ + 105, + 146, + 221, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 221, + 160 + ], + "score": 1.0, + "content": "3.3 COVERAGE REWARD", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 168, + 505, + 258 + ], + "lines": [ + { + "bbox": [ + 106, + 168, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 168, + 505, + 181 + ], + "score": 1.0, + "content": "We now describe the intrinsic reward function that we use to train our exploration policy. We derive", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 179, + 506, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 179, + 249, + 192 + ], + "score": 1.0, + "content": "this intrinsic rewards from the map", + "type": "text" + }, + { + "bbox": [ + 249, + 180, + 263, + 190 + ], + "score": 0.9, + "content": "M _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 179, + 421, + 192 + ], + "score": 1.0, + "content": ", by computing the coverage. Coverage", + "type": "text" + }, + { + "bbox": [ + 422, + 179, + 451, + 191 + ], + "score": 0.93, + "content": "C ( { \\bar { M } } _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 179, + 506, + 192 + ], + "score": 1.0, + "content": "is defined as", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 190, + 505, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 505, + 202 + ], + "score": 1.0, + "content": "the total area in the map that is known to be traversable or known to be non-traversable. Reward", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 200, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 107, + 201, + 138, + 213 + ], + "score": 0.91, + "content": "R _ { i n t } ^ { c o v } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 200, + 189, + 216 + ], + "score": 1.0, + "content": "at time step", + "type": "text" + }, + { + "bbox": [ + 189, + 203, + 194, + 211 + ], + "score": 0.7, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 200, + 374, + 216 + ], + "score": 1.0, + "content": "is obtained via gain in coverage in the map:", + "type": "text" + }, + { + "bbox": [ + 374, + 201, + 455, + 213 + ], + "score": 0.92, + "content": "C ( M _ { t + 1 } ) - C ( M _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 200, + 505, + 216 + ], + "score": 1.0, + "content": ". Intuitively,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 212, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 225 + ], + "score": 1.0, + "content": "if the current observation adds no obstacles or free-space to the map then it adds no information and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 222, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 236 + ], + "score": 1.0, + "content": "hence no reward is given. We also use a collision penalty, that is estimated using the bump sensor,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 228, + 509, + 253 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 220, + 246 + ], + "score": 0.91, + "content": "R _ { i n t } ^ { c o l l } ( t ) = - B u m \\bf { \\bar { p } } ( t + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 228, + 253, + 253 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 253, + 234, + 311, + 246 + ], + "score": 0.93, + "content": "B u m p ( t + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 228, + 509, + 253 + ], + "score": 1.0, + "content": "denotes if a collision occurred while executing", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 103, + 242, + 371, + 263 + ], + "spans": [ + { + "bbox": [ + 103, + 242, + 133, + 263 + ], + "score": 1.0, + "content": "action", + "type": "text" + }, + { + "bbox": [ + 133, + 248, + 143, + 258 + ], + "score": 0.74, + "content": "a _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 242, + 147, + 263 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 148, + 247, + 168, + 258 + ], + "score": 0.84, + "content": "R _ { i n t } ^ { c o v }", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 242, + 187, + 263 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 187, + 246, + 208, + 258 + ], + "score": 0.91, + "content": "R _ { i n t } ^ { c o l l }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 242, + 371, + 263 + ], + "score": 1.0, + "content": "are combined to obtain the total reward.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8.5, + "bbox_fs": [ + 103, + 168, + 509, + 263 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 273, + 231, + 284 + ], + "lines": [ + { + "bbox": [ + 106, + 272, + 232, + 285 + ], + "spans": [ + { + "bbox": [ + 106, + 272, + 232, + 285 + ], + "score": 1.0, + "content": "3.4 TRAINING PROCEDURE", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 505, + 404 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "score": 1.0, + "content": "Finally, we describe how we optimize the policy. Navigating in complex realistic 3D houses, re-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 304, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 104, + 304, + 505, + 318 + ], + "score": 1.0, + "content": "quires long-term coherent behavior over multiple time steps, such as exiting a room, going through", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "score": 1.0, + "content": "doors, going down hallways. Such long-term behavior is hard to learn using reinforcement learn-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "ing, given sparsity in reward. This leads to excessively large sample complexity for learning. To", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "overcome this large sample complexity, we pre-train our policy to imitate human demonstrations", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "of how to explore a new environment. We do this using trajectories collected from AMT workers", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 359, + 506, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 506, + 373 + ], + "score": 1.0, + "content": "as they were answering questions in House3D (Das et al., 2018). We ignore the question that was", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 370, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 505, + 384 + ], + "score": 1.0, + "content": "posed to the human, and treat these trajectories as a proxy for how a human will explore a previosuly", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 343, + 394 + ], + "score": 1.0, + "content": "unseen environment. After this phase of imitation learning,", + "type": "text" + }, + { + "bbox": [ + 343, + 383, + 355, + 393 + ], + "score": 0.85, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "is further trained via policy gradients", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 392, + 464, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 392, + 464, + 405 + ], + "score": 1.0, + "content": "(Williams, 1992) using proximal policy optimization (PPO) from Schulman et al. (2017).", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 18.5, + "bbox_fs": [ + 104, + 294, + 506, + 405 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 422, + 200, + 434 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 201, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 201, + 436 + ], + "score": 1.0, + "content": "4 EXPERIMENTS", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 447, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 106, + 448, + 504, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 504, + 460 + ], + "score": 1.0, + "content": "The goal of this paper is to build agents that can autonomously explore novel complex 3D environ-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 458, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 506, + 472 + ], + "score": 1.0, + "content": "ments. We want to understand this in context of the different choices we made in our design, as", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 468, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 506, + 484 + ], + "score": 1.0, + "content": "well as how our design compares to alternate existing techniques for exploration. While coverage", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "of the novel environment is a good task-agnostic metric, we also design experiments to addition-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 491, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 505, + 504 + ], + "score": 1.0, + "content": "ally quantify the utility of generic task-agnostic exploration for downstream tasks of interest. We", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 503, + 504, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 504, + 515 + ], + "score": 1.0, + "content": "first describe our experimental setup that consists of complex realistic 3D environments and empha-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 514, + 505, + 525 + ], + "spans": [ + { + "bbox": [ + 106, + 514, + 505, + 525 + ], + "score": 1.0, + "content": "sizes the study of generalization to novel environments. We then describe experiments that measure", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 525, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 506, + 538 + ], + "score": 1.0, + "content": "task-agnostic exploration via coverage. And finally, we present experiments where we use different", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 536, + 325, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 325, + 548 + ], + "score": 1.0, + "content": "exploration schemes for downstream navigation tasks.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 448, + 506, + 548 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 562, + 230, + 573 + ], + "lines": [ + { + "bbox": [ + 106, + 561, + 231, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 231, + 574 + ], + "score": 1.0, + "content": "4.1 EXPERIMENTAL SETUP", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 582, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 582, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 106, + 582, + 506, + 596 + ], + "score": 1.0, + "content": "We conducted our experiments on the House3D simulation environment Wu et al. (2018). House", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "3D is based on realistic apartment layouts from the SUNCG dataset Song et al. (2017) and simulates", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 606, + 504, + 616 + ], + "spans": [ + { + "bbox": [ + 106, + 606, + 504, + 616 + ], + "score": 1.0, + "content": "first-person observations and actions of a robotic agent embodied in these apartments. We use 20", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 614, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 505, + 629 + ], + "score": 1.0, + "content": "houses each for training and testing. These sets are sampled from the respective sets in House 3D,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "score": 1.0, + "content": "and do not overlap. That is, testing is done on a set of houses not seen during training. This allows", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 638, + 504, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 504, + 650 + ], + "score": 1.0, + "content": "us to study generalization, i.e., how well our learned policies perform in novel, previously unseen", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 649, + 504, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 504, + 661 + ], + "score": 1.0, + "content": "houses. We made one customization to the House 3D environment: by default doors in House 3D", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 673 + ], + "score": 1.0, + "content": "are rendered but not used for collision checking. We modified House 3D to also not render doors, in", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 670, + 305, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 305, + 684 + ], + "score": 1.0, + "content": "addition to not using them for collision checking.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 582, + 506, + 684 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 688, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 485, + 699 + ], + "score": 1.0, + "content": "Observation Space. We assume that the agent has an RGB-D camera with a field of view of", + "type": "text" + }, + { + "bbox": [ + 486, + 688, + 501, + 698 + ], + "score": 0.86, + "content": "6 0 ^ { \\circ }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 688, + 505, + 699 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "and a bump sensor. The RGB-D camera returns a regular RGB image and a depth image that records", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "the distance (depth information is clipped at 3m) of each pixel from the camera. The bump sensor", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 721, + 376, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 376, + 733 + ], + "score": 1.0, + "content": "returns if a collision happened while executing the previous action.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 688, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "Action Space. We followed the same action space as in EmbodiedQA (Das et al., 2018), with", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 253, + 106 + ], + "score": 1.0, + "content": "6 motion primitives: move forward", + "type": "text" + }, + { + "bbox": [ + 253, + 94, + 280, + 104 + ], + "score": 0.7, + "content": "0 . 2 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 93, + 351, + 106 + ], + "score": 1.0, + "content": ", move backward", + "type": "text" + }, + { + "bbox": [ + 352, + 94, + 379, + 105 + ], + "score": 0.68, + "content": "0 . 2 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 93, + 425, + 106 + ], + "score": 1.0, + "content": ", strafe left", + "type": "text" + }, + { + "bbox": [ + 425, + 94, + 453, + 105 + ], + "score": 0.65, + "content": "0 . 2 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 93, + 505, + 106 + ], + "score": 1.0, + "content": ", strafe right", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 258, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 134, + 115 + ], + "score": 0.63, + "content": "0 . 2 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 104, + 172, + 117 + ], + "score": 1.0, + "content": ", turn left", + "type": "text" + }, + { + "bbox": [ + 172, + 105, + 182, + 115 + ], + "score": 0.83, + "content": "9 ^ { \\circ }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 104, + 244, + 117 + ], + "score": 1.0, + "content": ", and turn right", + "type": "text" + }, + { + "bbox": [ + 244, + 105, + 255, + 115 + ], + "score": 0.84, + "content": "9 ^ { \\circ }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 104, + 258, + 117 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 105, + 121, + 504, + 144 + ], + "lines": [ + { + "bbox": [ + 105, + 120, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 505, + 135 + ], + "score": 1.0, + "content": "Extrinsic Environmental Reward. We do not use any externally specified reward signals from the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 217, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 162, + 144 + ], + "score": 1.0, + "content": "environment:", + "type": "text" + }, + { + "bbox": [ + 163, + 132, + 213, + 144 + ], + "score": 0.92, + "content": "R _ { e x t } ( t ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 132, + 217, + 144 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 149, + 504, + 194 + ], + "lines": [ + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "score": 1.0, + "content": "Intrinsic Reward. As described in Sec. 3.3, the intrinsic reward of the agent is based upon the map", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "score": 1.0, + "content": "that it constructs as it moves around (as described in Sec. 3.1), and readings from the bump sensor.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 102, + 167, + 509, + 188 + ], + "spans": [ + { + "bbox": [ + 102, + 167, + 139, + 188 + ], + "score": 1.0, + "content": "Reward", + "type": "text" + }, + { + "bbox": [ + 140, + 171, + 267, + 183 + ], + "score": 0.93, + "content": "R _ { i n t } ( t ) = \\alpha R _ { i n t } ^ { \\mathrm { c o v } } ( t ) + \\beta R _ { i n t } ^ { \\mathrm { c o l l } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 167, + 293, + 188 + ], + "score": 1.0, + "content": ". Here", + "type": "text" + }, + { + "bbox": [ + 293, + 171, + 313, + 183 + ], + "score": 0.92, + "content": "R _ { i n t } ^ { \\mathrm { c o v } }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 167, + 424, + 188 + ], + "score": 1.0, + "content": "is the coverage reward, and", + "type": "text" + }, + { + "bbox": [ + 424, + 171, + 444, + 183 + ], + "score": 0.92, + "content": "R _ { i n t } ^ { \\mathrm { c o l l } }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 167, + 509, + 188 + ], + "score": 1.0, + "content": "is the collision", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 182, + 407, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 139, + 195 + ], + "score": 1.0, + "content": "reward.", + "type": "text" + }, + { + "bbox": [ + 140, + 183, + 158, + 194 + ], + "score": 0.89, + "content": "\\alpha , \\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 182, + 407, + 195 + ], + "score": 1.0, + "content": "are hyper-parameters to trade-off how aggressive the agent is.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 105, + 199, + 501, + 210 + ], + "lines": [ + { + "bbox": [ + 106, + 197, + 502, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 197, + 502, + 212 + ], + "score": 1.0, + "content": "Training. As described in Sec. 3.4, we train policies using imitation of human trajectories and RL.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 108, + 220, + 505, + 286 + ], + "lines": [ + { + "bbox": [ + 106, + 220, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 505, + 232 + ], + "score": 1.0, + "content": "1. Imitation from Human Exploration Trajectories. We leverage human exploration trajectories", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 118, + 231, + 504, + 243 + ], + "spans": [ + { + "bbox": [ + 118, + 231, + 504, + 243 + ], + "score": 1.0, + "content": "collected from AMT workers as they answered questions for the EmbodiedQA task (Das et al.,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 118, + 241, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 118, + 241, + 505, + 255 + ], + "score": 1.0, + "content": "2018). We ignore the question that was posed to the AMT worker, and train our policy to simply", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 118, + 254, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 118, + 254, + 505, + 266 + ], + "score": 1.0, + "content": "mimic the actions that the humans took. As the humans were trying to answer these questions", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 118, + 266, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 118, + 266, + 505, + 276 + ], + "score": 1.0, + "content": "in previously unseen environments, we assume that these trajectories largely exhibit exploration", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 118, + 275, + 398, + 287 + ], + "spans": [ + { + "bbox": [ + 118, + 275, + 398, + 287 + ], + "score": 1.0, + "content": "behavior. We used a total of 693 human trajectories for this imitation.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 107, + 291, + 504, + 346 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 504, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 504, + 303 + ], + "score": 1.0, + "content": "2. Reinforcement Learning: After learning via imitation, we further train the policy using rein-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 118, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 118, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "forcement learning on the training houses. We use PPO (Schulman et al., 2017) to optimize the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 118, + 313, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 118, + 313, + 505, + 325 + ], + "score": 1.0, + "content": "intrinsic reward defined above. At the start of each episode, the agent is initialized at a random", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 118, + 324, + 506, + 337 + ], + "spans": [ + { + "bbox": [ + 118, + 324, + 506, + 337 + ], + "score": 1.0, + "content": "location inside one of the training houses. Each episode is run for 500 time-steps. We run a total", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 118, + 334, + 405, + 348 + ], + "spans": [ + { + "bbox": [ + 118, + 334, + 405, + 348 + ], + "score": 1.0, + "content": "of 6400 episodes which amounts to a total of 3.2M steps of experience.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 106, + 356, + 505, + 389 + ], + "lines": [ + { + "bbox": [ + 105, + 355, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 505, + 369 + ], + "score": 1.0, + "content": "Baselines. We next describe the various baseline methods that we experimented with. We imple-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 368, + 505, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 380 + ], + "score": 1.0, + "content": "mented a classical baseline that purely reasons using geometry, and a learning baseline that uses", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 379, + 208, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 208, + 390 + ], + "score": 1.0, + "content": "curiosity for exploration.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 399, + 505, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 400, + 504, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 400, + 504, + 411 + ], + "score": 1.0, + "content": "1. Frontier-based Exploration. As a classical baseline, we experimented with frontier-based explo-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 118, + 410, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 118, + 410, + 506, + 423 + ], + "score": 1.0, + "content": "ration (Yamauchi, 1997; Dornhege & Kleiner, 2013). This is a purely geometric method that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 118, + 421, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 118, + 421, + 206, + 434 + ], + "score": 1.0, + "content": "utilizes the built map", + "type": "text" + }, + { + "bbox": [ + 206, + 422, + 220, + 433 + ], + "score": 0.83, + "content": "M _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 421, + 505, + 434 + ], + "score": 1.0, + "content": ". Every iteration, it samples a point in currently unexplored space, and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 118, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 118, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "plans a path towards it from the current location (unobserved space is assumed to be free). As", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 118, + 443, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 118, + 443, + 506, + 456 + ], + "score": 1.0, + "content": "the plan is executed, both the map and the plan are updated. Once the chosen point is reached,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 118, + 454, + 217, + 467 + ], + "spans": [ + { + "bbox": [ + 118, + 454, + 217, + 467 + ], + "score": 1.0, + "content": "this process is repeated.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 470, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 505, + 482 + ], + "score": 1.0, + "content": "2. Curiosity-based Exploration. The next baseline we tried was curiosity-based exploration. In", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 118, + 481, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 118, + 481, + 506, + 493 + ], + "score": 1.0, + "content": "particular, we use the version proposed by Pathak et al. (2017) that uses prediction error of a", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 118, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 118, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "forward model as reward. We use the modifications proposed by Burda et al. (2019), and only", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 117, + 502, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 117, + 502, + 505, + 516 + ], + "score": 1.0, + "content": "train a forward model. We prevent degeneracy in forward model by learning it in the fixed feature", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 118, + 514, + 478, + 526 + ], + "spans": [ + { + "bbox": [ + 118, + 514, + 478, + 526 + ], + "score": 1.0, + "content": "space of a ResNet-18 model that has been pre-trained on the ImageNet classification task.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32 + }, + { + "type": "title", + "bbox": [ + 107, + 540, + 221, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 223, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 223, + 554 + ], + "score": 1.0, + "content": "4.2 COVERAGE QUALITY", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 561, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "We first measure exploration by itself, by measuring the true coverage of the agent. We compute the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "true coverage using the map as described in Sec. 3.1, except for using the true location of the agent", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 583, + 491, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 259, + 595 + ], + "score": 1.0, + "content": "rather than the estimated location (i.e.", + "type": "text" + }, + { + "bbox": [ + 260, + 584, + 271, + 594 + ], + "score": 0.84, + "content": "x _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 583, + 313, + 595 + ], + "score": 1.0, + "content": "instead of", + "type": "text" + }, + { + "bbox": [ + 313, + 583, + 324, + 594 + ], + "score": 0.84, + "content": "\\hat { x } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 583, + 491, + 595 + ], + "score": 1.0, + "content": "). We study the following three scenarios:", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "Without Estimation Noise: We first evaluate the performance of the agent that is trained and tested", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 612, + 506, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 247, + 624 + ], + "score": 1.0, + "content": "without observation noise, that is,", + "type": "text" + }, + { + "bbox": [ + 248, + 612, + 283, + 622 + ], + "score": 0.92, + "content": "\\hat { x } _ { t } = x _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 612, + 506, + 624 + ], + "score": 1.0, + "content": ". Note that this setting is not very realistic as there is", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "always observation error in an agent’s estimate of its location. It is also highly favorable to the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "frontier-based exploration agent, which very heavily relies on the accuracy of its maps. Fig. 2(left)", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 104, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "presents the performance of different policies for this scenario. We first note that the curiosity based", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 132, + 668 + ], + "score": 1.0, + "content": "agent", + "type": "text" + }, + { + "bbox": [ + 133, + 655, + 172, + 666 + ], + "score": 0.85, + "content": "\\mathbf { \\left( I L + R L \\right. }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 655, + 506, + 668 + ], + "score": 1.0, + "content": "with Curiosity) explores better than a random exploration policy (that executes a", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 666, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 679 + ], + "score": 1.0, + "content": "random action at each time step). Straight is a baseline where the agent moves along a straight", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 675, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 104, + 675, + 266, + 690 + ], + "score": 1.0, + "content": "line and executes a random number of", + "type": "text" + }, + { + "bbox": [ + 266, + 677, + 277, + 687 + ], + "score": 0.85, + "content": "9 ^ { \\circ }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 675, + 505, + 690 + ], + "score": 1.0, + "content": "turns when a collision occurs, which is a strategy used", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "by many robot vacuums. Such strategy does not require RGB or depth information, and performs", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "better than the curiosity based agent. However, both policies are worse than an RGB only version", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 710, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 414, + 722 + ], + "score": 1.0, + "content": "of our method, an RGB only policy that is trained with our coverage reward", + "type": "text" + }, + { + "bbox": [ + 414, + 710, + 452, + 721 + ], + "score": 0.85, + "content": "( \\mathbf { I L } + \\mathbf { R L }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 710, + 504, + 722 + ], + "score": 1.0, + "content": "with RGB).", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 176, + 733 + ], + "score": 1.0, + "content": "Our full system", + "type": "text" + }, + { + "bbox": [ + 176, + 721, + 215, + 731 + ], + "score": 0.86, + "content": "\\mathbf { I L } + \\mathbf { R L }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 720, + 238, + 733 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 239, + 721, + 295, + 732 + ], + "score": 0.74, + "content": "\\mathbf { M a p } + \\mathbf { R G B } ", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 720, + 505, + 733 + ], + "score": 1.0, + "content": ") that also uses maps as input performs even better.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 44.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 2019", + "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": "text", + "bbox": [ + 106, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "Action Space. We followed the same action space as in EmbodiedQA (Das et al., 2018), with", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 253, + 106 + ], + "score": 1.0, + "content": "6 motion primitives: move forward", + "type": "text" + }, + { + "bbox": [ + 253, + 94, + 280, + 104 + ], + "score": 0.7, + "content": "0 . 2 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 93, + 351, + 106 + ], + "score": 1.0, + "content": ", move backward", + "type": "text" + }, + { + "bbox": [ + 352, + 94, + 379, + 105 + ], + "score": 0.68, + "content": "0 . 2 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 93, + 425, + 106 + ], + "score": 1.0, + "content": ", strafe left", + "type": "text" + }, + { + "bbox": [ + 425, + 94, + 453, + 105 + ], + "score": 0.65, + "content": "0 . 2 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 93, + 505, + 106 + ], + "score": 1.0, + "content": ", strafe right", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 258, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 134, + 115 + ], + "score": 0.63, + "content": "0 . 2 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 104, + 172, + 117 + ], + "score": 1.0, + "content": ", turn left", + "type": "text" + }, + { + "bbox": [ + 172, + 105, + 182, + 115 + ], + "score": 0.83, + "content": "9 ^ { \\circ }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 104, + 244, + 117 + ], + "score": 1.0, + "content": ", and turn right", + "type": "text" + }, + { + "bbox": [ + 244, + 105, + 255, + 115 + ], + "score": 0.84, + "content": "9 ^ { \\circ }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 104, + 258, + 117 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 121, + 504, + 144 + ], + "lines": [ + { + "bbox": [ + 105, + 120, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 505, + 135 + ], + "score": 1.0, + "content": "Extrinsic Environmental Reward. We do not use any externally specified reward signals from the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 217, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 162, + 144 + ], + "score": 1.0, + "content": "environment:", + "type": "text" + }, + { + "bbox": [ + 163, + 132, + 213, + 144 + ], + "score": 0.92, + "content": "R _ { e x t } ( t ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 132, + 217, + 144 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 120, + 505, + 144 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 149, + 504, + 194 + ], + "lines": [ + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 506, + 162 + ], + "score": 1.0, + "content": "Intrinsic Reward. As described in Sec. 3.3, the intrinsic reward of the agent is based upon the map", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 173 + ], + "score": 1.0, + "content": "that it constructs as it moves around (as described in Sec. 3.1), and readings from the bump sensor.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 102, + 167, + 509, + 188 + ], + "spans": [ + { + "bbox": [ + 102, + 167, + 139, + 188 + ], + "score": 1.0, + "content": "Reward", + "type": "text" + }, + { + "bbox": [ + 140, + 171, + 267, + 183 + ], + "score": 0.93, + "content": "R _ { i n t } ( t ) = \\alpha R _ { i n t } ^ { \\mathrm { c o v } } ( t ) + \\beta R _ { i n t } ^ { \\mathrm { c o l l } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 167, + 293, + 188 + ], + "score": 1.0, + "content": ". Here", + "type": "text" + }, + { + "bbox": [ + 293, + 171, + 313, + 183 + ], + "score": 0.92, + "content": "R _ { i n t } ^ { \\mathrm { c o v } }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 167, + 424, + 188 + ], + "score": 1.0, + "content": "is the coverage reward, and", + "type": "text" + }, + { + "bbox": [ + 424, + 171, + 444, + 183 + ], + "score": 0.92, + "content": "R _ { i n t } ^ { \\mathrm { c o l l } }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 167, + 509, + 188 + ], + "score": 1.0, + "content": "is the collision", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 182, + 407, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 139, + 195 + ], + "score": 1.0, + "content": "reward.", + "type": "text" + }, + { + "bbox": [ + 140, + 183, + 158, + 194 + ], + "score": 0.89, + "content": "\\alpha , \\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 182, + 407, + 195 + ], + "score": 1.0, + "content": "are hyper-parameters to trade-off how aggressive the agent is.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 6.5, + "bbox_fs": [ + 102, + 147, + 509, + 195 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 199, + 501, + 210 + ], + "lines": [ + { + "bbox": [ + 106, + 197, + 502, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 197, + 502, + 212 + ], + "score": 1.0, + "content": "Training. As described in Sec. 3.4, we train policies using imitation of human trajectories and RL.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 106, + 197, + 502, + 212 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 220, + 505, + 286 + ], + "lines": [ + { + "bbox": [ + 106, + 220, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 505, + 232 + ], + "score": 1.0, + "content": "1. Imitation from Human Exploration Trajectories. We leverage human exploration trajectories", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 118, + 231, + 504, + 243 + ], + "spans": [ + { + "bbox": [ + 118, + 231, + 504, + 243 + ], + "score": 1.0, + "content": "collected from AMT workers as they answered questions for the EmbodiedQA task (Das et al.,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 118, + 241, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 118, + 241, + 505, + 255 + ], + "score": 1.0, + "content": "2018). We ignore the question that was posed to the AMT worker, and train our policy to simply", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 118, + 254, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 118, + 254, + 505, + 266 + ], + "score": 1.0, + "content": "mimic the actions that the humans took. As the humans were trying to answer these questions", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 118, + 266, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 118, + 266, + 505, + 276 + ], + "score": 1.0, + "content": "in previously unseen environments, we assume that these trajectories largely exhibit exploration", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 118, + 275, + 398, + 287 + ], + "spans": [ + { + "bbox": [ + 118, + 275, + 398, + 287 + ], + "score": 1.0, + "content": "behavior. We used a total of 693 human trajectories for this imitation.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12.5, + "bbox_fs": [ + 106, + 220, + 505, + 287 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 291, + 504, + 346 + ], + "lines": [ + { + "bbox": [ + 105, + 291, + 504, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 504, + 303 + ], + "score": 1.0, + "content": "2. Reinforcement Learning: After learning via imitation, we further train the policy using rein-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 118, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 118, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "forcement learning on the training houses. We use PPO (Schulman et al., 2017) to optimize the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 118, + 313, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 118, + 313, + 505, + 325 + ], + "score": 1.0, + "content": "intrinsic reward defined above. At the start of each episode, the agent is initialized at a random", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 118, + 324, + 506, + 337 + ], + "spans": [ + { + "bbox": [ + 118, + 324, + 506, + 337 + ], + "score": 1.0, + "content": "location inside one of the training houses. Each episode is run for 500 time-steps. We run a total", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 118, + 334, + 405, + 348 + ], + "spans": [ + { + "bbox": [ + 118, + 334, + 405, + 348 + ], + "score": 1.0, + "content": "of 6400 episodes which amounts to a total of 3.2M steps of experience.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 291, + 506, + 348 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 356, + 505, + 389 + ], + "lines": [ + { + "bbox": [ + 105, + 355, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 355, + 505, + 369 + ], + "score": 1.0, + "content": "Baselines. We next describe the various baseline methods that we experimented with. We imple-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 368, + 505, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 380 + ], + "score": 1.0, + "content": "mented a classical baseline that purely reasons using geometry, and a learning baseline that uses", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 379, + 208, + 390 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 208, + 390 + ], + "score": 1.0, + "content": "curiosity for exploration.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 355, + 505, + 390 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 399, + 505, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 400, + 504, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 400, + 504, + 411 + ], + "score": 1.0, + "content": "1. Frontier-based Exploration. As a classical baseline, we experimented with frontier-based explo-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 118, + 410, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 118, + 410, + 506, + 423 + ], + "score": 1.0, + "content": "ration (Yamauchi, 1997; Dornhege & Kleiner, 2013). This is a purely geometric method that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 118, + 421, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 118, + 421, + 206, + 434 + ], + "score": 1.0, + "content": "utilizes the built map", + "type": "text" + }, + { + "bbox": [ + 206, + 422, + 220, + 433 + ], + "score": 0.83, + "content": "M _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 421, + 505, + 434 + ], + "score": 1.0, + "content": ". Every iteration, it samples a point in currently unexplored space, and", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 118, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 118, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "plans a path towards it from the current location (unobserved space is assumed to be free). As", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 118, + 443, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 118, + 443, + 506, + 456 + ], + "score": 1.0, + "content": "the plan is executed, both the map and the plan are updated. Once the chosen point is reached,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 118, + 454, + 217, + 467 + ], + "spans": [ + { + "bbox": [ + 118, + 454, + 217, + 467 + ], + "score": 1.0, + "content": "this process is repeated.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 400, + 506, + 467 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 470, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 505, + 482 + ], + "score": 1.0, + "content": "2. Curiosity-based Exploration. The next baseline we tried was curiosity-based exploration. In", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 118, + 481, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 118, + 481, + 506, + 493 + ], + "score": 1.0, + "content": "particular, we use the version proposed by Pathak et al. (2017) that uses prediction error of a", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 118, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 118, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "forward model as reward. We use the modifications proposed by Burda et al. (2019), and only", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 117, + 502, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 117, + 502, + 505, + 516 + ], + "score": 1.0, + "content": "train a forward model. We prevent degeneracy in forward model by learning it in the fixed feature", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 118, + 514, + 478, + 526 + ], + "spans": [ + { + "bbox": [ + 118, + 514, + 478, + 526 + ], + "score": 1.0, + "content": "space of a ResNet-18 model that has been pre-trained on the ImageNet classification task.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 470, + 506, + 526 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 540, + 221, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 223, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 223, + 554 + ], + "score": 1.0, + "content": "4.2 COVERAGE QUALITY", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 107, + 561, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "We first measure exploration by itself, by measuring the true coverage of the agent. We compute the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "true coverage using the map as described in Sec. 3.1, except for using the true location of the agent", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 583, + 491, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 259, + 595 + ], + "score": 1.0, + "content": "rather than the estimated location (i.e.", + "type": "text" + }, + { + "bbox": [ + 260, + 584, + 271, + 594 + ], + "score": 0.84, + "content": "x _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 583, + 313, + 595 + ], + "score": 1.0, + "content": "instead of", + "type": "text" + }, + { + "bbox": [ + 313, + 583, + 324, + 594 + ], + "score": 0.84, + "content": "\\hat { x } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 583, + 491, + 595 + ], + "score": 1.0, + "content": "). We study the following three scenarios:", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 106, + 561, + 505, + 595 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "Without Estimation Noise: We first evaluate the performance of the agent that is trained and tested", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 612, + 506, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 247, + 624 + ], + "score": 1.0, + "content": "without observation noise, that is,", + "type": "text" + }, + { + "bbox": [ + 248, + 612, + 283, + 622 + ], + "score": 0.92, + "content": "\\hat { x } _ { t } = x _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 612, + 506, + 624 + ], + "score": 1.0, + "content": ". Note that this setting is not very realistic as there is", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 622, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 634 + ], + "score": 1.0, + "content": "always observation error in an agent’s estimate of its location. It is also highly favorable to the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "frontier-based exploration agent, which very heavily relies on the accuracy of its maps. Fig. 2(left)", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 643, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 104, + 643, + 506, + 657 + ], + "score": 1.0, + "content": "presents the performance of different policies for this scenario. We first note that the curiosity based", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 655, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 132, + 668 + ], + "score": 1.0, + "content": "agent", + "type": "text" + }, + { + "bbox": [ + 133, + 655, + 172, + 666 + ], + "score": 0.85, + "content": "\\mathbf { \\left( I L + R L \\right. }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 655, + 506, + 668 + ], + "score": 1.0, + "content": "with Curiosity) explores better than a random exploration policy (that executes a", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 666, + 505, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 679 + ], + "score": 1.0, + "content": "random action at each time step). Straight is a baseline where the agent moves along a straight", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 675, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 104, + 675, + 266, + 690 + ], + "score": 1.0, + "content": "line and executes a random number of", + "type": "text" + }, + { + "bbox": [ + 266, + 677, + 277, + 687 + ], + "score": 0.85, + "content": "9 ^ { \\circ }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 675, + 505, + 690 + ], + "score": 1.0, + "content": "turns when a collision occurs, which is a strategy used", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "by many robot vacuums. Such strategy does not require RGB or depth information, and performs", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "better than the curiosity based agent. However, both policies are worse than an RGB only version", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 710, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 414, + 722 + ], + "score": 1.0, + "content": "of our method, an RGB only policy that is trained with our coverage reward", + "type": "text" + }, + { + "bbox": [ + 414, + 710, + 452, + 721 + ], + "score": 0.85, + "content": "( \\mathbf { I L } + \\mathbf { R L }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 710, + 504, + 722 + ], + "score": 1.0, + "content": "with RGB).", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 176, + 733 + ], + "score": 1.0, + "content": "Our full system", + "type": "text" + }, + { + "bbox": [ + 176, + 721, + 215, + 731 + ], + "score": 0.86, + "content": "\\mathbf { I L } + \\mathbf { R L }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 720, + 238, + 733 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 239, + 721, + 295, + 732 + ], + "score": 0.74, + "content": "\\mathbf { M a p } + \\mathbf { R G B } ", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 720, + 505, + 733 + ], + "score": 1.0, + "content": ") that also uses maps as input performs even better.", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 44.5, + "bbox_fs": [ + 104, + 600, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 126, + 51, + 487, + 170 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 126, + 51, + 487, + 170 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 126, + 51, + 487, + 170 + ], + "spans": [ + { + "bbox": [ + 126, + 51, + 487, + 170 + ], + "score": 0.974, + "type": "image", + "image_path": "28a1a6c04d78fda6672505548de839f6b5a1f9213538ced1e8dbab28252252c8.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 126, + 51, + 487, + 90.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 126, + 90.66666666666666, + 487, + 130.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 126, + 130.33333333333331, + 487, + 169.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 173, + 505, + 233 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 173, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 184 + ], + "score": 1.0, + "content": "Figure 2: Coverage Performance. Policies are tested on 100 exploration runs (5 random start locations each", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 182, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 195 + ], + "score": 1.0, + "content": "on 20 testing houses). Left figure plots average coverage as a function of number of time steps in the episode.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "score": 1.0, + "content": "Center figure studies impact of noise in state estimation. We plot average coverage at end of episode as a", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 203, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 505, + 215 + ], + "score": 1.0, + "content": "function of amount of noise. Right figure studies the case when there is a mis-match between geometry and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 212, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 225 + ], + "score": 1.0, + "content": "affordance, and plots average coverage as a function of time steps in episode. All plots report mean performance", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 223, + 417, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 223, + 417, + 234 + ], + "score": 1.0, + "content": "over 3 runs, and the shaded area represents the minimum and maximum performance.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 107, + 256, + 505, + 311 + ], + "lines": [ + { + "bbox": [ + 106, + 257, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 505, + 268 + ], + "score": 1.0, + "content": "Frontier-based exploration (Frontier-based Explr) has the best performance in this scenario. As", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 266, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 505, + 280 + ], + "score": 1.0, + "content": "noted, this is to expect as this method gets access to perfect, fully-registered maps, and employs", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 278, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 505, + 291 + ], + "score": 1.0, + "content": "optimal path planning algorithm to move from one place to another. It is also worth noting that, it is", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "score": 1.0, + "content": "hard to use such classical techniques in situations where we only have a RGB images. In contrast,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 300, + 498, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 498, + 313 + ], + "score": 1.0, + "content": "learning allows us to easily arrive at policies that can explore using only RGB images at test time.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 317, + 505, + 470 + ], + "lines": [ + { + "bbox": [ + 106, + 316, + 504, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 504, + 329 + ], + "score": 1.0, + "content": "With Estimation Noise: We next describe a more realistic scenario that has estimation noise, i.e.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 327, + 506, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 127, + 339 + ], + "score": 0.91, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 327, + 506, + 340 + ], + "score": 1.0, + "content": "is estimated using a noisy dynamics function. In particular, we add truncated Gaussian noise", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 339, + 504, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 210, + 351 + ], + "score": 1.0, + "content": "to the transition function", + "type": "text" + }, + { + "bbox": [ + 210, + 339, + 218, + 351 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 339, + 504, + 351 + ], + "score": 1.0, + "content": "at each time step. The details of the noise generation is elaborated in", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 349, + 506, + 362 + ], + "spans": [ + { + "bbox": [ + 104, + 349, + 506, + 362 + ], + "score": 1.0, + "content": "Appendix C.4. The noise compounds over time. Even though such a noise model leads to com-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 361, + 506, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 506, + 372 + ], + "score": 1.0, + "content": "pounding errors over time (as in the case of a real robot), we acknowledge that this simple noise", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 371, + 506, + 384 + ], + "spans": [ + { + "bbox": [ + 104, + 371, + 506, + 384 + ], + "score": 1.0, + "content": "model may not perfectly match noise in the real world. Fig. 2(center) presents the coverage area at", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 382, + 506, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 506, + 395 + ], + "score": 1.0, + "content": "the end of episode (1000 time steps) as a function of the amount of noise introduced1. When the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "system suffers from sensor noise, the performance of the frontier-based exploration method drops", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 405, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 506, + 417 + ], + "score": 1.0, + "content": "rapidly. In contrast, our learning-based agent that wasn’t even trained with any noise continues to", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 415, + 506, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 304, + 428 + ], + "score": 1.0, + "content": "performs well. Even at relatively modest noise of", + "type": "text" + }, + { + "bbox": [ + 304, + 416, + 319, + 426 + ], + "score": 0.86, + "content": "4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 415, + 506, + 428 + ], + "score": 1.0, + "content": "our learning based method already does better", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 425, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 438 + ], + "score": 1.0, + "content": "than the frontier-based agent. We additionally note that our agent can even be trained when the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 437, + 504, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 504, + 449 + ], + "score": 1.0, + "content": "intrinsic reward estimation itself suffers from state estimation noise: for instance performance with", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 447, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 126, + 459 + ], + "score": 0.85, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 447, + 439, + 461 + ], + "score": 1.0, + "content": "estimation noise (for intrinsic reward computation and map construction) is", + "type": "text" + }, + { + "bbox": [ + 440, + 448, + 472, + 459 + ], + "score": 0.9, + "content": "9 8 . 9 m ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 447, + 506, + 461 + ], + "score": 1.0, + "content": ", only a", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 459, + 492, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 204, + 473 + ], + "score": 1.0, + "content": "minor degradation from", + "type": "text" + }, + { + "bbox": [ + 204, + 459, + 241, + 470 + ], + "score": 0.88, + "content": "1 1 7 . 4 m ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 459, + 246, + 473 + ], + "score": 1.0, + "content": "(", + "type": "text" + }, + { + "bbox": [ + 246, + 459, + 266, + 470 + ], + "score": 0.85, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 459, + 492, + 473 + ], + "score": 1.0, + "content": "estimation noise for map construction at test time only).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 476, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "score": 1.0, + "content": "Geometry and Affordance Mismatch: Next, to emphasize the utility of learning for this task, we", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 487, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 506, + 500 + ], + "score": 1.0, + "content": "experiment with a scenario where we explicitly create a mismatch between geometry and affordance", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 496, + 505, + 511 + ], + "spans": [ + { + "bbox": [ + 104, + 496, + 505, + 511 + ], + "score": 1.0, + "content": "of the environment. We do this by rendering doors, but not using them for collision checking (i.e.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 509, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 505, + 522 + ], + "score": 1.0, + "content": "the default House 3D environment). This setting helps us investigate if learning based techniques", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 520, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 104, + 520, + 506, + 533 + ], + "score": 1.0, + "content": "go beyond simple geometric reasoning in any way. Fig. 2(right) presents performance curves. We", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 532, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 505, + 543 + ], + "score": 1.0, + "content": "see that there is a large drop in performance for the frontier-based agent. This is because it is not", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "score": 1.0, + "content": "able to distinguish doors from other obstacles, leading to path planning failures. However, there is a", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 554, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 554, + 505, + 565 + ], + "score": 1.0, + "content": "relatively minor drop in performance of our learning-based agent. This is because it can learn about", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 563, + 506, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 506, + 577 + ], + "score": 1.0, + "content": "doors (how to identify them in RGB images and the fact that they can be traversed) from human", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 574, + 357, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 357, + 589 + ], + "score": 1.0, + "content": "demonstrations and experience during reinforcement learning.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 32.5 + }, + { + "type": "title", + "bbox": [ + 108, + 599, + 217, + 610 + ], + "lines": [ + { + "bbox": [ + 106, + 598, + 218, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 218, + 612 + ], + "score": 1.0, + "content": "4.2.1 ABLATION STUDY", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 505, + 652 + ], + "lines": [ + { + "bbox": [ + 105, + 618, + 504, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 504, + 632 + ], + "score": 1.0, + "content": "We also conducted ablations of our method to identify what parts of our proposed technique con-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 630, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 642 + ], + "score": 1.0, + "content": "tribute to the performance. We do these ablations in the setting without any estimation noise, and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 641, + 216, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 216, + 653 + ], + "score": 1.0, + "content": "use coverage as the metric.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 108, + 658, + 503, + 691 + ], + "lines": [ + { + "bbox": [ + 106, + 658, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 670 + ], + "score": 1.0, + "content": "Imitation Learning: We check if pre-training with imitation learning is useful for this task. We test", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "this by comparing to the models that were trained only with RL using the coverage reward. The left", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 680, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 505, + 693 + ], + "score": 1.0, + "content": "two plots in Fig. 3 shows performance of agents with following combinations: RL: policy trained", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 702, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 118, + 700, + 504, + 714 + ], + "spans": [ + { + "bbox": [ + 118, + 700, + 164, + 714 + ], + "score": 1.0, + "content": "1A noise of", + "type": "text" + }, + { + "bbox": [ + 165, + 704, + 171, + 712 + ], + "score": 0.76, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 700, + 497, + 714 + ], + "score": 1.0, + "content": "means we sample perturbations from a truncated Gaussian distribution with zero-mean,", + "type": "text" + }, + { + "bbox": [ + 498, + 704, + 504, + 712 + ], + "score": 0.53, + "content": "\\eta", + "type": "inline_equation" + } + ] + }, + { + "bbox": [ + 106, + 712, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 712, + 252, + 722 + ], + "score": 1.0, + "content": "standard deviation, and a total width of", + "type": "text" + }, + { + "bbox": [ + 252, + 712, + 263, + 722 + ], + "score": 0.81, + "content": "2 \\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 712, + 505, + 722 + ], + "score": 1.0, + "content": ". This sampled perturbation is scaled by the step length (25cm for", + "type": "text" + } + ] + }, + { + "bbox": [ + 107, + 721, + 348, + 733 + ], + "spans": [ + { + "bbox": [ + 107, + 723, + 122, + 732 + ], + "score": 0.85, + "content": "x , y", + "type": "inline_equation" + }, + { + "bbox": [ + 123, + 721, + 138, + 733 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 138, + 721, + 148, + 731 + ], + "score": 0.83, + "content": "9 ^ { \\circ }", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 721, + 193, + 733 + ], + "score": 1.0, + "content": "for azimuth", + "type": "text" + }, + { + "bbox": [ + 193, + 722, + 199, + 730 + ], + "score": 0.66, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 721, + 348, + 733 + ], + "score": 1.0, + "content": ") and added to the state at each time step.", + "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 2019", + "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": "image", + "bbox": [ + 126, + 51, + 487, + 170 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 126, + 51, + 487, + 170 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 126, + 51, + 487, + 170 + ], + "spans": [ + { + "bbox": [ + 126, + 51, + 487, + 170 + ], + "score": 0.974, + "type": "image", + "image_path": "28a1a6c04d78fda6672505548de839f6b5a1f9213538ced1e8dbab28252252c8.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 126, + 51, + 487, + 90.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 126, + 90.66666666666666, + 487, + 130.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 126, + 130.33333333333331, + 487, + 169.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 173, + 505, + 233 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 173, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 184 + ], + "score": 1.0, + "content": "Figure 2: Coverage Performance. Policies are tested on 100 exploration runs (5 random start locations each", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 182, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 505, + 195 + ], + "score": 1.0, + "content": "on 20 testing houses). Left figure plots average coverage as a function of number of time steps in the episode.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 506, + 205 + ], + "score": 1.0, + "content": "Center figure studies impact of noise in state estimation. We plot average coverage at end of episode as a", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 203, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 505, + 215 + ], + "score": 1.0, + "content": "function of amount of noise. Right figure studies the case when there is a mis-match between geometry and", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 212, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 212, + 505, + 225 + ], + "score": 1.0, + "content": "affordance, and plots average coverage as a function of time steps in episode. All plots report mean performance", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 223, + 417, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 223, + 417, + 234 + ], + "score": 1.0, + "content": "over 3 runs, and the shaded area represents the minimum and maximum performance.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 107, + 256, + 505, + 311 + ], + "lines": [ + { + "bbox": [ + 106, + 257, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 505, + 268 + ], + "score": 1.0, + "content": "Frontier-based exploration (Frontier-based Explr) has the best performance in this scenario. As", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 266, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 505, + 280 + ], + "score": 1.0, + "content": "noted, this is to expect as this method gets access to perfect, fully-registered maps, and employs", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 278, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 505, + 291 + ], + "score": 1.0, + "content": "optimal path planning algorithm to move from one place to another. It is also worth noting that, it is", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 505, + 302 + ], + "score": 1.0, + "content": "hard to use such classical techniques in situations where we only have a RGB images. In contrast,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 300, + 498, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 498, + 313 + ], + "score": 1.0, + "content": "learning allows us to easily arrive at policies that can explore using only RGB images at test time.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 257, + 505, + 313 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 317, + 505, + 470 + ], + "lines": [ + { + "bbox": [ + 106, + 316, + 504, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 316, + 504, + 329 + ], + "score": 1.0, + "content": "With Estimation Noise: We next describe a more realistic scenario that has estimation noise, i.e.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 327, + 506, + 340 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 127, + 339 + ], + "score": 0.91, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 327, + 506, + 340 + ], + "score": 1.0, + "content": "is estimated using a noisy dynamics function. In particular, we add truncated Gaussian noise", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 339, + 504, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 210, + 351 + ], + "score": 1.0, + "content": "to the transition function", + "type": "text" + }, + { + "bbox": [ + 210, + 339, + 218, + 351 + ], + "score": 0.85, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 339, + 504, + 351 + ], + "score": 1.0, + "content": "at each time step. The details of the noise generation is elaborated in", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 349, + 506, + 362 + ], + "spans": [ + { + "bbox": [ + 104, + 349, + 506, + 362 + ], + "score": 1.0, + "content": "Appendix C.4. The noise compounds over time. Even though such a noise model leads to com-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 361, + 506, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 506, + 372 + ], + "score": 1.0, + "content": "pounding errors over time (as in the case of a real robot), we acknowledge that this simple noise", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 371, + 506, + 384 + ], + "spans": [ + { + "bbox": [ + 104, + 371, + 506, + 384 + ], + "score": 1.0, + "content": "model may not perfectly match noise in the real world. Fig. 2(center) presents the coverage area at", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 382, + 506, + 395 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 506, + 395 + ], + "score": 1.0, + "content": "the end of episode (1000 time steps) as a function of the amount of noise introduced1. When the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "system suffers from sensor noise, the performance of the frontier-based exploration method drops", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 405, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 506, + 417 + ], + "score": 1.0, + "content": "rapidly. In contrast, our learning-based agent that wasn’t even trained with any noise continues to", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 415, + 506, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 304, + 428 + ], + "score": 1.0, + "content": "performs well. Even at relatively modest noise of", + "type": "text" + }, + { + "bbox": [ + 304, + 416, + 319, + 426 + ], + "score": 0.86, + "content": "4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 415, + 506, + 428 + ], + "score": 1.0, + "content": "our learning based method already does better", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 425, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 438 + ], + "score": 1.0, + "content": "than the frontier-based agent. We additionally note that our agent can even be trained when the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 437, + 504, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 504, + 449 + ], + "score": 1.0, + "content": "intrinsic reward estimation itself suffers from state estimation noise: for instance performance with", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 447, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 106, + 448, + 126, + 459 + ], + "score": 0.85, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 447, + 439, + 461 + ], + "score": 1.0, + "content": "estimation noise (for intrinsic reward computation and map construction) is", + "type": "text" + }, + { + "bbox": [ + 440, + 448, + 472, + 459 + ], + "score": 0.9, + "content": "9 8 . 9 m ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 447, + 506, + 461 + ], + "score": 1.0, + "content": ", only a", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 459, + 492, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 204, + 473 + ], + "score": 1.0, + "content": "minor degradation from", + "type": "text" + }, + { + "bbox": [ + 204, + 459, + 241, + 470 + ], + "score": 0.88, + "content": "1 1 7 . 4 m ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 459, + 246, + 473 + ], + "score": 1.0, + "content": "(", + "type": "text" + }, + { + "bbox": [ + 246, + 459, + 266, + 470 + ], + "score": 0.85, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 459, + 492, + 473 + ], + "score": 1.0, + "content": "estimation noise for map construction at test time only).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 20.5, + "bbox_fs": [ + 104, + 316, + 506, + 473 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 476, + 505, + 586 + ], + "lines": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 505, + 489 + ], + "score": 1.0, + "content": "Geometry and Affordance Mismatch: Next, to emphasize the utility of learning for this task, we", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 487, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 487, + 506, + 500 + ], + "score": 1.0, + "content": "experiment with a scenario where we explicitly create a mismatch between geometry and affordance", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 496, + 505, + 511 + ], + "spans": [ + { + "bbox": [ + 104, + 496, + 505, + 511 + ], + "score": 1.0, + "content": "of the environment. We do this by rendering doors, but not using them for collision checking (i.e.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 509, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 505, + 522 + ], + "score": 1.0, + "content": "the default House 3D environment). This setting helps us investigate if learning based techniques", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 520, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 104, + 520, + 506, + 533 + ], + "score": 1.0, + "content": "go beyond simple geometric reasoning in any way. Fig. 2(right) presents performance curves. We", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 532, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 505, + 543 + ], + "score": 1.0, + "content": "see that there is a large drop in performance for the frontier-based agent. This is because it is not", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 506, + 555 + ], + "score": 1.0, + "content": "able to distinguish doors from other obstacles, leading to path planning failures. However, there is a", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 554, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 554, + 505, + 565 + ], + "score": 1.0, + "content": "relatively minor drop in performance of our learning-based agent. This is because it can learn about", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 563, + 506, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 506, + 577 + ], + "score": 1.0, + "content": "doors (how to identify them in RGB images and the fact that they can be traversed) from human", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 574, + 357, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 357, + 589 + ], + "score": 1.0, + "content": "demonstrations and experience during reinforcement learning.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 32.5, + "bbox_fs": [ + 104, + 475, + 506, + 589 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 599, + 217, + 610 + ], + "lines": [ + { + "bbox": [ + 106, + 598, + 218, + 612 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 218, + 612 + ], + "score": 1.0, + "content": "4.2.1 ABLATION STUDY", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 505, + 652 + ], + "lines": [ + { + "bbox": [ + 105, + 618, + 504, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 504, + 632 + ], + "score": 1.0, + "content": "We also conducted ablations of our method to identify what parts of our proposed technique con-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 630, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 642 + ], + "score": 1.0, + "content": "tribute to the performance. We do these ablations in the setting without any estimation noise, and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 641, + 216, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 216, + 653 + ], + "score": 1.0, + "content": "use coverage as the metric.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 618, + 505, + 653 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 658, + 503, + 691 + ], + "lines": [ + { + "bbox": [ + 106, + 658, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 106, + 658, + 505, + 670 + ], + "score": 1.0, + "content": "Imitation Learning: We check if pre-training with imitation learning is useful for this task. We test", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "this by comparing to the models that were trained only with RL using the coverage reward. The left", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 680, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 505, + 693 + ], + "score": 1.0, + "content": "two plots in Fig. 3 shows performance of agents with following combinations: RL: policy trained", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 210, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 172, + 225 + ], + "score": 1.0, + "content": "with PPO only,", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 172, + 212, + 182, + 221 + ], + "score": 0.41, + "content": "\\cal { I L }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 183, + 210, + 505, + 225 + ], + "score": 1.0, + "content": ": policy trained with imitation learning, Map: policy uses constructed maps as", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 222, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 132, + 235 + ], + "score": 1.0, + "content": "input,", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 132, + 222, + 154, + 233 + ], + "score": 0.38, + "content": "R G B", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 154, + 222, + 505, + 235 + ], + "score": 1.0, + "content": ": policy uses RGB images as input. In all settings, pre-training with imitation learning", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "helps improve performance, though training with RL improves coverage further. Also, policies", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 245, + 488, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 488, + 256 + ], + "score": 1.0, + "content": "trained using RL have a fairly large variance. Imitation learning also helps reduce the variance.", + "type": "text", + "cross_page": true + } + ], + "index": 12 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 658, + 505, + 693 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 122, + 51, + 485, + 141 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 122, + 51, + 485, + 141 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 122, + 51, + 485, + 141 + ], + "spans": [ + { + "bbox": [ + 122, + 51, + 485, + 141 + ], + "score": 0.971, + "type": "image", + "image_path": "4dc0163dc92fba4085ae5c1fb0ce1899a27b48bc5f66e509491c59059ebadeab.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 122, + 51, + 485, + 81.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 122, + 81.0, + 485, + 111.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 122, + 111.0, + 485, + 141.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 144, + 505, + 204 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 143, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 155 + ], + "score": 1.0, + "content": "Figure 3: Ablation Study: We report average coverage as a function of time step in episode. As before we", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 165 + ], + "score": 1.0, + "content": "plot mean over 3 runs and minimum and maximum performance. Left figure shows that using the RGB image", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 163, + 506, + 175 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 506, + 175 + ], + "score": 1.0, + "content": "helps improve performance, center figure shows that using the map helps improve performance. We can also", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 174, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 505, + 184 + ], + "score": 1.0, + "content": "see that imitation learning improves coverage and reduces the variance in performance. Right figure shows the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 184, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 184, + 505, + 195 + ], + "score": 1.0, + "content": "comparison between different reward design. We can see that our intrinsic reward enables the agent to explore", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 195, + 234, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 195, + 234, + 204 + ], + "score": 1.0, + "content": "more efficiently in the testing time.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 107, + 211, + 505, + 255 + ], + "lines": [ + { + "bbox": [ + 105, + 210, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 172, + 225 + ], + "score": 1.0, + "content": "with PPO only,", + "type": "text" + }, + { + "bbox": [ + 172, + 212, + 182, + 221 + ], + "score": 0.41, + "content": "\\cal { I L }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 210, + 505, + 225 + ], + "score": 1.0, + "content": ": policy trained with imitation learning, Map: policy uses constructed maps as", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 222, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 132, + 235 + ], + "score": 1.0, + "content": "input,", + "type": "text" + }, + { + "bbox": [ + 132, + 222, + 154, + 233 + ], + "score": 0.38, + "content": "R G B", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 222, + 505, + 235 + ], + "score": 1.0, + "content": ": policy uses RGB images as input. In all settings, pre-training with imitation learning", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "helps improve performance, though training with RL improves coverage further. Also, policies", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 245, + 488, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 488, + 256 + ], + "score": 1.0, + "content": "trained using RL have a fairly large variance. Imitation learning also helps reduce the variance.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 261, + 503, + 284 + ], + "lines": [ + { + "bbox": [ + 105, + 260, + 505, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 505, + 274 + ], + "score": 1.0, + "content": "RGB Observations and Map: Fig. 3 (left) and Fig. 3 (center) respectively show that both RGB", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 273, + 291, + 285 + ], + "spans": [ + { + "bbox": [ + 106, + 273, + 291, + 285 + ], + "score": 1.0, + "content": "images and map inputs improve performance.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 289, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "Intrinsic Reward: We also compare our intrinsic reward design with extrinsic reward design, as", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 300, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 505, + 312 + ], + "score": 1.0, + "content": "shown in Fig. 3 (right). The extrinsic reward is setup as follows: we randomly generated a number", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 311, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 506, + 324 + ], + "score": 1.0, + "content": "of locations evenly distributed across the traversable area of the houses, where the agent will get a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 322, + 507, + 335 + ], + "spans": [ + { + "bbox": [ + 104, + 322, + 507, + 335 + ], + "score": 1.0, + "content": "positive reward if the agent is close to any of these locations. Once the agent gets a reward from a", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 334, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 505, + 344 + ], + "score": 1.0, + "content": "location, this location will be no longer taken into account for future reward calculation. We tried", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 343, + 363, + 357 + ], + "score": 1.0, + "content": "two settings where we place 1 or 4 reward-yielding objects per", + "type": "text" + }, + { + "bbox": [ + 364, + 343, + 378, + 354 + ], + "score": 0.88, + "content": "m ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 343, + 505, + 357 + ], + "score": 1.0, + "content": ". We can see that our coverage", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 354, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 505, + 368 + ], + "score": 1.0, + "content": "map reward provides a better reward signal and in fact can be estimated intrinsically without needing", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 366, + 231, + 377 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 231, + 377 + ], + "score": 1.0, + "content": "to instrument the environment.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 107, + 392, + 335, + 402 + ], + "lines": [ + { + "bbox": [ + 105, + 390, + 336, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 336, + 405 + ], + "score": 1.0, + "content": "4.3 USING EXPLORATION FOR DOWNSTREAM TASK", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 360, + 577 + ], + "lines": [ + { + "bbox": [ + 106, + 413, + 360, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 360, + 424 + ], + "score": 1.0, + "content": "Now that we have established how to explore well, we next ask", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 424, + 360, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 360, + 436 + ], + "score": 1.0, + "content": "if task-agnostic exploration is even useful for downstream tasks.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 434, + 360, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 360, + 447 + ], + "score": 1.0, + "content": "We show this in context of goal-driven navigation. We execute", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 446, + 360, + 458 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 231, + 458 + ], + "score": 1.0, + "content": "the learned exploration policy", + "type": "text" + }, + { + "bbox": [ + 231, + 447, + 243, + 457 + ], + "score": 0.86, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 446, + 360, + 458 + ], + "score": 1.0, + "content": "(for 1500 time steps) to ex-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 456, + 361, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 327, + 470 + ], + "score": 1.0, + "content": "plore a new house, and collect experience (set of images", + "type": "text" + }, + { + "bbox": [ + 327, + 457, + 335, + 466 + ], + "score": 0.66, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 456, + 361, + 470 + ], + "score": 1.0, + "content": "along", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 467, + 361, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 361, + 480 + ], + "score": 1.0, + "content": "with their pose p). Once this exploration has finished, the agent", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 478, + 361, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 361, + 491 + ], + "score": 1.0, + "content": "is given different navigation tasks. These navigation tasks put", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 489, + 361, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 361, + 502 + ], + "score": 1.0, + "content": "the agent at an arbitrary location in the environment, and give", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 500, + 361, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 361, + 513 + ], + "score": 1.0, + "content": "it a goal image that it needs to reach. More specifically, we re-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 511, + 361, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 361, + 524 + ], + "score": 1.0, + "content": "set the agent to 50 random poses (positions and orientations) in", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 523, + 360, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 360, + 534 + ], + "score": 1.0, + "content": "each testing house (20 testing houses in total) and get the RGB", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 534, + 360, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 360, + 545 + ], + "score": 1.0, + "content": "camera view. The agent then needs to use the experience of the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 545, + 360, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 360, + 558 + ], + "score": 1.0, + "content": "environment acquired during exploration to efficiently navigate", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 555, + 361, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 361, + 568 + ], + "score": 1.0, + "content": "to the desired target location. The efficiency of navigation on", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 566, + 318, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 318, + 579 + ], + "score": 1.0, + "content": "these test queries measures the utility of exploration.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 108, + 583, + 360, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 582, + 360, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 582, + 289, + 595 + ], + "score": 1.0, + "content": "This evaluation requires a navigation policy", + "type": "text" + }, + { + "bbox": [ + 289, + 585, + 301, + 594 + ], + "score": 0.85, + "content": "\\pi _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 582, + 360, + 595 + ], + "score": 1.0, + "content": ", that uses the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 594, + 361, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 361, + 606 + ], + "score": 1.0, + "content": "exploration experience and the goal image to output actions that", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 605, + 360, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 360, + 617 + ], + "score": 1.0, + "content": "can convey the agent to the desired target location. We opt for", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 615, + 361, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 173, + 629 + ], + "score": 1.0, + "content": "a simple policy", + "type": "text" + }, + { + "bbox": [ + 173, + 618, + 185, + 627 + ], + "score": 0.83, + "content": "\\pi _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 615, + 193, + 629 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 193, + 617, + 206, + 627 + ], + "score": 0.83, + "content": "\\pi _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 615, + 361, + 629 + ], + "score": 1.0, + "content": "first localizes the target image using", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 627, + 361, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 337, + 639 + ], + "score": 1.0, + "content": "nearest neighbor matching to the set of collected images", + "type": "text" + }, + { + "bbox": [ + 337, + 627, + 346, + 637 + ], + "score": 0.69, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 627, + 361, + 639 + ], + "score": 1.0, + "content": "(in", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 638, + 361, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 361, + 650 + ], + "score": 1.0, + "content": "ImageNet pre-trained ResNet-18 feature space). It then plans a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 647, + 361, + 663 + ], + "spans": [ + { + "bbox": [ + 104, + 647, + 361, + 663 + ], + "score": 1.0, + "content": "path to the this estimated target location using a occupancy map", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 660, + 361, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 169, + 672 + ], + "score": 1.0, + "content": "computed from", + "type": "text" + }, + { + "bbox": [ + 170, + 660, + 178, + 670 + ], + "score": 0.49, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 660, + 361, + 672 + ], + "score": 1.0, + "content": ". We do this experiment in the setting without", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 671, + 214, + 682 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 214, + 682 + ], + "score": 1.0, + "content": "any state estimation noise.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 44 + }, + { + "type": "image", + "bbox": [ + 366, + 421, + 501, + 554 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 366, + 421, + 501, + 554 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 366, + 421, + 501, + 554 + ], + "spans": [ + { + "bbox": [ + 366, + 421, + 501, + 554 + ], + "score": 0.897, + "type": "image", + "image_path": "bc6d99dfdb5f9d8c8baf8104bc2b5634505fe1a806a2827d6ddbce1eb70dcaef.jpg" + } + ] + } + ], + "index": 44.0, + "virtual_lines": [ + { + "bbox": [ + 366, + 421, + 501, + 487.5 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 366, + 487.5, + 501, + 554.0 + ], + "spans": [], + "index": 49 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 363, + 561, + 504, + 660 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 363, + 561, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 363, + 561, + 505, + 572 + ], + "score": 1.0, + "content": "Figure 4: Exploration for down-", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 363, + 571, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 363, + 571, + 505, + 582 + ], + "score": 1.0, + "content": "stream tasks. We evaluate utility of", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 363, + 582, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 363, + 582, + 506, + 592 + ], + "score": 1.0, + "content": "exploration for the down-stream nav-", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 363, + 591, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 363, + 591, + 505, + 602 + ], + "score": 1.0, + "content": "igation tasks. Top plots shows ef-", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 363, + 601, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 363, + 601, + 505, + 612 + ], + "score": 1.0, + "content": "fectiveness of the exploration trajec-", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 363, + 611, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 363, + 611, + 505, + 622 + ], + "score": 1.0, + "content": "tory for localization of goal images", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 363, + 621, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 363, + 621, + 505, + 631 + ], + "score": 1.0, + "content": "in a new environment. Bottom table", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 363, + 631, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 363, + 631, + 505, + 642 + ], + "score": 1.0, + "content": "compares efficiency of reaching goals", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 363, + 640, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 363, + 640, + 505, + 653 + ], + "score": 1.0, + "content": "without and with maps built during ex-", + "type": "text" + } + ], + "index": 58 + }, + { + "bbox": [ + 363, + 651, + 401, + 662 + ], + "spans": [ + { + "bbox": [ + 363, + 651, + 401, + 662 + ], + "score": 1.0, + "content": "ploration.", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 54.5 + } + ], + "index": 49.25 + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "We independently measure the effectiveness of exploration data for a) localization of the given target", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "images, and b) path planning efficiency in reaching desired locations. Localization performance:", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "We measure the distance between the agent’s estimate of the goal image location, and the true goal", + "type": "text" + } + ], + "index": 62 + }, + { + "bbox": [ + 105, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "image location. Fig. 4 (top) plots the success at localization as a function of the success threshold", + "type": "text" + } + ], + "index": 63 + } + ], + "index": 61.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 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 2019", + "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": "image", + "bbox": [ + 122, + 51, + 485, + 141 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 122, + 51, + 485, + 141 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 122, + 51, + 485, + 141 + ], + "spans": [ + { + "bbox": [ + 122, + 51, + 485, + 141 + ], + "score": 0.971, + "type": "image", + "image_path": "4dc0163dc92fba4085ae5c1fb0ce1899a27b48bc5f66e509491c59059ebadeab.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 122, + 51, + 485, + 81.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 122, + 81.0, + 485, + 111.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 122, + 111.0, + 485, + 141.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 144, + 505, + 204 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 143, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 155 + ], + "score": 1.0, + "content": "Figure 3: Ablation Study: We report average coverage as a function of time step in episode. As before we", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 165 + ], + "score": 1.0, + "content": "plot mean over 3 runs and minimum and maximum performance. Left figure shows that using the RGB image", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 163, + 506, + 175 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 506, + 175 + ], + "score": 1.0, + "content": "helps improve performance, center figure shows that using the map helps improve performance. We can also", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 174, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 505, + 184 + ], + "score": 1.0, + "content": "see that imitation learning improves coverage and reduces the variance in performance. Right figure shows the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 184, + 505, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 184, + 505, + 195 + ], + "score": 1.0, + "content": "comparison between different reward design. We can see that our intrinsic reward enables the agent to explore", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 195, + 234, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 195, + 234, + 204 + ], + "score": 1.0, + "content": "more efficiently in the testing time.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 107, + 211, + 505, + 255 + ], + "lines": [], + "index": 10.5, + "bbox_fs": [ + 105, + 210, + 505, + 256 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 261, + 503, + 284 + ], + "lines": [ + { + "bbox": [ + 105, + 260, + 505, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 505, + 274 + ], + "score": 1.0, + "content": "RGB Observations and Map: Fig. 3 (left) and Fig. 3 (center) respectively show that both RGB", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 273, + 291, + 285 + ], + "spans": [ + { + "bbox": [ + 106, + 273, + 291, + 285 + ], + "score": 1.0, + "content": "images and map inputs improve performance.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 260, + 505, + 285 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 289, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "Intrinsic Reward: We also compare our intrinsic reward design with extrinsic reward design, as", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 300, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 505, + 312 + ], + "score": 1.0, + "content": "shown in Fig. 3 (right). The extrinsic reward is setup as follows: we randomly generated a number", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 311, + 506, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 506, + 324 + ], + "score": 1.0, + "content": "of locations evenly distributed across the traversable area of the houses, where the agent will get a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 322, + 507, + 335 + ], + "spans": [ + { + "bbox": [ + 104, + 322, + 507, + 335 + ], + "score": 1.0, + "content": "positive reward if the agent is close to any of these locations. Once the agent gets a reward from a", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 334, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 334, + 505, + 344 + ], + "score": 1.0, + "content": "location, this location will be no longer taken into account for future reward calculation. We tried", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 343, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 104, + 343, + 363, + 357 + ], + "score": 1.0, + "content": "two settings where we place 1 or 4 reward-yielding objects per", + "type": "text" + }, + { + "bbox": [ + 364, + 343, + 378, + 354 + ], + "score": 0.88, + "content": "m ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 343, + 505, + 357 + ], + "score": 1.0, + "content": ". We can see that our coverage", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 354, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 505, + 368 + ], + "score": 1.0, + "content": "map reward provides a better reward signal and in fact can be estimated intrinsically without needing", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 366, + 231, + 377 + ], + "spans": [ + { + "bbox": [ + 106, + 366, + 231, + 377 + ], + "score": 1.0, + "content": "to instrument the environment.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 18.5, + "bbox_fs": [ + 104, + 289, + 507, + 377 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 392, + 335, + 402 + ], + "lines": [ + { + "bbox": [ + 105, + 390, + 336, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 336, + 405 + ], + "score": 1.0, + "content": "4.3 USING EXPLORATION FOR DOWNSTREAM TASK", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 360, + 577 + ], + "lines": [ + { + "bbox": [ + 106, + 413, + 360, + 424 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 360, + 424 + ], + "score": 1.0, + "content": "Now that we have established how to explore well, we next ask", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 424, + 360, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 360, + 436 + ], + "score": 1.0, + "content": "if task-agnostic exploration is even useful for downstream tasks.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 434, + 360, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 360, + 447 + ], + "score": 1.0, + "content": "We show this in context of goal-driven navigation. We execute", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 446, + 360, + 458 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 231, + 458 + ], + "score": 1.0, + "content": "the learned exploration policy", + "type": "text" + }, + { + "bbox": [ + 231, + 447, + 243, + 457 + ], + "score": 0.86, + "content": "\\pi _ { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 446, + 360, + 458 + ], + "score": 1.0, + "content": "(for 1500 time steps) to ex-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 456, + 361, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 327, + 470 + ], + "score": 1.0, + "content": "plore a new house, and collect experience (set of images", + "type": "text" + }, + { + "bbox": [ + 327, + 457, + 335, + 466 + ], + "score": 0.66, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 456, + 361, + 470 + ], + "score": 1.0, + "content": "along", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 467, + 361, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 361, + 480 + ], + "score": 1.0, + "content": "with their pose p). Once this exploration has finished, the agent", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 478, + 361, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 361, + 491 + ], + "score": 1.0, + "content": "is given different navigation tasks. These navigation tasks put", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 489, + 361, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 361, + 502 + ], + "score": 1.0, + "content": "the agent at an arbitrary location in the environment, and give", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 500, + 361, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 361, + 513 + ], + "score": 1.0, + "content": "it a goal image that it needs to reach. More specifically, we re-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 511, + 361, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 361, + 524 + ], + "score": 1.0, + "content": "set the agent to 50 random poses (positions and orientations) in", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 523, + 360, + 534 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 360, + 534 + ], + "score": 1.0, + "content": "each testing house (20 testing houses in total) and get the RGB", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 534, + 360, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 360, + 545 + ], + "score": 1.0, + "content": "camera view. The agent then needs to use the experience of the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 545, + 360, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 360, + 558 + ], + "score": 1.0, + "content": "environment acquired during exploration to efficiently navigate", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 555, + 361, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 361, + 568 + ], + "score": 1.0, + "content": "to the desired target location. The efficiency of navigation on", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 566, + 318, + 579 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 318, + 579 + ], + "score": 1.0, + "content": "these test queries measures the utility of exploration.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 413, + 361, + 579 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 583, + 360, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 582, + 360, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 582, + 289, + 595 + ], + "score": 1.0, + "content": "This evaluation requires a navigation policy", + "type": "text" + }, + { + "bbox": [ + 289, + 585, + 301, + 594 + ], + "score": 0.85, + "content": "\\pi _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 582, + 360, + 595 + ], + "score": 1.0, + "content": ", that uses the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 594, + 361, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 361, + 606 + ], + "score": 1.0, + "content": "exploration experience and the goal image to output actions that", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 605, + 360, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 360, + 617 + ], + "score": 1.0, + "content": "can convey the agent to the desired target location. We opt for", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 615, + 361, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 173, + 629 + ], + "score": 1.0, + "content": "a simple policy", + "type": "text" + }, + { + "bbox": [ + 173, + 618, + 185, + 627 + ], + "score": 0.83, + "content": "\\pi _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 615, + 193, + 629 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 193, + 617, + 206, + 627 + ], + "score": 0.83, + "content": "\\pi _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 615, + 361, + 629 + ], + "score": 1.0, + "content": "first localizes the target image using", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 627, + 361, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 337, + 639 + ], + "score": 1.0, + "content": "nearest neighbor matching to the set of collected images", + "type": "text" + }, + { + "bbox": [ + 337, + 627, + 346, + 637 + ], + "score": 0.69, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 627, + 361, + 639 + ], + "score": 1.0, + "content": "(in", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 638, + 361, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 361, + 650 + ], + "score": 1.0, + "content": "ImageNet pre-trained ResNet-18 feature space). It then plans a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 647, + 361, + 663 + ], + "spans": [ + { + "bbox": [ + 104, + 647, + 361, + 663 + ], + "score": 1.0, + "content": "path to the this estimated target location using a occupancy map", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 660, + 361, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 169, + 672 + ], + "score": 1.0, + "content": "computed from", + "type": "text" + }, + { + "bbox": [ + 170, + 660, + 178, + 670 + ], + "score": 0.49, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 660, + 361, + 672 + ], + "score": 1.0, + "content": ". We do this experiment in the setting without", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 671, + 214, + 682 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 214, + 682 + ], + "score": 1.0, + "content": "any state estimation noise.", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 44, + "bbox_fs": [ + 104, + 582, + 361, + 682 + ] + }, + { + "type": "image", + "bbox": [ + 366, + 421, + 501, + 554 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 366, + 421, + 501, + 554 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 366, + 421, + 501, + 554 + ], + "spans": [ + { + "bbox": [ + 366, + 421, + 501, + 554 + ], + "score": 0.897, + "type": "image", + "image_path": "bc6d99dfdb5f9d8c8baf8104bc2b5634505fe1a806a2827d6ddbce1eb70dcaef.jpg" + } + ] + } + ], + "index": 44.0, + "virtual_lines": [ + { + "bbox": [ + 366, + 421, + 501, + 487.5 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 366, + 487.5, + 501, + 554.0 + ], + "spans": [], + "index": 49 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 363, + 561, + 504, + 660 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 363, + 561, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 363, + 561, + 505, + 572 + ], + "score": 1.0, + "content": "Figure 4: Exploration for down-", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 363, + 571, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 363, + 571, + 505, + 582 + ], + "score": 1.0, + "content": "stream tasks. We evaluate utility of", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 363, + 582, + 506, + 592 + ], + "spans": [ + { + "bbox": [ + 363, + 582, + 506, + 592 + ], + "score": 1.0, + "content": "exploration for the down-stream nav-", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 363, + 591, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 363, + 591, + 505, + 602 + ], + "score": 1.0, + "content": "igation tasks. Top plots shows ef-", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 363, + 601, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 363, + 601, + 505, + 612 + ], + "score": 1.0, + "content": "fectiveness of the exploration trajec-", + "type": "text" + } + ], + "index": 54 + }, + { + "bbox": [ + 363, + 611, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 363, + 611, + 505, + 622 + ], + "score": 1.0, + "content": "tory for localization of goal images", + "type": "text" + } + ], + "index": 55 + }, + { + "bbox": [ + 363, + 621, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 363, + 621, + 505, + 631 + ], + "score": 1.0, + "content": "in a new environment. Bottom table", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 363, + 631, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 363, + 631, + 505, + 642 + ], + "score": 1.0, + "content": "compares efficiency of reaching goals", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 363, + 640, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 363, + 640, + 505, + 653 + ], + "score": 1.0, + "content": "without and with maps built during ex-", + "type": "text" + } + ], + "index": 58 + }, + { + "bbox": [ + 363, + 651, + 401, + 662 + ], + "spans": [ + { + "bbox": [ + 363, + 651, + 401, + 662 + ], + "score": 1.0, + "content": "ploration.", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 54.5 + } + ], + "index": 49.25 + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "We independently measure the effectiveness of exploration data for a) localization of the given target", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "images, and b) path planning efficiency in reaching desired locations. Localization performance:", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "We measure the distance between the agent’s estimate of the goal image location, and the true goal", + "type": "text" + } + ], + "index": 62 + }, + { + "bbox": [ + 105, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "image location. Fig. 4 (top) plots the success at localization as a function of the success threshold", + "type": "text" + } + ], + "index": 63 + }, + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "(distance at which we consider a localization as correct). We report top-1 and top-5 success rates. We", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 95, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 95, + 505, + 106 + ], + "score": 1.0, + "content": "compare to the random exploration baseline and curiosity-driven baseline which serve to measure", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 102, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 505, + 118 + ], + "score": 1.0, + "content": "the hardness of the task. We see our exploration scheme performs well. Path planning efficiency:", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "Next, we measure how efficiently desired goal locations can be reached. We measure performance", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 506, + 140 + ], + "score": 1.0, + "content": "using the SPL metric as described by Anderson et al. (2018) (described in the appendix, higher is", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "score": 1.0, + "content": "better). We compare against a baseline that does not have any prior experience in this environment", + "type": "text", + "cross_page": true + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "score": 1.0, + "content": "and derives all map information on the fly from goal driven behavior (going to the desired test", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "score": 1.0, + "content": "location). Both agents take actions based on the shortest-path motion planning algorithm. Once", + "type": "text", + "cross_page": true + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "again these serve as a measure of the hardness of the topology of the underlying environment. As", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "shown in Fig. 4 (bottom), using exploration data from our policy improves efficiency of paths to", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 192, + 196, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 196, + 205 + ], + "score": 1.0, + "content": "reach target locations.", + "type": "text", + "cross_page": true + } + ], + "index": 10 + } + ], + "index": 61.5, + "bbox_fs": [ + 105, + 687, + 505, + 732 + ] + } + ] + }, + { + "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": "(distance at which we consider a localization as correct). We report top-1 and top-5 success rates. We", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 95, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 95, + 505, + 106 + ], + "score": 1.0, + "content": "compare to the random exploration baseline and curiosity-driven baseline which serve to measure", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 102, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 102, + 505, + 118 + ], + "score": 1.0, + "content": "the hardness of the task. We see our exploration scheme performs well. Path planning efficiency:", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "Next, we measure how efficiently desired goal locations can be reached. We measure performance", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 506, + 140 + ], + "score": 1.0, + "content": "using the SPL metric as described by Anderson et al. (2018) (described in the appendix, higher is", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "score": 1.0, + "content": "better). We compare against a baseline that does not have any prior experience in this environment", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 161 + ], + "score": 1.0, + "content": "and derives all map information on the fly from goal driven behavior (going to the desired test", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 506, + 172 + ], + "score": 1.0, + "content": "location). Both agents take actions based on the shortest-path motion planning algorithm. Once", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "again these serve as a measure of the hardness of the topology of the underlying environment. As", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "shown in Fig. 4 (bottom), using exploration data from our policy improves efficiency of paths to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 192, + 196, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 196, + 205 + ], + "score": 1.0, + "content": "reach target locations.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 107, + 219, + 190, + 232 + ], + "lines": [ + { + "bbox": [ + 104, + 219, + 192, + 235 + ], + "spans": [ + { + "bbox": [ + 104, + 219, + 192, + 235 + ], + "score": 1.0, + "content": "5 DISCUSSION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 245, + 505, + 300 + ], + "lines": [ + { + "bbox": [ + 106, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "In this paper, we motivated the need for learning explorations policies for navigation in novel 3D", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 505, + 268 + ], + "score": 1.0, + "content": "environments. We showed how to design and train such policies, and how experience gathered from", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "score": 1.0, + "content": "such policies enables better performance for downstream tasks. We think we have just scratched the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 276, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 505, + 293 + ], + "score": 1.0, + "content": "surface of this problem, and hope this inspires future research towards semantic exploration using", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 289, + 423, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 423, + 302 + ], + "score": 1.0, + "content": "more expressive policy architectures, reward functions and training techniques.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 108, + 317, + 175, + 329 + ], + "lines": [ + { + "bbox": [ + 106, + 317, + 176, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 317, + 176, + 329 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 504, + 358 + ], + "lines": [ + { + "bbox": [ + 104, + 332, + 506, + 350 + ], + "spans": [ + { + "bbox": [ + 104, + 332, + 506, + 350 + ], + "score": 1.0, + "content": "Robert G Abbott. Behavioral cloning for simulator validation. In Robot Soccer World Cup, pp.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 346, + 234, + 358 + ], + "spans": [ + { + "bbox": [ + 116, + 346, + 234, + 358 + ], + "score": 1.0, + "content": "329–336. Springer, 2007. 14", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 105, + 347, + 506, + 731 + ], + "lines": [ + { + "bbox": [ + 104, + 364, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 104, + 364, + 505, + 379 + ], + "score": 1.0, + "content": "Peter Anderson, Angel Chang, Devendra Singh Chaplot, Alexey Dosovitskiy, Saurabh Gupta,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 116, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "Vladlen Koltun, Jana Kosecka, Jitendra Malik, Roozbeh Mottaghi, Manolis Savva, and Amir", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 388, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 115, + 388, + 505, + 400 + ], + "score": 1.0, + "content": "Zamir. On evaluation of embodied navigation agents. arXiv preprint arXiv:1807.06757, 2018. 9,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 117, + 398, + 129, + 410 + ], + "spans": [ + { + "bbox": [ + 117, + 398, + 129, + 410 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 416, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 505, + 432 + ], + "score": 1.0, + "content": "Brenna D Argall, Sonia Chernova, Manuela Veloso, and Brett Browning. A survey of robot learning", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 428, + 446, + 441 + ], + "spans": [ + { + "bbox": [ + 116, + 428, + 446, + 441 + ], + "score": 1.0, + "content": "from demonstration. Robotics and autonomous systems, 57(5):469–483, 2009. 14", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 447, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 505, + 461 + ], + "score": 1.0, + "content": "Shi Bai, Jinkun Wang, Fanfei Chen, and Brendan Englot. Information-theoretic exploration with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 458, + 282, + 471 + ], + "spans": [ + { + "bbox": [ + 116, + 458, + 282, + 471 + ], + "score": 1.0, + "content": "bayesian optimization. In IROS, 2016. 3", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "Yuri Burda, Harri Edwards, Deepak Pathak, Amos Storkey, Trevor Darrell, and Alexei A Efros.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 488, + 377, + 500 + ], + "spans": [ + { + "bbox": [ + 115, + 488, + 377, + 500 + ], + "score": 1.0, + "content": "Large-scale study of curiosity-driven learning. In ICLR, 2019. 6", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "Cesar Cadena, Luca Carlone, Henry Carrillo, Yasir Latif, Davide Scaramuzza, Jose Neira, Ian Reid, ´", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 519, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 116, + 519, + 505, + 531 + ], + "score": 1.0, + "content": "and John J Leonard. Past, present, and future of simultaneous localization and mapping: Toward", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 529, + 388, + 542 + ], + "spans": [ + { + "bbox": [ + 116, + 529, + 388, + 542 + ], + "score": 1.0, + "content": "the robust-perception age. IEEE Transactions on Robotics, 2016. 2", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 505, + 561 + ], + "score": 1.0, + "content": "Henry Carrillo, Ian Reid, and Jose A Castellanos. On the comparison of uncertainty criteria for ´", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 560, + 240, + 571 + ], + "spans": [ + { + "bbox": [ + 116, + 560, + 240, + 571 + ], + "score": 1.0, + "content": "active slam. In ICRA, 2012. 2", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 578, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 505, + 592 + ], + "score": 1.0, + "content": "Nuttapong Chentanez, Andrew G Barto, and Satinder P Singh. Intrinsically motivated reinforcement", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 590, + 227, + 601 + ], + "spans": [ + { + "bbox": [ + 115, + 590, + 227, + 601 + ], + "score": 1.0, + "content": "learning. In NIPS, 2005. 3", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 608, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 621 + ], + "score": 1.0, + "content": "Abhishek Das, Samyak Datta, Georgia Gkioxari, Stefan Lee, Devi Parikh, and Dhruv Batra. Em-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 620, + 334, + 632 + ], + "spans": [ + { + "bbox": [ + 116, + 620, + 334, + 632 + ], + "score": 1.0, + "content": "bodied Question Answering. In CVPR, 2018. 5, 6, 14", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 637, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 652 + ], + "score": 1.0, + "content": "Christian Dornhege and Alexander Kleiner. A frontier-void-based approach for autonomous explo-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 650, + 288, + 662 + ], + "spans": [ + { + "bbox": [ + 115, + 650, + 288, + 662 + ], + "score": 1.0, + "content": "ration in 3D. Advanced Robotics, 2013. 6", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "Yan Duan, John Schulman, Xi Chen, Peter L Bartlett, Ilya Sutskever, and Pieter Abbeel. RL2: Fast", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 680, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 115, + 680, + 505, + 692 + ], + "score": 1.0, + "content": "reinforcement learning via slow reinforcement learning. arXiv preprint arXiv:1611.02779, 2016.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 691, + 124, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 124, + 702 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 104, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 104, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "Justin Fu, John Co-Reyes, and Sergey Levine. EX2: Exploration with exemplar models for deep", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 721, + 285, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 285, + 732 + ], + "score": 1.0, + "content": "reinforcement learning. In NIPS, 2017. 3", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 32.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 2019", + "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": [], + "index": 5, + "bbox_fs": [ + 105, + 83, + 506, + 205 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 219, + 190, + 232 + ], + "lines": [ + { + "bbox": [ + 104, + 219, + 192, + 235 + ], + "spans": [ + { + "bbox": [ + 104, + 219, + 192, + 235 + ], + "score": 1.0, + "content": "5 DISCUSSION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 245, + 505, + 300 + ], + "lines": [ + { + "bbox": [ + 106, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "In this paper, we motivated the need for learning explorations policies for navigation in novel 3D", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 505, + 268 + ], + "score": 1.0, + "content": "environments. We showed how to design and train such policies, and how experience gathered from", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 505, + 279 + ], + "score": 1.0, + "content": "such policies enables better performance for downstream tasks. We think we have just scratched the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 276, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 505, + 293 + ], + "score": 1.0, + "content": "surface of this problem, and hope this inspires future research towards semantic exploration using", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 289, + 423, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 423, + 302 + ], + "score": 1.0, + "content": "more expressive policy architectures, reward functions and training techniques.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 245, + 505, + 302 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 317, + 175, + 329 + ], + "lines": [ + { + "bbox": [ + 106, + 317, + 176, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 317, + 176, + 329 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 504, + 358 + ], + "lines": [ + { + "bbox": [ + 104, + 332, + 506, + 350 + ], + "spans": [ + { + "bbox": [ + 104, + 332, + 506, + 350 + ], + "score": 1.0, + "content": "Robert G Abbott. Behavioral cloning for simulator validation. In Robot Soccer World Cup, pp.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 346, + 234, + 358 + ], + "spans": [ + { + "bbox": [ + 116, + 346, + 234, + 358 + ], + "score": 1.0, + "content": "329–336. Springer, 2007. 14", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 104, + 332, + 506, + 358 + ] + }, + { + "type": "list", + "bbox": [ + 105, + 347, + 506, + 731 + ], + "lines": [ + { + "bbox": [ + 104, + 364, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 104, + 364, + 505, + 379 + ], + "score": 1.0, + "content": "Peter Anderson, Angel Chang, Devendra Singh Chaplot, Alexey Dosovitskiy, Saurabh Gupta,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 376, + 505, + 389 + ], + "spans": [ + { + "bbox": [ + 116, + 376, + 505, + 389 + ], + "score": 1.0, + "content": "Vladlen Koltun, Jana Kosecka, Jitendra Malik, Roozbeh Mottaghi, Manolis Savva, and Amir", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 388, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 115, + 388, + 505, + 400 + ], + "score": 1.0, + "content": "Zamir. On evaluation of embodied navigation agents. arXiv preprint arXiv:1807.06757, 2018. 9,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 117, + 398, + 129, + 410 + ], + "spans": [ + { + "bbox": [ + 117, + 398, + 129, + 410 + ], + "score": 1.0, + "content": "12", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 105, + 416, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 505, + 432 + ], + "score": 1.0, + "content": "Brenna D Argall, Sonia Chernova, Manuela Veloso, and Brett Browning. A survey of robot learning", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 428, + 446, + 441 + ], + "spans": [ + { + "bbox": [ + 116, + 428, + 446, + 441 + ], + "score": 1.0, + "content": "from demonstration. Robotics and autonomous systems, 57(5):469–483, 2009. 14", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 447, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 505, + 461 + ], + "score": 1.0, + "content": "Shi Bai, Jinkun Wang, Fanfei Chen, and Brendan Englot. Information-theoretic exploration with", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 458, + 282, + 471 + ], + "spans": [ + { + "bbox": [ + 116, + 458, + 282, + 471 + ], + "score": 1.0, + "content": "bayesian optimization. In IROS, 2016. 3", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "Yuri Burda, Harri Edwards, Deepak Pathak, Amos Storkey, Trevor Darrell, and Alexei A Efros.", + "type": "text" + } + ], + "index": 28, + "is_list_end_line": true + }, + { + "bbox": [ + 115, + 488, + 377, + 500 + ], + "spans": [ + { + "bbox": [ + 115, + 488, + 377, + 500 + ], + "score": 1.0, + "content": "Large-scale study of curiosity-driven learning. In ICLR, 2019. 6", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "Cesar Cadena, Luca Carlone, Henry Carrillo, Yasir Latif, Davide Scaramuzza, Jose Neira, Ian Reid, ´", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 519, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 116, + 519, + 505, + 531 + ], + "score": 1.0, + "content": "and John J Leonard. Past, present, and future of simultaneous localization and mapping: Toward", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 529, + 388, + 542 + ], + "spans": [ + { + "bbox": [ + 116, + 529, + 388, + 542 + ], + "score": 1.0, + "content": "the robust-perception age. IEEE Transactions on Robotics, 2016. 2", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 505, + 561 + ], + "score": 1.0, + "content": "Henry Carrillo, Ian Reid, and Jose A Castellanos. On the comparison of uncertainty criteria for ´", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 560, + 240, + 571 + ], + "spans": [ + { + "bbox": [ + 116, + 560, + 240, + 571 + ], + "score": 1.0, + "content": "active slam. In ICRA, 2012. 2", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 578, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 505, + 592 + ], + "score": 1.0, + "content": "Nuttapong Chentanez, Andrew G Barto, and Satinder P Singh. Intrinsically motivated reinforcement", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 590, + 227, + 601 + ], + "spans": [ + { + "bbox": [ + 115, + 590, + 227, + 601 + ], + "score": 1.0, + "content": "learning. In NIPS, 2005. 3", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 608, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 621 + ], + "score": 1.0, + "content": "Abhishek Das, Samyak Datta, Georgia Gkioxari, Stefan Lee, Devi Parikh, and Dhruv Batra. Em-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 620, + 334, + 632 + ], + "spans": [ + { + "bbox": [ + 116, + 620, + 334, + 632 + ], + "score": 1.0, + "content": "bodied Question Answering. In CVPR, 2018. 5, 6, 14", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 637, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 652 + ], + "score": 1.0, + "content": "Christian Dornhege and Alexander Kleiner. A frontier-void-based approach for autonomous explo-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 650, + 288, + 662 + ], + "spans": [ + { + "bbox": [ + 115, + 650, + 288, + 662 + ], + "score": 1.0, + "content": "ration in 3D. Advanced Robotics, 2013. 6", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "Yan Duan, John Schulman, Xi Chen, Peter L Bartlett, Ilya Sutskever, and Pieter Abbeel. RL2: Fast", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 680, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 115, + 680, + 505, + 692 + ], + "score": 1.0, + "content": "reinforcement learning via slow reinforcement learning. arXiv preprint arXiv:1611.02779, 2016.", + "type": "text" + } + ], + "index": 42, + "is_list_end_line": true + }, + { + "bbox": [ + 116, + 691, + 124, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 691, + 124, + 702 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ], + "index": 43, + "is_list_start_line": true + }, + { + "bbox": [ + 104, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 104, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "Justin Fu, John Co-Reyes, and Sergey Levine. EX2: Exploration with exemplar models for deep", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 721, + 285, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 285, + 732 + ], + "score": 1.0, + "content": "reinforcement learning. In NIPS, 2017. 3", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 32.5, + "bbox_fs": [ + 104, + 364, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 81, + 490, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 491, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 491, + 95 + ], + "score": 1.0, + "content": "Dhiraj Gandhi, Lerrel Pinto, and Abhinav Gupta. Learning to fly by crashing. In IROS, 2017. 3", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 101, + 504, + 126 + ], + "lines": [ + { + "bbox": [ + 107, + 102, + 504, + 114 + ], + "spans": [ + { + "bbox": [ + 107, + 102, + 504, + 114 + ], + "score": 1.0, + "content": "Saurabh Gupta, James Davidson, Sergey Levine, Rahul Sukthankar, and Jitendra Malik. Cognitive", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 114, + 391, + 125 + ], + "spans": [ + { + "bbox": [ + 115, + 114, + 391, + 125 + ], + "score": 1.0, + "content": "mapping and planning for visual navigation. In CVPR, 2017. 1, 2, 5", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 107, + 132, + 504, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "Richard Hartley and Andrew Zisserman. Multiple view geometry in computer vision. Cambridge", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 144, + 243, + 156 + ], + "spans": [ + { + "bbox": [ + 115, + 144, + 243, + 156 + ], + "score": 1.0, + "content": "university press, 2003. 1, 2, 13", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 108, + 163, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 162, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 505, + 177 + ], + "score": 1.0, + "content": "Joao F Henriques and Andrea Vedaldi. MapNet: An allocentric spatial memory for mapping envi-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 175, + 234, + 186 + ], + "spans": [ + { + "bbox": [ + 115, + 175, + 234, + 186 + ], + "score": 1.0, + "content": "ronments. In CVPR, 2018. 5", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 503, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 209 + ], + "score": 1.0, + "content": "Dinesh Jayaraman and Kristen Grauman. Learning to look around: Intelligently exploring unseen", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 206, + 327, + 217 + ], + "spans": [ + { + "bbox": [ + 116, + 206, + 327, + 217 + ], + "score": 1.0, + "content": "environments for unknown tasks. In CVPR, 2018. 3", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 107, + 225, + 503, + 248 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 505, + 239 + ], + "score": 1.0, + "content": "Thomas Kollar and Nicholas Roy. Trajectory optimization using reinforcement learning for map", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 236, + 227, + 248 + ], + "spans": [ + { + "bbox": [ + 116, + 236, + 227, + 248 + ], + "score": 1.0, + "content": "exploration. IJRR, 2008. 3", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 106, + 255, + 430, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 255, + 431, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 431, + 270 + ], + "score": 1.0, + "content": "Steven M LaValle. Planning algorithms. Cambridge university press, 2006. 1, 2", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 429, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 429, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 429, + 289 + ], + "score": 1.0, + "content": "Lennart Ljung. System identification: theory for the user. Prentice-hall, 1987. 3", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 295, + 504, + 319 + ], + "lines": [ + { + "bbox": [ + 106, + 296, + 505, + 308 + ], + "spans": [ + { + "bbox": [ + 106, + 296, + 505, + 308 + ], + "score": 1.0, + "content": "Manuel Lopes, Tobias Lang, Marc Toussaint, and Pierre-Yves Oudeyer. Exploration in model-based", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 307, + 460, + 319 + ], + "spans": [ + { + "bbox": [ + 115, + 307, + 460, + 319 + ], + "score": 1.0, + "content": "reinforcement learning by empirically estimating learning progress. In NIPS, 2012. 3", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 326, + 504, + 360 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "Ruben Martinez-Cantin, Nando de Freitas, Eric Brochu, Jose Castellanos, and Arnaud Doucet. A ´", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 117, + 338, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 117, + 338, + 505, + 350 + ], + "score": 1.0, + "content": "bayesian exploration-exploitation approach for optimal online sensing and planning with a visu-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 348, + 340, + 361 + ], + "spans": [ + { + "bbox": [ + 116, + 348, + 340, + 361 + ], + "score": 1.0, + "content": "ally guided mobile robot. Autonomous Robots, 2009. 2", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 105, + 368, + 504, + 391 + ], + "lines": [ + { + "bbox": [ + 106, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "Ryszard S Michalski, Ivan Bratko, and Avan Bratko. Machine learning and data mining; methods", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 380, + 331, + 391 + ], + "spans": [ + { + "bbox": [ + 115, + 380, + 331, + 391 + ], + "score": 1.0, + "content": "and applications. John Wiley & Sons, Inc., 1998. 14", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 108, + 398, + 504, + 433 + ], + "lines": [ + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "score": 1.0, + "content": "Piotr Mirowski, Razvan Pascanu, Fabio Viola, Hubert Soyer, Andy Ballard, Andrea Banino, Misha", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 410, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 116, + 410, + 505, + 423 + ], + "score": 1.0, + "content": "Denil, Ross Goroshin, Laurent Sifre, Koray Kavukcuoglu, et al. Learning to navigate in complex", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 421, + 258, + 433 + ], + "spans": [ + { + "bbox": [ + 116, + 421, + 258, + 433 + ], + "score": 1.0, + "content": "environments. In ICLR, 2017. 1, 2", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 105, + 440, + 504, + 464 + ], + "lines": [ + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "Nikhil Mishra, Mostafa Rohaninejad, Xi Chen, and Pieter Abbeel. A simple neural attentive meta-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 452, + 222, + 464 + ], + "spans": [ + { + "bbox": [ + 116, + 452, + 222, + 464 + ], + "score": 1.0, + "content": "learner. In ICLR, 2018. 3", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 471, + 504, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 471, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 485 + ], + "score": 1.0, + "content": "Emilio Parisotto and Ruslan Salakhutdinov. Neural map: Structured memory for deep reinforcement", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 483, + 227, + 495 + ], + "spans": [ + { + "bbox": [ + 115, + 483, + 227, + 495 + ], + "score": 1.0, + "content": "learning. In ICLR, 2018. 5", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 106, + 502, + 503, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 501, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 516 + ], + "score": 1.0, + "content": "Deepak Pathak, Pulkit Agrawal, Alexei A Efros, and Trevor Darrell. Curiosity-driven exploration", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 514, + 323, + 525 + ], + "spans": [ + { + "bbox": [ + 115, + 514, + 323, + 525 + ], + "score": 1.0, + "content": "by self-supervised prediction. In ICML, 2017. 3, 6", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 106, + 532, + 506, + 567 + ], + "lines": [ + { + "bbox": [ + 106, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "Deepak Pathak, Parsa Mahmoudieh, Guanghao Luo, Pulkit Agrawal, Dian Chen, Yide Shentu, Evan", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 117, + 544, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 117, + 544, + 505, + 555 + ], + "score": 1.0, + "content": "Shelhamer, Jitendra Malik, Alexei A. Efros, and Trevor Darrell. Zero-shot visual imitation. In", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 555, + 178, + 567 + ], + "spans": [ + { + "bbox": [ + 116, + 555, + 178, + 567 + ], + "score": 1.0, + "content": "ICLR, 2018. 2", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 105, + 574, + 505, + 598 + ], + "lines": [ + { + "bbox": [ + 105, + 574, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 505, + 588 + ], + "score": 1.0, + "content": "Fereshteh Sadeghi and Sergey Levine. CAD2RL: Real single-image flight without a single real", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 586, + 213, + 599 + ], + "spans": [ + { + "bbox": [ + 115, + 586, + 213, + 599 + ], + "score": 1.0, + "content": "image. In RSS, 2017. 3", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 104, + 606, + 504, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 620 + ], + "score": 1.0, + "content": "Nikolay Savinov, Alexey Dosovitskiy, and Vladlen Koltun. Semi-parametric topological memory", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 617, + 260, + 628 + ], + "spans": [ + { + "bbox": [ + 116, + 617, + 260, + 628 + ], + "score": 1.0, + "content": "for navigation. In ICLR, 2018. 1, 2", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 504, + 670 + ], + "lines": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "score": 1.0, + "content": "Jurgen Schmidhuber. A possibility for implementing curiosity and boredom in model-building neu- ¨", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 115, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "ral controllers. In International Conference on Simulation of Adaptive Behavior: From Animals", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 659, + 199, + 670 + ], + "spans": [ + { + "bbox": [ + 116, + 659, + 199, + 670 + ], + "score": 1.0, + "content": "to Animats, 1991. 3", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 106, + 678, + 504, + 702 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 693 + ], + "score": 1.0, + "content": "John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 690, + 400, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 400, + 702 + ], + "score": 1.0, + "content": "optimization algorithms. arXiv preprint arXiv:1707.06347, 2017. 5, 6", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Shuran Song, Fisher Yu, Andy Zeng, Angel X Chang, Manolis Savva, and Thomas Funkhouser.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 720, + 413, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 413, + 732 + ], + "score": 1.0, + "content": "Semantic scene completion from a single depth image. In CVPR, 2017. 5", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5 + } + ], + "page_idx": 9, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2019", + "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, + 81, + 490, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 491, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 491, + 95 + ], + "score": 1.0, + "content": "Dhiraj Gandhi, Lerrel Pinto, and Abhinav Gupta. Learning to fly by crashing. In IROS, 2017. 3", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 82, + 491, + 95 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 101, + 504, + 126 + ], + "lines": [ + { + "bbox": [ + 107, + 102, + 504, + 114 + ], + "spans": [ + { + "bbox": [ + 107, + 102, + 504, + 114 + ], + "score": 1.0, + "content": "Saurabh Gupta, James Davidson, Sergey Levine, Rahul Sukthankar, and Jitendra Malik. Cognitive", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 114, + 391, + 125 + ], + "spans": [ + { + "bbox": [ + 115, + 114, + 391, + 125 + ], + "score": 1.0, + "content": "mapping and planning for visual navigation. In CVPR, 2017. 1, 2, 5", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 107, + 102, + 504, + 125 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 132, + 504, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "Richard Hartley and Andrew Zisserman. Multiple view geometry in computer vision. Cambridge", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 144, + 243, + 156 + ], + "spans": [ + { + "bbox": [ + 115, + 144, + 243, + 156 + ], + "score": 1.0, + "content": "university press, 2003. 1, 2, 13", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 132, + 506, + 156 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 163, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 162, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 505, + 177 + ], + "score": 1.0, + "content": "Joao F Henriques and Andrea Vedaldi. MapNet: An allocentric spatial memory for mapping envi-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 175, + 234, + 186 + ], + "spans": [ + { + "bbox": [ + 115, + 175, + 234, + 186 + ], + "score": 1.0, + "content": "ronments. In CVPR, 2018. 5", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 162, + 505, + 186 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 503, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 505, + 209 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 209 + ], + "score": 1.0, + "content": "Dinesh Jayaraman and Kristen Grauman. Learning to look around: Intelligently exploring unseen", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 206, + 327, + 217 + ], + "spans": [ + { + "bbox": [ + 116, + 206, + 327, + 217 + ], + "score": 1.0, + "content": "environments for unknown tasks. In CVPR, 2018. 3", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 192, + 505, + 217 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 225, + 503, + 248 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 505, + 239 + ], + "score": 1.0, + "content": "Thomas Kollar and Nicholas Roy. Trajectory optimization using reinforcement learning for map", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 236, + 227, + 248 + ], + "spans": [ + { + "bbox": [ + 116, + 236, + 227, + 248 + ], + "score": 1.0, + "content": "exploration. IJRR, 2008. 3", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 223, + 505, + 248 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 255, + 430, + 268 + ], + "lines": [ + { + "bbox": [ + 106, + 255, + 431, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 255, + 431, + 270 + ], + "score": 1.0, + "content": "Steven M LaValle. Planning algorithms. Cambridge university press, 2006. 1, 2", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 255, + 431, + 270 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 429, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 429, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 429, + 289 + ], + "score": 1.0, + "content": "Lennart Ljung. System identification: theory for the user. Prentice-hall, 1987. 3", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 275, + 429, + 289 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 295, + 504, + 319 + ], + "lines": [ + { + "bbox": [ + 106, + 296, + 505, + 308 + ], + "spans": [ + { + "bbox": [ + 106, + 296, + 505, + 308 + ], + "score": 1.0, + "content": "Manuel Lopes, Tobias Lang, Marc Toussaint, and Pierre-Yves Oudeyer. Exploration in model-based", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 307, + 460, + 319 + ], + "spans": [ + { + "bbox": [ + 115, + 307, + 460, + 319 + ], + "score": 1.0, + "content": "reinforcement learning by empirically estimating learning progress. In NIPS, 2012. 3", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 106, + 296, + 505, + 319 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 326, + 504, + 360 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "Ruben Martinez-Cantin, Nando de Freitas, Eric Brochu, Jose Castellanos, and Arnaud Doucet. A ´", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 117, + 338, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 117, + 338, + 505, + 350 + ], + "score": 1.0, + "content": "bayesian exploration-exploitation approach for optimal online sensing and planning with a visu-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 348, + 340, + 361 + ], + "spans": [ + { + "bbox": [ + 116, + 348, + 340, + 361 + ], + "score": 1.0, + "content": "ally guided mobile robot. Autonomous Robots, 2009. 2", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 326, + 505, + 361 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 368, + 504, + 391 + ], + "lines": [ + { + "bbox": [ + 106, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "Ryszard S Michalski, Ivan Bratko, and Avan Bratko. Machine learning and data mining; methods", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 380, + 331, + 391 + ], + "spans": [ + { + "bbox": [ + 115, + 380, + 331, + 391 + ], + "score": 1.0, + "content": "and applications. John Wiley & Sons, Inc., 1998. 14", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 106, + 368, + 505, + 391 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 398, + 504, + 433 + ], + "lines": [ + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "score": 1.0, + "content": "Piotr Mirowski, Razvan Pascanu, Fabio Viola, Hubert Soyer, Andy Ballard, Andrea Banino, Misha", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 410, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 116, + 410, + 505, + 423 + ], + "score": 1.0, + "content": "Denil, Ross Goroshin, Laurent Sifre, Koray Kavukcuoglu, et al. Learning to navigate in complex", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 421, + 258, + 433 + ], + "spans": [ + { + "bbox": [ + 116, + 421, + 258, + 433 + ], + "score": 1.0, + "content": "environments. In ICLR, 2017. 1, 2", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 399, + 505, + 433 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 440, + 504, + 464 + ], + "lines": [ + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 505, + 453 + ], + "score": 1.0, + "content": "Nikhil Mishra, Mostafa Rohaninejad, Xi Chen, and Pieter Abbeel. A simple neural attentive meta-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 452, + 222, + 464 + ], + "spans": [ + { + "bbox": [ + 116, + 452, + 222, + 464 + ], + "score": 1.0, + "content": "learner. In ICLR, 2018. 3", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 106, + 441, + 505, + 464 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 471, + 504, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 471, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 485 + ], + "score": 1.0, + "content": "Emilio Parisotto and Ruslan Salakhutdinov. Neural map: Structured memory for deep reinforcement", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 483, + 227, + 495 + ], + "spans": [ + { + "bbox": [ + 115, + 483, + 227, + 495 + ], + "score": 1.0, + "content": "learning. In ICLR, 2018. 5", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 471, + 505, + 495 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 502, + 503, + 526 + ], + "lines": [ + { + "bbox": [ + 105, + 501, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 505, + 516 + ], + "score": 1.0, + "content": "Deepak Pathak, Pulkit Agrawal, Alexei A Efros, and Trevor Darrell. Curiosity-driven exploration", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 514, + 323, + 525 + ], + "spans": [ + { + "bbox": [ + 115, + 514, + 323, + 525 + ], + "score": 1.0, + "content": "by self-supervised prediction. In ICML, 2017. 3, 6", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 501, + 505, + 525 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 532, + 506, + 567 + ], + "lines": [ + { + "bbox": [ + 106, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "Deepak Pathak, Parsa Mahmoudieh, Guanghao Luo, Pulkit Agrawal, Dian Chen, Yide Shentu, Evan", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 117, + 544, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 117, + 544, + 505, + 555 + ], + "score": 1.0, + "content": "Shelhamer, Jitendra Malik, Alexei A. Efros, and Trevor Darrell. Zero-shot visual imitation. In", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 555, + 178, + 567 + ], + "spans": [ + { + "bbox": [ + 116, + 555, + 178, + 567 + ], + "score": 1.0, + "content": "ICLR, 2018. 2", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 533, + 505, + 567 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 574, + 505, + 598 + ], + "lines": [ + { + "bbox": [ + 105, + 574, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 505, + 588 + ], + "score": 1.0, + "content": "Fereshteh Sadeghi and Sergey Levine. CAD2RL: Real single-image flight without a single real", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 586, + 213, + 599 + ], + "spans": [ + { + "bbox": [ + 115, + 586, + 213, + 599 + ], + "score": 1.0, + "content": "image. In RSS, 2017. 3", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 574, + 505, + 599 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 606, + 504, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 604, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 620 + ], + "score": 1.0, + "content": "Nikolay Savinov, Alexey Dosovitskiy, and Vladlen Koltun. Semi-parametric topological memory", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 617, + 260, + 628 + ], + "spans": [ + { + "bbox": [ + 116, + 617, + 260, + 628 + ], + "score": 1.0, + "content": "for navigation. In ICLR, 2018. 1, 2", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 604, + 505, + 628 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 504, + 670 + ], + "lines": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "score": 1.0, + "content": "Jurgen Schmidhuber. A possibility for implementing curiosity and boredom in model-building neu- ¨", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 115, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "ral controllers. In International Conference on Simulation of Adaptive Behavior: From Animals", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 659, + 199, + 670 + ], + "spans": [ + { + "bbox": [ + 116, + 659, + 199, + 670 + ], + "score": 1.0, + "content": "to Animats, 1991. 3", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 106, + 637, + 505, + 670 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 678, + 504, + 702 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 693 + ], + "score": 1.0, + "content": "John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 690, + 400, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 400, + 702 + ], + "score": 1.0, + "content": "optimization algorithms. arXiv preprint arXiv:1707.06347, 2017. 5, 6", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 676, + 505, + 702 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Shuran Song, Fisher Yu, Andy Zeng, Angel X Chang, Manolis Savva, and Thomas Funkhouser.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 720, + 413, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 413, + 732 + ], + "score": 1.0, + "content": "Semantic scene completion from a single depth image. In CVPR, 2017. 5", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41.5, + "bbox_fs": [ + 106, + 709, + 505, + 732 + ] + } + ] + }, + { + "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": "Bradly C Stadie, Sergey Levine, and Pieter Abbeel. Incentivizing exploration in reinforcement", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 442, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 442, + 106 + ], + "score": 1.0, + "content": "learning with deep predictive models. arXiv preprint arXiv:1507.00814, 2015. 3", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 109, + 112, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 107, + 112, + 504, + 124 + ], + "spans": [ + { + "bbox": [ + 107, + 112, + 504, + 124 + ], + "score": 1.0, + "content": "Sebastian Thrun, Maren Bennewitz, Wolfram Burgard, Armin B Cremers, Frank Dellaert, Dieter", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Fox, Dirk Hahnel, Charles Rosenberg, Nicholas Roy, Jamieson Schulte, et al. MINERVA: A", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 371, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 371, + 146 + ], + "score": 1.0, + "content": "second-generation museum tour-guide robot. In ICRA, 1999. 1", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 153, + 500, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 152, + 500, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 152, + 500, + 167 + ], + "score": 1.0, + "content": "Sebastian Thrun, Wolfram Burgard, and Dieter Fox. Probabilistic robotics. MIT press, 2005. 1, 2", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 172, + 504, + 195 + ], + "lines": [ + { + "bbox": [ + 106, + 172, + 505, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 505, + 185 + ], + "score": 1.0, + "content": "Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 183, + 266, + 195 + ], + "spans": [ + { + "bbox": [ + 115, + 183, + 266, + 195 + ], + "score": 1.0, + "content": "learning. Machine learning, 1992. 5", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 106, + 201, + 504, + 225 + ], + "lines": [ + { + "bbox": [ + 106, + 201, + 506, + 214 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 506, + 214 + ], + "score": 1.0, + "content": "Yi Wu, Yuxin Wu, Georgia Gkioxari, and Yuandong Tian. Building generalizable agents with a", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 212, + 440, + 225 + ], + "spans": [ + { + "bbox": [ + 115, + 212, + 440, + 225 + ], + "score": 1.0, + "content": "realistic and rich 3d environment. arXiv preprint arXiv:1801.02209, 2018. 5, 13", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 108, + 231, + 504, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 231, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 245 + ], + "score": 1.0, + "content": "Kai Xu, Lintao Zheng, Zihao Yan, Guohang Yan, Eugene Zhang, Matthias Niessner, Oliver Deussen,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 114, + 242, + 506, + 256 + ], + "spans": [ + { + "bbox": [ + 114, + 242, + 506, + 256 + ], + "score": 1.0, + "content": "Daniel Cohen-Or, and Hui Huang. Autonomous reconstruction of unknown indoor scenes guided", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 254, + 356, + 266 + ], + "spans": [ + { + "bbox": [ + 116, + 254, + 356, + 266 + ], + "score": 1.0, + "content": "by time-varying tensor fields. In SIGGRAPH Asia, 2017. 3", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 105, + 272, + 504, + 295 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 504, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 504, + 286 + ], + "score": 1.0, + "content": "Brian Yamauchi. A frontier-based approach for autonomous exploration. In Computational Intelli-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 284, + 335, + 296 + ], + "spans": [ + { + "bbox": [ + 115, + 284, + 335, + 296 + ], + "score": 1.0, + "content": "gence in Robotics and Automation (CIRA), 1997. 1, 6", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 104, + 302, + 504, + 325 + ], + "lines": [ + { + "bbox": [ + 106, + 302, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 505, + 315 + ], + "score": 1.0, + "content": "Wenhao Yu, Jie Tan, C Karen Liu, and Greg Turk. Preparing for the unknown: Learning a universal", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 313, + 347, + 325 + ], + "spans": [ + { + "bbox": [ + 115, + 313, + 347, + 325 + ], + "score": 1.0, + "content": "policy with online system identification. In RSS, 2017. 3", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 332, + 503, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 332, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 332, + 505, + 345 + ], + "score": 1.0, + "content": "Jingwei Zhang, Lei Tai, Joschka Boedecker, Wolfram Burgard, and Ming Liu. Neural slam: Learn-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 115, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "ing to explore with external memory. arXiv preprint, 2017. URL http://arxiv.org/abs/1706.09520.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 355, + 124, + 366 + ], + "spans": [ + { + "bbox": [ + 115, + 355, + 124, + 366 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 373, + 505, + 407 + ], + "lines": [ + { + "bbox": [ + 106, + 372, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 106, + 372, + 505, + 386 + ], + "score": 1.0, + "content": "Yuke Zhu, Roozbeh Mottaghi, Eric Kolve, Joseph J Lim, Abhinav Gupta, Li Fei-Fei, and Ali", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 114, + 383, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 114, + 383, + 505, + 398 + ], + "score": 1.0, + "content": "Farhadi. Target-driven visual navigation in indoor scenes using deep reinforcement learning.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 396, + 199, + 407 + ], + "spans": [ + { + "bbox": [ + 116, + 396, + 199, + 407 + ], + "score": 1.0, + "content": "In ICRA, 2017. 1, 2", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + } + ], + "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 2019", + "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": "Bradly C Stadie, Sergey Levine, and Pieter Abbeel. Incentivizing exploration in reinforcement", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 442, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 442, + 106 + ], + "score": 1.0, + "content": "learning with deep predictive models. arXiv preprint arXiv:1507.00814, 2015. 3", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 112, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 107, + 112, + 504, + 124 + ], + "spans": [ + { + "bbox": [ + 107, + 112, + 504, + 124 + ], + "score": 1.0, + "content": "Sebastian Thrun, Maren Bennewitz, Wolfram Burgard, Armin B Cremers, Frank Dellaert, Dieter", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Fox, Dirk Hahnel, Charles Rosenberg, Nicholas Roy, Jamieson Schulte, et al. MINERVA: A", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 371, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 371, + 146 + ], + "score": 1.0, + "content": "second-generation museum tour-guide robot. In ICRA, 1999. 1", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 107, + 112, + 505, + 146 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 153, + 500, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 152, + 500, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 152, + 500, + 167 + ], + "score": 1.0, + "content": "Sebastian Thrun, Wolfram Burgard, and Dieter Fox. Probabilistic robotics. MIT press, 2005. 1, 2", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 152, + 500, + 167 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 172, + 504, + 195 + ], + "lines": [ + { + "bbox": [ + 106, + 172, + 505, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 505, + 185 + ], + "score": 1.0, + "content": "Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 183, + 266, + 195 + ], + "spans": [ + { + "bbox": [ + 115, + 183, + 266, + 195 + ], + "score": 1.0, + "content": "learning. Machine learning, 1992. 5", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 106, + 172, + 505, + 195 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 201, + 504, + 225 + ], + "lines": [ + { + "bbox": [ + 106, + 201, + 506, + 214 + ], + "spans": [ + { + "bbox": [ + 106, + 201, + 506, + 214 + ], + "score": 1.0, + "content": "Yi Wu, Yuxin Wu, Georgia Gkioxari, and Yuandong Tian. Building generalizable agents with a", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 212, + 440, + 225 + ], + "spans": [ + { + "bbox": [ + 115, + 212, + 440, + 225 + ], + "score": 1.0, + "content": "realistic and rich 3d environment. arXiv preprint arXiv:1801.02209, 2018. 5, 13", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 201, + 506, + 225 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 231, + 504, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 231, + 505, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 245 + ], + "score": 1.0, + "content": "Kai Xu, Lintao Zheng, Zihao Yan, Guohang Yan, Eugene Zhang, Matthias Niessner, Oliver Deussen,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 114, + 242, + 506, + 256 + ], + "spans": [ + { + "bbox": [ + 114, + 242, + 506, + 256 + ], + "score": 1.0, + "content": "Daniel Cohen-Or, and Hui Huang. Autonomous reconstruction of unknown indoor scenes guided", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 254, + 356, + 266 + ], + "spans": [ + { + "bbox": [ + 116, + 254, + 356, + 266 + ], + "score": 1.0, + "content": "by time-varying tensor fields. In SIGGRAPH Asia, 2017. 3", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 231, + 506, + 266 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 272, + 504, + 295 + ], + "lines": [ + { + "bbox": [ + 105, + 272, + 504, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 504, + 286 + ], + "score": 1.0, + "content": "Brian Yamauchi. A frontier-based approach for autonomous exploration. In Computational Intelli-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 284, + 335, + 296 + ], + "spans": [ + { + "bbox": [ + 115, + 284, + 335, + 296 + ], + "score": 1.0, + "content": "gence in Robotics and Automation (CIRA), 1997. 1, 6", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 272, + 504, + 296 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 302, + 504, + 325 + ], + "lines": [ + { + "bbox": [ + 106, + 302, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 505, + 315 + ], + "score": 1.0, + "content": "Wenhao Yu, Jie Tan, C Karen Liu, and Greg Turk. Preparing for the unknown: Learning a universal", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 313, + 347, + 325 + ], + "spans": [ + { + "bbox": [ + 115, + 313, + 347, + 325 + ], + "score": 1.0, + "content": "policy with online system identification. In RSS, 2017. 3", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 106, + 302, + 505, + 325 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 332, + 503, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 332, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 332, + 505, + 345 + ], + "score": 1.0, + "content": "Jingwei Zhang, Lei Tai, Joschka Boedecker, Wolfram Burgard, and Ming Liu. Neural slam: Learn-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 115, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "ing to explore with external memory. arXiv preprint, 2017. URL http://arxiv.org/abs/1706.09520.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 355, + 124, + 366 + ], + "spans": [ + { + "bbox": [ + 115, + 355, + 124, + 366 + ], + "score": 1.0, + "content": "3", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 332, + 505, + 366 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 373, + 505, + 407 + ], + "lines": [ + { + "bbox": [ + 106, + 372, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 106, + 372, + 505, + 386 + ], + "score": 1.0, + "content": "Yuke Zhu, Roozbeh Mottaghi, Eric Kolve, Joseph J Lim, Abhinav Gupta, Li Fei-Fei, and Ali", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 114, + 383, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 114, + 383, + 505, + 398 + ], + "score": 1.0, + "content": "Farhadi. Target-driven visual navigation in indoor scenes using deep reinforcement learning.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 396, + 199, + 407 + ], + "spans": [ + { + "bbox": [ + 116, + 396, + 199, + 407 + ], + "score": 1.0, + "content": "In ICRA, 2017. 1, 2", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 372, + 505, + 407 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 253, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 254, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 254, + 96 + ], + "score": 1.0, + "content": "APPENDIX A SPL METRIC", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 107, + 505, + 151 + ], + "lines": [ + { + "bbox": [ + 106, + 107, + 504, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 107, + 504, + 119 + ], + "score": 1.0, + "content": "As defined by Anderson et al. (2018), Success weighted by (normalized inverse) Path Length or SPL", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 118, + 505, + 131 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 227, + 131 + ], + "score": 1.0, + "content": "is computed as follows. Here,", + "type": "text" + }, + { + "bbox": [ + 227, + 119, + 236, + 129 + ], + "score": 0.88, + "content": "\\ell _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 118, + 505, + 131 + ], + "score": 1.0, + "content": "is the shortest-path distance between the starting and goal position,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 129, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 116, + 141 + ], + "score": 0.83, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 129, + 358, + 142 + ], + "score": 1.0, + "content": "is the length of the path actually executed by the agent, and", + "type": "text" + }, + { + "bbox": [ + 358, + 129, + 369, + 140 + ], + "score": 0.88, + "content": "S _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 129, + 506, + 142 + ], + "score": 1.0, + "content": "is a binary variable that indicates", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 139, + 371, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 290, + 153 + ], + "score": 1.0, + "content": "if the agent succeeded. SPL is computed over", + "type": "text" + }, + { + "bbox": [ + 291, + 141, + 301, + 150 + ], + "score": 0.83, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 139, + 371, + 153 + ], + "score": 1.0, + "content": "trials as follows:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 158, + 369, + 193 + ], + "lines": [ + { + "bbox": [ + 241, + 158, + 369, + 193 + ], + "spans": [ + { + "bbox": [ + 241, + 158, + 369, + 193 + ], + "score": 0.95, + "content": "S P L = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } S _ { i } \\frac { \\ell _ { i } } { \\operatorname* { m a x } ( p _ { i } , \\ell _ { i } ) } .", + "type": "interline_equation", + "image_path": "c67dd8960c61c4c3be6c0a53ef5aa00b9d499abd497614c8cf40724a47694f7b.jpg" + } + ] + } + ], + "index": 5.5, + "virtual_lines": [ + { + "bbox": [ + 241, + 158, + 369, + 175.5 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 241, + 175.5, + 369, + 193.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 206, + 401, + 220 + ], + "lines": [ + { + "bbox": [ + 106, + 206, + 401, + 222 + ], + "spans": [ + { + "bbox": [ + 106, + 206, + 401, + 222 + ], + "score": 1.0, + "content": "APPENDIX B EXAMPLES OF POLICY INPUTS AND MAPS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 232, + 505, + 277 + ], + "lines": [ + { + "bbox": [ + 106, + 232, + 504, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 498, + 246 + ], + "score": 1.0, + "content": "We show an example of the policy inputs (RGB image and maps in two different scales) at time", + "type": "text" + }, + { + "bbox": [ + 498, + 234, + 504, + 243 + ], + "score": 0.65, + "content": "t", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 244, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 123, + 256 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 245, + 150, + 255 + ], + "score": 0.91, + "content": "t + 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 244, + 505, + 256 + ], + "score": 1.0, + "content": "in Fig. B.1. Green area means the known(seen) traversable area, blue area means known", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 255, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 505, + 267 + ], + "score": 1.0, + "content": "non-traversable area, and the white area means unknown area. Fig. B.2 shows how the map evolves", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 266, + 300, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 300, + 279 + ], + "score": 1.0, + "content": "and the agent moves as it explores a new house.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "image", + "bbox": [ + 139, + 279, + 474, + 529 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 139, + 279, + 474, + 529 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 139, + 279, + 474, + 529 + ], + "spans": [ + { + "bbox": [ + 139, + 279, + 474, + 529 + ], + "score": 0.976, + "type": "image", + "image_path": "fcdc4d42458a52a98f01afaf12535efd9e16eb11677ced891f5f275f3d3f10b6.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 139, + 279, + 474, + 362.3333333333333 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 139, + 362.3333333333333, + 474, + 445.66666666666663 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 139, + 445.66666666666663, + 474, + 529.0 + ], + "spans": [], + "index": 14 + } + ] + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 114, + 555, + 497, + 715 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 106, + 533, + 506, + 554 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 104, + 532, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 104, + 532, + 294, + 546 + ], + "score": 1.0, + "content": "Figure B.1: Examples of policy inputs at time step", + "type": "text" + }, + { + "bbox": [ + 294, + 535, + 299, + 543 + ], + "score": 0.54, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 532, + 315, + 546 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 316, + 534, + 341, + 543 + ], + "score": 0.82, + "content": "t + 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 532, + 506, + 546 + ], + "score": 1.0, + "content": ". (a) and (d) are the RGB images, (b) and (e)", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 543, + 301, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 301, + 555 + ], + "score": 1.0, + "content": "are the coarse maps, and (c) and (f) are the fine maps.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "image_body", + "bbox": [ + 114, + 555, + 497, + 715 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 114, + 555, + 497, + 715 + ], + "spans": [ + { + "bbox": [ + 114, + 555, + 497, + 715 + ], + "score": 0.97, + "type": "image", + "image_path": "0db49537d45b51474ca20063e92cc26cb745626da254b893980ac177bcae917f.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 114, + 555, + 497, + 608.3333333333334 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 114, + 608.3333333333334, + 497, + 661.6666666666667 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 114, + 661.6666666666667, + 497, + 715.0000000000001 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 176, + 718, + 434, + 729 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 176, + 717, + 434, + 731 + ], + "spans": [ + { + "bbox": [ + 176, + 717, + 434, + 731 + ], + "score": 1.0, + "content": "Figure B.2: Snapshots of the built map as the agent explores the house", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + } + ], + "index": 18 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 294, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2019", + "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": [ + 108, + 81, + 253, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 254, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 254, + 96 + ], + "score": 1.0, + "content": "APPENDIX A SPL METRIC", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 107, + 505, + 151 + ], + "lines": [ + { + "bbox": [ + 106, + 107, + 504, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 107, + 504, + 119 + ], + "score": 1.0, + "content": "As defined by Anderson et al. (2018), Success weighted by (normalized inverse) Path Length or SPL", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 118, + 505, + 131 + ], + "spans": [ + { + "bbox": [ + 105, + 118, + 227, + 131 + ], + "score": 1.0, + "content": "is computed as follows. Here,", + "type": "text" + }, + { + "bbox": [ + 227, + 119, + 236, + 129 + ], + "score": 0.88, + "content": "\\ell _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 118, + 505, + 131 + ], + "score": 1.0, + "content": "is the shortest-path distance between the starting and goal position,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 129, + 506, + 142 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 116, + 141 + ], + "score": 0.83, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 129, + 358, + 142 + ], + "score": 1.0, + "content": "is the length of the path actually executed by the agent, and", + "type": "text" + }, + { + "bbox": [ + 358, + 129, + 369, + 140 + ], + "score": 0.88, + "content": "S _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 129, + 506, + 142 + ], + "score": 1.0, + "content": "is a binary variable that indicates", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 139, + 371, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 139, + 290, + 153 + ], + "score": 1.0, + "content": "if the agent succeeded. SPL is computed over", + "type": "text" + }, + { + "bbox": [ + 291, + 141, + 301, + 150 + ], + "score": 0.83, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 139, + 371, + 153 + ], + "score": 1.0, + "content": "trials as follows:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 107, + 506, + 153 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 241, + 158, + 369, + 193 + ], + "lines": [ + { + "bbox": [ + 241, + 158, + 369, + 193 + ], + "spans": [ + { + "bbox": [ + 241, + 158, + 369, + 193 + ], + "score": 0.95, + "content": "S P L = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } S _ { i } \\frac { \\ell _ { i } } { \\operatorname* { m a x } ( p _ { i } , \\ell _ { i } ) } .", + "type": "interline_equation", + "image_path": "c67dd8960c61c4c3be6c0a53ef5aa00b9d499abd497614c8cf40724a47694f7b.jpg" + } + ] + } + ], + "index": 5.5, + "virtual_lines": [ + { + "bbox": [ + 241, + 158, + 369, + 175.5 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 241, + 175.5, + 369, + 193.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 206, + 401, + 220 + ], + "lines": [ + { + "bbox": [ + 106, + 206, + 401, + 222 + ], + "spans": [ + { + "bbox": [ + 106, + 206, + 401, + 222 + ], + "score": 1.0, + "content": "APPENDIX B EXAMPLES OF POLICY INPUTS AND MAPS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 232, + 505, + 277 + ], + "lines": [ + { + "bbox": [ + 106, + 232, + 504, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 498, + 246 + ], + "score": 1.0, + "content": "We show an example of the policy inputs (RGB image and maps in two different scales) at time", + "type": "text" + }, + { + "bbox": [ + 498, + 234, + 504, + 243 + ], + "score": 0.65, + "content": "t", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 244, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 123, + 256 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 245, + 150, + 255 + ], + "score": 0.91, + "content": "t + 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 244, + 505, + 256 + ], + "score": 1.0, + "content": "in Fig. B.1. Green area means the known(seen) traversable area, blue area means known", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 255, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 505, + 267 + ], + "score": 1.0, + "content": "non-traversable area, and the white area means unknown area. Fig. B.2 shows how the map evolves", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 266, + 300, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 300, + 279 + ], + "score": 1.0, + "content": "and the agent moves as it explores a new house.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 232, + 505, + 279 + ] + }, + { + "type": "image", + "bbox": [ + 139, + 279, + 474, + 529 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 139, + 279, + 474, + 529 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 139, + 279, + 474, + 529 + ], + "spans": [ + { + "bbox": [ + 139, + 279, + 474, + 529 + ], + "score": 0.976, + "type": "image", + "image_path": "fcdc4d42458a52a98f01afaf12535efd9e16eb11677ced891f5f275f3d3f10b6.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 139, + 279, + 474, + 362.3333333333333 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 139, + 362.3333333333333, + 474, + 445.66666666666663 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 139, + 445.66666666666663, + 474, + 529.0 + ], + "spans": [], + "index": 14 + } + ] + } + ], + "index": 13 + }, + { + "type": "image", + "bbox": [ + 114, + 555, + 497, + 715 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 106, + 533, + 506, + 554 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 104, + 532, + 506, + 546 + ], + "spans": [ + { + "bbox": [ + 104, + 532, + 294, + 546 + ], + "score": 1.0, + "content": "Figure B.1: Examples of policy inputs at time step", + "type": "text" + }, + { + "bbox": [ + 294, + 535, + 299, + 543 + ], + "score": 0.54, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 532, + 315, + 546 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 316, + 534, + 341, + 543 + ], + "score": 0.82, + "content": "t + 1 0", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 532, + 506, + 546 + ], + "score": 1.0, + "content": ". (a) and (d) are the RGB images, (b) and (e)", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 543, + 301, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 301, + 555 + ], + "score": 1.0, + "content": "are the coarse maps, and (c) and (f) are the fine maps.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "image_body", + "bbox": [ + 114, + 555, + 497, + 715 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 114, + 555, + 497, + 715 + ], + "spans": [ + { + "bbox": [ + 114, + 555, + 497, + 715 + ], + "score": 0.97, + "type": "image", + "image_path": "0db49537d45b51474ca20063e92cc26cb745626da254b893980ac177bcae917f.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 114, + 555, + 497, + 608.3333333333334 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 114, + 608.3333333333334, + 497, + 661.6666666666667 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 114, + 661.6666666666667, + 497, + 715.0000000000001 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 176, + 718, + 434, + 729 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 176, + 717, + 434, + 731 + ], + "spans": [ + { + "bbox": [ + 176, + 717, + 434, + 731 + ], + "score": 1.0, + "content": "Figure B.2: Snapshots of the built map as the agent explores the house", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + } + ], + "index": 18 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 315, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 315, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 315, + 96 + ], + "score": 1.0, + "content": "APPENDIX C EXPERIMENTAL DETAILS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 107, + 106, + 238, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 239, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 239, + 119 + ], + "score": 1.0, + "content": "C.1 ENVIRONMENT DETAILS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 126, + 505, + 170 + ], + "lines": [ + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "score": 1.0, + "content": "In this paper, we simulated the agent in House3D environment Wu et al. (2018) and used 20 houses", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 137, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 149 + ], + "score": 1.0, + "content": "for training and 20 new houses for testing. Fig. C.1 shows the distribution of the total traversable", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 147, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 505, + 162 + ], + "score": 1.0, + "content": "area of these houses. Fig. C.2 shows some examples of the top-down views for training and testing", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 160, + 298, + 172 + ], + "spans": [ + { + "bbox": [ + 106, + 160, + 298, + 172 + ], + "score": 1.0, + "content": "houses (white is traversable, black is occupied).", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "image", + "bbox": [ + 227, + 173, + 381, + 287 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 227, + 173, + 381, + 287 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 227, + 173, + 381, + 287 + ], + "spans": [ + { + "bbox": [ + 227, + 173, + 381, + 287 + ], + "score": 0.97, + "type": "image", + "image_path": "b560d434f3321dbe20fdd4229d761a54fddc9afae255d0b9360287666d7711c6.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 227, + 173, + 381, + 187.25 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 227, + 187.25, + 381, + 201.5 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 227, + 201.5, + 381, + 215.75 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 227, + 215.75, + 381, + 230.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 227, + 230.0, + 381, + 244.25 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 227, + 244.25, + 381, + 258.5 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 227, + 258.5, + 381, + 272.75 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 227, + 272.75, + 381, + 287.0 + ], + "spans": [], + "index": 13 + } + ] + } + ], + "index": 9.5 + }, + { + "type": "image", + "bbox": [ + 113, + 316, + 497, + 388 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 104, + 293, + 504, + 314 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 293, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 106, + 293, + 505, + 304 + ], + "score": 1.0, + "content": "Figure C.1: Area distribution of training and testing houses (20 houses in each case). The average movable", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 302, + 471, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 211, + 315 + ], + "score": 1.0, + "content": "area of the training houses is", + "type": "text" + }, + { + "bbox": [ + 212, + 302, + 247, + 313 + ], + "score": 0.89, + "content": "2 8 9 . 7 \\mathrm { m } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 303, + 430, + 315 + ], + "score": 1.0, + "content": ". The average movable area of the testing houses is", + "type": "text" + }, + { + "bbox": [ + 431, + 302, + 466, + 313 + ], + "score": 0.88, + "content": "\\mathrm { 3 2 7 . 9 ~ m ^ { \\mathrm { 2 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 303, + 471, + 315 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "image_body", + "bbox": [ + 113, + 316, + 497, + 388 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 316, + 497, + 388 + ], + "spans": [ + { + "bbox": [ + 113, + 316, + 497, + 388 + ], + "score": 0.961, + "type": "image", + "image_path": "3528259f82349e65d518beeff522e87ce7c1925368c19dc77c8d35c0d26f92ae.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 113, + 316, + 497, + 340.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 113, + 340.0, + 497, + 364.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 113, + 364.0, + 497, + 388.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 391, + 504, + 423 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 390, + 504, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 504, + 403 + ], + "score": 1.0, + "content": "Figure C.2: Examples of house layouts (top-down views). The left three figures show 3 examples of the train-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 401, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 414 + ], + "score": 1.0, + "content": "ing houses. The right three figures show 3 examples of the testing houses. White regions indicate traversable", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 412, + 265, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 265, + 423 + ], + "score": 1.0, + "content": "area, black regions represent occupied area.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + } + ], + "index": 17 + }, + { + "type": "title", + "bbox": [ + 107, + 438, + 236, + 450 + ], + "lines": [ + { + "bbox": [ + 106, + 438, + 237, + 451 + ], + "spans": [ + { + "bbox": [ + 106, + 438, + 237, + 451 + ], + "score": 1.0, + "content": "C.2 MAP RECONSTRUCTION", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 108, + 458, + 504, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 458, + 290, + 471 + ], + "score": 1.0, + "content": "Given a sequence of camera poses (extrinsics)", + "type": "text" + }, + { + "bbox": [ + 291, + 459, + 420, + 471 + ], + "score": 0.93, + "content": "( [ R _ { 1 } , t _ { 1 } ] , [ R _ { 2 } , t _ { 2 } ] , . . . , [ R _ { N } , t _ { N } ] )", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 458, + 505, + 471 + ], + "score": 1.0, + "content": ", and the correspond-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 466, + 507, + 484 + ], + "spans": [ + { + "bbox": [ + 104, + 466, + 176, + 484 + ], + "score": 1.0, + "content": "ing depth images", + "type": "text" + }, + { + "bbox": [ + 176, + 470, + 250, + 482 + ], + "score": 0.92, + "content": "( D _ { 1 } , D _ { 2 } , . . . , D _ { N } )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 466, + 442, + 484 + ], + "score": 1.0, + "content": "at each time step as well as the camera intrinsics", + "type": "text" + }, + { + "bbox": [ + 442, + 469, + 487, + 480 + ], + "score": 0.92, + "content": "\\pmb { K } \\in \\mathbb { R } ^ { 3 \\times 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 466, + 507, + 484 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "can reconstruct the point cloud of the scene based on the principle of mulitple-view geometry (Hart-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 506, + 505 + ], + "score": 1.0, + "content": "ley & Zisserman, 2003). We can convert the points from pixel space to the camera space and then to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 503, + 486, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 486, + 515 + ], + "score": 1.0, + "content": "the world space. More specifically, the formulas to achieve this can be summarized as follows:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25 + }, + { + "type": "interline_equation", + "bbox": [ + 184, + 518, + 427, + 571 + ], + "lines": [ + { + "bbox": [ + 184, + 518, + 427, + 571 + ], + "spans": [ + { + "bbox": [ + 184, + 518, + 427, + 571 + ], + "score": 0.93, + "content": "\\begin{array} { c } { { \\lambda _ { i j } { \\pmb x } _ { i j } = K \\left[ { \\pmb R } _ { i } , { \\pmb t } _ { i } \\right] { \\pmb w } _ { i j } \\quad \\forall j \\in \\{ 1 , 2 , . . . , S \\} , i \\in \\{ 1 , . . . , N \\} } } \\\\ { { N \\mathrm { ~ } _ { i } \\mathrm { ~ } _ { j } } } \\\\ { { \\pmb W } = \\displaystyle \\bigcup _ { i = 1 } ^ { N } \\displaystyle \\bigcup _ { j = 1 } ^ { S } { \\pmb w } _ { i j } } \\end{array}", + "type": "interline_equation", + "image_path": "02867036a31307abff4f8537cd5d33bb5d6e45bace2b311592896c490d9aa5ab.jpg" + } + ] + } + ], + "index": 29.5, + "virtual_lines": [ + { + "bbox": [ + 184, + 518, + 427, + 531.25 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 184, + 531.25, + 427, + 544.5 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 184, + 544.5, + 427, + 557.75 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 184, + 557.75, + 427, + 571.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 575, + 505, + 622 + ], + "lines": [ + { + "bbox": [ + 106, + 574, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 133, + 588 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 576, + 141, + 585 + ], + "score": 0.84, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 574, + 336, + 588 + ], + "score": 1.0, + "content": "is the total number of pixels in each depth image,", + "type": "text" + }, + { + "bbox": [ + 336, + 575, + 375, + 588 + ], + "score": 0.94, + "content": "\\pmb { x } _ { i j } \\in \\mathbb { R } ^ { 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 574, + 505, + 588 + ], + "score": 1.0, + "content": "is the homogeneous coordinates", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 120, + 600 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 121, + 587, + 132, + 598 + ], + "score": 0.88, + "content": "j _ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 586, + 167, + 600 + ], + "score": 1.0, + "content": "pixel on", + "type": "text" + }, + { + "bbox": [ + 168, + 587, + 178, + 597 + ], + "score": 0.87, + "content": "i _ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 586, + 230, + 600 + ], + "score": 1.0, + "content": "depth image", + "type": "text" + }, + { + "bbox": [ + 231, + 587, + 243, + 598 + ], + "score": 0.78, + "content": "D _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 586, + 246, + 600 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 247, + 587, + 280, + 599 + ], + "score": 0.85, + "content": "\\lambda _ { i j } \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 586, + 378, + 600 + ], + "score": 1.0, + "content": "is the depth value of the", + "type": "text" + }, + { + "bbox": [ + 379, + 587, + 390, + 598 + ], + "score": 0.87, + "content": "j _ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 586, + 425, + 600 + ], + "score": 1.0, + "content": "pixel on", + "type": "text" + }, + { + "bbox": [ + 425, + 587, + 436, + 598 + ], + "score": 0.86, + "content": "i _ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 586, + 488, + 600 + ], + "score": 1.0, + "content": "depth image", + "type": "text" + }, + { + "bbox": [ + 488, + 587, + 501, + 597 + ], + "score": 0.88, + "content": "D _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 586, + 505, + 600 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 598, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 124, + 611 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 598, + 164, + 611 + ], + "score": 0.92, + "content": "\\ b w _ { i j } \\in \\mathbb { R } ^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 598, + 505, + 611 + ], + "score": 1.0, + "content": "is the homogeneous coordinates for the corresponding point in the world coordinate", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 609, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 185, + 622 + ], + "score": 1.0, + "content": "system. We can get", + "type": "text" + }, + { + "bbox": [ + 185, + 611, + 202, + 622 + ], + "score": 0.88, + "content": "{ \\pmb w } _ { i j }", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 609, + 224, + 622 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 225, + 611, + 239, + 622 + ], + "score": 0.88, + "content": "\\mathbf { \\boldsymbol { x } } _ { i j }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 609, + 505, + 622 + ], + "score": 1.0, + "content": "based on Equation (2). And we can merge points via Equation (3).", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33.5 + }, + { + "type": "title", + "bbox": [ + 107, + 634, + 217, + 645 + ], + "lines": [ + { + "bbox": [ + 106, + 632, + 218, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 218, + 648 + ], + "score": 1.0, + "content": "C.3 TRAINING DETAILS", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 654, + 507, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 396, + 668 + ], + "score": 1.0, + "content": "The occupancy map generated by the agent itself uses a resolution of", + "type": "text" + }, + { + "bbox": [ + 396, + 655, + 423, + 666 + ], + "score": 0.73, + "content": "0 . 0 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 654, + 507, + 668 + ], + "score": 1.0, + "content": ". Our policy uses a", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 439, + 678 + ], + "score": 1.0, + "content": "coarse map, and a detailed map. The coarse map captures information about a", + "type": "text" + }, + { + "bbox": [ + 439, + 666, + 484, + 676 + ], + "score": 0.91, + "content": "4 0 \\mathrm { m } \\times 4 0 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "area", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 677, + 504, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 258, + 689 + ], + "score": 1.0, + "content": "around the agent, at a resolution of of", + "type": "text" + }, + { + "bbox": [ + 259, + 677, + 281, + 687 + ], + "score": 0.8, + "content": "0 . 5 m", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 677, + 460, + 689 + ], + "score": 1.0, + "content": ". The occupancy map is down-sampled from", + "type": "text" + }, + { + "bbox": [ + 461, + 677, + 504, + 688 + ], + "score": 0.88, + "content": "8 0 0 \\times 8 0 0", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 116, + 700 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 688, + 150, + 698 + ], + "score": 0.91, + "content": "8 0 \\times 8 0", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "to generate the coarse map that is fed into the policy network. The detailed map captures", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 187, + 711 + ], + "score": 1.0, + "content": "information about a", + "type": "text" + }, + { + "bbox": [ + 187, + 699, + 222, + 709 + ], + "score": 0.9, + "content": "4 \\mathrm { m } \\times 4 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 699, + 325, + 711 + ], + "score": 1.0, + "content": "area around the agent at a", + "type": "text" + }, + { + "bbox": [ + 326, + 699, + 354, + 709 + ], + "score": 0.85, + "content": "0 . 0 5 m", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "resolution. RGB images are rendered", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 117, + 723 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 117, + 710, + 162, + 720 + ], + "score": 0.9, + "content": "2 2 4 \\times 2 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 708, + 328, + 723 + ], + "score": 1.0, + "content": "resolution in House3D and re-sized into", + "type": "text" + }, + { + "bbox": [ + 328, + 710, + 362, + 720 + ], + "score": 0.89, + "content": "8 0 \\times 8 0", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "before they are fed into the policy", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 721, + 144, + 731 + ], + "spans": [ + { + "bbox": [ + 104, + 721, + 144, + 731 + ], + "score": 1.0, + "content": "network.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 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 2019", + "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, + 315, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 315, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 315, + 96 + ], + "score": 1.0, + "content": "APPENDIX C EXPERIMENTAL DETAILS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 107, + 106, + 238, + 117 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 239, + 119 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 239, + 119 + ], + "score": 1.0, + "content": "C.1 ENVIRONMENT DETAILS", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 126, + 505, + 170 + ], + "lines": [ + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 139 + ], + "score": 1.0, + "content": "In this paper, we simulated the agent in House3D environment Wu et al. (2018) and used 20 houses", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 137, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 149 + ], + "score": 1.0, + "content": "for training and 20 new houses for testing. Fig. C.1 shows the distribution of the total traversable", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 147, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 505, + 162 + ], + "score": 1.0, + "content": "area of these houses. Fig. C.2 shows some examples of the top-down views for training and testing", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 160, + 298, + 172 + ], + "spans": [ + { + "bbox": [ + 106, + 160, + 298, + 172 + ], + "score": 1.0, + "content": "houses (white is traversable, black is occupied).", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 126, + 505, + 172 + ] + }, + { + "type": "image", + "bbox": [ + 227, + 173, + 381, + 287 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 227, + 173, + 381, + 287 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 227, + 173, + 381, + 287 + ], + "spans": [ + { + "bbox": [ + 227, + 173, + 381, + 287 + ], + "score": 0.97, + "type": "image", + "image_path": "b560d434f3321dbe20fdd4229d761a54fddc9afae255d0b9360287666d7711c6.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 227, + 173, + 381, + 187.25 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 227, + 187.25, + 381, + 201.5 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 227, + 201.5, + 381, + 215.75 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 227, + 215.75, + 381, + 230.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 227, + 230.0, + 381, + 244.25 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 227, + 244.25, + 381, + 258.5 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 227, + 258.5, + 381, + 272.75 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 227, + 272.75, + 381, + 287.0 + ], + "spans": [], + "index": 13 + } + ] + } + ], + "index": 9.5 + }, + { + "type": "image", + "bbox": [ + 113, + 316, + 497, + 388 + ], + "blocks": [ + { + "type": "image_caption", + "bbox": [ + 104, + 293, + 504, + 314 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 293, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 106, + 293, + 505, + 304 + ], + "score": 1.0, + "content": "Figure C.1: Area distribution of training and testing houses (20 houses in each case). The average movable", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 302, + 471, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 211, + 315 + ], + "score": 1.0, + "content": "area of the training houses is", + "type": "text" + }, + { + "bbox": [ + 212, + 302, + 247, + 313 + ], + "score": 0.89, + "content": "2 8 9 . 7 \\mathrm { m } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 303, + 430, + 315 + ], + "score": 1.0, + "content": ". The average movable area of the testing houses is", + "type": "text" + }, + { + "bbox": [ + 431, + 302, + 466, + 313 + ], + "score": 0.88, + "content": "\\mathrm { 3 2 7 . 9 ~ m ^ { \\mathrm { 2 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 303, + 471, + 315 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "image_body", + "bbox": [ + 113, + 316, + 497, + 388 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 316, + 497, + 388 + ], + "spans": [ + { + "bbox": [ + 113, + 316, + 497, + 388 + ], + "score": 0.961, + "type": "image", + "image_path": "3528259f82349e65d518beeff522e87ce7c1925368c19dc77c8d35c0d26f92ae.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 113, + 316, + 497, + 340.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 113, + 340.0, + 497, + 364.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 113, + 364.0, + 497, + 388.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 391, + 504, + 423 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 390, + 504, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 504, + 403 + ], + "score": 1.0, + "content": "Figure C.2: Examples of house layouts (top-down views). The left three figures show 3 examples of the train-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 401, + 505, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 414 + ], + "score": 1.0, + "content": "ing houses. The right three figures show 3 examples of the testing houses. White regions indicate traversable", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 412, + 265, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 265, + 423 + ], + "score": 1.0, + "content": "area, black regions represent occupied area.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + } + ], + "index": 17 + }, + { + "type": "title", + "bbox": [ + 107, + 438, + 236, + 450 + ], + "lines": [ + { + "bbox": [ + 106, + 438, + 237, + 451 + ], + "spans": [ + { + "bbox": [ + 106, + 438, + 237, + 451 + ], + "score": 1.0, + "content": "C.2 MAP RECONSTRUCTION", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 108, + 458, + 504, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 458, + 290, + 471 + ], + "score": 1.0, + "content": "Given a sequence of camera poses (extrinsics)", + "type": "text" + }, + { + "bbox": [ + 291, + 459, + 420, + 471 + ], + "score": 0.93, + "content": "( [ R _ { 1 } , t _ { 1 } ] , [ R _ { 2 } , t _ { 2 } ] , . . . , [ R _ { N } , t _ { N } ] )", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 458, + 505, + 471 + ], + "score": 1.0, + "content": ", and the correspond-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 466, + 507, + 484 + ], + "spans": [ + { + "bbox": [ + 104, + 466, + 176, + 484 + ], + "score": 1.0, + "content": "ing depth images", + "type": "text" + }, + { + "bbox": [ + 176, + 470, + 250, + 482 + ], + "score": 0.92, + "content": "( D _ { 1 } , D _ { 2 } , . . . , D _ { N } )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 466, + 442, + 484 + ], + "score": 1.0, + "content": "at each time step as well as the camera intrinsics", + "type": "text" + }, + { + "bbox": [ + 442, + 469, + 487, + 480 + ], + "score": 0.92, + "content": "\\pmb { K } \\in \\mathbb { R } ^ { 3 \\times 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 466, + 507, + 484 + ], + "score": 1.0, + "content": ", we", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "score": 1.0, + "content": "can reconstruct the point cloud of the scene based on the principle of mulitple-view geometry (Hart-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 506, + 505 + ], + "score": 1.0, + "content": "ley & Zisserman, 2003). We can convert the points from pixel space to the camera space and then to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 503, + 486, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 486, + 515 + ], + "score": 1.0, + "content": "the world space. More specifically, the formulas to achieve this can be summarized as follows:", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25, + "bbox_fs": [ + 104, + 458, + 507, + 515 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 184, + 518, + 427, + 571 + ], + "lines": [ + { + "bbox": [ + 184, + 518, + 427, + 571 + ], + "spans": [ + { + "bbox": [ + 184, + 518, + 427, + 571 + ], + "score": 0.93, + "content": "\\begin{array} { c } { { \\lambda _ { i j } { \\pmb x } _ { i j } = K \\left[ { \\pmb R } _ { i } , { \\pmb t } _ { i } \\right] { \\pmb w } _ { i j } \\quad \\forall j \\in \\{ 1 , 2 , . . . , S \\} , i \\in \\{ 1 , . . . , N \\} } } \\\\ { { N \\mathrm { ~ } _ { i } \\mathrm { ~ } _ { j } } } \\\\ { { \\pmb W } = \\displaystyle \\bigcup _ { i = 1 } ^ { N } \\displaystyle \\bigcup _ { j = 1 } ^ { S } { \\pmb w } _ { i j } } \\end{array}", + "type": "interline_equation", + "image_path": "02867036a31307abff4f8537cd5d33bb5d6e45bace2b311592896c490d9aa5ab.jpg" + } + ] + } + ], + "index": 29.5, + "virtual_lines": [ + { + "bbox": [ + 184, + 518, + 427, + 531.25 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 184, + 531.25, + 427, + 544.5 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 184, + 544.5, + 427, + 557.75 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 184, + 557.75, + 427, + 571.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 575, + 505, + 622 + ], + "lines": [ + { + "bbox": [ + 106, + 574, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 133, + 588 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 576, + 141, + 585 + ], + "score": 0.84, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 574, + 336, + 588 + ], + "score": 1.0, + "content": "is the total number of pixels in each depth image,", + "type": "text" + }, + { + "bbox": [ + 336, + 575, + 375, + 588 + ], + "score": 0.94, + "content": "\\pmb { x } _ { i j } \\in \\mathbb { R } ^ { 3 }", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 574, + 505, + 588 + ], + "score": 1.0, + "content": "is the homogeneous coordinates", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 586, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 586, + 120, + 600 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 121, + 587, + 132, + 598 + ], + "score": 0.88, + "content": "j _ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 586, + 167, + 600 + ], + "score": 1.0, + "content": "pixel on", + "type": "text" + }, + { + "bbox": [ + 168, + 587, + 178, + 597 + ], + "score": 0.87, + "content": "i _ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 586, + 230, + 600 + ], + "score": 1.0, + "content": "depth image", + "type": "text" + }, + { + "bbox": [ + 231, + 587, + 243, + 598 + ], + "score": 0.78, + "content": "D _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 586, + 246, + 600 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 247, + 587, + 280, + 599 + ], + "score": 0.85, + "content": "\\lambda _ { i j } \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 586, + 378, + 600 + ], + "score": 1.0, + "content": "is the depth value of the", + "type": "text" + }, + { + "bbox": [ + 379, + 587, + 390, + 598 + ], + "score": 0.87, + "content": "j _ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 586, + 425, + 600 + ], + "score": 1.0, + "content": "pixel on", + "type": "text" + }, + { + "bbox": [ + 425, + 587, + 436, + 598 + ], + "score": 0.86, + "content": "i _ { \\mathrm { t h } }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 586, + 488, + 600 + ], + "score": 1.0, + "content": "depth image", + "type": "text" + }, + { + "bbox": [ + 488, + 587, + 501, + 597 + ], + "score": 0.88, + "content": "D _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 586, + 505, + 600 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 598, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 598, + 124, + 611 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 598, + 164, + 611 + ], + "score": 0.92, + "content": "\\ b w _ { i j } \\in \\mathbb { R } ^ { 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 598, + 505, + 611 + ], + "score": 1.0, + "content": "is the homogeneous coordinates for the corresponding point in the world coordinate", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 609, + 505, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 185, + 622 + ], + "score": 1.0, + "content": "system. We can get", + "type": "text" + }, + { + "bbox": [ + 185, + 611, + 202, + 622 + ], + "score": 0.88, + "content": "{ \\pmb w } _ { i j }", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 609, + 224, + 622 + ], + "score": 1.0, + "content": "from", + "type": "text" + }, + { + "bbox": [ + 225, + 611, + 239, + 622 + ], + "score": 0.88, + "content": "\\mathbf { \\boldsymbol { x } } _ { i j }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 609, + 505, + 622 + ], + "score": 1.0, + "content": "based on Equation (2). And we can merge points via Equation (3).", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 574, + 505, + 622 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 634, + 217, + 645 + ], + "lines": [ + { + "bbox": [ + 106, + 632, + 218, + 648 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 218, + 648 + ], + "score": 1.0, + "content": "C.3 TRAINING DETAILS", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 654, + 507, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 396, + 668 + ], + "score": 1.0, + "content": "The occupancy map generated by the agent itself uses a resolution of", + "type": "text" + }, + { + "bbox": [ + 396, + 655, + 423, + 666 + ], + "score": 0.73, + "content": "0 . 0 5 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 654, + 507, + 668 + ], + "score": 1.0, + "content": ". Our policy uses a", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 439, + 678 + ], + "score": 1.0, + "content": "coarse map, and a detailed map. The coarse map captures information about a", + "type": "text" + }, + { + "bbox": [ + 439, + 666, + 484, + 676 + ], + "score": 0.91, + "content": "4 0 \\mathrm { m } \\times 4 0 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "area", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 677, + 504, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 258, + 689 + ], + "score": 1.0, + "content": "around the agent, at a resolution of of", + "type": "text" + }, + { + "bbox": [ + 259, + 677, + 281, + 687 + ], + "score": 0.8, + "content": "0 . 5 m", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 677, + 460, + 689 + ], + "score": 1.0, + "content": ". The occupancy map is down-sampled from", + "type": "text" + }, + { + "bbox": [ + 461, + 677, + 504, + 688 + ], + "score": 0.88, + "content": "8 0 0 \\times 8 0 0", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 116, + 700 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 117, + 688, + 150, + 698 + ], + "score": 0.91, + "content": "8 0 \\times 8 0", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "to generate the coarse map that is fed into the policy network. The detailed map captures", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 187, + 711 + ], + "score": 1.0, + "content": "information about a", + "type": "text" + }, + { + "bbox": [ + 187, + 699, + 222, + 709 + ], + "score": 0.9, + "content": "4 \\mathrm { m } \\times 4 \\mathrm { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 699, + 325, + 711 + ], + "score": 1.0, + "content": "area around the agent at a", + "type": "text" + }, + { + "bbox": [ + 326, + 699, + 354, + 709 + ], + "score": 0.85, + "content": "0 . 0 5 m", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "resolution. RGB images are rendered", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 117, + 723 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 117, + 710, + 162, + 720 + ], + "score": 0.9, + "content": "2 2 4 \\times 2 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 708, + 328, + 723 + ], + "score": 1.0, + "content": "resolution in House3D and re-sized into", + "type": "text" + }, + { + "bbox": [ + 328, + 710, + 362, + 720 + ], + "score": 0.89, + "content": "8 0 \\times 8 0", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "before they are fed into the policy", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 721, + 144, + 731 + ], + "spans": [ + { + "bbox": [ + 104, + 721, + 144, + 731 + ], + "score": 1.0, + "content": "network.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40, + "bbox_fs": [ + 104, + 654, + 507, + 731 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "The size of the last fully-connected layer in ResNet18 architecture is modified to 128. Outputs of the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 105 + ], + "score": 1.0, + "content": "three ResNet18 networks are concatenated into a 384-dimensional vector. This is transformed into", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "a 128-dimensional vector via a fully-connected layer. Next, it’s fed into a single-layer RNN(GRU)", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "layer with 128 hidden layer size. The output of RNN layer is followed by two heads. One head (the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 288, + 138 + ], + "score": 1.0, + "content": "policy head) has two fully-connected layers", + "type": "text" + }, + { + "bbox": [ + 288, + 127, + 350, + 138 + ], + "score": 0.83, + "content": "( 1 2 8 - 3 2 - 6 )", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 127, + 505, + 138 + ], + "score": 1.0, + "content": ". The other head (the value head) has", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 137, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 216, + 149 + ], + "score": 1.0, + "content": "two fully-connected layers", + "type": "text" + }, + { + "bbox": [ + 216, + 137, + 276, + 149 + ], + "score": 0.86, + "content": "( 1 2 8 - 3 2 - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 138, + 505, + 149 + ], + "score": 1.0, + "content": ". We use ELU as the nonlinear activation function for the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 149, + 263, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 263, + 161 + ], + "score": 1.0, + "content": "fully-connected layers after ResNet18.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 165, + 505, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "Each episode consists of 500 steps in training. RNN time sequence length is 20. Coverage area", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 175, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 107, + 176, + 136, + 188 + ], + "score": 0.92, + "content": "C ( M _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 175, + 465, + 189 + ], + "score": 1.0, + "content": "is measured by the number of covered grids in the occupancy map. Coefficient", + "type": "text" + }, + { + "bbox": [ + 466, + 178, + 474, + 186 + ], + "score": 0.73, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 175, + 505, + 189 + ], + "score": 1.0, + "content": "for the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 185, + 507, + 202 + ], + "spans": [ + { + "bbox": [ + 104, + 185, + 174, + 202 + ], + "score": 1.0, + "content": "coverage reward", + "type": "text" + }, + { + "bbox": [ + 175, + 187, + 206, + 199 + ], + "score": 0.93, + "content": "R _ { i n t } ^ { \\mathrm { c o v } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 185, + 294, + 202 + ], + "score": 1.0, + "content": "is 0.0005, coefficient", + "type": "text" + }, + { + "bbox": [ + 294, + 187, + 302, + 199 + ], + "score": 0.85, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 185, + 317, + 202 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 318, + 187, + 349, + 199 + ], + "score": 0.93, + "content": "R _ { i n t } ^ { \\mathrm { c o l l } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 185, + 507, + 202 + ], + "score": 1.0, + "content": "is 0.006. PPO entropy loss coefficient", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 199, + 438, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 438, + 210 + ], + "score": 1.0, + "content": "is 0.01. Network is optimized via Adam optimizer with a learning rate of 0.00001.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5 + }, + { + "type": "title", + "bbox": [ + 107, + 223, + 195, + 234 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 197, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 197, + 236 + ], + "score": 1.0, + "content": "C.4 NOISE MODEL", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 108, + 244, + 428, + 255 + ], + "lines": [ + { + "bbox": [ + 106, + 243, + 429, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 429, + 257 + ], + "score": 1.0, + "content": "Details of noise generation for experiments with estimation noise in Section 4.2:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 264, + 506, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 265, + 454, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 396, + 277 + ], + "score": 1.0, + "content": "1. Without loss of generality, we initialize the agent at the origin, that is", + "type": "text" + }, + { + "bbox": [ + 397, + 265, + 450, + 276 + ], + "score": 0.91, + "content": "{ \\hat { x } } _ { 0 } = x _ { 0 } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 265, + 454, + 277 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 279, + 506, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 222, + 292 + ], + "score": 1.0, + "content": "2. The agent takes an action", + "type": "text" + }, + { + "bbox": [ + 222, + 281, + 232, + 290 + ], + "score": 0.83, + "content": "a _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 279, + 506, + 292 + ], + "score": 1.0, + "content": ". We add truncated Gaussian noise to the action primitive(e.g., move", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 118, + 290, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 118, + 290, + 153, + 303 + ], + "score": 1.0, + "content": "forward", + "type": "text" + }, + { + "bbox": [ + 153, + 291, + 181, + 302 + ], + "score": 0.68, + "content": "0 . 2 5 \\mathrm { m } )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 290, + 288, + 303 + ], + "score": 1.0, + "content": "to get the estimated pose", + "type": "text" + }, + { + "bbox": [ + 288, + 291, + 309, + 302 + ], + "score": 0.92, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 290, + 331, + 303 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 331, + 291, + 398, + 302 + ], + "score": 0.93, + "content": "\\hat { x } _ { t + 1 } = \\hat { x } _ { t } + \\tilde { a } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 290, + 427, + 303 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 427, + 291, + 438, + 302 + ], + "score": 0.89, + "content": "\\hat { x } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 290, + 505, + 303 + ], + "score": 1.0, + "content": "is the estimated", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 118, + 302, + 395, + 314 + ], + "spans": [ + { + "bbox": [ + 118, + 302, + 210, + 314 + ], + "score": 1.0, + "content": "pose in time step t and", + "type": "text" + }, + { + "bbox": [ + 211, + 302, + 221, + 312 + ], + "score": 0.87, + "content": "\\tilde { a } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 302, + 311, + 314 + ], + "score": 1.0, + "content": "is the action primitive", + "type": "text" + }, + { + "bbox": [ + 311, + 303, + 321, + 312 + ], + "score": 0.85, + "content": "a _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 302, + 395, + 314 + ], + "score": 1.0, + "content": "with added noise.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 317, + 399, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 317, + 399, + 329 + ], + "score": 1.0, + "content": "3. Iterate the second step until the maximum number of steps is reached.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 107, + 337, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 105, + 336, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 350 + ], + "score": 1.0, + "content": "Thus, in this noise model, the agent estimates its new pose based on the estimated pose from the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 348, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 348, + 505, + 360 + ], + "score": 1.0, + "content": "last time step and the executed action. Thus, we dont use oracle odometry in the noise experiments.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 358, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 373 + ], + "score": 1.0, + "content": "This noise model leads to compounding errors over time (as in the case of a real robot), though we", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 370, + 469, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 469, + 382 + ], + "score": 1.0, + "content": "acknowledge that this simple noise model may not perfectly match noise in the real world.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "title", + "bbox": [ + 108, + 395, + 267, + 406 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 268, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 268, + 407 + ], + "score": 1.0, + "content": "C.5 IMITATION LEARNING DETAILS", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 505, + 505 + ], + "lines": [ + { + "bbox": [ + 106, + 415, + 504, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 504, + 427 + ], + "score": 1.0, + "content": "We use behavioral cloning technique (Argall et al., 2009; Michalski et al., 1998; Abbott, 2007)", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 426, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 505, + 439 + ], + "score": 1.0, + "content": "to imitate the human behaviors in exploring the environments. We got the human demonstration", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 437, + 505, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 505, + 449 + ], + "score": 1.0, + "content": "trajectories from (Das et al., 2018). We ignored the question-answering part of the data and only", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "score": 1.0, + "content": "used the exploration trajectories. We cleaned up the data by removing the trajectories that have", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "less than 100 time steps. The trajectories are then converted into short sequences of trajectory", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 471, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 147, + 483 + ], + "score": 1.0, + "content": "segments", + "type": "text" + }, + { + "bbox": [ + 147, + 471, + 287, + 483 + ], + "score": 0.87, + "content": "( \\left( { { s _ { i } } , { a _ { i } } , { s _ { i + 1 } } , { a _ { i + 1 } } , . . . , { s _ { i + T } } , { a _ { i + T } } } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 471, + 317, + 483 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 318, + 471, + 326, + 480 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 471, + 505, + 483 + ], + "score": 1.0, + "content": "is based on the RNN sequence length). The", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 481, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 361, + 495 + ], + "score": 1.0, + "content": "policy is pretrained with behavioral cloning by imitating actions", + "type": "text" + }, + { + "bbox": [ + 361, + 482, + 439, + 493 + ], + "score": 0.91, + "content": "( a _ { i } , a _ { i + 1 } , . . . , a _ { i + T } )", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 481, + 506, + 495 + ], + "score": 1.0, + "content": "from the human", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 492, + 315, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 234, + 506 + ], + "score": 1.0, + "content": "demonstrations given the states", + "type": "text" + }, + { + "bbox": [ + 234, + 493, + 309, + 505 + ], + "score": 0.9, + "content": "( s _ { i } , s _ { i + 1 } , . . . , s _ { i + T } )", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 492, + 315, + 506 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26.5 + } + ], + "page_idx": 13, + "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 2019", + "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": "text", + "bbox": [ + 107, + 82, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "The size of the last fully-connected layer in ResNet18 architecture is modified to 128. Outputs of the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 105 + ], + "score": 1.0, + "content": "three ResNet18 networks are concatenated into a 384-dimensional vector. This is transformed into", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "a 128-dimensional vector via a fully-connected layer. Next, it’s fed into a single-layer RNN(GRU)", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "layer with 128 hidden layer size. The output of RNN layer is followed by two heads. One head (the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 288, + 138 + ], + "score": 1.0, + "content": "policy head) has two fully-connected layers", + "type": "text" + }, + { + "bbox": [ + 288, + 127, + 350, + 138 + ], + "score": 0.83, + "content": "( 1 2 8 - 3 2 - 6 )", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 127, + 505, + 138 + ], + "score": 1.0, + "content": ". The other head (the value head) has", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 137, + 505, + 149 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 216, + 149 + ], + "score": 1.0, + "content": "two fully-connected layers", + "type": "text" + }, + { + "bbox": [ + 216, + 137, + 276, + 149 + ], + "score": 0.86, + "content": "( 1 2 8 - 3 2 - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 138, + 505, + 149 + ], + "score": 1.0, + "content": ". We use ELU as the nonlinear activation function for the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 149, + 263, + 161 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 263, + 161 + ], + "score": 1.0, + "content": "fully-connected layers after ResNet18.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 82, + 505, + 161 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 165, + 505, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "Each episode consists of 500 steps in training. RNN time sequence length is 20. Coverage area", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 175, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 107, + 176, + 136, + 188 + ], + "score": 0.92, + "content": "C ( M _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 175, + 465, + 189 + ], + "score": 1.0, + "content": "is measured by the number of covered grids in the occupancy map. Coefficient", + "type": "text" + }, + { + "bbox": [ + 466, + 178, + 474, + 186 + ], + "score": 0.73, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 175, + 505, + 189 + ], + "score": 1.0, + "content": "for the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 185, + 507, + 202 + ], + "spans": [ + { + "bbox": [ + 104, + 185, + 174, + 202 + ], + "score": 1.0, + "content": "coverage reward", + "type": "text" + }, + { + "bbox": [ + 175, + 187, + 206, + 199 + ], + "score": 0.93, + "content": "R _ { i n t } ^ { \\mathrm { c o v } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 185, + 294, + 202 + ], + "score": 1.0, + "content": "is 0.0005, coefficient", + "type": "text" + }, + { + "bbox": [ + 294, + 187, + 302, + 199 + ], + "score": 0.85, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 185, + 317, + 202 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 318, + 187, + 349, + 199 + ], + "score": 0.93, + "content": "R _ { i n t } ^ { \\mathrm { c o l l } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 185, + 507, + 202 + ], + "score": 1.0, + "content": "is 0.006. PPO entropy loss coefficient", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 199, + 438, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 438, + 210 + ], + "score": 1.0, + "content": "is 0.01. Network is optimized via Adam optimizer with a learning rate of 0.00001.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5, + "bbox_fs": [ + 104, + 165, + 507, + 210 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 223, + 195, + 234 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 197, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 197, + 236 + ], + "score": 1.0, + "content": "C.4 NOISE MODEL", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 108, + 244, + 428, + 255 + ], + "lines": [ + { + "bbox": [ + 106, + 243, + 429, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 429, + 257 + ], + "score": 1.0, + "content": "Details of noise generation for experiments with estimation noise in Section 4.2:", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 243, + 429, + 257 + ] + }, + { + "type": "list", + "bbox": [ + 107, + 264, + 506, + 328 + ], + "lines": [ + { + "bbox": [ + 106, + 265, + 454, + 277 + ], + "spans": [ + { + "bbox": [ + 106, + 265, + 396, + 277 + ], + "score": 1.0, + "content": "1. Without loss of generality, we initialize the agent at the origin, that is", + "type": "text" + }, + { + "bbox": [ + 397, + 265, + 450, + 276 + ], + "score": 0.91, + "content": "{ \\hat { x } } _ { 0 } = x _ { 0 } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 265, + 454, + 277 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 279, + 506, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 222, + 292 + ], + "score": 1.0, + "content": "2. The agent takes an action", + "type": "text" + }, + { + "bbox": [ + 222, + 281, + 232, + 290 + ], + "score": 0.83, + "content": "a _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 279, + 506, + 292 + ], + "score": 1.0, + "content": ". We add truncated Gaussian noise to the action primitive(e.g., move", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 118, + 290, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 118, + 290, + 153, + 303 + ], + "score": 1.0, + "content": "forward", + "type": "text" + }, + { + "bbox": [ + 153, + 291, + 181, + 302 + ], + "score": 0.68, + "content": "0 . 2 5 \\mathrm { m } )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 290, + 288, + 303 + ], + "score": 1.0, + "content": "to get the estimated pose", + "type": "text" + }, + { + "bbox": [ + 288, + 291, + 309, + 302 + ], + "score": 0.92, + "content": "\\hat { x } _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 290, + 331, + 303 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 331, + 291, + 398, + 302 + ], + "score": 0.93, + "content": "\\hat { x } _ { t + 1 } = \\hat { x } _ { t } + \\tilde { a } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 290, + 427, + 303 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 427, + 291, + 438, + 302 + ], + "score": 0.89, + "content": "\\hat { x } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 290, + 505, + 303 + ], + "score": 1.0, + "content": "is the estimated", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 118, + 302, + 395, + 314 + ], + "spans": [ + { + "bbox": [ + 118, + 302, + 210, + 314 + ], + "score": 1.0, + "content": "pose in time step t and", + "type": "text" + }, + { + "bbox": [ + 211, + 302, + 221, + 312 + ], + "score": 0.87, + "content": "\\tilde { a } _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 302, + 311, + 314 + ], + "score": 1.0, + "content": "is the action primitive", + "type": "text" + }, + { + "bbox": [ + 311, + 303, + 321, + 312 + ], + "score": 0.85, + "content": "a _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 302, + 395, + 314 + ], + "score": 1.0, + "content": "with added noise.", + "type": "text" + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 317, + 399, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 317, + 399, + 329 + ], + "score": 1.0, + "content": "3. Iterate the second step until the maximum number of steps is reached.", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 15, + "bbox_fs": [ + 105, + 265, + 506, + 329 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 337, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 105, + 336, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 336, + 505, + 350 + ], + "score": 1.0, + "content": "Thus, in this noise model, the agent estimates its new pose based on the estimated pose from the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 348, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 348, + 505, + 360 + ], + "score": 1.0, + "content": "last time step and the executed action. Thus, we dont use oracle odometry in the noise experiments.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 358, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 505, + 373 + ], + "score": 1.0, + "content": "This noise model leads to compounding errors over time (as in the case of a real robot), though we", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 370, + 469, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 469, + 382 + ], + "score": 1.0, + "content": "acknowledge that this simple noise model may not perfectly match noise in the real world.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 336, + 505, + 382 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 395, + 267, + 406 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 268, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 268, + 407 + ], + "score": 1.0, + "content": "C.5 IMITATION LEARNING DETAILS", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 505, + 505 + ], + "lines": [ + { + "bbox": [ + 106, + 415, + 504, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 504, + 427 + ], + "score": 1.0, + "content": "We use behavioral cloning technique (Argall et al., 2009; Michalski et al., 1998; Abbott, 2007)", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 426, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 505, + 439 + ], + "score": 1.0, + "content": "to imitate the human behaviors in exploring the environments. We got the human demonstration", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 437, + 505, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 505, + 449 + ], + "score": 1.0, + "content": "trajectories from (Das et al., 2018). We ignored the question-answering part of the data and only", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "score": 1.0, + "content": "used the exploration trajectories. We cleaned up the data by removing the trajectories that have", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "less than 100 time steps. The trajectories are then converted into short sequences of trajectory", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 471, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 147, + 483 + ], + "score": 1.0, + "content": "segments", + "type": "text" + }, + { + "bbox": [ + 147, + 471, + 287, + 483 + ], + "score": 0.87, + "content": "( \\left( { { s _ { i } } , { a _ { i } } , { s _ { i + 1 } } , { a _ { i + 1 } } , . . . , { s _ { i + T } } , { a _ { i + T } } } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 471, + 317, + 483 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 318, + 471, + 326, + 480 + ], + "score": 0.8, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 471, + 505, + 483 + ], + "score": 1.0, + "content": "is based on the RNN sequence length). The", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 481, + 506, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 361, + 495 + ], + "score": 1.0, + "content": "policy is pretrained with behavioral cloning by imitating actions", + "type": "text" + }, + { + "bbox": [ + 361, + 482, + 439, + 493 + ], + "score": 0.91, + "content": "( a _ { i } , a _ { i + 1 } , . . . , a _ { i + T } )", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 481, + 506, + 495 + ], + "score": 1.0, + "content": "from the human", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 492, + 315, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 234, + 506 + ], + "score": 1.0, + "content": "demonstrations given the states", + "type": "text" + }, + { + "bbox": [ + 234, + 493, + 309, + 505 + ], + "score": 0.9, + "content": "( s _ { i } , s _ { i + 1 } , . . . , s _ { i + T } )", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 492, + 315, + 506 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 415, + 506, + 506 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/SyMWn05F7/SyMWn05F7_model.json b/parse/train/SyMWn05F7/SyMWn05F7_model.json new file mode 100644 index 0000000000000000000000000000000000000000..18c18c626bc1ddc92f19fd6e06d1ecc099af1ea0 --- /dev/null +++ b/parse/train/SyMWn05F7/SyMWn05F7_model.json @@ -0,0 +1,18457 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 564, + 1302, + 564, + 1302, + 960, + 398, + 960 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1287, + 1404, + 1287, + 1404, + 1712, + 297, + 1712 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1728, + 1403, + 1728, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1086, + 1403, + 1086, + 1403, + 1270, + 298, + 1270 + ], + "score": 0.978 + }, + { + "category_id": 0, + "poly": [ + 294, + 218, + 1397, + 218, + 1397, + 269, + 294, + 269 + ], + "score": 0.928 + }, + { + "category_id": 0, + "poly": [ + 301, + 1017, + 573, + 1017, + 573, + 1053, + 301, + 1053 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.873 + }, + { + "category_id": 0, + "poly": [ + 773, + 495, + 927, + 495, + 927, + 529, + 773, + 529 + ], + "score": 0.839 + }, + { + "category_id": 1, + "poly": [ + 312, + 318, + 934, + 318, + 934, + 415, + 312, + 415 + ], + "score": 0.727 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 857, + 2088, + 857, + 2112, + 842, + 2112 + ], + "score": 0.64 + }, + { + "category_id": 15, + "poly": [ + 293.0, + 219.0, + 1406.0, + 219.0, + 1406.0, + 274.0, + 293.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1014.0, + 579.0, + 1014.0, + 579.0, + 1061.0, + 293.0, + 1061.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, + 494.0, + 932.0, + 494.0, + 932.0, + 532.0, + 770.0, + 532.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": [ + 393.0, + 563.0, + 1305.0, + 563.0, + 1305.0, + 601.0, + 393.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 593.0, + 1305.0, + 593.0, + 1305.0, + 631.0, + 393.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 625.0, + 1305.0, + 625.0, + 1305.0, + 660.0, + 394.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 657.0, + 1306.0, + 657.0, + 1306.0, + 689.0, + 395.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 687.0, + 1306.0, + 687.0, + 1306.0, + 722.0, + 394.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 718.0, + 1306.0, + 718.0, + 1306.0, + 750.0, + 394.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 748.0, + 1306.0, + 748.0, + 1306.0, + 782.0, + 394.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 775.0, + 1306.0, + 775.0, + 1306.0, + 814.0, + 393.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 808.0, + 1305.0, + 808.0, + 1305.0, + 844.0, + 393.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 838.0, + 1303.0, + 838.0, + 1303.0, + 874.0, + 393.0, + 874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 870.0, + 1305.0, + 870.0, + 1305.0, + 903.0, + 395.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 899.0, + 1303.0, + 899.0, + 1303.0, + 931.0, + 394.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 930.0, + 1149.0, + 930.0, + 1149.0, + 962.0, + 394.0, + 962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1284.0, + 1404.0, + 1284.0, + 1404.0, + 1319.0, + 295.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1315.0, + 1406.0, + 1315.0, + 1406.0, + 1349.0, + 292.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1346.0, + 1406.0, + 1346.0, + 1406.0, + 1381.0, + 294.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1372.0, + 1406.0, + 1372.0, + 1406.0, + 1415.0, + 291.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1406.0, + 1406.0, + 1406.0, + 1406.0, + 1441.0, + 294.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1438.0, + 1407.0, + 1438.0, + 1407.0, + 1473.0, + 292.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1468.0, + 1405.0, + 1468.0, + 1405.0, + 1503.0, + 294.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1497.0, + 1405.0, + 1497.0, + 1405.0, + 1534.0, + 292.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1529.0, + 1405.0, + 1529.0, + 1405.0, + 1564.0, + 294.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1556.0, + 1407.0, + 1556.0, + 1407.0, + 1597.0, + 291.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1590.0, + 1404.0, + 1590.0, + 1404.0, + 1622.0, + 295.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1622.0, + 1404.0, + 1622.0, + 1404.0, + 1653.0, + 295.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1648.0, + 1405.0, + 1648.0, + 1405.0, + 1688.0, + 294.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1681.0, + 1015.0, + 1681.0, + 1015.0, + 1717.0, + 294.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1726.0, + 1404.0, + 1726.0, + 1404.0, + 1763.0, + 294.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1759.0, + 1404.0, + 1759.0, + 1404.0, + 1795.0, + 293.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1788.0, + 1407.0, + 1788.0, + 1407.0, + 1826.0, + 292.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1820.0, + 1405.0, + 1820.0, + 1405.0, + 1856.0, + 294.0, + 1856.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": [ + 293.0, + 1881.0, + 1405.0, + 1881.0, + 1405.0, + 1916.0, + 293.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1979.0, + 294.0, + 1979.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": [ + 292.0, + 2002.0, + 1407.0, + 2002.0, + 1407.0, + 2040.0, + 292.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1088.0, + 1405.0, + 1088.0, + 1405.0, + 1120.0, + 296.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1116.0, + 1405.0, + 1116.0, + 1405.0, + 1155.0, + 293.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1146.0, + 1405.0, + 1146.0, + 1405.0, + 1183.0, + 293.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1179.0, + 1404.0, + 1179.0, + 1404.0, + 1213.0, + 292.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1208.0, + 1405.0, + 1208.0, + 1405.0, + 1244.0, + 294.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1240.0, + 681.0, + 1240.0, + 681.0, + 1274.0, + 294.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 317.0, + 685.0, + 317.0, + 685.0, + 355.0, + 312.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 319.0, + 938.0, + 319.0, + 938.0, + 354.0, + 715.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 347.0, + 642.0, + 347.0, + 642.0, + 389.0, + 310.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 381.0, + 585.0, + 381.0, + 585.0, + 417.0, + 312.0, + 417.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1453, + 1404, + 1453, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1013, + 1403, + 1013, + 1403, + 1437, + 298, + 1437 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 399, + 1404, + 399, + 1404, + 734, + 298, + 734 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 299, + 873, + 1402, + 873, + 1402, + 995, + 299, + 995 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1401, + 229, + 1401, + 383, + 299, + 383 + ], + "score": 0.973 + }, + { + "category_id": 0, + "poly": [ + 301, + 794, + 586, + 794, + 586, + 830, + 301, + 830 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2112, + 841, + 2112 + ], + "score": 0.706 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.125 + }, + { + "category_id": 15, + "poly": [ + 291.0, + 791.0, + 593.0, + 791.0, + 593.0, + 838.0, + 291.0, + 838.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": [ + 294.0, + 1453.0, + 1402.0, + 1453.0, + 1402.0, + 1488.0, + 294.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1484.0, + 1404.0, + 1484.0, + 1404.0, + 1519.0, + 294.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1512.0, + 1403.0, + 1512.0, + 1403.0, + 1551.0, + 293.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1546.0, + 1402.0, + 1546.0, + 1402.0, + 1581.0, + 294.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1575.0, + 1402.0, + 1575.0, + 1402.0, + 1610.0, + 294.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1606.0, + 1405.0, + 1606.0, + 1405.0, + 1641.0, + 296.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1637.0, + 1402.0, + 1637.0, + 1402.0, + 1672.0, + 294.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1667.0, + 1404.0, + 1667.0, + 1404.0, + 1702.0, + 294.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": [ + 293.0, + 1727.0, + 1404.0, + 1727.0, + 1404.0, + 1761.0, + 293.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1759.0, + 1404.0, + 1759.0, + 1404.0, + 1794.0, + 293.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1789.0, + 1406.0, + 1789.0, + 1406.0, + 1824.0, + 294.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1820.0, + 1405.0, + 1820.0, + 1405.0, + 1855.0, + 294.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1850.0, + 1405.0, + 1850.0, + 1405.0, + 1884.0, + 295.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1880.0, + 1404.0, + 1880.0, + 1404.0, + 1914.0, + 294.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 1406.0, + 1911.0, + 1406.0, + 1945.0, + 294.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 1406.0, + 1941.0, + 1406.0, + 1976.0, + 294.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2005.0, + 293.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 2001.0, + 1405.0, + 2001.0, + 1405.0, + 2036.0, + 297.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1007.0, + 1405.0, + 1007.0, + 1405.0, + 1050.0, + 293.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1040.0, + 1405.0, + 1040.0, + 1405.0, + 1078.0, + 293.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1069.0, + 1407.0, + 1069.0, + 1407.0, + 1112.0, + 292.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1102.0, + 1403.0, + 1102.0, + 1403.0, + 1137.0, + 294.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1133.0, + 1405.0, + 1133.0, + 1405.0, + 1168.0, + 293.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1165.0, + 1403.0, + 1165.0, + 1403.0, + 1196.0, + 296.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1194.0, + 1405.0, + 1194.0, + 1405.0, + 1229.0, + 294.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1225.0, + 1405.0, + 1225.0, + 1405.0, + 1260.0, + 293.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1253.0, + 1404.0, + 1253.0, + 1404.0, + 1289.0, + 294.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1285.0, + 1405.0, + 1285.0, + 1405.0, + 1321.0, + 296.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1313.0, + 1405.0, + 1313.0, + 1405.0, + 1351.0, + 293.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1347.0, + 1403.0, + 1347.0, + 1403.0, + 1382.0, + 294.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1375.0, + 1405.0, + 1375.0, + 1405.0, + 1414.0, + 293.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1409.0, + 793.0, + 1409.0, + 793.0, + 1440.0, + 296.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 400.0, + 1404.0, + 400.0, + 1404.0, + 434.0, + 294.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 427.0, + 1404.0, + 427.0, + 1404.0, + 468.0, + 292.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 458.0, + 1405.0, + 458.0, + 1405.0, + 499.0, + 292.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 491.0, + 1404.0, + 491.0, + 1404.0, + 526.0, + 294.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 522.0, + 1405.0, + 522.0, + 1405.0, + 557.0, + 294.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 549.0, + 1405.0, + 549.0, + 1405.0, + 590.0, + 292.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 583.0, + 1404.0, + 583.0, + 1404.0, + 617.0, + 294.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 611.0, + 1403.0, + 611.0, + 1403.0, + 647.0, + 295.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 643.0, + 1404.0, + 643.0, + 1404.0, + 678.0, + 294.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 675.0, + 1406.0, + 675.0, + 1406.0, + 710.0, + 296.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 705.0, + 637.0, + 705.0, + 637.0, + 736.0, + 296.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 874.0, + 1406.0, + 874.0, + 1406.0, + 906.0, + 295.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 905.0, + 1404.0, + 905.0, + 1404.0, + 937.0, + 295.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 935.0, + 1406.0, + 935.0, + 1406.0, + 969.0, + 293.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 965.0, + 967.0, + 965.0, + 967.0, + 1000.0, + 294.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 1406.0, + 229.0, + 1406.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 260.0, + 1405.0, + 260.0, + 1405.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 291.0, + 1405.0, + 291.0, + 1405.0, + 327.0, + 294.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 318.0, + 1403.0, + 318.0, + 1403.0, + 359.0, + 294.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 351.0, + 1393.0, + 351.0, + 1393.0, + 388.0, + 295.0, + 388.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1109, + 1404, + 1109, + 1404, + 1656, + 297, + 1656 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 877, + 1403, + 877, + 1403, + 1092, + 298, + 1092 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1671, + 1402, + 1671, + 1402, + 1826, + 299, + 1826 + ], + "score": 0.977 + }, + { + "category_id": 3, + "poly": [ + 360, + 127, + 1346, + 127, + 1346, + 665, + 360, + 665 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1402, + 1942, + 1402, + 2034, + 300, + 2034 + ], + "score": 0.973 + }, + { + "category_id": 4, + "poly": [ + 296, + 681, + 1404, + 681, + 1404, + 849, + 296, + 849 + ], + "score": 0.961 + }, + { + "category_id": 0, + "poly": [ + 300, + 1871, + 508, + 1871, + 508, + 1906, + 300, + 1906 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 815, + 76, + 815, + 104, + 298, + 104 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.607 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 859, + 2088, + 859, + 2112, + 842, + 2112 + ], + "score": 0.373 + }, + { + "category_id": 13, + "poly": [ + 384, + 738, + 410, + 738, + 410, + 764, + 384, + 764 + ], + "score": 0.87, + "latex": "\\hat { x } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 721, + 769, + 750, + 769, + 750, + 793, + 721, + 793 + ], + "score": 0.86, + "latex": "\\pi _ { e }" + }, + { + "category_id": 13, + "poly": [ + 1343, + 1412, + 1400, + 1412, + 1400, + 1441, + 1343, + 1441 + ], + "score": 0.85, + "latex": "3 6 0 ^ { \\circ }" + }, + { + "category_id": 13, + "poly": [ + 950, + 2006, + 980, + 2006, + 980, + 2034, + 950, + 2034 + ], + "score": 0.84, + "latex": "\\pi _ { e }" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 129.0, + 990.0, + 129.0, + 990.0, + 155.0, + 852.0, + 155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 161.0, + 1042.0, + 161.0, + 1042.0, + 200.0, + 801.0, + 200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 205.0, + 937.0, + 205.0, + 937.0, + 232.0, + 907.0, + 232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 237.0, + 1032.0, + 237.0, + 1032.0, + 279.0, + 809.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 311.0, + 589.0, + 311.0, + 589.0, + 330.0, + 520.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 324.0, + 589.0, + 324.0, + 589.0, + 350.0, + 518.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 343.0, + 461.0, + 343.0, + 461.0, + 371.0, + 398.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 352.0, + 994.0, + 352.0, + 994.0, + 387.0, + 934.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 342.0, + 1177.0, + 342.0, + 1177.0, + 372.0, + 1112.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 473.0, + 489.0, + 473.0, + 489.0, + 505.0, + 372.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 473.0, + 1203.0, + 473.0, + 1203.0, + 506.0, + 1087.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 544.0, + 595.0, + 544.0, + 595.0, + 587.0, + 510.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 532.0, + 1057.0, + 532.0, + 1057.0, + 587.0, + 938.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 596.0, + 1200.0, + 596.0, + 1200.0, + 629.0, + 1089.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 631.0, + 463.0, + 631.0, + 463.0, + 656.0, + 368.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 631.0, + 1209.0, + 631.0, + 1209.0, + 656.0, + 1083.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.75, + 139.0, + 1176.75, + 139.0, + 1176.75, + 177.0, + 1094.75, + 177.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 323.0, + 459.0, + 323.0, + 459.0, + 348.0, + 401.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 322.0, + 1172.0, + 322.0, + 1172.0, + 347.0, + 1116.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 601.0, + 485.0, + 601.0, + 485.0, + 625.5, + 376.0, + 625.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 680.0, + 1402.0, + 680.0, + 1402.0, + 712.0, + 294.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 709.0, + 1404.0, + 709.0, + 1404.0, + 741.0, + 295.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 735.0, + 383.0, + 735.0, + 383.0, + 771.0, + 293.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 735.0, + 1406.0, + 735.0, + 1406.0, + 771.0, + 411.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 766.0, + 720.0, + 766.0, + 720.0, + 796.0, + 295.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 766.0, + 1405.0, + 766.0, + 1405.0, + 796.0, + 751.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 793.0, + 1406.0, + 793.0, + 1406.0, + 826.0, + 294.0, + 826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 820.0, + 1226.0, + 820.0, + 1226.0, + 852.0, + 293.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1866.0, + 514.0, + 1866.0, + 514.0, + 1914.0, + 292.0, + 1914.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, + 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, + 861.0, + 2085.0, + 861.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1106.0, + 1404.0, + 1106.0, + 1404.0, + 1141.0, + 295.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1136.0, + 1404.0, + 1136.0, + 1404.0, + 1171.0, + 294.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1169.0, + 1402.0, + 1169.0, + 1402.0, + 1201.0, + 295.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1199.0, + 1404.0, + 1199.0, + 1404.0, + 1231.0, + 294.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1230.0, + 1405.0, + 1230.0, + 1405.0, + 1261.0, + 295.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1260.0, + 1405.0, + 1260.0, + 1405.0, + 1292.0, + 296.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1289.0, + 1406.0, + 1289.0, + 1406.0, + 1324.0, + 294.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1322.0, + 1405.0, + 1322.0, + 1405.0, + 1353.0, + 296.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1350.0, + 1406.0, + 1350.0, + 1406.0, + 1384.0, + 292.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1383.0, + 1404.0, + 1383.0, + 1404.0, + 1414.0, + 296.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1412.0, + 1342.0, + 1412.0, + 1342.0, + 1443.0, + 294.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1441.0, + 1405.0, + 1441.0, + 1405.0, + 1476.0, + 295.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1472.0, + 1405.0, + 1472.0, + 1405.0, + 1506.0, + 293.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1504.0, + 1404.0, + 1504.0, + 1404.0, + 1535.0, + 293.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1534.0, + 1402.0, + 1534.0, + 1402.0, + 1566.0, + 295.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1562.0, + 1404.0, + 1562.0, + 1404.0, + 1599.0, + 292.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1592.0, + 1405.0, + 1592.0, + 1405.0, + 1629.0, + 292.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1624.0, + 509.0, + 1624.0, + 509.0, + 1659.0, + 295.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 875.0, + 1405.0, + 875.0, + 1405.0, + 912.0, + 293.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 907.0, + 1404.0, + 907.0, + 1404.0, + 940.0, + 292.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 938.0, + 1404.0, + 938.0, + 1404.0, + 972.0, + 294.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 969.0, + 1405.0, + 969.0, + 1405.0, + 1003.0, + 294.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 996.0, + 1404.0, + 996.0, + 1404.0, + 1036.0, + 292.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1030.0, + 1405.0, + 1030.0, + 1405.0, + 1064.0, + 294.0, + 1064.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1058.0, + 1089.0, + 1058.0, + 1089.0, + 1097.0, + 293.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1669.0, + 1404.0, + 1669.0, + 1404.0, + 1705.0, + 295.0, + 1705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1701.0, + 1403.0, + 1701.0, + 1403.0, + 1734.0, + 297.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1731.0, + 1406.0, + 1731.0, + 1406.0, + 1764.0, + 297.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1763.0, + 1404.0, + 1763.0, + 1404.0, + 1794.0, + 295.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1794.0, + 971.0, + 1794.0, + 971.0, + 1827.0, + 297.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1976.0, + 294.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1975.0, + 1404.0, + 1975.0, + 1404.0, + 2005.0, + 296.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2001.0, + 949.0, + 2001.0, + 949.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 2001.0, + 1402.0, + 2001.0, + 1402.0, + 2037.0, + 981.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 862, + 1404, + 862, + 1404, + 1140, + 297, + 1140 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1247, + 1403, + 1247, + 1403, + 1431, + 298, + 1431 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1447, + 1403, + 1447, + 1403, + 1600, + 298, + 1600 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 647, + 1403, + 647, + 1403, + 740, + 298, + 740 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 300, + 414, + 1404, + 414, + 1404, + 538, + 300, + 538 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 301, + 755, + 1400, + 755, + 1400, + 848, + 301, + 848 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 292, + 229, + 1400, + 229, + 1400, + 292, + 292, + 292 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 300, + 308, + 1401, + 308, + 1401, + 400, + 300, + 400 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 300, + 1614, + 1092, + 1614, + 1092, + 1647, + 300, + 1647 + ], + "score": 0.919 + }, + { + "category_id": 0, + "poly": [ + 300, + 585, + 620, + 585, + 620, + 617, + 300, + 617 + ], + "score": 0.903 + }, + { + "category_id": 0, + "poly": [ + 300, + 1185, + 654, + 1185, + 654, + 1217, + 300, + 1217 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.9 + }, + { + "category_id": 1, + "poly": [ + 300, + 1678, + 1404, + 1678, + 1404, + 1771, + 300, + 1771 + ], + "score": 0.847 + }, + { + "category_id": 1, + "poly": [ + 301, + 1788, + 1403, + 1788, + 1403, + 2034, + 301, + 2034 + ], + "score": 0.817 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.757 + }, + { + "category_id": 13, + "poly": [ + 1145, + 817, + 1339, + 817, + 1339, + 850, + 1145, + 850 + ], + "score": 0.93, + "latex": "\\hat { x } _ { t + 1 } = f ( \\hat { x } _ { t } , a _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 556, + 1108, + 622, + 1108, + 622, + 1140, + 556, + 1140 + ], + "score": 0.91, + "latex": "M _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1182, + 896, + 1239, + 896, + 1239, + 927, + 1182, + 927 + ], + "score": 0.91, + "latex": "\\hat { x } _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 454, + 370, + 525, + 370, + 525, + 401, + 454, + 401 + ], + "score": 0.91, + "latex": "\\mathcal { E } _ { t r a i n }" + }, + { + "category_id": 13, + "poly": [ + 703, + 1048, + 759, + 1048, + 759, + 1079, + 703, + 1079 + ], + "score": 0.91, + "latex": "\\hat { x } _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1032, + 369, + 1088, + 369, + 1088, + 400, + 1032, + 400 + ], + "score": 0.91, + "latex": "\\mathcal { E } _ { t e s t }" + }, + { + "category_id": 13, + "poly": [ + 351, + 987, + 407, + 987, + 407, + 1018, + 351, + 1018 + ], + "score": 0.91, + "latex": "\\hat { x } _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1147, + 368, + 1358, + 368, + 1358, + 403, + 1147, + 403 + ], + "score": 0.91, + "latex": "\\mathcal { E } _ { t r a i n } \\cap \\mathcal { E } _ { t e s t } = \\phi" + }, + { + "category_id": 13, + "poly": [ + 571, + 2004, + 688, + 2004, + 688, + 2032, + 571, + 2032 + ], + "score": 0.9, + "latex": "4 m \\times 4 m" + }, + { + "category_id": 13, + "poly": [ + 841, + 1974, + 984, + 1974, + 984, + 2002, + 841, + 2002 + ], + "score": 0.9, + "latex": "4 0 m \\times 4 0 m" + }, + { + "category_id": 13, + "poly": [ + 828, + 864, + 891, + 864, + 891, + 896, + 828, + 896 + ], + "score": 0.9, + "latex": "D _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1336, + 990, + 1393, + 990, + 1393, + 1018, + 1336, + 1018 + ], + "score": 0.89, + "latex": "x _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 747, + 788, + 832, + 788, + 832, + 817, + 747, + 817 + ], + "score": 0.89, + "latex": "\\hat { x } _ { 0 } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1285, + 1078, + 1324, + 1078, + 1324, + 1107, + 1285, + 1107 + ], + "score": 0.88, + "latex": "M _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1365, + 757, + 1393, + 757, + 1393, + 786, + 1365, + 786 + ], + "score": 0.87, + "latex": "\\hat { x _ { t } }" + }, + { + "category_id": 13, + "poly": [ + 997, + 451, + 1027, + 451, + 1027, + 477, + 997, + 477 + ], + "score": 0.86, + "latex": "\\pi _ { e }" + }, + { + "category_id": 13, + "poly": [ + 429, + 1883, + 458, + 1883, + 458, + 1912, + 429, + 1912 + ], + "score": 0.86, + "latex": "\\hat { x } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 619, + 314, + 651, + 314, + 651, + 339, + 619, + 339 + ], + "score": 0.86, + "latex": "\\pi _ { e }" + }, + { + "category_id": 13, + "poly": [ + 1125, + 343, + 1156, + 343, + 1156, + 369, + 1125, + 369 + ], + "score": 0.85, + "latex": "\\pi _ { e }" + }, + { + "category_id": 13, + "poly": [ + 967, + 420, + 997, + 420, + 997, + 447, + 967, + 447 + ], + "score": 0.85, + "latex": "\\pi _ { e }" + }, + { + "category_id": 13, + "poly": [ + 852, + 343, + 884, + 343, + 884, + 369, + 852, + 369 + ], + "score": 0.85, + "latex": "\\pi _ { e }" + }, + { + "category_id": 13, + "poly": [ + 1240, + 791, + 1267, + 791, + 1267, + 817, + 1240, + 817 + ], + "score": 0.84, + "latex": "a _ { t }" + }, + { + "category_id": 13, + "poly": [ + 758, + 865, + 817, + 865, + 817, + 894, + 758, + 894 + ], + "score": 0.82, + "latex": "t + 1" + }, + { + "category_id": 13, + "poly": [ + 1068, + 817, + 1087, + 817, + 1087, + 849, + 1068, + 849 + ], + "score": 0.78, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 298, + 448, + 322, + 448, + 322, + 474, + 298, + 474 + ], + "score": 0.75, + "latex": "R" + }, + { + "category_id": 13, + "poly": [ + 1321, + 759, + 1335, + 759, + 1335, + 783, + 1321, + 783 + ], + "score": 0.73, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 297, + 820, + 310, + 820, + 310, + 845, + 297, + 845 + ], + "score": 0.67, + "latex": "t" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 585.0, + 626.0, + 585.0, + 626.0, + 621.0, + 294.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1185.0, + 657.0, + 1185.0, + 657.0, + 1221.0, + 295.0, + 1221.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": [ + 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, + 865.0, + 757.0, + 865.0, + 757.0, + 897.0, + 296.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 865.0, + 827.0, + 865.0, + 827.0, + 897.0, + 818.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 865.0, + 1405.0, + 865.0, + 1405.0, + 897.0, + 892.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 895.0, + 1181.0, + 895.0, + 1181.0, + 929.0, + 292.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 895.0, + 1406.0, + 895.0, + 1406.0, + 929.0, + 1240.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 926.0, + 1405.0, + 926.0, + 1405.0, + 959.0, + 296.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 954.0, + 1405.0, + 954.0, + 1405.0, + 990.0, + 294.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 981.0, + 350.0, + 981.0, + 350.0, + 1026.0, + 291.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 981.0, + 1335.0, + 981.0, + 1335.0, + 1026.0, + 408.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 981.0, + 1405.0, + 981.0, + 1405.0, + 1026.0, + 1394.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1013.0, + 1404.0, + 1013.0, + 1404.0, + 1051.0, + 294.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1047.0, + 702.0, + 1047.0, + 702.0, + 1080.0, + 296.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 1047.0, + 1404.0, + 1047.0, + 1404.0, + 1080.0, + 760.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1076.0, + 1284.0, + 1076.0, + 1284.0, + 1113.0, + 294.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1325.0, + 1076.0, + 1406.0, + 1076.0, + 1406.0, + 1113.0, + 1325.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1103.0, + 555.0, + 1103.0, + 555.0, + 1146.0, + 293.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 1103.0, + 634.0, + 1103.0, + 634.0, + 1146.0, + 623.0, + 1146.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1246.0, + 1405.0, + 1246.0, + 1405.0, + 1282.0, + 293.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1278.0, + 1404.0, + 1278.0, + 1404.0, + 1314.0, + 294.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1309.0, + 1404.0, + 1309.0, + 1404.0, + 1344.0, + 294.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1338.0, + 1405.0, + 1338.0, + 1405.0, + 1376.0, + 293.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1368.0, + 1407.0, + 1368.0, + 1407.0, + 1405.0, + 293.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1401.0, + 947.0, + 1401.0, + 947.0, + 1434.0, + 292.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1446.0, + 1404.0, + 1446.0, + 1404.0, + 1483.0, + 296.0, + 1483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1475.0, + 1404.0, + 1475.0, + 1404.0, + 1514.0, + 293.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1506.0, + 1404.0, + 1506.0, + 1404.0, + 1543.0, + 293.0, + 1543.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": [ + 296.0, + 1570.0, + 567.0, + 1570.0, + 567.0, + 1603.0, + 296.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 648.0, + 1403.0, + 648.0, + 1403.0, + 681.0, + 296.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 678.0, + 1403.0, + 678.0, + 1403.0, + 714.0, + 292.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 707.0, + 1100.0, + 707.0, + 1100.0, + 745.0, + 293.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 414.0, + 966.0, + 414.0, + 966.0, + 450.0, + 295.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 414.0, + 1405.0, + 414.0, + 1405.0, + 450.0, + 998.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 446.0, + 996.0, + 446.0, + 996.0, + 482.0, + 323.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 446.0, + 1405.0, + 446.0, + 1405.0, + 482.0, + 1028.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 477.0, + 1405.0, + 477.0, + 1405.0, + 510.0, + 293.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 509.0, + 1295.0, + 509.0, + 1295.0, + 541.0, + 295.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 752.0, + 1320.0, + 752.0, + 1320.0, + 792.0, + 294.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 752.0, + 1364.0, + 752.0, + 1364.0, + 792.0, + 1336.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 752.0, + 1405.0, + 752.0, + 1405.0, + 792.0, + 1394.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 786.0, + 746.0, + 786.0, + 746.0, + 822.0, + 293.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 786.0, + 1239.0, + 786.0, + 1239.0, + 822.0, + 833.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 786.0, + 1404.0, + 786.0, + 1404.0, + 822.0, + 1268.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 816.0, + 296.0, + 816.0, + 296.0, + 853.0, + 293.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 816.0, + 1067.0, + 816.0, + 1067.0, + 853.0, + 311.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 816.0, + 1144.0, + 816.0, + 1144.0, + 853.0, + 1088.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 816.0, + 1350.0, + 816.0, + 1350.0, + 853.0, + 1340.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 1405.0, + 230.0, + 1405.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 261.0, + 1135.0, + 261.0, + 1135.0, + 297.0, + 292.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 306.0, + 618.0, + 306.0, + 618.0, + 343.0, + 295.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 306.0, + 1405.0, + 306.0, + 1405.0, + 343.0, + 652.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 338.0, + 851.0, + 338.0, + 851.0, + 372.0, + 295.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 338.0, + 1124.0, + 338.0, + 1124.0, + 372.0, + 885.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1157.0, + 338.0, + 1406.0, + 338.0, + 1406.0, + 372.0, + 1157.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 368.0, + 453.0, + 368.0, + 453.0, + 406.0, + 295.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 368.0, + 1031.0, + 368.0, + 1031.0, + 406.0, + 526.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 368.0, + 1146.0, + 368.0, + 1146.0, + 406.0, + 1089.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1359.0, + 368.0, + 1371.0, + 368.0, + 1371.0, + 406.0, + 1359.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1611.0, + 1098.0, + 1611.0, + 1098.0, + 1652.0, + 294.0, + 1652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1679.0, + 1403.0, + 1679.0, + 1403.0, + 1712.0, + 296.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1709.0, + 1403.0, + 1709.0, + 1403.0, + 1743.0, + 332.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1741.0, + 555.0, + 1741.0, + 555.0, + 1776.0, + 332.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1787.0, + 1403.0, + 1787.0, + 1403.0, + 1826.0, + 294.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1817.0, + 1404.0, + 1817.0, + 1404.0, + 1856.0, + 329.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1852.0, + 1405.0, + 1852.0, + 1405.0, + 1886.0, + 330.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1880.0, + 428.0, + 1880.0, + 428.0, + 1919.0, + 326.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 1880.0, + 1407.0, + 1880.0, + 1407.0, + 1919.0, + 459.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1912.0, + 1405.0, + 1912.0, + 1405.0, + 1946.0, + 329.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1940.0, + 1409.0, + 1940.0, + 1409.0, + 1980.0, + 326.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1973.0, + 840.0, + 1973.0, + 840.0, + 2007.0, + 329.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1973.0, + 1405.0, + 1973.0, + 1405.0, + 2007.0, + 985.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 2001.0, + 570.0, + 2001.0, + 570.0, + 2040.0, + 327.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 2001.0, + 1404.0, + 2001.0, + 1404.0, + 2040.0, + 689.0, + 2040.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 817, + 1404, + 817, + 1404, + 1123, + 297, + 1123 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1243, + 1404, + 1243, + 1404, + 1520, + 298, + 1520 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1619, + 1404, + 1619, + 1404, + 1897, + 298, + 1897 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 468, + 1404, + 468, + 1404, + 717, + 298, + 717 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1912, + 1402, + 1912, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 319, + 229, + 1400, + 229, + 1400, + 292, + 319, + 292 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 306, + 305, + 1399, + 305, + 1399, + 367, + 306, + 367 + ], + "score": 0.937 + }, + { + "category_id": 0, + "poly": [ + 300, + 759, + 642, + 759, + 642, + 789, + 300, + 789 + ], + "score": 0.903 + }, + { + "category_id": 0, + "poly": [ + 300, + 1173, + 557, + 1173, + 557, + 1207, + 300, + 1207 + ], + "score": 0.899 + }, + { + "category_id": 0, + "poly": [ + 300, + 409, + 612, + 409, + 612, + 441, + 300, + 441 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.888 + }, + { + "category_id": 0, + "poly": [ + 300, + 1562, + 640, + 1562, + 640, + 1593, + 300, + 1593 + ], + "score": 0.878 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2111, + 841, + 2111 + ], + "score": 0.681 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2111, + 841, + 2111 + ], + "score": 0.119 + }, + { + "category_id": 13, + "poly": [ + 1173, + 499, + 1255, + 499, + 1255, + 533, + 1173, + 533 + ], + "score": 0.93, + "latex": "C ( { \\bar { M } } _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 704, + 652, + 864, + 652, + 864, + 686, + 704, + 686 + ], + "score": 0.93, + "latex": "B u m p ( t + 1 )" + }, + { + "category_id": 13, + "poly": [ + 1040, + 560, + 1265, + 560, + 1265, + 594, + 1040, + 594 + ], + "score": 0.92, + "latex": "C ( M _ { t + 1 } ) - C ( M _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 297, + 650, + 612, + 650, + 612, + 686, + 297, + 686 + ], + "score": 0.91, + "latex": "R _ { i n t } ^ { c o l l } ( t ) = - B u m \\bf { \\bar { p } } ( t + 1 )" + }, + { + "category_id": 13, + "poly": [ + 522, + 685, + 580, + 685, + 580, + 719, + 522, + 719 + ], + "score": 0.91, + "latex": "R _ { i n t } ^ { c o l l }" + }, + { + "category_id": 13, + "poly": [ + 298, + 560, + 386, + 560, + 386, + 594, + 298, + 594 + ], + "score": 0.91, + "latex": "R _ { i n t } ^ { c o v } ( t )" + }, + { + "category_id": 13, + "poly": [ + 693, + 500, + 732, + 500, + 732, + 530, + 693, + 530 + ], + "score": 0.9, + "latex": "M _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1350, + 1912, + 1393, + 1912, + 1393, + 1941, + 1350, + 1941 + ], + "score": 0.86, + "latex": "6 0 ^ { \\circ }" + }, + { + "category_id": 13, + "poly": [ + 955, + 1065, + 987, + 1065, + 987, + 1092, + 955, + 1092 + ], + "score": 0.85, + "latex": "\\pi _ { e }" + }, + { + "category_id": 13, + "poly": [ + 412, + 687, + 469, + 687, + 469, + 719, + 412, + 719 + ], + "score": 0.84, + "latex": "R _ { i n t } ^ { c o v }" + }, + { + "category_id": 13, + "poly": [ + 372, + 690, + 399, + 690, + 399, + 717, + 372, + 717 + ], + "score": 0.74, + "latex": "a _ { t }" + }, + { + "category_id": 13, + "poly": [ + 527, + 564, + 541, + 564, + 541, + 588, + 527, + 588 + ], + "score": 0.7, + "latex": "t" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 758.0, + 646.0, + 758.0, + 646.0, + 793.0, + 295.0, + 793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1170.0, + 561.0, + 1170.0, + 561.0, + 1213.0, + 293.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 406.0, + 616.0, + 406.0, + 616.0, + 446.0, + 294.0, + 446.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, + 1560.0, + 643.0, + 1560.0, + 643.0, + 1596.0, + 295.0, + 1596.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": [ + 838.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 818.0, + 1404.0, + 818.0, + 1404.0, + 853.0, + 295.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 847.0, + 1405.0, + 847.0, + 1405.0, + 885.0, + 291.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 877.0, + 1404.0, + 877.0, + 1404.0, + 913.0, + 294.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 909.0, + 1405.0, + 909.0, + 1405.0, + 945.0, + 292.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 940.0, + 1405.0, + 940.0, + 1405.0, + 975.0, + 294.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 970.0, + 1405.0, + 970.0, + 1405.0, + 1006.0, + 294.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 998.0, + 1407.0, + 998.0, + 1407.0, + 1037.0, + 292.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1030.0, + 1405.0, + 1030.0, + 1405.0, + 1069.0, + 292.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1061.0, + 954.0, + 1061.0, + 954.0, + 1097.0, + 294.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 1061.0, + 1405.0, + 1061.0, + 1405.0, + 1097.0, + 988.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1091.0, + 1291.0, + 1091.0, + 1291.0, + 1126.0, + 297.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1245.0, + 1402.0, + 1245.0, + 1402.0, + 1278.0, + 297.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1273.0, + 1406.0, + 1273.0, + 1406.0, + 1312.0, + 292.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1300.0, + 1406.0, + 1300.0, + 1406.0, + 1345.0, + 292.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1336.0, + 1403.0, + 1336.0, + 1403.0, + 1371.0, + 293.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1366.0, + 1405.0, + 1366.0, + 1405.0, + 1401.0, + 293.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1399.0, + 1401.0, + 1399.0, + 1401.0, + 1431.0, + 296.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1429.0, + 1404.0, + 1429.0, + 1404.0, + 1461.0, + 296.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1459.0, + 1406.0, + 1459.0, + 1406.0, + 1495.0, + 294.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1489.0, + 905.0, + 1489.0, + 905.0, + 1524.0, + 293.0, + 1524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1618.0, + 1406.0, + 1618.0, + 1406.0, + 1656.0, + 295.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1652.0, + 1404.0, + 1652.0, + 1404.0, + 1684.0, + 296.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1684.0, + 1402.0, + 1684.0, + 1402.0, + 1713.0, + 296.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1708.0, + 1404.0, + 1708.0, + 1404.0, + 1749.0, + 292.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1741.0, + 1405.0, + 1741.0, + 1405.0, + 1779.0, + 292.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1774.0, + 1402.0, + 1774.0, + 1402.0, + 1807.0, + 296.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1804.0, + 1402.0, + 1804.0, + 1402.0, + 1837.0, + 296.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1834.0, + 1405.0, + 1834.0, + 1405.0, + 1870.0, + 293.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1862.0, + 849.0, + 1862.0, + 849.0, + 1902.0, + 293.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 468.0, + 1404.0, + 468.0, + 1404.0, + 504.0, + 295.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 498.0, + 692.0, + 498.0, + 692.0, + 536.0, + 293.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 498.0, + 1172.0, + 498.0, + 1172.0, + 536.0, + 733.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 498.0, + 1406.0, + 498.0, + 1406.0, + 536.0, + 1256.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 529.0, + 1404.0, + 529.0, + 1404.0, + 563.0, + 294.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 556.0, + 297.0, + 556.0, + 297.0, + 601.0, + 293.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 556.0, + 526.0, + 556.0, + 526.0, + 601.0, + 387.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 556.0, + 1039.0, + 556.0, + 1039.0, + 601.0, + 542.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 556.0, + 1404.0, + 556.0, + 1404.0, + 601.0, + 1266.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 589.0, + 1405.0, + 589.0, + 1405.0, + 625.0, + 292.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 619.0, + 1405.0, + 619.0, + 1405.0, + 657.0, + 292.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 635.0, + 296.0, + 635.0, + 296.0, + 703.0, + 284.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 635.0, + 703.0, + 635.0, + 703.0, + 703.0, + 613.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 635.0, + 1415.0, + 635.0, + 1415.0, + 703.0, + 865.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 674.0, + 371.0, + 674.0, + 371.0, + 732.0, + 287.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 674.0, + 411.0, + 674.0, + 411.0, + 732.0, + 400.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 674.0, + 521.0, + 674.0, + 521.0, + 732.0, + 470.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 674.0, + 1032.0, + 674.0, + 1032.0, + 732.0, + 581.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1912.0, + 1349.0, + 1912.0, + 1349.0, + 1944.0, + 297.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1944.0, + 1394.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1978.0, + 294.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 1045.0, + 2004.0, + 1045.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 263.0, + 327.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 259.0, + 851.0, + 259.0, + 851.0, + 295.0, + 331.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 307.0, + 1402.0, + 307.0, + 1402.0, + 339.0, + 299.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 337.0, + 1007.0, + 337.0, + 1007.0, + 369.0, + 329.0, + 369.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1667, + 1404, + 1667, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1560, + 1403, + 1560, + 1403, + 1651, + 299, + 1651 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 299, + 414, + 1402, + 414, + 1402, + 539, + 299, + 539 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 297, + 991, + 1403, + 991, + 1403, + 1083, + 297, + 1083 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 1400, + 229, + 1400, + 322, + 297, + 322 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 299, + 1111, + 1403, + 1111, + 1403, + 1295, + 299, + 1295 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 299, + 1307, + 1403, + 1307, + 1403, + 1461, + 299, + 1461 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 294, + 337, + 1400, + 337, + 1400, + 400, + 294, + 400 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 300, + 612, + 1403, + 612, + 1403, + 797, + 300, + 797 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 299, + 810, + 1402, + 810, + 1402, + 963, + 299, + 963 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 294, + 554, + 1392, + 554, + 1392, + 586, + 294, + 586 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 299, + 1500, + 616, + 1500, + 616, + 1532, + 299, + 1532 + ], + "score": 0.905 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 859, + 2089, + 859, + 2112, + 840, + 2112 + ], + "score": 0.773 + }, + { + "category_id": 13, + "poly": [ + 389, + 475, + 742, + 475, + 742, + 511, + 389, + 511 + ], + "score": 0.93, + "latex": "R _ { i n t } ( t ) = \\alpha R _ { i n t } ^ { \\mathrm { c o v } } ( t ) + \\beta R _ { i n t } ^ { \\mathrm { c o l l } } ( t )" + }, + { + "category_id": 13, + "poly": [ + 816, + 477, + 870, + 477, + 870, + 511, + 816, + 511 + ], + "score": 0.92, + "latex": "R _ { i n t } ^ { \\mathrm { c o v } }" + }, + { + "category_id": 13, + "poly": [ + 453, + 368, + 592, + 368, + 592, + 402, + 453, + 402 + ], + "score": 0.92, + "latex": "R _ { e x t } ( t ) = 0" + }, + { + "category_id": 13, + "poly": [ + 689, + 1700, + 788, + 1700, + 788, + 1729, + 689, + 1729 + ], + "score": 0.92, + "latex": "\\hat { x } _ { t } = x _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1179, + 475, + 1235, + 475, + 1235, + 511, + 1179, + 511 + ], + "score": 0.92, + "latex": "R _ { i n t } ^ { \\mathrm { c o l l } }" + }, + { + "category_id": 13, + "poly": [ + 389, + 510, + 439, + 510, + 439, + 540, + 389, + 540 + ], + "score": 0.89, + "latex": "\\alpha , \\beta" + }, + { + "category_id": 13, + "poly": [ + 490, + 2003, + 598, + 2003, + 598, + 2033, + 490, + 2033 + ], + "score": 0.86, + "latex": "\\mathbf { I L } + \\mathbf { R L }" + }, + { + "category_id": 13, + "poly": [ + 1151, + 1973, + 1258, + 1973, + 1258, + 2003, + 1151, + 2003 + ], + "score": 0.85, + "latex": "( \\mathbf { I L } + \\mathbf { R L }" + }, + { + "category_id": 13, + "poly": [ + 741, + 1882, + 771, + 1882, + 771, + 1910, + 741, + 1910 + ], + "score": 0.85, + "latex": "9 ^ { \\circ }" + }, + { + "category_id": 13, + "poly": [ + 370, + 1821, + 478, + 1821, + 478, + 1851, + 370, + 1851 + ], + "score": 0.85, + "latex": "\\mathbf { \\left( I L + R L \\right. }" + }, + { + "category_id": 13, + "poly": [ + 680, + 293, + 709, + 293, + 709, + 320, + 680, + 320 + ], + "score": 0.84, + "latex": "9 ^ { \\circ }" + }, + { + "category_id": 13, + "poly": [ + 872, + 1622, + 901, + 1622, + 901, + 1652, + 872, + 1652 + ], + "score": 0.84, + "latex": "\\hat { x } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 723, + 1624, + 753, + 1624, + 753, + 1652, + 723, + 1652 + ], + "score": 0.84, + "latex": "x _ { t }" + }, + { + "category_id": 13, + "poly": [ + 574, + 1173, + 613, + 1173, + 613, + 1203, + 574, + 1203 + ], + "score": 0.83, + "latex": "M _ { t }" + }, + { + "category_id": 13, + "poly": [ + 479, + 293, + 508, + 293, + 508, + 320, + 479, + 320 + ], + "score": 0.83, + "latex": "9 ^ { \\circ }" + }, + { + "category_id": 13, + "poly": [ + 664, + 2003, + 820, + 2003, + 820, + 2034, + 664, + 2034 + ], + "score": 0.74, + "latex": "\\mathbf { M a p } + \\mathbf { R G B } " + }, + { + "category_id": 13, + "poly": [ + 704, + 262, + 780, + 262, + 780, + 291, + 704, + 291 + ], + "score": 0.7, + "latex": "0 . 2 5 \\mathrm { m }" + }, + { + "category_id": 13, + "poly": [ + 978, + 262, + 1053, + 262, + 1053, + 292, + 978, + 292 + ], + "score": 0.68, + "latex": "0 . 2 5 \\mathrm { m }" + }, + { + "category_id": 13, + "poly": [ + 1183, + 262, + 1259, + 262, + 1259, + 292, + 1183, + 292 + ], + "score": 0.65, + "latex": "0 . 2 5 \\mathrm { m }" + }, + { + "category_id": 13, + "poly": [ + 297, + 292, + 373, + 292, + 373, + 322, + 297, + 322 + ], + "score": 0.63, + "latex": "0 . 2 5 \\mathrm { m }" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1496.0, + 622.0, + 1496.0, + 622.0, + 1539.0, + 293.0, + 1539.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": [ + 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, + 1667.0, + 1405.0, + 1667.0, + 1405.0, + 1702.0, + 295.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1700.0, + 688.0, + 1700.0, + 688.0, + 1734.0, + 294.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1700.0, + 1406.0, + 1700.0, + 1406.0, + 1734.0, + 789.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1729.0, + 1404.0, + 1729.0, + 1404.0, + 1763.0, + 294.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1761.0, + 1404.0, + 1761.0, + 1404.0, + 1795.0, + 294.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1788.0, + 1406.0, + 1788.0, + 1406.0, + 1825.0, + 291.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1820.0, + 369.0, + 1820.0, + 369.0, + 1857.0, + 292.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 1820.0, + 1407.0, + 1820.0, + 1407.0, + 1857.0, + 479.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1851.0, + 1405.0, + 1851.0, + 1405.0, + 1888.0, + 292.0, + 1888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1877.0, + 740.0, + 1877.0, + 740.0, + 1919.0, + 291.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 1877.0, + 1405.0, + 1877.0, + 1405.0, + 1919.0, + 772.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1910.0, + 1405.0, + 1910.0, + 1405.0, + 1948.0, + 293.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1979.0, + 292.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1973.0, + 1150.0, + 1973.0, + 1150.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 1973.0, + 1402.0, + 1973.0, + 1402.0, + 2007.0, + 1259.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2001.0, + 489.0, + 2001.0, + 489.0, + 2038.0, + 295.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 2001.0, + 663.0, + 2001.0, + 663.0, + 2038.0, + 599.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 2001.0, + 1404.0, + 2001.0, + 1404.0, + 2038.0, + 821.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1561.0, + 1403.0, + 1561.0, + 1403.0, + 1595.0, + 297.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1591.0, + 1405.0, + 1591.0, + 1405.0, + 1625.0, + 295.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1621.0, + 722.0, + 1621.0, + 722.0, + 1654.0, + 295.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 1621.0, + 871.0, + 1621.0, + 871.0, + 1654.0, + 754.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 1621.0, + 1366.0, + 1621.0, + 1366.0, + 1654.0, + 902.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 410.0, + 1406.0, + 410.0, + 1406.0, + 452.0, + 293.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 442.0, + 1406.0, + 442.0, + 1406.0, + 481.0, + 293.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 465.0, + 388.0, + 465.0, + 388.0, + 523.0, + 284.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 465.0, + 815.0, + 465.0, + 815.0, + 523.0, + 743.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 465.0, + 1178.0, + 465.0, + 1178.0, + 523.0, + 871.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 465.0, + 1416.0, + 465.0, + 1416.0, + 523.0, + 1236.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 507.0, + 388.0, + 507.0, + 388.0, + 543.0, + 294.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 507.0, + 1131.0, + 507.0, + 1131.0, + 543.0, + 440.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 987.0, + 1404.0, + 987.0, + 1404.0, + 1027.0, + 292.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1023.0, + 1405.0, + 1023.0, + 1405.0, + 1056.0, + 293.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1053.0, + 579.0, + 1053.0, + 579.0, + 1086.0, + 295.0, + 1086.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 1404.0, + 230.0, + 1404.0, + 263.0, + 295.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 261.0, + 703.0, + 261.0, + 703.0, + 295.0, + 293.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 261.0, + 977.0, + 261.0, + 977.0, + 295.0, + 781.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 261.0, + 1182.0, + 261.0, + 1182.0, + 295.0, + 1054.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 295.0, + 1260.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 291.0, + 478.0, + 291.0, + 478.0, + 325.0, + 374.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 291.0, + 679.0, + 291.0, + 679.0, + 325.0, + 509.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 291.0, + 718.0, + 291.0, + 718.0, + 325.0, + 710.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1112.0, + 1402.0, + 1112.0, + 1402.0, + 1143.0, + 297.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1141.0, + 1407.0, + 1141.0, + 1407.0, + 1176.0, + 328.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1170.0, + 573.0, + 1170.0, + 573.0, + 1207.0, + 328.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 1170.0, + 1405.0, + 1170.0, + 1405.0, + 1207.0, + 614.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1202.0, + 1405.0, + 1202.0, + 1405.0, + 1236.0, + 328.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1231.0, + 1407.0, + 1231.0, + 1407.0, + 1268.0, + 328.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1263.0, + 603.0, + 1263.0, + 603.0, + 1298.0, + 328.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1307.0, + 1404.0, + 1307.0, + 1404.0, + 1340.0, + 294.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1338.0, + 1407.0, + 1338.0, + 1407.0, + 1371.0, + 329.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1367.0, + 1403.0, + 1367.0, + 1403.0, + 1404.0, + 329.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1396.0, + 1405.0, + 1396.0, + 1405.0, + 1436.0, + 327.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1429.0, + 1330.0, + 1429.0, + 1330.0, + 1463.0, + 328.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 334.0, + 1404.0, + 334.0, + 1404.0, + 375.0, + 294.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 369.0, + 452.0, + 369.0, + 452.0, + 402.0, + 293.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 369.0, + 603.0, + 369.0, + 603.0, + 402.0, + 593.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 612.0, + 1405.0, + 612.0, + 1405.0, + 647.0, + 296.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 643.0, + 1402.0, + 643.0, + 1402.0, + 675.0, + 330.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 671.0, + 1403.0, + 671.0, + 1403.0, + 710.0, + 328.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 707.0, + 1404.0, + 707.0, + 1404.0, + 739.0, + 329.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 739.0, + 1403.0, + 739.0, + 1403.0, + 767.0, + 330.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 764.0, + 1107.0, + 764.0, + 1107.0, + 799.0, + 328.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 810.0, + 1401.0, + 810.0, + 1401.0, + 843.0, + 294.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 840.0, + 1404.0, + 840.0, + 1404.0, + 873.0, + 330.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 871.0, + 1404.0, + 871.0, + 1404.0, + 904.0, + 330.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 900.0, + 1406.0, + 900.0, + 1406.0, + 937.0, + 329.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 929.0, + 1125.0, + 929.0, + 1125.0, + 967.0, + 328.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 549.0, + 1397.0, + 549.0, + 1397.0, + 591.0, + 295.0, + 591.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 881, + 1404, + 881, + 1404, + 1308, + 297, + 1308 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1324, + 1404, + 1324, + 1404, + 1630, + 297, + 1630 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 712, + 1403, + 712, + 1403, + 866, + 298, + 866 + ], + "score": 0.975 + }, + { + "category_id": 3, + "poly": [ + 352, + 143, + 1354, + 143, + 1354, + 474, + 352, + 474 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1720, + 1403, + 1720, + 1403, + 1812, + 299, + 1812 + ], + "score": 0.973 + }, + { + "category_id": 4, + "poly": [ + 296, + 483, + 1405, + 483, + 1405, + 649, + 296, + 649 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 302, + 1828, + 1399, + 1828, + 1399, + 1921, + 302, + 1921 + ], + "score": 0.958 + }, + { + "category_id": 2, + "poly": [ + 298, + 1950, + 1403, + 1950, + 1403, + 2033, + 298, + 2033 + ], + "score": 0.946 + }, + { + "category_id": 0, + "poly": [ + 300, + 1666, + 603, + 1666, + 603, + 1697, + 300, + 1697 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 814, + 76, + 814, + 104, + 298, + 104 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 858, + 2088, + 858, + 2111, + 842, + 2111 + ], + "score": 0.71 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2111, + 841, + 2111 + ], + "score": 0.101 + }, + { + "category_id": 13, + "poly": [ + 297, + 913, + 354, + 913, + 354, + 944, + 297, + 944 + ], + "score": 0.91, + "latex": "\\hat { x } _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1223, + 1245, + 1312, + 1245, + 1312, + 1276, + 1223, + 1276 + ], + "score": 0.9, + "latex": "9 8 . 9 m ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 569, + 1275, + 672, + 1275, + 672, + 1307, + 569, + 1307 + ], + "score": 0.88, + "latex": "1 1 7 . 4 m ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 846, + 1156, + 887, + 1156, + 887, + 1185, + 846, + 1185 + ], + "score": 0.86, + "latex": "4 \\%" + }, + { + "category_id": 13, + "poly": [ + 686, + 1277, + 739, + 1277, + 739, + 1307, + 686, + 1307 + ], + "score": 0.85, + "latex": "10 \\%" + }, + { + "category_id": 13, + "poly": [ + 585, + 944, + 606, + 944, + 606, + 975, + 585, + 975 + ], + "score": 0.85, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 298, + 2009, + 341, + 2009, + 341, + 2034, + 298, + 2034 + ], + "score": 0.85, + "latex": "x , y" + }, + { + "category_id": 13, + "poly": [ + 297, + 1246, + 352, + 1246, + 352, + 1276, + 297, + 1276 + ], + "score": 0.85, + "latex": "10 \\%" + }, + { + "category_id": 13, + "poly": [ + 385, + 2005, + 412, + 2005, + 412, + 2031, + 385, + 2031 + ], + "score": 0.83, + "latex": "9 ^ { \\circ }" + }, + { + "category_id": 13, + "poly": [ + 701, + 1979, + 731, + 1979, + 731, + 2007, + 701, + 2007 + ], + "score": 0.81, + "latex": "2 \\eta" + }, + { + "category_id": 13, + "poly": [ + 459, + 1956, + 477, + 1956, + 477, + 1979, + 459, + 1979 + ], + "score": 0.76, + "latex": "\\eta" + }, + { + "category_id": 13, + "poly": [ + 538, + 2007, + 553, + 2007, + 553, + 2030, + 538, + 2030 + ], + "score": 0.66, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 1384, + 1956, + 1402, + 1956, + 1402, + 1979, + 1384, + 1979 + ], + "score": 0.53, + "latex": "\\eta" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 150.0, + 1281.0, + 150.0, + 1281.0, + 175.0, + 1118.0, + 175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 152.0, + 717.0, + 152.0, + 717.0, + 429.0, + 676.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 159.0, + 626.0, + 159.0, + 626.0, + 181.0, + 452.0, + 181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 164.0, + 1084.0, + 164.0, + 1084.0, + 192.0, + 1038.0, + 192.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 165.0, + 745.0, + 165.0, + 745.0, + 193.0, + 701.0, + 193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 169.0, + 417.0, + 169.0, + 417.0, + 199.0, + 371.0, + 199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 169.0, + 1263.0, + 169.0, + 1263.0, + 194.0, + 1118.0, + 194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 174.0, + 1127.0, + 174.0, + 1127.0, + 186.0, + 1107.0, + 186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 177.0, + 559.0, + 177.0, + 559.0, + 199.0, + 451.0, + 199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 185.0, + 1257.0, + 185.0, + 1257.0, + 213.0, + 1121.0, + 213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 190.0, + 587.0, + 190.0, + 587.0, + 219.0, + 449.0, + 219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 207.0, + 414.0, + 207.0, + 414.0, + 364.0, + 346.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 210.0, + 589.0, + 210.0, + 589.0, + 256.0, + 448.0, + 256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 202.0, + 746.0, + 202.0, + 746.0, + 242.0, + 701.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 203.0, + 1083.0, + 203.0, + 1083.0, + 365.0, + 1013.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 207.0, + 1236.0, + 207.0, + 1236.0, + 232.0, + 1122.0, + 232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 246.0, + 416.0, + 246.0, + 416.0, + 274.0, + 372.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 247.0, + 514.0, + 247.0, + 514.0, + 274.0, + 449.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 240.0, + 746.0, + 240.0, + 746.0, + 274.0, + 704.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 242.0, + 1083.0, + 242.0, + 1083.0, + 270.0, + 1040.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 282.0, + 412.0, + 282.0, + 412.0, + 311.0, + 382.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 282.0, + 745.0, + 282.0, + 745.0, + 316.0, + 713.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 282.0, + 1080.0, + 282.0, + 1080.0, + 310.0, + 1050.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 321.0, + 413.0, + 321.0, + 413.0, + 348.0, + 384.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 324.0, + 745.0, + 324.0, + 745.0, + 351.0, + 714.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 322.0, + 1081.0, + 322.0, + 1081.0, + 350.0, + 1050.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 357.0, + 412.0, + 357.0, + 412.0, + 386.0, + 382.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 362.0, + 744.0, + 362.0, + 744.0, + 390.0, + 714.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 361.0, + 1081.0, + 361.0, + 1081.0, + 388.0, + 1050.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 788.0, + 386.0, + 969.0, + 386.0, + 969.0, + 411.0, + 788.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 398.0, + 411.0, + 398.0, + 411.0, + 420.0, + 394.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 407.0, + 743.0, + 407.0, + 743.0, + 426.0, + 726.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 785.0, + 406.0, + 851.0, + 406.0, + 851.0, + 429.0, + 785.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 403.0, + 1081.0, + 403.0, + 1081.0, + 424.0, + 1062.0, + 424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 429.0, + 433.0, + 429.0, + 433.0, + 449.0, + 414.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 426.0, + 618.0, + 426.0, + 618.0, + 473.0, + 459.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 426.0, + 674.0, + 426.0, + 674.0, + 450.0, + 623.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 439.0, + 766.0, + 439.0, + 766.0, + 458.0, + 749.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 436.0, + 804.0, + 436.0, + 804.0, + 460.0, + 780.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 816.0, + 439.0, + 838.0, + 439.0, + 838.0, + 458.0, + 816.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 433.0, + 1019.0, + 433.0, + 1019.0, + 480.0, + 842.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 434.0, + 1102.0, + 434.0, + 1102.0, + 456.0, + 1084.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 431.0, + 1357.0, + 431.0, + 1357.0, + 479.0, + 1131.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 369.5, + 1141.0, + 369.5, + 1141.0, + 381.0, + 1106.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 483.0, + 1403.0, + 483.0, + 1403.0, + 513.0, + 295.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 508.0, + 1403.0, + 508.0, + 1403.0, + 542.0, + 293.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 535.0, + 1407.0, + 535.0, + 1407.0, + 571.0, + 294.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 564.0, + 1405.0, + 564.0, + 1405.0, + 598.0, + 293.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 591.0, + 1405.0, + 591.0, + 1405.0, + 627.0, + 293.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 622.0, + 1159.0, + 622.0, + 1159.0, + 652.0, + 295.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 1945.0, + 458.0, + 1945.0, + 458.0, + 1985.0, + 328.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 1945.0, + 1383.0, + 1945.0, + 1383.0, + 1985.0, + 478.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1945.0, + 1408.0, + 1945.0, + 1408.0, + 1985.0, + 1403.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1979.0, + 700.0, + 1979.0, + 700.0, + 2008.0, + 296.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 1979.0, + 1404.0, + 1979.0, + 1404.0, + 2008.0, + 732.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2003.0, + 297.0, + 2003.0, + 297.0, + 2038.0, + 292.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 2003.0, + 384.0, + 2003.0, + 384.0, + 2038.0, + 342.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 2003.0, + 537.0, + 2003.0, + 537.0, + 2038.0, + 413.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 2003.0, + 967.0, + 2003.0, + 967.0, + 2038.0, + 554.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1663.0, + 608.0, + 1663.0, + 608.0, + 1702.0, + 295.0, + 1702.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": [ + 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, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2119.0, + 840.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 880.0, + 1402.0, + 880.0, + 1402.0, + 915.0, + 296.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 911.0, + 296.0, + 911.0, + 296.0, + 946.0, + 292.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 911.0, + 1406.0, + 911.0, + 1406.0, + 946.0, + 355.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 944.0, + 584.0, + 944.0, + 584.0, + 975.0, + 295.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 944.0, + 1402.0, + 944.0, + 1402.0, + 975.0, + 607.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 970.0, + 1407.0, + 970.0, + 1407.0, + 1008.0, + 291.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1005.0, + 1406.0, + 1005.0, + 1406.0, + 1036.0, + 292.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1032.0, + 1407.0, + 1032.0, + 1407.0, + 1069.0, + 291.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1063.0, + 1406.0, + 1063.0, + 1406.0, + 1098.0, + 294.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1095.0, + 1404.0, + 1095.0, + 1404.0, + 1130.0, + 294.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1125.0, + 1406.0, + 1125.0, + 1406.0, + 1159.0, + 292.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1155.0, + 845.0, + 1155.0, + 845.0, + 1191.0, + 292.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1155.0, + 1406.0, + 1155.0, + 1406.0, + 1191.0, + 888.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1183.0, + 1405.0, + 1183.0, + 1405.0, + 1219.0, + 294.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1216.0, + 1401.0, + 1216.0, + 1401.0, + 1248.0, + 295.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1244.0, + 1222.0, + 1244.0, + 1222.0, + 1282.0, + 353.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1313.0, + 1244.0, + 1407.0, + 1244.0, + 1407.0, + 1282.0, + 1313.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1276.0, + 568.0, + 1276.0, + 568.0, + 1314.0, + 294.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 1276.0, + 685.0, + 1276.0, + 685.0, + 1314.0, + 673.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 1276.0, + 1369.0, + 1276.0, + 1369.0, + 1314.0, + 740.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1322.0, + 1405.0, + 1322.0, + 1405.0, + 1360.0, + 294.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1354.0, + 1406.0, + 1354.0, + 1406.0, + 1389.0, + 294.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1379.0, + 1405.0, + 1379.0, + 1405.0, + 1422.0, + 291.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1414.0, + 1405.0, + 1414.0, + 1405.0, + 1450.0, + 292.0, + 1450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1445.0, + 1407.0, + 1445.0, + 1407.0, + 1481.0, + 291.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1478.0, + 1405.0, + 1478.0, + 1405.0, + 1510.0, + 295.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1506.0, + 1407.0, + 1506.0, + 1407.0, + 1542.0, + 294.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1539.0, + 1404.0, + 1539.0, + 1404.0, + 1571.0, + 295.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1566.0, + 1406.0, + 1566.0, + 1406.0, + 1603.0, + 294.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1596.0, + 993.0, + 1596.0, + 993.0, + 1637.0, + 292.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 714.0, + 1404.0, + 714.0, + 1404.0, + 747.0, + 296.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 741.0, + 1405.0, + 741.0, + 1405.0, + 780.0, + 293.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 773.0, + 1405.0, + 773.0, + 1405.0, + 809.0, + 293.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 801.0, + 1405.0, + 801.0, + 1405.0, + 841.0, + 292.0, + 841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 834.0, + 1385.0, + 834.0, + 1385.0, + 870.0, + 294.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1717.0, + 1402.0, + 1717.0, + 1402.0, + 1756.0, + 294.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1750.0, + 1404.0, + 1750.0, + 1404.0, + 1785.0, + 294.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1783.0, + 602.0, + 1783.0, + 602.0, + 1814.0, + 294.0, + 1814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1829.0, + 1404.0, + 1829.0, + 1404.0, + 1862.0, + 297.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1860.0, + 1403.0, + 1860.0, + 1403.0, + 1894.0, + 297.0, + 1894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1889.0, + 1404.0, + 1889.0, + 1404.0, + 1925.0, + 294.0, + 1925.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1147, + 1000, + 1147, + 1000, + 1603, + 299, + 1603 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 804, + 1404, + 804, + 1404, + 1048, + 297, + 1048 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 300, + 1620, + 1000, + 1620, + 1000, + 1895, + 300, + 1895 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 588, + 1404, + 588, + 1404, + 711, + 298, + 711 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 300, + 1911, + 1403, + 1911, + 1403, + 2034, + 300, + 2034 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 341, + 144, + 1349, + 144, + 1349, + 392, + 341, + 392 + ], + "score": 0.971 + }, + { + "category_id": 4, + "poly": [ + 297, + 400, + 1404, + 400, + 1404, + 567, + 297, + 567 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 296, + 725, + 1399, + 725, + 1399, + 789, + 296, + 789 + ], + "score": 0.95 + }, + { + "category_id": 0, + "poly": [ + 298, + 1089, + 931, + 1089, + 931, + 1119, + 298, + 1119 + ], + "score": 0.916 + }, + { + "category_id": 3, + "poly": [ + 1019, + 1172, + 1394, + 1172, + 1394, + 1539, + 1019, + 1539 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 297, + 76, + 814, + 76, + 814, + 104, + 297, + 104 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.791 + }, + { + "category_id": 4, + "poly": [ + 1011, + 1559, + 1401, + 1559, + 1401, + 1836, + 1011, + 1836 + ], + "score": 0.669 + }, + { + "category_id": 13, + "poly": [ + 1012, + 955, + 1052, + 955, + 1052, + 985, + 1012, + 985 + ], + "score": 0.88, + "latex": "m ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 644, + 1243, + 676, + 1243, + 676, + 1270, + 644, + 1270 + ], + "score": 0.86, + "latex": "\\pi _ { e }" + }, + { + "category_id": 13, + "poly": [ + 804, + 1626, + 838, + 1626, + 838, + 1652, + 804, + 1652 + ], + "score": 0.85, + "latex": "\\pi _ { n }" + }, + { + "category_id": 13, + "poly": [ + 538, + 1716, + 573, + 1716, + 573, + 1743, + 538, + 1743 + ], + "score": 0.83, + "latex": "\\pi _ { n }" + }, + { + "category_id": 13, + "poly": [ + 482, + 1717, + 516, + 1717, + 516, + 1743, + 482, + 1743 + ], + "score": 0.83, + "latex": "\\pi _ { n }" + }, + { + "category_id": 13, + "poly": [ + 938, + 1743, + 962, + 1743, + 962, + 1771, + 938, + 1771 + ], + "score": 0.69, + "latex": "\\mathcal { T }" + }, + { + "category_id": 13, + "poly": [ + 911, + 1271, + 933, + 1271, + 933, + 1297, + 911, + 1297 + ], + "score": 0.66, + "latex": "\\mathcal { T }" + }, + { + "category_id": 13, + "poly": [ + 473, + 1836, + 495, + 1836, + 495, + 1862, + 473, + 1862 + ], + "score": 0.49, + "latex": "\\mathcal { T }" + }, + { + "category_id": 13, + "poly": [ + 479, + 590, + 508, + 590, + 508, + 616, + 479, + 616 + ], + "score": 0.41, + "latex": "\\cal { I L }" + }, + { + "category_id": 13, + "poly": [ + 369, + 619, + 428, + 619, + 428, + 648, + 369, + 648 + ], + "score": 0.38, + "latex": "R G B" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 157.0, + 406.0, + 157.0, + 406.0, + 326.0, + 336.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 153.0, + 614.0, + 153.0, + 614.0, + 211.0, + 441.0, + 211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 157.0, + 748.0, + 157.0, + 748.0, + 254.0, + 661.0, + 254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 153.0, + 950.0, + 153.0, + 950.0, + 210.0, + 778.0, + 210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 164.0, + 1082.0, + 164.0, + 1082.0, + 320.0, + 1020.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 157.0, + 1326.0, + 157.0, + 1326.0, + 218.0, + 1116.0, + 218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 215.0, + 404.0, + 215.0, + 404.0, + 240.0, + 363.0, + 240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 442.0, + 204.0, + 528.0, + 204.0, + 528.0, + 231.0, + 442.0, + 231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 779.0, + 206.0, + 865.0, + 206.0, + 865.0, + 229.0, + 779.0, + 229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 216.0, + 1083.0, + 216.0, + 1083.0, + 241.0, + 1044.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 270.0, + 404.0, + 270.0, + 404.0, + 298.0, + 373.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 232.0, + 740.0, + 232.0, + 740.0, + 323.0, + 684.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 269.0, + 1082.0, + 269.0, + 1082.0, + 293.0, + 1054.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 328.0, + 403.0, + 328.0, + 403.0, + 350.0, + 386.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 330.0, + 740.0, + 330.0, + 740.0, + 350.0, + 723.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 325.0, + 1083.0, + 325.0, + 1083.0, + 345.0, + 1064.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 354.0, + 425.0, + 354.0, + 425.0, + 374.0, + 406.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 351.0, + 499.0, + 351.0, + 499.0, + 377.0, + 456.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 351.0, + 559.0, + 351.0, + 559.0, + 377.0, + 516.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 351.0, + 621.0, + 351.0, + 621.0, + 377.0, + 580.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 351.0, + 683.0, + 351.0, + 683.0, + 377.0, + 634.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 354.0, + 762.0, + 354.0, + 762.0, + 374.0, + 743.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 351.0, + 835.0, + 351.0, + 835.0, + 378.0, + 793.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 351.0, + 896.0, + 351.0, + 896.0, + 377.0, + 853.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 351.0, + 959.0, + 351.0, + 959.0, + 377.0, + 917.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 970.0, + 351.0, + 1020.0, + 351.0, + 1020.0, + 377.0, + 970.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1086.0, + 350.0, + 1101.0, + 350.0, + 1101.0, + 367.0, + 1086.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 345.0, + 1172.0, + 345.0, + 1172.0, + 372.0, + 1131.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 345.0, + 1230.0, + 345.0, + 1230.0, + 371.0, + 1190.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1249.0, + 345.0, + 1289.0, + 345.0, + 1289.0, + 371.0, + 1249.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1301.0, + 347.0, + 1349.0, + 347.0, + 1349.0, + 371.0, + 1301.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 492.0, + 371.0, + 584.0, + 371.0, + 584.0, + 395.0, + 492.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 371.0, + 921.0, + 371.0, + 921.0, + 395.0, + 829.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 362.0, + 1255.0, + 362.0, + 1255.0, + 389.0, + 1166.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 291.5, + 816.0, + 291.5, + 816.0, + 304.0, + 793.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 287.0, + 489.0, + 287.0, + 489.0, + 317.5, + 402.0, + 317.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 398.0, + 1406.0, + 398.0, + 1406.0, + 433.0, + 292.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 425.0, + 1404.0, + 425.0, + 1404.0, + 461.0, + 292.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 455.0, + 1406.0, + 455.0, + 1406.0, + 487.0, + 292.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 485.0, + 1405.0, + 485.0, + 1405.0, + 512.0, + 293.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 512.0, + 1404.0, + 512.0, + 1404.0, + 542.0, + 295.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 542.0, + 651.0, + 542.0, + 651.0, + 568.0, + 296.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1086.0, + 936.0, + 1086.0, + 936.0, + 1125.0, + 293.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1168.0, + 1046.0, + 1168.0, + 1046.0, + 1423.0, + 1014.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 1190.0, + 1185.0, + 1190.0, + 1185.0, + 1215.0, + 1107.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1202.0, + 1069.0, + 1202.0, + 1069.0, + 1229.0, + 1038.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 1209.0, + 1184.0, + 1209.0, + 1184.0, + 1231.0, + 1108.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1214.0, + 1073.0, + 1214.0, + 1073.0, + 1281.0, + 1035.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 1223.0, + 1211.0, + 1223.0, + 1211.0, + 1251.0, + 1106.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 1241.0, + 1211.0, + 1241.0, + 1211.0, + 1268.0, + 1106.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 1258.0, + 1212.0, + 1258.0, + 1212.0, + 1284.0, + 1106.0, + 1284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 1270.0, + 1073.0, + 1270.0, + 1073.0, + 1319.0, + 1036.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 1275.0, + 1212.0, + 1275.0, + 1212.0, + 1303.0, + 1106.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1308.0, + 1069.0, + 1308.0, + 1069.0, + 1337.0, + 1038.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1346.0, + 1070.0, + 1346.0, + 1070.0, + 1372.0, + 1039.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1387.0, + 1068.0, + 1387.0, + 1068.0, + 1404.0, + 1052.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 1410.0, + 1105.0, + 1410.0, + 1105.0, + 1427.0, + 1089.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1411.0, + 1156.0, + 1411.0, + 1156.0, + 1428.0, + 1140.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 1408.0, + 1210.0, + 1408.0, + 1210.0, + 1429.0, + 1190.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 1408.0, + 1263.0, + 1408.0, + 1263.0, + 1429.0, + 1242.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 1409.0, + 1315.0, + 1409.0, + 1315.0, + 1428.0, + 1294.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 1408.0, + 1366.0, + 1408.0, + 1366.0, + 1429.0, + 1347.0, + 1429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 1425.0, + 1352.0, + 1425.0, + 1352.0, + 1449.0, + 1105.0, + 1449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 1477.0, + 1393.0, + 1477.0, + 1393.0, + 1504.0, + 1029.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 1508.0, + 1140.0, + 1508.0, + 1140.0, + 1535.0, + 1093.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 1507.0, + 1327.0, + 1507.0, + 1327.0, + 1535.0, + 1281.0, + 1535.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, + 860.0, + 2086.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 1560.0, + 1405.0, + 1560.0, + 1405.0, + 1590.0, + 1011.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1587.0, + 1405.0, + 1587.0, + 1405.0, + 1619.0, + 1009.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1617.0, + 1406.0, + 1617.0, + 1406.0, + 1645.0, + 1009.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1644.0, + 1405.0, + 1644.0, + 1405.0, + 1673.0, + 1009.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1670.0, + 1405.0, + 1670.0, + 1405.0, + 1702.0, + 1009.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1699.0, + 1404.0, + 1699.0, + 1404.0, + 1730.0, + 1009.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1727.0, + 1404.0, + 1727.0, + 1404.0, + 1754.0, + 1009.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1755.0, + 1404.0, + 1755.0, + 1404.0, + 1785.0, + 1009.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1780.0, + 1404.0, + 1780.0, + 1404.0, + 1815.0, + 1009.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 1810.0, + 1115.0, + 1810.0, + 1115.0, + 1840.0, + 1011.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1148.0, + 1002.0, + 1148.0, + 1002.0, + 1180.0, + 295.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1178.0, + 1001.0, + 1178.0, + 1001.0, + 1212.0, + 295.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1206.0, + 1002.0, + 1206.0, + 1002.0, + 1243.0, + 294.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1239.0, + 643.0, + 1239.0, + 643.0, + 1274.0, + 295.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 1239.0, + 1001.0, + 1239.0, + 1001.0, + 1274.0, + 677.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1269.0, + 910.0, + 1269.0, + 910.0, + 1306.0, + 294.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 1269.0, + 1003.0, + 1269.0, + 1003.0, + 1306.0, + 934.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1298.0, + 1003.0, + 1298.0, + 1003.0, + 1335.0, + 295.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1329.0, + 1003.0, + 1329.0, + 1003.0, + 1366.0, + 293.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1360.0, + 1003.0, + 1360.0, + 1003.0, + 1395.0, + 292.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1391.0, + 1003.0, + 1391.0, + 1003.0, + 1426.0, + 293.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1422.0, + 1003.0, + 1422.0, + 1003.0, + 1457.0, + 295.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1453.0, + 1002.0, + 1453.0, + 1002.0, + 1486.0, + 295.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1484.0, + 1002.0, + 1484.0, + 1002.0, + 1515.0, + 295.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1514.0, + 1002.0, + 1514.0, + 1002.0, + 1550.0, + 295.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1542.0, + 1003.0, + 1542.0, + 1003.0, + 1579.0, + 294.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1574.0, + 886.0, + 1574.0, + 886.0, + 1609.0, + 296.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 803.0, + 1405.0, + 803.0, + 1405.0, + 839.0, + 292.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 835.0, + 1405.0, + 835.0, + 1405.0, + 867.0, + 295.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 864.0, + 1406.0, + 864.0, + 1406.0, + 901.0, + 294.0, + 901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 895.0, + 1409.0, + 895.0, + 1409.0, + 931.0, + 291.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 928.0, + 1405.0, + 928.0, + 1405.0, + 958.0, + 296.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 953.0, + 1011.0, + 953.0, + 1011.0, + 994.0, + 291.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 953.0, + 1405.0, + 953.0, + 1405.0, + 994.0, + 1053.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 986.0, + 1405.0, + 986.0, + 1405.0, + 1023.0, + 294.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1019.0, + 642.0, + 1019.0, + 642.0, + 1049.0, + 296.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1619.0, + 803.0, + 1619.0, + 803.0, + 1654.0, + 295.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 1619.0, + 1001.0, + 1619.0, + 1001.0, + 1654.0, + 839.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1652.0, + 1003.0, + 1652.0, + 1003.0, + 1684.0, + 296.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1683.0, + 1002.0, + 1683.0, + 1002.0, + 1714.0, + 294.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1711.0, + 481.0, + 1711.0, + 481.0, + 1749.0, + 292.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 1711.0, + 537.0, + 1711.0, + 537.0, + 1749.0, + 517.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 1711.0, + 1004.0, + 1711.0, + 1004.0, + 1749.0, + 574.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1743.0, + 937.0, + 1743.0, + 937.0, + 1776.0, + 294.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 1743.0, + 1003.0, + 1743.0, + 1003.0, + 1776.0, + 963.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1773.0, + 1004.0, + 1773.0, + 1004.0, + 1807.0, + 294.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1799.0, + 1005.0, + 1799.0, + 1005.0, + 1842.0, + 291.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1835.0, + 472.0, + 1835.0, + 472.0, + 1869.0, + 295.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 496.0, + 1835.0, + 1004.0, + 1835.0, + 1004.0, + 1869.0, + 496.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1866.0, + 596.0, + 1866.0, + 596.0, + 1897.0, + 295.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 586.0, + 478.0, + 586.0, + 478.0, + 625.0, + 293.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 586.0, + 1405.0, + 586.0, + 1405.0, + 625.0, + 509.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 617.0, + 368.0, + 617.0, + 368.0, + 655.0, + 292.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 617.0, + 1405.0, + 617.0, + 1405.0, + 655.0, + 429.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 650.0, + 1405.0, + 650.0, + 1405.0, + 686.0, + 293.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 681.0, + 1356.0, + 681.0, + 1356.0, + 713.0, + 294.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 1405.0, + 1910.0, + 1405.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1942.0, + 1403.0, + 1942.0, + 1403.0, + 1975.0, + 296.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1974.0, + 1403.0, + 1974.0, + 1403.0, + 2006.0, + 296.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 1405.0, + 2003.0, + 1405.0, + 2035.0, + 294.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 724.0, + 1404.0, + 724.0, + 1404.0, + 763.0, + 294.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 760.0, + 810.0, + 760.0, + 810.0, + 792.0, + 296.0, + 792.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, + 565, + 298, + 565 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 681, + 1403, + 681, + 1403, + 835, + 299, + 835 + ], + "score": 0.969 + }, + { + "category_id": 0, + "poly": [ + 299, + 610, + 530, + 610, + 530, + 647, + 299, + 647 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 300, + 881, + 487, + 881, + 487, + 914, + 300, + 914 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.771 + }, + { + "category_id": 1, + "poly": [ + 293, + 964, + 1407, + 964, + 1407, + 2033, + 293, + 2033 + ], + "score": 0.703 + }, + { + "category_id": 1, + "poly": [ + 296, + 932, + 1401, + 932, + 1401, + 995, + 296, + 995 + ], + "score": 0.633 + }, + { + "category_id": 15, + "poly": [ + 291.0, + 609.0, + 534.0, + 609.0, + 534.0, + 654.0, + 291.0, + 654.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": [ + 297.0, + 883.0, + 489.0, + 883.0, + 489.0, + 916.0, + 297.0, + 916.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, + 231.0, + 1405.0, + 231.0, + 1405.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 264.0, + 1405.0, + 264.0, + 1405.0, + 295.0, + 296.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 286.0, + 1405.0, + 286.0, + 1405.0, + 330.0, + 292.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 320.0, + 1405.0, + 320.0, + 1405.0, + 358.0, + 293.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 351.0, + 1406.0, + 351.0, + 1406.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, + 414.0, + 1404.0, + 414.0, + 1404.0, + 448.0, + 294.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 443.0, + 1406.0, + 443.0, + 1406.0, + 479.0, + 293.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 475.0, + 1405.0, + 475.0, + 1405.0, + 510.0, + 294.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 504.0, + 1406.0, + 504.0, + 1406.0, + 541.0, + 293.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 536.0, + 547.0, + 536.0, + 547.0, + 571.0, + 293.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 683.0, + 1404.0, + 683.0, + 1404.0, + 716.0, + 295.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 709.0, + 1405.0, + 709.0, + 1405.0, + 747.0, + 293.0, + 747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 743.0, + 1404.0, + 743.0, + 1404.0, + 777.0, + 295.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 767.0, + 1405.0, + 767.0, + 1405.0, + 814.0, + 293.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 803.0, + 1177.0, + 803.0, + 1177.0, + 840.0, + 294.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 963.0, + 650.0, + 963.0, + 650.0, + 995.0, + 324.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1013.0, + 1405.0, + 1013.0, + 1405.0, + 1055.0, + 291.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1045.0, + 1405.0, + 1045.0, + 1405.0, + 1082.0, + 323.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1078.0, + 1405.0, + 1078.0, + 1405.0, + 1113.0, + 321.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1108.0, + 361.0, + 1108.0, + 361.0, + 1139.0, + 325.0, + 1139.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1157.0, + 1405.0, + 1157.0, + 1405.0, + 1200.0, + 292.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1191.0, + 1241.0, + 1191.0, + 1241.0, + 1225.0, + 323.0, + 1225.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1243.0, + 1404.0, + 1243.0, + 1404.0, + 1281.0, + 294.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1274.0, + 784.0, + 1274.0, + 784.0, + 1310.0, + 323.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1325.0, + 1405.0, + 1325.0, + 1405.0, + 1362.0, + 295.0, + 1362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1357.0, + 1048.0, + 1357.0, + 1048.0, + 1391.0, + 321.0, + 1391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1410.0, + 1403.0, + 1410.0, + 1403.0, + 1446.0, + 295.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1442.0, + 1405.0, + 1442.0, + 1405.0, + 1477.0, + 324.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1472.0, + 1080.0, + 1472.0, + 1080.0, + 1507.0, + 324.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1525.0, + 1404.0, + 1525.0, + 1404.0, + 1560.0, + 294.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1556.0, + 667.0, + 1556.0, + 667.0, + 1588.0, + 323.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1607.0, + 1405.0, + 1607.0, + 1405.0, + 1645.0, + 292.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1640.0, + 631.0, + 1640.0, + 631.0, + 1672.0, + 320.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1691.0, + 1404.0, + 1691.0, + 1404.0, + 1727.0, + 295.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1723.0, + 930.0, + 1723.0, + 930.0, + 1758.0, + 324.0, + 1758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1772.0, + 1403.0, + 1772.0, + 1403.0, + 1813.0, + 295.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1806.0, + 801.0, + 1806.0, + 801.0, + 1840.0, + 321.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1858.0, + 1405.0, + 1858.0, + 1405.0, + 1893.0, + 296.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1890.0, + 1405.0, + 1890.0, + 1405.0, + 1924.0, + 320.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1920.0, + 347.0, + 1920.0, + 347.0, + 1951.0, + 323.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1968.0, + 1405.0, + 1968.0, + 1405.0, + 2011.0, + 291.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 2004.0, + 792.0, + 2004.0, + 792.0, + 2036.0, + 321.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 923.0, + 1406.0, + 923.0, + 1406.0, + 974.0, + 291.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 961.0, + 654.0, + 961.0, + 654.0, + 997.0, + 323.0, + 997.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 74, + 816, + 74, + 816, + 106, + 299, + 106 + ], + "score": 0.883 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 866, + 2088, + 866, + 2113, + 836, + 2113 + ], + "score": 0.82 + }, + { + "category_id": 1, + "poly": [ + 297, + 821, + 1402, + 821, + 1402, + 888, + 297, + 888 + ], + "score": 0.78 + }, + { + "category_id": 1, + "poly": [ + 295, + 711, + 1197, + 711, + 1197, + 747, + 295, + 747 + ], + "score": 0.768 + }, + { + "category_id": 1, + "poly": [ + 296, + 766, + 1192, + 766, + 1192, + 802, + 296, + 802 + ], + "score": 0.758 + }, + { + "category_id": 1, + "poly": [ + 295, + 1396, + 1398, + 1396, + 1398, + 1462, + 295, + 1462 + ], + "score": 0.72 + }, + { + "category_id": 1, + "poly": [ + 291, + 1684, + 1402, + 1684, + 1402, + 1749, + 291, + 1749 + ], + "score": 0.704 + }, + { + "category_id": 1, + "poly": [ + 293, + 1596, + 1403, + 1596, + 1403, + 1662, + 293, + 1662 + ], + "score": 0.703 + }, + { + "category_id": 1, + "poly": [ + 298, + 625, + 1399, + 625, + 1399, + 691, + 298, + 691 + ], + "score": 0.701 + }, + { + "category_id": 1, + "poly": [ + 293, + 1023, + 1401, + 1023, + 1401, + 1088, + 293, + 1088 + ], + "score": 0.69 + }, + { + "category_id": 1, + "poly": [ + 298, + 907, + 1402, + 907, + 1402, + 1002, + 298, + 1002 + ], + "score": 0.671 + }, + { + "category_id": 1, + "poly": [ + 296, + 1310, + 1400, + 1310, + 1400, + 1376, + 296, + 1376 + ], + "score": 0.668 + }, + { + "category_id": 1, + "poly": [ + 292, + 1224, + 1400, + 1224, + 1400, + 1290, + 292, + 1290 + ], + "score": 0.665 + }, + { + "category_id": 1, + "poly": [ + 300, + 1108, + 1400, + 1108, + 1400, + 1204, + 300, + 1204 + ], + "score": 0.648 + }, + { + "category_id": 1, + "poly": [ + 298, + 541, + 1398, + 541, + 1398, + 605, + 298, + 605 + ], + "score": 0.642 + }, + { + "category_id": 1, + "poly": [ + 301, + 454, + 1401, + 454, + 1401, + 519, + 301, + 519 + ], + "score": 0.616 + }, + { + "category_id": 1, + "poly": [ + 301, + 1971, + 1399, + 1971, + 1399, + 2035, + 301, + 2035 + ], + "score": 0.58 + }, + { + "category_id": 1, + "poly": [ + 298, + 369, + 1402, + 369, + 1402, + 434, + 298, + 434 + ], + "score": 0.575 + }, + { + "category_id": 1, + "poly": [ + 298, + 1768, + 1401, + 1768, + 1401, + 1863, + 298, + 1863 + ], + "score": 0.572 + }, + { + "category_id": 1, + "poly": [ + 291, + 227, + 1362, + 227, + 1362, + 265, + 291, + 265 + ], + "score": 0.57 + }, + { + "category_id": 1, + "poly": [ + 295, + 1884, + 1402, + 1884, + 1402, + 1950, + 295, + 1950 + ], + "score": 0.565 + }, + { + "category_id": 1, + "poly": [ + 295, + 283, + 1401, + 283, + 1401, + 350, + 295, + 350 + ], + "score": 0.541 + }, + { + "category_id": 1, + "poly": [ + 295, + 1480, + 1407, + 1480, + 1407, + 1576, + 295, + 1576 + ], + "score": 0.456 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 817.0, + 72.0, + 817.0, + 109.0, + 295.0, + 109.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": [ + 296.0, + 823.0, + 1403.0, + 823.0, + 1403.0, + 856.0, + 296.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 853.0, + 1280.0, + 853.0, + 1280.0, + 888.0, + 322.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 711.0, + 1199.0, + 711.0, + 1199.0, + 750.0, + 295.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 766.0, + 1194.0, + 766.0, + 1194.0, + 803.0, + 294.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1393.0, + 1404.0, + 1393.0, + 1404.0, + 1436.0, + 294.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1428.0, + 898.0, + 1428.0, + 898.0, + 1461.0, + 321.0, + 1461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1678.0, + 1403.0, + 1678.0, + 1403.0, + 1724.0, + 293.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1715.0, + 723.0, + 1715.0, + 723.0, + 1746.0, + 323.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1595.0, + 1405.0, + 1595.0, + 1405.0, + 1635.0, + 293.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1629.0, + 593.0, + 1629.0, + 593.0, + 1665.0, + 322.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 620.0, + 1404.0, + 620.0, + 1404.0, + 666.0, + 293.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 658.0, + 632.0, + 658.0, + 632.0, + 690.0, + 323.0, + 690.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": [ + 322.0, + 1056.0, + 921.0, + 1056.0, + 921.0, + 1088.0, + 322.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 906.0, + 1404.0, + 906.0, + 1404.0, + 944.0, + 293.0, + 944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 940.0, + 1404.0, + 940.0, + 1404.0, + 974.0, + 325.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 969.0, + 947.0, + 969.0, + 947.0, + 1003.0, + 323.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1309.0, + 1404.0, + 1309.0, + 1404.0, + 1348.0, + 294.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1343.0, + 631.0, + 1343.0, + 631.0, + 1375.0, + 322.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1225.0, + 1403.0, + 1225.0, + 1403.0, + 1261.0, + 295.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1257.0, + 617.0, + 1257.0, + 617.0, + 1289.0, + 324.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1109.0, + 1404.0, + 1109.0, + 1404.0, + 1144.0, + 295.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1140.0, + 1404.0, + 1140.0, + 1404.0, + 1176.0, + 323.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1171.0, + 717.0, + 1171.0, + 717.0, + 1205.0, + 324.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 536.0, + 1404.0, + 536.0, + 1404.0, + 581.0, + 293.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 573.0, + 910.0, + 573.0, + 910.0, + 604.0, + 324.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 452.0, + 1405.0, + 452.0, + 1405.0, + 493.0, + 292.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 488.0, + 652.0, + 488.0, + 652.0, + 517.0, + 321.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1971.0, + 1403.0, + 1971.0, + 1403.0, + 2007.0, + 297.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 2002.0, + 1148.0, + 2002.0, + 1148.0, + 2036.0, + 322.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 367.0, + 1406.0, + 367.0, + 1406.0, + 408.0, + 292.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 400.0, + 675.0, + 400.0, + 675.0, + 434.0, + 322.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1770.0, + 1403.0, + 1770.0, + 1403.0, + 1805.0, + 296.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1802.0, + 1405.0, + 1802.0, + 1405.0, + 1836.0, + 322.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1833.0, + 554.0, + 1833.0, + 554.0, + 1862.0, + 323.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 229.0, + 1364.0, + 229.0, + 1364.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1879.0, + 1404.0, + 1879.0, + 1404.0, + 1925.0, + 292.0, + 1925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1917.0, + 1112.0, + 1917.0, + 1112.0, + 1951.0, + 323.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 284.0, + 1402.0, + 284.0, + 1402.0, + 317.0, + 298.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 317.0, + 1088.0, + 317.0, + 1088.0, + 349.0, + 322.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1483.0, + 1403.0, + 1483.0, + 1403.0, + 1517.0, + 297.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1513.0, + 1403.0, + 1513.0, + 1403.0, + 1544.0, + 325.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1544.0, + 495.0, + 1544.0, + 495.0, + 1576.0, + 323.0, + 1576.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 105, + 300, + 105 + ], + "score": 0.875 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2112, + 836, + 2112 + ], + "score": 0.827 + }, + { + "category_id": 1, + "poly": [ + 298, + 924, + 1399, + 924, + 1399, + 1016, + 298, + 1016 + ], + "score": 0.697 + }, + { + "category_id": 1, + "poly": [ + 299, + 1037, + 1404, + 1037, + 1404, + 1131, + 299, + 1131 + ], + "score": 0.662 + }, + { + "category_id": 1, + "poly": [ + 291, + 840, + 1400, + 840, + 1400, + 904, + 291, + 904 + ], + "score": 0.636 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1402, + 229, + 1402, + 294, + 294, + 294 + ], + "score": 0.565 + }, + { + "category_id": 1, + "poly": [ + 293, + 758, + 1400, + 758, + 1400, + 821, + 293, + 821 + ], + "score": 0.517 + }, + { + "category_id": 1, + "poly": [ + 304, + 312, + 1398, + 312, + 1398, + 406, + 304, + 406 + ], + "score": 0.505 + }, + { + "category_id": 1, + "poly": [ + 302, + 643, + 1401, + 643, + 1401, + 739, + 302, + 739 + ], + "score": 0.495 + }, + { + "category_id": 1, + "poly": [ + 296, + 560, + 1401, + 560, + 1401, + 626, + 296, + 626 + ], + "score": 0.459 + }, + { + "category_id": 1, + "poly": [ + 297, + 478, + 1400, + 478, + 1400, + 542, + 297, + 542 + ], + "score": 0.45 + }, + { + "category_id": 1, + "poly": [ + 298, + 426, + 1389, + 426, + 1389, + 460, + 298, + 460 + ], + "score": 0.416 + }, + { + "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, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 923.0, + 1403.0, + 923.0, + 1403.0, + 960.0, + 294.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 953.0, + 1403.0, + 953.0, + 1403.0, + 990.0, + 321.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 988.0, + 347.0, + 988.0, + 347.0, + 1017.0, + 322.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1035.0, + 1405.0, + 1035.0, + 1405.0, + 1073.0, + 295.0, + 1073.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1065.0, + 1404.0, + 1065.0, + 1404.0, + 1107.0, + 319.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1100.0, + 553.0, + 1100.0, + 553.0, + 1131.0, + 323.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 839.0, + 1403.0, + 839.0, + 1403.0, + 877.0, + 295.0, + 877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 872.0, + 965.0, + 872.0, + 965.0, + 904.0, + 321.0, + 904.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": [ + 321.0, + 260.0, + 1228.0, + 260.0, + 1228.0, + 295.0, + 321.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 756.0, + 1402.0, + 756.0, + 1402.0, + 795.0, + 293.0, + 795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 790.0, + 931.0, + 790.0, + 931.0, + 823.0, + 321.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 313.0, + 1402.0, + 313.0, + 1402.0, + 347.0, + 298.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 344.0, + 1403.0, + 344.0, + 1403.0, + 378.0, + 322.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 375.0, + 1033.0, + 375.0, + 1033.0, + 407.0, + 322.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 642.0, + 1405.0, + 642.0, + 1405.0, + 682.0, + 293.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 674.0, + 1406.0, + 674.0, + 1406.0, + 713.0, + 319.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 707.0, + 989.0, + 707.0, + 989.0, + 740.0, + 323.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 559.0, + 1406.0, + 559.0, + 1406.0, + 597.0, + 295.0, + 597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 590.0, + 1224.0, + 590.0, + 1224.0, + 627.0, + 321.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 478.0, + 1404.0, + 478.0, + 1404.0, + 514.0, + 295.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 509.0, + 741.0, + 509.0, + 741.0, + 543.0, + 322.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 423.0, + 1389.0, + 423.0, + 1389.0, + 464.0, + 294.0, + 464.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 298, + 1404, + 298, + 1404, + 422, + 297, + 422 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 647, + 1404, + 647, + 1404, + 770, + 299, + 770 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 387, + 776, + 1318, + 776, + 1318, + 1471, + 387, + 1471 + ], + "score": 0.976 + }, + { + "category_id": 3, + "poly": [ + 317, + 1543, + 1382, + 1543, + 1382, + 1987, + 317, + 1987 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 672, + 445, + 1025, + 445, + 1025, + 536, + 672, + 536 + ], + "score": 0.958 + }, + { + "category_id": 4, + "poly": [ + 296, + 1482, + 1406, + 1482, + 1406, + 1540, + 296, + 1540 + ], + "score": 0.94 + }, + { + "category_id": 4, + "poly": [ + 491, + 1997, + 1207, + 1997, + 1207, + 2027, + 491, + 2027 + ], + "score": 0.935 + }, + { + "category_id": 0, + "poly": [ + 300, + 574, + 1114, + 574, + 1114, + 613, + 300, + 613 + ], + "score": 0.928 + }, + { + "category_id": 0, + "poly": [ + 301, + 225, + 705, + 225, + 705, + 263, + 301, + 263 + ], + "score": 0.917 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 817, + 74, + 817, + 106, + 298, + 106 + ], + "score": 0.908 + }, + { + "category_id": 9, + "poly": [ + 1365, + 474, + 1400, + 474, + 1400, + 505, + 1365, + 505 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.873 + }, + { + "category_id": 14, + "poly": [ + 672, + 441, + 1027, + 441, + 1027, + 537, + 672, + 537 + ], + "score": 0.95, + "latex": "S P L = \\frac { 1 } { N } \\sum _ { i = 1 } ^ { N } S _ { i } \\frac { \\ell _ { i } } { \\operatorname* { m a x } ( p _ { i } , \\ell _ { i } ) } ." + }, + { + "category_id": 13, + "poly": [ + 344, + 681, + 419, + 681, + 419, + 709, + 344, + 709 + ], + "score": 0.91, + "latex": "t + 1 0" + }, + { + "category_id": 13, + "poly": [ + 632, + 331, + 656, + 331, + 656, + 360, + 632, + 360 + ], + "score": 0.88, + "latex": "\\ell _ { i }" + }, + { + "category_id": 13, + "poly": [ + 997, + 361, + 1026, + 361, + 1026, + 391, + 997, + 391 + ], + "score": 0.88, + "latex": "S _ { i }" + }, + { + "category_id": 13, + "poly": [ + 297, + 365, + 323, + 365, + 323, + 392, + 297, + 392 + ], + "score": 0.83, + "latex": "p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 809, + 393, + 837, + 393, + 837, + 418, + 809, + 418 + ], + "score": 0.83, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 878, + 1484, + 949, + 1484, + 949, + 1511, + 878, + 1511 + ], + "score": 0.82, + "latex": "t + 1 0" + }, + { + "category_id": 13, + "poly": [ + 1386, + 652, + 1402, + 652, + 1402, + 677, + 1386, + 677 + ], + "score": 0.65, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 819, + 1487, + 832, + 1487, + 832, + 1509, + 819, + 1509 + ], + "score": 0.54, + "latex": "t" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 869.0, + 553.0, + 869.0, + 553.0, + 913.0, + 520.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 857.0, + 893.0, + 857.0, + 893.0, + 913.0, + 855.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 1006.0, + 691.0, + 1006.0, + 691.0, + 1085.0, + 455.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 1091.0, + 871.0, + 1091.0, + 871.0, + 1126.0, + 830.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 1095.0, + 1173.0, + 1095.0, + 1173.0, + 1122.0, + 1142.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1118.0, + 556.0, + 1118.0, + 556.0, + 1266.0, + 465.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.0, + 1130.0, + 1116.0, + 1130.0, + 1116.0, + 1143.0, + 1102.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 1151.0, + 603.0, + 1151.0, + 603.0, + 1223.0, + 530.0, + 1223.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 1228.0, + 539.0, + 1228.0, + 539.0, + 1278.0, + 488.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 1223.0, + 874.0, + 1223.0, + 874.0, + 1255.0, + 846.0, + 1255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 669.0, + 1276.0, + 683.0, + 1276.0, + 683.0, + 1304.0, + 669.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 1443.0, + 563.0, + 1443.0, + 563.0, + 1477.0, + 521.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 1445.0, + 869.0, + 1445.0, + 869.0, + 1476.0, + 832.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 1444.0, + 1175.0, + 1444.0, + 1175.0, + 1476.0, + 1141.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.75, + 1088.0, + 569.75, + 1088.0, + 569.75, + 1124.5, + 516.75, + 1124.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 1549.0, + 1399.0, + 1549.0, + 1399.0, + 1718.0, + 560.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 1730.0, + 1410.0, + 1730.0, + 1410.0, + 1971.0, + 371.0, + 1971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 1957.0, + 430.0, + 1957.0, + 430.0, + 1991.0, + 391.0, + 1991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 1954.0, + 610.0, + 1954.0, + 610.0, + 1991.0, + 563.0, + 1991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 1956.0, + 780.0, + 1956.0, + 780.0, + 1990.0, + 744.0, + 1990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1956.0, + 958.0, + 1956.0, + 958.0, + 1991.0, + 919.0, + 1991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 1956.0, + 1138.0, + 1956.0, + 1138.0, + 1991.0, + 1090.0, + 1991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1957.0, + 1307.0, + 1957.0, + 1307.0, + 1987.0, + 1273.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1478.0, + 818.0, + 1478.0, + 818.0, + 1518.0, + 291.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 1478.0, + 877.0, + 1478.0, + 877.0, + 1518.0, + 833.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 950.0, + 1478.0, + 1406.0, + 1478.0, + 1406.0, + 1518.0, + 950.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1509.0, + 837.0, + 1509.0, + 837.0, + 1544.0, + 293.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 1993.0, + 1208.0, + 1993.0, + 1208.0, + 2032.0, + 491.0, + 2032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 573.0, + 1116.0, + 573.0, + 1116.0, + 617.0, + 296.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 224.0, + 708.0, + 224.0, + 708.0, + 268.0, + 296.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.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, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 299.0, + 1402.0, + 299.0, + 1402.0, + 332.0, + 296.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 328.0, + 631.0, + 328.0, + 631.0, + 364.0, + 292.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 328.0, + 1405.0, + 328.0, + 1405.0, + 364.0, + 657.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 360.0, + 296.0, + 360.0, + 296.0, + 395.0, + 291.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 360.0, + 996.0, + 360.0, + 996.0, + 395.0, + 324.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 360.0, + 1406.0, + 360.0, + 1406.0, + 395.0, + 1027.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 388.0, + 808.0, + 388.0, + 808.0, + 425.0, + 292.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 388.0, + 1032.0, + 388.0, + 1032.0, + 425.0, + 838.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 647.0, + 1385.0, + 647.0, + 1385.0, + 684.0, + 295.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 647.0, + 1408.0, + 647.0, + 1408.0, + 684.0, + 1403.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 679.0, + 343.0, + 679.0, + 343.0, + 712.0, + 295.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 679.0, + 1405.0, + 679.0, + 1405.0, + 712.0, + 420.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 711.0, + 1404.0, + 711.0, + 1404.0, + 743.0, + 294.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 740.0, + 834.0, + 740.0, + 834.0, + 775.0, + 294.0, + 775.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1818, + 1404, + 1818, + 1404, + 2034, + 297, + 2034 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 296, + 1598, + 1404, + 1598, + 1404, + 1728, + 296, + 1728 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 352, + 1405, + 352, + 1405, + 474, + 298, + 474 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 300, + 1273, + 1402, + 1273, + 1402, + 1430, + 300, + 1430 + ], + "score": 0.974 + }, + { + "category_id": 3, + "poly": [ + 633, + 482, + 1061, + 482, + 1061, + 798, + 633, + 798 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 316, + 879, + 1382, + 879, + 1382, + 1080, + 316, + 1080 + ], + "score": 0.961 + }, + { + "category_id": 4, + "poly": [ + 294, + 1088, + 1400, + 1088, + 1400, + 1175, + 294, + 1175 + ], + "score": 0.955 + }, + { + "category_id": 8, + "poly": [ + 553, + 1489, + 754, + 1489, + 754, + 1583, + 553, + 1583 + ], + "score": 0.94 + }, + { + "category_id": 0, + "poly": [ + 299, + 1218, + 658, + 1218, + 658, + 1250, + 299, + 1250 + ], + "score": 0.924 + }, + { + "category_id": 0, + "poly": [ + 300, + 225, + 875, + 225, + 875, + 263, + 300, + 263 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 299, + 295, + 663, + 295, + 663, + 327, + 299, + 327 + ], + "score": 0.919 + }, + { + "category_id": 8, + "poly": [ + 512, + 1443, + 1185, + 1443, + 1185, + 1482, + 512, + 1482 + ], + "score": 0.918 + }, + { + "category_id": 0, + "poly": [ + 299, + 1762, + 604, + 1762, + 604, + 1794, + 299, + 1794 + ], + "score": 0.914 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 817, + 74, + 817, + 105, + 298, + 105 + ], + "score": 0.9 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1519, + 1400, + 1519, + 1400, + 1548, + 1366, + 1548 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1448, + 1400, + 1448, + 1400, + 1477, + 1366, + 1477 + ], + "score": 0.87 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.857 + }, + { + "category_id": 4, + "poly": [ + 289, + 815, + 1400, + 815, + 1400, + 873, + 289, + 873 + ], + "score": 0.536 + }, + { + "category_id": 4, + "poly": [ + 292, + 815, + 1401, + 815, + 1401, + 873, + 292, + 873 + ], + "score": 0.131 + }, + { + "category_id": 13, + "poly": [ + 936, + 1598, + 1043, + 1598, + 1043, + 1634, + 936, + 1634 + ], + "score": 0.94, + "latex": "\\pmb { x } _ { i j } \\in \\mathbb { R } ^ { 3 }" + }, + { + "category_id": 13, + "poly": [ + 809, + 1276, + 1169, + 1276, + 1169, + 1310, + 809, + 1310 + ], + "score": 0.93, + "latex": "( [ R _ { 1 } , t _ { 1 } ] , [ R _ { 2 } , t _ { 2 } ] , . . . , [ R _ { N } , t _ { N } ] )" + }, + { + "category_id": 14, + "poly": [ + 512, + 1440, + 1188, + 1440, + 1188, + 1587, + 512, + 1587 + ], + "score": 0.93, + "latex": "\\begin{array} { c } { { \\lambda _ { i j } { \\pmb x } _ { i j } = K \\left[ { \\pmb R } _ { i } , { \\pmb t } _ { i } \\right] { \\pmb w } _ { i j } \\quad \\forall j \\in \\{ 1 , 2 , . . . , S \\} , i \\in \\{ 1 , . . . , N \\} } } \\\\ { { N \\mathrm { ~ } _ { i } \\mathrm { ~ } _ { j } } } \\\\ { { \\pmb W } = \\displaystyle \\bigcup _ { i = 1 } ^ { N } \\displaystyle \\bigcup _ { j = 1 } ^ { S } { \\pmb w } _ { i j } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1230, + 1305, + 1354, + 1305, + 1354, + 1336, + 1230, + 1336 + ], + "score": 0.92, + "latex": "\\pmb { K } \\in \\mathbb { R } ^ { 3 \\times 3 }" + }, + { + "category_id": 13, + "poly": [ + 346, + 1663, + 458, + 1663, + 458, + 1698, + 346, + 1698 + ], + "score": 0.92, + "latex": "\\ b w _ { i j } \\in \\mathbb { R } ^ { 4 }" + }, + { + "category_id": 13, + "poly": [ + 491, + 1308, + 695, + 1308, + 695, + 1339, + 491, + 1339 + ], + "score": 0.92, + "latex": "( D _ { 1 } , D _ { 2 } , . . . , D _ { N } )" + }, + { + "category_id": 13, + "poly": [ + 325, + 1912, + 417, + 1912, + 417, + 1941, + 325, + 1941 + ], + "score": 0.91, + "latex": "8 0 \\times 8 0" + }, + { + "category_id": 13, + "poly": [ + 1221, + 1852, + 1345, + 1852, + 1345, + 1880, + 1221, + 1880 + ], + "score": 0.91, + "latex": "4 0 \\mathrm { m } \\times 4 0 \\mathrm { m }" + }, + { + "category_id": 13, + "poly": [ + 521, + 1944, + 617, + 1944, + 617, + 1972, + 521, + 1972 + ], + "score": 0.9, + "latex": "4 \\mathrm { m } \\times 4 \\mathrm { m }" + }, + { + "category_id": 13, + "poly": [ + 326, + 1973, + 450, + 1973, + 450, + 2002, + 326, + 2002 + ], + "score": 0.9, + "latex": "2 2 4 \\times 2 2 4" + }, + { + "category_id": 13, + "poly": [ + 913, + 1973, + 1008, + 1973, + 1008, + 2002, + 913, + 2002 + ], + "score": 0.89, + "latex": "8 0 \\times 8 0" + }, + { + "category_id": 13, + "poly": [ + 589, + 841, + 687, + 841, + 687, + 870, + 589, + 870 + ], + "score": 0.89, + "latex": "2 8 9 . 7 \\mathrm { m } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1281, + 1882, + 1402, + 1882, + 1402, + 1912, + 1281, + 1912 + ], + "score": 0.88, + "latex": "8 0 0 \\times 8 0 0" + }, + { + "category_id": 13, + "poly": [ + 1358, + 1631, + 1393, + 1631, + 1393, + 1661, + 1358, + 1661 + ], + "score": 0.88, + "latex": "D _ { i }" + }, + { + "category_id": 13, + "poly": [ + 516, + 1698, + 562, + 1698, + 562, + 1728, + 516, + 1728 + ], + "score": 0.88, + "latex": "{ \\pmb w } _ { i j }" + }, + { + "category_id": 13, + "poly": [ + 625, + 1698, + 666, + 1698, + 666, + 1728, + 625, + 1728 + ], + "score": 0.88, + "latex": "\\mathbf { \\boldsymbol { x } } _ { i j }" + }, + { + "category_id": 13, + "poly": [ + 1198, + 841, + 1296, + 841, + 1296, + 870, + 1198, + 870 + ], + "score": 0.88, + "latex": "\\mathrm { 3 2 7 . 9 ~ m ^ { \\mathrm { 2 } } }" + }, + { + "category_id": 13, + "poly": [ + 337, + 1632, + 367, + 1632, + 367, + 1663, + 337, + 1663 + ], + "score": 0.88, + "latex": "j _ { \\mathrm { t h } }" + }, + { + "category_id": 13, + "poly": [ + 1053, + 1633, + 1084, + 1633, + 1084, + 1663, + 1053, + 1663 + ], + "score": 0.87, + "latex": "j _ { \\mathrm { t h } }" + }, + { + "category_id": 13, + "poly": [ + 467, + 1632, + 496, + 1632, + 496, + 1661, + 467, + 1661 + ], + "score": 0.87, + "latex": "i _ { \\mathrm { t h } }" + }, + { + "category_id": 13, + "poly": [ + 1183, + 1632, + 1213, + 1632, + 1213, + 1662, + 1183, + 1662 + ], + "score": 0.86, + "latex": "i _ { \\mathrm { t h } }" + }, + { + "category_id": 13, + "poly": [ + 687, + 1631, + 780, + 1631, + 780, + 1664, + 687, + 1664 + ], + "score": 0.85, + "latex": "\\lambda _ { i j } \\in \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 906, + 1944, + 984, + 1944, + 984, + 1971, + 906, + 1971 + ], + "score": 0.85, + "latex": "0 . 0 5 m" + }, + { + "category_id": 13, + "poly": [ + 371, + 1602, + 392, + 1602, + 392, + 1627, + 371, + 1627 + ], + "score": 0.84, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 720, + 1882, + 783, + 1882, + 783, + 1911, + 720, + 1911 + ], + "score": 0.8, + "latex": "0 . 5 m" + }, + { + "category_id": 13, + "poly": [ + 642, + 1631, + 676, + 1631, + 676, + 1662, + 642, + 1662 + ], + "score": 0.78, + "latex": "D _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1101, + 1821, + 1175, + 1821, + 1175, + 1850, + 1101, + 1850 + ], + "score": 0.73, + "latex": "0 . 0 5 \\mathrm { m }" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 481.0, + 997.0, + 481.0, + 997.0, + 509.0, + 741.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 508.0, + 679.0, + 508.0, + 679.0, + 533.0, + 659.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 516.0, + 1046.0, + 516.0, + 1046.0, + 544.0, + 991.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 533.0, + 665.0, + 533.0, + 665.0, + 723.0, + 635.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 541.0, + 1041.0, + 541.0, + 1041.0, + 570.0, + 991.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 566.0, + 677.0, + 566.0, + 677.0, + 588.0, + 661.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 626.0, + 677.0, + 626.0, + 677.0, + 644.0, + 661.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 686.0, + 674.0, + 686.0, + 674.0, + 699.0, + 662.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 744.0, + 676.0, + 744.0, + 676.0, + 758.0, + 662.0, + 758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 749.0, + 1062.0, + 749.0, + 1062.0, + 776.0, + 677.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 775.0, + 772.0, + 963.0, + 772.0, + 963.0, + 798.0, + 775.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 894.0, + 864.0, + 894.0, + 864.0, + 1067.0, + 719.0, + 1067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 927.0, + 1167.0, + 927.0, + 1167.0, + 967.0, + 1077.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1099.0, + 965.0, + 1161.0, + 965.0, + 1161.0, + 1004.0, + 1099.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1086.0, + 1402.0, + 1086.0, + 1402.0, + 1121.0, + 294.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1115.0, + 1405.0, + 1115.0, + 1405.0, + 1150.0, + 292.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1147.0, + 738.0, + 1147.0, + 738.0, + 1176.0, + 296.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1218.0, + 660.0, + 1218.0, + 660.0, + 1254.0, + 296.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 224.0, + 877.0, + 224.0, + 877.0, + 268.0, + 296.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 295.0, + 665.0, + 295.0, + 665.0, + 331.0, + 296.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1757.0, + 608.0, + 1757.0, + 608.0, + 1800.0, + 295.0, + 1800.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, + 2084.0, + 870.0, + 2084.0, + 870.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 816.0, + 1403.0, + 816.0, + 1403.0, + 846.0, + 296.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 842.0, + 588.0, + 842.0, + 588.0, + 875.0, + 293.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 842.0, + 1197.0, + 842.0, + 1197.0, + 875.0, + 688.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 842.0, + 1309.0, + 842.0, + 1309.0, + 875.0, + 1297.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 816.0, + 1402.0, + 816.0, + 1402.0, + 846.0, + 296.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 842.0, + 588.0, + 842.0, + 588.0, + 875.0, + 292.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 842.0, + 1197.0, + 842.0, + 1197.0, + 875.0, + 688.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 842.0, + 1309.0, + 842.0, + 1309.0, + 875.0, + 1297.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1819.0, + 1100.0, + 1819.0, + 1100.0, + 1857.0, + 294.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 1819.0, + 1409.0, + 1819.0, + 1409.0, + 1857.0, + 1176.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1852.0, + 1220.0, + 1852.0, + 1220.0, + 1885.0, + 292.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 1852.0, + 1406.0, + 1852.0, + 1406.0, + 1885.0, + 1346.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1882.0, + 719.0, + 1882.0, + 719.0, + 1916.0, + 294.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1882.0, + 1280.0, + 1882.0, + 1280.0, + 1916.0, + 784.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1910.0, + 324.0, + 1910.0, + 324.0, + 1947.0, + 292.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1910.0, + 1406.0, + 1910.0, + 1406.0, + 1947.0, + 418.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 520.0, + 1942.0, + 520.0, + 1977.0, + 294.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 1942.0, + 905.0, + 1942.0, + 905.0, + 1977.0, + 618.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1977.0, + 985.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1969.0, + 325.0, + 1969.0, + 325.0, + 2009.0, + 292.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1969.0, + 912.0, + 1969.0, + 912.0, + 2009.0, + 451.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1969.0, + 1404.0, + 1969.0, + 1404.0, + 2009.0, + 1009.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 2003.0, + 401.0, + 2003.0, + 401.0, + 2033.0, + 291.0, + 2033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1597.0, + 370.0, + 1597.0, + 370.0, + 1634.0, + 296.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1597.0, + 935.0, + 1597.0, + 935.0, + 1634.0, + 393.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 1597.0, + 1404.0, + 1597.0, + 1404.0, + 1634.0, + 1044.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1629.0, + 336.0, + 1629.0, + 336.0, + 1667.0, + 294.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1629.0, + 466.0, + 1629.0, + 466.0, + 1667.0, + 368.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1629.0, + 641.0, + 1629.0, + 641.0, + 1667.0, + 497.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 1629.0, + 686.0, + 1629.0, + 686.0, + 1667.0, + 677.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1629.0, + 1052.0, + 1629.0, + 1052.0, + 1667.0, + 781.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 1629.0, + 1182.0, + 1629.0, + 1182.0, + 1667.0, + 1085.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1629.0, + 1357.0, + 1629.0, + 1357.0, + 1667.0, + 1214.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1629.0, + 1405.0, + 1629.0, + 1405.0, + 1667.0, + 1394.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1662.0, + 345.0, + 1662.0, + 345.0, + 1699.0, + 295.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 1662.0, + 1405.0, + 1662.0, + 1405.0, + 1699.0, + 459.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1694.0, + 515.0, + 1694.0, + 515.0, + 1730.0, + 293.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 1694.0, + 624.0, + 1694.0, + 624.0, + 1730.0, + 563.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1694.0, + 1404.0, + 1694.0, + 1404.0, + 1730.0, + 667.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 352.0, + 1405.0, + 352.0, + 1405.0, + 388.0, + 292.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 383.0, + 1405.0, + 383.0, + 1405.0, + 415.0, + 293.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 411.0, + 1405.0, + 411.0, + 1405.0, + 450.0, + 292.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 445.0, + 830.0, + 445.0, + 830.0, + 478.0, + 296.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1274.0, + 808.0, + 1274.0, + 808.0, + 1311.0, + 295.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 1274.0, + 1404.0, + 1274.0, + 1404.0, + 1311.0, + 1170.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1297.0, + 490.0, + 1297.0, + 490.0, + 1346.0, + 290.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 1297.0, + 1229.0, + 1297.0, + 1229.0, + 1346.0, + 696.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 1297.0, + 1411.0, + 1297.0, + 1411.0, + 1346.0, + 1355.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1335.0, + 1404.0, + 1335.0, + 1404.0, + 1372.0, + 294.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1366.0, + 1406.0, + 1366.0, + 1406.0, + 1404.0, + 295.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1398.0, + 1351.0, + 1398.0, + 1351.0, + 1432.0, + 296.0, + 1432.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1154, + 1404, + 1154, + 1404, + 1403, + 298, + 1403 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1403, + 229, + 1403, + 444, + 298, + 444 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 460, + 1403, + 460, + 1403, + 583, + 299, + 583 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 938, + 1404, + 938, + 1404, + 1061, + 299, + 1061 + ], + "score": 0.97 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 299, + 620, + 543, + 620, + 543, + 652, + 299, + 652 + ], + "score": 0.877 + }, + { + "category_id": 0, + "poly": [ + 301, + 1098, + 743, + 1098, + 743, + 1129, + 301, + 1129 + ], + "score": 0.876 + }, + { + "category_id": 1, + "poly": [ + 302, + 678, + 1189, + 678, + 1189, + 710, + 302, + 710 + ], + "score": 0.862 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.84 + }, + { + "category_id": 1, + "poly": [ + 298, + 736, + 1406, + 736, + 1406, + 912, + 298, + 912 + ], + "score": 0.682 + }, + { + "category_id": 13, + "poly": [ + 487, + 521, + 573, + 521, + 573, + 555, + 487, + 555 + ], + "score": 0.93, + "latex": "R _ { i n t } ^ { \\mathrm { c o v } } ( t )" + }, + { + "category_id": 13, + "poly": [ + 922, + 809, + 1107, + 809, + 1107, + 840, + 922, + 840 + ], + "score": 0.93, + "latex": "\\hat { x } _ { t + 1 } = \\hat { x } _ { t } + \\tilde { a } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 884, + 520, + 970, + 520, + 970, + 555, + 884, + 555 + ], + "score": 0.93, + "latex": "R _ { i n t } ^ { \\mathrm { c o l l } } ( t )" + }, + { + "category_id": 13, + "poly": [ + 298, + 491, + 380, + 491, + 380, + 524, + 298, + 524 + ], + "score": 0.92, + "latex": "C ( M _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 802, + 810, + 859, + 810, + 859, + 841, + 802, + 841 + ], + "score": 0.92, + "latex": "\\hat { x } _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1005, + 1339, + 1220, + 1339, + 1220, + 1372, + 1005, + 1372 + ], + "score": 0.91, + "latex": "( a _ { i } , a _ { i + 1 } , . . . , a _ { i + T } )" + }, + { + "category_id": 13, + "poly": [ + 1103, + 738, + 1252, + 738, + 1252, + 768, + 1103, + 768 + ], + "score": 0.91, + "latex": "{ \\hat { x } } _ { 0 } = x _ { 0 } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 652, + 1371, + 860, + 1371, + 860, + 1403, + 652, + 1403 + ], + "score": 0.9, + "latex": "( s _ { i } , s _ { i + 1 } , . . . , s _ { i + T } )" + }, + { + "category_id": 13, + "poly": [ + 1188, + 810, + 1217, + 810, + 1217, + 839, + 1188, + 839 + ], + "score": 0.89, + "latex": "\\hat { x } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 410, + 1310, + 798, + 1310, + 798, + 1342, + 410, + 1342 + ], + "score": 0.87, + "latex": "( \\left( { { s _ { i } } , { a _ { i } } , { s _ { i + 1 } } , { a _ { i + 1 } } , . . . , { s _ { i + T } } , { a _ { i + T } } } \\right)" + }, + { + "category_id": 13, + "poly": [ + 587, + 840, + 615, + 840, + 615, + 869, + 587, + 869 + ], + "score": 0.87, + "latex": "\\tilde { a } _ { t }" + }, + { + "category_id": 13, + "poly": [ + 602, + 383, + 768, + 383, + 768, + 414, + 602, + 414 + ], + "score": 0.86, + "latex": "( 1 2 8 - 3 2 - 1 )" + }, + { + "category_id": 13, + "poly": [ + 866, + 844, + 894, + 844, + 894, + 869, + 866, + 869 + ], + "score": 0.85, + "latex": "a _ { t }" + }, + { + "category_id": 13, + "poly": [ + 819, + 522, + 840, + 522, + 840, + 553, + 819, + 553 + ], + "score": 0.85, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 618, + 782, + 646, + 782, + 646, + 808, + 618, + 808 + ], + "score": 0.83, + "latex": "a _ { t }" + }, + { + "category_id": 13, + "poly": [ + 801, + 353, + 973, + 353, + 973, + 384, + 801, + 384 + ], + "score": 0.83, + "latex": "( 1 2 8 - 3 2 - 6 )" + }, + { + "category_id": 13, + "poly": [ + 884, + 1310, + 908, + 1310, + 908, + 1336, + 884, + 1336 + ], + "score": 0.8, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1295, + 496, + 1318, + 496, + 1318, + 518, + 1295, + 518 + ], + "score": 0.73, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 427, + 809, + 505, + 809, + 505, + 839, + 427, + 839 + ], + "score": 0.68, + "latex": "0 . 2 5 \\mathrm { m } )" + }, + { + "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, + 617.0, + 549.0, + 617.0, + 549.0, + 657.0, + 296.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1097.0, + 746.0, + 1097.0, + 746.0, + 1133.0, + 296.0, + 1133.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": [ + 296.0, + 1154.0, + 1402.0, + 1154.0, + 1402.0, + 1188.0, + 296.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1186.0, + 1405.0, + 1186.0, + 1405.0, + 1220.0, + 294.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1215.0, + 1404.0, + 1215.0, + 1404.0, + 1249.0, + 296.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1247.0, + 1404.0, + 1247.0, + 1404.0, + 1281.0, + 294.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1276.0, + 1403.0, + 1276.0, + 1403.0, + 1312.0, + 293.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1309.0, + 409.0, + 1309.0, + 409.0, + 1343.0, + 293.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 1309.0, + 883.0, + 1309.0, + 883.0, + 1343.0, + 799.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 1309.0, + 1404.0, + 1309.0, + 1404.0, + 1343.0, + 909.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1338.0, + 1004.0, + 1338.0, + 1004.0, + 1375.0, + 293.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 1338.0, + 1406.0, + 1338.0, + 1406.0, + 1375.0, + 1221.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1367.0, + 651.0, + 1367.0, + 651.0, + 1407.0, + 293.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 1367.0, + 875.0, + 1367.0, + 875.0, + 1407.0, + 861.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 229.0, + 1405.0, + 229.0, + 1405.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 263.0, + 1405.0, + 263.0, + 1405.0, + 293.0, + 296.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 290.0, + 1405.0, + 290.0, + 1405.0, + 325.0, + 292.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 322.0, + 1405.0, + 322.0, + 1405.0, + 356.0, + 294.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 353.0, + 800.0, + 353.0, + 800.0, + 386.0, + 293.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 353.0, + 1405.0, + 353.0, + 1405.0, + 386.0, + 974.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 384.0, + 601.0, + 384.0, + 601.0, + 415.0, + 296.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 384.0, + 1404.0, + 384.0, + 1404.0, + 415.0, + 769.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 414.0, + 733.0, + 414.0, + 733.0, + 448.0, + 296.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 460.0, + 1407.0, + 460.0, + 1407.0, + 496.0, + 294.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 488.0, + 297.0, + 488.0, + 297.0, + 526.0, + 293.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 488.0, + 1294.0, + 488.0, + 1294.0, + 526.0, + 381.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1319.0, + 488.0, + 1405.0, + 488.0, + 1405.0, + 526.0, + 1319.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 516.0, + 486.0, + 516.0, + 486.0, + 563.0, + 289.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 516.0, + 818.0, + 516.0, + 818.0, + 563.0, + 574.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 516.0, + 883.0, + 516.0, + 883.0, + 563.0, + 841.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 516.0, + 1410.0, + 516.0, + 1410.0, + 563.0, + 971.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 553.0, + 1218.0, + 553.0, + 1218.0, + 585.0, + 294.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 936.0, + 1404.0, + 936.0, + 1404.0, + 973.0, + 294.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 969.0, + 1404.0, + 969.0, + 1404.0, + 1002.0, + 295.0, + 1002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 997.0, + 1405.0, + 997.0, + 1405.0, + 1037.0, + 293.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1030.0, + 1303.0, + 1030.0, + 1303.0, + 1062.0, + 294.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 675.0, + 1194.0, + 675.0, + 1194.0, + 714.0, + 296.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 737.0, + 1102.0, + 737.0, + 1102.0, + 771.0, + 297.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 737.0, + 1262.0, + 737.0, + 1262.0, + 771.0, + 1253.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 775.0, + 617.0, + 775.0, + 617.0, + 813.0, + 293.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 775.0, + 1406.0, + 775.0, + 1406.0, + 813.0, + 647.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 807.0, + 426.0, + 807.0, + 426.0, + 844.0, + 329.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 807.0, + 801.0, + 807.0, + 801.0, + 844.0, + 506.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 807.0, + 921.0, + 807.0, + 921.0, + 844.0, + 860.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 807.0, + 1187.0, + 807.0, + 1187.0, + 844.0, + 1108.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 807.0, + 1404.0, + 807.0, + 1404.0, + 844.0, + 1218.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 840.0, + 586.0, + 840.0, + 586.0, + 873.0, + 328.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 840.0, + 865.0, + 840.0, + 865.0, + 873.0, + 616.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 840.0, + 1099.0, + 840.0, + 1099.0, + 873.0, + 895.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 881.0, + 1110.0, + 881.0, + 1110.0, + 915.0, + 295.0, + 915.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/SySaJ0xCZ/SySaJ0xCZ_layout.pdf b/parse/train/SySaJ0xCZ/SySaJ0xCZ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..cb805780b763be8d4b30034d53a24f65c940d73e --- /dev/null +++ b/parse/train/SySaJ0xCZ/SySaJ0xCZ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a8627eef498626ad41a593a4443247c09896c8b82e7633f0fc81ad6e61e7fe94 +size 1417515 diff --git a/parse/train/SySaJ0xCZ/SySaJ0xCZ_origin.pdf b/parse/train/SySaJ0xCZ/SySaJ0xCZ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..fe219dc5635dc6075628383802f9c2f940f59952 --- /dev/null +++ b/parse/train/SySaJ0xCZ/SySaJ0xCZ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4272c2124196db69f65010264e5ee52b7ad84582dc3574e642f59b10fe7c2ab8 +size 1311377 diff --git a/parse/train/SySaJ0xCZ/SySaJ0xCZ_span.pdf b/parse/train/SySaJ0xCZ/SySaJ0xCZ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c9c7e1f7314c7630ff0ae29317f5e98781ae9067 --- /dev/null +++ b/parse/train/SySaJ0xCZ/SySaJ0xCZ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:11a1cdea120121449e792fbaf8d78e5d31053991a1220c16cb910094ec2f75c2 +size 1421996 diff --git a/parse/train/Syr8Qc1CW/Syr8Qc1CW_layout.pdf b/parse/train/Syr8Qc1CW/Syr8Qc1CW_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..504263e93170d8921a868a90bd8f6773e9991603 --- /dev/null +++ b/parse/train/Syr8Qc1CW/Syr8Qc1CW_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:aad6ec0cb756544d0bb34feaa183efda77af67035ccf3b32aa5af4da7564035a +size 1297482 diff --git a/parse/train/Syr8Qc1CW/Syr8Qc1CW_origin.pdf b/parse/train/Syr8Qc1CW/Syr8Qc1CW_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3db2943fec885f4367f25f3a4d502882445b1d77 --- /dev/null +++ b/parse/train/Syr8Qc1CW/Syr8Qc1CW_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1f5f20b0093db3a60f7c949b53946dbd4e9e68dbbad0dee212f8fd9c2cd4d317 +size 1157658 diff --git a/parse/train/Syr8Qc1CW/Syr8Qc1CW_span.pdf b/parse/train/Syr8Qc1CW/Syr8Qc1CW_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5b54b18f19a0b9c09b69f503c29ede9ecae9a28e --- /dev/null +++ b/parse/train/Syr8Qc1CW/Syr8Qc1CW_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e19b8beb25e0b0a4d45f88d4c2ad7cc2a771c31b0ac261159bdf6e9c6bbf487c +size 1300908 diff --git a/parse/train/SyrGJYlRZ/SyrGJYlRZ_layout.pdf b/parse/train/SyrGJYlRZ/SyrGJYlRZ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..509f6057c66a236781425079a1e223e352de8b5c --- /dev/null +++ b/parse/train/SyrGJYlRZ/SyrGJYlRZ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:eb81a21eab8ed8fc346fceefe9729a2281d71e71322fb3a8f4f061c47677739f +size 8366824 diff --git a/parse/train/SyrGJYlRZ/SyrGJYlRZ_origin.pdf b/parse/train/SyrGJYlRZ/SyrGJYlRZ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..382613241b1f163c556e0efcfd25507a5a818f2e --- /dev/null +++ b/parse/train/SyrGJYlRZ/SyrGJYlRZ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3675b954aa99955696444a326f4f6a1c4c2c08f1c38ebe5591d4e47c7f373939 +size 4552570 diff --git a/parse/train/SyrGJYlRZ/SyrGJYlRZ_span.pdf b/parse/train/SyrGJYlRZ/SyrGJYlRZ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..19b36bed535144546d4c69a57f202df22802c914 --- /dev/null +++ b/parse/train/SyrGJYlRZ/SyrGJYlRZ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6656388d145ef66223a0feb18b1be6ac626508dc3b7be71536a17ac419903ab6 +size 8370185 diff --git a/parse/train/SysEexbRb/SysEexbRb.md b/parse/train/SysEexbRb/SysEexbRb.md new file mode 100644 index 0000000000000000000000000000000000000000..4f73d99cf77ab4cc92c6d8faa939245d9a89dd54 --- /dev/null +++ b/parse/train/SysEexbRb/SysEexbRb.md @@ -0,0 +1,568 @@ +# CRITICAL POINTS OF LINEAR NEURAL NETWORKS: ANALYTICAL FORMS AND LANDSCAPE PROPERTIES + +Yi Zhou & Yingbin Liang +Department of Electrical and Computer Engineering +The Ohio State University +zhou.1172@osu.edu + +# ABSTRACT + +Due to the success of deep learning to solving a variety of challenging machine learning tasks, there is a rising interest in understanding loss functions for training neural networks from a theoretical aspect. Particularly, the properties of critical points and the landscape around them are of importance to determine the convergence performance of optimization algorithms. In this paper, we provide a necessary and sufficient characterization of the analytical forms for the critical points (as well as global minimizers) of the square loss functions for linear neural networks. We show that the analytical forms of the critical points characterize the values of the corresponding loss functions as well as the necessary and sufficient conditions to achieve global minimum. Furthermore, we exploit the analytical forms of the critical points to characterize the landscape properties for the loss functions of linear neural networks and shallow ReLU networks. One particular conclusion is that: While the loss function of linear networks has no spurious local minimum, the loss function of one-hidden-layer nonlinear networks with ReLU activation function does have local minimum that is not global minimum. + +# 1 INTRODUCTION + +In the past decade, deep neural networks Goodfellow et al. (2016) have become a popular tool that has successfully solved many challenging tasks in a variety of areas such as machine learning, artificial intelligence, computer vision, and natural language processing, etc. As the understandings of deep neural networks from different aspects are mostly based on empirical studies, there is a rising need and interest to develop understandings of neural networks from theoretical aspects such as generalization error, representation power, and landscape (also referred to as geometry) properties, etc. In particular, the landscape properties of loss functions (that are typically nonconex for neural networks) play a central role to determine the iteration path and convergence performance of optimization algorithms. + +One major landscape property is the nature of critical points, which can possibly be global minima, local minima, saddle points. There have been intensive efforts in the past into understanding such an issue for various neural networks. For example, it has been shown that every local minimum of the loss function is also a global minimum for shallow linear networks under the autoencoder setting and invertibility assumptions Baldi & Hornik (1989) and for deep linear networks Kawaguchi (2016); Lu & Kawaguchi (2017); Yun et al. (2017) respectively under different assumptions. The conditions on the equivalence between local minimum or critical point and global minimum has also been established for various nonlinear neural networks Yu & Chen (1995); Gori & Tesi (1992); Nguyen & Hein (2017); Soudry & Carmon (2016); Feizi et al. (2017) under respective assumptions. + +However, most previous studies did not provide characterization of analytical forms for critical points of loss functions for neural networks with only very few exceptions. In Baldi & Hornik (1989), the authors provided an analytical form for the critical points of the square loss function of shallow linear networks under certain conditions. Such an analytical form further helps to establish the landscape properties around the critical points. Further in Li et al. (2016b), the authors characterized certain sufficient form of critical points for the square loss function of matrix factorization problems and deep linear networks. + +The focus of this paper is on characterizing the sufficient and necessary forms of critical points for broader scenarios, i.e., shallow and deep linear networks with no assumptions on data matrices and network dimensions, and shallow ReLU networks over certain parameter space. In particular, such analytical forms of critical points capture the corresponding loss function values and the necessary and sufficient conditions to achieve global minimum. This further enables us to establish new landscape properties around these critical points for the loss function of these networks under general settings, and provides alternative (yet simpler and more intuitive) proofs for existing understanding of the landscape properties. + +# OUR CONTRIBUTION + +1) For the square loss function of linear networks with one hidden layer, we provide a full (necessary and sufficient) characterization of the analytical forms for its critical points and global minimizers. These results generalize the characterization in Baldi & Hornik (1989) to arbitrary network parameter dimensions and any data matrices. Such a generalization further enables us to establish the landscape property, i.e., every local minimum is also a global minimum and all other critical points are saddle points, under no assumptions on parameter dimensions and data matrices. From a technical standpoint, we exploit the analytical forms of critical points to provide a new proof for characterizing the landscape around the critical points under full relaxation of assumptions, where the corresponding approaches in Baldi & Hornik (1989) are not applicable. As a special case of linear networks, the matrix factorization problem satisfies all these landscape properties. + +2) For the square loss function of deep linear networks, we establish a full (necessary and sufficient) characterization of the analytical forms for its critical points and global minimizers. Such characterizations are new and have not been established in the existing art. Furthermore, such analytical form divides the set of non-global-minimum critical points into different categories. We identify the directions along which the loss function value decreases for two categories of the critical points, for which our result directly implies the equivalence between the local minimum and the global minimum. For these cases, our proof generalizes the result in Kawaguchi (2016) under no assumptions on the network parameter dimensions and data matrices. + +3) For the square loss function of one-hidden-layer nonlinear neural networks with ReLU activation function, we provide a full characterization of both the existence and the analytical forms of the critical points in certain types of regions in the parameter space. Particularly, in the case where there is one hidden unit, our results fully characterize the existence and the analytical forms of the critical points in the entire parameter space. Such characterization were not provided in previous work on nonlinear neural networks. Moreover, we apply our results to a concrete example to demonstrate that both local minimum that is not a global minimum and local maximum do exist in such a case. + +# RELATED WORK + +Analytical forms of critical points: Characterizing the analytical form of critical points for loss functions of neural networks dates back to Baldi & Hornik (1989), where the authors provided an analytical form of the critical points for the square loss function of linear networks with one hidden layer. In Li et al. (2016b), the authors provided a sufficient condition of critical points of a generic function, i.e., the fixed point of invariant groups. They then characterized certain sufficient forms of critical points for the square loss function of matrix factorization problems and deep linear networks, whereas our results provide sufficient and necessary forms of critical points for deep linear networks via a different approach. + +Properties of critical points: Baldi & Hornik (1989); Baldi (1989) studied the linear autoencoder with one hidden layer and showed the equivalence between the local minimum and the global minimum. Moreover, Baldi & Lu (2012) generalized these results to the complex-valued autoencoder setting. The deep linear networks were studied by some recent work Kawaguchi (2016); Lu & Kawaguchi (2017); Yun et al. (2018), in which the equivalence between the local minimum and the global minimum was established respectively under different assumptions. Particularly, Yun et al. (2017) established a necessary and sufficient condition for a critical point of the deep linear network to be a global minimum. A similar result was established in Freeman & Bruna (2017) for deep linear networks under the setting that the widths of intermediate layers are larger than those of the input and output layers. The effect of regularization on the critical points for a two-layer linear network was studied in Taghvaei et al. (2017). + +For nonlinear neural networks, Yu & Chen (1995) studied a nonlinear neural network with one hidden layer and sigmoid activation function, and showed that every local minimum is also a global minimum provided that the number of input units equals the number of data samples. Gori & Tesi (1992) considered a class of multi-layer nonlinear networks with a pyramidal structure, and showed that all critical points of full column rank achieve the zero loss when the sample size is less than the input dimension. These results were further generalized to a larger class of nonlinear networks in Nguyen & Hein (2017), in which they also showed that critical points with non-degenerate Hessian are global minimum. Choromanska et al. (2015a;b) connected the loss surface of deep nonlinear networks with the Hamiltonian of the spin-glass model under certain assumptions and characterized the distribution of the local minimum. Kawaguchi (2016) further eliminated some of the assumptions in Choromanska et al. (2015a), and established the equivalence between the local minimum and the global minimum by reducing the loss function of the deep nonlinear network to that of the deep linear network. Soudry & Carmon (2016) showed that a two-layer nonlinear network has no bad differentiable local minimum. Feizi et al. (2017) studied a one-hidden-layer nonlinear neural network with the parameters restricted in a set of directions of lines, and showed that most local minima are global minima. Tian (2017) considered a two-layer ReLU network with Gaussian input data, and showed that critical points in certain region are non-isolated and characterized the critical-point-free regions. + +Geometric curvature: Hardt & Ma (2017) established the gradient dominance condition of deep linear residual networks, and Zhou & Liang (2017) further established the gradient dominance condition and regularity condition around the global minimizers for deep linear, deep linear residual and shallow nonlinear networks. Li et al. (2016a) studied the property of the Hessian matrix for deep linear residual networks. The local strong convexity property was established in Soltanolkotabi et al. (2017) for overparameterized nonlinear networks with one hidden layer and quadratic activation functions, and was established in Zhong et al. (2017) for a class of nonlinear networks with one hidden layer and Gaussian input data. Zhong et al. (2017) further established the local linear convergence of gradient descent method with tensor initialization. Soudry & Hoffer (2017) studied a one-hidden-layer nonlinear network with a single output, and showed that the volume of sub-optimal differentiable local minima is exponentially vanishing in comparison with the volume of global minima. Dauphin et al. (2014) investigated the saddle points in deep neural networks using the results from statistical physics and random matrix theory. + +Notation: The pseudoinverse, column space and null space of a matrix $M$ are denoted by $M ^ { \dagger } , \mathrm { c o l } ( M )$ and $\ker ( M )$ , respectively. For any index sets $I , J \subset \mathbb { N }$ , $M _ { I , J }$ denotes the submatrix of $M$ formed by the entries with the row indices in $I$ and the column indices in $J$ . For positive integers $i \leq j$ , we define $i : j = \{ i , i + 1 , \dotsc , j - 1 , j \}$ . The projection operator onto a linear subspace $V$ is denoted by ${ \mathcal { P } } _ { V }$ . + +# 2 LINEAR NEURAL NETWORKS WITH ONE HIDDEN LAYER + +In this section, we study linear neural networks with one hidden layer. Suppose we have an input data matrix $\pmb { X } \in \mathbb { R } ^ { d _ { 0 } \times \pmb { m } }$ and a corresponding output data matrix $\dot { \boldsymbol { Y } } \in \mathbb { R } ^ { d _ { 2 } ^ { - } \times m }$ , where there are in total $m$ data samples. We are interested in learning a model that maps from $\boldsymbol { X }$ to $\mathbf { Y }$ via a linear network with one hidden layer. Specifically, we denote the weight parameters between the output layer and the hidden layer of the network as $A _ { 2 } ~ \in ~ \mathbb { R } ^ { d _ { 2 } \times d _ { 1 } }$ , and denote the weight parameters between the hidden layer and the input layer of the network as $A _ { 1 } \in \mathbb { R } ^ { d _ { 1 } \times d _ { 0 } }$ . We are interested in the square loss function of this linear network, which is given by + +$$ +\begin{array} { r } { \mathcal { L } : = \frac { 1 } { 2 } \left\| A _ { 2 } A _ { 1 } \boldsymbol { X } - \boldsymbol { Y } \right\| _ { F } ^ { 2 } . } \end{array} +$$ + +Note that in a special case where $X = I$ , $\mathcal { L }$ reduces to a loss function for the matrix factorization problem, to which all our results apply. The loss function $\mathcal { L }$ has been studied in Baldi & Hornik (1989) under the assumptions that $d _ { 2 } = d _ { 0 } \geq d _ { 1 }$ and the matrices $X X ^ { \top } , Y X ^ { \top } ( X X ^ { \top } ) ^ { - 1 } X Y ^ { \top }$ are invertible. In our study, no assumption is made on either the parameter dimensions or the invertibility of the data matrices. Such full generalization of the results in Baldi & Hornik (1989) turns out to be critical for our study of nonlinear shallow neural networks in Section 4. + +We further define $\Sigma : = Y X ^ { \dagger } X Y ^ { \top }$ and denote its full singular value decomposition as $U \pmb { \Lambda } U ^ { \top }$ . Suppose that $\pmb { \Sigma }$ has $r$ distinct positive singular values $\sigma _ { 1 } > \cdots > \sigma _ { r } > 0$ with multiplicities $m _ { 1 } , \ldots , m _ { r }$ , respectively, and has $\bar { m }$ zero singular values. Recall that $( A _ { 1 } , A _ { 2 } )$ is defined to be a critical point of $\mathcal { L }$ if $\nabla _ { A _ { 1 } } \mathcal { L } = \mathbf { 0 } , \nabla _ { A _ { 2 } } \mathcal { L } = \mathbf { 0 }$ . Our first result provides a full characterization of all critical points of $\mathcal { L }$ . + +Theorem 1 (Characterization of critical points). All critical points of $\mathcal { L }$ are necessarily and sufficiently characterized by a matrix $\pmb { L } _ { 1 } \in \overline { { \mathbb { R } ^ { d _ { 1 } \times d _ { 0 } } } }$ , a block matrix $V ~ \in \mathbb { R } ^ { d _ { 2 } \times d _ { 1 } }$ and an invertible matrix $C \in \mathbb { R } ^ { d _ { 1 } \times d _ { 1 } }$ via + +$$ +\begin{array} { r l } & { A _ { 1 } = C ^ { - 1 } V ^ { \top } U ^ { \top } Y X ^ { \dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \top } V C L _ { 1 } X X ^ { \dagger } } \\ & { A _ { 2 } = U V C . } \end{array} +$$ + +Specifically, $V = [ \mathrm { d i a g } ( V _ { 1 } , \ldots , V _ { r } , \overline { { { V } } } ) , \mathbf { 0 } ^ { d _ { 2 } \times ( d _ { 1 } - \mathrm { r a n k } ( { \bf A } _ { 2 } ) ) } ] ,$ , where both $V _ { i } \in \mathbb { R } ^ { m _ { i } \times p _ { i } }$ and $\overline { { V } } \in$ $\bar { \mathbb { R } } ^ { \bar { m } \times \bar { p } }$ consist of orthonormal columns with the number of columns $p _ { i } \leq m _ { i } , i = 1 , . . . , r , \bar { p } \leq \bar { m }$ such that ${ \textstyle \sum _ { i = 1 } ^ { r } p _ { i } + \bar { p } = \mathrm { r a n k } ( A _ { 2 } ) }$ , and $L _ { 1 } , V , C$ satisfy + +$$ +\mathcal { P } _ { \mathrm { c o l } ( U V ) ^ { \perp } } \mathbf { { \mathit { Y X } } ^ { \top } } \mathbf { { \mathit { L } } _ { 1 } ^ { \top } } \mathbf { { \mathit { C } } ^ { \top } } \mathcal { P } _ { \mathrm { k e r } ( V ) } = \mathbf { { 0 } } . +$$ + +Theorem 1 characterizes the necessary and sufficient forms for all critical points of $\mathcal { L }$ . Intuitively, the matrix $C$ captures the invariance of the product $\mathbf { A } _ { 2 } \mathbf { A } _ { 1 }$ under an invertible transform, and $\mathbf { L } _ { 1 }$ captures the degree of freedom of the solution set for linear systems. + +In general, the set of critical points is uncountable and cannot be fully listed out. However, the analytical forms in eqs. (1) and (2) do allow one to construct some critical points of $\mathcal { L }$ by specifying choices of $L _ { 1 } , V , C$ that fulfill the condition in eq. (3). For example, choosing $\mathbf { L } _ { 1 } = \mathbf { 0 }$ guarantees eq. (3), in which case eqs. (1) and (2) yield a critical point $( C ^ { - \mathrm { i } } V ^ { \dagger } U ^ { \top } Y X ^ { \dagger } , U V C )$ for any invertible matrix $C$ and any block matrix $V$ that takes the form specified in Theorem 1. For nonzero $\mathbf { L } _ { 1 }$ , one can fix a proper $V$ and solve the linear equation on $C$ in eq. (3). If a solution exists, we then obtain the form of a corresponding critical point. We further note that the analytical structures of the critical points are more important, which have direct implications on the global optimality conditions and landscape properties as we show in the remaining part of the section. + +Remark 1. We note that the block pattern parameters $\{ p _ { i } \} _ { i = 1 } ^ { r }$ and $\bar { p }$ denote the number of columns of $\{ V _ { i } \} _ { i = 1 } ^ { r }$ and $\overline { V }$ , respectively, and their sum equals the rank of $A _ { 2 }$ , i.e., $\textstyle \sum _ { i = 1 } ^ { r } p _ { i } + { \bar { p } } = \operatorname { r a n k } ( A _ { 2 } )$ + +The parameters $p _ { i } , i = 1 , \ldots , r , \bar { p }$ of $V$ contain all useful information of the critical points that determine the function value of $\mathcal { L }$ as presented in the following proposition. + +Proposition 1. Any critical point $( A _ { 1 } , A _ { 2 } )$ of $\mathcal { L }$ satisfies $\begin{array} { r } { \mathcal { L } ( A _ { 1 } , A _ { 2 } ) = \frac { 1 } { 2 } ( \mathrm { T r } ( Y Y ^ { \top } ) - \sum _ { i = 1 } ^ { r } p _ { i } \sigma _ { i } ) . } \end{array}$ + +Proposition 1 evaluates the function value $\mathcal { L }$ at a critical point using the parameters $\{ p _ { i } \} _ { i = 1 } ^ { r }$ . To explain further, recall that the data matrix $\pmb { \Sigma }$ has each singular value $\sigma _ { i }$ with multiplicity $m _ { i }$ . For each $i$ , the critical point captures $p _ { i }$ out of $m _ { i }$ singular values $\sigma _ { i }$ . Hence, for a $\sigma _ { i }$ with larger value (i.e., a smaller index $i$ ), it is desirable that a critical point captures a larger number $p _ { i }$ of them. In this way, the critical point captures more important principle components of the data so that the value of the loss function is further reduced as suggested by Proposition 1. In summary, the parameters $\{ p _ { i } \} _ { i = 1 } ^ { r }$ characterize how well the learned model fits the data in terms of the value of the loss function. Moreover, the parameters $\{ p _ { i } \} _ { i = 1 } ^ { r }$ also determine a full characterization of the global minimizers as given below. + +Proposition 2 (Characterization of global minimizers). A critical point $( A _ { 1 } , A _ { 2 } )$ of $\mathcal { L }$ is a global minimizer if and only if it falls into the following two cases. + +1. Case $\begin{array} { r } { \operatorname { r a n k } ( A _ { 2 } ) - \sum _ { i = 1 } ^ { k - 1 } m _ { i } \le m _ { k } } \end{array}$ $^ { l }$ : $\begin{array} { r } { \operatorname* { m i n } \{ d _ { 2 } , d _ { 1 } \} \le \sum _ { i = 1 } ^ { r } m _ { i } } \end{array}$ =1 for some , $A _ { 2 }$ $k \leq r$ is full rank, and ; $p _ { 1 } = m _ { 1 } , \ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =$ 2. Case 2: $\begin{array} { r } { \operatorname* { m i n } \{ d _ { 2 } , d _ { 1 } \} > \sum _ { i = 1 } ^ { r } m _ { i } } \end{array}$ i , $p _ { i } = m _ { i }$ for $i = 1 , \ldots , r _ { : }$ , and $\bar { p } \geq 0$ . In particular, $A _ { 2 }$ can be non-full rank with $\textstyle { \mathrm { r a n k } } ( A _ { 2 } ) = \sum _ { i = 1 } ^ { r } m _ { i }$ . + +The analytical form of any global minimizer can be obtained from Theorem 1 with further specification to the above two cases. + +Proposition 2 establishes the neccessary and sufficient conditions for any critical point to be a global minimizer. If the data matrix $\pmb { \Sigma }$ has a large number of nonzero singular values, i.e., the first case, one needs to exhaust the representation budget (i.e., rank) of $A _ { 2 }$ and capture as many large singular values as the rank allows to achieve the global minimum; Otherwise, $A _ { 2 }$ of a global minimizer can be non-full rank and still captures all nonzero singular values. Note that $A _ { 2 }$ must be full rank in the case 1, and so is $A _ { 1 }$ if we further adopt the assumptions on the network size and data matrices in Baldi & Hornik (1989). + +Furthermore, the parameters $\{ p _ { i } \} _ { i = 1 } ^ { r }$ naturally divide all non-global-minimum critical points $\left( A _ { 1 } , A _ { 2 } \right)$ of $\mathcal { L }$ into the following two categories. + +• (Non-optimal order): The matrix $V$ specified in Theorem 1 satisfies that there exists $1 \leq i < j \leq$ $r$ such that $p _ { i } < m _ { i }$ and $p _ { j } > 0$ . • (Optimal order): $\mathrm { r a n k } ( A _ { 2 } ) < \mathrm { m i n } \{ d _ { 2 } , d _ { 1 } \}$ and the matrix $V$ specified in Theorem 1 satisfies that $p _ { 1 } = m _ { 1 } , \ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = { \mathrm { r a n k } } ( A _ { 2 } ) - \sum _ { i = 1 } ^ { k - 1 } m _ { i } \leq m _ { k }$ for some $1 \leq k \leq r$ . + +To understand the above two categories, note that a critical point of $\mathcal { L }$ with non-optimal order captures a smaller singular value $\sigma _ { j }$ (since $p _ { j } > 0 \ :$ ) while skipping a larger singular value $\sigma _ { i }$ with a lower index $i < j$ (since $p _ { i } < m _ { i } )$ ), and hence cannot be a global minimizer. On the other hand, although a critical point of $\mathcal { L }$ with optimal order captures the singular values in the optimal (i.e., decreasing) order, it does not fully utilize the representation budget of $A _ { 2 }$ (because $A _ { 2 }$ is non-full rank) to further capture nonzero singular values and reduce the function value, and hence cannot be a global minimizer either. Next, we show that these two types of non-global-minimum critical points have different landscape properties around them. Throughout, a matrix $\widetilde { M }$ is called the perturbation of $M$ if it lies in an arbitrarily small neighborhood of $M$ . + +Proposition 3 (Landscape around critical points). The critical points of $\mathcal { L }$ have the following landscape properties. + +1. A non-optimal-order critical point $\left( A _ { 1 } , A _ { 2 } \right)$ has a perturbation $( \widetilde { A _ { 1 } } , \widetilde { A _ { 2 } } )$ with ran $\operatorname { k } ( \widetilde { A _ { 2 } } ) =$ $\operatorname { r a n k } ( A _ { 2 } )$ , which achieves a lower function value; +2. An optimal-order critical point $( A _ { 1 } , A _ { 2 } )$ has a perturbation $( \widetilde { A _ { 1 } } , \widetilde { A _ { 2 } } )$ with $\mathrm { r a n k } ( \widetilde { A _ { 2 } } ) =$ $\mathrm { r a n k } ( A _ { 2 } ) + 1$ , which achieves a lower function value; +3. Any point in $\mathcal { X } : = \{ ( A _ { 1 } , A _ { 2 } ) : ~ A _ { 2 } A _ { 1 } X \neq \mathbf { 0 } \}$ has a perturbation $( A _ { 1 } , \widetilde { A _ { 2 } } )$ , which achieves a higher function value; + +As a consequence, items 1 and 2 imply that any non-global-minimum critical point has a descent direction, and hence cannot be a local minimizer. Thus, any local minimizer must be a global minimizer. Item 3 implies that any point has an ascent direction whenever the output is nonzero. Hence, there does not exist any local/global maximizer in $\mathcal { X }$ . Furthermore, item 3 together with items 1 and 2 implies that any non-global-minimum critical point in $\mathcal { X }$ has both descent and ascent directions, and hence must be a saddle point. We summarize these facts in the following theorem. + +Theorem 2 (Landscape of $\mathcal { L }$ ). The loss function $\mathcal { L }$ satisfies: $^ { l }$ ) every local minimum is also a global minimum; 2) every non-global-minimum critical point in $\mathcal { X }$ is a saddle point. + +We note that the saddle points in Theorem 2 can be non-strict when the data matrices are singular. As an illustrative example, consider the following loss function of a shallow linear network ${ \mathcal { L } } ( a _ { 2 } , a _ { 1 } ) =$ $\textstyle { \frac { 1 } { 2 } } ( a _ { 2 } a _ { 1 } x - y ) ^ { 2 }$ , where $a _ { 1 } , a _ { 2 } , x$ and $y$ are all scalars. Consider the case $y = 0$ . Then, the Hessian at the saddle point $a _ { 1 } = 0 , a _ { 2 } = 1$ is $[ x ^ { 2 } , 0 ; 0 , 0 ]$ , which does not have any negative eigenvalue. + +From a technical point of view, the proof of item 1 of Proposition 3 applies that in Baldi (1989) and generalizes it to the setting where $\pmb { \Sigma }$ can have repeated singular values and may not be invertible. To further understand the perturbation scheme from a high level perspective, note that non-optimalorder critical points capture a smaller singular value $\sigma _ { j }$ instead of a larger one $\sigma _ { i }$ with $i < j$ . Thus, one naturally perturbs the singular vector corresponding to $\sigma _ { j }$ along the direction of the singular vector corresponding to $\sigma _ { i }$ . Such a perturbation scheme preserves the rank of $A _ { 2 }$ and reduces the value of the loss function. + +More importantly, the proof of item 2 of Proposition 3 introduces a new technique. As a comparison, Baldi & Hornik (1989) proves a similar result as item 2 using the strict convexity of the function, which requires the parameter dimensions to satisfy $d _ { 2 } = d _ { 0 } \geq d _ { 1 }$ and the data matrices to be invertible. In contrast, our proof completely removes these restrictions by introducing a new perturbation direction and exploiting the analytical forms of critical points in eqs. (1) and (2) and the condition in eq. (3). The accomplishment of the proof further requires careful choices of perturbation parameters as well as judicious manipulations of matrices. We refer the reader to the supplemental materials for more details. As a high level understanding, since optimal-order critical points capture the singular values in an optimal (i.e., decreasing) order, the previous perturbation scheme for non-optimal-order critical points does not apply. Instead, we increase the rank of $A _ { 2 }$ by one in a way that the perturbed matrix captures the next singular value beyond the ones that have already been captured so that the value of the loss function can be further reduced. + +# 3 DEEP LINEAR NEURAL NETWORKS + +In this section, we study deep linear networks with $\ell \geq 2$ layers. We denote the weight parameters between the layers as $\dot { \pmb { A } } _ { k } \in \dot { \mathbb { R } } ^ { d _ { k } \times d _ { k - 1 } }$ for $k = 1 , \dots , \ell$ , respectively. The input and output data are denoted by $\pmb { X } ^ { ' } \in \mathbb { R } ^ { d _ { 0 } \times m }$ , $\pmb { Y } \in \mathbb { R } ^ { d _ { \ell } \times m }$ , respectively. We are interested in the square loss function of deep linear networks, which is given by + +$$ +\begin{array} { r } { \mathcal { L } _ { D } : = \frac { 1 } { 2 } \left\| A _ { \ell } \cdot \cdot \cdot A _ { 2 } A _ { 1 } \boldsymbol { X } - \boldsymbol { Y } \right\| _ { F } ^ { 2 } . } \end{array} +$$ + +Denote $\Sigma _ { k } : = Y ( A _ { ( k , 1 ) } X ) ^ { \dagger } A _ { ( k , 1 ) } X Y ^ { \top }$ for $k = 0 , \ldots , \ell$ with the full singular value decomposition $U _ { k } \pmb { \Lambda } _ { k } \pmb { U } _ { k } ^ { \top }$ . Suppose that $\Sigma _ { k }$ has $r ( k )$ distinct positive singular values $\sigma _ { 1 } ( k ) > \cdots >$ $\sigma _ { r ( k ) } ( k ) > 0$ with multiplicities $m _ { 1 } ( k ) , \ldots , m _ { r ( k ) } ( k )$ , respectively, and $\bar { m } ( k )$ zero singular values. Our first result provides a full characterization of all critical points of $\mathcal { L } _ { D }$ , where we denote $\begin{array} { r } { \pmb { A } _ { ( i , j ) } : = \pmb { A } _ { i } \pmb { A } _ { i - 1 } \cdot \cdot \cdot \pmb { A } _ { j + 1 } \pmb { A } _ { j } } \end{array}$ for notational convenience1. + +Theorem 3 (Characterization of critical points). All critical points of $\mathcal { L } _ { D }$ are necessarily and sufficiently characterized by matrices $\pmb { L } _ { k } \in \mathrm { \bar { R } } ^ { d _ { k } \times d _ { k - 1 } }$ , block matrices $\dot { V } _ { k } \in \mathbb { R } ^ { d _ { l } \times d _ { k + 1 } }$ and invertible matrices $C _ { k } \in \mathbb { R } ^ { d _ { k + 1 } \times \tilde { d _ { k + 1 } } }$ for $k = 0 , \ldots , \ell { - } 2$ such that $A _ { 1 } , \ldots , A _ { \ell }$ can be individually expressed out recursively via the following two equations: + +$$ +A _ { k + 1 } = C _ { k } ^ { - 1 } V _ { k } ^ { \top } U _ { k } ^ { \top } Y ( A _ { ( k , 1 ) } X ) ^ { \dagger } + L _ { k + 1 } - C _ { k } ^ { - 1 } V _ { k } ^ { \top } V _ { k } C _ { k } L _ { k + 1 } A _ { ( k , 1 ) } X ( A _ { ( k , 1 ) } X ) ^ { \dagger } , +$$ + +Specifically, $\begin{array} { r l r } { V _ { k } } & { = } & { [ \mathrm { d i a g } ( { V } _ { 1 } ^ { ( k ) } , \ldots , { V } _ { r ( k ) } ^ { ( k ) } , \overline { { V } } ^ { ( k ) } ) , \mathbf { 0 } ^ { d _ { l } \times ( d _ { k + 1 } - \mathrm { r a n k } ( { A } _ { ( \ell , k + 2 ) } ) ) } ] , } \end{array}$ , where $V _ { i } ^ { ( k ) } ~ \in \qquad $ $\mathbb { R } ^ { m _ { i } ( k ) \times p _ { i } ( k ) } , ~ \overline { { V } } ^ { ( k ) } ~ \in ~ \mathbb { R } ^ { \bar { m } ( k ) \times \bar { p } ( k ) }$ consist of orthonormal columns with $p _ { i } ( k ) ~ \leq ~ m _ { i } ( k )$ for $i = 1 , \ldots , r ( k ) , \bar { p } ( k ) \leq \bar { m } ( k )$ such that $\begin{array} { r } { \sum _ { i = 1 } ^ { r ( k ) } p _ { i } ( k ) + \bar { p } ( k ) = \mathrm { r a n k } ( A _ { \ell , k + 1 } ) . } \end{array}$ , and $\mathbf { \Delta } _ { L _ { k } , V _ { k } , C _ { k } }$ satisfy for $k = 2 , \ldots , \ell - 1$ + +$$ +\begin{array} { r } { \pmb { A } _ { ( \ell , k ) } = \pmb { A } _ { ( \ell , k + 1 ) } \pmb { A } _ { k } , \quad ( \pmb { I } - \mathcal { P } _ { \mathrm { c o l } ( \pmb { A } _ { ( \ell , k + 1 ) } ) } ) \pmb { Y } \pmb { X } ^ { \top } \pmb { A } _ { ( \ell - 1 , 1 ) } ^ { \top } = \pmb { 0 } . } \end{array} +$$ + +Note that the forms of the individual parameters $A _ { 1 } , \ldots , A _ { \ell }$ can be obtained as follows by recursively applying eqs. (4) and (5). First, eq. (5) with $k = 0$ yields the form of $\pmb { A } _ { ( \ell , 2 ) }$ . Then, eq. (4) with $k = 0$ and the form of $\pmb { A } _ { ( \ell , 2 ) }$ yield the form of $\pmb { A } _ { 1 }$ . Next, eq. (5) with $k = 1$ yields the form of $\mathbf { \delta A } _ { ( \ell , 3 ) }$ , and then, eq. (4) with $\dot { k } = 1$ and the forms of $A _ { ( \ell , 3 ) } , A _ { 1 }$ further yield the form of $A _ { 2 }$ . Inductively, one obtains the expressions of all individual parameter matrices. Furthermore, the first condition in eq. (6) is a consistency condition that guarantees that the analytical form for the entire product of parameter matrices factorizes into the forms of individual parameter matrices. Similarly to shallow linear networks, while the set of critical points here is also uncountable, Theorem 3 suggests ways to obtain some critical points. For example, if we set $\pmb { L } _ { k } = \mathbf { 0 }$ for all $k$ (i.e., eq. (6) is satisfied), we can obtain the form of critical points for any invertible $C _ { k }$ and proper $V _ { k }$ with the structure specified in Theorem 3. For nonzero $\scriptstyle L _ { k }$ , eq. (6) needs to be verified for given $C _ { k }$ and $V _ { k }$ to determine a critical point. + +Similarly to shallow linear networks, the parameters loss function at the critical points and further specify t $\{ p _ { i } ( 0 ) \} _ { i = 1 } ^ { r ( 0 ) } , \bar { p } ( 0 )$ determine the value of them for the global minimizers, as we present in the following two propositions. + +Proposition 4. Any critical point $( \pmb { A } _ { 1 } , \ldots , \pmb { A } _ { \ell } )$ of $\mathcal { L } _ { D }$ satisfies + +$$ +\begin{array} { r } { \mathcal { L } _ { D } ( A _ { 1 } , \ldots , A _ { \ell } ) = \frac { 1 } { 2 } \big [ \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \sigma _ { i } ( 0 ) \big ] . } \end{array} +$$ + +Proposition 5 (Characterization of global minimizers). A critical point $( \pmb { A } _ { 1 } , \ldots , \pmb { A } _ { \ell } )$ of $\mathcal { L } _ { D }$ is $a$ global minimizer if and only if it falls into the following two cases. + +1. Case $I$ : $\begin{array} { r } { \operatorname* { m i n } \{ d _ { \ell } , \dots , d _ { 1 } \} \ \le \ \sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \end{array}$ , $\pmb { A } _ { ( \ell , 2 ) }$ achieves the maximal rank, and $p _ { 1 } ( 0 ) =$ $m _ { 1 } ( 0 ) , \ldots , p _ { k - 1 } ( 0 ) = m _ { k - 1 } ( 0 ) , p _ { k } ( 0 ) = \mathrm { r a n k } ( A _ { ( \ell , 2 ) } ) - \sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \leq m _ { k } ( 0 )$ for some $k \leq r ( 0 )$ ; 2. Case 2: $\begin{array} { r } { \operatorname* { m i n } \{ d _ { \ell } , \dots , d _ { 1 } \} > \sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \end{array}$ , $p _ { i } ( 0 ) = m _ { i } ( 0 )$ for all $i = 1 , \ldots , r ( 0 )$ and $\bar { p } ( 0 ) \geq 0$ . In particular, $\pmb { A } _ { ( \ell , 2 ) }$ can be non-full rank with $\begin{array} { r } { \mathrm { r a n k } ( A _ { ( \ell , 2 ) } ) = \sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \end{array}$ . + +The analytical form of any global minimizer can be obtained from Theorem 3 with further specification to the above two cases. + +In particular for case 1, if we further adopt the invertibility assumptions on data matrices as in Baldi & Hornik (1989) and assume that all parameter matrices are square, then all global minima must correspond to full rank parameter matrices. + +We next exploit the analytical forms of the critical points to further understand the landscape of the loss function $\mathcal { L } _ { D }$ . It has been shown in Kawaguchi (2016) that every local minimum of $\mathcal { L } _ { D }$ is also a global minimum, under certain conditions on the parameter dimensions and the invertibility of the data matrices. Here, our characterization of the analytical forms for the critical points allow us to understand such a result from an alternative viewpoint. The proofs for certain cases (that we discuss below) are simpler and more intuitive, and no assumption is made on the data matrices and dimensions of the network. + +Similarly to shallow linear networks, we want to understand the local landscape around the critical points. However, due to the effect of depth, the critical points of $\mathcal { L } _ { D }$ are more complicated than those of $\mathcal { L }$ . Among them, we identify the following subsets of the non-global-minimum critical points $( \pmb { A } _ { 1 } , \cdots , \pmb { A } _ { \ell } )$ of $\mathcal { L } _ { D }$ . + +• (Deep-non-optimal order): There exist $0 \leq k \leq \ell - 2$ such that the matrix $V _ { k }$ specified in Theorem 3 satisfies that there exist $1 \leq i < j \leq r ( k )$ such that $p _ { i } ( k ) < m _ { i } ( k )$ and $p _ { j } ( k ) > 0$ . • (Deep-optimal order): $\left( \mathbf { \boldsymbol { A } } _ { \ell } , \mathbf { \boldsymbol { A } } _ { \ell - 1 } \right)$ is not a global minimizer of $\mathcal { L } _ { D }$ with $A _ { ( \ell - 2 , 1 ) }$ being fixed, $\mathrm { r a n k } ( A _ { \ell } ) < \operatorname* { m i n } \{ d _ { \ell } , d _ { \ell - 1 } \}$ , and the matrix $V _ { \ell - 2 }$ specified in Theorem 3 satisfies that $p _ { 1 } ( l - 2 ) =$ $\begin{array} { r } { m _ { 1 } ( l - 2 ) , \ldots , p _ { k - 1 } ( l - 2 ) = m _ { k - 1 } ( l - 2 ) , p _ { k } ( l - 2 ) = \operatorname { r a n k } ( A _ { l } ) - \sum _ { i = 1 } ^ { k - 1 } m _ { i } ( l - 2 ) \leq m _ { k } ( l - 2 ) } \end{array}$ $1 \leq k \leq r ( l - 2 )$ + +The following result summarizes the landscape of $\mathcal { L } _ { D }$ around the above two types of critical points. + +Theorem 4 (Landscape of $\mathcal { L } _ { D }$ ). The loss function $\mathcal { L } _ { D }$ has the following landscape properties. + +1. A deep-non-optimal-order critical point $( \pmb { A } _ { 1 } , \ldots , \pmb { A } _ { \ell } )$ has $a$ perturbation $( A _ { 1 } , \ldots , \widetilde { A } _ { k + 1 } , \ldots , \widetilde { A } _ { \ell } )$ with $\begin{array} { r c l } { \operatorname { r a n k } ( \widetilde { A } _ { \ell } ) } & { = } & { \operatorname { r a n k } ( A _ { \ell } ) } \end{array}$ , which achieves $a$ lower function value. +2. A deep-optimal-order critical point $( \pmb { A } _ { 1 } , \dots , \pmb { A } _ { \ell } )$ has a perturbation $( A _ { 1 } , \ldots , \widetilde { A } _ { \ell - 1 } , \widetilde { A } _ { \ell } )$ with $\mathrm { r a n k } ( \widetilde { A } _ { \ell } ) = \mathrm { r a n k } ( A _ { \ell } ) + 1 ;$ , which achieves a lower function value. +3. Any point in $\mathcal { X } _ { D } : = \{ ( A _ { 1 } , . . . , A _ { \ell } ) : A _ { ( \ell , 1 ) } X \neq \mathbf { 0 } \}$ has a perturbation $( A _ { 1 } , \ldots , \widetilde { A } _ { \ell } )$ that achieves a higher function value. + +Consequently, $^ { l }$ ) every local minimum of $\mathcal { L } _ { D }$ is also a global minimum for the above two types of critical points; and 2) every critical point of these two types in $\mathcal { X } _ { D }$ is a saddle point. + +Theorem 4 implies that the landscape of $\mathcal { L } _ { D }$ for deep linear networks is similar to that of $\mathcal { L }$ for shallow linear networks, i.e., the pattern of the parameters $\{ p _ { i } ( k ) \} _ { i = 1 } ^ { r ( k ) }$ implies different descent directions of the function value around the critical points. Our approach does not handle the remaining set of non-global minimizers, i.e., there exists $q \leq \ell - 1$ such that $( A _ { \ell } , \ldots , A _ { q } )$ is a global minimum point of $\mathcal { L } _ { D }$ with $A _ { ( q - 1 , 1 ) }$ being fixed, and $\pmb { A } _ { ( \ell , q ) }$ is of optimal order. It is unclear how to perturb the intermediate weight parameters using their analytical forms for deep networks , and we leave this as an open problem for the future work. + +In this section, we study nonlinear neural networks with one hidden layer. In particular, we consider nonlinear networks with ReLU activation function $\sigma : \mathbb { R } \mathbb { R }$ that is defined as $\sigma ( x ) : = \operatorname* { m a x } \{ x , 0 \}$ . Our study focuses on the set of differentiable critical points. The weight parameters between the layers are denoted by $A _ { 2 } \in \mathbb { R } ^ { d _ { 2 } \times d _ { 1 } }$ , $A _ { 1 } \in \mathbb { R } ^ { d _ { 1 } \times d _ { 0 } }$ , respectively, and the input and output data are denoted by $\pmb { X } \in \mathbb { R } ^ { \tilde { d } _ { 0 } \times m } , \pmb { Y } \in \mathbb { R } ^ { d _ { 2 } \times m }$ , respectively. We are interested in the square loss function which is given by + +$$ +\begin{array} { r } { \mathcal { L } _ { N } : = \frac { 1 } { 2 } \left. \boldsymbol { A } _ { 2 } \boldsymbol { \sigma } ( \boldsymbol { A } _ { 1 } \boldsymbol { X } ) - \boldsymbol { Y } \right. _ { F } ^ { 2 } , } \end{array} +$$ + +where $\sigma$ acts on $\boldsymbol { A } _ { 1 } \boldsymbol { X }$ entrywise. Existing studies on nonlinear networks characterized the sufficient conditions for critical points being global minimum Gori $\&$ Tesi (1992); Nguyen & Hein (2017), established the equivalence between local minimum and global minimum under the condition that $d _ { 0 } = m$ Yu & Chen (1995), and provided understanding of geometric properties of the critical points Tian (2017). In comparison, our results below provide a full characterization of the critical points of $\mathcal { L } _ { N }$ with $d _ { 1 } = 1$ and critical points of $\mathcal { L } _ { N }$ over certain parameter space with $d _ { 1 } > 1$ , and show that local minimum of $\mathcal { L } _ { N }$ that is not global minimum can exist. + +Since the activation function $\sigma$ is piecewise linear, the entire parameter space can be partitioned into disjoint cones. In particular, we consider the set of cones ${ \mathcal { K } } _ { I \times J }$ where $I \subset \{ 1 , \dots , d _ { 1 } \} , J \subset$ $\{ 1 , \ldots , m \}$ that satisfy + +$$ +K _ { I \times J } : = \{ ( A _ { 2 } , A _ { 1 } ) : ( A _ { 1 } ) _ { I , : } X _ { : , J } \geq 0 , { \mathrm { o t h e r ~ e n t r i e s ~ o f ~ } } A _ { 1 } X < 0 \} , +$$ + +where $\because$ and $" < "$ represent entrywise comparisons. Within ${ \mathcal { K } } _ { I \times J }$ , the term $\sigma ( A _ { 1 } X )$ activates only the entries $\sigma ( A _ { 1 } \bar { X } ) _ { I : J }$ , and the corresponding loss function $\mathcal { L } _ { N }$ is equivalent to + +$$ +\begin{array} { r } { \forall ( { \pmb A } _ { 2 } , { \pmb A } _ { 1 } ) \in { \pmb K } _ { I \times J } , \quad { \pmb L } _ { N } : = \frac { 1 } { 2 } \left\| ( { \pmb A } _ { 2 } ) _ { : , I } ( { \pmb A } _ { 1 } ) _ { I , : } { \pmb X } _ { : , J } - { \pmb Y } _ { : , J } \right\| _ { F } ^ { 2 } + \frac { 1 } { 2 } \left\| { \pmb Y } _ { : , J ^ { c } } \right\| _ { F } ^ { 2 } . } \end{array} +$$ + +Hence, within ${ \mathcal { K } } _ { I \times J }$ , $\mathcal { L } _ { N }$ reduces to the loss of a shallow linear network with parameters $( ( A _ { 2 } ) _ { : , I } , ( A _ { 1 } ) _ { I , : } )$ and input $\&$ output data pair $( X _ { : , J } , Y _ { : , J } )$ . Note that our results on shallow linear networks in Section 2 are applicable to all parameter dimensions and data matrices. Thus, Theorem 1 fully characterizes the forms of critical points of $\mathcal { L } _ { N }$ in ${ \mathcal { K } } _ { I \times J }$ . Moreover, the existence of such critical points can be analytically examined by substituting their forms into eq. (8). In summary, we obtain the following result, where we denote $\Sigma _ { J } : = Y _ { : , J } \bar { X } _ { : , J } ^ { \dag } X _ { : , J } Y _ { : , J } ^ { \top }$ with the full singular value decomposition $U _ { J } \mathbf { \Lambda } \mathbf { \Lambda } _ { J } U _ { J } ^ { \top } ,$ and suppose that $\Sigma _ { J }$ has $r ( J )$ distinct positive singular values $\sigma _ { 1 } ( J ) > \cdots > \sigma _ { r ( J ) } ( J )$ with multiplicities $m _ { 1 } , \ldots , m _ { r ( J ) }$ , respectively, and $\bar { m } ( J )$ zero singular values. + +Proposition 6 (Characterization of critical points). All critical points of $\mathcal { L } _ { N }$ in ${ \mathcal { K } } _ { I \times J }$ for any $I \subset$ $\{ 1 , \dots , d _ { 1 } \} , J \subset \{ 1 , \dots , m \}$ are necessarily and sufficiently characterized by an $\pmb { L } _ { 1 } \in \mathbb { R } ^ { | I | \times d _ { 0 } }$ , $a$ block matrix $V \in \mathbb { R } ^ { d _ { 2 } \times | I | }$ and an invertible matrix $C \in \mathbb { R } ^ { | I | \times | I | }$ such that + +$$ +\begin{array} { r l } & { ( A _ { 1 } ) _ { I , : } = C ^ { - 1 } V ^ { \top } U _ { J } ^ { \top } Y _ { : , J } X _ { : , J } ^ { \dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \top } V C L _ { 1 } X _ { : , J } X _ { : , J } ^ { \dagger } , } \\ & { ( A _ { 2 } ) _ { : , I } = U _ { J } V C . } \end{array} +$$ + +Specifically, $V = [ \mathrm { d i a g } ( V _ { 1 } , \ldots , V _ { r ( J ) } , \overline { { V } } ) , \mathbf { 0 } ^ { d _ { 2 } \times ( | I | - \mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) ) } ] ,$ , where $V _ { i } \in \mathbb { R } ^ { m _ { i } \times p _ { i } }$ , $\overline { { V } } \in$ $\begin{array} { r } { \sum _ { i = 1 } ^ { r ( J ) } p _ { i } + \bar { p } = \mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) } \end{array}$ $\mathbb { R } ^ { \bar { m } \times \bar { p } }$ consist of orthonormal columns with , and $L _ { 1 } , V , C$ $p _ { i } ~ \leq ~ m _ { i }$ satisfy for $i = 1 , \ldots , r ( J )$ , $\bar { p } ~ \leq ~ \bar { m }$ such that + +$$ +\mathscr { P } _ { \mathrm { c o l } ( U , V ) ^ { \perp } } \mathbf { Y } _ { : , J } \mathbf { X } _ { : , J } ^ { \top } \mathbf { L } _ { 1 } ^ { \top } C ^ { \top } \mathscr { P } _ { \mathrm { k e r } ( V ) } = \mathbf { 0 } . +$$ + +Moreover, a critical point in ${ \mathcal { K } } _ { I \times J }$ exists if and only if there exists such $C , V , L _ { 1 }$ that + +$$ +( A _ { 1 } ) _ { I , : } X _ { : , J } = C ^ { - 1 } V ^ { \top } U _ { J } ^ { \top } Y X _ { : , J } ^ { \dagger } X _ { : , J } + C ^ { - 1 } ( I - \mathcal { P } _ { \mathrm { k e r } ( V ) } ) C L _ { 1 } X _ { : , J } \geq 0 , +$$ + +To further illustrate, we consider a special case where the nonlinear network has one unit in the hidden layer, i.e., $d _ { 1 } = 1$ , in which case $A _ { 1 }$ and $A _ { 2 }$ are row and column vectors, respectively. Then, the entire parameter space can be partitioned into disjoint cones taking the form of ${ \mathcal { K } } _ { I \times J }$ , and $I = \{ 1 \}$ is the only nontrivial choice. We obtain the following result from Proposition 6. + +Proposition 7 (Characterization of critical points). Consider $\mathcal { L } _ { N }$ with $d _ { 1 } ~ = ~ 1$ and any $J \subset$ $\{ 1 , \ldots , m \}$ . Then, any nonzero critical point of $\mathcal { L } _ { N }$ within ${ \mathcal { K } } _ { \{ 1 \} \times J }$ can be necessarily and sufficiently characterized by an $\boldsymbol { \ell } _ { 1 } ^ { \top } \in \mathbb { R } ^ { 1 \times d _ { 0 } }$ , a block unit vector $\mathbf { v } \in \mathbb { R } ^ { d _ { 2 } \times 1 }$ and a scalar $c \in \mathbb { R }$ such that + +$$ +A _ { 1 } = c ^ { - 1 } \mathbf { v } ^ { \top } U _ { J } ^ { \top } Y _ { : , J } X _ { : , J } ^ { \dag } + \bar { \ell } _ { 1 } ^ { \top } - \bar { \ell } _ { 1 } ^ { \top } X _ { : , J } X _ { : , J } ^ { \dag } , \quad A _ { 2 } = c U _ { J } \mathbf { v } . +$$ + +Specifically, v is a unit vector that is supported on the entries corresponding to the same singular value of $\Sigma _ { J }$ . Moreover, a nonzero critical point in ${ \mathcal { K } } _ { \{ 1 \} \times J }$ exists if and only if there exist such $c , \mathbf { v } , \mathbf { \nabla } \theta _ { 1 } ^ { \top }$ that satisfy + +$$ +\begin{array} { r l } & { A _ { 1 } X _ { : , J } = c ^ { - 1 } \mathbf { v } ^ { \top } U _ { J } ^ { \top } Y _ { : , J } X _ { : , J } ^ { \dagger } X _ { : , J } \geq 0 , } \\ & { A _ { 1 } X _ { : , J ^ { c } } = c ^ { - 1 } \mathbf { v } ^ { \top } U _ { J } ^ { \top } Y _ { : , J } X _ { : , J } ^ { \dagger } X _ { : , J ^ { c } } + \bar { \ell } _ { 1 } ^ { \top } X _ { : , J ^ { c } } - \bar { \ell } _ { 1 } ^ { \top } X _ { : , J } X _ { : , J } ^ { \dagger } X _ { : , J ^ { c } } < 0 . } \end{array} +$$ + +We note that Proposition 7 characterizes both the existence and the forms of critical points of $\mathcal { L } _ { N }$ over the entire parameter space for nonlinear networks with a single hidden unit. The condition in eq. (12) is guaranteed because $\mathcal { P } _ { \ker ( \mathbf { v } ) } = \mathbf { 0 }$ for $\mathbf { v } \neq \mathbf { 0 }$ . + +To further understand Proposition 7, suppose that there exists a critical point in ${ \mathcal { K } } _ { \{ 1 \} \times J }$ with $\mathbf { v }$ being supported on the entries that correspond to the $i$ -th singular value of $\Sigma _ { J }$ . Then, Proposition 1 implies that $\begin{array} { r } { \mathcal { L } _ { N } = \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \frac { 1 } { 2 } \sigma _ { i } ( J ) } \end{array}$ . In particular, the critical point achieves the local minimum $\begin{array} { r } { \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \frac { 1 } { 2 } \sigma _ { 1 } \bar { ( \pmb { J } ) } } \end{array}$ in ${ \mathcal { K } } _ { \{ 1 \} \times J }$ with $i = 1$ . This is because in this case the critical point is full rank with an optimal order, and hence corresponds to the global minimum of the linear network in eq. (9). Since the singular values of $\Sigma _ { J }$ may vary with the choice of $J$ , $\mathcal { L } _ { N }$ may achieve different local minima in different cones. Thus, local minimum that is not global minimum can exist for $\mathcal { L } _ { N }$ . The following proposition concludes this fact by considering a concrete example. + +Proposition 8. For one-hidden-layer nonlinear neural networks with ReLU activation function, there exists local minimum that is not global minimum, and there also exists local maximum. + +The above proposition is demonstrated by the following example. + +Example 1. Consider the loss function $\mathcal { L } _ { N }$ of the nonlinear network with $d _ { 2 } = d _ { 0 } = 2$ , and $d _ { 1 } = 1$ The input and output data are set to be $X = \mathrm { d i a g } ( 1 , 1 ) , Y = \mathrm { d i a g } ( 2 , 1 )$ . + +First, consider the cone ${ \mathcal { K } } _ { I \times J }$ with $I = \{ 1 \} , J = \{ 1 \}$ . Calculation yields that $\Sigma _ { J } = \mathrm { d i a g } ( 4 , 0 )$ , and the conditions for existence of critical points in eqs. (16) and (17) hold if $2 c ^ { - 1 } ( \mathbf { v } ) _ { 1 , : } \geq 0 , ( \ell _ { 1 } ) _ { 2 , : } <$ 0. Then choosing $c = 1 , \mathbf { v } = ( 1 , 0 ) ^ { \top } , \ell _ { 1 } = ( 1 , - 1 ) ^ { \top }$ yields a local minimum in ${ \mathcal { K } } _ { I \times J }$ , because the nonzero entry in $\mathbf { v }$ corresponds to the largest singular value of $\Sigma _ { J }$ . Then, calculation shows that the local minimum achieves $\begin{array} { l } { { \mathcal { L } } _ { N } ~ = ~ \frac { 1 } { 2 } } \end{array}$ . On the other hand, consider the cone ${ \mathcal { K } } _ { I \times J ^ { \prime } }$ with $I = \{ 1 \} , J ^ { \prime } = \{ 2 \}$ , in which $\Sigma _ { J ^ { \prime } } = \mathrm { d i a } \mathbf { \bar { g } } ( 0 , 1 )$ . The conditions for existence of critical points in eqs. (16) and (17) hold if $c ^ { - 1 } ( \mathbf { v } ) _ { 1 , : } \geq 0 , ( \ell _ { 1 } ) _ { 1 , : } < 0$ . Similarly to the previous case, choosing $c = 1 , \mathbf { v } = ( 1 , 0 ) ^ { \top } , \ell _ { 1 } = ( - 1 , 0 ) ^ { \top }$ yields a local minimum that achieves the function value $\mathcal { L } _ { n } = 2$ . Hence, local minimum that is not global minimum does exist. Moreover, in the cone ${ { \cal { K } } _ { I \times J ^ { \prime \prime } } }$ with $I = \{ 1 \} , J ^ { \prime \prime } = \emptyset$ , the function $\mathcal { L } _ { N }$ remains to be the constant $\frac { 5 } { 2 }$ , and all points in this cone are local minimum or local maximum. Thus, the landscape of the loss function of nonlinear networks is very different from that of the loss function of linear networks. + +# CONCLUSION + +In this paper, we provide full characterization of the analytical forms of the critical points for the square loss function of three types of neural networks, namely, shallow linear networks, deep linear networks, and shallow ReLU nonlinear networks. We show that such analytical forms of the critical points have direct implications on the values of the corresponding loss functions, achievement of global minimum, and various landscape properties around these critical points. As a consequence, the loss function for linear networks has no spurious local minimum, while such point does exist for nonlinear networks with ReLU activation. In the future, it is interesting to further explore nonlinear neural networks. In particular, we wish to characterize the analytical form of critical points for deep nonlinear networks and over the full parameter space. Such results will further facilitate the understanding of the landscape properties around these critical points. + +# ACKNOWLEDGMENTS + +The work was supported in part by US National Science Foundation under the grants CCF-1761506, ECCS-1818904, and was supported in part by DARPA FunLoL program. + +REFERENCES +P. Baldi. Linear learning: Landscapes and algorithms. In Proc. Advances in Neural Information Processing Systems (NIPS), pp. 65–72. 1989. +P. Baldi and K. Hornik. Neural networks and principal component analysis: Learning from examples without local minima. Neural Networks, 2(1):53 – 58, 1989. +P. Baldi and Z. Lu. Complex-valued autoencoders. Neural Networks, 33:136–147, September 2012. +A. Choromanska, M. Henaff, M. Mathieu, G. Arous, and Y. LeCun. The loss surfaces of multilayer networks. Journal of Machine Learning Research, 38:192–204, 2015a. ISSN 1532-4435. +A. Choromanska, Y. LeCun, and G. Arous. Open problem: The landscape of the loss surfaces of multilayer networks. In Proc. Conference on Learning Theory (COLT), volume 40, pp. 1756– 1760, Jul 2015b. +Y. N. Dauphin, R. Pascanu, C. Gulcehre, K. Cho, S. Ganguli, and Y. Bengio. Identifying and attacking the saddle point problem in high-dimensional non-convex optimization. In Proc. Advances in Neural Information Processing Systems (NIPS). 2014. +S. Feizi, H. Javadi, J. Zhang, and D. Tse. Porcupine neural networks: (almost) all local optima are global. ArXiv: 1710.02196, October 2017. +C. D. Freeman and J. Bruna. Topology and geometry of half-rectified network optimization. Proc. International Conference on Learning Representations (ICLR), 2017. +I. Goodfellow, Y. Bengio, and A. Courville. Deep Learning. MIT Press, 2016. http://www. deeplearningbook.org. +M. Gori and A. Tesi. On the problem of local minima in backpropagation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(1):76–86, Jan 1992. +M. Hardt and T. Ma. Identity matters in deep learning. Proc. International Conference on Learning Representations (ICLR), 2017. +K. Kawaguchi. Deep learning without poor local minima. In Proc. Advances in Neural Information Processing Systems (NIPS), pp. 586–594. 2016. +S. Li, J. Jiao, Y. Han, and T. Weissman. Demystifying resnet. Arxiv: 1611.01186, 2016a. URL https://arxiv.org/pdf/1611.01186. +X. Li, Z. Wang, J. Lu, R. Arora, J. Haupt, H. Liu, and T. Zhao. Symmetry, saddle points, and global geometry of nonconvex matrix factorization. ArXiv: 1612.09296v2, December 2016b. +H. T. Lu and K. Kawaguchi. Depth creates no bad local minima. ArXiv: 1702.08580, February 2017. +Q. Nguyen and M. Hein. The loss surface of deep and wide neural networks. In Proc. International Conference on Machine Learning (ICML), volume 70, pp. 2603–2612, Aug 2017. +M. Soltanolkotabi, A. Javanmard, and J. D. Lee. Theoretical insights into the optimization landscape of over-parameterized shallow neural networks. ArXiv:1707.04926, 2017. +D. Soudry and Y. Carmon. No bad local minima: Data independent training error guarantees for multilayer neural networks. ArXiv: 1605.08361, May 2016. +D. Soudry and E. Hoffer. Exponentially vanishing sub-optimal local minima in multilayer neural networks. ArXiv:1702.05777, February 2017. +A. Taghvaei, J. W. Kim, and P. Mehta. How regularization affects the critical points in linear networks. In Proc. International Conference on Neural Information Processing Systems (NIPS), 2017. +Y. Tian. An analytical formula of population gradient for two-layered ReLU network and its applications in convergence and critical point analysis. In Proc. International Conference on Machine Learning (ICML), volume 70, pp. 3404–3413, 06–11 Aug 2017. +X. H. Yu and G. A. Chen. On the local minima free condition of backpropagation learning. IEEE Transactions on Neural Networks, 6(5):1300–1303, Sep 1995. +C. Yun, S. Sra, and A. Jadbabaie. Global optimality conditions for deep neural networks. ArXiv: 1707.02444, 2017. +C. Yun, S. Sra, and A. Jadbabaie. Global optimality conditions for deep neural networks. In Proc. International Conference on Learning Representations (ICLR), 2018. +K. Zhong, Z. Song, P. Jain, P. L. Bartlett, and I. S. Dhillon. Recovery guarantees for one-hidden-layer neural networks. In Proc. International Conference on Machine Learning (ICML), volume 70, pp. 4140–4149, Aug 2017. +Y. Zhou and Y. Liang. Characterization of gradient dominance and regularity conditions for neural networks. ArXiv: 1710.06910v2, October 2017. + +# Supplementary Materials + +PROOF OF THEOREM 1 + +Notations: For any matrix $M$ , denote $\mathrm { v e c } ( M )$ as the column vector formed by stacking its columns. Denote the Kronecker product as “ $\otimes ^ { \bullet }$ . Then, the following useful relationships hold for any dimension compatible matrices $M , U , V , W$ : + +$$ +\begin{array} { r l } & { \mathrm { v e c } ( U M V ) = ( V ^ { \top } \otimes U ) \mathrm { v e c } ( M ) , } \\ & { ( U \otimes V ) ^ { \dagger } = U ^ { \dagger } \otimes V ^ { \dagger } , } \\ & { ( M \otimes W ) ( U \otimes V ) = ( M U ) \otimes ( W V ) , } \\ & { ( M ^ { \top } M ) ^ { \dagger } M ^ { \top } = M ^ { \top } ( M M ^ { \top } ) ^ { \dagger } = M ^ { \dagger } , } \\ & { M M ^ { \dagger } M = M , M ^ { \dagger } M M ^ { \dagger } = M ^ { \dagger } . } \end{array} +$$ + +Recall that a point $( A _ { 1 } , A _ { 2 } )$ is a critical point of $\mathcal { L }$ if it satisfies + +$$ +\begin{array} { r } { \nabla _ { A _ { 1 } } \mathscr { L } = A _ { 2 } ^ { \top } ( A _ { 2 } A _ { 1 } \boldsymbol { X } - \boldsymbol { Y } ) \boldsymbol { X } ^ { \top } = \mathbf { 0 } , } \\ { \nabla _ { A _ { 2 } } \mathscr { L } = ( A _ { 2 } A _ { 1 } \boldsymbol { X } - \boldsymbol { Y } ) \boldsymbol { X } ^ { \top } A _ { 1 } ^ { \top } = \mathbf { 0 } . } \end{array} +$$ + +We first prove eqs. (1) and (2). + +Lemma 1. Let $\left( A _ { 2 } , A _ { 1 } \right)$ be a critical point of $\mathcal { L }$ . Then it must satisfy, for some $\pmb { L } _ { 1 } \in \mathbb { R } ^ { d _ { 1 } \times d _ { 0 } }$ , that + +$$ +\begin{array} { r l } & { A _ { 1 } = A _ { 2 } ^ { \dagger } Y X ^ { \dagger } + L _ { 1 } - A _ { 2 } ^ { \dagger } A _ { 2 } L _ { 1 } X X ^ { \dagger } , } \\ & { \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } \Sigma \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } = \Sigma \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } = \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } \Sigma . } \end{array} +$$ + +Proof of Lemma $^ { l }$ . Since $( A _ { 2 } , A _ { 1 } )$ is a critical point of $\mathcal { L }$ , eq. (23) implies that + +$$ +\begin{array} { r } { \pmb { A } _ { 2 } ^ { \top } \pmb { A } _ { 2 } \pmb { A } _ { 1 } \pmb { X } \pmb { X } ^ { \top } = \pmb { A } _ { 2 } ^ { \top } \pmb { Y } \pmb { X } ^ { \top } . } \end{array} +$$ + +Applying the vectorizing operator on both sides of the above equation and use the property in eq. (18), we conclude that + +$$ +( X X ^ { \top } \otimes A _ { 2 } ^ { \top } A _ { 2 } ) \mathrm { v e c } ( A _ { 1 } ) = ( X \otimes A _ { 2 } ^ { \top } ) \mathrm { v e c } ( Y ) . +$$ + +Since $\mathrm { v e c } ( A _ { 1 } )$ is a solution of the above linear equation, it must take the form of the solution of linear systems, i.e., for some $L _ { 1 } \in \mathbb { R } ^ { d _ { 1 } \times d _ { 0 } }$ , we have + +$$ +\begin{array} { r l } & { \mathrm { ~ \% c c } ( A _ { 1 } ) = ( X X ^ { \top } \otimes A _ { 2 } ^ { \top } A _ { 2 } ) ^ { \dagger } ( X \otimes A _ { 2 } ^ { \top } ) \mathrm { v e c } ( Y ) + [ I - ( X X ^ { \top } \otimes A _ { 2 } ^ { \top } A _ { 2 } ) ^ { \dagger } ( X X ^ { \top } \otimes A _ { 2 } ^ { \top } A _ { 2 } ) ] \mathrm { v e c } ( L _ { 1 } ) } \\ & { \overset { ( i ) } { = } \left( ( X X ^ { \top } ) ^ { \dagger } X \otimes ( A _ { 2 } ^ { \top } A _ { 2 } ) ^ { \dagger } A _ { 2 } ^ { \top } \right) \mathrm { v e c } ( Y ) + [ I - ( X X ^ { \top } ) ^ { \dagger } X X ^ { \top } \otimes ( A _ { 2 } ^ { \top } A _ { 2 } ) ^ { \dagger } A _ { 2 } ^ { \top } A _ { 2 } ] \mathrm { v e c } ( L _ { 1 } ) } \\ & { = \mathrm { v e c } \big ( ( A _ { 2 } ^ { \top } A _ { 2 } ) ^ { \dagger } A _ { 2 } ^ { \top } Y X ^ { \top } ( X X ^ { \top } ) ^ { \dagger } + L _ { 1 } - ( A _ { 2 } ^ { \top } A _ { 2 } ) ^ { \dagger } A _ { 2 } ^ { \top } A _ { 2 } L _ { 1 } X X X ^ { \top } ( X X ^ { \top } ) ^ { \dagger } \big ) } \\ & { \overset { ( i i ) } { = } \mathrm { v e c } \Big ( A _ { 2 } ^ { \dagger } Y X ^ { \dagger } + L _ { 1 } - A _ { 2 } ^ { \dagger } A _ { 2 } L _ { 1 } X X ^ { \dagger } \Big ) } \end{array} +$$ + +where (i) uses eqs. (19) and (20) and (ii) uses eq. (21). Then, eq. (25) follows by reshaping the vector into a matrix. + +Next we prove eq. (26). Multiplying both sides of eq. (25) by $A _ { 2 }$ on the left and by $\boldsymbol { X }$ on the right and then using eq. (22), we obtain + +$$ +A _ { 2 } A _ { 1 } X = A _ { 2 } A _ { 2 } ^ { \dagger } Y X ^ { \dagger } X = { \mathcal { P } } _ { \mathrm { c o l } ( A _ { 2 } ) } Y X ^ { \dagger } X . +$$ + +Also, multiplying both sides of eq. (24) by $A _ { 2 } ^ { \top }$ on the right yields that $A _ { \mathrm { 2 } } A _ { \mathrm { 1 } } X X ^ { \top } A _ { \mathrm { 1 } } ^ { \top } A _ { \mathrm { 2 } } ^ { \top } =$ $Y X ^ { \top } A _ { 1 } ^ { \top } A _ { 2 } ^ { \top }$ . This equation, together with the above expression of $\pmb { A } _ { 2 } \pmb { A } _ { 1 } \pmb { X }$ , further implies that + +$$ +\mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } \pmb { \Sigma } \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } = \pmb { \Sigma } \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } . +$$ + +Note that $\mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } \pmb { \Sigma } \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) }$ is symmetric. Thus, we conclude that $\Sigma \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } = \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } \Sigma$ . + +Next, we derive the form of $A _ { 2 }$ . Recall the full singular value decomposition $\pmb { \Sigma } = \pmb { U } \pmb { \Lambda } \pmb { U } ^ { \top }$ , where $\pmb { \Lambda }$ is a diagonal matrix with distinct singular values $\sigma _ { 1 } > . . . > \sigma _ { r } > 0$ and multiplicities $m _ { 1 } , \ldots , m _ { r }$ , respectively. We also assume that there are $\bar { m }$ number of zero singular values in $\pmb { \Lambda }$ . Using the fact that $\begin{array} { r } { \mathcal { P } _ { \mathrm { c o l } ( \dot { A } _ { 2 } ) } = U \mathcal { P } _ { \mathrm { c o l } ( U ^ { \top } A _ { 2 } ) } U ^ { \top } } \end{array}$ , the last equality in eq. (26) reduces to + +$$ +\begin{array} { r } { \mathbf { \Delta } \Lambda \mathcal { P } _ { \mathrm { c o l } ( U ^ { \top } \mathbf { A } _ { 2 } ) } = \mathcal { P } _ { \mathrm { c o l } ( U ^ { \top } \mathbf { A } _ { 2 } ) } \mathbf { \Lambda } . } \end{array} +$$ + +By the multiplicity pattern of the singular values in $\pmb { \Lambda }$ , $\mathcal { P } _ { \mathrm { c o l } ( \pmb { U } ^ { \top } \pmb { A } _ { 2 } ) }$ must be block diagonal. Specifically, we can write $\mathcal { P } _ { \mathrm { c o l } ( U ^ { \top } A _ { 2 } ) } = \mathrm { d i a g } ( \mathcal { P } _ { 1 } , \dots , \mathcal { P } _ { r } , \overline { { \mathcal { P } } } )$ , where $\mathcal { P } _ { i } \in \mathbb { R } ^ { m _ { i } \times m _ { i } }$ and $\overline { { \mathcal { P } } } \in \mathbb { R } ^ { \bar { n } \times \bar { m } }$ . Also, since $\mathcal { P } _ { \mathrm { c o l } ( \pmb { U } ^ { \top } \pmb { A } _ { 2 } ) }$ is a projection, $\mathcal { P } _ { 1 } , \ldots .$ , $\mathcal { P } _ { r }$ , $\overline { { \mathcal { P } } }$ must all be projections. Note that $\mathcal { P } _ { \mathrm { c o l } ( \pmb { U } ^ { \top } \pmb { A } _ { 2 } ) }$ has rank $\operatorname { r a n k } ( A _ { 2 } )$ , and suppose that $\mathcal { P } _ { 1 } , \ldots .$ , $\mathcal { P } _ { r }$ , $\overline { { \mathcal { P } } }$ have ranks $p _ { 1 } , \ldots , p _ { r } , \bar { p }$ , respectively. Then, we must have $p _ { i } \leq m _ { i }$ for $i = 1 , \dots , r$ , $\bar { p } \leq \bar { m }$ and ${ \textstyle \sum _ { i = 1 } ^ { r } p _ { i } + \bar { p } = \mathrm { r a n k } ( A _ { 2 } ) }$ . Also, note that each projection can be expressed as $\mathcal { P } _ { i } = V _ { i } V _ { i } ^ { \top }$ with $V _ { i } \in \mathbb { R } ^ { m _ { i } \times p _ { i } }$ , $\overline { { V } } \in \mathbb { R } ^ { \bar { n } \times \bar { p } }$ consisting of orthonormal columns. Hence, we can write $\mathcal { P } _ { \mathrm { c o l } ( U ^ { \top } A _ { 2 } ) } = \widehat { V } \widehat { V } ^ { \top }$ where $\widehat { V } = \mathrm { d i a g } ( V _ { 1 } , \ldots , V _ { r } , \overline { { V } } )$ . We then conclude that $\mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } = U \mathcal { P } _ { \mathrm { c o l } ( U ^ { \top } A _ { 2 } ) } U ^ { \top } = U \widehat { V } \widehat { V } ^ { \top } U ^ { \top }$ . Thus, $A _ { 2 }$ has the same column space as $\boldsymbol { U } \widehat { \boldsymbol { V } }$ , and there must exist an invertible matrix $C \in \mathbb { R } ^ { d _ { 1 } \times d _ { 1 } }$ such that ${ \cal A } _ { 2 } = U [ \widehat { V } , { \bf 0 } ] C$ , where $\mathbf { 0 } \in \mathbb { R } ^ { d _ { 2 } \times ( d _ { 1 } - \operatorname { r a n k } ( A _ { 2 } ) ) }$ is a zero matrix. Denoting $V = [ \widehat { V } , \mathbf { 0 } ]$ , we conclude that $A _ { 2 } = U V C$ . Then, plugging $\pmb { A } _ { 2 } ^ { \dagger } = \pmb { C } ^ { - 1 } \pmb { V } ^ { \top } \pmb { U } ^ { \top }$ into eq. (25) yields the desired form of $\pmb { A } _ { 1 }$ . + +We now prove eq. (3). Note that the above proof is based on the equations $\nabla _ { A _ { 1 } } \mathcal { L } = \mathbf { 0 }$ , $( \nabla _ { A _ { 2 } } \mathcal { L } ) A _ { 2 } ^ { \top } =$ 0. Hence, the forms of $A _ { 1 } , A _ { 2 }$ in eqs. (1) and (2) need to further satisfy $\nabla _ { A _ { 2 } } \mathcal { L } = \mathbf { 0 }$ . By eq. (27) and the form of $A _ { 2 }$ , we obtain that $A _ { 2 } A _ { 1 } { \cal X } = \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } { \cal Y } { \cal X } ^ { \dagger } { \cal X } = { \cal U } { \cal V } ( { \bar { U } } { \cal V } ) ^ { \top } { \cal Y } { \cal X } ^ { \dagger } { \cal X }$ . This expression, together with the form of $A _ { 1 }$ in eq. (1), implies that + +$$ +\begin{array} { r l } & { A _ { 2 } A _ { 1 } X X ^ { \top } A _ { 1 } ^ { \top } = U V ( U V ) ^ { \top } Y X ^ { \top } X X ^ { \top } A _ { 1 } ^ { \top } } \\ & { \overset { ( i ) } { = } U V ( U V ) ^ { \top } Y X ^ { \top } A _ { 1 } ^ { \top } } \\ & { \quad \quad = U V ( U V ) ^ { \top } \Sigma U V ( C ^ { \top } ) ^ { - 1 } + U V ( U V ) ^ { \top } Y X ^ { \top } L _ { 1 } ^ { \top } } \\ & { \quad \quad \quad - U V ( U V ) ^ { \top } Y X ^ { \top } L _ { 1 } ^ { \top } C ^ { \top } V ^ { \top } V ( C ^ { \top } ) ^ { - 1 } } \\ & { \quad \quad = U V V ^ { \top } \Lambda V ( C ^ { \top } ) ^ { - 1 } + U V ( U V ) ^ { \top } Y X ^ { \top } L _ { 1 } ^ { \top } ( I - C ^ { \top } V ^ { \top } V ( C ^ { \top } ) ^ { - 1 } ) } \\ & { \overset { ( i i ) } { = } U \Lambda V ( C ^ { \top } ) ^ { - 1 } + U V ( U V ) ^ { \top } Y X ^ { \top } L _ { 1 } ^ { \top } ( I - C ^ { \top } V ^ { \top } V ( C ^ { \top } ) ^ { - 1 } ) , } \end{array} +$$ + +where (i) uses the fact that $X ^ { \dag } X X ^ { \dag } = X ^ { \dag }$ , (ii) uses the fact that the block pattern of $V$ is compatible with the multiplicity pattern of the singular values in $\pmb { \Lambda }$ , and hence $V \mathbf { \hat { V } } ^ { \top } \mathbf { A } V = \mathbf { A } V$ . On the other hand, we also obtain that + +$$ +\begin{array} { r } { Y X ^ { \top } A _ { 1 } ^ { \top } = \Sigma U V ( C ^ { \top } ) ^ { - 1 } + Y X ^ { \top } L _ { 1 } ^ { \top } ( I - C ^ { \top } V ^ { \top } V ( C ^ { \top } ) ^ { - 1 } ) } \\ { = U \Lambda V ( C ^ { \top } ) ^ { - 1 } + Y X ^ { \top } L _ { 1 } ^ { \top } ( I - C ^ { \top } V ^ { \top } V ( C ^ { \top } ) ^ { - 1 } ) . } \end{array} +$$ + +Thus, to satisfy $\nabla _ { A _ { 2 } } \mathcal { L } = \mathbf { 0 }$ in eq. (24), we require that + +$$ +\begin{array} { r } { ( I - U V ( U V ) ^ { \top } ) Y X ^ { \top } L _ { 1 } ^ { \top } ( I - C ^ { \top } V ^ { \top } V ( C ^ { \top } ) ^ { - 1 } ) = \mathbf { 0 } , } \end{array} +$$ + +which is equivalent to + +$$ +\begin{array} { r } { ( I - U V ( U V ) ^ { \top } ) Y X ^ { \top } L _ { 1 } ^ { \top } C ^ { \top } ( I - V ^ { \top } V ) = \mathbf { 0 } . } \end{array} +$$ + +Lastly, note that $( I - U V ( U V ) ^ { \top } ) = \mathcal { P } _ { \mathrm { c o l } ( U V ) ^ { \perp } }$ , and $( I - V ^ { \top } V ) = { \mathcal P } _ { \ker ( V ) }$ , which concludes the proof. + +# PROOF OF PROPOSITION 1 + +By expansion we obtain that $\begin{array} { r } { \mathcal { L } = \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \mathrm { T r } ( A _ { 2 } \pmb { A } _ { 1 } \pmb { X } \pmb { Y } ^ { \top } ) + \frac { 1 } { 2 } \mathrm { T r } ( A _ { 2 } \pmb { A } _ { 1 } \pmb { X } \pmb { X } ^ { \top } \pmb { A } _ { 1 } ^ { \top } \pmb { A } _ { 2 } ^ { \top } ) } \end{array}$ . Consider any $( A _ { 1 } , A _ { 2 } )$ that satisfies eq. (23), we have shown that such a point also satisfies eq. (27), + +which further yields that + +$$ +\begin{array} { r l } & { \mathcal { L } = \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \mathrm { T r } ( \pmb { A } _ { 2 } \pmb { A } _ { 1 } \pmb { X } \pmb { Y } ^ { \top } ) + \frac { 1 } { 2 } \mathrm { T r } ( \pmb { A } _ { 2 } \pmb { A } _ { 1 } \pmb { X } \pmb { X } ^ { \top } \pmb { A } _ { 1 } ^ { \top } \pmb { A } _ { 2 } ^ { \top } ) } \\ & { \quad = \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \mathrm { T r } ( \mathcal { P } _ { \mathrm { c o l } ( \pmb { A } _ { 2 } ) } \pmb { \Sigma } ) + \frac { 1 } { 2 } \mathrm { T r } \big ( \mathcal { P } _ { \mathrm { c o l } ( \pmb { A } _ { 2 } ) } \pmb { \Sigma } \mathcal { P } _ { \mathrm { c o l } ( \pmb { A } _ { 2 } ) } \big ) } \\ & { \overset { ( i ) } { = } \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } \big ( \mathcal { P } _ { \mathrm { c o l } ( \pmb { A } _ { 2 } ) } \pmb { \Sigma } ) } \\ & { \overset { ( i i ) } { = } \frac { 1 } { 2 } \mathrm { T r } \big ( \pmb { Y } \pmb { Y } ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } \big ( \mathcal { P } _ { \mathrm { c o l } ( \pmb { U } ^ { \top } \pmb { A } _ { 2 } ) } \pmb { \Lambda } \big ) } \end{array} +$$ + +where (i) follows from the fact that $\mathrm { T r } \big ( \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } \Sigma \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } \big ) = \mathrm { T r } \big ( \mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) } \Sigma \big )$ , and (ii) uses the fact that $\mathcal { P } _ { \mathrm { c o l } ( A _ { 2 } ) _ { \perp } } = U \mathcal { P } _ { \mathrm { c o l } ( U ^ { \top } A _ { 2 } ) } U ^ { \top }$ . In particular, a critical point $( A _ { 1 } , A _ { 2 } )$ satisfies eq. (28). Moreover, using the form of the critical point $\mathbf { \delta } _ { A _ { 2 } } = U V C$ , eq. (28) further becomes + +$$ +\begin{array} { r l } & { \mathcal { L } = \frac { 1 } { 2 } \mathrm { T r } ( Y Y ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } \big ( \mathcal { P } _ { \mathrm { c o l } ( V C ) } \mathbf { \Lambda } \big ) } \\ & { \quad \overset { ( i ) } { = } \frac { 1 } { 2 } \mathrm { T r } ( Y Y ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } \big ( V ^ { \top } \mathbf { \Lambda } \mathbf { \Lambda } V \big ) } \\ & { \quad \overset { ( i i ) } { = } \frac { 1 } { 2 } \mathrm { T r } ( Y Y ^ { \top } ) - \frac { 1 } { 2 } \displaystyle \sum _ { i = 1 } ^ { r } p _ { i } \sigma _ { i } , } \end{array} +$$ + +where (i) is due to $\mathcal { P } _ { \mathrm { c o l } ( V C ) } = \mathcal { P } _ { \mathrm { c o l } ( V ) } = V V ^ { \top }$ , and (ii) utilizes the block pattern of $V$ and the multiplicity pattern of $\pmb { \Lambda }$ that are specified in Theorem 1. + +# PROOF OF PROPOSITION 2 + +(1): Consider a critical point $( A _ { 1 } , A _ { 2 } )$ with the forms given by Theorem 1. By choosing $\mathbf { L } _ { 1 } = \mathbf { 0 }$ , the condition in eq. (3) is guaranteed. Then, we can specify a critical point with any $V$ that satisfies the block pattern specified in Theorem 1, i.e., we can choose any $p _ { i } , i \ = \ 1 , . . . , r , \bar { p }$ such that $p _ { i } \ \leq \ m _ { i }$ for $i = 1 , \ldots , r , \bar { p } \leq \bar { m }$ and $\textstyle \sum _ { i = 1 } ^ { r } p _ { i } + { \bar { p } } = \operatorname { r a n k } ( A _ { 2 } )$ . Suppose that $( A _ { 1 } , A _ { 2 } )$ is a global minimizer, Proposition 1 gives that $\begin{array} { r } { \dot { \mathcal { L } } ( \bar { \boldsymbol { A } } _ { 1 } , \boldsymbol { A } _ { 2 } ) = \frac { 1 } { 2 } \mathrm { T r } ( \boldsymbol { Y } \boldsymbol { Y } ^ { \top } ) - \frac { 1 } { 2 } \sum _ { i = 1 } ^ { r } p _ { i } \sigma _ { i } } \end{array}$ . Under the condition that $\begin{array} { r } { \operatorname* { m i n } \{ d _ { 2 } , d _ { 1 } \} \le \sum _ { i = 1 } ^ { r } m _ { i } } \end{array}$ , the global minimum value is achieved by a full rank $A _ { 2 }$ with $\mathrm { r a n k } ( A _ { 2 } ) = \mathrm { m i n } \{ d _ { 2 } , d _ { 1 } \}$ and $\begin{array} { r } { p _ { 1 } = m _ { 1 } , \dotsc , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = \operatorname { r a n k } ( A _ { 2 } ) - \sum _ { i = 1 } ^ { k - 1 } m _ { i } \leq } \end{array}$ $m _ { k }$ for some $k \leq r$ . That is, the singular values are selected in a decreasing order to minimize the function value. + +(2): If achieve $\left( A _ { 2 } , A _ { 1 } \right)$ is aosing inimizefor all $\begin{array} { r } { \operatorname* { m i n } \{ d _ { y } , d \} > \sum _ { i = 1 } ^ { r } m _ { i } } \end{array}$ , the global minimum can berticular, we do not need a full $p _ { i } = m _ { i }$ $i = 1 , \ldots , r$ $\bar { p } \geq 0$ +rank $A _ { 2 }$ to achieve the global minimum. For example, we can choose $\begin{array} { r } { \operatorname { r a n k } ( A _ { 2 } ) = \sum _ { i = 1 } ^ { r } m _ { i } < } \end{array}$ +$\operatorname* { m i n } \{ d _ { y } , d \}$ with $p _ { i } = m _ { i }$ for all $i = 1 , \dots , r$ and $\bar { p } = 0$ . + +# PROOF OF PROPOSITION 3 + +We first prove item 1. Consider a non-optimal-order critical point $( A _ { 1 } , A _ { 2 } )$ . By Theorem 1, we can write $A _ { \mathrm { 2 } } = U V C$ where $V = [ \mathrm { d i a g } ( V _ { 1 } , \ldots , V _ { r } , \overline { { V } } ) , { \bf 0 } ]$ and $V _ { i } , i = 1 , \dots , r , \overline { { V } }$ consist of orthonormal columns. Define the orthonormal block diagonal matrix + +$$ +\pmb { S } ^ { \top } : = \operatorname { d i a g } \left( \begin{array} { l } { \left[ \pmb { V } _ { 1 } ^ { \top } \right] , \cdots , \left[ \pmb { V } _ { r } ^ { \top } \right] , } \\ { \left[ \pmb { O } _ { 1 } ^ { \top } \right] } \end{array} \left[ \begin{array} { l } { \pmb { \overline { { V } } } ^ { \top } } \\ { \pmb { \overline { { O } } } _ { r } ^ { \top } } \end{array} \right] , \right) , +$$ + +where the matrices $O _ { 1 } , \cdots , O _ { r } , \overline { { { O } } }$ are such that each diagonal block forms an orthonormal submatrix. By construction we have $\bar { \pmb { S } } ^ { \top } \pmb { V } = [ \mathrm { d i a g } ( \pmb { I } ^ { m _ { 1 } \times p _ { 1 } } , \allowbreak \bar { \lambda } . . . , \pmb { I } ^ { m _ { r } \times p _ { r } } , \pmb { I } ^ { \bar { m } \times \bar { p } } ) , \mathbf { 0 } ]$ , where ${ \cal { I } } ^ { m _ { k } \times p _ { k } }$ corresponds to the first $p _ { k }$ columns of the identity matrix $I ^ { m _ { k } \times m _ { k } }$ . Then, $A _ { 2 }$ can be alternatively written as $\begin{array} { r } { \pmb { A } _ { 2 } = \pmb { U } \pmb { S } \pmb { S } ^ { \top } \pmb { V } \pmb { C } , } \end{array}$ . Also, denote the columns of ${ \pmb U } { \pmb S }$ as + +$$ +U S = [ \mathbf { u } _ { 1 1 } ^ { s } , \ldots , \mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \ldots , \mathbf { u } _ { r 1 } ^ { s } , \ldots , \mathbf { u } _ { r p _ { r } } ^ { s } , \bar { \mathbf { u } } _ { 1 } ^ { s } , \ldots , \bar { \mathbf { u } } _ { \bar { p } } ^ { s } ] . +$$ + +Since $( A _ { 1 } , A _ { 2 } )$ is a non-optimal-order critical point, there exists $1 \leq i < j \leq r$ such that $p _ { i } < m _ { i }$ and $p _ { j } > 0$ . Then, consider the following perturbation of ${ \boldsymbol { U } } { \boldsymbol { S } }$ for some $\epsilon > 0$ . + +$$ +\widetilde { M } = \left[ \mathbf { u } _ { 1 1 } ^ { s } , \ldots , \mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \ldots , \frac { \mathbf { u } _ { j 1 } ^ { s } + \epsilon \mathbf { u } _ { i ( p _ { i } + 1 ) } ^ { s } } { \sqrt { 1 + \epsilon ^ { 2 } } } , \ldots \bar { \mathbf { u } } _ { 1 } ^ { s } , \ldots , \bar { \mathbf { u } } _ { \bar { p } } ^ { s } \right] , +$$ + +with which we further define the perturbation matrix ${ \widetilde A } _ { \mathrm { 2 } } ~ = ~ { \widetilde M } S ^ { \intercal } V C$ . Also, let the perturbation matrix $\widetilde { A } _ { 1 }$ be generated by eq. (1) with $\smash { U \gets \widetilde { M } }$ and $V S ^ { \top } V$ . Note that with this construction, $( \widetilde { A } _ { 1 } , \widetilde { A } _ { 2 } )$ satisfies eq. (25), which further implies eq. (27) for $( \widetilde { A } _ { 1 } , \widetilde { A } _ { 2 } )$ , i.e., $\widetilde { A } _ { 2 } \widetilde { A } _ { 1 } X = \mathcal { P } _ { \mathrm { c o l } ( \widetilde { A } _ { 2 } ) } Y X ^ { \dagger } X$ . Thus, eq. (28) holds for the point $( \widetilde { A } _ { 1 } , \widetilde { A } _ { 2 } )$ , and we obtain that + +$$ +\begin{array} { r l } & { \mathcal { L } ( \tilde { A } _ { 2 } , \tilde { A } _ { 1 } ) = \frac { 1 } { 2 } \mathrm { T r } ( Y Y ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } ( \mathcal { P } _ { \mathrm { c o l } ( U ^ { \top } \tilde { A } _ { 2 } ) } \Lambda ) } \\ & { \quad \quad \quad \quad \quad = \frac { 1 } { 2 } \mathrm { T r } ( Y Y ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } ( \mathcal { P } _ { \mathrm { c o l } ( S ^ { \top } U ^ { \top } \tilde { A } _ { 2 } ) } S ^ { \top } \Lambda S ) } \\ & { \quad \quad \quad \quad = \frac { 1 } { 2 } \mathrm { T r } ( Y Y ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } ( \mathcal { P } _ { \mathrm { c o l } ( S ^ { \top } U ^ { \top } \widetilde { M } S ^ { \top } V ) } S ^ { \top } \Lambda S ) } \\ & { \quad \quad \quad \quad = \frac { 1 } { 2 } \mathrm { T r } ( Y Y ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } ( \mathcal { P } _ { \mathrm { c o l } ( S ^ { \top } U ^ { \top } \widetilde { M } S ^ { \top } V ) } \Lambda ) , } \end{array} +$$ + +where the last equality uses the fact that ${ \cal S } ^ { \top } \pmb { { \Lambda } } { \cal S } = \pmb { { \Lambda } }$ , as can be observed from the block pattern of $\pmb { S }$ and the multiplicity pattern of $\pmb { \Lambda }$ . Also, by the construction of $\widetilde { M }$ and the form of $S ^ { \top } V$ , a careful calculation shows that only the $i , j$ -th diagonal elements of $\mathcal { P } _ { \mathrm { c o l } ( S ^ { \top } U ^ { \top } \widetilde { M } S ^ { \top } V ) }$ have changed, i.e., + +$$ +\left[ \mathcal { P } _ { \mathrm { c o l } ( S ^ { \top } U ^ { \top } \widetilde { M } S ^ { \top } V ) } \right] _ { k } = \left\{ \begin{array} { l l } { \frac { \epsilon ^ { 2 } } { 1 + \epsilon ^ { 2 } } , } & { \mathrm { i f ~ } k = i } \\ { \frac { 1 } { 1 + \epsilon ^ { 2 } } , } & { \mathrm { i f ~ } k = j } \end{array} \right. +$$ + +As the index $i , j$ correspond to the singular values $\sigma _ { i } , \sigma _ { j }$ , respectively, and $\sigma _ { i } > \sigma _ { j }$ , one obtain that + +$$ +\begin{array} { r } { \mathcal { L } ( \widetilde { A } _ { 2 } , \widetilde { A } _ { 1 } ) = \mathcal { L } ( A _ { 2 } , A _ { 1 } ) - \frac { \epsilon ^ { 2 } } { 1 + \epsilon ^ { 2 } } ( \sigma _ { i } - \sigma _ { j } ) < \mathcal { L } ( A _ { 2 } , A _ { 1 } ) . } \end{array} +$$ + +Thus, the construction of the point $( \widetilde { A } _ { 2 } , \widetilde { A } _ { 1 } )$ achieves a lower function value for any $\epsilon > 0$ . Letting $\epsilon 0$ and noticing that $\widetilde { M }$ is a perturbation of $_ { U S }$ , the point $( \widetilde { A } _ { 2 } , \widetilde { A } _ { 1 } )$ can be in an arbitrary neighborhood of $( A _ { 2 } , A _ { 1 } )$ . Lastly, note that $\mathrm { r a n k } ( \widetilde { A } _ { 2 } ) = \mathrm { r a n k } ( A _ { 2 } )$ . This completes the proof of item 1. + +Next, we prove item 2. Consider an optimal-order critical point $( A _ { 1 } , A _ { 2 } )$ . Then, $A _ { 2 }$ must be non-full rank, since otherwise a full rank $A _ { 2 }$ with optimal order corresponds to a global minimizer ts some e necess. Using t $k \leq r$ suchm of ressio t q $p _ { 1 } = m _ { 1 } , \ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =$ $\mathrm { r a n k } ( A _ { 2 } ) - \textstyle \sum _ { i = 1 } ^ { k - 1 } m _ { i } \ \leq \ m _ { k }$ $A _ { 2 }$ $\mathbf { \nabla } A _ { 2 } \ = \ U V C$ $V =$ $[ \mathrm { d i a g } ( V _ { 1 } , \dots , V _ { k } ) , \mathbf { 0 } ] : = [ V _ { \mathrm { d i a g } } , \mathbf { 0 } ]$ + +$$ +\begin{array} { r } { \pmb { A } _ { 1 } = C ^ { - 1 } \Bigg ( [ { \pmb { U } } _ { \mathbf { \mathscr { C } } _ { \mathbf { i } \mathrm { i } \mathbf { a } _ { \mathbf { g } } } } ] ^ { \top } { \pmb { Y } } { \pmb { X } } ^ { \dagger } ] + C \pmb { L } _ { 1 } - [ ( C \pmb { L } _ { 1 } ) _ { 1 : \operatorname { r a n k } ( { \pmb { A } } _ { 2 } ) , : } { \pmb { X } } { \pmb { X } } ^ { \dagger } ] \Bigg ) . } \end{array} +$$ + +We now specify our perturbation scheme. Recalling the orthonormal matrix $_ { s }$ defined in eq. (29). Then, we consider the following matrices for some $\epsilon _ { 1 } , \epsilon _ { 2 } > 0$ + +$$ +\begin{array} { r l } & { \widetilde { A } _ { 2 } = \displaystyle [ U V _ { \mathrm { d i a g } } , \epsilon _ { 2 } U S _ { : , q } , 0 ] C , \mathrm { ~ w h e r e ~ } q = \sum _ { i = 1 } ^ { k - 1 } m _ { i } + p _ { k } + 1 , } \\ & { \widetilde { A } _ { 1 } = C ^ { - 1 } \bigg ( \left[ \begin{array} { c } { ( U V _ { \mathrm { d i a g } } ) ^ { \top } Y X ^ { \dag } } \\ { 0 } \end{array} \right] + C L _ { 1 } - \left[ \begin{array} { c } { ( C L _ { 1 } ) _ { \mathrm { 1 : r a n k } ( A _ { 2 } ) , : } X X ^ { \dag } } \\ { \epsilon _ { 1 } ( U S _ { : , q } ) ^ { \top } Y X ^ { \dag } } \\ { 0 } \end{array} \right] \bigg ) . } \end{array} +$$ + +Our goal is to show that $\mathcal { L } ( \widetilde { A } _ { 1 } , \widetilde { A } _ { 2 } ) < \mathcal { L } ( A _ { 1 } , A _ { 2 } )$ for $\epsilon _ { 1 } , \epsilon _ { 2 } 0$ . For this purpose, we need to utilize the condition of critical points in eq. (3), which can be equivalently expressed as + +$$ +\begin{array} { r l } & { ( I - U V ( U V ) ^ { \top } ) Y X ^ { \top } L _ { 1 } ^ { \top } C ^ { \top } ( I - V ^ { \top } V ) = 0 } \\ { \stackrel { ( i ) } { \Leftrightarrow } } & { \left[ ( C L _ { 1 } ) _ { \mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X \right] Y ^ { \top } ( I - U V ( U V ) ^ { \top } ) = 0 } \\ { \Leftrightarrow } & { ( C L _ { 1 } ) _ { \mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \top } ( I - U V ( U V ) ^ { \top } ) = 0 } \\ { \stackrel { ( i i ) } { \Leftrightarrow } } & { ( C L _ { 1 } ) _ { \mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \top } ( I - U S _ { : , 1 : ( q - 1 ) } ( U S _ { : , 1 : ( q - 1 ) } ) ^ { \top } ) = 0 } \end{array} +$$ + +where (i) follows by taking the transpose and then simplifying, and (ii) uses the fact that $V =$ $S S ^ { \top } V ~ = ~ S _ { : , 1 : ( q - 1 ) }$ in the case of optimal-order critical point. Calculating the function value at $( \widetilde { A } _ { 1 } , \widetilde { A } _ { 2 } )$ , we obtain that + +$$ +\begin{array} { r l } & { \mathcal { L } ( \widetilde { A } _ { 1 } , \widetilde { A } _ { 2 } ) = \frac { 1 } { 2 } \| \underbrace { U V _ { \mathrm { d i a g } } ( U V _ { \mathrm { d i a g } } ) ^ { \top } Y X ^ { \dag } X } _ { Q } } \\ & { \quad \quad \quad + \underbrace { \epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { \mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X + \epsilon _ { 1 } \epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \top } Y X ^ { \dag } X } _ { P } - Y \| _ { F } ^ { 2 } } \\ & { \quad \quad \quad = \mathcal { L } ( A _ { 1 } , A _ { 2 } ) + \frac { 1 } { 2 } [ \mathrm { T r } ( P P ^ { \top } ) + 2 \mathrm { T r } ( P Q ^ { \top } ) - 2 \mathrm { T r } ( P Y ^ { \top } ) ] . } \end{array} +$$ + +We next simplify the above three trace terms using eq. (31). For the first trace term, observe that + +$$ +\begin{array} { r l } & { \mathrm { T r } ( P P ^ { \top } ) = \mathrm { T r } ( \epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \top } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \top } ( U S _ { : , q } ) ^ { \top } ) } \\ & { \phantom { = } + 2 \mathrm { T r } ( \epsilon _ { 1 } \epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \top } U S _ { : , q } ( U S _ { : , q } ) ^ { \top } ) } \\ & { \phantom { = \ } + \mathrm { T r } ( \epsilon _ { 1 } ^ { 2 } \epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \top } \Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \top } ) } \\ & { \overset { ( i ) } { = } \mathrm { T r } ( \epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \top } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \top } ( U S _ { : , q } ) ^ { \top } ) } \\ & { \phantom { = \ } + \mathrm { T r } ( \epsilon _ { 1 } ^ { 2 } \epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \top } \Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \top } ) } \\ & { \phantom { = \ } = \epsilon _ { 2 } ^ { 2 } \mathrm { T r } ( ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \top } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , ) } ^ { \top } + \epsilon _ { 1 } ^ { 2 } \epsilon _ { 2 } ^ { 2 } \mathrm { T r } ( S _ { : , q } ^ { \top } \Lambda S _ { : , q } ) } \end{array} +$$ + +where (i) follows from eq. (31) as $S _ { : , q }$ is orthogonal to the columns of $S _ { : , 1 : ( q - 1 ) }$ . For the second trace term, we obtain that + +$$ +\begin{array} { r l } { 2 \mathrm { T r } ( P Q ^ { \top } ) = 2 \mathrm { T r } ( \epsilon _ { 2 } U S _ { \cdot , q } ( C L _ { 1 } ) _ { \mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \top } U V _ { \mathrm { d i a g } } ( U V _ { \mathrm { d i a g } } ) ^ { \top } ) } & { } \\ & { \phantom { = } + 2 \mathrm { T r } ( \epsilon _ { 1 } \epsilon _ { 2 } U S _ { \cdot , q } ( U S _ { \cdot , q } ) ^ { \top } \Sigma U V _ { \mathrm { d i a g } } ( U V _ { \mathrm { d i a g } } ) ^ { \top } ) } \\ & { = 2 \mathrm { T r } ( \epsilon _ { 2 } U S _ { \cdot , q } ( C L _ { 1 } ) _ { \mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \top } U V _ { \mathrm { d i a g } } ( U V _ { \mathrm { d i a g } } ) ^ { \top } ) } \\ & { \phantom { = } + 2 \mathrm { T r } ( \epsilon _ { 1 } \epsilon _ { 2 } U S _ { \cdot , q } S _ { \cdot , q } ^ { \top } \Lambda S S ^ { \top } V _ { \mathrm { d i a g } } ( U V _ { \mathrm { d i a g } } ) ^ { \top } ) } \\ & { \stackrel { ( i ) } { = } 2 \mathrm { T r } ( \epsilon _ { 2 } U S _ { \cdot , q } ( C L _ { 1 } ) _ { \mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \top } U V _ { \mathrm { d i a g } } ( U V _ { \mathrm { d i a g } } ) ^ { \top } ) } \\ & { \phantom { = } + 2 \mathrm { T r } ( \epsilon _ { 1 } \epsilon _ { 2 } \sigma _ { k } U S _ { \cdot , q } \mathrm { e } _ { 2 } ^ { \top } S ^ { \top } V _ { \mathrm { d i a g } } ( U V _ { \mathrm { d i a g } } ) ^ { \top } ) } \\ & { \phantom { = } \frac { ( i i i ) } { = } 2 \mathrm { T r } ( \epsilon _ { 2 } U S _ { \cdot , q } ( C L _ { 1 } ) _ { \mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \top } U V _ { \mathrm { d i a g } } ( U V _ { \mathrm { d i a g } } ) ^ { \top } ) } \\ & \phantom { = } + 2 \mathrm { T r } ( \epsilon _ { 2 } U S _ { \cdot , q } \mathrm { e } _ { 2 } ^ { \top } S ^ { \top } V _ { \mathrm { d i a g } } ( U V _ \end{array} +$$ + +where (i) follows from $\bar { S } _ { : , q } ^ { \top } \Lambda S = \sigma _ { k } \mathbf { e } _ { q } ^ { \top } ,$ and (ii) follows from $\mathbf { e } _ { q } ^ { \top } S ^ { \top } V _ { \mathrm { d i a g } } = \mathbf { 0 }$ . For the third trace term, we obtain that + +$$ +\begin{array} { r l } & { 2 \mathrm { T r } ( P Y ^ { \top } ) = 2 \mathrm { T r } ( \epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \top } ) + 2 \mathrm { T r } ( \epsilon _ { 1 } \epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \top } \Sigma ) } \\ & { \qquad = 2 \mathrm { T r } ( \epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \top } ) + 2 \mathrm { T r } ( \epsilon _ { 1 } \epsilon _ { 2 } S _ { : , q } ^ { \top } \Lambda S _ { : , q } ) . } \end{array} +$$ + +Combining the expressions for the three trace terms above, we conclude that + +$$ +\begin{array} { r l } & { \frac { 1 } { 2 } [ \mathrm { T r } ( P P ^ { \top } ) + 2 \mathrm { T r } ( P Q ^ { \top } ) - 2 \mathrm { T r } ( P Y ^ { \top } ) ] } \\ & { \qquad = \frac { 1 } { 2 } \epsilon _ { 2 } ^ { 2 } \mathrm { T r } ( ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . . } X X ^ { \top } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \top } ) } \\ & { \qquad + \left( \frac { 1 } { 2 } \epsilon _ { 1 } ^ { 2 } \epsilon _ { 2 } ^ { 2 } - \epsilon _ { 1 } \epsilon _ { 2 } ) \mathrm { T r } ( S _ { \cdot , q } ^ { \top } \Lambda S _ { \cdot , q } ) \right. } \\ & { \qquad + \left. 2 \epsilon _ { 2 } \mathrm { T r } ( U S _ { \cdot , q } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X Y ^ { \top } [ U V _ { \mathrm { d i a g } } ( U V _ { \mathrm { d i a g } } ) ^ { \top } - I ] ) \right. } \\ & { \qquad \overset { ( i ) } { = } \frac { 1 } { 2 } \epsilon _ { 2 } ^ { 2 } \mathrm { T r } ( ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \top } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \top } ) } \\ & { \qquad + \left( \frac { 1 } { 2 } \epsilon _ { 1 } ^ { 2 } \epsilon _ { 2 } ^ { 2 } - \epsilon _ { 1 } \epsilon _ { 2 } \right) \mathrm { T r } ( S _ { \cdot , q } ^ { \top } \Lambda S _ { \cdot , q } ) } \\ & { \qquad = \frac { 1 } { 2 } \epsilon _ { 2 } ^ { 2 } \mathrm { T r } ( ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \top } ( C L _ { 1 } ) _ { ( \mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \top } ) + ( \frac { 1 } { 2 } \epsilon _ { 1 } ^ { 2 } \epsilon _ { 2 } ^ { 2 } - \epsilon _ { 1 } \epsilon _ { 2 } ) \sigma _ { k } , } \end{array} +$$ + +where (i) follows from eq. (30). Note that the first term in the last equation is nonnegative. Now, letting $\epsilon _ { 2 } = \epsilon _ { 1 } ^ { 2 } 0$ , the overall perturbation of the function value becomes + +$$ +\scriptstyle \frac { 1 } { 2 } [ \mathrm { T r } ( P P ^ { \top } ) + 2 \mathrm { T r } ( P Q ^ { \top } ) - 2 \mathrm { T r } ( P Y ^ { \top } ) ] = { \mathcal { O } } ( \epsilon _ { 1 } ^ { 4 } ) - { \mathcal { O } } ( \epsilon _ { 1 } ^ { 3 } ) < 0 . +$$ + +Thus, the constructed perturbation $( \widetilde { A } _ { 1 } , \widetilde { A } _ { 2 } )$ achieves a lower function value, and it can be in an arbitrary neighborhood of $( A _ { 1 } , A _ { 2 } )$ as $\epsilon _ { 2 } = \epsilon _ { 1 } ^ { 2 } 0$ . Lastly, note that $\mathrm { r a n k } ( \widetilde { A } _ { 2 } ) = \mathrm { r a n k } ( A _ { 2 } ) + 1$ . Next, we prove item 3. We first introduce a technical lemma. Consider row vectors $\mathbf { a } ^ { \top } , \mathbf { y } ^ { \top }$ with $\mathbf { a } ^ { \intercal } \neq \mathbf { 0 }$ . Define the scalar function $\begin{array} { r } { f ( \alpha ) = \frac { 1 } { 2 } \left\| \alpha \mathbf { a } ^ { \top } - \mathbf { y } ^ { \top } \right\| _ { 2 } ^ { 2 } } \end{array}$ . Then, $f ( \alpha )$ is strongly convex as $f ^ { \prime \prime } ( \alpha ) = \left\| \mathbf { a } \right\| _ { 2 } ^ { 2 } > 0 .$ Thus, the following fact holds due to strong convexity. + +Fact 1. For any $\alpha \in \mathbb { R }$ , we can identify a perturbation $\widetilde { \alpha }$ such that $f ( \widetilde { \alpha } ) > f ( \alpha )$ . + +Now consider any point $( A _ { 1 } , A _ { 2 } ) \ \in \mathcal { X }$ . Since $A _ { 2 } A _ { 1 } X ~ \neq ~ \mathbf { 0 }$ , then there exists a certain row, say, the $i$ -th row $( A _ { 2 } ) _ { i , : } A _ { 1 } X$ , that is nonzero. We then apply the above fact with $\alpha = 1 , \mathbf { a } ^ { \top } =$ $( A _ { 2 } ) _ { i , : } A _ { 1 } \boldsymbol { X } , \mathbf { y } ^ { \intercal } = \boldsymbol { Y } _ { i , : }$ , and conclude that one can find a perturbation $\widetilde { \alpha }$ that achieves a higher function value. Equivalently, one can treat the perturbation of $\alpha$ eas the perturbation of $( A _ { 2 } ) _ { i , : }$ , i.e., define the perturbation $( \widetilde { A } _ { 2 } ) _ { i , : } : = \widetilde { \alpha } ( A _ { 2 } ) _ { i , : }$ . + +# PROOF OF THEOREM 3 + +We first derive the forms of the parameter matrices. Consider a critical point $( \pmb { A } _ { 1 } , \ldots , \pmb { A } _ { \ell } )$ of $\mathcal { L } _ { D }$ . By definition of the critical point, we have $\nabla _ { A _ { k } } \mathcal { L } _ { D } = 0$ for all $k = 1 , \dots , \ell$ , which implies that + +$$ +\begin{array} { r } { \pmb { A } _ { ( \ell , k + 1 ) } ^ { \top } \pmb { A } _ { ( \ell , k + 1 ) } \pmb { A } _ { k } \pmb { A } _ { ( k - 1 , 1 ) } \pmb { X } ( \pmb { A } _ { ( k - 1 , 1 ) } \pmb { X } ) ^ { \top } = \pmb { A } _ { ( \ell , k + 1 ) } ^ { \top } \pmb { Y } \pmb { X } ^ { \top } \pmb { A } _ { ( k - 1 , 1 ) } ^ { \top } , } \end{array} +$$ + +Solving this linear system of $\pmb { A } _ { k }$ , we obtain that, for some $\pmb { L } _ { k } \in \mathbb { R } ^ { d _ { k } \times d _ { k - 1 } }$ + +$$ +\begin{array} { r } { A _ { k } = A _ { ( \ell , k + 1 ) } ^ { \dagger } Y ( A _ { ( k - 1 , 1 ) } X ) ^ { \dagger } + L _ { k } - A _ { ( \ell , k + 1 ) } ^ { \dagger } A _ { ( \ell , k + 1 ) } L _ { k } A _ { ( k - 1 , 1 ) } X ( A _ { ( k - 1 , 1 ) } X ) ^ { \dagger } } \end{array} +$$ + +Multiplying eq. (33) on both sides by $A _ { ( \ell , k + 1 ) }$ on the left and $A _ { ( k - 1 , 1 ) } X$ on the right and then simplifying, we obtain that for all $k = 1 , \dots , \ell - 1$ + +$$ +A _ { ( \ell , 1 ) } \boldsymbol { X } = \mathcal { P } _ { \mathrm { c o l } ( A _ { ( \ell , k + 1 ) } ) } \boldsymbol { Y } ( A _ { ( k - 1 , 1 ) } \boldsymbol { X } ) ^ { \dagger } \boldsymbol { A } _ { ( k - 1 , 1 ) } \boldsymbol { X } . +$$ + +On the other hand, applying eq. (32) with $k = \ell$ and multiplying both sides by $A _ { \ell } ^ { \top }$ on the right, one obtains that + +$$ +\begin{array} { r } { \pmb { A } _ { ( \ell , 1 ) } \pmb { X } \pmb { X } ^ { \top } \pmb { A } _ { ( \ell , 1 ) } ^ { \top } = \pmb { Y } \pmb { X } ^ { \top } \pmb { A } _ { ( \ell , 1 ) } ^ { \top } , } \end{array} +$$ + +which, together with eq. (34), further implies that for all $k = 1 , \dots , \ell - 1$ + +$$ +\boldsymbol { \mathcal { P } } _ { \mathrm { c o l } ( A _ { ( \ell , k + 1 ) } ) } \boldsymbol { \Sigma } _ { k - 1 } \boldsymbol { \mathcal { P } } _ { \mathrm { c o l } ( A _ { ( \ell , k + 1 ) } ) } = \boldsymbol { \Sigma } _ { k - 1 } \boldsymbol { \mathcal { P } } _ { \mathrm { c o l } ( A _ { ( \ell , k + 1 ) } ) } . +$$ + +Following the same argument as that in the proof of Theorem 1, we conclude that $A _ { ( \ell , k + 1 ) } =$ $U _ { k - 1 } V _ { k - 1 } C _ { k - 1 }$ , where $U _ { k - 1 } , V _ { k - 1 } , C _ { k - 1 }$ satisfy the conditions that are stated in the theorem. Then, plugging the expression of $\boldsymbol { A } _ { ( \ell , k + 1 ) }$ in eq. (33), one obtains the form of $\pmb { A } _ { k }$ in eq. (4). + +We next prove the conditions in eq. (6). Note that the first condition is simply a consistency condition on the matrix products. This is because eq. (36) only provides the forms of the matrices $\pmb { A } _ { ( \ell , k + 1 ) } , k = 1 , \ldots , l - 1$ , which must factorize into the product of individual matrices. For the other condition in eq. (6), note that the proof of eq. (35) uses the weaker condition $( \nabla _ { { \pmb A } _ { \ell } } { \mathcal { L } } _ { D } ) { \pmb A } _ { \ell } ^ { \top } = { \bf 0 }$ than the original condittrices must also satisfy $\nabla _ { A _ { \ell } } \mathcal { L } _ { D } = \mathbf { 0 }$ , e parameter ma- Then, plugging $\nabla _ { A _ { \ell } } \mathcal { L } _ { D } = \mathbf { 0 }$ $\begin{array} { r } { \pmb { A } _ { ( \ell , 1 ) } \pmb { X } ( \pmb { A } _ { ( \ell - 1 , 1 ) } \pmb { X } ) ^ { \top } = \pmb { Y } \pmb { X } ^ { \top } \pmb { A } _ { ( \ell - 1 , 1 ) } ^ { \top } . } \end{array}$ eq. (34) in the above condition and simplifying, one obtains eq. (6). + +# PROOF OF PROPOSITION 4 + +Note that by expansion $\begin{array} { r } { \mathcal { L } _ { D } = \frac { 1 } { 2 } \mathrm { T r } ( \mathbf { Y } \mathbf { Y } ^ { \top } ) - \mathrm { T r } ( A _ { ( \ell , 1 ) } \mathbf { X } \mathbf { Y } ^ { \top } ) + \frac { 1 } { 2 } \mathrm { T r } ( A _ { ( \ell , 1 ) } \mathbf { X } \mathbf { X } ^ { \top } A _ { ( \ell , 1 ) } ^ { \top } ) } \end{array}$ . For any $A _ { 1 } , \dotsc , A _ { \ell }$ that satisfy eq. (32), we have shown that they must satisfy eq. (34) with $k = 1$ , with which we further obtain that + +$$ +\begin{array} { r l } & { \mathcal { L } = \frac { 1 } { 2 } \mathrm { T r } ( { \cal Y } { \cal Y } ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } ( \mathcal { P } _ { \mathrm { c o l } ( A _ { ( \ell , 2 ) } ) } \Sigma _ { 0 } ) } \\ & { \quad = \frac { 1 } { 2 } \mathrm { T r } ( { \cal Y } { \cal Y } ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } ( \mathcal { P } _ { \mathrm { c o l } ( U _ { 0 } ^ { \top } A _ { ( \ell , 2 ) } ) } \pmb { \Lambda } _ { 0 } ) . } \end{array} +$$ + +Consider a critical point $( \pmb { A } _ { 1 } , \ldots , \pmb { A } _ { \ell } )$ so that eq. (37) holds. Using the form of critical points $\pmb { A } _ { ( \ell , 2 ) } = \pmb { U } _ { 0 } \pmb { V } _ { 0 } \pmb { C } _ { 0 }$ , eq. (37) further becomes + +$$ +\begin{array} { r l } & { \mathcal { L } = \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } ( \mathcal { P } _ { \mathrm { c o l } ( \pmb { V } _ { 0 } \pmb { C } _ { 0 } ) } \pmb { \Lambda } _ { 0 } ) } \\ & { \quad = \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } ( \pmb { V } _ { 0 } ^ { \top } \pmb { \Lambda } _ { 0 } \pmb { V } _ { 0 } ) } \\ & { \quad \overset { ( i ) } { = } \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y } \pmb { Y } ^ { \top } ) - \frac { 1 } { 2 } \displaystyle \sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \sigma _ { i } ( 0 ) , } \end{array} +$$ + +where (i) utilizes the block pattern of $V _ { 0 }$ and the multiplicity pattern of $\mathbf { { \boldsymbol { \Lambda } } } _ { 0 }$ that are specified in Theorem 3. + +# PROOF OF PROPOSITION 5 + +Observe that the product matrix $\pmb { A } _ { ( \ell , 2 ) }$ is equivalent to the class of matrices $B _ { 2 } \in \mathbb { R } ^ { \operatorname* { m i n } \{ d _ { \ell } , \ldots , d _ { 2 } \} \times d _ { 1 } }$ . Consider a critical point $( B _ { 2 } , A _ { 1 } )$ of the shallow linear network $\begin{array} { r } { \mathcal { L } : = \frac { 1 } { 2 } \| B _ { 2 } A _ { 1 } \boldsymbol { X } - \boldsymbol { Y } \| _ { F } ^ { 2 } } \end{array}$ . By Proposition 2, we conclude that + +• I $\begin{array} { r } { \mathrm { f } \operatorname* { m i n } \{ d _ { \ell } , \dots , d _ { 1 } \} \leq \sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \end{array}$ , then $( A _ { 1 } , B _ { 2 } )$ is a global minimizer if and only if $B _ { 2 }$ is full rank and $\begin{array} { r } { p _ { 1 } = \tilde { m _ { 1 } ( 0 ) } , \dots , p _ { k - 1 } = m _ { k - 1 } ( 0 ) , p _ { k } = \mathrm { r a n k } ( B _ { 2 } ) - \sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \leq } \end{array}$ $m _ { k } ( 0 )$ for some $k \leq r ( 0 )$ ; • $\begin{array} { r } { \operatorname* { m i n } \{ d _ { \ell } , \dots , d _ { 1 } \} > \sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \end{array}$ , thand $( A _ { 1 } , B _ { 2 } )$ is a globaln particular, imizer if and only ifcan be non-full rank with $p _ { i } = m _ { i } ( 0 )$ $\begin{array} { r } { \operatorname { r a n k } ( B _ { 2 } ) = \sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \end{array}$ $i = 1 , \ldots , r ( 0 )$ . $\bar { p } ( 0 ) \geq 0$ $B _ { 2 }$ + +Note that $\mathcal { L } _ { D }$ achieves the same global minimum as $\mathcal { L }$ . Hence Proposition 1 and Proposition 4 must match, which yields that $\begin{array} { r } { \sum _ { i = 1 } ^ { r ( 0 ) } \bar { p } _ { i } \sigma _ { i } ( 0 ) = \sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \sigma _ { i } ( 0 ) } \end{array}$ . We then conclude that $p _ { i } ( 0 ) = p _ { i }$ for as $\sigma _ { 1 } ( 0 ) > \cdots > \sigma _ { r ( 0 ) } ( 0 )$ . This proves the proposition. + +# PROOF OF THEOREM 4 + +The proof is similar to that for shallow linear networks. Consider a deep-non-optimal-order critical point $( \pmb { A } _ { 1 } , \ldots , \pmb { A } _ { \ell } )$ , and define the orthonormal block matrix $S _ { k }$ using the blocks of $V _ { k }$ in a similar way as eq. (29). Then, $\boldsymbol { A } _ { ( l , k + 2 ) }$ takes the form $A _ { ( l , k + 2 ) } = U _ { k } S _ { k } \bar { S _ { k } ^ { \top } } V _ { k } C _ { k }$ . Since $\boldsymbol { A } _ { ( l , k + 2 ) }$ is of non-optimal order, there exists $\ : i < j < r ( k ) \ :$ such that $p _ { i } ( k ) < m _ { i } ( k )$ and $p _ { j } ( k ) > 0$ . Thus, we perturb the j-th column of UkSk to b e usj1+usi(pi(k)+1)√ 2 , and denote the resulting matrix as Mfk. Then, we perturb $\pmb { A } _ { \ell }$ to be $\widetilde { A } _ { \ell } = \widetilde { M } _ { k } ( U _ { k } S _ { k } ) ^ { \top } A _ { \ell }$ so that $\widetilde { A } _ { \ell } A _ { ( \ell - 1 , k + 2 ) } = \widetilde { M } _ { k } S _ { k } ^ { \top } V _ { k } C _ { k }$ . Moreover, we generate $\widetilde { A } _ { k + 1 }$ by eq. (4) with $U _ { k } \gets \widetilde { M } _ { k } , V _ { k } \gets S _ { k } ^ { \top } V _ { k }$ . Note that such construction satisfies eq. (32), and hence also satisfies eq. (34), which further yields that + +$$ +\widetilde { A } _ { \ell } A _ { ( \ell - 1 , k + 2 ) } \widetilde { A } _ { k + 1 } A _ { ( k , 1 ) } \pmb { X } = \mathcal { P } _ { \mathrm { c o l } ( \widetilde { A } _ { \ell } A _ { ( \ell - 1 , k + 2 ) } ) } \pmb { Y } ( A _ { ( k , 1 ) } \pmb { X } ) ^ { \dag } A _ { ( k , 1 ) } \pmb { X } . +$$ + +With the above equation, the function value at this perturbed point is evaluated as + +$$ +\begin{array} { r } { \mathcal { L } ( \widetilde { A } _ { \ell } , \dots , \widetilde { A } _ { k + 1 } , \dots ) = \frac { 1 } { 2 } \mathrm { T r } ( \pmb { Y Y } ^ { \top } ) - \frac { 1 } { 2 } \mathrm { T r } \big ( \mathcal { P } _ { \mathrm { c o l } ( S _ { k } ^ { \top } \pmb { U } _ { k } ^ { \top } \widetilde { M } _ { k } S _ { k } ^ { \top } V _ { k } ) } \pmb { \Lambda } _ { k } \big ) . } \end{array} +$$ + +Then, a careful calculation shows that only the i, j-th diagonal elements of Pcol(S>U>MkS>Vk)Λ have changed, and are $\textstyle { \frac { \epsilon ^ { 2 } } { 1 + \epsilon ^ { 2 } } } , { \frac { 1 } { 1 + \epsilon ^ { 2 } } }$ , respectively. We then conclude that + +$$ +\begin{array} { r } { \mathcal { L } ( A _ { 1 } , \ldots , \widetilde { A } _ { k + 1 } , \ldots , \widetilde { A } _ { \ell } ) = \mathcal { L } ( A _ { 1 } , \ldots , A _ { \ell } ) - \frac { \epsilon ^ { 2 } } { 1 + \epsilon ^ { 2 } } ( \sigma _ { i } ( k ) - \sigma _ { j } ( k ) ) < \mathcal { L } ( A _ { 1 } , \ldots , A _ { \ell } ) . } \end{array} +$$ + +Now consider a deep-optimal-order critical point $( \pmb { A } _ { 1 } , \ldots , \pmb { A } _ { \ell } )$ . Note that with $A _ { ( \ell - 2 , 1 ) }$ fixed to be a constant, the deep linear network reduces to a shallow linear network with parameters $\left( \mathbf { 1 } _ { \ell } , \mathbf { A } _ { \ell - 1 } \right)$ . Since $\left( \mathbf { \boldsymbol { A } } _ { \ell } , \mathbf { \boldsymbol { A } } _ { \ell - 1 } \right)$ is not a non-global minimum critical point of this shallow linear network and $\pmb { A } _ { \ell }$ is of optimal-order, we can apply the perturbation scheme in the proof of Proposition 3 to identify a perturbation $( \widetilde { A } _ { \ell } , \widetilde { A } _ { \ell - 1 } )$ with $\mathrm { \ddot { r a n k } } ( \hat { \tilde { \mathbf { A } } } _ { \ell } ) = \mathrm { r a n k } ( A _ { \ell } ) + 1$ that achieves a lower function value. + +Consider any point in $\mathcal { X } _ { D }$ . Since $\pmb { A } _ { ( \ell , 1 ) } \pmb { X } \neq \mathbf { 0 }$ , we can scale the nonzero row, say, the $i$ -th row $( A _ { \ell } ) _ { i , : } A _ { ( \ell - 1 , 1 ) } X$ properly in the same way as that in the proof of Proposition 3 to increase the function value. Lastly, item 1 and item 2 imply that every local minimum is a global minimum for these two types of critical points. Moreover, combining items 1,2 and 3, we conclude that every critical point of these two types in $\mathcal { X } _ { D }$ is a saddle point. \ No newline at end of file diff --git a/parse/train/SysEexbRb/SysEexbRb_content_list.json b/parse/train/SysEexbRb/SysEexbRb_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..4c8a9ad82eb8488ad237948602e1cb3df7ec7251 --- /dev/null +++ b/parse/train/SysEexbRb/SysEexbRb_content_list.json @@ -0,0 +1,2516 @@ +[ + { + "type": "text", + "text": "CRITICAL POINTS OF LINEAR NEURAL NETWORKS: ANALYTICAL FORMS AND LANDSCAPE PROPERTIES ", + "text_level": 1, + "bbox": [ + 176, + 98, + 821, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Yi Zhou & Yingbin Liang \nDepartment of Electrical and Computer Engineering \nThe Ohio State University \nzhou.1172@osu.edu ", + "bbox": [ + 183, + 170, + 527, + 226 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 262, + 544, + 277 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Due to the success of deep learning to solving a variety of challenging machine learning tasks, there is a rising interest in understanding loss functions for training neural networks from a theoretical aspect. Particularly, the properties of critical points and the landscape around them are of importance to determine the convergence performance of optimization algorithms. In this paper, we provide a necessary and sufficient characterization of the analytical forms for the critical points (as well as global minimizers) of the square loss functions for linear neural networks. We show that the analytical forms of the critical points characterize the values of the corresponding loss functions as well as the necessary and sufficient conditions to achieve global minimum. Furthermore, we exploit the analytical forms of the critical points to characterize the landscape properties for the loss functions of linear neural networks and shallow ReLU networks. One particular conclusion is that: While the loss function of linear networks has no spurious local minimum, the loss function of one-hidden-layer nonlinear networks with ReLU activation function does have local minimum that is not global minimum. ", + "bbox": [ + 233, + 295, + 764, + 502 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 530, + 336, + 546 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In the past decade, deep neural networks Goodfellow et al. (2016) have become a popular tool that has successfully solved many challenging tasks in a variety of areas such as machine learning, artificial intelligence, computer vision, and natural language processing, etc. As the understandings of deep neural networks from different aspects are mostly based on empirical studies, there is a rising need and interest to develop understandings of neural networks from theoretical aspects such as generalization error, representation power, and landscape (also referred to as geometry) properties, etc. In particular, the landscape properties of loss functions (that are typically nonconex for neural networks) play a central role to determine the iteration path and convergence performance of optimization algorithms. ", + "bbox": [ + 174, + 561, + 825, + 686 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "One major landscape property is the nature of critical points, which can possibly be global minima, local minima, saddle points. There have been intensive efforts in the past into understanding such an issue for various neural networks. For example, it has been shown that every local minimum of the loss function is also a global minimum for shallow linear networks under the autoencoder setting and invertibility assumptions Baldi & Hornik (1989) and for deep linear networks Kawaguchi (2016); Lu & Kawaguchi (2017); Yun et al. (2017) respectively under different assumptions. The conditions on the equivalence between local minimum or critical point and global minimum has also been established for various nonlinear neural networks Yu & Chen (1995); Gori & Tesi (1992); Nguyen & Hein (2017); Soudry & Carmon (2016); Feizi et al. (2017) under respective assumptions. ", + "bbox": [ + 174, + 694, + 825, + 819 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "However, most previous studies did not provide characterization of analytical forms for critical points of loss functions for neural networks with only very few exceptions. In Baldi & Hornik (1989), the authors provided an analytical form for the critical points of the square loss function of shallow linear networks under certain conditions. Such an analytical form further helps to establish the landscape properties around the critical points. Further in Li et al. (2016b), the authors characterized certain sufficient form of critical points for the square loss function of matrix factorization problems and deep linear networks. ", + "bbox": [ + 174, + 827, + 823, + 922 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The focus of this paper is on characterizing the sufficient and necessary forms of critical points for broader scenarios, i.e., shallow and deep linear networks with no assumptions on data matrices and network dimensions, and shallow ReLU networks over certain parameter space. In particular, such analytical forms of critical points capture the corresponding loss function values and the necessary and sufficient conditions to achieve global minimum. This further enables us to establish new landscape properties around these critical points for the loss function of these networks under general settings, and provides alternative (yet simpler and more intuitive) proofs for existing understanding of the landscape properties. ", + "bbox": [ + 174, + 103, + 825, + 215 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "OUR CONTRIBUTION ", + "text_level": 1, + "bbox": [ + 176, + 238, + 320, + 252 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "1) For the square loss function of linear networks with one hidden layer, we provide a full (necessary and sufficient) characterization of the analytical forms for its critical points and global minimizers. These results generalize the characterization in Baldi & Hornik (1989) to arbitrary network parameter dimensions and any data matrices. Such a generalization further enables us to establish the landscape property, i.e., every local minimum is also a global minimum and all other critical points are saddle points, under no assumptions on parameter dimensions and data matrices. From a technical standpoint, we exploit the analytical forms of critical points to provide a new proof for characterizing the landscape around the critical points under full relaxation of assumptions, where the corresponding approaches in Baldi & Hornik (1989) are not applicable. As a special case of linear networks, the matrix factorization problem satisfies all these landscape properties. ", + "bbox": [ + 174, + 266, + 825, + 405 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2) For the square loss function of deep linear networks, we establish a full (necessary and sufficient) characterization of the analytical forms for its critical points and global minimizers. Such characterizations are new and have not been established in the existing art. Furthermore, such analytical form divides the set of non-global-minimum critical points into different categories. We identify the directions along which the loss function value decreases for two categories of the critical points, for which our result directly implies the equivalence between the local minimum and the global minimum. For these cases, our proof generalizes the result in Kawaguchi (2016) under no assumptions on the network parameter dimensions and data matrices. ", + "bbox": [ + 174, + 412, + 825, + 523 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "3) For the square loss function of one-hidden-layer nonlinear neural networks with ReLU activation function, we provide a full characterization of both the existence and the analytical forms of the critical points in certain types of regions in the parameter space. Particularly, in the case where there is one hidden unit, our results fully characterize the existence and the analytical forms of the critical points in the entire parameter space. Such characterization were not provided in previous work on nonlinear neural networks. Moreover, we apply our results to a concrete example to demonstrate that both local minimum that is not a global minimum and local maximum do exist in such a case. ", + "bbox": [ + 174, + 531, + 825, + 628 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "RELATED WORK ", + "text_level": 1, + "bbox": [ + 174, + 652, + 290, + 665 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Analytical forms of critical points: Characterizing the analytical form of critical points for loss functions of neural networks dates back to Baldi & Hornik (1989), where the authors provided an analytical form of the critical points for the square loss function of linear networks with one hidden layer. In Li et al. (2016b), the authors provided a sufficient condition of critical points of a generic function, i.e., the fixed point of invariant groups. They then characterized certain sufficient forms of critical points for the square loss function of matrix factorization problems and deep linear networks, whereas our results provide sufficient and necessary forms of critical points for deep linear networks via a different approach. ", + "bbox": [ + 174, + 680, + 825, + 791 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Properties of critical points: Baldi & Hornik (1989); Baldi (1989) studied the linear autoencoder with one hidden layer and showed the equivalence between the local minimum and the global minimum. Moreover, Baldi & Lu (2012) generalized these results to the complex-valued autoencoder setting. The deep linear networks were studied by some recent work Kawaguchi (2016); Lu & Kawaguchi (2017); Yun et al. (2018), in which the equivalence between the local minimum and the global minimum was established respectively under different assumptions. Particularly, Yun et al. (2017) established a necessary and sufficient condition for a critical point of the deep linear network to be a global minimum. A similar result was established in Freeman & Bruna (2017) for deep linear networks under the setting that the widths of intermediate layers are larger than those of the input and output layers. The effect of regularization on the critical points for a two-layer linear network was studied in Taghvaei et al. (2017). ", + "bbox": [ + 174, + 797, + 825, + 924 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 821, + 132 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "For nonlinear neural networks, Yu & Chen (1995) studied a nonlinear neural network with one hidden layer and sigmoid activation function, and showed that every local minimum is also a global minimum provided that the number of input units equals the number of data samples. Gori & Tesi (1992) considered a class of multi-layer nonlinear networks with a pyramidal structure, and showed that all critical points of full column rank achieve the zero loss when the sample size is less than the input dimension. These results were further generalized to a larger class of nonlinear networks in Nguyen & Hein (2017), in which they also showed that critical points with non-degenerate Hessian are global minimum. Choromanska et al. (2015a;b) connected the loss surface of deep nonlinear networks with the Hamiltonian of the spin-glass model under certain assumptions and characterized the distribution of the local minimum. Kawaguchi (2016) further eliminated some of the assumptions in Choromanska et al. (2015a), and established the equivalence between the local minimum and the global minimum by reducing the loss function of the deep nonlinear network to that of the deep linear network. Soudry & Carmon (2016) showed that a two-layer nonlinear network has no bad differentiable local minimum. Feizi et al. (2017) studied a one-hidden-layer nonlinear neural network with the parameters restricted in a set of directions of lines, and showed that most local minima are global minima. Tian (2017) considered a two-layer ReLU network with Gaussian input data, and showed that critical points in certain region are non-isolated and characterized the critical-point-free regions. ", + "bbox": [ + 174, + 137, + 825, + 388 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Geometric curvature: Hardt & Ma (2017) established the gradient dominance condition of deep linear residual networks, and Zhou & Liang (2017) further established the gradient dominance condition and regularity condition around the global minimizers for deep linear, deep linear residual and shallow nonlinear networks. Li et al. (2016a) studied the property of the Hessian matrix for deep linear residual networks. The local strong convexity property was established in Soltanolkotabi et al. (2017) for overparameterized nonlinear networks with one hidden layer and quadratic activation functions, and was established in Zhong et al. (2017) for a class of nonlinear networks with one hidden layer and Gaussian input data. Zhong et al. (2017) further established the local linear convergence of gradient descent method with tensor initialization. Soudry & Hoffer (2017) studied a one-hidden-layer nonlinear network with a single output, and showed that the volume of sub-optimal differentiable local minima is exponentially vanishing in comparison with the volume of global minima. Dauphin et al. (2014) investigated the saddle points in deep neural networks using the results from statistical physics and random matrix theory. ", + "bbox": [ + 174, + 395, + 825, + 575 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Notation: The pseudoinverse, column space and null space of a matrix $M$ are denoted by $M ^ { \\dagger } , \\mathrm { c o l } ( M )$ and $\\ker ( M )$ , respectively. For any index sets $I , J \\subset \\mathbb { N }$ , $M _ { I , J }$ denotes the submatrix of $M$ formed by the entries with the row indices in $I$ and the column indices in $J$ . For positive integers $i \\leq j$ , we define $i : j = \\{ i , i + 1 , \\dotsc , j - 1 , j \\}$ . The projection operator onto a linear subspace $V$ is denoted by ${ \\mathcal { P } } _ { V }$ . ", + "bbox": [ + 174, + 583, + 825, + 654 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "2 LINEAR NEURAL NETWORKS WITH ONE HIDDEN LAYER ", + "text_level": 1, + "bbox": [ + 174, + 674, + 678, + 690 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In this section, we study linear neural networks with one hidden layer. Suppose we have an input data matrix $\\pmb { X } \\in \\mathbb { R } ^ { d _ { 0 } \\times \\pmb { m } }$ and a corresponding output data matrix $\\dot { \\boldsymbol { Y } } \\in \\mathbb { R } ^ { d _ { 2 } ^ { - } \\times m }$ , where there are in total $m$ data samples. We are interested in learning a model that maps from $\\boldsymbol { X }$ to $\\mathbf { Y }$ via a linear network with one hidden layer. Specifically, we denote the weight parameters between the output layer and the hidden layer of the network as $A _ { 2 } ~ \\in ~ \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }$ , and denote the weight parameters between the hidden layer and the input layer of the network as $A _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }$ . We are interested in the square loss function of this linear network, which is given by ", + "bbox": [ + 174, + 705, + 825, + 804 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/8f880d812f03df37336a5ef88339184d8a6484f0a4dfa113221dcd9ca3eec1d0.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { L } : = \\frac { 1 } { 2 } \\left\\| A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\right\\| _ { F } ^ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 406, + 813, + 591, + 833 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Note that in a special case where $X = I$ , $\\mathcal { L }$ reduces to a loss function for the matrix factorization problem, to which all our results apply. The loss function $\\mathcal { L }$ has been studied in Baldi & Hornik (1989) under the assumptions that $d _ { 2 } = d _ { 0 } \\geq d _ { 1 }$ and the matrices $X X ^ { \\top } , Y X ^ { \\top } ( X X ^ { \\top } ) ^ { - 1 } X Y ^ { \\top }$ are invertible. In our study, no assumption is made on either the parameter dimensions or the invertibility of the data matrices. Such full generalization of the results in Baldi & Hornik (1989) turns out to be critical for our study of nonlinear shallow neural networks in Section 4. ", + "bbox": [ + 173, + 839, + 825, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We further define $\\Sigma : = Y X ^ { \\dagger } X Y ^ { \\top }$ and denote its full singular value decomposition as $U \\pmb { \\Lambda } U ^ { \\top }$ . Suppose that $\\pmb { \\Sigma }$ has $r$ distinct positive singular values $\\sigma _ { 1 } > \\cdots > \\sigma _ { r } > 0$ with multiplicities $m _ { 1 } , \\ldots , m _ { r }$ , respectively, and has $\\bar { m }$ zero singular values. Recall that $( A _ { 1 } , A _ { 2 } )$ is defined to be a critical point of $\\mathcal { L }$ if $\\nabla _ { A _ { 1 } } \\mathcal { L } = \\mathbf { 0 } , \\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }$ . Our first result provides a full characterization of all critical points of $\\mathcal { L }$ . ", + "bbox": [ + 173, + 102, + 825, + 174 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Theorem 1 (Characterization of critical points). All critical points of $\\mathcal { L }$ are necessarily and sufficiently characterized by a matrix $\\pmb { L } _ { 1 } \\in \\overline { { \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } } } }$ , a block matrix $V ~ \\in \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }$ and an invertible matrix $C \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 1 } }$ via ", + "bbox": [ + 173, + 176, + 821, + 219 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/cf57a2f3dbeac390e8a075192901965861703b9fd84ce2ff59a701d9ab01d928.jpg", + "text": "$$\n\\begin{array} { r l } & { A _ { 1 } = C ^ { - 1 } V ^ { \\top } U ^ { \\top } Y X ^ { \\dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \\top } V C L _ { 1 } X X ^ { \\dagger } } \\\\ & { A _ { 2 } = U V C . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 316, + 222, + 679, + 260 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Specifically, $V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { { V } } } ) , \\mathbf { 0 } ^ { d _ { 2 } \\times ( d _ { 1 } - \\mathrm { r a n k } ( { \\bf A } _ { 2 } ) ) } ] ,$ , where both $V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }$ and $\\overline { { V } } \\in$ $\\bar { \\mathbb { R } } ^ { \\bar { m } \\times \\bar { p } }$ consist of orthonormal columns with the number of columns $p _ { i } \\leq m _ { i } , i = 1 , . . . , r , \\bar { p } \\leq \\bar { m }$ such that ${ \\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( A _ { 2 } ) }$ , and $L _ { 1 } , V , C$ satisfy ", + "bbox": [ + 173, + 263, + 825, + 310 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/71cd6575cde5b5179045518c47223bc46b5f2534c4ef25cf9e1f1c3f818d3cc1.jpg", + "text": "$$\n\\mathcal { P } _ { \\mathrm { c o l } ( U V ) ^ { \\perp } } \\mathbf { { \\mathit { Y X } } ^ { \\top } } \\mathbf { { \\mathit { L } } _ { 1 } ^ { \\top } } \\mathbf { { \\mathit { C } } ^ { \\top } } \\mathcal { P } _ { \\mathrm { k e r } ( V ) } = \\mathbf { { 0 } } .\n$$", + "text_format": "latex", + "bbox": [ + 379, + 314, + 620, + 335 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Theorem 1 characterizes the necessary and sufficient forms for all critical points of $\\mathcal { L }$ . Intuitively, the matrix $C$ captures the invariance of the product $\\mathbf { A } _ { 2 } \\mathbf { A } _ { 1 }$ under an invertible transform, and $\\mathbf { L } _ { 1 }$ captures the degree of freedom of the solution set for linear systems. ", + "bbox": [ + 174, + 345, + 823, + 388 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In general, the set of critical points is uncountable and cannot be fully listed out. However, the analytical forms in eqs. (1) and (2) do allow one to construct some critical points of $\\mathcal { L }$ by specifying choices of $L _ { 1 } , V , C$ that fulfill the condition in eq. (3). For example, choosing $\\mathbf { L } _ { 1 } = \\mathbf { 0 }$ guarantees eq. (3), in which case eqs. (1) and (2) yield a critical point $( C ^ { - \\mathrm { i } } V ^ { \\dagger } U ^ { \\top } Y X ^ { \\dagger } , U V C )$ for any invertible matrix $C$ and any block matrix $V$ that takes the form specified in Theorem 1. For nonzero $\\mathbf { L } _ { 1 }$ , one can fix a proper $V$ and solve the linear equation on $C$ in eq. (3). If a solution exists, we then obtain the form of a corresponding critical point. We further note that the analytical structures of the critical points are more important, which have direct implications on the global optimality conditions and landscape properties as we show in the remaining part of the section. ", + "bbox": [ + 173, + 393, + 825, + 520 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Remark 1. We note that the block pattern parameters $\\{ p _ { i } \\} _ { i = 1 } ^ { r }$ and $\\bar { p }$ denote the number of columns of $\\{ V _ { i } \\} _ { i = 1 } ^ { r }$ and $\\overline { V }$ , respectively, and their sum equals the rank of $A _ { 2 }$ , i.e., $\\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + { \\bar { p } } = \\operatorname { r a n k } ( A _ { 2 } )$ ", + "bbox": [ + 173, + 523, + 821, + 555 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The parameters $p _ { i } , i = 1 , \\ldots , r , \\bar { p }$ of $V$ contain all useful information of the critical points that determine the function value of $\\mathcal { L }$ as presented in the following proposition. ", + "bbox": [ + 173, + 564, + 821, + 593 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Proposition 1. Any critical point $( A _ { 1 } , A _ { 2 } )$ of $\\mathcal { L }$ satisfies $\\begin{array} { r } { \\mathcal { L } ( A _ { 1 } , A _ { 2 } ) = \\frac { 1 } { 2 } ( \\mathrm { T r } ( Y Y ^ { \\top } ) - \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } ) . } \\end{array}$ ", + "bbox": [ + 171, + 595, + 820, + 613 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Proposition 1 evaluates the function value $\\mathcal { L }$ at a critical point using the parameters $\\{ p _ { i } \\} _ { i = 1 } ^ { r }$ . To explain further, recall that the data matrix $\\pmb { \\Sigma }$ has each singular value $\\sigma _ { i }$ with multiplicity $m _ { i }$ . For each $i$ , the critical point captures $p _ { i }$ out of $m _ { i }$ singular values $\\sigma _ { i }$ . Hence, for a $\\sigma _ { i }$ with larger value (i.e., a smaller index $i$ ), it is desirable that a critical point captures a larger number $p _ { i }$ of them. In this way, the critical point captures more important principle components of the data so that the value of the loss function is further reduced as suggested by Proposition 1. In summary, the parameters $\\{ p _ { i } \\} _ { i = 1 } ^ { r }$ characterize how well the learned model fits the data in terms of the value of the loss function. Moreover, the parameters $\\{ p _ { i } \\} _ { i = 1 } ^ { r }$ also determine a full characterization of the global minimizers as given below. ", + "bbox": [ + 173, + 621, + 825, + 748 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Proposition 2 (Characterization of global minimizers). A critical point $( A _ { 1 } , A _ { 2 } )$ of $\\mathcal { L }$ is a global minimizer if and only if it falls into the following two cases. ", + "bbox": [ + 173, + 751, + 823, + 780 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "1. Case $\\begin{array} { r } { \\operatorname { r a n k } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\le m _ { k } } \\end{array}$ $^ { l }$ : $\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} \\le \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}$ =1 for some , $A _ { 2 }$ $k \\leq r$ is full rank, and ; $p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =$ 2. Case 2: $\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}$ i , $p _ { i } = m _ { i }$ for $i = 1 , \\ldots , r _ { : }$ , and $\\bar { p } \\geq 0$ . In particular, $A _ { 2 }$ can be non-full rank with $\\textstyle { \\mathrm { r a n k } } ( A _ { 2 } ) = \\sum _ { i = 1 } ^ { r } m _ { i }$ . ", + "bbox": [ + 173, + 785, + 825, + 852 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The analytical form of any global minimizer can be obtained from Theorem 1 with further specification to the above two cases. ", + "bbox": [ + 173, + 856, + 823, + 883 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Proposition 2 establishes the neccessary and sufficient conditions for any critical point to be a global minimizer. If the data matrix $\\pmb { \\Sigma }$ has a large number of nonzero singular values, i.e., the first case, one needs to exhaust the representation budget (i.e., rank) of $A _ { 2 }$ and capture as many large singular values as the rank allows to achieve the global minimum; Otherwise, $A _ { 2 }$ of a global minimizer can be non-full rank and still captures all nonzero singular values. Note that $A _ { 2 }$ must be full rank in the case 1, and so is $A _ { 1 }$ if we further adopt the assumptions on the network size and data matrices in Baldi & Hornik (1989). ", + "bbox": [ + 173, + 895, + 823, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 174 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Furthermore, the parameters $\\{ p _ { i } \\} _ { i = 1 } ^ { r }$ naturally divide all non-global-minimum critical points $\\left( A _ { 1 } , A _ { 2 } \\right)$ of $\\mathcal { L }$ into the following two categories. ", + "bbox": [ + 171, + 180, + 823, + 209 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "• (Non-optimal order): The matrix $V$ specified in Theorem 1 satisfies that there exists $1 \\leq i < j \\leq$ $r$ such that $p _ { i } < m _ { i }$ and $p _ { j } > 0$ . • (Optimal order): $\\mathrm { r a n k } ( A _ { 2 } ) < \\mathrm { m i n } \\{ d _ { 2 } , d _ { 1 } \\}$ and the matrix $V$ specified in Theorem 1 satisfies that $p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = { \\mathrm { r a n k } } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\leq m _ { k }$ for some $1 \\leq k \\leq r$ . ", + "bbox": [ + 174, + 215, + 825, + 276 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To understand the above two categories, note that a critical point of $\\mathcal { L }$ with non-optimal order captures a smaller singular value $\\sigma _ { j }$ (since $p _ { j } > 0 \\ :$ ) while skipping a larger singular value $\\sigma _ { i }$ with a lower index $i < j$ (since $p _ { i } < m _ { i } )$ ), and hence cannot be a global minimizer. On the other hand, although a critical point of $\\mathcal { L }$ with optimal order captures the singular values in the optimal (i.e., decreasing) order, it does not fully utilize the representation budget of $A _ { 2 }$ (because $A _ { 2 }$ is non-full rank) to further capture nonzero singular values and reduce the function value, and hence cannot be a global minimizer either. Next, we show that these two types of non-global-minimum critical points have different landscape properties around them. Throughout, a matrix $\\widetilde { M }$ is called the perturbation of $M$ if it lies in an arbitrarily small neighborhood of $M$ . ", + "bbox": [ + 173, + 281, + 825, + 410 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Proposition 3 (Landscape around critical points). The critical points of $\\mathcal { L }$ have the following landscape properties. ", + "bbox": [ + 173, + 414, + 823, + 443 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "1. A non-optimal-order critical point $\\left( A _ { 1 } , A _ { 2 } \\right)$ has a perturbation $( \\widetilde { A _ { 1 } } , \\widetilde { A _ { 2 } } )$ with ran $\\operatorname { k } ( \\widetilde { A _ { 2 } } ) =$ $\\operatorname { r a n k } ( A _ { 2 } )$ , which achieves a lower function value; \n2. An optimal-order critical point $( A _ { 1 } , A _ { 2 } )$ has a perturbation $( \\widetilde { A _ { 1 } } , \\widetilde { A _ { 2 } } )$ with $\\mathrm { r a n k } ( \\widetilde { A _ { 2 } } ) =$ $\\mathrm { r a n k } ( A _ { 2 } ) + 1$ , which achieves a lower function value; \n3. Any point in $\\mathcal { X } : = \\{ ( A _ { 1 } , A _ { 2 } ) : ~ A _ { 2 } A _ { 1 } X \\neq \\mathbf { 0 } \\}$ has a perturbation $( A _ { 1 } , \\widetilde { A _ { 2 } } )$ , which achieves a higher function value; ", + "bbox": [ + 173, + 450, + 825, + 544 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "As a consequence, items 1 and 2 imply that any non-global-minimum critical point has a descent direction, and hence cannot be a local minimizer. Thus, any local minimizer must be a global minimizer. Item 3 implies that any point has an ascent direction whenever the output is nonzero. Hence, there does not exist any local/global maximizer in $\\mathcal { X }$ . Furthermore, item 3 together with items 1 and 2 implies that any non-global-minimum critical point in $\\mathcal { X }$ has both descent and ascent directions, and hence must be a saddle point. We summarize these facts in the following theorem. ", + "bbox": [ + 174, + 554, + 825, + 638 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Theorem 2 (Landscape of $\\mathcal { L }$ ). The loss function $\\mathcal { L }$ satisfies: $^ { l }$ ) every local minimum is also a global minimum; 2) every non-global-minimum critical point in $\\mathcal { X }$ is a saddle point. ", + "bbox": [ + 173, + 643, + 823, + 672 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We note that the saddle points in Theorem 2 can be non-strict when the data matrices are singular. As an illustrative example, consider the following loss function of a shallow linear network ${ \\mathcal { L } } ( a _ { 2 } , a _ { 1 } ) =$ $\\textstyle { \\frac { 1 } { 2 } } ( a _ { 2 } a _ { 1 } x - y ) ^ { 2 }$ , where $a _ { 1 } , a _ { 2 } , x$ and $y$ are all scalars. Consider the case $y = 0$ . Then, the Hessian at the saddle point $a _ { 1 } = 0 , a _ { 2 } = 1$ is $[ x ^ { 2 } , 0 ; 0 , 0 ]$ , which does not have any negative eigenvalue. ", + "bbox": [ + 174, + 684, + 825, + 743 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "From a technical point of view, the proof of item 1 of Proposition 3 applies that in Baldi (1989) and generalizes it to the setting where $\\pmb { \\Sigma }$ can have repeated singular values and may not be invertible. To further understand the perturbation scheme from a high level perspective, note that non-optimalorder critical points capture a smaller singular value $\\sigma _ { j }$ instead of a larger one $\\sigma _ { i }$ with $i < j$ . Thus, one naturally perturbs the singular vector corresponding to $\\sigma _ { j }$ along the direction of the singular vector corresponding to $\\sigma _ { i }$ . Such a perturbation scheme preserves the rank of $A _ { 2 }$ and reduces the value of the loss function. ", + "bbox": [ + 173, + 748, + 825, + 847 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "More importantly, the proof of item 2 of Proposition 3 introduces a new technique. As a comparison, Baldi & Hornik (1989) proves a similar result as item 2 using the strict convexity of the function, which requires the parameter dimensions to satisfy $d _ { 2 } = d _ { 0 } \\geq d _ { 1 }$ and the data matrices to be invertible. In contrast, our proof completely removes these restrictions by introducing a new perturbation direction and exploiting the analytical forms of critical points in eqs. (1) and (2) and the condition in eq. (3). The accomplishment of the proof further requires careful choices of perturbation parameters as well as judicious manipulations of matrices. We refer the reader to the supplemental materials for more details. As a high level understanding, since optimal-order critical points capture the singular values in an optimal (i.e., decreasing) order, the previous perturbation scheme for non-optimal-order critical points does not apply. Instead, we increase the rank of $A _ { 2 }$ by one in a way that the perturbed matrix captures the next singular value beyond the ones that have already been captured so that the value of the loss function can be further reduced. ", + "bbox": [ + 174, + 853, + 825, + 924 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 825, + 202 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "3 DEEP LINEAR NEURAL NETWORKS ", + "text_level": 1, + "bbox": [ + 174, + 220, + 501, + 238 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we study deep linear networks with $\\ell \\geq 2$ layers. We denote the weight parameters between the layers as $\\dot { \\pmb { A } } _ { k } \\in \\dot { \\mathbb { R } } ^ { d _ { k } \\times d _ { k - 1 } }$ for $k = 1 , \\dots , \\ell$ , respectively. The input and output data are denoted by $\\pmb { X } ^ { ' } \\in \\mathbb { R } ^ { d _ { 0 } \\times m }$ , $\\pmb { Y } \\in \\mathbb { R } ^ { d _ { \\ell } \\times m }$ , respectively. We are interested in the square loss function of deep linear networks, which is given by ", + "bbox": [ + 173, + 252, + 825, + 309 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/0b84062910ad34bc57fc3026675fcb62088e03bbcd338e139bb2d787fc004bae.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { L } _ { D } : = \\frac { 1 } { 2 } \\left\\| A _ { \\ell } \\cdot \\cdot \\cdot A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\right\\| _ { F } ^ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 377, + 315, + 619, + 335 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Denote $\\Sigma _ { k } : = Y ( A _ { ( k , 1 ) } X ) ^ { \\dagger } A _ { ( k , 1 ) } X Y ^ { \\top }$ for $k = 0 , \\ldots , \\ell$ with the full singular value decomposition $U _ { k } \\pmb { \\Lambda } _ { k } \\pmb { U } _ { k } ^ { \\top }$ . Suppose that $\\Sigma _ { k }$ has $r ( k )$ distinct positive singular values $\\sigma _ { 1 } ( k ) > \\cdots >$ $\\sigma _ { r ( k ) } ( k ) > 0$ with multiplicities $m _ { 1 } ( k ) , \\ldots , m _ { r ( k ) } ( k )$ , respectively, and $\\bar { m } ( k )$ zero singular values. Our first result provides a full characterization of all critical points of $\\mathcal { L } _ { D }$ , where we denote $\\begin{array} { r } { \\pmb { A } _ { ( i , j ) } : = \\pmb { A } _ { i } \\pmb { A } _ { i - 1 } \\cdot \\cdot \\cdot \\pmb { A } _ { j + 1 } \\pmb { A } _ { j } } \\end{array}$ for notational convenience1. ", + "bbox": [ + 173, + 340, + 825, + 416 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorem 3 (Characterization of critical points). All critical points of $\\mathcal { L } _ { D }$ are necessarily and sufficiently characterized by matrices $\\pmb { L } _ { k } \\in \\mathrm { \\bar { R } } ^ { d _ { k } \\times d _ { k - 1 } }$ , block matrices $\\dot { V } _ { k } \\in \\mathbb { R } ^ { d _ { l } \\times d _ { k + 1 } }$ and invertible matrices $C _ { k } \\in \\mathbb { R } ^ { d _ { k + 1 } \\times \\tilde { d _ { k + 1 } } }$ for $k = 0 , \\ldots , \\ell { - } 2$ such that $A _ { 1 } , \\ldots , A _ { \\ell }$ can be individually expressed out recursively via the following two equations: ", + "bbox": [ + 173, + 419, + 825, + 476 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/fa341665d9ffee275d195cdef85335d57e5997030e84561d580d0dd2dea29971.jpg", + "text": "$$\nA _ { k + 1 } = C _ { k } ^ { - 1 } V _ { k } ^ { \\top } U _ { k } ^ { \\top } Y ( A _ { ( k , 1 ) } X ) ^ { \\dagger } + L _ { k + 1 } - C _ { k } ^ { - 1 } V _ { k } ^ { \\top } V _ { k } C _ { k } L _ { k + 1 } A _ { ( k , 1 ) } X ( A _ { ( k , 1 ) } X ) ^ { \\dagger } ,\n$$", + "text_format": "latex", + "bbox": [ + 196, + 481, + 779, + 503 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Specifically, $\\begin{array} { r l r } { V _ { k } } & { = } & { [ \\mathrm { d i a g } ( { V } _ { 1 } ^ { ( k ) } , \\ldots , { V } _ { r ( k ) } ^ { ( k ) } , \\overline { { V } } ^ { ( k ) } ) , \\mathbf { 0 } ^ { d _ { l } \\times ( d _ { k + 1 } - \\mathrm { r a n k } ( { A } _ { ( \\ell , k + 2 ) } ) ) } ] , } \\end{array}$ , where $V _ { i } ^ { ( k ) } ~ \\in \\qquad $ $\\mathbb { R } ^ { m _ { i } ( k ) \\times p _ { i } ( k ) } , ~ \\overline { { V } } ^ { ( k ) } ~ \\in ~ \\mathbb { R } ^ { \\bar { m } ( k ) \\times \\bar { p } ( k ) }$ consist of orthonormal columns with $p _ { i } ( k ) ~ \\leq ~ m _ { i } ( k )$ for $i = 1 , \\ldots , r ( k ) , \\bar { p } ( k ) \\leq \\bar { m } ( k )$ such that $\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( k ) } p _ { i } ( k ) + \\bar { p } ( k ) = \\mathrm { r a n k } ( A _ { \\ell , k + 1 } ) . } \\end{array}$ , and $\\mathbf { \\Delta } _ { L _ { k } , V _ { k } , C _ { k } }$ satisfy for $k = 2 , \\ldots , \\ell - 1$ ", + "bbox": [ + 173, + 526, + 826, + 601 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/8d82206858323bcc813ffdcc46305678731b008cf722193b0fa526c2d3ba0062.jpg", + "text": "$$\n\\begin{array} { r } { \\pmb { A } _ { ( \\ell , k ) } = \\pmb { A } _ { ( \\ell , k + 1 ) } \\pmb { A } _ { k } , \\quad ( \\pmb { I } - \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { ( \\ell , k + 1 ) } ) } ) \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell - 1 , 1 ) } ^ { \\top } = \\pmb { 0 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 282, + 604, + 715, + 627 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Note that the forms of the individual parameters $A _ { 1 } , \\ldots , A _ { \\ell }$ can be obtained as follows by recursively applying eqs. (4) and (5). First, eq. (5) with $k = 0$ yields the form of $\\pmb { A } _ { ( \\ell , 2 ) }$ . Then, eq. (4) with $k = 0$ and the form of $\\pmb { A } _ { ( \\ell , 2 ) }$ yield the form of $\\pmb { A } _ { 1 }$ . Next, eq. (5) with $k = 1$ yields the form of $\\mathbf { \\delta A } _ { ( \\ell , 3 ) }$ , and then, eq. (4) with $\\dot { k } = 1$ and the forms of $A _ { ( \\ell , 3 ) } , A _ { 1 }$ further yield the form of $A _ { 2 }$ . Inductively, one obtains the expressions of all individual parameter matrices. Furthermore, the first condition in eq. (6) is a consistency condition that guarantees that the analytical form for the entire product of parameter matrices factorizes into the forms of individual parameter matrices. Similarly to shallow linear networks, while the set of critical points here is also uncountable, Theorem 3 suggests ways to obtain some critical points. For example, if we set $\\pmb { L } _ { k } = \\mathbf { 0 }$ for all $k$ (i.e., eq. (6) is satisfied), we can obtain the form of critical points for any invertible $C _ { k }$ and proper $V _ { k }$ with the structure specified in Theorem 3. For nonzero $\\scriptstyle L _ { k }$ , eq. (6) needs to be verified for given $C _ { k }$ and $V _ { k }$ to determine a critical point. ", + "bbox": [ + 173, + 638, + 825, + 806 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Similarly to shallow linear networks, the parameters loss function at the critical points and further specify t $\\{ p _ { i } ( 0 ) \\} _ { i = 1 } ^ { r ( 0 ) } , \\bar { p } ( 0 )$ determine the value of them for the global minimizers, as we present in the following two propositions. ", + "bbox": [ + 174, + 814, + 825, + 859 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Proposition 4. Any critical point $( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )$ of $\\mathcal { L } _ { D }$ satisfies ", + "bbox": [ + 174, + 862, + 591, + 878 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/881328ac75c4a3a201a60a035965154a2a739adb2fba44ad119fb9cd8a87131e.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { L } _ { D } ( A _ { 1 } , \\ldots , A _ { \\ell } ) = \\frac { 1 } { 2 } \\big [ \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) \\big ] . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 313, + 883, + 681, + 906 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Proposition 5 (Characterization of global minimizers). A critical point $( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )$ of $\\mathcal { L } _ { D }$ is $a$ global minimizer if and only if it falls into the following two cases. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "1. Case $I$ : $\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} \\ \\le \\ \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \\end{array}$ , $\\pmb { A } _ { ( \\ell , 2 ) }$ achieves the maximal rank, and $p _ { 1 } ( 0 ) =$ $m _ { 1 } ( 0 ) , \\ldots , p _ { k - 1 } ( 0 ) = m _ { k - 1 } ( 0 ) , p _ { k } ( 0 ) = \\mathrm { r a n k } ( A _ { ( \\ell , 2 ) } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \\leq m _ { k } ( 0 )$ for some $k \\leq r ( 0 )$ ; 2. Case 2: $\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \\end{array}$ , $p _ { i } ( 0 ) = m _ { i } ( 0 )$ for all $i = 1 , \\ldots , r ( 0 )$ and $\\bar { p } ( 0 ) \\geq 0$ . In particular, $\\pmb { A } _ { ( \\ell , 2 ) }$ can be non-full rank with $\\begin{array} { r } { \\mathrm { r a n k } ( A _ { ( \\ell , 2 ) } ) = \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}$ . ", + "bbox": [ + 173, + 138, + 826, + 227 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The analytical form of any global minimizer can be obtained from Theorem 3 with further specification to the above two cases. ", + "bbox": [ + 174, + 231, + 820, + 261 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In particular for case 1, if we further adopt the invertibility assumptions on data matrices as in Baldi & Hornik (1989) and assume that all parameter matrices are square, then all global minima must correspond to full rank parameter matrices. ", + "bbox": [ + 173, + 282, + 825, + 325 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We next exploit the analytical forms of the critical points to further understand the landscape of the loss function $\\mathcal { L } _ { D }$ . It has been shown in Kawaguchi (2016) that every local minimum of $\\mathcal { L } _ { D }$ is also a global minimum, under certain conditions on the parameter dimensions and the invertibility of the data matrices. Here, our characterization of the analytical forms for the critical points allow us to understand such a result from an alternative viewpoint. The proofs for certain cases (that we discuss below) are simpler and more intuitive, and no assumption is made on the data matrices and dimensions of the network. ", + "bbox": [ + 173, + 332, + 825, + 429 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Similarly to shallow linear networks, we want to understand the local landscape around the critical points. However, due to the effect of depth, the critical points of $\\mathcal { L } _ { D }$ are more complicated than those of $\\mathcal { L }$ . Among them, we identify the following subsets of the non-global-minimum critical points $( \\pmb { A } _ { 1 } , \\cdots , \\pmb { A } _ { \\ell } )$ of $\\mathcal { L } _ { D }$ . ", + "bbox": [ + 174, + 435, + 825, + 492 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "• (Deep-non-optimal order): There exist $0 \\leq k \\leq \\ell - 2$ such that the matrix $V _ { k }$ specified in Theorem 3 satisfies that there exist $1 \\leq i < j \\leq r ( k )$ such that $p _ { i } ( k ) < m _ { i } ( k )$ and $p _ { j } ( k ) > 0$ . • (Deep-optimal order): $\\left( \\mathbf { \\boldsymbol { A } } _ { \\ell } , \\mathbf { \\boldsymbol { A } } _ { \\ell - 1 } \\right)$ is not a global minimizer of $\\mathcal { L } _ { D }$ with $A _ { ( \\ell - 2 , 1 ) }$ being fixed, $\\mathrm { r a n k } ( A _ { \\ell } ) < \\operatorname* { m i n } \\{ d _ { \\ell } , d _ { \\ell - 1 } \\}$ , and the matrix $V _ { \\ell - 2 }$ specified in Theorem 3 satisfies that $p _ { 1 } ( l - 2 ) =$ $\\begin{array} { r } { m _ { 1 } ( l - 2 ) , \\ldots , p _ { k - 1 } ( l - 2 ) = m _ { k - 1 } ( l - 2 ) , p _ { k } ( l - 2 ) = \\operatorname { r a n k } ( A _ { l } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( l - 2 ) \\leq m _ { k } ( l - 2 ) } \\end{array}$ $1 \\leq k \\leq r ( l - 2 )$ ", + "bbox": [ + 174, + 498, + 826, + 588 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "The following result summarizes the landscape of $\\mathcal { L } _ { D }$ around the above two types of critical points. ", + "bbox": [ + 173, + 593, + 821, + 609 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Theorem 4 (Landscape of $\\mathcal { L } _ { D }$ ). The loss function $\\mathcal { L } _ { D }$ has the following landscape properties. ", + "bbox": [ + 173, + 637, + 790, + 654 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "1. A deep-non-optimal-order critical point $( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )$ has $a$ perturbation $( A _ { 1 } , \\ldots , \\widetilde { A } _ { k + 1 } , \\ldots , \\widetilde { A } _ { \\ell } )$ with $\\begin{array} { r c l } { \\operatorname { r a n k } ( \\widetilde { A } _ { \\ell } ) } & { = } & { \\operatorname { r a n k } ( A _ { \\ell } ) } \\end{array}$ , which achieves $a$ lower function value. \n2. A deep-optimal-order critical point $( \\pmb { A } _ { 1 } , \\dots , \\pmb { A } _ { \\ell } )$ has a perturbation $( A _ { 1 } , \\ldots , \\widetilde { A } _ { \\ell - 1 } , \\widetilde { A } _ { \\ell } )$ with $\\mathrm { r a n k } ( \\widetilde { A } _ { \\ell } ) = \\mathrm { r a n k } ( A _ { \\ell } ) + 1 ;$ , which achieves a lower function value. \n3. Any point in $\\mathcal { X } _ { D } : = \\{ ( A _ { 1 } , . . . , A _ { \\ell } ) : A _ { ( \\ell , 1 ) } X \\neq \\mathbf { 0 } \\}$ has a perturbation $( A _ { 1 } , \\ldots , \\widetilde { A } _ { \\ell } )$ that achieves a higher function value. ", + "bbox": [ + 173, + 659, + 826, + 765 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Consequently, $^ { l }$ ) every local minimum of $\\mathcal { L } _ { D }$ is also a global minimum for the above two types of critical points; and 2) every critical point of these two types in $\\mathcal { X } _ { D }$ is a saddle point. ", + "bbox": [ + 173, + 771, + 825, + 801 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Theorem 4 implies that the landscape of $\\mathcal { L } _ { D }$ for deep linear networks is similar to that of $\\mathcal { L }$ for shallow linear networks, i.e., the pattern of the parameters $\\{ p _ { i } ( k ) \\} _ { i = 1 } ^ { r ( k ) }$ implies different descent directions of the function value around the critical points. Our approach does not handle the remaining set of non-global minimizers, i.e., there exists $q \\leq \\ell - 1$ such that $( A _ { \\ell } , \\ldots , A _ { q } )$ is a global minimum point of $\\mathcal { L } _ { D }$ with $A _ { ( q - 1 , 1 ) }$ being fixed, and $\\pmb { A } _ { ( \\ell , q ) }$ is of optimal order. It is unclear how to perturb the intermediate weight parameters using their analytical forms for deep networks , and we leave this as an open problem for the future work. ", + "bbox": [ + 173, + 821, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In this section, we study nonlinear neural networks with one hidden layer. In particular, we consider nonlinear networks with ReLU activation function $\\sigma : \\mathbb { R } \\mathbb { R }$ that is defined as $\\sigma ( x ) : = \\operatorname* { m a x } \\{ x , 0 \\}$ . Our study focuses on the set of differentiable critical points. The weight parameters between the layers are denoted by $A _ { 2 } \\in \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }$ , $A _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }$ , respectively, and the input and output data are denoted by $\\pmb { X } \\in \\mathbb { R } ^ { \\tilde { d } _ { 0 } \\times m } , \\pmb { Y } \\in \\mathbb { R } ^ { d _ { 2 } \\times m }$ , respectively. We are interested in the square loss function which is given by ", + "bbox": [ + 173, + 132, + 825, + 218 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/9f64224187e75567fde7051cf0dc3009d72549775057d4b1072a208802359520.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { L } _ { N } : = \\frac { 1 } { 2 } \\left. \\boldsymbol { A } _ { 2 } \\boldsymbol { \\sigma } ( \\boldsymbol { A } _ { 1 } \\boldsymbol { X } ) - \\boldsymbol { Y } \\right. _ { F } ^ { 2 } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 388, + 223, + 607, + 243 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\sigma$ acts on $\\boldsymbol { A } _ { 1 } \\boldsymbol { X }$ entrywise. Existing studies on nonlinear networks characterized the sufficient conditions for critical points being global minimum Gori $\\&$ Tesi (1992); Nguyen & Hein (2017), established the equivalence between local minimum and global minimum under the condition that $d _ { 0 } = m$ Yu & Chen (1995), and provided understanding of geometric properties of the critical points Tian (2017). In comparison, our results below provide a full characterization of the critical points of $\\mathcal { L } _ { N }$ with $d _ { 1 } = 1$ and critical points of $\\mathcal { L } _ { N }$ over certain parameter space with $d _ { 1 } > 1$ , and show that local minimum of $\\mathcal { L } _ { N }$ that is not global minimum can exist. ", + "bbox": [ + 173, + 247, + 825, + 347 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Since the activation function $\\sigma$ is piecewise linear, the entire parameter space can be partitioned into disjoint cones. In particular, we consider the set of cones ${ \\mathcal { K } } _ { I \\times J }$ where $I \\subset \\{ 1 , \\dots , d _ { 1 } \\} , J \\subset$ $\\{ 1 , \\ldots , m \\}$ that satisfy ", + "bbox": [ + 176, + 352, + 823, + 395 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/9c239bb93a64db45061fdb482835dbba0177603daa987218e786d0e11b974c95.jpg", + "text": "$$\nK _ { I \\times J } : = \\{ ( A _ { 2 } , A _ { 1 } ) : ( A _ { 1 } ) _ { I , : } X _ { : , J } \\geq 0 , { \\mathrm { o t h e r ~ e n t r i e s ~ o f ~ } } A _ { 1 } X < 0 \\} ,\n$$", + "text_format": "latex", + "bbox": [ + 264, + 400, + 727, + 417 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\because$ and $\" < \"$ represent entrywise comparisons. Within ${ \\mathcal { K } } _ { I \\times J }$ , the term $\\sigma ( A _ { 1 } X )$ activates only the entries $\\sigma ( A _ { 1 } \\bar { X } ) _ { I : J }$ , and the corresponding loss function $\\mathcal { L } _ { N }$ is equivalent to ", + "bbox": [ + 173, + 422, + 828, + 452 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/a95dfb0b3bc79a6b3070051ef863f5255b5bf14dc4a80896e205ff1ffe3418f3.jpg", + "text": "$$\n\\begin{array} { r } { \\forall ( { \\pmb A } _ { 2 } , { \\pmb A } _ { 1 } ) \\in { \\pmb K } _ { I \\times J } , \\quad { \\pmb L } _ { N } : = \\frac { 1 } { 2 } \\left\\| ( { \\pmb A } _ { 2 } ) _ { : , I } ( { \\pmb A } _ { 1 } ) _ { I , : } { \\pmb X } _ { : , J } - { \\pmb Y } _ { : , J } \\right\\| _ { F } ^ { 2 } + \\frac { 1 } { 2 } \\left\\| { \\pmb Y } _ { : , J ^ { c } } \\right\\| _ { F } ^ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 233, + 457, + 764, + 479 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Hence, within ${ \\mathcal { K } } _ { I \\times J }$ , $\\mathcal { L } _ { N }$ reduces to the loss of a shallow linear network with parameters $( ( A _ { 2 } ) _ { : , I } , ( A _ { 1 } ) _ { I , : } )$ and input $\\&$ output data pair $( X _ { : , J } , Y _ { : , J } )$ . Note that our results on shallow linear networks in Section 2 are applicable to all parameter dimensions and data matrices. Thus, Theorem 1 fully characterizes the forms of critical points of $\\mathcal { L } _ { N }$ in ${ \\mathcal { K } } _ { I \\times J }$ . Moreover, the existence of such critical points can be analytically examined by substituting their forms into eq. (8). In summary, we obtain the following result, where we denote $\\Sigma _ { J } : = Y _ { : , J } \\bar { X } _ { : , J } ^ { \\dag } X _ { : , J } Y _ { : , J } ^ { \\top }$ with the full singular value decomposition $U _ { J } \\mathbf { \\Lambda } \\mathbf { \\Lambda } _ { J } U _ { J } ^ { \\top } ,$ and suppose that $\\Sigma _ { J }$ has $r ( J )$ distinct positive singular values $\\sigma _ { 1 } ( J ) > \\cdots > \\sigma _ { r ( J ) } ( J )$ with multiplicities $m _ { 1 } , \\ldots , m _ { r ( J ) }$ , respectively, and $\\bar { m } ( J )$ zero singular values. ", + "bbox": [ + 173, + 482, + 825, + 614 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Proposition 6 (Characterization of critical points). All critical points of $\\mathcal { L } _ { N }$ in ${ \\mathcal { K } } _ { I \\times J }$ for any $I \\subset$ $\\{ 1 , \\dots , d _ { 1 } \\} , J \\subset \\{ 1 , \\dots , m \\}$ are necessarily and sufficiently characterized by an $\\pmb { L } _ { 1 } \\in \\mathbb { R } ^ { | I | \\times d _ { 0 } }$ , $a$ block matrix $V \\in \\mathbb { R } ^ { d _ { 2 } \\times | I | }$ and an invertible matrix $C \\in \\mathbb { R } ^ { | I | \\times | I | }$ such that ", + "bbox": [ + 174, + 617, + 825, + 662 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/34270cd4d7f19e518214cffdc2bca1066feb56e9f4b926e20bb031cf90e8084c.jpg", + "text": "$$\n\\begin{array} { r l } & { ( A _ { 1 } ) _ { I , : } = C ^ { - 1 } V ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \\top } V C L _ { 1 } X _ { : , J } X _ { : , J } ^ { \\dagger } , } \\\\ & { ( A _ { 2 } ) _ { : , I } = U _ { J } V C . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 276, + 666, + 720, + 709 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Specifically, $V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r ( J ) } , \\overline { { V } } ) , \\mathbf { 0 } ^ { d _ { 2 } \\times ( | I | - \\mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) ) } ] ,$ , where $V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }$ , $\\overline { { V } } \\in$ $\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( J ) } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) } \\end{array}$ $\\mathbb { R } ^ { \\bar { m } \\times \\bar { p } }$ consist of orthonormal columns with , and $L _ { 1 } , V , C$ $p _ { i } ~ \\leq ~ m _ { i }$ satisfy for $i = 1 , \\ldots , r ( J )$ , $\\bar { p } ~ \\leq ~ \\bar { m }$ such that ", + "bbox": [ + 173, + 713, + 825, + 763 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/593b4247bbc37b54b17d38f817083ce089979c1843415d41aece86de907b8fa8.jpg", + "text": "$$\n\\mathscr { P } _ { \\mathrm { c o l } ( U , V ) ^ { \\perp } } \\mathbf { Y } _ { : , J } \\mathbf { X } _ { : , J } ^ { \\top } \\mathbf { L } _ { 1 } ^ { \\top } C ^ { \\top } \\mathscr { P } _ { \\mathrm { k e r } ( V ) } = \\mathbf { 0 } .\n$$", + "text_format": "latex", + "bbox": [ + 366, + 768, + 635, + 790 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Moreover, a critical point in ${ \\mathcal { K } } _ { I \\times J }$ exists if and only if there exists such $C , V , L _ { 1 }$ that ", + "bbox": [ + 169, + 794, + 738, + 809 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/af14351c56a1043a96e091dd2f1209ae8590de9fb0ce477612b60b9900fe9e60.jpg", + "text": "$$\n( A _ { 1 } ) _ { I , : } X _ { : , J } = C ^ { - 1 } V ^ { \\top } U _ { J } ^ { \\top } Y X _ { : , J } ^ { \\dagger } X _ { : , J } + C ^ { - 1 } ( I - \\mathcal { P } _ { \\mathrm { k e r } ( V ) } ) C L _ { 1 } X _ { : , J } \\geq 0 ,\n$$", + "text_format": "latex", + "bbox": [ + 243, + 814, + 754, + 837 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To further illustrate, we consider a special case where the nonlinear network has one unit in the hidden layer, i.e., $d _ { 1 } = 1$ , in which case $A _ { 1 }$ and $A _ { 2 }$ are row and column vectors, respectively. Then, the entire parameter space can be partitioned into disjoint cones taking the form of ${ \\mathcal { K } } _ { I \\times J }$ , and $I = \\{ 1 \\}$ is the only nontrivial choice. We obtain the following result from Proposition 6. ", + "bbox": [ + 173, + 867, + 825, + 924 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Proposition 7 (Characterization of critical points). Consider $\\mathcal { L } _ { N }$ with $d _ { 1 } ~ = ~ 1$ and any $J \\subset$ $\\{ 1 , \\ldots , m \\}$ . Then, any nonzero critical point of $\\mathcal { L } _ { N }$ within ${ \\mathcal { K } } _ { \\{ 1 \\} \\times J }$ can be necessarily and sufficiently characterized by an $\\boldsymbol { \\ell } _ { 1 } ^ { \\top } \\in \\mathbb { R } ^ { 1 \\times d _ { 0 } }$ , a block unit vector $\\mathbf { v } \\in \\mathbb { R } ^ { d _ { 2 } \\times 1 }$ and a scalar $c \\in \\mathbb { R }$ such that ", + "bbox": [ + 173, + 102, + 823, + 161 + ], + "page_idx": 8 + }, + { + "type": "equation", + "img_path": "images/5986d03d678f1eb9081741d8248755d37e37ba012a1332dbb55e03942e617116.jpg", + "text": "$$\nA _ { 1 } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dag } + \\bar { \\ell } _ { 1 } ^ { \\top } - \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J } X _ { : , J } ^ { \\dag } , \\quad A _ { 2 } = c U _ { J } \\mathbf { v } .\n$$", + "text_format": "latex", + "bbox": [ + 292, + 165, + 705, + 188 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Specifically, v is a unit vector that is supported on the entries corresponding to the same singular value of $\\Sigma _ { J }$ . Moreover, a nonzero critical point in ${ \\mathcal { K } } _ { \\{ 1 \\} \\times J }$ exists if and only if there exist such $c , \\mathbf { v } , \\mathbf { \\nabla } \\theta _ { 1 } ^ { \\top }$ that satisfy ", + "bbox": [ + 174, + 191, + 825, + 237 + ], + "page_idx": 8 + }, + { + "type": "equation", + "img_path": "images/61f830a94553c6fb57ab9d179db39d0edd24f28d7fee4e69d864e370e008dc3a.jpg", + "text": "$$\n\\begin{array} { r l } & { A _ { 1 } X _ { : , J } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J } \\geq 0 , } \\\\ & { A _ { 1 } X _ { : , J ^ { c } } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J ^ { c } } + \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J ^ { c } } - \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J ^ { c } } < 0 . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 253, + 241, + 745, + 289 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We note that Proposition 7 characterizes both the existence and the forms of critical points of $\\mathcal { L } _ { N }$ over the entire parameter space for nonlinear networks with a single hidden unit. The condition in eq. (12) is guaranteed because $\\mathcal { P } _ { \\ker ( \\mathbf { v } ) } = \\mathbf { 0 }$ for $\\mathbf { v } \\neq \\mathbf { 0 }$ . ", + "bbox": [ + 173, + 297, + 825, + 342 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "To further understand Proposition 7, suppose that there exists a critical point in ${ \\mathcal { K } } _ { \\{ 1 \\} \\times J }$ with $\\mathbf { v }$ being supported on the entries that correspond to the $i$ -th singular value of $\\Sigma _ { J }$ . Then, Proposition 1 implies that $\\begin{array} { r } { \\mathcal { L } _ { N } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sigma _ { i } ( J ) } \\end{array}$ . In particular, the critical point achieves the local minimum $\\begin{array} { r } { \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sigma _ { 1 } \\bar { ( \\pmb { J } ) } } \\end{array}$ in ${ \\mathcal { K } } _ { \\{ 1 \\} \\times J }$ with $i = 1$ . This is because in this case the critical point is full rank with an optimal order, and hence corresponds to the global minimum of the linear network in eq. (9). Since the singular values of $\\Sigma _ { J }$ may vary with the choice of $J$ , $\\mathcal { L } _ { N }$ may achieve different local minima in different cones. Thus, local minimum that is not global minimum can exist for $\\mathcal { L } _ { N }$ . The following proposition concludes this fact by considering a concrete example. ", + "bbox": [ + 173, + 347, + 825, + 462 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Proposition 8. For one-hidden-layer nonlinear neural networks with ReLU activation function, there exists local minimum that is not global minimum, and there also exists local maximum. ", + "bbox": [ + 176, + 465, + 821, + 494 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The above proposition is demonstrated by the following example. ", + "bbox": [ + 174, + 505, + 606, + 520 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Example 1. Consider the loss function $\\mathcal { L } _ { N }$ of the nonlinear network with $d _ { 2 } = d _ { 0 } = 2$ , and $d _ { 1 } = 1$ The input and output data are set to be $X = \\mathrm { d i a g } ( 1 , 1 ) , Y = \\mathrm { d i a g } ( 2 , 1 )$ . ", + "bbox": [ + 174, + 523, + 821, + 553 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "First, consider the cone ${ \\mathcal { K } } _ { I \\times J }$ with $I = \\{ 1 \\} , J = \\{ 1 \\}$ . Calculation yields that $\\Sigma _ { J } = \\mathrm { d i a g } ( 4 , 0 )$ , and the conditions for existence of critical points in eqs. (16) and (17) hold if $2 c ^ { - 1 } ( \\mathbf { v } ) _ { 1 , : } \\geq 0 , ( \\ell _ { 1 } ) _ { 2 , : } <$ 0. Then choosing $c = 1 , \\mathbf { v } = ( 1 , 0 ) ^ { \\top } , \\ell _ { 1 } = ( 1 , - 1 ) ^ { \\top }$ yields a local minimum in ${ \\mathcal { K } } _ { I \\times J }$ , because the nonzero entry in $\\mathbf { v }$ corresponds to the largest singular value of $\\Sigma _ { J }$ . Then, calculation shows that the local minimum achieves $\\begin{array} { l } { { \\mathcal { L } } _ { N } ~ = ~ \\frac { 1 } { 2 } } \\end{array}$ . On the other hand, consider the cone ${ \\mathcal { K } } _ { I \\times J ^ { \\prime } }$ with $I = \\{ 1 \\} , J ^ { \\prime } = \\{ 2 \\}$ , in which $\\Sigma _ { J ^ { \\prime } } = \\mathrm { d i a } \\mathbf { \\bar { g } } ( 0 , 1 )$ . The conditions for existence of critical points in eqs. (16) and (17) hold if $c ^ { - 1 } ( \\mathbf { v } ) _ { 1 , : } \\geq 0 , ( \\ell _ { 1 } ) _ { 1 , : } < 0$ . Similarly to the previous case, choosing $c = 1 , \\mathbf { v } = ( 1 , 0 ) ^ { \\top } , \\ell _ { 1 } = ( - 1 , 0 ) ^ { \\top }$ yields a local minimum that achieves the function value $\\mathcal { L } _ { n } = 2$ . Hence, local minimum that is not global minimum does exist. Moreover, in the cone ${ { \\cal { K } } _ { I \\times J ^ { \\prime \\prime } } }$ with $I = \\{ 1 \\} , J ^ { \\prime \\prime } = \\emptyset$ , the function $\\mathcal { L } _ { N }$ remains to be the constant $\\frac { 5 } { 2 }$ , and all points in this cone are local minimum or local maximum. Thus, the landscape of the loss function of nonlinear networks is very different from that of the loss function of linear networks. ", + "bbox": [ + 173, + 561, + 825, + 733 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "CONCLUSION ", + "text_level": 1, + "bbox": [ + 174, + 753, + 289, + 768 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this paper, we provide full characterization of the analytical forms of the critical points for the square loss function of three types of neural networks, namely, shallow linear networks, deep linear networks, and shallow ReLU nonlinear networks. We show that such analytical forms of the critical points have direct implications on the values of the corresponding loss functions, achievement of global minimum, and various landscape properties around these critical points. As a consequence, the loss function for linear networks has no spurious local minimum, while such point does exist for nonlinear networks with ReLU activation. In the future, it is interesting to further explore nonlinear neural networks. In particular, we wish to characterize the analytical form of critical points for deep nonlinear networks and over the full parameter space. Such results will further facilitate the understanding of the landscape properties around these critical points. ", + "bbox": [ + 174, + 784, + 825, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "ACKNOWLEDGMENTS ", + "text_level": 1, + "bbox": [ + 176, + 104, + 328, + 117 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The work was supported in part by US National Science Foundation under the grants CCF-1761506, ECCS-1818904, and was supported in part by DARPA FunLoL program. ", + "bbox": [ + 174, + 127, + 823, + 157 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "REFERENCES \nP. Baldi. Linear learning: Landscapes and algorithms. In Proc. Advances in Neural Information Processing Systems (NIPS), pp. 65–72. 1989. \nP. Baldi and K. Hornik. Neural networks and principal component analysis: Learning from examples without local minima. Neural Networks, 2(1):53 – 58, 1989. \nP. Baldi and Z. Lu. Complex-valued autoencoders. Neural Networks, 33:136–147, September 2012. \nA. Choromanska, M. Henaff, M. Mathieu, G. Arous, and Y. LeCun. The loss surfaces of multilayer networks. Journal of Machine Learning Research, 38:192–204, 2015a. ISSN 1532-4435. \nA. Choromanska, Y. LeCun, and G. Arous. Open problem: The landscape of the loss surfaces of multilayer networks. In Proc. Conference on Learning Theory (COLT), volume 40, pp. 1756– 1760, Jul 2015b. \nY. N. Dauphin, R. Pascanu, C. Gulcehre, K. Cho, S. Ganguli, and Y. Bengio. Identifying and attacking the saddle point problem in high-dimensional non-convex optimization. In Proc. Advances in Neural Information Processing Systems (NIPS). 2014. \nS. Feizi, H. Javadi, J. Zhang, and D. Tse. Porcupine neural networks: (almost) all local optima are global. ArXiv: 1710.02196, October 2017. \nC. D. Freeman and J. Bruna. Topology and geometry of half-rectified network optimization. Proc. International Conference on Learning Representations (ICLR), 2017. \nI. Goodfellow, Y. Bengio, and A. Courville. Deep Learning. MIT Press, 2016. http://www. deeplearningbook.org. \nM. Gori and A. Tesi. On the problem of local minima in backpropagation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(1):76–86, Jan 1992. \nM. Hardt and T. Ma. Identity matters in deep learning. Proc. International Conference on Learning Representations (ICLR), 2017. \nK. Kawaguchi. Deep learning without poor local minima. In Proc. Advances in Neural Information Processing Systems (NIPS), pp. 586–594. 2016. \nS. Li, J. Jiao, Y. Han, and T. Weissman. Demystifying resnet. Arxiv: 1611.01186, 2016a. URL https://arxiv.org/pdf/1611.01186. \nX. Li, Z. Wang, J. Lu, R. Arora, J. Haupt, H. Liu, and T. Zhao. Symmetry, saddle points, and global geometry of nonconvex matrix factorization. ArXiv: 1612.09296v2, December 2016b. \nH. T. Lu and K. Kawaguchi. Depth creates no bad local minima. ArXiv: 1702.08580, February 2017. \nQ. Nguyen and M. Hein. The loss surface of deep and wide neural networks. In Proc. International Conference on Machine Learning (ICML), volume 70, pp. 2603–2612, Aug 2017. \nM. Soltanolkotabi, A. Javanmard, and J. D. Lee. Theoretical insights into the optimization landscape of over-parameterized shallow neural networks. ArXiv:1707.04926, 2017. \nD. Soudry and Y. Carmon. No bad local minima: Data independent training error guarantees for multilayer neural networks. ArXiv: 1605.08361, May 2016. \nD. Soudry and E. Hoffer. Exponentially vanishing sub-optimal local minima in multilayer neural networks. ArXiv:1702.05777, February 2017. \nA. Taghvaei, J. W. Kim, and P. Mehta. How regularization affects the critical points in linear networks. In Proc. International Conference on Neural Information Processing Systems (NIPS), 2017. \nY. Tian. An analytical formula of population gradient for two-layered ReLU network and its applications in convergence and critical point analysis. In Proc. International Conference on Machine Learning (ICML), volume 70, pp. 3404–3413, 06–11 Aug 2017. \nX. H. Yu and G. A. Chen. On the local minima free condition of backpropagation learning. IEEE Transactions on Neural Networks, 6(5):1300–1303, Sep 1995. \nC. Yun, S. Sra, and A. Jadbabaie. Global optimality conditions for deep neural networks. ArXiv: 1707.02444, 2017. \nC. Yun, S. Sra, and A. Jadbabaie. Global optimality conditions for deep neural networks. In Proc. International Conference on Learning Representations (ICLR), 2018. \nK. Zhong, Z. Song, P. Jain, P. L. Bartlett, and I. S. Dhillon. Recovery guarantees for one-hidden-layer neural networks. In Proc. International Conference on Machine Learning (ICML), volume 70, pp. 4140–4149, Aug 2017. \nY. Zhou and Y. Liang. Characterization of gradient dominance and regularity conditions for neural networks. ArXiv: 1710.06910v2, October 2017. ", + "bbox": [ + 169, + 167, + 826, + 926 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 102, + 826, + 401 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Supplementary Materials ", + "text_level": 1, + "bbox": [ + 174, + 98, + 433, + 119 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "PROOF OF THEOREM 1 ", + "bbox": [ + 176, + 138, + 362, + 155 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Notations: For any matrix $M$ , denote $\\mathrm { v e c } ( M )$ as the column vector formed by stacking its columns. Denote the Kronecker product as “ $\\otimes ^ { \\bullet }$ . Then, the following useful relationships hold for any dimension compatible matrices $M , U , V , W$ : ", + "bbox": [ + 174, + 171, + 823, + 214 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/b47babcc8c7986bb42c583d0db1821956e7d7d56831ea4834b770aadea574872.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathrm { v e c } ( U M V ) = ( V ^ { \\top } \\otimes U ) \\mathrm { v e c } ( M ) , } \\\\ & { ( U \\otimes V ) ^ { \\dagger } = U ^ { \\dagger } \\otimes V ^ { \\dagger } , } \\\\ & { ( M \\otimes W ) ( U \\otimes V ) = ( M U ) \\otimes ( W V ) , } \\\\ & { ( M ^ { \\top } M ) ^ { \\dagger } M ^ { \\top } = M ^ { \\top } ( M M ^ { \\top } ) ^ { \\dagger } = M ^ { \\dagger } , } \\\\ & { M M ^ { \\dagger } M = M , M ^ { \\dagger } M M ^ { \\dagger } = M ^ { \\dagger } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 364, + 219, + 630, + 319 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Recall that a point $( A _ { 1 } , A _ { 2 } )$ is a critical point of $\\mathcal { L }$ if it satisfies ", + "bbox": [ + 173, + 333, + 593, + 349 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/05d1c5469c097bbaacea8823a918440157428158e12be62a1e3c6cc350db865d.jpg", + "text": "$$\n\\begin{array} { r } { \\nabla _ { A _ { 1 } } \\mathscr { L } = A _ { 2 } ^ { \\top } ( A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } ) \\boldsymbol { X } ^ { \\top } = \\mathbf { 0 } , } \\\\ { \\nabla _ { A _ { 2 } } \\mathscr { L } = ( A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } ) \\boldsymbol { X } ^ { \\top } A _ { 1 } ^ { \\top } = \\mathbf { 0 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 369, + 354, + 627, + 398 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We first prove eqs. (1) and (2). ", + "bbox": [ + 174, + 402, + 375, + 417 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Lemma 1. Let $\\left( A _ { 2 } , A _ { 1 } \\right)$ be a critical point of $\\mathcal { L }$ . Then it must satisfy, for some $\\pmb { L } _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }$ , that ", + "bbox": [ + 173, + 421, + 821, + 438 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/3704fea18c1e6769b2b1985a7ccc13b9a7bfd2961b03d285dc35161a62d56b79.jpg", + "text": "$$\n\\begin{array} { r l } & { A _ { 1 } = A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } + L _ { 1 } - A _ { 2 } ^ { \\dagger } A _ { 2 } L _ { 1 } X X ^ { \\dagger } , } \\\\ & { \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 334, + 443, + 663, + 486 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Proof of Lemma $^ { l }$ . Since $( A _ { 2 } , A _ { 1 } )$ is a critical point of $\\mathcal { L }$ , eq. (23) implies that ", + "bbox": [ + 173, + 498, + 696, + 515 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/70ab4fe837c4dd1afaec0b928a7179be84996f4f6b938bdcfe3685331dd8ad30.jpg", + "text": "$$\n\\begin{array} { r } { \\pmb { A } _ { 2 } ^ { \\top } \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } = \\pmb { A } _ { 2 } ^ { \\top } \\pmb { Y } \\pmb { X } ^ { \\top } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 403, + 521, + 594, + 541 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Applying the vectorizing operator on both sides of the above equation and use the property in eq. (18), we conclude that ", + "bbox": [ + 173, + 547, + 825, + 577 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/505b51c354c3569f3473e1ec727536c49c20c8df2f2702cb37b3dd44617b4057.jpg", + "text": "$$\n( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) \\mathrm { v e c } ( A _ { 1 } ) = ( X \\otimes A _ { 2 } ^ { \\top } ) \\mathrm { v e c } ( Y ) .\n$$", + "text_format": "latex", + "bbox": [ + 341, + 583, + 655, + 603 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Since $\\mathrm { v e c } ( A _ { 1 } )$ is a solution of the above linear equation, it must take the form of the solution of linear systems, i.e., for some $L _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }$ , we have ", + "bbox": [ + 176, + 609, + 823, + 638 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/f5dfe18301a4f79a569e143be2b5de426c1ae0b0d3b51c7d70a07f1612dde159.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathrm { ~ \\% c c } ( A _ { 1 } ) = ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } ( X \\otimes A _ { 2 } ^ { \\top } ) \\mathrm { v e c } ( Y ) + [ I - ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ] \\mathrm { v e c } ( L _ { 1 } ) } \\\\ & { \\overset { ( i ) } { = } \\left( ( X X ^ { \\top } ) ^ { \\dagger } X \\otimes ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } \\right) \\mathrm { v e c } ( Y ) + [ I - ( X X ^ { \\top } ) ^ { \\dagger } X X ^ { \\top } \\otimes ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } A _ { 2 } ] \\mathrm { v e c } ( L _ { 1 } ) } \\\\ & { = \\mathrm { v e c } \\big ( ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } Y X ^ { \\top } ( X X ^ { \\top } ) ^ { \\dagger } + L _ { 1 } - ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } A _ { 2 } L _ { 1 } X X X ^ { \\top } ( X X ^ { \\top } ) ^ { \\dagger } \\big ) } \\\\ & { \\overset { ( i i ) } { = } \\mathrm { v e c } \\Big ( A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } + L _ { 1 } - A _ { 2 } ^ { \\dagger } A _ { 2 } L _ { 1 } X X ^ { \\dagger } \\Big ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 643, + 828, + 742 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "where (i) uses eqs. (19) and (20) and (ii) uses eq. (21). Then, eq. (25) follows by reshaping the vector into a matrix. ", + "bbox": [ + 173, + 747, + 823, + 776 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Next we prove eq. (26). Multiplying both sides of eq. (25) by $A _ { 2 }$ on the left and by $\\boldsymbol { X }$ on the right and then using eq. (22), we obtain ", + "bbox": [ + 176, + 782, + 820, + 811 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/ab9e3ca891720e4e407ea8d91342b46367341eefcde0876b83b4d1532874b3d9.jpg", + "text": "$$\nA _ { 2 } A _ { 1 } X = A _ { 2 } A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } X = { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { 2 } ) } Y X ^ { \\dagger } X .\n$$", + "text_format": "latex", + "bbox": [ + 336, + 818, + 661, + 840 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Also, multiplying both sides of eq. (24) by $A _ { 2 } ^ { \\top }$ on the right yields that $A _ { \\mathrm { 2 } } A _ { \\mathrm { 1 } } X X ^ { \\top } A _ { \\mathrm { 1 } } ^ { \\top } A _ { \\mathrm { 2 } } ^ { \\top } =$ $Y X ^ { \\top } A _ { 1 } ^ { \\top } A _ { 2 } ^ { \\top }$ . This equation, together with the above expression of $\\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X }$ , further implies that ", + "bbox": [ + 173, + 847, + 828, + 877 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/6aff9b13e25e391318a13ad25f10684ad5891bc89e3ca6d4817289ce615ad234.jpg", + "text": "$$\n\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } .\n$$", + "text_format": "latex", + "bbox": [ + 385, + 885, + 614, + 904 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Note that $\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) }$ is symmetric. Thus, we conclude that $\\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma$ . ", + "bbox": [ + 169, + 909, + 792, + 926 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Next, we derive the form of $A _ { 2 }$ . Recall the full singular value decomposition $\\pmb { \\Sigma } = \\pmb { U } \\pmb { \\Lambda } \\pmb { U } ^ { \\top }$ , where $\\pmb { \\Lambda }$ is a diagonal matrix with distinct singular values $\\sigma _ { 1 } > . . . > \\sigma _ { r } > 0$ and multiplicities $m _ { 1 } , \\ldots , m _ { r }$ , respectively. We also assume that there are $\\bar { m }$ number of zero singular values in $\\pmb { \\Lambda }$ . Using the fact that $\\begin{array} { r } { \\mathcal { P } _ { \\mathrm { c o l } ( \\dot { A } _ { 2 } ) } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top } } \\end{array}$ , the last equality in eq. (26) reduces to ", + "bbox": [ + 173, + 102, + 825, + 161 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/abbd1dc37332e10121c319b7e63fb8d412b2091d1ab6a6de49d0a78d3945bab5.jpg", + "text": "$$\n\\begin{array} { r } { \\mathbf { \\Delta } \\Lambda \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\mathbf { A } _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\mathbf { A } _ { 2 } ) } \\mathbf { \\Lambda } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 397, + 172, + 599, + 190 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "By the multiplicity pattern of the singular values in $\\pmb { \\Lambda }$ , $\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }$ must be block diagonal. Specifically, we can write $\\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } = \\mathrm { d i a g } ( \\mathcal { P } _ { 1 } , \\dots , \\mathcal { P } _ { r } , \\overline { { \\mathcal { P } } } )$ , where $\\mathcal { P } _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times m _ { i } }$ and $\\overline { { \\mathcal { P } } } \\in \\mathbb { R } ^ { \\bar { n } \\times \\bar { m } }$ . Also, since $\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }$ is a projection, $\\mathcal { P } _ { 1 } , \\ldots .$ , $\\mathcal { P } _ { r }$ , $\\overline { { \\mathcal { P } } }$ must all be projections. Note that $\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }$ has rank $\\operatorname { r a n k } ( A _ { 2 } )$ , and suppose that $\\mathcal { P } _ { 1 } , \\ldots .$ , $\\mathcal { P } _ { r }$ , $\\overline { { \\mathcal { P } } }$ have ranks $p _ { 1 } , \\ldots , p _ { r } , \\bar { p }$ , respectively. Then, we must have $p _ { i } \\leq m _ { i }$ for $i = 1 , \\dots , r$ , $\\bar { p } \\leq \\bar { m }$ and ${ \\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( A _ { 2 } ) }$ . Also, note that each projection can be expressed as $\\mathcal { P } _ { i } = V _ { i } V _ { i } ^ { \\top }$ with $V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }$ , $\\overline { { V } } \\in \\mathbb { R } ^ { \\bar { n } \\times \\bar { p } }$ consisting of orthonormal columns. Hence, we can write $\\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } = \\widehat { V } \\widehat { V } ^ { \\top }$ where $\\widehat { V } = \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { V } } )$ . We then conclude that $\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top } = U \\widehat { V } \\widehat { V } ^ { \\top } U ^ { \\top }$ . Thus, $A _ { 2 }$ has the same column space as $\\boldsymbol { U } \\widehat { \\boldsymbol { V } }$ , and there must exist an invertible matrix $C \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 1 } }$ such that ${ \\cal A } _ { 2 } = U [ \\widehat { V } , { \\bf 0 } ] C$ , where $\\mathbf { 0 } \\in \\mathbb { R } ^ { d _ { 2 } \\times ( d _ { 1 } - \\operatorname { r a n k } ( A _ { 2 } ) ) }$ is a zero matrix. Denoting $V = [ \\widehat { V } , \\mathbf { 0 } ]$ , we conclude that $A _ { 2 } = U V C$ . Then, plugging $\\pmb { A } _ { 2 } ^ { \\dagger } = \\pmb { C } ^ { - 1 } \\pmb { V } ^ { \\top } \\pmb { U } ^ { \\top }$ into eq. (25) yields the desired form of $\\pmb { A } _ { 1 }$ . ", + "bbox": [ + 173, + 198, + 826, + 383 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We now prove eq. (3). Note that the above proof is based on the equations $\\nabla _ { A _ { 1 } } \\mathcal { L } = \\mathbf { 0 }$ , $( \\nabla _ { A _ { 2 } } \\mathcal { L } ) A _ { 2 } ^ { \\top } =$ 0. Hence, the forms of $A _ { 1 } , A _ { 2 }$ in eqs. (1) and (2) need to further satisfy $\\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }$ . By eq. (27) and the form of $A _ { 2 }$ , we obtain that $A _ { 2 } A _ { 1 } { \\cal X } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } { \\cal Y } { \\cal X } ^ { \\dagger } { \\cal X } = { \\cal U } { \\cal V } ( { \\bar { U } } { \\cal V } ) ^ { \\top } { \\cal Y } { \\cal X } ^ { \\dagger } { \\cal X }$ . This expression, together with the form of $A _ { 1 }$ in eq. (1), implies that ", + "bbox": [ + 174, + 390, + 825, + 446 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/8ffe76a591b8c1816c45fe9ed3639db7abeb7780e050022cb4be63194369c552.jpg", + "text": "$$\n\\begin{array} { r l } & { A _ { 2 } A _ { 1 } X X ^ { \\top } A _ { 1 } ^ { \\top } = U V ( U V ) ^ { \\top } Y X ^ { \\top } X X ^ { \\top } A _ { 1 } ^ { \\top } } \\\\ & { \\overset { ( i ) } { = } U V ( U V ) ^ { \\top } Y X ^ { \\top } A _ { 1 } ^ { \\top } } \\\\ & { \\quad \\quad = U V ( U V ) ^ { \\top } \\Sigma U V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } } \\\\ & { \\quad \\quad \\quad - U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } } \\\\ & { \\quad \\quad = U V V ^ { \\top } \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) } \\\\ & { \\overset { ( i i ) } { = } U \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 215, + 453, + 782, + 590 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "where (i) uses the fact that $X ^ { \\dag } X X ^ { \\dag } = X ^ { \\dag }$ , (ii) uses the fact that the block pattern of $V$ is compatible with the multiplicity pattern of the singular values in $\\pmb { \\Lambda }$ , and hence $V \\mathbf { \\hat { V } } ^ { \\top } \\mathbf { A } V = \\mathbf { A } V$ . On the other hand, we also obtain that ", + "bbox": [ + 174, + 597, + 825, + 641 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/753117343142fd752eaa24840906e65bc22973b04d450e371bc3e2c85ff9eba8.jpg", + "text": "$$\n\\begin{array} { r } { Y X ^ { \\top } A _ { 1 } ^ { \\top } = \\Sigma U V ( C ^ { \\top } ) ^ { - 1 } + Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) } \\\\ { = U \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 294, + 647, + 702, + 693 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Thus, to satisfy $\\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }$ in eq. (24), we require that ", + "bbox": [ + 176, + 699, + 532, + 715 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/06fc79bca4e35c9d611865d5387590dfc7fd69d123fd76f9569936be1535afbc.jpg", + "text": "$$\n\\begin{array} { r } { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) = \\mathbf { 0 } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 315, + 723, + 681, + 743 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "which is equivalent to ", + "bbox": [ + 174, + 753, + 320, + 767 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/33b9eaf63a1966ce51a15d8841977e324c0f2086f70a59775d2f532431ece670.jpg", + "text": "$$\n\\begin{array} { r } { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } ( I - V ^ { \\top } V ) = \\mathbf { 0 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 339, + 777, + 655, + 797 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Lastly, note that $( I - U V ( U V ) ^ { \\top } ) = \\mathcal { P } _ { \\mathrm { c o l } ( U V ) ^ { \\perp } }$ , and $( I - V ^ { \\top } V ) = { \\mathcal P } _ { \\ker ( V ) }$ , which concludes the proof. ", + "bbox": [ + 174, + 806, + 823, + 838 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "PROOF OF PROPOSITION 1 ", + "text_level": 1, + "bbox": [ + 174, + 861, + 392, + 877 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "By expansion we obtain that $\\begin{array} { r } { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( A _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( A _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { 1 } ^ { \\top } \\pmb { A } _ { 2 } ^ { \\top } ) } \\end{array}$ . Consider any $( A _ { 1 } , A _ { 2 } )$ that satisfies eq. (23), we have shown that such a point also satisfies eq. (27), ", + "bbox": [ + 173, + 892, + 825, + 925 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "which further yields that ", + "bbox": [ + 174, + 103, + 338, + 117 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/d3ea025465808075b15cf80b5235611cc253b57480ea1d8366d0002ccb91a41c.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { 1 } ^ { \\top } \\pmb { A } _ { 2 } ^ { \\top } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } ) + \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\big ) } \\\\ & { \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } ) } \\\\ & { \\overset { ( i i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) } \\pmb { \\Lambda } \\big ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 284, + 121, + 714, + 213 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "where (i) follows from the fact that $\\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\big ) = \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\big )$ , and (ii) uses the fact that $\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) _ { \\perp } } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top }$ . In particular, a critical point $( A _ { 1 } , A _ { 2 } )$ satisfies eq. (28). Moreover, using the form of the critical point $\\mathbf { \\delta } _ { A _ { 2 } } = U V C$ , eq. (28) further becomes ", + "bbox": [ + 178, + 218, + 821, + 263 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/516dff1a256c54bbd471a16eca965bc46fd706224f67f2097259da1979c75d77.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( V C ) } \\mathbf { \\Lambda } \\big ) } \\\\ & { \\quad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( V ^ { \\top } \\mathbf { \\Lambda } \\mathbf { \\Lambda } V \\big ) } \\\\ & { \\quad \\overset { ( i i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\displaystyle \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 372, + 266, + 625, + 354 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "where (i) is due to $\\mathcal { P } _ { \\mathrm { c o l } ( V C ) } = \\mathcal { P } _ { \\mathrm { c o l } ( V ) } = V V ^ { \\top }$ , and (ii) utilizes the block pattern of $V$ and the multiplicity pattern of $\\pmb { \\Lambda }$ that are specified in Theorem 1. ", + "bbox": [ + 173, + 357, + 823, + 388 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "PROOF OF PROPOSITION 2 ", + "text_level": 1, + "bbox": [ + 174, + 407, + 395, + 424 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "(1): Consider a critical point $( A _ { 1 } , A _ { 2 } )$ with the forms given by Theorem 1. By choosing $\\mathbf { L } _ { 1 } = \\mathbf { 0 }$ , the condition in eq. (3) is guaranteed. Then, we can specify a critical point with any $V$ that satisfies the block pattern specified in Theorem 1, i.e., we can choose any $p _ { i } , i \\ = \\ 1 , . . . , r , \\bar { p }$ such that $p _ { i } \\ \\leq \\ m _ { i }$ for $i = 1 , \\ldots , r , \\bar { p } \\leq \\bar { m }$ and $\\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + { \\bar { p } } = \\operatorname { r a n k } ( A _ { 2 } )$ . Suppose that $( A _ { 1 } , A _ { 2 } )$ is a global minimizer, Proposition 1 gives that $\\begin{array} { r } { \\dot { \\mathcal { L } } ( \\bar { \\boldsymbol { A } } _ { 1 } , \\boldsymbol { A } _ { 2 } ) = \\frac { 1 } { 2 } \\mathrm { T r } ( \\boldsymbol { Y } \\boldsymbol { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } } \\end{array}$ . Under the condition that $\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} \\le \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}$ , the global minimum value is achieved by a full rank $A _ { 2 }$ with $\\mathrm { r a n k } ( A _ { 2 } ) = \\mathrm { m i n } \\{ d _ { 2 } , d _ { 1 } \\}$ and $\\begin{array} { r } { p _ { 1 } = m _ { 1 } , \\dotsc , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = \\operatorname { r a n k } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\leq } \\end{array}$ $m _ { k }$ for some $k \\leq r$ . That is, the singular values are selected in a decreasing order to minimize the function value. ", + "bbox": [ + 173, + 436, + 826, + 571 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "(2): If achieve $\\left( A _ { 2 } , A _ { 1 } \\right)$ is aosing inimizefor all $\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { y } , d \\} > \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}$ , the global minimum can berticular, we do not need a full $p _ { i } = m _ { i }$ $i = 1 , \\ldots , r$ $\\bar { p } \\geq 0$ \nrank $A _ { 2 }$ to achieve the global minimum. For example, we can choose $\\begin{array} { r } { \\operatorname { r a n k } ( A _ { 2 } ) = \\sum _ { i = 1 } ^ { r } m _ { i } < } \\end{array}$ \n$\\operatorname* { m i n } \\{ d _ { y } , d \\}$ with $p _ { i } = m _ { i }$ for all $i = 1 , \\dots , r$ and $\\bar { p } = 0$ . ", + "bbox": [ + 173, + 577, + 825, + 635 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "PROOF OF PROPOSITION 3 ", + "text_level": 1, + "bbox": [ + 174, + 654, + 393, + 670 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We first prove item 1. Consider a non-optimal-order critical point $( A _ { 1 } , A _ { 2 } )$ . By Theorem 1, we can write $A _ { \\mathrm { 2 } } = U V C$ where $V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { V } } ) , { \\bf 0 } ]$ and $V _ { i } , i = 1 , \\dots , r , \\overline { { V } }$ consist of orthonormal columns. Define the orthonormal block diagonal matrix ", + "bbox": [ + 173, + 684, + 825, + 729 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/89086882b1e53e581997ce41a0f170a9a2f8eddfc9bcb528222539461012caec.jpg", + "text": "$$\n\\pmb { S } ^ { \\top } : = \\operatorname { d i a g } \\left( \\begin{array} { l } { \\left[ \\pmb { V } _ { 1 } ^ { \\top } \\right] , \\cdots , \\left[ \\pmb { V } _ { r } ^ { \\top } \\right] , } \\\\ { \\left[ \\pmb { O } _ { 1 } ^ { \\top } \\right] } \\end{array} \\left[ \\begin{array} { l } { \\pmb { \\overline { { V } } } ^ { \\top } } \\\\ { \\pmb { \\overline { { O } } } _ { r } ^ { \\top } } \\end{array} \\right] , \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 357, + 732, + 640, + 775 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "where the matrices $O _ { 1 } , \\cdots , O _ { r } , \\overline { { { O } } }$ are such that each diagonal block forms an orthonormal submatrix. By construction we have $\\bar { \\pmb { S } } ^ { \\top } \\pmb { V } = [ \\mathrm { d i a g } ( \\pmb { I } ^ { m _ { 1 } \\times p _ { 1 } } , \\allowbreak \\bar { \\lambda } . . . , \\pmb { I } ^ { m _ { r } \\times p _ { r } } , \\pmb { I } ^ { \\bar { m } \\times \\bar { p } } ) , \\mathbf { 0 } ]$ , where ${ \\cal { I } } ^ { m _ { k } \\times p _ { k } }$ corresponds to the first $p _ { k }$ columns of the identity matrix $I ^ { m _ { k } \\times m _ { k } }$ . Then, $A _ { 2 }$ can be alternatively written as $\\begin{array} { r } { \\pmb { A } _ { 2 } = \\pmb { U } \\pmb { S } \\pmb { S } ^ { \\top } \\pmb { V } \\pmb { C } , } \\end{array}$ . Also, denote the columns of ${ \\pmb U } { \\pmb S }$ as ", + "bbox": [ + 173, + 779, + 825, + 835 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/fe118131e19e36a646c9ae5478ef19f4387ef0052ffd1e75bd2bc504c6a51ac1.jpg", + "text": "$$\nU S = [ \\mathbf { u } _ { 1 1 } ^ { s } , \\ldots , \\mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \\ldots , \\mathbf { u } _ { r 1 } ^ { s } , \\ldots , \\mathbf { u } _ { r p _ { r } } ^ { s } , \\bar { \\mathbf { u } } _ { 1 } ^ { s } , \\ldots , \\bar { \\mathbf { u } } _ { \\bar { p } } ^ { s } ] .\n$$", + "text_format": "latex", + "bbox": [ + 316, + 840, + 679, + 859 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Since $( A _ { 1 } , A _ { 2 } )$ is a non-optimal-order critical point, there exists $1 \\leq i < j \\leq r$ such that $p _ { i } < m _ { i }$ and $p _ { j } > 0$ . Then, consider the following perturbation of ${ \\boldsymbol { U } } { \\boldsymbol { S } }$ for some $\\epsilon > 0$ . ", + "bbox": [ + 176, + 863, + 823, + 891 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/10260925743050a4d7f357fd3e60b939748b669659d07dc381fa8b71d783fb1a.jpg", + "text": "$$\n\\widetilde { M } = \\left[ \\mathbf { u } _ { 1 1 } ^ { s } , \\ldots , \\mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \\ldots , \\frac { \\mathbf { u } _ { j 1 } ^ { s } + \\epsilon \\mathbf { u } _ { i ( p _ { i } + 1 ) } ^ { s } } { \\sqrt { 1 + \\epsilon ^ { 2 } } } , \\ldots \\bar { \\mathbf { u } } _ { 1 } ^ { s } , \\ldots , \\bar { \\mathbf { u } } _ { \\bar { p } } ^ { s } \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 308, + 896, + 687, + 921 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "with which we further define the perturbation matrix ${ \\widetilde A } _ { \\mathrm { 2 } } ~ = ~ { \\widetilde M } S ^ { \\intercal } V C$ . Also, let the perturbation matrix $\\widetilde { A } _ { 1 }$ be generated by eq. (1) with $\\smash { U \\gets \\widetilde { M } }$ and $V S ^ { \\top } V$ . Note that with this construction, $( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )$ satisfies eq. (25), which further implies eq. (27) for $( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )$ , i.e., $\\widetilde { A } _ { 2 } \\widetilde { A } _ { 1 } X = \\mathcal { P } _ { \\mathrm { c o l } ( \\widetilde { A } _ { 2 } ) } Y X ^ { \\dagger } X$ . Thus, eq. (28) holds for the point $( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )$ , and we obtain that ", + "bbox": [ + 171, + 99, + 826, + 171 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/17abaa8a1594cef5136ef67bc611fce2224ded3717a275a6eb42aba5543c0695.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { L } ( \\tilde { A } _ { 2 } , \\tilde { A } _ { 1 } ) = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\tilde { A } _ { 2 } ) } \\Lambda ) } \\\\ & { \\quad \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\tilde { A } _ { 2 } ) } S ^ { \\top } \\Lambda S ) } \\\\ & { \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } S ^ { \\top } \\Lambda S ) } \\\\ & { \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } \\Lambda ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 299, + 179, + 697, + 273 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "where the last equality uses the fact that ${ \\cal S } ^ { \\top } \\pmb { { \\Lambda } } { \\cal S } = \\pmb { { \\Lambda } }$ , as can be observed from the block pattern of $\\pmb { S }$ and the multiplicity pattern of $\\pmb { \\Lambda }$ . Also, by the construction of $\\widetilde { M }$ and the form of $S ^ { \\top } V$ , a careful calculation shows that only the $i , j$ -th diagonal elements of $\\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) }$ have changed, i.e., ", + "bbox": [ + 176, + 280, + 823, + 330 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/8383a141720189e7ec202dfb58c268e5dac4a957927d30cab6362fbbb8df0dc6.jpg", + "text": "$$\n\\left[ \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } \\right] _ { k } = \\left\\{ \\begin{array} { l l } { \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } , } & { \\mathrm { i f ~ } k = i } \\\\ { \\frac { 1 } { 1 + \\epsilon ^ { 2 } } , } & { \\mathrm { i f ~ } k = j } \\end{array} \\right.\n$$", + "text_format": "latex", + "bbox": [ + 357, + 339, + 640, + 382 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "As the index $i , j$ correspond to the singular values $\\sigma _ { i } , \\sigma _ { j }$ , respectively, and $\\sigma _ { i } > \\sigma _ { j }$ , one obtain that ", + "bbox": [ + 173, + 388, + 823, + 405 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/0180113e2d5588f84c55af64ee9b5757f1df51df247f349f52104a2bc9d020fe.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { L } ( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } ) = \\mathcal { L } ( A _ { 2 } , A _ { 1 } ) - \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } ( \\sigma _ { i } - \\sigma _ { j } ) < \\mathcal { L } ( A _ { 2 } , A _ { 1 } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 302, + 412, + 694, + 435 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Thus, the construction of the point $( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } )$ achieves a lower function value for any $\\epsilon > 0$ . Letting $\\epsilon 0$ and noticing that $\\widetilde { M }$ is a perturbation of $_ { U S }$ , the point $( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } )$ can be in an arbitrary neighborhood of $( A _ { 2 } , A _ { 1 } )$ . Lastly, note that $\\mathrm { r a n k } ( \\widetilde { A } _ { 2 } ) = \\mathrm { r a n k } ( A _ { 2 } )$ . This completes the proof of item 1. ", + "bbox": [ + 173, + 445, + 825, + 511 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Next, we prove item 2. Consider an optimal-order critical point $( A _ { 1 } , A _ { 2 } )$ . Then, $A _ { 2 }$ must be non-full rank, since otherwise a full rank $A _ { 2 }$ with optimal order corresponds to a global minimizer ts some e necess. Using t $k \\leq r$ suchm of ressio t q $p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =$ $\\mathrm { r a n k } ( A _ { 2 } ) - \\textstyle \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\ \\leq \\ m _ { k }$ $A _ { 2 }$ $\\mathbf { \\nabla } A _ { 2 } \\ = \\ U V C$ $V =$ $[ \\mathrm { d i a g } ( V _ { 1 } , \\dots , V _ { k } ) , \\mathbf { 0 } ] : = [ V _ { \\mathrm { d i a g } } , \\mathbf { 0 } ]$ ", + "bbox": [ + 173, + 516, + 826, + 592 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/3fe91d1bec98584c30521986ecde66778223b62aae40a67d2bba5d748cc99d12.jpg", + "text": "$$\n\\begin{array} { r } { \\pmb { A } _ { 1 } = C ^ { - 1 } \\Bigg ( [ { \\pmb { U } } _ { \\mathbf { \\mathscr { C } } _ { \\mathbf { i } \\mathrm { i } \\mathbf { a } _ { \\mathbf { g } } } } ] ^ { \\top } { \\pmb { Y } } { \\pmb { X } } ^ { \\dagger } ] + C \\pmb { L } _ { 1 } - [ ( C \\pmb { L } _ { 1 } ) _ { 1 : \\operatorname { r a n k } ( { \\pmb { A } } _ { 2 } ) , : } { \\pmb { X } } { \\pmb { X } } ^ { \\dagger } ] \\Bigg ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 253, + 598, + 743, + 633 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We now specify our perturbation scheme. Recalling the orthonormal matrix $_ { s }$ defined in eq. (29). Then, we consider the following matrices for some $\\epsilon _ { 1 } , \\epsilon _ { 2 } > 0$ ", + "bbox": [ + 171, + 641, + 821, + 670 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/4c1068fdec2f973410986fbc4c67e6ec876f60c3cfec8ab6bdfe4d92c8860cd7.jpg", + "text": "$$\n\\begin{array} { r l } & { \\widetilde { A } _ { 2 } = \\displaystyle [ U V _ { \\mathrm { d i a g } } , \\epsilon _ { 2 } U S _ { : , q } , 0 ] C , \\mathrm { ~ w h e r e ~ } q = \\sum _ { i = 1 } ^ { k - 1 } m _ { i } + p _ { k } + 1 , } \\\\ & { \\widetilde { A } _ { 1 } = C ^ { - 1 } \\bigg ( \\left[ \\begin{array} { c } { ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } Y X ^ { \\dag } } \\\\ { 0 } \\end{array} \\right] + C L _ { 1 } - \\left[ \\begin{array} { c } { ( C L _ { 1 } ) _ { \\mathrm { 1 : r a n k } ( A _ { 2 } ) , : } X X ^ { \\dag } } \\\\ { \\epsilon _ { 1 } ( U S _ { : , q } ) ^ { \\top } Y X ^ { \\dag } } \\\\ { 0 } \\end{array} \\right] \\bigg ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 251, + 678, + 746, + 773 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Our goal is to show that $\\mathcal { L } ( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } ) < \\mathcal { L } ( A _ { 1 } , A _ { 2 } )$ for $\\epsilon _ { 1 } , \\epsilon _ { 2 } 0$ . For this purpose, we need to utilize the condition of critical points in eq. (3), which can be equivalently expressed as ", + "bbox": [ + 174, + 781, + 825, + 813 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/3bc204b39e518d62fe77e04b7c1f235a36318e3792e6bac4d3c92aa985b52d64.jpg", + "text": "$$\n\\begin{array} { r l } & { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } ( I - V ^ { \\top } V ) = 0 } \\\\ { \\stackrel { ( i ) } { \\Leftrightarrow } } & { \\left[ ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X \\right] Y ^ { \\top } ( I - U V ( U V ) ^ { \\top } ) = 0 } \\\\ { \\Leftrightarrow } & { ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \\top } ( I - U V ( U V ) ^ { \\top } ) = 0 } \\\\ { \\stackrel { ( i i ) } { \\Leftrightarrow } } & { ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \\top } ( I - U S _ { : , 1 : ( q - 1 ) } ( U S _ { : , 1 : ( q - 1 ) } ) ^ { \\top } ) = 0 } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 259, + 818, + 738, + 925 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "where (i) follows by taking the transpose and then simplifying, and (ii) uses the fact that $V =$ $S S ^ { \\top } V ~ = ~ S _ { : , 1 : ( q - 1 ) }$ in the case of optimal-order critical point. Calculating the function value at $( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )$ , we obtain that ", + "bbox": [ + 174, + 102, + 825, + 150 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/e33607a6c8d52b4a6d497459a7f102d3b80bb6368573ab813f2278f393b64c1a.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { L } ( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } ) = \\frac { 1 } { 2 } \\| \\underbrace { U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } Y X ^ { \\dag } X } _ { Q } } \\\\ & { \\quad \\quad \\quad + \\underbrace { \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X + \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } Y X ^ { \\dag } X } _ { P } - Y \\| _ { F } ^ { 2 } } \\\\ & { \\quad \\quad \\quad = \\mathcal { L } ( A _ { 1 } , A _ { 2 } ) + \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 210, + 155, + 787, + 257 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We next simplify the above three trace terms using eq. (31). For the first trace term, observe that ", + "bbox": [ + 173, + 261, + 802, + 276 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/31e4304073c36ec1316988b1ba5623629a01b30d1add4a630b7dff4f5e810d04.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathrm { T r } ( P P ^ { \\top } ) = \\mathrm { T r } ( \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \\top } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } + \\mathrm { T r } ( \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\overset { ( i ) } { = } \\mathrm { T r } ( \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \\top } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } + \\mathrm { T r } ( \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } = \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , ) } ^ { \\top } + \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( S _ { : , q } ^ { \\top } \\Lambda S _ { : , q } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 209, + 280, + 794, + 414 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where (i) follows from eq. (31) as $S _ { : , q }$ is orthogonal to the columns of $S _ { : , 1 : ( q - 1 ) }$ . For the second trace term, we obtain that ", + "bbox": [ + 173, + 416, + 825, + 446 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/5e7949cfec7dd2bfcd03a2e116dbee2c11c6dada227b06d86303f493b5d837c7.jpg", + "text": "$$\n\\begin{array} { r l } { 2 \\mathrm { T r } ( P Q ^ { \\top } ) = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } & { } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { \\cdot , q } ( U S _ { \\cdot , q } ) ^ { \\top } \\Sigma U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { \\cdot , q } S _ { \\cdot , q } ^ { \\top } \\Lambda S S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\stackrel { ( i ) } { = } 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } \\sigma _ { k } U S _ { \\cdot , q } \\mathrm { e } _ { 2 } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } \\frac { ( i i i ) } { = } 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } \\mathrm { e } _ { 2 } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 250, + 448, + 745, + 606 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where (i) follows from $\\bar { S } _ { : , q } ^ { \\top } \\Lambda S = \\sigma _ { k } \\mathbf { e } _ { q } ^ { \\top } ,$ and (ii) follows from $\\mathbf { e } _ { q } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } = \\mathbf { 0 }$ . For the third trace term, we obtain that ", + "bbox": [ + 173, + 609, + 825, + 640 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/a7611105db7ab8bbe367611000b4232242cc4ce6522ea7bce5785bb97ecf2131.jpg", + "text": "$$\n\\begin{array} { r l } & { 2 \\mathrm { T r } ( P Y ^ { \\top } ) = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } ) + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma ) } \\\\ & { \\qquad = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } ) + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } S _ { : , q } ^ { \\top } \\Lambda S _ { : , q } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 214, + 642, + 784, + 686 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Combining the expressions for the three trace terms above, we conclude that ", + "bbox": [ + 173, + 689, + 676, + 704 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/968ead3c1915ab73dd92f37c999734c609bcf2f5c20e41f4611777e8a9395c26.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] } \\\\ & { \\qquad = \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) } \\\\ & { \\qquad + \\left( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } ) \\mathrm { T r } ( S _ { \\cdot , q } ^ { \\top } \\Lambda S _ { \\cdot , q } ) \\right. } \\\\ & { \\qquad + \\left. 2 \\epsilon _ { 2 } \\mathrm { T r } ( U S _ { \\cdot , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X Y ^ { \\top } [ U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } - I ] ) \\right. } \\\\ & { \\qquad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) } \\\\ & { \\qquad + \\left( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } \\right) \\mathrm { T r } ( S _ { \\cdot , q } ^ { \\top } \\Lambda S _ { \\cdot , q } ) } \\\\ & { \\qquad = \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) + ( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } ) \\sigma _ { k } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 194, + 709, + 803, + 864 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where (i) follows from eq. (30). Note that the first term in the last equation is nonnegative. Now, letting $\\epsilon _ { 2 } = \\epsilon _ { 1 } ^ { 2 } 0$ , the overall perturbation of the function value becomes ", + "bbox": [ + 169, + 867, + 823, + 896 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/42e21364d016206a3bb613558153b43e66e33b6e7fe6d5545163488b1fb055d8.jpg", + "text": "$$\n\\scriptstyle \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] = { \\mathcal { O } } ( \\epsilon _ { 1 } ^ { 4 } ) - { \\mathcal { O } } ( \\epsilon _ { 1 } ^ { 3 } ) < 0 .\n$$", + "text_format": "latex", + "bbox": [ + 284, + 901, + 714, + 921 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Thus, the constructed perturbation $( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )$ achieves a lower function value, and it can be in an arbitrary neighborhood of $( A _ { 1 } , A _ { 2 } )$ as $\\epsilon _ { 2 } = \\epsilon _ { 1 } ^ { 2 } 0$ . Lastly, note that $\\mathrm { r a n k } ( \\widetilde { A } _ { 2 } ) = \\mathrm { r a n k } ( A _ { 2 } ) + 1$ . Next, we prove item 3. We first introduce a technical lemma. Consider row vectors $\\mathbf { a } ^ { \\top } , \\mathbf { y } ^ { \\top }$ with $\\mathbf { a } ^ { \\intercal } \\neq \\mathbf { 0 }$ . Define the scalar function $\\begin{array} { r } { f ( \\alpha ) = \\frac { 1 } { 2 } \\left\\| \\alpha \\mathbf { a } ^ { \\top } - \\mathbf { y } ^ { \\top } \\right\\| _ { 2 } ^ { 2 } } \\end{array}$ . Then, $f ( \\alpha )$ is strongly convex as $f ^ { \\prime \\prime } ( \\alpha ) = \\left\\| \\mathbf { a } \\right\\| _ { 2 } ^ { 2 } > 0 .$ Thus, the following fact holds due to strong convexity. ", + "bbox": [ + 173, + 101, + 826, + 193 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Fact 1. For any $\\alpha \\in \\mathbb { R }$ , we can identify a perturbation $\\widetilde { \\alpha }$ such that $f ( \\widetilde { \\alpha } ) > f ( \\alpha )$ . ", + "bbox": [ + 173, + 195, + 709, + 212 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Now consider any point $( A _ { 1 } , A _ { 2 } ) \\ \\in \\mathcal { X }$ . Since $A _ { 2 } A _ { 1 } X ~ \\neq ~ \\mathbf { 0 }$ , then there exists a certain row, say, the $i$ -th row $( A _ { 2 } ) _ { i , : } A _ { 1 } X$ , that is nonzero. We then apply the above fact with $\\alpha = 1 , \\mathbf { a } ^ { \\top } =$ $( A _ { 2 } ) _ { i , : } A _ { 1 } \\boldsymbol { X } , \\mathbf { y } ^ { \\intercal } = \\boldsymbol { Y } _ { i , : }$ , and conclude that one can find a perturbation $\\widetilde { \\alpha }$ that achieves a higher function value. Equivalently, one can treat the perturbation of $\\alpha$ eas the perturbation of $( A _ { 2 } ) _ { i , : }$ , i.e., define the perturbation $( \\widetilde { A } _ { 2 } ) _ { i , : } : = \\widetilde { \\alpha } ( A _ { 2 } ) _ { i , : }$ . ", + "bbox": [ + 173, + 220, + 825, + 297 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "PROOF OF THEOREM 3 ", + "text_level": 1, + "bbox": [ + 174, + 316, + 364, + 333 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "We first derive the forms of the parameter matrices. Consider a critical point $( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )$ of $\\mathcal { L } _ { D }$ . By definition of the critical point, we have $\\nabla _ { A _ { k } } \\mathcal { L } _ { D } = 0$ for all $k = 1 , \\dots , \\ell$ , which implies that ", + "bbox": [ + 173, + 347, + 823, + 377 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/c9eae5d9f65c160e4f6d8a9677b28b2cee0bcacbece308a4114dfc6167907256.jpg", + "text": "$$\n\\begin{array} { r } { \\pmb { A } _ { ( \\ell , k + 1 ) } ^ { \\top } \\pmb { A } _ { ( \\ell , k + 1 ) } \\pmb { A } _ { k } \\pmb { A } _ { ( k - 1 , 1 ) } \\pmb { X } ( \\pmb { A } _ { ( k - 1 , 1 ) } \\pmb { X } ) ^ { \\top } = \\pmb { A } _ { ( \\ell , k + 1 ) } ^ { \\top } \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( k - 1 , 1 ) } ^ { \\top } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 256, + 382, + 743, + 404 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Solving this linear system of $\\pmb { A } _ { k }$ , we obtain that, for some $\\pmb { L } _ { k } \\in \\mathbb { R } ^ { d _ { k } \\times d _ { k - 1 } }$ ", + "bbox": [ + 176, + 410, + 665, + 426 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/6d37ffd67b5fe6f17e8474cce01146e8fb5a6e390cbc387ca46e951d1aec84a2.jpg", + "text": "$$\n\\begin{array} { r } { A _ { k } = A _ { ( \\ell , k + 1 ) } ^ { \\dagger } Y ( A _ { ( k - 1 , 1 ) } X ) ^ { \\dagger } + L _ { k } - A _ { ( \\ell , k + 1 ) } ^ { \\dagger } A _ { ( \\ell , k + 1 ) } L _ { k } A _ { ( k - 1 , 1 ) } X ( A _ { ( k - 1 , 1 ) } X ) ^ { \\dagger } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 192, + 431, + 779, + 454 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Multiplying eq. (33) on both sides by $A _ { ( \\ell , k + 1 ) }$ on the left and $A _ { ( k - 1 , 1 ) } X$ on the right and then simplifying, we obtain that for all $k = 1 , \\dots , \\ell - 1$ ", + "bbox": [ + 176, + 458, + 823, + 487 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/b8dda2fd5af24dc7d51ce869f22ea8b3c870a5a6760c9a8aa6e0747b69803bea.jpg", + "text": "$$\nA _ { ( \\ell , 1 ) } \\boldsymbol { X } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } \\boldsymbol { Y } ( A _ { ( k - 1 , 1 ) } \\boldsymbol { X } ) ^ { \\dagger } \\boldsymbol { A } _ { ( k - 1 , 1 ) } \\boldsymbol { X } .\n$$", + "text_format": "latex", + "bbox": [ + 316, + 493, + 681, + 515 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "On the other hand, applying eq. (32) with $k = \\ell$ and multiplying both sides by $A _ { \\ell } ^ { \\top }$ on the right, one obtains that ", + "bbox": [ + 174, + 520, + 825, + 549 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/522a762d4ebdc30a8270901b03eac3eb011258349d6ebed30daaf93516733c24.jpg", + "text": "$$\n\\begin{array} { r } { \\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell , 1 ) } ^ { \\top } = \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell , 1 ) } ^ { \\top } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 385, + 554, + 612, + 575 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "which, together with eq. (34), further implies that for all $k = 1 , \\dots , \\ell - 1$ ", + "bbox": [ + 169, + 580, + 656, + 595 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/bf98b8423e14e22773b48201d2f6884b96cca7cbf0fc58963f1a6353f120c933.jpg", + "text": "$$\n\\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } \\boldsymbol { \\Sigma } _ { k - 1 } \\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } = \\boldsymbol { \\Sigma } _ { k - 1 } \\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } .\n$$", + "text_format": "latex", + "bbox": [ + 312, + 601, + 687, + 621 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Following the same argument as that in the proof of Theorem 1, we conclude that $A _ { ( \\ell , k + 1 ) } =$ $U _ { k - 1 } V _ { k - 1 } C _ { k - 1 }$ , where $U _ { k - 1 } , V _ { k - 1 } , C _ { k - 1 }$ satisfy the conditions that are stated in the theorem. Then, plugging the expression of $\\boldsymbol { A } _ { ( \\ell , k + 1 ) }$ in eq. (33), one obtains the form of $\\pmb { A } _ { k }$ in eq. (4). ", + "bbox": [ + 173, + 625, + 826, + 669 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "We next prove the conditions in eq. (6). Note that the first condition is simply a consistency condition on the matrix products. This is because eq. (36) only provides the forms of the matrices $\\pmb { A } _ { ( \\ell , k + 1 ) } , k = 1 , \\ldots , l - 1$ , which must factorize into the product of individual matrices. For the other condition in eq. (6), note that the proof of eq. (35) uses the weaker condition $( \\nabla _ { { \\pmb A } _ { \\ell } } { \\mathcal { L } } _ { D } ) { \\pmb A } _ { \\ell } ^ { \\top } = { \\bf 0 }$ than the original condittrices must also satisfy $\\nabla _ { A _ { \\ell } } \\mathcal { L } _ { D } = \\mathbf { 0 }$ , e parameter ma- Then, plugging $\\nabla _ { A _ { \\ell } } \\mathcal { L } _ { D } = \\mathbf { 0 }$ $\\begin{array} { r } { \\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } ( \\pmb { A } _ { ( \\ell - 1 , 1 ) } \\pmb { X } ) ^ { \\top } = \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell - 1 , 1 ) } ^ { \\top } . } \\end{array}$ eq. (34) in the above condition and simplifying, one obtains eq. (6). ", + "bbox": [ + 173, + 672, + 825, + 779 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "PROOF OF PROPOSITION 4 ", + "text_level": 1, + "bbox": [ + 174, + 797, + 393, + 814 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Note that by expansion $\\begin{array} { r } { \\mathcal { L } _ { D } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathbf { Y } \\mathbf { Y } ^ { \\top } ) - \\mathrm { T r } ( A _ { ( \\ell , 1 ) } \\mathbf { X } \\mathbf { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( A _ { ( \\ell , 1 ) } \\mathbf { X } \\mathbf { X } ^ { \\top } A _ { ( \\ell , 1 ) } ^ { \\top } ) } \\end{array}$ . For any $A _ { 1 } , \\dotsc , A _ { \\ell }$ that satisfy eq. (32), we have shown that they must satisfy eq. (34) with $k = 1$ , with which we further obtain that ", + "bbox": [ + 173, + 827, + 825, + 875 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/e2a7f3346043cc697a6d0b676ca27bef0700d668719a7705658d9443e90b28eb.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( { \\cal Y } { \\cal Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { ( \\ell , 2 ) } ) } \\Sigma _ { 0 } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( { \\cal Y } { \\cal Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( U _ { 0 } ^ { \\top } A _ { ( \\ell , 2 ) } ) } \\pmb { \\Lambda } _ { 0 } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 352, + 877, + 643, + 924 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Consider a critical point $( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )$ so that eq. (37) holds. Using the form of critical points $\\pmb { A } _ { ( \\ell , 2 ) } = \\pmb { U } _ { 0 } \\pmb { V } _ { 0 } \\pmb { C } _ { 0 }$ , eq. (37) further becomes ", + "bbox": [ + 171, + 102, + 823, + 132 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/604bdc37330ef50367f7e041e5bde79263c8866947b1b4c246d83fadb2c2ce1e.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { V } _ { 0 } \\pmb { C } _ { 0 } ) } \\pmb { \\Lambda } _ { 0 } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { V } _ { 0 } ^ { \\top } \\pmb { \\Lambda } _ { 0 } \\pmb { V } _ { 0 } ) } \\\\ & { \\quad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\displaystyle \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 364, + 138, + 633, + 227 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "where (i) utilizes the block pattern of $V _ { 0 }$ and the multiplicity pattern of $\\mathbf { { \\boldsymbol { \\Lambda } } } _ { 0 }$ that are specified in Theorem 3. ", + "bbox": [ + 173, + 232, + 823, + 261 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "PROOF OF PROPOSITION 5 ", + "text_level": 1, + "bbox": [ + 174, + 280, + 393, + 297 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Observe that the product matrix $\\pmb { A } _ { ( \\ell , 2 ) }$ is equivalent to the class of matrices $B _ { 2 } \\in \\mathbb { R } ^ { \\operatorname* { m i n } \\{ d _ { \\ell } , \\ldots , d _ { 2 } \\} \\times d _ { 1 } }$ . Consider a critical point $( B _ { 2 } , A _ { 1 } )$ of the shallow linear network $\\begin{array} { r } { \\mathcal { L } : = \\frac { 1 } { 2 } \\| B _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\| _ { F } ^ { 2 } } \\end{array}$ . By Proposition 2, we conclude that ", + "bbox": [ + 174, + 310, + 825, + 359 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "• I $\\begin{array} { r } { \\mathrm { f } \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} \\leq \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}$ , then $( A _ { 1 } , B _ { 2 } )$ is a global minimizer if and only if $B _ { 2 }$ is full rank and $\\begin{array} { r } { p _ { 1 } = \\tilde { m _ { 1 } ( 0 ) } , \\dots , p _ { k - 1 } = m _ { k - 1 } ( 0 ) , p _ { k } = \\mathrm { r a n k } ( B _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \\leq } \\end{array}$ $m _ { k } ( 0 )$ for some $k \\leq r ( 0 )$ ; • $\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}$ , thand $( A _ { 1 } , B _ { 2 } )$ is a globaln particular, imizer if and only ifcan be non-full rank with $p _ { i } = m _ { i } ( 0 )$ $\\begin{array} { r } { \\operatorname { r a n k } ( B _ { 2 } ) = \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}$ $i = 1 , \\ldots , r ( 0 )$ . $\\bar { p } ( 0 ) \\geq 0$ $B _ { 2 }$ ", + "bbox": [ + 214, + 369, + 825, + 476 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Note that $\\mathcal { L } _ { D }$ achieves the same global minimum as $\\mathcal { L }$ . Hence Proposition 1 and Proposition 4 must match, which yields that $\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( 0 ) } \\bar { p } _ { i } \\sigma _ { i } ( 0 ) = \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) } \\end{array}$ . We then conclude that $p _ { i } ( 0 ) = p _ { i }$ for as $\\sigma _ { 1 } ( 0 ) > \\cdots > \\sigma _ { r ( 0 ) } ( 0 )$ . This proves the proposition. ", + "bbox": [ + 174, + 484, + 826, + 531 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "PROOF OF THEOREM 4 ", + "text_level": 1, + "bbox": [ + 174, + 549, + 366, + 565 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "The proof is similar to that for shallow linear networks. Consider a deep-non-optimal-order critical point $( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )$ , and define the orthonormal block matrix $S _ { k }$ using the blocks of $V _ { k }$ in a similar way as eq. (29). Then, $\\boldsymbol { A } _ { ( l , k + 2 ) }$ takes the form $A _ { ( l , k + 2 ) } = U _ { k } S _ { k } \\bar { S _ { k } ^ { \\top } } V _ { k } C _ { k }$ . Since $\\boldsymbol { A } _ { ( l , k + 2 ) }$ is of non-optimal order, there exists $\\ : i < j < r ( k ) \\ :$ such that $p _ { i } ( k ) < m _ { i } ( k )$ and $p _ { j } ( k ) > 0$ . Thus, we perturb the j-th column of UkSk to b e usj1+\u000fusi(pi(k)+1)√ 2 , and denote the resulting matrix as Mfk. Then, we perturb $\\pmb { A } _ { \\ell }$ to be $\\widetilde { A } _ { \\ell } = \\widetilde { M } _ { k } ( U _ { k } S _ { k } ) ^ { \\top } A _ { \\ell }$ so that $\\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } = \\widetilde { M } _ { k } S _ { k } ^ { \\top } V _ { k } C _ { k }$ . Moreover, we generate $\\widetilde { A } _ { k + 1 }$ by eq. (4) with $U _ { k } \\gets \\widetilde { M } _ { k } , V _ { k } \\gets S _ { k } ^ { \\top } V _ { k }$ . Note that such construction satisfies eq. (32), and hence also satisfies eq. (34), which further yields that ", + "bbox": [ + 173, + 580, + 826, + 713 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/4a6859b8dd9506421eae5bd7bf75bdb430549e2975b9466b61f972029132bc38.jpg", + "text": "$$\n\\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } \\widetilde { A } _ { k + 1 } A _ { ( k , 1 ) } \\pmb { X } = \\mathcal { P } _ { \\mathrm { c o l } ( \\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } ) } \\pmb { Y } ( A _ { ( k , 1 ) } \\pmb { X } ) ^ { \\dag } A _ { ( k , 1 ) } \\pmb { X } .\n$$", + "text_format": "latex", + "bbox": [ + 250, + 717, + 748, + 742 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "With the above equation, the function value at this perturbed point is evaluated as ", + "bbox": [ + 173, + 747, + 709, + 763 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/c59ef393ace1a1f425b9d6bbb87df3c2dc4c434d49689eab8ecac4b49ffc2a0e.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { L } ( \\widetilde { A } _ { \\ell } , \\dots , \\widetilde { A } _ { k + 1 } , \\dots ) = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( S _ { k } ^ { \\top } \\pmb { U } _ { k } ^ { \\top } \\widetilde { M } _ { k } S _ { k } ^ { \\top } V _ { k } ) } \\pmb { \\Lambda } _ { k } \\big ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 269, + 768, + 725, + 792 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Then, a careful calculation shows that only the i, j-th diagonal elements of Pcol(S>U>MkS>Vk)Λ have changed, and are $\\textstyle { \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } } , { \\frac { 1 } { 1 + \\epsilon ^ { 2 } } }$ , respectively. We then conclude that ", + "bbox": [ + 174, + 797, + 825, + 837 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/8d30dc7291a3703d37514a290115879688892c14e8f76079a999799029d93491.jpg", + "text": "$$\n\\begin{array} { r } { \\mathcal { L } ( A _ { 1 } , \\ldots , \\widetilde { A } _ { k + 1 } , \\ldots , \\widetilde { A } _ { \\ell } ) = \\mathcal { L } ( A _ { 1 } , \\ldots , A _ { \\ell } ) - \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } ( \\sigma _ { i } ( k ) - \\sigma _ { j } ( k ) ) < \\mathcal { L } ( A _ { 1 } , \\ldots , A _ { \\ell } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 200, + 843, + 794, + 866 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Now consider a deep-optimal-order critical point $( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )$ . Note that with $A _ { ( \\ell - 2 , 1 ) }$ fixed to be a constant, the deep linear network reduces to a shallow linear network with parameters $\\left( \\mathbf { 1 } _ { \\ell } , \\mathbf { A } _ { \\ell - 1 } \\right)$ . Since $\\left( \\mathbf { \\boldsymbol { A } } _ { \\ell } , \\mathbf { \\boldsymbol { A } } _ { \\ell - 1 } \\right)$ is not a non-global minimum critical point of this shallow linear network and $\\pmb { A } _ { \\ell }$ is of optimal-order, we can apply the perturbation scheme in the proof of Proposition 3 to identify a perturbation $( \\widetilde { A } _ { \\ell } , \\widetilde { A } _ { \\ell - 1 } )$ with $\\mathrm { \\ddot { r a n k } } ( \\hat { \\tilde { \\mathbf { A } } } _ { \\ell } ) = \\mathrm { r a n k } ( A _ { \\ell } ) + 1$ that achieves a lower function value. ", + "bbox": [ + 174, + 880, + 825, + 925 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "", + "bbox": [ + 169, + 103, + 825, + 135 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Consider any point in $\\mathcal { X } _ { D }$ . Since $\\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } \\neq \\mathbf { 0 }$ , we can scale the nonzero row, say, the $i$ -th row $( A _ { \\ell } ) _ { i , : } A _ { ( \\ell - 1 , 1 ) } X$ properly in the same way as that in the proof of Proposition 3 to increase the function value. Lastly, item 1 and item 2 imply that every local minimum is a global minimum for these two types of critical points. Moreover, combining items 1,2 and 3, we conclude that every critical point of these two types in $\\mathcal { X } _ { D }$ is a saddle point. ", + "bbox": [ + 173, + 141, + 825, + 213 + ], + "page_idx": 18 + } +] \ No newline at end of file diff --git a/parse/train/SysEexbRb/SysEexbRb_middle.json b/parse/train/SysEexbRb/SysEexbRb_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..d8b04ff4279bedc988cce69a85199c14529258c8 --- /dev/null +++ b/parse/train/SysEexbRb/SysEexbRb_middle.json @@ -0,0 +1,67620 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 505, + 98 + ], + "score": 1.0, + "content": "CRITICAL POINTS OF LINEAR NEURAL NETWORKS:", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 99, + 490, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 99, + 490, + 118 + ], + "score": 1.0, + "content": "ANALYTICAL FORMS AND LANDSCAPE PROPERTIES", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 112, + 135, + 323, + 179 + ], + "lines": [ + { + "bbox": [ + 111, + 134, + 225, + 149 + ], + "spans": [ + { + "bbox": [ + 111, + 134, + 225, + 149 + ], + "score": 1.0, + "content": "Yi Zhou & Yingbin Liang", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 111, + 145, + 324, + 160 + ], + "spans": [ + { + "bbox": [ + 111, + 145, + 324, + 160 + ], + "score": 1.0, + "content": "Department of Electrical and Computer Engineering", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 111, + 156, + 219, + 169 + ], + "spans": [ + { + "bbox": [ + 111, + 156, + 219, + 169 + ], + "score": 1.0, + "content": "The Ohio State University", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 112, + 168, + 216, + 180 + ], + "spans": [ + { + "bbox": [ + 112, + 168, + 216, + 180 + ], + "score": 1.0, + "content": "zhou.1172@osu.edu", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "title", + "bbox": [ + 278, + 208, + 333, + 220 + ], + "lines": [ + { + "bbox": [ + 277, + 208, + 335, + 221 + ], + "spans": [ + { + "bbox": [ + 277, + 208, + 335, + 221 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 143, + 234, + 468, + 398 + ], + "lines": [ + { + "bbox": [ + 141, + 233, + 469, + 246 + ], + "spans": [ + { + "bbox": [ + 141, + 233, + 469, + 246 + ], + "score": 1.0, + "content": "Due to the success of deep learning to solving a variety of challenging machine", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 244, + 470, + 258 + ], + "spans": [ + { + "bbox": [ + 141, + 244, + 470, + 258 + ], + "score": 1.0, + "content": "learning tasks, there is a rising interest in understanding loss functions for training", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "score": 1.0, + "content": "neural networks from a theoretical aspect. Particularly, the properties of critical", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 267, + 470, + 279 + ], + "spans": [ + { + "bbox": [ + 141, + 267, + 470, + 279 + ], + "score": 1.0, + "content": "points and the landscape around them are of importance to determine the con-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 278, + 470, + 290 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 470, + 290 + ], + "score": 1.0, + "content": "vergence performance of optimization algorithms. In this paper, we provide a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "score": 1.0, + "content": "necessary and sufficient characterization of the analytical forms for the critical", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 469, + 311 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 469, + 311 + ], + "score": 1.0, + "content": "points (as well as global minimizers) of the square loss functions for linear neural", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 311, + 469, + 322 + ], + "spans": [ + { + "bbox": [ + 141, + 311, + 469, + 322 + ], + "score": 1.0, + "content": "networks. We show that the analytical forms of the critical points characterize the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 321, + 470, + 334 + ], + "spans": [ + { + "bbox": [ + 141, + 321, + 470, + 334 + ], + "score": 1.0, + "content": "values of the corresponding loss functions as well as the necessary and sufficient", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 333, + 470, + 345 + ], + "spans": [ + { + "bbox": [ + 141, + 333, + 470, + 345 + ], + "score": 1.0, + "content": "conditions to achieve global minimum. Furthermore, we exploit the analytical", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 343, + 469, + 355 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 469, + 355 + ], + "score": 1.0, + "content": "forms of the critical points to characterize the landscape properties for the loss", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 353, + 469, + 367 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 469, + 367 + ], + "score": 1.0, + "content": "functions of linear neural networks and shallow ReLU networks. One particu-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 365, + 469, + 378 + ], + "spans": [ + { + "bbox": [ + 141, + 365, + 469, + 378 + ], + "score": 1.0, + "content": "lar conclusion is that: While the loss function of linear networks has no spurious", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 376, + 469, + 388 + ], + "spans": [ + { + "bbox": [ + 141, + 376, + 469, + 388 + ], + "score": 1.0, + "content": "local minimum, the loss function of one-hidden-layer nonlinear networks with", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 387, + 464, + 399 + ], + "spans": [ + { + "bbox": [ + 141, + 387, + 464, + 399 + ], + "score": 1.0, + "content": "ReLU activation function does have local minimum that is not global minimum.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 108, + 420, + 206, + 433 + ], + "lines": [ + { + "bbox": [ + 105, + 419, + 208, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 208, + 436 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 445, + 505, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 446, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 457 + ], + "score": 1.0, + "content": "In the past decade, deep neural networks Goodfellow et al. (2016) have become a popular tool that", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 456, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 470 + ], + "score": 1.0, + "content": "has successfully solved many challenging tasks in a variety of areas such as machine learning, ar-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "score": 1.0, + "content": "tificial intelligence, computer vision, and natural language processing, etc. As the understandings", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 477, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 506, + 491 + ], + "score": 1.0, + "content": "of deep neural networks from different aspects are mostly based on empirical studies, there is a", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 489, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 503 + ], + "score": 1.0, + "content": "rising need and interest to develop understandings of neural networks from theoretical aspects such", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 500, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 104, + 500, + 505, + 514 + ], + "score": 1.0, + "content": "as generalization error, representation power, and landscape (also referred to as geometry) proper-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "ties, etc. In particular, the landscape properties of loss functions (that are typically nonconex for", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "score": 1.0, + "content": "neural networks) play a central role to determine the iteration path and convergence performance of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 206, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 206, + 546 + ], + "score": 1.0, + "content": "optimization algorithms.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 550, + 505, + 649 + ], + "lines": [ + { + "bbox": [ + 106, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "One major landscape property is the nature of critical points, which can possibly be global minima,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "local minima, saddle points. There have been intensive efforts in the past into understanding such an", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "issue for various neural networks. For example, it has been shown that every local minimum of the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "loss function is also a global minimum for shallow linear networks under the autoencoder setting and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "invertibility assumptions Baldi & Hornik (1989) and for deep linear networks Kawaguchi (2016);", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "Lu & Kawaguchi (2017); Yun et al. (2017) respectively under different assumptions. The conditions", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 616, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 505, + 629 + ], + "score": 1.0, + "content": "on the equivalence between local minimum or critical point and global minimum has also been", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "score": 1.0, + "content": "established for various nonlinear neural networks Yu & Chen (1995); Gori & Tesi (1992); Nguyen", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 637, + 473, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 473, + 651 + ], + "score": 1.0, + "content": "& Hein (2017); Soudry & Carmon (2016); Feizi et al. (2017) under respective assumptions.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 655, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "However, most previous studies did not provide characterization of analytical forms for critical", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 104, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "points of loss functions for neural networks with only very few exceptions. In Baldi & Hornik", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "(1989), the authors provided an analytical form for the critical points of the square loss function of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "score": 1.0, + "content": "shallow linear networks under certain conditions. Such an analytical form further helps to establish", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "the landscape properties around the critical points. Further in Li et al. (2016b), the authors charac-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "terized certain sufficient form of critical points for the square loss function of matrix factorization", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 250, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 250, + 733 + ], + "score": 1.0, + "content": "problems and deep linear networks.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 505, + 98 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 505, + 98 + ], + "score": 1.0, + "content": "CRITICAL POINTS OF LINEAR NEURAL NETWORKS:", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 99, + 490, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 99, + 490, + 118 + ], + "score": 1.0, + "content": "ANALYTICAL FORMS AND LANDSCAPE PROPERTIES", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "list", + "bbox": [ + 112, + 135, + 323, + 179 + ], + "lines": [ + { + "bbox": [ + 111, + 134, + 225, + 149 + ], + "spans": [ + { + "bbox": [ + 111, + 134, + 225, + 149 + ], + "score": 1.0, + "content": "Yi Zhou & Yingbin Liang", + "type": "text" + } + ], + "index": 2, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 145, + 324, + 160 + ], + "spans": [ + { + "bbox": [ + 111, + 145, + 324, + 160 + ], + "score": 1.0, + "content": "Department of Electrical and Computer Engineering", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 111, + 156, + 219, + 169 + ], + "spans": [ + { + "bbox": [ + 111, + 156, + 219, + 169 + ], + "score": 1.0, + "content": "The Ohio State University", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 112, + 168, + 216, + 180 + ], + "spans": [ + { + "bbox": [ + 112, + 168, + 216, + 180 + ], + "score": 1.0, + "content": "zhou.1172@osu.edu", + "type": "text" + } + ], + "index": 5, + "is_list_start_line": true + } + ], + "index": 3.5, + "bbox_fs": [ + 111, + 134, + 324, + 180 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 208, + 333, + 220 + ], + "lines": [ + { + "bbox": [ + 277, + 208, + 335, + 221 + ], + "spans": [ + { + "bbox": [ + 277, + 208, + 335, + 221 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 143, + 234, + 468, + 398 + ], + "lines": [ + { + "bbox": [ + 141, + 233, + 469, + 246 + ], + "spans": [ + { + "bbox": [ + 141, + 233, + 469, + 246 + ], + "score": 1.0, + "content": "Due to the success of deep learning to solving a variety of challenging machine", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 244, + 470, + 258 + ], + "spans": [ + { + "bbox": [ + 141, + 244, + 470, + 258 + ], + "score": 1.0, + "content": "learning tasks, there is a rising interest in understanding loss functions for training", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "score": 1.0, + "content": "neural networks from a theoretical aspect. Particularly, the properties of critical", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 267, + 470, + 279 + ], + "spans": [ + { + "bbox": [ + 141, + 267, + 470, + 279 + ], + "score": 1.0, + "content": "points and the landscape around them are of importance to determine the con-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 278, + 470, + 290 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 470, + 290 + ], + "score": 1.0, + "content": "vergence performance of optimization algorithms. In this paper, we provide a", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 300 + ], + "score": 1.0, + "content": "necessary and sufficient characterization of the analytical forms for the critical", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 469, + 311 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 469, + 311 + ], + "score": 1.0, + "content": "points (as well as global minimizers) of the square loss functions for linear neural", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 311, + 469, + 322 + ], + "spans": [ + { + "bbox": [ + 141, + 311, + 469, + 322 + ], + "score": 1.0, + "content": "networks. We show that the analytical forms of the critical points characterize the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 321, + 470, + 334 + ], + "spans": [ + { + "bbox": [ + 141, + 321, + 470, + 334 + ], + "score": 1.0, + "content": "values of the corresponding loss functions as well as the necessary and sufficient", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 333, + 470, + 345 + ], + "spans": [ + { + "bbox": [ + 141, + 333, + 470, + 345 + ], + "score": 1.0, + "content": "conditions to achieve global minimum. Furthermore, we exploit the analytical", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 343, + 469, + 355 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 469, + 355 + ], + "score": 1.0, + "content": "forms of the critical points to characterize the landscape properties for the loss", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 353, + 469, + 367 + ], + "spans": [ + { + "bbox": [ + 141, + 353, + 469, + 367 + ], + "score": 1.0, + "content": "functions of linear neural networks and shallow ReLU networks. One particu-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 365, + 469, + 378 + ], + "spans": [ + { + "bbox": [ + 141, + 365, + 469, + 378 + ], + "score": 1.0, + "content": "lar conclusion is that: While the loss function of linear networks has no spurious", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 376, + 469, + 388 + ], + "spans": [ + { + "bbox": [ + 141, + 376, + 469, + 388 + ], + "score": 1.0, + "content": "local minimum, the loss function of one-hidden-layer nonlinear networks with", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 141, + 387, + 464, + 399 + ], + "spans": [ + { + "bbox": [ + 141, + 387, + 464, + 399 + ], + "score": 1.0, + "content": "ReLU activation function does have local minimum that is not global minimum.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 14, + "bbox_fs": [ + 141, + 233, + 470, + 399 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 420, + 206, + 433 + ], + "lines": [ + { + "bbox": [ + 105, + 419, + 208, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 208, + 436 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 445, + 505, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 446, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 457 + ], + "score": 1.0, + "content": "In the past decade, deep neural networks Goodfellow et al. (2016) have become a popular tool that", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 456, + 506, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 506, + 470 + ], + "score": 1.0, + "content": "has successfully solved many challenging tasks in a variety of areas such as machine learning, ar-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 505, + 480 + ], + "score": 1.0, + "content": "tificial intelligence, computer vision, and natural language processing, etc. As the understandings", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 477, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 506, + 491 + ], + "score": 1.0, + "content": "of deep neural networks from different aspects are mostly based on empirical studies, there is a", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 489, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 506, + 503 + ], + "score": 1.0, + "content": "rising need and interest to develop understandings of neural networks from theoretical aspects such", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 500, + 505, + 514 + ], + "spans": [ + { + "bbox": [ + 104, + 500, + 505, + 514 + ], + "score": 1.0, + "content": "as generalization error, representation power, and landscape (also referred to as geometry) proper-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 524 + ], + "score": 1.0, + "content": "ties, etc. In particular, the landscape properties of loss functions (that are typically nonconex for", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "score": 1.0, + "content": "neural networks) play a central role to determine the iteration path and convergence performance of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 206, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 206, + 546 + ], + "score": 1.0, + "content": "optimization algorithms.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 27, + "bbox_fs": [ + 104, + 446, + 506, + 546 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 550, + 505, + 649 + ], + "lines": [ + { + "bbox": [ + 106, + 551, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 505, + 563 + ], + "score": 1.0, + "content": "One major landscape property is the nature of critical points, which can possibly be global minima,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 573 + ], + "score": 1.0, + "content": "local minima, saddle points. There have been intensive efforts in the past into understanding such an", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "issue for various neural networks. For example, it has been shown that every local minimum of the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "loss function is also a global minimum for shallow linear networks under the autoencoder setting and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 607 + ], + "score": 1.0, + "content": "invertibility assumptions Baldi & Hornik (1989) and for deep linear networks Kawaguchi (2016);", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "Lu & Kawaguchi (2017); Yun et al. (2017) respectively under different assumptions. The conditions", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 616, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 505, + 629 + ], + "score": 1.0, + "content": "on the equivalence between local minimum or critical point and global minimum has also been", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 641 + ], + "score": 1.0, + "content": "established for various nonlinear neural networks Yu & Chen (1995); Gori & Tesi (1992); Nguyen", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 637, + 473, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 473, + 651 + ], + "score": 1.0, + "content": "& Hein (2017); Soudry & Carmon (2016); Feizi et al. (2017) under respective assumptions.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 551, + 506, + 651 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 655, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "However, most previous studies did not provide characterization of analytical forms for critical", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 104, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "points of loss functions for neural networks with only very few exceptions. In Baldi & Hornik", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 689 + ], + "score": 1.0, + "content": "(1989), the authors provided an analytical form for the critical points of the square loss function of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 699 + ], + "score": 1.0, + "content": "shallow linear networks under certain conditions. Such an analytical form further helps to establish", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "the landscape properties around the critical points. Further in Li et al. (2016b), the authors charac-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "terized certain sufficient form of critical points for the square loss function of matrix factorization", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 721, + 250, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 250, + 733 + ], + "score": 1.0, + "content": "problems and deep linear networks.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44, + "bbox_fs": [ + 104, + 655, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 171 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "The focus of this paper is on characterizing the sufficient and necessary forms of critical points for", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "broader scenarios, i.e., shallow and deep linear networks with no assumptions on data matrices and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "network dimensions, and shallow ReLU networks over certain parameter space. In particular, such", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "analytical forms of critical points capture the corresponding loss function values and the necessary", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 127, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 505, + 138 + ], + "score": 1.0, + "content": "and sufficient conditions to achieve global minimum. This further enables us to establish new land-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "score": 1.0, + "content": "scape properties around these critical points for the loss function of these networks under general", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 505, + 162 + ], + "score": 1.0, + "content": "settings, and provides alternative (yet simpler and more intuitive) proofs for existing understanding", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 160, + 218, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 218, + 172 + ], + "score": 1.0, + "content": "of the landscape properties.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 3.5 + }, + { + "type": "title", + "bbox": [ + 108, + 189, + 196, + 200 + ], + "lines": [ + { + "bbox": [ + 106, + 189, + 198, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 198, + 201 + ], + "score": 1.0, + "content": "OUR CONTRIBUTION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 211, + 505, + 321 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 226 + ], + "score": 1.0, + "content": "1) For the square loss function of linear networks with one hidden layer, we provide a full (necessary", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 221, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 236 + ], + "score": 1.0, + "content": "and sufficient) characterization of the analytical forms for its critical points and global minimizers.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 232, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 505, + 246 + ], + "score": 1.0, + "content": "These results generalize the characterization in Baldi & Hornik (1989) to arbitrary network pa-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "rameter dimensions and any data matrices. Such a generalization further enables us to establish", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 505, + 268 + ], + "score": 1.0, + "content": "the landscape property, i.e., every local minimum is also a global minimum and all other critical", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 266, + 506, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 506, + 279 + ], + "score": 1.0, + "content": "points are saddle points, under no assumptions on parameter dimensions and data matrices. From", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 278, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 505, + 290 + ], + "score": 1.0, + "content": "a technical standpoint, we exploit the analytical forms of critical points to provide a new proof for", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 289, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 289, + 505, + 300 + ], + "score": 1.0, + "content": "characterizing the landscape around the critical points under full relaxation of assumptions, where", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 300, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 506, + 312 + ], + "score": 1.0, + "content": "the corresponding approaches in Baldi & Hornik (1989) are not applicable. As a special case of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 310, + 460, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 460, + 324 + ], + "score": 1.0, + "content": "linear networks, the matrix factorization problem satisfies all these landscape properties.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 327, + 505, + 415 + ], + "lines": [ + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "2) For the square loss function of deep linear networks, we establish a full (necessary and sufficient)", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "characterization of the analytical forms for its critical points and global minimizers. Such charac-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "terizations are new and have not been established in the existing art. Furthermore, such analytical", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 360, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 505, + 372 + ], + "score": 1.0, + "content": "form divides the set of non-global-minimum critical points into different categories. We identify the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 371, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 505, + 384 + ], + "score": 1.0, + "content": "directions along which the loss function value decreases for two categories of the critical points, for", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 382, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 505, + 394 + ], + "score": 1.0, + "content": "which our result directly implies the equivalence between the local minimum and the global mini-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "mum. For these cases, our proof generalizes the result in Kawaguchi (2016) under no assumptions", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 405, + 333, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 333, + 415 + ], + "score": 1.0, + "content": "on the network parameter dimensions and data matrices.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 505, + 498 + ], + "lines": [ + { + "bbox": [ + 106, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "3) For the square loss function of one-hidden-layer nonlinear neural networks with ReLU activation", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 433, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 505, + 444 + ], + "score": 1.0, + "content": "function, we provide a full characterization of both the existence and the analytical forms of the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 443, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 505, + 455 + ], + "score": 1.0, + "content": "critical points in certain types of regions in the parameter space. Particularly, in the case where there", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "is one hidden unit, our results fully characterize the existence and the analytical forms of the critical", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 465, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 477 + ], + "score": 1.0, + "content": "points in the entire parameter space. Such characterization were not provided in previous work on", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 476, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 505, + 488 + ], + "score": 1.0, + "content": "nonlinear neural networks. Moreover, we apply our results to a concrete example to demonstrate", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 486, + 501, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 501, + 500 + ], + "score": 1.0, + "content": "that both local minimum that is not a global minimum and local maximum do exist in such a case.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30 + }, + { + "type": "title", + "bbox": [ + 107, + 517, + 178, + 527 + ], + "lines": [ + { + "bbox": [ + 105, + 515, + 180, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 180, + 529 + ], + "score": 1.0, + "content": "RELATED WORK", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "Analytical forms of critical points: Characterizing the analytical form of critical points for loss", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "functions of neural networks dates back to Baldi & Hornik (1989), where the authors provided an", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "analytical form of the critical points for the square loss function of linear networks with one hidden", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "layer. In Li et al. (2016b), the authors provided a sufficient condition of critical points of a generic", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 583, + 506, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 595 + ], + "score": 1.0, + "content": "function, i.e., the fixed point of invariant groups. They then characterized certain sufficient forms of", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "critical points for the square loss function of matrix factorization problems and deep linear networks,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "whereas our results provide sufficient and necessary forms of critical points for deep linear networks", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 616, + 205, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 205, + 629 + ], + "score": 1.0, + "content": "via a different approach.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "Properties of critical points: Baldi & Hornik (1989); Baldi (1989) studied the linear autoencoder", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "with one hidden layer and showed the equivalence between the local minimum and the global min-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "imum. Moreover, Baldi & Lu (2012) generalized these results to the complex-valued autoencoder", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "setting. The deep linear networks were studied by some recent work Kawaguchi (2016); Lu &", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "Kawaguchi (2017); Yun et al. (2018), in which the equivalence between the local minimum and the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "global minimum was established respectively under different assumptions. Particularly, Yun et al.", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "(2017) established a necessary and sufficient condition for a critical point of the deep linear network", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "to be a global minimum. A similar result was established in Freeman & Bruna (2017) for deep linear", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "score": 1.0, + "content": "networks under the setting that the widths of intermediate layers are larger than those of the input", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 47 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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, + 171 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "The focus of this paper is on characterizing the sufficient and necessary forms of critical points for", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "broader scenarios, i.e., shallow and deep linear networks with no assumptions on data matrices and", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 105, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 105, + 505, + 117 + ], + "score": 1.0, + "content": "network dimensions, and shallow ReLU networks over certain parameter space. In particular, such", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "analytical forms of critical points capture the corresponding loss function values and the necessary", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 127, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 505, + 138 + ], + "score": 1.0, + "content": "and sufficient conditions to achieve global minimum. This further enables us to establish new land-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 506, + 150 + ], + "score": 1.0, + "content": "scape properties around these critical points for the loss function of these networks under general", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 505, + 162 + ], + "score": 1.0, + "content": "settings, and provides alternative (yet simpler and more intuitive) proofs for existing understanding", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 160, + 218, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 218, + 172 + ], + "score": 1.0, + "content": "of the landscape properties.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 83, + 506, + 172 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 189, + 196, + 200 + ], + "lines": [ + { + "bbox": [ + 106, + 189, + 198, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 189, + 198, + 201 + ], + "score": 1.0, + "content": "OUR CONTRIBUTION", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 211, + 505, + 321 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 226 + ], + "score": 1.0, + "content": "1) For the square loss function of linear networks with one hidden layer, we provide a full (necessary", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 221, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 236 + ], + "score": 1.0, + "content": "and sufficient) characterization of the analytical forms for its critical points and global minimizers.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 232, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 505, + 246 + ], + "score": 1.0, + "content": "These results generalize the characterization in Baldi & Hornik (1989) to arbitrary network pa-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "rameter dimensions and any data matrices. Such a generalization further enables us to establish", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 255, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 505, + 268 + ], + "score": 1.0, + "content": "the landscape property, i.e., every local minimum is also a global minimum and all other critical", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 266, + 506, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 506, + 279 + ], + "score": 1.0, + "content": "points are saddle points, under no assumptions on parameter dimensions and data matrices. From", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 278, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 505, + 290 + ], + "score": 1.0, + "content": "a technical standpoint, we exploit the analytical forms of critical points to provide a new proof for", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 289, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 289, + 505, + 300 + ], + "score": 1.0, + "content": "characterizing the landscape around the critical points under full relaxation of assumptions, where", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 300, + 506, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 506, + 312 + ], + "score": 1.0, + "content": "the corresponding approaches in Baldi & Hornik (1989) are not applicable. As a special case of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 310, + 460, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 460, + 324 + ], + "score": 1.0, + "content": "linear networks, the matrix factorization problem satisfies all these landscape properties.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 210, + 506, + 324 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 327, + 505, + 415 + ], + "lines": [ + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "2) For the square loss function of deep linear networks, we establish a full (necessary and sufficient)", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "characterization of the analytical forms for its critical points and global minimizers. Such charac-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "terizations are new and have not been established in the existing art. Furthermore, such analytical", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 360, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 505, + 372 + ], + "score": 1.0, + "content": "form divides the set of non-global-minimum critical points into different categories. We identify the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 371, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 505, + 384 + ], + "score": 1.0, + "content": "directions along which the loss function value decreases for two categories of the critical points, for", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 382, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 505, + 394 + ], + "score": 1.0, + "content": "which our result directly implies the equivalence between the local minimum and the global mini-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 394, + 505, + 406 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 505, + 406 + ], + "score": 1.0, + "content": "mum. For these cases, our proof generalizes the result in Kawaguchi (2016) under no assumptions", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 405, + 333, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 333, + 415 + ], + "score": 1.0, + "content": "on the network parameter dimensions and data matrices.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 327, + 505, + 415 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 505, + 498 + ], + "lines": [ + { + "bbox": [ + 106, + 421, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 505, + 433 + ], + "score": 1.0, + "content": "3) For the square loss function of one-hidden-layer nonlinear neural networks with ReLU activation", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 433, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 505, + 444 + ], + "score": 1.0, + "content": "function, we provide a full characterization of both the existence and the analytical forms of the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 443, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 505, + 455 + ], + "score": 1.0, + "content": "critical points in certain types of regions in the parameter space. Particularly, in the case where there", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 505, + 467 + ], + "score": 1.0, + "content": "is one hidden unit, our results fully characterize the existence and the analytical forms of the critical", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 465, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 505, + 477 + ], + "score": 1.0, + "content": "points in the entire parameter space. Such characterization were not provided in previous work on", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 476, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 505, + 488 + ], + "score": 1.0, + "content": "nonlinear neural networks. Moreover, we apply our results to a concrete example to demonstrate", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 486, + 501, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 501, + 500 + ], + "score": 1.0, + "content": "that both local minimum that is not a global minimum and local maximum do exist in such a case.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 421, + 505, + 500 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 517, + 178, + 527 + ], + "lines": [ + { + "bbox": [ + 105, + 515, + 180, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 180, + 529 + ], + "score": 1.0, + "content": "RELATED WORK", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 539, + 505, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "Analytical forms of critical points: Characterizing the analytical form of critical points for loss", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "functions of neural networks dates back to Baldi & Hornik (1989), where the authors provided an", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "analytical form of the critical points for the square loss function of linear networks with one hidden", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "layer. In Li et al. (2016b), the authors provided a sufficient condition of critical points of a generic", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 583, + 506, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 595 + ], + "score": 1.0, + "content": "function, i.e., the fixed point of invariant groups. They then characterized certain sufficient forms of", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "critical points for the square loss function of matrix factorization problems and deep linear networks,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "whereas our results provide sufficient and necessary forms of critical points for deep linear networks", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 616, + 205, + 629 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 205, + 629 + ], + "score": 1.0, + "content": "via a different approach.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 539, + 506, + 629 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "Properties of critical points: Baldi & Hornik (1989); Baldi (1989) studied the linear autoencoder", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "with one hidden layer and showed the equivalence between the local minimum and the global min-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "imum. Moreover, Baldi & Lu (2012) generalized these results to the complex-valued autoencoder", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "setting. The deep linear networks were studied by some recent work Kawaguchi (2016); Lu &", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 506, + 690 + ], + "score": 1.0, + "content": "Kawaguchi (2017); Yun et al. (2018), in which the equivalence between the local minimum and the", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "global minimum was established respectively under different assumptions. Particularly, Yun et al.", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "(2017) established a necessary and sufficient condition for a critical point of the deep linear network", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "to be a global minimum. A similar result was established in Freeman & Bruna (2017) for deep linear", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "score": 1.0, + "content": "networks under the setting that the widths of intermediate layers are larger than those of the input", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "and output layers. The effect of regularization on the critical points for a two-layer linear network", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 257, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 257, + 106 + ], + "score": 1.0, + "content": "was studied in Taghvaei et al. (2017).", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 47, + "bbox_fs": [ + 105, + 633, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 503, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "and output layers. The effect of regularization on the critical points for a two-layer linear network", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 257, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 257, + 106 + ], + "score": 1.0, + "content": "was studied in Taghvaei et al. (2017).", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 109, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "For nonlinear neural networks, Yu & Chen (1995) studied a nonlinear neural network with one hid-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "score": 1.0, + "content": "den layer and sigmoid activation function, and showed that every local minimum is also a global", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "minimum provided that the number of input units equals the number of data samples. Gori & Tesi", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 155 + ], + "score": 1.0, + "content": "(1992) considered a class of multi-layer nonlinear networks with a pyramidal structure, and showed", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 155, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 505, + 166 + ], + "score": 1.0, + "content": "that all critical points of full column rank achieve the zero loss when the sample size is less than the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "score": 1.0, + "content": "input dimension. These results were further generalized to a larger class of nonlinear networks in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 506, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 189 + ], + "score": 1.0, + "content": "Nguyen & Hein (2017), in which they also showed that critical points with non-degenerate Hessian", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "are global minimum. Choromanska et al. (2015a;b) connected the loss surface of deep nonlinear", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 199, + 504, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 504, + 210 + ], + "score": 1.0, + "content": "networks with the Hamiltonian of the spin-glass model under certain assumptions and characterized", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "the distribution of the local minimum. Kawaguchi (2016) further eliminated some of the assump-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 220, + 504, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 504, + 232 + ], + "score": 1.0, + "content": "tions in Choromanska et al. (2015a), and established the equivalence between the local minimum", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "and the global minimum by reducing the loss function of the deep nonlinear network to that of the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 243, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 505, + 254 + ], + "score": 1.0, + "content": "deep linear network. Soudry & Carmon (2016) showed that a two-layer nonlinear network has no", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 505, + 264 + ], + "score": 1.0, + "content": "bad differentiable local minimum. Feizi et al. (2017) studied a one-hidden-layer nonlinear neural", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 264, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 276 + ], + "score": 1.0, + "content": "network with the parameters restricted in a set of directions of lines, and showed that most local", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "minima are global minima. Tian (2017) considered a two-layer ReLU network with Gaussian in-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 286, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 506, + 299 + ], + "score": 1.0, + "content": "put data, and showed that critical points in certain region are non-isolated and characterized the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 296, + 214, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 214, + 310 + ], + "score": 1.0, + "content": "critical-point-free regions.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 327 + ], + "score": 1.0, + "content": "Geometric curvature: Hardt & Ma (2017) established the gradient dominance condition of deep", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 324, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 338 + ], + "score": 1.0, + "content": "linear residual networks, and Zhou & Liang (2017) further established the gradient dominance con-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 335, + 504, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 504, + 347 + ], + "score": 1.0, + "content": "dition and regularity condition around the global minimizers for deep linear, deep linear residual and", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 347, + 504, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 504, + 358 + ], + "score": 1.0, + "content": "shallow nonlinear networks. Li et al. (2016a) studied the property of the Hessian matrix for deep lin-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "ear residual networks. The local strong convexity property was established in Soltanolkotabi et al.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "(2017) for overparameterized nonlinear networks with one hidden layer and quadratic activation", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "functions, and was established in Zhong et al. (2017) for a class of nonlinear networks with one", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 389, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 505, + 403 + ], + "score": 1.0, + "content": "hidden layer and Gaussian input data. Zhong et al. (2017) further established the local linear con-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 402, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 506, + 414 + ], + "score": 1.0, + "content": "vergence of gradient descent method with tensor initialization. Soudry & Hoffer (2017) studied a", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 413, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 505, + 425 + ], + "score": 1.0, + "content": "one-hidden-layer nonlinear network with a single output, and showed that the volume of sub-optimal", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 424, + 504, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 504, + 436 + ], + "score": 1.0, + "content": "differentiable local minima is exponentially vanishing in comparison with the volume of global min-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "ima. Dauphin et al. (2014) investigated the saddle points in deep neural networks using the results", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 444, + 309, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 309, + 459 + ], + "score": 1.0, + "content": "from statistical physics and random matrix theory.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 462, + 505, + 518 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 421, + 475 + ], + "score": 1.0, + "content": "Notation: The pseudoinverse, column space and null space of a matrix", + "type": "text" + }, + { + "bbox": [ + 422, + 462, + 436, + 472 + ], + "score": 0.68, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 460, + 505, + 475 + ], + "score": 1.0, + "content": "are denoted by", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 473, + 504, + 485 + ], + "spans": [ + { + "bbox": [ + 107, + 473, + 161, + 485 + ], + "score": 0.84, + "content": "M ^ { \\dagger } , \\mathrm { c o l } ( M )", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 473, + 181, + 485 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 182, + 473, + 217, + 485 + ], + "score": 0.9, + "content": "\\ker ( M )", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 473, + 358, + 485 + ], + "score": 1.0, + "content": ", respectively. For any index sets", + "type": "text" + }, + { + "bbox": [ + 359, + 473, + 403, + 484 + ], + "score": 0.63, + "content": "I , J \\subset \\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 473, + 408, + 485 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 408, + 473, + 433, + 485 + ], + "score": 0.53, + "content": "M _ { I , J }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 473, + 504, + 485 + ], + "score": 1.0, + "content": "denotes the sub-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 484, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 148, + 496 + ], + "score": 1.0, + "content": "matrix of", + "type": "text" + }, + { + "bbox": [ + 148, + 485, + 162, + 494 + ], + "score": 0.79, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 484, + 354, + 496 + ], + "score": 1.0, + "content": "formed by the entries with the row indices in", + "type": "text" + }, + { + "bbox": [ + 354, + 485, + 361, + 494 + ], + "score": 0.75, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 484, + 473, + 496 + ], + "score": 1.0, + "content": "and the column indices in", + "type": "text" + }, + { + "bbox": [ + 474, + 484, + 481, + 494 + ], + "score": 0.71, + "content": "J", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 484, + 505, + 496 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 495, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 174, + 508 + ], + "score": 1.0, + "content": "positive integers", + "type": "text" + }, + { + "bbox": [ + 175, + 495, + 199, + 506 + ], + "score": 0.9, + "content": "i \\leq j", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 495, + 246, + 508 + ], + "score": 1.0, + "content": ", we define", + "type": "text" + }, + { + "bbox": [ + 246, + 495, + 373, + 507 + ], + "score": 0.93, + "content": "i : j = \\{ i , i + 1 , \\dotsc , j - 1 , j \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 495, + 506, + 508 + ], + "score": 1.0, + "content": ". The projection operator onto a", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 505, + 257, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 170, + 519 + ], + "score": 1.0, + "content": "linear subspace", + "type": "text" + }, + { + "bbox": [ + 170, + 506, + 179, + 516 + ], + "score": 0.77, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 505, + 237, + 519 + ], + "score": 1.0, + "content": "is denoted by", + "type": "text" + }, + { + "bbox": [ + 238, + 506, + 253, + 517 + ], + "score": 0.88, + "content": "{ \\mathcal { P } } _ { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 505, + 257, + 519 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35 + }, + { + "type": "title", + "bbox": [ + 107, + 534, + 415, + 547 + ], + "lines": [ + { + "bbox": [ + 104, + 533, + 417, + 549 + ], + "spans": [ + { + "bbox": [ + 104, + 533, + 417, + 549 + ], + "score": 1.0, + "content": "2 LINEAR NEURAL NETWORKS WITH ONE HIDDEN LAYER", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 559, + 505, + 637 + ], + "lines": [ + { + "bbox": [ + 105, + 559, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 506, + 573 + ], + "score": 1.0, + "content": "In this section, we study linear neural networks with one hidden layer. Suppose we have an input", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 104, + 569, + 507, + 585 + ], + "spans": [ + { + "bbox": [ + 104, + 569, + 155, + 585 + ], + "score": 1.0, + "content": "data matrix", + "type": "text" + }, + { + "bbox": [ + 155, + 570, + 209, + 582 + ], + "score": 0.92, + "content": "\\pmb { X } \\in \\mathbb { R } ^ { d _ { 0 } \\times \\pmb { m } }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 569, + 372, + 585 + ], + "score": 1.0, + "content": "and a corresponding output data matrix", + "type": "text" + }, + { + "bbox": [ + 372, + 571, + 425, + 582 + ], + "score": 0.92, + "content": "\\dot { \\boldsymbol { Y } } \\in \\mathbb { R } ^ { d _ { 2 } ^ { - } \\times m }", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 569, + 507, + 585 + ], + "score": 1.0, + "content": ", where there are in", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 581, + 506, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 127, + 595 + ], + "score": 1.0, + "content": "total", + "type": "text" + }, + { + "bbox": [ + 127, + 584, + 138, + 592 + ], + "score": 0.72, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 581, + 420, + 595 + ], + "score": 1.0, + "content": "data samples. We are interested in learning a model that maps from", + "type": "text" + }, + { + "bbox": [ + 420, + 583, + 432, + 592 + ], + "score": 0.81, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 581, + 444, + 595 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 444, + 582, + 455, + 592 + ], + "score": 0.79, + "content": "\\mathbf { Y }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 581, + 506, + 595 + ], + "score": 1.0, + "content": "via a linear", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 594, + 505, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 605 + ], + "score": 1.0, + "content": "network with one hidden layer. Specifically, we denote the weight parameters between the output", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 601, + 506, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 295, + 617 + ], + "score": 1.0, + "content": "layer and the hidden layer of the network as", + "type": "text" + }, + { + "bbox": [ + 296, + 603, + 357, + 615 + ], + "score": 0.93, + "content": "A _ { 2 } ~ \\in ~ \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 601, + 506, + 617 + ], + "score": 1.0, + "content": ", and denote the weight parameters", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 613, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 360, + 628 + ], + "score": 1.0, + "content": "between the hidden layer and the input layer of the network as", + "type": "text" + }, + { + "bbox": [ + 360, + 614, + 417, + 626 + ], + "score": 0.93, + "content": "A _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 613, + 506, + 628 + ], + "score": 1.0, + "content": ". We are interested in", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 626, + 366, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 366, + 639 + ], + "score": 1.0, + "content": "the square loss function of this linear network, which is given by", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42 + }, + { + "type": "interline_equation", + "bbox": [ + 249, + 644, + 362, + 660 + ], + "lines": [ + { + "bbox": [ + 249, + 644, + 362, + 660 + ], + "spans": [ + { + "bbox": [ + 249, + 644, + 362, + 660 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal { L } : = \\frac { 1 } { 2 } \\left\\| A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\right\\| _ { F } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "8f880d812f03df37336a5ef88339184d8a6484f0a4dfa113221dcd9ca3eec1d0.jpg" + } + ] + } + ], + "index": 46, + "virtual_lines": [ + { + "bbox": [ + 249, + 644, + 362, + 660 + ], + "spans": [], + "index": 46 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 665, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 242, + 677 + ], + "score": 1.0, + "content": "Note that in a special case where", + "type": "text" + }, + { + "bbox": [ + 243, + 666, + 274, + 676 + ], + "score": 0.76, + "content": "X = I", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 666, + 278, + 677 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 279, + 666, + 286, + 676 + ], + "score": 0.73, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "reduces to a loss function for the matrix factorization", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 347, + 689 + ], + "score": 1.0, + "content": "problem, to which all our results apply. The loss function", + "type": "text" + }, + { + "bbox": [ + 347, + 677, + 355, + 687 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "has been studied in Baldi & Hornik", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 104, + 685, + 507, + 701 + ], + "spans": [ + { + "bbox": [ + 104, + 685, + 245, + 701 + ], + "score": 1.0, + "content": "(1989) under the assumptions that", + "type": "text" + }, + { + "bbox": [ + 245, + 688, + 301, + 699 + ], + "score": 0.92, + "content": "d _ { 2 } = d _ { 0 } \\geq d _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 685, + 370, + 701 + ], + "score": 1.0, + "content": "and the matrices", + "type": "text" + }, + { + "bbox": [ + 374, + 687, + 489, + 700 + ], + "score": 0.85, + "content": "X X ^ { \\top } , Y X ^ { \\top } ( X X ^ { \\top } ) ^ { - 1 } X Y ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 685, + 507, + 701 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "score": 1.0, + "content": "invertible. In our study, no assumption is made on either the parameter dimensions or the invertibility", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 709, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 721 + ], + "score": 1.0, + "content": "of the data matrices. Such full generalization of the results in Baldi & Hornik (1989) turns out to be", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 721, + 394, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 394, + 732 + ], + "score": 1.0, + "content": "critical for our study of nonlinear shallow neural networks in Section 4.", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 49.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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": [ + 106, + 82, + 503, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 109, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "For nonlinear neural networks, Yu & Chen (1995) studied a nonlinear neural network with one hid-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 106, + 122, + 505, + 133 + ], + "score": 1.0, + "content": "den layer and sigmoid activation function, and showed that every local minimum is also a global", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "minimum provided that the number of input units equals the number of data samples. Gori & Tesi", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 155 + ], + "score": 1.0, + "content": "(1992) considered a class of multi-layer nonlinear networks with a pyramidal structure, and showed", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 155, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 505, + 166 + ], + "score": 1.0, + "content": "that all critical points of full column rank achieve the zero loss when the sample size is less than the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "score": 1.0, + "content": "input dimension. These results were further generalized to a larger class of nonlinear networks in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 506, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 189 + ], + "score": 1.0, + "content": "Nguyen & Hein (2017), in which they also showed that critical points with non-degenerate Hessian", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "are global minimum. Choromanska et al. (2015a;b) connected the loss surface of deep nonlinear", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 199, + 504, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 504, + 210 + ], + "score": 1.0, + "content": "networks with the Hamiltonian of the spin-glass model under certain assumptions and characterized", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "the distribution of the local minimum. Kawaguchi (2016) further eliminated some of the assump-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 220, + 504, + 232 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 504, + 232 + ], + "score": 1.0, + "content": "tions in Choromanska et al. (2015a), and established the equivalence between the local minimum", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "and the global minimum by reducing the loss function of the deep nonlinear network to that of the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 243, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 505, + 254 + ], + "score": 1.0, + "content": "deep linear network. Soudry & Carmon (2016) showed that a two-layer nonlinear network has no", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 253, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 505, + 264 + ], + "score": 1.0, + "content": "bad differentiable local minimum. Feizi et al. (2017) studied a one-hidden-layer nonlinear neural", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 264, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 276 + ], + "score": 1.0, + "content": "network with the parameters restricted in a set of directions of lines, and showed that most local", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "minima are global minima. Tian (2017) considered a two-layer ReLU network with Gaussian in-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 286, + 506, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 506, + 299 + ], + "score": 1.0, + "content": "put data, and showed that critical points in certain region are non-isolated and characterized the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 296, + 214, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 214, + 310 + ], + "score": 1.0, + "content": "critical-point-free regions.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 110, + 506, + 310 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 106, + 313, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 505, + 327 + ], + "score": 1.0, + "content": "Geometric curvature: Hardt & Ma (2017) established the gradient dominance condition of deep", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 324, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 338 + ], + "score": 1.0, + "content": "linear residual networks, and Zhou & Liang (2017) further established the gradient dominance con-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 335, + 504, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 504, + 347 + ], + "score": 1.0, + "content": "dition and regularity condition around the global minimizers for deep linear, deep linear residual and", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 347, + 504, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 504, + 358 + ], + "score": 1.0, + "content": "shallow nonlinear networks. Li et al. (2016a) studied the property of the Hessian matrix for deep lin-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "ear residual networks. The local strong convexity property was established in Soltanolkotabi et al.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "(2017) for overparameterized nonlinear networks with one hidden layer and quadratic activation", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "functions, and was established in Zhong et al. (2017) for a class of nonlinear networks with one", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 389, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 505, + 403 + ], + "score": 1.0, + "content": "hidden layer and Gaussian input data. Zhong et al. (2017) further established the local linear con-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 402, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 506, + 414 + ], + "score": 1.0, + "content": "vergence of gradient descent method with tensor initialization. Soudry & Hoffer (2017) studied a", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 413, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 505, + 425 + ], + "score": 1.0, + "content": "one-hidden-layer nonlinear network with a single output, and showed that the volume of sub-optimal", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 424, + 504, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 504, + 436 + ], + "score": 1.0, + "content": "differentiable local minima is exponentially vanishing in comparison with the volume of global min-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "ima. Dauphin et al. (2014) investigated the saddle points in deep neural networks using the results", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 444, + 309, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 309, + 459 + ], + "score": 1.0, + "content": "from statistical physics and random matrix theory.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 313, + 506, + 459 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 462, + 505, + 518 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 421, + 475 + ], + "score": 1.0, + "content": "Notation: The pseudoinverse, column space and null space of a matrix", + "type": "text" + }, + { + "bbox": [ + 422, + 462, + 436, + 472 + ], + "score": 0.68, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 460, + 505, + 475 + ], + "score": 1.0, + "content": "are denoted by", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 473, + 504, + 485 + ], + "spans": [ + { + "bbox": [ + 107, + 473, + 161, + 485 + ], + "score": 0.84, + "content": "M ^ { \\dagger } , \\mathrm { c o l } ( M )", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 473, + 181, + 485 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 182, + 473, + 217, + 485 + ], + "score": 0.9, + "content": "\\ker ( M )", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 473, + 358, + 485 + ], + "score": 1.0, + "content": ", respectively. For any index sets", + "type": "text" + }, + { + "bbox": [ + 359, + 473, + 403, + 484 + ], + "score": 0.63, + "content": "I , J \\subset \\mathbb { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 473, + 408, + 485 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 408, + 473, + 433, + 485 + ], + "score": 0.53, + "content": "M _ { I , J }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 473, + 504, + 485 + ], + "score": 1.0, + "content": "denotes the sub-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 484, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 148, + 496 + ], + "score": 1.0, + "content": "matrix of", + "type": "text" + }, + { + "bbox": [ + 148, + 485, + 162, + 494 + ], + "score": 0.79, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 484, + 354, + 496 + ], + "score": 1.0, + "content": "formed by the entries with the row indices in", + "type": "text" + }, + { + "bbox": [ + 354, + 485, + 361, + 494 + ], + "score": 0.75, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 484, + 473, + 496 + ], + "score": 1.0, + "content": "and the column indices in", + "type": "text" + }, + { + "bbox": [ + 474, + 484, + 481, + 494 + ], + "score": 0.71, + "content": "J", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 484, + 505, + 496 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 495, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 174, + 508 + ], + "score": 1.0, + "content": "positive integers", + "type": "text" + }, + { + "bbox": [ + 175, + 495, + 199, + 506 + ], + "score": 0.9, + "content": "i \\leq j", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 495, + 246, + 508 + ], + "score": 1.0, + "content": ", we define", + "type": "text" + }, + { + "bbox": [ + 246, + 495, + 373, + 507 + ], + "score": 0.93, + "content": "i : j = \\{ i , i + 1 , \\dotsc , j - 1 , j \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 495, + 506, + 508 + ], + "score": 1.0, + "content": ". The projection operator onto a", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 505, + 257, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 505, + 170, + 519 + ], + "score": 1.0, + "content": "linear subspace", + "type": "text" + }, + { + "bbox": [ + 170, + 506, + 179, + 516 + ], + "score": 0.77, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 505, + 237, + 519 + ], + "score": 1.0, + "content": "is denoted by", + "type": "text" + }, + { + "bbox": [ + 238, + 506, + 253, + 517 + ], + "score": 0.88, + "content": "{ \\mathcal { P } } _ { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 505, + 257, + 519 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 460, + 506, + 519 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 534, + 415, + 547 + ], + "lines": [ + { + "bbox": [ + 104, + 533, + 417, + 549 + ], + "spans": [ + { + "bbox": [ + 104, + 533, + 417, + 549 + ], + "score": 1.0, + "content": "2 LINEAR NEURAL NETWORKS WITH ONE HIDDEN LAYER", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 559, + 505, + 637 + ], + "lines": [ + { + "bbox": [ + 105, + 559, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 506, + 573 + ], + "score": 1.0, + "content": "In this section, we study linear neural networks with one hidden layer. Suppose we have an input", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 104, + 569, + 507, + 585 + ], + "spans": [ + { + "bbox": [ + 104, + 569, + 155, + 585 + ], + "score": 1.0, + "content": "data matrix", + "type": "text" + }, + { + "bbox": [ + 155, + 570, + 209, + 582 + ], + "score": 0.92, + "content": "\\pmb { X } \\in \\mathbb { R } ^ { d _ { 0 } \\times \\pmb { m } }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 569, + 372, + 585 + ], + "score": 1.0, + "content": "and a corresponding output data matrix", + "type": "text" + }, + { + "bbox": [ + 372, + 571, + 425, + 582 + ], + "score": 0.92, + "content": "\\dot { \\boldsymbol { Y } } \\in \\mathbb { R } ^ { d _ { 2 } ^ { - } \\times m }", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 569, + 507, + 585 + ], + "score": 1.0, + "content": ", where there are in", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 581, + 506, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 127, + 595 + ], + "score": 1.0, + "content": "total", + "type": "text" + }, + { + "bbox": [ + 127, + 584, + 138, + 592 + ], + "score": 0.72, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 581, + 420, + 595 + ], + "score": 1.0, + "content": "data samples. We are interested in learning a model that maps from", + "type": "text" + }, + { + "bbox": [ + 420, + 583, + 432, + 592 + ], + "score": 0.81, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 581, + 444, + 595 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 444, + 582, + 455, + 592 + ], + "score": 0.79, + "content": "\\mathbf { Y }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 581, + 506, + 595 + ], + "score": 1.0, + "content": "via a linear", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 594, + 505, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 605 + ], + "score": 1.0, + "content": "network with one hidden layer. Specifically, we denote the weight parameters between the output", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 601, + 506, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 295, + 617 + ], + "score": 1.0, + "content": "layer and the hidden layer of the network as", + "type": "text" + }, + { + "bbox": [ + 296, + 603, + 357, + 615 + ], + "score": 0.93, + "content": "A _ { 2 } ~ \\in ~ \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 601, + 506, + 617 + ], + "score": 1.0, + "content": ", and denote the weight parameters", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 613, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 360, + 628 + ], + "score": 1.0, + "content": "between the hidden layer and the input layer of the network as", + "type": "text" + }, + { + "bbox": [ + 360, + 614, + 417, + 626 + ], + "score": 0.93, + "content": "A _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 613, + 506, + 628 + ], + "score": 1.0, + "content": ". We are interested in", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 626, + 366, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 626, + 366, + 639 + ], + "score": 1.0, + "content": "the square loss function of this linear network, which is given by", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 42, + "bbox_fs": [ + 104, + 559, + 507, + 639 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 249, + 644, + 362, + 660 + ], + "lines": [ + { + "bbox": [ + 249, + 644, + 362, + 660 + ], + "spans": [ + { + "bbox": [ + 249, + 644, + 362, + 660 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal { L } : = \\frac { 1 } { 2 } \\left\\| A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\right\\| _ { F } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "8f880d812f03df37336a5ef88339184d8a6484f0a4dfa113221dcd9ca3eec1d0.jpg" + } + ] + } + ], + "index": 46, + "virtual_lines": [ + { + "bbox": [ + 249, + 644, + 362, + 660 + ], + "spans": [], + "index": 46 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 665, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 242, + 677 + ], + "score": 1.0, + "content": "Note that in a special case where", + "type": "text" + }, + { + "bbox": [ + 243, + 666, + 274, + 676 + ], + "score": 0.76, + "content": "X = I", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 666, + 278, + 677 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 279, + 666, + 286, + 676 + ], + "score": 0.73, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "reduces to a loss function for the matrix factorization", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 347, + 689 + ], + "score": 1.0, + "content": "problem, to which all our results apply. The loss function", + "type": "text" + }, + { + "bbox": [ + 347, + 677, + 355, + 687 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "has been studied in Baldi & Hornik", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 104, + 685, + 507, + 701 + ], + "spans": [ + { + "bbox": [ + 104, + 685, + 245, + 701 + ], + "score": 1.0, + "content": "(1989) under the assumptions that", + "type": "text" + }, + { + "bbox": [ + 245, + 688, + 301, + 699 + ], + "score": 0.92, + "content": "d _ { 2 } = d _ { 0 } \\geq d _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 685, + 370, + 701 + ], + "score": 1.0, + "content": "and the matrices", + "type": "text" + }, + { + "bbox": [ + 374, + 687, + 489, + 700 + ], + "score": 0.85, + "content": "X X ^ { \\top } , Y X ^ { \\top } ( X X ^ { \\top } ) ^ { - 1 } X Y ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 685, + 507, + 701 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "score": 1.0, + "content": "invertible. In our study, no assumption is made on either the parameter dimensions or the invertibility", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 709, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 721 + ], + "score": 1.0, + "content": "of the data matrices. Such full generalization of the results in Baldi & Hornik (1989) turns out to be", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 106, + 721, + 394, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 394, + 732 + ], + "score": 1.0, + "content": "critical for our study of nonlinear shallow neural networks in Section 4.", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 49.5, + "bbox_fs": [ + 104, + 666, + 507, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 181, + 95 + ], + "score": 1.0, + "content": "We further define", + "type": "text" + }, + { + "bbox": [ + 181, + 82, + 258, + 93 + ], + "score": 0.92, + "content": "\\Sigma : = Y X ^ { \\dagger } X Y ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 80, + 470, + 95 + ], + "score": 1.0, + "content": "and denote its full singular value decomposition as", + "type": "text" + }, + { + "bbox": [ + 470, + 81, + 501, + 93 + ], + "score": 0.88, + "content": "U \\pmb { \\Lambda } U ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 80, + 505, + 95 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 163, + 107 + ], + "score": 1.0, + "content": "Suppose that", + "type": "text" + }, + { + "bbox": [ + 163, + 94, + 173, + 104 + ], + "score": 0.79, + "content": "\\pmb { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 92, + 191, + 107 + ], + "score": 1.0, + "content": "has", + "type": "text" + }, + { + "bbox": [ + 192, + 96, + 198, + 104 + ], + "score": 0.74, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 92, + 333, + 107 + ], + "score": 1.0, + "content": "distinct positive singular values", + "type": "text" + }, + { + "bbox": [ + 334, + 94, + 426, + 105 + ], + "score": 0.89, + "content": "\\sigma _ { 1 } > \\cdots > \\sigma _ { r } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 92, + 506, + 107 + ], + "score": 1.0, + "content": "with multiplicities", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 107, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 107, + 106, + 156, + 116 + ], + "score": 0.89, + "content": "m _ { 1 } , \\ldots , m _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 104, + 246, + 117 + ], + "score": 1.0, + "content": ", respectively, and has", + "type": "text" + }, + { + "bbox": [ + 247, + 106, + 257, + 114 + ], + "score": 0.79, + "content": "\\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 104, + 392, + 117 + ], + "score": 1.0, + "content": "zero singular values. Recall that", + "type": "text" + }, + { + "bbox": [ + 393, + 105, + 431, + 116 + ], + "score": 0.91, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "is defined to be a", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 171, + 128 + ], + "score": 1.0, + "content": "critical point of", + "type": "text" + }, + { + "bbox": [ + 171, + 116, + 180, + 126 + ], + "score": 0.84, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 114, + 190, + 128 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 190, + 115, + 288, + 127 + ], + "score": 0.89, + "content": "\\nabla _ { A _ { 1 } } \\mathcal { L } = \\mathbf { 0 } , \\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 114, + 505, + 128 + ], + "score": 1.0, + "content": ". Our first result provides a full characterization of all", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 126, + 186, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 126, + 174, + 139 + ], + "score": 1.0, + "content": "critical points of", + "type": "text" + }, + { + "bbox": [ + 174, + 127, + 182, + 136 + ], + "score": 0.8, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 126, + 186, + 139 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 140, + 503, + 174 + ], + "lines": [ + { + "bbox": [ + 106, + 139, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 394, + 154 + ], + "score": 1.0, + "content": "Theorem 1 (Characterization of critical points). All critical points of", + "type": "text" + }, + { + "bbox": [ + 394, + 141, + 402, + 151 + ], + "score": 0.75, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 139, + 505, + 154 + ], + "score": 1.0, + "content": "are necessarily and suf-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 149, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 104, + 149, + 249, + 164 + ], + "score": 1.0, + "content": "ficiently characterized by a matrix", + "type": "text" + }, + { + "bbox": [ + 249, + 151, + 307, + 163 + ], + "score": 0.92, + "content": "\\pmb { L } _ { 1 } \\in \\overline { { \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 149, + 375, + 164 + ], + "score": 1.0, + "content": ", a block matrix", + "type": "text" + }, + { + "bbox": [ + 375, + 151, + 430, + 162 + ], + "score": 0.92, + "content": "V ~ \\in \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 149, + 506, + 164 + ], + "score": 1.0, + "content": "and an invertible", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 160, + 206, + 176 + ], + "spans": [ + { + "bbox": [ + 104, + 160, + 135, + 176 + ], + "score": 1.0, + "content": "matrix", + "type": "text" + }, + { + "bbox": [ + 136, + 162, + 187, + 173 + ], + "score": 0.92, + "content": "C \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 160, + 206, + 176 + ], + "score": 1.0, + "content": "via", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 176, + 416, + 206 + ], + "lines": [ + { + "bbox": [ + 194, + 176, + 416, + 206 + ], + "spans": [ + { + "bbox": [ + 194, + 176, + 416, + 206 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { A _ { 1 } = C ^ { - 1 } V ^ { \\top } U ^ { \\top } Y X ^ { \\dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \\top } V C L _ { 1 } X X ^ { \\dagger } } \\\\ & { A _ { 2 } = U V C . } \\end{array}", + "type": "interline_equation", + "image_path": "cf57a2f3dbeac390e8a075192901965861703b9fd84ce2ff59a701d9ab01d928.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 194, + 176, + 416, + 191.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 194, + 191.0, + 416, + 206.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 209, + 505, + 246 + ], + "lines": [ + { + "bbox": [ + 104, + 208, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 104, + 208, + 157, + 225 + ], + "score": 1.0, + "content": "Specifically,", + "type": "text" + }, + { + "bbox": [ + 158, + 210, + 353, + 224 + ], + "score": 0.83, + "content": "V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { { V } } } ) , \\mathbf { 0 } ^ { d _ { 2 } \\times ( d _ { 1 } - \\mathrm { r a n k } ( { \\bf A } _ { 2 } ) ) } ] ,", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 208, + 405, + 225 + ], + "score": 1.0, + "content": ", where both", + "type": "text" + }, + { + "bbox": [ + 405, + 211, + 462, + 223 + ], + "score": 0.91, + "content": "V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 208, + 483, + 225 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 483, + 210, + 505, + 223 + ], + "score": 0.87, + "content": "\\overline { { V } } \\in", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 220, + 504, + 236 + ], + "spans": [ + { + "bbox": [ + 107, + 222, + 133, + 232 + ], + "score": 0.89, + "content": "\\bar { \\mathbb { R } } ^ { \\bar { m } \\times \\bar { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 220, + 380, + 236 + ], + "score": 1.0, + "content": "consist of orthonormal columns with the number of columns", + "type": "text" + }, + { + "bbox": [ + 381, + 223, + 504, + 234 + ], + "score": 0.9, + "content": "p _ { i } \\leq m _ { i } , i = 1 , . . . , r , \\bar { p } \\leq \\bar { m }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 232, + 343, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 145, + 248 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 145, + 234, + 251, + 246 + ], + "score": 0.92, + "content": "{ \\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( A _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 232, + 272, + 248 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 273, + 234, + 313, + 245 + ], + "score": 0.91, + "content": "L _ { 1 } , V , C", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 232, + 343, + 248 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 249, + 380, + 266 + ], + "lines": [ + { + "bbox": [ + 232, + 249, + 380, + 266 + ], + "spans": [ + { + "bbox": [ + 232, + 249, + 380, + 266 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( U V ) ^ { \\perp } } \\mathbf { { \\mathit { Y X } } ^ { \\top } } \\mathbf { { \\mathit { L } } _ { 1 } ^ { \\top } } \\mathbf { { \\mathit { C } } ^ { \\top } } \\mathcal { P } _ { \\mathrm { k e r } ( V ) } = \\mathbf { { 0 } } .", + "type": "interline_equation", + "image_path": "71cd6575cde5b5179045518c47223bc46b5f2534c4ef25cf9e1f1c3f818d3cc1.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 232, + 249, + 380, + 266 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 274, + 504, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 273, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 446, + 287 + ], + "score": 1.0, + "content": "Theorem 1 characterizes the necessary and sufficient forms for all critical points of", + "type": "text" + }, + { + "bbox": [ + 446, + 275, + 453, + 284 + ], + "score": 0.79, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 273, + 505, + 287 + ], + "score": 1.0, + "content": ". Intuitively,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 504, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 151, + 298 + ], + "score": 1.0, + "content": "the matrix", + "type": "text" + }, + { + "bbox": [ + 151, + 286, + 161, + 295 + ], + "score": 0.79, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 285, + 319, + 298 + ], + "score": 1.0, + "content": "captures the invariance of the product", + "type": "text" + }, + { + "bbox": [ + 320, + 285, + 347, + 297 + ], + "score": 0.92, + "content": "\\mathbf { A } _ { 2 } \\mathbf { A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 285, + 490, + 298 + ], + "score": 1.0, + "content": "under an invertible transform, and", + "type": "text" + }, + { + "bbox": [ + 491, + 286, + 504, + 297 + ], + "score": 0.88, + "content": "\\mathbf { L } _ { 1 }", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 296, + 383, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 383, + 309 + ], + "score": 1.0, + "content": "captures the degree of freedom of the solution set for linear systems.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 312, + 505, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "In general, the set of critical points is uncountable and cannot be fully listed out. However, the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 323, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 104, + 323, + 439, + 338 + ], + "score": 1.0, + "content": "analytical forms in eqs. (1) and (2) do allow one to construct some critical points of", + "type": "text" + }, + { + "bbox": [ + 440, + 325, + 448, + 334 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 323, + 506, + 338 + ], + "score": 1.0, + "content": "by specifying", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 334, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 150, + 348 + ], + "score": 1.0, + "content": "choices of", + "type": "text" + }, + { + "bbox": [ + 150, + 335, + 190, + 347 + ], + "score": 0.91, + "content": "L _ { 1 } , V , C", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 334, + 425, + 348 + ], + "score": 1.0, + "content": "that fulfill the condition in eq. (3). For example, choosing", + "type": "text" + }, + { + "bbox": [ + 426, + 336, + 459, + 346 + ], + "score": 0.89, + "content": "\\mathbf { L } _ { 1 } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 334, + 506, + 348 + ], + "score": 1.0, + "content": "guarantees", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 344, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 104, + 344, + 348, + 359 + ], + "score": 1.0, + "content": "eq. (3), in which case eqs. (1) and (2) yield a critical point", + "type": "text" + }, + { + "bbox": [ + 349, + 345, + 457, + 357 + ], + "score": 0.86, + "content": "( C ^ { - \\mathrm { i } } V ^ { \\dagger } U ^ { \\top } Y X ^ { \\dagger } , U V C )", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 344, + 505, + 359 + ], + "score": 1.0, + "content": "for any in-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 356, + 506, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 168, + 370 + ], + "score": 1.0, + "content": "vertible matrix", + "type": "text" + }, + { + "bbox": [ + 168, + 357, + 178, + 367 + ], + "score": 0.81, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 356, + 267, + 370 + ], + "score": 1.0, + "content": "and any block matrix", + "type": "text" + }, + { + "bbox": [ + 267, + 357, + 277, + 367 + ], + "score": 0.72, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 356, + 506, + 370 + ], + "score": 1.0, + "content": "that takes the form specified in Theorem 1. For nonzero", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 367, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 119, + 379 + ], + "score": 0.86, + "content": "\\mathbf { L } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 367, + 209, + 381 + ], + "score": 1.0, + "content": ", one can fix a proper", + "type": "text" + }, + { + "bbox": [ + 209, + 369, + 219, + 378 + ], + "score": 0.71, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 367, + 353, + 381 + ], + "score": 1.0, + "content": "and solve the linear equation on", + "type": "text" + }, + { + "bbox": [ + 354, + 369, + 364, + 378 + ], + "score": 0.81, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 367, + 506, + 381 + ], + "score": 1.0, + "content": "in eq. (3). If a solution exists, we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "then obtain the form of a corresponding critical point. We further note that the analytical structures", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 388, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 104, + 388, + 505, + 404 + ], + "score": 1.0, + "content": "of the critical points are more important, which have direct implications on the global optimality", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 401, + 444, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 444, + 414 + ], + "score": 1.0, + "content": "conditions and landscape properties as we show in the remaining part of the section.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 415, + 503, + 440 + ], + "lines": [ + { + "bbox": [ + 105, + 413, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 324, + 429 + ], + "score": 1.0, + "content": "Remark 1. We note that the block pattern parameters", + "type": "text" + }, + { + "bbox": [ + 325, + 415, + 357, + 428 + ], + "score": 0.93, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 413, + 375, + 429 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 376, + 416, + 382, + 427 + ], + "score": 0.73, + "content": "\\bar { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 413, + 505, + 429 + ], + "score": 1.0, + "content": "denote the number of columns", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 426, + 501, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 117, + 442 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 427, + 151, + 440 + ], + "score": 0.91, + "content": "\\{ V _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 426, + 169, + 442 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 169, + 426, + 179, + 438 + ], + "score": 0.81, + "content": "\\overline { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 426, + 363, + 442 + ], + "score": 1.0, + "content": ", respectively, and their sum equals the rank of", + "type": "text" + }, + { + "bbox": [ + 363, + 428, + 377, + 439 + ], + "score": 0.87, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 426, + 397, + 442 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 398, + 427, + 501, + 441 + ], + "score": 0.92, + "content": "\\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + { \\bar { p } } = \\operatorname { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 106, + 447, + 503, + 470 + ], + "lines": [ + { + "bbox": [ + 106, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 173, + 460 + ], + "score": 1.0, + "content": "The parameters", + "type": "text" + }, + { + "bbox": [ + 173, + 448, + 248, + 459 + ], + "score": 0.91, + "content": "p _ { i } , i = 1 , \\ldots , r , \\bar { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 447, + 263, + 460 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 263, + 448, + 273, + 458 + ], + "score": 0.77, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 447, + 505, + 460 + ], + "score": 1.0, + "content": "contain all useful information of the critical points that", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 458, + 411, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 458, + 234, + 472 + ], + "score": 1.0, + "content": "determine the function value of", + "type": "text" + }, + { + "bbox": [ + 234, + 460, + 242, + 469 + ], + "score": 0.81, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 458, + 411, + 472 + ], + "score": 1.0, + "content": "as presented in the following proposition.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 105, + 472, + 502, + 486 + ], + "lines": [ + { + "bbox": [ + 105, + 470, + 501, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 241, + 489 + ], + "score": 1.0, + "content": "Proposition 1. Any critical point", + "type": "text" + }, + { + "bbox": [ + 242, + 473, + 280, + 486 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 470, + 291, + 489 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 292, + 474, + 300, + 484 + ], + "score": 0.68, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 470, + 334, + 489 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 334, + 471, + 501, + 487 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\mathcal { L } ( A _ { 1 } , A _ { 2 } ) = \\frac { 1 } { 2 } ( \\mathrm { T r } ( Y Y ^ { \\top } ) - \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } ) . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 505, + 593 + ], + "lines": [ + { + "bbox": [ + 104, + 492, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 104, + 492, + 281, + 508 + ], + "score": 1.0, + "content": "Proposition 1 evaluates the function value", + "type": "text" + }, + { + "bbox": [ + 281, + 494, + 289, + 504 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 492, + 452, + 508 + ], + "score": 1.0, + "content": "at a critical point using the parameters", + "type": "text" + }, + { + "bbox": [ + 452, + 493, + 485, + 506 + ], + "score": 0.92, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 492, + 506, + 508 + ], + "score": 1.0, + "content": ". To", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 503, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 278, + 518 + ], + "score": 1.0, + "content": "explain further, recall that the data matrix", + "type": "text" + }, + { + "bbox": [ + 279, + 505, + 288, + 515 + ], + "score": 0.81, + "content": "\\pmb { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 503, + 387, + 518 + ], + "score": 1.0, + "content": "has each singular value", + "type": "text" + }, + { + "bbox": [ + 387, + 506, + 397, + 516 + ], + "score": 0.86, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 503, + 469, + 518 + ], + "score": 1.0, + "content": "with multiplicity", + "type": "text" + }, + { + "bbox": [ + 469, + 507, + 483, + 516 + ], + "score": 0.86, + "content": "m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 503, + 506, + 518 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 515, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 127, + 529 + ], + "score": 1.0, + "content": "each", + "type": "text" + }, + { + "bbox": [ + 127, + 516, + 132, + 525 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 515, + 240, + 529 + ], + "score": 1.0, + "content": ", the critical point captures", + "type": "text" + }, + { + "bbox": [ + 240, + 517, + 250, + 527 + ], + "score": 0.85, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 515, + 278, + 529 + ], + "score": 1.0, + "content": "out of", + "type": "text" + }, + { + "bbox": [ + 278, + 517, + 291, + 527 + ], + "score": 0.87, + "content": "m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 515, + 355, + 529 + ], + "score": 1.0, + "content": "singular values", + "type": "text" + }, + { + "bbox": [ + 356, + 518, + 366, + 527 + ], + "score": 0.84, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 515, + 423, + 529 + ], + "score": 1.0, + "content": ". Hence, for a", + "type": "text" + }, + { + "bbox": [ + 423, + 517, + 433, + 527 + ], + "score": 0.84, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 515, + 506, + 529 + ], + "score": 1.0, + "content": "with larger value", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 526, + 505, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 526, + 195, + 539 + ], + "score": 1.0, + "content": "(i.e., a smaller index", + "type": "text" + }, + { + "bbox": [ + 195, + 528, + 200, + 537 + ], + "score": 0.36, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 526, + 455, + 539 + ], + "score": 1.0, + "content": "), it is desirable that a critical point captures a larger number", + "type": "text" + }, + { + "bbox": [ + 456, + 528, + 466, + 538 + ], + "score": 0.85, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 526, + 505, + 539 + ], + "score": 1.0, + "content": "of them.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 536, + 506, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 506, + 551 + ], + "score": 1.0, + "content": "In this way, the critical point captures more important principle components of the data so that", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 547, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 547, + 505, + 561 + ], + "score": 1.0, + "content": "the value of the loss function is further reduced as suggested by Proposition 1. In summary, the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 153, + 572 + ], + "score": 1.0, + "content": "parameters", + "type": "text" + }, + { + "bbox": [ + 153, + 559, + 185, + 572 + ], + "score": 0.93, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "characterize how well the learned model fits the data in terms of the value of the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 570, + 506, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 268, + 583 + ], + "score": 1.0, + "content": "loss function. Moreover, the parameters", + "type": "text" + }, + { + "bbox": [ + 268, + 570, + 300, + 583 + ], + "score": 0.93, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 570, + 506, + 583 + ], + "score": 1.0, + "content": "also determine a full characterization of the global", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 582, + 217, + 594 + ], + "spans": [ + { + "bbox": [ + 106, + 582, + 217, + 594 + ], + "score": 1.0, + "content": "minimizers as given below.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 595, + 504, + 618 + ], + "lines": [ + { + "bbox": [ + 106, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 398, + 608 + ], + "score": 1.0, + "content": "Proposition 2 (Characterization of global minimizers). A critical point", + "type": "text" + }, + { + "bbox": [ + 398, + 595, + 437, + 608 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 595, + 450, + 608 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 450, + 596, + 458, + 606 + ], + "score": 0.68, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "is a global", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 606, + 346, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 346, + 620 + ], + "score": 1.0, + "content": "minimizer if and only if it falls into the following two cases.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 106, + 622, + 505, + 675 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 142, + 638 + ], + "score": 1.0, + "content": "1. Case", + "type": "text" + }, + { + "bbox": [ + 119, + 636, + 239, + 650 + ], + "score": 0.85, + "content": "\\begin{array} { r } { \\operatorname { r a n k } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\le m _ { k } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 624, + 149, + 633 + ], + "score": 0.25, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 621, + 156, + 638 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 156, + 623, + 261, + 636 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} \\le \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 628, + 277, + 657 + ], + "score": 1.0, + "content": "=1 for some", + "type": "text" + }, + { + "bbox": [ + 262, + 621, + 267, + 638 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 267, + 624, + 281, + 635 + ], + "score": 0.83, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 637, + 302, + 648 + ], + "score": 0.88, + "content": "k \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 621, + 353, + 638 + ], + "score": 1.0, + "content": "is full rank, and", + "type": "text" + }, + { + "bbox": [ + 303, + 628, + 312, + 657 + ], + "score": 1.0, + "content": ";", + "type": "text" + }, + { + "bbox": [ + 353, + 625, + 505, + 636 + ], + "score": 0.87, + "content": "p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =", + "type": "inline_equation" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 647, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 104, + 647, + 153, + 664 + ], + "score": 1.0, + "content": "2. Case 2:", + "type": "text" + }, + { + "bbox": [ + 154, + 650, + 255, + 662 + ], + "score": 0.78, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 647, + 261, + 664 + ], + "score": 1.0, + "content": "i ,", + "type": "text" + }, + { + "bbox": [ + 261, + 650, + 297, + 661 + ], + "score": 0.77, + "content": "p _ { i } = m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 647, + 313, + 664 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 313, + 650, + 364, + 661 + ], + "score": 0.93, + "content": "i = 1 , \\ldots , r _ { : }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 647, + 385, + 664 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 386, + 650, + 411, + 661 + ], + "score": 0.9, + "content": "\\bar { p } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 647, + 472, + 664 + ], + "score": 1.0, + "content": ". In particular,", + "type": "text" + }, + { + "bbox": [ + 473, + 650, + 487, + 660 + ], + "score": 0.86, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 647, + 506, + 664 + ], + "score": 1.0, + "content": "can", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 117, + 658, + 303, + 677 + ], + "spans": [ + { + "bbox": [ + 117, + 658, + 206, + 677 + ], + "score": 1.0, + "content": "be non-full rank with", + "type": "text" + }, + { + "bbox": [ + 206, + 661, + 297, + 675 + ], + "score": 0.88, + "content": "\\textstyle { \\mathrm { r a n k } } ( A _ { 2 } ) = \\sum _ { i = 1 } ^ { r } m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 658, + 303, + 677 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 106, + 678, + 504, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 504, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 504, + 691 + ], + "score": 1.0, + "content": "The analytical form of any global minimizer can be obtained from Theorem 1 with further specifica-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 689, + 219, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 219, + 701 + ], + "score": 1.0, + "content": "tion to the above two cases.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Proposition 2 establishes the neccessary and sufficient conditions for any critical point to be a global", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 227, + 734 + ], + "score": 1.0, + "content": "minimizer. If the data matrix", + "type": "text" + }, + { + "bbox": [ + 228, + 721, + 237, + 730 + ], + "score": 0.8, + "content": "\\pmb { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "has a large number of nonzero singular values, i.e., the first case,", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 47.5 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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, + 81, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 181, + 95 + ], + "score": 1.0, + "content": "We further define", + "type": "text" + }, + { + "bbox": [ + 181, + 82, + 258, + 93 + ], + "score": 0.92, + "content": "\\Sigma : = Y X ^ { \\dagger } X Y ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 80, + 470, + 95 + ], + "score": 1.0, + "content": "and denote its full singular value decomposition as", + "type": "text" + }, + { + "bbox": [ + 470, + 81, + 501, + 93 + ], + "score": 0.88, + "content": "U \\pmb { \\Lambda } U ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 80, + 505, + 95 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 163, + 107 + ], + "score": 1.0, + "content": "Suppose that", + "type": "text" + }, + { + "bbox": [ + 163, + 94, + 173, + 104 + ], + "score": 0.79, + "content": "\\pmb { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 92, + 191, + 107 + ], + "score": 1.0, + "content": "has", + "type": "text" + }, + { + "bbox": [ + 192, + 96, + 198, + 104 + ], + "score": 0.74, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 92, + 333, + 107 + ], + "score": 1.0, + "content": "distinct positive singular values", + "type": "text" + }, + { + "bbox": [ + 334, + 94, + 426, + 105 + ], + "score": 0.89, + "content": "\\sigma _ { 1 } > \\cdots > \\sigma _ { r } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 92, + 506, + 107 + ], + "score": 1.0, + "content": "with multiplicities", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 107, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 107, + 106, + 156, + 116 + ], + "score": 0.89, + "content": "m _ { 1 } , \\ldots , m _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 104, + 246, + 117 + ], + "score": 1.0, + "content": ", respectively, and has", + "type": "text" + }, + { + "bbox": [ + 247, + 106, + 257, + 114 + ], + "score": 0.79, + "content": "\\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 104, + 392, + 117 + ], + "score": 1.0, + "content": "zero singular values. Recall that", + "type": "text" + }, + { + "bbox": [ + 393, + 105, + 431, + 116 + ], + "score": 0.91, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "is defined to be a", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 171, + 128 + ], + "score": 1.0, + "content": "critical point of", + "type": "text" + }, + { + "bbox": [ + 171, + 116, + 180, + 126 + ], + "score": 0.84, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 114, + 190, + 128 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 190, + 115, + 288, + 127 + ], + "score": 0.89, + "content": "\\nabla _ { A _ { 1 } } \\mathcal { L } = \\mathbf { 0 } , \\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 114, + 505, + 128 + ], + "score": 1.0, + "content": ". Our first result provides a full characterization of all", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 126, + 186, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 126, + 174, + 139 + ], + "score": 1.0, + "content": "critical points of", + "type": "text" + }, + { + "bbox": [ + 174, + 127, + 182, + 136 + ], + "score": 0.8, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 126, + 186, + 139 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 80, + 506, + 139 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 140, + 503, + 174 + ], + "lines": [ + { + "bbox": [ + 106, + 139, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 139, + 394, + 154 + ], + "score": 1.0, + "content": "Theorem 1 (Characterization of critical points). All critical points of", + "type": "text" + }, + { + "bbox": [ + 394, + 141, + 402, + 151 + ], + "score": 0.75, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 139, + 505, + 154 + ], + "score": 1.0, + "content": "are necessarily and suf-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 149, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 104, + 149, + 249, + 164 + ], + "score": 1.0, + "content": "ficiently characterized by a matrix", + "type": "text" + }, + { + "bbox": [ + 249, + 151, + 307, + 163 + ], + "score": 0.92, + "content": "\\pmb { L } _ { 1 } \\in \\overline { { \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 149, + 375, + 164 + ], + "score": 1.0, + "content": ", a block matrix", + "type": "text" + }, + { + "bbox": [ + 375, + 151, + 430, + 162 + ], + "score": 0.92, + "content": "V ~ \\in \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 149, + 506, + 164 + ], + "score": 1.0, + "content": "and an invertible", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 160, + 206, + 176 + ], + "spans": [ + { + "bbox": [ + 104, + 160, + 135, + 176 + ], + "score": 1.0, + "content": "matrix", + "type": "text" + }, + { + "bbox": [ + 136, + 162, + 187, + 173 + ], + "score": 0.92, + "content": "C \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 160, + 206, + 176 + ], + "score": 1.0, + "content": "via", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 104, + 139, + 506, + 176 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 176, + 416, + 206 + ], + "lines": [ + { + "bbox": [ + 194, + 176, + 416, + 206 + ], + "spans": [ + { + "bbox": [ + 194, + 176, + 416, + 206 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { A _ { 1 } = C ^ { - 1 } V ^ { \\top } U ^ { \\top } Y X ^ { \\dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \\top } V C L _ { 1 } X X ^ { \\dagger } } \\\\ & { A _ { 2 } = U V C . } \\end{array}", + "type": "interline_equation", + "image_path": "cf57a2f3dbeac390e8a075192901965861703b9fd84ce2ff59a701d9ab01d928.jpg" + } + ] + } + ], + "index": 8.5, + "virtual_lines": [ + { + "bbox": [ + 194, + 176, + 416, + 191.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 194, + 191.0, + 416, + 206.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 209, + 505, + 246 + ], + "lines": [ + { + "bbox": [ + 104, + 208, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 104, + 208, + 157, + 225 + ], + "score": 1.0, + "content": "Specifically,", + "type": "text" + }, + { + "bbox": [ + 158, + 210, + 353, + 224 + ], + "score": 0.83, + "content": "V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { { V } } } ) , \\mathbf { 0 } ^ { d _ { 2 } \\times ( d _ { 1 } - \\mathrm { r a n k } ( { \\bf A } _ { 2 } ) ) } ] ,", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 208, + 405, + 225 + ], + "score": 1.0, + "content": ", where both", + "type": "text" + }, + { + "bbox": [ + 405, + 211, + 462, + 223 + ], + "score": 0.91, + "content": "V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 208, + 483, + 225 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 483, + 210, + 505, + 223 + ], + "score": 0.87, + "content": "\\overline { { V } } \\in", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 220, + 504, + 236 + ], + "spans": [ + { + "bbox": [ + 107, + 222, + 133, + 232 + ], + "score": 0.89, + "content": "\\bar { \\mathbb { R } } ^ { \\bar { m } \\times \\bar { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 220, + 380, + 236 + ], + "score": 1.0, + "content": "consist of orthonormal columns with the number of columns", + "type": "text" + }, + { + "bbox": [ + 381, + 223, + 504, + 234 + ], + "score": 0.9, + "content": "p _ { i } \\leq m _ { i } , i = 1 , . . . , r , \\bar { p } \\leq \\bar { m }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 232, + 343, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 145, + 248 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 145, + 234, + 251, + 246 + ], + "score": 0.92, + "content": "{ \\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( A _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 232, + 272, + 248 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 273, + 234, + 313, + 245 + ], + "score": 0.91, + "content": "L _ { 1 } , V , C", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 232, + 343, + 248 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 104, + 208, + 505, + 248 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 249, + 380, + 266 + ], + "lines": [ + { + "bbox": [ + 232, + 249, + 380, + 266 + ], + "spans": [ + { + "bbox": [ + 232, + 249, + 380, + 266 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( U V ) ^ { \\perp } } \\mathbf { { \\mathit { Y X } } ^ { \\top } } \\mathbf { { \\mathit { L } } _ { 1 } ^ { \\top } } \\mathbf { { \\mathit { C } } ^ { \\top } } \\mathcal { P } _ { \\mathrm { k e r } ( V ) } = \\mathbf { { 0 } } .", + "type": "interline_equation", + "image_path": "71cd6575cde5b5179045518c47223bc46b5f2534c4ef25cf9e1f1c3f818d3cc1.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 232, + 249, + 380, + 266 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 274, + 504, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 273, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 273, + 446, + 287 + ], + "score": 1.0, + "content": "Theorem 1 characterizes the necessary and sufficient forms for all critical points of", + "type": "text" + }, + { + "bbox": [ + 446, + 275, + 453, + 284 + ], + "score": 0.79, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 273, + 505, + 287 + ], + "score": 1.0, + "content": ". Intuitively,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 285, + 504, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 151, + 298 + ], + "score": 1.0, + "content": "the matrix", + "type": "text" + }, + { + "bbox": [ + 151, + 286, + 161, + 295 + ], + "score": 0.79, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 285, + 319, + 298 + ], + "score": 1.0, + "content": "captures the invariance of the product", + "type": "text" + }, + { + "bbox": [ + 320, + 285, + 347, + 297 + ], + "score": 0.92, + "content": "\\mathbf { A } _ { 2 } \\mathbf { A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 285, + 490, + 298 + ], + "score": 1.0, + "content": "under an invertible transform, and", + "type": "text" + }, + { + "bbox": [ + 491, + 286, + 504, + 297 + ], + "score": 0.88, + "content": "\\mathbf { L } _ { 1 }", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 296, + 383, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 383, + 309 + ], + "score": 1.0, + "content": "captures the degree of freedom of the solution set for linear systems.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 273, + 505, + 309 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 312, + 505, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "In general, the set of critical points is uncountable and cannot be fully listed out. However, the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 323, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 104, + 323, + 439, + 338 + ], + "score": 1.0, + "content": "analytical forms in eqs. (1) and (2) do allow one to construct some critical points of", + "type": "text" + }, + { + "bbox": [ + 440, + 325, + 448, + 334 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 323, + 506, + 338 + ], + "score": 1.0, + "content": "by specifying", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 334, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 150, + 348 + ], + "score": 1.0, + "content": "choices of", + "type": "text" + }, + { + "bbox": [ + 150, + 335, + 190, + 347 + ], + "score": 0.91, + "content": "L _ { 1 } , V , C", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 334, + 425, + 348 + ], + "score": 1.0, + "content": "that fulfill the condition in eq. (3). For example, choosing", + "type": "text" + }, + { + "bbox": [ + 426, + 336, + 459, + 346 + ], + "score": 0.89, + "content": "\\mathbf { L } _ { 1 } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 334, + 506, + 348 + ], + "score": 1.0, + "content": "guarantees", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 344, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 104, + 344, + 348, + 359 + ], + "score": 1.0, + "content": "eq. (3), in which case eqs. (1) and (2) yield a critical point", + "type": "text" + }, + { + "bbox": [ + 349, + 345, + 457, + 357 + ], + "score": 0.86, + "content": "( C ^ { - \\mathrm { i } } V ^ { \\dagger } U ^ { \\top } Y X ^ { \\dagger } , U V C )", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 344, + 505, + 359 + ], + "score": 1.0, + "content": "for any in-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 356, + 506, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 168, + 370 + ], + "score": 1.0, + "content": "vertible matrix", + "type": "text" + }, + { + "bbox": [ + 168, + 357, + 178, + 367 + ], + "score": 0.81, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 356, + 267, + 370 + ], + "score": 1.0, + "content": "and any block matrix", + "type": "text" + }, + { + "bbox": [ + 267, + 357, + 277, + 367 + ], + "score": 0.72, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 356, + 506, + 370 + ], + "score": 1.0, + "content": "that takes the form specified in Theorem 1. For nonzero", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 367, + 506, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 119, + 379 + ], + "score": 0.86, + "content": "\\mathbf { L } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 120, + 367, + 209, + 381 + ], + "score": 1.0, + "content": ", one can fix a proper", + "type": "text" + }, + { + "bbox": [ + 209, + 369, + 219, + 378 + ], + "score": 0.71, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 367, + 353, + 381 + ], + "score": 1.0, + "content": "and solve the linear equation on", + "type": "text" + }, + { + "bbox": [ + 354, + 369, + 364, + 378 + ], + "score": 0.81, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 367, + 506, + 381 + ], + "score": 1.0, + "content": "in eq. (3). If a solution exists, we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "then obtain the form of a corresponding critical point. We further note that the analytical structures", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 388, + 505, + 404 + ], + "spans": [ + { + "bbox": [ + 104, + 388, + 505, + 404 + ], + "score": 1.0, + "content": "of the critical points are more important, which have direct implications on the global optimality", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 401, + 444, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 444, + 414 + ], + "score": 1.0, + "content": "conditions and landscape properties as we show in the remaining part of the section.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 21, + "bbox_fs": [ + 104, + 313, + 506, + 414 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 415, + 503, + 440 + ], + "lines": [ + { + "bbox": [ + 105, + 413, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 324, + 429 + ], + "score": 1.0, + "content": "Remark 1. We note that the block pattern parameters", + "type": "text" + }, + { + "bbox": [ + 325, + 415, + 357, + 428 + ], + "score": 0.93, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 413, + 375, + 429 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 376, + 416, + 382, + 427 + ], + "score": 0.73, + "content": "\\bar { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 413, + 505, + 429 + ], + "score": 1.0, + "content": "denote the number of columns", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 426, + 501, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 117, + 442 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 427, + 151, + 440 + ], + "score": 0.91, + "content": "\\{ V _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 426, + 169, + 442 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 169, + 426, + 179, + 438 + ], + "score": 0.81, + "content": "\\overline { V }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 426, + 363, + 442 + ], + "score": 1.0, + "content": ", respectively, and their sum equals the rank of", + "type": "text" + }, + { + "bbox": [ + 363, + 428, + 377, + 439 + ], + "score": 0.87, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 426, + 397, + 442 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + }, + { + "bbox": [ + 398, + 427, + 501, + 441 + ], + "score": 0.92, + "content": "\\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + { \\bar { p } } = \\operatorname { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 413, + 505, + 442 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 447, + 503, + 470 + ], + "lines": [ + { + "bbox": [ + 106, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 173, + 460 + ], + "score": 1.0, + "content": "The parameters", + "type": "text" + }, + { + "bbox": [ + 173, + 448, + 248, + 459 + ], + "score": 0.91, + "content": "p _ { i } , i = 1 , \\ldots , r , \\bar { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 447, + 263, + 460 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 263, + 448, + 273, + 458 + ], + "score": 0.77, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 447, + 505, + 460 + ], + "score": 1.0, + "content": "contain all useful information of the critical points that", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 458, + 411, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 458, + 234, + 472 + ], + "score": 1.0, + "content": "determine the function value of", + "type": "text" + }, + { + "bbox": [ + 234, + 460, + 242, + 469 + ], + "score": 0.81, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 458, + 411, + 472 + ], + "score": 1.0, + "content": "as presented in the following proposition.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 106, + 447, + 505, + 472 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 472, + 502, + 486 + ], + "lines": [ + { + "bbox": [ + 105, + 470, + 501, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 241, + 489 + ], + "score": 1.0, + "content": "Proposition 1. Any critical point", + "type": "text" + }, + { + "bbox": [ + 242, + 473, + 280, + 486 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 470, + 291, + 489 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 292, + 474, + 300, + 484 + ], + "score": 0.68, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 470, + 334, + 489 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 334, + 471, + 501, + 487 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\mathcal { L } ( A _ { 1 } , A _ { 2 } ) = \\frac { 1 } { 2 } ( \\mathrm { T r } ( Y Y ^ { \\top } ) - \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } ) . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 470, + 501, + 489 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 492, + 505, + 593 + ], + "lines": [ + { + "bbox": [ + 104, + 492, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 104, + 492, + 281, + 508 + ], + "score": 1.0, + "content": "Proposition 1 evaluates the function value", + "type": "text" + }, + { + "bbox": [ + 281, + 494, + 289, + 504 + ], + "score": 0.82, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 492, + 452, + 508 + ], + "score": 1.0, + "content": "at a critical point using the parameters", + "type": "text" + }, + { + "bbox": [ + 452, + 493, + 485, + 506 + ], + "score": 0.92, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 492, + 506, + 508 + ], + "score": 1.0, + "content": ". To", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 503, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 105, + 503, + 278, + 518 + ], + "score": 1.0, + "content": "explain further, recall that the data matrix", + "type": "text" + }, + { + "bbox": [ + 279, + 505, + 288, + 515 + ], + "score": 0.81, + "content": "\\pmb { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 503, + 387, + 518 + ], + "score": 1.0, + "content": "has each singular value", + "type": "text" + }, + { + "bbox": [ + 387, + 506, + 397, + 516 + ], + "score": 0.86, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 503, + 469, + 518 + ], + "score": 1.0, + "content": "with multiplicity", + "type": "text" + }, + { + "bbox": [ + 469, + 507, + 483, + 516 + ], + "score": 0.86, + "content": "m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 503, + 506, + 518 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 515, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 127, + 529 + ], + "score": 1.0, + "content": "each", + "type": "text" + }, + { + "bbox": [ + 127, + 516, + 132, + 525 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 515, + 240, + 529 + ], + "score": 1.0, + "content": ", the critical point captures", + "type": "text" + }, + { + "bbox": [ + 240, + 517, + 250, + 527 + ], + "score": 0.85, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 515, + 278, + 529 + ], + "score": 1.0, + "content": "out of", + "type": "text" + }, + { + "bbox": [ + 278, + 517, + 291, + 527 + ], + "score": 0.87, + "content": "m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 515, + 355, + 529 + ], + "score": 1.0, + "content": "singular values", + "type": "text" + }, + { + "bbox": [ + 356, + 518, + 366, + 527 + ], + "score": 0.84, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 515, + 423, + 529 + ], + "score": 1.0, + "content": ". Hence, for a", + "type": "text" + }, + { + "bbox": [ + 423, + 517, + 433, + 527 + ], + "score": 0.84, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 515, + 506, + 529 + ], + "score": 1.0, + "content": "with larger value", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 526, + 505, + 539 + ], + "spans": [ + { + "bbox": [ + 105, + 526, + 195, + 539 + ], + "score": 1.0, + "content": "(i.e., a smaller index", + "type": "text" + }, + { + "bbox": [ + 195, + 528, + 200, + 537 + ], + "score": 0.36, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 526, + 455, + 539 + ], + "score": 1.0, + "content": "), it is desirable that a critical point captures a larger number", + "type": "text" + }, + { + "bbox": [ + 456, + 528, + 466, + 538 + ], + "score": 0.85, + "content": "p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 526, + 505, + 539 + ], + "score": 1.0, + "content": "of them.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 536, + 506, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 506, + 551 + ], + "score": 1.0, + "content": "In this way, the critical point captures more important principle components of the data so that", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 547, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 547, + 505, + 561 + ], + "score": 1.0, + "content": "the value of the loss function is further reduced as suggested by Proposition 1. In summary, the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 559, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 153, + 572 + ], + "score": 1.0, + "content": "parameters", + "type": "text" + }, + { + "bbox": [ + 153, + 559, + 185, + 572 + ], + "score": 0.93, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 559, + 505, + 572 + ], + "score": 1.0, + "content": "characterize how well the learned model fits the data in terms of the value of the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 570, + 506, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 268, + 583 + ], + "score": 1.0, + "content": "loss function. Moreover, the parameters", + "type": "text" + }, + { + "bbox": [ + 268, + 570, + 300, + 583 + ], + "score": 0.93, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 570, + 506, + 583 + ], + "score": 1.0, + "content": "also determine a full characterization of the global", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 582, + 217, + 594 + ], + "spans": [ + { + "bbox": [ + 106, + 582, + 217, + 594 + ], + "score": 1.0, + "content": "minimizers as given below.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 35, + "bbox_fs": [ + 104, + 492, + 506, + 594 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 595, + 504, + 618 + ], + "lines": [ + { + "bbox": [ + 106, + 595, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 595, + 398, + 608 + ], + "score": 1.0, + "content": "Proposition 2 (Characterization of global minimizers). A critical point", + "type": "text" + }, + { + "bbox": [ + 398, + 595, + 437, + 608 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 595, + 450, + 608 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 450, + 596, + 458, + 606 + ], + "score": 0.68, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 595, + 505, + 608 + ], + "score": 1.0, + "content": "is a global", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 606, + 346, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 606, + 346, + 620 + ], + "score": 1.0, + "content": "minimizer if and only if it falls into the following two cases.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 595, + 505, + 620 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 622, + 505, + 675 + ], + "lines": [ + { + "bbox": [ + 105, + 621, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 142, + 638 + ], + "score": 1.0, + "content": "1. Case", + "type": "text" + }, + { + "bbox": [ + 119, + 636, + 239, + 650 + ], + "score": 0.85, + "content": "\\begin{array} { r } { \\operatorname { r a n k } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\le m _ { k } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 624, + 149, + 633 + ], + "score": 0.25, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 621, + 156, + 638 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 156, + 623, + 261, + 636 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} \\le \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 628, + 277, + 657 + ], + "score": 1.0, + "content": "=1 for some", + "type": "text" + }, + { + "bbox": [ + 262, + 621, + 267, + 638 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 267, + 624, + 281, + 635 + ], + "score": 0.83, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 637, + 302, + 648 + ], + "score": 0.88, + "content": "k \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 621, + 353, + 638 + ], + "score": 1.0, + "content": "is full rank, and", + "type": "text" + }, + { + "bbox": [ + 303, + 628, + 312, + 657 + ], + "score": 1.0, + "content": ";", + "type": "text" + }, + { + "bbox": [ + 353, + 625, + 505, + 636 + ], + "score": 0.87, + "content": "p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =", + "type": "inline_equation" + } + ], + "index": 42 + }, + { + "bbox": [ + 104, + 647, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 104, + 647, + 153, + 664 + ], + "score": 1.0, + "content": "2. Case 2:", + "type": "text" + }, + { + "bbox": [ + 154, + 650, + 255, + 662 + ], + "score": 0.78, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 647, + 261, + 664 + ], + "score": 1.0, + "content": "i ,", + "type": "text" + }, + { + "bbox": [ + 261, + 650, + 297, + 661 + ], + "score": 0.77, + "content": "p _ { i } = m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 647, + 313, + 664 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 313, + 650, + 364, + 661 + ], + "score": 0.93, + "content": "i = 1 , \\ldots , r _ { : }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 647, + 385, + 664 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 386, + 650, + 411, + 661 + ], + "score": 0.9, + "content": "\\bar { p } \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 647, + 472, + 664 + ], + "score": 1.0, + "content": ". In particular,", + "type": "text" + }, + { + "bbox": [ + 473, + 650, + 487, + 660 + ], + "score": 0.86, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 647, + 506, + 664 + ], + "score": 1.0, + "content": "can", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 117, + 658, + 303, + 677 + ], + "spans": [ + { + "bbox": [ + 117, + 658, + 206, + 677 + ], + "score": 1.0, + "content": "be non-full rank with", + "type": "text" + }, + { + "bbox": [ + 206, + 661, + 297, + 675 + ], + "score": 0.88, + "content": "\\textstyle { \\mathrm { r a n k } } ( A _ { 2 } ) = \\sum _ { i = 1 } ^ { r } m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 658, + 303, + 677 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 104, + 621, + 506, + 677 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 678, + 504, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 504, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 504, + 691 + ], + "score": 1.0, + "content": "The analytical form of any global minimizer can be obtained from Theorem 1 with further specifica-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 689, + 219, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 689, + 219, + 701 + ], + "score": 1.0, + "content": "tion to the above two cases.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 677, + 504, + 701 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Proposition 2 establishes the neccessary and sufficient conditions for any critical point to be a global", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 227, + 734 + ], + "score": 1.0, + "content": "minimizer. If the data matrix", + "type": "text" + }, + { + "bbox": [ + 228, + 721, + 237, + 730 + ], + "score": 0.8, + "content": "\\pmb { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "has a large number of nonzero singular values, i.e., the first case,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 349, + 94 + ], + "score": 1.0, + "content": "one needs to exhaust the representation budget (i.e., rank) of", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 349, + 83, + 363, + 93 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 363, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "and capture as many large singular", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 384, + 106 + ], + "score": 1.0, + "content": "values as the rank allows to achieve the global minimum; Otherwise,", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 384, + 94, + 398, + 105 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 399, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "of a global minimizer can", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 504, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 394, + 116 + ], + "score": 1.0, + "content": "be non-full rank and still captures all nonzero singular values. Note that", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 395, + 105, + 409, + 115 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 409, + 104, + 504, + 116 + ], + "score": 1.0, + "content": "must be full rank in the", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 176, + 128 + ], + "score": 1.0, + "content": "case 1, and so is", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 176, + 116, + 190, + 127 + ], + "score": 0.89, + "content": "A _ { 1 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 191, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "if we further adopt the assumptions on the network size and data matrices in", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 125, + 202, + 138 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 202, + 138 + ], + "score": 1.0, + "content": "Baldi & Hornik (1989).", + "type": "text", + "cross_page": true + } + ], + "index": 4 + } + ], + "index": 47.5, + "bbox_fs": [ + 105, + 709, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 349, + 94 + ], + "score": 1.0, + "content": "one needs to exhaust the representation budget (i.e., rank) of", + "type": "text" + }, + { + "bbox": [ + 349, + 83, + 363, + 93 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "and capture as many large singular", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 384, + 106 + ], + "score": 1.0, + "content": "values as the rank allows to achieve the global minimum; Otherwise,", + "type": "text" + }, + { + "bbox": [ + 384, + 94, + 398, + 105 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "of a global minimizer can", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 504, + 116 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 394, + 116 + ], + "score": 1.0, + "content": "be non-full rank and still captures all nonzero singular values. Note that", + "type": "text" + }, + { + "bbox": [ + 395, + 105, + 409, + 115 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 104, + 504, + 116 + ], + "score": 1.0, + "content": "must be full rank in the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 176, + 128 + ], + "score": 1.0, + "content": "case 1, and so is", + "type": "text" + }, + { + "bbox": [ + 176, + 116, + 190, + 127 + ], + "score": 0.89, + "content": "A _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "if we further adopt the assumptions on the network size and data matrices in", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 125, + 202, + 138 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 202, + 138 + ], + "score": 1.0, + "content": "Baldi & Hornik (1989).", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 105, + 143, + 504, + 166 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 231, + 156 + ], + "score": 1.0, + "content": "Furthermore, the parameters", + "type": "text" + }, + { + "bbox": [ + 231, + 143, + 264, + 155 + ], + "score": 0.93, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 141, + 505, + 156 + ], + "score": 1.0, + "content": "naturally divide all non-global-minimum critical points", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 154, + 304, + 167 + ], + "spans": [ + { + "bbox": [ + 107, + 154, + 146, + 166 + ], + "score": 0.92, + "content": "\\left( A _ { 1 } , A _ { 2 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 154, + 158, + 167 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 158, + 155, + 167, + 164 + ], + "score": 0.8, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 154, + 304, + 167 + ], + "score": 1.0, + "content": "into the following two categories.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 171, + 505, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 169, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 169, + 249, + 185 + ], + "score": 1.0, + "content": "• (Non-optimal order): The matrix", + "type": "text" + }, + { + "bbox": [ + 249, + 171, + 260, + 181 + ], + "score": 0.77, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 169, + 452, + 185 + ], + "score": 1.0, + "content": "specified in Theorem 1 satisfies that there exists", + "type": "text" + }, + { + "bbox": [ + 453, + 171, + 506, + 183 + ], + "score": 0.89, + "content": "1 \\leq i < j \\leq", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 117, + 182, + 246, + 194 + ], + "spans": [ + { + "bbox": [ + 117, + 185, + 123, + 192 + ], + "score": 0.76, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 123, + 182, + 161, + 194 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 162, + 183, + 197, + 194 + ], + "score": 0.9, + "content": "p _ { i } < m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 182, + 214, + 194 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 215, + 183, + 244, + 194 + ], + "score": 0.88, + "content": "p _ { j } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 182, + 246, + 194 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 187, + 205 + ], + "score": 1.0, + "content": "• (Optimal order):", + "type": "text" + }, + { + "bbox": [ + 187, + 194, + 296, + 205 + ], + "score": 0.91, + "content": "\\mathrm { r a n k } ( A _ { 2 } ) < \\mathrm { m i n } \\{ d _ { 2 } , d _ { 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 192, + 361, + 205 + ], + "score": 1.0, + "content": "and the matrix", + "type": "text" + }, + { + "bbox": [ + 361, + 193, + 372, + 203 + ], + "score": 0.75, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "specified in Theorem 1 satisfies", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 204, + 484, + 222 + ], + "spans": [ + { + "bbox": [ + 114, + 205, + 133, + 222 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 134, + 204, + 397, + 220 + ], + "score": 0.71, + "content": "p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = { \\mathrm { r a n k } } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\leq m _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 205, + 435, + 222 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 436, + 206, + 479, + 218 + ], + "score": 0.92, + "content": "1 \\leq k \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 205, + 484, + 222 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 223, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 380, + 237 + ], + "score": 1.0, + "content": "To understand the above two categories, note that a critical point of", + "type": "text" + }, + { + "bbox": [ + 380, + 224, + 388, + 233 + ], + "score": 0.77, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "with non-optimal order cap-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 235, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 229, + 246 + ], + "score": 1.0, + "content": "tures a smaller singular value", + "type": "text" + }, + { + "bbox": [ + 230, + 236, + 241, + 246 + ], + "score": 0.85, + "content": "\\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 235, + 270, + 246 + ], + "score": 1.0, + "content": "(since", + "type": "text" + }, + { + "bbox": [ + 270, + 235, + 302, + 246 + ], + "score": 0.9, + "content": "p _ { j } > 0 \\ :", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 235, + 464, + 246 + ], + "score": 1.0, + "content": ") while skipping a larger singular value", + "type": "text" + }, + { + "bbox": [ + 465, + 236, + 475, + 245 + ], + "score": 0.85, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 235, + 506, + 246 + ], + "score": 1.0, + "content": "with a", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 245, + 506, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 157, + 258 + ], + "score": 1.0, + "content": "lower index", + "type": "text" + }, + { + "bbox": [ + 157, + 246, + 182, + 257 + ], + "score": 0.91, + "content": "i < j", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 245, + 210, + 258 + ], + "score": 1.0, + "content": "(since", + "type": "text" + }, + { + "bbox": [ + 211, + 247, + 250, + 257 + ], + "score": 0.89, + "content": "p _ { i } < m _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 245, + 506, + 258 + ], + "score": 1.0, + "content": "), and hence cannot be a global minimizer. On the other hand,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 257, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 218, + 269 + ], + "score": 1.0, + "content": "although a critical point of", + "type": "text" + }, + { + "bbox": [ + 219, + 257, + 227, + 266 + ], + "score": 0.81, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 257, + 505, + 269 + ], + "score": 1.0, + "content": "with optimal order captures the singular values in the optimal (i.e.,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 391, + 279 + ], + "score": 1.0, + "content": "decreasing) order, it does not fully utilize the representation budget of", + "type": "text" + }, + { + "bbox": [ + 392, + 268, + 406, + 278 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 267, + 445, + 279 + ], + "score": 1.0, + "content": "(because", + "type": "text" + }, + { + "bbox": [ + 445, + 267, + 459, + 278 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 267, + 505, + 279 + ], + "score": 1.0, + "content": "is non-full", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 278, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 505, + 290 + ], + "score": 1.0, + "content": "rank) to further capture nonzero singular values and reduce the function value, and hence cannot be", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "a global minimizer either. Next, we show that these two types of non-global-minimum critical points", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 300, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 389, + 315 + ], + "score": 1.0, + "content": "have different landscape properties around them. Throughout, a matrix", + "type": "text" + }, + { + "bbox": [ + 390, + 300, + 403, + 312 + ], + "score": 0.88, + "content": "\\widetilde { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 302, + 505, + 315 + ], + "score": 1.0, + "content": "is called the perturbation", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 313, + 339, + 325 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 117, + 325 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 313, + 131, + 323 + ], + "score": 0.77, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 314, + 322, + 325 + ], + "score": 1.0, + "content": "if it lies in an arbitrarily small neighborhood of", + "type": "text" + }, + { + "bbox": [ + 323, + 314, + 336, + 323 + ], + "score": 0.82, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 314, + 339, + 325 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 328, + 504, + 351 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 504, + 341 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 396, + 341 + ], + "score": 1.0, + "content": "Proposition 3 (Landscape around critical points). The critical points of", + "type": "text" + }, + { + "bbox": [ + 396, + 329, + 404, + 339 + ], + "score": 0.67, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 328, + 504, + 341 + ], + "score": 1.0, + "content": "have the following land-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 339, + 177, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 177, + 353 + ], + "score": 1.0, + "content": "scape properties.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 357, + 505, + 431 + ], + "lines": [ + { + "bbox": [ + 105, + 356, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 263, + 371 + ], + "score": 1.0, + "content": "1. A non-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 264, + 358, + 303, + 371 + ], + "score": 0.92, + "content": "\\left( A _ { 1 } , A _ { 2 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 357, + 386, + 371 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 387, + 356, + 425, + 371 + ], + "score": 0.91, + "content": "( \\widetilde { A _ { 1 } } , \\widetilde { A _ { 2 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 357, + 464, + 371 + ], + "score": 1.0, + "content": "with ran", + "type": "text" + }, + { + "bbox": [ + 464, + 356, + 505, + 371 + ], + "score": 0.6, + "content": "\\operatorname { k } ( \\widetilde { A _ { 2 } } ) =", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 118, + 369, + 323, + 382 + ], + "spans": [ + { + "bbox": [ + 118, + 370, + 160, + 382 + ], + "score": 0.62, + "content": "\\operatorname { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 369, + 323, + 382 + ], + "score": 1.0, + "content": ", which achieves a lower function value;", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 380, + 504, + 396 + ], + "spans": [ + { + "bbox": [ + 104, + 381, + 255, + 396 + ], + "score": 1.0, + "content": "2. An optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 255, + 383, + 294, + 395 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 381, + 382, + 396 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 382, + 380, + 421, + 395 + ], + "score": 0.94, + "content": "( \\widetilde { A _ { 1 } } , \\widetilde { A _ { 2 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 381, + 446, + 396 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 446, + 380, + 504, + 396 + ], + "score": 0.69, + "content": "\\mathrm { r a n k } ( \\widetilde { A _ { 2 } } ) =", + "type": "inline_equation" + } + ], + "index": 24 + }, + { + "bbox": [ + 119, + 394, + 339, + 406 + ], + "spans": [ + { + "bbox": [ + 119, + 394, + 178, + 406 + ], + "score": 0.91, + "content": "\\mathrm { r a n k } ( A _ { 2 } ) + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 394, + 339, + 406 + ], + "score": 1.0, + "content": ", which achieves a lower function value;", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 104, + 405, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 104, + 406, + 171, + 421 + ], + "score": 1.0, + "content": "3. Any point in", + "type": "text" + }, + { + "bbox": [ + 171, + 407, + 313, + 420 + ], + "score": 0.92, + "content": "\\mathcal { X } : = \\{ ( A _ { 1 } , A _ { 2 } ) : ~ A _ { 2 } A _ { 1 } X \\neq \\mathbf { 0 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 406, + 392, + 421 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 392, + 405, + 430, + 420 + ], + "score": 0.92, + "content": "( A _ { 1 } , \\widetilde { A _ { 2 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 406, + 506, + 421 + ], + "score": 1.0, + "content": ", which achieves a", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 118, + 418, + 210, + 431 + ], + "spans": [ + { + "bbox": [ + 118, + 418, + 210, + 431 + ], + "score": 1.0, + "content": "higher function value;", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 439, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "score": 1.0, + "content": "As a consequence, items 1 and 2 imply that any non-global-minimum critical point has a descent", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 451, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 505, + 463 + ], + "score": 1.0, + "content": "direction, and hence cannot be a local minimizer. Thus, any local minimizer must be a global", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "minimizer. Item 3 implies that any point has an ascent direction whenever the output is nonzero.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 473, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 346, + 485 + ], + "score": 1.0, + "content": "Hence, there does not exist any local/global maximizer in", + "type": "text" + }, + { + "bbox": [ + 347, + 473, + 356, + 483 + ], + "score": 0.78, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 473, + 505, + 485 + ], + "score": 1.0, + "content": ". Furthermore, item 3 together with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 483, + 506, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 380, + 496 + ], + "score": 1.0, + "content": "items 1 and 2 implies that any non-global-minimum critical point in", + "type": "text" + }, + { + "bbox": [ + 381, + 484, + 390, + 494 + ], + "score": 0.79, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 483, + 506, + 496 + ], + "score": 1.0, + "content": "has both descent and ascent", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 495, + 497, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 497, + 507 + ], + "score": 1.0, + "content": "directions, and hence must be a saddle point. We summarize these facts in the following theorem.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 510, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 510, + 506, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 213, + 523 + ], + "score": 1.0, + "content": "Theorem 2 (Landscape of", + "type": "text" + }, + { + "bbox": [ + 213, + 511, + 221, + 520 + ], + "score": 0.74, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 510, + 300, + 523 + ], + "score": 1.0, + "content": "). The loss function", + "type": "text" + }, + { + "bbox": [ + 300, + 511, + 308, + 520 + ], + "score": 0.66, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 510, + 347, + 523 + ], + "score": 1.0, + "content": "satisfies:", + "type": "text" + }, + { + "bbox": [ + 347, + 511, + 353, + 520 + ], + "score": 0.41, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 510, + 506, + 523 + ], + "score": 1.0, + "content": ") every local minimum is also a global", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 522, + 416, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 335, + 534 + ], + "score": 1.0, + "content": "minimum; 2) every non-global-minimum critical point in", + "type": "text" + }, + { + "bbox": [ + 335, + 522, + 345, + 531 + ], + "score": 0.79, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 522, + 416, + 534 + ], + "score": 1.0, + "content": "is a saddle point.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 542, + 505, + 589 + ], + "lines": [ + { + "bbox": [ + 107, + 543, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 107, + 543, + 505, + 554 + ], + "score": 1.0, + "content": "We note that the saddle points in Theorem 2 can be non-strict when the data matrices are singular. As", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 554, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 453, + 566 + ], + "score": 1.0, + "content": "an illustrative example, consider the following loss function of a shallow linear network", + "type": "text" + }, + { + "bbox": [ + 454, + 554, + 506, + 565 + ], + "score": 0.91, + "content": "{ \\mathcal { L } } ( a _ { 2 } , a _ { 1 } ) =", + "type": "inline_equation" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 563, + 507, + 579 + ], + "spans": [ + { + "bbox": [ + 107, + 564, + 168, + 578 + ], + "score": 0.92, + "content": "\\textstyle { \\frac { 1 } { 2 } } ( a _ { 2 } a _ { 1 } x - y ) ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 563, + 199, + 579 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 199, + 566, + 234, + 576 + ], + "score": 0.89, + "content": "a _ { 1 } , a _ { 2 } , x", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 563, + 252, + 579 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 252, + 566, + 259, + 576 + ], + "score": 0.8, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 563, + 392, + 579 + ], + "score": 1.0, + "content": "are all scalars. Consider the case", + "type": "text" + }, + { + "bbox": [ + 392, + 565, + 417, + 576 + ], + "score": 0.9, + "content": "y = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 563, + 507, + 579 + ], + "score": 1.0, + "content": ". Then, the Hessian at", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 576, + 477, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 172, + 590 + ], + "score": 1.0, + "content": "the saddle point", + "type": "text" + }, + { + "bbox": [ + 172, + 577, + 234, + 589 + ], + "score": 0.92, + "content": "a _ { 1 } = 0 , a _ { 2 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 576, + 244, + 590 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 245, + 577, + 289, + 589 + ], + "score": 0.94, + "content": "[ x ^ { 2 } , 0 ; 0 , 0 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 576, + 477, + 590 + ], + "score": 1.0, + "content": ", which does not have any negative eigenvalue.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 106, + 593, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "From a technical point of view, the proof of item 1 of Proposition 3 applies that in Baldi (1989) and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 246, + 618 + ], + "score": 1.0, + "content": "generalizes it to the setting where", + "type": "text" + }, + { + "bbox": [ + 246, + 605, + 256, + 615 + ], + "score": 0.79, + "content": "\\pmb { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "can have repeated singular values and may not be invertible.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "To further understand the perturbation scheme from a high level perspective, note that non-optimal-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 316, + 640 + ], + "score": 1.0, + "content": "order critical points capture a smaller singular value", + "type": "text" + }, + { + "bbox": [ + 317, + 628, + 328, + 639 + ], + "score": 0.87, + "content": "\\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 626, + 420, + 640 + ], + "score": 1.0, + "content": "instead of a larger one", + "type": "text" + }, + { + "bbox": [ + 420, + 628, + 431, + 638 + ], + "score": 0.87, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 626, + 452, + 640 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 452, + 627, + 475, + 638 + ], + "score": 0.91, + "content": "i < j", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 626, + 505, + 640 + ], + "score": 1.0, + "content": ". Thus,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 349, + 650 + ], + "score": 1.0, + "content": "one naturally perturbs the singular vector corresponding to", + "type": "text" + }, + { + "bbox": [ + 350, + 640, + 361, + 650 + ], + "score": 0.86, + "content": "\\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "along the direction of the singular", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 205, + 661 + ], + "score": 1.0, + "content": "vector corresponding to", + "type": "text" + }, + { + "bbox": [ + 205, + 650, + 215, + 660 + ], + "score": 0.84, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 649, + 424, + 661 + ], + "score": 1.0, + "content": ". Such a perturbation scheme preserves the rank of", + "type": "text" + }, + { + "bbox": [ + 424, + 649, + 438, + 660 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "and reduces the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 659, + 212, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 212, + 672 + ], + "score": 1.0, + "content": "value of the loss function.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "More importantly, the proof of item 2 of Proposition 3 introduces a new technique. As a comparison,", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 686, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 701 + ], + "score": 1.0, + "content": "Baldi & Hornik (1989) proves a similar result as item 2 using the strict convexity of the function,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 311, + 712 + ], + "score": 1.0, + "content": "which requires the parameter dimensions to satisfy", + "type": "text" + }, + { + "bbox": [ + 311, + 699, + 367, + 710 + ], + "score": 0.92, + "content": "d _ { 2 } = d _ { 0 } \\geq d _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "and the data matrices to be invert-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "ible. In contrast, our proof completely removes these restrictions by introducing a new perturbation", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "direction and exploiting the analytical forms of critical points in eqs. (1) and (2) and the condition in", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 49 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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, + 138 + ], + "lines": [], + "index": 2, + "bbox_fs": [ + 105, + 82, + 506, + 138 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 105, + 143, + 504, + 166 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 231, + 156 + ], + "score": 1.0, + "content": "Furthermore, the parameters", + "type": "text" + }, + { + "bbox": [ + 231, + 143, + 264, + 155 + ], + "score": 0.93, + "content": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 141, + 505, + 156 + ], + "score": 1.0, + "content": "naturally divide all non-global-minimum critical points", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 107, + 154, + 304, + 167 + ], + "spans": [ + { + "bbox": [ + 107, + 154, + 146, + 166 + ], + "score": 0.92, + "content": "\\left( A _ { 1 } , A _ { 2 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 154, + 158, + 167 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 158, + 155, + 167, + 164 + ], + "score": 0.8, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 154, + 304, + 167 + ], + "score": 1.0, + "content": "into the following two categories.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 141, + 505, + 167 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 171, + 505, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 169, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 169, + 249, + 185 + ], + "score": 1.0, + "content": "• (Non-optimal order): The matrix", + "type": "text" + }, + { + "bbox": [ + 249, + 171, + 260, + 181 + ], + "score": 0.77, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 169, + 452, + 185 + ], + "score": 1.0, + "content": "specified in Theorem 1 satisfies that there exists", + "type": "text" + }, + { + "bbox": [ + 453, + 171, + 506, + 183 + ], + "score": 0.89, + "content": "1 \\leq i < j \\leq", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 117, + 182, + 246, + 194 + ], + "spans": [ + { + "bbox": [ + 117, + 185, + 123, + 192 + ], + "score": 0.76, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 123, + 182, + 161, + 194 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 162, + 183, + 197, + 194 + ], + "score": 0.9, + "content": "p _ { i } < m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 197, + 182, + 214, + 194 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 215, + 183, + 244, + 194 + ], + "score": 0.88, + "content": "p _ { j } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 182, + 246, + 194 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 187, + 205 + ], + "score": 1.0, + "content": "• (Optimal order):", + "type": "text" + }, + { + "bbox": [ + 187, + 194, + 296, + 205 + ], + "score": 0.91, + "content": "\\mathrm { r a n k } ( A _ { 2 } ) < \\mathrm { m i n } \\{ d _ { 2 } , d _ { 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 192, + 361, + 205 + ], + "score": 1.0, + "content": "and the matrix", + "type": "text" + }, + { + "bbox": [ + 361, + 193, + 372, + 203 + ], + "score": 0.75, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 192, + 505, + 205 + ], + "score": 1.0, + "content": "specified in Theorem 1 satisfies", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 204, + 484, + 222 + ], + "spans": [ + { + "bbox": [ + 114, + 205, + 133, + 222 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 134, + 204, + 397, + 220 + ], + "score": 0.71, + "content": "p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = { \\mathrm { r a n k } } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\leq m _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 205, + 435, + 222 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 436, + 206, + 479, + 218 + ], + "score": 0.92, + "content": "1 \\leq k \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 205, + 484, + 222 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 169, + 506, + 222 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 223, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 380, + 237 + ], + "score": 1.0, + "content": "To understand the above two categories, note that a critical point of", + "type": "text" + }, + { + "bbox": [ + 380, + 224, + 388, + 233 + ], + "score": 0.77, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "with non-optimal order cap-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 235, + 506, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 229, + 246 + ], + "score": 1.0, + "content": "tures a smaller singular value", + "type": "text" + }, + { + "bbox": [ + 230, + 236, + 241, + 246 + ], + "score": 0.85, + "content": "\\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 235, + 270, + 246 + ], + "score": 1.0, + "content": "(since", + "type": "text" + }, + { + "bbox": [ + 270, + 235, + 302, + 246 + ], + "score": 0.9, + "content": "p _ { j } > 0 \\ :", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 235, + 464, + 246 + ], + "score": 1.0, + "content": ") while skipping a larger singular value", + "type": "text" + }, + { + "bbox": [ + 465, + 236, + 475, + 245 + ], + "score": 0.85, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 235, + 506, + 246 + ], + "score": 1.0, + "content": "with a", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 245, + 506, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 157, + 258 + ], + "score": 1.0, + "content": "lower index", + "type": "text" + }, + { + "bbox": [ + 157, + 246, + 182, + 257 + ], + "score": 0.91, + "content": "i < j", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 245, + 210, + 258 + ], + "score": 1.0, + "content": "(since", + "type": "text" + }, + { + "bbox": [ + 211, + 247, + 250, + 257 + ], + "score": 0.89, + "content": "p _ { i } < m _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 245, + 506, + 258 + ], + "score": 1.0, + "content": "), and hence cannot be a global minimizer. On the other hand,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 257, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 218, + 269 + ], + "score": 1.0, + "content": "although a critical point of", + "type": "text" + }, + { + "bbox": [ + 219, + 257, + 227, + 266 + ], + "score": 0.81, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 257, + 505, + 269 + ], + "score": 1.0, + "content": "with optimal order captures the singular values in the optimal (i.e.,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 391, + 279 + ], + "score": 1.0, + "content": "decreasing) order, it does not fully utilize the representation budget of", + "type": "text" + }, + { + "bbox": [ + 392, + 268, + 406, + 278 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 267, + 445, + 279 + ], + "score": 1.0, + "content": "(because", + "type": "text" + }, + { + "bbox": [ + 445, + 267, + 459, + 278 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 267, + 505, + 279 + ], + "score": 1.0, + "content": "is non-full", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 278, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 278, + 505, + 290 + ], + "score": 1.0, + "content": "rank) to further capture nonzero singular values and reduce the function value, and hence cannot be", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "a global minimizer either. Next, we show that these two types of non-global-minimum critical points", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 300, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 389, + 315 + ], + "score": 1.0, + "content": "have different landscape properties around them. Throughout, a matrix", + "type": "text" + }, + { + "bbox": [ + 390, + 300, + 403, + 312 + ], + "score": 0.88, + "content": "\\widetilde { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 302, + 505, + 315 + ], + "score": 1.0, + "content": "is called the perturbation", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 313, + 339, + 325 + ], + "spans": [ + { + "bbox": [ + 106, + 314, + 117, + 325 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 313, + 131, + 323 + ], + "score": 0.77, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 314, + 322, + 325 + ], + "score": 1.0, + "content": "if it lies in an arbitrarily small neighborhood of", + "type": "text" + }, + { + "bbox": [ + 323, + 314, + 336, + 323 + ], + "score": 0.82, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 314, + 339, + 325 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 222, + 506, + 325 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 328, + 504, + 351 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 504, + 341 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 396, + 341 + ], + "score": 1.0, + "content": "Proposition 3 (Landscape around critical points). The critical points of", + "type": "text" + }, + { + "bbox": [ + 396, + 329, + 404, + 339 + ], + "score": 0.67, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 328, + 504, + 341 + ], + "score": 1.0, + "content": "have the following land-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 339, + 177, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 177, + 353 + ], + "score": 1.0, + "content": "scape properties.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 328, + 504, + 353 + ] + }, + { + "type": "list", + "bbox": [ + 106, + 357, + 505, + 431 + ], + "lines": [ + { + "bbox": [ + 105, + 356, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 263, + 371 + ], + "score": 1.0, + "content": "1. A non-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 264, + 358, + 303, + 371 + ], + "score": 0.92, + "content": "\\left( A _ { 1 } , A _ { 2 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 357, + 386, + 371 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 387, + 356, + 425, + 371 + ], + "score": 0.91, + "content": "( \\widetilde { A _ { 1 } } , \\widetilde { A _ { 2 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 357, + 464, + 371 + ], + "score": 1.0, + "content": "with ran", + "type": "text" + }, + { + "bbox": [ + 464, + 356, + 505, + 371 + ], + "score": 0.6, + "content": "\\operatorname { k } ( \\widetilde { A _ { 2 } } ) =", + "type": "inline_equation" + } + ], + "index": 22, + "is_list_start_line": true + }, + { + "bbox": [ + 118, + 369, + 323, + 382 + ], + "spans": [ + { + "bbox": [ + 118, + 370, + 160, + 382 + ], + "score": 0.62, + "content": "\\operatorname { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 369, + 323, + 382 + ], + "score": 1.0, + "content": ", which achieves a lower function value;", + "type": "text" + } + ], + "index": 23, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 380, + 504, + 396 + ], + "spans": [ + { + "bbox": [ + 104, + 381, + 255, + 396 + ], + "score": 1.0, + "content": "2. An optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 255, + 383, + 294, + 395 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 381, + 382, + 396 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 382, + 380, + 421, + 395 + ], + "score": 0.94, + "content": "( \\widetilde { A _ { 1 } } , \\widetilde { A _ { 2 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 381, + 446, + 396 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 446, + 380, + 504, + 396 + ], + "score": 0.69, + "content": "\\mathrm { r a n k } ( \\widetilde { A _ { 2 } } ) =", + "type": "inline_equation" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 119, + 394, + 339, + 406 + ], + "spans": [ + { + "bbox": [ + 119, + 394, + 178, + 406 + ], + "score": 0.91, + "content": "\\mathrm { r a n k } ( A _ { 2 } ) + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 394, + 339, + 406 + ], + "score": 1.0, + "content": ", which achieves a lower function value;", + "type": "text" + } + ], + "index": 25, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 405, + 506, + 421 + ], + "spans": [ + { + "bbox": [ + 104, + 406, + 171, + 421 + ], + "score": 1.0, + "content": "3. Any point in", + "type": "text" + }, + { + "bbox": [ + 171, + 407, + 313, + 420 + ], + "score": 0.92, + "content": "\\mathcal { X } : = \\{ ( A _ { 1 } , A _ { 2 } ) : ~ A _ { 2 } A _ { 1 } X \\neq \\mathbf { 0 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 406, + 392, + 421 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 392, + 405, + 430, + 420 + ], + "score": 0.92, + "content": "( A _ { 1 } , \\widetilde { A _ { 2 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 406, + 506, + 421 + ], + "score": 1.0, + "content": ", which achieves a", + "type": "text" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 118, + 418, + 210, + 431 + ], + "spans": [ + { + "bbox": [ + 118, + 418, + 210, + 431 + ], + "score": 1.0, + "content": "higher function value;", + "type": "text" + } + ], + "index": 27, + "is_list_end_line": true + } + ], + "index": 24.5, + "bbox_fs": [ + 104, + 356, + 506, + 431 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 439, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 505, + 453 + ], + "score": 1.0, + "content": "As a consequence, items 1 and 2 imply that any non-global-minimum critical point has a descent", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 451, + 505, + 463 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 505, + 463 + ], + "score": 1.0, + "content": "direction, and hence cannot be a local minimizer. Thus, any local minimizer must be a global", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "minimizer. Item 3 implies that any point has an ascent direction whenever the output is nonzero.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 473, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 346, + 485 + ], + "score": 1.0, + "content": "Hence, there does not exist any local/global maximizer in", + "type": "text" + }, + { + "bbox": [ + 347, + 473, + 356, + 483 + ], + "score": 0.78, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 473, + 505, + 485 + ], + "score": 1.0, + "content": ". Furthermore, item 3 together with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 483, + 506, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 380, + 496 + ], + "score": 1.0, + "content": "items 1 and 2 implies that any non-global-minimum critical point in", + "type": "text" + }, + { + "bbox": [ + 381, + 484, + 390, + 494 + ], + "score": 0.79, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 483, + 506, + 496 + ], + "score": 1.0, + "content": "has both descent and ascent", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 495, + 497, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 497, + 507 + ], + "score": 1.0, + "content": "directions, and hence must be a saddle point. We summarize these facts in the following theorem.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 440, + 506, + 507 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 510, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 106, + 510, + 506, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 213, + 523 + ], + "score": 1.0, + "content": "Theorem 2 (Landscape of", + "type": "text" + }, + { + "bbox": [ + 213, + 511, + 221, + 520 + ], + "score": 0.74, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 510, + 300, + 523 + ], + "score": 1.0, + "content": "). The loss function", + "type": "text" + }, + { + "bbox": [ + 300, + 511, + 308, + 520 + ], + "score": 0.66, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 510, + 347, + 523 + ], + "score": 1.0, + "content": "satisfies:", + "type": "text" + }, + { + "bbox": [ + 347, + 511, + 353, + 520 + ], + "score": 0.41, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 510, + 506, + 523 + ], + "score": 1.0, + "content": ") every local minimum is also a global", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 522, + 416, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 335, + 534 + ], + "score": 1.0, + "content": "minimum; 2) every non-global-minimum critical point in", + "type": "text" + }, + { + "bbox": [ + 335, + 522, + 345, + 531 + ], + "score": 0.79, + "content": "\\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 522, + 416, + 534 + ], + "score": 1.0, + "content": "is a saddle point.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 510, + 506, + 534 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 542, + 505, + 589 + ], + "lines": [ + { + "bbox": [ + 107, + 543, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 107, + 543, + 505, + 554 + ], + "score": 1.0, + "content": "We note that the saddle points in Theorem 2 can be non-strict when the data matrices are singular. As", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 554, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 453, + 566 + ], + "score": 1.0, + "content": "an illustrative example, consider the following loss function of a shallow linear network", + "type": "text" + }, + { + "bbox": [ + 454, + 554, + 506, + 565 + ], + "score": 0.91, + "content": "{ \\mathcal { L } } ( a _ { 2 } , a _ { 1 } ) =", + "type": "inline_equation" + } + ], + "index": 37 + }, + { + "bbox": [ + 107, + 563, + 507, + 579 + ], + "spans": [ + { + "bbox": [ + 107, + 564, + 168, + 578 + ], + "score": 0.92, + "content": "\\textstyle { \\frac { 1 } { 2 } } ( a _ { 2 } a _ { 1 } x - y ) ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 563, + 199, + 579 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 199, + 566, + 234, + 576 + ], + "score": 0.89, + "content": "a _ { 1 } , a _ { 2 } , x", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 563, + 252, + 579 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 252, + 566, + 259, + 576 + ], + "score": 0.8, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 563, + 392, + 579 + ], + "score": 1.0, + "content": "are all scalars. Consider the case", + "type": "text" + }, + { + "bbox": [ + 392, + 565, + 417, + 576 + ], + "score": 0.9, + "content": "y = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 563, + 507, + 579 + ], + "score": 1.0, + "content": ". Then, the Hessian at", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 576, + 477, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 172, + 590 + ], + "score": 1.0, + "content": "the saddle point", + "type": "text" + }, + { + "bbox": [ + 172, + 577, + 234, + 589 + ], + "score": 0.92, + "content": "a _ { 1 } = 0 , a _ { 2 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 576, + 244, + 590 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 245, + 577, + 289, + 589 + ], + "score": 0.94, + "content": "[ x ^ { 2 } , 0 ; 0 , 0 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 576, + 477, + 590 + ], + "score": 1.0, + "content": ", which does not have any negative eigenvalue.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 543, + 507, + 590 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 593, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "From a technical point of view, the proof of item 1 of Proposition 3 applies that in Baldi (1989) and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 246, + 618 + ], + "score": 1.0, + "content": "generalizes it to the setting where", + "type": "text" + }, + { + "bbox": [ + 246, + 605, + 256, + 615 + ], + "score": 0.79, + "content": "\\pmb { \\Sigma }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "can have repeated singular values and may not be invertible.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "To further understand the perturbation scheme from a high level perspective, note that non-optimal-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 316, + 640 + ], + "score": 1.0, + "content": "order critical points capture a smaller singular value", + "type": "text" + }, + { + "bbox": [ + 317, + 628, + 328, + 639 + ], + "score": 0.87, + "content": "\\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 626, + 420, + 640 + ], + "score": 1.0, + "content": "instead of a larger one", + "type": "text" + }, + { + "bbox": [ + 420, + 628, + 431, + 638 + ], + "score": 0.87, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 626, + 452, + 640 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 452, + 627, + 475, + 638 + ], + "score": 0.91, + "content": "i < j", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 626, + 505, + 640 + ], + "score": 1.0, + "content": ". Thus,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 349, + 650 + ], + "score": 1.0, + "content": "one naturally perturbs the singular vector corresponding to", + "type": "text" + }, + { + "bbox": [ + 350, + 640, + 361, + 650 + ], + "score": 0.86, + "content": "\\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "along the direction of the singular", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 205, + 661 + ], + "score": 1.0, + "content": "vector corresponding to", + "type": "text" + }, + { + "bbox": [ + 205, + 650, + 215, + 660 + ], + "score": 0.84, + "content": "\\sigma _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 649, + 424, + 661 + ], + "score": 1.0, + "content": ". Such a perturbation scheme preserves the rank of", + "type": "text" + }, + { + "bbox": [ + 424, + 649, + 438, + 660 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "and reduces the", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 659, + 212, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 659, + 212, + 672 + ], + "score": 1.0, + "content": "value of the loss function.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 594, + 505, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 505, + 689 + ], + "score": 1.0, + "content": "More importantly, the proof of item 2 of Proposition 3 introduces a new technique. As a comparison,", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 686, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 505, + 701 + ], + "score": 1.0, + "content": "Baldi & Hornik (1989) proves a similar result as item 2 using the strict convexity of the function,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 311, + 712 + ], + "score": 1.0, + "content": "which requires the parameter dimensions to satisfy", + "type": "text" + }, + { + "bbox": [ + 311, + 699, + 367, + 710 + ], + "score": 0.92, + "content": "d _ { 2 } = d _ { 0 } \\geq d _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "and the data matrices to be invert-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "ible. In contrast, our proof completely removes these restrictions by introducing a new perturbation", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "direction and exploiting the analytical forms of critical points in eqs. (1) and (2) and the condition in", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "eq. (3). The accomplishment of the proof further requires careful choices of perturbation parameters", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "as well as judicious manipulations of matrices. We refer the reader to the supplemental materials for", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 504, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 504, + 117 + ], + "score": 1.0, + "content": "more details. As a high level understanding, since optimal-order critical points capture the singular", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "values in an optimal (i.e., decreasing) order, the previous perturbation scheme for non-optimal-order", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 126, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 126, + 353, + 139 + ], + "score": 1.0, + "content": "critical points does not apply. Instead, we increase the rank of", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 353, + 127, + 367, + 137 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 367, + 126, + 506, + 139 + ], + "score": 1.0, + "content": "by one in a way that the perturbed", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "matrix captures the next singular value beyond the ones that have already been captured so that the", + "type": "text", + "cross_page": true + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 149, + 303, + 159 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 303, + 159 + ], + "score": 1.0, + "content": "value of the loss function can be further reduced.", + "type": "text", + "cross_page": true + } + ], + "index": 6 + } + ], + "index": 49, + "bbox_fs": [ + 105, + 676, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 160 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 96 + ], + "score": 1.0, + "content": "eq. (3). The accomplishment of the proof further requires careful choices of perturbation parameters", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "as well as judicious manipulations of matrices. We refer the reader to the supplemental materials for", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 504, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 504, + 117 + ], + "score": 1.0, + "content": "more details. As a high level understanding, since optimal-order critical points capture the singular", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 506, + 128 + ], + "spans": [ + { + "bbox": [ + 106, + 115, + 506, + 128 + ], + "score": 1.0, + "content": "values in an optimal (i.e., decreasing) order, the previous perturbation scheme for non-optimal-order", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 126, + 506, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 126, + 353, + 139 + ], + "score": 1.0, + "content": "critical points does not apply. Instead, we increase the rank of", + "type": "text" + }, + { + "bbox": [ + 353, + 127, + 367, + 137 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 126, + 506, + 139 + ], + "score": 1.0, + "content": "by one in a way that the perturbed", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "matrix captures the next singular value beyond the ones that have already been captured so that the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 149, + 303, + 159 + ], + "spans": [ + { + "bbox": [ + 106, + 149, + 303, + 159 + ], + "score": 1.0, + "content": "value of the loss function can be further reduced.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3 + }, + { + "type": "title", + "bbox": [ + 107, + 175, + 307, + 189 + ], + "lines": [ + { + "bbox": [ + 104, + 174, + 308, + 191 + ], + "spans": [ + { + "bbox": [ + 104, + 174, + 308, + 191 + ], + "score": 1.0, + "content": "3 DEEP LINEAR NEURAL NETWORKS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 200, + 505, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 199, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 313, + 213 + ], + "score": 1.0, + "content": "In this section, we study deep linear networks with", + "type": "text" + }, + { + "bbox": [ + 313, + 201, + 338, + 212 + ], + "score": 0.89, + "content": "\\ell \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 199, + 505, + 213 + ], + "score": 1.0, + "content": "layers. We denote the weight parameters", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 208, + 506, + 225 + ], + "spans": [ + { + "bbox": [ + 104, + 208, + 194, + 225 + ], + "score": 1.0, + "content": "between the layers as", + "type": "text" + }, + { + "bbox": [ + 194, + 211, + 261, + 222 + ], + "score": 0.89, + "content": "\\dot { \\pmb { A } } _ { k } \\in \\dot { \\mathbb { R } } ^ { d _ { k } \\times d _ { k - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 208, + 277, + 225 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 277, + 212, + 329, + 223 + ], + "score": 0.91, + "content": "k = 1 , \\dots , \\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 208, + 506, + 225 + ], + "score": 1.0, + "content": ", respectively. The input and output data are", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 219, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 104, + 219, + 154, + 236 + ], + "score": 1.0, + "content": "denoted by", + "type": "text" + }, + { + "bbox": [ + 154, + 222, + 208, + 234 + ], + "score": 0.7, + "content": "\\pmb { X } ^ { ' } \\in \\mathbb { R } ^ { d _ { 0 } \\times m }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 219, + 212, + 236 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 212, + 222, + 265, + 233 + ], + "score": 0.77, + "content": "\\pmb { Y } \\in \\mathbb { R } ^ { d _ { \\ell } \\times m }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 219, + 506, + 236 + ], + "score": 1.0, + "content": ", respectively. We are interested in the square loss function", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 232, + 278, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 278, + 246 + ], + "score": 1.0, + "content": "of deep linear networks, which is given by", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 250, + 379, + 266 + ], + "lines": [ + { + "bbox": [ + 231, + 250, + 379, + 266 + ], + "spans": [ + { + "bbox": [ + 231, + 250, + 379, + 266 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } _ { D } : = \\frac { 1 } { 2 } \\left\\| A _ { \\ell } \\cdot \\cdot \\cdot A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\right\\| _ { F } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "0b84062910ad34bc57fc3026675fcb62088e03bbcd338e139bb2d787fc004bae.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 231, + 250, + 379, + 266 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 270, + 505, + 330 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 139, + 285 + ], + "score": 1.0, + "content": "Denote", + "type": "text" + }, + { + "bbox": [ + 139, + 271, + 281, + 285 + ], + "score": 0.93, + "content": "\\Sigma _ { k } : = Y ( A _ { ( k , 1 ) } X ) ^ { \\dagger } A _ { ( k , 1 ) } X Y ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 270, + 298, + 285 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 299, + 272, + 355, + 284 + ], + "score": 0.93, + "content": "k = 0 , \\ldots , \\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 270, + 506, + 285 + ], + "score": 1.0, + "content": "with the full singular value decom-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 284, + 504, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 142, + 298 + ], + "score": 1.0, + "content": "position", + "type": "text" + }, + { + "bbox": [ + 142, + 284, + 182, + 297 + ], + "score": 0.91, + "content": "U _ { k } \\pmb { \\Lambda } _ { k } \\pmb { U } _ { k } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 284, + 247, + 298 + ], + "score": 1.0, + "content": ". Suppose that", + "type": "text" + }, + { + "bbox": [ + 247, + 285, + 262, + 296 + ], + "score": 0.87, + "content": "\\Sigma _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 284, + 281, + 298 + ], + "score": 1.0, + "content": "has", + "type": "text" + }, + { + "bbox": [ + 281, + 285, + 300, + 297 + ], + "score": 0.89, + "content": "r ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 284, + 436, + 298 + ], + "score": 1.0, + "content": "distinct positive singular values", + "type": "text" + }, + { + "bbox": [ + 437, + 284, + 504, + 297 + ], + "score": 0.89, + "content": "\\sigma _ { 1 } ( k ) > \\cdots >", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 296, + 163, + 309 + ], + "score": 0.91, + "content": "\\sigma _ { r ( k ) } ( k ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 295, + 243, + 309 + ], + "score": 1.0, + "content": "with multiplicities", + "type": "text" + }, + { + "bbox": [ + 243, + 296, + 330, + 309 + ], + "score": 0.9, + "content": "m _ { 1 } ( k ) , \\ldots , m _ { r ( k ) } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 295, + 406, + 309 + ], + "score": 1.0, + "content": ", respectively, and", + "type": "text" + }, + { + "bbox": [ + 406, + 296, + 429, + 308 + ], + "score": 0.9, + "content": "\\bar { m } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "zero singular val-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 307, + 505, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 414, + 319 + ], + "score": 1.0, + "content": "ues. Our first result provides a full characterization of all critical points of", + "type": "text" + }, + { + "bbox": [ + 414, + 308, + 429, + 318 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 307, + 505, + 319 + ], + "score": 1.0, + "content": ", where we denote", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 317, + 349, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 233, + 331 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( i , j ) } : = \\pmb { A } _ { i } \\pmb { A } _ { i - 1 } \\cdot \\cdot \\cdot \\pmb { A } _ { j + 1 } \\pmb { A } _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 317, + 349, + 330 + ], + "score": 1.0, + "content": "for notational convenience1.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 332, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 106, + 332, + 504, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 389, + 344 + ], + "score": 1.0, + "content": "Theorem 3 (Characterization of critical points). All critical points of", + "type": "text" + }, + { + "bbox": [ + 389, + 333, + 404, + 344 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 332, + 504, + 344 + ], + "score": 1.0, + "content": "are necessarily and suf-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 342, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 104, + 342, + 248, + 356 + ], + "score": 1.0, + "content": "ficiently characterized by matrices", + "type": "text" + }, + { + "bbox": [ + 248, + 343, + 314, + 354 + ], + "score": 0.9, + "content": "\\pmb { L } _ { k } \\in \\mathrm { \\bar { R } } ^ { d _ { k } \\times d _ { k - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 342, + 381, + 356 + ], + "score": 1.0, + "content": ", block matrices", + "type": "text" + }, + { + "bbox": [ + 381, + 343, + 444, + 354 + ], + "score": 0.92, + "content": "\\dot { V } _ { k } \\in \\mathbb { R } ^ { d _ { l } \\times d _ { k + 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 342, + 506, + 356 + ], + "score": 1.0, + "content": "and invertible", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 352, + 507, + 368 + ], + "spans": [ + { + "bbox": [ + 104, + 352, + 143, + 368 + ], + "score": 1.0, + "content": "matrices", + "type": "text" + }, + { + "bbox": [ + 144, + 353, + 217, + 366 + ], + "score": 0.9, + "content": "C _ { k } \\in \\mathbb { R } ^ { d _ { k + 1 } \\times \\tilde { d _ { k + 1 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 352, + 232, + 368 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 232, + 355, + 298, + 366 + ], + "score": 0.86, + "content": "k = 0 , \\ldots , \\ell { - } 2", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 352, + 336, + 368 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 337, + 355, + 385, + 366 + ], + "score": 0.91, + "content": "A _ { 1 } , \\ldots , A _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 352, + 507, + 368 + ], + "score": 1.0, + "content": "can be individually expressed", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 366, + 299, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 299, + 378 + ], + "score": 1.0, + "content": "out recursively via the following two equations:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 381, + 477, + 399 + ], + "lines": [ + { + "bbox": [ + 120, + 381, + 477, + 399 + ], + "spans": [ + { + "bbox": [ + 120, + 381, + 477, + 399 + ], + "score": 0.76, + "content": "A _ { k + 1 } = C _ { k } ^ { - 1 } V _ { k } ^ { \\top } U _ { k } ^ { \\top } Y ( A _ { ( k , 1 ) } X ) ^ { \\dagger } + L _ { k + 1 } - C _ { k } ^ { - 1 } V _ { k } ^ { \\top } V _ { k } C _ { k } L _ { k + 1 } A _ { ( k , 1 ) } X ( A _ { ( k , 1 ) } X ) ^ { \\dagger } ,", + "type": "interline_equation", + "image_path": "fa341665d9ffee275d195cdef85335d57e5997030e84561d580d0dd2dea29971.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 120, + 381, + 477, + 399 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 417, + 506, + 476 + ], + "lines": [ + { + "bbox": [ + 102, + 413, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 102, + 418, + 161, + 437 + ], + "score": 1.0, + "content": "Specifically,", + "type": "text" + }, + { + "bbox": [ + 161, + 417, + 429, + 437 + ], + "score": 0.65, + "content": "\\begin{array} { r l r } { V _ { k } } & { = } & { [ \\mathrm { d i a g } ( { V } _ { 1 } ^ { ( k ) } , \\ldots , { V } _ { r ( k ) } ^ { ( k ) } , \\overline { { V } } ^ { ( k ) } ) , \\mathbf { 0 } ^ { d _ { l } \\times ( d _ { k + 1 } - \\mathrm { r a n k } ( { A } _ { ( \\ell , k + 2 ) } ) ) } ] , } \\end{array}", + "type": "inline_equation", + "image_path": "c8007b3f1887ca41670da5749f3a953b2d115c9ec01954f34f2746a59598ab65.jpg" + }, + { + "bbox": [ + 429, + 413, + 466, + 438 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 466, + 418, + 505, + 434 + ], + "score": 0.89, + "content": "V _ { i } ^ { ( k ) } ~ \\in \\qquad ", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 432, + 507, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 255, + 450 + ], + "score": 0.56, + "content": "\\mathbb { R } ^ { m _ { i } ( k ) \\times p _ { i } ( k ) } , ~ \\overline { { V } } ^ { ( k ) } ~ \\in ~ \\mathbb { R } ^ { \\bar { m } ( k ) \\times \\bar { p } ( k ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 432, + 419, + 454 + ], + "score": 1.0, + "content": "consist of orthonormal columns with", + "type": "text" + }, + { + "bbox": [ + 419, + 439, + 487, + 452 + ], + "score": 0.91, + "content": "p _ { i } ( k ) ~ \\leq ~ m _ { i } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 432, + 507, + 454 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 445, + 504, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 235, + 465 + ], + "score": 0.67, + "content": "i = 1 , \\ldots , r ( k ) , \\bar { p } ( k ) \\leq \\bar { m } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 445, + 279, + 471 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 279, + 451, + 433, + 465 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( k ) } p _ { i } ( k ) + \\bar { p } ( k ) = \\mathrm { r a n k } ( A _ { \\ell , k + 1 } ) . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 445, + 456, + 471 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 457, + 453, + 504, + 465 + ], + "score": 0.91, + "content": "\\mathbf { \\Delta } _ { L _ { k } , V _ { k } , C _ { k } }", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 464, + 218, + 476 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 148, + 476 + ], + "score": 1.0, + "content": "satisfy for", + "type": "text" + }, + { + "bbox": [ + 149, + 465, + 218, + 475 + ], + "score": 0.89, + "content": "k = 2 , \\ldots , \\ell - 1", + "type": "inline_equation" + } + ], + "index": 26 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 173, + 479, + 438, + 497 + ], + "lines": [ + { + "bbox": [ + 173, + 479, + 438, + 497 + ], + "spans": [ + { + "bbox": [ + 173, + 479, + 438, + 497 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , k ) } = \\pmb { A } _ { ( \\ell , k + 1 ) } \\pmb { A } _ { k } , \\quad ( \\pmb { I } - \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { ( \\ell , k + 1 ) } ) } ) \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell - 1 , 1 ) } ^ { \\top } = \\pmb { 0 } . } \\end{array}", + "type": "interline_equation", + "image_path": "8d82206858323bcc813ffdcc46305678731b008cf722193b0fa526c2d3ba0062.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 173, + 479, + 438, + 497 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 506, + 505, + 639 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 305, + 519 + ], + "score": 1.0, + "content": "Note that the forms of the individual parameters", + "type": "text" + }, + { + "bbox": [ + 305, + 507, + 354, + 518 + ], + "score": 0.92, + "content": "A _ { 1 } , \\ldots , A _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "can be obtained as follows by recur-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 516, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 104, + 516, + 314, + 532 + ], + "score": 1.0, + "content": "sively applying eqs. (4) and (5). First, eq. (5) with", + "type": "text" + }, + { + "bbox": [ + 314, + 519, + 341, + 528 + ], + "score": 0.89, + "content": "k = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 516, + 418, + 532 + ], + "score": 1.0, + "content": "yields the form of", + "type": "text" + }, + { + "bbox": [ + 419, + 518, + 444, + 531 + ], + "score": 0.89, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 516, + 506, + 532 + ], + "score": 1.0, + "content": ". Then, eq. (4)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 127, + 543 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 529, + 154, + 539 + ], + "score": 0.9, + "content": "k = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 528, + 221, + 543 + ], + "score": 1.0, + "content": "and the form of", + "type": "text" + }, + { + "bbox": [ + 221, + 529, + 246, + 542 + ], + "score": 0.91, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 528, + 319, + 543 + ], + "score": 1.0, + "content": "yield the form of", + "type": "text" + }, + { + "bbox": [ + 320, + 529, + 334, + 540 + ], + "score": 0.89, + "content": "\\pmb { A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 528, + 413, + 543 + ], + "score": 1.0, + "content": ". Next, eq. (5) with", + "type": "text" + }, + { + "bbox": [ + 414, + 530, + 440, + 539 + ], + "score": 0.88, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "yields the form", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 538, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 104, + 538, + 118, + 554 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 540, + 144, + 553 + ], + "score": 0.9, + "content": "\\mathbf { \\delta A } _ { ( \\ell , 3 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 538, + 239, + 554 + ], + "score": 1.0, + "content": ", and then, eq. (4) with", + "type": "text" + }, + { + "bbox": [ + 240, + 541, + 267, + 550 + ], + "score": 0.9, + "content": "\\dot { k } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 538, + 339, + 554 + ], + "score": 1.0, + "content": "and the forms of", + "type": "text" + }, + { + "bbox": [ + 339, + 540, + 383, + 553 + ], + "score": 0.92, + "content": "A _ { ( \\ell , 3 ) } , A _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 538, + 487, + 554 + ], + "score": 1.0, + "content": "further yield the form of", + "type": "text" + }, + { + "bbox": [ + 487, + 540, + 501, + 551 + ], + "score": 0.87, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 538, + 506, + 554 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "Inductively, one obtains the expressions of all individual parameter matrices. Furthermore, the first", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 562, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 562, + 506, + 574 + ], + "score": 1.0, + "content": "condition in eq. (6) is a consistency condition that guarantees that the analytical form for the entire", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 573, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 505, + 585 + ], + "score": 1.0, + "content": "product of parameter matrices factorizes into the forms of individual parameter matrices. Similarly", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 582, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 104, + 582, + 505, + 597 + ], + "score": 1.0, + "content": "to shallow linear networks, while the set of critical points here is also uncountable, Theorem 3 sug-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 594, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 372, + 608 + ], + "score": 1.0, + "content": "gests ways to obtain some critical points. For example, if we set", + "type": "text" + }, + { + "bbox": [ + 372, + 595, + 407, + 606 + ], + "score": 0.91, + "content": "\\pmb { L } _ { k } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 594, + 436, + 608 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 436, + 595, + 443, + 605 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 594, + 506, + 608 + ], + "score": 1.0, + "content": "(i.e., eq. (6) is", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 390, + 618 + ], + "score": 1.0, + "content": "satisfied), we can obtain the form of critical points for any invertible", + "type": "text" + }, + { + "bbox": [ + 391, + 606, + 405, + 617 + ], + "score": 0.88, + "content": "C _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 604, + 454, + 618 + ], + "score": 1.0, + "content": "and proper", + "type": "text" + }, + { + "bbox": [ + 455, + 606, + 467, + 617 + ], + "score": 0.87, + "content": "V _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 604, + 505, + 618 + ], + "score": 1.0, + "content": "with the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 617, + 504, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 293, + 629 + ], + "score": 1.0, + "content": "structure specified in Theorem 3. For nonzero", + "type": "text" + }, + { + "bbox": [ + 293, + 617, + 306, + 628 + ], + "score": 0.9, + "content": "\\scriptstyle L _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 617, + 458, + 629 + ], + "score": 1.0, + "content": ", eq. (6) needs to be verified for given", + "type": "text" + }, + { + "bbox": [ + 459, + 617, + 472, + 628 + ], + "score": 0.88, + "content": "C _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 617, + 491, + 629 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 491, + 617, + 504, + 628 + ], + "score": 0.88, + "content": "V _ { k }", + "type": "inline_equation" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 628, + 221, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 221, + 639 + ], + "score": 1.0, + "content": "to determine a critical point.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 645, + 505, + 681 + ], + "lines": [ + { + "bbox": [ + 102, + 640, + 509, + 672 + ], + "spans": [ + { + "bbox": [ + 102, + 640, + 324, + 672 + ], + "score": 1.0, + "content": "Similarly to shallow linear networks, the parameters loss function at the critical points and further specify t", + "type": "text" + }, + { + "bbox": [ + 324, + 644, + 393, + 659 + ], + "score": 0.92, + "content": "\\{ p _ { i } ( 0 ) \\} _ { i = 1 } ^ { r ( 0 ) } , \\bar { p } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 640, + 509, + 672 + ], + "score": 1.0, + "content": "determine the value of them for the global minimizers,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 670, + 299, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 299, + 681 + ], + "score": 1.0, + "content": "as we present in the following two propositions.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 107, + 683, + 362, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 682, + 362, + 698 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 243, + 698 + ], + "score": 1.0, + "content": "Proposition 4. Any critical point", + "type": "text" + }, + { + "bbox": [ + 244, + 684, + 299, + 696 + ], + "score": 0.91, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 682, + 311, + 698 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 311, + 684, + 326, + 695 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 682, + 362, + 698 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 700, + 417, + 718 + ], + "lines": [ + { + "bbox": [ + 192, + 700, + 417, + 718 + ], + "spans": [ + { + "bbox": [ + 192, + 700, + 417, + 718 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } _ { D } ( A _ { 1 } , \\ldots , A _ { \\ell } ) = \\frac { 1 } { 2 } \\big [ \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) \\big ] . } \\end{array}", + "type": "interline_equation", + "image_path": "881328ac75c4a3a201a60a035965154a2a739adb2fba44ad119fb9cd8a87131e.jpg" + } + ] + } + ], + "index": 43, + "virtual_lines": [ + { + "bbox": [ + 192, + 700, + 417, + 718 + ], + "spans": [], + "index": 43 + } + ] + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 120, + 721, + 324, + 732 + ], + "lines": [ + { + "bbox": [ + 120, + 720, + 325, + 734 + ], + "spans": [ + { + "bbox": [ + 120, + 720, + 145, + 734 + ], + "score": 1.0, + "content": "1Here,", + "type": "text" + }, + { + "bbox": [ + 145, + 721, + 169, + 733 + ], + "score": 0.9, + "content": "\\pmb { A } _ { ( 0 , 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 720, + 315, + 734 + ], + "score": 1.0, + "content": "should be understood as identity matrix", + "type": "text" + }, + { + "bbox": [ + 315, + 722, + 321, + 730 + ], + "score": 0.8, + "content": "\\pmb { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 720, + 325, + 734 + ], + "score": 1.0, + "content": ".", + "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": "text", + "bbox": [ + 106, + 82, + 505, + 160 + ], + "lines": [], + "index": 3, + "bbox_fs": [ + 105, + 82, + 506, + 159 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 175, + 307, + 189 + ], + "lines": [ + { + "bbox": [ + 104, + 174, + 308, + 191 + ], + "spans": [ + { + "bbox": [ + 104, + 174, + 308, + 191 + ], + "score": 1.0, + "content": "3 DEEP LINEAR NEURAL NETWORKS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 200, + 505, + 245 + ], + "lines": [ + { + "bbox": [ + 105, + 199, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 313, + 213 + ], + "score": 1.0, + "content": "In this section, we study deep linear networks with", + "type": "text" + }, + { + "bbox": [ + 313, + 201, + 338, + 212 + ], + "score": 0.89, + "content": "\\ell \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 199, + 505, + 213 + ], + "score": 1.0, + "content": "layers. We denote the weight parameters", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 208, + 506, + 225 + ], + "spans": [ + { + "bbox": [ + 104, + 208, + 194, + 225 + ], + "score": 1.0, + "content": "between the layers as", + "type": "text" + }, + { + "bbox": [ + 194, + 211, + 261, + 222 + ], + "score": 0.89, + "content": "\\dot { \\pmb { A } } _ { k } \\in \\dot { \\mathbb { R } } ^ { d _ { k } \\times d _ { k - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 208, + 277, + 225 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 277, + 212, + 329, + 223 + ], + "score": 0.91, + "content": "k = 1 , \\dots , \\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 208, + 506, + 225 + ], + "score": 1.0, + "content": ", respectively. The input and output data are", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 219, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 104, + 219, + 154, + 236 + ], + "score": 1.0, + "content": "denoted by", + "type": "text" + }, + { + "bbox": [ + 154, + 222, + 208, + 234 + ], + "score": 0.7, + "content": "\\pmb { X } ^ { ' } \\in \\mathbb { R } ^ { d _ { 0 } \\times m }", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 219, + 212, + 236 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 212, + 222, + 265, + 233 + ], + "score": 0.77, + "content": "\\pmb { Y } \\in \\mathbb { R } ^ { d _ { \\ell } \\times m }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 219, + 506, + 236 + ], + "score": 1.0, + "content": ", respectively. We are interested in the square loss function", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 232, + 278, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 278, + 246 + ], + "score": 1.0, + "content": "of deep linear networks, which is given by", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 104, + 199, + 506, + 246 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 250, + 379, + 266 + ], + "lines": [ + { + "bbox": [ + 231, + 250, + 379, + 266 + ], + "spans": [ + { + "bbox": [ + 231, + 250, + 379, + 266 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } _ { D } : = \\frac { 1 } { 2 } \\left\\| A _ { \\ell } \\cdot \\cdot \\cdot A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\right\\| _ { F } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "0b84062910ad34bc57fc3026675fcb62088e03bbcd338e139bb2d787fc004bae.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 231, + 250, + 379, + 266 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 270, + 505, + 330 + ], + "lines": [ + { + "bbox": [ + 105, + 270, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 139, + 285 + ], + "score": 1.0, + "content": "Denote", + "type": "text" + }, + { + "bbox": [ + 139, + 271, + 281, + 285 + ], + "score": 0.93, + "content": "\\Sigma _ { k } : = Y ( A _ { ( k , 1 ) } X ) ^ { \\dagger } A _ { ( k , 1 ) } X Y ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 270, + 298, + 285 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 299, + 272, + 355, + 284 + ], + "score": 0.93, + "content": "k = 0 , \\ldots , \\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 270, + 506, + 285 + ], + "score": 1.0, + "content": "with the full singular value decom-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 284, + 504, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 284, + 142, + 298 + ], + "score": 1.0, + "content": "position", + "type": "text" + }, + { + "bbox": [ + 142, + 284, + 182, + 297 + ], + "score": 0.91, + "content": "U _ { k } \\pmb { \\Lambda } _ { k } \\pmb { U } _ { k } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 284, + 247, + 298 + ], + "score": 1.0, + "content": ". Suppose that", + "type": "text" + }, + { + "bbox": [ + 247, + 285, + 262, + 296 + ], + "score": 0.87, + "content": "\\Sigma _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 284, + 281, + 298 + ], + "score": 1.0, + "content": "has", + "type": "text" + }, + { + "bbox": [ + 281, + 285, + 300, + 297 + ], + "score": 0.89, + "content": "r ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 284, + 436, + 298 + ], + "score": 1.0, + "content": "distinct positive singular values", + "type": "text" + }, + { + "bbox": [ + 437, + 284, + 504, + 297 + ], + "score": 0.89, + "content": "\\sigma _ { 1 } ( k ) > \\cdots >", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 296, + 163, + 309 + ], + "score": 0.91, + "content": "\\sigma _ { r ( k ) } ( k ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 295, + 243, + 309 + ], + "score": 1.0, + "content": "with multiplicities", + "type": "text" + }, + { + "bbox": [ + 243, + 296, + 330, + 309 + ], + "score": 0.9, + "content": "m _ { 1 } ( k ) , \\ldots , m _ { r ( k ) } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 295, + 406, + 309 + ], + "score": 1.0, + "content": ", respectively, and", + "type": "text" + }, + { + "bbox": [ + 406, + 296, + 429, + 308 + ], + "score": 0.9, + "content": "\\bar { m } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "zero singular val-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 307, + 505, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 414, + 319 + ], + "score": 1.0, + "content": "ues. Our first result provides a full characterization of all critical points of", + "type": "text" + }, + { + "bbox": [ + 414, + 308, + 429, + 318 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 307, + 505, + 319 + ], + "score": 1.0, + "content": ", where we denote", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 317, + 349, + 331 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 233, + 331 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( i , j ) } : = \\pmb { A } _ { i } \\pmb { A } _ { i - 1 } \\cdot \\cdot \\cdot \\pmb { A } _ { j + 1 } \\pmb { A } _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 317, + 349, + 330 + ], + "score": 1.0, + "content": "for notational convenience1.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 270, + 506, + 331 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 332, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 106, + 332, + 504, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 389, + 344 + ], + "score": 1.0, + "content": "Theorem 3 (Characterization of critical points). All critical points of", + "type": "text" + }, + { + "bbox": [ + 389, + 333, + 404, + 344 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 332, + 504, + 344 + ], + "score": 1.0, + "content": "are necessarily and suf-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 342, + 506, + 356 + ], + "spans": [ + { + "bbox": [ + 104, + 342, + 248, + 356 + ], + "score": 1.0, + "content": "ficiently characterized by matrices", + "type": "text" + }, + { + "bbox": [ + 248, + 343, + 314, + 354 + ], + "score": 0.9, + "content": "\\pmb { L } _ { k } \\in \\mathrm { \\bar { R } } ^ { d _ { k } \\times d _ { k - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 342, + 381, + 356 + ], + "score": 1.0, + "content": ", block matrices", + "type": "text" + }, + { + "bbox": [ + 381, + 343, + 444, + 354 + ], + "score": 0.92, + "content": "\\dot { V } _ { k } \\in \\mathbb { R } ^ { d _ { l } \\times d _ { k + 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 445, + 342, + 506, + 356 + ], + "score": 1.0, + "content": "and invertible", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 352, + 507, + 368 + ], + "spans": [ + { + "bbox": [ + 104, + 352, + 143, + 368 + ], + "score": 1.0, + "content": "matrices", + "type": "text" + }, + { + "bbox": [ + 144, + 353, + 217, + 366 + ], + "score": 0.9, + "content": "C _ { k } \\in \\mathbb { R } ^ { d _ { k + 1 } \\times \\tilde { d _ { k + 1 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 352, + 232, + 368 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 232, + 355, + 298, + 366 + ], + "score": 0.86, + "content": "k = 0 , \\ldots , \\ell { - } 2", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 352, + 336, + 368 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 337, + 355, + 385, + 366 + ], + "score": 0.91, + "content": "A _ { 1 } , \\ldots , A _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 352, + 507, + 368 + ], + "score": 1.0, + "content": "can be individually expressed", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 366, + 299, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 299, + 378 + ], + "score": 1.0, + "content": "out recursively via the following two equations:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 104, + 332, + 507, + 378 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 381, + 477, + 399 + ], + "lines": [ + { + "bbox": [ + 120, + 381, + 477, + 399 + ], + "spans": [ + { + "bbox": [ + 120, + 381, + 477, + 399 + ], + "score": 0.76, + "content": "A _ { k + 1 } = C _ { k } ^ { - 1 } V _ { k } ^ { \\top } U _ { k } ^ { \\top } Y ( A _ { ( k , 1 ) } X ) ^ { \\dagger } + L _ { k + 1 } - C _ { k } ^ { - 1 } V _ { k } ^ { \\top } V _ { k } C _ { k } L _ { k + 1 } A _ { ( k , 1 ) } X ( A _ { ( k , 1 ) } X ) ^ { \\dagger } ,", + "type": "interline_equation", + "image_path": "fa341665d9ffee275d195cdef85335d57e5997030e84561d580d0dd2dea29971.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 120, + 381, + 477, + 399 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 417, + 506, + 476 + ], + "lines": [ + { + "bbox": [ + 102, + 413, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 102, + 418, + 161, + 437 + ], + "score": 1.0, + "content": "Specifically,", + "type": "text" + }, + { + "bbox": [ + 161, + 417, + 429, + 437 + ], + "score": 0.65, + "content": "\\begin{array} { r l r } { V _ { k } } & { = } & { [ \\mathrm { d i a g } ( { V } _ { 1 } ^ { ( k ) } , \\ldots , { V } _ { r ( k ) } ^ { ( k ) } , \\overline { { V } } ^ { ( k ) } ) , \\mathbf { 0 } ^ { d _ { l } \\times ( d _ { k + 1 } - \\mathrm { r a n k } ( { A } _ { ( \\ell , k + 2 ) } ) ) } ] , } \\end{array}", + "type": "inline_equation", + "image_path": "c8007b3f1887ca41670da5749f3a953b2d115c9ec01954f34f2746a59598ab65.jpg" + }, + { + "bbox": [ + 429, + 413, + 466, + 438 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 466, + 418, + 505, + 434 + ], + "score": 0.89, + "content": "V _ { i } ^ { ( k ) } ~ \\in \\qquad ", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 432, + 507, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 255, + 450 + ], + "score": 0.56, + "content": "\\mathbb { R } ^ { m _ { i } ( k ) \\times p _ { i } ( k ) } , ~ \\overline { { V } } ^ { ( k ) } ~ \\in ~ \\mathbb { R } ^ { \\bar { m } ( k ) \\times \\bar { p } ( k ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 432, + 419, + 454 + ], + "score": 1.0, + "content": "consist of orthonormal columns with", + "type": "text" + }, + { + "bbox": [ + 419, + 439, + 487, + 452 + ], + "score": 0.91, + "content": "p _ { i } ( k ) ~ \\leq ~ m _ { i } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 432, + 507, + 454 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 445, + 504, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 235, + 465 + ], + "score": 0.67, + "content": "i = 1 , \\ldots , r ( k ) , \\bar { p } ( k ) \\leq \\bar { m } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 445, + 279, + 471 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 279, + 451, + 433, + 465 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( k ) } p _ { i } ( k ) + \\bar { p } ( k ) = \\mathrm { r a n k } ( A _ { \\ell , k + 1 } ) . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 445, + 456, + 471 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 457, + 453, + 504, + 465 + ], + "score": 0.91, + "content": "\\mathbf { \\Delta } _ { L _ { k } , V _ { k } , C _ { k } }", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 464, + 218, + 476 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 148, + 476 + ], + "score": 1.0, + "content": "satisfy for", + "type": "text" + }, + { + "bbox": [ + 149, + 465, + 218, + 475 + ], + "score": 0.89, + "content": "k = 2 , \\ldots , \\ell - 1", + "type": "inline_equation" + } + ], + "index": 26 + } + ], + "index": 24.5, + "bbox_fs": [ + 102, + 413, + 507, + 476 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 173, + 479, + 438, + 497 + ], + "lines": [ + { + "bbox": [ + 173, + 479, + 438, + 497 + ], + "spans": [ + { + "bbox": [ + 173, + 479, + 438, + 497 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , k ) } = \\pmb { A } _ { ( \\ell , k + 1 ) } \\pmb { A } _ { k } , \\quad ( \\pmb { I } - \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { ( \\ell , k + 1 ) } ) } ) \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell - 1 , 1 ) } ^ { \\top } = \\pmb { 0 } . } \\end{array}", + "type": "interline_equation", + "image_path": "8d82206858323bcc813ffdcc46305678731b008cf722193b0fa526c2d3ba0062.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 173, + 479, + 438, + 497 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 506, + 505, + 639 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 305, + 519 + ], + "score": 1.0, + "content": "Note that the forms of the individual parameters", + "type": "text" + }, + { + "bbox": [ + 305, + 507, + 354, + 518 + ], + "score": 0.92, + "content": "A _ { 1 } , \\ldots , A _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "can be obtained as follows by recur-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 516, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 104, + 516, + 314, + 532 + ], + "score": 1.0, + "content": "sively applying eqs. (4) and (5). First, eq. (5) with", + "type": "text" + }, + { + "bbox": [ + 314, + 519, + 341, + 528 + ], + "score": 0.89, + "content": "k = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 516, + 418, + 532 + ], + "score": 1.0, + "content": "yields the form of", + "type": "text" + }, + { + "bbox": [ + 419, + 518, + 444, + 531 + ], + "score": 0.89, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 516, + 506, + 532 + ], + "score": 1.0, + "content": ". Then, eq. (4)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 528, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 127, + 543 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 529, + 154, + 539 + ], + "score": 0.9, + "content": "k = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 528, + 221, + 543 + ], + "score": 1.0, + "content": "and the form of", + "type": "text" + }, + { + "bbox": [ + 221, + 529, + 246, + 542 + ], + "score": 0.91, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 528, + 319, + 543 + ], + "score": 1.0, + "content": "yield the form of", + "type": "text" + }, + { + "bbox": [ + 320, + 529, + 334, + 540 + ], + "score": 0.89, + "content": "\\pmb { A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 528, + 413, + 543 + ], + "score": 1.0, + "content": ". Next, eq. (5) with", + "type": "text" + }, + { + "bbox": [ + 414, + 530, + 440, + 539 + ], + "score": 0.88, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 528, + 506, + 543 + ], + "score": 1.0, + "content": "yields the form", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 538, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 104, + 538, + 118, + 554 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 540, + 144, + 553 + ], + "score": 0.9, + "content": "\\mathbf { \\delta A } _ { ( \\ell , 3 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 538, + 239, + 554 + ], + "score": 1.0, + "content": ", and then, eq. (4) with", + "type": "text" + }, + { + "bbox": [ + 240, + 541, + 267, + 550 + ], + "score": 0.9, + "content": "\\dot { k } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 538, + 339, + 554 + ], + "score": 1.0, + "content": "and the forms of", + "type": "text" + }, + { + "bbox": [ + 339, + 540, + 383, + 553 + ], + "score": 0.92, + "content": "A _ { ( \\ell , 3 ) } , A _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 538, + 487, + 554 + ], + "score": 1.0, + "content": "further yield the form of", + "type": "text" + }, + { + "bbox": [ + 487, + 540, + 501, + 551 + ], + "score": 0.87, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 538, + 506, + 554 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "Inductively, one obtains the expressions of all individual parameter matrices. Furthermore, the first", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 562, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 562, + 506, + 574 + ], + "score": 1.0, + "content": "condition in eq. (6) is a consistency condition that guarantees that the analytical form for the entire", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 573, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 505, + 585 + ], + "score": 1.0, + "content": "product of parameter matrices factorizes into the forms of individual parameter matrices. Similarly", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 582, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 104, + 582, + 505, + 597 + ], + "score": 1.0, + "content": "to shallow linear networks, while the set of critical points here is also uncountable, Theorem 3 sug-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 594, + 506, + 608 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 372, + 608 + ], + "score": 1.0, + "content": "gests ways to obtain some critical points. For example, if we set", + "type": "text" + }, + { + "bbox": [ + 372, + 595, + 407, + 606 + ], + "score": 0.91, + "content": "\\pmb { L } _ { k } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 594, + 436, + 608 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 436, + 595, + 443, + 605 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 594, + 506, + 608 + ], + "score": 1.0, + "content": "(i.e., eq. (6) is", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 604, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 390, + 618 + ], + "score": 1.0, + "content": "satisfied), we can obtain the form of critical points for any invertible", + "type": "text" + }, + { + "bbox": [ + 391, + 606, + 405, + 617 + ], + "score": 0.88, + "content": "C _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 604, + 454, + 618 + ], + "score": 1.0, + "content": "and proper", + "type": "text" + }, + { + "bbox": [ + 455, + 606, + 467, + 617 + ], + "score": 0.87, + "content": "V _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 604, + 505, + 618 + ], + "score": 1.0, + "content": "with the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 617, + 504, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 293, + 629 + ], + "score": 1.0, + "content": "structure specified in Theorem 3. For nonzero", + "type": "text" + }, + { + "bbox": [ + 293, + 617, + 306, + 628 + ], + "score": 0.9, + "content": "\\scriptstyle L _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 617, + 458, + 629 + ], + "score": 1.0, + "content": ", eq. (6) needs to be verified for given", + "type": "text" + }, + { + "bbox": [ + 459, + 617, + 472, + 628 + ], + "score": 0.88, + "content": "C _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 617, + 491, + 629 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 491, + 617, + 504, + 628 + ], + "score": 0.88, + "content": "V _ { k }", + "type": "inline_equation" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 628, + 221, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 221, + 639 + ], + "score": 1.0, + "content": "to determine a critical point.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 33.5, + "bbox_fs": [ + 104, + 506, + 506, + 639 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 645, + 505, + 681 + ], + "lines": [ + { + "bbox": [ + 102, + 640, + 509, + 672 + ], + "spans": [ + { + "bbox": [ + 102, + 640, + 324, + 672 + ], + "score": 1.0, + "content": "Similarly to shallow linear networks, the parameters loss function at the critical points and further specify t", + "type": "text" + }, + { + "bbox": [ + 324, + 644, + 393, + 659 + ], + "score": 0.92, + "content": "\\{ p _ { i } ( 0 ) \\} _ { i = 1 } ^ { r ( 0 ) } , \\bar { p } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 640, + 509, + 672 + ], + "score": 1.0, + "content": "determine the value of them for the global minimizers,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 670, + 299, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 299, + 681 + ], + "score": 1.0, + "content": "as we present in the following two propositions.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 102, + 640, + 509, + 681 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 683, + 362, + 696 + ], + "lines": [ + { + "bbox": [ + 105, + 682, + 362, + 698 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 243, + 698 + ], + "score": 1.0, + "content": "Proposition 4. Any critical point", + "type": "text" + }, + { + "bbox": [ + 244, + 684, + 299, + 696 + ], + "score": 0.91, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 682, + 311, + 698 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 311, + 684, + 326, + 695 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 682, + 362, + 698 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 682, + 362, + 698 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 700, + 417, + 718 + ], + "lines": [ + { + "bbox": [ + 192, + 700, + 417, + 718 + ], + "spans": [ + { + "bbox": [ + 192, + 700, + 417, + 718 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } _ { D } ( A _ { 1 } , \\ldots , A _ { \\ell } ) = \\frac { 1 } { 2 } \\big [ \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) \\big ] . } \\end{array}", + "type": "interline_equation", + "image_path": "881328ac75c4a3a201a60a035965154a2a739adb2fba44ad119fb9cd8a87131e.jpg" + } + ] + } + ], + "index": 43, + "virtual_lines": [ + { + "bbox": [ + 192, + 700, + 417, + 718 + ], + "spans": [], + "index": 43 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 504, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 401, + 96 + ], + "score": 1.0, + "content": "Proposition 5 (Characterization of global minimizers). A critical point", + "type": "text" + }, + { + "bbox": [ + 401, + 82, + 457, + 95 + ], + "score": 0.9, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 81, + 470, + 96 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 470, + 83, + 486, + 94 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 81, + 497, + 96 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 497, + 84, + 504, + 93 + ], + "score": 0.29, + "content": "a", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 374, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 374, + 106 + ], + "score": 1.0, + "content": "global minimizer if and only if it falls into the following two cases.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 506, + 180 + ], + "lines": [ + { + "bbox": [ + 102, + 105, + 504, + 132 + ], + "spans": [ + { + "bbox": [ + 102, + 105, + 142, + 132 + ], + "score": 1.0, + "content": "1. Case", + "type": "text" + }, + { + "bbox": [ + 143, + 113, + 149, + 123 + ], + "score": 0.26, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 105, + 156, + 132 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 156, + 110, + 297, + 125 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} \\ \\le \\ \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 105, + 301, + 132 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 302, + 112, + 328, + 126 + ], + "score": 0.86, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 105, + 466, + 132 + ], + "score": 1.0, + "content": "achieves the maximal rank, and", + "type": "text" + }, + { + "bbox": [ + 467, + 113, + 504, + 125 + ], + "score": 0.9, + "content": "p _ { 1 } ( 0 ) =", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 118, + 124, + 506, + 143 + ], + "spans": [ + { + "bbox": [ + 118, + 126, + 464, + 140 + ], + "score": 0.75, + "content": "m _ { 1 } ( 0 ) , \\ldots , p _ { k - 1 } ( 0 ) = m _ { k - 1 } ( 0 ) , p _ { k } ( 0 ) = \\mathrm { r a n k } ( A _ { ( \\ell , 2 ) } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \\leq m _ { k } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 124, + 506, + 143 + ], + "score": 1.0, + "content": "for some", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 119, + 137, + 162, + 153 + ], + "spans": [ + { + "bbox": [ + 119, + 139, + 156, + 151 + ], + "score": 0.78, + "content": "k \\leq r ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 137, + 162, + 153 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 102, + 147, + 507, + 170 + ], + "spans": [ + { + "bbox": [ + 102, + 147, + 152, + 170 + ], + "score": 1.0, + "content": "2. Case 2:", + "type": "text" + }, + { + "bbox": [ + 153, + 150, + 288, + 166 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 147, + 291, + 170 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 291, + 153, + 352, + 165 + ], + "score": 0.91, + "content": "p _ { i } ( 0 ) = m _ { i } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 147, + 381, + 170 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 381, + 153, + 444, + 165 + ], + "score": 0.92, + "content": "i = 1 , \\ldots , r ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 147, + 463, + 170 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 464, + 153, + 501, + 165 + ], + "score": 0.92, + "content": "\\bar { p } ( 0 ) \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 147, + 507, + 170 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 160, + 430, + 185 + ], + "spans": [ + { + "bbox": [ + 115, + 160, + 174, + 185 + ], + "score": 1.0, + "content": "In particular,", + "type": "text" + }, + { + "bbox": [ + 174, + 167, + 200, + 180 + ], + "score": 0.9, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 160, + 307, + 185 + ], + "score": 1.0, + "content": "can be non-full rank with", + "type": "text" + }, + { + "bbox": [ + 307, + 165, + 423, + 180 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\mathrm { r a n k } ( A _ { ( \\ell , 2 ) } ) = \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 160, + 430, + 185 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 183, + 502, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 504, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 504, + 197 + ], + "score": 1.0, + "content": "The analytical form of any global minimizer can be obtained from Theorem 3 with further specifica-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 195, + 219, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 219, + 208 + ], + "score": 1.0, + "content": "tion to the above two cases.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 224, + 505, + 258 + ], + "lines": [ + { + "bbox": [ + 106, + 224, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 505, + 236 + ], + "score": 1.0, + "content": "In particular for case 1, if we further adopt the invertibility assumptions on data matrices as in Baldi", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 235, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 505, + 248 + ], + "score": 1.0, + "content": "& Hornik (1989) and assume that all parameter matrices are square, then all global minima must", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 247, + 281, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 281, + 259 + ], + "score": 1.0, + "content": "correspond to full rank parameter matrices.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 263, + 505, + 340 + ], + "lines": [ + { + "bbox": [ + 106, + 263, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 506, + 275 + ], + "score": 1.0, + "content": "We next exploit the analytical forms of the critical points to further understand the landscape of", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 275, + 506, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 176, + 287 + ], + "score": 1.0, + "content": "the loss function", + "type": "text" + }, + { + "bbox": [ + 176, + 275, + 191, + 286 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 275, + 479, + 287 + ], + "score": 1.0, + "content": ". It has been shown in Kawaguchi (2016) that every local minimum of", + "type": "text" + }, + { + "bbox": [ + 479, + 275, + 494, + 285 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 275, + 506, + 287 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 285, + 504, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 504, + 297 + ], + "score": 1.0, + "content": "also a global minimum, under certain conditions on the parameter dimensions and the invertibility", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 296, + 505, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 308 + ], + "score": 1.0, + "content": "of the data matrices. Here, our characterization of the analytical forms for the critical points allow", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 307, + 505, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 319 + ], + "score": 1.0, + "content": "us to understand such a result from an alternative viewpoint. The proofs for certain cases (that we", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 318, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 505, + 330 + ], + "score": 1.0, + "content": "discuss below) are simpler and more intuitive, and no assumption is made on the data matrices and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 329, + 217, + 341 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 217, + 341 + ], + "score": 1.0, + "content": "dimensions of the network.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 107, + 345, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 106, + 346, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 346, + 505, + 358 + ], + "score": 1.0, + "content": "Similarly to shallow linear networks, we want to understand the local landscape around the critical", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 357, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 376, + 369 + ], + "score": 1.0, + "content": "points. However, due to the effect of depth, the critical points of", + "type": "text" + }, + { + "bbox": [ + 376, + 357, + 392, + 368 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 357, + 506, + 369 + ], + "score": 1.0, + "content": "are more complicated than", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 367, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 143, + 381 + ], + "score": 1.0, + "content": "those of", + "type": "text" + }, + { + "bbox": [ + 143, + 369, + 151, + 378 + ], + "score": 0.74, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 367, + 505, + 381 + ], + "score": 1.0, + "content": ". Among them, we identify the following subsets of the non-global-minimum critical", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 379, + 222, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 133, + 392 + ], + "score": 1.0, + "content": "points", + "type": "text" + }, + { + "bbox": [ + 134, + 379, + 191, + 391 + ], + "score": 0.94, + "content": "( \\pmb { A } _ { 1 } , \\cdots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 379, + 204, + 392 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 204, + 379, + 219, + 390 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 379, + 222, + 392 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 395, + 506, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 279, + 407 + ], + "score": 1.0, + "content": "• (Deep-non-optimal order): There exist", + "type": "text" + }, + { + "bbox": [ + 279, + 396, + 351, + 407 + ], + "score": 0.9, + "content": "0 \\leq k \\leq \\ell - 2", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 394, + 440, + 407 + ], + "score": 1.0, + "content": "such that the matrix", + "type": "text" + }, + { + "bbox": [ + 440, + 396, + 453, + 407 + ], + "score": 0.87, + "content": "V _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 394, + 505, + 407 + ], + "score": 1.0, + "content": "specified in", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 405, + 495, + 420 + ], + "spans": [ + { + "bbox": [ + 114, + 405, + 258, + 420 + ], + "score": 1.0, + "content": "Theorem 3 satisfies that there exist", + "type": "text" + }, + { + "bbox": [ + 258, + 407, + 329, + 419 + ], + "score": 0.92, + "content": "1 \\leq i < j \\leq r ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 405, + 369, + 420 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 369, + 407, + 430, + 419 + ], + "score": 0.92, + "content": "p _ { i } ( k ) < m _ { i } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 405, + 448, + 420 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 448, + 407, + 491, + 419 + ], + "score": 0.92, + "content": "p _ { j } ( k ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 405, + 495, + 420 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 416, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 107, + 416, + 210, + 431 + ], + "score": 1.0, + "content": "• (Deep-optimal order):", + "type": "text" + }, + { + "bbox": [ + 210, + 418, + 258, + 430 + ], + "score": 0.92, + "content": "\\left( \\mathbf { \\boldsymbol { A } } _ { \\ell } , \\mathbf { \\boldsymbol { A } } _ { \\ell - 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 416, + 378, + 431 + ], + "score": 1.0, + "content": "is not a global minimizer of", + "type": "text" + }, + { + "bbox": [ + 378, + 419, + 393, + 429 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 416, + 416, + 431 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 417, + 419, + 452, + 430 + ], + "score": 0.92, + "content": "A _ { ( \\ell - 2 , 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 416, + 505, + 431 + ], + "score": 1.0, + "content": "being fixed,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 117, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 117, + 430, + 230, + 442 + ], + "score": 0.92, + "content": "\\mathrm { r a n k } ( A _ { \\ell } ) < \\operatorname* { m i n } \\{ d _ { \\ell } , d _ { \\ell - 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 429, + 292, + 443 + ], + "score": 1.0, + "content": ", and the matrix", + "type": "text" + }, + { + "bbox": [ + 293, + 430, + 314, + 442 + ], + "score": 0.92, + "content": "V _ { \\ell - 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 429, + 457, + 443 + ], + "score": 1.0, + "content": "specified in Theorem 3 satisfies that", + "type": "text" + }, + { + "bbox": [ + 458, + 430, + 506, + 442 + ], + "score": 0.9, + "content": "p _ { 1 } ( l - 2 ) =", + "type": "inline_equation" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 441, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 115, + 441, + 506, + 456 + ], + "score": 0.53, + "content": "\\begin{array} { r } { m _ { 1 } ( l - 2 ) , \\ldots , p _ { k - 1 } ( l - 2 ) = m _ { k - 1 } ( l - 2 ) , p _ { k } ( l - 2 ) = \\operatorname { r a n k } ( A _ { l } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( l - 2 ) \\leq m _ { k } ( l - 2 ) } \\end{array}", + "type": "inline_equation", + "image_path": "7eeaee942152d02e7897610503be19c75161fe01b48de66b2159c95107bc9eac.jpg" + } + ], + "index": 27 + }, + { + "bbox": [ + 154, + 455, + 225, + 466 + ], + "spans": [ + { + "bbox": [ + 154, + 455, + 225, + 466 + ], + "score": 0.91, + "content": "1 \\leq k \\leq r ( l - 2 )", + "type": "inline_equation" + } + ], + "index": 28 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 106, + 470, + 503, + 483 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 307, + 484 + ], + "score": 1.0, + "content": "The following result summarizes the landscape of", + "type": "text" + }, + { + "bbox": [ + 307, + 471, + 322, + 482 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 469, + 505, + 484 + ], + "score": 1.0, + "content": "around the above two types of critical points.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 106, + 505, + 484, + 518 + ], + "lines": [ + { + "bbox": [ + 105, + 504, + 486, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 214, + 520 + ], + "score": 1.0, + "content": "Theorem 4 (Landscape of", + "type": "text" + }, + { + "bbox": [ + 214, + 506, + 229, + 517 + ], + "score": 0.86, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 504, + 309, + 520 + ], + "score": 1.0, + "content": "). The loss function", + "type": "text" + }, + { + "bbox": [ + 310, + 506, + 325, + 516 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 504, + 486, + 520 + ], + "score": 1.0, + "content": "has the following landscape properties.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 522, + 506, + 606 + ], + "lines": [ + { + "bbox": [ + 105, + 520, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 331, + 535 + ], + "score": 1.0, + "content": "1. A deep-non-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 332, + 522, + 388, + 534 + ], + "score": 0.88, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 520, + 431, + 535 + ], + "score": 1.0, + "content": "has", + "type": "text" + }, + { + "bbox": [ + 432, + 524, + 439, + 533 + ], + "score": 0.26, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 520, + 506, + 535 + ], + "score": 1.0, + "content": "perturbation", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 119, + 533, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 119, + 533, + 221, + 548 + ], + "score": 0.91, + "content": "( A _ { 1 } , \\ldots , \\widetilde { A } _ { k + 1 } , \\ldots , \\widetilde { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 533, + 248, + 549 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 249, + 533, + 354, + 548 + ], + "score": 0.89, + "content": "\\begin{array} { r c l } { \\operatorname { r a n k } ( \\widetilde { A } _ { \\ell } ) } & { = } & { \\operatorname { r a n k } ( A _ { \\ell } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 533, + 430, + 549 + ], + "score": 1.0, + "content": ", which achieves", + "type": "text" + }, + { + "bbox": [ + 431, + 538, + 438, + 545 + ], + "score": 0.26, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 533, + 506, + 549 + ], + "score": 1.0, + "content": "lower function", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 118, + 545, + 146, + 559 + ], + "spans": [ + { + "bbox": [ + 118, + 545, + 146, + 559 + ], + "score": 1.0, + "content": "value.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 555, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 264, + 570 + ], + "score": 1.0, + "content": "2. A deep-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 264, + 557, + 320, + 569 + ], + "score": 0.92, + "content": "( \\pmb { A } _ { 1 } , \\dots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 555, + 400, + 570 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 401, + 555, + 484, + 569 + ], + "score": 0.92, + "content": "( A _ { 1 } , \\ldots , \\widetilde { A } _ { \\ell - 1 } , \\widetilde { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 555, + 505, + 570 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 119, + 569, + 391, + 583 + ], + "spans": [ + { + "bbox": [ + 119, + 569, + 231, + 583 + ], + "score": 0.92, + "content": "\\mathrm { r a n k } ( \\widetilde { A } _ { \\ell } ) = \\mathrm { r a n k } ( A _ { \\ell } ) + 1 ;", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 569, + 391, + 583 + ], + "score": 1.0, + "content": ", which achieves a lower function value.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 104, + 582, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 104, + 582, + 172, + 597 + ], + "score": 1.0, + "content": "3. Any point in", + "type": "text" + }, + { + "bbox": [ + 173, + 583, + 347, + 597 + ], + "score": 0.86, + "content": "\\mathcal { X } _ { D } : = \\{ ( A _ { 1 } , . . . , A _ { \\ell } ) : A _ { ( \\ell , 1 ) } X \\neq \\mathbf { 0 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 582, + 429, + 597 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 429, + 582, + 484, + 596 + ], + "score": 0.93, + "content": "( A _ { 1 } , \\ldots , \\widetilde { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 582, + 505, + 597 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 118, + 595, + 253, + 607 + ], + "spans": [ + { + "bbox": [ + 118, + 595, + 253, + 607 + ], + "score": 1.0, + "content": "achieves a higher function value.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 611, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 506, + 626 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 165, + 626 + ], + "score": 1.0, + "content": "Consequently,", + "type": "text" + }, + { + "bbox": [ + 166, + 613, + 172, + 622 + ], + "score": 0.39, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 610, + 275, + 626 + ], + "score": 1.0, + "content": ") every local minimum of", + "type": "text" + }, + { + "bbox": [ + 275, + 612, + 290, + 623 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 610, + 506, + 626 + ], + "score": 1.0, + "content": "is also a global minimum for the above two types of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 623, + 444, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 357, + 635 + ], + "score": 1.0, + "content": "critical points; and 2) every critical point of these two types in", + "type": "text" + }, + { + "bbox": [ + 358, + 623, + 373, + 634 + ], + "score": 0.88, + "content": "\\mathcal { X } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 623, + 444, + 635 + ], + "score": 1.0, + "content": "is a saddle point.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 106, + 651, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 506, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 276, + 666 + ], + "score": 1.0, + "content": "Theorem 4 implies that the landscape of", + "type": "text" + }, + { + "bbox": [ + 276, + 653, + 291, + 663 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 651, + 480, + 666 + ], + "score": 1.0, + "content": "for deep linear networks is similar to that of", + "type": "text" + }, + { + "bbox": [ + 480, + 653, + 489, + 662 + ], + "score": 0.81, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 651, + 506, + 666 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 101, + 658, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 101, + 658, + 342, + 684 + ], + "score": 1.0, + "content": "shallow linear networks, i.e., the pattern of the parameters", + "type": "text" + }, + { + "bbox": [ + 342, + 663, + 389, + 678 + ], + "score": 0.94, + "content": "\\{ p _ { i } ( k ) \\} _ { i = 1 } ^ { r ( k ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 658, + 505, + 684 + ], + "score": 1.0, + "content": "implies different descent di-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 677, + 504, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 504, + 690 + ], + "score": 1.0, + "content": "rections of the function value around the critical points. Our approach does not handle the remaining", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 288, + 700 + ], + "score": 1.0, + "content": "set of non-global minimizers, i.e., there exists", + "type": "text" + }, + { + "bbox": [ + 289, + 688, + 326, + 699 + ], + "score": 0.89, + "content": "q \\leq \\ell - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 688, + 365, + 700 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 365, + 688, + 420, + 700 + ], + "score": 0.91, + "content": "( A _ { \\ell } , \\ldots , A _ { q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 688, + 506, + 700 + ], + "score": 1.0, + "content": "is a global minimum", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 104, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 104, + 699, + 141, + 712 + ], + "score": 1.0, + "content": "point of", + "type": "text" + }, + { + "bbox": [ + 141, + 699, + 156, + 710 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 699, + 178, + 712 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 178, + 699, + 215, + 712 + ], + "score": 0.92, + "content": "A _ { ( q - 1 , 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 699, + 285, + 712 + ], + "score": 1.0, + "content": "being fixed, and", + "type": "text" + }, + { + "bbox": [ + 285, + 700, + 310, + 712 + ], + "score": 0.92, + "content": "\\pmb { A } _ { ( \\ell , q ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "is of optimal order. It is unclear how to perturb", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "the intermediate weight parameters using their analytical forms for deep networks , and we leave", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 721, + 284, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 284, + 732 + ], + "score": 1.0, + "content": "this as an open problem for the future work.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 504, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 401, + 96 + ], + "score": 1.0, + "content": "Proposition 5 (Characterization of global minimizers). A critical point", + "type": "text" + }, + { + "bbox": [ + 401, + 82, + 457, + 95 + ], + "score": 0.9, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 81, + 470, + 96 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 470, + 83, + 486, + 94 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 81, + 497, + 96 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 497, + 84, + 504, + 93 + ], + "score": 0.29, + "content": "a", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 374, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 374, + 106 + ], + "score": 1.0, + "content": "global minimizer if and only if it falls into the following two cases.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 504, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 506, + 180 + ], + "lines": [ + { + "bbox": [ + 102, + 105, + 504, + 132 + ], + "spans": [ + { + "bbox": [ + 102, + 105, + 142, + 132 + ], + "score": 1.0, + "content": "1. Case", + "type": "text" + }, + { + "bbox": [ + 143, + 113, + 149, + 123 + ], + "score": 0.26, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 105, + 156, + 132 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 156, + 110, + 297, + 125 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} \\ \\le \\ \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 105, + 301, + 132 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 302, + 112, + 328, + 126 + ], + "score": 0.86, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 105, + 466, + 132 + ], + "score": 1.0, + "content": "achieves the maximal rank, and", + "type": "text" + }, + { + "bbox": [ + 467, + 113, + 504, + 125 + ], + "score": 0.9, + "content": "p _ { 1 } ( 0 ) =", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 118, + 124, + 506, + 143 + ], + "spans": [ + { + "bbox": [ + 118, + 126, + 464, + 140 + ], + "score": 0.75, + "content": "m _ { 1 } ( 0 ) , \\ldots , p _ { k - 1 } ( 0 ) = m _ { k - 1 } ( 0 ) , p _ { k } ( 0 ) = \\mathrm { r a n k } ( A _ { ( \\ell , 2 ) } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \\leq m _ { k } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 124, + 506, + 143 + ], + "score": 1.0, + "content": "for some", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 119, + 137, + 162, + 153 + ], + "spans": [ + { + "bbox": [ + 119, + 139, + 156, + 151 + ], + "score": 0.78, + "content": "k \\leq r ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 137, + 162, + 153 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 102, + 147, + 507, + 170 + ], + "spans": [ + { + "bbox": [ + 102, + 147, + 152, + 170 + ], + "score": 1.0, + "content": "2. Case 2:", + "type": "text" + }, + { + "bbox": [ + 153, + 150, + 288, + 166 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 147, + 291, + 170 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 291, + 153, + 352, + 165 + ], + "score": 0.91, + "content": "p _ { i } ( 0 ) = m _ { i } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 147, + 381, + 170 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 381, + 153, + 444, + 165 + ], + "score": 0.92, + "content": "i = 1 , \\ldots , r ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 147, + 463, + 170 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 464, + 153, + 501, + 165 + ], + "score": 0.92, + "content": "\\bar { p } ( 0 ) \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 147, + 507, + 170 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 160, + 430, + 185 + ], + "spans": [ + { + "bbox": [ + 115, + 160, + 174, + 185 + ], + "score": 1.0, + "content": "In particular,", + "type": "text" + }, + { + "bbox": [ + 174, + 167, + 200, + 180 + ], + "score": 0.9, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 160, + 307, + 185 + ], + "score": 1.0, + "content": "can be non-full rank with", + "type": "text" + }, + { + "bbox": [ + 307, + 165, + 423, + 180 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\mathrm { r a n k } ( A _ { ( \\ell , 2 ) } ) = \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 160, + 430, + 185 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4, + "bbox_fs": [ + 102, + 105, + 507, + 185 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 183, + 502, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 504, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 504, + 197 + ], + "score": 1.0, + "content": "The analytical form of any global minimizer can be obtained from Theorem 3 with further specifica-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 195, + 219, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 219, + 208 + ], + "score": 1.0, + "content": "tion to the above two cases.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 182, + 504, + 208 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 224, + 505, + 258 + ], + "lines": [ + { + "bbox": [ + 106, + 224, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 505, + 236 + ], + "score": 1.0, + "content": "In particular for case 1, if we further adopt the invertibility assumptions on data matrices as in Baldi", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 235, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 505, + 248 + ], + "score": 1.0, + "content": "& Hornik (1989) and assume that all parameter matrices are square, then all global minima must", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 247, + 281, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 281, + 259 + ], + "score": 1.0, + "content": "correspond to full rank parameter matrices.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 224, + 505, + 259 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 263, + 505, + 340 + ], + "lines": [ + { + "bbox": [ + 106, + 263, + 506, + 275 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 506, + 275 + ], + "score": 1.0, + "content": "We next exploit the analytical forms of the critical points to further understand the landscape of", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 275, + 506, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 176, + 287 + ], + "score": 1.0, + "content": "the loss function", + "type": "text" + }, + { + "bbox": [ + 176, + 275, + 191, + 286 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 275, + 479, + 287 + ], + "score": 1.0, + "content": ". It has been shown in Kawaguchi (2016) that every local minimum of", + "type": "text" + }, + { + "bbox": [ + 479, + 275, + 494, + 285 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 275, + 506, + 287 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 285, + 504, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 504, + 297 + ], + "score": 1.0, + "content": "also a global minimum, under certain conditions on the parameter dimensions and the invertibility", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 296, + 505, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 308 + ], + "score": 1.0, + "content": "of the data matrices. Here, our characterization of the analytical forms for the critical points allow", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 307, + 505, + 319 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 319 + ], + "score": 1.0, + "content": "us to understand such a result from an alternative viewpoint. The proofs for certain cases (that we", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 318, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 505, + 330 + ], + "score": 1.0, + "content": "discuss below) are simpler and more intuitive, and no assumption is made on the data matrices and", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 329, + 217, + 341 + ], + "spans": [ + { + "bbox": [ + 106, + 329, + 217, + 341 + ], + "score": 1.0, + "content": "dimensions of the network.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 263, + 506, + 341 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 345, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 106, + 346, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 346, + 505, + 358 + ], + "score": 1.0, + "content": "Similarly to shallow linear networks, we want to understand the local landscape around the critical", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 357, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 376, + 369 + ], + "score": 1.0, + "content": "points. However, due to the effect of depth, the critical points of", + "type": "text" + }, + { + "bbox": [ + 376, + 357, + 392, + 368 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 357, + 506, + 369 + ], + "score": 1.0, + "content": "are more complicated than", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 367, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 143, + 381 + ], + "score": 1.0, + "content": "those of", + "type": "text" + }, + { + "bbox": [ + 143, + 369, + 151, + 378 + ], + "score": 0.74, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 367, + 505, + 381 + ], + "score": 1.0, + "content": ". Among them, we identify the following subsets of the non-global-minimum critical", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 379, + 222, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 133, + 392 + ], + "score": 1.0, + "content": "points", + "type": "text" + }, + { + "bbox": [ + 134, + 379, + 191, + 391 + ], + "score": 0.94, + "content": "( \\pmb { A } _ { 1 } , \\cdots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 379, + 204, + 392 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 204, + 379, + 219, + 390 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 379, + 222, + 392 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 346, + 506, + 392 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 395, + 506, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 279, + 407 + ], + "score": 1.0, + "content": "• (Deep-non-optimal order): There exist", + "type": "text" + }, + { + "bbox": [ + 279, + 396, + 351, + 407 + ], + "score": 0.9, + "content": "0 \\leq k \\leq \\ell - 2", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 394, + 440, + 407 + ], + "score": 1.0, + "content": "such that the matrix", + "type": "text" + }, + { + "bbox": [ + 440, + 396, + 453, + 407 + ], + "score": 0.87, + "content": "V _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 394, + 505, + 407 + ], + "score": 1.0, + "content": "specified in", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 405, + 495, + 420 + ], + "spans": [ + { + "bbox": [ + 114, + 405, + 258, + 420 + ], + "score": 1.0, + "content": "Theorem 3 satisfies that there exist", + "type": "text" + }, + { + "bbox": [ + 258, + 407, + 329, + 419 + ], + "score": 0.92, + "content": "1 \\leq i < j \\leq r ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 405, + 369, + 420 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 369, + 407, + 430, + 419 + ], + "score": 0.92, + "content": "p _ { i } ( k ) < m _ { i } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 405, + 448, + 420 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 448, + 407, + 491, + 419 + ], + "score": 0.92, + "content": "p _ { j } ( k ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 491, + 405, + 495, + 420 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 416, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 107, + 416, + 210, + 431 + ], + "score": 1.0, + "content": "• (Deep-optimal order):", + "type": "text" + }, + { + "bbox": [ + 210, + 418, + 258, + 430 + ], + "score": 0.92, + "content": "\\left( \\mathbf { \\boldsymbol { A } } _ { \\ell } , \\mathbf { \\boldsymbol { A } } _ { \\ell - 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 416, + 378, + 431 + ], + "score": 1.0, + "content": "is not a global minimizer of", + "type": "text" + }, + { + "bbox": [ + 378, + 419, + 393, + 429 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 416, + 416, + 431 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 417, + 419, + 452, + 430 + ], + "score": 0.92, + "content": "A _ { ( \\ell - 2 , 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 416, + 505, + 431 + ], + "score": 1.0, + "content": "being fixed,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 117, + 429, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 117, + 430, + 230, + 442 + ], + "score": 0.92, + "content": "\\mathrm { r a n k } ( A _ { \\ell } ) < \\operatorname* { m i n } \\{ d _ { \\ell } , d _ { \\ell - 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 429, + 292, + 443 + ], + "score": 1.0, + "content": ", and the matrix", + "type": "text" + }, + { + "bbox": [ + 293, + 430, + 314, + 442 + ], + "score": 0.92, + "content": "V _ { \\ell - 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 429, + 457, + 443 + ], + "score": 1.0, + "content": "specified in Theorem 3 satisfies that", + "type": "text" + }, + { + "bbox": [ + 458, + 430, + 506, + 442 + ], + "score": 0.9, + "content": "p _ { 1 } ( l - 2 ) =", + "type": "inline_equation" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 441, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 115, + 441, + 506, + 456 + ], + "score": 0.53, + "content": "\\begin{array} { r } { m _ { 1 } ( l - 2 ) , \\ldots , p _ { k - 1 } ( l - 2 ) = m _ { k - 1 } ( l - 2 ) , p _ { k } ( l - 2 ) = \\operatorname { r a n k } ( A _ { l } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( l - 2 ) \\leq m _ { k } ( l - 2 ) } \\end{array}", + "type": "inline_equation", + "image_path": "7eeaee942152d02e7897610503be19c75161fe01b48de66b2159c95107bc9eac.jpg" + } + ], + "index": 27 + }, + { + "bbox": [ + 154, + 455, + 225, + 466 + ], + "spans": [ + { + "bbox": [ + 154, + 455, + 225, + 466 + ], + "score": 0.91, + "content": "1 \\leq k \\leq r ( l - 2 )", + "type": "inline_equation" + } + ], + "index": 28 + } + ], + "index": 25.5, + "bbox_fs": [ + 106, + 394, + 506, + 466 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 470, + 503, + 483 + ], + "lines": [ + { + "bbox": [ + 106, + 469, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 106, + 469, + 307, + 484 + ], + "score": 1.0, + "content": "The following result summarizes the landscape of", + "type": "text" + }, + { + "bbox": [ + 307, + 471, + 322, + 482 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 469, + 505, + 484 + ], + "score": 1.0, + "content": "around the above two types of critical points.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 106, + 469, + 505, + 484 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 505, + 484, + 518 + ], + "lines": [ + { + "bbox": [ + 105, + 504, + 486, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 214, + 520 + ], + "score": 1.0, + "content": "Theorem 4 (Landscape of", + "type": "text" + }, + { + "bbox": [ + 214, + 506, + 229, + 517 + ], + "score": 0.86, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 230, + 504, + 309, + 520 + ], + "score": 1.0, + "content": "). The loss function", + "type": "text" + }, + { + "bbox": [ + 310, + 506, + 325, + 516 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 504, + 486, + 520 + ], + "score": 1.0, + "content": "has the following landscape properties.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 504, + 486, + 520 + ] + }, + { + "type": "list", + "bbox": [ + 106, + 522, + 506, + 606 + ], + "lines": [ + { + "bbox": [ + 105, + 520, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 331, + 535 + ], + "score": 1.0, + "content": "1. A deep-non-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 332, + 522, + 388, + 534 + ], + "score": 0.88, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 520, + 431, + 535 + ], + "score": 1.0, + "content": "has", + "type": "text" + }, + { + "bbox": [ + 432, + 524, + 439, + 533 + ], + "score": 0.26, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 520, + 506, + 535 + ], + "score": 1.0, + "content": "perturbation", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 119, + 533, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 119, + 533, + 221, + 548 + ], + "score": 0.91, + "content": "( A _ { 1 } , \\ldots , \\widetilde { A } _ { k + 1 } , \\ldots , \\widetilde { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 533, + 248, + 549 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 249, + 533, + 354, + 548 + ], + "score": 0.89, + "content": "\\begin{array} { r c l } { \\operatorname { r a n k } ( \\widetilde { A } _ { \\ell } ) } & { = } & { \\operatorname { r a n k } ( A _ { \\ell } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 533, + 430, + 549 + ], + "score": 1.0, + "content": ", which achieves", + "type": "text" + }, + { + "bbox": [ + 431, + 538, + 438, + 545 + ], + "score": 0.26, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 533, + 506, + 549 + ], + "score": 1.0, + "content": "lower function", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 118, + 545, + 146, + 559 + ], + "spans": [ + { + "bbox": [ + 118, + 545, + 146, + 559 + ], + "score": 1.0, + "content": "value.", + "type": "text" + } + ], + "index": 33, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 555, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 264, + 570 + ], + "score": 1.0, + "content": "2. A deep-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 264, + 557, + 320, + 569 + ], + "score": 0.92, + "content": "( \\pmb { A } _ { 1 } , \\dots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 555, + 400, + 570 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 401, + 555, + 484, + 569 + ], + "score": 0.92, + "content": "( A _ { 1 } , \\ldots , \\widetilde { A } _ { \\ell - 1 } , \\widetilde { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 555, + 505, + 570 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 34, + "is_list_start_line": true + }, + { + "bbox": [ + 119, + 569, + 391, + 583 + ], + "spans": [ + { + "bbox": [ + 119, + 569, + 231, + 583 + ], + "score": 0.92, + "content": "\\mathrm { r a n k } ( \\widetilde { A } _ { \\ell } ) = \\mathrm { r a n k } ( A _ { \\ell } ) + 1 ;", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 569, + 391, + 583 + ], + "score": 1.0, + "content": ", which achieves a lower function value.", + "type": "text" + } + ], + "index": 35, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 582, + 505, + 597 + ], + "spans": [ + { + "bbox": [ + 104, + 582, + 172, + 597 + ], + "score": 1.0, + "content": "3. Any point in", + "type": "text" + }, + { + "bbox": [ + 173, + 583, + 347, + 597 + ], + "score": 0.86, + "content": "\\mathcal { X } _ { D } : = \\{ ( A _ { 1 } , . . . , A _ { \\ell } ) : A _ { ( \\ell , 1 ) } X \\neq \\mathbf { 0 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 582, + 429, + 597 + ], + "score": 1.0, + "content": "has a perturbation", + "type": "text" + }, + { + "bbox": [ + 429, + 582, + 484, + 596 + ], + "score": 0.93, + "content": "( A _ { 1 } , \\ldots , \\widetilde { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 582, + 505, + 597 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 36, + "is_list_start_line": true + }, + { + "bbox": [ + 118, + 595, + 253, + 607 + ], + "spans": [ + { + "bbox": [ + 118, + 595, + 253, + 607 + ], + "score": 1.0, + "content": "achieves a higher function value.", + "type": "text" + } + ], + "index": 37, + "is_list_end_line": true + } + ], + "index": 34, + "bbox_fs": [ + 104, + 520, + 506, + 607 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 611, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 506, + 626 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 165, + 626 + ], + "score": 1.0, + "content": "Consequently,", + "type": "text" + }, + { + "bbox": [ + 166, + 613, + 172, + 622 + ], + "score": 0.39, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 610, + 275, + 626 + ], + "score": 1.0, + "content": ") every local minimum of", + "type": "text" + }, + { + "bbox": [ + 275, + 612, + 290, + 623 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 610, + 506, + 626 + ], + "score": 1.0, + "content": "is also a global minimum for the above two types of", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 623, + 444, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 623, + 357, + 635 + ], + "score": 1.0, + "content": "critical points; and 2) every critical point of these two types in", + "type": "text" + }, + { + "bbox": [ + 358, + 623, + 373, + 634 + ], + "score": 0.88, + "content": "\\mathcal { X } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 623, + 444, + 635 + ], + "score": 1.0, + "content": "is a saddle point.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 106, + 610, + 506, + 635 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 651, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 506, + 666 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 276, + 666 + ], + "score": 1.0, + "content": "Theorem 4 implies that the landscape of", + "type": "text" + }, + { + "bbox": [ + 276, + 653, + 291, + 663 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 651, + 480, + 666 + ], + "score": 1.0, + "content": "for deep linear networks is similar to that of", + "type": "text" + }, + { + "bbox": [ + 480, + 653, + 489, + 662 + ], + "score": 0.81, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 651, + 506, + 666 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 101, + 658, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 101, + 658, + 342, + 684 + ], + "score": 1.0, + "content": "shallow linear networks, i.e., the pattern of the parameters", + "type": "text" + }, + { + "bbox": [ + 342, + 663, + 389, + 678 + ], + "score": 0.94, + "content": "\\{ p _ { i } ( k ) \\} _ { i = 1 } ^ { r ( k ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 658, + 505, + 684 + ], + "score": 1.0, + "content": "implies different descent di-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 677, + 504, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 504, + 690 + ], + "score": 1.0, + "content": "rections of the function value around the critical points. Our approach does not handle the remaining", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 688, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 288, + 700 + ], + "score": 1.0, + "content": "set of non-global minimizers, i.e., there exists", + "type": "text" + }, + { + "bbox": [ + 289, + 688, + 326, + 699 + ], + "score": 0.89, + "content": "q \\leq \\ell - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 688, + 365, + 700 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 365, + 688, + 420, + 700 + ], + "score": 0.91, + "content": "( A _ { \\ell } , \\ldots , A _ { q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 688, + 506, + 700 + ], + "score": 1.0, + "content": "is a global minimum", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 104, + 699, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 104, + 699, + 141, + 712 + ], + "score": 1.0, + "content": "point of", + "type": "text" + }, + { + "bbox": [ + 141, + 699, + 156, + 710 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 699, + 178, + 712 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 178, + 699, + 215, + 712 + ], + "score": 0.92, + "content": "A _ { ( q - 1 , 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 699, + 285, + 712 + ], + "score": 1.0, + "content": "being fixed, and", + "type": "text" + }, + { + "bbox": [ + 285, + 700, + 310, + 712 + ], + "score": 0.92, + "content": "\\pmb { A } _ { ( \\ell , q ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 699, + 506, + 712 + ], + "score": 1.0, + "content": "is of optimal order. It is unclear how to perturb", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "the intermediate weight parameters using their analytical forms for deep networks , and we leave", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 721, + 284, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 284, + 732 + ], + "score": 1.0, + "content": "this as an open problem for the future work.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 43, + "bbox_fs": [ + 101, + 651, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 105, + 505, + 173 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 504, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 504, + 117 + ], + "score": 1.0, + "content": "In this section, we study nonlinear neural networks with one hidden layer. In particular, we consider", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 117, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 117, + 306, + 130 + ], + "score": 1.0, + "content": "nonlinear networks with ReLU activation function", + "type": "text" + }, + { + "bbox": [ + 306, + 117, + 353, + 127 + ], + "score": 0.91, + "content": "\\sigma : \\mathbb { R } \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 117, + 421, + 130 + ], + "score": 1.0, + "content": "that is defined as", + "type": "text" + }, + { + "bbox": [ + 421, + 117, + 501, + 129 + ], + "score": 0.92, + "content": "\\sigma ( x ) : = \\operatorname* { m a x } \\{ x , 0 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 117, + 505, + 130 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 127, + 505, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 141 + ], + "score": 1.0, + "content": "Our study focuses on the set of differentiable critical points. The weight parameters between the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 136, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 104, + 136, + 195, + 153 + ], + "score": 1.0, + "content": "layers are denoted by", + "type": "text" + }, + { + "bbox": [ + 195, + 138, + 252, + 150 + ], + "score": 0.87, + "content": "A _ { 2 } \\in \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 136, + 256, + 153 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 257, + 138, + 314, + 150 + ], + "score": 0.9, + "content": "A _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 136, + 506, + 153 + ], + "score": 1.0, + "content": ", respectively, and the input and output data are", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 146, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 104, + 146, + 154, + 164 + ], + "score": 1.0, + "content": "denoted by", + "type": "text" + }, + { + "bbox": [ + 154, + 149, + 266, + 162 + ], + "score": 0.26, + "content": "\\pmb { X } \\in \\mathbb { R } ^ { \\tilde { d } _ { 0 } \\times m } , \\pmb { Y } \\in \\mathbb { R } ^ { d _ { 2 } \\times m }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 146, + 506, + 164 + ], + "score": 1.0, + "content": ", respectively. We are interested in the square loss function", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 160, + 179, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 179, + 174 + ], + "score": 1.0, + "content": "which is given by", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5 + }, + { + "type": "interline_equation", + "bbox": [ + 238, + 177, + 372, + 193 + ], + "lines": [ + { + "bbox": [ + 238, + 177, + 372, + 193 + ], + "spans": [ + { + "bbox": [ + 238, + 177, + 372, + 193 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { L } _ { N } : = \\frac { 1 } { 2 } \\left. \\boldsymbol { A } _ { 2 } \\boldsymbol { \\sigma } ( \\boldsymbol { A } _ { 1 } \\boldsymbol { X } ) - \\boldsymbol { Y } \\right. _ { F } ^ { 2 } , } \\end{array}", + "type": "interline_equation", + "image_path": "9f64224187e75567fde7051cf0dc3009d72549775057d4b1072a208802359520.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 238, + 177, + 372, + 193 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 196, + 505, + 275 + ], + "lines": [ + { + "bbox": [ + 106, + 197, + 506, + 209 + ], + "spans": [ + { + "bbox": [ + 106, + 197, + 133, + 209 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 199, + 140, + 207 + ], + "score": 0.76, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 197, + 171, + 209 + ], + "score": 1.0, + "content": "acts on", + "type": "text" + }, + { + "bbox": [ + 171, + 197, + 195, + 208 + ], + "score": 0.91, + "content": "\\boldsymbol { A } _ { 1 } \\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 197, + 506, + 209 + ], + "score": 1.0, + "content": "entrywise. Existing studies on nonlinear networks characterized the sufficient", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 208, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 342, + 220 + ], + "score": 1.0, + "content": "conditions for critical points being global minimum Gori", + "type": "text" + }, + { + "bbox": [ + 342, + 208, + 351, + 218 + ], + "score": 0.41, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 208, + 505, + 220 + ], + "score": 1.0, + "content": "Tesi (1992); Nguyen & Hein (2017),", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 219, + 506, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 231 + ], + "score": 1.0, + "content": "established the equivalence between local minimum and global minimum under the condition that", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 230, + 506, + 242 + ], + "spans": [ + { + "bbox": [ + 107, + 230, + 140, + 241 + ], + "score": 0.85, + "content": "d _ { 0 } = m", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 230, + 506, + 242 + ], + "score": 1.0, + "content": "Yu & Chen (1995), and provided understanding of geometric properties of the critical points", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 240, + 506, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 506, + 253 + ], + "score": 1.0, + "content": "Tian (2017). In comparison, our results below provide a full characterization of the critical points of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 251, + 506, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 122, + 263 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 251, + 144, + 264 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 144, + 252, + 173, + 263 + ], + "score": 0.91, + "content": "d _ { 1 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 251, + 259, + 264 + ], + "score": 1.0, + "content": "and critical points of", + "type": "text" + }, + { + "bbox": [ + 260, + 252, + 275, + 263 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 251, + 414, + 264 + ], + "score": 1.0, + "content": "over certain parameter space with", + "type": "text" + }, + { + "bbox": [ + 414, + 252, + 443, + 263 + ], + "score": 0.92, + "content": "d _ { 1 } > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 251, + 506, + 264 + ], + "score": 1.0, + "content": ", and show that", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 263, + 347, + 274 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 180, + 274 + ], + "score": 1.0, + "content": "local minimum of", + "type": "text" + }, + { + "bbox": [ + 181, + 263, + 196, + 273 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 263, + 347, + 274 + ], + "score": 1.0, + "content": "that is not global minimum can exist.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 108, + 279, + 504, + 313 + ], + "lines": [ + { + "bbox": [ + 105, + 279, + 506, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 227, + 292 + ], + "score": 1.0, + "content": "Since the activation function", + "type": "text" + }, + { + "bbox": [ + 227, + 282, + 235, + 289 + ], + "score": 0.76, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 279, + 506, + 292 + ], + "score": 1.0, + "content": "is piecewise linear, the entire parameter space can be partitioned", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 289, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 359, + 304 + ], + "score": 1.0, + "content": "into disjoint cones. In particular, we consider the set of cones", + "type": "text" + }, + { + "bbox": [ + 360, + 291, + 384, + 302 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 289, + 413, + 304 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 414, + 290, + 505, + 303 + ], + "score": 0.92, + "content": "I \\subset \\{ 1 , \\dots , d _ { 1 } \\} , J \\subset", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 301, + 201, + 315 + ], + "spans": [ + { + "bbox": [ + 107, + 302, + 153, + 313 + ], + "score": 0.93, + "content": "\\{ 1 , \\ldots , m \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 301, + 201, + 315 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 317, + 445, + 331 + ], + "lines": [ + { + "bbox": [ + 162, + 317, + 445, + 331 + ], + "spans": [ + { + "bbox": [ + 162, + 317, + 445, + 331 + ], + "score": 0.75, + "content": "K _ { I \\times J } : = \\{ ( A _ { 2 } , A _ { 1 } ) : ( A _ { 1 } ) _ { I , : } X _ { : , J } \\geq 0 , { \\mathrm { o t h e r ~ e n t r i e s ~ o f ~ } } A _ { 1 } X < 0 \\} ,", + "type": "interline_equation", + "image_path": "9c239bb93a64db45061fdb482835dbba0177603daa987218e786d0e11b974c95.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 162, + 317, + 445, + 331 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 507, + 358 + ], + "lines": [ + { + "bbox": [ + 105, + 334, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 137, + 349 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 138, + 336, + 153, + 347 + ], + "score": 0.68, + "content": "\\because", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 334, + 171, + 349 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 171, + 336, + 190, + 346 + ], + "score": 0.68, + "content": "\" < \"", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 334, + 361, + 349 + ], + "score": 1.0, + "content": "represent entrywise comparisons. Within", + "type": "text" + }, + { + "bbox": [ + 362, + 336, + 386, + 347 + ], + "score": 0.9, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 334, + 428, + 349 + ], + "score": 1.0, + "content": ", the term", + "type": "text" + }, + { + "bbox": [ + 428, + 336, + 466, + 348 + ], + "score": 0.92, + "content": "\\sigma ( A _ { 1 } X )", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 334, + 505, + 349 + ], + "score": 1.0, + "content": "activates", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 347, + 450, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 171, + 360 + ], + "score": 1.0, + "content": "only the entries", + "type": "text" + }, + { + "bbox": [ + 171, + 347, + 221, + 359 + ], + "score": 0.93, + "content": "\\sigma ( A _ { 1 } \\bar { X } ) _ { I : J }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 347, + 369, + 360 + ], + "score": 1.0, + "content": ", and the corresponding loss function", + "type": "text" + }, + { + "bbox": [ + 369, + 348, + 385, + 358 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 347, + 450, + 360 + ], + "score": 1.0, + "content": "is equivalent to", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 143, + 362, + 468, + 380 + ], + "lines": [ + { + "bbox": [ + 143, + 362, + 468, + 380 + ], + "spans": [ + { + "bbox": [ + 143, + 362, + 468, + 380 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\forall ( { \\pmb A } _ { 2 } , { \\pmb A } _ { 1 } ) \\in { \\pmb K } _ { I \\times J } , \\quad { \\pmb L } _ { N } : = \\frac { 1 } { 2 } \\left\\| ( { \\pmb A } _ { 2 } ) _ { : , I } ( { \\pmb A } _ { 1 } ) _ { I , : } { \\pmb X } _ { : , J } - { \\pmb Y } _ { : , J } \\right\\| _ { F } ^ { 2 } + \\frac { 1 } { 2 } \\left\\| { \\pmb Y } _ { : , J ^ { c } } \\right\\| _ { F } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "a95dfb0b3bc79a6b3070051ef863f5255b5bf14dc4a80896e205ff1ffe3418f3.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 143, + 362, + 468, + 380 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 382, + 505, + 487 + ], + "lines": [ + { + "bbox": [ + 105, + 382, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 171, + 396 + ], + "score": 1.0, + "content": "Hence, within", + "type": "text" + }, + { + "bbox": [ + 171, + 383, + 196, + 394 + ], + "score": 0.85, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 382, + 203, + 396 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 203, + 383, + 219, + 394 + ], + "score": 0.86, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 382, + 506, + 396 + ], + "score": 1.0, + "content": "reduces to the loss of a shallow linear network with parameters", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 392, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 107, + 394, + 181, + 407 + ], + "score": 0.91, + "content": "( ( A _ { 2 } ) _ { : , I } , ( A _ { 1 } ) _ { I , : } )", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 392, + 226, + 408 + ], + "score": 1.0, + "content": "and input", + "type": "text" + }, + { + "bbox": [ + 226, + 394, + 236, + 404 + ], + "score": 0.56, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 392, + 308, + 408 + ], + "score": 1.0, + "content": "output data pair", + "type": "text" + }, + { + "bbox": [ + 309, + 394, + 358, + 406 + ], + "score": 0.92, + "content": "( X _ { : , J } , Y _ { : , J } )", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 392, + 506, + 408 + ], + "score": 1.0, + "content": ". Note that our results on shallow", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 404, + 505, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 505, + 418 + ], + "score": 1.0, + "content": "linear networks in Section 2 are applicable to all parameter dimensions and data matrices. Thus,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 416, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 360, + 428 + ], + "score": 1.0, + "content": "Theorem 1 fully characterizes the forms of critical points of", + "type": "text" + }, + { + "bbox": [ + 360, + 416, + 375, + 427 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 416, + 389, + 428 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 389, + 416, + 414, + 427 + ], + "score": 0.91, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 416, + 505, + 428 + ], + "score": 1.0, + "content": ". Moreover, the exis-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 427, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 427, + 505, + 439 + ], + "score": 1.0, + "content": "tence of such critical points can be analytically examined by substituting their forms into eq. (8). In", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 104, + 438, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 104, + 439, + 346, + 453 + ], + "score": 1.0, + "content": "summary, we obtain the following result, where we denote", + "type": "text" + }, + { + "bbox": [ + 346, + 438, + 453, + 453 + ], + "score": 0.93, + "content": "\\Sigma _ { J } : = Y _ { : , J } \\bar { X } _ { : , J } ^ { \\dag } X _ { : , J } Y _ { : , J } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 439, + 506, + 453 + ], + "score": 1.0, + "content": "with the full", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 452, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 228, + 466 + ], + "score": 1.0, + "content": "singular value decomposition", + "type": "text" + }, + { + "bbox": [ + 229, + 452, + 272, + 466 + ], + "score": 0.92, + "content": "U _ { J } \\mathbf { \\Lambda } \\mathbf { \\Lambda } _ { J } U _ { J } ^ { \\top } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 453, + 347, + 466 + ], + "score": 1.0, + "content": "and suppose that", + "type": "text" + }, + { + "bbox": [ + 347, + 453, + 362, + 465 + ], + "score": 0.87, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 453, + 380, + 466 + ], + "score": 1.0, + "content": "has", + "type": "text" + }, + { + "bbox": [ + 381, + 453, + 401, + 465 + ], + "score": 0.91, + "content": "r ( J )", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 453, + 506, + 466 + ], + "score": 1.0, + "content": "distinct positive singular", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 135, + 479 + ], + "score": 1.0, + "content": "values", + "type": "text" + }, + { + "bbox": [ + 135, + 465, + 242, + 478 + ], + "score": 0.91, + "content": "\\sigma _ { 1 } ( J ) > \\cdots > \\sigma _ { r ( J ) } ( J )", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 464, + 321, + 479 + ], + "score": 1.0, + "content": "with multiplicities", + "type": "text" + }, + { + "bbox": [ + 322, + 467, + 382, + 478 + ], + "score": 0.91, + "content": "m _ { 1 } , \\ldots , m _ { r ( J ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 464, + 459, + 479 + ], + "score": 1.0, + "content": ", respectively, and", + "type": "text" + }, + { + "bbox": [ + 459, + 464, + 483, + 477 + ], + "score": 0.92, + "content": "\\bar { m } ( J )", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 464, + 506, + 479 + ], + "score": 1.0, + "content": "zero", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 476, + 171, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 476, + 171, + 487 + ], + "score": 1.0, + "content": "singular values.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 489, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 489, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 399, + 503 + ], + "score": 1.0, + "content": "Proposition 6 (Characterization of critical points). All critical points of", + "type": "text" + }, + { + "bbox": [ + 400, + 491, + 415, + 501 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 489, + 427, + 503 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 428, + 490, + 452, + 502 + ], + "score": 0.9, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 489, + 486, + 503 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 486, + 490, + 505, + 501 + ], + "score": 0.84, + "content": "I \\subset", + "type": "inline_equation" + } + ], + "index": 30 + }, + { + "bbox": [ + 107, + 501, + 504, + 515 + ], + "spans": [ + { + "bbox": [ + 107, + 502, + 225, + 514 + ], + "score": 0.88, + "content": "\\{ 1 , \\dots , d _ { 1 } \\} , J \\subset \\{ 1 , \\dots , m \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 501, + 435, + 515 + ], + "score": 1.0, + "content": "are necessarily and sufficiently characterized by an", + "type": "text" + }, + { + "bbox": [ + 436, + 501, + 492, + 513 + ], + "score": 0.91, + "content": "\\pmb { L } _ { 1 } \\in \\mathbb { R } ^ { | I | \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 501, + 497, + 515 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 497, + 503, + 504, + 512 + ], + "score": 0.47, + "content": "a", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 512, + 409, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 159, + 527 + ], + "score": 1.0, + "content": "block matrix", + "type": "text" + }, + { + "bbox": [ + 159, + 514, + 213, + 525 + ], + "score": 0.9, + "content": "V \\in \\mathbb { R } ^ { d _ { 2 } \\times | I | }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 512, + 313, + 527 + ], + "score": 1.0, + "content": "and an invertible matrix", + "type": "text" + }, + { + "bbox": [ + 313, + 513, + 367, + 525 + ], + "score": 0.93, + "content": "C \\in \\mathbb { R } ^ { | I | \\times | I | }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 512, + 409, + 527 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 528, + 441, + 562 + ], + "lines": [ + { + "bbox": [ + 169, + 528, + 441, + 562 + ], + "spans": [ + { + "bbox": [ + 169, + 528, + 441, + 562 + ], + "score": 0.89, + "content": "\\begin{array} { r l } & { ( A _ { 1 } ) _ { I , : } = C ^ { - 1 } V ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \\top } V C L _ { 1 } X _ { : , J } X _ { : , J } ^ { \\dagger } , } \\\\ & { ( A _ { 2 } ) _ { : , I } = U _ { J } V C . } \\end{array}", + "type": "interline_equation", + "image_path": "34270cd4d7f19e518214cffdc2bca1066feb56e9f4b926e20bb031cf90e8084c.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 169, + 528, + 441, + 539.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 169, + 539.3333333333334, + 441, + 550.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 169, + 550.6666666666667, + 441, + 562.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 565, + 505, + 605 + ], + "lines": [ + { + "bbox": [ + 104, + 564, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 104, + 564, + 158, + 580 + ], + "score": 1.0, + "content": "Specifically,", + "type": "text" + }, + { + "bbox": [ + 159, + 565, + 383, + 580 + ], + "score": 0.84, + "content": "V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r ( J ) } , \\overline { { V } } ) , \\mathbf { 0 } ^ { d _ { 2 } \\times ( | I | - \\mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) ) } ] ,", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 564, + 415, + 580 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 416, + 566, + 475, + 578 + ], + "score": 0.9, + "content": "V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 564, + 481, + 580 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 481, + 565, + 505, + 579 + ], + "score": 0.81, + "content": "\\overline { { V } } \\in", + "type": "inline_equation" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 576, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 231, + 606 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( J ) } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 107, + 579, + 133, + 589 + ], + "score": 0.89, + "content": "\\mathbb { R } ^ { \\bar { m } \\times \\bar { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 576, + 292, + 594 + ], + "score": 1.0, + "content": "consist of orthonormal columns with", + "type": "text" + }, + { + "bbox": [ + 232, + 584, + 253, + 611 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 254, + 593, + 294, + 605 + ], + "score": 0.89, + "content": "L _ { 1 } , V , C", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 580, + 334, + 591 + ], + "score": 0.85, + "content": "p _ { i } ~ \\leq ~ m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 584, + 327, + 611 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + }, + { + "bbox": [ + 334, + 576, + 352, + 594 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 352, + 579, + 422, + 591 + ], + "score": 0.86, + "content": "i = 1 , \\ldots , r ( J )", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 576, + 427, + 594 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 428, + 579, + 462, + 591 + ], + "score": 0.81, + "content": "\\bar { p } ~ \\leq ~ \\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 576, + 506, + 594 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "interline_equation", + "bbox": [ + 224, + 609, + 389, + 626 + ], + "lines": [ + { + "bbox": [ + 224, + 609, + 389, + 626 + ], + "spans": [ + { + "bbox": [ + 224, + 609, + 389, + 626 + ], + "score": 0.92, + "content": "\\mathscr { P } _ { \\mathrm { c o l } ( U , V ) ^ { \\perp } } \\mathbf { Y } _ { : , J } \\mathbf { X } _ { : , J } ^ { \\top } \\mathbf { L } _ { 1 } ^ { \\top } C ^ { \\top } \\mathscr { P } _ { \\mathrm { k e r } ( V ) } = \\mathbf { 0 } .", + "type": "interline_equation", + "image_path": "593b4247bbc37b54b17d38f817083ce089979c1843415d41aece86de907b8fa8.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 224, + 609, + 389, + 626 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 629, + 452, + 641 + ], + "lines": [ + { + "bbox": [ + 105, + 628, + 453, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 221, + 642 + ], + "score": 1.0, + "content": "Moreover, a critical point in", + "type": "text" + }, + { + "bbox": [ + 221, + 630, + 246, + 641 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 628, + 392, + 642 + ], + "score": 1.0, + "content": "exists if and only if there exists such", + "type": "text" + }, + { + "bbox": [ + 393, + 629, + 432, + 641 + ], + "score": 0.92, + "content": "C , V , L _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 628, + 453, + 642 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 645, + 462, + 663 + ], + "lines": [ + { + "bbox": [ + 149, + 645, + 462, + 663 + ], + "spans": [ + { + "bbox": [ + 149, + 645, + 462, + 663 + ], + "score": 0.91, + "content": "( A _ { 1 } ) _ { I , : } X _ { : , J } = C ^ { - 1 } V ^ { \\top } U _ { J } ^ { \\top } Y X _ { : , J } ^ { \\dagger } X _ { : , J } + C ^ { - 1 } ( I - \\mathcal { P } _ { \\mathrm { k e r } ( V ) } ) C L _ { 1 } X _ { : , J } \\geq 0 ,", + "type": "interline_equation", + "image_path": "af14351c56a1043a96e091dd2f1209ae8590de9fb0ce477612b60b9900fe9e60.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 149, + 645, + 462, + 663 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 699 + ], + "score": 1.0, + "content": "To further illustrate, we consider a special case where the nonlinear network has one unit in the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 181, + 711 + ], + "score": 1.0, + "content": "hidden layer, i.e.,", + "type": "text" + }, + { + "bbox": [ + 182, + 699, + 215, + 710 + ], + "score": 0.92, + "content": "d _ { 1 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 698, + 280, + 711 + ], + "score": 1.0, + "content": ", in which case", + "type": "text" + }, + { + "bbox": [ + 281, + 699, + 295, + 710 + ], + "score": 0.89, + "content": "A _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 698, + 315, + 711 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 315, + 699, + 329, + 710 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "are row and column vectors, respectively.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 460, + 722 + ], + "score": 1.0, + "content": "Then, the entire parameter space can be partitioned into disjoint cones taking the form of", + "type": "text" + }, + { + "bbox": [ + 460, + 710, + 484, + 721 + ], + "score": 0.91, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 709, + 506, + 722 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 720, + 462, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 141, + 732 + ], + "score": 0.93, + "content": "I = \\{ 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 721, + 462, + 732 + ], + "score": 1.0, + "content": "is the only nontrivial choice. We obtain the following result from Proposition 6.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 760 + ], + "lines": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "spans": [ + { + "bbox": [ + 302, + 750, + 309, + 761 + ], + "score": 1.0, + "content": "8", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 81, + 438, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 439, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 439, + 95 + ], + "score": 1.0, + "content": "4 NONLINEAR NEURAL NETWORKS WITH ONE HIDDEN LAYER", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 105, + 505, + 173 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 504, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 504, + 117 + ], + "score": 1.0, + "content": "In this section, we study nonlinear neural networks with one hidden layer. In particular, we consider", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 117, + 505, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 117, + 306, + 130 + ], + "score": 1.0, + "content": "nonlinear networks with ReLU activation function", + "type": "text" + }, + { + "bbox": [ + 306, + 117, + 353, + 127 + ], + "score": 0.91, + "content": "\\sigma : \\mathbb { R } \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 117, + 421, + 130 + ], + "score": 1.0, + "content": "that is defined as", + "type": "text" + }, + { + "bbox": [ + 421, + 117, + 501, + 129 + ], + "score": 0.92, + "content": "\\sigma ( x ) : = \\operatorname* { m a x } \\{ x , 0 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 117, + 505, + 130 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 127, + 505, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 505, + 141 + ], + "score": 1.0, + "content": "Our study focuses on the set of differentiable critical points. The weight parameters between the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 136, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 104, + 136, + 195, + 153 + ], + "score": 1.0, + "content": "layers are denoted by", + "type": "text" + }, + { + "bbox": [ + 195, + 138, + 252, + 150 + ], + "score": 0.87, + "content": "A _ { 2 } \\in \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 136, + 256, + 153 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 257, + 138, + 314, + 150 + ], + "score": 0.9, + "content": "A _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 136, + 506, + 153 + ], + "score": 1.0, + "content": ", respectively, and the input and output data are", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 146, + 506, + 164 + ], + "spans": [ + { + "bbox": [ + 104, + 146, + 154, + 164 + ], + "score": 1.0, + "content": "denoted by", + "type": "text" + }, + { + "bbox": [ + 154, + 149, + 266, + 162 + ], + "score": 0.26, + "content": "\\pmb { X } \\in \\mathbb { R } ^ { \\tilde { d } _ { 0 } \\times m } , \\pmb { Y } \\in \\mathbb { R } ^ { d _ { 2 } \\times m }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 146, + 506, + 164 + ], + "score": 1.0, + "content": ", respectively. We are interested in the square loss function", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 160, + 179, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 179, + 174 + ], + "score": 1.0, + "content": "which is given by", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5, + "bbox_fs": [ + 104, + 106, + 506, + 174 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 238, + 177, + 372, + 193 + ], + "lines": [ + { + "bbox": [ + 238, + 177, + 372, + 193 + ], + "spans": [ + { + "bbox": [ + 238, + 177, + 372, + 193 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { L } _ { N } : = \\frac { 1 } { 2 } \\left. \\boldsymbol { A } _ { 2 } \\boldsymbol { \\sigma } ( \\boldsymbol { A } _ { 1 } \\boldsymbol { X } ) - \\boldsymbol { Y } \\right. _ { F } ^ { 2 } , } \\end{array}", + "type": "interline_equation", + "image_path": "9f64224187e75567fde7051cf0dc3009d72549775057d4b1072a208802359520.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 238, + 177, + 372, + 193 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 196, + 505, + 275 + ], + "lines": [ + { + "bbox": [ + 106, + 197, + 506, + 209 + ], + "spans": [ + { + "bbox": [ + 106, + 197, + 133, + 209 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 199, + 140, + 207 + ], + "score": 0.76, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 197, + 171, + 209 + ], + "score": 1.0, + "content": "acts on", + "type": "text" + }, + { + "bbox": [ + 171, + 197, + 195, + 208 + ], + "score": 0.91, + "content": "\\boldsymbol { A } _ { 1 } \\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 197, + 506, + 209 + ], + "score": 1.0, + "content": "entrywise. Existing studies on nonlinear networks characterized the sufficient", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 208, + 505, + 220 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 342, + 220 + ], + "score": 1.0, + "content": "conditions for critical points being global minimum Gori", + "type": "text" + }, + { + "bbox": [ + 342, + 208, + 351, + 218 + ], + "score": 0.41, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 208, + 505, + 220 + ], + "score": 1.0, + "content": "Tesi (1992); Nguyen & Hein (2017),", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 219, + 506, + 231 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 506, + 231 + ], + "score": 1.0, + "content": "established the equivalence between local minimum and global minimum under the condition that", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 230, + 506, + 242 + ], + "spans": [ + { + "bbox": [ + 107, + 230, + 140, + 241 + ], + "score": 0.85, + "content": "d _ { 0 } = m", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 230, + 506, + 242 + ], + "score": 1.0, + "content": "Yu & Chen (1995), and provided understanding of geometric properties of the critical points", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 240, + 506, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 506, + 253 + ], + "score": 1.0, + "content": "Tian (2017). In comparison, our results below provide a full characterization of the critical points of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 251, + 506, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 122, + 263 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 251, + 144, + 264 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 144, + 252, + 173, + 263 + ], + "score": 0.91, + "content": "d _ { 1 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 251, + 259, + 264 + ], + "score": 1.0, + "content": "and critical points of", + "type": "text" + }, + { + "bbox": [ + 260, + 252, + 275, + 263 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 251, + 414, + 264 + ], + "score": 1.0, + "content": "over certain parameter space with", + "type": "text" + }, + { + "bbox": [ + 414, + 252, + 443, + 263 + ], + "score": 0.92, + "content": "d _ { 1 } > 1", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 251, + 506, + 264 + ], + "score": 1.0, + "content": ", and show that", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 263, + 347, + 274 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 180, + 274 + ], + "score": 1.0, + "content": "local minimum of", + "type": "text" + }, + { + "bbox": [ + 181, + 263, + 196, + 273 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 263, + 347, + 274 + ], + "score": 1.0, + "content": "that is not global minimum can exist.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 197, + 506, + 274 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 279, + 504, + 313 + ], + "lines": [ + { + "bbox": [ + 105, + 279, + 506, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 227, + 292 + ], + "score": 1.0, + "content": "Since the activation function", + "type": "text" + }, + { + "bbox": [ + 227, + 282, + 235, + 289 + ], + "score": 0.76, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 279, + 506, + 292 + ], + "score": 1.0, + "content": "is piecewise linear, the entire parameter space can be partitioned", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 289, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 359, + 304 + ], + "score": 1.0, + "content": "into disjoint cones. In particular, we consider the set of cones", + "type": "text" + }, + { + "bbox": [ + 360, + 291, + 384, + 302 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 289, + 413, + 304 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 414, + 290, + 505, + 303 + ], + "score": 0.92, + "content": "I \\subset \\{ 1 , \\dots , d _ { 1 } \\} , J \\subset", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 301, + 201, + 315 + ], + "spans": [ + { + "bbox": [ + 107, + 302, + 153, + 313 + ], + "score": 0.93, + "content": "\\{ 1 , \\ldots , m \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 301, + 201, + 315 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 279, + 506, + 315 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 317, + 445, + 331 + ], + "lines": [ + { + "bbox": [ + 162, + 317, + 445, + 331 + ], + "spans": [ + { + "bbox": [ + 162, + 317, + 445, + 331 + ], + "score": 0.75, + "content": "K _ { I \\times J } : = \\{ ( A _ { 2 } , A _ { 1 } ) : ( A _ { 1 } ) _ { I , : } X _ { : , J } \\geq 0 , { \\mathrm { o t h e r ~ e n t r i e s ~ o f ~ } } A _ { 1 } X < 0 \\} ,", + "type": "interline_equation", + "image_path": "9c239bb93a64db45061fdb482835dbba0177603daa987218e786d0e11b974c95.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 162, + 317, + 445, + 331 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 507, + 358 + ], + "lines": [ + { + "bbox": [ + 105, + 334, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 137, + 349 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 138, + 336, + 153, + 347 + ], + "score": 0.68, + "content": "\\because", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 334, + 171, + 349 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 171, + 336, + 190, + 346 + ], + "score": 0.68, + "content": "\" < \"", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 334, + 361, + 349 + ], + "score": 1.0, + "content": "represent entrywise comparisons. Within", + "type": "text" + }, + { + "bbox": [ + 362, + 336, + 386, + 347 + ], + "score": 0.9, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 334, + 428, + 349 + ], + "score": 1.0, + "content": ", the term", + "type": "text" + }, + { + "bbox": [ + 428, + 336, + 466, + 348 + ], + "score": 0.92, + "content": "\\sigma ( A _ { 1 } X )", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 334, + 505, + 349 + ], + "score": 1.0, + "content": "activates", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 347, + 450, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 171, + 360 + ], + "score": 1.0, + "content": "only the entries", + "type": "text" + }, + { + "bbox": [ + 171, + 347, + 221, + 359 + ], + "score": 0.93, + "content": "\\sigma ( A _ { 1 } \\bar { X } ) _ { I : J }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 347, + 369, + 360 + ], + "score": 1.0, + "content": ", and the corresponding loss function", + "type": "text" + }, + { + "bbox": [ + 369, + 348, + 385, + 358 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 347, + 450, + 360 + ], + "score": 1.0, + "content": "is equivalent to", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 334, + 505, + 360 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 143, + 362, + 468, + 380 + ], + "lines": [ + { + "bbox": [ + 143, + 362, + 468, + 380 + ], + "spans": [ + { + "bbox": [ + 143, + 362, + 468, + 380 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\forall ( { \\pmb A } _ { 2 } , { \\pmb A } _ { 1 } ) \\in { \\pmb K } _ { I \\times J } , \\quad { \\pmb L } _ { N } : = \\frac { 1 } { 2 } \\left\\| ( { \\pmb A } _ { 2 } ) _ { : , I } ( { \\pmb A } _ { 1 } ) _ { I , : } { \\pmb X } _ { : , J } - { \\pmb Y } _ { : , J } \\right\\| _ { F } ^ { 2 } + \\frac { 1 } { 2 } \\left\\| { \\pmb Y } _ { : , J ^ { c } } \\right\\| _ { F } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "a95dfb0b3bc79a6b3070051ef863f5255b5bf14dc4a80896e205ff1ffe3418f3.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 143, + 362, + 468, + 380 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 382, + 505, + 487 + ], + "lines": [ + { + "bbox": [ + 105, + 382, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 105, + 382, + 171, + 396 + ], + "score": 1.0, + "content": "Hence, within", + "type": "text" + }, + { + "bbox": [ + 171, + 383, + 196, + 394 + ], + "score": 0.85, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 382, + 203, + 396 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 203, + 383, + 219, + 394 + ], + "score": 0.86, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 382, + 506, + 396 + ], + "score": 1.0, + "content": "reduces to the loss of a shallow linear network with parameters", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 392, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 107, + 394, + 181, + 407 + ], + "score": 0.91, + "content": "( ( A _ { 2 } ) _ { : , I } , ( A _ { 1 } ) _ { I , : } )", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 392, + 226, + 408 + ], + "score": 1.0, + "content": "and input", + "type": "text" + }, + { + "bbox": [ + 226, + 394, + 236, + 404 + ], + "score": 0.56, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 392, + 308, + 408 + ], + "score": 1.0, + "content": "output data pair", + "type": "text" + }, + { + "bbox": [ + 309, + 394, + 358, + 406 + ], + "score": 0.92, + "content": "( X _ { : , J } , Y _ { : , J } )", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 392, + 506, + 408 + ], + "score": 1.0, + "content": ". Note that our results on shallow", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 404, + 505, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 505, + 418 + ], + "score": 1.0, + "content": "linear networks in Section 2 are applicable to all parameter dimensions and data matrices. Thus,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 416, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 360, + 428 + ], + "score": 1.0, + "content": "Theorem 1 fully characterizes the forms of critical points of", + "type": "text" + }, + { + "bbox": [ + 360, + 416, + 375, + 427 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 416, + 389, + 428 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 389, + 416, + 414, + 427 + ], + "score": 0.91, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 416, + 505, + 428 + ], + "score": 1.0, + "content": ". Moreover, the exis-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 427, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 106, + 427, + 505, + 439 + ], + "score": 1.0, + "content": "tence of such critical points can be analytically examined by substituting their forms into eq. (8). In", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 104, + 438, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 104, + 439, + 346, + 453 + ], + "score": 1.0, + "content": "summary, we obtain the following result, where we denote", + "type": "text" + }, + { + "bbox": [ + 346, + 438, + 453, + 453 + ], + "score": 0.93, + "content": "\\Sigma _ { J } : = Y _ { : , J } \\bar { X } _ { : , J } ^ { \\dag } X _ { : , J } Y _ { : , J } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 439, + 506, + 453 + ], + "score": 1.0, + "content": "with the full", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 452, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 228, + 466 + ], + "score": 1.0, + "content": "singular value decomposition", + "type": "text" + }, + { + "bbox": [ + 229, + 452, + 272, + 466 + ], + "score": 0.92, + "content": "U _ { J } \\mathbf { \\Lambda } \\mathbf { \\Lambda } _ { J } U _ { J } ^ { \\top } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 453, + 347, + 466 + ], + "score": 1.0, + "content": "and suppose that", + "type": "text" + }, + { + "bbox": [ + 347, + 453, + 362, + 465 + ], + "score": 0.87, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 453, + 380, + 466 + ], + "score": 1.0, + "content": "has", + "type": "text" + }, + { + "bbox": [ + 381, + 453, + 401, + 465 + ], + "score": 0.91, + "content": "r ( J )", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 453, + 506, + 466 + ], + "score": 1.0, + "content": "distinct positive singular", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 464, + 506, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 135, + 479 + ], + "score": 1.0, + "content": "values", + "type": "text" + }, + { + "bbox": [ + 135, + 465, + 242, + 478 + ], + "score": 0.91, + "content": "\\sigma _ { 1 } ( J ) > \\cdots > \\sigma _ { r ( J ) } ( J )", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 464, + 321, + 479 + ], + "score": 1.0, + "content": "with multiplicities", + "type": "text" + }, + { + "bbox": [ + 322, + 467, + 382, + 478 + ], + "score": 0.91, + "content": "m _ { 1 } , \\ldots , m _ { r ( J ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 464, + 459, + 479 + ], + "score": 1.0, + "content": ", respectively, and", + "type": "text" + }, + { + "bbox": [ + 459, + 464, + 483, + 477 + ], + "score": 0.92, + "content": "\\bar { m } ( J )", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 464, + 506, + 479 + ], + "score": 1.0, + "content": "zero", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 476, + 171, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 476, + 171, + 487 + ], + "score": 1.0, + "content": "singular values.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25, + "bbox_fs": [ + 104, + 382, + 506, + 487 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 489, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 489, + 505, + 503 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 399, + 503 + ], + "score": 1.0, + "content": "Proposition 6 (Characterization of critical points). All critical points of", + "type": "text" + }, + { + "bbox": [ + 400, + 491, + 415, + 501 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 489, + 427, + 503 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 428, + 490, + 452, + 502 + ], + "score": 0.9, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 489, + 486, + 503 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 486, + 490, + 505, + 501 + ], + "score": 0.84, + "content": "I \\subset", + "type": "inline_equation" + } + ], + "index": 30 + }, + { + "bbox": [ + 107, + 501, + 504, + 515 + ], + "spans": [ + { + "bbox": [ + 107, + 502, + 225, + 514 + ], + "score": 0.88, + "content": "\\{ 1 , \\dots , d _ { 1 } \\} , J \\subset \\{ 1 , \\dots , m \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 501, + 435, + 515 + ], + "score": 1.0, + "content": "are necessarily and sufficiently characterized by an", + "type": "text" + }, + { + "bbox": [ + 436, + 501, + 492, + 513 + ], + "score": 0.91, + "content": "\\pmb { L } _ { 1 } \\in \\mathbb { R } ^ { | I | \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 501, + 497, + 515 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 497, + 503, + 504, + 512 + ], + "score": 0.47, + "content": "a", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 512, + 409, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 159, + 527 + ], + "score": 1.0, + "content": "block matrix", + "type": "text" + }, + { + "bbox": [ + 159, + 514, + 213, + 525 + ], + "score": 0.9, + "content": "V \\in \\mathbb { R } ^ { d _ { 2 } \\times | I | }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 512, + 313, + 527 + ], + "score": 1.0, + "content": "and an invertible matrix", + "type": "text" + }, + { + "bbox": [ + 313, + 513, + 367, + 525 + ], + "score": 0.93, + "content": "C \\in \\mathbb { R } ^ { | I | \\times | I | }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 512, + 409, + 527 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 489, + 505, + 527 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 528, + 441, + 562 + ], + "lines": [ + { + "bbox": [ + 169, + 528, + 441, + 562 + ], + "spans": [ + { + "bbox": [ + 169, + 528, + 441, + 562 + ], + "score": 0.89, + "content": "\\begin{array} { r l } & { ( A _ { 1 } ) _ { I , : } = C ^ { - 1 } V ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \\top } V C L _ { 1 } X _ { : , J } X _ { : , J } ^ { \\dagger } , } \\\\ & { ( A _ { 2 } ) _ { : , I } = U _ { J } V C . } \\end{array}", + "type": "interline_equation", + "image_path": "34270cd4d7f19e518214cffdc2bca1066feb56e9f4b926e20bb031cf90e8084c.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 169, + 528, + 441, + 539.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 169, + 539.3333333333334, + 441, + 550.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 169, + 550.6666666666667, + 441, + 562.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 565, + 505, + 605 + ], + "lines": [ + { + "bbox": [ + 104, + 564, + 505, + 580 + ], + "spans": [ + { + "bbox": [ + 104, + 564, + 158, + 580 + ], + "score": 1.0, + "content": "Specifically,", + "type": "text" + }, + { + "bbox": [ + 159, + 565, + 383, + 580 + ], + "score": 0.84, + "content": "V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r ( J ) } , \\overline { { V } } ) , \\mathbf { 0 } ^ { d _ { 2 } \\times ( | I | - \\mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) ) } ] ,", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 564, + 415, + 580 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 416, + 566, + 475, + 578 + ], + "score": 0.9, + "content": "V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 564, + 481, + 580 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 481, + 565, + 505, + 579 + ], + "score": 0.81, + "content": "\\overline { { V } } \\in", + "type": "inline_equation" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 576, + 506, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 231, + 606 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( J ) } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 107, + 579, + 133, + 589 + ], + "score": 0.89, + "content": "\\mathbb { R } ^ { \\bar { m } \\times \\bar { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 576, + 292, + 594 + ], + "score": 1.0, + "content": "consist of orthonormal columns with", + "type": "text" + }, + { + "bbox": [ + 232, + 584, + 253, + 611 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 254, + 593, + 294, + 605 + ], + "score": 0.89, + "content": "L _ { 1 } , V , C", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 580, + 334, + 591 + ], + "score": 0.85, + "content": "p _ { i } ~ \\leq ~ m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 584, + 327, + 611 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + }, + { + "bbox": [ + 334, + 576, + 352, + 594 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 352, + 579, + 422, + 591 + ], + "score": 0.86, + "content": "i = 1 , \\ldots , r ( J )", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 576, + 427, + 594 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 428, + 579, + 462, + 591 + ], + "score": 0.81, + "content": "\\bar { p } ~ \\leq ~ \\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 576, + 506, + 594 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 104, + 564, + 506, + 611 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 224, + 609, + 389, + 626 + ], + "lines": [ + { + "bbox": [ + 224, + 609, + 389, + 626 + ], + "spans": [ + { + "bbox": [ + 224, + 609, + 389, + 626 + ], + "score": 0.92, + "content": "\\mathscr { P } _ { \\mathrm { c o l } ( U , V ) ^ { \\perp } } \\mathbf { Y } _ { : , J } \\mathbf { X } _ { : , J } ^ { \\top } \\mathbf { L } _ { 1 } ^ { \\top } C ^ { \\top } \\mathscr { P } _ { \\mathrm { k e r } ( V ) } = \\mathbf { 0 } .", + "type": "interline_equation", + "image_path": "593b4247bbc37b54b17d38f817083ce089979c1843415d41aece86de907b8fa8.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 224, + 609, + 389, + 626 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 629, + 452, + 641 + ], + "lines": [ + { + "bbox": [ + 105, + 628, + 453, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 221, + 642 + ], + "score": 1.0, + "content": "Moreover, a critical point in", + "type": "text" + }, + { + "bbox": [ + 221, + 630, + 246, + 641 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 628, + 392, + 642 + ], + "score": 1.0, + "content": "exists if and only if there exists such", + "type": "text" + }, + { + "bbox": [ + 393, + 629, + 432, + 641 + ], + "score": 0.92, + "content": "C , V , L _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 628, + 453, + 642 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 628, + 453, + 642 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 645, + 462, + 663 + ], + "lines": [ + { + "bbox": [ + 149, + 645, + 462, + 663 + ], + "spans": [ + { + "bbox": [ + 149, + 645, + 462, + 663 + ], + "score": 0.91, + "content": "( A _ { 1 } ) _ { I , : } X _ { : , J } = C ^ { - 1 } V ^ { \\top } U _ { J } ^ { \\top } Y X _ { : , J } ^ { \\dagger } X _ { : , J } + C ^ { - 1 } ( I - \\mathcal { P } _ { \\mathrm { k e r } ( V ) } ) C L _ { 1 } X _ { : , J } \\geq 0 ,", + "type": "interline_equation", + "image_path": "af14351c56a1043a96e091dd2f1209ae8590de9fb0ce477612b60b9900fe9e60.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 149, + 645, + 462, + 663 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 699 + ], + "score": 1.0, + "content": "To further illustrate, we consider a special case where the nonlinear network has one unit in the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 181, + 711 + ], + "score": 1.0, + "content": "hidden layer, i.e.,", + "type": "text" + }, + { + "bbox": [ + 182, + 699, + 215, + 710 + ], + "score": 0.92, + "content": "d _ { 1 } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 698, + 280, + 711 + ], + "score": 1.0, + "content": ", in which case", + "type": "text" + }, + { + "bbox": [ + 281, + 699, + 295, + 710 + ], + "score": 0.89, + "content": "A _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 698, + 315, + 711 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 315, + 699, + 329, + 710 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "are row and column vectors, respectively.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 460, + 722 + ], + "score": 1.0, + "content": "Then, the entire parameter space can be partitioned into disjoint cones taking the form of", + "type": "text" + }, + { + "bbox": [ + 460, + 710, + 484, + 721 + ], + "score": 0.91, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 709, + 506, + 722 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 720, + 462, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 141, + 732 + ], + "score": 0.93, + "content": "I = \\{ 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 721, + 462, + 732 + ], + "score": 1.0, + "content": "is the only nontrivial choice. We obtain the following result from Proposition 6.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 687, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 504, + 128 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 364, + 95 + ], + "score": 1.0, + "content": "Proposition 7 (Characterization of critical points). Consider", + "type": "text" + }, + { + "bbox": [ + 365, + 83, + 380, + 93 + ], + "score": 0.86, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 82, + 405, + 95 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 405, + 83, + 441, + 93 + ], + "score": 0.9, + "content": "d _ { 1 } ~ = ~ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 82, + 482, + 95 + ], + "score": 1.0, + "content": "and any", + "type": "text" + }, + { + "bbox": [ + 483, + 83, + 505, + 94 + ], + "score": 0.81, + "content": "J \\subset", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 93, + 505, + 108 + ], + "spans": [ + { + "bbox": [ + 107, + 93, + 153, + 106 + ], + "score": 0.92, + "content": "\\{ 1 , \\ldots , m \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 93, + 305, + 108 + ], + "score": 1.0, + "content": ". Then, any nonzero critical point of", + "type": "text" + }, + { + "bbox": [ + 306, + 94, + 321, + 105 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 93, + 351, + 108 + ], + "score": 1.0, + "content": "within", + "type": "text" + }, + { + "bbox": [ + 351, + 94, + 384, + 106 + ], + "score": 0.91, + "content": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 93, + 505, + 108 + ], + "score": 1.0, + "content": "can be necessarily and suffi-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 218, + 119 + ], + "score": 1.0, + "content": "ciently characterized by an", + "type": "text" + }, + { + "bbox": [ + 218, + 105, + 268, + 118 + ], + "score": 0.93, + "content": "\\boldsymbol { \\ell } _ { 1 } ^ { \\top } \\in \\mathbb { R } ^ { 1 \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 104, + 352, + 119 + ], + "score": 1.0, + "content": ", a block unit vector", + "type": "text" + }, + { + "bbox": [ + 352, + 106, + 400, + 117 + ], + "score": 0.89, + "content": "\\mathbf { v } \\in \\mathbb { R } ^ { d _ { 2 } \\times 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 104, + 455, + 119 + ], + "score": 1.0, + "content": "and a scalar", + "type": "text" + }, + { + "bbox": [ + 456, + 106, + 483, + 117 + ], + "score": 0.81, + "content": "c \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 104, + 506, + 119 + ], + "score": 1.0, + "content": "such", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 115, + 127, + 130 + ], + "spans": [ + { + "bbox": [ + 104, + 115, + 127, + 130 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "interline_equation", + "bbox": [ + 179, + 131, + 432, + 149 + ], + "lines": [ + { + "bbox": [ + 179, + 131, + 432, + 149 + ], + "spans": [ + { + "bbox": [ + 179, + 131, + 432, + 149 + ], + "score": 0.89, + "content": "A _ { 1 } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dag } + \\bar { \\ell } _ { 1 } ^ { \\top } - \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J } X _ { : , J } ^ { \\dag } , \\quad A _ { 2 } = c U _ { J } \\mathbf { v } .", + "type": "interline_equation", + "image_path": "5986d03d678f1eb9081741d8248755d37e37ba012a1332dbb55e03942e617116.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 179, + 131, + 432, + 149 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 152, + 505, + 188 + ], + "lines": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "Specifically, v is a unit vector that is supported on the entries corresponding to the same singular", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 162, + 506, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 143, + 177 + ], + "score": 1.0, + "content": "value of", + "type": "text" + }, + { + "bbox": [ + 144, + 164, + 158, + 174 + ], + "score": 0.88, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 162, + 321, + 177 + ], + "score": 1.0, + "content": ". Moreover, a nonzero critical point in", + "type": "text" + }, + { + "bbox": [ + 321, + 164, + 354, + 176 + ], + "score": 0.94, + "content": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 162, + 506, + 177 + ], + "score": 1.0, + "content": "exists if and only if there exist such", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 173, + 183, + 191 + ], + "spans": [ + { + "bbox": [ + 107, + 175, + 136, + 188 + ], + "score": 0.91, + "content": "c , \\mathbf { v } , \\mathbf { \\nabla } \\theta _ { 1 } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 173, + 183, + 191 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 191, + 456, + 229 + ], + "lines": [ + { + "bbox": [ + 155, + 191, + 456, + 229 + ], + "spans": [ + { + "bbox": [ + 155, + 191, + 456, + 229 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { A _ { 1 } X _ { : , J } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J } \\geq 0 , } \\\\ & { A _ { 1 } X _ { : , J ^ { c } } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J ^ { c } } + \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J ^ { c } } - \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J ^ { c } } < 0 . } \\end{array}", + "type": "interline_equation", + "image_path": "61f830a94553c6fb57ab9d179db39d0edd24f28d7fee4e69d864e370e008dc3a.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 155, + 191, + 456, + 203.66666666666666 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 155, + 203.66666666666666, + 456, + 216.33333333333331 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 155, + 216.33333333333331, + 456, + 228.99999999999997 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 236, + 505, + 271 + ], + "lines": [ + { + "bbox": [ + 106, + 235, + 504, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 488, + 250 + ], + "score": 1.0, + "content": "We note that Proposition 7 characterizes both the existence and the forms of critical points of", + "type": "text" + }, + { + "bbox": [ + 488, + 237, + 504, + 248 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 248, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 505, + 260 + ], + "score": 1.0, + "content": "over the entire parameter space for nonlinear networks with a single hidden unit. The condition in", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 258, + 327, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 231, + 272 + ], + "score": 1.0, + "content": "eq. (12) is guaranteed because", + "type": "text" + }, + { + "bbox": [ + 231, + 259, + 281, + 272 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\ker ( \\mathbf { v } ) } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 258, + 295, + 272 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 296, + 259, + 322, + 271 + ], + "score": 0.91, + "content": "\\mathbf { v } \\neq \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 258, + 327, + 272 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 505, + 366 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 504, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 439, + 290 + ], + "score": 1.0, + "content": "To further understand Proposition 7, suppose that there exists a critical point in", + "type": "text" + }, + { + "bbox": [ + 439, + 276, + 473, + 289 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 275, + 496, + 290 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 496, + 277, + 504, + 286 + ], + "score": 0.54, + "content": "\\mathbf { v }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 286, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 318, + 299 + ], + "score": 1.0, + "content": "being supported on the entries that correspond to the", + "type": "text" + }, + { + "bbox": [ + 318, + 288, + 323, + 297 + ], + "score": 0.73, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 286, + 404, + 299 + ], + "score": 1.0, + "content": "-th singular value of", + "type": "text" + }, + { + "bbox": [ + 405, + 287, + 419, + 298 + ], + "score": 0.88, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 286, + 505, + 299 + ], + "score": 1.0, + "content": ". Then, Proposition 1", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 297, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 155, + 311 + ], + "score": 1.0, + "content": "implies that", + "type": "text" + }, + { + "bbox": [ + 155, + 297, + 269, + 311 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal { L } _ { N } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sigma _ { i } ( J ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 297, + 505, + 311 + ], + "score": 1.0, + "content": ". In particular, the critical point achieves the local minimum", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 107, + 307, + 507, + 325 + ], + "spans": [ + { + "bbox": [ + 107, + 309, + 198, + 324 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sigma _ { 1 } \\bar { ( \\pmb { J } ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 307, + 210, + 325 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 210, + 311, + 243, + 324 + ], + "score": 0.89, + "content": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 307, + 265, + 325 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 266, + 311, + 290, + 321 + ], + "score": 0.89, + "content": "i = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 307, + 507, + 325 + ], + "score": 1.0, + "content": ". This is because in this case the critical point is full", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "score": 1.0, + "content": "rank with an optimal order, and hence corresponds to the global minimum of the linear network in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 332, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 104, + 332, + 254, + 345 + ], + "score": 1.0, + "content": "eq. (9). Since the singular values of", + "type": "text" + }, + { + "bbox": [ + 254, + 333, + 269, + 344 + ], + "score": 0.89, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 332, + 386, + 345 + ], + "score": 1.0, + "content": "may vary with the choice of", + "type": "text" + }, + { + "bbox": [ + 387, + 333, + 394, + 343 + ], + "score": 0.54, + "content": "J", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 332, + 398, + 345 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 398, + 333, + 414, + 344 + ], + "score": 0.81, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 332, + 506, + 345 + ], + "score": 1.0, + "content": "may achieve different", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 342, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 486, + 357 + ], + "score": 1.0, + "content": "local minima in different cones. Thus, local minimum that is not global minimum can exist for", + "type": "text" + }, + { + "bbox": [ + 486, + 344, + 501, + 355 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 342, + 505, + 357 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 354, + 433, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 433, + 367 + ], + "score": 1.0, + "content": "The following proposition concludes this fact by considering a concrete example.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 108, + 369, + 503, + 392 + ], + "lines": [ + { + "bbox": [ + 106, + 368, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 505, + 382 + ], + "score": 1.0, + "content": "Proposition 8. For one-hidden-layer nonlinear neural networks with ReLU activation function,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 380, + 477, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 477, + 392 + ], + "score": 1.0, + "content": "there exists local minimum that is not global minimum, and there also exists local maximum.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 107, + 400, + 371, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 370, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 370, + 415 + ], + "score": 1.0, + "content": "The above proposition is demonstrated by the following example.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 503, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 414, + 501, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 264, + 428 + ], + "score": 1.0, + "content": "Example 1. Consider the loss function", + "type": "text" + }, + { + "bbox": [ + 264, + 415, + 279, + 426 + ], + "score": 0.87, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 414, + 399, + 428 + ], + "score": 1.0, + "content": "of the nonlinear network with", + "type": "text" + }, + { + "bbox": [ + 399, + 415, + 451, + 426 + ], + "score": 0.91, + "content": "d _ { 2 } = d _ { 0 } = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 414, + 472, + 428 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 472, + 415, + 501, + 426 + ], + "score": 0.9, + "content": "d _ { 1 } = 1", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 425, + 400, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 264, + 439 + ], + "score": 1.0, + "content": "The input and output data are set to be", + "type": "text" + }, + { + "bbox": [ + 264, + 426, + 396, + 438 + ], + "score": 0.9, + "content": "X = \\mathrm { d i a g } ( 1 , 1 ) , Y = \\mathrm { d i a g } ( 2 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 425, + 400, + 439 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 106, + 445, + 505, + 581 + ], + "lines": [ + { + "bbox": [ + 105, + 445, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 200, + 459 + ], + "score": 1.0, + "content": "First, consider the cone", + "type": "text" + }, + { + "bbox": [ + 201, + 447, + 225, + 458 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 445, + 246, + 459 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 246, + 446, + 320, + 459 + ], + "score": 0.88, + "content": "I = \\{ 1 \\} , J = \\{ 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 445, + 416, + 459 + ], + "score": 1.0, + "content": ". Calculation yields that", + "type": "text" + }, + { + "bbox": [ + 416, + 446, + 484, + 458 + ], + "score": 0.91, + "content": "\\Sigma _ { J } = \\mathrm { d i a g } ( 4 , 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 445, + 506, + 459 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 455, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 400, + 471 + ], + "score": 1.0, + "content": "the conditions for existence of critical points in eqs. (16) and (17) hold if", + "type": "text" + }, + { + "bbox": [ + 400, + 458, + 506, + 470 + ], + "score": 0.86, + "content": "2 c ^ { - 1 } ( \\mathbf { v } ) _ { 1 , : } \\geq 0 , ( \\ell _ { 1 } ) _ { 2 , : } <", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 469, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 183, + 483 + ], + "score": 1.0, + "content": "0. Then choosing", + "type": "text" + }, + { + "bbox": [ + 183, + 469, + 329, + 482 + ], + "score": 0.91, + "content": "c = 1 , \\mathbf { v } = ( 1 , 0 ) ^ { \\top } , \\ell _ { 1 } = ( 1 , - 1 ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 469, + 441, + 483 + ], + "score": 1.0, + "content": "yields a local minimum in", + "type": "text" + }, + { + "bbox": [ + 441, + 470, + 466, + 481 + ], + "score": 0.91, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 469, + 506, + 483 + ], + "score": 1.0, + "content": ", because", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 192, + 493 + ], + "score": 1.0, + "content": "the nonzero entry in", + "type": "text" + }, + { + "bbox": [ + 192, + 483, + 200, + 491 + ], + "score": 0.48, + "content": "\\mathbf { v }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 480, + 382, + 493 + ], + "score": 1.0, + "content": "corresponds to the largest singular value of", + "type": "text" + }, + { + "bbox": [ + 382, + 481, + 397, + 492 + ], + "score": 0.89, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 480, + 505, + 493 + ], + "score": 1.0, + "content": ". Then, calculation shows", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 490, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 104, + 490, + 245, + 507 + ], + "score": 1.0, + "content": "that the local minimum achieves", + "type": "text" + }, + { + "bbox": [ + 245, + 491, + 286, + 504 + ], + "score": 0.9, + "content": "\\begin{array} { l } { { \\mathcal { L } } _ { N } ~ = ~ \\frac { 1 } { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 490, + 454, + 507 + ], + "score": 1.0, + "content": ". On the other hand, consider the cone", + "type": "text" + }, + { + "bbox": [ + 455, + 492, + 482, + 503 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { I \\times J ^ { \\prime } }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 490, + 506, + 507 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 501, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 190, + 515 + ], + "score": 0.92, + "content": "I = \\{ 1 \\} , J ^ { \\prime } = \\{ 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 501, + 234, + 515 + ], + "score": 1.0, + "content": ", in which", + "type": "text" + }, + { + "bbox": [ + 234, + 504, + 308, + 514 + ], + "score": 0.85, + "content": "\\Sigma _ { J ^ { \\prime } } = \\mathrm { d i a } \\mathbf { \\bar { g } } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 501, + 506, + 515 + ], + "score": 1.0, + "content": ". The conditions for existence of critical points", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 513, + 506, + 527 + ], + "spans": [ + { + "bbox": [ + 104, + 513, + 224, + 527 + ], + "score": 1.0, + "content": "in eqs. (16) and (17) hold if", + "type": "text" + }, + { + "bbox": [ + 224, + 514, + 334, + 526 + ], + "score": 0.75, + "content": "c ^ { - 1 } ( \\mathbf { v } ) _ { 1 , : } \\geq 0 , ( \\ell _ { 1 } ) _ { 1 , : } < 0", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 513, + 506, + 527 + ], + "score": 1.0, + "content": ". Similarly to the previous case, choosing", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 525, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 107, + 525, + 243, + 538 + ], + "score": 0.9, + "content": "c = 1 , \\mathbf { v } = ( 1 , 0 ) ^ { \\top } , \\ell _ { 1 } = ( - 1 , 0 ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 525, + 469, + 538 + ], + "score": 1.0, + "content": "yields a local minimum that achieves the function value", + "type": "text" + }, + { + "bbox": [ + 469, + 526, + 501, + 537 + ], + "score": 0.93, + "content": "\\mathcal { L } _ { n } = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 525, + 505, + 538 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 536, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 453, + 549 + ], + "score": 1.0, + "content": "Hence, local minimum that is not global minimum does exist. Moreover, in the cone", + "type": "text" + }, + { + "bbox": [ + 453, + 537, + 483, + 548 + ], + "score": 0.92, + "content": "{ { \\cal { K } } _ { I \\times J ^ { \\prime \\prime } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 536, + 505, + 549 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 107, + 542, + 509, + 566 + ], + "spans": [ + { + "bbox": [ + 107, + 548, + 176, + 560 + ], + "score": 0.92, + "content": "I = \\{ 1 \\} , J ^ { \\prime \\prime } = \\emptyset", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 542, + 229, + 566 + ], + "score": 1.0, + "content": ", the function", + "type": "text" + }, + { + "bbox": [ + 230, + 548, + 245, + 559 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 542, + 353, + 566 + ], + "score": 1.0, + "content": "remains to be the constant", + "type": "text" + }, + { + "bbox": [ + 353, + 547, + 360, + 560 + ], + "score": 0.85, + "content": "\\frac { 5 } { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 542, + 509, + 566 + ], + "score": 1.0, + "content": ", and all points in this cone are local", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 558, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 505, + 572 + ], + "score": 1.0, + "content": "minimum or local maximum. Thus, the landscape of the loss function of nonlinear networks is very", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 569, + 339, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 339, + 581 + ], + "score": 1.0, + "content": "different from that of the loss function of linear networks.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 32.5 + }, + { + "type": "title", + "bbox": [ + 107, + 597, + 177, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 178, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 178, + 611 + ], + "score": 1.0, + "content": "CONCLUSION", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "score": 1.0, + "content": "In this paper, we provide full characterization of the analytical forms of the critical points for the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "square loss function of three types of neural networks, namely, shallow linear networks, deep linear", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 644, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 505, + 655 + ], + "score": 1.0, + "content": "networks, and shallow ReLU nonlinear networks. We show that such analytical forms of the critical", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 655, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 667 + ], + "score": 1.0, + "content": "points have direct implications on the values of the corresponding loss functions, achievement of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 665, + 506, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 679 + ], + "score": 1.0, + "content": "global minimum, and various landscape properties around these critical points. As a consequence,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "the loss function for linear networks has no spurious local minimum, while such point does exist for", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "nonlinear networks with ReLU activation. In the future, it is interesting to further explore nonlinear", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "neural networks. In particular, we wish to characterize the analytical form of critical points for", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "deep nonlinear networks and over the full parameter space. Such results will further facilitate the", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 721, + 387, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 387, + 733 + ], + "score": 1.0, + "content": "understanding of the landscape properties around these critical points.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 44.5 + } + ], + "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" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 504, + 128 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 364, + 95 + ], + "score": 1.0, + "content": "Proposition 7 (Characterization of critical points). Consider", + "type": "text" + }, + { + "bbox": [ + 365, + 83, + 380, + 93 + ], + "score": 0.86, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 82, + 405, + 95 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 405, + 83, + 441, + 93 + ], + "score": 0.9, + "content": "d _ { 1 } ~ = ~ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 82, + 482, + 95 + ], + "score": 1.0, + "content": "and any", + "type": "text" + }, + { + "bbox": [ + 483, + 83, + 505, + 94 + ], + "score": 0.81, + "content": "J \\subset", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 93, + 505, + 108 + ], + "spans": [ + { + "bbox": [ + 107, + 93, + 153, + 106 + ], + "score": 0.92, + "content": "\\{ 1 , \\ldots , m \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 93, + 305, + 108 + ], + "score": 1.0, + "content": ". Then, any nonzero critical point of", + "type": "text" + }, + { + "bbox": [ + 306, + 94, + 321, + 105 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 93, + 351, + 108 + ], + "score": 1.0, + "content": "within", + "type": "text" + }, + { + "bbox": [ + 351, + 94, + 384, + 106 + ], + "score": 0.91, + "content": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 93, + 505, + 108 + ], + "score": 1.0, + "content": "can be necessarily and suffi-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 218, + 119 + ], + "score": 1.0, + "content": "ciently characterized by an", + "type": "text" + }, + { + "bbox": [ + 218, + 105, + 268, + 118 + ], + "score": 0.93, + "content": "\\boldsymbol { \\ell } _ { 1 } ^ { \\top } \\in \\mathbb { R } ^ { 1 \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 104, + 352, + 119 + ], + "score": 1.0, + "content": ", a block unit vector", + "type": "text" + }, + { + "bbox": [ + 352, + 106, + 400, + 117 + ], + "score": 0.89, + "content": "\\mathbf { v } \\in \\mathbb { R } ^ { d _ { 2 } \\times 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 104, + 455, + 119 + ], + "score": 1.0, + "content": "and a scalar", + "type": "text" + }, + { + "bbox": [ + 456, + 106, + 483, + 117 + ], + "score": 0.81, + "content": "c \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 104, + 506, + 119 + ], + "score": 1.0, + "content": "such", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 115, + 127, + 130 + ], + "spans": [ + { + "bbox": [ + 104, + 115, + 127, + 130 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5, + "bbox_fs": [ + 104, + 82, + 506, + 130 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 179, + 131, + 432, + 149 + ], + "lines": [ + { + "bbox": [ + 179, + 131, + 432, + 149 + ], + "spans": [ + { + "bbox": [ + 179, + 131, + 432, + 149 + ], + "score": 0.89, + "content": "A _ { 1 } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dag } + \\bar { \\ell } _ { 1 } ^ { \\top } - \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J } X _ { : , J } ^ { \\dag } , \\quad A _ { 2 } = c U _ { J } \\mathbf { v } .", + "type": "interline_equation", + "image_path": "5986d03d678f1eb9081741d8248755d37e37ba012a1332dbb55e03942e617116.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 179, + 131, + 432, + 149 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 152, + 505, + 188 + ], + "lines": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 505, + 165 + ], + "score": 1.0, + "content": "Specifically, v is a unit vector that is supported on the entries corresponding to the same singular", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 162, + 506, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 162, + 143, + 177 + ], + "score": 1.0, + "content": "value of", + "type": "text" + }, + { + "bbox": [ + 144, + 164, + 158, + 174 + ], + "score": 0.88, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 162, + 321, + 177 + ], + "score": 1.0, + "content": ". Moreover, a nonzero critical point in", + "type": "text" + }, + { + "bbox": [ + 321, + 164, + 354, + 176 + ], + "score": 0.94, + "content": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 162, + 506, + 177 + ], + "score": 1.0, + "content": "exists if and only if there exist such", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 173, + 183, + 191 + ], + "spans": [ + { + "bbox": [ + 107, + 175, + 136, + 188 + ], + "score": 0.91, + "content": "c , \\mathbf { v } , \\mathbf { \\nabla } \\theta _ { 1 } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 173, + 183, + 191 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 151, + 506, + 191 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 191, + 456, + 229 + ], + "lines": [ + { + "bbox": [ + 155, + 191, + 456, + 229 + ], + "spans": [ + { + "bbox": [ + 155, + 191, + 456, + 229 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { A _ { 1 } X _ { : , J } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J } \\geq 0 , } \\\\ & { A _ { 1 } X _ { : , J ^ { c } } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J ^ { c } } + \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J ^ { c } } - \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J ^ { c } } < 0 . } \\end{array}", + "type": "interline_equation", + "image_path": "61f830a94553c6fb57ab9d179db39d0edd24f28d7fee4e69d864e370e008dc3a.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 155, + 191, + 456, + 203.66666666666666 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 155, + 203.66666666666666, + 456, + 216.33333333333331 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 155, + 216.33333333333331, + 456, + 228.99999999999997 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 236, + 505, + 271 + ], + "lines": [ + { + "bbox": [ + 106, + 235, + 504, + 250 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 488, + 250 + ], + "score": 1.0, + "content": "We note that Proposition 7 characterizes both the existence and the forms of critical points of", + "type": "text" + }, + { + "bbox": [ + 488, + 237, + 504, + 248 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 248, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 505, + 260 + ], + "score": 1.0, + "content": "over the entire parameter space for nonlinear networks with a single hidden unit. The condition in", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 258, + 327, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 231, + 272 + ], + "score": 1.0, + "content": "eq. (12) is guaranteed because", + "type": "text" + }, + { + "bbox": [ + 231, + 259, + 281, + 272 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\ker ( \\mathbf { v } ) } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 258, + 295, + 272 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 296, + 259, + 322, + 271 + ], + "score": 0.91, + "content": "\\mathbf { v } \\neq \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 258, + 327, + 272 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 235, + 505, + 272 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 505, + 366 + ], + "lines": [ + { + "bbox": [ + 105, + 275, + 504, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 439, + 290 + ], + "score": 1.0, + "content": "To further understand Proposition 7, suppose that there exists a critical point in", + "type": "text" + }, + { + "bbox": [ + 439, + 276, + 473, + 289 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 275, + 496, + 290 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 496, + 277, + 504, + 286 + ], + "score": 0.54, + "content": "\\mathbf { v }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 286, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 318, + 299 + ], + "score": 1.0, + "content": "being supported on the entries that correspond to the", + "type": "text" + }, + { + "bbox": [ + 318, + 288, + 323, + 297 + ], + "score": 0.73, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 286, + 404, + 299 + ], + "score": 1.0, + "content": "-th singular value of", + "type": "text" + }, + { + "bbox": [ + 405, + 287, + 419, + 298 + ], + "score": 0.88, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 286, + 505, + 299 + ], + "score": 1.0, + "content": ". Then, Proposition 1", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 297, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 155, + 311 + ], + "score": 1.0, + "content": "implies that", + "type": "text" + }, + { + "bbox": [ + 155, + 297, + 269, + 311 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal { L } _ { N } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sigma _ { i } ( J ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 297, + 505, + 311 + ], + "score": 1.0, + "content": ". In particular, the critical point achieves the local minimum", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 107, + 307, + 507, + 325 + ], + "spans": [ + { + "bbox": [ + 107, + 309, + 198, + 324 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sigma _ { 1 } \\bar { ( \\pmb { J } ) } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 307, + 210, + 325 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 210, + 311, + 243, + 324 + ], + "score": 0.89, + "content": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 307, + 265, + 325 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 266, + 311, + 290, + 321 + ], + "score": 0.89, + "content": "i = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 307, + 507, + 325 + ], + "score": 1.0, + "content": ". This is because in this case the critical point is full", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 505, + 334 + ], + "score": 1.0, + "content": "rank with an optimal order, and hence corresponds to the global minimum of the linear network in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 332, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 104, + 332, + 254, + 345 + ], + "score": 1.0, + "content": "eq. (9). Since the singular values of", + "type": "text" + }, + { + "bbox": [ + 254, + 333, + 269, + 344 + ], + "score": 0.89, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 332, + 386, + 345 + ], + "score": 1.0, + "content": "may vary with the choice of", + "type": "text" + }, + { + "bbox": [ + 387, + 333, + 394, + 343 + ], + "score": 0.54, + "content": "J", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 332, + 398, + 345 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 398, + 333, + 414, + 344 + ], + "score": 0.81, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 332, + 506, + 345 + ], + "score": 1.0, + "content": "may achieve different", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 342, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 486, + 357 + ], + "score": 1.0, + "content": "local minima in different cones. Thus, local minimum that is not global minimum can exist for", + "type": "text" + }, + { + "bbox": [ + 486, + 344, + 501, + 355 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 342, + 505, + 357 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 354, + 433, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 354, + 433, + 367 + ], + "score": 1.0, + "content": "The following proposition concludes this fact by considering a concrete example.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5, + "bbox_fs": [ + 104, + 275, + 507, + 367 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 369, + 503, + 392 + ], + "lines": [ + { + "bbox": [ + 106, + 368, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 505, + 382 + ], + "score": 1.0, + "content": "Proposition 8. For one-hidden-layer nonlinear neural networks with ReLU activation function,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 380, + 477, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 477, + 392 + ], + "score": 1.0, + "content": "there exists local minimum that is not global minimum, and there also exists local maximum.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 106, + 368, + 505, + 392 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 400, + 371, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 370, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 370, + 415 + ], + "score": 1.0, + "content": "The above proposition is demonstrated by the following example.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 399, + 370, + 415 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 503, + 438 + ], + "lines": [ + { + "bbox": [ + 106, + 414, + 501, + 428 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 264, + 428 + ], + "score": 1.0, + "content": "Example 1. Consider the loss function", + "type": "text" + }, + { + "bbox": [ + 264, + 415, + 279, + 426 + ], + "score": 0.87, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 414, + 399, + 428 + ], + "score": 1.0, + "content": "of the nonlinear network with", + "type": "text" + }, + { + "bbox": [ + 399, + 415, + 451, + 426 + ], + "score": 0.91, + "content": "d _ { 2 } = d _ { 0 } = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 414, + 472, + 428 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 472, + 415, + 501, + 426 + ], + "score": 0.9, + "content": "d _ { 1 } = 1", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 425, + 400, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 264, + 439 + ], + "score": 1.0, + "content": "The input and output data are set to be", + "type": "text" + }, + { + "bbox": [ + 264, + 426, + 396, + 438 + ], + "score": 0.9, + "content": "X = \\mathrm { d i a g } ( 1 , 1 ) , Y = \\mathrm { d i a g } ( 2 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 425, + 400, + 439 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 414, + 501, + 439 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 445, + 505, + 581 + ], + "lines": [ + { + "bbox": [ + 105, + 445, + 506, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 200, + 459 + ], + "score": 1.0, + "content": "First, consider the cone", + "type": "text" + }, + { + "bbox": [ + 201, + 447, + 225, + 458 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 445, + 246, + 459 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 246, + 446, + 320, + 459 + ], + "score": 0.88, + "content": "I = \\{ 1 \\} , J = \\{ 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 445, + 416, + 459 + ], + "score": 1.0, + "content": ". Calculation yields that", + "type": "text" + }, + { + "bbox": [ + 416, + 446, + 484, + 458 + ], + "score": 0.91, + "content": "\\Sigma _ { J } = \\mathrm { d i a g } ( 4 , 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 445, + 506, + 459 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 455, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 104, + 455, + 400, + 471 + ], + "score": 1.0, + "content": "the conditions for existence of critical points in eqs. (16) and (17) hold if", + "type": "text" + }, + { + "bbox": [ + 400, + 458, + 506, + 470 + ], + "score": 0.86, + "content": "2 c ^ { - 1 } ( \\mathbf { v } ) _ { 1 , : } \\geq 0 , ( \\ell _ { 1 } ) _ { 2 , : } <", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 469, + 506, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 183, + 483 + ], + "score": 1.0, + "content": "0. Then choosing", + "type": "text" + }, + { + "bbox": [ + 183, + 469, + 329, + 482 + ], + "score": 0.91, + "content": "c = 1 , \\mathbf { v } = ( 1 , 0 ) ^ { \\top } , \\ell _ { 1 } = ( 1 , - 1 ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 469, + 441, + 483 + ], + "score": 1.0, + "content": "yields a local minimum in", + "type": "text" + }, + { + "bbox": [ + 441, + 470, + 466, + 481 + ], + "score": 0.91, + "content": "{ \\mathcal { K } } _ { I \\times J }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 469, + 506, + 483 + ], + "score": 1.0, + "content": ", because", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 480, + 505, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 192, + 493 + ], + "score": 1.0, + "content": "the nonzero entry in", + "type": "text" + }, + { + "bbox": [ + 192, + 483, + 200, + 491 + ], + "score": 0.48, + "content": "\\mathbf { v }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 480, + 382, + 493 + ], + "score": 1.0, + "content": "corresponds to the largest singular value of", + "type": "text" + }, + { + "bbox": [ + 382, + 481, + 397, + 492 + ], + "score": 0.89, + "content": "\\Sigma _ { J }", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 480, + 505, + 493 + ], + "score": 1.0, + "content": ". Then, calculation shows", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 490, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 104, + 490, + 245, + 507 + ], + "score": 1.0, + "content": "that the local minimum achieves", + "type": "text" + }, + { + "bbox": [ + 245, + 491, + 286, + 504 + ], + "score": 0.9, + "content": "\\begin{array} { l } { { \\mathcal { L } } _ { N } ~ = ~ \\frac { 1 } { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 490, + 454, + 507 + ], + "score": 1.0, + "content": ". On the other hand, consider the cone", + "type": "text" + }, + { + "bbox": [ + 455, + 492, + 482, + 503 + ], + "score": 0.92, + "content": "{ \\mathcal { K } } _ { I \\times J ^ { \\prime } }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 490, + 506, + 507 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 501, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 190, + 515 + ], + "score": 0.92, + "content": "I = \\{ 1 \\} , J ^ { \\prime } = \\{ 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 501, + 234, + 515 + ], + "score": 1.0, + "content": ", in which", + "type": "text" + }, + { + "bbox": [ + 234, + 504, + 308, + 514 + ], + "score": 0.85, + "content": "\\Sigma _ { J ^ { \\prime } } = \\mathrm { d i a } \\mathbf { \\bar { g } } ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 501, + 506, + 515 + ], + "score": 1.0, + "content": ". The conditions for existence of critical points", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 513, + 506, + 527 + ], + "spans": [ + { + "bbox": [ + 104, + 513, + 224, + 527 + ], + "score": 1.0, + "content": "in eqs. (16) and (17) hold if", + "type": "text" + }, + { + "bbox": [ + 224, + 514, + 334, + 526 + ], + "score": 0.75, + "content": "c ^ { - 1 } ( \\mathbf { v } ) _ { 1 , : } \\geq 0 , ( \\ell _ { 1 } ) _ { 1 , : } < 0", + "type": "inline_equation" + }, + { + "bbox": [ + 334, + 513, + 506, + 527 + ], + "score": 1.0, + "content": ". Similarly to the previous case, choosing", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 525, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 107, + 525, + 243, + 538 + ], + "score": 0.9, + "content": "c = 1 , \\mathbf { v } = ( 1 , 0 ) ^ { \\top } , \\ell _ { 1 } = ( - 1 , 0 ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 525, + 469, + 538 + ], + "score": 1.0, + "content": "yields a local minimum that achieves the function value", + "type": "text" + }, + { + "bbox": [ + 469, + 526, + 501, + 537 + ], + "score": 0.93, + "content": "\\mathcal { L } _ { n } = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 525, + 505, + 538 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 536, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 453, + 549 + ], + "score": 1.0, + "content": "Hence, local minimum that is not global minimum does exist. Moreover, in the cone", + "type": "text" + }, + { + "bbox": [ + 453, + 537, + 483, + 548 + ], + "score": 0.92, + "content": "{ { \\cal { K } } _ { I \\times J ^ { \\prime \\prime } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 536, + 505, + 549 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 107, + 542, + 509, + 566 + ], + "spans": [ + { + "bbox": [ + 107, + 548, + 176, + 560 + ], + "score": 0.92, + "content": "I = \\{ 1 \\} , J ^ { \\prime \\prime } = \\emptyset", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 542, + 229, + 566 + ], + "score": 1.0, + "content": ", the function", + "type": "text" + }, + { + "bbox": [ + 230, + 548, + 245, + 559 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { N }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 542, + 353, + 566 + ], + "score": 1.0, + "content": "remains to be the constant", + "type": "text" + }, + { + "bbox": [ + 353, + 547, + 360, + 560 + ], + "score": 0.85, + "content": "\\frac { 5 } { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 542, + 509, + 566 + ], + "score": 1.0, + "content": ", and all points in this cone are local", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 558, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 505, + 572 + ], + "score": 1.0, + "content": "minimum or local maximum. Thus, the landscape of the loss function of nonlinear networks is very", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 569, + 339, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 569, + 339, + 581 + ], + "score": 1.0, + "content": "different from that of the loss function of linear networks.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 32.5, + "bbox_fs": [ + 104, + 445, + 509, + 581 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 597, + 177, + 609 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 178, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 178, + 611 + ], + "score": 1.0, + "content": "CONCLUSION", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 635 + ], + "score": 1.0, + "content": "In this paper, we provide full characterization of the analytical forms of the critical points for the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 645 + ], + "score": 1.0, + "content": "square loss function of three types of neural networks, namely, shallow linear networks, deep linear", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 644, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 505, + 655 + ], + "score": 1.0, + "content": "networks, and shallow ReLU nonlinear networks. We show that such analytical forms of the critical", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 655, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 506, + 667 + ], + "score": 1.0, + "content": "points have direct implications on the values of the corresponding loss functions, achievement of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 665, + 506, + 679 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 506, + 679 + ], + "score": 1.0, + "content": "global minimum, and various landscape properties around these critical points. As a consequence,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "score": 1.0, + "content": "the loss function for linear networks has no spurious local minimum, while such point does exist for", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 700 + ], + "score": 1.0, + "content": "nonlinear networks with ReLU activation. In the future, it is interesting to further explore nonlinear", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "neural networks. In particular, we wish to characterize the analytical form of critical points for", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "deep nonlinear networks and over the full parameter space. Such results will further facilitate the", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 721, + 387, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 387, + 733 + ], + "score": 1.0, + "content": "understanding of the landscape properties around these critical points.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 622, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 83, + 201, + 93 + ], + "lines": [ + { + "bbox": [ + 107, + 83, + 201, + 94 + ], + "spans": [ + { + "bbox": [ + 107, + 83, + 201, + 94 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 101, + 504, + 125 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 506, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 506, + 115 + ], + "score": 1.0, + "content": "The work was supported in part by US National Science Foundation under the grants CCF-1761506,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 112, + 400, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 400, + 125 + ], + "score": 1.0, + "content": "ECCS-1818904, and was supported in part by DARPA FunLoL program.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 104, + 133, + 506, + 734 + ], + "lines": [ + { + "bbox": [ + 106, + 140, + 176, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 176, + 154 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 158, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 104, + 158, + 506, + 173 + ], + "score": 1.0, + "content": "P. Baldi. Linear learning: Landscapes and algorithms. In Proc. Advances in Neural Information", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 170, + 300, + 185 + ], + "spans": [ + { + "bbox": [ + 115, + 170, + 300, + 185 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), pp. 65–72. 1989.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 189, + 506, + 204 + ], + "spans": [ + { + "bbox": [ + 104, + 189, + 506, + 204 + ], + "score": 1.0, + "content": "P. Baldi and K. Hornik. Neural networks and principal component analysis: Learning from examples", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 200, + 359, + 213 + ], + "spans": [ + { + "bbox": [ + 115, + 200, + 359, + 213 + ], + "score": 1.0, + "content": "without local minima. Neural Networks, 2(1):53 – 58, 1989.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "score": 1.0, + "content": "P. Baldi and Z. Lu. Complex-valued autoencoders. Neural Networks, 33:136–147, September 2012.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 237, + 506, + 253 + ], + "spans": [ + { + "bbox": [ + 104, + 237, + 506, + 253 + ], + "score": 1.0, + "content": "A. Choromanska, M. Henaff, M. Mathieu, G. Arous, and Y. LeCun. The loss surfaces of multilayer", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 114, + 249, + 475, + 262 + ], + "spans": [ + { + "bbox": [ + 114, + 249, + 475, + 262 + ], + "score": 1.0, + "content": "networks. Journal of Machine Learning Research, 38:192–204, 2015a. ISSN 1532-4435.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 269, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 269, + 506, + 281 + ], + "score": 1.0, + "content": "A. Choromanska, Y. LeCun, and G. Arous. Open problem: The landscape of the loss surfaces of", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 115, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "multilayer networks. In Proc. Conference on Learning Theory (COLT), volume 40, pp. 1756–", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 291, + 186, + 303 + ], + "spans": [ + { + "bbox": [ + 116, + 291, + 186, + 303 + ], + "score": 1.0, + "content": "1760, Jul 2015b.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 310, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 310, + 505, + 322 + ], + "score": 1.0, + "content": "Y. N. Dauphin, R. Pascanu, C. Gulcehre, K. Cho, S. Ganguli, and Y. Bengio. Identifying and attack-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 320, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 115, + 320, + 506, + 334 + ], + "score": 1.0, + "content": "ing the saddle point problem in high-dimensional non-convex optimization. In Proc. Advances in", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 114, + 330, + 336, + 344 + ], + "spans": [ + { + "bbox": [ + 114, + 330, + 336, + 344 + ], + "score": 1.0, + "content": "Neural Information Processing Systems (NIPS). 2014.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 348, + 506, + 364 + ], + "spans": [ + { + "bbox": [ + 104, + 348, + 506, + 364 + ], + "score": 1.0, + "content": "S. Feizi, H. Javadi, J. Zhang, and D. Tse. Porcupine neural networks: (almost) all local optima are", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 114, + 361, + 291, + 375 + ], + "spans": [ + { + "bbox": [ + 114, + 361, + 291, + 375 + ], + "score": 1.0, + "content": "global. ArXiv: 1710.02196, October 2017.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 380, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 394 + ], + "score": 1.0, + "content": "C. D. Freeman and J. Bruna. Topology and geometry of half-rectified network optimization. Proc.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 392, + 396, + 404 + ], + "spans": [ + { + "bbox": [ + 115, + 392, + 396, + 404 + ], + "score": 1.0, + "content": "International Conference on Learning Representations (ICLR), 2017.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 409, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 104, + 409, + 505, + 424 + ], + "score": 1.0, + "content": "I. Goodfellow, Y. Bengio, and A. Courville. Deep Learning. MIT Press, 2016. http://www.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 114, + 421, + 243, + 436 + ], + "spans": [ + { + "bbox": [ + 114, + 421, + 243, + 436 + ], + "score": 1.0, + "content": "deeplearningbook.org.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 439, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 104, + 439, + 506, + 454 + ], + "score": 1.0, + "content": "M. Gori and A. Tesi. On the problem of local minima in backpropagation. IEEE Transactions on", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 450, + 386, + 465 + ], + "spans": [ + { + "bbox": [ + 115, + 450, + 386, + 465 + ], + "score": 1.0, + "content": "Pattern Analysis and Machine Intelligence, 14(1):76–86, Jan 1992.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 469, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 104, + 469, + 506, + 484 + ], + "score": 1.0, + "content": "M. Hardt and T. Ma. Identity matters in deep learning. Proc. International Conference on Learning", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 482, + 241, + 495 + ], + "spans": [ + { + "bbox": [ + 116, + 482, + 241, + 495 + ], + "score": 1.0, + "content": "Representations (ICLR), 2017.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 498, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 104, + 498, + 506, + 514 + ], + "score": 1.0, + "content": "K. Kawaguchi. Deep learning without poor local minima. In Proc. Advances in Neural Information", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 510, + 310, + 525 + ], + "spans": [ + { + "bbox": [ + 115, + 510, + 310, + 525 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), pp. 586–594. 2016.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 529, + 506, + 544 + ], + "spans": [ + { + "bbox": [ + 104, + 529, + 506, + 544 + ], + "score": 1.0, + "content": "S. Li, J. Jiao, Y. Han, and T. Weissman. Demystifying resnet. Arxiv: 1611.01186, 2016a. URL", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 541, + 316, + 555 + ], + "spans": [ + { + "bbox": [ + 115, + 541, + 316, + 555 + ], + "score": 1.0, + "content": "https://arxiv.org/pdf/1611.01186.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 559, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 506, + 574 + ], + "score": 1.0, + "content": "X. Li, Z. Wang, J. Lu, R. Arora, J. Haupt, H. Liu, and T. Zhao. Symmetry, saddle points, and global", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 113, + 570, + 463, + 585 + ], + "spans": [ + { + "bbox": [ + 113, + 570, + 463, + 585 + ], + "score": 1.0, + "content": "geometry of nonconvex matrix factorization. ArXiv: 1612.09296v2, December 2016b.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 587, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 104, + 587, + 506, + 605 + ], + "score": 1.0, + "content": "H. T. Lu and K. Kawaguchi. Depth creates no bad local minima. ArXiv: 1702.08580, February", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 601, + 143, + 614 + ], + "spans": [ + { + "bbox": [ + 115, + 601, + 143, + 614 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 619, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 104, + 619, + 506, + 633 + ], + "score": 1.0, + "content": "Q. Nguyen and M. Hein. The loss surface of deep and wide neural networks. In Proc. International", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 631, + 446, + 644 + ], + "spans": [ + { + "bbox": [ + 115, + 631, + 446, + 644 + ], + "score": 1.0, + "content": "Conference on Machine Learning (ICML), volume 70, pp. 2603–2612, Aug 2017.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 648, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 104, + 648, + 506, + 664 + ], + "score": 1.0, + "content": "M. Soltanolkotabi, A. Javanmard, and J. D. Lee. Theoretical insights into the optimization landscape", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 114, + 660, + 414, + 674 + ], + "spans": [ + { + "bbox": [ + 114, + 660, + 414, + 674 + ], + "score": 1.0, + "content": "of over-parameterized shallow neural networks. ArXiv:1707.04926, 2017.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 104, + 678, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 104, + 678, + 506, + 694 + ], + "score": 1.0, + "content": "D. Soudry and Y. Carmon. No bad local minima: Data independent training error guarantees for", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 690, + 358, + 705 + ], + "spans": [ + { + "bbox": [ + 115, + 690, + 358, + 705 + ], + "score": 1.0, + "content": "multilayer neural networks. ArXiv: 1605.08361, May 2016.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 709, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 724 + ], + "score": 1.0, + "content": "D. Soudry and E. Hoffer. Exponentially vanishing sub-optimal local minima in multilayer neural", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 114, + 720, + 302, + 735 + ], + "spans": [ + { + "bbox": [ + 114, + 720, + 302, + 735 + ], + "score": 1.0, + "content": "networks. ArXiv:1702.05777, February 2017.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 22.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" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 83, + 201, + 93 + ], + "lines": [ + { + "bbox": [ + 107, + 83, + 201, + 94 + ], + "spans": [ + { + "bbox": [ + 107, + 83, + 201, + 94 + ], + "score": 1.0, + "content": "ACKNOWLEDGMENTS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 101, + 504, + 125 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 506, + 115 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 506, + 115 + ], + "score": 1.0, + "content": "The work was supported in part by US National Science Foundation under the grants CCF-1761506,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 112, + 400, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 400, + 125 + ], + "score": 1.0, + "content": "ECCS-1818904, and was supported in part by DARPA FunLoL program.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 105, + 100, + 506, + 125 + ] + }, + { + "type": "list", + "bbox": [ + 104, + 133, + 506, + 734 + ], + "lines": [ + { + "bbox": [ + 106, + 140, + 176, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 140, + 176, + 154 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 158, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 104, + 158, + 506, + 173 + ], + "score": 1.0, + "content": "P. Baldi. Linear learning: Landscapes and algorithms. In Proc. Advances in Neural Information", + "type": "text" + } + ], + "index": 4, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 170, + 300, + 185 + ], + "spans": [ + { + "bbox": [ + 115, + 170, + 300, + 185 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), pp. 65–72. 1989.", + "type": "text" + } + ], + "index": 5, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 189, + 506, + 204 + ], + "spans": [ + { + "bbox": [ + 104, + 189, + 506, + 204 + ], + "score": 1.0, + "content": "P. Baldi and K. Hornik. Neural networks and principal component analysis: Learning from examples", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 200, + 359, + 213 + ], + "spans": [ + { + "bbox": [ + 115, + 200, + 359, + 213 + ], + "score": 1.0, + "content": "without local minima. Neural Networks, 2(1):53 – 58, 1989.", + "type": "text" + } + ], + "index": 7, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 219, + 505, + 232 + ], + "score": 1.0, + "content": "P. Baldi and Z. Lu. Complex-valued autoencoders. Neural Networks, 33:136–147, September 2012.", + "type": "text" + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 104, + 237, + 506, + 253 + ], + "spans": [ + { + "bbox": [ + 104, + 237, + 506, + 253 + ], + "score": 1.0, + "content": "A. Choromanska, M. Henaff, M. Mathieu, G. Arous, and Y. LeCun. The loss surfaces of multilayer", + "type": "text" + } + ], + "index": 9, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 249, + 475, + 262 + ], + "spans": [ + { + "bbox": [ + 114, + 249, + 475, + 262 + ], + "score": 1.0, + "content": "networks. Journal of Machine Learning Research, 38:192–204, 2015a. ISSN 1532-4435.", + "type": "text" + } + ], + "index": 10, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 269, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 269, + 506, + 281 + ], + "score": 1.0, + "content": "A. Choromanska, Y. LeCun, and G. Arous. Open problem: The landscape of the loss surfaces of", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 280, + 505, + 293 + ], + "spans": [ + { + "bbox": [ + 115, + 280, + 505, + 293 + ], + "score": 1.0, + "content": "multilayer networks. In Proc. Conference on Learning Theory (COLT), volume 40, pp. 1756–", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 291, + 186, + 303 + ], + "spans": [ + { + "bbox": [ + 116, + 291, + 186, + 303 + ], + "score": 1.0, + "content": "1760, Jul 2015b.", + "type": "text" + } + ], + "index": 13, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 310, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 310, + 505, + 322 + ], + "score": 1.0, + "content": "Y. N. Dauphin, R. Pascanu, C. Gulcehre, K. Cho, S. Ganguli, and Y. Bengio. Identifying and attack-", + "type": "text" + } + ], + "index": 14, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 320, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 115, + 320, + 506, + 334 + ], + "score": 1.0, + "content": "ing the saddle point problem in high-dimensional non-convex optimization. In Proc. Advances in", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 114, + 330, + 336, + 344 + ], + "spans": [ + { + "bbox": [ + 114, + 330, + 336, + 344 + ], + "score": 1.0, + "content": "Neural Information Processing Systems (NIPS). 2014.", + "type": "text" + } + ], + "index": 16, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 348, + 506, + 364 + ], + "spans": [ + { + "bbox": [ + 104, + 348, + 506, + 364 + ], + "score": 1.0, + "content": "S. Feizi, H. Javadi, J. Zhang, and D. Tse. Porcupine neural networks: (almost) all local optima are", + "type": "text" + } + ], + "index": 17, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 361, + 291, + 375 + ], + "spans": [ + { + "bbox": [ + 114, + 361, + 291, + 375 + ], + "score": 1.0, + "content": "global. ArXiv: 1710.02196, October 2017.", + "type": "text" + } + ], + "index": 18, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 380, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 394 + ], + "score": 1.0, + "content": "C. D. Freeman and J. Bruna. Topology and geometry of half-rectified network optimization. Proc.", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 392, + 396, + 404 + ], + "spans": [ + { + "bbox": [ + 115, + 392, + 396, + 404 + ], + "score": 1.0, + "content": "International Conference on Learning Representations (ICLR), 2017.", + "type": "text" + } + ], + "index": 20, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 409, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 104, + 409, + 505, + 424 + ], + "score": 1.0, + "content": "I. Goodfellow, Y. Bengio, and A. Courville. Deep Learning. MIT Press, 2016. http://www.", + "type": "text" + } + ], + "index": 21, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 421, + 243, + 436 + ], + "spans": [ + { + "bbox": [ + 114, + 421, + 243, + 436 + ], + "score": 1.0, + "content": "deeplearningbook.org.", + "type": "text" + } + ], + "index": 22, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 439, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 104, + 439, + 506, + 454 + ], + "score": 1.0, + "content": "M. Gori and A. Tesi. On the problem of local minima in backpropagation. IEEE Transactions on", + "type": "text" + } + ], + "index": 23, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 450, + 386, + 465 + ], + "spans": [ + { + "bbox": [ + 115, + 450, + 386, + 465 + ], + "score": 1.0, + "content": "Pattern Analysis and Machine Intelligence, 14(1):76–86, Jan 1992.", + "type": "text" + } + ], + "index": 24, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 469, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 104, + 469, + 506, + 484 + ], + "score": 1.0, + "content": "M. Hardt and T. Ma. Identity matters in deep learning. Proc. International Conference on Learning", + "type": "text" + } + ], + "index": 25, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 482, + 241, + 495 + ], + "spans": [ + { + "bbox": [ + 116, + 482, + 241, + 495 + ], + "score": 1.0, + "content": "Representations (ICLR), 2017.", + "type": "text" + } + ], + "index": 26, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 498, + 506, + 514 + ], + "spans": [ + { + "bbox": [ + 104, + 498, + 506, + 514 + ], + "score": 1.0, + "content": "K. Kawaguchi. Deep learning without poor local minima. In Proc. Advances in Neural Information", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 510, + 310, + 525 + ], + "spans": [ + { + "bbox": [ + 115, + 510, + 310, + 525 + ], + "score": 1.0, + "content": "Processing Systems (NIPS), pp. 586–594. 2016.", + "type": "text" + } + ], + "index": 28, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 529, + 506, + 544 + ], + "spans": [ + { + "bbox": [ + 104, + 529, + 506, + 544 + ], + "score": 1.0, + "content": "S. Li, J. Jiao, Y. Han, and T. Weissman. Demystifying resnet. Arxiv: 1611.01186, 2016a. URL", + "type": "text" + } + ], + "index": 29, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 541, + 316, + 555 + ], + "spans": [ + { + "bbox": [ + 115, + 541, + 316, + 555 + ], + "score": 1.0, + "content": "https://arxiv.org/pdf/1611.01186.", + "type": "text" + } + ], + "index": 30, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 559, + 506, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 506, + 574 + ], + "score": 1.0, + "content": "X. Li, Z. Wang, J. Lu, R. Arora, J. Haupt, H. Liu, and T. Zhao. Symmetry, saddle points, and global", + "type": "text" + } + ], + "index": 31, + "is_list_start_line": true + }, + { + "bbox": [ + 113, + 570, + 463, + 585 + ], + "spans": [ + { + "bbox": [ + 113, + 570, + 463, + 585 + ], + "score": 1.0, + "content": "geometry of nonconvex matrix factorization. ArXiv: 1612.09296v2, December 2016b.", + "type": "text" + } + ], + "index": 32, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 587, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 104, + 587, + 506, + 605 + ], + "score": 1.0, + "content": "H. T. Lu and K. Kawaguchi. Depth creates no bad local minima. ArXiv: 1702.08580, February", + "type": "text" + } + ], + "index": 33, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 601, + 143, + 614 + ], + "spans": [ + { + "bbox": [ + 115, + 601, + 143, + 614 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 34, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 619, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 104, + 619, + 506, + 633 + ], + "score": 1.0, + "content": "Q. Nguyen and M. Hein. The loss surface of deep and wide neural networks. In Proc. International", + "type": "text" + } + ], + "index": 35, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 631, + 446, + 644 + ], + "spans": [ + { + "bbox": [ + 115, + 631, + 446, + 644 + ], + "score": 1.0, + "content": "Conference on Machine Learning (ICML), volume 70, pp. 2603–2612, Aug 2017.", + "type": "text" + } + ], + "index": 36, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 648, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 104, + 648, + 506, + 664 + ], + "score": 1.0, + "content": "M. Soltanolkotabi, A. Javanmard, and J. D. Lee. Theoretical insights into the optimization landscape", + "type": "text" + } + ], + "index": 37, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 660, + 414, + 674 + ], + "spans": [ + { + "bbox": [ + 114, + 660, + 414, + 674 + ], + "score": 1.0, + "content": "of over-parameterized shallow neural networks. ArXiv:1707.04926, 2017.", + "type": "text" + } + ], + "index": 38, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 678, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 104, + 678, + 506, + 694 + ], + "score": 1.0, + "content": "D. Soudry and Y. Carmon. No bad local minima: Data independent training error guarantees for", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 690, + 358, + 705 + ], + "spans": [ + { + "bbox": [ + 115, + 690, + 358, + 705 + ], + "score": 1.0, + "content": "multilayer neural networks. ArXiv: 1605.08361, May 2016.", + "type": "text" + } + ], + "index": 40, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 709, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 724 + ], + "score": 1.0, + "content": "D. Soudry and E. Hoffer. Exponentially vanishing sub-optimal local minima in multilayer neural", + "type": "text" + } + ], + "index": 41, + "is_list_start_line": true + }, + { + "bbox": [ + 114, + 720, + 302, + 735 + ], + "spans": [ + { + "bbox": [ + 114, + 720, + 302, + 735 + ], + "score": 1.0, + "content": "networks. ArXiv:1702.05777, February 2017.", + "type": "text" + } + ], + "index": 42, + "is_list_end_line": true + }, + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "score": 1.0, + "content": "A. Taghvaei, J. W. Kim, and P. Mehta. How regularization affects the critical points in linear net-", + "type": "text", + "cross_page": true + } + ], + "index": 0, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 94, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 116, + 94, + 505, + 107 + ], + "score": 1.0, + "content": "works. In Proc. International Conference on Neural Information Processing Systems (NIPS),", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 104, + 142, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 104, + 142, + 117 + ], + "score": 1.0, + "content": "2017.", + "type": "text", + "cross_page": true + } + ], + "index": 2, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 123, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 505, + 137 + ], + "score": 1.0, + "content": "Y. Tian. An analytical formula of population gradient for two-layered ReLU network and its appli-", + "type": "text", + "cross_page": true + } + ], + "index": 3, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 135, + 506, + 149 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 506, + 149 + ], + "score": 1.0, + "content": "cations in convergence and critical point analysis. In Proc. International Conference on Machine", + "type": "text", + "cross_page": true + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 146, + 375, + 159 + ], + "spans": [ + { + "bbox": [ + 116, + 146, + 375, + 159 + ], + "score": 1.0, + "content": "Learning (ICML), volume 70, pp. 3404–3413, 06–11 Aug 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 5, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 164, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 177 + ], + "score": 1.0, + "content": "X. H. Yu and G. A. Chen. On the local minima free condition of backpropagation learning. IEEE", + "type": "text", + "cross_page": true + } + ], + "index": 6, + "is_list_start_line": true + }, + { + "bbox": [ + 116, + 176, + 366, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 176, + 366, + 187 + ], + "score": 1.0, + "content": "Transactions on Neural Networks, 6(5):1300–1303, Sep 1995.", + "type": "text", + "cross_page": true + } + ], + "index": 7, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 193, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 208 + ], + "score": 1.0, + "content": "C. Yun, S. Sra, and A. Jadbabaie. Global optimality conditions for deep neural networks. ArXiv:", + "type": "text", + "cross_page": true + } + ], + "index": 8, + "is_list_start_line": true + }, + { + "bbox": [ + 117, + 205, + 194, + 217 + ], + "spans": [ + { + "bbox": [ + 117, + 205, + 194, + 217 + ], + "score": 1.0, + "content": "1707.02444, 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 9, + "is_list_end_line": true + }, + { + "bbox": [ + 104, + 223, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 104, + 223, + 505, + 237 + ], + "score": 1.0, + "content": "C. Yun, S. Sra, and A. Jadbabaie. Global optimality conditions for deep neural networks. In Proc.", + "type": "text", + "cross_page": true + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 235, + 397, + 249 + ], + "spans": [ + { + "bbox": [ + 115, + 235, + 397, + 249 + ], + "score": 1.0, + "content": "International Conference on Learning Representations (ICLR), 2018.", + "type": "text", + "cross_page": true + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 254, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 506, + 268 + ], + "score": 1.0, + "content": "K. Zhong, Z. Song, P. Jain, P. L. Bartlett, and I. S. Dhillon. Recovery guarantees for one-hidden-layer", + "type": "text", + "cross_page": true + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 265, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 115, + 265, + 505, + 279 + ], + "score": 1.0, + "content": "neural networks. In Proc. International Conference on Machine Learning (ICML), volume 70,", + "type": "text", + "cross_page": true + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 276, + 227, + 289 + ], + "spans": [ + { + "bbox": [ + 115, + 276, + 227, + 289 + ], + "score": 1.0, + "content": "pp. 4140–4149, Aug 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 14, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 294, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 506, + 309 + ], + "score": 1.0, + "content": "Y. Zhou and Y. Liang. Characterization of gradient dominance and regularity conditions for neural", + "type": "text", + "cross_page": true + } + ], + "index": 15, + "is_list_start_line": true + }, + { + "bbox": [ + 115, + 306, + 310, + 318 + ], + "spans": [ + { + "bbox": [ + 115, + 306, + 310, + 318 + ], + "score": 1.0, + "content": "networks. ArXiv: 1710.06910v2, October 2017.", + "type": "text", + "cross_page": true + } + ], + "index": 16, + "is_list_end_line": true + } + ], + "index": 22.5, + "bbox_fs": [ + 104, + 140, + 506, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 81, + 506, + 318 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 96 + ], + "score": 1.0, + "content": "A. Taghvaei, J. W. Kim, and P. Mehta. How regularization affects the critical points in linear net-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 94, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 116, + 94, + 505, + 107 + ], + "score": 1.0, + "content": "works. In Proc. International Conference on Neural Information Processing Systems (NIPS),", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 115, + 104, + 142, + 117 + ], + "spans": [ + { + "bbox": [ + 115, + 104, + 142, + 117 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 123, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 505, + 137 + ], + "score": 1.0, + "content": "Y. Tian. An analytical formula of population gradient for two-layered ReLU network and its appli-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 506, + 149 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 506, + 149 + ], + "score": 1.0, + "content": "cations in convergence and critical point analysis. In Proc. International Conference on Machine", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 146, + 375, + 159 + ], + "spans": [ + { + "bbox": [ + 116, + 146, + 375, + 159 + ], + "score": 1.0, + "content": "Learning (ICML), volume 70, pp. 3404–3413, 06–11 Aug 2017.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 164, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 177 + ], + "score": 1.0, + "content": "X. H. Yu and G. A. Chen. On the local minima free condition of backpropagation learning. IEEE", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 176, + 366, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 176, + 366, + 187 + ], + "score": 1.0, + "content": "Transactions on Neural Networks, 6(5):1300–1303, Sep 1995.", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 193, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 208 + ], + "score": 1.0, + "content": "C. Yun, S. Sra, and A. Jadbabaie. Global optimality conditions for deep neural networks. ArXiv:", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 205, + 194, + 217 + ], + "spans": [ + { + "bbox": [ + 117, + 205, + 194, + 217 + ], + "score": 1.0, + "content": "1707.02444, 2017.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 223, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 104, + 223, + 505, + 237 + ], + "score": 1.0, + "content": "C. Yun, S. Sra, and A. Jadbabaie. Global optimality conditions for deep neural networks. In Proc.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 235, + 397, + 249 + ], + "spans": [ + { + "bbox": [ + 115, + 235, + 397, + 249 + ], + "score": 1.0, + "content": "International Conference on Learning Representations (ICLR), 2018.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 254, + 506, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 506, + 268 + ], + "score": 1.0, + "content": "K. Zhong, Z. Song, P. Jain, P. L. Bartlett, and I. S. Dhillon. Recovery guarantees for one-hidden-layer", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 265, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 115, + 265, + 505, + 279 + ], + "score": 1.0, + "content": "neural networks. In Proc. International Conference on Machine Learning (ICML), volume 70,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 276, + 227, + 289 + ], + "spans": [ + { + "bbox": [ + 115, + 276, + 227, + 289 + ], + "score": 1.0, + "content": "pp. 4140–4149, Aug 2017.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 294, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 506, + 309 + ], + "score": 1.0, + "content": "Y. Zhou and Y. Liang. Characterization of gradient dominance and regularity conditions for neural", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 306, + 310, + 318 + ], + "spans": [ + { + "bbox": [ + 115, + 306, + 310, + 318 + ], + "score": 1.0, + "content": "networks. ArXiv: 1710.06910v2, October 2017.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 8 + } + ], + "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 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "list", + "bbox": [ + 105, + 81, + 506, + 318 + ], + "lines": [], + "index": 8, + "bbox_fs": [ + 104, + 82, + 506, + 318 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 78, + 265, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 266, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 266, + 96 + ], + "score": 1.0, + "content": "Supplementary Materials", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 110, + 222, + 123 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 224, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 224, + 125 + ], + "score": 1.0, + "content": "PROOF OF THEOREM 1", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 136, + 504, + 170 + ], + "lines": [ + { + "bbox": [ + 105, + 135, + 504, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 135, + 211, + 149 + ], + "score": 1.0, + "content": "Notations: For any matrix", + "type": "text" + }, + { + "bbox": [ + 211, + 137, + 225, + 146 + ], + "score": 0.8, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 135, + 257, + 149 + ], + "score": 1.0, + "content": ", denote", + "type": "text" + }, + { + "bbox": [ + 257, + 136, + 292, + 148 + ], + "score": 0.82, + "content": "\\mathrm { v e c } ( M )", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 135, + 504, + 149 + ], + "score": 1.0, + "content": "as the column vector formed by stacking its columns.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 147, + 504, + 159 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 245, + 159 + ], + "score": 1.0, + "content": "Denote the Kronecker product as “", + "type": "text" + }, + { + "bbox": [ + 245, + 148, + 256, + 158 + ], + "score": 0.57, + "content": "\\otimes ^ { \\bullet }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 147, + 504, + 159 + ], + "score": 1.0, + "content": ". Then, the following useful relationships hold for any dimen-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 158, + 271, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 208, + 170 + ], + "score": 1.0, + "content": "sion compatible matrices", + "type": "text" + }, + { + "bbox": [ + 209, + 158, + 266, + 170 + ], + "score": 0.92, + "content": "M , U , V , W", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 158, + 271, + 170 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "interline_equation", + "bbox": [ + 223, + 174, + 386, + 253 + ], + "lines": [ + { + "bbox": [ + 223, + 174, + 386, + 253 + ], + "spans": [ + { + "bbox": [ + 223, + 174, + 386, + 253 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathrm { v e c } ( U M V ) = ( V ^ { \\top } \\otimes U ) \\mathrm { v e c } ( M ) , } \\\\ & { ( U \\otimes V ) ^ { \\dagger } = U ^ { \\dagger } \\otimes V ^ { \\dagger } , } \\\\ & { ( M \\otimes W ) ( U \\otimes V ) = ( M U ) \\otimes ( W V ) , } \\\\ & { ( M ^ { \\top } M ) ^ { \\dagger } M ^ { \\top } = M ^ { \\top } ( M M ^ { \\top } ) ^ { \\dagger } = M ^ { \\dagger } , } \\\\ & { M M ^ { \\dagger } M = M , M ^ { \\dagger } M M ^ { \\dagger } = M ^ { \\dagger } . } \\end{array}", + "type": "interline_equation", + "image_path": "b47babcc8c7986bb42c583d0db1821956e7d7d56831ea4834b770aadea574872.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 223, + 174, + 386, + 189.8 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 223, + 189.8, + 386, + 205.60000000000002 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 223, + 205.60000000000002, + 386, + 221.40000000000003 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 223, + 221.40000000000003, + 386, + 237.20000000000005 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 223, + 237.20000000000005, + 386, + 253.00000000000006 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 264, + 363, + 277 + ], + "lines": [ + { + "bbox": [ + 105, + 263, + 363, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 182, + 278 + ], + "score": 1.0, + "content": "Recall that a point", + "type": "text" + }, + { + "bbox": [ + 182, + 265, + 221, + 276 + ], + "score": 0.93, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 263, + 303, + 278 + ], + "score": 1.0, + "content": "is a critical point of", + "type": "text" + }, + { + "bbox": [ + 303, + 265, + 311, + 275 + ], + "score": 0.85, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 263, + 363, + 278 + ], + "score": 1.0, + "content": "if it satisfies", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 281, + 384, + 316 + ], + "lines": [ + { + "bbox": [ + 226, + 281, + 384, + 316 + ], + "spans": [ + { + "bbox": [ + 226, + 281, + 384, + 316 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\nabla _ { A _ { 1 } } \\mathscr { L } = A _ { 2 } ^ { \\top } ( A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } ) \\boldsymbol { X } ^ { \\top } = \\mathbf { 0 } , } \\\\ { \\nabla _ { A _ { 2 } } \\mathscr { L } = ( A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } ) \\boldsymbol { X } ^ { \\top } A _ { 1 } ^ { \\top } = \\mathbf { 0 } . } \\end{array}", + "type": "interline_equation", + "image_path": "05d1c5469c097bbaacea8823a918440157428158e12be62a1e3c6cc350db865d.jpg" + } + ] + } + ], + "index": 11.5, + "virtual_lines": [ + { + "bbox": [ + 226, + 281, + 384, + 298.5 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 226, + 298.5, + 384, + 316.0 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 319, + 230, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 317, + 231, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 317, + 231, + 333 + ], + "score": 1.0, + "content": "We first prove eqs. (1) and (2).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 334, + 503, + 347 + ], + "lines": [ + { + "bbox": [ + 104, + 332, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 104, + 332, + 170, + 348 + ], + "score": 1.0, + "content": "Lemma 1. Let", + "type": "text" + }, + { + "bbox": [ + 170, + 334, + 209, + 347 + ], + "score": 0.92, + "content": "\\left( A _ { 2 } , A _ { 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 332, + 294, + 348 + ], + "score": 1.0, + "content": "be a critical point of", + "type": "text" + }, + { + "bbox": [ + 294, + 335, + 302, + 345 + ], + "score": 0.66, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 332, + 425, + 348 + ], + "score": 1.0, + "content": ". Then it must satisfy, for some", + "type": "text" + }, + { + "bbox": [ + 426, + 334, + 481, + 346 + ], + "score": 0.93, + "content": "\\pmb { L } _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 332, + 505, + 348 + ], + "score": 1.0, + "content": ", that", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 351, + 406, + 385 + ], + "lines": [ + { + "bbox": [ + 205, + 351, + 406, + 385 + ], + "spans": [ + { + "bbox": [ + 205, + 351, + 406, + 385 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { A _ { 1 } = A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } + L _ { 1 } - A _ { 2 } ^ { \\dagger } A _ { 2 } L _ { 1 } X X ^ { \\dagger } , } \\\\ & { \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma . } \\end{array}", + "type": "interline_equation", + "image_path": "3704fea18c1e6769b2b1985a7ccc13b9a7bfd2961b03d285dc35161a62d56b79.jpg" + } + ] + } + ], + "index": 15.5, + "virtual_lines": [ + { + "bbox": [ + 205, + 351, + 406, + 368.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 205, + 368.0, + 406, + 385.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 395, + 426, + 408 + ], + "lines": [ + { + "bbox": [ + 106, + 395, + 427, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 173, + 409 + ], + "score": 1.0, + "content": "Proof of Lemma", + "type": "text" + }, + { + "bbox": [ + 174, + 397, + 179, + 406 + ], + "score": 0.5, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 395, + 211, + 409 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 211, + 396, + 250, + 408 + ], + "score": 0.93, + "content": "( A _ { 2 } , A _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 395, + 331, + 409 + ], + "score": 1.0, + "content": "is a critical point of", + "type": "text" + }, + { + "bbox": [ + 331, + 397, + 339, + 406 + ], + "score": 0.83, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 395, + 427, + 409 + ], + "score": 1.0, + "content": ", eq. (23) implies that", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "interline_equation", + "bbox": [ + 247, + 413, + 364, + 429 + ], + "lines": [ + { + "bbox": [ + 247, + 413, + 364, + 429 + ], + "spans": [ + { + "bbox": [ + 247, + 413, + 364, + 429 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\pmb { A } _ { 2 } ^ { \\top } \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } = \\pmb { A } _ { 2 } ^ { \\top } \\pmb { Y } \\pmb { X } ^ { \\top } . } \\end{array}", + "type": "interline_equation", + "image_path": "70ab4fe837c4dd1afaec0b928a7179be84996f4f6b938bdcfe3685331dd8ad30.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 247, + 413, + 364, + 429 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 434, + 505, + 457 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 506, + 448 + ], + "score": 1.0, + "content": "Applying the vectorizing operator on both sides of the above equation and use the property in", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 446, + 213, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 213, + 457 + ], + "score": 1.0, + "content": "eq. (18), we conclude that", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "interline_equation", + "bbox": [ + 209, + 462, + 401, + 478 + ], + "lines": [ + { + "bbox": [ + 209, + 462, + 401, + 478 + ], + "spans": [ + { + "bbox": [ + 209, + 462, + 401, + 478 + ], + "score": 0.9, + "content": "( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) \\mathrm { v e c } ( A _ { 1 } ) = ( X \\otimes A _ { 2 } ^ { \\top } ) \\mathrm { v e c } ( Y ) .", + "type": "interline_equation", + "image_path": "505b51c354c3569f3473e1ec727536c49c20c8df2f2702cb37b3dd44617b4057.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 209, + 462, + 401, + 478 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 483, + 504, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 132, + 496 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 132, + 484, + 168, + 496 + ], + "score": 0.89, + "content": "\\mathrm { v e c } ( A _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "is a solution of the above linear equation, it must take the form of the solution of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 492, + 319, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 223, + 508 + ], + "score": 1.0, + "content": "linear systems, i.e., for some", + "type": "text" + }, + { + "bbox": [ + 223, + 494, + 279, + 506 + ], + "score": 0.93, + "content": "L _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 492, + 319, + 508 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 510, + 507, + 588 + ], + "lines": [ + { + "bbox": [ + 111, + 510, + 507, + 588 + ], + "spans": [ + { + "bbox": [ + 111, + 510, + 507, + 588 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\mathrm { ~ \\% c c } ( A _ { 1 } ) = ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } ( X \\otimes A _ { 2 } ^ { \\top } ) \\mathrm { v e c } ( Y ) + [ I - ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ] \\mathrm { v e c } ( L _ { 1 } ) } \\\\ & { \\overset { ( i ) } { = } \\left( ( X X ^ { \\top } ) ^ { \\dagger } X \\otimes ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } \\right) \\mathrm { v e c } ( Y ) + [ I - ( X X ^ { \\top } ) ^ { \\dagger } X X ^ { \\top } \\otimes ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } A _ { 2 } ] \\mathrm { v e c } ( L _ { 1 } ) } \\\\ & { = \\mathrm { v e c } \\big ( ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } Y X ^ { \\top } ( X X ^ { \\top } ) ^ { \\dagger } + L _ { 1 } - ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } A _ { 2 } L _ { 1 } X X X ^ { \\top } ( X X ^ { \\top } ) ^ { \\dagger } \\big ) } \\\\ & { \\overset { ( i i ) } { = } \\mathrm { v e c } \\Big ( A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } + L _ { 1 } - A _ { 2 } ^ { \\dagger } A _ { 2 } L _ { 1 } X X ^ { \\dagger } \\Big ) } \\end{array}", + "type": "interline_equation", + "image_path": "f5dfe18301a4f79a569e143be2b5de426c1ae0b0d3b51c7d70a07f1612dde159.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 111, + 510, + 507, + 536.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 111, + 536.0, + 507, + 562.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 111, + 562.0, + 507, + 588.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 592, + 504, + 615 + ], + "lines": [ + { + "bbox": [ + 106, + 592, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 505, + 606 + ], + "score": 1.0, + "content": "where (i) uses eqs. (19) and (20) and (ii) uses eq. (21). Then, eq. (25) follows by reshaping the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 604, + 190, + 616 + ], + "spans": [ + { + "bbox": [ + 106, + 604, + 190, + 616 + ], + "score": 1.0, + "content": "vector into a matrix.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 108, + 620, + 502, + 643 + ], + "lines": [ + { + "bbox": [ + 106, + 619, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 619, + 355, + 634 + ], + "score": 1.0, + "content": "Next we prove eq. (26). Multiplying both sides of eq. (25) by", + "type": "text" + }, + { + "bbox": [ + 355, + 621, + 369, + 632 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 619, + 443, + 634 + ], + "score": 1.0, + "content": "on the left and by", + "type": "text" + }, + { + "bbox": [ + 444, + 621, + 455, + 631 + ], + "score": 0.84, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 619, + 505, + 634 + ], + "score": 1.0, + "content": "on the right", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 631, + 245, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 245, + 645 + ], + "score": 1.0, + "content": "and then using eq. (22), we obtain", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "interline_equation", + "bbox": [ + 206, + 648, + 405, + 666 + ], + "lines": [ + { + "bbox": [ + 206, + 648, + 405, + 666 + ], + "spans": [ + { + "bbox": [ + 206, + 648, + 405, + 666 + ], + "score": 0.92, + "content": "A _ { 2 } A _ { 1 } X = A _ { 2 } A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } X = { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { 2 } ) } Y X ^ { \\dagger } X .", + "type": "interline_equation", + "image_path": "ab9e3ca891720e4e407ea8d91342b46367341eefcde0876b83b4d1532874b3d9.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 206, + 648, + 405, + 666 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 671, + 507, + 695 + ], + "lines": [ + { + "bbox": [ + 106, + 671, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 294, + 685 + ], + "score": 1.0, + "content": "Also, multiplying both sides of eq. (24) by", + "type": "text" + }, + { + "bbox": [ + 295, + 671, + 309, + 685 + ], + "score": 0.91, + "content": "A _ { 2 } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 671, + 413, + 685 + ], + "score": 1.0, + "content": "on the right yields that", + "type": "text" + }, + { + "bbox": [ + 414, + 671, + 505, + 685 + ], + "score": 0.89, + "content": "A _ { \\mathrm { 2 } } A _ { \\mathrm { 1 } } X X ^ { \\top } A _ { \\mathrm { 1 } } ^ { \\top } A _ { \\mathrm { 2 } } ^ { \\top } =", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 107, + 683, + 492, + 696 + ], + "spans": [ + { + "bbox": [ + 107, + 683, + 156, + 695 + ], + "score": 0.92, + "content": "Y X ^ { \\top } A _ { 1 } ^ { \\top } A _ { 2 } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 683, + 371, + 696 + ], + "score": 1.0, + "content": ". This equation, together with the above expression of", + "type": "text" + }, + { + "bbox": [ + 372, + 684, + 408, + 695 + ], + "score": 0.92, + "content": "\\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 683, + 492, + 696 + ], + "score": 1.0, + "content": ", further implies that", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 701, + 376, + 716 + ], + "lines": [ + { + "bbox": [ + 236, + 701, + 376, + 716 + ], + "spans": [ + { + "bbox": [ + 236, + 701, + 376, + 716 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } .", + "type": "interline_equation", + "image_path": "6aff9b13e25e391318a13ad25f10684ad5891bc89e3ca6d4817289ce615ad234.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 236, + 701, + 376, + 716 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 720, + 485, + 734 + ], + "lines": [ + { + "bbox": [ + 104, + 718, + 486, + 736 + ], + "spans": [ + { + "bbox": [ + 104, + 718, + 147, + 736 + ], + "score": 1.0, + "content": "Note that", + "type": "text" + }, + { + "bbox": [ + 147, + 720, + 226, + 734 + ], + "score": 0.93, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 718, + 380, + 736 + ], + "score": 1.0, + "content": "is symmetric. Thus, we conclude that", + "type": "text" + }, + { + "bbox": [ + 380, + 721, + 482, + 734 + ], + "score": 0.93, + "content": "\\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 718, + 486, + 736 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + } + ], + "page_idx": 11, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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": [ + 495, + 721, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 496, + 723, + 504, + 730 + ], + "spans": [ + { + "bbox": [ + 496, + 723, + 504, + 730 + ], + "score": 0.998, + "content": "□", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 78, + 265, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 266, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 266, + 96 + ], + "score": 1.0, + "content": "Supplementary Materials", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 108, + 110, + 222, + 123 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 224, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 224, + 125 + ], + "score": 1.0, + "content": "PROOF OF THEOREM 1", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 110, + 224, + 125 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 136, + 504, + 170 + ], + "lines": [ + { + "bbox": [ + 105, + 135, + 504, + 149 + ], + "spans": [ + { + "bbox": [ + 105, + 135, + 211, + 149 + ], + "score": 1.0, + "content": "Notations: For any matrix", + "type": "text" + }, + { + "bbox": [ + 211, + 137, + 225, + 146 + ], + "score": 0.8, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 135, + 257, + 149 + ], + "score": 1.0, + "content": ", denote", + "type": "text" + }, + { + "bbox": [ + 257, + 136, + 292, + 148 + ], + "score": 0.82, + "content": "\\mathrm { v e c } ( M )", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 135, + 504, + 149 + ], + "score": 1.0, + "content": "as the column vector formed by stacking its columns.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 147, + 504, + 159 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 245, + 159 + ], + "score": 1.0, + "content": "Denote the Kronecker product as “", + "type": "text" + }, + { + "bbox": [ + 245, + 148, + 256, + 158 + ], + "score": 0.57, + "content": "\\otimes ^ { \\bullet }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 147, + 504, + 159 + ], + "score": 1.0, + "content": ". Then, the following useful relationships hold for any dimen-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 158, + 271, + 170 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 208, + 170 + ], + "score": 1.0, + "content": "sion compatible matrices", + "type": "text" + }, + { + "bbox": [ + 209, + 158, + 266, + 170 + ], + "score": 0.92, + "content": "M , U , V , W", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 158, + 271, + 170 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 135, + 504, + 170 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 223, + 174, + 386, + 253 + ], + "lines": [ + { + "bbox": [ + 223, + 174, + 386, + 253 + ], + "spans": [ + { + "bbox": [ + 223, + 174, + 386, + 253 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathrm { v e c } ( U M V ) = ( V ^ { \\top } \\otimes U ) \\mathrm { v e c } ( M ) , } \\\\ & { ( U \\otimes V ) ^ { \\dagger } = U ^ { \\dagger } \\otimes V ^ { \\dagger } , } \\\\ & { ( M \\otimes W ) ( U \\otimes V ) = ( M U ) \\otimes ( W V ) , } \\\\ & { ( M ^ { \\top } M ) ^ { \\dagger } M ^ { \\top } = M ^ { \\top } ( M M ^ { \\top } ) ^ { \\dagger } = M ^ { \\dagger } , } \\\\ & { M M ^ { \\dagger } M = M , M ^ { \\dagger } M M ^ { \\dagger } = M ^ { \\dagger } . } \\end{array}", + "type": "interline_equation", + "image_path": "b47babcc8c7986bb42c583d0db1821956e7d7d56831ea4834b770aadea574872.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 223, + 174, + 386, + 189.8 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 223, + 189.8, + 386, + 205.60000000000002 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 223, + 205.60000000000002, + 386, + 221.40000000000003 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 223, + 221.40000000000003, + 386, + 237.20000000000005 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 223, + 237.20000000000005, + 386, + 253.00000000000006 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 264, + 363, + 277 + ], + "lines": [ + { + "bbox": [ + 105, + 263, + 363, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 182, + 278 + ], + "score": 1.0, + "content": "Recall that a point", + "type": "text" + }, + { + "bbox": [ + 182, + 265, + 221, + 276 + ], + "score": 0.93, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 263, + 303, + 278 + ], + "score": 1.0, + "content": "is a critical point of", + "type": "text" + }, + { + "bbox": [ + 303, + 265, + 311, + 275 + ], + "score": 0.85, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 263, + 363, + 278 + ], + "score": 1.0, + "content": "if it satisfies", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 263, + 363, + 278 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 226, + 281, + 384, + 316 + ], + "lines": [ + { + "bbox": [ + 226, + 281, + 384, + 316 + ], + "spans": [ + { + "bbox": [ + 226, + 281, + 384, + 316 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\nabla _ { A _ { 1 } } \\mathscr { L } = A _ { 2 } ^ { \\top } ( A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } ) \\boldsymbol { X } ^ { \\top } = \\mathbf { 0 } , } \\\\ { \\nabla _ { A _ { 2 } } \\mathscr { L } = ( A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } ) \\boldsymbol { X } ^ { \\top } A _ { 1 } ^ { \\top } = \\mathbf { 0 } . } \\end{array}", + "type": "interline_equation", + "image_path": "05d1c5469c097bbaacea8823a918440157428158e12be62a1e3c6cc350db865d.jpg" + } + ] + } + ], + "index": 11.5, + "virtual_lines": [ + { + "bbox": [ + 226, + 281, + 384, + 298.5 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 226, + 298.5, + 384, + 316.0 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 319, + 230, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 317, + 231, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 317, + 231, + 333 + ], + "score": 1.0, + "content": "We first prove eqs. (1) and (2).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 317, + 231, + 333 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 334, + 503, + 347 + ], + "lines": [ + { + "bbox": [ + 104, + 332, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 104, + 332, + 170, + 348 + ], + "score": 1.0, + "content": "Lemma 1. Let", + "type": "text" + }, + { + "bbox": [ + 170, + 334, + 209, + 347 + ], + "score": 0.92, + "content": "\\left( A _ { 2 } , A _ { 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 332, + 294, + 348 + ], + "score": 1.0, + "content": "be a critical point of", + "type": "text" + }, + { + "bbox": [ + 294, + 335, + 302, + 345 + ], + "score": 0.66, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 332, + 425, + 348 + ], + "score": 1.0, + "content": ". Then it must satisfy, for some", + "type": "text" + }, + { + "bbox": [ + 426, + 334, + 481, + 346 + ], + "score": 0.93, + "content": "\\pmb { L } _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 332, + 505, + 348 + ], + "score": 1.0, + "content": ", that", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 104, + 332, + 505, + 348 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 351, + 406, + 385 + ], + "lines": [ + { + "bbox": [ + 205, + 351, + 406, + 385 + ], + "spans": [ + { + "bbox": [ + 205, + 351, + 406, + 385 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { A _ { 1 } = A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } + L _ { 1 } - A _ { 2 } ^ { \\dagger } A _ { 2 } L _ { 1 } X X ^ { \\dagger } , } \\\\ & { \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma . } \\end{array}", + "type": "interline_equation", + "image_path": "3704fea18c1e6769b2b1985a7ccc13b9a7bfd2961b03d285dc35161a62d56b79.jpg" + } + ] + } + ], + "index": 15.5, + "virtual_lines": [ + { + "bbox": [ + 205, + 351, + 406, + 368.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 205, + 368.0, + 406, + 385.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 395, + 426, + 408 + ], + "lines": [ + { + "bbox": [ + 106, + 395, + 427, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 395, + 173, + 409 + ], + "score": 1.0, + "content": "Proof of Lemma", + "type": "text" + }, + { + "bbox": [ + 174, + 397, + 179, + 406 + ], + "score": 0.5, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 395, + 211, + 409 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 211, + 396, + 250, + 408 + ], + "score": 0.93, + "content": "( A _ { 2 } , A _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 395, + 331, + 409 + ], + "score": 1.0, + "content": "is a critical point of", + "type": "text" + }, + { + "bbox": [ + 331, + 397, + 339, + 406 + ], + "score": 0.83, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 395, + 427, + 409 + ], + "score": 1.0, + "content": ", eq. (23) implies that", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 395, + 427, + 409 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 247, + 413, + 364, + 429 + ], + "lines": [ + { + "bbox": [ + 247, + 413, + 364, + 429 + ], + "spans": [ + { + "bbox": [ + 247, + 413, + 364, + 429 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\pmb { A } _ { 2 } ^ { \\top } \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } = \\pmb { A } _ { 2 } ^ { \\top } \\pmb { Y } \\pmb { X } ^ { \\top } . } \\end{array}", + "type": "interline_equation", + "image_path": "70ab4fe837c4dd1afaec0b928a7179be84996f4f6b938bdcfe3685331dd8ad30.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 247, + 413, + 364, + 429 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 434, + 505, + 457 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 506, + 448 + ], + "score": 1.0, + "content": "Applying the vectorizing operator on both sides of the above equation and use the property in", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 446, + 213, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 213, + 457 + ], + "score": 1.0, + "content": "eq. (18), we conclude that", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 433, + 506, + 457 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 209, + 462, + 401, + 478 + ], + "lines": [ + { + "bbox": [ + 209, + 462, + 401, + 478 + ], + "spans": [ + { + "bbox": [ + 209, + 462, + 401, + 478 + ], + "score": 0.9, + "content": "( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) \\mathrm { v e c } ( A _ { 1 } ) = ( X \\otimes A _ { 2 } ^ { \\top } ) \\mathrm { v e c } ( Y ) .", + "type": "interline_equation", + "image_path": "505b51c354c3569f3473e1ec727536c49c20c8df2f2702cb37b3dd44617b4057.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 209, + 462, + 401, + 478 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 483, + 504, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 132, + 496 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 132, + 484, + 168, + 496 + ], + "score": 0.89, + "content": "\\mathrm { v e c } ( A _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "is a solution of the above linear equation, it must take the form of the solution of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 492, + 319, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 223, + 508 + ], + "score": 1.0, + "content": "linear systems, i.e., for some", + "type": "text" + }, + { + "bbox": [ + 223, + 494, + 279, + 506 + ], + "score": 0.93, + "content": "L _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 492, + 319, + 508 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 483, + 505, + 508 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 510, + 507, + 588 + ], + "lines": [ + { + "bbox": [ + 111, + 510, + 507, + 588 + ], + "spans": [ + { + "bbox": [ + 111, + 510, + 507, + 588 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\mathrm { ~ \\% c c } ( A _ { 1 } ) = ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } ( X \\otimes A _ { 2 } ^ { \\top } ) \\mathrm { v e c } ( Y ) + [ I - ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ] \\mathrm { v e c } ( L _ { 1 } ) } \\\\ & { \\overset { ( i ) } { = } \\left( ( X X ^ { \\top } ) ^ { \\dagger } X \\otimes ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } \\right) \\mathrm { v e c } ( Y ) + [ I - ( X X ^ { \\top } ) ^ { \\dagger } X X ^ { \\top } \\otimes ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } A _ { 2 } ] \\mathrm { v e c } ( L _ { 1 } ) } \\\\ & { = \\mathrm { v e c } \\big ( ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } Y X ^ { \\top } ( X X ^ { \\top } ) ^ { \\dagger } + L _ { 1 } - ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } A _ { 2 } L _ { 1 } X X X ^ { \\top } ( X X ^ { \\top } ) ^ { \\dagger } \\big ) } \\\\ & { \\overset { ( i i ) } { = } \\mathrm { v e c } \\Big ( A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } + L _ { 1 } - A _ { 2 } ^ { \\dagger } A _ { 2 } L _ { 1 } X X ^ { \\dagger } \\Big ) } \\end{array}", + "type": "interline_equation", + "image_path": "f5dfe18301a4f79a569e143be2b5de426c1ae0b0d3b51c7d70a07f1612dde159.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 111, + 510, + 507, + 536.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 111, + 536.0, + 507, + 562.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 111, + 562.0, + 507, + 588.0 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 592, + 504, + 615 + ], + "lines": [ + { + "bbox": [ + 106, + 592, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 505, + 606 + ], + "score": 1.0, + "content": "where (i) uses eqs. (19) and (20) and (ii) uses eq. (21). Then, eq. (25) follows by reshaping the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 604, + 190, + 616 + ], + "spans": [ + { + "bbox": [ + 106, + 604, + 190, + 616 + ], + "score": 1.0, + "content": "vector into a matrix.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 106, + 592, + 505, + 616 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 620, + 502, + 643 + ], + "lines": [ + { + "bbox": [ + 106, + 619, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 619, + 355, + 634 + ], + "score": 1.0, + "content": "Next we prove eq. (26). Multiplying both sides of eq. (25) by", + "type": "text" + }, + { + "bbox": [ + 355, + 621, + 369, + 632 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 619, + 443, + 634 + ], + "score": 1.0, + "content": "on the left and by", + "type": "text" + }, + { + "bbox": [ + 444, + 621, + 455, + 631 + ], + "score": 0.84, + "content": "\\boldsymbol { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 619, + 505, + 634 + ], + "score": 1.0, + "content": "on the right", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 631, + 245, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 245, + 645 + ], + "score": 1.0, + "content": "and then using eq. (22), we obtain", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 619, + 505, + 645 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 206, + 648, + 405, + 666 + ], + "lines": [ + { + "bbox": [ + 206, + 648, + 405, + 666 + ], + "spans": [ + { + "bbox": [ + 206, + 648, + 405, + 666 + ], + "score": 0.92, + "content": "A _ { 2 } A _ { 1 } X = A _ { 2 } A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } X = { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { 2 } ) } Y X ^ { \\dagger } X .", + "type": "interline_equation", + "image_path": "ab9e3ca891720e4e407ea8d91342b46367341eefcde0876b83b4d1532874b3d9.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 206, + 648, + 405, + 666 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 671, + 507, + 695 + ], + "lines": [ + { + "bbox": [ + 106, + 671, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 294, + 685 + ], + "score": 1.0, + "content": "Also, multiplying both sides of eq. (24) by", + "type": "text" + }, + { + "bbox": [ + 295, + 671, + 309, + 685 + ], + "score": 0.91, + "content": "A _ { 2 } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 671, + 413, + 685 + ], + "score": 1.0, + "content": "on the right yields that", + "type": "text" + }, + { + "bbox": [ + 414, + 671, + 505, + 685 + ], + "score": 0.89, + "content": "A _ { \\mathrm { 2 } } A _ { \\mathrm { 1 } } X X ^ { \\top } A _ { \\mathrm { 1 } } ^ { \\top } A _ { \\mathrm { 2 } } ^ { \\top } =", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 107, + 683, + 492, + 696 + ], + "spans": [ + { + "bbox": [ + 107, + 683, + 156, + 695 + ], + "score": 0.92, + "content": "Y X ^ { \\top } A _ { 1 } ^ { \\top } A _ { 2 } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 683, + 371, + 696 + ], + "score": 1.0, + "content": ". This equation, together with the above expression of", + "type": "text" + }, + { + "bbox": [ + 372, + 684, + 408, + 695 + ], + "score": 0.92, + "content": "\\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 683, + 492, + 696 + ], + "score": 1.0, + "content": ", further implies that", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 106, + 671, + 505, + 696 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 701, + 376, + 716 + ], + "lines": [ + { + "bbox": [ + 236, + 701, + 376, + 716 + ], + "spans": [ + { + "bbox": [ + 236, + 701, + 376, + 716 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } .", + "type": "interline_equation", + "image_path": "6aff9b13e25e391318a13ad25f10684ad5891bc89e3ca6d4817289ce615ad234.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 236, + 701, + 376, + 716 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 720, + 485, + 734 + ], + "lines": [ + { + "bbox": [ + 104, + 718, + 486, + 736 + ], + "spans": [ + { + "bbox": [ + 104, + 718, + 147, + 736 + ], + "score": 1.0, + "content": "Note that", + "type": "text" + }, + { + "bbox": [ + 147, + 720, + 226, + 734 + ], + "score": 0.93, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 718, + 380, + 736 + ], + "score": 1.0, + "content": "is symmetric. Thus, we conclude that", + "type": "text" + }, + { + "bbox": [ + 380, + 721, + 482, + 734 + ], + "score": 0.93, + "content": "\\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 718, + 486, + 736 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 104, + 718, + 486, + 736 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 128 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 504, + 94 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 217, + 94 + ], + "score": 1.0, + "content": "Next, we derive the form of", + "type": "text" + }, + { + "bbox": [ + 217, + 83, + 231, + 93 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 81, + 412, + 94 + ], + "score": 1.0, + "content": ". Recall the full singular value decomposition", + "type": "text" + }, + { + "bbox": [ + 412, + 82, + 465, + 93 + ], + "score": 0.91, + "content": "\\pmb { \\Sigma } = \\pmb { U } \\pmb { \\Lambda } \\pmb { U } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 81, + 495, + 94 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 495, + 83, + 504, + 92 + ], + "score": 0.64, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 104, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 104, + 92, + 301, + 107 + ], + "score": 1.0, + "content": "is a diagonal matrix with distinct singular values", + "type": "text" + }, + { + "bbox": [ + 301, + 94, + 379, + 105 + ], + "score": 0.91, + "content": "\\sigma _ { 1 } > . . . > \\sigma _ { r } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 92, + 451, + 107 + ], + "score": 1.0, + "content": "and multiplicities", + "type": "text" + }, + { + "bbox": [ + 452, + 96, + 501, + 105 + ], + "score": 0.89, + "content": "m _ { 1 } , \\ldots , m _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 92, + 506, + 107 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 282, + 117 + ], + "score": 1.0, + "content": "respectively. We also assume that there are", + "type": "text" + }, + { + "bbox": [ + 282, + 106, + 293, + 115 + ], + "score": 0.79, + "content": "\\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 105, + 432, + 117 + ], + "score": 1.0, + "content": "number of zero singular values in", + "type": "text" + }, + { + "bbox": [ + 432, + 105, + 441, + 114 + ], + "score": 0.75, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 105, + 506, + 117 + ], + "score": 1.0, + "content": ". Using the fact", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 113, + 401, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 113, + 125, + 131 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 126, + 115, + 242, + 129 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { P } _ { \\mathrm { c o l } ( \\dot { A } _ { 2 } ) } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 113, + 401, + 131 + ], + "score": 1.0, + "content": ", the last equality in eq. (26) reduces to", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "interline_equation", + "bbox": [ + 243, + 137, + 367, + 151 + ], + "lines": [ + { + "bbox": [ + 243, + 137, + 367, + 151 + ], + "spans": [ + { + "bbox": [ + 243, + 137, + 367, + 151 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathbf { \\Delta } \\Lambda \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\mathbf { A } _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\mathbf { A } _ { 2 } ) } \\mathbf { \\Lambda } . } \\end{array}", + "type": "interline_equation", + "image_path": "abbd1dc37332e10121c319b7e63fb8d412b2091d1ab6a6de49d0a78d3945bab5.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 243, + 137, + 367, + 151 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 157, + 506, + 304 + ], + "lines": [ + { + "bbox": [ + 104, + 156, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 104, + 156, + 314, + 172 + ], + "score": 1.0, + "content": "By the multiplicity pattern of the singular values in", + "type": "text" + }, + { + "bbox": [ + 314, + 159, + 323, + 168 + ], + "score": 0.66, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 156, + 329, + 172 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 329, + 158, + 372, + 171 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 156, + 506, + 172 + ], + "score": 1.0, + "content": "must be block diagonal. Specif-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 169, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 104, + 169, + 189, + 185 + ], + "score": 1.0, + "content": "ically, we can write", + "type": "text" + }, + { + "bbox": [ + 190, + 171, + 337, + 185 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } = \\mathrm { d i a g } ( \\mathcal { P } _ { 1 } , \\dots , \\mathcal { P } _ { r } , \\overline { { \\mathcal { P } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 169, + 369, + 185 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 369, + 171, + 429, + 183 + ], + "score": 0.91, + "content": "\\mathcal { P } _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times m _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 169, + 449, + 185 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 450, + 170, + 501, + 182 + ], + "score": 0.93, + "content": "\\overline { { \\mathcal { P } } } \\in \\mathbb { R } ^ { \\bar { n } \\times \\bar { m } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 169, + 506, + 185 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 181, + 503, + 202 + ], + "spans": [ + { + "bbox": [ + 104, + 181, + 154, + 202 + ], + "score": 1.0, + "content": "Also, since", + "type": "text" + }, + { + "bbox": [ + 154, + 185, + 198, + 198 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 181, + 261, + 202 + ], + "score": 1.0, + "content": "is a projection,", + "type": "text" + }, + { + "bbox": [ + 262, + 186, + 291, + 196 + ], + "score": 0.65, + "content": "\\mathcal { P } _ { 1 } , \\ldots .", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 181, + 297, + 202 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 297, + 185, + 309, + 196 + ], + "score": 0.74, + "content": "\\mathcal { P } _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 181, + 313, + 202 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 313, + 185, + 323, + 195 + ], + "score": 0.67, + "content": "\\overline { { \\mathcal { P } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 181, + 459, + 202 + ], + "score": 1.0, + "content": "must all be projections. Note that", + "type": "text" + }, + { + "bbox": [ + 459, + 185, + 503, + 199 + ], + "score": 0.91, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 198, + 506, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 143, + 212 + ], + "score": 1.0, + "content": "has rank", + "type": "text" + }, + { + "bbox": [ + 143, + 199, + 185, + 210 + ], + "score": 0.54, + "content": "\\operatorname { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 198, + 260, + 212 + ], + "score": 1.0, + "content": ", and suppose that", + "type": "text" + }, + { + "bbox": [ + 261, + 199, + 290, + 210 + ], + "score": 0.64, + "content": "\\mathcal { P } _ { 1 } , \\ldots .", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 198, + 296, + 212 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 296, + 199, + 308, + 210 + ], + "score": 0.74, + "content": "\\mathcal { P } _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 198, + 312, + 212 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 313, + 198, + 322, + 209 + ], + "score": 0.77, + "content": "\\overline { { \\mathcal { P } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 198, + 370, + 212 + ], + "score": 1.0, + "content": "have ranks", + "type": "text" + }, + { + "bbox": [ + 370, + 200, + 422, + 210 + ], + "score": 0.88, + "content": "p _ { 1 } , \\ldots , p _ { r } , \\bar { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 198, + 506, + 212 + ], + "score": 1.0, + "content": ", respectively. Then,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 208, + 506, + 225 + ], + "spans": [ + { + "bbox": [ + 104, + 208, + 163, + 225 + ], + "score": 1.0, + "content": "we must have", + "type": "text" + }, + { + "bbox": [ + 163, + 211, + 198, + 221 + ], + "score": 0.91, + "content": "p _ { i } \\leq m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 208, + 213, + 225 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 214, + 210, + 263, + 221 + ], + "score": 0.69, + "content": "i = 1 , \\dots , r", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 208, + 267, + 225 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 267, + 210, + 295, + 221 + ], + "score": 0.75, + "content": "\\bar { p } \\leq \\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 208, + 313, + 225 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 314, + 210, + 419, + 222 + ], + "score": 0.88, + "content": "{ \\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( A _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 208, + 506, + 225 + ], + "score": 1.0, + "content": ". Also, note that each", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 220, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 104, + 220, + 231, + 236 + ], + "score": 1.0, + "content": "projection can be expressed as", + "type": "text" + }, + { + "bbox": [ + 232, + 222, + 281, + 235 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { i } = V _ { i } V _ { i } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 220, + 302, + 236 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 302, + 222, + 357, + 233 + ], + "score": 0.8, + "content": "V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 220, + 361, + 236 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 362, + 222, + 410, + 232 + ], + "score": 0.88, + "content": "\\overline { { V } } \\in \\mathbb { R } ^ { \\bar { n } \\times \\bar { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 220, + 506, + 236 + ], + "score": 1.0, + "content": "consisting of orthonor-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 234, + 506, + 250 + ], + "spans": [ + { + "bbox": [ + 104, + 234, + 249, + 250 + ], + "score": 1.0, + "content": "mal columns. Hence, we can write", + "type": "text" + }, + { + "bbox": [ + 249, + 234, + 330, + 249 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } = \\widehat { V } \\widehat { V } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 234, + 357, + 250 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 358, + 234, + 465, + 248 + ], + "score": 0.91, + "content": "\\widehat { V } = \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { V } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 234, + 506, + 250 + ], + "score": 1.0, + "content": ". We then", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 247, + 507, + 265 + ], + "spans": [ + { + "bbox": [ + 104, + 247, + 165, + 265 + ], + "score": 1.0, + "content": "conclude that", + "type": "text" + }, + { + "bbox": [ + 165, + 249, + 344, + 264 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top } = U \\widehat { V } \\widehat { V } ^ { \\top } U ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 247, + 376, + 265 + ], + "score": 1.0, + "content": ". Thus,", + "type": "text" + }, + { + "bbox": [ + 376, + 250, + 390, + 261 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 247, + 507, + 265 + ], + "score": 1.0, + "content": "has the same column space", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 262, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 104, + 262, + 117, + 278 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 118, + 262, + 137, + 275 + ], + "score": 0.9, + "content": "\\boldsymbol { U } \\widehat { \\boldsymbol { V } }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 262, + 307, + 278 + ], + "score": 1.0, + "content": ", and there must exist an invertible matrix", + "type": "text" + }, + { + "bbox": [ + 307, + 264, + 361, + 275 + ], + "score": 0.9, + "content": "C \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 262, + 402, + 278 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 402, + 262, + 474, + 277 + ], + "score": 0.93, + "content": "{ \\cal A } _ { 2 } = U [ \\widehat { V } , { \\bf 0 } ] C", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 262, + 506, + 278 + ], + "score": 1.0, + "content": ", where", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 274, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 203, + 289 + ], + "score": 0.89, + "content": "\\mathbf { 0 } \\in \\mathbb { R } ^ { d _ { 2 } \\times ( d _ { 1 } - \\operatorname { r a n k } ( A _ { 2 } ) ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 274, + 317, + 291 + ], + "score": 1.0, + "content": "is a zero matrix. Denoting", + "type": "text" + }, + { + "bbox": [ + 317, + 276, + 367, + 290 + ], + "score": 0.93, + "content": "V = [ \\widehat { V } , \\mathbf { 0 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 274, + 444, + 291 + ], + "score": 1.0, + "content": ", we conclude that", + "type": "text" + }, + { + "bbox": [ + 444, + 278, + 501, + 289 + ], + "score": 0.9, + "content": "A _ { 2 } = U V C", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 274, + 506, + 291 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 288, + 419, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 170, + 304 + ], + "score": 1.0, + "content": "Then, plugging", + "type": "text" + }, + { + "bbox": [ + 170, + 289, + 243, + 303 + ], + "score": 0.93, + "content": "\\pmb { A } _ { 2 } ^ { \\dagger } = \\pmb { C } ^ { - 1 } \\pmb { V } ^ { \\top } \\pmb { U } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 288, + 401, + 304 + ], + "score": 1.0, + "content": "into eq. (25) yields the desired form of", + "type": "text" + }, + { + "bbox": [ + 401, + 291, + 415, + 302 + ], + "score": 0.89, + "content": "\\pmb { A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 288, + 419, + 304 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 309, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 105, + 308, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 396, + 322 + ], + "score": 1.0, + "content": "We now prove eq. (3). Note that the above proof is based on the equations", + "type": "text" + }, + { + "bbox": [ + 396, + 309, + 442, + 321 + ], + "score": 0.52, + "content": "\\nabla _ { A _ { 1 } } \\mathcal { L } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 308, + 446, + 322 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 446, + 308, + 506, + 321 + ], + "score": 0.57, + "content": "( \\nabla _ { A _ { 2 } } \\mathcal { L } ) A _ { 2 } ^ { \\top } =", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 320, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 203, + 333 + ], + "score": 1.0, + "content": "0. Hence, the forms of", + "type": "text" + }, + { + "bbox": [ + 203, + 320, + 234, + 331 + ], + "score": 0.84, + "content": "A _ { 1 } , A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 320, + 403, + 333 + ], + "score": 1.0, + "content": "in eqs. (1) and (2) need to further satisfy", + "type": "text" + }, + { + "bbox": [ + 403, + 321, + 451, + 331 + ], + "score": 0.88, + "content": "\\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 320, + 505, + 333 + ], + "score": 1.0, + "content": ". By eq. (27)", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 330, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 104, + 330, + 174, + 344 + ], + "score": 1.0, + "content": "and the form of", + "type": "text" + }, + { + "bbox": [ + 174, + 331, + 189, + 342 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 330, + 254, + 344 + ], + "score": 1.0, + "content": ", we obtain that", + "type": "text" + }, + { + "bbox": [ + 255, + 331, + 478, + 344 + ], + "score": 0.9, + "content": "A _ { 2 } A _ { 1 } { \\cal X } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } { \\cal Y } { \\cal X } ^ { \\dagger } { \\cal X } = { \\cal U } { \\cal V } ( { \\bar { U } } { \\cal V } ) ^ { \\top } { \\cal Y } { \\cal X } ^ { \\dagger } { \\cal X }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 330, + 506, + 344 + ], + "score": 1.0, + "content": ". This", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 342, + 364, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 257, + 355 + ], + "score": 1.0, + "content": "expression, together with the form of", + "type": "text" + }, + { + "bbox": [ + 257, + 343, + 271, + 353 + ], + "score": 0.89, + "content": "A _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 342, + 364, + 355 + ], + "score": 1.0, + "content": "in eq. (1), implies that", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "interline_equation", + "bbox": [ + 132, + 359, + 479, + 468 + ], + "lines": [ + { + "bbox": [ + 132, + 359, + 479, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 359, + 479, + 468 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { A _ { 2 } A _ { 1 } X X ^ { \\top } A _ { 1 } ^ { \\top } = U V ( U V ) ^ { \\top } Y X ^ { \\top } X X ^ { \\top } A _ { 1 } ^ { \\top } } \\\\ & { \\overset { ( i ) } { = } U V ( U V ) ^ { \\top } Y X ^ { \\top } A _ { 1 } ^ { \\top } } \\\\ & { \\quad \\quad = U V ( U V ) ^ { \\top } \\Sigma U V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } } \\\\ & { \\quad \\quad \\quad - U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } } \\\\ & { \\quad \\quad = U V V ^ { \\top } \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) } \\\\ & { \\overset { ( i i ) } { = } U \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) , } \\end{array}", + "type": "interline_equation", + "image_path": "8ffe76a591b8c1816c45fe9ed3639db7abeb7780e050022cb4be63194369c552.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 132, + 359, + 479, + 395.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 132, + 395.3333333333333, + 479, + 431.66666666666663 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 132, + 431.66666666666663, + 479, + 467.99999999999994 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 473, + 505, + 508 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 214, + 488 + ], + "score": 1.0, + "content": "where (i) uses the fact that", + "type": "text" + }, + { + "bbox": [ + 215, + 474, + 281, + 486 + ], + "score": 0.92, + "content": "X ^ { \\dag } X X ^ { \\dag } = X ^ { \\dag }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 473, + 449, + 488 + ], + "score": 1.0, + "content": ", (ii) uses the fact that the block pattern of", + "type": "text" + }, + { + "bbox": [ + 450, + 475, + 459, + 485 + ], + "score": 0.84, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 473, + 505, + 488 + ], + "score": 1.0, + "content": "is compat-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 485, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 340, + 498 + ], + "score": 1.0, + "content": "ible with the multiplicity pattern of the singular values in", + "type": "text" + }, + { + "bbox": [ + 340, + 487, + 349, + 496 + ], + "score": 0.8, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 486, + 397, + 498 + ], + "score": 1.0, + "content": ", and hence", + "type": "text" + }, + { + "bbox": [ + 397, + 485, + 470, + 496 + ], + "score": 0.91, + "content": "V \\mathbf { \\hat { V } } ^ { \\top } \\mathbf { A } V = \\mathbf { A } V", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 486, + 505, + 498 + ], + "score": 1.0, + "content": ". On the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 497, + 232, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 232, + 509 + ], + "score": 1.0, + "content": "other hand, we also obtain that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 513, + 430, + 549 + ], + "lines": [ + { + "bbox": [ + 180, + 513, + 430, + 549 + ], + "spans": [ + { + "bbox": [ + 180, + 513, + 430, + 549 + ], + "score": 0.91, + "content": "\\begin{array} { r } { Y X ^ { \\top } A _ { 1 } ^ { \\top } = \\Sigma U V ( C ^ { \\top } ) ^ { - 1 } + Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) } \\\\ { = U \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "753117343142fd752eaa24840906e65bc22973b04d450e371bc3e2c85ff9eba8.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 180, + 513, + 430, + 525.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 180, + 525.0, + 430, + 537.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 180, + 537.0, + 430, + 549.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 554, + 326, + 567 + ], + "lines": [ + { + "bbox": [ + 106, + 553, + 327, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 553, + 170, + 568 + ], + "score": 1.0, + "content": "Thus, to satisfy", + "type": "text" + }, + { + "bbox": [ + 171, + 555, + 217, + 567 + ], + "score": 0.92, + "content": "\\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 553, + 327, + 568 + ], + "score": 1.0, + "content": "in eq. (24), we require that", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "interline_equation", + "bbox": [ + 193, + 573, + 417, + 589 + ], + "lines": [ + { + "bbox": [ + 193, + 573, + 417, + 589 + ], + "spans": [ + { + "bbox": [ + 193, + 573, + 417, + 589 + ], + "score": 0.87, + "content": "\\begin{array} { r } { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) = \\mathbf { 0 } , } \\end{array}", + "type": "interline_equation", + "image_path": "06fc79bca4e35c9d611865d5387590dfc7fd69d123fd76f9569936be1535afbc.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 193, + 573, + 417, + 589 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 597, + 196, + 608 + ], + "lines": [ + { + "bbox": [ + 106, + 597, + 196, + 610 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 196, + 610 + ], + "score": 1.0, + "content": "which is equivalent to", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 616, + 401, + 632 + ], + "lines": [ + { + "bbox": [ + 208, + 616, + 401, + 632 + ], + "spans": [ + { + "bbox": [ + 208, + 616, + 401, + 632 + ], + "score": 0.85, + "content": "\\begin{array} { r } { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } ( I - V ^ { \\top } V ) = \\mathbf { 0 } . } \\end{array}", + "type": "interline_equation", + "image_path": "33b9eaf63a1966ce51a15d8841977e324c0f2086f70a59775d2f532431ece670.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 208, + 616, + 401, + 632 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 639, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 104, + 639, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 104, + 639, + 174, + 656 + ], + "score": 1.0, + "content": "Lastly, note that", + "type": "text" + }, + { + "bbox": [ + 175, + 640, + 311, + 655 + ], + "score": 0.93, + "content": "( I - U V ( U V ) ^ { \\top } ) = \\mathcal { P } _ { \\mathrm { c o l } ( U V ) ^ { \\perp } }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 639, + 333, + 656 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 333, + 640, + 431, + 654 + ], + "score": 0.93, + "content": "( I - V ^ { \\top } V ) = { \\mathcal P } _ { \\ker ( V ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 639, + 506, + 656 + ], + "score": 1.0, + "content": ", which concludes", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 651, + 148, + 665 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 148, + 665 + ], + "score": 1.0, + "content": "the proof.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "title", + "bbox": [ + 107, + 682, + 240, + 695 + ], + "lines": [ + { + "bbox": [ + 106, + 682, + 241, + 697 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 241, + 697 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 1", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 707, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 707, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 221, + 723 + ], + "score": 1.0, + "content": "By expansion we obtain that", + "type": "text" + }, + { + "bbox": [ + 222, + 708, + 478, + 722 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( A _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( A _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { 1 } ^ { \\top } \\pmb { A } _ { 2 } ^ { \\top } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 707, + 505, + 723 + ], + "score": 1.0, + "content": ". Con-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 147, + 734 + ], + "score": 1.0, + "content": "sider any", + "type": "text" + }, + { + "bbox": [ + 147, + 721, + 186, + 732 + ], + "score": 0.93, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 719, + 505, + 734 + ], + "score": 1.0, + "content": "that satisfies eq. (23), we have shown that such a point also satisfies eq. (27),", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + } + ], + "page_idx": 12, + "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": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 128 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 504, + 94 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 217, + 94 + ], + "score": 1.0, + "content": "Next, we derive the form of", + "type": "text" + }, + { + "bbox": [ + 217, + 83, + 231, + 93 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 81, + 412, + 94 + ], + "score": 1.0, + "content": ". Recall the full singular value decomposition", + "type": "text" + }, + { + "bbox": [ + 412, + 82, + 465, + 93 + ], + "score": 0.91, + "content": "\\pmb { \\Sigma } = \\pmb { U } \\pmb { \\Lambda } \\pmb { U } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 81, + 495, + 94 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 495, + 83, + 504, + 92 + ], + "score": 0.64, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 104, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 104, + 92, + 301, + 107 + ], + "score": 1.0, + "content": "is a diagonal matrix with distinct singular values", + "type": "text" + }, + { + "bbox": [ + 301, + 94, + 379, + 105 + ], + "score": 0.91, + "content": "\\sigma _ { 1 } > . . . > \\sigma _ { r } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 92, + 451, + 107 + ], + "score": 1.0, + "content": "and multiplicities", + "type": "text" + }, + { + "bbox": [ + 452, + 96, + 501, + 105 + ], + "score": 0.89, + "content": "m _ { 1 } , \\ldots , m _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 92, + 506, + 107 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 282, + 117 + ], + "score": 1.0, + "content": "respectively. We also assume that there are", + "type": "text" + }, + { + "bbox": [ + 282, + 106, + 293, + 115 + ], + "score": 0.79, + "content": "\\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 105, + 432, + 117 + ], + "score": 1.0, + "content": "number of zero singular values in", + "type": "text" + }, + { + "bbox": [ + 432, + 105, + 441, + 114 + ], + "score": 0.75, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 105, + 506, + 117 + ], + "score": 1.0, + "content": ". Using the fact", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 113, + 401, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 113, + 125, + 131 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 126, + 115, + 242, + 129 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { P } _ { \\mathrm { c o l } ( \\dot { A } _ { 2 } ) } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 113, + 401, + 131 + ], + "score": 1.0, + "content": ", the last equality in eq. (26) reduces to", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5, + "bbox_fs": [ + 104, + 81, + 506, + 131 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 243, + 137, + 367, + 151 + ], + "lines": [ + { + "bbox": [ + 243, + 137, + 367, + 151 + ], + "spans": [ + { + "bbox": [ + 243, + 137, + 367, + 151 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathbf { \\Delta } \\Lambda \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\mathbf { A } _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\mathbf { A } _ { 2 } ) } \\mathbf { \\Lambda } . } \\end{array}", + "type": "interline_equation", + "image_path": "abbd1dc37332e10121c319b7e63fb8d412b2091d1ab6a6de49d0a78d3945bab5.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 243, + 137, + 367, + 151 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 157, + 506, + 304 + ], + "lines": [ + { + "bbox": [ + 104, + 156, + 506, + 172 + ], + "spans": [ + { + "bbox": [ + 104, + 156, + 314, + 172 + ], + "score": 1.0, + "content": "By the multiplicity pattern of the singular values in", + "type": "text" + }, + { + "bbox": [ + 314, + 159, + 323, + 168 + ], + "score": 0.66, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 156, + 329, + 172 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 329, + 158, + 372, + 171 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 156, + 506, + 172 + ], + "score": 1.0, + "content": "must be block diagonal. Specif-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 104, + 169, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 104, + 169, + 189, + 185 + ], + "score": 1.0, + "content": "ically, we can write", + "type": "text" + }, + { + "bbox": [ + 190, + 171, + 337, + 185 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } = \\mathrm { d i a g } ( \\mathcal { P } _ { 1 } , \\dots , \\mathcal { P } _ { r } , \\overline { { \\mathcal { P } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 169, + 369, + 185 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 369, + 171, + 429, + 183 + ], + "score": 0.91, + "content": "\\mathcal { P } _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times m _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 169, + 449, + 185 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 450, + 170, + 501, + 182 + ], + "score": 0.93, + "content": "\\overline { { \\mathcal { P } } } \\in \\mathbb { R } ^ { \\bar { n } \\times \\bar { m } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 169, + 506, + 185 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 181, + 503, + 202 + ], + "spans": [ + { + "bbox": [ + 104, + 181, + 154, + 202 + ], + "score": 1.0, + "content": "Also, since", + "type": "text" + }, + { + "bbox": [ + 154, + 185, + 198, + 198 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 181, + 261, + 202 + ], + "score": 1.0, + "content": "is a projection,", + "type": "text" + }, + { + "bbox": [ + 262, + 186, + 291, + 196 + ], + "score": 0.65, + "content": "\\mathcal { P } _ { 1 } , \\ldots .", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 181, + 297, + 202 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 297, + 185, + 309, + 196 + ], + "score": 0.74, + "content": "\\mathcal { P } _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 181, + 313, + 202 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 313, + 185, + 323, + 195 + ], + "score": 0.67, + "content": "\\overline { { \\mathcal { P } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 181, + 459, + 202 + ], + "score": 1.0, + "content": "must all be projections. Note that", + "type": "text" + }, + { + "bbox": [ + 459, + 185, + 503, + 199 + ], + "score": 0.91, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 198, + 506, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 143, + 212 + ], + "score": 1.0, + "content": "has rank", + "type": "text" + }, + { + "bbox": [ + 143, + 199, + 185, + 210 + ], + "score": 0.54, + "content": "\\operatorname { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 198, + 260, + 212 + ], + "score": 1.0, + "content": ", and suppose that", + "type": "text" + }, + { + "bbox": [ + 261, + 199, + 290, + 210 + ], + "score": 0.64, + "content": "\\mathcal { P } _ { 1 } , \\ldots .", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 198, + 296, + 212 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 296, + 199, + 308, + 210 + ], + "score": 0.74, + "content": "\\mathcal { P } _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 198, + 312, + 212 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 313, + 198, + 322, + 209 + ], + "score": 0.77, + "content": "\\overline { { \\mathcal { P } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 198, + 370, + 212 + ], + "score": 1.0, + "content": "have ranks", + "type": "text" + }, + { + "bbox": [ + 370, + 200, + 422, + 210 + ], + "score": 0.88, + "content": "p _ { 1 } , \\ldots , p _ { r } , \\bar { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 198, + 506, + 212 + ], + "score": 1.0, + "content": ", respectively. Then,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 208, + 506, + 225 + ], + "spans": [ + { + "bbox": [ + 104, + 208, + 163, + 225 + ], + "score": 1.0, + "content": "we must have", + "type": "text" + }, + { + "bbox": [ + 163, + 211, + 198, + 221 + ], + "score": 0.91, + "content": "p _ { i } \\leq m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 208, + 213, + 225 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 214, + 210, + 263, + 221 + ], + "score": 0.69, + "content": "i = 1 , \\dots , r", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 208, + 267, + 225 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 267, + 210, + 295, + 221 + ], + "score": 0.75, + "content": "\\bar { p } \\leq \\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 208, + 313, + 225 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 314, + 210, + 419, + 222 + ], + "score": 0.88, + "content": "{ \\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( A _ { 2 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 208, + 506, + 225 + ], + "score": 1.0, + "content": ". Also, note that each", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 220, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 104, + 220, + 231, + 236 + ], + "score": 1.0, + "content": "projection can be expressed as", + "type": "text" + }, + { + "bbox": [ + 232, + 222, + 281, + 235 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { i } = V _ { i } V _ { i } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 220, + 302, + 236 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 302, + 222, + 357, + 233 + ], + "score": 0.8, + "content": "V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 220, + 361, + 236 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 362, + 222, + 410, + 232 + ], + "score": 0.88, + "content": "\\overline { { V } } \\in \\mathbb { R } ^ { \\bar { n } \\times \\bar { p } }", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 220, + 506, + 236 + ], + "score": 1.0, + "content": "consisting of orthonor-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 234, + 506, + 250 + ], + "spans": [ + { + "bbox": [ + 104, + 234, + 249, + 250 + ], + "score": 1.0, + "content": "mal columns. Hence, we can write", + "type": "text" + }, + { + "bbox": [ + 249, + 234, + 330, + 249 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } = \\widehat { V } \\widehat { V } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 234, + 357, + 250 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 358, + 234, + 465, + 248 + ], + "score": 0.91, + "content": "\\widehat { V } = \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { V } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 234, + 506, + 250 + ], + "score": 1.0, + "content": ". We then", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 247, + 507, + 265 + ], + "spans": [ + { + "bbox": [ + 104, + 247, + 165, + 265 + ], + "score": 1.0, + "content": "conclude that", + "type": "text" + }, + { + "bbox": [ + 165, + 249, + 344, + 264 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top } = U \\widehat { V } \\widehat { V } ^ { \\top } U ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 247, + 376, + 265 + ], + "score": 1.0, + "content": ". Thus,", + "type": "text" + }, + { + "bbox": [ + 376, + 250, + 390, + 261 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 247, + 507, + 265 + ], + "score": 1.0, + "content": "has the same column space", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 262, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 104, + 262, + 117, + 278 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 118, + 262, + 137, + 275 + ], + "score": 0.9, + "content": "\\boldsymbol { U } \\widehat { \\boldsymbol { V } }", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 262, + 307, + 278 + ], + "score": 1.0, + "content": ", and there must exist an invertible matrix", + "type": "text" + }, + { + "bbox": [ + 307, + 264, + 361, + 275 + ], + "score": 0.9, + "content": "C \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 262, + 402, + 278 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 402, + 262, + 474, + 277 + ], + "score": 0.93, + "content": "{ \\cal A } _ { 2 } = U [ \\widehat { V } , { \\bf 0 } ] C", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 262, + 506, + 278 + ], + "score": 1.0, + "content": ", where", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 274, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 203, + 289 + ], + "score": 0.89, + "content": "\\mathbf { 0 } \\in \\mathbb { R } ^ { d _ { 2 } \\times ( d _ { 1 } - \\operatorname { r a n k } ( A _ { 2 } ) ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 274, + 317, + 291 + ], + "score": 1.0, + "content": "is a zero matrix. Denoting", + "type": "text" + }, + { + "bbox": [ + 317, + 276, + 367, + 290 + ], + "score": 0.93, + "content": "V = [ \\widehat { V } , \\mathbf { 0 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 274, + 444, + 291 + ], + "score": 1.0, + "content": ", we conclude that", + "type": "text" + }, + { + "bbox": [ + 444, + 278, + 501, + 289 + ], + "score": 0.9, + "content": "A _ { 2 } = U V C", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 274, + 506, + 291 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 288, + 419, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 288, + 170, + 304 + ], + "score": 1.0, + "content": "Then, plugging", + "type": "text" + }, + { + "bbox": [ + 170, + 289, + 243, + 303 + ], + "score": 0.93, + "content": "\\pmb { A } _ { 2 } ^ { \\dagger } = \\pmb { C } ^ { - 1 } \\pmb { V } ^ { \\top } \\pmb { U } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 288, + 401, + 304 + ], + "score": 1.0, + "content": "into eq. (25) yields the desired form of", + "type": "text" + }, + { + "bbox": [ + 401, + 291, + 415, + 302 + ], + "score": 0.89, + "content": "\\pmb { A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 288, + 419, + 304 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 10, + "bbox_fs": [ + 104, + 156, + 507, + 304 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 309, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 105, + 308, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 396, + 322 + ], + "score": 1.0, + "content": "We now prove eq. (3). Note that the above proof is based on the equations", + "type": "text" + }, + { + "bbox": [ + 396, + 309, + 442, + 321 + ], + "score": 0.52, + "content": "\\nabla _ { A _ { 1 } } \\mathcal { L } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 308, + 446, + 322 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 446, + 308, + 506, + 321 + ], + "score": 0.57, + "content": "( \\nabla _ { A _ { 2 } } \\mathcal { L } ) A _ { 2 } ^ { \\top } =", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 320, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 203, + 333 + ], + "score": 1.0, + "content": "0. Hence, the forms of", + "type": "text" + }, + { + "bbox": [ + 203, + 320, + 234, + 331 + ], + "score": 0.84, + "content": "A _ { 1 } , A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 320, + 403, + 333 + ], + "score": 1.0, + "content": "in eqs. (1) and (2) need to further satisfy", + "type": "text" + }, + { + "bbox": [ + 403, + 321, + 451, + 331 + ], + "score": 0.88, + "content": "\\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 320, + 505, + 333 + ], + "score": 1.0, + "content": ". By eq. (27)", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 330, + 506, + 344 + ], + "spans": [ + { + "bbox": [ + 104, + 330, + 174, + 344 + ], + "score": 1.0, + "content": "and the form of", + "type": "text" + }, + { + "bbox": [ + 174, + 331, + 189, + 342 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 330, + 254, + 344 + ], + "score": 1.0, + "content": ", we obtain that", + "type": "text" + }, + { + "bbox": [ + 255, + 331, + 478, + 344 + ], + "score": 0.9, + "content": "A _ { 2 } A _ { 1 } { \\cal X } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } { \\cal Y } { \\cal X } ^ { \\dagger } { \\cal X } = { \\cal U } { \\cal V } ( { \\bar { U } } { \\cal V } ) ^ { \\top } { \\cal Y } { \\cal X } ^ { \\dagger } { \\cal X }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 330, + 506, + 344 + ], + "score": 1.0, + "content": ". This", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 342, + 364, + 355 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 257, + 355 + ], + "score": 1.0, + "content": "expression, together with the form of", + "type": "text" + }, + { + "bbox": [ + 257, + 343, + 271, + 353 + ], + "score": 0.89, + "content": "A _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 342, + 364, + 355 + ], + "score": 1.0, + "content": "in eq. (1), implies that", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 104, + 308, + 506, + 355 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 132, + 359, + 479, + 468 + ], + "lines": [ + { + "bbox": [ + 132, + 359, + 479, + 468 + ], + "spans": [ + { + "bbox": [ + 132, + 359, + 479, + 468 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { A _ { 2 } A _ { 1 } X X ^ { \\top } A _ { 1 } ^ { \\top } = U V ( U V ) ^ { \\top } Y X ^ { \\top } X X ^ { \\top } A _ { 1 } ^ { \\top } } \\\\ & { \\overset { ( i ) } { = } U V ( U V ) ^ { \\top } Y X ^ { \\top } A _ { 1 } ^ { \\top } } \\\\ & { \\quad \\quad = U V ( U V ) ^ { \\top } \\Sigma U V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } } \\\\ & { \\quad \\quad \\quad - U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } } \\\\ & { \\quad \\quad = U V V ^ { \\top } \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) } \\\\ & { \\overset { ( i i ) } { = } U \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) , } \\end{array}", + "type": "interline_equation", + "image_path": "8ffe76a591b8c1816c45fe9ed3639db7abeb7780e050022cb4be63194369c552.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 132, + 359, + 479, + 395.3333333333333 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 132, + 395.3333333333333, + 479, + 431.66666666666663 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 132, + 431.66666666666663, + 479, + 467.99999999999994 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 473, + 505, + 508 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 214, + 488 + ], + "score": 1.0, + "content": "where (i) uses the fact that", + "type": "text" + }, + { + "bbox": [ + 215, + 474, + 281, + 486 + ], + "score": 0.92, + "content": "X ^ { \\dag } X X ^ { \\dag } = X ^ { \\dag }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 473, + 449, + 488 + ], + "score": 1.0, + "content": ", (ii) uses the fact that the block pattern of", + "type": "text" + }, + { + "bbox": [ + 450, + 475, + 459, + 485 + ], + "score": 0.84, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 473, + 505, + 488 + ], + "score": 1.0, + "content": "is compat-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 485, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 340, + 498 + ], + "score": 1.0, + "content": "ible with the multiplicity pattern of the singular values in", + "type": "text" + }, + { + "bbox": [ + 340, + 487, + 349, + 496 + ], + "score": 0.8, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 486, + 397, + 498 + ], + "score": 1.0, + "content": ", and hence", + "type": "text" + }, + { + "bbox": [ + 397, + 485, + 470, + 496 + ], + "score": 0.91, + "content": "V \\mathbf { \\hat { V } } ^ { \\top } \\mathbf { A } V = \\mathbf { A } V", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 486, + 505, + 498 + ], + "score": 1.0, + "content": ". On the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 497, + 232, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 232, + 509 + ], + "score": 1.0, + "content": "other hand, we also obtain that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 473, + 505, + 509 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 513, + 430, + 549 + ], + "lines": [ + { + "bbox": [ + 180, + 513, + 430, + 549 + ], + "spans": [ + { + "bbox": [ + 180, + 513, + 430, + 549 + ], + "score": 0.91, + "content": "\\begin{array} { r } { Y X ^ { \\top } A _ { 1 } ^ { \\top } = \\Sigma U V ( C ^ { \\top } ) ^ { - 1 } + Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) } \\\\ { = U \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "753117343142fd752eaa24840906e65bc22973b04d450e371bc3e2c85ff9eba8.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 180, + 513, + 430, + 525.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 180, + 525.0, + 430, + 537.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 180, + 537.0, + 430, + 549.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 554, + 326, + 567 + ], + "lines": [ + { + "bbox": [ + 106, + 553, + 327, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 553, + 170, + 568 + ], + "score": 1.0, + "content": "Thus, to satisfy", + "type": "text" + }, + { + "bbox": [ + 171, + 555, + 217, + 567 + ], + "score": 0.92, + "content": "\\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 553, + 327, + 568 + ], + "score": 1.0, + "content": "in eq. (24), we require that", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 106, + 553, + 327, + 568 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 193, + 573, + 417, + 589 + ], + "lines": [ + { + "bbox": [ + 193, + 573, + 417, + 589 + ], + "spans": [ + { + "bbox": [ + 193, + 573, + 417, + 589 + ], + "score": 0.87, + "content": "\\begin{array} { r } { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) = \\mathbf { 0 } , } \\end{array}", + "type": "interline_equation", + "image_path": "06fc79bca4e35c9d611865d5387590dfc7fd69d123fd76f9569936be1535afbc.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 193, + 573, + 417, + 589 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 597, + 196, + 608 + ], + "lines": [ + { + "bbox": [ + 106, + 597, + 196, + 610 + ], + "spans": [ + { + "bbox": [ + 106, + 597, + 196, + 610 + ], + "score": 1.0, + "content": "which is equivalent to", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31, + "bbox_fs": [ + 106, + 597, + 196, + 610 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 208, + 616, + 401, + 632 + ], + "lines": [ + { + "bbox": [ + 208, + 616, + 401, + 632 + ], + "spans": [ + { + "bbox": [ + 208, + 616, + 401, + 632 + ], + "score": 0.85, + "content": "\\begin{array} { r } { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } ( I - V ^ { \\top } V ) = \\mathbf { 0 } . } \\end{array}", + "type": "interline_equation", + "image_path": "33b9eaf63a1966ce51a15d8841977e324c0f2086f70a59775d2f532431ece670.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 208, + 616, + 401, + 632 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 639, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 104, + 639, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 104, + 639, + 174, + 656 + ], + "score": 1.0, + "content": "Lastly, note that", + "type": "text" + }, + { + "bbox": [ + 175, + 640, + 311, + 655 + ], + "score": 0.93, + "content": "( I - U V ( U V ) ^ { \\top } ) = \\mathcal { P } _ { \\mathrm { c o l } ( U V ) ^ { \\perp } }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 639, + 333, + 656 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 333, + 640, + 431, + 654 + ], + "score": 0.93, + "content": "( I - V ^ { \\top } V ) = { \\mathcal P } _ { \\ker ( V ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 639, + 506, + 656 + ], + "score": 1.0, + "content": ", which concludes", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 651, + 148, + 665 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 148, + 665 + ], + "score": 1.0, + "content": "the proof.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 104, + 639, + 506, + 665 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 682, + 240, + 695 + ], + "lines": [ + { + "bbox": [ + 106, + 682, + 241, + 697 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 241, + 697 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 1", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 707, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 707, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 221, + 723 + ], + "score": 1.0, + "content": "By expansion we obtain that", + "type": "text" + }, + { + "bbox": [ + 222, + 708, + 478, + 722 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( A _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( A _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { 1 } ^ { \\top } \\pmb { A } _ { 2 } ^ { \\top } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 707, + 505, + 723 + ], + "score": 1.0, + "content": ". Con-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 719, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 147, + 734 + ], + "score": 1.0, + "content": "sider any", + "type": "text" + }, + { + "bbox": [ + 147, + 721, + 186, + 732 + ], + "score": 0.93, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 719, + 505, + 734 + ], + "score": 1.0, + "content": "that satisfies eq. (23), we have shown that such a point also satisfies eq. (27),", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 707, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 207, + 93 + ], + "lines": [ + { + "bbox": [ + 107, + 82, + 207, + 95 + ], + "spans": [ + { + "bbox": [ + 107, + 82, + 207, + 95 + ], + "score": 1.0, + "content": "which further yields that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 174, + 96, + 437, + 169 + ], + "lines": [ + { + "bbox": [ + 174, + 96, + 437, + 169 + ], + "spans": [ + { + "bbox": [ + 174, + 96, + 437, + 169 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { 1 } ^ { \\top } \\pmb { A } _ { 2 } ^ { \\top } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } ) + \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\big ) } \\\\ & { \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } ) } \\\\ & { \\overset { ( i i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) } \\pmb { \\Lambda } \\big ) } \\end{array}", + "type": "interline_equation", + "image_path": "d3ea025465808075b15cf80b5235611cc253b57480ea1d8366d0002ccb91a41c.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 174, + 96, + 437, + 120.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 174, + 120.33333333333333, + 437, + 144.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 174, + 144.66666666666666, + 437, + 169.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 109, + 173, + 503, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 171, + 505, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 254, + 187 + ], + "score": 1.0, + "content": "where (i) follows from the fact that", + "type": "text" + }, + { + "bbox": [ + 255, + 173, + 432, + 186 + ], + "score": 0.91, + "content": "\\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\big ) = \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 171, + 505, + 187 + ], + "score": 1.0, + "content": ", and (ii) uses the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 185, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 144, + 200 + ], + "score": 1.0, + "content": "fact that", + "type": "text" + }, + { + "bbox": [ + 145, + 185, + 265, + 199 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) _ { \\perp } } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 185, + 392, + 200 + ], + "score": 1.0, + "content": ". In particular, a critical point", + "type": "text" + }, + { + "bbox": [ + 392, + 186, + 430, + 198 + ], + "score": 0.9, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 185, + 505, + 200 + ], + "score": 1.0, + "content": "satisfies eq. (28).", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 196, + 449, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 289, + 210 + ], + "score": 1.0, + "content": "Moreover, using the form of the critical point", + "type": "text" + }, + { + "bbox": [ + 290, + 197, + 344, + 208 + ], + "score": 0.91, + "content": "\\mathbf { \\delta } _ { A _ { 2 } } = U V C", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 196, + 449, + 210 + ], + "score": 1.0, + "content": ", eq. (28) further becomes", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 228, + 211, + 383, + 281 + ], + "lines": [ + { + "bbox": [ + 228, + 211, + 383, + 281 + ], + "spans": [ + { + "bbox": [ + 228, + 211, + 383, + 281 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( V C ) } \\mathbf { \\Lambda } \\big ) } \\\\ & { \\quad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( V ^ { \\top } \\mathbf { \\Lambda } \\mathbf { \\Lambda } V \\big ) } \\\\ & { \\quad \\overset { ( i i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\displaystyle \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } , } \\end{array}", + "type": "interline_equation", + "image_path": "516dff1a256c54bbd471a16eca965bc46fd706224f67f2097259da1979c75d77.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 228, + 211, + 383, + 225.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 228, + 225.0, + 383, + 239.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 228, + 239.0, + 383, + 253.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 228, + 253.0, + 383, + 267.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 228, + 267.0, + 383, + 281.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 283, + 504, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 185, + 298 + ], + "score": 1.0, + "content": "where (i) is due to", + "type": "text" + }, + { + "bbox": [ + 186, + 284, + 310, + 298 + ], + "score": 0.93, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( V C ) } = \\mathcal { P } _ { \\mathrm { c o l } ( V ) } = V V ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 282, + 461, + 298 + ], + "score": 1.0, + "content": ", and (ii) utilizes the block pattern of", + "type": "text" + }, + { + "bbox": [ + 461, + 285, + 471, + 295 + ], + "score": 0.83, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 282, + 506, + 298 + ], + "score": 1.0, + "content": "and the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 295, + 336, + 308 + ], + "spans": [ + { + "bbox": [ + 106, + 295, + 196, + 308 + ], + "score": 1.0, + "content": "multiplicity pattern of", + "type": "text" + }, + { + "bbox": [ + 197, + 297, + 206, + 306 + ], + "score": 0.79, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 295, + 336, + 308 + ], + "score": 1.0, + "content": "that are specified in Theorem 1.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "title", + "bbox": [ + 107, + 323, + 242, + 336 + ], + "lines": [ + { + "bbox": [ + 106, + 321, + 243, + 338 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 243, + 338 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 2", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 346, + 506, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 347, + 506, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 225, + 361 + ], + "score": 1.0, + "content": "(1): Consider a critical point", + "type": "text" + }, + { + "bbox": [ + 225, + 347, + 264, + 360 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 347, + 468, + 361 + ], + "score": 1.0, + "content": "with the forms given by Theorem 1. By choosing", + "type": "text" + }, + { + "bbox": [ + 468, + 348, + 501, + 359 + ], + "score": 0.9, + "content": "\\mathbf { L } _ { 1 } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 347, + 506, + 361 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 358, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 442, + 371 + ], + "score": 1.0, + "content": "the condition in eq. (3) is guaranteed. Then, we can specify a critical point with any", + "type": "text" + }, + { + "bbox": [ + 442, + 359, + 452, + 369 + ], + "score": 0.79, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 358, + 506, + 371 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 369, + 506, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 385, + 382 + ], + "score": 1.0, + "content": "the block pattern specified in Theorem 1, i.e., we can choose any", + "type": "text" + }, + { + "bbox": [ + 386, + 370, + 462, + 381 + ], + "score": 0.91, + "content": "p _ { i } , i \\ = \\ 1 , . . . , r , \\bar { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 369, + 506, + 382 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 380, + 507, + 395 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 145, + 392 + ], + "score": 0.9, + "content": "p _ { i } \\ \\leq \\ m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 380, + 162, + 395 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 163, + 381, + 253, + 392 + ], + "score": 0.68, + "content": "i = 1 , \\ldots , r , \\bar { p } \\leq \\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 380, + 272, + 395 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 272, + 380, + 383, + 393 + ], + "score": 0.9, + "content": "\\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + { \\bar { p } } = \\operatorname { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 380, + 447, + 395 + ], + "score": 1.0, + "content": ". Suppose that", + "type": "text" + }, + { + "bbox": [ + 447, + 381, + 486, + 393 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 380, + 507, + 395 + ], + "score": 1.0, + "content": "is a", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 390, + 507, + 408 + ], + "spans": [ + { + "bbox": [ + 104, + 390, + 281, + 408 + ], + "score": 1.0, + "content": "global minimizer, Proposition 1 gives that", + "type": "text" + }, + { + "bbox": [ + 281, + 392, + 455, + 406 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\dot { \\mathcal { L } } ( \\bar { \\boldsymbol { A } } _ { 1 } , \\boldsymbol { A } _ { 2 } ) = \\frac { 1 } { 2 } \\mathrm { T r } ( \\boldsymbol { Y } \\boldsymbol { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 390, + 507, + 408 + ], + "score": 1.0, + "content": ". Under the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 403, + 504, + 420 + ], + "spans": [ + { + "bbox": [ + 104, + 403, + 165, + 420 + ], + "score": 1.0, + "content": "condition that", + "type": "text" + }, + { + "bbox": [ + 165, + 405, + 270, + 418 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} \\le \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 403, + 489, + 420 + ], + "score": 1.0, + "content": ", the global minimum value is achieved by a full rank", + "type": "text" + }, + { + "bbox": [ + 490, + 405, + 504, + 416 + ], + "score": 0.86, + "content": "A _ { 2 }", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 415, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 104, + 415, + 127, + 435 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 419, + 234, + 431 + ], + "score": 0.91, + "content": "\\mathrm { r a n k } ( A _ { 2 } ) = \\mathrm { m i n } \\{ d _ { 2 } , d _ { 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 415, + 252, + 435 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 252, + 417, + 505, + 432 + ], + "score": 0.8, + "content": "\\begin{array} { r } { p _ { 1 } = m _ { 1 } , \\dotsc , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = \\operatorname { r a n k } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\leq } \\end{array}", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 121, + 441 + ], + "score": 0.85, + "content": "m _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 430, + 161, + 443 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 161, + 431, + 187, + 441 + ], + "score": 0.89, + "content": "k \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 430, + 506, + 443 + ], + "score": 1.0, + "content": ". That is, the singular values are selected in a decreasing order to minimize the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 440, + 169, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 169, + 453 + ], + "score": 1.0, + "content": "function value.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 457, + 505, + 503 + ], + "lines": [ + { + "bbox": [ + 101, + 452, + 509, + 481 + ], + "spans": [ + { + "bbox": [ + 101, + 452, + 136, + 481 + ], + "score": 1.0, + "content": "(2): If achieve", + "type": "text" + }, + { + "bbox": [ + 136, + 458, + 175, + 470 + ], + "score": 0.92, + "content": "\\left( A _ { 2 } , A _ { 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 452, + 195, + 481 + ], + "score": 1.0, + "content": "is aosing", + "type": "text" + }, + { + "bbox": [ + 232, + 452, + 261, + 481 + ], + "score": 1.0, + "content": "inimizefor all", + "type": "text" + }, + { + "bbox": [ + 285, + 457, + 385, + 470 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { y } , d \\} > \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 452, + 509, + 481 + ], + "score": 1.0, + "content": ", the global minimum can berticular, we do not need a full", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 196, + 470, + 357, + 481 + ], + "spans": [ + { + "bbox": [ + 196, + 471, + 232, + 480 + ], + "score": 0.89, + "content": "p _ { i } = m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 470, + 312, + 480 + ], + "score": 0.91, + "content": "i = 1 , \\ldots , r", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 470, + 357, + 481 + ], + "score": 0.88, + "content": "\\bar { p } \\geq 0", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 479, + 505, + 494 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 127, + 494 + ], + "score": 1.0, + "content": "rank", + "type": "text" + }, + { + "bbox": [ + 128, + 480, + 142, + 491 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 479, + 397, + 494 + ], + "score": 1.0, + "content": "to achieve the global minimum. For example, we can choose", + "type": "text" + }, + { + "bbox": [ + 397, + 479, + 505, + 493 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname { r a n k } ( A _ { 2 } ) = \\sum _ { i = 1 } ^ { r } m _ { i } < } \\end{array}", + "type": "inline_equation" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 491, + 335, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 154, + 504 + ], + "score": 0.92, + "content": "\\operatorname* { m i n } \\{ d _ { y } , d \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 491, + 175, + 504 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 175, + 492, + 210, + 502 + ], + "score": 0.9, + "content": "p _ { i } = m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 491, + 238, + 504 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 239, + 492, + 288, + 502 + ], + "score": 0.91, + "content": "i = 1 , \\dots , r", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 491, + 306, + 504 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 306, + 492, + 330, + 502 + ], + "score": 0.91, + "content": "\\bar { p } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 491, + 335, + 504 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25.5 + }, + { + "type": "title", + "bbox": [ + 107, + 518, + 241, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 242, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 242, + 533 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 3", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 542, + 505, + 578 + ], + "lines": [ + { + "bbox": [ + 106, + 542, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 380, + 556 + ], + "score": 1.0, + "content": "We first prove item 1. Consider a non-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 380, + 542, + 419, + 555 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 542, + 505, + 556 + ], + "score": 1.0, + "content": ". By Theorem 1, we", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 554, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 147, + 567 + ], + "score": 1.0, + "content": "can write", + "type": "text" + }, + { + "bbox": [ + 147, + 555, + 205, + 566 + ], + "score": 0.9, + "content": "A _ { \\mathrm { 2 } } = U V C", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 554, + 234, + 567 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 235, + 554, + 361, + 567 + ], + "score": 0.92, + "content": "V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { V } } ) , { \\bf 0 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 554, + 381, + 567 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 381, + 554, + 461, + 567 + ], + "score": 0.91, + "content": "V _ { i } , i = 1 , \\dots , r , \\overline { { V } }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 554, + 506, + 567 + ], + "score": 1.0, + "content": "consist of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 566, + 383, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 383, + 578 + ], + "score": 1.0, + "content": "orthonormal columns. Define the orthonormal block diagonal matrix", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 580, + 392, + 614 + ], + "lines": [ + { + "bbox": [ + 219, + 580, + 392, + 614 + ], + "spans": [ + { + "bbox": [ + 219, + 580, + 392, + 614 + ], + "score": 0.95, + "content": "\\pmb { S } ^ { \\top } : = \\operatorname { d i a g } \\left( \\begin{array} { l } { \\left[ \\pmb { V } _ { 1 } ^ { \\top } \\right] , \\cdots , \\left[ \\pmb { V } _ { r } ^ { \\top } \\right] , } \\\\ { \\left[ \\pmb { O } _ { 1 } ^ { \\top } \\right] } \\end{array} \\left[ \\begin{array} { l } { \\pmb { \\overline { { V } } } ^ { \\top } } \\\\ { \\pmb { \\overline { { O } } } _ { r } ^ { \\top } } \\end{array} \\right] , \\right) ,", + "type": "interline_equation", + "image_path": "89086882b1e53e581997ce41a0f170a9a2f8eddfc9bcb528222539461012caec.jpg" + } + ] + } + ], + "index": 32.5, + "virtual_lines": [ + { + "bbox": [ + 219, + 580, + 392, + 597.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 219, + 597.0, + 392, + 614.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 617, + 505, + 662 + ], + "lines": [ + { + "bbox": [ + 106, + 617, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 187, + 631 + ], + "score": 1.0, + "content": "where the matrices", + "type": "text" + }, + { + "bbox": [ + 187, + 617, + 251, + 630 + ], + "score": 0.91, + "content": "O _ { 1 } , \\cdots , O _ { r } , \\overline { { { O } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 617, + 505, + 631 + ], + "score": 1.0, + "content": "are such that each diagonal block forms an orthonormal sub-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 627, + 503, + 641 + ], + "spans": [ + { + "bbox": [ + 104, + 627, + 244, + 641 + ], + "score": 1.0, + "content": "matrix. By construction we have", + "type": "text" + }, + { + "bbox": [ + 245, + 628, + 438, + 641 + ], + "score": 0.89, + "content": "\\bar { \\pmb { S } } ^ { \\top } \\pmb { V } = [ \\mathrm { d i a g } ( \\pmb { I } ^ { m _ { 1 } \\times p _ { 1 } } , \\allowbreak \\bar { \\lambda } . . . , \\pmb { I } ^ { m _ { r } \\times p _ { r } } , \\pmb { I } ^ { \\bar { m } \\times \\bar { p } } ) , \\mathbf { 0 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 627, + 470, + 641 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 470, + 629, + 503, + 639 + ], + "score": 0.89, + "content": "{ \\cal { I } } ^ { m _ { k } \\times p _ { k } }", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 104, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 104, + 639, + 201, + 653 + ], + "score": 1.0, + "content": "corresponds to the first", + "type": "text" + }, + { + "bbox": [ + 201, + 642, + 213, + 651 + ], + "score": 0.84, + "content": "p _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 639, + 340, + 653 + ], + "score": 1.0, + "content": "columns of the identity matrix", + "type": "text" + }, + { + "bbox": [ + 340, + 641, + 376, + 650 + ], + "score": 0.87, + "content": "I ^ { m _ { k } \\times m _ { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 639, + 408, + 653 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + }, + { + "bbox": [ + 408, + 641, + 422, + 651 + ], + "score": 0.84, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 639, + 505, + 653 + ], + "score": 1.0, + "content": "can be alternatively", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 650, + 371, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 148, + 662 + ], + "score": 1.0, + "content": "written as", + "type": "text" + }, + { + "bbox": [ + 148, + 650, + 222, + 662 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\pmb { A } _ { 2 } = \\pmb { U } \\pmb { S } \\pmb { S } ^ { \\top } \\pmb { V } \\pmb { C } , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 650, + 340, + 662 + ], + "score": 1.0, + "content": ". Also, denote the columns of", + "type": "text" + }, + { + "bbox": [ + 341, + 651, + 358, + 661 + ], + "score": 0.85, + "content": "{ \\pmb U } { \\pmb S }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 650, + 371, + 662 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5 + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 666, + 416, + 681 + ], + "lines": [ + { + "bbox": [ + 194, + 666, + 416, + 681 + ], + "spans": [ + { + "bbox": [ + 194, + 666, + 416, + 681 + ], + "score": 0.89, + "content": "U S = [ \\mathbf { u } _ { 1 1 } ^ { s } , \\ldots , \\mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \\ldots , \\mathbf { u } _ { r 1 } ^ { s } , \\ldots , \\mathbf { u } _ { r p _ { r } } ^ { s } , \\bar { \\mathbf { u } } _ { 1 } ^ { s } , \\ldots , \\bar { \\mathbf { u } } _ { \\bar { p } } ^ { s } ] .", + "type": "interline_equation", + "image_path": "fe118131e19e36a646c9ae5478ef19f4387ef0052ffd1e75bd2bc504c6a51ac1.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 194, + 666, + 416, + 681 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 684, + 504, + 706 + ], + "lines": [ + { + "bbox": [ + 106, + 682, + 504, + 697 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 132, + 697 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 132, + 684, + 171, + 695 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 682, + 369, + 697 + ], + "score": 1.0, + "content": "is a non-optimal-order critical point, there exists", + "type": "text" + }, + { + "bbox": [ + 369, + 684, + 429, + 695 + ], + "score": 0.91, + "content": "1 \\leq i < j \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 682, + 468, + 697 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 468, + 685, + 504, + 695 + ], + "score": 0.89, + "content": "p _ { i } < m _ { i }", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 694, + 421, + 707 + ], + "spans": [ + { + "bbox": [ + 106, + 694, + 123, + 706 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 696, + 152, + 707 + ], + "score": 0.91, + "content": "p _ { j } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 694, + 336, + 706 + ], + "score": 1.0, + "content": ". Then, consider the following perturbation of", + "type": "text" + }, + { + "bbox": [ + 336, + 696, + 353, + 704 + ], + "score": 0.85, + "content": "{ \\boldsymbol { U } } { \\boldsymbol { S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 694, + 392, + 706 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 393, + 696, + 416, + 705 + ], + "score": 0.88, + "content": "\\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 694, + 421, + 706 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 710, + 421, + 730 + ], + "lines": [ + { + "bbox": [ + 189, + 710, + 421, + 730 + ], + "spans": [ + { + "bbox": [ + 189, + 710, + 421, + 730 + ], + "score": 0.92, + "content": "\\widetilde { M } = \\left[ \\mathbf { u } _ { 1 1 } ^ { s } , \\ldots , \\mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \\ldots , \\frac { \\mathbf { u } _ { j 1 } ^ { s } + \\epsilon \\mathbf { u } _ { i ( p _ { i } + 1 ) } ^ { s } } { \\sqrt { 1 + \\epsilon ^ { 2 } } } , \\ldots \\bar { \\mathbf { u } } _ { 1 } ^ { s } , \\ldots , \\bar { \\mathbf { u } } _ { \\bar { p } } ^ { s } \\right] ,", + "type": "interline_equation", + "image_path": "10260925743050a4d7f357fd3e60b939748b669659d07dc381fa8b71d783fb1a.jpg" + } + ] + } + ], + "index": 41, + "virtual_lines": [ + { + "bbox": [ + 189, + 710, + 421, + 730 + ], + "spans": [], + "index": 41 + } + ] + } + ], + "page_idx": 13, + "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": "14", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 207, + 93 + ], + "lines": [ + { + "bbox": [ + 107, + 82, + 207, + 95 + ], + "spans": [ + { + "bbox": [ + 107, + 82, + 207, + 95 + ], + "score": 1.0, + "content": "which further yields that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 107, + 82, + 207, + 95 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 174, + 96, + 437, + 169 + ], + "lines": [ + { + "bbox": [ + 174, + 96, + 437, + 169 + ], + "spans": [ + { + "bbox": [ + 174, + 96, + 437, + 169 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { 1 } ^ { \\top } \\pmb { A } _ { 2 } ^ { \\top } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } ) + \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\big ) } \\\\ & { \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } ) } \\\\ & { \\overset { ( i i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) } \\pmb { \\Lambda } \\big ) } \\end{array}", + "type": "interline_equation", + "image_path": "d3ea025465808075b15cf80b5235611cc253b57480ea1d8366d0002ccb91a41c.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 174, + 96, + 437, + 120.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 174, + 120.33333333333333, + 437, + 144.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 174, + 144.66666666666666, + 437, + 169.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 109, + 173, + 503, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 171, + 505, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 171, + 254, + 187 + ], + "score": 1.0, + "content": "where (i) follows from the fact that", + "type": "text" + }, + { + "bbox": [ + 255, + 173, + 432, + 186 + ], + "score": 0.91, + "content": "\\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\big ) = \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 171, + 505, + 187 + ], + "score": 1.0, + "content": ", and (ii) uses the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 185, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 144, + 200 + ], + "score": 1.0, + "content": "fact that", + "type": "text" + }, + { + "bbox": [ + 145, + 185, + 265, + 199 + ], + "score": 0.92, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) _ { \\perp } } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 185, + 392, + 200 + ], + "score": 1.0, + "content": ". In particular, a critical point", + "type": "text" + }, + { + "bbox": [ + 392, + 186, + 430, + 198 + ], + "score": 0.9, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 185, + 505, + 200 + ], + "score": 1.0, + "content": "satisfies eq. (28).", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 196, + 449, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 196, + 289, + 210 + ], + "score": 1.0, + "content": "Moreover, using the form of the critical point", + "type": "text" + }, + { + "bbox": [ + 290, + 197, + 344, + 208 + ], + "score": 0.91, + "content": "\\mathbf { \\delta } _ { A _ { 2 } } = U V C", + "type": "inline_equation" + }, + { + "bbox": [ + 344, + 196, + 449, + 210 + ], + "score": 1.0, + "content": ", eq. (28) further becomes", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 171, + 505, + 210 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 228, + 211, + 383, + 281 + ], + "lines": [ + { + "bbox": [ + 228, + 211, + 383, + 281 + ], + "spans": [ + { + "bbox": [ + 228, + 211, + 383, + 281 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( V C ) } \\mathbf { \\Lambda } \\big ) } \\\\ & { \\quad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( V ^ { \\top } \\mathbf { \\Lambda } \\mathbf { \\Lambda } V \\big ) } \\\\ & { \\quad \\overset { ( i i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\displaystyle \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } , } \\end{array}", + "type": "interline_equation", + "image_path": "516dff1a256c54bbd471a16eca965bc46fd706224f67f2097259da1979c75d77.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 228, + 211, + 383, + 225.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 228, + 225.0, + 383, + 239.0 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 228, + 239.0, + 383, + 253.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 228, + 253.0, + 383, + 267.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 228, + 267.0, + 383, + 281.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 283, + 504, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 185, + 298 + ], + "score": 1.0, + "content": "where (i) is due to", + "type": "text" + }, + { + "bbox": [ + 186, + 284, + 310, + 298 + ], + "score": 0.93, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( V C ) } = \\mathcal { P } _ { \\mathrm { c o l } ( V ) } = V V ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 282, + 461, + 298 + ], + "score": 1.0, + "content": ", and (ii) utilizes the block pattern of", + "type": "text" + }, + { + "bbox": [ + 461, + 285, + 471, + 295 + ], + "score": 0.83, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 282, + 506, + 298 + ], + "score": 1.0, + "content": "and the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 295, + 336, + 308 + ], + "spans": [ + { + "bbox": [ + 106, + 295, + 196, + 308 + ], + "score": 1.0, + "content": "multiplicity pattern of", + "type": "text" + }, + { + "bbox": [ + 197, + 297, + 206, + 306 + ], + "score": 0.79, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 295, + 336, + 308 + ], + "score": 1.0, + "content": "that are specified in Theorem 1.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 282, + 506, + 308 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 323, + 242, + 336 + ], + "lines": [ + { + "bbox": [ + 106, + 321, + 243, + 338 + ], + "spans": [ + { + "bbox": [ + 106, + 321, + 243, + 338 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 2", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 106, + 346, + 506, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 347, + 506, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 225, + 361 + ], + "score": 1.0, + "content": "(1): Consider a critical point", + "type": "text" + }, + { + "bbox": [ + 225, + 347, + 264, + 360 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 347, + 468, + 361 + ], + "score": 1.0, + "content": "with the forms given by Theorem 1. By choosing", + "type": "text" + }, + { + "bbox": [ + 468, + 348, + 501, + 359 + ], + "score": 0.9, + "content": "\\mathbf { L } _ { 1 } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 347, + 506, + 361 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 358, + 506, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 442, + 371 + ], + "score": 1.0, + "content": "the condition in eq. (3) is guaranteed. Then, we can specify a critical point with any", + "type": "text" + }, + { + "bbox": [ + 442, + 359, + 452, + 369 + ], + "score": 0.79, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 358, + 506, + 371 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 369, + 506, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 385, + 382 + ], + "score": 1.0, + "content": "the block pattern specified in Theorem 1, i.e., we can choose any", + "type": "text" + }, + { + "bbox": [ + 386, + 370, + 462, + 381 + ], + "score": 0.91, + "content": "p _ { i } , i \\ = \\ 1 , . . . , r , \\bar { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 369, + 506, + 382 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 380, + 507, + 395 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 145, + 392 + ], + "score": 0.9, + "content": "p _ { i } \\ \\leq \\ m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 380, + 162, + 395 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 163, + 381, + 253, + 392 + ], + "score": 0.68, + "content": "i = 1 , \\ldots , r , \\bar { p } \\leq \\bar { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 380, + 272, + 395 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 272, + 380, + 383, + 393 + ], + "score": 0.9, + "content": "\\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + { \\bar { p } } = \\operatorname { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 380, + 447, + 395 + ], + "score": 1.0, + "content": ". Suppose that", + "type": "text" + }, + { + "bbox": [ + 447, + 381, + 486, + 393 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 380, + 507, + 395 + ], + "score": 1.0, + "content": "is a", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 104, + 390, + 507, + 408 + ], + "spans": [ + { + "bbox": [ + 104, + 390, + 281, + 408 + ], + "score": 1.0, + "content": "global minimizer, Proposition 1 gives that", + "type": "text" + }, + { + "bbox": [ + 281, + 392, + 455, + 406 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\dot { \\mathcal { L } } ( \\bar { \\boldsymbol { A } } _ { 1 } , \\boldsymbol { A } _ { 2 } ) = \\frac { 1 } { 2 } \\mathrm { T r } ( \\boldsymbol { Y } \\boldsymbol { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 390, + 507, + 408 + ], + "score": 1.0, + "content": ". Under the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 104, + 403, + 504, + 420 + ], + "spans": [ + { + "bbox": [ + 104, + 403, + 165, + 420 + ], + "score": 1.0, + "content": "condition that", + "type": "text" + }, + { + "bbox": [ + 165, + 405, + 270, + 418 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} \\le \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 403, + 489, + 420 + ], + "score": 1.0, + "content": ", the global minimum value is achieved by a full rank", + "type": "text" + }, + { + "bbox": [ + 490, + 405, + 504, + 416 + ], + "score": 0.86, + "content": "A _ { 2 }", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 415, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 104, + 415, + 127, + 435 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 127, + 419, + 234, + 431 + ], + "score": 0.91, + "content": "\\mathrm { r a n k } ( A _ { 2 } ) = \\mathrm { m i n } \\{ d _ { 2 } , d _ { 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 415, + 252, + 435 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 252, + 417, + 505, + 432 + ], + "score": 0.8, + "content": "\\begin{array} { r } { p _ { 1 } = m _ { 1 } , \\dotsc , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = \\operatorname { r a n k } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\leq } \\end{array}", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 430, + 506, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 432, + 121, + 441 + ], + "score": 0.85, + "content": "m _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 122, + 430, + 161, + 443 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 161, + 431, + 187, + 441 + ], + "score": 0.89, + "content": "k \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 430, + 506, + 443 + ], + "score": 1.0, + "content": ". That is, the singular values are selected in a decreasing order to minimize the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 440, + 169, + 453 + ], + "spans": [ + { + "bbox": [ + 106, + 440, + 169, + 453 + ], + "score": 1.0, + "content": "function value.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 19, + "bbox_fs": [ + 104, + 347, + 507, + 453 + ] + }, + { + "type": "list", + "bbox": [ + 106, + 457, + 505, + 503 + ], + "lines": [ + { + "bbox": [ + 101, + 452, + 509, + 481 + ], + "spans": [ + { + "bbox": [ + 101, + 452, + 136, + 481 + ], + "score": 1.0, + "content": "(2): If achieve", + "type": "text" + }, + { + "bbox": [ + 136, + 458, + 175, + 470 + ], + "score": 0.92, + "content": "\\left( A _ { 2 } , A _ { 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 452, + 195, + 481 + ], + "score": 1.0, + "content": "is aosing", + "type": "text" + }, + { + "bbox": [ + 232, + 452, + 261, + 481 + ], + "score": 1.0, + "content": "inimizefor all", + "type": "text" + }, + { + "bbox": [ + 285, + 457, + 385, + 470 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { y } , d \\} > \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 452, + 509, + 481 + ], + "score": 1.0, + "content": ", the global minimum can berticular, we do not need a full", + "type": "text" + } + ], + "index": 24, + "is_list_start_line": true + }, + { + "bbox": [ + 196, + 470, + 357, + 481 + ], + "spans": [ + { + "bbox": [ + 196, + 471, + 232, + 480 + ], + "score": 0.89, + "content": "p _ { i } = m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 470, + 312, + 480 + ], + "score": 0.91, + "content": "i = 1 , \\ldots , r", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 470, + 357, + 481 + ], + "score": 0.88, + "content": "\\bar { p } \\geq 0", + "type": "inline_equation" + } + ], + "index": 25, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 479, + 505, + 494 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 127, + 494 + ], + "score": 1.0, + "content": "rank", + "type": "text" + }, + { + "bbox": [ + 128, + 480, + 142, + 491 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 479, + 397, + 494 + ], + "score": 1.0, + "content": "to achieve the global minimum. For example, we can choose", + "type": "text" + }, + { + "bbox": [ + 397, + 479, + 505, + 493 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname { r a n k } ( A _ { 2 } ) = \\sum _ { i = 1 } ^ { r } m _ { i } < } \\end{array}", + "type": "inline_equation" + } + ], + "index": 26, + "is_list_start_line": true + }, + { + "bbox": [ + 106, + 491, + 335, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 154, + 504 + ], + "score": 0.92, + "content": "\\operatorname* { m i n } \\{ d _ { y } , d \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 491, + 175, + 504 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 175, + 492, + 210, + 502 + ], + "score": 0.9, + "content": "p _ { i } = m _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 491, + 238, + 504 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 239, + 492, + 288, + 502 + ], + "score": 0.91, + "content": "i = 1 , \\dots , r", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 491, + 306, + 504 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 306, + 492, + 330, + 502 + ], + "score": 0.91, + "content": "\\bar { p } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 491, + 335, + 504 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 25.5, + "bbox_fs": [ + 101, + 452, + 509, + 504 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 518, + 241, + 531 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 242, + 533 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 242, + 533 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 3", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 542, + 505, + 578 + ], + "lines": [ + { + "bbox": [ + 106, + 542, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 380, + 556 + ], + "score": 1.0, + "content": "We first prove item 1. Consider a non-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 380, + 542, + 419, + 555 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 542, + 505, + 556 + ], + "score": 1.0, + "content": ". By Theorem 1, we", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 554, + 506, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 147, + 567 + ], + "score": 1.0, + "content": "can write", + "type": "text" + }, + { + "bbox": [ + 147, + 555, + 205, + 566 + ], + "score": 0.9, + "content": "A _ { \\mathrm { 2 } } = U V C", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 554, + 234, + 567 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 235, + 554, + 361, + 567 + ], + "score": 0.92, + "content": "V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { V } } ) , { \\bf 0 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 554, + 381, + 567 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 381, + 554, + 461, + 567 + ], + "score": 0.91, + "content": "V _ { i } , i = 1 , \\dots , r , \\overline { { V } }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 554, + 506, + 567 + ], + "score": 1.0, + "content": "consist of", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 566, + 383, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 383, + 578 + ], + "score": 1.0, + "content": "orthonormal columns. Define the orthonormal block diagonal matrix", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 542, + 506, + 578 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 580, + 392, + 614 + ], + "lines": [ + { + "bbox": [ + 219, + 580, + 392, + 614 + ], + "spans": [ + { + "bbox": [ + 219, + 580, + 392, + 614 + ], + "score": 0.95, + "content": "\\pmb { S } ^ { \\top } : = \\operatorname { d i a g } \\left( \\begin{array} { l } { \\left[ \\pmb { V } _ { 1 } ^ { \\top } \\right] , \\cdots , \\left[ \\pmb { V } _ { r } ^ { \\top } \\right] , } \\\\ { \\left[ \\pmb { O } _ { 1 } ^ { \\top } \\right] } \\end{array} \\left[ \\begin{array} { l } { \\pmb { \\overline { { V } } } ^ { \\top } } \\\\ { \\pmb { \\overline { { O } } } _ { r } ^ { \\top } } \\end{array} \\right] , \\right) ,", + "type": "interline_equation", + "image_path": "89086882b1e53e581997ce41a0f170a9a2f8eddfc9bcb528222539461012caec.jpg" + } + ] + } + ], + "index": 32.5, + "virtual_lines": [ + { + "bbox": [ + 219, + 580, + 392, + 597.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 219, + 597.0, + 392, + 614.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 617, + 505, + 662 + ], + "lines": [ + { + "bbox": [ + 106, + 617, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 106, + 617, + 187, + 631 + ], + "score": 1.0, + "content": "where the matrices", + "type": "text" + }, + { + "bbox": [ + 187, + 617, + 251, + 630 + ], + "score": 0.91, + "content": "O _ { 1 } , \\cdots , O _ { r } , \\overline { { { O } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 617, + 505, + 631 + ], + "score": 1.0, + "content": "are such that each diagonal block forms an orthonormal sub-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 627, + 503, + 641 + ], + "spans": [ + { + "bbox": [ + 104, + 627, + 244, + 641 + ], + "score": 1.0, + "content": "matrix. By construction we have", + "type": "text" + }, + { + "bbox": [ + 245, + 628, + 438, + 641 + ], + "score": 0.89, + "content": "\\bar { \\pmb { S } } ^ { \\top } \\pmb { V } = [ \\mathrm { d i a g } ( \\pmb { I } ^ { m _ { 1 } \\times p _ { 1 } } , \\allowbreak \\bar { \\lambda } . . . , \\pmb { I } ^ { m _ { r } \\times p _ { r } } , \\pmb { I } ^ { \\bar { m } \\times \\bar { p } } ) , \\mathbf { 0 } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 627, + 470, + 641 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 470, + 629, + 503, + 639 + ], + "score": 0.89, + "content": "{ \\cal { I } } ^ { m _ { k } \\times p _ { k } }", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 104, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 104, + 639, + 201, + 653 + ], + "score": 1.0, + "content": "corresponds to the first", + "type": "text" + }, + { + "bbox": [ + 201, + 642, + 213, + 651 + ], + "score": 0.84, + "content": "p _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 639, + 340, + 653 + ], + "score": 1.0, + "content": "columns of the identity matrix", + "type": "text" + }, + { + "bbox": [ + 340, + 641, + 376, + 650 + ], + "score": 0.87, + "content": "I ^ { m _ { k } \\times m _ { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 639, + 408, + 653 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + }, + { + "bbox": [ + 408, + 641, + 422, + 651 + ], + "score": 0.84, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 639, + 505, + 653 + ], + "score": 1.0, + "content": "can be alternatively", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 650, + 371, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 148, + 662 + ], + "score": 1.0, + "content": "written as", + "type": "text" + }, + { + "bbox": [ + 148, + 650, + 222, + 662 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\pmb { A } _ { 2 } = \\pmb { U } \\pmb { S } \\pmb { S } ^ { \\top } \\pmb { V } \\pmb { C } , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 222, + 650, + 340, + 662 + ], + "score": 1.0, + "content": ". Also, denote the columns of", + "type": "text" + }, + { + "bbox": [ + 341, + 651, + 358, + 661 + ], + "score": 0.85, + "content": "{ \\pmb U } { \\pmb S }", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 650, + 371, + 662 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5, + "bbox_fs": [ + 104, + 617, + 505, + 662 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 666, + 416, + 681 + ], + "lines": [ + { + "bbox": [ + 194, + 666, + 416, + 681 + ], + "spans": [ + { + "bbox": [ + 194, + 666, + 416, + 681 + ], + "score": 0.89, + "content": "U S = [ \\mathbf { u } _ { 1 1 } ^ { s } , \\ldots , \\mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \\ldots , \\mathbf { u } _ { r 1 } ^ { s } , \\ldots , \\mathbf { u } _ { r p _ { r } } ^ { s } , \\bar { \\mathbf { u } } _ { 1 } ^ { s } , \\ldots , \\bar { \\mathbf { u } } _ { \\bar { p } } ^ { s } ] .", + "type": "interline_equation", + "image_path": "fe118131e19e36a646c9ae5478ef19f4387ef0052ffd1e75bd2bc504c6a51ac1.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 194, + 666, + 416, + 681 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 684, + 504, + 706 + ], + "lines": [ + { + "bbox": [ + 106, + 682, + 504, + 697 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 132, + 697 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 132, + 684, + 171, + 695 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 682, + 369, + 697 + ], + "score": 1.0, + "content": "is a non-optimal-order critical point, there exists", + "type": "text" + }, + { + "bbox": [ + 369, + 684, + 429, + 695 + ], + "score": 0.91, + "content": "1 \\leq i < j \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 682, + 468, + 697 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 468, + 685, + 504, + 695 + ], + "score": 0.89, + "content": "p _ { i } < m _ { i }", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 694, + 421, + 707 + ], + "spans": [ + { + "bbox": [ + 106, + 694, + 123, + 706 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 696, + 152, + 707 + ], + "score": 0.91, + "content": "p _ { j } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 694, + 336, + 706 + ], + "score": 1.0, + "content": ". Then, consider the following perturbation of", + "type": "text" + }, + { + "bbox": [ + 336, + 696, + 353, + 704 + ], + "score": 0.85, + "content": "{ \\boldsymbol { U } } { \\boldsymbol { S } }", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 694, + 392, + 706 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 393, + 696, + 416, + 705 + ], + "score": 0.88, + "content": "\\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 694, + 421, + 706 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 106, + 682, + 504, + 707 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 710, + 421, + 730 + ], + "lines": [ + { + "bbox": [ + 189, + 710, + 421, + 730 + ], + "spans": [ + { + "bbox": [ + 189, + 710, + 421, + 730 + ], + "score": 0.92, + "content": "\\widetilde { M } = \\left[ \\mathbf { u } _ { 1 1 } ^ { s } , \\ldots , \\mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \\ldots , \\frac { \\mathbf { u } _ { j 1 } ^ { s } + \\epsilon \\mathbf { u } _ { i ( p _ { i } + 1 ) } ^ { s } } { \\sqrt { 1 + \\epsilon ^ { 2 } } } , \\ldots \\bar { \\mathbf { u } } _ { 1 } ^ { s } , \\ldots , \\bar { \\mathbf { u } } _ { \\bar { p } } ^ { s } \\right] ,", + "type": "interline_equation", + "image_path": "10260925743050a4d7f357fd3e60b939748b669659d07dc381fa8b71d783fb1a.jpg" + } + ] + } + ], + "index": 41, + "virtual_lines": [ + { + "bbox": [ + 189, + 710, + 421, + 730 + ], + "spans": [], + "index": 41 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 79, + 506, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 333, + 95 + ], + "score": 1.0, + "content": "with which we further define the perturbation matrix", + "type": "text" + }, + { + "bbox": [ + 333, + 80, + 409, + 93 + ], + "score": 0.91, + "content": "{ \\widetilde A } _ { \\mathrm { 2 } } ~ = ~ { \\widetilde M } S ^ { \\intercal } V C", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 80, + 505, + 95 + ], + "score": 1.0, + "content": ". Also, let the pertur-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 166, + 109 + ], + "score": 1.0, + "content": "bation matrix", + "type": "text" + }, + { + "bbox": [ + 166, + 93, + 181, + 107 + ], + "score": 0.9, + "content": "\\widetilde { A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 94, + 309, + 109 + ], + "score": 1.0, + "content": "be generated by eq. (1) with", + "type": "text" + }, + { + "bbox": [ + 310, + 94, + 356, + 106 + ], + "score": 0.92, + "content": "\\smash { U \\gets \\widetilde { M } }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 94, + 378, + 109 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 378, + 95, + 431, + 106 + ], + "score": 0.9, + "content": "V S ^ { \\top } V", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 94, + 506, + 109 + ], + "score": 1.0, + "content": ". Note that with", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 106, + 505, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 108, + 181, + 122 + ], + "score": 1.0, + "content": "this construction,", + "type": "text" + }, + { + "bbox": [ + 181, + 106, + 221, + 120 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 108, + 443, + 122 + ], + "score": 1.0, + "content": "satisfies eq. (25), which further implies eq. (27) for", + "type": "text" + }, + { + "bbox": [ + 443, + 106, + 482, + 121 + ], + "score": 0.94, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 108, + 505, + 122 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 118, + 487, + 138 + ], + "spans": [ + { + "bbox": [ + 107, + 119, + 227, + 137 + ], + "score": 0.93, + "content": "\\widetilde { A } _ { 2 } \\widetilde { A } _ { 1 } X = \\mathcal { P } _ { \\mathrm { c o l } ( \\widetilde { A } _ { 2 } ) } Y X ^ { \\dagger } X", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 118, + 366, + 138 + ], + "score": 1.0, + "content": ". Thus, eq. (28) holds for the point", + "type": "text" + }, + { + "bbox": [ + 366, + 119, + 405, + 134 + ], + "score": 0.94, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 118, + 487, + 138 + ], + "score": 1.0, + "content": ", and we obtain that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "interline_equation", + "bbox": [ + 183, + 142, + 427, + 217 + ], + "lines": [ + { + "bbox": [ + 183, + 142, + 427, + 217 + ], + "spans": [ + { + "bbox": [ + 183, + 142, + 427, + 217 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\mathcal { L } ( \\tilde { A } _ { 2 } , \\tilde { A } _ { 1 } ) = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\tilde { A } _ { 2 } ) } \\Lambda ) } \\\\ & { \\quad \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\tilde { A } _ { 2 } ) } S ^ { \\top } \\Lambda S ) } \\\\ & { \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } S ^ { \\top } \\Lambda S ) } \\\\ & { \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } \\Lambda ) , } \\end{array}", + "type": "interline_equation", + "image_path": "17abaa8a1594cef5136ef67bc611fce2224ded3717a275a6eb42aba5543c0695.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 183, + 142, + 427, + 157.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 183, + 157.0, + 427, + 172.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 183, + 172.0, + 427, + 187.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 183, + 187.0, + 427, + 202.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 183, + 202.0, + 427, + 217.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 222, + 504, + 262 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 506, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 270, + 237 + ], + "score": 1.0, + "content": "where the last equality uses the fact that", + "type": "text" + }, + { + "bbox": [ + 270, + 223, + 320, + 235 + ], + "score": 0.91, + "content": "{ \\cal S } ^ { \\top } \\pmb { { \\Lambda } } { \\cal S } = \\pmb { { \\Lambda } }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 222, + 506, + 237 + ], + "score": 1.0, + "content": ", as can be observed from the block pattern of", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 235, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 107, + 237, + 115, + 247 + ], + "score": 0.78, + "content": "\\pmb { S }", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 235, + 237, + 249 + ], + "score": 1.0, + "content": "and the multiplicity pattern of", + "type": "text" + }, + { + "bbox": [ + 238, + 237, + 246, + 247 + ], + "score": 0.74, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 235, + 364, + 249 + ], + "score": 1.0, + "content": ". Also, by the construction of", + "type": "text" + }, + { + "bbox": [ + 365, + 235, + 378, + 247 + ], + "score": 0.87, + "content": "\\widetilde { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 235, + 443, + 249 + ], + "score": 1.0, + "content": "and the form of", + "type": "text" + }, + { + "bbox": [ + 443, + 236, + 464, + 247 + ], + "score": 0.89, + "content": "S ^ { \\top } V", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 235, + 505, + 249 + ], + "score": 1.0, + "content": ", a careful", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 247, + 495, + 264 + ], + "spans": [ + { + "bbox": [ + 104, + 247, + 232, + 264 + ], + "score": 1.0, + "content": "calculation shows that only the", + "type": "text" + }, + { + "bbox": [ + 232, + 249, + 246, + 260 + ], + "score": 0.86, + "content": "i , j", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 247, + 345, + 264 + ], + "score": 1.0, + "content": "-th diagonal elements of", + "type": "text" + }, + { + "bbox": [ + 345, + 249, + 415, + 263 + ], + "score": 0.91, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 247, + 495, + 264 + ], + "score": 1.0, + "content": "have changed, i.e.,", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 269, + 392, + 303 + ], + "lines": [ + { + "bbox": [ + 219, + 269, + 392, + 303 + ], + "spans": [ + { + "bbox": [ + 219, + 269, + 392, + 303 + ], + "score": 0.94, + "content": "\\left[ \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } \\right] _ { k } = \\left\\{ \\begin{array} { l l } { \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } , } & { \\mathrm { i f ~ } k = i } \\\\ { \\frac { 1 } { 1 + \\epsilon ^ { 2 } } , } & { \\mathrm { i f ~ } k = j } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "8383a141720189e7ec202dfb58c268e5dac4a957927d30cab6362fbbb8df0dc6.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 219, + 269, + 392, + 286.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 219, + 286.0, + 392, + 303.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 504, + 321 + ], + "lines": [ + { + "bbox": [ + 106, + 308, + 504, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 159, + 322 + ], + "score": 1.0, + "content": "As the index", + "type": "text" + }, + { + "bbox": [ + 159, + 310, + 173, + 320 + ], + "score": 0.89, + "content": "i , j", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 308, + 308, + 322 + ], + "score": 1.0, + "content": "correspond to the singular values", + "type": "text" + }, + { + "bbox": [ + 308, + 311, + 333, + 321 + ], + "score": 0.89, + "content": "\\sigma _ { i } , \\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 308, + 405, + 322 + ], + "score": 1.0, + "content": ", respectively, and", + "type": "text" + }, + { + "bbox": [ + 406, + 311, + 438, + 321 + ], + "score": 0.91, + "content": "\\sigma _ { i } > \\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 308, + 504, + 322 + ], + "score": 1.0, + "content": ", one obtain that", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 185, + 327, + 425, + 345 + ], + "lines": [ + { + "bbox": [ + 185, + 327, + 425, + 345 + ], + "spans": [ + { + "bbox": [ + 185, + 327, + 425, + 345 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { L } ( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } ) = \\mathcal { L } ( A _ { 2 } , A _ { 1 } ) - \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } ( \\sigma _ { i } - \\sigma _ { j } ) < \\mathcal { L } ( A _ { 2 } , A _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "0180113e2d5588f84c55af64ee9b5757f1df51df247f349f52104a2bc9d020fe.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 185, + 327, + 425, + 345 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 353, + 505, + 405 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 246, + 369 + ], + "score": 1.0, + "content": "Thus, the construction of the point", + "type": "text" + }, + { + "bbox": [ + 247, + 352, + 286, + 367 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 352, + 446, + 369 + ], + "score": 1.0, + "content": "achieves a lower function value for any", + "type": "text" + }, + { + "bbox": [ + 446, + 356, + 469, + 366 + ], + "score": 0.89, + "content": "\\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 352, + 506, + 369 + ], + "score": 1.0, + "content": ". Letting", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 366, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 136, + 379 + ], + "score": 0.87, + "content": "\\epsilon 0", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 367, + 211, + 382 + ], + "score": 1.0, + "content": "and noticing that", + "type": "text" + }, + { + "bbox": [ + 211, + 366, + 225, + 379 + ], + "score": 0.88, + "content": "\\widetilde { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 367, + 309, + 382 + ], + "score": 1.0, + "content": "is a perturbation of", + "type": "text" + }, + { + "bbox": [ + 309, + 369, + 327, + 379 + ], + "score": 0.82, + "content": "_ { U S }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 367, + 372, + 382 + ], + "score": 1.0, + "content": ", the point", + "type": "text" + }, + { + "bbox": [ + 372, + 366, + 411, + 381 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 367, + 505, + 382 + ], + "score": 1.0, + "content": "can be in an arbitrary", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 380, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 176, + 394 + ], + "score": 1.0, + "content": "neighborhood of", + "type": "text" + }, + { + "bbox": [ + 177, + 381, + 215, + 394 + ], + "score": 0.92, + "content": "( A _ { 2 } , A _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 381, + 289, + 394 + ], + "score": 1.0, + "content": ". Lastly, note that", + "type": "text" + }, + { + "bbox": [ + 289, + 380, + 385, + 394 + ], + "score": 0.9, + "content": "\\mathrm { r a n k } ( \\widetilde { A } _ { 2 } ) = \\mathrm { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 381, + 506, + 394 + ], + "score": 1.0, + "content": ". This completes the proof of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 392, + 137, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 137, + 405 + ], + "score": 1.0, + "content": "item 1.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 409, + 506, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 378, + 421 + ], + "score": 1.0, + "content": "Next, we prove item 2. Consider an optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 379, + 410, + 417, + 422 + ], + "score": 0.93, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 410, + 453, + 421 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + }, + { + "bbox": [ + 453, + 410, + 467, + 421 + ], + "score": 0.87, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 410, + 505, + 421 + ], + "score": 1.0, + "content": "must be", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 421, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 273, + 433 + ], + "score": 1.0, + "content": "non-full rank, since otherwise a full rank", + "type": "text" + }, + { + "bbox": [ + 273, + 421, + 287, + 432 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 421, + 506, + 433 + ], + "score": 1.0, + "content": "with optimal order corresponds to a global minimizer", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 249, + 431, + 503, + 469 + ], + "spans": [ + { + "bbox": [ + 249, + 431, + 282, + 469 + ], + "score": 1.0, + "content": "ts some e necess. Using t", + "type": "text" + }, + { + "bbox": [ + 282, + 432, + 311, + 443 + ], + "score": 0.91, + "content": "k \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 431, + 334, + 469 + ], + "score": 1.0, + "content": "suchm of ressio", + "type": "text" + }, + { + "bbox": [ + 349, + 431, + 353, + 469 + ], + "score": 1.0, + "content": "t q", + "type": "text" + }, + { + "bbox": [ + 353, + 433, + 503, + 444 + ], + "score": 0.89, + "content": "p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 443, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 234, + 457 + ], + "score": 0.88, + "content": "\\mathrm { r a n k } ( A _ { 2 } ) - \\textstyle \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\ \\leq \\ m _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 445, + 349, + 456 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 445, + 456, + 456 + ], + "score": 0.89, + "content": "\\mathbf { \\nabla } A _ { 2 } \\ = \\ U V C", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 445, + 505, + 456 + ], + "score": 0.85, + "content": "V =", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 107, + 457, + 248, + 468 + ], + "spans": [ + { + "bbox": [ + 107, + 457, + 248, + 468 + ], + "score": 0.84, + "content": "[ \\mathrm { d i a g } ( V _ { 1 } , \\dots , V _ { k } ) , \\mathbf { 0 } ] : = [ V _ { \\mathrm { d i a g } } , \\mathbf { 0 } ]", + "type": "inline_equation" + } + ], + "index": 24 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 474, + 455, + 502 + ], + "lines": [ + { + "bbox": [ + 155, + 474, + 455, + 502 + ], + "spans": [ + { + "bbox": [ + 155, + 474, + 455, + 502 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\pmb { A } _ { 1 } = C ^ { - 1 } \\Bigg ( [ { \\pmb { U } } _ { \\mathbf { \\mathscr { C } } _ { \\mathbf { i } \\mathrm { i } \\mathbf { a } _ { \\mathbf { g } } } } ] ^ { \\top } { \\pmb { Y } } { \\pmb { X } } ^ { \\dagger } ] + C \\pmb { L } _ { 1 } - [ ( C \\pmb { L } _ { 1 } ) _ { 1 : \\operatorname { r a n k } ( { \\pmb { A } } _ { 2 } ) , : } { \\pmb { X } } { \\pmb { X } } ^ { \\dagger } ] \\Bigg ) . } \\end{array}", + "type": "interline_equation", + "image_path": "3fe91d1bec98584c30521986ecde66778223b62aae40a67d2bba5d748cc99d12.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 155, + 474, + 455, + 502 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 508, + 503, + 531 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 504, + 521 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 415, + 521 + ], + "score": 1.0, + "content": "We now specify our perturbation scheme. Recalling the orthonormal matrix", + "type": "text" + }, + { + "bbox": [ + 416, + 509, + 424, + 518 + ], + "score": 0.82, + "content": "_ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 508, + 504, + 521 + ], + "score": 1.0, + "content": "defined in eq. (29).", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 519, + 353, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 312, + 532 + ], + "score": 1.0, + "content": "Then, we consider the following matrices for some", + "type": "text" + }, + { + "bbox": [ + 312, + 520, + 353, + 531 + ], + "score": 0.9, + "content": "\\epsilon _ { 1 } , \\epsilon _ { 2 } > 0", + "type": "inline_equation" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "interline_equation", + "bbox": [ + 154, + 537, + 457, + 613 + ], + "lines": [ + { + "bbox": [ + 154, + 537, + 457, + 613 + ], + "spans": [ + { + "bbox": [ + 154, + 537, + 457, + 613 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\widetilde { A } _ { 2 } = \\displaystyle [ U V _ { \\mathrm { d i a g } } , \\epsilon _ { 2 } U S _ { : , q } , 0 ] C , \\mathrm { ~ w h e r e ~ } q = \\sum _ { i = 1 } ^ { k - 1 } m _ { i } + p _ { k } + 1 , } \\\\ & { \\widetilde { A } _ { 1 } = C ^ { - 1 } \\bigg ( \\left[ \\begin{array} { c } { ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } Y X ^ { \\dag } } \\\\ { 0 } \\end{array} \\right] + C L _ { 1 } - \\left[ \\begin{array} { c } { ( C L _ { 1 } ) _ { \\mathrm { 1 : r a n k } ( A _ { 2 } ) , : } X X ^ { \\dag } } \\\\ { \\epsilon _ { 1 } ( U S _ { : , q } ) ^ { \\top } Y X ^ { \\dag } } \\\\ { 0 } \\end{array} \\right] \\bigg ) . } \\end{array}", + "type": "interline_equation", + "image_path": "4c1068fdec2f973410986fbc4c67e6ec876f60c3cfec8ab6bdfe4d92c8860cd7.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 154, + 537, + 457, + 562.3333333333334 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 154, + 562.3333333333334, + 457, + 587.6666666666667 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 154, + 587.6666666666667, + 457, + 613.0000000000001 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 105, + 618, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 209, + 635 + ], + "score": 1.0, + "content": "Our goal is to show that", + "type": "text" + }, + { + "bbox": [ + 209, + 619, + 316, + 633 + ], + "score": 0.92, + "content": "\\mathcal { L } ( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } ) < \\mathcal { L } ( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 618, + 333, + 635 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 333, + 622, + 379, + 632 + ], + "score": 0.91, + "content": "\\epsilon _ { 1 } , \\epsilon _ { 2 } 0", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 618, + 506, + 635 + ], + "score": 1.0, + "content": ". For this purpose, we need to", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 631, + 457, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 457, + 644 + ], + "score": 1.0, + "content": "utilize the condition of critical points in eq. (3), which can be equivalently expressed as", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "interline_equation", + "bbox": [ + 159, + 648, + 452, + 733 + ], + "lines": [ + { + "bbox": [ + 159, + 648, + 452, + 733 + ], + "spans": [ + { + "bbox": [ + 159, + 648, + 452, + 733 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } ( I - V ^ { \\top } V ) = 0 } \\\\ { \\stackrel { ( i ) } { \\Leftrightarrow } } & { \\left[ ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X \\right] Y ^ { \\top } ( I - U V ( U V ) ^ { \\top } ) = 0 } \\\\ { \\Leftrightarrow } & { ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \\top } ( I - U V ( U V ) ^ { \\top } ) = 0 } \\\\ { \\stackrel { ( i i ) } { \\Leftrightarrow } } & { ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \\top } ( I - U S _ { : , 1 : ( q - 1 ) } ( U S _ { : , 1 : ( q - 1 ) } ) ^ { \\top } ) = 0 } \\end{array}", + "type": "interline_equation", + "image_path": "3bc204b39e518d62fe77e04b7c1f235a36318e3792e6bac4d3c92aa985b52d64.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 159, + 648, + 452, + 676.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 159, + 676.3333333333334, + 452, + 704.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 159, + 704.6666666666667, + 452, + 733.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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": [ + 105, + 79, + 506, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 333, + 95 + ], + "score": 1.0, + "content": "with which we further define the perturbation matrix", + "type": "text" + }, + { + "bbox": [ + 333, + 80, + 409, + 93 + ], + "score": 0.91, + "content": "{ \\widetilde A } _ { \\mathrm { 2 } } ~ = ~ { \\widetilde M } S ^ { \\intercal } V C", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 80, + 505, + 95 + ], + "score": 1.0, + "content": ". Also, let the pertur-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 506, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 166, + 109 + ], + "score": 1.0, + "content": "bation matrix", + "type": "text" + }, + { + "bbox": [ + 166, + 93, + 181, + 107 + ], + "score": 0.9, + "content": "\\widetilde { A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 94, + 309, + 109 + ], + "score": 1.0, + "content": "be generated by eq. (1) with", + "type": "text" + }, + { + "bbox": [ + 310, + 94, + 356, + 106 + ], + "score": 0.92, + "content": "\\smash { U \\gets \\widetilde { M } }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 94, + 378, + 109 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 378, + 95, + 431, + 106 + ], + "score": 0.9, + "content": "V S ^ { \\top } V", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 94, + 506, + 109 + ], + "score": 1.0, + "content": ". Note that with", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 106, + 505, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 108, + 181, + 122 + ], + "score": 1.0, + "content": "this construction,", + "type": "text" + }, + { + "bbox": [ + 181, + 106, + 221, + 120 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 108, + 443, + 122 + ], + "score": 1.0, + "content": "satisfies eq. (25), which further implies eq. (27) for", + "type": "text" + }, + { + "bbox": [ + 443, + 106, + 482, + 121 + ], + "score": 0.94, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 108, + 505, + 122 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 118, + 487, + 138 + ], + "spans": [ + { + "bbox": [ + 107, + 119, + 227, + 137 + ], + "score": 0.93, + "content": "\\widetilde { A } _ { 2 } \\widetilde { A } _ { 1 } X = \\mathcal { P } _ { \\mathrm { c o l } ( \\widetilde { A } _ { 2 } ) } Y X ^ { \\dagger } X", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 118, + 366, + 138 + ], + "score": 1.0, + "content": ". Thus, eq. (28) holds for the point", + "type": "text" + }, + { + "bbox": [ + 366, + 119, + 405, + 134 + ], + "score": 0.94, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 118, + 487, + 138 + ], + "score": 1.0, + "content": ", and we obtain that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5, + "bbox_fs": [ + 105, + 80, + 506, + 138 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 183, + 142, + 427, + 217 + ], + "lines": [ + { + "bbox": [ + 183, + 142, + 427, + 217 + ], + "spans": [ + { + "bbox": [ + 183, + 142, + 427, + 217 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\mathcal { L } ( \\tilde { A } _ { 2 } , \\tilde { A } _ { 1 } ) = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\tilde { A } _ { 2 } ) } \\Lambda ) } \\\\ & { \\quad \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\tilde { A } _ { 2 } ) } S ^ { \\top } \\Lambda S ) } \\\\ & { \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } S ^ { \\top } \\Lambda S ) } \\\\ & { \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } \\Lambda ) , } \\end{array}", + "type": "interline_equation", + "image_path": "17abaa8a1594cef5136ef67bc611fce2224ded3717a275a6eb42aba5543c0695.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 183, + 142, + 427, + 157.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 183, + 157.0, + 427, + 172.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 183, + 172.0, + 427, + 187.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 183, + 187.0, + 427, + 202.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 183, + 202.0, + 427, + 217.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 222, + 504, + 262 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 506, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 270, + 237 + ], + "score": 1.0, + "content": "where the last equality uses the fact that", + "type": "text" + }, + { + "bbox": [ + 270, + 223, + 320, + 235 + ], + "score": 0.91, + "content": "{ \\cal S } ^ { \\top } \\pmb { { \\Lambda } } { \\cal S } = \\pmb { { \\Lambda } }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 222, + 506, + 237 + ], + "score": 1.0, + "content": ", as can be observed from the block pattern of", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 235, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 107, + 237, + 115, + 247 + ], + "score": 0.78, + "content": "\\pmb { S }", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 235, + 237, + 249 + ], + "score": 1.0, + "content": "and the multiplicity pattern of", + "type": "text" + }, + { + "bbox": [ + 238, + 237, + 246, + 247 + ], + "score": 0.74, + "content": "\\pmb { \\Lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 235, + 364, + 249 + ], + "score": 1.0, + "content": ". Also, by the construction of", + "type": "text" + }, + { + "bbox": [ + 365, + 235, + 378, + 247 + ], + "score": 0.87, + "content": "\\widetilde { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 235, + 443, + 249 + ], + "score": 1.0, + "content": "and the form of", + "type": "text" + }, + { + "bbox": [ + 443, + 236, + 464, + 247 + ], + "score": 0.89, + "content": "S ^ { \\top } V", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 235, + 505, + 249 + ], + "score": 1.0, + "content": ", a careful", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 247, + 495, + 264 + ], + "spans": [ + { + "bbox": [ + 104, + 247, + 232, + 264 + ], + "score": 1.0, + "content": "calculation shows that only the", + "type": "text" + }, + { + "bbox": [ + 232, + 249, + 246, + 260 + ], + "score": 0.86, + "content": "i , j", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 247, + 345, + 264 + ], + "score": 1.0, + "content": "-th diagonal elements of", + "type": "text" + }, + { + "bbox": [ + 345, + 249, + 415, + 263 + ], + "score": 0.91, + "content": "\\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 247, + 495, + 264 + ], + "score": 1.0, + "content": "have changed, i.e.,", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 104, + 222, + 506, + 264 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 219, + 269, + 392, + 303 + ], + "lines": [ + { + "bbox": [ + 219, + 269, + 392, + 303 + ], + "spans": [ + { + "bbox": [ + 219, + 269, + 392, + 303 + ], + "score": 0.94, + "content": "\\left[ \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } \\right] _ { k } = \\left\\{ \\begin{array} { l l } { \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } , } & { \\mathrm { i f ~ } k = i } \\\\ { \\frac { 1 } { 1 + \\epsilon ^ { 2 } } , } & { \\mathrm { i f ~ } k = j } \\end{array} \\right.", + "type": "interline_equation", + "image_path": "8383a141720189e7ec202dfb58c268e5dac4a957927d30cab6362fbbb8df0dc6.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 219, + 269, + 392, + 286.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 219, + 286.0, + 392, + 303.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 308, + 504, + 321 + ], + "lines": [ + { + "bbox": [ + 106, + 308, + 504, + 322 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 159, + 322 + ], + "score": 1.0, + "content": "As the index", + "type": "text" + }, + { + "bbox": [ + 159, + 310, + 173, + 320 + ], + "score": 0.89, + "content": "i , j", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 308, + 308, + 322 + ], + "score": 1.0, + "content": "correspond to the singular values", + "type": "text" + }, + { + "bbox": [ + 308, + 311, + 333, + 321 + ], + "score": 0.89, + "content": "\\sigma _ { i } , \\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 308, + 405, + 322 + ], + "score": 1.0, + "content": ", respectively, and", + "type": "text" + }, + { + "bbox": [ + 406, + 311, + 438, + 321 + ], + "score": 0.91, + "content": "\\sigma _ { i } > \\sigma _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 308, + 504, + 322 + ], + "score": 1.0, + "content": ", one obtain that", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 308, + 504, + 322 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 185, + 327, + 425, + 345 + ], + "lines": [ + { + "bbox": [ + 185, + 327, + 425, + 345 + ], + "spans": [ + { + "bbox": [ + 185, + 327, + 425, + 345 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { L } ( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } ) = \\mathcal { L } ( A _ { 2 } , A _ { 1 } ) - \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } ( \\sigma _ { i } - \\sigma _ { j } ) < \\mathcal { L } ( A _ { 2 } , A _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "0180113e2d5588f84c55af64ee9b5757f1df51df247f349f52104a2bc9d020fe.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 185, + 327, + 425, + 345 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 353, + 505, + 405 + ], + "lines": [ + { + "bbox": [ + 105, + 352, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 246, + 369 + ], + "score": 1.0, + "content": "Thus, the construction of the point", + "type": "text" + }, + { + "bbox": [ + 247, + 352, + 286, + 367 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 352, + 446, + 369 + ], + "score": 1.0, + "content": "achieves a lower function value for any", + "type": "text" + }, + { + "bbox": [ + 446, + 356, + 469, + 366 + ], + "score": 0.89, + "content": "\\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 352, + 506, + 369 + ], + "score": 1.0, + "content": ". Letting", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 366, + 505, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 136, + 379 + ], + "score": 0.87, + "content": "\\epsilon 0", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 367, + 211, + 382 + ], + "score": 1.0, + "content": "and noticing that", + "type": "text" + }, + { + "bbox": [ + 211, + 366, + 225, + 379 + ], + "score": 0.88, + "content": "\\widetilde { M }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 367, + 309, + 382 + ], + "score": 1.0, + "content": "is a perturbation of", + "type": "text" + }, + { + "bbox": [ + 309, + 369, + 327, + 379 + ], + "score": 0.82, + "content": "_ { U S }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 367, + 372, + 382 + ], + "score": 1.0, + "content": ", the point", + "type": "text" + }, + { + "bbox": [ + 372, + 366, + 411, + 381 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 367, + 505, + 382 + ], + "score": 1.0, + "content": "can be in an arbitrary", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 380, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 176, + 394 + ], + "score": 1.0, + "content": "neighborhood of", + "type": "text" + }, + { + "bbox": [ + 177, + 381, + 215, + 394 + ], + "score": 0.92, + "content": "( A _ { 2 } , A _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 381, + 289, + 394 + ], + "score": 1.0, + "content": ". Lastly, note that", + "type": "text" + }, + { + "bbox": [ + 289, + 380, + 385, + 394 + ], + "score": 0.9, + "content": "\\mathrm { r a n k } ( \\widetilde { A } _ { 2 } ) = \\mathrm { r a n k } ( A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 381, + 506, + 394 + ], + "score": 1.0, + "content": ". This completes the proof of", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 392, + 137, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 137, + 405 + ], + "score": 1.0, + "content": "item 1.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 352, + 506, + 405 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 409, + 506, + 469 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 378, + 421 + ], + "score": 1.0, + "content": "Next, we prove item 2. Consider an optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 379, + 410, + 417, + 422 + ], + "score": 0.93, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 417, + 410, + 453, + 421 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + }, + { + "bbox": [ + 453, + 410, + 467, + 421 + ], + "score": 0.87, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 410, + 505, + 421 + ], + "score": 1.0, + "content": "must be", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 421, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 273, + 433 + ], + "score": 1.0, + "content": "non-full rank, since otherwise a full rank", + "type": "text" + }, + { + "bbox": [ + 273, + 421, + 287, + 432 + ], + "score": 0.89, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 421, + 506, + 433 + ], + "score": 1.0, + "content": "with optimal order corresponds to a global minimizer", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 249, + 431, + 503, + 469 + ], + "spans": [ + { + "bbox": [ + 249, + 431, + 282, + 469 + ], + "score": 1.0, + "content": "ts some e necess. Using t", + "type": "text" + }, + { + "bbox": [ + 282, + 432, + 311, + 443 + ], + "score": 0.91, + "content": "k \\leq r", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 431, + 334, + 469 + ], + "score": 1.0, + "content": "suchm of ressio", + "type": "text" + }, + { + "bbox": [ + 349, + 431, + 353, + 469 + ], + "score": 1.0, + "content": "t q", + "type": "text" + }, + { + "bbox": [ + 353, + 433, + 503, + 444 + ], + "score": 0.89, + "content": "p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 443, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 106, + 443, + 234, + 457 + ], + "score": 0.88, + "content": "\\mathrm { r a n k } ( A _ { 2 } ) - \\textstyle \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\ \\leq \\ m _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 445, + 349, + 456 + ], + "score": 0.88, + "content": "A _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 396, + 445, + 456, + 456 + ], + "score": 0.89, + "content": "\\mathbf { \\nabla } A _ { 2 } \\ = \\ U V C", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 445, + 505, + 456 + ], + "score": 0.85, + "content": "V =", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 107, + 457, + 248, + 468 + ], + "spans": [ + { + "bbox": [ + 107, + 457, + 248, + 468 + ], + "score": 0.84, + "content": "[ \\mathrm { d i a g } ( V _ { 1 } , \\dots , V _ { k } ) , \\mathbf { 0 } ] : = [ V _ { \\mathrm { d i a g } } , \\mathbf { 0 } ]", + "type": "inline_equation" + } + ], + "index": 24 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 410, + 506, + 469 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 474, + 455, + 502 + ], + "lines": [ + { + "bbox": [ + 155, + 474, + 455, + 502 + ], + "spans": [ + { + "bbox": [ + 155, + 474, + 455, + 502 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\pmb { A } _ { 1 } = C ^ { - 1 } \\Bigg ( [ { \\pmb { U } } _ { \\mathbf { \\mathscr { C } } _ { \\mathbf { i } \\mathrm { i } \\mathbf { a } _ { \\mathbf { g } } } } ] ^ { \\top } { \\pmb { Y } } { \\pmb { X } } ^ { \\dagger } ] + C \\pmb { L } _ { 1 } - [ ( C \\pmb { L } _ { 1 } ) _ { 1 : \\operatorname { r a n k } ( { \\pmb { A } } _ { 2 } ) , : } { \\pmb { X } } { \\pmb { X } } ^ { \\dagger } ] \\Bigg ) . } \\end{array}", + "type": "interline_equation", + "image_path": "3fe91d1bec98584c30521986ecde66778223b62aae40a67d2bba5d748cc99d12.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 155, + 474, + 455, + 502 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 508, + 503, + 531 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 504, + 521 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 415, + 521 + ], + "score": 1.0, + "content": "We now specify our perturbation scheme. Recalling the orthonormal matrix", + "type": "text" + }, + { + "bbox": [ + 416, + 509, + 424, + 518 + ], + "score": 0.82, + "content": "_ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 508, + 504, + 521 + ], + "score": 1.0, + "content": "defined in eq. (29).", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 519, + 353, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 519, + 312, + 532 + ], + "score": 1.0, + "content": "Then, we consider the following matrices for some", + "type": "text" + }, + { + "bbox": [ + 312, + 520, + 353, + 531 + ], + "score": 0.9, + "content": "\\epsilon _ { 1 } , \\epsilon _ { 2 } > 0", + "type": "inline_equation" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 508, + 504, + 532 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 154, + 537, + 457, + 613 + ], + "lines": [ + { + "bbox": [ + 154, + 537, + 457, + 613 + ], + "spans": [ + { + "bbox": [ + 154, + 537, + 457, + 613 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\widetilde { A } _ { 2 } = \\displaystyle [ U V _ { \\mathrm { d i a g } } , \\epsilon _ { 2 } U S _ { : , q } , 0 ] C , \\mathrm { ~ w h e r e ~ } q = \\sum _ { i = 1 } ^ { k - 1 } m _ { i } + p _ { k } + 1 , } \\\\ & { \\widetilde { A } _ { 1 } = C ^ { - 1 } \\bigg ( \\left[ \\begin{array} { c } { ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } Y X ^ { \\dag } } \\\\ { 0 } \\end{array} \\right] + C L _ { 1 } - \\left[ \\begin{array} { c } { ( C L _ { 1 } ) _ { \\mathrm { 1 : r a n k } ( A _ { 2 } ) , : } X X ^ { \\dag } } \\\\ { \\epsilon _ { 1 } ( U S _ { : , q } ) ^ { \\top } Y X ^ { \\dag } } \\\\ { 0 } \\end{array} \\right] \\bigg ) . } \\end{array}", + "type": "interline_equation", + "image_path": "4c1068fdec2f973410986fbc4c67e6ec876f60c3cfec8ab6bdfe4d92c8860cd7.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 154, + 537, + 457, + 562.3333333333334 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 154, + 562.3333333333334, + 457, + 587.6666666666667 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 154, + 587.6666666666667, + 457, + 613.0000000000001 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 105, + 618, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 209, + 635 + ], + "score": 1.0, + "content": "Our goal is to show that", + "type": "text" + }, + { + "bbox": [ + 209, + 619, + 316, + 633 + ], + "score": 0.92, + "content": "\\mathcal { L } ( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } ) < \\mathcal { L } ( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 618, + 333, + 635 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 333, + 622, + 379, + 632 + ], + "score": 0.91, + "content": "\\epsilon _ { 1 } , \\epsilon _ { 2 } 0", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 618, + 506, + 635 + ], + "score": 1.0, + "content": ". For this purpose, we need to", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 631, + 457, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 457, + 644 + ], + "score": 1.0, + "content": "utilize the condition of critical points in eq. (3), which can be equivalently expressed as", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 618, + 506, + 644 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 159, + 648, + 452, + 733 + ], + "lines": [ + { + "bbox": [ + 159, + 648, + 452, + 733 + ], + "spans": [ + { + "bbox": [ + 159, + 648, + 452, + 733 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } ( I - V ^ { \\top } V ) = 0 } \\\\ { \\stackrel { ( i ) } { \\Leftrightarrow } } & { \\left[ ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X \\right] Y ^ { \\top } ( I - U V ( U V ) ^ { \\top } ) = 0 } \\\\ { \\Leftrightarrow } & { ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \\top } ( I - U V ( U V ) ^ { \\top } ) = 0 } \\\\ { \\stackrel { ( i i ) } { \\Leftrightarrow } } & { ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \\top } ( I - U S _ { : , 1 : ( q - 1 ) } ( U S _ { : , 1 : ( q - 1 ) } ) ^ { \\top } ) = 0 } \\end{array}", + "type": "interline_equation", + "image_path": "3bc204b39e518d62fe77e04b7c1f235a36318e3792e6bac4d3c92aa985b52d64.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 159, + 648, + 452, + 676.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 159, + 676.3333333333334, + 452, + 704.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 159, + 704.6666666666667, + 452, + 733.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 81, + 505, + 119 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 480, + 95 + ], + "score": 1.0, + "content": "where (i) follows by taking the transpose and then simplifying, and (ii) uses the fact that", + "type": "text" + }, + { + "bbox": [ + 480, + 82, + 505, + 93 + ], + "score": 0.86, + "content": "V =", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 91, + 506, + 109 + ], + "spans": [ + { + "bbox": [ + 107, + 93, + 190, + 106 + ], + "score": 0.89, + "content": "S S ^ { \\top } V ~ = ~ S _ { : , 1 : ( q - 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 91, + 506, + 109 + ], + "score": 1.0, + "content": "in the case of optimal-order critical point. Calculating the function value at", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 107, + 105, + 210, + 120 + ], + "spans": [ + { + "bbox": [ + 107, + 105, + 146, + 120 + ], + "score": 0.9, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 106, + 210, + 120 + ], + "score": 1.0, + "content": ", we obtain that", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 123, + 482, + 204 + ], + "lines": [ + { + "bbox": [ + 129, + 123, + 482, + 204 + ], + "spans": [ + { + "bbox": [ + 129, + 123, + 482, + 204 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { L } ( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } ) = \\frac { 1 } { 2 } \\| \\underbrace { U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } Y X ^ { \\dag } X } _ { Q } } \\\\ & { \\quad \\quad \\quad + \\underbrace { \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X + \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } Y X ^ { \\dag } X } _ { P } - Y \\| _ { F } ^ { 2 } } \\\\ & { \\quad \\quad \\quad = \\mathcal { L } ( A _ { 1 } , A _ { 2 } ) + \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] . } \\end{array}", + "type": "interline_equation", + "image_path": "e33607a6c8d52b4a6d497459a7f102d3b80bb6368573ab813f2278f393b64c1a.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 129, + 123, + 482, + 150.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 129, + 150.0, + 482, + 177.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 129, + 177.0, + 482, + 204.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 491, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 206, + 493, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 206, + 493, + 220 + ], + "score": 1.0, + "content": "We next simplify the above three trace terms using eq. (31). For the first trace term, observe that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 128, + 222, + 486, + 328 + ], + "lines": [ + { + "bbox": [ + 128, + 222, + 486, + 328 + ], + "spans": [ + { + "bbox": [ + 128, + 222, + 486, + 328 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\mathrm { T r } ( P P ^ { \\top } ) = \\mathrm { T r } ( \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \\top } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } + \\mathrm { T r } ( \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\overset { ( i ) } { = } \\mathrm { T r } ( \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \\top } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } + \\mathrm { T r } ( \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } = \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , ) } ^ { \\top } + \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( S _ { : , q } ^ { \\top } \\Lambda S _ { : , q } ) } \\end{array}", + "type": "interline_equation", + "image_path": "31e4304073c36ec1316988b1ba5623629a01b30d1add4a630b7dff4f5e810d04.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 128, + 222, + 486, + 257.3333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 128, + 257.3333333333333, + 486, + 292.66666666666663 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 128, + 292.66666666666663, + 486, + 327.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 330, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 248, + 345 + ], + "score": 1.0, + "content": "where (i) follows from eq. (31) as", + "type": "text" + }, + { + "bbox": [ + 248, + 331, + 264, + 343 + ], + "score": 0.92, + "content": "S _ { : , q }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 329, + 397, + 345 + ], + "score": 1.0, + "content": "is orthogonal to the columns of", + "type": "text" + }, + { + "bbox": [ + 397, + 331, + 436, + 344 + ], + "score": 0.92, + "content": "S _ { : , 1 : ( q - 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 329, + 506, + 345 + ], + "score": 1.0, + "content": ". For the second", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 342, + 211, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 342, + 211, + 354 + ], + "score": 1.0, + "content": "trace term, we obtain that", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 355, + 456, + 480 + ], + "lines": [ + { + "bbox": [ + 153, + 355, + 456, + 480 + ], + "spans": [ + { + "bbox": [ + 153, + 355, + 456, + 480 + ], + "score": 0.95, + "content": "\\begin{array} { r l } { 2 \\mathrm { T r } ( P Q ^ { \\top } ) = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } & { } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { \\cdot , q } ( U S _ { \\cdot , q } ) ^ { \\top } \\Sigma U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { \\cdot , q } S _ { \\cdot , q } ^ { \\top } \\Lambda S S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\stackrel { ( i ) } { = } 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } \\sigma _ { k } U S _ { \\cdot , q } \\mathrm { e } _ { 2 } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } \\frac { ( i i i ) } { = } 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } \\mathrm { e } _ { 2 } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ \\end{array}", + "type": "interline_equation", + "image_path": "5e7949cfec7dd2bfcd03a2e116dbee2c11c6dada227b06d86303f493b5d837c7.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 153, + 355, + 456, + 396.6666666666667 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 153, + 396.6666666666667, + 456, + 438.33333333333337 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 153, + 438.33333333333337, + 456, + 480.00000000000006 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 483, + 505, + 507 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 507, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 201, + 499 + ], + "score": 1.0, + "content": "where (i) follows from", + "type": "text" + }, + { + "bbox": [ + 202, + 483, + 270, + 498 + ], + "score": 0.93, + "content": "\\bar { S } _ { : , q } ^ { \\top } \\Lambda S = \\sigma _ { k } \\mathbf { e } _ { q } ^ { \\top } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 482, + 359, + 499 + ], + "score": 1.0, + "content": "and (ii) follows from", + "type": "text" + }, + { + "bbox": [ + 360, + 483, + 423, + 498 + ], + "score": 0.93, + "content": "\\mathbf { e } _ { q } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 482, + 507, + 499 + ], + "score": 1.0, + "content": ". For the third trace", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 496, + 189, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 189, + 507 + ], + "score": 1.0, + "content": "term, we obtain that", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "interline_equation", + "bbox": [ + 131, + 509, + 480, + 544 + ], + "lines": [ + { + "bbox": [ + 131, + 509, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 131, + 509, + 480, + 544 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { 2 \\mathrm { T r } ( P Y ^ { \\top } ) = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } ) + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma ) } \\\\ & { \\qquad = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } ) + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } S _ { : , q } ^ { \\top } \\Lambda S _ { : , q } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "a7611105db7ab8bbe367611000b4232242cc4ce6522ea7bce5785bb97ecf2131.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 131, + 509, + 480, + 520.6666666666666 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 131, + 520.6666666666666, + 480, + 532.3333333333333 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 131, + 532.3333333333333, + 480, + 543.9999999999999 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 546, + 414, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 545, + 414, + 559 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 414, + 559 + ], + "score": 1.0, + "content": "Combining the expressions for the three trace terms above, we conclude that", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 562, + 492, + 685 + ], + "lines": [ + { + "bbox": [ + 119, + 562, + 492, + 685 + ], + "spans": [ + { + "bbox": [ + 119, + 562, + 492, + 685 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] } \\\\ & { \\qquad = \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) } \\\\ & { \\qquad + \\left( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } ) \\mathrm { T r } ( S _ { \\cdot , q } ^ { \\top } \\Lambda S _ { \\cdot , q } ) \\right. } \\\\ & { \\qquad + \\left. 2 \\epsilon _ { 2 } \\mathrm { T r } ( U S _ { \\cdot , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X Y ^ { \\top } [ U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } - I ] ) \\right. } \\\\ & { \\qquad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) } \\\\ & { \\qquad + \\left( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } \\right) \\mathrm { T r } ( S _ { \\cdot , q } ^ { \\top } \\Lambda S _ { \\cdot , q } ) } \\\\ & { \\qquad = \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) + ( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } ) \\sigma _ { k } , } \\end{array}", + "type": "interline_equation", + "image_path": "968ead3c1915ab73dd92f37c999734c609bcf2f5c20e41f4611777e8a9395c26.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 119, + 562, + 492, + 603.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 119, + 603.0, + 492, + 644.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 119, + 644.0, + 492, + 685.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 687, + 504, + 710 + ], + "lines": [ + { + "bbox": [ + 106, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "where (i) follows from eq. (30). Note that the first term in the last equation is nonnegative. Now,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 698, + 408, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 134, + 711 + ], + "score": 1.0, + "content": "letting", + "type": "text" + }, + { + "bbox": [ + 135, + 698, + 186, + 711 + ], + "score": 0.93, + "content": "\\epsilon _ { 2 } = \\epsilon _ { 1 } ^ { 2 } 0", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 698, + 408, + 711 + ], + "score": 1.0, + "content": ", the overall perturbation of the function value becomes", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 174, + 714, + 437, + 730 + ], + "lines": [ + { + "bbox": [ + 174, + 714, + 437, + 730 + ], + "spans": [ + { + "bbox": [ + 174, + 714, + 437, + 730 + ], + "score": 0.89, + "content": "\\scriptstyle \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] = { \\mathcal { O } } ( \\epsilon _ { 1 } ^ { 4 } ) - { \\mathcal { O } } ( \\epsilon _ { 1 } ^ { 3 } ) < 0 .", + "type": "interline_equation", + "image_path": "42e21364d016206a3bb613558153b43e66e33b6e7fe6d5545163488b1fb055d8.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 174, + 714, + 437, + 730 + ], + "spans": [], + "index": 26 + } + ] + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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": "text", + "bbox": [ + 107, + 81, + 505, + 119 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 480, + 95 + ], + "score": 1.0, + "content": "where (i) follows by taking the transpose and then simplifying, and (ii) uses the fact that", + "type": "text" + }, + { + "bbox": [ + 480, + 82, + 505, + 93 + ], + "score": 0.86, + "content": "V =", + "type": "inline_equation" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 91, + 506, + 109 + ], + "spans": [ + { + "bbox": [ + 107, + 93, + 190, + 106 + ], + "score": 0.89, + "content": "S S ^ { \\top } V ~ = ~ S _ { : , 1 : ( q - 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 91, + 506, + 109 + ], + "score": 1.0, + "content": "in the case of optimal-order critical point. Calculating the function value at", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 107, + 105, + 210, + 120 + ], + "spans": [ + { + "bbox": [ + 107, + 105, + 146, + 120 + ], + "score": 0.9, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 106, + 210, + 120 + ], + "score": 1.0, + "content": ", we obtain that", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 82, + 506, + 120 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 123, + 482, + 204 + ], + "lines": [ + { + "bbox": [ + 129, + 123, + 482, + 204 + ], + "spans": [ + { + "bbox": [ + 129, + 123, + 482, + 204 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { L } ( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } ) = \\frac { 1 } { 2 } \\| \\underbrace { U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } Y X ^ { \\dag } X } _ { Q } } \\\\ & { \\quad \\quad \\quad + \\underbrace { \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X + \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } Y X ^ { \\dag } X } _ { P } - Y \\| _ { F } ^ { 2 } } \\\\ & { \\quad \\quad \\quad = \\mathcal { L } ( A _ { 1 } , A _ { 2 } ) + \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] . } \\end{array}", + "type": "interline_equation", + "image_path": "e33607a6c8d52b4a6d497459a7f102d3b80bb6368573ab813f2278f393b64c1a.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 129, + 123, + 482, + 150.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 129, + 150.0, + 482, + 177.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 129, + 177.0, + 482, + 204.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 207, + 491, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 206, + 493, + 220 + ], + "spans": [ + { + "bbox": [ + 106, + 206, + 493, + 220 + ], + "score": 1.0, + "content": "We next simplify the above three trace terms using eq. (31). For the first trace term, observe that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 206, + 493, + 220 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 128, + 222, + 486, + 328 + ], + "lines": [ + { + "bbox": [ + 128, + 222, + 486, + 328 + ], + "spans": [ + { + "bbox": [ + 128, + 222, + 486, + 328 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\mathrm { T r } ( P P ^ { \\top } ) = \\mathrm { T r } ( \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \\top } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } + \\mathrm { T r } ( \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\overset { ( i ) } { = } \\mathrm { T r } ( \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \\top } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } + \\mathrm { T r } ( \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } = \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , ) } ^ { \\top } + \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( S _ { : , q } ^ { \\top } \\Lambda S _ { : , q } ) } \\end{array}", + "type": "interline_equation", + "image_path": "31e4304073c36ec1316988b1ba5623629a01b30d1add4a630b7dff4f5e810d04.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 128, + 222, + 486, + 257.3333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 128, + 257.3333333333333, + 486, + 292.66666666666663 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 128, + 292.66666666666663, + 486, + 327.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 330, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 248, + 345 + ], + "score": 1.0, + "content": "where (i) follows from eq. (31) as", + "type": "text" + }, + { + "bbox": [ + 248, + 331, + 264, + 343 + ], + "score": 0.92, + "content": "S _ { : , q }", + "type": "inline_equation" + }, + { + "bbox": [ + 265, + 329, + 397, + 345 + ], + "score": 1.0, + "content": "is orthogonal to the columns of", + "type": "text" + }, + { + "bbox": [ + 397, + 331, + 436, + 344 + ], + "score": 0.92, + "content": "S _ { : , 1 : ( q - 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 329, + 506, + 345 + ], + "score": 1.0, + "content": ". For the second", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 342, + 211, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 342, + 211, + 354 + ], + "score": 1.0, + "content": "trace term, we obtain that", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 329, + 506, + 354 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 355, + 456, + 480 + ], + "lines": [ + { + "bbox": [ + 153, + 355, + 456, + 480 + ], + "spans": [ + { + "bbox": [ + 153, + 355, + 456, + 480 + ], + "score": 0.95, + "content": "\\begin{array} { r l } { 2 \\mathrm { T r } ( P Q ^ { \\top } ) = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } & { } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { \\cdot , q } ( U S _ { \\cdot , q } ) ^ { \\top } \\Sigma U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { \\cdot , q } S _ { \\cdot , q } ^ { \\top } \\Lambda S S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\stackrel { ( i ) } { = } 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } \\sigma _ { k } U S _ { \\cdot , q } \\mathrm { e } _ { 2 } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } \\frac { ( i i i ) } { = } 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } \\mathrm { e } _ { 2 } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ \\end{array}", + "type": "interline_equation", + "image_path": "5e7949cfec7dd2bfcd03a2e116dbee2c11c6dada227b06d86303f493b5d837c7.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 153, + 355, + 456, + 396.6666666666667 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 153, + 396.6666666666667, + 456, + 438.33333333333337 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 153, + 438.33333333333337, + 456, + 480.00000000000006 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 483, + 505, + 507 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 507, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 201, + 499 + ], + "score": 1.0, + "content": "where (i) follows from", + "type": "text" + }, + { + "bbox": [ + 202, + 483, + 270, + 498 + ], + "score": 0.93, + "content": "\\bar { S } _ { : , q } ^ { \\top } \\Lambda S = \\sigma _ { k } \\mathbf { e } _ { q } ^ { \\top } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 482, + 359, + 499 + ], + "score": 1.0, + "content": "and (ii) follows from", + "type": "text" + }, + { + "bbox": [ + 360, + 483, + 423, + 498 + ], + "score": 0.93, + "content": "\\mathbf { e } _ { q } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 482, + 507, + 499 + ], + "score": 1.0, + "content": ". For the third trace", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 496, + 189, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 189, + 507 + ], + "score": 1.0, + "content": "term, we obtain that", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 482, + 507, + 507 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 131, + 509, + 480, + 544 + ], + "lines": [ + { + "bbox": [ + 131, + 509, + 480, + 544 + ], + "spans": [ + { + "bbox": [ + 131, + 509, + 480, + 544 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { 2 \\mathrm { T r } ( P Y ^ { \\top } ) = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } ) + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma ) } \\\\ & { \\qquad = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } ) + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } S _ { : , q } ^ { \\top } \\Lambda S _ { : , q } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "a7611105db7ab8bbe367611000b4232242cc4ce6522ea7bce5785bb97ecf2131.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 131, + 509, + 480, + 520.6666666666666 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 131, + 520.6666666666666, + 480, + 532.3333333333333 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 131, + 532.3333333333333, + 480, + 543.9999999999999 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 546, + 414, + 558 + ], + "lines": [ + { + "bbox": [ + 106, + 545, + 414, + 559 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 414, + 559 + ], + "score": 1.0, + "content": "Combining the expressions for the three trace terms above, we conclude that", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 106, + 545, + 414, + 559 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 562, + 492, + 685 + ], + "lines": [ + { + "bbox": [ + 119, + 562, + 492, + 685 + ], + "spans": [ + { + "bbox": [ + 119, + 562, + 492, + 685 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] } \\\\ & { \\qquad = \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) } \\\\ & { \\qquad + \\left( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } ) \\mathrm { T r } ( S _ { \\cdot , q } ^ { \\top } \\Lambda S _ { \\cdot , q } ) \\right. } \\\\ & { \\qquad + \\left. 2 \\epsilon _ { 2 } \\mathrm { T r } ( U S _ { \\cdot , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X Y ^ { \\top } [ U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } - I ] ) \\right. } \\\\ & { \\qquad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) } \\\\ & { \\qquad + \\left( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } \\right) \\mathrm { T r } ( S _ { \\cdot , q } ^ { \\top } \\Lambda S _ { \\cdot , q } ) } \\\\ & { \\qquad = \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) + ( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } ) \\sigma _ { k } , } \\end{array}", + "type": "interline_equation", + "image_path": "968ead3c1915ab73dd92f37c999734c609bcf2f5c20e41f4611777e8a9395c26.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 119, + 562, + 492, + 603.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 119, + 603.0, + 492, + 644.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 119, + 644.0, + 492, + 685.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 687, + 504, + 710 + ], + "lines": [ + { + "bbox": [ + 106, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "where (i) follows from eq. (30). Note that the first term in the last equation is nonnegative. Now,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 698, + 408, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 134, + 711 + ], + "score": 1.0, + "content": "letting", + "type": "text" + }, + { + "bbox": [ + 135, + 698, + 186, + 711 + ], + "score": 0.93, + "content": "\\epsilon _ { 2 } = \\epsilon _ { 1 } ^ { 2 } 0", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 698, + 408, + 711 + ], + "score": 1.0, + "content": ", the overall perturbation of the function value becomes", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 106, + 687, + 505, + 711 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 174, + 714, + 437, + 730 + ], + "lines": [ + { + "bbox": [ + 174, + 714, + 437, + 730 + ], + "spans": [ + { + "bbox": [ + 174, + 714, + 437, + 730 + ], + "score": 0.89, + "content": "\\scriptstyle \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] = { \\mathcal { O } } ( \\epsilon _ { 1 } ^ { 4 } ) - { \\mathcal { O } } ( \\epsilon _ { 1 } ^ { 3 } ) < 0 .", + "type": "interline_equation", + "image_path": "42e21364d016206a3bb613558153b43e66e33b6e7fe6d5545163488b1fb055d8.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 174, + 714, + 437, + 730 + ], + "spans": [], + "index": 26 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 80, + 506, + 153 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 249, + 95 + ], + "score": 1.0, + "content": "Thus, the constructed perturbation", + "type": "text" + }, + { + "bbox": [ + 250, + 80, + 289, + 95 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "achieves a lower function value, and it can be in an", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 504, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 212, + 109 + ], + "score": 1.0, + "content": "arbitrary neighborhood of", + "type": "text" + }, + { + "bbox": [ + 213, + 96, + 252, + 108 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 94, + 263, + 109 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 264, + 95, + 316, + 108 + ], + "score": 0.92, + "content": "\\epsilon _ { 2 } = \\epsilon _ { 1 } ^ { 2 } 0", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 94, + 387, + 109 + ], + "score": 1.0, + "content": ". Lastly, note that", + "type": "text" + }, + { + "bbox": [ + 387, + 93, + 499, + 108 + ], + "score": 0.92, + "content": "\\mathrm { r a n k } ( \\widetilde { A } _ { 2 } ) = \\mathrm { r a n k } ( A _ { 2 } ) + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 500, + 94, + 504, + 109 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 457, + 125 + ], + "score": 1.0, + "content": "Next, we prove item 3. We first introduce a technical lemma. Consider row vectors", + "type": "text" + }, + { + "bbox": [ + 457, + 111, + 484, + 124 + ], + "score": 0.91, + "content": "\\mathbf { a } ^ { \\top } , \\mathbf { y } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 123, + 507, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 140, + 138 + ], + "score": 0.91, + "content": "\\mathbf { a } ^ { \\intercal } \\neq \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 123, + 258, + 140 + ], + "score": 1.0, + "content": ". Define the scalar function", + "type": "text" + }, + { + "bbox": [ + 258, + 124, + 358, + 140 + ], + "score": 0.94, + "content": "\\begin{array} { r } { f ( \\alpha ) = \\frac { 1 } { 2 } \\left\\| \\alpha \\mathbf { a } ^ { \\top } - \\mathbf { y } ^ { \\top } \\right\\| _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 123, + 392, + 140 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + }, + { + "bbox": [ + 392, + 126, + 414, + 138 + ], + "score": 0.92, + "content": "f ( \\alpha )", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 123, + 507, + 140 + ], + "score": 1.0, + "content": "is strongly convex as", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 138, + 408, + 154 + ], + "spans": [ + { + "bbox": [ + 107, + 138, + 185, + 154 + ], + "score": 0.93, + "content": "f ^ { \\prime \\prime } ( \\alpha ) = \\left\\| \\mathbf { a } \\right\\| _ { 2 } ^ { 2 } > 0 .", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 138, + 408, + 154 + ], + "score": 1.0, + "content": "Thus, the following fact holds due to strong convexity.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 106, + 155, + 434, + 168 + ], + "lines": [ + { + "bbox": [ + 105, + 154, + 433, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 173, + 169 + ], + "score": 1.0, + "content": "Fact 1. For any", + "type": "text" + }, + { + "bbox": [ + 173, + 156, + 200, + 166 + ], + "score": 0.88, + "content": "\\alpha \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 154, + 327, + 169 + ], + "score": 1.0, + "content": ", we can identify a perturbation", + "type": "text" + }, + { + "bbox": [ + 328, + 156, + 335, + 165 + ], + "score": 0.72, + "content": "\\widetilde { \\alpha }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 154, + 375, + 169 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 376, + 155, + 430, + 168 + ], + "score": 0.92, + "content": "f ( \\widetilde { \\alpha } ) > f ( \\alpha )", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 154, + 433, + 169 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 175, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 174, + 506, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 209, + 189 + ], + "score": 1.0, + "content": "Now consider any point", + "type": "text" + }, + { + "bbox": [ + 210, + 176, + 274, + 188 + ], + "score": 0.91, + "content": "( A _ { 1 } , A _ { 2 } ) \\ \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 174, + 308, + 189 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 308, + 176, + 370, + 187 + ], + "score": 0.92, + "content": "A _ { 2 } A _ { 1 } X ~ \\neq ~ \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 174, + 506, + 189 + ], + "score": 1.0, + "content": ", then there exists a certain row,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 140, + 199 + ], + "score": 1.0, + "content": "say, the", + "type": "text" + }, + { + "bbox": [ + 141, + 188, + 145, + 197 + ], + "score": 0.73, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 186, + 178, + 199 + ], + "score": 1.0, + "content": "-th row", + "type": "text" + }, + { + "bbox": [ + 178, + 187, + 230, + 199 + ], + "score": 0.91, + "content": "( A _ { 2 } ) _ { i , : } A _ { 1 } X", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 186, + 448, + 199 + ], + "score": 1.0, + "content": ", that is nonzero. We then apply the above fact with", + "type": "text" + }, + { + "bbox": [ + 449, + 186, + 505, + 199 + ], + "score": 0.92, + "content": "\\alpha = 1 , \\mathbf { a } ^ { \\top } =", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 198, + 506, + 212 + ], + "spans": [ + { + "bbox": [ + 107, + 198, + 206, + 212 + ], + "score": 0.91, + "content": "( A _ { 2 } ) _ { i , : } A _ { 1 } \\boldsymbol { X } , \\mathbf { y } ^ { \\intercal } = \\boldsymbol { Y } _ { i , : }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 199, + 402, + 212 + ], + "score": 1.0, + "content": ", and conclude that one can find a perturbation", + "type": "text" + }, + { + "bbox": [ + 403, + 199, + 411, + 209 + ], + "score": 0.81, + "content": "\\widetilde { \\alpha }", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 199, + 506, + 212 + ], + "score": 1.0, + "content": "that achieves a higher", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 209, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 104, + 209, + 356, + 223 + ], + "score": 1.0, + "content": "function value. Equivalently, one can treat the perturbation of", + "type": "text" + }, + { + "bbox": [ + 357, + 212, + 364, + 220 + ], + "score": 0.79, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 209, + 454, + 223 + ], + "score": 1.0, + "content": "eas the perturbation of", + "type": "text" + }, + { + "bbox": [ + 454, + 210, + 483, + 222 + ], + "score": 0.91, + "content": "( A _ { 2 } ) _ { i , : }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 209, + 506, + 223 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 222, + 284, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 199, + 237 + ], + "score": 1.0, + "content": "define the perturbation", + "type": "text" + }, + { + "bbox": [ + 200, + 222, + 280, + 236 + ], + "score": 0.92, + "content": "( \\widetilde { A } _ { 2 } ) _ { i , : } : = \\widetilde { \\alpha } ( A _ { 2 } ) _ { i , : }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 223, + 284, + 237 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8 + }, + { + "type": "title", + "bbox": [ + 107, + 251, + 223, + 264 + ], + "lines": [ + { + "bbox": [ + 106, + 250, + 225, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 225, + 266 + ], + "score": 1.0, + "content": "PROOF OF THEOREM 3", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 504, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 417, + 289 + ], + "score": 1.0, + "content": "We first derive the forms of the parameter matrices. Consider a critical point", + "type": "text" + }, + { + "bbox": [ + 417, + 276, + 473, + 288 + ], + "score": 0.91, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 275, + 486, + 289 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 486, + 277, + 501, + 287 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 275, + 505, + 289 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 287, + 491, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 277, + 300 + ], + "score": 1.0, + "content": "By definition of the critical point, we have", + "type": "text" + }, + { + "bbox": [ + 278, + 287, + 331, + 299 + ], + "score": 0.93, + "content": "\\nabla _ { A _ { k } } \\mathcal { L } _ { D } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 287, + 359, + 300 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 359, + 288, + 410, + 299 + ], + "score": 0.91, + "content": "k = 1 , \\dots , \\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 287, + 491, + 300 + ], + "score": 1.0, + "content": ", which implies that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 303, + 455, + 320 + ], + "lines": [ + { + "bbox": [ + 157, + 303, + 455, + 320 + ], + "spans": [ + { + "bbox": [ + 157, + 303, + 455, + 320 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , k + 1 ) } ^ { \\top } \\pmb { A } _ { ( \\ell , k + 1 ) } \\pmb { A } _ { k } \\pmb { A } _ { ( k - 1 , 1 ) } \\pmb { X } ( \\pmb { A } _ { ( k - 1 , 1 ) } \\pmb { X } ) ^ { \\top } = \\pmb { A } _ { ( \\ell , k + 1 ) } ^ { \\top } \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( k - 1 , 1 ) } ^ { \\top } , } \\end{array}", + "type": "interline_equation", + "image_path": "c9eae5d9f65c160e4f6d8a9677b28b2cee0bcacbece308a4114dfc6167907256.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 157, + 303, + 455, + 320 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 325, + 407, + 338 + ], + "lines": [ + { + "bbox": [ + 105, + 324, + 406, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 223, + 339 + ], + "score": 1.0, + "content": "Solving this linear system of", + "type": "text" + }, + { + "bbox": [ + 223, + 326, + 237, + 337 + ], + "score": 0.9, + "content": "\\pmb { A } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 324, + 341, + 339 + ], + "score": 1.0, + "content": ", we obtain that, for some", + "type": "text" + }, + { + "bbox": [ + 341, + 325, + 406, + 337 + ], + "score": 0.89, + "content": "\\pmb { L } _ { k } \\in \\mathbb { R } ^ { d _ { k } \\times d _ { k - 1 } }", + "type": "inline_equation" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 342, + 477, + 360 + ], + "lines": [ + { + "bbox": [ + 118, + 342, + 477, + 360 + ], + "spans": [ + { + "bbox": [ + 118, + 342, + 477, + 360 + ], + "score": 0.93, + "content": "\\begin{array} { r } { A _ { k } = A _ { ( \\ell , k + 1 ) } ^ { \\dagger } Y ( A _ { ( k - 1 , 1 ) } X ) ^ { \\dagger } + L _ { k } - A _ { ( \\ell , k + 1 ) } ^ { \\dagger } A _ { ( \\ell , k + 1 ) } L _ { k } A _ { ( k - 1 , 1 ) } X ( A _ { ( k - 1 , 1 ) } X ) ^ { \\dagger } } \\end{array}", + "type": "interline_equation", + "image_path": "6d37ffd67b5fe6f17e8474cce01146e8fb5a6e390cbc387ca46e951d1aec84a2.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 118, + 342, + 477, + 360 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 363, + 504, + 386 + ], + "lines": [ + { + "bbox": [ + 105, + 362, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 264, + 378 + ], + "score": 1.0, + "content": "Multiplying eq. (33) on both sides by", + "type": "text" + }, + { + "bbox": [ + 264, + 365, + 300, + 376 + ], + "score": 0.89, + "content": "A _ { ( \\ell , k + 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 362, + 366, + 378 + ], + "score": 1.0, + "content": "on the left and", + "type": "text" + }, + { + "bbox": [ + 367, + 364, + 414, + 377 + ], + "score": 0.93, + "content": "A _ { ( k - 1 , 1 ) } X", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 362, + 506, + 378 + ], + "score": 1.0, + "content": "on the right and then", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 374, + 312, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 243, + 387 + ], + "score": 1.0, + "content": "simplifying, we obtain that for all", + "type": "text" + }, + { + "bbox": [ + 243, + 376, + 312, + 386 + ], + "score": 0.87, + "content": "k = 1 , \\dots , \\ell - 1", + "type": "inline_equation" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 391, + 417, + 408 + ], + "lines": [ + { + "bbox": [ + 194, + 391, + 417, + 408 + ], + "spans": [ + { + "bbox": [ + 194, + 391, + 417, + 408 + ], + "score": 0.91, + "content": "A _ { ( \\ell , 1 ) } \\boldsymbol { X } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } \\boldsymbol { Y } ( A _ { ( k - 1 , 1 ) } \\boldsymbol { X } ) ^ { \\dagger } \\boldsymbol { A } _ { ( k - 1 , 1 ) } \\boldsymbol { X } .", + "type": "interline_equation", + "image_path": "b8dda2fd5af24dc7d51ce869f22ea8b3c870a5a6760c9a8aa6e0747b69803bea.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 194, + 391, + 417, + 408 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 411, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 275, + 426 + ], + "score": 1.0, + "content": "On the other hand, applying eq. (32) with", + "type": "text" + }, + { + "bbox": [ + 275, + 414, + 299, + 423 + ], + "score": 0.9, + "content": "k = \\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 411, + 422, + 426 + ], + "score": 1.0, + "content": "and multiplying both sides by", + "type": "text" + }, + { + "bbox": [ + 423, + 412, + 436, + 426 + ], + "score": 0.9, + "content": "A _ { \\ell } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 411, + 505, + 426 + ], + "score": 1.0, + "content": "on the right, one", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 422, + 157, + 437 + ], + "spans": [ + { + "bbox": [ + 104, + 422, + 157, + 437 + ], + "score": 1.0, + "content": "obtains that", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 439, + 375, + 456 + ], + "lines": [ + { + "bbox": [ + 236, + 439, + 375, + 456 + ], + "spans": [ + { + "bbox": [ + 236, + 439, + 375, + 456 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell , 1 ) } ^ { \\top } = \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell , 1 ) } ^ { \\top } , } \\end{array}", + "type": "interline_equation", + "image_path": "522a762d4ebdc30a8270901b03eac3eb011258349d6ebed30daaf93516733c24.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 236, + 439, + 375, + 456 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 460, + 402, + 472 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 401, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 332, + 473 + ], + "score": 1.0, + "content": "which, together with eq. (34), further implies that for all", + "type": "text" + }, + { + "bbox": [ + 333, + 460, + 401, + 472 + ], + "score": 0.9, + "content": "k = 1 , \\dots , \\ell - 1", + "type": "inline_equation" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 476, + 421, + 492 + ], + "lines": [ + { + "bbox": [ + 191, + 476, + 421, + 492 + ], + "spans": [ + { + "bbox": [ + 191, + 476, + 421, + 492 + ], + "score": 0.91, + "content": "\\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } \\boldsymbol { \\Sigma } _ { k - 1 } \\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } = \\boldsymbol { \\Sigma } _ { k - 1 } \\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } .", + "type": "interline_equation", + "image_path": "bf98b8423e14e22773b48201d2f6884b96cca7cbf0fc58963f1a6353f120c933.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 191, + 476, + 421, + 492 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 495, + 506, + 530 + ], + "lines": [ + { + "bbox": [ + 104, + 493, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 104, + 493, + 454, + 510 + ], + "score": 1.0, + "content": "Following the same argument as that in the proof of Theorem 1, we conclude that", + "type": "text" + }, + { + "bbox": [ + 454, + 496, + 505, + 508 + ], + "score": 0.9, + "content": "A _ { ( \\ell , k + 1 ) } =", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 506, + 506, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 176, + 518 + ], + "score": 0.92, + "content": "U _ { k - 1 } V _ { k - 1 } C _ { k - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 506, + 209, + 519 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 209, + 507, + 287, + 518 + ], + "score": 0.92, + "content": "U _ { k - 1 } , V _ { k - 1 } , C _ { k - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 506, + 506, + 519 + ], + "score": 1.0, + "content": "satisfy the conditions that are stated in the theorem.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 516, + 477, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 240, + 531 + ], + "score": 1.0, + "content": "Then, plugging the expression of", + "type": "text" + }, + { + "bbox": [ + 241, + 519, + 276, + 531 + ], + "score": 0.95, + "content": "\\boldsymbol { A } _ { ( \\ell , k + 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 516, + 420, + 531 + ], + "score": 1.0, + "content": "in eq. (33), one obtains the form of", + "type": "text" + }, + { + "bbox": [ + 420, + 518, + 434, + 528 + ], + "score": 0.9, + "content": "\\pmb { A } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 516, + 477, + 531 + ], + "score": 1.0, + "content": "in eq. (4).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 534, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 505, + 547 + ], + "score": 1.0, + "content": "We next prove the conditions in eq. (6). Note that the first condition is simply a consistency con-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 545, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 505, + 558 + ], + "score": 1.0, + "content": "dition on the matrix products. This is because eq. (36) only provides the forms of the matrices", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 107, + 556, + 506, + 569 + ], + "spans": [ + { + "bbox": [ + 107, + 556, + 217, + 569 + ], + "score": 0.91, + "content": "\\pmb { A } _ { ( \\ell , k + 1 ) } , k = 1 , \\ldots , l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 556, + 506, + 569 + ], + "score": 1.0, + "content": ", which must factorize into the product of individual matrices. For the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 568, + 504, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 430, + 582 + ], + "score": 1.0, + "content": "other condition in eq. (6), note that the proof of eq. (35) uses the weaker condition", + "type": "text" + }, + { + "bbox": [ + 431, + 568, + 504, + 582 + ], + "score": 0.93, + "content": "( \\nabla _ { { \\pmb A } _ { \\ell } } { \\mathcal { L } } _ { D } ) { \\pmb A } _ { \\ell } ^ { \\top } = { \\bf 0 }", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 101, + 579, + 509, + 612 + ], + "spans": [ + { + "bbox": [ + 101, + 579, + 200, + 612 + ], + "score": 1.0, + "content": "than the original condittrices must also satisfy", + "type": "text" + }, + { + "bbox": [ + 216, + 581, + 269, + 592 + ], + "score": 0.92, + "content": "\\nabla _ { A _ { \\ell } } \\mathcal { L } _ { D } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 579, + 273, + 612 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 440, + 579, + 509, + 612 + ], + "score": 1.0, + "content": "e parameter ma- Then, plugging", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 200, + 591, + 440, + 606 + ], + "spans": [ + { + "bbox": [ + 200, + 593, + 253, + 604 + ], + "score": 0.92, + "content": "\\nabla _ { A _ { \\ell } } \\mathcal { L } _ { D } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 591, + 440, + 606 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } ( \\pmb { A } _ { ( \\ell - 1 , 1 ) } \\pmb { X } ) ^ { \\top } = \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell - 1 , 1 ) } ^ { \\top } . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 604, + 378, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 378, + 618 + ], + "score": 1.0, + "content": "eq. (34) in the above condition and simplifying, one obtains eq. (6).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31 + }, + { + "type": "title", + "bbox": [ + 107, + 632, + 241, + 645 + ], + "lines": [ + { + "bbox": [ + 106, + 632, + 242, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 242, + 646 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 4", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 655, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 104, + 654, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 104, + 654, + 202, + 672 + ], + "score": 1.0, + "content": "Note that by expansion", + "type": "text" + }, + { + "bbox": [ + 202, + 656, + 467, + 671 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } _ { D } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathbf { Y } \\mathbf { Y } ^ { \\top } ) - \\mathrm { T r } ( A _ { ( \\ell , 1 ) } \\mathbf { X } \\mathbf { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( A _ { ( \\ell , 1 ) } \\mathbf { X } \\mathbf { X } ^ { \\top } A _ { ( \\ell , 1 ) } ^ { \\top } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 654, + 505, + 672 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 669, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 107, + 670, + 155, + 682 + ], + "score": 0.91, + "content": "A _ { 1 } , \\dotsc , A _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 669, + 453, + 683 + ], + "score": 1.0, + "content": "that satisfy eq. (32), we have shown that they must satisfy eq. (34) with", + "type": "text" + }, + { + "bbox": [ + 453, + 671, + 480, + 680 + ], + "score": 0.89, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 669, + 505, + 683 + ], + "score": 1.0, + "content": ", with", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 681, + 222, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 681, + 222, + 693 + ], + "score": 1.0, + "content": "which we further obtain that", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "interline_equation", + "bbox": [ + 216, + 695, + 394, + 732 + ], + "lines": [ + { + "bbox": [ + 216, + 695, + 394, + 732 + ], + "spans": [ + { + "bbox": [ + 216, + 695, + 394, + 732 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( { \\cal Y } { \\cal Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { ( \\ell , 2 ) } ) } \\Sigma _ { 0 } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( { \\cal Y } { \\cal Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( U _ { 0 } ^ { \\top } A _ { ( \\ell , 2 ) } ) } \\pmb { \\Lambda } _ { 0 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "e2a7f3346043cc697a6d0b676ca27bef0700d668719a7705658d9443e90b28eb.jpg" + } + ] + } + ], + "index": 39.5, + "virtual_lines": [ + { + "bbox": [ + 216, + 695, + 394, + 713.5 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 216, + 713.5, + 394, + 732.0 + ], + "spans": [], + "index": 40 + } + ] + } + ], + "page_idx": 16, + "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": "17", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 80, + 506, + 153 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 249, + 95 + ], + "score": 1.0, + "content": "Thus, the constructed perturbation", + "type": "text" + }, + { + "bbox": [ + 250, + 80, + 289, + 95 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "achieves a lower function value, and it can be in an", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 504, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 212, + 109 + ], + "score": 1.0, + "content": "arbitrary neighborhood of", + "type": "text" + }, + { + "bbox": [ + 213, + 96, + 252, + 108 + ], + "score": 0.92, + "content": "( A _ { 1 } , A _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 94, + 263, + 109 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 264, + 95, + 316, + 108 + ], + "score": 0.92, + "content": "\\epsilon _ { 2 } = \\epsilon _ { 1 } ^ { 2 } 0", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 94, + 387, + 109 + ], + "score": 1.0, + "content": ". Lastly, note that", + "type": "text" + }, + { + "bbox": [ + 387, + 93, + 499, + 108 + ], + "score": 0.92, + "content": "\\mathrm { r a n k } ( \\widetilde { A } _ { 2 } ) = \\mathrm { r a n k } ( A _ { 2 } ) + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 500, + 94, + 504, + 109 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 457, + 125 + ], + "score": 1.0, + "content": "Next, we prove item 3. We first introduce a technical lemma. Consider row vectors", + "type": "text" + }, + { + "bbox": [ + 457, + 111, + 484, + 124 + ], + "score": 0.91, + "content": "\\mathbf { a } ^ { \\top } , \\mathbf { y } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 123, + 507, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 140, + 138 + ], + "score": 0.91, + "content": "\\mathbf { a } ^ { \\intercal } \\neq \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 123, + 258, + 140 + ], + "score": 1.0, + "content": ". Define the scalar function", + "type": "text" + }, + { + "bbox": [ + 258, + 124, + 358, + 140 + ], + "score": 0.94, + "content": "\\begin{array} { r } { f ( \\alpha ) = \\frac { 1 } { 2 } \\left\\| \\alpha \\mathbf { a } ^ { \\top } - \\mathbf { y } ^ { \\top } \\right\\| _ { 2 } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 123, + 392, + 140 + ], + "score": 1.0, + "content": ". Then,", + "type": "text" + }, + { + "bbox": [ + 392, + 126, + 414, + 138 + ], + "score": 0.92, + "content": "f ( \\alpha )", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 123, + 507, + 140 + ], + "score": 1.0, + "content": "is strongly convex as", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 138, + 408, + 154 + ], + "spans": [ + { + "bbox": [ + 107, + 138, + 185, + 154 + ], + "score": 0.93, + "content": "f ^ { \\prime \\prime } ( \\alpha ) = \\left\\| \\mathbf { a } \\right\\| _ { 2 } ^ { 2 } > 0 .", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 138, + 408, + 154 + ], + "score": 1.0, + "content": "Thus, the following fact holds due to strong convexity.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 80, + 507, + 154 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 155, + 434, + 168 + ], + "lines": [ + { + "bbox": [ + 105, + 154, + 433, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 173, + 169 + ], + "score": 1.0, + "content": "Fact 1. For any", + "type": "text" + }, + { + "bbox": [ + 173, + 156, + 200, + 166 + ], + "score": 0.88, + "content": "\\alpha \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 154, + 327, + 169 + ], + "score": 1.0, + "content": ", we can identify a perturbation", + "type": "text" + }, + { + "bbox": [ + 328, + 156, + 335, + 165 + ], + "score": 0.72, + "content": "\\widetilde { \\alpha }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 154, + 375, + 169 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 376, + 155, + 430, + 168 + ], + "score": 0.92, + "content": "f ( \\widetilde { \\alpha } ) > f ( \\alpha )", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 154, + 433, + 169 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 154, + 433, + 169 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 175, + 505, + 236 + ], + "lines": [ + { + "bbox": [ + 105, + 174, + 506, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 209, + 189 + ], + "score": 1.0, + "content": "Now consider any point", + "type": "text" + }, + { + "bbox": [ + 210, + 176, + 274, + 188 + ], + "score": 0.91, + "content": "( A _ { 1 } , A _ { 2 } ) \\ \\in \\mathcal { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 174, + 308, + 189 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 308, + 176, + 370, + 187 + ], + "score": 0.92, + "content": "A _ { 2 } A _ { 1 } X ~ \\neq ~ \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 174, + 506, + 189 + ], + "score": 1.0, + "content": ", then there exists a certain row,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 140, + 199 + ], + "score": 1.0, + "content": "say, the", + "type": "text" + }, + { + "bbox": [ + 141, + 188, + 145, + 197 + ], + "score": 0.73, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 186, + 178, + 199 + ], + "score": 1.0, + "content": "-th row", + "type": "text" + }, + { + "bbox": [ + 178, + 187, + 230, + 199 + ], + "score": 0.91, + "content": "( A _ { 2 } ) _ { i , : } A _ { 1 } X", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 186, + 448, + 199 + ], + "score": 1.0, + "content": ", that is nonzero. We then apply the above fact with", + "type": "text" + }, + { + "bbox": [ + 449, + 186, + 505, + 199 + ], + "score": 0.92, + "content": "\\alpha = 1 , \\mathbf { a } ^ { \\top } =", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 198, + 506, + 212 + ], + "spans": [ + { + "bbox": [ + 107, + 198, + 206, + 212 + ], + "score": 0.91, + "content": "( A _ { 2 } ) _ { i , : } A _ { 1 } \\boldsymbol { X } , \\mathbf { y } ^ { \\intercal } = \\boldsymbol { Y } _ { i , : }", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 199, + 402, + 212 + ], + "score": 1.0, + "content": ", and conclude that one can find a perturbation", + "type": "text" + }, + { + "bbox": [ + 403, + 199, + 411, + 209 + ], + "score": 0.81, + "content": "\\widetilde { \\alpha }", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 199, + 506, + 212 + ], + "score": 1.0, + "content": "that achieves a higher", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 209, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 104, + 209, + 356, + 223 + ], + "score": 1.0, + "content": "function value. Equivalently, one can treat the perturbation of", + "type": "text" + }, + { + "bbox": [ + 357, + 212, + 364, + 220 + ], + "score": 0.79, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 209, + 454, + 223 + ], + "score": 1.0, + "content": "eas the perturbation of", + "type": "text" + }, + { + "bbox": [ + 454, + 210, + 483, + 222 + ], + "score": 0.91, + "content": "( A _ { 2 } ) _ { i , : }", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 209, + 506, + 223 + ], + "score": 1.0, + "content": ", i.e.,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 222, + 284, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 199, + 237 + ], + "score": 1.0, + "content": "define the perturbation", + "type": "text" + }, + { + "bbox": [ + 200, + 222, + 280, + 236 + ], + "score": 0.92, + "content": "( \\widetilde { A } _ { 2 } ) _ { i , : } : = \\widetilde { \\alpha } ( A _ { 2 } ) _ { i , : }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 223, + 284, + 237 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8, + "bbox_fs": [ + 104, + 174, + 506, + 237 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 251, + 223, + 264 + ], + "lines": [ + { + "bbox": [ + 106, + 250, + 225, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 225, + 266 + ], + "score": 1.0, + "content": "PROOF OF THEOREM 3", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 275, + 504, + 299 + ], + "lines": [ + { + "bbox": [ + 106, + 275, + 505, + 289 + ], + "spans": [ + { + "bbox": [ + 106, + 275, + 417, + 289 + ], + "score": 1.0, + "content": "We first derive the forms of the parameter matrices. Consider a critical point", + "type": "text" + }, + { + "bbox": [ + 417, + 276, + 473, + 288 + ], + "score": 0.91, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 275, + 486, + 289 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 486, + 277, + 501, + 287 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 275, + 505, + 289 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 287, + 491, + 300 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 277, + 300 + ], + "score": 1.0, + "content": "By definition of the critical point, we have", + "type": "text" + }, + { + "bbox": [ + 278, + 287, + 331, + 299 + ], + "score": 0.93, + "content": "\\nabla _ { A _ { k } } \\mathcal { L } _ { D } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 287, + 359, + 300 + ], + "score": 1.0, + "content": "for all", + "type": "text" + }, + { + "bbox": [ + 359, + 288, + 410, + 299 + ], + "score": 0.91, + "content": "k = 1 , \\dots , \\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 287, + 491, + 300 + ], + "score": 1.0, + "content": ", which implies that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 106, + 275, + 505, + 300 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 303, + 455, + 320 + ], + "lines": [ + { + "bbox": [ + 157, + 303, + 455, + 320 + ], + "spans": [ + { + "bbox": [ + 157, + 303, + 455, + 320 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , k + 1 ) } ^ { \\top } \\pmb { A } _ { ( \\ell , k + 1 ) } \\pmb { A } _ { k } \\pmb { A } _ { ( k - 1 , 1 ) } \\pmb { X } ( \\pmb { A } _ { ( k - 1 , 1 ) } \\pmb { X } ) ^ { \\top } = \\pmb { A } _ { ( \\ell , k + 1 ) } ^ { \\top } \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( k - 1 , 1 ) } ^ { \\top } , } \\end{array}", + "type": "interline_equation", + "image_path": "c9eae5d9f65c160e4f6d8a9677b28b2cee0bcacbece308a4114dfc6167907256.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 157, + 303, + 455, + 320 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 325, + 407, + 338 + ], + "lines": [ + { + "bbox": [ + 105, + 324, + 406, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 223, + 339 + ], + "score": 1.0, + "content": "Solving this linear system of", + "type": "text" + }, + { + "bbox": [ + 223, + 326, + 237, + 337 + ], + "score": 0.9, + "content": "\\pmb { A } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 238, + 324, + 341, + 339 + ], + "score": 1.0, + "content": ", we obtain that, for some", + "type": "text" + }, + { + "bbox": [ + 341, + 325, + 406, + 337 + ], + "score": 0.89, + "content": "\\pmb { L } _ { k } \\in \\mathbb { R } ^ { d _ { k } \\times d _ { k - 1 } }", + "type": "inline_equation" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 324, + 406, + 339 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 342, + 477, + 360 + ], + "lines": [ + { + "bbox": [ + 118, + 342, + 477, + 360 + ], + "spans": [ + { + "bbox": [ + 118, + 342, + 477, + 360 + ], + "score": 0.93, + "content": "\\begin{array} { r } { A _ { k } = A _ { ( \\ell , k + 1 ) } ^ { \\dagger } Y ( A _ { ( k - 1 , 1 ) } X ) ^ { \\dagger } + L _ { k } - A _ { ( \\ell , k + 1 ) } ^ { \\dagger } A _ { ( \\ell , k + 1 ) } L _ { k } A _ { ( k - 1 , 1 ) } X ( A _ { ( k - 1 , 1 ) } X ) ^ { \\dagger } } \\end{array}", + "type": "interline_equation", + "image_path": "6d37ffd67b5fe6f17e8474cce01146e8fb5a6e390cbc387ca46e951d1aec84a2.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 118, + 342, + 477, + 360 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 363, + 504, + 386 + ], + "lines": [ + { + "bbox": [ + 105, + 362, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 264, + 378 + ], + "score": 1.0, + "content": "Multiplying eq. (33) on both sides by", + "type": "text" + }, + { + "bbox": [ + 264, + 365, + 300, + 376 + ], + "score": 0.89, + "content": "A _ { ( \\ell , k + 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 362, + 366, + 378 + ], + "score": 1.0, + "content": "on the left and", + "type": "text" + }, + { + "bbox": [ + 367, + 364, + 414, + 377 + ], + "score": 0.93, + "content": "A _ { ( k - 1 , 1 ) } X", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 362, + 506, + 378 + ], + "score": 1.0, + "content": "on the right and then", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 374, + 312, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 243, + 387 + ], + "score": 1.0, + "content": "simplifying, we obtain that for all", + "type": "text" + }, + { + "bbox": [ + 243, + 376, + 312, + 386 + ], + "score": 0.87, + "content": "k = 1 , \\dots , \\ell - 1", + "type": "inline_equation" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 362, + 506, + 387 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 391, + 417, + 408 + ], + "lines": [ + { + "bbox": [ + 194, + 391, + 417, + 408 + ], + "spans": [ + { + "bbox": [ + 194, + 391, + 417, + 408 + ], + "score": 0.91, + "content": "A _ { ( \\ell , 1 ) } \\boldsymbol { X } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } \\boldsymbol { Y } ( A _ { ( k - 1 , 1 ) } \\boldsymbol { X } ) ^ { \\dagger } \\boldsymbol { A } _ { ( k - 1 , 1 ) } \\boldsymbol { X } .", + "type": "interline_equation", + "image_path": "b8dda2fd5af24dc7d51ce869f22ea8b3c870a5a6760c9a8aa6e0747b69803bea.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 194, + 391, + 417, + 408 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 105, + 411, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 411, + 275, + 426 + ], + "score": 1.0, + "content": "On the other hand, applying eq. (32) with", + "type": "text" + }, + { + "bbox": [ + 275, + 414, + 299, + 423 + ], + "score": 0.9, + "content": "k = \\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 411, + 422, + 426 + ], + "score": 1.0, + "content": "and multiplying both sides by", + "type": "text" + }, + { + "bbox": [ + 423, + 412, + 436, + 426 + ], + "score": 0.9, + "content": "A _ { \\ell } ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 411, + 505, + 426 + ], + "score": 1.0, + "content": "on the right, one", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 422, + 157, + 437 + ], + "spans": [ + { + "bbox": [ + 104, + 422, + 157, + 437 + ], + "score": 1.0, + "content": "obtains that", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 104, + 411, + 505, + 437 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 439, + 375, + 456 + ], + "lines": [ + { + "bbox": [ + 236, + 439, + 375, + 456 + ], + "spans": [ + { + "bbox": [ + 236, + 439, + 375, + 456 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell , 1 ) } ^ { \\top } = \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell , 1 ) } ^ { \\top } , } \\end{array}", + "type": "interline_equation", + "image_path": "522a762d4ebdc30a8270901b03eac3eb011258349d6ebed30daaf93516733c24.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 236, + 439, + 375, + 456 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 460, + 402, + 472 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 401, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 332, + 473 + ], + "score": 1.0, + "content": "which, together with eq. (34), further implies that for all", + "type": "text" + }, + { + "bbox": [ + 333, + 460, + 401, + 472 + ], + "score": 0.9, + "content": "k = 1 , \\dots , \\ell - 1", + "type": "inline_equation" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 106, + 459, + 401, + 473 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 476, + 421, + 492 + ], + "lines": [ + { + "bbox": [ + 191, + 476, + 421, + 492 + ], + "spans": [ + { + "bbox": [ + 191, + 476, + 421, + 492 + ], + "score": 0.91, + "content": "\\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } \\boldsymbol { \\Sigma } _ { k - 1 } \\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } = \\boldsymbol { \\Sigma } _ { k - 1 } \\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } .", + "type": "interline_equation", + "image_path": "bf98b8423e14e22773b48201d2f6884b96cca7cbf0fc58963f1a6353f120c933.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 191, + 476, + 421, + 492 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 495, + 506, + 530 + ], + "lines": [ + { + "bbox": [ + 104, + 493, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 104, + 493, + 454, + 510 + ], + "score": 1.0, + "content": "Following the same argument as that in the proof of Theorem 1, we conclude that", + "type": "text" + }, + { + "bbox": [ + 454, + 496, + 505, + 508 + ], + "score": 0.9, + "content": "A _ { ( \\ell , k + 1 ) } =", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 506, + 506, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 176, + 518 + ], + "score": 0.92, + "content": "U _ { k - 1 } V _ { k - 1 } C _ { k - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 506, + 209, + 519 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 209, + 507, + 287, + 518 + ], + "score": 0.92, + "content": "U _ { k - 1 } , V _ { k - 1 } , C _ { k - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 506, + 506, + 519 + ], + "score": 1.0, + "content": "satisfy the conditions that are stated in the theorem.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 516, + 477, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 240, + 531 + ], + "score": 1.0, + "content": "Then, plugging the expression of", + "type": "text" + }, + { + "bbox": [ + 241, + 519, + 276, + 531 + ], + "score": 0.95, + "content": "\\boldsymbol { A } _ { ( \\ell , k + 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 516, + 420, + 531 + ], + "score": 1.0, + "content": "in eq. (33), one obtains the form of", + "type": "text" + }, + { + "bbox": [ + 420, + 518, + 434, + 528 + ], + "score": 0.9, + "content": "\\pmb { A } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 516, + 477, + 531 + ], + "score": 1.0, + "content": "in eq. (4).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 104, + 493, + 506, + 531 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 505, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 534, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 505, + 547 + ], + "score": 1.0, + "content": "We next prove the conditions in eq. (6). Note that the first condition is simply a consistency con-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 545, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 505, + 558 + ], + "score": 1.0, + "content": "dition on the matrix products. This is because eq. (36) only provides the forms of the matrices", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 107, + 556, + 506, + 569 + ], + "spans": [ + { + "bbox": [ + 107, + 556, + 217, + 569 + ], + "score": 0.91, + "content": "\\pmb { A } _ { ( \\ell , k + 1 ) } , k = 1 , \\ldots , l - 1", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 556, + 506, + 569 + ], + "score": 1.0, + "content": ", which must factorize into the product of individual matrices. For the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 568, + 504, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 430, + 582 + ], + "score": 1.0, + "content": "other condition in eq. (6), note that the proof of eq. (35) uses the weaker condition", + "type": "text" + }, + { + "bbox": [ + 431, + 568, + 504, + 582 + ], + "score": 0.93, + "content": "( \\nabla _ { { \\pmb A } _ { \\ell } } { \\mathcal { L } } _ { D } ) { \\pmb A } _ { \\ell } ^ { \\top } = { \\bf 0 }", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 101, + 579, + 509, + 612 + ], + "spans": [ + { + "bbox": [ + 101, + 579, + 200, + 612 + ], + "score": 1.0, + "content": "than the original condittrices must also satisfy", + "type": "text" + }, + { + "bbox": [ + 216, + 581, + 269, + 592 + ], + "score": 0.92, + "content": "\\nabla _ { A _ { \\ell } } \\mathcal { L } _ { D } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 579, + 273, + 612 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 440, + 579, + 509, + 612 + ], + "score": 1.0, + "content": "e parameter ma- Then, plugging", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 200, + 591, + 440, + 606 + ], + "spans": [ + { + "bbox": [ + 200, + 593, + 253, + 604 + ], + "score": 0.92, + "content": "\\nabla _ { A _ { \\ell } } \\mathcal { L } _ { D } = \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 591, + 440, + 606 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } ( \\pmb { A } _ { ( \\ell - 1 , 1 ) } \\pmb { X } ) ^ { \\top } = \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell - 1 , 1 ) } ^ { \\top } . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 604, + 378, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 378, + 618 + ], + "score": 1.0, + "content": "eq. (34) in the above condition and simplifying, one obtains eq. (6).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31, + "bbox_fs": [ + 101, + 534, + 509, + 618 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 632, + 241, + 645 + ], + "lines": [ + { + "bbox": [ + 106, + 632, + 242, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 242, + 646 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 4", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 655, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 104, + 654, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 104, + 654, + 202, + 672 + ], + "score": 1.0, + "content": "Note that by expansion", + "type": "text" + }, + { + "bbox": [ + 202, + 656, + 467, + 671 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } _ { D } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathbf { Y } \\mathbf { Y } ^ { \\top } ) - \\mathrm { T r } ( A _ { ( \\ell , 1 ) } \\mathbf { X } \\mathbf { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( A _ { ( \\ell , 1 ) } \\mathbf { X } \\mathbf { X } ^ { \\top } A _ { ( \\ell , 1 ) } ^ { \\top } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 467, + 654, + 505, + 672 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 107, + 669, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 107, + 670, + 155, + 682 + ], + "score": 0.91, + "content": "A _ { 1 } , \\dotsc , A _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 669, + 453, + 683 + ], + "score": 1.0, + "content": "that satisfy eq. (32), we have shown that they must satisfy eq. (34) with", + "type": "text" + }, + { + "bbox": [ + 453, + 671, + 480, + 680 + ], + "score": 0.89, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 669, + 505, + 683 + ], + "score": 1.0, + "content": ", with", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 681, + 222, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 681, + 222, + 693 + ], + "score": 1.0, + "content": "which we further obtain that", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 104, + 654, + 505, + 693 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 216, + 695, + 394, + 732 + ], + "lines": [ + { + "bbox": [ + 216, + 695, + 394, + 732 + ], + "spans": [ + { + "bbox": [ + 216, + 695, + 394, + 732 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( { \\cal Y } { \\cal Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { ( \\ell , 2 ) } ) } \\Sigma _ { 0 } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( { \\cal Y } { \\cal Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( U _ { 0 } ^ { \\top } A _ { ( \\ell , 2 ) } ) } \\pmb { \\Lambda } _ { 0 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "e2a7f3346043cc697a6d0b676ca27bef0700d668719a7705658d9443e90b28eb.jpg" + } + ] + } + ], + "index": 39.5, + "virtual_lines": [ + { + "bbox": [ + 216, + 695, + 394, + 713.5 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 216, + 713.5, + 394, + 732.0 + ], + "spans": [], + "index": 40 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 81, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 210, + 96 + ], + "score": 1.0, + "content": "Consider a critical point", + "type": "text" + }, + { + "bbox": [ + 211, + 82, + 267, + 95 + ], + "score": 0.92, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "so that eq. (37) holds. Using the form of critical points", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 93, + 288, + 108 + ], + "spans": [ + { + "bbox": [ + 107, + 93, + 182, + 107 + ], + "score": 0.93, + "content": "\\pmb { A } _ { ( \\ell , 2 ) } = \\pmb { U } _ { 0 } \\pmb { V } _ { 0 } \\pmb { C } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 93, + 288, + 108 + ], + "score": 1.0, + "content": ", eq. (37) further becomes", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 223, + 110, + 388, + 180 + ], + "lines": [ + { + "bbox": [ + 223, + 110, + 388, + 180 + ], + "spans": [ + { + "bbox": [ + 223, + 110, + 388, + 180 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { V } _ { 0 } \\pmb { C } _ { 0 } ) } \\pmb { \\Lambda } _ { 0 } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { V } _ { 0 } ^ { \\top } \\pmb { \\Lambda } _ { 0 } \\pmb { V } _ { 0 } ) } \\\\ & { \\quad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\displaystyle \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) , } \\end{array}", + "type": "interline_equation", + "image_path": "604bdc37330ef50367f7e041e5bde79263c8866947b1b4c246d83fadb2c2ce1e.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 223, + 110, + 388, + 127.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 223, + 127.5, + 388, + 145.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 223, + 145.0, + 388, + 162.5 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 223, + 162.5, + 388, + 180.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 184, + 504, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 506, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 264, + 197 + ], + "score": 1.0, + "content": "where (i) utilizes the block pattern of", + "type": "text" + }, + { + "bbox": [ + 264, + 185, + 276, + 195 + ], + "score": 0.89, + "content": "V _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 182, + 406, + 197 + ], + "score": 1.0, + "content": "and the multiplicity pattern of", + "type": "text" + }, + { + "bbox": [ + 406, + 185, + 419, + 195 + ], + "score": 0.88, + "content": "\\mathbf { { \\boldsymbol { \\Lambda } } } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 182, + 506, + 197 + ], + "score": 1.0, + "content": "that are specified in", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 194, + 156, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 156, + 208 + ], + "score": 1.0, + "content": "Theorem 3.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "title", + "bbox": [ + 107, + 222, + 241, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 242, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 242, + 237 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 5", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 246, + 505, + 285 + ], + "lines": [ + { + "bbox": [ + 104, + 245, + 506, + 261 + ], + "spans": [ + { + "bbox": [ + 104, + 245, + 233, + 261 + ], + "score": 1.0, + "content": "Observe that the product matrix", + "type": "text" + }, + { + "bbox": [ + 234, + 248, + 259, + 261 + ], + "score": 0.92, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 245, + 403, + 261 + ], + "score": 1.0, + "content": "is equivalent to the class of matrices", + "type": "text" + }, + { + "bbox": [ + 403, + 246, + 501, + 259 + ], + "score": 0.92, + "content": "B _ { 2 } \\in \\mathbb { R } ^ { \\operatorname* { m i n } \\{ d _ { \\ell } , \\ldots , d _ { 2 } \\} \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 245, + 506, + 261 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 260, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 209, + 276 + ], + "score": 1.0, + "content": "Consider a critical point", + "type": "text" + }, + { + "bbox": [ + 209, + 262, + 248, + 273 + ], + "score": 0.93, + "content": "( B _ { 2 } , A _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 260, + 374, + 276 + ], + "score": 1.0, + "content": "of the shallow linear network", + "type": "text" + }, + { + "bbox": [ + 374, + 261, + 483, + 275 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal { L } : = \\frac { 1 } { 2 } \\| B _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\| _ { F } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 260, + 505, + 276 + ], + "score": 1.0, + "content": ". By", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 272, + 236, + 285 + ], + "spans": [ + { + "bbox": [ + 106, + 272, + 236, + 285 + ], + "score": 1.0, + "content": "Proposition 2, we conclude that", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 131, + 293, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 129, + 290, + 504, + 313 + ], + "spans": [ + { + "bbox": [ + 129, + 290, + 147, + 313 + ], + "score": 1.0, + "content": "• I", + "type": "text" + }, + { + "bbox": [ + 147, + 294, + 285, + 309 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\mathrm { f } \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} \\leq \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 290, + 308, + 313 + ], + "score": 1.0, + "content": ", then", + "type": "text" + }, + { + "bbox": [ + 309, + 296, + 348, + 308 + ], + "score": 0.92, + "content": "( A _ { 1 } , B _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 290, + 489, + 313 + ], + "score": 1.0, + "content": "is a global minimizer if and only if", + "type": "text" + }, + { + "bbox": [ + 490, + 296, + 504, + 307 + ], + "score": 0.88, + "content": "B _ { 2 }", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 303, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 138, + 303, + 207, + 327 + ], + "score": 1.0, + "content": "is full rank and", + "type": "text" + }, + { + "bbox": [ + 208, + 308, + 505, + 323 + ], + "score": 0.68, + "content": "\\begin{array} { r } { p _ { 1 } = \\tilde { m _ { 1 } ( 0 ) } , \\dots , p _ { k - 1 } = m _ { k - 1 } ( 0 ) , p _ { k } = \\mathrm { r a n k } ( B _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \\leq } \\end{array}", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 320, + 251, + 333 + ], + "spans": [ + { + "bbox": [ + 142, + 321, + 169, + 333 + ], + "score": 0.91, + "content": "m _ { k } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 320, + 209, + 333 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 209, + 321, + 246, + 333 + ], + "score": 0.89, + "content": "k \\leq r ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 320, + 251, + 333 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 127, + 329, + 512, + 362 + ], + "spans": [ + { + "bbox": [ + 127, + 329, + 142, + 362 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 153, + 336, + 289, + 351 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 329, + 304, + 362 + ], + "score": 1.0, + "content": ", thand", + "type": "text" + }, + { + "bbox": [ + 316, + 338, + 354, + 350 + ], + "score": 0.92, + "content": "( A _ { 1 } , B _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 329, + 404, + 362 + ], + "score": 1.0, + "content": "is a globaln particular,", + "type": "text" + }, + { + "bbox": [ + 419, + 329, + 512, + 362 + ], + "score": 1.0, + "content": "imizer if and only ifcan be non-full rank", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 350, + 419, + 382 + ], + "spans": [ + { + "bbox": [ + 138, + 355, + 163, + 382 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 142, + 351, + 191, + 362 + ], + "score": 0.9, + "content": "p _ { i } = m _ { i } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 361, + 269, + 376 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\operatorname { r a n k } ( B _ { 2 } ) = \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 351, + 285, + 362 + ], + "score": 0.88, + "content": "i = 1 , \\ldots , r ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 355, + 277, + 382 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 305, + 350, + 344, + 362 + ], + "score": 0.94, + "content": "\\bar { p } ( 0 ) \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 350, + 419, + 361 + ], + "score": 0.89, + "content": "B _ { 2 }", + "type": "inline_equation" + } + ], + "index": 16 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 506, + 421 + ], + "lines": [ + { + "bbox": [ + 106, + 384, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 145, + 396 + ], + "score": 1.0, + "content": "Note that", + "type": "text" + }, + { + "bbox": [ + 146, + 385, + 161, + 395 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 384, + 315, + 396 + ], + "score": 1.0, + "content": "achieves the same global minimum as", + "type": "text" + }, + { + "bbox": [ + 315, + 385, + 322, + 394 + ], + "score": 0.76, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 384, + 505, + 396 + ], + "score": 1.0, + "content": ". Hence Proposition 1 and Proposition 4 must", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 101, + 389, + 510, + 417 + ], + "spans": [ + { + "bbox": [ + 101, + 389, + 207, + 417 + ], + "score": 1.0, + "content": "match, which yields that", + "type": "text" + }, + { + "bbox": [ + 207, + 395, + 349, + 410 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( 0 ) } \\bar { p } _ { i } \\sigma _ { i } ( 0 ) = \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 389, + 444, + 417 + ], + "score": 1.0, + "content": ". We then conclude that", + "type": "text" + }, + { + "bbox": [ + 445, + 397, + 489, + 410 + ], + "score": 0.93, + "content": "p _ { i } ( 0 ) = p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 389, + 510, + 417 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 169, + 407, + 396, + 423 + ], + "spans": [ + { + "bbox": [ + 169, + 407, + 181, + 423 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 181, + 410, + 277, + 421 + ], + "score": 0.89, + "content": "\\sigma _ { 1 } ( 0 ) > \\cdots > \\sigma _ { r ( 0 ) } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 407, + 396, + 423 + ], + "score": 1.0, + "content": ". This proves the proposition.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "title", + "bbox": [ + 107, + 435, + 224, + 448 + ], + "lines": [ + { + "bbox": [ + 106, + 435, + 225, + 450 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 225, + 450 + ], + "score": 1.0, + "content": "PROOF OF THEOREM 4", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 460, + 506, + 565 + ], + "lines": [ + { + "bbox": [ + 107, + 461, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 107, + 461, + 505, + 472 + ], + "score": 1.0, + "content": "The proof is similar to that for shallow linear networks. Consider a deep-non-optimal-order critical", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 130, + 484 + ], + "score": 1.0, + "content": "point", + "type": "text" + }, + { + "bbox": [ + 130, + 472, + 186, + 484 + ], + "score": 0.91, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 471, + 352, + 484 + ], + "score": 1.0, + "content": ", and define the orthonormal block matrix", + "type": "text" + }, + { + "bbox": [ + 353, + 472, + 365, + 483 + ], + "score": 0.87, + "content": "S _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 471, + 444, + 484 + ], + "score": 1.0, + "content": "using the blocks of", + "type": "text" + }, + { + "bbox": [ + 444, + 472, + 457, + 483 + ], + "score": 0.89, + "content": "V _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 471, + 505, + 484 + ], + "score": 1.0, + "content": "in a similar", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 482, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 203, + 497 + ], + "score": 1.0, + "content": "way as eq. (29). Then,", + "type": "text" + }, + { + "bbox": [ + 204, + 483, + 239, + 496 + ], + "score": 0.92, + "content": "\\boldsymbol { A } _ { ( l , k + 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 482, + 303, + 497 + ], + "score": 1.0, + "content": "takes the form", + "type": "text" + }, + { + "bbox": [ + 303, + 483, + 415, + 495 + ], + "score": 0.89, + "content": "A _ { ( l , k + 2 ) } = U _ { k } S _ { k } \\bar { S _ { k } ^ { \\top } } V _ { k } C _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 482, + 446, + 497 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 447, + 483, + 482, + 495 + ], + "score": 0.9, + "content": "\\boldsymbol { A } _ { ( l , k + 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 482, + 506, + 497 + ], + "score": 1.0, + "content": "is of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 494, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 494, + 235, + 508 + ], + "score": 1.0, + "content": "non-optimal order, there exists", + "type": "text" + }, + { + "bbox": [ + 236, + 495, + 298, + 506 + ], + "score": 0.91, + "content": "\\ : i < j < r ( k ) \\ :", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 494, + 340, + 508 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 341, + 495, + 406, + 507 + ], + "score": 0.91, + "content": "p _ { i } ( k ) < m _ { i } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 494, + 426, + 508 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 426, + 495, + 472, + 507 + ], + "score": 0.92, + "content": "p _ { j } ( k ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 494, + 506, + 508 + ], + "score": 1.0, + "content": ". Thus,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 505, + 507, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 283, + 524 + ], + "score": 1.0, + "content": "we perturb the j-th column of UkSk to b", + "type": "text" + }, + { + "bbox": [ + 275, + 505, + 507, + 526 + ], + "score": 1.0, + "content": "e usj1+\u000fusi(pi(k)+1)√ 2 , and denote the resulting matrix as Mfk.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 524, + 507, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 176, + 542 + ], + "score": 1.0, + "content": "Then, we perturb", + "type": "text" + }, + { + "bbox": [ + 176, + 527, + 190, + 538 + ], + "score": 0.88, + "content": "\\pmb { A } _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 524, + 212, + 542 + ], + "score": 1.0, + "content": "to be", + "type": "text" + }, + { + "bbox": [ + 212, + 524, + 304, + 539 + ], + "score": 0.91, + "content": "\\widetilde { A } _ { \\ell } = \\widetilde { M } _ { k } ( U _ { k } S _ { k } ) ^ { \\top } A _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 524, + 333, + 542 + ], + "score": 1.0, + "content": "so that", + "type": "text" + }, + { + "bbox": [ + 333, + 524, + 457, + 540 + ], + "score": 0.93, + "content": "\\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } = \\widetilde { M } _ { k } S _ { k } ^ { \\top } V _ { k } C _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 524, + 507, + 542 + ], + "score": 1.0, + "content": ". Moreover,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 539, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 158, + 554 + ], + "score": 1.0, + "content": "we generate", + "type": "text" + }, + { + "bbox": [ + 158, + 539, + 182, + 554 + ], + "score": 0.93, + "content": "\\widetilde { A } _ { k + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 540, + 248, + 554 + ], + "score": 1.0, + "content": "by eq. (4) with", + "type": "text" + }, + { + "bbox": [ + 248, + 540, + 351, + 554 + ], + "score": 0.92, + "content": "U _ { k } \\gets \\widetilde { M } _ { k } , V _ { k } \\gets S _ { k } ^ { \\top } V _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 540, + 506, + 554 + ], + "score": 1.0, + "content": ". Note that such construction satisfies", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 552, + 375, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 375, + 565 + ], + "score": 1.0, + "content": "eq. (32), and hence also satisfies eq. (34), which further yields that", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 568, + 458, + 588 + ], + "lines": [ + { + "bbox": [ + 153, + 568, + 458, + 588 + ], + "spans": [ + { + "bbox": [ + 153, + 568, + 458, + 588 + ], + "score": 0.9, + "content": "\\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } \\widetilde { A } _ { k + 1 } A _ { ( k , 1 ) } \\pmb { X } = \\mathcal { P } _ { \\mathrm { c o l } ( \\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } ) } \\pmb { Y } ( A _ { ( k , 1 ) } \\pmb { X } ) ^ { \\dag } A _ { ( k , 1 ) } \\pmb { X } .", + "type": "interline_equation", + "image_path": "4a6859b8dd9506421eae5bd7bf75bdb430549e2975b9466b61f972029132bc38.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 153, + 568, + 458, + 588 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 592, + 434, + 605 + ], + "lines": [ + { + "bbox": [ + 106, + 592, + 433, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 433, + 606 + ], + "score": 1.0, + "content": "With the above equation, the function value at this perturbed point is evaluated as", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 609, + 444, + 628 + ], + "lines": [ + { + "bbox": [ + 165, + 609, + 444, + 628 + ], + "spans": [ + { + "bbox": [ + 165, + 609, + 444, + 628 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { L } ( \\widetilde { A } _ { \\ell } , \\dots , \\widetilde { A } _ { k + 1 } , \\dots ) = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( S _ { k } ^ { \\top } \\pmb { U } _ { k } ^ { \\top } \\widetilde { M } _ { k } S _ { k } ^ { \\top } V _ { k } ) } \\pmb { \\Lambda } _ { k } \\big ) . } \\end{array}", + "type": "interline_equation", + "image_path": "c59ef393ace1a1f425b9d6bbb87df3c2dc4c434d49689eab8ecac4b49ffc2a0e.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 165, + 609, + 444, + 628 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 663 + ], + "lines": [ + { + "bbox": [ + 103, + 629, + 507, + 649 + ], + "spans": [ + { + "bbox": [ + 103, + 629, + 507, + 649 + ], + "score": 1.0, + "content": "Then, a careful calculation shows that only the i, j-th diagonal elements of Pcol(S>U>MkS>Vk)Λ", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 101, + 646, + 394, + 666 + ], + "spans": [ + { + "bbox": [ + 101, + 646, + 198, + 666 + ], + "score": 1.0, + "content": "have changed, and are", + "type": "text" + }, + { + "bbox": [ + 198, + 647, + 242, + 664 + ], + "score": 0.93, + "content": "\\textstyle { \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } } , { \\frac { 1 } { 1 + \\epsilon ^ { 2 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 646, + 394, + 666 + ], + "score": 1.0, + "content": ", respectively. We then conclude that", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 668, + 486, + 686 + ], + "lines": [ + { + "bbox": [ + 123, + 668, + 486, + 686 + ], + "spans": [ + { + "bbox": [ + 123, + 668, + 486, + 686 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } ( A _ { 1 } , \\ldots , \\widetilde { A } _ { k + 1 } , \\ldots , \\widetilde { A } _ { \\ell } ) = \\mathcal { L } ( A _ { 1 } , \\ldots , A _ { \\ell } ) - \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } ( \\sigma _ { i } ( k ) - \\sigma _ { j } ( k ) ) < \\mathcal { L } ( A _ { 1 } , \\ldots , A _ { \\ell } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "8d30dc7291a3703d37514a290115879688892c14e8f76079a999799029d93491.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 123, + 668, + 486, + 686 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 697, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 696, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 696, + 303, + 712 + ], + "score": 1.0, + "content": "Now consider a deep-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 304, + 698, + 360, + 710 + ], + "score": 0.9, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 696, + 423, + 712 + ], + "score": 1.0, + "content": ". Note that with", + "type": "text" + }, + { + "bbox": [ + 424, + 698, + 459, + 711 + ], + "score": 0.92, + "content": "A _ { ( \\ell - 2 , 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 696, + 506, + 712 + ], + "score": 1.0, + "content": "fixed to be", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 453, + 722 + ], + "score": 1.0, + "content": "a constant, the deep linear network reduces to a shallow linear network with parameters", + "type": "text" + }, + { + "bbox": [ + 453, + 709, + 501, + 721 + ], + "score": 0.9, + "content": "\\left( \\mathbf { 1 } _ { \\ell } , \\mathbf { A } _ { \\ell - 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 709, + 504, + 722 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 720, + 504, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 131, + 733 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 132, + 721, + 179, + 733 + ], + "score": 0.93, + "content": "\\left( \\mathbf { \\boldsymbol { A } } _ { \\ell } , \\mathbf { \\boldsymbol { A } } _ { \\ell - 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 720, + 490, + 733 + ], + "score": 1.0, + "content": "is not a non-global minimum critical point of this shallow linear network and", + "type": "text" + }, + { + "bbox": [ + 491, + 721, + 504, + 732 + ], + "score": 0.88, + "content": "\\pmb { A } _ { \\ell }", + "type": "inline_equation" + } + ], + "index": 37 + } + ], + "index": 36 + } + ], + "page_idx": 17, + "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": "18", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 81, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 210, + 96 + ], + "score": 1.0, + "content": "Consider a critical point", + "type": "text" + }, + { + "bbox": [ + 211, + 82, + 267, + 95 + ], + "score": 0.92, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "so that eq. (37) holds. Using the form of critical points", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 93, + 288, + 108 + ], + "spans": [ + { + "bbox": [ + 107, + 93, + 182, + 107 + ], + "score": 0.93, + "content": "\\pmb { A } _ { ( \\ell , 2 ) } = \\pmb { U } _ { 0 } \\pmb { V } _ { 0 } \\pmb { C } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 93, + 288, + 108 + ], + "score": 1.0, + "content": ", eq. (37) further becomes", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 108 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 223, + 110, + 388, + 180 + ], + "lines": [ + { + "bbox": [ + 223, + 110, + 388, + 180 + ], + "spans": [ + { + "bbox": [ + 223, + 110, + 388, + 180 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { V } _ { 0 } \\pmb { C } _ { 0 } ) } \\pmb { \\Lambda } _ { 0 } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { V } _ { 0 } ^ { \\top } \\pmb { \\Lambda } _ { 0 } \\pmb { V } _ { 0 } ) } \\\\ & { \\quad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\displaystyle \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) , } \\end{array}", + "type": "interline_equation", + "image_path": "604bdc37330ef50367f7e041e5bde79263c8866947b1b4c246d83fadb2c2ce1e.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 223, + 110, + 388, + 127.5 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 223, + 127.5, + 388, + 145.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 223, + 145.0, + 388, + 162.5 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 223, + 162.5, + 388, + 180.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 184, + 504, + 207 + ], + "lines": [ + { + "bbox": [ + 105, + 182, + 506, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 264, + 197 + ], + "score": 1.0, + "content": "where (i) utilizes the block pattern of", + "type": "text" + }, + { + "bbox": [ + 264, + 185, + 276, + 195 + ], + "score": 0.89, + "content": "V _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 182, + 406, + 197 + ], + "score": 1.0, + "content": "and the multiplicity pattern of", + "type": "text" + }, + { + "bbox": [ + 406, + 185, + 419, + 195 + ], + "score": 0.88, + "content": "\\mathbf { { \\boldsymbol { \\Lambda } } } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 182, + 506, + 197 + ], + "score": 1.0, + "content": "that are specified in", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 194, + 156, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 156, + 208 + ], + "score": 1.0, + "content": "Theorem 3.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 182, + 506, + 208 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 222, + 241, + 236 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 242, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 242, + 237 + ], + "score": 1.0, + "content": "PROOF OF PROPOSITION 5", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 246, + 505, + 285 + ], + "lines": [ + { + "bbox": [ + 104, + 245, + 506, + 261 + ], + "spans": [ + { + "bbox": [ + 104, + 245, + 233, + 261 + ], + "score": 1.0, + "content": "Observe that the product matrix", + "type": "text" + }, + { + "bbox": [ + 234, + 248, + 259, + 261 + ], + "score": 0.92, + "content": "\\pmb { A } _ { ( \\ell , 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 245, + 403, + 261 + ], + "score": 1.0, + "content": "is equivalent to the class of matrices", + "type": "text" + }, + { + "bbox": [ + 403, + 246, + 501, + 259 + ], + "score": 0.92, + "content": "B _ { 2 } \\in \\mathbb { R } ^ { \\operatorname* { m i n } \\{ d _ { \\ell } , \\ldots , d _ { 2 } \\} \\times d _ { 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 245, + 506, + 261 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 260, + 505, + 276 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 209, + 276 + ], + "score": 1.0, + "content": "Consider a critical point", + "type": "text" + }, + { + "bbox": [ + 209, + 262, + 248, + 273 + ], + "score": 0.93, + "content": "( B _ { 2 } , A _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 260, + 374, + 276 + ], + "score": 1.0, + "content": "of the shallow linear network", + "type": "text" + }, + { + "bbox": [ + 374, + 261, + 483, + 275 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal { L } : = \\frac { 1 } { 2 } \\| B _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\| _ { F } ^ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 260, + 505, + 276 + ], + "score": 1.0, + "content": ". By", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 272, + 236, + 285 + ], + "spans": [ + { + "bbox": [ + 106, + 272, + 236, + 285 + ], + "score": 1.0, + "content": "Proposition 2, we conclude that", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 104, + 245, + 506, + 285 + ] + }, + { + "type": "text", + "bbox": [ + 131, + 293, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 129, + 290, + 504, + 313 + ], + "spans": [ + { + "bbox": [ + 129, + 290, + 147, + 313 + ], + "score": 1.0, + "content": "• I", + "type": "text" + }, + { + "bbox": [ + 147, + 294, + 285, + 309 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\mathrm { f } \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} \\leq \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 290, + 308, + 313 + ], + "score": 1.0, + "content": ", then", + "type": "text" + }, + { + "bbox": [ + 309, + 296, + 348, + 308 + ], + "score": 0.92, + "content": "( A _ { 1 } , B _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 290, + 489, + 313 + ], + "score": 1.0, + "content": "is a global minimizer if and only if", + "type": "text" + }, + { + "bbox": [ + 490, + 296, + 504, + 307 + ], + "score": 0.88, + "content": "B _ { 2 }", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 138, + 303, + 505, + 327 + ], + "spans": [ + { + "bbox": [ + 138, + 303, + 207, + 327 + ], + "score": 1.0, + "content": "is full rank and", + "type": "text" + }, + { + "bbox": [ + 208, + 308, + 505, + 323 + ], + "score": 0.68, + "content": "\\begin{array} { r } { p _ { 1 } = \\tilde { m _ { 1 } ( 0 ) } , \\dots , p _ { k - 1 } = m _ { k - 1 } ( 0 ) , p _ { k } = \\mathrm { r a n k } ( B _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \\leq } \\end{array}", + "type": "inline_equation" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 320, + 251, + 333 + ], + "spans": [ + { + "bbox": [ + 142, + 321, + 169, + 333 + ], + "score": 0.91, + "content": "m _ { k } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 320, + 209, + 333 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 209, + 321, + 246, + 333 + ], + "score": 0.89, + "content": "k \\leq r ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 320, + 251, + 333 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 127, + 329, + 512, + 362 + ], + "spans": [ + { + "bbox": [ + 127, + 329, + 142, + 362 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 153, + 336, + 289, + 351 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 329, + 304, + 362 + ], + "score": 1.0, + "content": ", thand", + "type": "text" + }, + { + "bbox": [ + 316, + 338, + 354, + 350 + ], + "score": 0.92, + "content": "( A _ { 1 } , B _ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 329, + 404, + 362 + ], + "score": 1.0, + "content": "is a globaln particular,", + "type": "text" + }, + { + "bbox": [ + 419, + 329, + 512, + 362 + ], + "score": 1.0, + "content": "imizer if and only ifcan be non-full rank", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 138, + 350, + 419, + 382 + ], + "spans": [ + { + "bbox": [ + 138, + 355, + 163, + 382 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 142, + 351, + 191, + 362 + ], + "score": 0.9, + "content": "p _ { i } = m _ { i } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 361, + 269, + 376 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\operatorname { r a n k } ( B _ { 2 } ) = \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 351, + 285, + 362 + ], + "score": 0.88, + "content": "i = 1 , \\ldots , r ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 355, + 277, + 382 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 305, + 350, + 344, + 362 + ], + "score": 0.94, + "content": "\\bar { p } ( 0 ) \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 350, + 419, + 361 + ], + "score": 0.89, + "content": "B _ { 2 }", + "type": "inline_equation" + } + ], + "index": 16 + } + ], + "index": 14, + "bbox_fs": [ + 127, + 290, + 512, + 382 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 506, + 421 + ], + "lines": [ + { + "bbox": [ + 106, + 384, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 145, + 396 + ], + "score": 1.0, + "content": "Note that", + "type": "text" + }, + { + "bbox": [ + 146, + 385, + 161, + 395 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 384, + 315, + 396 + ], + "score": 1.0, + "content": "achieves the same global minimum as", + "type": "text" + }, + { + "bbox": [ + 315, + 385, + 322, + 394 + ], + "score": 0.76, + "content": "\\mathcal { L }", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 384, + 505, + 396 + ], + "score": 1.0, + "content": ". Hence Proposition 1 and Proposition 4 must", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 101, + 389, + 510, + 417 + ], + "spans": [ + { + "bbox": [ + 101, + 389, + 207, + 417 + ], + "score": 1.0, + "content": "match, which yields that", + "type": "text" + }, + { + "bbox": [ + 207, + 395, + 349, + 410 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( 0 ) } \\bar { p } _ { i } \\sigma _ { i } ( 0 ) = \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 389, + 444, + 417 + ], + "score": 1.0, + "content": ". We then conclude that", + "type": "text" + }, + { + "bbox": [ + 445, + 397, + 489, + 410 + ], + "score": 0.93, + "content": "p _ { i } ( 0 ) = p _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 490, + 389, + 510, + 417 + ], + "score": 1.0, + "content": "for", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 169, + 407, + 396, + 423 + ], + "spans": [ + { + "bbox": [ + 169, + 407, + 181, + 423 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 181, + 410, + 277, + 421 + ], + "score": 0.89, + "content": "\\sigma _ { 1 } ( 0 ) > \\cdots > \\sigma _ { r ( 0 ) } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 407, + 396, + 423 + ], + "score": 1.0, + "content": ". This proves the proposition.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 101, + 384, + 510, + 423 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 435, + 224, + 448 + ], + "lines": [ + { + "bbox": [ + 106, + 435, + 225, + 450 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 225, + 450 + ], + "score": 1.0, + "content": "PROOF OF THEOREM 4", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 460, + 506, + 565 + ], + "lines": [ + { + "bbox": [ + 107, + 461, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 107, + 461, + 505, + 472 + ], + "score": 1.0, + "content": "The proof is similar to that for shallow linear networks. Consider a deep-non-optimal-order critical", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 130, + 484 + ], + "score": 1.0, + "content": "point", + "type": "text" + }, + { + "bbox": [ + 130, + 472, + 186, + 484 + ], + "score": 0.91, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 471, + 352, + 484 + ], + "score": 1.0, + "content": ", and define the orthonormal block matrix", + "type": "text" + }, + { + "bbox": [ + 353, + 472, + 365, + 483 + ], + "score": 0.87, + "content": "S _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 471, + 444, + 484 + ], + "score": 1.0, + "content": "using the blocks of", + "type": "text" + }, + { + "bbox": [ + 444, + 472, + 457, + 483 + ], + "score": 0.89, + "content": "V _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 471, + 505, + 484 + ], + "score": 1.0, + "content": "in a similar", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 482, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 203, + 497 + ], + "score": 1.0, + "content": "way as eq. (29). Then,", + "type": "text" + }, + { + "bbox": [ + 204, + 483, + 239, + 496 + ], + "score": 0.92, + "content": "\\boldsymbol { A } _ { ( l , k + 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 482, + 303, + 497 + ], + "score": 1.0, + "content": "takes the form", + "type": "text" + }, + { + "bbox": [ + 303, + 483, + 415, + 495 + ], + "score": 0.89, + "content": "A _ { ( l , k + 2 ) } = U _ { k } S _ { k } \\bar { S _ { k } ^ { \\top } } V _ { k } C _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 482, + 446, + 497 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 447, + 483, + 482, + 495 + ], + "score": 0.9, + "content": "\\boldsymbol { A } _ { ( l , k + 2 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 482, + 506, + 497 + ], + "score": 1.0, + "content": "is of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 494, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 494, + 235, + 508 + ], + "score": 1.0, + "content": "non-optimal order, there exists", + "type": "text" + }, + { + "bbox": [ + 236, + 495, + 298, + 506 + ], + "score": 0.91, + "content": "\\ : i < j < r ( k ) \\ :", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 494, + 340, + 508 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 341, + 495, + 406, + 507 + ], + "score": 0.91, + "content": "p _ { i } ( k ) < m _ { i } ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 494, + 426, + 508 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 426, + 495, + 472, + 507 + ], + "score": 0.92, + "content": "p _ { j } ( k ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 494, + 506, + 508 + ], + "score": 1.0, + "content": ". Thus,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 505, + 507, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 283, + 524 + ], + "score": 1.0, + "content": "we perturb the j-th column of UkSk to b", + "type": "text" + }, + { + "bbox": [ + 275, + 505, + 507, + 526 + ], + "score": 1.0, + "content": "e usj1+\u000fusi(pi(k)+1)√ 2 , and denote the resulting matrix as Mfk.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 524, + 507, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 176, + 542 + ], + "score": 1.0, + "content": "Then, we perturb", + "type": "text" + }, + { + "bbox": [ + 176, + 527, + 190, + 538 + ], + "score": 0.88, + "content": "\\pmb { A } _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 524, + 212, + 542 + ], + "score": 1.0, + "content": "to be", + "type": "text" + }, + { + "bbox": [ + 212, + 524, + 304, + 539 + ], + "score": 0.91, + "content": "\\widetilde { A } _ { \\ell } = \\widetilde { M } _ { k } ( U _ { k } S _ { k } ) ^ { \\top } A _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 524, + 333, + 542 + ], + "score": 1.0, + "content": "so that", + "type": "text" + }, + { + "bbox": [ + 333, + 524, + 457, + 540 + ], + "score": 0.93, + "content": "\\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } = \\widetilde { M } _ { k } S _ { k } ^ { \\top } V _ { k } C _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 524, + 507, + 542 + ], + "score": 1.0, + "content": ". Moreover,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 539, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 158, + 554 + ], + "score": 1.0, + "content": "we generate", + "type": "text" + }, + { + "bbox": [ + 158, + 539, + 182, + 554 + ], + "score": 0.93, + "content": "\\widetilde { A } _ { k + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 540, + 248, + 554 + ], + "score": 1.0, + "content": "by eq. (4) with", + "type": "text" + }, + { + "bbox": [ + 248, + 540, + 351, + 554 + ], + "score": 0.92, + "content": "U _ { k } \\gets \\widetilde { M } _ { k } , V _ { k } \\gets S _ { k } ^ { \\top } V _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 540, + 506, + 554 + ], + "score": 1.0, + "content": ". Note that such construction satisfies", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 552, + 375, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 375, + 565 + ], + "score": 1.0, + "content": "eq. (32), and hence also satisfies eq. (34), which further yields that", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 461, + 507, + 565 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 568, + 458, + 588 + ], + "lines": [ + { + "bbox": [ + 153, + 568, + 458, + 588 + ], + "spans": [ + { + "bbox": [ + 153, + 568, + 458, + 588 + ], + "score": 0.9, + "content": "\\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } \\widetilde { A } _ { k + 1 } A _ { ( k , 1 ) } \\pmb { X } = \\mathcal { P } _ { \\mathrm { c o l } ( \\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } ) } \\pmb { Y } ( A _ { ( k , 1 ) } \\pmb { X } ) ^ { \\dag } A _ { ( k , 1 ) } \\pmb { X } .", + "type": "interline_equation", + "image_path": "4a6859b8dd9506421eae5bd7bf75bdb430549e2975b9466b61f972029132bc38.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 153, + 568, + 458, + 588 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 592, + 434, + 605 + ], + "lines": [ + { + "bbox": [ + 106, + 592, + 433, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 433, + 606 + ], + "score": 1.0, + "content": "With the above equation, the function value at this perturbed point is evaluated as", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 592, + 433, + 606 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 609, + 444, + 628 + ], + "lines": [ + { + "bbox": [ + 165, + 609, + 444, + 628 + ], + "spans": [ + { + "bbox": [ + 165, + 609, + 444, + 628 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathcal { L } ( \\widetilde { A } _ { \\ell } , \\dots , \\widetilde { A } _ { k + 1 } , \\dots ) = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( S _ { k } ^ { \\top } \\pmb { U } _ { k } ^ { \\top } \\widetilde { M } _ { k } S _ { k } ^ { \\top } V _ { k } ) } \\pmb { \\Lambda } _ { k } \\big ) . } \\end{array}", + "type": "interline_equation", + "image_path": "c59ef393ace1a1f425b9d6bbb87df3c2dc4c434d49689eab8ecac4b49ffc2a0e.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 165, + 609, + 444, + 628 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 663 + ], + "lines": [ + { + "bbox": [ + 103, + 629, + 507, + 649 + ], + "spans": [ + { + "bbox": [ + 103, + 629, + 507, + 649 + ], + "score": 1.0, + "content": "Then, a careful calculation shows that only the i, j-th diagonal elements of Pcol(S>U>MkS>Vk)Λ", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 101, + 646, + 394, + 666 + ], + "spans": [ + { + "bbox": [ + 101, + 646, + 198, + 666 + ], + "score": 1.0, + "content": "have changed, and are", + "type": "text" + }, + { + "bbox": [ + 198, + 647, + 242, + 664 + ], + "score": 0.93, + "content": "\\textstyle { \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } } , { \\frac { 1 } { 1 + \\epsilon ^ { 2 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 646, + 394, + 666 + ], + "score": 1.0, + "content": ", respectively. We then conclude that", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 101, + 629, + 507, + 666 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 668, + 486, + 686 + ], + "lines": [ + { + "bbox": [ + 123, + 668, + 486, + 686 + ], + "spans": [ + { + "bbox": [ + 123, + 668, + 486, + 686 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { L } ( A _ { 1 } , \\ldots , \\widetilde { A } _ { k + 1 } , \\ldots , \\widetilde { A } _ { \\ell } ) = \\mathcal { L } ( A _ { 1 } , \\ldots , A _ { \\ell } ) - \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } ( \\sigma _ { i } ( k ) - \\sigma _ { j } ( k ) ) < \\mathcal { L } ( A _ { 1 } , \\ldots , A _ { \\ell } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "8d30dc7291a3703d37514a290115879688892c14e8f76079a999799029d93491.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 123, + 668, + 486, + 686 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 697, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 696, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 696, + 303, + 712 + ], + "score": 1.0, + "content": "Now consider a deep-optimal-order critical point", + "type": "text" + }, + { + "bbox": [ + 304, + 698, + 360, + 710 + ], + "score": 0.9, + "content": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 696, + 423, + 712 + ], + "score": 1.0, + "content": ". Note that with", + "type": "text" + }, + { + "bbox": [ + 424, + 698, + 459, + 711 + ], + "score": 0.92, + "content": "A _ { ( \\ell - 2 , 1 ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 696, + 506, + 712 + ], + "score": 1.0, + "content": "fixed to be", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 453, + 722 + ], + "score": 1.0, + "content": "a constant, the deep linear network reduces to a shallow linear network with parameters", + "type": "text" + }, + { + "bbox": [ + 453, + 709, + 501, + 721 + ], + "score": 0.9, + "content": "\\left( \\mathbf { 1 } _ { \\ell } , \\mathbf { A } _ { \\ell - 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 709, + 504, + 722 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 720, + 504, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 131, + 733 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 132, + 721, + 179, + 733 + ], + "score": 0.93, + "content": "\\left( \\mathbf { \\boldsymbol { A } } _ { \\ell } , \\mathbf { \\boldsymbol { A } } _ { \\ell - 1 } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 720, + 490, + 733 + ], + "score": 1.0, + "content": "is not a non-global minimum critical point of this shallow linear network and", + "type": "text" + }, + { + "bbox": [ + 491, + 721, + 504, + 732 + ], + "score": 0.88, + "content": "\\pmb { A } _ { \\ell }", + "type": "inline_equation" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "is of optimal-order, we can apply the perturbation scheme in the proof of Proposition 3 to identify a", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 488, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 95, + 158, + 109 + ], + "score": 1.0, + "content": "perturbation", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 158, + 93, + 206, + 108 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { \\ell } , \\widetilde { A } _ { \\ell - 1 } )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 206, + 95, + 227, + 109 + ], + "score": 1.0, + "content": "with", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 228, + 93, + 339, + 108 + ], + "score": 0.91, + "content": "\\mathrm { \\ddot { r a n k } } ( \\hat { \\tilde { \\mathbf { A } } } _ { \\ell } ) = \\mathrm { r a n k } ( A _ { \\ell } ) + 1", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 340, + 95, + 488, + 109 + ], + "score": 1.0, + "content": "that achieves a lower function value.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 696, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 82, + 505, + 107 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "is of optimal-order, we can apply the perturbation scheme in the proof of Proposition 3 to identify a", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 488, + 109 + ], + "spans": [ + { + "bbox": [ + 105, + 95, + 158, + 109 + ], + "score": 1.0, + "content": "perturbation", + "type": "text" + }, + { + "bbox": [ + 158, + 93, + 206, + 108 + ], + "score": 0.93, + "content": "( \\widetilde { A } _ { \\ell } , \\widetilde { A } _ { \\ell - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 95, + 227, + 109 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 228, + 93, + 339, + 108 + ], + "score": 0.91, + "content": "\\mathrm { \\ddot { r a n k } } ( \\hat { \\tilde { \\mathbf { A } } } _ { \\ell } ) = \\mathrm { r a n k } ( A _ { \\ell } ) + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 95, + 488, + 109 + ], + "score": 1.0, + "content": "that achieves a lower function value.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 505, + 169 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 506, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 198, + 126 + ], + "score": 1.0, + "content": "Consider any point in", + "type": "text" + }, + { + "bbox": [ + 198, + 113, + 213, + 124 + ], + "score": 0.91, + "content": "\\mathcal { X } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 111, + 246, + 126 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 246, + 112, + 304, + 126 + ], + "score": 0.92, + "content": "\\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } \\neq \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 111, + 469, + 126 + ], + "score": 1.0, + "content": ", we can scale the nonzero row, say, the", + "type": "text" + }, + { + "bbox": [ + 469, + 113, + 474, + 122 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 111, + 506, + 126 + ], + "score": 1.0, + "content": "-th row", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 123, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 107, + 124, + 181, + 137 + ], + "score": 0.91, + "content": "( A _ { \\ell } ) _ { i , : } A _ { ( \\ell - 1 , 1 ) } X", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 123, + 506, + 138 + ], + "score": 1.0, + "content": "properly in the same way as that in the proof of Proposition 3 to increase the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 134, + 505, + 148 + ], + "spans": [ + { + "bbox": [ + 105, + 134, + 505, + 148 + ], + "score": 1.0, + "content": "function value. Lastly, item 1 and item 2 imply that every local minimum is a global minimum for", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 160 + ], + "score": 1.0, + "content": "these two types of critical points. Moreover, combining items 1,2 and 3, we conclude that every", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 157, + 331, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 157, + 244, + 171 + ], + "score": 1.0, + "content": "critical point of these two types in", + "type": "text" + }, + { + "bbox": [ + 244, + 158, + 260, + 168 + ], + "score": 0.89, + "content": "\\mathcal { X } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 157, + 331, + 171 + ], + "score": 1.0, + "content": "is a saddle point.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4 + } + ], + "page_idx": 18, + "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": "19", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 104, + 82, + 505, + 107 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 82, + 506, + 109 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 505, + 169 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 506, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 198, + 126 + ], + "score": 1.0, + "content": "Consider any point in", + "type": "text" + }, + { + "bbox": [ + 198, + 113, + 213, + 124 + ], + "score": 0.91, + "content": "\\mathcal { X } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 111, + 246, + 126 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 246, + 112, + 304, + 126 + ], + "score": 0.92, + "content": "\\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } \\neq \\mathbf { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 111, + 469, + 126 + ], + "score": 1.0, + "content": ", we can scale the nonzero row, say, the", + "type": "text" + }, + { + "bbox": [ + 469, + 113, + 474, + 122 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 111, + 506, + 126 + ], + "score": 1.0, + "content": "-th row", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 123, + 506, + 138 + ], + "spans": [ + { + "bbox": [ + 107, + 124, + 181, + 137 + ], + "score": 0.91, + "content": "( A _ { \\ell } ) _ { i , : } A _ { ( \\ell - 1 , 1 ) } X", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 123, + 506, + 138 + ], + "score": 1.0, + "content": "properly in the same way as that in the proof of Proposition 3 to increase the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 134, + 505, + 148 + ], + "spans": [ + { + "bbox": [ + 105, + 134, + 505, + 148 + ], + "score": 1.0, + "content": "function value. Lastly, item 1 and item 2 imply that every local minimum is a global minimum for", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 160 + ], + "score": 1.0, + "content": "these two types of critical points. Moreover, combining items 1,2 and 3, we conclude that every", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 157, + 331, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 157, + 244, + 171 + ], + "score": 1.0, + "content": "critical point of these two types in", + "type": "text" + }, + { + "bbox": [ + 244, + 158, + 260, + 168 + ], + "score": 0.89, + "content": "\\mathcal { X } _ { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 157, + 331, + 171 + ], + "score": 1.0, + "content": "is a saddle point.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 111, + 506, + 171 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/SysEexbRb/SysEexbRb_model.json b/parse/train/SysEexbRb/SysEexbRb_model.json new file mode 100644 index 0000000000000000000000000000000000000000..c8cfe61faa165c73678773571057983e86c64c5d --- /dev/null +++ b/parse/train/SysEexbRb/SysEexbRb_model.json @@ -0,0 +1,34970 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 650, + 1302, + 650, + 1302, + 1106, + 398, + 1106 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1529, + 1403, + 1529, + 1403, + 1805, + 298, + 1805 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1238, + 1404, + 1238, + 1404, + 1513, + 298, + 1513 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1820, + 1402, + 1820, + 1402, + 2033, + 298, + 2033 + ], + "score": 0.978 + }, + { + "category_id": 0, + "poly": [ + 300, + 218, + 1399, + 218, + 1399, + 324, + 300, + 324 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 313, + 376, + 899, + 376, + 899, + 499, + 313, + 499 + ], + "score": 0.962 + }, + { + "category_id": 0, + "poly": [ + 302, + 1168, + 573, + 1168, + 573, + 1203, + 302, + 1203 + ], + "score": 0.89 + }, + { + "category_id": 0, + "poly": [ + 773, + 579, + 927, + 579, + 927, + 613, + 773, + 613 + ], + "score": 0.853 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 857, + 2088, + 857, + 2112, + 842, + 2112 + ], + "score": 0.647 + }, + { + "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": [ + 296.0, + 275.0, + 1363.0, + 275.0, + 1363.0, + 328.0, + 296.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1165.0, + 579.0, + 1165.0, + 579.0, + 1212.0, + 294.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 578.0, + 932.0, + 578.0, + 932.0, + 616.0, + 770.0, + 616.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": [ + 393.0, + 649.0, + 1304.0, + 649.0, + 1304.0, + 686.0, + 393.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 680.0, + 1306.0, + 680.0, + 1306.0, + 718.0, + 393.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 711.0, + 1305.0, + 711.0, + 1305.0, + 746.0, + 393.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 743.0, + 1306.0, + 743.0, + 1306.0, + 777.0, + 393.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 773.0, + 1307.0, + 773.0, + 1307.0, + 806.0, + 393.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 803.0, + 1306.0, + 803.0, + 1306.0, + 834.0, + 393.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 834.0, + 1305.0, + 834.0, + 1305.0, + 866.0, + 393.0, + 866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 865.0, + 1305.0, + 865.0, + 1305.0, + 896.0, + 394.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 893.0, + 1306.0, + 893.0, + 1306.0, + 928.0, + 394.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 925.0, + 1306.0, + 925.0, + 1306.0, + 960.0, + 394.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 955.0, + 1305.0, + 955.0, + 1305.0, + 988.0, + 394.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 982.0, + 1304.0, + 982.0, + 1304.0, + 1020.0, + 393.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1015.0, + 1305.0, + 1015.0, + 1305.0, + 1050.0, + 393.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1046.0, + 1304.0, + 1046.0, + 1304.0, + 1078.0, + 393.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1075.0, + 1289.0, + 1075.0, + 1289.0, + 1110.0, + 393.0, + 1110.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1531.0, + 1404.0, + 1531.0, + 1404.0, + 1564.0, + 297.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1561.0, + 1404.0, + 1561.0, + 1404.0, + 1594.0, + 294.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1591.0, + 1405.0, + 1591.0, + 1405.0, + 1624.0, + 294.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1621.0, + 1404.0, + 1621.0, + 1404.0, + 1654.0, + 296.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1651.0, + 1404.0, + 1651.0, + 1404.0, + 1688.0, + 293.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1681.0, + 1405.0, + 1681.0, + 1405.0, + 1718.0, + 294.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1713.0, + 1405.0, + 1713.0, + 1405.0, + 1749.0, + 294.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1739.0, + 1407.0, + 1739.0, + 1407.0, + 1781.0, + 292.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1771.0, + 1316.0, + 1771.0, + 1316.0, + 1811.0, + 293.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1239.0, + 1404.0, + 1239.0, + 1404.0, + 1271.0, + 294.0, + 1271.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1267.0, + 1406.0, + 1267.0, + 1406.0, + 1307.0, + 292.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1297.0, + 1405.0, + 1297.0, + 1405.0, + 1336.0, + 292.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1327.0, + 1408.0, + 1327.0, + 1408.0, + 1366.0, + 293.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1361.0, + 1406.0, + 1361.0, + 1406.0, + 1398.0, + 293.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1389.0, + 1405.0, + 1389.0, + 1405.0, + 1430.0, + 291.0, + 1430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1421.0, + 1405.0, + 1421.0, + 1405.0, + 1458.0, + 294.0, + 1458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1452.0, + 1406.0, + 1452.0, + 1406.0, + 1489.0, + 293.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1482.0, + 574.0, + 1482.0, + 574.0, + 1517.0, + 294.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1820.0, + 1404.0, + 1820.0, + 1404.0, + 1854.0, + 294.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1850.0, + 1407.0, + 1850.0, + 1407.0, + 1885.0, + 291.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1881.0, + 1406.0, + 1881.0, + 1406.0, + 1915.0, + 294.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1913.0, + 1403.0, + 1913.0, + 1403.0, + 1944.0, + 296.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 1403.0, + 1941.0, + 1403.0, + 1975.0, + 294.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2007.0, + 293.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2004.0, + 697.0, + 2004.0, + 697.0, + 2037.0, + 293.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 373.0, + 627.0, + 373.0, + 627.0, + 414.0, + 311.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 403.0, + 902.0, + 403.0, + 902.0, + 445.0, + 310.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 435.0, + 609.0, + 435.0, + 609.0, + 470.0, + 311.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 469.0, + 602.0, + 469.0, + 602.0, + 500.0, + 313.0, + 500.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 588, + 1403, + 588, + 1403, + 894, + 298, + 894 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1499, + 1403, + 1499, + 1403, + 1743, + 298, + 1743 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1758, + 1403, + 1758, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1403, + 229, + 1403, + 475, + 298, + 475 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1170, + 1403, + 1170, + 1403, + 1384, + 298, + 1384 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 910, + 1403, + 910, + 1403, + 1154, + 298, + 1154 + ], + "score": 0.979 + }, + { + "category_id": 0, + "poly": [ + 300, + 525, + 547, + 525, + 547, + 557, + 300, + 557 + ], + "score": 0.836 + }, + { + "category_id": 0, + "poly": [ + 299, + 1437, + 495, + 1437, + 495, + 1466, + 299, + 1466 + ], + "score": 0.736 + }, + { + "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.15 + }, + { + "category_id": 1, + "poly": [ + 299, + 1437, + 495, + 1437, + 495, + 1466, + 299, + 1466 + ], + "score": 0.139 + }, + { + "category_id": 15, + "poly": [ + 297.0, + 527.0, + 551.0, + 527.0, + 551.0, + 560.0, + 297.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1432.0, + 502.0, + 1432.0, + 502.0, + 1471.0, + 294.0, + 1471.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": [ + 295.0, + 585.0, + 1404.0, + 585.0, + 1404.0, + 628.0, + 295.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 615.0, + 1405.0, + 615.0, + 1405.0, + 657.0, + 293.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 647.0, + 1405.0, + 647.0, + 1405.0, + 686.0, + 294.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 680.0, + 1405.0, + 680.0, + 1405.0, + 714.0, + 292.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 711.0, + 1405.0, + 711.0, + 1405.0, + 746.0, + 293.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 741.0, + 1408.0, + 741.0, + 1408.0, + 776.0, + 292.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 773.0, + 1405.0, + 773.0, + 1405.0, + 807.0, + 292.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 804.0, + 1405.0, + 804.0, + 1405.0, + 836.0, + 296.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 834.0, + 1408.0, + 834.0, + 1408.0, + 869.0, + 294.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 863.0, + 1280.0, + 863.0, + 1280.0, + 900.0, + 293.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1498.0, + 1404.0, + 1498.0, + 1404.0, + 1534.0, + 294.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1530.0, + 1405.0, + 1530.0, + 1405.0, + 1564.0, + 294.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1561.0, + 1405.0, + 1561.0, + 1405.0, + 1595.0, + 296.0, + 1595.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, + 1621.0, + 1407.0, + 1621.0, + 1407.0, + 1654.0, + 294.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1651.0, + 1403.0, + 1651.0, + 1403.0, + 1686.0, + 293.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1682.0, + 1403.0, + 1682.0, + 1403.0, + 1715.0, + 294.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1713.0, + 572.0, + 1713.0, + 572.0, + 1748.0, + 296.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1760.0, + 1404.0, + 1760.0, + 1404.0, + 1793.0, + 296.0, + 1793.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, + 1405.0, + 1822.0, + 1405.0, + 1854.0, + 296.0, + 1854.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": [ + 294.0, + 1882.0, + 1407.0, + 1882.0, + 1407.0, + 1918.0, + 294.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1910.0, + 1405.0, + 1910.0, + 1405.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1978.0, + 294.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1970.0, + 1405.0, + 1970.0, + 1405.0, + 2008.0, + 293.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1999.0, + 1405.0, + 1999.0, + 1405.0, + 2041.0, + 292.0, + 2041.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": [ + 294.0, + 262.0, + 1405.0, + 262.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, + 326.0, + 294.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 321.0, + 1403.0, + 321.0, + 1403.0, + 357.0, + 294.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 354.0, + 1404.0, + 354.0, + 1404.0, + 384.0, + 296.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 382.0, + 1406.0, + 382.0, + 1406.0, + 418.0, + 292.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 413.0, + 1405.0, + 413.0, + 1405.0, + 451.0, + 293.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 445.0, + 608.0, + 445.0, + 608.0, + 478.0, + 294.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1170.0, + 1404.0, + 1170.0, + 1404.0, + 1205.0, + 296.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1203.0, + 1404.0, + 1203.0, + 1404.0, + 1234.0, + 296.0, + 1234.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": [ + 293.0, + 1264.0, + 1405.0, + 1264.0, + 1405.0, + 1298.0, + 293.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1293.0, + 1405.0, + 1293.0, + 1405.0, + 1327.0, + 293.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1324.0, + 1405.0, + 1324.0, + 1405.0, + 1358.0, + 293.0, + 1358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1352.0, + 1392.0, + 1352.0, + 1392.0, + 1389.0, + 293.0, + 1389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 911.0, + 1404.0, + 911.0, + 1404.0, + 945.0, + 294.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 941.0, + 1405.0, + 941.0, + 1405.0, + 975.0, + 296.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 972.0, + 1404.0, + 972.0, + 1404.0, + 1006.0, + 294.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1000.0, + 1405.0, + 1000.0, + 1405.0, + 1036.0, + 293.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1033.0, + 1405.0, + 1033.0, + 1405.0, + 1067.0, + 294.0, + 1067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1063.0, + 1404.0, + 1063.0, + 1404.0, + 1096.0, + 294.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1095.0, + 1404.0, + 1095.0, + 1404.0, + 1129.0, + 294.0, + 1129.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1125.0, + 926.0, + 1125.0, + 926.0, + 1155.0, + 297.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1432.0, + 502.0, + 1432.0, + 502.0, + 1471.0, + 294.0, + 1471.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 305, + 1404, + 305, + 1404, + 857, + 298, + 857 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 872, + 1404, + 872, + 1404, + 1269, + 298, + 1269 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1555, + 1405, + 1555, + 1405, + 1772, + 298, + 1772 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1849, + 1403, + 1849, + 1403, + 2034, + 297, + 2034 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1284, + 1403, + 1284, + 1403, + 1439, + 299, + 1439 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 1399, + 229, + 1399, + 292, + 297, + 292 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 694, + 1790, + 1003, + 1790, + 1003, + 1836, + 694, + 1836 + ], + "score": 0.943 + }, + { + "category_id": 0, + "poly": [ + 299, + 1485, + 1155, + 1485, + 1155, + 1522, + 299, + 1522 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.621 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.474 + }, + { + "category_id": 13, + "poly": [ + 685, + 1376, + 1038, + 1376, + 1038, + 1410, + 685, + 1410 + ], + "score": 0.93, + "latex": "i : j = \\{ i , i + 1 , \\dotsc , j - 1 , j \\}" + }, + { + "category_id": 13, + "poly": [ + 1001, + 1708, + 1160, + 1708, + 1160, + 1741, + 1001, + 1741 + ], + "score": 0.93, + "latex": "A _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }" + }, + { + "category_id": 13, + "poly": [ + 823, + 1677, + 994, + 1677, + 994, + 1710, + 823, + 1710 + ], + "score": 0.93, + "latex": "A _ { 2 } ~ \\in ~ \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }" + }, + { + "category_id": 13, + "poly": [ + 432, + 1586, + 582, + 1586, + 582, + 1617, + 432, + 1617 + ], + "score": 0.92, + "latex": "\\pmb { X } \\in \\mathbb { R } ^ { d _ { 0 } \\times \\pmb { m } }" + }, + { + "category_id": 13, + "poly": [ + 682, + 1912, + 838, + 1912, + 838, + 1943, + 682, + 1943 + ], + "score": 0.92, + "latex": "d _ { 2 } = d _ { 0 } \\geq d _ { 1 }" + }, + { + "category_id": 14, + "poly": [ + 693, + 1789, + 1006, + 1789, + 1006, + 1835, + 693, + 1835 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\mathcal { L } : = \\frac { 1 } { 2 } \\left\\| A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\right\\| _ { F } ^ { 2 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1036, + 1587, + 1183, + 1587, + 1183, + 1617, + 1036, + 1617 + ], + "score": 0.92, + "latex": "\\dot { \\boldsymbol { Y } } \\in \\mathbb { R } ^ { d _ { 2 } ^ { - } \\times m }" + }, + { + "category_id": 13, + "poly": [ + 487, + 1377, + 555, + 1377, + 555, + 1408, + 487, + 1408 + ], + "score": 0.9, + "latex": "i \\leq j" + }, + { + "category_id": 13, + "poly": [ + 506, + 1315, + 603, + 1315, + 603, + 1348, + 506, + 1348 + ], + "score": 0.9, + "latex": "\\ker ( M )" + }, + { + "category_id": 13, + "poly": [ + 662, + 1408, + 703, + 1408, + 703, + 1437, + 662, + 1437 + ], + "score": 0.88, + "latex": "{ \\mathcal { P } } _ { V }" + }, + { + "category_id": 13, + "poly": [ + 1039, + 1909, + 1361, + 1909, + 1361, + 1945, + 1039, + 1945 + ], + "score": 0.85, + "latex": "X X ^ { \\top } , Y X ^ { \\top } ( X X ^ { \\top } ) ^ { - 1 } X Y ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1314, + 449, + 1314, + 449, + 1348, + 298, + 1348 + ], + "score": 0.84, + "latex": "M ^ { \\dagger } , \\mathrm { c o l } ( M )" + }, + { + "category_id": 13, + "poly": [ + 965, + 1883, + 987, + 1883, + 987, + 1909, + 965, + 1909 + ], + "score": 0.82, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 1169, + 1620, + 1200, + 1620, + 1200, + 1647, + 1169, + 1647 + ], + "score": 0.81, + "latex": "\\boldsymbol { X }" + }, + { + "category_id": 13, + "poly": [ + 1236, + 1619, + 1265, + 1619, + 1265, + 1646, + 1236, + 1646 + ], + "score": 0.79, + "latex": "\\mathbf { Y }" + }, + { + "category_id": 13, + "poly": [ + 413, + 1348, + 451, + 1348, + 451, + 1374, + 413, + 1374 + ], + "score": 0.79, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 474, + 1408, + 499, + 1408, + 499, + 1434, + 474, + 1434 + ], + "score": 0.77, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 675, + 1851, + 763, + 1851, + 763, + 1878, + 675, + 1878 + ], + "score": 0.76, + "latex": "X = I" + }, + { + "category_id": 13, + "poly": [ + 986, + 1348, + 1005, + 1348, + 1005, + 1373, + 986, + 1373 + ], + "score": 0.75, + "latex": "I" + }, + { + "category_id": 13, + "poly": [ + 775, + 1852, + 797, + 1852, + 797, + 1878, + 775, + 1878 + ], + "score": 0.73, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 355, + 1623, + 384, + 1623, + 384, + 1646, + 355, + 1646 + ], + "score": 0.72, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 1317, + 1347, + 1338, + 1347, + 1338, + 1373, + 1317, + 1373 + ], + "score": 0.71, + "latex": "J" + }, + { + "category_id": 13, + "poly": [ + 1173, + 1285, + 1212, + 1285, + 1212, + 1313, + 1173, + 1313 + ], + "score": 0.68, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 998, + 1315, + 1121, + 1315, + 1121, + 1347, + 998, + 1347 + ], + "score": 0.63, + "latex": "I , J \\subset \\mathbb { N }" + }, + { + "category_id": 13, + "poly": [ + 1135, + 1316, + 1204, + 1316, + 1204, + 1349, + 1135, + 1349 + ], + "score": 0.53, + "latex": "M _ { I , J }" + }, + { + "category_id": 13, + "poly": [ + 1031, + 1910, + 1101, + 1910, + 1101, + 1942, + 1031, + 1942 + ], + "score": 0.48, + "latex": "\\pmb { X X } ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1313, + 346, + 1313, + 346, + 1346, + 298, + 1346 + ], + "score": 0.34, + "latex": "M ^ { \\dagger }" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1482.0, + 1160.0, + 1482.0, + 1160.0, + 1527.0, + 291.0, + 1527.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": [ + 292.0, + 307.0, + 1405.0, + 307.0, + 1405.0, + 342.0, + 292.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 340.0, + 1404.0, + 340.0, + 1404.0, + 372.0, + 296.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 368.0, + 1405.0, + 368.0, + 1405.0, + 401.0, + 293.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 401.0, + 1404.0, + 401.0, + 1404.0, + 433.0, + 296.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 431.0, + 1405.0, + 431.0, + 1405.0, + 463.0, + 296.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 463.0, + 1404.0, + 463.0, + 1404.0, + 494.0, + 296.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 491.0, + 1406.0, + 491.0, + 1406.0, + 526.0, + 294.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 521.0, + 1404.0, + 521.0, + 1404.0, + 557.0, + 294.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 553.0, + 1402.0, + 553.0, + 1402.0, + 585.0, + 296.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 581.0, + 1403.0, + 581.0, + 1403.0, + 619.0, + 293.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 613.0, + 1402.0, + 613.0, + 1402.0, + 645.0, + 296.0, + 645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 642.0, + 1405.0, + 642.0, + 1405.0, + 678.0, + 294.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 675.0, + 1405.0, + 675.0, + 1405.0, + 707.0, + 296.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 705.0, + 1405.0, + 705.0, + 1405.0, + 736.0, + 296.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 736.0, + 1405.0, + 736.0, + 1405.0, + 768.0, + 294.0, + 768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 766.0, + 1405.0, + 766.0, + 1405.0, + 797.0, + 296.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 796.0, + 1406.0, + 796.0, + 1406.0, + 832.0, + 294.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 823.0, + 595.0, + 823.0, + 595.0, + 863.0, + 293.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 870.0, + 1404.0, + 870.0, + 1404.0, + 909.0, + 295.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 901.0, + 1405.0, + 901.0, + 1405.0, + 940.0, + 293.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 933.0, + 1402.0, + 933.0, + 1402.0, + 966.0, + 296.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 964.0, + 1402.0, + 964.0, + 1402.0, + 997.0, + 296.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 994.0, + 1404.0, + 994.0, + 1404.0, + 1030.0, + 293.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1023.0, + 1405.0, + 1023.0, + 1405.0, + 1060.0, + 293.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1054.0, + 1406.0, + 1054.0, + 1406.0, + 1091.0, + 292.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1082.0, + 1405.0, + 1082.0, + 1405.0, + 1122.0, + 292.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1117.0, + 1406.0, + 1117.0, + 1406.0, + 1151.0, + 294.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1148.0, + 1404.0, + 1148.0, + 1404.0, + 1181.0, + 296.0, + 1181.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1179.0, + 1402.0, + 1179.0, + 1402.0, + 1212.0, + 296.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1208.0, + 1404.0, + 1208.0, + 1404.0, + 1244.0, + 294.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1236.0, + 860.0, + 1236.0, + 860.0, + 1275.0, + 293.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1555.0, + 1406.0, + 1555.0, + 1406.0, + 1593.0, + 293.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1581.0, + 431.0, + 1581.0, + 431.0, + 1626.0, + 291.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 1581.0, + 1035.0, + 1581.0, + 1035.0, + 1626.0, + 583.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 1581.0, + 1410.0, + 1581.0, + 1410.0, + 1626.0, + 1184.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1616.0, + 354.0, + 1616.0, + 354.0, + 1655.0, + 293.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 1616.0, + 1168.0, + 1616.0, + 1168.0, + 1655.0, + 385.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 1616.0, + 1235.0, + 1616.0, + 1235.0, + 1655.0, + 1201.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 1616.0, + 1407.0, + 1616.0, + 1407.0, + 1655.0, + 1266.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1651.0, + 1403.0, + 1651.0, + 1403.0, + 1682.0, + 295.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1672.0, + 822.0, + 1672.0, + 822.0, + 1714.0, + 292.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 1672.0, + 1406.0, + 1672.0, + 1406.0, + 1714.0, + 995.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1704.0, + 1000.0, + 1704.0, + 1000.0, + 1746.0, + 292.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 1704.0, + 1408.0, + 1704.0, + 1408.0, + 1746.0, + 1161.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1739.0, + 1019.0, + 1739.0, + 1019.0, + 1776.0, + 295.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1851.0, + 674.0, + 1851.0, + 674.0, + 1883.0, + 295.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 1851.0, + 774.0, + 1851.0, + 774.0, + 1883.0, + 764.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1851.0, + 1404.0, + 1851.0, + 1404.0, + 1883.0, + 798.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1880.0, + 964.0, + 1880.0, + 964.0, + 1916.0, + 293.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 1880.0, + 1405.0, + 1880.0, + 1405.0, + 1916.0, + 988.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1905.0, + 681.0, + 1905.0, + 681.0, + 1949.0, + 290.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 1905.0, + 1030.0, + 1905.0, + 1030.0, + 1949.0, + 839.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1362.0, + 1905.0, + 1409.0, + 1905.0, + 1409.0, + 1949.0, + 1362.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1944.0, + 1401.0, + 1944.0, + 1401.0, + 1976.0, + 295.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1972.0, + 1404.0, + 1972.0, + 1404.0, + 2004.0, + 295.0, + 2004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2003.0, + 1095.0, + 2003.0, + 1095.0, + 2034.0, + 295.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1280.0, + 1172.0, + 1280.0, + 1172.0, + 1320.0, + 294.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 1280.0, + 1404.0, + 1280.0, + 1404.0, + 1320.0, + 1213.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1315.0, + 505.0, + 1315.0, + 505.0, + 1348.0, + 450.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1315.0, + 997.0, + 1315.0, + 997.0, + 1348.0, + 604.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 1315.0, + 1134.0, + 1315.0, + 1134.0, + 1348.0, + 1122.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 1315.0, + 1402.0, + 1315.0, + 1402.0, + 1348.0, + 1205.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1346.0, + 412.0, + 1346.0, + 412.0, + 1379.0, + 295.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 1346.0, + 985.0, + 1346.0, + 985.0, + 1379.0, + 452.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 1346.0, + 1316.0, + 1346.0, + 1316.0, + 1379.0, + 1006.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 1346.0, + 1404.0, + 1346.0, + 1404.0, + 1379.0, + 1339.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1376.0, + 486.0, + 1376.0, + 486.0, + 1413.0, + 295.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1376.0, + 684.0, + 1376.0, + 684.0, + 1413.0, + 556.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1376.0, + 1408.0, + 1376.0, + 1408.0, + 1413.0, + 1039.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1404.0, + 473.0, + 1404.0, + 473.0, + 1443.0, + 294.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 1404.0, + 661.0, + 1404.0, + 661.0, + 1443.0, + 500.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 1404.0, + 714.0, + 1404.0, + 714.0, + 1443.0, + 704.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 1404.0, + 227.0, + 1404.0, + 266.0, + 293.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 715.0, + 261.0, + 715.0, + 296.0, + 295.0, + 296.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 869, + 1404, + 869, + 1404, + 1147, + 296, + 1147 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 296, + 1369, + 1405, + 1369, + 1405, + 1648, + 296, + 1648 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 583, + 1404, + 583, + 1404, + 684, + 297, + 684 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 225, + 1404, + 225, + 1404, + 384, + 297, + 384 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 762, + 1402, + 762, + 1402, + 856, + 298, + 856 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 391, + 1399, + 391, + 1399, + 484, + 297, + 484 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 296, + 1971, + 1401, + 1971, + 1401, + 2035, + 296, + 2035 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 296, + 1244, + 1399, + 1244, + 1399, + 1308, + 296, + 1308 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 646, + 694, + 1055, + 694, + 1055, + 739, + 646, + 739 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 296, + 1153, + 1399, + 1153, + 1399, + 1224, + 296, + 1224 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 295, + 1654, + 1402, + 1654, + 1402, + 1719, + 295, + 1719 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 295, + 1884, + 1400, + 1884, + 1400, + 1947, + 295, + 1947 + ], + "score": 0.917 + }, + { + "category_id": 1, + "poly": [ + 297, + 1729, + 1405, + 1729, + 1405, + 1875, + 297, + 1875 + ], + "score": 0.9 + }, + { + "category_id": 9, + "poly": [ + 1366, + 702, + 1400, + 702, + 1400, + 732, + 1366, + 732 + ], + "score": 0.88 + }, + { + "category_id": 1, + "poly": [ + 294, + 1313, + 1397, + 1313, + 1397, + 1352, + 294, + 1352 + ], + "score": 0.868 + }, + { + "category_id": 9, + "poly": [ + 1366, + 539, + 1400, + 539, + 1400, + 568, + 1366, + 568 + ], + "score": 0.865 + }, + { + "category_id": 9, + "poly": [ + 1366, + 500, + 1400, + 500, + 1400, + 529, + 1366, + 529 + ], + "score": 0.862 + }, + { + "category_id": 8, + "poly": [ + 543, + 492, + 1155, + 492, + 1155, + 530, + 543, + 530 + ], + "score": 0.787 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2111, + 841, + 2111 + ], + "score": 0.773 + }, + { + "category_id": 8, + "poly": [ + 543, + 492, + 1154, + 492, + 1154, + 568, + 543, + 568 + ], + "score": 0.472 + }, + { + "category_id": 8, + "poly": [ + 543, + 536, + 702, + 536, + 702, + 569, + 543, + 569 + ], + "score": 0.103 + }, + { + "category_id": 13, + "poly": [ + 746, + 1585, + 836, + 1585, + 836, + 1620, + 746, + 1620 + ], + "score": 0.93, + "latex": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }" + }, + { + "category_id": 13, + "poly": [ + 871, + 1807, + 1013, + 1807, + 1013, + 1837, + 871, + 1837 + ], + "score": 0.93, + "latex": "i = 1 , \\ldots , r _ { : }" + }, + { + "category_id": 13, + "poly": [ + 426, + 1555, + 516, + 1555, + 516, + 1589, + 426, + 1589 + ], + "score": 0.93, + "latex": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }" + }, + { + "category_id": 13, + "poly": [ + 903, + 1154, + 993, + 1154, + 993, + 1189, + 903, + 1189 + ], + "score": 0.93, + "latex": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }" + }, + { + "category_id": 13, + "poly": [ + 1044, + 421, + 1197, + 421, + 1197, + 451, + 1044, + 451 + ], + "score": 0.92, + "latex": "V ~ \\in \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }" + }, + { + "category_id": 13, + "poly": [ + 1258, + 1372, + 1348, + 1372, + 1348, + 1406, + 1258, + 1406 + ], + "score": 0.92, + "latex": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }" + }, + { + "category_id": 13, + "poly": [ + 694, + 421, + 855, + 421, + 855, + 453, + 694, + 453 + ], + "score": 0.92, + "latex": "\\pmb { L } _ { 1 } \\in \\overline { { \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } } } }" + }, + { + "category_id": 13, + "poly": [ + 378, + 452, + 521, + 452, + 521, + 482, + 378, + 482 + ], + "score": 0.92, + "latex": "C \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 1 } }" + }, + { + "category_id": 13, + "poly": [ + 1106, + 1188, + 1393, + 1188, + 1393, + 1225, + 1106, + 1225 + ], + "score": 0.92, + "latex": "\\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + { \\bar { p } } = \\operatorname { r a n k } ( A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 405, + 650, + 699, + 650, + 699, + 685, + 405, + 685 + ], + "score": 0.92, + "latex": "{ \\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( A _ { 2 } ) }" + }, + { + "category_id": 13, + "poly": [ + 505, + 228, + 717, + 228, + 717, + 259, + 505, + 259 + ], + "score": 0.92, + "latex": "\\Sigma : = Y X ^ { \\dagger } X Y ^ { \\top }" + }, + { + "category_id": 14, + "poly": [ + 646, + 693, + 1058, + 693, + 1058, + 739, + 646, + 739 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( U V ) ^ { \\perp } } \\mathbf { { \\mathit { Y X } } ^ { \\top } } \\mathbf { { \\mathit { L } } _ { 1 } ^ { \\top } } \\mathbf { { \\mathit { C } } ^ { \\top } } \\mathcal { P } _ { \\mathrm { k e r } ( V ) } = \\mathbf { { 0 } } ." + }, + { + "category_id": 13, + "poly": [ + 1108, + 1655, + 1215, + 1655, + 1215, + 1689, + 1108, + 1689 + ], + "score": 0.92, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 889, + 794, + 965, + 794, + 965, + 825, + 889, + 825 + ], + "score": 0.92, + "latex": "\\mathbf { A } _ { 2 } \\mathbf { A } _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 673, + 1315, + 780, + 1315, + 780, + 1350, + 673, + 1350 + ], + "score": 0.92, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 419, + 933, + 530, + 933, + 530, + 964, + 419, + 964 + ], + "score": 0.91, + "latex": "L _ { 1 } , V , C" + }, + { + "category_id": 13, + "poly": [ + 482, + 1247, + 691, + 1247, + 691, + 1277, + 482, + 1277 + ], + "score": 0.91, + "latex": "p _ { i } , i = 1 , \\ldots , r , \\bar { p }" + }, + { + "category_id": 13, + "poly": [ + 326, + 1187, + 421, + 1187, + 421, + 1224, + 326, + 1224 + ], + "score": 0.91, + "latex": "\\{ V _ { i } \\} _ { i = 1 } ^ { r }" + }, + { + "category_id": 13, + "poly": [ + 1092, + 293, + 1199, + 293, + 1199, + 324, + 1092, + 324 + ], + "score": 0.91, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1126, + 588, + 1285, + 588, + 1285, + 620, + 1126, + 620 + ], + "score": 0.91, + "latex": "V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 759, + 651, + 870, + 651, + 870, + 683, + 759, + 683 + ], + "score": 0.91, + "latex": "L _ { 1 } , V , C" + }, + { + "category_id": 14, + "poly": [ + 540, + 490, + 1158, + 490, + 1158, + 574, + 540, + 574 + ], + "score": 0.9, + "latex": "\\begin{array} { r l } & { A _ { 1 } = C ^ { - 1 } V ^ { \\top } U ^ { \\top } Y X ^ { \\dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \\top } V C L _ { 1 } X X ^ { \\dagger } } \\\\ & { A _ { 2 } = U V C . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1059, + 622, + 1401, + 622, + 1401, + 652, + 1059, + 652 + ], + "score": 0.9, + "latex": "p _ { i } \\leq m _ { i } , i = 1 , . . . , r , \\bar { p } \\leq \\bar { m }" + }, + { + "category_id": 13, + "poly": [ + 1073, + 1807, + 1144, + 1807, + 1144, + 1838, + 1073, + 1838 + ], + "score": 0.9, + "latex": "\\bar { p } \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 928, + 263, + 1185, + 263, + 1185, + 292, + 928, + 292 + ], + "score": 0.89, + "latex": "\\sigma _ { 1 } > \\cdots > \\sigma _ { r } > 0" + }, + { + "category_id": 13, + "poly": [ + 1184, + 934, + 1275, + 934, + 1275, + 962, + 1184, + 962 + ], + "score": 0.89, + "latex": "\\mathbf { L } _ { 1 } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 298, + 619, + 372, + 619, + 372, + 647, + 298, + 647 + ], + "score": 0.89, + "latex": "\\bar { \\mathbb { R } } ^ { \\bar { m } \\times \\bar { p } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 297, + 435, + 297, + 435, + 323, + 298, + 323 + ], + "score": 0.89, + "latex": "m _ { 1 } , \\ldots , m _ { r }" + }, + { + "category_id": 13, + "poly": [ + 529, + 322, + 801, + 322, + 801, + 355, + 529, + 355 + ], + "score": 0.89, + "latex": "\\nabla _ { A _ { 1 } } \\mathcal { L } = \\mathbf { 0 } , \\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1364, + 795, + 1400, + 795, + 1400, + 825, + 1364, + 825 + ], + "score": 0.88, + "latex": "\\mathbf { L } _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 773, + 1771, + 841, + 1771, + 841, + 1802, + 773, + 1802 + ], + "score": 0.88, + "latex": "k \\leq r" + }, + { + "category_id": 13, + "poly": [ + 435, + 1731, + 727, + 1731, + 727, + 1768, + 435, + 1768 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} \\le \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1307, + 227, + 1394, + 227, + 1394, + 260, + 1307, + 260 + ], + "score": 0.88, + "latex": "U \\pmb { \\Lambda } U ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 574, + 1838, + 826, + 1838, + 826, + 1875, + 574, + 1875 + ], + "score": 0.88, + "latex": "\\textstyle { \\mathrm { r a n k } } ( A _ { 2 } ) = \\sum _ { i = 1 } ^ { r } m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 982, + 1738, + 1403, + 1738, + 1403, + 1767, + 982, + 1767 + ], + "score": 0.87, + "latex": "p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =" + }, + { + "category_id": 13, + "poly": [ + 774, + 1438, + 811, + 1438, + 811, + 1464, + 774, + 1464 + ], + "score": 0.87, + "latex": "m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1011, + 1190, + 1049, + 1190, + 1049, + 1220, + 1011, + 1220 + ], + "score": 0.87, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1343, + 585, + 1405, + 585, + 1405, + 620, + 1343, + 620 + ], + "score": 0.87, + "latex": "\\overline { { V } } \\in" + }, + { + "category_id": 13, + "poly": [ + 297, + 1024, + 333, + 1024, + 333, + 1055, + 297, + 1055 + ], + "score": 0.86, + "latex": "\\mathbf { L } _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1305, + 1410, + 1342, + 1410, + 1342, + 1434, + 1305, + 1434 + ], + "score": 0.86, + "latex": "m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1314, + 1806, + 1353, + 1806, + 1353, + 1836, + 1314, + 1836 + ], + "score": 0.86, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 970, + 960, + 1271, + 960, + 1271, + 994, + 970, + 994 + ], + "score": 0.86, + "latex": "( C ^ { - \\mathrm { i } } V ^ { \\dagger } U ^ { \\top } Y X ^ { \\dagger } , U V C )" + }, + { + "category_id": 13, + "poly": [ + 1076, + 1407, + 1105, + 1407, + 1105, + 1434, + 1076, + 1434 + ], + "score": 0.86, + "latex": "\\sigma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 331, + 1767, + 666, + 1767, + 666, + 1806, + 331, + 1806 + ], + "score": 0.85, + "latex": "\\begin{array} { r } { \\operatorname { r a n k } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\le m _ { k } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1267, + 1469, + 1295, + 1469, + 1295, + 1495, + 1267, + 1495 + ], + "score": 0.85, + "latex": "p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 669, + 1438, + 696, + 1438, + 696, + 1465, + 669, + 1465 + ], + "score": 0.85, + "latex": "p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1177, + 1438, + 1205, + 1438, + 1205, + 1464, + 1177, + 1464 + ], + "score": 0.84, + "latex": "\\sigma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 989, + 1439, + 1017, + 1439, + 1017, + 1464, + 989, + 1464 + ], + "score": 0.84, + "latex": "\\sigma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 930, + 1311, + 1394, + 1311, + 1394, + 1353, + 930, + 1353 + ], + "score": 0.84, + "latex": "\\begin{array} { r } { \\mathcal { L } ( A _ { 1 } , A _ { 2 } ) = \\frac { 1 } { 2 } ( \\mathrm { T r } ( Y Y ^ { \\top } ) - \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 477, + 323, + 500, + 323, + 500, + 350, + 477, + 350 + ], + "score": 0.84, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 439, + 585, + 982, + 585, + 982, + 623, + 439, + 623 + ], + "score": 0.83, + "latex": "V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { { V } } } ) , \\mathbf { 0 } ^ { d _ { 2 } \\times ( d _ { 1 } - \\mathrm { r a n k } ( { \\bf A } _ { 2 } ) ) } ] ," + }, + { + "category_id": 13, + "poly": [ + 743, + 1734, + 783, + 1734, + 783, + 1765, + 743, + 1765 + ], + "score": 0.83, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 782, + 1374, + 805, + 1374, + 805, + 1400, + 782, + 1400 + ], + "score": 0.82, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 1223, + 903, + 1245, + 903, + 1245, + 929, + 1223, + 929 + ], + "score": 0.82, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 775, + 1404, + 801, + 1404, + 801, + 1431, + 775, + 1431 + ], + "score": 0.81, + "latex": "\\pmb { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 472, + 1186, + 499, + 1186, + 499, + 1218, + 472, + 1218 + ], + "score": 0.81, + "latex": "\\overline { V }" + }, + { + "category_id": 13, + "poly": [ + 468, + 994, + 496, + 994, + 496, + 1022, + 468, + 1022 + ], + "score": 0.81, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 984, + 1025, + 1012, + 1025, + 1012, + 1052, + 984, + 1052 + ], + "score": 0.81, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 651, + 1279, + 674, + 1279, + 674, + 1304, + 651, + 1304 + ], + "score": 0.81, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 634, + 2003, + 660, + 2003, + 660, + 2030, + 634, + 2030 + ], + "score": 0.8, + "latex": "\\pmb { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 486, + 354, + 508, + 354, + 508, + 380, + 486, + 380 + ], + "score": 0.8, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 454, + 262, + 481, + 262, + 481, + 290, + 454, + 290 + ], + "score": 0.79, + "latex": "\\pmb { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 687, + 295, + 715, + 295, + 715, + 319, + 687, + 319 + ], + "score": 0.79, + "latex": "\\bar { m }" + }, + { + "category_id": 13, + "poly": [ + 421, + 795, + 449, + 795, + 449, + 822, + 421, + 822 + ], + "score": 0.79, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 1240, + 765, + 1261, + 765, + 1261, + 791, + 1240, + 791 + ], + "score": 0.79, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 428, + 1807, + 710, + 1807, + 710, + 1839, + 428, + 1839 + ], + "score": 0.78, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 732, + 1246, + 761, + 1246, + 761, + 1274, + 732, + 1274 + ], + "score": 0.77, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 727, + 1808, + 826, + 1808, + 826, + 1837, + 727, + 1837 + ], + "score": 0.77, + "latex": "p _ { i } = m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1097, + 394, + 1119, + 394, + 1119, + 420, + 1097, + 420 + ], + "score": 0.75, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 534, + 268, + 552, + 268, + 552, + 289, + 534, + 289 + ], + "score": 0.74, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 1045, + 1157, + 1063, + 1157, + 1063, + 1187, + 1045, + 1187 + ], + "score": 0.73, + "latex": "\\bar { p }" + }, + { + "category_id": 13, + "poly": [ + 743, + 994, + 772, + 994, + 772, + 1022, + 743, + 1022 + ], + "score": 0.72, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 582, + 1025, + 611, + 1025, + 611, + 1052, + 582, + 1052 + ], + "score": 0.71, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 812, + 1317, + 834, + 1317, + 834, + 1345, + 812, + 1345 + ], + "score": 0.68, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 1251, + 1657, + 1274, + 1657, + 1274, + 1684, + 1251, + 1684 + ], + "score": 0.68, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 355, + 1436, + 368, + 1436, + 368, + 1461, + 355, + 1461 + ], + "score": 0.67, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 544, + 1467, + 557, + 1467, + 557, + 1492, + 544, + 1492 + ], + "score": 0.36, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 397, + 1735, + 414, + 1735, + 414, + 1761, + 397, + 1761 + ], + "score": 0.25, + "latex": "^ { l }" + }, + { + "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": [ + 294.0, + 870.0, + 1405.0, + 870.0, + 1405.0, + 907.0, + 294.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 898.0, + 1222.0, + 898.0, + 1222.0, + 941.0, + 291.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 898.0, + 1406.0, + 898.0, + 1406.0, + 941.0, + 1246.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 929.0, + 418.0, + 929.0, + 418.0, + 969.0, + 294.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 531.0, + 929.0, + 1183.0, + 929.0, + 1183.0, + 969.0, + 531.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 929.0, + 1406.0, + 929.0, + 1406.0, + 969.0, + 1276.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 958.0, + 969.0, + 958.0, + 969.0, + 999.0, + 291.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 958.0, + 1405.0, + 958.0, + 1405.0, + 999.0, + 1272.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 991.0, + 467.0, + 991.0, + 467.0, + 1029.0, + 293.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 991.0, + 742.0, + 991.0, + 742.0, + 1029.0, + 497.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 991.0, + 1406.0, + 991.0, + 1406.0, + 1029.0, + 773.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 1022.0, + 581.0, + 1022.0, + 581.0, + 1059.0, + 334.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 1022.0, + 983.0, + 1022.0, + 983.0, + 1059.0, + 612.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1022.0, + 1406.0, + 1022.0, + 1406.0, + 1059.0, + 1013.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1054.0, + 1406.0, + 1054.0, + 1406.0, + 1091.0, + 294.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1079.0, + 1405.0, + 1079.0, + 1405.0, + 1124.0, + 291.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1114.0, + 1235.0, + 1114.0, + 1235.0, + 1151.0, + 294.0, + 1151.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1368.0, + 781.0, + 1368.0, + 781.0, + 1412.0, + 291.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1368.0, + 1257.0, + 1368.0, + 1257.0, + 1412.0, + 806.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 1368.0, + 1408.0, + 1368.0, + 1408.0, + 1412.0, + 1349.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1399.0, + 774.0, + 1399.0, + 774.0, + 1439.0, + 293.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 1399.0, + 1075.0, + 1399.0, + 1075.0, + 1439.0, + 802.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 1399.0, + 1304.0, + 1399.0, + 1304.0, + 1439.0, + 1106.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1399.0, + 1407.0, + 1399.0, + 1407.0, + 1439.0, + 1343.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1431.0, + 354.0, + 1431.0, + 354.0, + 1470.0, + 293.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1431.0, + 668.0, + 1431.0, + 668.0, + 1470.0, + 369.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 1431.0, + 773.0, + 1431.0, + 773.0, + 1470.0, + 697.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 812.0, + 1431.0, + 988.0, + 1431.0, + 988.0, + 1470.0, + 812.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 1431.0, + 1176.0, + 1431.0, + 1176.0, + 1470.0, + 1018.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1431.0, + 1406.0, + 1431.0, + 1406.0, + 1470.0, + 1206.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1462.0, + 543.0, + 1462.0, + 543.0, + 1499.0, + 294.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 1462.0, + 1266.0, + 1462.0, + 1266.0, + 1499.0, + 558.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 1462.0, + 1405.0, + 1462.0, + 1405.0, + 1499.0, + 1296.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1491.0, + 1406.0, + 1491.0, + 1406.0, + 1531.0, + 293.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1522.0, + 1405.0, + 1522.0, + 1405.0, + 1560.0, + 293.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1553.0, + 425.0, + 1553.0, + 425.0, + 1590.0, + 294.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 1553.0, + 1405.0, + 1553.0, + 1405.0, + 1590.0, + 517.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1584.0, + 745.0, + 1584.0, + 745.0, + 1620.0, + 293.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 1584.0, + 1406.0, + 1584.0, + 1406.0, + 1620.0, + 837.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1618.0, + 605.0, + 1618.0, + 605.0, + 1651.0, + 295.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 580.0, + 438.0, + 580.0, + 438.0, + 625.0, + 291.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 580.0, + 1125.0, + 580.0, + 1125.0, + 625.0, + 983.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 580.0, + 1342.0, + 580.0, + 1342.0, + 625.0, + 1286.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 613.0, + 297.0, + 613.0, + 297.0, + 657.0, + 292.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 613.0, + 1058.0, + 613.0, + 1058.0, + 657.0, + 373.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 613.0, + 1406.0, + 613.0, + 1406.0, + 657.0, + 1402.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 647.0, + 404.0, + 647.0, + 404.0, + 690.0, + 292.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 647.0, + 758.0, + 647.0, + 758.0, + 690.0, + 700.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 647.0, + 954.0, + 647.0, + 954.0, + 690.0, + 871.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 224.0, + 504.0, + 224.0, + 504.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 224.0, + 1306.0, + 224.0, + 1306.0, + 265.0, + 718.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 224.0, + 1404.0, + 224.0, + 1404.0, + 265.0, + 1395.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 257.0, + 453.0, + 257.0, + 453.0, + 298.0, + 294.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 482.0, + 257.0, + 533.0, + 257.0, + 533.0, + 298.0, + 482.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 257.0, + 927.0, + 257.0, + 927.0, + 298.0, + 553.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 257.0, + 1406.0, + 257.0, + 1406.0, + 298.0, + 1186.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 290.0, + 297.0, + 290.0, + 297.0, + 327.0, + 291.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 290.0, + 686.0, + 290.0, + 686.0, + 327.0, + 436.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 290.0, + 1091.0, + 290.0, + 1091.0, + 327.0, + 716.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 290.0, + 1407.0, + 290.0, + 1407.0, + 327.0, + 1200.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 319.0, + 476.0, + 319.0, + 476.0, + 357.0, + 294.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 501.0, + 319.0, + 528.0, + 319.0, + 528.0, + 357.0, + 501.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 319.0, + 1405.0, + 319.0, + 1405.0, + 357.0, + 802.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 352.0, + 485.0, + 352.0, + 485.0, + 387.0, + 295.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 352.0, + 519.0, + 352.0, + 519.0, + 387.0, + 509.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 759.0, + 1239.0, + 759.0, + 1239.0, + 799.0, + 293.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 759.0, + 1404.0, + 759.0, + 1404.0, + 799.0, + 1262.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 792.0, + 420.0, + 792.0, + 420.0, + 828.0, + 294.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 792.0, + 888.0, + 792.0, + 888.0, + 828.0, + 450.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 792.0, + 1363.0, + 792.0, + 1363.0, + 828.0, + 966.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 824.0, + 1064.0, + 824.0, + 1064.0, + 860.0, + 293.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 388.0, + 1096.0, + 388.0, + 1096.0, + 428.0, + 295.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 388.0, + 1403.0, + 388.0, + 1403.0, + 428.0, + 1120.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 415.0, + 693.0, + 415.0, + 693.0, + 458.0, + 290.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 415.0, + 1043.0, + 415.0, + 1043.0, + 458.0, + 856.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 415.0, + 1408.0, + 415.0, + 1408.0, + 458.0, + 1198.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 447.0, + 377.0, + 447.0, + 377.0, + 489.0, + 291.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 522.0, + 447.0, + 574.0, + 447.0, + 574.0, + 489.0, + 522.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1970.0, + 1405.0, + 1970.0, + 1405.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2000.0, + 633.0, + 2000.0, + 633.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 2000.0, + 1406.0, + 2000.0, + 1406.0, + 2039.0, + 661.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1244.0, + 481.0, + 1244.0, + 481.0, + 1280.0, + 296.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 1244.0, + 731.0, + 1244.0, + 731.0, + 1280.0, + 692.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 1244.0, + 1405.0, + 1244.0, + 1405.0, + 1280.0, + 762.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1273.0, + 650.0, + 1273.0, + 650.0, + 1312.0, + 295.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 1273.0, + 1142.0, + 1273.0, + 1142.0, + 1312.0, + 675.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1148.0, + 902.0, + 1148.0, + 902.0, + 1193.0, + 292.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 1148.0, + 1044.0, + 1148.0, + 1044.0, + 1193.0, + 994.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1148.0, + 1405.0, + 1148.0, + 1405.0, + 1193.0, + 1064.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1184.0, + 325.0, + 1184.0, + 325.0, + 1230.0, + 294.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1184.0, + 471.0, + 1184.0, + 471.0, + 1230.0, + 422.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 1184.0, + 1010.0, + 1184.0, + 1010.0, + 1230.0, + 500.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 1184.0, + 1105.0, + 1184.0, + 1105.0, + 1230.0, + 1050.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1184.0, + 1404.0, + 1184.0, + 1404.0, + 1230.0, + 1394.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1654.0, + 1107.0, + 1654.0, + 1107.0, + 1690.0, + 295.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1654.0, + 1250.0, + 1654.0, + 1250.0, + 1690.0, + 1216.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1654.0, + 1405.0, + 1654.0, + 1405.0, + 1690.0, + 1275.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1684.0, + 962.0, + 1684.0, + 962.0, + 1724.0, + 293.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1881.0, + 1402.0, + 1881.0, + 1402.0, + 1922.0, + 294.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1915.0, + 609.0, + 1915.0, + 609.0, + 1949.0, + 294.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1726.0, + 396.0, + 1726.0, + 396.0, + 1774.0, + 292.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 1726.0, + 434.0, + 1726.0, + 434.0, + 1774.0, + 415.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 1726.0, + 742.0, + 1726.0, + 742.0, + 1774.0, + 728.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1726.0, + 981.0, + 1726.0, + 981.0, + 1774.0, + 784.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 1746.0, + 330.0, + 1746.0, + 330.0, + 1826.0, + 315.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1746.0, + 772.0, + 1746.0, + 772.0, + 1826.0, + 667.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 1746.0, + 869.0, + 1746.0, + 869.0, + 1826.0, + 842.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1798.0, + 427.0, + 1798.0, + 427.0, + 1846.0, + 290.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 1798.0, + 726.0, + 1798.0, + 726.0, + 1846.0, + 711.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1798.0, + 870.0, + 1798.0, + 870.0, + 1846.0, + 827.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1798.0, + 1072.0, + 1798.0, + 1072.0, + 1846.0, + 1014.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 1798.0, + 1313.0, + 1798.0, + 1313.0, + 1846.0, + 1145.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1798.0, + 1406.0, + 1798.0, + 1406.0, + 1846.0, + 1354.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1829.0, + 573.0, + 1829.0, + 573.0, + 1882.0, + 327.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1829.0, + 842.0, + 1829.0, + 842.0, + 1882.0, + 827.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1306.0, + 672.0, + 1306.0, + 672.0, + 1360.0, + 292.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 1306.0, + 811.0, + 1306.0, + 811.0, + 1360.0, + 781.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1306.0, + 929.0, + 1306.0, + 929.0, + 1360.0, + 835.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1306.0, + 1404.0, + 1306.0, + 1404.0, + 1360.0, + 1395.0, + 1360.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 620, + 1405, + 620, + 1405, + 904, + 297, + 904 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1222, + 1404, + 1222, + 1404, + 1408, + 298, + 1408 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1880, + 1403, + 1880, + 1403, + 2035, + 299, + 2035 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 297, + 1649, + 1404, + 1649, + 1404, + 1866, + 297, + 1866 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 384, + 298, + 384 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 299, + 1507, + 1405, + 1507, + 1405, + 1637, + 299, + 1637 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 298, + 475, + 1404, + 475, + 1404, + 611, + 298, + 611 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 294, + 398, + 1402, + 398, + 1402, + 462, + 294, + 462 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 297, + 1417, + 1401, + 1417, + 1401, + 1482, + 297, + 1482 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 297, + 992, + 1405, + 992, + 1405, + 1198, + 297, + 1198 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 296, + 913, + 1400, + 913, + 1400, + 977, + 296, + 977 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.73 + }, + { + "category_id": 13, + "poly": [ + 1063, + 1057, + 1171, + 1057, + 1171, + 1099, + 1063, + 1099 + ], + "score": 0.94, + "latex": "( \\widetilde { A _ { 1 } } , \\widetilde { A _ { 2 } } )" + }, + { + "category_id": 13, + "poly": [ + 681, + 1603, + 804, + 1603, + 804, + 1638, + 681, + 1638 + ], + "score": 0.94, + "latex": "[ x ^ { 2 } , 0 ; 0 , 0 ]" + }, + { + "category_id": 13, + "poly": [ + 644, + 399, + 736, + 399, + 736, + 433, + 644, + 433 + ], + "score": 0.93, + "latex": "\\{ p _ { i } \\} _ { i = 1 } ^ { r }" + }, + { + "category_id": 13, + "poly": [ + 710, + 1064, + 818, + 1064, + 818, + 1099, + 710, + 1099 + ], + "score": 0.92, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 734, + 997, + 842, + 997, + 842, + 1031, + 734, + 1031 + ], + "score": 0.92, + "latex": "\\left( A _ { 1 } , A _ { 2 } \\right)" + }, + { + "category_id": 13, + "poly": [ + 1090, + 1126, + 1196, + 1126, + 1196, + 1167, + 1090, + 1167 + ], + "score": 0.92, + "latex": "( A _ { 1 } , \\widetilde { A _ { 2 } } )" + }, + { + "category_id": 13, + "poly": [ + 299, + 1567, + 468, + 1567, + 468, + 1606, + 299, + 1606 + ], + "score": 0.92, + "latex": "\\textstyle { \\frac { 1 } { 2 } } ( a _ { 2 } a _ { 1 } x - y ) ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 480, + 1605, + 651, + 1605, + 651, + 1637, + 480, + 1637 + ], + "score": 0.92, + "latex": "a _ { 1 } = 0 , a _ { 2 } = 1" + }, + { + "category_id": 13, + "poly": [ + 476, + 1132, + 870, + 1132, + 870, + 1167, + 476, + 1167 + ], + "score": 0.92, + "latex": "\\mathcal { X } : = \\{ ( A _ { 1 } , A _ { 2 } ) : ~ A _ { 2 } A _ { 1 } X \\neq \\mathbf { 0 } \\}" + }, + { + "category_id": 13, + "poly": [ + 865, + 1943, + 1020, + 1943, + 1020, + 1974, + 865, + 1974 + ], + "score": 0.92, + "latex": "d _ { 2 } = d _ { 0 } \\geq d _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 299, + 429, + 407, + 429, + 407, + 463, + 299, + 463 + ], + "score": 0.92, + "latex": "\\left( A _ { 1 } , A _ { 2 } \\right)" + }, + { + "category_id": 13, + "poly": [ + 1212, + 574, + 1332, + 574, + 1332, + 606, + 1212, + 606 + ], + "score": 0.92, + "latex": "1 \\leq k \\leq r" + }, + { + "category_id": 13, + "poly": [ + 1075, + 989, + 1183, + 989, + 1183, + 1031, + 1075, + 1031 + ], + "score": 0.91, + "latex": "( \\widetilde { A _ { 1 } } , \\widetilde { A _ { 2 } } )" + }, + { + "category_id": 13, + "poly": [ + 438, + 684, + 508, + 684, + 508, + 715, + 438, + 715 + ], + "score": 0.91, + "latex": "i < j" + }, + { + "category_id": 13, + "poly": [ + 1262, + 1539, + 1406, + 1539, + 1406, + 1572, + 1262, + 1572 + ], + "score": 0.91, + "latex": "{ \\mathcal { L } } ( a _ { 2 } , a _ { 1 } ) =" + }, + { + "category_id": 13, + "poly": [ + 522, + 539, + 824, + 539, + 824, + 571, + 522, + 571 + ], + "score": 0.91, + "latex": "\\mathrm { r a n k } ( A _ { 2 } ) < \\mathrm { m i n } \\{ d _ { 2 } , d _ { 1 } \\}" + }, + { + "category_id": 13, + "poly": [ + 1258, + 1744, + 1322, + 1744, + 1322, + 1774, + 1258, + 1774 + ], + "score": 0.91, + "latex": "i < j" + }, + { + "category_id": 13, + "poly": [ + 331, + 1097, + 495, + 1097, + 495, + 1130, + 331, + 1130 + ], + "score": 0.91, + "latex": "\\mathrm { r a n k } ( A _ { 2 } ) + 1" + }, + { + "category_id": 13, + "poly": [ + 1091, + 1571, + 1159, + 1571, + 1159, + 1601, + 1091, + 1601 + ], + "score": 0.9, + "latex": "y = 0" + }, + { + "category_id": 13, + "poly": [ + 450, + 510, + 548, + 510, + 548, + 539, + 450, + 539 + ], + "score": 0.9, + "latex": "p _ { i } < m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 751, + 654, + 841, + 654, + 841, + 686, + 751, + 686 + ], + "score": 0.9, + "latex": "p _ { j } > 0 \\ :" + }, + { + "category_id": 13, + "poly": [ + 1179, + 1804, + 1217, + 1804, + 1217, + 1834, + 1179, + 1834 + ], + "score": 0.89, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 554, + 1574, + 652, + 1574, + 652, + 1601, + 554, + 1601 + ], + "score": 0.89, + "latex": "a _ { 1 } , a _ { 2 } , x" + }, + { + "category_id": 13, + "poly": [ + 491, + 323, + 530, + 323, + 530, + 353, + 491, + 353 + ], + "score": 0.89, + "latex": "A _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1259, + 477, + 1406, + 477, + 1406, + 509, + 1259, + 509 + ], + "score": 0.89, + "latex": "1 \\leq i < j \\leq" + }, + { + "category_id": 13, + "poly": [ + 971, + 232, + 1010, + 232, + 1010, + 261, + 971, + 261 + ], + "score": 0.89, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 587, + 687, + 696, + 687, + 696, + 714, + 587, + 714 + ], + "score": 0.89, + "latex": "p _ { i } < m _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 1098, + 293, + 1137, + 293, + 1137, + 322, + 1098, + 322 + ], + "score": 0.88, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 598, + 509, + 678, + 509, + 678, + 539, + 598, + 539 + ], + "score": 0.88, + "latex": "p _ { j } > 0" + }, + { + "category_id": 13, + "poly": [ + 1089, + 745, + 1128, + 745, + 1128, + 774, + 1089, + 774 + ], + "score": 0.88, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1069, + 262, + 1108, + 262, + 1108, + 292, + 1069, + 292 + ], + "score": 0.88, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1084, + 834, + 1121, + 834, + 1121, + 869, + 1084, + 869 + ], + "score": 0.88, + "latex": "\\widetilde { M }" + }, + { + "category_id": 13, + "poly": [ + 1238, + 744, + 1277, + 744, + 1277, + 774, + 1238, + 774 + ], + "score": 0.88, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 881, + 1747, + 912, + 1747, + 912, + 1776, + 881, + 1776 + ], + "score": 0.87, + "latex": "\\sigma _ { j }" + }, + { + "category_id": 13, + "poly": [ + 1169, + 1747, + 1198, + 1747, + 1198, + 1773, + 1169, + 1773 + ], + "score": 0.87, + "latex": "\\sigma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 973, + 1779, + 1004, + 1779, + 1004, + 1807, + 973, + 1807 + ], + "score": 0.86, + "latex": "\\sigma _ { j }" + }, + { + "category_id": 13, + "poly": [ + 1292, + 658, + 1321, + 658, + 1321, + 683, + 1292, + 683 + ], + "score": 0.85, + "latex": "\\sigma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 639, + 657, + 670, + 657, + 670, + 686, + 639, + 686 + ], + "score": 0.85, + "latex": "\\sigma _ { j }" + }, + { + "category_id": 13, + "poly": [ + 571, + 1808, + 598, + 1808, + 598, + 1834, + 571, + 1834 + ], + "score": 0.84, + "latex": "\\sigma _ { i }" + }, + { + "category_id": 13, + "poly": [ + 898, + 873, + 935, + 873, + 935, + 899, + 898, + 899 + ], + "score": 0.82, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 609, + 716, + 632, + 716, + 632, + 741, + 609, + 741 + ], + "score": 0.81, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 441, + 431, + 464, + 431, + 464, + 457, + 441, + 457 + ], + "score": 0.8, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 702, + 1574, + 721, + 1574, + 721, + 1601, + 702, + 1601 + ], + "score": 0.8, + "latex": "y" + }, + { + "category_id": 13, + "poly": [ + 686, + 1683, + 713, + 1683, + 713, + 1709, + 686, + 1709 + ], + "score": 0.79, + "latex": "\\pmb { \\Sigma }" + }, + { + "category_id": 13, + "poly": [ + 1059, + 1347, + 1086, + 1347, + 1086, + 1373, + 1059, + 1373 + ], + "score": 0.79, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 933, + 1451, + 960, + 1451, + 960, + 1477, + 933, + 1477 + ], + "score": 0.79, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 964, + 1316, + 991, + 1316, + 991, + 1342, + 964, + 1342 + ], + "score": 0.78, + "latex": "\\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 1057, + 623, + 1080, + 623, + 1080, + 649, + 1057, + 649 + ], + "score": 0.77, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 328, + 872, + 365, + 872, + 365, + 899, + 328, + 899 + ], + "score": 0.77, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 694, + 477, + 723, + 477, + 723, + 505, + 694, + 505 + ], + "score": 0.77, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 325, + 514, + 342, + 514, + 342, + 535, + 325, + 535 + ], + "score": 0.76, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 1004, + 538, + 1034, + 538, + 1034, + 565, + 1004, + 565 + ], + "score": 0.75, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 594, + 1420, + 616, + 1420, + 616, + 1446, + 594, + 1446 + ], + "score": 0.74, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 373, + 569, + 1104, + 569, + 1104, + 612, + 373, + 612 + ], + "score": 0.71, + "latex": "p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = { \\mathrm { r a n k } } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\leq m _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1241, + 1057, + 1402, + 1057, + 1402, + 1100, + 1241, + 1100 + ], + "score": 0.69, + "latex": "\\mathrm { r a n k } ( \\widetilde { A _ { 2 } } ) =" + }, + { + "category_id": 13, + "poly": [ + 1102, + 916, + 1123, + 916, + 1123, + 943, + 1102, + 943 + ], + "score": 0.67, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 835, + 1420, + 857, + 1420, + 857, + 1446, + 835, + 1446 + ], + "score": 0.66, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 330, + 1029, + 446, + 1029, + 446, + 1062, + 330, + 1062 + ], + "score": 0.62, + "latex": "\\operatorname { r a n k } ( A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1291, + 989, + 1404, + 989, + 1404, + 1032, + 1291, + 1032 + ], + "score": 0.6, + "latex": "\\operatorname { k } ( \\widetilde { A _ { 2 } } ) =" + }, + { + "category_id": 13, + "poly": [ + 965, + 1421, + 982, + 1421, + 982, + 1446, + 965, + 1446 + ], + "score": 0.41, + "latex": "^ { l }" + }, + { + "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, + 617.0, + 1056.0, + 617.0, + 1056.0, + 659.0, + 294.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 617.0, + 1403.0, + 617.0, + 1403.0, + 659.0, + 1081.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 653.0, + 638.0, + 653.0, + 638.0, + 686.0, + 292.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 653.0, + 750.0, + 653.0, + 750.0, + 686.0, + 671.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 653.0, + 1291.0, + 653.0, + 1291.0, + 686.0, + 842.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 653.0, + 1408.0, + 653.0, + 1408.0, + 686.0, + 1322.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 682.0, + 437.0, + 682.0, + 437.0, + 719.0, + 294.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 682.0, + 586.0, + 682.0, + 586.0, + 719.0, + 509.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 682.0, + 1406.0, + 682.0, + 1406.0, + 719.0, + 697.0, + 719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 714.0, + 608.0, + 714.0, + 608.0, + 748.0, + 295.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 714.0, + 1403.0, + 714.0, + 1403.0, + 748.0, + 633.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 743.0, + 1088.0, + 743.0, + 1088.0, + 776.0, + 294.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 743.0, + 1237.0, + 743.0, + 1237.0, + 776.0, + 1129.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 743.0, + 1403.0, + 743.0, + 1403.0, + 776.0, + 1278.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 774.0, + 1403.0, + 774.0, + 1403.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, + 839.0, + 294.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 840.0, + 1083.0, + 840.0, + 1083.0, + 875.0, + 292.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 840.0, + 1403.0, + 840.0, + 1403.0, + 875.0, + 1122.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 874.0, + 327.0, + 874.0, + 327.0, + 904.0, + 296.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 874.0, + 897.0, + 874.0, + 897.0, + 904.0, + 366.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 874.0, + 944.0, + 874.0, + 944.0, + 904.0, + 936.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1223.0, + 1405.0, + 1223.0, + 1405.0, + 1259.0, + 296.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1254.0, + 1403.0, + 1254.0, + 1403.0, + 1287.0, + 295.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1286.0, + 1404.0, + 1286.0, + 1404.0, + 1318.0, + 294.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1314.0, + 963.0, + 1314.0, + 963.0, + 1349.0, + 294.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 1314.0, + 1404.0, + 1314.0, + 1404.0, + 1349.0, + 992.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1343.0, + 1058.0, + 1343.0, + 1058.0, + 1380.0, + 293.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 1343.0, + 1406.0, + 1343.0, + 1406.0, + 1380.0, + 1087.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1375.0, + 1382.0, + 1375.0, + 1382.0, + 1409.0, + 295.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1880.0, + 1403.0, + 1880.0, + 1403.0, + 1914.0, + 295.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1908.0, + 1405.0, + 1908.0, + 1405.0, + 1948.0, + 293.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 864.0, + 1942.0, + 864.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1979.0, + 1021.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1969.0, + 1405.0, + 1969.0, + 1405.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2003.0, + 1403.0, + 2003.0, + 1403.0, + 2036.0, + 295.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1651.0, + 1405.0, + 1651.0, + 1405.0, + 1686.0, + 295.0, + 1686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1681.0, + 685.0, + 1681.0, + 685.0, + 1717.0, + 293.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 1681.0, + 1404.0, + 1681.0, + 1404.0, + 1717.0, + 714.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1710.0, + 1404.0, + 1710.0, + 1404.0, + 1748.0, + 294.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1741.0, + 880.0, + 1741.0, + 880.0, + 1779.0, + 294.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 1741.0, + 1168.0, + 1741.0, + 1168.0, + 1779.0, + 913.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1741.0, + 1257.0, + 1741.0, + 1257.0, + 1779.0, + 1199.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1741.0, + 1405.0, + 1741.0, + 1405.0, + 1779.0, + 1323.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1774.0, + 972.0, + 1774.0, + 972.0, + 1808.0, + 295.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 1774.0, + 1405.0, + 1774.0, + 1405.0, + 1808.0, + 1005.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1803.0, + 570.0, + 1803.0, + 570.0, + 1838.0, + 294.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1803.0, + 1178.0, + 1803.0, + 1178.0, + 1838.0, + 599.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 1803.0, + 1405.0, + 1803.0, + 1405.0, + 1838.0, + 1218.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1833.0, + 590.0, + 1833.0, + 590.0, + 1868.0, + 295.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 229.0, + 970.0, + 229.0, + 970.0, + 263.0, + 296.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 263.0, + 1011.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 259.0, + 1068.0, + 259.0, + 1068.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 259.0, + 1405.0, + 259.0, + 1405.0, + 297.0, + 1109.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 291.0, + 1097.0, + 291.0, + 1097.0, + 324.0, + 296.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 291.0, + 1402.0, + 291.0, + 1402.0, + 324.0, + 1138.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 320.0, + 490.0, + 320.0, + 490.0, + 357.0, + 294.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 531.0, + 320.0, + 1406.0, + 320.0, + 1406.0, + 357.0, + 531.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 349.0, + 563.0, + 349.0, + 563.0, + 386.0, + 295.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1510.0, + 1403.0, + 1510.0, + 1403.0, + 1540.0, + 298.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1540.0, + 1261.0, + 1540.0, + 1261.0, + 1573.0, + 294.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1566.0, + 298.0, + 1566.0, + 298.0, + 1610.0, + 293.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1566.0, + 553.0, + 1566.0, + 553.0, + 1610.0, + 469.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 1566.0, + 701.0, + 1566.0, + 701.0, + 1610.0, + 653.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 722.0, + 1566.0, + 1090.0, + 1566.0, + 1090.0, + 1610.0, + 722.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 1566.0, + 1410.0, + 1566.0, + 1410.0, + 1610.0, + 1160.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1602.0, + 479.0, + 1602.0, + 479.0, + 1640.0, + 293.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 1602.0, + 680.0, + 1602.0, + 680.0, + 1640.0, + 652.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1602.0, + 1326.0, + 1602.0, + 1326.0, + 1640.0, + 805.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 472.0, + 693.0, + 472.0, + 693.0, + 514.0, + 295.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 472.0, + 1258.0, + 472.0, + 1258.0, + 514.0, + 724.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 506.0, + 324.0, + 506.0, + 324.0, + 541.0, + 318.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 506.0, + 449.0, + 506.0, + 449.0, + 541.0, + 343.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 549.0, + 506.0, + 597.0, + 506.0, + 597.0, + 541.0, + 549.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 506.0, + 686.0, + 506.0, + 686.0, + 541.0, + 679.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 536.0, + 521.0, + 536.0, + 521.0, + 572.0, + 294.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 825.0, + 536.0, + 1003.0, + 536.0, + 1003.0, + 572.0, + 825.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 536.0, + 1405.0, + 536.0, + 1405.0, + 572.0, + 1035.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 570.0, + 372.0, + 570.0, + 372.0, + 618.0, + 318.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 570.0, + 1211.0, + 570.0, + 1211.0, + 618.0, + 1105.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 570.0, + 1346.0, + 570.0, + 1346.0, + 618.0, + 1333.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 394.0, + 643.0, + 394.0, + 643.0, + 436.0, + 293.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 394.0, + 1405.0, + 394.0, + 1405.0, + 436.0, + 737.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 429.0, + 440.0, + 429.0, + 440.0, + 465.0, + 408.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 429.0, + 847.0, + 429.0, + 847.0, + 465.0, + 465.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1417.0, + 593.0, + 1417.0, + 593.0, + 1453.0, + 296.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1417.0, + 834.0, + 1417.0, + 834.0, + 1453.0, + 617.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1417.0, + 964.0, + 1417.0, + 964.0, + 1453.0, + 858.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1417.0, + 1406.0, + 1417.0, + 1406.0, + 1453.0, + 983.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1450.0, + 932.0, + 1450.0, + 932.0, + 1484.0, + 293.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 1450.0, + 1157.0, + 1450.0, + 1157.0, + 1484.0, + 961.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 993.0, + 733.0, + 993.0, + 733.0, + 1032.0, + 292.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 843.0, + 993.0, + 1074.0, + 993.0, + 1074.0, + 1032.0, + 843.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 993.0, + 1290.0, + 993.0, + 1290.0, + 1032.0, + 1184.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 1027.0, + 898.0, + 1027.0, + 898.0, + 1063.0, + 447.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1060.0, + 709.0, + 1060.0, + 709.0, + 1101.0, + 291.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 1060.0, + 1062.0, + 1060.0, + 1062.0, + 1101.0, + 819.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 1060.0, + 1240.0, + 1060.0, + 1240.0, + 1101.0, + 1172.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 496.0, + 1095.0, + 943.0, + 1095.0, + 943.0, + 1128.0, + 496.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1130.0, + 475.0, + 1130.0, + 475.0, + 1170.0, + 291.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1130.0, + 1089.0, + 1130.0, + 1089.0, + 1170.0, + 871.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 1130.0, + 1406.0, + 1130.0, + 1406.0, + 1170.0, + 1197.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1162.0, + 586.0, + 1162.0, + 586.0, + 1199.0, + 329.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 913.0, + 1101.0, + 913.0, + 1101.0, + 949.0, + 295.0, + 949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 913.0, + 1402.0, + 913.0, + 1402.0, + 949.0, + 1124.0, + 949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 944.0, + 493.0, + 944.0, + 493.0, + 981.0, + 292.0, + 981.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1407, + 1405, + 1407, + 1405, + 1777, + 297, + 1777 + ], + "score": 0.985 + }, + { + "category_id": 1, + "poly": [ + 297, + 228, + 1405, + 228, + 1405, + 446, + 297, + 446 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 296, + 751, + 1403, + 751, + 1403, + 918, + 296, + 918 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 556, + 1405, + 556, + 1405, + 683, + 297, + 683 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 924, + 1404, + 924, + 1404, + 1049, + 297, + 1049 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1792, + 1404, + 1792, + 1404, + 1892, + 298, + 1892 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 295, + 1159, + 1406, + 1159, + 1406, + 1324, + 295, + 1324 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 646, + 696, + 1051, + 696, + 1051, + 741, + 646, + 741 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 535, + 1948, + 1161, + 1948, + 1161, + 1996, + 535, + 1996 + ], + "score": 0.932 + }, + { + "category_id": 0, + "poly": [ + 298, + 488, + 855, + 488, + 855, + 525, + 298, + 525 + ], + "score": 0.923 + }, + { + "category_id": 8, + "poly": [ + 481, + 1334, + 1218, + 1334, + 1218, + 1382, + 481, + 1382 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 298, + 1899, + 1007, + 1899, + 1007, + 1934, + 298, + 1934 + ], + "score": 0.91 + }, + { + "category_id": 8, + "poly": [ + 335, + 1060, + 1326, + 1060, + 1326, + 1104, + 335, + 1104 + ], + "score": 0.868 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1112, + 1400, + 1112, + 1400, + 1141, + 1365, + 1141 + ], + "score": 0.863 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1343, + 1400, + 1343, + 1400, + 1372, + 1366, + 1372 + ], + "score": 0.857 + }, + { + "category_id": 2, + "poly": [ + 334, + 2004, + 901, + 2004, + 901, + 2035, + 334, + 2035 + ], + "score": 0.85 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1068, + 1401, + 1068, + 1401, + 1099, + 1366, + 1099 + ], + "score": 0.848 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 859, + 2089, + 859, + 2112, + 840, + 2112 + ], + "score": 0.804 + }, + { + "category_id": 13, + "poly": [ + 831, + 756, + 987, + 756, + 987, + 789, + 831, + 789 + ], + "score": 0.93, + "latex": "k = 0 , \\ldots , \\ell" + }, + { + "category_id": 13, + "poly": [ + 388, + 753, + 783, + 753, + 783, + 792, + 388, + 792 + ], + "score": 0.93, + "latex": "\\Sigma _ { k } : = Y ( A _ { ( k , 1 ) } X ) ^ { \\dagger } A _ { ( k , 1 ) } X Y ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 297, + 884, + 648, + 884, + 648, + 921, + 297, + 921 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\pmb { A } _ { ( i , j ) } : = \\pmb { A } _ { i } \\pmb { A } _ { i - 1 } \\cdot \\cdot \\cdot \\pmb { A } _ { j + 1 } \\pmb { A } _ { j } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 849, + 1410, + 984, + 1410, + 984, + 1441, + 849, + 1441 + ], + "score": 0.92, + "latex": "A _ { 1 } , \\ldots , A _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 944, + 1502, + 1064, + 1502, + 1064, + 1537, + 944, + 1537 + ], + "score": 0.92, + "latex": "A _ { ( \\ell , 3 ) } , A _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1060, + 954, + 1236, + 954, + 1236, + 986, + 1060, + 986 + ], + "score": 0.92, + "latex": "\\dot { V } _ { k } \\in \\mathbb { R } ^ { d _ { l } \\times d _ { k + 1 } }" + }, + { + "category_id": 13, + "poly": [ + 901, + 1791, + 1093, + 1791, + 1093, + 1833, + 901, + 1833 + ], + "score": 0.92, + "latex": "\\{ p _ { i } ( 0 ) \\} _ { i = 1 } ^ { r ( 0 ) } , \\bar { p } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 678, + 1900, + 832, + 1900, + 832, + 1934, + 678, + 1934 + ], + "score": 0.91, + "latex": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )" + }, + { + "category_id": 14, + "poly": [ + 644, + 695, + 1054, + 695, + 1054, + 740, + 644, + 740 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathcal { L } _ { D } : = \\frac { 1 } { 2 } \\left\\| A _ { \\ell } \\cdot \\cdot \\cdot A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\right\\| _ { F } ^ { 2 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 772, + 590, + 914, + 590, + 914, + 621, + 772, + 621 + ], + "score": 0.91, + "latex": "k = 1 , \\dots , \\ell" + }, + { + "category_id": 13, + "poly": [ + 1165, + 1220, + 1355, + 1220, + 1355, + 1256, + 1165, + 1256 + ], + "score": 0.91, + "latex": "p _ { i } ( k ) ~ \\leq ~ m _ { i } ( k )" + }, + { + "category_id": 13, + "poly": [ + 776, + 1253, + 1205, + 1253, + 1205, + 1294, + 776, + 1294 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( k ) } p _ { i } ( k ) + \\bar { p } ( k ) = \\mathrm { r a n k } ( A _ { \\ell , k + 1 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 615, + 1472, + 686, + 1472, + 686, + 1506, + 615, + 1506 + ], + "score": 0.91, + "latex": "\\pmb { A } _ { ( \\ell , 2 ) }" + }, + { + "category_id": 13, + "poly": [ + 937, + 987, + 1071, + 987, + 1071, + 1017, + 937, + 1017 + ], + "score": 0.91, + "latex": "A _ { 1 } , \\ldots , A _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 1035, + 1654, + 1132, + 1654, + 1132, + 1684, + 1035, + 1684 + ], + "score": 0.91, + "latex": "\\pmb { L } _ { k } = \\mathbf { 0 }" + }, + { + "category_id": 14, + "poly": [ + 536, + 1947, + 1160, + 1947, + 1160, + 1995, + 536, + 1995 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathcal { L } _ { D } ( A _ { 1 } , \\ldots , A _ { \\ell } ) = \\frac { 1 } { 2 } \\big [ \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) \\big ] . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 824, + 455, + 824, + 455, + 859, + 297, + 859 + ], + "score": 0.91, + "latex": "\\sigma _ { r ( k ) } ( k ) > 0" + }, + { + "category_id": 13, + "poly": [ + 1270, + 1259, + 1400, + 1259, + 1400, + 1292, + 1270, + 1292 + ], + "score": 0.91, + "latex": "\\mathbf { \\Delta } _ { L _ { k } , V _ { k } , C _ { k } }" + }, + { + "category_id": 13, + "poly": [ + 397, + 791, + 508, + 791, + 508, + 826, + 397, + 826 + ], + "score": 0.91, + "latex": "U _ { k } \\pmb { \\Lambda } _ { k } \\pmb { U } _ { k } ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 355, + 1472, + 428, + 1472, + 428, + 1499, + 355, + 1499 + ], + "score": 0.9, + "latex": "k = 0" + }, + { + "category_id": 13, + "poly": [ + 1129, + 824, + 1192, + 824, + 1192, + 856, + 1129, + 856 + ], + "score": 0.9, + "latex": "\\bar { m } ( k )" + }, + { + "category_id": 13, + "poly": [ + 690, + 954, + 873, + 954, + 873, + 986, + 690, + 986 + ], + "score": 0.9, + "latex": "\\pmb { L } _ { k } \\in \\mathrm { \\bar { R } } ^ { d _ { k } \\times d _ { k - 1 } }" + }, + { + "category_id": 13, + "poly": [ + 677, + 824, + 917, + 824, + 917, + 860, + 677, + 860 + ], + "score": 0.9, + "latex": "m _ { 1 } ( k ) , \\ldots , m _ { r ( k ) } ( k )" + }, + { + "category_id": 13, + "poly": [ + 400, + 982, + 605, + 982, + 605, + 1017, + 400, + 1017 + ], + "score": 0.9, + "latex": "C _ { k } \\in \\mathbb { R } ^ { d _ { k + 1 } \\times \\tilde { d _ { k + 1 } } }" + }, + { + "category_id": 13, + "poly": [ + 330, + 1502, + 401, + 1502, + 401, + 1537, + 330, + 1537 + ], + "score": 0.9, + "latex": "\\mathbf { \\delta A } _ { ( \\ell , 3 ) }" + }, + { + "category_id": 13, + "poly": [ + 667, + 1503, + 742, + 1503, + 742, + 1530, + 667, + 1530 + ], + "score": 0.9, + "latex": "\\dot { k } = 1" + }, + { + "category_id": 13, + "poly": [ + 404, + 2005, + 471, + 2005, + 471, + 2037, + 404, + 2037 + ], + "score": 0.9, + "latex": "\\pmb { A } _ { ( 0 , 1 ) }" + }, + { + "category_id": 13, + "poly": [ + 815, + 1716, + 852, + 1716, + 852, + 1745, + 815, + 1745 + ], + "score": 0.9, + "latex": "\\scriptstyle L _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1214, + 790, + 1402, + 790, + 1402, + 825, + 1214, + 825 + ], + "score": 0.89, + "latex": "\\sigma _ { 1 } ( k ) > \\cdots >" + }, + { + "category_id": 13, + "poly": [ + 1296, + 1163, + 1403, + 1163, + 1403, + 1207, + 1296, + 1207 + ], + "score": 0.89, + "latex": "V _ { i } ^ { ( k ) } ~ \\in \\qquad " + }, + { + "category_id": 13, + "poly": [ + 541, + 587, + 726, + 587, + 726, + 618, + 541, + 618 + ], + "score": 0.89, + "latex": "\\dot { \\pmb { A } } _ { k } \\in \\dot { \\mathbb { R } } ^ { d _ { k } \\times d _ { k - 1 } }" + }, + { + "category_id": 13, + "poly": [ + 783, + 792, + 835, + 792, + 835, + 825, + 783, + 825 + ], + "score": 0.89, + "latex": "r ( k )" + }, + { + "category_id": 13, + "poly": [ + 871, + 559, + 940, + 559, + 940, + 589, + 871, + 589 + ], + "score": 0.89, + "latex": "\\ell \\geq 2" + }, + { + "category_id": 13, + "poly": [ + 414, + 1293, + 607, + 1293, + 607, + 1322, + 414, + 1322 + ], + "score": 0.89, + "latex": "k = 2 , \\ldots , \\ell - 1" + }, + { + "category_id": 13, + "poly": [ + 1164, + 1441, + 1234, + 1441, + 1234, + 1475, + 1164, + 1475 + ], + "score": 0.89, + "latex": "\\pmb { A } _ { ( \\ell , 2 ) }" + }, + { + "category_id": 13, + "poly": [ + 889, + 1472, + 928, + 1472, + 928, + 1501, + 889, + 1501 + ], + "score": 0.89, + "latex": "\\pmb { A } _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 874, + 1443, + 948, + 1443, + 948, + 1469, + 874, + 1469 + ], + "score": 0.89, + "latex": "k = 0" + }, + { + "category_id": 13, + "poly": [ + 983, + 353, + 1021, + 353, + 1021, + 383, + 983, + 383 + ], + "score": 0.89, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1365, + 1715, + 1400, + 1715, + 1400, + 1745, + 1365, + 1745 + ], + "score": 0.88, + "latex": "V _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1151, + 857, + 1192, + 857, + 1192, + 884, + 1151, + 884 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 1275, + 1716, + 1313, + 1716, + 1313, + 1745, + 1275, + 1745 + ], + "score": 0.88, + "latex": "C _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1087, + 1685, + 1127, + 1685, + 1127, + 1714, + 1087, + 1714 + ], + "score": 0.88, + "latex": "C _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1150, + 1474, + 1223, + 1474, + 1223, + 1499, + 1150, + 1499 + ], + "score": 0.88, + "latex": "k = 1" + }, + { + "category_id": 13, + "poly": [ + 1083, + 926, + 1124, + 926, + 1124, + 956, + 1083, + 956 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 866, + 1902, + 907, + 1902, + 907, + 1931, + 866, + 1931 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 1355, + 1502, + 1393, + 1502, + 1393, + 1532, + 1355, + 1532 + ], + "score": 0.87, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1264, + 1685, + 1299, + 1685, + 1299, + 1714, + 1264, + 1714 + ], + "score": 0.87, + "latex": "V _ { k }" + }, + { + "category_id": 13, + "poly": [ + 688, + 794, + 728, + 794, + 728, + 823, + 688, + 823 + ], + "score": 0.87, + "latex": "\\Sigma _ { k }" + }, + { + "category_id": 14, + "poly": [ + 481, + 1333, + 1217, + 1333, + 1217, + 1381, + 481, + 1381 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , k ) } = \\pmb { A } _ { ( \\ell , k + 1 ) } \\pmb { A } _ { k } , \\quad ( \\pmb { I } - \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { ( \\ell , k + 1 ) } ) } ) \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell - 1 , 1 ) } ^ { \\top } = \\pmb { 0 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 646, + 987, + 828, + 987, + 828, + 1017, + 646, + 1017 + ], + "score": 0.86, + "latex": "k = 0 , \\ldots , \\ell { - } 2" + }, + { + "category_id": 13, + "poly": [ + 876, + 2008, + 893, + 2008, + 893, + 2030, + 876, + 2030 + ], + "score": 0.8, + "latex": "\\pmb { I }" + }, + { + "category_id": 13, + "poly": [ + 1213, + 1655, + 1233, + 1655, + 1233, + 1681, + 1213, + 1681 + ], + "score": 0.79, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 591, + 618, + 738, + 618, + 738, + 648, + 591, + 648 + ], + "score": 0.77, + "latex": "\\pmb { Y } \\in \\mathbb { R } ^ { d _ { \\ell } \\times m }" + }, + { + "category_id": 14, + "poly": [ + 334, + 1059, + 1326, + 1059, + 1326, + 1109, + 334, + 1109 + ], + "score": 0.76, + "latex": "A _ { k + 1 } = C _ { k } ^ { - 1 } V _ { k } ^ { \\top } U _ { k } ^ { \\top } Y ( A _ { ( k , 1 ) } X ) ^ { \\dagger } + L _ { k + 1 } - C _ { k } ^ { - 1 } V _ { k } ^ { \\top } V _ { k } C _ { k } L _ { k + 1 } A _ { ( k , 1 ) } X ( A _ { ( k , 1 ) } X ) ^ { \\dagger } ," + }, + { + "category_id": 13, + "poly": [ + 429, + 618, + 579, + 618, + 579, + 650, + 429, + 650 + ], + "score": 0.7, + "latex": "\\pmb { X } ^ { ' } \\in \\mathbb { R } ^ { d _ { 0 } \\times m }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1258, + 653, + 1258, + 653, + 1292, + 297, + 1292 + ], + "score": 0.67, + "latex": "i = 1 , \\ldots , r ( k ) , \\bar { p } ( k ) \\leq \\bar { m } ( k )" + }, + { + "category_id": 14, + "poly": [ + 449, + 1161, + 1193, + 1161, + 1193, + 1214, + 449, + 1214 + ], + "score": 0.65, + "latex": "\\begin{array} { r l r } { V _ { k } } & { = } & { [ \\mathrm { d i a g } ( { V } _ { 1 } ^ { ( k ) } , \\ldots , { V } _ { r ( k ) } ^ { ( k ) } , \\overline { { V } } ^ { ( k ) } ) , \\mathbf { 0 } ^ { d _ { l } \\times ( d _ { k + 1 } - \\mathrm { r a n k } ( { A } _ { ( \\ell , k + 2 ) } ) ) } ] , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 495, + 1258, + 655, + 1258, + 655, + 1292, + 495, + 1292 + ], + "score": 0.59, + "latex": "\\bar { p } ( k ) \\leq \\bar { m } ( k )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1209, + 711, + 1209, + 711, + 1252, + 297, + 1252 + ], + "score": 0.56, + "latex": "\\mathbb { R } ^ { m _ { i } ( k ) \\times p _ { i } ( k ) } , ~ \\overline { { V } } ^ { ( k ) } ~ \\in ~ \\mathbb { R } ^ { \\bar { m } ( k ) \\times \\bar { p } ( k ) }" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 484.0, + 857.0, + 484.0, + 857.0, + 531.0, + 291.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 2000.0, + 403.0, + 2000.0, + 403.0, + 2039.0, + 334.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 2000.0, + 875.0, + 2000.0, + 875.0, + 2039.0, + 472.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 2000.0, + 903.0, + 2000.0, + 903.0, + 2039.0, + 894.0, + 2039.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, + 1408.0, + 848.0, + 1408.0, + 848.0, + 1443.0, + 295.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1408.0, + 1403.0, + 1408.0, + 1403.0, + 1443.0, + 985.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1434.0, + 873.0, + 1434.0, + 873.0, + 1479.0, + 291.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 1434.0, + 1163.0, + 1434.0, + 1163.0, + 1479.0, + 949.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1235.0, + 1434.0, + 1407.0, + 1434.0, + 1407.0, + 1479.0, + 1235.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1467.0, + 354.0, + 1467.0, + 354.0, + 1509.0, + 292.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 1467.0, + 614.0, + 1467.0, + 614.0, + 1509.0, + 429.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1467.0, + 888.0, + 1467.0, + 888.0, + 1509.0, + 687.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 1467.0, + 1149.0, + 1467.0, + 1149.0, + 1509.0, + 929.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1467.0, + 1407.0, + 1467.0, + 1407.0, + 1509.0, + 1224.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1496.0, + 329.0, + 1496.0, + 329.0, + 1541.0, + 291.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 1496.0, + 666.0, + 1496.0, + 666.0, + 1541.0, + 402.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 1496.0, + 943.0, + 1496.0, + 943.0, + 1541.0, + 743.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1496.0, + 1354.0, + 1496.0, + 1354.0, + 1541.0, + 1065.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1496.0, + 1406.0, + 1496.0, + 1406.0, + 1541.0, + 1394.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1530.0, + 1406.0, + 1530.0, + 1406.0, + 1565.0, + 292.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1563.0, + 1406.0, + 1563.0, + 1406.0, + 1597.0, + 295.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1593.0, + 1403.0, + 1593.0, + 1403.0, + 1627.0, + 294.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1618.0, + 1405.0, + 1618.0, + 1405.0, + 1661.0, + 291.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1652.0, + 1034.0, + 1652.0, + 1034.0, + 1689.0, + 292.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1652.0, + 1212.0, + 1652.0, + 1212.0, + 1689.0, + 1133.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 1652.0, + 1406.0, + 1652.0, + 1406.0, + 1689.0, + 1234.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1680.0, + 1086.0, + 1680.0, + 1086.0, + 1719.0, + 292.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 1680.0, + 1263.0, + 1680.0, + 1263.0, + 1719.0, + 1128.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1680.0, + 1405.0, + 1680.0, + 1405.0, + 1719.0, + 1300.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1714.0, + 814.0, + 1714.0, + 814.0, + 1749.0, + 294.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 1714.0, + 1274.0, + 1714.0, + 1274.0, + 1749.0, + 853.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1314.0, + 1714.0, + 1364.0, + 1714.0, + 1364.0, + 1749.0, + 1314.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1746.0, + 616.0, + 1746.0, + 616.0, + 1777.0, + 296.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 1406.0, + 228.0, + 1406.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 296.0, + 294.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 294.0, + 1402.0, + 294.0, + 1402.0, + 325.0, + 296.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 322.0, + 1406.0, + 322.0, + 1406.0, + 357.0, + 296.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 352.0, + 982.0, + 352.0, + 982.0, + 387.0, + 295.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 352.0, + 1406.0, + 352.0, + 1406.0, + 387.0, + 1022.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 383.0, + 1405.0, + 383.0, + 1405.0, + 418.0, + 294.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 416.0, + 842.0, + 416.0, + 842.0, + 444.0, + 297.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 750.0, + 387.0, + 750.0, + 387.0, + 794.0, + 293.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 750.0, + 830.0, + 750.0, + 830.0, + 794.0, + 784.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 750.0, + 1406.0, + 750.0, + 1406.0, + 794.0, + 988.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 789.0, + 396.0, + 789.0, + 396.0, + 830.0, + 293.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 789.0, + 687.0, + 789.0, + 687.0, + 830.0, + 509.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 789.0, + 782.0, + 789.0, + 782.0, + 830.0, + 729.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 789.0, + 1213.0, + 789.0, + 1213.0, + 830.0, + 836.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 820.0, + 296.0, + 820.0, + 296.0, + 861.0, + 291.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 820.0, + 676.0, + 820.0, + 676.0, + 861.0, + 456.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 820.0, + 1128.0, + 820.0, + 1128.0, + 861.0, + 918.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 820.0, + 1408.0, + 820.0, + 1408.0, + 861.0, + 1193.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 854.0, + 1150.0, + 854.0, + 1150.0, + 887.0, + 294.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 854.0, + 1405.0, + 854.0, + 1405.0, + 887.0, + 1193.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 883.0, + 971.0, + 883.0, + 971.0, + 919.0, + 649.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 554.0, + 870.0, + 554.0, + 870.0, + 594.0, + 292.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 554.0, + 1405.0, + 554.0, + 1405.0, + 594.0, + 941.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 580.0, + 540.0, + 580.0, + 540.0, + 627.0, + 289.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 580.0, + 771.0, + 580.0, + 771.0, + 627.0, + 727.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 580.0, + 1408.0, + 580.0, + 1408.0, + 627.0, + 915.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 611.0, + 428.0, + 611.0, + 428.0, + 657.0, + 290.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 611.0, + 590.0, + 611.0, + 590.0, + 657.0, + 580.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 611.0, + 1408.0, + 611.0, + 1408.0, + 657.0, + 739.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 647.0, + 773.0, + 647.0, + 773.0, + 686.0, + 292.0, + 686.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 924.0, + 1082.0, + 924.0, + 1082.0, + 957.0, + 296.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 924.0, + 1402.0, + 924.0, + 1402.0, + 957.0, + 1125.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 950.0, + 689.0, + 950.0, + 689.0, + 989.0, + 291.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 950.0, + 1059.0, + 950.0, + 1059.0, + 989.0, + 874.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1237.0, + 950.0, + 1406.0, + 950.0, + 1406.0, + 989.0, + 1237.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 979.0, + 399.0, + 979.0, + 399.0, + 1023.0, + 290.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 979.0, + 645.0, + 979.0, + 645.0, + 1023.0, + 606.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 979.0, + 936.0, + 979.0, + 936.0, + 1023.0, + 829.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 979.0, + 1410.0, + 979.0, + 1410.0, + 1023.0, + 1072.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1017.0, + 832.0, + 1017.0, + 832.0, + 1052.0, + 293.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 1778.0, + 900.0, + 1778.0, + 900.0, + 1867.0, + 284.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1778.0, + 1414.0, + 1778.0, + 1414.0, + 1867.0, + 1094.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1862.0, + 833.0, + 1862.0, + 833.0, + 1893.0, + 296.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1163.0, + 448.0, + 1163.0, + 448.0, + 1215.0, + 285.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 1148.0, + 1295.0, + 1148.0, + 1295.0, + 1217.0, + 1194.0, + 1217.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 1148.0, + 1413.0, + 1148.0, + 1413.0, + 1217.0, + 1404.0, + 1217.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1201.0, + 296.0, + 1201.0, + 296.0, + 1263.0, + 288.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 1201.0, + 1164.0, + 1201.0, + 1164.0, + 1263.0, + 712.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1356.0, + 1201.0, + 1411.0, + 1201.0, + 1411.0, + 1263.0, + 1356.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1238.0, + 296.0, + 1238.0, + 296.0, + 1309.0, + 283.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 1238.0, + 775.0, + 1238.0, + 775.0, + 1309.0, + 656.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1238.0, + 1269.0, + 1238.0, + 1269.0, + 1309.0, + 1206.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1238.0, + 1414.0, + 1238.0, + 1414.0, + 1309.0, + 1401.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1290.0, + 413.0, + 1290.0, + 413.0, + 1324.0, + 295.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 1290.0, + 611.0, + 1290.0, + 611.0, + 1324.0, + 608.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.75, + 1154.0, + 821.75, + 1154.0, + 821.75, + 1202.5, + 727.75, + 1202.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1896.0, + 677.0, + 1896.0, + 677.0, + 1940.0, + 294.0, + 1940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 1896.0, + 865.0, + 1896.0, + 865.0, + 1940.0, + 833.0, + 1940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1896.0, + 1006.0, + 1896.0, + 1006.0, + 1940.0, + 908.0, + 1940.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1811, + 1404, + 1811, + 1404, + 2035, + 297, + 2035 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 731, + 1405, + 731, + 1405, + 947, + 297, + 947 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 297, + 623, + 1405, + 623, + 1405, + 717, + 297, + 717 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 298, + 961, + 1405, + 961, + 1405, + 1086, + 298, + 1086 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 296, + 1450, + 1407, + 1450, + 1407, + 1686, + 296, + 1686 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 298, + 1098, + 1405, + 1098, + 1405, + 1297, + 298, + 1297 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 297, + 1699, + 1404, + 1699, + 1404, + 1765, + 297, + 1765 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 292, + 228, + 1402, + 228, + 1402, + 294, + 292, + 294 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 298, + 511, + 1396, + 511, + 1396, + 575, + 298, + 575 + ], + "score": 0.908 + }, + { + "category_id": 1, + "poly": [ + 297, + 1308, + 1399, + 1308, + 1399, + 1343, + 297, + 1343 + ], + "score": 0.903 + }, + { + "category_id": 1, + "poly": [ + 296, + 1403, + 1347, + 1403, + 1347, + 1439, + 296, + 1439 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 858, + 2087, + 858, + 2111, + 841, + 2111 + ], + "score": 0.698 + }, + { + "category_id": 1, + "poly": [ + 295, + 306, + 1406, + 306, + 1406, + 501, + 295, + 501 + ], + "score": 0.692 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 859, + 2087, + 859, + 2111, + 841, + 2111 + ], + "score": 0.165 + }, + { + "category_id": 13, + "poly": [ + 951, + 1844, + 1081, + 1844, + 1081, + 1885, + 951, + 1885 + ], + "score": 0.94, + "latex": "\\{ p _ { i } ( k ) \\} _ { i = 1 } ^ { r ( k ) }" + }, + { + "category_id": 13, + "poly": [ + 373, + 1054, + 533, + 1054, + 533, + 1087, + 373, + 1087 + ], + "score": 0.94, + "latex": "( \\pmb { A } _ { 1 } , \\cdots , \\pmb { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 1193, + 1617, + 1347, + 1617, + 1347, + 1657, + 1193, + 1657 + ], + "score": 0.93, + "latex": "( A _ { 1 } , \\ldots , \\widetilde { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 814, + 1196, + 874, + 1196, + 874, + 1228, + 814, + 1228 + ], + "score": 0.92, + "latex": "V _ { \\ell - 2 }" + }, + { + "category_id": 13, + "poly": [ + 735, + 1549, + 890, + 1549, + 890, + 1583, + 735, + 1583 + ], + "score": 0.92, + "latex": "( \\pmb { A } _ { 1 } , \\dots , \\pmb { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 1159, + 1165, + 1258, + 1165, + 1258, + 1197, + 1159, + 1197 + ], + "score": 0.92, + "latex": "A _ { ( \\ell - 2 , 1 ) }" + }, + { + "category_id": 13, + "poly": [ + 1027, + 1131, + 1196, + 1131, + 1196, + 1164, + 1027, + 1164 + ], + "score": 0.92, + "latex": "p _ { i } ( k ) < m _ { i } ( k )" + }, + { + "category_id": 13, + "poly": [ + 331, + 1581, + 642, + 1581, + 642, + 1620, + 331, + 1620 + ], + "score": 0.92, + "latex": "\\mathrm { r a n k } ( \\widetilde { A } _ { \\ell } ) = \\mathrm { r a n k } ( A _ { \\ell } ) + 1 ;" + }, + { + "category_id": 13, + "poly": [ + 497, + 1944, + 598, + 1944, + 598, + 1979, + 497, + 1979 + ], + "score": 0.92, + "latex": "A _ { ( q - 1 , 1 ) }" + }, + { + "category_id": 13, + "poly": [ + 1047, + 993, + 1090, + 993, + 1090, + 1023, + 1047, + 1023 + ], + "score": 0.92, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 585, + 1162, + 718, + 1162, + 718, + 1195, + 585, + 1195 + ], + "score": 0.92, + "latex": "\\left( \\mathbf { \\boldsymbol { A } } _ { \\ell } , \\mathbf { \\boldsymbol { A } } _ { \\ell - 1 } \\right)" + }, + { + "category_id": 13, + "poly": [ + 1247, + 1131, + 1364, + 1131, + 1364, + 1165, + 1247, + 1165 + ], + "score": 0.92, + "latex": "p _ { j } ( k ) > 0" + }, + { + "category_id": 13, + "poly": [ + 1114, + 1543, + 1345, + 1543, + 1345, + 1583, + 1114, + 1583 + ], + "score": 0.92, + "latex": "( A _ { 1 } , \\ldots , \\widetilde { A } _ { \\ell - 1 } , \\widetilde { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 793, + 1947, + 862, + 1947, + 862, + 1979, + 793, + 1979 + ], + "score": 0.92, + "latex": "\\pmb { A } _ { ( \\ell , q ) }" + }, + { + "category_id": 13, + "poly": [ + 718, + 1132, + 916, + 1132, + 916, + 1164, + 718, + 1164 + ], + "score": 0.92, + "latex": "1 \\leq i < j \\leq r ( k )" + }, + { + "category_id": 13, + "poly": [ + 325, + 1195, + 641, + 1195, + 641, + 1229, + 325, + 1229 + ], + "score": 0.92, + "latex": "\\mathrm { r a n k } ( A _ { \\ell } ) < \\operatorname* { m i n } \\{ d _ { \\ell } , d _ { \\ell - 1 } \\}" + }, + { + "category_id": 13, + "poly": [ + 1061, + 427, + 1235, + 427, + 1235, + 460, + 1061, + 460 + ], + "score": 0.92, + "latex": "i = 1 , \\ldots , r ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 1289, + 426, + 1393, + 426, + 1393, + 460, + 1289, + 460 + ], + "score": 0.92, + "latex": "\\bar { p } ( 0 ) \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 1015, + 1912, + 1169, + 1912, + 1169, + 1946, + 1015, + 1946 + ], + "score": 0.91, + "latex": "( A _ { \\ell } , \\ldots , A _ { q } )" + }, + { + "category_id": 13, + "poly": [ + 810, + 425, + 979, + 425, + 979, + 460, + 810, + 460 + ], + "score": 0.91, + "latex": "p _ { i } ( 0 ) = m _ { i } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 430, + 1264, + 626, + 1264, + 626, + 1296, + 430, + 1296 + ], + "score": 0.91, + "latex": "1 \\leq k \\leq r ( l - 2 )" + }, + { + "category_id": 13, + "poly": [ + 393, + 1944, + 435, + 1944, + 435, + 1973, + 393, + 1973 + ], + "score": 0.91, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 333, + 1482, + 616, + 1482, + 616, + 1523, + 333, + 1523 + ], + "score": 0.91, + "latex": "( A _ { 1 } , \\ldots , \\widetilde { A } _ { k + 1 } , \\ldots , \\widetilde { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 777, + 1100, + 976, + 1100, + 976, + 1131, + 777, + 1131 + ], + "score": 0.9, + "latex": "0 \\leq k \\leq \\ell - 2" + }, + { + "category_id": 13, + "poly": [ + 1273, + 1195, + 1406, + 1195, + 1406, + 1229, + 1273, + 1229 + ], + "score": 0.9, + "latex": "p _ { 1 } ( l - 2 ) =" + }, + { + "category_id": 13, + "poly": [ + 1115, + 230, + 1271, + 230, + 1271, + 264, + 1115, + 264 + ], + "score": 0.9, + "latex": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 1298, + 314, + 1402, + 314, + 1402, + 349, + 1298, + 349 + ], + "score": 0.9, + "latex": "p _ { 1 } ( 0 ) =" + }, + { + "category_id": 13, + "poly": [ + 766, + 1702, + 807, + 1702, + 807, + 1732, + 766, + 1732 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 485, + 466, + 557, + 466, + 557, + 502, + 485, + 502 + ], + "score": 0.9, + "latex": "\\pmb { A } _ { ( \\ell , 2 ) }" + }, + { + "category_id": 13, + "poly": [ + 855, + 1311, + 896, + 1311, + 896, + 1340, + 855, + 1340 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 803, + 1913, + 906, + 1913, + 906, + 1944, + 803, + 1944 + ], + "score": 0.89, + "latex": "q \\leq \\ell - 1" + }, + { + "category_id": 13, + "poly": [ + 769, + 1815, + 811, + 1815, + 811, + 1844, + 769, + 1844 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 435, + 307, + 825, + 307, + 825, + 349, + 435, + 349 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} \\ \\le \\ \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 568, + 1054, + 609, + 1054, + 609, + 1084, + 568, + 1084 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 1332, + 764, + 1374, + 764, + 1374, + 794, + 1332, + 794 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 854, + 459, + 1176, + 459, + 1176, + 502, + 854, + 502 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { \\mathrm { r a n k } ( A _ { ( \\ell , 2 ) } ) = \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 425, + 419, + 800, + 419, + 800, + 462, + 425, + 462 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 692, + 1483, + 985, + 1483, + 985, + 1523, + 692, + 1523 + ], + "score": 0.89, + "latex": "\\begin{array} { r c l } { \\operatorname { r a n k } ( \\widetilde { A } _ { \\ell } ) } & { = } & { \\operatorname { r a n k } ( A _ { \\ell } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 862, + 1407, + 903, + 1407, + 903, + 1436, + 862, + 1436 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 923, + 1452, + 1080, + 1452, + 1080, + 1486, + 923, + 1486 + ], + "score": 0.88, + "latex": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 491, + 764, + 532, + 764, + 532, + 795, + 491, + 795 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 1308, + 231, + 1350, + 231, + 1350, + 262, + 1308, + 262 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 995, + 1733, + 1037, + 1733, + 1037, + 1762, + 995, + 1762 + ], + "score": 0.88, + "latex": "\\mathcal { X } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 1051, + 1164, + 1093, + 1164, + 1093, + 1193, + 1051, + 1193 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 1224, + 1101, + 1259, + 1101, + 1259, + 1131, + 1224, + 1131 + ], + "score": 0.87, + "latex": "V _ { k }" + }, + { + "category_id": 13, + "poly": [ + 839, + 313, + 912, + 313, + 912, + 351, + 839, + 351 + ], + "score": 0.86, + "latex": "\\pmb { A } _ { ( \\ell , 2 ) }" + }, + { + "category_id": 13, + "poly": [ + 597, + 1407, + 638, + 1407, + 638, + 1437, + 597, + 1437 + ], + "score": 0.86, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 481, + 1622, + 964, + 1622, + 964, + 1659, + 481, + 1659 + ], + "score": 0.86, + "latex": "\\mathcal { X } _ { D } : = \\{ ( A _ { 1 } , . . . , A _ { \\ell } ) : A _ { ( \\ell , 1 ) } X \\neq \\mathbf { 0 } \\}" + }, + { + "category_id": 13, + "poly": [ + 1336, + 1815, + 1359, + 1815, + 1359, + 1841, + 1336, + 1841 + ], + "score": 0.81, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 331, + 388, + 436, + 388, + 436, + 421, + 331, + 421 + ], + "score": 0.78, + "latex": "k \\leq r ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 328, + 350, + 1291, + 350, + 1291, + 391, + 328, + 391 + ], + "score": 0.75, + "latex": "m _ { 1 } ( 0 ) , \\ldots , p _ { k - 1 } ( 0 ) = m _ { k - 1 } ( 0 ) , p _ { k } ( 0 ) = \\mathrm { r a n k } ( A _ { ( \\ell , 2 ) } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \\leq m _ { k } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 399, + 1025, + 421, + 1025, + 421, + 1051, + 399, + 1051 + ], + "score": 0.74, + "latex": "\\mathcal { L }" + }, + { + "category_id": 14, + "poly": [ + 322, + 1227, + 1406, + 1227, + 1406, + 1268, + 322, + 1268 + ], + "score": 0.53, + "latex": "\\begin{array} { r } { m _ { 1 } ( l - 2 ) , \\ldots , p _ { k - 1 } ( l - 2 ) = m _ { k - 1 } ( l - 2 ) , p _ { k } ( l - 2 ) = \\operatorname { r a n k } ( A _ { l } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( l - 2 ) \\leq m _ { k } ( l - 2 ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 785, + 1622, + 963, + 1622, + 963, + 1659, + 785, + 1659 + ], + "score": 0.52, + "latex": "A _ { ( \\ell , 1 ) } X \\neq \\mathbf { 0 } \\}" + }, + { + "category_id": 13, + "poly": [ + 348, + 1226, + 1402, + 1226, + 1402, + 1269, + 348, + 1269 + ], + "score": 0.41, + "latex": "\\begin{array} { r } { \\mathfrak { r } _ { 1 } ( l - 2 ) , \\ldots , \\mathfrak { p } _ { k - 1 } ( l - 2 ) \\stackrel { , } { = } m _ { k - 1 } ( l - 2 ) , \\mathfrak { p } _ { k } ( l - 2 ) = \\mathrm { r a n k } ( A _ { l } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( l - 2 ) \\le m _ { k } ( l - 2 ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 462, + 1703, + 479, + 1703, + 479, + 1728, + 462, + 1728 + ], + "score": 0.39, + "latex": "^ { l }" + }, + { + "category_id": 13, + "poly": [ + 1383, + 235, + 1402, + 235, + 1402, + 259, + 1383, + 259 + ], + "score": 0.29, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 398, + 316, + 415, + 316, + 415, + 343, + 398, + 343 + ], + "score": 0.26, + "latex": "I" + }, + { + "category_id": 13, + "poly": [ + 1198, + 1495, + 1218, + 1495, + 1218, + 1516, + 1198, + 1516 + ], + "score": 0.26, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 1200, + 1458, + 1220, + 1458, + 1220, + 1481, + 1200, + 1481 + ], + "score": 0.26, + "latex": "a" + }, + { + "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": [ + 294.0, + 1810.0, + 768.0, + 1810.0, + 768.0, + 1850.0, + 294.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 812.0, + 1810.0, + 1335.0, + 1810.0, + 1335.0, + 1850.0, + 812.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1810.0, + 1407.0, + 1810.0, + 1407.0, + 1850.0, + 1360.0, + 1850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 282.0, + 1829.0, + 950.0, + 1829.0, + 950.0, + 1901.0, + 282.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 1829.0, + 1405.0, + 1829.0, + 1405.0, + 1901.0, + 1082.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1881.0, + 1402.0, + 1881.0, + 1402.0, + 1917.0, + 294.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1912.0, + 802.0, + 1912.0, + 802.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 1912.0, + 1014.0, + 1912.0, + 1014.0, + 1947.0, + 907.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 1912.0, + 1406.0, + 1912.0, + 1406.0, + 1947.0, + 1170.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1942.0, + 392.0, + 1942.0, + 392.0, + 1979.0, + 291.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 1942.0, + 496.0, + 1942.0, + 496.0, + 1979.0, + 436.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1942.0, + 792.0, + 1942.0, + 792.0, + 1979.0, + 599.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1979.0, + 863.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1970.0, + 1406.0, + 1970.0, + 1406.0, + 2008.0, + 292.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2003.0, + 789.0, + 2003.0, + 789.0, + 2034.0, + 293.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 732.0, + 1406.0, + 732.0, + 1406.0, + 766.0, + 295.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 764.0, + 490.0, + 764.0, + 490.0, + 798.0, + 294.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 533.0, + 764.0, + 1331.0, + 764.0, + 1331.0, + 798.0, + 533.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 764.0, + 1406.0, + 764.0, + 1406.0, + 798.0, + 1375.0, + 798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 793.0, + 1402.0, + 793.0, + 1402.0, + 827.0, + 295.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 824.0, + 1403.0, + 824.0, + 1403.0, + 858.0, + 294.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 854.0, + 1405.0, + 854.0, + 1405.0, + 888.0, + 294.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 886.0, + 1405.0, + 886.0, + 1405.0, + 917.0, + 296.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 914.0, + 603.0, + 914.0, + 603.0, + 948.0, + 295.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 624.0, + 1405.0, + 624.0, + 1405.0, + 658.0, + 295.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 654.0, + 1405.0, + 654.0, + 1405.0, + 689.0, + 294.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 687.0, + 783.0, + 687.0, + 783.0, + 720.0, + 294.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 963.0, + 1405.0, + 963.0, + 1405.0, + 995.0, + 296.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 992.0, + 1046.0, + 992.0, + 1046.0, + 1027.0, + 292.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 992.0, + 1406.0, + 992.0, + 1406.0, + 1027.0, + 1091.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1021.0, + 398.0, + 1021.0, + 398.0, + 1059.0, + 293.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1021.0, + 1403.0, + 1021.0, + 1403.0, + 1059.0, + 422.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1055.0, + 372.0, + 1055.0, + 372.0, + 1089.0, + 295.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 1055.0, + 567.0, + 1055.0, + 567.0, + 1089.0, + 534.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 1055.0, + 619.0, + 1055.0, + 619.0, + 1089.0, + 610.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1447.0, + 922.0, + 1447.0, + 922.0, + 1488.0, + 293.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 1447.0, + 1199.0, + 1447.0, + 1199.0, + 1488.0, + 1081.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 1447.0, + 1407.0, + 1447.0, + 1407.0, + 1488.0, + 1221.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1483.0, + 332.0, + 1483.0, + 332.0, + 1526.0, + 327.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 1483.0, + 691.0, + 1483.0, + 691.0, + 1526.0, + 617.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 1483.0, + 1197.0, + 1483.0, + 1197.0, + 1526.0, + 986.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 1483.0, + 1407.0, + 1483.0, + 1407.0, + 1526.0, + 1219.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1515.0, + 407.0, + 1515.0, + 407.0, + 1554.0, + 330.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1544.0, + 734.0, + 1544.0, + 734.0, + 1585.0, + 293.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 1544.0, + 1113.0, + 1544.0, + 1113.0, + 1585.0, + 891.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 1544.0, + 1404.0, + 1544.0, + 1404.0, + 1585.0, + 1346.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.0, + 1582.0, + 1087.0, + 1582.0, + 1087.0, + 1622.0, + 643.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1617.0, + 480.0, + 1617.0, + 480.0, + 1661.0, + 290.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 1617.0, + 1192.0, + 1617.0, + 1192.0, + 1661.0, + 965.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 1617.0, + 1405.0, + 1617.0, + 1405.0, + 1661.0, + 1348.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1655.0, + 703.0, + 1655.0, + 703.0, + 1687.0, + 329.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1096.0, + 776.0, + 1096.0, + 776.0, + 1133.0, + 297.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 977.0, + 1096.0, + 1223.0, + 1096.0, + 1223.0, + 1133.0, + 977.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 1096.0, + 1405.0, + 1096.0, + 1405.0, + 1133.0, + 1260.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1127.0, + 717.0, + 1127.0, + 717.0, + 1167.0, + 318.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 1127.0, + 1026.0, + 1127.0, + 1026.0, + 1167.0, + 917.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 1127.0, + 1246.0, + 1127.0, + 1246.0, + 1167.0, + 1197.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1365.0, + 1127.0, + 1375.0, + 1127.0, + 1375.0, + 1167.0, + 1365.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1157.0, + 584.0, + 1157.0, + 584.0, + 1199.0, + 298.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 1157.0, + 1050.0, + 1157.0, + 1050.0, + 1199.0, + 719.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1157.0, + 1158.0, + 1157.0, + 1158.0, + 1199.0, + 1094.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 1157.0, + 1403.0, + 1157.0, + 1403.0, + 1199.0, + 1259.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 1193.0, + 813.0, + 1193.0, + 813.0, + 1231.0, + 642.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1193.0, + 1272.0, + 1193.0, + 1272.0, + 1231.0, + 875.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 1210.0, + 321.0, + 1210.0, + 321.0, + 1298.0, + 312.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1407.0, + 1210.0, + 1415.0, + 1210.0, + 1415.0, + 1298.0, + 1407.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1696.0, + 461.0, + 1696.0, + 461.0, + 1739.0, + 295.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 1696.0, + 765.0, + 1696.0, + 765.0, + 1739.0, + 480.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 808.0, + 1696.0, + 1408.0, + 1696.0, + 1408.0, + 1739.0, + 808.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1733.0, + 994.0, + 1733.0, + 994.0, + 1766.0, + 296.0, + 1766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1733.0, + 1235.0, + 1733.0, + 1235.0, + 1766.0, + 1038.0, + 1766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 225.0, + 1114.0, + 225.0, + 1114.0, + 269.0, + 292.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 225.0, + 1307.0, + 225.0, + 1307.0, + 269.0, + 1272.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 225.0, + 1382.0, + 225.0, + 1382.0, + 269.0, + 1351.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 225.0, + 1407.0, + 225.0, + 1407.0, + 269.0, + 1403.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 1040.0, + 261.0, + 1040.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 507.0, + 1401.0, + 507.0, + 1401.0, + 549.0, + 293.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 542.0, + 610.0, + 542.0, + 610.0, + 579.0, + 294.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1304.0, + 854.0, + 1304.0, + 854.0, + 1347.0, + 295.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 1304.0, + 1403.0, + 1304.0, + 1403.0, + 1347.0, + 897.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1400.0, + 596.0, + 1400.0, + 596.0, + 1445.0, + 293.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1400.0, + 861.0, + 1400.0, + 861.0, + 1445.0, + 639.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1400.0, + 1351.0, + 1400.0, + 1351.0, + 1445.0, + 904.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 293.0, + 397.0, + 293.0, + 397.0, + 368.0, + 285.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 416.0, + 293.0, + 434.0, + 293.0, + 434.0, + 368.0, + 416.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 293.0, + 838.0, + 293.0, + 838.0, + 368.0, + 826.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 293.0, + 1297.0, + 293.0, + 1297.0, + 368.0, + 913.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 293.0, + 1414.0, + 293.0, + 1414.0, + 368.0, + 1403.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 346.0, + 1408.0, + 346.0, + 1408.0, + 398.0, + 1292.0, + 398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 382.0, + 330.0, + 382.0, + 330.0, + 425.0, + 326.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 382.0, + 451.0, + 382.0, + 451.0, + 425.0, + 437.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 411.0, + 424.0, + 411.0, + 424.0, + 473.0, + 285.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 411.0, + 809.0, + 411.0, + 809.0, + 473.0, + 801.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 411.0, + 1060.0, + 411.0, + 1060.0, + 473.0, + 980.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 411.0, + 1288.0, + 411.0, + 1288.0, + 473.0, + 1236.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 411.0, + 1411.0, + 411.0, + 1411.0, + 473.0, + 1394.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 446.0, + 484.0, + 446.0, + 484.0, + 515.0, + 321.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 446.0, + 853.0, + 446.0, + 853.0, + 515.0, + 558.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 446.0, + 1197.0, + 446.0, + 1197.0, + 515.0, + 1177.0, + 515.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 546, + 1405, + 546, + 1405, + 764, + 296, + 764 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 296, + 1063, + 1405, + 1063, + 1405, + 1354, + 296, + 1354 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 296, + 292, + 1405, + 292, + 1405, + 481, + 296, + 481 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1570, + 1404, + 1570, + 1404, + 1683, + 297, + 1683 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1910, + 1403, + 1910, + 1403, + 2035, + 297, + 2035 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1361, + 1404, + 1361, + 1404, + 1461, + 298, + 1461 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 300, + 776, + 1402, + 776, + 1402, + 871, + 300, + 871 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 664, + 493, + 1035, + 493, + 1035, + 538, + 664, + 538 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 296, + 933, + 1410, + 933, + 1410, + 997, + 296, + 997 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 623, + 1696, + 1078, + 1696, + 1078, + 1740, + 623, + 1740 + ], + "score": 0.932 + }, + { + "category_id": 8, + "poly": [ + 394, + 1010, + 1300, + 1010, + 1300, + 1056, + 394, + 1056 + ], + "score": 0.921 + }, + { + "category_id": 8, + "poly": [ + 470, + 1470, + 1226, + 1470, + 1226, + 1515, + 470, + 1515 + ], + "score": 0.919 + }, + { + "category_id": 8, + "poly": [ + 455, + 883, + 1240, + 883, + 1240, + 922, + 455, + 922 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 289, + 1748, + 1258, + 1748, + 1258, + 1783, + 289, + 1783 + ], + "score": 0.903 + }, + { + "category_id": 8, + "poly": [ + 414, + 1795, + 1284, + 1795, + 1284, + 1841, + 414, + 1841 + ], + "score": 0.902 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1703, + 1400, + 1703, + 1400, + 1733, + 1352, + 1733 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1524, + 1400, + 1524, + 1400, + 1554, + 1351, + 1554 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1478, + 1400, + 1478, + 1400, + 1510, + 1352, + 1510 + ], + "score": 0.878 + }, + { + "category_id": 9, + "poly": [ + 1366, + 501, + 1400, + 501, + 1400, + 531, + 1366, + 531 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1804, + 1400, + 1804, + 1400, + 1835, + 1352, + 1835 + ], + "score": 0.869 + }, + { + "category_id": 9, + "poly": [ + 1366, + 888, + 1400, + 888, + 1400, + 917, + 1366, + 917 + ], + "score": 0.868 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1018, + 1400, + 1018, + 1400, + 1048, + 1366, + 1048 + ], + "score": 0.86 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1849, + 1400, + 1849, + 1400, + 1878, + 1352, + 1878 + ], + "score": 0.86 + }, + { + "category_id": 8, + "poly": [ + 974, + 1847, + 1280, + 1847, + 1280, + 1879, + 974, + 1879 + ], + "score": 0.834 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2112, + 840, + 2112 + ], + "score": 0.813 + }, + { + "category_id": 0, + "poly": [ + 295, + 225, + 1219, + 225, + 1219, + 263, + 295, + 263 + ], + "score": 0.728 + }, + { + "category_id": 8, + "poly": [ + 475, + 1520, + 696, + 1520, + 696, + 1557, + 475, + 1557 + ], + "score": 0.495 + }, + { + "category_id": 2, + "poly": [ + 295, + 225, + 1219, + 225, + 1219, + 263, + 295, + 263 + ], + "score": 0.215 + }, + { + "category_id": 13, + "poly": [ + 299, + 839, + 427, + 839, + 427, + 872, + 299, + 872 + ], + "score": 0.93, + "latex": "\\{ 1 , \\ldots , m \\}" + }, + { + "category_id": 13, + "poly": [ + 297, + 2002, + 393, + 2002, + 393, + 2036, + 297, + 2036 + ], + "score": 0.93, + "latex": "I = \\{ 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 963, + 1217, + 1259, + 1217, + 1259, + 1260, + 963, + 1260 + ], + "score": 0.93, + "latex": "\\Sigma _ { J } : = Y _ { : , J } \\bar { X } _ { : , J } ^ { \\dag } X _ { : , J } Y _ { : , J } ^ { \\top }" + }, + { + "category_id": 14, + "poly": [ + 663, + 492, + 1034, + 492, + 1034, + 538, + 663, + 538 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\mathcal { L } _ { N } : = \\frac { 1 } { 2 } \\left. \\boldsymbol { A } _ { 2 } \\boldsymbol { \\sigma } ( \\boldsymbol { A } _ { 1 } \\boldsymbol { X } ) - \\boldsymbol { Y } \\right. _ { F } ^ { 2 } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 476, + 964, + 614, + 964, + 614, + 999, + 476, + 999 + ], + "score": 0.93, + "latex": "\\sigma ( A _ { 1 } \\bar { X } ) _ { I : J }" + }, + { + "category_id": 13, + "poly": [ + 871, + 1427, + 1021, + 1427, + 1021, + 1459, + 871, + 1459 + ], + "score": 0.93, + "latex": "C \\in \\mathbb { R } ^ { | I | \\times | I | }" + }, + { + "category_id": 13, + "poly": [ + 859, + 1095, + 996, + 1095, + 996, + 1130, + 859, + 1130 + ], + "score": 0.92, + "latex": "( X _ { : , J } , Y _ { : , J } )" + }, + { + "category_id": 13, + "poly": [ + 1276, + 1291, + 1342, + 1291, + 1342, + 1325, + 1276, + 1325 + ], + "score": 0.92, + "latex": "\\bar { m } ( J )" + }, + { + "category_id": 13, + "poly": [ + 1190, + 934, + 1296, + 934, + 1296, + 968, + 1190, + 968 + ], + "score": 0.92, + "latex": "\\sigma ( A _ { 1 } X )" + }, + { + "category_id": 13, + "poly": [ + 1171, + 326, + 1393, + 326, + 1393, + 360, + 1171, + 360 + ], + "score": 0.92, + "latex": "\\sigma ( x ) : = \\operatorname* { m a x } \\{ x , 0 \\}" + }, + { + "category_id": 13, + "poly": [ + 637, + 1256, + 757, + 1256, + 757, + 1295, + 637, + 1295 + ], + "score": 0.92, + "latex": "U _ { J } \\mathbf { \\Lambda } \\mathbf { \\Lambda } _ { J } U _ { J } ^ { \\top } ," + }, + { + "category_id": 14, + "poly": [ + 624, + 1694, + 1081, + 1694, + 1081, + 1740, + 624, + 1740 + ], + "score": 0.92, + "latex": "\\mathscr { P } _ { \\mathrm { c o l } ( U , V ) ^ { \\perp } } \\mathbf { Y } _ { : , J } \\mathbf { X } _ { : , J } ^ { \\top } \\mathbf { L } _ { 1 } ^ { \\top } C ^ { \\top } \\mathscr { P } _ { \\mathrm { k e r } ( V ) } = \\mathbf { 0 } ." + }, + { + "category_id": 13, + "poly": [ + 616, + 1750, + 684, + 1750, + 684, + 1782, + 616, + 1782 + ], + "score": 0.92, + "latex": "{ \\mathcal { K } } _ { I \\times J }" + }, + { + "category_id": 13, + "poly": [ + 1000, + 809, + 1068, + 809, + 1068, + 841, + 1000, + 841 + ], + "score": 0.92, + "latex": "{ \\mathcal { K } } _ { I \\times J }" + }, + { + "category_id": 13, + "poly": [ + 1150, + 808, + 1403, + 808, + 1403, + 842, + 1150, + 842 + ], + "score": 0.92, + "latex": "I \\subset \\{ 1 , \\dots , d _ { 1 } \\} , J \\subset" + }, + { + "category_id": 13, + "poly": [ + 506, + 1943, + 598, + 1943, + 598, + 1973, + 506, + 1973 + ], + "score": 0.92, + "latex": "d _ { 1 } = 1" + }, + { + "category_id": 13, + "poly": [ + 1092, + 1749, + 1202, + 1749, + 1202, + 1782, + 1092, + 1782 + ], + "score": 0.92, + "latex": "C , V , L _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1151, + 701, + 1232, + 701, + 1232, + 731, + 1151, + 731 + ], + "score": 0.92, + "latex": "d _ { 1 } > 1" + }, + { + "category_id": 13, + "poly": [ + 401, + 702, + 482, + 702, + 482, + 731, + 401, + 731 + ], + "score": 0.91, + "latex": "d _ { 1 } = 1" + }, + { + "category_id": 13, + "poly": [ + 1279, + 1973, + 1347, + 1973, + 1347, + 2004, + 1279, + 2004 + ], + "score": 0.91, + "latex": "{ \\mathcal { K } } _ { I \\times J }" + }, + { + "category_id": 13, + "poly": [ + 1212, + 1394, + 1369, + 1394, + 1369, + 1427, + 1212, + 1427 + ], + "score": 0.91, + "latex": "\\pmb { L } _ { 1 } \\in \\mathbb { R } ^ { | I | \\times d _ { 0 } }" + }, + { + "category_id": 13, + "poly": [ + 1083, + 1157, + 1151, + 1157, + 1151, + 1188, + 1083, + 1188 + ], + "score": 0.91, + "latex": "{ \\mathcal { K } } _ { I \\times J }" + }, + { + "category_id": 13, + "poly": [ + 299, + 1096, + 503, + 1096, + 503, + 1131, + 299, + 1131 + ], + "score": 0.91, + "latex": "( ( A _ { 2 } ) _ { : , I } , ( A _ { 1 } ) _ { I , : } )" + }, + { + "category_id": 13, + "poly": [ + 377, + 1292, + 673, + 1292, + 673, + 1328, + 377, + 1328 + ], + "score": 0.91, + "latex": "\\sigma _ { 1 } ( J ) > \\cdots > \\sigma _ { r ( J ) } ( J )" + }, + { + "category_id": 13, + "poly": [ + 852, + 327, + 982, + 327, + 982, + 355, + 852, + 355 + ], + "score": 0.91, + "latex": "\\sigma : \\mathbb { R } \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1643, + 644, + 1643, + 644, + 1685, + 297, + 1685 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( J ) } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 895, + 1298, + 1063, + 1298, + 1063, + 1328, + 895, + 1328 + ], + "score": 0.91, + "latex": "m _ { 1 } , \\ldots , m _ { r ( J ) }" + }, + { + "category_id": 13, + "poly": [ + 1059, + 1261, + 1114, + 1261, + 1114, + 1294, + 1059, + 1294 + ], + "score": 0.91, + "latex": "r ( J )" + }, + { + "category_id": 14, + "poly": [ + 415, + 1794, + 1284, + 1794, + 1284, + 1842, + 415, + 1842 + ], + "score": 0.91, + "latex": "( A _ { 1 } ) _ { I , : } X _ { : , J } = C ^ { - 1 } V ^ { \\top } U _ { J } ^ { \\top } Y X _ { : , J } ^ { \\dagger } X _ { : , J } + C ^ { - 1 } ( I - \\mathcal { P } _ { \\mathrm { k e r } ( V ) } ) C L _ { 1 } X _ { : , J } \\geq 0 ," + }, + { + "category_id": 13, + "poly": [ + 477, + 549, + 543, + 549, + 543, + 579, + 477, + 579 + ], + "score": 0.91, + "latex": "\\boldsymbol { A } _ { 1 } \\boldsymbol { X }" + }, + { + "category_id": 13, + "poly": [ + 1006, + 935, + 1073, + 935, + 1073, + 966, + 1006, + 966 + ], + "score": 0.9, + "latex": "{ \\mathcal { K } } _ { I \\times J }" + }, + { + "category_id": 13, + "poly": [ + 444, + 1429, + 592, + 1429, + 592, + 1459, + 444, + 1459 + ], + "score": 0.9, + "latex": "V \\in \\mathbb { R } ^ { d _ { 2 } \\times | I | }" + }, + { + "category_id": 13, + "poly": [ + 503, + 732, + 546, + 732, + 546, + 761, + 503, + 761 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 723, + 701, + 766, + 701, + 766, + 731, + 723, + 731 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 1156, + 1574, + 1321, + 1574, + 1321, + 1607, + 1156, + 1607 + ], + "score": 0.9, + "latex": "V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 1001, + 1157, + 1044, + 1157, + 1044, + 1187, + 1001, + 1187 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 714, + 385, + 873, + 385, + 873, + 418, + 714, + 418 + ], + "score": 0.9, + "latex": "A _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }" + }, + { + "category_id": 13, + "poly": [ + 1189, + 1363, + 1258, + 1363, + 1258, + 1395, + 1189, + 1395 + ], + "score": 0.9, + "latex": "{ \\mathcal { K } } _ { I \\times J }" + }, + { + "category_id": 13, + "poly": [ + 706, + 1648, + 817, + 1648, + 817, + 1681, + 706, + 1681 + ], + "score": 0.89, + "latex": "L _ { 1 } , V , C" + }, + { + "category_id": 13, + "poly": [ + 877, + 1943, + 916, + 1943, + 916, + 1973, + 877, + 1973 + ], + "score": 0.89, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1027, + 967, + 1070, + 967, + 1070, + 995, + 1027, + 995 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 781, + 1943, + 820, + 1943, + 820, + 1973, + 781, + 1973 + ], + "score": 0.89, + "latex": "A _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 701, + 340, + 701, + 340, + 731, + 297, + 731 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 14, + "poly": [ + 472, + 1468, + 1227, + 1468, + 1227, + 1562, + 472, + 1562 + ], + "score": 0.89, + "latex": "\\begin{array} { r l } & { ( A _ { 1 } ) _ { I , : } = C ^ { - 1 } V ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } + L _ { 1 } - C ^ { - 1 } V ^ { \\top } V C L _ { 1 } X _ { : , J } X _ { : , J } ^ { \\dagger } , } \\\\ & { ( A _ { 2 } ) _ { : , I } = U _ { J } V C . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1609, + 372, + 1609, + 372, + 1638, + 298, + 1638 + ], + "score": 0.89, + "latex": "\\mathbb { R } ^ { \\bar { m } \\times \\bar { p } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1395, + 627, + 1395, + 627, + 1430, + 298, + 1430 + ], + "score": 0.88, + "latex": "\\{ 1 , \\dots , d _ { 1 } \\} , J \\subset \\{ 1 , \\dots , m \\}" + }, + { + "category_id": 14, + "poly": [ + 398, + 1008, + 1300, + 1008, + 1300, + 1056, + 398, + 1056 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\forall ( { \\pmb A } _ { 2 } , { \\pmb A } _ { 1 } ) \\in { \\pmb K } _ { I \\times J } , \\quad { \\pmb L } _ { N } : = \\frac { 1 } { 2 } \\left\\| ( { \\pmb A } _ { 2 } ) _ { : , I } ( { \\pmb A } _ { 1 } ) _ { I , : } { \\pmb X } _ { : , J } - { \\pmb Y } _ { : , J } \\right\\| _ { F } ^ { 2 } + \\frac { 1 } { 2 } \\left\\| { \\pmb Y } _ { : , J ^ { c } } \\right\\| _ { F } ^ { 2 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1112, + 1364, + 1155, + 1364, + 1155, + 1394, + 1112, + 1394 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 965, + 1261, + 1006, + 1261, + 1006, + 1293, + 965, + 1293 + ], + "score": 0.87, + "latex": "\\Sigma _ { J }" + }, + { + "category_id": 13, + "poly": [ + 543, + 385, + 702, + 385, + 702, + 417, + 543, + 417 + ], + "score": 0.87, + "latex": "A _ { 2 } \\in \\mathbb { R } ^ { d _ { 2 } \\times d _ { 1 } }" + }, + { + "category_id": 13, + "poly": [ + 565, + 1066, + 610, + 1066, + 610, + 1097, + 565, + 1097 + ], + "score": 0.86, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 980, + 1611, + 1173, + 1611, + 1173, + 1644, + 980, + 1644 + ], + "score": 0.86, + "latex": "i = 1 , \\ldots , r ( J )" + }, + { + "category_id": 13, + "poly": [ + 298, + 640, + 389, + 640, + 389, + 670, + 298, + 670 + ], + "score": 0.85, + "latex": "d _ { 0 } = m" + }, + { + "category_id": 13, + "poly": [ + 814, + 1613, + 928, + 1613, + 928, + 1643, + 814, + 1643 + ], + "score": 0.85, + "latex": "p _ { i } ~ \\leq ~ m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 477, + 1066, + 545, + 1066, + 545, + 1097, + 477, + 1097 + ], + "score": 0.85, + "latex": "{ \\mathcal { K } } _ { I \\times J }" + }, + { + "category_id": 13, + "poly": [ + 1352, + 1363, + 1405, + 1363, + 1405, + 1392, + 1352, + 1392 + ], + "score": 0.84, + "latex": "I \\subset" + }, + { + "category_id": 13, + "poly": [ + 442, + 1572, + 1065, + 1572, + 1065, + 1613, + 442, + 1613 + ], + "score": 0.84, + "latex": "V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r ( J ) } , \\overline { { V } } ) , \\mathbf { 0 } ^ { d _ { 2 } \\times ( | I | - \\mathrm { r a n k } ( ( A _ { 2 } ) _ { : , I } ) ) } ] ," + }, + { + "category_id": 13, + "poly": [ + 590, + 417, + 738, + 417, + 738, + 448, + 590, + 448 + ], + "score": 0.83, + "latex": "\\pmb { Y } \\in \\mathbb { R } ^ { d _ { 2 } \\times m }" + }, + { + "category_id": 13, + "poly": [ + 1338, + 1572, + 1404, + 1572, + 1404, + 1609, + 1338, + 1609 + ], + "score": 0.81, + "latex": "\\overline { { V } } \\in" + }, + { + "category_id": 13, + "poly": [ + 1189, + 1611, + 1285, + 1611, + 1285, + 1644, + 1189, + 1644 + ], + "score": 0.81, + "latex": "\\bar { p } ~ \\leq ~ \\bar { m }" + }, + { + "category_id": 13, + "poly": [ + 632, + 784, + 653, + 784, + 653, + 805, + 632, + 805 + ], + "score": 0.76, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 371, + 555, + 391, + 555, + 391, + 576, + 371, + 576 + ], + "score": 0.76, + "latex": "\\sigma" + }, + { + "category_id": 14, + "poly": [ + 450, + 883, + 1238, + 883, + 1238, + 922, + 450, + 922 + ], + "score": 0.75, + "latex": "K _ { I \\times J } : = \\{ ( A _ { 2 } , A _ { 1 } ) : ( A _ { 1 } ) _ { I , : } X _ { : , J } \\geq 0 , { \\mathrm { o t h e r ~ e n t r i e s ~ o f ~ } } A _ { 1 } X < 0 \\} ," + }, + { + "category_id": 13, + "poly": [ + 1156, + 1847, + 1275, + 1847, + 1275, + 1879, + 1156, + 1879 + ], + "score": 0.74, + "latex": "A _ { 1 } X < 0" + }, + { + "category_id": 13, + "poly": [ + 429, + 416, + 579, + 416, + 579, + 447, + 429, + 447 + ], + "score": 0.68, + "latex": "\\pmb { X } \\in \\mathbb { R } ^ { \\tilde { d } _ { 0 } \\times m }" + }, + { + "category_id": 13, + "poly": [ + 477, + 936, + 528, + 936, + 528, + 963, + 477, + 963 + ], + "score": 0.68, + "latex": "\" < \"" + }, + { + "category_id": 13, + "poly": [ + 384, + 935, + 425, + 935, + 425, + 966, + 384, + 966 + ], + "score": 0.68, + "latex": "\\because" + }, + { + "category_id": 13, + "poly": [ + 458, + 884, + 915, + 884, + 915, + 922, + 458, + 922 + ], + "score": 0.66, + "latex": "\\mathcal { K } _ { I \\times J } : = \\{ ( A _ { 2 } , A _ { 1 } ) : ( A _ { 1 } ) _ { I , : } X _ { : , J } \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 630, + 1097, + 656, + 1097, + 656, + 1123, + 630, + 1123 + ], + "score": 0.56, + "latex": "\\&" + }, + { + "category_id": 13, + "poly": [ + 1383, + 1398, + 1402, + 1398, + 1402, + 1424, + 1383, + 1424 + ], + "score": 0.47, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 951, + 580, + 977, + 580, + 977, + 607, + 951, + 607 + ], + "score": 0.41, + "latex": "\\&" + }, + { + "category_id": 13, + "poly": [ + 429, + 416, + 739, + 416, + 739, + 450, + 429, + 450 + ], + "score": 0.26, + "latex": "\\pmb { X } \\in \\mathbb { R } ^ { \\tilde { d } _ { 0 } \\times m } , \\pmb { Y } \\in \\mathbb { R } ^ { d _ { 2 } \\times m }" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 2085.0, + 861.0, + 2085.0, + 861.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 225.0, + 1222.0, + 225.0, + 1222.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 225.0, + 1222.0, + 225.0, + 1222.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 548.0, + 370.0, + 548.0, + 370.0, + 583.0, + 296.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 548.0, + 476.0, + 548.0, + 476.0, + 583.0, + 392.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 548.0, + 1406.0, + 548.0, + 1406.0, + 583.0, + 544.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 578.0, + 950.0, + 578.0, + 950.0, + 613.0, + 293.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 578.0, + 1403.0, + 578.0, + 1403.0, + 613.0, + 978.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 609.0, + 1406.0, + 609.0, + 1406.0, + 644.0, + 294.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 640.0, + 297.0, + 640.0, + 297.0, + 674.0, + 293.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 640.0, + 1406.0, + 640.0, + 1406.0, + 674.0, + 390.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 669.0, + 1407.0, + 669.0, + 1407.0, + 703.0, + 294.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 698.0, + 400.0, + 698.0, + 400.0, + 736.0, + 341.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 698.0, + 722.0, + 698.0, + 722.0, + 736.0, + 483.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 698.0, + 1150.0, + 698.0, + 1150.0, + 736.0, + 767.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 698.0, + 1406.0, + 698.0, + 1406.0, + 736.0, + 1233.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 732.0, + 502.0, + 732.0, + 502.0, + 763.0, + 295.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 732.0, + 966.0, + 732.0, + 966.0, + 763.0, + 547.0, + 763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1063.0, + 476.0, + 1063.0, + 476.0, + 1101.0, + 293.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 1063.0, + 564.0, + 1063.0, + 564.0, + 1101.0, + 546.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 611.0, + 1063.0, + 1406.0, + 1063.0, + 1406.0, + 1101.0, + 611.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1091.0, + 298.0, + 1091.0, + 298.0, + 1134.0, + 293.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 1091.0, + 629.0, + 1091.0, + 629.0, + 1134.0, + 504.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 1091.0, + 858.0, + 1091.0, + 858.0, + 1134.0, + 657.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1091.0, + 1406.0, + 1091.0, + 1406.0, + 1134.0, + 997.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1123.0, + 1405.0, + 1123.0, + 1405.0, + 1162.0, + 294.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1157.0, + 1000.0, + 1157.0, + 1000.0, + 1191.0, + 296.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 1157.0, + 1082.0, + 1157.0, + 1082.0, + 1191.0, + 1045.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1157.0, + 1403.0, + 1157.0, + 1403.0, + 1191.0, + 1152.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1188.0, + 1405.0, + 1188.0, + 1405.0, + 1222.0, + 295.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1221.0, + 962.0, + 1221.0, + 962.0, + 1259.0, + 291.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1260.0, + 1221.0, + 1406.0, + 1221.0, + 1406.0, + 1259.0, + 1260.0, + 1259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1259.0, + 636.0, + 1259.0, + 636.0, + 1296.0, + 295.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1259.0, + 964.0, + 1259.0, + 964.0, + 1296.0, + 758.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1259.0, + 1058.0, + 1259.0, + 1058.0, + 1296.0, + 1007.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 1259.0, + 1406.0, + 1259.0, + 1406.0, + 1296.0, + 1115.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1289.0, + 376.0, + 1289.0, + 376.0, + 1331.0, + 294.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 1289.0, + 894.0, + 1289.0, + 894.0, + 1331.0, + 674.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1289.0, + 1275.0, + 1289.0, + 1275.0, + 1331.0, + 1064.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1289.0, + 1407.0, + 1289.0, + 1407.0, + 1331.0, + 1343.0, + 1331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1323.0, + 476.0, + 1323.0, + 476.0, + 1355.0, + 296.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 295.0, + 1402.0, + 295.0, + 1402.0, + 327.0, + 295.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 326.0, + 851.0, + 326.0, + 851.0, + 362.0, + 294.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 326.0, + 1170.0, + 326.0, + 1170.0, + 362.0, + 983.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 326.0, + 1403.0, + 326.0, + 1403.0, + 362.0, + 1394.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 353.0, + 1405.0, + 353.0, + 1405.0, + 392.0, + 293.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 379.0, + 542.0, + 379.0, + 542.0, + 425.0, + 290.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 379.0, + 713.0, + 379.0, + 713.0, + 425.0, + 703.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 379.0, + 1407.0, + 379.0, + 1407.0, + 425.0, + 874.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 408.0, + 428.0, + 408.0, + 428.0, + 456.0, + 290.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 408.0, + 1408.0, + 408.0, + 1408.0, + 456.0, + 740.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 446.0, + 498.0, + 446.0, + 498.0, + 486.0, + 293.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1567.0, + 441.0, + 1567.0, + 441.0, + 1612.0, + 290.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 1567.0, + 1155.0, + 1567.0, + 1155.0, + 1612.0, + 1066.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1567.0, + 1337.0, + 1567.0, + 1337.0, + 1612.0, + 1322.0, + 1612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1601.0, + 297.0, + 1601.0, + 297.0, + 1651.0, + 291.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 1601.0, + 813.0, + 1601.0, + 813.0, + 1651.0, + 373.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 1601.0, + 979.0, + 1601.0, + 979.0, + 1651.0, + 929.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 1601.0, + 1188.0, + 1601.0, + 1188.0, + 1651.0, + 1174.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 1601.0, + 1408.0, + 1601.0, + 1408.0, + 1651.0, + 1286.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 279.0, + 1623.0, + 296.0, + 1623.0, + 296.0, + 1698.0, + 279.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 1623.0, + 705.0, + 1623.0, + 705.0, + 1698.0, + 645.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1623.0, + 911.0, + 1623.0, + 911.0, + 1698.0, + 818.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1909.0, + 1404.0, + 1909.0, + 1404.0, + 1944.0, + 294.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1941.0, + 505.0, + 1941.0, + 505.0, + 1976.0, + 292.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1941.0, + 780.0, + 1941.0, + 780.0, + 1976.0, + 599.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1941.0, + 876.0, + 1941.0, + 876.0, + 1976.0, + 821.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 1941.0, + 1404.0, + 1941.0, + 1404.0, + 1976.0, + 917.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1970.0, + 1278.0, + 1970.0, + 1278.0, + 2008.0, + 292.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 1970.0, + 1407.0, + 1970.0, + 1407.0, + 2008.0, + 1348.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 2003.0, + 1285.0, + 2003.0, + 1285.0, + 2036.0, + 394.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1360.0, + 1111.0, + 1360.0, + 1111.0, + 1399.0, + 294.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1360.0, + 1188.0, + 1360.0, + 1188.0, + 1399.0, + 1156.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 1360.0, + 1351.0, + 1360.0, + 1351.0, + 1399.0, + 1259.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1392.0, + 297.0, + 1392.0, + 297.0, + 1431.0, + 294.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1392.0, + 1211.0, + 1392.0, + 1211.0, + 1431.0, + 628.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1370.0, + 1392.0, + 1382.0, + 1392.0, + 1382.0, + 1431.0, + 1370.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1392.0, + 1407.0, + 1392.0, + 1407.0, + 1431.0, + 1403.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1423.0, + 443.0, + 1423.0, + 443.0, + 1466.0, + 292.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1423.0, + 870.0, + 1423.0, + 870.0, + 1466.0, + 593.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 1423.0, + 1137.0, + 1423.0, + 1137.0, + 1466.0, + 1022.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 775.0, + 631.0, + 775.0, + 631.0, + 813.0, + 294.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 775.0, + 1406.0, + 775.0, + 1406.0, + 813.0, + 654.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 805.0, + 999.0, + 805.0, + 999.0, + 845.0, + 293.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1069.0, + 805.0, + 1149.0, + 805.0, + 1149.0, + 845.0, + 1069.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 428.0, + 837.0, + 559.0, + 837.0, + 559.0, + 876.0, + 428.0, + 876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 929.0, + 383.0, + 929.0, + 383.0, + 971.0, + 293.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 929.0, + 476.0, + 929.0, + 476.0, + 971.0, + 426.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 929.0, + 1005.0, + 929.0, + 1005.0, + 971.0, + 529.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 929.0, + 1189.0, + 929.0, + 1189.0, + 971.0, + 1074.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1297.0, + 929.0, + 1404.0, + 929.0, + 1404.0, + 971.0, + 1297.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 964.0, + 475.0, + 964.0, + 475.0, + 1000.0, + 297.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 964.0, + 1026.0, + 964.0, + 1026.0, + 1000.0, + 615.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 964.0, + 1250.0, + 964.0, + 1250.0, + 1000.0, + 1071.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1747.0, + 615.0, + 1747.0, + 615.0, + 1786.0, + 294.0, + 1786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 1747.0, + 1091.0, + 1747.0, + 1091.0, + 1786.0, + 685.0, + 1786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1203.0, + 1747.0, + 1259.0, + 1747.0, + 1259.0, + 1786.0, + 1203.0, + 1786.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1237, + 1405, + 1237, + 1405, + 1615, + 297, + 1615 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 1727, + 1404, + 1727, + 1404, + 2035, + 298, + 2035 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 765, + 1404, + 765, + 1404, + 1019, + 297, + 1019 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 227, + 1402, + 227, + 1402, + 358, + 297, + 358 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 658, + 1403, + 658, + 1403, + 754, + 297, + 754 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 299, + 423, + 1403, + 423, + 1403, + 523, + 299, + 523 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 300, + 1026, + 1399, + 1026, + 1399, + 1090, + 300, + 1090 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 496, + 366, + 1200, + 366, + 1200, + 413, + 496, + 413 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 299, + 1154, + 1399, + 1154, + 1399, + 1218, + 299, + 1218 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 299, + 1113, + 1033, + 1113, + 1033, + 1147, + 299, + 1147 + ], + "score": 0.914 + }, + { + "category_id": 8, + "poly": [ + 436, + 537, + 891, + 537, + 891, + 580, + 436, + 580 + ], + "score": 0.907 + }, + { + "category_id": 8, + "poly": [ + 432, + 587, + 1266, + 587, + 1266, + 632, + 432, + 632 + ], + "score": 0.904 + }, + { + "category_id": 9, + "poly": [ + 1352, + 544, + 1400, + 544, + 1400, + 575, + 1352, + 575 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 299, + 1660, + 492, + 1660, + 492, + 1694, + 299, + 1694 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1351, + 374, + 1400, + 374, + 1400, + 405, + 1351, + 405 + ], + "score": 0.88 + }, + { + "category_id": 9, + "poly": [ + 1352, + 594, + 1400, + 594, + 1400, + 625, + 1352, + 625 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.795 + }, + { + "category_id": 13, + "poly": [ + 893, + 456, + 984, + 456, + 984, + 491, + 893, + 491 + ], + "score": 0.94, + "latex": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }" + }, + { + "category_id": 13, + "poly": [ + 1304, + 1462, + 1394, + 1462, + 1394, + 1493, + 1304, + 1493 + ], + "score": 0.93, + "latex": "\\mathcal { L } _ { n } = 2" + }, + { + "category_id": 14, + "poly": [ + 431, + 532, + 1267, + 532, + 1267, + 638, + 431, + 638 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { A _ { 1 } X _ { : , J } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J } \\geq 0 , } \\\\ & { A _ { 1 } X _ { : , J ^ { c } } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J ^ { c } } + \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J ^ { c } } - \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J } X _ { : , J } ^ { \\dagger } X _ { : , J ^ { c } } < 0 . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 608, + 294, + 746, + 294, + 746, + 330, + 608, + 330 + ], + "score": 0.93, + "latex": "\\boldsymbol { \\ell } _ { 1 } ^ { \\top } \\in \\mathbb { R } ^ { 1 \\times d _ { 0 } }" + }, + { + "category_id": 13, + "poly": [ + 299, + 861, + 551, + 861, + 551, + 901, + 299, + 901 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sigma _ { 1 } \\bar { ( \\pmb { J } ) } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1523, + 489, + 1523, + 489, + 1557, + 298, + 1557 + ], + "score": 0.92, + "latex": "I = \\{ 1 \\} , J ^ { \\prime \\prime } = \\emptyset" + }, + { + "category_id": 13, + "poly": [ + 432, + 826, + 749, + 826, + 749, + 864, + 432, + 864 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\mathcal { L } _ { N } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sigma _ { i } ( J ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1264, + 1368, + 1339, + 1368, + 1339, + 1399, + 1264, + 1399 + ], + "score": 0.92, + "latex": "{ \\mathcal { K } } _ { I \\times J ^ { \\prime } }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1397, + 528, + 1397, + 528, + 1431, + 297, + 1431 + ], + "score": 0.92, + "latex": "I = \\{ 1 \\} , J ^ { \\prime } = \\{ 2 \\}" + }, + { + "category_id": 13, + "poly": [ + 1261, + 1494, + 1342, + 1494, + 1342, + 1524, + 1261, + 1524 + ], + "score": 0.92, + "latex": "{ { \\cal { K } } _ { I \\times J ^ { \\prime \\prime } } }" + }, + { + "category_id": 13, + "poly": [ + 1222, + 768, + 1314, + 768, + 1314, + 803, + 1222, + 803 + ], + "score": 0.92, + "latex": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }" + }, + { + "category_id": 13, + "poly": [ + 643, + 721, + 781, + 721, + 781, + 757, + 643, + 757 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { \\ker ( \\mathbf { v } ) } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 299, + 261, + 426, + 261, + 426, + 296, + 299, + 296 + ], + "score": 0.92, + "latex": "\\{ 1 , \\ldots , m \\}" + }, + { + "category_id": 13, + "poly": [ + 559, + 1242, + 627, + 1242, + 627, + 1274, + 559, + 1274 + ], + "score": 0.92, + "latex": "{ \\mathcal { K } } _ { I \\times J }" + }, + { + "category_id": 13, + "poly": [ + 511, + 1304, + 914, + 1304, + 914, + 1339, + 511, + 1339 + ], + "score": 0.91, + "latex": "c = 1 , \\mathbf { v } = ( 1 , 0 ) ^ { \\top } , \\ell _ { 1 } = ( 1 , - 1 ) ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 298, + 488, + 380, + 488, + 380, + 524, + 298, + 524 + ], + "score": 0.91, + "latex": "c , \\mathbf { v } , \\mathbf { \\nabla } \\theta _ { 1 } ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 1110, + 1155, + 1255, + 1155, + 1255, + 1185, + 1110, + 1185 + ], + "score": 0.91, + "latex": "d _ { 2 } = d _ { 0 } = 2" + }, + { + "category_id": 13, + "poly": [ + 1227, + 1308, + 1295, + 1308, + 1295, + 1338, + 1227, + 1338 + ], + "score": 0.91, + "latex": "{ \\mathcal { K } } _ { I \\times J }" + }, + { + "category_id": 13, + "poly": [ + 977, + 263, + 1068, + 263, + 1068, + 297, + 977, + 297 + ], + "score": 0.91, + "latex": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }" + }, + { + "category_id": 13, + "poly": [ + 1157, + 1241, + 1346, + 1241, + 1346, + 1273, + 1157, + 1273 + ], + "score": 0.91, + "latex": "\\Sigma _ { J } = \\mathrm { d i a g } ( 4 , 0 )" + }, + { + "category_id": 13, + "poly": [ + 823, + 721, + 896, + 721, + 896, + 753, + 823, + 753 + ], + "score": 0.91, + "latex": "\\mathbf { v } \\neq \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1313, + 1155, + 1392, + 1155, + 1392, + 1185, + 1313, + 1185 + ], + "score": 0.9, + "latex": "d _ { 1 } = 1" + }, + { + "category_id": 13, + "poly": [ + 1127, + 231, + 1226, + 231, + 1226, + 261, + 1127, + 261 + ], + "score": 0.9, + "latex": "d _ { 1 } ~ = ~ 1" + }, + { + "category_id": 13, + "poly": [ + 735, + 1184, + 1101, + 1184, + 1101, + 1218, + 735, + 1218 + ], + "score": 0.9, + "latex": "X = \\mathrm { d i a g } ( 1 , 1 ) , Y = \\mathrm { d i a g } ( 2 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1460, + 676, + 1460, + 676, + 1495, + 298, + 1495 + ], + "score": 0.9, + "latex": "c = 1 , \\mathbf { v } = ( 1 , 0 ) ^ { \\top } , \\ell _ { 1 } = ( - 1 , 0 ) ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 683, + 1365, + 795, + 1365, + 795, + 1401, + 683, + 1401 + ], + "score": 0.9, + "latex": "\\begin{array} { l } { { \\mathcal { L } } _ { N } ~ = ~ \\frac { 1 } { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1351, + 956, + 1393, + 956, + 1393, + 987, + 1351, + 987 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 639, + 1524, + 682, + 1524, + 682, + 1554, + 639, + 1554 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 14, + "poly": [ + 499, + 365, + 1200, + 365, + 1200, + 414, + 499, + 414 + ], + "score": 0.89, + "latex": "A _ { 1 } = c ^ { - 1 } \\mathbf { v } ^ { \\top } U _ { J } ^ { \\top } Y _ { : , J } X _ { : , J } ^ { \\dag } + \\bar { \\ell } _ { 1 } ^ { \\top } - \\bar { \\ell } _ { 1 } ^ { \\top } X _ { : , J } X _ { : , J } ^ { \\dag } , \\quad A _ { 2 } = c U _ { J } \\mathbf { v } ." + }, + { + "category_id": 13, + "poly": [ + 979, + 296, + 1112, + 296, + 1112, + 326, + 979, + 326 + ], + "score": 0.89, + "latex": "\\mathbf { v } \\in \\mathbb { R } ^ { d _ { 2 } \\times 1 }" + }, + { + "category_id": 13, + "poly": [ + 586, + 866, + 677, + 866, + 677, + 901, + 586, + 901 + ], + "score": 0.89, + "latex": "{ \\mathcal { K } } _ { \\{ 1 \\} \\times J }" + }, + { + "category_id": 13, + "poly": [ + 707, + 927, + 748, + 927, + 748, + 957, + 707, + 957 + ], + "score": 0.89, + "latex": "\\Sigma _ { J }" + }, + { + "category_id": 13, + "poly": [ + 739, + 865, + 808, + 865, + 808, + 893, + 739, + 893 + ], + "score": 0.89, + "latex": "i = 1" + }, + { + "category_id": 13, + "poly": [ + 850, + 263, + 893, + 263, + 893, + 293, + 850, + 293 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 1063, + 1337, + 1104, + 1337, + 1104, + 1368, + 1063, + 1368 + ], + "score": 0.89, + "latex": "\\Sigma _ { J }" + }, + { + "category_id": 13, + "poly": [ + 1357, + 661, + 1401, + 661, + 1401, + 691, + 1357, + 691 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 685, + 1240, + 891, + 1240, + 891, + 1275, + 685, + 1275 + ], + "score": 0.88, + "latex": "I = \\{ 1 \\} , J = \\{ 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 1125, + 799, + 1166, + 799, + 1166, + 830, + 1125, + 830 + ], + "score": 0.88, + "latex": "\\Sigma _ { J }" + }, + { + "category_id": 13, + "poly": [ + 400, + 456, + 439, + 456, + 439, + 486, + 400, + 486 + ], + "score": 0.88, + "latex": "\\Sigma _ { J }" + }, + { + "category_id": 13, + "poly": [ + 735, + 1155, + 777, + 1155, + 777, + 1184, + 735, + 1184 + ], + "score": 0.87, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 1014, + 231, + 1057, + 231, + 1057, + 261, + 1014, + 261 + ], + "score": 0.86, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 1113, + 1273, + 1407, + 1273, + 1407, + 1306, + 1113, + 1306 + ], + "score": 0.86, + "latex": "2 c ^ { - 1 } ( \\mathbf { v } ) _ { 1 , : } \\geq 0 , ( \\ell _ { 1 } ) _ { 2 , : } <" + }, + { + "category_id": 13, + "poly": [ + 652, + 1400, + 858, + 1400, + 858, + 1429, + 652, + 1429 + ], + "score": 0.85, + "latex": "\\Sigma _ { J ^ { \\prime } } = \\mathrm { d i a } \\mathbf { \\bar { g } } ( 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 982, + 1521, + 1002, + 1521, + 1002, + 1558, + 982, + 1558 + ], + "score": 0.85, + "latex": "\\frac { 5 } { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1342, + 232, + 1403, + 232, + 1403, + 262, + 1342, + 262 + ], + "score": 0.81, + "latex": "J \\subset" + }, + { + "category_id": 13, + "poly": [ + 1267, + 297, + 1342, + 297, + 1342, + 326, + 1267, + 326 + ], + "score": 0.81, + "latex": "c \\in \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 1108, + 926, + 1151, + 926, + 1151, + 956, + 1108, + 956 + ], + "score": 0.81, + "latex": "\\mathcal { L } _ { N }" + }, + { + "category_id": 13, + "poly": [ + 624, + 1428, + 928, + 1428, + 928, + 1462, + 624, + 1462 + ], + "score": 0.75, + "latex": "c ^ { - 1 } ( \\mathbf { v } ) _ { 1 , : } \\geq 0 , ( \\ell _ { 1 } ) _ { 1 , : } < 0" + }, + { + "category_id": 13, + "poly": [ + 885, + 801, + 898, + 801, + 898, + 826, + 885, + 826 + ], + "score": 0.73, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1075, + 927, + 1096, + 927, + 1096, + 954, + 1075, + 954 + ], + "score": 0.54, + "latex": "J" + }, + { + "category_id": 13, + "poly": [ + 1379, + 772, + 1402, + 772, + 1402, + 796, + 1379, + 796 + ], + "score": 0.54, + "latex": "\\mathbf { v }" + }, + { + "category_id": 13, + "poly": [ + 536, + 1343, + 558, + 1343, + 558, + 1364, + 536, + 1364 + ], + "score": 0.48, + "latex": "\\mathbf { v }" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1658.0, + 497.0, + 1658.0, + 497.0, + 1699.0, + 297.0, + 1699.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, + 1238.0, + 558.0, + 1238.0, + 558.0, + 1277.0, + 294.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1238.0, + 684.0, + 1238.0, + 684.0, + 1277.0, + 628.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 1238.0, + 1156.0, + 1238.0, + 1156.0, + 1277.0, + 892.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 1238.0, + 1406.0, + 1238.0, + 1406.0, + 1277.0, + 1347.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1265.0, + 1112.0, + 1265.0, + 1112.0, + 1310.0, + 291.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1304.0, + 510.0, + 1304.0, + 510.0, + 1343.0, + 292.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 1304.0, + 1226.0, + 1304.0, + 1226.0, + 1343.0, + 915.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 1304.0, + 1406.0, + 1304.0, + 1406.0, + 1343.0, + 1296.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1336.0, + 535.0, + 1336.0, + 535.0, + 1371.0, + 294.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1336.0, + 1062.0, + 1336.0, + 1062.0, + 1371.0, + 559.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 1336.0, + 1405.0, + 1336.0, + 1405.0, + 1371.0, + 1105.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1363.0, + 682.0, + 1363.0, + 682.0, + 1410.0, + 290.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1363.0, + 1263.0, + 1363.0, + 1263.0, + 1410.0, + 796.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1363.0, + 1407.0, + 1363.0, + 1407.0, + 1410.0, + 1340.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1394.0, + 296.0, + 1394.0, + 296.0, + 1433.0, + 291.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1394.0, + 651.0, + 1394.0, + 651.0, + 1433.0, + 529.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 1394.0, + 1406.0, + 1394.0, + 1406.0, + 1433.0, + 859.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1425.0, + 623.0, + 1425.0, + 623.0, + 1466.0, + 291.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 1425.0, + 1406.0, + 1425.0, + 1406.0, + 1466.0, + 929.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1461.0, + 297.0, + 1461.0, + 297.0, + 1496.0, + 294.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 677.0, + 1461.0, + 1303.0, + 1461.0, + 1303.0, + 1496.0, + 677.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1461.0, + 1405.0, + 1461.0, + 1405.0, + 1496.0, + 1395.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1489.0, + 1260.0, + 1489.0, + 1260.0, + 1527.0, + 294.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1489.0, + 1405.0, + 1489.0, + 1405.0, + 1527.0, + 1343.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1507.0, + 297.0, + 1507.0, + 297.0, + 1573.0, + 285.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 490.0, + 1507.0, + 638.0, + 1507.0, + 638.0, + 1573.0, + 490.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 1507.0, + 981.0, + 1507.0, + 981.0, + 1573.0, + 683.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 1507.0, + 1416.0, + 1507.0, + 1416.0, + 1573.0, + 1003.0, + 1573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1550.0, + 1405.0, + 1550.0, + 1405.0, + 1589.0, + 292.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1583.0, + 943.0, + 1583.0, + 943.0, + 1616.0, + 295.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1728.0, + 1405.0, + 1728.0, + 1405.0, + 1764.0, + 293.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1760.0, + 1405.0, + 1760.0, + 1405.0, + 1794.0, + 293.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1790.0, + 1405.0, + 1790.0, + 1405.0, + 1822.0, + 294.0, + 1822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1821.0, + 1406.0, + 1821.0, + 1406.0, + 1854.0, + 292.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1849.0, + 1406.0, + 1849.0, + 1406.0, + 1887.0, + 292.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1880.0, + 1406.0, + 1880.0, + 1406.0, + 1917.0, + 293.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1910.0, + 1406.0, + 1910.0, + 1406.0, + 1947.0, + 292.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1975.0, + 293.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, + 2005.0, + 1077.0, + 2005.0, + 1077.0, + 2037.0, + 296.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 764.0, + 1221.0, + 764.0, + 1221.0, + 806.0, + 292.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1315.0, + 764.0, + 1378.0, + 764.0, + 1378.0, + 806.0, + 1315.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 764.0, + 1406.0, + 764.0, + 1406.0, + 806.0, + 1403.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 797.0, + 884.0, + 797.0, + 884.0, + 832.0, + 294.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 797.0, + 1124.0, + 797.0, + 1124.0, + 832.0, + 899.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 797.0, + 1404.0, + 797.0, + 1404.0, + 832.0, + 1167.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 827.0, + 431.0, + 827.0, + 431.0, + 865.0, + 295.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 827.0, + 1405.0, + 827.0, + 1405.0, + 865.0, + 750.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 855.0, + 298.0, + 855.0, + 298.0, + 903.0, + 287.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 855.0, + 585.0, + 855.0, + 585.0, + 903.0, + 552.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 855.0, + 738.0, + 855.0, + 738.0, + 903.0, + 678.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 855.0, + 1410.0, + 855.0, + 1410.0, + 903.0, + 809.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 896.0, + 1405.0, + 896.0, + 1405.0, + 930.0, + 294.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 924.0, + 706.0, + 924.0, + 706.0, + 960.0, + 291.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 924.0, + 1074.0, + 924.0, + 1074.0, + 960.0, + 749.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 924.0, + 1107.0, + 924.0, + 1107.0, + 960.0, + 1097.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 924.0, + 1407.0, + 924.0, + 1407.0, + 960.0, + 1152.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 952.0, + 1350.0, + 952.0, + 1350.0, + 992.0, + 292.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 952.0, + 1405.0, + 952.0, + 1405.0, + 992.0, + 1394.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 984.0, + 1203.0, + 984.0, + 1203.0, + 1021.0, + 294.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 228.0, + 1013.0, + 228.0, + 1013.0, + 265.0, + 293.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 228.0, + 1126.0, + 228.0, + 1126.0, + 265.0, + 1058.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 228.0, + 1341.0, + 228.0, + 1341.0, + 265.0, + 1227.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 427.0, + 259.0, + 849.0, + 259.0, + 849.0, + 300.0, + 427.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 259.0, + 976.0, + 259.0, + 976.0, + 300.0, + 894.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1069.0, + 259.0, + 1404.0, + 259.0, + 1404.0, + 300.0, + 1069.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 291.0, + 607.0, + 291.0, + 607.0, + 332.0, + 292.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 291.0, + 978.0, + 291.0, + 978.0, + 332.0, + 747.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 291.0, + 1266.0, + 291.0, + 1266.0, + 332.0, + 1113.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 291.0, + 1408.0, + 291.0, + 1408.0, + 332.0, + 1343.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 322.0, + 354.0, + 322.0, + 354.0, + 363.0, + 291.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 655.0, + 1356.0, + 655.0, + 1356.0, + 696.0, + 295.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 690.0, + 1405.0, + 690.0, + 1405.0, + 724.0, + 293.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 719.0, + 642.0, + 719.0, + 642.0, + 757.0, + 295.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 719.0, + 822.0, + 719.0, + 822.0, + 757.0, + 782.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 719.0, + 909.0, + 719.0, + 909.0, + 757.0, + 897.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 422.0, + 1405.0, + 422.0, + 1405.0, + 461.0, + 294.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 452.0, + 399.0, + 452.0, + 399.0, + 494.0, + 293.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 452.0, + 892.0, + 452.0, + 892.0, + 494.0, + 440.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 452.0, + 1408.0, + 452.0, + 1408.0, + 494.0, + 985.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 483.0, + 297.0, + 483.0, + 297.0, + 531.0, + 291.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 483.0, + 511.0, + 483.0, + 511.0, + 531.0, + 381.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1023.0, + 1403.0, + 1023.0, + 1403.0, + 1062.0, + 295.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1057.0, + 1325.0, + 1057.0, + 1325.0, + 1091.0, + 295.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1151.0, + 734.0, + 1151.0, + 734.0, + 1191.0, + 295.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 1151.0, + 1109.0, + 1151.0, + 1109.0, + 1191.0, + 778.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 1151.0, + 1312.0, + 1151.0, + 1312.0, + 1191.0, + 1256.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1151.0, + 1404.0, + 1151.0, + 1404.0, + 1191.0, + 1393.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1182.0, + 734.0, + 1182.0, + 734.0, + 1222.0, + 294.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.0, + 1182.0, + 1113.0, + 1182.0, + 1113.0, + 1222.0, + 1102.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1109.0, + 1030.0, + 1109.0, + 1030.0, + 1154.0, + 293.0, + 1154.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 283, + 1402, + 283, + 1402, + 348, + 299, + 348 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 290, + 370, + 1407, + 370, + 1407, + 2040, + 290, + 2040 + ], + "score": 0.913 + }, + { + "category_id": 0, + "poly": [ + 299, + 393, + 488, + 393, + 488, + 425, + 299, + 425 + ], + "score": 0.838 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.832 + }, + { + "category_id": 0, + "poly": [ + 301, + 232, + 559, + 232, + 559, + 261, + 301, + 261 + ], + "score": 0.612 + }, + { + "category_id": 1, + "poly": [ + 301, + 232, + 559, + 232, + 559, + 261, + 301, + 261 + ], + "score": 0.134 + }, + { + "category_id": 15, + "poly": [ + 296.0, + 390.0, + 491.0, + 390.0, + 491.0, + 430.0, + 296.0, + 430.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": [ + 299.0, + 233.0, + 559.0, + 233.0, + 559.0, + 263.0, + 299.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 279.0, + 1406.0, + 279.0, + 1406.0, + 321.0, + 294.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 313.0, + 1112.0, + 313.0, + 1112.0, + 349.0, + 295.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 394.0, + 492.0, + 394.0, + 492.0, + 429.0, + 294.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 440.0, + 1406.0, + 440.0, + 1406.0, + 482.0, + 291.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 473.0, + 834.0, + 473.0, + 834.0, + 514.0, + 320.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 525.0, + 1406.0, + 525.0, + 1406.0, + 567.0, + 291.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 558.0, + 999.0, + 558.0, + 999.0, + 593.0, + 321.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 611.0, + 1403.0, + 611.0, + 1403.0, + 646.0, + 294.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 659.0, + 1406.0, + 659.0, + 1406.0, + 704.0, + 291.0, + 704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 694.0, + 1321.0, + 694.0, + 1321.0, + 729.0, + 318.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 748.0, + 1406.0, + 748.0, + 1406.0, + 783.0, + 294.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 779.0, + 1404.0, + 779.0, + 1404.0, + 814.0, + 321.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 809.0, + 517.0, + 809.0, + 517.0, + 844.0, + 323.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 862.0, + 1404.0, + 862.0, + 1404.0, + 897.0, + 296.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 890.0, + 1408.0, + 890.0, + 1408.0, + 930.0, + 320.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 919.0, + 934.0, + 919.0, + 934.0, + 958.0, + 318.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 969.0, + 1406.0, + 969.0, + 1406.0, + 1013.0, + 291.0, + 1013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1004.0, + 809.0, + 1004.0, + 809.0, + 1043.0, + 318.0, + 1043.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1056.0, + 1404.0, + 1056.0, + 1404.0, + 1096.0, + 293.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1089.0, + 1100.0, + 1089.0, + 1100.0, + 1124.0, + 321.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1137.0, + 1403.0, + 1137.0, + 1403.0, + 1179.0, + 289.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1170.0, + 675.0, + 1170.0, + 675.0, + 1212.0, + 318.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1220.0, + 1408.0, + 1220.0, + 1408.0, + 1262.0, + 291.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1251.0, + 1073.0, + 1251.0, + 1073.0, + 1294.0, + 320.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1303.0, + 1406.0, + 1303.0, + 1406.0, + 1347.0, + 291.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1340.0, + 671.0, + 1340.0, + 671.0, + 1375.0, + 323.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1386.0, + 1406.0, + 1386.0, + 1406.0, + 1428.0, + 291.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1419.0, + 863.0, + 1419.0, + 863.0, + 1459.0, + 320.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1472.0, + 1406.0, + 1472.0, + 1406.0, + 1513.0, + 291.0, + 1513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1504.0, + 879.0, + 1504.0, + 879.0, + 1544.0, + 320.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1555.0, + 1406.0, + 1555.0, + 1406.0, + 1596.0, + 293.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 316.0, + 1585.0, + 1288.0, + 1585.0, + 1288.0, + 1625.0, + 316.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1633.0, + 1406.0, + 1633.0, + 1406.0, + 1683.0, + 289.0, + 1683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1670.0, + 399.0, + 1670.0, + 399.0, + 1707.0, + 321.0, + 1707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1721.0, + 1406.0, + 1721.0, + 1406.0, + 1760.0, + 291.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1753.0, + 1240.0, + 1753.0, + 1240.0, + 1791.0, + 320.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1800.0, + 1406.0, + 1800.0, + 1406.0, + 1845.0, + 291.0, + 1845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 1836.0, + 1151.0, + 1836.0, + 1151.0, + 1874.0, + 318.0, + 1874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1885.0, + 1406.0, + 1885.0, + 1406.0, + 1930.0, + 291.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1919.0, + 995.0, + 1919.0, + 995.0, + 1959.0, + 320.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1972.0, + 1406.0, + 1972.0, + 1406.0, + 2013.0, + 293.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 2000.0, + 839.0, + 2000.0, + 839.0, + 2042.0, + 318.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 233.0, + 559.0, + 233.0, + 559.0, + 263.0, + 299.0, + 263.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 292, + 227, + 1408, + 227, + 1408, + 886, + 292, + 886 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.838 + }, + { + "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, + 229.0, + 1404.0, + 229.0, + 1404.0, + 267.0, + 295.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 263.0, + 1405.0, + 263.0, + 1405.0, + 298.0, + 323.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 291.0, + 395.0, + 291.0, + 395.0, + 326.0, + 322.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 343.0, + 1404.0, + 343.0, + 1404.0, + 382.0, + 294.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 375.0, + 1406.0, + 375.0, + 1406.0, + 414.0, + 322.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 407.0, + 1043.0, + 407.0, + 1043.0, + 442.0, + 323.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 457.0, + 1405.0, + 457.0, + 1405.0, + 494.0, + 293.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 490.0, + 1018.0, + 490.0, + 1018.0, + 522.0, + 324.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 538.0, + 1405.0, + 538.0, + 1405.0, + 580.0, + 293.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 571.0, + 540.0, + 571.0, + 540.0, + 604.0, + 326.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 621.0, + 1405.0, + 621.0, + 1405.0, + 661.0, + 291.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 654.0, + 1103.0, + 654.0, + 1103.0, + 693.0, + 321.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 706.0, + 1406.0, + 706.0, + 1406.0, + 745.0, + 293.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 738.0, + 1405.0, + 738.0, + 1405.0, + 775.0, + 322.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 769.0, + 631.0, + 769.0, + 631.0, + 805.0, + 320.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 819.0, + 1406.0, + 819.0, + 1406.0, + 860.0, + 293.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 852.0, + 863.0, + 852.0, + 863.0, + 886.0, + 322.0, + 886.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 378, + 1402, + 378, + 1402, + 473, + 298, + 473 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 296, + 1866, + 1409, + 1866, + 1409, + 1933, + 296, + 1933 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 297, + 1207, + 1405, + 1207, + 1405, + 1272, + 297, + 1272 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 690, + 1149, + 1009, + 1149, + 1009, + 1194, + 690, + 1194 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 300, + 1723, + 1397, + 1723, + 1397, + 1788, + 300, + 1788 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 656, + 1949, + 1044, + 1949, + 1044, + 1990, + 656, + 1990 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 300, + 1344, + 1400, + 1344, + 1400, + 1408, + 300, + 1408 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 296, + 1646, + 1402, + 1646, + 1402, + 1711, + 296, + 1711 + ], + "score": 0.935 + }, + { + "category_id": 8, + "poly": [ + 574, + 1805, + 1124, + 1805, + 1124, + 1850, + 574, + 1850 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 297, + 1099, + 1185, + 1099, + 1185, + 1135, + 297, + 1135 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 295, + 734, + 1009, + 734, + 1009, + 770, + 295, + 770 + ], + "score": 0.93 + }, + { + "category_id": 8, + "poly": [ + 628, + 618, + 1071, + 618, + 1071, + 656, + 628, + 656 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 290, + 2001, + 1348, + 2001, + 1348, + 2039, + 290, + 2039 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 299, + 219, + 738, + 219, + 738, + 266, + 299, + 266 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 298, + 887, + 640, + 887, + 640, + 920, + 298, + 920 + ], + "score": 0.922 + }, + { + "category_id": 8, + "poly": [ + 629, + 577, + 1072, + 577, + 1072, + 612, + 629, + 612 + ], + "score": 0.92 + }, + { + "category_id": 8, + "poly": [ + 626, + 490, + 1025, + 490, + 1025, + 529, + 626, + 529 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 300, + 307, + 619, + 307, + 619, + 344, + 300, + 344 + ], + "score": 0.917 + }, + { + "category_id": 8, + "poly": [ + 578, + 981, + 1035, + 981, + 1035, + 1023, + 578, + 1023 + ], + "score": 0.915 + }, + { + "category_id": 8, + "poly": [ + 634, + 785, + 1066, + 785, + 1066, + 827, + 634, + 827 + ], + "score": 0.912 + }, + { + "category_id": 1, + "poly": [ + 295, + 929, + 1398, + 929, + 1398, + 965, + 295, + 965 + ], + "score": 0.911 + }, + { + "category_id": 8, + "poly": [ + 635, + 833, + 1064, + 833, + 1064, + 873, + 635, + 873 + ], + "score": 0.91 + }, + { + "category_id": 8, + "poly": [ + 626, + 664, + 1055, + 664, + 1055, + 701, + 626, + 701 + ], + "score": 0.909 + }, + { + "category_id": 8, + "poly": [ + 578, + 1027, + 1125, + 1027, + 1125, + 1066, + 578, + 1066 + ], + "score": 0.909 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1812, + 1400, + 1812, + 1400, + 1844, + 1351, + 1844 + ], + "score": 0.894 + }, + { + "category_id": 9, + "poly": [ + 1352, + 838, + 1400, + 838, + 1400, + 869, + 1352, + 869 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1352, + 792, + 1400, + 792, + 1400, + 824, + 1352, + 824 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1352, + 670, + 1401, + 670, + 1401, + 699, + 1352, + 699 + ], + "score": 0.886 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1029, + 1400, + 1029, + 1400, + 1059, + 1351, + 1059 + ], + "score": 0.883 + }, + { + "category_id": 9, + "poly": [ + 1352, + 495, + 1400, + 495, + 1400, + 526, + 1352, + 526 + ], + "score": 0.879 + }, + { + "category_id": 9, + "poly": [ + 1352, + 989, + 1400, + 989, + 1400, + 1019, + 1352, + 1019 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.868 + }, + { + "category_id": 8, + "poly": [ + 587, + 1287, + 1114, + 1287, + 1114, + 1330, + 587, + 1330 + ], + "score": 0.867 + }, + { + "category_id": 9, + "poly": [ + 1352, + 625, + 1400, + 625, + 1400, + 655, + 1352, + 655 + ], + "score": 0.865 + }, + { + "category_id": 9, + "poly": [ + 1352, + 580, + 1400, + 580, + 1400, + 609, + 1352, + 609 + ], + "score": 0.865 + }, + { + "category_id": 9, + "poly": [ + 1352, + 541, + 1400, + 541, + 1400, + 570, + 1352, + 570 + ], + "score": 0.857 + }, + { + "category_id": 8, + "poly": [ + 626, + 535, + 881, + 535, + 881, + 571, + 626, + 571 + ], + "score": 0.735 + }, + { + "category_id": 2, + "poly": [ + 1376, + 2004, + 1402, + 2004, + 1402, + 2031, + 1376, + 2031 + ], + "score": 0.637 + }, + { + "category_id": 8, + "poly": [ + 372, + 1421, + 1404, + 1421, + 1404, + 1633, + 372, + 1633 + ], + "score": 0.622 + }, + { + "category_id": 8, + "poly": [ + 626, + 535, + 881, + 535, + 881, + 571, + 626, + 571 + ], + "score": 0.299 + }, + { + "category_id": 8, + "poly": [ + 392, + 1475, + 1318, + 1475, + 1318, + 1632, + 392, + 1632 + ], + "score": 0.128 + }, + { + "category_id": 8, + "poly": [ + 294, + 1422, + 1399, + 1422, + 1399, + 1466, + 294, + 1466 + ], + "score": 0.092 + }, + { + "category_id": 13, + "poly": [ + 1184, + 929, + 1337, + 929, + 1337, + 962, + 1184, + 962 + ], + "score": 0.93, + "latex": "\\pmb { L } _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }" + }, + { + "category_id": 13, + "poly": [ + 508, + 737, + 616, + 737, + 616, + 769, + 508, + 769 + ], + "score": 0.93, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 14, + "poly": [ + 621, + 486, + 1073, + 486, + 1073, + 704, + 621, + 704 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathrm { v e c } ( U M V ) = ( V ^ { \\top } \\otimes U ) \\mathrm { v e c } ( M ) , } \\\\ & { ( U \\otimes V ) ^ { \\dagger } = U ^ { \\dagger } \\otimes V ^ { \\dagger } , } \\\\ & { ( M \\otimes W ) ( U \\otimes V ) = ( M U ) \\otimes ( W V ) , } \\\\ & { ( M ^ { \\top } M ) ^ { \\dagger } M ^ { \\top } = M ^ { \\top } ( M M ^ { \\top } ) ^ { \\dagger } = M ^ { \\dagger } , } \\\\ & { M M ^ { \\dagger } M = M , M ^ { \\dagger } M M ^ { \\dagger } = M ^ { \\dagger } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1058, + 2003, + 1341, + 2003, + 1341, + 2039, + 1058, + 2039 + ], + "score": 0.93, + "latex": "\\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma" + }, + { + "category_id": 13, + "poly": [ + 588, + 1101, + 695, + 1101, + 695, + 1135, + 588, + 1135 + ], + "score": 0.93, + "latex": "( A _ { 2 } , A _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 622, + 1374, + 775, + 1374, + 775, + 1406, + 622, + 1406 + ], + "score": 0.93, + "latex": "L _ { 1 } \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 0 } }" + }, + { + "category_id": 13, + "poly": [ + 411, + 2002, + 630, + 2002, + 630, + 2039, + 411, + 2039 + ], + "score": 0.93, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) }" + }, + { + "category_id": 13, + "poly": [ + 1034, + 1901, + 1136, + 1901, + 1136, + 1931, + 1034, + 1931 + ], + "score": 0.92, + "latex": "\\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X }" + }, + { + "category_id": 14, + "poly": [ + 310, + 1419, + 1409, + 1419, + 1409, + 1636, + 310, + 1636 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\mathrm { ~ \\% c c } ( A _ { 1 } ) = ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } ( X \\otimes A _ { 2 } ^ { \\top } ) \\mathrm { v e c } ( Y ) + [ I - ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } ( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) ] \\mathrm { v e c } ( L _ { 1 } ) } \\\\ & { \\overset { ( i ) } { = } \\left( ( X X ^ { \\top } ) ^ { \\dagger } X \\otimes ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } \\right) \\mathrm { v e c } ( Y ) + [ I - ( X X ^ { \\top } ) ^ { \\dagger } X X ^ { \\top } \\otimes ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } A _ { 2 } ] \\mathrm { v e c } ( L _ { 1 } ) } \\\\ & { = \\mathrm { v e c } \\big ( ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } Y X ^ { \\top } ( X X ^ { \\top } ) ^ { \\dagger } + L _ { 1 } - ( A _ { 2 } ^ { \\top } A _ { 2 } ) ^ { \\dagger } A _ { 2 } ^ { \\top } A _ { 2 } L _ { 1 } X X X ^ { \\top } ( X X ^ { \\top } ) ^ { \\dagger } \\big ) } \\\\ & { \\overset { ( i i ) } { = } \\mathrm { v e c } \\Big ( A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } + L _ { 1 } - A _ { 2 } ^ { \\dagger } A _ { 2 } L _ { 1 } X X ^ { \\dagger } \\Big ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 656, + 1948, + 1046, + 1948, + 1046, + 1989, + 656, + 1989 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } ." + }, + { + "category_id": 13, + "poly": [ + 298, + 1898, + 435, + 1898, + 435, + 1933, + 298, + 1933 + ], + "score": 0.92, + "latex": "Y X ^ { \\top } A _ { 1 } ^ { \\top } A _ { 2 } ^ { \\top }" + }, + { + "category_id": 14, + "poly": [ + 630, + 781, + 1067, + 781, + 1067, + 878, + 630, + 878 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\nabla _ { A _ { 1 } } \\mathscr { L } = A _ { 2 } ^ { \\top } ( A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } ) \\boldsymbol { X } ^ { \\top } = \\mathbf { 0 } , } \\\\ { \\nabla _ { A _ { 2 } } \\mathscr { L } = ( A _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } ) \\boldsymbol { X } ^ { \\top } A _ { 1 } ^ { \\top } = \\mathbf { 0 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 581, + 441, + 741, + 441, + 741, + 473, + 581, + 473 + ], + "score": 0.92, + "latex": "M , U , V , W" + }, + { + "category_id": 13, + "poly": [ + 474, + 930, + 581, + 930, + 581, + 965, + 474, + 965 + ], + "score": 0.92, + "latex": "\\left( A _ { 2 } , A _ { 1 } \\right)" + }, + { + "category_id": 14, + "poly": [ + 574, + 1802, + 1126, + 1802, + 1126, + 1850, + 574, + 1850 + ], + "score": 0.92, + "latex": "A _ { 2 } A _ { 1 } X = A _ { 2 } A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } X = { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { 2 } ) } Y X ^ { \\dagger } X ." + }, + { + "category_id": 14, + "poly": [ + 687, + 1148, + 1012, + 1148, + 1012, + 1193, + 687, + 1193 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\pmb { A } _ { 2 } ^ { \\top } \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } = \\pmb { A } _ { 2 } ^ { \\top } \\pmb { Y } \\pmb { X } ^ { \\top } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 820, + 1866, + 861, + 1866, + 861, + 1903, + 820, + 1903 + ], + "score": 0.91, + "latex": "A _ { 2 } ^ { \\top }" + }, + { + "category_id": 14, + "poly": [ + 572, + 977, + 1129, + 977, + 1129, + 1071, + 572, + 1071 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { A _ { 1 } = A _ { 2 } ^ { \\dagger } Y X ^ { \\dagger } + L _ { 1 } - A _ { 2 } ^ { \\dagger } A _ { 2 } L _ { 1 } X X ^ { \\dagger } , } \\\\ & { \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 583, + 1286, + 1116, + 1286, + 1116, + 1329, + 583, + 1329 + ], + "score": 0.9, + "latex": "( X X ^ { \\top } \\otimes A _ { 2 } ^ { \\top } A _ { 2 } ) \\mathrm { v e c } ( A _ { 1 } ) = ( X \\otimes A _ { 2 } ^ { \\top } ) \\mathrm { v e c } ( Y ) ." + }, + { + "category_id": 13, + "poly": [ + 1150, + 1866, + 1403, + 1866, + 1403, + 1903, + 1150, + 1903 + ], + "score": 0.89, + "latex": "A _ { \\mathrm { 2 } } A _ { \\mathrm { 1 } } X X ^ { \\top } A _ { \\mathrm { 1 } } ^ { \\top } A _ { \\mathrm { 2 } } ^ { \\top } =" + }, + { + "category_id": 13, + "poly": [ + 368, + 1345, + 467, + 1345, + 467, + 1379, + 368, + 1379 + ], + "score": 0.89, + "latex": "\\mathrm { v e c } ( A _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 988, + 1727, + 1027, + 1727, + 1027, + 1756, + 988, + 1756 + ], + "score": 0.89, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 843, + 738, + 865, + 738, + 865, + 764, + 843, + 764 + ], + "score": 0.85, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 1234, + 1727, + 1264, + 1727, + 1264, + 1753, + 1234, + 1753 + ], + "score": 0.84, + "latex": "\\boldsymbol { X }" + }, + { + "category_id": 13, + "poly": [ + 922, + 1103, + 944, + 1103, + 944, + 1129, + 922, + 1129 + ], + "score": 0.83, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 716, + 380, + 812, + 380, + 812, + 412, + 716, + 412 + ], + "score": 0.82, + "latex": "\\mathrm { v e c } ( M )" + }, + { + "category_id": 13, + "poly": [ + 588, + 381, + 626, + 381, + 626, + 408, + 588, + 408 + ], + "score": 0.8, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 819, + 933, + 840, + 933, + 840, + 959, + 819, + 959 + ], + "score": 0.66, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 682, + 412, + 713, + 412, + 713, + 439, + 682, + 439 + ], + "score": 0.57, + "latex": "\\otimes ^ { \\bullet }" + }, + { + "category_id": 13, + "poly": [ + 484, + 1104, + 499, + 1104, + 499, + 1129, + 484, + 1129 + ], + "score": 0.5, + "latex": "^ { l }" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 219.0, + 741.0, + 219.0, + 741.0, + 268.0, + 292.0, + 268.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": [ + 1380.0, + 2009.0, + 1402.0, + 2009.0, + 1402.0, + 2030.0, + 1380.0, + 2030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 376.0, + 587.0, + 376.0, + 587.0, + 416.0, + 293.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 376.0, + 715.0, + 376.0, + 715.0, + 416.0, + 627.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 376.0, + 1402.0, + 376.0, + 1402.0, + 416.0, + 813.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 410.0, + 681.0, + 410.0, + 681.0, + 444.0, + 294.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 410.0, + 1402.0, + 410.0, + 1402.0, + 444.0, + 714.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 441.0, + 580.0, + 441.0, + 580.0, + 473.0, + 294.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 441.0, + 753.0, + 441.0, + 753.0, + 473.0, + 742.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1864.0, + 819.0, + 1864.0, + 819.0, + 1905.0, + 295.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1864.0, + 1149.0, + 1864.0, + 1149.0, + 1905.0, + 862.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 1898.0, + 1033.0, + 1898.0, + 1033.0, + 1935.0, + 436.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 1898.0, + 1368.0, + 1898.0, + 1368.0, + 1935.0, + 1137.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1205.0, + 1406.0, + 1205.0, + 1406.0, + 1246.0, + 294.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1240.0, + 594.0, + 1240.0, + 594.0, + 1270.0, + 292.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1722.0, + 987.0, + 1722.0, + 987.0, + 1762.0, + 295.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 1722.0, + 1233.0, + 1722.0, + 1233.0, + 1762.0, + 1028.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1265.0, + 1722.0, + 1403.0, + 1722.0, + 1403.0, + 1762.0, + 1265.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1755.0, + 683.0, + 1755.0, + 683.0, + 1792.0, + 296.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1344.0, + 367.0, + 1344.0, + 367.0, + 1380.0, + 296.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 1344.0, + 1405.0, + 1344.0, + 1405.0, + 1380.0, + 468.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1367.0, + 621.0, + 1367.0, + 621.0, + 1413.0, + 293.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1367.0, + 888.0, + 1367.0, + 888.0, + 1413.0, + 776.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1645.0, + 1404.0, + 1645.0, + 1404.0, + 1685.0, + 295.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1680.0, + 530.0, + 1680.0, + 530.0, + 1712.0, + 295.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1098.0, + 483.0, + 1098.0, + 483.0, + 1138.0, + 295.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 1098.0, + 587.0, + 1098.0, + 587.0, + 1138.0, + 500.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 1098.0, + 921.0, + 1098.0, + 921.0, + 1138.0, + 696.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 1098.0, + 1187.0, + 1098.0, + 1187.0, + 1138.0, + 945.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 733.0, + 507.0, + 733.0, + 507.0, + 773.0, + 294.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 733.0, + 842.0, + 733.0, + 842.0, + 773.0, + 617.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 733.0, + 1010.0, + 733.0, + 1010.0, + 773.0, + 866.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1995.0, + 410.0, + 1995.0, + 410.0, + 2045.0, + 290.0, + 2045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 1995.0, + 1057.0, + 1995.0, + 1057.0, + 2045.0, + 631.0, + 2045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1342.0, + 1995.0, + 1352.0, + 1995.0, + 1352.0, + 2045.0, + 1342.0, + 2045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 883.0, + 642.0, + 883.0, + 642.0, + 927.0, + 295.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 307.0, + 623.0, + 307.0, + 623.0, + 348.0, + 295.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 924.0, + 473.0, + 924.0, + 473.0, + 968.0, + 291.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 924.0, + 818.0, + 924.0, + 818.0, + 968.0, + 582.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 924.0, + 1183.0, + 924.0, + 1183.0, + 968.0, + 841.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1338.0, + 924.0, + 1403.0, + 924.0, + 1403.0, + 968.0, + 1338.0, + 968.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 437, + 1406, + 437, + 1406, + 845, + 296, + 845 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 296, + 227, + 1405, + 227, + 1405, + 357, + 296, + 357 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 859, + 1404, + 859, + 1404, + 985, + 298, + 985 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 1316, + 1405, + 1316, + 1405, + 1413, + 299, + 1413 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 373, + 1002, + 1330, + 1002, + 1330, + 1296, + 373, + 1296 + ], + "score": 0.964 + }, + { + "category_id": 8, + "poly": [ + 502, + 1430, + 1195, + 1430, + 1195, + 1521, + 502, + 1521 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 297, + 1966, + 1403, + 1966, + 1403, + 2037, + 297, + 2037 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 298, + 1777, + 1401, + 1777, + 1401, + 1847, + 298, + 1847 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 680, + 381, + 1020, + 381, + 1020, + 422, + 680, + 422 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 536, + 1594, + 1163, + 1594, + 1163, + 1639, + 536, + 1639 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 298, + 1659, + 547, + 1659, + 547, + 1691, + 298, + 1691 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 300, + 1539, + 907, + 1539, + 907, + 1575, + 300, + 1575 + ], + "score": 0.928 + }, + { + "category_id": 8, + "poly": [ + 580, + 1712, + 1119, + 1712, + 1119, + 1757, + 580, + 1757 + ], + "score": 0.926 + }, + { + "category_id": 0, + "poly": [ + 299, + 1896, + 669, + 1896, + 669, + 1933, + 299, + 1933 + ], + "score": 0.915 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.868 + }, + { + "category_id": 14, + "poly": [ + 367, + 999, + 1331, + 999, + 1331, + 1301, + 367, + 1301 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { A _ { 2 } A _ { 1 } X X ^ { \\top } A _ { 1 } ^ { \\top } = U V ( U V ) ^ { \\top } Y X ^ { \\top } X X ^ { \\top } A _ { 1 } ^ { \\top } } \\\\ & { \\overset { ( i ) } { = } U V ( U V ) ^ { \\top } Y X ^ { \\top } A _ { 1 } ^ { \\top } } \\\\ & { \\quad \\quad = U V ( U V ) ^ { \\top } \\Sigma U V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } } \\\\ & { \\quad \\quad \\quad - U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } } \\\\ & { \\quad \\quad = U V V ^ { \\top } \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) } \\\\ & { \\overset { ( i i ) } { = } U \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + U V ( U V ) ^ { \\top } Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 882, + 768, + 1022, + 768, + 1022, + 807, + 882, + 807 + ], + "score": 0.93, + "latex": "V = [ \\widehat { V } , \\mathbf { 0 } ]" + }, + { + "category_id": 13, + "poly": [ + 1119, + 730, + 1318, + 730, + 1318, + 771, + 1119, + 771 + ], + "score": 0.93, + "latex": "{ \\cal A } _ { 2 } = U [ \\widehat { V } , { \\bf 0 } ] C" + }, + { + "category_id": 13, + "poly": [ + 1250, + 474, + 1393, + 474, + 1393, + 508, + 1250, + 508 + ], + "score": 0.93, + "latex": "\\overline { { \\mathcal { P } } } \\in \\mathbb { R } ^ { \\bar { n } \\times \\bar { m } }" + }, + { + "category_id": 13, + "poly": [ + 474, + 804, + 677, + 804, + 677, + 844, + 474, + 844 + ], + "score": 0.93, + "latex": "\\pmb { A } _ { 2 } ^ { \\dagger } = \\pmb { C } ^ { - 1 } \\pmb { V } ^ { \\top } \\pmb { U } ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 487, + 1779, + 864, + 1779, + 864, + 1820, + 487, + 1820 + ], + "score": 0.93, + "latex": "( I - U V ( U V ) ^ { \\top } ) = \\mathcal { P } _ { \\mathrm { c o l } ( U V ) ^ { \\perp } }" + }, + { + "category_id": 13, + "poly": [ + 410, + 2003, + 517, + 2003, + 517, + 2036, + 410, + 2036 + ], + "score": 0.93, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 927, + 1779, + 1198, + 1779, + 1198, + 1818, + 927, + 1818 + ], + "score": 0.93, + "latex": "( I - V ^ { \\top } V ) = { \\mathcal P } _ { \\ker ( V ) }" + }, + { + "category_id": 13, + "poly": [ + 430, + 516, + 552, + 516, + 552, + 552, + 430, + 552 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }" + }, + { + "category_id": 13, + "poly": [ + 528, + 477, + 937, + 477, + 937, + 515, + 528, + 515 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } = \\mathrm { d i a g } ( \\mathcal { P } _ { 1 } , \\dots , \\mathcal { P } _ { r } , \\overline { { \\mathcal { P } } } )" + }, + { + "category_id": 13, + "poly": [ + 475, + 1542, + 603, + 1542, + 603, + 1575, + 475, + 1575 + ], + "score": 0.92, + "latex": "\\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 693, + 651, + 917, + 651, + 917, + 693, + 693, + 693 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } = \\widehat { V } \\widehat { V } ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 915, + 441, + 1036, + 441, + 1036, + 477, + 915, + 477 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }" + }, + { + "category_id": 13, + "poly": [ + 645, + 617, + 782, + 617, + 782, + 653, + 645, + 653 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { i } = V _ { i } V _ { i } ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 460, + 694, + 958, + 694, + 958, + 734, + 460, + 734 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top } = U \\widehat { V } \\widehat { V } ^ { \\top } U ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 598, + 1317, + 783, + 1317, + 783, + 1350, + 598, + 1350 + ], + "score": 0.92, + "latex": "X ^ { \\dag } X X ^ { \\dag } = X ^ { \\dag }" + }, + { + "category_id": 13, + "poly": [ + 1277, + 516, + 1399, + 516, + 1399, + 553, + 1277, + 553 + ], + "score": 0.91, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) }" + }, + { + "category_id": 14, + "poly": [ + 500, + 1427, + 1197, + 1427, + 1197, + 1526, + 500, + 1526 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { Y X ^ { \\top } A _ { 1 } ^ { \\top } = \\Sigma U V ( C ^ { \\top } ) ^ { - 1 } + Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) } \\\\ { = U \\Lambda V ( C ^ { \\top } ) ^ { - 1 } + Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1027, + 477, + 1193, + 477, + 1193, + 509, + 1027, + 509 + ], + "score": 0.91, + "latex": "\\mathcal { P } _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times m _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 1146, + 228, + 1293, + 228, + 1293, + 260, + 1146, + 260 + ], + "score": 0.91, + "latex": "\\pmb { \\Sigma } = \\pmb { U } \\pmb { \\Lambda } \\pmb { U } ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 995, + 652, + 1294, + 652, + 1294, + 690, + 995, + 690 + ], + "score": 0.91, + "latex": "\\widehat { V } = \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { V } } )" + }, + { + "category_id": 13, + "poly": [ + 838, + 263, + 1054, + 263, + 1054, + 292, + 838, + 292 + ], + "score": 0.91, + "latex": "\\sigma _ { 1 } > . . . > \\sigma _ { r } > 0" + }, + { + "category_id": 13, + "poly": [ + 1105, + 1349, + 1307, + 1349, + 1307, + 1380, + 1105, + 1380 + ], + "score": 0.91, + "latex": "V \\mathbf { \\hat { V } } ^ { \\top } \\mathbf { A } V = \\mathbf { A } V" + }, + { + "category_id": 14, + "poly": [ + 676, + 381, + 1021, + 381, + 1021, + 421, + 676, + 421 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathbf { \\Delta } \\Lambda \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\mathbf { A } _ { 2 } ) } = \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\mathbf { A } _ { 2 } ) } \\mathbf { \\Lambda } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 455, + 587, + 551, + 587, + 551, + 616, + 455, + 616 + ], + "score": 0.91, + "latex": "p _ { i } \\leq m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 350, + 320, + 674, + 320, + 674, + 359, + 350, + 359 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathcal { P } _ { \\mathrm { c o l } ( \\dot { A } _ { 2 } ) } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 855, + 734, + 1003, + 734, + 1003, + 766, + 855, + 766 + ], + "score": 0.9, + "latex": "C \\in \\mathbb { R } ^ { d _ { 1 } \\times d _ { 1 } }" + }, + { + "category_id": 13, + "poly": [ + 1236, + 773, + 1394, + 773, + 1394, + 805, + 1236, + 805 + ], + "score": 0.9, + "latex": "A _ { 2 } = U V C" + }, + { + "category_id": 13, + "poly": [ + 709, + 920, + 1328, + 920, + 1328, + 957, + 709, + 957 + ], + "score": 0.9, + "latex": "A _ { 2 } A _ { 1 } { \\cal X } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } { \\cal Y } { \\cal X } ^ { \\dagger } { \\cal X } = { \\cal U } { \\cal V } ( { \\bar { U } } { \\cal V } ) ^ { \\top } { \\cal Y } { \\cal X } ^ { \\dagger } { \\cal X }" + }, + { + "category_id": 13, + "poly": [ + 328, + 730, + 382, + 730, + 382, + 766, + 328, + 766 + ], + "score": 0.9, + "latex": "\\boldsymbol { U } \\widehat { \\boldsymbol { V } }" + }, + { + "category_id": 13, + "poly": [ + 296, + 769, + 566, + 769, + 566, + 803, + 296, + 803 + ], + "score": 0.89, + "latex": "\\mathbf { 0 } \\in \\mathbb { R } ^ { d _ { 2 } \\times ( d _ { 1 } - \\operatorname { r a n k } ( A _ { 2 } ) ) }" + }, + { + "category_id": 13, + "poly": [ + 1115, + 811, + 1153, + 811, + 1153, + 841, + 1115, + 841 + ], + "score": 0.89, + "latex": "\\pmb { A } _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 715, + 954, + 753, + 954, + 753, + 983, + 715, + 983 + ], + "score": 0.89, + "latex": "A _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1256, + 267, + 1394, + 267, + 1394, + 293, + 1256, + 293 + ], + "score": 0.89, + "latex": "m _ { 1 } , \\ldots , m _ { r }" + }, + { + "category_id": 13, + "poly": [ + 1046, + 697, + 1086, + 697, + 1086, + 727, + 1046, + 727 + ], + "score": 0.89, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 486, + 922, + 525, + 922, + 525, + 952, + 486, + 952 + ], + "score": 0.88, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 605, + 232, + 643, + 232, + 643, + 261, + 605, + 261 + ], + "score": 0.88, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 617, + 1969, + 1330, + 1969, + 1330, + 2008, + 617, + 2008 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( A _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( A _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { 1 } ^ { \\top } \\pmb { A } _ { 2 } ^ { \\top } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 873, + 584, + 1166, + 584, + 1166, + 618, + 873, + 618 + ], + "score": 0.88, + "latex": "{ \\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + \\bar { p } = \\mathrm { r a n k } ( A _ { 2 } ) }" + }, + { + "category_id": 13, + "poly": [ + 1121, + 892, + 1254, + 892, + 1254, + 922, + 1121, + 922 + ], + "score": 0.88, + "latex": "\\nabla _ { A _ { 2 } } \\mathcal { L } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1006, + 618, + 1140, + 618, + 1140, + 647, + 1006, + 647 + ], + "score": 0.88, + "latex": "\\overline { { V } } \\in \\mathbb { R } ^ { \\bar { n } \\times \\bar { p } }" + }, + { + "category_id": 13, + "poly": [ + 1029, + 557, + 1173, + 557, + 1173, + 585, + 1029, + 585 + ], + "score": 0.88, + "latex": "p _ { 1 } , \\ldots , p _ { r } , \\bar { p }" + }, + { + "category_id": 14, + "poly": [ + 538, + 1594, + 1159, + 1594, + 1159, + 1638, + 538, + 1638 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } ( I - C ^ { \\top } V ^ { \\top } V ( C ^ { \\top } ) ^ { - 1 } ) = \\mathbf { 0 } , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 580, + 1713, + 1116, + 1713, + 1116, + 1756, + 580, + 1756 + ], + "score": 0.85, + "latex": "\\begin{array} { r } { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } ( I - V ^ { \\top } V ) = \\mathbf { 0 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1250, + 1322, + 1277, + 1322, + 1277, + 1348, + 1250, + 1348 + ], + "score": 0.84, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 565, + 891, + 652, + 891, + 652, + 922, + 565, + 922 + ], + "score": 0.84, + "latex": "A _ { 1 } , A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 840, + 619, + 993, + 619, + 993, + 649, + 840, + 649 + ], + "score": 0.8, + "latex": "V _ { i } \\in \\mathbb { R } ^ { m _ { i } \\times p _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 946, + 1353, + 971, + 1353, + 971, + 1379, + 946, + 1379 + ], + "score": 0.8, + "latex": "\\pmb { \\Lambda }" + }, + { + "category_id": 13, + "poly": [ + 786, + 295, + 814, + 295, + 814, + 320, + 786, + 320 + ], + "score": 0.79, + "latex": "\\bar { m }" + }, + { + "category_id": 13, + "poly": [ + 870, + 550, + 897, + 550, + 897, + 582, + 870, + 582 + ], + "score": 0.77, + "latex": "\\overline { { \\mathcal { P } } }" + }, + { + "category_id": 13, + "poly": [ + 1201, + 293, + 1225, + 293, + 1225, + 319, + 1201, + 319 + ], + "score": 0.75, + "latex": "\\pmb { \\Lambda }" + }, + { + "category_id": 13, + "poly": [ + 743, + 586, + 822, + 586, + 822, + 615, + 743, + 615 + ], + "score": 0.75, + "latex": "\\bar { p } \\leq \\bar { m }" + }, + { + "category_id": 13, + "poly": [ + 826, + 515, + 861, + 515, + 861, + 547, + 826, + 547 + ], + "score": 0.74, + "latex": "\\mathcal { P } _ { r }" + }, + { + "category_id": 13, + "poly": [ + 824, + 553, + 858, + 553, + 858, + 584, + 824, + 584 + ], + "score": 0.74, + "latex": "\\mathcal { P } _ { r }" + }, + { + "category_id": 13, + "poly": [ + 595, + 585, + 733, + 585, + 733, + 615, + 595, + 615 + ], + "score": 0.69, + "latex": "i = 1 , \\dots , r" + }, + { + "category_id": 13, + "poly": [ + 872, + 514, + 899, + 514, + 899, + 544, + 872, + 544 + ], + "score": 0.67, + "latex": "\\overline { { \\mathcal { P } } }" + }, + { + "category_id": 13, + "poly": [ + 874, + 442, + 898, + 442, + 898, + 468, + 874, + 468 + ], + "score": 0.66, + "latex": "\\pmb { \\Lambda }" + }, + { + "category_id": 13, + "poly": [ + 728, + 517, + 810, + 517, + 810, + 547, + 728, + 547 + ], + "score": 0.65, + "latex": "\\mathcal { P } _ { 1 } , \\ldots ." + }, + { + "category_id": 13, + "poly": [ + 1376, + 231, + 1401, + 231, + 1401, + 258, + 1376, + 258 + ], + "score": 0.64, + "latex": "\\pmb { \\Lambda }" + }, + { + "category_id": 13, + "poly": [ + 725, + 554, + 807, + 554, + 807, + 584, + 725, + 584 + ], + "score": 0.64, + "latex": "\\mathcal { P } _ { 1 } , \\ldots ." + }, + { + "category_id": 13, + "poly": [ + 1240, + 857, + 1407, + 857, + 1407, + 894, + 1240, + 894 + ], + "score": 0.57, + "latex": "( \\nabla _ { A _ { 2 } } \\mathcal { L } ) A _ { 2 } ^ { \\top } =" + }, + { + "category_id": 13, + "poly": [ + 399, + 553, + 514, + 553, + 514, + 586, + 399, + 586 + ], + "score": 0.54, + "latex": "\\operatorname { r a n k } ( A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1102, + 860, + 1230, + 860, + 1230, + 892, + 1102, + 892 + ], + "score": 0.52, + "latex": "\\nabla _ { A _ { 1 } } \\mathcal { L } = \\mathbf { 0 }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1896.0, + 672.0, + 1896.0, + 672.0, + 1937.0, + 296.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 435.0, + 873.0, + 435.0, + 873.0, + 480.0, + 291.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 435.0, + 914.0, + 435.0, + 914.0, + 480.0, + 899.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 435.0, + 1406.0, + 435.0, + 1406.0, + 480.0, + 1037.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 471.0, + 527.0, + 471.0, + 527.0, + 514.0, + 289.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 471.0, + 1026.0, + 471.0, + 1026.0, + 514.0, + 938.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 471.0, + 1249.0, + 471.0, + 1249.0, + 514.0, + 1194.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 471.0, + 1407.0, + 471.0, + 1407.0, + 514.0, + 1394.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 505.0, + 429.0, + 505.0, + 429.0, + 562.0, + 290.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 505.0, + 727.0, + 505.0, + 727.0, + 562.0, + 553.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 505.0, + 825.0, + 505.0, + 825.0, + 562.0, + 811.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 505.0, + 871.0, + 505.0, + 871.0, + 562.0, + 862.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 505.0, + 1276.0, + 505.0, + 1276.0, + 562.0, + 900.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1400.0, + 505.0, + 1407.0, + 505.0, + 1407.0, + 562.0, + 1400.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 552.0, + 398.0, + 552.0, + 398.0, + 590.0, + 293.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 552.0, + 724.0, + 552.0, + 724.0, + 590.0, + 515.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 808.0, + 552.0, + 823.0, + 552.0, + 823.0, + 590.0, + 808.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 552.0, + 869.0, + 552.0, + 869.0, + 590.0, + 859.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 552.0, + 1028.0, + 552.0, + 1028.0, + 590.0, + 898.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 552.0, + 1406.0, + 552.0, + 1406.0, + 590.0, + 1174.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 580.0, + 454.0, + 580.0, + 454.0, + 625.0, + 291.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 580.0, + 594.0, + 580.0, + 594.0, + 625.0, + 552.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 580.0, + 742.0, + 580.0, + 742.0, + 625.0, + 734.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 580.0, + 872.0, + 580.0, + 872.0, + 625.0, + 823.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 580.0, + 1408.0, + 580.0, + 1408.0, + 625.0, + 1167.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 613.0, + 644.0, + 613.0, + 644.0, + 658.0, + 291.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 613.0, + 839.0, + 613.0, + 839.0, + 658.0, + 783.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 613.0, + 1005.0, + 613.0, + 1005.0, + 658.0, + 994.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 613.0, + 1408.0, + 613.0, + 1408.0, + 658.0, + 1141.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 650.0, + 692.0, + 650.0, + 692.0, + 696.0, + 290.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 650.0, + 994.0, + 650.0, + 994.0, + 696.0, + 918.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 650.0, + 1408.0, + 650.0, + 1408.0, + 696.0, + 1295.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 687.0, + 459.0, + 687.0, + 459.0, + 737.0, + 291.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 959.0, + 687.0, + 1045.0, + 687.0, + 1045.0, + 737.0, + 959.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1087.0, + 687.0, + 1409.0, + 687.0, + 1409.0, + 737.0, + 1087.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 729.0, + 327.0, + 729.0, + 327.0, + 774.0, + 290.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 729.0, + 854.0, + 729.0, + 854.0, + 774.0, + 383.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 729.0, + 1118.0, + 729.0, + 1118.0, + 774.0, + 1004.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1319.0, + 729.0, + 1408.0, + 729.0, + 1408.0, + 774.0, + 1319.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 763.0, + 295.0, + 763.0, + 295.0, + 811.0, + 290.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 763.0, + 881.0, + 763.0, + 881.0, + 811.0, + 567.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 763.0, + 1235.0, + 763.0, + 1235.0, + 811.0, + 1023.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 763.0, + 1407.0, + 763.0, + 1407.0, + 811.0, + 1395.0, + 811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 802.0, + 473.0, + 802.0, + 473.0, + 847.0, + 293.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 802.0, + 1114.0, + 802.0, + 1114.0, + 847.0, + 678.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 802.0, + 1166.0, + 802.0, + 1166.0, + 847.0, + 1154.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 604.0, + 227.0, + 604.0, + 263.0, + 293.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 227.0, + 1145.0, + 227.0, + 1145.0, + 263.0, + 644.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 227.0, + 1375.0, + 227.0, + 1375.0, + 263.0, + 1294.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 263.0, + 1402.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 257.0, + 837.0, + 257.0, + 837.0, + 299.0, + 291.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 257.0, + 1255.0, + 257.0, + 1255.0, + 299.0, + 1055.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 257.0, + 1406.0, + 257.0, + 1406.0, + 299.0, + 1395.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 292.0, + 785.0, + 292.0, + 785.0, + 326.0, + 295.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 815.0, + 292.0, + 1200.0, + 292.0, + 1200.0, + 326.0, + 815.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 292.0, + 1406.0, + 292.0, + 1406.0, + 326.0, + 1226.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 316.0, + 349.0, + 316.0, + 349.0, + 364.0, + 290.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 316.0, + 1114.0, + 316.0, + 1114.0, + 364.0, + 675.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 856.0, + 1101.0, + 856.0, + 1101.0, + 895.0, + 292.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 856.0, + 1239.0, + 856.0, + 1239.0, + 895.0, + 1231.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 889.0, + 564.0, + 889.0, + 564.0, + 926.0, + 293.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 889.0, + 1120.0, + 889.0, + 1120.0, + 926.0, + 653.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 889.0, + 1405.0, + 889.0, + 1405.0, + 926.0, + 1255.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 918.0, + 485.0, + 918.0, + 485.0, + 957.0, + 291.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 918.0, + 708.0, + 918.0, + 708.0, + 957.0, + 526.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1329.0, + 918.0, + 1406.0, + 918.0, + 1406.0, + 957.0, + 1329.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 951.0, + 714.0, + 951.0, + 714.0, + 987.0, + 292.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 951.0, + 1012.0, + 951.0, + 1012.0, + 987.0, + 754.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1315.0, + 597.0, + 1315.0, + 597.0, + 1356.0, + 293.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1315.0, + 1249.0, + 1315.0, + 1249.0, + 1356.0, + 784.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 1315.0, + 1404.0, + 1315.0, + 1404.0, + 1356.0, + 1278.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1350.0, + 945.0, + 1350.0, + 945.0, + 1384.0, + 293.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 1350.0, + 1104.0, + 1350.0, + 1104.0, + 1384.0, + 972.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1308.0, + 1350.0, + 1405.0, + 1350.0, + 1405.0, + 1384.0, + 1308.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1383.0, + 645.0, + 1383.0, + 645.0, + 1414.0, + 297.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1965.0, + 616.0, + 1965.0, + 616.0, + 2011.0, + 293.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 1965.0, + 1405.0, + 1965.0, + 1405.0, + 2011.0, + 1331.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1999.0, + 409.0, + 1999.0, + 409.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 1999.0, + 1405.0, + 1999.0, + 1405.0, + 2039.0, + 518.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1775.0, + 486.0, + 1775.0, + 486.0, + 1824.0, + 291.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1775.0, + 926.0, + 1775.0, + 926.0, + 1824.0, + 865.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1775.0, + 1407.0, + 1775.0, + 1407.0, + 1824.0, + 1199.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1809.0, + 413.0, + 1809.0, + 413.0, + 1849.0, + 293.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1659.0, + 546.0, + 1659.0, + 546.0, + 1695.0, + 296.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1538.0, + 474.0, + 1538.0, + 474.0, + 1578.0, + 296.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1538.0, + 910.0, + 1538.0, + 910.0, + 1578.0, + 604.0, + 1578.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 295, + 962, + 1406, + 962, + 1406, + 1259, + 295, + 1259 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1716, + 1403, + 1716, + 1403, + 1841, + 297, + 1841 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 295, + 1270, + 1404, + 1270, + 1404, + 1399, + 295, + 1399 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 303, + 481, + 1398, + 481, + 1398, + 581, + 303, + 581 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 1506, + 1405, + 1506, + 1405, + 1606, + 297, + 1606 + ], + "score": 0.976 + }, + { + "category_id": 8, + "poly": [ + 484, + 268, + 1215, + 268, + 1215, + 473, + 484, + 473 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 638, + 588, + 1062, + 588, + 1062, + 779, + 638, + 779 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 608, + 1614, + 1088, + 1614, + 1088, + 1707, + 608, + 1707 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 525, + 1974, + 1172, + 1974, + 1172, + 2031, + 525, + 2031 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 297, + 788, + 1401, + 788, + 1401, + 857, + 297, + 857 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 536, + 1851, + 1160, + 1851, + 1160, + 1892, + 536, + 1892 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 300, + 1900, + 1400, + 1900, + 1400, + 1963, + 300, + 1963 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 298, + 230, + 575, + 230, + 575, + 261, + 298, + 261 + ], + "score": 0.929 + }, + { + "category_id": 0, + "poly": [ + 298, + 1439, + 672, + 1439, + 672, + 1476, + 298, + 1476 + ], + "score": 0.908 + }, + { + "category_id": 0, + "poly": [ + 299, + 898, + 673, + 898, + 673, + 934, + 299, + 934 + ], + "score": 0.903 + }, + { + "category_id": 9, + "poly": [ + 1351, + 435, + 1401, + 435, + 1401, + 467, + 1351, + 467 + ], + "score": 0.899 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1643, + 1400, + 1643, + 1400, + 1674, + 1352, + 1674 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.873 + }, + { + "category_id": 14, + "poly": [ + 609, + 1612, + 1090, + 1612, + 1090, + 1706, + 609, + 1706 + ], + "score": 0.95, + "latex": "\\pmb { S } ^ { \\top } : = \\operatorname { d i a g } \\left( \\begin{array} { l } { \\left[ \\pmb { V } _ { 1 } ^ { \\top } \\right] , \\cdots , \\left[ \\pmb { V } _ { r } ^ { \\top } \\right] , } \\\\ { \\left[ \\pmb { O } _ { 1 } ^ { \\top } \\right] } \\end{array} \\left[ \\begin{array} { l } { \\pmb { \\overline { { V } } } ^ { \\top } } \\\\ { \\pmb { \\overline { { O } } } _ { r } ^ { \\top } } \\end{array} \\right] , \\right) ," + }, + { + "category_id": 13, + "poly": [ + 517, + 790, + 862, + 790, + 862, + 828, + 517, + 828 + ], + "score": 0.93, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( V C ) } = \\mathcal { P } _ { \\mathrm { c o l } ( V ) } = V V ^ { \\top }" + }, + { + "category_id": 14, + "poly": [ + 635, + 587, + 1065, + 587, + 1065, + 782, + 635, + 782 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( V C ) } \\mathbf { \\Lambda } \\big ) } \\\\ & { \\quad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( V ^ { \\top } \\mathbf { \\Lambda } \\mathbf { \\Lambda } V \\big ) } \\\\ & { \\quad \\overset { ( i i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\displaystyle \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 484, + 267, + 1214, + 267, + 1214, + 472, + 484, + 472 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { A } _ { 2 } \\pmb { A } _ { 1 } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { 1 } ^ { \\top } \\pmb { A } _ { 2 } ^ { \\top } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } ) + \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\big ) } \\\\ & { \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { A } _ { 2 } ) } \\pmb { \\Sigma } ) } \\\\ & { \\overset { ( i i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { U } ^ { \\top } \\pmb { A } _ { 2 } ) } \\pmb { \\Lambda } \\big ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 1366, + 429, + 1366, + 429, + 1400, + 297, + 1400 + ], + "score": 0.92, + "latex": "\\operatorname* { m i n } \\{ d _ { y } , d \\}" + }, + { + "category_id": 13, + "poly": [ + 627, + 966, + 734, + 966, + 734, + 1000, + 627, + 1000 + ], + "score": 0.92, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1243, + 1059, + 1350, + 1059, + 1350, + 1092, + 1243, + 1092 + ], + "score": 0.92, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 379, + 1273, + 487, + 1273, + 487, + 1307, + 379, + 1307 + ], + "score": 0.92, + "latex": "\\left( A _ { 2 } , A _ { 1 } \\right)" + }, + { + "category_id": 13, + "poly": [ + 653, + 1540, + 1005, + 1540, + 1005, + 1577, + 653, + 1577 + ], + "score": 0.92, + "latex": "V = [ \\mathrm { d i a g } ( V _ { 1 } , \\ldots , V _ { r } , \\overline { { V } } ) , { \\bf 0 } ]" + }, + { + "category_id": 13, + "poly": [ + 368, + 1900, + 475, + 1900, + 475, + 1933, + 368, + 1933 + ], + "score": 0.92, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1057, + 1508, + 1164, + 1508, + 1164, + 1542, + 1057, + 1542 + ], + "score": 0.92, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 14, + "poly": [ + 526, + 1973, + 1170, + 1973, + 1170, + 2030, + 526, + 2030 + ], + "score": 0.92, + "latex": "\\widetilde { M } = \\left[ \\mathbf { u } _ { 1 1 } ^ { s } , \\ldots , \\mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \\ldots , \\frac { \\mathbf { u } _ { j 1 } ^ { s } + \\epsilon \\mathbf { u } _ { i ( p _ { i } + 1 ) } ^ { s } } { \\sqrt { 1 + \\epsilon ^ { 2 } } } , \\ldots \\bar { \\mathbf { u } } _ { 1 } ^ { s } , \\ldots , \\bar { \\mathbf { u } } _ { \\bar { p } } ^ { s } \\right] ," + }, + { + "category_id": 13, + "poly": [ + 403, + 516, + 737, + 516, + 737, + 555, + 403, + 555 + ], + "score": 0.92, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) _ { \\perp } } = U \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } A _ { 2 } ) } U ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 793, + 1272, + 1072, + 1272, + 1072, + 1308, + 793, + 1308 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { y } , d \\} > \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 413, + 1808, + 618, + 1808, + 618, + 1841, + 413, + 1841 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\pmb { A } _ { 2 } = \\pmb { U } \\pmb { S } \\pmb { S } ^ { \\top } \\pmb { V } \\pmb { C } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 709, + 481, + 1201, + 481, + 1201, + 519, + 709, + 519 + ], + "score": 0.91, + "latex": "\\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\big ) = \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { 2 } ) } \\Sigma \\big )" + }, + { + "category_id": 13, + "poly": [ + 522, + 1715, + 698, + 1715, + 698, + 1750, + 522, + 1750 + ], + "score": 0.91, + "latex": "O _ { 1 } , \\cdots , O _ { r } , \\overline { { { O } } }" + }, + { + "category_id": 13, + "poly": [ + 1105, + 1333, + 1405, + 1333, + 1405, + 1370, + 1105, + 1370 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\operatorname { r a n k } ( A _ { 2 } ) = \\sum _ { i = 1 } ^ { r } m _ { i } < } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 344, + 1934, + 423, + 1934, + 423, + 1966, + 344, + 1966 + ], + "score": 0.91, + "latex": "p _ { j } > 0" + }, + { + "category_id": 13, + "poly": [ + 1061, + 1541, + 1282, + 1541, + 1282, + 1576, + 1061, + 1576 + ], + "score": 0.91, + "latex": "V _ { i } , i = 1 , \\dots , r , \\overline { { V } }" + }, + { + "category_id": 13, + "poly": [ + 664, + 1367, + 801, + 1367, + 801, + 1397, + 664, + 1397 + ], + "score": 0.91, + "latex": "i = 1 , \\dots , r" + }, + { + "category_id": 13, + "poly": [ + 461, + 1125, + 750, + 1125, + 750, + 1162, + 461, + 1162 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { 2 } , d _ { 1 } \\} \\le \\sum _ { i = 1 } ^ { r } m _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 782, + 1090, + 1264, + 1090, + 1264, + 1129, + 782, + 1129 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\dot { \\mathcal { L } } ( \\bar { \\boldsymbol { A } } _ { 1 } , \\boldsymbol { A } _ { 2 } ) = \\frac { 1 } { 2 } \\mathrm { T r } ( \\boldsymbol { Y } \\boldsymbol { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\sum _ { i = 1 } ^ { r } p _ { i } \\sigma _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 727, + 1306, + 869, + 1306, + 869, + 1336, + 727, + 1336 + ], + "score": 0.91, + "latex": "i = 1 , \\ldots , r" + }, + { + "category_id": 13, + "poly": [ + 1026, + 1902, + 1192, + 1902, + 1192, + 1932, + 1026, + 1932 + ], + "score": 0.91, + "latex": "1 \\leq i < j \\leq r" + }, + { + "category_id": 13, + "poly": [ + 355, + 1164, + 650, + 1164, + 650, + 1198, + 355, + 1198 + ], + "score": 0.91, + "latex": "\\mathrm { r a n k } ( A _ { 2 } ) = \\mathrm { m i n } \\{ d _ { 2 } , d _ { 1 } \\}" + }, + { + "category_id": 13, + "poly": [ + 1073, + 1029, + 1286, + 1029, + 1286, + 1059, + 1073, + 1059 + ], + "score": 0.91, + "latex": "p _ { i } , i \\ = \\ 1 , . . . , r , \\bar { p }" + }, + { + "category_id": 13, + "poly": [ + 806, + 549, + 957, + 549, + 957, + 579, + 806, + 579 + ], + "score": 0.91, + "latex": "\\mathbf { \\delta } _ { A _ { 2 } } = U V C" + }, + { + "category_id": 13, + "poly": [ + 851, + 1367, + 919, + 1367, + 919, + 1397, + 851, + 1397 + ], + "score": 0.91, + "latex": "\\bar { p } = 0" + }, + { + "category_id": 13, + "poly": [ + 1301, + 967, + 1393, + 967, + 1393, + 998, + 1301, + 998 + ], + "score": 0.9, + "latex": "\\mathbf { L } _ { 1 } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1090, + 519, + 1197, + 519, + 1197, + 551, + 1090, + 551 + ], + "score": 0.9, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 411, + 1542, + 571, + 1542, + 571, + 1574, + 411, + 1574 + ], + "score": 0.9, + "latex": "A _ { \\mathrm { 2 } } = U V C" + }, + { + "category_id": 13, + "poly": [ + 758, + 1057, + 1065, + 1057, + 1065, + 1092, + 758, + 1092 + ], + "score": 0.9, + "latex": "\\textstyle \\sum _ { i = 1 } ^ { r } p _ { i } + { \\bar { p } } = \\operatorname { r a n k } ( A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 488, + 1369, + 585, + 1369, + 585, + 1397, + 488, + 1397 + ], + "score": 0.9, + "latex": "p _ { i } = m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 296, + 1060, + 404, + 1060, + 404, + 1091, + 296, + 1091 + ], + "score": 0.9, + "latex": "p _ { i } \\ \\leq \\ m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 449, + 1199, + 521, + 1199, + 521, + 1227, + 449, + 1227 + ], + "score": 0.89, + "latex": "k \\leq r" + }, + { + "category_id": 13, + "poly": [ + 1307, + 1748, + 1398, + 1748, + 1398, + 1777, + 1307, + 1777 + ], + "score": 0.89, + "latex": "{ \\cal { I } } ^ { m _ { k } \\times p _ { k } }" + }, + { + "category_id": 13, + "poly": [ + 681, + 1747, + 1217, + 1747, + 1217, + 1782, + 681, + 1782 + ], + "score": 0.89, + "latex": "\\bar { \\pmb { S } } ^ { \\top } \\pmb { V } = [ \\mathrm { d i a g } ( \\pmb { I } ^ { m _ { 1 } \\times p _ { 1 } } , \\allowbreak \\bar { \\lambda } . . . , \\pmb { I } ^ { m _ { r } \\times p _ { r } } , \\pmb { I } ^ { \\bar { m } \\times \\bar { p } } ) , \\mathbf { 0 } ]" + }, + { + "category_id": 14, + "poly": [ + 540, + 1851, + 1158, + 1851, + 1158, + 1892, + 540, + 1892 + ], + "score": 0.89, + "latex": "U S = [ \\mathbf { u } _ { 1 1 } ^ { s } , \\ldots , \\mathbf { u } _ { 1 p _ { 1 } } ^ { s } , \\ldots , \\mathbf { u } _ { r 1 } ^ { s } , \\ldots , \\mathbf { u } _ { r p _ { r } } ^ { s } , \\bar { \\mathbf { u } } _ { 1 } ^ { s } , \\ldots , \\bar { \\mathbf { u } } _ { \\bar { p } } ^ { s } ] ." + }, + { + "category_id": 13, + "poly": [ + 545, + 1309, + 646, + 1309, + 646, + 1336, + 545, + 1336 + ], + "score": 0.89, + "latex": "p _ { i } = m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1302, + 1904, + 1400, + 1904, + 1400, + 1932, + 1302, + 1932 + ], + "score": 0.89, + "latex": "p _ { i } < m _ { i }" + }, + { + "category_id": 13, + "poly": [ + 921, + 1308, + 993, + 1308, + 993, + 1337, + 921, + 1337 + ], + "score": 0.88, + "latex": "\\bar { p } \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 1092, + 1934, + 1156, + 1934, + 1156, + 1959, + 1092, + 1959 + ], + "score": 0.88, + "latex": "\\epsilon > 0" + }, + { + "category_id": 13, + "poly": [ + 356, + 1335, + 395, + 1335, + 395, + 1365, + 356, + 1365 + ], + "score": 0.88, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 946, + 1781, + 1046, + 1781, + 1046, + 1807, + 946, + 1807 + ], + "score": 0.87, + "latex": "I ^ { m _ { k } \\times m _ { k } }" + }, + { + "category_id": 13, + "poly": [ + 1362, + 1127, + 1401, + 1127, + 1401, + 1158, + 1362, + 1158 + ], + "score": 0.86, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 948, + 1811, + 996, + 1811, + 996, + 1837, + 948, + 1837 + ], + "score": 0.85, + "latex": "{ \\pmb U } { \\pmb S }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1201, + 338, + 1201, + 338, + 1227, + 297, + 1227 + ], + "score": 0.85, + "latex": "m _ { k }" + }, + { + "category_id": 13, + "poly": [ + 936, + 1936, + 983, + 1936, + 983, + 1958, + 936, + 1958 + ], + "score": 0.85, + "latex": "{ \\boldsymbol { U } } { \\boldsymbol { S } }" + }, + { + "category_id": 13, + "poly": [ + 1136, + 1782, + 1174, + 1782, + 1174, + 1810, + 1136, + 1810 + ], + "score": 0.84, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 561, + 1784, + 592, + 1784, + 592, + 1810, + 561, + 1810 + ], + "score": 0.84, + "latex": "p _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1282, + 794, + 1310, + 794, + 1310, + 820, + 1282, + 820 + ], + "score": 0.83, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 701, + 1159, + 1404, + 1159, + 1404, + 1201, + 701, + 1201 + ], + "score": 0.8, + "latex": "\\begin{array} { r } { p _ { 1 } = m _ { 1 } , \\dotsc , p _ { k - 1 } = m _ { k - 1 } , p _ { k } = \\operatorname { r a n k } ( A _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\leq } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1230, + 999, + 1258, + 999, + 1258, + 1025, + 1230, + 1025 + ], + "score": 0.79, + "latex": "V" + }, + { + "category_id": 13, + "poly": [ + 548, + 827, + 573, + 827, + 573, + 851, + 548, + 851 + ], + "score": 0.79, + "latex": "\\pmb { \\Lambda }" + }, + { + "category_id": 13, + "poly": [ + 453, + 1059, + 703, + 1059, + 703, + 1091, + 453, + 1091 + ], + "score": 0.68, + "latex": "i = 1 , \\ldots , r , \\bar { p } \\leq \\bar { m }" + }, + { + "category_id": 13, + "poly": [ + 613, + 1059, + 703, + 1059, + 703, + 1091, + 613, + 1091 + ], + "score": 0.6, + "latex": "\\bar { p } \\leq \\bar { m }" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1437.0, + 674.0, + 1437.0, + 674.0, + 1481.0, + 294.0, + 1481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 894.0, + 675.0, + 894.0, + 675.0, + 939.0, + 295.0, + 939.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": [ + 294.0, + 964.0, + 626.0, + 964.0, + 626.0, + 1003.0, + 294.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 964.0, + 1300.0, + 964.0, + 1300.0, + 1003.0, + 735.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 964.0, + 1406.0, + 964.0, + 1406.0, + 1003.0, + 1394.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 996.0, + 1229.0, + 996.0, + 1229.0, + 1031.0, + 294.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 996.0, + 1406.0, + 996.0, + 1406.0, + 1031.0, + 1259.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1025.0, + 1072.0, + 1025.0, + 1072.0, + 1062.0, + 293.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1287.0, + 1025.0, + 1406.0, + 1025.0, + 1406.0, + 1062.0, + 1287.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1056.0, + 295.0, + 1056.0, + 295.0, + 1098.0, + 290.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 405.0, + 1056.0, + 452.0, + 1056.0, + 452.0, + 1098.0, + 405.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 1056.0, + 757.0, + 1056.0, + 757.0, + 1098.0, + 704.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 1056.0, + 1242.0, + 1056.0, + 1242.0, + 1098.0, + 1066.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 1056.0, + 1409.0, + 1056.0, + 1409.0, + 1098.0, + 1351.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1084.0, + 781.0, + 1084.0, + 781.0, + 1134.0, + 291.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1265.0, + 1084.0, + 1409.0, + 1084.0, + 1409.0, + 1134.0, + 1265.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1122.0, + 460.0, + 1122.0, + 460.0, + 1168.0, + 290.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 1122.0, + 1361.0, + 1122.0, + 1361.0, + 1168.0, + 751.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1122.0, + 1408.0, + 1122.0, + 1408.0, + 1168.0, + 1402.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1153.0, + 354.0, + 1153.0, + 354.0, + 1211.0, + 291.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 1153.0, + 700.0, + 1153.0, + 700.0, + 1211.0, + 651.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1405.0, + 1153.0, + 1411.0, + 1153.0, + 1411.0, + 1211.0, + 1405.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 1196.0, + 448.0, + 1196.0, + 448.0, + 1231.0, + 339.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 522.0, + 1196.0, + 1406.0, + 1196.0, + 1406.0, + 1231.0, + 522.0, + 1231.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1224.0, + 471.0, + 1224.0, + 471.0, + 1260.0, + 295.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1714.0, + 521.0, + 1714.0, + 521.0, + 1754.0, + 295.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1714.0, + 1404.0, + 1714.0, + 1404.0, + 1754.0, + 699.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1742.0, + 680.0, + 1742.0, + 680.0, + 1783.0, + 290.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 1742.0, + 1306.0, + 1742.0, + 1306.0, + 1783.0, + 1218.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 1742.0, + 1406.0, + 1742.0, + 1406.0, + 1783.0, + 1399.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1775.0, + 560.0, + 1775.0, + 560.0, + 1815.0, + 291.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1775.0, + 945.0, + 1775.0, + 945.0, + 1815.0, + 593.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 1775.0, + 1135.0, + 1775.0, + 1135.0, + 1815.0, + 1047.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1175.0, + 1775.0, + 1405.0, + 1775.0, + 1405.0, + 1815.0, + 1175.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1808.0, + 412.0, + 1808.0, + 412.0, + 1841.0, + 297.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 1808.0, + 947.0, + 1808.0, + 947.0, + 1841.0, + 619.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 1808.0, + 1031.0, + 1808.0, + 1031.0, + 1841.0, + 997.0, + 1841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1256.0, + 378.0, + 1256.0, + 378.0, + 1338.0, + 283.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 1256.0, + 544.0, + 1256.0, + 544.0, + 1338.0, + 488.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 1256.0, + 726.0, + 1256.0, + 726.0, + 1338.0, + 647.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 1256.0, + 1416.0, + 1256.0, + 1416.0, + 1338.0, + 1073.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1332.0, + 355.0, + 1332.0, + 355.0, + 1373.0, + 292.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1332.0, + 1104.0, + 1332.0, + 1104.0, + 1373.0, + 396.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 430.0, + 1364.0, + 487.0, + 1364.0, + 487.0, + 1401.0, + 430.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 1364.0, + 663.0, + 1364.0, + 663.0, + 1401.0, + 586.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 1364.0, + 850.0, + 1364.0, + 850.0, + 1401.0, + 802.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 1364.0, + 931.0, + 1364.0, + 931.0, + 1401.0, + 920.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 476.0, + 708.0, + 476.0, + 708.0, + 521.0, + 294.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1202.0, + 476.0, + 1404.0, + 476.0, + 1404.0, + 521.0, + 1202.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 514.0, + 402.0, + 514.0, + 402.0, + 556.0, + 294.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 514.0, + 1089.0, + 514.0, + 1089.0, + 556.0, + 738.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 514.0, + 1404.0, + 514.0, + 1404.0, + 556.0, + 1198.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 546.0, + 805.0, + 546.0, + 805.0, + 584.0, + 297.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 546.0, + 1248.0, + 546.0, + 1248.0, + 584.0, + 958.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1506.0, + 1056.0, + 1506.0, + 1056.0, + 1545.0, + 295.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 1506.0, + 1405.0, + 1506.0, + 1405.0, + 1545.0, + 1165.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1540.0, + 410.0, + 1540.0, + 410.0, + 1577.0, + 292.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 1540.0, + 652.0, + 1540.0, + 652.0, + 1577.0, + 572.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 1540.0, + 1060.0, + 1540.0, + 1060.0, + 1577.0, + 1006.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 1540.0, + 1406.0, + 1540.0, + 1406.0, + 1577.0, + 1283.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1573.0, + 1066.0, + 1573.0, + 1066.0, + 1608.0, + 295.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 786.0, + 516.0, + 786.0, + 516.0, + 829.0, + 292.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 786.0, + 1281.0, + 786.0, + 1281.0, + 829.0, + 863.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1311.0, + 786.0, + 1407.0, + 786.0, + 1407.0, + 829.0, + 1311.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 821.0, + 547.0, + 821.0, + 547.0, + 858.0, + 295.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 821.0, + 936.0, + 821.0, + 936.0, + 858.0, + 574.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1897.0, + 367.0, + 1897.0, + 367.0, + 1937.0, + 295.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 1897.0, + 1025.0, + 1897.0, + 1025.0, + 1937.0, + 476.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 1897.0, + 1301.0, + 1897.0, + 1301.0, + 1937.0, + 1193.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1897.0, + 1404.0, + 1897.0, + 1404.0, + 1937.0, + 1401.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1930.0, + 343.0, + 1930.0, + 343.0, + 1963.0, + 295.0, + 1963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1930.0, + 935.0, + 1930.0, + 935.0, + 1963.0, + 424.0, + 1963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 984.0, + 1930.0, + 1091.0, + 1930.0, + 1091.0, + 1963.0, + 984.0, + 1963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1157.0, + 1930.0, + 1170.0, + 1930.0, + 1170.0, + 1963.0, + 1157.0, + 1963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 229.0, + 576.0, + 229.0, + 576.0, + 265.0, + 298.0, + 265.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1137, + 1406, + 1137, + 1406, + 1303, + 296, + 1303 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 295, + 982, + 1405, + 982, + 1405, + 1125, + 295, + 1125 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 300, + 619, + 1402, + 619, + 1402, + 728, + 300, + 728 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 294, + 221, + 1408, + 221, + 1408, + 379, + 294, + 379 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 513, + 397, + 1186, + 397, + 1186, + 602, + 513, + 602 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 429, + 1497, + 1268, + 1497, + 1268, + 1702, + 429, + 1702 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 610, + 750, + 1089, + 750, + 1089, + 842, + 610, + 842 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 292, + 1412, + 1399, + 1412, + 1399, + 1477, + 292, + 1477 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 435, + 1316, + 1263, + 1316, + 1263, + 1398, + 435, + 1398 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 298, + 1720, + 1403, + 1720, + 1403, + 1791, + 298, + 1791 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 516, + 914, + 1180, + 914, + 1180, + 963, + 516, + 963 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 295, + 857, + 1400, + 857, + 1400, + 894, + 295, + 894 + ], + "score": 0.927 + }, + { + "category_id": 8, + "poly": [ + 471, + 1987, + 1256, + 1987, + 1256, + 2033, + 471, + 2033 + ], + "score": 0.904 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1937, + 1401, + 1937, + 1401, + 1968, + 1351, + 1968 + ], + "score": 0.883 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1994, + 1402, + 1994, + 1402, + 2025, + 1350, + 2025 + ], + "score": 0.873 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.863 + }, + { + "category_id": 8, + "poly": [ + 447, + 1933, + 1095, + 1933, + 1095, + 1974, + 447, + 1974 + ], + "score": 0.622 + }, + { + "category_id": 8, + "poly": [ + 447, + 1806, + 1136, + 1806, + 1136, + 1974, + 447, + 1974 + ], + "score": 0.586 + }, + { + "category_id": 9, + "poly": [ + 446, + 1980, + 482, + 1980, + 482, + 2021, + 446, + 2021 + ], + "score": 0.46 + }, + { + "category_id": 8, + "poly": [ + 447, + 1857, + 1134, + 1857, + 1134, + 1927, + 447, + 1927 + ], + "score": 0.187 + }, + { + "category_id": 8, + "poly": [ + 509, + 1806, + 1034, + 1806, + 1034, + 1849, + 509, + 1849 + ], + "score": 0.182 + }, + { + "category_id": 8, + "poly": [ + 446, + 1857, + 1131, + 1857, + 1131, + 1927, + 446, + 1927 + ], + "score": 0.099 + }, + { + "category_id": 14, + "poly": [ + 510, + 395, + 1187, + 395, + 1187, + 605, + 510, + 605 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\mathcal { L } ( \\tilde { A } _ { 2 } , \\tilde { A } _ { 1 } ) = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( U ^ { \\top } \\tilde { A } _ { 2 } ) } \\Lambda ) } \\\\ & { \\quad \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\tilde { A } _ { 2 } ) } S ^ { \\top } \\Lambda S ) } \\\\ & { \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } S ^ { \\top } \\Lambda S ) } \\\\ & { \\quad \\quad \\quad \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( Y Y ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } \\Lambda ) , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 443, + 1801, + 1258, + 1801, + 1258, + 2037, + 443, + 2037 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { ( I - U V ( U V ) ^ { \\top } ) Y X ^ { \\top } L _ { 1 } ^ { \\top } C ^ { \\top } ( I - V ^ { \\top } V ) = 0 } \\\\ { \\stackrel { ( i ) } { \\Leftrightarrow } } & { \\left[ ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X \\right] Y ^ { \\top } ( I - U V ( U V ) ^ { \\top } ) = 0 } \\\\ { \\Leftrightarrow } & { ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \\top } ( I - U V ( U V ) ^ { \\top } ) = 0 } \\\\ { \\stackrel { ( i i ) } { \\Leftrightarrow } } & { ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) : d _ { 1 } , : } X Y ^ { \\top } ( I - U S _ { : , 1 : ( q - 1 ) } ( U S _ { : , 1 : ( q - 1 ) } ) ^ { \\top } ) = 0 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1019, + 333, + 1126, + 333, + 1126, + 373, + 1019, + 373 + ], + "score": 0.94, + "latex": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1232, + 297, + 1340, + 297, + 1340, + 337, + 1232, + 337 + ], + "score": 0.94, + "latex": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )" + }, + { + "category_id": 14, + "poly": [ + 609, + 748, + 1091, + 748, + 1091, + 842, + 609, + 842 + ], + "score": 0.94, + "latex": "\\left[ \\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) } \\right] _ { k } = \\left\\{ \\begin{array} { l l } { \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } , } & { \\mathrm { i f ~ } k = i } \\\\ { \\frac { 1 } { 1 + \\epsilon ^ { 2 } } , } & { \\mathrm { i f ~ } k = j } \\end{array} \\right." + }, + { + "category_id": 13, + "poly": [ + 1036, + 1019, + 1143, + 1019, + 1143, + 1059, + 1036, + 1059 + ], + "score": 0.93, + "latex": "( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 505, + 297, + 614, + 297, + 614, + 336, + 505, + 336 + ], + "score": 0.93, + "latex": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 333, + 632, + 333, + 632, + 381, + 298, + 381 + ], + "score": 0.93, + "latex": "\\widetilde { A } _ { 2 } \\widetilde { A } _ { 1 } X = \\mathcal { P } _ { \\mathrm { c o l } ( \\widetilde { A } _ { 2 } ) } Y X ^ { \\dagger } X" + }, + { + "category_id": 13, + "poly": [ + 687, + 980, + 795, + 980, + 795, + 1021, + 687, + 1021 + ], + "score": 0.93, + "latex": "( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 1053, + 1139, + 1159, + 1139, + 1159, + 1173, + 1053, + 1173 + ], + "score": 0.93, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 14, + "poly": [ + 428, + 1493, + 1270, + 1493, + 1270, + 1704, + 428, + 1704 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\widetilde { A } _ { 2 } = \\displaystyle [ U V _ { \\mathrm { d i a g } } , \\epsilon _ { 2 } U S _ { : , q } , 0 ] C , \\mathrm { ~ w h e r e ~ } q = \\sum _ { i = 1 } ^ { k - 1 } m _ { i } + p _ { k } + 1 , } \\\\ & { \\widetilde { A } _ { 1 } = C ^ { - 1 } \\bigg ( \\left[ \\begin{array} { c } { ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } Y X ^ { \\dag } } \\\\ { 0 } \\end{array} \\right] + C L _ { 1 } - \\left[ \\begin{array} { c } { ( C L _ { 1 } ) _ { \\mathrm { 1 : r a n k } ( A _ { 2 } ) , : } X X ^ { \\dag } } \\\\ { \\epsilon _ { 1 } ( U S _ { : , q } ) ^ { \\top } Y X ^ { \\dag } } \\\\ { 0 } \\end{array} \\right] \\bigg ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 582, + 1720, + 880, + 1720, + 880, + 1760, + 582, + 1760 + ], + "score": 0.92, + "latex": "\\mathcal { L } ( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } ) < \\mathcal { L } ( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 14, + "poly": [ + 433, + 1317, + 1266, + 1317, + 1266, + 1397, + 433, + 1397 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\pmb { A } _ { 1 } = C ^ { - 1 } \\Bigg ( [ { \\pmb { U } } _ { \\mathbf { \\mathscr { C } } _ { \\mathbf { i } \\mathrm { i } \\mathbf { a } _ { \\mathbf { g } } } } ] ^ { \\top } { \\pmb { Y } } { \\pmb { X } } ^ { \\dagger } ] + C \\pmb { L } _ { 1 } - [ ( C \\pmb { L } _ { 1 } ) _ { 1 : \\operatorname { r a n k } ( { \\pmb { A } } _ { 2 } ) , : } { \\pmb { X } } { \\pmb { X } } ^ { \\dagger } ] \\Bigg ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 862, + 262, + 990, + 262, + 990, + 297, + 862, + 297 + ], + "score": 0.92, + "latex": "\\smash { U \\gets \\widetilde { M } }" + }, + { + "category_id": 13, + "poly": [ + 492, + 1060, + 598, + 1060, + 598, + 1095, + 492, + 1095 + ], + "score": 0.92, + "latex": "( A _ { 2 } , A _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 926, + 223, + 1137, + 223, + 1137, + 261, + 926, + 261 + ], + "score": 0.91, + "latex": "{ \\widetilde A } _ { \\mathrm { 2 } } ~ = ~ { \\widetilde M } S ^ { \\intercal } V C" + }, + { + "category_id": 13, + "poly": [ + 752, + 621, + 889, + 621, + 889, + 653, + 752, + 653 + ], + "score": 0.91, + "latex": "{ \\cal S } ^ { \\top } \\pmb { { \\Lambda } } { \\cal S } = \\pmb { { \\Lambda } }" + }, + { + "category_id": 13, + "poly": [ + 927, + 1729, + 1055, + 1729, + 1055, + 1758, + 927, + 1758 + ], + "score": 0.91, + "latex": "\\epsilon _ { 1 } , \\epsilon _ { 2 } 0" + }, + { + "category_id": 13, + "poly": [ + 786, + 1202, + 866, + 1202, + 866, + 1231, + 786, + 1231 + ], + "score": 0.91, + "latex": "k \\leq r" + }, + { + "category_id": 13, + "poly": [ + 1128, + 864, + 1219, + 864, + 1219, + 894, + 1128, + 894 + ], + "score": 0.91, + "latex": "\\sigma _ { i } > \\sigma _ { j }" + }, + { + "category_id": 13, + "poly": [ + 961, + 693, + 1154, + 693, + 1154, + 732, + 961, + 732 + ], + "score": 0.91, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( S ^ { \\top } U ^ { \\top } \\widetilde { M } S ^ { \\top } V ) }" + }, + { + "category_id": 13, + "poly": [ + 868, + 1445, + 982, + 1445, + 982, + 1476, + 868, + 1476 + ], + "score": 0.9, + "latex": "\\epsilon _ { 1 } , \\epsilon _ { 2 } > 0" + }, + { + "category_id": 14, + "poly": [ + 516, + 911, + 1181, + 911, + 1181, + 961, + 516, + 961 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathcal { L } ( \\widetilde { A } _ { 2 } , \\widetilde { A } _ { 1 } ) = \\mathcal { L } ( A _ { 2 } , A _ { 1 } ) - \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } ( \\sigma _ { i } - \\sigma _ { j } ) < \\mathcal { L } ( A _ { 2 } , A _ { 1 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1051, + 264, + 1199, + 264, + 1199, + 297, + 1051, + 297 + ], + "score": 0.9, + "latex": "V S ^ { \\top } V" + }, + { + "category_id": 13, + "poly": [ + 463, + 261, + 503, + 261, + 503, + 298, + 463, + 298 + ], + "score": 0.9, + "latex": "\\widetilde { A } _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 805, + 1056, + 1072, + 1056, + 1072, + 1095, + 805, + 1095 + ], + "score": 0.9, + "latex": "\\mathrm { r a n k } ( \\widetilde { A } _ { 2 } ) = \\mathrm { r a n k } ( A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 858, + 866, + 925, + 866, + 925, + 894, + 858, + 894 + ], + "score": 0.89, + "latex": "\\sigma _ { i } , \\sigma _ { j }" + }, + { + "category_id": 13, + "poly": [ + 444, + 862, + 482, + 862, + 482, + 891, + 444, + 891 + ], + "score": 0.89, + "latex": "i , j" + }, + { + "category_id": 13, + "poly": [ + 1100, + 1237, + 1267, + 1237, + 1267, + 1268, + 1100, + 1268 + ], + "score": 0.89, + "latex": "\\mathbf { \\nabla } A _ { 2 } \\ = \\ U V C" + }, + { + "category_id": 13, + "poly": [ + 983, + 1204, + 1399, + 1204, + 1399, + 1234, + 983, + 1234 + ], + "score": 0.89, + "latex": "p _ { 1 } = m _ { 1 } , \\ldots , p _ { k - 1 } = m _ { k - 1 } , p _ { k } =" + }, + { + "category_id": 13, + "poly": [ + 760, + 1171, + 798, + 1171, + 798, + 1200, + 760, + 1200 + ], + "score": 0.89, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1232, + 656, + 1290, + 656, + 1290, + 688, + 1232, + 688 + ], + "score": 0.89, + "latex": "S ^ { \\top } V" + }, + { + "category_id": 13, + "poly": [ + 1240, + 989, + 1305, + 989, + 1305, + 1017, + 1240, + 1017 + ], + "score": 0.89, + "latex": "\\epsilon > 0" + }, + { + "category_id": 13, + "poly": [ + 931, + 1237, + 971, + 1237, + 971, + 1268, + 931, + 1268 + ], + "score": 0.88, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 588, + 1018, + 626, + 1018, + 626, + 1053, + 588, + 1053 + ], + "score": 0.88, + "latex": "\\widetilde { M }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1231, + 651, + 1231, + 651, + 1270, + 297, + 1270 + ], + "score": 0.88, + "latex": "\\mathrm { r a n k } ( A _ { 2 } ) - \\textstyle \\sum _ { i = 1 } ^ { k - 1 } m _ { i } \\ \\leq \\ m _ { k }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1026, + 380, + 1026, + 380, + 1055, + 297, + 1055 + ], + "score": 0.87, + "latex": "\\epsilon 0" + }, + { + "category_id": 13, + "poly": [ + 1260, + 1140, + 1299, + 1140, + 1299, + 1170, + 1260, + 1170 + ], + "score": 0.87, + "latex": "A _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1014, + 653, + 1050, + 653, + 1050, + 687, + 1014, + 687 + ], + "score": 0.87, + "latex": "\\widetilde { M }" + }, + { + "category_id": 13, + "poly": [ + 647, + 692, + 684, + 692, + 684, + 723, + 647, + 723 + ], + "score": 0.86, + "latex": "i , j" + }, + { + "category_id": 13, + "poly": [ + 1335, + 1237, + 1403, + 1237, + 1403, + 1268, + 1335, + 1268 + ], + "score": 0.85, + "latex": "V =" + }, + { + "category_id": 13, + "poly": [ + 298, + 1270, + 691, + 1270, + 691, + 1302, + 298, + 1302 + ], + "score": 0.84, + "latex": "[ \\mathrm { d i a g } ( V _ { 1 } , \\dots , V _ { k } ) , \\mathbf { 0 } ] : = [ V _ { \\mathrm { d i a g } } , \\mathbf { 0 } ]" + }, + { + "category_id": 13, + "poly": [ + 860, + 1025, + 909, + 1025, + 909, + 1054, + 860, + 1054 + ], + "score": 0.82, + "latex": "_ { U S }" + }, + { + "category_id": 13, + "poly": [ + 1156, + 1415, + 1180, + 1415, + 1180, + 1441, + 1156, + 1441 + ], + "score": 0.82, + "latex": "_ { s }" + }, + { + "category_id": 13, + "poly": [ + 298, + 660, + 321, + 660, + 321, + 688, + 298, + 688 + ], + "score": 0.78, + "latex": "\\pmb { S }" + }, + { + "category_id": 13, + "poly": [ + 662, + 661, + 686, + 661, + 686, + 687, + 662, + 687 + ], + "score": 0.74, + "latex": "\\pmb { \\Lambda }" + }, + { + "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, + 1139.0, + 1052.0, + 1139.0, + 1052.0, + 1172.0, + 294.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 1139.0, + 1259.0, + 1139.0, + 1259.0, + 1172.0, + 1160.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1139.0, + 1403.0, + 1139.0, + 1403.0, + 1172.0, + 1300.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1170.0, + 759.0, + 1170.0, + 759.0, + 1203.0, + 294.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 1170.0, + 1406.0, + 1170.0, + 1406.0, + 1203.0, + 799.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 278.0, + 1199.0, + 296.0, + 1199.0, + 296.0, + 1304.0, + 278.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 1199.0, + 785.0, + 1199.0, + 785.0, + 1304.0, + 692.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 1199.0, + 930.0, + 1199.0, + 930.0, + 1304.0, + 867.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 1199.0, + 982.0, + 1199.0, + 982.0, + 1304.0, + 972.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1404.0, + 1199.0, + 1421.0, + 1199.0, + 1421.0, + 1304.0, + 1404.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 980.0, + 686.0, + 980.0, + 686.0, + 1027.0, + 292.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 980.0, + 1239.0, + 980.0, + 1239.0, + 1027.0, + 796.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 980.0, + 1407.0, + 980.0, + 1407.0, + 1027.0, + 1306.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1022.0, + 296.0, + 1022.0, + 296.0, + 1062.0, + 292.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1022.0, + 587.0, + 1022.0, + 587.0, + 1062.0, + 381.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1022.0, + 859.0, + 1022.0, + 859.0, + 1062.0, + 627.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 1022.0, + 1035.0, + 1022.0, + 1035.0, + 1062.0, + 910.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 1022.0, + 1405.0, + 1022.0, + 1405.0, + 1062.0, + 1144.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1059.0, + 491.0, + 1059.0, + 491.0, + 1097.0, + 293.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1059.0, + 804.0, + 1059.0, + 804.0, + 1097.0, + 599.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 1059.0, + 1406.0, + 1059.0, + 1406.0, + 1097.0, + 1073.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1091.0, + 382.0, + 1091.0, + 382.0, + 1126.0, + 293.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 619.0, + 751.0, + 619.0, + 751.0, + 659.0, + 295.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 619.0, + 1407.0, + 619.0, + 1407.0, + 659.0, + 890.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 655.0, + 661.0, + 655.0, + 661.0, + 694.0, + 322.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 655.0, + 1013.0, + 655.0, + 1013.0, + 694.0, + 687.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 655.0, + 1231.0, + 655.0, + 1231.0, + 694.0, + 1051.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 655.0, + 1404.0, + 655.0, + 1404.0, + 694.0, + 1291.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 687.0, + 646.0, + 687.0, + 646.0, + 736.0, + 291.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 687.0, + 960.0, + 687.0, + 960.0, + 736.0, + 685.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 687.0, + 1376.0, + 687.0, + 1376.0, + 736.0, + 1155.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 223.0, + 925.0, + 223.0, + 925.0, + 266.0, + 293.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 223.0, + 1405.0, + 223.0, + 1405.0, + 266.0, + 1138.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 262.0, + 462.0, + 262.0, + 462.0, + 303.0, + 292.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 262.0, + 861.0, + 262.0, + 861.0, + 303.0, + 504.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 262.0, + 1050.0, + 262.0, + 1050.0, + 303.0, + 991.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 262.0, + 1406.0, + 262.0, + 1406.0, + 303.0, + 1200.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 301.0, + 504.0, + 301.0, + 504.0, + 339.0, + 296.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 301.0, + 1231.0, + 301.0, + 1231.0, + 339.0, + 615.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 301.0, + 1405.0, + 301.0, + 1405.0, + 339.0, + 1341.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 328.0, + 297.0, + 328.0, + 297.0, + 386.0, + 292.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 328.0, + 1018.0, + 328.0, + 1018.0, + 386.0, + 633.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 328.0, + 1354.0, + 328.0, + 1354.0, + 386.0, + 1127.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1412.0, + 1155.0, + 1412.0, + 1155.0, + 1448.0, + 296.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 1412.0, + 1402.0, + 1412.0, + 1402.0, + 1448.0, + 1181.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1442.0, + 867.0, + 1442.0, + 867.0, + 1478.0, + 295.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1442.0, + 988.0, + 1442.0, + 988.0, + 1478.0, + 983.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1719.0, + 581.0, + 1719.0, + 581.0, + 1764.0, + 293.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 1719.0, + 926.0, + 1719.0, + 926.0, + 1764.0, + 881.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1719.0, + 1407.0, + 1719.0, + 1407.0, + 1764.0, + 1056.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1753.0, + 1270.0, + 1753.0, + 1270.0, + 1790.0, + 294.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 856.0, + 443.0, + 856.0, + 443.0, + 895.0, + 296.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 856.0, + 857.0, + 856.0, + 857.0, + 895.0, + 483.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 856.0, + 1127.0, + 856.0, + 1127.0, + 895.0, + 926.0, + 895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 856.0, + 1402.0, + 856.0, + 1402.0, + 895.0, + 1220.0, + 895.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 227, + 1405, + 227, + 1405, + 332, + 298, + 332 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 361, + 346, + 1339, + 346, + 1339, + 567, + 361, + 567 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 336, + 1561, + 1370, + 1561, + 1370, + 1903, + 336, + 1903 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 356, + 618, + 1342, + 618, + 1342, + 911, + 356, + 911 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 427, + 991, + 1266, + 991, + 1266, + 1332, + 427, + 1332 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 291, + 1910, + 1402, + 1910, + 1402, + 1974, + 291, + 1974 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 296, + 919, + 1403, + 919, + 1403, + 984, + 296, + 984 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 297, + 1343, + 1403, + 1343, + 1403, + 1410, + 297, + 1410 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 484, + 1986, + 1215, + 1986, + 1215, + 2031, + 484, + 2031 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 368, + 1419, + 1333, + 1419, + 1333, + 1510, + 368, + 1510 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 295, + 1518, + 1151, + 1518, + 1151, + 1551, + 295, + 1551 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 296, + 575, + 1366, + 575, + 1366, + 610, + 296, + 610 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 866, + 2087, + 866, + 2113, + 836, + 2113 + ], + "score": 0.842 + }, + { + "category_id": 14, + "poly": [ + 426, + 988, + 1269, + 988, + 1269, + 1335, + 426, + 1335 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } { 2 \\mathrm { T r } ( P Q ^ { \\top } ) = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } & { } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { \\cdot , q } ( U S _ { \\cdot , q } ) ^ { \\top } \\Sigma U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { \\cdot , q } S _ { \\cdot , q } ^ { \\top } \\Lambda S S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\stackrel { ( i ) } { = } 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } \\sigma _ { k } U S _ { \\cdot , q } \\mathrm { e } _ { 2 } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & { \\phantom { = } \\frac { ( i i i ) } { = } 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } ) } \\\\ & \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { \\cdot , q } \\mathrm { e } _ { 2 } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } ( U V _ \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 333, + 1562, + 1369, + 1562, + 1369, + 1904, + 333, + 1904 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] } \\\\ & { \\qquad = \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) } \\\\ & { \\qquad + \\left( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } ) \\mathrm { T r } ( S _ { \\cdot , q } ^ { \\top } \\Lambda S _ { \\cdot , q } ) \\right. } \\\\ & { \\qquad + \\left. 2 \\epsilon _ { 2 } \\mathrm { T r } ( U S _ { \\cdot , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X Y ^ { \\top } [ U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } - I ] ) \\right. } \\\\ & { \\qquad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) } \\\\ & { \\qquad + \\left( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } \\right) \\mathrm { T r } ( S _ { \\cdot , q } ^ { \\top } \\Lambda S _ { \\cdot , q } ) } \\\\ & { \\qquad = \\frac { 1 } { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , . } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , } ^ { \\top } ) + ( \\frac { 1 } { 2 } \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } - \\epsilon _ { 1 } \\epsilon _ { 2 } ) \\sigma _ { k } , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 356, + 617, + 1350, + 617, + 1350, + 913, + 356, + 913 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\mathrm { T r } ( P P ^ { \\top } ) = \\mathrm { T r } ( \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \\top } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = } + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } + \\mathrm { T r } ( \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\overset { ( i ) } { = } \\mathrm { T r } ( \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } ^ { \\top } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } + \\mathrm { T r } ( \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } ) } \\\\ & { \\phantom { = \\ } = \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X X ^ { \\top } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , ) } ^ { \\top } + \\epsilon _ { 1 } ^ { 2 } \\epsilon _ { 2 } ^ { 2 } \\mathrm { T r } ( S _ { : , q } ^ { \\top } \\Lambda S _ { : , q } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 562, + 1344, + 750, + 1344, + 750, + 1385, + 562, + 1385 + ], + "score": 0.93, + "latex": "\\bar { S } _ { : , q } ^ { \\top } \\Lambda S = \\sigma _ { k } \\mathbf { e } _ { q } ^ { \\top } ," + }, + { + "category_id": 14, + "poly": [ + 359, + 343, + 1341, + 343, + 1341, + 569, + 359, + 569 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathcal { L } ( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } ) = \\frac { 1 } { 2 } \\| \\underbrace { U V _ { \\mathrm { d i a g } } ( U V _ { \\mathrm { d i a g } } ) ^ { \\top } Y X ^ { \\dag } X } _ { Q } } \\\\ & { \\quad \\quad \\quad + \\underbrace { \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { \\mathrm { ( r a n k ( } A _ { 2 } ) + 1 ) , : } X + \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } Y X ^ { \\dag } X } _ { P } - Y \\| _ { F } ^ { 2 } } \\\\ & { \\quad \\quad \\quad = \\mathcal { L } ( A _ { 1 } , A _ { 2 } ) + \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1000, + 1344, + 1177, + 1344, + 1177, + 1385, + 1000, + 1385 + ], + "score": 0.93, + "latex": "\\mathbf { e } _ { q } ^ { \\top } S ^ { \\top } V _ { \\mathrm { d i a g } } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 375, + 1940, + 519, + 1940, + 519, + 1975, + 375, + 1975 + ], + "score": 0.93, + "latex": "\\epsilon _ { 2 } = \\epsilon _ { 1 } ^ { 2 } 0" + }, + { + "category_id": 13, + "poly": [ + 1105, + 921, + 1213, + 921, + 1213, + 957, + 1105, + 957 + ], + "score": 0.92, + "latex": "S _ { : , 1 : ( q - 1 ) }" + }, + { + "category_id": 13, + "poly": [ + 690, + 922, + 736, + 922, + 736, + 954, + 690, + 954 + ], + "score": 0.92, + "latex": "S _ { : , q }" + }, + { + "category_id": 14, + "poly": [ + 365, + 1416, + 1334, + 1416, + 1334, + 1513, + 365, + 1513 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { 2 \\mathrm { T r } ( P Y ^ { \\top } ) = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } ) + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } U S _ { : , q } ( U S _ { : , q } ) ^ { \\top } \\Sigma ) } \\\\ & { \\qquad = 2 \\mathrm { T r } ( \\epsilon _ { 2 } U S _ { : , q } ( C L _ { 1 } ) _ { ( \\mathrm { r a n k } ( A _ { 2 } ) + 1 ) , : } X Y ^ { \\top } ) + 2 \\mathrm { T r } ( \\epsilon _ { 1 } \\epsilon _ { 2 } S _ { : , q } ^ { \\top } \\Lambda S _ { : , q } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 299, + 294, + 406, + 294, + 406, + 334, + 299, + 334 + ], + "score": 0.9, + "latex": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 259, + 530, + 259, + 530, + 297, + 298, + 297 + ], + "score": 0.89, + "latex": "S S ^ { \\top } V ~ = ~ S _ { : , 1 : ( q - 1 ) }" + }, + { + "category_id": 14, + "poly": [ + 485, + 1985, + 1216, + 1985, + 1216, + 2030, + 485, + 2030 + ], + "score": 0.89, + "latex": "\\scriptstyle \\frac { 1 } { 2 } [ \\mathrm { T r } ( P P ^ { \\top } ) + 2 \\mathrm { T r } ( P Q ^ { \\top } ) - 2 \\mathrm { T r } ( P Y ^ { \\top } ) ] = { \\mathcal { O } } ( \\epsilon _ { 1 } ^ { 4 } ) - { \\mathcal { O } } ( \\epsilon _ { 1 } ^ { 3 } ) < 0 ." + }, + { + "category_id": 13, + "poly": [ + 1336, + 230, + 1404, + 230, + 1404, + 261, + 1336, + 261 + ], + "score": 0.86, + "latex": "V =" + }, + { + "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": [ + 296.0, + 230.0, + 1335.0, + 230.0, + 1335.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 255.0, + 297.0, + 255.0, + 297.0, + 303.0, + 292.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 531.0, + 255.0, + 1407.0, + 255.0, + 1407.0, + 303.0, + 531.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 407.0, + 297.0, + 584.0, + 297.0, + 584.0, + 335.0, + 407.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1909.0, + 1405.0, + 1909.0, + 1405.0, + 1947.0, + 295.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1939.0, + 374.0, + 1939.0, + 374.0, + 1975.0, + 295.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 1939.0, + 1135.0, + 1939.0, + 1135.0, + 1975.0, + 520.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 915.0, + 689.0, + 915.0, + 689.0, + 959.0, + 293.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 915.0, + 1104.0, + 915.0, + 1104.0, + 959.0, + 737.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 915.0, + 1406.0, + 915.0, + 1406.0, + 959.0, + 1214.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 951.0, + 588.0, + 951.0, + 588.0, + 984.0, + 295.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1340.0, + 561.0, + 1340.0, + 561.0, + 1388.0, + 292.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 1340.0, + 999.0, + 1340.0, + 999.0, + 1388.0, + 751.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1178.0, + 1340.0, + 1409.0, + 1340.0, + 1409.0, + 1388.0, + 1178.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1378.0, + 527.0, + 1378.0, + 527.0, + 1409.0, + 293.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1516.0, + 1151.0, + 1516.0, + 1151.0, + 1553.0, + 296.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 573.0, + 1370.0, + 573.0, + 1370.0, + 612.0, + 297.0, + 612.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1483, + 1405, + 1483, + 1405, + 1716, + 296, + 1716 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 296, + 487, + 1405, + 487, + 1405, + 658, + 296, + 658 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1821, + 1405, + 1821, + 1405, + 1925, + 297, + 1925 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 1376, + 1406, + 1376, + 1406, + 1473, + 296, + 1473 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 602, + 1934, + 1094, + 1934, + 1094, + 2030, + 602, + 2030 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 296, + 766, + 1401, + 766, + 1401, + 832, + 296, + 832 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 298, + 1147, + 1404, + 1147, + 1404, + 1211, + 298, + 1211 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 300, + 1010, + 1401, + 1010, + 1401, + 1074, + 300, + 1074 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 530, + 1324, + 1171, + 1324, + 1171, + 1367, + 530, + 1367 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 537, + 1089, + 1159, + 1089, + 1159, + 1134, + 537, + 1134 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 661, + 1221, + 1041, + 1221, + 1041, + 1268, + 661, + 1268 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 300, + 905, + 1132, + 905, + 1132, + 939, + 300, + 939 + ], + "score": 0.922 + }, + { + "category_id": 8, + "poly": [ + 438, + 843, + 1264, + 843, + 1264, + 891, + 438, + 891 + ], + "score": 0.921 + }, + { + "category_id": 8, + "poly": [ + 320, + 951, + 1316, + 951, + 1316, + 1001, + 320, + 1001 + ], + "score": 0.911 + }, + { + "category_id": 0, + "poly": [ + 299, + 1756, + 672, + 1756, + 672, + 1792, + 299, + 1792 + ], + "score": 0.905 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1093, + 1400, + 1093, + 1400, + 1124, + 1351, + 1124 + ], + "score": 0.894 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1327, + 1400, + 1327, + 1400, + 1357, + 1352, + 1357 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1988, + 1401, + 1988, + 1401, + 2020, + 1351, + 2020 + ], + "score": 0.89 + }, + { + "category_id": 1, + "poly": [ + 290, + 1278, + 1118, + 1278, + 1118, + 1312, + 290, + 1312 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1228, + 1400, + 1228, + 1400, + 1258, + 1351, + 1258 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1351, + 851, + 1400, + 851, + 1400, + 881, + 1351, + 881 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1352, + 959, + 1400, + 959, + 1400, + 991, + 1352, + 991 + ], + "score": 0.879 + }, + { + "category_id": 1, + "poly": [ + 295, + 223, + 1407, + 223, + 1407, + 426, + 295, + 426 + ], + "score": 0.876 + }, + { + "category_id": 1, + "poly": [ + 297, + 431, + 1206, + 431, + 1206, + 468, + 297, + 468 + ], + "score": 0.873 + }, + { + "category_id": 0, + "poly": [ + 299, + 698, + 622, + 698, + 622, + 735, + 299, + 735 + ], + "score": 0.868 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2112, + 836, + 2112 + ], + "score": 0.867 + }, + { + "category_id": 13, + "poly": [ + 670, + 1442, + 769, + 1442, + 769, + 1475, + 670, + 1475 + ], + "score": 0.95, + "latex": "\\boldsymbol { A } _ { ( \\ell , k + 1 ) }" + }, + { + "category_id": 13, + "poly": [ + 718, + 345, + 995, + 345, + 995, + 390, + 718, + 390 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { f ( \\alpha ) = \\frac { 1 } { 2 } \\left\\| \\alpha \\mathbf { a } ^ { \\top } - \\mathbf { y } ^ { \\top } \\right\\| _ { 2 } ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 695, + 224, + 803, + 224, + 803, + 264, + 695, + 264 + ], + "score": 0.93, + "latex": "( \\widetilde { A } _ { 1 } , \\widetilde { A } _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 386, + 516, + 386, + 516, + 428, + 298, + 428 + ], + "score": 0.93, + "latex": "f ^ { \\prime \\prime } ( \\alpha ) = \\left\\| \\mathbf { a } \\right\\| _ { 2 } ^ { 2 } > 0 ." + }, + { + "category_id": 13, + "poly": [ + 1020, + 1013, + 1151, + 1013, + 1151, + 1049, + 1020, + 1049 + ], + "score": 0.93, + "latex": "A _ { ( k - 1 , 1 ) } X" + }, + { + "category_id": 14, + "poly": [ + 329, + 950, + 1326, + 950, + 1326, + 1001, + 329, + 1001 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { A _ { k } = A _ { ( \\ell , k + 1 ) } ^ { \\dagger } Y ( A _ { ( k - 1 , 1 ) } X ) ^ { \\dagger } + L _ { k } - A _ { ( \\ell , k + 1 ) } ^ { \\dagger } A _ { ( \\ell , k + 1 ) } L _ { k } A _ { ( k - 1 , 1 ) } X ( A _ { ( k - 1 , 1 ) } X ) ^ { \\dagger } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1198, + 1579, + 1401, + 1579, + 1401, + 1617, + 1198, + 1617 + ], + "score": 0.93, + "latex": "( \\nabla _ { { \\pmb A } _ { \\ell } } { \\mathcal { L } } _ { D } ) { \\pmb A } _ { \\ell } ^ { \\top } = { \\bf 0 }" + }, + { + "category_id": 14, + "poly": [ + 658, + 1220, + 1042, + 1220, + 1042, + 1267, + 658, + 1267 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell , 1 ) } ^ { \\top } = \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell , 1 ) } ^ { \\top } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 773, + 799, + 921, + 799, + 921, + 832, + 773, + 832 + ], + "score": 0.93, + "latex": "\\nabla _ { A _ { k } } \\mathcal { L } _ { D } = 0" + }, + { + "category_id": 13, + "poly": [ + 592, + 267, + 700, + 267, + 700, + 301, + 592, + 301 + ], + "score": 0.92, + "latex": "( A _ { 1 } , A _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1045, + 432, + 1195, + 432, + 1195, + 467, + 1045, + 467 + ], + "score": 0.92, + "latex": "f ( \\widetilde { \\alpha } ) > f ( \\alpha )" + }, + { + "category_id": 13, + "poly": [ + 582, + 1409, + 798, + 1409, + 798, + 1441, + 582, + 1441 + ], + "score": 0.92, + "latex": "U _ { k - 1 } , V _ { k - 1 } , C _ { k - 1 }" + }, + { + "category_id": 13, + "poly": [ + 734, + 265, + 879, + 265, + 879, + 301, + 734, + 301 + ], + "score": 0.92, + "latex": "\\epsilon _ { 2 } = \\epsilon _ { 1 } ^ { 2 } 0" + }, + { + "category_id": 13, + "poly": [ + 600, + 1614, + 749, + 1614, + 749, + 1646, + 600, + 1646 + ], + "score": 0.92, + "latex": "\\nabla _ { A _ { \\ell } } \\mathcal { L } _ { D } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1091, + 351, + 1150, + 351, + 1150, + 386, + 1091, + 386 + ], + "score": 0.92, + "latex": "f ( \\alpha )" + }, + { + "category_id": 13, + "poly": [ + 1248, + 519, + 1404, + 519, + 1404, + 553, + 1248, + 553 + ], + "score": 0.92, + "latex": "\\alpha = 1 , \\mathbf { a } ^ { \\top } =" + }, + { + "category_id": 13, + "poly": [ + 557, + 1648, + 704, + 1648, + 704, + 1680, + 557, + 1680 + ], + "score": 0.92, + "latex": "\\nabla _ { A _ { \\ell } } \\mathcal { L } _ { D } = \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1076, + 261, + 1388, + 261, + 1388, + 302, + 1076, + 302 + ], + "score": 0.92, + "latex": "\\mathrm { r a n k } ( \\widetilde { A } _ { 2 } ) = \\mathrm { r a n k } ( A _ { 2 } ) + 1" + }, + { + "category_id": 13, + "poly": [ + 556, + 617, + 779, + 617, + 779, + 658, + 556, + 658 + ], + "score": 0.92, + "latex": "( \\widetilde { A } _ { 2 } ) _ { i , : } : = \\widetilde { \\alpha } ( A _ { 2 } ) _ { i , : }" + }, + { + "category_id": 13, + "poly": [ + 762, + 1643, + 1223, + 1643, + 1223, + 1686, + 762, + 1686 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } ( \\pmb { A } _ { ( \\ell - 1 , 1 ) } \\pmb { X } ) ^ { \\top } = \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( \\ell - 1 , 1 ) } ^ { \\top } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 858, + 490, + 1029, + 490, + 1029, + 522, + 858, + 522 + ], + "score": 0.92, + "latex": "A _ { 2 } A _ { 1 } X ~ \\neq ~ \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1409, + 489, + 1409, + 489, + 1441, + 297, + 1441 + ], + "score": 0.92, + "latex": "U _ { k - 1 } V _ { k - 1 } C _ { k - 1 }" + }, + { + "category_id": 14, + "poly": [ + 601, + 1931, + 1096, + 1931, + 1096, + 2036, + 601, + 2036 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( { \\cal Y } { \\cal Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( A _ { ( \\ell , 2 ) } ) } \\Sigma _ { 0 } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( { \\cal Y } { \\cal Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( U _ { 0 } ^ { \\top } A _ { ( \\ell , 2 ) } ) } \\pmb { \\Lambda } _ { 0 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 584, + 490, + 763, + 490, + 763, + 523, + 584, + 523 + ], + "score": 0.91, + "latex": "( A _ { 1 } , A _ { 2 } ) \\ \\in \\mathcal { X }" + }, + { + "category_id": 13, + "poly": [ + 1263, + 585, + 1344, + 585, + 1344, + 619, + 1263, + 619 + ], + "score": 0.91, + "latex": "( A _ { 2 } ) _ { i , : }" + }, + { + "category_id": 13, + "poly": [ + 1272, + 310, + 1345, + 310, + 1345, + 346, + 1272, + 346 + ], + "score": 0.91, + "latex": "\\mathbf { a } ^ { \\top } , \\mathbf { y } ^ { \\top }" + }, + { + "category_id": 14, + "poly": [ + 532, + 1324, + 1172, + 1324, + 1172, + 1367, + 532, + 1367 + ], + "score": 0.91, + "latex": "\\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } \\boldsymbol { \\Sigma } _ { k - 1 } \\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } = \\boldsymbol { \\Sigma } _ { k - 1 } \\boldsymbol { \\mathcal { P } } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } ." + }, + { + "category_id": 13, + "poly": [ + 296, + 348, + 390, + 348, + 390, + 385, + 296, + 385 + ], + "score": 0.91, + "latex": "\\mathbf { a } ^ { \\intercal } \\neq \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1547, + 605, + 1547, + 605, + 1583, + 298, + 1583 + ], + "score": 0.91, + "latex": "\\pmb { A } _ { ( \\ell , k + 1 ) } , k = 1 , \\ldots , l - 1" + }, + { + "category_id": 14, + "poly": [ + 540, + 1087, + 1161, + 1087, + 1161, + 1134, + 540, + 1134 + ], + "score": 0.91, + "latex": "A _ { ( \\ell , 1 ) } \\boldsymbol { X } = \\mathcal { P } _ { \\mathrm { c o l } ( A _ { ( \\ell , k + 1 ) } ) } \\boldsymbol { Y } ( A _ { ( k - 1 , 1 ) } \\boldsymbol { X } ) ^ { \\dagger } \\boldsymbol { A } _ { ( k - 1 , 1 ) } \\boldsymbol { X } ." + }, + { + "category_id": 13, + "poly": [ + 298, + 552, + 574, + 552, + 574, + 589, + 298, + 589 + ], + "score": 0.91, + "latex": "( A _ { 2 } ) _ { i , : } A _ { 1 } \\boldsymbol { X } , \\mathbf { y } ^ { \\intercal } = \\boldsymbol { Y } _ { i , : }" + }, + { + "category_id": 13, + "poly": [ + 1161, + 769, + 1315, + 769, + 1315, + 802, + 1161, + 802 + ], + "score": 0.91, + "latex": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 299, + 1862, + 433, + 1862, + 433, + 1895, + 299, + 1895 + ], + "score": 0.91, + "latex": "A _ { 1 } , \\dotsc , A _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 999, + 800, + 1140, + 800, + 1140, + 831, + 999, + 831 + ], + "score": 0.91, + "latex": "k = 1 , \\dots , \\ell" + }, + { + "category_id": 13, + "poly": [ + 563, + 1824, + 1298, + 1824, + 1298, + 1864, + 563, + 1864 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathcal { L } _ { D } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathbf { Y } \\mathbf { Y } ^ { \\top } ) - \\mathrm { T r } ( A _ { ( \\ell , 1 ) } \\mathbf { X } \\mathbf { Y } ^ { \\top } ) + \\frac { 1 } { 2 } \\mathrm { T r } ( A _ { ( \\ell , 1 ) } \\mathbf { X } \\mathbf { X } ^ { \\top } A _ { ( \\ell , 1 ) } ^ { \\top } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 496, + 521, + 641, + 521, + 641, + 554, + 496, + 554 + ], + "score": 0.91, + "latex": "( A _ { 2 } ) _ { i , : } A _ { 1 } X" + }, + { + "category_id": 13, + "poly": [ + 1175, + 1147, + 1213, + 1147, + 1213, + 1184, + 1175, + 1184 + ], + "score": 0.9, + "latex": "A _ { \\ell } ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 1263, + 1379, + 1403, + 1379, + 1403, + 1413, + 1263, + 1413 + ], + "score": 0.9, + "latex": "A _ { ( \\ell , k + 1 ) } =" + }, + { + "category_id": 13, + "poly": [ + 925, + 1279, + 1115, + 1279, + 1115, + 1312, + 925, + 1312 + ], + "score": 0.9, + "latex": "k = 1 , \\dots , \\ell - 1" + }, + { + "category_id": 13, + "poly": [ + 765, + 1150, + 833, + 1150, + 833, + 1177, + 765, + 1177 + ], + "score": 0.9, + "latex": "k = \\ell" + }, + { + "category_id": 13, + "poly": [ + 1169, + 1440, + 1208, + 1440, + 1208, + 1469, + 1169, + 1469 + ], + "score": 0.9, + "latex": "\\pmb { A } _ { k }" + }, + { + "category_id": 13, + "poly": [ + 622, + 908, + 661, + 908, + 661, + 937, + 622, + 937 + ], + "score": 0.9, + "latex": "\\pmb { A } _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1260, + 1865, + 1335, + 1865, + 1335, + 1890, + 1260, + 1890 + ], + "score": 0.89, + "latex": "k = 1" + }, + { + "category_id": 13, + "poly": [ + 949, + 903, + 1130, + 903, + 1130, + 937, + 949, + 937 + ], + "score": 0.89, + "latex": "\\pmb { L } _ { k } \\in \\mathbb { R } ^ { d _ { k } \\times d _ { k - 1 } }" + }, + { + "category_id": 13, + "poly": [ + 736, + 1014, + 835, + 1014, + 835, + 1047, + 736, + 1047 + ], + "score": 0.89, + "latex": "A _ { ( \\ell , k + 1 ) }" + }, + { + "category_id": 14, + "poly": [ + 437, + 843, + 1264, + 843, + 1264, + 891, + 437, + 891 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\pmb { A } _ { ( \\ell , k + 1 ) } ^ { \\top } \\pmb { A } _ { ( \\ell , k + 1 ) } \\pmb { A } _ { k } \\pmb { A } _ { ( k - 1 , 1 ) } \\pmb { X } ( \\pmb { A } _ { ( k - 1 , 1 ) } \\pmb { X } ) ^ { \\top } = \\pmb { A } _ { ( \\ell , k + 1 ) } ^ { \\top } \\pmb { Y } \\pmb { X } ^ { \\top } \\pmb { A } _ { ( k - 1 , 1 ) } ^ { \\top } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1352, + 770, + 1393, + 770, + 1393, + 799, + 1352, + 799 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 483, + 434, + 558, + 434, + 558, + 463, + 483, + 463 + ], + "score": 0.88, + "latex": "\\alpha \\in \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 677, + 1047, + 867, + 1047, + 867, + 1074, + 677, + 1074 + ], + "score": 0.87, + "latex": "k = 1 , \\dots , \\ell - 1" + }, + { + "category_id": 13, + "poly": [ + 1120, + 555, + 1143, + 555, + 1143, + 583, + 1120, + 583 + ], + "score": 0.81, + "latex": "\\widetilde { \\alpha }" + }, + { + "category_id": 13, + "poly": [ + 992, + 591, + 1013, + 591, + 1013, + 613, + 992, + 613 + ], + "score": 0.79, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 392, + 523, + 405, + 523, + 405, + 548, + 392, + 548 + ], + "score": 0.73, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 912, + 434, + 933, + 434, + 933, + 461, + 912, + 461 + ], + "score": 0.72, + "latex": "\\widetilde { \\alpha }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1756.0, + 674.0, + 1756.0, + 674.0, + 1796.0, + 296.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 696.0, + 625.0, + 696.0, + 625.0, + 740.0, + 295.0, + 740.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": [ + 295.0, + 1484.0, + 1403.0, + 1484.0, + 1403.0, + 1520.0, + 295.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1515.0, + 1403.0, + 1515.0, + 1403.0, + 1550.0, + 294.0, + 1550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1545.0, + 297.0, + 1545.0, + 297.0, + 1581.0, + 293.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 1545.0, + 1407.0, + 1545.0, + 1407.0, + 1581.0, + 606.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1579.0, + 1197.0, + 1579.0, + 1197.0, + 1619.0, + 294.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1579.0, + 1406.0, + 1579.0, + 1406.0, + 1619.0, + 1402.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1609.0, + 556.0, + 1609.0, + 556.0, + 1701.0, + 283.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 1609.0, + 761.0, + 1609.0, + 761.0, + 1701.0, + 750.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1609.0, + 1414.0, + 1609.0, + 1414.0, + 1701.0, + 1224.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1679.0, + 1052.0, + 1679.0, + 1052.0, + 1719.0, + 294.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 485.0, + 583.0, + 485.0, + 583.0, + 527.0, + 293.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 485.0, + 857.0, + 485.0, + 857.0, + 527.0, + 764.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 485.0, + 1406.0, + 485.0, + 1406.0, + 527.0, + 1030.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 519.0, + 391.0, + 519.0, + 391.0, + 553.0, + 293.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 519.0, + 495.0, + 519.0, + 495.0, + 553.0, + 406.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 519.0, + 1247.0, + 519.0, + 1247.0, + 553.0, + 642.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 553.0, + 1119.0, + 553.0, + 1119.0, + 591.0, + 575.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 553.0, + 1407.0, + 553.0, + 1407.0, + 591.0, + 1144.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 582.0, + 991.0, + 582.0, + 991.0, + 622.0, + 291.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 582.0, + 1262.0, + 582.0, + 1262.0, + 622.0, + 1014.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 582.0, + 1406.0, + 582.0, + 1406.0, + 622.0, + 1345.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 620.0, + 555.0, + 620.0, + 555.0, + 661.0, + 293.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 620.0, + 791.0, + 620.0, + 791.0, + 661.0, + 780.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1819.0, + 562.0, + 1819.0, + 562.0, + 1867.0, + 290.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1299.0, + 1819.0, + 1405.0, + 1819.0, + 1405.0, + 1867.0, + 1299.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1859.0, + 298.0, + 1859.0, + 298.0, + 1898.0, + 295.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 1859.0, + 1259.0, + 1859.0, + 1259.0, + 1898.0, + 434.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1859.0, + 1405.0, + 1859.0, + 1405.0, + 1898.0, + 1336.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1893.0, + 618.0, + 1893.0, + 618.0, + 1925.0, + 296.0, + 1925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1370.0, + 1262.0, + 1370.0, + 1262.0, + 1417.0, + 290.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 490.0, + 1406.0, + 581.0, + 1406.0, + 581.0, + 1444.0, + 490.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 1406.0, + 1406.0, + 1406.0, + 1406.0, + 1444.0, + 799.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1436.0, + 669.0, + 1436.0, + 669.0, + 1476.0, + 294.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 1436.0, + 1168.0, + 1436.0, + 1168.0, + 1476.0, + 770.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1209.0, + 1436.0, + 1327.0, + 1436.0, + 1327.0, + 1476.0, + 1209.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 765.0, + 1160.0, + 765.0, + 1160.0, + 804.0, + 295.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1316.0, + 765.0, + 1351.0, + 765.0, + 1351.0, + 804.0, + 1316.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 765.0, + 1403.0, + 765.0, + 1403.0, + 804.0, + 1394.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 798.0, + 772.0, + 798.0, + 772.0, + 834.0, + 295.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 798.0, + 998.0, + 798.0, + 998.0, + 834.0, + 922.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 798.0, + 1364.0, + 798.0, + 1364.0, + 834.0, + 1141.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1143.0, + 764.0, + 1143.0, + 764.0, + 1185.0, + 292.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 1143.0, + 1174.0, + 1143.0, + 1174.0, + 1185.0, + 834.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 1143.0, + 1404.0, + 1143.0, + 1404.0, + 1185.0, + 1214.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1174.0, + 437.0, + 1174.0, + 437.0, + 1214.0, + 291.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1007.0, + 735.0, + 1007.0, + 735.0, + 1050.0, + 293.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1007.0, + 1019.0, + 1007.0, + 1019.0, + 1050.0, + 836.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1007.0, + 1406.0, + 1007.0, + 1406.0, + 1050.0, + 1152.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1039.0, + 676.0, + 1039.0, + 676.0, + 1075.0, + 296.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1039.0, + 871.0, + 1039.0, + 871.0, + 1075.0, + 868.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 901.0, + 621.0, + 901.0, + 621.0, + 942.0, + 292.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 901.0, + 948.0, + 901.0, + 948.0, + 942.0, + 662.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 901.0, + 1134.0, + 901.0, + 1134.0, + 942.0, + 1131.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1276.0, + 924.0, + 1276.0, + 924.0, + 1316.0, + 297.0, + 1316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 1276.0, + 1119.0, + 1276.0, + 1119.0, + 1316.0, + 1116.0, + 1316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 227.0, + 694.0, + 227.0, + 694.0, + 264.0, + 297.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 227.0, + 1404.0, + 227.0, + 1404.0, + 264.0, + 804.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 263.0, + 591.0, + 263.0, + 591.0, + 303.0, + 294.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 263.0, + 733.0, + 263.0, + 733.0, + 303.0, + 701.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 263.0, + 1075.0, + 263.0, + 1075.0, + 303.0, + 880.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1389.0, + 263.0, + 1400.0, + 263.0, + 1400.0, + 303.0, + 1389.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 309.0, + 1271.0, + 309.0, + 1271.0, + 349.0, + 293.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 309.0, + 1405.0, + 309.0, + 1405.0, + 349.0, + 1346.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 343.0, + 295.0, + 343.0, + 295.0, + 391.0, + 289.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 343.0, + 717.0, + 343.0, + 717.0, + 391.0, + 391.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 343.0, + 1090.0, + 343.0, + 1090.0, + 391.0, + 996.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 343.0, + 1409.0, + 343.0, + 1409.0, + 391.0, + 1151.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 386.0, + 297.0, + 386.0, + 297.0, + 430.0, + 294.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 386.0, + 1136.0, + 386.0, + 1136.0, + 430.0, + 517.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 429.0, + 482.0, + 429.0, + 482.0, + 471.0, + 293.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 429.0, + 911.0, + 429.0, + 911.0, + 471.0, + 559.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 429.0, + 1044.0, + 429.0, + 1044.0, + 471.0, + 934.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1196.0, + 429.0, + 1205.0, + 429.0, + 1205.0, + 471.0, + 1196.0, + 471.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 295, + 1278, + 1407, + 1278, + 1407, + 1571, + 295, + 1571 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1758, + 1403, + 1758, + 1403, + 1844, + 298, + 1844 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1937, + 1404, + 1937, + 1404, + 2037, + 298, + 2037 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 686, + 1405, + 686, + 1405, + 792, + 298, + 792 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 1067, + 1406, + 1067, + 1406, + 1171, + 299, + 1171 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 366, + 816, + 1404, + 816, + 1404, + 1048, + 366, + 1048 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 622, + 309, + 1075, + 309, + 1075, + 499, + 622, + 499 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 294, + 227, + 1402, + 227, + 1402, + 294, + 294, + 294 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 296, + 512, + 1402, + 512, + 1402, + 576, + 296, + 576 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 459, + 1694, + 1236, + 1694, + 1236, + 1746, + 459, + 1746 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 296, + 1646, + 1207, + 1646, + 1207, + 1681, + 296, + 1681 + ], + "score": 0.925 + }, + { + "category_id": 8, + "poly": [ + 343, + 1859, + 1353, + 1859, + 1353, + 1908, + 343, + 1908 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 299, + 619, + 672, + 619, + 672, + 656, + 299, + 656 + ], + "score": 0.916 + }, + { + "category_id": 8, + "poly": [ + 428, + 1584, + 1271, + 1584, + 1271, + 1636, + 428, + 1636 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 299, + 1211, + 623, + 1211, + 623, + 1247, + 299, + 1247 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.871 + }, + { + "category_id": 13, + "poly": [ + 848, + 974, + 956, + 974, + 956, + 1006, + 848, + 1006 + ], + "score": 0.94, + "latex": "\\bar { p } ( 0 ) \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 551, + 1798, + 673, + 1798, + 673, + 1846, + 551, + 1846 + ], + "score": 0.93, + "latex": "\\textstyle { \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } } , { \\frac { 1 } { 1 + \\epsilon ^ { 2 } } }" + }, + { + "category_id": 13, + "poly": [ + 926, + 1458, + 1271, + 1458, + 1271, + 1501, + 926, + 1501 + ], + "score": 0.93, + "latex": "\\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } = \\widetilde { M } _ { k } S _ { k } ^ { \\top } V _ { k } C _ { k }" + }, + { + "category_id": 14, + "poly": [ + 620, + 307, + 1078, + 307, + 1078, + 502, + 620, + 502 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathcal { L } = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\mathcal { P } _ { \\mathrm { c o l } ( \\pmb { V } _ { 0 } \\pmb { C } _ { 0 } ) } \\pmb { \\Lambda } _ { 0 } ) } \\\\ & { \\quad = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { V } _ { 0 } ^ { \\top } \\pmb { \\Lambda } _ { 0 } \\pmb { V } _ { 0 } ) } \\\\ & { \\quad \\overset { ( i ) } { = } \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y } \\pmb { Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\displaystyle \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 777, + 1408, + 949, + 1408, + 949, + 1461, + 777, + 1461 + ], + "score": 0.93, + "latex": "\\frac { \\mathbf { u } _ { j 1 } ^ { s } + \\epsilon \\mathbf { u } _ { i ( p _ { i } ( k ) + 1 ) } ^ { s } } { \\sqrt { 1 + \\epsilon ^ { 2 } } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1136, + 470, + 1136, + 470, + 1169, + 298, + 1169 + ], + "score": 0.93, + "latex": "i = 1 , \\ldots , r ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 1237, + 1104, + 1361, + 1104, + 1361, + 1139, + 1237, + 1139 + ], + "score": 0.93, + "latex": "p _ { i } ( 0 ) = p _ { i }" + }, + { + "category_id": 13, + "poly": [ + 367, + 2003, + 499, + 2003, + 499, + 2037, + 367, + 2037 + ], + "score": 0.93, + "latex": "\\left( \\mathbf { \\boldsymbol { A } } _ { \\ell } , \\mathbf { \\boldsymbol { A } } _ { \\ell - 1 } \\right)" + }, + { + "category_id": 13, + "poly": [ + 440, + 1499, + 508, + 1499, + 508, + 1539, + 440, + 1539 + ], + "score": 0.93, + "latex": "\\widetilde { A } _ { k + 1 }" + }, + { + "category_id": 13, + "poly": [ + 582, + 728, + 690, + 728, + 690, + 761, + 582, + 761 + ], + "score": 0.93, + "latex": "( B _ { 2 } , A _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 261, + 507, + 261, + 507, + 298, + 298, + 298 + ], + "score": 0.93, + "latex": "\\pmb { A } _ { ( \\ell , 2 ) } = \\pmb { U } _ { 0 } \\pmb { V } _ { 0 } \\pmb { C } _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1040, + 725, + 1344, + 725, + 1344, + 765, + 1040, + 765 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\mathcal { L } : = \\frac { 1 } { 2 } \\| B _ { 2 } A _ { 1 } \\boldsymbol { X } - \\boldsymbol { Y } \\| _ { F } ^ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1186, + 1376, + 1313, + 1376, + 1313, + 1411, + 1186, + 1411 + ], + "score": 0.92, + "latex": "p _ { j } ( k ) > 0" + }, + { + "category_id": 13, + "poly": [ + 567, + 1344, + 664, + 1344, + 664, + 1378, + 567, + 1378 + ], + "score": 0.92, + "latex": "\\boldsymbol { A } _ { ( l , k + 2 ) }" + }, + { + "category_id": 13, + "poly": [ + 879, + 941, + 986, + 941, + 986, + 974, + 879, + 974 + ], + "score": 0.92, + "latex": "( A _ { 1 } , B _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 690, + 1500, + 977, + 1500, + 977, + 1540, + 690, + 1540 + ], + "score": 0.92, + "latex": "U _ { k } \\gets \\widetilde { M } _ { k } , V _ { k } \\gets S _ { k } ^ { \\top } V _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1122, + 685, + 1393, + 685, + 1393, + 721, + 1122, + 721 + ], + "score": 0.92, + "latex": "B _ { 2 } \\in \\mathbb { R } ^ { \\operatorname* { m i n } \\{ d _ { \\ell } , \\ldots , d _ { 2 } \\} \\times d _ { 1 } }" + }, + { + "category_id": 13, + "poly": [ + 859, + 823, + 967, + 823, + 967, + 857, + 859, + 857 + ], + "score": 0.92, + "latex": "( A _ { 1 } , B _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 587, + 230, + 742, + 230, + 742, + 264, + 587, + 264 + ], + "score": 0.92, + "latex": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 1178, + 1940, + 1277, + 1940, + 1277, + 1975, + 1178, + 1975 + ], + "score": 0.92, + "latex": "A _ { ( \\ell - 2 , 1 ) }" + }, + { + "category_id": 13, + "poly": [ + 650, + 691, + 721, + 691, + 721, + 726, + 650, + 726 + ], + "score": 0.92, + "latex": "\\pmb { A } _ { ( \\ell , 2 ) }" + }, + { + "category_id": 13, + "poly": [ + 591, + 1458, + 845, + 1458, + 845, + 1499, + 591, + 1499 + ], + "score": 0.91, + "latex": "\\widetilde { A } _ { \\ell } = \\widetilde { M } _ { k } ( U _ { k } S _ { k } ) ^ { \\top } A _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 1346, + 1411, + 1393, + 1411, + 1393, + 1450, + 1346, + 1450 + ], + "score": 0.91, + "latex": "\\widetilde { M } _ { k }" + }, + { + "category_id": 13, + "poly": [ + 656, + 1375, + 828, + 1375, + 828, + 1408, + 656, + 1408 + ], + "score": 0.91, + "latex": "\\ : i < j < r ( k ) \\ :" + }, + { + "category_id": 13, + "poly": [ + 577, + 1098, + 971, + 1098, + 971, + 1141, + 577, + 1141 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\sum _ { i = 1 } ^ { r ( 0 ) } \\bar { p } _ { i } \\sigma _ { i } ( 0 ) = \\sum _ { i = 1 } ^ { r ( 0 ) } p _ { i } ( 0 ) \\sigma _ { i } ( 0 ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 344, + 1858, + 1352, + 1858, + 1352, + 1907, + 344, + 1907 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathcal { L } ( A _ { 1 } , \\ldots , \\widetilde { A } _ { k + 1 } , \\ldots , \\widetilde { A } _ { \\ell } ) = \\mathcal { L } ( A _ { 1 } , \\ldots , A _ { \\ell } ) - \\frac { \\epsilon ^ { 2 } } { 1 + \\epsilon ^ { 2 } } ( \\sigma _ { i } ( k ) - \\sigma _ { j } ( k ) ) < \\mathcal { L } ( A _ { 1 } , \\ldots , A _ { \\ell } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 397, + 893, + 472, + 893, + 472, + 926, + 397, + 926 + ], + "score": 0.91, + "latex": "m _ { k } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 948, + 1376, + 1129, + 1376, + 1129, + 1409, + 948, + 1409 + ], + "score": 0.91, + "latex": "p _ { i } ( k ) < m _ { i } ( k )" + }, + { + "category_id": 13, + "poly": [ + 363, + 1312, + 517, + 1312, + 517, + 1345, + 363, + 1345 + ], + "score": 0.91, + "latex": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 1242, + 1344, + 1340, + 1344, + 1340, + 1377, + 1242, + 1377 + ], + "score": 0.9, + "latex": "\\boldsymbol { A } _ { ( l , k + 2 ) }" + }, + { + "category_id": 14, + "poly": [ + 461, + 1693, + 1236, + 1693, + 1236, + 1746, + 461, + 1746 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathcal { L } ( \\widetilde { A } _ { \\ell } , \\dots , \\widetilde { A } _ { k + 1 } , \\dots ) = \\frac { 1 } { 2 } \\mathrm { T r } ( \\pmb { Y Y } ^ { \\top } ) - \\frac { 1 } { 2 } \\mathrm { T r } \\big ( \\mathcal { P } _ { \\mathrm { c o l } ( S _ { k } ^ { \\top } \\pmb { U } _ { k } ^ { \\top } \\widetilde { M } _ { k } S _ { k } ^ { \\top } V _ { k } ) } \\pmb { \\Lambda } _ { k } \\big ) . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 425, + 1580, + 1274, + 1580, + 1274, + 1635, + 425, + 1635 + ], + "score": 0.9, + "latex": "\\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } \\widetilde { A } _ { k + 1 } A _ { ( k , 1 ) } \\pmb { X } = \\mathcal { P } _ { \\mathrm { c o l } ( \\widetilde { A } _ { \\ell } A _ { ( \\ell - 1 , k + 2 ) } ) } \\pmb { Y } ( A _ { ( k , 1 ) } \\pmb { X } ) ^ { \\dag } A _ { ( k , 1 ) } \\pmb { X } ." + }, + { + "category_id": 13, + "poly": [ + 637, + 1419, + 708, + 1419, + 708, + 1451, + 637, + 1451 + ], + "score": 0.9, + "latex": "U _ { k } S _ { k }" + }, + { + "category_id": 13, + "poly": [ + 845, + 1940, + 1000, + 1940, + 1000, + 1973, + 845, + 1973 + ], + "score": 0.9, + "latex": "( \\pmb { A } _ { 1 } , \\ldots , \\pmb { A } _ { \\ell } )" + }, + { + "category_id": 13, + "poly": [ + 1261, + 1972, + 1393, + 1972, + 1393, + 2005, + 1261, + 2005 + ], + "score": 0.9, + "latex": "\\left( \\mathbf { 1 } _ { \\ell } , \\mathbf { A } _ { \\ell - 1 } \\right)" + }, + { + "category_id": 13, + "poly": [ + 397, + 975, + 533, + 975, + 533, + 1006, + 397, + 1006 + ], + "score": 0.9, + "latex": "p _ { i } = m _ { i } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 582, + 894, + 685, + 894, + 685, + 926, + 582, + 926 + ], + "score": 0.89, + "latex": "k \\leq r ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 844, + 1342, + 1153, + 1342, + 1153, + 1377, + 844, + 1377 + ], + "score": 0.89, + "latex": "A _ { ( l , k + 2 ) } = U _ { k } S _ { k } \\bar { S _ { k } ^ { \\top } } V _ { k } C _ { k }" + }, + { + "category_id": 13, + "poly": [ + 406, + 1070, + 448, + 1070, + 448, + 1099, + 406, + 1099 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 1125, + 973, + 1165, + 973, + 1165, + 1003, + 1125, + 1003 + ], + "score": 0.89, + "latex": "B _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 736, + 514, + 769, + 514, + 769, + 544, + 736, + 544 + ], + "score": 0.89, + "latex": "V _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 505, + 1139, + 770, + 1139, + 770, + 1171, + 505, + 1171 + ], + "score": 0.89, + "latex": "\\sigma _ { 1 } ( 0 ) > \\cdots > \\sigma _ { r ( 0 ) } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 1235, + 1313, + 1270, + 1313, + 1270, + 1343, + 1235, + 1343 + ], + "score": 0.89, + "latex": "V _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1166, + 1760, + 1402, + 1760, + 1402, + 1803, + 1166, + 1803 + ], + "score": 0.89, + "latex": "\\mathcal { P } _ { \\mathrm { c o l } ( S _ { k } ^ { \\top } U _ { k } ^ { \\top } \\widetilde { M } _ { k } S _ { k } ^ { \\top } V _ { k } ) } \\Lambda" + }, + { + "category_id": 13, + "poly": [ + 491, + 1466, + 528, + 1466, + 528, + 1496, + 491, + 1496 + ], + "score": 0.88, + "latex": "\\pmb { A } _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 842, + 1761, + 879, + 1761, + 879, + 1791, + 842, + 1791 + ], + "score": 0.88, + "latex": "i , j" + }, + { + "category_id": 13, + "poly": [ + 616, + 975, + 794, + 975, + 794, + 1006, + 616, + 1006 + ], + "score": 0.88, + "latex": "i = 1 , \\ldots , r ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 1362, + 824, + 1400, + 824, + 1400, + 855, + 1362, + 855 + ], + "score": 0.88, + "latex": "B _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1364, + 2005, + 1401, + 2005, + 1401, + 2034, + 1364, + 2034 + ], + "score": 0.88, + "latex": "\\pmb { A } _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 1129, + 515, + 1166, + 515, + 1166, + 544, + 1129, + 544 + ], + "score": 0.88, + "latex": "\\mathbf { { \\boldsymbol { \\Lambda } } } _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 411, + 817, + 792, + 817, + 792, + 860, + 411, + 860 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\mathrm { f } \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} \\leq \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 981, + 1313, + 1015, + 1313, + 1015, + 1342, + 981, + 1342 + ], + "score": 0.87, + "latex": "S _ { k }" + }, + { + "category_id": 13, + "poly": [ + 454, + 1004, + 748, + 1004, + 748, + 1046, + 454, + 1046 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\operatorname { r a n k } ( B _ { 2 } ) = \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 425, + 934, + 805, + 934, + 805, + 975, + 425, + 975 + ], + "score": 0.84, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } \\{ d _ { \\ell } , \\dots , d _ { 1 } \\} > \\sum _ { i = 1 } ^ { r ( 0 ) } m _ { i } ( 0 ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 466, + 1422, + 481, + 1422, + 481, + 1452, + 466, + 1452 + ], + "score": 0.83, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 876, + 1071, + 897, + 1071, + 897, + 1096, + 876, + 1096 + ], + "score": 0.76, + "latex": "\\mathcal { L }" + }, + { + "category_id": 13, + "poly": [ + 578, + 856, + 1404, + 856, + 1404, + 898, + 578, + 898 + ], + "score": 0.68, + "latex": "\\begin{array} { r } { p _ { 1 } = \\tilde { m _ { 1 } ( 0 ) } , \\dots , p _ { k - 1 } = m _ { k - 1 } ( 0 ) , p _ { k } = \\mathrm { r a n k } ( B _ { 2 } ) - \\sum _ { i = 1 } ^ { k - 1 } m _ { i } ( 0 ) \\leq } \\end{array}" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 619.0, + 673.0, + 619.0, + 673.0, + 660.0, + 296.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1211.0, + 625.0, + 1211.0, + 625.0, + 1251.0, + 296.0, + 1251.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": [ + 298.0, + 1282.0, + 1404.0, + 1282.0, + 1404.0, + 1313.0, + 298.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1310.0, + 362.0, + 1310.0, + 362.0, + 1346.0, + 294.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 1310.0, + 980.0, + 1310.0, + 980.0, + 1346.0, + 518.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 1310.0, + 1234.0, + 1310.0, + 1234.0, + 1346.0, + 1016.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1271.0, + 1310.0, + 1405.0, + 1310.0, + 1405.0, + 1346.0, + 1271.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1340.0, + 566.0, + 1340.0, + 566.0, + 1382.0, + 293.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 1340.0, + 843.0, + 1340.0, + 843.0, + 1382.0, + 665.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 1340.0, + 1241.0, + 1340.0, + 1241.0, + 1382.0, + 1154.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 1340.0, + 1406.0, + 1340.0, + 1406.0, + 1382.0, + 1341.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1374.0, + 655.0, + 1374.0, + 655.0, + 1412.0, + 294.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 1374.0, + 947.0, + 1374.0, + 947.0, + 1412.0, + 829.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 1374.0, + 1185.0, + 1374.0, + 1185.0, + 1412.0, + 1130.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1314.0, + 1374.0, + 1406.0, + 1374.0, + 1406.0, + 1412.0, + 1314.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1456.0, + 490.0, + 1456.0, + 490.0, + 1506.0, + 292.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1456.0, + 590.0, + 1456.0, + 590.0, + 1506.0, + 529.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 1456.0, + 925.0, + 1456.0, + 925.0, + 1506.0, + 846.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 1456.0, + 1409.0, + 1456.0, + 1409.0, + 1506.0, + 1272.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1502.0, + 439.0, + 1502.0, + 439.0, + 1540.0, + 293.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 1502.0, + 689.0, + 1502.0, + 689.0, + 1540.0, + 509.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 1502.0, + 1408.0, + 1502.0, + 1408.0, + 1540.0, + 978.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1535.0, + 1043.0, + 1535.0, + 1043.0, + 1572.0, + 293.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 1403.5, + 1409.0, + 1403.5, + 1409.0, + 1461.5, + 764.0, + 1461.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1414.0, + 788.0, + 1414.0, + 788.0, + 1457.5, + 293.0, + 1457.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1795.0, + 550.0, + 1795.0, + 550.0, + 1851.0, + 283.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 1795.0, + 1096.0, + 1795.0, + 1096.0, + 1851.0, + 674.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1749.5, + 1409.0, + 1749.5, + 1409.0, + 1804.0, + 287.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1936.0, + 844.0, + 1936.0, + 844.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1001.0, + 1936.0, + 1177.0, + 1936.0, + 1177.0, + 1978.0, + 1001.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 1936.0, + 1406.0, + 1936.0, + 1406.0, + 1978.0, + 1278.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1260.0, + 1972.0, + 1260.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1972.0, + 1402.0, + 1972.0, + 1402.0, + 2007.0, + 1394.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2002.0, + 366.0, + 2002.0, + 366.0, + 2037.0, + 296.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 2002.0, + 1363.0, + 2002.0, + 1363.0, + 2037.0, + 500.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 682.0, + 649.0, + 682.0, + 649.0, + 725.0, + 291.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 722.0, + 682.0, + 1121.0, + 682.0, + 1121.0, + 725.0, + 722.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 682.0, + 1406.0, + 682.0, + 1406.0, + 725.0, + 1394.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 724.0, + 581.0, + 724.0, + 581.0, + 767.0, + 293.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 724.0, + 1039.0, + 724.0, + 1039.0, + 767.0, + 691.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 724.0, + 1405.0, + 724.0, + 1405.0, + 767.0, + 1345.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 758.0, + 657.0, + 758.0, + 657.0, + 794.0, + 295.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1067.0, + 405.0, + 1067.0, + 405.0, + 1102.0, + 296.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1067.0, + 875.0, + 1067.0, + 875.0, + 1102.0, + 449.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 1067.0, + 1404.0, + 1067.0, + 1404.0, + 1102.0, + 898.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1081.0, + 576.0, + 1081.0, + 576.0, + 1161.0, + 283.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 1081.0, + 1236.0, + 1081.0, + 1236.0, + 1161.0, + 972.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1362.0, + 1081.0, + 1418.0, + 1081.0, + 1418.0, + 1161.0, + 1362.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1132.0, + 297.0, + 1132.0, + 297.0, + 1175.0, + 289.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 471.0, + 1132.0, + 504.0, + 1132.0, + 504.0, + 1175.0, + 471.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1132.0, + 1100.0, + 1132.0, + 1100.0, + 1175.0, + 771.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 359.0, + 806.0, + 410.0, + 806.0, + 410.0, + 872.0, + 359.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 806.0, + 858.0, + 806.0, + 858.0, + 872.0, + 793.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 806.0, + 1361.0, + 806.0, + 1361.0, + 872.0, + 968.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 806.0, + 1413.0, + 806.0, + 1413.0, + 872.0, + 1401.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 843.0, + 577.0, + 843.0, + 577.0, + 909.0, + 384.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1405.0, + 843.0, + 1414.0, + 843.0, + 1414.0, + 909.0, + 1405.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 473.0, + 890.0, + 581.0, + 890.0, + 581.0, + 927.0, + 473.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 890.0, + 699.0, + 890.0, + 699.0, + 927.0, + 686.0, + 927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 914.0, + 396.0, + 914.0, + 396.0, + 1007.0, + 353.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 914.0, + 847.0, + 914.0, + 847.0, + 1007.0, + 806.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 914.0, + 1124.0, + 914.0, + 1124.0, + 1007.0, + 987.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 914.0, + 1423.0, + 914.0, + 1423.0, + 1007.0, + 1166.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 988.0, + 453.0, + 988.0, + 453.0, + 1062.0, + 384.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 988.0, + 772.0, + 988.0, + 772.0, + 1062.0, + 749.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.75, + 1011.5, + 682.75, + 1011.5, + 682.75, + 1039.0, + 617.75, + 1039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 586.0, + 227.0, + 586.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 267.0, + 743.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 259.0, + 297.0, + 259.0, + 297.0, + 300.0, + 294.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 259.0, + 800.0, + 259.0, + 800.0, + 300.0, + 508.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 508.0, + 735.0, + 508.0, + 735.0, + 549.0, + 293.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 508.0, + 1128.0, + 508.0, + 1128.0, + 549.0, + 770.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 508.0, + 1407.0, + 508.0, + 1407.0, + 549.0, + 1167.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 541.0, + 434.0, + 541.0, + 434.0, + 579.0, + 294.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1645.0, + 1205.0, + 1645.0, + 1205.0, + 1684.0, + 295.0, + 1684.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 312, + 1404, + 312, + 1404, + 471, + 297, + 471 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 291, + 228, + 1403, + 228, + 1403, + 299, + 291, + 299 + ], + "score": 0.949 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.839 + }, + { + "category_id": 13, + "poly": [ + 441, + 260, + 573, + 260, + 573, + 300, + 441, + 300 + ], + "score": 0.93, + "latex": "( \\widetilde { A } _ { \\ell } , \\widetilde { A } _ { \\ell - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 685, + 313, + 846, + 313, + 846, + 350, + 685, + 350 + ], + "score": 0.92, + "latex": "\\pmb { A } _ { ( \\ell , 1 ) } \\pmb { X } \\neq \\mathbf { 0 }" + }, + { + "category_id": 13, + "poly": [ + 634, + 259, + 944, + 259, + 944, + 300, + 634, + 300 + ], + "score": 0.91, + "latex": "\\mathrm { \\ddot { r a n k } } ( \\hat { \\tilde { \\mathbf { A } } } _ { \\ell } ) = \\mathrm { r a n k } ( A _ { \\ell } ) + 1" + }, + { + "category_id": 13, + "poly": [ + 551, + 314, + 593, + 314, + 593, + 345, + 551, + 345 + ], + "score": 0.91, + "latex": "\\mathcal { X } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 299, + 346, + 504, + 346, + 504, + 382, + 299, + 382 + ], + "score": 0.91, + "latex": "( A _ { \\ell } ) _ { i , : } A _ { ( \\ell - 1 , 1 ) } X" + }, + { + "category_id": 13, + "poly": [ + 680, + 439, + 723, + 439, + 723, + 469, + 680, + 469 + ], + "score": 0.89, + "latex": "\\mathcal { X } _ { D }" + }, + { + "category_id": 13, + "poly": [ + 1305, + 316, + 1319, + 316, + 1319, + 341, + 1305, + 341 + ], + "score": 0.67, + "latex": "i" + }, + { + "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": [ + 292.0, + 309.0, + 550.0, + 309.0, + 550.0, + 352.0, + 292.0, + 352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 309.0, + 684.0, + 309.0, + 684.0, + 352.0, + 594.0, + 352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 309.0, + 1304.0, + 309.0, + 1304.0, + 352.0, + 847.0, + 352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1320.0, + 309.0, + 1406.0, + 309.0, + 1406.0, + 352.0, + 1320.0, + 352.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 342.0, + 298.0, + 342.0, + 298.0, + 385.0, + 295.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 342.0, + 1406.0, + 342.0, + 1406.0, + 385.0, + 505.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 374.0, + 1405.0, + 374.0, + 1405.0, + 413.0, + 294.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 402.0, + 1405.0, + 402.0, + 1405.0, + 447.0, + 292.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 437.0, + 679.0, + 437.0, + 679.0, + 475.0, + 295.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 437.0, + 920.0, + 437.0, + 920.0, + 475.0, + 724.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 1406.0, + 229.0, + 1406.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 264.0, + 440.0, + 264.0, + 440.0, + 304.0, + 293.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 264.0, + 633.0, + 264.0, + 633.0, + 304.0, + 574.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 264.0, + 1357.0, + 264.0, + 1357.0, + 304.0, + 945.0, + 304.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/T4gXBOXoIUr/T4gXBOXoIUr_layout.pdf b/parse/train/T4gXBOXoIUr/T4gXBOXoIUr_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d3f9d63b43c32afe41348b5e1db276001e537500 --- /dev/null +++ b/parse/train/T4gXBOXoIUr/T4gXBOXoIUr_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a5a193f187dade319f68a3423cd506bb9d45564f7fc06c8344c0c5b99ceebafa +size 1741838 diff --git a/parse/train/T4gXBOXoIUr/T4gXBOXoIUr_origin.pdf b/parse/train/T4gXBOXoIUr/T4gXBOXoIUr_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5ec5f4c9d619327b6ffa64c0c5291ed7b17ee26e --- /dev/null +++ b/parse/train/T4gXBOXoIUr/T4gXBOXoIUr_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9bbc4f25ac592c30c6feab3e426ce3abece2df00e0441594ad82c96f4530195d +size 1560036 diff --git a/parse/train/T4gXBOXoIUr/T4gXBOXoIUr_span.pdf b/parse/train/T4gXBOXoIUr/T4gXBOXoIUr_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4e38404485b43ad42e2aa870677410c3b07d49c4 --- /dev/null +++ b/parse/train/T4gXBOXoIUr/T4gXBOXoIUr_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5266c13bfdf93ca337b56192ba2739652fbd8a70d8915aabfb344490a64c18bb +size 1747876 diff --git a/parse/train/UFGEelJkLu5/UFGEelJkLu5_layout.pdf b/parse/train/UFGEelJkLu5/UFGEelJkLu5_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b522bb6280effc466f33a5d6c1a0d26468c51565 --- /dev/null +++ b/parse/train/UFGEelJkLu5/UFGEelJkLu5_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:468274d83824e2270cb76db68dfb1e8ed7451df1b9d50c1ccc8e810e69cf6d3e +size 832840 diff --git a/parse/train/UFGEelJkLu5/UFGEelJkLu5_origin.pdf b/parse/train/UFGEelJkLu5/UFGEelJkLu5_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..72fabd839c0951c724959a9c18b278de573b8c63 --- /dev/null +++ b/parse/train/UFGEelJkLu5/UFGEelJkLu5_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:55841b539c7a56bc430190bce23f2fb659cad6fbb6e4896195bc3b10a5f3c45a +size 609851 diff --git a/parse/train/UFGEelJkLu5/UFGEelJkLu5_span.pdf b/parse/train/UFGEelJkLu5/UFGEelJkLu5_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d18605a5d51b6662f4c26b0d1590013c91d89083 --- /dev/null +++ b/parse/train/UFGEelJkLu5/UFGEelJkLu5_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c79ea4caaa114e6c789cdc3b3b946a21e55f1f8c238ab332790bff4fd75bc287 +size 834699 diff --git a/parse/train/WGWzwdjm8mS/WGWzwdjm8mS.md b/parse/train/WGWzwdjm8mS/WGWzwdjm8mS.md new file mode 100644 index 0000000000000000000000000000000000000000..17f55b66b3f146d27acea348e4e26d06f5eeb93d --- /dev/null +++ b/parse/train/WGWzwdjm8mS/WGWzwdjm8mS.md @@ -0,0 +1,708 @@ +# EARLY STOPPING BY GRADIENT DISPARITY + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +Validation-based early-stopping methods are one of the most popular techniques used to avoid over-training deep neural networks. They require to set aside a reliable unbiased validation set, which can be expensive in applications offering limited amounts of data. In this paper, we propose to use gradient disparity, which we define as the $\ell _ { 2 }$ norm distance between the gradient vectors of two batches drawn from the training set. It comes from a probabilistic upper bound on the difference between the classification errors over a given batch, when the network is trained on this batch and when the network is trained on another batch of points sampled from the same dataset. We empirically show that gradient disparity is a very promising early-stopping criterion when data is limited, because it uses all the training samples during training. Furthermore, we show in a wide range of experimental settings that gradient disparity is not only strongly related to the usual generalization error between the training and test sets, but that it is also much more informative about the level of label noise. + +# 1 INTRODUCTION + +Early stopping is a commonly used regularization technique to avoid under/over fitting deep neural networks trained with iterative methods, such as gradient descent (Prechelt, 1998; Yao et al., 2007; Gu et al., 2018). To have an unbiased proxy on the generalization error, early stopping requires a separate accurately labeled validation set. However, labeled data collection is an expensive and time consuming process that might require domain expertise (Roh et al., 2019). Moreover, deep learning is becoming popular to use for new and critical applications for which there is simply not enough available data. Hence, it is advantageous to have a signal of overfitting that does not require a validation set, then all the available data can be used for training the model. + +Let $S _ { 1 }$ and $S _ { 2 }$ be two batches of points sampled from the available (training) dataset. Suppose that $S _ { 1 }$ is selected for an iteration (step) of stochastic gradient descent (SGD), which then updates the parameter vector to $w _ { 1 }$ . The average loss over $S _ { 1 }$ is in principle reduced, given a sufficiently small learning rate. However, the average loss over the other batch $S _ { 2 }$ (i.e., $L _ { S _ { 2 } } ( h _ { w _ { 1 } } ) )$ is not as likely to be reduced. It will remain on average larger than the loss computed over $S _ { 2 }$ , if it was $S _ { 2 }$ instead of $S _ { 1 }$ that had been selected for this iteration (i.e., $L _ { S _ { 2 } } ( h _ { w _ { 2 } } ) )$ . The difference is the penalty $\mathcal { R } _ { 2 }$ that we pay for choosing $S _ { 1 }$ over $S _ { 2 }$ (and similarly, $\mathcal { R } _ { 1 }$ is the penalty that we would pay for choosing $S _ { 2 }$ over $S _ { 1 }$ ). $\mathcal { R } _ { 2 }$ is illustrated in Figure 1 for a hypothetical non-convex loss as a function of a one dimensional parameter. The expected penalty measures how much, in an iteration, a model updated on one batch $( S _ { 1 } )$ is able to generalize + +![](images/efa99407233504696a1c2e50ec5fdc49435647ba540b9bb569d60976631b00d2.jpg) +Figure 1: An illustration of the penalty term $\mathcal { R } _ { 2 }$ , where the y-axis is the loss, and the $\mathbf { X }$ -axis indicates the parameters of the model. $L _ { S _ { 1 } }$ and $L _ { S _ { 2 } }$ are the average losses over batches $S _ { 1 }$ and $S _ { 2 }$ , respectively. $\mathbf { \chi } _ { w } \mathbf { \bar { ( } } t )$ is the parameter at iteration $t$ and wit w(t+1)i is the parameter at iteration t + 1 if batch $S _ { i }$ was selected for the update step at iteration $t$ with $i \in \{ 1 , 2 \}$ . + +on average to another batch $( S _ { 2 } )$ from the dataset. Hence, we call $\mathcal { R }$ the generalization penalty. + +We establish a probabilistic upper-bound on the sum of the expected penalties $\mathbb { E } \left[ \mathcal { R } _ { 1 } \right] + \mathbb { E } \left[ \mathcal { R } _ { 2 } \right]$ by adapting the PAC-Bayesian framework (McAllester, 1999a;b; 2003) given a pair of batches $S _ { 1 }$ and $S _ { 2 }$ sampled from the dataset (Theorem 1). Interestingly, under some mild assumptions, this upper bound is essentially a simple expression driven by $\| g _ { 1 } - g _ { 2 } \| _ { 2 }$ , where $g _ { 1 }$ and $g _ { 2 }$ are the gradient vectors over the two batches $S _ { 1 }$ and $S _ { 2 }$ , respectively. We call this gradient disparity: it measures how a small gradient step on one batch negatively affects the performance on another one. + +Gradient disparity is simple to use and it is computationally tractable during the course of training. Our experiments on state-of-the-art configurations suggest a very strong link between gradient disparity and generalization error; we propose gradient disparity as an effective early stopping criterion. Gradient disparity is particularly useful when the available dataset has limited labeled data, because it does not require splitting the available dataset into training and validation sets so that all the available data can be used during training, unlike for instance $k$ -fold cross validation. We observe that using gradient disparity, instead of an unbiased validation set, results in at least $1 \%$ predictive performance improvement for critical applications with limited and very costly available data, such as the MRNet dataset that is a small size image-classification dataset used for detecting knee injuries (Table 1). + +
TaskMethodTest lossTest AUC score (in percentage)
abnormal5-fold CvGD0.284 ± 0.016 (0.307 ± 0.057)0.274 ± 0.004 (0.275 ± 0.053)71.016 ± 3.66 (87.44 ± 1.35)72.67 ± 3.85 (88.12 ± 0.35)
ACL5-fold CvGD0.973 ± 0.111 (1.246 ± 0.142)0.842 ± 0.101 (1.136 ± 0.121)79.80 ± 1.23 (89.32 ± 1.47)81.81 ± 1.64 (91.52 ± 0.09)
meniscal5-fold CvGD0.758 ± 0.04 (1.163 ± 0.127)0.726± 0.019 (1.14 ± 0.323)73.53 ± 1.30 (72.14 ± 0.74)74.08 ± 0.79 (73.80 ± 0.24)
+ +Table 1: The loss and area under the receiver operating characteristic curve (AUC score) on the MRNet test set (Bien et al., 2018), comparing 5-fold cross validation (5-fold CV) and gradient disparity (GD), when both are used as early stopping criteria for detecting the presence of abnormally, ACL tears, and meniscal tears from the sagittal plane MRI scans. The corresponding curves during training are shown in Figure 10. The results of early stopping are given, both when the metric has increased for 5 epochs from the beginning of training and between parenthesis when the metric has increased for 5 consecutive epochs. + +Moreover, when the available dataset contains noisy labels, the validation set is no longer a reliable predictor of the clean test set (see e.g., Figure 9 (a) (left)), whereas gradient disparity correctly predicts the performance on the test set and again can be used as a promising early-stopping criterion. Furthermore, we observe that gradient disparity is a better indicator of label noise level than generalization error, especially at early stages of training. Similarly to the generalization error, it decreases with the training set size, and it increases with the batch size. + +Paper Outline. In Section 2, we formally define the generalization penalty. In Section 3, we give the upper bound on the generalization penalty. In Section 4, we introduce the gradient disparity metric. In Section 5, we present experiments that support gradient disparity as an early stopping criterion. In Section 6, we assess gradient disparity as a generalization metric. Finally, in Section 7, we further discuss the observations and compare gradient disparity to related work. A detailed comparison to related work is deferred to Appendix H. For our experiments, we consider four image classification datasets: MNIST, CIFAR-10, CIFAR-100 and MRNet, and we consider a wide range of neural network architectures: ResNet, VGG, AlexNet and fully connected neural networks. + +# 2 GENERALIZATION PENALTY + +Consider a classification task with input $x \in \mathcal { X } : = \mathbb { R } ^ { n }$ and ground truth label $y \in \{ 1 , 2 , \cdots , k \}$ , where $k$ is the number of classes. Let $h _ { w } \ \in \ { \mathcal { H } } \ : \ { \mathcal { X } } \ \to \ { \mathcal { y } } \ : = \ \mathbb { R } ^ { k }$ be a predictor (classifier) parameterized by the parameter vector $\boldsymbol { w } ~ \in ~ \mathbb { R } ^ { d }$ , and $l ( \cdot , \cdot )$ be the 0-1 loss function $l \left( h _ { w } ( \bar { x } ) , y \right) = \mathbb { 1 } \left[ h _ { w } ( x ) [ y ] < \operatorname* { m a x } _ { j \neq y } h _ { w } ( x ) [ j ] \right]$ for all $h _ { w } \in \mathcal { H }$ and $( x , y ) \in \mathcal { X } \times \{ 1 , 2 , \cdot \cdot \cdot , k \}$ The expected loss and the empirical loss over the training set $S$ of size $m$ are respectively defined as + +$$ +L ( h _ { w } ) = \mathbb { E } _ { ( x , y ) \sim D } \left[ l \left( h _ { w } ( x ) , y \right) \right] \qquad \mathrm { ~ a n d ~ } \qquad L _ { S } ( h _ { w } ) = \frac { 1 } { m } \sum _ { i = 1 } ^ { m } l ( h _ { w } ( x _ { i } ) , y _ { i } ) , +$$ + +where $D$ is the probability distribution of the data points and $( x _ { i } , y _ { i } )$ are i.i.d. samples drawn from $S \sim D ^ { m }$ . $L _ { S } ( \bar { h } _ { w } )$ is also called the training classification error. Similar to the notation used in (Dziugaite & Roy, 2017), distributions on the hypotheses space $\mathcal { H }$ are simply distributions on the underlying parameterization. With some abuse of notation, $\nabla L _ { S _ { i } }$ refers to the gradient with respect to the surrogate differentiable loss function, which in our experiments is the cross entropy. + +In a mini-batch gradient descent (SGD) setting, consider two batches of points, denoted by $S _ { 1 }$ and $S _ { 2 }$ , which have respectively $m _ { 1 }$ and $m _ { 2 }$ number of samples, with $m _ { 1 } + m _ { 2 } \leq m$ . The average loss functions over these two sets of samples are $L _ { S _ { 1 } } ( h _ { w } )$ and $L _ { S _ { 2 } } ( h _ { w } )$ , respectively. Let $w = \bar { w } ^ { ( t ) }$ be the parameter vector at the beginning of an iteration $t$ . If $S _ { 1 }$ is selected for the next iteration, $w$ gets updated to $w _ { 1 } = w ^ { ( t + 1 ) }$ with + +$$ +w _ { 1 } = w - \gamma \nabla L _ { S _ { 1 } } \left( h _ { w } \right) , +$$ + +where $\gamma$ is the learning rate. Conversely, if $S _ { 2 }$ had been selected instead of $S _ { 1 }$ , the updated parameter vector at the end of this iteration would have been $w _ { 2 } = w - \gamma \nabla L _ { S _ { 2 } }$ $\left( h _ { w } \right)$ . Therefore, the generalization penalty on batch $S _ { 2 }$ is defined as $\mathcal { R } _ { 2 } = L _ { S _ { 2 } } \left( h _ { w _ { 1 } } \right) - L _ { S _ { 2 } } \left( h _ { w _ { 2 } } \right)$ , which is the gap between the loss over $S _ { 2 } , L _ { S _ { 2 } } \left( h _ { w _ { 1 } } \right)$ , and its target value, $L _ { S _ { 2 } } \left( h _ { w _ { 2 } } \right)$ , at the end of iteration $t$ . + +When selecting $S _ { 1 }$ for the parameter update, Equation (2) makes a step towards learning the inputoutput relations of batch $S _ { 1 }$ . If this negatively affects the performance on batch $S _ { 2 }$ , $\mathcal { R } _ { 2 }$ will be large; the model is learning the data structures that are unique to $S _ { 1 }$ and that do not appear in $S _ { 2 }$ . Because $S _ { 1 }$ and $S _ { 2 }$ are batches of points sampled from the same distribution $D$ , they have data structures in common. If, throughout the learning process, we consistently observe that, in each update step, the model learns structures unique to only one batch, then it is very likely that the model is memorizing the labels instead of learning the common data-structures. This is captured by the generalization penalty $\mathcal { R }$ . + +# 3 BOUND ON THE GENERALIZATION PENALTY + +We adapt the PAC-Bayesian framework (McAllester, $1 9 9 9 \mathrm { a } ; \mathrm { b } )$ ) to account for the trajectory of the learning algorithm; For each learning iteration we define a prior, and two possible posteriors depending on the choice of the batch selection. Let $w \sim P$ be an initial parameter vector that follows a prior distribution $P$ which is a $\mathcal { F } _ { t }$ -measurable function, where $\mathcal { F } _ { t }$ denotes the filtration of the available information at the beginning of iteration $t$ . Let $h _ { w _ { 1 } } , h _ { w _ { 2 } }$ be the two learned single predictors, at the end of iteration $t$ , from $S _ { 1 }$ and $S _ { 2 }$ , respectively. In this framework, for $i \in \{ 1 , 2 \}$ , each predictor $h _ { w _ { i } }$ is randomized and becomes $h _ { \nu _ { i } }$ with $\nu _ { i } = w _ { i } + u _ { i }$ , where $u _ { i }$ is a random variable whose distribution might depend on $S _ { i }$ . Let $Q _ { i }$ be the distribution of $\nu _ { i }$ , which is a distribution over the predictor space $\mathcal { H }$ that depends on $S _ { i }$ via $w _ { i }$ and possibly $u _ { i }$ . Let $\mathcal { G } _ { i }$ be a $\sigma$ -field such that $\sigma ( S _ { i } ) \cup \mathcal { F } _ { t } \subset \mathcal { G } _ { i }$ and that the posterior distribution $Q _ { i }$ is $\mathcal { G } _ { i }$ -measurable for $i \in \{ 1 , 2 \}$ . We further assume that the random variable $\nu _ { 1 } \sim Q _ { 1 }$ is statistically independent from the draw of the batch $S _ { 2 }$ and, vice versa, that $\nu _ { 2 } \sim Q _ { 2 }$ is independent from the batch $S _ { 1 } { } ^ { 1 }$ , i.e., $\mathcal { G } _ { 1 }$ ⊥⊥ $\sigma ( S _ { 2 } )$ and $\mathcal { G } _ { 2 }$ ⊥⊥ $\sigma ( S _ { 1 } )$ . + +Theorem 1. For any $\delta \in ( 0 , 1 ]$ , with probability at least $1 - \delta$ over the sampling of sets $S _ { 1 }$ and $S _ { 2 }$ , the sum of the expected penalties conditional on $S _ { 1 }$ and $S _ { 2 }$ , respectively, satisfies + +$$ +\mathbb { E } \left[ \mathcal { R } _ { 1 } \right] + \mathbb { E } \left[ \mathcal { R } _ { 2 } \right] \leq \sqrt { \frac { 2 K L ( Q _ { 2 } | | Q _ { 1 } ) + 2 \ln \frac { 2 m _ { 2 } } { \delta } } { m _ { 2 } - 2 } } + \sqrt { \frac { 2 K L ( Q _ { 1 } | | Q _ { 2 } ) + 2 \ln \frac { 2 m _ { 1 } } { \delta } } { m _ { 1 } - 2 } } . +$$ + +Theorem 1, whose proof is given in Appendix $\mathbf { B }$ , shows why generalization penalties are better suited to our setting where the two batches $S _ { 1 }$ and $S _ { 2 }$ are both drawn from the training set $S$ than the usual generalization errors. After an iteration, the network learns a posterior distribution $Q _ { 1 }$ on its parameters from $S _ { 1 }$ , yielding to the parameter vector $\nu _ { 1 } \sim Q _ { 1 }$ . The expected generalization error at that time is defined as $\mathrm { G E } _ { 1 } = \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ L ( h _ { \nu _ { 1 } } ) \right] - \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ L _ { S _ { 1 } } ( h _ { \nu _ { 1 } } ) \right]$ . In practice, $L ( h _ { \nu _ { 1 } } )$ is estimated by the test loss over a batch of unseen data, which is independent from $\nu _ { 1 } \sim Q _ { 1 }$ . If $S _ { 2 }$ is this batch, then2 $\mathrm { G E } _ { 1 } \approx \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ L _ { S _ { 2 } } ( h _ { \nu _ { 1 } } ) \right] - \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ L _ { S _ { 1 } } ( h _ { \nu _ { 1 } } ) \right]$ . However, this estimate requires to set $S _ { 2 }$ aside from $S$ not only during that step but also during all the previous steps, because otherwise the model $h _ { \nu _ { 1 } }$ would not be independent from $S _ { 2 }$ , making the estimate of $\mathrm { G E _ { 1 } }$ biased. Therefore $S _ { 2 }$ must be sampled from the validation set, and cannot be used during training. In contrast, Theorem 1 is valid even if the trained model $h _ { \nu _ { 1 } }$ depends on the samples within the batch $S _ { 2 }$ . Therefore, the bound on the sum of the (expected) generalization penalties does no longer require to set $S _ { 2 }$ aside from $S$ in previous iterations; all data previously reserved for validation can now be used for training. This is what makes these penalties appealing to measure generalization especially when the available dataset is limited and/or noisy, as we will see in Section 5. + +Theorem 1 remains valid if batch $S _ { 2 }$ was sampled from the validation set, in which case it can be compared with known generalization error (GE) bounds, as now $h _ { \nu _ { 1 } }$ does not depend on samples of $S _ { 2 }$ . Similarly to $\mathrm { G E _ { 1 } }$ , let $\mathrm { G E _ { 2 } }$ be the generalization error when $S _ { 2 }$ is the training set, while $S _ { 1 }$ is the test set. By adding $\mathrm { G E _ { 1 } }$ and $\mathrm { G E _ { 2 } }$ we obtain $\mathbb { E } \left[ \mathcal { R } _ { 1 } \right] + \mathbb { E } \left[ \mathcal { R } _ { 2 } \right]$ , hence Theorem 1 also upper bounds an estimate of $\mathrm { G E _ { 1 } + G E _ { 2 } }$ . We could have obtained another upper bound by directly applying the bounds from (McAllester, 2003; Neyshabur et al., 2017b), which gives + +$$ +\mathbb { E } \left[ \mathcal { R } _ { 1 } \right] + \mathbb { E } \left[ \mathcal { R } _ { 2 } \right] \leq 2 \sqrt { \frac { 2 \mathrm { K L } ( Q _ { 2 } | | P ) + 2 \ln \frac { 2 m _ { 2 } } { \delta } } { m _ { 2 } - 1 } } + 2 \sqrt { \frac { 2 \mathrm { K L } ( Q _ { 1 } | | P ) + 2 \ln \frac { 2 m _ { 1 } } { \delta } } { m _ { 1 } - 1 } } . +$$ + +The main difference between Equations (3) and (4) is that the former needs the difference only between the two posterior distributions, $Q _ { 1 }$ and $Q _ { 2 }$ , whereas the latter requires the difference between the prior distribution $P$ and the posterior distributions $Q _ { 1 }$ and $Q _ { 2 }$ . Besides the minor difference of the multiplicative factor 2, the upper bound in Equation (3) is non-vacuous for a larger class of distributions than the upper bound in Equation (4): When $Q _ { 1 }$ and $Q _ { 2 }$ are close to each other but not to $P$ , the upper bound in Equation (3) is much tighter than the one in Equation (4). Moreover, in the next section, we show that, under reasonable assumptions, the upper bound in Equation (3) boils down to a very tractable generalization metric that we call gradient disparity. + +# 4 GRADIENT DISPARITY + +The randomness modeled by $u _ { i }$ , conditioned on the current batch $S _ { i }$ , comes from (i) the parameter vector at the beginning of the iteration $w$ , which itself comes from the random parameter initialization and the stochasticity of the parameter updates until that iteration, and (ii) the gradient vector $\nabla L _ { S _ { i } }$ , which may also be random because of the possible additional randomness in the network structure due for instance to dropout (Srivastava et al., 2014). A common assumption made in the literature is that the random perturbation $u _ { i }$ follows a normal distribution (Bellido & Fiesler, 1993; Neyshabur et al., 2017b). The upper bound in Theorem 1 takes a particularly simple form if we assume that for $i \in \{ 1 , 2 \}$ the random perturbations $u _ { i }$ are zero mean i.i.d. normal distributions $( u _ { i } \sim \mathcal { N } ( 0 , \sigma ^ { 2 } I ) )$ , and that $w _ { i }$ is fixed, as in the setting of (Dziugaite & Roy, 2017). ${ \mathrm { K L } } ( Q _ { 1 } | | Q _ { 2 } )$ is then the KL-divergence between two multivariate normal distributions . + +Let us denote $\nabla L _ { S _ { 1 } } ( h _ { w } )$ by $g _ { 1 } \in \mathbb { R } ^ { d }$ and $\nabla L _ { S _ { 2 } } ( h _ { w } )$ by $g _ { 2 } \in \mathbb { R } ^ { d }$ . As $w _ { i } = w - \gamma g _ { i }$ for $i \in \{ 1 , 2 \}$ , the KL-divergence between $\bar { Q } _ { 1 } = \mathcal { N } ( w _ { 1 } , \sigma ^ { 2 } I ) \bar { }$ and $Q _ { 2 } \stackrel { \cdot } { = } \mathcal { N } ( w _ { 2 } , \sigma ^ { 2 } I )$ (Lemma 1 in Appendix A) is simply + +$$ +\mathrm { K L } ( Q _ { 1 } | | Q _ { 2 } ) = \frac { 1 } { 2 } \frac { \gamma ^ { 2 } } { \sigma ^ { 2 } } \left. g _ { 1 } - g _ { 2 } \right. _ { 2 } ^ { 2 } = \mathrm { K L } ( Q _ { 2 } | | Q _ { 1 } ) , +$$ + +which shows that, keeping a constant step size $\gamma$ and assuming the same variance for the random perturbations $\sigma ^ { 2 }$ in all the steps of the training, the bound in Theorem 1 is driven by $\lVert g _ { 1 } - g _ { 2 } \rVert _ { 2 }$ . + +This indicates that the smaller the $\ell _ { 2 }$ distance between gradient vectors is, the lower the upper bound on the generalization penalty is, and therefore the closer the performance of a model trained on one batch is to a model trained on another batch. + +For two batches of points $S _ { i }$ and $S _ { j }$ , with gradient vectors $g _ { i }$ and $g _ { j }$ , respectively, we define the gradient disparity (GD) between $S _ { i }$ and $S _ { j }$ as + +$$ +\mathcal { D } _ { i , j } = \| g _ { i } - g _ { j } \| _ { 2 } . +$$ + +Gradient disparity is empirically tractable, and provides a probabilistic guarantee on the sum of the generalization penalties of $S _ { i }$ and $S _ { j }$ , modulo the Gaussianity assumptions made in this section. Gradient disparity can be computed within batches of the training or the validation set. As discussed in Section 3, we focus on the first case to have a generalization metric that does not require validation data and that provides an early stopping criterion with all the available data used for training. + +We focus on the vanilla SGD optimizer. In Appendix G, we extend the analysis to other adaptive optimizers: SGD with momentum (Qian, 1999), Adagrad (Duchi et al., 2011), Adadelta (Zeiler, 2012), and Adam (Kingma & Ba, 2014). In all these optimizers, we observe that gradient disparity (Equation (6)) appears in ${ \mathrm { K L } } ( Q _ { 1 } | | Q _ { 2 } )$ with other factors that depend on a decaying average of past gradient vectors. Experimental results support the use of gradient disparity as an early stopping metric also for these popular optimizers (see Figure 22 in Appendix G). + +Computing the gradient disparity averaged over $B$ batches requires all the $B$ gradient vectors at each iteration, which is computationally expensive if $B$ is large. We approximate it by computing it over only a much smaller subset of the batches, of size $s \ll B$ , $\begin{array} { r } { \overline { { \mathcal { D } } } \overset { } { = } \sum _ { i = 1 } ^ { s } \sum _ { j = 1 , j \neq i } ^ { s } \tilde { \mathcal { D } _ { i , j } } / s ( s - 1 ) } \end{array}$ . In the experiments presented in this paper, $s = 5$ ; we observed that such a small subset is already sufficient (see Appendix C.2 for an experimental comparison of different values of $s$ ). We also present an alternative approach that relies on the distribution of gradient disparity instead of its average in Appendix F to have a finer-grain signal of overfitting. + +As training progresses, the gradient magnitude starts to decrease, and therefore the value of gradient disparity might decrease not necessarily because the distance between two gradient vectors is decreasing, but because their magnitudes are decreasing. Hence, in order to compare different stages of training, we re-scale the loss values within each batch, before computing gradient disparity in $\overline { { \mathcal { D } } }$ (refer to Appendix C.1 for more details). Moreover, we consider the mean square error (MSE) for the choice of the surrogate loss in Appendix C.3 and we observe that gradient disparity is positively correlated with the MSE test loss as well. + +# 5 GRADIENT DISPARITY AS AN EARLY STOPPING CRITERION + +Comparison to $k$ -fold Cross Validation. Early stopping is a popular technique used in practice to avoid overfitting (Prechelt, 1998; Yao et al., 2007; Gu et al., 2018). The optimization is stopped when the performance of the model on a validation set starts to diverge from its performance on the training set. Early stopping is of particular interest in the presence of label noise, because the model first learns the samples with correct labels, and next the corrupted samples (Li et al., 2019). To emphasize the particular application of gradient disparity, we compare it to $k$ -fold cross validation in two settings: (i) when the available dataset is limited and (ii) when the available dataset has corrupted labels. We simulate the limited data scenario by using a small subset of three image classification benchmark datasets: MNIST, CIFAR-10 and CIFAR-100, and the noisy labeled data scenario is simulated by using a corrupted version of these datasets. We also evaluate gradient disparity on a medical dataset (MRNet dataset) with limited available data and in this setting, we use the entire dataset for training. + +(i) We compare gradient disparity with $k$ -fold cross validation (Stone, 1974) used as an early stopping criterion in Table 2 (top) when there is limited labeled data. We observe that gradient disparity performs well as an early stopping criterion, especially when the data is complex (CIFAR-100 is more complex than CIFAR-10). As it uses every available sample, instead of only a $1 - 1 / k$ portion of the dataset, it results in a better performance on the final unseen (test) data (see also Table 4 and Figure 8 in Appendix D). + +In many real-world applications, collecting (labeled) data is very costly. In some medical applications, it requires high costs of patient data collection and medical staff expertise. For an example of such an application, we consider the MRNet dataset (Bien et al., 2018), which contains limited number of MRI scans to study the presence of abnormally, ACL tears and meniscal tears in knee injuries. We observe that using gradient disparity instead of a validation set, results in over $1 \%$ improvement (on average over all three tasks) in the test AUC score, and therefore additional correct detection for more than one patient for each task (see Table 1 and Figure 10 in Appendix D). + +(ii) When the labels of the available data are noisy, the validation set is no longer a reliable estimate of the unseen set (this can be clearly observed in Figure 9 (left column)). Nevertheless, and although it is computed over the noisy training set, gradient disparity reflects the performance on the test set quite well (Figure 9 (middle left column)). As a result (see Table 2 (bottom)), gradient disparity performs better than $k$ -fold cross validation as an early stopping criterion. The same applies to two other datasets (see Table 6 and Figure 9 in Appendix D). + +
Label noiseMethodTest lossTest accuracy Top-5 test accuracy
0%5-fold CVGD4.249 ± 0.0284.057 ± 0.0436.79 ± 0.499.99 ± 0.9222.19 ± 0.7727.84 ± 1.30
50%10-fold CVGD5.023 ± 0.0834.463 ± 0.0381.59 ± 0.153.68 ± 0.526.47 ± 0.5215.22 ± 1.24
+ +Table 2: The final test loss and accuracy when using gradient disparity (GD) and $k$ -fold cross validation (CV) as early stopping criteria, (top) when the available dataset is limited and (bottom) when the available data has noisy labeled samples. To simulate a limited-data scenario, we consider as a training set a subset of 1280 samples of the CIFAR-100 dataset. The configurations in the top row and the bottom row are ResNet-34 and ResNet-18, respectively. In both methods, the optimization is stopped when the metric (validation loss or GD) increases for 5 epochs. + +![](images/b615e2428f50a187c05f725d09643f52905fdd6e8e5a3c20aa1c020fd7ed6ca3.jpg) +6 VALIDATING GRADIENT DISPARITY AS A GENERALIZATION METRIC +Figure 2: The error percentage and $\overline { { \mathcal { D } } }$ during training with different amounts of randomness in the training labels for an AlexNet trained on a subset of $1 2 . 8 \mathrm { ~ k ~ }$ points of the MNIST training dataset. Pearson’s correlation coefficient between gradient disparity and test error (TE)/test loss (TL) over all the iterations and over all levels of randomness are $\rho _ { \overline { { D } } , \mathrm { T E } } = 0 . 8 6 1$ and $\rho _ { \overline { { D } } , \mathrm { T L } } = 0 . 8 0 2$ . The generalization error (gap) is the difference between the train and test errors. + +In this section, we demonstrate that factors that contribute to improve or degrade the generalization performance of a model (e.g., label noise level, training set size and batch size), have an often strikingly similar effect on the value of gradient disparity as well. + +Label Noise Level. Deep neural networks, trained with the SGD algorithm, achieve excellent generalization performance (Hardt et al., 2015), while achieving zero training error on randomly labeled data in classification tasks (Zhang et al., 2016). Understanding what distinguishes the model when it is trained on correct labels and when it is trained on randomly labeled data is still an evolving area of research. We conjecture that as label noise level increases, the gradient vectors diverge more. Hence, when the network is trained with correctly labeled samples, the gradient disparity is low, whereas when it is trained with corrupted samples the gradient disparity is high. The experimental results support this conjecture in a wide range of settings and show that gradient disparity is indeed very sensitive to label noise level (see also Figures 12, 15, 19 and 20). + +Figure 2 shows the test error for networks trained with different amounts of label noise. Interestingly, observe that for this setting the test error for the network trained with $7 5 \%$ label noise remains relatively small, indicating the good resistance of the model against memorization of corrupted samples. As suggested both from the test error (Figure 2 (a)) and the average gradient disparity (Figure 2 (c)), there is no proper early stopping time for these experiments. The generalization error (Figure 2 (b)) remains close to zero, regardless of the level of label noise, and hence fails to account for label noise. In contrast, the average gradient disparity is very sensitive to the label noise level in all stages of training as shown in Figure 2 (c), as desired for a metric measuring generalization. + +Training Set Size. The test error decreases with the size of the training set (Figure 3 (left)) and a reliable generalization metric should therefore reflect this property. Many of the previous metrics fail to do so, as shown by (Neyshabur et al., 2017a; Nagarajan & Kolter, 2019). In contrast, the average gradient disparity indeed clearly decreases with the size of the training set, as shown in Figure 3 (right) (see also Figure 17 in Appendix E). + +Batch Size. In practice, the test error increases with the batch size (Figure 4 (left)). We observe that gradient disparity also increases with the batch size (Figure 4 (right)). This observation is counter-intuitive because one might expect that gradient vectors get more similar when they are averaged over a larger batch. This might be the explanation behind the decrease in gradient disparity from batch size 256 to 512 for the VGG19 network. Observe also that gradient disparity correctly predicts that VGG-19 generalizes better than ResNet-34 for this dataset. Gradient disparity matches the ranking of test errors for different networks, trained with different batch sizes, as long as the batch sizes are not too large (see also Figure 18 in Appendix E). + +Width. In practice, the test error has been observed to decrease with the network width. We + +![](images/db450df886d058c290711b4a230906804ee0fb34db7654ec52da7ad44e2f65e3.jpg) +Figure 3: The test error (TE) and average gradient disparity $( \overline { { \mathcal { D } } } )$ for networks that are trained (until reaching the training loss value of 0.01) over training sets with different sizes. We observe a very strong positive correlation: $\rho _ { \overline { { D } } , \mathrm { T E } } = 0 . 9 8 4$ . + +![](images/4e6ec1b225122db40a09ebb9b563e856f3acbe204424cde7192fd84787dd7fb2.jpg) +Figure 4: The test error and average gradient disparity for networks that are trained with different batch sizes. A ResNet-34 and a VGG-19 network that are trained on the CIFAR-10 dataset. The correlation between $\overline { { \mathcal { D } } }$ and test error (TE) for ResNet-34, VGG-19, and both graphs combined are $\rho _ { \overline { { D } } , \mathrm { T E } } = 0 . 9 8 5$ , $\rho _ { \overline { { \mathcal { D } } } , \mathrm { T E } } = 0 . 9 2 6$ , and $\rho _ { \overline { { D } } , \mathrm { T E } } = 0 . 8 9 3$ , respectively. + +observe that gradient disparity (normalized with respect to the number of parameters) also decreases with network width for ResNet, VGG and fully connected neural networks that are trained on the CIFAR-10 dataset (see Figure 14 in Appendix E.2). + +# 7 DISCUSSION AND RELATED WORK + +Finding a practical metric that completely captures the generalization properties of deep neural networks, and in particular indicates the level of randomness in the labels and decreases with the size of the training set, is still an active research direction (Dziugaite & Roy, 2017; Neyshabur et al., 2017a; Nagarajan & Kolter, 2019). A very recent line of work assesses the similarity between the gradient updates of two batches (samples) in the training set. The coherent gradient hypothesis (Chatterjee, 2020) states that the gradient is stronger in directions where similar examples exist and towards which the parameter update is biased. He & Su (2020) presents the local elasticity phenomenon, which measures how prediction over one sample changes, as the network is updated on another sample. The generalization penalty introduced in our work measures how the prediction over one sample (batch) changes when the network is updated on the same sample instead of being updated on another sample, which can signal overfitting implicitly within the training set. + +Tracking generalization by measuring the similarity between gradient vectors is particularly beneficial as it is empirically tractable during training and does not require access to unseen data. Sankararaman et al. (2019) proposes gradient confusion, which is a bound on the inner product of two gradient vectors, and shows that the larger the gradient confusion is, the slower the convergence takes place. Gradient interference (when the inner product of gradient vectors is negative) has been studied in multi-task learning, reinforcement learning and temporal difference learning (Riemer et al., 2018; Liu et al., 2019; Bengio et al., 2020). Yin et al. (2017) studies the relation between gradient diversity, which measures the dissimilarity between gradient vectors, and the convergence performance of distributed SGD algorithms. Fort et al. (2019) proposes a metric called stiffness, which is the cosine similarity between two gradient vectors, and shows empirically that it is related to generalization. Fu et al. (2020) studies the cosine similarity between two gradient vectors for natural language processing tasks. Mehta et al. (2020) measures the alignment between the gradient vectors within the same class (denoted by $\Omega _ { c , - }$ ), and studies the relation between $\Omega _ { c }$ and generalization as the scale of initialization is increased. + +Another interesting line of work is the study of the variance of gradients in deep learning settings. Negrea et al. (2019) derives mutual information generalization error bounds for stochastic gradient Langevin dynamics (SGLD) as a function of the sum (over the iterations) of square gradient incoherences, which is closely related to gradients variance. Two-sample gradient incoherences also appear in Haghifam et al. (2020), there are taken between a training sample and a ”ghost” sample that is not used during training and therefore taken from a validation set (unlike gradient disparity). The upper bounds in Negrea et al. (2019); Haghifam et al. (2020) are not intended to be used as early stopping criteria and are cumulative bounds that increase with the number of iterations. As shown in Appendix G, gradient disparity can be used as an early stopping criterion not only for SGD with additive noise (such as SGLD), but also other adaptive optimizers. Jastrzebski et al. (2020) studies the effect of the learning rate on the variance of gradients and hypothesizes that gradient variance counter-intuitively increases with the batch size, which is consistent with our observations. However, Qian & Klabjan (2020) shows that the variance of gradients is a decreasing function of the batch size. Jastrzebski et al. (2020); Qian & Klabjan (2020) mention the connection between variance of gradients and generalization as promising future directions. Our study shows that variance of gradients used as an early stopping criterion outperforms $k$ -fold cross validation (see Table 8). + +Mahsereci et al. (2017) proposes an early stopping criterion called evidence-based criterion (EB) that eliminates the need for a held-out validation set, similarly to gradient disparity. The EB-criterion is negatively related to the signal-to-noise ratio (SNR) of the gradient vectors. Liu et al. (2020) also proposes a relation between gradient SNR (called GSNR) and the one-step generalization error, with the assumption that both the training and the test sets are large, whereas gradient disparity targets limited datasets. Nevertheless, we have compared gradient disparity to these metrics (namely, EB, GSNR, gradient inner product, sign of the gradient inner product, variance of gradients, cosine similarity, and $\Omega _ { c , - }$ ) in Appendix H. In Table 8, we observe that gradient disparity and variance of gradients used as early stopping criteria are the only metrics that consistently outperform $k$ -fold cross validation, and that are more informative of the level of label noise compared to other metrics. We observe that the correlation between gradient disparity and the test loss is however in general larger than the correlation between variance of gradients and the test loss (Table 9). + +A common drawback of the metrics based on the similarity between two gradient vectors, including gradient disparity, is that they are not informative when the gradient vectors are very small. In practice however, we observe (see for instance Figure 13) that the time at which the test and training losses start to diverge, which is the time when overfitting kicks in, does not only coincide with the time at which gradient disparity increases, but also occurs much before the training loss becomes infinitesimal. Hence, this drawback is unlikely to cause a problem for gradient disparity when it is used as an early stopping criterion. Nevertheless, Theorem 1 trivially holds when the gradient values are infinitesimal. + +Conclusion. In this work, we propose gradient disparity, which is the $\ell _ { 2 }$ norm of the difference between the gradient vectors of pairs of batches in the training set. Our empirical results on state-ofthe-art configurations show indeed a strong link between gradient disparity and generalization error. Gradient disparity, similar to the test error, increases with the label noise level, decreases with the size of the training set and increases with the batch size. We therefore suggest, particularly when the available dataset is limited or noisy, gradient disparity as a promising early stopping criterion that does not require access to a validation set. + +# REFERENCES + +I Bellido and Emile Fiesler. Do backpropagation trained neural networks have normal weight distributions? In International Conference on Artificial Neural Networks, pp. 772–775. Springer, 1993. + +Emmanuel Bengio, Joelle Pineau, and Doina Precup. Interference and generalization in temporal difference learning. arXiv preprint arXiv:2003.06350, 2020. + +Nicholas Bien, Pranav Rajpurkar, Robyn L Ball, Jeremy Irvin, Allison Park, Erik Jones, Michael Bereket, Bhavik N Patel, Kristen W Yeom, Katie Shpanskaya, et al. Deep-learning-assisted diagnosis for knee magnetic resonance imaging: development and retrospective validation of mrnet. PLoS medicine, 15(11):e1002699, 2018. + +Sat Chatterjee. Coherent gradients: An approach to understanding generalization in gradient descent-based optimization. In International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id $=$ ryeFY0EFwS. + +John Duchi, Elad Hazan, and Yoram Singer. Adaptive subgradient methods for online learning and stochastic optimization. Journal of machine learning research, 12(Jul):2121–2159, 2011. + +Gintare Karolina Dziugaite and Daniel M Roy. Computing nonvacuous generalization bounds for deep (stochastic) neural networks with many more parameters than training data. arXiv preprint arXiv:1703.11008, 2017. + +Gintare Karolina Dziugaite, Kyle Hsu, Waseem Gharbieh, and Daniel M Roy. On the role of data in pac-bayes bounds. arXiv preprint arXiv:2006.10929, 2020. + +Stanislav Fort, Paweł Krzysztof Nowak, Stanislaw Jastrzebski, and Srini Narayanan. Stiffness: A new perspective on generalization in neural networks. arXiv preprint arXiv:1901.09491, 2019. + +Jinlan Fu, Pengfei Liu, Qi Zhang, and Xuanjing Huang. Rethinking generalization of neural models: A named entity recognition case study. arXiv preprint arXiv:2001.03844, 2020. + +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. + +Jiuxiang Gu, Zhenhua Wang, Jason Kuen, Lianyang Ma, Amir Shahroudy, Bing Shuai, Ting Liu, Xingxing Wang, Gang Wang, Jianfei Cai, et al. Recent advances in convolutional neural networks. Pattern Recognition, 77:354–377, 2018. + +Mahdi Haghifam, Jeffrey Negrea, Ashish Khisti, Daniel M Roy, and Gintare Karolina Dziugaite. Sharpened generalization bounds based on conditional mutual information and an application to noisy, iterative algorithms. arXiv preprint arXiv:2004.12983, 2020. + +Moritz Hardt, Benjamin Recht, and Yoram Singer. Train faster, generalize better: Stability of stochastic gradient descent. arXiv preprint arXiv:1509.01240, 2015. + +Hangfeng He and Weijie Su. The local elasticity of neural networks. In International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id $=$ HJxMYANtPH. + +Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Delving deep into rectifiers: Surpassing human-level performance on imagenet classification. In Proceedings of the IEEE international conference on computer vision, pp. 1026–1034, 2015. + +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. + +Like Hui and Mikhail Belkin. Evaluation of neural architectures trained with square loss vs crossentropy in classification tasks. arXiv preprint arXiv:2006.07322, 2020. + +Stanislaw Jastrzebski, Maciej Szymczak, Stanislav Fort, Devansh Arpit, Jacek Tabor, Kyunghyun Cho, and Krzysztof Geras. The break-even point on optimization trajectories of deep neural networks. arXiv preprint arXiv:2002.09572, 2020. + +Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. + +Douglas M Kline and Victor L Berardi. Revisiting squared-error and cross-entropy functions for training neural network classifiers. Neural Computing & Applications, 14(4):310–318, 2005. + +Alex Krizhevsky, Ilya Sutskever, and Geoffrey E Hinton. Imagenet classification with deep convolutional neural networks. In Advances in neural information processing systems, pp. 1097–1105, 2012. + +Mingchen Li, Mahdi Soltanolkotabi, and Samet Oymak. Gradient descent with early stopping is provably robust to label noise for overparameterized neural networks. arXiv preprint arXiv:1903.11680, 2019. + +Jinlong Liu, Yunzhi Bai, Guoqing Jiang, Ting Chen, and Huayan Wang. Understanding why neural networks generalize well through gsnr of parameters. In International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id $\underline { { \underline { { \mathbf { \Pi } } } } } = \underline { { \underline { { \mathbf { \delta \pi } } } } }$ HyevIJStwH. + +Vincent Liu, Hengshuai Yao, and Martha White. Toward understanding catastrophic interference in value-based reinforcement learning. Optimization Foundations for Reinforcement Learning Workshop at NeurIPS, 2019. + +Maren Mahsereci, Lukas Balles, Christoph Lassner, and Philipp Hennig. Early stopping without a validation set. arXiv preprint arXiv:1703.09580, 2017. + +David McAllester. Simplified pac-bayesian margin bounds. In Learning theory and Kernel machines, pp. 203–215. Springer, 2003. + +David A McAllester. Pac-bayesian model averaging. In Proceedings of the twelfth annual conference on Computational learning theory, pp. 164–170, 1999a. + +David A McAllester. Some pac-bayesian theorems. Machine Learning, 37(3):355–363, 1999b. + +Harsh Mehta, Ashok Cutkosky, and Behnam Neyshabur. Extreme memorization via scale of initialization. arXiv preprint arXiv:2008.13363, 2020. + +Vaishnavh Nagarajan and J Zico Kolter. Uniform convergence may be unable to explain generalization in deep learning. In Advances in Neural Information Processing Systems, pp. 11611–11622, 2019. + +Jeffrey Negrea, Mahdi Haghifam, Gintare Karolina Dziugaite, Ashish Khisti, and Daniel M Roy. Information-theoretic generalization bounds for sgld via data-dependent estimates. In Advances in Neural Information Processing Systems, pp. 11013–11023, 2019. + +Behnam Neyshabur, Srinadh Bhojanapalli, David McAllester, and Nati Srebro. Exploring generalization in deep learning. In Advances in Neural Information Processing Systems, pp. 5947–5956, 2017a. + +Behnam Neyshabur, Srinadh Bhojanapalli, and Nathan Srebro. A pac-bayesian approach to spectrally-normalized margin bounds for neural networks. arXiv preprint arXiv:1707.09564, 2017b. + +Lutz Prechelt. Early stopping-but when? In Neural Networks: Tricks of the trade, pp. 55–69. Springer, 1998. + +Ning Qian. On the momentum term in gradient descent learning algorithms. Neural networks, 12 (1):145–151, 1999. + +Xin Qian and Diego Klabjan. The impact of the mini-batch size on the variance of gradients in stochastic gradient descent. arXiv preprint arXiv:2004.13146, 2020. + +Matthew Riemer, Ignacio Cases, Robert Ajemian, Miao Liu, Irina Rish, Yuhai Tu, and Gerald Tesauro. Learning to learn without forgetting by maximizing transfer and minimizing interference. arXiv preprint arXiv:1810.11910, 2018. + +Yuji Roh, Geon Heo, and Steven Euijong Whang. A survey on data collection for machine learning: a big data-ai integration perspective. IEEE Transactions on Knowledge and Data Engineering, 2019. + +Sebastian Ruder. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747, 2016. + +Karthik A Sankararaman, Soham De, Zheng Xu, W Ronny Huang, and Tom Goldstein. The impact of neural network overparameterization on gradient confusion and stochastic gradient descent. arXiv preprint arXiv:1904.06963, 2019. + +Karen Simonyan and Andrew Zisserman. Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556, 2014. + +Daniel Soudry, Elad Hoffer, Mor Shpigel Nacson, Suriya Gunasekar, and Nathan Srebro. The implicit bias of gradient descent on separable data. The Journal of Machine Learning Research, 19 (1):2822–2878, 2018. + +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. + +Mervyn Stone. Cross-validatory choice and assessment of statistical predictions. Journal of the Royal Statistical Society: Series B (Methodological), 36(2):111–133, 1974. + +Yuan Yao, Lorenzo Rosasco, and Andrea Caponnetto. On early stopping in gradient descent learning. Constructive Approximation, 26(2):289–315, 2007. + +Dong Yin, Ashwin Pananjady, Max Lam, Dimitris Papailiopoulos, Kannan Ramchandran, and Peter Bartlett. Gradient diversity: a key ingredient for scalable distributed learning. arXiv preprint arXiv:1706.05699, 2017. + +Matthew D Zeiler. Adadelta: an adaptive learning rate method. arXiv preprint arXiv:1212.5701, 2012. + +Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, and Oriol Vinyals. Understanding deep learning requires rethinking generalization. arXiv preprint arXiv:1611.03530, 2016. + +# A ADDITIONAL THEOREM + +Hoeffding’s bound is used in the proof of Theorem 1, and Lemma 1 is used in Section 4. + +Theorem 2 (Hoeffding’s Bound). Let $Z _ { 1 } , \cdots , Z _ { n }$ be independent bounded random variables on $[ a , b ]$ (i.e., $Z _ { i } \in [ a , b ]$ for all $1 \leq i \leq n$ with $- \infty < a \le b < \infty ,$ ). Then + +$$ +\mathbb { P } \left( { \frac { 1 } { n } } \sum _ { i = 1 } ^ { n } \left( Z _ { i } - \mathbb { E } [ Z _ { i } ] \right) \geq t \right) \leq \exp \left( - { \frac { 2 n t ^ { 2 } } { ( b - a ) ^ { 2 } } } \right) +$$ + +and + +$$ +\mathbb { P } \left( \frac { 1 } { n } \sum _ { i = 1 } ^ { n } \left( Z _ { i } - \mathbb { E } [ Z _ { i } ] \right) \leq - t \right) \leq \exp \left( - \frac { 2 n t ^ { 2 } } { ( b - a ) ^ { 2 } } \right) +$$ + +for all $t \geq 0$ . + +Lemma 1 If $N _ { 1 } = \mathcal { N } ( \mu _ { 1 } , \Sigma _ { 1 } )$ and $N _ { 2 } = \mathcal { N } ( \mu _ { 2 } , \Sigma _ { 2 } )$ are two multivariate normal distributions in $\mathbb { R } ^ { d }$ , where $\Sigma _ { 1 }$ and $\Sigma _ { 2 }$ are positive definite, + +$$ +\mathrm { K L } ( N _ { 1 } | | N _ { 2 } ) = \frac { 1 } { 2 } \left( \mathrm { t r } \left( \Sigma _ { 2 } ^ { - 1 } \Sigma _ { 1 } \right) - d + ( \mu _ { 2 } - \mu _ { 1 } ) ^ { T } \Sigma _ { 2 } ^ { - 1 } ( \mu _ { 2 } - \mu _ { 1 } ) + \ln \left( \frac { \operatorname * { d e t } \Sigma _ { 2 } } { \operatorname * { d e t } \Sigma _ { 1 } } \right) \right) . +$$ + +# B PROOF OF THEOREM 1 + +Proof. We compute the upper bound in Equation (3) using a similar approach as in McAllester (2003). The main challenge in the proof is the definition of a function $X _ { S _ { 2 } }$ of the variables and parameters of the problem, which can then be bounded using similar techniques as in McAllester (2003). $S _ { 1 }$ is a batch of points (with size $m _ { 1 }$ ) that is randomly drawn from the available set $S$ at the beginning of iteration $t$ , and $S _ { 2 }$ is a batch of points (with size $m _ { 2 }$ ) that is randomly drawn from the remaining set $S \setminus S _ { 1 }$ . Hence, $S _ { 1 }$ and $S _ { 2 }$ are drawn from the set $S$ without replacement $( S _ { 1 } \cap S _ { 2 } = \emptyset )$ . Similar to the setting of Negrea et al. (2019); Dziugaite et al. (2020), as the random selection of indices of $S _ { 1 }$ and $S _ { 2 }$ is independent from the dataset $S$ , $\sigma ( S _ { 1 } )$ ⊥⊥ $\sigma ( S _ { 2 } )$ , and as a result, $\mathcal { G } _ { 1 } \perp \perp \sigma ( S _ { 2 } )$ and $\mathcal { G } _ { 2 }$ ⊥⊥ $\sigma ( S _ { 1 } )$ . Recall that $\nu _ { i }$ is the random parameter vector at the end of iteration $t$ that depends on $S _ { i }$ , for $i \in \{ 1 , 2 \}$ . For a given sample set $S _ { i }$ , denote the conditional probability distribution of $\nu _ { i }$ by $Q _ { S _ { i } }$ . For ease of notation, we represent $Q _ { S _ { i } }$ by $Q _ { i }$ . + +Let us denote + +$$ +\Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } \right) \triangleq \left( L _ { S _ { 2 } } ( h _ { \nu _ { 1 } } ) - L ( h _ { \nu _ { 1 } } ) \right) - \left( L _ { S _ { 2 } } ( h _ { \nu _ { 2 } } ) - L ( h _ { \nu _ { 2 } } ) \right) , +$$ + +and + +$$ +X _ { S _ { 2 } } \triangleq \operatorname* { s u p } _ { Q _ { 1 } , Q _ { 2 } } ( \frac { m _ { 2 } } { 2 } - 1 ) \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } [ \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } [ ( \Delta ( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } ) ) ^ { 2 } ] ] - \mathrm { K L } ( Q _ { 2 } | | Q _ { 1 } ) . +$$ + +Note that $X _ { S _ { 2 } }$ is a random function of the batch $S _ { 2 }$ . Expanding the KL-divergence, we find that + +$$ +\begin{array} { r l } & { \left( \frac { m _ { 2 } } { 2 } - 1 \right) \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } \left[ ( \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } \right) ) ^ { 2 } \right] \right] - \operatorname { K L } ( Q _ { 2 } | | Q _ { 1 } ) } \\ & { \qquad = \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ \left( \frac { m _ { 2 } } { 2 } - 1 \right) \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } \left[ ( \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } \right) ) ^ { 2 } \right] + \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } \left[ \ln \frac { Q _ { 1 } \left( \nu _ { 2 } \right) } { Q _ { 2 } \left( \nu _ { 2 } \right) } \right] \right] } \\ & { \qquad \leq \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ \ln \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } \left[ e ^ { \left( \frac { m _ { 2 } } { 2 } - 1 \right) \left( \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } \right) \right) ^ { 2 } } \frac { Q _ { 1 } \left( \nu _ { 2 } \right) } { Q _ { 2 } \left( \nu _ { 2 } \right) } \right] \right] } \\ & { \qquad = \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ \ln \mathbb { E } _ { \nu _ { 1 } ^ { \prime } \sim Q _ { 1 } } \left[ e ^ { \left( \frac { m _ { 2 } } { 2 } - 1 \right) \left( \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 1 } ^ { \prime } } \right) \right) ^ { 2 } } \right] \right] , } \end{array} +$$ + +where the inequality above follows from Jensen’s inequality as logarithm is a concave function. Therefore, again by applying Jensen’s inequality + +$$ +X _ { S _ { 2 } } \leq \ln \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \mathbb { E } _ { \nu _ { 1 } ^ { \prime } \sim Q _ { 1 } } \left[ e ^ { ( \frac { m _ { 2 } } { 2 } - 1 ) \left( \Delta ( h _ { \nu _ { 1 } } , h _ { \nu _ { 1 } ^ { \prime } } ) \right) ^ { 2 } } \right] . +$$ + +Taking expectations over $S _ { 2 }$ , we have that + +$$ +\begin{array} { r l } & { \mathbb { E } _ { S _ { 2 } } \left[ e ^ { X _ { S _ { 2 } } } \right] \leq \mathbb { E } _ { S _ { 2 } } \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \mathbb { E } _ { \nu _ { 1 } ^ { \prime } \sim Q _ { 1 } } \left[ e ^ { \left( \frac { m _ { 2 } } { 2 } - 1 \right) \left( \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 1 } ^ { \prime } } \right) \right) ^ { 2 } } \right] } \\ & { \qquad = \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \mathbb { E } _ { \nu _ { 1 } ^ { \prime } \sim Q _ { 1 } } \mathbb { E } _ { S _ { 2 } } \left[ e ^ { \left( \frac { m _ { 2 } } { 2 } - 1 \right) \left( \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 1 } ^ { \prime } } \right) \right) ^ { 2 } } \right] , } \end{array} +$$ + +where the change of order in the expectation follows from the independence of the draw of the set $S _ { 2 }$ from $\nu _ { 1 } \sim Q _ { 1 }$ and $\nu _ { 1 } ^ { \prime } \sim Q _ { 1 }$ , i.e., $Q _ { 1 }$ is $\mathcal { G } _ { 1 }$ -measurable and $\mathcal { G } _ { 1 }$ ⊥⊥ $\sigma ( S _ { 2 } )$ . + +Now let + +$$ +Z _ { i } \triangleq l ( h _ { \nu _ { 1 } } ( x _ { i } ) , y _ { i } ) - l ( h _ { \nu _ { 1 } ^ { \prime } } ( x _ { i } ) , y _ { i } ) , +$$ + +for all $1 \leq i \leq m _ { 2 }$ . Clearly, $Z _ { i } \in [ - 1 , 1 ]$ and because of Equations (1) and of the definition of $\Delta$ in Equation (7), + +$$ +\Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 1 } ^ { \prime } } \right) = \frac { 1 } { m _ { 2 } } \sum _ { i = 1 } ^ { m _ { 2 } } \left( Z _ { i } - \mathbb { E } [ Z _ { i } ] \right) . +$$ + +Hoeffding’s bound (Theorem 2) implies therefore that for any $t \geq 0$ , + +$$ +\mathbb { P } _ { S _ { 2 } } \left( | \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 1 } ^ { \prime } } \right) | \geq t \right) \leq 2 e ^ { - \frac { m _ { 2 } } { 2 } t ^ { 2 } } . +$$ + +Denoting by $p ( \Delta )$ the probability density function of $| \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 1 } ^ { \prime } } \right) |$ , inequality (10) implies that for any $t \geq 0$ , + +$$ +\int _ { t } ^ { \infty } p ( \Delta ) d \Delta \leq 2 e ^ { - \frac { m _ { 2 } } { 2 } t ^ { 2 } } . +$$ + +The density $\tilde { p } ( \Delta )$ that maximizes $\begin{array} { r } { \int _ { 0 } ^ { \infty } e ^ { ( \frac { m _ { 2 } } { 2 } - 1 ) \Delta ^ { 2 } } p ( \Delta ) d \Delta } \end{array}$ (the term in the first expectation of the upper bound of Equation (9)), is the density achieving equality in (11), which is $\tilde { p } ( \Delta ) = 2 m _ { 2 } \Delta e ^ { - \frac { m _ { 2 } } { 2 } \Delta ^ { 2 } }$ . As a result, + +$$ +\mathbb { E } _ { S _ { 2 } } \left[ e ^ { ( \frac { m _ { 2 } } { 2 } - 1 ) \Delta ^ { 2 } } \right] \le \int _ { 0 } ^ { \infty } e ^ { ( \frac { m _ { 2 } } { 2 } - 1 ) \Delta ^ { 2 } } 2 m _ { 2 } \Delta e ^ { - \frac { m _ { 2 } } { 2 } \Delta ^ { 2 } } d \Delta = \int _ { 0 } ^ { \infty } 2 m _ { 2 } \Delta e ^ { - \Delta ^ { 2 } } d \Delta = m _ { 2 } \Delta . +$$ + +and consequently, inequality (9) becomes + +$$ +\mathbb { E } _ { S _ { 2 } } \left[ e ^ { X _ { S _ { 2 } } } \right] \leq m _ { 2 } . +$$ + +Applying Markov’s inequality on $X _ { S _ { 2 } }$ , we have therefore that for any $0 < \delta \leq 1$ , + +$$ +\mathbb { P } _ { S _ { 2 } } \left[ X _ { S _ { 2 } } \geq \ln \frac { 2 m _ { 2 } } { \delta } \right] = \mathbb { P } _ { S _ { 2 } } \left[ e ^ { X _ { S _ { 2 } } } \geq \frac { 2 m _ { 2 } } { \delta } \right] \leq \frac { \delta } { 2 m _ { 2 } } \mathbb { E } _ { S _ { 2 } } \left[ e ^ { X _ { S _ { 2 } } } \right] \leq \frac { \delta } { 2 } . +$$ + +Replacing $X _ { S _ { 2 } }$ by its expression defined in Equation (8), the previous inequality shows that with probability at least $1 - \delta / 2$ + +$$ +\left( \frac { m _ { 2 } } { 2 } - 1 \right) \ \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } \left[ ( \Delta ( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } ) ) ^ { 2 } \right] - \mathbf { K L } ( Q _ { 2 } | | Q _ { 1 } ) \leq \ln \frac { 2 m _ { 2 } } { \delta } . +$$ + +Using Jensen’s inequality and the convexity of $\left( \Delta ( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } ) \right) ^ { 2 }$ , and assuming that $m _ { 2 } \ > \ 2$ , we therefore have that with probability at least $1 - \delta / 2$ , + +$$ +( \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } [ \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } \right) ] ) ^ { 2 } \le \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } \left[ ( \Delta \left( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } \right) ) ^ { 2 } \right] \le \frac { \mathrm { K L } ( Q _ { 2 } | | Q _ { 1 } ) + \ln \frac { 2 m _ { 2 } } { \delta } } { \frac { m _ { 2 } } { 2 } - 1 } . +$$ + +Replacing $\Delta ( h _ { \nu _ { 1 } } , h _ { \nu _ { 2 } } )$ by its expression Equation (7) in the above inequality, yields that with probability at least $1 - \delta / 2$ over the choice of the sample set $S _ { 2 }$ , + +$$ +\mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ L _ { S _ { 2 } } ( h _ { \nu _ { 1 } } ) - L ( h _ { \nu _ { 1 } } ) \right] \le \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } \left[ L _ { S _ { 2 } } ( h _ { \nu _ { 2 } } ) - L ( h _ { \nu _ { 2 } } ) \right] + \sqrt { \frac { 2 { \mathrm { K L } } ( Q _ { 2 } | | Q _ { 1 } ) + 2 \ln \frac { 2 m _ { 2 } } { \delta } } { m _ { 2 } - 2 } } . +$$ + +Similar computations with $S _ { 1 }$ and $S _ { 2 }$ switched, and considering that $m _ { 1 } ~ > ~ 2$ , yields that with probability at least $1 - \delta / 2$ over the choice of the sample set $S _ { 1 }$ , + +$$ +\mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } \left[ L _ { S _ { 1 } } ( h _ { \nu _ { 2 } } ) - L ( h _ { \nu _ { 2 } } ) \right] \le \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } \left[ L _ { S _ { 1 } } ( h _ { \nu _ { 1 } } ) - L ( h _ { \nu _ { 1 } } ) \right] + \sqrt { \frac { 2 \mathrm { K L } ( Q _ { 1 } | | Q _ { 2 } ) + 2 \ln \frac { 2 m _ { 1 } } { \delta } } { m _ { 1 } - 2 } } . +$$ + +The events in Equations (12) and (13) jointly hold with probability at least $1 - \delta$ over the choice of the sample sets $S _ { 1 }$ and $S _ { 2 }$ (using the union bound and De Morgan’s law), and by adding the two inequalities we therefore have + +$$ +\begin{array} { r l } & { \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } [ L _ { S _ { 2 } } ( h _ { \nu _ { 1 } } ) ] + \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } [ L _ { S _ { 1 } } ( h _ { \nu _ { 2 } } ) ] \leq \mathbb { E } _ { \nu _ { 2 } \sim Q _ { 2 } } [ L _ { S _ { 2 } } ( h _ { \nu _ { 2 } } ) ] + \mathbb { E } _ { \nu _ { 1 } \sim Q _ { 1 } } [ L _ { S _ { 1 } } ( h _ { \nu _ { 1 } } ) ] } \\ & { \qquad + \sqrt { \frac { 2 \mathrm { K L } ( Q _ { 2 } \| Q _ { 1 } ) + 2 \mathrm { l n } \frac { 2 m _ { 2 } } { \delta } } { m _ { 2 } - 2 } } + \sqrt { \frac { 2 \mathrm { K L } ( Q _ { 1 } \| Q _ { 2 } ) + 2 \mathrm { l n } \frac { 2 m _ { 1 } } { \delta } } { m _ { 1 } - 2 } } , } \end{array} +$$ + +which concludes the proof. + +# C COMMON EXPERIMENTAL DETAILS + +The training objective in our experiments is to minimize the cross-entropy loss, and both the cross entropy and the error percentage are displayed. The training error is computed using Equation (1) over the training set. The empirical test error also follows Equation (1) but it is computed over the test set. The generalization loss (respectively, error) is the difference between the test and the training cross entropy losses (resp., classification errors). The batch size in our experiments is 128 unless otherwise stated, the SGD learning rate is $\gamma = 0 . 0 1$ and no momentum is used (unless otherwise stated). All the experiments took at most few hours on one Nvidia Titan X Maxwell GPU. All the reported values throughout the paper are an average over at least 5 runs. + +To present results throughout the training, in the $\mathbf { X }$ -axis of figures, both epoch and iteration are used: an epoch is the time spent to pass through the entire dataset, and an iteration is the time spent to pass through one batch of the dataset. Thus, each epoch has $B$ iterations, where $B$ is the number of batches. The convolutional neural network configurations we use are: AlexNet (Krizhevsky et al., 2012), VGG (Simonyan & Zisserman, 2014) and ResNet (He et al., 2016). In those experiments with varying width, we use a scaling factor to change both the number of channels and the number of hidden units in convolutional and fully connected layers, respectively. The default configuration is with scaling factor $= 1$ . + +In experiments with a random labeled training set, we modify the dataset similar to Chatterjee (2020). For a fraction of the training samples, which is the amount of noise $( 0 \%$ , $2 5 \%$ , $5 0 \%$ , $7 5 \%$ , $1 0 0 \%$ ), we choose the labels at random. For a classification dataset with a number $k$ of classes, if the label noise is $2 5 \%$ , then on average $7 5 \% + 2 5 \% * 1 / k$ of the training points still have the correct label. + +# C.1 RE-SCALING THE LOSS + +Let us track the evolution of gradient disparity (Equation (6)) during training. As training progresses, the training losses of all the batches start to decrease when they get selected for the parameter update. Therefore, the value of gradient disparity might decrease, not necessarily because the distance between the two gradient vectors is decreasing, but because the value of each gradient vector is itself decreasing. To avoid this, a re-scaling or normalization of the loss is needed to compare gradient disparity at different stages of training. Note that this re-scaling or normalization does not affect the training algorithm, only the computation of gradient disparity. + +We perform both re-scaling and normalization. The re-scaling of the loss values is given by + +$$ +L _ { S _ { j } } = \frac { 1 } { m _ { j } } \sum _ { i = 1 } ^ { m _ { j } } \frac { l _ { i } } { \mathrm { s t d } _ { i } \left( l _ { i } \right) } , +$$ + +where with some abuse of notation, $l _ { i }$ is the cross entropy loss for the data point $i$ in the batch $S _ { j }$ . The normalization of the loss values is given by + +$$ +L _ { S _ { j } } = \frac { 1 } { m _ { j } } \sum _ { i = 1 } ^ { m _ { j } } \frac { l _ { i } - \mathbf { M i n } _ { i } \left( l _ { i } \right) } { \mathbf { M a x } _ { i } \left( l _ { i } \right) - \mathbf { M i n } _ { i } \left( l _ { i } \right) } . +$$ + +We experimentally compare these two ways of computing gradient disparity in Figure 5. Both the re-scaled and normalized losses, might get + +![](images/7d7e74172a082e45d165a38208e4de5c3f472ad13733a650e3223325ac1fd06c.jpg) +Figure 5: Normalizing versus re-scaling loss before computing average gradient disparity $\overline { { \mathcal { D } } }$ for a VGG-11 trained on $1 2 . 8 \mathrm { k }$ points of the CIFAR-10 dataset. + +unbounded if within each batch the loss values are very close to each other. However, in our experiments, we do not observe gradient disparity becoming unbounded either way. In the presence of outliers, re-scaling is more reliable than normalizing, because with normalization non-outlier data might end up in a very small interval between 0 and 1. This might explain the mismatch between the normalized gradient disparity and generalization loss at the end of training in Figure 5. Therefore, in all experiments presented in the paper, we re-scale the loss values before computing the gradient disparity3. + +# C.2 THE HYPER-PARAMETER s + +In this section, we briefly study the choice of the size $s$ of the subset of batches to compute the average gradient disparity + +$$ +\overline { { \mathcal { D } } } = \frac { 1 } { s ( s - 1 ) } \sum _ { i = 1 } ^ { s } \sum _ { \substack { j = 1 , j \neq i } } ^ { s } \mathcal { D } _ { i , j } . +$$ + +Figure 6 shows the average gradient disparity when averaged over $s$ number of batches4. When $s = 2$ , gradient disparity is the $\ell _ { 2 }$ norm distance of the gradients of two randomly selected batches and has a quite high variance. Although with higher values of $s$ the results have lower variance, choosing a higher $s$ is more computationally expensive (refer to Appendix $\mathrm { D }$ for more details). Therefore, we find + +![](images/40802067588612d3c45dedc4d57d8d4962fdae1aec847d57423b4be2d1eb99bb.jpg) +Figure 6: Average gradient disparity for different averaging parameter $s$ for a ResNet-18 that has been trained on $1 2 . 8 \mathrm { k }$ points of the CIFAR-10 dataset. + +# C.3 THE SURROGATE LOSS FUNCTION + +It has been shown that cross entropy is better suited for computer-vision classification tasks compared to the mean square error (Kline & Berardi, 2005; Hui & Belkin, 2020). Hence, we choose the cross entropy criterion for all our experiments to avoid possible pitfalls of the mean square error, such as not tracking the confidence of the predictor. + +Soudry et al. (2018) argues that when using cross entropy, as training proceeds, the magnitude of the network parameters increases. This can potentially affect the value of gradient disparity. Therefore, we compute the magnitude of the network parameters over iterations in various settings. We observe that this increase is very low both at the end of the training and, more importantly, at the time when gradient disparity signals overfitting (denoted by GD epoch in Table 3). Therefore, it is unlikely that the increase in the magnitude of the network parameters affects the value of gradient disparity. + +Furthermore, we examine gradient disparity for models trained on the mean square error, instead of the cross entropy criterion. We observe a high correlation between gradient disparity and test error/loss (Figure 7), which is consistent with the results obtained using the cross entropy criterion. Therefore, the applicability of gradient disparity as a generalization metric is not limited to settings with the cross entropy criterion. + +
Setting at epoch O at GD epoch at epoch 200
AlexNet,MNIST 11.000341.00123
AlexNet, MNIST, 50% random 11.000191.00980
VGG-16,CIFAR-10 11.001071.00127
VGG-16, CIFAR-10, 50% random 11.002221.00233
+ +Table 3: The ratio of the magnitude of the network parameter vector at epoch $t$ to the magnitude of the network parameter vector at epoch 0, for $t \in \{ 0 , \mathrm { G D } , 2 0 0 \}$ , where GD stands for the epoch when gradient disparity signals to stop the training. + +![](images/66878937f48f4a9561666fa97e3006941e04343d159663b761be59b496c3fc83.jpg) +Figure 7: Test error (TE), test loss (TL), and gradient disparity $( \overline { { \mathcal { D } } } )$ for VGG-16 trained with different training set sizes to minimize the mean square error criterion on the CIFAR-10 dataset. The Pearson correlation coefficient between TE and $\scriptstyle { \overline { { \mathcal { D } } } }$ and between $\mathrm { T L }$ and $\overline { { \mathcal { D } } }$ are $\rho _ { \overline { { D } } , \mathrm { T E } } = 0 . 9 7 6$ and $\rho _ { \overline { { \mathcal { D } } } , \mathrm { T L } } =$ 0.943, respectively. + +# D $k$ -FOLD CROSS VALIDATION + +$k$ -fold cross validation is done by splitting the available dataset into $k$ sets, training on $k - 1$ of them and validating on the remaining one. This is repeated $k$ times so that every set is used once as the validation set. We can adopt two different early stopping approaches: stop the optimization either (i) when the validation loss (respectively, gradient disparity) has increased for $m = 5$ epochs from the beginning of training (which is marked by the gray vertical bar in Figures 8 and 9), or (ii) when the validation loss (resp., gradient disparity) has increased for 5 consecutive epochs (which is indicated by the magenta vertical bar in Figures 8 and 9). When there is low variations and a sharp increase in the value of the metric, the two coincide (for instance, Figure 8 (b) (middle left)). In our experiments, we observe that gradient disparity appears to be less sensitive to the choice of the approaches (i) and (ii) compared to $k$ -fold cross validation. Moreover, in Table 5 we study different values of $m$ , which is usually referred to as patience among practitioners. + +Early stopping should optimally occur when there is a minimum valley throughout the training in the test loss/error curves, or when the generalization loss/error starts to increase. In those experiments where such a minimum in the test loss curve exists, we compare gradient disparity to the test loss. Otherwise, we compare gradient disparity to the generalization loss. For $k$ -fold cross validation, we compare validation loss to the test loss, because validation loss is expected to predict the test loss. Note that in the experiments with noisy labeled data, all the available data contains corrupted samples, hence both validation loss and gradient disparity are computed over sets which may contain corrupted samples. + +Limited Data. We present the results for limited data scenario in Figure 8 and Table 4 for MNIST, CIFAR-10 and CIFAR-100 datasets, where we simulate the limited data scenario by using a small subset of the training set. For the CIFAR-100 experiment (Figure 8 (a) and Table 4 (top row), we observe (from the left figure) that validation loss predicts the test loss pretty well. We observe (from the middle left figure) that gradient disparity also predicts the test loss quite well. However, the main difference between the two settings is that when using cross validation, $1 / k$ of the data is set aside for validation and $1 - 1 / k$ of the data is used for training. Whereas when using gradient disparity, all the data $( 1 - 1 / k + 1 / k )$ is used for training. Hence, the test loss in the leftmost and middle left figures differ. The difference between the test accuracy (respectively, test loss) obtained in each setting is visible in the rightmost figure (resp., middle right figure). We observe that there is over $3 \%$ improvement in the test accuracy when using gradient disparity as an early stopping criterion. This improvement is consistent for MNIST and CIFAR-10 datasets (Figures 8 (b) and (c) and Table 4). We conclude that in the absence of label noise, both $k$ -fold cross validation and gradient disparity predict the optimal early stopping moment, but the final test loss/error is much lower for the model trained with all the available data (as when gradient disparity is used), than the model trained with a $( 1 - 1 / k )$ portion of the data (as in $k$ -fold cross validation). To further test on a dataset that is itself limited, a medical application with limited labeled data is empirically studied later in this section (Appendix D.1). The same conclusion is made for this dataset. + +Noisy Labeled Data. The results for datasets with noisy labels are presented in Figure 9 and Table 6 for MNIST, CIFAR-10 and CIFAR-100 datasets. We observe (from Figure 9 (a) (left)) that for the CIFAR-100 experiment, the validation loss does no longer predict the test loss. Nevertheless, although gradient disparity is computed on a training set that contains corrupted samples, it predicts the test loss quite well (Figure 9 (a) (middle left)). As a result, there is a $2 \%$ improvement in the final test accuracy (for top-5 accuracy there is a $9 \%$ improvement) (Table 6 (top two rows)) when using gradient disparity instead of a validation set as an early stopping criterion. This is also consistent for other configurations and datasets (Figure 9 and Table 6). We conclude that, in the presence of label noise, $k$ -fold cross validation does no longer predict the test loss and fails as an early stopping criterion, unlike gradient disparity. + +Computational Cost. Denote the time, in seconds, to compute one gradient vector, to compute the $\ell _ { 2 }$ norm between two gradient vectors, to take the update step for the network parameters, and to evaluate one batch (find its validation loss and error) by $t _ { 1 } , t _ { 2 } , t _ { 3 }$ and $t _ { 4 }$ , respectively. Then, one epoch of $k$ -fold cross validation takes + +$$ +\mathbf { C } \mathbf { V } _ { \mathrm { e p o c h } } = k \times \left( { \frac { k - 1 } { k } } B ( t _ { 1 } + t _ { 3 } ) + { \frac { B } { k } } t _ { 4 } \right) +$$ + +seconds, where $B$ is the number of batches. Performing one epoch of training the network and computing the gradient disparity takes + +$$ +\mathrm { G D } _ { \mathrm { e p o c h } } = B { \left( t _ { 1 } + t _ { 3 } \right) } + s \left( t _ { 1 } + { \frac { s - 1 } { 2 } } t _ { 2 } \right) +$$ + +seconds. In our experiments, we observe that $t _ { 1 } \approx 5 . 1 t _ { 2 } \approx 1 0 0 t _ { 3 } \approx 3 . 4 t _ { 4 }$ , hence the approximate time to perform one epoch for each setting is + +$$ +\mathrm { C V } _ { \mathrm { e p o c h } } \approx ( k - 1 ) B t _ { 1 } , \qquad \mathrm { a n d } \qquad \mathrm { G D } _ { \mathrm { e p o c h } } \approx ( B + s ) t _ { 1 } . +$$ + +Therefore, as $s < B$ , we have $\mathrm { C V } _ { \mathrm { e p o c h } } \gg \mathrm { G D } _ { \mathrm { e p o c h } }$ + +![](images/e73ec8fe18909b8cba8f83577311fdd508593a958774dcaf928437aa6c3e9daf.jpg) +Figure 8: Comparing 5-fold cross validation (CV) with gradient disparity (GD) as an early stopping criterion when the available dataset is limited. (left) Validation loss versus test loss in 5-fold cross validation. (middle left) Gradient disparity versus test and generalization losses. (middle right and right) Performance on the unseen (test) data for GD versus 5-fold CV. (a) The parameters are initialized by Xavier techniques with uniform distribution. (b, c) The parameters are initialized using He technique with normal distribution. (c) The batch size is 32. The gray and magenta vertical bars indicate the epoch in which the metric (the validation loss or gradient disparity) has increased for 5 epochs from the beginning of training and for 5 consecutive epochs, respectively. In (b) the middle left figure, these two bars meet each other. + +# D.1 MRNET DATASET + +So far, we have presented the improvement of gradient disparity over cross validation for limited subsets of MNIST, CIFAR-10 and CIFAR-100 datasets. In this sub-section, we present the results for when the available dataset is by itself limited. We consider the MRNet dataset Bien et al. (2018) for diagnosis of knee injuries. The dataset contains 1370 magnetic resonance imaging (MRI) exams to study the presence of abnormality, anterior cruciate ligament (ACL) tears and meniscal tears. The labeled data in MRNet dataset is therefore very limited. Each MRI scan is a set of $S$ slices of images stacked together. Each patient (case) has three MRI scans: sagittal, coronal and axial. The MRNet dataset is split into training (1130 cases), validation (120 cases) and test sets (120 cases). The test set is not publicly available. We need however to set aside some data to evaluate both gradient disparity and $k$ -fold cross validation, hence, in our experiments, the validation set becomes the unseen (test) + +Table 4: The loss and accuracy on the test set comparing 5-fold cross validation and gradient disparity as early stopping criterion when the available dataset is limited. The corresponding curves during training are presented in Figure 8. The above results are obtained by stopping the optimization when the metric (either validation loss or gradient disparity) has been increased for five epochs from the beginning of training. + +
SettingMethodTest lossTest accuracy
CIFAR-100, ResNet-345-fold CvGD4.249 ± 0.0284.057 ± 0.0436.79 ± 0.49 (top-5: 22.19 ± 0.77)9.99 ± 0.92 (top-5: 27.84 ± 1.30)
CIFAR-10, VGG-135-fold CvGD1.846 ± 0.0161.793 ± 0.01635.982 ± 0.39336.96 ± 0.861
MNIST, AlexNet 5-fold CVGD1.123 ± 0.250.656 ± 0.08062.62 ± 6.3679.12 ± 3.04
+ +
PatienceMethod1510152025
5-fold CVGD41.15 ± 5.6830.19 ± 6.2162.62 ± 6.3679.12 ± 3.0481.39 ± 3.6484.82 ± 2.1480.39± 2.8885.35±2.0984.84 ± 2.5387.28± 1.2483.55±2.8486.69 ± 1.31
+ +(a) MNIST, AlexNet, limited dataset (Figure 8 (c)) +(b) MNIST, AlexNet, noisy dataset (Figure 9 (d)) +Table 5: The test accuracies achieved by using $k$ -fold cross validation (CV) and by using gradient disparity (GD) as early stopping criteria for different patience values. For a given patience value of $m$ , the training is stopped after $m$ increases in the value of the validation loss in $k$ -fold CV (top rows) and of GD (bottom rows). Throughout the paper, we have chosen $m = 5$ as the default patience value for all methods without optimizing it even for GD. However, in this Table, we observe that even if we tune the patience value for $k$ -fold CV and for GD separately (which is indicated in bold), GD still outperforms $k$ -fold CV. + +
PatienceMethod1510152025
10-fold CVGD96.54± 0.1597.07 ± 0.1697.28± 0.2097.32 ± 0.1597.35± 0.2397.41 ± 0.1597.22± 0.1996.57± 0.6496.60± 0.3395.44 ± 0.9694.69± 0.8792.58 ± 0.65
+ +set. To perform cross validation, we split the set used for training in Bien et al. (2018) into a first subset used for training in our experiments, and a second subset used as validation set. Note that, in this dataset, because slice $S$ changes from one case to another, it is not possible to stack the data into batches, hence the batch size is 1, which may explain the fluctuations of validation loss and gradient disparity in this setting. We used the SGD optimizer with the learning rate $1 0 ^ { - 4 }$ for training the model. Each task in this dataset is a binary classification with unbalanced set of samples and hence we report the area under the curve of the receiver operating characteristic (AUC score). + +The results for three tasks: detecting ACL tears, meniscal tears and abnormality, are shown in Figure 10 and Table 7. We can observe that both the validation loss, despite a small bias, and the gradient disparity predict the generalization loss quite well. Yet, when using gradient disparity, the final test AUC score is higher (Figure 10 (right)). As mentioned earlier, for this dataset, both the validation loss and gradient disparity vary a lot. Hence, in Table 7, we present the results of early stopping, both when the metric has increased for 5 epochs from the beginning of training, and (in parenthesis) when the metric has increased for 5 consecutive epochs. We conclude that with both approaches, the use of gradient disparity as an early stopping criterion results in more than $1 \%$ improvement in the test AUC score. Because the test set used in Bien et al. (2018) is not publicly available, it is not possible to compare our predictive results with Bien et al. (2018). Nevertheless, a baseline may be the results presented in https://github.com/ahmedbesbes/mrnet, which report a test AUC score of $8 8 . 5 \%$ for the task of detecting ACL tears, whereas we observe in Table 7 that stopping training after 5 consecutive increases in gradient disparity leads to $9 1 . 5 2 \%$ + +
SettingMethodTest lossTest accuracy
CIFAR-100, ResNet-1810-fold CVGDPlug-in5.023 ± 0.0834.463 ± 0.0384.964 ± 0.0571.59 ± 0.15 (top-5: 6.47 ± 0.52)3.68 ± 0.52 (top-5: 15.22 ± 1.24)1.68 ± 0.24 (top-5: 7.05 ± 0.71)
CIFAR-100, ResNet-3410-fold CVGDPlug-in4.062 ± 0.0914.592 ± 0.1794.134± 0.1859.62 ± 1.08 (top-5: 32.06 ± 1.47)10.41 ± 1.40 (top-5: 36.92 ± 1.20)10.11 ± 1.60 (top-5: 34.19 ± 2.10)
CIFAR-10, VGG-1310-fold CVGDPlug-in2.126 ± 0.0632.519 ± 0.0622.195 ± 0.14234.88 ± 1.6636.98 ± 0.7735.40 ± 3.00
MNIST, AlexNet10-fold CVGDPlug-in0.656 ± 0.0340.654 ± 0.0310.639 ± 0.02997.28 ± 0.2097.32 ± 0.2797.31 ± 0.15
+ +Table 6: The loss and accuracy on the test set comparing 10-fold cross validation and gradient disparity as early stopping criterion when the available dataset is noisy. In all the experiments, $50 \%$ of the available data has random labels. The corresponding curves during training are presented in Figure 9. The above results are obtained by stopping the optimization when the metric (either validation loss or gradient disparity) has been increased for five epochs from the beginning of training. The last row in each setting, which we call plug-in, refers to when we plug-in the epoch suggested by 10-fold CV and then report the test loss and accuracy at that epoch for a network trained on the entire set. In all these settings, using GD would still result in a higher test accuracy and therefore the advantage of GD over 10-fold CV is a better characterization of overfitting. + +test AUC score for this task. With further tuning, and combining the predictions found on two other MRI planes of each patient (axial and coronal), our final prediction results could even be improved. + +
TaskMethodTest lossTest AUC score
ACL5-fold CVGD0.973 ± 0.111 (1.246 ± 0.142)0.842 ± 0.101 (1.136 ± 0.121)79.80 ± 1.23 (89.32 ± 1.47)81.81 ± 1.64 (91.52 ± 0.09)
meniscal5-fold CVGD0.758 ± 0.04 (1.163 ± 0.127)0.726 ± 0.019 (1.14 ± 0.323)73.53 ± 1.30 (72.14 ± 0.74)74.08 ± 0.79 (73.80 ± 0.24)
abnormal5-fold CvGD0.284 ± 0.016 (0.307 ± 0.057)0.274 ± 0.004 (0.275 ± 0.053)71.016 ± 3.66 (87.44 ± 1.35)72.67 ± 3.85 (88.12 ± 0.35)
+ +Table 7: The loss and AUC score on the test set, comparing 5-fold cross validation to gradient disparity both as early stopping criterion for the MRNet dataset for three different tasks using the sagittal plane MRI scans. Note that an unassisted general radiologist gives on average $9 2 \%$ , $8 4 \%$ and $8 9 \%$ accuracy for detecting ACL tears, meniscal tears and abnormality, respectively (Bien et al., 2018). The corresponding curves during training are presented in Figure 10. We present the results of early stopping, both when the metric has increased for 5 epochs from the beginning of training, and in parenthesis when the metric has increased for 5 consecutive epochs. + +![](images/196e96f75126c60f0326a2a248ab17c5ab1cab5ffbc02cd7a62539a64f66897a.jpg) +Figure 9: Comparing 10-fold cross validation with gradient disparity as early stopping criteria when the available dataset is noisy. (left) Validation loss versus test loss in 10-fold cross validation. (middle left) Gradient disparity versus test and generalization losses. (middle right and right) Performance on the unseen (test) data for GD versus 10-fold CV. (a) The parameters are initialized by Xavier techniques with uniform distribution. (b, c, and d) The parameters are initialized using He technique with normal distribution. + +![](images/f48fc420b807a474117af2302b44bfc822734359248be6420b2d835aecbf376b.jpg) +Figure 10: Detecting three tasks from the MRNet dataset from the sagittal plane MRI scans. (left) Validation loss versus test loss in 5-fold cross validation. (middle) Gradient disparity versus generalization loss. (right) Performance comparison on the final unseen data when applying 5-fold CV versus gradient disparity. + +![](images/228cc54c2bbfd2b6459be567640ff1363796a9dcd9795920a88ec937555c6a9c.jpg) +Figure 11: The cross entropy loss, the error percentage and the average gradient disparity during training. (a-c): A ResNet-18 trained on a subset of $1 2 . 8 \mathrm { ~ k ~ }$ points of the CIFAR-10 training set (the parameter initialization is Xavier (Glorot & Bengio, 2010)). Pearson’s correlation coefficient $\rho$ between $\overline { { \mathcal { D } } }$ and generalization loss/error over all the training iterations are $\rho _ { \overline { { \mathcal { D } } } , \mathrm { g e n l o s s } } \ = \ 0 . 7 5 5$ and ρD,gen error = 0.846. (d-f): An AlexNet trained on a subset of 12.8 k points of the MNIST training set (the parameters are initialized according to the He (He et al., 2015) method with Normal distributions). For this experiment, $\rho _ { \overline { { \mathcal { D } } } , \mathrm { g e n l o s s } } = 0 . 4 6 5$ and $\rho _ { \overline { { { \mathcal { D } } } } , \mathrm { g e n e r r o r } } = 0 . 4 5 7 .$ . The blue, orange, green, and red curves are the test loss/error, train loss/error, generalization loss/error, and the average gradient disparity $\overline { { \mathcal { D } } }$ , respectively. + +To investigate the relation between the average gradient disparity $\overline { { \mathcal { D } } }$ and generalization, we compare two sets of experiments. The first one exhibits clear overfitting, whereas in the second one, the model generalizes quite well. To test gradient disparity as a generalization metric, not only should it have very different values for each of these two sets of experiments, but it should also be well aligned with the generalization error. This is indeed what the experiments show. + +In the first set of experiments, the network configuration is ResNet-18 (He et al., 2016) and it is trained on the CIFAR-10 dataset (Figure 11 (top)). Around iteration 500 (which is indicated by a thick gray vertical bar in the figures), the training and test losses (and errors) start to diverge, and the test loss reaches its minimum. This should be the early stopping point as the model is starting to overfit. Interestingly, around the same time (indicated in Figures 11 (b) and (c)), we observe a sharp increase in $\overline { { \mathcal { D } } }$ . + +The second set of experiments is on an AlexNet (Krizhevsky et al., 2012) trained on the MNIST dataset (Figure 11 (bottom)). This model generalizes quite well for this dataset. We observe that, throughout the training, the test curves are even below the training curves, which is due to the dropout regularization technique (Srivastava et al., 2014) being applied during training and not during testing. The generalization loss/error is almost zero, until around iteration 1100 (indicated in the figure by the gray vertical bar), which is when overfitting starts and the generalization error becomes non-zero. At approximately the same time, the average gradient disparity (Figures 11 (e) and (f)) starts to slightly increase, but much more slowly compared to Figures 11 (b) and (c). In both these experiments, we observe that as overfitting starts, the gradient vectors start to diverge, resulting in larger gradient disparity. These observations suggest gradient disparity as an effective early stopping criterion, as it is well aligned with the generalization error. + +# E.1 MNIST EXPERIMENTS + +Figure 12 shows the results for a 4-layer fully connected neural network trained on the entire MNIST training set5. Figures 12 (e) and (f) show the generalization losses. We observe that at the early stages of training, generalization losses do not distinguish between different label noise levels, whereas gradient disparity (Figures 12 (g) and (h)) does so from the beginning. At the middle stages of training we can observe that, surprisingly in this setting, the network with $0 \%$ label noise has higher generalization loss than the networks trained with $2 5 \%$ , $50 \%$ and $7 5 \%$ , and this is also captured by average gradient disparity. The final gradient disparity values for the networks trained with higher label noise level are also larger. For the network trained with $0 \%$ label noise we present the results with more detail in Figure 13 and observe again how gradient disparity is well aligned with the generalization loss/error. In this experiment, the early stopping time suggested by gradient disparity is epoch 9, which is the exact same time when the training and test losses/errors start to diverge, which signals therefore the start of overfitting. + +![](images/35233dc5346296a59ae76ccfc0be8fb2d76e6f20aec759aede406d7135fa3617.jpg) +Figure 12: The cross entropy loss, error percentage, and average gradient disparity during training with different amounts of randomness in the training labels for a 4-layer fully connected neural network with 500 hidden units trained on the entire MNIST dataset. The parameter initialization is the He initialization with normal distribution. + +![](images/44353175b1af1828e7d981636361dc33f0132c6ccca60b4e80518265b8042634.jpg) +Figure 13: The cross entropy loss, error percentage, and average gradient disparity during training for a 4-layer fully connected neural network with 500 hidden units trained on the entire MNIST dataset with $0 \%$ label noise. The parameter initialization is the He initialization with normal distribution. Pearson’s correlation coefficient $\rho$ between $\overline { { \mathcal { D } } }$ and generalization loss/error over all the training iterations are $\rho _ { \overline { { \mathcal { D } } } , \mathrm { g e n l o s s } } = 0 . 9 6 7$ and $\rho _ { \overline { { \mathcal { D } } } , \mathrm { g e n e r r o r } } = 0 . 7 3 4$ . The gray vertical bar indicates when GD increases for 5 epochs from the beginning of training. The magenta vertical bar indicates when GD increases for 5 consecutive epochs. We observe that the gray bar signals when overfitting is starting, which is when the training and testing curves are starting to diverge. The magenta bar would be a good stopping time, because if we train beyond this point, although the test error remains the same, the test loss would increase, which would result in overconfidence on wrong predictions. + +# E.2 CIFAR-10 EXPERIMENTS + +Width. To compare models with a different number of parameters using gradient disparity, we need to normalize it. The dimension of a gradient vector is the number $d$ of parameters of the model. Gradient disparity being the √ $\ell _ { 2 }$ -norm of the difference of gradient vectors will thus grow proportionally to $\sqrt { d }$ , hence to compare different architectures, we propose to use the normalized√ gradient disparity $\tilde { \mathcal { D } } = \overline { { \mathcal { D } } } / \sqrt { d }$ . We observe in Figure 14 that both the normalized6 gradient disparity and test error decrease with the network width (the scale is a hyper-parameter used to change both the number of channels and hidden units in each configuration). + +![](images/614b95b1f15037575b37c62faf528b69584c5ec7203861f00f22392fb2c39eb3.jpg) +Figure 14: Test error and normalized gradient disparity for networks trained on the CIFAR-10 dataset with different number of channels and hidden units for convolutional neural networks (CNN) and fully connected neural networks (FCNN). The correlation between normalized gradient disparity and test loss $\rho _ { \tilde { \mathcal { D } } , \mathrm { T L } }$ and between normalized gradient disparity and test error $\rho _ { \tilde { \mathcal { D } } , \mathrm { T E } }$ are reported in the captions. + +Figure 15 shows the results for a 4-layer fully connected neural network, which is trained on the entire CIFAR-10 training set7. We observe that gradient disparity reflects the test error at the early stages of training quite well. In the later stages of training we observe that the ranking of gradient disparity values for different label noise levels matches with the ranking of generalization losses and errors. In all experiments the average gradient disparity is indeed very informative about the test error. Figure 16 shows the effect of adding data augmentation on both the test error and gradient disparity. Figure 17 shows test error and gradient disparity for networks that are trained with different training set sizes. In Figure 18, we observe that, as discussed in Section 6, gradient disparity, similar to the test error, increases with the batch size for not too large batch sizes, and as expected, when the batch size is very large (512 for the CIFAR-10 experiment and 256 for the CIFAR-100 experiments) gradient disparity starts to decrease, because gradient vectors are averaged over a large batch. Note that even with such large batch sizes, gradient disparity correctly detects the early stopping time, but the value of gradient disparity can no longer be compared to the one found with other batch sizes. + +![](images/1d7019861b97ffb699e225f7e02511798f9ab6f5d1c0556e718ace90c888f20c.jpg) +Figure 15: The cross entropy loss, error percentage, and average gradient disparity during training with different amounts of randomness in the training labels for a 4-layer fully connected neural network with 500 hidden units trained on the entire CIFAR-10 dataset. The parameter initialization is the Xavier initialization with uniform distribution. The training is stopped when the training loss gets below 0.01. + +![](images/e8bf62a37268e855725ceb62862f6ef509a1da5cf870f37140cbea1af040ac8b.jpg) +Figure 16: The test error (bottom row) and gradient disparity (top row) for a ResNet-18 trained on the CIFAR-10 dataset with different training set sizes. (a) Results with data augmentation (DA) (we use random crop with padding $= 4$ and random horizontal flip with probability $= 0 . 5$ ). (b) Results without using any data augmentation technique. (c) Combined results of (a) and (b). We observe a strong positive correlation between gradient disparity $( \overline { { \mathcal { D } } } )$ and test error (TE) regardless of using data augmentation or not. We also observe that using data augmentation decreases the values of both gradient disparity and the test error. + +![](images/34f0be0de31b9179d347311c0080072d94cf478a7b2b903dbb29f84009103601.jpg) +Figure 17: Test error and gradient disparity for networks that are trained with different training set sizes. The training is stopped when the training loss is below 0.01. + +![](images/972892423701f0113a5a17360702e88c81313d9c208dd830a918370af06845d9.jpg) +Figure 18: Test error and gradient disparity for networks that are trained with different batch sizes trained on $1 2 . 8 \mathrm { ~ k ~ }$ points of the CIFAR-10 and CIFAR-100 datasets. The training is stopped when the training loss is below 0.01. + +# E.3 CIFAR-100 EXPERIMENTS + +Figure 19 shows the results for a ResNet-18 that is trained on the CIFAR-100 training set8. Clearly, the model is not sufficient to learn the complexity of the CIFAR-100 dataset: It has $9 9 \%$ error for the network with $0 \%$ label noise, as if it had not learned anything about the dataset and is just making a random guess for classification (because there are 100 classes, random guessing would give $9 9 \%$ error on average). We observe from Figure 19 (f) that as training progresses, the network overfits more, and the generalization error increases. Although the test error is high (above $9 0 \%$ ), very surprisingly for this example, the networks with higher label noise level, have a lower test loss and error (Figures 19 (b) and (d)). Quite interestingly gradient disparity (Figure 19 (g)) captures also this surprising trend as well. + +![](images/01485a1a477273b249e7d350d903fe8f8fbec0344dabd7bdd9813bca8d64e04e.jpg) +Figure 19: The cross entropy loss, error percentage, and average gradient disparity during training with different amounts of randomness in the training labels for a ResNet-18 trained on the CIFAR100 training set. The parameter initialization is the Xavier initialization. + +# F NUMBER OF BATCHES WITH LOW GRADIENT DISPARITY + +In this paper, the upper bound in Theorem 1 is tracked by computing the average gradient disparity $\overline { { \mathcal { D } } }$ over a subset of batches. In this section, to gain some finer-grain signal of overfitting during the training process, we track down the distribution of this bound by studying the distribution of the gradient disparity, i.e., $\mathbb { P } ( \mathcal { D } _ { i , j } < \zeta )$ for some threshold $\zeta$ . + +We find the number of pairs of batches in the training set, denoted by $\tau _ { \zeta }$ , whose gradient disparity is below the given threshold $\zeta$ . For these pairs of batches, the upper bound in Theorem 1, with probability at least $1 - \delta$ and for two batches with the same size $m$ , is below $2 \sqrt { \left( \gamma ^ { 2 } \zeta ^ { 2 } / \sigma ^ { 2 } + 2 \ln ( 2 m / \delta ) \right) / ( m - 2 ) }$ . The lower $\tau _ { \zeta }$ is, the higher the average upper bound is, hence the more likely overfitting becomes. As before, for the sake of computational tractability, instead of going through all the possible pairs, we only compare $s ( s - 1 )$ pairs of batches $( s = 5$ for our experiments), so $0 \leq \mathcal { T } _ { \zeta } \leq s ( s - 1 )$ . We empirically estimate $\mathbb { P } ( \mathcal { D } _ { i , j } < \zeta )$ over $s$ batches by $\mathcal { T } _ { \zeta } / ( s ( \bar { s } - 1 ) )$ . In our experiments, we compute $\tau _ { \zeta }$ for $\zeta \in \{ 1 0 , 2 0 \}$ . + +We show that as an early stopping criterion, $\tau _ { \zeta }$ is sometimes (slightly) more accurate than $\overline { { \mathcal { D } } }$ . For instance, in Figure 20 (d) we highlighted in gray the minima valley of the test error for the network trained with $2 \hat { 5 } \%$ noise and we observe that this aligns with the drop in $\tau _ { \zeta }$ for $\zeta = 2 0$ (light pink curve in Figure 20 (g)) better than the increasing time of $\overline { { \mathcal { D } } }$ (Figure 20 (f)). Also, the slow increase in the generalization loss for the AlexNet (green curve in Figure 21 (a)) is captured by the drop in $\tau _ { \zeta }$ for $\zeta = 1 0$ (Figure 21 (c)) slightly better than the increase in the average gradient disparity (Figure 21 (b)). The drawback of $\tau _ { \zeta }$ compared to $\overline { { \mathcal { D } } }$ is that it introduces an additional hyper-parameter $\zeta$ which requires tuning. In our experiments, as a rough rule of thumb, we observe that setting $\zeta$ around $1 0 \%$ of the initial gradient disparity works well. Further empirical investigation on $\tau _ { \zeta }$ is left as future work. + +![](images/3c26b383c1f73637bb1dcaed50ed00c5b4c96caf30fc6528fd3393e4809f0ae0.jpg) +Figure 20: The cross entropy loss, error percentage, average gradient disparity and $\tau _ { \zeta }$ for $\zeta = 2 0$ during training with different amounts of randomness in the training labels for a ResNet-18 trained on a subset of $1 2 . 8 \ \mathrm { k }$ points of the CIFAR-10 training set. We can observe that, in this setting, average gradient disparity distinguishes different label noise levels from the beginning of training, unlike generalization error. + +![](images/18ae997912ffdc2342a25d94d202334d4ea8ad4ddd9821ad6334e2d271d64fd1.jpg) +Figure 21: The cross entropy loss, average gradient disparity $\overline { { \mathcal { D } } }$ , and $\tau _ { \zeta }$ for $\zeta = 1 0$ during training for an AlexNet trained on a subset of $1 2 . 8 \mathrm { k }$ points of the MNIST training set. + +# G BEYOND SGD + +In the following, we discuss how the analysis of Section 4 can be extended for other optimizers (refer to Ruder (2016) for an overview on popular optimizers). + +# G.1 SGD WITH MOMENTUM + +The momentum method (Qian, 1999) is a variation of SGD which adds a fraction of the update vector of the previous step to the current update vector to accelerate SGD: + +$$ +\begin{array} { r } { \boldsymbol { v } ^ { ( t + 1 ) } = \eta \boldsymbol { v } ^ { ( t ) } + \gamma \boldsymbol { g } ^ { ( t ) } , } \\ { \boldsymbol { w } ^ { ( t + 1 ) } = \boldsymbol { w } ^ { ( t ) } - \boldsymbol { v } ^ { ( t + 1 ) } , } \end{array} +$$ + +where $g ^ { ( t ) }$ is either $g _ { 1 }$ or $g _ { 2 }$ depending on the selection of the batch $S _ { 1 }$ or $S _ { 2 }$ for the current update step. As $\boldsymbol { \upsilon } ^ { ( t ) }$ remains the same for either choice, the KL-divergence between $Q _ { 1 }$ and $Q _ { 2 }$ for SGD with momentum, is the same as Equation (5). + +# G.2 ADAGRAD + +Adagrad (Duchi et al., 2011) performs update steps with a different learning rate for each individual parameter. By denoting each coordinate of the parameter vector $w$ by $d$ , one update step of the Adagrad algorithm is + +$$ +w _ { d } ^ { ( t + 1 ) } = w _ { d } ^ { ( t ) } - \frac { \gamma } { \sqrt { G _ { d d } ^ { ( t ) } + \epsilon } } g _ { d } ^ { ( t ) } , +$$ + +where the vector $g ^ { ( t ) }$ is either $g _ { 1 }$ or $g _ { 2 }$ depending on the selection of the batch for the current update step, and $G _ { d d } ^ { ( t ) }$ is the accumulative squared norm of the gradients up until iteration $t$ . Hence, for Adagrad, Equation (5) is replaced by + +$$ +{ \bf K L } ( Q _ { 1 } | | Q _ { 2 } ) = \frac { 1 } { 2 } \frac { \gamma ^ { 2 } } { \sigma ^ { 2 } } \left\| \frac { 1 } { G ^ { ( t ) } + \epsilon } \odot ( g _ { 1 } - g _ { 2 } ) \right\| _ { 2 } ^ { 2 } \leq \frac { 1 } { 2 } \frac { \gamma ^ { 2 } } { \sigma ^ { 2 } } \left\| \frac { 1 } { G ^ { ( t ) } + \epsilon } \right\| _ { 2 } ^ { 2 } \left\| g _ { 1 } - g _ { 2 } \right\| _ { 2 } ^ { 2 } , +$$ + +where $\odot$ denotes the element-wise product of two vectors, where division is also taken element-wise and where $\epsilon$ is a small positive constant that avoids a possible division by 0. To compare the upper bound in Theorem 1 from one iteration to the next one (as needed to determine the early stopping moment in Section 5), gradient disparity is not the only factor in Equation (15) that evolves over time. Indeed $G ^ { ( t ) }$ is an increasing function of $t$ . However, after a few iterations when the gradients become small, this value becomes approximately constant (the initial gradient values dominate the sum in $G ^ { ( t ) }$ ). Then the right hand side of Equation (15) varies mostly as a function of gradient disparity, and therefore gradient disparity approximately tracks down the generalization penalty upper bound. + +# G.3 ADADELTA AND RMSPROP + +Adadelta (Zeiler, 2012) is an extension of Adagrad, which computes a decaying average of the past gradient vectors instead of the accumulative squared norm of the gradients dur. . As $G _ { d d } ^ { ( t ) }$ in Equation (14) is then replaced by ing proceeds, the gradient magnitude decre $\bar { \boldsymbol { v } } _ { d } ^ { ( t + 1 ) }$ wlso, reis $v _ { d } ^ { ( t + 1 ) } = \eta v _ { d } ^ { ( t ) } + ( 1 - \eta ) ( g _ { d } ^ { ( t ) } ) ^ { 2 }$ υ(t+1) = d d dusually close to 1. Therefore, the dominant term in $v _ { 1 } ^ { ( t + 1 ) } = \eta v ^ { ( t ) } + \left( 1 - \eta \right) \left( g _ { 1 } \right) ^ { 2 } \approx \eta v ^ { ( t ) } + \left( 1 - \eta \right) \left( g _ { 2 } \right) ^ { 2 } = v _ { 2 } ^ { ( t + 1 ) }$ $v _ { d } ^ { ( t + 1 ) }$ becomes d (squares are done element-wise), . Then, if we approximate then for Adadelta we have + +$$ +\mathrm { K L } ( Q _ { 1 } | | Q _ { 2 } ) \leq \frac { 1 } { 2 } \frac { \gamma ^ { 2 } } { \sigma ^ { 2 } } \left\| \frac { 1 } { \upsilon ^ { ( t + 1 ) } + \epsilon } \right\| _ { 2 } ^ { 2 } \left\| g _ { 1 } - g _ { 2 } \right\| _ { 2 } ^ { 2 } , +$$ + +where again the division is done element-wise. The denominator in Equation (16) is smaller than the denominator in Equation (15). In both equations, the first non-constant factor in the upper bound of ${ \mathrm { K L } } ( Q _ { 1 } | | Q _ { 2 } )$ decreases as a function of $t$ , and therefore an increase in the value of ${ \mathrm { K L } } ( Q _ { 1 } | | Q _ { 2 } )$ should be accounted for by an increase in the value of gradient disparity. Moreover, as training proceeds, gradient magnitudes decrease and the first factor on the upper bound of Equations (15) and (16) becomes closer to a constant. Therefore, an upper bound on the generalization penalties can be tracked by gradient disparity. + +The update rule of RmsProp9 is very similar to Adadelta, and the same conclusions can be made. + +# G.4 ADAM + +Adam (Kingma & Ba, 2014) combines Adadelta and momentum by storing an exponentially decaying average of the previous gradients and squared gradients: + +$$ +\begin{array} { r l } { m ^ { ( t + 1 ) } = \beta _ { 1 } m ^ { ( t ) } + ( 1 - \beta _ { 1 } ) g ^ { ( t ) } , \quad } & { v ^ { ( t + 1 ) } = \beta _ { 2 } v ^ { ( t ) } + \left( 1 - \beta _ { 2 } \right) \left( g ^ { ( t ) } \right) ^ { 2 } , } \\ { \hat { m } ^ { ( t + 1 ) } = \displaystyle \frac { m ^ { ( t + 1 ) } } { 1 - \left( \beta _ { 1 } \right) ^ { t } } , \quad } & { \hat { v } ^ { ( t + 1 ) } = \displaystyle \frac { v ^ { ( t + 1 ) } } { 1 - \left( \beta _ { 2 } \right) ^ { t } } , \quad } & { w ^ { ( t + 1 ) } = w ^ { ( t ) } - \displaystyle \frac { \gamma } { \sqrt { \hat { v } ^ { ( t + 1 ) } } + \epsilon } \hat { m } ^ { ( t + 1 ) } . } \end{array} +$$ + +All the operations in the above equations are done element-wise. As $\beta _ { 2 }$ is usually very close to 1 (around 0.999), and as squared gradient vectors at the current update step are much smaller than the accumulated values during the previous steps, we approximate: $v _ { 1 } ^ { ( t + 1 ) } = \beta _ { 2 } v ^ { ( t ) } + \left( 1 - \beta _ { 2 } \right) \left( g _ { 1 } \right) ^ { 2 } \approx \beta _ { 2 } v ^ { ( t ) } + \left( 1 - \beta _ { 2 } \right) \left( g _ { 2 } \right) ^ { 2 } = v _ { 2 } ^ { ( t + 1 ) }$ (squares are done elementwise). Hence, Equation (5) becomes + +$$ +\operatorname { K L } ( Q _ { 1 } | | Q _ { 2 } ) \leq \frac { 1 } { 2 } \frac { \gamma ^ { 2 } } { \sigma ^ { 2 } } \frac { 1 - \beta _ { 1 } } { 1 - ( \beta _ { 1 } ) ^ { t } } \left\| \frac { 1 } { \sqrt { \hat { v } ^ { ( t + 1 ) } } + \epsilon } \right\| _ { 2 } ^ { 2 } \| g _ { 1 } - g _ { 2 } \| _ { 2 } ^ { 2 } . +$$ + +The first non-constant factor in equation above decreases with $t$ (because $\beta _ { 1 } < 1 $ ). However it is not clear how the second factor varies as training proceeds. Therefore, unlike previous optimizers, it is more hazardous to claim that the factors other than gradient disparity in Equation (17) become constant as training proceeds. Hence, tracking only gradient disparity for the Adam optimizer may be insufficient. This is empirically investigated in the next sub-section. + +# G.5 EXPERIMENTS + +Figure 22 shows gradient disparity and test loss curves during the course of training for adaptive optimizers. The epoch in which the fifth increase in the value of the test loss and gradient disparity has happened is presented in the caption of each experiment. We observe that the two suggested epochs for stopping the optimization (the one suggested by gradient disparity (GD) and the other one suggested by test loss) are extremely close to each other except in Figure 22 (c) where the fifth epoch with an increase in the value of gradient disparity is much later than the epoch with the fifth increase in the value of test loss. However, in this experiment, there is a $23 \%$ improvement in the test accuracy if the optimization is stopped according to GD compared to test loss, due to many variations of test loss compared to gradient disparity. + +As an early stopping criterion, the increase in the value of gradient disparity coincides with the increase in the test loss in all our experiments presented in Figure 22. In Figure 22 (h), for the Adam optimizer, we observe that after around 20 epochs, the value of gradient disparity starts to decrease, whereas the test loss continues to increase. This mismatch between test loss and gradient disparity might be due to the effect of the other factors that appear in Equation (17). Nevertheless, even in this experiment, the increase in the test loss and the gradient disparity coincide, and hence gradient disparity can correctly detect early stopping time. These experiments are a first indication that gradient disparity can be used as an early stopping criterion for optimizers other than SGD. + +![](images/f04f626f19dc2868bd45ca0dc56971f3a7418eac7a1c2ac4363f977cee68ee91.jpg) +(a) SGD with Momentum, test loss epoch: 11, GD epoch: 10 + +![](images/6c03113e162bc33d5b78502bf79bed53fc2af9c2d33e2473853ec65dc35a3a56.jpg) +(b) Adagrad, test loss epoch: 19 GD epoch: 18 + +![](images/5a7c248b2ff64cd10d39660d18baf148219e0e3840741ddf21565a89c9a56d4a.jpg) +(c) RmsProp, test loss epoch: 15 (loss:1.43, err: $54 \%$ ), GD epoch: 36 (loss:1.16, err: $31 \%$ ) + +![](images/a135c346fc50abcf1a643faf660012de69e29239ec3d4eaab12ee91317de28a8.jpg) +(d) Adam, test loss epoch: 19, GD epoch: 20 + +![](images/f93c639297045e5e802facca9ce338fa66bd9d430e049aecace6172b4c591de4.jpg) +(e) Adagrad, test loss epoch: 21, GD epoch: 21 + +![](images/8830aa958a78801b8aab51b9f841145b0cb405f0b629f220810e6a2093a0b67d.jpg) +(f) Adadelta, test loss epoch: 12, GD epoch: 15 + +![](images/354e583df408df4fda69aabad7ccd218492e34698a45f8426466b81e0c27f2c2.jpg) + +(g) RmsProp, test loss epoch: 20, GD epoch: 18 + +![](images/b876dd7cca14a58ba2730853aef040b31c538814fc15627a1f095c81ea44c317.jpg) +(h) Adam, test loss epoch: 12, GD epoch: 10 +Figure 22: (a-d) VGG-19 configuration trained on $1 2 . 8 \mathrm { k }$ training points of CIFAR-10 dataset. (e-h) VGG-11 configuration trained on $1 2 . 8 \ \mathrm { k }$ points of the CIFAR-10 dataset. The training is stopped when the training loss gets below 0.01. The presented results are an average over 5 runs. The captions below each figure give the epoch number where test loss and gradient disparity have respectively been increased for 5 epochs from the beginning of training. The Pearson correlation coefficient $\rho$ is presented in each figure between gradient disparity and test loss. + +H COMPARISON TO RELATED WORK + +
MinGD/VarEBGSNRgi:9jsign(gi:gj) cos(gi:gj)ck-foldNo ES
TE4.844.844.8412.8222.3012.8218.318.304.844.96
TL0.180.180.180.460.820.460.690.320.180.22
(a) MNIST, AlexNet
MinGD/VarEBGSNR9igjsign(gi:gj)cos(gi:9j)Mk-foldNo ES
TE13.7616.6624.6335.6837.9224.6335.6829.4017.8625.725
TL0.751.080.861.681.820.861.681.461.090.91
(b) MNIST, AlexNet, 50% random
MinGD/VarEBGSNR9i9jsign(gi:gj)cos(gi:gj)ck-foldNoES
TE45.5445.9561.7670.4670.4655.8467.0967.3751.6464.19
TL1.321.451.681.921.921.521.831.851.491.98
(c) CIFAR-10, ResNet-18
TEMin 59.77GD/VarEBGSNR9i·9jsign(gi:9j)cos(gi:gj)Ωck-foldNo ES
TL1.7571.97 2.0073.17 2.0377.08 2.1275.91 2.1365.80 1.9375.43 2.0777.71 2.1372.56 2.0275.96 2.30
+ +(d) CIFAR-10, ResNet-18, $5 0 \%$ random + +Table 8: Test error (TE) and test loss (TL) achieved by using various metrics as early stopping criteria. On the leftmost column, the minimum values of TE and TL over all the iterations are reported (which is not accessible during training). The results of 5-fold cross validation are reported on the right-most column, which serve as a baseline. For each experiment, we have underlined those metrics that result in a better performance than 5-fold cross validation. We observe that gradient disparity (GD) and variance of gradients (Var) consistently outperform $k$ -fold cross validation, unlike other metrics. On the rightmost column (No ES) we report the results without performing early stopping (ES) (training is continued until the training loss is below 0.01). + +In Table 8 we compare gradient disparity (GD) to a number of metrics that were proposed either directly as an early stopping criterion, or as a generalization metric. For those metrics that were not originally proposed as early stopping criteria, we choose a similar method for early stopping as the one we use for gradient disparity. We consider two datasets (MNIST and CIFAR-10), and two levels of label noise $0 \%$ and $5 0 \%$ ). Here is a list of the metrics that we compute in each setting: + +1. Gradient disparity (GD) (ours): we report the error and loss values at the time when the value of GD increases for the 5th time (from the beginning of the training). +2. The EB-criterion (Mahsereci et al., 2017): we report the error and loss values when EB becomes positive. +3. Gradient signal to noise ratio (GSNR) (Liu et al., 2020): we report the error and loss values when the value of GSNR decreases for the 5th time (from the beginning of the training). +4. Gradient inner product, $g _ { i } \cdot g _ { j }$ (Fort et al., 2019): we report the error and loss values when the value of $g _ { i } \cdot g _ { j }$ decreases for the 5th time (from the beginning of the training). +5. Sign of the gradient inner product, $\mathrm { s i g n } ( g _ { i } \cdot g _ { j } )$ (Fort et al., 2019): we report the error and loss values when the value of $\mathrm { s i g n } ( g _ { i } \cdot g _ { j } )$ decreases for the 5th time (from the beginning of the training). +6. Cosine similarity between gradient vectors, $\cos ( g _ { i } \cdot g _ { j } )$ (Fort et al., 2019): we report the error and loss values when the value of $\cos ( g _ { i } \cdot g _ { j } )$ decreases for the 5th time (from the beginning of the training). +7. Variance of gradients (Var) (Negrea et al., 2019): we report the error and loss values when the value of Var increases for the 5th time (from the beginning of the training). Variance is computed over the same number of batches used to compute gradient disparity, in order to compare metrics given the same computational budget. + +8. Average gradient alignment within the class, $\Omega _ { c }$ (Mehta et al., 2020): we report the error and loss values when the value of $\Omega _ { c }$ decreases for the 5th time (from the beginning of the training). + +On the leftmost column of Table 8, we report the minimum values of the test error and the test loss over all the iterations, which may not necessarily coincide. For instance, in setting (c), the test error is minimized at iteration 196, whereas the test loss is minimized at iteration 126. On the rightmost column of Table 8, we report the values of the test error and the test loss when using 5-fold cross validation, which serves as a baseline. + +It is interesting to observe that gradient disparity and variance of gradients produce the exact same results when used as early stopping criteria (Table 8). Moreover, these two are the only metrics that consistently outperform $k$ -fold cross validation. However, in Section H.1, we observe that the correlation between gradient disparity and the test loss is in general larger than the correlation between variance of gradients and the test loss. + +The EB-criterion, $\mathrm { s i g n } ( g _ { i } \cdot g _ { j } )$ , and $\cos ( g _ { i } \cdot g _ { j } )$ are metrics that perform quite well as early stopping criteria, although not as well as GD and Var. In Section H.2, we observe that these metrics are not informative of the label noise level. + +# H.1 GRADIENT DISPARITY VERSUS VARIANCE OF GRADIENTS + +It has been shown that generalization is related to gradient alignment experimentally in Fort et al. (2019), and to variance of gradients theoretically in Negrea et al. (2019). Gradient disparity can be viewed as bringing the two together. Indeed, one can check that $\mathbb { E } \left[ \mathcal { D } _ { i , j } ^ { \hat { 2 } } \right] \stackrel { * } { = } 2 \sigma _ { g } ^ { 2 } + 2 \mu _ { g } ^ { T } \mu _ { g } - 2 \mathbb { E } \left[ g _ { i } ^ { T } g _ { j } \right]$ , given that $\bar { \mu _ { g } } = \mathbb { E } [ g _ { i } ] = \mathbb { E } [ g _ { j } ]$ and $\sigma _ { g } ^ { 2 } = \operatorname { t r } \left( \operatorname { C o v } \left[ g _ { i } \right] \right) = \operatorname { i r } \left( \operatorname { C o v } \left[ g _ { j } \right] \right)$ . This shows that gradient variance $\sigma _ { g } ^ { 2 }$ and gradient alignment $g _ { i } ^ { T } g _ { j }$ both appear as components of gradient disparity. We conjecture that the dominant term in gradient disparity is the variance of gradients, hence as early stopping criteria these two metrics almost always signal overfitting simultaneously. This is indeed what our experiments show; we show that variance of gradients is also a very promising early stopping criterion (Table 8). However, because of the additional term in gradient disparity (the gradients inner product), gradient disparity emphasizes the alignment or misalignment of the gradient vectors. This could be the reason why gradient disparity in general outperforms variance of gradients in tracking the value of the generalization loss; the positive correlation between gradient disparity and the test loss is often larger than the positive correlation between variance of gradients and the test loss (Table 9). + +Table 9: Pearson’s correlation coefficient between gradient disparity $( \overline { { \mathcal { D } } } )$ and test loss (TL) over the training iterations is compared to the correlation between variance of gradients (Var) and test loss. + +
SettingPD.TL pVar,TL
AlexNet, MNIST0.433 0.169
AlexNet, MNIST, 50% random labels0.5350.161
VGG-16, CIFAR-100.1900.324
VGG-16, CIFAR-10, 50% random labels0.6340.623
VGG-19, CIFAR-100.6850.508
VGG-19, CIFAR-10, 50% random labels0.7480.735
ResNet-18, CIFAR-100.9750.958
ResNet-18, CIFAR-10, 50% random labels0.4710.457
+ +# H.2 CAPTURING LABEL NOISE LEVEL + +In this section, we show in particular three metrics that even though perform relatively well as early stopping criteria, fail to account for the level of label noise, contrary to gradient disparity. + +• The sign of the gradient inner product, $\mathrm { s i g n } ( g _ { i } \cdot g _ { j } )$ , should be inversely related to the test loss; it should decrease when overfitting increases. However, we observe that the value of $\mathrm { s i g n } ( g _ { i } \cdot g _ { j } )$ is larger for the setting with the higher label noise level; it incorrectly detects the setting with the higher label noise level as the setting with the better generalization performance (see Figure 23). The EB-criterion should be larger for settings with higher overfitting. In most stages of training, the EB-criterion does not distinguish between settings with different label noise levels, contrary to gradient disparity (see Figure 23). At the end of the training, the EBcriterion even mistakenly signals the setting with the higher label noise level as the setting with the better generalization performance. +• The cosine similarity between gradient vectors, $\cos ( g _ { i } \cdot g _ { j } )$ , should decrease when overfitting increases and therefore with the level of label noise in the training data. But $\cos ( g _ { i } \cdot g _ { j } )$ appears not to be sensitive to the label noise level, and in some cases (Figure 24 (a)) it even increases with the noise level. Gradient disparity is much more informative of the label noise level compared to cosine similarity and the correlation between gradient disparity and the test error is larger than the correlation between cosine similarity and the test accuracy (see Figure 24). + +![](images/a54022ccc2a5176dd59d9731bb4cd3c6acca55cc73b77b5c311aa3108cc29f6e.jpg) +Figure 23: Test loss, gradient disparity, EB-criterion Mahsereci et al. (2017), and $\mathrm { s i g n } ( g _ { i } \cdot g _ { j } )$ for a ResNet-18 trained on the CIFAR-10 dataset, with $0 \%$ and $5 0 \%$ random labels. Gradient disparity, contrary to EB-criterion and $\mathrm { s i g n } ( g _ { i } \cdot g _ { j } )$ , clearly distinguishes the setting with real labels from the setting with random labels. + +![](images/5c3fbd197c12c6ac006ee62f636f959dae5c600cb467bf2bc568ad8b0bdfa3f5.jpg) +Figure 24: The test error (TE), average gradient disparity $( \overline { { \mathcal { D } } } )$ , and cosine similarity $( \cos ( g _ { i } \cdot g _ { j } ) )$ during training with different amounts of randomness in the training labels for two sets of experiments. (a) ResNet-18 trained on $1 2 . 8 \mathrm { k }$ points of the CIFAR-10 training set. The Pearson correlation coefficient between test accuracy (TA) and cosine similarity (cos) over all levels of randomness and over all the iterations is $\rho _ { \mathrm { c o s , T A } } = - 0 . 0 0 8 8$ , whereas the correlation between test error/generalization error and gradient disparity is $\rho _ { \overline { { D } } , \mathrm { T E } } = 0 . 2 0 2 9$ and $\rho _ { \overline { { D } } , \mathrm { G E } } = 0 . 5 2 6 8$ , respectively. (b) AlexNet configuration trained on $1 2 . 8 \mathrm { k }$ points of the MNIST dataset. The correlation between the test accuracy and cosine similarity is $\rho _ { \mathrm { c o s , T A } } ~ = ~ 0 . 7 5 2 1$ , which is positive and relatively high for this experiment. Yet, it is still lower than the correlation between test error and gradient disparity which is ρD,TE = 0.8019. \ No newline at end of file diff --git a/parse/train/WGWzwdjm8mS/WGWzwdjm8mS_content_list.json b/parse/train/WGWzwdjm8mS/WGWzwdjm8mS_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..9d76c51f7c570382551fd139889d4ffa486062c9 --- /dev/null +++ b/parse/train/WGWzwdjm8mS/WGWzwdjm8mS_content_list.json @@ -0,0 +1,3509 @@ +[ + { + "type": "text", + "text": "EARLY STOPPING BY GRADIENT DISPARITY ", + "text_level": 1, + "bbox": [ + 176, + 98, + 702, + 121 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Anonymous authors Paper under double-blind review ", + "bbox": [ + 183, + 145, + 398, + 172 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 209, + 544, + 226 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Validation-based early-stopping methods are one of the most popular techniques used to avoid over-training deep neural networks. They require to set aside a reliable unbiased validation set, which can be expensive in applications offering limited amounts of data. In this paper, we propose to use gradient disparity, which we define as the $\\ell _ { 2 }$ norm distance between the gradient vectors of two batches drawn from the training set. It comes from a probabilistic upper bound on the difference between the classification errors over a given batch, when the network is trained on this batch and when the network is trained on another batch of points sampled from the same dataset. We empirically show that gradient disparity is a very promising early-stopping criterion when data is limited, because it uses all the training samples during training. Furthermore, we show in a wide range of experimental settings that gradient disparity is not only strongly related to the usual generalization error between the training and test sets, but that it is also much more informative about the level of label noise. ", + "bbox": [ + 233, + 246, + 764, + 440 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 478, + 336, + 494 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Early stopping is a commonly used regularization technique to avoid under/over fitting deep neural networks trained with iterative methods, such as gradient descent (Prechelt, 1998; Yao et al., 2007; Gu et al., 2018). To have an unbiased proxy on the generalization error, early stopping requires a separate accurately labeled validation set. However, labeled data collection is an expensive and time consuming process that might require domain expertise (Roh et al., 2019). Moreover, deep learning is becoming popular to use for new and critical applications for which there is simply not enough available data. Hence, it is advantageous to have a signal of overfitting that does not require a validation set, then all the available data can be used for training the model. ", + "bbox": [ + 174, + 513, + 825, + 626 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Let $S _ { 1 }$ and $S _ { 2 }$ be two batches of points sampled from the available (training) dataset. Suppose that $S _ { 1 }$ is selected for an iteration (step) of stochastic gradient descent (SGD), which then updates the parameter vector to $w _ { 1 }$ . The average loss over $S _ { 1 }$ is in principle reduced, given a sufficiently small learning rate. However, the average loss over the other batch $S _ { 2 }$ (i.e., $L _ { S _ { 2 } } ( h _ { w _ { 1 } } ) )$ is not as likely to be reduced. It will remain on average larger than the loss computed over $S _ { 2 }$ , if it was $S _ { 2 }$ instead of $S _ { 1 }$ that had been selected for this iteration (i.e., $L _ { S _ { 2 } } ( h _ { w _ { 2 } } ) )$ . The difference is the penalty $\\mathcal { R } _ { 2 }$ that we pay for choosing $S _ { 1 }$ over $S _ { 2 }$ (and similarly, $\\mathcal { R } _ { 1 }$ is the penalty that we would pay for choosing $S _ { 2 }$ over $S _ { 1 }$ ). $\\mathcal { R } _ { 2 }$ is illustrated in Figure 1 for a hypothetical non-convex loss as a function of a one dimensional parameter. The expected penalty measures how much, in an iteration, a model updated on one batch $( S _ { 1 } )$ is able to generalize ", + "bbox": [ + 174, + 633, + 483, + 912 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/efa99407233504696a1c2e50ec5fdc49435647ba540b9bb569d60976631b00d2.jpg", + "image_caption": [ + "Figure 1: An illustration of the penalty term $\\mathcal { R } _ { 2 }$ , where the y-axis is the loss, and the $\\mathbf { X }$ -axis indicates the parameters of the model. $L _ { S _ { 1 } }$ and $L _ { S _ { 2 } }$ are the average losses over batches $S _ { 1 }$ and $S _ { 2 }$ , respectively. $\\mathbf { \\chi } _ { w } \\mathbf { \\bar { ( } } t )$ is the parameter at iteration $t$ and wit w(t+1)i is the parameter at iteration t + 1 if batch $S _ { i }$ was selected for the update step at iteration $t$ with $i \\in \\{ 1 , 2 \\}$ . " + ], + "image_footnote": [], + "bbox": [ + 498, + 636, + 821, + 777 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "on average to another batch $( S _ { 2 } )$ from the dataset. Hence, we call $\\mathcal { R }$ the generalization penalty. ", + "bbox": [ + 171, + 910, + 794, + 924 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We establish a probabilistic upper-bound on the sum of the expected penalties $\\mathbb { E } \\left[ \\mathcal { R } _ { 1 } \\right] + \\mathbb { E } \\left[ \\mathcal { R } _ { 2 } \\right]$ by adapting the PAC-Bayesian framework (McAllester, 1999a;b; 2003) given a pair of batches $S _ { 1 }$ and $S _ { 2 }$ sampled from the dataset (Theorem 1). Interestingly, under some mild assumptions, this upper bound is essentially a simple expression driven by $\\| g _ { 1 } - g _ { 2 } \\| _ { 2 }$ , where $g _ { 1 }$ and $g _ { 2 }$ are the gradient vectors over the two batches $S _ { 1 }$ and $S _ { 2 }$ , respectively. We call this gradient disparity: it measures how a small gradient step on one batch negatively affects the performance on another one. ", + "bbox": [ + 174, + 103, + 825, + 188 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Gradient disparity is simple to use and it is computationally tractable during the course of training. Our experiments on state-of-the-art configurations suggest a very strong link between gradient disparity and generalization error; we propose gradient disparity as an effective early stopping criterion. Gradient disparity is particularly useful when the available dataset has limited labeled data, because it does not require splitting the available dataset into training and validation sets so that all the available data can be used during training, unlike for instance $k$ -fold cross validation. We observe that using gradient disparity, instead of an unbiased validation set, results in at least $1 \\%$ predictive performance improvement for critical applications with limited and very costly available data, such as the MRNet dataset that is a small size image-classification dataset used for detecting knee injuries (Table 1). ", + "bbox": [ + 173, + 194, + 825, + 333 + ], + "page_idx": 1 + }, + { + "type": "table", + "img_path": "images/195a95c8fcfa06e799785064f7ae0500b854a415ad69db5a6689a3473bb86641.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
TaskMethodTest lossTest AUC score (in percentage)
abnormal5-fold CvGD0.284 ± 0.016 (0.307 ± 0.057)0.274 ± 0.004 (0.275 ± 0.053)71.016 ± 3.66 (87.44 ± 1.35)72.67 ± 3.85 (88.12 ± 0.35)
ACL5-fold CvGD0.973 ± 0.111 (1.246 ± 0.142)0.842 ± 0.101 (1.136 ± 0.121)79.80 ± 1.23 (89.32 ± 1.47)81.81 ± 1.64 (91.52 ± 0.09)
meniscal5-fold CvGD0.758 ± 0.04 (1.163 ± 0.127)0.726± 0.019 (1.14 ± 0.323)73.53 ± 1.30 (72.14 ± 0.74)74.08 ± 0.79 (73.80 ± 0.24)
", + "bbox": [ + 187, + 345, + 810, + 470 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Table 1: The loss and area under the receiver operating characteristic curve (AUC score) on the MRNet test set (Bien et al., 2018), comparing 5-fold cross validation (5-fold CV) and gradient disparity (GD), when both are used as early stopping criteria for detecting the presence of abnormally, ACL tears, and meniscal tears from the sagittal plane MRI scans. The corresponding curves during training are shown in Figure 10. The results of early stopping are given, both when the metric has increased for 5 epochs from the beginning of training and between parenthesis when the metric has increased for 5 consecutive epochs. ", + "bbox": [ + 173, + 481, + 825, + 579 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Moreover, when the available dataset contains noisy labels, the validation set is no longer a reliable predictor of the clean test set (see e.g., Figure 9 (a) (left)), whereas gradient disparity correctly predicts the performance on the test set and again can be used as a promising early-stopping criterion. Furthermore, we observe that gradient disparity is a better indicator of label noise level than generalization error, especially at early stages of training. Similarly to the generalization error, it decreases with the training set size, and it increases with the batch size. ", + "bbox": [ + 174, + 601, + 825, + 685 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Paper Outline. In Section 2, we formally define the generalization penalty. In Section 3, we give the upper bound on the generalization penalty. In Section 4, we introduce the gradient disparity metric. In Section 5, we present experiments that support gradient disparity as an early stopping criterion. In Section 6, we assess gradient disparity as a generalization metric. Finally, in Section 7, we further discuss the observations and compare gradient disparity to related work. A detailed comparison to related work is deferred to Appendix H. For our experiments, we consider four image classification datasets: MNIST, CIFAR-10, CIFAR-100 and MRNet, and we consider a wide range of neural network architectures: ResNet, VGG, AlexNet and fully connected neural networks. ", + "bbox": [ + 174, + 691, + 825, + 803 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 GENERALIZATION PENALTY ", + "text_level": 1, + "bbox": [ + 176, + 823, + 439, + 838 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Consider a classification task with input $x \\in \\mathcal { X } : = \\mathbb { R } ^ { n }$ and ground truth label $y \\in \\{ 1 , 2 , \\cdots , k \\}$ , where $k$ is the number of classes. Let $h _ { w } \\ \\in \\ { \\mathcal { H } } \\ : \\ { \\mathcal { X } } \\ \\to \\ { \\mathcal { y } } \\ : = \\ \\mathbb { R } ^ { k }$ be a predictor (classifier) parameterized by the parameter vector $\\boldsymbol { w } ~ \\in ~ \\mathbb { R } ^ { d }$ , and $l ( \\cdot , \\cdot )$ be the 0-1 loss function $l \\left( h _ { w } ( \\bar { x } ) , y \\right) = \\mathbb { 1 } \\left[ h _ { w } ( x ) [ y ] < \\operatorname* { m a x } _ { j \\neq y } h _ { w } ( x ) [ j ] \\right]$ for all $h _ { w } \\in \\mathcal { H }$ and $( x , y ) \\in \\mathcal { X } \\times \\{ 1 , 2 , \\cdot \\cdot \\cdot , k \\}$ The expected loss and the empirical loss over the training set $S$ of size $m$ are respectively defined as ", + "bbox": [ + 174, + 853, + 823, + 924 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/abd546b8836dbc560bb2e3acdfa1316ff1f2731a005fcec33aab9e22b51f70ce.jpg", + "text": "$$\nL ( h _ { w } ) = \\mathbb { E } _ { ( x , y ) \\sim D } \\left[ l \\left( h _ { w } ( x ) , y \\right) \\right] \\qquad \\mathrm { ~ a n d ~ } \\qquad L _ { S } ( h _ { w } ) = \\frac { 1 } { m } \\sum _ { i = 1 } ^ { m } l ( h _ { w } ( x _ { i } ) , y _ { i } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 222, + 119, + 776, + 162 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $D$ is the probability distribution of the data points and $( x _ { i } , y _ { i } )$ are i.i.d. samples drawn from $S \\sim D ^ { m }$ . $L _ { S } ( \\bar { h } _ { w } )$ is also called the training classification error. Similar to the notation used in (Dziugaite & Roy, 2017), distributions on the hypotheses space $\\mathcal { H }$ are simply distributions on the underlying parameterization. With some abuse of notation, $\\nabla L _ { S _ { i } }$ refers to the gradient with respect to the surrogate differentiable loss function, which in our experiments is the cross entropy. ", + "bbox": [ + 173, + 167, + 825, + 238 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In a mini-batch gradient descent (SGD) setting, consider two batches of points, denoted by $S _ { 1 }$ and $S _ { 2 }$ , which have respectively $m _ { 1 }$ and $m _ { 2 }$ number of samples, with $m _ { 1 } + m _ { 2 } \\leq m$ . The average loss functions over these two sets of samples are $L _ { S _ { 1 } } ( h _ { w } )$ and $L _ { S _ { 2 } } ( h _ { w } )$ , respectively. Let $w = \\bar { w } ^ { ( t ) }$ be the parameter vector at the beginning of an iteration $t$ . If $S _ { 1 }$ is selected for the next iteration, $w$ gets updated to $w _ { 1 } = w ^ { ( t + 1 ) }$ with ", + "bbox": [ + 173, + 244, + 825, + 315 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/677f0f155487c673e1490c7780509caa810014868132d18ec0b179d71260d265.jpg", + "text": "$$\nw _ { 1 } = w - \\gamma \\nabla L _ { S _ { 1 } } \\left( h _ { w } \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 415, + 315, + 581, + 332 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $\\gamma$ is the learning rate. Conversely, if $S _ { 2 }$ had been selected instead of $S _ { 1 }$ , the updated parameter vector at the end of this iteration would have been $w _ { 2 } = w - \\gamma \\nabla L _ { S _ { 2 } }$ $\\left( h _ { w } \\right)$ . Therefore, the generalization penalty on batch $S _ { 2 }$ is defined as $\\mathcal { R } _ { 2 } = L _ { S _ { 2 } } \\left( h _ { w _ { 1 } } \\right) - L _ { S _ { 2 } } \\left( h _ { w _ { 2 } } \\right)$ , which is the gap between the loss over $S _ { 2 } , L _ { S _ { 2 } } \\left( h _ { w _ { 1 } } \\right)$ , and its target value, $L _ { S _ { 2 } } \\left( h _ { w _ { 2 } } \\right)$ , at the end of iteration $t$ . ", + "bbox": [ + 174, + 334, + 825, + 391 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "When selecting $S _ { 1 }$ for the parameter update, Equation (2) makes a step towards learning the inputoutput relations of batch $S _ { 1 }$ . If this negatively affects the performance on batch $S _ { 2 }$ , $\\mathcal { R } _ { 2 }$ will be large; the model is learning the data structures that are unique to $S _ { 1 }$ and that do not appear in $S _ { 2 }$ . Because $S _ { 1 }$ and $S _ { 2 }$ are batches of points sampled from the same distribution $D$ , they have data structures in common. If, throughout the learning process, we consistently observe that, in each update step, the model learns structures unique to only one batch, then it is very likely that the model is memorizing the labels instead of learning the common data-structures. This is captured by the generalization penalty $\\mathcal { R }$ . ", + "bbox": [ + 173, + 396, + 825, + 508 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 BOUND ON THE GENERALIZATION PENALTY ", + "text_level": 1, + "bbox": [ + 176, + 529, + 575, + 545 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We adapt the PAC-Bayesian framework (McAllester, $1 9 9 9 \\mathrm { a } ; \\mathrm { b } )$ ) to account for the trajectory of the learning algorithm; For each learning iteration we define a prior, and two possible posteriors depending on the choice of the batch selection. Let $w \\sim P$ be an initial parameter vector that follows a prior distribution $P$ which is a $\\mathcal { F } _ { t }$ -measurable function, where $\\mathcal { F } _ { t }$ denotes the filtration of the available information at the beginning of iteration $t$ . Let $h _ { w _ { 1 } } , h _ { w _ { 2 } }$ be the two learned single predictors, at the end of iteration $t$ , from $S _ { 1 }$ and $S _ { 2 }$ , respectively. In this framework, for $i \\in \\{ 1 , 2 \\}$ , each predictor $h _ { w _ { i } }$ is randomized and becomes $h _ { \\nu _ { i } }$ with $\\nu _ { i } = w _ { i } + u _ { i }$ , where $u _ { i }$ is a random variable whose distribution might depend on $S _ { i }$ . Let $Q _ { i }$ be the distribution of $\\nu _ { i }$ , which is a distribution over the predictor space $\\mathcal { H }$ that depends on $S _ { i }$ via $w _ { i }$ and possibly $u _ { i }$ . Let $\\mathcal { G } _ { i }$ be a $\\sigma$ -field such that $\\sigma ( S _ { i } ) \\cup \\mathcal { F } _ { t } \\subset \\mathcal { G } _ { i }$ and that the posterior distribution $Q _ { i }$ is $\\mathcal { G } _ { i }$ -measurable for $i \\in \\{ 1 , 2 \\}$ . We further assume that the random variable $\\nu _ { 1 } \\sim Q _ { 1 }$ is statistically independent from the draw of the batch $S _ { 2 }$ and, vice versa, that $\\nu _ { 2 } \\sim Q _ { 2 }$ is independent from the batch $S _ { 1 } { } ^ { 1 }$ , i.e., $\\mathcal { G } _ { 1 }$ ⊥⊥ $\\sigma ( S _ { 2 } )$ and $\\mathcal { G } _ { 2 }$ ⊥⊥ $\\sigma ( S _ { 1 } )$ . ", + "bbox": [ + 173, + 559, + 825, + 727 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Theorem 1. For any $\\delta \\in ( 0 , 1 ]$ , with probability at least $1 - \\delta$ over the sampling of sets $S _ { 1 }$ and $S _ { 2 }$ , the sum of the expected penalties conditional on $S _ { 1 }$ and $S _ { 2 }$ , respectively, satisfies ", + "bbox": [ + 171, + 731, + 823, + 760 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/79df78238d77eef2f7a11611fde8d5f98a9c540f5337ec64a47ebf534d6e7502.jpg", + "text": "$$\n\\mathbb { E } \\left[ \\mathcal { R } _ { 1 } \\right] + \\mathbb { E } \\left[ \\mathcal { R } _ { 2 } \\right] \\leq \\sqrt { \\frac { 2 K L ( Q _ { 2 } | | Q _ { 1 } ) + 2 \\ln \\frac { 2 m _ { 2 } } { \\delta } } { m _ { 2 } - 2 } } + \\sqrt { \\frac { 2 K L ( Q _ { 1 } | | Q _ { 2 } ) + 2 \\ln \\frac { 2 m _ { 1 } } { \\delta } } { m _ { 1 } - 2 } } .\n$$", + "text_format": "latex", + "bbox": [ + 233, + 763, + 764, + 808 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Theorem 1, whose proof is given in Appendix $\\mathbf { B }$ , shows why generalization penalties are better suited to our setting where the two batches $S _ { 1 }$ and $S _ { 2 }$ are both drawn from the training set $S$ than the usual generalization errors. After an iteration, the network learns a posterior distribution $Q _ { 1 }$ on its parameters from $S _ { 1 }$ , yielding to the parameter vector $\\nu _ { 1 } \\sim Q _ { 1 }$ . The expected generalization error at that time is defined as $\\mathrm { G E } _ { 1 } = \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ L ( h _ { \\nu _ { 1 } } ) \\right] - \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ L _ { S _ { 1 } } ( h _ { \\nu _ { 1 } } ) \\right]$ . In practice, $L ( h _ { \\nu _ { 1 } } )$ is estimated by the test loss over a batch of unseen data, which is independent from $\\nu _ { 1 } \\sim Q _ { 1 }$ . If $S _ { 2 }$ is this batch, then2 $\\mathrm { G E } _ { 1 } \\approx \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ L _ { S _ { 2 } } ( h _ { \\nu _ { 1 } } ) \\right] - \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ L _ { S _ { 1 } } ( h _ { \\nu _ { 1 } } ) \\right]$ . However, this estimate requires to set $S _ { 2 }$ aside from $S$ not only during that step but also during all the previous steps, because otherwise the model $h _ { \\nu _ { 1 } }$ would not be independent from $S _ { 2 }$ , making the estimate of $\\mathrm { G E _ { 1 } }$ biased. Therefore $S _ { 2 }$ must be sampled from the validation set, and cannot be used during training. In contrast, Theorem 1 is valid even if the trained model $h _ { \\nu _ { 1 } }$ depends on the samples within the batch $S _ { 2 }$ . Therefore, the bound on the sum of the (expected) generalization penalties does no longer require to set $S _ { 2 }$ aside from $S$ in previous iterations; all data previously reserved for validation can now be used for training. This is what makes these penalties appealing to measure generalization especially when the available dataset is limited and/or noisy, as we will see in Section 5. ", + "bbox": [ + 173, + 819, + 825, + 876 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 102, + 825, + 257 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Theorem 1 remains valid if batch $S _ { 2 }$ was sampled from the validation set, in which case it can be compared with known generalization error (GE) bounds, as now $h _ { \\nu _ { 1 } }$ does not depend on samples of $S _ { 2 }$ . Similarly to $\\mathrm { G E _ { 1 } }$ , let $\\mathrm { G E _ { 2 } }$ be the generalization error when $S _ { 2 }$ is the training set, while $S _ { 1 }$ is the test set. By adding $\\mathrm { G E _ { 1 } }$ and $\\mathrm { G E _ { 2 } }$ we obtain $\\mathbb { E } \\left[ \\mathcal { R } _ { 1 } \\right] + \\mathbb { E } \\left[ \\mathcal { R } _ { 2 } \\right]$ , hence Theorem 1 also upper bounds an estimate of $\\mathrm { G E _ { 1 } + G E _ { 2 } }$ . We could have obtained another upper bound by directly applying the bounds from (McAllester, 2003; Neyshabur et al., 2017b), which gives ", + "bbox": [ + 173, + 263, + 825, + 348 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/9c56704a0ac7e7bc1016d638c0bbf20d6526fd5534c11cb9ae8ef47bcacff84d.jpg", + "text": "$$\n\\mathbb { E } \\left[ \\mathcal { R } _ { 1 } \\right] + \\mathbb { E } \\left[ \\mathcal { R } _ { 2 } \\right] \\leq 2 \\sqrt { \\frac { 2 \\mathrm { K L } ( Q _ { 2 } | | P ) + 2 \\ln \\frac { 2 m _ { 2 } } { \\delta } } { m _ { 2 } - 1 } } + 2 \\sqrt { \\frac { 2 \\mathrm { K L } ( Q _ { 1 } | | P ) + 2 \\ln \\frac { 2 m _ { 1 } } { \\delta } } { m _ { 1 } - 1 } } .\n$$", + "text_format": "latex", + "bbox": [ + 232, + 353, + 766, + 396 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The main difference between Equations (3) and (4) is that the former needs the difference only between the two posterior distributions, $Q _ { 1 }$ and $Q _ { 2 }$ , whereas the latter requires the difference between the prior distribution $P$ and the posterior distributions $Q _ { 1 }$ and $Q _ { 2 }$ . Besides the minor difference of the multiplicative factor 2, the upper bound in Equation (3) is non-vacuous for a larger class of distributions than the upper bound in Equation (4): When $Q _ { 1 }$ and $Q _ { 2 }$ are close to each other but not to $P$ , the upper bound in Equation (3) is much tighter than the one in Equation (4). Moreover, in the next section, we show that, under reasonable assumptions, the upper bound in Equation (3) boils down to a very tractable generalization metric that we call gradient disparity. ", + "bbox": [ + 173, + 401, + 825, + 513 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4 GRADIENT DISPARITY ", + "text_level": 1, + "bbox": [ + 176, + 534, + 392, + 549 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The randomness modeled by $u _ { i }$ , conditioned on the current batch $S _ { i }$ , comes from (i) the parameter vector at the beginning of the iteration $w$ , which itself comes from the random parameter initialization and the stochasticity of the parameter updates until that iteration, and (ii) the gradient vector $\\nabla L _ { S _ { i } }$ , which may also be random because of the possible additional randomness in the network structure due for instance to dropout (Srivastava et al., 2014). A common assumption made in the literature is that the random perturbation $u _ { i }$ follows a normal distribution (Bellido & Fiesler, 1993; Neyshabur et al., 2017b). The upper bound in Theorem 1 takes a particularly simple form if we assume that for $i \\in \\{ 1 , 2 \\}$ the random perturbations $u _ { i }$ are zero mean i.i.d. normal distributions $( u _ { i } \\sim \\mathcal { N } ( 0 , \\sigma ^ { 2 } I ) )$ , and that $w _ { i }$ is fixed, as in the setting of (Dziugaite & Roy, 2017). ${ \\mathrm { K L } } ( Q _ { 1 } | | Q _ { 2 } )$ is then the KL-divergence between two multivariate normal distributions . ", + "bbox": [ + 173, + 564, + 825, + 704 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Let us denote $\\nabla L _ { S _ { 1 } } ( h _ { w } )$ by $g _ { 1 } \\in \\mathbb { R } ^ { d }$ and $\\nabla L _ { S _ { 2 } } ( h _ { w } )$ by $g _ { 2 } \\in \\mathbb { R } ^ { d }$ . As $w _ { i } = w - \\gamma g _ { i }$ for $i \\in \\{ 1 , 2 \\}$ , the KL-divergence between $\\bar { Q } _ { 1 } = \\mathcal { N } ( w _ { 1 } , \\sigma ^ { 2 } I ) \\bar { }$ and $Q _ { 2 } \\stackrel { \\cdot } { = } \\mathcal { N } ( w _ { 2 } , \\sigma ^ { 2 } I )$ (Lemma 1 in Appendix A) is simply ", + "bbox": [ + 173, + 709, + 825, + 753 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/53a61aa9c09b5f4031a53992b398fedd3452311f6d9e29ebe7be3135de275905.jpg", + "text": "$$\n\\mathrm { K L } ( Q _ { 1 } | | Q _ { 2 } ) = \\frac { 1 } { 2 } \\frac { \\gamma ^ { 2 } } { \\sigma ^ { 2 } } \\left. g _ { 1 } - g _ { 2 } \\right. _ { 2 } ^ { 2 } = \\mathrm { K L } ( Q _ { 2 } | | Q _ { 1 } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 333, + 758, + 663, + 791 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "which shows that, keeping a constant step size $\\gamma$ and assuming the same variance for the random perturbations $\\sigma ^ { 2 }$ in all the steps of the training, the bound in Theorem 1 is driven by $\\lVert g _ { 1 } - g _ { 2 } \\rVert _ { 2 }$ . ", + "bbox": [ + 176, + 804, + 823, + 833 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "This indicates that the smaller the $\\ell _ { 2 }$ distance between gradient vectors is, the lower the upper bound on the generalization penalty is, and therefore the closer the performance of a model trained on one batch is to a model trained on another batch. ", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "For two batches of points $S _ { i }$ and $S _ { j }$ , with gradient vectors $g _ { i }$ and $g _ { j }$ , respectively, we define the gradient disparity (GD) between $S _ { i }$ and $S _ { j }$ as ", + "bbox": [ + 173, + 152, + 823, + 181 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/3850871a3d316e7632ad39fbf028b16d2d48dab093e3eb6e94d300930c5bff0a.jpg", + "text": "$$\n\\mathcal { D } _ { i , j } = \\| g _ { i } - g _ { j } \\| _ { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 433, + 186, + 565, + 205 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Gradient disparity is empirically tractable, and provides a probabilistic guarantee on the sum of the generalization penalties of $S _ { i }$ and $S _ { j }$ , modulo the Gaussianity assumptions made in this section. Gradient disparity can be computed within batches of the training or the validation set. As discussed in Section 3, we focus on the first case to have a generalization metric that does not require validation data and that provides an early stopping criterion with all the available data used for training. ", + "bbox": [ + 174, + 208, + 823, + 279 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We focus on the vanilla SGD optimizer. In Appendix G, we extend the analysis to other adaptive optimizers: SGD with momentum (Qian, 1999), Adagrad (Duchi et al., 2011), Adadelta (Zeiler, 2012), and Adam (Kingma & Ba, 2014). In all these optimizers, we observe that gradient disparity (Equation (6)) appears in ${ \\mathrm { K L } } ( Q _ { 1 } | | Q _ { 2 } )$ with other factors that depend on a decaying average of past gradient vectors. Experimental results support the use of gradient disparity as an early stopping metric also for these popular optimizers (see Figure 22 in Appendix G). ", + "bbox": [ + 174, + 285, + 825, + 369 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Computing the gradient disparity averaged over $B$ batches requires all the $B$ gradient vectors at each iteration, which is computationally expensive if $B$ is large. We approximate it by computing it over only a much smaller subset of the batches, of size $s \\ll B$ , $\\begin{array} { r } { \\overline { { \\mathcal { D } } } \\overset { } { = } \\sum _ { i = 1 } ^ { s } \\sum _ { j = 1 , j \\neq i } ^ { s } \\tilde { \\mathcal { D } _ { i , j } } / s ( s - 1 ) } \\end{array}$ . In the experiments presented in this paper, $s = 5$ ; we observed that such a small subset is already sufficient (see Appendix C.2 for an experimental comparison of different values of $s$ ). We also present an alternative approach that relies on the distribution of gradient disparity instead of its average in Appendix F to have a finer-grain signal of overfitting. ", + "bbox": [ + 174, + 376, + 825, + 476 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "As training progresses, the gradient magnitude starts to decrease, and therefore the value of gradient disparity might decrease not necessarily because the distance between two gradient vectors is decreasing, but because their magnitudes are decreasing. Hence, in order to compare different stages of training, we re-scale the loss values within each batch, before computing gradient disparity in $\\overline { { \\mathcal { D } } }$ (refer to Appendix C.1 for more details). Moreover, we consider the mean square error (MSE) for the choice of the surrogate loss in Appendix C.3 and we observe that gradient disparity is positively correlated with the MSE test loss as well. ", + "bbox": [ + 174, + 482, + 825, + 579 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "5 GRADIENT DISPARITY AS AN EARLY STOPPING CRITERION ", + "text_level": 1, + "bbox": [ + 176, + 599, + 699, + 616 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Comparison to $k$ -fold Cross Validation. Early stopping is a popular technique used in practice to avoid overfitting (Prechelt, 1998; Yao et al., 2007; Gu et al., 2018). The optimization is stopped when the performance of the model on a validation set starts to diverge from its performance on the training set. Early stopping is of particular interest in the presence of label noise, because the model first learns the samples with correct labels, and next the corrupted samples (Li et al., 2019). To emphasize the particular application of gradient disparity, we compare it to $k$ -fold cross validation in two settings: (i) when the available dataset is limited and (ii) when the available dataset has corrupted labels. We simulate the limited data scenario by using a small subset of three image classification benchmark datasets: MNIST, CIFAR-10 and CIFAR-100, and the noisy labeled data scenario is simulated by using a corrupted version of these datasets. We also evaluate gradient disparity on a medical dataset (MRNet dataset) with limited available data and in this setting, we use the entire dataset for training. ", + "bbox": [ + 174, + 631, + 825, + 797 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "(i) We compare gradient disparity with $k$ -fold cross validation (Stone, 1974) used as an early stopping criterion in Table 2 (top) when there is limited labeled data. We observe that gradient disparity performs well as an early stopping criterion, especially when the data is complex (CIFAR-100 is more complex than CIFAR-10). As it uses every available sample, instead of only a $1 - 1 / k$ portion of the dataset, it results in a better performance on the final unseen (test) data (see also Table 4 and Figure 8 in Appendix D). ", + "bbox": [ + 174, + 804, + 823, + 888 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In many real-world applications, collecting (labeled) data is very costly. In some medical applications, it requires high costs of patient data collection and medical staff expertise. For an example of such an application, we consider the MRNet dataset (Bien et al., 2018), which contains limited number of MRI scans to study the presence of abnormally, ACL tears and meniscal tears in knee injuries. We observe that using gradient disparity instead of a validation set, results in over $1 \\%$ improvement (on average over all three tasks) in the test AUC score, and therefore additional correct detection for more than one patient for each task (see Table 1 and Figure 10 in Appendix D). ", + "bbox": [ + 174, + 895, + 821, + 924 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 174 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "(ii) When the labels of the available data are noisy, the validation set is no longer a reliable estimate of the unseen set (this can be clearly observed in Figure 9 (left column)). Nevertheless, and although it is computed over the noisy training set, gradient disparity reflects the performance on the test set quite well (Figure 9 (middle left column)). As a result (see Table 2 (bottom)), gradient disparity performs better than $k$ -fold cross validation as an early stopping criterion. The same applies to two other datasets (see Table 6 and Figure 9 in Appendix D). ", + "bbox": [ + 174, + 180, + 823, + 265 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/694b9952c3909f2de4809635663a0fec779241c879b805e9d61c5c4b76d7293b.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Label noiseMethodTest lossTest accuracy Top-5 test accuracy
0%5-fold CVGD4.249 ± 0.0284.057 ± 0.0436.79 ± 0.499.99 ± 0.9222.19 ± 0.7727.84 ± 1.30
50%10-fold CVGD5.023 ± 0.0834.463 ± 0.0381.59 ± 0.153.68 ± 0.526.47 ± 0.5215.22 ± 1.24
", + "bbox": [ + 217, + 275, + 781, + 367 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Table 2: The final test loss and accuracy when using gradient disparity (GD) and $k$ -fold cross validation (CV) as early stopping criteria, (top) when the available dataset is limited and (bottom) when the available data has noisy labeled samples. To simulate a limited-data scenario, we consider as a training set a subset of 1280 samples of the CIFAR-100 dataset. The configurations in the top row and the bottom row are ResNet-34 and ResNet-18, respectively. In both methods, the optimization is stopped when the metric (validation loss or GD) increases for 5 epochs. ", + "bbox": [ + 173, + 376, + 825, + 460 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/b615e2428f50a187c05f725d09643f52905fdd6e8e5a3c20aa1c020fd7ed6ca3.jpg", + "image_caption": [ + "6 VALIDATING GRADIENT DISPARITY AS A GENERALIZATION METRIC ", + "Figure 2: The error percentage and $\\overline { { \\mathcal { D } } }$ during training with different amounts of randomness in the training labels for an AlexNet trained on a subset of $1 2 . 8 \\mathrm { ~ k ~ }$ points of the MNIST training dataset. Pearson’s correlation coefficient between gradient disparity and test error (TE)/test loss (TL) over all the iterations and over all levels of randomness are $\\rho _ { \\overline { { D } } , \\mathrm { T E } } = 0 . 8 6 1$ and $\\rho _ { \\overline { { D } } , \\mathrm { T L } } = 0 . 8 0 2$ . The generalization error (gap) is the difference between the train and test errors. " + ], + "image_footnote": [], + "bbox": [ + 179, + 520, + 816, + 650 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we demonstrate that factors that contribute to improve or degrade the generalization performance of a model (e.g., label noise level, training set size and batch size), have an often strikingly similar effect on the value of gradient disparity as well. ", + "bbox": [ + 173, + 750, + 825, + 791 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Label Noise Level. Deep neural networks, trained with the SGD algorithm, achieve excellent generalization performance (Hardt et al., 2015), while achieving zero training error on randomly labeled data in classification tasks (Zhang et al., 2016). Understanding what distinguishes the model when it is trained on correct labels and when it is trained on randomly labeled data is still an evolving area of research. We conjecture that as label noise level increases, the gradient vectors diverge more. Hence, when the network is trained with correctly labeled samples, the gradient disparity is low, whereas when it is trained with corrupted samples the gradient disparity is high. The experimental results support this conjecture in a wide range of settings and show that gradient disparity is indeed very sensitive to label noise level (see also Figures 12, 15, 19 and 20). ", + "bbox": [ + 173, + 797, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Figure 2 shows the test error for networks trained with different amounts of label noise. Interestingly, observe that for this setting the test error for the network trained with $7 5 \\%$ label noise remains relatively small, indicating the good resistance of the model against memorization of corrupted samples. As suggested both from the test error (Figure 2 (a)) and the average gradient disparity (Figure 2 (c)), there is no proper early stopping time for these experiments. The generalization error (Figure 2 (b)) remains close to zero, regardless of the level of label noise, and hence fails to account for label noise. In contrast, the average gradient disparity is very sensitive to the label noise level in all stages of training as shown in Figure 2 (c), as desired for a metric measuring generalization. ", + "bbox": [ + 173, + 103, + 825, + 215 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Training Set Size. The test error decreases with the size of the training set (Figure 3 (left)) and a reliable generalization metric should therefore reflect this property. Many of the previous metrics fail to do so, as shown by (Neyshabur et al., 2017a; Nagarajan & Kolter, 2019). In contrast, the average gradient disparity indeed clearly decreases with the size of the training set, as shown in Figure 3 (right) (see also Figure 17 in Appendix E). ", + "bbox": [ + 174, + 222, + 483, + 361 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Batch Size. In practice, the test error increases with the batch size (Figure 4 (left)). We observe that gradient disparity also increases with the batch size (Figure 4 (right)). This observation is counter-intuitive because one might expect that gradient vectors get more similar when they are averaged over a larger batch. This might be the explanation behind the decrease in gradient disparity from batch size 256 to 512 for the VGG19 network. Observe also that gradient disparity correctly predicts that VGG-19 generalizes better than ResNet-34 for this dataset. Gradient disparity matches the ranking of test errors for different networks, trained with different batch sizes, as long as the batch sizes are not too large (see also Figure 18 in Appendix E). ", + "bbox": [ + 174, + 368, + 483, + 590 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Width. In practice, the test error has been observed to decrease with the network width. We ", + "bbox": [ + 174, + 598, + 483, + 625 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/db450df886d058c290711b4a230906804ee0fb34db7654ec52da7ad44e2f65e3.jpg", + "image_caption": [ + "Figure 3: The test error (TE) and average gradient disparity $( \\overline { { \\mathcal { D } } } )$ for networks that are trained (until reaching the training loss value of 0.01) over training sets with different sizes. We observe a very strong positive correlation: $\\rho _ { \\overline { { D } } , \\mathrm { T E } } = 0 . 9 8 4$ . " + ], + "image_footnote": [], + "bbox": [ + 498, + 227, + 821, + 310 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/4e6ec1b225122db40a09ebb9b563e856f3acbe204424cde7192fd84787dd7fb2.jpg", + "image_caption": [ + "Figure 4: The test error and average gradient disparity for networks that are trained with different batch sizes. A ResNet-34 and a VGG-19 network that are trained on the CIFAR-10 dataset. The correlation between $\\overline { { \\mathcal { D } } }$ and test error (TE) for ResNet-34, VGG-19, and both graphs combined are $\\rho _ { \\overline { { D } } , \\mathrm { T E } } = 0 . 9 8 5$ , $\\rho _ { \\overline { { \\mathcal { D } } } , \\mathrm { T E } } = 0 . 9 2 6$ , and $\\rho _ { \\overline { { D } } , \\mathrm { T E } } = 0 . 8 9 3$ , respectively. " + ], + "image_footnote": [], + "bbox": [ + 498, + 404, + 821, + 487 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "observe that gradient disparity (normalized with respect to the number of parameters) also decreases with network width for ResNet, VGG and fully connected neural networks that are trained on the CIFAR-10 dataset (see Figure 14 in Appendix E.2). ", + "bbox": [ + 174, + 626, + 826, + 666 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "7 DISCUSSION AND RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 689, + 496, + 705 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Finding a practical metric that completely captures the generalization properties of deep neural networks, and in particular indicates the level of randomness in the labels and decreases with the size of the training set, is still an active research direction (Dziugaite & Roy, 2017; Neyshabur et al., 2017a; Nagarajan & Kolter, 2019). A very recent line of work assesses the similarity between the gradient updates of two batches (samples) in the training set. The coherent gradient hypothesis (Chatterjee, 2020) states that the gradient is stronger in directions where similar examples exist and towards which the parameter update is biased. He & Su (2020) presents the local elasticity phenomenon, which measures how prediction over one sample changes, as the network is updated on another sample. The generalization penalty introduced in our work measures how the prediction over one sample (batch) changes when the network is updated on the same sample instead of being updated on another sample, which can signal overfitting implicitly within the training set. ", + "bbox": [ + 174, + 722, + 825, + 875 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Tracking generalization by measuring the similarity between gradient vectors is particularly beneficial as it is empirically tractable during training and does not require access to unseen data. Sankararaman et al. (2019) proposes gradient confusion, which is a bound on the inner product of two gradient vectors, and shows that the larger the gradient confusion is, the slower the convergence takes place. Gradient interference (when the inner product of gradient vectors is negative) has been studied in multi-task learning, reinforcement learning and temporal difference learning (Riemer et al., 2018; Liu et al., 2019; Bengio et al., 2020). Yin et al. (2017) studies the relation between gradient diversity, which measures the dissimilarity between gradient vectors, and the convergence performance of distributed SGD algorithms. Fort et al. (2019) proposes a metric called stiffness, which is the cosine similarity between two gradient vectors, and shows empirically that it is related to generalization. Fu et al. (2020) studies the cosine similarity between two gradient vectors for natural language processing tasks. Mehta et al. (2020) measures the alignment between the gradient vectors within the same class (denoted by $\\Omega _ { c , - }$ ), and studies the relation between $\\Omega _ { c }$ and generalization as the scale of initialization is increased. ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 256 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Another interesting line of work is the study of the variance of gradients in deep learning settings. Negrea et al. (2019) derives mutual information generalization error bounds for stochastic gradient Langevin dynamics (SGLD) as a function of the sum (over the iterations) of square gradient incoherences, which is closely related to gradients variance. Two-sample gradient incoherences also appear in Haghifam et al. (2020), there are taken between a training sample and a ”ghost” sample that is not used during training and therefore taken from a validation set (unlike gradient disparity). The upper bounds in Negrea et al. (2019); Haghifam et al. (2020) are not intended to be used as early stopping criteria and are cumulative bounds that increase with the number of iterations. As shown in Appendix G, gradient disparity can be used as an early stopping criterion not only for SGD with additive noise (such as SGLD), but also other adaptive optimizers. Jastrzebski et al. (2020) studies the effect of the learning rate on the variance of gradients and hypothesizes that gradient variance counter-intuitively increases with the batch size, which is consistent with our observations. However, Qian & Klabjan (2020) shows that the variance of gradients is a decreasing function of the batch size. Jastrzebski et al. (2020); Qian & Klabjan (2020) mention the connection between variance of gradients and generalization as promising future directions. Our study shows that variance of gradients used as an early stopping criterion outperforms $k$ -fold cross validation (see Table 8). ", + "bbox": [ + 174, + 263, + 825, + 486 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Mahsereci et al. (2017) proposes an early stopping criterion called evidence-based criterion (EB) that eliminates the need for a held-out validation set, similarly to gradient disparity. The EB-criterion is negatively related to the signal-to-noise ratio (SNR) of the gradient vectors. Liu et al. (2020) also proposes a relation between gradient SNR (called GSNR) and the one-step generalization error, with the assumption that both the training and the test sets are large, whereas gradient disparity targets limited datasets. Nevertheless, we have compared gradient disparity to these metrics (namely, EB, GSNR, gradient inner product, sign of the gradient inner product, variance of gradients, cosine similarity, and $\\Omega _ { c , - }$ ) in Appendix H. In Table 8, we observe that gradient disparity and variance of gradients used as early stopping criteria are the only metrics that consistently outperform $k$ -fold cross validation, and that are more informative of the level of label noise compared to other metrics. We observe that the correlation between gradient disparity and the test loss is however in general larger than the correlation between variance of gradients and the test loss (Table 9). ", + "bbox": [ + 174, + 492, + 825, + 659 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "A common drawback of the metrics based on the similarity between two gradient vectors, including gradient disparity, is that they are not informative when the gradient vectors are very small. In practice however, we observe (see for instance Figure 13) that the time at which the test and training losses start to diverge, which is the time when overfitting kicks in, does not only coincide with the time at which gradient disparity increases, but also occurs much before the training loss becomes infinitesimal. Hence, this drawback is unlikely to cause a problem for gradient disparity when it is used as an early stopping criterion. Nevertheless, Theorem 1 trivially holds when the gradient values are infinitesimal. ", + "bbox": [ + 174, + 666, + 825, + 776 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Conclusion. In this work, we propose gradient disparity, which is the $\\ell _ { 2 }$ norm of the difference between the gradient vectors of pairs of batches in the training set. Our empirical results on state-ofthe-art configurations show indeed a strong link between gradient disparity and generalization error. Gradient disparity, similar to the test error, increases with the label noise level, decreases with the size of the training set and increases with the batch size. We therefore suggest, particularly when the available dataset is limited or noisy, gradient disparity as a promising early stopping criterion that does not require access to a validation set. ", + "bbox": [ + 174, + 784, + 825, + 882 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 102, + 287, + 117 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "I Bellido and Emile Fiesler. Do backpropagation trained neural networks have normal weight distributions? In International Conference on Artificial Neural Networks, pp. 772–775. Springer, 1993. ", + "bbox": [ + 176, + 126, + 823, + 167 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Emmanuel Bengio, Joelle Pineau, and Doina Precup. Interference and generalization in temporal difference learning. arXiv preprint arXiv:2003.06350, 2020. ", + "bbox": [ + 169, + 178, + 823, + 207 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Nicholas Bien, Pranav Rajpurkar, Robyn L Ball, Jeremy Irvin, Allison Park, Erik Jones, Michael Bereket, Bhavik N Patel, Kristen W Yeom, Katie Shpanskaya, et al. Deep-learning-assisted diagnosis for knee magnetic resonance imaging: development and retrospective validation of mrnet. PLoS medicine, 15(11):e1002699, 2018. ", + "bbox": [ + 174, + 217, + 825, + 273 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Sat Chatterjee. Coherent gradients: An approach to understanding generalization in gradient descent-based optimization. In International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id $=$ ryeFY0EFwS. ", + "bbox": [ + 174, + 284, + 825, + 325 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "John Duchi, Elad Hazan, and Yoram Singer. Adaptive subgradient methods for online learning and stochastic optimization. Journal of machine learning research, 12(Jul):2121–2159, 2011. ", + "bbox": [ + 173, + 335, + 823, + 364 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Gintare Karolina Dziugaite and Daniel M Roy. Computing nonvacuous generalization bounds for deep (stochastic) neural networks with many more parameters than training data. arXiv preprint arXiv:1703.11008, 2017. ", + "bbox": [ + 173, + 373, + 826, + 416 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Gintare Karolina Dziugaite, Kyle Hsu, Waseem Gharbieh, and Daniel M Roy. On the role of data in pac-bayes bounds. arXiv preprint arXiv:2006.10929, 2020. ", + "bbox": [ + 169, + 426, + 825, + 455 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Stanislav Fort, Paweł Krzysztof Nowak, Stanislaw Jastrzebski, and Srini Narayanan. Stiffness: A new perspective on generalization in neural networks. arXiv preprint arXiv:1901.09491, 2019. ", + "bbox": [ + 173, + 464, + 823, + 494 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Jinlan Fu, Pengfei Liu, Qi Zhang, and Xuanjing Huang. Rethinking generalization of neural models: A named entity recognition case study. arXiv preprint arXiv:2001.03844, 2020. ", + "bbox": [ + 171, + 503, + 821, + 534 + ], + "page_idx": 8 + }, + { + "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, + 541, + 823, + 584 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Jiuxiang Gu, Zhenhua Wang, Jason Kuen, Lianyang Ma, Amir Shahroudy, Bing Shuai, Ting Liu, Xingxing Wang, Gang Wang, Jianfei Cai, et al. Recent advances in convolutional neural networks. Pattern Recognition, 77:354–377, 2018. ", + "bbox": [ + 174, + 594, + 825, + 637 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Mahdi Haghifam, Jeffrey Negrea, Ashish Khisti, Daniel M Roy, and Gintare Karolina Dziugaite. Sharpened generalization bounds based on conditional mutual information and an application to noisy, iterative algorithms. arXiv preprint arXiv:2004.12983, 2020. ", + "bbox": [ + 174, + 646, + 825, + 690 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Moritz Hardt, Benjamin Recht, and Yoram Singer. Train faster, generalize better: Stability of stochastic gradient descent. arXiv preprint arXiv:1509.01240, 2015. ", + "bbox": [ + 171, + 699, + 825, + 728 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Hangfeng He and Weijie Su. The local elasticity of neural networks. In International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id $=$ HJxMYANtPH. ", + "bbox": [ + 173, + 737, + 825, + 780 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Delving deep into rectifiers: Surpassing human-level performance on imagenet classification. In Proceedings of the IEEE international conference on computer vision, pp. 1026–1034, 2015. ", + "bbox": [ + 174, + 790, + 825, + 833 + ], + "page_idx": 8 + }, + { + "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": [ + 173, + 843, + 821, + 886 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Like Hui and Mikhail Belkin. Evaluation of neural architectures trained with square loss vs crossentropy in classification tasks. arXiv preprint arXiv:2006.07322, 2020. ", + "bbox": [ + 174, + 895, + 821, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Stanislaw Jastrzebski, Maciej Szymczak, Stanislav Fort, Devansh Arpit, Jacek Tabor, Kyunghyun Cho, and Krzysztof Geras. The break-even point on optimization trajectories of deep neural networks. arXiv preprint arXiv:2002.09572, 2020. ", + "bbox": [ + 176, + 103, + 823, + 146 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014. ", + "bbox": [ + 173, + 155, + 823, + 184 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Douglas M Kline and Victor L Berardi. Revisiting squared-error and cross-entropy functions for training neural network classifiers. Neural Computing & Applications, 14(4):310–318, 2005. ", + "bbox": [ + 171, + 193, + 823, + 222 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alex Krizhevsky, Ilya Sutskever, and Geoffrey E Hinton. Imagenet classification with deep convolutional neural networks. In Advances in neural information processing systems, pp. 1097–1105, 2012. ", + "bbox": [ + 174, + 229, + 823, + 273 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Mingchen Li, Mahdi Soltanolkotabi, and Samet Oymak. Gradient descent with early stopping is provably robust to label noise for overparameterized neural networks. arXiv preprint arXiv:1903.11680, 2019. ", + "bbox": [ + 173, + 281, + 826, + 325 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jinlong Liu, Yunzhi Bai, Guoqing Jiang, Ting Chen, and Huayan Wang. Understanding why neural networks generalize well through gsnr of parameters. In International Conference on Learning Representations, 2020. URL https://openreview.net/forum?id $\\underline { { \\underline { { \\mathbf { \\Pi } } } } } = \\underline { { \\underline { { \\mathbf { \\delta \\pi } } } } }$ HyevIJStwH. ", + "bbox": [ + 173, + 334, + 826, + 377 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Vincent Liu, Hengshuai Yao, and Martha White. Toward understanding catastrophic interference in value-based reinforcement learning. Optimization Foundations for Reinforcement Learning Workshop at NeurIPS, 2019. ", + "bbox": [ + 173, + 385, + 825, + 428 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Maren Mahsereci, Lukas Balles, Christoph Lassner, and Philipp Hennig. Early stopping without a validation set. arXiv preprint arXiv:1703.09580, 2017. ", + "bbox": [ + 173, + 436, + 823, + 467 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "David McAllester. Simplified pac-bayesian margin bounds. In Learning theory and Kernel machines, pp. 203–215. Springer, 2003. ", + "bbox": [ + 174, + 474, + 823, + 505 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "David A McAllester. Pac-bayesian model averaging. In Proceedings of the twelfth annual conference on Computational learning theory, pp. 164–170, 1999a. ", + "bbox": [ + 173, + 512, + 820, + 542 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "David A McAllester. Some pac-bayesian theorems. Machine Learning, 37(3):355–363, 1999b. ", + "bbox": [ + 174, + 550, + 797, + 566 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Harsh Mehta, Ashok Cutkosky, and Behnam Neyshabur. Extreme memorization via scale of initialization. arXiv preprint arXiv:2008.13363, 2020. ", + "bbox": [ + 173, + 574, + 823, + 604 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Vaishnavh Nagarajan and J Zico Kolter. Uniform convergence may be unable to explain generalization in deep learning. In Advances in Neural Information Processing Systems, pp. 11611–11622, 2019. ", + "bbox": [ + 174, + 612, + 823, + 655 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jeffrey Negrea, Mahdi Haghifam, Gintare Karolina Dziugaite, Ashish Khisti, and Daniel M Roy. Information-theoretic generalization bounds for sgld via data-dependent estimates. In Advances in Neural Information Processing Systems, pp. 11013–11023, 2019. ", + "bbox": [ + 173, + 664, + 823, + 708 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Behnam Neyshabur, Srinadh Bhojanapalli, David McAllester, and Nati Srebro. Exploring generalization in deep learning. In Advances in Neural Information Processing Systems, pp. 5947–5956, 2017a. ", + "bbox": [ + 176, + 715, + 825, + 758 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Behnam Neyshabur, Srinadh Bhojanapalli, and Nathan Srebro. A pac-bayesian approach to spectrally-normalized margin bounds for neural networks. arXiv preprint arXiv:1707.09564, 2017b. ", + "bbox": [ + 174, + 767, + 825, + 810 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Lutz Prechelt. Early stopping-but when? In Neural Networks: Tricks of the trade, pp. 55–69. Springer, 1998. ", + "bbox": [ + 173, + 819, + 821, + 848 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ning Qian. On the momentum term in gradient descent learning algorithms. Neural networks, 12 (1):145–151, 1999. ", + "bbox": [ + 173, + 857, + 821, + 886 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Xin Qian and Diego Klabjan. The impact of the mini-batch size on the variance of gradients in stochastic gradient descent. arXiv preprint arXiv:2004.13146, 2020. ", + "bbox": [ + 174, + 895, + 821, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Matthew Riemer, Ignacio Cases, Robert Ajemian, Miao Liu, Irina Rish, Yuhai Tu, and Gerald Tesauro. Learning to learn without forgetting by maximizing transfer and minimizing interference. arXiv preprint arXiv:1810.11910, 2018. ", + "bbox": [ + 178, + 103, + 823, + 146 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yuji Roh, Geon Heo, and Steven Euijong Whang. A survey on data collection for machine learning: a big data-ai integration perspective. IEEE Transactions on Knowledge and Data Engineering, 2019. ", + "bbox": [ + 176, + 155, + 821, + 196 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Sebastian Ruder. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747, 2016. ", + "bbox": [ + 171, + 207, + 825, + 236 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Karthik A Sankararaman, Soham De, Zheng Xu, W Ronny Huang, and Tom Goldstein. The impact of neural network overparameterization on gradient confusion and stochastic gradient descent. arXiv preprint arXiv:1904.06963, 2019. ", + "bbox": [ + 173, + 243, + 823, + 286 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Karen Simonyan and Andrew Zisserman. Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556, 2014. ", + "bbox": [ + 173, + 295, + 821, + 325 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Daniel Soudry, Elad Hoffer, Mor Shpigel Nacson, Suriya Gunasekar, and Nathan Srebro. The implicit bias of gradient descent on separable data. The Journal of Machine Learning Research, 19 (1):2822–2878, 2018. ", + "bbox": [ + 173, + 333, + 825, + 376 + ], + "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": [ + 174, + 385, + 823, + 428 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Mervyn Stone. Cross-validatory choice and assessment of statistical predictions. Journal of the Royal Statistical Society: Series B (Methodological), 36(2):111–133, 1974. ", + "bbox": [ + 173, + 436, + 823, + 465 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Yuan Yao, Lorenzo Rosasco, and Andrea Caponnetto. On early stopping in gradient descent learning. Constructive Approximation, 26(2):289–315, 2007. ", + "bbox": [ + 173, + 474, + 821, + 503 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Dong Yin, Ashwin Pananjady, Max Lam, Dimitris Papailiopoulos, Kannan Ramchandran, and Peter Bartlett. Gradient diversity: a key ingredient for scalable distributed learning. arXiv preprint arXiv:1706.05699, 2017. ", + "bbox": [ + 173, + 512, + 825, + 554 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Matthew D Zeiler. Adadelta: an adaptive learning rate method. arXiv preprint arXiv:1212.5701, 2012. ", + "bbox": [ + 173, + 564, + 823, + 593 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, and Oriol Vinyals. Understanding deep learning requires rethinking generalization. arXiv preprint arXiv:1611.03530, 2016. ", + "bbox": [ + 173, + 602, + 823, + 631 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A ADDITIONAL THEOREM ", + "text_level": 1, + "bbox": [ + 176, + 102, + 410, + 118 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Hoeffding’s bound is used in the proof of Theorem 1, and Lemma 1 is used in Section 4. ", + "bbox": [ + 171, + 133, + 753, + 148 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Theorem 2 (Hoeffding’s Bound). Let $Z _ { 1 } , \\cdots , Z _ { n }$ be independent bounded random variables on $[ a , b ]$ (i.e., $Z _ { i } \\in [ a , b ]$ for all $1 \\leq i \\leq n$ with $- \\infty < a \\le b < \\infty ,$ ). Then ", + "bbox": [ + 169, + 152, + 825, + 183 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/109f6469cf991d055e4b0d23a049045c414e61a4f199945dce796363ed13b975.jpg", + "text": "$$\n\\mathbb { P } \\left( { \\frac { 1 } { n } } \\sum _ { i = 1 } ^ { n } \\left( Z _ { i } - \\mathbb { E } [ Z _ { i } ] \\right) \\geq t \\right) \\leq \\exp \\left( - { \\frac { 2 n t ^ { 2 } } { ( b - a ) ^ { 2 } } } \\right)\n$$", + "text_format": "latex", + "bbox": [ + 325, + 189, + 671, + 232 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 239, + 204, + 253 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/e9119d957c96b52458a724335a16e8517fac09d3ccb8680ca6f42a45b22b2af5.jpg", + "text": "$$\n\\mathbb { P } \\left( \\frac { 1 } { n } \\sum _ { i = 1 } ^ { n } \\left( Z _ { i } - \\mathbb { E } [ Z _ { i } ] \\right) \\leq - t \\right) \\leq \\exp \\left( - \\frac { 2 n t ^ { 2 } } { ( b - a ) ^ { 2 } } \\right)\n$$", + "text_format": "latex", + "bbox": [ + 320, + 250, + 678, + 292 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "for all $t \\geq 0$ . ", + "bbox": [ + 171, + 295, + 259, + 310 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Lemma 1 If $N _ { 1 } = \\mathcal { N } ( \\mu _ { 1 } , \\Sigma _ { 1 } )$ and $N _ { 2 } = \\mathcal { N } ( \\mu _ { 2 } , \\Sigma _ { 2 } )$ are two multivariate normal distributions in $\\mathbb { R } ^ { d }$ , where $\\Sigma _ { 1 }$ and $\\Sigma _ { 2 }$ are positive definite, ", + "bbox": [ + 173, + 321, + 825, + 352 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/c3ad7ff532ac9226a22334a6de7b632e4755f96e5c0d5cc88e17980afd4b9c58.jpg", + "text": "$$\n\\mathrm { K L } ( N _ { 1 } | | N _ { 2 } ) = \\frac { 1 } { 2 } \\left( \\mathrm { t r } \\left( \\Sigma _ { 2 } ^ { - 1 } \\Sigma _ { 1 } \\right) - d + ( \\mu _ { 2 } - \\mu _ { 1 } ) ^ { T } \\Sigma _ { 2 } ^ { - 1 } ( \\mu _ { 2 } - \\mu _ { 1 } ) + \\ln \\left( \\frac { \\operatorname * { d e t } \\Sigma _ { 2 } } { \\operatorname * { d e t } \\Sigma _ { 1 } } \\right) \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 220, + 358, + 777, + 393 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "B PROOF OF THEOREM 1 ", + "text_level": 1, + "bbox": [ + 174, + 410, + 397, + 426 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Proof. We compute the upper bound in Equation (3) using a similar approach as in McAllester (2003). The main challenge in the proof is the definition of a function $X _ { S _ { 2 } }$ of the variables and parameters of the problem, which can then be bounded using similar techniques as in McAllester (2003). $S _ { 1 }$ is a batch of points (with size $m _ { 1 }$ ) that is randomly drawn from the available set $S$ at the beginning of iteration $t$ , and $S _ { 2 }$ is a batch of points (with size $m _ { 2 }$ ) that is randomly drawn from the remaining set $S \\setminus S _ { 1 }$ . Hence, $S _ { 1 }$ and $S _ { 2 }$ are drawn from the set $S$ without replacement $( S _ { 1 } \\cap S _ { 2 } = \\emptyset )$ . Similar to the setting of Negrea et al. (2019); Dziugaite et al. (2020), as the random selection of indices of $S _ { 1 }$ and $S _ { 2 }$ is independent from the dataset $S$ , $\\sigma ( S _ { 1 } )$ ⊥⊥ $\\sigma ( S _ { 2 } )$ , and as a result, $\\mathcal { G } _ { 1 } \\perp \\perp \\sigma ( S _ { 2 } )$ and $\\mathcal { G } _ { 2 }$ ⊥⊥ $\\sigma ( S _ { 1 } )$ . Recall that $\\nu _ { i }$ is the random parameter vector at the end of iteration $t$ that depends on $S _ { i }$ , for $i \\in \\{ 1 , 2 \\}$ . For a given sample set $S _ { i }$ , denote the conditional probability distribution of $\\nu _ { i }$ by $Q _ { S _ { i } }$ . For ease of notation, we represent $Q _ { S _ { i } }$ by $Q _ { i }$ . ", + "bbox": [ + 173, + 440, + 825, + 597 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Let us denote ", + "bbox": [ + 173, + 602, + 264, + 616 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/cd4a58dc7ddd196a631be50f40f1df4f6c183f0d89a391fbe43c85ebfc24ae23.jpg", + "text": "$$\n\\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } \\right) \\triangleq \\left( L _ { S _ { 2 } } ( h _ { \\nu _ { 1 } } ) - L ( h _ { \\nu _ { 1 } } ) \\right) - \\left( L _ { S _ { 2 } } ( h _ { \\nu _ { 2 } } ) - L ( h _ { \\nu _ { 2 } } ) \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 285, + 622, + 709, + 642 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 650, + 200, + 662 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/e5a48269a6ab0da9926fe6a436e36feaed9784354a20dcbd5aa7ba760d9831b2.jpg", + "text": "$$\nX _ { S _ { 2 } } \\triangleq \\operatorname* { s u p } _ { Q _ { 1 } , Q _ { 2 } } ( \\frac { m _ { 2 } } { 2 } - 1 ) \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } [ \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } [ ( \\Delta ( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } ) ) ^ { 2 } ] ] - \\mathrm { K L } ( Q _ { 2 } | | Q _ { 1 } ) .\n$$", + "text_format": "latex", + "bbox": [ + 233, + 659, + 763, + 691 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Note that $X _ { S _ { 2 } }$ is a random function of the batch $S _ { 2 }$ . Expanding the KL-divergence, we find that ", + "bbox": [ + 171, + 694, + 799, + 710 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/ce813360595d41b1d7da0222f2e52cc9915e207febaf37dfe381a7f1b72dabde.jpg", + "text": "$$\n\\begin{array} { r l } & { \\left( \\frac { m _ { 2 } } { 2 } - 1 \\right) \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } \\left[ ( \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } \\right) ) ^ { 2 } \\right] \\right] - \\operatorname { K L } ( Q _ { 2 } | | Q _ { 1 } ) } \\\\ & { \\qquad = \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ \\left( \\frac { m _ { 2 } } { 2 } - 1 \\right) \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } \\left[ ( \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } \\right) ) ^ { 2 } \\right] + \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } \\left[ \\ln \\frac { Q _ { 1 } \\left( \\nu _ { 2 } \\right) } { Q _ { 2 } \\left( \\nu _ { 2 } \\right) } \\right] \\right] } \\\\ & { \\qquad \\leq \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ \\ln \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } \\left[ e ^ { \\left( \\frac { m _ { 2 } } { 2 } - 1 \\right) \\left( \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } \\right) \\right) ^ { 2 } } \\frac { Q _ { 1 } \\left( \\nu _ { 2 } \\right) } { Q _ { 2 } \\left( \\nu _ { 2 } \\right) } \\right] \\right] } \\\\ & { \\qquad = \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ \\ln \\mathbb { E } _ { \\nu _ { 1 } ^ { \\prime } \\sim Q _ { 1 } } \\left[ e ^ { \\left( \\frac { m _ { 2 } } { 2 } - 1 \\right) \\left( \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 1 } ^ { \\prime } } \\right) \\right) ^ { 2 } } \\right] \\right] , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 207, + 717, + 790, + 853 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "where the inequality above follows from Jensen’s inequality as logarithm is a concave function. Therefore, again by applying Jensen’s inequality ", + "bbox": [ + 173, + 857, + 823, + 887 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/fcd46d6381252be8a47c670281adf02def179d101bc1698ea56412a2f995f340.jpg", + "text": "$$\nX _ { S _ { 2 } } \\leq \\ln \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\mathbb { E } _ { \\nu _ { 1 } ^ { \\prime } \\sim Q _ { 1 } } \\left[ e ^ { ( \\frac { m _ { 2 } } { 2 } - 1 ) \\left( \\Delta ( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 1 } ^ { \\prime } } ) \\right) ^ { 2 } } \\right] .\n$$", + "text_format": "latex", + "bbox": [ + 326, + 893, + 671, + 929 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Taking expectations over $S _ { 2 }$ , we have that ", + "bbox": [ + 174, + 103, + 450, + 118 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/969805e1658551cf70ebf698db4586f118d6bcf5c181918e452b371ef6fbd71b.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { E } _ { S _ { 2 } } \\left[ e ^ { X _ { S _ { 2 } } } \\right] \\leq \\mathbb { E } _ { S _ { 2 } } \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\mathbb { E } _ { \\nu _ { 1 } ^ { \\prime } \\sim Q _ { 1 } } \\left[ e ^ { \\left( \\frac { m _ { 2 } } { 2 } - 1 \\right) \\left( \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 1 } ^ { \\prime } } \\right) \\right) ^ { 2 } } \\right] } \\\\ & { \\qquad = \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\mathbb { E } _ { \\nu _ { 1 } ^ { \\prime } \\sim Q _ { 1 } } \\mathbb { E } _ { S _ { 2 } } \\left[ e ^ { \\left( \\frac { m _ { 2 } } { 2 } - 1 \\right) \\left( \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 1 } ^ { \\prime } } \\right) \\right) ^ { 2 } } \\right] , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 297, + 126, + 699, + 196 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "where the change of order in the expectation follows from the independence of the draw of the set $S _ { 2 }$ from $\\nu _ { 1 } \\sim Q _ { 1 }$ and $\\nu _ { 1 } ^ { \\prime } \\sim Q _ { 1 }$ , i.e., $Q _ { 1 }$ is $\\mathcal { G } _ { 1 }$ -measurable and $\\mathcal { G } _ { 1 }$ ⊥⊥ $\\sigma ( S _ { 2 } )$ . ", + "bbox": [ + 173, + 202, + 823, + 231 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Now let ", + "bbox": [ + 173, + 237, + 230, + 251 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/e008e6b2e0cb43bb02ebcd9d18d97bf118260e10f638b6f64542245b707282f1.jpg", + "text": "$$\nZ _ { i } \\triangleq l ( h _ { \\nu _ { 1 } } ( x _ { i } ) , y _ { i } ) - l ( h _ { \\nu _ { 1 } ^ { \\prime } } ( x _ { i } ) , y _ { i } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 375, + 250, + 619, + 270 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "for all $1 \\leq i \\leq m _ { 2 }$ . Clearly, $Z _ { i } \\in [ - 1 , 1 ]$ and because of Equations (1) and of the definition of $\\Delta$ in Equation (7), ", + "bbox": [ + 176, + 273, + 825, + 303 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/56a0dedc4855068ebb05307cd5358c3ec91802b6f27d87702a8b5e988a2abc57.jpg", + "text": "$$\n\\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 1 } ^ { \\prime } } \\right) = \\frac { 1 } { m _ { 2 } } \\sum _ { i = 1 } ^ { m _ { 2 } } \\left( Z _ { i } - \\mathbb { E } [ Z _ { i } ] \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 369, + 301, + 627, + 343 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Hoeffding’s bound (Theorem 2) implies therefore that for any $t \\geq 0$ , ", + "bbox": [ + 173, + 345, + 622, + 361 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/33892f16b37239529418f9e22776a837f0a4cc6e411800f03768381804bec41e.jpg", + "text": "$$\n\\mathbb { P } _ { S _ { 2 } } \\left( | \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 1 } ^ { \\prime } } \\right) | \\geq t \\right) \\leq 2 e ^ { - \\frac { m _ { 2 } } { 2 } t ^ { 2 } } .\n$$", + "text_format": "latex", + "bbox": [ + 370, + 367, + 625, + 390 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Denoting by $p ( \\Delta )$ the probability density function of $| \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 1 } ^ { \\prime } } \\right) |$ , inequality (10) implies that for any $t \\geq 0$ , ", + "bbox": [ + 173, + 397, + 826, + 426 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/b8800df81490fec32cab054c6de4b593a095c84d76241c881f77d56e00d00d85.jpg", + "text": "$$\n\\int _ { t } ^ { \\infty } p ( \\Delta ) d \\Delta \\leq 2 e ^ { - \\frac { m _ { 2 } } { 2 } t ^ { 2 } } .\n$$", + "text_format": "latex", + "bbox": [ + 410, + 425, + 589, + 459 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The density $\\tilde { p } ( \\Delta )$ that maximizes $\\begin{array} { r } { \\int _ { 0 } ^ { \\infty } e ^ { ( \\frac { m _ { 2 } } { 2 } - 1 ) \\Delta ^ { 2 } } p ( \\Delta ) d \\Delta } \\end{array}$ (the term in the first expectation of the upper bound of Equation (9)), is the density achieving equality in (11), which is $\\tilde { p } ( \\Delta ) = 2 m _ { 2 } \\Delta e ^ { - \\frac { m _ { 2 } } { 2 } \\Delta ^ { 2 } }$ . As a result, ", + "bbox": [ + 173, + 463, + 825, + 512 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/f589b7792e45b0f19ba0685bde1391efdee095b5e93702dde92e88d9e21f1e94.jpg", + "text": "$$\n\\mathbb { E } _ { S _ { 2 } } \\left[ e ^ { ( \\frac { m _ { 2 } } { 2 } - 1 ) \\Delta ^ { 2 } } \\right] \\le \\int _ { 0 } ^ { \\infty } e ^ { ( \\frac { m _ { 2 } } { 2 } - 1 ) \\Delta ^ { 2 } } 2 m _ { 2 } \\Delta e ^ { - \\frac { m _ { 2 } } { 2 } \\Delta ^ { 2 } } d \\Delta = \\int _ { 0 } ^ { \\infty } 2 m _ { 2 } \\Delta e ^ { - \\Delta ^ { 2 } } d \\Delta = m _ { 2 } \\Delta .\n$$", + "text_format": "latex", + "bbox": [ + 214, + 518, + 782, + 554 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "and consequently, inequality (9) becomes ", + "bbox": [ + 174, + 559, + 446, + 574 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/884bf49ace30aab616bfcedd4bb129ba446e507e4b5da3cef6357fb65e87d538.jpg", + "text": "$$\n\\mathbb { E } _ { S _ { 2 } } \\left[ e ^ { X _ { S _ { 2 } } } \\right] \\leq m _ { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 434, + 582, + 562, + 602 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Applying Markov’s inequality on $X _ { S _ { 2 } }$ , we have therefore that for any $0 < \\delta \\leq 1$ , ", + "bbox": [ + 174, + 607, + 707, + 623 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/040e2db6fb2d7e5e649bf7d6306df75da5ffdbbd02c542ddd8673cd7d618bf93.jpg", + "text": "$$\n\\mathbb { P } _ { S _ { 2 } } \\left[ X _ { S _ { 2 } } \\geq \\ln \\frac { 2 m _ { 2 } } { \\delta } \\right] = \\mathbb { P } _ { S _ { 2 } } \\left[ e ^ { X _ { S _ { 2 } } } \\geq \\frac { 2 m _ { 2 } } { \\delta } \\right] \\leq \\frac { \\delta } { 2 m _ { 2 } } \\mathbb { E } _ { S _ { 2 } } \\left[ e ^ { X _ { S _ { 2 } } } \\right] \\leq \\frac { \\delta } { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 259, + 630, + 736, + 665 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Replacing $X _ { S _ { 2 } }$ by its expression defined in Equation (8), the previous inequality shows that with probability at least $1 - \\delta / 2$ ", + "bbox": [ + 171, + 671, + 823, + 700 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/7b4d4b516b77fb7cc3c48405f79a7ef91a1b0a9c162e8d8b8af79f279690c9ca.jpg", + "text": "$$\n\\left( \\frac { m _ { 2 } } { 2 } - 1 \\right) \\ \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } \\left[ ( \\Delta ( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } ) ) ^ { 2 } \\right] - \\mathbf { K L } ( Q _ { 2 } | | Q _ { 1 } ) \\leq \\ln \\frac { 2 m _ { 2 } } { \\delta } .\n$$", + "text_format": "latex", + "bbox": [ + 256, + 707, + 740, + 737 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Using Jensen’s inequality and the convexity of $\\left( \\Delta ( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } ) \\right) ^ { 2 }$ , and assuming that $m _ { 2 } \\ > \\ 2$ , we therefore have that with probability at least $1 - \\delta / 2$ , ", + "bbox": [ + 173, + 746, + 825, + 776 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/1af0164fa4e8285d398793a49d63561c176b8e54dfefcaf0a6047f92f0d9ac00.jpg", + "text": "$$\n( \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } [ \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } \\right) ] ) ^ { 2 } \\le \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } \\left[ ( \\Delta \\left( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } \\right) ) ^ { 2 } \\right] \\le \\frac { \\mathrm { K L } ( Q _ { 2 } | | Q _ { 1 } ) + \\ln \\frac { 2 m _ { 2 } } { \\delta } } { \\frac { m _ { 2 } } { 2 } - 1 } .\n$$", + "text_format": "latex", + "bbox": [ + 181, + 782, + 820, + 820 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Replacing $\\Delta ( h _ { \\nu _ { 1 } } , h _ { \\nu _ { 2 } } )$ by its expression Equation (7) in the above inequality, yields that with probability at least $1 - \\delta / 2$ over the choice of the sample set $S _ { 2 }$ , ", + "bbox": [ + 171, + 827, + 821, + 858 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/db9d37d6b183fba03f1d3cddaee98f26a8e02e382c0afd6b4d7dd223bdf266e6.jpg", + "text": "$$\n\\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ L _ { S _ { 2 } } ( h _ { \\nu _ { 1 } } ) - L ( h _ { \\nu _ { 1 } } ) \\right] \\le \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } \\left[ L _ { S _ { 2 } } ( h _ { \\nu _ { 2 } } ) - L ( h _ { \\nu _ { 2 } } ) \\right] + \\sqrt { \\frac { 2 { \\mathrm { K L } } ( Q _ { 2 } | | Q _ { 1 } ) + 2 \\ln \\frac { 2 m _ { 2 } } { \\delta } } { m _ { 2 } - 2 } } .\n$$", + "text_format": "latex", + "bbox": [ + 187, + 864, + 810, + 907 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Similar computations with $S _ { 1 }$ and $S _ { 2 }$ switched, and considering that $m _ { 1 } ~ > ~ 2$ , yields that with probability at least $1 - \\delta / 2$ over the choice of the sample set $S _ { 1 }$ , ", + "bbox": [ + 171, + 103, + 823, + 133 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/9a508a35d7c0800aa2e2f006039789352d1c922d8134eb8c473cdec86dd7bbb9.jpg", + "text": "$$\n\\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } \\left[ L _ { S _ { 1 } } ( h _ { \\nu _ { 2 } } ) - L ( h _ { \\nu _ { 2 } } ) \\right] \\le \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } \\left[ L _ { S _ { 1 } } ( h _ { \\nu _ { 1 } } ) - L ( h _ { \\nu _ { 1 } } ) \\right] + \\sqrt { \\frac { 2 \\mathrm { K L } ( Q _ { 1 } | | Q _ { 2 } ) + 2 \\ln \\frac { 2 m _ { 1 } } { \\delta } } { m _ { 1 } - 2 } } .\n$$", + "text_format": "latex", + "bbox": [ + 187, + 138, + 808, + 183 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The events in Equations (12) and (13) jointly hold with probability at least $1 - \\delta$ over the choice of the sample sets $S _ { 1 }$ and $S _ { 2 }$ (using the union bound and De Morgan’s law), and by adding the two inequalities we therefore have ", + "bbox": [ + 176, + 202, + 825, + 244 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/e97f0b9cdc37011a744288d288d434b6f68a1d30774272d351c546862920cc34.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } [ L _ { S _ { 2 } } ( h _ { \\nu _ { 1 } } ) ] + \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } [ L _ { S _ { 1 } } ( h _ { \\nu _ { 2 } } ) ] \\leq \\mathbb { E } _ { \\nu _ { 2 } \\sim Q _ { 2 } } [ L _ { S _ { 2 } } ( h _ { \\nu _ { 2 } } ) ] + \\mathbb { E } _ { \\nu _ { 1 } \\sim Q _ { 1 } } [ L _ { S _ { 1 } } ( h _ { \\nu _ { 1 } } ) ] } \\\\ & { \\qquad + \\sqrt { \\frac { 2 \\mathrm { K L } ( Q _ { 2 } \\| Q _ { 1 } ) + 2 \\mathrm { l n } \\frac { 2 m _ { 2 } } { \\delta } } { m _ { 2 } - 2 } } + \\sqrt { \\frac { 2 \\mathrm { K L } ( Q _ { 1 } \\| Q _ { 2 } ) + 2 \\mathrm { l n } \\frac { 2 m _ { 1 } } { \\delta } } { m _ { 1 } - 2 } } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 187, + 253, + 808, + 319 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "which concludes the proof. ", + "bbox": [ + 174, + 323, + 352, + 338 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C COMMON EXPERIMENTAL DETAILS ", + "text_level": 1, + "bbox": [ + 174, + 358, + 506, + 375 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The training objective in our experiments is to minimize the cross-entropy loss, and both the cross entropy and the error percentage are displayed. The training error is computed using Equation (1) over the training set. The empirical test error also follows Equation (1) but it is computed over the test set. The generalization loss (respectively, error) is the difference between the test and the training cross entropy losses (resp., classification errors). The batch size in our experiments is 128 unless otherwise stated, the SGD learning rate is $\\gamma = 0 . 0 1$ and no momentum is used (unless otherwise stated). All the experiments took at most few hours on one Nvidia Titan X Maxwell GPU. All the reported values throughout the paper are an average over at least 5 runs. ", + "bbox": [ + 173, + 388, + 825, + 501 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "To present results throughout the training, in the $\\mathbf { X }$ -axis of figures, both epoch and iteration are used: an epoch is the time spent to pass through the entire dataset, and an iteration is the time spent to pass through one batch of the dataset. Thus, each epoch has $B$ iterations, where $B$ is the number of batches. The convolutional neural network configurations we use are: AlexNet (Krizhevsky et al., 2012), VGG (Simonyan & Zisserman, 2014) and ResNet (He et al., 2016). In those experiments with varying width, we use a scaling factor to change both the number of channels and the number of hidden units in convolutional and fully connected layers, respectively. The default configuration is with scaling factor $= 1$ . ", + "bbox": [ + 174, + 507, + 825, + 619 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In experiments with a random labeled training set, we modify the dataset similar to Chatterjee (2020). For a fraction of the training samples, which is the amount of noise $( 0 \\%$ , $2 5 \\%$ , $5 0 \\%$ , $7 5 \\%$ , $1 0 0 \\%$ ), we choose the labels at random. For a classification dataset with a number $k$ of classes, if the label noise is $2 5 \\%$ , then on average $7 5 \\% + 2 5 \\% * 1 / k$ of the training points still have the correct label. ", + "bbox": [ + 173, + 626, + 825, + 695 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C.1 RE-SCALING THE LOSS ", + "text_level": 1, + "bbox": [ + 174, + 712, + 379, + 727 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Let us track the evolution of gradient disparity (Equation (6)) during training. As training progresses, the training losses of all the batches start to decrease when they get selected for the parameter update. Therefore, the value of gradient disparity might decrease, not necessarily because the distance between the two gradient vectors is decreasing, but because the value of each gradient vector is itself decreasing. To avoid this, a re-scaling or normalization of the loss is needed to compare gradient disparity at different stages of training. Note that this re-scaling or normalization does not affect the training algorithm, only the computation of gradient disparity. ", + "bbox": [ + 174, + 738, + 825, + 837 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We perform both re-scaling and normalization. The re-scaling of the loss values is given by ", + "bbox": [ + 173, + 103, + 483, + 132 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/4729007c3d01179d05a662f45284597610741a3f0fc79eb306acb9ec88160b5d.jpg", + "text": "$$\nL _ { S _ { j } } = \\frac { 1 } { m _ { j } } \\sum _ { i = 1 } ^ { m _ { j } } \\frac { l _ { i } } { \\mathrm { s t d } _ { i } \\left( l _ { i } \\right) } ,\n$$", + "text_format": "latex", + "bbox": [ + 246, + 138, + 410, + 181 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "where with some abuse of notation, $l _ { i }$ is the cross entropy loss for the data point $i$ in the batch $S _ { j }$ . The normalization of the loss values is given by ", + "bbox": [ + 173, + 188, + 485, + 243 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/a51c79ecc37170f73f90e648bee7aa44bfb7200f115cd672121fd505a95e6fc8.jpg", + "text": "$$\nL _ { S _ { j } } = \\frac { 1 } { m _ { j } } \\sum _ { i = 1 } ^ { m _ { j } } \\frac { l _ { i } - \\mathbf { M i n } _ { i } \\left( l _ { i } \\right) } { \\mathbf { M a x } _ { i } \\left( l _ { i } \\right) - \\mathbf { M i n } _ { i } \\left( l _ { i } \\right) } .\n$$", + "text_format": "latex", + "bbox": [ + 202, + 250, + 455, + 292 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "We experimentally compare these two ways of computing gradient disparity in Figure 5. Both the re-scaled and normalized losses, might get ", + "bbox": [ + 174, + 306, + 485, + 348 + ], + "page_idx": 14 + }, + { + "type": "image", + "img_path": "images/7d7e74172a082e45d165a38208e4de5c3f472ad13733a650e3223325ac1fd06c.jpg", + "image_caption": [ + "Figure 5: Normalizing versus re-scaling loss before computing average gradient disparity $\\overline { { \\mathcal { D } } }$ for a VGG-11 trained on $1 2 . 8 \\mathrm { k }$ points of the CIFAR-10 dataset. " + ], + "image_footnote": [], + "bbox": [ + 508, + 109, + 818, + 256 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "unbounded if within each batch the loss values are very close to each other. However, in our experiments, we do not observe gradient disparity becoming unbounded either way. In the presence of outliers, re-scaling is more reliable than normalizing, because with normalization non-outlier data might end up in a very small interval between 0 and 1. This might explain the mismatch between the normalized gradient disparity and generalization loss at the end of training in Figure 5. Therefore, in all experiments presented in the paper, we re-scale the loss values before computing the gradient disparity3. ", + "bbox": [ + 173, + 348, + 826, + 445 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "C.2 THE HYPER-PARAMETER s ", + "text_level": 1, + "bbox": [ + 176, + 462, + 403, + 477 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "In this section, we briefly study the choice of the size $s$ of the subset of batches to compute the average gradient disparity ", + "bbox": [ + 173, + 488, + 485, + 531 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/c17ca0b62a07d12c0496b25ae84cfc80881eb23a0b8457959d9e4289d050cc40.jpg", + "text": "$$\n\\overline { { \\mathcal { D } } } = \\frac { 1 } { s ( s - 1 ) } \\sum _ { i = 1 } ^ { s } \\sum _ { \\substack { j = 1 , j \\neq i } } ^ { s } \\mathcal { D } _ { i , j } .\n$$", + "text_format": "latex", + "bbox": [ + 223, + 536, + 434, + 580 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Figure 6 shows the average gradient disparity when averaged over $s$ number of batches4. When $s = 2$ , gradient disparity is the $\\ell _ { 2 }$ norm distance of the gradients of two randomly selected batches and has a quite high variance. Although with higher values of $s$ the results have lower variance, choosing a higher $s$ is more computationally expensive (refer to Appendix $\\mathrm { D }$ for more details). Therefore, we find ", + "bbox": [ + 173, + 585, + 483, + 710 + ], + "page_idx": 14 + }, + { + "type": "image", + "img_path": "images/40802067588612d3c45dedc4d57d8d4962fdae1aec847d57423b4be2d1eb99bb.jpg", + "image_caption": [ + "Figure 6: Average gradient disparity for different averaging parameter $s$ for a ResNet-18 that has been trained on $1 2 . 8 \\mathrm { k }$ points of the CIFAR-10 dataset. " + ], + "image_footnote": [], + "bbox": [ + 503, + 486, + 818, + 630 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "C.3 THE SURROGATE LOSS FUNCTION", + "text_level": 1, + "bbox": [ + 176, + 103, + 455, + 118 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "It has been shown that cross entropy is better suited for computer-vision classification tasks compared to the mean square error (Kline & Berardi, 2005; Hui & Belkin, 2020). Hence, we choose the cross entropy criterion for all our experiments to avoid possible pitfalls of the mean square error, such as not tracking the confidence of the predictor. ", + "bbox": [ + 174, + 128, + 825, + 185 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Soudry et al. (2018) argues that when using cross entropy, as training proceeds, the magnitude of the network parameters increases. This can potentially affect the value of gradient disparity. Therefore, we compute the magnitude of the network parameters over iterations in various settings. We observe that this increase is very low both at the end of the training and, more importantly, at the time when gradient disparity signals overfitting (denoted by GD epoch in Table 3). Therefore, it is unlikely that the increase in the magnitude of the network parameters affects the value of gradient disparity. ", + "bbox": [ + 173, + 193, + 825, + 276 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Furthermore, we examine gradient disparity for models trained on the mean square error, instead of the cross entropy criterion. We observe a high correlation between gradient disparity and test error/loss (Figure 7), which is consistent with the results obtained using the cross entropy criterion. Therefore, the applicability of gradient disparity as a generalization metric is not limited to settings with the cross entropy criterion. ", + "bbox": [ + 176, + 282, + 823, + 353 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/54bbc9e89969b6d8a1d37a439d1ec3e4b092ec5c693079e54683848e6c3acd27.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Setting at epoch O at GD epoch at epoch 200
AlexNet,MNIST 11.000341.00123
AlexNet, MNIST, 50% random 11.000191.00980
VGG-16,CIFAR-10 11.001071.00127
VGG-16, CIFAR-10, 50% random 11.002221.00233
", + "bbox": [ + 228, + 366, + 771, + 470 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Table 3: The ratio of the magnitude of the network parameter vector at epoch $t$ to the magnitude of the network parameter vector at epoch 0, for $t \\in \\{ 0 , \\mathrm { G D } , 2 0 0 \\}$ , where GD stands for the epoch when gradient disparity signals to stop the training. ", + "bbox": [ + 174, + 479, + 825, + 523 + ], + "page_idx": 15 + }, + { + "type": "image", + "img_path": "images/66878937f48f4a9561666fa97e3006941e04343d159663b761be59b496c3fc83.jpg", + "image_caption": [ + "Figure 7: Test error (TE), test loss (TL), and gradient disparity $( \\overline { { \\mathcal { D } } } )$ for VGG-16 trained with different training set sizes to minimize the mean square error criterion on the CIFAR-10 dataset. The Pearson correlation coefficient between TE and $\\scriptstyle { \\overline { { \\mathcal { D } } } }$ and between $\\mathrm { T L }$ and $\\overline { { \\mathcal { D } } }$ are $\\rho _ { \\overline { { D } } , \\mathrm { T E } } = 0 . 9 7 6$ and $\\rho _ { \\overline { { \\mathcal { D } } } , \\mathrm { T L } } =$ 0.943, respectively. " + ], + "image_footnote": [], + "bbox": [ + 181, + 556, + 797, + 655 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "D $k$ -FOLD CROSS VALIDATION ", + "text_level": 1, + "bbox": [ + 176, + 102, + 442, + 118 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "$k$ -fold cross validation is done by splitting the available dataset into $k$ sets, training on $k - 1$ of them and validating on the remaining one. This is repeated $k$ times so that every set is used once as the validation set. We can adopt two different early stopping approaches: stop the optimization either (i) when the validation loss (respectively, gradient disparity) has increased for $m = 5$ epochs from the beginning of training (which is marked by the gray vertical bar in Figures 8 and 9), or (ii) when the validation loss (resp., gradient disparity) has increased for 5 consecutive epochs (which is indicated by the magenta vertical bar in Figures 8 and 9). When there is low variations and a sharp increase in the value of the metric, the two coincide (for instance, Figure 8 (b) (middle left)). In our experiments, we observe that gradient disparity appears to be less sensitive to the choice of the approaches (i) and (ii) compared to $k$ -fold cross validation. Moreover, in Table 5 we study different values of $m$ , which is usually referred to as patience among practitioners. ", + "bbox": [ + 174, + 140, + 825, + 292 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Early stopping should optimally occur when there is a minimum valley throughout the training in the test loss/error curves, or when the generalization loss/error starts to increase. In those experiments where such a minimum in the test loss curve exists, we compare gradient disparity to the test loss. Otherwise, we compare gradient disparity to the generalization loss. For $k$ -fold cross validation, we compare validation loss to the test loss, because validation loss is expected to predict the test loss. Note that in the experiments with noisy labeled data, all the available data contains corrupted samples, hence both validation loss and gradient disparity are computed over sets which may contain corrupted samples. ", + "bbox": [ + 174, + 299, + 825, + 411 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Limited Data. We present the results for limited data scenario in Figure 8 and Table 4 for MNIST, CIFAR-10 and CIFAR-100 datasets, where we simulate the limited data scenario by using a small subset of the training set. For the CIFAR-100 experiment (Figure 8 (a) and Table 4 (top row), we observe (from the left figure) that validation loss predicts the test loss pretty well. We observe (from the middle left figure) that gradient disparity also predicts the test loss quite well. However, the main difference between the two settings is that when using cross validation, $1 / k$ of the data is set aside for validation and $1 - 1 / k$ of the data is used for training. Whereas when using gradient disparity, all the data $( 1 - 1 / k + 1 / k )$ is used for training. Hence, the test loss in the leftmost and middle left figures differ. The difference between the test accuracy (respectively, test loss) obtained in each setting is visible in the rightmost figure (resp., middle right figure). We observe that there is over $3 \\%$ improvement in the test accuracy when using gradient disparity as an early stopping criterion. This improvement is consistent for MNIST and CIFAR-10 datasets (Figures 8 (b) and (c) and Table 4). We conclude that in the absence of label noise, both $k$ -fold cross validation and gradient disparity predict the optimal early stopping moment, but the final test loss/error is much lower for the model trained with all the available data (as when gradient disparity is used), than the model trained with a $( 1 - 1 / k )$ portion of the data (as in $k$ -fold cross validation). To further test on a dataset that is itself limited, a medical application with limited labeled data is empirically studied later in this section (Appendix D.1). The same conclusion is made for this dataset. ", + "bbox": [ + 173, + 417, + 825, + 667 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Noisy Labeled Data. The results for datasets with noisy labels are presented in Figure 9 and Table 6 for MNIST, CIFAR-10 and CIFAR-100 datasets. We observe (from Figure 9 (a) (left)) that for the CIFAR-100 experiment, the validation loss does no longer predict the test loss. Nevertheless, although gradient disparity is computed on a training set that contains corrupted samples, it predicts the test loss quite well (Figure 9 (a) (middle left)). As a result, there is a $2 \\%$ improvement in the final test accuracy (for top-5 accuracy there is a $9 \\%$ improvement) (Table 6 (top two rows)) when using gradient disparity instead of a validation set as an early stopping criterion. This is also consistent for other configurations and datasets (Figure 9 and Table 6). We conclude that, in the presence of label noise, $k$ -fold cross validation does no longer predict the test loss and fails as an early stopping criterion, unlike gradient disparity. ", + "bbox": [ + 174, + 674, + 825, + 814 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Computational Cost. Denote the time, in seconds, to compute one gradient vector, to compute the $\\ell _ { 2 }$ norm between two gradient vectors, to take the update step for the network parameters, and to evaluate one batch (find its validation loss and error) by $t _ { 1 } , t _ { 2 } , t _ { 3 }$ and $t _ { 4 }$ , respectively. Then, one epoch of $k$ -fold cross validation takes ", + "bbox": [ + 174, + 820, + 825, + 877 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/7027325f963709c3ce05b077382b5e12665ab2200169d0c163f82ee65c759193.jpg", + "text": "$$\n\\mathbf { C } \\mathbf { V } _ { \\mathrm { e p o c h } } = k \\times \\left( { \\frac { k - 1 } { k } } B ( t _ { 1 } + t _ { 3 } ) + { \\frac { B } { k } } t _ { 4 } \\right)\n$$", + "text_format": "latex", + "bbox": [ + 352, + 893, + 645, + 929 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "seconds, where $B$ is the number of batches. Performing one epoch of training the network and computing the gradient disparity takes ", + "bbox": [ + 173, + 103, + 825, + 132 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/f2fbf7f840f9b449ccfbf208573958a8e88c9aeb6f9f7a5144920d5fa62402cf.jpg", + "text": "$$\n\\mathrm { G D } _ { \\mathrm { e p o c h } } = B { \\left( t _ { 1 } + t _ { 3 } \\right) } + s \\left( t _ { 1 } + { \\frac { s - 1 } { 2 } } t _ { 2 } \\right)\n$$", + "text_format": "latex", + "bbox": [ + 352, + 138, + 643, + 174 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "seconds. In our experiments, we observe that $t _ { 1 } \\approx 5 . 1 t _ { 2 } \\approx 1 0 0 t _ { 3 } \\approx 3 . 4 t _ { 4 }$ , hence the approximate time to perform one epoch for each setting is ", + "bbox": [ + 173, + 179, + 825, + 209 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/28e624e1d7f3e55fae2e0918373c9278528aadd210a2bec783262ff5f7acc4bc.jpg", + "text": "$$\n\\mathrm { C V } _ { \\mathrm { e p o c h } } \\approx ( k - 1 ) B t _ { 1 } , \\qquad \\mathrm { a n d } \\qquad \\mathrm { G D } _ { \\mathrm { e p o c h } } \\approx ( B + s ) t _ { 1 } .\n$$", + "text_format": "latex", + "bbox": [ + 253, + 215, + 745, + 233 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Therefore, as $s < B$ , we have $\\mathrm { C V } _ { \\mathrm { e p o c h } } \\gg \\mathrm { G D } _ { \\mathrm { e p o c h } }$ ", + "bbox": [ + 173, + 241, + 504, + 256 + ], + "page_idx": 17 + }, + { + "type": "image", + "img_path": "images/e73ec8fe18909b8cba8f83577311fdd508593a958774dcaf928437aa6c3e9daf.jpg", + "image_caption": [ + "Figure 8: Comparing 5-fold cross validation (CV) with gradient disparity (GD) as an early stopping criterion when the available dataset is limited. (left) Validation loss versus test loss in 5-fold cross validation. (middle left) Gradient disparity versus test and generalization losses. (middle right and right) Performance on the unseen (test) data for GD versus 5-fold CV. (a) The parameters are initialized by Xavier techniques with uniform distribution. (b, c) The parameters are initialized using He technique with normal distribution. (c) The batch size is 32. The gray and magenta vertical bars indicate the epoch in which the metric (the validation loss or gradient disparity) has increased for 5 epochs from the beginning of training and for 5 consecutive epochs, respectively. In (b) the middle left figure, these two bars meet each other. " + ], + "image_footnote": [], + "bbox": [ + 173, + 268, + 807, + 588 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "D.1 MRNET DATASET ", + "text_level": 1, + "bbox": [ + 174, + 758, + 343, + 772 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "So far, we have presented the improvement of gradient disparity over cross validation for limited subsets of MNIST, CIFAR-10 and CIFAR-100 datasets. In this sub-section, we present the results for when the available dataset is by itself limited. We consider the MRNet dataset Bien et al. (2018) for diagnosis of knee injuries. The dataset contains 1370 magnetic resonance imaging (MRI) exams to study the presence of abnormality, anterior cruciate ligament (ACL) tears and meniscal tears. The labeled data in MRNet dataset is therefore very limited. Each MRI scan is a set of $S$ slices of images stacked together. Each patient (case) has three MRI scans: sagittal, coronal and axial. The MRNet dataset is split into training (1130 cases), validation (120 cases) and test sets (120 cases). The test set is not publicly available. We need however to set aside some data to evaluate both gradient disparity and $k$ -fold cross validation, hence, in our experiments, the validation set becomes the unseen (test) ", + "bbox": [ + 174, + 785, + 825, + 924 + ], + "page_idx": 17 + }, + { + "type": "table", + "img_path": "images/ea302586646f0fa70e8f922f6c1d60d5378bdae071a2ce6d88185cb35f6d85af.jpg", + "table_caption": [ + "Table 4: The loss and accuracy on the test set comparing 5-fold cross validation and gradient disparity as early stopping criterion when the available dataset is limited. The corresponding curves during training are presented in Figure 8. The above results are obtained by stopping the optimization when the metric (either validation loss or gradient disparity) has been increased for five epochs from the beginning of training. " + ], + "table_footnote": [], + "table_body": "
SettingMethodTest lossTest accuracy
CIFAR-100, ResNet-345-fold CvGD4.249 ± 0.0284.057 ± 0.0436.79 ± 0.49 (top-5: 22.19 ± 0.77)9.99 ± 0.92 (top-5: 27.84 ± 1.30)
CIFAR-10, VGG-135-fold CvGD1.846 ± 0.0161.793 ± 0.01635.982 ± 0.39336.96 ± 0.861
MNIST, AlexNet 5-fold CVGD1.123 ± 0.250.656 ± 0.08062.62 ± 6.3679.12 ± 3.04
", + "bbox": [ + 186, + 101, + 810, + 227 + ], + "page_idx": 18 + }, + { + "type": "table", + "img_path": "images/f1b32ae6904797201239aee0aaddbe435107a9a9fbce29686b6549f8c29954f7.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
PatienceMethod1510152025
5-fold CVGD41.15 ± 5.6830.19 ± 6.2162.62 ± 6.3679.12 ± 3.0481.39 ± 3.6484.82 ± 2.1480.39± 2.8885.35±2.0984.84 ± 2.5387.28± 1.2483.55±2.8486.69 ± 1.31
", + "bbox": [ + 176, + 333, + 825, + 392 + ], + "page_idx": 18 + }, + { + "type": "table", + "img_path": "images/a36114d5dd67108cd9ef584985551dd5b0c9af1132070c4cfab03a9d86e5a64b.jpg", + "table_caption": [ + "(a) MNIST, AlexNet, limited dataset (Figure 8 (c)) ", + "(b) MNIST, AlexNet, noisy dataset (Figure 9 (d)) ", + "Table 5: The test accuracies achieved by using $k$ -fold cross validation (CV) and by using gradient disparity (GD) as early stopping criteria for different patience values. For a given patience value of $m$ , the training is stopped after $m$ increases in the value of the validation loss in $k$ -fold CV (top rows) and of GD (bottom rows). Throughout the paper, we have chosen $m = 5$ as the default patience value for all methods without optimizing it even for GD. However, in this Table, we observe that even if we tune the patience value for $k$ -fold CV and for GD separately (which is indicated in bold), GD still outperforms $k$ -fold CV. " + ], + "table_footnote": [], + "table_body": "
PatienceMethod1510152025
10-fold CVGD96.54± 0.1597.07 ± 0.1697.28± 0.2097.32 ± 0.1597.35± 0.2397.41 ± 0.1597.22± 0.1996.57± 0.6496.60± 0.3395.44 ± 0.9694.69± 0.8792.58 ± 0.65
", + "bbox": [ + 176, + 412, + 825, + 470 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "set. To perform cross validation, we split the set used for training in Bien et al. (2018) into a first subset used for training in our experiments, and a second subset used as validation set. Note that, in this dataset, because slice $S$ changes from one case to another, it is not possible to stack the data into batches, hence the batch size is 1, which may explain the fluctuations of validation loss and gradient disparity in this setting. We used the SGD optimizer with the learning rate $1 0 ^ { - 4 }$ for training the model. Each task in this dataset is a binary classification with unbalanced set of samples and hence we report the area under the curve of the receiver operating characteristic (AUC score). ", + "bbox": [ + 174, + 638, + 825, + 736 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "The results for three tasks: detecting ACL tears, meniscal tears and abnormality, are shown in Figure 10 and Table 7. We can observe that both the validation loss, despite a small bias, and the gradient disparity predict the generalization loss quite well. Yet, when using gradient disparity, the final test AUC score is higher (Figure 10 (right)). As mentioned earlier, for this dataset, both the validation loss and gradient disparity vary a lot. Hence, in Table 7, we present the results of early stopping, both when the metric has increased for 5 epochs from the beginning of training, and (in parenthesis) when the metric has increased for 5 consecutive epochs. We conclude that with both approaches, the use of gradient disparity as an early stopping criterion results in more than $1 \\%$ improvement in the test AUC score. Because the test set used in Bien et al. (2018) is not publicly available, it is not possible to compare our predictive results with Bien et al. (2018). Nevertheless, a baseline may be the results presented in https://github.com/ahmedbesbes/mrnet, which report a test AUC score of $8 8 . 5 \\%$ for the task of detecting ACL tears, whereas we observe in Table 7 that stopping training after 5 consecutive increases in gradient disparity leads to $9 1 . 5 2 \\%$ ", + "bbox": [ + 173, + 743, + 825, + 924 + ], + "page_idx": 18 + }, + { + "type": "table", + "img_path": "images/5160f0d4d5ee4ea9740440c8906876460951947920881c142bcd4f63c4cb79e8.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
SettingMethodTest lossTest accuracy
CIFAR-100, ResNet-1810-fold CVGDPlug-in5.023 ± 0.0834.463 ± 0.0384.964 ± 0.0571.59 ± 0.15 (top-5: 6.47 ± 0.52)3.68 ± 0.52 (top-5: 15.22 ± 1.24)1.68 ± 0.24 (top-5: 7.05 ± 0.71)
CIFAR-100, ResNet-3410-fold CVGDPlug-in4.062 ± 0.0914.592 ± 0.1794.134± 0.1859.62 ± 1.08 (top-5: 32.06 ± 1.47)10.41 ± 1.40 (top-5: 36.92 ± 1.20)10.11 ± 1.60 (top-5: 34.19 ± 2.10)
CIFAR-10, VGG-1310-fold CVGDPlug-in2.126 ± 0.0632.519 ± 0.0622.195 ± 0.14234.88 ± 1.6636.98 ± 0.7735.40 ± 3.00
MNIST, AlexNet10-fold CVGDPlug-in0.656 ± 0.0340.654 ± 0.0310.639 ± 0.02997.28 ± 0.2097.32 ± 0.2797.31 ± 0.15
", + "bbox": [ + 179, + 102, + 820, + 315 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Table 6: The loss and accuracy on the test set comparing 10-fold cross validation and gradient disparity as early stopping criterion when the available dataset is noisy. In all the experiments, $50 \\%$ of the available data has random labels. The corresponding curves during training are presented in Figure 9. The above results are obtained by stopping the optimization when the metric (either validation loss or gradient disparity) has been increased for five epochs from the beginning of training. The last row in each setting, which we call plug-in, refers to when we plug-in the epoch suggested by 10-fold CV and then report the test loss and accuracy at that epoch for a network trained on the entire set. In all these settings, using GD would still result in a higher test accuracy and therefore the advantage of GD over 10-fold CV is a better characterization of overfitting. ", + "bbox": [ + 173, + 325, + 825, + 452 + ], + "page_idx": 19 + }, + { + "type": "table", + "img_path": "images/e6ed5510c4e685263a2772e28d1a0523154f9c4876ceb9e92f926fda7b6643f0.jpg", + "table_caption": [ + "test AUC score for this task. With further tuning, and combining the predictions found on two other MRI planes of each patient (axial and coronal), our final prediction results could even be improved. " + ], + "table_footnote": [], + "table_body": "
TaskMethodTest lossTest AUC score
ACL5-fold CVGD0.973 ± 0.111 (1.246 ± 0.142)0.842 ± 0.101 (1.136 ± 0.121)79.80 ± 1.23 (89.32 ± 1.47)81.81 ± 1.64 (91.52 ± 0.09)
meniscal5-fold CVGD0.758 ± 0.04 (1.163 ± 0.127)0.726 ± 0.019 (1.14 ± 0.323)73.53 ± 1.30 (72.14 ± 0.74)74.08 ± 0.79 (73.80 ± 0.24)
abnormal5-fold CvGD0.284 ± 0.016 (0.307 ± 0.057)0.274 ± 0.004 (0.275 ± 0.053)71.016 ± 3.66 (87.44 ± 1.35)72.67 ± 3.85 (88.12 ± 0.35)
", + "bbox": [ + 192, + 520, + 805, + 646 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Table 7: The loss and AUC score on the test set, comparing 5-fold cross validation to gradient disparity both as early stopping criterion for the MRNet dataset for three different tasks using the sagittal plane MRI scans. Note that an unassisted general radiologist gives on average $9 2 \\%$ , $8 4 \\%$ and $8 9 \\%$ accuracy for detecting ACL tears, meniscal tears and abnormality, respectively (Bien et al., 2018). The corresponding curves during training are presented in Figure 10. We present the results of early stopping, both when the metric has increased for 5 epochs from the beginning of training, and in parenthesis when the metric has increased for 5 consecutive epochs. ", + "bbox": [ + 173, + 656, + 826, + 755 + ], + "page_idx": 19 + }, + { + "type": "image", + "img_path": "images/196e96f75126c60f0326a2a248ab17c5ab1cab5ffbc02cd7a62539a64f66897a.jpg", + "image_caption": [ + "Figure 9: Comparing 10-fold cross validation with gradient disparity as early stopping criteria when the available dataset is noisy. (left) Validation loss versus test loss in 10-fold cross validation. (middle left) Gradient disparity versus test and generalization losses. (middle right and right) Performance on the unseen (test) data for GD versus 10-fold CV. (a) The parameters are initialized by Xavier techniques with uniform distribution. (b, c, and d) The parameters are initialized using He technique with normal distribution. " + ], + "image_footnote": [], + "bbox": [ + 171, + 250, + 807, + 676 + ], + "page_idx": 20 + }, + { + "type": "image", + "img_path": "images/f48fc420b807a474117af2302b44bfc822734359248be6420b2d835aecbf376b.jpg", + "image_caption": [ + "Figure 10: Detecting three tasks from the MRNet dataset from the sagittal plane MRI scans. (left) Validation loss versus test loss in 5-fold cross validation. (middle) Gradient disparity versus generalization loss. (right) Performance comparison on the final unseen data when applying 5-fold CV versus gradient disparity. " + ], + "image_footnote": [], + "bbox": [ + 171, + 286, + 797, + 665 + ], + "page_idx": 21 + }, + { + "type": "image", + "img_path": "images/228cc54c2bbfd2b6459be567640ff1363796a9dcd9795920a88ec937555c6a9c.jpg", + "image_caption": [ + "Figure 11: The cross entropy loss, the error percentage and the average gradient disparity during training. (a-c): A ResNet-18 trained on a subset of $1 2 . 8 \\mathrm { ~ k ~ }$ points of the CIFAR-10 training set (the parameter initialization is Xavier (Glorot & Bengio, 2010)). Pearson’s correlation coefficient $\\rho$ between $\\overline { { \\mathcal { D } } }$ and generalization loss/error over all the training iterations are $\\rho _ { \\overline { { \\mathcal { D } } } , \\mathrm { g e n l o s s } } \\ = \\ 0 . 7 5 5$ and ρD,gen error = 0.846. (d-f): An AlexNet trained on a subset of 12.8 k points of the MNIST training set (the parameters are initialized according to the He (He et al., 2015) method with Normal distributions). For this experiment, $\\rho _ { \\overline { { \\mathcal { D } } } , \\mathrm { g e n l o s s } } = 0 . 4 6 5$ and $\\rho _ { \\overline { { { \\mathcal { D } } } } , \\mathrm { g e n e r r o r } } = 0 . 4 5 7 .$ . The blue, orange, green, and red curves are the test loss/error, train loss/error, generalization loss/error, and the average gradient disparity $\\overline { { \\mathcal { D } } }$ , respectively. " + ], + "image_footnote": [], + "bbox": [ + 176, + 160, + 821, + 422 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "To investigate the relation between the average gradient disparity $\\overline { { \\mathcal { D } } }$ and generalization, we compare two sets of experiments. The first one exhibits clear overfitting, whereas in the second one, the model generalizes quite well. To test gradient disparity as a generalization metric, not only should it have very different values for each of these two sets of experiments, but it should also be well aligned with the generalization error. This is indeed what the experiments show. ", + "bbox": [ + 174, + 603, + 825, + 674 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "In the first set of experiments, the network configuration is ResNet-18 (He et al., 2016) and it is trained on the CIFAR-10 dataset (Figure 11 (top)). Around iteration 500 (which is indicated by a thick gray vertical bar in the figures), the training and test losses (and errors) start to diverge, and the test loss reaches its minimum. This should be the early stopping point as the model is starting to overfit. Interestingly, around the same time (indicated in Figures 11 (b) and (c)), we observe a sharp increase in $\\overline { { \\mathcal { D } } }$ . ", + "bbox": [ + 174, + 680, + 825, + 763 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "The second set of experiments is on an AlexNet (Krizhevsky et al., 2012) trained on the MNIST dataset (Figure 11 (bottom)). This model generalizes quite well for this dataset. We observe that, throughout the training, the test curves are even below the training curves, which is due to the dropout regularization technique (Srivastava et al., 2014) being applied during training and not during testing. The generalization loss/error is almost zero, until around iteration 1100 (indicated in the figure by the gray vertical bar), which is when overfitting starts and the generalization error becomes non-zero. At approximately the same time, the average gradient disparity (Figures 11 (e) and (f)) starts to slightly increase, but much more slowly compared to Figures 11 (b) and (c). In both these experiments, we observe that as overfitting starts, the gradient vectors start to diverge, resulting in larger gradient disparity. These observations suggest gradient disparity as an effective early stopping criterion, as it is well aligned with the generalization error. ", + "bbox": [ + 174, + 770, + 825, + 924 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "E.1 MNIST EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 103, + 377, + 117 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "Figure 12 shows the results for a 4-layer fully connected neural network trained on the entire MNIST training set5. Figures 12 (e) and (f) show the generalization losses. We observe that at the early stages of training, generalization losses do not distinguish between different label noise levels, whereas gradient disparity (Figures 12 (g) and (h)) does so from the beginning. At the middle stages of training we can observe that, surprisingly in this setting, the network with $0 \\%$ label noise has higher generalization loss than the networks trained with $2 5 \\%$ , $50 \\%$ and $7 5 \\%$ , and this is also captured by average gradient disparity. The final gradient disparity values for the networks trained with higher label noise level are also larger. For the network trained with $0 \\%$ label noise we present the results with more detail in Figure 13 and observe again how gradient disparity is well aligned with the generalization loss/error. In this experiment, the early stopping time suggested by gradient disparity is epoch 9, which is the exact same time when the training and test losses/errors start to diverge, which signals therefore the start of overfitting. ", + "bbox": [ + 173, + 128, + 825, + 296 + ], + "page_idx": 23 + }, + { + "type": "image", + "img_path": "images/35233dc5346296a59ae76ccfc0be8fb2d76e6f20aec759aede406d7135fa3617.jpg", + "image_caption": [ + "Figure 12: The cross entropy loss, error percentage, and average gradient disparity during training with different amounts of randomness in the training labels for a 4-layer fully connected neural network with 500 hidden units trained on the entire MNIST dataset. The parameter initialization is the He initialization with normal distribution. " + ], + "image_footnote": [], + "bbox": [ + 176, + 310, + 820, + 684 + ], + "page_idx": 23 + }, + { + "type": "image", + "img_path": "images/44353175b1af1828e7d981636361dc33f0132c6ccca60b4e80518265b8042634.jpg", + "image_caption": [ + "Figure 13: The cross entropy loss, error percentage, and average gradient disparity during training for a 4-layer fully connected neural network with 500 hidden units trained on the entire MNIST dataset with $0 \\%$ label noise. The parameter initialization is the He initialization with normal distribution. Pearson’s correlation coefficient $\\rho$ between $\\overline { { \\mathcal { D } } }$ and generalization loss/error over all the training iterations are $\\rho _ { \\overline { { \\mathcal { D } } } , \\mathrm { g e n l o s s } } = 0 . 9 6 7$ and $\\rho _ { \\overline { { \\mathcal { D } } } , \\mathrm { g e n e r r o r } } = 0 . 7 3 4$ . The gray vertical bar indicates when GD increases for 5 epochs from the beginning of training. The magenta vertical bar indicates when GD increases for 5 consecutive epochs. We observe that the gray bar signals when overfitting is starting, which is when the training and testing curves are starting to diverge. The magenta bar would be a good stopping time, because if we train beyond this point, although the test error remains the same, the test loss would increase, which would result in overconfidence on wrong predictions. " + ], + "image_footnote": [], + "bbox": [ + 174, + 102, + 820, + 285 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "E.2 CIFAR-10 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 465, + 397, + 479 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "Width. To compare models with a different number of parameters using gradient disparity, we need to normalize it. The dimension of a gradient vector is the number $d$ of parameters of the model. Gradient disparity being the √ $\\ell _ { 2 }$ -norm of the difference of gradient vectors will thus grow proportionally to $\\sqrt { d }$ , hence to compare different architectures, we propose to use the normalized√ gradient disparity $\\tilde { \\mathcal { D } } = \\overline { { \\mathcal { D } } } / \\sqrt { d }$ . We observe in Figure 14 that both the normalized6 gradient disparity and test error decrease with the network width (the scale is a hyper-parameter used to change both the number of channels and hidden units in each configuration). ", + "bbox": [ + 173, + 491, + 825, + 593 + ], + "page_idx": 24 + }, + { + "type": "image", + "img_path": "images/614b95b1f15037575b37c62faf528b69584c5ec7203861f00f22392fb2c39eb3.jpg", + "image_caption": [ + "Figure 14: Test error and normalized gradient disparity for networks trained on the CIFAR-10 dataset with different number of channels and hidden units for convolutional neural networks (CNN) and fully connected neural networks (FCNN). The correlation between normalized gradient disparity and test loss $\\rho _ { \\tilde { \\mathcal { D } } , \\mathrm { T L } }$ and between normalized gradient disparity and test error $\\rho _ { \\tilde { \\mathcal { D } } , \\mathrm { T E } }$ are reported in the captions. " + ], + "image_footnote": [], + "bbox": [ + 173, + 352, + 808, + 597 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "Figure 15 shows the results for a 4-layer fully connected neural network, which is trained on the entire CIFAR-10 training set7. We observe that gradient disparity reflects the test error at the early stages of training quite well. In the later stages of training we observe that the ranking of gradient disparity values for different label noise levels matches with the ranking of generalization losses and errors. In all experiments the average gradient disparity is indeed very informative about the test error. Figure 16 shows the effect of adding data augmentation on both the test error and gradient disparity. Figure 17 shows test error and gradient disparity for networks that are trained with different training set sizes. In Figure 18, we observe that, as discussed in Section 6, gradient disparity, similar to the test error, increases with the batch size for not too large batch sizes, and as expected, when the batch size is very large (512 for the CIFAR-10 experiment and 256 for the CIFAR-100 experiments) gradient disparity starts to decrease, because gradient vectors are averaged over a large batch. Note that even with such large batch sizes, gradient disparity correctly detects the early stopping time, but the value of gradient disparity can no longer be compared to the one found with other batch sizes. ", + "bbox": [ + 173, + 103, + 825, + 284 + ], + "page_idx": 26 + }, + { + "type": "image", + "img_path": "images/1d7019861b97ffb699e225f7e02511798f9ab6f5d1c0556e718ace90c888f20c.jpg", + "image_caption": [ + "Figure 15: The cross entropy loss, error percentage, and average gradient disparity during training with different amounts of randomness in the training labels for a 4-layer fully connected neural network with 500 hidden units trained on the entire CIFAR-10 dataset. The parameter initialization is the Xavier initialization with uniform distribution. The training is stopped when the training loss gets below 0.01. " + ], + "image_footnote": [], + "bbox": [ + 176, + 297, + 820, + 672 + ], + "page_idx": 26 + }, + { + "type": "image", + "img_path": "images/e8bf62a37268e855725ceb62862f6ef509a1da5cf870f37140cbea1af040ac8b.jpg", + "image_caption": [ + "Figure 16: The test error (bottom row) and gradient disparity (top row) for a ResNet-18 trained on the CIFAR-10 dataset with different training set sizes. (a) Results with data augmentation (DA) (we use random crop with padding $= 4$ and random horizontal flip with probability $= 0 . 5$ ). (b) Results without using any data augmentation technique. (c) Combined results of (a) and (b). We observe a strong positive correlation between gradient disparity $( \\overline { { \\mathcal { D } } } )$ and test error (TE) regardless of using data augmentation or not. We also observe that using data augmentation decreases the values of both gradient disparity and the test error. " + ], + "image_footnote": [], + "bbox": [ + 184, + 126, + 790, + 330 + ], + "page_idx": 27 + }, + { + "type": "image", + "img_path": "images/34f0be0de31b9179d347311c0080072d94cf478a7b2b903dbb29f84009103601.jpg", + "image_caption": [ + "Figure 17: Test error and gradient disparity for networks that are trained with different training set sizes. The training is stopped when the training loss is below 0.01. " + ], + "image_footnote": [], + "bbox": [ + 179, + 508, + 812, + 621 + ], + "page_idx": 27 + }, + { + "type": "image", + "img_path": "images/972892423701f0113a5a17360702e88c81313d9c208dd830a918370af06845d9.jpg", + "image_caption": [ + "Figure 18: Test error and gradient disparity for networks that are trained with different batch sizes trained on $1 2 . 8 \\mathrm { ~ k ~ }$ points of the CIFAR-10 and CIFAR-100 datasets. The training is stopped when the training loss is below 0.01. " + ], + "image_footnote": [], + "bbox": [ + 174, + 728, + 812, + 842 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "E.3 CIFAR-100 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 103, + 405, + 117 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "Figure 19 shows the results for a ResNet-18 that is trained on the CIFAR-100 training set8. Clearly, the model is not sufficient to learn the complexity of the CIFAR-100 dataset: It has $9 9 \\%$ error for the network with $0 \\%$ label noise, as if it had not learned anything about the dataset and is just making a random guess for classification (because there are 100 classes, random guessing would give $9 9 \\%$ error on average). We observe from Figure 19 (f) that as training progresses, the network overfits more, and the generalization error increases. Although the test error is high (above $9 0 \\%$ ), very surprisingly for this example, the networks with higher label noise level, have a lower test loss and error (Figures 19 (b) and (d)). Quite interestingly gradient disparity (Figure 19 (g)) captures also this surprising trend as well. ", + "bbox": [ + 173, + 130, + 825, + 255 + ], + "page_idx": 28 + }, + { + "type": "image", + "img_path": "images/01485a1a477273b249e7d350d903fe8f8fbec0344dabd7bdd9813bca8d64e04e.jpg", + "image_caption": [ + "Figure 19: The cross entropy loss, error percentage, and average gradient disparity during training with different amounts of randomness in the training labels for a ResNet-18 trained on the CIFAR100 training set. The parameter initialization is the Xavier initialization. " + ], + "image_footnote": [], + "bbox": [ + 176, + 268, + 821, + 517 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "F NUMBER OF BATCHES WITH LOW GRADIENT DISPARITY ", + "text_level": 1, + "bbox": [ + 176, + 608, + 678, + 626 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "In this paper, the upper bound in Theorem 1 is tracked by computing the average gradient disparity $\\overline { { \\mathcal { D } } }$ over a subset of batches. In this section, to gain some finer-grain signal of overfitting during the training process, we track down the distribution of this bound by studying the distribution of the gradient disparity, i.e., $\\mathbb { P } ( \\mathcal { D } _ { i , j } < \\zeta )$ for some threshold $\\zeta$ . ", + "bbox": [ + 174, + 641, + 825, + 698 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "We find the number of pairs of batches in the training set, denoted by $\\tau _ { \\zeta }$ , whose gradient disparity is below the given threshold $\\zeta$ . For these pairs of batches, the upper bound in Theorem 1, with probability at least $1 - \\delta$ and for two batches with the same size $m$ , is below $2 \\sqrt { \\left( \\gamma ^ { 2 } \\zeta ^ { 2 } / \\sigma ^ { 2 } + 2 \\ln ( 2 m / \\delta ) \\right) / ( m - 2 ) }$ . The lower $\\tau _ { \\zeta }$ is, the higher the average upper bound is, hence the more likely overfitting becomes. As before, for the sake of computational tractability, instead of going through all the possible pairs, we only compare $s ( s - 1 )$ pairs of batches $( s = 5$ for our experiments), so $0 \\leq \\mathcal { T } _ { \\zeta } \\leq s ( s - 1 )$ . We empirically estimate $\\mathbb { P } ( \\mathcal { D } _ { i , j } < \\zeta )$ over $s$ batches by $\\mathcal { T } _ { \\zeta } / ( s ( \\bar { s } - 1 ) )$ . In our experiments, we compute $\\tau _ { \\zeta }$ for $\\zeta \\in \\{ 1 0 , 2 0 \\}$ . ", + "bbox": [ + 173, + 704, + 825, + 818 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "We show that as an early stopping criterion, $\\tau _ { \\zeta }$ is sometimes (slightly) more accurate than $\\overline { { \\mathcal { D } } }$ . For instance, in Figure 20 (d) we highlighted in gray the minima valley of the test error for the network trained with $2 \\hat { 5 } \\%$ noise and we observe that this aligns with the drop in $\\tau _ { \\zeta }$ for $\\zeta = 2 0$ (light pink curve in Figure 20 (g)) better than the increasing time of $\\overline { { \\mathcal { D } } }$ (Figure 20 (f)). Also, the slow increase in the generalization loss for the AlexNet (green curve in Figure 21 (a)) is captured by the drop in $\\tau _ { \\zeta }$ for $\\zeta = 1 0$ (Figure 21 (c)) slightly better than the increase in the average gradient disparity (Figure 21 (b)). The drawback of $\\tau _ { \\zeta }$ compared to $\\overline { { \\mathcal { D } } }$ is that it introduces an additional hyper-parameter $\\zeta$ which requires tuning. In our experiments, as a rough rule of thumb, we observe that setting $\\zeta$ around $1 0 \\%$ of the initial gradient disparity works well. Further empirical investigation on $\\tau _ { \\zeta }$ is left as future work. ", + "bbox": [ + 173, + 825, + 825, + 898 + ], + "page_idx": 28 + }, + { + "type": "image", + "img_path": "images/3c26b383c1f73637bb1dcaed50ed00c5b4c96caf30fc6528fd3393e4809f0ae0.jpg", + "image_caption": [ + "Figure 20: The cross entropy loss, error percentage, average gradient disparity and $\\tau _ { \\zeta }$ for $\\zeta = 2 0$ during training with different amounts of randomness in the training labels for a ResNet-18 trained on a subset of $1 2 . 8 \\ \\mathrm { k }$ points of the CIFAR-10 training set. We can observe that, in this setting, average gradient disparity distinguishes different label noise levels from the beginning of training, unlike generalization error. " + ], + "image_footnote": [], + "bbox": [ + 179, + 108, + 808, + 330 + ], + "page_idx": 29 + }, + { + "type": "image", + "img_path": "images/18ae997912ffdc2342a25d94d202334d4ea8ad4ddd9821ad6334e2d271d64fd1.jpg", + "image_caption": [ + "Figure 21: The cross entropy loss, average gradient disparity $\\overline { { \\mathcal { D } } }$ , and $\\tau _ { \\zeta }$ for $\\zeta = 1 0$ during training for an AlexNet trained on a subset of $1 2 . 8 \\mathrm { k }$ points of the MNIST training set. " + ], + "image_footnote": [], + "bbox": [ + 181, + 434, + 802, + 560 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 631, + 825, + 704 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "G BEYOND SGD ", + "text_level": 1, + "bbox": [ + 176, + 728, + 331, + 746 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "In the following, we discuss how the analysis of Section 4 can be extended for other optimizers (refer to Ruder (2016) for an overview on popular optimizers). ", + "bbox": [ + 173, + 763, + 825, + 792 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "G.1 SGD WITH MOMENTUM ", + "text_level": 1, + "bbox": [ + 174, + 813, + 388, + 828 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "The momentum method (Qian, 1999) is a variation of SGD which adds a fraction of the update vector of the previous step to the current update vector to accelerate SGD: ", + "bbox": [ + 171, + 840, + 823, + 869 + ], + "page_idx": 29 + }, + { + "type": "equation", + "img_path": "images/8f8a4d2bfd7064be61345266887c907a909c0b58263594222d8e3795f13505f6.jpg", + "text": "$$\n\\begin{array} { r } { \\boldsymbol { v } ^ { ( t + 1 ) } = \\eta \\boldsymbol { v } ^ { ( t ) } + \\gamma \\boldsymbol { g } ^ { ( t ) } , } \\\\ { \\boldsymbol { w } ^ { ( t + 1 ) } = \\boldsymbol { w } ^ { ( t ) } - \\boldsymbol { v } ^ { ( t + 1 ) } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 416, + 880, + 578, + 921 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "where $g ^ { ( t ) }$ is either $g _ { 1 }$ or $g _ { 2 }$ depending on the selection of the batch $S _ { 1 }$ or $S _ { 2 }$ for the current update step. As $\\boldsymbol { \\upsilon } ^ { ( t ) }$ remains the same for either choice, the KL-divergence between $Q _ { 1 }$ and $Q _ { 2 }$ for SGD with momentum, is the same as Equation (5). ", + "bbox": [ + 174, + 102, + 825, + 147 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "G.2 ADAGRAD ", + "text_level": 1, + "bbox": [ + 174, + 170, + 290, + 185 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "Adagrad (Duchi et al., 2011) performs update steps with a different learning rate for each individual parameter. By denoting each coordinate of the parameter vector $w$ by $d$ , one update step of the Adagrad algorithm is ", + "bbox": [ + 174, + 198, + 825, + 241 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/0797333131557c266f661a4d815cdb30de21d08bbef2c7e0a4c4771337262bba.jpg", + "text": "$$\nw _ { d } ^ { ( t + 1 ) } = w _ { d } ^ { ( t ) } - \\frac { \\gamma } { \\sqrt { G _ { d d } ^ { ( t ) } + \\epsilon } } g _ { d } ^ { ( t ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 387, + 246, + 609, + 287 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "where the vector $g ^ { ( t ) }$ is either $g _ { 1 }$ or $g _ { 2 }$ depending on the selection of the batch for the current update step, and $G _ { d d } ^ { ( t ) }$ is the accumulative squared norm of the gradients up until iteration $t$ . Hence, for Adagrad, Equation (5) is replaced by ", + "bbox": [ + 174, + 297, + 825, + 345 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/4a9b2e289ec1302194c48224ad2d417b358398caed0c737c5f5a19c0f1680318.jpg", + "text": "$$\n{ \\bf K L } ( Q _ { 1 } | | Q _ { 2 } ) = \\frac { 1 } { 2 } \\frac { \\gamma ^ { 2 } } { \\sigma ^ { 2 } } \\left\\| \\frac { 1 } { G ^ { ( t ) } + \\epsilon } \\odot ( g _ { 1 } - g _ { 2 } ) \\right\\| _ { 2 } ^ { 2 } \\leq \\frac { 1 } { 2 } \\frac { \\gamma ^ { 2 } } { \\sigma ^ { 2 } } \\left\\| \\frac { 1 } { G ^ { ( t ) } + \\epsilon } \\right\\| _ { 2 } ^ { 2 } \\left\\| g _ { 1 } - g _ { 2 } \\right\\| _ { 2 } ^ { 2 } ,\n$$", + "text_format": "latex", + "bbox": [ + 228, + 356, + 767, + 395 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "where $\\odot$ denotes the element-wise product of two vectors, where division is also taken element-wise and where $\\epsilon$ is a small positive constant that avoids a possible division by 0. To compare the upper bound in Theorem 1 from one iteration to the next one (as needed to determine the early stopping moment in Section 5), gradient disparity is not the only factor in Equation (15) that evolves over time. Indeed $G ^ { ( t ) }$ is an increasing function of $t$ . However, after a few iterations when the gradients become small, this value becomes approximately constant (the initial gradient values dominate the sum in $G ^ { ( t ) }$ ). Then the right hand side of Equation (15) varies mostly as a function of gradient disparity, and therefore gradient disparity approximately tracks down the generalization penalty upper bound. ", + "bbox": [ + 173, + 405, + 826, + 535 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "G.3 ADADELTA AND RMSPROP ", + "text_level": 1, + "bbox": [ + 176, + 556, + 403, + 570 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "Adadelta (Zeiler, 2012) is an extension of Adagrad, which computes a decaying average of the past gradient vectors instead of the accumulative squared norm of the gradients dur. . As $G _ { d d } ^ { ( t ) }$ in Equation (14) is then replaced by ing proceeds, the gradient magnitude decre $\\bar { \\boldsymbol { v } } _ { d } ^ { ( t + 1 ) }$ wlso, reis $v _ { d } ^ { ( t + 1 ) } = \\eta v _ { d } ^ { ( t ) } + ( 1 - \\eta ) ( g _ { d } ^ { ( t ) } ) ^ { 2 }$ υ(t+1) = d d dusually close to 1. Therefore, the dominant term in $v _ { 1 } ^ { ( t + 1 ) } = \\eta v ^ { ( t ) } + \\left( 1 - \\eta \\right) \\left( g _ { 1 } \\right) ^ { 2 } \\approx \\eta v ^ { ( t ) } + \\left( 1 - \\eta \\right) \\left( g _ { 2 } \\right) ^ { 2 } = v _ { 2 } ^ { ( t + 1 ) }$ $v _ { d } ^ { ( t + 1 ) }$ becomes d (squares are done element-wise), . Then, if we approximate then for Adadelta we have ", + "bbox": [ + 173, + 583, + 825, + 699 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/e40685b196d0ac314b5c979b636baf48c1d521bb6974e474a52b54f374ba3f41.jpg", + "text": "$$\n\\mathrm { K L } ( Q _ { 1 } | | Q _ { 2 } ) \\leq \\frac { 1 } { 2 } \\frac { \\gamma ^ { 2 } } { \\sigma ^ { 2 } } \\left\\| \\frac { 1 } { \\upsilon ^ { ( t + 1 ) } + \\epsilon } \\right\\| _ { 2 } ^ { 2 } \\left\\| g _ { 1 } - g _ { 2 } \\right\\| _ { 2 } ^ { 2 } ,\n$$", + "text_format": "latex", + "bbox": [ + 334, + 708, + 661, + 747 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "where again the division is done element-wise. The denominator in Equation (16) is smaller than the denominator in Equation (15). In both equations, the first non-constant factor in the upper bound of ${ \\mathrm { K L } } ( Q _ { 1 } | | Q _ { 2 } )$ decreases as a function of $t$ , and therefore an increase in the value of ${ \\mathrm { K L } } ( Q _ { 1 } | | Q _ { 2 } )$ should be accounted for by an increase in the value of gradient disparity. Moreover, as training proceeds, gradient magnitudes decrease and the first factor on the upper bound of Equations (15) and (16) becomes closer to a constant. Therefore, an upper bound on the generalization penalties can be tracked by gradient disparity. ", + "bbox": [ + 173, + 756, + 825, + 856 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "The update rule of RmsProp9 is very similar to Adadelta, and the same conclusions can be made. ", + "bbox": [ + 173, + 861, + 805, + 877 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "G.4 ADAM ", + "text_level": 1, + "bbox": [ + 174, + 103, + 264, + 117 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "Adam (Kingma & Ba, 2014) combines Adadelta and momentum by storing an exponentially decaying average of the previous gradients and squared gradients: ", + "bbox": [ + 169, + 128, + 823, + 159 + ], + "page_idx": 31 + }, + { + "type": "equation", + "img_path": "images/e9aabd513d077161e90b3e31f17dae22577faf8482d605084ae7ad2e4fd146f2.jpg", + "text": "$$\n\\begin{array} { r l } { m ^ { ( t + 1 ) } = \\beta _ { 1 } m ^ { ( t ) } + ( 1 - \\beta _ { 1 } ) g ^ { ( t ) } , \\quad } & { v ^ { ( t + 1 ) } = \\beta _ { 2 } v ^ { ( t ) } + \\left( 1 - \\beta _ { 2 } \\right) \\left( g ^ { ( t ) } \\right) ^ { 2 } , } \\\\ { \\hat { m } ^ { ( t + 1 ) } = \\displaystyle \\frac { m ^ { ( t + 1 ) } } { 1 - \\left( \\beta _ { 1 } \\right) ^ { t } } , \\quad } & { \\hat { v } ^ { ( t + 1 ) } = \\displaystyle \\frac { v ^ { ( t + 1 ) } } { 1 - \\left( \\beta _ { 2 } \\right) ^ { t } } , \\quad } & { w ^ { ( t + 1 ) } = w ^ { ( t ) } - \\displaystyle \\frac { \\gamma } { \\sqrt { \\hat { v } ^ { ( t + 1 ) } } + \\epsilon } \\hat { m } ^ { ( t + 1 ) } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 196, + 164, + 800, + 233 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "All the operations in the above equations are done element-wise. As $\\beta _ { 2 }$ is usually very close to 1 (around 0.999), and as squared gradient vectors at the current update step are much smaller than the accumulated values during the previous steps, we approximate: $v _ { 1 } ^ { ( t + 1 ) } = \\beta _ { 2 } v ^ { ( t ) } + \\left( 1 - \\beta _ { 2 } \\right) \\left( g _ { 1 } \\right) ^ { 2 } \\approx \\beta _ { 2 } v ^ { ( t ) } + \\left( 1 - \\beta _ { 2 } \\right) \\left( g _ { 2 } \\right) ^ { 2 } = v _ { 2 } ^ { ( t + 1 ) }$ (squares are done elementwise). Hence, Equation (5) becomes ", + "bbox": [ + 174, + 238, + 825, + 313 + ], + "page_idx": 31 + }, + { + "type": "equation", + "img_path": "images/16117488f01a08def4e3a2e61536f663edc860134e648772b48196ec4f77e7df.jpg", + "text": "$$\n\\operatorname { K L } ( Q _ { 1 } | | Q _ { 2 } ) \\leq \\frac { 1 } { 2 } \\frac { \\gamma ^ { 2 } } { \\sigma ^ { 2 } } \\frac { 1 - \\beta _ { 1 } } { 1 - ( \\beta _ { 1 } ) ^ { t } } \\left\\| \\frac { 1 } { \\sqrt { \\hat { v } ^ { ( t + 1 ) } } + \\epsilon } \\right\\| _ { 2 } ^ { 2 } \\| g _ { 1 } - g _ { 2 } \\| _ { 2 } ^ { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 294, + 318, + 702, + 356 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "The first non-constant factor in equation above decreases with $t$ (because $\\beta _ { 1 } < 1 $ ). However it is not clear how the second factor varies as training proceeds. Therefore, unlike previous optimizers, it is more hazardous to claim that the factors other than gradient disparity in Equation (17) become constant as training proceeds. Hence, tracking only gradient disparity for the Adam optimizer may be insufficient. This is empirically investigated in the next sub-section. ", + "bbox": [ + 173, + 362, + 825, + 433 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "G.5 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 449, + 318, + 463 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "Figure 22 shows gradient disparity and test loss curves during the course of training for adaptive optimizers. The epoch in which the fifth increase in the value of the test loss and gradient disparity has happened is presented in the caption of each experiment. We observe that the two suggested epochs for stopping the optimization (the one suggested by gradient disparity (GD) and the other one suggested by test loss) are extremely close to each other except in Figure 22 (c) where the fifth epoch with an increase in the value of gradient disparity is much later than the epoch with the fifth increase in the value of test loss. However, in this experiment, there is a $23 \\%$ improvement in the test accuracy if the optimization is stopped according to GD compared to test loss, due to many variations of test loss compared to gradient disparity. ", + "bbox": [ + 173, + 474, + 825, + 601 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "As an early stopping criterion, the increase in the value of gradient disparity coincides with the increase in the test loss in all our experiments presented in Figure 22. In Figure 22 (h), for the Adam optimizer, we observe that after around 20 epochs, the value of gradient disparity starts to decrease, whereas the test loss continues to increase. This mismatch between test loss and gradient disparity might be due to the effect of the other factors that appear in Equation (17). Nevertheless, even in this experiment, the increase in the test loss and the gradient disparity coincide, and hence gradient disparity can correctly detect early stopping time. These experiments are a first indication that gradient disparity can be used as an early stopping criterion for optimizers other than SGD. ", + "bbox": [ + 174, + 607, + 825, + 719 + ], + "page_idx": 31 + }, + { + "type": "image", + "img_path": "images/f04f626f19dc2868bd45ca0dc56971f3a7418eac7a1c2ac4363f977cee68ee91.jpg", + "image_caption": [ + "(a) SGD with Momentum, test loss epoch: 11, GD epoch: 10 " + ], + "image_footnote": [], + "bbox": [ + 191, + 125, + 490, + 257 + ], + "page_idx": 32 + }, + { + "type": "image", + "img_path": "images/6c03113e162bc33d5b78502bf79bed53fc2af9c2d33e2473853ec65dc35a3a56.jpg", + "image_caption": [ + "(b) Adagrad, test loss epoch: 19 GD epoch: 18 " + ], + "image_footnote": [], + "bbox": [ + 514, + 122, + 808, + 256 + ], + "page_idx": 32 + }, + { + "type": "image", + "img_path": "images/5a7c248b2ff64cd10d39660d18baf148219e0e3840741ddf21565a89c9a56d4a.jpg", + "image_caption": [ + "(c) RmsProp, test loss epoch: 15 (loss:1.43, err: $54 \\%$ ), GD epoch: 36 (loss:1.16, err: $31 \\%$ ) " + ], + "image_footnote": [], + "bbox": [ + 184, + 305, + 491, + 440 + ], + "page_idx": 32 + }, + { + "type": "image", + "img_path": "images/a135c346fc50abcf1a643faf660012de69e29239ec3d4eaab12ee91317de28a8.jpg", + "image_caption": [ + "(d) Adam, test loss epoch: 19, GD epoch: 20 " + ], + "image_footnote": [], + "bbox": [ + 514, + 305, + 810, + 440 + ], + "page_idx": 32 + }, + { + "type": "image", + "img_path": "images/f93c639297045e5e802facca9ce338fa66bd9d430e049aecace6172b4c591de4.jpg", + "image_caption": [ + "(e) Adagrad, test loss epoch: 21, GD epoch: 21 " + ], + "image_footnote": [], + "bbox": [ + 189, + 489, + 490, + 625 + ], + "page_idx": 32 + }, + { + "type": "image", + "img_path": "images/8830aa958a78801b8aab51b9f841145b0cb405f0b629f220810e6a2093a0b67d.jpg", + "image_caption": [ + "(f) Adadelta, test loss epoch: 12, GD epoch: 15 " + ], + "image_footnote": [], + "bbox": [ + 511, + 488, + 815, + 626 + ], + "page_idx": 32 + }, + { + "type": "image", + "img_path": "images/354e583df408df4fda69aabad7ccd218492e34698a45f8426466b81e0c27f2c2.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 186, + 662, + 485, + 796 + ], + "page_idx": 32 + }, + { + "type": "text", + "text": "(g) RmsProp, test loss epoch: 20, GD epoch: 18 ", + "bbox": [ + 196, + 804, + 480, + 818 + ], + "page_idx": 32 + }, + { + "type": "image", + "img_path": "images/b876dd7cca14a58ba2730853aef040b31c538814fc15627a1f095c81ea44c317.jpg", + "image_caption": [ + "(h) Adam, test loss epoch: 12, GD epoch: 10 ", + "Figure 22: (a-d) VGG-19 configuration trained on $1 2 . 8 \\mathrm { k }$ training points of CIFAR-10 dataset. (e-h) VGG-11 configuration trained on $1 2 . 8 \\ \\mathrm { k }$ points of the CIFAR-10 dataset. The training is stopped when the training loss gets below 0.01. The presented results are an average over 5 runs. The captions below each figure give the epoch number where test loss and gradient disparity have respectively been increased for 5 epochs from the beginning of training. The Pearson correlation coefficient $\\rho$ is presented in each figure between gradient disparity and test loss. " + ], + "image_footnote": [], + "bbox": [ + 511, + 661, + 813, + 796 + ], + "page_idx": 32 + }, + { + "type": "table", + "img_path": "images/dd826799d1dcbe2b28c4460d6655fbbb19dcfc238c4e8df2f7aaf7c5a3dbe07c.jpg", + "table_caption": [ + "H COMPARISON TO RELATED WORK " + ], + "table_footnote": [ + "(d) CIFAR-10, ResNet-18, $5 0 \\%$ random " + ], + "table_body": "
MinGD/VarEBGSNRgi:9jsign(gi:gj) cos(gi:gj)ck-foldNo ES
TE4.844.844.8412.8222.3012.8218.318.304.844.96
TL0.180.180.180.460.820.460.690.320.180.22
(a) MNIST, AlexNet
MinGD/VarEBGSNR9igjsign(gi:gj)cos(gi:9j)Mk-foldNo ES
TE13.7616.6624.6335.6837.9224.6335.6829.4017.8625.725
TL0.751.080.861.681.820.861.681.461.090.91
(b) MNIST, AlexNet, 50% random
MinGD/VarEBGSNR9i9jsign(gi:gj)cos(gi:gj)ck-foldNoES
TE45.5445.9561.7670.4670.4655.8467.0967.3751.6464.19
TL1.321.451.681.921.921.521.831.851.491.98
(c) CIFAR-10, ResNet-18
TEMin 59.77GD/VarEBGSNR9i·9jsign(gi:9j)cos(gi:gj)Ωck-foldNo ES
TL1.7571.97 2.0073.17 2.0377.08 2.1275.91 2.1365.80 1.9375.43 2.0777.71 2.1372.56 2.0275.96 2.30
", + "bbox": [ + 176, + 132, + 826, + 410 + ], + "page_idx": 33 + }, + { + "type": "text", + "text": "Table 8: Test error (TE) and test loss (TL) achieved by using various metrics as early stopping criteria. On the leftmost column, the minimum values of TE and TL over all the iterations are reported (which is not accessible during training). The results of 5-fold cross validation are reported on the right-most column, which serve as a baseline. For each experiment, we have underlined those metrics that result in a better performance than 5-fold cross validation. We observe that gradient disparity (GD) and variance of gradients (Var) consistently outperform $k$ -fold cross validation, unlike other metrics. On the rightmost column (No ES) we report the results without performing early stopping (ES) (training is continued until the training loss is below 0.01). ", + "bbox": [ + 173, + 440, + 825, + 553 + ], + "page_idx": 33 + }, + { + "type": "text", + "text": "In Table 8 we compare gradient disparity (GD) to a number of metrics that were proposed either directly as an early stopping criterion, or as a generalization metric. For those metrics that were not originally proposed as early stopping criteria, we choose a similar method for early stopping as the one we use for gradient disparity. We consider two datasets (MNIST and CIFAR-10), and two levels of label noise $0 \\%$ and $5 0 \\%$ ). Here is a list of the metrics that we compute in each setting: ", + "bbox": [ + 174, + 569, + 825, + 638 + ], + "page_idx": 33 + }, + { + "type": "text", + "text": "1. Gradient disparity (GD) (ours): we report the error and loss values at the time when the value of GD increases for the 5th time (from the beginning of the training). \n2. The EB-criterion (Mahsereci et al., 2017): we report the error and loss values when EB becomes positive. \n3. Gradient signal to noise ratio (GSNR) (Liu et al., 2020): we report the error and loss values when the value of GSNR decreases for the 5th time (from the beginning of the training). \n4. Gradient inner product, $g _ { i } \\cdot g _ { j }$ (Fort et al., 2019): we report the error and loss values when the value of $g _ { i } \\cdot g _ { j }$ decreases for the 5th time (from the beginning of the training). \n5. Sign of the gradient inner product, $\\mathrm { s i g n } ( g _ { i } \\cdot g _ { j } )$ (Fort et al., 2019): we report the error and loss values when the value of $\\mathrm { s i g n } ( g _ { i } \\cdot g _ { j } )$ decreases for the 5th time (from the beginning of the training). \n6. Cosine similarity between gradient vectors, $\\cos ( g _ { i } \\cdot g _ { j } )$ (Fort et al., 2019): we report the error and loss values when the value of $\\cos ( g _ { i } \\cdot g _ { j } )$ decreases for the 5th time (from the beginning of the training). \n7. Variance of gradients (Var) (Negrea et al., 2019): we report the error and loss values when the value of Var increases for the 5th time (from the beginning of the training). Variance is computed over the same number of batches used to compute gradient disparity, in order to compare metrics given the same computational budget. ", + "bbox": [ + 210, + 647, + 825, + 925 + ], + "page_idx": 33 + }, + { + "type": "text", + "text": "8. Average gradient alignment within the class, $\\Omega _ { c }$ (Mehta et al., 2020): we report the error and loss values when the value of $\\Omega _ { c }$ decreases for the 5th time (from the beginning of the training). ", + "bbox": [ + 210, + 103, + 823, + 145 + ], + "page_idx": 34 + }, + { + "type": "text", + "text": "On the leftmost column of Table 8, we report the minimum values of the test error and the test loss over all the iterations, which may not necessarily coincide. For instance, in setting (c), the test error is minimized at iteration 196, whereas the test loss is minimized at iteration 126. On the rightmost column of Table 8, we report the values of the test error and the test loss when using 5-fold cross validation, which serves as a baseline. ", + "bbox": [ + 174, + 157, + 825, + 227 + ], + "page_idx": 34 + }, + { + "type": "text", + "text": "It is interesting to observe that gradient disparity and variance of gradients produce the exact same results when used as early stopping criteria (Table 8). Moreover, these two are the only metrics that consistently outperform $k$ -fold cross validation. However, in Section H.1, we observe that the correlation between gradient disparity and the test loss is in general larger than the correlation between variance of gradients and the test loss. ", + "bbox": [ + 174, + 234, + 825, + 304 + ], + "page_idx": 34 + }, + { + "type": "text", + "text": "The EB-criterion, $\\mathrm { s i g n } ( g _ { i } \\cdot g _ { j } )$ , and $\\cos ( g _ { i } \\cdot g _ { j } )$ are metrics that perform quite well as early stopping criteria, although not as well as GD and Var. In Section H.2, we observe that these metrics are not informative of the label noise level. ", + "bbox": [ + 174, + 311, + 825, + 353 + ], + "page_idx": 34 + }, + { + "type": "text", + "text": "H.1 GRADIENT DISPARITY VERSUS VARIANCE OF GRADIENTS ", + "text_level": 1, + "bbox": [ + 174, + 371, + 620, + 385 + ], + "page_idx": 34 + }, + { + "type": "text", + "text": "It has been shown that generalization is related to gradient alignment experimentally in Fort et al. (2019), and to variance of gradients theoretically in Negrea et al. (2019). Gradient disparity can be viewed as bringing the two together. Indeed, one can check that $\\mathbb { E } \\left[ \\mathcal { D } _ { i , j } ^ { \\hat { 2 } } \\right] \\stackrel { * } { = } 2 \\sigma _ { g } ^ { 2 } + 2 \\mu _ { g } ^ { T } \\mu _ { g } - 2 \\mathbb { E } \\left[ g _ { i } ^ { T } g _ { j } \\right]$ , given that $\\bar { \\mu _ { g } } = \\mathbb { E } [ g _ { i } ] = \\mathbb { E } [ g _ { j } ]$ and $\\sigma _ { g } ^ { 2 } = \\operatorname { t r } \\left( \\operatorname { C o v } \\left[ g _ { i } \\right] \\right) = \\operatorname { i r } \\left( \\operatorname { C o v } \\left[ g _ { j } \\right] \\right)$ . This shows that gradient variance $\\sigma _ { g } ^ { 2 }$ and gradient alignment $g _ { i } ^ { T } g _ { j }$ both appear as components of gradient disparity. We conjecture that the dominant term in gradient disparity is the variance of gradients, hence as early stopping criteria these two metrics almost always signal overfitting simultaneously. This is indeed what our experiments show; we show that variance of gradients is also a very promising early stopping criterion (Table 8). However, because of the additional term in gradient disparity (the gradients inner product), gradient disparity emphasizes the alignment or misalignment of the gradient vectors. This could be the reason why gradient disparity in general outperforms variance of gradients in tracking the value of the generalization loss; the positive correlation between gradient disparity and the test loss is often larger than the positive correlation between variance of gradients and the test loss (Table 9). ", + "bbox": [ + 173, + 396, + 825, + 597 + ], + "page_idx": 34 + }, + { + "type": "table", + "img_path": "images/430e3c39563dde30b22cee3a92853a5f32b99ad73f124155dc7ea52a600a6e49.jpg", + "table_caption": [ + "Table 9: Pearson’s correlation coefficient between gradient disparity $( \\overline { { \\mathcal { D } } } )$ and test loss (TL) over the training iterations is compared to the correlation between variance of gradients (Var) and test loss. " + ], + "table_footnote": [], + "table_body": "
SettingPD.TL pVar,TL
AlexNet, MNIST0.433 0.169
AlexNet, MNIST, 50% random labels0.5350.161
VGG-16, CIFAR-100.1900.324
VGG-16, CIFAR-10, 50% random labels0.6340.623
VGG-19, CIFAR-100.6850.508
VGG-19, CIFAR-10, 50% random labels0.7480.735
ResNet-18, CIFAR-100.9750.958
ResNet-18, CIFAR-10, 50% random labels0.4710.457
", + "bbox": [ + 285, + 609, + 710, + 796 + ], + "page_idx": 34 + }, + { + "type": "text", + "text": "H.2 CAPTURING LABEL NOISE LEVEL ", + "text_level": 1, + "bbox": [ + 176, + 103, + 454, + 117 + ], + "page_idx": 35 + }, + { + "type": "text", + "text": "In this section, we show in particular three metrics that even though perform relatively well as early stopping criteria, fail to account for the level of label noise, contrary to gradient disparity. ", + "bbox": [ + 171, + 130, + 823, + 159 + ], + "page_idx": 35 + }, + { + "type": "text", + "text": "• The sign of the gradient inner product, $\\mathrm { s i g n } ( g _ { i } \\cdot g _ { j } )$ , should be inversely related to the test loss; it should decrease when overfitting increases. However, we observe that the value of $\\mathrm { s i g n } ( g _ { i } \\cdot g _ { j } )$ is larger for the setting with the higher label noise level; it incorrectly detects the setting with the higher label noise level as the setting with the better generalization performance (see Figure 23). The EB-criterion should be larger for settings with higher overfitting. In most stages of training, the EB-criterion does not distinguish between settings with different label noise levels, contrary to gradient disparity (see Figure 23). At the end of the training, the EBcriterion even mistakenly signals the setting with the higher label noise level as the setting with the better generalization performance. \n• The cosine similarity between gradient vectors, $\\cos ( g _ { i } \\cdot g _ { j } )$ , should decrease when overfitting increases and therefore with the level of label noise in the training data. But $\\cos ( g _ { i } \\cdot g _ { j } )$ appears not to be sensitive to the label noise level, and in some cases (Figure 24 (a)) it even increases with the noise level. Gradient disparity is much more informative of the label noise level compared to cosine similarity and the correlation between gradient disparity and the test error is larger than the correlation between cosine similarity and the test accuracy (see Figure 24). ", + "bbox": [ + 215, + 170, + 825, + 417 + ], + "page_idx": 35 + }, + { + "type": "image", + "img_path": "images/a54022ccc2a5176dd59d9731bb4cd3c6acca55cc73b77b5c311aa3108cc29f6e.jpg", + "image_caption": [ + "Figure 23: Test loss, gradient disparity, EB-criterion Mahsereci et al. (2017), and $\\mathrm { s i g n } ( g _ { i } \\cdot g _ { j } )$ for a ResNet-18 trained on the CIFAR-10 dataset, with $0 \\%$ and $5 0 \\%$ random labels. Gradient disparity, contrary to EB-criterion and $\\mathrm { s i g n } ( g _ { i } \\cdot g _ { j } )$ , clearly distinguishes the setting with real labels from the setting with random labels. " + ], + "image_footnote": [], + "bbox": [ + 173, + 453, + 797, + 739 + ], + "page_idx": 35 + }, + { + "type": "image", + "img_path": "images/5c3fbd197c12c6ac006ee62f636f959dae5c600cb467bf2bc568ad8b0bdfa3f5.jpg", + "image_caption": [ + "Figure 24: The test error (TE), average gradient disparity $( \\overline { { \\mathcal { D } } } )$ , and cosine similarity $( \\cos ( g _ { i } \\cdot g _ { j } ) )$ during training with different amounts of randomness in the training labels for two sets of experiments. (a) ResNet-18 trained on $1 2 . 8 \\mathrm { k }$ points of the CIFAR-10 training set. The Pearson correlation coefficient between test accuracy (TA) and cosine similarity (cos) over all levels of randomness and over all the iterations is $\\rho _ { \\mathrm { c o s , T A } } = - 0 . 0 0 8 8$ , whereas the correlation between test error/generalization error and gradient disparity is $\\rho _ { \\overline { { D } } , \\mathrm { T E } } = 0 . 2 0 2 9$ and $\\rho _ { \\overline { { D } } , \\mathrm { G E } } = 0 . 5 2 6 8$ , respectively. (b) AlexNet configuration trained on $1 2 . 8 \\mathrm { k }$ points of the MNIST dataset. The correlation between the test accuracy and cosine similarity is $\\rho _ { \\mathrm { c o s , T A } } ~ = ~ 0 . 7 5 2 1$ , which is positive and relatively high for this experiment. Yet, it is still lower than the correlation between test error and gradient disparity which is ρD,TE = 0.8019. " + ], + "image_footnote": [], + "bbox": [ + 179, + 301, + 805, + 574 + ], + "page_idx": 36 + } +] \ No newline at end of file diff --git a/parse/train/X76iqnUbBjz/X76iqnUbBjz_layout.pdf b/parse/train/X76iqnUbBjz/X76iqnUbBjz_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..91748bfa6b3e7aec11389c3e36c61eac6fe67ff3 --- /dev/null +++ b/parse/train/X76iqnUbBjz/X76iqnUbBjz_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:57381328e76e66fbb2db06b1aa30a1b0396586bc4ba58cb49e15ae9ef7eaeeee +size 1957668 diff --git a/parse/train/X76iqnUbBjz/X76iqnUbBjz_origin.pdf b/parse/train/X76iqnUbBjz/X76iqnUbBjz_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c7ea6c510d6981d677a4dd31a675c4e0fe274e7b --- /dev/null +++ b/parse/train/X76iqnUbBjz/X76iqnUbBjz_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2384e3d5d6adf0746085909402f04877cbb1900b22157e837efbaff43380fd16 +size 1314968 diff --git a/parse/train/X76iqnUbBjz/X76iqnUbBjz_span.pdf b/parse/train/X76iqnUbBjz/X76iqnUbBjz_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8153057f58ec20b555abc51602c412bbe9b45b78 --- /dev/null +++ b/parse/train/X76iqnUbBjz/X76iqnUbBjz_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:999eca7770e90f3a5120ed79555911e6a84dbb76444a9f80b8128846e8b52a67 +size 1970833 diff --git a/parse/train/XwATtbX3oCz/XwATtbX3oCz_layout.pdf b/parse/train/XwATtbX3oCz/XwATtbX3oCz_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c0dca78c95a2250504bbe3480403ca430966a8a4 --- /dev/null +++ b/parse/train/XwATtbX3oCz/XwATtbX3oCz_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4cd1040225ecefe6432d44da2e7873c632ea57e8e039e4785b5a5cbddf40f902 +size 1975538 diff --git a/parse/train/XwATtbX3oCz/XwATtbX3oCz_origin.pdf b/parse/train/XwATtbX3oCz/XwATtbX3oCz_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..cf9135e1d68d333abdd96250209155c44ef9e2f1 --- /dev/null +++ b/parse/train/XwATtbX3oCz/XwATtbX3oCz_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:e49d5c6efe041b00ced4bd4562c7b574db2d1902fbfb2c71cd5e37dea7a78562 +size 1850195 diff --git a/parse/train/XwATtbX3oCz/XwATtbX3oCz_span.pdf b/parse/train/XwATtbX3oCz/XwATtbX3oCz_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..326e538b69d221d8bf91e04f53758d571ca44fd5 --- /dev/null +++ b/parse/train/XwATtbX3oCz/XwATtbX3oCz_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3cdd13900624fb7b57bc63394961ac3837ab756dcd9b2b1bce155865febfea5d +size 1975717 diff --git a/parse/train/YicbFdNTTy/YicbFdNTTy.md b/parse/train/YicbFdNTTy/YicbFdNTTy.md new file mode 100644 index 0000000000000000000000000000000000000000..d468ab5bc589bec2d0e35331bcfe69aec7b41c0b --- /dev/null +++ b/parse/train/YicbFdNTTy/YicbFdNTTy.md @@ -0,0 +1,422 @@ +# AN IMAGE IS WORTH 16X16 WORDS: TRANSFORMERS FOR IMAGE RECOGNITION AT SCALE + +Alexey Dosovitskiy∗,†, Lucas Beyer∗, Alexander Kolesnikov∗, Dirk Weissenborn∗, Xiaohua Zhai∗, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Sylvain Gelly, Jakob Uszkoreit, Neil Houlsby∗,† + +∗equal technical contribution, †equal advising Google Research, Brain Team {adosovitskiy, neilhoulsby}@google.com + +# ABSTRACT + +While the Transformer architecture has become the de-facto standard for natural language processing tasks, its applications to computer vision remain limited. In vision, attention is either applied in conjunction with convolutional networks, or used to replace certain components of convolutional networks while keeping their overall structure in place. We show that this reliance on CNNs is not necessary and a pure transformer applied directly to sequences of image patches can perform very well on image classification tasks. When pre-trained on large amounts of data and transferred to multiple mid-sized or small image recognition benchmarks (ImageNet, CIFAR-100, VTAB, etc.), Vision Transformer (ViT) attains excellent results compared to state-of-the-art convolutional networks while requiring substantially fewer computational resources to train.1 + +# 1 INTRODUCTION + +Self-attention-based architectures, in particular Transformers (Vaswani et al., 2017), have become the model of choice in natural language processing (NLP). The dominant approach is to pre-train on a large text corpus and then fine-tune on a smaller task-specific dataset (Devlin et al., 2019). Thanks to Transformers’ computational efficiency and scalability, it has become possible to train models of unprecedented size, with over 100B parameters (Brown et al., 2020; Lepikhin et al., 2020). With the models and datasets growing, there is still no sign of saturating performance. + +In computer vision, however, convolutional architectures remain dominant (LeCun et al., 1989; Krizhevsky et al., 2012; He et al., 2016). Inspired by NLP successes, multiple works try combining CNN-like architectures with self-attention (Wang et al., 2018; Carion et al., 2020), some replacing the convolutions entirely (Ramachandran et al., 2019; Wang et al., 2020a). The latter models, while theoretically efficient, have not yet been scaled effectively on modern hardware accelerators due to the use of specialized attention patterns. Therefore, in large-scale image recognition, classic ResNetlike architectures are still state of the art (Mahajan et al., 2018; Xie et al., 2020; Kolesnikov et al., 2020). + +Inspired by the Transformer scaling successes in NLP, we experiment with applying a standard Transformer directly to images, with the fewest possible modifications. To do so, we split an image into patches and provide the sequence of linear embeddings of these patches as an input to a Transformer. Image patches are treated the same way as tokens (words) in an NLP application. We train the model on image classification in supervised fashion. + +When trained on mid-sized datasets such as ImageNet without strong regularization, these models yield modest accuracies of a few percentage points below ResNets of comparable size. This seemingly discouraging outcome may be expected: Transformers lack some of the inductive biases inherent to CNNs, such as translation equivariance and locality, and therefore do not generalize well when trained on insufficient amounts of data. + +However, the picture changes if the models are trained on larger datasets (14M-300M images). We find that large scale training trumps inductive bias. Our Vision Transformer (ViT) attains excellent results when pre-trained at sufficient scale and transferred to tasks with fewer datapoints. When pre-trained on the public ImageNet-21k dataset or the in-house JFT-300M dataset, ViT approaches or beats state of the art on multiple image recognition benchmarks. In particular, the best model reaches the accuracy of $8 8 . 5 5 \%$ on ImageNet, $9 0 . 7 2 \%$ on ImageNet-ReaL, $9 4 . 5 5 \%$ on CIFAR-100, and $7 7 . 6 3 \%$ on the VTAB suite of 19 tasks. + +# 2 RELATED WORK + +Transformers were proposed by Vaswani et al. (2017) for machine translation, and have since become the state of the art method in many NLP tasks. Large Transformer-based models are often pre-trained on large corpora and then fine-tuned for the task at hand: BERT (Devlin et al., 2019) uses a denoising self-supervised pre-training task, while the GPT line of work uses language modeling as its pre-training task (Radford et al., 2018; 2019; Brown et al., 2020). + +Naive application of self-attention to images would require that each pixel attends to every other pixel. With quadratic cost in the number of pixels, this does not scale to realistic input sizes. Thus, to apply Transformers in the context of image processing, several approximations have been tried in the past. Parmar et al. (2018) applied the self-attention only in local neighborhoods for each query pixel instead of globally. Such local multi-head dot-product self attention blocks can completely replace convolutions (Hu et al., 2019; Ramachandran et al., 2019; Zhao et al., 2020). In a different line of work, Sparse Transformers (Child et al., 2019) employ scalable approximations to global selfattention in order to be applicable to images. An alternative way to scale attention is to apply it in blocks of varying sizes (Weissenborn et al., 2019), in the extreme case only along individual axes (Ho et al., 2019; Wang et al., 2020a). Many of these specialized attention architectures demonstrate promising results on computer vision tasks, but require complex engineering to be implemented efficiently on hardware accelerators. + +Most related to ours is the model of Cordonnier et al. (2020), which extracts patches of size $2 \times 2$ from the input image and applies full self-attention on top. This model is very similar to ViT, but our work goes further to demonstrate that large scale pre-training makes vanilla transformers competitive with (or even better than) state-of-the-art CNNs. Moreover, Cordonnier et al. (2020) use a small patch size of $2 \times 2$ pixels, which makes the model applicable only to small-resolution images, while we handle medium-resolution images as well. + +There has also been a lot of interest in combining convolutional neural networks (CNNs) with forms of self-attention, e.g. by augmenting feature maps for image classification (Bello et al., 2019) or by further processing the output of a CNN using self-attention, e.g. for object detection (Hu et al., 2018; Carion et al., 2020), video processing (Wang et al., 2018; Sun et al., 2019), image classification (Wu et al., 2020), unsupervised object discovery (Locatello et al., 2020), or unified text-vision tasks (Chen et al., 2020c; Lu et al., 2019; Li et al., 2019). + +Another recent related model is image GPT (iGPT) (Chen et al., 2020a), which applies Transformers to image pixels after reducing image resolution and color space. The model is trained in an unsupervised fashion as a generative model, and the resulting representation can then be fine-tuned or probed linearly for classification performance, achieving a maximal accuracy of $72 \%$ on ImageNet. + +Our work adds to the increasing collection of papers that explore image recognition at larger scales than the standard ImageNet dataset. The use of additional data sources allows to achieve state-ofthe-art results on standard benchmarks (Mahajan et al., 2018; Touvron et al., 2019; Xie et al., 2020). Moreover, Sun et al. (2017) study how CNN performance scales with dataset size, and Kolesnikov et al. (2020); Djolonga et al. (2020) perform an empirical exploration of CNN transfer learning from large scale datasets such as ImageNet-21k and JFT-300M. We focus on these two latter datasets as well, but train Transformers instead of ResNet-based models used in prior works. + +![](images/8472b256645bd1d1ee65ff7be22b05844a49588fe828da13912901c773e8ea78.jpg) +Figure 1: Model overview. We split an image into fixed-size patches, linearly embed each of them, add position embeddings, and feed the resulting sequence of vectors to a standard Transformer encoder. In order to perform classification, we use the standard approach of adding an extra learnable “classification token” to the sequence. The illustration of the Transformer encoder was inspired by Vaswani et al. (2017). + +# 3 METHOD + +In model design we follow the original Transformer (Vaswani et al., 2017) as closely as possible. An advantage of this intentionally simple setup is that scalable NLP Transformer architectures – and their efficient implementations – can be used almost out of the box. + +# 3.1 VISION TRANSFORMER (VIT) + +An overview of the model is depicted in Figure 1. The standard Transformer receives as input a 1D sequence of token embeddings. To handle 2D images, we reshape the image $\mathbf { x } \in \mathbb { R } ^ { H \times W \times \dot { C } }$ into a sequence of flattened 2D patches $\mathbf { x } _ { p } \in \mathbb { R } ^ { N \times ( P ^ { 2 } \cdot C ) }$ , where $( H , W )$ is the resolution of the original image, $C$ is the number of channels, $( P , P )$ is the resolution of each image patch, and $N = H W / P ^ { 2 }$ is the resulting number of patches, which also serves as the effective input sequence length for the Transformer. The Transformer uses constant latent vector size $D$ through all of its layers, so we flatten the patches and map to $D$ dimensions with a trainable linear projection (Eq. 1). We refer to the output of this projection as the patch embeddings. + +Similar to BERT’s [class] token, we prepend a learnable embedding to the sequence of embedded patches $( \mathbf { z } _ { 0 } ^ { 0 } = \mathbf { x } _ { \mathrm { c l a s s } } )$ , whose state at the output of the Transformer encoder $( \mathbf { \bar { z } } _ { L } ^ { 0 } )$ serves as the image representation y (Eq. 4). Both during pre-training and fine-tuning, a classification head is attached to $\mathbf { z } _ { L } ^ { 0 }$ . The classification head is implemented by a MLP with one hidden layer at pre-training time and by a single linear layer at fine-tuning time. + +Position embeddings are added to the patch embeddings to retain positional information. We use standard learnable 1D position embeddings, since we have not observed significant performance gains from using more advanced 2D-aware position embeddings (Appendix D.3). The resulting sequence of embedding vectors serves as input to the encoder. + +The Transformer encoder (Vaswani et al., 2017) consists of alternating layers of multiheaded selfattention (MSA, see Appendix A) and MLP blocks (Eq. 2, 3). Layernorm (LN) is applied before every block, and residual connections after every block (Wang et al., 2019; Baevski & Auli, 2019). + +The MLP contains two layers with a GELU non-linearity. + +$$ +\begin{array} { r l r l } & { \mathbf z _ { 0 } = [ \mathbf x _ { \mathrm { c l a s s } } ; \mathbf x _ { p } ^ { 1 } \mathbf E ; \mathbf x _ { p } ^ { 2 } \mathbf E ; \cdot \cdot \cdot \cdot \cdot \cdot ; \mathbf x _ { p } ^ { N } \mathbf E ] + \mathbf E _ { p o s } , } & & { \mathbf E \in \mathbb R ^ { ( P ^ { 2 } \cdot C ) \times D } , \mathbf E _ { p o s } \in \mathbb R ^ { ( N + 1 ) \times D } } \\ & { \mathbf z ^ { \prime } _ { \ell } = \mathrm { M S A } ( \mathrm { L N } ( \mathbf z _ { \ell - 1 } ) ) + \mathbf z _ { \ell - 1 } , } & & { \ell = 1 \dots L } \\ & { \mathbf z _ { \ell } = \mathrm { M L P } ( \mathrm { L N } ( \mathbf z ^ { \prime } _ { \ell } ) ) + \mathbf z ^ { \prime } _ { \ell } , } & & { \ell = 1 \dots L } \\ & { \mathbf y = \mathrm { L N } ( \mathbf z _ { L } ^ { 0 } ) } \end{array} +$$ + +Inductive bias. We note that Vision Transformer has much less image-specific inductive bias than CNNs. In CNNs, locality, two-dimensional neighborhood structure, and translation equivariance are baked into each layer throughout the whole model. In ViT, only MLP layers are local and translationally equivariant, while the self-attention layers are global. The two-dimensional neighborhood structure is used very sparingly: in the beginning of the model by cutting the image into patches and at fine-tuning time for adjusting the position embeddings for images of different resolution (as described below). Other than that, the position embeddings at initialization time carry no information about the 2D positions of the patches and all spatial relations between the patches have to be learned from scratch. + +Hybrid Architecture. As an alternative to raw image patches, the input sequence can be formed from feature maps of a CNN (LeCun et al., 1989). In this hybrid model, the patch embedding projection $\mathbf { E }$ (Eq. 1) is applied to patches extracted from a CNN feature map. As a special case, the patches can have spatial size 1x1, which means that the input sequence is obtained by simply flattening the spatial dimensions of the feature map and projecting to the Transformer dimension. The classification input embedding and position embeddings are added as described above. + +# 3.2 FINE-TUNING AND HIGHER RESOLUTION + +Typically, we pre-train ViT on large datasets, and fine-tune to (smaller) downstream tasks. For this, we remove the pre-trained prediction head and attach a zero-initialized $D \times K$ feedforward layer, where $K$ is the number of downstream classes. It is often beneficial to fine-tune at higher resolution than pre-training (Touvron et al., 2019; Kolesnikov et al., 2020). When feeding images of higher resolution, we keep the patch size the same, which results in a larger effective sequence length. The Vision Transformer can handle arbitrary sequence lengths (up to memory constraints), however, the pre-trained position embeddings may no longer be meaningful. We therefore perform 2D interpolation of the pre-trained position embeddings, according to their location in the original image. Note that this resolution adjustment and patch extraction are the only points at which an inductive bias about the 2D structure of the images is manually injected into the Vision Transformer. + +# 4 EXPERIMENTS + +We evaluate the representation learning capabilities of ResNet, Vision Transformer (ViT), and the hybrid. To understand the data requirements of each model, we pre-train on datasets of varying size and evaluate many benchmark tasks. When considering the computational cost of pre-training the model, ViT performs very favourably, attaining state of the art on most recognition benchmarks at a lower pre-training cost. Lastly, we perform a small experiment using self-supervision, and show that self-supervised ViT holds promise for the future. + +# 4.1 SETUP + +Datasets. To explore model scalability, we use the ILSVRC-2012 ImageNet dataset with 1k classes and 1.3M images (we refer to it as ImageNet in what follows), its superset ImageNet-21k with 21k classes and 14M images (Deng et al., 2009), and JFT (Sun et al., 2017) with $1 8 \mathrm { k }$ classes and 303M high-resolution images. We de-duplicate the pre-training datasets w.r.t. the test sets of the downstream tasks following Kolesnikov et al. (2020). We transfer the models trained on these dataset to several benchmark tasks: ImageNet on the original validation labels and the cleaned-up ReaL labels (Beyer et al., 2020), CIFAR-10/100 (Krizhevsky, 2009), Oxford-IIIT Pets (Parkhi et al., 2012), and Oxford Flowers-102 (Nilsback & Zisserman, 2008). For these datasets, pre-processing follows Kolesnikov et al. (2020). + +Table 1: Details of Vision Transformer model variants. + +
ModelLayersHidden size DMLP sizeHeadsParams
ViT-Base1276830721286M
ViT-Large241024409616307M
ViT-Huge321280512016632M
+ +We also evaluate on the 19-task VTAB classification suite (Zhai et al., 2019b). VTAB evaluates low-data transfer to diverse tasks, using 1 000 training examples per task. The tasks are divided into three groups: Natural – tasks like the above, Pets, CIFAR, etc. Specialized – medical and satellite imagery, and Structured – tasks that require geometric understanding like localization. + +Model Variants. We base ViT configurations on those used for BERT (Devlin et al., 2019), as summarized in Table 1. The “Base” and “Large” models are directly adopted from BERT and we add the larger “Huge” model. In what follows we use brief notation to indicate the model size and the input patch size: for instance, ViT-L/16 means the “Large” variant with $1 6 \times 1 6$ input patch size. Note that the Transformer’s sequence length is inversely proportional to the square of the patch size, thus models with smaller patch size are computationally more expensive. + +For the baseline CNNs, we use ResNet (He et al., 2016), but replace the Batch Normalization layers (Ioffe & Szegedy, 2015) with Group Normalization (Wu & He, 2018), and used standardized convolutions (Qiao et al., 2019). These modifications improve transfer (Kolesnikov et al., 2020), and we denote the modified model “ResNet (BiT)”. For the hybrids, we feed the intermediate feature maps into ViT with patch size of one “pixel”. To experiment with different sequence lengths, we either (i) take the output of stage 4 of a regular ResNet50 or (ii) remove stage 4, place the same number of layers in stage 3 (keeping the total number of layers), and take the output of this extended stage 3. Option (ii) results in a $4 \mathbf { x }$ longer sequence length, and a more expensive ViT model. + +Training & Fine-tuning. We train all models, including ResNets, using Adam (Kingma & Ba, 2015) with $\beta _ { 1 } = 0 . 9$ , $\beta _ { 2 } = 0 . 9 9 9$ , a batch size of 4096 and apply a high weight decay of 0.1, which we found to be useful for transfer of all models (Appendix D.1 shows that, in contrast to common practices, Adam works slightly better than SGD for ResNets in our setting). We use a linear learning rate warmup and decay, see Appendix B.1 for details. For fine-tuning we use SGD with momentum, batch size 512, for all models, see Appendix B.1.1. For ImageNet results in Table 2, we fine-tuned at higher resolution: 512 for ViT-L/16 and 518 for ViT-H/14, and also used Polyak & Juditsky (1992) averaging with a factor of 0.9999 (Ramachandran et al., 2019; Wang et al., 2020b). + +Metrics. We report results on downstream datasets either through few-shot or fine-tuning accuracy. Fine-tuning accuracies capture the performance of each model after fine-tuning it on the respective dataset. Few-shot accuracies are obtained by solving a regularized least-squares regression problem that maps the (frozen) representation of a subset of training images to $\{ - 1 , 1 \} ^ { K }$ target vectors. This formulation allows us to recover the exact solution in closed form. Though we mainly focus on fine-tuning performance, we sometimes use linear few-shot accuracies for fast on-the-fly evaluation where fine-tuning would be too costly. + +# 4.2 COMPARISON TO STATE OF THE ART + +We first compare our largest models – ViT-H/14 and ViT-L/16 – to state-of-the-art CNNs from the literature. The first comparison point is Big Transfer (BiT) (Kolesnikov et al., 2020), which performs supervised transfer learning with large ResNets. The second is Noisy Student (Xie et al., 2020), which is a large EfficientNet trained using semi-supervised learning on ImageNet and JFT300M with the labels removed. Currently, Noisy Student is the state of the art on ImageNet and BiT-L on the other datasets reported here. All models were trained on TPUv3 hardware, and we report the number of TPUv3-core-days taken to pre-train each of them, that is, the number of TPU v3 cores (2 per chip) used for training multiplied by the training time in days. + +Table 2 shows the results. The smaller ViT-L/16 model pre-trained on JFT-300M outperforms BiT-L (which is pre-trained on the same dataset) on all tasks, while requiring substantially less computational resources to train. The larger model, ViT-H/14, further improves the performance, especially on the more challenging datasets – ImageNet, CIFAR-100, and the VTAB suite. Interestingly, this + +
Ours-JFT (ViT-H/14)Ours-JFT (ViT-L/16)Ours-I21k (ViT-L/16)BiT-L (ResNet152x4)Noisy Student (EfficientNet-L2)
ImageNet88.55 ± 0.0487.76±0.0385.30±0.0287.54±0.0288.4/88.5*
ImageNet ReaL90.72± 0.0590.54±0.0388.62 ±0.0590.5490.55
CIFAR-1099.50 ±0.0699.42 ± 0.0399.15±0.0399.37±0.061
CIFAR-10094.55 ± 0.0493.90± 0.0593.25± 0.0593.51± 0.081
Oxford-IIITPets97.56 ±0.0397.32 ± 0.1194.67 ± 0.1596.62± 0.23
Oxford Flowers-10299.68 ±0.0299.74± 0.0099.61±0.0299.63±0.03
VTAB (19 tasks)77.63 ±0.2376.28± 0.4672.72±0.2176.29 ± 1.701
TPUv3-core-days2.5k0.68k0.23k9.9k12.3k
+ +Table 2: Comparison with state of the art on popular image classification benchmarks. We report mean and standard deviation of the accuracies, averaged over three fine-tuning runs. Vision Transformer models pre-trained on the JFT-300M dataset outperform ResNet-based baselines on all datasets, while taking substantially less computational resources to pre-train. ViT pre-trained on the smaller public ImageNet-21k dataset performs well too. ∗Slightly improved $8 8 . 5 \%$ result reported in Touvron et al. (2020). + +![](images/6c927eeccc1a23999efc0ec6bd56e353478eda7b515a9f29be07ad08e7a02b2b.jpg) +Figure 2: Breakdown of VTAB performance in Natural, Specialized, and Structured task groups. + +model still took substantially less compute to pre-train than prior state of the art. However, we note that pre-training efficiency may be affected not only by the architecture choice, but also other parameters, such as training schedule, optimizer, weight decay, etc. We provide a controlled study of performance vs. compute for different architectures in Section 4.4. Finally, the ViT-L/16 model pre-trained on the public ImageNet-21k dataset performs well on most datasets too, while taking fewer resources to pre-train: it could be trained using a standard cloud TPUv3 with 8 cores in approximately 30 days. + +Figure 2 decomposes the VTAB tasks into their respective groups, and compares to previous SOTA methods on this benchmark: BiT, VIVI – a ResNet co-trained on ImageNet and Youtube (Tschannen et al., 2020), and S4L – supervised plus semi-supervised learning on ImageNet (Zhai et al., 2019a). ViT-H/14 outperforms BiT- $\mathrm { R } 1 5 2 \mathrm { x } 4$ , and other methods, on the Natural and Structured tasks. On the Specialized the performance of the top two models is similar. + +# 4.3 PRE-TRAINING DATA REQUIREMENTS + +The Vision Transformer performs well when pre-trained on a large JFT-300M dataset. With fewer inductive biases for vision than ResNets, how crucial is the dataset size? We perform two series of experiments. + +First, we pre-train ViT models on datasets of increasing size: ImageNet, ImageNet-21k, and JFT300M. To boost the performance on the smaller datasets, we optimize three basic regularization parameters – weight decay, dropout, and label smoothing. Figure 3 shows the results after finetuning to ImageNet (results on other datasets are shown in Table 5)2. When pre-trained on the smallest dataset, ImageNet, ViT-Large models underperform compared to ViT-Base models, despite (moderate) regularization. With ImageNet-21k pre-training, their performances are similar. Only with JFT-300M, do we see the full benefit of larger models. Figure 3 also shows the performance region spanned by BiT models of different sizes. The BiT CNNs outperform ViT on ImageNet, but with the larger datasets, ViT overtakes. + +![](images/4a5e6cfb502b704bf83885d2ed1d7b6c999d3da766fdf675e6dd8403b6b7832c.jpg) +Figure 3: Transfer to ImageNet. While large ViT models perform worse than BiT ResNets (shaded area) when pre-trained on small datasets, they shine when pre-trained on larger datasets. Similarly, larger ViT variants overtake smaller ones as the dataset grows. + +![](images/ce004e94d63c07640c2be6262378e8ff5241f6ea6f6fbb3d57ba3f0de1fdae38.jpg) +Figure 4: Linear few-shot evaluation on ImageNet versus pre-training size. ResNets perform better with smaller pre-training datasets but plateau sooner than ViT, which performs better with larger pre-training. ViT-b is ViT-B with all hidden dimensions halved. + +![](images/1b271b3e67a07e8f88f0c2cb8b3447dabf063f4620fa2c1ef85ae23c023dc3ae.jpg) +Figure 5: Performance versus cost for different architectures: Vision Transformers, ResNets, and hybrids. Vision Transformers generally outperform ResNets with the same computational budget. Hybrids improve upon pure Transformers for smaller model sizes, but the gap vanishes for larger models. + +Second, we train our models on random subsets of 9M, 30M, and 90M as well as the full JFT300M dataset. We do not perform additional regularization on the smaller subsets and use the same hyper-parameters for all settings. This way, we assess the intrinsic model properties, and not the effect of regularization. We do, however, use early-stopping, and report the best validation accuracy achieved during training. To save compute, we report few-shot linear accuracy instead of full finetuning accuracy. Figure 4 contains the results. Vision Transformers overfit more than ResNets with comparable computational cost on smaller datasets. For example, ViT-B/32 is slightly faster than ResNet50; it performs much worse on the 9M subset, but better on $9 0 \mathbf { M } +$ subsets. The same is true for ResNet152x2 and ViT-L/16. This result reinforces the intuition that the convolutional inductive bias is useful for smaller datasets, but for larger ones, learning the relevant patterns directly from data is sufficient, even beneficial. + +Overall, the few-shot results on ImageNet (Figure 4), as well as the low-data results on VTAB (Table 2) seem promising for very low-data transfer. Further analysis of few-shot properties of ViT is an exciting direction of future work. + +# 4.4 SCALING STUDY + +We perform a controlled scaling study of different models by evaluating transfer performance from JFT-300M. In this setting data size does not bottleneck the models’ performances, and we assess performance versus pre-training cost of each model. The model set includes: 7 ResNets, R50x1, R50x2 R101x1, $\mathbf { R } 1 5 2 \mathbf { x } 1$ , $\mathbf { R } 1 5 2 \mathbf { x } 2$ , pre-trained for 7 epochs, plus $\mathbf { R } 1 5 2 \mathbf { x } 2$ and ${ \mathrm { R } } 2 0 0 { \mathrm { x } } 3 $ pre-trained for 14 epochs; 6 Vision Transformers, ViT-B/32, B/16, L/32, L/16, pre-trained for 7 epochs, plus L/16 and H/14 pre-trained for 14 epochs; and 5 hybrids, R50+ViT-B/32, B/16, L/32, L/16 pretrained for 7 epochs, plus ${ \mathrm { R 5 0 + V i T - L } } / { 1 6 }$ pre-trained for 14 epochs (for hybrids, the number at the end of the model name stands not for the patch size, but for the total dowsampling ratio in the ResNet backbone). + +Figure 5 contains the transfer performance versus total pre-training compute (see Appendix D.4 for details on computational costs). Detailed results per model are provided in Table 6 in the Appendix. A few patterns can be observed. First, Vision Transformers dominate ResNets on the performance/compute trade-off. ViT uses approximately $2 - 4 \times$ less compute to attain the same performance (average over 5 datasets). Second, hybrids slightly outperform ViT at small computational budgets, but the difference vanishes for larger models. This result is somewhat surprising, since one might expect convolutional local feature processing to assist ViT at any size. Third, Vision Transformers appear not to saturate within the range tried, motivating future scaling efforts. + +# 4.5 INSPECTING VISION TRANSFORMER + +To begin to understand how the Vision Transformer processes image data, we analyze its internal representations. The first layer of the Vision Transformer linearly projects the flattened patches into a lower-dimensional space (Eq. 1). Figure 7 (left) shows the top principal components of the the learned embedding filters. The components resemble plausible basis functions for a low-dimensional representation of the fine structure within each patch. + +After the projection, a learned position embedding is added to the patch representations. Figure 7 (center) shows that the model learns to encode distance within the image in the similarity of position embeddings, i.e. closer patches tend to have more similar position embeddings. Further, the row-column structure appears; patches in the same row/column have similar embeddings. Finally, a sinusoidal structure is sometimes apparent for larger grids (Appendix D). That the position embeddings learn to represent 2D image topology explains why hand-crafted 2D-aware embedding variants do not yield improvements (Appendix D.3). + +Self-attention allows ViT to integrate information across the entire image even in the lowest layers. We investigate to what degree the network makes use of this capability. Specifically, we compute the average distance in image space across which information is integrated, based on the attention weights (Figure 7, right). This “attention distance” is analogous to receptive field size in CNNs. + +![](images/8dee27d7e89907230fd6d9b026cd90df1ddb924cc14c12e386acd003ea707154.jpg) +Figure 6: Representative examples of attention from the output token to the input space. See Appendix D.6 for details. + +We find that some heads attend to most of the image already in the lowest layers, showing that the ability to integrate information globally is indeed used by the model. Other attention heads have consistently small attention distances in the low layers. This highly localized attention is less pronounced in hybrid models that apply a ResNet before the Transformer (Figure 7, right), suggesting that it may serve a similar function as early convolutional layers in CNNs. Further, the attention distance increases with network depth. Globally, we find that the model attends to image regions that are semantically relevant for classification (Figure 6). + +# 4.6 SELF-SUPERVISION + +Transformers show impressive performance on NLP tasks. However, much of their success stems not only from their excellent scalability but also from large scale self-supervised pre-training (Devlin et al., 2019; Radford et al., 2018). We also perform a preliminary exploration on masked patch prediction for self-supervision, mimicking the masked language modeling task used in BERT. With self-supervised pre-training, our smaller ViT-B/16 model achieves $7 9 . 9 \%$ accuracy on ImageNet, a significant improvement of $2 \%$ to training from scratch, but still $4 \%$ behind supervised pre-training. Appendix B.1.2 contains further details. We leave exploration of contrastive pre-training (Chen et al., 2020b; He et al., 2020; Bachman et al., 2019; Henaff et al., 2020) to future work. ´ + +![](images/ab9b49548b6e8534a25e7dd9129b1b3881a6beb806baa7a38621f272ca5219bf.jpg) +Figure 7: Left: Filters of the initial linear embedding of RGB values of ViT-L/32. Center: Similarity of position embeddings of ViT-L/32. Tiles show the cosine similarity between the position embedding of the patch with the indicated row and column and the position embeddings of all other patches. Right: Size of attended area by head and network depth. Each dot shows the mean attention distance across images for one of 16 heads at one layer. See Appendix D.6 for details. + +# 5 CONCLUSION + +We have explored the direct application of Transformers to image recognition. Unlike prior works using self-attention in computer vision, we do not introduce image-specific inductive biases into the architecture apart from the initial patch extraction step. Instead, we interpret an image as a sequence of patches and process it by a standard Transformer encoder as used in NLP. This simple, yet scalable, strategy works surprisingly well when coupled with pre-training on large datasets. Thus, Vision Transformer matches or exceeds the state of the art on many image classification datasets, whilst being relatively cheap to pre-train. + +While these initial results are encouraging, many challenges remain. One is to apply ViT to other computer vision tasks, such as detection and segmentation. Our results, coupled with those in Carion et al. (2020), indicate the promise of this approach. Another challenge is to continue exploring selfsupervised pre-training methods. Our initial experiments show improvement from self-supervised pre-training, but there is still large gap between self-supervised and large-scale supervised pretraining. Finally, further scaling of ViT would likely lead to improved performance. + +# ACKNOWLEDGEMENTS + +The work was performed in Berlin, Zurich, and Amsterdam. We thank many colleagues at Google ¨ for their help, in particular Andreas Steiner for crucial help with the infrastructure and the opensource release of the code; Joan Puigcerver and Maxim Neumann for help with the large-scale training infrastructure; Dmitry Lepikhin, Aravindh Mahendran, Daniel Keysers, Mario Luciˇ c, Noam ´ Shazeer, and Colin Raffel for useful discussions. + +# REFERENCES + +Samira Abnar and Willem Zuidema. Quantifying attention flow in transformers. In ACL, 2020. + +Philip Bachman, R Devon Hjelm, and William Buchwalter. Learning representations by maximizing mutual information across views. In NeurIPS, 2019. + +Alexei Baevski and Michael Auli. Adaptive input representations for neural language modeling. In ICLR, 2019. + +I. Bello, B. Zoph, Q. Le, A. Vaswani, and J. Shlens. Attention augmented convolutional networks. In ICCV, 2019. + +Lucas Beyer, Olivier J. Henaff, Alexander Kolesnikov, Xiaohua Zhai, and A ´ aron van den Oord. Are ¨ we done with imagenet? arXiv, 2020. + +Tom B Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. Language models are few-shot learners. arXiv, 2020. + +Nicolas Carion, Francisco Massa, Gabriel Synnaeve, Nicolas Usunier, Alexander Kirillov, and Sergey Zagoruyko. End-to-end object detection with transformers. In ECCV, 2020. + +Mark Chen, Alec Radford, Rewon Child, Jeff Wu, and Heewoo Jun. Generative pretraining from pixels. In ICML, 2020a. + +Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey E. Hinton. A simple framework for contrastive learning of visual representations. In ICML, 2020b. + +Yen-Chun Chen, Linjie Li, Licheng Yu, Ahmed El Kholy, Faisal Ahmed, Zhe Gan, Yu Cheng, and Jingjing Liu. UNITER: UNiversal Image-TExt Representation Learning. In ECCV, 2020c. + +Rewon Child, Scott Gray, Alec Radford, and Ilya Sutskever. Generating long sequences with sparse transformers. arXiv, 2019. + +Jean-Baptiste Cordonnier, Andreas Loukas, and Martin Jaggi. On the relationship between selfattention and convolutional layers. In ICLR, 2020. + +J. Deng, W. Dong, R. Socher, L. Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale hierarchical image database. In CVPR, 2009. + +Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. BERT: Pre-training of deep bidirectional transformers for language understanding. In NAACL, 2019. + +Josip Djolonga, Jessica Yung, Michael Tschannen, Rob Romijnders, Lucas Beyer, Alexander Kolesnikov, Joan Puigcerver, Matthias Minderer, Alexander D’Amour, Dan Moldovan, Sylvan Gelly, Neil Houlsby, Xiaohua Zhai, and Mario Lucic. On robustness and transferability of convolutional neural networks. arXiv, 2020. + +Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In CVPR, 2016. + +Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, and Ross Girshick. Momentum contrast for unsupervised visual representation learning. In CVPR, 2020. + +Jonathan Ho, Nal Kalchbrenner, Dirk Weissenborn, and Tim Salimans. Axial attention in multidimensional transformers. arXiv, 2019. + +Han Hu, Jiayuan Gu, Zheng Zhang, Jifeng Dai, and Yichen Wei. Relation networks for object detection. In CVPR, 2018. + +Han Hu, Zheng Zhang, Zhenda Xie, and Stephen Lin. Local relation networks for image recognition. In ICCV, 2019. + +Zilong Huang, Xinggang Wang, Yunchao Wei, Lichao Huang, Humphrey Shi, Wenyu Liu, and Thomas S. Huang. Ccnet: Criss-cross attention for semantic segmentation. In ICCV, 2020. + +Olivier J. Henaff, Aravind Srinivas, Jeffrey De Fauw, Ali Razavi, Carl Doersch, S. M. Ali Eslami,´ and Aaron van den Oord. Data-efficient image recognition with contrastive predictive coding. In ICML, 2020. + +Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. 2015. + +Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In ICLR, 2015. + +Alexander Kolesnikov, Lucas Beyer, Xiaohua Zhai, Joan Puigcerver, Jessica Yung, Sylvain Gelly, and Neil Houlsby. Big transfer (BiT): General visual representation learning. In ECCV, 2020. + +Alex Krizhevsky. Learning multiple layers of features from tiny images. Technical report, 2009. + +Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton. Imagenet classification with deep convolutional neural networks. In NIPS, 2012. + +Y. LeCun, B. Boser, J. Denker, D. Henderson, R. Howard, W. Hubbard, and L. Jackel. Backpropagation applied to handwritten zip code recognition. Neural Computation, 1:541–551, 1989. + +Dmitry Lepikhin, HyoukJoong Lee, Yuanzhong Xu, Dehao Chen, Orhan Firat, Yanping Huang, Maxim Krikun, Noam Shazeer, and Zhifeng Chen. Gshard: Scaling giant models with conditional computation and automatic sharding. arXiv, 2020. + +Liunian Harold Li, Mark Yatskar, Da Yin, Cho-Jui Hsieh, and Kai-Wei Chang. VisualBERT: A Simple and Performant Baseline for Vision and Language. In Arxiv, 2019. + +Francesco Locatello, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. Object-centric learning with slot attention. arXiv, 2020. + +Jiasen Lu, Dhruv Batra, Devi Parikh, and Stefan Lee. ViLBERT: Pretraining Task-Agnostic Visiolinguistic Representations for Vision-and-Language Tasks. In NeurIPS. 2019. + +Dhruv Mahajan, Ross Girshick, Vignesh Ramanathan, Kaiming He, Manohar Paluri, Yixuan Li, Ashwin Bharambe, and Laurens van der Maaten. Exploring the limits of weakly supervised pretraining. In ECCV, 2018. + +M. Nilsback and A. Zisserman. Automated flower classification over a large number of classes. In ICVGIP, 2008. + +Omkar M. Parkhi, Andrea Vedaldi, Andrew Zisserman, and C. V. Jawahar. Cats and dogs. In CVPR, 2012. + +Niki Parmar, Ashish Vaswani, Jakob Uszkoreit, Lukasz Kaiser, Noam Shazeer, Alexander Ku, and Dustin Tran. Image transformer. In ICML, 2018. + +B. T. Polyak and A. B. Juditsky. Acceleration of stochastic approximation by averaging. SIAM Journal on Control and Optimization, 30(4):838–855, 1992. doi: 10.1137/0330046. URL https://doi.org/10.1137/0330046. + +Siyuan Qiao, Huiyu Wang, Chenxi Liu, Wei Shen, and Alan Yuille. Weight standardization. arXiv preprint arXiv:1903.10520, 2019. + +Alec Radford, Karthik Narasimhan, Tim Salimans, and Ilya Sutskever. Improving language understanding with unsupervised learning. Technical Report, 2018. + +Alec Radford, Jeff Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. Language models are unsupervised multitask learners. Technical Report, 2019. + +Prajit Ramachandran, Niki Parmar, Ashish Vaswani, Irwan Bello, Anselm Levskaya, and Jon Shlens. Stand-alone self-attention in vision models. In NeurIPS, 2019. + +Chen Sun, Abhinav Shrivastava, Saurabh Singh, and Abhinav Gupta. Revisiting unreasonable effectiveness of data in deep learning era. In ICCV, 2017. + +Chen Sun, Austin Myers, Carl Vondrick, Kevin Murphy, and Cordelia Schmid. Videobert: A joint model for video and language representation learning. In ICCV, 2019. + +Hugo Touvron, Andrea Vedaldi, Matthijs Douze, and Herve Jegou. Fixing the train-test resolution discrepancy. In NeurIPS. 2019. + +Hugo Touvron, Andrea Vedaldi, Matthijs Douze, and Herve Jegou. Fixing the train-test resolution discrepancy: Fixefficientnet. arXiv preprint arXiv:2003.08237, 2020. + +Michael Tschannen, Josip Djolonga, Marvin Ritter, Aravindh Mahendran, Neil Houlsby, Sylvain Gelly, and Mario Lucic. Self-supervised learning of video-induced visual invariances. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), June 2020. + +Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. In NIPS, 2017. + +Huiyu Wang, Yukun Zhu, Bradley Green, Hartwig Adam, Alan Yuille, and Liang-Chieh Chen. Axial-deeplab: Stand-alone axial-attention for panoptic segmentation. In ECCV, 2020a. + +Huiyu Wang, Yukun Zhu, Bradley Green, Hartwig Adam, Alan Yuille, and Liang-Chieh Chen. Axial-deeplab: Stand-alone axial-attention for panoptic segmentation. arXiv preprint arXiv:2003.07853, 2020b. + +Qiang Wang, Bei Li, Tong Xiao, Jingbo Zhu, Changliang Li, Derek F. Wong, and Lidia S. Chao. Learning deep transformer models for machine translation. In ACL, 2019. + +Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaiming He. Non-local neural networks. In CVPR, 2018. + +Dirk Weissenborn, Oscar Tackstr ¨ om, and Jakob Uszkoreit. Scaling autoregressive video models. In ¨ ICLR, 2019. + +Bichen Wu, Chenfeng Xu, Xiaoliang Dai, Alvin Wan, Peizhao Zhang, Masayoshi Tomizuka, Kurt Keutzer, and Peter Vajda. Visual transformers: Token-based image representation and processing for computer vision. arxiv, 2020. + +Yuxin Wu and Kaiming He. Group normalization. In ECCV, 2018. + +Qizhe Xie, Minh-Thang Luong, Eduard Hovy, and Quoc V. Le. Self-training with noisy student improves imagenet classification. In CVPR, 2020. + +Xiaohua Zhai, Avital Oliver, Alexander Kolesnikov, and Lucas Beyer. $\mathrm { S ^ { 4 } L }$ : Self-Supervised SemiSupervised Learning. In ICCV, 2019a. + +Xiaohua Zhai, Joan Puigcerver, Alexander Kolesnikov, Pierre Ruyssen, Carlos Riquelme, Mario Lucic, Josip Djolonga, Andre Susano Pinto, Maxim Neumann, Alexey Dosovitskiy, et al. A large-scale study of representation learning with the visual task adaptation benchmark. arXiv preprint arXiv:1910.04867, 2019b. + +Hengshuang Zhao, Jiaya Jia, and Vladlen Koltun. Exploring self-attention for image recognition. In CVPR, 2020. + +Table 3: Hyperparameters for training. All models are trained with a batch size of 4096 and learning rate warmup of $1 0 \mathrm { k }$ steps. For ImageNet we found it beneficial to additionally apply gradient clipping at global norm 1. Training resolution is 224. + +
ModelsDatasetEpochsBase LRLR decayWeight decayDropout
ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
ViT-L/32JFT-300M76.10-4linear0.10.0
ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-H/14JFT-300M143.10-4linear0.10.0
R50x{1,2}JFT-300M710-3linear0.10.0
R101x1JFT-300M78.10-4linear0.10.0
R152x{1,2}JFT-300M76·10-4linear0.10.0
R50+ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
R50+ViT-L/32JFT-300M72.10-4linear0.10.0
R50+ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-B/{16,32}ImageNet-21k9010-3linear0.030.1
ViT-L/{16,32}ImageNet-21k30/9010-3linear0.030.1
ViT-*ImageNet3003.10-3cosine0.30.1
+ +# APPENDIX + +# A MULTIHEAD SELF-ATTENTION + +Standard qkv self-attention (SA, Vaswani et al. (2017)) is a popular building block for neural architectures. For each element in an input sequence $\mathbf { z } \in \mathbb { R } ^ { N \times \dot { D } }$ , we compute a weighted sum over all values $\mathbf { v }$ in the sequence. The attention weights $A _ { i j }$ are based on the pairwise similarity between two elements of the sequence and their respective query $\mathbf { q } ^ { i }$ and key $\mathbf { k } ^ { j }$ representations. + +$$ +\begin{array} { r l } { [ \mathbf { q } , \mathbf { k } , \mathbf { v } ] = \mathbf { z } \mathbf { U } _ { q k v } \qquad } & { \mathbf { U } _ { q k v } \in \mathbb { R } ^ { D \times 3 D _ { h } } , } \\ { A = \mathrm { s o f t m a x } \left( \mathbf { q } \mathbf { k } ^ { \top } / \sqrt { D _ { h } } \right) \qquad } & { A \in \mathbb { R } ^ { N \times N } , } \\ { \mathrm { S A } ( \mathbf { z } ) = A \mathbf { v } . } \end{array} +$$ + +Multihead self-attention (MSA) is an extension of SA in which we run $k$ self-attention operations, called “heads”, in parallel, and project their concatenated outputs. To keep compute and number of parameters constant when changing $k$ , $D _ { h }$ (Eq. 5) is typically set to $D / k$ . + +$$ +\begin{array} { r } { \mathrm { M S A } ( \mathbf { z } ) = [ \mathrm { S A } _ { 1 } ( z ) ; \mathrm { S A } _ { 2 } ( z ) ; \cdots \ ; \mathrm { S A } _ { k } ( z ) ] \mathbf { U } _ { m s a } \qquad \quad \mathbf { U } _ { m s a } \in \mathbb { R } ^ { k \cdot D _ { h } \times D } } \end{array} +$$ + +# B EXPERIMENT DETAILS + +# B.1 TRAINING + +Table 3 summarizes our training setups for our different models. We found strong regularization to be key when training models from scratch on ImageNet. Dropout, when used, is applied after every dense layer except for the the qkv-projections and directly after adding positional- to patch embeddings. Hybrid models are trained with the exact setup as their ViT counterparts. Finally, all training is done on resolution 224. + +# B.1.1 FINE-TUNING + +We fine-tune all ViT models using SGD with a momentum of 0.9. We run a small grid search over learning rates, see learning rate ranges in Table 4. To do so, we use small sub-splits from the training set ( $10 \%$ for Pets and Flowers, $2 \%$ for CIFAR, $1 \%$ ImageNet) as development set and train on the remaining data. For final results we train on the entire training set and evaluate on the respective test data. For fine-tuning ResNets and hybrid models we use the exact same setup, with the only exception of ImageNet where we add another value 0.06 to the learning rate sweep. Additionally, + +
DatasetStepsBase LR
ImageNet20000{0.003,0.01,0.03, 0.06}
CIFAR10010000{0.001,0.003,0.01,0.03}
CIFAR1010000{0.001,0.003,0.01, 0.03}
Oxford-IIITPets500{0.001,0.003,0.01,0.03}
Oxford Flowers-102500{0.001, 0.003,0.01, 0.03}
VTAB (19 tasks)25000.01
+ +Table 4: Hyperparameters for fine-tuning. All models are fine-tuned with cosine learning rate decay, a batch size of 512, no weight decay, and grad clipping at global norm 1. If not mentioned otherwise, fine-tuning resolution is 384. + +for ResNets we also run the setup of Kolesnikov et al. (2020) and select the best results across this run and our sweep. Finally, if not mentioned otherwise, all fine-tuning experiments run at 384 resolution (running fine-tuning at different resolution than training is common practice (Kolesnikov et al., 2020)). + +When transferring ViT models to another dataset, we remove the whole head (two linear layers) and replace it by a single, zero-initialized linear layer outputting the number of classes required by the target dataset. We found this to be a little more robust than simply re-initializing the very last layer. + +For VTAB we follow the protocol in Kolesnikov et al. (2020), and use the same hyperparameter setting for all tasks. We use a learning rate of 0.01 and train for 2500 steps (Tab. 4). We chose this setting by running a small sweep over two learning rates and two schedules, and selecting the setting with the highest VTAB score on the 200-example validation sets. We follow the pre-processing used in Kolesnikov et al. (2020), except that we do not use task-specific input resolutions. Instead we find that Vision Transformer benefits most from a high resolution $( 3 8 4 \times 3 8 4 )$ for all tasks. + +# B.1.2 SELF-SUPERVISION + +We employ the masked patch prediction objective for preliminary self-supervision experiments. To do so we corrupt $50 \%$ of patch embeddings by either replacing their embeddings with a learnable [mask] embedding $( 8 0 \% )$ , a random other patch embedding $( 1 0 \% )$ or just keeping them as is $( 1 0 \% )$ . This setup is very similar to the one used for language by Devlin et al. (2019). Finally, we predict the 3-bit, mean color (i.e., 512 colors in total) of every corrupted patch using their respective patch representations. + +We trained our self-supervised model for 1M steps (ca. 14 epochs) with batch size 4096 on JFT. We use Adam, with a base learning rate of $2 \cdot 1 0 ^ { - 4 }$ , warmup of $1 0 \mathrm { k }$ steps and cosine learning rate decay. As prediction targets for pretraining we tried the following settings: 1) predicting only the mean, 3bit color (i.e., 1 prediction of 512 colors), 2) predicting a $4 \times 4$ downsized version of the $1 6 \times 1 6$ patch with 3bit colors in parallel (i.e., 16 predictions of 512 colors), 3) regression on the full patch using L2 (i.e., 256 regressions on the 3 RGB channels). Surprisingly, we found that all worked quite well, though L2 was slightly worse. We report final results only for option 1) because it has shown best few-shot performance. We also experimented with $15 \%$ corruption rate as used by Devlin et al. (2019) but results were also slightly worse on our few-shot metrics. + +Lastly, we would like to remark that our instantiation of masked patch prediction doesn’t require such an enormous amount of pretraining nor a large dataset such as JFT in order to lead to similar performance gains on ImageNet classification. That is, we observed diminishing returns on downstream performance after $1 0 0 \mathrm { k }$ pretraining steps, and see similar gains when pretraining on ImageNet. + +# C ADDITIONAL RESULTS + +We report detailed results corresponding to the figures presented in the paper. Table 5 corresponds to Figure 3 from the paper and shows transfer performance of different ViT models pre-trained on datasets of increasing size: ImageNet, ImageNet-21k, and JFT-300M. Table 6 corresponds to + +Table 5: Top1 accuracy (in $\%$ ) of Vision Transformer on various datasets when pre-trained on ImageNet, ImageNet-21k or JFT300M. These values correspond to Figure 3 in the main text. Models are fine-tuned at 384 resolution. Note that the ImageNet results are computed without additional techniques (Polyak averaging and 512 resolution images) used to achieve results in Table 2. + +
ViT-B/16ViT-B/32ViT-L/16ViT-L/32ViT-H/14
ImageNetCIFAR-1098.1397.7797.8697.94
CIFAR-10087.1386.3186.3587.07
ImageNet77.9173.3876.5371.16
ImageNet ReaL83.5779.5682.1977.83
Oxford Flowers-10289.4985.4389.6686.36
Oxford-IIIT-Pets93.8192.0493.6491.35■
ImageNet-21kCIFAR-1098.9598.7999.1699.1399.27
CIFAR-10091.6791.9793.4493.0493.82
ImageNet83.9781.2885.1580.9985.13
ImageNet ReaL88.3586.6388.4085.6588.70
Oxford Flowers-102 Oxford-IIIT-Pets99.3899.1199.6199.1999.51
94.4393.0294.7393.0994.82
JFT-300MCIFAR-1099.0098.6199.3899.1999.50
CIFAR-10091.8790.4994.0492.5294.55
ImageNet84.1580.7387.1284.3788.04
ImageNet ReaL88.8586.2789.9988.2890.33
Oxford Flowers-10299.5699.2799.5699.4599.68
Oxford-IIIT-Pets95.8093.4097.1195.8397.56
+ +
ModelEpochsImageNetImageNet ReaLCIFAR-10CIFAR-100PetsFlowersexaFLOPs
ViT-B/32780.7386.2798.6190.4993.4099.27164
ViT-B/16784.1588.8599.0091.8795.8099.56743
ViT-L/32784.3788.2899.1992.5295.8399.45574
ViT-L/16786.3089.4399.3893.4696.8199.662586
ViT-L/161487.1289.9999.3894.0497.1199.565172
ViT-H/141488.0890.3699.5094.7197.1199.7112826
ResNet50x1777.5484.5697.6786.0791.1194.26150
ResNet50x2782.1287.9498.2989.2093.4397.02592
ResNet101x1780.6787.0798.4889.1794.0895.95285
ResNet152x1781.8887.9698.8290.2294.1796.94427
ResNet152x2784.9789.6999.0692.0595.3798.621681
ResNet152x21485.5689.8999.2491.9295.7598.753362
ResNet200x31487.2290.1599.3493.5396.3299.0410212
R50x1+ViT-B/32784.9089.1599.0192.2495.7599.46315
R50x1+ViT-B/16785.5889.6599.1492.6396.6599.40855
R50x1+ViT-L/32785.6889.0499.2492.9396.9799.43725
R50x1+ViT-L/16786.6089.7299.1893.6497.0399.402704
R50x1+ViT-L/161487.1289.7699.3193.8997.3699.115165
+ +Table 6: Detailed results of model scaling experiments. These correspond to Figure 5 in the main paper. + +Figure 5 from the paper and shows the transfer performance of ViT, ResNet, and hybrid models of varying size, as well as the estimated computational cost of their pre-training. + +# D ADDITIONAL ANALYSES + +# D.1 SGD VS. ADAM FOR RESNETS + +ResNets are typically trained with SGD and our use of Adam as optimizer is quite unconventional. Here we show the experiments that motivated this choice. Namely, we compare the fine-tuning performance of two ResNets – 50x1 and $1 5 2 \mathrm { x } 2 $ – pre-trained on JFT with SGD and Adam. For SGD, we use the hyperparameters recommended by Kolesnikov et al. (2020). Results are presented in Table 7. Adam pre-training outperforms SGD pre-training on most datasets and on average. This justifies the choice of Adam as the optimizer used to pre-train ResNets on JFT. Note that the absolute numbers are lower than those reported by Kolesnikov et al. (2020), since we pre-train only for 7 epochs, not 30. + +Table 7: Fine-tuning ResNet models pre-trained with Adam and SGD. + +
ResNet50ResNet152x2
DatasetAdamSGDAdamSGD
ImageNet77.5478.2484.9784.37
CIFAR1097.6797.4699.0699.07
CIFAR10086.0785.1792.0591.06
Oxford-IIITPets91.1191.0095.3794.79
Oxford Flowers-10294.2692.0698.6299.32
Average89.3388.7994.0193.72
+ +![](images/087590a6ace2243bc302d256c0334466601d635e411a4191b5cb851d0b812782.jpg) +Figure 8: Scaling different model dimensions of the Vision Transformer. + +# D.2 TRANSFORMER SHAPE + +We ran ablations on scaling different dimensions of the Transformer architecture to find out which are best suited for scaling to very large models. Figure 8 shows 5-shot performance on ImageNet for different configurations. All configurations are based on a ViT model with 8 layers, $D = 1 0 2 4$ , $D _ { M L P } = 2 0 4 8$ and a patch size of 32, the intersection of all lines. We can see that scaling the depth results in the biggest improvements which are clearly visible up until 64 layers. However, diminishing returns are already visible after 16 layers. Interestingly, scaling the width of the network seems to result in the smallest changes. Decreasing the patch size and thus increasing the effective sequence length shows surprisingly robust improvements without introducing parameters. These findings suggest that compute might be a better predictor of performance than the number of parameters, and that scaling should emphasize depth over width if any. Overall, we find that scaling all dimensions proportionally results in robust improvements. + +# D.3 POSITIONAL EMBEDDING + +We ran ablations on different ways of encoding spatial information using positional embedding. We tried the following cases: + +• Providing no positional information: Considering the inputs as a bag of patches. • 1-dimensional positional embedding: Considering the inputs as a sequence of patches in the raster order (default across all other experiments in this paper). • 2-dimensional positional embedding: Considering the inputs as a grid of patches in two dimensions. In this case, two sets of embeddings are learned, each for one of the axes, $X$ -embedding, and $Y$ -embedding, each with size $D / 2$ . Then, based on the coordinate on the path in the input, we concatenate the $X$ and $Y$ embedding to get the final positional embedding for that patch. + +Table 8: Results of the ablation study on positional embeddings with ViT-B/16 model evaluated on ImageNet 5-shot linear. + +
Pos. Emb.Default/StemEvery LayerEvery Layer-Shared
No Pos. Emb.0.61382N/AN/A
1-D Pos. Emb.0.642060.639640.64292
2-D Pos. Emb.0.640010.640460.64022
Rel. Pos.Emb.0.64032N/AN/A
+ +![](images/f17a7ad1c8d7369bd3a83cfd6f7a7e661a00f552506b476bfe155394c93fb3d0.jpg) +Figure 9: Position embeddings of models trained with different hyperparameters. + +• Relative positional embeddings: Considering the relative distance between patches to encode the spatial information as instead of their absolute position. To do so, we use 1- dimensional Relative Attention, in which we define the relative distance all possible pairs of patches. Thus, for every given pair (one as query, and the other as key/value in the attention mechanism), we have an offset $p _ { q } - p _ { k }$ , where each offset is associated with an embedding. Then, we simply run extra attention, where we use the original query (the content of query), but use relative positional embeddings as keys. We then use the logits from the relative attention as a bias term and add it to the logits of the main attention (content-based attention) before applying the softmax. + +In addition to different ways of encoding spatial information, we also tried different ways of incorporating this information in our model. For the 1-dimensional and 2-dimensional positional embeddings, we tried three different cases: (1) add positional embeddings to the inputs right after the stem of them model and before feeding the inputs to the Transformer encoder (default across all other experiments in this paper); (2) learn and add positional embeddings to the inputs at the beginning of each layer; (3) add a learned positional embeddings to the inputs at the beginning of each layer (shared between layers). + +Table 8 summarizes the results from this ablation study on a ViT-B/16 model. As we can see, while there is a large gap between the performances of the model with no positional embedding and models with positional embedding, there is little to no difference between different ways of encoding positional information. We speculate that since our Transformer encoder operates on patch-level inputs, as opposed to pixel-level, the differences in how to encode spatial information is less important. More precisely, in patch-level inputs, the spatial dimensions are much smaller than the original pixel-level inputs, e.g., $1 4 \times 1 4$ as opposed to $2 2 4 \times 2 2 4$ , and learning to represent the spatial relations in this resolution is equally easy for these different positional encoding strategies. Even so, the specific pattern of position embedding similarity learned by the network depends on the training hyperparameters (Figure 9). + +![](images/5ed38ba4f1b7ab9d93edbca4579d27ee5df39ca42cb87a60b78985f34a6716ae.jpg) +Figure 10: Size of attended area by head and network depth. Attention distance was computed for 128 example images by averaging the distance between the query pixel and all other pixels, weighted by the attention weight. Each dot shows the mean attention distance across images for one of 16 heads at one layer. Image width is 224 pixels. + +# D.4 EMPIRICAL COMPUTATIONAL COSTS + +We are also interested in real-world speed of the architectures on our hardware, which is not always well predicted by theoretical FLOPs due to details like lane widths and cache sizes. For this purpose, we perform timing of inference speed for the main models of interest, on a TPUv3 accelerator; the difference between inference and backprop speed is a constant model-independent factor. + +Figure 11 (left) shows how many images one core can handle per second, across various input sizes. Every single point refers to the peak performance measured across a wide range of batch-sizes. As can be seen, the theoretical bi-quadratic scaling of ViT with image size only barely starts happening for the largest models at the largest resolutions. + +Another quantity of interest is the largest batch-size each model can fit onto a core, larger being better for scaling to large datasets. Figure 11 (right) shows this quantity for the same set of models. This shows that large ViT models have a clear advantage in terms of memory-efficiency over ResNet models. + +# D.5 AXIAL ATTENTION + +Axial Attention (Huang et al., 2020; Ho et al., 2019) is a simple, yet effective technique to run selfattention on large inputs that are organized as multidimensional tensors. The general idea of axial attention is to perform multiple attention operations, each along a single axis of the input tensor, instead of applying 1-dimensional attention to the flattened version of the input. In axial attention, each attention mixes information along a particular axis, while keeping information along the other axes independent. Along this line, Wang et al. (2020b) proposed the AxialResNet model in which all the convolutions with kernel size $3 \times 3$ in a ResNet50 are replaced by axial self-attention, i.e. a row and column attention, augmented by relative positional encoding. We have implemented AxialResNet as a baseline model.3. + +Moreover, we have modified ViT to process inputs in the 2-dimensional shape, instead of a 1- dimensional sequence of patches, and incorporate Axial Transformer blocks, in which instead of a self-attention followed by an MLP, we have a a row-self-attention plus an MLP followed by a column-self-attention plus an MLP. + +![](images/d008d21d372389ac2c877fbe8ea659a89fabdc092dd9047ef2ebdf27c3aa6aeb.jpg) +Figure 11: Left: Real wall-clock timings of various architectures across input sizes. ViT models have speed comparable to similar ResNets. Right: Largest per-core batch-size fitting on device with various architectures across input sizes. ViT models are clearly more memory-efficient. + +![](images/1fed46da5b7a53532096674323e26d44ee931247b2ce97baead29e2301c60f89.jpg) +Figure 12: Performance of Axial-Attention based models, in terms of top-1 accuracy on ImageNet 5-shot linear, versus their speed in terms of number of FLOPs (left) and inference time (left). + +Figure 12, present the performance of Axial ResNet, Axial-ViT-B/32 and Axial-ViT-B/16 on ImageNet 5shot linear, when pretrained on JFT dataset, verses the pretraining compute, both in terms of number of FLOPs and inference time (example per seconds). As we can see, both Axial-ViT-B/32 and Axial-ViT-B/16 do better than their ViT-B counterpart in terms of performance, but it comes at the cost of more compute. This is because in Axial-ViT models, each Transformer block with global self-attention is replaced by two Axial Transformer blocks, one with row and one with column selfattention and although the sequence length that self-attention operates on is smaller in axial case, there is a extra MLP per Axial-ViT block. For the AxialResNet, although it looks reasonable in terms of accuracy/compute trade-off (Figure 12, left), the naive implementation is extremely slow on TPUs (Figure 12, right). + +# D.6 ATTENTION DISTANCE + +To understand how ViT uses self-attention to integrate information across the image, we analyzed the average distance spanned by attention weights at different layers (Figure 10). This “attention distance” is analogous to receptive field size in CNNs. Average attention distance is highly variable + +across heads in lower layers, with some heads attending to much of the image, while others attend to small regions at or near the query location. As depth increases, attention distance increases for all heads. In the second half of the network, most heads attend widely across tokens. + +# D.7 ATTENTION MAPS + +To compute maps of the attention from the output token to the input space (Figures 6 and 13), we used Attention Rollout (Abnar & Zuidema, 2020). Briefly, we averaged attention weights of ViT$\mathrm { L } / 1 6$ across all heads and then recursively multiplied the weight matrices of all layers. This accounts for the mixing of attention across tokens through all layers. + +# D.8 VTAB BREAKDOWN + +Table 9 shows the scores attained on each of the VTAB-1k tasks. + +Table 9: Breakdown of VTAB-1k performance across tasks. + +
0oreeeaerCIIPIP0 :DEI ·irmsiIs1ed660unsNHASeeaaemButoS55sr515GrrrogarCerrrelrr CTr-stq NTapop-dPuo-Idsp·JTI-ITTTTSIIH-SRARSSH-PRPPEE7aam
ViT-H/14 (JFT)95.385.575.299.797.265.088.983.396.791.476.691.763.853.179.463.384.533.251.277.6
ViT-L/16 (JFT)95.481.974.399.796.763.587.483.696.589.777.186.463.149.774.560.582.236.251.176.3
ViT-L/16 (I21k)90.884.174.199.392.761.080.982.595.685.275.370.356.141.974.764.979.930.541.772.7
+ +![](images/12d3ed42eccf501384439819f02277513ab0a56bd02b7d4b37a2542cffac7ee9.jpg) +Figure 13: Further example attention maps as in Figure 6 (random selection). \ No newline at end of file diff --git a/parse/train/YicbFdNTTy/YicbFdNTTy_content_list.json b/parse/train/YicbFdNTTy/YicbFdNTTy_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..948f42090bf26f46dfd0f6fecac1401dce6ee086 --- /dev/null +++ b/parse/train/YicbFdNTTy/YicbFdNTTy_content_list.json @@ -0,0 +1,2345 @@ +[ + { + "type": "text", + "text": "AN IMAGE IS WORTH 16X16 WORDS: TRANSFORMERS FOR IMAGE RECOGNITION AT SCALE ", + "text_level": 1, + "bbox": [ + 178, + 98, + 823, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Alexey Dosovitskiy∗,†, Lucas Beyer∗, Alexander Kolesnikov∗, Dirk Weissenborn∗, Xiaohua Zhai∗, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer, Georg Heigold, Sylvain Gelly, Jakob Uszkoreit, Neil Houlsby∗,† ", + "bbox": [ + 228, + 170, + 799, + 218 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "∗equal technical contribution, †equal advising Google Research, Brain Team {adosovitskiy, neilhoulsby}@google.com ", + "bbox": [ + 325, + 222, + 694, + 270 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 305, + 544, + 320 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "While the Transformer architecture has become the de-facto standard for natural language processing tasks, its applications to computer vision remain limited. In vision, attention is either applied in conjunction with convolutional networks, or used to replace certain components of convolutional networks while keeping their overall structure in place. We show that this reliance on CNNs is not necessary and a pure transformer applied directly to sequences of image patches can perform very well on image classification tasks. When pre-trained on large amounts of data and transferred to multiple mid-sized or small image recognition benchmarks (ImageNet, CIFAR-100, VTAB, etc.), Vision Transformer (ViT) attains excellent results compared to state-of-the-art convolutional networks while requiring substantially fewer computational resources to train.1 ", + "bbox": [ + 233, + 338, + 764, + 491 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 522, + 336, + 537 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Self-attention-based architectures, in particular Transformers (Vaswani et al., 2017), have become the model of choice in natural language processing (NLP). The dominant approach is to pre-train on a large text corpus and then fine-tune on a smaller task-specific dataset (Devlin et al., 2019). Thanks to Transformers’ computational efficiency and scalability, it has become possible to train models of unprecedented size, with over 100B parameters (Brown et al., 2020; Lepikhin et al., 2020). With the models and datasets growing, there is still no sign of saturating performance. ", + "bbox": [ + 174, + 555, + 825, + 638 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In computer vision, however, convolutional architectures remain dominant (LeCun et al., 1989; Krizhevsky et al., 2012; He et al., 2016). Inspired by NLP successes, multiple works try combining CNN-like architectures with self-attention (Wang et al., 2018; Carion et al., 2020), some replacing the convolutions entirely (Ramachandran et al., 2019; Wang et al., 2020a). The latter models, while theoretically efficient, have not yet been scaled effectively on modern hardware accelerators due to the use of specialized attention patterns. Therefore, in large-scale image recognition, classic ResNetlike architectures are still state of the art (Mahajan et al., 2018; Xie et al., 2020; Kolesnikov et al., 2020). ", + "bbox": [ + 174, + 646, + 825, + 757 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Inspired by the Transformer scaling successes in NLP, we experiment with applying a standard Transformer directly to images, with the fewest possible modifications. To do so, we split an image into patches and provide the sequence of linear embeddings of these patches as an input to a Transformer. Image patches are treated the same way as tokens (words) in an NLP application. We train the model on image classification in supervised fashion. ", + "bbox": [ + 174, + 763, + 823, + 834 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "When trained on mid-sized datasets such as ImageNet without strong regularization, these models yield modest accuracies of a few percentage points below ResNets of comparable size. This seemingly discouraging outcome may be expected: Transformers lack some of the inductive biases inherent to CNNs, such as translation equivariance and locality, and therefore do not generalize well when trained on insufficient amounts of data. ", + "bbox": [ + 176, + 840, + 823, + 883 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, the picture changes if the models are trained on larger datasets (14M-300M images). We find that large scale training trumps inductive bias. Our Vision Transformer (ViT) attains excellent results when pre-trained at sufficient scale and transferred to tasks with fewer datapoints. When pre-trained on the public ImageNet-21k dataset or the in-house JFT-300M dataset, ViT approaches or beats state of the art on multiple image recognition benchmarks. In particular, the best model reaches the accuracy of $8 8 . 5 5 \\%$ on ImageNet, $9 0 . 7 2 \\%$ on ImageNet-ReaL, $9 4 . 5 5 \\%$ on CIFAR-100, and $7 7 . 6 3 \\%$ on the VTAB suite of 19 tasks. ", + "bbox": [ + 174, + 138, + 825, + 236 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 284, + 343, + 299 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Transformers were proposed by Vaswani et al. (2017) for machine translation, and have since become the state of the art method in many NLP tasks. Large Transformer-based models are often pre-trained on large corpora and then fine-tuned for the task at hand: BERT (Devlin et al., 2019) uses a denoising self-supervised pre-training task, while the GPT line of work uses language modeling as its pre-training task (Radford et al., 2018; 2019; Brown et al., 2020). ", + "bbox": [ + 174, + 332, + 823, + 401 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Naive application of self-attention to images would require that each pixel attends to every other pixel. With quadratic cost in the number of pixels, this does not scale to realistic input sizes. Thus, to apply Transformers in the context of image processing, several approximations have been tried in the past. Parmar et al. (2018) applied the self-attention only in local neighborhoods for each query pixel instead of globally. Such local multi-head dot-product self attention blocks can completely replace convolutions (Hu et al., 2019; Ramachandran et al., 2019; Zhao et al., 2020). In a different line of work, Sparse Transformers (Child et al., 2019) employ scalable approximations to global selfattention in order to be applicable to images. An alternative way to scale attention is to apply it in blocks of varying sizes (Weissenborn et al., 2019), in the extreme case only along individual axes (Ho et al., 2019; Wang et al., 2020a). Many of these specialized attention architectures demonstrate promising results on computer vision tasks, but require complex engineering to be implemented efficiently on hardware accelerators. ", + "bbox": [ + 174, + 409, + 825, + 575 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Most related to ours is the model of Cordonnier et al. (2020), which extracts patches of size $2 \\times 2$ from the input image and applies full self-attention on top. This model is very similar to ViT, but our work goes further to demonstrate that large scale pre-training makes vanilla transformers competitive with (or even better than) state-of-the-art CNNs. Moreover, Cordonnier et al. (2020) use a small patch size of $2 \\times 2$ pixels, which makes the model applicable only to small-resolution images, while we handle medium-resolution images as well. ", + "bbox": [ + 174, + 582, + 825, + 665 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "There has also been a lot of interest in combining convolutional neural networks (CNNs) with forms of self-attention, e.g. by augmenting feature maps for image classification (Bello et al., 2019) or by further processing the output of a CNN using self-attention, e.g. for object detection (Hu et al., 2018; Carion et al., 2020), video processing (Wang et al., 2018; Sun et al., 2019), image classification (Wu et al., 2020), unsupervised object discovery (Locatello et al., 2020), or unified text-vision tasks (Chen et al., 2020c; Lu et al., 2019; Li et al., 2019). ", + "bbox": [ + 174, + 672, + 825, + 756 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Another recent related model is image GPT (iGPT) (Chen et al., 2020a), which applies Transformers to image pixels after reducing image resolution and color space. The model is trained in an unsupervised fashion as a generative model, and the resulting representation can then be fine-tuned or probed linearly for classification performance, achieving a maximal accuracy of $72 \\%$ on ImageNet. ", + "bbox": [ + 174, + 762, + 823, + 819 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our work adds to the increasing collection of papers that explore image recognition at larger scales than the standard ImageNet dataset. The use of additional data sources allows to achieve state-ofthe-art results on standard benchmarks (Mahajan et al., 2018; Touvron et al., 2019; Xie et al., 2020). Moreover, Sun et al. (2017) study how CNN performance scales with dataset size, and Kolesnikov et al. (2020); Djolonga et al. (2020) perform an empirical exploration of CNN transfer learning from large scale datasets such as ImageNet-21k and JFT-300M. We focus on these two latter datasets as well, but train Transformers instead of ResNet-based models used in prior works. ", + "bbox": [ + 174, + 825, + 825, + 922 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/8472b256645bd1d1ee65ff7be22b05844a49588fe828da13912901c773e8ea78.jpg", + "image_caption": [ + "Figure 1: Model overview. We split an image into fixed-size patches, linearly embed each of them, add position embeddings, and feed the resulting sequence of vectors to a standard Transformer encoder. In order to perform classification, we use the standard approach of adding an extra learnable “classification token” to the sequence. The illustration of the Transformer encoder was inspired by Vaswani et al. (2017). " + ], + "image_footnote": [], + "bbox": [ + 240, + 102, + 766, + 313 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 METHOD ", + "text_level": 1, + "bbox": [ + 174, + 450, + 282, + 467 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "In model design we follow the original Transformer (Vaswani et al., 2017) as closely as possible. An advantage of this intentionally simple setup is that scalable NLP Transformer architectures – and their efficient implementations – can be used almost out of the box. ", + "bbox": [ + 174, + 497, + 825, + 540 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 VISION TRANSFORMER (VIT) ", + "text_level": 1, + "bbox": [ + 176, + 583, + 421, + 598 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "An overview of the model is depicted in Figure 1. The standard Transformer receives as input a 1D sequence of token embeddings. To handle 2D images, we reshape the image $\\mathbf { x } \\in \\mathbb { R } ^ { H \\times W \\times \\dot { C } }$ into a sequence of flattened 2D patches $\\mathbf { x } _ { p } \\in \\mathbb { R } ^ { N \\times ( P ^ { 2 } \\cdot C ) }$ , where $( H , W )$ is the resolution of the original image, $C$ is the number of channels, $( P , P )$ is the resolution of each image patch, and $N = H W / P ^ { 2 }$ is the resulting number of patches, which also serves as the effective input sequence length for the Transformer. The Transformer uses constant latent vector size $D$ through all of its layers, so we flatten the patches and map to $D$ dimensions with a trainable linear projection (Eq. 1). We refer to the output of this projection as the patch embeddings. ", + "bbox": [ + 174, + 619, + 825, + 736 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Similar to BERT’s [class] token, we prepend a learnable embedding to the sequence of embedded patches $( \\mathbf { z } _ { 0 } ^ { 0 } = \\mathbf { x } _ { \\mathrm { c l a s s } } )$ , whose state at the output of the Transformer encoder $( \\mathbf { \\bar { z } } _ { L } ^ { 0 } )$ serves as the image representation y (Eq. 4). Both during pre-training and fine-tuning, a classification head is attached to $\\mathbf { z } _ { L } ^ { 0 }$ . The classification head is implemented by a MLP with one hidden layer at pre-training time and by a single linear layer at fine-tuning time. ", + "bbox": [ + 174, + 742, + 825, + 811 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Position embeddings are added to the patch embeddings to retain positional information. We use standard learnable 1D position embeddings, since we have not observed significant performance gains from using more advanced 2D-aware position embeddings (Appendix D.3). The resulting sequence of embedding vectors serves as input to the encoder. ", + "bbox": [ + 174, + 819, + 825, + 875 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The Transformer encoder (Vaswani et al., 2017) consists of alternating layers of multiheaded selfattention (MSA, see Appendix A) and MLP blocks (Eq. 2, 3). Layernorm (LN) is applied before every block, and residual connections after every block (Wang et al., 2019; Baevski & Auli, 2019). ", + "bbox": [ + 176, + 881, + 823, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The MLP contains two layers with a GELU non-linearity. ", + "bbox": [ + 173, + 103, + 552, + 118 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/0fbfea81638ce25320b43318b8054b038f0069432258d34a062fcd650466d317.jpg", + "text": "$$\n\\begin{array} { r l r l } & { \\mathbf z _ { 0 } = [ \\mathbf x _ { \\mathrm { c l a s s } } ; \\mathbf x _ { p } ^ { 1 } \\mathbf E ; \\mathbf x _ { p } ^ { 2 } \\mathbf E ; \\cdot \\cdot \\cdot \\cdot \\cdot \\cdot ; \\mathbf x _ { p } ^ { N } \\mathbf E ] + \\mathbf E _ { p o s } , } & & { \\mathbf E \\in \\mathbb R ^ { ( P ^ { 2 } \\cdot C ) \\times D } , \\mathbf E _ { p o s } \\in \\mathbb R ^ { ( N + 1 ) \\times D } } \\\\ & { \\mathbf z ^ { \\prime } _ { \\ell } = \\mathrm { M S A } ( \\mathrm { L N } ( \\mathbf z _ { \\ell - 1 } ) ) + \\mathbf z _ { \\ell - 1 } , } & & { \\ell = 1 \\dots L } \\\\ & { \\mathbf z _ { \\ell } = \\mathrm { M L P } ( \\mathrm { L N } ( \\mathbf z ^ { \\prime } _ { \\ell } ) ) + \\mathbf z ^ { \\prime } _ { \\ell } , } & & { \\ell = 1 \\dots L } \\\\ & { \\mathbf y = \\mathrm { L N } ( \\mathbf z _ { L } ^ { 0 } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 200, + 122, + 774, + 205 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Inductive bias. We note that Vision Transformer has much less image-specific inductive bias than CNNs. In CNNs, locality, two-dimensional neighborhood structure, and translation equivariance are baked into each layer throughout the whole model. In ViT, only MLP layers are local and translationally equivariant, while the self-attention layers are global. The two-dimensional neighborhood structure is used very sparingly: in the beginning of the model by cutting the image into patches and at fine-tuning time for adjusting the position embeddings for images of different resolution (as described below). Other than that, the position embeddings at initialization time carry no information about the 2D positions of the patches and all spatial relations between the patches have to be learned from scratch. ", + "bbox": [ + 173, + 215, + 825, + 340 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Hybrid Architecture. As an alternative to raw image patches, the input sequence can be formed from feature maps of a CNN (LeCun et al., 1989). In this hybrid model, the patch embedding projection $\\mathbf { E }$ (Eq. 1) is applied to patches extracted from a CNN feature map. As a special case, the patches can have spatial size 1x1, which means that the input sequence is obtained by simply flattening the spatial dimensions of the feature map and projecting to the Transformer dimension. The classification input embedding and position embeddings are added as described above. ", + "bbox": [ + 174, + 356, + 825, + 439 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 FINE-TUNING AND HIGHER RESOLUTION ", + "text_level": 1, + "bbox": [ + 178, + 455, + 501, + 469 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Typically, we pre-train ViT on large datasets, and fine-tune to (smaller) downstream tasks. For this, we remove the pre-trained prediction head and attach a zero-initialized $D \\times K$ feedforward layer, where $K$ is the number of downstream classes. It is often beneficial to fine-tune at higher resolution than pre-training (Touvron et al., 2019; Kolesnikov et al., 2020). When feeding images of higher resolution, we keep the patch size the same, which results in a larger effective sequence length. The Vision Transformer can handle arbitrary sequence lengths (up to memory constraints), however, the pre-trained position embeddings may no longer be meaningful. We therefore perform 2D interpolation of the pre-trained position embeddings, according to their location in the original image. Note that this resolution adjustment and patch extraction are the only points at which an inductive bias about the 2D structure of the images is manually injected into the Vision Transformer. ", + "bbox": [ + 174, + 482, + 825, + 621 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4 EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 641, + 326, + 656 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We evaluate the representation learning capabilities of ResNet, Vision Transformer (ViT), and the hybrid. To understand the data requirements of each model, we pre-train on datasets of varying size and evaluate many benchmark tasks. When considering the computational cost of pre-training the model, ViT performs very favourably, attaining state of the art on most recognition benchmarks at a lower pre-training cost. Lastly, we perform a small experiment using self-supervision, and show that self-supervised ViT holds promise for the future. ", + "bbox": [ + 174, + 671, + 825, + 756 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4.1 SETUP ", + "text_level": 1, + "bbox": [ + 174, + 772, + 261, + 786 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Datasets. To explore model scalability, we use the ILSVRC-2012 ImageNet dataset with 1k classes and 1.3M images (we refer to it as ImageNet in what follows), its superset ImageNet-21k with 21k classes and 14M images (Deng et al., 2009), and JFT (Sun et al., 2017) with $1 8 \\mathrm { k }$ classes and 303M high-resolution images. We de-duplicate the pre-training datasets w.r.t. the test sets of the downstream tasks following Kolesnikov et al. (2020). We transfer the models trained on these dataset to several benchmark tasks: ImageNet on the original validation labels and the cleaned-up ReaL labels (Beyer et al., 2020), CIFAR-10/100 (Krizhevsky, 2009), Oxford-IIIT Pets (Parkhi et al., 2012), and Oxford Flowers-102 (Nilsback & Zisserman, 2008). For these datasets, pre-processing follows Kolesnikov et al. (2020). ", + "bbox": [ + 174, + 797, + 825, + 924 + ], + "page_idx": 3 + }, + { + "type": "table", + "img_path": "images/a1391473c0ffe6f0deeb850c4ebf907f31b0213d1c64a9edb138821640d915a2.jpg", + "table_caption": [ + "Table 1: Details of Vision Transformer model variants. " + ], + "table_footnote": [], + "table_body": "
ModelLayersHidden size DMLP sizeHeadsParams
ViT-Base1276830721286M
ViT-Large241024409616307M
ViT-Huge321280512016632M
", + "bbox": [ + 276, + 101, + 722, + 167 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We also evaluate on the 19-task VTAB classification suite (Zhai et al., 2019b). VTAB evaluates low-data transfer to diverse tasks, using 1 000 training examples per task. The tasks are divided into three groups: Natural – tasks like the above, Pets, CIFAR, etc. Specialized – medical and satellite imagery, and Structured – tasks that require geometric understanding like localization. ", + "bbox": [ + 174, + 217, + 825, + 273 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Model Variants. We base ViT configurations on those used for BERT (Devlin et al., 2019), as summarized in Table 1. The “Base” and “Large” models are directly adopted from BERT and we add the larger “Huge” model. In what follows we use brief notation to indicate the model size and the input patch size: for instance, ViT-L/16 means the “Large” variant with $1 6 \\times 1 6$ input patch size. Note that the Transformer’s sequence length is inversely proportional to the square of the patch size, thus models with smaller patch size are computationally more expensive. ", + "bbox": [ + 174, + 280, + 825, + 363 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "For the baseline CNNs, we use ResNet (He et al., 2016), but replace the Batch Normalization layers (Ioffe & Szegedy, 2015) with Group Normalization (Wu & He, 2018), and used standardized convolutions (Qiao et al., 2019). These modifications improve transfer (Kolesnikov et al., 2020), and we denote the modified model “ResNet (BiT)”. For the hybrids, we feed the intermediate feature maps into ViT with patch size of one “pixel”. To experiment with different sequence lengths, we either (i) take the output of stage 4 of a regular ResNet50 or (ii) remove stage 4, place the same number of layers in stage 3 (keeping the total number of layers), and take the output of this extended stage 3. Option (ii) results in a $4 \\mathbf { x }$ longer sequence length, and a more expensive ViT model. ", + "bbox": [ + 174, + 369, + 825, + 482 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Training & Fine-tuning. We train all models, including ResNets, using Adam (Kingma & Ba, 2015) with $\\beta _ { 1 } = 0 . 9$ , $\\beta _ { 2 } = 0 . 9 9 9$ , a batch size of 4096 and apply a high weight decay of 0.1, which we found to be useful for transfer of all models (Appendix D.1 shows that, in contrast to common practices, Adam works slightly better than SGD for ResNets in our setting). We use a linear learning rate warmup and decay, see Appendix B.1 for details. For fine-tuning we use SGD with momentum, batch size 512, for all models, see Appendix B.1.1. For ImageNet results in Table 2, we fine-tuned at higher resolution: 512 for ViT-L/16 and 518 for ViT-H/14, and also used Polyak & Juditsky (1992) averaging with a factor of 0.9999 (Ramachandran et al., 2019; Wang et al., 2020b). ", + "bbox": [ + 174, + 488, + 825, + 599 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Metrics. We report results on downstream datasets either through few-shot or fine-tuning accuracy. Fine-tuning accuracies capture the performance of each model after fine-tuning it on the respective dataset. Few-shot accuracies are obtained by solving a regularized least-squares regression problem that maps the (frozen) representation of a subset of training images to $\\{ - 1 , 1 \\} ^ { K }$ target vectors. This formulation allows us to recover the exact solution in closed form. Though we mainly focus on fine-tuning performance, we sometimes use linear few-shot accuracies for fast on-the-fly evaluation where fine-tuning would be too costly. ", + "bbox": [ + 174, + 607, + 825, + 704 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.2 COMPARISON TO STATE OF THE ART ", + "text_level": 1, + "bbox": [ + 178, + 723, + 467, + 737 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We first compare our largest models – ViT-H/14 and ViT-L/16 – to state-of-the-art CNNs from the literature. The first comparison point is Big Transfer (BiT) (Kolesnikov et al., 2020), which performs supervised transfer learning with large ResNets. The second is Noisy Student (Xie et al., 2020), which is a large EfficientNet trained using semi-supervised learning on ImageNet and JFT300M with the labels removed. Currently, Noisy Student is the state of the art on ImageNet and BiT-L on the other datasets reported here. All models were trained on TPUv3 hardware, and we report the number of TPUv3-core-days taken to pre-train each of them, that is, the number of TPU v3 cores (2 per chip) used for training multiplied by the training time in days. ", + "bbox": [ + 174, + 750, + 825, + 861 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Table 2 shows the results. The smaller ViT-L/16 model pre-trained on JFT-300M outperforms BiT-L (which is pre-trained on the same dataset) on all tasks, while requiring substantially less computational resources to train. The larger model, ViT-H/14, further improves the performance, especially on the more challenging datasets – ImageNet, CIFAR-100, and the VTAB suite. Interestingly, this ", + "bbox": [ + 174, + 867, + 823, + 924 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/b53811a001ad490da72253bfd73058da145daff6c20cd2c1a438bc059797103e.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
Ours-JFT (ViT-H/14)Ours-JFT (ViT-L/16)Ours-I21k (ViT-L/16)BiT-L (ResNet152x4)Noisy Student (EfficientNet-L2)
ImageNet88.55 ± 0.0487.76±0.0385.30±0.0287.54±0.0288.4/88.5*
ImageNet ReaL90.72± 0.0590.54±0.0388.62 ±0.0590.5490.55
CIFAR-1099.50 ±0.0699.42 ± 0.0399.15±0.0399.37±0.061
CIFAR-10094.55 ± 0.0493.90± 0.0593.25± 0.0593.51± 0.081
Oxford-IIITPets97.56 ±0.0397.32 ± 0.1194.67 ± 0.1596.62± 0.23
Oxford Flowers-10299.68 ±0.0299.74± 0.0099.61±0.0299.63±0.03
VTAB (19 tasks)77.63 ±0.2376.28± 0.4672.72±0.2176.29 ± 1.701
TPUv3-core-days2.5k0.68k0.23k9.9k12.3k
", + "bbox": [ + 176, + 101, + 820, + 248 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Table 2: Comparison with state of the art on popular image classification benchmarks. We report mean and standard deviation of the accuracies, averaged over three fine-tuning runs. Vision Transformer models pre-trained on the JFT-300M dataset outperform ResNet-based baselines on all datasets, while taking substantially less computational resources to pre-train. ViT pre-trained on the smaller public ImageNet-21k dataset performs well too. ∗Slightly improved $8 8 . 5 \\%$ result reported in Touvron et al. (2020). ", + "bbox": [ + 173, + 258, + 825, + 343 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/6c927eeccc1a23999efc0ec6bd56e353478eda7b515a9f29be07ad08e7a02b2b.jpg", + "image_caption": [ + "Figure 2: Breakdown of VTAB performance in Natural, Specialized, and Structured task groups. " + ], + "image_footnote": [], + "bbox": [ + 184, + 359, + 810, + 470 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "model still took substantially less compute to pre-train than prior state of the art. However, we note that pre-training efficiency may be affected not only by the architecture choice, but also other parameters, such as training schedule, optimizer, weight decay, etc. We provide a controlled study of performance vs. compute for different architectures in Section 4.4. Finally, the ViT-L/16 model pre-trained on the public ImageNet-21k dataset performs well on most datasets too, while taking fewer resources to pre-train: it could be trained using a standard cloud TPUv3 with 8 cores in approximately 30 days. ", + "bbox": [ + 173, + 521, + 825, + 619 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Figure 2 decomposes the VTAB tasks into their respective groups, and compares to previous SOTA methods on this benchmark: BiT, VIVI – a ResNet co-trained on ImageNet and Youtube (Tschannen et al., 2020), and S4L – supervised plus semi-supervised learning on ImageNet (Zhai et al., 2019a). ViT-H/14 outperforms BiT- $\\mathrm { R } 1 5 2 \\mathrm { x } 4$ , and other methods, on the Natural and Structured tasks. On the Specialized the performance of the top two models is similar. ", + "bbox": [ + 173, + 626, + 825, + 695 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.3 PRE-TRAINING DATA REQUIREMENTS ", + "text_level": 1, + "bbox": [ + 176, + 713, + 477, + 727 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The Vision Transformer performs well when pre-trained on a large JFT-300M dataset. With fewer inductive biases for vision than ResNets, how crucial is the dataset size? We perform two series of experiments. ", + "bbox": [ + 176, + 739, + 823, + 781 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "First, we pre-train ViT models on datasets of increasing size: ImageNet, ImageNet-21k, and JFT300M. To boost the performance on the smaller datasets, we optimize three basic regularization parameters – weight decay, dropout, and label smoothing. Figure 3 shows the results after finetuning to ImageNet (results on other datasets are shown in Table 5)2. When pre-trained on the smallest dataset, ImageNet, ViT-Large models underperform compared to ViT-Base models, despite (moderate) regularization. With ImageNet-21k pre-training, their performances are similar. Only with JFT-300M, do we see the full benefit of larger models. Figure 3 also shows the performance region spanned by BiT models of different sizes. The BiT CNNs outperform ViT on ImageNet, but with the larger datasets, ViT overtakes. ", + "bbox": [ + 173, + 789, + 825, + 886 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/4a5e6cfb502b704bf83885d2ed1d7b6c999d3da766fdf675e6dd8403b6b7832c.jpg", + "image_caption": [ + "Figure 3: Transfer to ImageNet. While large ViT models perform worse than BiT ResNets (shaded area) when pre-trained on small datasets, they shine when pre-trained on larger datasets. Similarly, larger ViT variants overtake smaller ones as the dataset grows. " + ], + "image_footnote": [], + "bbox": [ + 178, + 104, + 475, + 263 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/ce004e94d63c07640c2be6262378e8ff5241f6ea6f6fbb3d57ba3f0de1fdae38.jpg", + "image_caption": [ + "Figure 4: Linear few-shot evaluation on ImageNet versus pre-training size. ResNets perform better with smaller pre-training datasets but plateau sooner than ViT, which performs better with larger pre-training. ViT-b is ViT-B with all hidden dimensions halved. " + ], + "image_footnote": [], + "bbox": [ + 504, + 107, + 800, + 263 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/1b271b3e67a07e8f88f0c2cb8b3447dabf063f4620fa2c1ef85ae23c023dc3ae.jpg", + "image_caption": [ + "Figure 5: Performance versus cost for different architectures: Vision Transformers, ResNets, and hybrids. Vision Transformers generally outperform ResNets with the same computational budget. Hybrids improve upon pure Transformers for smaller model sizes, but the gap vanishes for larger models. " + ], + "image_footnote": [], + "bbox": [ + 199, + 390, + 789, + 584 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 686, + 823, + 714 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Second, we train our models on random subsets of 9M, 30M, and 90M as well as the full JFT300M dataset. We do not perform additional regularization on the smaller subsets and use the same hyper-parameters for all settings. This way, we assess the intrinsic model properties, and not the effect of regularization. We do, however, use early-stopping, and report the best validation accuracy achieved during training. To save compute, we report few-shot linear accuracy instead of full finetuning accuracy. Figure 4 contains the results. Vision Transformers overfit more than ResNets with comparable computational cost on smaller datasets. For example, ViT-B/32 is slightly faster than ResNet50; it performs much worse on the 9M subset, but better on $9 0 \\mathbf { M } +$ subsets. The same is true for ResNet152x2 and ViT-L/16. This result reinforces the intuition that the convolutional inductive bias is useful for smaller datasets, but for larger ones, learning the relevant patterns directly from data is sufficient, even beneficial. ", + "bbox": [ + 173, + 722, + 825, + 875 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Overall, the few-shot results on ImageNet (Figure 4), as well as the low-data results on VTAB (Table 2) seem promising for very low-data transfer. Further analysis of few-shot properties of ViT is an exciting direction of future work. ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.4 SCALING STUDY ", + "text_level": 1, + "bbox": [ + 176, + 103, + 331, + 117 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We perform a controlled scaling study of different models by evaluating transfer performance from JFT-300M. In this setting data size does not bottleneck the models’ performances, and we assess performance versus pre-training cost of each model. The model set includes: 7 ResNets, R50x1, R50x2 R101x1, $\\mathbf { R } 1 5 2 \\mathbf { x } 1$ , $\\mathbf { R } 1 5 2 \\mathbf { x } 2$ , pre-trained for 7 epochs, plus $\\mathbf { R } 1 5 2 \\mathbf { x } 2$ and ${ \\mathrm { R } } 2 0 0 { \\mathrm { x } } 3 $ pre-trained for 14 epochs; 6 Vision Transformers, ViT-B/32, B/16, L/32, L/16, pre-trained for 7 epochs, plus L/16 and H/14 pre-trained for 14 epochs; and 5 hybrids, R50+ViT-B/32, B/16, L/32, L/16 pretrained for 7 epochs, plus ${ \\mathrm { R 5 0 + V i T - L } } / { 1 6 }$ pre-trained for 14 epochs (for hybrids, the number at the end of the model name stands not for the patch size, but for the total dowsampling ratio in the ResNet backbone). ", + "bbox": [ + 173, + 131, + 825, + 256 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Figure 5 contains the transfer performance versus total pre-training compute (see Appendix D.4 for details on computational costs). Detailed results per model are provided in Table 6 in the Appendix. A few patterns can be observed. First, Vision Transformers dominate ResNets on the performance/compute trade-off. ViT uses approximately $2 - 4 \\times$ less compute to attain the same performance (average over 5 datasets). Second, hybrids slightly outperform ViT at small computational budgets, but the difference vanishes for larger models. This result is somewhat surprising, since one might expect convolutional local feature processing to assist ViT at any size. Third, Vision Transformers appear not to saturate within the range tried, motivating future scaling efforts. ", + "bbox": [ + 174, + 262, + 825, + 373 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.5 INSPECTING VISION TRANSFORMER ", + "text_level": 1, + "bbox": [ + 178, + 392, + 465, + 406 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To begin to understand how the Vision Transformer processes image data, we analyze its internal representations. The first layer of the Vision Transformer linearly projects the flattened patches into a lower-dimensional space (Eq. 1). Figure 7 (left) shows the top principal components of the the learned embedding filters. The components resemble plausible basis functions for a low-dimensional representation of the fine structure within each patch. ", + "bbox": [ + 174, + 419, + 612, + 516 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "After the projection, a learned position embedding is added to the patch representations. Figure 7 (center) shows that the model learns to encode distance within the image in the similarity of position embeddings, i.e. closer patches tend to have more similar position embeddings. Further, the row-column structure appears; patches in the same row/column have similar embeddings. Finally, a sinusoidal structure is sometimes apparent for larger grids (Appendix D). That the position embeddings learn to represent 2D image topology explains why hand-crafted 2D-aware embedding variants do not yield improvements (Appendix D.3). ", + "bbox": [ + 174, + 523, + 612, + 662 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Self-attention allows ViT to integrate information across the entire image even in the lowest layers. We investigate to what degree the network makes use of this capability. Specifically, we compute the average distance in image space across which information is integrated, based on the attention weights (Figure 7, right). This “attention distance” is analogous to receptive field size in CNNs. ", + "bbox": [ + 174, + 670, + 612, + 752 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/8dee27d7e89907230fd6d9b026cd90df1ddb924cc14c12e386acd003ea707154.jpg", + "image_caption": [ + "Figure 6: Representative examples of attention from the output token to the input space. See Appendix D.6 for details. " + ], + "image_footnote": [], + "bbox": [ + 653, + 433, + 810, + 645 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We find that some heads attend to most of the image already in the lowest layers, showing that the ability to integrate information globally is indeed used by the model. Other attention heads have consistently small attention distances in the low layers. This highly localized attention is less pronounced in hybrid models that apply a ResNet before the Transformer (Figure 7, right), suggesting that it may serve a similar function as early convolutional layers in CNNs. Further, the attention distance increases with network depth. Globally, we find that the model attends to image regions that are semantically relevant for classification (Figure 6). ", + "bbox": [ + 174, + 752, + 825, + 849 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.6 SELF-SUPERVISION ", + "text_level": 1, + "bbox": [ + 176, + 868, + 348, + 882 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Transformers show impressive performance on NLP tasks. However, much of their success stems not only from their excellent scalability but also from large scale self-supervised pre-training (Devlin et al., 2019; Radford et al., 2018). We also perform a preliminary exploration on masked patch prediction for self-supervision, mimicking the masked language modeling task used in BERT. With self-supervised pre-training, our smaller ViT-B/16 model achieves $7 9 . 9 \\%$ accuracy on ImageNet, a significant improvement of $2 \\%$ to training from scratch, but still $4 \\%$ behind supervised pre-training. Appendix B.1.2 contains further details. We leave exploration of contrastive pre-training (Chen et al., 2020b; He et al., 2020; Bachman et al., 2019; Henaff et al., 2020) to future work. ´ ", + "bbox": [ + 174, + 895, + 823, + 924 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/ab9b49548b6e8534a25e7dd9129b1b3881a6beb806baa7a38621f272ca5219bf.jpg", + "image_caption": [ + "Figure 7: Left: Filters of the initial linear embedding of RGB values of ViT-L/32. Center: Similarity of position embeddings of ViT-L/32. Tiles show the cosine similarity between the position embedding of the patch with the indicated row and column and the position embeddings of all other patches. Right: Size of attended area by head and network depth. Each dot shows the mean attention distance across images for one of 16 heads at one layer. See Appendix D.6 for details. " + ], + "image_footnote": [], + "bbox": [ + 171, + 114, + 818, + 261 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 386, + 825, + 469 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "5 CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 489, + 318, + 505 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We have explored the direct application of Transformers to image recognition. Unlike prior works using self-attention in computer vision, we do not introduce image-specific inductive biases into the architecture apart from the initial patch extraction step. Instead, we interpret an image as a sequence of patches and process it by a standard Transformer encoder as used in NLP. This simple, yet scalable, strategy works surprisingly well when coupled with pre-training on large datasets. Thus, Vision Transformer matches or exceeds the state of the art on many image classification datasets, whilst being relatively cheap to pre-train. ", + "bbox": [ + 174, + 520, + 825, + 618 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "While these initial results are encouraging, many challenges remain. One is to apply ViT to other computer vision tasks, such as detection and segmentation. Our results, coupled with those in Carion et al. (2020), indicate the promise of this approach. Another challenge is to continue exploring selfsupervised pre-training methods. Our initial experiments show improvement from self-supervised pre-training, but there is still large gap between self-supervised and large-scale supervised pretraining. Finally, further scaling of ViT would likely lead to improved performance. ", + "bbox": [ + 174, + 625, + 825, + 708 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "ACKNOWLEDGEMENTS ", + "text_level": 1, + "bbox": [ + 176, + 729, + 366, + 743 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "The work was performed in Berlin, Zurich, and Amsterdam. We thank many colleagues at Google ¨ for their help, in particular Andreas Steiner for crucial help with the infrastructure and the opensource release of the code; Joan Puigcerver and Maxim Neumann for help with the large-scale training infrastructure; Dmitry Lepikhin, Aravindh Mahendran, Daniel Keysers, Mario Luciˇ c, Noam ´ Shazeer, and Colin Raffel for useful discussions. ", + "bbox": [ + 176, + 760, + 825, + 829 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 176, + 849, + 285, + 864 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Samira Abnar and Willem Zuidema. Quantifying attention flow in transformers. In ACL, 2020. ", + "bbox": [ + 174, + 872, + 795, + 887 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Philip Bachman, R Devon Hjelm, and William Buchwalter. Learning representations by maximizing mutual information across views. In NeurIPS, 2019. ", + "bbox": [ + 176, + 895, + 821, + 922 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Alexei Baevski and Michael Auli. Adaptive input representations for neural language modeling. In ICLR, 2019. ", + "bbox": [ + 171, + 103, + 825, + 132 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "I. Bello, B. Zoph, Q. Le, A. Vaswani, and J. Shlens. Attention augmented convolutional networks. In ICCV, 2019. ", + "bbox": [ + 173, + 141, + 823, + 171 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Lucas Beyer, Olivier J. Henaff, Alexander Kolesnikov, Xiaohua Zhai, and A ´ aron van den Oord. Are ¨ we done with imagenet? arXiv, 2020. ", + "bbox": [ + 171, + 180, + 823, + 209 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tom B Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. Language models are few-shot learners. arXiv, 2020. ", + "bbox": [ + 173, + 219, + 825, + 262 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Nicolas Carion, Francisco Massa, Gabriel Synnaeve, Nicolas Usunier, Alexander Kirillov, and Sergey Zagoruyko. End-to-end object detection with transformers. In ECCV, 2020. ", + "bbox": [ + 171, + 272, + 823, + 301 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Mark Chen, Alec Radford, Rewon Child, Jeff Wu, and Heewoo Jun. Generative pretraining from pixels. In ICML, 2020a. ", + "bbox": [ + 173, + 310, + 823, + 340 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey E. Hinton. A simple framework for contrastive learning of visual representations. In ICML, 2020b. ", + "bbox": [ + 174, + 349, + 823, + 378 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yen-Chun Chen, Linjie Li, Licheng Yu, Ahmed El Kholy, Faisal Ahmed, Zhe Gan, Yu Cheng, and Jingjing Liu. UNITER: UNiversal Image-TExt Representation Learning. In ECCV, 2020c. ", + "bbox": [ + 173, + 387, + 825, + 417 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Rewon Child, Scott Gray, Alec Radford, and Ilya Sutskever. Generating long sequences with sparse transformers. arXiv, 2019. ", + "bbox": [ + 171, + 426, + 823, + 455 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jean-Baptiste Cordonnier, Andreas Loukas, and Martin Jaggi. On the relationship between selfattention and convolutional layers. In ICLR, 2020. ", + "bbox": [ + 171, + 465, + 823, + 494 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "J. Deng, W. Dong, R. Socher, L. Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale hierarchical image database. In CVPR, 2009. ", + "bbox": [ + 171, + 503, + 823, + 534 + ], + "page_idx": 9 + }, + { + "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": [ + 169, + 542, + 823, + 573 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Josip Djolonga, Jessica Yung, Michael Tschannen, Rob Romijnders, Lucas Beyer, Alexander Kolesnikov, Joan Puigcerver, Matthias Minderer, Alexander D’Amour, Dan Moldovan, Sylvan Gelly, Neil Houlsby, Xiaohua Zhai, and Mario Lucic. On robustness and transferability of convolutional neural networks. arXiv, 2020. ", + "bbox": [ + 173, + 582, + 825, + 638 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In CVPR, 2016. ", + "bbox": [ + 174, + 648, + 821, + 678 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, and Ross Girshick. Momentum contrast for unsupervised visual representation learning. In CVPR, 2020. ", + "bbox": [ + 173, + 686, + 823, + 717 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jonathan Ho, Nal Kalchbrenner, Dirk Weissenborn, and Tim Salimans. Axial attention in multidimensional transformers. arXiv, 2019. ", + "bbox": [ + 171, + 726, + 823, + 756 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Han Hu, Jiayuan Gu, Zheng Zhang, Jifeng Dai, and Yichen Wei. Relation networks for object detection. In CVPR, 2018. ", + "bbox": [ + 169, + 765, + 825, + 794 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Han Hu, Zheng Zhang, Zhenda Xie, and Stephen Lin. Local relation networks for image recognition. In ICCV, 2019. ", + "bbox": [ + 171, + 803, + 823, + 833 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Zilong Huang, Xinggang Wang, Yunchao Wei, Lichao Huang, Humphrey Shi, Wenyu Liu, and Thomas S. Huang. Ccnet: Criss-cross attention for semantic segmentation. In ICCV, 2020. ", + "bbox": [ + 171, + 842, + 825, + 872 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Olivier J. Henaff, Aravind Srinivas, Jeffrey De Fauw, Ali Razavi, Carl Doersch, S. M. Ali Eslami,´ and Aaron van den Oord. Data-efficient image recognition with contrastive predictive coding. In ICML, 2020. ", + "bbox": [ + 174, + 881, + 825, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by reducing internal covariate shift. 2015. ", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In ICLR, 2015. ", + "bbox": [ + 173, + 141, + 813, + 157 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alexander Kolesnikov, Lucas Beyer, Xiaohua Zhai, Joan Puigcerver, Jessica Yung, Sylvain Gelly, and Neil Houlsby. Big transfer (BiT): General visual representation learning. In ECCV, 2020. ", + "bbox": [ + 171, + 165, + 823, + 195 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alex Krizhevsky. Learning multiple layers of features from tiny images. Technical report, 2009. ", + "bbox": [ + 171, + 204, + 807, + 219 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton. Imagenet classification with deep convolutional neural networks. In NIPS, 2012. ", + "bbox": [ + 171, + 228, + 823, + 257 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Y. LeCun, B. Boser, J. Denker, D. Henderson, R. Howard, W. Hubbard, and L. Jackel. Backpropagation applied to handwritten zip code recognition. Neural Computation, 1:541–551, 1989. ", + "bbox": [ + 171, + 266, + 823, + 296 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Dmitry Lepikhin, HyoukJoong Lee, Yuanzhong Xu, Dehao Chen, Orhan Firat, Yanping Huang, Maxim Krikun, Noam Shazeer, and Zhifeng Chen. Gshard: Scaling giant models with conditional computation and automatic sharding. arXiv, 2020. ", + "bbox": [ + 176, + 304, + 823, + 348 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Liunian Harold Li, Mark Yatskar, Da Yin, Cho-Jui Hsieh, and Kai-Wei Chang. VisualBERT: A Simple and Performant Baseline for Vision and Language. In Arxiv, 2019. ", + "bbox": [ + 176, + 356, + 821, + 386 + ], + "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. arXiv, 2020. ", + "bbox": [ + 173, + 395, + 825, + 438 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jiasen Lu, Dhruv Batra, Devi Parikh, and Stefan Lee. ViLBERT: Pretraining Task-Agnostic Visiolinguistic Representations for Vision-and-Language Tasks. In NeurIPS. 2019. ", + "bbox": [ + 171, + 446, + 820, + 477 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Dhruv Mahajan, Ross Girshick, Vignesh Ramanathan, Kaiming He, Manohar Paluri, Yixuan Li, Ashwin Bharambe, and Laurens van der Maaten. Exploring the limits of weakly supervised pretraining. In ECCV, 2018. ", + "bbox": [ + 173, + 484, + 825, + 529 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "M. Nilsback and A. Zisserman. Automated flower classification over a large number of classes. In ICVGIP, 2008. ", + "bbox": [ + 173, + 537, + 823, + 566 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Omkar M. Parkhi, Andrea Vedaldi, Andrew Zisserman, and C. V. Jawahar. Cats and dogs. In CVPR, 2012. ", + "bbox": [ + 173, + 575, + 825, + 604 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Niki Parmar, Ashish Vaswani, Jakob Uszkoreit, Lukasz Kaiser, Noam Shazeer, Alexander Ku, and Dustin Tran. Image transformer. In ICML, 2018. ", + "bbox": [ + 169, + 613, + 825, + 643 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "B. T. Polyak and A. B. Juditsky. Acceleration of stochastic approximation by averaging. SIAM Journal on Control and Optimization, 30(4):838–855, 1992. doi: 10.1137/0330046. URL https://doi.org/10.1137/0330046. ", + "bbox": [ + 176, + 651, + 823, + 695 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Siyuan Qiao, Huiyu Wang, Chenxi Liu, Wei Shen, and Alan Yuille. Weight standardization. arXiv preprint arXiv:1903.10520, 2019. ", + "bbox": [ + 169, + 704, + 825, + 733 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alec Radford, Karthik Narasimhan, Tim Salimans, and Ilya Sutskever. Improving language understanding with unsupervised learning. Technical Report, 2018. ", + "bbox": [ + 171, + 742, + 823, + 771 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alec Radford, Jeff Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. Language models are unsupervised multitask learners. Technical Report, 2019. ", + "bbox": [ + 171, + 780, + 823, + 809 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Prajit Ramachandran, Niki Parmar, Ashish Vaswani, Irwan Bello, Anselm Levskaya, and Jon Shlens. Stand-alone self-attention in vision models. In NeurIPS, 2019. ", + "bbox": [ + 171, + 819, + 823, + 848 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Chen Sun, Abhinav Shrivastava, Saurabh Singh, and Abhinav Gupta. Revisiting unreasonable effectiveness of data in deep learning era. In ICCV, 2017. ", + "bbox": [ + 174, + 857, + 821, + 886 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Chen Sun, Austin Myers, Carl Vondrick, Kevin Murphy, and Cordelia Schmid. Videobert: A joint model for video and language representation learning. In ICCV, 2019. ", + "bbox": [ + 176, + 895, + 820, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Hugo Touvron, Andrea Vedaldi, Matthijs Douze, and Herve Jegou. Fixing the train-test resolution discrepancy. In NeurIPS. 2019. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Hugo Touvron, Andrea Vedaldi, Matthijs Douze, and Herve Jegou. Fixing the train-test resolution discrepancy: Fixefficientnet. arXiv preprint arXiv:2003.08237, 2020. ", + "bbox": [ + 171, + 140, + 823, + 170 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Michael Tschannen, Josip Djolonga, Marvin Ritter, Aravindh Mahendran, Neil Houlsby, Sylvain Gelly, and Mario Lucic. Self-supervised learning of video-induced visual invariances. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), June 2020. ", + "bbox": [ + 173, + 179, + 825, + 234 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. In NIPS, 2017. ", + "bbox": [ + 173, + 244, + 820, + 272 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Huiyu Wang, Yukun Zhu, Bradley Green, Hartwig Adam, Alan Yuille, and Liang-Chieh Chen. Axial-deeplab: Stand-alone axial-attention for panoptic segmentation. In ECCV, 2020a. ", + "bbox": [ + 176, + 281, + 820, + 310 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Huiyu Wang, Yukun Zhu, Bradley Green, Hartwig Adam, Alan Yuille, and Liang-Chieh Chen. Axial-deeplab: Stand-alone axial-attention for panoptic segmentation. arXiv preprint arXiv:2003.07853, 2020b. ", + "bbox": [ + 173, + 319, + 825, + 362 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Qiang Wang, Bei Li, Tong Xiao, Jingbo Zhu, Changliang Li, Derek F. Wong, and Lidia S. Chao. Learning deep transformer models for machine translation. In ACL, 2019. ", + "bbox": [ + 173, + 371, + 821, + 400 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaiming He. Non-local neural networks. In CVPR, 2018. ", + "bbox": [ + 174, + 409, + 823, + 438 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Dirk Weissenborn, Oscar Tackstr ¨ om, and Jakob Uszkoreit. Scaling autoregressive video models. In ¨ ICLR, 2019. ", + "bbox": [ + 174, + 446, + 825, + 476 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Bichen Wu, Chenfeng Xu, Xiaoliang Dai, Alvin Wan, Peizhao Zhang, Masayoshi Tomizuka, Kurt Keutzer, and Peter Vajda. Visual transformers: Token-based image representation and processing for computer vision. arxiv, 2020. ", + "bbox": [ + 174, + 484, + 825, + 527 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yuxin Wu and Kaiming He. Group normalization. In ECCV, 2018. ", + "bbox": [ + 174, + 535, + 614, + 551 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Qizhe Xie, Minh-Thang Luong, Eduard Hovy, and Quoc V. Le. Self-training with noisy student improves imagenet classification. In CVPR, 2020. ", + "bbox": [ + 174, + 560, + 823, + 589 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Xiaohua Zhai, Avital Oliver, Alexander Kolesnikov, and Lucas Beyer. $\\mathrm { S ^ { 4 } L }$ : Self-Supervised SemiSupervised Learning. In ICCV, 2019a. ", + "bbox": [ + 173, + 598, + 823, + 627 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Xiaohua Zhai, Joan Puigcerver, Alexander Kolesnikov, Pierre Ruyssen, Carlos Riquelme, Mario Lucic, Josip Djolonga, Andre Susano Pinto, Maxim Neumann, Alexey Dosovitskiy, et al. A large-scale study of representation learning with the visual task adaptation benchmark. arXiv preprint arXiv:1910.04867, 2019b. ", + "bbox": [ + 174, + 635, + 825, + 691 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Hengshuang Zhao, Jiaya Jia, and Vladlen Koltun. Exploring self-attention for image recognition. In CVPR, 2020. ", + "bbox": [ + 173, + 700, + 823, + 729 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/7d941b1605bd3ff833d6ed38469200b2395418acd3d72e69d195f8e3da038595.jpg", + "table_caption": [ + "Table 3: Hyperparameters for training. All models are trained with a batch size of 4096 and learning rate warmup of $1 0 \\mathrm { k }$ steps. For ImageNet we found it beneficial to additionally apply gradient clipping at global norm 1. Training resolution is 224. " + ], + "table_footnote": [], + "table_body": "
ModelsDatasetEpochsBase LRLR decayWeight decayDropout
ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
ViT-L/32JFT-300M76.10-4linear0.10.0
ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-H/14JFT-300M143.10-4linear0.10.0
R50x{1,2}JFT-300M710-3linear0.10.0
R101x1JFT-300M78.10-4linear0.10.0
R152x{1,2}JFT-300M76·10-4linear0.10.0
R50+ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
R50+ViT-L/32JFT-300M72.10-4linear0.10.0
R50+ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-B/{16,32}ImageNet-21k9010-3linear0.030.1
ViT-L/{16,32}ImageNet-21k30/9010-3linear0.030.1
ViT-*ImageNet3003.10-3cosine0.30.1
", + "bbox": [ + 184, + 101, + 813, + 304 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "APPENDIX ", + "text_level": 1, + "bbox": [ + 176, + 381, + 263, + 396 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A MULTIHEAD SELF-ATTENTION ", + "text_level": 1, + "bbox": [ + 178, + 414, + 464, + 430 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Standard qkv self-attention (SA, Vaswani et al. (2017)) is a popular building block for neural architectures. For each element in an input sequence $\\mathbf { z } \\in \\mathbb { R } ^ { N \\times \\dot { D } }$ , we compute a weighted sum over all values $\\mathbf { v }$ in the sequence. The attention weights $A _ { i j }$ are based on the pairwise similarity between two elements of the sequence and their respective query $\\mathbf { q } ^ { i }$ and key $\\mathbf { k } ^ { j }$ representations. ", + "bbox": [ + 176, + 445, + 823, + 503 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/1da1f364d75fdfc4a8f5dbae777361f9d6c874270178d305465c32e42f72c300.jpg", + "text": "$$\n\\begin{array} { r l } { [ \\mathbf { q } , \\mathbf { k } , \\mathbf { v } ] = \\mathbf { z } \\mathbf { U } _ { q k v } \\qquad } & { \\mathbf { U } _ { q k v } \\in \\mathbb { R } ^ { D \\times 3 D _ { h } } , } \\\\ { A = \\mathrm { s o f t m a x } \\left( \\mathbf { q } \\mathbf { k } ^ { \\top } / \\sqrt { D _ { h } } \\right) \\qquad } & { A \\in \\mathbb { R } ^ { N \\times N } , } \\\\ { \\mathrm { S A } ( \\mathbf { z } ) = A \\mathbf { v } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 269, + 508, + 728, + 575 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Multihead self-attention (MSA) is an extension of SA in which we run $k$ self-attention operations, called “heads”, in parallel, and project their concatenated outputs. To keep compute and number of parameters constant when changing $k$ , $D _ { h }$ (Eq. 5) is typically set to $D / k$ . ", + "bbox": [ + 176, + 587, + 825, + 631 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/260cab54c85b72b432d8f2ec7d038f6b09a5e36c13371e0600bf52c1aab642ee.jpg", + "text": "$$\n\\begin{array} { r } { \\mathrm { M S A } ( \\mathbf { z } ) = [ \\mathrm { S A } _ { 1 } ( z ) ; \\mathrm { S A } _ { 2 } ( z ) ; \\cdots \\ ; \\mathrm { S A } _ { k } ( z ) ] \\mathbf { U } _ { m s a } \\qquad \\quad \\mathbf { U } _ { m s a } \\in \\mathbb { R } ^ { k \\cdot D _ { h } \\times D } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 238, + 636, + 758, + 655 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "B EXPERIMENT DETAILS ", + "text_level": 1, + "bbox": [ + 174, + 672, + 397, + 689 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "B.1 TRAINING ", + "text_level": 1, + "bbox": [ + 174, + 704, + 290, + 719 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 3 summarizes our training setups for our different models. We found strong regularization to be key when training models from scratch on ImageNet. Dropout, when used, is applied after every dense layer except for the the qkv-projections and directly after adding positional- to patch embeddings. Hybrid models are trained with the exact setup as their ViT counterparts. Finally, all training is done on resolution 224. ", + "bbox": [ + 173, + 731, + 825, + 801 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "B.1.1 FINE-TUNING ", + "text_level": 1, + "bbox": [ + 176, + 815, + 326, + 830 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We fine-tune all ViT models using SGD with a momentum of 0.9. We run a small grid search over learning rates, see learning rate ranges in Table 4. To do so, we use small sub-splits from the training set ( $10 \\%$ for Pets and Flowers, $2 \\%$ for CIFAR, $1 \\%$ ImageNet) as development set and train on the remaining data. For final results we train on the entire training set and evaluate on the respective test data. For fine-tuning ResNets and hybrid models we use the exact same setup, with the only exception of ImageNet where we add another value 0.06 to the learning rate sweep. Additionally, ", + "bbox": [ + 174, + 839, + 825, + 924 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/539d3396c473a3f1c36b0b514c86cc27c72c1e8f24f1be19f653d4373d937dad.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
DatasetStepsBase LR
ImageNet20000{0.003,0.01,0.03, 0.06}
CIFAR10010000{0.001,0.003,0.01,0.03}
CIFAR1010000{0.001,0.003,0.01, 0.03}
Oxford-IIITPets500{0.001,0.003,0.01,0.03}
Oxford Flowers-102500{0.001, 0.003,0.01, 0.03}
VTAB (19 tasks)25000.01
", + "bbox": [ + 312, + 101, + 686, + 205 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Table 4: Hyperparameters for fine-tuning. All models are fine-tuned with cosine learning rate decay, a batch size of 512, no weight decay, and grad clipping at global norm 1. If not mentioned otherwise, fine-tuning resolution is 384. ", + "bbox": [ + 174, + 215, + 823, + 257 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "for ResNets we also run the setup of Kolesnikov et al. (2020) and select the best results across this run and our sweep. Finally, if not mentioned otherwise, all fine-tuning experiments run at 384 resolution (running fine-tuning at different resolution than training is common practice (Kolesnikov et al., 2020)). ", + "bbox": [ + 174, + 287, + 825, + 343 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "When transferring ViT models to another dataset, we remove the whole head (two linear layers) and replace it by a single, zero-initialized linear layer outputting the number of classes required by the target dataset. We found this to be a little more robust than simply re-initializing the very last layer. ", + "bbox": [ + 176, + 351, + 821, + 392 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For VTAB we follow the protocol in Kolesnikov et al. (2020), and use the same hyperparameter setting for all tasks. We use a learning rate of 0.01 and train for 2500 steps (Tab. 4). We chose this setting by running a small sweep over two learning rates and two schedules, and selecting the setting with the highest VTAB score on the 200-example validation sets. We follow the pre-processing used in Kolesnikov et al. (2020), except that we do not use task-specific input resolutions. Instead we find that Vision Transformer benefits most from a high resolution $( 3 8 4 \\times 3 8 4 )$ for all tasks. ", + "bbox": [ + 174, + 400, + 825, + 483 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "B.1.2 SELF-SUPERVISION", + "text_level": 1, + "bbox": [ + 176, + 503, + 364, + 517 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We employ the masked patch prediction objective for preliminary self-supervision experiments. To do so we corrupt $50 \\%$ of patch embeddings by either replacing their embeddings with a learnable [mask] embedding $( 8 0 \\% )$ , a random other patch embedding $( 1 0 \\% )$ or just keeping them as is $( 1 0 \\% )$ . This setup is very similar to the one used for language by Devlin et al. (2019). Finally, we predict the 3-bit, mean color (i.e., 512 colors in total) of every corrupted patch using their respective patch representations. ", + "bbox": [ + 174, + 529, + 825, + 613 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We trained our self-supervised model for 1M steps (ca. 14 epochs) with batch size 4096 on JFT. We use Adam, with a base learning rate of $2 \\cdot 1 0 ^ { - 4 }$ , warmup of $1 0 \\mathrm { k }$ steps and cosine learning rate decay. As prediction targets for pretraining we tried the following settings: 1) predicting only the mean, 3bit color (i.e., 1 prediction of 512 colors), 2) predicting a $4 \\times 4$ downsized version of the $1 6 \\times 1 6$ patch with 3bit colors in parallel (i.e., 16 predictions of 512 colors), 3) regression on the full patch using L2 (i.e., 256 regressions on the 3 RGB channels). Surprisingly, we found that all worked quite well, though L2 was slightly worse. We report final results only for option 1) because it has shown best few-shot performance. We also experimented with $15 \\%$ corruption rate as used by Devlin et al. (2019) but results were also slightly worse on our few-shot metrics. ", + "bbox": [ + 174, + 619, + 825, + 744 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lastly, we would like to remark that our instantiation of masked patch prediction doesn’t require such an enormous amount of pretraining nor a large dataset such as JFT in order to lead to similar performance gains on ImageNet classification. That is, we observed diminishing returns on downstream performance after $1 0 0 \\mathrm { k }$ pretraining steps, and see similar gains when pretraining on ImageNet. ", + "bbox": [ + 174, + 752, + 823, + 821 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "C ADDITIONAL RESULTS ", + "text_level": 1, + "bbox": [ + 174, + 847, + 398, + 863 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We report detailed results corresponding to the figures presented in the paper. Table 5 corresponds to Figure 3 from the paper and shows transfer performance of different ViT models pre-trained on datasets of increasing size: ImageNet, ImageNet-21k, and JFT-300M. Table 6 corresponds to ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/ab3d26a8a4e72ec0d96ea954cfce7ae1eb4bd7f7a26ec84824f229550efbbf31.jpg", + "table_caption": [ + "Table 5: Top1 accuracy (in $\\%$ ) of Vision Transformer on various datasets when pre-trained on ImageNet, ImageNet-21k or JFT300M. These values correspond to Figure 3 in the main text. Models are fine-tuned at 384 resolution. Note that the ImageNet results are computed without additional techniques (Polyak averaging and 512 resolution images) used to achieve results in Table 2. " + ], + "table_footnote": [], + "table_body": "
ViT-B/16ViT-B/32ViT-L/16ViT-L/32ViT-H/14
ImageNetCIFAR-1098.1397.7797.8697.94
CIFAR-10087.1386.3186.3587.07
ImageNet77.9173.3876.5371.16
ImageNet ReaL83.5779.5682.1977.83
Oxford Flowers-10289.4985.4389.6686.36
Oxford-IIIT-Pets93.8192.0493.6491.35■
ImageNet-21kCIFAR-1098.9598.7999.1699.1399.27
CIFAR-10091.6791.9793.4493.0493.82
ImageNet83.9781.2885.1580.9985.13
ImageNet ReaL88.3586.6388.4085.6588.70
Oxford Flowers-102 Oxford-IIIT-Pets99.3899.1199.6199.1999.51
94.4393.0294.7393.0994.82
JFT-300MCIFAR-1099.0098.6199.3899.1999.50
CIFAR-10091.8790.4994.0492.5294.55
ImageNet84.1580.7387.1284.3788.04
ImageNet ReaL88.8586.2789.9988.2890.33
Oxford Flowers-10299.5699.2799.5699.4599.68
Oxford-IIIT-Pets95.8093.4097.1195.8397.56
", + "bbox": [ + 178, + 101, + 825, + 382 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/134baea4a353f3499e076c9e408c6a26c3d680f1bc59a3bc262c55357306a1ee.jpg", + "table_caption": [], + "table_footnote": [ + "Table 6: Detailed results of model scaling experiments. These correspond to Figure 5 in the main paper. " + ], + "table_body": "
ModelEpochsImageNetImageNet ReaLCIFAR-10CIFAR-100PetsFlowersexaFLOPs
ViT-B/32780.7386.2798.6190.4993.4099.27164
ViT-B/16784.1588.8599.0091.8795.8099.56743
ViT-L/32784.3788.2899.1992.5295.8399.45574
ViT-L/16786.3089.4399.3893.4696.8199.662586
ViT-L/161487.1289.9999.3894.0497.1199.565172
ViT-H/141488.0890.3699.5094.7197.1199.7112826
ResNet50x1777.5484.5697.6786.0791.1194.26150
ResNet50x2782.1287.9498.2989.2093.4397.02592
ResNet101x1780.6787.0798.4889.1794.0895.95285
ResNet152x1781.8887.9698.8290.2294.1796.94427
ResNet152x2784.9789.6999.0692.0595.3798.621681
ResNet152x21485.5689.8999.2491.9295.7598.753362
ResNet200x31487.2290.1599.3493.5396.3299.0410212
R50x1+ViT-B/32784.9089.1599.0192.2495.7599.46315
R50x1+ViT-B/16785.5889.6599.1492.6396.6599.40855
R50x1+ViT-L/32785.6889.0499.2492.9396.9799.43725
R50x1+ViT-L/16786.6089.7299.1893.6497.0399.402704
R50x1+ViT-L/161487.1289.7699.3193.8997.3699.115165
", + "bbox": [ + 174, + 462, + 823, + 694 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Figure 5 from the paper and shows the transfer performance of ViT, ResNet, and hybrid models of varying size, as well as the estimated computational cost of their pre-training. ", + "bbox": [ + 176, + 760, + 823, + 789 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "D ADDITIONAL ANALYSES ", + "text_level": 1, + "bbox": [ + 176, + 810, + 415, + 825 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "D.1 SGD VS. ADAM FOR RESNETS ", + "text_level": 1, + "bbox": [ + 176, + 840, + 433, + 856 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "ResNets are typically trained with SGD and our use of Adam as optimizer is quite unconventional. Here we show the experiments that motivated this choice. Namely, we compare the fine-tuning performance of two ResNets – 50x1 and $1 5 2 \\mathrm { x } 2 $ – pre-trained on JFT with SGD and Adam. For SGD, we use the hyperparameters recommended by Kolesnikov et al. (2020). Results are presented in Table 7. Adam pre-training outperforms SGD pre-training on most datasets and on average. This justifies the choice of Adam as the optimizer used to pre-train ResNets on JFT. Note that the absolute numbers are lower than those reported by Kolesnikov et al. (2020), since we pre-train only for 7 epochs, not 30. ", + "bbox": [ + 176, + 867, + 825, + 924 + ], + "page_idx": 14 + }, + { + "type": "table", + "img_path": "images/8f4739d4a918cdaacfc06290ad5d13b7721fadc74eb53be9c6959bb125449f02.jpg", + "table_caption": [ + "Table 7: Fine-tuning ResNet models pre-trained with Adam and SGD. " + ], + "table_footnote": [], + "table_body": "
ResNet50ResNet152x2
DatasetAdamSGDAdamSGD
ImageNet77.5478.2484.9784.37
CIFAR1097.6797.4699.0699.07
CIFAR10086.0785.1792.0591.06
Oxford-IIITPets91.1191.0095.3794.79
Oxford Flowers-10294.2692.0698.6299.32
Average89.3388.7994.0193.72
", + "bbox": [ + 318, + 101, + 679, + 218 + ], + "page_idx": 15 + }, + { + "type": "image", + "img_path": "images/087590a6ace2243bc302d256c0334466601d635e411a4191b5cb851d0b812782.jpg", + "image_caption": [ + "Figure 8: Scaling different model dimensions of the Vision Transformer. " + ], + "image_footnote": [], + "bbox": [ + 176, + 261, + 795, + 419 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 481, + 825, + 537 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "D.2 TRANSFORMER SHAPE ", + "text_level": 1, + "bbox": [ + 176, + 556, + 375, + 570 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We ran ablations on scaling different dimensions of the Transformer architecture to find out which are best suited for scaling to very large models. Figure 8 shows 5-shot performance on ImageNet for different configurations. All configurations are based on a ViT model with 8 layers, $D = 1 0 2 4$ , $D _ { M L P } = 2 0 4 8$ and a patch size of 32, the intersection of all lines. We can see that scaling the depth results in the biggest improvements which are clearly visible up until 64 layers. However, diminishing returns are already visible after 16 layers. Interestingly, scaling the width of the network seems to result in the smallest changes. Decreasing the patch size and thus increasing the effective sequence length shows surprisingly robust improvements without introducing parameters. These findings suggest that compute might be a better predictor of performance than the number of parameters, and that scaling should emphasize depth over width if any. Overall, we find that scaling all dimensions proportionally results in robust improvements. ", + "bbox": [ + 174, + 584, + 825, + 737 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "D.3 POSITIONAL EMBEDDING ", + "text_level": 1, + "bbox": [ + 176, + 756, + 397, + 771 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "We ran ablations on different ways of encoding spatial information using positional embedding. We tried the following cases: ", + "bbox": [ + 174, + 784, + 825, + 813 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "• Providing no positional information: Considering the inputs as a bag of patches. • 1-dimensional positional embedding: Considering the inputs as a sequence of patches in the raster order (default across all other experiments in this paper). • 2-dimensional positional embedding: Considering the inputs as a grid of patches in two dimensions. In this case, two sets of embeddings are learned, each for one of the axes, $X$ -embedding, and $Y$ -embedding, each with size $D / 2$ . Then, based on the coordinate on the path in the input, we concatenate the $X$ and $Y$ embedding to get the final positional embedding for that patch. ", + "bbox": [ + 217, + 824, + 825, + 924 + ], + "page_idx": 15 + }, + { + "type": "table", + "img_path": "images/c4b8fe05634aa384e4650368bb77e1abe1937e5aeb116fec360a01557385eb32.jpg", + "table_caption": [ + "Table 8: Results of the ablation study on positional embeddings with ViT-B/16 model evaluated on ImageNet 5-shot linear. " + ], + "table_footnote": [], + "table_body": "
Pos. Emb.Default/StemEvery LayerEvery Layer-Shared
No Pos. Emb.0.61382N/AN/A
1-D Pos. Emb.0.642060.639640.64292
2-D Pos. Emb.0.640010.640460.64022
Rel. Pos.Emb.0.64032N/AN/A
", + "bbox": [ + 258, + 101, + 740, + 186 + ], + "page_idx": 16 + }, + { + "type": "image", + "img_path": "images/f17a7ad1c8d7369bd3a83cfd6f7a7e661a00f552506b476bfe155394c93fb3d0.jpg", + "image_caption": [ + "Figure 9: Position embeddings of models trained with different hyperparameters. " + ], + "image_footnote": [], + "bbox": [ + 176, + 253, + 823, + 417 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "", + "bbox": [ + 230, + 488, + 823, + 517 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "• Relative positional embeddings: Considering the relative distance between patches to encode the spatial information as instead of their absolute position. To do so, we use 1- dimensional Relative Attention, in which we define the relative distance all possible pairs of patches. Thus, for every given pair (one as query, and the other as key/value in the attention mechanism), we have an offset $p _ { q } - p _ { k }$ , where each offset is associated with an embedding. Then, we simply run extra attention, where we use the original query (the content of query), but use relative positional embeddings as keys. We then use the logits from the relative attention as a bias term and add it to the logits of the main attention (content-based attention) before applying the softmax. ", + "bbox": [ + 218, + 535, + 825, + 661 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "In addition to different ways of encoding spatial information, we also tried different ways of incorporating this information in our model. For the 1-dimensional and 2-dimensional positional embeddings, we tried three different cases: (1) add positional embeddings to the inputs right after the stem of them model and before feeding the inputs to the Transformer encoder (default across all other experiments in this paper); (2) learn and add positional embeddings to the inputs at the beginning of each layer; (3) add a learned positional embeddings to the inputs at the beginning of each layer (shared between layers). ", + "bbox": [ + 173, + 680, + 825, + 777 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Table 8 summarizes the results from this ablation study on a ViT-B/16 model. As we can see, while there is a large gap between the performances of the model with no positional embedding and models with positional embedding, there is little to no difference between different ways of encoding positional information. We speculate that since our Transformer encoder operates on patch-level inputs, as opposed to pixel-level, the differences in how to encode spatial information is less important. More precisely, in patch-level inputs, the spatial dimensions are much smaller than the original pixel-level inputs, e.g., $1 4 \\times 1 4$ as opposed to $2 2 4 \\times 2 2 4$ , and learning to represent the spatial relations in this resolution is equally easy for these different positional encoding strategies. Even so, the specific pattern of position embedding similarity learned by the network depends on the training hyperparameters (Figure 9). ", + "bbox": [ + 174, + 785, + 825, + 924 + ], + "page_idx": 16 + }, + { + "type": "image", + "img_path": "images/5ed38ba4f1b7ab9d93edbca4579d27ee5df39ca42cb87a60b78985f34a6716ae.jpg", + "image_caption": [ + "Figure 10: Size of attended area by head and network depth. Attention distance was computed for 128 example images by averaging the distance between the query pixel and all other pixels, weighted by the attention weight. Each dot shows the mean attention distance across images for one of 16 heads at one layer. Image width is 224 pixels. " + ], + "image_footnote": [], + "bbox": [ + 228, + 103, + 764, + 325 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "D.4 EMPIRICAL COMPUTATIONAL COSTS ", + "text_level": 1, + "bbox": [ + 178, + 434, + 473, + 448 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "We are also interested in real-world speed of the architectures on our hardware, which is not always well predicted by theoretical FLOPs due to details like lane widths and cache sizes. For this purpose, we perform timing of inference speed for the main models of interest, on a TPUv3 accelerator; the difference between inference and backprop speed is a constant model-independent factor. ", + "bbox": [ + 174, + 460, + 825, + 516 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Figure 11 (left) shows how many images one core can handle per second, across various input sizes. Every single point refers to the peak performance measured across a wide range of batch-sizes. As can be seen, the theoretical bi-quadratic scaling of ViT with image size only barely starts happening for the largest models at the largest resolutions. ", + "bbox": [ + 174, + 523, + 825, + 579 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Another quantity of interest is the largest batch-size each model can fit onto a core, larger being better for scaling to large datasets. Figure 11 (right) shows this quantity for the same set of models. This shows that large ViT models have a clear advantage in terms of memory-efficiency over ResNet models. ", + "bbox": [ + 176, + 587, + 825, + 642 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "D.5 AXIAL ATTENTION ", + "text_level": 1, + "bbox": [ + 176, + 660, + 351, + 674 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Axial Attention (Huang et al., 2020; Ho et al., 2019) is a simple, yet effective technique to run selfattention on large inputs that are organized as multidimensional tensors. The general idea of axial attention is to perform multiple attention operations, each along a single axis of the input tensor, instead of applying 1-dimensional attention to the flattened version of the input. In axial attention, each attention mixes information along a particular axis, while keeping information along the other axes independent. Along this line, Wang et al. (2020b) proposed the AxialResNet model in which all the convolutions with kernel size $3 \\times 3$ in a ResNet50 are replaced by axial self-attention, i.e. a row and column attention, augmented by relative positional encoding. We have implemented AxialResNet as a baseline model.3. ", + "bbox": [ + 174, + 686, + 825, + 813 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Moreover, we have modified ViT to process inputs in the 2-dimensional shape, instead of a 1- dimensional sequence of patches, and incorporate Axial Transformer blocks, in which instead of a self-attention followed by an MLP, we have a a row-self-attention plus an MLP followed by a column-self-attention plus an MLP. ", + "bbox": [ + 176, + 819, + 823, + 847 + ], + "page_idx": 17 + }, + { + "type": "image", + "img_path": "images/d008d21d372389ac2c877fbe8ea659a89fabdc092dd9047ef2ebdf27c3aa6aeb.jpg", + "image_caption": [ + "Figure 11: Left: Real wall-clock timings of various architectures across input sizes. ViT models have speed comparable to similar ResNets. Right: Largest per-core batch-size fitting on device with various architectures across input sizes. ViT models are clearly more memory-efficient. " + ], + "image_footnote": [], + "bbox": [ + 202, + 111, + 792, + 304 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 395, + 823, + 424 + ], + "page_idx": 18 + }, + { + "type": "image", + "img_path": "images/1fed46da5b7a53532096674323e26d44ee931247b2ce97baead29e2301c60f89.jpg", + "image_caption": [ + "Figure 12: Performance of Axial-Attention based models, in terms of top-1 accuracy on ImageNet 5-shot linear, versus their speed in terms of number of FLOPs (left) and inference time (left). " + ], + "image_footnote": [], + "bbox": [ + 196, + 439, + 800, + 633 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Figure 12, present the performance of Axial ResNet, Axial-ViT-B/32 and Axial-ViT-B/16 on ImageNet 5shot linear, when pretrained on JFT dataset, verses the pretraining compute, both in terms of number of FLOPs and inference time (example per seconds). As we can see, both Axial-ViT-B/32 and Axial-ViT-B/16 do better than their ViT-B counterpart in terms of performance, but it comes at the cost of more compute. This is because in Axial-ViT models, each Transformer block with global self-attention is replaced by two Axial Transformer blocks, one with row and one with column selfattention and although the sequence length that self-attention operates on is smaller in axial case, there is a extra MLP per Axial-ViT block. For the AxialResNet, although it looks reasonable in terms of accuracy/compute trade-off (Figure 12, left), the naive implementation is extremely slow on TPUs (Figure 12, right). ", + "bbox": [ + 173, + 699, + 825, + 838 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "D.6 ATTENTION DISTANCE ", + "text_level": 1, + "bbox": [ + 176, + 856, + 377, + 869 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "To understand how ViT uses self-attention to integrate information across the image, we analyzed the average distance spanned by attention weights at different layers (Figure 10). This “attention distance” is analogous to receptive field size in CNNs. Average attention distance is highly variable ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "across heads in lower layers, with some heads attending to much of the image, while others attend to small regions at or near the query location. As depth increases, attention distance increases for all heads. In the second half of the network, most heads attend widely across tokens. ", + "bbox": [ + 176, + 103, + 823, + 146 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "D.7 ATTENTION MAPS ", + "text_level": 1, + "bbox": [ + 174, + 162, + 346, + 176 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "To compute maps of the attention from the output token to the input space (Figures 6 and 13), we used Attention Rollout (Abnar & Zuidema, 2020). Briefly, we averaged attention weights of ViT$\\mathrm { L } / 1 6$ across all heads and then recursively multiplied the weight matrices of all layers. This accounts for the mixing of attention across tokens through all layers. ", + "bbox": [ + 174, + 189, + 825, + 244 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "D.8 VTAB BREAKDOWN ", + "text_level": 1, + "bbox": [ + 174, + 261, + 362, + 276 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Table 9 shows the scores attained on each of the VTAB-1k tasks. ", + "bbox": [ + 174, + 287, + 598, + 303 + ], + "page_idx": 19 + }, + { + "type": "table", + "img_path": "images/c8e2b5fa9d9ae62df590c80f9b71ae0a6542b8ed42631bb7d81109715ac04d0a.jpg", + "table_caption": [ + "Table 9: Breakdown of VTAB-1k performance across tasks. " + ], + "table_footnote": [], + "table_body": "
0oreeeaerCIIPIP0 :DEI ·irmsiIs1ed660unsNHASeeaaemButoS55sr515GrrrogarCerrrelrr CTr-stq NTapop-dPuo-Idsp·JTI-ITTTTSIIH-SRARSSH-PRPPEE7aam
ViT-H/14 (JFT)95.385.575.299.797.265.088.983.396.791.476.691.763.853.179.463.384.533.251.277.6
ViT-L/16 (JFT)95.481.974.399.796.763.587.483.696.589.777.186.463.149.774.560.582.236.251.176.3
ViT-L/16 (I21k)90.884.174.199.392.761.080.982.595.685.275.370.356.141.974.764.979.930.541.772.7
", + "bbox": [ + 173, + 340, + 823, + 446 + ], + "page_idx": 19 + }, + { + "type": "image", + "img_path": "images/12d3ed42eccf501384439819f02277513ab0a56bd02b7d4b37a2542cffac7ee9.jpg", + "image_caption": [ + "Figure 13: Further example attention maps as in Figure 6 (random selection). " + ], + "image_footnote": [], + "bbox": [ + 183, + 170, + 813, + 825 + ], + "page_idx": 20 + } +] \ No newline at end of file diff --git a/parse/train/YicbFdNTTy/YicbFdNTTy_middle.json b/parse/train/YicbFdNTTy/YicbFdNTTy_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..403348ac75abc5107eea3d5c23d11af2207e2b96 --- /dev/null +++ b/parse/train/YicbFdNTTy/YicbFdNTTy_middle.json @@ -0,0 +1,45377 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 109, + 78, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 77, + 387, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 77, + 387, + 97 + ], + "score": 1.0, + "content": "AN IMAGE IS WORTH 16X16 WORDS:", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 99, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 107, + 99, + 505, + 117 + ], + "score": 1.0, + "content": "TRANSFORMERS FOR IMAGE RECOGNITION AT SCALE", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 140, + 135, + 489, + 173 + ], + "lines": [ + { + "bbox": [ + 140, + 135, + 489, + 148 + ], + "spans": [ + { + "bbox": [ + 140, + 135, + 489, + 148 + ], + "score": 1.0, + "content": "Alexey Dosovitskiy∗,†, Lucas Beyer∗, Alexander Kolesnikov∗, Dirk Weissenborn∗,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 146, + 148, + 477, + 163 + ], + "spans": [ + { + "bbox": [ + 146, + 148, + 477, + 163 + ], + "score": 1.0, + "content": "Xiaohua Zhai∗, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 175, + 162, + 447, + 174 + ], + "spans": [ + { + "bbox": [ + 175, + 162, + 447, + 174 + ], + "score": 1.0, + "content": "Georg Heigold, Sylvain Gelly, Jakob Uszkoreit, Neil Houlsby∗,†", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 199, + 176, + 425, + 214 + ], + "lines": [ + { + "bbox": [ + 219, + 174, + 405, + 190 + ], + "spans": [ + { + "bbox": [ + 219, + 174, + 405, + 190 + ], + "score": 1.0, + "content": "∗equal technical contribution, †equal advising", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 250, + 189, + 373, + 201 + ], + "spans": [ + { + "bbox": [ + 250, + 189, + 373, + 201 + ], + "score": 1.0, + "content": "Google Research, Brain Team", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 198, + 201, + 426, + 215 + ], + "spans": [ + { + "bbox": [ + 198, + 201, + 426, + 215 + ], + "score": 1.0, + "content": "{adosovitskiy, neilhoulsby}@google.com", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 278, + 242, + 333, + 254 + ], + "lines": [ + { + "bbox": [ + 277, + 242, + 335, + 255 + ], + "spans": [ + { + "bbox": [ + 277, + 242, + 335, + 255 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 143, + 268, + 468, + 389 + ], + "lines": [ + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "spans": [ + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "score": 1.0, + "content": "While the Transformer architecture has become the de-facto standard for natural", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 280, + 470, + 292 + ], + "spans": [ + { + "bbox": [ + 141, + 280, + 470, + 292 + ], + "score": 1.0, + "content": "language processing tasks, its applications to computer vision remain limited. In", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 291, + 469, + 303 + ], + "spans": [ + { + "bbox": [ + 142, + 291, + 469, + 303 + ], + "score": 1.0, + "content": "vision, attention is either applied in conjunction with convolutional networks, or", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 142, + 302, + 470, + 314 + ], + "spans": [ + { + "bbox": [ + 142, + 302, + 470, + 314 + ], + "score": 1.0, + "content": "used to replace certain components of convolutional networks while keeping their", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 312, + 469, + 326 + ], + "spans": [ + { + "bbox": [ + 141, + 312, + 469, + 326 + ], + "score": 1.0, + "content": "overall structure in place. We show that this reliance on CNNs is not necessary", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 324, + 469, + 336 + ], + "spans": [ + { + "bbox": [ + 141, + 324, + 469, + 336 + ], + "score": 1.0, + "content": "and a pure transformer applied directly to sequences of image patches can perform", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 335, + 470, + 347 + ], + "spans": [ + { + "bbox": [ + 142, + 335, + 470, + 347 + ], + "score": 1.0, + "content": "very well on image classification tasks. When pre-trained on large amounts of", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 345, + 470, + 358 + ], + "spans": [ + { + "bbox": [ + 141, + 345, + 470, + 358 + ], + "score": 1.0, + "content": "data and transferred to multiple mid-sized or small image recognition benchmarks", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 142, + 357, + 469, + 368 + ], + "spans": [ + { + "bbox": [ + 142, + 357, + 469, + 368 + ], + "score": 1.0, + "content": "(ImageNet, CIFAR-100, VTAB, etc.), Vision Transformer (ViT) attains excellent", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 367, + 469, + 380 + ], + "spans": [ + { + "bbox": [ + 141, + 367, + 469, + 380 + ], + "score": 1.0, + "content": "results compared to state-of-the-art convolutional networks while requiring sub-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 379, + 343, + 390 + ], + "spans": [ + { + "bbox": [ + 141, + 379, + 343, + 390 + ], + "score": 1.0, + "content": "stantially fewer computational resources to train.1", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 108, + 414, + 206, + 426 + ], + "lines": [ + { + "bbox": [ + 105, + 413, + 208, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 208, + 430 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 440, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 453 + ], + "score": 1.0, + "content": "Self-attention-based architectures, in particular Transformers (Vaswani et al., 2017), have become", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "score": 1.0, + "content": "the model of choice in natural language processing (NLP). The dominant approach is to pre-train on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "a large text corpus and then fine-tune on a smaller task-specific dataset (Devlin et al., 2019). Thanks", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 473, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 485 + ], + "score": 1.0, + "content": "to Transformers’ computational efficiency and scalability, it has become possible to train models of", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 484, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 496 + ], + "score": 1.0, + "content": "unprecedented size, with over 100B parameters (Brown et al., 2020; Lepikhin et al., 2020). With the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 495, + 415, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 415, + 508 + ], + "score": 1.0, + "content": "models and datasets growing, there is still no sign of saturating performance.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 512, + 505, + 600 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 524 + ], + "score": 1.0, + "content": "In computer vision, however, convolutional architectures remain dominant (LeCun et al., 1989;", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "score": 1.0, + "content": "Krizhevsky et al., 2012; He et al., 2016). Inspired by NLP successes, multiple works try combining", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 533, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 547 + ], + "score": 1.0, + "content": "CNN-like architectures with self-attention (Wang et al., 2018; Carion et al., 2020), some replacing", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 545, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 505, + 557 + ], + "score": 1.0, + "content": "the convolutions entirely (Ramachandran et al., 2019; Wang et al., 2020a). The latter models, while", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 556, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 506, + 568 + ], + "score": 1.0, + "content": "theoretically efficient, have not yet been scaled effectively on modern hardware accelerators due to", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "score": 1.0, + "content": "the use of specialized attention patterns. Therefore, in large-scale image recognition, classic ResNet-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 576, + 506, + 590 + ], + "spans": [ + { + "bbox": [ + 104, + 576, + 506, + 590 + ], + "score": 1.0, + "content": "like architectures are still state of the art (Mahajan et al., 2018; Xie et al., 2020; Kolesnikov et al.,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 587, + 136, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 136, + 601 + ], + "score": 1.0, + "content": "2020).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 107, + 605, + 504, + 661 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "Inspired by the Transformer scaling successes in NLP, we experiment with applying a standard", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "Transformer directly to images, with the fewest possible modifications. To do so, we split an image", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 628, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 505, + 640 + ], + "score": 1.0, + "content": "into patches and provide the sequence of linear embeddings of these patches as an input to a Trans-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 638, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 651 + ], + "score": 1.0, + "content": "former. Image patches are treated the same way as tokens (words) in an NLP application. We train", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 649, + 332, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 332, + 663 + ], + "score": 1.0, + "content": "the model on image classification in supervised fashion.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 108, + 666, + 504, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 680 + ], + "score": 1.0, + "content": "When trained on mid-sized datasets such as ImageNet without strong regularization, these mod-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 677, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 690 + ], + "score": 1.0, + "content": "els yield modest accuracies of a few percentage points below ResNets of comparable size. This", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 689, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 505, + 700 + ], + "score": 1.0, + "content": "seemingly discouraging outcome may be expected: Transformers lack some of the inductive biases", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 712, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 118, + 708, + 505, + 724 + ], + "spans": [ + { + "bbox": [ + 118, + 708, + 505, + 724 + ], + "score": 1.0, + "content": "1Fine-tuning code and pre-trained models are available at https://github.com/", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 720, + 293, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 293, + 733 + ], + "score": 1.0, + "content": "google-research/vision_transformer", + "type": "text" + } + ] + } + ] + }, + { + "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, + 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": [ + 109, + 78, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 77, + 387, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 77, + 387, + 97 + ], + "score": 1.0, + "content": "AN IMAGE IS WORTH 16X16 WORDS:", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 99, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 107, + 99, + 505, + 117 + ], + "score": 1.0, + "content": "TRANSFORMERS FOR IMAGE RECOGNITION AT SCALE", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 140, + 135, + 489, + 173 + ], + "lines": [ + { + "bbox": [ + 140, + 135, + 489, + 148 + ], + "spans": [ + { + "bbox": [ + 140, + 135, + 489, + 148 + ], + "score": 1.0, + "content": "Alexey Dosovitskiy∗,†, Lucas Beyer∗, Alexander Kolesnikov∗, Dirk Weissenborn∗,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 146, + 148, + 477, + 163 + ], + "spans": [ + { + "bbox": [ + 146, + 148, + 477, + 163 + ], + "score": 1.0, + "content": "Xiaohua Zhai∗, Thomas Unterthiner, Mostafa Dehghani, Matthias Minderer,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 175, + 162, + 447, + 174 + ], + "spans": [ + { + "bbox": [ + 175, + 162, + 447, + 174 + ], + "score": 1.0, + "content": "Georg Heigold, Sylvain Gelly, Jakob Uszkoreit, Neil Houlsby∗,†", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 140, + 135, + 489, + 174 + ] + }, + { + "type": "text", + "bbox": [ + 199, + 176, + 425, + 214 + ], + "lines": [ + { + "bbox": [ + 219, + 174, + 405, + 190 + ], + "spans": [ + { + "bbox": [ + 219, + 174, + 405, + 190 + ], + "score": 1.0, + "content": "∗equal technical contribution, †equal advising", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 250, + 189, + 373, + 201 + ], + "spans": [ + { + "bbox": [ + 250, + 189, + 373, + 201 + ], + "score": 1.0, + "content": "Google Research, Brain Team", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 198, + 201, + 426, + 215 + ], + "spans": [ + { + "bbox": [ + 198, + 201, + 426, + 215 + ], + "score": 1.0, + "content": "{adosovitskiy, neilhoulsby}@google.com", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 198, + 174, + 426, + 215 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 242, + 333, + 254 + ], + "lines": [ + { + "bbox": [ + 277, + 242, + 335, + 255 + ], + "spans": [ + { + "bbox": [ + 277, + 242, + 335, + 255 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 143, + 268, + 468, + 389 + ], + "lines": [ + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "spans": [ + { + "bbox": [ + 142, + 268, + 469, + 280 + ], + "score": 1.0, + "content": "While the Transformer architecture has become the de-facto standard for natural", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 280, + 470, + 292 + ], + "spans": [ + { + "bbox": [ + 141, + 280, + 470, + 292 + ], + "score": 1.0, + "content": "language processing tasks, its applications to computer vision remain limited. In", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 291, + 469, + 303 + ], + "spans": [ + { + "bbox": [ + 142, + 291, + 469, + 303 + ], + "score": 1.0, + "content": "vision, attention is either applied in conjunction with convolutional networks, or", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 142, + 302, + 470, + 314 + ], + "spans": [ + { + "bbox": [ + 142, + 302, + 470, + 314 + ], + "score": 1.0, + "content": "used to replace certain components of convolutional networks while keeping their", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 312, + 469, + 326 + ], + "spans": [ + { + "bbox": [ + 141, + 312, + 469, + 326 + ], + "score": 1.0, + "content": "overall structure in place. We show that this reliance on CNNs is not necessary", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 324, + 469, + 336 + ], + "spans": [ + { + "bbox": [ + 141, + 324, + 469, + 336 + ], + "score": 1.0, + "content": "and a pure transformer applied directly to sequences of image patches can perform", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 335, + 470, + 347 + ], + "spans": [ + { + "bbox": [ + 142, + 335, + 470, + 347 + ], + "score": 1.0, + "content": "very well on image classification tasks. When pre-trained on large amounts of", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 345, + 470, + 358 + ], + "spans": [ + { + "bbox": [ + 141, + 345, + 470, + 358 + ], + "score": 1.0, + "content": "data and transferred to multiple mid-sized or small image recognition benchmarks", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 142, + 357, + 469, + 368 + ], + "spans": [ + { + "bbox": [ + 142, + 357, + 469, + 368 + ], + "score": 1.0, + "content": "(ImageNet, CIFAR-100, VTAB, etc.), Vision Transformer (ViT) attains excellent", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 367, + 469, + 380 + ], + "spans": [ + { + "bbox": [ + 141, + 367, + 469, + 380 + ], + "score": 1.0, + "content": "results compared to state-of-the-art convolutional networks while requiring sub-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 379, + 343, + 390 + ], + "spans": [ + { + "bbox": [ + 141, + 379, + 343, + 390 + ], + "score": 1.0, + "content": "stantially fewer computational resources to train.1", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 14, + "bbox_fs": [ + 141, + 268, + 470, + 390 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 414, + 206, + 426 + ], + "lines": [ + { + "bbox": [ + 105, + 413, + 208, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 208, + 430 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 440, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 453 + ], + "score": 1.0, + "content": "Self-attention-based architectures, in particular Transformers (Vaswani et al., 2017), have become", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 505, + 464 + ], + "score": 1.0, + "content": "the model of choice in natural language processing (NLP). The dominant approach is to pre-train on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "a large text corpus and then fine-tune on a smaller task-specific dataset (Devlin et al., 2019). Thanks", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 473, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 485 + ], + "score": 1.0, + "content": "to Transformers’ computational efficiency and scalability, it has become possible to train models of", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 484, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 496 + ], + "score": 1.0, + "content": "unprecedented size, with over 100B parameters (Brown et al., 2020; Lepikhin et al., 2020). With the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 495, + 415, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 415, + 508 + ], + "score": 1.0, + "content": "models and datasets growing, there is still no sign of saturating performance.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 439, + 506, + 508 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 512, + 505, + 600 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 505, + 524 + ], + "score": 1.0, + "content": "In computer vision, however, convolutional architectures remain dominant (LeCun et al., 1989;", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 536 + ], + "score": 1.0, + "content": "Krizhevsky et al., 2012; He et al., 2016). Inspired by NLP successes, multiple works try combining", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 533, + 505, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 547 + ], + "score": 1.0, + "content": "CNN-like architectures with self-attention (Wang et al., 2018; Carion et al., 2020), some replacing", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 545, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 505, + 557 + ], + "score": 1.0, + "content": "the convolutions entirely (Ramachandran et al., 2019; Wang et al., 2020a). The latter models, while", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 556, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 506, + 568 + ], + "score": 1.0, + "content": "theoretically efficient, have not yet been scaled effectively on modern hardware accelerators due to", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 505, + 579 + ], + "score": 1.0, + "content": "the use of specialized attention patterns. Therefore, in large-scale image recognition, classic ResNet-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 576, + 506, + 590 + ], + "spans": [ + { + "bbox": [ + 104, + 576, + 506, + 590 + ], + "score": 1.0, + "content": "like architectures are still state of the art (Mahajan et al., 2018; Xie et al., 2020; Kolesnikov et al.,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 587, + 136, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 136, + 601 + ], + "score": 1.0, + "content": "2020).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30.5, + "bbox_fs": [ + 104, + 512, + 506, + 601 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 605, + 504, + 661 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "Inspired by the Transformer scaling successes in NLP, we experiment with applying a standard", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "Transformer directly to images, with the fewest possible modifications. To do so, we split an image", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 628, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 628, + 505, + 640 + ], + "score": 1.0, + "content": "into patches and provide the sequence of linear embeddings of these patches as an input to a Trans-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 638, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 651 + ], + "score": 1.0, + "content": "former. Image patches are treated the same way as tokens (words) in an NLP application. We train", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 649, + 332, + 663 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 332, + 663 + ], + "score": 1.0, + "content": "the model on image classification in supervised fashion.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 605, + 506, + 663 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 666, + 504, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 665, + 505, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 680 + ], + "score": 1.0, + "content": "When trained on mid-sized datasets such as ImageNet without strong regularization, these mod-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 677, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 690 + ], + "score": 1.0, + "content": "els yield modest accuracies of a few percentage points below ResNets of comparable size. This", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 689, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 505, + 700 + ], + "score": 1.0, + "content": "seemingly discouraging outcome may be expected: Transformers lack some of the inductive biases", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "inherent to CNNs, such as translation equivariance and locality, and therefore do not generalize well", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 94, + 288, + 105 + ], + "spans": [ + { + "bbox": [ + 107, + 94, + 288, + 105 + ], + "score": 1.0, + "content": "when trained on insufficient amounts of data.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 665, + 505, + 700 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "inherent to CNNs, such as translation equivariance and locality, and therefore do not generalize well", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 94, + 288, + 105 + ], + "spans": [ + { + "bbox": [ + 107, + 94, + 288, + 105 + ], + "score": 1.0, + "content": "when trained on insufficient amounts of data.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "However, the picture changes if the models are trained on larger datasets (14M-300M images). We", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "score": 1.0, + "content": "find that large scale training trumps inductive bias. Our Vision Transformer (ViT) attains excellent", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 131, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 506, + 145 + ], + "score": 1.0, + "content": "results when pre-trained at sufficient scale and transferred to tasks with fewer datapoints. When", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "pre-trained on the public ImageNet-21k dataset or the in-house JFT-300M dataset, ViT approaches", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "or beats state of the art on multiple image recognition benchmarks. In particular, the best model", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 202, + 177 + ], + "score": 1.0, + "content": "reaches the accuracy of", + "type": "text" + }, + { + "bbox": [ + 202, + 165, + 235, + 176 + ], + "score": 0.89, + "content": "8 8 . 5 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 165, + 292, + 177 + ], + "score": 1.0, + "content": "on ImageNet,", + "type": "text" + }, + { + "bbox": [ + 292, + 165, + 325, + 176 + ], + "score": 0.89, + "content": "9 0 . 7 2 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 165, + 407, + 177 + ], + "score": 1.0, + "content": "on ImageNet-ReaL,", + "type": "text" + }, + { + "bbox": [ + 407, + 165, + 440, + 176 + ], + "score": 0.87, + "content": "9 4 . 5 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 165, + 505, + 177 + ], + "score": 1.0, + "content": "on CIFAR-100,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 282, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 123, + 188 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 176, + 156, + 187 + ], + "score": 0.89, + "content": "7 7 . 6 3 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 176, + 282, + 188 + ], + "score": 1.0, + "content": "on the VTAB suite of 19 tasks.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 108, + 225, + 210, + 237 + ], + "lines": [ + { + "bbox": [ + 104, + 223, + 213, + 240 + ], + "spans": [ + { + "bbox": [ + 104, + 223, + 213, + 240 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 263, + 504, + 318 + ], + "lines": [ + { + "bbox": [ + 106, + 263, + 505, + 275 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 505, + 275 + ], + "score": 1.0, + "content": "Transformers were proposed by Vaswani et al. (2017) for machine translation, and have since be-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 274, + 506, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 274, + 506, + 286 + ], + "score": 1.0, + "content": "come the state of the art method in many NLP tasks. Large Transformer-based models are often", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 285, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 506, + 298 + ], + "score": 1.0, + "content": "pre-trained on large corpora and then fine-tuned for the task at hand: BERT (Devlin et al., 2019)", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "uses a denoising self-supervised pre-training task, while the GPT line of work uses language mod-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 307, + 415, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 415, + 320 + ], + "score": 1.0, + "content": "eling as its pre-training task (Radford et al., 2018; 2019; Brown et al., 2020).", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 324, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "score": 1.0, + "content": "Naive application of self-attention to images would require that each pixel attends to every other", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "pixel. With quadratic cost in the number of pixels, this does not scale to realistic input sizes. Thus,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 346, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 358 + ], + "score": 1.0, + "content": "to apply Transformers in the context of image processing, several approximations have been tried in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 356, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 371 + ], + "score": 1.0, + "content": "the past. Parmar et al. (2018) applied the self-attention only in local neighborhoods for each query", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "score": 1.0, + "content": "pixel instead of globally. Such local multi-head dot-product self attention blocks can completely", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 379, + 506, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 391 + ], + "score": 1.0, + "content": "replace convolutions (Hu et al., 2019; Ramachandran et al., 2019; Zhao et al., 2020). In a different", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 390, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 402 + ], + "score": 1.0, + "content": "line of work, Sparse Transformers (Child et al., 2019) employ scalable approximations to global self-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 401, + 505, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 413 + ], + "score": 1.0, + "content": "attention in order to be applicable to images. An alternative way to scale attention is to apply it in", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 412, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 424 + ], + "score": 1.0, + "content": "blocks of varying sizes (Weissenborn et al., 2019), in the extreme case only along individual axes (Ho", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "et al., 2019; Wang et al., 2020a). Many of these specialized attention architectures demonstrate", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 434, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 446 + ], + "score": 1.0, + "content": "promising results on computer vision tasks, but require complex engineering to be implemented", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 445, + 253, + 457 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 253, + 457 + ], + "score": 1.0, + "content": "efficiently on hardware accelerators.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 461, + 505, + 527 + ], + "lines": [ + { + "bbox": [ + 106, + 462, + 504, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 479, + 473 + ], + "score": 1.0, + "content": "Most related to ours is the model of Cordonnier et al. (2020), which extracts patches of size", + "type": "text" + }, + { + "bbox": [ + 480, + 462, + 504, + 472 + ], + "score": 0.87, + "content": "2 \\times 2", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 472, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 505, + 484 + ], + "score": 1.0, + "content": "from the input image and applies full self-attention on top. This model is very similar to ViT,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "but our work goes further to demonstrate that large scale pre-training makes vanilla transformers", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 494, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 494, + 505, + 506 + ], + "score": 1.0, + "content": "competitive with (or even better than) state-of-the-art CNNs. Moreover, Cordonnier et al. (2020)", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 506, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 209, + 518 + ], + "score": 1.0, + "content": "use a small patch size of", + "type": "text" + }, + { + "bbox": [ + 209, + 506, + 233, + 516 + ], + "score": 0.89, + "content": "2 \\times 2", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 506, + 505, + 518 + ], + "score": 1.0, + "content": "pixels, which makes the model applicable only to small-resolution", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 516, + 349, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 516, + 349, + 529 + ], + "score": 1.0, + "content": "images, while we handle medium-resolution images as well.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 107, + 533, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 505, + 546 + ], + "score": 1.0, + "content": "There has also been a lot of interest in combining convolutional neural networks (CNNs) with forms", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 543, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 558 + ], + "score": 1.0, + "content": "of self-attention, e.g. by augmenting feature maps for image classification (Bello et al., 2019) or by", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "further processing the output of a CNN using self-attention, e.g. for object detection (Hu et al., 2018;", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 565, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 506, + 579 + ], + "score": 1.0, + "content": "Carion et al., 2020), video processing (Wang et al., 2018; Sun et al., 2019), image classification (Wu", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "et al., 2020), unsupervised object discovery (Locatello et al., 2020), or unified text-vision tasks (Chen", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 587, + 287, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 287, + 600 + ], + "score": 1.0, + "content": "et al., 2020c; Lu et al., 2019; Li et al., 2019).", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 504, + 649 + ], + "lines": [ + { + "bbox": [ + 106, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 604, + 505, + 617 + ], + "score": 1.0, + "content": "Another recent related model is image GPT (iGPT) (Chen et al., 2020a), which applies Transformers", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "to image pixels after reducing image resolution and color space. The model is trained in an unsu-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 505, + 639 + ], + "score": 1.0, + "content": "pervised fashion as a generative model, and the resulting representation can then be fine-tuned or", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 427, + 651 + ], + "score": 1.0, + "content": "probed linearly for classification performance, achieving a maximal accuracy of", + "type": "text" + }, + { + "bbox": [ + 427, + 638, + 447, + 649 + ], + "score": 0.86, + "content": "72 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "on ImageNet.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "Our work adds to the increasing collection of papers that explore image recognition at larger scales", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "than the standard ImageNet dataset. The use of additional data sources allows to achieve state-of-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 677, + 504, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 504, + 689 + ], + "score": 1.0, + "content": "the-art results on standard benchmarks (Mahajan et al., 2018; Touvron et al., 2019; Xie et al., 2020).", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "Moreover, Sun et al. (2017) study how CNN performance scales with dataset size, and Kolesnikov", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 699, + 505, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 710 + ], + "score": 1.0, + "content": "et al. (2020); Djolonga et al. (2020) perform an empirical exploration of CNN transfer learning from", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "large scale datasets such as ImageNet-21k and JFT-300M. We focus on these two latter datasets as", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 433, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 433, + 732 + ], + "score": 1.0, + "content": "well, but train Transformers instead of ResNet-based models used in prior works.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 46 + } + ], + "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": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 105 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 505, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 505, + 123 + ], + "score": 1.0, + "content": "However, the picture changes if the models are trained on larger datasets (14M-300M images). We", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "score": 1.0, + "content": "find that large scale training trumps inductive bias. Our Vision Transformer (ViT) attains excellent", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 131, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 506, + 145 + ], + "score": 1.0, + "content": "results when pre-trained at sufficient scale and transferred to tasks with fewer datapoints. When", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "pre-trained on the public ImageNet-21k dataset or the in-house JFT-300M dataset, ViT approaches", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 166 + ], + "score": 1.0, + "content": "or beats state of the art on multiple image recognition benchmarks. In particular, the best model", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 202, + 177 + ], + "score": 1.0, + "content": "reaches the accuracy of", + "type": "text" + }, + { + "bbox": [ + 202, + 165, + 235, + 176 + ], + "score": 0.89, + "content": "8 8 . 5 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 165, + 292, + 177 + ], + "score": 1.0, + "content": "on ImageNet,", + "type": "text" + }, + { + "bbox": [ + 292, + 165, + 325, + 176 + ], + "score": 0.89, + "content": "9 0 . 7 2 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 165, + 407, + 177 + ], + "score": 1.0, + "content": "on ImageNet-ReaL,", + "type": "text" + }, + { + "bbox": [ + 407, + 165, + 440, + 176 + ], + "score": 0.87, + "content": "9 4 . 5 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 165, + 505, + 177 + ], + "score": 1.0, + "content": "on CIFAR-100,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 282, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 123, + 188 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 123, + 176, + 156, + 187 + ], + "score": 0.89, + "content": "7 7 . 6 3 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 176, + 282, + 188 + ], + "score": 1.0, + "content": "on the VTAB suite of 19 tasks.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 110, + 506, + 188 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 225, + 210, + 237 + ], + "lines": [ + { + "bbox": [ + 104, + 223, + 213, + 240 + ], + "spans": [ + { + "bbox": [ + 104, + 223, + 213, + 240 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 107, + 263, + 504, + 318 + ], + "lines": [ + { + "bbox": [ + 106, + 263, + 505, + 275 + ], + "spans": [ + { + "bbox": [ + 106, + 263, + 505, + 275 + ], + "score": 1.0, + "content": "Transformers were proposed by Vaswani et al. (2017) for machine translation, and have since be-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 274, + 506, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 274, + 506, + 286 + ], + "score": 1.0, + "content": "come the state of the art method in many NLP tasks. Large Transformer-based models are often", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 285, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 506, + 298 + ], + "score": 1.0, + "content": "pre-trained on large corpora and then fine-tuned for the task at hand: BERT (Devlin et al., 2019)", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "score": 1.0, + "content": "uses a denoising self-supervised pre-training task, while the GPT line of work uses language mod-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 307, + 415, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 415, + 320 + ], + "score": 1.0, + "content": "eling as its pre-training task (Radford et al., 2018; 2019; Brown et al., 2020).", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 263, + 506, + 320 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 324, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "score": 1.0, + "content": "Naive application of self-attention to images would require that each pixel attends to every other", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "pixel. With quadratic cost in the number of pixels, this does not scale to realistic input sizes. Thus,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 346, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 358 + ], + "score": 1.0, + "content": "to apply Transformers in the context of image processing, several approximations have been tried in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 356, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 371 + ], + "score": 1.0, + "content": "the past. Parmar et al. (2018) applied the self-attention only in local neighborhoods for each query", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "score": 1.0, + "content": "pixel instead of globally. Such local multi-head dot-product self attention blocks can completely", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 379, + 506, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 379, + 506, + 391 + ], + "score": 1.0, + "content": "replace convolutions (Hu et al., 2019; Ramachandran et al., 2019; Zhao et al., 2020). In a different", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 390, + 505, + 402 + ], + "spans": [ + { + "bbox": [ + 105, + 390, + 505, + 402 + ], + "score": 1.0, + "content": "line of work, Sparse Transformers (Child et al., 2019) employ scalable approximations to global self-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 401, + 505, + 413 + ], + "spans": [ + { + "bbox": [ + 105, + 401, + 505, + 413 + ], + "score": 1.0, + "content": "attention in order to be applicable to images. An alternative way to scale attention is to apply it in", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 412, + 505, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 424 + ], + "score": 1.0, + "content": "blocks of varying sizes (Weissenborn et al., 2019), in the extreme case only along individual axes (Ho", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "et al., 2019; Wang et al., 2020a). Many of these specialized attention architectures demonstrate", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 434, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 505, + 446 + ], + "score": 1.0, + "content": "promising results on computer vision tasks, but require complex engineering to be implemented", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 445, + 253, + 457 + ], + "spans": [ + { + "bbox": [ + 106, + 445, + 253, + 457 + ], + "score": 1.0, + "content": "efficiently on hardware accelerators.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 324, + 506, + 457 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 461, + 505, + 527 + ], + "lines": [ + { + "bbox": [ + 106, + 462, + 504, + 473 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 479, + 473 + ], + "score": 1.0, + "content": "Most related to ours is the model of Cordonnier et al. (2020), which extracts patches of size", + "type": "text" + }, + { + "bbox": [ + 480, + 462, + 504, + 472 + ], + "score": 0.87, + "content": "2 \\times 2", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 472, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 505, + 484 + ], + "score": 1.0, + "content": "from the input image and applies full self-attention on top. This model is very similar to ViT,", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "but our work goes further to demonstrate that large scale pre-training makes vanilla transformers", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 494, + 505, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 494, + 505, + 506 + ], + "score": 1.0, + "content": "competitive with (or even better than) state-of-the-art CNNs. Moreover, Cordonnier et al. (2020)", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 506, + 505, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 209, + 518 + ], + "score": 1.0, + "content": "use a small patch size of", + "type": "text" + }, + { + "bbox": [ + 209, + 506, + 233, + 516 + ], + "score": 0.89, + "content": "2 \\times 2", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 506, + 505, + 518 + ], + "score": 1.0, + "content": "pixels, which makes the model applicable only to small-resolution", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 516, + 349, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 516, + 349, + 529 + ], + "score": 1.0, + "content": "images, while we handle medium-resolution images as well.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 462, + 505, + 529 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 533, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 532, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 505, + 546 + ], + "score": 1.0, + "content": "There has also been a lot of interest in combining convolutional neural networks (CNNs) with forms", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 543, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 558 + ], + "score": 1.0, + "content": "of self-attention, e.g. by augmenting feature maps for image classification (Bello et al., 2019) or by", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "further processing the output of a CNN using self-attention, e.g. for object detection (Hu et al., 2018;", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 565, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 506, + 579 + ], + "score": 1.0, + "content": "Carion et al., 2020), video processing (Wang et al., 2018; Sun et al., 2019), image classification (Wu", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "et al., 2020), unsupervised object discovery (Locatello et al., 2020), or unified text-vision tasks (Chen", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 587, + 287, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 287, + 600 + ], + "score": 1.0, + "content": "et al., 2020c; Lu et al., 2019; Li et al., 2019).", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 532, + 506, + 600 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 604, + 504, + 649 + ], + "lines": [ + { + "bbox": [ + 106, + 604, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 604, + 505, + 617 + ], + "score": 1.0, + "content": "Another recent related model is image GPT (iGPT) (Chen et al., 2020a), which applies Transformers", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 505, + 628 + ], + "score": 1.0, + "content": "to image pixels after reducing image resolution and color space. The model is trained in an unsu-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 505, + 639 + ], + "score": 1.0, + "content": "pervised fashion as a generative model, and the resulting representation can then be fine-tuned or", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 638, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 427, + 651 + ], + "score": 1.0, + "content": "probed linearly for classification performance, achieving a maximal accuracy of", + "type": "text" + }, + { + "bbox": [ + 427, + 638, + 447, + 649 + ], + "score": 0.86, + "content": "72 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 638, + 505, + 651 + ], + "score": 1.0, + "content": "on ImageNet.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40.5, + "bbox_fs": [ + 105, + 604, + 505, + 651 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "Our work adds to the increasing collection of papers that explore image recognition at larger scales", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 505, + 677 + ], + "score": 1.0, + "content": "than the standard ImageNet dataset. The use of additional data sources allows to achieve state-of-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 677, + 504, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 504, + 689 + ], + "score": 1.0, + "content": "the-art results on standard benchmarks (Mahajan et al., 2018; Touvron et al., 2019; Xie et al., 2020).", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "Moreover, Sun et al. (2017) study how CNN performance scales with dataset size, and Kolesnikov", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 699, + 505, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 710 + ], + "score": 1.0, + "content": "et al. (2020); Djolonga et al. (2020) perform an empirical exploration of CNN transfer learning from", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "large scale datasets such as ImageNet-21k and JFT-300M. We focus on these two latter datasets as", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 433, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 433, + 732 + ], + "score": 1.0, + "content": "well, but train Transformers instead of ResNet-based models used in prior works.", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 655, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 147, + 81, + 469, + 248 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 147, + 81, + 469, + 248 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 147, + 81, + 469, + 248 + ], + "spans": [ + { + "bbox": [ + 147, + 81, + 469, + 248 + ], + "score": 0.972, + "type": "image", + "image_path": "8472b256645bd1d1ee65ff7be22b05844a49588fe828da13912901c773e8ea78.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 147, + 81, + 469, + 136.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 147, + 136.66666666666666, + 469, + 192.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 147, + 192.33333333333331, + 469, + 247.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 264, + 505, + 320 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 264, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 277 + ], + "score": 1.0, + "content": "Figure 1: Model overview. We split an image into fixed-size patches, linearly embed each of them,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 275, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 506, + 288 + ], + "score": 1.0, + "content": "add position embeddings, and feed the resulting sequence of vectors to a standard Transformer", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 287, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 505, + 299 + ], + "score": 1.0, + "content": "encoder. In order to perform classification, we use the standard approach of adding an extra learnable", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 296, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 311 + ], + "score": 1.0, + "content": "“classification token” to the sequence. The illustration of the Transformer encoder was inspired by", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 308, + 195, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 195, + 320 + ], + "score": 1.0, + "content": "Vaswani et al. (2017).", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 107, + 357, + 173, + 370 + ], + "lines": [ + { + "bbox": [ + 104, + 355, + 175, + 373 + ], + "spans": [ + { + "bbox": [ + 104, + 355, + 175, + 373 + ], + "score": 1.0, + "content": "3 METHOD", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 394, + 505, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 505, + 407 + ], + "score": 1.0, + "content": "In model design we follow the original Transformer (Vaswani et al., 2017) as closely as possible.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 406, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 505, + 417 + ], + "score": 1.0, + "content": "An advantage of this intentionally simple setup is that scalable NLP Transformer architectures – and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 416, + 378, + 429 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 378, + 429 + ], + "score": 1.0, + "content": "their efficient implementations – can be used almost out of the box.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "title", + "bbox": [ + 108, + 462, + 258, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 261, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 261, + 477 + ], + "score": 1.0, + "content": "3.1 VISION TRANSFORMER (VIT)", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 491, + 505, + 583 + ], + "lines": [ + { + "bbox": [ + 106, + 491, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 505, + 504 + ], + "score": 1.0, + "content": "An overview of the model is depicted in Figure 1. The standard Transformer receives as input a 1D", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 103, + 499, + 508, + 516 + ], + "spans": [ + { + "bbox": [ + 103, + 499, + 416, + 516 + ], + "score": 1.0, + "content": "sequence of token embeddings. To handle 2D images, we reshape the image", + "type": "text" + }, + { + "bbox": [ + 416, + 501, + 478, + 513 + ], + "score": 0.92, + "content": "\\mathbf { x } \\in \\mathbb { R } ^ { H \\times W \\times \\dot { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 499, + 508, + 516 + ], + "score": 1.0, + "content": "into a", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 512, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 241, + 529 + ], + "score": 1.0, + "content": "sequence of flattened 2D patches", + "type": "text" + }, + { + "bbox": [ + 241, + 513, + 312, + 527 + ], + "score": 0.92, + "content": "\\mathbf { x } _ { p } \\in \\mathbb { R } ^ { N \\times ( P ^ { 2 } \\cdot C ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 512, + 344, + 529 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 345, + 515, + 376, + 527 + ], + "score": 0.92, + "content": "( H , W )", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 512, + 506, + 529 + ], + "score": 1.0, + "content": "is the resolution of the original", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 526, + 504, + 540 + ], + "spans": [ + { + "bbox": [ + 104, + 526, + 135, + 540 + ], + "score": 1.0, + "content": "image,", + "type": "text" + }, + { + "bbox": [ + 136, + 528, + 145, + 538 + ], + "score": 0.8, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 526, + 251, + 540 + ], + "score": 1.0, + "content": "is the number of channels,", + "type": "text" + }, + { + "bbox": [ + 252, + 528, + 279, + 539 + ], + "score": 0.91, + "content": "( P , P )", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 526, + 444, + 540 + ], + "score": 1.0, + "content": "is the resolution of each image patch, and", + "type": "text" + }, + { + "bbox": [ + 444, + 527, + 504, + 540 + ], + "score": 0.92, + "content": "N = H W / P ^ { 2 }", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "score": 1.0, + "content": "is the resulting number of patches, which also serves as the effective input sequence length for the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 548, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 548, + 365, + 563 + ], + "score": 1.0, + "content": "Transformer. The Transformer uses constant latent vector size", + "type": "text" + }, + { + "bbox": [ + 365, + 550, + 375, + 559 + ], + "score": 0.74, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 548, + 506, + 563 + ], + "score": 1.0, + "content": "through all of its layers, so we", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 559, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 229, + 573 + ], + "score": 1.0, + "content": "flatten the patches and map to", + "type": "text" + }, + { + "bbox": [ + 230, + 560, + 239, + 570 + ], + "score": 0.8, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 559, + 505, + 573 + ], + "score": 1.0, + "content": "dimensions with a trainable linear projection (Eq. 1). We refer to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 570, + 322, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 322, + 585 + ], + "score": 1.0, + "content": "the output of this projection as the patch embeddings.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 107, + 588, + 505, + 643 + ], + "lines": [ + { + "bbox": [ + 106, + 587, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 505, + 601 + ], + "score": 1.0, + "content": "Similar to BERT’s [class] token, we prepend a learnable embedding to the sequence of embed-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 597, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 159, + 613 + ], + "score": 1.0, + "content": "ded patches", + "type": "text" + }, + { + "bbox": [ + 159, + 599, + 208, + 611 + ], + "score": 0.9, + "content": "( \\mathbf { z } _ { 0 } ^ { 0 } = \\mathbf { x } _ { \\mathrm { c l a s s } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 597, + 431, + 613 + ], + "score": 1.0, + "content": ", whose state at the output of the Transformer encoder", + "type": "text" + }, + { + "bbox": [ + 431, + 599, + 450, + 611 + ], + "score": 0.88, + "content": "( \\mathbf { \\bar { z } } _ { L } ^ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 597, + 506, + 613 + ], + "score": 1.0, + "content": "serves as the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "score": 1.0, + "content": "image representation y (Eq. 4). Both during pre-training and fine-tuning, a classification head is at-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 617, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 104, + 617, + 144, + 636 + ], + "score": 1.0, + "content": "tached to", + "type": "text" + }, + { + "bbox": [ + 145, + 621, + 156, + 633 + ], + "score": 0.89, + "content": "\\mathbf { z } _ { L } ^ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 617, + 506, + 636 + ], + "score": 1.0, + "content": ". The classification head is implemented by a MLP with one hidden layer at pre-training", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 632, + 314, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 314, + 645 + ], + "score": 1.0, + "content": "time and by a single linear layer at fine-tuning time.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 649, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "Position embeddings are added to the patch embeddings to retain positional information. We use", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "standard learnable 1D position embeddings, since we have not observed significant performance", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 671, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 505, + 684 + ], + "score": 1.0, + "content": "gains from using more advanced 2D-aware position embeddings (Appendix D.3). The resulting", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 682, + 356, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 356, + 695 + ], + "score": 1.0, + "content": "sequence of embedding vectors serves as input to the encoder.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 108, + 698, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "The Transformer encoder (Vaswani et al., 2017) consists of alternating layers of multiheaded self-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "attention (MSA, see Appendix A) and MLP blocks (Eq. 2, 3). Layernorm (LN) is applied before", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "every block, and residual connections after every block (Wang et al., 2019; Baevski & Auli, 2019).", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + } + ], + "page_idx": 2, + "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": [ + 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": [ + 147, + 81, + 469, + 248 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 147, + 81, + 469, + 248 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 147, + 81, + 469, + 248 + ], + "spans": [ + { + "bbox": [ + 147, + 81, + 469, + 248 + ], + "score": 0.972, + "type": "image", + "image_path": "8472b256645bd1d1ee65ff7be22b05844a49588fe828da13912901c773e8ea78.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 147, + 81, + 469, + 136.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 147, + 136.66666666666666, + 469, + 192.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 147, + 192.33333333333331, + 469, + 247.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 264, + 505, + 320 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 264, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 505, + 277 + ], + "score": 1.0, + "content": "Figure 1: Model overview. We split an image into fixed-size patches, linearly embed each of them,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 275, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 506, + 288 + ], + "score": 1.0, + "content": "add position embeddings, and feed the resulting sequence of vectors to a standard Transformer", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 287, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 106, + 287, + 505, + 299 + ], + "score": 1.0, + "content": "encoder. In order to perform classification, we use the standard approach of adding an extra learnable", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 296, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 311 + ], + "score": 1.0, + "content": "“classification token” to the sequence. The illustration of the Transformer encoder was inspired by", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 308, + 195, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 195, + 320 + ], + "score": 1.0, + "content": "Vaswani et al. (2017).", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "title", + "bbox": [ + 107, + 357, + 173, + 370 + ], + "lines": [ + { + "bbox": [ + 104, + 355, + 175, + 373 + ], + "spans": [ + { + "bbox": [ + 104, + 355, + 175, + 373 + ], + "score": 1.0, + "content": "3 METHOD", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 394, + 505, + 428 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 505, + 407 + ], + "score": 1.0, + "content": "In model design we follow the original Transformer (Vaswani et al., 2017) as closely as possible.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 406, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 505, + 417 + ], + "score": 1.0, + "content": "An advantage of this intentionally simple setup is that scalable NLP Transformer architectures – and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 416, + 378, + 429 + ], + "spans": [ + { + "bbox": [ + 106, + 416, + 378, + 429 + ], + "score": 1.0, + "content": "their efficient implementations – can be used almost out of the box.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 393, + 505, + 429 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 462, + 258, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 261, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 261, + 477 + ], + "score": 1.0, + "content": "3.1 VISION TRANSFORMER (VIT)", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 491, + 505, + 583 + ], + "lines": [ + { + "bbox": [ + 106, + 491, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 505, + 504 + ], + "score": 1.0, + "content": "An overview of the model is depicted in Figure 1. The standard Transformer receives as input a 1D", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 103, + 499, + 508, + 516 + ], + "spans": [ + { + "bbox": [ + 103, + 499, + 416, + 516 + ], + "score": 1.0, + "content": "sequence of token embeddings. To handle 2D images, we reshape the image", + "type": "text" + }, + { + "bbox": [ + 416, + 501, + 478, + 513 + ], + "score": 0.92, + "content": "\\mathbf { x } \\in \\mathbb { R } ^ { H \\times W \\times \\dot { C } }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 499, + 508, + 516 + ], + "score": 1.0, + "content": "into a", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 512, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 241, + 529 + ], + "score": 1.0, + "content": "sequence of flattened 2D patches", + "type": "text" + }, + { + "bbox": [ + 241, + 513, + 312, + 527 + ], + "score": 0.92, + "content": "\\mathbf { x } _ { p } \\in \\mathbb { R } ^ { N \\times ( P ^ { 2 } \\cdot C ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 512, + 344, + 529 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 345, + 515, + 376, + 527 + ], + "score": 0.92, + "content": "( H , W )", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 512, + 506, + 529 + ], + "score": 1.0, + "content": "is the resolution of the original", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 526, + 504, + 540 + ], + "spans": [ + { + "bbox": [ + 104, + 526, + 135, + 540 + ], + "score": 1.0, + "content": "image,", + "type": "text" + }, + { + "bbox": [ + 136, + 528, + 145, + 538 + ], + "score": 0.8, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 526, + 251, + 540 + ], + "score": 1.0, + "content": "is the number of channels,", + "type": "text" + }, + { + "bbox": [ + 252, + 528, + 279, + 539 + ], + "score": 0.91, + "content": "( P , P )", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 526, + 444, + 540 + ], + "score": 1.0, + "content": "is the resolution of each image patch, and", + "type": "text" + }, + { + "bbox": [ + 444, + 527, + 504, + 540 + ], + "score": 0.92, + "content": "N = H W / P ^ { 2 }", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 505, + 551 + ], + "score": 1.0, + "content": "is the resulting number of patches, which also serves as the effective input sequence length for the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 548, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 548, + 365, + 563 + ], + "score": 1.0, + "content": "Transformer. The Transformer uses constant latent vector size", + "type": "text" + }, + { + "bbox": [ + 365, + 550, + 375, + 559 + ], + "score": 0.74, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 548, + 506, + 563 + ], + "score": 1.0, + "content": "through all of its layers, so we", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 559, + 505, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 229, + 573 + ], + "score": 1.0, + "content": "flatten the patches and map to", + "type": "text" + }, + { + "bbox": [ + 230, + 560, + 239, + 570 + ], + "score": 0.8, + "content": "D", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 559, + 505, + 573 + ], + "score": 1.0, + "content": "dimensions with a trainable linear projection (Eq. 1). We refer to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 570, + 322, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 322, + 585 + ], + "score": 1.0, + "content": "the output of this projection as the patch embeddings.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 16.5, + "bbox_fs": [ + 103, + 491, + 508, + 585 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 588, + 505, + 643 + ], + "lines": [ + { + "bbox": [ + 106, + 587, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 505, + 601 + ], + "score": 1.0, + "content": "Similar to BERT’s [class] token, we prepend a learnable embedding to the sequence of embed-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 597, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 159, + 613 + ], + "score": 1.0, + "content": "ded patches", + "type": "text" + }, + { + "bbox": [ + 159, + 599, + 208, + 611 + ], + "score": 0.9, + "content": "( \\mathbf { z } _ { 0 } ^ { 0 } = \\mathbf { x } _ { \\mathrm { c l a s s } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 597, + 431, + 613 + ], + "score": 1.0, + "content": ", whose state at the output of the Transformer encoder", + "type": "text" + }, + { + "bbox": [ + 431, + 599, + 450, + 611 + ], + "score": 0.88, + "content": "( \\mathbf { \\bar { z } } _ { L } ^ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 597, + 506, + 613 + ], + "score": 1.0, + "content": "serves as the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 505, + 623 + ], + "score": 1.0, + "content": "image representation y (Eq. 4). Both during pre-training and fine-tuning, a classification head is at-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 617, + 506, + 636 + ], + "spans": [ + { + "bbox": [ + 104, + 617, + 144, + 636 + ], + "score": 1.0, + "content": "tached to", + "type": "text" + }, + { + "bbox": [ + 145, + 621, + 156, + 633 + ], + "score": 0.89, + "content": "\\mathbf { z } _ { L } ^ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 617, + 506, + 636 + ], + "score": 1.0, + "content": ". The classification head is implemented by a MLP with one hidden layer at pre-training", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 632, + 314, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 314, + 645 + ], + "score": 1.0, + "content": "time and by a single linear layer at fine-tuning time.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 104, + 587, + 506, + 645 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 649, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "Position embeddings are added to the patch embeddings to retain positional information. We use", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "standard learnable 1D position embeddings, since we have not observed significant performance", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 671, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 505, + 684 + ], + "score": 1.0, + "content": "gains from using more advanced 2D-aware position embeddings (Appendix D.3). The resulting", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 682, + 356, + 695 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 356, + 695 + ], + "score": 1.0, + "content": "sequence of embedding vectors serves as input to the encoder.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 649, + 505, + 695 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 698, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "The Transformer encoder (Vaswani et al., 2017) consists of alternating layers of multiheaded self-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "attention (MSA, see Appendix A) and MLP blocks (Eq. 2, 3). Layernorm (LN) is applied before", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "every block, and residual connections after every block (Wang et al., 2019; Baevski & Auli, 2019).", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 698, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 338, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 339, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 339, + 97 + ], + "score": 1.0, + "content": "The MLP contains two layers with a GELU non-linearity.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 97, + 474, + 163 + ], + "lines": [ + { + "bbox": [ + 123, + 97, + 474, + 163 + ], + "spans": [ + { + "bbox": [ + 123, + 97, + 474, + 163 + ], + "score": 0.91, + "content": "\\begin{array} { r l r l } & { \\mathbf z _ { 0 } = [ \\mathbf x _ { \\mathrm { c l a s s } } ; \\mathbf x _ { p } ^ { 1 } \\mathbf E ; \\mathbf x _ { p } ^ { 2 } \\mathbf E ; \\cdot \\cdot \\cdot \\cdot \\cdot \\cdot ; \\mathbf x _ { p } ^ { N } \\mathbf E ] + \\mathbf E _ { p o s } , } & & { \\mathbf E \\in \\mathbb R ^ { ( P ^ { 2 } \\cdot C ) \\times D } , \\mathbf E _ { p o s } \\in \\mathbb R ^ { ( N + 1 ) \\times D } } \\\\ & { \\mathbf z ^ { \\prime } _ { \\ell } = \\mathrm { M S A } ( \\mathrm { L N } ( \\mathbf z _ { \\ell - 1 } ) ) + \\mathbf z _ { \\ell - 1 } , } & & { \\ell = 1 \\dots L } \\\\ & { \\mathbf z _ { \\ell } = \\mathrm { M L P } ( \\mathrm { L N } ( \\mathbf z ^ { \\prime } _ { \\ell } ) ) + \\mathbf z ^ { \\prime } _ { \\ell } , } & & { \\ell = 1 \\dots L } \\\\ & { \\mathbf y = \\mathrm { L N } ( \\mathbf z _ { L } ^ { 0 } ) } \\end{array}", + "type": "interline_equation", + "image_path": "0fbfea81638ce25320b43318b8054b038f0069432258d34a062fcd650466d317.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 123, + 97, + 474, + 119.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 123, + 119.0, + 474, + 141.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 123, + 141.0, + 474, + 163.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 171, + 505, + 270 + ], + "lines": [ + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "Inductive bias. We note that Vision Transformer has much less image-specific inductive bias than", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 181, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 195 + ], + "score": 1.0, + "content": "CNNs. In CNNs, locality, two-dimensional neighborhood structure, and translation equivariance are", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 193, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 193, + 505, + 205 + ], + "score": 1.0, + "content": "baked into each layer throughout the whole model. In ViT, only MLP layers are local and transla-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 204, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 505, + 216 + ], + "score": 1.0, + "content": "tionally equivariant, while the self-attention layers are global. The two-dimensional neighborhood", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 215, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 505, + 228 + ], + "score": 1.0, + "content": "structure is used very sparingly: in the beginning of the model by cutting the image into patches and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 226, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 106, + 226, + 505, + 239 + ], + "score": 1.0, + "content": "at fine-tuning time for adjusting the position embeddings for images of different resolution (as de-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "scribed below). Other than that, the position embeddings at initialization time carry no information", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 247, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 505, + 260 + ], + "score": 1.0, + "content": "about the 2D positions of the patches and all spatial relations between the patches have to be learned", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 259, + 161, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 161, + 270 + ], + "score": 1.0, + "content": "from scratch.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 282, + 505, + 348 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 505, + 294 + ], + "score": 1.0, + "content": "Hybrid Architecture. As an alternative to raw image patches, the input sequence can be formed", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 292, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 505, + 306 + ], + "score": 1.0, + "content": "from feature maps of a CNN (LeCun et al., 1989). In this hybrid model, the patch embedding", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 303, + 506, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 150, + 317 + ], + "score": 1.0, + "content": "projection", + "type": "text" + }, + { + "bbox": [ + 150, + 304, + 159, + 314 + ], + "score": 0.26, + "content": "\\mathbf { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 303, + 506, + 317 + ], + "score": 1.0, + "content": "(Eq. 1) is applied to patches extracted from a CNN feature map. As a special case,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "score": 1.0, + "content": "the patches can have spatial size 1x1, which means that the input sequence is obtained by simply", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "flattening the spatial dimensions of the feature map and projecting to the Transformer dimension.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 338, + 471, + 349 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 471, + 349 + ], + "score": 1.0, + "content": "The classification input embedding and position embeddings are added as described above.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15.5 + }, + { + "type": "title", + "bbox": [ + 109, + 361, + 307, + 372 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 308, + 374 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 308, + 374 + ], + "score": 1.0, + "content": "3.2 FINE-TUNING AND HIGHER RESOLUTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 382, + 505, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 506, + 394 + ], + "score": 1.0, + "content": "Typically, we pre-train ViT on large datasets, and fine-tune to (smaller) downstream tasks. For", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 393, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 419, + 405 + ], + "score": 1.0, + "content": "this, we remove the pre-trained prediction head and attach a zero-initialized", + "type": "text" + }, + { + "bbox": [ + 420, + 393, + 452, + 403 + ], + "score": 0.92, + "content": "D \\times K", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 393, + 505, + 405 + ], + "score": 1.0, + "content": "feedforward", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 403, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 159, + 417 + ], + "score": 1.0, + "content": "layer, where", + "type": "text" + }, + { + "bbox": [ + 160, + 405, + 171, + 414 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 403, + 506, + 417 + ], + "score": 1.0, + "content": "is the number of downstream classes. It is often beneficial to fine-tune at higher", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 414, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 104, + 414, + 505, + 429 + ], + "score": 1.0, + "content": "resolution than pre-training (Touvron et al., 2019; Kolesnikov et al., 2020). When feeding images", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 425, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 506, + 439 + ], + "score": 1.0, + "content": "of higher resolution, we keep the patch size the same, which results in a larger effective sequence", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 437, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 505, + 450 + ], + "score": 1.0, + "content": "length. The Vision Transformer can handle arbitrary sequence lengths (up to memory constraints),", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "score": 1.0, + "content": "however, the pre-trained position embeddings may no longer be meaningful. We therefore perform", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 458, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 506, + 471 + ], + "score": 1.0, + "content": "2D interpolation of the pre-trained position embeddings, according to their location in the original", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 470, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 505, + 483 + ], + "score": 1.0, + "content": "image. Note that this resolution adjustment and patch extraction are the only points at which an", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 480, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 506, + 493 + ], + "score": 1.0, + "content": "inductive bias about the 2D structure of the images is manually injected into the Vision Transformer.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 24.5 + }, + { + "type": "title", + "bbox": [ + 108, + 508, + 200, + 520 + ], + "lines": [ + { + "bbox": [ + 105, + 507, + 202, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 202, + 523 + ], + "score": 1.0, + "content": "4 EXPERIMENTS", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 106, + 533, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 505, + 545 + ], + "score": 1.0, + "content": "We evaluate the representation learning capabilities of ResNet, Vision Transformer (ViT), and the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 543, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 557 + ], + "score": 1.0, + "content": "hybrid. To understand the data requirements of each model, we pre-train on datasets of varying size", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "and evaluate many benchmark tasks. When considering the computational cost of pre-training the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 565, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 506, + 578 + ], + "score": 1.0, + "content": "model, ViT performs very favourably, attaining state of the art on most recognition benchmarks at", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "a lower pre-training cost. Lastly, we perform a small experiment using self-supervision, and show", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 587, + 321, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 321, + 601 + ], + "score": 1.0, + "content": "that self-supervised ViT holds promise for the future.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5 + }, + { + "type": "title", + "bbox": [ + 107, + 612, + 160, + 623 + ], + "lines": [ + { + "bbox": [ + 105, + 611, + 161, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 161, + 624 + ], + "score": 1.0, + "content": "4.1 SETUP", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "Datasets. To explore model scalability, we use the ILSVRC-2012 ImageNet dataset with 1k classes", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "and 1.3M images (we refer to it as ImageNet in what follows), its superset ImageNet-21k with", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 439, + 668 + ], + "score": 1.0, + "content": "21k classes and 14M images (Deng et al., 2009), and JFT (Sun et al., 2017) with", + "type": "text" + }, + { + "bbox": [ + 440, + 655, + 456, + 666 + ], + "score": 0.44, + "content": "1 8 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 654, + 505, + 668 + ], + "score": 1.0, + "content": "classes and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "303M high-resolution images. We de-duplicate the pre-training datasets w.r.t. the test sets of the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "downstream tasks following Kolesnikov et al. (2020). We transfer the models trained on these", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "dataset to several benchmark tasks: ImageNet on the original validation labels and the cleaned-up", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "ReaL labels (Beyer et al., 2020), CIFAR-10/100 (Krizhevsky, 2009), Oxford-IIIT Pets (Parkhi et al.,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 707, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 506, + 724 + ], + "score": 1.0, + "content": "2012), and Oxford Flowers-102 (Nilsback & Zisserman, 2008). For these datasets, pre-processing", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 721, + 239, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 239, + 732 + ], + "score": 1.0, + "content": "follows Kolesnikov et al. (2020).", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 42 + } + ], + "page_idx": 3, + "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": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 338, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 339, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 339, + 97 + ], + "score": 1.0, + "content": "The MLP contains two layers with a GELU non-linearity.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 80, + 339, + 97 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 97, + 474, + 163 + ], + "lines": [ + { + "bbox": [ + 123, + 97, + 474, + 163 + ], + "spans": [ + { + "bbox": [ + 123, + 97, + 474, + 163 + ], + "score": 0.91, + "content": "\\begin{array} { r l r l } & { \\mathbf z _ { 0 } = [ \\mathbf x _ { \\mathrm { c l a s s } } ; \\mathbf x _ { p } ^ { 1 } \\mathbf E ; \\mathbf x _ { p } ^ { 2 } \\mathbf E ; \\cdot \\cdot \\cdot \\cdot \\cdot \\cdot ; \\mathbf x _ { p } ^ { N } \\mathbf E ] + \\mathbf E _ { p o s } , } & & { \\mathbf E \\in \\mathbb R ^ { ( P ^ { 2 } \\cdot C ) \\times D } , \\mathbf E _ { p o s } \\in \\mathbb R ^ { ( N + 1 ) \\times D } } \\\\ & { \\mathbf z ^ { \\prime } _ { \\ell } = \\mathrm { M S A } ( \\mathrm { L N } ( \\mathbf z _ { \\ell - 1 } ) ) + \\mathbf z _ { \\ell - 1 } , } & & { \\ell = 1 \\dots L } \\\\ & { \\mathbf z _ { \\ell } = \\mathrm { M L P } ( \\mathrm { L N } ( \\mathbf z ^ { \\prime } _ { \\ell } ) ) + \\mathbf z ^ { \\prime } _ { \\ell } , } & & { \\ell = 1 \\dots L } \\\\ & { \\mathbf y = \\mathrm { L N } ( \\mathbf z _ { L } ^ { 0 } ) } \\end{array}", + "type": "interline_equation", + "image_path": "0fbfea81638ce25320b43318b8054b038f0069432258d34a062fcd650466d317.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 123, + 97, + 474, + 119.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 123, + 119.0, + 474, + 141.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 123, + 141.0, + 474, + 163.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 171, + 505, + 270 + ], + "lines": [ + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 183 + ], + "score": 1.0, + "content": "Inductive bias. We note that Vision Transformer has much less image-specific inductive bias than", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 181, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 195 + ], + "score": 1.0, + "content": "CNNs. In CNNs, locality, two-dimensional neighborhood structure, and translation equivariance are", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 193, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 193, + 505, + 205 + ], + "score": 1.0, + "content": "baked into each layer throughout the whole model. In ViT, only MLP layers are local and transla-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 204, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 505, + 216 + ], + "score": 1.0, + "content": "tionally equivariant, while the self-attention layers are global. The two-dimensional neighborhood", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 215, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 505, + 228 + ], + "score": 1.0, + "content": "structure is used very sparingly: in the beginning of the model by cutting the image into patches and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 226, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 106, + 226, + 505, + 239 + ], + "score": 1.0, + "content": "at fine-tuning time for adjusting the position embeddings for images of different resolution (as de-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "scribed below). Other than that, the position embeddings at initialization time carry no information", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 247, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 505, + 260 + ], + "score": 1.0, + "content": "about the 2D positions of the patches and all spatial relations between the patches have to be learned", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 259, + 161, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 259, + 161, + 270 + ], + "score": 1.0, + "content": "from scratch.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 171, + 506, + 270 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 282, + 505, + 348 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 505, + 294 + ], + "score": 1.0, + "content": "Hybrid Architecture. As an alternative to raw image patches, the input sequence can be formed", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 292, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 292, + 505, + 306 + ], + "score": 1.0, + "content": "from feature maps of a CNN (LeCun et al., 1989). In this hybrid model, the patch embedding", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 303, + 506, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 150, + 317 + ], + "score": 1.0, + "content": "projection", + "type": "text" + }, + { + "bbox": [ + 150, + 304, + 159, + 314 + ], + "score": 0.26, + "content": "\\mathbf { E }", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 303, + 506, + 317 + ], + "score": 1.0, + "content": "(Eq. 1) is applied to patches extracted from a CNN feature map. As a special case,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "score": 1.0, + "content": "the patches can have spatial size 1x1, which means that the input sequence is obtained by simply", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 325, + 505, + 339 + ], + "score": 1.0, + "content": "flattening the spatial dimensions of the feature map and projecting to the Transformer dimension.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 338, + 471, + 349 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 471, + 349 + ], + "score": 1.0, + "content": "The classification input embedding and position embeddings are added as described above.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 282, + 506, + 349 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 361, + 307, + 372 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 308, + 374 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 308, + 374 + ], + "score": 1.0, + "content": "3.2 FINE-TUNING AND HIGHER RESOLUTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 382, + 505, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 506, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 506, + 394 + ], + "score": 1.0, + "content": "Typically, we pre-train ViT on large datasets, and fine-tune to (smaller) downstream tasks. For", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 393, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 419, + 405 + ], + "score": 1.0, + "content": "this, we remove the pre-trained prediction head and attach a zero-initialized", + "type": "text" + }, + { + "bbox": [ + 420, + 393, + 452, + 403 + ], + "score": 0.92, + "content": "D \\times K", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 393, + 505, + 405 + ], + "score": 1.0, + "content": "feedforward", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 403, + 506, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 159, + 417 + ], + "score": 1.0, + "content": "layer, where", + "type": "text" + }, + { + "bbox": [ + 160, + 405, + 171, + 414 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 403, + 506, + 417 + ], + "score": 1.0, + "content": "is the number of downstream classes. It is often beneficial to fine-tune at higher", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 414, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 104, + 414, + 505, + 429 + ], + "score": 1.0, + "content": "resolution than pre-training (Touvron et al., 2019; Kolesnikov et al., 2020). When feeding images", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 425, + 506, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 506, + 439 + ], + "score": 1.0, + "content": "of higher resolution, we keep the patch size the same, which results in a larger effective sequence", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 437, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 505, + 450 + ], + "score": 1.0, + "content": "length. The Vision Transformer can handle arbitrary sequence lengths (up to memory constraints),", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 505, + 461 + ], + "score": 1.0, + "content": "however, the pre-trained position embeddings may no longer be meaningful. We therefore perform", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 458, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 506, + 471 + ], + "score": 1.0, + "content": "2D interpolation of the pre-trained position embeddings, according to their location in the original", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 470, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 505, + 483 + ], + "score": 1.0, + "content": "image. Note that this resolution adjustment and patch extraction are the only points at which an", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 480, + 506, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 506, + 493 + ], + "score": 1.0, + "content": "inductive bias about the 2D structure of the images is manually injected into the Vision Transformer.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 24.5, + "bbox_fs": [ + 104, + 381, + 506, + 493 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 508, + 200, + 520 + ], + "lines": [ + { + "bbox": [ + 105, + 507, + 202, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 202, + 523 + ], + "score": 1.0, + "content": "4 EXPERIMENTS", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 107, + 532, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 106, + 533, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 533, + 505, + 545 + ], + "score": 1.0, + "content": "We evaluate the representation learning capabilities of ResNet, Vision Transformer (ViT), and the", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 543, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 557 + ], + "score": 1.0, + "content": "hybrid. To understand the data requirements of each model, we pre-train on datasets of varying size", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 567 + ], + "score": 1.0, + "content": "and evaluate many benchmark tasks. When considering the computational cost of pre-training the", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 565, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 506, + 578 + ], + "score": 1.0, + "content": "model, ViT performs very favourably, attaining state of the art on most recognition benchmarks at", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "a lower pre-training cost. Lastly, we perform a small experiment using self-supervision, and show", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 587, + 321, + 601 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 321, + 601 + ], + "score": 1.0, + "content": "that self-supervised ViT holds promise for the future.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 533, + 506, + 601 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 612, + 160, + 623 + ], + "lines": [ + { + "bbox": [ + 105, + 611, + 161, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 161, + 624 + ], + "score": 1.0, + "content": "4.1 SETUP", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 632, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "Datasets. To explore model scalability, we use the ILSVRC-2012 ImageNet dataset with 1k classes", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 656 + ], + "score": 1.0, + "content": "and 1.3M images (we refer to it as ImageNet in what follows), its superset ImageNet-21k with", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 654, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 439, + 668 + ], + "score": 1.0, + "content": "21k classes and 14M images (Deng et al., 2009), and JFT (Sun et al., 2017) with", + "type": "text" + }, + { + "bbox": [ + 440, + 655, + 456, + 666 + ], + "score": 0.44, + "content": "1 8 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 654, + 505, + 668 + ], + "score": 1.0, + "content": "classes and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 505, + 678 + ], + "score": 1.0, + "content": "303M high-resolution images. We de-duplicate the pre-training datasets w.r.t. the test sets of the", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "downstream tasks following Kolesnikov et al. (2020). We transfer the models trained on these", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "dataset to several benchmark tasks: ImageNet on the original validation labels and the cleaned-up", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "ReaL labels (Beyer et al., 2020), CIFAR-10/100 (Krizhevsky, 2009), Oxford-IIIT Pets (Parkhi et al.,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 707, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 707, + 506, + 724 + ], + "score": 1.0, + "content": "2012), and Oxford Flowers-102 (Nilsback & Zisserman, 2008). For these datasets, pre-processing", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 721, + 239, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 239, + 732 + ], + "score": 1.0, + "content": "follows Kolesnikov et al. (2020).", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 633, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 169, + 80, + 442, + 133 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 169, + 80, + 442, + 133 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 169, + 80, + 442, + 133 + ], + "spans": [ + { + "bbox": [ + 169, + 80, + 442, + 133 + ], + "score": 0.98, + "html": "
ModelLayersHidden size DMLP sizeHeadsParams
ViT-Base1276830721286M
ViT-Large241024409616307M
ViT-Huge321280512016632M
", + "type": "table", + "image_path": "a1391473c0ffe6f0deeb850c4ebf907f31b0213d1c64a9edb138821640d915a2.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 169, + 80, + 442, + 97.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 169, + 97.66666666666667, + 442, + 115.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 169, + 115.33333333333334, + 442, + 133.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 195, + 141, + 415, + 153 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 194, + 140, + 416, + 154 + ], + "spans": [ + { + "bbox": [ + 194, + 140, + 416, + 154 + ], + "score": 1.0, + "content": "Table 1: Details of Vision Transformer model variants.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 107, + 172, + 505, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 171, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 184 + ], + "score": 1.0, + "content": "We also evaluate on the 19-task VTAB classification suite (Zhai et al., 2019b). VTAB evaluates", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "score": 1.0, + "content": "low-data transfer to diverse tasks, using 1 000 training examples per task. The tasks are divided into", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 194, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 505, + 205 + ], + "score": 1.0, + "content": "three groups: Natural – tasks like the above, Pets, CIFAR, etc. Specialized – medical and satellite", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 206, + 453, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 206, + 453, + 218 + ], + "score": 1.0, + "content": "imagery, and Structured – tasks that require geometric understanding like localization.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 222, + 505, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "score": 1.0, + "content": "Model Variants. We base ViT configurations on those used for BERT (Devlin et al., 2019), as", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 232, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 506, + 245 + ], + "score": 1.0, + "content": "summarized in Table 1. The “Base” and “Large” models are directly adopted from BERT and we", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 244, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 505, + 256 + ], + "score": 1.0, + "content": "add the larger “Huge” model. In what follows we use brief notation to indicate the model size and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 254, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 405, + 268 + ], + "score": 1.0, + "content": "the input patch size: for instance, ViT-L/16 means the “Large” variant with", + "type": "text" + }, + { + "bbox": [ + 406, + 255, + 437, + 266 + ], + "score": 0.9, + "content": "1 6 \\times 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 254, + 505, + 268 + ], + "score": 1.0, + "content": "input patch size.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 265, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 279 + ], + "score": 1.0, + "content": "Note that the Transformer’s sequence length is inversely proportional to the square of the patch size,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 276, + 400, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 400, + 290 + ], + "score": 1.0, + "content": "thus models with smaller patch size are computationally more expensive.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 293, + 505, + 382 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "For the baseline CNNs, we use ResNet (He et al., 2016), but replace the Batch Normalization lay-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 306, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 106, + 306, + 505, + 316 + ], + "score": 1.0, + "content": "ers (Ioffe & Szegedy, 2015) with Group Normalization (Wu & He, 2018), and used standardized", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 316, + 504, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 504, + 328 + ], + "score": 1.0, + "content": "convolutions (Qiao et al., 2019). These modifications improve transfer (Kolesnikov et al., 2020),", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "and we denote the modified model “ResNet (BiT)”. For the hybrids, we feed the intermediate fea-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 337, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 351 + ], + "score": 1.0, + "content": "ture maps into ViT with patch size of one “pixel”. To experiment with different sequence lengths,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 348, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 505, + 362 + ], + "score": 1.0, + "content": "we either (i) take the output of stage 4 of a regular ResNet50 or (ii) remove stage 4, place the same", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 360, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 505, + 372 + ], + "score": 1.0, + "content": "number of layers in stage 3 (keeping the total number of layers), and take the output of this extended", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 370, + 477, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 230, + 383 + ], + "score": 1.0, + "content": "stage 3. Option (ii) results in a", + "type": "text" + }, + { + "bbox": [ + 230, + 371, + 242, + 381 + ], + "score": 0.61, + "content": "4 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 370, + 477, + 383 + ], + "score": 1.0, + "content": "longer sequence length, and a more expensive ViT model.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 387, + 505, + 475 + ], + "lines": [ + { + "bbox": [ + 106, + 388, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 505, + 399 + ], + "score": 1.0, + "content": "Training & Fine-tuning. We train all models, including ResNets, using Adam (Kingma & Ba,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 152, + 411 + ], + "score": 1.0, + "content": "2015) with", + "type": "text" + }, + { + "bbox": [ + 152, + 399, + 190, + 410 + ], + "score": 0.88, + "content": "\\beta _ { 1 } = 0 . 9", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 399, + 193, + 411 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 193, + 399, + 240, + 410 + ], + "score": 0.87, + "content": "\\beta _ { 2 } = 0 . 9 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 399, + 505, + 411 + ], + "score": 1.0, + "content": ", a batch size of 4096 and apply a high weight decay of 0.1, which", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 409, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 505, + 422 + ], + "score": 1.0, + "content": "we found to be useful for transfer of all models (Appendix D.1 shows that, in contrast to common", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "score": 1.0, + "content": "practices, Adam works slightly better than SGD for ResNets in our setting). We use a linear learning", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "rate warmup and decay, see Appendix B.1 for details. For fine-tuning we use SGD with momentum,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 442, + 506, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 506, + 455 + ], + "score": 1.0, + "content": "batch size 512, for all models, see Appendix B.1.1. For ImageNet results in Table 2, we fine-tuned at", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 453, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 505, + 466 + ], + "score": 1.0, + "content": "higher resolution: 512 for ViT-L/16 and 518 for ViT-H/14, and also used Polyak & Juditsky (1992)", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 465, + 440, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 440, + 477 + ], + "score": 1.0, + "content": "averaging with a factor of 0.9999 (Ramachandran et al., 2019; Wang et al., 2020b).", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 481, + 505, + 558 + ], + "lines": [ + { + "bbox": [ + 105, + 479, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 505, + 495 + ], + "score": 1.0, + "content": "Metrics. We report results on downstream datasets either through few-shot or fine-tuning accuracy.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "Fine-tuning accuracies capture the performance of each model after fine-tuning it on the respective", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "score": 1.0, + "content": "dataset. Few-shot accuracies are obtained by solving a regularized least-squares regression problem", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 384, + 527 + ], + "score": 1.0, + "content": "that maps the (frozen) representation of a subset of training images to", + "type": "text" + }, + { + "bbox": [ + 384, + 513, + 424, + 526 + ], + "score": 0.93, + "content": "\\{ - 1 , 1 \\} ^ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 513, + 505, + 527 + ], + "score": 1.0, + "content": "target vectors. This", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 524, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 505, + 538 + ], + "score": 1.0, + "content": "formulation allows us to recover the exact solution in closed form. Though we mainly focus on", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 537, + 504, + 548 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 504, + 548 + ], + "score": 1.0, + "content": "fine-tuning performance, we sometimes use linear few-shot accuracies for fast on-the-fly evaluation", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 547, + 262, + 560 + ], + "spans": [ + { + "bbox": [ + 106, + 547, + 262, + 560 + ], + "score": 1.0, + "content": "where fine-tuning would be too costly.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33 + }, + { + "type": "title", + "bbox": [ + 109, + 573, + 286, + 584 + ], + "lines": [ + { + "bbox": [ + 105, + 572, + 288, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 288, + 586 + ], + "score": 1.0, + "content": "4.2 COMPARISON TO STATE OF THE ART", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "We first compare our largest models – ViT-H/14 and ViT-L/16 – to state-of-the-art CNNs from", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "the literature. The first comparison point is Big Transfer (BiT) (Kolesnikov et al., 2020), which", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 616, + 504, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 504, + 628 + ], + "score": 1.0, + "content": "performs supervised transfer learning with large ResNets. The second is Noisy Student (Xie et al.,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 627, + 504, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 504, + 639 + ], + "score": 1.0, + "content": "2020), which is a large EfficientNet trained using semi-supervised learning on ImageNet and JFT-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 637, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 505, + 650 + ], + "score": 1.0, + "content": "300M with the labels removed. Currently, Noisy Student is the state of the art on ImageNet and", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "BiT-L on the other datasets reported here. All models were trained on TPUv3 hardware, and we", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 660, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 671 + ], + "score": 1.0, + "content": "report the number of TPUv3-core-days taken to pre-train each of them, that is, the number of TPU", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 671, + 417, + 684 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 417, + 684 + ], + "score": 1.0, + "content": "v3 cores (2 per chip) used for training multiplied by the training time in days.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 41.5 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 687, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 505, + 699 + ], + "score": 1.0, + "content": "Table 2 shows the results. The smaller ViT-L/16 model pre-trained on JFT-300M outperforms BiT-L", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "(which is pre-trained on the same dataset) on all tasks, while requiring substantially less computa-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "tional resources to train. The larger model, ViT-H/14, further improves the performance, especially", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "on the more challenging datasets – ImageNet, CIFAR-100, and the VTAB suite. Interestingly, this", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 47.5 + } + ], + "page_idx": 4, + "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": [ + 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": [ + 169, + 80, + 442, + 133 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 169, + 80, + 442, + 133 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 169, + 80, + 442, + 133 + ], + "spans": [ + { + "bbox": [ + 169, + 80, + 442, + 133 + ], + "score": 0.98, + "html": "
ModelLayersHidden size DMLP sizeHeadsParams
ViT-Base1276830721286M
ViT-Large241024409616307M
ViT-Huge321280512016632M
", + "type": "table", + "image_path": "a1391473c0ffe6f0deeb850c4ebf907f31b0213d1c64a9edb138821640d915a2.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 169, + 80, + 442, + 97.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 169, + 97.66666666666667, + 442, + 115.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 169, + 115.33333333333334, + 442, + 133.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 195, + 141, + 415, + 153 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 194, + 140, + 416, + 154 + ], + "spans": [ + { + "bbox": [ + 194, + 140, + 416, + 154 + ], + "score": 1.0, + "content": "Table 1: Details of Vision Transformer model variants.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 107, + 172, + 505, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 171, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 184 + ], + "score": 1.0, + "content": "We also evaluate on the 19-task VTAB classification suite (Zhai et al., 2019b). VTAB evaluates", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 196 + ], + "score": 1.0, + "content": "low-data transfer to diverse tasks, using 1 000 training examples per task. The tasks are divided into", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 194, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 505, + 205 + ], + "score": 1.0, + "content": "three groups: Natural – tasks like the above, Pets, CIFAR, etc. Specialized – medical and satellite", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 206, + 453, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 206, + 453, + 218 + ], + "score": 1.0, + "content": "imagery, and Structured – tasks that require geometric understanding like localization.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 171, + 506, + 218 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 222, + 505, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 505, + 235 + ], + "score": 1.0, + "content": "Model Variants. We base ViT configurations on those used for BERT (Devlin et al., 2019), as", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 232, + 506, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 506, + 245 + ], + "score": 1.0, + "content": "summarized in Table 1. The “Base” and “Large” models are directly adopted from BERT and we", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 244, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 505, + 256 + ], + "score": 1.0, + "content": "add the larger “Huge” model. In what follows we use brief notation to indicate the model size and", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 254, + 505, + 268 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 405, + 268 + ], + "score": 1.0, + "content": "the input patch size: for instance, ViT-L/16 means the “Large” variant with", + "type": "text" + }, + { + "bbox": [ + 406, + 255, + 437, + 266 + ], + "score": 0.9, + "content": "1 6 \\times 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 254, + 505, + 268 + ], + "score": 1.0, + "content": "input patch size.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 265, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 279 + ], + "score": 1.0, + "content": "Note that the Transformer’s sequence length is inversely proportional to the square of the patch size,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 276, + 400, + 290 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 400, + 290 + ], + "score": 1.0, + "content": "thus models with smaller patch size are computationally more expensive.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 221, + 506, + 290 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 293, + 505, + 382 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 505, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 505, + 306 + ], + "score": 1.0, + "content": "For the baseline CNNs, we use ResNet (He et al., 2016), but replace the Batch Normalization lay-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 306, + 505, + 316 + ], + "spans": [ + { + "bbox": [ + 106, + 306, + 505, + 316 + ], + "score": 1.0, + "content": "ers (Ioffe & Szegedy, 2015) with Group Normalization (Wu & He, 2018), and used standardized", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 316, + 504, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 504, + 328 + ], + "score": 1.0, + "content": "convolutions (Qiao et al., 2019). These modifications improve transfer (Kolesnikov et al., 2020),", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 505, + 339 + ], + "score": 1.0, + "content": "and we denote the modified model “ResNet (BiT)”. For the hybrids, we feed the intermediate fea-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 337, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 351 + ], + "score": 1.0, + "content": "ture maps into ViT with patch size of one “pixel”. To experiment with different sequence lengths,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 348, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 505, + 362 + ], + "score": 1.0, + "content": "we either (i) take the output of stage 4 of a regular ResNet50 or (ii) remove stage 4, place the same", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 360, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 360, + 505, + 372 + ], + "score": 1.0, + "content": "number of layers in stage 3 (keeping the total number of layers), and take the output of this extended", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 370, + 477, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 230, + 383 + ], + "score": 1.0, + "content": "stage 3. Option (ii) results in a", + "type": "text" + }, + { + "bbox": [ + 230, + 371, + 242, + 381 + ], + "score": 0.61, + "content": "4 \\mathbf { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 370, + 477, + 383 + ], + "score": 1.0, + "content": "longer sequence length, and a more expensive ViT model.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 294, + 505, + 383 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 387, + 505, + 475 + ], + "lines": [ + { + "bbox": [ + 106, + 388, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 505, + 399 + ], + "score": 1.0, + "content": "Training & Fine-tuning. We train all models, including ResNets, using Adam (Kingma & Ba,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 399, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 106, + 399, + 152, + 411 + ], + "score": 1.0, + "content": "2015) with", + "type": "text" + }, + { + "bbox": [ + 152, + 399, + 190, + 410 + ], + "score": 0.88, + "content": "\\beta _ { 1 } = 0 . 9", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 399, + 193, + 411 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 193, + 399, + 240, + 410 + ], + "score": 0.87, + "content": "\\beta _ { 2 } = 0 . 9 9 9", + "type": "inline_equation" + }, + { + "bbox": [ + 241, + 399, + 505, + 411 + ], + "score": 1.0, + "content": ", a batch size of 4096 and apply a high weight decay of 0.1, which", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 409, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 505, + 422 + ], + "score": 1.0, + "content": "we found to be useful for transfer of all models (Appendix D.1 shows that, in contrast to common", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "score": 1.0, + "content": "practices, Adam works slightly better than SGD for ResNets in our setting). We use a linear learning", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 432, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 505, + 444 + ], + "score": 1.0, + "content": "rate warmup and decay, see Appendix B.1 for details. For fine-tuning we use SGD with momentum,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 442, + 506, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 506, + 455 + ], + "score": 1.0, + "content": "batch size 512, for all models, see Appendix B.1.1. For ImageNet results in Table 2, we fine-tuned at", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 453, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 453, + 505, + 466 + ], + "score": 1.0, + "content": "higher resolution: 512 for ViT-L/16 and 518 for ViT-H/14, and also used Polyak & Juditsky (1992)", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 465, + 440, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 440, + 477 + ], + "score": 1.0, + "content": "averaging with a factor of 0.9999 (Ramachandran et al., 2019; Wang et al., 2020b).", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 388, + 506, + 477 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 481, + 505, + 558 + ], + "lines": [ + { + "bbox": [ + 105, + 479, + 505, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 479, + 505, + 495 + ], + "score": 1.0, + "content": "Metrics. We report results on downstream datasets either through few-shot or fine-tuning accuracy.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 505, + 505 + ], + "score": 1.0, + "content": "Fine-tuning accuracies capture the performance of each model after fine-tuning it on the respective", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "score": 1.0, + "content": "dataset. Few-shot accuracies are obtained by solving a regularized least-squares regression problem", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 384, + 527 + ], + "score": 1.0, + "content": "that maps the (frozen) representation of a subset of training images to", + "type": "text" + }, + { + "bbox": [ + 384, + 513, + 424, + 526 + ], + "score": 0.93, + "content": "\\{ - 1 , 1 \\} ^ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 513, + 505, + 527 + ], + "score": 1.0, + "content": "target vectors. This", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 524, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 505, + 538 + ], + "score": 1.0, + "content": "formulation allows us to recover the exact solution in closed form. Though we mainly focus on", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 537, + 504, + 548 + ], + "spans": [ + { + "bbox": [ + 106, + 537, + 504, + 548 + ], + "score": 1.0, + "content": "fine-tuning performance, we sometimes use linear few-shot accuracies for fast on-the-fly evaluation", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 547, + 262, + 560 + ], + "spans": [ + { + "bbox": [ + 106, + 547, + 262, + 560 + ], + "score": 1.0, + "content": "where fine-tuning would be too costly.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 479, + 505, + 560 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 573, + 286, + 584 + ], + "lines": [ + { + "bbox": [ + 105, + 572, + 288, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 288, + 586 + ], + "score": 1.0, + "content": "4.2 COMPARISON TO STATE OF THE ART", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 594, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "We first compare our largest models – ViT-H/14 and ViT-L/16 – to state-of-the-art CNNs from", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "the literature. The first comparison point is Big Transfer (BiT) (Kolesnikov et al., 2020), which", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 616, + 504, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 504, + 628 + ], + "score": 1.0, + "content": "performs supervised transfer learning with large ResNets. The second is Noisy Student (Xie et al.,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 627, + 504, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 504, + 639 + ], + "score": 1.0, + "content": "2020), which is a large EfficientNet trained using semi-supervised learning on ImageNet and JFT-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 637, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 505, + 650 + ], + "score": 1.0, + "content": "300M with the labels removed. Currently, Noisy Student is the state of the art on ImageNet and", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "BiT-L on the other datasets reported here. All models were trained on TPUv3 hardware, and we", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 660, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 505, + 671 + ], + "score": 1.0, + "content": "report the number of TPUv3-core-days taken to pre-train each of them, that is, the number of TPU", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 671, + 417, + 684 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 417, + 684 + ], + "score": 1.0, + "content": "v3 cores (2 per chip) used for training multiplied by the training time in days.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 41.5, + "bbox_fs": [ + 105, + 594, + 506, + 684 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 687, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 505, + 699 + ], + "score": 1.0, + "content": "Table 2 shows the results. The smaller ViT-L/16 model pre-trained on JFT-300M outperforms BiT-L", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "(which is pre-trained on the same dataset) on all tasks, while requiring substantially less computa-", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "tional resources to train. The larger model, ViT-H/14, further improves the performance, especially", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "on the more challenging datasets – ImageNet, CIFAR-100, and the VTAB suite. Interestingly, this", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 47.5, + "bbox_fs": [ + 105, + 687, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 108, + 80, + 502, + 197 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 108, + 80, + 502, + 197 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 80, + 502, + 197 + ], + "spans": [ + { + "bbox": [ + 108, + 80, + 502, + 197 + ], + "score": 0.983, + "html": "
Ours-JFT (ViT-H/14)Ours-JFT (ViT-L/16)Ours-I21k (ViT-L/16)BiT-L (ResNet152x4)Noisy Student (EfficientNet-L2)
ImageNet88.55 ± 0.0487.76±0.0385.30±0.0287.54±0.0288.4/88.5*
ImageNet ReaL90.72± 0.0590.54±0.0388.62 ±0.0590.5490.55
CIFAR-1099.50 ±0.0699.42 ± 0.0399.15±0.0399.37±0.061
CIFAR-10094.55 ± 0.0493.90± 0.0593.25± 0.0593.51± 0.081
Oxford-IIITPets97.56 ±0.0397.32 ± 0.1194.67 ± 0.1596.62± 0.23
Oxford Flowers-10299.68 ±0.0299.74± 0.0099.61±0.0299.63±0.03
VTAB (19 tasks)77.63 ±0.2376.28± 0.4672.72±0.2176.29 ± 1.701
TPUv3-core-days2.5k0.68k0.23k9.9k12.3k
", + "type": "table", + "image_path": "b53811a001ad490da72253bfd73058da145daff6c20cd2c1a438bc059797103e.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 80, + 502, + 119.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 119.0, + 502, + 158.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 158.0, + 502, + 197.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 205, + 505, + 272 + ], + "lines": [ + { + "bbox": [ + 105, + 204, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 506, + 218 + ], + "score": 1.0, + "content": "Table 2: Comparison with state of the art on popular image classification benchmarks. We re-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 216, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 104, + 216, + 506, + 230 + ], + "score": 1.0, + "content": "port mean and standard deviation of the accuracies, averaged over three fine-tuning runs. Vision", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "Transformer models pre-trained on the JFT-300M dataset outperform ResNet-based baselines on all", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 238, + 505, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 505, + 251 + ], + "score": 1.0, + "content": "datasets, while taking substantially less computational resources to pre-train. ViT pre-trained on the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 415, + 261 + ], + "score": 1.0, + "content": "smaller public ImageNet-21k dataset performs well too. ∗Slightly improved", + "type": "text" + }, + { + "bbox": [ + 416, + 249, + 443, + 260 + ], + "score": 0.9, + "content": "8 8 . 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "result reported", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 260, + 206, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 206, + 273 + ], + "score": 1.0, + "content": "in Touvron et al. (2020).", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + }, + { + "type": "image", + "bbox": [ + 113, + 285, + 496, + 373 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 113, + 285, + 496, + 373 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 285, + 496, + 373 + ], + "spans": [ + { + "bbox": [ + 113, + 285, + 496, + 373 + ], + "score": 0.959, + "type": "image", + "image_path": "6c927eeccc1a23999efc0ec6bd56e353478eda7b515a9f29be07ad08e7a02b2b.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 113, + 285, + 496, + 314.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 113, + 314.3333333333333, + 496, + 343.66666666666663 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 113, + 343.66666666666663, + 496, + 372.99999999999994 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 389, + 497, + 402 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 387, + 498, + 404 + ], + "spans": [ + { + "bbox": [ + 109, + 387, + 498, + 404 + ], + "score": 1.0, + "content": "Figure 2: Breakdown of VTAB performance in Natural, Specialized, and Structured task groups.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + } + ], + "index": 11.0 + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 505, + 491 + ], + "lines": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "score": 1.0, + "content": "model still took substantially less compute to pre-train than prior state of the art. However, we note", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 425, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 505, + 436 + ], + "score": 1.0, + "content": "that pre-training efficiency may be affected not only by the architecture choice, but also other pa-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 435, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 447 + ], + "score": 1.0, + "content": "rameters, such as training schedule, optimizer, weight decay, etc. We provide a controlled study of", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 447, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 506, + 458 + ], + "score": 1.0, + "content": "performance vs. compute for different architectures in Section 4.4. Finally, the ViT-L/16 model", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "score": 1.0, + "content": "pre-trained on the public ImageNet-21k dataset performs well on most datasets too, while taking", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 466, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 104, + 466, + 505, + 482 + ], + "score": 1.0, + "content": "fewer resources to pre-train: it could be trained using a standard cloud TPUv3 with 8 cores in ap-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 480, + 193, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 193, + 492 + ], + "score": 1.0, + "content": "proximately 30 days.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 496, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 496, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 496, + 505, + 509 + ], + "score": 1.0, + "content": "Figure 2 decomposes the VTAB tasks into their respective groups, and compares to previous SOTA", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "score": 1.0, + "content": "methods on this benchmark: BiT, VIVI – a ResNet co-trained on ImageNet and Youtube (Tschannen", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "et al., 2020), and S4L – supervised plus semi-supervised learning on ImageNet (Zhai et al., 2019a).", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 528, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 216, + 542 + ], + "score": 1.0, + "content": "ViT-H/14 outperforms BiT-", + "type": "text" + }, + { + "bbox": [ + 217, + 529, + 249, + 540 + ], + "score": 0.26, + "content": "\\mathrm { R } 1 5 2 \\mathrm { x } 4", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 528, + 505, + 542 + ], + "score": 1.0, + "content": ", and other methods, on the Natural and Structured tasks. On the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 540, + 353, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 353, + 553 + ], + "score": 1.0, + "content": "Specialized the performance of the top two models is similar.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22 + }, + { + "type": "title", + "bbox": [ + 108, + 565, + 292, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 564, + 294, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 294, + 578 + ], + "score": 1.0, + "content": "4.3 PRE-TRAINING DATA REQUIREMENTS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 108, + 586, + 504, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 585, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 506, + 598 + ], + "score": 1.0, + "content": "The Vision Transformer performs well when pre-trained on a large JFT-300M dataset. With fewer", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "score": 1.0, + "content": "inductive biases for vision than ResNets, how crucial is the dataset size? We perform two series of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 609, + 160, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 160, + 621 + ], + "score": 1.0, + "content": "experiments.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 625, + 505, + 702 + ], + "lines": [ + { + "bbox": [ + 105, + 625, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 505, + 637 + ], + "score": 1.0, + "content": "First, we pre-train ViT models on datasets of increasing size: ImageNet, ImageNet-21k, and JFT-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 635, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 505, + 649 + ], + "score": 1.0, + "content": "300M. To boost the performance on the smaller datasets, we optimize three basic regularization", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 647, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 505, + 660 + ], + "score": 1.0, + "content": "parameters – weight decay, dropout, and label smoothing. Figure 3 shows the results after fine-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 658, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 505, + 670 + ], + "score": 1.0, + "content": "tuning to ImageNet (results on other datasets are shown in Table 5)2. When pre-trained on the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "smallest dataset, ImageNet, ViT-Large models underperform compared to ViT-Base models, despite", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 680, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 505, + 692 + ], + "score": 1.0, + "content": "(moderate) regularization. With ImageNet-21k pre-training, their performances are similar. Only", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 691, + 505, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 505, + 704 + ], + "score": 1.0, + "content": "with JFT-300M, do we see the full benefit of larger models. Figure 3 also shows the performance", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 32 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 712, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 710, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 118, + 710, + 505, + 723 + ], + "score": 1.0, + "content": "2Note that the ImageNet pre-trained models are also fine-tuned, but again on ImageNet. This is because the", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 720, + 343, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 343, + 734 + ], + "score": 1.0, + "content": "resolution increase during fine-tuning improves the performance.", + "type": "text" + } + ] + } + ] + }, + { + "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, + 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": [ + 108, + 80, + 502, + 197 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 108, + 80, + 502, + 197 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 80, + 502, + 197 + ], + "spans": [ + { + "bbox": [ + 108, + 80, + 502, + 197 + ], + "score": 0.983, + "html": "
Ours-JFT (ViT-H/14)Ours-JFT (ViT-L/16)Ours-I21k (ViT-L/16)BiT-L (ResNet152x4)Noisy Student (EfficientNet-L2)
ImageNet88.55 ± 0.0487.76±0.0385.30±0.0287.54±0.0288.4/88.5*
ImageNet ReaL90.72± 0.0590.54±0.0388.62 ±0.0590.5490.55
CIFAR-1099.50 ±0.0699.42 ± 0.0399.15±0.0399.37±0.061
CIFAR-10094.55 ± 0.0493.90± 0.0593.25± 0.0593.51± 0.081
Oxford-IIITPets97.56 ±0.0397.32 ± 0.1194.67 ± 0.1596.62± 0.23
Oxford Flowers-10299.68 ±0.0299.74± 0.0099.61±0.0299.63±0.03
VTAB (19 tasks)77.63 ±0.2376.28± 0.4672.72±0.2176.29 ± 1.701
TPUv3-core-days2.5k0.68k0.23k9.9k12.3k
", + "type": "table", + "image_path": "b53811a001ad490da72253bfd73058da145daff6c20cd2c1a438bc059797103e.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 80, + 502, + 119.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 119.0, + 502, + 158.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 158.0, + 502, + 197.0 + ], + "spans": [], + "index": 2 + } + ] + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 205, + 505, + 272 + ], + "lines": [ + { + "bbox": [ + 105, + 204, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 506, + 218 + ], + "score": 1.0, + "content": "Table 2: Comparison with state of the art on popular image classification benchmarks. We re-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 216, + 506, + 230 + ], + "spans": [ + { + "bbox": [ + 104, + 216, + 506, + 230 + ], + "score": 1.0, + "content": "port mean and standard deviation of the accuracies, averaged over three fine-tuning runs. Vision", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "Transformer models pre-trained on the JFT-300M dataset outperform ResNet-based baselines on all", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 238, + 505, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 505, + 251 + ], + "score": 1.0, + "content": "datasets, while taking substantially less computational resources to pre-train. ViT pre-trained on the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 415, + 261 + ], + "score": 1.0, + "content": "smaller public ImageNet-21k dataset performs well too. ∗Slightly improved", + "type": "text" + }, + { + "bbox": [ + 416, + 249, + 443, + 260 + ], + "score": 0.9, + "content": "8 8 . 5 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "result reported", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 260, + 206, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 260, + 206, + 273 + ], + "score": 1.0, + "content": "in Touvron et al. (2020).", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5, + "bbox_fs": [ + 104, + 204, + 506, + 273 + ] + }, + { + "type": "image", + "bbox": [ + 113, + 285, + 496, + 373 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 113, + 285, + 496, + 373 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 285, + 496, + 373 + ], + "spans": [ + { + "bbox": [ + 113, + 285, + 496, + 373 + ], + "score": 0.959, + "type": "image", + "image_path": "6c927eeccc1a23999efc0ec6bd56e353478eda7b515a9f29be07ad08e7a02b2b.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 113, + 285, + 496, + 314.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 113, + 314.3333333333333, + 496, + 343.66666666666663 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 113, + 343.66666666666663, + 496, + 372.99999999999994 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 389, + 497, + 402 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 387, + 498, + 404 + ], + "spans": [ + { + "bbox": [ + 109, + 387, + 498, + 404 + ], + "score": 1.0, + "content": "Figure 2: Breakdown of VTAB performance in Natural, Specialized, and Structured task groups.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + } + ], + "index": 11.0 + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 505, + 491 + ], + "lines": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 106, + 413, + 505, + 426 + ], + "score": 1.0, + "content": "model still took substantially less compute to pre-train than prior state of the art. However, we note", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 425, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 505, + 436 + ], + "score": 1.0, + "content": "that pre-training efficiency may be affected not only by the architecture choice, but also other pa-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 435, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 447 + ], + "score": 1.0, + "content": "rameters, such as training schedule, optimizer, weight decay, etc. We provide a controlled study of", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 447, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 506, + 458 + ], + "score": 1.0, + "content": "performance vs. compute for different architectures in Section 4.4. Finally, the ViT-L/16 model", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 505, + 470 + ], + "score": 1.0, + "content": "pre-trained on the public ImageNet-21k dataset performs well on most datasets too, while taking", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 466, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 104, + 466, + 505, + 482 + ], + "score": 1.0, + "content": "fewer resources to pre-train: it could be trained using a standard cloud TPUv3 with 8 cores in ap-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 480, + 193, + 492 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 193, + 492 + ], + "score": 1.0, + "content": "proximately 30 days.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16, + "bbox_fs": [ + 104, + 413, + 506, + 492 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 496, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 496, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 496, + 505, + 509 + ], + "score": 1.0, + "content": "Figure 2 decomposes the VTAB tasks into their respective groups, and compares to previous SOTA", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 520 + ], + "score": 1.0, + "content": "methods on this benchmark: BiT, VIVI – a ResNet co-trained on ImageNet and Youtube (Tschannen", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "et al., 2020), and S4L – supervised plus semi-supervised learning on ImageNet (Zhai et al., 2019a).", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 528, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 216, + 542 + ], + "score": 1.0, + "content": "ViT-H/14 outperforms BiT-", + "type": "text" + }, + { + "bbox": [ + 217, + 529, + 249, + 540 + ], + "score": 0.26, + "content": "\\mathrm { R } 1 5 2 \\mathrm { x } 4", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 528, + 505, + 542 + ], + "score": 1.0, + "content": ", and other methods, on the Natural and Structured tasks. On the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 540, + 353, + 553 + ], + "spans": [ + { + "bbox": [ + 106, + 540, + 353, + 553 + ], + "score": 1.0, + "content": "Specialized the performance of the top two models is similar.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 496, + 505, + 553 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 565, + 292, + 576 + ], + "lines": [ + { + "bbox": [ + 105, + 564, + 294, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 294, + 578 + ], + "score": 1.0, + "content": "4.3 PRE-TRAINING DATA REQUIREMENTS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 108, + 586, + 504, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 585, + 506, + 598 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 506, + 598 + ], + "score": 1.0, + "content": "The Vision Transformer performs well when pre-trained on a large JFT-300M dataset. With fewer", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "score": 1.0, + "content": "inductive biases for vision than ResNets, how crucial is the dataset size? We perform two series of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 609, + 160, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 609, + 160, + 621 + ], + "score": 1.0, + "content": "experiments.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 585, + 506, + 621 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 625, + 505, + 702 + ], + "lines": [ + { + "bbox": [ + 105, + 625, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 505, + 637 + ], + "score": 1.0, + "content": "First, we pre-train ViT models on datasets of increasing size: ImageNet, ImageNet-21k, and JFT-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 635, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 505, + 649 + ], + "score": 1.0, + "content": "300M. To boost the performance on the smaller datasets, we optimize three basic regularization", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 647, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 505, + 660 + ], + "score": 1.0, + "content": "parameters – weight decay, dropout, and label smoothing. Figure 3 shows the results after fine-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 658, + 505, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 505, + 670 + ], + "score": 1.0, + "content": "tuning to ImageNet (results on other datasets are shown in Table 5)2. When pre-trained on the", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 505, + 681 + ], + "score": 1.0, + "content": "smallest dataset, ImageNet, ViT-Large models underperform compared to ViT-Base models, despite", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 680, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 106, + 680, + 505, + 692 + ], + "score": 1.0, + "content": "(moderate) regularization. With ImageNet-21k pre-training, their performances are similar. Only", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 691, + 505, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 505, + 704 + ], + "score": 1.0, + "content": "with JFT-300M, do we see the full benefit of larger models. Figure 3 also shows the performance", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 543, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 557 + ], + "score": 1.0, + "content": "region spanned by BiT models of different sizes. The BiT CNNs outperform ViT on ImageNet, but", + "type": "text", + "cross_page": true + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 555, + 264, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 264, + 568 + ], + "score": 1.0, + "content": "with the larger datasets, ViT overtakes.", + "type": "text", + "cross_page": true + } + ], + "index": 40 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 625, + 505, + 704 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 83, + 291, + 209 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 83, + 291, + 209 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 83, + 291, + 209 + ], + "spans": [ + { + "bbox": [ + 109, + 83, + 291, + 209 + ], + "score": 0.81, + "type": "image", + "image_path": "4a5e6cfb502b704bf83885d2ed1d7b6c999d3da766fdf675e6dd8403b6b7832c.jpg" + } + ] + } + ], + "index": 4.5, + "virtual_lines": [ + { + "bbox": [ + 109, + 83, + 291, + 95.6 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 95.6, + 291, + 108.19999999999999 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 108.19999999999999, + 291, + 120.79999999999998 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 109, + 120.79999999999998, + 291, + 133.39999999999998 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 109, + 133.39999999999998, + 291, + 145.99999999999997 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 109, + 145.99999999999997, + 291, + 158.59999999999997 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 109, + 158.59999999999997, + 291, + 171.19999999999996 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 109, + 171.19999999999996, + 291, + 183.79999999999995 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 109, + 183.79999999999995, + 291, + 196.39999999999995 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 109, + 196.39999999999995, + 291, + 208.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 224, + 294, + 290 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 223, + 296, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 223, + 296, + 236 + ], + "score": 1.0, + "content": "Figure 3: Transfer to ImageNet. While", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 235, + 295, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 295, + 246 + ], + "score": 1.0, + "content": "large ViT models perform worse than BiT", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 245, + 295, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 295, + 258 + ], + "score": 1.0, + "content": "ResNets (shaded area) when pre-trained on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 257, + 295, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 295, + 269 + ], + "score": 1.0, + "content": "small datasets, they shine when pre-trained on", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 268, + 295, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 295, + 280 + ], + "score": 1.0, + "content": "larger datasets. Similarly, larger ViT variants", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 279, + 280, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 280, + 291 + ], + "score": 1.0, + "content": "overtake smaller ones as the dataset grows.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5 + } + ], + "index": 13.5 + }, + { + "type": "image", + "bbox": [ + 309, + 85, + 490, + 209 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 309, + 85, + 490, + 209 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 309, + 85, + 490, + 209 + ], + "spans": [ + { + "bbox": [ + 309, + 85, + 490, + 209 + ], + "score": 0.896, + "type": "image", + "image_path": "ce004e94d63c07640c2be6262378e8ff5241f6ea6f6fbb3d57ba3f0de1fdae38.jpg" + } + ] + } + ], + "index": 14.5, + "virtual_lines": [ + { + "bbox": [ + 309, + 85, + 490, + 97.4 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 309, + 97.4, + 490, + 109.80000000000001 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 309, + 109.80000000000001, + 490, + 122.20000000000002 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 309, + 122.20000000000002, + 490, + 134.60000000000002 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 309, + 134.60000000000002, + 490, + 147.00000000000003 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 309, + 147.00000000000003, + 490, + 159.40000000000003 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 309, + 159.40000000000003, + 490, + 171.80000000000004 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 309, + 171.80000000000004, + 490, + 184.20000000000005 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 309, + 184.20000000000005, + 490, + 196.60000000000005 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 309, + 196.60000000000005, + 490, + 209.00000000000006 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 306, + 224, + 494, + 290 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 306, + 224, + 495, + 236 + ], + "spans": [ + { + "bbox": [ + 306, + 224, + 495, + 236 + ], + "score": 1.0, + "content": "Figure 4: Linear few-shot evaluation on Ima-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 306, + 236, + 495, + 247 + ], + "spans": [ + { + "bbox": [ + 306, + 236, + 495, + 247 + ], + "score": 1.0, + "content": "geNet versus pre-training size. ResNets per-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 305, + 246, + 495, + 258 + ], + "spans": [ + { + "bbox": [ + 305, + 246, + 495, + 258 + ], + "score": 1.0, + "content": "form better with smaller pre-training datasets", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 305, + 257, + 495, + 269 + ], + "spans": [ + { + "bbox": [ + 305, + 257, + 495, + 269 + ], + "score": 1.0, + "content": "but plateau sooner than ViT, which performs", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 305, + 268, + 495, + 280 + ], + "spans": [ + { + "bbox": [ + 305, + 268, + 495, + 280 + ], + "score": 1.0, + "content": "better with larger pre-training. ViT-b is ViT-B", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 306, + 279, + 447, + 290 + ], + "spans": [ + { + "bbox": [ + 306, + 279, + 447, + 290 + ], + "score": 1.0, + "content": "with all hidden dimensions halved.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + } + ], + "index": 21.5 + }, + { + "type": "image", + "bbox": [ + 122, + 309, + 483, + 463 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 122, + 309, + 483, + 463 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 122, + 309, + 483, + 463 + ], + "spans": [ + { + "bbox": [ + 122, + 309, + 483, + 463 + ], + "score": 0.974, + "type": "image", + "image_path": "1b271b3e67a07e8f88f0c2cb8b3447dabf063f4620fa2c1ef85ae23c023dc3ae.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 122, + 309, + 483, + 360.3333333333333 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 122, + 360.3333333333333, + 483, + 411.66666666666663 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 122, + 411.66666666666663, + 483, + 462.99999999999994 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 474, + 505, + 518 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 106, + 474, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 485 + ], + "score": 1.0, + "content": "Figure 5: Performance versus cost for different architectures: Vision Transformers, ResNets, and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "score": 1.0, + "content": "hybrids. Vision Transformers generally outperform ResNets with the same computational budget.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 496, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 506, + 509 + ], + "score": 1.0, + "content": "Hybrids improve upon pure Transformers for smaller model sizes, but the gap vanishes for larger", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 507, + 140, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 140, + 519 + ], + "score": 1.0, + "content": "models.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5 + } + ], + "index": 34.75 + }, + { + "type": "text", + "bbox": [ + 107, + 544, + 504, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 543, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 505, + 557 + ], + "score": 1.0, + "content": "region spanned by BiT models of different sizes. The BiT CNNs outperform ViT on ImageNet, but", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 555, + 264, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 264, + 568 + ], + "score": 1.0, + "content": "with the larger datasets, ViT overtakes.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 106, + 572, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "Second, we train our models on random subsets of 9M, 30M, and 90M as well as the full JFT-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 582, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 582, + 505, + 595 + ], + "score": 1.0, + "content": "300M dataset. We do not perform additional regularization on the smaller subsets and use the same", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "hyper-parameters for all settings. This way, we assess the intrinsic model properties, and not the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 604, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 619 + ], + "score": 1.0, + "content": "effect of regularization. We do, however, use early-stopping, and report the best validation accuracy", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "achieved during training. To save compute, we report few-shot linear accuracy instead of full fine-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "tuning accuracy. Figure 4 contains the results. Vision Transformers overfit more than ResNets with", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "comparable computational cost on smaller datasets. For example, ViT-B/32 is slightly faster than", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 648, + 506, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 375, + 661 + ], + "score": 1.0, + "content": "ResNet50; it performs much worse on the 9M subset, but better on", + "type": "text" + }, + { + "bbox": [ + 375, + 649, + 401, + 659 + ], + "score": 0.86, + "content": "9 0 \\mathbf { M } +", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 648, + 506, + 661 + ], + "score": 1.0, + "content": "subsets. The same is true", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "score": 1.0, + "content": "for ResNet152x2 and ViT-L/16. This result reinforces the intuition that the convolutional inductive", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 670, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 683 + ], + "score": 1.0, + "content": "bias is useful for smaller datasets, but for larger ones, learning the relevant patterns directly from", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 682, + 241, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 241, + 693 + ], + "score": 1.0, + "content": "data is sufficient, even beneficial.", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 46 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "Overall, the few-shot results on ImageNet (Figure 4), as well as the low-data results on VTAB", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "(Table 2) seem promising for very low-data transfer. Further analysis of few-shot properties of ViT", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 721, + 262, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 262, + 732 + ], + "score": 1.0, + "content": "is an exciting direction of future work.", + "type": "text" + } + ], + "index": 54 + } + ], + "index": 53 + } + ], + "page_idx": 6, + "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": [ + 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": [ + 109, + 83, + 291, + 209 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 83, + 291, + 209 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 83, + 291, + 209 + ], + "spans": [ + { + "bbox": [ + 109, + 83, + 291, + 209 + ], + "score": 0.81, + "type": "image", + "image_path": "4a5e6cfb502b704bf83885d2ed1d7b6c999d3da766fdf675e6dd8403b6b7832c.jpg" + } + ] + } + ], + "index": 4.5, + "virtual_lines": [ + { + "bbox": [ + 109, + 83, + 291, + 95.6 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 95.6, + 291, + 108.19999999999999 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 108.19999999999999, + 291, + 120.79999999999998 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 109, + 120.79999999999998, + 291, + 133.39999999999998 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 109, + 133.39999999999998, + 291, + 145.99999999999997 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 109, + 145.99999999999997, + 291, + 158.59999999999997 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 109, + 158.59999999999997, + 291, + 171.19999999999996 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 109, + 171.19999999999996, + 291, + 183.79999999999995 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 109, + 183.79999999999995, + 291, + 196.39999999999995 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 109, + 196.39999999999995, + 291, + 208.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 224, + 294, + 290 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 223, + 296, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 223, + 296, + 236 + ], + "score": 1.0, + "content": "Figure 3: Transfer to ImageNet. While", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 235, + 295, + 246 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 295, + 246 + ], + "score": 1.0, + "content": "large ViT models perform worse than BiT", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 245, + 295, + 258 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 295, + 258 + ], + "score": 1.0, + "content": "ResNets (shaded area) when pre-trained on", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 257, + 295, + 269 + ], + "spans": [ + { + "bbox": [ + 106, + 257, + 295, + 269 + ], + "score": 1.0, + "content": "small datasets, they shine when pre-trained on", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 268, + 295, + 280 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 295, + 280 + ], + "score": 1.0, + "content": "larger datasets. Similarly, larger ViT variants", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 279, + 280, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 280, + 291 + ], + "score": 1.0, + "content": "overtake smaller ones as the dataset grows.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5 + } + ], + "index": 13.5 + }, + { + "type": "image", + "bbox": [ + 309, + 85, + 490, + 209 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 309, + 85, + 490, + 209 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 309, + 85, + 490, + 209 + ], + "spans": [ + { + "bbox": [ + 309, + 85, + 490, + 209 + ], + "score": 0.896, + "type": "image", + "image_path": "ce004e94d63c07640c2be6262378e8ff5241f6ea6f6fbb3d57ba3f0de1fdae38.jpg" + } + ] + } + ], + "index": 14.5, + "virtual_lines": [ + { + "bbox": [ + 309, + 85, + 490, + 97.4 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 309, + 97.4, + 490, + 109.80000000000001 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 309, + 109.80000000000001, + 490, + 122.20000000000002 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 309, + 122.20000000000002, + 490, + 134.60000000000002 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 309, + 134.60000000000002, + 490, + 147.00000000000003 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 309, + 147.00000000000003, + 490, + 159.40000000000003 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 309, + 159.40000000000003, + 490, + 171.80000000000004 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 309, + 171.80000000000004, + 490, + 184.20000000000005 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 309, + 184.20000000000005, + 490, + 196.60000000000005 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 309, + 196.60000000000005, + 490, + 209.00000000000006 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 306, + 224, + 494, + 290 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 306, + 224, + 495, + 236 + ], + "spans": [ + { + "bbox": [ + 306, + 224, + 495, + 236 + ], + "score": 1.0, + "content": "Figure 4: Linear few-shot evaluation on Ima-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 306, + 236, + 495, + 247 + ], + "spans": [ + { + "bbox": [ + 306, + 236, + 495, + 247 + ], + "score": 1.0, + "content": "geNet versus pre-training size. ResNets per-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 305, + 246, + 495, + 258 + ], + "spans": [ + { + "bbox": [ + 305, + 246, + 495, + 258 + ], + "score": 1.0, + "content": "form better with smaller pre-training datasets", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 305, + 257, + 495, + 269 + ], + "spans": [ + { + "bbox": [ + 305, + 257, + 495, + 269 + ], + "score": 1.0, + "content": "but plateau sooner than ViT, which performs", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 305, + 268, + 495, + 280 + ], + "spans": [ + { + "bbox": [ + 305, + 268, + 495, + 280 + ], + "score": 1.0, + "content": "better with larger pre-training. ViT-b is ViT-B", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 306, + 279, + 447, + 290 + ], + "spans": [ + { + "bbox": [ + 306, + 279, + 447, + 290 + ], + "score": 1.0, + "content": "with all hidden dimensions halved.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + } + ], + "index": 21.5 + }, + { + "type": "image", + "bbox": [ + 122, + 309, + 483, + 463 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 122, + 309, + 483, + 463 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 122, + 309, + 483, + 463 + ], + "spans": [ + { + "bbox": [ + 122, + 309, + 483, + 463 + ], + "score": 0.974, + "type": "image", + "image_path": "1b271b3e67a07e8f88f0c2cb8b3447dabf063f4620fa2c1ef85ae23c023dc3ae.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 122, + 309, + 483, + 360.3333333333333 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 122, + 360.3333333333333, + 483, + 411.66666666666663 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 122, + 411.66666666666663, + 483, + 462.99999999999994 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 474, + 505, + 518 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 106, + 474, + 505, + 485 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 485 + ], + "score": 1.0, + "content": "Figure 5: Performance versus cost for different architectures: Vision Transformers, ResNets, and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "score": 1.0, + "content": "hybrids. Vision Transformers generally outperform ResNets with the same computational budget.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 496, + 506, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 506, + 509 + ], + "score": 1.0, + "content": "Hybrids improve upon pure Transformers for smaller model sizes, but the gap vanishes for larger", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 507, + 140, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 140, + 519 + ], + "score": 1.0, + "content": "models.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36.5 + } + ], + "index": 34.75 + }, + { + "type": "text", + "bbox": [ + 107, + 544, + 504, + 566 + ], + "lines": [], + "index": 39.5, + "bbox_fs": [ + 105, + 543, + 505, + 568 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 572, + 505, + 693 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "Second, we train our models on random subsets of 9M, 30M, and 90M as well as the full JFT-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 582, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 582, + 505, + 595 + ], + "score": 1.0, + "content": "300M dataset. We do not perform additional regularization on the smaller subsets and use the same", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "hyper-parameters for all settings. This way, we assess the intrinsic model properties, and not the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 604, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 505, + 619 + ], + "score": 1.0, + "content": "effect of regularization. We do, however, use early-stopping, and report the best validation accuracy", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "achieved during training. To save compute, we report few-shot linear accuracy instead of full fine-", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "tuning accuracy. Figure 4 contains the results. Vision Transformers overfit more than ResNets with", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "comparable computational cost on smaller datasets. For example, ViT-B/32 is slightly faster than", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 648, + 506, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 375, + 661 + ], + "score": 1.0, + "content": "ResNet50; it performs much worse on the 9M subset, but better on", + "type": "text" + }, + { + "bbox": [ + 375, + 649, + 401, + 659 + ], + "score": 0.86, + "content": "9 0 \\mathbf { M } +", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 648, + 506, + 661 + ], + "score": 1.0, + "content": "subsets. The same is true", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "score": 1.0, + "content": "for ResNet152x2 and ViT-L/16. This result reinforces the intuition that the convolutional inductive", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 670, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 683 + ], + "score": 1.0, + "content": "bias is useful for smaller datasets, but for larger ones, learning the relevant patterns directly from", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 106, + 682, + 241, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 241, + 693 + ], + "score": 1.0, + "content": "data is sufficient, even beneficial.", + "type": "text" + } + ], + "index": 51 + } + ], + "index": 46, + "bbox_fs": [ + 105, + 572, + 506, + 693 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "Overall, the few-shot results on ImageNet (Figure 4), as well as the low-data results on VTAB", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "(Table 2) seem promising for very low-data transfer. Further analysis of few-shot properties of ViT", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 721, + 262, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 262, + 732 + ], + "score": 1.0, + "content": "is an exciting direction of future work.", + "type": "text" + } + ], + "index": 54 + } + ], + "index": 53, + "bbox_fs": [ + 105, + 698, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 82, + 203, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 205, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 205, + 95 + ], + "score": 1.0, + "content": "4.4 SCALING STUDY", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 104, + 505, + 203 + ], + "lines": [ + { + "bbox": [ + 106, + 103, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 103, + 505, + 117 + ], + "score": 1.0, + "content": "We perform a controlled scaling study of different models by evaluating transfer performance from", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "score": 1.0, + "content": "JFT-300M. In this setting data size does not bottleneck the models’ performances, and we assess", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 126, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 138 + ], + "score": 1.0, + "content": "performance versus pre-training cost of each model. The model set includes: 7 ResNets, R50x1,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 137, + 505, + 148 + ], + "spans": [ + { + "bbox": [ + 106, + 137, + 173, + 148 + ], + "score": 1.0, + "content": "R50x2 R101x1,", + "type": "text" + }, + { + "bbox": [ + 173, + 137, + 206, + 147 + ], + "score": 0.31, + "content": "\\mathbf { R } 1 5 2 \\mathbf { x } 1", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 137, + 210, + 148 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 211, + 137, + 244, + 147 + ], + "score": 0.63, + "content": "\\mathbf { R } 1 5 2 \\mathbf { x } 2", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 137, + 371, + 148 + ], + "score": 1.0, + "content": ", pre-trained for 7 epochs, plus", + "type": "text" + }, + { + "bbox": [ + 372, + 137, + 405, + 147 + ], + "score": 0.75, + "content": "\\mathbf { R } 1 5 2 \\mathbf { x } 2", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 137, + 424, + 148 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 424, + 137, + 457, + 147 + ], + "score": 0.41, + "content": "{ \\mathrm { R } } 2 0 0 { \\mathrm { x } } 3 ", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 137, + 505, + 148 + ], + "score": 1.0, + "content": "pre-trained", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 147, + 506, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 506, + 160 + ], + "score": 1.0, + "content": "for 14 epochs; 6 Vision Transformers, ViT-B/32, B/16, L/32, L/16, pre-trained for 7 epochs, plus", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 157, + 505, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 505, + 171 + ], + "score": 1.0, + "content": "L/16 and H/14 pre-trained for 14 epochs; and 5 hybrids, R50+ViT-B/32, B/16, L/32, L/16 pre-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 168, + 505, + 182 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 211, + 182 + ], + "score": 1.0, + "content": "trained for 7 epochs, plus", + "type": "text" + }, + { + "bbox": [ + 212, + 169, + 274, + 180 + ], + "score": 0.5, + "content": "{ \\mathrm { R 5 0 + V i T - L } } / { 1 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 168, + 505, + 182 + ], + "score": 1.0, + "content": "pre-trained for 14 epochs (for hybrids, the number at the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 180, + 506, + 193 + ], + "spans": [ + { + "bbox": [ + 106, + 180, + 506, + 193 + ], + "score": 1.0, + "content": "end of the model name stands not for the patch size, but for the total dowsampling ratio in the ResNet", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 191, + 153, + 203 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 153, + 203 + ], + "score": 1.0, + "content": "backbone).", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 208, + 505, + 296 + ], + "lines": [ + { + "bbox": [ + 105, + 208, + 506, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 506, + 221 + ], + "score": 1.0, + "content": "Figure 5 contains the transfer performance versus total pre-training compute (see Appendix D.4", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 218, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 505, + 232 + ], + "score": 1.0, + "content": "for details on computational costs). Detailed results per model are provided in Table 6 in the Ap-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 230, + 506, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 506, + 242 + ], + "score": 1.0, + "content": "pendix. A few patterns can be observed. First, Vision Transformers dominate ResNets on the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 241, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 104, + 241, + 339, + 254 + ], + "score": 1.0, + "content": "performance/compute trade-off. ViT uses approximately", + "type": "text" + }, + { + "bbox": [ + 340, + 241, + 372, + 252 + ], + "score": 0.88, + "content": "2 - 4 \\times", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 241, + 506, + 254 + ], + "score": 1.0, + "content": "less compute to attain the same", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 251, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 251, + 505, + 266 + ], + "score": 1.0, + "content": "performance (average over 5 datasets). Second, hybrids slightly outperform ViT at small compu-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 261, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 104, + 261, + 506, + 277 + ], + "score": 1.0, + "content": "tational budgets, but the difference vanishes for larger models. This result is somewhat surprising,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "since one might expect convolutional local feature processing to assist ViT at any size. Third, Vision", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 285, + 474, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 474, + 297 + ], + "score": 1.0, + "content": "Transformers appear not to saturate within the range tried, motivating future scaling efforts.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5 + }, + { + "type": "title", + "bbox": [ + 109, + 311, + 285, + 322 + ], + "lines": [ + { + "bbox": [ + 106, + 311, + 287, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 287, + 324 + ], + "score": 1.0, + "content": "4.5 INSPECTING VISION TRANSFORMER", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 332, + 375, + 409 + ], + "lines": [ + { + "bbox": [ + 106, + 332, + 376, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 376, + 344 + ], + "score": 1.0, + "content": "To begin to understand how the Vision Transformer processes im-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 343, + 377, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 377, + 356 + ], + "score": 1.0, + "content": "age data, we analyze its internal representations. The first layer of", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 354, + 376, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 376, + 366 + ], + "score": 1.0, + "content": "the Vision Transformer linearly projects the flattened patches into a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 364, + 376, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 376, + 378 + ], + "score": 1.0, + "content": "lower-dimensional space (Eq. 1). Figure 7 (left) shows the top prin-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 376, + 376, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 376, + 388 + ], + "score": 1.0, + "content": "cipal components of the the learned embedding filters. The com-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 387, + 377, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 377, + 399 + ], + "score": 1.0, + "content": "ponents resemble plausible basis functions for a low-dimensional", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 398, + 321, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 321, + 411 + ], + "score": 1.0, + "content": "representation of the fine structure within each patch.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 375, + 525 + ], + "lines": [ + { + "bbox": [ + 106, + 415, + 376, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 376, + 427 + ], + "score": 1.0, + "content": "After the projection, a learned position embedding is added to the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 426, + 376, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 376, + 438 + ], + "score": 1.0, + "content": "patch representations. Figure 7 (center) shows that the model learns", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 437, + 376, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 376, + 449 + ], + "score": 1.0, + "content": "to encode distance within the image in the similarity of position em-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 447, + 376, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 376, + 460 + ], + "score": 1.0, + "content": "beddings, i.e. closer patches tend to have more similar position em-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 459, + 376, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 376, + 471 + ], + "score": 1.0, + "content": "beddings. Further, the row-column structure appears; patches in the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 470, + 376, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 376, + 481 + ], + "score": 1.0, + "content": "same row/column have similar embeddings. Finally, a sinusoidal", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 481, + 376, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 481, + 376, + 493 + ], + "score": 1.0, + "content": "structure is sometimes apparent for larger grids (Appendix D). That", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 492, + 376, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 376, + 504 + ], + "score": 1.0, + "content": "the position embeddings learn to represent 2D image topology ex-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 503, + 376, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 376, + 515 + ], + "score": 1.0, + "content": "plains why hand-crafted 2D-aware embedding variants do not yield", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 514, + 234, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 234, + 526 + ], + "score": 1.0, + "content": "improvements (Appendix D.3).", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 107, + 531, + 375, + 596 + ], + "lines": [ + { + "bbox": [ + 106, + 531, + 376, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 376, + 542 + ], + "score": 1.0, + "content": "Self-attention allows ViT to integrate information across the entire", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 541, + 376, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 376, + 554 + ], + "score": 1.0, + "content": "image even in the lowest layers. We investigate to what degree", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 552, + 376, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 376, + 565 + ], + "score": 1.0, + "content": "the network makes use of this capability. Specifically, we compute", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 563, + 377, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 377, + 575 + ], + "score": 1.0, + "content": "the average distance in image space across which information is", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 574, + 377, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 377, + 586 + ], + "score": 1.0, + "content": "integrated, based on the attention weights (Figure 7, right). This", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 585, + 376, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 376, + 597 + ], + "score": 1.0, + "content": "“attention distance” is analogous to receptive field size in CNNs.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 39.5 + }, + { + "type": "image", + "bbox": [ + 400, + 343, + 496, + 511 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 400, + 343, + 496, + 511 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 400, + 343, + 496, + 511 + ], + "spans": [ + { + "bbox": [ + 400, + 343, + 496, + 511 + ], + "score": 0.962, + "type": "image", + "image_path": "8dee27d7e89907230fd6d9b026cd90df1ddb924cc14c12e386acd003ea707154.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 400, + 343, + 496, + 511 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 383, + 532, + 504, + 586 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 383, + 531, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 383, + 531, + 505, + 543 + ], + "score": 1.0, + "content": "Figure 6: Representative ex-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 383, + 542, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 383, + 542, + 505, + 554 + ], + "score": 1.0, + "content": "amples of attention from the", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 383, + 553, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 383, + 553, + 505, + 565 + ], + "score": 1.0, + "content": "output token to the input", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 382, + 564, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 382, + 564, + 506, + 576 + ], + "score": 1.0, + "content": "space. See Appendix D.6 for", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 382, + 574, + 415, + 587 + ], + "spans": [ + { + "bbox": [ + 382, + 574, + 415, + 587 + ], + "score": 1.0, + "content": "details.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 505, + 673 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "We find that some heads attend to most of the image already in the lowest layers, showing that", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "score": 1.0, + "content": "the ability to integrate information globally is indeed used by the model. Other attention heads", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 618, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 506, + 631 + ], + "score": 1.0, + "content": "have consistently small attention distances in the low layers. This highly localized attention is", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 630, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 642 + ], + "score": 1.0, + "content": "less pronounced in hybrid models that apply a ResNet before the Transformer (Figure 7, right),", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 640, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 505, + 652 + ], + "score": 1.0, + "content": "suggesting that it may serve a similar function as early convolutional layers in CNNs. Further, the", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 650, + 505, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 505, + 664 + ], + "score": 1.0, + "content": "attention distance increases with network depth. Globally, we find that the model attends to image", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 662, + 372, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 372, + 676 + ], + "score": 1.0, + "content": "regions that are semantically relevant for classification (Figure 6).", + "type": "text" + } + ], + "index": 54 + } + ], + "index": 51 + }, + { + "type": "title", + "bbox": [ + 108, + 688, + 213, + 699 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 216, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 216, + 701 + ], + "score": 1.0, + "content": "4.6 SELF-SUPERVISION", + "type": "text" + } + ], + "index": 55 + } + ], + "index": 55 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Transformers show impressive performance on NLP tasks. However, much of their success stems", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "not only from their excellent scalability but also from large scale self-supervised pre-training (Devlin", + "type": "text" + } + ], + "index": 57 + } + ], + "index": 56.5 + } + ], + "page_idx": 7, + "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, + 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": "title", + "bbox": [ + 108, + 82, + 203, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 205, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 205, + 95 + ], + "score": 1.0, + "content": "4.4 SCALING STUDY", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 104, + 505, + 203 + ], + "lines": [ + { + "bbox": [ + 106, + 103, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 103, + 505, + 117 + ], + "score": 1.0, + "content": "We perform a controlled scaling study of different models by evaluating transfer performance from", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 127 + ], + "score": 1.0, + "content": "JFT-300M. In this setting data size does not bottleneck the models’ performances, and we assess", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 126, + 505, + 138 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 138 + ], + "score": 1.0, + "content": "performance versus pre-training cost of each model. The model set includes: 7 ResNets, R50x1,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 137, + 505, + 148 + ], + "spans": [ + { + "bbox": [ + 106, + 137, + 173, + 148 + ], + "score": 1.0, + "content": "R50x2 R101x1,", + "type": "text" + }, + { + "bbox": [ + 173, + 137, + 206, + 147 + ], + "score": 0.31, + "content": "\\mathbf { R } 1 5 2 \\mathbf { x } 1", + "type": "inline_equation" + }, + { + "bbox": [ + 206, + 137, + 210, + 148 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 211, + 137, + 244, + 147 + ], + "score": 0.63, + "content": "\\mathbf { R } 1 5 2 \\mathbf { x } 2", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 137, + 371, + 148 + ], + "score": 1.0, + "content": ", pre-trained for 7 epochs, plus", + "type": "text" + }, + { + "bbox": [ + 372, + 137, + 405, + 147 + ], + "score": 0.75, + "content": "\\mathbf { R } 1 5 2 \\mathbf { x } 2", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 137, + 424, + 148 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 424, + 137, + 457, + 147 + ], + "score": 0.41, + "content": "{ \\mathrm { R } } 2 0 0 { \\mathrm { x } } 3 ", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 137, + 505, + 148 + ], + "score": 1.0, + "content": "pre-trained", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 147, + 506, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 147, + 506, + 160 + ], + "score": 1.0, + "content": "for 14 epochs; 6 Vision Transformers, ViT-B/32, B/16, L/32, L/16, pre-trained for 7 epochs, plus", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 157, + 505, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 505, + 171 + ], + "score": 1.0, + "content": "L/16 and H/14 pre-trained for 14 epochs; and 5 hybrids, R50+ViT-B/32, B/16, L/32, L/16 pre-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 168, + 505, + 182 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 211, + 182 + ], + "score": 1.0, + "content": "trained for 7 epochs, plus", + "type": "text" + }, + { + "bbox": [ + 212, + 169, + 274, + 180 + ], + "score": 0.5, + "content": "{ \\mathrm { R 5 0 + V i T - L } } / { 1 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 168, + 505, + 182 + ], + "score": 1.0, + "content": "pre-trained for 14 epochs (for hybrids, the number at the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 180, + 506, + 193 + ], + "spans": [ + { + "bbox": [ + 106, + 180, + 506, + 193 + ], + "score": 1.0, + "content": "end of the model name stands not for the patch size, but for the total dowsampling ratio in the ResNet", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 191, + 153, + 203 + ], + "spans": [ + { + "bbox": [ + 106, + 191, + 153, + 203 + ], + "score": 1.0, + "content": "backbone).", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 103, + 506, + 203 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 208, + 505, + 296 + ], + "lines": [ + { + "bbox": [ + 105, + 208, + 506, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 506, + 221 + ], + "score": 1.0, + "content": "Figure 5 contains the transfer performance versus total pre-training compute (see Appendix D.4", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 218, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 505, + 232 + ], + "score": 1.0, + "content": "for details on computational costs). Detailed results per model are provided in Table 6 in the Ap-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 230, + 506, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 230, + 506, + 242 + ], + "score": 1.0, + "content": "pendix. A few patterns can be observed. First, Vision Transformers dominate ResNets on the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 241, + 506, + 254 + ], + "spans": [ + { + "bbox": [ + 104, + 241, + 339, + 254 + ], + "score": 1.0, + "content": "performance/compute trade-off. ViT uses approximately", + "type": "text" + }, + { + "bbox": [ + 340, + 241, + 372, + 252 + ], + "score": 0.88, + "content": "2 - 4 \\times", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 241, + 506, + 254 + ], + "score": 1.0, + "content": "less compute to attain the same", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 251, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 251, + 505, + 266 + ], + "score": 1.0, + "content": "performance (average over 5 datasets). Second, hybrids slightly outperform ViT at small compu-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 261, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 104, + 261, + 506, + 277 + ], + "score": 1.0, + "content": "tational budgets, but the difference vanishes for larger models. This result is somewhat surprising,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 275, + 505, + 286 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 286 + ], + "score": 1.0, + "content": "since one might expect convolutional local feature processing to assist ViT at any size. Third, Vision", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 285, + 474, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 285, + 474, + 297 + ], + "score": 1.0, + "content": "Transformers appear not to saturate within the range tried, motivating future scaling efforts.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 208, + 506, + 297 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 311, + 285, + 322 + ], + "lines": [ + { + "bbox": [ + 106, + 311, + 287, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 287, + 324 + ], + "score": 1.0, + "content": "4.5 INSPECTING VISION TRANSFORMER", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 332, + 375, + 409 + ], + "lines": [ + { + "bbox": [ + 106, + 332, + 376, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 332, + 376, + 344 + ], + "score": 1.0, + "content": "To begin to understand how the Vision Transformer processes im-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 343, + 377, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 377, + 356 + ], + "score": 1.0, + "content": "age data, we analyze its internal representations. The first layer of", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 354, + 376, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 376, + 366 + ], + "score": 1.0, + "content": "the Vision Transformer linearly projects the flattened patches into a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 364, + 376, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 376, + 378 + ], + "score": 1.0, + "content": "lower-dimensional space (Eq. 1). Figure 7 (left) shows the top prin-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 376, + 376, + 388 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 376, + 388 + ], + "score": 1.0, + "content": "cipal components of the the learned embedding filters. The com-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 387, + 377, + 399 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 377, + 399 + ], + "score": 1.0, + "content": "ponents resemble plausible basis functions for a low-dimensional", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 398, + 321, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 321, + 411 + ], + "score": 1.0, + "content": "representation of the fine structure within each patch.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 332, + 377, + 411 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 375, + 525 + ], + "lines": [ + { + "bbox": [ + 106, + 415, + 376, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 376, + 427 + ], + "score": 1.0, + "content": "After the projection, a learned position embedding is added to the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 426, + 376, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 376, + 438 + ], + "score": 1.0, + "content": "patch representations. Figure 7 (center) shows that the model learns", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 437, + 376, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 376, + 449 + ], + "score": 1.0, + "content": "to encode distance within the image in the similarity of position em-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 447, + 376, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 376, + 460 + ], + "score": 1.0, + "content": "beddings, i.e. closer patches tend to have more similar position em-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 459, + 376, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 376, + 471 + ], + "score": 1.0, + "content": "beddings. Further, the row-column structure appears; patches in the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 470, + 376, + 481 + ], + "spans": [ + { + "bbox": [ + 106, + 470, + 376, + 481 + ], + "score": 1.0, + "content": "same row/column have similar embeddings. Finally, a sinusoidal", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 481, + 376, + 493 + ], + "spans": [ + { + "bbox": [ + 106, + 481, + 376, + 493 + ], + "score": 1.0, + "content": "structure is sometimes apparent for larger grids (Appendix D). That", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 492, + 376, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 376, + 504 + ], + "score": 1.0, + "content": "the position embeddings learn to represent 2D image topology ex-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 503, + 376, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 376, + 515 + ], + "score": 1.0, + "content": "plains why hand-crafted 2D-aware embedding variants do not yield", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 514, + 234, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 234, + 526 + ], + "score": 1.0, + "content": "improvements (Appendix D.3).", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 415, + 376, + 526 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 531, + 375, + 596 + ], + "lines": [ + { + "bbox": [ + 106, + 531, + 376, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 531, + 376, + 542 + ], + "score": 1.0, + "content": "Self-attention allows ViT to integrate information across the entire", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 541, + 376, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 376, + 554 + ], + "score": 1.0, + "content": "image even in the lowest layers. We investigate to what degree", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 552, + 376, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 376, + 565 + ], + "score": 1.0, + "content": "the network makes use of this capability. Specifically, we compute", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 563, + 377, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 377, + 575 + ], + "score": 1.0, + "content": "the average distance in image space across which information is", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 574, + 377, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 377, + 586 + ], + "score": 1.0, + "content": "integrated, based on the attention weights (Figure 7, right). This", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 585, + 376, + 597 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 376, + 597 + ], + "score": 1.0, + "content": "“attention distance” is analogous to receptive field size in CNNs.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 531, + 377, + 597 + ] + }, + { + "type": "image", + "bbox": [ + 400, + 343, + 496, + 511 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 400, + 343, + 496, + 511 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 400, + 343, + 496, + 511 + ], + "spans": [ + { + "bbox": [ + 400, + 343, + 496, + 511 + ], + "score": 0.962, + "type": "image", + "image_path": "8dee27d7e89907230fd6d9b026cd90df1ddb924cc14c12e386acd003ea707154.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 400, + 343, + 496, + 511 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 383, + 532, + 504, + 586 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 383, + 531, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 383, + 531, + 505, + 543 + ], + "score": 1.0, + "content": "Figure 6: Representative ex-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 383, + 542, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 383, + 542, + 505, + 554 + ], + "score": 1.0, + "content": "amples of attention from the", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 383, + 553, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 383, + 553, + 505, + 565 + ], + "score": 1.0, + "content": "output token to the input", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 382, + 564, + 506, + 576 + ], + "spans": [ + { + "bbox": [ + 382, + 564, + 506, + 576 + ], + "score": 1.0, + "content": "space. See Appendix D.6 for", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 382, + 574, + 415, + 587 + ], + "spans": [ + { + "bbox": [ + 382, + 574, + 415, + 587 + ], + "score": 1.0, + "content": "details.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 505, + 673 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "We find that some heads attend to most of the image already in the lowest layers, showing that", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 620 + ], + "score": 1.0, + "content": "the ability to integrate information globally is indeed used by the model. Other attention heads", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 618, + 506, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 618, + 506, + 631 + ], + "score": 1.0, + "content": "have consistently small attention distances in the low layers. This highly localized attention is", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 630, + 505, + 642 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 505, + 642 + ], + "score": 1.0, + "content": "less pronounced in hybrid models that apply a ResNet before the Transformer (Figure 7, right),", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 640, + 505, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 505, + 652 + ], + "score": 1.0, + "content": "suggesting that it may serve a similar function as early convolutional layers in CNNs. Further, the", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 105, + 650, + 505, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 505, + 664 + ], + "score": 1.0, + "content": "attention distance increases with network depth. Globally, we find that the model attends to image", + "type": "text" + } + ], + "index": 53 + }, + { + "bbox": [ + 105, + 662, + 372, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 372, + 676 + ], + "score": 1.0, + "content": "regions that are semantically relevant for classification (Figure 6).", + "type": "text" + } + ], + "index": 54 + } + ], + "index": 51, + "bbox_fs": [ + 105, + 596, + 506, + 676 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 688, + 213, + 699 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 216, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 216, + 701 + ], + "score": 1.0, + "content": "4.6 SELF-SUPERVISION", + "type": "text" + } + ], + "index": 55 + } + ], + "index": 55 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Transformers show impressive performance on NLP tasks. However, much of their success stems", + "type": "text" + } + ], + "index": 56 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "score": 1.0, + "content": "not only from their excellent scalability but also from large scale self-supervised pre-training (Devlin", + "type": "text" + } + ], + "index": 57 + }, + { + "bbox": [ + 105, + 306, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 505, + 318 + ], + "score": 1.0, + "content": "et al., 2019; Radford et al., 2018). We also perform a preliminary exploration on masked patch", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 316, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 104, + 316, + 505, + 330 + ], + "score": 1.0, + "content": "prediction for self-supervision, mimicking the masked language modeling task used in BERT. With", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 327, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 374, + 342 + ], + "score": 1.0, + "content": "self-supervised pre-training, our smaller ViT-B/16 model achieves", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 375, + 328, + 402, + 338 + ], + "score": 0.87, + "content": "7 9 . 9 \\%", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 402, + 327, + 506, + 342 + ], + "score": 1.0, + "content": "accuracy on ImageNet, a", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 338, + 505, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 216, + 353 + ], + "score": 1.0, + "content": "significant improvement of", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 216, + 339, + 231, + 349 + ], + "score": 0.87, + "content": "2 \\%", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 231, + 338, + 362, + 353 + ], + "score": 1.0, + "content": "to training from scratch, but still", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 362, + 339, + 377, + 349 + ], + "score": 0.86, + "content": "4 \\%", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 378, + 338, + 505, + 353 + ], + "score": 1.0, + "content": "behind supervised pre-training.", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "Appendix B.1.2 contains further details. We leave exploration of contrastive pre-training (Chen", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 361, + 456, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 456, + 372 + ], + "score": 1.0, + "content": "et al., 2020b; He et al., 2020; Bachman et al., 2019; Henaff et al., 2020) to future work. ´", + "type": "text", + "cross_page": true + } + ], + "index": 13 + } + ], + "index": 56.5, + "bbox_fs": [ + 105, + 709, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 105, + 91, + 501, + 207 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 105, + 91, + 501, + 207 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 91, + 501, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 91, + 501, + 207 + ], + "score": 0.96, + "type": "image", + "image_path": "ab9b49548b6e8534a25e7dd9129b1b3881a6beb806baa7a38621f272ca5219bf.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 105, + 91, + 501, + 129.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 105, + 129.66666666666666, + 501, + 168.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 105, + 168.33333333333331, + 501, + 206.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 217, + 505, + 273 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 218, + 504, + 230 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 504, + 230 + ], + "score": 1.0, + "content": "Figure 7: Left: Filters of the initial linear embedding of RGB values of ViT-L/32. Center: Sim-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 229, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 229, + 505, + 241 + ], + "score": 1.0, + "content": "ilarity of position embeddings of ViT-L/32. Tiles show the cosine similarity between the position", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 239, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 506, + 252 + ], + "score": 1.0, + "content": "embedding of the patch with the indicated row and column and the position embeddings of all other", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "patches. Right: Size of attended area by head and network depth. Each dot shows the mean attention", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 262, + 452, + 274 + ], + "spans": [ + { + "bbox": [ + 106, + 262, + 452, + 274 + ], + "score": 1.0, + "content": "distance across images for one of 16 heads at one layer. See Appendix D.6 for details.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 306, + 505, + 372 + ], + "lines": [ + { + "bbox": [ + 105, + 306, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 505, + 318 + ], + "score": 1.0, + "content": "et al., 2019; Radford et al., 2018). We also perform a preliminary exploration on masked patch", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 316, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 104, + 316, + 505, + 330 + ], + "score": 1.0, + "content": "prediction for self-supervision, mimicking the masked language modeling task used in BERT. With", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 327, + 506, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 374, + 342 + ], + "score": 1.0, + "content": "self-supervised pre-training, our smaller ViT-B/16 model achieves", + "type": "text" + }, + { + "bbox": [ + 375, + 328, + 402, + 338 + ], + "score": 0.87, + "content": "7 9 . 9 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 327, + 506, + 342 + ], + "score": 1.0, + "content": "accuracy on ImageNet, a", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 338, + 505, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 216, + 353 + ], + "score": 1.0, + "content": "significant improvement of", + "type": "text" + }, + { + "bbox": [ + 216, + 339, + 231, + 349 + ], + "score": 0.87, + "content": "2 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 338, + 362, + 353 + ], + "score": 1.0, + "content": "to training from scratch, but still", + "type": "text" + }, + { + "bbox": [ + 362, + 339, + 377, + 349 + ], + "score": 0.86, + "content": "4 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 338, + 505, + 353 + ], + "score": 1.0, + "content": "behind supervised pre-training.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "Appendix B.1.2 contains further details. We leave exploration of contrastive pre-training (Chen", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 361, + 456, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 456, + 372 + ], + "score": 1.0, + "content": "et al., 2020b; He et al., 2020; Bachman et al., 2019; Henaff et al., 2020) to future work. ´", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5 + }, + { + "type": "title", + "bbox": [ + 108, + 388, + 195, + 400 + ], + "lines": [ + { + "bbox": [ + 105, + 386, + 197, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 197, + 403 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 505, + 490 + ], + "lines": [ + { + "bbox": [ + 106, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "We have explored the direct application of Transformers to image recognition. Unlike prior works", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "score": 1.0, + "content": "using self-attention in computer vision, we do not introduce image-specific inductive biases into", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 434, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 448 + ], + "score": 1.0, + "content": "the architecture apart from the initial patch extraction step. Instead, we interpret an image as a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "score": 1.0, + "content": "sequence of patches and process it by a standard Transformer encoder as used in NLP. This simple,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 456, + 504, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 504, + 469 + ], + "score": 1.0, + "content": "yet scalable, strategy works surprisingly well when coupled with pre-training on large datasets.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 467, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 505, + 480 + ], + "score": 1.0, + "content": "Thus, Vision Transformer matches or exceeds the state of the art on many image classification", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 479, + 309, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 309, + 491 + ], + "score": 1.0, + "content": "datasets, whilst being relatively cheap to pre-train.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 495, + 505, + 561 + ], + "lines": [ + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "score": 1.0, + "content": "While these initial results are encouraging, many challenges remain. One is to apply ViT to other", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "computer vision tasks, such as detection and segmentation. Our results, coupled with those in Carion", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "et al. (2020), indicate the promise of this approach. Another challenge is to continue exploring self-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "supervised pre-training methods. Our initial experiments show improvement from self-supervised", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "pre-training, but there is still large gap between self-supervised and large-scale supervised pre-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 550, + 442, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 442, + 563 + ], + "score": 1.0, + "content": "training. Finally, further scaling of ViT would likely lead to improved performance.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24.5 + }, + { + "type": "title", + "bbox": [ + 108, + 578, + 224, + 589 + ], + "lines": [ + { + "bbox": [ + 108, + 578, + 226, + 591 + ], + "spans": [ + { + "bbox": [ + 108, + 578, + 226, + 591 + ], + "score": 1.0, + "content": "ACKNOWLEDGEMENTS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 108, + 602, + 505, + 657 + ], + "lines": [ + { + "bbox": [ + 105, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "The work was performed in Berlin, Zurich, and Amsterdam. We thank many colleagues at Google ¨", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 612, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 505, + 626 + ], + "score": 1.0, + "content": "for their help, in particular Andreas Steiner for crucial help with the infrastructure and the open-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "score": 1.0, + "content": "source release of the code; Joan Puigcerver and Maxim Neumann for help with the large-scale", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 634, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 634, + 505, + 648 + ], + "score": 1.0, + "content": "training infrastructure; Dmitry Lepikhin, Aravindh Mahendran, Daniel Keysers, Mario Luciˇ c, Noam ´", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 645, + 303, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 303, + 658 + ], + "score": 1.0, + "content": "Shazeer, and Colin Raffel for useful discussions.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31 + }, + { + "type": "title", + "bbox": [ + 108, + 673, + 175, + 685 + ], + "lines": [ + { + "bbox": [ + 106, + 673, + 176, + 687 + ], + "spans": [ + { + "bbox": [ + 106, + 673, + 176, + 687 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 691, + 487, + 703 + ], + "lines": [ + { + "bbox": [ + 106, + 690, + 488, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 690, + 488, + 705 + ], + "score": 1.0, + "content": "Samira Abnar and Willem Zuidema. Quantifying attention flow in transformers. In ACL, 2020.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 503, + 731 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "Philip Bachman, R Devon Hjelm, and William Buchwalter. Learning representations by maximizing", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 721, + 327, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 327, + 732 + ], + "score": 1.0, + "content": "mutual information across views. In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + } + ], + "page_idx": 8, + "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": [ + 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": [ + 105, + 91, + 501, + 207 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 105, + 91, + 501, + 207 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 91, + 501, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 91, + 501, + 207 + ], + "score": 0.96, + "type": "image", + "image_path": "ab9b49548b6e8534a25e7dd9129b1b3881a6beb806baa7a38621f272ca5219bf.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 105, + 91, + 501, + 129.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 105, + 129.66666666666666, + 501, + 168.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 105, + 168.33333333333331, + 501, + 206.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 217, + 505, + 273 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 218, + 504, + 230 + ], + "spans": [ + { + "bbox": [ + 106, + 218, + 504, + 230 + ], + "score": 1.0, + "content": "Figure 7: Left: Filters of the initial linear embedding of RGB values of ViT-L/32. Center: Sim-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 229, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 106, + 229, + 505, + 241 + ], + "score": 1.0, + "content": "ilarity of position embeddings of ViT-L/32. Tiles show the cosine similarity between the position", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 239, + 506, + 252 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 506, + 252 + ], + "score": 1.0, + "content": "embedding of the patch with the indicated row and column and the position embeddings of all other", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "patches. Right: Size of attended area by head and network depth. Each dot shows the mean attention", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 262, + 452, + 274 + ], + "spans": [ + { + "bbox": [ + 106, + 262, + 452, + 274 + ], + "score": 1.0, + "content": "distance across images for one of 16 heads at one layer. See Appendix D.6 for details.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 306, + 505, + 372 + ], + "lines": [], + "index": 10.5, + "bbox_fs": [ + 104, + 306, + 506, + 372 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 388, + 195, + 400 + ], + "lines": [ + { + "bbox": [ + 105, + 386, + 197, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 197, + 403 + ], + "score": 1.0, + "content": "5 CONCLUSION", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 412, + 505, + 490 + ], + "lines": [ + { + "bbox": [ + 106, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 106, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "We have explored the direct application of Transformers to image recognition. Unlike prior works", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "score": 1.0, + "content": "using self-attention in computer vision, we do not introduce image-specific inductive biases into", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 434, + 506, + 448 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 448 + ], + "score": 1.0, + "content": "the architecture apart from the initial patch extraction step. Instead, we interpret an image as a", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "score": 1.0, + "content": "sequence of patches and process it by a standard Transformer encoder as used in NLP. This simple,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 456, + 504, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 504, + 469 + ], + "score": 1.0, + "content": "yet scalable, strategy works surprisingly well when coupled with pre-training on large datasets.", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 467, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 467, + 505, + 480 + ], + "score": 1.0, + "content": "Thus, Vision Transformer matches or exceeds the state of the art on many image classification", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 479, + 309, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 309, + 491 + ], + "score": 1.0, + "content": "datasets, whilst being relatively cheap to pre-train.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 412, + 506, + 491 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 495, + 505, + 561 + ], + "lines": [ + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 506, + 508 + ], + "score": 1.0, + "content": "While these initial results are encouraging, many challenges remain. One is to apply ViT to other", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "computer vision tasks, such as detection and segmentation. Our results, coupled with those in Carion", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "et al. (2020), indicate the promise of this approach. Another challenge is to continue exploring self-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "supervised pre-training methods. Our initial experiments show improvement from self-supervised", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "pre-training, but there is still large gap between self-supervised and large-scale supervised pre-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 550, + 442, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 442, + 563 + ], + "score": 1.0, + "content": "training. Finally, further scaling of ViT would likely lead to improved performance.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 495, + 506, + 563 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 578, + 224, + 589 + ], + "lines": [ + { + "bbox": [ + 108, + 578, + 226, + 591 + ], + "spans": [ + { + "bbox": [ + 108, + 578, + 226, + 591 + ], + "score": 1.0, + "content": "ACKNOWLEDGEMENTS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 108, + 602, + 505, + 657 + ], + "lines": [ + { + "bbox": [ + 105, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "The work was performed in Berlin, Zurich, and Amsterdam. We thank many colleagues at Google ¨", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 612, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 505, + 626 + ], + "score": 1.0, + "content": "for their help, in particular Andreas Steiner for crucial help with the infrastructure and the open-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 505, + 636 + ], + "score": 1.0, + "content": "source release of the code; Joan Puigcerver and Maxim Neumann for help with the large-scale", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 634, + 505, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 634, + 505, + 648 + ], + "score": 1.0, + "content": "training infrastructure; Dmitry Lepikhin, Aravindh Mahendran, Daniel Keysers, Mario Luciˇ c, Noam ´", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 645, + 303, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 303, + 658 + ], + "score": 1.0, + "content": "Shazeer, and Colin Raffel for useful discussions.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 601, + 505, + 658 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 673, + 175, + 685 + ], + "lines": [ + { + "bbox": [ + 106, + 673, + 176, + 687 + ], + "spans": [ + { + "bbox": [ + 106, + 673, + 176, + 687 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 691, + 487, + 703 + ], + "lines": [ + { + "bbox": [ + 106, + 690, + 488, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 690, + 488, + 705 + ], + "score": 1.0, + "content": "Samira Abnar and Willem Zuidema. Quantifying attention flow in transformers. In ACL, 2020.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 106, + 690, + 488, + 705 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 503, + 731 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "Philip Bachman, R Devon Hjelm, and William Buchwalter. Learning representations by maximizing", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 721, + 327, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 327, + 732 + ], + "score": 1.0, + "content": "mutual information across views. In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 106, + 708, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Alexei Baevski and Michael Auli. Adaptive input representations for neural language modeling. In", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 168, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 168, + 105 + ], + "score": 1.0, + "content": "ICLR, 2019.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 113, + 504, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 504, + 126 + ], + "score": 1.0, + "content": "I. Bello, B. Zoph, Q. Le, A. Vaswani, and J. Shlens. Attention augmented convolutional networks.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 124, + 180, + 135 + ], + "spans": [ + { + "bbox": [ + 115, + 124, + 180, + 135 + ], + "score": 1.0, + "content": "In ICCV, 2019.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 105, + 143, + 504, + 166 + ], + "lines": [ + { + "bbox": [ + 106, + 143, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 505, + 156 + ], + "score": 1.0, + "content": "Lucas Beyer, Olivier J. Henaff, Alexander Kolesnikov, Xiaohua Zhai, and A ´ aron van den Oord. Are ¨", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 155, + 270, + 167 + ], + "spans": [ + { + "bbox": [ + 115, + 155, + 270, + 167 + ], + "score": 1.0, + "content": "we done with imagenet? arXiv, 2020.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 106, + 174, + 505, + 208 + ], + "lines": [ + { + "bbox": [ + 106, + 173, + 505, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 187 + ], + "score": 1.0, + "content": "Tom B Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 185, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 116, + 185, + 505, + 198 + ], + "score": 1.0, + "content": "Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. Language models are", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 197, + 243, + 208 + ], + "spans": [ + { + "bbox": [ + 116, + 197, + 243, + 208 + ], + "score": 1.0, + "content": "few-shot learners. arXiv, 2020.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 105, + 216, + 504, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 216, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 505, + 228 + ], + "score": 1.0, + "content": "Nicolas Carion, Francisco Massa, Gabriel Synnaeve, Nicolas Usunier, Alexander Kirillov, and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 227, + 452, + 239 + ], + "spans": [ + { + "bbox": [ + 116, + 227, + 452, + 239 + ], + "score": 1.0, + "content": "Sergey Zagoruyko. End-to-end object detection with transformers. In ECCV, 2020.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 106, + 246, + 504, + 270 + ], + "lines": [ + { + "bbox": [ + 105, + 246, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 246, + 505, + 260 + ], + "score": 1.0, + "content": "Mark Chen, Alec Radford, Rewon Child, Jeff Wu, and Heewoo Jun. Generative pretraining from", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 258, + 216, + 270 + ], + "spans": [ + { + "bbox": [ + 115, + 258, + 216, + 270 + ], + "score": 1.0, + "content": "pixels. In ICML, 2020a.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 277, + 504, + 300 + ], + "lines": [ + { + "bbox": [ + 106, + 277, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 277, + 505, + 290 + ], + "score": 1.0, + "content": "Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey E. Hinton. A simple framework", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 288, + 384, + 301 + ], + "spans": [ + { + "bbox": [ + 115, + 288, + 384, + 301 + ], + "score": 1.0, + "content": "for contrastive learning of visual representations. In ICML, 2020b.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 307, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "Yen-Chun Chen, Linjie Li, Licheng Yu, Ahmed El Kholy, Faisal Ahmed, Zhe Gan, Yu Cheng, and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 319, + 481, + 333 + ], + "spans": [ + { + "bbox": [ + 116, + 319, + 481, + 333 + ], + "score": 1.0, + "content": "Jingjing Liu. UNITER: UNiversal Image-TExt Representation Learning. In ECCV, 2020c.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 105, + 338, + 504, + 361 + ], + "lines": [ + { + "bbox": [ + 105, + 338, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 352 + ], + "score": 1.0, + "content": "Rewon Child, Scott Gray, Alec Radford, and Ilya Sutskever. Generating long sequences with sparse", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 350, + 225, + 361 + ], + "spans": [ + { + "bbox": [ + 115, + 350, + 225, + 361 + ], + "score": 1.0, + "content": "transformers. arXiv, 2019.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 105, + 369, + 504, + 392 + ], + "lines": [ + { + "bbox": [ + 105, + 369, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 383 + ], + "score": 1.0, + "content": "Jean-Baptiste Cordonnier, Andreas Loukas, and Martin Jaggi. On the relationship between self-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 381, + 319, + 392 + ], + "spans": [ + { + "bbox": [ + 116, + 381, + 319, + 392 + ], + "score": 1.0, + "content": "attention and convolutional layers. In ICLR, 2020.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 105, + 399, + 504, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "J. Deng, W. Dong, R. Socher, L. Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale hierarchical", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 411, + 249, + 424 + ], + "spans": [ + { + "bbox": [ + 115, + 411, + 249, + 424 + ], + "score": 1.0, + "content": "image database. In CVPR, 2009.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 104, + 430, + 504, + 454 + ], + "lines": [ + { + "bbox": [ + 104, + 429, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 104, + 429, + 505, + 445 + ], + "score": 1.0, + "content": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. BERT: Pre-training of deep", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 441, + 408, + 455 + ], + "spans": [ + { + "bbox": [ + 116, + 441, + 408, + 455 + ], + "score": 1.0, + "content": "bidirectional transformers for language understanding. In NAACL, 2019.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 461, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "Josip Djolonga, Jessica Yung, Michael Tschannen, Rob Romijnders, Lucas Beyer, Alexander", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 472, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 115, + 472, + 505, + 486 + ], + "score": 1.0, + "content": "Kolesnikov, Joan Puigcerver, Matthias Minderer, Alexander D’Amour, Dan Moldovan, Sylvan", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 116, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "Gelly, Neil Houlsby, Xiaohua Zhai, and Mario Lucic. On robustness and transferability of convo-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 495, + 271, + 506 + ], + "spans": [ + { + "bbox": [ + 116, + 495, + 271, + 506 + ], + "score": 1.0, + "content": "lutional neural networks. arXiv, 2020.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 107, + 514, + 503, + 537 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 529 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recog-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 525, + 211, + 537 + ], + "spans": [ + { + "bbox": [ + 115, + 525, + 211, + 537 + ], + "score": 1.0, + "content": "nition. In CVPR, 2016.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 106, + 544, + 504, + 568 + ], + "lines": [ + { + "bbox": [ + 106, + 544, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 544, + 505, + 557 + ], + "score": 1.0, + "content": "Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, and Ross Girshick. Momentum contrast for", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 556, + 361, + 568 + ], + "spans": [ + { + "bbox": [ + 115, + 556, + 361, + 568 + ], + "score": 1.0, + "content": "unsupervised visual representation learning. In CVPR, 2020.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 105, + 575, + 504, + 599 + ], + "lines": [ + { + "bbox": [ + 106, + 575, + 504, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 504, + 587 + ], + "score": 1.0, + "content": "Jonathan Ho, Nal Kalchbrenner, Dirk Weissenborn, and Tim Salimans. Axial attention in multidi-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 587, + 269, + 598 + ], + "spans": [ + { + "bbox": [ + 115, + 587, + 269, + 598 + ], + "score": 1.0, + "content": "mensional transformers. arXiv, 2019.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 104, + 606, + 505, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 506, + 620 + ], + "score": 1.0, + "content": "Han Hu, Jiayuan Gu, Zheng Zhang, Jifeng Dai, and Yichen Wei. Relation networks for object", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 617, + 225, + 629 + ], + "spans": [ + { + "bbox": [ + 116, + 617, + 225, + 629 + ], + "score": 1.0, + "content": "detection. In CVPR, 2018.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 105, + 636, + 504, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 650 + ], + "score": 1.0, + "content": "Han Hu, Zheng Zhang, Zhenda Xie, and Stephen Lin. Local relation networks for image recognition.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 647, + 179, + 659 + ], + "spans": [ + { + "bbox": [ + 115, + 647, + 179, + 659 + ], + "score": 1.0, + "content": "In ICCV, 2019.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 105, + 667, + 505, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 667, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 506, + 681 + ], + "score": 1.0, + "content": "Zilong Huang, Xinggang Wang, Yunchao Wei, Lichao Huang, Humphrey Shi, Wenyu Liu, and", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 117, + 678, + 482, + 692 + ], + "spans": [ + { + "bbox": [ + 117, + 678, + 482, + 692 + ], + "score": 1.0, + "content": "Thomas S. Huang. Ccnet: Criss-cross attention for semantic segmentation. In ICCV, 2020.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "score": 1.0, + "content": "Olivier J. Henaff, Aravind Srinivas, Jeffrey De Fauw, Ali Razavi, Carl Doersch, S. M. Ali Eslami,´", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "and Aaron van den Oord. Data-efficient image recognition with contrastive predictive coding. In", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 720, + 170, + 731 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 170, + 731 + ], + "score": 1.0, + "content": "ICML, 2020.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + } + ], + "page_idx": 9, + "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, + 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, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Alexei Baevski and Michael Auli. Adaptive input representations for neural language modeling. In", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 168, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 168, + 105 + ], + "score": 1.0, + "content": "ICLR, 2019.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 105 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 113, + 504, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 504, + 126 + ], + "score": 1.0, + "content": "I. Bello, B. Zoph, Q. Le, A. Vaswani, and J. Shlens. Attention augmented convolutional networks.", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 124, + 180, + 135 + ], + "spans": [ + { + "bbox": [ + 115, + 124, + 180, + 135 + ], + "score": 1.0, + "content": "In ICCV, 2019.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 113, + 504, + 135 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 143, + 504, + 166 + ], + "lines": [ + { + "bbox": [ + 106, + 143, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 505, + 156 + ], + "score": 1.0, + "content": "Lucas Beyer, Olivier J. Henaff, Alexander Kolesnikov, Xiaohua Zhai, and A ´ aron van den Oord. Are ¨", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 155, + 270, + 167 + ], + "spans": [ + { + "bbox": [ + 115, + 155, + 270, + 167 + ], + "score": 1.0, + "content": "we done with imagenet? arXiv, 2020.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 106, + 143, + 505, + 167 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 174, + 505, + 208 + ], + "lines": [ + { + "bbox": [ + 106, + 173, + 505, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 173, + 505, + 187 + ], + "score": 1.0, + "content": "Tom B Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 185, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 116, + 185, + 505, + 198 + ], + "score": 1.0, + "content": "Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. Language models are", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 197, + 243, + 208 + ], + "spans": [ + { + "bbox": [ + 116, + 197, + 243, + 208 + ], + "score": 1.0, + "content": "few-shot learners. arXiv, 2020.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 106, + 173, + 505, + 208 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 216, + 504, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 216, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 505, + 228 + ], + "score": 1.0, + "content": "Nicolas Carion, Francisco Massa, Gabriel Synnaeve, Nicolas Usunier, Alexander Kirillov, and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 116, + 227, + 452, + 239 + ], + "spans": [ + { + "bbox": [ + 116, + 227, + 452, + 239 + ], + "score": 1.0, + "content": "Sergey Zagoruyko. End-to-end object detection with transformers. In ECCV, 2020.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 106, + 216, + 505, + 239 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 246, + 504, + 270 + ], + "lines": [ + { + "bbox": [ + 105, + 246, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 246, + 505, + 260 + ], + "score": 1.0, + "content": "Mark Chen, Alec Radford, Rewon Child, Jeff Wu, and Heewoo Jun. Generative pretraining from", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 258, + 216, + 270 + ], + "spans": [ + { + "bbox": [ + 115, + 258, + 216, + 270 + ], + "score": 1.0, + "content": "pixels. In ICML, 2020a.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 246, + 505, + 270 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 277, + 504, + 300 + ], + "lines": [ + { + "bbox": [ + 106, + 277, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 277, + 505, + 290 + ], + "score": 1.0, + "content": "Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey E. Hinton. A simple framework", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 288, + 384, + 301 + ], + "spans": [ + { + "bbox": [ + 115, + 288, + 384, + 301 + ], + "score": 1.0, + "content": "for contrastive learning of visual representations. In ICML, 2020b.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 106, + 277, + 505, + 301 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 307, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "Yen-Chun Chen, Linjie Li, Licheng Yu, Ahmed El Kholy, Faisal Ahmed, Zhe Gan, Yu Cheng, and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 319, + 481, + 333 + ], + "spans": [ + { + "bbox": [ + 116, + 319, + 481, + 333 + ], + "score": 1.0, + "content": "Jingjing Liu. UNITER: UNiversal Image-TExt Representation Learning. In ECCV, 2020c.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 106, + 307, + 505, + 333 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 338, + 504, + 361 + ], + "lines": [ + { + "bbox": [ + 105, + 338, + 505, + 352 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 352 + ], + "score": 1.0, + "content": "Rewon Child, Scott Gray, Alec Radford, and Ilya Sutskever. Generating long sequences with sparse", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 350, + 225, + 361 + ], + "spans": [ + { + "bbox": [ + 115, + 350, + 225, + 361 + ], + "score": 1.0, + "content": "transformers. arXiv, 2019.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 338, + 505, + 361 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 369, + 504, + 392 + ], + "lines": [ + { + "bbox": [ + 105, + 369, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 383 + ], + "score": 1.0, + "content": "Jean-Baptiste Cordonnier, Andreas Loukas, and Martin Jaggi. On the relationship between self-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 381, + 319, + 392 + ], + "spans": [ + { + "bbox": [ + 116, + 381, + 319, + 392 + ], + "score": 1.0, + "content": "attention and convolutional layers. In ICLR, 2020.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 369, + 505, + 392 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 399, + 504, + 423 + ], + "lines": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 505, + 412 + ], + "score": 1.0, + "content": "J. Deng, W. Dong, R. Socher, L. Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale hierarchical", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 411, + 249, + 424 + ], + "spans": [ + { + "bbox": [ + 115, + 411, + 249, + 424 + ], + "score": 1.0, + "content": "image database. In CVPR, 2009.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 399, + 505, + 424 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 430, + 504, + 454 + ], + "lines": [ + { + "bbox": [ + 104, + 429, + 505, + 445 + ], + "spans": [ + { + "bbox": [ + 104, + 429, + 505, + 445 + ], + "score": 1.0, + "content": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. BERT: Pre-training of deep", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 441, + 408, + 455 + ], + "spans": [ + { + "bbox": [ + 116, + 441, + 408, + 455 + ], + "score": 1.0, + "content": "bidirectional transformers for language understanding. In NAACL, 2019.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 104, + 429, + 505, + 455 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 461, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 474 + ], + "score": 1.0, + "content": "Josip Djolonga, Jessica Yung, Michael Tschannen, Rob Romijnders, Lucas Beyer, Alexander", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 472, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 115, + 472, + 505, + 486 + ], + "score": 1.0, + "content": "Kolesnikov, Joan Puigcerver, Matthias Minderer, Alexander D’Amour, Dan Moldovan, Sylvan", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 116, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "Gelly, Neil Houlsby, Xiaohua Zhai, and Mario Lucic. On robustness and transferability of convo-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 495, + 271, + 506 + ], + "spans": [ + { + "bbox": [ + 116, + 495, + 271, + 506 + ], + "score": 1.0, + "content": "lutional neural networks. arXiv, 2020.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 462, + 505, + 506 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 514, + 503, + 537 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 529 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recog-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 525, + 211, + 537 + ], + "spans": [ + { + "bbox": [ + 115, + 525, + 211, + 537 + ], + "score": 1.0, + "content": "nition. In CVPR, 2016.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 511, + 505, + 537 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 544, + 504, + 568 + ], + "lines": [ + { + "bbox": [ + 106, + 544, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 544, + 505, + 557 + ], + "score": 1.0, + "content": "Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, and Ross Girshick. Momentum contrast for", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 556, + 361, + 568 + ], + "spans": [ + { + "bbox": [ + 115, + 556, + 361, + 568 + ], + "score": 1.0, + "content": "unsupervised visual representation learning. In CVPR, 2020.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 106, + 544, + 505, + 568 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 575, + 504, + 599 + ], + "lines": [ + { + "bbox": [ + 106, + 575, + 504, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 504, + 587 + ], + "score": 1.0, + "content": "Jonathan Ho, Nal Kalchbrenner, Dirk Weissenborn, and Tim Salimans. Axial attention in multidi-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 587, + 269, + 598 + ], + "spans": [ + { + "bbox": [ + 115, + 587, + 269, + 598 + ], + "score": 1.0, + "content": "mensional transformers. arXiv, 2019.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 106, + 575, + 504, + 598 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 606, + 505, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 506, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 506, + 620 + ], + "score": 1.0, + "content": "Han Hu, Jiayuan Gu, Zheng Zhang, Jifeng Dai, and Yichen Wei. Relation networks for object", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 617, + 225, + 629 + ], + "spans": [ + { + "bbox": [ + 116, + 617, + 225, + 629 + ], + "score": 1.0, + "content": "detection. In CVPR, 2018.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 605, + 506, + 629 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 636, + 504, + 660 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 650 + ], + "score": 1.0, + "content": "Han Hu, Zheng Zhang, Zhenda Xie, and Stephen Lin. Local relation networks for image recognition.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 647, + 179, + 659 + ], + "spans": [ + { + "bbox": [ + 115, + 647, + 179, + 659 + ], + "score": 1.0, + "content": "In ICCV, 2019.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 636, + 505, + 659 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 667, + 505, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 667, + 506, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 506, + 681 + ], + "score": 1.0, + "content": "Zilong Huang, Xinggang Wang, Yunchao Wei, Lichao Huang, Humphrey Shi, Wenyu Liu, and", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 117, + 678, + 482, + 692 + ], + "spans": [ + { + "bbox": [ + 117, + 678, + 482, + 692 + ], + "score": 1.0, + "content": "Thomas S. Huang. Ccnet: Criss-cross attention for semantic segmentation. In ICCV, 2020.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 667, + 506, + 692 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 504, + 711 + ], + "score": 1.0, + "content": "Olivier J. Henaff, Aravind Srinivas, Jeffrey De Fauw, Ali Razavi, Carl Doersch, S. M. Ali Eslami,´", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "and Aaron van den Oord. Data-efficient image recognition with contrastive predictive coding. In", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 720, + 170, + 731 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 170, + 731 + ], + "score": 1.0, + "content": "ICML, 2020.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 106, + 699, + 505, + 731 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 97 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 274, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 274, + 105 + ], + "score": 1.0, + "content": "reducing internal covariate shift. 2015.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 498, + 125 + ], + "lines": [ + { + "bbox": [ + 106, + 112, + 498, + 126 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 498, + 126 + ], + "score": 1.0, + "content": "Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In ICLR, 2015.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 105, + 131, + 504, + 155 + ], + "lines": [ + { + "bbox": [ + 106, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "Alexander Kolesnikov, Lucas Beyer, Xiaohua Zhai, Joan Puigcerver, Jessica Yung, Sylvain Gelly,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 142, + 494, + 156 + ], + "spans": [ + { + "bbox": [ + 115, + 142, + 494, + 156 + ], + "score": 1.0, + "content": "and Neil Houlsby. Big transfer (BiT): General visual representation learning. In ECCV, 2020.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 105, + 162, + 494, + 174 + ], + "lines": [ + { + "bbox": [ + 106, + 162, + 493, + 176 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 493, + 176 + ], + "score": 1.0, + "content": "Alex Krizhevsky. Learning multiple layers of features from tiny images. Technical report, 2009.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 105, + 181, + 504, + 204 + ], + "lines": [ + { + "bbox": [ + 106, + 180, + 504, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 180, + 504, + 194 + ], + "score": 1.0, + "content": "Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton. Imagenet classification with deep convo-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 192, + 280, + 204 + ], + "spans": [ + { + "bbox": [ + 116, + 192, + 280, + 204 + ], + "score": 1.0, + "content": "lutional neural networks. In NIPS, 2012.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 105, + 211, + 504, + 235 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 225 + ], + "score": 1.0, + "content": "Y. LeCun, B. Boser, J. Denker, D. Henderson, R. Howard, W. Hubbard, and L. Jackel. Backpropa-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 223, + 482, + 235 + ], + "spans": [ + { + "bbox": [ + 116, + 223, + 482, + 235 + ], + "score": 1.0, + "content": "gation applied to handwritten zip code recognition. Neural Computation, 1:541–551, 1989.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 108, + 241, + 504, + 276 + ], + "lines": [ + { + "bbox": [ + 105, + 240, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 255 + ], + "score": 1.0, + "content": "Dmitry Lepikhin, HyoukJoong Lee, Yuanzhong Xu, Dehao Chen, Orhan Firat, Yanping Huang,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 116, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "Maxim Krikun, Noam Shazeer, and Zhifeng Chen. Gshard: Scaling giant models with conditional", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 264, + 319, + 276 + ], + "spans": [ + { + "bbox": [ + 115, + 264, + 319, + 276 + ], + "score": 1.0, + "content": "computation and automatic sharding. arXiv, 2020.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 108, + 282, + 503, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "score": 1.0, + "content": "Liunian Harold Li, Mark Yatskar, Da Yin, Cho-Jui Hsieh, and Kai-Wei Chang. VisualBERT: A", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 294, + 415, + 307 + ], + "spans": [ + { + "bbox": [ + 116, + 294, + 415, + 307 + ], + "score": 1.0, + "content": "Simple and Performant Baseline for Vision and Language. In Arxiv, 2019.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 505, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 504, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 504, + 327 + ], + "score": 1.0, + "content": "Francesco Locatello, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 325, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 115, + 325, + 505, + 337 + ], + "score": 1.0, + "content": "Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. Object-centric learning with slot atten-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 335, + 190, + 347 + ], + "spans": [ + { + "bbox": [ + 116, + 335, + 190, + 347 + ], + "score": 1.0, + "content": "tion. arXiv, 2020.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 105, + 354, + 502, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 355, + 504, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 355, + 504, + 367 + ], + "score": 1.0, + "content": "Jiasen Lu, Dhruv Batra, Devi Parikh, and Stefan Lee. ViLBERT: Pretraining Task-Agnostic Visi-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 365, + 433, + 378 + ], + "spans": [ + { + "bbox": [ + 116, + 365, + 433, + 378 + ], + "score": 1.0, + "content": "olinguistic Representations for Vision-and-Language Tasks. In NeurIPS. 2019.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 106, + 384, + 505, + 419 + ], + "lines": [ + { + "bbox": [ + 106, + 385, + 504, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 504, + 397 + ], + "score": 1.0, + "content": "Dhruv Mahajan, Ross Girshick, Vignesh Ramanathan, Kaiming He, Manohar Paluri, Yixuan Li,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 396, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 116, + 396, + 505, + 408 + ], + "score": 1.0, + "content": "Ashwin Bharambe, and Laurens van der Maaten. Exploring the limits of weakly supervised", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 407, + 232, + 419 + ], + "spans": [ + { + "bbox": [ + 115, + 407, + 232, + 419 + ], + "score": 1.0, + "content": "pretraining. In ECCV, 2018.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 426, + 504, + 449 + ], + "lines": [ + { + "bbox": [ + 105, + 425, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 439 + ], + "score": 1.0, + "content": "M. Nilsback and A. Zisserman. Automated flower classification over a large number of classes. In", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 437, + 179, + 449 + ], + "spans": [ + { + "bbox": [ + 116, + 437, + 179, + 449 + ], + "score": 1.0, + "content": "ICVGIP, 2008.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 456, + 505, + 479 + ], + "lines": [ + { + "bbox": [ + 105, + 454, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 505, + 470 + ], + "score": 1.0, + "content": "Omkar M. Parkhi, Andrea Vedaldi, Andrew Zisserman, and C. V. Jawahar. Cats and dogs. In CVPR,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 466, + 144, + 480 + ], + "spans": [ + { + "bbox": [ + 114, + 466, + 144, + 480 + ], + "score": 1.0, + "content": "2012.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 104, + 486, + 505, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 486, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 499 + ], + "score": 1.0, + "content": "Niki Parmar, Ashish Vaswani, Jakob Uszkoreit, Lukasz Kaiser, Noam Shazeer, Alexander Ku, and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 498, + 314, + 509 + ], + "spans": [ + { + "bbox": [ + 116, + 498, + 314, + 509 + ], + "score": 1.0, + "content": "Dustin Tran. Image transformer. In ICML, 2018.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 108, + 516, + 504, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 506, + 530 + ], + "score": 1.0, + "content": "B. T. Polyak and A. B. Juditsky. Acceleration of stochastic approximation by averaging. SIAM", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 115, + 528, + 506, + 540 + ], + "score": 1.0, + "content": "Journal on Control and Optimization, 30(4):838–855, 1992. doi: 10.1137/0330046. URL", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 539, + 307, + 551 + ], + "spans": [ + { + "bbox": [ + 116, + 539, + 307, + 551 + ], + "score": 1.0, + "content": "https://doi.org/10.1137/0330046.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 104, + 558, + 505, + 581 + ], + "lines": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "Siyuan Qiao, Huiyu Wang, Chenxi Liu, Wei Shen, and Alan Yuille. Weight standardization. arXiv", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 114, + 569, + 254, + 581 + ], + "spans": [ + { + "bbox": [ + 114, + 569, + 254, + 581 + ], + "score": 1.0, + "content": "preprint arXiv:1903.10520, 2019.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 105, + 588, + 504, + 611 + ], + "lines": [ + { + "bbox": [ + 106, + 587, + 504, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 504, + 602 + ], + "score": 1.0, + "content": "Alec Radford, Karthik Narasimhan, Tim Salimans, and Ilya Sutskever. Improving language under-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 600, + 365, + 612 + ], + "spans": [ + { + "bbox": [ + 115, + 600, + 365, + 612 + ], + "score": 1.0, + "content": "standing with unsupervised learning. Technical Report, 2018.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 105, + 618, + 504, + 641 + ], + "lines": [ + { + "bbox": [ + 105, + 617, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 505, + 633 + ], + "score": 1.0, + "content": "Alec Radford, Jeff Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. Language", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 629, + 393, + 642 + ], + "spans": [ + { + "bbox": [ + 115, + 629, + 393, + 642 + ], + "score": 1.0, + "content": "models are unsupervised multitask learners. Technical Report, 2019.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 105, + 649, + 504, + 672 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 662 + ], + "score": 1.0, + "content": "Prajit Ramachandran, Niki Parmar, Ashish Vaswani, Irwan Bello, Anselm Levskaya, and Jon Shlens.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 660, + 368, + 671 + ], + "spans": [ + { + "bbox": [ + 116, + 660, + 368, + 671 + ], + "score": 1.0, + "content": "Stand-alone self-attention in vision models. In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 107, + 679, + 503, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "Chen Sun, Abhinav Shrivastava, Saurabh Singh, and Abhinav Gupta. Revisiting unreasonable ef-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 690, + 341, + 703 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 341, + 703 + ], + "score": 1.0, + "content": "fectiveness of data in deep learning era. In ICCV, 2017.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Chen Sun, Austin Myers, Carl Vondrick, Kevin Murphy, and Cordelia Schmid. Videobert: A joint", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 720, + 400, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 400, + 732 + ], + "score": 1.0, + "content": "model for video and language representation learning. In ICCV, 2019.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.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, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 97 + ], + "score": 1.0, + "content": "Sergey Ioffe and Christian Szegedy. Batch normalization: Accelerating deep network training by", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 274, + 105 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 274, + 105 + ], + "score": 1.0, + "content": "reducing internal covariate shift. 2015.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 105 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 112, + 498, + 125 + ], + "lines": [ + { + "bbox": [ + 106, + 112, + 498, + 126 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 498, + 126 + ], + "score": 1.0, + "content": "Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In ICLR, 2015.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 112, + 498, + 126 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 131, + 504, + 155 + ], + "lines": [ + { + "bbox": [ + 106, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "Alexander Kolesnikov, Lucas Beyer, Xiaohua Zhai, Joan Puigcerver, Jessica Yung, Sylvain Gelly,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 142, + 494, + 156 + ], + "spans": [ + { + "bbox": [ + 115, + 142, + 494, + 156 + ], + "score": 1.0, + "content": "and Neil Houlsby. Big transfer (BiT): General visual representation learning. In ECCV, 2020.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 106, + 132, + 505, + 156 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 162, + 494, + 174 + ], + "lines": [ + { + "bbox": [ + 106, + 162, + 493, + 176 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 493, + 176 + ], + "score": 1.0, + "content": "Alex Krizhevsky. Learning multiple layers of features from tiny images. Technical report, 2009.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 106, + 162, + 493, + 176 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 181, + 504, + 204 + ], + "lines": [ + { + "bbox": [ + 106, + 180, + 504, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 180, + 504, + 194 + ], + "score": 1.0, + "content": "Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton. Imagenet classification with deep convo-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 192, + 280, + 204 + ], + "spans": [ + { + "bbox": [ + 116, + 192, + 280, + 204 + ], + "score": 1.0, + "content": "lutional neural networks. In NIPS, 2012.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 106, + 180, + 504, + 204 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 211, + 504, + 235 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 225 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 225 + ], + "score": 1.0, + "content": "Y. LeCun, B. Boser, J. Denker, D. Henderson, R. Howard, W. Hubbard, and L. Jackel. Backpropa-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 223, + 482, + 235 + ], + "spans": [ + { + "bbox": [ + 116, + 223, + 482, + 235 + ], + "score": 1.0, + "content": "gation applied to handwritten zip code recognition. Neural Computation, 1:541–551, 1989.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 210, + 505, + 235 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 241, + 504, + 276 + ], + "lines": [ + { + "bbox": [ + 105, + 240, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 255 + ], + "score": 1.0, + "content": "Dmitry Lepikhin, HyoukJoong Lee, Yuanzhong Xu, Dehao Chen, Orhan Firat, Yanping Huang,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 253, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 116, + 253, + 505, + 266 + ], + "score": 1.0, + "content": "Maxim Krikun, Noam Shazeer, and Zhifeng Chen. Gshard: Scaling giant models with conditional", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 264, + 319, + 276 + ], + "spans": [ + { + "bbox": [ + 115, + 264, + 319, + 276 + ], + "score": 1.0, + "content": "computation and automatic sharding. arXiv, 2020.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 240, + 505, + 276 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 282, + 503, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 505, + 295 + ], + "score": 1.0, + "content": "Liunian Harold Li, Mark Yatskar, Da Yin, Cho-Jui Hsieh, and Kai-Wei Chang. VisualBERT: A", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 294, + 415, + 307 + ], + "spans": [ + { + "bbox": [ + 116, + 294, + 415, + 307 + ], + "score": 1.0, + "content": "Simple and Performant Baseline for Vision and Language. In Arxiv, 2019.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 282, + 505, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 313, + 505, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 311, + 504, + 327 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 504, + 327 + ], + "score": 1.0, + "content": "Francesco Locatello, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran, Georg Heigold,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 325, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 115, + 325, + 505, + 337 + ], + "score": 1.0, + "content": "Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. Object-centric learning with slot atten-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 335, + 190, + 347 + ], + "spans": [ + { + "bbox": [ + 116, + 335, + 190, + 347 + ], + "score": 1.0, + "content": "tion. arXiv, 2020.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 311, + 505, + 347 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 354, + 502, + 378 + ], + "lines": [ + { + "bbox": [ + 106, + 355, + 504, + 367 + ], + "spans": [ + { + "bbox": [ + 106, + 355, + 504, + 367 + ], + "score": 1.0, + "content": "Jiasen Lu, Dhruv Batra, Devi Parikh, and Stefan Lee. ViLBERT: Pretraining Task-Agnostic Visi-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 365, + 433, + 378 + ], + "spans": [ + { + "bbox": [ + 116, + 365, + 433, + 378 + ], + "score": 1.0, + "content": "olinguistic Representations for Vision-and-Language Tasks. In NeurIPS. 2019.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 106, + 355, + 504, + 378 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 384, + 505, + 419 + ], + "lines": [ + { + "bbox": [ + 106, + 385, + 504, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 385, + 504, + 397 + ], + "score": 1.0, + "content": "Dhruv Mahajan, Ross Girshick, Vignesh Ramanathan, Kaiming He, Manohar Paluri, Yixuan Li,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 396, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 116, + 396, + 505, + 408 + ], + "score": 1.0, + "content": "Ashwin Bharambe, and Laurens van der Maaten. Exploring the limits of weakly supervised", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 407, + 232, + 419 + ], + "spans": [ + { + "bbox": [ + 115, + 407, + 232, + 419 + ], + "score": 1.0, + "content": "pretraining. In ECCV, 2018.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 385, + 505, + 419 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 426, + 504, + 449 + ], + "lines": [ + { + "bbox": [ + 105, + 425, + 505, + 439 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 439 + ], + "score": 1.0, + "content": "M. Nilsback and A. Zisserman. Automated flower classification over a large number of classes. In", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 437, + 179, + 449 + ], + "spans": [ + { + "bbox": [ + 116, + 437, + 179, + 449 + ], + "score": 1.0, + "content": "ICVGIP, 2008.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 425, + 505, + 449 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 456, + 505, + 479 + ], + "lines": [ + { + "bbox": [ + 105, + 454, + 505, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 505, + 470 + ], + "score": 1.0, + "content": "Omkar M. Parkhi, Andrea Vedaldi, Andrew Zisserman, and C. V. Jawahar. Cats and dogs. In CVPR,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 114, + 466, + 144, + 480 + ], + "spans": [ + { + "bbox": [ + 114, + 466, + 144, + 480 + ], + "score": 1.0, + "content": "2012.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 454, + 505, + 480 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 486, + 505, + 510 + ], + "lines": [ + { + "bbox": [ + 105, + 486, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 505, + 499 + ], + "score": 1.0, + "content": "Niki Parmar, Ashish Vaswani, Jakob Uszkoreit, Lukasz Kaiser, Noam Shazeer, Alexander Ku, and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 498, + 314, + 509 + ], + "spans": [ + { + "bbox": [ + 116, + 498, + 314, + 509 + ], + "score": 1.0, + "content": "Dustin Tran. Image transformer. In ICML, 2018.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 486, + 505, + 509 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 516, + 504, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 516, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 506, + 530 + ], + "score": 1.0, + "content": "B. T. Polyak and A. B. Juditsky. Acceleration of stochastic approximation by averaging. SIAM", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 115, + 528, + 506, + 540 + ], + "score": 1.0, + "content": "Journal on Control and Optimization, 30(4):838–855, 1992. doi: 10.1137/0330046. URL", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 539, + 307, + 551 + ], + "spans": [ + { + "bbox": [ + 116, + 539, + 307, + 551 + ], + "score": 1.0, + "content": "https://doi.org/10.1137/0330046.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 516, + 506, + 551 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 558, + 505, + 581 + ], + "lines": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 505, + 570 + ], + "score": 1.0, + "content": "Siyuan Qiao, Huiyu Wang, Chenxi Liu, Wei Shen, and Alan Yuille. Weight standardization. arXiv", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 114, + 569, + 254, + 581 + ], + "spans": [ + { + "bbox": [ + 114, + 569, + 254, + 581 + ], + "score": 1.0, + "content": "preprint arXiv:1903.10520, 2019.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 106, + 558, + 505, + 581 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 588, + 504, + 611 + ], + "lines": [ + { + "bbox": [ + 106, + 587, + 504, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 504, + 602 + ], + "score": 1.0, + "content": "Alec Radford, Karthik Narasimhan, Tim Salimans, and Ilya Sutskever. Improving language under-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 600, + 365, + 612 + ], + "spans": [ + { + "bbox": [ + 115, + 600, + 365, + 612 + ], + "score": 1.0, + "content": "standing with unsupervised learning. Technical Report, 2018.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 106, + 587, + 504, + 612 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 618, + 504, + 641 + ], + "lines": [ + { + "bbox": [ + 105, + 617, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 505, + 633 + ], + "score": 1.0, + "content": "Alec Radford, Jeff Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. Language", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 629, + 393, + 642 + ], + "spans": [ + { + "bbox": [ + 115, + 629, + 393, + 642 + ], + "score": 1.0, + "content": "models are unsupervised multitask learners. Technical Report, 2019.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 617, + 505, + 642 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 649, + 504, + 672 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 662 + ], + "score": 1.0, + "content": "Prajit Ramachandran, Niki Parmar, Ashish Vaswani, Irwan Bello, Anselm Levskaya, and Jon Shlens.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 660, + 368, + 671 + ], + "spans": [ + { + "bbox": [ + 116, + 660, + 368, + 671 + ], + "score": 1.0, + "content": "Stand-alone self-attention in vision models. In NeurIPS, 2019.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 106, + 649, + 505, + 671 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 679, + 503, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "Chen Sun, Abhinav Shrivastava, Saurabh Singh, and Abhinav Gupta. Revisiting unreasonable ef-", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 690, + 341, + 703 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 341, + 703 + ], + "score": 1.0, + "content": "fectiveness of data in deep learning era. In ICCV, 2017.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 106, + 678, + 505, + 703 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Chen Sun, Austin Myers, Carl Vondrick, Kevin Murphy, and Cordelia Schmid. Videobert: A joint", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 720, + 400, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 400, + 732 + ], + "score": 1.0, + "content": "model for video and language representation learning. In ICCV, 2019.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 106, + 709, + 504, + 732 + ] + } + ] + }, + { + "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": "Hugo Touvron, Andrea Vedaldi, Matthijs Douze, and Herve Jegou. Fixing the train-test resolution", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 244, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 244, + 106 + ], + "score": 1.0, + "content": "discrepancy. In NeurIPS. 2019.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 105, + 111, + 504, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "Hugo Touvron, Andrea Vedaldi, Matthijs Douze, and Herve Jegou. Fixing the train-test resolution", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 123, + 395, + 136 + ], + "spans": [ + { + "bbox": [ + 116, + 123, + 395, + 136 + ], + "score": 1.0, + "content": "discrepancy: Fixefficientnet. arXiv preprint arXiv:2003.08237, 2020.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 106, + 142, + 505, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 142, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 506, + 155 + ], + "score": 1.0, + "content": "Michael Tschannen, Josip Djolonga, Marvin Ritter, Aravindh Mahendran, Neil Houlsby, Sylvain", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 505, + 165 + ], + "score": 1.0, + "content": "Gelly, and Mario Lucic. Self-supervised learning of video-induced visual invariances. In Pro-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 505, + 177 + ], + "score": 1.0, + "content": "ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), June", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 174, + 142, + 187 + ], + "spans": [ + { + "bbox": [ + 115, + 174, + 142, + 187 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 502, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 505, + 207 + ], + "score": 1.0, + "content": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 205, + 431, + 216 + ], + "spans": [ + { + "bbox": [ + 116, + 205, + 431, + 216 + ], + "score": 1.0, + "content": "Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. In NIPS, 2017.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 108, + 223, + 502, + 246 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "Huiyu Wang, Yukun Zhu, Bradley Green, Hartwig Adam, Alan Yuille, and Liang-Chieh Chen.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 235, + 469, + 248 + ], + "spans": [ + { + "bbox": [ + 115, + 235, + 469, + 248 + ], + "score": 1.0, + "content": "Axial-deeplab: Stand-alone axial-attention for panoptic segmentation. In ECCV, 2020a.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 253, + 505, + 287 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 505, + 267 + ], + "score": 1.0, + "content": "Huiyu Wang, Yukun Zhu, Bradley Green, Hartwig Adam, Alan Yuille, and Liang-Chieh", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 264, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 116, + 264, + 505, + 277 + ], + "score": 1.0, + "content": "Chen. Axial-deeplab: Stand-alone axial-attention for panoptic segmentation. arXiv preprint", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 276, + 223, + 286 + ], + "spans": [ + { + "bbox": [ + 115, + 276, + 223, + 286 + ], + "score": 1.0, + "content": "arXiv:2003.07853, 2020b.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 503, + 317 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "score": 1.0, + "content": "Qiang Wang, Bei Li, Tong Xiao, Jingbo Zhu, Changliang Li, Derek F. Wong, and Lidia S. Chao.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 306, + 414, + 317 + ], + "spans": [ + { + "bbox": [ + 115, + 306, + 414, + 317 + ], + "score": 1.0, + "content": "Learning deep transformer models for machine translation. In ACL, 2019.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 324, + 504, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 324, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 337 + ], + "score": 1.0, + "content": "Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaiming He. Non-local neural networks. In", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 334, + 172, + 347 + ], + "spans": [ + { + "bbox": [ + 115, + 334, + 172, + 347 + ], + "score": 1.0, + "content": "CVPR, 2018.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 107, + 354, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 105, + 353, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 367 + ], + "score": 1.0, + "content": "Dirk Weissenborn, Oscar Tackstr ¨ om, and Jakob Uszkoreit. Scaling autoregressive video models. In ¨", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 365, + 168, + 377 + ], + "spans": [ + { + "bbox": [ + 116, + 365, + 168, + 377 + ], + "score": 1.0, + "content": "ICLR, 2019.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 505, + 418 + ], + "lines": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "Bichen Wu, Chenfeng Xu, Xiaoliang Dai, Alvin Wan, Peizhao Zhang, Masayoshi Tomizuka, Kurt", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 115, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "Keutzer, and Peter Vajda. Visual transformers: Token-based image representation and processing", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 406, + 251, + 418 + ], + "spans": [ + { + "bbox": [ + 116, + 406, + 251, + 418 + ], + "score": 1.0, + "content": "for computer vision. arxiv, 2020.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 424, + 376, + 437 + ], + "lines": [ + { + "bbox": [ + 106, + 425, + 376, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 376, + 438 + ], + "score": 1.0, + "content": "Yuxin Wu and Kaiming He. Group normalization. In ECCV, 2018.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 444, + 504, + 467 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 505, + 457 + ], + "score": 1.0, + "content": "Qizhe Xie, Minh-Thang Luong, Eduard Hovy, and Quoc V. Le. Self-training with noisy student", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 456, + 318, + 466 + ], + "spans": [ + { + "bbox": [ + 116, + 456, + 318, + 466 + ], + "score": 1.0, + "content": "improves imagenet classification. In CVPR, 2020.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 504, + 497 + ], + "lines": [ + { + "bbox": [ + 106, + 473, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 473, + 390, + 487 + ], + "score": 1.0, + "content": "Xiaohua Zhai, Avital Oliver, Alexander Kolesnikov, and Lucas Beyer.", + "type": "text" + }, + { + "bbox": [ + 390, + 473, + 408, + 485 + ], + "score": 0.82, + "content": "\\mathrm { S ^ { 4 } L }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 473, + 505, + 487 + ], + "score": 1.0, + "content": ": Self-Supervised Semi-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 117, + 485, + 273, + 498 + ], + "spans": [ + { + "bbox": [ + 117, + 485, + 273, + 498 + ], + "score": 1.0, + "content": "Supervised Learning. In ICCV, 2019a.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 503, + 505, + 548 + ], + "lines": [ + { + "bbox": [ + 106, + 504, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 504, + 505, + 516 + ], + "score": 1.0, + "content": "Xiaohua Zhai, Joan Puigcerver, Alexander Kolesnikov, Pierre Ruyssen, Carlos Riquelme, Mario", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 515, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 115, + 515, + 505, + 527 + ], + "score": 1.0, + "content": "Lucic, Josip Djolonga, Andre Susano Pinto, Maxim Neumann, Alexey Dosovitskiy, et al. A", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 527, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 527, + 505, + 538 + ], + "score": 1.0, + "content": "large-scale study of representation learning with the visual task adaptation benchmark. arXiv", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 537, + 258, + 549 + ], + "spans": [ + { + "bbox": [ + 115, + 537, + 258, + 549 + ], + "score": 1.0, + "content": "preprint arXiv:1910.04867, 2019b.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 504, + 578 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "score": 1.0, + "content": "Hengshuang Zhao, Jiaya Jia, and Vladlen Koltun. Exploring self-attention for image recognition. In", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 565, + 172, + 579 + ], + "spans": [ + { + "bbox": [ + 116, + 565, + 172, + 579 + ], + "score": 1.0, + "content": "CVPR, 2020.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + } + ], + "page_idx": 11, + "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, + 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": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Hugo Touvron, Andrea Vedaldi, Matthijs Douze, and Herve Jegou. Fixing the train-test resolution", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 244, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 244, + 106 + ], + "score": 1.0, + "content": "discrepancy. In NeurIPS. 2019.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 111, + 504, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "Hugo Touvron, Andrea Vedaldi, Matthijs Douze, and Herve Jegou. Fixing the train-test resolution", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 123, + 395, + 136 + ], + "spans": [ + { + "bbox": [ + 116, + 123, + 395, + 136 + ], + "score": 1.0, + "content": "discrepancy: Fixefficientnet. arXiv preprint arXiv:2003.08237, 2020.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 111, + 505, + 136 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 142, + 505, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 142, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 506, + 155 + ], + "score": 1.0, + "content": "Michael Tschannen, Josip Djolonga, Marvin Ritter, Aravindh Mahendran, Neil Houlsby, Sylvain", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 153, + 505, + 165 + ], + "spans": [ + { + "bbox": [ + 116, + 153, + 505, + 165 + ], + "score": 1.0, + "content": "Gelly, and Mario Lucic. Self-supervised learning of video-induced visual invariances. In Pro-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 505, + 177 + ], + "score": 1.0, + "content": "ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), June", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 174, + 142, + 187 + ], + "spans": [ + { + "bbox": [ + 115, + 174, + 142, + 187 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 142, + 506, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 502, + 216 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 505, + 207 + ], + "score": 1.0, + "content": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 205, + 431, + 216 + ], + "spans": [ + { + "bbox": [ + 116, + 205, + 431, + 216 + ], + "score": 1.0, + "content": "Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. In NIPS, 2017.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 192, + 505, + 216 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 223, + 502, + 246 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "Huiyu Wang, Yukun Zhu, Bradley Green, Hartwig Adam, Alan Yuille, and Liang-Chieh Chen.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 235, + 469, + 248 + ], + "spans": [ + { + "bbox": [ + 115, + 235, + 469, + 248 + ], + "score": 1.0, + "content": "Axial-deeplab: Stand-alone axial-attention for panoptic segmentation. In ECCV, 2020a.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 106, + 222, + 505, + 248 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 253, + 505, + 287 + ], + "lines": [ + { + "bbox": [ + 106, + 253, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 505, + 267 + ], + "score": 1.0, + "content": "Huiyu Wang, Yukun Zhu, Bradley Green, Hartwig Adam, Alan Yuille, and Liang-Chieh", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 264, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 116, + 264, + 505, + 277 + ], + "score": 1.0, + "content": "Chen. Axial-deeplab: Stand-alone axial-attention for panoptic segmentation. arXiv preprint", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 276, + 223, + 286 + ], + "spans": [ + { + "bbox": [ + 115, + 276, + 223, + 286 + ], + "score": 1.0, + "content": "arXiv:2003.07853, 2020b.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 253, + 505, + 286 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 503, + 317 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "score": 1.0, + "content": "Qiang Wang, Bei Li, Tong Xiao, Jingbo Zhu, Changliang Li, Derek F. Wong, and Lidia S. Chao.", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 115, + 306, + 414, + 317 + ], + "spans": [ + { + "bbox": [ + 115, + 306, + 414, + 317 + ], + "score": 1.0, + "content": "Learning deep transformer models for machine translation. In ACL, 2019.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 106, + 294, + 505, + 317 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 324, + 504, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 324, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 337 + ], + "score": 1.0, + "content": "Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaiming He. Non-local neural networks. In", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 334, + 172, + 347 + ], + "spans": [ + { + "bbox": [ + 115, + 334, + 172, + 347 + ], + "score": 1.0, + "content": "CVPR, 2018.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 324, + 505, + 347 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 354, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 105, + 353, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 367 + ], + "score": 1.0, + "content": "Dirk Weissenborn, Oscar Tackstr ¨ om, and Jakob Uszkoreit. Scaling autoregressive video models. In ¨", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 365, + 168, + 377 + ], + "spans": [ + { + "bbox": [ + 116, + 365, + 168, + 377 + ], + "score": 1.0, + "content": "ICLR, 2019.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 353, + 505, + 377 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 384, + 505, + 418 + ], + "lines": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "Bichen Wu, Chenfeng Xu, Xiaoliang Dai, Alvin Wan, Peizhao Zhang, Masayoshi Tomizuka, Kurt", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 394, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 115, + 394, + 505, + 409 + ], + "score": 1.0, + "content": "Keutzer, and Peter Vajda. Visual transformers: Token-based image representation and processing", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 406, + 251, + 418 + ], + "spans": [ + { + "bbox": [ + 116, + 406, + 251, + 418 + ], + "score": 1.0, + "content": "for computer vision. arxiv, 2020.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 384, + 505, + 418 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 424, + 376, + 437 + ], + "lines": [ + { + "bbox": [ + 106, + 425, + 376, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 376, + 438 + ], + "score": 1.0, + "content": "Yuxin Wu and Kaiming He. Group normalization. In ECCV, 2018.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 106, + 425, + 376, + 438 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 444, + 504, + 467 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 505, + 457 + ], + "score": 1.0, + "content": "Qizhe Xie, Minh-Thang Luong, Eduard Hovy, and Quoc V. Le. Self-training with noisy student", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 456, + 318, + 466 + ], + "spans": [ + { + "bbox": [ + 116, + 456, + 318, + 466 + ], + "score": 1.0, + "content": "improves imagenet classification. In CVPR, 2020.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 442, + 505, + 466 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 504, + 497 + ], + "lines": [ + { + "bbox": [ + 106, + 473, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 473, + 390, + 487 + ], + "score": 1.0, + "content": "Xiaohua Zhai, Avital Oliver, Alexander Kolesnikov, and Lucas Beyer.", + "type": "text" + }, + { + "bbox": [ + 390, + 473, + 408, + 485 + ], + "score": 0.82, + "content": "\\mathrm { S ^ { 4 } L }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 473, + 505, + 487 + ], + "score": 1.0, + "content": ": Self-Supervised Semi-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 117, + 485, + 273, + 498 + ], + "spans": [ + { + "bbox": [ + 117, + 485, + 273, + 498 + ], + "score": 1.0, + "content": "Supervised Learning. In ICCV, 2019a.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 106, + 473, + 505, + 498 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 503, + 505, + 548 + ], + "lines": [ + { + "bbox": [ + 106, + 504, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 106, + 504, + 505, + 516 + ], + "score": 1.0, + "content": "Xiaohua Zhai, Joan Puigcerver, Alexander Kolesnikov, Pierre Ruyssen, Carlos Riquelme, Mario", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 515, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 115, + 515, + 505, + 527 + ], + "score": 1.0, + "content": "Lucic, Josip Djolonga, Andre Susano Pinto, Maxim Neumann, Alexey Dosovitskiy, et al. A", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 527, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 527, + 505, + 538 + ], + "score": 1.0, + "content": "large-scale study of representation learning with the visual task adaptation benchmark. arXiv", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 537, + 258, + 549 + ], + "spans": [ + { + "bbox": [ + 115, + 537, + 258, + 549 + ], + "score": 1.0, + "content": "preprint arXiv:1910.04867, 2019b.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 106, + 504, + 505, + 549 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 504, + 578 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 505, + 569 + ], + "score": 1.0, + "content": "Hengshuang Zhao, Jiaya Jia, and Vladlen Koltun. Exploring self-attention for image recognition. In", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 565, + 172, + 579 + ], + "spans": [ + { + "bbox": [ + 116, + 565, + 172, + 579 + ], + "score": 1.0, + "content": "CVPR, 2020.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 555, + 505, + 579 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 113, + 80, + 498, + 241 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 113, + 80, + 498, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 80, + 498, + 241 + ], + "spans": [ + { + "bbox": [ + 113, + 80, + 498, + 241 + ], + "score": 0.984, + "html": "
ModelsDatasetEpochsBase LRLR decayWeight decayDropout
ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
ViT-L/32JFT-300M76.10-4linear0.10.0
ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-H/14JFT-300M143.10-4linear0.10.0
R50x{1,2}JFT-300M710-3linear0.10.0
R101x1JFT-300M78.10-4linear0.10.0
R152x{1,2}JFT-300M76·10-4linear0.10.0
R50+ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
R50+ViT-L/32JFT-300M72.10-4linear0.10.0
R50+ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-B/{16,32}ImageNet-21k9010-3linear0.030.1
ViT-L/{16,32}ImageNet-21k30/9010-3linear0.030.1
ViT-*ImageNet3003.10-3cosine0.30.1
", + "type": "table", + "image_path": "7d941b1605bd3ff833d6ed38469200b2395418acd3d72e69d195f8e3da038595.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 113, + 80, + 498, + 133.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 113, + 133.66666666666666, + 498, + 187.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 113, + 187.33333333333331, + 498, + 240.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 108, + 250, + 503, + 284 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 250, + 504, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 504, + 262 + ], + "score": 1.0, + "content": "Table 3: Hyperparameters for training. All models are trained with a batch size of 4096 and learn-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 187, + 273 + ], + "score": 1.0, + "content": "ing rate warmup of", + "type": "text" + }, + { + "bbox": [ + 188, + 261, + 204, + 271 + ], + "score": 0.49, + "content": "1 0 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "steps. For ImageNet we found it beneficial to additionally apply gradient", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 272, + 321, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 272, + 321, + 284 + ], + "score": 1.0, + "content": "clipping at global norm 1. Training resolution is 224.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 108, + 302, + 161, + 314 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 162, + 316 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 162, + 316 + ], + "score": 1.0, + "content": "APPENDIX", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 109, + 328, + 284, + 341 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 286, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 286, + 342 + ], + "score": 1.0, + "content": "A MULTIHEAD SELF-ATTENTION", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 108, + 353, + 504, + 399 + ], + "lines": [ + { + "bbox": [ + 105, + 353, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 366 + ], + "score": 1.0, + "content": "Standard qkv self-attention (SA, Vaswani et al. (2017)) is a popular building block for neural archi-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 361, + 507, + 379 + ], + "spans": [ + { + "bbox": [ + 104, + 361, + 302, + 379 + ], + "score": 1.0, + "content": "tectures. For each element in an input sequence", + "type": "text" + }, + { + "bbox": [ + 302, + 363, + 349, + 375 + ], + "score": 0.91, + "content": "\\mathbf { z } \\in \\mathbb { R } ^ { N \\times \\dot { D } }", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 361, + 507, + 379 + ], + "score": 1.0, + "content": ", we compute a weighted sum over all", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 375, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 134, + 388 + ], + "score": 1.0, + "content": "values", + "type": "text" + }, + { + "bbox": [ + 135, + 377, + 142, + 385 + ], + "score": 0.56, + "content": "\\mathbf { v }", + "type": "inline_equation" + }, + { + "bbox": [ + 143, + 375, + 304, + 388 + ], + "score": 1.0, + "content": "in the sequence. The attention weights", + "type": "text" + }, + { + "bbox": [ + 304, + 376, + 320, + 388 + ], + "score": 0.9, + "content": "A _ { i j }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 375, + 506, + 388 + ], + "score": 1.0, + "content": "are based on the pairwise similarity between", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 387, + 455, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 331, + 400 + ], + "score": 1.0, + "content": "two elements of the sequence and their respective query", + "type": "text" + }, + { + "bbox": [ + 331, + 387, + 342, + 399 + ], + "score": 0.88, + "content": "\\mathbf { q } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 387, + 376, + 400 + ], + "score": 1.0, + "content": "and key", + "type": "text" + }, + { + "bbox": [ + 377, + 387, + 388, + 398 + ], + "score": 0.87, + "content": "\\mathbf { k } ^ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 387, + 455, + 400 + ], + "score": 1.0, + "content": "representations.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 403, + 446, + 456 + ], + "lines": [ + { + "bbox": [ + 165, + 403, + 446, + 456 + ], + "spans": [ + { + "bbox": [ + 165, + 403, + 446, + 456 + ], + "score": 0.88, + "content": "\\begin{array} { r l } { [ \\mathbf { q } , \\mathbf { k } , \\mathbf { v } ] = \\mathbf { z } \\mathbf { U } _ { q k v } \\qquad } & { \\mathbf { U } _ { q k v } \\in \\mathbb { R } ^ { D \\times 3 D _ { h } } , } \\\\ { A = \\mathrm { s o f t m a x } \\left( \\mathbf { q } \\mathbf { k } ^ { \\top } / \\sqrt { D _ { h } } \\right) \\qquad } & { A \\in \\mathbb { R } ^ { N \\times N } , } \\\\ { \\mathrm { S A } ( \\mathbf { z } ) = A \\mathbf { v } . } \\end{array}", + "type": "interline_equation", + "image_path": "1da1f364d75fdfc4a8f5dbae777361f9d6c874270178d305465c32e42f72c300.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 165, + 403, + 446, + 420.6666666666667 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 165, + 420.6666666666667, + 446, + 438.33333333333337 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 165, + 438.33333333333337, + 446, + 456.00000000000006 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 465, + 505, + 500 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 394, + 479 + ], + "score": 1.0, + "content": "Multihead self-attention (MSA) is an extension of SA in which we run", + "type": "text" + }, + { + "bbox": [ + 395, + 466, + 402, + 476 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 464, + 505, + 479 + ], + "score": 1.0, + "content": "self-attention operations,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "score": 1.0, + "content": "called “heads”, in parallel, and project their concatenated outputs. To keep compute and number of", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 487, + 403, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 251, + 500 + ], + "score": 1.0, + "content": "parameters constant when changing", + "type": "text" + }, + { + "bbox": [ + 252, + 488, + 258, + 497 + ], + "score": 0.64, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 488, + 262, + 500 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 262, + 488, + 276, + 499 + ], + "score": 0.69, + "content": "D _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 488, + 378, + 500 + ], + "score": 1.0, + "content": "(Eq. 5) is typically set to", + "type": "text" + }, + { + "bbox": [ + 379, + 487, + 398, + 500 + ], + "score": 0.92, + "content": "D / k", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 488, + 403, + 500 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 146, + 504, + 464, + 519 + ], + "lines": [ + { + "bbox": [ + 146, + 504, + 464, + 519 + ], + "spans": [ + { + "bbox": [ + 146, + 504, + 464, + 519 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\mathrm { M S A } ( \\mathbf { z } ) = [ \\mathrm { S A } _ { 1 } ( z ) ; \\mathrm { S A } _ { 2 } ( z ) ; \\cdots \\ ; \\mathrm { S A } _ { k } ( z ) ] \\mathbf { U } _ { m s a } \\qquad \\quad \\mathbf { U } _ { m s a } \\in \\mathbb { R } ^ { k \\cdot D _ { h } \\times D } } \\end{array}", + "type": "interline_equation", + "image_path": "260cab54c85b72b432d8f2ec7d038f6b09a5e36c13371e0600bf52c1aab642ee.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 146, + 504, + 464, + 519 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 533, + 243, + 546 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 244, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 244, + 548 + ], + "score": 1.0, + "content": "B EXPERIMENT DETAILS", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "title", + "bbox": [ + 107, + 558, + 178, + 570 + ], + "lines": [ + { + "bbox": [ + 105, + 557, + 178, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 178, + 572 + ], + "score": 1.0, + "content": "B.1 TRAINING", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 579, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 578, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 505, + 592 + ], + "score": 1.0, + "content": "Table 3 summarizes our training setups for our different models. We found strong regularization", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 590, + 504, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 504, + 603 + ], + "score": 1.0, + "content": "to be key when training models from scratch on ImageNet. Dropout, when used, is applied after", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "every dense layer except for the the qkv-projections and directly after adding positional- to patch", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 612, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 505, + 624 + ], + "score": 1.0, + "content": "embeddings. Hybrid models are trained with the exact setup as their ViT counterparts. Finally, all", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 623, + 245, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 245, + 636 + ], + "score": 1.0, + "content": "training is done on resolution 224.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "title", + "bbox": [ + 108, + 646, + 200, + 658 + ], + "lines": [ + { + "bbox": [ + 106, + 646, + 201, + 659 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 201, + 659 + ], + "score": 1.0, + "content": "B.1.1 FINE-TUNING", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 665, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "score": 1.0, + "content": "We fine-tune all ViT models using SGD with a momentum of 0.9. We run a small grid search over", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 675, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 506, + 690 + ], + "score": 1.0, + "content": "learning rates, see learning rate ranges in Table 4. To do so, we use small sub-splits from the training", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 124, + 700 + ], + "score": 1.0, + "content": "set (", + "type": "text" + }, + { + "bbox": [ + 124, + 688, + 144, + 698 + ], + "score": 0.85, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 687, + 233, + 700 + ], + "score": 1.0, + "content": "for Pets and Flowers,", + "type": "text" + }, + { + "bbox": [ + 233, + 688, + 248, + 698 + ], + "score": 0.84, + "content": "2 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 687, + 298, + 700 + ], + "score": 1.0, + "content": "for CIFAR,", + "type": "text" + }, + { + "bbox": [ + 298, + 688, + 313, + 698 + ], + "score": 0.84, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "ImageNet) as development set and train on the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "remaining data. For final results we train on the entire training set and evaluate on the respective", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "test data. For fine-tuning ResNets and hybrid models we use the exact same setup, with the only", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "exception of ImageNet where we add another value 0.06 to the learning rate sweep. Additionally,", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29.5 + } + ], + "page_idx": 12, + "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, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 113, + 80, + 498, + 241 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 113, + 80, + 498, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 113, + 80, + 498, + 241 + ], + "spans": [ + { + "bbox": [ + 113, + 80, + 498, + 241 + ], + "score": 0.984, + "html": "
ModelsDatasetEpochsBase LRLR decayWeight decayDropout
ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
ViT-L/32JFT-300M76.10-4linear0.10.0
ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-H/14JFT-300M143.10-4linear0.10.0
R50x{1,2}JFT-300M710-3linear0.10.0
R101x1JFT-300M78.10-4linear0.10.0
R152x{1,2}JFT-300M76·10-4linear0.10.0
R50+ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
R50+ViT-L/32JFT-300M72.10-4linear0.10.0
R50+ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-B/{16,32}ImageNet-21k9010-3linear0.030.1
ViT-L/{16,32}ImageNet-21k30/9010-3linear0.030.1
ViT-*ImageNet3003.10-3cosine0.30.1
", + "type": "table", + "image_path": "7d941b1605bd3ff833d6ed38469200b2395418acd3d72e69d195f8e3da038595.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 113, + 80, + 498, + 133.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 113, + 133.66666666666666, + 498, + 187.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 113, + 187.33333333333331, + 498, + 240.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 108, + 250, + 503, + 284 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 250, + 504, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 250, + 504, + 262 + ], + "score": 1.0, + "content": "Table 3: Hyperparameters for training. All models are trained with a batch size of 4096 and learn-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 187, + 273 + ], + "score": 1.0, + "content": "ing rate warmup of", + "type": "text" + }, + { + "bbox": [ + 188, + 261, + 204, + 271 + ], + "score": 0.49, + "content": "1 0 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "steps. For ImageNet we found it beneficial to additionally apply gradient", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 272, + 321, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 272, + 321, + 284 + ], + "score": 1.0, + "content": "clipping at global norm 1. Training resolution is 224.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 108, + 302, + 161, + 314 + ], + "lines": [ + { + "bbox": [ + 106, + 301, + 162, + 316 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 162, + 316 + ], + "score": 1.0, + "content": "APPENDIX", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 109, + 328, + 284, + 341 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 286, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 286, + 342 + ], + "score": 1.0, + "content": "A MULTIHEAD SELF-ATTENTION", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 108, + 353, + 504, + 399 + ], + "lines": [ + { + "bbox": [ + 105, + 353, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 366 + ], + "score": 1.0, + "content": "Standard qkv self-attention (SA, Vaswani et al. (2017)) is a popular building block for neural archi-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 361, + 507, + 379 + ], + "spans": [ + { + "bbox": [ + 104, + 361, + 302, + 379 + ], + "score": 1.0, + "content": "tectures. For each element in an input sequence", + "type": "text" + }, + { + "bbox": [ + 302, + 363, + 349, + 375 + ], + "score": 0.91, + "content": "\\mathbf { z } \\in \\mathbb { R } ^ { N \\times \\dot { D } }", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 361, + 507, + 379 + ], + "score": 1.0, + "content": ", we compute a weighted sum over all", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 375, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 134, + 388 + ], + "score": 1.0, + "content": "values", + "type": "text" + }, + { + "bbox": [ + 135, + 377, + 142, + 385 + ], + "score": 0.56, + "content": "\\mathbf { v }", + "type": "inline_equation" + }, + { + "bbox": [ + 143, + 375, + 304, + 388 + ], + "score": 1.0, + "content": "in the sequence. The attention weights", + "type": "text" + }, + { + "bbox": [ + 304, + 376, + 320, + 388 + ], + "score": 0.9, + "content": "A _ { i j }", + "type": "inline_equation" + }, + { + "bbox": [ + 320, + 375, + 506, + 388 + ], + "score": 1.0, + "content": "are based on the pairwise similarity between", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 387, + 455, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 331, + 400 + ], + "score": 1.0, + "content": "two elements of the sequence and their respective query", + "type": "text" + }, + { + "bbox": [ + 331, + 387, + 342, + 399 + ], + "score": 0.88, + "content": "\\mathbf { q } ^ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 387, + 376, + 400 + ], + "score": 1.0, + "content": "and key", + "type": "text" + }, + { + "bbox": [ + 377, + 387, + 388, + 398 + ], + "score": 0.87, + "content": "\\mathbf { k } ^ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 387, + 455, + 400 + ], + "score": 1.0, + "content": "representations.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 104, + 353, + 507, + 400 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 403, + 446, + 456 + ], + "lines": [ + { + "bbox": [ + 165, + 403, + 446, + 456 + ], + "spans": [ + { + "bbox": [ + 165, + 403, + 446, + 456 + ], + "score": 0.88, + "content": "\\begin{array} { r l } { [ \\mathbf { q } , \\mathbf { k } , \\mathbf { v } ] = \\mathbf { z } \\mathbf { U } _ { q k v } \\qquad } & { \\mathbf { U } _ { q k v } \\in \\mathbb { R } ^ { D \\times 3 D _ { h } } , } \\\\ { A = \\mathrm { s o f t m a x } \\left( \\mathbf { q } \\mathbf { k } ^ { \\top } / \\sqrt { D _ { h } } \\right) \\qquad } & { A \\in \\mathbb { R } ^ { N \\times N } , } \\\\ { \\mathrm { S A } ( \\mathbf { z } ) = A \\mathbf { v } . } \\end{array}", + "type": "interline_equation", + "image_path": "1da1f364d75fdfc4a8f5dbae777361f9d6c874270178d305465c32e42f72c300.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 165, + 403, + 446, + 420.6666666666667 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 165, + 420.6666666666667, + 446, + 438.33333333333337 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 165, + 438.33333333333337, + 446, + 456.00000000000006 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 465, + 505, + 500 + ], + "lines": [ + { + "bbox": [ + 105, + 464, + 505, + 479 + ], + "spans": [ + { + "bbox": [ + 105, + 464, + 394, + 479 + ], + "score": 1.0, + "content": "Multihead self-attention (MSA) is an extension of SA in which we run", + "type": "text" + }, + { + "bbox": [ + 395, + 466, + 402, + 476 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 464, + 505, + 479 + ], + "score": 1.0, + "content": "self-attention operations,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 505, + 489 + ], + "score": 1.0, + "content": "called “heads”, in parallel, and project their concatenated outputs. To keep compute and number of", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 487, + 403, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 251, + 500 + ], + "score": 1.0, + "content": "parameters constant when changing", + "type": "text" + }, + { + "bbox": [ + 252, + 488, + 258, + 497 + ], + "score": 0.64, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 488, + 262, + 500 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 262, + 488, + 276, + 499 + ], + "score": 0.69, + "content": "D _ { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 488, + 378, + 500 + ], + "score": 1.0, + "content": "(Eq. 5) is typically set to", + "type": "text" + }, + { + "bbox": [ + 379, + 487, + 398, + 500 + ], + "score": 0.92, + "content": "D / k", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 488, + 403, + 500 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 464, + 505, + 500 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 146, + 504, + 464, + 519 + ], + "lines": [ + { + "bbox": [ + 146, + 504, + 464, + 519 + ], + "spans": [ + { + "bbox": [ + 146, + 504, + 464, + 519 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\mathrm { M S A } ( \\mathbf { z } ) = [ \\mathrm { S A } _ { 1 } ( z ) ; \\mathrm { S A } _ { 2 } ( z ) ; \\cdots \\ ; \\mathrm { S A } _ { k } ( z ) ] \\mathbf { U } _ { m s a } \\qquad \\quad \\mathbf { U } _ { m s a } \\in \\mathbb { R } ^ { k \\cdot D _ { h } \\times D } } \\end{array}", + "type": "interline_equation", + "image_path": "260cab54c85b72b432d8f2ec7d038f6b09a5e36c13371e0600bf52c1aab642ee.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 146, + 504, + 464, + 519 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 533, + 243, + 546 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 244, + 548 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 244, + 548 + ], + "score": 1.0, + "content": "B EXPERIMENT DETAILS", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "title", + "bbox": [ + 107, + 558, + 178, + 570 + ], + "lines": [ + { + "bbox": [ + 105, + 557, + 178, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 178, + 572 + ], + "score": 1.0, + "content": "B.1 TRAINING", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 579, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 578, + 505, + 592 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 505, + 592 + ], + "score": 1.0, + "content": "Table 3 summarizes our training setups for our different models. We found strong regularization", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 590, + 504, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 504, + 603 + ], + "score": 1.0, + "content": "to be key when training models from scratch on ImageNet. Dropout, when used, is applied after", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "every dense layer except for the the qkv-projections and directly after adding positional- to patch", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 612, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 505, + 624 + ], + "score": 1.0, + "content": "embeddings. Hybrid models are trained with the exact setup as their ViT counterparts. Finally, all", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 623, + 245, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 245, + 636 + ], + "score": 1.0, + "content": "training is done on resolution 224.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 578, + 505, + 636 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 646, + 200, + 658 + ], + "lines": [ + { + "bbox": [ + 106, + 646, + 201, + 659 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 201, + 659 + ], + "score": 1.0, + "content": "B.1.1 FINE-TUNING", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 665, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 505, + 678 + ], + "score": 1.0, + "content": "We fine-tune all ViT models using SGD with a momentum of 0.9. We run a small grid search over", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 675, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 506, + 690 + ], + "score": 1.0, + "content": "learning rates, see learning rate ranges in Table 4. To do so, we use small sub-splits from the training", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 124, + 700 + ], + "score": 1.0, + "content": "set (", + "type": "text" + }, + { + "bbox": [ + 124, + 688, + 144, + 698 + ], + "score": 0.85, + "content": "10 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 687, + 233, + 700 + ], + "score": 1.0, + "content": "for Pets and Flowers,", + "type": "text" + }, + { + "bbox": [ + 233, + 688, + 248, + 698 + ], + "score": 0.84, + "content": "2 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 687, + 298, + 700 + ], + "score": 1.0, + "content": "for CIFAR,", + "type": "text" + }, + { + "bbox": [ + 298, + 688, + 313, + 698 + ], + "score": 0.84, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "ImageNet) as development set and train on the", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "remaining data. For final results we train on the entire training set and evaluate on the respective", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "test data. For fine-tuning ResNets and hybrid models we use the exact same setup, with the only", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "exception of ImageNet where we add another value 0.06 to the learning rate sweep. Additionally,", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29.5, + "bbox_fs": [ + 105, + 664, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 191, + 80, + 420, + 163 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 191, + 80, + 420, + 163 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 191, + 80, + 420, + 163 + ], + "spans": [ + { + "bbox": [ + 191, + 80, + 420, + 163 + ], + "score": 0.978, + "html": "
DatasetStepsBase LR
ImageNet20000{0.003,0.01,0.03, 0.06}
CIFAR10010000{0.001,0.003,0.01,0.03}
CIFAR1010000{0.001,0.003,0.01, 0.03}
Oxford-IIITPets500{0.001,0.003,0.01,0.03}
Oxford Flowers-102500{0.001, 0.003,0.01, 0.03}
VTAB (19 tasks)25000.01
", + "type": "table", + "image_path": "539d3396c473a3f1c36b0b514c86cc27c72c1e8f24f1be19f653d4373d937dad.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 191, + 80, + 420, + 93.83333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 191, + 93.83333333333333, + 420, + 107.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 191, + 107.66666666666666, + 420, + 121.49999999999999 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 191, + 121.49999999999999, + 420, + 135.33333333333331 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 191, + 135.33333333333331, + 420, + 149.16666666666666 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 191, + 149.16666666666666, + 420, + 163.0 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 171, + 504, + 204 + ], + "lines": [ + { + "bbox": [ + 105, + 170, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 185 + ], + "score": 1.0, + "content": "Table 4: Hyperparameters for fine-tuning. All models are fine-tuned with cosine learning rate decay,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 182, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 195 + ], + "score": 1.0, + "content": "a batch size of 512, no weight decay, and grad clipping at global norm 1. If not mentioned otherwise,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 192, + 224, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 224, + 205 + ], + "score": 1.0, + "content": "fine-tuning resolution is 384.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 272 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "for ResNets we also run the setup of Kolesnikov et al. (2020) and select the best results across", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 239, + 505, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 505, + 251 + ], + "score": 1.0, + "content": "this run and our sweep. Finally, if not mentioned otherwise, all fine-tuning experiments run at 384", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "score": 1.0, + "content": "resolution (running fine-tuning at different resolution than training is common practice (Kolesnikov", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 261, + 162, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 162, + 273 + ], + "score": 1.0, + "content": "et al., 2020)).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 108, + 278, + 503, + 311 + ], + "lines": [ + { + "bbox": [ + 106, + 278, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 278, + 505, + 291 + ], + "score": 1.0, + "content": "When transferring ViT models to another dataset, we remove the whole head (two linear layers) and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 290, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 290, + 505, + 302 + ], + "score": 1.0, + "content": "replace it by a single, zero-initialized linear layer outputting the number of classes required by the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 299, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 314 + ], + "score": 1.0, + "content": "target dataset. We found this to be a little more robust than simply re-initializing the very last layer.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 317, + 505, + 383 + ], + "lines": [ + { + "bbox": [ + 105, + 316, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 505, + 330 + ], + "score": 1.0, + "content": "For VTAB we follow the protocol in Kolesnikov et al. (2020), and use the same hyperparameter", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 328, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 328, + 505, + 340 + ], + "score": 1.0, + "content": "setting for all tasks. We use a learning rate of 0.01 and train for 2500 steps (Tab. 4). We chose this", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 338, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 506, + 353 + ], + "score": 1.0, + "content": "setting by running a small sweep over two learning rates and two schedules, and selecting the setting", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 349, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 363 + ], + "score": 1.0, + "content": "with the highest VTAB score on the 200-example validation sets. We follow the pre-processing used", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 361, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 373 + ], + "score": 1.0, + "content": "in Kolesnikov et al. (2020), except that we do not use task-specific input resolutions. Instead we find", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 371, + 453, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 352, + 383 + ], + "score": 1.0, + "content": "that Vision Transformer benefits most from a high resolution", + "type": "text" + }, + { + "bbox": [ + 353, + 372, + 400, + 383 + ], + "score": 0.87, + "content": "( 3 8 4 \\times 3 8 4 )", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 371, + 453, + 383 + ], + "score": 1.0, + "content": "for all tasks.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 108, + 399, + 223, + 410 + ], + "lines": [ + { + "bbox": [ + 106, + 398, + 225, + 412 + ], + "spans": [ + { + "bbox": [ + 106, + 398, + 225, + 412 + ], + "score": 1.0, + "content": "B.1.2 SELF-SUPERVISION", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 419, + 505, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "We employ the masked patch prediction objective for preliminary self-supervision experiments. To", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 431, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 177, + 444 + ], + "score": 1.0, + "content": "do so we corrupt", + "type": "text" + }, + { + "bbox": [ + 178, + 431, + 198, + 442 + ], + "score": 0.86, + "content": "50 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 431, + 505, + 444 + ], + "score": 1.0, + "content": "of patch embeddings by either replacing their embeddings with a learnable", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 441, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 194, + 455 + ], + "score": 1.0, + "content": "[mask] embedding", + "type": "text" + }, + { + "bbox": [ + 195, + 442, + 220, + 453 + ], + "score": 0.89, + "content": "( 8 0 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 441, + 366, + 455 + ], + "score": 1.0, + "content": ", a random other patch embedding", + "type": "text" + }, + { + "bbox": [ + 366, + 442, + 392, + 453 + ], + "score": 0.86, + "content": "( 1 0 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 441, + 505, + 455 + ], + "score": 1.0, + "content": "or just keeping them as is", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 453, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 107, + 453, + 132, + 464 + ], + "score": 0.87, + "content": "( 1 0 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 453, + 505, + 466 + ], + "score": 1.0, + "content": ". This setup is very similar to the one used for language by Devlin et al. (2019). Finally, we", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 463, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 463, + 506, + 477 + ], + "score": 1.0, + "content": "predict the 3-bit, mean color (i.e., 512 colors in total) of every corrupted patch using their respective", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 475, + 196, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 196, + 487 + ], + "score": 1.0, + "content": "patch representations.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 491, + 505, + 590 + ], + "lines": [ + { + "bbox": [ + 106, + 492, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 506, + 505 + ], + "score": 1.0, + "content": "We trained our self-supervised model for 1M steps (ca. 14 epochs) with batch size 4096 on JFT. We", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 501, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 261, + 516 + ], + "score": 1.0, + "content": "use Adam, with a base learning rate of", + "type": "text" + }, + { + "bbox": [ + 261, + 502, + 293, + 513 + ], + "score": 0.9, + "content": "2 \\cdot 1 0 ^ { - 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 501, + 342, + 516 + ], + "score": 1.0, + "content": ", warmup of", + "type": "text" + }, + { + "bbox": [ + 342, + 503, + 358, + 513 + ], + "score": 0.43, + "content": "1 0 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 501, + 505, + 516 + ], + "score": 1.0, + "content": "steps and cosine learning rate decay.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 513, + 506, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 506, + 527 + ], + "score": 1.0, + "content": "As prediction targets for pretraining we tried the following settings: 1) predicting only the mean,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 523, + 504, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 342, + 538 + ], + "score": 1.0, + "content": "3bit color (i.e., 1 prediction of 512 colors), 2) predicting a", + "type": "text" + }, + { + "bbox": [ + 342, + 525, + 366, + 535 + ], + "score": 0.89, + "content": "4 \\times 4", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 523, + 470, + 538 + ], + "score": 1.0, + "content": "downsized version of the", + "type": "text" + }, + { + "bbox": [ + 470, + 525, + 504, + 535 + ], + "score": 0.89, + "content": "1 6 \\times 1 6", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 535, + 506, + 548 + ], + "spans": [ + { + "bbox": [ + 104, + 535, + 506, + 548 + ], + "score": 1.0, + "content": "patch with 3bit colors in parallel (i.e., 16 predictions of 512 colors), 3) regression on the full patch", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 546, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 505, + 560 + ], + "score": 1.0, + "content": "using L2 (i.e., 256 regressions on the 3 RGB channels). Surprisingly, we found that all worked quite", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 557, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 506, + 570 + ], + "score": 1.0, + "content": "well, though L2 was slightly worse. We report final results only for option 1) because it has shown", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 328, + 581 + ], + "score": 1.0, + "content": "best few-shot performance. We also experimented with", + "type": "text" + }, + { + "bbox": [ + 329, + 569, + 348, + 579 + ], + "score": 0.87, + "content": "15 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 568, + 505, + 581 + ], + "score": 1.0, + "content": "corruption rate as used by Devlin et al.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 580, + 377, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 377, + 591 + ], + "score": 1.0, + "content": "(2019) but results were also slightly worse on our few-shot metrics.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 504, + 651 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "Lastly, we would like to remark that our instantiation of masked patch prediction doesn’t require", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 608, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 619 + ], + "score": 1.0, + "content": "such an enormous amount of pretraining nor a large dataset such as JFT in order to lead to sim-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 618, + 505, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 505, + 630 + ], + "score": 1.0, + "content": "ilar performance gains on ImageNet classification. That is, we observed diminishing returns on", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 234, + 643 + ], + "score": 1.0, + "content": "downstream performance after", + "type": "text" + }, + { + "bbox": [ + 235, + 630, + 256, + 640 + ], + "score": 0.59, + "content": "1 0 0 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 628, + 506, + 643 + ], + "score": 1.0, + "content": "pretraining steps, and see similar gains when pretraining on", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 640, + 151, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 151, + 653 + ], + "score": 1.0, + "content": "ImageNet.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40 + }, + { + "type": "title", + "bbox": [ + 107, + 671, + 244, + 684 + ], + "lines": [ + { + "bbox": [ + 106, + 670, + 246, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 246, + 686 + ], + "score": 1.0, + "content": "C ADDITIONAL RESULTS", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "We report detailed results corresponding to the figures presented in the paper. Table 5 corresponds", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "to Figure 3 from the paper and shows transfer performance of different ViT models pre-trained", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "on datasets of increasing size: ImageNet, ImageNet-21k, and JFT-300M. Table 6 corresponds to", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45 + } + ], + "page_idx": 13, + "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": "14", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 191, + 80, + 420, + 163 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 191, + 80, + 420, + 163 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 191, + 80, + 420, + 163 + ], + "spans": [ + { + "bbox": [ + 191, + 80, + 420, + 163 + ], + "score": 0.978, + "html": "
DatasetStepsBase LR
ImageNet20000{0.003,0.01,0.03, 0.06}
CIFAR10010000{0.001,0.003,0.01,0.03}
CIFAR1010000{0.001,0.003,0.01, 0.03}
Oxford-IIITPets500{0.001,0.003,0.01,0.03}
Oxford Flowers-102500{0.001, 0.003,0.01, 0.03}
VTAB (19 tasks)25000.01
", + "type": "table", + "image_path": "539d3396c473a3f1c36b0b514c86cc27c72c1e8f24f1be19f653d4373d937dad.jpg" + } + ] + } + ], + "index": 2.5, + "virtual_lines": [ + { + "bbox": [ + 191, + 80, + 420, + 93.83333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 191, + 93.83333333333333, + 420, + 107.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 191, + 107.66666666666666, + 420, + 121.49999999999999 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 191, + 121.49999999999999, + 420, + 135.33333333333331 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 191, + 135.33333333333331, + 420, + 149.16666666666666 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 191, + 149.16666666666666, + 420, + 163.0 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 171, + 504, + 204 + ], + "lines": [ + { + "bbox": [ + 105, + 170, + 506, + 185 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 185 + ], + "score": 1.0, + "content": "Table 4: Hyperparameters for fine-tuning. All models are fine-tuned with cosine learning rate decay,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 182, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 506, + 195 + ], + "score": 1.0, + "content": "a batch size of 512, no weight decay, and grad clipping at global norm 1. If not mentioned otherwise,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 192, + 224, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 224, + 205 + ], + "score": 1.0, + "content": "fine-tuning resolution is 384.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 170, + 506, + 205 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 505, + 272 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "for ResNets we also run the setup of Kolesnikov et al. (2020) and select the best results across", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 239, + 505, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 505, + 251 + ], + "score": 1.0, + "content": "this run and our sweep. Finally, if not mentioned otherwise, all fine-tuning experiments run at 384", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 505, + 263 + ], + "score": 1.0, + "content": "resolution (running fine-tuning at different resolution than training is common practice (Kolesnikov", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 261, + 162, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 162, + 273 + ], + "score": 1.0, + "content": "et al., 2020)).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 227, + 505, + 273 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 278, + 503, + 311 + ], + "lines": [ + { + "bbox": [ + 106, + 278, + 505, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 278, + 505, + 291 + ], + "score": 1.0, + "content": "When transferring ViT models to another dataset, we remove the whole head (two linear layers) and", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 290, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 290, + 505, + 302 + ], + "score": 1.0, + "content": "replace it by a single, zero-initialized linear layer outputting the number of classes required by the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 299, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 314 + ], + "score": 1.0, + "content": "target dataset. We found this to be a little more robust than simply re-initializing the very last layer.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 278, + 505, + 314 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 317, + 505, + 383 + ], + "lines": [ + { + "bbox": [ + 105, + 316, + 505, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 316, + 505, + 330 + ], + "score": 1.0, + "content": "For VTAB we follow the protocol in Kolesnikov et al. (2020), and use the same hyperparameter", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 328, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 328, + 505, + 340 + ], + "score": 1.0, + "content": "setting for all tasks. We use a learning rate of 0.01 and train for 2500 steps (Tab. 4). We chose this", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 338, + 506, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 506, + 353 + ], + "score": 1.0, + "content": "setting by running a small sweep over two learning rates and two schedules, and selecting the setting", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 349, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 105, + 349, + 505, + 363 + ], + "score": 1.0, + "content": "with the highest VTAB score on the 200-example validation sets. We follow the pre-processing used", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 361, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 105, + 361, + 505, + 373 + ], + "score": 1.0, + "content": "in Kolesnikov et al. (2020), except that we do not use task-specific input resolutions. Instead we find", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 371, + 453, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 352, + 383 + ], + "score": 1.0, + "content": "that Vision Transformer benefits most from a high resolution", + "type": "text" + }, + { + "bbox": [ + 353, + 372, + 400, + 383 + ], + "score": 0.87, + "content": "( 3 8 4 \\times 3 8 4 )", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 371, + 453, + 383 + ], + "score": 1.0, + "content": "for all tasks.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 316, + 506, + 383 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 399, + 223, + 410 + ], + "lines": [ + { + "bbox": [ + 106, + 398, + 225, + 412 + ], + "spans": [ + { + "bbox": [ + 106, + 398, + 225, + 412 + ], + "score": 1.0, + "content": "B.1.2 SELF-SUPERVISION", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 419, + 505, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 106, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "We employ the masked patch prediction objective for preliminary self-supervision experiments. To", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 431, + 505, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 431, + 177, + 444 + ], + "score": 1.0, + "content": "do so we corrupt", + "type": "text" + }, + { + "bbox": [ + 178, + 431, + 198, + 442 + ], + "score": 0.86, + "content": "50 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 431, + 505, + 444 + ], + "score": 1.0, + "content": "of patch embeddings by either replacing their embeddings with a learnable", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 441, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 194, + 455 + ], + "score": 1.0, + "content": "[mask] embedding", + "type": "text" + }, + { + "bbox": [ + 195, + 442, + 220, + 453 + ], + "score": 0.89, + "content": "( 8 0 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 441, + 366, + 455 + ], + "score": 1.0, + "content": ", a random other patch embedding", + "type": "text" + }, + { + "bbox": [ + 366, + 442, + 392, + 453 + ], + "score": 0.86, + "content": "( 1 0 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 441, + 505, + 455 + ], + "score": 1.0, + "content": "or just keeping them as is", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 453, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 107, + 453, + 132, + 464 + ], + "score": 0.87, + "content": "( 1 0 \\% )", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 453, + 505, + 466 + ], + "score": 1.0, + "content": ". This setup is very similar to the one used for language by Devlin et al. (2019). Finally, we", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 463, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 105, + 463, + 506, + 477 + ], + "score": 1.0, + "content": "predict the 3-bit, mean color (i.e., 512 colors in total) of every corrupted patch using their respective", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 475, + 196, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 196, + 487 + ], + "score": 1.0, + "content": "patch representations.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 420, + 506, + 487 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 491, + 505, + 590 + ], + "lines": [ + { + "bbox": [ + 106, + 492, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 106, + 492, + 506, + 505 + ], + "score": 1.0, + "content": "We trained our self-supervised model for 1M steps (ca. 14 epochs) with batch size 4096 on JFT. We", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 501, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 261, + 516 + ], + "score": 1.0, + "content": "use Adam, with a base learning rate of", + "type": "text" + }, + { + "bbox": [ + 261, + 502, + 293, + 513 + ], + "score": 0.9, + "content": "2 \\cdot 1 0 ^ { - 4 }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 501, + 342, + 516 + ], + "score": 1.0, + "content": ", warmup of", + "type": "text" + }, + { + "bbox": [ + 342, + 503, + 358, + 513 + ], + "score": 0.43, + "content": "1 0 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 501, + 505, + 516 + ], + "score": 1.0, + "content": "steps and cosine learning rate decay.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 513, + 506, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 506, + 527 + ], + "score": 1.0, + "content": "As prediction targets for pretraining we tried the following settings: 1) predicting only the mean,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 523, + 504, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 342, + 538 + ], + "score": 1.0, + "content": "3bit color (i.e., 1 prediction of 512 colors), 2) predicting a", + "type": "text" + }, + { + "bbox": [ + 342, + 525, + 366, + 535 + ], + "score": 0.89, + "content": "4 \\times 4", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 523, + 470, + 538 + ], + "score": 1.0, + "content": "downsized version of the", + "type": "text" + }, + { + "bbox": [ + 470, + 525, + 504, + 535 + ], + "score": 0.89, + "content": "1 6 \\times 1 6", + "type": "inline_equation" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 535, + 506, + 548 + ], + "spans": [ + { + "bbox": [ + 104, + 535, + 506, + 548 + ], + "score": 1.0, + "content": "patch with 3bit colors in parallel (i.e., 16 predictions of 512 colors), 3) regression on the full patch", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 546, + 505, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 505, + 560 + ], + "score": 1.0, + "content": "using L2 (i.e., 256 regressions on the 3 RGB channels). Surprisingly, we found that all worked quite", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 557, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 506, + 570 + ], + "score": 1.0, + "content": "well, though L2 was slightly worse. We report final results only for option 1) because it has shown", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 568, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 328, + 581 + ], + "score": 1.0, + "content": "best few-shot performance. We also experimented with", + "type": "text" + }, + { + "bbox": [ + 329, + 569, + 348, + 579 + ], + "score": 0.87, + "content": "15 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 568, + 505, + 581 + ], + "score": 1.0, + "content": "corruption rate as used by Devlin et al.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 580, + 377, + 591 + ], + "spans": [ + { + "bbox": [ + 106, + 580, + 377, + 591 + ], + "score": 1.0, + "content": "(2019) but results were also slightly worse on our few-shot metrics.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33, + "bbox_fs": [ + 104, + 492, + 506, + 591 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 504, + 651 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "Lastly, we would like to remark that our instantiation of masked patch prediction doesn’t require", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 608, + 505, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 608, + 505, + 619 + ], + "score": 1.0, + "content": "such an enormous amount of pretraining nor a large dataset such as JFT in order to lead to sim-", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 618, + 505, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 505, + 630 + ], + "score": 1.0, + "content": "ilar performance gains on ImageNet classification. That is, we observed diminishing returns on", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 628, + 506, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 628, + 234, + 643 + ], + "score": 1.0, + "content": "downstream performance after", + "type": "text" + }, + { + "bbox": [ + 235, + 630, + 256, + 640 + ], + "score": 0.59, + "content": "1 0 0 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 628, + 506, + 643 + ], + "score": 1.0, + "content": "pretraining steps, and see similar gains when pretraining on", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 640, + 151, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 640, + 151, + 653 + ], + "score": 1.0, + "content": "ImageNet.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 596, + 506, + 653 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 671, + 244, + 684 + ], + "lines": [ + { + "bbox": [ + 106, + 670, + 246, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 670, + 246, + 686 + ], + "score": 1.0, + "content": "C ADDITIONAL RESULTS", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "We report detailed results corresponding to the figures presented in the paper. Table 5 corresponds", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "to Figure 3 from the paper and shows transfer performance of different ViT models pre-trained", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 720, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 734 + ], + "score": 1.0, + "content": "on datasets of increasing size: ImageNet, ImageNet-21k, and JFT-300M. Table 6 corresponds to", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 698, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 109, + 80, + 505, + 303 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 109, + 80, + 505, + 303 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 80, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 109, + 80, + 505, + 303 + ], + "score": 0.984, + "html": "
ViT-B/16ViT-B/32ViT-L/16ViT-L/32ViT-H/14
ImageNetCIFAR-1098.1397.7797.8697.94
CIFAR-10087.1386.3186.3587.07
ImageNet77.9173.3876.5371.16
ImageNet ReaL83.5779.5682.1977.83
Oxford Flowers-10289.4985.4389.6686.36
Oxford-IIIT-Pets93.8192.0493.6491.35■
ImageNet-21kCIFAR-1098.9598.7999.1699.1399.27
CIFAR-10091.6791.9793.4493.0493.82
ImageNet83.9781.2885.1580.9985.13
ImageNet ReaL88.3586.6388.4085.6588.70
Oxford Flowers-102 Oxford-IIIT-Pets99.3899.1199.6199.1999.51
94.4393.0294.7393.0994.82
JFT-300MCIFAR-1099.0098.6199.3899.1999.50
CIFAR-10091.8790.4994.0492.5294.55
ImageNet84.1580.7387.1284.3788.04
ImageNet ReaL88.8586.2789.9988.2890.33
Oxford Flowers-10299.5699.2799.5699.4599.68
Oxford-IIIT-Pets95.8093.4097.1195.8397.56
", + "type": "table", + "image_path": "ab3d26a8a4e72ec0d96ea954cfce7ae1eb4bd7f7a26ec84824f229550efbbf31.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 80, + 505, + 154.33333333333331 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 154.33333333333331, + 505, + 228.66666666666663 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 228.66666666666663, + 505, + 302.99999999999994 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 311, + 505, + 356 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 218, + 324 + ], + "score": 1.0, + "content": "Table 5: Top1 accuracy (in", + "type": "text" + }, + { + "bbox": [ + 218, + 312, + 228, + 322 + ], + "score": 0.69, + "content": "\\%", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 311, + 505, + 324 + ], + "score": 1.0, + "content": ") of Vision Transformer on various datasets when pre-trained on Im-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "score": 1.0, + "content": "ageNet, ImageNet-21k or JFT300M. These values correspond to Figure 3 in the main text. Models", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "score": 1.0, + "content": "are fine-tuned at 384 resolution. Note that the ImageNet results are computed without additional", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 344, + 475, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 475, + 357 + ], + "score": 1.0, + "content": "techniques (Polyak averaging and 512 resolution images) used to achieve results in Table 2.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "table", + "bbox": [ + 107, + 366, + 504, + 550 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 107, + 366, + 504, + 550 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 107, + 366, + 504, + 550 + ], + "spans": [ + { + "bbox": [ + 107, + 366, + 504, + 550 + ], + "score": 0.984, + "html": "
ModelEpochsImageNetImageNet ReaLCIFAR-10CIFAR-100PetsFlowersexaFLOPs
ViT-B/32780.7386.2798.6190.4993.4099.27164
ViT-B/16784.1588.8599.0091.8795.8099.56743
ViT-L/32784.3788.2899.1992.5295.8399.45574
ViT-L/16786.3089.4399.3893.4696.8199.662586
ViT-L/161487.1289.9999.3894.0497.1199.565172
ViT-H/141488.0890.3699.5094.7197.1199.7112826
ResNet50x1777.5484.5697.6786.0791.1194.26150
ResNet50x2782.1287.9498.2989.2093.4397.02592
ResNet101x1780.6787.0798.4889.1794.0895.95285
ResNet152x1781.8887.9698.8290.2294.1796.94427
ResNet152x2784.9789.6999.0692.0595.3798.621681
ResNet152x21485.5689.8999.2491.9295.7598.753362
ResNet200x31487.2290.1599.3493.5396.3299.0410212
R50x1+ViT-B/32784.9089.1599.0192.2495.7599.46315
R50x1+ViT-B/16785.5889.6599.1492.6396.6599.40855
R50x1+ViT-L/32785.6889.0499.2492.9396.9799.43725
R50x1+ViT-L/16786.6089.7299.1893.6497.0399.402704
R50x1+ViT-L/161487.1289.7699.3193.8997.3699.115165
", + "type": "table", + "image_path": "134baea4a353f3499e076c9e408c6a26c3d680f1bc59a3bc262c55357306a1ee.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 107, + 366, + 504, + 427.3333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 107, + 427.3333333333333, + 504, + 488.66666666666663 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 107, + 488.66666666666663, + 504, + 550.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 105, + 559, + 504, + 581 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 557, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 505, + 572 + ], + "score": 1.0, + "content": "Table 6: Detailed results of model scaling experiments. These correspond to Figure 5 in the main", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 570, + 135, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 135, + 584 + ], + "score": 1.0, + "content": "paper.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + } + ], + "index": 9.25 + }, + { + "type": "text", + "bbox": [ + 108, + 602, + 504, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "Figure 5 from the paper and shows the transfer performance of ViT, ResNet, and hybrid models of", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 613, + 418, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 418, + 627 + ], + "score": 1.0, + "content": "varying size, as well as the estimated computational cost of their pre-training.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "title", + "bbox": [ + 108, + 642, + 254, + 654 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 255, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 255, + 656 + ], + "score": 1.0, + "content": "D ADDITIONAL ANALYSES", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 108, + 666, + 265, + 678 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 266, + 679 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 266, + 679 + ], + "score": 1.0, + "content": "D.1 SGD VS. ADAM FOR RESNETS", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "ResNets are typically trained with SGD and our use of Adam as optimizer is quite unconventional.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "Here we show the experiments that motivated this choice. Namely, we compare the fine-tuning", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 277, + 722 + ], + "score": 1.0, + "content": "performance of two ResNets – 50x1 and", + "type": "text" + }, + { + "bbox": [ + 277, + 710, + 304, + 720 + ], + "score": 0.32, + "content": "1 5 2 \\mathrm { x } 2 ", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "– pre-trained on JFT with SGD and Adam. For", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "SGD, we use the hyperparameters recommended by Kolesnikov et al. (2020). Results are presented", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + } + ], + "page_idx": 14, + "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": [ + 301, + 751, + 311, + 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": [ + 109, + 80, + 505, + 303 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 109, + 80, + 505, + 303 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 80, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 109, + 80, + 505, + 303 + ], + "score": 0.984, + "html": "
ViT-B/16ViT-B/32ViT-L/16ViT-L/32ViT-H/14
ImageNetCIFAR-1098.1397.7797.8697.94
CIFAR-10087.1386.3186.3587.07
ImageNet77.9173.3876.5371.16
ImageNet ReaL83.5779.5682.1977.83
Oxford Flowers-10289.4985.4389.6686.36
Oxford-IIIT-Pets93.8192.0493.6491.35■
ImageNet-21kCIFAR-1098.9598.7999.1699.1399.27
CIFAR-10091.6791.9793.4493.0493.82
ImageNet83.9781.2885.1580.9985.13
ImageNet ReaL88.3586.6388.4085.6588.70
Oxford Flowers-102 Oxford-IIIT-Pets99.3899.1199.6199.1999.51
94.4393.0294.7393.0994.82
JFT-300MCIFAR-1099.0098.6199.3899.1999.50
CIFAR-10091.8790.4994.0492.5294.55
ImageNet84.1580.7387.1284.3788.04
ImageNet ReaL88.8586.2789.9988.2890.33
Oxford Flowers-10299.5699.2799.5699.4599.68
Oxford-IIIT-Pets95.8093.4097.1195.8397.56
", + "type": "table", + "image_path": "ab3d26a8a4e72ec0d96ea954cfce7ae1eb4bd7f7a26ec84824f229550efbbf31.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 80, + 505, + 154.33333333333331 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 154.33333333333331, + 505, + 228.66666666666663 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 228.66666666666663, + 505, + 302.99999999999994 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 311, + 505, + 356 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 218, + 324 + ], + "score": 1.0, + "content": "Table 5: Top1 accuracy (in", + "type": "text" + }, + { + "bbox": [ + 218, + 312, + 228, + 322 + ], + "score": 0.69, + "content": "\\%", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 311, + 505, + 324 + ], + "score": 1.0, + "content": ") of Vision Transformer on various datasets when pre-trained on Im-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 322, + 506, + 334 + ], + "score": 1.0, + "content": "ageNet, ImageNet-21k or JFT300M. These values correspond to Figure 3 in the main text. Models", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 345 + ], + "score": 1.0, + "content": "are fine-tuned at 384 resolution. Note that the ImageNet results are computed without additional", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 344, + 475, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 475, + 357 + ], + "score": 1.0, + "content": "techniques (Polyak averaging and 512 resolution images) used to achieve results in Table 2.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "table", + "bbox": [ + 107, + 366, + 504, + 550 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 107, + 366, + 504, + 550 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 107, + 366, + 504, + 550 + ], + "spans": [ + { + "bbox": [ + 107, + 366, + 504, + 550 + ], + "score": 0.984, + "html": "
ModelEpochsImageNetImageNet ReaLCIFAR-10CIFAR-100PetsFlowersexaFLOPs
ViT-B/32780.7386.2798.6190.4993.4099.27164
ViT-B/16784.1588.8599.0091.8795.8099.56743
ViT-L/32784.3788.2899.1992.5295.8399.45574
ViT-L/16786.3089.4399.3893.4696.8199.662586
ViT-L/161487.1289.9999.3894.0497.1199.565172
ViT-H/141488.0890.3699.5094.7197.1199.7112826
ResNet50x1777.5484.5697.6786.0791.1194.26150
ResNet50x2782.1287.9498.2989.2093.4397.02592
ResNet101x1780.6787.0798.4889.1794.0895.95285
ResNet152x1781.8887.9698.8290.2294.1796.94427
ResNet152x2784.9789.6999.0692.0595.3798.621681
ResNet152x21485.5689.8999.2491.9295.7598.753362
ResNet200x31487.2290.1599.3493.5396.3299.0410212
R50x1+ViT-B/32784.9089.1599.0192.2495.7599.46315
R50x1+ViT-B/16785.5889.6599.1492.6396.6599.40855
R50x1+ViT-L/32785.6889.0499.2492.9396.9799.43725
R50x1+ViT-L/16786.6089.7299.1893.6497.0399.402704
R50x1+ViT-L/161487.1289.7699.3193.8997.3699.115165
", + "type": "table", + "image_path": "134baea4a353f3499e076c9e408c6a26c3d680f1bc59a3bc262c55357306a1ee.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 107, + 366, + 504, + 427.3333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 107, + 427.3333333333333, + 504, + 488.66666666666663 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 107, + 488.66666666666663, + 504, + 550.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 105, + 559, + 504, + 581 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 557, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 557, + 505, + 572 + ], + "score": 1.0, + "content": "Table 6: Detailed results of model scaling experiments. These correspond to Figure 5 in the main", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 570, + 135, + 584 + ], + "spans": [ + { + "bbox": [ + 105, + 570, + 135, + 584 + ], + "score": 1.0, + "content": "paper.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + } + ], + "index": 9.25 + }, + { + "type": "text", + "bbox": [ + 108, + 602, + 504, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 614 + ], + "score": 1.0, + "content": "Figure 5 from the paper and shows the transfer performance of ViT, ResNet, and hybrid models of", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 613, + 418, + 627 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 418, + 627 + ], + "score": 1.0, + "content": "varying size, as well as the estimated computational cost of their pre-training.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 601, + 505, + 627 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 642, + 254, + 654 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 255, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 255, + 656 + ], + "score": 1.0, + "content": "D ADDITIONAL ANALYSES", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 108, + 666, + 265, + 678 + ], + "lines": [ + { + "bbox": [ + 106, + 666, + 266, + 679 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 266, + 679 + ], + "score": 1.0, + "content": "D.1 SGD VS. ADAM FOR RESNETS", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "ResNets are typically trained with SGD and our use of Adam as optimizer is quite unconventional.", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "Here we show the experiments that motivated this choice. Namely, we compare the fine-tuning", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 277, + 722 + ], + "score": 1.0, + "content": "performance of two ResNets – 50x1 and", + "type": "text" + }, + { + "bbox": [ + 277, + 710, + 304, + 720 + ], + "score": 0.32, + "content": "1 5 2 \\mathrm { x } 2 ", + "type": "inline_equation" + }, + { + "bbox": [ + 304, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "– pre-trained on JFT with SGD and Adam. For", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "SGD, we use the hyperparameters recommended by Kolesnikov et al. (2020). Results are presented", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "in Table 7. Adam pre-training outperforms SGD pre-training on most datasets and on average.", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 393, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 393, + 505, + 405 + ], + "score": 1.0, + "content": "This justifies the choice of Adam as the optimizer used to pre-train ResNets on JFT. Note that the", + "type": "text", + "cross_page": true + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 403, + 505, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 505, + 416 + ], + "score": 1.0, + "content": "absolute numbers are lower than those reported by Kolesnikov et al. (2020), since we pre-train only", + "type": "text", + "cross_page": true + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 415, + 191, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 191, + 427 + ], + "score": 1.0, + "content": "for 7 epochs, not 30.", + "type": "text", + "cross_page": true + } + ], + "index": 15 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 688, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 195, + 80, + 416, + 173 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 195, + 80, + 416, + 173 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 195, + 80, + 416, + 173 + ], + "spans": [ + { + "bbox": [ + 195, + 80, + 416, + 173 + ], + "score": 0.972, + "html": "
ResNet50ResNet152x2
DatasetAdamSGDAdamSGD
ImageNet77.5478.2484.9784.37
CIFAR1097.6797.4699.0699.07
CIFAR10086.0785.1792.0591.06
Oxford-IIITPets91.1191.0095.3794.79
Oxford Flowers-10294.2692.0698.6299.32
Average89.3388.7994.0193.72
", + "type": "table", + "image_path": "8f4739d4a918cdaacfc06290ad5d13b7721fadc74eb53be9c6959bb125449f02.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 195, + 80, + 416, + 93.28571428571429 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 195, + 93.28571428571429, + 416, + 106.57142857142858 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 195, + 106.57142857142858, + 416, + 119.85714285714288 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 195, + 119.85714285714288, + 416, + 133.14285714285717 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 195, + 133.14285714285717, + 416, + 146.42857142857144 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 195, + 146.42857142857144, + 416, + 159.71428571428572 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 195, + 159.71428571428572, + 416, + 173.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 164, + 181, + 446, + 193 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 164, + 180, + 446, + 194 + ], + "spans": [ + { + "bbox": [ + 164, + 180, + 446, + 194 + ], + "score": 1.0, + "content": "Table 7: Fine-tuning ResNet models pre-trained with Adam and SGD.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + } + ], + "index": 5.0 + }, + { + "type": "image", + "bbox": [ + 108, + 207, + 487, + 332 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 207, + 487, + 332 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 207, + 487, + 332 + ], + "spans": [ + { + "bbox": [ + 108, + 207, + 487, + 332 + ], + "score": 0.969, + "type": "image", + "image_path": "087590a6ace2243bc302d256c0334466601d635e411a4191b5cb851d0b812782.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 108, + 207, + 487, + 248.66666666666666 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 108, + 248.66666666666666, + 487, + 290.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 108, + 290.3333333333333, + 487, + 332.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 160, + 348, + 451, + 359 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 159, + 346, + 452, + 361 + ], + "spans": [ + { + "bbox": [ + 159, + 346, + 452, + 361 + ], + "score": 1.0, + "content": "Figure 8: Scaling different model dimensions of the Vision Transformer.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + } + ], + "index": 10.0 + }, + { + "type": "text", + "bbox": [ + 107, + 381, + 505, + 426 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "in Table 7. Adam pre-training outperforms SGD pre-training on most datasets and on average.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 393, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 393, + 505, + 405 + ], + "score": 1.0, + "content": "This justifies the choice of Adam as the optimizer used to pre-train ResNets on JFT. Note that the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 403, + 505, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 505, + 416 + ], + "score": 1.0, + "content": "absolute numbers are lower than those reported by Kolesnikov et al. (2020), since we pre-train only", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 415, + 191, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 415, + 191, + 427 + ], + "score": 1.0, + "content": "for 7 epochs, not 30.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "title", + "bbox": [ + 108, + 441, + 230, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 441, + 231, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 231, + 454 + ], + "score": 1.0, + "content": "D.2 TRANSFORMER SHAPE", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 463, + 505, + 584 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "We ran ablations on scaling different dimensions of the Transformer architecture to find out which", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "are best suited for scaling to very large models. Figure 8 shows 5-shot performance on ImageNet", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 457, + 497 + ], + "score": 1.0, + "content": "for different configurations. All configurations are based on a ViT model with 8 layers,", + "type": "text" + }, + { + "bbox": [ + 458, + 485, + 501, + 496 + ], + "score": 0.88, + "content": "D = 1 0 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 484, + 505, + 497 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 107, + 496, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 107, + 496, + 173, + 507 + ], + "score": 0.9, + "content": "D _ { M L P } = 2 0 4 8", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 496, + 505, + 510 + ], + "score": 1.0, + "content": "and a patch size of 32, the intersection of all lines. We can see that scaling the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 506, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 506, + 520 + ], + "score": 1.0, + "content": "depth results in the biggest improvements which are clearly visible up until 64 layers. However,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "diminishing returns are already visible after 16 layers. Interestingly, scaling the width of the net-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "work seems to result in the smallest changes. Decreasing the patch size and thus increasing the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "effective sequence length shows surprisingly robust improvements without introducing parameters.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 551, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 506, + 563 + ], + "score": 1.0, + "content": "These findings suggest that compute might be a better predictor of performance than the number of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 561, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 575 + ], + "score": 1.0, + "content": "parameters, and that scaling should emphasize depth over width if any. Overall, we find that scaling", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 573, + 354, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 354, + 586 + ], + "score": 1.0, + "content": "all dimensions proportionally results in robust improvements.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 22 + }, + { + "type": "title", + "bbox": [ + 108, + 599, + 243, + 611 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 244, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 244, + 612 + ], + "score": 1.0, + "content": "D.3 POSITIONAL EMBEDDING", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 620, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 620, + 505, + 634 + ], + "score": 1.0, + "content": "We ran ablations on different ways of encoding spatial information using positional embedding. We", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 632, + 209, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 209, + 645 + ], + "score": 1.0, + "content": "tried the following cases:", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 133, + 653, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 132, + 654, + 465, + 668 + ], + "spans": [ + { + "bbox": [ + 132, + 654, + 465, + 668 + ], + "score": 1.0, + "content": "• Providing no positional information: Considering the inputs as a bag of patches.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 132, + 669, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 132, + 669, + 505, + 685 + ], + "score": 1.0, + "content": "• 1-dimensional positional embedding: Considering the inputs as a sequence of patches in", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 681, + 410, + 695 + ], + "spans": [ + { + "bbox": [ + 141, + 681, + 410, + 695 + ], + "score": 1.0, + "content": "the raster order (default across all other experiments in this paper).", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 133, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 133, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "• 2-dimensional positional embedding: Considering the inputs as a grid of patches in two", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 141, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "dimensions. In this case, two sets of embeddings are learned, each for one of the axes,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 142, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 142, + 721, + 153, + 730 + ], + "score": 0.78, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 721, + 222, + 733 + ], + "score": 1.0, + "content": "-embedding, and", + "type": "text" + }, + { + "bbox": [ + 222, + 721, + 231, + 730 + ], + "score": 0.79, + "content": "Y", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 721, + 343, + 733 + ], + "score": 1.0, + "content": "-embedding, each with size", + "type": "text" + }, + { + "bbox": [ + 343, + 721, + 362, + 732 + ], + "score": 0.87, + "content": "D / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 721, + 505, + 733 + ], + "score": 1.0, + "content": ". Then, based on the coordinate on", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 33.5 + } + ], + "page_idx": 15, + "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": [ + 301, + 751, + 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": "table", + "bbox": [ + 195, + 80, + 416, + 173 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 195, + 80, + 416, + 173 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 195, + 80, + 416, + 173 + ], + "spans": [ + { + "bbox": [ + 195, + 80, + 416, + 173 + ], + "score": 0.972, + "html": "
ResNet50ResNet152x2
DatasetAdamSGDAdamSGD
ImageNet77.5478.2484.9784.37
CIFAR1097.6797.4699.0699.07
CIFAR10086.0785.1792.0591.06
Oxford-IIITPets91.1191.0095.3794.79
Oxford Flowers-10294.2692.0698.6299.32
Average89.3388.7994.0193.72
", + "type": "table", + "image_path": "8f4739d4a918cdaacfc06290ad5d13b7721fadc74eb53be9c6959bb125449f02.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 195, + 80, + 416, + 93.28571428571429 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 195, + 93.28571428571429, + 416, + 106.57142857142858 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 195, + 106.57142857142858, + 416, + 119.85714285714288 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 195, + 119.85714285714288, + 416, + 133.14285714285717 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 195, + 133.14285714285717, + 416, + 146.42857142857144 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 195, + 146.42857142857144, + 416, + 159.71428571428572 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 195, + 159.71428571428572, + 416, + 173.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 164, + 181, + 446, + 193 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 164, + 180, + 446, + 194 + ], + "spans": [ + { + "bbox": [ + 164, + 180, + 446, + 194 + ], + "score": 1.0, + "content": "Table 7: Fine-tuning ResNet models pre-trained with Adam and SGD.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + } + ], + "index": 5.0 + }, + { + "type": "image", + "bbox": [ + 108, + 207, + 487, + 332 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 207, + 487, + 332 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 207, + 487, + 332 + ], + "spans": [ + { + "bbox": [ + 108, + 207, + 487, + 332 + ], + "score": 0.969, + "type": "image", + "image_path": "087590a6ace2243bc302d256c0334466601d635e411a4191b5cb851d0b812782.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 108, + 207, + 487, + 248.66666666666666 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 108, + 248.66666666666666, + 487, + 290.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 108, + 290.3333333333333, + 487, + 332.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 160, + 348, + 451, + 359 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 159, + 346, + 452, + 361 + ], + "spans": [ + { + "bbox": [ + 159, + 346, + 452, + 361 + ], + "score": 1.0, + "content": "Figure 8: Scaling different model dimensions of the Vision Transformer.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + } + ], + "index": 10.0 + }, + { + "type": "text", + "bbox": [ + 107, + 381, + 505, + 426 + ], + "lines": [], + "index": 13.5, + "bbox_fs": [ + 105, + 381, + 505, + 427 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 441, + 230, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 441, + 231, + 454 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 231, + 454 + ], + "score": 1.0, + "content": "D.2 TRANSFORMER SHAPE", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 107, + 463, + 505, + 584 + ], + "lines": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "We ran ablations on scaling different dimensions of the Transformer architecture to find out which", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "are best suited for scaling to very large models. Figure 8 shows 5-shot performance on ImageNet", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 484, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 457, + 497 + ], + "score": 1.0, + "content": "for different configurations. All configurations are based on a ViT model with 8 layers,", + "type": "text" + }, + { + "bbox": [ + 458, + 485, + 501, + 496 + ], + "score": 0.88, + "content": "D = 1 0 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 484, + 505, + 497 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 107, + 496, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 107, + 496, + 173, + 507 + ], + "score": 0.9, + "content": "D _ { M L P } = 2 0 4 8", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 496, + 505, + 510 + ], + "score": 1.0, + "content": "and a patch size of 32, the intersection of all lines. We can see that scaling the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 506, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 506, + 520 + ], + "score": 1.0, + "content": "depth results in the biggest improvements which are clearly visible up until 64 layers. However,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "diminishing returns are already visible after 16 layers. Interestingly, scaling the width of the net-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "work seems to result in the smallest changes. Decreasing the patch size and thus increasing the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "effective sequence length shows surprisingly robust improvements without introducing parameters.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 551, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 506, + 563 + ], + "score": 1.0, + "content": "These findings suggest that compute might be a better predictor of performance than the number of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 561, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 575 + ], + "score": 1.0, + "content": "parameters, and that scaling should emphasize depth over width if any. Overall, we find that scaling", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 573, + 354, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 354, + 586 + ], + "score": 1.0, + "content": "all dimensions proportionally results in robust improvements.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 463, + 506, + 586 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 599, + 243, + 611 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 244, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 244, + 612 + ], + "score": 1.0, + "content": "D.3 POSITIONAL EMBEDDING", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 621, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 620, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 106, + 620, + 505, + 634 + ], + "score": 1.0, + "content": "We ran ablations on different ways of encoding spatial information using positional embedding. We", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 632, + 209, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 209, + 645 + ], + "score": 1.0, + "content": "tried the following cases:", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 620, + 505, + 645 + ] + }, + { + "type": "text", + "bbox": [ + 133, + 653, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 132, + 654, + 465, + 668 + ], + "spans": [ + { + "bbox": [ + 132, + 654, + 465, + 668 + ], + "score": 1.0, + "content": "• Providing no positional information: Considering the inputs as a bag of patches.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 132, + 669, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 132, + 669, + 505, + 685 + ], + "score": 1.0, + "content": "• 1-dimensional positional embedding: Considering the inputs as a sequence of patches in", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 141, + 681, + 410, + 695 + ], + "spans": [ + { + "bbox": [ + 141, + 681, + 410, + 695 + ], + "score": 1.0, + "content": "the raster order (default across all other experiments in this paper).", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 133, + 698, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 133, + 698, + 506, + 712 + ], + "score": 1.0, + "content": "• 2-dimensional positional embedding: Considering the inputs as a grid of patches in two", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 141, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 141, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "dimensions. In this case, two sets of embeddings are learned, each for one of the axes,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 142, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 142, + 721, + 153, + 730 + ], + "score": 0.78, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 721, + 222, + 733 + ], + "score": 1.0, + "content": "-embedding, and", + "type": "text" + }, + { + "bbox": [ + 222, + 721, + 231, + 730 + ], + "score": 0.79, + "content": "Y", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 721, + 343, + 733 + ], + "score": 1.0, + "content": "-embedding, each with size", + "type": "text" + }, + { + "bbox": [ + 343, + 721, + 362, + 732 + ], + "score": 0.87, + "content": "D / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 721, + 505, + 733 + ], + "score": 1.0, + "content": ". Then, based on the coordinate on", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 141, + 386, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 141, + 386, + 311, + 400 + ], + "score": 1.0, + "content": "the path in the input, we concatenate the", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 312, + 388, + 322, + 397 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 322, + 386, + 341, + 400 + ], + "score": 1.0, + "content": "and", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 342, + 387, + 351, + 397 + ], + "score": 0.74, + "content": "Y", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 351, + 386, + 505, + 400 + ], + "score": 1.0, + "content": "embedding to get the final positional", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 142, + 397, + 247, + 410 + ], + "spans": [ + { + "bbox": [ + 142, + 397, + 247, + 410 + ], + "score": 1.0, + "content": "embedding for that patch.", + "type": "text", + "cross_page": true + } + ], + "index": 10 + } + ], + "index": 33.5, + "bbox_fs": [ + 132, + 654, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 158, + 80, + 453, + 148 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 158, + 80, + 453, + 148 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 158, + 80, + 453, + 148 + ], + "spans": [ + { + "bbox": [ + 158, + 80, + 453, + 148 + ], + "score": 0.973, + "html": "
Pos. Emb.Default/StemEvery LayerEvery Layer-Shared
No Pos. Emb.0.61382N/AN/A
1-D Pos. Emb.0.642060.639640.64292
2-D Pos. Emb.0.640010.640460.64022
Rel. Pos.Emb.0.64032N/AN/A
", + "type": "table", + "image_path": "c4b8fe05634aa384e4650368bb77e1abe1937e5aeb116fec360a01557385eb32.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 158, + 80, + 453, + 102.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 158, + 102.66666666666667, + 453, + 125.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 158, + 125.33333333333334, + 453, + 148.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 156, + 505, + 178 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 156, + 505, + 169 + ], + "spans": [ + { + "bbox": [ + 106, + 156, + 505, + 169 + ], + "score": 1.0, + "content": "Table 8: Results of the ablation study on positional embeddings with ViT-B/16 model evaluated on", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 167, + 203, + 180 + ], + "spans": [ + { + "bbox": [ + 106, + 167, + 203, + 180 + ], + "score": 1.0, + "content": "ImageNet 5-shot linear.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "image", + "bbox": [ + 108, + 201, + 504, + 331 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 201, + 504, + 331 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 201, + 504, + 331 + ], + "spans": [ + { + "bbox": [ + 108, + 201, + 504, + 331 + ], + "score": 0.964, + "type": "image", + "image_path": "f17a7ad1c8d7369bd3a83cfd6f7a7e661a00f552506b476bfe155394c93fb3d0.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 108, + 201, + 504, + 244.33333333333334 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 108, + 244.33333333333334, + 504, + 287.6666666666667 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 108, + 287.6666666666667, + 504, + 331.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 142, + 343, + 467, + 356 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 341, + 469, + 359 + ], + "spans": [ + { + "bbox": [ + 141, + 341, + 469, + 359 + ], + "score": 1.0, + "content": "Figure 9: Position embeddings of models trained with different hyperparameters.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + } + ], + "index": 7.0 + }, + { + "type": "text", + "bbox": [ + 141, + 387, + 504, + 410 + ], + "lines": [ + { + "bbox": [ + 141, + 386, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 141, + 386, + 311, + 400 + ], + "score": 1.0, + "content": "the path in the input, we concatenate the", + "type": "text" + }, + { + "bbox": [ + 312, + 388, + 322, + 397 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 386, + 341, + 400 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 342, + 387, + 351, + 397 + ], + "score": 0.74, + "content": "Y", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 386, + 505, + 400 + ], + "score": 1.0, + "content": "embedding to get the final positional", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 142, + 397, + 247, + 410 + ], + "spans": [ + { + "bbox": [ + 142, + 397, + 247, + 410 + ], + "score": 1.0, + "content": "embedding for that patch.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 134, + 424, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 133, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 133, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "• Relative positional embeddings: Considering the relative distance between patches to en-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 436, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 141, + 436, + 505, + 448 + ], + "score": 1.0, + "content": "code the spatial information as instead of their absolute position. To do so, we use 1-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 447, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 141, + 447, + 505, + 459 + ], + "score": 1.0, + "content": "dimensional Relative Attention, in which we define the relative distance all possible pairs", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 458, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 141, + 458, + 506, + 471 + ], + "score": 1.0, + "content": "of patches. Thus, for every given pair (one as query, and the other as key/value in the at-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 469, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 141, + 469, + 303, + 481 + ], + "score": 1.0, + "content": "tention mechanism), we have an offset", + "type": "text" + }, + { + "bbox": [ + 303, + 470, + 338, + 481 + ], + "score": 0.91, + "content": "p _ { q } - p _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 469, + 505, + 481 + ], + "score": 1.0, + "content": ", where each offset is associated with an", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 480, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 142, + 480, + 505, + 492 + ], + "score": 1.0, + "content": "embedding. Then, we simply run extra attention, where we use the original query (the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 489, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 141, + 489, + 505, + 504 + ], + "score": 1.0, + "content": "content of query), but use relative positional embeddings as keys. We then use the log-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 502, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 141, + 502, + 505, + 513 + ], + "score": 1.0, + "content": "its from the relative attention as a bias term and add it to the logits of the main attention", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 142, + 513, + 362, + 525 + ], + "spans": [ + { + "bbox": [ + 142, + 513, + 362, + 525 + ], + "score": 1.0, + "content": "(content-based attention) before applying the softmax.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 106, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "In addition to different ways of encoding spatial information, we also tried different ways of in-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "corporating this information in our model. For the 1-dimensional and 2-dimensional positional", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "embeddings, we tried three different cases: (1) add positional embeddings to the inputs right after", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "the stem of them model and before feeding the inputs to the Transformer encoder (default across", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "all other experiments in this paper); (2) learn and add positional embeddings to the inputs at the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 594, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 607 + ], + "score": 1.0, + "content": "beginning of each layer; (3) add a learned positional embeddings to the inputs at the beginning of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 605, + 249, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 249, + 617 + ], + "score": 1.0, + "content": "each layer (shared between layers).", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "Table 8 summarizes the results from this ablation study on a ViT-B/16 model. As we can see, while", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "there is a large gap between the performances of the model with no positional embedding and mod-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 642, + 505, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 505, + 658 + ], + "score": 1.0, + "content": "els with positional embedding, there is little to no difference between different ways of encoding", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "positional information. We speculate that since our Transformer encoder operates on patch-level", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "inputs, as opposed to pixel-level, the differences in how to encode spatial information is less impor-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "score": 1.0, + "content": "tant. More precisely, in patch-level inputs, the spatial dimensions are much smaller than the original", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 687, + 504, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 201, + 700 + ], + "score": 1.0, + "content": "pixel-level inputs, e.g.,", + "type": "text" + }, + { + "bbox": [ + 201, + 688, + 236, + 698 + ], + "score": 0.9, + "content": "1 4 \\times 1 4", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 687, + 295, + 700 + ], + "score": 1.0, + "content": "as opposed to", + "type": "text" + }, + { + "bbox": [ + 296, + 688, + 340, + 698 + ], + "score": 0.9, + "content": "2 2 4 \\times 2 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 687, + 504, + 700 + ], + "score": 1.0, + "content": ", and learning to represent the spatial re-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "lations in this resolution is equally easy for these different positional encoding strategies. Even so,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 708, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 724 + ], + "score": 1.0, + "content": "the specific pattern of position embedding similarity learned by the network depends on the training", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 721, + 221, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 221, + 733 + ], + "score": 1.0, + "content": "hyperparameters (Figure 9).", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 31.5 + } + ], + "page_idx": 16, + "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, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "17", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 158, + 80, + 453, + 148 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 158, + 80, + 453, + 148 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 158, + 80, + 453, + 148 + ], + "spans": [ + { + "bbox": [ + 158, + 80, + 453, + 148 + ], + "score": 0.973, + "html": "
Pos. Emb.Default/StemEvery LayerEvery Layer-Shared
No Pos. Emb.0.61382N/AN/A
1-D Pos. Emb.0.642060.639640.64292
2-D Pos. Emb.0.640010.640460.64022
Rel. Pos.Emb.0.64032N/AN/A
", + "type": "table", + "image_path": "c4b8fe05634aa384e4650368bb77e1abe1937e5aeb116fec360a01557385eb32.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 158, + 80, + 453, + 102.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 158, + 102.66666666666667, + 453, + 125.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 158, + 125.33333333333334, + 453, + 148.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 156, + 505, + 178 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 156, + 505, + 169 + ], + "spans": [ + { + "bbox": [ + 106, + 156, + 505, + 169 + ], + "score": 1.0, + "content": "Table 8: Results of the ablation study on positional embeddings with ViT-B/16 model evaluated on", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 167, + 203, + 180 + ], + "spans": [ + { + "bbox": [ + 106, + 167, + 203, + 180 + ], + "score": 1.0, + "content": "ImageNet 5-shot linear.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "image", + "bbox": [ + 108, + 201, + 504, + 331 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 201, + 504, + 331 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 201, + 504, + 331 + ], + "spans": [ + { + "bbox": [ + 108, + 201, + 504, + 331 + ], + "score": 0.964, + "type": "image", + "image_path": "f17a7ad1c8d7369bd3a83cfd6f7a7e661a00f552506b476bfe155394c93fb3d0.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 108, + 201, + 504, + 244.33333333333334 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 108, + 244.33333333333334, + 504, + 287.6666666666667 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 108, + 287.6666666666667, + 504, + 331.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 142, + 343, + 467, + 356 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 341, + 469, + 359 + ], + "spans": [ + { + "bbox": [ + 141, + 341, + 469, + 359 + ], + "score": 1.0, + "content": "Figure 9: Position embeddings of models trained with different hyperparameters.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + } + ], + "index": 7.0 + }, + { + "type": "text", + "bbox": [ + 141, + 387, + 504, + 410 + ], + "lines": [], + "index": 9.5, + "bbox_fs": [ + 141, + 386, + 505, + 410 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 134, + 424, + 505, + 524 + ], + "lines": [ + { + "bbox": [ + 133, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 133, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "• Relative positional embeddings: Considering the relative distance between patches to en-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 436, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 141, + 436, + 505, + 448 + ], + "score": 1.0, + "content": "code the spatial information as instead of their absolute position. To do so, we use 1-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 447, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 141, + 447, + 505, + 459 + ], + "score": 1.0, + "content": "dimensional Relative Attention, in which we define the relative distance all possible pairs", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 458, + 506, + 471 + ], + "spans": [ + { + "bbox": [ + 141, + 458, + 506, + 471 + ], + "score": 1.0, + "content": "of patches. Thus, for every given pair (one as query, and the other as key/value in the at-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 469, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 141, + 469, + 303, + 481 + ], + "score": 1.0, + "content": "tention mechanism), we have an offset", + "type": "text" + }, + { + "bbox": [ + 303, + 470, + 338, + 481 + ], + "score": 0.91, + "content": "p _ { q } - p _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 469, + 505, + 481 + ], + "score": 1.0, + "content": ", where each offset is associated with an", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 480, + 505, + 492 + ], + "spans": [ + { + "bbox": [ + 142, + 480, + 505, + 492 + ], + "score": 1.0, + "content": "embedding. Then, we simply run extra attention, where we use the original query (the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 489, + 505, + 504 + ], + "spans": [ + { + "bbox": [ + 141, + 489, + 505, + 504 + ], + "score": 1.0, + "content": "content of query), but use relative positional embeddings as keys. We then use the log-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 502, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 141, + 502, + 505, + 513 + ], + "score": 1.0, + "content": "its from the relative attention as a bias term and add it to the logits of the main attention", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 142, + 513, + 362, + 525 + ], + "spans": [ + { + "bbox": [ + 142, + 513, + 362, + 525 + ], + "score": 1.0, + "content": "(content-based attention) before applying the softmax.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15, + "bbox_fs": [ + 133, + 425, + 506, + 525 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 106, + 539, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 539, + 505, + 552 + ], + "score": 1.0, + "content": "In addition to different ways of encoding spatial information, we also tried different ways of in-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 505, + 563 + ], + "score": 1.0, + "content": "corporating this information in our model. For the 1-dimensional and 2-dimensional positional", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "embeddings, we tried three different cases: (1) add positional embeddings to the inputs right after", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "the stem of them model and before feeding the inputs to the Transformer encoder (default across", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "all other experiments in this paper); (2) learn and add positional embeddings to the inputs at the", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 594, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 506, + 607 + ], + "score": 1.0, + "content": "beginning of each layer; (3) add a learned positional embeddings to the inputs at the beginning of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 605, + 249, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 249, + 617 + ], + "score": 1.0, + "content": "each layer (shared between layers).", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 539, + 506, + 617 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 106, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "Table 8 summarizes the results from this ablation study on a ViT-B/16 model. As we can see, while", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 646 + ], + "score": 1.0, + "content": "there is a large gap between the performances of the model with no positional embedding and mod-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 642, + 505, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 505, + 658 + ], + "score": 1.0, + "content": "els with positional embedding, there is little to no difference between different ways of encoding", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 654, + 506, + 668 + ], + "score": 1.0, + "content": "positional information. We speculate that since our Transformer encoder operates on patch-level", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "inputs, as opposed to pixel-level, the differences in how to encode spatial information is less impor-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 689 + ], + "score": 1.0, + "content": "tant. More precisely, in patch-level inputs, the spatial dimensions are much smaller than the original", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 687, + 504, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 201, + 700 + ], + "score": 1.0, + "content": "pixel-level inputs, e.g.,", + "type": "text" + }, + { + "bbox": [ + 201, + 688, + 236, + 698 + ], + "score": 0.9, + "content": "1 4 \\times 1 4", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 687, + 295, + 700 + ], + "score": 1.0, + "content": "as opposed to", + "type": "text" + }, + { + "bbox": [ + 296, + 688, + 340, + 698 + ], + "score": 0.9, + "content": "2 2 4 \\times 2 2 4", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 687, + 504, + 700 + ], + "score": 1.0, + "content": ", and learning to represent the spatial re-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "score": 1.0, + "content": "lations in this resolution is equally easy for these different positional encoding strategies. Even so,", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 708, + 506, + 724 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 506, + 724 + ], + "score": 1.0, + "content": "the specific pattern of position embedding similarity learned by the network depends on the training", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 721, + 221, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 221, + 733 + ], + "score": 1.0, + "content": "hyperparameters (Figure 9).", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 622, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 140, + 82, + 468, + 258 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 140, + 82, + 468, + 258 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 140, + 82, + 468, + 258 + ], + "spans": [ + { + "bbox": [ + 140, + 82, + 468, + 258 + ], + "score": 0.974, + "type": "image", + "image_path": "5ed38ba4f1b7ab9d93edbca4579d27ee5df39ca42cb87a60b78985f34a6716ae.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 140, + 82, + 468, + 140.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 140, + 140.66666666666666, + 468, + 199.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 140, + 199.33333333333331, + 468, + 258.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 278, + 505, + 323 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 279, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 505, + 290 + ], + "score": 1.0, + "content": "Figure 10: Size of attended area by head and network depth. Attention distance was computed for", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 289, + 506, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 506, + 302 + ], + "score": 1.0, + "content": "128 example images by averaging the distance between the query pixel and all other pixels, weighted", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 301, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 505, + 312 + ], + "score": 1.0, + "content": "by the attention weight. Each dot shows the mean attention distance across images for one of 16", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 312, + 290, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 290, + 324 + ], + "score": 1.0, + "content": "heads at one layer. Image width is 224 pixels.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "title", + "bbox": [ + 109, + 344, + 290, + 355 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 291, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 291, + 357 + ], + "score": 1.0, + "content": "D.4 EMPIRICAL COMPUTATIONAL COSTS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 365, + 505, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 364, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 505, + 378 + ], + "score": 1.0, + "content": "We are also interested in real-world speed of the architectures on our hardware, which is not always", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "well predicted by theoretical FLOPs due to details like lane widths and cache sizes. For this purpose,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 388, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 505, + 399 + ], + "score": 1.0, + "content": "we perform timing of inference speed for the main models of interest, on a TPUv3 accelerator; the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 397, + 465, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 465, + 411 + ], + "score": 1.0, + "content": "difference between inference and backprop speed is a constant model-independent factor.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 505, + 459 + ], + "lines": [ + { + "bbox": [ + 105, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 428 + ], + "score": 1.0, + "content": "Figure 11 (left) shows how many images one core can handle per second, across various input sizes.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "Every single point refers to the peak performance measured across a wide range of batch-sizes. As", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 436, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 505, + 450 + ], + "score": 1.0, + "content": "can be seen, the theoretical bi-quadratic scaling of ViT with image size only barely starts happening", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 448, + 297, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 297, + 460 + ], + "score": 1.0, + "content": "for the largest models at the largest resolutions.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 108, + 465, + 505, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 464, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 506, + 478 + ], + "score": 1.0, + "content": "Another quantity of interest is the largest batch-size each model can fit onto a core, larger being", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 475, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 505, + 488 + ], + "score": 1.0, + "content": "better for scaling to large datasets. Figure 11 (right) shows this quantity for the same set of models.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "score": 1.0, + "content": "This shows that large ViT models have a clear advantage in terms of memory-efficiency over ResNet", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 497, + 141, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 141, + 510 + ], + "score": 1.0, + "content": "models.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5 + }, + { + "type": "title", + "bbox": [ + 108, + 523, + 215, + 534 + ], + "lines": [ + { + "bbox": [ + 106, + 523, + 216, + 536 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 216, + 536 + ], + "score": 1.0, + "content": "D.5 AXIAL ATTENTION", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 544, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 545, + 504, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 504, + 556 + ], + "score": 1.0, + "content": "Axial Attention (Huang et al., 2020; Ho et al., 2019) is a simple, yet effective technique to run self-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "score": 1.0, + "content": "attention on large inputs that are organized as multidimensional tensors. The general idea of axial", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "attention is to perform multiple attention operations, each along a single axis of the input tensor,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "instead of applying 1-dimensional attention to the flattened version of the input. In axial attention,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "each attention mixes information along a particular axis, while keeping information along the other", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 599, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 505, + 611 + ], + "score": 1.0, + "content": "axes independent. Along this line, Wang et al. (2020b) proposed the AxialResNet model in which", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 256, + 622 + ], + "score": 1.0, + "content": "all the convolutions with kernel size", + "type": "text" + }, + { + "bbox": [ + 257, + 610, + 281, + 621 + ], + "score": 0.89, + "content": "3 \\times 3", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 610, + 504, + 622 + ], + "score": 1.0, + "content": "in a ResNet50 are replaced by axial self-attention, i.e.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "a row and column attention, augmented by relative positional encoding. We have implemented", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 631, + 250, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 250, + 644 + ], + "score": 1.0, + "content": "AxialResNet as a baseline model.3.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 108, + 649, + 504, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 662 + ], + "score": 1.0, + "content": "Moreover, we have modified ViT to process inputs in the 2-dimensional shape, instead of a 1-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 660, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 506, + 672 + ], + "score": 1.0, + "content": "dimensional sequence of patches, and incorporate Axial Transformer blocks, in which instead of", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + } + ], + "page_idx": 17, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 681, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 680, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 118, + 680, + 505, + 694 + ], + "score": 1.0, + "content": "3Our implementation is based on the open-sourced PyTorch implementation in https://github.com/", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 691, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 106, + 691, + 505, + 703 + ], + "score": 1.0, + "content": "csrhddlam/axial-deeplab. In our experiments, we reproduced the scores reported in (Wang et al.,", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 700, + 505, + 714 + ], + "spans": [ + { + "bbox": [ + 105, + 700, + 505, + 714 + ], + "score": 1.0, + "content": "2020b) in terms of accuracy, however, our implementation, similar to the open-source implementation, is very", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 711, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 711, + 505, + 723 + ], + "score": 1.0, + "content": "slow on TPUs. Therefore, we were not able to use it for extensive large-scale experiments. These may be", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 721, + 292, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 292, + 733 + ], + "score": 1.0, + "content": "unlocked by a carefully optimized implementation.", + "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": [ + 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": "image", + "bbox": [ + 140, + 82, + 468, + 258 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 140, + 82, + 468, + 258 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 140, + 82, + 468, + 258 + ], + "spans": [ + { + "bbox": [ + 140, + 82, + 468, + 258 + ], + "score": 0.974, + "type": "image", + "image_path": "5ed38ba4f1b7ab9d93edbca4579d27ee5df39ca42cb87a60b78985f34a6716ae.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 140, + 82, + 468, + 140.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 140, + 140.66666666666666, + 468, + 199.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 140, + 199.33333333333331, + 468, + 258.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 278, + 505, + 323 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 279, + 505, + 290 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 505, + 290 + ], + "score": 1.0, + "content": "Figure 10: Size of attended area by head and network depth. Attention distance was computed for", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 289, + 506, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 506, + 302 + ], + "score": 1.0, + "content": "128 example images by averaging the distance between the query pixel and all other pixels, weighted", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 301, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 301, + 505, + 312 + ], + "score": 1.0, + "content": "by the attention weight. Each dot shows the mean attention distance across images for one of 16", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 312, + 290, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 312, + 290, + 324 + ], + "score": 1.0, + "content": "heads at one layer. Image width is 224 pixels.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "index": 2.75 + }, + { + "type": "title", + "bbox": [ + 109, + 344, + 290, + 355 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 291, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 291, + 357 + ], + "score": 1.0, + "content": "D.4 EMPIRICAL COMPUTATIONAL COSTS", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 365, + 505, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 364, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 505, + 378 + ], + "score": 1.0, + "content": "We are also interested in real-world speed of the architectures on our hardware, which is not always", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 106, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "well predicted by theoretical FLOPs due to details like lane widths and cache sizes. For this purpose,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 388, + 505, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 505, + 399 + ], + "score": 1.0, + "content": "we perform timing of inference speed for the main models of interest, on a TPUv3 accelerator; the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 397, + 465, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 465, + 411 + ], + "score": 1.0, + "content": "difference between inference and backprop speed is a constant model-independent factor.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 364, + 506, + 411 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 415, + 505, + 459 + ], + "lines": [ + { + "bbox": [ + 105, + 414, + 505, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 428 + ], + "score": 1.0, + "content": "Figure 11 (left) shows how many images one core can handle per second, across various input sizes.", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "Every single point refers to the peak performance measured across a wide range of batch-sizes. As", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 436, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 505, + 450 + ], + "score": 1.0, + "content": "can be seen, the theoretical bi-quadratic scaling of ViT with image size only barely starts happening", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 448, + 297, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 297, + 460 + ], + "score": 1.0, + "content": "for the largest models at the largest resolutions.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 414, + 505, + 460 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 465, + 505, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 464, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 506, + 478 + ], + "score": 1.0, + "content": "Another quantity of interest is the largest batch-size each model can fit onto a core, larger being", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 475, + 505, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 505, + 488 + ], + "score": 1.0, + "content": "better for scaling to large datasets. Figure 11 (right) shows this quantity for the same set of models.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 506, + 500 + ], + "score": 1.0, + "content": "This shows that large ViT models have a clear advantage in terms of memory-efficiency over ResNet", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 497, + 141, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 141, + 510 + ], + "score": 1.0, + "content": "models.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 464, + 506, + 510 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 523, + 215, + 534 + ], + "lines": [ + { + "bbox": [ + 106, + 523, + 216, + 536 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 216, + 536 + ], + "score": 1.0, + "content": "D.5 AXIAL ATTENTION", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 544, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 106, + 545, + 504, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 545, + 504, + 556 + ], + "score": 1.0, + "content": "Axial Attention (Huang et al., 2020; Ho et al., 2019) is a simple, yet effective technique to run self-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 106, + 556, + 505, + 568 + ], + "score": 1.0, + "content": "attention on large inputs that are organized as multidimensional tensors. The general idea of axial", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "attention is to perform multiple attention operations, each along a single axis of the input tensor,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "instead of applying 1-dimensional attention to the flattened version of the input. In axial attention,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "each attention mixes information along a particular axis, while keeping information along the other", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 599, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 505, + 611 + ], + "score": 1.0, + "content": "axes independent. Along this line, Wang et al. (2020b) proposed the AxialResNet model in which", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 256, + 622 + ], + "score": 1.0, + "content": "all the convolutions with kernel size", + "type": "text" + }, + { + "bbox": [ + 257, + 610, + 281, + 621 + ], + "score": 0.89, + "content": "3 \\times 3", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 610, + 504, + 622 + ], + "score": 1.0, + "content": "in a ResNet50 are replaced by axial self-attention, i.e.", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "a row and column attention, augmented by relative positional encoding. We have implemented", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 631, + 250, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 250, + 644 + ], + "score": 1.0, + "content": "AxialResNet as a baseline model.3.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 545, + 505, + 644 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 649, + 504, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 649, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 662 + ], + "score": 1.0, + "content": "Moreover, we have modified ViT to process inputs in the 2-dimensional shape, instead of a 1-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 660, + 506, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 506, + 672 + ], + "score": 1.0, + "content": "dimensional sequence of patches, and incorporate Axial Transformer blocks, in which instead of", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 312, + 506, + 327 + ], + "spans": [ + { + "bbox": [ + 104, + 312, + 506, + 327 + ], + "score": 1.0, + "content": "a self-attention followed by an MLP, we have a a row-self-attention plus an MLP followed by a", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 325, + 250, + 338 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 250, + 338 + ], + "score": 1.0, + "content": "column-self-attention plus an MLP.", + "type": "text", + "cross_page": true + } + ], + "index": 7 + } + ], + "index": 30.5, + "bbox_fs": [ + 106, + 649, + 506, + 672 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 124, + 88, + 485, + 241 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 124, + 88, + 485, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 124, + 88, + 485, + 241 + ], + "spans": [ + { + "bbox": [ + 124, + 88, + 485, + 241 + ], + "score": 0.972, + "type": "image", + "image_path": "d008d21d372389ac2c877fbe8ea659a89fabdc092dd9047ef2ebdf27c3aa6aeb.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 124, + 88, + 485, + 139.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 124, + 139.0, + 485, + 190.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 124, + 190.0, + 485, + 241.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 260, + 504, + 294 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Figure 11: Left: Real wall-clock timings of various architectures across input sizes. ViT models", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 272, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 284 + ], + "score": 1.0, + "content": "have speed comparable to similar ResNets. Right: Largest per-core batch-size fitting on device with", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 283, + 457, + 295 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 457, + 295 + ], + "score": 1.0, + "content": "various architectures across input sizes. ViT models are clearly more memory-efficient.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 504, + 336 + ], + "lines": [ + { + "bbox": [ + 104, + 312, + 506, + 327 + ], + "spans": [ + { + "bbox": [ + 104, + 312, + 506, + 327 + ], + "score": 1.0, + "content": "a self-attention followed by an MLP, we have a a row-self-attention plus an MLP followed by a", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 325, + 250, + 338 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 250, + 338 + ], + "score": 1.0, + "content": "column-self-attention plus an MLP.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "image", + "bbox": [ + 120, + 348, + 490, + 502 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 120, + 348, + 490, + 502 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 120, + 348, + 490, + 502 + ], + "spans": [ + { + "bbox": [ + 120, + 348, + 490, + 502 + ], + "score": 0.972, + "type": "image", + "image_path": "1fed46da5b7a53532096674323e26d44ee931247b2ce97baead29e2301c60f89.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 120, + 348, + 490, + 399.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 120, + 399.3333333333333, + 490, + 450.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 120, + 450.66666666666663, + 490, + 501.99999999999994 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 515, + 505, + 537 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 515, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 515, + 505, + 528 + ], + "score": 1.0, + "content": "Figure 12: Performance of Axial-Attention based models, in terms of top-1 accuracy on ImageNet", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 525, + 480, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 480, + 538 + ], + "score": 1.0, + "content": "5-shot linear, versus their speed in terms of number of FLOPs (left) and inference time (left).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + } + ], + "index": 10.25 + }, + { + "type": "text", + "bbox": [ + 106, + 554, + 505, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "score": 1.0, + "content": "Figure 12, present the performance of Axial ResNet, Axial-ViT-B/32 and Axial-ViT-B/16 on Ima-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 565, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 506, + 578 + ], + "score": 1.0, + "content": "geNet 5shot linear, when pretrained on JFT dataset, verses the pretraining compute, both in terms of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 576, + 506, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 590 + ], + "score": 1.0, + "content": "number of FLOPs and inference time (example per seconds). As we can see, both Axial-ViT-B/32", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "score": 1.0, + "content": "and Axial-ViT-B/16 do better than their ViT-B counterpart in terms of performance, but it comes at", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 599, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 505, + 610 + ], + "score": 1.0, + "content": "the cost of more compute. This is because in Axial-ViT models, each Transformer block with global", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 610, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 505, + 621 + ], + "score": 1.0, + "content": "self-attention is replaced by two Axial Transformer blocks, one with row and one with column self-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 620, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 506, + 633 + ], + "score": 1.0, + "content": "attention and although the sequence length that self-attention operates on is smaller in axial case,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 632, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 505, + 644 + ], + "score": 1.0, + "content": "there is a extra MLP per Axial-ViT block. For the AxialResNet, although it looks reasonable in", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 643, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 505, + 654 + ], + "score": 1.0, + "content": "terms of accuracy/compute trade-off (Figure 12, left), the naive implementation is extremely slow", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 653, + 218, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 218, + 666 + ], + "score": 1.0, + "content": "on TPUs (Figure 12, right).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 17.5 + }, + { + "type": "title", + "bbox": [ + 108, + 678, + 231, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 677, + 232, + 691 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 232, + 691 + ], + "score": 1.0, + "content": "D.6 ATTENTION DISTANCE", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "To understand how ViT uses self-attention to integrate information across the image, we analyzed", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "the average distance spanned by attention weights at different layers (Figure 10). This “attention", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "distance” is analogous to receptive field size in CNNs. Average attention distance is highly variable", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + } + ], + "page_idx": 18, + "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": [ + 301, + 751, + 311, + 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": [ + 124, + 88, + 485, + 241 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 124, + 88, + 485, + 241 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 124, + 88, + 485, + 241 + ], + "spans": [ + { + "bbox": [ + 124, + 88, + 485, + 241 + ], + "score": 0.972, + "type": "image", + "image_path": "d008d21d372389ac2c877fbe8ea659a89fabdc092dd9047ef2ebdf27c3aa6aeb.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 124, + 88, + 485, + 139.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 124, + 139.0, + 485, + 190.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 124, + 190.0, + 485, + 241.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 260, + 504, + 294 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Figure 11: Left: Real wall-clock timings of various architectures across input sizes. ViT models", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 272, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 505, + 284 + ], + "score": 1.0, + "content": "have speed comparable to similar ResNets. Right: Largest per-core batch-size fitting on device with", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 283, + 457, + 295 + ], + "spans": [ + { + "bbox": [ + 106, + 283, + 457, + 295 + ], + "score": 1.0, + "content": "various architectures across input sizes. ViT models are clearly more memory-efficient.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 504, + 336 + ], + "lines": [], + "index": 6.5, + "bbox_fs": [ + 104, + 312, + 506, + 338 + ], + "lines_deleted": true + }, + { + "type": "image", + "bbox": [ + 120, + 348, + 490, + 502 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 120, + 348, + 490, + 502 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 120, + 348, + 490, + 502 + ], + "spans": [ + { + "bbox": [ + 120, + 348, + 490, + 502 + ], + "score": 0.972, + "type": "image", + "image_path": "1fed46da5b7a53532096674323e26d44ee931247b2ce97baead29e2301c60f89.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 120, + 348, + 490, + 399.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 120, + 399.3333333333333, + 490, + 450.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 120, + 450.66666666666663, + 490, + 501.99999999999994 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 515, + 505, + 537 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 515, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 515, + 505, + 528 + ], + "score": 1.0, + "content": "Figure 12: Performance of Axial-Attention based models, in terms of top-1 accuracy on ImageNet", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 525, + 480, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 480, + 538 + ], + "score": 1.0, + "content": "5-shot linear, versus their speed in terms of number of FLOPs (left) and inference time (left).", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + } + ], + "index": 10.25 + }, + { + "type": "text", + "bbox": [ + 106, + 554, + 505, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "score": 1.0, + "content": "Figure 12, present the performance of Axial ResNet, Axial-ViT-B/32 and Axial-ViT-B/16 on Ima-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 565, + 506, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 506, + 578 + ], + "score": 1.0, + "content": "geNet 5shot linear, when pretrained on JFT dataset, verses the pretraining compute, both in terms of", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 576, + 506, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 590 + ], + "score": 1.0, + "content": "number of FLOPs and inference time (example per seconds). As we can see, both Axial-ViT-B/32", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "score": 1.0, + "content": "and Axial-ViT-B/16 do better than their ViT-B counterpart in terms of performance, but it comes at", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 599, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 505, + 610 + ], + "score": 1.0, + "content": "the cost of more compute. This is because in Axial-ViT models, each Transformer block with global", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 610, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 505, + 621 + ], + "score": 1.0, + "content": "self-attention is replaced by two Axial Transformer blocks, one with row and one with column self-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 620, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 506, + 633 + ], + "score": 1.0, + "content": "attention and although the sequence length that self-attention operates on is smaller in axial case,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 632, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 106, + 632, + 505, + 644 + ], + "score": 1.0, + "content": "there is a extra MLP per Axial-ViT block. For the AxialResNet, although it looks reasonable in", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 643, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 505, + 654 + ], + "score": 1.0, + "content": "terms of accuracy/compute trade-off (Figure 12, left), the naive implementation is extremely slow", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 653, + 218, + 666 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 218, + 666 + ], + "score": 1.0, + "content": "on TPUs (Figure 12, right).", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 554, + 506, + 666 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 678, + 231, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 677, + 232, + 691 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 232, + 691 + ], + "score": 1.0, + "content": "D.6 ATTENTION DISTANCE", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "To understand how ViT uses self-attention to integrate information across the image, we analyzed", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "the average distance spanned by attention weights at different layers (Figure 10). This “attention", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "distance” is analogous to receptive field size in CNNs. Average attention distance is highly variable", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 699, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "across heads in lower layers, with some heads attending to much of the image, while others attend", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 105 + ], + "score": 1.0, + "content": "to small regions at or near the query location. As depth increases, attention distance increases for all", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 433, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 433, + 117 + ], + "score": 1.0, + "content": "heads. In the second half of the network, most heads attend widely across tokens.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "title", + "bbox": [ + 107, + 129, + 212, + 140 + ], + "lines": [ + { + "bbox": [ + 106, + 129, + 213, + 142 + ], + "spans": [ + { + "bbox": [ + 106, + 129, + 213, + 142 + ], + "score": 1.0, + "content": "D.7 ATTENTION MAPS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 150, + 505, + 194 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "score": 1.0, + "content": "To compute maps of the attention from the output token to the input space (Figures 6 and 13), we", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 161, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 505, + 173 + ], + "score": 1.0, + "content": "used Attention Rollout (Abnar & Zuidema, 2020). Briefly, we averaged attention weights of ViT-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 171, + 505, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 127, + 182 + ], + "score": 0.28, + "content": "\\mathrm { L } / 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 171, + 505, + 185 + ], + "score": 1.0, + "content": "across all heads and then recursively multiplied the weight matrices of all layers. This accounts", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 182, + 344, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 344, + 195 + ], + "score": 1.0, + "content": "for the mixing of attention across tokens through all layers.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "title", + "bbox": [ + 107, + 207, + 222, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 208, + 223, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 223, + 219 + ], + "score": 1.0, + "content": "D.8 VTAB BREAKDOWN", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 366, + 240 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 367, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 367, + 241 + ], + "score": 1.0, + "content": "Table 9 shows the scores attained on each of the VTAB-1k tasks.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "table", + "bbox": [ + 106, + 270, + 504, + 354 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 181, + 257, + 425, + 269 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 181, + 256, + 426, + 271 + ], + "spans": [ + { + "bbox": [ + 181, + 256, + 426, + 271 + ], + "score": 1.0, + "content": "Table 9: Breakdown of VTAB-1k performance across tasks.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "table_body", + "bbox": [ + 106, + 270, + 504, + 354 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 270, + 504, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 504, + 354 + ], + "score": 0.978, + "html": "
0oreeeaerCIIPIP0 :DEI ·irmsiIs1ed660unsNHASeeaaemButoS55sr515GrrrogarCerrrelrr CTr-stq NTapop-dPuo-Idsp·JTI-ITTTTSIIH-SRARSSH-PRPPEE7aam
ViT-H/14 (JFT)95.385.575.299.797.265.088.983.396.791.476.691.763.853.179.463.384.533.251.277.6
ViT-L/16 (JFT)95.481.974.399.796.763.587.483.696.589.777.186.463.149.774.560.582.236.251.176.3
ViT-L/16 (I21k)90.884.174.199.392.761.080.982.595.685.275.370.356.141.974.764.979.930.541.772.7
", + "type": "table", + "image_path": "c8e2b5fa9d9ae62df590c80f9b71ae0a6542b8ed42631bb7d81109715ac04d0a.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 106, + 270, + 504, + 298.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 106, + 298.0, + 504, + 326.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 106, + 326.0, + 504, + 354.0 + ], + "spans": [], + "index": 13 + } + ] + } + ], + "index": 11.0 + } + ], + "page_idx": 19, + "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, + 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": "text", + "bbox": [ + 108, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "across heads in lower layers, with some heads attending to much of the image, while others attend", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 105 + ], + "score": 1.0, + "content": "to small regions at or near the query location. As depth increases, attention distance increases for all", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 433, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 433, + 117 + ], + "score": 1.0, + "content": "heads. In the second half of the network, most heads attend widely across tokens.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 117 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 129, + 212, + 140 + ], + "lines": [ + { + "bbox": [ + 106, + 129, + 213, + 142 + ], + "spans": [ + { + "bbox": [ + 106, + 129, + 213, + 142 + ], + "score": 1.0, + "content": "D.7 ATTENTION MAPS", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 150, + 505, + 194 + ], + "lines": [ + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "score": 1.0, + "content": "To compute maps of the attention from the output token to the input space (Figures 6 and 13), we", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 161, + 505, + 173 + ], + "spans": [ + { + "bbox": [ + 106, + 161, + 505, + 173 + ], + "score": 1.0, + "content": "used Attention Rollout (Abnar & Zuidema, 2020). Briefly, we averaged attention weights of ViT-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 171, + 505, + 185 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 127, + 182 + ], + "score": 0.28, + "content": "\\mathrm { L } / 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 171, + 505, + 185 + ], + "score": 1.0, + "content": "across all heads and then recursively multiplied the weight matrices of all layers. This accounts", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 182, + 344, + 195 + ], + "spans": [ + { + "bbox": [ + 105, + 182, + 344, + 195 + ], + "score": 1.0, + "content": "for the mixing of attention across tokens through all layers.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 149, + 505, + 195 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 207, + 222, + 219 + ], + "lines": [ + { + "bbox": [ + 106, + 208, + 223, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 208, + 223, + 219 + ], + "score": 1.0, + "content": "D.8 VTAB BREAKDOWN", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 228, + 366, + 240 + ], + "lines": [ + { + "bbox": [ + 105, + 227, + 367, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 367, + 241 + ], + "score": 1.0, + "content": "Table 9 shows the scores attained on each of the VTAB-1k tasks.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 227, + 367, + 241 + ] + }, + { + "type": "table", + "bbox": [ + 106, + 270, + 504, + 354 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 181, + 257, + 425, + 269 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 181, + 256, + 426, + 271 + ], + "spans": [ + { + "bbox": [ + 181, + 256, + 426, + 271 + ], + "score": 1.0, + "content": "Table 9: Breakdown of VTAB-1k performance across tasks.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "table_body", + "bbox": [ + 106, + 270, + 504, + 354 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 270, + 504, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 504, + 354 + ], + "score": 0.978, + "html": "
0oreeeaerCIIPIP0 :DEI ·irmsiIs1ed660unsNHASeeaaemButoS55sr515GrrrogarCerrrelrr CTr-stq NTapop-dPuo-Idsp·JTI-ITTTTSIIH-SRARSSH-PRPPEE7aam
ViT-H/14 (JFT)95.385.575.299.797.265.088.983.396.791.476.691.763.853.179.463.384.533.251.277.6
ViT-L/16 (JFT)95.481.974.399.796.763.587.483.696.589.777.186.463.149.774.560.582.236.251.176.3
ViT-L/16 (I21k)90.884.174.199.392.761.080.982.595.685.275.370.356.141.974.764.979.930.541.772.7
", + "type": "table", + "image_path": "c8e2b5fa9d9ae62df590c80f9b71ae0a6542b8ed42631bb7d81109715ac04d0a.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 106, + 270, + 504, + 298.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 106, + 298.0, + 504, + 326.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 106, + 326.0, + 504, + 354.0 + ], + "spans": [], + "index": 13 + } + ] + } + ], + "index": 11.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 112, + 135, + 498, + 654 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 112, + 135, + 498, + 654 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 112, + 135, + 498, + 654 + ], + "spans": [ + { + "bbox": [ + 112, + 135, + 498, + 654 + ], + "score": 0.969, + "type": "image", + "image_path": "12d3ed42eccf501384439819f02277513ab0a56bd02b7d4b37a2542cffac7ee9.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 112, + 135, + 498, + 308.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 112, + 308.0, + 498, + 481.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 112, + 481.0, + 498, + 654.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 151, + 665, + 460, + 678 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 150, + 665, + 460, + 679 + ], + "spans": [ + { + "bbox": [ + 150, + 665, + 460, + 679 + ], + "score": 1.0, + "content": "Figure 13: Further example attention maps as in Figure 6 (random selection).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + } + ], + "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, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 14, + "width": 14 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "image", + "bbox": [ + 112, + 135, + 498, + 654 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 112, + 135, + 498, + 654 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 112, + 135, + 498, + 654 + ], + "spans": [ + { + "bbox": [ + 112, + 135, + 498, + 654 + ], + "score": 0.969, + "type": "image", + "image_path": "12d3ed42eccf501384439819f02277513ab0a56bd02b7d4b37a2542cffac7ee9.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 112, + 135, + 498, + 308.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 112, + 308.0, + 498, + 481.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 112, + 481.0, + 498, + 654.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 151, + 665, + 460, + 678 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 150, + 665, + 460, + 679 + ], + "spans": [ + { + "bbox": [ + 150, + 665, + 460, + 679 + ], + "score": 1.0, + "content": "Figure 13: Further example attention maps as in Figure 6 (random selection).", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/YicbFdNTTy/YicbFdNTTy_model.json b/parse/train/YicbFdNTTy/YicbFdNTTy_model.json new file mode 100644 index 0000000000000000000000000000000000000000..09c050846edd7692b089e7a18f1ceb0c2f7d3ca3 --- /dev/null +++ b/parse/train/YicbFdNTTy/YicbFdNTTy_model.json @@ -0,0 +1,30677 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 747, + 1302, + 747, + 1302, + 1083, + 398, + 1083 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1423, + 1404, + 1423, + 1404, + 1667, + 298, + 1667 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1223, + 1403, + 1223, + 1403, + 1408, + 298, + 1408 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1683, + 1402, + 1683, + 1402, + 1837, + 298, + 1837 + ], + "score": 0.974 + }, + { + "category_id": 0, + "poly": [ + 304, + 219, + 1401, + 219, + 1401, + 324, + 304, + 324 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 300, + 1852, + 1400, + 1852, + 1400, + 1945, + 300, + 1945 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 389, + 375, + 1359, + 375, + 1359, + 483, + 389, + 483 + ], + "score": 0.93 + }, + { + "category_id": 2, + "poly": [ + 298, + 1978, + 1403, + 1978, + 1403, + 2033, + 298, + 2033 + ], + "score": 0.924 + }, + { + "category_id": 0, + "poly": [ + 302, + 1151, + 573, + 1151, + 573, + 1186, + 302, + 1186 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.877 + }, + { + "category_id": 0, + "poly": [ + 773, + 674, + 927, + 674, + 927, + 708, + 773, + 708 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 857, + 2088, + 857, + 2112, + 841, + 2112 + ], + "score": 0.718 + }, + { + "category_id": 1, + "poly": [ + 555, + 489, + 1181, + 489, + 1181, + 595, + 555, + 595 + ], + "score": 0.568 + }, + { + "category_id": 15, + "poly": [ + 297.0, + 215.0, + 1077.0, + 215.0, + 1077.0, + 272.0, + 297.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 277.0, + 1404.0, + 277.0, + 1404.0, + 325.0, + 299.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1969.0, + 1404.0, + 1969.0, + 1404.0, + 2013.0, + 330.0, + 2013.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 815.0, + 2002.0, + 815.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1148.0, + 579.0, + 1148.0, + 579.0, + 1195.0, + 294.0, + 1195.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": [ + 770.0, + 673.0, + 932.0, + 673.0, + 932.0, + 711.0, + 770.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 840.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 747.0, + 1303.0, + 747.0, + 1303.0, + 779.0, + 396.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 778.0, + 1306.0, + 778.0, + 1306.0, + 813.0, + 393.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 809.0, + 1304.0, + 809.0, + 1304.0, + 842.0, + 395.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 841.0, + 1306.0, + 841.0, + 1306.0, + 873.0, + 395.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 867.0, + 1304.0, + 867.0, + 1304.0, + 907.0, + 392.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 901.0, + 1305.0, + 901.0, + 1305.0, + 934.0, + 394.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 932.0, + 1306.0, + 932.0, + 1306.0, + 964.0, + 395.0, + 964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 959.0, + 1306.0, + 959.0, + 1306.0, + 997.0, + 392.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 992.0, + 1305.0, + 992.0, + 1305.0, + 1024.0, + 395.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1021.0, + 1305.0, + 1021.0, + 1305.0, + 1056.0, + 393.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1053.0, + 953.0, + 1053.0, + 953.0, + 1085.0, + 393.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1423.0, + 1404.0, + 1423.0, + 1404.0, + 1457.0, + 293.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1451.0, + 1406.0, + 1451.0, + 1406.0, + 1491.0, + 292.0, + 1491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1483.0, + 1404.0, + 1483.0, + 1404.0, + 1520.0, + 293.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1515.0, + 1405.0, + 1515.0, + 1405.0, + 1549.0, + 294.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1546.0, + 1406.0, + 1546.0, + 1406.0, + 1580.0, + 294.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1572.0, + 1405.0, + 1572.0, + 1405.0, + 1611.0, + 293.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1602.0, + 1408.0, + 1602.0, + 1408.0, + 1641.0, + 291.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1632.0, + 378.0, + 1632.0, + 378.0, + 1672.0, + 292.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1221.0, + 1405.0, + 1221.0, + 1405.0, + 1260.0, + 293.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1251.0, + 1405.0, + 1251.0, + 1405.0, + 1291.0, + 293.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1284.0, + 1405.0, + 1284.0, + 1405.0, + 1318.0, + 292.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1314.0, + 1407.0, + 1314.0, + 1407.0, + 1349.0, + 292.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1346.0, + 1405.0, + 1346.0, + 1405.0, + 1379.0, + 293.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1377.0, + 1154.0, + 1377.0, + 1154.0, + 1412.0, + 294.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1681.0, + 1404.0, + 1681.0, + 1404.0, + 1718.0, + 294.0, + 1718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1710.0, + 1406.0, + 1710.0, + 1406.0, + 1751.0, + 293.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1745.0, + 1404.0, + 1745.0, + 1404.0, + 1779.0, + 296.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1773.0, + 1406.0, + 1773.0, + 1406.0, + 1810.0, + 294.0, + 1810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1804.0, + 923.0, + 1804.0, + 923.0, + 1842.0, + 293.0, + 1842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1849.0, + 1404.0, + 1849.0, + 1404.0, + 1889.0, + 294.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1882.0, + 1405.0, + 1882.0, + 1405.0, + 1919.0, + 295.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1914.0, + 1404.0, + 1914.0, + 1404.0, + 1947.0, + 295.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 376.0, + 1359.0, + 376.0, + 1359.0, + 413.0, + 389.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 412.0, + 1325.0, + 412.0, + 1325.0, + 453.0, + 408.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 451.0, + 1242.0, + 451.0, + 1242.0, + 485.0, + 488.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 484.0, + 1125.0, + 484.0, + 1125.0, + 528.0, + 609.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 526.0, + 1037.0, + 526.0, + 1037.0, + 559.0, + 696.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 560.0, + 1185.0, + 560.0, + 1185.0, + 599.0, + 550.0, + 599.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 901, + 1404, + 901, + 1404, + 1267, + 298, + 1267 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 308, + 1403, + 308, + 1403, + 521, + 298, + 521 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1481, + 1403, + 1481, + 1403, + 1666, + 298, + 1666 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1282, + 1403, + 1282, + 1403, + 1466, + 299, + 1466 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1819, + 1403, + 1819, + 1403, + 2033, + 298, + 2033 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1680, + 1402, + 1680, + 1402, + 1805, + 299, + 1805 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 731, + 1402, + 731, + 1402, + 885, + 298, + 885 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 295, + 229, + 1401, + 229, + 1401, + 292, + 295, + 292 + ], + "score": 0.951 + }, + { + "category_id": 0, + "poly": [ + 300, + 625, + 586, + 625, + 586, + 661, + 300, + 661 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.685 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.214 + }, + { + "category_id": 13, + "poly": [ + 582, + 1406, + 649, + 1406, + 649, + 1435, + 582, + 1435 + ], + "score": 0.89, + "latex": "2 \\times 2" + }, + { + "category_id": 13, + "poly": [ + 813, + 459, + 903, + 459, + 903, + 491, + 813, + 491 + ], + "score": 0.89, + "latex": "9 0 . 7 2 \\%" + }, + { + "category_id": 13, + "poly": [ + 563, + 460, + 653, + 460, + 653, + 490, + 563, + 490 + ], + "score": 0.89, + "latex": "8 8 . 5 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 344, + 490, + 434, + 490, + 434, + 521, + 344, + 521 + ], + "score": 0.89, + "latex": "7 7 . 6 3 \\%" + }, + { + "category_id": 13, + "poly": [ + 1133, + 460, + 1223, + 460, + 1223, + 491, + 1133, + 491 + ], + "score": 0.87, + "latex": "9 4 . 5 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 1334, + 1284, + 1401, + 1284, + 1401, + 1313, + 1334, + 1313 + ], + "score": 0.87, + "latex": "2 \\times 2" + }, + { + "category_id": 13, + "poly": [ + 1188, + 1774, + 1243, + 1774, + 1243, + 1803, + 1188, + 1803 + ], + "score": 0.86, + "latex": "72 \\%" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 622.0, + 594.0, + 622.0, + 594.0, + 669.0, + 291.0, + 669.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, + 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, + 902.0, + 1405.0, + 902.0, + 1405.0, + 936.0, + 294.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 931.0, + 1406.0, + 931.0, + 1406.0, + 969.0, + 293.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 963.0, + 1405.0, + 963.0, + 1405.0, + 997.0, + 293.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 989.0, + 1405.0, + 989.0, + 1405.0, + 1031.0, + 292.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1025.0, + 1404.0, + 1025.0, + 1404.0, + 1059.0, + 294.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1054.0, + 1406.0, + 1054.0, + 1406.0, + 1088.0, + 293.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1085.0, + 1404.0, + 1085.0, + 1404.0, + 1119.0, + 294.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1114.0, + 1404.0, + 1114.0, + 1404.0, + 1148.0, + 294.0, + 1148.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1145.0, + 1404.0, + 1145.0, + 1404.0, + 1179.0, + 294.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1176.0, + 1404.0, + 1176.0, + 1404.0, + 1210.0, + 294.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1207.0, + 1405.0, + 1207.0, + 1405.0, + 1241.0, + 293.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1237.0, + 705.0, + 1237.0, + 705.0, + 1270.0, + 295.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 308.0, + 1405.0, + 308.0, + 1405.0, + 342.0, + 294.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 337.0, + 1404.0, + 337.0, + 1404.0, + 372.0, + 294.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 366.0, + 1407.0, + 366.0, + 1407.0, + 405.0, + 292.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 399.0, + 1407.0, + 399.0, + 1407.0, + 435.0, + 292.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 429.0, + 1405.0, + 429.0, + 1405.0, + 462.0, + 293.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 459.0, + 562.0, + 459.0, + 562.0, + 493.0, + 294.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 459.0, + 812.0, + 459.0, + 812.0, + 493.0, + 654.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 459.0, + 1132.0, + 459.0, + 1132.0, + 493.0, + 904.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 459.0, + 1404.0, + 459.0, + 1404.0, + 493.0, + 1224.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 489.0, + 343.0, + 489.0, + 343.0, + 523.0, + 294.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 489.0, + 785.0, + 489.0, + 785.0, + 523.0, + 435.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1479.0, + 1405.0, + 1479.0, + 1405.0, + 1518.0, + 293.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1509.0, + 1405.0, + 1509.0, + 1405.0, + 1551.0, + 292.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1543.0, + 1405.0, + 1543.0, + 1405.0, + 1579.0, + 293.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1570.0, + 1407.0, + 1570.0, + 1407.0, + 1610.0, + 292.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1604.0, + 1405.0, + 1604.0, + 1405.0, + 1640.0, + 293.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1633.0, + 799.0, + 1633.0, + 799.0, + 1668.0, + 292.0, + 1668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1284.0, + 1333.0, + 1284.0, + 1333.0, + 1316.0, + 297.0, + 1316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1284.0, + 1405.0, + 1284.0, + 1405.0, + 1316.0, + 1402.0, + 1316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1312.0, + 1404.0, + 1312.0, + 1404.0, + 1347.0, + 294.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1344.0, + 1405.0, + 1344.0, + 1405.0, + 1379.0, + 294.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1374.0, + 1404.0, + 1374.0, + 1404.0, + 1408.0, + 295.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1407.0, + 581.0, + 1407.0, + 581.0, + 1439.0, + 297.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 1407.0, + 1404.0, + 1407.0, + 1404.0, + 1439.0, + 650.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1436.0, + 971.0, + 1436.0, + 971.0, + 1472.0, + 295.0, + 1472.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": [ + 296.0, + 1852.0, + 1403.0, + 1852.0, + 1403.0, + 1883.0, + 296.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1883.0, + 1402.0, + 1883.0, + 1402.0, + 1914.0, + 296.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1911.0, + 1404.0, + 1911.0, + 1404.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1943.0, + 1403.0, + 1943.0, + 1403.0, + 1974.0, + 294.0, + 1974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1973.0, + 1407.0, + 1973.0, + 1407.0, + 2007.0, + 293.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 1203.0, + 2002.0, + 1203.0, + 2035.0, + 294.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1679.0, + 1404.0, + 1679.0, + 1404.0, + 1716.0, + 295.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1713.0, + 1404.0, + 1713.0, + 1404.0, + 1746.0, + 294.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1745.0, + 1404.0, + 1745.0, + 1404.0, + 1775.0, + 293.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1773.0, + 1187.0, + 1773.0, + 1187.0, + 1809.0, + 294.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 1773.0, + 1403.0, + 1773.0, + 1403.0, + 1809.0, + 1244.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 733.0, + 1404.0, + 733.0, + 1404.0, + 766.0, + 297.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 763.0, + 1406.0, + 763.0, + 1406.0, + 797.0, + 293.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 793.0, + 1406.0, + 793.0, + 1406.0, + 828.0, + 293.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 821.0, + 1407.0, + 821.0, + 1407.0, + 861.0, + 292.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 854.0, + 1154.0, + 854.0, + 1154.0, + 891.0, + 294.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 264.0, + 294.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 262.0, + 802.0, + 262.0, + 802.0, + 294.0, + 298.0, + 294.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1364, + 1405, + 1364, + 1405, + 1620, + 298, + 1620 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1634, + 1403, + 1634, + 1403, + 1788, + 298, + 1788 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1803, + 1403, + 1803, + 1403, + 1926, + 299, + 1926 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1096, + 1404, + 1096, + 1404, + 1189, + 299, + 1189 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 409, + 225, + 1303, + 225, + 1303, + 689, + 409, + 689 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 300, + 1941, + 1401, + 1941, + 1401, + 2034, + 300, + 2034 + ], + "score": 0.971 + }, + { + "category_id": 4, + "poly": [ + 296, + 735, + 1405, + 735, + 1405, + 891, + 296, + 891 + ], + "score": 0.945 + }, + { + "category_id": 0, + "poly": [ + 299, + 992, + 481, + 992, + 481, + 1029, + 299, + 1029 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 812, + 76, + 812, + 104, + 299, + 104 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 302, + 1285, + 719, + 1285, + 719, + 1317, + 302, + 1317 + ], + "score": 0.878 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.574 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.503 + }, + { + "category_id": 13, + "poly": [ + 672, + 1427, + 869, + 1427, + 869, + 1466, + 672, + 1466 + ], + "score": 0.92, + "latex": "\\mathbf { x } _ { p } \\in \\mathbb { R } ^ { N \\times ( P ^ { 2 } \\cdot C ) }" + }, + { + "category_id": 13, + "poly": [ + 959, + 1431, + 1047, + 1431, + 1047, + 1466, + 959, + 1466 + ], + "score": 0.92, + "latex": "( H , W )" + }, + { + "category_id": 13, + "poly": [ + 1157, + 1394, + 1329, + 1394, + 1329, + 1426, + 1157, + 1426 + ], + "score": 0.92, + "latex": "\\mathbf { x } \\in \\mathbb { R } ^ { H \\times W \\times \\dot { C } }" + }, + { + "category_id": 13, + "poly": [ + 1236, + 1464, + 1400, + 1464, + 1400, + 1500, + 1236, + 1500 + ], + "score": 0.92, + "latex": "N = H W / P ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 700, + 1467, + 775, + 1467, + 775, + 1499, + 700, + 1499 + ], + "score": 0.91, + "latex": "( P , P )" + }, + { + "category_id": 13, + "poly": [ + 443, + 1664, + 580, + 1664, + 580, + 1699, + 443, + 1699 + ], + "score": 0.9, + "latex": "( \\mathbf { z } _ { 0 } ^ { 0 } = \\mathbf { x } _ { \\mathrm { c l a s s } } )" + }, + { + "category_id": 13, + "poly": [ + 403, + 1725, + 436, + 1725, + 436, + 1760, + 403, + 1760 + ], + "score": 0.89, + "latex": "\\mathbf { z } _ { L } ^ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1199, + 1664, + 1250, + 1664, + 1250, + 1699, + 1199, + 1699 + ], + "score": 0.88, + "latex": "( \\mathbf { \\bar { z } } _ { L } ^ { 0 } )" + }, + { + "category_id": 13, + "poly": [ + 639, + 1558, + 666, + 1558, + 666, + 1585, + 639, + 1585 + ], + "score": 0.8, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 378, + 1467, + 403, + 1467, + 403, + 1495, + 378, + 1495 + ], + "score": 0.8, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 1015, + 1528, + 1042, + 1528, + 1042, + 1555, + 1015, + 1555 + ], + "score": 0.74, + "latex": "D" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 227.0, + 820.0, + 227.0, + 820.0, + 256.0, + 575.0, + 256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 235.0, + 1057.0, + 235.0, + 1057.0, + 249.0, + 1045.0, + 249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 227.0, + 1305.0, + 227.0, + 1305.0, + 256.0, + 1092.0, + 256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 276.0, + 496.0, + 276.0, + 496.0, + 304.0, + 443.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 275.0, + 1150.0, + 275.0, + 1150.0, + 304.0, + 1111.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 295.0, + 489.0, + 295.0, + 489.0, + 321.0, + 447.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 296.0, + 613.0, + 296.0, + 613.0, + 325.0, + 557.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 311.0, + 486.0, + 311.0, + 486.0, + 353.0, + 449.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 557.0, + 317.0, + 613.0, + 317.0, + 613.0, + 346.0, + 557.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 315.0, + 1059.0, + 315.0, + 1059.0, + 361.0, + 1042.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 332.0, + 1222.0, + 332.0, + 1222.0, + 361.0, + 1167.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 458.0, + 354.0, + 477.0, + 354.0, + 477.0, + 370.0, + 458.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 368.0, + 1059.0, + 368.0, + 1059.0, + 387.0, + 1042.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 369.0, + 1202.0, + 369.0, + 1202.0, + 387.0, + 1185.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 395.0, + 1059.0, + 395.0, + 1059.0, + 414.0, + 1042.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 391.0, + 1226.0, + 391.0, + 1226.0, + 423.0, + 1162.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 404.0, + 864.0, + 404.0, + 864.0, + 431.0, + 685.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1041.0, + 421.0, + 1061.0, + 421.0, + 1061.0, + 445.0, + 1041.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 451.0, + 1059.0, + 451.0, + 1059.0, + 468.0, + 1043.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 497.0, + 513.0, + 497.0, + 513.0, + 530.0, + 417.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 494.0, + 596.0, + 494.0, + 596.0, + 517.0, + 562.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 497.0, + 633.0, + 497.0, + 633.0, + 517.0, + 606.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 496.0, + 716.0, + 496.0, + 716.0, + 517.0, + 692.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 493.0, + 767.0, + 493.0, + 767.0, + 518.0, + 736.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 492.0, + 807.0, + 492.0, + 807.0, + 519.0, + 771.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 495.0, + 850.0, + 495.0, + 850.0, + 518.0, + 819.0, + 518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 477.0, + 1059.0, + 477.0, + 1059.0, + 524.0, + 1042.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 484.0, + 1248.0, + 484.0, + 1248.0, + 536.0, + 1140.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 409.0, + 524.0, + 533.0, + 524.0, + 533.0, + 564.0, + 409.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 535.0, + 969.0, + 535.0, + 969.0, + 564.0, + 647.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 534.0, + 1058.0, + 534.0, + 1058.0, + 547.0, + 1045.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 535.0, + 1243.0, + 535.0, + 1243.0, + 565.0, + 1147.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 559.0, + 1059.0, + 559.0, + 1059.0, + 578.0, + 1042.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 587.0, + 1059.0, + 587.0, + 1059.0, + 606.0, + 1042.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1164.0, + 570.0, + 1225.0, + 570.0, + 1225.0, + 599.0, + 1164.0, + 599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 601.0, + 648.0, + 601.0, + 648.0, + 630.0, + 613.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 599.0, + 733.0, + 599.0, + 733.0, + 630.0, + 660.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 620.0, + 1056.0, + 620.0, + 1056.0, + 629.0, + 1049.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 644.0, + 1057.0, + 644.0, + 1057.0, + 659.0, + 1045.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 638.0, + 1242.0, + 638.0, + 1242.0, + 665.0, + 1144.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 670.0, + 1058.0, + 670.0, + 1058.0, + 683.0, + 1045.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 659.0, + 1231.0, + 659.0, + 1231.0, + 687.0, + 1155.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.25, + 288.5, + 1213.25, + 288.5, + 1213.25, + 309.0, + 1171.25, + 309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.75, + 480.5, + 555.75, + 480.5, + 555.75, + 513.5, + 400.75, + 513.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 734.0, + 1403.0, + 734.0, + 1403.0, + 770.0, + 294.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 764.0, + 1406.0, + 764.0, + 1406.0, + 802.0, + 294.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 798.0, + 1403.0, + 798.0, + 1403.0, + 832.0, + 295.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 824.0, + 1403.0, + 824.0, + 1403.0, + 865.0, + 293.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 857.0, + 543.0, + 857.0, + 543.0, + 890.0, + 296.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 987.0, + 487.0, + 987.0, + 487.0, + 1037.0, + 290.0, + 1037.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, + 1280.0, + 725.0, + 1280.0, + 725.0, + 1325.0, + 293.0, + 1325.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": [ + 296.0, + 1366.0, + 1405.0, + 1366.0, + 1405.0, + 1401.0, + 296.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1388.0, + 1156.0, + 1388.0, + 1156.0, + 1434.0, + 288.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1388.0, + 1412.0, + 1388.0, + 1412.0, + 1434.0, + 1330.0, + 1434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1424.0, + 671.0, + 1424.0, + 671.0, + 1471.0, + 292.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 1424.0, + 958.0, + 1424.0, + 958.0, + 1471.0, + 870.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1424.0, + 1407.0, + 1424.0, + 1407.0, + 1471.0, + 1048.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1462.0, + 377.0, + 1462.0, + 377.0, + 1502.0, + 291.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1462.0, + 699.0, + 1462.0, + 699.0, + 1502.0, + 404.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1462.0, + 1235.0, + 1462.0, + 1235.0, + 1502.0, + 776.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1462.0, + 1406.0, + 1462.0, + 1406.0, + 1502.0, + 1401.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1494.0, + 1403.0, + 1494.0, + 1403.0, + 1532.0, + 293.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1523.0, + 1014.0, + 1523.0, + 1014.0, + 1564.0, + 292.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 1523.0, + 1406.0, + 1523.0, + 1406.0, + 1564.0, + 1043.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1555.0, + 638.0, + 1555.0, + 638.0, + 1593.0, + 293.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1555.0, + 1405.0, + 1555.0, + 1405.0, + 1593.0, + 667.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1585.0, + 897.0, + 1585.0, + 897.0, + 1626.0, + 293.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1633.0, + 1403.0, + 1633.0, + 1403.0, + 1670.0, + 296.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1661.0, + 442.0, + 1661.0, + 442.0, + 1703.0, + 293.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 1661.0, + 1198.0, + 1661.0, + 1198.0, + 1703.0, + 581.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1661.0, + 1407.0, + 1661.0, + 1407.0, + 1703.0, + 1251.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1694.0, + 1405.0, + 1694.0, + 1405.0, + 1731.0, + 293.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1716.0, + 402.0, + 1716.0, + 402.0, + 1768.0, + 291.0, + 1768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 1716.0, + 1407.0, + 1716.0, + 1407.0, + 1768.0, + 437.0, + 1768.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1756.0, + 874.0, + 1756.0, + 874.0, + 1792.0, + 294.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1804.0, + 1405.0, + 1804.0, + 1405.0, + 1837.0, + 295.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1835.0, + 1405.0, + 1835.0, + 1405.0, + 1868.0, + 295.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1865.0, + 1404.0, + 1865.0, + 1404.0, + 1900.0, + 294.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1895.0, + 990.0, + 1895.0, + 990.0, + 1931.0, + 294.0, + 1931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1094.0, + 1404.0, + 1094.0, + 1404.0, + 1133.0, + 293.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1130.0, + 1403.0, + 1130.0, + 1403.0, + 1161.0, + 297.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1158.0, + 1050.0, + 1158.0, + 1050.0, + 1192.0, + 295.0, + 1192.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1978.0, + 295.0, + 1978.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": [ + 294.0, + 2002.0, + 1406.0, + 2002.0, + 1406.0, + 2037.0, + 294.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1062, + 1404, + 1062, + 1404, + 1368, + 298, + 1368 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 475, + 1403, + 475, + 1403, + 750, + 297, + 750 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1758, + 1403, + 1758, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1480, + 1403, + 1480, + 1403, + 1664, + 298, + 1664 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 784, + 1403, + 784, + 1403, + 969, + 298, + 969 + ], + "score": 0.979 + }, + { + "category_id": 8, + "poly": [ + 903, + 327, + 1030, + 327, + 1030, + 358, + 903, + 358 + ], + "score": 0.902 + }, + { + "category_id": 0, + "poly": [ + 300, + 1412, + 556, + 1412, + 556, + 1447, + 300, + 1447 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 812, + 75, + 812, + 104, + 299, + 104 + ], + "score": 0.889 + }, + { + "category_id": 0, + "poly": [ + 299, + 1702, + 445, + 1702, + 445, + 1733, + 299, + 1733 + ], + "score": 0.886 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 939, + 229, + 939, + 262, + 297, + 262 + ], + "score": 0.872 + }, + { + "category_id": 0, + "poly": [ + 304, + 1004, + 853, + 1004, + 853, + 1035, + 304, + 1035 + ], + "score": 0.871 + }, + { + "category_id": 9, + "poly": [ + 1366, + 416, + 1400, + 416, + 1400, + 444, + 1366, + 444 + ], + "score": 0.856 + }, + { + "category_id": 9, + "poly": [ + 1366, + 371, + 1400, + 371, + 1400, + 401, + 1366, + 401 + ], + "score": 0.855 + }, + { + "category_id": 9, + "poly": [ + 1366, + 285, + 1400, + 285, + 1400, + 315, + 1366, + 315 + ], + "score": 0.853 + }, + { + "category_id": 9, + "poly": [ + 1366, + 330, + 1400, + 330, + 1400, + 358, + 1366, + 358 + ], + "score": 0.848 + }, + { + "category_id": 8, + "poly": [ + 355, + 278, + 854, + 278, + 854, + 320, + 355, + 320 + ], + "score": 0.825 + }, + { + "category_id": 8, + "poly": [ + 903, + 369, + 1030, + 369, + 1030, + 400, + 903, + 400 + ], + "score": 0.823 + }, + { + "category_id": 8, + "poly": [ + 351, + 326, + 715, + 326, + 715, + 361, + 351, + 361 + ], + "score": 0.767 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.748 + }, + { + "category_id": 8, + "poly": [ + 357, + 367, + 672, + 367, + 672, + 403, + 357, + 403 + ], + "score": 0.372 + }, + { + "category_id": 8, + "poly": [ + 331, + 275, + 1317, + 275, + 1317, + 320, + 331, + 320 + ], + "score": 0.308 + }, + { + "category_id": 8, + "poly": [ + 903, + 275, + 1313, + 275, + 1313, + 318, + 903, + 318 + ], + "score": 0.246 + }, + { + "category_id": 8, + "poly": [ + 899, + 275, + 1315, + 275, + 1315, + 318, + 899, + 318 + ], + "score": 0.205 + }, + { + "category_id": 8, + "poly": [ + 362, + 411, + 513, + 411, + 513, + 448, + 362, + 448 + ], + "score": 0.116 + }, + { + "category_id": 8, + "poly": [ + 351, + 316, + 695, + 316, + 695, + 446, + 351, + 446 + ], + "score": 0.113 + }, + { + "category_id": 13, + "poly": [ + 1167, + 1094, + 1257, + 1094, + 1257, + 1122, + 1167, + 1122 + ], + "score": 0.92, + "latex": "D \\times K" + }, + { + "category_id": 14, + "poly": [ + 344, + 271, + 1317, + 271, + 1317, + 453, + 344, + 453 + ], + "score": 0.91, + "latex": "\\begin{array} { r l r l } & { \\mathbf z _ { 0 } = [ \\mathbf x _ { \\mathrm { c l a s s } } ; \\mathbf x _ { p } ^ { 1 } \\mathbf E ; \\mathbf x _ { p } ^ { 2 } \\mathbf E ; \\cdot \\cdot \\cdot \\cdot \\cdot \\cdot ; \\mathbf x _ { p } ^ { N } \\mathbf E ] + \\mathbf E _ { p o s } , } & & { \\mathbf E \\in \\mathbb R ^ { ( P ^ { 2 } \\cdot C ) \\times D } , \\mathbf E _ { p o s } \\in \\mathbb R ^ { ( N + 1 ) \\times D } } \\\\ & { \\mathbf z ^ { \\prime } _ { \\ell } = \\mathrm { M S A } ( \\mathrm { L N } ( \\mathbf z _ { \\ell - 1 } ) ) + \\mathbf z _ { \\ell - 1 } , } & & { \\ell = 1 \\dots L } \\\\ & { \\mathbf z _ { \\ell } = \\mathrm { M L P } ( \\mathrm { L N } ( \\mathbf z ^ { \\prime } _ { \\ell } ) ) + \\mathbf z ^ { \\prime } _ { \\ell } , } & & { \\ell = 1 \\dots L } \\\\ & { \\mathbf y = \\mathrm { L N } ( \\mathbf z _ { L } ^ { 0 } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 445, + 1125, + 475, + 1125, + 475, + 1151, + 445, + 1151 + ], + "score": 0.8, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1223, + 1821, + 1269, + 1821, + 1269, + 1850, + 1223, + 1850 + ], + "score": 0.44, + "latex": "1 8 \\mathrm { k }" + }, + { + "category_id": 13, + "poly": [ + 419, + 846, + 444, + 846, + 444, + 874, + 419, + 874 + ], + "score": 0.26, + "latex": "\\mathbf { E }" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1409.0, + 562.0, + 1409.0, + 562.0, + 1453.0, + 293.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 72.0, + 816.0, + 72.0, + 816.0, + 108.0, + 295.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1699.0, + 449.0, + 1699.0, + 449.0, + 1736.0, + 294.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1003.0, + 856.0, + 1003.0, + 856.0, + 1039.0, + 297.0, + 1039.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": [ + 294.0, + 1061.0, + 1406.0, + 1061.0, + 1406.0, + 1096.0, + 294.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1093.0, + 1166.0, + 1093.0, + 1166.0, + 1125.0, + 294.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 1093.0, + 1404.0, + 1093.0, + 1404.0, + 1125.0, + 1258.0, + 1125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1121.0, + 444.0, + 1121.0, + 444.0, + 1159.0, + 293.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 1121.0, + 1406.0, + 1121.0, + 1406.0, + 1159.0, + 476.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1150.0, + 1405.0, + 1150.0, + 1405.0, + 1192.0, + 291.0, + 1192.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1182.0, + 1406.0, + 1182.0, + 1406.0, + 1220.0, + 293.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1214.0, + 1405.0, + 1214.0, + 1405.0, + 1252.0, + 293.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1245.0, + 1405.0, + 1245.0, + 1405.0, + 1281.0, + 294.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1273.0, + 1406.0, + 1273.0, + 1406.0, + 1311.0, + 293.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1306.0, + 1405.0, + 1306.0, + 1405.0, + 1342.0, + 294.0, + 1342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1334.0, + 1406.0, + 1334.0, + 1406.0, + 1371.0, + 293.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 477.0, + 1404.0, + 477.0, + 1404.0, + 510.0, + 296.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 504.0, + 1407.0, + 504.0, + 1407.0, + 544.0, + 294.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 538.0, + 1404.0, + 538.0, + 1404.0, + 571.0, + 296.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 568.0, + 1404.0, + 568.0, + 1404.0, + 601.0, + 296.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 598.0, + 1405.0, + 598.0, + 1405.0, + 635.0, + 293.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 628.0, + 1405.0, + 628.0, + 1405.0, + 665.0, + 295.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 659.0, + 1404.0, + 659.0, + 1404.0, + 692.0, + 296.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 687.0, + 1405.0, + 687.0, + 1405.0, + 724.0, + 294.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 721.0, + 448.0, + 721.0, + 448.0, + 751.0, + 296.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1759.0, + 1405.0, + 1759.0, + 1405.0, + 1795.0, + 294.0, + 1795.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": [ + 292.0, + 1819.0, + 1222.0, + 1819.0, + 1222.0, + 1856.0, + 292.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 1819.0, + 1405.0, + 1819.0, + 1405.0, + 1856.0, + 1270.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1848.0, + 1405.0, + 1848.0, + 1405.0, + 1886.0, + 293.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1883.0, + 1405.0, + 1883.0, + 1405.0, + 1916.0, + 296.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1909.0, + 1405.0, + 1909.0, + 1405.0, + 1948.0, + 293.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1939.0, + 1405.0, + 1939.0, + 1405.0, + 1978.0, + 292.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1966.0, + 1407.0, + 1966.0, + 1407.0, + 2012.0, + 292.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 666.0, + 2003.0, + 666.0, + 2036.0, + 294.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1481.0, + 1405.0, + 1481.0, + 1405.0, + 1516.0, + 296.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1509.0, + 1405.0, + 1509.0, + 1405.0, + 1548.0, + 293.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1542.0, + 1405.0, + 1542.0, + 1405.0, + 1577.0, + 294.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1572.0, + 1407.0, + 1572.0, + 1407.0, + 1608.0, + 294.0, + 1608.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": [ + 293.0, + 1632.0, + 893.0, + 1632.0, + 893.0, + 1670.0, + 293.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 784.0, + 1405.0, + 784.0, + 1405.0, + 819.0, + 294.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 813.0, + 1405.0, + 813.0, + 1405.0, + 851.0, + 293.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 843.0, + 418.0, + 843.0, + 418.0, + 883.0, + 293.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 843.0, + 1407.0, + 843.0, + 1407.0, + 883.0, + 445.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 875.0, + 1404.0, + 875.0, + 1404.0, + 912.0, + 293.0, + 912.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 904.0, + 1405.0, + 904.0, + 1405.0, + 943.0, + 293.0, + 943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 939.0, + 1310.0, + 939.0, + 1310.0, + 971.0, + 297.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 223.0, + 943.0, + 223.0, + 943.0, + 271.0, + 294.0, + 271.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1337, + 1404, + 1337, + 1404, + 1552, + 298, + 1552 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1650, + 1404, + 1650, + 1404, + 1897, + 298, + 1897 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 816, + 1404, + 816, + 1404, + 1062, + 298, + 1062 + ], + "score": 0.98 + }, + { + "category_id": 5, + "poly": [ + 471, + 224, + 1229, + 224, + 1229, + 372, + 471, + 372 + ], + "score": 0.98, + "html": "
ModelLayersHidden size DMLP sizeHeadsParams
ViT-Base1276830721286M
ViT-Large241024409616307M
ViT-Huge321280512016632M
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1076, + 1404, + 1076, + 1404, + 1322, + 298, + 1322 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 617, + 1403, + 617, + 1403, + 802, + 298, + 802 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 478, + 1404, + 478, + 1404, + 603, + 298, + 603 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1401, + 1911, + 1401, + 2034, + 299, + 2034 + ], + "score": 0.974 + }, + { + "category_id": 0, + "poly": [ + 303, + 1593, + 797, + 1593, + 797, + 1624, + 303, + 1624 + ], + "score": 0.901 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 813, + 75, + 813, + 105, + 298, + 105 + ], + "score": 0.895 + }, + { + "category_id": 6, + "poly": [ + 544, + 393, + 1154, + 393, + 1154, + 425, + 544, + 425 + ], + "score": 0.838 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.723 + }, + { + "category_id": 13, + "poly": [ + 1069, + 1427, + 1180, + 1427, + 1180, + 1463, + 1069, + 1463 + ], + "score": 0.93, + "latex": "\\{ - 1 , 1 \\} ^ { K }" + }, + { + "category_id": 13, + "poly": [ + 1128, + 710, + 1216, + 710, + 1216, + 739, + 1128, + 739 + ], + "score": 0.9, + "latex": "1 6 \\times 1 6" + }, + { + "category_id": 13, + "poly": [ + 424, + 1109, + 528, + 1109, + 528, + 1140, + 424, + 1140 + ], + "score": 0.88, + "latex": "\\beta _ { 1 } = 0 . 9" + }, + { + "category_id": 13, + "poly": [ + 538, + 1109, + 669, + 1109, + 669, + 1140, + 538, + 1140 + ], + "score": 0.87, + "latex": "\\beta _ { 2 } = 0 . 9 9 9" + }, + { + "category_id": 13, + "poly": [ + 641, + 1032, + 673, + 1032, + 673, + 1059, + 641, + 1059 + ], + "score": 0.61, + "latex": "4 \\mathbf { x }" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1589.0, + 802.0, + 1589.0, + 802.0, + 1629.0, + 294.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 814.0, + 73.0, + 814.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 389.0, + 1157.0, + 389.0, + 1157.0, + 428.0, + 540.0, + 428.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": [ + 292.0, + 1332.0, + 1404.0, + 1332.0, + 1404.0, + 1376.0, + 292.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1367.0, + 1404.0, + 1367.0, + 1404.0, + 1404.0, + 293.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1395.0, + 1405.0, + 1395.0, + 1405.0, + 1436.0, + 292.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1427.0, + 1068.0, + 1427.0, + 1068.0, + 1465.0, + 293.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 1427.0, + 1405.0, + 1427.0, + 1405.0, + 1465.0, + 1181.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1456.0, + 1405.0, + 1456.0, + 1405.0, + 1496.0, + 292.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1492.0, + 1402.0, + 1492.0, + 1402.0, + 1523.0, + 296.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1522.0, + 729.0, + 1522.0, + 729.0, + 1556.0, + 296.0, + 1556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1651.0, + 1405.0, + 1651.0, + 1405.0, + 1684.0, + 296.0, + 1684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1681.0, + 1405.0, + 1681.0, + 1405.0, + 1714.0, + 293.0, + 1714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1713.0, + 1402.0, + 1713.0, + 1402.0, + 1747.0, + 294.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1743.0, + 1402.0, + 1743.0, + 1402.0, + 1777.0, + 294.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1771.0, + 1405.0, + 1771.0, + 1405.0, + 1807.0, + 293.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1800.0, + 1406.0, + 1800.0, + 1406.0, + 1839.0, + 292.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1835.0, + 1405.0, + 1835.0, + 1405.0, + 1866.0, + 293.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1864.0, + 1160.0, + 1864.0, + 1160.0, + 1900.0, + 295.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 818.0, + 1404.0, + 818.0, + 1404.0, + 851.0, + 294.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 850.0, + 1404.0, + 850.0, + 1404.0, + 880.0, + 296.0, + 880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 879.0, + 1402.0, + 879.0, + 1402.0, + 913.0, + 294.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 908.0, + 1404.0, + 908.0, + 1404.0, + 943.0, + 293.0, + 943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 938.0, + 1405.0, + 938.0, + 1405.0, + 976.0, + 293.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 968.0, + 1405.0, + 968.0, + 1405.0, + 1006.0, + 293.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1001.0, + 1405.0, + 1001.0, + 1405.0, + 1035.0, + 294.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1030.0, + 640.0, + 1030.0, + 640.0, + 1065.0, + 293.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 1030.0, + 1325.0, + 1030.0, + 1325.0, + 1065.0, + 674.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1078.0, + 1404.0, + 1078.0, + 1404.0, + 1111.0, + 296.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1109.0, + 423.0, + 1109.0, + 423.0, + 1143.0, + 296.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 1109.0, + 537.0, + 1109.0, + 537.0, + 1143.0, + 529.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 670.0, + 1109.0, + 1404.0, + 1109.0, + 1404.0, + 1143.0, + 670.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1138.0, + 1405.0, + 1138.0, + 1405.0, + 1174.0, + 293.0, + 1174.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": [ + 293.0, + 1200.0, + 1405.0, + 1200.0, + 1405.0, + 1234.0, + 293.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1230.0, + 1406.0, + 1230.0, + 1406.0, + 1264.0, + 293.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1259.0, + 1404.0, + 1259.0, + 1404.0, + 1295.0, + 293.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1292.0, + 1223.0, + 1292.0, + 1223.0, + 1325.0, + 294.0, + 1325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 615.0, + 1405.0, + 615.0, + 1405.0, + 654.0, + 292.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 647.0, + 1407.0, + 647.0, + 1407.0, + 683.0, + 293.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 680.0, + 1404.0, + 680.0, + 1404.0, + 712.0, + 296.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 707.0, + 1127.0, + 707.0, + 1127.0, + 745.0, + 293.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1217.0, + 707.0, + 1405.0, + 707.0, + 1405.0, + 745.0, + 1217.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 737.0, + 1405.0, + 737.0, + 1405.0, + 777.0, + 293.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 768.0, + 1113.0, + 768.0, + 1113.0, + 806.0, + 293.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 477.0, + 1405.0, + 477.0, + 1405.0, + 512.0, + 295.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 508.0, + 1406.0, + 508.0, + 1406.0, + 545.0, + 292.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 541.0, + 1404.0, + 541.0, + 1404.0, + 572.0, + 294.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 573.0, + 1259.0, + 573.0, + 1259.0, + 606.0, + 296.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1943.0, + 295.0, + 1943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1976.0, + 295.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1971.0, + 1403.0, + 1971.0, + 1403.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 1405.0, + 2002.0, + 1405.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 301, + 223, + 1397, + 223, + 1397, + 549, + 301, + 549 + ], + "score": 0.983, + "html": "
Ours-JFT (ViT-H/14)Ours-JFT (ViT-L/16)Ours-I21k (ViT-L/16)BiT-L (ResNet152x4)Noisy Student (EfficientNet-L2)
ImageNet88.55 ± 0.0487.76±0.0385.30±0.0287.54±0.0288.4/88.5*
ImageNet ReaL90.72± 0.0590.54±0.0388.62 ±0.0590.5490.55
CIFAR-1099.50 ±0.0699.42 ± 0.0399.15±0.0399.37±0.061
CIFAR-10094.55 ± 0.0493.90± 0.0593.25± 0.0593.51± 0.081
Oxford-IIITPets97.56 ±0.0397.32 ± 0.1194.67 ± 0.1596.62± 0.23
Oxford Flowers-10299.68 ±0.0299.74± 0.0099.61±0.0299.63±0.03
VTAB (19 tasks)77.63 ±0.2376.28± 0.4672.72±0.2176.29 ± 1.701
TPUv3-core-days2.5k0.68k0.23k9.9k12.3k
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1737, + 1403, + 1737, + 1403, + 1952, + 297, + 1952 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 1149, + 1404, + 1149, + 1404, + 1364, + 297, + 1364 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1379, + 1403, + 1379, + 1403, + 1532, + 297, + 1532 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 315, + 792, + 1379, + 792, + 1379, + 1037, + 315, + 1037 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 301, + 1629, + 1402, + 1629, + 1402, + 1721, + 301, + 1721 + ], + "score": 0.959 + }, + { + "category_id": 2, + "poly": [ + 296, + 1978, + 1403, + 1978, + 1403, + 2034, + 296, + 2034 + ], + "score": 0.934 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.895 + }, + { + "category_id": 4, + "poly": [ + 301, + 1082, + 1383, + 1082, + 1383, + 1117, + 301, + 1117 + ], + "score": 0.894 + }, + { + "category_id": 1, + "poly": [ + 297, + 572, + 1404, + 572, + 1404, + 756, + 297, + 756 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 859, + 2089, + 859, + 2112, + 840, + 2112 + ], + "score": 0.799 + }, + { + "category_id": 0, + "poly": [ + 302, + 1571, + 813, + 1571, + 813, + 1602, + 302, + 1602 + ], + "score": 0.763 + }, + { + "category_id": 1, + "poly": [ + 302, + 1571, + 813, + 1571, + 813, + 1602, + 302, + 1602 + ], + "score": 0.14 + }, + { + "category_id": 13, + "poly": [ + 1156, + 693, + 1232, + 693, + 1232, + 724, + 1156, + 724 + ], + "score": 0.9, + "latex": "8 8 . 5 \\%" + }, + { + "category_id": 13, + "poly": [ + 603, + 1471, + 692, + 1471, + 692, + 1500, + 603, + 1500 + ], + "score": 0.26, + "latex": "\\mathrm { R } 1 5 2 \\mathrm { x } 4" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 790.0, + 381.0, + 790.0, + 381.0, + 826.0, + 345.0, + 826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 794.0, + 593.0, + 794.0, + 593.0, + 833.0, + 489.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 678.0, + 796.0, + 836.0, + 796.0, + 836.0, + 833.0, + 678.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 796.0, + 1149.0, + 796.0, + 1149.0, + 833.0, + 926.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1237.0, + 796.0, + 1368.0, + 796.0, + 1368.0, + 834.0, + 1237.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 826.0, + 354.0, + 826.0, + 354.0, + 977.0, + 313.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 835.0, + 922.0, + 835.0, + 922.0, + 870.0, + 885.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 855.0, + 377.0, + 855.0, + 377.0, + 888.0, + 347.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 883.0, + 652.0, + 883.0, + 652.0, + 917.0, + 613.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 883.0, + 922.0, + 883.0, + 922.0, + 918.0, + 885.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 883.0, + 1194.0, + 883.0, + 1194.0, + 917.0, + 1155.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 917.0, + 378.0, + 917.0, + 378.0, + 946.0, + 347.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 928.0, + 923.0, + 928.0, + 923.0, + 967.0, + 883.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 977.0, + 378.0, + 977.0, + 378.0, + 1008.0, + 346.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 977.0, + 652.0, + 977.0, + 652.0, + 1010.0, + 614.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 977.0, + 922.0, + 977.0, + 922.0, + 1010.0, + 885.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 977.0, + 1194.0, + 977.0, + 1194.0, + 1009.0, + 1156.0, + 1009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 992.0, + 550.0, + 992.0, + 550.0, + 1030.0, + 388.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 990.0, + 818.0, + 990.0, + 818.0, + 1032.0, + 661.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 995.0, + 1106.0, + 995.0, + 1106.0, + 1029.0, + 915.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 992.0, + 1373.0, + 992.0, + 1373.0, + 1030.0, + 1189.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2011.0, + 329.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 953.0, + 2002.0, + 953.0, + 2039.0, + 293.0, + 2039.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": [ + 303.0, + 1077.0, + 1385.0, + 1077.0, + 1385.0, + 1123.0, + 303.0, + 1123.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": [ + 293.0, + 1568.0, + 818.0, + 1568.0, + 818.0, + 1608.0, + 293.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1737.0, + 1403.0, + 1737.0, + 1403.0, + 1772.0, + 293.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1766.0, + 1404.0, + 1766.0, + 1404.0, + 1803.0, + 294.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1798.0, + 1404.0, + 1798.0, + 1404.0, + 1835.0, + 292.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1829.0, + 1405.0, + 1829.0, + 1405.0, + 1862.0, + 293.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1859.0, + 1405.0, + 1859.0, + 1405.0, + 1894.0, + 295.0, + 1894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1890.0, + 1404.0, + 1890.0, + 1404.0, + 1924.0, + 296.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1920.0, + 1405.0, + 1920.0, + 1405.0, + 1957.0, + 294.0, + 1957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1149.0, + 1405.0, + 1149.0, + 1405.0, + 1184.0, + 295.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1183.0, + 1404.0, + 1183.0, + 1404.0, + 1213.0, + 296.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1210.0, + 1406.0, + 1210.0, + 1406.0, + 1244.0, + 292.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1242.0, + 1406.0, + 1242.0, + 1406.0, + 1274.0, + 292.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1270.0, + 1405.0, + 1270.0, + 1405.0, + 1308.0, + 292.0, + 1308.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": [ + 293.0, + 1334.0, + 537.0, + 1334.0, + 537.0, + 1368.0, + 293.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1378.0, + 1404.0, + 1378.0, + 1404.0, + 1415.0, + 295.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1407.0, + 1405.0, + 1407.0, + 1405.0, + 1445.0, + 292.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1440.0, + 1403.0, + 1440.0, + 1403.0, + 1477.0, + 293.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1467.0, + 602.0, + 1467.0, + 602.0, + 1506.0, + 294.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 693.0, + 1467.0, + 1405.0, + 1467.0, + 1405.0, + 1506.0, + 693.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1500.0, + 981.0, + 1500.0, + 981.0, + 1537.0, + 295.0, + 1537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1627.0, + 1406.0, + 1627.0, + 1406.0, + 1663.0, + 296.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1658.0, + 1404.0, + 1658.0, + 1404.0, + 1692.0, + 296.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1692.0, + 446.0, + 1692.0, + 446.0, + 1727.0, + 296.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 568.0, + 1406.0, + 568.0, + 1406.0, + 608.0, + 292.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 601.0, + 1407.0, + 601.0, + 1407.0, + 639.0, + 291.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 632.0, + 1405.0, + 632.0, + 1405.0, + 667.0, + 295.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 663.0, + 1405.0, + 663.0, + 1405.0, + 698.0, + 295.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 692.0, + 1155.0, + 692.0, + 1155.0, + 727.0, + 295.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 692.0, + 1405.0, + 692.0, + 1405.0, + 727.0, + 1233.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 724.0, + 573.0, + 724.0, + 573.0, + 759.0, + 294.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1568.0, + 818.0, + 1568.0, + 818.0, + 1608.0, + 293.0, + 1608.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1590, + 1404, + 1590, + 1404, + 1926, + 297, + 1926 + ], + "score": 0.982 + }, + { + "category_id": 3, + "poly": [ + 341, + 861, + 1342, + 861, + 1342, + 1287, + 341, + 1287 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1401, + 1942, + 1401, + 2034, + 300, + 2034 + ], + "score": 0.97 + }, + { + "category_id": 4, + "poly": [ + 297, + 623, + 819, + 623, + 819, + 807, + 297, + 807 + ], + "score": 0.968 + }, + { + "category_id": 4, + "poly": [ + 852, + 624, + 1374, + 624, + 1374, + 807, + 852, + 807 + ], + "score": 0.965 + }, + { + "category_id": 4, + "poly": [ + 296, + 1317, + 1405, + 1317, + 1405, + 1441, + 296, + 1441 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 299, + 1512, + 1400, + 1512, + 1400, + 1574, + 299, + 1574 + ], + "score": 0.947 + }, + { + "category_id": 3, + "poly": [ + 859, + 238, + 1363, + 238, + 1363, + 583, + 859, + 583 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 812, + 76, + 812, + 104, + 299, + 104 + ], + "score": 0.89 + }, + { + "category_id": 3, + "poly": [ + 304, + 232, + 810, + 232, + 810, + 583, + 304, + 583 + ], + "score": 0.81 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 858, + 2088, + 858, + 2111, + 842, + 2111 + ], + "score": 0.653 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 859, + 2088, + 859, + 2111, + 842, + 2111 + ], + "score": 0.231 + }, + { + "category_id": 13, + "poly": [ + 1043, + 1804, + 1116, + 1804, + 1116, + 1833, + 1043, + 1833 + ], + "score": 0.86, + "latex": "9 0 \\mathbf { M } +" + }, + { + "category_id": 15, + "poly": [ + 573.0, + 854.0, + 684.0, + 854.0, + 684.0, + 897.0, + 573.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 857.0, + 1168.0, + 857.0, + 1168.0, + 896.0, + 1065.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 874.0, + 899.0, + 874.0, + 899.0, + 911.0, + 853.0, + 911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1308.0, + 927.0, + 1328.0, + 927.0, + 1328.0, + 945.0, + 1308.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 949.0, + 383.0, + 949.0, + 383.0, + 1168.0, + 342.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 953.0, + 839.0, + 953.0, + 839.0, + 973.0, + 820.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1229.0, + 947.0, + 1249.0, + 947.0, + 1249.0, + 967.0, + 1229.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 973.0, + 405.0, + 973.0, + 405.0, + 1007.0, + 370.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 973.0, + 707.0, + 973.0, + 707.0, + 997.0, + 682.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 964.0, + 764.0, + 964.0, + 764.0, + 988.0, + 741.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 985.0, + 898.0, + 985.0, + 898.0, + 1021.0, + 854.0, + 1021.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 995.0, + 1010.0, + 995.0, + 1010.0, + 1015.0, + 992.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 1006.0, + 523.0, + 1006.0, + 523.0, + 1024.0, + 503.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1065.0, + 468.0, + 1065.0, + 468.0, + 1082.0, + 448.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 1090.0, + 954.0, + 1090.0, + 954.0, + 1105.0, + 938.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 1093.0, + 898.0, + 1093.0, + 898.0, + 1130.0, + 854.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 1117.0, + 841.0, + 1117.0, + 841.0, + 1155.0, + 674.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1163.0, + 1117.0, + 1329.0, + 1117.0, + 1329.0, + 1155.0, + 1163.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1139.0, + 407.0, + 1139.0, + 407.0, + 1170.0, + 369.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 1147.0, + 803.0, + 1147.0, + 803.0, + 1186.0, + 673.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 1147.0, + 1289.0, + 1147.0, + 1289.0, + 1186.0, + 1161.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 639.0, + 1186.0, + 658.0, + 1186.0, + 658.0, + 1205.0, + 639.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 1175.0, + 750.0, + 1175.0, + 750.0, + 1211.0, + 674.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 1184.0, + 1148.0, + 1184.0, + 1148.0, + 1207.0, + 1126.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 1174.0, + 1238.0, + 1174.0, + 1238.0, + 1214.0, + 1160.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1218.0, + 437.0, + 1218.0, + 437.0, + 1256.0, + 394.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1220.0, + 634.0, + 1220.0, + 634.0, + 1256.0, + 591.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 785.0, + 1217.0, + 835.0, + 1217.0, + 835.0, + 1257.0, + 785.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 1202.0, + 928.0, + 1202.0, + 928.0, + 1257.0, + 853.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 1218.0, + 1122.0, + 1218.0, + 1122.0, + 1256.0, + 1078.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1220.0, + 1319.0, + 1220.0, + 1319.0, + 1257.0, + 1274.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 1252.0, + 1032.0, + 1252.0, + 1032.0, + 1290.0, + 660.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 963.5, + 1198.0, + 963.5, + 1198.0, + 977.0, + 1166.0, + 977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 622.0, + 823.0, + 622.0, + 823.0, + 657.0, + 295.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 654.0, + 822.0, + 654.0, + 822.0, + 684.0, + 295.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 682.0, + 822.0, + 682.0, + 822.0, + 718.0, + 294.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 715.0, + 822.0, + 715.0, + 822.0, + 749.0, + 295.0, + 749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 746.0, + 822.0, + 746.0, + 822.0, + 779.0, + 295.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 776.0, + 779.0, + 776.0, + 779.0, + 810.0, + 295.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 623.0, + 1375.0, + 623.0, + 1375.0, + 658.0, + 850.0, + 658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 656.0, + 1375.0, + 656.0, + 1375.0, + 687.0, + 850.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 685.0, + 1375.0, + 685.0, + 1375.0, + 717.0, + 849.0, + 717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 715.0, + 1376.0, + 715.0, + 1376.0, + 748.0, + 848.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 745.0, + 1376.0, + 745.0, + 1376.0, + 778.0, + 848.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 776.0, + 1244.0, + 776.0, + 1244.0, + 807.0, + 851.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1319.0, + 1403.0, + 1319.0, + 1403.0, + 1349.0, + 296.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1347.0, + 1403.0, + 1347.0, + 1403.0, + 1383.0, + 293.0, + 1383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1378.0, + 1406.0, + 1378.0, + 1406.0, + 1415.0, + 293.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1411.0, + 391.0, + 1411.0, + 391.0, + 1442.0, + 294.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 857.0, + 240.0, + 891.0, + 240.0, + 891.0, + 537.0, + 857.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 249.0, + 917.0, + 249.0, + 917.0, + 292.0, + 886.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 269.0, + 1203.0, + 269.0, + 1203.0, + 277.0, + 1195.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 317.0, + 913.0, + 317.0, + 913.0, + 345.0, + 884.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 380.0, + 913.0, + 380.0, + 913.0, + 408.0, + 885.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 444.0, + 912.0, + 444.0, + 912.0, + 468.0, + 885.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 447.0, + 1077.0, + 447.0, + 1077.0, + 455.0, + 1070.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 442.0, + 1206.0, + 442.0, + 1206.0, + 456.0, + 1193.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 440.0, + 1342.0, + 440.0, + 1342.0, + 448.0, + 1334.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 463.0, + 1337.0, + 463.0, + 1337.0, + 491.0, + 962.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 490.0, + 1056.0, + 490.0, + 1056.0, + 516.0, + 956.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 491.0, + 1344.0, + 491.0, + 1344.0, + 517.0, + 1059.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 504.0, + 914.0, + 504.0, + 914.0, + 531.0, + 884.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 532.0, + 975.0, + 532.0, + 975.0, + 559.0, + 922.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 532.0, + 1101.0, + 532.0, + 1101.0, + 559.0, + 1048.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 531.0, + 1243.0, + 531.0, + 1243.0, + 560.0, + 1181.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 531.0, + 1368.0, + 531.0, + 1368.0, + 560.0, + 1306.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 976.0, + 553.0, + 1297.0, + 553.0, + 1297.0, + 586.0, + 976.0, + 586.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": [ + 328.0, + 227.0, + 362.0, + 227.0, + 362.0, + 261.0, + 328.0, + 261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 251.0, + 339.0, + 251.0, + 339.0, + 521.0, + 298.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 252.0, + 784.0, + 252.0, + 784.0, + 293.0, + 755.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 297.0, + 359.0, + 297.0, + 359.0, + 326.0, + 328.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 294.0, + 596.0, + 294.0, + 596.0, + 341.0, + 563.0, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 308.0, + 780.0, + 308.0, + 780.0, + 335.0, + 756.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 366.0, + 360.0, + 366.0, + 360.0, + 394.0, + 329.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 355.0, + 591.0, + 355.0, + 591.0, + 388.0, + 568.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 363.0, + 776.0, + 363.0, + 776.0, + 380.0, + 760.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 763.0, + 388.0, + 774.0, + 388.0, + 774.0, + 401.0, + 763.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 396.0, + 406.0, + 396.0, + 406.0, + 446.0, + 373.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 435.0, + 359.0, + 435.0, + 359.0, + 464.0, + 329.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 429.0, + 624.0, + 429.0, + 624.0, + 466.0, + 542.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 430.0, + 788.0, + 430.0, + 788.0, + 463.0, + 701.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 465.0, + 397.0, + 465.0, + 397.0, + 479.0, + 384.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 469.0, + 568.0, + 469.0, + 568.0, + 482.0, + 554.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 573.0, + 456.0, + 665.0, + 456.0, + 665.0, + 489.0, + 573.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 458.0, + 788.0, + 458.0, + 788.0, + 488.0, + 701.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 499.0, + 369.0, + 499.0, + 369.0, + 534.0, + 327.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 379.0, + 491.0, + 403.0, + 491.0, + 403.0, + 516.0, + 379.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 493.0, + 569.0, + 493.0, + 569.0, + 509.0, + 553.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 484.0, + 665.0, + 484.0, + 665.0, + 514.0, + 575.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 484.0, + 790.0, + 484.0, + 790.0, + 514.0, + 675.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 524.0, + 436.0, + 524.0, + 436.0, + 560.0, + 346.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 524.0, + 641.0, + 524.0, + 641.0, + 557.0, + 520.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 524.0, + 816.0, + 524.0, + 816.0, + 557.0, + 720.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 551.0, + 670.0, + 551.0, + 670.0, + 587.0, + 491.0, + 587.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, + 1590.0, + 1405.0, + 1590.0, + 1405.0, + 1624.0, + 295.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1619.0, + 1404.0, + 1619.0, + 1404.0, + 1654.0, + 295.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1651.0, + 1405.0, + 1651.0, + 1405.0, + 1685.0, + 293.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1679.0, + 1405.0, + 1679.0, + 1405.0, + 1720.0, + 292.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1710.0, + 1405.0, + 1710.0, + 1405.0, + 1749.0, + 292.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1743.0, + 1404.0, + 1743.0, + 1404.0, + 1775.0, + 293.0, + 1775.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": [ + 292.0, + 1801.0, + 1042.0, + 1801.0, + 1042.0, + 1837.0, + 292.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 1801.0, + 1406.0, + 1801.0, + 1406.0, + 1837.0, + 1117.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1832.0, + 1404.0, + 1832.0, + 1404.0, + 1868.0, + 292.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1863.0, + 1404.0, + 1863.0, + 1404.0, + 1899.0, + 292.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1895.0, + 672.0, + 1895.0, + 672.0, + 1926.0, + 296.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1940.0, + 1403.0, + 1940.0, + 1403.0, + 1977.0, + 295.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2006.0, + 296.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2004.0, + 729.0, + 2004.0, + 729.0, + 2035.0, + 292.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1510.0, + 1405.0, + 1510.0, + 1405.0, + 1549.0, + 293.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1543.0, + 734.0, + 1543.0, + 734.0, + 1578.0, + 295.0, + 1578.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1154, + 1044, + 1154, + 1044, + 1459, + 298, + 1459 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 924, + 1044, + 924, + 1044, + 1138, + 298, + 1138 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 289, + 1404, + 289, + 1404, + 564, + 297, + 564 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 579, + 1404, + 579, + 1404, + 824, + 298, + 824 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1658, + 1404, + 1658, + 1404, + 1872, + 299, + 1872 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 299, + 1475, + 1043, + 1475, + 1043, + 1657, + 299, + 1657 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 1112, + 954, + 1378, + 954, + 1378, + 1420, + 1112, + 1420 + ], + "score": 0.962 + }, + { + "category_id": 4, + "poly": [ + 1065, + 1478, + 1402, + 1478, + 1402, + 1629, + 1065, + 1629 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 299, + 1972, + 1400, + 1972, + 1400, + 2034, + 299, + 2034 + ], + "score": 0.942 + }, + { + "category_id": 0, + "poly": [ + 303, + 866, + 792, + 866, + 792, + 897, + 303, + 897 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 300, + 230, + 564, + 230, + 564, + 260, + 300, + 260 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 813, + 76, + 813, + 104, + 300, + 104 + ], + "score": 0.888 + }, + { + "category_id": 0, + "poly": [ + 300, + 1913, + 594, + 1913, + 594, + 1944, + 300, + 1944 + ], + "score": 0.881 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.786 + }, + { + "category_id": 13, + "poly": [ + 945, + 672, + 1036, + 672, + 1036, + 701, + 945, + 701 + ], + "score": 0.88, + "latex": "2 - 4 \\times" + }, + { + "category_id": 13, + "poly": [ + 1034, + 381, + 1126, + 381, + 1126, + 410, + 1034, + 410 + ], + "score": 0.75, + "latex": "\\mathbf { R } 1 5 2 \\mathbf { x } 2" + }, + { + "category_id": 13, + "poly": [ + 587, + 381, + 678, + 381, + 678, + 410, + 587, + 410 + ], + "score": 0.63, + "latex": "\\mathbf { R } 1 5 2 \\mathbf { x } 2" + }, + { + "category_id": 13, + "poly": [ + 589, + 472, + 763, + 472, + 763, + 502, + 589, + 502 + ], + "score": 0.5, + "latex": "{ \\mathrm { R 5 0 + V i T - L } } / { 1 6 }" + }, + { + "category_id": 13, + "poly": [ + 1179, + 381, + 1271, + 381, + 1271, + 410, + 1179, + 410 + ], + "score": 0.41, + "latex": "{ \\mathrm { R } } 2 0 0 { \\mathrm { x } } 3 " + }, + { + "category_id": 13, + "poly": [ + 483, + 381, + 573, + 381, + 573, + 410, + 483, + 410 + ], + "score": 0.31, + "latex": "\\mathbf { R } 1 5 2 \\mathbf { x } 1" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 951.0, + 1384.0, + 951.0, + 1384.0, + 991.0, + 1137.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 1476.0, + 1405.0, + 1476.0, + 1405.0, + 1510.0, + 1066.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1507.0, + 1405.0, + 1507.0, + 1405.0, + 1539.0, + 1064.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1538.0, + 1405.0, + 1538.0, + 1405.0, + 1570.0, + 1064.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 1567.0, + 1406.0, + 1567.0, + 1406.0, + 1601.0, + 1062.0, + 1601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 1597.0, + 1155.0, + 1597.0, + 1155.0, + 1632.0, + 1063.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 864.0, + 798.0, + 864.0, + 798.0, + 900.0, + 297.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 570.0, + 227.0, + 570.0, + 265.0, + 293.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "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": [ + 293.0, + 1910.0, + 600.0, + 1910.0, + 600.0, + 1948.0, + 293.0, + 1948.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, + 1154.0, + 1046.0, + 1154.0, + 1046.0, + 1188.0, + 297.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1184.0, + 1047.0, + 1184.0, + 1047.0, + 1219.0, + 292.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1216.0, + 1045.0, + 1216.0, + 1045.0, + 1249.0, + 294.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1244.0, + 1045.0, + 1244.0, + 1045.0, + 1279.0, + 294.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1276.0, + 1046.0, + 1276.0, + 1046.0, + 1310.0, + 295.0, + 1310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1307.0, + 1045.0, + 1307.0, + 1045.0, + 1338.0, + 296.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1337.0, + 1047.0, + 1337.0, + 1047.0, + 1370.0, + 295.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1368.0, + 1046.0, + 1368.0, + 1046.0, + 1402.0, + 296.0, + 1402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1398.0, + 1047.0, + 1398.0, + 1047.0, + 1431.0, + 295.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1430.0, + 651.0, + 1430.0, + 651.0, + 1462.0, + 294.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 924.0, + 1046.0, + 924.0, + 1046.0, + 958.0, + 296.0, + 958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 955.0, + 1048.0, + 955.0, + 1048.0, + 989.0, + 294.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 984.0, + 1047.0, + 984.0, + 1047.0, + 1019.0, + 295.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1013.0, + 1046.0, + 1013.0, + 1046.0, + 1050.0, + 293.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1047.0, + 1046.0, + 1047.0, + 1046.0, + 1079.0, + 295.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1076.0, + 1048.0, + 1076.0, + 1048.0, + 1109.0, + 292.0, + 1109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1107.0, + 894.0, + 1107.0, + 894.0, + 1142.0, + 293.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 287.0, + 1405.0, + 287.0, + 1405.0, + 325.0, + 295.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 320.0, + 1405.0, + 320.0, + 1405.0, + 354.0, + 294.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 350.0, + 1405.0, + 350.0, + 1405.0, + 384.0, + 292.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 381.0, + 482.0, + 381.0, + 482.0, + 413.0, + 295.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 381.0, + 586.0, + 381.0, + 586.0, + 413.0, + 574.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 381.0, + 1033.0, + 381.0, + 1033.0, + 413.0, + 679.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 381.0, + 1178.0, + 381.0, + 1178.0, + 413.0, + 1127.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 381.0, + 1404.0, + 381.0, + 1404.0, + 413.0, + 1272.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 410.0, + 1406.0, + 410.0, + 1406.0, + 446.0, + 294.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 438.0, + 1404.0, + 438.0, + 1404.0, + 477.0, + 292.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 469.0, + 588.0, + 469.0, + 588.0, + 507.0, + 294.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 469.0, + 1404.0, + 469.0, + 1404.0, + 507.0, + 764.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 501.0, + 1406.0, + 501.0, + 1406.0, + 537.0, + 295.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 532.0, + 426.0, + 532.0, + 426.0, + 566.0, + 295.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 578.0, + 1406.0, + 578.0, + 1406.0, + 615.0, + 293.0, + 615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 608.0, + 1404.0, + 608.0, + 1404.0, + 646.0, + 292.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 640.0, + 1406.0, + 640.0, + 1406.0, + 674.0, + 292.0, + 674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 672.0, + 944.0, + 672.0, + 944.0, + 706.0, + 291.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 672.0, + 1406.0, + 672.0, + 1406.0, + 706.0, + 1037.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 698.0, + 1404.0, + 698.0, + 1404.0, + 739.0, + 292.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 725.0, + 1406.0, + 725.0, + 1406.0, + 771.0, + 291.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 764.0, + 1404.0, + 764.0, + 1404.0, + 797.0, + 294.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 794.0, + 1317.0, + 794.0, + 1317.0, + 827.0, + 296.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1657.0, + 1404.0, + 1657.0, + 1404.0, + 1691.0, + 297.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1689.0, + 1405.0, + 1689.0, + 1405.0, + 1723.0, + 295.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1718.0, + 1406.0, + 1718.0, + 1406.0, + 1753.0, + 294.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1750.0, + 1404.0, + 1750.0, + 1404.0, + 1785.0, + 294.0, + 1785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1780.0, + 1404.0, + 1780.0, + 1404.0, + 1813.0, + 294.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1807.0, + 1405.0, + 1807.0, + 1405.0, + 1847.0, + 293.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1840.0, + 1034.0, + 1840.0, + 1034.0, + 1878.0, + 294.0, + 1878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1475.0, + 1046.0, + 1475.0, + 1046.0, + 1508.0, + 296.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1504.0, + 1047.0, + 1504.0, + 1047.0, + 1540.0, + 294.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1535.0, + 1047.0, + 1535.0, + 1047.0, + 1570.0, + 294.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1566.0, + 1048.0, + 1566.0, + 1048.0, + 1599.0, + 294.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1597.0, + 1048.0, + 1597.0, + 1048.0, + 1629.0, + 293.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1627.0, + 1047.0, + 1627.0, + 1047.0, + 1660.0, + 296.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1970.0, + 1404.0, + 1970.0, + 1404.0, + 2008.0, + 295.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2000.0, + 1404.0, + 2000.0, + 1404.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1147, + 1404, + 1147, + 1404, + 1362, + 298, + 1362 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1377, + 1403, + 1377, + 1403, + 1561, + 298, + 1561 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 850, + 1404, + 850, + 1404, + 1034, + 298, + 1034 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 300, + 1673, + 1403, + 1673, + 1403, + 1825, + 300, + 1825 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 296, + 605, + 1405, + 605, + 1405, + 760, + 296, + 760 + ], + "score": 0.968 + }, + { + "category_id": 3, + "poly": [ + 294, + 254, + 1392, + 254, + 1392, + 575, + 294, + 575 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 301, + 1971, + 1398, + 1971, + 1398, + 2033, + 301, + 2033 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 300, + 1078, + 543, + 1078, + 543, + 1113, + 300, + 1113 + ], + "score": 0.885 + }, + { + "category_id": 1, + "poly": [ + 299, + 1922, + 1354, + 1922, + 1354, + 1954, + 299, + 1954 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 812, + 76, + 812, + 104, + 299, + 104 + ], + "score": 0.881 + }, + { + "category_id": 0, + "poly": [ + 302, + 1607, + 624, + 1607, + 624, + 1638, + 302, + 1638 + ], + "score": 0.865 + }, + { + "category_id": 0, + "poly": [ + 300, + 1872, + 488, + 1872, + 488, + 1905, + 300, + 1905 + ], + "score": 0.864 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2111, + 841, + 2111 + ], + "score": 0.75 + }, + { + "category_id": 13, + "poly": [ + 1042, + 913, + 1117, + 913, + 1117, + 941, + 1042, + 941 + ], + "score": 0.87, + "latex": "7 9 . 9 \\%" + }, + { + "category_id": 13, + "poly": [ + 602, + 943, + 643, + 943, + 643, + 972, + 602, + 972 + ], + "score": 0.87, + "latex": "2 \\%" + }, + { + "category_id": 13, + "poly": [ + 1008, + 943, + 1049, + 943, + 1049, + 972, + 1008, + 972 + ], + "score": 0.86, + "latex": "4 \\%" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 607.0, + 1402.0, + 607.0, + 1402.0, + 640.0, + 295.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 637.0, + 1403.0, + 637.0, + 1403.0, + 671.0, + 295.0, + 671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 665.0, + 1406.0, + 665.0, + 1406.0, + 702.0, + 295.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 694.0, + 1406.0, + 694.0, + 1406.0, + 733.0, + 293.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 729.0, + 1256.0, + 729.0, + 1256.0, + 762.0, + 295.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 253.0, + 604.0, + 253.0, + 604.0, + 283.0, + 398.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 273.0, + 637.0, + 273.0, + 637.0, + 303.0, + 364.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 280.0, + 1029.0, + 280.0, + 1029.0, + 313.0, + 776.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 282.0, + 1315.0, + 282.0, + 1315.0, + 312.0, + 1234.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 303.0, + 1056.0, + 303.0, + 1056.0, + 319.0, + 1043.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1100.0, + 306.0, + 1124.0, + 306.0, + 1124.0, + 533.0, + 1100.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 316.0, + 1156.0, + 316.0, + 1156.0, + 338.0, + 1121.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 318.0, + 883.0, + 318.0, + 883.0, + 334.0, + 858.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 322.0, + 786.0, + 322.0, + 786.0, + 334.0, + 777.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1210.0, + 327.0, + 1220.0, + 327.0, + 1220.0, + 337.0, + 1210.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 354.0, + 788.0, + 354.0, + 788.0, + 370.0, + 774.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 356.0, + 915.0, + 356.0, + 915.0, + 369.0, + 892.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 357.0, + 944.0, + 357.0, + 944.0, + 367.0, + 928.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 351.0, + 1157.0, + 351.0, + 1157.0, + 373.0, + 1121.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 348.0, + 1186.0, + 348.0, + 1186.0, + 369.0, + 1174.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 352.0, + 1204.0, + 352.0, + 1204.0, + 362.0, + 1194.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 349.0, + 1239.0, + 349.0, + 1239.0, + 369.0, + 1220.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 345.0, + 1255.0, + 345.0, + 1255.0, + 355.0, + 1246.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 336.0, + 1276.0, + 336.0, + 1276.0, + 367.0, + 1256.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1308.0, + 338.0, + 1331.0, + 338.0, + 1331.0, + 350.0, + 1308.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 752.0, + 362.0, + 779.0, + 362.0, + 779.0, + 484.0, + 752.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 362.0, + 1073.0, + 362.0, + 1073.0, + 481.0, + 1049.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 365.0, + 1265.0, + 365.0, + 1265.0, + 385.0, + 1256.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 382.0, + 788.0, + 382.0, + 788.0, + 403.0, + 774.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 379.0, + 877.0, + 379.0, + 877.0, + 392.0, + 858.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 377.0, + 913.0, + 377.0, + 913.0, + 395.0, + 890.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 376.0, + 950.0, + 376.0, + 950.0, + 394.0, + 928.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 386.0, + 1156.0, + 386.0, + 1156.0, + 405.0, + 1130.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 375.0, + 1194.0, + 375.0, + 1194.0, + 414.0, + 1174.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 379.0, + 1239.0, + 379.0, + 1239.0, + 393.0, + 1211.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 375.0, + 1255.0, + 375.0, + 1255.0, + 397.0, + 1246.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 500.0, + 438.0, + 516.0, + 438.0, + 516.0, + 453.0, + 500.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 416.0, + 791.0, + 416.0, + 791.0, + 468.0, + 773.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 452.0, + 877.0, + 452.0, + 877.0, + 466.0, + 860.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 411.0, + 913.0, + 411.0, + 913.0, + 467.0, + 892.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 409.0, + 950.0, + 409.0, + 950.0, + 467.0, + 927.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 419.0, + 1156.0, + 419.0, + 1156.0, + 472.0, + 1130.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 443.0, + 1177.0, + 443.0, + 1177.0, + 474.0, + 1165.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1184.0, + 397.0, + 1246.0, + 397.0, + 1246.0, + 485.0, + 1184.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 440.0, + 1380.0, + 440.0, + 1380.0, + 484.0, + 1318.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 479.0, + 792.0, + 479.0, + 792.0, + 499.0, + 773.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 485.0, + 1157.0, + 485.0, + 1157.0, + 508.0, + 1129.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 479.0, + 1174.0, + 479.0, + 1174.0, + 485.0, + 1167.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 479.0, + 1381.0, + 479.0, + 1381.0, + 503.0, + 1318.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 777.0, + 515.0, + 786.0, + 515.0, + 786.0, + 526.0, + 777.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 504.0, + 1175.0, + 504.0, + 1175.0, + 520.0, + 1166.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 508.0, + 1341.0, + 508.0, + 1341.0, + 522.0, + 1323.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 538.0, + 816.0, + 538.0, + 816.0, + 553.0, + 802.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 536.0, + 848.0, + 536.0, + 848.0, + 554.0, + 833.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 864.0, + 535.0, + 883.0, + 535.0, + 883.0, + 556.0, + 864.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 536.0, + 913.0, + 536.0, + 913.0, + 553.0, + 897.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 534.0, + 947.0, + 534.0, + 947.0, + 556.0, + 928.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 959.0, + 535.0, + 978.0, + 535.0, + 978.0, + 556.0, + 959.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 538.0, + 1005.0, + 538.0, + 1005.0, + 551.0, + 995.0, + 551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 528.0, + 1066.0, + 528.0, + 1066.0, + 542.0, + 1049.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 522.0, + 1155.0, + 522.0, + 1155.0, + 539.0, + 1140.0, + 539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1164.0, + 535.0, + 1177.0, + 535.0, + 1177.0, + 553.0, + 1164.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1207.0, + 535.0, + 1222.0, + 535.0, + 1222.0, + 553.0, + 1207.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 533.0, + 1275.0, + 533.0, + 1275.0, + 556.0, + 1246.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 532.0, + 1318.0, + 532.0, + 1318.0, + 556.0, + 1291.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 531.0, + 1365.0, + 531.0, + 1365.0, + 558.0, + 1331.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 551.0, + 975.0, + 551.0, + 975.0, + 577.0, + 832.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 548.0, + 1355.0, + 548.0, + 1355.0, + 579.0, + 1193.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.75, + 326.5, + 1385.75, + 326.5, + 1385.75, + 340.5, + 1354.75, + 340.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 549.75, + 439.5, + 582.75, + 439.5, + 582.75, + 460.0, + 549.75, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 444.0, + 980.0, + 444.0, + 980.0, + 453.0, + 963.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 456.0, + 1198.0, + 456.0, + 1198.0, + 467.0, + 1180.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1074.0, + 549.0, + 1074.0, + 549.0, + 1122.0, + 292.0, + 1122.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": [ + 300.0, + 1607.0, + 628.0, + 1607.0, + 628.0, + 1643.0, + 300.0, + 1643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1871.0, + 491.0, + 1871.0, + 491.0, + 1909.0, + 295.0, + 1909.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, + 1147.0, + 1404.0, + 1147.0, + 1404.0, + 1182.0, + 296.0, + 1182.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1178.0, + 1405.0, + 1178.0, + 1405.0, + 1213.0, + 296.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1206.0, + 1408.0, + 1206.0, + 1408.0, + 1245.0, + 293.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1237.0, + 1405.0, + 1237.0, + 1405.0, + 1275.0, + 293.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1269.0, + 1402.0, + 1269.0, + 1402.0, + 1304.0, + 294.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1298.0, + 1404.0, + 1298.0, + 1404.0, + 1335.0, + 295.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1331.0, + 859.0, + 1331.0, + 859.0, + 1364.0, + 296.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1375.0, + 1407.0, + 1375.0, + 1407.0, + 1413.0, + 294.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1408.0, + 1405.0, + 1408.0, + 1405.0, + 1442.0, + 293.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1439.0, + 1403.0, + 1439.0, + 1403.0, + 1474.0, + 294.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1468.0, + 1405.0, + 1468.0, + 1405.0, + 1504.0, + 292.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1499.0, + 1403.0, + 1499.0, + 1403.0, + 1535.0, + 294.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1530.0, + 1230.0, + 1530.0, + 1230.0, + 1565.0, + 294.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 851.0, + 1405.0, + 851.0, + 1405.0, + 886.0, + 293.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 880.0, + 1405.0, + 880.0, + 1405.0, + 917.0, + 291.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 910.0, + 1041.0, + 910.0, + 1041.0, + 950.0, + 293.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 910.0, + 1408.0, + 910.0, + 1408.0, + 950.0, + 1118.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 939.0, + 601.0, + 939.0, + 601.0, + 981.0, + 292.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 939.0, + 1007.0, + 939.0, + 1007.0, + 981.0, + 644.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 939.0, + 1405.0, + 939.0, + 1405.0, + 981.0, + 1050.0, + 981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 971.0, + 1404.0, + 971.0, + 1404.0, + 1007.0, + 294.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1004.0, + 1267.0, + 1004.0, + 1267.0, + 1036.0, + 294.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1670.0, + 1405.0, + 1670.0, + 1405.0, + 1708.0, + 294.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1700.0, + 1405.0, + 1700.0, + 1405.0, + 1739.0, + 294.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1732.0, + 1404.0, + 1732.0, + 1404.0, + 1769.0, + 294.0, + 1769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1762.0, + 1405.0, + 1762.0, + 1405.0, + 1800.0, + 294.0, + 1800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1792.0, + 843.0, + 1792.0, + 843.0, + 1830.0, + 294.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1969.0, + 1403.0, + 1969.0, + 1403.0, + 2008.0, + 295.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2003.0, + 911.0, + 2003.0, + 911.0, + 2035.0, + 323.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1917.0, + 1357.0, + 1917.0, + 1357.0, + 1960.0, + 295.0, + 1960.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.838 + }, + { + "category_id": 1, + "poly": [ + 292, + 941, + 1400, + 941, + 1400, + 1005, + 292, + 1005 + ], + "score": 0.737 + }, + { + "category_id": 1, + "poly": [ + 292, + 1026, + 1401, + 1026, + 1401, + 1091, + 292, + 1091 + ], + "score": 0.734 + }, + { + "category_id": 1, + "poly": [ + 291, + 1684, + 1403, + 1684, + 1403, + 1749, + 291, + 1749 + ], + "score": 0.716 + }, + { + "category_id": 1, + "poly": [ + 296, + 854, + 1404, + 854, + 1404, + 922, + 296, + 922 + ], + "score": 0.715 + }, + { + "category_id": 1, + "poly": [ + 294, + 228, + 1403, + 228, + 1403, + 294, + 294, + 294 + ], + "score": 0.713 + }, + { + "category_id": 1, + "poly": [ + 293, + 1598, + 1401, + 1598, + 1401, + 1664, + 293, + 1664 + ], + "score": 0.71 + }, + { + "category_id": 1, + "poly": [ + 294, + 600, + 1402, + 600, + 1402, + 665, + 294, + 665 + ], + "score": 0.698 + }, + { + "category_id": 1, + "poly": [ + 291, + 1196, + 1400, + 1196, + 1400, + 1262, + 291, + 1262 + ], + "score": 0.697 + }, + { + "category_id": 1, + "poly": [ + 294, + 1111, + 1401, + 1111, + 1401, + 1176, + 294, + 1176 + ], + "score": 0.696 + }, + { + "category_id": 1, + "poly": [ + 298, + 770, + 1402, + 770, + 1402, + 836, + 298, + 836 + ], + "score": 0.676 + }, + { + "category_id": 1, + "poly": [ + 297, + 685, + 1402, + 685, + 1402, + 750, + 297, + 750 + ], + "score": 0.676 + }, + { + "category_id": 1, + "poly": [ + 295, + 313, + 1400, + 313, + 1400, + 379, + 295, + 379 + ], + "score": 0.668 + }, + { + "category_id": 1, + "poly": [ + 294, + 1769, + 1400, + 1769, + 1400, + 1834, + 294, + 1834 + ], + "score": 0.663 + }, + { + "category_id": 1, + "poly": [ + 298, + 1428, + 1399, + 1428, + 1399, + 1493, + 298, + 1493 + ], + "score": 0.649 + }, + { + "category_id": 1, + "poly": [ + 297, + 1513, + 1402, + 1513, + 1402, + 1579, + 297, + 1579 + ], + "score": 0.647 + }, + { + "category_id": 1, + "poly": [ + 293, + 399, + 1401, + 399, + 1401, + 463, + 293, + 463 + ], + "score": 0.643 + }, + { + "category_id": 1, + "poly": [ + 293, + 1854, + 1403, + 1854, + 1403, + 1921, + 293, + 1921 + ], + "score": 0.621 + }, + { + "category_id": 1, + "poly": [ + 296, + 1281, + 1404, + 1281, + 1404, + 1407, + 296, + 1407 + ], + "score": 0.595 + }, + { + "category_id": 1, + "poly": [ + 296, + 484, + 1403, + 484, + 1403, + 580, + 296, + 580 + ], + "score": 0.521 + }, + { + "category_id": 1, + "poly": [ + 298, + 1941, + 1404, + 1941, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.509 + }, + { + "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, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 940.0, + 1403.0, + 940.0, + 1403.0, + 979.0, + 294.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 973.0, + 627.0, + 973.0, + 627.0, + 1005.0, + 322.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1025.0, + 1403.0, + 1025.0, + 1403.0, + 1064.0, + 294.0, + 1064.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1059.0, + 888.0, + 1059.0, + 888.0, + 1091.0, + 324.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1682.0, + 1406.0, + 1682.0, + 1406.0, + 1723.0, + 292.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1716.0, + 627.0, + 1716.0, + 627.0, + 1749.0, + 324.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 854.0, + 1405.0, + 854.0, + 1405.0, + 892.0, + 296.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 888.0, + 1337.0, + 888.0, + 1337.0, + 925.0, + 323.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 258.0, + 467.0, + 258.0, + 467.0, + 292.0, + 322.0, + 292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1599.0, + 1402.0, + 1599.0, + 1402.0, + 1631.0, + 296.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1631.0, + 748.0, + 1631.0, + 748.0, + 1663.0, + 322.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 600.0, + 1404.0, + 600.0, + 1404.0, + 636.0, + 296.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 633.0, + 1256.0, + 633.0, + 1256.0, + 666.0, + 323.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1194.0, + 1405.0, + 1194.0, + 1405.0, + 1237.0, + 291.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1226.0, + 1134.0, + 1226.0, + 1134.0, + 1264.0, + 323.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1111.0, + 1403.0, + 1111.0, + 1403.0, + 1147.0, + 293.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1143.0, + 694.0, + 1143.0, + 694.0, + 1180.0, + 322.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 771.0, + 1404.0, + 771.0, + 1404.0, + 807.0, + 296.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 802.0, + 1068.0, + 802.0, + 1068.0, + 837.0, + 322.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 684.0, + 1404.0, + 684.0, + 1404.0, + 723.0, + 293.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 718.0, + 602.0, + 718.0, + 602.0, + 750.0, + 321.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 314.0, + 1402.0, + 314.0, + 1402.0, + 350.0, + 294.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 345.0, + 500.0, + 345.0, + 500.0, + 377.0, + 322.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1767.0, + 1404.0, + 1767.0, + 1404.0, + 1808.0, + 293.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1799.0, + 499.0, + 1799.0, + 499.0, + 1832.0, + 322.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1422.0, + 1404.0, + 1422.0, + 1404.0, + 1471.0, + 292.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1459.0, + 588.0, + 1459.0, + 588.0, + 1493.0, + 322.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1512.0, + 1404.0, + 1512.0, + 1404.0, + 1549.0, + 296.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1546.0, + 1003.0, + 1546.0, + 1003.0, + 1580.0, + 322.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 399.0, + 1404.0, + 399.0, + 1404.0, + 435.0, + 295.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 431.0, + 750.0, + 431.0, + 750.0, + 466.0, + 322.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1854.0, + 1406.0, + 1854.0, + 1406.0, + 1894.0, + 293.0, + 1894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1886.0, + 1340.0, + 1886.0, + 1340.0, + 1923.0, + 325.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1285.0, + 1405.0, + 1285.0, + 1405.0, + 1318.0, + 294.0, + 1318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1312.0, + 1405.0, + 1312.0, + 1405.0, + 1350.0, + 320.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1344.0, + 1404.0, + 1344.0, + 1404.0, + 1379.0, + 323.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1377.0, + 753.0, + 1377.0, + 753.0, + 1406.0, + 324.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 483.0, + 1404.0, + 483.0, + 1404.0, + 520.0, + 295.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 515.0, + 1405.0, + 515.0, + 1405.0, + 550.0, + 323.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 548.0, + 675.0, + 548.0, + 675.0, + 579.0, + 324.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1942.0, + 1402.0, + 1942.0, + 1402.0, + 1975.0, + 296.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2007.0, + 323.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2002.0, + 474.0, + 2002.0, + 474.0, + 2033.0, + 323.0, + 2033.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.884 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.819 + }, + { + "category_id": 1, + "poly": [ + 294, + 985, + 1397, + 985, + 1397, + 1050, + 294, + 1050 + ], + "score": 0.816 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 1402, + 229, + 1402, + 293, + 297, + 293 + ], + "score": 0.786 + }, + { + "category_id": 1, + "poly": [ + 293, + 503, + 1400, + 503, + 1400, + 569, + 293, + 569 + ], + "score": 0.756 + }, + { + "category_id": 1, + "poly": [ + 294, + 450, + 1373, + 450, + 1373, + 486, + 294, + 486 + ], + "score": 0.753 + }, + { + "category_id": 1, + "poly": [ + 294, + 366, + 1400, + 366, + 1400, + 432, + 294, + 432 + ], + "score": 0.747 + }, + { + "category_id": 1, + "poly": [ + 292, + 587, + 1401, + 587, + 1401, + 654, + 292, + 654 + ], + "score": 0.729 + }, + { + "category_id": 1, + "poly": [ + 297, + 870, + 1404, + 870, + 1404, + 965, + 297, + 965 + ], + "score": 0.728 + }, + { + "category_id": 1, + "poly": [ + 300, + 786, + 1399, + 786, + 1399, + 851, + 300, + 851 + ], + "score": 0.725 + }, + { + "category_id": 1, + "poly": [ + 295, + 1184, + 1402, + 1184, + 1402, + 1249, + 295, + 1249 + ], + "score": 0.719 + }, + { + "category_id": 1, + "poly": [ + 293, + 1634, + 1400, + 1634, + 1400, + 1699, + 293, + 1699 + ], + "score": 0.714 + }, + { + "category_id": 1, + "poly": [ + 291, + 1550, + 1403, + 1550, + 1403, + 1614, + 291, + 1614 + ], + "score": 0.713 + }, + { + "category_id": 1, + "poly": [ + 297, + 312, + 1385, + 312, + 1385, + 348, + 297, + 348 + ], + "score": 0.712 + }, + { + "category_id": 1, + "poly": [ + 301, + 1436, + 1402, + 1436, + 1402, + 1531, + 301, + 1531 + ], + "score": 0.693 + }, + { + "category_id": 1, + "poly": [ + 290, + 1351, + 1404, + 1351, + 1404, + 1417, + 290, + 1417 + ], + "score": 0.692 + }, + { + "category_id": 1, + "poly": [ + 293, + 1718, + 1401, + 1718, + 1401, + 1783, + 293, + 1783 + ], + "score": 0.685 + }, + { + "category_id": 1, + "poly": [ + 296, + 1267, + 1404, + 1267, + 1404, + 1332, + 296, + 1332 + ], + "score": 0.678 + }, + { + "category_id": 1, + "poly": [ + 301, + 1971, + 1397, + 1971, + 1397, + 2035, + 301, + 2035 + ], + "score": 0.675 + }, + { + "category_id": 1, + "poly": [ + 302, + 671, + 1400, + 671, + 1400, + 768, + 302, + 768 + ], + "score": 0.674 + }, + { + "category_id": 1, + "poly": [ + 294, + 1803, + 1400, + 1803, + 1400, + 1867, + 294, + 1867 + ], + "score": 0.636 + }, + { + "category_id": 1, + "poly": [ + 299, + 1887, + 1399, + 1887, + 1399, + 1952, + 299, + 1952 + ], + "score": 0.617 + }, + { + "category_id": 1, + "poly": [ + 297, + 1069, + 1404, + 1069, + 1404, + 1164, + 297, + 1164 + ], + "score": 0.587 + }, + { + "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, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 988.0, + 1401.0, + 988.0, + 1401.0, + 1020.0, + 297.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1016.0, + 1205.0, + 1016.0, + 1205.0, + 1052.0, + 323.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 225.0, + 1404.0, + 225.0, + 1404.0, + 270.0, + 293.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 260.0, + 763.0, + 260.0, + 763.0, + 294.0, + 321.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 501.0, + 1402.0, + 501.0, + 1402.0, + 541.0, + 295.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 536.0, + 780.0, + 536.0, + 780.0, + 568.0, + 323.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 450.0, + 1370.0, + 450.0, + 1370.0, + 489.0, + 297.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 368.0, + 1405.0, + 368.0, + 1405.0, + 404.0, + 296.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 396.0, + 1373.0, + 396.0, + 1373.0, + 435.0, + 321.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 584.0, + 1403.0, + 584.0, + 1403.0, + 626.0, + 296.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 621.0, + 1341.0, + 621.0, + 1341.0, + 654.0, + 323.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 866.0, + 1402.0, + 866.0, + 1402.0, + 909.0, + 292.0, + 909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 903.0, + 1404.0, + 903.0, + 1404.0, + 937.0, + 322.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 933.0, + 529.0, + 933.0, + 529.0, + 965.0, + 324.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 785.0, + 1404.0, + 785.0, + 1404.0, + 822.0, + 294.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 817.0, + 1154.0, + 817.0, + 1154.0, + 853.0, + 324.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1182.0, + 1404.0, + 1182.0, + 1404.0, + 1220.0, + 293.0, + 1220.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1215.0, + 499.0, + 1215.0, + 499.0, + 1249.0, + 323.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1632.0, + 1402.0, + 1632.0, + 1402.0, + 1673.0, + 295.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1667.0, + 1014.0, + 1667.0, + 1014.0, + 1700.0, + 322.0, + 1700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1550.0, + 1405.0, + 1550.0, + 1405.0, + 1586.0, + 295.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1583.0, + 708.0, + 1583.0, + 708.0, + 1615.0, + 319.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 312.0, + 1385.0, + 312.0, + 1385.0, + 351.0, + 295.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1434.0, + 1407.0, + 1434.0, + 1407.0, + 1474.0, + 292.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1468.0, + 1407.0, + 1468.0, + 1407.0, + 1502.0, + 322.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1499.0, + 855.0, + 1499.0, + 855.0, + 1533.0, + 324.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1352.0, + 1405.0, + 1352.0, + 1405.0, + 1388.0, + 294.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1384.0, + 874.0, + 1384.0, + 874.0, + 1416.0, + 323.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1714.0, + 1404.0, + 1714.0, + 1404.0, + 1760.0, + 293.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1749.0, + 1092.0, + 1749.0, + 1092.0, + 1784.0, + 322.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1263.0, + 1405.0, + 1263.0, + 1405.0, + 1306.0, + 294.0, + 1306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1296.0, + 400.0, + 1296.0, + 400.0, + 1334.0, + 319.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1970.0, + 1402.0, + 1970.0, + 1402.0, + 2006.0, + 297.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 2002.0, + 1112.0, + 2002.0, + 1112.0, + 2036.0, + 322.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 669.0, + 1404.0, + 669.0, + 1404.0, + 711.0, + 294.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 705.0, + 1404.0, + 705.0, + 1404.0, + 739.0, + 323.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 734.0, + 888.0, + 734.0, + 888.0, + 769.0, + 322.0, + 769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1803.0, + 1404.0, + 1803.0, + 1404.0, + 1839.0, + 296.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1834.0, + 1024.0, + 1834.0, + 1024.0, + 1866.0, + 324.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1886.0, + 1404.0, + 1886.0, + 1404.0, + 1926.0, + 295.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1917.0, + 949.0, + 1917.0, + 949.0, + 1953.0, + 324.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1070.0, + 1402.0, + 1070.0, + 1402.0, + 1104.0, + 296.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1102.0, + 1405.0, + 1102.0, + 1405.0, + 1136.0, + 324.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1132.0, + 647.0, + 1132.0, + 647.0, + 1164.0, + 321.0, + 1164.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.889 + }, + { + "category_id": 1, + "poly": [ + 298, + 1180, + 1046, + 1180, + 1046, + 1215, + 298, + 1215 + ], + "score": 0.846 + }, + { + "category_id": 1, + "poly": [ + 298, + 901, + 1400, + 901, + 1400, + 965, + 298, + 965 + ], + "score": 0.835 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.834 + }, + { + "category_id": 1, + "poly": [ + 296, + 818, + 1399, + 818, + 1399, + 882, + 296, + 882 + ], + "score": 0.829 + }, + { + "category_id": 1, + "poly": [ + 299, + 1234, + 1400, + 1234, + 1400, + 1298, + 299, + 1298 + ], + "score": 0.824 + }, + { + "category_id": 1, + "poly": [ + 297, + 1317, + 1401, + 1317, + 1401, + 1381, + 297, + 1381 + ], + "score": 0.818 + }, + { + "category_id": 1, + "poly": [ + 292, + 229, + 1402, + 229, + 1402, + 293, + 292, + 293 + ], + "score": 0.778 + }, + { + "category_id": 1, + "poly": [ + 298, + 1399, + 1404, + 1399, + 1404, + 1524, + 298, + 1524 + ], + "score": 0.778 + }, + { + "category_id": 1, + "poly": [ + 298, + 1067, + 1404, + 1067, + 1404, + 1162, + 298, + 1162 + ], + "score": 0.759 + }, + { + "category_id": 1, + "poly": [ + 300, + 622, + 1397, + 622, + 1397, + 686, + 300, + 686 + ], + "score": 0.744 + }, + { + "category_id": 1, + "poly": [ + 297, + 704, + 1405, + 704, + 1405, + 799, + 297, + 799 + ], + "score": 0.72 + }, + { + "category_id": 1, + "poly": [ + 295, + 539, + 1397, + 539, + 1397, + 602, + 295, + 602 + ], + "score": 0.702 + }, + { + "category_id": 1, + "poly": [ + 293, + 311, + 1402, + 311, + 1402, + 377, + 293, + 377 + ], + "score": 0.7 + }, + { + "category_id": 1, + "poly": [ + 297, + 395, + 1405, + 395, + 1405, + 518, + 297, + 518 + ], + "score": 0.694 + }, + { + "category_id": 1, + "poly": [ + 295, + 1544, + 1400, + 1544, + 1400, + 1608, + 295, + 1608 + ], + "score": 0.656 + }, + { + "category_id": 1, + "poly": [ + 299, + 984, + 1403, + 984, + 1403, + 1049, + 299, + 1049 + ], + "score": 0.626 + }, + { + "category_id": 13, + "poly": [ + 1085, + 1316, + 1135, + 1316, + 1135, + 1348, + 1085, + 1348 + ], + "score": 0.82, + "latex": "\\mathrm { S ^ { 4 } L }" + }, + { + "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, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1181.0, + 1047.0, + 1181.0, + 1047.0, + 1218.0, + 297.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 901.0, + 1405.0, + 901.0, + 1405.0, + 937.0, + 294.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 929.0, + 480.0, + 929.0, + 480.0, + 966.0, + 322.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 819.0, + 1403.0, + 819.0, + 1403.0, + 855.0, + 297.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 851.0, + 1151.0, + 851.0, + 1151.0, + 882.0, + 322.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1230.0, + 1405.0, + 1230.0, + 1405.0, + 1272.0, + 294.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1267.0, + 884.0, + 1267.0, + 884.0, + 1297.0, + 324.0, + 1297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1314.0, + 1084.0, + 1314.0, + 1084.0, + 1354.0, + 295.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1314.0, + 1405.0, + 1314.0, + 1405.0, + 1354.0, + 1136.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1348.0, + 761.0, + 1348.0, + 761.0, + 1384.0, + 325.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 260.0, + 679.0, + 260.0, + 679.0, + 296.0, + 324.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1402.0, + 1404.0, + 1402.0, + 1404.0, + 1435.0, + 296.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1432.0, + 1404.0, + 1432.0, + 1404.0, + 1465.0, + 321.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1464.0, + 1405.0, + 1464.0, + 1405.0, + 1497.0, + 323.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1494.0, + 719.0, + 1494.0, + 719.0, + 1525.0, + 321.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1067.0, + 1405.0, + 1067.0, + 1405.0, + 1105.0, + 293.0, + 1105.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1096.0, + 1405.0, + 1096.0, + 1405.0, + 1138.0, + 322.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1129.0, + 699.0, + 1129.0, + 699.0, + 1163.0, + 323.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 619.0, + 1403.0, + 619.0, + 1403.0, + 660.0, + 295.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 653.0, + 1305.0, + 653.0, + 1305.0, + 689.0, + 322.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 704.0, + 1405.0, + 704.0, + 1405.0, + 742.0, + 295.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 736.0, + 1403.0, + 736.0, + 1403.0, + 772.0, + 323.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 767.0, + 622.0, + 767.0, + 622.0, + 797.0, + 322.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 536.0, + 1403.0, + 536.0, + 1403.0, + 576.0, + 295.0, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 571.0, + 1198.0, + 571.0, + 1198.0, + 602.0, + 323.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 310.0, + 1404.0, + 310.0, + 1404.0, + 349.0, + 293.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 343.0, + 1099.0, + 343.0, + 1099.0, + 378.0, + 324.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 395.0, + 1406.0, + 395.0, + 1406.0, + 431.0, + 294.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 427.0, + 1403.0, + 427.0, + 1403.0, + 460.0, + 324.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 455.0, + 1405.0, + 455.0, + 1405.0, + 494.0, + 320.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 484.0, + 397.0, + 484.0, + 397.0, + 520.0, + 320.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1543.0, + 1405.0, + 1543.0, + 1405.0, + 1582.0, + 294.0, + 1582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1572.0, + 478.0, + 1572.0, + 478.0, + 1609.0, + 323.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 983.0, + 1403.0, + 983.0, + 1403.0, + 1022.0, + 294.0, + 1022.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1015.0, + 467.0, + 1015.0, + 467.0, + 1049.0, + 323.0, + 1049.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 315, + 223, + 1385, + 223, + 1385, + 672, + 315, + 672 + ], + "score": 0.984, + "html": "
ModelsDatasetEpochsBase LRLR decayWeight decayDropout
ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
ViT-L/32JFT-300M76.10-4linear0.10.0
ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-H/14JFT-300M143.10-4linear0.10.0
R50x{1,2}JFT-300M710-3linear0.10.0
R101x1JFT-300M78.10-4linear0.10.0
R152x{1,2}JFT-300M76·10-4linear0.10.0
R50+ViT-B/{16,32}JFT-300M78.10-4linear0.10.0
R50+ViT-L/32JFT-300M72.10-4linear0.10.0
R50+ViT-L/16JFT-300M7/144·10-4linear0.10.0
ViT-B/{16,32}ImageNet-21k9010-3linear0.030.1
ViT-L/{16,32}ImageNet-21k30/9010-3linear0.030.1
ViT-*ImageNet3003.10-3cosine0.30.1
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1848, + 1403, + 1848, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1609, + 1404, + 1609, + 1404, + 1764, + 297, + 1764 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 300, + 981, + 1402, + 981, + 1402, + 1110, + 300, + 1110 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 300, + 1294, + 1403, + 1294, + 1403, + 1389, + 300, + 1389 + ], + "score": 0.968 + }, + { + "category_id": 8, + "poly": [ + 1027, + 1122, + 1230, + 1122, + 1230, + 1162, + 1027, + 1162 + ], + "score": 0.925 + }, + { + "category_id": 0, + "poly": [ + 303, + 913, + 791, + 913, + 791, + 949, + 303, + 949 + ], + "score": 0.914 + }, + { + "category_id": 0, + "poly": [ + 299, + 1552, + 495, + 1552, + 495, + 1584, + 299, + 1584 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 299, + 1483, + 675, + 1483, + 675, + 1519, + 299, + 1519 + ], + "score": 0.909 + }, + { + "category_id": 8, + "poly": [ + 1068, + 1174, + 1210, + 1174, + 1210, + 1215, + 1068, + 1215 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 301, + 75, + 812, + 75, + 812, + 105, + 301, + 105 + ], + "score": 0.899 + }, + { + "category_id": 8, + "poly": [ + 539, + 1169, + 861, + 1169, + 861, + 1224, + 539, + 1224 + ], + "score": 0.899 + }, + { + "category_id": 8, + "poly": [ + 466, + 1126, + 672, + 1126, + 672, + 1164, + 466, + 1164 + ], + "score": 0.867 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1183, + 1400, + 1183, + 1400, + 1212, + 1366, + 1212 + ], + "score": 0.865 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1130, + 1400, + 1130, + 1400, + 1159, + 1366, + 1159 + ], + "score": 0.864 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1232, + 1400, + 1232, + 1400, + 1261, + 1366, + 1261 + ], + "score": 0.862 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1408, + 1400, + 1408, + 1400, + 1438, + 1366, + 1438 + ], + "score": 0.857 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.856 + }, + { + "category_id": 8, + "poly": [ + 404, + 1402, + 1291, + 1402, + 1291, + 1444, + 404, + 1444 + ], + "score": 0.835 + }, + { + "category_id": 8, + "poly": [ + 485, + 1229, + 647, + 1229, + 647, + 1263, + 485, + 1263 + ], + "score": 0.784 + }, + { + "category_id": 0, + "poly": [ + 300, + 840, + 449, + 840, + 449, + 874, + 300, + 874 + ], + "score": 0.761 + }, + { + "category_id": 6, + "poly": [ + 301, + 695, + 1398, + 695, + 1398, + 789, + 301, + 789 + ], + "score": 0.754 + }, + { + "category_id": 0, + "poly": [ + 300, + 1796, + 558, + 1796, + 558, + 1828, + 300, + 1828 + ], + "score": 0.739 + }, + { + "category_id": 0, + "poly": [ + 299, + 1796, + 558, + 1796, + 558, + 1828, + 299, + 1828 + ], + "score": 0.422 + }, + { + "category_id": 1, + "poly": [ + 301, + 695, + 1398, + 695, + 1398, + 789, + 301, + 789 + ], + "score": 0.162 + }, + { + "category_id": 1, + "poly": [ + 300, + 840, + 449, + 840, + 449, + 874, + 300, + 874 + ], + "score": 0.159 + }, + { + "category_id": 8, + "poly": [ + 1077, + 1401, + 1290, + 1401, + 1290, + 1441, + 1077, + 1441 + ], + "score": 0.1 + }, + { + "category_id": 13, + "poly": [ + 1053, + 1355, + 1108, + 1355, + 1108, + 1389, + 1053, + 1389 + ], + "score": 0.92, + "latex": "D / k" + }, + { + "category_id": 13, + "poly": [ + 841, + 1011, + 972, + 1011, + 972, + 1042, + 841, + 1042 + ], + "score": 0.91, + "latex": "\\mathbf { z } \\in \\mathbb { R } ^ { N \\times \\dot { D } }" + }, + { + "category_id": 13, + "poly": [ + 847, + 1045, + 890, + 1045, + 890, + 1078, + 847, + 1078 + ], + "score": 0.9, + "latex": "A _ { i j }" + }, + { + "category_id": 13, + "poly": [ + 922, + 1076, + 951, + 1076, + 951, + 1110, + 922, + 1110 + ], + "score": 0.88, + "latex": "\\mathbf { q } ^ { i }" + }, + { + "category_id": 14, + "poly": [ + 460, + 1121, + 1240, + 1121, + 1240, + 1269, + 460, + 1269 + ], + "score": 0.88, + "latex": "\\begin{array} { r l } { [ \\mathbf { q } , \\mathbf { k } , \\mathbf { v } ] = \\mathbf { z } \\mathbf { U } _ { q k v } \\qquad } & { \\mathbf { U } _ { q k v } \\in \\mathbb { R } ^ { D \\times 3 D _ { h } } , } \\\\ { A = \\mathrm { s o f t m a x } \\left( \\mathbf { q } \\mathbf { k } ^ { \\top } / \\sqrt { D _ { h } } \\right) \\qquad } & { A \\in \\mathbb { R } ^ { N \\times N } , } \\\\ { \\mathrm { S A } ( \\mathbf { z } ) = A \\mathbf { v } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 406, + 1401, + 1291, + 1401, + 1291, + 1443, + 406, + 1443 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\mathrm { M S A } ( \\mathbf { z } ) = [ \\mathrm { S A } _ { 1 } ( z ) ; \\mathrm { S A } _ { 2 } ( z ) ; \\cdots \\ ; \\mathrm { S A } _ { k } ( z ) ] \\mathbf { U } _ { m s a } \\qquad \\quad \\mathbf { U } _ { m s a } \\in \\mathbb { R } ^ { k \\cdot D _ { h } \\times D } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1048, + 1076, + 1080, + 1076, + 1080, + 1106, + 1048, + 1106 + ], + "score": 0.87, + "latex": "\\mathbf { k } ^ { j }" + }, + { + "category_id": 13, + "poly": [ + 347, + 1912, + 400, + 1912, + 400, + 1941, + 347, + 1941 + ], + "score": 0.85, + "latex": "10 \\%" + }, + { + "category_id": 13, + "poly": [ + 649, + 1912, + 691, + 1912, + 691, + 1941, + 649, + 1941 + ], + "score": 0.84, + "latex": "2 \\%" + }, + { + "category_id": 13, + "poly": [ + 830, + 1912, + 871, + 1912, + 871, + 1941, + 830, + 1941 + ], + "score": 0.84, + "latex": "1 \\%" + }, + { + "category_id": 13, + "poly": [ + 1098, + 1297, + 1117, + 1297, + 1117, + 1323, + 1098, + 1323 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 14, + "poly": [ + 1026, + 1120, + 1232, + 1120, + 1232, + 1163, + 1026, + 1163 + ], + "score": 0.77, + "latex": "\\mathbf { U } _ { q k v } \\in \\mathbb { R } ^ { D \\times 3 D _ { h } } ," + }, + { + "category_id": 13, + "poly": [ + 729, + 1357, + 769, + 1357, + 769, + 1388, + 729, + 1388 + ], + "score": 0.69, + "latex": "D _ { h }" + }, + { + "category_id": 13, + "poly": [ + 700, + 1357, + 719, + 1357, + 719, + 1383, + 700, + 1383 + ], + "score": 0.64, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 375, + 1049, + 397, + 1049, + 397, + 1072, + 375, + 1072 + ], + "score": 0.56, + "latex": "\\mathbf { v }" + }, + { + "category_id": 13, + "poly": [ + 523, + 726, + 568, + 726, + 568, + 755, + 523, + 755 + ], + "score": 0.49, + "latex": "1 0 \\mathrm { k }" + }, + { + "category_id": 14, + "poly": [ + 1064, + 1173, + 1216, + 1173, + 1216, + 1214, + 1064, + 1214 + ], + "score": 0.29, + "latex": "A \\in \\mathbb { R } ^ { N \\times N } ," + }, + { + "category_id": 15, + "poly": [ + 296.0, + 912.0, + 795.0, + 912.0, + 795.0, + 952.0, + 296.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1549.0, + 497.0, + 1549.0, + 497.0, + 1589.0, + 292.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1481.0, + 678.0, + 1481.0, + 678.0, + 1523.0, + 293.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 73.0, + 815.0, + 73.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, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 838.0, + 452.0, + 838.0, + 452.0, + 878.0, + 297.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 695.0, + 1402.0, + 695.0, + 1402.0, + 729.0, + 296.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 726.0, + 522.0, + 726.0, + 522.0, + 760.0, + 295.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 726.0, + 1403.0, + 726.0, + 1403.0, + 760.0, + 569.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 757.0, + 893.0, + 757.0, + 893.0, + 791.0, + 296.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1795.0, + 559.0, + 1795.0, + 559.0, + 1831.0, + 295.0, + 1831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1795.0, + 559.0, + 1795.0, + 559.0, + 1831.0, + 295.0, + 1831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1846.0, + 1405.0, + 1846.0, + 1405.0, + 1886.0, + 294.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1877.0, + 1407.0, + 1877.0, + 1407.0, + 1919.0, + 292.0, + 1919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 346.0, + 1910.0, + 346.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 1910.0, + 648.0, + 1910.0, + 648.0, + 1946.0, + 401.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 1910.0, + 829.0, + 1910.0, + 829.0, + 1946.0, + 692.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1910.0, + 1405.0, + 1910.0, + 1405.0, + 1946.0, + 872.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1972.0, + 1403.0, + 1972.0, + 1403.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2001.0, + 1407.0, + 2001.0, + 1407.0, + 2041.0, + 293.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1607.0, + 1405.0, + 1607.0, + 1405.0, + 1645.0, + 294.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1641.0, + 1402.0, + 1641.0, + 1402.0, + 1675.0, + 296.0, + 1675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1671.0, + 1405.0, + 1671.0, + 1405.0, + 1708.0, + 294.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1702.0, + 1404.0, + 1702.0, + 1404.0, + 1736.0, + 296.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1732.0, + 683.0, + 1732.0, + 683.0, + 1767.0, + 293.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 981.0, + 1403.0, + 981.0, + 1403.0, + 1018.0, + 294.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1004.0, + 840.0, + 1004.0, + 840.0, + 1053.0, + 290.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 1004.0, + 1409.0, + 1004.0, + 1409.0, + 1053.0, + 973.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1043.0, + 374.0, + 1043.0, + 374.0, + 1079.0, + 294.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 1043.0, + 846.0, + 1043.0, + 846.0, + 1079.0, + 398.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 891.0, + 1043.0, + 1406.0, + 1043.0, + 1406.0, + 1079.0, + 891.0, + 1079.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1077.0, + 921.0, + 1077.0, + 921.0, + 1112.0, + 294.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 952.0, + 1077.0, + 1047.0, + 1077.0, + 1047.0, + 1112.0, + 952.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 1077.0, + 1265.0, + 1077.0, + 1265.0, + 1112.0, + 1081.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1290.0, + 1097.0, + 1290.0, + 1097.0, + 1332.0, + 293.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 1290.0, + 1403.0, + 1290.0, + 1403.0, + 1332.0, + 1118.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1326.0, + 1405.0, + 1326.0, + 1405.0, + 1360.0, + 296.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1356.0, + 699.0, + 1356.0, + 699.0, + 1390.0, + 294.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 1356.0, + 728.0, + 1356.0, + 728.0, + 1390.0, + 720.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 1356.0, + 1052.0, + 1356.0, + 1052.0, + 1390.0, + 770.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 1356.0, + 1120.0, + 1356.0, + 1120.0, + 1390.0, + 1109.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 695.0, + 1402.0, + 695.0, + 1402.0, + 729.0, + 296.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 726.0, + 522.0, + 726.0, + 522.0, + 760.0, + 295.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 726.0, + 1403.0, + 726.0, + 1403.0, + 760.0, + 569.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 757.0, + 893.0, + 757.0, + 893.0, + 791.0, + 296.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 838.0, + 452.0, + 838.0, + 452.0, + 878.0, + 297.0, + 878.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1366, + 1404, + 1366, + 1404, + 1641, + 298, + 1641 + ], + "score": 0.982 + }, + { + "category_id": 5, + "poly": [ + 531, + 223, + 1169, + 223, + 1169, + 454, + 531, + 454 + ], + "score": 0.978, + "html": "
DatasetStepsBase LR
ImageNet20000{0.003,0.01,0.03, 0.06}
CIFAR10010000{0.001,0.003,0.01,0.03}
CIFAR1010000{0.001,0.003,0.01, 0.03}
Oxford-IIITPets500{0.001,0.003,0.01,0.03}
Oxford Flowers-102500{0.001, 0.003,0.01, 0.03}
VTAB (19 tasks)25000.01
" + }, + { + "category_id": 1, + "poly": [ + 299, + 881, + 1403, + 881, + 1403, + 1066, + 299, + 1066 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1166, + 1403, + 1166, + 1403, + 1351, + 299, + 1351 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 634, + 1403, + 634, + 1403, + 758, + 299, + 758 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1657, + 1402, + 1657, + 1402, + 1811, + 298, + 1811 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1402, + 1942, + 1402, + 2034, + 300, + 2034 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 301, + 774, + 1399, + 774, + 1399, + 866, + 301, + 866 + ], + "score": 0.961 + }, + { + "category_id": 0, + "poly": [ + 299, + 1866, + 679, + 1866, + 679, + 1902, + 299, + 1902 + ], + "score": 0.897 + }, + { + "category_id": 0, + "poly": [ + 300, + 1109, + 622, + 1109, + 622, + 1141, + 300, + 1141 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 105, + 299, + 105 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.845 + }, + { + "category_id": 1, + "poly": [ + 298, + 476, + 1402, + 476, + 1402, + 568, + 298, + 568 + ], + "score": 0.628 + }, + { + "category_id": 6, + "poly": [ + 298, + 476, + 1402, + 476, + 1402, + 568, + 298, + 568 + ], + "score": 0.282 + }, + { + "category_id": 13, + "poly": [ + 726, + 1396, + 814, + 1396, + 814, + 1426, + 726, + 1426 + ], + "score": 0.9, + "latex": "2 \\cdot 1 0 ^ { - 4 }" + }, + { + "category_id": 13, + "poly": [ + 1308, + 1459, + 1402, + 1459, + 1402, + 1488, + 1308, + 1488 + ], + "score": 0.89, + "latex": "1 6 \\times 1 6" + }, + { + "category_id": 13, + "poly": [ + 952, + 1460, + 1018, + 1460, + 1018, + 1487, + 952, + 1487 + ], + "score": 0.89, + "latex": "4 \\times 4" + }, + { + "category_id": 13, + "poly": [ + 542, + 1230, + 612, + 1230, + 612, + 1260, + 542, + 1260 + ], + "score": 0.89, + "latex": "( 8 0 \\% )" + }, + { + "category_id": 13, + "poly": [ + 914, + 1581, + 968, + 1581, + 968, + 1610, + 914, + 1610 + ], + "score": 0.87, + "latex": "15 \\%" + }, + { + "category_id": 13, + "poly": [ + 981, + 1035, + 1113, + 1035, + 1113, + 1065, + 981, + 1065 + ], + "score": 0.87, + "latex": "( 3 8 4 \\times 3 8 4 )" + }, + { + "category_id": 13, + "poly": [ + 299, + 1260, + 369, + 1260, + 369, + 1291, + 299, + 1291 + ], + "score": 0.87, + "latex": "( 1 0 \\% )" + }, + { + "category_id": 13, + "poly": [ + 495, + 1199, + 550, + 1199, + 550, + 1228, + 495, + 1228 + ], + "score": 0.86, + "latex": "50 \\%" + }, + { + "category_id": 13, + "poly": [ + 1019, + 1229, + 1090, + 1229, + 1090, + 1260, + 1019, + 1260 + ], + "score": 0.86, + "latex": "( 1 0 \\% )" + }, + { + "category_id": 13, + "poly": [ + 653, + 1750, + 712, + 1750, + 712, + 1780, + 653, + 1780 + ], + "score": 0.59, + "latex": "1 0 0 \\mathrm { k }" + }, + { + "category_id": 13, + "poly": [ + 952, + 1399, + 997, + 1399, + 997, + 1427, + 952, + 1427 + ], + "score": 0.43, + "latex": "1 0 \\mathrm { k }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1862.0, + 685.0, + 1862.0, + 685.0, + 1908.0, + 295.0, + 1908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1107.0, + 626.0, + 1107.0, + 626.0, + 1145.0, + 295.0, + 1145.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": [ + 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, + 473.0, + 1406.0, + 473.0, + 1406.0, + 514.0, + 292.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 506.0, + 1407.0, + 506.0, + 1407.0, + 544.0, + 293.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 536.0, + 624.0, + 536.0, + 624.0, + 570.0, + 294.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1367.0, + 1406.0, + 1367.0, + 1406.0, + 1403.0, + 296.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1393.0, + 725.0, + 1393.0, + 725.0, + 1436.0, + 292.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 815.0, + 1393.0, + 951.0, + 1393.0, + 951.0, + 1436.0, + 815.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 1393.0, + 1405.0, + 1393.0, + 1405.0, + 1436.0, + 998.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1427.0, + 1406.0, + 1427.0, + 1406.0, + 1464.0, + 293.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1455.0, + 951.0, + 1455.0, + 951.0, + 1496.0, + 293.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1019.0, + 1455.0, + 1307.0, + 1455.0, + 1307.0, + 1496.0, + 1019.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1455.0, + 1408.0, + 1455.0, + 1408.0, + 1496.0, + 1403.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1487.0, + 1407.0, + 1487.0, + 1407.0, + 1524.0, + 291.0, + 1524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1519.0, + 1404.0, + 1519.0, + 1404.0, + 1556.0, + 294.0, + 1556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1549.0, + 1406.0, + 1549.0, + 1406.0, + 1586.0, + 294.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1579.0, + 913.0, + 1579.0, + 913.0, + 1615.0, + 293.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 1579.0, + 1405.0, + 1579.0, + 1405.0, + 1615.0, + 969.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1612.0, + 1049.0, + 1612.0, + 1049.0, + 1644.0, + 296.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 879.0, + 1405.0, + 879.0, + 1405.0, + 918.0, + 293.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 912.0, + 1405.0, + 912.0, + 1405.0, + 947.0, + 294.0, + 947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 939.0, + 1407.0, + 939.0, + 1407.0, + 982.0, + 292.0, + 982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 971.0, + 1405.0, + 971.0, + 1405.0, + 1009.0, + 294.0, + 1009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1003.0, + 1405.0, + 1003.0, + 1405.0, + 1038.0, + 294.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1033.0, + 980.0, + 1033.0, + 980.0, + 1066.0, + 294.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1033.0, + 1260.0, + 1033.0, + 1260.0, + 1066.0, + 1114.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1167.0, + 1405.0, + 1167.0, + 1405.0, + 1203.0, + 297.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1199.0, + 494.0, + 1199.0, + 494.0, + 1234.0, + 294.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 1199.0, + 1405.0, + 1199.0, + 1405.0, + 1234.0, + 551.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1225.0, + 541.0, + 1225.0, + 541.0, + 1266.0, + 297.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 613.0, + 1225.0, + 1018.0, + 1225.0, + 1018.0, + 1266.0, + 613.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 1225.0, + 1405.0, + 1225.0, + 1405.0, + 1266.0, + 1091.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1260.0, + 298.0, + 1260.0, + 298.0, + 1295.0, + 295.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1260.0, + 1405.0, + 1260.0, + 1405.0, + 1295.0, + 370.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1288.0, + 1407.0, + 1288.0, + 1407.0, + 1327.0, + 293.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1321.0, + 545.0, + 1321.0, + 545.0, + 1355.0, + 293.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 633.0, + 1405.0, + 633.0, + 1405.0, + 669.0, + 293.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 666.0, + 1404.0, + 666.0, + 1404.0, + 698.0, + 295.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 696.0, + 1404.0, + 696.0, + 1404.0, + 732.0, + 293.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 726.0, + 452.0, + 726.0, + 452.0, + 760.0, + 293.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1657.0, + 1404.0, + 1657.0, + 1404.0, + 1690.0, + 296.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1689.0, + 1403.0, + 1689.0, + 1403.0, + 1722.0, + 296.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1718.0, + 1403.0, + 1718.0, + 1403.0, + 1751.0, + 296.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1746.0, + 652.0, + 1746.0, + 652.0, + 1787.0, + 293.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 1746.0, + 1406.0, + 1746.0, + 1406.0, + 1787.0, + 713.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1778.0, + 421.0, + 1778.0, + 421.0, + 1816.0, + 293.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1941.0, + 1404.0, + 1941.0, + 1404.0, + 1978.0, + 295.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1406.0, + 1971.0, + 1406.0, + 2007.0, + 293.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 1406.0, + 2002.0, + 1406.0, + 2040.0, + 295.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 773.0, + 1405.0, + 773.0, + 1405.0, + 810.0, + 296.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 806.0, + 1404.0, + 806.0, + 1404.0, + 839.0, + 296.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 833.0, + 1403.0, + 833.0, + 1403.0, + 873.0, + 295.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 473.0, + 1406.0, + 473.0, + 1406.0, + 514.0, + 292.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 506.0, + 1407.0, + 506.0, + 1407.0, + 544.0, + 293.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 536.0, + 624.0, + 536.0, + 624.0, + 570.0, + 294.0, + 570.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 303, + 224, + 1405, + 224, + 1405, + 843, + 303, + 843 + ], + "score": 0.984, + "html": "
ViT-B/16ViT-B/32ViT-L/16ViT-L/32ViT-H/14
ImageNetCIFAR-1098.1397.7797.8697.94
CIFAR-10087.1386.3186.3587.07
ImageNet77.9173.3876.5371.16
ImageNet ReaL83.5779.5682.1977.83
Oxford Flowers-10289.4985.4389.6686.36
Oxford-IIIT-Pets93.8192.0493.6491.35■
ImageNet-21kCIFAR-1098.9598.7999.1699.1399.27
CIFAR-10091.6791.9793.4493.0493.82
ImageNet83.9781.2885.1580.9985.13
ImageNet ReaL88.3586.6388.4085.6588.70
Oxford Flowers-102 Oxford-IIIT-Pets99.3899.1199.6199.1999.51
94.4393.0294.7393.0994.82
JFT-300MCIFAR-1099.0098.6199.3899.1999.50
CIFAR-10091.8790.4994.0492.5294.55
ImageNet84.1580.7387.1284.3788.04
ImageNet ReaL88.8586.2789.9988.2890.33
Oxford Flowers-10299.5699.2799.5699.4599.68
Oxford-IIIT-Pets95.8093.4097.1195.8397.56
" + }, + { + "category_id": 5, + "poly": [ + 299, + 1018, + 1401, + 1018, + 1401, + 1530, + 299, + 1530 + ], + "score": 0.984, + "html": "
ModelEpochsImageNetImageNet ReaLCIFAR-10CIFAR-100PetsFlowersexaFLOPs
ViT-B/32780.7386.2798.6190.4993.4099.27164
ViT-B/16784.1588.8599.0091.8795.8099.56743
ViT-L/32784.3788.2899.1992.5295.8399.45574
ViT-L/16786.3089.4399.3893.4696.8199.662586
ViT-L/161487.1289.9999.3894.0497.1199.565172
ViT-H/141488.0890.3699.5094.7197.1199.7112826
ResNet50x1777.5484.5697.6786.0791.1194.26150
ResNet50x2782.1287.9498.2989.2093.4397.02592
ResNet101x1780.6787.0798.4889.1794.0895.95285
ResNet152x1781.8887.9698.8290.2294.1796.94427
ResNet152x2784.9789.6999.0692.0595.3798.621681
ResNet152x21485.5689.8999.2491.9295.7598.753362
ResNet200x31487.2290.1599.3493.5396.3299.0410212
R50x1+ViT-B/32784.9089.1599.0192.2495.7599.46315
R50x1+ViT-B/16785.5889.6599.1492.6396.6599.40855
R50x1+ViT-L/32785.6889.0499.2492.9396.9799.43725
R50x1+ViT-L/16786.6089.7299.1893.6497.0399.402704
R50x1+ViT-L/161487.1289.7699.3193.8997.3699.115165
" + }, + { + "category_id": 1, + "poly": [ + 300, + 1911, + 1403, + 1911, + 1403, + 2034, + 300, + 2034 + ], + "score": 0.972 + }, + { + "category_id": 6, + "poly": [ + 296, + 865, + 1404, + 865, + 1404, + 991, + 296, + 991 + ], + "score": 0.93 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.895 + }, + { + "category_id": 1, + "poly": [ + 300, + 1673, + 1402, + 1673, + 1402, + 1738, + 300, + 1738 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 837, + 2088, + 864, + 2088, + 864, + 2112, + 837, + 2112 + ], + "score": 0.835 + }, + { + "category_id": 0, + "poly": [ + 301, + 1784, + 706, + 1784, + 706, + 1818, + 301, + 1818 + ], + "score": 0.774 + }, + { + "category_id": 7, + "poly": [ + 294, + 1553, + 1402, + 1553, + 1402, + 1616, + 294, + 1616 + ], + "score": 0.652 + }, + { + "category_id": 0, + "poly": [ + 300, + 1852, + 738, + 1852, + 738, + 1885, + 300, + 1885 + ], + "score": 0.52 + }, + { + "category_id": 1, + "poly": [ + 300, + 1852, + 738, + 1852, + 738, + 1885, + 300, + 1885 + ], + "score": 0.399 + }, + { + "category_id": 1, + "poly": [ + 294, + 1553, + 1402, + 1553, + 1402, + 1616, + 294, + 1616 + ], + "score": 0.113 + }, + { + "category_id": 1, + "poly": [ + 301, + 1784, + 706, + 1784, + 706, + 1818, + 301, + 1818 + ], + "score": 0.105 + }, + { + "category_id": 13, + "poly": [ + 607, + 868, + 634, + 868, + 634, + 895, + 607, + 895 + ], + "score": 0.69, + "latex": "\\%" + }, + { + "category_id": 13, + "poly": [ + 772, + 1973, + 846, + 1973, + 846, + 2002, + 772, + 2002 + ], + "score": 0.32, + "latex": "1 5 2 \\mathrm { x } 2 " + }, + { + "category_id": 15, + "poly": [ + 295.0, + 866.0, + 606.0, + 866.0, + 606.0, + 902.0, + 295.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 866.0, + 1405.0, + 866.0, + 1405.0, + 902.0, + 635.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 896.0, + 1406.0, + 896.0, + 1406.0, + 930.0, + 293.0, + 930.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": [ + 293.0, + 957.0, + 1321.0, + 957.0, + 1321.0, + 993.0, + 293.0, + 993.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": [ + 833.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 833.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1781.0, + 711.0, + 1781.0, + 711.0, + 1824.0, + 294.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1549.0, + 1405.0, + 1549.0, + 1405.0, + 1591.0, + 292.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1585.0, + 375.0, + 1585.0, + 375.0, + 1624.0, + 292.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1851.0, + 741.0, + 1851.0, + 741.0, + 1887.0, + 295.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1912.0, + 1403.0, + 1912.0, + 1403.0, + 1945.0, + 295.0, + 1945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1974.0, + 771.0, + 1974.0, + 771.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2006.0, + 847.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2000.0, + 1407.0, + 2000.0, + 1407.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1672.0, + 1404.0, + 1672.0, + 1404.0, + 1708.0, + 296.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1703.0, + 1162.0, + 1703.0, + 1162.0, + 1744.0, + 294.0, + 1744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1851.0, + 741.0, + 1851.0, + 741.0, + 1887.0, + 295.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1549.0, + 1405.0, + 1549.0, + 1405.0, + 1591.0, + 292.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1585.0, + 375.0, + 1585.0, + 375.0, + 1624.0, + 292.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1781.0, + 711.0, + 1781.0, + 711.0, + 1824.0, + 294.0, + 1824.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1287, + 1404, + 1287, + 1404, + 1624, + 298, + 1624 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1060, + 1403, + 1060, + 1403, + 1184, + 298, + 1184 + ], + "score": 0.973 + }, + { + "category_id": 5, + "poly": [ + 542, + 223, + 1157, + 223, + 1157, + 481, + 542, + 481 + ], + "score": 0.972, + "html": "
ResNet50ResNet152x2
DatasetAdamSGDAdamSGD
ImageNet77.5478.2484.9784.37
CIFAR1097.6797.4699.0699.07
CIFAR10086.0785.1792.0591.06
Oxford-IIITPets91.1191.0095.3794.79
Oxford Flowers-10294.2692.0698.6299.32
Average89.3388.7994.0193.72
" + }, + { + "category_id": 3, + "poly": [ + 302, + 576, + 1355, + 576, + 1355, + 924, + 302, + 924 + ], + "score": 0.969 + }, + { + "category_id": 1, + "poly": [ + 299, + 1726, + 1404, + 1726, + 1404, + 1789, + 299, + 1789 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 372, + 1816, + 1403, + 1816, + 1403, + 2035, + 372, + 2035 + ], + "score": 0.926 + }, + { + "category_id": 4, + "poly": [ + 446, + 967, + 1253, + 967, + 1253, + 999, + 446, + 999 + ], + "score": 0.917 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 813, + 76, + 813, + 104, + 299, + 104 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 300, + 1227, + 640, + 1227, + 640, + 1258, + 300, + 1258 + ], + "score": 0.888 + }, + { + "category_id": 0, + "poly": [ + 300, + 1666, + 676, + 1666, + 676, + 1698, + 300, + 1698 + ], + "score": 0.882 + }, + { + "category_id": 2, + "poly": [ + 837, + 2088, + 865, + 2088, + 865, + 2112, + 837, + 2112 + ], + "score": 0.852 + }, + { + "category_id": 6, + "poly": [ + 458, + 504, + 1239, + 504, + 1239, + 537, + 458, + 537 + ], + "score": 0.772 + }, + { + "category_id": 13, + "poly": [ + 298, + 1380, + 483, + 1380, + 483, + 1410, + 298, + 1410 + ], + "score": 0.9, + "latex": "D _ { M L P } = 2 0 4 8" + }, + { + "category_id": 13, + "poly": [ + 1273, + 1349, + 1394, + 1349, + 1394, + 1378, + 1273, + 1378 + ], + "score": 0.88, + "latex": "D = 1 0 2 4" + }, + { + "category_id": 13, + "poly": [ + 955, + 2003, + 1008, + 2003, + 1008, + 2036, + 955, + 2036 + ], + "score": 0.87, + "latex": "D / 2" + }, + { + "category_id": 13, + "poly": [ + 618, + 2005, + 642, + 2005, + 642, + 2030, + 618, + 2030 + ], + "score": 0.79, + "latex": "Y" + }, + { + "category_id": 13, + "poly": [ + 397, + 2004, + 425, + 2004, + 425, + 2030, + 397, + 2030 + ], + "score": 0.78, + "latex": "X" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 574.0, + 916.0, + 574.0, + 916.0, + 604.0, + 872.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 595.0, + 373.0, + 595.0, + 373.0, + 629.0, + 325.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 600.0, + 750.0, + 600.0, + 750.0, + 614.0, + 736.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 595.0, + 788.0, + 595.0, + 788.0, + 609.0, + 772.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1280.0, + 602.0, + 1297.0, + 602.0, + 1297.0, + 615.0, + 1280.0, + 615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1319.0, + 597.0, + 1331.0, + 597.0, + 1331.0, + 608.0, + 1319.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 635.0, + 338.0, + 635.0, + 338.0, + 817.0, + 296.0, + 817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 643.0, + 915.0, + 643.0, + 915.0, + 668.0, + 873.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 645.0, + 879.0, + 645.0, + 879.0, + 721.0, + 847.0, + 721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 650.0, + 370.0, + 650.0, + 370.0, + 680.0, + 328.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 704.0, + 369.0, + 704.0, + 369.0, + 731.0, + 329.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 694.0, + 759.0, + 694.0, + 759.0, + 725.0, + 683.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 707.0, + 914.0, + 707.0, + 914.0, + 810.0, + 848.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1228.0, + 696.0, + 1304.0, + 696.0, + 1304.0, + 723.0, + 1228.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 721.0, + 719.0, + 721.0, + 719.0, + 751.0, + 680.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 721.0, + 1264.0, + 721.0, + 1264.0, + 751.0, + 1225.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 756.0, + 371.0, + 756.0, + 371.0, + 785.0, + 328.0, + 785.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 764.0, + 509.0, + 764.0, + 509.0, + 774.0, + 498.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 748.0, + 752.0, + 748.0, + 752.0, + 779.0, + 682.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 748.0, + 1296.0, + 748.0, + 1296.0, + 779.0, + 1226.0, + 779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 784.0, + 675.0, + 784.0, + 675.0, + 796.0, + 642.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 772.0, + 787.0, + 772.0, + 787.0, + 805.0, + 681.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 773.0, + 915.0, + 773.0, + 915.0, + 802.0, + 871.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 782.0, + 941.0, + 782.0, + 941.0, + 790.0, + 932.0, + 790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1191.0, + 785.0, + 1216.0, + 785.0, + 1216.0, + 793.0, + 1191.0, + 793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 776.0, + 1331.0, + 776.0, + 1331.0, + 802.0, + 1227.0, + 802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 808.0, + 372.0, + 808.0, + 372.0, + 839.0, + 328.0, + 839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 799.0, + 402.0, + 799.0, + 402.0, + 816.0, + 382.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 808.0, + 664.0, + 808.0, + 664.0, + 821.0, + 640.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 801.0, + 789.0, + 801.0, + 789.0, + 828.0, + 683.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1196.0, + 811.0, + 1209.0, + 811.0, + 1209.0, + 820.0, + 1196.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 800.0, + 1335.0, + 800.0, + 1335.0, + 828.0, + 1225.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 433.0, + 847.0, + 449.0, + 847.0, + 449.0, + 863.0, + 433.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 836.0, + 663.0, + 836.0, + 663.0, + 846.0, + 653.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 683.0, + 827.0, + 748.0, + 827.0, + 748.0, + 855.0, + 683.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 839.0, + 919.0, + 839.0, + 919.0, + 869.0, + 872.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 977.0, + 844.0, + 995.0, + 844.0, + 995.0, + 864.0, + 977.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 827.0, + 1292.0, + 827.0, + 1292.0, + 855.0, + 1227.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 866.0, + 592.0, + 866.0, + 592.0, + 899.0, + 544.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 869.0, + 812.0, + 869.0, + 812.0, + 896.0, + 766.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 866.0, + 1137.0, + 866.0, + 1137.0, + 899.0, + 1089.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1314.0, + 868.0, + 1358.0, + 868.0, + 1358.0, + 898.0, + 1314.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 891.0, + 683.0, + 891.0, + 683.0, + 924.0, + 489.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 891.0, + 1226.0, + 891.0, + 1226.0, + 924.0, + 1034.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 442.0, + 963.0, + 1258.0, + 963.0, + 1258.0, + 1005.0, + 442.0, + 1005.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": [ + 295.0, + 1226.0, + 643.0, + 1226.0, + 643.0, + 1262.0, + 295.0, + 1262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1663.0, + 678.0, + 1663.0, + 678.0, + 1702.0, + 294.0, + 1702.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": [ + 457.0, + 502.0, + 1241.0, + 502.0, + 1241.0, + 540.0, + 457.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1287.0, + 1405.0, + 1287.0, + 1405.0, + 1321.0, + 296.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1319.0, + 1405.0, + 1319.0, + 1405.0, + 1354.0, + 294.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1347.0, + 1272.0, + 1347.0, + 1272.0, + 1382.0, + 294.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1347.0, + 1405.0, + 1347.0, + 1405.0, + 1382.0, + 1395.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1379.0, + 297.0, + 1379.0, + 297.0, + 1417.0, + 294.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 1379.0, + 1405.0, + 1379.0, + 1405.0, + 1417.0, + 484.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1407.0, + 1406.0, + 1407.0, + 1406.0, + 1447.0, + 292.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1441.0, + 1404.0, + 1441.0, + 1404.0, + 1475.0, + 294.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1470.0, + 1404.0, + 1470.0, + 1404.0, + 1505.0, + 294.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1499.0, + 1405.0, + 1499.0, + 1405.0, + 1536.0, + 293.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1531.0, + 1406.0, + 1531.0, + 1406.0, + 1566.0, + 296.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1560.0, + 1405.0, + 1560.0, + 1405.0, + 1598.0, + 293.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1593.0, + 984.0, + 1593.0, + 984.0, + 1628.0, + 294.0, + 1628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1060.0, + 1404.0, + 1060.0, + 1404.0, + 1096.0, + 293.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1093.0, + 1405.0, + 1093.0, + 1405.0, + 1126.0, + 296.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1120.0, + 1404.0, + 1120.0, + 1404.0, + 1158.0, + 292.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1154.0, + 532.0, + 1154.0, + 532.0, + 1187.0, + 294.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1723.0, + 1404.0, + 1723.0, + 1404.0, + 1763.0, + 295.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1756.0, + 582.0, + 1756.0, + 582.0, + 1792.0, + 296.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1817.0, + 1292.0, + 1817.0, + 1292.0, + 1856.0, + 369.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1861.0, + 1405.0, + 1861.0, + 1405.0, + 1903.0, + 369.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1894.0, + 1140.0, + 1894.0, + 1140.0, + 1932.0, + 393.0, + 1932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1939.0, + 1406.0, + 1939.0, + 1406.0, + 1980.0, + 370.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1969.0, + 1405.0, + 1969.0, + 1405.0, + 2010.0, + 394.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 2003.0, + 617.0, + 2003.0, + 617.0, + 2038.0, + 426.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.0, + 2003.0, + 954.0, + 2003.0, + 954.0, + 2038.0, + 643.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 2003.0, + 1405.0, + 2003.0, + 1405.0, + 2038.0, + 1009.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1728, + 1404, + 1728, + 1404, + 2034, + 298, + 2034 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1499, + 1404, + 1499, + 1404, + 1713, + 297, + 1713 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 373, + 1180, + 1403, + 1180, + 1403, + 1457, + 373, + 1457 + ], + "score": 0.976 + }, + { + "category_id": 5, + "poly": [ + 439, + 223, + 1259, + 223, + 1259, + 413, + 439, + 413 + ], + "score": 0.973, + "html": "
Pos. Emb.Default/StemEvery LayerEvery Layer-Shared
No Pos. Emb.0.61382N/AN/A
1-D Pos. Emb.0.642060.639640.64292
2-D Pos. Emb.0.640010.640460.64022
Rel. Pos.Emb.0.64032N/AN/A
" + }, + { + "category_id": 3, + "poly": [ + 302, + 559, + 1401, + 559, + 1401, + 920, + 302, + 920 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 393, + 1076, + 1402, + 1076, + 1402, + 1139, + 393, + 1139 + ], + "score": 0.944 + }, + { + "category_id": 4, + "poly": [ + 397, + 955, + 1299, + 955, + 1299, + 989, + 397, + 989 + ], + "score": 0.924 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 812, + 75, + 812, + 105, + 298, + 105 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.852 + }, + { + "category_id": 6, + "poly": [ + 297, + 435, + 1404, + 435, + 1404, + 497, + 297, + 497 + ], + "score": 0.443 + }, + { + "category_id": 1, + "poly": [ + 297, + 435, + 1404, + 435, + 1404, + 497, + 297, + 497 + ], + "score": 0.388 + }, + { + "category_id": 13, + "poly": [ + 844, + 1306, + 939, + 1306, + 939, + 1338, + 844, + 1338 + ], + "score": 0.91, + "latex": "p _ { q } - p _ { k }" + }, + { + "category_id": 13, + "poly": [ + 561, + 1912, + 657, + 1912, + 657, + 1941, + 561, + 1941 + ], + "score": 0.9, + "latex": "1 4 \\times 1 4" + }, + { + "category_id": 13, + "poly": [ + 823, + 1912, + 945, + 1912, + 945, + 1941, + 823, + 1941 + ], + "score": 0.9, + "latex": "2 2 4 \\times 2 2 4" + }, + { + "category_id": 13, + "poly": [ + 867, + 1078, + 896, + 1078, + 896, + 1104, + 867, + 1104 + ], + "score": 0.83, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 950, + 1077, + 976, + 1077, + 976, + 1104, + 950, + 1104 + ], + "score": 0.74, + "latex": "Y" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 564.0, + 513.0, + 564.0, + 513.0, + 585.0, + 453.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 564.0, + 871.0, + 564.0, + 871.0, + 585.0, + 813.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 564.0, + 1231.0, + 564.0, + 1231.0, + 585.0, + 1172.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 579.0, + 593.0, + 579.0, + 593.0, + 601.0, + 372.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 579.0, + 949.0, + 579.0, + 949.0, + 601.0, + 735.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1089.0, + 577.0, + 1312.0, + 577.0, + 1312.0, + 600.0, + 1089.0, + 600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 607.0, + 1058.0, + 607.0, + 1058.0, + 617.0, + 1049.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 627.0, + 339.0, + 627.0, + 339.0, + 636.0, + 329.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 627.0, + 699.0, + 627.0, + 699.0, + 637.0, + 688.0, + 637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 624.0, + 1060.0, + 624.0, + 1060.0, + 640.0, + 1046.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 646.0, + 339.0, + 646.0, + 339.0, + 657.0, + 329.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 646.0, + 699.0, + 646.0, + 699.0, + 659.0, + 689.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 646.0, + 1059.0, + 646.0, + 1059.0, + 659.0, + 1049.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 666.0, + 339.0, + 666.0, + 339.0, + 678.0, + 329.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 666.0, + 699.0, + 666.0, + 699.0, + 678.0, + 689.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 664.0, + 1060.0, + 664.0, + 1060.0, + 681.0, + 1046.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 685.0, + 339.0, + 685.0, + 339.0, + 699.0, + 329.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 685.0, + 699.0, + 685.0, + 699.0, + 699.0, + 689.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 683.0, + 1060.0, + 683.0, + 1060.0, + 700.0, + 1046.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 694.0, + 323.0, + 694.0, + 323.0, + 790.0, + 303.0, + 790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 703.0, + 341.0, + 703.0, + 341.0, + 720.0, + 327.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 694.0, + 683.0, + 694.0, + 683.0, + 792.0, + 663.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 702.0, + 700.0, + 702.0, + 700.0, + 720.0, + 687.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 691.0, + 1045.0, + 691.0, + 1045.0, + 792.0, + 1021.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 702.0, + 1060.0, + 702.0, + 1060.0, + 720.0, + 1046.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 692.0, + 1397.0, + 692.0, + 1397.0, + 794.0, + 1377.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 727.0, + 338.0, + 727.0, + 338.0, + 738.0, + 329.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 726.0, + 698.0, + 726.0, + 698.0, + 738.0, + 688.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 721.0, + 1060.0, + 721.0, + 1060.0, + 742.0, + 1046.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 746.0, + 341.0, + 746.0, + 341.0, + 762.0, + 327.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 746.0, + 700.0, + 746.0, + 700.0, + 762.0, + 687.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 744.0, + 1060.0, + 744.0, + 1060.0, + 762.0, + 1045.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 765.0, + 341.0, + 765.0, + 341.0, + 782.0, + 327.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 765.0, + 700.0, + 765.0, + 700.0, + 782.0, + 687.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1045.0, + 764.0, + 1060.0, + 764.0, + 1060.0, + 782.0, + 1045.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 766.0, + 1260.0, + 766.0, + 1260.0, + 776.0, + 1246.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1267.0, + 766.0, + 1280.0, + 766.0, + 1280.0, + 776.0, + 1267.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 786.0, + 339.0, + 786.0, + 339.0, + 801.0, + 322.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 785.0, + 702.0, + 785.0, + 702.0, + 803.0, + 679.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 784.0, + 1061.0, + 784.0, + 1061.0, + 803.0, + 1039.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 808.0, + 338.0, + 808.0, + 338.0, + 822.0, + 322.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 804.0, + 699.0, + 804.0, + 699.0, + 824.0, + 679.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 804.0, + 1060.0, + 804.0, + 1060.0, + 824.0, + 1039.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 826.0, + 341.0, + 826.0, + 341.0, + 844.0, + 319.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 825.0, + 700.0, + 825.0, + 700.0, + 844.0, + 679.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 825.0, + 1060.0, + 825.0, + 1060.0, + 844.0, + 1039.0, + 844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 846.0, + 341.0, + 846.0, + 341.0, + 864.0, + 319.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 846.0, + 702.0, + 846.0, + 702.0, + 864.0, + 679.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 845.0, + 1060.0, + 845.0, + 1060.0, + 864.0, + 1039.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 868.0, + 338.0, + 868.0, + 338.0, + 882.0, + 322.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 866.0, + 700.0, + 866.0, + 700.0, + 884.0, + 679.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 866.0, + 1060.0, + 866.0, + 1060.0, + 884.0, + 1039.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 882.0, + 625.0, + 882.0, + 625.0, + 902.0, + 366.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 884.0, + 782.0, + 884.0, + 782.0, + 900.0, + 705.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 882.0, + 985.0, + 882.0, + 985.0, + 902.0, + 783.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1066.0, + 887.0, + 1078.0, + 887.0, + 1078.0, + 898.0, + 1066.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 886.0, + 1099.0, + 886.0, + 1099.0, + 899.0, + 1083.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 885.0, + 1119.0, + 885.0, + 1119.0, + 899.0, + 1103.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 885.0, + 1139.0, + 885.0, + 1139.0, + 899.0, + 1123.0, + 899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 882.0, + 1346.0, + 882.0, + 1346.0, + 902.0, + 1144.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 898.0, + 542.0, + 898.0, + 542.0, + 917.0, + 424.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 897.0, + 901.0, + 897.0, + 901.0, + 916.0, + 784.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 897.0, + 1260.0, + 897.0, + 1260.0, + 916.0, + 1143.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 948.0, + 1304.0, + 948.0, + 1304.0, + 998.0, + 393.0, + 998.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, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 434.0, + 1404.0, + 434.0, + 1404.0, + 470.0, + 295.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 465.0, + 565.0, + 465.0, + 565.0, + 500.0, + 295.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1729.0, + 1404.0, + 1729.0, + 1404.0, + 1760.0, + 296.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1759.0, + 1404.0, + 1759.0, + 1404.0, + 1795.0, + 294.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1786.0, + 1405.0, + 1786.0, + 1405.0, + 1828.0, + 292.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1819.0, + 1407.0, + 1819.0, + 1407.0, + 1856.0, + 292.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1851.0, + 1406.0, + 1851.0, + 1406.0, + 1885.0, + 293.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1884.0, + 1404.0, + 1884.0, + 1404.0, + 1915.0, + 296.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1911.0, + 560.0, + 1911.0, + 560.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 658.0, + 1911.0, + 822.0, + 1911.0, + 822.0, + 1947.0, + 658.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1911.0, + 1402.0, + 1911.0, + 1402.0, + 1947.0, + 946.0, + 1947.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": [ + 292.0, + 1967.0, + 1406.0, + 1967.0, + 1406.0, + 2012.0, + 292.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 614.0, + 2003.0, + 614.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1499.0, + 1404.0, + 1499.0, + 1404.0, + 1534.0, + 295.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1529.0, + 1405.0, + 1529.0, + 1405.0, + 1564.0, + 292.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1561.0, + 1405.0, + 1561.0, + 1405.0, + 1595.0, + 295.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1589.0, + 1405.0, + 1589.0, + 1405.0, + 1626.0, + 294.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1621.0, + 1405.0, + 1621.0, + 1405.0, + 1655.0, + 295.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1650.0, + 1406.0, + 1650.0, + 1406.0, + 1687.0, + 294.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1682.0, + 693.0, + 1682.0, + 693.0, + 1716.0, + 295.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1182.0, + 1405.0, + 1182.0, + 1405.0, + 1215.0, + 372.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1212.0, + 1405.0, + 1212.0, + 1405.0, + 1245.0, + 394.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1242.0, + 1405.0, + 1242.0, + 1405.0, + 1276.0, + 394.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1273.0, + 1406.0, + 1273.0, + 1406.0, + 1309.0, + 394.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1304.0, + 843.0, + 1304.0, + 843.0, + 1337.0, + 394.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 940.0, + 1304.0, + 1405.0, + 1304.0, + 1405.0, + 1337.0, + 940.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1335.0, + 1405.0, + 1335.0, + 1405.0, + 1368.0, + 395.0, + 1368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1361.0, + 1405.0, + 1361.0, + 1405.0, + 1401.0, + 393.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1395.0, + 1404.0, + 1395.0, + 1404.0, + 1427.0, + 394.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1426.0, + 1006.0, + 1426.0, + 1006.0, + 1459.0, + 395.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1073.0, + 866.0, + 1073.0, + 866.0, + 1113.0, + 394.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 1073.0, + 949.0, + 1073.0, + 949.0, + 1113.0, + 897.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 977.0, + 1073.0, + 1405.0, + 1073.0, + 1405.0, + 1113.0, + 977.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1105.0, + 687.0, + 1105.0, + 687.0, + 1141.0, + 395.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 434.0, + 1404.0, + 434.0, + 1404.0, + 470.0, + 295.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 465.0, + 565.0, + 465.0, + 565.0, + 500.0, + 295.0, + 500.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1512, + 1404, + 1512, + 1404, + 1789, + 298, + 1789 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1015, + 1403, + 1015, + 1403, + 1137, + 299, + 1137 + ], + "score": 0.974 + }, + { + "category_id": 3, + "poly": [ + 391, + 230, + 1301, + 230, + 1301, + 719, + 391, + 719 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 300, + 1292, + 1403, + 1292, + 1403, + 1414, + 300, + 1414 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 1153, + 1403, + 1153, + 1403, + 1276, + 298, + 1276 + ], + "score": 0.972 + }, + { + "category_id": 2, + "poly": [ + 298, + 1893, + 1403, + 1893, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.953 + }, + { + "category_id": 4, + "poly": [ + 296, + 773, + 1405, + 773, + 1405, + 898, + 296, + 898 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 301, + 1804, + 1401, + 1804, + 1401, + 1866, + 301, + 1866 + ], + "score": 0.938 + }, + { + "category_id": 0, + "poly": [ + 300, + 1455, + 598, + 1455, + 598, + 1486, + 300, + 1486 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 812, + 76, + 812, + 104, + 299, + 104 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.857 + }, + { + "category_id": 0, + "poly": [ + 303, + 956, + 807, + 956, + 807, + 988, + 303, + 988 + ], + "score": 0.668 + }, + { + "category_id": 1, + "poly": [ + 303, + 956, + 807, + 956, + 807, + 988, + 303, + 988 + ], + "score": 0.247 + }, + { + "category_id": 13, + "poly": [ + 714, + 1697, + 783, + 1697, + 783, + 1726, + 714, + 1726 + ], + "score": 0.89, + "latex": "3 \\times 3" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 231.0, + 690.0, + 231.0, + 690.0, + 259.0, + 606.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 231.0, + 1191.0, + 231.0, + 1191.0, + 259.0, + 1023.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 263.0, + 587.0, + 263.0, + 587.0, + 277.0, + 574.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 280.0, + 451.0, + 280.0, + 451.0, + 303.0, + 413.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 280.0, + 910.0, + 280.0, + 910.0, + 303.0, + 871.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 284.0, + 828.0, + 284.0, + 828.0, + 316.0, + 814.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 287.0, + 1049.0, + 287.0, + 1049.0, + 337.0, + 1028.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 289.0, + 1062.0, + 289.0, + 1062.0, + 339.0, + 1044.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 292.0, + 814.0, + 292.0, + 814.0, + 325.0, + 800.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 293.0, + 1288.0, + 293.0, + 1288.0, + 316.0, + 1272.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1019.0, + 294.0, + 1029.0, + 294.0, + 1029.0, + 303.0, + 1019.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 295.0, + 693.0, + 295.0, + 693.0, + 334.0, + 679.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 295.0, + 1092.0, + 295.0, + 1092.0, + 346.0, + 1075.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 296.0, + 1274.0, + 296.0, + 1274.0, + 327.0, + 1256.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 297.0, + 1077.0, + 297.0, + 1077.0, + 342.0, + 1061.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 297.0, + 1107.0, + 297.0, + 1107.0, + 332.0, + 1092.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 300.0, + 650.0, + 300.0, + 650.0, + 367.0, + 630.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 300.0, + 664.0, + 300.0, + 664.0, + 337.0, + 646.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 300.0, + 1229.0, + 300.0, + 1229.0, + 337.0, + 1211.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 300.0, + 1259.0, + 300.0, + 1259.0, + 329.0, + 1241.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 301.0, + 1124.0, + 301.0, + 1124.0, + 346.0, + 1106.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 301.0, + 1138.0, + 301.0, + 1138.0, + 333.0, + 1121.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 301.0, + 1197.0, + 301.0, + 1197.0, + 328.0, + 1183.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1228.0, + 301.0, + 1243.0, + 301.0, + 1243.0, + 337.0, + 1228.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 302.0, + 631.0, + 302.0, + 631.0, + 316.0, + 620.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 302.0, + 1015.0, + 302.0, + 1015.0, + 319.0, + 1003.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 302.0, + 1031.0, + 302.0, + 1031.0, + 340.0, + 1016.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 302.0, + 1212.0, + 302.0, + 1212.0, + 327.0, + 1197.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 989.0, + 303.0, + 999.0, + 303.0, + 999.0, + 313.0, + 989.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 303.0, + 1183.0, + 303.0, + 1183.0, + 329.0, + 1167.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 693.0, + 305.0, + 708.0, + 305.0, + 708.0, + 339.0, + 693.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 305.0, + 1167.0, + 305.0, + 1167.0, + 330.0, + 1152.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 306.0, + 678.0, + 306.0, + 678.0, + 334.0, + 663.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 307.0, + 800.0, + 307.0, + 800.0, + 332.0, + 784.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 308.0, + 1152.0, + 308.0, + 1152.0, + 333.0, + 1136.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 310.0, + 723.0, + 310.0, + 723.0, + 335.0, + 708.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 310.0, + 954.0, + 310.0, + 954.0, + 324.0, + 943.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 311.0, + 984.0, + 311.0, + 984.0, + 332.0, + 972.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 312.0, + 782.0, + 312.0, + 782.0, + 330.0, + 770.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 725.0, + 313.0, + 738.0, + 313.0, + 738.0, + 330.0, + 725.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 313.0, + 767.0, + 313.0, + 767.0, + 328.0, + 756.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 314.0, + 636.0, + 314.0, + 636.0, + 403.0, + 615.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 315.0, + 751.0, + 315.0, + 751.0, + 329.0, + 743.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1001.0, + 315.0, + 1016.0, + 315.0, + 1016.0, + 336.0, + 1001.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 316.0, + 615.0, + 316.0, + 615.0, + 325.0, + 606.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 316.0, + 1002.0, + 316.0, + 1002.0, + 339.0, + 986.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 318.0, + 971.0, + 318.0, + 971.0, + 336.0, + 955.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 322.0, + 619.0, + 322.0, + 619.0, + 380.0, + 601.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 588.0, + 333.0, + 602.0, + 333.0, + 602.0, + 364.0, + 588.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 334.0, + 496.0, + 334.0, + 496.0, + 350.0, + 483.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 335.0, + 781.0, + 335.0, + 781.0, + 343.0, + 772.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 666.0, + 338.0, + 676.0, + 338.0, + 676.0, + 348.0, + 666.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 339.0, + 417.0, + 339.0, + 417.0, + 593.0, + 390.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 342.0, + 571.0, + 342.0, + 571.0, + 356.0, + 559.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 343.0, + 451.0, + 343.0, + 451.0, + 367.0, + 413.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 343.0, + 910.0, + 343.0, + 910.0, + 367.0, + 871.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 345.0, + 1015.0, + 345.0, + 1015.0, + 377.0, + 1002.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 345.0, + 1045.0, + 345.0, + 1045.0, + 359.0, + 1033.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 346.0, + 586.0, + 346.0, + 586.0, + 362.0, + 574.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 347.0, + 1075.0, + 347.0, + 1075.0, + 362.0, + 1063.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 349.0, + 1255.0, + 349.0, + 1255.0, + 358.0, + 1246.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 351.0, + 1000.0, + 351.0, + 1000.0, + 368.0, + 988.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 484.0, + 353.0, + 495.0, + 353.0, + 495.0, + 363.0, + 484.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 353.0, + 953.0, + 353.0, + 953.0, + 363.0, + 943.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 353.0, + 1062.0, + 353.0, + 1062.0, + 386.0, + 1047.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 355.0, + 970.0, + 355.0, + 970.0, + 368.0, + 958.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 355.0, + 984.0, + 355.0, + 984.0, + 369.0, + 972.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 369.0, + 524.0, + 369.0, + 524.0, + 378.0, + 516.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 364.0, + 568.0, + 364.0, + 568.0, + 369.0, + 563.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 367.0, + 1000.0, + 367.0, + 1000.0, + 384.0, + 987.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 361.0, + 1045.0, + 361.0, + 1045.0, + 377.0, + 1033.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 365.0, + 1075.0, + 365.0, + 1075.0, + 381.0, + 1063.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 485.0, + 384.0, + 496.0, + 384.0, + 496.0, + 401.0, + 485.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 384.0, + 569.0, + 384.0, + 569.0, + 394.0, + 561.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 379.0, + 600.0, + 379.0, + 600.0, + 390.0, + 591.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 378.0, + 616.0, + 378.0, + 616.0, + 394.0, + 604.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 373.0, + 646.0, + 373.0, + 646.0, + 386.0, + 633.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 373.0, + 953.0, + 373.0, + 953.0, + 380.0, + 945.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 374.0, + 968.0, + 374.0, + 968.0, + 382.0, + 960.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 377.0, + 983.0, + 377.0, + 983.0, + 391.0, + 974.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 382.0, + 1014.0, + 382.0, + 1014.0, + 399.0, + 1003.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 375.0, + 1028.0, + 375.0, + 1028.0, + 387.0, + 1020.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 375.0, + 1047.0, + 375.0, + 1047.0, + 419.0, + 1030.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 385.0, + 1059.0, + 385.0, + 1059.0, + 397.0, + 1050.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1110.0, + 381.0, + 1118.0, + 381.0, + 1118.0, + 389.0, + 1110.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 406.0, + 451.0, + 406.0, + 451.0, + 431.0, + 422.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 395.0, + 478.0, + 395.0, + 478.0, + 405.0, + 469.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 405.0, + 495.0, + 405.0, + 495.0, + 413.0, + 486.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 398.0, + 554.0, + 398.0, + 554.0, + 407.0, + 546.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 392.0, + 569.0, + 392.0, + 569.0, + 403.0, + 562.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 394.0, + 585.0, + 394.0, + 585.0, + 416.0, + 576.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 393.0, + 600.0, + 393.0, + 600.0, + 404.0, + 591.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.0, + 392.0, + 616.0, + 392.0, + 616.0, + 410.0, + 603.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 406.0, + 911.0, + 406.0, + 911.0, + 431.0, + 881.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 401.0, + 942.0, + 401.0, + 942.0, + 450.0, + 925.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 400.0, + 951.0, + 400.0, + 951.0, + 405.0, + 946.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 407.0, + 983.0, + 407.0, + 983.0, + 416.0, + 974.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 402.0, + 1000.0, + 402.0, + 1000.0, + 418.0, + 988.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 404.0, + 1014.0, + 404.0, + 1014.0, + 418.0, + 1003.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 391.0, + 1031.0, + 391.0, + 1031.0, + 418.0, + 1016.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 404.0, + 1059.0, + 404.0, + 1059.0, + 413.0, + 1050.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 412.0, + 952.0, + 412.0, + 952.0, + 421.0, + 944.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 430.0, + 478.0, + 430.0, + 478.0, + 442.0, + 469.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 425.0, + 510.0, + 425.0, + 510.0, + 445.0, + 499.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 942.0, + 420.0, + 953.0, + 420.0, + 953.0, + 443.0, + 942.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 416.0, + 969.0, + 416.0, + 969.0, + 438.0, + 958.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 420.0, + 984.0, + 420.0, + 984.0, + 442.0, + 973.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 418.0, + 1045.0, + 418.0, + 1045.0, + 434.0, + 1033.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 439.0, + 494.0, + 439.0, + 494.0, + 447.0, + 486.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 442.0, + 569.0, + 442.0, + 569.0, + 455.0, + 561.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 447.0, + 938.0, + 447.0, + 938.0, + 457.0, + 929.0, + 457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 444.0, + 1028.0, + 444.0, + 1028.0, + 454.0, + 1021.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 465.0, + 952.0, + 465.0, + 952.0, + 474.0, + 945.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 469.0, + 451.0, + 469.0, + 451.0, + 494.0, + 422.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 470.0, + 554.0, + 470.0, + 554.0, + 480.0, + 545.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 469.0, + 911.0, + 469.0, + 911.0, + 494.0, + 881.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 478.0, + 523.0, + 478.0, + 523.0, + 487.0, + 516.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 485.0, + 539.0, + 485.0, + 539.0, + 495.0, + 530.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 497.0, + 954.0, + 497.0, + 954.0, + 521.0, + 944.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 532.0, + 451.0, + 532.0, + 451.0, + 557.0, + 422.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 532.0, + 911.0, + 532.0, + 911.0, + 558.0, + 881.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 549.0, + 940.0, + 549.0, + 940.0, + 562.0, + 927.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 570.0, + 830.0, + 570.0, + 830.0, + 595.0, + 766.0, + 595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 569.0, + 1290.0, + 569.0, + 1290.0, + 595.0, + 1225.0, + 595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 595.0, + 451.0, + 595.0, + 451.0, + 620.0, + 422.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 590.0, + 831.0, + 590.0, + 831.0, + 616.0, + 766.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 595.0, + 912.0, + 595.0, + 912.0, + 620.0, + 880.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 588.0, + 1291.0, + 588.0, + 1291.0, + 617.0, + 1224.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 613.0, + 831.0, + 613.0, + 831.0, + 639.0, + 766.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 613.0, + 1290.0, + 613.0, + 1290.0, + 639.0, + 1225.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 641.0, + 478.0, + 641.0, + 478.0, + 650.0, + 469.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 644.0, + 789.0, + 644.0, + 789.0, + 661.0, + 769.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 644.0, + 1209.0, + 644.0, + 1209.0, + 653.0, + 1198.0, + 653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 644.0, + 1248.0, + 644.0, + 1248.0, + 661.0, + 1227.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 661.0, + 450.0, + 661.0, + 450.0, + 680.0, + 434.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 892.0, + 660.0, + 909.0, + 660.0, + 909.0, + 680.0, + 892.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 676.0, + 483.0, + 676.0, + 483.0, + 698.0, + 466.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 673.0, + 559.0, + 673.0, + 559.0, + 700.0, + 540.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 670.0, + 642.0, + 670.0, + 642.0, + 701.0, + 609.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 670.0, + 717.0, + 670.0, + 717.0, + 701.0, + 685.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 670.0, + 793.0, + 670.0, + 793.0, + 701.0, + 760.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 673.0, + 943.0, + 673.0, + 943.0, + 699.0, + 924.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 673.0, + 1017.0, + 673.0, + 1017.0, + 699.0, + 999.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1068.0, + 670.0, + 1101.0, + 670.0, + 1101.0, + 701.0, + 1068.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 670.0, + 1176.0, + 670.0, + 1176.0, + 701.0, + 1144.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 670.0, + 1252.0, + 670.0, + 1252.0, + 701.0, + 1218.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 693.0, + 736.0, + 693.0, + 736.0, + 720.0, + 560.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1020.0, + 693.0, + 1193.0, + 693.0, + 1193.0, + 720.0, + 1020.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1889.0, + 1403.0, + 1889.0, + 1403.0, + 1928.0, + 330.0, + 1928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1922.0, + 1404.0, + 1922.0, + 1404.0, + 1953.0, + 296.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1946.0, + 1404.0, + 1946.0, + 1404.0, + 1985.0, + 293.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1976.0, + 1404.0, + 1976.0, + 1404.0, + 2010.0, + 294.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2004.0, + 812.0, + 2004.0, + 812.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 775.0, + 1405.0, + 775.0, + 1405.0, + 807.0, + 295.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 803.0, + 1406.0, + 803.0, + 1406.0, + 840.0, + 294.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 837.0, + 1405.0, + 837.0, + 1405.0, + 869.0, + 295.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 867.0, + 808.0, + 867.0, + 808.0, + 900.0, + 294.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1453.0, + 602.0, + 1453.0, + 602.0, + 1489.0, + 296.0, + 1489.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": [ + 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, + 956.0, + 811.0, + 956.0, + 811.0, + 992.0, + 297.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1514.0, + 1401.0, + 1514.0, + 1401.0, + 1547.0, + 297.0, + 1547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1546.0, + 1404.0, + 1546.0, + 1404.0, + 1579.0, + 296.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1573.0, + 1405.0, + 1573.0, + 1405.0, + 1611.0, + 293.0, + 1611.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": [ + 294.0, + 1636.0, + 1405.0, + 1636.0, + 1405.0, + 1669.0, + 294.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1666.0, + 1404.0, + 1666.0, + 1404.0, + 1699.0, + 296.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1696.0, + 713.0, + 1696.0, + 713.0, + 1729.0, + 296.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1696.0, + 1402.0, + 1696.0, + 1402.0, + 1729.0, + 784.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1728.0, + 1404.0, + 1728.0, + 1404.0, + 1760.0, + 293.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1754.0, + 695.0, + 1754.0, + 695.0, + 1791.0, + 294.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1012.0, + 1404.0, + 1012.0, + 1404.0, + 1051.0, + 294.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1045.0, + 1407.0, + 1045.0, + 1407.0, + 1081.0, + 295.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1078.0, + 1405.0, + 1078.0, + 1405.0, + 1111.0, + 297.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1104.0, + 1293.0, + 1104.0, + 1293.0, + 1143.0, + 293.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1291.0, + 1407.0, + 1291.0, + 1407.0, + 1328.0, + 295.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1321.0, + 1404.0, + 1321.0, + 1404.0, + 1356.0, + 294.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1352.0, + 1407.0, + 1352.0, + 1407.0, + 1390.0, + 294.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1382.0, + 393.0, + 1382.0, + 393.0, + 1417.0, + 294.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1152.0, + 1405.0, + 1152.0, + 1405.0, + 1189.0, + 292.0, + 1189.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1185.0, + 1405.0, + 1185.0, + 1405.0, + 1218.0, + 294.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1212.0, + 1404.0, + 1212.0, + 1404.0, + 1252.0, + 292.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1247.0, + 827.0, + 1247.0, + 827.0, + 1280.0, + 294.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1803.0, + 1405.0, + 1803.0, + 1405.0, + 1839.0, + 297.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1835.0, + 1406.0, + 1835.0, + 1406.0, + 1867.0, + 296.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 956.0, + 811.0, + 956.0, + 811.0, + 992.0, + 297.0, + 992.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1402, + 1942, + 1402, + 2034, + 300, + 2034 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 346, + 246, + 1348, + 246, + 1348, + 671, + 346, + 671 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 335, + 969, + 1363, + 969, + 1363, + 1396, + 335, + 1396 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 298, + 724, + 1401, + 724, + 1401, + 819, + 298, + 819 + ], + "score": 0.954 + }, + { + "category_id": 4, + "poly": [ + 298, + 1432, + 1404, + 1432, + 1404, + 1494, + 298, + 1494 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 298, + 872, + 1400, + 872, + 1400, + 936, + 298, + 936 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 297, + 1539, + 1404, + 1539, + 1404, + 1847, + 297, + 1847 + ], + "score": 0.904 + }, + { + "category_id": 0, + "poly": [ + 300, + 1885, + 643, + 1885, + 643, + 1916, + 300, + 1916 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 812, + 76, + 812, + 104, + 299, + 104 + ], + "score": 0.89 + }, + { + "category_id": 2, + "poly": [ + 837, + 2088, + 865, + 2088, + 865, + 2112, + 837, + 2112 + ], + "score": 0.842 + }, + { + "category_id": 4, + "poly": [ + 297, + 1539, + 1404, + 1539, + 1404, + 1847, + 297, + 1847 + ], + "score": 0.144 + }, + { + "category_id": 15, + "poly": [ + 656.0, + 248.0, + 733.0, + 248.0, + 733.0, + 279.0, + 656.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 248.0, + 868.0, + 248.0, + 868.0, + 278.0, + 772.0, + 278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 248.0, + 1001.0, + 248.0, + 1001.0, + 278.0, + 901.0, + 278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 248.0, + 1133.0, + 248.0, + 1133.0, + 278.0, + 1040.0, + 278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 275.0, + 736.0, + 275.0, + 736.0, + 306.0, + 630.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 276.0, + 867.0, + 276.0, + 867.0, + 306.0, + 740.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 276.0, + 1001.0, + 276.0, + 1001.0, + 306.0, + 869.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 273.0, + 1119.0, + 273.0, + 1119.0, + 308.0, + 1021.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 298.0, + 383.0, + 298.0, + 383.0, + 633.0, + 347.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 311.0, + 920.0, + 311.0, + 920.0, + 347.0, + 877.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 336.0, + 885.0, + 336.0, + 885.0, + 592.0, + 848.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 342.0, + 411.0, + 342.0, + 411.0, + 369.0, + 373.0, + 369.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 427.0, + 412.0, + 427.0, + 412.0, + 458.0, + 374.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 880.0, + 494.0, + 917.0, + 494.0, + 917.0, + 528.0, + 880.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 614.0, + 453.0, + 614.0, + 453.0, + 647.0, + 419.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 613.0, + 586.0, + 613.0, + 586.0, + 648.0, + 541.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 612.0, + 690.0, + 612.0, + 690.0, + 647.0, + 640.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 613.0, + 839.0, + 613.0, + 839.0, + 648.0, + 740.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 614.0, + 958.0, + 614.0, + 958.0, + 647.0, + 923.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 613.0, + 1092.0, + 613.0, + 1092.0, + 647.0, + 1044.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 612.0, + 1194.0, + 612.0, + 1194.0, + 647.0, + 1144.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 613.0, + 1344.0, + 613.0, + 1344.0, + 648.0, + 1244.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 638.0, + 699.0, + 638.0, + 699.0, + 675.0, + 554.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 638.0, + 1204.0, + 638.0, + 1204.0, + 676.0, + 1058.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1079.25, + 351.0, + 1169.25, + 351.0, + 1169.25, + 366.0, + 1079.25, + 366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 440.0, + 361.0, + 463.0, + 361.0, + 463.0, + 372.0, + 440.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1182.75, + 400.0, + 1192.75, + 400.0, + 1192.75, + 407.0, + 1182.75, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.25, + 496.5, + 811.25, + 496.5, + 811.25, + 508.5, + 795.25, + 508.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1293.75, + 515.5, + 1302.75, + 515.5, + 1302.75, + 527.5, + 1293.75, + 527.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 512.0, + 417.0, + 512.0, + 417.0, + 543.5, + 369.0, + 543.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 978.0, + 798.0, + 978.0, + 798.0, + 1005.0, + 701.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 985.0, + 1221.0, + 985.0, + 1221.0, + 1008.0, + 1197.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 977.0, + 1326.0, + 977.0, + 1326.0, + 1007.0, + 1226.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 999.0, + 394.0, + 999.0, + 394.0, + 1026.0, + 348.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 998.0, + 931.0, + 998.0, + 931.0, + 1026.0, + 883.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1084.0, + 1026.0, + 1153.0, + 1026.0, + 1153.0, + 1054.0, + 1084.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1061.0, + 1033.0, + 1085.0, + 1033.0, + 1085.0, + 1057.0, + 1061.0, + 1057.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1107.0, + 390.0, + 1107.0, + 390.0, + 1128.0, + 350.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1106.0, + 929.0, + 1106.0, + 929.0, + 1131.0, + 885.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 1137.0, + 1181.0, + 1137.0, + 1181.0, + 1165.0, + 1080.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 1145.0, + 1082.0, + 1145.0, + 1082.0, + 1170.0, + 1058.0, + 1170.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1158.0, + 391.0, + 1158.0, + 391.0, + 1183.0, + 348.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1155.0, + 928.0, + 1155.0, + 928.0, + 1185.0, + 885.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 433.0, + 1173.0, + 505.0, + 1173.0, + 505.0, + 1205.0, + 433.0, + 1205.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 417.0, + 1185.0, + 437.0, + 1185.0, + 437.0, + 1204.0, + 417.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1212.0, + 391.0, + 1212.0, + 391.0, + 1233.0, + 350.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 1199.0, + 534.0, + 1199.0, + 534.0, + 1226.0, + 415.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 1211.0, + 928.0, + 1211.0, + 928.0, + 1237.0, + 885.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1262.0, + 391.0, + 1262.0, + 391.0, + 1287.0, + 350.0, + 1287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 1258.0, + 928.0, + 1258.0, + 928.0, + 1289.0, + 886.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1314.0, + 393.0, + 1314.0, + 393.0, + 1339.0, + 348.0, + 1339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 399.0, + 1320.0, + 489.0, + 1320.0, + 489.0, + 1348.0, + 399.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 1317.0, + 928.0, + 1317.0, + 928.0, + 1338.0, + 887.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 1358.0, + 548.0, + 1358.0, + 548.0, + 1380.0, + 520.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 1358.0, + 1071.0, + 1358.0, + 1071.0, + 1380.0, + 1042.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 1358.0, + 1313.0, + 1358.0, + 1313.0, + 1380.0, + 1285.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 1370.0, + 687.0, + 1370.0, + 687.0, + 1399.0, + 521.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 1368.0, + 1247.0, + 1368.0, + 1247.0, + 1398.0, + 1034.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 986.0, + 810.0, + 986.0, + 810.0, + 1005.0, + 792.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 1024.0, + 750.0, + 1024.0, + 750.0, + 1056.0, + 665.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 1134.5, + 650.0, + 1134.5, + 650.0, + 1169.0, + 530.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 1173.5, + 1014.0, + 1173.5, + 1014.0, + 1205.5, + 929.0, + 1205.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1235.25, + 1196.5, + 1350.25, + 1196.5, + 1350.25, + 1228.5, + 1235.25, + 1228.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 959.0, + 1318.5, + 1047.0, + 1318.5, + 1047.0, + 1349.0, + 959.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 725.0, + 1403.0, + 725.0, + 1403.0, + 759.0, + 296.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 757.0, + 1403.0, + 757.0, + 1403.0, + 791.0, + 294.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 787.0, + 1271.0, + 787.0, + 1271.0, + 821.0, + 296.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1431.0, + 1405.0, + 1431.0, + 1405.0, + 1467.0, + 296.0, + 1467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1460.0, + 1336.0, + 1460.0, + 1336.0, + 1497.0, + 293.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1882.0, + 646.0, + 1882.0, + 646.0, + 1920.0, + 295.0, + 1920.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": [ + 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, + 1540.0, + 1405.0, + 1540.0, + 1405.0, + 1576.0, + 294.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1571.0, + 1407.0, + 1571.0, + 1407.0, + 1608.0, + 292.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1600.0, + 1407.0, + 1600.0, + 1407.0, + 1639.0, + 292.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1632.0, + 1407.0, + 1632.0, + 1407.0, + 1669.0, + 294.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1664.0, + 1405.0, + 1664.0, + 1405.0, + 1696.0, + 295.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1696.0, + 1404.0, + 1696.0, + 1404.0, + 1727.0, + 296.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1724.0, + 1406.0, + 1724.0, + 1406.0, + 1761.0, + 294.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1757.0, + 1404.0, + 1757.0, + 1404.0, + 1789.0, + 296.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1787.0, + 1404.0, + 1787.0, + 1404.0, + 1819.0, + 296.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1815.0, + 607.0, + 1815.0, + 607.0, + 1851.0, + 295.0, + 1851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1976.0, + 296.0, + 1976.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": [ + 296.0, + 2004.0, + 1404.0, + 2004.0, + 1404.0, + 2037.0, + 296.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 869.0, + 1406.0, + 869.0, + 1406.0, + 910.0, + 291.0, + 910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 903.0, + 696.0, + 903.0, + 696.0, + 939.0, + 296.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1540.0, + 1405.0, + 1540.0, + 1405.0, + 1576.0, + 294.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1571.0, + 1407.0, + 1571.0, + 1407.0, + 1608.0, + 292.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1600.0, + 1407.0, + 1600.0, + 1407.0, + 1639.0, + 292.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1632.0, + 1407.0, + 1632.0, + 1407.0, + 1669.0, + 294.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1664.0, + 1405.0, + 1664.0, + 1405.0, + 1696.0, + 295.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1696.0, + 1404.0, + 1696.0, + 1404.0, + 1727.0, + 296.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1724.0, + 1406.0, + 1724.0, + 1406.0, + 1761.0, + 294.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1757.0, + 1404.0, + 1757.0, + 1404.0, + 1789.0, + 296.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1787.0, + 1404.0, + 1787.0, + 1404.0, + 1819.0, + 296.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1815.0, + 607.0, + 1815.0, + 607.0, + 1851.0, + 295.0, + 1851.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 417, + 1404, + 417, + 1404, + 541, + 299, + 541 + ], + "score": 0.978 + }, + { + "category_id": 5, + "poly": [ + 297, + 750, + 1402, + 750, + 1402, + 985, + 297, + 985 + ], + "score": 0.978, + "html": "
0oreeeaerCIIPIP0 :DEI ·irmsiIs1ed660unsNHASeeaaemButoS55sr515GrrrogarCerrrelrr CTr-stq NTapop-dPuo-Idsp·JTI-ITTTTSIIH-SRARSSH-PRPPEE7aam
ViT-H/14 (JFT)95.385.575.299.797.265.088.983.396.791.476.691.763.853.179.463.384.533.251.277.6
ViT-L/16 (JFT)95.481.974.399.796.763.587.483.696.589.777.186.463.149.774.560.582.236.251.176.3
ViT-L/16 (I21k)90.884.174.199.392.761.080.982.595.685.275.370.356.141.974.764.979.930.541.772.7
" + }, + { + "category_id": 1, + "poly": [ + 300, + 229, + 1402, + 229, + 1402, + 323, + 300, + 323 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 298, + 634, + 1017, + 634, + 1017, + 667, + 298, + 667 + ], + "score": 0.932 + }, + { + "category_id": 0, + "poly": [ + 299, + 359, + 590, + 359, + 590, + 391, + 299, + 391 + ], + "score": 0.904 + }, + { + "category_id": 0, + "poly": [ + 299, + 577, + 617, + 577, + 617, + 610, + 299, + 610 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.899 + }, + { + "category_id": 6, + "poly": [ + 505, + 716, + 1183, + 716, + 1183, + 748, + 505, + 748 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 865, + 2088, + 865, + 2112, + 835, + 2112 + ], + "score": 0.847 + }, + { + "category_id": 13, + "poly": [ + 295, + 479, + 354, + 479, + 354, + 508, + 295, + 508 + ], + "score": 0.28, + "latex": "\\mathrm { L } / 1 6" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 359.0, + 593.0, + 359.0, + 593.0, + 395.0, + 295.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 578.0, + 620.0, + 578.0, + 620.0, + 611.0, + 296.0, + 611.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": [ + 505.0, + 712.0, + 1185.0, + 712.0, + 1185.0, + 753.0, + 505.0, + 753.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": [ + 294.0, + 416.0, + 1404.0, + 416.0, + 1404.0, + 452.0, + 294.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 449.0, + 1403.0, + 449.0, + 1403.0, + 481.0, + 295.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 477.0, + 1405.0, + 477.0, + 1405.0, + 514.0, + 355.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 508.0, + 958.0, + 508.0, + 958.0, + 544.0, + 294.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 1404.0, + 230.0, + 1404.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 263.0, + 1403.0, + 263.0, + 1403.0, + 293.0, + 294.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 292.0, + 1204.0, + 292.0, + 1204.0, + 326.0, + 295.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 632.0, + 1021.0, + 632.0, + 1021.0, + 670.0, + 294.0, + 670.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 19, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 3, + "poly": [ + 313, + 376, + 1385, + 376, + 1385, + 1818, + 313, + 1818 + ], + "score": 0.969 + }, + { + "category_id": 4, + "poly": [ + 421, + 1849, + 1279, + 1849, + 1279, + 1884, + 421, + 1884 + ], + "score": 0.913 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 105, + 299, + 105 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 863, + 2088, + 863, + 2113, + 834, + 2113 + ], + "score": 0.515 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 863, + 2088, + 863, + 2113, + 834, + 2113 + ], + "score": 0.342 + }, + { + "category_id": 15, + "poly": [ + 344.0, + 389.0, + 352.0, + 389.0, + 352.0, + 397.0, + 344.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 476.0, + 385.0, + 489.0, + 385.0, + 489.0, + 400.0, + 476.0, + 400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 385.0, + 623.0, + 385.0, + 623.0, + 400.0, + 610.0, + 400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 385.0, + 1024.0, + 385.0, + 1024.0, + 398.0, + 1011.0, + 398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 405.0, + 381.0, + 405.0, + 381.0, + 451.0, + 335.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 405.0, + 510.0, + 405.0, + 510.0, + 450.0, + 387.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 408.0, + 577.0, + 408.0, + 577.0, + 443.0, + 526.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 396.0, + 1242.0, + 396.0, + 1242.0, + 459.0, + 776.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 399.0, + 1385.0, + 399.0, + 1385.0, + 463.0, + 1252.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 341.0, + 472.0, + 355.0, + 472.0, + 355.0, + 487.0, + 341.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 471.0, + 494.0, + 471.0, + 494.0, + 488.0, + 472.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 471.0, + 628.0, + 471.0, + 628.0, + 490.0, + 604.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 471.0, + 761.0, + 471.0, + 761.0, + 490.0, + 739.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 471.0, + 895.0, + 471.0, + 895.0, + 488.0, + 874.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 472.0, + 1026.0, + 472.0, + 1026.0, + 487.0, + 1010.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 469.0, + 1163.0, + 469.0, + 1163.0, + 490.0, + 1142.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 471.0, + 1296.0, + 471.0, + 1296.0, + 488.0, + 1276.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 498.0, + 374.0, + 498.0, + 374.0, + 543.0, + 336.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 479.0, + 1241.0, + 479.0, + 1241.0, + 556.0, + 441.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 500.0, + 1309.0, + 500.0, + 1309.0, + 528.0, + 1251.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1325.0, + 499.0, + 1374.0, + 499.0, + 1374.0, + 536.0, + 1325.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 522.0, + 432.0, + 522.0, + 432.0, + 538.0, + 419.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 559.0, + 359.0, + 559.0, + 359.0, + 577.0, + 336.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 559.0, + 494.0, + 559.0, + 494.0, + 578.0, + 470.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 559.0, + 628.0, + 559.0, + 628.0, + 578.0, + 604.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 559.0, + 761.0, + 559.0, + 761.0, + 578.0, + 738.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 559.0, + 895.0, + 559.0, + 895.0, + 578.0, + 871.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 559.0, + 1029.0, + 559.0, + 1029.0, + 578.0, + 1007.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 556.0, + 1199.0, + 556.0, + 1199.0, + 649.0, + 1108.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 559.0, + 1296.0, + 559.0, + 1296.0, + 577.0, + 1274.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 570.0, + 521.0, + 570.0, + 521.0, + 639.0, + 368.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 588.0, + 572.0, + 588.0, + 572.0, + 626.0, + 526.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 586.0, + 777.0, + 586.0, + 777.0, + 626.0, + 715.0, + 626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 788.0, + 581.0, + 839.0, + 581.0, + 839.0, + 622.0, + 788.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 578.0, + 927.0, + 578.0, + 927.0, + 636.0, + 847.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 593.0, + 1035.0, + 593.0, + 1035.0, + 620.0, + 986.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1191.0, + 594.0, + 1244.0, + 594.0, + 1244.0, + 622.0, + 1191.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 605.0, + 1368.0, + 605.0, + 1368.0, + 618.0, + 1352.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 647.0, + 360.0, + 647.0, + 360.0, + 667.0, + 336.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 647.0, + 494.0, + 647.0, + 494.0, + 667.0, + 470.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 647.0, + 626.0, + 647.0, + 626.0, + 667.0, + 604.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 647.0, + 761.0, + 647.0, + 761.0, + 667.0, + 738.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 647.0, + 895.0, + 647.0, + 895.0, + 667.0, + 871.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 647.0, + 1029.0, + 647.0, + 1029.0, + 667.0, + 1007.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 647.0, + 1163.0, + 647.0, + 1163.0, + 667.0, + 1140.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 647.0, + 1296.0, + 647.0, + 1296.0, + 667.0, + 1274.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 675.0, + 443.0, + 675.0, + 443.0, + 715.0, + 330.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 542.0, + 679.0, + 575.0, + 679.0, + 575.0, + 716.0, + 542.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 673.0, + 703.0, + 673.0, + 703.0, + 718.0, + 653.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 694.0, + 745.0, + 694.0, + 745.0, + 715.0, + 723.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 697.0, + 808.0, + 697.0, + 808.0, + 713.0, + 795.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 945.0, + 676.0, + 967.0, + 676.0, + 967.0, + 697.0, + 945.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 683.0, + 1115.0, + 683.0, + 1115.0, + 723.0, + 1054.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1121.0, + 670.0, + 1175.0, + 670.0, + 1175.0, + 732.0, + 1121.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 678.0, + 1239.0, + 678.0, + 1239.0, + 712.0, + 1204.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 686.0, + 1311.0, + 686.0, + 1311.0, + 721.0, + 1261.0, + 721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 691.0, + 1378.0, + 691.0, + 1378.0, + 720.0, + 1331.0, + 720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 736.0, + 360.0, + 736.0, + 360.0, + 755.0, + 335.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 732.0, + 495.0, + 732.0, + 495.0, + 756.0, + 467.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 732.0, + 631.0, + 732.0, + 631.0, + 758.0, + 601.0, + 758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 736.0, + 763.0, + 736.0, + 763.0, + 755.0, + 736.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 736.0, + 897.0, + 736.0, + 897.0, + 755.0, + 870.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 736.0, + 1029.0, + 736.0, + 1029.0, + 755.0, + 1005.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 734.0, + 1163.0, + 734.0, + 1163.0, + 755.0, + 1140.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 736.0, + 1296.0, + 736.0, + 1296.0, + 755.0, + 1274.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 756.0, + 386.0, + 756.0, + 386.0, + 814.0, + 317.0, + 814.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 457.0, + 755.0, + 484.0, + 755.0, + 484.0, + 771.0, + 457.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 759.0, + 584.0, + 759.0, + 584.0, + 805.0, + 507.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 776.0, + 690.0, + 776.0, + 690.0, + 801.0, + 661.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 752.0, + 779.0, + 752.0, + 779.0, + 806.0, + 715.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 755.0, + 841.0, + 755.0, + 841.0, + 797.0, + 787.0, + 797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 756.0, + 922.0, + 756.0, + 922.0, + 819.0, + 844.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 763.0, + 975.0, + 763.0, + 975.0, + 806.0, + 925.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 748.0, + 1199.0, + 748.0, + 1199.0, + 824.0, + 1113.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1207.0, + 776.0, + 1238.0, + 776.0, + 1238.0, + 803.0, + 1207.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 766.0, + 1373.0, + 766.0, + 1373.0, + 805.0, + 1330.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 824.0, + 359.0, + 824.0, + 359.0, + 843.0, + 335.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 821.0, + 524.0, + 821.0, + 524.0, + 906.0, + 438.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 875.0, + 597.0, + 875.0, + 597.0, + 888.0, + 585.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 821.0, + 645.0, + 821.0, + 645.0, + 893.0, + 599.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 669.0, + 858.0, + 701.0, + 858.0, + 701.0, + 891.0, + 669.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 824.0, + 773.0, + 824.0, + 773.0, + 879.0, + 734.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 824.0, + 897.0, + 824.0, + 897.0, + 875.0, + 865.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 856.0, + 981.0, + 856.0, + 981.0, + 890.0, + 922.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 824.0, + 1034.0, + 824.0, + 1034.0, + 887.0, + 995.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 854.0, + 1107.0, + 854.0, + 1107.0, + 883.0, + 1067.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 821.0, + 1175.0, + 821.0, + 1175.0, + 904.0, + 1117.0, + 904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 854.0, + 1233.0, + 854.0, + 1233.0, + 885.0, + 1198.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 824.0, + 1298.0, + 824.0, + 1298.0, + 843.0, + 1274.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 912.0, + 387.0, + 912.0, + 387.0, + 999.0, + 311.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 948.0, + 443.0, + 948.0, + 443.0, + 988.0, + 406.0, + 988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 959.0, + 468.0, + 959.0, + 468.0, + 972.0, + 452.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 475.0, + 962.0, + 510.0, + 962.0, + 510.0, + 978.0, + 475.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 962.0, + 567.0, + 962.0, + 567.0, + 978.0, + 540.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 909.0, + 648.0, + 909.0, + 648.0, + 994.0, + 585.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 935.0, + 703.0, + 935.0, + 703.0, + 983.0, + 664.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 909.0, + 771.0, + 909.0, + 771.0, + 991.0, + 730.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 930.0, + 831.0, + 930.0, + 831.0, + 986.0, + 796.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 845.0, + 911.0, + 910.0, + 911.0, + 910.0, + 996.0, + 845.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 912.0, + 1050.0, + 912.0, + 1050.0, + 986.0, + 991.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1128.0, + 912.0, + 1169.0, + 912.0, + 1169.0, + 975.0, + 1128.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 912.0, + 1296.0, + 912.0, + 1296.0, + 932.0, + 1276.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1001.0, + 359.0, + 1001.0, + 359.0, + 1018.0, + 335.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1001.0, + 505.0, + 1001.0, + 505.0, + 1068.0, + 448.0, + 1068.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 997.0, + 629.0, + 997.0, + 629.0, + 1023.0, + 602.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 1001.0, + 774.0, + 1001.0, + 774.0, + 1087.0, + 645.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 790.0, + 1018.0, + 825.0, + 1018.0, + 825.0, + 1049.0, + 790.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1001.0, + 930.0, + 1001.0, + 930.0, + 1092.0, + 835.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 999.0, + 1045.0, + 999.0, + 1045.0, + 1089.0, + 960.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 1001.0, + 1255.0, + 1001.0, + 1255.0, + 1091.0, + 1109.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1001.0, + 1296.0, + 1001.0, + 1296.0, + 1020.0, + 1274.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 1039.0, + 564.0, + 1039.0, + 564.0, + 1052.0, + 546.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 812.0, + 1044.0, + 836.0, + 1044.0, + 836.0, + 1063.0, + 812.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 1055.0, + 954.0, + 1055.0, + 954.0, + 1066.0, + 935.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 1039.0, + 1303.0, + 1039.0, + 1303.0, + 1062.0, + 1261.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 1030.0, + 1373.0, + 1030.0, + 1373.0, + 1066.0, + 1327.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 1089.0, + 359.0, + 1089.0, + 359.0, + 1108.0, + 336.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 1089.0, + 494.0, + 1089.0, + 494.0, + 1108.0, + 470.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 1089.0, + 628.0, + 1089.0, + 628.0, + 1108.0, + 602.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1089.0, + 761.0, + 1089.0, + 761.0, + 1108.0, + 738.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1089.0, + 897.0, + 1089.0, + 897.0, + 1108.0, + 871.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1089.0, + 1031.0, + 1089.0, + 1031.0, + 1108.0, + 1007.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1089.0, + 1163.0, + 1089.0, + 1163.0, + 1108.0, + 1140.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1087.0, + 1300.0, + 1087.0, + 1300.0, + 1111.0, + 1273.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 518.0, + 1118.0, + 567.0, + 1118.0, + 567.0, + 1163.0, + 518.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 1099.0, + 705.0, + 1099.0, + 705.0, + 1171.0, + 572.0, + 1171.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 1126.0, + 824.0, + 1126.0, + 824.0, + 1144.0, + 800.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 1109.0, + 1041.0, + 1109.0, + 1041.0, + 1138.0, + 978.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 1116.0, + 1102.0, + 1116.0, + 1102.0, + 1134.0, + 1074.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 1123.0, + 1167.0, + 1123.0, + 1167.0, + 1145.0, + 1150.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1139.0, + 371.0, + 1139.0, + 371.0, + 1161.0, + 349.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1139.0, + 483.0, + 1139.0, + 483.0, + 1152.0, + 464.0, + 1152.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 1139.0, + 1015.0, + 1139.0, + 1015.0, + 1164.0, + 988.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1176.0, + 362.0, + 1176.0, + 362.0, + 1200.0, + 335.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 1177.0, + 494.0, + 1177.0, + 494.0, + 1197.0, + 472.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 1177.0, + 628.0, + 1177.0, + 628.0, + 1197.0, + 605.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 1177.0, + 760.0, + 1177.0, + 760.0, + 1197.0, + 741.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 1177.0, + 895.0, + 1177.0, + 895.0, + 1197.0, + 873.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1177.0, + 1031.0, + 1177.0, + 1031.0, + 1197.0, + 1007.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 1176.0, + 1166.0, + 1176.0, + 1166.0, + 1200.0, + 1139.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1177.0, + 1298.0, + 1177.0, + 1298.0, + 1197.0, + 1276.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 1201.0, + 511.0, + 1201.0, + 511.0, + 1250.0, + 452.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 1196.0, + 1179.0, + 1196.0, + 1179.0, + 1256.0, + 515.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 1205.0, + 1241.0, + 1205.0, + 1241.0, + 1240.0, + 1190.0, + 1240.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1213.0, + 1362.0, + 1213.0, + 1362.0, + 1230.0, + 1335.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1266.0, + 359.0, + 1266.0, + 359.0, + 1285.0, + 335.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 1266.0, + 492.0, + 1266.0, + 492.0, + 1285.0, + 470.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1266.0, + 626.0, + 1266.0, + 626.0, + 1285.0, + 604.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1266.0, + 761.0, + 1266.0, + 761.0, + 1285.0, + 738.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 1266.0, + 894.0, + 1266.0, + 894.0, + 1285.0, + 873.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1008.0, + 1266.0, + 1029.0, + 1266.0, + 1029.0, + 1285.0, + 1008.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1266.0, + 1163.0, + 1266.0, + 1163.0, + 1285.0, + 1140.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1266.0, + 1296.0, + 1266.0, + 1296.0, + 1285.0, + 1276.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 1291.0, + 446.0, + 1291.0, + 446.0, + 1341.0, + 389.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 1298.0, + 500.0, + 1298.0, + 500.0, + 1328.0, + 460.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 1284.0, + 706.0, + 1284.0, + 706.0, + 1344.0, + 524.0, + 1344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 1295.0, + 784.0, + 1295.0, + 784.0, + 1333.0, + 718.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 788.0, + 1295.0, + 846.0, + 1295.0, + 846.0, + 1335.0, + 788.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 1295.0, + 905.0, + 1295.0, + 905.0, + 1323.0, + 852.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1291.0, + 983.0, + 1291.0, + 983.0, + 1338.0, + 919.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 989.0, + 1301.0, + 1005.0, + 1301.0, + 1005.0, + 1312.0, + 989.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1317.0, + 1290.0, + 1376.0, + 1290.0, + 1376.0, + 1340.0, + 1317.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 1356.0, + 360.0, + 1356.0, + 360.0, + 1373.0, + 336.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 1352.0, + 495.0, + 1352.0, + 495.0, + 1376.0, + 468.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 738.0, + 1356.0, + 761.0, + 1356.0, + 761.0, + 1375.0, + 738.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1354.0, + 895.0, + 1354.0, + 895.0, + 1373.0, + 871.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1354.0, + 1029.0, + 1354.0, + 1029.0, + 1373.0, + 1007.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1354.0, + 1163.0, + 1354.0, + 1163.0, + 1373.0, + 1140.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1356.0, + 1296.0, + 1356.0, + 1296.0, + 1373.0, + 1276.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 343.0, + 1394.0, + 368.0, + 1394.0, + 368.0, + 1410.0, + 343.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 1396.0, + 425.0, + 1396.0, + 425.0, + 1409.0, + 413.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 1389.0, + 566.0, + 1389.0, + 566.0, + 1407.0, + 545.0, + 1407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 1386.0, + 634.0, + 1386.0, + 634.0, + 1417.0, + 589.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 1392.0, + 780.0, + 1392.0, + 780.0, + 1422.0, + 724.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1388.0, + 972.0, + 1388.0, + 972.0, + 1417.0, + 927.0, + 1417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1376.0, + 1120.0, + 1376.0, + 1120.0, + 1438.0, + 980.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 1372.0, + 1171.0, + 1372.0, + 1171.0, + 1431.0, + 1126.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 1375.0, + 1236.0, + 1375.0, + 1236.0, + 1428.0, + 1198.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 1399.0, + 1306.0, + 1399.0, + 1306.0, + 1421.0, + 1258.0, + 1421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 1386.0, + 1371.0, + 1386.0, + 1371.0, + 1412.0, + 1339.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 1442.0, + 357.0, + 1442.0, + 357.0, + 1462.0, + 336.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 1442.0, + 494.0, + 1442.0, + 494.0, + 1462.0, + 470.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 1442.0, + 628.0, + 1442.0, + 628.0, + 1462.0, + 602.0, + 1462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1441.0, + 768.0, + 1441.0, + 768.0, + 1463.0, + 733.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 1441.0, + 902.0, + 1441.0, + 902.0, + 1463.0, + 867.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 1441.0, + 1035.0, + 1441.0, + 1035.0, + 1463.0, + 1002.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1441.0, + 1169.0, + 1441.0, + 1169.0, + 1463.0, + 1136.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 1441.0, + 1304.0, + 1441.0, + 1304.0, + 1463.0, + 1269.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 1458.0, + 791.0, + 1458.0, + 791.0, + 1516.0, + 705.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1457.0, + 1040.0, + 1457.0, + 1040.0, + 1516.0, + 980.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1123.0, + 1460.0, + 1137.0, + 1460.0, + 1137.0, + 1473.0, + 1123.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1473.0, + 362.0, + 1473.0, + 362.0, + 1495.0, + 327.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 534.0, + 1478.0, + 569.0, + 1478.0, + 569.0, + 1502.0, + 534.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 1466.0, + 639.0, + 1466.0, + 639.0, + 1516.0, + 583.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 669.0, + 1470.0, + 704.0, + 1470.0, + 704.0, + 1515.0, + 669.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 825.0, + 1481.0, + 846.0, + 1481.0, + 846.0, + 1499.0, + 825.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 1482.0, + 884.0, + 1482.0, + 884.0, + 1500.0, + 854.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 1470.0, + 1104.0, + 1470.0, + 1104.0, + 1495.0, + 1078.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1203.0, + 1482.0, + 1238.0, + 1482.0, + 1238.0, + 1500.0, + 1203.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1505.0, + 967.0, + 1505.0, + 967.0, + 1518.0, + 954.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1531.0, + 365.0, + 1531.0, + 365.0, + 1553.0, + 330.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1531.0, + 497.0, + 1531.0, + 497.0, + 1553.0, + 465.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1529.0, + 632.0, + 1529.0, + 632.0, + 1553.0, + 599.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1531.0, + 766.0, + 1531.0, + 766.0, + 1553.0, + 733.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1531.0, + 902.0, + 1531.0, + 902.0, + 1553.0, + 868.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 1529.0, + 1035.0, + 1529.0, + 1035.0, + 1553.0, + 1002.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1529.0, + 1169.0, + 1529.0, + 1169.0, + 1553.0, + 1136.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 1529.0, + 1303.0, + 1529.0, + 1303.0, + 1553.0, + 1269.0, + 1553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 1553.0, + 499.0, + 1553.0, + 499.0, + 1576.0, + 452.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1553.0, + 562.0, + 1553.0, + 562.0, + 1571.0, + 538.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 1545.0, + 647.0, + 1545.0, + 647.0, + 1608.0, + 572.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 1555.0, + 701.0, + 1555.0, + 701.0, + 1593.0, + 661.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1564.0, + 763.0, + 1564.0, + 763.0, + 1592.0, + 733.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 1564.0, + 831.0, + 1564.0, + 831.0, + 1598.0, + 796.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 1558.0, + 1144.0, + 1558.0, + 1144.0, + 1587.0, + 1120.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1560.0, + 1206.0, + 1560.0, + 1206.0, + 1584.0, + 1188.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1249.0, + 1560.0, + 1387.0, + 1560.0, + 1387.0, + 1613.0, + 1249.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1617.0, + 365.0, + 1617.0, + 365.0, + 1642.0, + 331.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1617.0, + 632.0, + 1617.0, + 632.0, + 1642.0, + 599.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1617.0, + 900.0, + 1617.0, + 900.0, + 1642.0, + 868.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 1617.0, + 1034.0, + 1617.0, + 1034.0, + 1642.0, + 1002.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1617.0, + 1169.0, + 1617.0, + 1169.0, + 1642.0, + 1136.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 1617.0, + 1301.0, + 1617.0, + 1301.0, + 1642.0, + 1269.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1646.0, + 379.0, + 1646.0, + 379.0, + 1682.0, + 320.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 1645.0, + 510.0, + 1645.0, + 510.0, + 1685.0, + 381.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 1650.0, + 577.0, + 1650.0, + 577.0, + 1682.0, + 516.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 1642.0, + 639.0, + 1642.0, + 639.0, + 1691.0, + 584.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 1648.0, + 704.0, + 1648.0, + 704.0, + 1685.0, + 656.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1638.0, + 779.0, + 1638.0, + 779.0, + 1701.0, + 710.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 1638.0, + 983.0, + 1638.0, + 983.0, + 1688.0, + 919.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1638.0, + 1175.0, + 1638.0, + 1175.0, + 1701.0, + 1048.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1212.0, + 1646.0, + 1241.0, + 1646.0, + 1241.0, + 1674.0, + 1212.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 1659.0, + 1319.0, + 1659.0, + 1319.0, + 1703.0, + 1258.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1659.0, + 1381.0, + 1659.0, + 1381.0, + 1699.0, + 1336.0, + 1699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1707.0, + 365.0, + 1707.0, + 365.0, + 1730.0, + 331.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 464.0, + 1706.0, + 505.0, + 1706.0, + 505.0, + 1754.0, + 464.0, + 1754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 1706.0, + 709.0, + 1706.0, + 709.0, + 1797.0, + 550.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1706.0, + 784.0, + 1706.0, + 784.0, + 1784.0, + 717.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1706.0, + 988.0, + 1706.0, + 988.0, + 1796.0, + 805.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 1706.0, + 1035.0, + 1706.0, + 1035.0, + 1730.0, + 1002.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 1741.0, + 1093.0, + 1741.0, + 1093.0, + 1773.0, + 1059.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1118.0, + 1706.0, + 1179.0, + 1706.0, + 1179.0, + 1783.0, + 1118.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1741.0, + 1238.0, + 1741.0, + 1238.0, + 1786.0, + 1185.0, + 1786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 1706.0, + 1328.0, + 1706.0, + 1328.0, + 1789.0, + 1242.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1738.0, + 1368.0, + 1738.0, + 1368.0, + 1778.0, + 1330.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.75, + 408.5, + 646.75, + 408.5, + 646.75, + 450.0, + 574.75, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.25, + 405.0, + 717.25, + 405.0, + 717.25, + 450.0, + 640.25, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 402.0, + 795.0, + 402.0, + 795.0, + 455.0, + 704.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 588.0, + 981.0, + 588.0, + 981.0, + 621.5, + 920.0, + 621.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.75, + 594.5, + 1104.75, + 594.5, + 1104.75, + 618.5, + 1072.75, + 618.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 667.5, + 511.0, + 667.5, + 511.0, + 721.5, + 456.0, + 721.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 672.5, + 635.0, + 672.5, + 635.0, + 715.5, + 595.0, + 715.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.75, + 676.0, + 904.75, + 676.0, + 904.75, + 705.0, + 847.75, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.25, + 689.0, + 1032.25, + 689.0, + 1032.25, + 716.0, + 995.25, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 753.5, + 458.0, + 753.5, + 458.0, + 817.5, + 368.0, + 817.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.75, + 756.5, + 516.75, + 756.5, + 516.75, + 809.5, + 434.75, + 809.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 769.5, + 1095.0, + 769.5, + 1095.0, + 790.5, + 1092.0, + 790.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 776.0, + 1293.0, + 776.0, + 1293.0, + 796.5, + 1266.0, + 796.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 578.25, + 767.5, + 653.25, + 767.5, + 653.25, + 798.5, + 578.25, + 798.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 855.0, + 838.0, + 855.0, + 838.0, + 879.5, + 796.0, + 879.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.25, + 856.0, + 594.25, + 856.0, + 594.25, + 903.0, + 506.25, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 865.0, + 776.0, + 865.0, + 776.0, + 894.5, + 728.0, + 894.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.75, + 909.0, + 493.75, + 909.0, + 493.75, + 933.0, + 468.75, + 933.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 941.5, + 1102.0, + 941.5, + 1102.0, + 976.0, + 1071.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1208.25, + 953.0, + 1227.25, + 953.0, + 1227.25, + 971.0, + 1208.25, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1028.5, + 387.0, + 1028.5, + 387.0, + 1062.5, + 319.0, + 1062.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 566.0, + 1031.0, + 666.0, + 1031.0, + 666.0, + 1077.0, + 566.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 1107.0, + 440.0, + 1107.0, + 440.0, + 1156.5, + 388.0, + 1156.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 1118.0, + 911.0, + 1118.0, + 911.0, + 1156.0, + 842.0, + 1156.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.0, + 1124.0, + 968.0, + 1124.0, + 968.0, + 1151.5, + 914.0, + 1151.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 373.0, + 1198.0, + 455.0, + 1198.0, + 455.0, + 1247.5, + 373.0, + 1247.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 1295.5, + 1312.0, + 1295.5, + 1312.0, + 1332.0, + 1263.0, + 1332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.75, + 1312.5, + 902.75, + 1312.5, + 902.75, + 1334.5, + 861.75, + 1334.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.25, + 1296.0, + 1113.25, + 1296.0, + 1113.25, + 1322.0, + 1071.25, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 603.25, + 1354.0, + 623.25, + 1354.0, + 623.25, + 1373.5, + 603.25, + 1373.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 1391.0, + 698.0, + 1391.0, + 698.0, + 1413.0, + 668.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 1396.5, + 510.0, + 1396.5, + 510.0, + 1420.5, + 467.0, + 1420.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1470.5, + 439.0, + 1470.5, + 439.0, + 1505.5, + 396.0, + 1505.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 1475.0, + 1181.0, + 1475.0, + 1181.0, + 1507.5, + 1124.0, + 1507.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 1553.5, + 1192.0, + 1553.5, + 1192.0, + 1609.0, + 1103.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1182.0, + 1566.5, + 1254.0, + 1566.5, + 1254.0, + 1592.5, + 1182.0, + 1592.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.25, + 1617.5, + 496.25, + 1617.5, + 496.25, + 1640.0, + 466.25, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1617.5, + 765.0, + 1617.5, + 765.0, + 1641.5, + 734.0, + 1641.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.25, + 1642.5, + 1035.25, + 1642.5, + 1035.25, + 1690.5, + 994.25, + 1690.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1652.5, + 893.0, + 1652.5, + 893.0, + 1678.5, + 847.0, + 1678.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 1736.0, + 1045.0, + 1736.0, + 1045.0, + 1789.0, + 978.0, + 1789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1848.0, + 1279.0, + 1848.0, + 1279.0, + 1888.0, + 418.0, + 1888.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, + 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": "" + } + ], + "page_info": { + "page_no": 20, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_layout.pdf b/parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ea831245df3cb8c40cf8d4f8e312229d04af7cf3 --- /dev/null +++ b/parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0ac5d71866e9887df2a77e476973888ca090bd228867f0868184c381866c2b61 +size 1007127 diff --git a/parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_origin.pdf b/parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..19e079cbe64184174dd9ec98e86bdf9c3c84c017 --- /dev/null +++ b/parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:369375df058ea196c23b2f3c50a803e34c5b033e84a3b4a3e72c203f6e502d10 +size 751732 diff --git a/parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_span.pdf b/parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6bb037b9c8e3e48a7b15a62cd6dc595f5c875a6d --- /dev/null +++ b/parse/train/ZqB2GD-Ixn/ZqB2GD-Ixn_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ef579392455d97e7cd095c54abc1ff4134c57581cf236e1cca510966b9ae94ca +size 1019502 diff --git a/parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_layout.pdf b/parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7d8e8a23807b03cf72b7b7ba0fbe9e6293be501b --- /dev/null +++ b/parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:cf7748e9cee6381d172240cefd54fd4fe802bd402d917d0310243ae8d8437ce8 +size 1085619 diff --git a/parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_origin.pdf b/parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ee32ee3a5860d2bb5ef0fb5b17bc57ef867172a0 --- /dev/null +++ b/parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d1ba2ea9232cc2c6ee53a38f5bcdf086ff27a5bbbc275aadaa9794ff57c49ffc +size 921883 diff --git a/parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_span.pdf b/parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c96bc07bb1570e1628adcdb65dab08c0b40b896d --- /dev/null +++ b/parse/train/ahAUv8TI2Mz/ahAUv8TI2Mz_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c1293a25e4a2add9249686bbaf0d93ae0377ff1a787277e12ba38a300c2ee6f6 +size 1088889 diff --git a/parse/train/bJxgv5C3sYc/bJxgv5C3sYc_layout.pdf b/parse/train/bJxgv5C3sYc/bJxgv5C3sYc_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a29d005bd8bd60579cd8c93505e243fb17afdbe0 --- /dev/null +++ b/parse/train/bJxgv5C3sYc/bJxgv5C3sYc_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8fa2aef3099f0191c392dc548cd95731ab7aa6588b314dd647e002548358f635 +size 815233 diff --git a/parse/train/bJxgv5C3sYc/bJxgv5C3sYc_origin.pdf b/parse/train/bJxgv5C3sYc/bJxgv5C3sYc_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..522f9b32cf5b4a35c3bff5a16cf07a0e6dda3dae --- /dev/null +++ b/parse/train/bJxgv5C3sYc/bJxgv5C3sYc_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:08c819df31296f6f57159e8820a8e819ababfd63d20fc0c1707cfa3085f6ca67 +size 649254 diff --git a/parse/train/bJxgv5C3sYc/bJxgv5C3sYc_span.pdf b/parse/train/bJxgv5C3sYc/bJxgv5C3sYc_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4941318668c0feb4aa4cb527de994cb749efdfb2 --- /dev/null +++ b/parse/train/bJxgv5C3sYc/bJxgv5C3sYc_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c75ab306c9e694b45d4af04700b92348ca2d23d97406bc4a639e8d0cc5b39385 +size 819601 diff --git a/parse/train/butEPeLARP_/butEPeLARP__layout.pdf b/parse/train/butEPeLARP_/butEPeLARP__layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4925df526b33b03e1dfeba18df6be2938536e846 --- /dev/null +++ b/parse/train/butEPeLARP_/butEPeLARP__layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4b8e88710d5f573f48dc5cbe86236b67872aae3937eac3260a72e6ca126c774d +size 711616 diff --git a/parse/train/butEPeLARP_/butEPeLARP__origin.pdf b/parse/train/butEPeLARP_/butEPeLARP__origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7297467c245d66950c808d0871850e0351bef271 --- /dev/null +++ b/parse/train/butEPeLARP_/butEPeLARP__origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:813085f41fbd45a95d815c8d244cf2bf3ab625f4574e82a8da6cb5eaf7885022 +size 492681 diff --git a/parse/train/butEPeLARP_/butEPeLARP__span.pdf b/parse/train/butEPeLARP_/butEPeLARP__span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b010d5eba050d7d2709ca35cd4bc14d70cb4def6 --- /dev/null +++ b/parse/train/butEPeLARP_/butEPeLARP__span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:945e733a4085eb0abc7b5366d7b21859944e166143628d0bfee398558e1c25fd +size 719864 diff --git a/parse/train/c_E8kFWfhp0/c_E8kFWfhp0_layout.pdf b/parse/train/c_E8kFWfhp0/c_E8kFWfhp0_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e112de9b4320d19e73ee6b3a947d4d8e80afbf39 --- /dev/null +++ b/parse/train/c_E8kFWfhp0/c_E8kFWfhp0_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:1577f4a15c3c364e6c9ef04e4a3b340a7226d5fead3c13e69eea244848d9b18e +size 4190632 diff --git a/parse/train/c_E8kFWfhp0/c_E8kFWfhp0_origin.pdf b/parse/train/c_E8kFWfhp0/c_E8kFWfhp0_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..dc79197dc0fd390ec979c4ffdab1c2d7c508046a --- /dev/null +++ b/parse/train/c_E8kFWfhp0/c_E8kFWfhp0_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:57d9add91fcb37b1996ae87f8cc8f9525ecbf3a875099f3e99498febb208c96e +size 3866499 diff --git a/parse/train/c_E8kFWfhp0/c_E8kFWfhp0_span.pdf b/parse/train/c_E8kFWfhp0/c_E8kFWfhp0_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..31b2b600077fff9e81438b75f1311a4b699c7fee --- /dev/null +++ b/parse/train/c_E8kFWfhp0/c_E8kFWfhp0_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a7754de93a3a5730158dd15f40152f2a68cc238416e938a18bf898a64378068e +size 4190326 diff --git a/parse/train/h7-XixPCAL/h7-XixPCAL_layout.pdf b/parse/train/h7-XixPCAL/h7-XixPCAL_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..625463b480eac6a0eb204004821f3074bc5adc40 --- /dev/null +++ b/parse/train/h7-XixPCAL/h7-XixPCAL_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5013ac74d7903fae5ca3eee4363e4c2c164f5bf6c16287647a7fceef90a5b17e +size 2978818 diff --git a/parse/train/h7-XixPCAL/h7-XixPCAL_origin.pdf b/parse/train/h7-XixPCAL/h7-XixPCAL_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..17a93bcacc4b22adecdd5d97c15b226f70671c26 --- /dev/null +++ b/parse/train/h7-XixPCAL/h7-XixPCAL_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f29ac4a2a4824841be8b2dcd70282f585a14b83e70b15e1dac5da2de7ba4b44e +size 2695759 diff --git a/parse/train/h7-XixPCAL/h7-XixPCAL_span.pdf b/parse/train/h7-XixPCAL/h7-XixPCAL_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..7bd4db1c6201ae3f08c9ce2dc621e1c6abc1ed9b --- /dev/null +++ b/parse/train/h7-XixPCAL/h7-XixPCAL_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6575c184d13d9359f2bf98dbe931c66aed52644dd9df8adc1e3abd9ce39c1b5b +size 2998663 diff --git a/parse/train/h8flNv9x8v-/h8flNv9x8v-_layout.pdf b/parse/train/h8flNv9x8v-/h8flNv9x8v-_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2bbfeb7696e32b3f33ecf86f91a9c63029522b6f --- /dev/null +++ b/parse/train/h8flNv9x8v-/h8flNv9x8v-_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:57b1bd5405031ae8435e82db7dc46fd5f18667dd5292f69855ba14c48966e5d9 +size 4687674 diff --git a/parse/train/h8flNv9x8v-/h8flNv9x8v-_origin.pdf b/parse/train/h8flNv9x8v-/h8flNv9x8v-_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..96c67bb97c5ef4d845501d43c54619aeb4180df5 --- /dev/null +++ b/parse/train/h8flNv9x8v-/h8flNv9x8v-_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:774ffd3ebec92b33e54e2418883c09c2670760f364c6f6d7de71902fe58487fd +size 4380328 diff --git a/parse/train/h8flNv9x8v-/h8flNv9x8v-_span.pdf b/parse/train/h8flNv9x8v-/h8flNv9x8v-_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4d17f96ae29f666e014bb1720f72a36c5efb93be --- /dev/null +++ b/parse/train/h8flNv9x8v-/h8flNv9x8v-_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a7688896f35e627596b2ca92816b49ff143743b0328e6bb1229e4a94bfb28dc4 +size 4695665 diff --git a/parse/train/hvdKKV2yt7T/hvdKKV2yt7T_layout.pdf b/parse/train/hvdKKV2yt7T/hvdKKV2yt7T_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..eabcb687df8d60999ff8c039043f189a193e72c7 --- /dev/null +++ b/parse/train/hvdKKV2yt7T/hvdKKV2yt7T_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4f9a101ca3e00f09641177010a4bc1f2ba31abace94585625d109595452b982a +size 958272 diff --git a/parse/train/hvdKKV2yt7T/hvdKKV2yt7T_origin.pdf b/parse/train/hvdKKV2yt7T/hvdKKV2yt7T_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5b280e29b26510bee9e320d26f4ae76e9da14af9 --- /dev/null +++ b/parse/train/hvdKKV2yt7T/hvdKKV2yt7T_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ef88304d4e0c794e890cc15e357096c7bf95c6acf1a93a36d638b596f410d6a9 +size 682786 diff --git a/parse/train/hvdKKV2yt7T/hvdKKV2yt7T_span.pdf b/parse/train/hvdKKV2yt7T/hvdKKV2yt7T_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..bc718c253bf330bb0dc800523875caacc1119c55 --- /dev/null +++ b/parse/train/hvdKKV2yt7T/hvdKKV2yt7T_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6fdf0a2484278bfbb44c3b505dc0419f8f67c930a0ec6cc48ad3074d0fd1d373 +size 974567 diff --git a/parse/train/iaO86DUuKi/iaO86DUuKi_layout.pdf b/parse/train/iaO86DUuKi/iaO86DUuKi_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..791d44a8a1018c6ac863005e2ce10dd5378404dc --- /dev/null +++ b/parse/train/iaO86DUuKi/iaO86DUuKi_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ffb2ff5bb5175b0e32cc84fce6c0ce40eb6624740a055eced159700c2e4b53ee +size 12125262 diff --git a/parse/train/iaO86DUuKi/iaO86DUuKi_origin.pdf b/parse/train/iaO86DUuKi/iaO86DUuKi_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2c8dee0fe06a6f9fd0fc522bb8a0cafa10db789e --- /dev/null +++ b/parse/train/iaO86DUuKi/iaO86DUuKi_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:29805f36a9cecbe012602572aac677a913b5fb628bd05e2061a6ef6520ad13bf +size 11659237 diff --git a/parse/train/iaO86DUuKi/iaO86DUuKi_span.pdf b/parse/train/iaO86DUuKi/iaO86DUuKi_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..263328b5e82bc9f9de81eae405190e3b56092794 --- /dev/null +++ b/parse/train/iaO86DUuKi/iaO86DUuKi_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:72db063ef46e3c779f75206664930666cd7877a21af917f650130e4790ae2571 +size 12140954 diff --git a/parse/train/kFJoj7zuDVi/kFJoj7zuDVi_layout.pdf b/parse/train/kFJoj7zuDVi/kFJoj7zuDVi_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..26c434313f70dcbc061d8918c4178abefd3522e3 --- /dev/null +++ b/parse/train/kFJoj7zuDVi/kFJoj7zuDVi_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:304273f989a82009e437a17e95c30d762cbff9a0e73e121026c2d42f241ed7e5 +size 784944 diff --git a/parse/train/kFJoj7zuDVi/kFJoj7zuDVi_origin.pdf b/parse/train/kFJoj7zuDVi/kFJoj7zuDVi_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..80986b1ddc36a7a8532b6de07cd004caa4f5a7d9 --- /dev/null +++ b/parse/train/kFJoj7zuDVi/kFJoj7zuDVi_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fede14b90f24e6a831739ea193ac09bb707ea4d719b5eb3fa6aeaf21a55c0dea +size 601748 diff --git a/parse/train/kFJoj7zuDVi/kFJoj7zuDVi_span.pdf b/parse/train/kFJoj7zuDVi/kFJoj7zuDVi_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e8c06743833846d5b0bb2cbf67518957b5d9fc36 --- /dev/null +++ b/parse/train/kFJoj7zuDVi/kFJoj7zuDVi_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c3766850c9dc8d97c20b18aaa44c30a5530719f963046c716f5e05f0275e4232 +size 803487 diff --git a/parse/train/mSAKhLYLSsl/mSAKhLYLSsl_layout.pdf b/parse/train/mSAKhLYLSsl/mSAKhLYLSsl_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b9c974a70b0d4e0cca9432a7e7ca7d32e02e7ffa --- /dev/null +++ b/parse/train/mSAKhLYLSsl/mSAKhLYLSsl_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0446a92f42cd588a76b914e804630bd895ccd6920e463b34ccb883da80171d7c +size 3086996 diff --git a/parse/train/mSAKhLYLSsl/mSAKhLYLSsl_span.pdf b/parse/train/mSAKhLYLSsl/mSAKhLYLSsl_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..629c0d19d5acabe61f3dbfda6d7b750c74a79116 --- /dev/null +++ b/parse/train/mSAKhLYLSsl/mSAKhLYLSsl_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2cd0035a566648ed613a8fb385d12be80e86c3471676ba6464e08372a687c64d +size 3098284 diff --git a/parse/train/mfQxdSMWOF/mfQxdSMWOF_layout.pdf b/parse/train/mfQxdSMWOF/mfQxdSMWOF_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..85aa782a2f99694b3ab95af5c68abdeaf2110fc5 --- /dev/null +++ b/parse/train/mfQxdSMWOF/mfQxdSMWOF_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:99794be9312860f6b2b483b012b3a5654f4477bdacb3c2a37cf07cb91b309545 +size 1334682 diff --git a/parse/train/mfQxdSMWOF/mfQxdSMWOF_origin.pdf b/parse/train/mfQxdSMWOF/mfQxdSMWOF_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..baaca7d638b6624010113f6d52c16bbed4780149 --- /dev/null +++ b/parse/train/mfQxdSMWOF/mfQxdSMWOF_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a81c2ddda17e933f2b8d3853d0a9ffa0d943abf023a59ff44bccd5b70fafcc9f +size 1165144 diff --git a/parse/train/mfQxdSMWOF/mfQxdSMWOF_span.pdf b/parse/train/mfQxdSMWOF/mfQxdSMWOF_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9832920ebf2da57d75ea1218ac33b70f948b41c7 --- /dev/null +++ b/parse/train/mfQxdSMWOF/mfQxdSMWOF_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3505966d40c94ba0ee6dcc1377f6b91699dfc0fe494af19251dad21cc0f8bb3f +size 1344216 diff --git a/parse/train/oDPxtrCMboN/oDPxtrCMboN_layout.pdf b/parse/train/oDPxtrCMboN/oDPxtrCMboN_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8a2ffbf13c48ef251a897b0e88cdc22ddfbd7939 --- /dev/null +++ b/parse/train/oDPxtrCMboN/oDPxtrCMboN_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c61c65b73359ab8076620b85478cf403d57a89e757d13a51bcebeb3bd983c6b6 +size 14314409 diff --git a/parse/train/oDPxtrCMboN/oDPxtrCMboN_origin.pdf b/parse/train/oDPxtrCMboN/oDPxtrCMboN_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c2558bc8820883979d81c09165da8566656427a4 --- /dev/null +++ b/parse/train/oDPxtrCMboN/oDPxtrCMboN_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:4532cecf2659f9f7f56ffe881be2e1ee43a0a38bdfb2d51958f0a3dd33d0d04e +size 13988072 diff --git a/parse/train/oDPxtrCMboN/oDPxtrCMboN_span.pdf b/parse/train/oDPxtrCMboN/oDPxtrCMboN_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..281279b1faaee9eeeb32f6052eda4adb36f6f02c --- /dev/null +++ b/parse/train/oDPxtrCMboN/oDPxtrCMboN_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f4fa622e51856e92b2ac49671b7ac98ada82c3bf930f6b1675697e519361cea7 +size 14323509 diff --git a/parse/train/pDgN3l3EAF/pDgN3l3EAF_layout.pdf b/parse/train/pDgN3l3EAF/pDgN3l3EAF_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2c8f7dfe877ac785013038781180082917b0fb57 --- /dev/null +++ b/parse/train/pDgN3l3EAF/pDgN3l3EAF_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6d25b521a119c6181eebcdc9fff3a19c291e434743310620b66fb717fe6577e2 +size 1249677 diff --git a/parse/train/pDgN3l3EAF/pDgN3l3EAF_origin.pdf b/parse/train/pDgN3l3EAF/pDgN3l3EAF_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6ce6223a63fa44d8de0d64dded4fbf0625482fd7 --- /dev/null +++ b/parse/train/pDgN3l3EAF/pDgN3l3EAF_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3828a1e40cec54cbe5eb1f104bcc16feb1198e4c27a2a6881b3dc2d957fefbe0 +size 1110085 diff --git a/parse/train/pDgN3l3EAF/pDgN3l3EAF_span.pdf b/parse/train/pDgN3l3EAF/pDgN3l3EAF_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..90096b84fa5544167d3687865dda09b0646723d9 --- /dev/null +++ b/parse/train/pDgN3l3EAF/pDgN3l3EAF_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3b0b416035ece3e048bc5a65c1e239e38371107061e6ab5a43d2609907a29f36 +size 1257221 diff --git a/parse/train/r10FA8Kxg/r10FA8Kxg_layout.pdf b/parse/train/r10FA8Kxg/r10FA8Kxg_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..762bd2d3e22c77be8f72596971dbe3a9de2e25cd --- /dev/null +++ b/parse/train/r10FA8Kxg/r10FA8Kxg_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3f37a86df78c61b0c7e0788992e32a16b5273ae35ed074319b4ebb908690ac65 +size 490819 diff --git a/parse/train/r10FA8Kxg/r10FA8Kxg_origin.pdf b/parse/train/r10FA8Kxg/r10FA8Kxg_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e81bacde5ca5f27ba2403040ae112c77f1365b4c --- /dev/null +++ b/parse/train/r10FA8Kxg/r10FA8Kxg_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8183060d1f0a9594ad155fc7bf5fb6d56324ca2df1d9540cd41991e94b5b54c3 +size 325499 diff --git a/parse/train/r10FA8Kxg/r10FA8Kxg_span.pdf b/parse/train/r10FA8Kxg/r10FA8Kxg_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..84d03714bc99d1303bda9bfd1dab0ccbc7619a79 --- /dev/null +++ b/parse/train/r10FA8Kxg/r10FA8Kxg_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:83bf86f2f59cac7e32e6e658a3f670d14119efdd8d9ee436c42e2ab20eab13d7 +size 499365 diff --git a/parse/train/r1Oen--RW/r1Oen--RW_layout.pdf b/parse/train/r1Oen--RW/r1Oen--RW_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d58ea5543642d1b13924e1dbd0523a08b9e2b1a1 --- /dev/null +++ b/parse/train/r1Oen--RW/r1Oen--RW_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:892f54d6872f4ef559d6440e2cbfbf5443ad8b9ea2b26f3538029b3ae8d22e8b +size 1080127 diff --git a/parse/train/r1Oen--RW/r1Oen--RW_origin.pdf b/parse/train/r1Oen--RW/r1Oen--RW_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e3838b6e4838ad2804a2bfbe2f69bf363a307095 --- /dev/null +++ b/parse/train/r1Oen--RW/r1Oen--RW_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:84251b7c01818a6cc77af8ffc3d37265d3ca0fd94e7c5b23f283f3a5793534be +size 992596 diff --git a/parse/train/r1Oen--RW/r1Oen--RW_span.pdf b/parse/train/r1Oen--RW/r1Oen--RW_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e895e685b65682c5aeb751b4af31223ad80a8f00 --- /dev/null +++ b/parse/train/r1Oen--RW/r1Oen--RW_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:57089138f4101ba2fb0532df8d5b7f3d7593c2372a722239025648e38f6d0402 +size 1077518 diff --git a/parse/train/r1efr3C9Ym/r1efr3C9Ym_content_list.json b/parse/train/r1efr3C9Ym/r1efr3C9Ym_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..94f08e13052ab46c50cfa67324b240cdfed1f767 --- /dev/null +++ b/parse/train/r1efr3C9Ym/r1efr3C9Ym_content_list.json @@ -0,0 +1,1707 @@ +[ + { + "type": "text", + "text": "INTERPOLATION-PREDICTION NETWORKS FORIRREGULARLY SAMPLED TIME SERIES", + "text_level": 1, + "bbox": [ + 176, + 98, + 735, + 146 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Satya Narayan Shukla College of Information and Computer Sciences University of Massachusetts Amherst snshukla@cs.umass.edu ", + "bbox": [ + 183, + 170, + 495, + 224 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Benjamin M. Marlin \nCollege of Information and Computer Sciences \nUniversity of Massachusetts Amherst \nmarlin@cs.umass.edu ", + "bbox": [ + 183, + 247, + 493, + 303 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 339, + 544, + 354 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In this paper, we present a new deep learning architecture for addressing the problem of supervised learning with sparse and irregularly sampled multivariate time series. The architecture is based on the use of a semi-parametric interpolation network followed by the application of a prediction network. The interpolation network allows for information to be shared across multiple dimensions of a multivariate time series during the interpolation stage, while any standard deep learning model can be used for the prediction network. This work is motivated by the analysis of physiological time series data in electronic health records, which are sparse, irregularly sampled, and multivariate. We investigate the performance of this architecture on both classification and regression tasks, showing that our approach outperforms a range of baseline and recently proposed models.1 ", + "bbox": [ + 233, + 371, + 764, + 525 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 553, + 336, + 569 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Over the last several years, there has been significant progress in developing specialized models and architectures that can accommodate sparse and irregularly sampled time series as input (Marlin et al., 2012; Li & Marlin, 2015; 2016; Lipton et al., 2016; Futoma et al., 2017; Che et al., 2018a). An irregularly sampled time series is a sequence of samples with irregular intervals between their observation times. Irregularly sampled data are considered to be sparse when the intervals between successive observations are often large. Of particular interest in the supervised learning setting are methods that perform end-to-end learning directly using multivariate sparse and irregularly sampled time series as input without the need for a separate interpolation or imputation step. ", + "bbox": [ + 174, + 585, + 825, + 696 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In this work, we present a new model architecture for supervised learning with multivariate sparse and irregularly sampled data: Interpolation-Prediction Networks. The architecture is based on the use of several semi-parametric interpolation layers organized into an interpolation network, followed by the application of a prediction network that can leverage any standard deep learning model. In this work, we use GRU networks (Chung et al., 2014) as the prediction network. ", + "bbox": [ + 174, + 703, + 825, + 772 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The interpolation network allows for information contained in each input time series to contribute to the interpolation of all other time series in the model. The parameters of the interpolation and prediction networks are learned end-to-end via a composite objective function consisting of supervised and unsupervised components. The interpolation network serves the same purpose as the multivariate Gaussian process used in the work of Futoma et al. (2017), but remove the restrictions associated with the need for a positive definite covariance matrix. ", + "bbox": [ + 174, + 779, + 825, + 863 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Our approach also allows us to compute an explicit multi-timescale representation of the input time series, which we use to isolate information about transients (short duration events) from broader trends. Similar to the work of Lipton et al. (2016) and Che et al. (2018a), our architecture also explicitly leverages a separate information channel related to patterns of observation times. However, our representation uses a semi-parametric intensity function representation of this information that is more closely related to the work of Lasko (2014) on modeling medical event point processes. ", + "bbox": [ + 176, + 871, + 823, + 898 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 160 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our architecture thus produces three output time series for each input time series: a smooth interpolation modeling broad trends in the input, a short time-scale interpolation modeling transients, and an intensity function modeling local observation frequencies. ", + "bbox": [ + 176, + 166, + 823, + 208 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "This work is motivated by problems in the analysis of electronic health records (EHRs) (Marlin et al., 2012; Lipton et al., 2016; Futoma et al., 2017; Che et al., 2018a). It remains rare for hospital systems to capture dense physiological data streams. Instead, it is common for the physiological time series data in electronic health records to be both sparse and irregularly sampled. The additional issue of the lack of alignment in the observation times across physiological variables is also very common. ", + "bbox": [ + 174, + 215, + 825, + 285 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We evaluate the proposed architecture on two datasets for both classification and regression tasks. Our approach outperforms a variety of simple baseline models as well as the basic and advanced GRU models introduced by Che et al. (2018a) across several metrics. We also compare our model with to the Gaussian process adapter (Li & Marlin, 2016) and multi-task Gaussian process RNN classifier (Futoma et al., 2017). Further, we perform full ablation testing of the information channels our architecture can produce to assess their impact on classification and regression performance. ", + "bbox": [ + 174, + 292, + 825, + 376 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 405, + 344, + 421 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The problem of interest in this work is learning supervised machine learning models from sparse and irregularly sampled multivariate time series. As described in the introduction, a sparse and irregularly sampled time series is a sequence of samples with large and irregular intervals between their observation times. ", + "bbox": [ + 174, + 443, + 825, + 498 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Such data commonly occur in electronic health records, where they can represent a significant problem for both supervised and unsupervised learning methods (Yadav et al., 2018). Sparse and irregularly sampled time series data also occur in a range of other areas with similarly complex observation processes including climate science (Schulz & Stattegger, 1997), ecology (Clark & Bjørnstad, 2004), biology (Ruf, 1999), and astronomy (Scargle, 1982). ", + "bbox": [ + 174, + 506, + 823, + 575 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "A closely related (but distinct) problem is performing supervised learning in the presence of missing data (Batista & Monard, 2003). The primary difference is that the missing data problem is generally defined with respect to a fixed-dimensional feature space (Little & Rubin, 2014). In the irregularly sampled time series problem, observations typically occur in continuous time and there may be no notion of a “normal” or “expected” sampling frequency for some domains. ", + "bbox": [ + 174, + 582, + 823, + 652 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Methods for dealing with missing data in supervised learning include the pre-application of imputation methods (Sterne et al., 2009), and learning joint models of features and labels (Williams et al., 2005). Joint models can either be learned generatively to optimize the joint likelihood of features and labels, or discriminately to optimize the conditional likelihood of the labels. The problem of irregular sampling can be converted to a missing data problem by discretizing the time axis into non-overlapping intervals. Intervals with no observations are then said to contain missing values. ", + "bbox": [ + 174, + 659, + 825, + 742 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "This is the approach taken to deal with irregular sampling by Marlin et al. (2012) as well as Lipton et al. (2016). This approach forces a choice of discretization interval length. When the intervals are long, there will be less missing data, but there can also be multiple observations in the same interval, which must be accounted for using ad-hoc methods. When the intervals are shorter, most intervals will contain at most one value, but many intervals may be empty. Learning is generally harder as the amount of missing data increases, so choosing a discretization interval length must be dealt with as a hyper-parameter of such a method. ", + "bbox": [ + 174, + 750, + 825, + 847 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "One important feature of missing data problems is the potential for the sequence of observation times to itself be informative (Little & Rubin, 2014). Since the set of missing data indicators is always observed, this information is typically easy to condition on. This technique has been used successfully to improve models in the domain of recommender systems (Salakhutdinov et al., 2007). It was also used by Lipton et al. (2016) to improve performance of their GRU model. ", + "bbox": [ + 174, + 854, + 823, + 924 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The alternative to pre-discretizing irregularly sampled time series to convert the problem of irregular sampling into the problem of missing data is to construct models with the ability to directly use an irregularly sampled time series as input. The machine learning and statistics literature include several models with this ability. In the probabilistic setting, Gaussian process models have the ability to represent continuous time data via the use of mean and covariance functions (Rasmussen, 2006). These models have non-probabilistic analogues that are similarly defined in terms of kernels. ", + "bbox": [ + 174, + 103, + 823, + 186 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "For example, Lu et al. (2008) present a kernel-based method that can be used to produce a similarity function between two irregularly sampled time series. Li & Marlin (2015) subsequently provided a generalization of this approach to the case of kernels between Gaussian process models. Li & Marlin (2016) showed how the re-parameterization trick (Kingma et al., 2015) could be used to extend these ideas to enable end-to-end training of a deep neural network model (feed-forward, convolutional, or recurrent) stacked on top of a Gaussian process layer. While the basic model of Li & Marlin (2016) was only applied to univariate time series, in follow-up work the model was extended to multivariate time series using a multi-output Gaussian process regression model (Futoma et al., 2017). However, modeling multivariate time series within this framework is quite challenging due to the constraints on the covariance function used in the GP layer. Futoma et al. (2017) deal with this problem using a sum of separable kernel functions (Bonilla et al., 2008), which limit the expressiveness of the model. ", + "bbox": [ + 174, + 194, + 825, + 347 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "An important property of the above models is that they allow for incorporating all of the information from all available time points into a global interpolation model. Variants differ in terms of whether they only leverage the posterior mean when the final supervised problem is solved, or whether the whole posterior is used. A separate line of work has looked at the use of more local interpolation methods while still operating directly over continuous time inputs. ", + "bbox": [ + 174, + 354, + 825, + 424 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "For example, Che et al. (2018a) presented several methods based on gated recurrent unit (GRU) networks (Chung et al., 2014) combined with simple imputation methods including mean imputation and forward filling with past values. Che et al. (2018a) additionally considered an approach that takes as input a sequence consisting of both the observed values and the timestamps at which those values were observed. The previously observed input value is decayed over time toward the overall mean. In another variant the hidden states are similarly decayed toward zero. Yoon et al. (2017) presented another similar approach based on multi-directional RNN which operate across streams in addition to within streams. However, these models are limited to using global information about the structure of the time series via its empirical mean value, and current or past information about observed values. The global structure of the time series is not directly taken into account. ", + "bbox": [ + 174, + 431, + 825, + 570 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Che et al. (2018b) focus on a similar problem of modeling multi-rate multivariate time series data. This is similar to the problem of interest in that the observations across time series can be unaligned. The difference is that the observations in each time series are uniformly spaced, which is a simpler case. In the case of missing data, they use forward or linear interpolation, which again does not capture the global structure of time series. Similarly, Binkowski et al. (2018) presented an autoregressive framework for regression tasks with irregularly sampled time series data. It is not clear how it can be extended for classification. ", + "bbox": [ + 174, + 577, + 823, + 674 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "The model proposed in this work is similar to that of Li & Marlin (2016) and Futoma et al. (2017) in the sense that it consists of global interpolation layers. The primary difference is that these prior approaches used Gaussian process representations within the interpolation layers. The resulting computations can be expensive and, as noted, the design of covariance functions in the multivariate case can be challenging. By contrast, our proposed model uses semi-parametric, deterministic, feed-forward interpolation layers. These layers do not encode uncertainty, but they do allow for very flexible interpolation both within and across layers. ", + "bbox": [ + 174, + 680, + 825, + 779 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Also similar to Li & Marlin (2016) and Futoma et al. (2017), the interpolation layers in our architecture produce regularly sampled interpolants that can serve as inputs for arbitrary, unmodified, deep classification and regression networks. This is in contrast to the approach of Che et al. (2018a), where a recurrent network architecture was directly modified, reducing the modularity of the approach. Finally, similar to Lipton et al. (2016), our model includes information about the times at which observations occur. However, instead of pre-discretizing the inputs and viewing this information in terms of a binary observation mask or set of missing data indicators, we directly model the sequence of observation events as a point process in continuous time using a semi-parametric intensity function (Lasko, 2014). ", + "bbox": [ + 174, + 785, + 825, + 911 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/89f8aa1252eaf18bd0408dbfb937d5324ab23247418c862e99a4d92c1223d6e2.jpg", + "image_caption": [ + "Figure 1: Architecture of the proposed model " + ], + "image_footnote": [], + "bbox": [ + 184, + 109, + 816, + 236 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 MODEL FRAMEWORK ", + "text_level": 1, + "bbox": [ + 176, + 292, + 387, + 309 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, we present the proposed modeling framework. We begin by presenting notation, followed by the model architecture and learning criteria. ", + "bbox": [ + 173, + 324, + 823, + 353 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 NOTATION ", + "text_level": 1, + "bbox": [ + 174, + 369, + 287, + 383 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We let $\\mathcal { D } = \\{ ( \\mathbf { s } _ { n } , y _ { n } ) | n = 1 , . . . , N \\}$ represent a data set containing $N$ data cases. An individual data case consists of a single target value $y _ { n }$ (discrete for classification and real-valued in the case of regression), as well as a $D$ -dimensional, sparse and irregularly sampled multivariate time series ${ \\bf s } _ { n }$ . Different dimensions $d$ of the multivariate time series can have observations at different times, as well as different total numbers of observations $L _ { d n }$ . Thus, we represent time series $d$ for data case $n$ as a tuple $\\mathbf { s } _ { d n } = ( \\mathbf { t } _ { d n } , \\mathbf { x } _ { d n } )$ where $\\mathbf t _ { d n } = [ t _ { 1 d n } , . . . , t _ { L _ { d n } d n } ]$ is the list of time points at which observations are defined and $\\mathbf { x } _ { d n } = [ x _ { 1 d n } , . . . , x _ { L _ { d n } d n } ]$ is the corresponding list of observed values. ", + "bbox": [ + 174, + 395, + 825, + 494 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 MODEL ARCHITECTURE ", + "text_level": 1, + "bbox": [ + 176, + 510, + 383, + 523 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The overall model architecture consists of two main components: an interpolation network and a prediction network. The interpolation network interpolates the multivariate, sparse, and irregularly sampled input time series against a set of reference time points $\\mathbf { r } = [ r _ { 1 } , . . . , r _ { T } ]$ . We assume that all of the time series are defined within a common time interval (for example, the first 24 or 48 hours after admission for MIMIC-III dataset). The $T$ reference time points $r _ { t }$ are chosen to be evenly spaced within that interval. In this work, we propose a two-layer interpolation network with each layer performing a different type of interpolation. ", + "bbox": [ + 174, + 536, + 825, + 633 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The second component, the prediction network, takes the output of the interpolation network as its input and produces a prediction ${ \\hat { y } } _ { n }$ for the target variable. The prediction network can consist of any standard supervised neural network architecture (fully-connected feedforward, convolutional, recurrent, etc). Thus, the architecture is fully modular with respect to the use of different prediction networks. In order to train the interpolation network, the architecture also includes an auto-encoding component to provide an unsupervised learning signal in addition to the supervised learning signal from the prediction network. Figure 1 shows the architecture of the proposed model. We describe the components of the model in detail below. ", + "bbox": [ + 174, + 640, + 825, + 752 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2.1 INTERPOLATION NETWORK ", + "text_level": 1, + "bbox": [ + 176, + 766, + 418, + 781 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We begin by describing the interpolation network. The goal of the interpolation network is to provide a collection of interpolants of each of the $D$ dimensions of an input multivariate time series defined at the $T$ reference time points $\\mathbf { r } = [ r _ { 1 } , . . . , r _ { T } ]$ . In this work, we use a total of $C = 3$ outputs for each of the $D$ input time series. The three outputs (discussed in detail below) capture smooth trends, transients, and observation intensity information. We define $f _ { \\boldsymbol { \\theta } } ( { \\bf r } , { \\bf s } _ { n } )$ to be the function computing the output $\\hat { \\mathbf { s } } _ { n }$ of the interpolation network. The output $\\hat { \\mathbf { s } } _ { n }$ is a fixed-sized array with dimensions $( D C ) \\times T$ for all inputs ${ \\bf s } _ { n }$ . ", + "bbox": [ + 174, + 790, + 825, + 890 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The first layer in the interpolation network separately performs three semi-parametric univariate transformations for each of the $D$ time series. Each transformation is based on a radial basis function (RBF) network to accommodate continuous time observations. The transformations are a low-pass (or smooth) interpolation $\\pmb { \\sigma } _ { d }$ , a high-pass (or non-smooth) interpolation $\\gamma _ { d }$ and an intensity function $\\lambda _ { d }$ . These transformations are computed at reference time point $r _ { k }$ for each data case and each input time series $d$ as shown in Equations 1, 2, 3 and 4.2 The smooth interpolation $\\sigma _ { d }$ uses a squared exponential kernel with parameter $\\alpha _ { d }$ , while the non-smooth interpolation $\\gamma _ { d }$ uses a squared exponential kernel with parameter $\\kappa \\alpha _ { d }$ for $\\kappa > 1$ . ", + "bbox": [ + 174, + 895, + 823, + 924 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 188 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/7435c3378433e9749f5f65c0838309d7a931938dce2e305e55332b1ffa1c44d6.jpg", + "text": "$$\n\\begin{array} { l } { \\displaystyle { Z ( r , \\mathbf { t } , \\alpha ) = \\sum _ { t \\in \\mathbf { t } } w ( r , t , \\alpha ) , \\quad w ( r , t , \\alpha ) = \\exp ( - \\alpha ( r - t ) ^ { 2 } ) } } \\\\ { \\displaystyle { \\ } \\lambda _ { k d } = h _ { \\theta } ^ { \\lambda } ( r _ { k } , \\mathbf { t } _ { d } , \\mathbf { x } _ { d } ) = Z ( r _ { k } , \\mathbf { t } _ { d } , \\alpha _ { d } ) } \\\\ { \\displaystyle { \\ \\sigma _ { k d } = h _ { \\theta } ^ { \\sigma } ( r _ { k } , \\mathbf { t } _ { d } , \\mathbf { x } _ { d } ) = \\frac { 1 } { Z ( r _ { k } , \\mathbf { t } _ { d } , \\alpha _ { d } ) } \\sum _ { j = 1 } ^ { L _ { d n } } w ( r _ { k } , t _ { j d } , \\alpha _ { d } ) x _ { j d } } } \\\\ { \\displaystyle { \\ } \\gamma _ { k d } = h _ { \\theta } ^ { \\gamma } ( r _ { k } , \\mathbf { t } _ { d } , \\mathbf { x } _ { d } ) = \\frac { 1 } { Z ( r _ { k } , \\mathbf { t } _ { d } , \\kappa \\alpha _ { d } ) } \\sum _ { j = 1 } ^ { L _ { d n } } w ( r _ { k } , t _ { j d } , \\kappa \\alpha _ { d } ) x _ { j d } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 267, + 209, + 732, + 357 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The second interpolation layer merges information across all $D$ time series at each reference time point by taking into account learnable correlations $\\rho _ { d d ^ { \\prime } }$ across all time series. This results in a crossdimension interpolation $x d$ for each input dimension $d$ . We further define a transient component $\\tau _ { d }$ for each input dimension $d$ as the difference between the high-pass (or non-smooth) interpolation $\\gamma _ { d }$ from the first layer and the smooth cross-dimension interpolation $x d$ , as shown in Equation 5. ", + "bbox": [ + 174, + 371, + 825, + 441 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/5bb932ca482d0e23ded86df558f0352d32978a2b66fe68adb70a568a81716423.jpg", + "text": "$$\n\\chi _ { k d } = h _ { \\theta } ^ { \\chi } ( r _ { k } , \\mathbf { s } ) = \\frac { \\sum _ { d ^ { \\prime } } \\rho _ { d d ^ { \\prime } } \\lambda _ { k d ^ { \\prime } } \\sigma _ { k d ^ { \\prime } } } { \\sum _ { d ^ { \\prime } } \\lambda _ { k d ^ { \\prime } } } , \\qquad \\quad \\tau _ { k d } = h _ { \\theta } ^ { \\tau } ( r _ { k } , \\mathbf { s } ) = \\gamma _ { k d } - \\chi _ { k d } .\n$$", + "text_format": "latex", + "bbox": [ + 235, + 463, + 761, + 500 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In the experiments presented in the next section, we use a total of three interpolation network outputs per dimension $d$ as the input to the prediction network. We use the smooth, cross-channel interpolants $x d$ to capture smooth trends, the transient components $\\tau _ { d }$ to capture transients, and the intensity functions $\\lambda _ { d }$ to capture information about where observations occur in time. ", + "bbox": [ + 176, + 513, + 823, + 570 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2.2 PREDICTION NETWORK ", + "text_level": 1, + "bbox": [ + 176, + 587, + 393, + 601 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Following the application of the interpolation network, all $D$ dimensions of the input multivariate time series have been re-represented in terms of $C$ outputs defined on the regularly spaced set of reference time points $r _ { 1 } , . . . , r _ { T }$ (in our experiments, we use $C = 3$ as described above). Again, we refer to the complete set of interpolation network outputs as $\\hat { \\mathbf { s } } _ { n } ~ = ~ f _ { \\theta } ( \\mathbf { r } , \\mathbf { s } _ { n } )$ , which can be represented as a matrix of size $( D C ) \\times T$ . ", + "bbox": [ + 174, + 611, + 825, + 681 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The prediction network must take $\\hat { \\mathbf { s } } _ { n }$ as input and output a prediction $\\hat { y } _ { n } = g _ { \\phi } ( \\hat { \\mathbf { s } } _ { n } ) = g _ { \\phi } ( f _ { \\theta } ( \\mathbf { r } , \\mathbf { s } _ { n } ) )$ of the target value $y _ { n }$ for data case $n$ . There are many possible choices for this component of the model. For example, the matrix $\\hat { \\mathbf { s } } _ { n }$ can be converted into a single long vector and provided as input to a standard multi-layer feedforward network. A temporal convolutional model or a recurrent model like a GRU or LSTM can instead be applied to time slices of the matrix $\\hat { \\mathbf { s } } _ { n }$ . In this work, we conduct experiments leveraging a GRU network as the prediction network. ", + "bbox": [ + 173, + 688, + 825, + 772 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2.3 LEARNING ", + "text_level": 1, + "bbox": [ + 176, + 787, + 303, + 803 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To learn the model parameters, we use a composite objective function consisting of a supervised component and an unsupervised component. This is due to the fact that the supervised component alone is insufficient to learn reasonable parameters for the interpolation network parameters given the amount of available training data. The unsupervised component used corresponds to an autoencoder-like loss function. However, the semi-parametric RBF interpolation layers have the ability to exactly fit the input points by setting the RBF kernel parameters to very large values. ", + "bbox": [ + 174, + 813, + 825, + 897 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "To avoid this solution and force the interpolation layers to learn to properly interpolate the input data, it is necessary to hold out some observed data points $x _ { j d n }$ during learning and then to compute the reconstruction loss only for these data points. This is a well-known problem with high-capacity autoencoders, and past work has used similar strategies to avoid the problem of trivially memorizing the input data without learning useful structure. ", + "bbox": [ + 174, + 103, + 825, + 174 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To implement the autoencoder component of the loss, we introduce a set of masking variables $m _ { j d n }$ for each data point $\\left( t _ { j d n } , x _ { j d n } \\right)$ . If $m _ { j d n } = 1$ , then we remove the data point $\\left( t _ { j d n } , x _ { j d n } \\right)$ as an input to the interpolation network, and include the predicted value of this time point when assessing the autoencoder loss. We use the shorthand notation $\\mathbf { m } _ { n } \\odot \\mathbf { s } _ { n }$ to represent the subset of values of ${ \\bf s } _ { n }$ that are masked out, and $\\left( 1 - \\mathbf { m } _ { n } \\right) \\odot \\mathbf { s } _ { n }$ to represent the subset of values of ${ \\bf s } _ { n }$ that are not masked out. The value $\\hat { x } _ { j d n }$ that we predict for a masked input at time point $t _ { j d n }$ is the value of the smooth cross-channel interpolant at that time point, calculated based on the un-masked input values: $\\hat { x } _ { j d n } = h _ { \\theta } ^ { \\chi } ( t _ { j d n } , ( 1 - \\mathbf { m } _ { n } ) ^ { \\top } \\odot \\mathbf { s } _ { n } )$ . ", + "bbox": [ + 173, + 180, + 825, + 292 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We can now define the learning objective for the proposed framework. We let $\\ell _ { P }$ be the loss for the prediction network (we use cross-entropy loss for classification and squared error for regression). We let $\\ell _ { I }$ be the interpolation network autoencoder loss (we use standard squared error). We also include $\\ell _ { 2 }$ regularizers for both the interpolation and prediction networks parameters. $\\delta _ { I } , \\delta _ { P }$ , and $\\delta _ { R }$ are hyper-parameters that control the trade-off between the components of the objective function. ", + "bbox": [ + 174, + 297, + 825, + 368 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/0bded8114a28645cd5e2f286dabee0f57f4e7a32e24bee09abeb980dfa25ae38.jpg", + "text": "$$\n\\begin{array} { r l r } { { \\theta _ { * } , \\phi _ { * } = \\arg \\operatorname* { m i n } _ { \\theta , \\phi } \\sum _ { n = 1 } ^ { N } \\ell _ { P } \\big ( y _ { n } , g _ { \\phi } \\big ( f _ { \\theta } ( \\mathbf { s } _ { n } ) \\big ) + \\delta _ { I } \\| \\theta \\| _ { 2 } ^ { 2 } + \\delta _ { P } \\| \\phi \\| _ { 2 } ^ { 2 } } } \\\\ & { } & { + \\delta _ { R } \\sum _ { n = 1 } ^ { N } \\sum _ { d = 1 } ^ { D } \\sum _ { j = 1 } ^ { L _ { d n } } m _ { j d n } \\ell _ { I } \\big ( x _ { j d n } , h _ { \\theta } ^ { \\chi } \\big ( t _ { j d n } , \\big ( 1 - \\mathbf { m } _ { n } \\big ) \\odot \\mathbf { s } _ { n } \\big ) \\big ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 254, + 376, + 741, + 467 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4 EXPERIMENTS AND RESULTS ", + "text_level": 1, + "bbox": [ + 176, + 482, + 447, + 497 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "In this section, we present experiments based on both classification and regression tasks with sparse and irregularly sampled multivariate time series. In both cases, the input to the prediction network is a sparse and irregularly sampled time series, and the output is a single scalar representing either the predicted class or the regression target variable. We test the model framework on two publicly available real-world datasets: MIMIC-III 3 − a multivariate time series dataset consisting of sparse and irregularly sampled physiological signals collected at Beth Israel Deaconess Medical Center from 2001 to 2012 (Johnson et al., 2016), and UWaveGesture 4 − a univariate time series data set consisting of simple gesture patterns divided into eight categories (Liu et al., 2009). Details of each dataset can be found in the Appendix A.1. We use the MIMIC-III mortality and length of stay prediction tasks as example classification and regression tasks with multivariate time series. We use the UWave gesture classification task for assessing training time and performance relative to univariate baseline models. ", + "bbox": [ + 174, + 512, + 825, + 679 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1 BASELINE MODELS", + "text_level": 1, + "bbox": [ + 176, + 698, + 351, + 712 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We compare our proposed model to a number of baseline approaches including off-the-shelf classification and regression models learned using basic features, as well as more recent approaches based on customized neural network models. ", + "bbox": [ + 176, + 724, + 825, + 766 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.1.1 NON-NEURAL NETWORK BASELINES", + "text_level": 1, + "bbox": [ + 176, + 782, + 488, + 796 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "For non-neural network baselines, we evaluate Logistic Regression (Hosmer Jr et al., 2013), Support Vector Machines (SVM) (Cortes & Vapnik, 1995), Random Forests (RF) (Breiman, 2001) and AdaBoost (Freund & Schapire, 1997) for the classification task. ", + "bbox": [ + 176, + 808, + 826, + 849 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "For the length of stay prediction task, we apply Linear Regression (Hastie et al., 2001), Support Vector Regression (SVR), AdaBoost Regression (Drucker, 1997) and Random Forest Regression. ", + "bbox": [ + 176, + 856, + 823, + 885 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Standard instances of all of these models require fixed-size feature representations. We use temporal discretization with forward filling to create fixed-size representation in case of missing data and use this representation as feature set for non-neural network baselines. ", + "bbox": [ + 176, + 103, + 823, + 145 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1.2 NEURAL NETWORK MODELS ", + "text_level": 1, + "bbox": [ + 176, + 160, + 429, + 174 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We compare to several existing deep learning baselines built on GRUs using simple interpolation or imputation approaches. In addition, we compare to current state-of-the-art models for mortality prediction including the work of Che et al. (2018a). Their work proposed to handle irregularly sampled and missing data using recurrent neural networks (RNNs) by introducing temporal decays in the input and/or hidden layers. We also evaluate the scalable end-to-end Gaussian process adapter (Li & Marlin, 2016) as well as multi-task Gaussian process RNN classifier (Futoma et al., 2017) for irregularly sampled univariate and multivariate time series classification respectively. This work is discussed in detail in Section 2. The complete set of models that we compare to is as follows: ", + "bbox": [ + 174, + 184, + 825, + 296 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "• GP-GRU: End-to-end Gaussian process with GRU as classifier. GRU-M: Missing observations replaced with the global mean of the variable across the training examples. GRU-F: Missing values set to last observed measurement within that time series (referred to as forward filling). GRU-S: Missing values replaced with the global mean. Input is concatenated with masking variable and time interval indicating how long the particular variable is missing. GRU-D: In order to capture richer information, decay is introduced in the input as well as hidden layer of a GRU. Instead of replacing missing values with the last measurement, missing values are decayed over time towards the empirical mean. \n• GRU-HD: A variation of GRU-D where decay in only introduced in the hidden layer. ", + "bbox": [ + 215, + 306, + 825, + 478 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 RESULTS ", + "text_level": 1, + "bbox": [ + 174, + 493, + 279, + 507 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In this section, we present the results of the classification and regression experiments, as well as the results of ablation testing of the internal structure of the interpolation network for the proposed model. We use the UWaveGesture dataset to assess the training time and classification performance relative to the baseline models. We use the standard train and test sets (details are given in appendix A.1). We report the training time taken for convergence along with accuracy on test set. ", + "bbox": [ + 174, + 518, + 825, + 589 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For MIMIC-III, we create our own dataset (appendix A.1) and report the results of a 5-fold cross validation experiment in terms of the average area under the ROC curve (AUC score), average area under the precision-recall curve (AUPRC score), and average cross-entropy loss for the classification task. For the regression task, we use average median absolute error and average fraction of explained variation (EV) as metrics. We also report the standard deviation over cross validation folds for all metrics. ", + "bbox": [ + 174, + 595, + 825, + 679 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Training and implementation details can be found in appendix A.2. Figure 2 shows the classification performance on the UWaveGesture dataset. The proposed model and the Gaussian process adapter (Li & Marlin, 2016) significantly outperform the rest of the baselines. However, the proposed model achieves similar performance to the Gaussian process adapter, but with a $5 0 \\mathrm { x }$ speed up (note the log scale on the training time axis). On the other hand, the training time of the proposed model is approximately the same order as other GRU-based models, but it achieves much better accuracy. ", + "bbox": [ + 174, + 686, + 825, + 770 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Table 1 compares the predictive performance of the mortality and length of stay prediction task on MIMIC-III. We note that in highly skewed datasets as is the case of MIMIC-III, AUPRC (Davis & Goadrich, 2006) can give better insights about the classification performance as compared to AUC score. The proposed model consistently achieves the best average score over all the metrics. We note that a paired t-test indicates that the proposed model results in statistically significant improvements over all baseline models $\\mathit { p } < 0 . 0 1 )$ with respect to all the metrics except median absolute error. The version of the proposed model used in this experiment includes all three interpolation network outputs (smooth interpolation, transients, and intensity function). ", + "bbox": [ + 174, + 776, + 825, + 888 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "An ablation study shows that the results on the regression task can be further improved by using only two outputs (transients, and intensity function), achieving statistically significant improvements over all the baselines. Results for the ablation study are given in Appendix A.3. Finally, we compare the proposed model with multiple baselines on a previous MIMIC-III benchmark dataset (Harutyunyan et al., 2017), which uses a reduced number of cohorts as compared to the one used in our experiments. Appendix A.4 shows the results on this benchmark dataset, where our proposed approach again outperforms prior approaches. ", + "bbox": [ + 174, + 895, + 823, + 924 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/5331d46a12cd0f0943254f08b11a5859ab3a993940de5f7fe3cdbdddf41b0801.jpg", + "image_caption": [ + "Figure 2: Classification performance on the UWaveGesture dataset. Models with almost same performance are shown with the same dot e.g. (GRU-M, GRU-F ) and (GRU-D, GRU-HD). " + ], + "image_footnote": [], + "bbox": [ + 308, + 103, + 687, + 300 + ], + "page_idx": 7 + }, + { + "type": "table", + "img_path": "images/4a1432a6595df7aaabc59766c0d5b12ab4e22a9a6c30617ff0e2074aa8ca4a1c.jpg", + "table_caption": [ + "Table 1: Performance on Mortality (classification) and Length of stay prediction (regression) tasks on MIMIC-III. Loss: Cross-Entropy Loss, MedAE: Median Absolute Error (in days), EV: Explained variance " + ], + "table_footnote": [], + "table_body": "
ModelClassificationRegression
AUCAUPRCLossMedAEEV score
Log/LinReg0.772 ± 0.0130.303 ±0.0180.240±0.0033.528 ± 0.0720.043 ± 0.012
SVM0.671 ± 0.0050.300 ± 0.0110.260±0.0023.523 ± 0.0710.042 ± 0.011
AdaBoost0.829 ±0.0070.345 ± 0.0070.663 ±0.0004.517 ± 0.2340.100 ±0.012
RF0.826 ±0.0080.356 ± 0.0100.315 ± 0.0253.113 ± 0.1250.117 ±0.035
GRU-M0.831± 0.0070.376 ± 0.0220.220±0.0043.140 ± 0.1960.131 ± 0.044
GRU-F0.821 ± 0.0070.360 ± 0.0130.224±0.0033.064±0.2470.126 ± 0.025
GRU-S0.843±0.0070.376 ± 0.0140.218 ± 0.0052.900±0.1290.161 ± 0.025
GRU-D0.835 ± 0.0130.359 ± 0.0250.225 ±0.0092.891±0.1030.146 ± 0.051
GRU-HD0.845 ± 0.0060.390 ± 0.0100.215 ±0.0042.893±0.1550.158 ± 0.037
GP-GRU0.847 ± 0.0070.377 ± 0.0170.215 ± 0.0042.847 ± 0.0790.217 ±0.020
Proposed0.853 ±0.0070.418 ± 0.0220.210±0.0042.862±0.1660.245 ± 0.019
", + "bbox": [ + 173, + 426, + 846, + 613 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 651, + 825, + 720 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5 DISCUSSION AND CONCLUSIONS ", + "text_level": 1, + "bbox": [ + 176, + 748, + 478, + 765 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this paper, we have presented a new framework for dealing with the problem of supervised learning in the presence of sparse and irregularly sampled time series. The proposed framework is fully modular. It uses an interpolation network to accommodate the complexity that results from using sparse and irregularly sampled data as supervised learning inputs, followed by the application of a prediction network that operates over the regularly spaced and fully observed, multi-channel output provided by the interpolation network. The proposed approach also addresses some difficulties with prior approaches including the complexity of the Gaussian process interpolation layers used in (Li & Marlin, 2016; Futoma et al., 2017), and the lack of modularity in the approach of Che et al. (2018a). Our framework also introduces novel elements including the use of semi-parametric, feed-forward interpolation layers, and the decomposition of an irregularly sampled input time series into multiple distinct information channels. Our results show statistically significant improvements for both classification and regression tasks over a range of baseline and state-of-the-art methods. ", + "bbox": [ + 174, + 784, + 825, + 924 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "ACKNOWLEDGEMENTS ", + "text_level": 1, + "bbox": [ + 176, + 155, + 367, + 170 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "This work was supported by the National Science Foundation under Grant No. IIS-1350522. ", + "bbox": [ + 171, + 185, + 777, + 200 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 222, + 287, + 238 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Gustavo EAPA Batista and Maria Carolina Monard. An analysis of four missing data treatment methods for supervised learning. Applied artificial intelligence, 17(5-6):519–533, 2003. ", + "bbox": [ + 174, + 246, + 823, + 276 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Mikolaj Binkowski, Gautier Marti, and Philippe Donnat. Autoregressive convolutional neural networks for asynchronous time series. 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. 580–589, Stockholmsmassan, Stockholm Sweden, 10–15 Jul 2018. ¨ PMLR. URL http://proceedings.mlr.press/v80/binkowski18a.html. ", + "bbox": [ + 173, + 286, + 825, + 357 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Edwin V Bonilla, Kian M Chai, and Christopher Williams. Multi-task gaussian process prediction. In Advances in neural information processing systems, pp. 153–160, 2008. ", + "bbox": [ + 171, + 368, + 821, + 397 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Leo Breiman. Random forests. Mach. Learn., 45(1):5–32, October 2001. ISSN 0885-6125. doi: 10.1023/A:1010933404324. URL https://doi.org/10.1023/A:1010933404324. ", + "bbox": [ + 176, + 407, + 821, + 438 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Zhengping Che, Sanjay Purushotham, Kyunghyun Cho, David Sontag, and Yan Liu. Recurrent neural networks for multivariate time series with missing values. Scientific Reports, 8(1):6085, 2018a. URL https://doi.org/10.1038/s41598-018-24271-9. ", + "bbox": [ + 173, + 448, + 825, + 491 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Zhengping Che, Sanjay Purushotham, Guangyu Li, Bo Jiang, and Yan Liu. Hierarchical deep generative models for multi-rate multivariate time series. 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. 784–793, Stockholmsmassan, Stockholm Sweden, 10–15 ¨ Jul 2018b. PMLR. URL http://proceedings.mlr.press/v80/che18a.html. ", + "bbox": [ + 173, + 502, + 825, + 573 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Junyoung Chung, C¸ aglar G ˘ ulc¸ehre, Kyunghyun Cho, and Yoshua Bengio. Empirical evaluation ¨ of gated recurrent neural networks on sequence modeling. arXiv e-prints, abs/1412.3555, 2014. URL https://arxiv.org/abs/1412.3555. Presented at the Deep Learning workshop at NIPS2014. ", + "bbox": [ + 173, + 583, + 825, + 640 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "J.S. Clark and O.N. Bjørnstad. Population time series: process variability, observation errors, missing values, lags, and hidden states. Ecology, 85(11):3140–3150, 2004. ", + "bbox": [ + 168, + 651, + 823, + 681 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Corinna Cortes and Vladimir Vapnik. Support-vector networks. Machine Learning, 20(3):273– 297, Sep 1995. ISSN 1573-0565. doi: 10.1007/BF00994018. URL https://doi.org/10. 1007/BF00994018. ", + "bbox": [ + 173, + 691, + 823, + 734 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Jesse Davis and Mark Goadrich. The relationship between precision-recall and roc curves. In Proceedings of the 23rd International Conference on Machine Learning, ICML ’06, pp. 233– 240, New York, NY, USA, 2006. ACM. ISBN 1-59593-383-2. doi: 10.1145/1143844.1143874. URL http://doi.acm.org/10.1145/1143844.1143874. ", + "bbox": [ + 173, + 746, + 825, + 803 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Harris Drucker. Improving regressors using boosting techniques. In Proceedings of the Fourteenth International Conference on Machine Learning, ICML ’97, pp. 107–115, San Francisco, CA, USA, 1997. Morgan Kaufmann Publishers Inc. ISBN 1-55860-486-3. URL http://dl.acm. org/citation.cfm?id=645526.657132. ", + "bbox": [ + 173, + 814, + 825, + 869 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Yoav Freund and Robert E Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci., 55(1):119–139, August 1997. ISSN 0022-0000. doi: 10.1006/jcss.1997.1504. URL http://dx.doi.org/10.1006/jcss.1997.1504. ", + "bbox": [ + 176, + 882, + 823, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Joseph Futoma, Sanjay Hariharan, and Katherine A. Heller. Learning to detect sepsis with a multitask gaussian process RNN classifier. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, pp. 1174–1182, 2017. URL http://proceedings.mlr.press/v70/futoma17a.html. ", + "bbox": [ + 174, + 103, + 825, + 160 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Hrayr Harutyunyan, Hrant Khachatrian, David Kale, and Aram Galstyan. Multitask learning and benchmarking with clinical time series data. 03 2017. ", + "bbox": [ + 174, + 170, + 821, + 199 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Trevor Hastie, Robert Tibshirani, and Jerome Friedman. The Elements of Statistical Learning. Springer Series in Statistics. Springer New York Inc., New York, NY, USA, 2001. ", + "bbox": [ + 174, + 208, + 820, + 238 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "David W Hosmer Jr, Stanley Lemeshow, and Rodney X Sturdivant. Applied logistic regression, volume 398. John Wiley & Sons, 2013. ", + "bbox": [ + 173, + 247, + 823, + 276 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alistair EW Johnson, Tom J Pollard, Lu Shen, H Lehman Li-wei, Mengling Feng, Mohammad Ghassemi, Benjamin Moody, Peter Szolovits, Leo Anthony Celi, and Roger G Mark. Mimic-iii, a freely accessible critical care database. Scientific data, 3:160035, 2016. ", + "bbox": [ + 174, + 286, + 825, + 330 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Diederik P Kingma, Tim Salimans, and Max Welling. Variational dropout and the local reparameterization trick. arXiv preprint arXiv:1506.02557, 2015. ", + "bbox": [ + 171, + 339, + 821, + 368 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Thomas A Lasko. Efficient inference of gaussian-process-modulated renewal processes with application to medical event data. In Uncertainty in artificial intelligence: proceedings of the... conference. Conference on Uncertainty in Artificial Intelligence, volume 2014, pp. 469. NIH Public Access, 2014. ", + "bbox": [ + 174, + 378, + 825, + 435 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Steven Cheng-Xian Li and Benjamin M Marlin. A scalable end-to-end gaussian process adapter for irregularly sampled time series classification. In Advances In Neural Information Processing Systems, pp. 1804–1812, 2016. ", + "bbox": [ + 174, + 445, + 825, + 488 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Steven Cheng-Xian Li and Benjmain M. Marlin. Classification of sparse and irregularly sampled time series with mixtures of expected Gaussian kernels and random features. In 31st Conference on Uncertainty in Artificial Intelligence, 2015. ", + "bbox": [ + 173, + 497, + 825, + 541 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Zachary C Lipton, David Kale, and Randall Wetzel. Directly modeling missing data in sequences with rnns: Improved classification of clinical time series. In Machine Learning for Healthcare Conference, pp. 253–270, 2016. ", + "bbox": [ + 176, + 550, + 823, + 593 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Roderick JA Little and Donald B Rubin. Statistical analysis with missing data, volume 333. John Wiley & Sons, 2014. ", + "bbox": [ + 173, + 603, + 823, + 632 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jiayang Liu, Zhen Wang, Lin Zhong, Jehan Wickramasuriya, and Venu Vasudevan. uwave: Accelerometer-based personalized gesture recognition and its applications. In Proceedings of the 2009 IEEE International Conference on Pervasive Computing and Communications, PERCOM ’09, pp. 1–9, Washington, DC, USA, 2009. IEEE Computer Society. ISBN temp-isbn. doi: 10.1109/PERCOM.2009.4912759. URL https://doi.org/10.1109/PERCOM.2009. 4912759. ", + "bbox": [ + 173, + 642, + 825, + 726 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Zhengdong Lu, Todd K. Leen, Yonghong Huang, and Deniz Erdogmus. A reproducing kernel hilbert space framework for pairwise time series distances. In Proceedings of the 25th International Conference on Machine Learning, ICML ’08, pp. 624–631, New York, NY, USA, 2008. ACM. ISBN 978-1-60558-205-4. doi: 10.1145/1390156.1390235. URL http://doi.acm.org/ 10.1145/1390156.1390235. ", + "bbox": [ + 173, + 737, + 825, + 808 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Benjamin M. Marlin, David C. Kale, Robinder G. Khemani, and Randall C. Wetzel. Unsupervised pattern discovery in electronic health care data using probabilistic clustering models. In Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium, pp. 389–398, 2012. ", + "bbox": [ + 174, + 818, + 823, + 859 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Carl Edward Rasmussen. Gaussian processes for machine learning. 2006. ", + "bbox": [ + 174, + 871, + 658, + 886 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "T. Ruf. The lomb-scargle periodogram in biological rhythm research: analysis of incomplete and unequally spaced time-series. Biological Rhythm Research, 30(2):178–201, 1999. ", + "bbox": [ + 171, + 895, + 826, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ruslan Salakhutdinov, Andriy Mnih, and Geoffrey Hinton. Restricted boltzmann machines for collaborative filtering. In Proceedings of the 24th international conference on Machine learning, pp. 791–798. ACM, 2007. ", + "bbox": [ + 176, + 103, + 823, + 145 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jeffrey D Scargle. Studies in astronomical time series analysis. ii-statistical aspects of spectral analysis of unevenly spaced data. The Astrophysical Journal, 263:835–853, 1982. ", + "bbox": [ + 173, + 155, + 821, + 184 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "M. Schulz and K. Stattegger. Spectrum: Spectral analysis of unevenly spaced paleoclimatic time series. Computers & Geosciences, 23(9):929–945, 1997. ", + "bbox": [ + 169, + 193, + 823, + 220 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jonathan AC Sterne, Ian R White, John B Carlin, Michael Spratt, Patrick Royston, Michael G Kenward, Angela M Wood, and James R Carpenter. Multiple imputation for missing data in epidemiological and clinical research: potential and pitfalls. Bmj, 338:b2393, 2009. ", + "bbox": [ + 176, + 229, + 823, + 272 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "David Williams, Xuejun Liao, Ya Xue, and Lawrence Carin. Incomplete-data classification using logistic regression. In Proceedings of the 22nd International Conference on Machine learning, pp. 972–979. ACM, 2005. ", + "bbox": [ + 176, + 281, + 823, + 324 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Pranjul Yadav, Michael Steinbach, Vipin Kumar, and Gyorgy Simon. Mining electronic health records (ehrs): A survey. ACM Computing Surveys (CSUR), 50(6):85, 2018. ", + "bbox": [ + 174, + 332, + 821, + 362 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Jinsung Yoon, William R. Zame, and Mihaela van der Schaar. Multi-directional recurrent neural networks : A novel method for estimating missing data. 2017. ", + "bbox": [ + 176, + 369, + 820, + 398 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A APPENDIX ", + "text_level": 1, + "bbox": [ + 176, + 425, + 297, + 440 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A.1 DATASET DESCRIPTIONS ", + "text_level": 1, + "bbox": [ + 176, + 457, + 390, + 470 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A.1.1 MIMIC-III DATASET ", + "text_level": 1, + "bbox": [ + 176, + 482, + 380, + 497 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We evaluate our model framework on the publicly available MIMIC-III dataset (Johnson et al., 2016). MIMIC-III is a de-identified dataset collected at Beth Israel Deaconess Medical Center from 2001 to 2012. It consists of approximately 58,000 hospital admission records. This data set contains sparse and irregularly sampled physiological signals, medications, diagnostic codes, inhospital mortality, length of stay and more. We focus on predicting in-hospital mortality and length of stay using the first 48 hours of data. We extracted 12 standard physiological variables from each of the 53,211 records obtained after removing hospital admission records with length of stay less than 48 hours. Table 2 shows the features, sampling rates (per hour) and their missingness information computed using the union of all time stamps that exist in any dimension of the input time series. ", + "bbox": [ + 173, + 507, + 825, + 632 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/54c5054652bddef19a77595d531c471a65b7294db1555aae349cb1379c564e67.jpg", + "table_caption": [ + "Table 2: Features extracted from MIMIC III for our experiments " + ], + "table_footnote": [], + "table_body": "
feature#Missing Sampling Rate
SpO231.35%0.80
HR23.23%0.90
RR59.48%0.48
SBP49.76%0.59
DBP48.73%0.60
Temp83.80%0.19
", + "bbox": [ + 218, + 670, + 485, + 785 + ], + "page_idx": 10 + }, + { + "type": "table", + "img_path": "images/03a09c26685defd7370c1db4745954f2b4858edb4073612a53931957941b1348.jpg", + "table_caption": [], + "table_footnote": [], + "table_body": "
feature#Missing Sampling Rate
TGCS87.94%0.14
CRR95.08%0.06
UO82.47%0.20
FiO294.82%0.06
Glucose91.47%0.10
pH96.25%0.04
", + "bbox": [ + 503, + 670, + 777, + 785 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Prediction Tasks ", + "bbox": [ + 174, + 805, + 284, + 819 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In our experiments, each admission record corresponds to one data case $( \\mathbf { s } _ { \\mathbf { n } } , y _ { n } )$ . Each data case $n$ consists of a sparse and irregularly sampled time series ${ \\bf s } _ { n }$ with $D \\ = \\ 1 2$ dimensions. Each dimension $d$ of ${ \\bf s } _ { n }$ corresponds to one of the 12 vital sign time series mentioned above. In the case of classification, $y _ { n }$ is a binary indicator where $y _ { n } = 1$ indicates that the patient died at any point within the hospital stay following the first 48 hours and $y _ { n } ~ = ~ 0$ indicates that the patient was discharged at any point after the first 48 hours. There are 4310 $( 8 . 1 \\% )$ patients with a $y _ { n } = 1$ mortality label. The complete data set is $\\mathcal { D } = \\{ ( \\mathbf { s _ { n } } , y _ { n } ) | n = 1 , . . . , N \\}$ , and there are $N = 5 3 , 2 1 1$ data cases. The goal in the classification task is to learn a classification function $g$ of the form $\\hat { y } _ { n } \\gets g ( \\mathbf { s } _ { n } )$ where ${ \\hat { y } } _ { n }$ is a discrete value. ", + "bbox": [ + 173, + 827, + 825, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In the case of regression, $y _ { n }$ is a real-valued regression target corresponding to the length of stay. Since the data set includes some very long stay durations, we let $y _ { n }$ represent the log of the length of stay in days for all models. We convert back from the log number of days to the number of days when reporting results. The complete data set is again $\\mathcal { D } = \\{ ( \\mathbf { s _ { n } } , y _ { n } ) | n = 1 , . . . , N \\}$ with $N = 5 3$ , 211 data cases (we again require 48 hours worth of data). The goal in the regression task is to learn a regression function $g$ of the form ${ \\hat { y } } _ { n } \\gets g ( \\mathbf { s } _ { n } )$ where ${ \\hat { y } } _ { n }$ is a continuous value. ", + "bbox": [ + 174, + 138, + 825, + 223 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A.1.2 UWAVE DATASET ", + "text_level": 1, + "bbox": [ + 176, + 242, + 354, + 256 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "UWave dataset is an univariate time series data consisting of simple gesture patterns divided into eight categories. The dataset has been split into 3582 train and 896 test instances. Out of the training data, $30 \\%$ is used for validation. Each time series contains 945 observations. We follow the same data preparation method as in Li & Marlin (2016) where we randomly sample $10 \\%$ of the observations points from each time series to create a sparse and irregularly sampled data. ", + "bbox": [ + 174, + 268, + 825, + 338 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A.2 IMPLEMENTATION DETAILS ", + "text_level": 1, + "bbox": [ + 176, + 359, + 410, + 375 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A.2.1 PROPOSED MODEL ", + "text_level": 1, + "bbox": [ + 176, + 387, + 362, + 401 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The model is learned using the Adam optimization method in TensorFlow with gradients provided via automatic differentiation. However, the actual multivariate time series representation used during learning is based on the union of all time stamps that exist in any dimension of the input time series. Undefined observations are represented as zeros and a separate missing data mask is used to keep track of which time series have observations at each time point. Equations 1 to 5 are modified such that data that are not available are not taken into account at all. This implementation is exactly equivalent to the computations described, but supports parallel computation across all dimensions of the time series for a given data case. ", + "bbox": [ + 174, + 412, + 825, + 525 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Finally, we note that the learning problem can be solved using a doubly stochastic gradient based on the use of mini batches combined with re-sampling the artificial missing data masks used in the interpolation loss. In practice, we randomly select $2 0 \\%$ of the observed data points to hold out from every input time series. ", + "bbox": [ + 174, + 531, + 825, + 587 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "For the time series missing entirely, our interpolation network assigns the starting point (time $\\scriptstyle { \\mathrm { t } } = 0$ ) value of the time series to the global mean before applying the two-layer interpolation network. In such cases, the first interpolation layer just outputs the global mean for that channel, but the second interpolation layer performs a more meaningful interpolation using the learned correlations from other channels. ", + "bbox": [ + 174, + 594, + 825, + 664 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A.2.2 BASELINES", + "text_level": 1, + "bbox": [ + 176, + 684, + 312, + 699 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The Logistic Regression model is trained with cross entropy loss with regularization strength set to 1. The support vector classifier is used with a RBF kernel and trained to minimize the soft margin loss. We use the cross entropy loss on the validation set to select the optimal number of estimators in case of Adaboost and Random Forest. Similar to the classification setting, the optimal number of estimators for regression task in Adaboost and Random Forest is chosen on the basis of squared error on validation set. ", + "bbox": [ + 174, + 710, + 825, + 794 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "MIMIC-III DATASET ", + "text_level": 1, + "bbox": [ + 174, + 814, + 323, + 829 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We evaluate all models using a five-fold cross-validation estimate of generalization performance. In the classification setting, all the deep learning baselines are trained to minimize the cross entropy loss while the proposed model uses a composite loss consisting of cross-entropy loss and interpolation loss (with $\\delta _ { R } = 1 \\mathrm { \\Delta }$ ) as described in section 3.2.3. In the case of the regression task, all baseline models are trained to minimize squared error and the proposed model is again trained with a composite loss consisting of squared error and interpolation loss. ", + "bbox": [ + 174, + 840, + 825, + 924 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "We follow the multi-task Gaussian process implementation given by Futoma et al. (2017) and treat the number of hidden units and hidden layers as hyper-parameters. For all of the GRU-based models, we use the already specified parameters (Che et al., 2018a). The models are learned using the Adam optimization. Early stopping is used on a validation set sub-sampled from the training folds. In the classification case, the final outputs of the GRU hidden units are used in a logistic layer that predicts the class. In the regression case, the final outputs of the GRU hidden units are used as input for a dense hidden layer with 50 units, followed by a linear output layer. ", + "bbox": [ + 174, + 103, + 825, + 202 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "UWAVE DATASET ", + "text_level": 1, + "bbox": [ + 174, + 218, + 297, + 232 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We independently tune the hyper-parameters of each baseline method. For GRU-based methods, hidden units are searched over the range $\\{ 2 ^ { 5 } , 2 ^ { 6 } , \\cdots , 2 ^ { 1 1 } \\}$ . Learning is done in same way as described above. We evaluate all the baseline models on the test set and compare the training time and accuracy. For the Gaussian process model, we use the squared exponential covariance function. We use the same number of inducing points for both the Gaussian process and the proposed model. The Gaussian process model is jointly trained with the GRU using stochastic gradient descent with Nesterov momentum. We apply early stopping based on the validation set. ", + "bbox": [ + 174, + 242, + 825, + 340 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "A.3 ADDITIONAL EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 176, + 358, + 413, + 372 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In this section, we address the question of the relative information content of the different outputs produced by the interpolation network used in the proposed model for MIMIC-III dataset. Recall that for each of the $D = 1 2$ vital sign time series, the interpolation network produces three outputs: a smooth interpolation output (SI), a non-smooth or transient output (T), and an intensity function (I). The above results use all three of these outputs. ", + "bbox": [ + 174, + 385, + 825, + 454 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "To assess the impact of each of the interpolation network outputs, we conduct a set of ablation experiments where we consider using all sub-sets of outputs for both the classification task and for the regression task. ", + "bbox": [ + 174, + 462, + 825, + 503 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Table 3 shows the results from five-fold cross validation mortality and length of stay prediction experiments. When using each output individually, smooth interpolation (SI) provides the best performance in terms of classification. Interestingly, the intensity output is the best single information source for the regression task and provides at least slightly better mean performance than any of the baseline methods shown in Table 1. Also interesting is the fact that the transients output performs significantly worse when used alone than either the smooth interpolation or the intensity outputs in the classification task. ", + "bbox": [ + 174, + 510, + 825, + 608 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/0f161b8f2f2a77599482eb6af2b816710ac9ee5a0d2986e9a3378395ab5982d1.jpg", + "table_caption": [ + "Table 3: Performance of all subsets of the interpolation network outputs on Mortality (classification) and Length of stay prediction (regression) tasks. SI: Smooth Interpolation, I: Intensity, T: Transients, Loss: Cross-Entropy Loss, MedAE: Median Absolute Error, EV: Explained variance " + ], + "table_footnote": [], + "table_body": "
ModelClassificationRegression
AUCAUPRCLossMedAEEV score
SI, T,I0.853 ± 0.0070.418 ± 0.0220.210 ± 0.0042.862 ±0.1660.245 ± 0.019
SI,I0.852 ± 0.0050.408 ± 0.0170.210± 0.0042.745 ±0.0620.224±0.010
SI,T0.820 ±0.0080.355 ± 0.0240.226 ±0.0052.911 ± 0.0730.182 ± 0.009
SI0.816 ±0.0090.354±0.0180.226 ±0.0053.035 ± 0.0630.183 ± 0.016
I0.786 ± 0.0100.250 ±0.0120.241±0.0032.697± 0.0720.251±0.009
I,T0.755 ± 0.0120.236 ± 0.0140.272 ±0.0102.738 ±0.1010.290 ±0.010
T0.705 ± 0.0090.192 ±0.0080.281±0.0042.995±0.1300.207±0.024
", + "bbox": [ + 176, + 679, + 821, + 815 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "When considering combinations of interpolation network components, we can see that the best performance is obtained when all three outputs are used simultaneously in classification tasks. For the regression task, the intensity output provides better performance in terms of median absolute error while a combination of intensity and transients output provide better explained variance score. However, the use of the transients output contributes almost no improvement in the case of the AUC and cross entropy loss for classification relative to using only smooth interpolation and intensity. Interestingly, in the classification case, there is a significant boost in performance by combining smooth interpolation and intensity relative to using either output on its own. In the regression setting, smooth interpolation appears to carry little information. ", + "bbox": [ + 174, + 840, + 823, + 924 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "", + "bbox": [ + 176, + 103, + 823, + 146 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "A.4 BENCHMARK MIMIC-III DATASET ", + "text_level": 1, + "bbox": [ + 178, + 162, + 462, + 176 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "In this section, we compare the performance of the proposed model on a previous MIMIC-III benchmark dataset (Harutyunyan et al., 2017). This dataset only consists of patients with age $> 1 8$ . Again, we focus on predicting in-hospital mortality using the first 48 hours of data. This yields training and test sets of size 17,903 and 3,236 records respectively. ", + "bbox": [ + 176, + 189, + 825, + 244 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "We compare the proposed model to multiple baselines from Harutyunyan et al. (2017). In all the baselines, the sparse and irregularly sampled time-series data has been discretized into 1-hour intervals. If there are multiple observations in an interval, the mean or last observation is assigned to that interval, depending on the baseline method. Similarly, if an interval contains no observations, the mean or forward filling approach is used to assign a value depending on the baseline method. We compare with a logistic regression model and a standard LSTM network. In the multitask setting, multiple tasks are predicted jointly. Unlike the standard LSTM network where the output/hiddenstate from the last time step is used for prediction, we provide supervision to the model at each time step. In this experiment, we use an LSTM as the prediction network in the proposed model to match the baselines. ", + "bbox": [ + 174, + 252, + 825, + 390 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/756f2e21deda4b743440c7ad72dda05a8e156d32e71f5b5a941b733800c3599e.jpg", + "table_caption": [ + "Table 4: Classification performance for in-hospital mortality prediction task on benchmark dataset " + ], + "table_footnote": [], + "table_body": "
ModelAUC scoreAUPRC score
Logistic Regression0.84850.4744
LSTM0.85470.4848
LSTM+ Deep Supervision0.85580.4928
MultitaskLSTM0.86070.4933
Interpolation Network +LSTM0.86100.5370
", + "bbox": [ + 272, + 433, + 725, + 534 + ], + "page_idx": 13 + } +] \ No newline at end of file diff --git a/parse/train/r1efr3C9Ym/r1efr3C9Ym_model.json b/parse/train/r1efr3C9Ym/r1efr3C9Ym_model.json new file mode 100644 index 0000000000000000000000000000000000000000..7d21e1ca6ab07ff17b0f140de58180e4913b8c14 --- /dev/null +++ b/parse/train/r1efr3C9Ym/r1efr3C9Ym_model.json @@ -0,0 +1,16082 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 819, + 1301, + 819, + 1301, + 1156, + 398, + 1156 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1289, + 1403, + 1289, + 1403, + 1534, + 298, + 1534 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1549, + 1403, + 1549, + 1403, + 1701, + 299, + 1701 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1716, + 1403, + 1716, + 1403, + 1902, + 299, + 1902 + ], + "score": 0.974 + }, + { + "category_id": 0, + "poly": [ + 300, + 219, + 1251, + 219, + 1251, + 324, + 300, + 324 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 313, + 375, + 842, + 375, + 842, + 497, + 313, + 497 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 302, + 1917, + 1402, + 1917, + 1402, + 1978, + 302, + 1978 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 313, + 546, + 841, + 546, + 841, + 667, + 313, + 667 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 334, + 2006, + 1284, + 2006, + 1284, + 2034, + 334, + 2034 + ], + "score": 0.902 + }, + { + "category_id": 0, + "poly": [ + 302, + 1218, + 573, + 1218, + 573, + 1254, + 302, + 1254 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 104, + 299, + 104 + ], + "score": 0.875 + }, + { + "category_id": 0, + "poly": [ + 773, + 749, + 927, + 749, + 927, + 782, + 773, + 782 + ], + "score": 0.829 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 857, + 2089, + 857, + 2112, + 841, + 2112 + ], + "score": 0.704 + }, + { + "category_id": 0, + "poly": [ + 314, + 547, + 563, + 547, + 563, + 576, + 314, + 576 + ], + "score": 0.094 + }, + { + "category_id": 13, + "poly": [ + 694, + 2011, + 711, + 2011, + 711, + 2028, + 694, + 2028 + ], + "score": 0.52, + "latex": ":" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 218.0, + 1256.0, + 218.0, + 1256.0, + 269.0, + 294.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 274.0, + 1091.0, + 274.0, + 1091.0, + 326.0, + 294.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 339.0, + 2001.0, + 693.0, + 2001.0, + 693.0, + 2038.0, + 339.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 2001.0, + 1289.0, + 2001.0, + 1289.0, + 2038.0, + 712.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1215.0, + 579.0, + 1215.0, + 579.0, + 1262.0, + 294.0, + 1262.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": [ + 768.0, + 745.0, + 934.0, + 745.0, + 934.0, + 788.0, + 768.0, + 788.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": [ + 312.0, + 544.0, + 565.0, + 544.0, + 565.0, + 583.0, + 312.0, + 583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 822.0, + 1303.0, + 822.0, + 1303.0, + 854.0, + 395.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 849.0, + 1305.0, + 849.0, + 1305.0, + 886.0, + 393.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 881.0, + 1304.0, + 881.0, + 1304.0, + 916.0, + 393.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 913.0, + 1305.0, + 913.0, + 1305.0, + 945.0, + 394.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 943.0, + 1305.0, + 943.0, + 1305.0, + 976.0, + 394.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 974.0, + 1305.0, + 974.0, + 1305.0, + 1006.0, + 394.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1004.0, + 1304.0, + 1004.0, + 1304.0, + 1037.0, + 393.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1034.0, + 1305.0, + 1034.0, + 1305.0, + 1066.0, + 393.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1064.0, + 1304.0, + 1064.0, + 1304.0, + 1097.0, + 394.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1096.0, + 1305.0, + 1096.0, + 1305.0, + 1128.0, + 395.0, + 1128.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1124.0, + 1216.0, + 1124.0, + 1216.0, + 1161.0, + 392.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1288.0, + 1405.0, + 1288.0, + 1405.0, + 1324.0, + 294.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1320.0, + 1405.0, + 1320.0, + 1405.0, + 1354.0, + 294.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1349.0, + 1404.0, + 1349.0, + 1404.0, + 1383.0, + 294.0, + 1383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1382.0, + 1405.0, + 1382.0, + 1405.0, + 1415.0, + 296.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1411.0, + 1405.0, + 1411.0, + 1405.0, + 1445.0, + 294.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1440.0, + 1405.0, + 1440.0, + 1405.0, + 1479.0, + 292.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1471.0, + 1405.0, + 1471.0, + 1405.0, + 1509.0, + 293.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1501.0, + 1227.0, + 1501.0, + 1227.0, + 1539.0, + 295.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1549.0, + 1405.0, + 1549.0, + 1405.0, + 1583.0, + 294.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1578.0, + 1405.0, + 1578.0, + 1405.0, + 1613.0, + 294.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1609.0, + 1405.0, + 1609.0, + 1405.0, + 1645.0, + 293.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1639.0, + 1404.0, + 1639.0, + 1404.0, + 1676.0, + 295.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1670.0, + 1192.0, + 1670.0, + 1192.0, + 1706.0, + 294.0, + 1706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1715.0, + 1407.0, + 1715.0, + 1407.0, + 1752.0, + 294.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1746.0, + 1405.0, + 1746.0, + 1405.0, + 1783.0, + 293.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1780.0, + 1404.0, + 1780.0, + 1404.0, + 1812.0, + 297.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1809.0, + 1405.0, + 1809.0, + 1405.0, + 1843.0, + 294.0, + 1843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1840.0, + 1405.0, + 1840.0, + 1405.0, + 1874.0, + 294.0, + 1874.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1870.0, + 907.0, + 1870.0, + 907.0, + 1905.0, + 294.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 376.0, + 587.0, + 376.0, + 587.0, + 410.0, + 312.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 405.0, + 845.0, + 405.0, + 845.0, + 441.0, + 311.0, + 441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 438.0, + 736.0, + 438.0, + 736.0, + 469.0, + 312.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 470.0, + 668.0, + 470.0, + 668.0, + 500.0, + 314.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 1919.0, + 1403.0, + 1919.0, + 1403.0, + 1950.0, + 299.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1949.0, + 1403.0, + 1949.0, + 1403.0, + 1980.0, + 297.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 546.0, + 565.0, + 546.0, + 565.0, + 577.0, + 312.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 575.0, + 844.0, + 575.0, + 844.0, + 611.0, + 311.0, + 611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 607.0, + 736.0, + 607.0, + 736.0, + 638.0, + 313.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 639.0, + 635.0, + 639.0, + 635.0, + 670.0, + 311.0, + 670.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 645, + 1404, + 645, + 1404, + 829, + 298, + 829 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1650, + 1403, + 1650, + 1403, + 1865, + 298, + 1865 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1452, + 1403, + 1452, + 1403, + 1635, + 299, + 1635 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 476, + 1403, + 476, + 1403, + 630, + 299, + 630 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1881, + 1402, + 1881, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1114, + 1402, + 1114, + 1402, + 1268, + 299, + 1268 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 975, + 1403, + 975, + 1403, + 1098, + 299, + 1098 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1283, + 1402, + 1283, + 1402, + 1437, + 299, + 1437 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1401, + 229, + 1401, + 353, + 299, + 353 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 300, + 368, + 1400, + 368, + 1400, + 461, + 300, + 461 + ], + "score": 0.961 + }, + { + "category_id": 0, + "poly": [ + 300, + 893, + 587, + 893, + 587, + 929, + 300, + 929 + ], + "score": 0.911 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.694 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.15 + }, + { + "category_id": 15, + "poly": [ + 291.0, + 890.0, + 594.0, + 890.0, + 594.0, + 937.0, + 291.0, + 937.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, + 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": [ + 297.0, + 646.0, + 1402.0, + 646.0, + 1402.0, + 677.0, + 297.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 676.0, + 1405.0, + 676.0, + 1405.0, + 712.0, + 294.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 704.0, + 1405.0, + 704.0, + 1405.0, + 741.0, + 293.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 737.0, + 1404.0, + 737.0, + 1404.0, + 773.0, + 296.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 769.0, + 1402.0, + 769.0, + 1402.0, + 800.0, + 296.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 795.0, + 1370.0, + 795.0, + 1370.0, + 836.0, + 291.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1648.0, + 1407.0, + 1648.0, + 1407.0, + 1687.0, + 293.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1681.0, + 1405.0, + 1681.0, + 1405.0, + 1716.0, + 293.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1712.0, + 1404.0, + 1712.0, + 1404.0, + 1746.0, + 294.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1744.0, + 1403.0, + 1744.0, + 1403.0, + 1775.0, + 296.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1773.0, + 1405.0, + 1773.0, + 1405.0, + 1808.0, + 296.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1805.0, + 1404.0, + 1805.0, + 1404.0, + 1836.0, + 296.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1835.0, + 710.0, + 1835.0, + 710.0, + 1867.0, + 293.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1450.0, + 1404.0, + 1450.0, + 1404.0, + 1487.0, + 293.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1482.0, + 1405.0, + 1482.0, + 1405.0, + 1517.0, + 294.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1511.0, + 1407.0, + 1511.0, + 1407.0, + 1549.0, + 294.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1542.0, + 1405.0, + 1542.0, + 1405.0, + 1578.0, + 295.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1575.0, + 1404.0, + 1575.0, + 1404.0, + 1607.0, + 297.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1604.0, + 1378.0, + 1604.0, + 1378.0, + 1640.0, + 295.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 474.0, + 1405.0, + 474.0, + 1405.0, + 512.0, + 294.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 504.0, + 1405.0, + 504.0, + 1405.0, + 544.0, + 294.0, + 544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 538.0, + 1404.0, + 538.0, + 1404.0, + 572.0, + 295.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 569.0, + 1405.0, + 569.0, + 1405.0, + 602.0, + 295.0, + 602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 598.0, + 1392.0, + 598.0, + 1392.0, + 635.0, + 294.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1878.0, + 1404.0, + 1878.0, + 1404.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, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2008.0, + 293.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2001.0, + 1245.0, + 2001.0, + 1245.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1113.0, + 1402.0, + 1113.0, + 1402.0, + 1150.0, + 295.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1138.0, + 1404.0, + 1138.0, + 1404.0, + 1183.0, + 293.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1172.0, + 1406.0, + 1172.0, + 1406.0, + 1211.0, + 293.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1203.0, + 1406.0, + 1203.0, + 1406.0, + 1244.0, + 294.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1237.0, + 884.0, + 1237.0, + 884.0, + 1270.0, + 297.0, + 1270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 975.0, + 1404.0, + 975.0, + 1404.0, + 1010.0, + 295.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1007.0, + 1404.0, + 1007.0, + 1404.0, + 1040.0, + 295.0, + 1040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1038.0, + 1407.0, + 1038.0, + 1407.0, + 1074.0, + 294.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1067.0, + 564.0, + 1067.0, + 564.0, + 1101.0, + 296.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1278.0, + 1407.0, + 1278.0, + 1407.0, + 1323.0, + 292.0, + 1323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1311.0, + 1404.0, + 1311.0, + 1404.0, + 1349.0, + 293.0, + 1349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1341.0, + 1404.0, + 1341.0, + 1404.0, + 1381.0, + 293.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1375.0, + 1406.0, + 1375.0, + 1406.0, + 1410.0, + 293.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1404.0, + 1129.0, + 1404.0, + 1129.0, + 1442.0, + 294.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 231.0, + 1405.0, + 231.0, + 1405.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 261.0, + 1406.0, + 261.0, + 1406.0, + 297.0, + 294.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 293.0, + 1405.0, + 293.0, + 1405.0, + 326.0, + 293.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 319.0, + 1361.0, + 319.0, + 1361.0, + 359.0, + 292.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 367.0, + 1401.0, + 367.0, + 1401.0, + 405.0, + 295.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 400.0, + 1405.0, + 400.0, + 1405.0, + 434.0, + 295.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 430.0, + 979.0, + 430.0, + 979.0, + 464.0, + 296.0, + 464.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 950, + 1403, + 950, + 1403, + 1256, + 298, + 1256 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 428, + 1404, + 428, + 1404, + 766, + 298, + 766 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1499, + 1403, + 1499, + 1403, + 1715, + 298, + 1715 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 299, + 1729, + 1403, + 1729, + 1403, + 2006, + 299, + 2006 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1271, + 1402, + 1271, + 1402, + 1484, + 298, + 1484 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1402, + 229, + 1402, + 413, + 299, + 413 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 781, + 1403, + 781, + 1403, + 935, + 299, + 935 + ], + "score": 0.977 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.894 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.654 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2111, + 841, + 2111 + ], + "score": 0.272 + }, + { + "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, + 2085.0, + 860.0, + 2085.0, + 860.0, + 2116.0, + 839.0, + 2116.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": [ + 294.0, + 952.0, + 1404.0, + 952.0, + 1404.0, + 984.0, + 294.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 977.0, + 1405.0, + 977.0, + 1405.0, + 1017.0, + 292.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1010.0, + 1407.0, + 1010.0, + 1407.0, + 1046.0, + 294.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1043.0, + 1404.0, + 1043.0, + 1404.0, + 1075.0, + 296.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1071.0, + 1405.0, + 1071.0, + 1405.0, + 1107.0, + 294.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1104.0, + 1404.0, + 1104.0, + 1404.0, + 1136.0, + 294.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1132.0, + 1407.0, + 1132.0, + 1407.0, + 1168.0, + 292.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1165.0, + 1405.0, + 1165.0, + 1405.0, + 1197.0, + 296.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1193.0, + 1405.0, + 1193.0, + 1405.0, + 1227.0, + 294.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1224.0, + 1291.0, + 1224.0, + 1291.0, + 1260.0, + 293.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 427.0, + 1404.0, + 427.0, + 1404.0, + 466.0, + 292.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 459.0, + 1408.0, + 459.0, + 1408.0, + 497.0, + 293.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 491.0, + 1405.0, + 491.0, + 1405.0, + 524.0, + 293.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 521.0, + 1406.0, + 521.0, + 1406.0, + 556.0, + 296.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 551.0, + 1406.0, + 551.0, + 1406.0, + 586.0, + 294.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 582.0, + 1405.0, + 582.0, + 1405.0, + 617.0, + 293.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 613.0, + 1406.0, + 613.0, + 1406.0, + 647.0, + 293.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 643.0, + 1406.0, + 643.0, + 1406.0, + 678.0, + 294.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 673.0, + 1404.0, + 673.0, + 1404.0, + 708.0, + 294.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 700.0, + 1408.0, + 700.0, + 1408.0, + 741.0, + 292.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 735.0, + 1404.0, + 735.0, + 1404.0, + 769.0, + 293.0, + 769.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": [ + 294.0, + 1532.0, + 1405.0, + 1532.0, + 1405.0, + 1566.0, + 294.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1561.0, + 1405.0, + 1561.0, + 1405.0, + 1598.0, + 292.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1595.0, + 1404.0, + 1595.0, + 1404.0, + 1626.0, + 296.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1623.0, + 1405.0, + 1623.0, + 1405.0, + 1658.0, + 294.0, + 1658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1654.0, + 1405.0, + 1654.0, + 1405.0, + 1688.0, + 294.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1685.0, + 926.0, + 1685.0, + 926.0, + 1719.0, + 296.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1730.0, + 1405.0, + 1730.0, + 1405.0, + 1767.0, + 295.0, + 1767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1756.0, + 1407.0, + 1756.0, + 1407.0, + 1799.0, + 293.0, + 1799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1789.0, + 1405.0, + 1789.0, + 1405.0, + 1828.0, + 293.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1816.0, + 1407.0, + 1816.0, + 1407.0, + 1861.0, + 293.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1853.0, + 1407.0, + 1853.0, + 1407.0, + 1887.0, + 293.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1882.0, + 1400.0, + 1882.0, + 1400.0, + 1915.0, + 297.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1915.0, + 1404.0, + 1915.0, + 1404.0, + 1947.0, + 295.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1980.0, + 294.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1976.0, + 665.0, + 1976.0, + 665.0, + 2009.0, + 297.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1271.0, + 1403.0, + 1271.0, + 1403.0, + 1305.0, + 296.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1302.0, + 1404.0, + 1302.0, + 1404.0, + 1336.0, + 296.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1330.0, + 1404.0, + 1330.0, + 1404.0, + 1365.0, + 294.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1363.0, + 1404.0, + 1363.0, + 1404.0, + 1396.0, + 294.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1390.0, + 1404.0, + 1390.0, + 1404.0, + 1428.0, + 293.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1425.0, + 1404.0, + 1425.0, + 1404.0, + 1457.0, + 294.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1455.0, + 701.0, + 1455.0, + 701.0, + 1485.0, + 294.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 230.0, + 1404.0, + 230.0, + 1404.0, + 265.0, + 297.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 260.0, + 1404.0, + 260.0, + 1404.0, + 296.0, + 295.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 292.0, + 1407.0, + 292.0, + 1407.0, + 325.0, + 293.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 321.0, + 1404.0, + 321.0, + 1404.0, + 357.0, + 294.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 353.0, + 1404.0, + 353.0, + 1404.0, + 387.0, + 293.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 384.0, + 1330.0, + 384.0, + 1330.0, + 416.0, + 298.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 783.0, + 1404.0, + 783.0, + 1404.0, + 816.0, + 297.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 810.0, + 1405.0, + 810.0, + 1405.0, + 847.0, + 294.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 842.0, + 1403.0, + 842.0, + 1403.0, + 875.0, + 297.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 871.0, + 1405.0, + 871.0, + 1405.0, + 908.0, + 295.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 902.0, + 1038.0, + 902.0, + 1038.0, + 939.0, + 295.0, + 939.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1181, + 1404, + 1181, + 1404, + 1396, + 298, + 1396 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1411, + 1404, + 1411, + 1404, + 1656, + 298, + 1656 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 871, + 1404, + 871, + 1404, + 1090, + 298, + 1090 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1741, + 1404, + 1741, + 1404, + 1959, + 298, + 1959 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 314, + 242, + 1390, + 242, + 1390, + 521, + 314, + 521 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 297, + 716, + 1402, + 716, + 1402, + 778, + 297, + 778 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 298, + 1972, + 1400, + 1972, + 1400, + 2034, + 298, + 2034 + ], + "score": 0.945 + }, + { + "category_id": 4, + "poly": [ + 597, + 560, + 1103, + 560, + 1103, + 593, + 597, + 593 + ], + "score": 0.918 + }, + { + "category_id": 0, + "poly": [ + 300, + 646, + 661, + 646, + 661, + 682, + 300, + 682 + ], + "score": 0.913 + }, + { + "category_id": 0, + "poly": [ + 300, + 1124, + 654, + 1124, + 654, + 1155, + 300, + 1155 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 301, + 1688, + 713, + 1688, + 713, + 1720, + 301, + 1720 + ], + "score": 0.901 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 815, + 76, + 815, + 104, + 299, + 104 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.768 + }, + { + "category_id": 0, + "poly": [ + 298, + 814, + 491, + 814, + 491, + 846, + 298, + 846 + ], + "score": 0.652 + }, + { + "category_id": 0, + "poly": [ + 299, + 814, + 491, + 814, + 491, + 846, + 299, + 846 + ], + "score": 0.582 + }, + { + "category_id": 13, + "poly": [ + 379, + 872, + 720, + 872, + 720, + 906, + 379, + 906 + ], + "score": 0.93, + "latex": "\\mathcal { D } = \\{ ( \\mathbf { s } _ { n } , y _ { n } ) | n = 1 , . . . , N \\}" + }, + { + "category_id": 13, + "poly": [ + 969, + 1865, + 1072, + 1865, + 1072, + 1897, + 969, + 1897 + ], + "score": 0.93, + "latex": "f _ { \\boldsymbol { \\theta } } ( { \\bf r } , { \\bf s } _ { n } )" + }, + { + "category_id": 13, + "poly": [ + 643, + 1804, + 820, + 1804, + 820, + 1837, + 643, + 1837 + ], + "score": 0.93, + "latex": "\\mathbf { r } = [ r _ { 1 } , . . . , r _ { T } ]" + }, + { + "category_id": 13, + "poly": [ + 1003, + 1242, + 1175, + 1242, + 1175, + 1276, + 1003, + 1276 + ], + "score": 0.93, + "latex": "\\mathbf { r } = [ r _ { 1 } , . . . , r _ { T } ]" + }, + { + "category_id": 13, + "poly": [ + 619, + 1057, + 900, + 1057, + 900, + 1089, + 619, + 1089 + ], + "score": 0.92, + "latex": "\\mathbf { x } _ { d n } = [ x _ { 1 d n } , . . . , x _ { L _ { d n } d n } ]" + }, + { + "category_id": 13, + "poly": [ + 300, + 1925, + 421, + 1925, + 421, + 1959, + 300, + 1959 + ], + "score": 0.92, + "latex": "( D C ) \\times T" + }, + { + "category_id": 13, + "poly": [ + 488, + 1025, + 684, + 1025, + 684, + 1057, + 488, + 1057 + ], + "score": 0.92, + "latex": "\\mathbf { s } _ { d n } = ( \\mathbf { t } _ { d n } , \\mathbf { x } _ { d n } )" + }, + { + "category_id": 13, + "poly": [ + 764, + 1025, + 1029, + 1025, + 1029, + 1058, + 764, + 1058 + ], + "score": 0.9, + "latex": "\\mathbf t _ { d n } = [ t _ { 1 d n } , . . . , t _ { L _ { d n } d n } ]" + }, + { + "category_id": 13, + "poly": [ + 1188, + 1804, + 1270, + 1804, + 1270, + 1832, + 1188, + 1832 + ], + "score": 0.9, + "latex": "C = 3" + }, + { + "category_id": 13, + "poly": [ + 929, + 1896, + 960, + 1896, + 960, + 1926, + 929, + 1926 + ], + "score": 0.89, + "latex": "\\hat { \\mathbf { s } } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 420, + 1896, + 451, + 1896, + 451, + 1926, + 420, + 1926 + ], + "score": 0.89, + "latex": "\\hat { \\mathbf { s } } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 663, + 1443, + 696, + 1443, + 696, + 1473, + 663, + 1473 + ], + "score": 0.88, + "latex": "{ \\hat { y } } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 865, + 995, + 913, + 995, + 913, + 1025, + 865, + 1025 + ], + "score": 0.88, + "latex": "L _ { d n }" + }, + { + "category_id": 13, + "poly": [ + 765, + 908, + 797, + 908, + 797, + 936, + 765, + 936 + ], + "score": 0.87, + "latex": "y _ { n }" + }, + { + "category_id": 13, + "poly": [ + 573, + 1930, + 603, + 1930, + 603, + 1956, + 573, + 1956 + ], + "score": 0.86, + "latex": "{ \\bf s } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 1094, + 1308, + 1121, + 1308, + 1121, + 1334, + 1094, + 1334 + ], + "score": 0.84, + "latex": "r _ { t }" + }, + { + "category_id": 13, + "poly": [ + 296, + 968, + 327, + 968, + 327, + 996, + 296, + 996 + ], + "score": 0.83, + "latex": "{ \\bf s } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 639, + 2004, + 666, + 2004, + 666, + 2030, + 639, + 2030 + ], + "score": 0.82, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 586, + 966, + 604, + 966, + 604, + 992, + 586, + 992 + ], + "score": 0.81, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 604, + 935, + 630, + 935, + 630, + 961, + 604, + 961 + ], + "score": 0.81, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 424, + 1835, + 450, + 1835, + 450, + 1862, + 424, + 1862 + ], + "score": 0.81, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 760, + 1775, + 786, + 1775, + 786, + 1801, + 760, + 1801 + ], + "score": 0.8, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 368, + 1805, + 392, + 1805, + 392, + 1831, + 368, + 1831 + ], + "score": 0.8, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1076, + 874, + 1104, + 874, + 1104, + 901, + 1076, + 901 + ], + "score": 0.79, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 817, + 1305, + 841, + 1305, + 841, + 1331, + 817, + 1331 + ], + "score": 0.78, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1286, + 996, + 1305, + 996, + 1305, + 1022, + 1286, + 1022 + ], + "score": 0.76, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 352, + 1030, + 373, + 1030, + 373, + 1052, + 352, + 1052 + ], + "score": 0.71, + "latex": "n" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 286.0, + 610.0, + 286.0, + 610.0, + 318.0, + 511.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 282.0, + 1080.0, + 282.0, + 1080.0, + 332.0, + 1050.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1090.0, + 296.0, + 1099.0, + 296.0, + 1099.0, + 306.0, + 1090.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 281.0, + 1131.0, + 281.0, + 1131.0, + 331.0, + 1106.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 280.0, + 1251.0, + 280.0, + 1251.0, + 333.0, + 1226.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 289.0, + 1380.0, + 289.0, + 1380.0, + 318.0, + 1310.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 369.0, + 384.0, + 369.0, + 384.0, + 395.0, + 325.0, + 395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 370.0, + 442.0, + 370.0, + 442.0, + 391.0, + 421.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 367.0, + 663.0, + 367.0, + 663.0, + 397.0, + 453.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 369.0, + 967.0, + 369.0, + 967.0, + 396.0, + 718.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 368.0, + 1057.0, + 368.0, + 1057.0, + 396.0, + 1032.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 449.0, + 665.0, + 449.0, + 665.0, + 475.0, + 454.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 447.0, + 950.0, + 447.0, + 950.0, + 476.0, + 754.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 486.0, + 949.0, + 486.0, + 949.0, + 515.0, + 771.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 485.0, + 1266.0, + 485.0, + 1266.0, + 517.0, + 1107.0, + 517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 558.0, + 1105.0, + 558.0, + 1105.0, + 597.0, + 594.0, + 597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 642.0, + 665.0, + 642.0, + 665.0, + 687.0, + 291.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1124.0, + 656.0, + 1124.0, + 656.0, + 1157.0, + 296.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1685.0, + 719.0, + 1685.0, + 719.0, + 1724.0, + 294.0, + 1724.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": [ + 294.0, + 811.0, + 495.0, + 811.0, + 495.0, + 851.0, + 294.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 811.0, + 495.0, + 811.0, + 495.0, + 851.0, + 294.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1181.0, + 1406.0, + 1181.0, + 1406.0, + 1216.0, + 294.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1212.0, + 1404.0, + 1212.0, + 1404.0, + 1247.0, + 294.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1241.0, + 1002.0, + 1241.0, + 1002.0, + 1277.0, + 292.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 1241.0, + 1405.0, + 1241.0, + 1405.0, + 1277.0, + 1176.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1273.0, + 1402.0, + 1273.0, + 1402.0, + 1307.0, + 294.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1301.0, + 816.0, + 1301.0, + 816.0, + 1338.0, + 293.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 1301.0, + 1093.0, + 1301.0, + 1093.0, + 1338.0, + 842.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 1301.0, + 1403.0, + 1301.0, + 1403.0, + 1338.0, + 1122.0, + 1338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1333.0, + 1406.0, + 1333.0, + 1406.0, + 1370.0, + 292.0, + 1370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1366.0, + 851.0, + 1366.0, + 851.0, + 1399.0, + 293.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1410.0, + 1405.0, + 1410.0, + 1405.0, + 1447.0, + 294.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1442.0, + 662.0, + 1442.0, + 662.0, + 1476.0, + 294.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 1442.0, + 1407.0, + 1442.0, + 1407.0, + 1476.0, + 697.0, + 1476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1472.0, + 1404.0, + 1472.0, + 1404.0, + 1505.0, + 294.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1505.0, + 1404.0, + 1505.0, + 1404.0, + 1535.0, + 296.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1530.0, + 1405.0, + 1530.0, + 1405.0, + 1569.0, + 292.0, + 1569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1565.0, + 1404.0, + 1565.0, + 1404.0, + 1598.0, + 294.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1591.0, + 1406.0, + 1591.0, + 1406.0, + 1629.0, + 292.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1625.0, + 801.0, + 1625.0, + 801.0, + 1658.0, + 296.0, + 1658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 870.0, + 378.0, + 870.0, + 378.0, + 908.0, + 294.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 721.0, + 870.0, + 1075.0, + 870.0, + 1075.0, + 908.0, + 721.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 870.0, + 1406.0, + 870.0, + 1406.0, + 908.0, + 1105.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 903.0, + 764.0, + 903.0, + 764.0, + 938.0, + 294.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 903.0, + 1406.0, + 903.0, + 1406.0, + 938.0, + 798.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 933.0, + 603.0, + 933.0, + 603.0, + 968.0, + 294.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 933.0, + 1406.0, + 933.0, + 1406.0, + 968.0, + 631.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 964.0, + 585.0, + 964.0, + 585.0, + 999.0, + 328.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 964.0, + 1406.0, + 964.0, + 1406.0, + 999.0, + 605.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 993.0, + 864.0, + 993.0, + 864.0, + 1029.0, + 292.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.0, + 993.0, + 1285.0, + 993.0, + 1285.0, + 1029.0, + 914.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 993.0, + 1407.0, + 993.0, + 1407.0, + 1029.0, + 1306.0, + 1029.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1022.0, + 351.0, + 1022.0, + 351.0, + 1063.0, + 292.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 1022.0, + 487.0, + 1022.0, + 487.0, + 1063.0, + 374.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 1022.0, + 763.0, + 1022.0, + 763.0, + 1063.0, + 685.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 1022.0, + 1405.0, + 1022.0, + 1405.0, + 1063.0, + 1030.0, + 1063.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1052.0, + 618.0, + 1052.0, + 618.0, + 1093.0, + 293.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 1052.0, + 1400.0, + 1052.0, + 1400.0, + 1093.0, + 901.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1742.0, + 1404.0, + 1742.0, + 1404.0, + 1777.0, + 297.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1774.0, + 759.0, + 1774.0, + 759.0, + 1805.0, + 293.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 787.0, + 1774.0, + 1404.0, + 1774.0, + 1404.0, + 1805.0, + 787.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1803.0, + 367.0, + 1803.0, + 367.0, + 1838.0, + 293.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1803.0, + 642.0, + 1803.0, + 642.0, + 1838.0, + 393.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1803.0, + 1187.0, + 1803.0, + 1187.0, + 1838.0, + 821.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1271.0, + 1803.0, + 1405.0, + 1803.0, + 1405.0, + 1838.0, + 1271.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1834.0, + 423.0, + 1834.0, + 423.0, + 1870.0, + 293.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1834.0, + 1404.0, + 1834.0, + 1404.0, + 1870.0, + 451.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1860.0, + 968.0, + 1860.0, + 968.0, + 1902.0, + 292.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 1860.0, + 1405.0, + 1860.0, + 1405.0, + 1902.0, + 1073.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1893.0, + 419.0, + 1893.0, + 419.0, + 1930.0, + 293.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 1893.0, + 928.0, + 1893.0, + 928.0, + 1930.0, + 452.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 1893.0, + 1405.0, + 1893.0, + 1405.0, + 1930.0, + 961.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1922.0, + 572.0, + 1922.0, + 572.0, + 1964.0, + 422.0, + 1964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1922.0, + 615.0, + 1922.0, + 615.0, + 1964.0, + 604.0, + 1964.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 714.0, + 1406.0, + 714.0, + 1406.0, + 753.0, + 293.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 744.0, + 927.0, + 744.0, + 927.0, + 781.0, + 295.0, + 781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1970.0, + 1405.0, + 1970.0, + 1405.0, + 2007.0, + 294.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2003.0, + 638.0, + 2003.0, + 638.0, + 2035.0, + 296.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 2003.0, + 1404.0, + 2003.0, + 1404.0, + 2035.0, + 667.0, + 2035.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1515, + 1404, + 1515, + 1404, + 1700, + 297, + 1700 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1346, + 1404, + 1346, + 1404, + 1502, + 298, + 1502 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 818, + 1405, + 818, + 1405, + 974, + 298, + 974 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 1404, + 228, + 1404, + 415, + 298, + 415 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 300, + 1131, + 1401, + 1131, + 1401, + 1256, + 300, + 1256 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1791, + 1405, + 1791, + 1405, + 1977, + 298, + 1977 + ], + "score": 0.978 + }, + { + "category_id": 8, + "poly": [ + 528, + 693, + 1242, + 693, + 1242, + 783, + 528, + 783 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 399, + 1022, + 1299, + 1022, + 1299, + 1102, + 399, + 1102 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 526, + 593, + 1209, + 593, + 1209, + 681, + 526, + 681 + ], + "score": 0.936 + }, + { + "category_id": 8, + "poly": [ + 459, + 465, + 1150, + 465, + 1150, + 535, + 459, + 535 + ], + "score": 0.934 + }, + { + "category_id": 2, + "poly": [ + 336, + 2004, + 998, + 2004, + 998, + 2034, + 336, + 2034 + ], + "score": 0.918 + }, + { + "category_id": 8, + "poly": [ + 528, + 544, + 955, + 544, + 955, + 582, + 528, + 582 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 300, + 1292, + 670, + 1292, + 670, + 1324, + 300, + 1324 + ], + "score": 0.914 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 300, + 1736, + 519, + 1736, + 519, + 1768, + 300, + 1768 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1046, + 1400, + 1046, + 1400, + 1076, + 1366, + 1076 + ], + "score": 0.879 + }, + { + "category_id": 9, + "poly": [ + 1365, + 475, + 1401, + 475, + 1401, + 506, + 1365, + 506 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1366, + 721, + 1400, + 721, + 1400, + 750, + 1366, + 750 + ], + "score": 0.87 + }, + { + "category_id": 9, + "poly": [ + 1365, + 620, + 1401, + 620, + 1401, + 650, + 1365, + 650 + ], + "score": 0.867 + }, + { + "category_id": 9, + "poly": [ + 1366, + 548, + 1401, + 548, + 1401, + 578, + 1366, + 578 + ], + "score": 0.867 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.754 + }, + { + "category_id": 14, + "poly": [ + 402, + 1021, + 1297, + 1021, + 1297, + 1102, + 402, + 1102 + ], + "score": 0.94, + "latex": "\\chi _ { k d } = h _ { \\theta } ^ { \\chi } ( r _ { k } , \\mathbf { s } ) = \\frac { \\sum _ { d ^ { \\prime } } \\rho _ { d d ^ { \\prime } } \\lambda _ { k d ^ { \\prime } } \\sigma _ { k d ^ { \\prime } } } { \\sum _ { d ^ { \\prime } } \\lambda _ { k d ^ { \\prime } } } , \\qquad \\quad \\tau _ { k d } = h _ { \\theta } ^ { \\tau } ( r _ { k } , \\mathbf { s } ) = \\gamma _ { k d } - \\chi _ { k d } ." + }, + { + "category_id": 14, + "poly": [ + 457, + 462, + 1245, + 462, + 1245, + 787, + 457, + 787 + ], + "score": 0.94, + "latex": "\\begin{array} { l } { \\displaystyle { Z ( r , \\mathbf { t } , \\alpha ) = \\sum _ { t \\in \\mathbf { t } } w ( r , t , \\alpha ) , \\quad w ( r , t , \\alpha ) = \\exp ( - \\alpha ( r - t ) ^ { 2 } ) } } \\\\ { \\displaystyle { \\ } \\lambda _ { k d } = h _ { \\theta } ^ { \\lambda } ( r _ { k } , \\mathbf { t } _ { d } , \\mathbf { x } _ { d } ) = Z ( r _ { k } , \\mathbf { t } _ { d } , \\alpha _ { d } ) } \\\\ { \\displaystyle { \\ \\sigma _ { k d } = h _ { \\theta } ^ { \\sigma } ( r _ { k } , \\mathbf { t } _ { d } , \\mathbf { x } _ { d } ) = \\frac { 1 } { Z ( r _ { k } , \\mathbf { t } _ { d } , \\alpha _ { d } ) } \\sum _ { j = 1 } ^ { L _ { d n } } w ( r _ { k } , t _ { j d } , \\alpha _ { d } ) x _ { j d } } } \\\\ { \\displaystyle { \\ } \\gamma _ { k d } = h _ { \\theta } ^ { \\gamma } ( r _ { k } , \\mathbf { t } _ { d } , \\mathbf { x } _ { d } ) = \\frac { 1 } { Z ( r _ { k } , \\mathbf { t } _ { d } , \\kappa \\alpha _ { d } ) } \\sum _ { j = 1 } ^ { L _ { d n } } w ( r _ { k } , t _ { j d } , \\kappa \\alpha _ { d } ) x _ { j d } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 642, + 1469, + 764, + 1469, + 764, + 1503, + 642, + 1503 + ], + "score": 0.93, + "latex": "( D C ) \\times T" + }, + { + "category_id": 13, + "poly": [ + 1046, + 1438, + 1228, + 1438, + 1228, + 1472, + 1046, + 1472 + ], + "score": 0.92, + "latex": "\\hat { \\mathbf { s } } _ { n } ~ = ~ f _ { \\theta } ( \\mathbf { r } , \\mathbf { s } _ { n } )" + }, + { + "category_id": 13, + "poly": [ + 1068, + 1516, + 1400, + 1516, + 1400, + 1551, + 1068, + 1551 + ], + "score": 0.92, + "latex": "\\hat { y } _ { n } = g _ { \\phi } ( \\hat { \\mathbf { s } } _ { n } ) = g _ { \\phi } ( f _ { \\theta } ( \\mathbf { r } , \\mathbf { s } _ { n } ) )" + }, + { + "category_id": 13, + "poly": [ + 985, + 1409, + 1071, + 1409, + 1071, + 1437, + 985, + 1437 + ], + "score": 0.91, + "latex": "C = 3" + }, + { + "category_id": 13, + "poly": [ + 545, + 1413, + 652, + 1413, + 652, + 1440, + 545, + 1440 + ], + "score": 0.91, + "latex": "r _ { 1 } , . . . , r _ { T }" + }, + { + "category_id": 13, + "poly": [ + 775, + 385, + 845, + 385, + 845, + 411, + 775, + 411 + ], + "score": 0.9, + "latex": "\\kappa > 1" + }, + { + "category_id": 13, + "poly": [ + 654, + 1578, + 686, + 1578, + 686, + 1608, + 654, + 1608 + ], + "score": 0.89, + "latex": "\\hat { \\mathbf { s } } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 510, + 1226, + 544, + 1226, + 544, + 1255, + 510, + 1255 + ], + "score": 0.89, + "latex": "\\lambda _ { d }" + }, + { + "category_id": 13, + "poly": [ + 676, + 1518, + 707, + 1518, + 707, + 1547, + 676, + 1547 + ], + "score": 0.88, + "latex": "\\hat { \\mathbf { s } } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 682, + 388, + 732, + 388, + 732, + 413, + 682, + 413 + ], + "score": 0.88, + "latex": "\\kappa \\alpha _ { d }" + }, + { + "category_id": 13, + "poly": [ + 856, + 855, + 903, + 855, + 903, + 881, + 856, + 881 + ], + "score": 0.88, + "latex": "\\rho _ { d d ^ { \\prime } }" + }, + { + "category_id": 13, + "poly": [ + 1082, + 1639, + 1113, + 1639, + 1113, + 1669, + 1082, + 1669 + ], + "score": 0.88, + "latex": "\\hat { \\mathbf { s } } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 297, + 293, + 332, + 293, + 332, + 322, + 297, + 322 + ], + "score": 0.87, + "latex": "\\lambda _ { d }" + }, + { + "category_id": 13, + "poly": [ + 1204, + 357, + 1238, + 357, + 1238, + 385, + 1204, + 385 + ], + "score": 0.86, + "latex": "\\gamma _ { d }" + }, + { + "category_id": 13, + "poly": [ + 435, + 1198, + 471, + 1198, + 471, + 1226, + 435, + 1226 + ], + "score": 0.86, + "latex": "x d" + }, + { + "category_id": 13, + "poly": [ + 1089, + 265, + 1123, + 265, + 1123, + 294, + 1089, + 294 + ], + "score": 0.86, + "latex": "\\gamma _ { d }" + }, + { + "category_id": 13, + "poly": [ + 770, + 357, + 803, + 357, + 803, + 383, + 770, + 383 + ], + "score": 0.86, + "latex": "\\alpha _ { d }" + }, + { + "category_id": 13, + "poly": [ + 568, + 883, + 604, + 883, + 604, + 912, + 568, + 912 + ], + "score": 0.86, + "latex": "x d" + }, + { + "category_id": 13, + "poly": [ + 1045, + 1198, + 1077, + 1198, + 1077, + 1224, + 1045, + 1224 + ], + "score": 0.86, + "latex": "\\tau _ { d }" + }, + { + "category_id": 13, + "poly": [ + 1284, + 326, + 1320, + 326, + 1320, + 353, + 1284, + 353 + ], + "score": 0.85, + "latex": "\\sigma _ { d }" + }, + { + "category_id": 13, + "poly": [ + 509, + 1551, + 542, + 1551, + 542, + 1579, + 509, + 1579 + ], + "score": 0.85, + "latex": "y _ { n }" + }, + { + "category_id": 13, + "poly": [ + 1044, + 296, + 1074, + 296, + 1074, + 323, + 1044, + 323 + ], + "score": 0.85, + "latex": "r _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1060, + 947, + 1096, + 947, + 1096, + 974, + 1060, + 974 + ], + "score": 0.85, + "latex": "x d" + }, + { + "category_id": 13, + "poly": [ + 580, + 266, + 615, + 266, + 615, + 293, + 580, + 293 + ], + "score": 0.85, + "latex": "\\pmb { \\sigma } _ { d }" + }, + { + "category_id": 13, + "poly": [ + 850, + 1380, + 876, + 1380, + 876, + 1406, + 850, + 1406 + ], + "score": 0.82, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 988, + 821, + 1015, + 821, + 1015, + 847, + 988, + 847 + ], + "score": 0.82, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 297, + 945, + 330, + 945, + 330, + 974, + 297, + 974 + ], + "score": 0.82, + "latex": "\\gamma _ { d }" + }, + { + "category_id": 13, + "poly": [ + 1371, + 885, + 1401, + 885, + 1401, + 911, + 1371, + 911 + ], + "score": 0.8, + "latex": "\\tau _ { d }" + }, + { + "category_id": 13, + "poly": [ + 959, + 1349, + 986, + 1349, + 986, + 1375, + 959, + 1375 + ], + "score": 0.79, + "latex": "D" + }, + { + "category_id": 13, + "poly": [ + 525, + 1165, + 544, + 1165, + 544, + 1191, + 525, + 1191 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 588, + 913, + 607, + 913, + 607, + 938, + 588, + 938 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 499, + 323, + 518, + 323, + 518, + 349, + 499, + 349 + ], + "score": 0.78, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 698, + 1553, + 718, + 1553, + 718, + 1574, + 698, + 1574 + ], + "score": 0.73, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 890, + 883, + 907, + 883, + 907, + 908, + 890, + 908 + ], + "score": 0.73, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 633, + 2014, + 651, + 2014, + 651, + 2029, + 633, + 2029 + ], + "score": 0.65, + "latex": "n" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1999.0, + 632.0, + 1999.0, + 632.0, + 2039.0, + 335.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 1999.0, + 1001.0, + 1999.0, + 1001.0, + 2039.0, + 652.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1287.0, + 675.0, + 1287.0, + 675.0, + 1329.0, + 294.0, + 1329.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, + 1733.0, + 521.0, + 1733.0, + 521.0, + 1773.0, + 294.0, + 1773.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": [ + 295.0, + 1516.0, + 675.0, + 1516.0, + 675.0, + 1552.0, + 295.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1516.0, + 1067.0, + 1516.0, + 1067.0, + 1552.0, + 708.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1548.0, + 508.0, + 1548.0, + 508.0, + 1580.0, + 296.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 1548.0, + 697.0, + 1548.0, + 697.0, + 1580.0, + 543.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 1548.0, + 1405.0, + 1548.0, + 1405.0, + 1580.0, + 719.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1577.0, + 653.0, + 1577.0, + 653.0, + 1613.0, + 295.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1577.0, + 1406.0, + 1577.0, + 1406.0, + 1613.0, + 687.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1606.0, + 1406.0, + 1606.0, + 1406.0, + 1642.0, + 294.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1635.0, + 1081.0, + 1635.0, + 1081.0, + 1672.0, + 294.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1635.0, + 1406.0, + 1635.0, + 1406.0, + 1672.0, + 1114.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1669.0, + 1035.0, + 1669.0, + 1035.0, + 1703.0, + 293.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1348.0, + 958.0, + 1348.0, + 958.0, + 1381.0, + 296.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 1348.0, + 1405.0, + 1348.0, + 1405.0, + 1381.0, + 987.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1379.0, + 849.0, + 1379.0, + 849.0, + 1412.0, + 296.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 877.0, + 1379.0, + 1405.0, + 1379.0, + 1405.0, + 1412.0, + 877.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1408.0, + 544.0, + 1408.0, + 544.0, + 1445.0, + 294.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 1408.0, + 984.0, + 1408.0, + 984.0, + 1445.0, + 653.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1408.0, + 1406.0, + 1408.0, + 1406.0, + 1445.0, + 1072.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1439.0, + 1045.0, + 1439.0, + 1045.0, + 1473.0, + 293.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1229.0, + 1439.0, + 1405.0, + 1439.0, + 1405.0, + 1473.0, + 1229.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1468.0, + 641.0, + 1468.0, + 641.0, + 1505.0, + 294.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 1468.0, + 774.0, + 1468.0, + 774.0, + 1505.0, + 765.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 820.0, + 987.0, + 820.0, + 987.0, + 853.0, + 297.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 820.0, + 1405.0, + 820.0, + 1405.0, + 853.0, + 1016.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 849.0, + 855.0, + 849.0, + 855.0, + 885.0, + 293.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 849.0, + 1405.0, + 849.0, + 1405.0, + 885.0, + 904.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 875.0, + 567.0, + 875.0, + 567.0, + 920.0, + 292.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 875.0, + 889.0, + 875.0, + 889.0, + 920.0, + 605.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 875.0, + 1370.0, + 875.0, + 1370.0, + 920.0, + 908.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 875.0, + 1406.0, + 875.0, + 1406.0, + 920.0, + 1402.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 908.0, + 587.0, + 908.0, + 587.0, + 947.0, + 292.0, + 947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 908.0, + 1405.0, + 908.0, + 1405.0, + 947.0, + 608.0, + 947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 939.0, + 296.0, + 939.0, + 296.0, + 979.0, + 293.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 939.0, + 1059.0, + 939.0, + 1059.0, + 979.0, + 331.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 939.0, + 1381.0, + 939.0, + 1381.0, + 979.0, + 1097.0, + 979.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, + 261.0, + 579.0, + 261.0, + 579.0, + 297.0, + 294.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 261.0, + 1088.0, + 261.0, + 1088.0, + 297.0, + 616.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 297.0, + 1124.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 291.0, + 1043.0, + 291.0, + 1043.0, + 327.0, + 333.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 291.0, + 1405.0, + 291.0, + 1405.0, + 327.0, + 1075.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 316.0, + 498.0, + 316.0, + 498.0, + 359.0, + 292.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.0, + 316.0, + 1283.0, + 316.0, + 1283.0, + 359.0, + 519.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 316.0, + 1409.0, + 316.0, + 1409.0, + 359.0, + 1321.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 352.0, + 769.0, + 352.0, + 769.0, + 388.0, + 294.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 352.0, + 1203.0, + 352.0, + 1203.0, + 388.0, + 804.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 352.0, + 1406.0, + 352.0, + 1406.0, + 388.0, + 1239.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 383.0, + 681.0, + 383.0, + 681.0, + 416.0, + 293.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 383.0, + 774.0, + 383.0, + 774.0, + 416.0, + 733.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 383.0, + 857.0, + 383.0, + 857.0, + 416.0, + 846.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1133.0, + 1403.0, + 1133.0, + 1403.0, + 1165.0, + 295.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1163.0, + 524.0, + 1163.0, + 524.0, + 1197.0, + 293.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 1163.0, + 1406.0, + 1163.0, + 1406.0, + 1197.0, + 545.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1195.0, + 434.0, + 1195.0, + 434.0, + 1227.0, + 295.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 1195.0, + 1044.0, + 1195.0, + 1044.0, + 1227.0, + 472.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 1195.0, + 1405.0, + 1195.0, + 1405.0, + 1227.0, + 1078.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1227.0, + 509.0, + 1227.0, + 509.0, + 1257.0, + 296.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 545.0, + 1227.0, + 1250.0, + 1227.0, + 1250.0, + 1257.0, + 545.0, + 1257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1790.0, + 1405.0, + 1790.0, + 1405.0, + 1828.0, + 293.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1823.0, + 1402.0, + 1823.0, + 1402.0, + 1858.0, + 295.0, + 1858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1855.0, + 1403.0, + 1855.0, + 1403.0, + 1887.0, + 295.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1884.0, + 1405.0, + 1884.0, + 1405.0, + 1918.0, + 293.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1915.0, + 1403.0, + 1915.0, + 1403.0, + 1947.0, + 296.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1947.0, + 1346.0, + 1947.0, + 1346.0, + 1978.0, + 296.0, + 1978.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1130, + 1404, + 1130, + 1404, + 1497, + 298, + 1497 + ], + "score": 0.986 + }, + { + "category_id": 1, + "poly": [ + 297, + 398, + 1403, + 398, + 1403, + 646, + 297, + 646 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 299, + 658, + 1404, + 658, + 1404, + 813, + 299, + 813 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1403, + 229, + 1403, + 384, + 298, + 384 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 300, + 1596, + 1404, + 1596, + 1404, + 1687, + 300, + 1687 + ], + "score": 0.974 + }, + { + "category_id": 8, + "poly": [ + 434, + 831, + 1264, + 831, + 1264, + 1024, + 434, + 1024 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 300, + 1778, + 1406, + 1778, + 1406, + 1871, + 300, + 1871 + ], + "score": 0.97 + }, + { + "category_id": 2, + "poly": [ + 332, + 1975, + 1287, + 1975, + 1287, + 2034, + 332, + 2034 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 300, + 1886, + 1400, + 1886, + 1400, + 1949, + 300, + 1949 + ], + "score": 0.938 + }, + { + "category_id": 0, + "poly": [ + 300, + 1062, + 763, + 1062, + 763, + 1097, + 300, + 1097 + ], + "score": 0.909 + }, + { + "category_id": 0, + "poly": [ + 300, + 1538, + 598, + 1538, + 598, + 1569, + 300, + 1569 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.886 + }, + { + "category_id": 9, + "poly": [ + 1366, + 863, + 1400, + 863, + 1400, + 893, + 1366, + 893 + ], + "score": 0.885 + }, + { + "category_id": 0, + "poly": [ + 302, + 1723, + 832, + 1723, + 832, + 1755, + 302, + 1755 + ], + "score": 0.875 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 859, + 2089, + 859, + 2112, + 840, + 2112 + ], + "score": 0.79 + }, + { + "category_id": 14, + "poly": [ + 434, + 828, + 1263, + 828, + 1263, + 1030, + 434, + 1030 + ], + "score": 0.94, + "latex": "\\begin{array} { r l r } { { \\theta _ { * } , \\phi _ { * } = \\arg \\operatorname* { m i n } _ { \\theta , \\phi } \\sum _ { n = 1 } ^ { N } \\ell _ { P } \\big ( y _ { n } , g _ { \\phi } \\big ( f _ { \\theta } ( \\mathbf { s } _ { n } ) \\big ) + \\delta _ { I } \\| \\theta \\| _ { 2 } ^ { 2 } + \\delta _ { P } \\| \\phi \\| _ { 2 } ^ { 2 } } } \\\\ & { } & { + \\delta _ { R } \\sum _ { n = 1 } ^ { N } \\sum _ { d = 1 } ^ { D } \\sum _ { j = 1 } ^ { L _ { d n } } m _ { j d n } \\ell _ { I } \\big ( x _ { j d n } , h _ { \\theta } ^ { \\chi } \\big ( t _ { j d n } , \\big ( 1 - \\mathbf { m } _ { n } \\big ) \\odot \\mathbf { s } _ { n } \\big ) \\big ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 522, + 430, + 656, + 430, + 656, + 464, + 522, + 464 + ], + "score": 0.93, + "latex": "\\left( t _ { j d n } , x _ { j d n } \\right)" + }, + { + "category_id": 13, + "poly": [ + 1197, + 430, + 1332, + 430, + 1332, + 464, + 1197, + 464 + ], + "score": 0.92, + "latex": "\\left( t _ { j d n } , x _ { j d n } \\right)" + }, + { + "category_id": 13, + "poly": [ + 704, + 431, + 828, + 431, + 828, + 463, + 704, + 463 + ], + "score": 0.92, + "latex": "m _ { j d n } = 1" + }, + { + "category_id": 13, + "poly": [ + 556, + 553, + 611, + 553, + 611, + 585, + 556, + 585 + ], + "score": 0.92, + "latex": "\\hat { x } _ { j d n }" + }, + { + "category_id": 13, + "poly": [ + 1147, + 554, + 1197, + 554, + 1197, + 585, + 1147, + 585 + ], + "score": 0.91, + "latex": "t _ { j d n }" + }, + { + "category_id": 13, + "poly": [ + 892, + 493, + 1001, + 493, + 1001, + 522, + 892, + 522 + ], + "score": 0.9, + "latex": "\\mathbf { m } _ { n } \\odot \\mathbf { s } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 297, + 611, + 674, + 611, + 674, + 648, + 297, + 648 + ], + "score": 0.9, + "latex": "\\hat { x } _ { j d n } = h _ { \\theta } ^ { \\chi } ( t _ { j d n } , ( 1 - \\mathbf { m } _ { n } ) ^ { \\top } \\odot \\mathbf { s } _ { n } )" + }, + { + "category_id": 13, + "poly": [ + 939, + 264, + 995, + 264, + 995, + 295, + 939, + 295 + ], + "score": 0.89, + "latex": "x _ { j d n }" + }, + { + "category_id": 13, + "poly": [ + 1336, + 406, + 1400, + 406, + 1400, + 433, + 1336, + 433 + ], + "score": 0.87, + "latex": "m _ { j d n }" + }, + { + "category_id": 13, + "poly": [ + 377, + 721, + 406, + 721, + 406, + 751, + 377, + 751 + ], + "score": 0.87, + "latex": "\\ell _ { I }" + }, + { + "category_id": 13, + "poly": [ + 1163, + 661, + 1196, + 661, + 1196, + 690, + 1163, + 690 + ], + "score": 0.87, + "latex": "\\ell _ { P }" + }, + { + "category_id": 13, + "poly": [ + 629, + 521, + 812, + 521, + 812, + 554, + 629, + 554 + ], + "score": 0.87, + "latex": "\\left( 1 - \\mathbf { m } _ { n } \\right) \\odot \\mathbf { s } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 1367, + 751, + 1401, + 751, + 1401, + 782, + 1367, + 782 + ], + "score": 0.87, + "latex": "\\delta _ { R }" + }, + { + "category_id": 13, + "poly": [ + 385, + 753, + 412, + 753, + 412, + 781, + 385, + 781 + ], + "score": 0.86, + "latex": "\\ell _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1228, + 524, + 1260, + 524, + 1260, + 552, + 1228, + 552 + ], + "score": 0.86, + "latex": "{ \\bf s } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 296, + 525, + 328, + 525, + 328, + 553, + 296, + 553 + ], + "score": 0.83, + "latex": "{ \\bf s } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 1239, + 751, + 1311, + 751, + 1311, + 782, + 1239, + 782 + ], + "score": 0.61, + "latex": "\\delta _ { I } , \\delta _ { P }" + }, + { + "category_id": 13, + "poly": [ + 1239, + 751, + 1267, + 751, + 1267, + 781, + 1239, + 781 + ], + "score": 0.39, + "latex": "\\delta _ { I }" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 1968.0, + 1028.0, + 1968.0, + 1028.0, + 2008.0, + 335.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 1997.0, + 1289.0, + 1997.0, + 1289.0, + 2041.0, + 334.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1059.0, + 768.0, + 1059.0, + 768.0, + 1102.0, + 293.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1533.0, + 604.0, + 1533.0, + 604.0, + 1574.0, + 293.0, + 1574.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, + 1721.0, + 835.0, + 1721.0, + 835.0, + 1759.0, + 295.0, + 1759.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": [ + 294.0, + 1132.0, + 1405.0, + 1132.0, + 1405.0, + 1166.0, + 294.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1163.0, + 1404.0, + 1163.0, + 1404.0, + 1197.0, + 294.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1194.0, + 1405.0, + 1194.0, + 1405.0, + 1228.0, + 294.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1222.0, + 1405.0, + 1222.0, + 1405.0, + 1261.0, + 292.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1250.0, + 1406.0, + 1250.0, + 1406.0, + 1290.0, + 292.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1286.0, + 1406.0, + 1286.0, + 1406.0, + 1320.0, + 294.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1312.0, + 1408.0, + 1312.0, + 1408.0, + 1350.0, + 293.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1346.0, + 1404.0, + 1346.0, + 1404.0, + 1380.0, + 294.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1373.0, + 1405.0, + 1373.0, + 1405.0, + 1413.0, + 292.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1407.0, + 1406.0, + 1407.0, + 1406.0, + 1440.0, + 293.0, + 1440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1438.0, + 1406.0, + 1438.0, + 1406.0, + 1472.0, + 294.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1469.0, + 601.0, + 1469.0, + 601.0, + 1496.0, + 297.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 391.0, + 1335.0, + 391.0, + 1335.0, + 440.0, + 291.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 391.0, + 1405.0, + 391.0, + 1405.0, + 440.0, + 1401.0, + 440.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 427.0, + 521.0, + 427.0, + 521.0, + 468.0, + 292.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 427.0, + 703.0, + 427.0, + 703.0, + 468.0, + 657.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 427.0, + 1196.0, + 427.0, + 1196.0, + 468.0, + 829.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 427.0, + 1407.0, + 427.0, + 1407.0, + 468.0, + 1333.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 458.0, + 1405.0, + 458.0, + 1405.0, + 497.0, + 294.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 491.0, + 891.0, + 491.0, + 891.0, + 524.0, + 295.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 491.0, + 1407.0, + 491.0, + 1407.0, + 524.0, + 1002.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 521.0, + 628.0, + 521.0, + 628.0, + 555.0, + 329.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 521.0, + 1227.0, + 521.0, + 1227.0, + 555.0, + 813.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 521.0, + 1405.0, + 521.0, + 1405.0, + 555.0, + 1261.0, + 555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 552.0, + 555.0, + 552.0, + 555.0, + 586.0, + 295.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 552.0, + 1146.0, + 552.0, + 1146.0, + 586.0, + 612.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 552.0, + 1405.0, + 552.0, + 1405.0, + 586.0, + 1198.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 582.0, + 1404.0, + 582.0, + 1404.0, + 616.0, + 295.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 613.0, + 685.0, + 613.0, + 685.0, + 650.0, + 675.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 660.0, + 1162.0, + 660.0, + 1162.0, + 693.0, + 298.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 660.0, + 1404.0, + 660.0, + 1404.0, + 693.0, + 1197.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 690.0, + 1403.0, + 690.0, + 1403.0, + 724.0, + 295.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 721.0, + 376.0, + 721.0, + 376.0, + 754.0, + 297.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 407.0, + 721.0, + 1405.0, + 721.0, + 1405.0, + 754.0, + 407.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 747.0, + 384.0, + 747.0, + 384.0, + 787.0, + 294.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 747.0, + 1238.0, + 747.0, + 1238.0, + 787.0, + 413.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1312.0, + 747.0, + 1366.0, + 747.0, + 1366.0, + 787.0, + 1312.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 781.0, + 1379.0, + 781.0, + 1379.0, + 818.0, + 294.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 259.0, + 938.0, + 259.0, + 938.0, + 299.0, + 293.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.0, + 259.0, + 1405.0, + 259.0, + 1405.0, + 299.0, + 996.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 287.0, + 1404.0, + 287.0, + 1404.0, + 330.0, + 292.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 317.0, + 1405.0, + 317.0, + 1405.0, + 361.0, + 292.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 352.0, + 827.0, + 352.0, + 827.0, + 388.0, + 294.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1595.0, + 1404.0, + 1595.0, + 1404.0, + 1631.0, + 294.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1627.0, + 1405.0, + 1627.0, + 1405.0, + 1661.0, + 295.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1658.0, + 730.0, + 1658.0, + 730.0, + 1690.0, + 295.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1774.0, + 1402.0, + 1774.0, + 1402.0, + 1816.0, + 293.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1808.0, + 1406.0, + 1808.0, + 1406.0, + 1845.0, + 293.0, + 1845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1841.0, + 1009.0, + 1841.0, + 1009.0, + 1872.0, + 296.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1886.0, + 1404.0, + 1886.0, + 1404.0, + 1921.0, + 296.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1916.0, + 1404.0, + 1916.0, + 1404.0, + 1953.0, + 295.0, + 1953.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1711, + 1403, + 1711, + 1403, + 1957, + 298, + 1957 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1144, + 1403, + 1144, + 1403, + 1298, + 298, + 1298 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1313, + 1404, + 1313, + 1404, + 1496, + 298, + 1496 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1513, + 1403, + 1513, + 1403, + 1696, + 298, + 1696 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 368, + 675, + 1405, + 675, + 1405, + 1055, + 368, + 1055 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 300, + 229, + 1401, + 229, + 1401, + 322, + 300, + 322 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 298, + 406, + 1404, + 406, + 1404, + 654, + 298, + 654 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 298, + 1972, + 1401, + 1972, + 1401, + 2034, + 298, + 2034 + ], + "score": 0.94 + }, + { + "category_id": 0, + "poly": [ + 299, + 1087, + 475, + 1087, + 475, + 1118, + 299, + 1118 + ], + "score": 0.909 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 300, + 353, + 733, + 353, + 733, + 385, + 300, + 385 + ], + "score": 0.894 + }, + { + "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.239 + }, + { + "category_id": 13, + "poly": [ + 589, + 1865, + 709, + 1865, + 709, + 1897, + 589, + 1897 + ], + "score": 0.85, + "latex": "\\mathit { p } < 0 . 0 1 )" + }, + { + "category_id": 13, + "poly": [ + 1136, + 1605, + 1182, + 1605, + 1182, + 1634, + 1136, + 1634 + ], + "score": 0.55, + "latex": "5 0 \\mathrm { x }" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1082.0, + 477.0, + 1082.0, + 477.0, + 1124.0, + 292.0, + 1124.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, + 351.0, + 737.0, + 351.0, + 737.0, + 389.0, + 294.0, + 389.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": [ + 294.0, + 1713.0, + 1404.0, + 1713.0, + 1404.0, + 1746.0, + 294.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1740.0, + 1407.0, + 1740.0, + 1407.0, + 1776.0, + 292.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1774.0, + 1405.0, + 1774.0, + 1405.0, + 1808.0, + 294.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1803.0, + 1407.0, + 1803.0, + 1407.0, + 1840.0, + 292.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1835.0, + 1403.0, + 1835.0, + 1403.0, + 1869.0, + 294.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1865.0, + 588.0, + 1865.0, + 588.0, + 1899.0, + 294.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1865.0, + 1403.0, + 1865.0, + 1403.0, + 1899.0, + 710.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1895.0, + 1405.0, + 1895.0, + 1405.0, + 1929.0, + 296.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1927.0, + 1022.0, + 1927.0, + 1022.0, + 1960.0, + 296.0, + 1960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1142.0, + 1405.0, + 1142.0, + 1405.0, + 1180.0, + 292.0, + 1180.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1176.0, + 1404.0, + 1176.0, + 1404.0, + 1209.0, + 296.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1202.0, + 1405.0, + 1202.0, + 1405.0, + 1242.0, + 292.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1236.0, + 1404.0, + 1236.0, + 1404.0, + 1273.0, + 293.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1267.0, + 1270.0, + 1267.0, + 1270.0, + 1300.0, + 296.0, + 1300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1311.0, + 1405.0, + 1311.0, + 1405.0, + 1348.0, + 293.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1344.0, + 1406.0, + 1344.0, + 1406.0, + 1381.0, + 293.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1374.0, + 1405.0, + 1374.0, + 1405.0, + 1410.0, + 294.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1406.0, + 1405.0, + 1406.0, + 1405.0, + 1441.0, + 294.0, + 1441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1435.0, + 1405.0, + 1435.0, + 1405.0, + 1469.0, + 293.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1468.0, + 394.0, + 1468.0, + 394.0, + 1501.0, + 293.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1512.0, + 1405.0, + 1512.0, + 1405.0, + 1548.0, + 294.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1541.0, + 1407.0, + 1541.0, + 1407.0, + 1579.0, + 291.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1573.0, + 1405.0, + 1573.0, + 1405.0, + 1608.0, + 294.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1605.0, + 1135.0, + 1605.0, + 1135.0, + 1640.0, + 294.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1605.0, + 1405.0, + 1605.0, + 1405.0, + 1640.0, + 1183.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1634.0, + 1405.0, + 1634.0, + 1405.0, + 1669.0, + 294.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1664.0, + 1373.0, + 1664.0, + 1373.0, + 1703.0, + 293.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 676.0, + 1109.0, + 676.0, + 1109.0, + 708.0, + 368.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 713.0, + 1404.0, + 713.0, + 1404.0, + 748.0, + 386.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 747.0, + 607.0, + 747.0, + 607.0, + 778.0, + 394.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 783.0, + 1404.0, + 783.0, + 1404.0, + 815.0, + 391.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 815.0, + 638.0, + 815.0, + 638.0, + 848.0, + 395.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 851.0, + 1403.0, + 851.0, + 1403.0, + 887.0, + 390.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 881.0, + 1287.0, + 881.0, + 1287.0, + 919.0, + 393.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 919.0, + 1405.0, + 919.0, + 1405.0, + 957.0, + 389.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 952.0, + 1404.0, + 952.0, + 1404.0, + 986.0, + 394.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 982.0, + 1136.0, + 982.0, + 1136.0, + 1018.0, + 393.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1017.0, + 1353.0, + 1017.0, + 1353.0, + 1058.0, + 368.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 1405.0, + 228.0, + 1405.0, + 263.0, + 295.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 260.0, + 1405.0, + 260.0, + 1405.0, + 295.0, + 295.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 294.0, + 1037.0, + 294.0, + 1037.0, + 324.0, + 298.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 407.0, + 1405.0, + 407.0, + 1405.0, + 444.0, + 294.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 438.0, + 1402.0, + 438.0, + 1402.0, + 472.0, + 294.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 470.0, + 1402.0, + 470.0, + 1402.0, + 503.0, + 294.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 499.0, + 1404.0, + 499.0, + 1404.0, + 536.0, + 293.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 528.0, + 1406.0, + 528.0, + 1406.0, + 565.0, + 292.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 560.0, + 1405.0, + 560.0, + 1405.0, + 594.0, + 294.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 592.0, + 1405.0, + 592.0, + 1405.0, + 625.0, + 294.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 619.0, + 1338.0, + 619.0, + 1338.0, + 656.0, + 293.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1968.0, + 1403.0, + 1968.0, + 1403.0, + 2011.0, + 293.0, + 2011.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": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 295, + 939, + 1440, + 939, + 1440, + 1350, + 295, + 1350 + ], + "score": 0.983, + "html": "
ModelClassificationRegression
AUCAUPRCLossMedAEEV score
Log/LinReg0.772 ± 0.0130.303 ±0.0180.240±0.0033.528 ± 0.0720.043 ± 0.012
SVM0.671 ± 0.0050.300 ± 0.0110.260±0.0023.523 ± 0.0710.042 ± 0.011
AdaBoost0.829 ±0.0070.345 ± 0.0070.663 ±0.0004.517 ± 0.2340.100 ±0.012
RF0.826 ±0.0080.356 ± 0.0100.315 ± 0.0253.113 ± 0.1250.117 ±0.035
GRU-M0.831± 0.0070.376 ± 0.0220.220±0.0043.140 ± 0.1960.131 ± 0.044
GRU-F0.821 ± 0.0070.360 ± 0.0130.224±0.0033.064±0.2470.126 ± 0.025
GRU-S0.843±0.0070.376 ± 0.0140.218 ± 0.0052.900±0.1290.161 ± 0.025
GRU-D0.835 ± 0.0130.359 ± 0.0250.225 ±0.0092.891±0.1030.146 ± 0.051
GRU-HD0.845 ± 0.0060.390 ± 0.0100.215 ±0.0042.893±0.1550.158 ± 0.037
GP-GRU0.847 ± 0.0070.377 ± 0.0170.215 ± 0.0042.847 ± 0.0790.217 ±0.020
Proposed0.853 ±0.0070.418 ± 0.0220.210±0.0042.862±0.1660.245 ± 0.019
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1727, + 1404, + 1727, + 1404, + 2035, + 298, + 2035 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1434, + 1404, + 1434, + 1404, + 1588, + 297, + 1588 + ], + "score": 0.975 + }, + { + "category_id": 3, + "poly": [ + 526, + 230, + 1171, + 230, + 1171, + 663, + 526, + 663 + ], + "score": 0.964 + }, + { + "category_id": 0, + "poly": [ + 301, + 1649, + 815, + 1649, + 815, + 1685, + 301, + 1685 + ], + "score": 0.905 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 815, + 76, + 815, + 104, + 298, + 104 + ], + "score": 0.897 + }, + { + "category_id": 6, + "poly": [ + 299, + 803, + 1404, + 803, + 1404, + 898, + 299, + 898 + ], + "score": 0.814 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.793 + }, + { + "category_id": 4, + "poly": [ + 297, + 695, + 1403, + 695, + 1403, + 760, + 297, + 760 + ], + "score": 0.786 + }, + { + "category_id": 1, + "poly": [ + 297, + 695, + 1403, + 695, + 1403, + 760, + 297, + 760 + ], + "score": 0.216 + }, + { + "category_id": 15, + "poly": [ + 552.0, + 235.0, + 615.0, + 235.0, + 615.0, + 273.0, + 552.0, + 273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 239.0, + 1148.0, + 239.0, + 1148.0, + 274.0, + 1038.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 915.0, + 260.0, + 1027.0, + 260.0, + 1027.0, + 302.0, + 915.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 286.0, + 615.0, + 286.0, + 615.0, + 324.0, + 552.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 336.0, + 616.0, + 336.0, + 616.0, + 375.0, + 553.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 325.0, + 776.0, + 325.0, + 776.0, + 359.0, + 712.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 331.0, + 1051.0, + 331.0, + 1051.0, + 360.0, + 810.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 355.0, + 1001.0, + 355.0, + 1001.0, + 391.0, + 901.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 356.0, + 564.0, + 356.0, + 564.0, + 476.0, + 525.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 360.0, + 750.0, + 360.0, + 750.0, + 371.0, + 736.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 388.0, + 614.0, + 388.0, + 614.0, + 426.0, + 553.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 383.0, + 815.0, + 383.0, + 815.0, + 413.0, + 655.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 441.0, + 614.0, + 441.0, + 614.0, + 476.0, + 552.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 491.0, + 616.0, + 491.0, + 616.0, + 529.0, + 552.0, + 529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 514.0, + 863.0, + 514.0, + 863.0, + 549.0, + 751.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 543.0, + 615.0, + 543.0, + 615.0, + 579.0, + 552.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 543.0, + 734.0, + 543.0, + 734.0, + 585.0, + 625.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 548.0, + 815.0, + 548.0, + 815.0, + 560.0, + 800.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 594.0, + 1155.0, + 594.0, + 1155.0, + 633.0, + 650.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 626.0, + 1089.0, + 626.0, + 1089.0, + 666.0, + 688.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1645.0, + 822.0, + 1645.0, + 822.0, + 1692.0, + 292.0, + 1692.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, + 803.0, + 1404.0, + 803.0, + 1404.0, + 841.0, + 294.0, + 841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 832.0, + 1404.0, + 832.0, + 1404.0, + 871.0, + 292.0, + 871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 864.0, + 400.0, + 864.0, + 400.0, + 900.0, + 294.0, + 900.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, + 694.0, + 1405.0, + 694.0, + 1405.0, + 733.0, + 295.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 724.0, + 1285.0, + 724.0, + 1285.0, + 762.0, + 294.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1728.0, + 1404.0, + 1728.0, + 1404.0, + 1764.0, + 294.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1760.0, + 1404.0, + 1760.0, + 1404.0, + 1794.0, + 293.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1784.0, + 1406.0, + 1784.0, + 1406.0, + 1829.0, + 292.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1820.0, + 1409.0, + 1820.0, + 1409.0, + 1857.0, + 292.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1850.0, + 1406.0, + 1850.0, + 1406.0, + 1885.0, + 293.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1881.0, + 1407.0, + 1881.0, + 1407.0, + 1918.0, + 292.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1910.0, + 1407.0, + 1910.0, + 1407.0, + 1947.0, + 291.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1970.0, + 1406.0, + 1970.0, + 1406.0, + 2007.0, + 293.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 1404.0, + 2002.0, + 1404.0, + 2037.0, + 293.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1433.0, + 1405.0, + 1433.0, + 1405.0, + 1471.0, + 292.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1463.0, + 1406.0, + 1463.0, + 1406.0, + 1503.0, + 291.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1495.0, + 1404.0, + 1495.0, + 1404.0, + 1532.0, + 294.0, + 1532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1526.0, + 1404.0, + 1526.0, + 1404.0, + 1563.0, + 294.0, + 1563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1557.0, + 705.0, + 1557.0, + 705.0, + 1592.0, + 293.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 694.0, + 1405.0, + 694.0, + 1405.0, + 733.0, + 295.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 724.0, + 1285.0, + 724.0, + 1285.0, + 762.0, + 294.0, + 762.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 292, + 229, + 1401, + 229, + 1401, + 293, + 292, + 293 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 297, + 632, + 1404, + 632, + 1404, + 788, + 297, + 788 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 297, + 1107, + 1403, + 1107, + 1403, + 1263, + 297, + 1263 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 301, + 1943, + 1402, + 1943, + 1402, + 2034, + 301, + 2034 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 297, + 1286, + 1403, + 1286, + 1403, + 1410, + 297, + 1410 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 297, + 1792, + 1403, + 1792, + 1403, + 1915, + 297, + 1915 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 297, + 987, + 1405, + 987, + 1405, + 1082, + 297, + 1082 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 299, + 544, + 1402, + 544, + 1402, + 609, + 299, + 609 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 296, + 1642, + 1404, + 1642, + 1404, + 1767, + 296, + 1767 + ], + "score": 0.909 + }, + { + "category_id": 1, + "poly": [ + 296, + 1524, + 1402, + 1524, + 1402, + 1617, + 296, + 1617 + ], + "score": 0.904 + }, + { + "category_id": 1, + "poly": [ + 292, + 410, + 1323, + 410, + 1323, + 443, + 292, + 443 + ], + "score": 0.899 + }, + { + "category_id": 1, + "poly": [ + 292, + 812, + 1399, + 812, + 1399, + 876, + 292, + 876 + ], + "score": 0.896 + }, + { + "category_id": 1, + "poly": [ + 300, + 899, + 1398, + 899, + 1398, + 965, + 300, + 965 + ], + "score": 0.887 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 105, + 300, + 105 + ], + "score": 0.886 + }, + { + "category_id": 1, + "poly": [ + 287, + 1436, + 1400, + 1436, + 1400, + 1500, + 287, + 1500 + ], + "score": 0.875 + }, + { + "category_id": 0, + "poly": [ + 301, + 342, + 625, + 342, + 625, + 376, + 301, + 376 + ], + "score": 0.803 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2111, + 840, + 2111 + ], + "score": 0.75 + }, + { + "category_id": 0, + "poly": [ + 299, + 491, + 489, + 491, + 489, + 526, + 299, + 526 + ], + "score": 0.705 + }, + { + "category_id": 1, + "poly": [ + 299, + 491, + 489, + 491, + 489, + 526, + 299, + 526 + ], + "score": 0.202 + }, + { + "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": [ + 298.0, + 341.0, + 628.0, + 341.0, + 628.0, + 381.0, + 298.0, + 381.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, + 494.0, + 490.0, + 494.0, + 490.0, + 527.0, + 297.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 228.0, + 1406.0, + 228.0, + 1406.0, + 266.0, + 292.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 261.0, + 1273.0, + 261.0, + 1273.0, + 297.0, + 295.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 634.0, + 1404.0, + 634.0, + 1404.0, + 667.0, + 296.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 663.0, + 1404.0, + 663.0, + 1404.0, + 701.0, + 324.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 695.0, + 1402.0, + 695.0, + 1402.0, + 729.0, + 324.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 726.0, + 1404.0, + 726.0, + 1404.0, + 759.0, + 324.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 753.0, + 1325.0, + 753.0, + 1325.0, + 791.0, + 320.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1109.0, + 1404.0, + 1109.0, + 1404.0, + 1142.0, + 296.0, + 1142.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1137.0, + 1404.0, + 1137.0, + 1404.0, + 1173.0, + 322.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1168.0, + 1404.0, + 1168.0, + 1404.0, + 1204.0, + 324.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1200.0, + 1403.0, + 1200.0, + 1403.0, + 1233.0, + 324.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1228.0, + 1347.0, + 1228.0, + 1347.0, + 1266.0, + 320.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1940.0, + 1406.0, + 1940.0, + 1406.0, + 1979.0, + 295.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1974.0, + 1402.0, + 1974.0, + 1402.0, + 2004.0, + 322.0, + 2004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 2002.0, + 1399.0, + 2002.0, + 1399.0, + 2037.0, + 322.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1286.0, + 1404.0, + 1286.0, + 1404.0, + 1322.0, + 293.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1318.0, + 1405.0, + 1318.0, + 1405.0, + 1354.0, + 322.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1346.0, + 1404.0, + 1346.0, + 1404.0, + 1385.0, + 321.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1380.0, + 482.0, + 1380.0, + 482.0, + 1410.0, + 324.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1792.0, + 1407.0, + 1792.0, + 1407.0, + 1828.0, + 293.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1824.0, + 1405.0, + 1824.0, + 1405.0, + 1857.0, + 324.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1851.0, + 1403.0, + 1851.0, + 1403.0, + 1890.0, + 321.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1886.0, + 889.0, + 1886.0, + 889.0, + 1917.0, + 324.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 989.0, + 1405.0, + 989.0, + 1405.0, + 1024.0, + 296.0, + 1024.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1022.0, + 1403.0, + 1022.0, + 1403.0, + 1053.0, + 324.0, + 1053.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1048.0, + 1188.0, + 1048.0, + 1188.0, + 1084.0, + 323.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 543.0, + 1406.0, + 543.0, + 1406.0, + 580.0, + 295.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 575.0, + 1307.0, + 575.0, + 1307.0, + 610.0, + 322.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1644.0, + 1404.0, + 1644.0, + 1404.0, + 1676.0, + 294.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1673.0, + 1405.0, + 1673.0, + 1405.0, + 1708.0, + 321.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1704.0, + 1405.0, + 1704.0, + 1405.0, + 1737.0, + 323.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1736.0, + 1100.0, + 1736.0, + 1100.0, + 1769.0, + 323.0, + 1769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1523.0, + 1402.0, + 1523.0, + 1402.0, + 1560.0, + 295.0, + 1560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1554.0, + 1401.0, + 1554.0, + 1401.0, + 1590.0, + 321.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1587.0, + 590.0, + 1587.0, + 590.0, + 1618.0, + 324.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 409.0, + 1328.0, + 409.0, + 1328.0, + 446.0, + 294.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 809.0, + 1403.0, + 809.0, + 1403.0, + 849.0, + 294.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 843.0, + 1157.0, + 843.0, + 1157.0, + 879.0, + 324.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 902.0, + 1403.0, + 902.0, + 1403.0, + 935.0, + 296.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 929.0, + 1372.0, + 929.0, + 1372.0, + 967.0, + 324.0, + 967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1435.0, + 1403.0, + 1435.0, + 1403.0, + 1473.0, + 293.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1467.0, + 1111.0, + 1467.0, + 1111.0, + 1501.0, + 322.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 494.0, + 490.0, + 494.0, + 490.0, + 527.0, + 297.0, + 527.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1096, + 1404, + 1096, + 1404, + 1192, + 297, + 1192 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.879 + }, + { + "category_id": 1, + "poly": [ + 298, + 981, + 1404, + 981, + 1404, + 1076, + 298, + 1076 + ], + "score": 0.874 + }, + { + "category_id": 1, + "poly": [ + 293, + 1972, + 1406, + 1972, + 1406, + 2034, + 293, + 2034 + ], + "score": 0.865 + }, + { + "category_id": 1, + "poly": [ + 296, + 1414, + 1405, + 1414, + 1405, + 1599, + 296, + 1599 + ], + "score": 0.865 + }, + { + "category_id": 1, + "poly": [ + 295, + 1328, + 1402, + 1328, + 1402, + 1393, + 295, + 1393 + ], + "score": 0.863 + }, + { + "category_id": 1, + "poly": [ + 299, + 834, + 1404, + 834, + 1404, + 959, + 299, + 959 + ], + "score": 0.858 + }, + { + "category_id": 1, + "poly": [ + 298, + 1800, + 1402, + 1800, + 1402, + 1894, + 298, + 1894 + ], + "score": 0.853 + }, + { + "category_id": 1, + "poly": [ + 297, + 1623, + 1404, + 1623, + 1404, + 1778, + 297, + 1778 + ], + "score": 0.847 + }, + { + "category_id": 1, + "poly": [ + 295, + 546, + 1402, + 546, + 1402, + 611, + 295, + 611 + ], + "score": 0.842 + }, + { + "category_id": 1, + "poly": [ + 301, + 1213, + 1401, + 1213, + 1401, + 1307, + 301, + 1307 + ], + "score": 0.84 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 1403, + 228, + 1403, + 354, + 298, + 354 + ], + "score": 0.839 + }, + { + "category_id": 1, + "poly": [ + 292, + 749, + 1399, + 749, + 1399, + 813, + 292, + 813 + ], + "score": 0.834 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.827 + }, + { + "category_id": 1, + "poly": [ + 299, + 1917, + 1121, + 1917, + 1121, + 1950, + 299, + 1950 + ], + "score": 0.818 + }, + { + "category_id": 1, + "poly": [ + 299, + 632, + 1404, + 632, + 1404, + 728, + 299, + 728 + ], + "score": 0.815 + }, + { + "category_id": 1, + "poly": [ + 298, + 460, + 1397, + 460, + 1397, + 526, + 298, + 526 + ], + "score": 0.8 + }, + { + "category_id": 1, + "poly": [ + 298, + 376, + 1398, + 376, + 1398, + 439, + 298, + 439 + ], + "score": 0.782 + }, + { + "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, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1095.0, + 1404.0, + 1095.0, + 1404.0, + 1134.0, + 295.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1127.0, + 1405.0, + 1127.0, + 1405.0, + 1166.0, + 321.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1161.0, + 847.0, + 1161.0, + 847.0, + 1193.0, + 322.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 981.0, + 1405.0, + 981.0, + 1405.0, + 1019.0, + 294.0, + 1019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1010.0, + 1405.0, + 1010.0, + 1405.0, + 1052.0, + 320.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1043.0, + 675.0, + 1043.0, + 675.0, + 1077.0, + 322.0, + 1077.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, + 2003.0, + 1237.0, + 2003.0, + 1237.0, + 2036.0, + 324.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1414.0, + 1406.0, + 1414.0, + 1406.0, + 1453.0, + 294.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1448.0, + 1405.0, + 1448.0, + 1405.0, + 1484.0, + 323.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1473.0, + 1406.0, + 1473.0, + 1406.0, + 1514.0, + 320.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1506.0, + 1403.0, + 1506.0, + 1403.0, + 1542.0, + 324.0, + 1542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1536.0, + 1403.0, + 1536.0, + 1403.0, + 1574.0, + 323.0, + 1574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1569.0, + 458.0, + 1569.0, + 458.0, + 1602.0, + 323.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1328.0, + 1404.0, + 1328.0, + 1404.0, + 1364.0, + 294.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1358.0, + 563.0, + 1358.0, + 563.0, + 1395.0, + 322.0, + 1395.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 832.0, + 1404.0, + 832.0, + 1404.0, + 870.0, + 294.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 867.0, + 1404.0, + 867.0, + 1404.0, + 900.0, + 323.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 897.0, + 1404.0, + 897.0, + 1404.0, + 929.0, + 318.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 928.0, + 486.0, + 928.0, + 486.0, + 959.0, + 322.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1801.0, + 1404.0, + 1801.0, + 1404.0, + 1835.0, + 296.0, + 1835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1832.0, + 1404.0, + 1832.0, + 1404.0, + 1866.0, + 323.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1860.0, + 1387.0, + 1860.0, + 1387.0, + 1897.0, + 322.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1622.0, + 1404.0, + 1622.0, + 1404.0, + 1659.0, + 295.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1654.0, + 1405.0, + 1654.0, + 1405.0, + 1689.0, + 322.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1683.0, + 1404.0, + 1683.0, + 1404.0, + 1720.0, + 324.0, + 1720.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1711.0, + 1402.0, + 1711.0, + 1402.0, + 1752.0, + 320.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1744.0, + 721.0, + 1744.0, + 721.0, + 1779.0, + 323.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 544.0, + 1404.0, + 544.0, + 1404.0, + 586.0, + 294.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 577.0, + 772.0, + 577.0, + 772.0, + 613.0, + 324.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1210.0, + 1405.0, + 1210.0, + 1405.0, + 1252.0, + 294.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1245.0, + 1404.0, + 1245.0, + 1404.0, + 1279.0, + 323.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1275.0, + 686.0, + 1275.0, + 686.0, + 1308.0, + 325.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 231.0, + 1403.0, + 231.0, + 1403.0, + 264.0, + 294.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 259.0, + 1407.0, + 259.0, + 1407.0, + 298.0, + 321.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 292.0, + 1405.0, + 292.0, + 1405.0, + 325.0, + 322.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 323.0, + 1183.0, + 323.0, + 1183.0, + 356.0, + 323.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 746.0, + 1403.0, + 746.0, + 1403.0, + 786.0, + 295.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 781.0, + 954.0, + 781.0, + 954.0, + 813.0, + 322.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1915.0, + 1122.0, + 1915.0, + 1122.0, + 1953.0, + 296.0, + 1953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 633.0, + 1404.0, + 633.0, + 1404.0, + 668.0, + 295.0, + 668.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 662.0, + 1405.0, + 662.0, + 1405.0, + 701.0, + 322.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 697.0, + 1141.0, + 697.0, + 1141.0, + 728.0, + 326.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 458.0, + 1403.0, + 458.0, + 1403.0, + 500.0, + 294.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 492.0, + 1236.0, + 492.0, + 1236.0, + 528.0, + 323.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 373.0, + 1404.0, + 373.0, + 1404.0, + 414.0, + 293.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 408.0, + 928.0, + 408.0, + 928.0, + 439.0, + 323.0, + 439.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1117, + 1405, + 1117, + 1405, + 1394, + 297, + 1394 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1820, + 1403, + 1820, + 1403, + 2036, + 297, + 2036 + ], + "score": 0.979 + }, + { + "category_id": 5, + "poly": [ + 373, + 1477, + 825, + 1477, + 825, + 1729, + 373, + 1729 + ], + "score": 0.956, + "html": "
feature#Missing Sampling Rate
SpO231.35%0.80
HR23.23%0.90
RR59.48%0.48
SBP49.76%0.59
DBP48.73%0.60
Temp83.80%0.19
" + }, + { + "category_id": 5, + "poly": [ + 858, + 1477, + 1323, + 1477, + 1323, + 1729, + 858, + 1729 + ], + "score": 0.911, + "html": "
feature#Missing Sampling Rate
TGCS87.94%0.14
CRR95.08%0.06
UO82.47%0.20
FiO294.82%0.06
Glucose91.47%0.10
pH96.25%0.04
" + }, + { + "category_id": 6, + "poly": [ + 488, + 1421, + 1209, + 1421, + 1209, + 1454, + 488, + 1454 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 816, + 75, + 816, + 105, + 300, + 105 + ], + "score": 0.881 + }, + { + "category_id": 0, + "poly": [ + 300, + 1063, + 649, + 1063, + 649, + 1096, + 300, + 1096 + ], + "score": 0.88 + }, + { + "category_id": 0, + "poly": [ + 301, + 938, + 508, + 938, + 508, + 972, + 301, + 972 + ], + "score": 0.852 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.842 + }, + { + "category_id": 0, + "poly": [ + 301, + 1006, + 666, + 1006, + 666, + 1038, + 301, + 1038 + ], + "score": 0.8 + }, + { + "category_id": 1, + "poly": [ + 300, + 229, + 1400, + 229, + 1400, + 322, + 300, + 322 + ], + "score": 0.623 + }, + { + "category_id": 1, + "poly": [ + 300, + 816, + 1397, + 816, + 1397, + 880, + 300, + 880 + ], + "score": 0.593 + }, + { + "category_id": 1, + "poly": [ + 298, + 1773, + 485, + 1773, + 485, + 1804, + 298, + 1804 + ], + "score": 0.551 + }, + { + "category_id": 1, + "poly": [ + 298, + 733, + 1398, + 733, + 1398, + 798, + 298, + 798 + ], + "score": 0.496 + }, + { + "category_id": 1, + "poly": [ + 301, + 507, + 1400, + 507, + 1400, + 602, + 301, + 602 + ], + "score": 0.475 + }, + { + "category_id": 1, + "poly": [ + 300, + 621, + 1400, + 621, + 1400, + 714, + 300, + 714 + ], + "score": 0.471 + }, + { + "category_id": 1, + "poly": [ + 295, + 342, + 1399, + 342, + 1399, + 406, + 295, + 406 + ], + "score": 0.465 + }, + { + "category_id": 1, + "poly": [ + 290, + 425, + 1401, + 425, + 1401, + 488, + 290, + 488 + ], + "score": 0.43 + }, + { + "category_id": 1, + "poly": [ + 301, + 1006, + 666, + 1006, + 666, + 1038, + 301, + 1038 + ], + "score": 0.118 + }, + { + "category_id": 6, + "poly": [ + 298, + 1773, + 485, + 1773, + 485, + 1804, + 298, + 1804 + ], + "score": 0.092 + }, + { + "category_id": 13, + "poly": [ + 756, + 2002, + 1087, + 2002, + 1087, + 2036, + 756, + 2036 + ], + "score": 0.93, + "latex": "\\mathcal { D } = \\{ ( \\mathbf { s _ { n } } , y _ { n } ) | n = 1 , . . . , N \\}" + }, + { + "category_id": 13, + "poly": [ + 894, + 1913, + 984, + 1913, + 984, + 1944, + 894, + 1944 + ], + "score": 0.91, + "latex": "y _ { n } = 1" + }, + { + "category_id": 13, + "poly": [ + 1120, + 1821, + 1211, + 1821, + 1211, + 1853, + 1120, + 1853 + ], + "score": 0.91, + "latex": "( \\mathbf { s } _ { \\mathbf { n } } , y _ { n } )" + }, + { + "category_id": 13, + "poly": [ + 1016, + 1944, + 1111, + 1944, + 1111, + 1974, + 1016, + 1974 + ], + "score": 0.9, + "latex": "y _ { n } ~ = ~ 0" + }, + { + "category_id": 13, + "poly": [ + 1314, + 1974, + 1401, + 1974, + 1401, + 2003, + 1314, + 2003 + ], + "score": 0.89, + "latex": "y _ { n } = 1" + }, + { + "category_id": 13, + "poly": [ + 1075, + 1853, + 1182, + 1853, + 1182, + 1879, + 1075, + 1879 + ], + "score": 0.89, + "latex": "D \\ = \\ 1 2" + }, + { + "category_id": 13, + "poly": [ + 974, + 1855, + 1007, + 1855, + 1007, + 1882, + 974, + 1882 + ], + "score": 0.87, + "latex": "{ \\bf s } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 480, + 1885, + 512, + 1885, + 512, + 1912, + 480, + 1912 + ], + "score": 0.86, + "latex": "{ \\bf s } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 545, + 1916, + 578, + 1916, + 578, + 1944, + 545, + 1944 + ], + "score": 0.86, + "latex": "y _ { n }" + }, + { + "category_id": 13, + "poly": [ + 423, + 1882, + 442, + 1882, + 442, + 1910, + 423, + 1910 + ], + "score": 0.76, + "latex": "d" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1974, + 1138, + 1974, + 1138, + 2003, + 1062, + 2003 + ], + "score": 0.74, + "latex": "( 8 . 1 \\% )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1857, + 318, + 1857, + 318, + 1878, + 297, + 1878 + ], + "score": 0.65, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1251, + 2004, + 1401, + 2004, + 1401, + 2034, + 1251, + 2034 + ], + "score": 0.55, + "latex": "N = 5 3 , 2 1 1" + }, + { + "category_id": 15, + "poly": [ + 487.0, + 1415.0, + 1212.0, + 1415.0, + 1212.0, + 1461.0, + 487.0, + 1461.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, + 1063.0, + 652.0, + 1063.0, + 652.0, + 1099.0, + 296.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 932.0, + 514.0, + 932.0, + 514.0, + 981.0, + 294.0, + 981.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, + 1008.0, + 669.0, + 1008.0, + 669.0, + 1041.0, + 298.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1771.0, + 487.0, + 1771.0, + 487.0, + 1807.0, + 295.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1118.0, + 1405.0, + 1118.0, + 1405.0, + 1151.0, + 297.0, + 1151.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": [ + 292.0, + 1176.0, + 1407.0, + 1176.0, + 1407.0, + 1214.0, + 292.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1208.0, + 1405.0, + 1208.0, + 1405.0, + 1245.0, + 292.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1238.0, + 1405.0, + 1238.0, + 1405.0, + 1274.0, + 292.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1269.0, + 1407.0, + 1269.0, + 1407.0, + 1305.0, + 294.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1297.0, + 1405.0, + 1297.0, + 1405.0, + 1335.0, + 292.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1327.0, + 1405.0, + 1327.0, + 1405.0, + 1365.0, + 292.0, + 1365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1362.0, + 1368.0, + 1362.0, + 1368.0, + 1398.0, + 295.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1817.0, + 1119.0, + 1817.0, + 1119.0, + 1856.0, + 294.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1212.0, + 1817.0, + 1405.0, + 1817.0, + 1405.0, + 1856.0, + 1212.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1851.0, + 296.0, + 1851.0, + 296.0, + 1884.0, + 292.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1851.0, + 973.0, + 1851.0, + 973.0, + 1884.0, + 319.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1008.0, + 1851.0, + 1074.0, + 1851.0, + 1074.0, + 1884.0, + 1008.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 1851.0, + 1405.0, + 1851.0, + 1405.0, + 1884.0, + 1183.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1881.0, + 422.0, + 1881.0, + 422.0, + 1916.0, + 295.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 443.0, + 1881.0, + 479.0, + 1881.0, + 479.0, + 1916.0, + 443.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 1881.0, + 1405.0, + 1881.0, + 1405.0, + 1916.0, + 513.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1909.0, + 544.0, + 1909.0, + 544.0, + 1949.0, + 292.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 579.0, + 1909.0, + 893.0, + 1909.0, + 893.0, + 1949.0, + 579.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1909.0, + 1405.0, + 1909.0, + 1405.0, + 1949.0, + 985.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1942.0, + 1015.0, + 1942.0, + 1015.0, + 1977.0, + 292.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1977.0, + 1112.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1970.0, + 1061.0, + 1970.0, + 1061.0, + 2009.0, + 292.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 1970.0, + 1313.0, + 1970.0, + 1313.0, + 2009.0, + 1139.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1970.0, + 1408.0, + 1970.0, + 1408.0, + 2009.0, + 1402.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2001.0, + 755.0, + 2001.0, + 755.0, + 2038.0, + 292.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 2001.0, + 1250.0, + 2001.0, + 1250.0, + 2038.0, + 1088.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 2001.0, + 1405.0, + 2001.0, + 1405.0, + 2038.0, + 1402.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 1405.0, + 230.0, + 1405.0, + 263.0, + 295.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 259.0, + 1406.0, + 259.0, + 1406.0, + 298.0, + 321.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 293.0, + 623.0, + 293.0, + 623.0, + 322.0, + 321.0, + 322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 816.0, + 1403.0, + 816.0, + 1403.0, + 852.0, + 295.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 847.0, + 1022.0, + 847.0, + 1022.0, + 883.0, + 322.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1771.0, + 487.0, + 1771.0, + 487.0, + 1807.0, + 295.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 735.0, + 1403.0, + 735.0, + 1403.0, + 771.0, + 294.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 766.0, + 1175.0, + 766.0, + 1175.0, + 799.0, + 322.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 505.0, + 1406.0, + 505.0, + 1406.0, + 545.0, + 292.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 541.0, + 1404.0, + 541.0, + 1404.0, + 572.0, + 325.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 569.0, + 1258.0, + 569.0, + 1258.0, + 604.0, + 321.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 618.0, + 1405.0, + 618.0, + 1405.0, + 659.0, + 294.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 651.0, + 1405.0, + 651.0, + 1405.0, + 689.0, + 320.0, + 689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 682.0, + 624.0, + 682.0, + 624.0, + 714.0, + 320.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 341.0, + 1403.0, + 341.0, + 1403.0, + 377.0, + 294.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 374.0, + 1237.0, + 374.0, + 1237.0, + 407.0, + 321.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 423.0, + 1403.0, + 423.0, + 1403.0, + 462.0, + 294.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 457.0, + 961.0, + 457.0, + 961.0, + 490.0, + 321.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1008.0, + 669.0, + 1008.0, + 669.0, + 1041.0, + 298.0, + 1041.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 308, + 1403, + 308, + 1403, + 492, + 298, + 492 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1850, + 1403, + 1850, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1564, + 1403, + 1564, + 1403, + 1748, + 298, + 1748 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 593, + 1403, + 593, + 1403, + 745, + 299, + 745 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 911, + 1404, + 911, + 1404, + 1157, + 298, + 1157 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1310, + 1403, + 1310, + 1403, + 1463, + 299, + 1463 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1172, + 1403, + 1172, + 1403, + 1293, + 299, + 1293 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 296, + 229, + 1400, + 229, + 1400, + 292, + 296, + 292 + ], + "score": 0.953 + }, + { + "category_id": 0, + "poly": [ + 301, + 854, + 618, + 854, + 618, + 886, + 301, + 886 + ], + "score": 0.908 + }, + { + "category_id": 0, + "poly": [ + 300, + 534, + 604, + 534, + 604, + 566, + 300, + 566 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 300, + 1507, + 531, + 1507, + 531, + 1539, + 300, + 1539 + ], + "score": 0.898 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.897 + }, + { + "category_id": 0, + "poly": [ + 302, + 794, + 699, + 794, + 699, + 825, + 302, + 825 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 299, + 1792, + 552, + 1792, + 552, + 1825, + 299, + 1825 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 837, + 2088, + 864, + 2088, + 864, + 2112, + 837, + 2112 + ], + "score": 0.844 + }, + { + "category_id": 13, + "poly": [ + 993, + 399, + 1342, + 399, + 1342, + 433, + 993, + 433 + ], + "score": 0.93, + "latex": "\\mathcal { D } = \\{ ( \\mathbf { s _ { n } } , y _ { n } ) | n = 1 , . . . , N \\}" + }, + { + "category_id": 13, + "poly": [ + 805, + 461, + 943, + 461, + 943, + 494, + 805, + 494 + ], + "score": 0.93, + "latex": "{ \\hat { y } } _ { n } \\gets g ( \\mathbf { s } _ { n } )" + }, + { + "category_id": 13, + "poly": [ + 297, + 261, + 435, + 261, + 435, + 296, + 297, + 296 + ], + "score": 0.92, + "latex": "\\hat { y } _ { n } \\gets g ( \\mathbf { s } _ { n } )" + }, + { + "category_id": 13, + "poly": [ + 518, + 1943, + 614, + 1943, + 614, + 1973, + 518, + 1973 + ], + "score": 0.9, + "latex": "\\delta _ { R } = 1 \\mathrm { \\Delta }" + }, + { + "category_id": 13, + "poly": [ + 1021, + 462, + 1052, + 462, + 1052, + 493, + 1021, + 493 + ], + "score": 0.89, + "latex": "{ \\hat { y } } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 513, + 263, + 545, + 263, + 545, + 294, + 513, + 294 + ], + "score": 0.89, + "latex": "{ \\hat { y } } _ { n }" + }, + { + "category_id": 13, + "poly": [ + 856, + 1234, + 911, + 1234, + 911, + 1263, + 856, + 1263 + ], + "score": 0.88, + "latex": "2 0 \\%" + }, + { + "category_id": 13, + "poly": [ + 1276, + 685, + 1330, + 685, + 1330, + 714, + 1276, + 714 + ], + "score": 0.87, + "latex": "10 \\%" + }, + { + "category_id": 13, + "poly": [ + 454, + 655, + 509, + 655, + 509, + 684, + 454, + 684 + ], + "score": 0.86, + "latex": "30 \\%" + }, + { + "category_id": 13, + "poly": [ + 588, + 315, + 620, + 315, + 620, + 341, + 588, + 341 + ], + "score": 0.86, + "latex": "y _ { n }" + }, + { + "category_id": 13, + "poly": [ + 1025, + 343, + 1057, + 343, + 1057, + 371, + 1025, + 371 + ], + "score": 0.86, + "latex": "y _ { n }" + }, + { + "category_id": 13, + "poly": [ + 652, + 465, + 670, + 465, + 670, + 493, + 652, + 493 + ], + "score": 0.8, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 1241, + 237, + 1260, + 237, + 1260, + 263, + 1241, + 263 + ], + "score": 0.79, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 1349, + 1312, + 1392, + 1312, + 1392, + 1340, + 1349, + 1340 + ], + "score": 0.73, + "latex": "\\scriptstyle { \\mathrm { t } } = 0" + }, + { + "category_id": 13, + "poly": [ + 298, + 430, + 394, + 430, + 394, + 459, + 298, + 459 + ], + "score": 0.5, + "latex": "N = 5 3" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 853.0, + 623.0, + 853.0, + 623.0, + 890.0, + 296.0, + 890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 534.0, + 608.0, + 534.0, + 608.0, + 570.0, + 297.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1504.0, + 535.0, + 1504.0, + 535.0, + 1543.0, + 295.0, + 1543.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": [ + 297.0, + 793.0, + 702.0, + 793.0, + 702.0, + 829.0, + 297.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1793.0, + 557.0, + 1793.0, + 557.0, + 1832.0, + 295.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 833.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 306.0, + 587.0, + 306.0, + 587.0, + 344.0, + 292.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 621.0, + 306.0, + 1405.0, + 306.0, + 1405.0, + 344.0, + 621.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 337.0, + 1024.0, + 337.0, + 1024.0, + 372.0, + 294.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 337.0, + 1404.0, + 337.0, + 1404.0, + 372.0, + 1058.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 370.0, + 1405.0, + 370.0, + 1405.0, + 401.0, + 296.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 397.0, + 992.0, + 397.0, + 992.0, + 437.0, + 293.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 397.0, + 1407.0, + 397.0, + 1407.0, + 437.0, + 1343.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 425.0, + 297.0, + 425.0, + 297.0, + 466.0, + 293.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 425.0, + 1407.0, + 425.0, + 1407.0, + 466.0, + 395.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 461.0, + 651.0, + 461.0, + 651.0, + 496.0, + 292.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 671.0, + 461.0, + 804.0, + 461.0, + 804.0, + 496.0, + 671.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 461.0, + 1020.0, + 461.0, + 1020.0, + 496.0, + 944.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 461.0, + 1302.0, + 461.0, + 1302.0, + 496.0, + 1053.0, + 496.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, + 1876.0, + 1403.0, + 1876.0, + 1403.0, + 1921.0, + 293.0, + 1921.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, + 1942.0, + 517.0, + 1942.0, + 517.0, + 1976.0, + 293.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1976.0, + 615.0, + 1976.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": [ + 293.0, + 2003.0, + 1043.0, + 2003.0, + 1043.0, + 2038.0, + 293.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1565.0, + 1407.0, + 1565.0, + 1407.0, + 1600.0, + 294.0, + 1600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1594.0, + 1405.0, + 1594.0, + 1405.0, + 1632.0, + 293.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1626.0, + 1405.0, + 1626.0, + 1405.0, + 1661.0, + 293.0, + 1661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1657.0, + 1404.0, + 1657.0, + 1404.0, + 1689.0, + 294.0, + 1689.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1689.0, + 1404.0, + 1689.0, + 1404.0, + 1721.0, + 294.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1719.0, + 551.0, + 1719.0, + 551.0, + 1747.0, + 296.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 592.0, + 1405.0, + 592.0, + 1405.0, + 627.0, + 295.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 623.0, + 1404.0, + 623.0, + 1404.0, + 656.0, + 294.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 652.0, + 453.0, + 652.0, + 453.0, + 690.0, + 293.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 652.0, + 1405.0, + 652.0, + 1405.0, + 690.0, + 510.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 685.0, + 1275.0, + 685.0, + 1275.0, + 718.0, + 295.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1331.0, + 685.0, + 1404.0, + 685.0, + 1404.0, + 718.0, + 1331.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 714.0, + 1287.0, + 714.0, + 1287.0, + 750.0, + 294.0, + 750.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": [ + 293.0, + 941.0, + 1404.0, + 941.0, + 1404.0, + 978.0, + 293.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 973.0, + 1403.0, + 973.0, + 1403.0, + 1006.0, + 295.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1000.0, + 1405.0, + 1000.0, + 1405.0, + 1040.0, + 292.0, + 1040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1035.0, + 1404.0, + 1035.0, + 1404.0, + 1065.0, + 296.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1063.0, + 1404.0, + 1063.0, + 1404.0, + 1099.0, + 293.0, + 1099.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1096.0, + 1405.0, + 1096.0, + 1405.0, + 1130.0, + 294.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1124.0, + 736.0, + 1124.0, + 736.0, + 1160.0, + 293.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1309.0, + 1348.0, + 1309.0, + 1348.0, + 1346.0, + 294.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1309.0, + 1404.0, + 1309.0, + 1404.0, + 1346.0, + 1393.0, + 1346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1340.0, + 1405.0, + 1340.0, + 1405.0, + 1377.0, + 295.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1371.0, + 1403.0, + 1371.0, + 1403.0, + 1404.0, + 295.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1404.0, + 1404.0, + 1404.0, + 1404.0, + 1437.0, + 295.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1431.0, + 471.0, + 1431.0, + 471.0, + 1464.0, + 293.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1171.0, + 1405.0, + 1171.0, + 1405.0, + 1207.0, + 294.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1203.0, + 1404.0, + 1203.0, + 1404.0, + 1238.0, + 294.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1234.0, + 855.0, + 1234.0, + 855.0, + 1269.0, + 294.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 912.0, + 1234.0, + 1404.0, + 1234.0, + 1404.0, + 1269.0, + 912.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1266.0, + 561.0, + 1266.0, + 561.0, + 1298.0, + 295.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 225.0, + 1240.0, + 225.0, + 1240.0, + 267.0, + 294.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 225.0, + 1405.0, + 225.0, + 1405.0, + 267.0, + 1261.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 262.0, + 512.0, + 262.0, + 512.0, + 297.0, + 436.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 262.0, + 760.0, + 262.0, + 760.0, + 297.0, + 546.0, + 297.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 301, + 1497, + 1398, + 1497, + 1398, + 1797, + 301, + 1797 + ], + "score": 0.983, + "html": "
ModelClassificationRegression
AUCAUPRCLossMedAEEV score
SI, T,I0.853 ± 0.0070.418 ± 0.0220.210 ± 0.0042.862 ±0.1660.245 ± 0.019
SI,I0.852 ± 0.0050.408 ± 0.0170.210± 0.0042.745 ±0.0620.224±0.010
SI,T0.820 ±0.0080.355 ± 0.0240.226 ±0.0052.911 ± 0.0730.182 ± 0.009
SI0.816 ±0.0090.354±0.0180.226 ±0.0053.035 ± 0.0630.183 ± 0.016
I0.786 ± 0.0100.250 ±0.0120.241±0.0032.697± 0.0720.251±0.009
I,T0.755 ± 0.0120.236 ± 0.0140.272 ±0.0102.738 ±0.1010.290 ±0.010
T0.705 ± 0.0090.192 ±0.0080.281±0.0042.995±0.1300.207±0.024
" + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1404, + 229, + 1404, + 445, + 298, + 445 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 536, + 1404, + 536, + 1404, + 751, + 298, + 751 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1850, + 1402, + 1850, + 1402, + 2034, + 298, + 2034 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1124, + 1403, + 1124, + 1403, + 1339, + 298, + 1339 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 849, + 1403, + 849, + 1403, + 1001, + 299, + 1001 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1017, + 1403, + 1017, + 1403, + 1109, + 299, + 1109 + ], + "score": 0.971 + }, + { + "category_id": 6, + "poly": [ + 297, + 1365, + 1404, + 1365, + 1404, + 1459, + 297, + 1459 + ], + "score": 0.971 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 837, + 2088, + 864, + 2088, + 864, + 2112, + 837, + 2112 + ], + "score": 0.851 + }, + { + "category_id": 0, + "poly": [ + 301, + 790, + 705, + 790, + 705, + 820, + 301, + 820 + ], + "score": 0.84 + }, + { + "category_id": 0, + "poly": [ + 299, + 481, + 508, + 481, + 508, + 512, + 299, + 512 + ], + "score": 0.779 + }, + { + "category_id": 1, + "poly": [ + 299, + 481, + 508, + 481, + 508, + 512, + 299, + 512 + ], + "score": 0.113 + }, + { + "category_id": 13, + "poly": [ + 765, + 565, + 961, + 565, + 961, + 600, + 765, + 600 + ], + "score": 0.93, + "latex": "\\{ 2 ^ { 5 } , 2 ^ { 6 } , \\cdots , 2 ^ { 1 1 } \\}" + }, + { + "category_id": 13, + "poly": [ + 514, + 910, + 606, + 910, + 606, + 938, + 514, + 938 + ], + "score": 0.9, + "latex": "D = 1 2" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1362.0, + 1404.0, + 1362.0, + 1404.0, + 1401.0, + 294.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1396.0, + 1404.0, + 1396.0, + 1404.0, + 1430.0, + 295.0, + 1430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1427.0, + 1242.0, + 1427.0, + 1242.0, + 1462.0, + 294.0, + 1462.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": [ + 830.0, + 2086.0, + 868.0, + 2086.0, + 868.0, + 2121.0, + 830.0, + 2121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 789.0, + 709.0, + 789.0, + 709.0, + 824.0, + 296.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 478.0, + 513.0, + 478.0, + 513.0, + 516.0, + 297.0, + 516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 1406.0, + 228.0, + 1406.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 260.0, + 1402.0, + 260.0, + 1402.0, + 295.0, + 294.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 291.0, + 1404.0, + 291.0, + 1404.0, + 326.0, + 293.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 321.0, + 1405.0, + 321.0, + 1405.0, + 357.0, + 292.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 351.0, + 1404.0, + 351.0, + 1404.0, + 386.0, + 293.0, + 386.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 383.0, + 1406.0, + 383.0, + 1406.0, + 417.0, + 294.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 412.0, + 1042.0, + 412.0, + 1042.0, + 449.0, + 295.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 534.0, + 1405.0, + 534.0, + 1405.0, + 572.0, + 294.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 561.0, + 764.0, + 561.0, + 764.0, + 603.0, + 292.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 561.0, + 1406.0, + 561.0, + 1406.0, + 603.0, + 962.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 594.0, + 1404.0, + 594.0, + 1404.0, + 632.0, + 293.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 628.0, + 1404.0, + 628.0, + 1404.0, + 662.0, + 293.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 655.0, + 1405.0, + 655.0, + 1405.0, + 694.0, + 293.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 684.0, + 1406.0, + 684.0, + 1406.0, + 726.0, + 292.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 719.0, + 1126.0, + 719.0, + 1126.0, + 753.0, + 293.0, + 753.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, + 1912.0, + 1406.0, + 1912.0, + 1406.0, + 1946.0, + 292.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 1404.0, + 1941.0, + 1404.0, + 1978.0, + 293.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2005.0, + 296.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2003.0, + 1404.0, + 2003.0, + 1404.0, + 2037.0, + 293.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1123.0, + 1404.0, + 1123.0, + 1404.0, + 1160.0, + 293.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1158.0, + 1400.0, + 1158.0, + 1400.0, + 1188.0, + 296.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1187.0, + 1404.0, + 1187.0, + 1404.0, + 1222.0, + 294.0, + 1222.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1218.0, + 1405.0, + 1218.0, + 1405.0, + 1252.0, + 293.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1246.0, + 1404.0, + 1246.0, + 1404.0, + 1281.0, + 294.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1278.0, + 1404.0, + 1278.0, + 1404.0, + 1313.0, + 294.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1309.0, + 548.0, + 1309.0, + 548.0, + 1340.0, + 296.0, + 1340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 849.0, + 1403.0, + 849.0, + 1403.0, + 882.0, + 295.0, + 882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 879.0, + 1405.0, + 879.0, + 1405.0, + 913.0, + 293.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 907.0, + 513.0, + 907.0, + 513.0, + 946.0, + 293.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 907.0, + 1405.0, + 907.0, + 1405.0, + 946.0, + 607.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 942.0, + 1404.0, + 942.0, + 1404.0, + 975.0, + 293.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 970.0, + 870.0, + 970.0, + 870.0, + 1008.0, + 294.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1015.0, + 1405.0, + 1015.0, + 1405.0, + 1051.0, + 294.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1049.0, + 1405.0, + 1049.0, + 1405.0, + 1081.0, + 294.0, + 1081.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1080.0, + 516.0, + 1080.0, + 516.0, + 1111.0, + 297.0, + 1111.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 478.0, + 513.0, + 478.0, + 513.0, + 516.0, + 297.0, + 516.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 464, + 955, + 1234, + 955, + 1234, + 1175, + 464, + 1175 + ], + "score": 0.981, + "html": "
ModelAUC scoreAUPRC score
Logistic Regression0.84850.4744
LSTM0.85470.4848
LSTM+ Deep Supervision0.85580.4928
MultitaskLSTM0.86070.4933
Interpolation Network +LSTM0.86100.5370
" + }, + { + "category_id": 1, + "poly": [ + 298, + 556, + 1404, + 556, + 1404, + 861, + 298, + 861 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 300, + 417, + 1403, + 417, + 1403, + 540, + 300, + 540 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 300, + 229, + 1402, + 229, + 1402, + 323, + 300, + 323 + ], + "score": 0.962 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.897 + }, + { + "category_id": 0, + "poly": [ + 303, + 359, + 787, + 359, + 787, + 391, + 303, + 391 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 836, + 2089, + 865, + 2089, + 865, + 2112, + 836, + 2112 + ], + "score": 0.845 + }, + { + "category_id": 6, + "poly": [ + 296, + 884, + 1395, + 884, + 1395, + 919, + 296, + 919 + ], + "score": 0.829 + }, + { + "category_id": 6, + "poly": [ + 308, + 885, + 1393, + 885, + 1393, + 950, + 308, + 950 + ], + "score": 0.313 + }, + { + "category_id": 13, + "poly": [ + 1250, + 449, + 1312, + 449, + 1312, + 478, + 1250, + 478 + ], + "score": 0.75, + "latex": "> 1 8" + }, + { + "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, + 355.0, + 793.0, + 355.0, + 793.0, + 397.0, + 296.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 871.0, + 2085.0, + 871.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 882.0, + 1399.0, + 882.0, + 1399.0, + 921.0, + 302.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 880.0, + 1400.0, + 880.0, + 1400.0, + 921.0, + 301.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 555.0, + 1405.0, + 555.0, + 1405.0, + 591.0, + 296.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 586.0, + 1406.0, + 586.0, + 1406.0, + 621.0, + 294.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 619.0, + 1405.0, + 619.0, + 1405.0, + 650.0, + 296.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 649.0, + 1404.0, + 649.0, + 1404.0, + 681.0, + 296.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 677.0, + 1405.0, + 677.0, + 1405.0, + 712.0, + 294.0, + 712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 706.0, + 1405.0, + 706.0, + 1405.0, + 746.0, + 292.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 736.0, + 1402.0, + 736.0, + 1402.0, + 772.0, + 294.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 769.0, + 1404.0, + 769.0, + 1404.0, + 805.0, + 294.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 798.0, + 1405.0, + 798.0, + 1405.0, + 833.0, + 293.0, + 833.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 829.0, + 453.0, + 829.0, + 453.0, + 864.0, + 295.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 416.0, + 1404.0, + 416.0, + 1404.0, + 452.0, + 293.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 448.0, + 1249.0, + 448.0, + 1249.0, + 481.0, + 296.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1313.0, + 448.0, + 1402.0, + 448.0, + 1402.0, + 481.0, + 1313.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 479.0, + 1405.0, + 479.0, + 1405.0, + 513.0, + 294.0, + 513.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 506.0, + 903.0, + 506.0, + 903.0, + 546.0, + 293.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1402.0, + 229.0, + 1402.0, + 266.0, + 295.0, + 266.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": [ + 295.0, + 292.0, + 830.0, + 292.0, + 830.0, + 326.0, + 295.0, + 326.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/r1eowANFvr/r1eowANFvr_layout.pdf b/parse/train/r1eowANFvr/r1eowANFvr_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..30e365d3207595bf887333a459cb5e4014b81d46 --- /dev/null +++ b/parse/train/r1eowANFvr/r1eowANFvr_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0c684ca8fa8a971a913e509e331679c8a4064a6819b4be7ee1952f10842f0336 +size 1662223 diff --git a/parse/train/r1eowANFvr/r1eowANFvr_origin.pdf b/parse/train/r1eowANFvr/r1eowANFvr_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..be02ee438f1120e74a3bc14fb33e6cbb0a5a8def --- /dev/null +++ b/parse/train/r1eowANFvr/r1eowANFvr_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bfff668eea503760804b23c32e27f5586e42594464c204ddeca4e4c7410bd68a +size 1470276 diff --git a/parse/train/r1eowANFvr/r1eowANFvr_span.pdf b/parse/train/r1eowANFvr/r1eowANFvr_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..78c5fe1057bdf08dd369246b830afec6bcb28c00 --- /dev/null +++ b/parse/train/r1eowANFvr/r1eowANFvr_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:62b703ee864a1dfcc4d2e502ed3cb6a1db830541d8b53db6a9d5ac48b44c8cc6 +size 1675521 diff --git a/parse/train/r1lohoCqY7/r1lohoCqY7.md b/parse/train/r1lohoCqY7/r1lohoCqY7.md new file mode 100644 index 0000000000000000000000000000000000000000..11fc06f02c18f88a3e0d5daa0723f50ad3c9d924 --- /dev/null +++ b/parse/train/r1lohoCqY7/r1lohoCqY7.md @@ -0,0 +1,575 @@ +# LEARNING-BASED FREQUENCY ESTIMATION ALGORITHMS + +Chen-Yu Hsu, Piotr Indyk, Dina Katabi & Ali Vakilian + +Computer Science and Artificial Intelligence Lab Massachusetts Institute of Technology Cambridge, MA 02139, USA {cyhsu,indyk,dk,vakilian}@mit.edu + +# ABSTRACT + +Estimating the frequencies of elements in a data stream is a fundamental task in data analysis and machine learning. The problem is typically addressed using streaming algorithms which can process very large data using limited storage. Today’s streaming algorithms, however, cannot exploit patterns in their input to improve performance. We propose a new class of algorithms that automatically learn relevant patterns in the input data and use them to improve its frequency estimates. The proposed algorithms combine the benefits of machine learning with the formal guarantees available through algorithm theory. We prove that our learning-based algorithms have lower estimation errors than their non-learning counterparts. We also evaluate our algorithms on two real-world datasets and demonstrate empirically their performance gains. + +# 1. INTRODUCTION + +Classical algorithms provide formal guarantees over their performance, but often fail to leverage useful patterns in their input data to improve their output. On the other hand, deep learning models are highly successful at capturing and utilizing complex data patterns, but often lack formal error bounds. The last few years have witnessed a growing effort to bridge this gap and introduce algorithms that can adapt to data properties while delivering worst case guarantees. Deep learning modules have been integrated into the design of Bloom filters (Kraska et al., 2018; Mitzenmacher, 2018), caching algorithms (Lykouris & Vassilvitskii, 2018), graph optimization (Dai et al., 2017), similarity search (Salakhutdinov & Hinton, 2009; Weiss et al., 2009) and compressive sensing (Bora et al., 2017). This paper makes a significant step toward this vision by introducing frequency estimation streaming algorithms that automatically learn to leverage the properties of the input data. + +Estimating the frequencies of elements in a data stream is one of the most fundamental subroutines in data analysis. It has applications in many areas of machine learning, including feature selection (Aghazadeh et al., 2018), ranking (Dzogang et al., 2015), semi-supervised learning (Talukdar & Cohen, 2014) and natural language processing (Goyal et al., 2012). It has been also used for network measurements (Estan & Varghese, 2003; Yu et al., 2013; Liu et al., 2016) and security (Schechter et al., 2010). Frequency estimation algorithms have been implemented in popular data processing libraries, such as Algebird at Twitter (Boykin et al., 2016). They can answer practical questions like: what are the most searched words on the Internet? or how much traffic is sent between any two machines in a network? + +The frequency estimation problem is formalized as follows: given a sequence $S$ of elements from some universe $U$ , for any element $i \in U$ , estimate $f _ { i }$ , the number of times $i$ occurs in $S$ . If one could store all arrivals from the stream $S$ , one could sort the elements and compute their frequencies. However, in big data applications, the stream is too large (and may be infinite) and cannot be stored. This challenge has motivated the development of streaming algorithms, which read the elements of $S$ in a single pass and compute a good estimate of the frequencies using a limited amount of space.1 Over the last two decades, many such streaming algorithms have been developed, including + +Count-Sketch (Charikar et al., 2002), Count-Min (Cormode & Muthukrishnan, 2005b) and multistage filters (Estan & Varghese, 2003). The performance guarantees of these algorithms are wellunderstood, with upper and lower bounds matching up to $O ( \cdot )$ factors (Jowhari et al., 2011). + +However, such streaming algorithms typically assume generic data and do not leverage useful patterns or properties of their input. For example, in text data, the word frequency is known to be inversely correlated with the length of the word. Analogously, in network data, certain applications tend to generate more traffic than others. If such properties can be harnessed, one could design frequency estimation algorithms that are much more efficient than the existing ones. Yet, it is important to do so in a general framework that can harness various useful properties, instead of using handcrafted methods specific to a particular pattern or structure (e.g., word length, application type). + +In this paper, we introduce learning-based frequency estimation streaming algorithms. Our algorithms are equipped with a learning model that enables them to exploit data properties without being specific to a particular pattern or knowing the useful property a priori. We further provide theoretical analysis of the guarantees associated with such learning-based algorithms. + +We focus on the important class of “hashing-based” algorithms, which includes some of the most used algorithms such as Count-Min, Count-Median and Count-Sketch. Informally, these algorithms hash data items into $B$ buckets, count the number of items hashed into each bucket, and use the bucket value as an estimate of item frequency. The process can be repeated using multiple hash functions to improve accuracy. Hashing-based algorithms have several useful properties. In particular, they can handle item deletions, which are implemented by decrementing the respective counters. Furthermore, some of them (notably Count-Min) never underestimate the true frequencies, i.e., $\tilde { f _ { i } } \geq f _ { i }$ holds always. However, hashing algorithms lead to estimation errors due to collisions: when two elements are mapped to the same bucket, they affect each others’ estimates. Although collisions are unavoidable given the space constraints, the overall error significantly depends on the pattern of collisions. For example, collisions between high-frequency elements (“heavy hitters”) result in a large estimation error, and ideally should be minimized. The existing algorithms, however, use random hash functions, which means that collisions are controlled only probabilistically. + +Our idea is to use a small subset of $S$ , call it $S ^ { \prime }$ , to learn the heavy hitters. We can then assign heavy hitters their own buckets to avoid the more costly collisions. It is important to emphasize that we are learning the properties that identify heavy hitters as opposed to the identities of the heavy hitters themselves. For example, in the word frequency case, shorter words tend to be more popular. The subset $S ^ { \prime }$ itself may miss many of the popular words, but whichever words popular in $S ^ { \prime }$ are likely to be short. Our objective is not to learn the identity of high frequency words using $S ^ { \prime }$ . Rather, we hope that a learning model trained on $S ^ { \prime }$ learns that short words are more frequent, so that it can identify popular words even if they did not appear in $S ^ { \prime }$ . + +Our main contributions are as follows: + +• We introduce learning-based frequency estimation streaming algorithms, which learn the properties of heavy hitters in their input and exploit this information to reduce errors • We provide performance guarantees showing that our algorithms can deliver a logarithmic factor improvement in the error bound over their non-learning counterparts. Furthermore, we show that our learning-based instantiation of Count-Min, a widely used algorithm, is asymptotically optimal among all instantiations of that algorithm. See Table 4.1 in section 4.1 for the details. We evaluate our learning-based algorithms using two real-world datasets: traffic load on an Internet backbone link and search query popularity. In comparison to their non-learning counterparts, our algorithms yield performance gains that range from $18 \%$ to $71 \%$ . + +# 2. RELATED WORK + +Frequency estimation in data streams. Frequency estimation, and the closely related problem of finding frequent elements in a data stream, are some of the most fundamental and well-studied problems in streaming algorithms, see Cormode & Hadjieleftheriou (2008) for an overview. Hashingbased algorithms such as Count-Sketch (Charikar et al., 2002), Count-Min (Cormode & Muthukrishnan, 2005b) and multi-stage filters (Estan & Varghese, 2003) are widely used solutions for these problems. These algorithms also have close connections to sparse recovery and compressed sensing (Candes et al., 2006; Donoho, 2006), where the hashing output can be considered as a com- \` pressed representation of the input data (Gilbert & Indyk, 2010). + +Several “non-hashing” algorithms for frequency estimation have been also proposed (Misra & Gries, 1982; Demaine et al., 2002; Karp et al., 2003; Metwally et al., 2005). These algorithms do not possess many of the properties of hashing-based methods listed in the introduction (such as the ability to handle deletions), but they often have better accuracy/space tradeoffs. For a fair comparison, our evaluation focuses only on hashing algorithms. However, our approach for learning heavy hitters should be useful for non-hashing algorithms as well. + +Some papers have proposed or analyzed frequency estimation algorithms customized to data that follows Zipf Law (Charikar et al., 2002; Cormode & Muthukrishnan, 2005a; Metwally et al., 2005; Minton & Price, 2014; Roy et al., 2016); the last algorithm is somewhat similar to the “lookup table” implementation of the heavy hitter oracle that we use as a baseline in our experiments. Those algorithms need to know the data distribution a priori, and apply only to one distribution. In contrast, our learning-based approach applies to any data property or distribution, and does not need to know that property or distribution a priori. + +Learning-based algorithms. Recently, researchers have begun exploring the idea of integrating machine learning models into algorithm design. In particular, researchers have proposed improving compressed sensing algorithms, either by using neural networks to improve sparse recovery algorithms (Mousavi et al., 2017; Bora et al., 2017), or by designing linear measurements that are optimized for a particular class of vectors (Baldassarre et al., 2016; Mousavi et al., 2015), or both. The latter methods can be viewed as solving a problem similar to ours, as our goal is to design “measurements” of the frequency vector $( f _ { 1 } , f _ { 2 } \ldots , f _ { | U | } )$ tailored to a particular class of vectors. However, the aforementioned methods need to explicitly represent a matrix of size $B \times | U |$ , where $B$ is the number of buckets. Hence, they are unsuitable for streaming algorithms which, by definition, have space limitations much smaller than the input size. + +Another class of problems that benefited from machine learning is distance estimation, i.e., compression of high-dimensional vectors into compact representations from which one can estimate distances between the original vectors. Early solutions to this problem, such as Locality-Sensitive Hashing, have been designed for worst case vectors. Over the last decade, numerous methods for learning such representations have been developed (Salakhutdinov & Hinton, 2009; Weiss et al., 2009; Jegou et al., 2011; Wang et al., 2016). Although the objective of those papers is similar to ours, their techniques are not usable in our applications, as they involve a different set of tools and solve different problems. + +More broadly, there have been several recent papers that leverage machine learning to design more efficient algorithms. The authors of (Dai et al., 2017) show how to use reinforcement learning and graph embedding to design algorithms for graph optimization (e.g., TSP). Other learning-augmented combinatorial optimization problems are studied in (He et al., 2014; Balcan et al., 2018; Lykouris & Vassilvitskii, 2018). More recently, (Kraska et al., 2018; Mitzenmacher, 2018) have used machine learning to improve indexing data structures, including Bloom filters that (probabilistically) answer queries of the form “is a given element in the data set?” As in those papers, our algorithms use neural networks to learn certain properties of the input. However, we differ from those papers both in our design and theoretical analysis. Our algorithms are designed to reduce collisions between heavy items, as such collisions greatly increase errors. In contrast, in existence indices, all collisions count equally. This also leads to our theoretical analysis being very different from that in (Mitzenmacher, 2018). + +# 3. PRELIMINARIES + +# 3.1. ESTIMATION ERROR + +We will use $e _ { i } : = | \tilde { f } _ { i } - f _ { i } |$ to denote the estimation error for $f _ { i }$ . To measure the overall estimation error between the frequencies $\mathcal { F } = \{ f _ { 1 } , f _ { 2 } , \cdot \cdot \cdot , f _ { | U | } \}$ and their estimates $\tilde { \mathcal { F } } = \{ \tilde { f } _ { 1 } , \tilde { f } _ { 2 } , \cdot \cdot \cdot , \tilde { f } _ { | U | } \}$ , we will use the expected error $E _ { i \sim \mathcal { D } } [ e _ { i } ]$ , where $\mathcal { D }$ models the distribution over the queries to the data structure. Similar to past work (Roy et al., 2016), we assume the query distribution $\mathcal { D }$ is the same as the distribution of the input stream, i.e., for any $j$ we have $\mathrm { P r } _ { i \sim \mathcal { D } } [ i = j ] = f _ { j } / N$ , where $N$ is the sum of all frequencies. This leads to the estimation error of $\tilde { \mathcal { F } }$ with respect to $\mathcal { F }$ + +$$ +\mathrm { E r r } ( \mathcal { F } , \tilde { \mathcal { F } } ) : = 1 / N \sum _ { i \in U } | \tilde { f } _ { i } - f _ { i } | \cdot f _ { i } +$$ + +We note that the theoretical guarantees of frequency estimation algorithms are typically phrased in the “ $( \epsilon , \delta )$ -form”, e.g., $\mathrm { P r } [ | \bar { \tilde { f } } _ { i } - f _ { i } | > \epsilon N ] < \delta$ for every $i$ (see e.g., Cormode & Muthukrishnan (2005b)). However, this formulation involves two objectives $\stackrel { \cdot } { \epsilon }$ and $\delta$ ). We believe that the (single objective) expected error in Equation 3.1 is more natural from the machine learning perspective. + +# 3.2. ALGORITHMS FOR FREQUENCY ESTIMATION + +In this section, we recap three variants of hashing-based algorithms for frequency estimation. + +Single Hash Function. The basic hashing algorithm uses a single uniformly random hash function $h : { \bar { U } } [ B ]$ , where we use $[ B ]$ to denote the set $\{ 1 \ldots B \bar { \} }$ . The algorithm maintains a onedimensional array $C [ 1 \ldots B ]$ , in which all entries are initialized to 0. Given an element $i$ , the algorithm increments $C [ h ( i ) ]$ . It can be seen that at the end of the stream, we have $\begin{array} { r } { C [ b ] = \sum _ { j : h ( j ) = b } \mathsf { \bar { f } } _ { j } } \end{array}$ . The estimate $\tilde { f } _ { i }$ of $f _ { i }$ is defined as $\begin{array} { r } { \tilde { f } _ { i } = C [ h ( i ) ] = \sum _ { j : h ( i ) = h ( j ) } f _ { j } } \end{array}$ . Note that it is always the case that $\tilde { f _ { i } } \geq f _ { i }$ . + +Count-Min. We have $k$ distinct hash functions $h _ { i } : U \to [ B ]$ and an array $C$ of size $k \times B$ . The algorithm maintains $C$ , such that at the end of the stream we have $\begin{array} { r } { C [ \ell , b ] = \sum _ { j : h \ell ( j ) = b } f _ { j } } \end{array}$ . For each $i \in U$ , the frequency estimate $\tilde { f } _ { i }$ is equal to $\begin{array} { r } { \operatorname* { m i n } _ { \ell \le k } C [ \ell , h _ { \ell } ( i ) ] } \end{array}$ , and always satisfies $\tilde { f _ { i } } \geq f _ { i }$ . + +Count-Sketch. Similarly to Count-Min, we have $k$ distinct hash functions $h _ { i } : U \to [ B ]$ and an array $C$ of size $k \times B$ . Additionally, in Count-Sketch, we have $k$ sign functions $g _ { i } : U \stackrel { \cdot } { } \bar { \{ - 1 , 1 \} }$ , and the algorithm maintains $C$ such that $\begin{array} { r } { C [ \ell , b ] = \sum _ { j : h _ { \ell } ( j ) = b } f _ { j } \cdot g _ { \ell } ( j ) } \end{array}$ . For each $\textit { i } \in \textit { U }$ , the frequency estimate $\tilde { f } _ { i }$ is equal to the median of $\{ g _ { \ell } ( i ) \cdot C [ \ell , h _ { \ell } ( i ) ] \} _ { \ell \le k }$ . Note that unlike the previous two methods, here we may have $\tilde { f _ { i } } < f _ { i }$ . + +# 3.3. ZIPFIAN DISTRIBUTION + +In our theoretical analysis we assume that the item frequencies follow the Zipf Law. That is, if we re-order the items so that their frequencies appear in a sorted order $f _ { i _ { 1 } } \geq f _ { i _ { 2 } } \geq . . . \geq f _ { i _ { n } }$ , then $f _ { i _ { j } } \propto 1 / j$ . To simplify the notation we assume that $f _ { i } = 1 / i$ . + +# 4. LEARNING-BASED FREQUENCY ESTIMATION ALGORITHMS + +We aim to develop frequency estimation algorithms that exploit data properties for better performance. To do so, we learn an oracle that identifies heavy hitters, and use the oracle to assign each heavy hitter its unique bucket to avoid collisions. Other items are simply hashed using any classic frequency estimation algorithm (e.g., Count-Min, or Count-Sketch), as shown in the block-diagram in Figure 4.1. This design has two useful properties: First, it allows us to augment a classic frequency estimation algorithm with learning capabilities, producing a learning-based counterpart that inherits the original guarantees of the classic algorithm. For example, if the classic algorithm is Count-Min, the resulting learning-based algorithm never underestimates the frequencies. Second, it provably reduces the estimation errors, and for the case of Count-Min it is (asymptotically) optimal. + +Algorithm 1 provides pseudo code for our design. The design assumes an oracle $\mathsf { H H } ( i )$ that attempts to determine whether an item $i$ is a “heavy hitter” or not. All items classified as heavy hitters are assigned to one of the $B _ { r }$ unique buckets reserved for heavy items. All other items are fed to the remaining $B - B _ { r }$ buckets using a conventional frequency estimation algorithm SketchAlg (e.g., Count-Min or Count-Sketch). + +The estimation procedure is analogous. To compute $\tilde { f } _ { i }$ , the algorithm first checks whether $i$ is stored in a unique bucket, and if so, reports its count. Otherwise, it queries the SketchAlg procedure. Note that if the element is stored in a unique bucket, its reported count is exact, i.e., $\tilde { f _ { i } } = f _ { i }$ . + +The oracle is constructed using machine learning and trained with a small subset of $S$ , call it $S ^ { \prime }$ . Note that the oracle learns the properties that identify heavy hitters as opposed to the identities of the heavy hitters themselves. For example, in the case of word frequency, the oracle would learn that shorter words are more frequent, so that it can identify popular words even if they did not appear in the training set $S ^ { \prime }$ . + +# 4.1. ANALYSIS + +Our algorithms combine simplicity with strong error bounds. Below, we summarize our theoretical results, and leave all theorems, lemmas, and proofs to the appendix. In particular, Table 4.1 lists the results proven in this paper, where each row refers to a specific streaming algorithm, its corresponding error bound, and the theorem/lemma that proves the bound. + +First, we show (Theorem 9.11 and Theorem 9.14) that if the heavy hitter oracle is accurate, then the error of the learned variant of Count-Min is up to a logarithmic factor smaller than that of its nonlearning counterpart. The improvement is maximized when $B$ is of the same order as $n$ (a common scenario2). Furthermore, we prove that this result continues to hold even if the learned oracle makes prediction errors with probability $\delta$ , as long as $\delta = { \cal O } ( 1 / \ln n )$ (Lemma 9.15). + +Second, we show that, asymptotically, our learned Count-Min algorithm cannot be improved any further by designing a better hashing scheme. Specifically, for the case of Learned Count-Min with a perfect oracle, our design achieves the same asymptotic error as the “Ideal Count-Min”, which optimizes its hash function for the given input (Theorem 10.4). + +Finally, we note that the learning-augmented algorithm inherits any $( \epsilon , \delta )$ -guarantees of the original version. Specifically, its error is not larger than that of SketchAlg with space $B - B _ { r }$ , for any input. +Algorithm 1 Learning-Based Frequency Estimation + +
AlgorithmsExpected ErrorAnalysis
Single Hash Function (B)(ln² n/B)Lemma 9.2
Count-Min Sketch (k,B)Ω(k lnnand O( (管)BlnkBTheorem 9.11
Learned Count-Min(B)0(ln²(n/B)/B)Theorem 9.14
Ideal Count-Min(B)(ln²(n/B)/B)Theorem 10.4
+ +Table 4.1: Our performance bounds for different algorithms on streams with frequencies obeying Zipf Law. $k$ is a constant $\left( \geq 2 \right)$ that refers to the number of hash functions, $B$ is the number of buckets, and $n$ is the number of distinct elements. The space complexity of all algorithms is the same, $\Theta ( B )$ . See section 9.4 for non-asymptotic versions of the some of the above bounds + +# 5. EXPERIMENTS + +Baselines. We compare our learning-based algorithms with their non-learning counterparts. Specifically, we augment Count-Min with a learned oracle using Algorithm 1, and call the learningaugmented algorithm “Learned Count-Min”. We then compare Learned Count-Min with traditional Count-Min. We also compare it with “Learned Count-Min with Ideal Oracle” where the neuralnetwork oracle is replaced with an ideal oracle that knows the identities of the heavy hitters in the test data, and “Table Lookup with Count-Min” where the heavy hitter oracle is replaced with a lookup table that memorizes heavy hitters in the training set. The comparison with the latter baseline allows + +2For example, Goyal et al. (2012) uses $B = 2 0 M , n = 3 3 . 5 M$ and $B = 5 0 M , n = 9 4 M$ us to show the ability of Learned Count-Min to generalize and detect heavy items unseen in the training set. We repeat the evaluation where we replace Count-Min (CM) with Count-Sketch (CS) and the corresponding variants. We use validation data to select the best $k$ for all algorithms. + +![](images/252885ebf6210b3d238af495bc61e87c586a3d4bfea456512057661696199ae3.jpg) + +![](images/0f609aabef3527949ff1e2f40a522d0558977d0ed1e07fcdc75b200947cb9c6f.jpg) +Figure 4.1: Pseudo-code and block-diagram representation of our algorithms + +Training a Heavy Hitter Oracle. We construct the heavy hitter oracle by training a neural network to predict the heaviness of an item. Note that the prediction of the network is not the final estimation. It is used in Algorithm 1 to decide whether to assign an item to a unique bucket. We train the network to predict the item counts (or the log of the counts) and minimize the squared loss of the prediction. Empirically, we found that when the counts of heavy items are few orders of magnitude larger than the average counts (as is the case for the Internet traffic data set), predicting the log of the counts leads to more stable training and better results. Once the model is trained, we select the optimal cutoff threshold using validation data, and use the model as the oracle described in Algorithm 1. + +# 5.1. INTERNET TRAFFIC ESTIMATION + +For our first experiment, the goal is to estimate the number of packets for each network flow. A flow is a sequence of packets between two machines on the Internet. It is identified by the IP addresses of its source and destination and the application ports. Estimating the size of each flow i – i.e., the number of its packets $f _ { i }$ – is a basic task in network management (Sivaraman et al., 2017). + +Dataset: The traffic data is collected at a backbone link of a Tier1 ISP between Chicago and Seattle in 2016 (CAIDA). Each recording session is around one hour. Within each minute, there are around 30 million packets and 1 million unique flows. For a recording session, we use the first 7 minutes for training, the following minute for validation, and estimate the packet counts in subsequent minutes. The distribution of packet counts over Internet flows is heavy tailed, as shown in Figure 5.1. + +![](images/b84b0ce8368f6022901baab3cb4d2dcb230dbf4255eca9de78b09e8231f0267a.jpg) +Figure 5.1: Frequency of Internet Flows + +Model: The patterns of the Internet traffic are very dynamic, i.e., the flows with heavy traffic change frequently from one minute to the next. However, we hypothesize that the space of IP addresses should be smooth in terms of traffic load. For example, data centers at large companies and university campuses with many students tend to generate heavy traffic. Thus, though the individual flows from these sites change frequently, we could still discover regions of IP addresses with heavy traffic through a learning approach. + +We trained a neural network to predict the log of the packet counts for each flow. The model takes as input the IP addresses and ports in each packet. We use two RNNs to encode the source and destination IP addresses separately. The RNN takes one bit of the IP address at each step, starting from the most significant bit. We use the final states of the RNN as the feature vector for an IP address. The reason to use RNN is that the patterns in the bits are hierarchical, i.e., the more significant bits govern larger regions in the IP space. Additionally, we use two-layer fully-connected networks to encode the source and destination ports. We then concatenate the encoded IP vectors, encoded port vectors, and the protocol type as the final features to predict the packet counts 3. The inference time takes 2.8 microseconds per item on a single GPU without any optimizations4. + +Results: We plot the results of two representative test minutes (the 20th and 50th) in Figure 5.2. All plots in the figure refer to the estimation error (Equation 3.1) as a function of the used space. The space includes space for storing the buckets and the model. Since we use the same model for all test minutes, the model space is amortized over the 50-minute testing period. + +Figure 5.2 reveals multiple findings. First, the figure shows that our learning-based algorithms exhibit a better performance than their non-learning counterparts. Specifically, Learned Count-Min, compared to Count-Min, reduces the the error by $32 \%$ with space of $0 . 5 \mathrm { M B }$ and $42 \%$ with space of 1.0 MB (Figure 5.2a). Learned Count-Sketch, compared to Count-Sketch, reduces the error by $52 \%$ at $0 . 5 \mathrm { M B }$ and $57 \%$ at $1 . 0 \mathrm { M B }$ (Figure 5.2c). In our experiments, each regular bucket takes 4 bytes. For the learned versions, we account for the extra space needed for the unique buckets to store the item IDs and the counts. One unique bucket takes 8 bytes, twice the space of a normal bucket.5 + +![](images/31362a49cb96f873e0865d27e2c41b0fdbaa09351ba6398012285fa04ea9cdf5.jpg) +(c) Learned Count-Sketch - 20th test minute (d) Learned Count-Sketch - 50th test minute +Figure 5.2: Comparison of our algorithms with Count-Min and Count-Sketch on Internet traffic data. + +Second, the figure also shows that our neural-network oracle performs better than memorizing the heavy hitters in a lookup table. This is likely due to the dynamic nature of Internet traffic –i.e., the heavy flows in the training set are significantly different from those in the test data. Hence, memorization does not work well. On the other hand, our model is able to extract structures in the input that generalize to unseen test data. + +Third, the figure shows that our model’s performance stays roughly the same from the 20th to the 50th minute (Figure 5.2b and Figure 5.2d), showing that it learns properties of the heavy items that generalize over time. + +Lastly, although we achieve significant improvement over Count-Min and Count-Sketch, our scheme can potentially achieve even better results with an ideal oracle, as shown by the dashed green line in Figure 5.2. This indicates potential gains from further optimizing the neural network model. + +# 5.2. SEARCH QUERY ESTIMATION + +For our second experiment, the goal is to estimate the number of times a search query appears. + +Dataset: We use the AOL query log dataset, which consists of 21 million search queries collected from 650 thousand users over 90 days. The users are anonymized in the dataset. There are 3.8 million unique queries. Each query is a search phrase with multiple words (e.g., “periodic table element poster”). We use the first 5 days for training, the following day for validation, and estimate the number of times different search queries appear in subsequent days. The distribution of search query frequency follows the Zipfian law, as shown in Figure 5.3 + +![](images/20e2bd33e1890ca9b86c1ffbbb65404bf01275ae33a787b13fc82565319f8a2e.jpg) +Figure 5.3: Frequency of search queries + +![](images/a37a40112838b97af1ac8400a471270b5b3284f5b83e68a8a21a640b55508c1f.jpg) +Figure 5.4: Comparison of our algorithms with Count-Min and Count-Sketch on search query data. + +Model: Unlike traffic data, popular search queries tend to appear more consistently across multiple days. For example, “google” is the most popular search phrase in most of the days in the dataset. Simply storing the most popular words can easily construct a reasonable heavy hitter predictor. However, beyond remembering the popular words, other factors also contribute to the popularity of a search phrase that we can learn. For example, popular search phrases appearing in slightly different forms may be related to similar topics. Though not included in the AOL dataset, in general, metadata of a search query (e.g., the location of the search) can provide useful context of its popularity. + +To construct the heavy hitter oracle, we trained a neural network to predict the number of times a search phrase appears. To process the search phrase, we train an RNN with LSTM cells that takes characters of a search phrase as input. The final states encoded by the RNN are fed to a fully-connected layer to predict the query frequency. Our character vocabulary includes lower-case English alphabets, numbers, punctuation marks, and a token for unknown characters. We map the character IDs to embedding vectors before feeding them to the ${ \mathsf { R N N } } ^ { 6 }$ . We choose RNN due to its effectiveness in processing sequence data (Sutskever et al., 2014; Graves, 2013; Kraska et al., 2018). + +Results: We plot the estimation error vs. space for two representative test days (the 50th and 80th day) in Figure 5.4. As before, the space includes both the bucket space and the space used by the model. The model space is amortized over the test days since the same model is used for all days. + +Similarly, our learned sketches outperforms their conventional counterparts. For Learned CountMin, compared to Count-Min, it reduces the loss by $18 \%$ at $0 . 5 \mathrm { M B }$ and $52 \%$ at $1 . 0 \mathrm { M B }$ (Figure 5.4a). For Learned Count-Sketch, compared to Count-Sketch, it reduces the loss by $24 \%$ at $0 . 5 \mathrm { \bf M B }$ and $71 \%$ at $1 . 0 \mathrm { { M B } }$ (Figure 5.4c). Further, our algorithm performs similarly for the 50th and the 80th day (Figure 5.4b and Figure 5.4d), showing that the properties it learns generalize over a long period. + +The figures also show an interesting difference from the Internet traffic data: memorizing the heavy hitters in a lookup table is quite effective in the low space region. This is likely because the search queries are less dynamic compared to Internet traffic (i.e., top queries in the training set are also popular on later days). However, as the algorithm is allowed more space, memorization becomes ineffective. + +# 5.3. ANALYZING HEAVY HITTER MODELS + +We analyze the accuracy of the neural network heavy hitter models to better understand the results on the two datasets. Specifically, we use the models to predict whether an item is a heavy hitter (top $1 \%$ in counts) or not, and plot the ROC curves in Figure 5.5. The figures show that the model for the Internet traffic data has learned to predict heavy items more effectively, with an AUC score of 0.9. As for the model for search query data, the AUC score is 0.8. This also explains why we see larger improvements over non-learning algorithms in Figure 5.2. + +![](images/74f2bb356dc02917bd9b450512f6a7a2ae07a4b54d38462f30771d1570c79025.jpg) +Figure 5.5: ROC curves of the learned models. + +# 6. EMBEDDING SPACE VISUALIZATION + +In this section, we visualize the embedding spaces learned by our heavy hitter models to shed light on the properties or structures the models learned. Specifically, we take the neural network activations before the final fully-connected layer, and visualize them in a 2-dimensional space using t-SNE (Maaten & Hinton, 2008). To illustrate the differences between heavy hitters (top $1 \%$ i n counts) and the rest (“light” items), we randomly sample an equal amount of examples from both classes. We visualize the embedding space for both the Internet traffic and search query datasets. + +We show the embedding space learned by the model on the Internet traffic data in Figure 6.1. Each point in the scatter plot represents one Internet traffic flow. By coloring each flow with its number of packets in Figure 6.1a, we see that the model separate flows with more packets (green and yellow clusters) from flows with fewer packets (blue clusters). To understand what structure the model learns to separate these flows, we color each flow with its destination IP address in Figure 6.1b. We found that clusters with more packets are often formed by flows sharing similar destination address prefixes. Interestingly, the model learns to group flows with similar IP prefixes closer in the embedding space. For example, the dark blue cluster at the upper left of Figure 6.1b shares a destination IP address prefix “1.96.\*.\*”. Learning this “structure” from the Internet traffic data allows the model to generalize to packets unseen in the training set. + +![](images/cde0a5c924361a411fcb25b50a80e7b22ba2585568bfe5b2749b8e6ca6968c11.jpg) +Figure 6.1: Visualization of the embedding space learned by our model on the Internet traffic data. Each point in the scatter plot represents one network flow. + +We show the embedding space learned by the model on the search query data in Figure 6.2. Each point in the scatter plot represents one search query. Similarly, the model learns to separate frequent search queries from the rest in Figure 6.2a. By coloring the queries with the number of characters in Figure 6.2b, we have multiple interesting findings. First, queries with similar length are closer in the embedding space, and the y-axis forms the dimension representing query length. Second, if we simply use the query length to predict heavy hitters, many light queries will be misclassified. The model must have learned other structures to separate heavy hitters in Figure 6.2a. + +![](images/07d5243c1460961e52df4412b6854f5658eec23fe6e39fb94b87ee8abf5b7f8f.jpg) +Figure 6.2: Visualization of the embedding space learned by our model on the search query data. Each point in the scatter plot represents one search query. + +# 7. CONCLUSION + +We have presented a new approach for designing frequency estimation streaming algorithms by augmenting them with a learning model that exploits data properties. We have demonstrated the benefits of our design both analytically and empirically. We envision that our work will motivate a deeper integration of learning in algorithm design, leading to more efficient algorithms. + +# 8. ACKNOWLEDGEMENTS + +The authors would like to thank the anonymous reviewers for helpful comments. The work was partially supported by NSF TRIPODS award #1740751, NSF AITF award #1535851 and Simons Investigator Award. We also thank the various companies sponsoring the MIT Center for Wireless Networks and Mobile Computing. + +# REFERENCES + +Amirali Aghazadeh, Ryan Spring, Daniel LeJeune, Gautam Dasarathy, Anshumali Shrivastava, and Richard G Baraniuk. Mission: Ultra large-scale feature selection using count-sketches. In International Conference on Machine Learning, 2018. + +Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, and Ellen Vitercik. Learning to branch. In International Conference on Machine Learning, 2018. + +Luca Baldassarre, Yen-Huan Li, Jonathan Scarlett, Baran Gozc ¨ u, Ilija Bogunovic, and Volkan ¨ Cevher. Learning-based compressive subsampling. IEEE Journal of Selected Topics in Signal Processing, 10(4):809–822, 2016. + +Ashish Bora, Ajil Jalal, Eric Price, and Alexandros G Dimakis. Compressed sensing using generative models. In International Conference on Machine Learning, pp. 537–546, 2017. + +Oscar Boykin, Avi Bryant, Edwin Chen, ellchow, Mike Gagnon, Moses Nakamura, Steven Noble, Sam Ritchie, Ashutosh Singhal, and Argyris Zymnis. Algebird. https://twitter. github.io/algebird/, 2016. + +CAIDA. Caida internet traces 2016 chicago. http://www.caida.org/data/monitors/passive-equinixchicago.xml. + +Emmanuel J Candes, Justin Romberg, and Terence Tao. Robust uncertainty principles: Exact signal \` reconstruction from highly incomplete frequency information. IEEE Transactions on information theory, 52(2):489–509, 2006. + +Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams. In International Colloquium on Automata, Languages, and Programming, pp. 693–703. Springer, 2002. + +Yu-Hsin Chen, Tushar Krishna, Joel S Emer, and Vivienne Sze. Eyeriss: An energy-efficient reconfigurable accelerator for deep convolutional neural networks. IEEE Journal of Solid-State Circuits, 52(1):127–138, 2017. + +Graham Cormode and Marios Hadjieleftheriou. Finding frequent items in data streams. Proceedings of the VLDB Endowment, 1(2):1530–1541, 2008. + +Graham Cormode and S Muthukrishnan. Summarizing and mining skewed data streams. In Proceedings of the 2005 SIAM International Conference on Data Mining, pp. 44–55. SIAM, 2005a. + +Graham Cormode and Shan Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms, 55(1):58–75, 2005b. + +Hanjun Dai, Elias Khalil, Yuyu Zhang, Bistra Dilkina, and Le Song. Learning combinatorial optimization algorithms over graphs. In Advances in Neural Information Processing Systems, pp. 6351–6361, 2017. + +Erik D Demaine, Alejandro Lopez-Ortiz, and J Ian Munro. Frequency estimation of internet packet ´ streams with limited space. In European Symposium on Algorithms, pp. 348–360. Springer, 2002. + +David L Donoho. Compressed sensing. IEEE Transactions on information theory, 52(4):1289– 1306, 2006. + +Fabon Dzogang, Thomas Lansdall-Welfare, Saatviga Sudhahar, and Nello Cristianini. Scalable preference learning from data streams. In Proceedings of the 24th International Conference on World Wide Web, pp. 885–890. ACM, 2015. + +Cristian Estan and George Varghese. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Transactions on Computer Systems (TOCS), 21(3): 270–313, 2003. + +Anna Gilbert and Piotr Indyk. Sparse recovery using sparse matrices. Proceedings of the IEEE, 98 (6):937–947, 2010. + +Amit Goyal, Hal Daume III, and Graham Cormode. Sketch algorithms for estimating point queries ´ in nlp. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pp. 1093–1103. Association for Computational Linguistics, 2012. + +Alex Graves. Generating sequences with recurrent neural networks. arXiv preprint arXiv:1308.0850, 2013. + +Song Han, Huizi Mao, and William J Dally. Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149, 2015. + +Song Han, Xingyu Liu, Huizi Mao, Jing Pu, Ardavan Pedram, Mark A Horowitz, and William J Dally. Eie: efficient inference engine on compressed deep neural network. In Computer Architecture (ISCA), 2016 ACM/IEEE 43rd Annual International Symposium on, pp. 243–254. IEEE, 2016. + +Song Han, Junlong Kang, Huizi Mao, Yiming Hu, Xin Li, Yubin Li, Dongliang Xie, Hong Luo, Song Yao, Yu Wang, et al. Ese: Efficient speech recognition engine with sparse lstm on fpga. In Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 75–84. ACM, 2017. + +He He, Hal Daume III, and Jason M Eisner. Learning to search in branch and bound algorithms. In Advances in neural information processing systems, pp. 3293–3301, 2014. + +Herve Jegou, Matthijs Douze, and Cordelia Schmid. Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence, 33(1):117–128, 2011. + +Hossein Jowhari, Mert Saglam, and G ˘ abor Tardos. Tight bounds for lp samplers, finding duplicates ´ in streams, and related problems. In Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 49–58. ACM, 2011. + +Richard M Karp, Scott Shenker, and Christos H Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems (TODS), 28(1): 51–55, 2003. + +Tim Kraska, Alex Beutel, Ed H Chi, Jeffrey Dean, and Neoklis Polyzotis. The case for learned index structures. In Proceedings of the 2018 International Conference on Management of Data (SIGMOD), pp. 489–504. ACM, 2018. + +Abhishek Kumar, Minho Sung, Jun Jim Xu, and Jia Wang. Data streaming algorithms for efficient and accurate estimation of flow size distribution. In ACM SIGMETRICS Performance Evaluation Review, volume 32, pp. 177–188. ACM, 2004. + +Zaoxing Liu, Antonis Manousis, Gregory Vorsanger, Vyas Sekar, and Vladimir Braverman. One sketch to rule them all: Rethinking network flow monitoring with univmon. In Proceedings of the 2016 ACM SIGCOMM Conference, pp. 101–114. ACM, 2016. + +Thodoris Lykouris and Sergei Vassilvitskii. Competitive caching with machine learned advice. In International Conference on Machine Learning, 2018. + +Laurens van der Maaten and Geoffrey Hinton. Visualizing data using t-sne. Journal of machine learning research, 9(Nov):2579–2605, 2008. + +Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Efficient computation of frequent and top-k elements in data streams. In International Conference on Database Theory, pp. 398–412. Springer, 2005. + +Gregory T Minton and Eric Price. Improved concentration bounds for count-sketch. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 669–686. SIAM, 2014. + +Jayadev Misra and David Gries. Finding repeated elements. Science of computer programming, 2 (2):143–152, 1982. + +Michael Mitzenmacher. A model for learned bloom filters and optimizing by sandwiching. In Advances in Neural Information Processing Systems, 2018. + +Ali Mousavi, Ankit B Patel, and Richard G Baraniuk. A deep learning approach to structured signal recovery. In Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton Conference on, pp. 1336–1343. IEEE, 2015. + +Ali Mousavi, Gautam Dasarathy, and Richard G Baraniuk. Deepcodec: Adaptive sensing and recovery via deep convolutional neural networks. arXiv preprint arXiv:1707.03386, 2017. + +Pratanu Roy, Arijit Khan, and Gustavo Alonso. Augmented sketch: Faster and more accurate stream processing. In Proceedings of the 2016 International Conference on Management of Data, pp. 1449–1463. ACM, 2016. + +Ruslan Salakhutdinov and Geoffrey Hinton. Semantic hashing. International Journal of Approximate Reasoning, 50(7):969–978, 2009. + +Stuart Schechter, Cormac Herley, and Michael Mitzenmacher. Popularity is everything: A new approach to protecting passwords from statistical-guessing attacks. In Proceedings of the 5th USENIX conference on Hot topics in security, pp. 1–8. USENIX Association, 2010. + +Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S Muthukrishnan, and Jennifer Rexford. Heavy-hitter detection entirely in the data plane. In Proceedings of the Symposium on SDN Research, pp. 164–176. ACM, 2017. + +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. + +Vivienne Sze, Yu-Hsin Chen, Tien-Ju Yang, and Joel S Emer. Efficient processing of deep neural networks: A tutorial and survey. Proceedings of the IEEE, 105(12):2295–2329, 2017. + +Partha Talukdar and William Cohen. Scaling graph-based semi supervised learning to large number of labels using count-min sketch. In Artificial Intelligence and Statistics, pp. 940–947, 2014. + +Jun Wang, Wei Liu, Sanjiv Kumar, and Shih-Fu Chang. Learning to hash for indexing big data - a survey. Proceedings of the IEEE, 104(1):34–57, 2016. + +Yair Weiss, Antonio Torralba, and Rob Fergus. Spectral hashing. In Advances in neural information processing systems, pp. 1753–1760, 2009. + +Minlan Yu, Lavanya Jose, and Rui Miao. Software defined traffic measurement with opensketch. In NSDI, volume 13, pp. 29–42, 2013. + +# 9. ANALYSIS - FULL PROOFS + +In this section, we analyze the performance of three different approaches, single (uniformly random) hash function, Count-Min sketch, and Learned Count-Min sketch when the frequency of items is from Zipfian distribution. For simplicity, we assume that the number of distinct elements $n$ is equal to the size of the universe $| U |$ , and $f _ { i } = 1 / i$ . We use $[ n ]$ to denote the set $\{ 1 \ldots n \}$ . We also drop the normalization factor $1 / N$ in the definition of estimation error. + +The following observation is useful throughout this section (in particular, in the section on nonasymptotic analysis). + +Observation 9.1. For sufficiently large values of $n$ (i.e., $n > 2 5 0 ,$ ), + +$$ +\ln ( n + 1 ) < \sum _ { i = 1 } ^ { \tilde { n } } { \frac { 1 } { i } } < \ln n + 0 . 5 8 +$$ + +# 9.1. SINGLE HASH FUNCTION + +Lemma 9.2. The expected error of a single uniformly random hash function $h : [ n ] \to [ B ]$ (with $B$ buckets) for estimating the frequency of items whose distribution is Zipfian is $\Theta \big ( \textstyle { \frac { \ln ^ { 2 } n } { B } } \big )$ . Proof: + +$$ +\begin{array} { r l } { \mathbf { E } [ \mathrm { E r r } ( \mathcal { F } , \widetilde { \mathcal { F } } _ { h } ) ] = \mathbf { E } [ \displaystyle \sum _ { j \in [ n ] } \big ( \widetilde { f } _ { j } - f _ { j } \big ) \cdot f _ { j } ] = \displaystyle \sum _ { j \in [ n ] } \mathbf { E } [ \displaystyle \sum _ { \{ q \neq j \mid h [ q ] = h [ j ] \} } f _ { q } ] \cdot f _ { j } } & { } \\ { \displaystyle } & { = \displaystyle \sum _ { j \in [ n ] } ( \Theta ( \frac { \ln n } { B } ) - \frac { f _ { j } } { B } ) \cdot f _ { j } = \Theta ( \frac { \ln ^ { 2 } n } { B } ) . } \end{array} +$$ + +Moreover, since each bucket maintains the frequency of items that are mapped to it under $h$ , the space complexity of this approach is proportional to the number of buckets which is $\Theta ( B )$ . + +# 9.2. COUNT-MIN SKETCH + +Here, we provide an upper bound and lower bound for the expected estimation error of CountMin sketch with $k$ hash functions and $B$ buckets per row. In the rest of this section, for each $j ~ \in ~ [ n ] , \ell ~ \le ~ k$ , we use $e _ { j , \ell }$ and $e _ { j }$ respectively to denote the estimation error of $f _ { j }$ by $h _ { \ell }$ and Count-Min sketch. Recall that the expected error of Count-Min sketch is defined as follows: + +$$ +\mathbf { E } [ \mathrm { E r r } ( \mathcal { F } , \tilde { \mathcal { F } } _ { C M } ) ] { \stackrel { \cdot } { = } } \mathbf { E } [ \sum _ { j \in [ n ] } ( \tilde { f } _ { j } - f _ { j } ) \cdot f _ { j } ] = \sum _ { j \in [ n ] } \mathbf { E } [ e _ { j } ] \cdot f _ { j } , +$$ + +Our high-level approach is to partition the interval $[ 0 , B \ln n ]$ into $m + 1$ smaller intervals by a sequence of thresholds $\begin{array} { r } { \Theta ( \ln ^ { 1 + \gamma } ( \frac { n } { B } ) ) = r _ { 0 } \le \dots \le r _ { m } = \bar { B } \ln n } \end{array}$ where $\gamma$ is a parameter to be determined later. Formally, we define the sequence of $r _ { i } \mathrm { s }$ to satisfy the following property: + +$$ +\forall \ell > 0 , \quad r _ { \ell } : = \dot { ( \ln ( \frac { n } { B } ) + \ln r _ { \ell + 1 } ) } \ln ^ { \dot { \gamma } } r _ { \ell + 1 } . +$$ + +Claim 9.3. For each $i \geq 0 , \ln r _ { i + 1 } \geq 2 \ln r _ { i }$ . + +Proof: By (9.3) and assuming $\ln r _ { i + 1 } \geq \ln ( { \frac { n } { B } } )$ , $r _ { i } < 2 \ln ^ { 1 + \gamma } r _ { i + 1 }$ . Hence, $\ln r _ { i + 1 } > \left( { \frac { r _ { i } } { 2 } } \right) ^ { \frac { 1 } { 1 + \gamma } } >$ $2 \ln r _ { i }$ for sufficiently large values of $r _ { i } { } ^ { 7 }$ assuming $\gamma \le 3$ . + +Note that as long as $\ln r _ { i + 1 } \geq \ln ( { \frac { n } { B } } )$ , $r _ { i } \leq r _ { i + 1 }$ . Otherwise, $\begin{array} { r } { r _ { i } = o ( \ln ^ { 1 + \gamma } ( \frac { n } { B } ) ) < r _ { 0 } } \end{array}$ . + +Corollary 9.4. For each $i \geq 1$ and $c \geq 1$ , $\begin{array} { r } { \sum _ { j \geq i } \ln ^ { - c } r _ { j } = O ( \ln ^ { - c } r _ { i } ) } \end{array}$ + +Then, to compute (9.2), we rewrite ${ \bf E } [ e _ { j } ]$ using the thresholds $r _ { 0 } , \cdots , r _ { m }$ as follows: + +$$ +\begin{array} { l l } { \displaystyle \mathbf { E } [ e _ { j } ] = \int _ { 0 } ^ { \infty } \operatorname* { P r } ( e _ { j } \geq x ) d x } & { \displaystyle { ( 9 . } } \\ { \displaystyle { = \int _ { 0 } ^ { \frac { r _ { 0 } } { B } } \operatorname* { P r } ( e _ { j } \geq x ) d x + \sum _ { i = 0 } ^ { m - 1 } \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \operatorname* { P r } ( e _ { j } \geq x ) d x } } \\ { \displaystyle { \leq O ( \frac { r _ { 0 } } { B } ) + \sum _ { i = 0 } ^ { m - 1 } \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \Big ( \operatorname* { P r } ( e _ { j } \geq x | e _ { j } < \frac { r _ { i + 1 } } { B } ) + \sum _ { q = i + 1 } ^ { m - 1 } \operatorname* { P r } ( e _ { j } \geq \frac { r _ { q } } { B } | e _ { j } < \frac { r _ { q + 1 } } { B } ) \Big ) d x } } \end{array} +$$ + +Next, we compute $\begin{array} { r } { \operatorname* { P r } ( e _ { j } \geq \frac { t } { B } | e _ { j } < \frac { r _ { i + 1 } } { B } ) } \end{array}$ ) for each $t \in [ r _ { i } , r _ { i + 1 } )$ . + +Lemma 9.5. For each $\begin{array} { r } { \div \left[ r _ { i } , r _ { i + 1 } \right) , \mathrm { P r } ( e _ { j } \geq \frac { t } { B } | e _ { j } < \frac { r _ { i + 1 } } { B } ) = O \Big ( \frac { k ( \ln \left( \frac { n } { B } \right) + \ln r _ { i + 1 } ) } { t \ln ^ { \gamma } r _ { i + 1 } } \Big ) . } \end{array}$ + +Proof: First we prove the following useful observation. + +Claim 9.6. For each item $j$ and hash function $\begin{array} { r } { h _ { \ell } , \mathbf { E } [ e _ { j , \ell } \mid e _ { j , \ell } < \frac { r } { B } ] \le \frac { \ln \left( \frac { n } { B } \right) + \ln r } { B } . } \end{array}$ + +Proof: Note that the condition $\begin{array} { r } { e _ { j , \ell } < \frac { r } { B } } \end{array}$ implies that for all items $\begin{array} { r } { q < \frac { B } { r } ( \mathrm { a n d } q \neq j ) , h _ { \ell } ( j ) \neq h _ { \ell } ( q ) } \end{array}$ . Hence, + +$$ +\mathbf { E } [ e _ { j , \ell } \mid e _ { j , \ell } < \frac { r } { B } ] \leq \sum _ { q > \frac { B } { r } } f _ { q } \cdot \frac { 1 } { B } \leq \frac { \ln n - \ln ( \frac { B } { r } ) } { B } = \frac { \ln ( \frac { n } { B } ) + \ln r } { B } . +$$ + +Thus, by Markov’s inequality, for each item $j$ and hash function $h _ { \ell }$ , + +$$ +\operatorname* { P r } ( e _ { j , \ell } > \frac { t } { B } \mid e _ { j , \ell } \leq \frac { r } { B } ) \leq \frac { \ln ( \frac { n } { B } ) + \ln r } { t } . +$$ + +Now, for each $h _ { \ell }$ in Count-Min sketch, we bound the value of $\begin{array} { r } { \operatorname* { P r } ( e _ { j , \ell } \geq \frac { t } { B } ) } \end{array}$ where $t \in [ r _ { i } , r _ { i + 1 } )$ + +Hen + +$$ +\begin{array} { r l } & { \displaystyle \operatorname* { P r } ( e _ { j , \varepsilon } \geq \frac { t } { B } ) \leq \sum _ { q = i } ^ { m - 1 } \operatorname* { P r } ( e _ { j , \varepsilon } \geq \frac { r _ { q } } { B } | e _ { j , \varepsilon } < \frac { r _ { q + 1 } } { B } ) } \\ & { \qquad \leq \displaystyle \sum _ { q = i } ^ { m - 1 } \frac { \ln ( \frac { n } { B } ) + \ln r _ { q + 1 } } { r _ { q } } = O ( \frac { 1 } { \ln ^ { \gamma } r _ { i + 1 } } ) \triangleright \mathfrak { b y } \ : ( 9 . 5 ) \ : \mathrm { a n d } \ : \mathrm { C o r o l l a r y } \ : 9 . 4 } \\ & { \displaystyle \operatorname* { s e } , \ : \mathrm { f o r } \ : k \geq 2 , \ : } \\ & { \qquad \operatorname* { P r } ( e _ { j } \geq \frac { t } { B } | e _ { j } < \frac { r _ { i + 1 } } { B } ) \leq k \operatorname* { P r } ( e _ { j , 1 } \geq \frac { t } { B } | e _ { j , 1 } < \frac { r _ { i + 1 } } { B } ) \Pi _ { \varepsilon = 2 } ^ { k } \operatorname* { P r } ( e _ { j , \varepsilon } \geq \frac { t } { B } ) } \\ & { \qquad = O \Big ( \frac { k ( \ln \frac { ( n ) } { B } + \ln r _ { i + 1 } ) } { t \ln ^ { \gamma ( k - 1 ) } r _ { i + 1 } } \Big ) \triangleright \mathrm { b y } \ : ( 9 . 5 ) \ : \mathrm { a n d } \ : ( 9 . 6 ) } \end{array} +$$ + +Next, for each item $j$ , we bound the contribution of each interval $\textstyle { \left( \frac { r _ { i } } { B } , \frac { r _ { i + 1 } } { B } \right) }$ to ${ \bf E } [ e _ { j } ]$ , namely $\begin{array} { r } { \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \operatorname* { P r } ( e _ { j } \geq x ) d x . } \end{array}$ . + +Claim 9.7. For each $i \geq 0$ , $\begin{array} { r } { \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \operatorname* { P r } ( e _ { j } \geq x ) d x = O ( \frac { k ( \ln ( \frac { n } { B } ) + \ln r _ { i + 1 } ) } { B \ln ^ { \gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) . } \end{array}$ + +Proof: + +$$ +\int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \operatorname* { P r } ( e _ { j } \geq x ) d x = \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \bigg ( \underbrace { \operatorname* { P r } ( e _ { j } \geq x | e _ { j } < \frac { r _ { i + 1 } } { B } ) } _ { A } + \underbrace { \sum _ { q = i + 1 } ^ { m - 1 } \operatorname* { P r } ( e _ { j } \geq \frac { r _ { q } } { B } | e _ { j } < \frac { r _ { q + 1 } } { B } ) } _ { B _ { q } } \bigg ) d x +$$ + +First, we compute $\begin{array} { r } { \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } A d x } \end{array}$ + +$$ +\begin{array} { r l } & { \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \operatorname* { P r } ( e _ { j } \geq x | e _ { j } < \frac { r _ { i + 1 } } { B } ) d x \leq \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } O ( \frac { k ( \ln \left( \frac { n } { B } \right) + \ln r _ { i + 1 } ) } { ( B \ln ^ { \gamma ( k - 1 ) } r _ { i + 1 } ) x } ) d x } \\ & { \qquad = O ( \frac { k ( \ln \left( \frac { n } { B } \right) + \ln r _ { i + 1 } ) } { B \ln ^ { \gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } \end{array} +$$ + +Similarly, R Bri $\begin{array} { r } { \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \sum _ { q = i + 1 } ^ { m - 1 } B _ { q } d x } \end{array}$ is at most: + +$$ +\begin{array} { r l } { \displaystyle \int _ { \frac { r _ { * } } { \mathtt { B } } } ^ { r _ { * + 1 } } } & { \displaystyle \sum _ { q = i + 1 } ^ { m - 1 } \operatorname* { P r } ( e _ { j } \geq \frac { r _ { q } } { B } | e _ { j } < \frac { r _ { q + 1 } } { B } ) d x = \displaystyle \int _ { \frac { r _ { * } } { B } } ^ { \frac { r _ { * + 1 } } { B } } \displaystyle \sum _ { q = i + 1 } ^ { m - 1 } O ( \frac { k ( \ln ( \frac { n } { B } ) + \ln r _ { q + 1 } ) } { r _ { q } \ln ^ { \gamma ( k - 1 ) } r _ { q + 1 } } ) d x } \\ & { \quad \quad = \displaystyle \int _ { \frac { r _ { * } } { B } } ^ { \frac { r _ { * + 1 } } { B } } \displaystyle \sum _ { q = i + 1 } ^ { m - 1 } O ( \frac { k } { \ln ^ { \gamma k } r _ { q + 1 } } ) d x \quad \mathrm { ~ \mathrm { [ s ~ b y ~ ( } 9 . 3 \mathrm { ) } ~ } } \\ & { \quad = \displaystyle \int _ { \frac { r _ { * } } { B } } ^ { \frac { r _ { * } } { B } } O ( \frac { k } { \ln ^ { \gamma k } r _ { i + 2 } } ) d x \quad \mathrm { ~ [ s ~ b y ~ C o r o l l a r y ~ } 9 . 4 } \\ & { \quad = O ( \frac { k r _ { i + 1 } } { B \ln ^ { \gamma k } r _ { i + 2 } } ) = O ( \frac { k ( \ln ( \frac { n } { B } ) + \ln r _ { i + 2 } ) } { B \ln ^ { \gamma ( k - 1 ) } r _ { i + 2 } } ) } \end{array} +$$ + +Hence, + +$$ +\begin{array} { r l r } { \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \operatorname* { P r } ( e _ { j } \geq x ) d x = \displaystyle \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \Big ( \operatorname* { P r } ( e _ { j } \geq x | e _ { j } < \frac { r _ { i + 1 } } { B } ) + \displaystyle \sum _ { q = i + 1 } ^ { m - 1 } \operatorname* { P r } ( e _ { j } \geq \frac { r _ { q } } { B } | e _ { j } < \frac { r _ { q + 1 } } { B } ) \Big ) d x } & \\ { \displaystyle \qquad \quad = O ( \frac { k ( \ln ( \frac { n } { B } ) + \ln r _ { i + 1 } ) } { B \ln ^ { \gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) + O ( \frac { k ( \ln ( \frac { n } { B } ) + \ln r _ { i + 2 } ) } { B \ln ^ { \gamma ( k - 1 ) } r _ { i + 2 } } ) } & { \mathrm { > b y ~ ( 9 . 7 ) - ( 9 . 8 ) } } \\ { \displaystyle \qquad } & { \displaystyle \quad = O ( \frac { k ( \ln ( \frac { n } { B } ) + \ln r _ { i + 1 } ) } { B \ln ^ { \gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \mathrm { > b y ~ ( 9 . 3 ) } } \end{array} +$$ + +Now, we complete the error analysis of (9.4): + +$$ +\begin{array} { l l } { \displaystyle \mathbf { E } [ e _ { j } ] \leq O ( \frac { r _ { 0 } } { B } ) + \sum _ { i = 0 } ^ { m - 1 } \int _ { \frac { r _ { i } } { B } } ^ { \frac { r _ { i + 1 } } { B } } \Big ( \operatorname* { P r } ( e _ { j } \geq x | e _ { j } < \frac { r _ { i + 1 } } { B } ) + \sum _ { q = i + 1 } ^ { m - 1 } \operatorname* { P r } ( e _ { j } \geq \frac { r _ { q } } { B } | e _ { j } < \frac { r _ { q + 1 } } { B } ) \Big ) d x } \\ { \displaystyle \qquad = O ( \frac { r _ { 0 } } { B } ) + \sum _ { i = 0 } ^ { m - 1 } O ( \frac { k ( \ln \left( \frac { n } { B } \right) + \ln r _ { i + 1 } ) } { B \ln ^ { \gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \mathrm { ~ \Rightarrow ~ b y ~ ( 9 . 9 ) ~ } } \\ { \displaystyle \qquad = O ( \frac { r _ { 0 } } { B } ) + O ( k \frac { \ln \left( \frac { n } { B } \right) } { B \ln ^ { \gamma ( k - 1 ) - 1 } r _ { 1 } } ) + O ( \frac { k } { B \ln ^ { \gamma ( k - 1 ) - 2 } r _ { 1 } } ) } & { \mathrm { ~ ( 9 . I ~ } } \end{array} +$$ + +Note that (9.10) requires $\gamma ( k - 1 ) - 2 \geq 1$ which is satisfied by setting $\gamma = 3 / ( k - 1 )$ and $k \geq 2$ . Thus, for each item $j$ , + +$$ +\mathbf { E } [ e _ { j } ] = O ( r _ { 0 } / B ) = O ( \frac { \ln ^ { \frac { k + 2 } { k - 1 } } ( \frac { n } { B } ) } { B } ) +$$ + +Lemma 9.8. The expected error of Count-Min sketch of size $k \times B$ (with $k \geq 2 ,$ ) for estimating items whose frequency distribution is Zipfian is $O ( \frac { \ln n \ln ^ { \frac { k + 2 } { k - 1 } } ( n / B ) } { B } )$ . In particular, if $B = \Theta ( n )$ then $\begin{array} { r } { { \bf E } [ \mathrm { E r r } ( { \mathcal F } , { \tilde { \mathcal { F } } } _ { C M } ) ] = O ( \frac { \ln n } { n } ) } \end{array}$ . + +Proof: By plugging in our upper bound on the estimation error of each item computed in (9.11) in the definition of expected estimation error of Count-Min (9.2), we have the following. + +$$ +\mathbf { E } [ \mathrm { E r r } ( \mathcal { F } , \tilde { \mathcal { F } } _ { C M } ) ] = \sum _ { j = 1 } ^ { n } \mathbf { E } [ e _ { j } ] \cdot f _ { j } = O ( \frac { \ln ^ { \frac { k + 2 } { k - 1 } } \left( \frac { n } { B } \right) } { B } \cdot \ln n ) . +$$ + +Next, we show a lower bound on the expected error of Count-Min sketch with $B$ buckets (more precisely, of size $( \boldsymbol { k } \times \boldsymbol { B } / k ) .$ ) for estimating the frequency of items that follow Zipf Law. + +Observation 9.9. For each item $j$ $\begin{array} { r } { , \operatorname* { P r } [ e _ { j } \geq 1 / ( 2 ( \frac { B } { k } ) \ln k + 1 ) ] \geq 1 - \frac { 1 } { k } . } \end{array}$ . + +Proof: For each item $j$ , the probability that none of the first $2 \big ( \frac { B } { k } \big ) \ln k + 1$ items (excluding itself) collide with it in at least one of the hash functions $h _ { 1 } , \cdots , h _ { k }$ is at most $\begin{array} { r } { k ( 1 - \frac { 1 } { ( B / k ) } ) ^ { 2 ( \frac { B } { k } ) \ln k } \le \frac { 1 } { k } } \end{array}$ + +Hence, with probability at least $\textstyle 1 - { \frac { 1 } { k } }$ , the estimation $\tilde { f } _ { j }$ includes the frequency of one of the top $2 ( \textstyle { \frac { B } { k } } ) \ln k + 1$ frequent items.  + +Lemma 9.10. The expected error of Count-Min sketch of size $\begin{array} { r } { k \times \left( \frac { B } { k } \right) } \end{array}$ for estimating items whose frequency distribution is Zipfian is at least $\frac { ( k - 1 ) \ln { n } } { 2 B \ln { k } + k }$ . + +Proof: Observation 9.9 implies that $\begin{array} { r } { \mathbf { E } [ e _ { j } ] \geq ( 1 - \frac { 1 } { k } ) \frac { 1 } { 2 ( \frac { B } { k } ) \ln k + 1 } = \frac { k - 1 } { 2 B \ln k + k } } \end{array}$ . Hence, + +$$ +\begin{array} { r l } { { \mathbf { E } [ \mathrm { E r r } ( \mathcal { F } , \mathcal { \tilde { F } } _ { C M } ) ] = \sum _ { j \in [ n ] } ^ { } \mathbf { E } [ e _ { j } ] \cdot f _ { j } } } \\ & { \geq ( \frac { k - 1 } { 2 B \ln k + k } ) \ln n \quad \triangleright \mathrm { B y ~ O b s e r v a t i o n } 9 . 1 } \end{array} +$$ + +Theorem 9.11. The expected error of Count-Min sketch of size $\begin{array} { r } { k \times \left( \frac { B } { k } \right) } \end{array}$ on estimating the frequency of n items from Zipfian distribution is at least $\Omega \big ( \frac { k \ln n } { B \ln k } \big )$ and at most $O ( \frac { k \ln n \ln ^ { \frac { k + 2 } { k - 1 } } ( \frac { k n } { B } ) } { B } )$ . + +In particular, for the case $B = \Theta ( n )$ and $k = O ( 1 )$ , the expected error of Count-Min sketch is $\Theta \big ( \textstyle { \frac { \ln n } { B } } \big )$ . + +Proof: The proof follows from Lemma 9.8 and 9.10. We remark that the bound in Lemma 9.8 is for the expected estimation error of Count-Min sketch of size $k \times B$ . Hence, to get the bound on the expected error of Count-Min of size $\begin{array} { r } { k \times \left( \frac { B } { k } \right) } \end{array}$ , we must replace $B$ with $B / k$ .  + +# 9.3. LEARNED COUNT-MIN SKETCH + +Definition 9.12 $\dot { \phi }$ -HeavyHitter). Given a set of items $\mathcal { T } = \{ i _ { 1 } , \cdots , i _ { n } \}$ with frequencies ${ \vec { f } } =$ $\langle f _ { 1 } , \cdots , f _ { n } \rangle$ , an item $j$ is a $\phi$ -HeavyHitter of $\mathcal { T }$ if $f _ { j } \geq \phi | | { \vec { f } } | | _ { 1 }$ . + +Remark 9.13. If the frequency distribution of items $\mathcal { T }$ is Zipfian, then the number of $\phi$ -HeavyHitters is at most $1 / ( \phi \ln n )$ . In other words, $B _ { r } \leq ( \phi \ln n ) ^ { - 1 }$ . + +To recall, in our Learned Count-Min sketch with parameters $( B _ { r } , B )$ , $B _ { r }$ buckets are reserved for the frequent items returned by HH and the rest of items are fed to a Count-Min sketch of size $\begin{array} { r } { k \times \left( \frac { B ^ { \star } - B _ { r } } { k } \right) } \end{array}$ where $k$ is a parameter to be determined. We emphasize that the space complexity of Learned Count-Min sketch with parameter $( B _ { r } , B )$ is $B _ { r } + B = O ( B )$ . + +Theorem 9.14. The optimal expected error of Learned Count-Min sketches with parameters $( B _ { r } , B )$ is at most $\frac { ( \ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } }$ . In particular, for $B _ { r } = \Theta ( B ) = \Theta ( n )$ , $\mathbf { E } [ \mathrm { E r r } ( \mathcal { F } , \tilde { \mathcal { F } } _ { L - C M } ) ] =$ $O ( { \textstyle { \frac { 1 } { n } } } )$ . + +Proof: Since, the count of top $B _ { r }$ frequent items are stored in their own buckets, for each $j \le B _ { r }$ , $e _ { j } = 0$ . Hence, + +$$ +\begin{array} { l } { { \displaystyle { \bf E } [ \mathrm { E r r } ( { \mathcal F } , { \tilde { F } } _ { L - C M } ) ] = \sum _ { j \in [ n ] } { \bf E } [ e _ { j } ] \cdot f _ { j } } \ ~ } \\ { { \displaystyle ~ = \sum _ { j > B _ { r } } { \bf E } [ e _ { j } ] \cdot f _ { j } \quad \triangleright \forall j \le B _ { r } , e _ { j } = 0 } \ ~ } \\ { { \displaystyle ~ < \frac { ( \ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } } \quad } { \displaystyle \triangleright \mathrm { B y ~ O b s e r v a t i o n ~ } } 9 . 1 } \end{array} +$$ + +Note that the last inequality follows from the guarantee of single hash functions; in other words, setting $k = 1$ in the Count-Min sketch.  + +# 9.3.1. LEARNED COUNT-MIN SKETCH USING NOISY HEAVYHITTERS ORACLE + +Unlike the previous part, here we assume that we are given a noisy HeavyHitters oracle $\mathsf { H H } _ { \delta }$ such that for each item $j$ $\begin{array} { r } { , \dot { \operatorname* { P r } } \left( \mathsf { H } \mathsf { H } _ { \delta } ( j , \frac { 1 } { B _ { r } \ln n } ) \neq \mathsf { H } \mathsf { H } _ { 0 } ( j , \frac { 1 } { B _ { r } \ln n } ) \right) \leq \delta } \end{array}$ where $\mathsf { H H } _ { 0 }$ is an ideal HeavyHitter oracle that detects heavy items with no error. + +Lemma 9.15. In an optimal Learned Count-Min sketch with parameters $( B _ { r } , B )$ and a noisy HeavyHitters oracle $\mathsf { H H } _ { \delta }$ , $\begin{array} { r } { { \bf E } [ \mathrm { E r r } ( { \mathcal F } , \tilde { \mathcal { F } } _ { ( L - C M , \delta ) } ) ] = O ( \frac { \delta ^ { 2 } \ln ^ { 2 } B _ { r } + \ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) } \end{array}$ . + +Proof: The key observation is that each heavy item, any of $B _ { r }$ most frequent items, may only misclassify with probability $\delta$ . Hence, for each item $j$ classified as “not heavy”, + +where the first term denotes the expected contribution of the misclassified heavy items and the second term denotes the expected contribution of non-heavy items. + +The rest of analysis is similar to the proof of Theorem 9.14. + +$$ +\begin{array} { r l } { \mathbf { E } [ \mathrm { E r r } ( \mathcal { F } , \tilde { \mathcal { F } } _ { ( L - C M , \delta ) } ^ { * } ) ] = \displaystyle \sum _ { j \in [ n ] } \mathbf { E } [ e _ { j } ] \cdot f _ { j } } & { } \\ & { < \delta \displaystyle \sum _ { j \leq B _ { r } } \mathbf { E } [ e _ { j } ] \cdot f _ { j } + \displaystyle \sum _ { j > B _ { r } } \mathbf { E } [ e _ { j } ] \cdot f _ { j } } \\ & { \leq O ( \delta \cdot \ln B _ { r } + \ln ( n / B _ { r } ) ) \cdot O ( \frac { \delta \ln B _ { r } + \ln ( n / B _ { r } ) } { B - B _ { r } } ) \quad \mapsto \mathbf { B } \mathbf { y } } \\ & { \leq O ( \frac { \delta ^ { 2 } \ln ^ { 2 } B _ { r } + \ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) . } \end{array} +$$ + +Corollary 9.16. Assuming $B _ { r } = \Theta ( B ) = \Theta ( n )$ and $\delta = { \cal O } ( 1 / \ln n ) , { \bf E } [ \mathrm { E r r } ( { \mathcal F } , { \tilde { \mathcal { F } } } _ { ( L - C M , \delta ) } ) ] =$ $O ( 1 / n )$ . + +Space analysis. Here, we compute the amount of space that is required by this approach. + +mma 9.17. The amount of space used by Learned Count-Min sketch of size reserved buckets) for estimating the frequency of items whose distributio $\begin{array} { r } { k \cdot \left( \frac { B - B _ { r } } { k } \right) } \end{array}$ w is off. $B _ { r }$ $O ( B )$ + +Proof: The amount of space required to store the counters corresponding to functions $h _ { 1 } , \cdots , h _ { k }$ is $\overset { \triangledown } { O } ( \boldsymbol { k } \cdot \big ( \frac { \boldsymbol { B } - \boldsymbol { B } _ { r } } { k } \big ) \big )$ . Here, we also need to keep a mapping from the heavy items (top $B _ { r }$ frequent items according to $\mathsf { H H } _ { \delta }$ ) to the reserved buckets $B _ { r }$ which requires extra $O ( B _ { r } )$ space; each reserved buckets stores both the hashmap of its corresponding item and its count.  + +# 9.4. NON-ASYMPTOTIC ANALYSIS OF COUNT-MIN AND LEARNED COUNT-MIN + +In this section, we compare the non-asymptotic expected error of Count-Min sketch and out Learned Count-Min sketch with ideal HeavyHitters oracle. Throughout this section, we assume that the amount of available space to the frequency estimation algorithms is $( 1 + \alpha ) B$ words. More precisely, we compare the expected error of Count-Min sketch with $k$ hash functions and our Learned CountMin sketch with $B _ { r } = \alpha B$ reserved buckets. Recall that we computed the following bounds on the expected error of these approaches (Lemma 9.10 and Theorem 9.14): + +$$ +\mathbf { E } [ \mathrm { E r r } _ { C M } ] \geq \frac { ( k - 1 ) \ln n } { 2 ( 1 + \alpha ) B \ln ( k ) + k } , \quad \mathbf { E } [ \mathrm { E r r } _ { L - C M } ] \leq \frac { ( \ln ( \frac { n } { \alpha B } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \alpha ) B } . +$$ + +In the rest of this section, we assume that $B \geq \gamma n$ and then compute the minimum value of $\gamma$ that guarantees $\begin{array} { r } { \mathbf { E } [ \mathrm { E r r } _ { L - C M } ] \leq \frac { 1 } { 1 + \varepsilon } \cdot \mathbf { E } [ \mathrm { E r r } _ { C M } ] } \end{array}$ . In other words, we compute the minimum amount of space that is required so that our Learned Count-Min sketch performs better than Count-Min sketch by a factor of at least $( 1 + \varepsilon )$ . + +$\mathbf E [ \mathrm { E r r } _ { L - C M } ] \leq \frac { ( \ln ( \frac { 1 } { \alpha \gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \alpha ) B } \leq \frac { 1 } { 1 + \varepsilon } \cdot \frac { ( k - 1 ) \ln n } { 2 ( 1 + \alpha ) B \ln k + k } \leq \frac { 1 } { 1 + \varepsilon } \cdot \mathbf E [ \mathrm { E r r } _ { C M } ] ,$ Hence, we must have $\begin{array} { r } { ( 0 . 5 8 - \ln \alpha - \ln \gamma ) ^ { 2 } \leq \frac { ( k - 1 ) ( 1 - \alpha ) } { ( 1 + \varepsilon ) ( 2 ( 1 + \alpha ) \ln k + ( \frac { k } { B } ) ) } \cdot \ln n } \end{array}$ . By solving the corresponding quadratic equation, + +$$ +\ln ^ { 2 } \gamma + 2 ( \ln \alpha - 0 . 5 8 ) \ln \gamma + ( ( \ln \alpha - 0 . 5 8 ) ^ { 2 } - { \frac { ( k - 1 ) ( 1 - \alpha ) } { ( 1 + \varepsilon ) ( 2 ( 1 + \alpha ) \ln k + { ( \frac { k } { B } ) } ) } } \cdot \ln n ) \le 0 . +$$ + +This implies that $\begin{array} { r } { \ln \gamma = - \ln \alpha + 0 . 5 8 - \sqrt { \frac { ( k - 1 ) ( 1 - \alpha ) } { ( 1 + \varepsilon ) ( 2 ( 1 + \alpha ) \ln k + ( \frac { k } { B } ) ) } \cdot \ln n } } \end{array}$ . By setting $\alpha = { \textstyle \frac { 1 } { 2 } } , \gamma \leq$ $\begin{array} { r } { \frac { 3 . 5 8 } { e \sqrt { \frac { ( k - 1 ) \ln { n } } { 2 ( 1 + \varepsilon ) ( 3 \ln { k } + ( k / B ) ) } } } . } \end{array}$ + +Next, we consider different values of $k$ and show that in each case what is the minimum amount of space in which Learned CM outperforms CM by a factor of 1.06 (setting $\varepsilon = 0 . 0 6 $ ). + +• $\mathbf k = \mathbf 1$ . In this case, we are basically comparing the expected error of a single hash function and Learned Count-Min. In particular, in order to get a gap of at least $( 1 + \varepsilon )$ , by a more careful analysis of Lemma 9.2, $\gamma$ must satisfy the following condition: + +$$ +\mathbf { E } [ \mathrm { E r r } _ { L - C M } ] \leq \frac { ( \ln ( \frac { 1 } { \alpha \gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \alpha ) B } \leq \frac { 1 } { 1 + \varepsilon } \cdot \frac { \ln ^ { 2 } n - 1 . 6 5 } { ( 1 + \alpha ) B } \leq \frac { 1 } { 1 + \varepsilon } \cdot \mathbf { E } [ \mathrm { E r r } _ { h } ] , +$$ + +To simplify it further, we require that $( \ln ( \textstyle \frac { 2 } { \gamma } ) + 0 . 5 8 ) ^ { 2 } \leq 3 . 1 8 \cdot ( \ln ^ { 2 } n - 1 . 6 5 )$ ) which implies that $\gamma = \Theta ( 1 / \ln n )$ . + +• $k = 2$ . In this case, $\begin{array} { r } { \gamma \le \frac { 3 . 5 8 } { e ^ { \sqrt { ( \ln n ) / 4 . 5 } } } } \end{array}$ for sufficiently large values of $B$ . Hence, we require that the total amount of available space is at least $\frac { 5 . 3 7 n } { e ^ { \sqrt { ( \ln n ) / 4 . 5 } } }$ + +• $k \in \{ 3 , 4 \}$ : In this case, $\begin{array} { r } { \gamma \le \frac { 2 } { e \sqrt { ( \ln n ) / 3 . 5 } } } \end{array}$ for sufficiently large values of $B$ . Hence, we require that the total amount of available space is at least $\frac { 5 . 3 7 n } { e ^ { \sqrt { ( \ln n ) / 3 . 5 } } }$ + +• $\mathbf { \delta } _ { k } \geq \mathbf { 5 }$ . In this case, $\begin{array} { r } { \gamma \le \frac { 2 } { e ^ { \sqrt { ( \ln n ) / 2 . 6 } } } } \end{array}$ for sufficiently large values of $B$ . Hence, we require that the total amount of available space is at least $\frac { 5 . 3 7 n } { e ^ { \sqrt { ( \ln n ) / 2 . 6 } } }$ + +We also note that settings where the number of buckets is close to $n$ are quite common in practice. For example, Goyal et al. (2012) uses $( ( 1 + \alpha ) B = 2 0 M , n = 3 3 . 5 M )$ and $( ( 1 + \alpha ) B = 5 \bar { 0 } M , n =$ $9 4 M )$ with $k = 3$ , while Kumar et al. (2004) uses different pairs of $( ( 1 + \alpha ) B , n )$ including $B =$ $2 8 8 K , n \ = \ 5 6 3 K )$ . Plugging these values into the exact formulas computed above shows that Learned CM has a significantly lower loss than CM. + +# 10. OPTIMAL HASH FUNCTION + +In this section we compute an asymptotic bound error bound of optimal hash functions that map items $[ n ]$ to a set of buckets $C [ 1 \cdots B ]$ . + +Claim 10.1. For a set of items $I$ , let $f ( I )$ denote the total frequency of all items in $I$ ; $f ( I ) : =$ $\textstyle \sum _ { i \in I } f _ { i }$ . In any optimal hash function of form $\{ h : I [ B _ { I } ] \}$ with minimum estimation error, any item with frequency at least $\textstyle { \frac { f ( I ) } { B _ { I } } }$ does not collide with any other items in $I$ . + +Proof: For each bucket $b \in \ [ B _ { I } ]$ , lets $f _ { h } ( b )$ denotes the frequency of items mapped to $b$ under $h$ ; $\begin{array} { r } { \dot { f } ( b ) : = \sum _ { i \in I : h ( i ) = b } f _ { i } } \end{array}$ . Recall that the estimation error of a hash function $h$ is defined as $\begin{array} { r } { \mathrm { E r r } ( \mathcal { F } ( I ) , \tilde { \mathcal { F } } _ { h } ( I ) ) : = \sum _ { i \in I } f _ { i } \cdot \left( f ( h ( i ) ) - i \right) } \end{array}$ . Note that we can rewrite $\mathrm { E r r } ( \mathcal { F } ( I ) , \tilde { \mathcal { F } } _ { h } ( I ) )$ as + +$$ +\begin{array} { r } { \mathrm { E r r } ( \mathcal { F } ( I ) , \widetilde { \mathcal { F } _ { h } } ( I ) ) = \displaystyle \sum _ { i \in I } f _ { i } \cdot ( f ( h ( i ) ) - f _ { i } ) = \displaystyle \sum _ { i \in I } f _ { i } \cdot f ( h ( i ) ) - \displaystyle \sum _ { i \in I } f _ { i } ^ { 2 } } \\ { = \displaystyle \sum _ { b \in [ B _ { I } ] } f ( b ) ^ { 2 } - \displaystyle \sum _ { i \in I } f _ { i } ^ { 2 } . } \end{array} +$$ + +Note that in (10.1) the second term is independent of $h$ and is a constant. Hence, an optimal hash function minimizes the first term, $\sum { _ { b \in B _ { I } } \hat { f ( b ) ^ { 2 } } }$ . + +Suppose that an item $i ^ { * }$ with frequency at least $\textstyle { \frac { f ( I ) } { B _ { I } } }$ collides with a (non-empty) set of items $I ^ { * } \subseteq$ $I \setminus \{ i ^ { * } \}$ under an optimal hash function $h ^ { * }$ . Since the total frequency of the items mapped to the $b ^ { * }$ ntaining . Next, $i ^ { * }$ is greater than define a new h $\textstyle { \frac { f ( I ) } { B _ { I } } }$ (i.e., uncti $\begin{array} { r } { f ( h ( i ^ { * } ) ) > \frac { f ( I ) } { B _ { I } } ) } \end{array}$ , there exists a bucket estimation error com $\bar { b }$ such tred to $\begin{array} { r } { f ( \overline { { b } } ) < \frac { f ( I ) } { B _ { I } } } \end{array}$ $\bar { h }$ $h ^ { * }$ which contradicts the optimality of $h ^ { * }$ : + +$$ +\begin{array} { r } { \overline { { h } } ( i ) = \left\{ \begin{array} { l l } { h ^ { * } ( i ) } & { \mathrm { i f ~ } i \in I \setminus I ^ { * } } \\ { \overline { { b } } } & { \mathrm { o t h e r w i s e . } } \end{array} \right. } \end{array} +$$ + +Formally, + +$$ +\begin{array} { r l } { \widehat { \mathrm { E r r } ( F ( I ) , \tilde { F } _ { h ^ { \ast } } ( I ) ) } - \mathrm { E r r } ( \mathcal { F } ( I ) , \tilde { \mathcal { F } } _ { \overline { { h } } } ( I ) ) = f _ { h ^ { \ast } } ( b ^ { \ast } ) ^ { 2 } + f _ { h ^ { \ast } } ( \overline { { b } } ) ^ { 2 } - f _ { \overline { { h } } } ( b ^ { \ast } ) ^ { 2 } - f _ { \overline { { h } } } ( \overline { { b } } ) ^ { 2 } } & { } \\ { = ( f _ { i ^ { \ast } } + f ( I ^ { \ast } ) ) ^ { 2 } + f _ { h ^ { \ast } } ( \overline { { b } } ) ^ { 2 } - f _ { i ^ { \ast } } ^ { 2 } - ( f _ { h ^ { \ast } } ( \overline { { b } } ) + f ( I ^ { \ast } ) ) ^ { 2 } } & { } \\ { = 2 f _ { i ^ { \ast } } \cdot f ( I ^ { \ast } ) - 2 f _ { h ^ { \ast } } ( \overline { { b } } ) \cdot f ( I ^ { \ast } ) } & { } \\ { = 2 f ( I ^ { \ast } ) \cdot ( f _ { i ^ { \ast } } - f _ { h ^ { \ast } } ( \overline { { b } } ) ) } & { } \\ { > 0 \quad \triangleright \mathrm { S i n c e ~ } f _ { i ^ { \ast } } > \frac { f ( I ) } { B } > f _ { h ^ { \ast } } ( \overline { { b } } ) . } & { } \end{array} +$$ + +Next, we show that in any optimal hash function $h ^ { * } : [ n ] \ \to \ [ B ]$ and assuming Zipfian input distribution, $\Theta ( B )$ most frequent items do not collide with any other items under $h ^ { * }$ . + +Lemma 10.2. Suppose that $B = n / \gamma$ where $\gamma \geq e ^ { 4 . 2 }$ is a constant and lets assume that items follow Zipfian distribution. In any hash function $h ^ { * } : [ n ] [ B ]$ with minimum estimation error, none of the $\frac { B } { 2 \ln \gamma }$ most frequent items collide with any other items (i.e., they are mapped to a singleton bucket). + +Proof: Let $i _ { j ^ { * } }$ be the most frequent item that is not mapped to a singleton bucket under $h ^ { * }$ . If $\begin{array} { r } { j ^ { * } > \frac { B } { 2 \ln \gamma } } \end{array}$ then the statement holds. Suppose it is not the case and $\begin{array} { r } { j ^ { * } \le \frac { B } { 2 \ln \gamma } } \end{array}$ . Let $I$ denote the set of items with frequency at most $f _ { j ^ { * } } = 1 / j ^ { * }$ (i.e., $I = \{ i _ { j } \mid j \geq j ^ { * } \} )$ and let $B _ { I }$ denote the number of buckets that the items with index at least $j ^ { * }$ mapped to; $B _ { I } = B - j ^ { * } + 1$ . Also note that by Observation 9.1, $\begin{array} { r } { f ( I ) < \ln ( \frac { n } { j ^ { * } } ) + 1 } \end{array}$ . Next, by Claim 10.1, we show that $h ^ { * }$ does not hash the items $\{ j ^ { * } , \cdots , n \}$ to $B _ { I }$ optimally. In particular, we show that the frequency of item $j ^ { * }$ is more than $\textstyle { \frac { f ( I ) } { B _ { I } } }$ . To prove this, first we observe that the function $g ( j ) : = j \cdot ( \ln ( n / j ) + 1 )$ is strictly increasing in $[ 1 , n ]$ . Hence, for any $\begin{array} { r } { j ^ { * } \le \frac { B } { 2 \ln \gamma } } \end{array}$ , + +$$ +\begin{array} { r l r } { { j ^ { * } \cdot ( \ln ( \frac { n } { j ^ { * } } ) + 1 ) \le \frac { B } { 2 \ln \gamma } \cdot ( \ln ( 2 \gamma \ln \gamma ) + 1 ) } } \\ & { } & { \le B \cdot ( 1 - \frac { 1 } { 2 \ln \gamma } ) \quad \triangleright \mathrm { S i n c e ~ l n } ( 2 \ln \gamma ) + 2 < \ln \gamma \mathrm { ~ f o r ~ l n } \gamma \ge 4 . 2 } \end{array} +$$ + +Thus, $\begin{array} { r } { f _ { j ^ { * } } = \frac { 1 } { j ^ { * } } > \frac { \ln ( n / j ^ { * } ) + 1 } { B _ { I } } > \frac { f ( I ) } { B _ { I } } } \end{array}$ which implies that an optimal hash function must map $j ^ { * }$ to a singleton bucket.  + +Theorem 10.3. If $n / B \geq e ^ { 4 . 2 }$ , then the estimation error of any hash function that maps a set of $n$ items following Zipfian distribution to $B$ buckets is $\Omega \big ( \frac { \ln ^ { 2 } ( \frac { n } { B } ) } { B } \big )$ + +Proof: By Lemma 10.2, in any hash function with minimum estimation error, the $\scriptstyle \left( { \frac { B } { 2 \ln \gamma } } \right)$ most frequent items do not collide with any other items (i.e., they are mapped into a singleton bucket) where $\gamma = n / B > e ^ { 4 . 2 }$ . + +Hence, the goal is to minimize (10.1) for the set of items $I$ which consist of all items other than the ( B2 ln γ ) most frequent items. Since the sum of squares of $m$ items that summed to $S$ is at least $S ^ { 2 } / m$ , the multi-set loss of any optimal hash function is at least: + +$$ +\begin{array} { r l } { \mathrm { E r r } ( \mathcal { F } ( I ) , \bar { \mathcal { F } } _ { h ^ { * } } ( I ) ) = \displaystyle { \sum _ { b \in [ B ] } f ( b ) ^ { 2 } - \sum _ { i \in [ n ] } f _ { i } ^ { 2 } } } \\ { \displaystyle } & { \geq \frac { ( \sum _ { i \in I } f _ { i } ) ^ { 2 } } { B ( 1 - \frac { 1 } { 2 \ln \gamma } ) } - \frac { \sum _ { i \in I } f _ { i } ^ { 2 } } { i \in I } } \\ { \displaystyle } & { \geq \frac { ( \ln ( 2 \gamma \ln \gamma ) - 1 ) ^ { 2 } } { B } - \frac { 2 \ln \gamma } { B } + \frac { 1 } { n } } \\ { \displaystyle } & { = \Omega ( \frac { \ln ^ { 2 } \gamma } { B } ) } \\ { \displaystyle } & { = \Omega ( \frac { \ln ^ { 2 } ( n / B ) } { B } ) . } \end{array} +$$ + +B Since γ > e4 + +Next, we show a more general statement which basically shows that the estimation error of any Count-Min sketch with $B$ buckets is $\Omega \big ( \frac { \ln ^ { 2 } ( n / B ) } { B } \big )$ no matter how many rows (i.e., the value of $k$ ) it has. + +Theorem 10.4. If $n / B \geq e ^ { 4 . 2 }$ , then the estimation error of any Count-Min sketch that maps a set of n items following Zipfian distribution to $B$ buckets is $\Omega \big ( \frac { \ln ^ { 2 } ( \frac { n } { B } ) } { B } \big )$ + +Proof: We prove the statement by showing a reduction that given a Count-Min sketch $C M ( k )$ with hash functions $h _ { 1 } , \cdot \cdot \cdot , h _ { k } \in \{ h : [ n ] [ B / k ] \}$ constructs a single hash function $h ^ { * } : [ n ] \to [ B ]$ whose estimation error is less than or equal to the estimation error of $C M ( k )$ . + +For each item $i$ , we define $C ^ { \prime } [ i ]$ to be the bucket whose value is returned by $C M ( k )$ as the estimate of $f _ { i } ; C ^ { \prime } [ i ] : = \arg \operatorname* { m i n } _ { j \in [ k ] } C [ j , h _ { j } ( i ) ]$ . Since the total number of buckets in $C M ( k )$ is $B , | \{ C ^ { \prime } [ i ] \mid i \in$ $[ n ] \} | \leq B$ ; in other words, we only consider the subset of buckets that $C M ( k )$ uses to report the estimates of $\{ f _ { i } \mid i \in [ n ] \}$ which trivially has size at most $B$ . We define $h ^ { * }$ as follows: + +$h ^ { \ast } ( i ) = ( j ^ { \ast } , h _ { j ^ { \ast } } ( i ) ) \quad \triangleright$ for each $i \in [ n ]$ , where $j ^ { * } = \underset { i \in [ k ] } { \arg \operatorname* { m i n } } C [ j , h _ { j } ( i ) ]$ + +Unlike $C M ( k )$ , $h ^ { * }$ maps each item to exactly one bucket in $\{ C [ \ell , j ] \mid \ell \in [ k ] , j \in [ B / k ] \}$ ; hence, for each item $i$ , $C ^ { \prime } [ h ^ { * } ( i ) ] \ \leq \ C [ h ^ { * } ( i ) ] \ = \ \tilde { f } _ { i }$ where $\tilde { f } _ { i }$ is the estimate of $f _ { i }$ returned by $C M ( k )$ Moreover, since for each $i$ , $C ^ { \prime } [ h ^ { * } ( i ) ] \geq f _ { i }$ , + +Finally, by Theorem 10.3, the estimation error of $h ^ { * }$ is $\Omega \big ( \frac { \ln ^ { 2 } ( n / B ) } { B } \big )$ which implies that the estimation error of CM (k) is Ω( ln2(n/B)B ) as well.  \ No newline at end of file diff --git a/parse/train/r1lohoCqY7/r1lohoCqY7_content_list.json b/parse/train/r1lohoCqY7/r1lohoCqY7_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..e5223ff79685e1990b7081d31e587ac43b28b7aa --- /dev/null +++ b/parse/train/r1lohoCqY7/r1lohoCqY7_content_list.json @@ -0,0 +1,2993 @@ +[ + { + "type": "text", + "text": "LEARNING-BASED FREQUENCY ESTIMATION ALGORITHMS ", + "text_level": 1, + "bbox": [ + 173, + 98, + 769, + 118 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Chen-Yu Hsu, Piotr Indyk, Dina Katabi & Ali Vakilian ", + "bbox": [ + 183, + 143, + 566, + 159 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Computer Science and Artificial Intelligence Lab Massachusetts Institute of Technology Cambridge, MA 02139, USA {cyhsu,indyk,dk,vakilian}@mit.edu ", + "bbox": [ + 184, + 160, + 506, + 215 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 454, + 251, + 544, + 266 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Estimating the frequencies of elements in a data stream is a fundamental task in data analysis and machine learning. The problem is typically addressed using streaming algorithms which can process very large data using limited storage. Today’s streaming algorithms, however, cannot exploit patterns in their input to improve performance. We propose a new class of algorithms that automatically learn relevant patterns in the input data and use them to improve its frequency estimates. The proposed algorithms combine the benefits of machine learning with the formal guarantees available through algorithm theory. We prove that our learning-based algorithms have lower estimation errors than their non-learning counterparts. We also evaluate our algorithms on two real-world datasets and demonstrate empirically their performance gains. ", + "bbox": [ + 233, + 284, + 764, + 436 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1. INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 459, + 328, + 474 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Classical algorithms provide formal guarantees over their performance, but often fail to leverage useful patterns in their input data to improve their output. On the other hand, deep learning models are highly successful at capturing and utilizing complex data patterns, but often lack formal error bounds. The last few years have witnessed a growing effort to bridge this gap and introduce algorithms that can adapt to data properties while delivering worst case guarantees. Deep learning modules have been integrated into the design of Bloom filters (Kraska et al., 2018; Mitzenmacher, 2018), caching algorithms (Lykouris & Vassilvitskii, 2018), graph optimization (Dai et al., 2017), similarity search (Salakhutdinov & Hinton, 2009; Weiss et al., 2009) and compressive sensing (Bora et al., 2017). This paper makes a significant step toward this vision by introducing frequency estimation streaming algorithms that automatically learn to leverage the properties of the input data. ", + "bbox": [ + 174, + 483, + 825, + 622 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Estimating the frequencies of elements in a data stream is one of the most fundamental subroutines in data analysis. It has applications in many areas of machine learning, including feature selection (Aghazadeh et al., 2018), ranking (Dzogang et al., 2015), semi-supervised learning (Talukdar & Cohen, 2014) and natural language processing (Goyal et al., 2012). It has been also used for network measurements (Estan & Varghese, 2003; Yu et al., 2013; Liu et al., 2016) and security (Schechter et al., 2010). Frequency estimation algorithms have been implemented in popular data processing libraries, such as Algebird at Twitter (Boykin et al., 2016). They can answer practical questions like: what are the most searched words on the Internet? or how much traffic is sent between any two machines in a network? ", + "bbox": [ + 174, + 628, + 825, + 755 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The frequency estimation problem is formalized as follows: given a sequence $S$ of elements from some universe $U$ , for any element $i \\in U$ , estimate $f _ { i }$ , the number of times $i$ occurs in $S$ . If one could store all arrivals from the stream $S$ , one could sort the elements and compute their frequencies. However, in big data applications, the stream is too large (and may be infinite) and cannot be stored. This challenge has motivated the development of streaming algorithms, which read the elements of $S$ in a single pass and compute a good estimate of the frequencies using a limited amount of space.1 Over the last two decades, many such streaming algorithms have been developed, including ", + "bbox": [ + 174, + 761, + 825, + 859 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Count-Sketch (Charikar et al., 2002), Count-Min (Cormode & Muthukrishnan, 2005b) and multistage filters (Estan & Varghese, 2003). The performance guarantees of these algorithms are wellunderstood, with upper and lower bounds matching up to $O ( \\cdot )$ factors (Jowhari et al., 2011). ", + "bbox": [ + 176, + 103, + 823, + 146 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "However, such streaming algorithms typically assume generic data and do not leverage useful patterns or properties of their input. For example, in text data, the word frequency is known to be inversely correlated with the length of the word. Analogously, in network data, certain applications tend to generate more traffic than others. If such properties can be harnessed, one could design frequency estimation algorithms that are much more efficient than the existing ones. Yet, it is important to do so in a general framework that can harness various useful properties, instead of using handcrafted methods specific to a particular pattern or structure (e.g., word length, application type). ", + "bbox": [ + 174, + 152, + 823, + 251 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "In this paper, we introduce learning-based frequency estimation streaming algorithms. Our algorithms are equipped with a learning model that enables them to exploit data properties without being specific to a particular pattern or knowing the useful property a priori. We further provide theoretical analysis of the guarantees associated with such learning-based algorithms. ", + "bbox": [ + 176, + 257, + 825, + 313 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We focus on the important class of “hashing-based” algorithms, which includes some of the most used algorithms such as Count-Min, Count-Median and Count-Sketch. Informally, these algorithms hash data items into $B$ buckets, count the number of items hashed into each bucket, and use the bucket value as an estimate of item frequency. The process can be repeated using multiple hash functions to improve accuracy. Hashing-based algorithms have several useful properties. In particular, they can handle item deletions, which are implemented by decrementing the respective counters. Furthermore, some of them (notably Count-Min) never underestimate the true frequencies, i.e., $\\tilde { f _ { i } } \\geq f _ { i }$ holds always. However, hashing algorithms lead to estimation errors due to collisions: when two elements are mapped to the same bucket, they affect each others’ estimates. Although collisions are unavoidable given the space constraints, the overall error significantly depends on the pattern of collisions. For example, collisions between high-frequency elements (“heavy hitters”) result in a large estimation error, and ideally should be minimized. The existing algorithms, however, use random hash functions, which means that collisions are controlled only probabilistically. ", + "bbox": [ + 174, + 320, + 825, + 501 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our idea is to use a small subset of $S$ , call it $S ^ { \\prime }$ , to learn the heavy hitters. We can then assign heavy hitters their own buckets to avoid the more costly collisions. It is important to emphasize that we are learning the properties that identify heavy hitters as opposed to the identities of the heavy hitters themselves. For example, in the word frequency case, shorter words tend to be more popular. The subset $S ^ { \\prime }$ itself may miss many of the popular words, but whichever words popular in $S ^ { \\prime }$ are likely to be short. Our objective is not to learn the identity of high frequency words using $S ^ { \\prime }$ . Rather, we hope that a learning model trained on $S ^ { \\prime }$ learns that short words are more frequent, so that it can identify popular words even if they did not appear in $S ^ { \\prime }$ . ", + "bbox": [ + 174, + 508, + 825, + 621 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Our main contributions are as follows: ", + "bbox": [ + 176, + 627, + 426, + 642 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• We introduce learning-based frequency estimation streaming algorithms, which learn the properties of heavy hitters in their input and exploit this information to reduce errors • We provide performance guarantees showing that our algorithms can deliver a logarithmic factor improvement in the error bound over their non-learning counterparts. Furthermore, we show that our learning-based instantiation of Count-Min, a widely used algorithm, is asymptotically optimal among all instantiations of that algorithm. See Table 4.1 in section 4.1 for the details. We evaluate our learning-based algorithms using two real-world datasets: traffic load on an Internet backbone link and search query popularity. In comparison to their non-learning counterparts, our algorithms yield performance gains that range from $18 \\%$ to $71 \\%$ . ", + "bbox": [ + 215, + 648, + 825, + 803 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2. RELATED WORK ", + "text_level": 1, + "bbox": [ + 174, + 816, + 338, + 832 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Frequency estimation in data streams. Frequency estimation, and the closely related problem of finding frequent elements in a data stream, are some of the most fundamental and well-studied problems in streaming algorithms, see Cormode & Hadjieleftheriou (2008) for an overview. Hashingbased algorithms such as Count-Sketch (Charikar et al., 2002), Count-Min (Cormode & Muthukrishnan, 2005b) and multi-stage filters (Estan & Varghese, 2003) are widely used solutions for these problems. These algorithms also have close connections to sparse recovery and compressed sensing (Candes et al., 2006; Donoho, 2006), where the hashing output can be considered as a com- \\` pressed representation of the input data (Gilbert & Indyk, 2010). ", + "bbox": [ + 174, + 840, + 825, + 924 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 821, + 132 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Several “non-hashing” algorithms for frequency estimation have been also proposed (Misra & Gries, 1982; Demaine et al., 2002; Karp et al., 2003; Metwally et al., 2005). These algorithms do not possess many of the properties of hashing-based methods listed in the introduction (such as the ability to handle deletions), but they often have better accuracy/space tradeoffs. For a fair comparison, our evaluation focuses only on hashing algorithms. However, our approach for learning heavy hitters should be useful for non-hashing algorithms as well. ", + "bbox": [ + 174, + 138, + 823, + 222 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Some papers have proposed or analyzed frequency estimation algorithms customized to data that follows Zipf Law (Charikar et al., 2002; Cormode & Muthukrishnan, 2005a; Metwally et al., 2005; Minton & Price, 2014; Roy et al., 2016); the last algorithm is somewhat similar to the “lookup table” implementation of the heavy hitter oracle that we use as a baseline in our experiments. Those algorithms need to know the data distribution a priori, and apply only to one distribution. In contrast, our learning-based approach applies to any data property or distribution, and does not need to know that property or distribution a priori. ", + "bbox": [ + 174, + 229, + 825, + 327 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Learning-based algorithms. Recently, researchers have begun exploring the idea of integrating machine learning models into algorithm design. In particular, researchers have proposed improving compressed sensing algorithms, either by using neural networks to improve sparse recovery algorithms (Mousavi et al., 2017; Bora et al., 2017), or by designing linear measurements that are optimized for a particular class of vectors (Baldassarre et al., 2016; Mousavi et al., 2015), or both. The latter methods can be viewed as solving a problem similar to ours, as our goal is to design “measurements” of the frequency vector $( f _ { 1 } , f _ { 2 } \\ldots , f _ { | U | } )$ tailored to a particular class of vectors. However, the aforementioned methods need to explicitly represent a matrix of size $B \\times | U |$ , where $B$ is the number of buckets. Hence, they are unsuitable for streaming algorithms which, by definition, have space limitations much smaller than the input size. ", + "bbox": [ + 174, + 337, + 825, + 477 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Another class of problems that benefited from machine learning is distance estimation, i.e., compression of high-dimensional vectors into compact representations from which one can estimate distances between the original vectors. Early solutions to this problem, such as Locality-Sensitive Hashing, have been designed for worst case vectors. Over the last decade, numerous methods for learning such representations have been developed (Salakhutdinov & Hinton, 2009; Weiss et al., 2009; Jegou et al., 2011; Wang et al., 2016). Although the objective of those papers is similar to ours, their techniques are not usable in our applications, as they involve a different set of tools and solve different problems. ", + "bbox": [ + 174, + 483, + 825, + 595 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "More broadly, there have been several recent papers that leverage machine learning to design more efficient algorithms. The authors of (Dai et al., 2017) show how to use reinforcement learning and graph embedding to design algorithms for graph optimization (e.g., TSP). Other learning-augmented combinatorial optimization problems are studied in (He et al., 2014; Balcan et al., 2018; Lykouris & Vassilvitskii, 2018). More recently, (Kraska et al., 2018; Mitzenmacher, 2018) have used machine learning to improve indexing data structures, including Bloom filters that (probabilistically) answer queries of the form “is a given element in the data set?” As in those papers, our algorithms use neural networks to learn certain properties of the input. However, we differ from those papers both in our design and theoretical analysis. Our algorithms are designed to reduce collisions between heavy items, as such collisions greatly increase errors. In contrast, in existence indices, all collisions count equally. This also leads to our theoretical analysis being very different from that in (Mitzenmacher, 2018). ", + "bbox": [ + 173, + 602, + 825, + 767 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3. PRELIMINARIES ", + "text_level": 1, + "bbox": [ + 176, + 784, + 331, + 799 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1. ESTIMATION ERROR ", + "text_level": 1, + "bbox": [ + 176, + 804, + 349, + 819 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We will use $e _ { i } : = | \\tilde { f } _ { i } - f _ { i } |$ to denote the estimation error for $f _ { i }$ . To measure the overall estimation error between the frequencies $\\mathcal { F } = \\{ f _ { 1 } , f _ { 2 } , \\cdot \\cdot \\cdot , f _ { | U | } \\}$ and their estimates $\\tilde { \\mathcal { F } } = \\{ \\tilde { f } _ { 1 } , \\tilde { f } _ { 2 } , \\cdot \\cdot \\cdot , \\tilde { f } _ { | U | } \\}$ , we will use the expected error $E _ { i \\sim \\mathcal { D } } [ e _ { i } ]$ , where $\\mathcal { D }$ models the distribution over the queries to the data structure. Similar to past work (Roy et al., 2016), we assume the query distribution $\\mathcal { D }$ is the same as the distribution of the input stream, i.e., for any $j$ we have $\\mathrm { P r } _ { i \\sim \\mathcal { D } } [ i = j ] = f _ { j } / N$ , where $N$ is the sum of all frequencies. This leads to the estimation error of $\\tilde { \\mathcal { F } }$ with respect to $\\mathcal { F }$ ", + "bbox": [ + 174, + 828, + 825, + 904 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 102, + 740, + 117 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/e755bcbcb71e52c857d3988b4a20f589de471617b199ab63acfce2d68c4ef3a5.jpg", + "text": "$$\n\\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } ) : = 1 / N \\sum _ { i \\in U } | \\tilde { f } _ { i } - f _ { i } | \\cdot f _ { i }\n$$", + "text_format": "latex", + "bbox": [ + 377, + 117, + 619, + 150 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We note that the theoretical guarantees of frequency estimation algorithms are typically phrased in the “ $( \\epsilon , \\delta )$ -form”, e.g., $\\mathrm { P r } [ | \\bar { \\tilde { f } } _ { i } - f _ { i } | > \\epsilon N ] < \\delta$ for every $i$ (see e.g., Cormode & Muthukrishnan (2005b)). However, this formulation involves two objectives $\\stackrel { \\cdot } { \\epsilon }$ and $\\delta$ ). We believe that the (single objective) expected error in Equation 3.1 is more natural from the machine learning perspective. ", + "bbox": [ + 173, + 155, + 823, + 213 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2. ALGORITHMS FOR FREQUENCY ESTIMATION ", + "text_level": 1, + "bbox": [ + 174, + 219, + 522, + 234 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In this section, we recap three variants of hashing-based algorithms for frequency estimation. ", + "bbox": [ + 169, + 241, + 782, + 257 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Single Hash Function. The basic hashing algorithm uses a single uniformly random hash function $h : { \\bar { U } } [ B ]$ , where we use $[ B ]$ to denote the set $\\{ 1 \\ldots B \\bar { \\} }$ . The algorithm maintains a onedimensional array $C [ 1 \\ldots B ]$ , in which all entries are initialized to 0. Given an element $i$ , the algorithm increments $C [ h ( i ) ]$ . It can be seen that at the end of the stream, we have $\\begin{array} { r } { C [ b ] = \\sum _ { j : h ( j ) = b } \\mathsf { \\bar { f } } _ { j } } \\end{array}$ . The estimate $\\tilde { f } _ { i }$ of $f _ { i }$ is defined as $\\begin{array} { r } { \\tilde { f } _ { i } = C [ h ( i ) ] = \\sum _ { j : h ( i ) = h ( j ) } f _ { j } } \\end{array}$ . Note that it is always the case that $\\tilde { f _ { i } } \\geq f _ { i }$ . ", + "bbox": [ + 173, + 265, + 825, + 361 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Count-Min. We have $k$ distinct hash functions $h _ { i } : U \\to [ B ]$ and an array $C$ of size $k \\times B$ . The algorithm maintains $C$ , such that at the end of the stream we have $\\begin{array} { r } { C [ \\ell , b ] = \\sum _ { j : h \\ell ( j ) = b } f _ { j } } \\end{array}$ . For each $i \\in U$ , the frequency estimate $\\tilde { f } _ { i }$ is equal to $\\begin{array} { r } { \\operatorname* { m i n } _ { \\ell \\le k } C [ \\ell , h _ { \\ell } ( i ) ] } \\end{array}$ , and always satisfies $\\tilde { f _ { i } } \\geq f _ { i }$ . ", + "bbox": [ + 173, + 368, + 825, + 417 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Count-Sketch. Similarly to Count-Min, we have $k$ distinct hash functions $h _ { i } : U \\to [ B ]$ and an array $C$ of size $k \\times B$ . Additionally, in Count-Sketch, we have $k$ sign functions $g _ { i } : U \\stackrel { \\cdot } { } \\bar { \\{ - 1 , 1 \\} }$ , and the algorithm maintains $C$ such that $\\begin{array} { r } { C [ \\ell , b ] = \\sum _ { j : h _ { \\ell } ( j ) = b } f _ { j } \\cdot g _ { \\ell } ( j ) } \\end{array}$ . For each $\\textit { i } \\in \\textit { U }$ , the frequency estimate $\\tilde { f } _ { i }$ is equal to the median of $\\{ g _ { \\ell } ( i ) \\cdot C [ \\ell , h _ { \\ell } ( i ) ] \\} _ { \\ell \\le k }$ . Note that unlike the previous two methods, here we may have $\\tilde { f _ { i } } < f _ { i }$ . ", + "bbox": [ + 173, + 425, + 825, + 505 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.3. ZIPFIAN DISTRIBUTION ", + "text_level": 1, + "bbox": [ + 174, + 511, + 372, + 525 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In our theoretical analysis we assume that the item frequencies follow the Zipf Law. That is, if we re-order the items so that their frequencies appear in a sorted order $f _ { i _ { 1 } } \\geq f _ { i _ { 2 } } \\geq . . . \\geq f _ { i _ { n } }$ , then $f _ { i _ { j } } \\propto 1 / j$ . To simplify the notation we assume that $f _ { i } = 1 / i$ . ", + "bbox": [ + 174, + 531, + 825, + 575 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "4. LEARNING-BASED FREQUENCY ESTIMATION ALGORITHMS ", + "text_level": 1, + "bbox": [ + 176, + 587, + 694, + 604 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We aim to develop frequency estimation algorithms that exploit data properties for better performance. To do so, we learn an oracle that identifies heavy hitters, and use the oracle to assign each heavy hitter its unique bucket to avoid collisions. Other items are simply hashed using any classic frequency estimation algorithm (e.g., Count-Min, or Count-Sketch), as shown in the block-diagram in Figure 4.1. This design has two useful properties: First, it allows us to augment a classic frequency estimation algorithm with learning capabilities, producing a learning-based counterpart that inherits the original guarantees of the classic algorithm. For example, if the classic algorithm is Count-Min, the resulting learning-based algorithm never underestimates the frequencies. Second, it provably reduces the estimation errors, and for the case of Count-Min it is (asymptotically) optimal. ", + "bbox": [ + 173, + 611, + 825, + 738 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Algorithm 1 provides pseudo code for our design. The design assumes an oracle $\\mathsf { H H } ( i )$ that attempts to determine whether an item $i$ is a “heavy hitter” or not. All items classified as heavy hitters are assigned to one of the $B _ { r }$ unique buckets reserved for heavy items. All other items are fed to the remaining $B - B _ { r }$ buckets using a conventional frequency estimation algorithm SketchAlg (e.g., Count-Min or Count-Sketch). ", + "bbox": [ + 174, + 744, + 825, + 814 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The estimation procedure is analogous. To compute $\\tilde { f } _ { i }$ , the algorithm first checks whether $i$ is stored in a unique bucket, and if so, reports its count. Otherwise, it queries the SketchAlg procedure. Note that if the element is stored in a unique bucket, its reported count is exact, i.e., $\\tilde { f _ { i } } = f _ { i }$ . ", + "bbox": [ + 174, + 820, + 825, + 867 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "The oracle is constructed using machine learning and trained with a small subset of $S$ , call it $S ^ { \\prime }$ . Note that the oracle learns the properties that identify heavy hitters as opposed to the identities of the heavy hitters themselves. For example, in the case of word frequency, the oracle would learn that shorter words are more frequent, so that it can identify popular words even if they did not appear in the training set $S ^ { \\prime }$ . ", + "bbox": [ + 174, + 873, + 825, + 915 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 103, + 823, + 132 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.1. ANALYSIS ", + "text_level": 1, + "bbox": [ + 174, + 138, + 281, + 154 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Our algorithms combine simplicity with strong error bounds. Below, we summarize our theoretical results, and leave all theorems, lemmas, and proofs to the appendix. In particular, Table 4.1 lists the results proven in this paper, where each row refers to a specific streaming algorithm, its corresponding error bound, and the theorem/lemma that proves the bound. ", + "bbox": [ + 174, + 160, + 823, + 215 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "First, we show (Theorem 9.11 and Theorem 9.14) that if the heavy hitter oracle is accurate, then the error of the learned variant of Count-Min is up to a logarithmic factor smaller than that of its nonlearning counterpart. The improvement is maximized when $B$ is of the same order as $n$ (a common scenario2). Furthermore, we prove that this result continues to hold even if the learned oracle makes prediction errors with probability $\\delta$ , as long as $\\delta = { \\cal O } ( 1 / \\ln n )$ (Lemma 9.15). ", + "bbox": [ + 174, + 223, + 825, + 294 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Second, we show that, asymptotically, our learned Count-Min algorithm cannot be improved any further by designing a better hashing scheme. Specifically, for the case of Learned Count-Min with a perfect oracle, our design achieves the same asymptotic error as the “Ideal Count-Min”, which optimizes its hash function for the given input (Theorem 10.4). ", + "bbox": [ + 173, + 299, + 825, + 356 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/9d78dd753541e132318969338b9f40dfeb1894d9deca393806a0c8c053c0df21.jpg", + "table_caption": [ + "Finally, we note that the learning-augmented algorithm inherits any $( \\epsilon , \\delta )$ -guarantees of the original version. Specifically, its error is not larger than that of SketchAlg with space $B - B _ { r }$ , for any input. ", + "Algorithm 1 Learning-Based Frequency Estimation " + ], + "table_footnote": [], + "table_body": "
AlgorithmsExpected ErrorAnalysis
Single Hash Function (B)(ln² n/B)Lemma 9.2
Count-Min Sketch (k,B)Ω(k lnnand O( (管)BlnkBTheorem 9.11
Learned Count-Min(B)0(ln²(n/B)/B)Theorem 9.14
Ideal Count-Min(B)(ln²(n/B)/B)Theorem 10.4
", + "bbox": [ + 214, + 397, + 784, + 488 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Table 4.1: Our performance bounds for different algorithms on streams with frequencies obeying Zipf Law. $k$ is a constant $\\left( \\geq 2 \\right)$ that refers to the number of hash functions, $B$ is the number of buckets, and $n$ is the number of distinct elements. The space complexity of all algorithms is the same, $\\Theta ( B )$ . See section 9.4 for non-asymptotic versions of the some of the above bounds ", + "bbox": [ + 173, + 489, + 826, + 545 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "5. EXPERIMENTS ", + "text_level": 1, + "bbox": [ + 174, + 558, + 320, + 573 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Baselines. We compare our learning-based algorithms with their non-learning counterparts. Specifically, we augment Count-Min with a learned oracle using Algorithm 1, and call the learningaugmented algorithm “Learned Count-Min”. We then compare Learned Count-Min with traditional Count-Min. We also compare it with “Learned Count-Min with Ideal Oracle” where the neuralnetwork oracle is replaced with an ideal oracle that knows the identities of the heavy hitters in the test data, and “Table Lookup with Count-Min” where the heavy hitter oracle is replaced with a lookup table that memorizes heavy hitters in the training set. The comparison with the latter baseline allows ", + "bbox": [ + 173, + 583, + 825, + 681 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "2For example, Goyal et al. (2012) uses $B = 2 0 M , n = 3 3 . 5 M$ and $B = 5 0 M , n = 9 4 M$ us to show the ability of Learned Count-Min to generalize and detect heavy items unseen in the training set. We repeat the evaluation where we replace Count-Min (CM) with Count-Sketch (CS) and the corresponding variants. We use validation data to select the best $k$ for all algorithms. ", + "bbox": [ + 192, + 689, + 728, + 703 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/252885ebf6210b3d238af495bc61e87c586a3d4bfea456512057661696199ae3.jpg", + "image_caption": [], + "image_footnote": [], + "bbox": [ + 642, + 727, + 825, + 881 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/0f609aabef3527949ff1e2f40a522d0558977d0ed1e07fcdc75b200947cb9c6f.jpg", + "image_caption": [ + "Figure 4.1: Pseudo-code and block-diagram representation of our algorithms " + ], + "image_footnote": [], + "bbox": [ + 176, + 734, + 535, + 900 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 146 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Training a Heavy Hitter Oracle. We construct the heavy hitter oracle by training a neural network to predict the heaviness of an item. Note that the prediction of the network is not the final estimation. It is used in Algorithm 1 to decide whether to assign an item to a unique bucket. We train the network to predict the item counts (or the log of the counts) and minimize the squared loss of the prediction. Empirically, we found that when the counts of heavy items are few orders of magnitude larger than the average counts (as is the case for the Internet traffic data set), predicting the log of the counts leads to more stable training and better results. Once the model is trained, we select the optimal cutoff threshold using validation data, and use the model as the oracle described in Algorithm 1. ", + "bbox": [ + 173, + 155, + 825, + 267 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "5.1. INTERNET TRAFFIC ESTIMATION ", + "text_level": 1, + "bbox": [ + 176, + 273, + 436, + 287 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "For our first experiment, the goal is to estimate the number of packets for each network flow. A flow is a sequence of packets between two machines on the Internet. It is identified by the IP addresses of its source and destination and the application ports. Estimating the size of each flow i – i.e., the number of its packets $f _ { i }$ – is a basic task in network management (Sivaraman et al., 2017). ", + "bbox": [ + 173, + 295, + 821, + 352 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Dataset: The traffic data is collected at a backbone link of a Tier1 ISP between Chicago and Seattle in 2016 (CAIDA). Each recording session is around one hour. Within each minute, there are around 30 million packets and 1 million unique flows. For a recording session, we use the first 7 minutes for training, the following minute for validation, and estimate the packet counts in subsequent minutes. The distribution of packet counts over Internet flows is heavy tailed, as shown in Figure 5.1. ", + "bbox": [ + 174, + 361, + 653, + 458 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/b84b0ce8368f6022901baab3cb4d2dcb230dbf4255eca9de78b09e8231f0267a.jpg", + "image_caption": [ + "Figure 5.1: Frequency of Internet Flows " + ], + "image_footnote": [], + "bbox": [ + 666, + 366, + 823, + 482 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Model: The patterns of the Internet traffic are very dynamic, i.e., the flows with heavy traffic change frequently from one minute to the next. However, we hypothesize that the space of IP addresses should be smooth in terms of traffic load. For example, data centers at large companies and university campuses with many students tend to generate heavy traffic. Thus, though the individual flows from these sites change frequently, we could still discover regions of IP addresses with heavy traffic through a learning approach. ", + "bbox": [ + 173, + 468, + 651, + 510 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 511, + 821, + 565 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "We trained a neural network to predict the log of the packet counts for each flow. The model takes as input the IP addresses and ports in each packet. We use two RNNs to encode the source and destination IP addresses separately. The RNN takes one bit of the IP address at each step, starting from the most significant bit. We use the final states of the RNN as the feature vector for an IP address. The reason to use RNN is that the patterns in the bits are hierarchical, i.e., the more significant bits govern larger regions in the IP space. Additionally, we use two-layer fully-connected networks to encode the source and destination ports. We then concatenate the encoded IP vectors, encoded port vectors, and the protocol type as the final features to predict the packet counts 3. The inference time takes 2.8 microseconds per item on a single GPU without any optimizations4. ", + "bbox": [ + 173, + 571, + 825, + 696 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Results: We plot the results of two representative test minutes (the 20th and 50th) in Figure 5.2. All plots in the figure refer to the estimation error (Equation 3.1) as a function of the used space. The space includes space for storing the buckets and the model. Since we use the same model for all test minutes, the model space is amortized over the 50-minute testing period. ", + "bbox": [ + 174, + 707, + 825, + 763 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Figure 5.2 reveals multiple findings. First, the figure shows that our learning-based algorithms exhibit a better performance than their non-learning counterparts. Specifically, Learned Count-Min, compared to Count-Min, reduces the the error by $32 \\%$ with space of $0 . 5 \\mathrm { M B }$ and $42 \\%$ with space of 1.0 MB (Figure 5.2a). Learned Count-Sketch, compared to Count-Sketch, reduces the error by $52 \\%$ at $0 . 5 \\mathrm { M B }$ and $57 \\%$ at $1 . 0 \\mathrm { M B }$ (Figure 5.2c). In our experiments, each regular bucket takes 4 bytes. For the learned versions, we account for the extra space needed for the unique buckets to store the item IDs and the counts. One unique bucket takes 8 bytes, twice the space of a normal bucket.5 ", + "bbox": [ + 173, + 770, + 825, + 825 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/31362a49cb96f873e0865d27e2c41b0fdbaa09351ba6398012285fa04ea9cdf5.jpg", + "image_caption": [ + "(c) Learned Count-Sketch - 20th test minute (d) Learned Count-Sketch - 50th test minute ", + "Figure 5.2: Comparison of our algorithms with Count-Min and Count-Sketch on Internet traffic data. " + ], + "image_footnote": [], + "bbox": [ + 240, + 101, + 756, + 435 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 473, + 823, + 515 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Second, the figure also shows that our neural-network oracle performs better than memorizing the heavy hitters in a lookup table. This is likely due to the dynamic nature of Internet traffic –i.e., the heavy flows in the training set are significantly different from those in the test data. Hence, memorization does not work well. On the other hand, our model is able to extract structures in the input that generalize to unseen test data. ", + "bbox": [ + 174, + 522, + 825, + 592 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Third, the figure shows that our model’s performance stays roughly the same from the 20th to the 50th minute (Figure 5.2b and Figure 5.2d), showing that it learns properties of the heavy items that generalize over time. ", + "bbox": [ + 174, + 599, + 825, + 640 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Lastly, although we achieve significant improvement over Count-Min and Count-Sketch, our scheme can potentially achieve even better results with an ideal oracle, as shown by the dashed green line in Figure 5.2. This indicates potential gains from further optimizing the neural network model. ", + "bbox": [ + 174, + 647, + 825, + 690 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.2. SEARCH QUERY ESTIMATION ", + "text_level": 1, + "bbox": [ + 176, + 696, + 413, + 712 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "For our second experiment, the goal is to estimate the number of times a search query appears. ", + "bbox": [ + 174, + 718, + 651, + 747 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Dataset: We use the AOL query log dataset, which consists of 21 million search queries collected from 650 thousand users over 90 days. The users are anonymized in the dataset. There are 3.8 million unique queries. Each query is a search phrase with multiple words (e.g., “periodic table element poster”). We use the first 5 days for training, the following day for validation, and estimate the number of times different search queries appear in subsequent days. The distribution of search query frequency follows the Zipfian law, as shown in Figure 5.3 ", + "bbox": [ + 174, + 756, + 653, + 867 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/20e2bd33e1890ca9b86c1ffbbb65404bf01275ae33a787b13fc82565319f8a2e.jpg", + "image_caption": [ + "Figure 5.3: Frequency of search queries " + ], + "image_footnote": [], + "bbox": [ + 666, + 723, + 823, + 842 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/a37a40112838b97af1ac8400a471270b5b3284f5b83e68a8a21a640b55508c1f.jpg", + "image_caption": [ + "Figure 5.4: Comparison of our algorithms with Count-Min and Count-Sketch on search query data. " + ], + "image_footnote": [], + "bbox": [ + 173, + 99, + 825, + 250 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Model: Unlike traffic data, popular search queries tend to appear more consistently across multiple days. For example, “google” is the most popular search phrase in most of the days in the dataset. Simply storing the most popular words can easily construct a reasonable heavy hitter predictor. However, beyond remembering the popular words, other factors also contribute to the popularity of a search phrase that we can learn. For example, popular search phrases appearing in slightly different forms may be related to similar topics. Though not included in the AOL dataset, in general, metadata of a search query (e.g., the location of the search) can provide useful context of its popularity. ", + "bbox": [ + 173, + 273, + 825, + 371 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "To construct the heavy hitter oracle, we trained a neural network to predict the number of times a search phrase appears. To process the search phrase, we train an RNN with LSTM cells that takes characters of a search phrase as input. The final states encoded by the RNN are fed to a fully-connected layer to predict the query frequency. Our character vocabulary includes lower-case English alphabets, numbers, punctuation marks, and a token for unknown characters. We map the character IDs to embedding vectors before feeding them to the ${ \\mathsf { R N N } } ^ { 6 }$ . We choose RNN due to its effectiveness in processing sequence data (Sutskever et al., 2014; Graves, 2013; Kraska et al., 2018). ", + "bbox": [ + 173, + 377, + 825, + 476 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Results: We plot the estimation error vs. space for two representative test days (the 50th and 80th day) in Figure 5.4. As before, the space includes both the bucket space and the space used by the model. The model space is amortized over the test days since the same model is used for all days. ", + "bbox": [ + 174, + 486, + 825, + 526 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Similarly, our learned sketches outperforms their conventional counterparts. For Learned CountMin, compared to Count-Min, it reduces the loss by $18 \\%$ at $0 . 5 \\mathrm { M B }$ and $52 \\%$ at $1 . 0 \\mathrm { M B }$ (Figure 5.4a). For Learned Count-Sketch, compared to Count-Sketch, it reduces the loss by $24 \\%$ at $0 . 5 \\mathrm { \\bf M B }$ and $71 \\%$ at $1 . 0 \\mathrm { { M B } }$ (Figure 5.4c). Further, our algorithm performs similarly for the 50th and the 80th day (Figure 5.4b and Figure 5.4d), showing that the properties it learns generalize over a long period. ", + "bbox": [ + 174, + 534, + 825, + 604 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "The figures also show an interesting difference from the Internet traffic data: memorizing the heavy hitters in a lookup table is quite effective in the low space region. This is likely because the search queries are less dynamic compared to Internet traffic (i.e., top queries in the training set are also popular on later days). However, as the algorithm is allowed more space, memorization becomes ineffective. ", + "bbox": [ + 174, + 609, + 825, + 680 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5.3. ANALYZING HEAVY HITTER MODELS ", + "text_level": 1, + "bbox": [ + 178, + 688, + 470, + 702 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We analyze the accuracy of the neural network heavy hitter models to better understand the results on the two datasets. Specifically, we use the models to predict whether an item is a heavy hitter (top $1 \\%$ in counts) or not, and plot the ROC curves in Figure 5.5. The figures show that the model for the Internet traffic data has learned to predict heavy items more effectively, with an AUC score of 0.9. As for the model for search query data, the AUC score is 0.8. This also explains why we see larger improvements over non-learning algorithms in Figure 5.2. ", + "bbox": [ + 174, + 709, + 490, + 876 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/74f2bb356dc02917bd9b450512f6a7a2ae07a4b54d38462f30771d1570c79025.jpg", + "image_caption": [ + "Figure 5.5: ROC curves of the learned models. " + ], + "image_footnote": [], + "bbox": [ + 501, + 713, + 823, + 859 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "6. EMBEDDING SPACE VISUALIZATION ", + "text_level": 1, + "bbox": [ + 173, + 102, + 501, + 118 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this section, we visualize the embedding spaces learned by our heavy hitter models to shed light on the properties or structures the models learned. Specifically, we take the neural network activations before the final fully-connected layer, and visualize them in a 2-dimensional space using t-SNE (Maaten & Hinton, 2008). To illustrate the differences between heavy hitters (top $1 \\%$ i n counts) and the rest (“light” items), we randomly sample an equal amount of examples from both classes. We visualize the embedding space for both the Internet traffic and search query datasets. ", + "bbox": [ + 173, + 126, + 825, + 210 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We show the embedding space learned by the model on the Internet traffic data in Figure 6.1. Each point in the scatter plot represents one Internet traffic flow. By coloring each flow with its number of packets in Figure 6.1a, we see that the model separate flows with more packets (green and yellow clusters) from flows with fewer packets (blue clusters). To understand what structure the model learns to separate these flows, we color each flow with its destination IP address in Figure 6.1b. We found that clusters with more packets are often formed by flows sharing similar destination address prefixes. Interestingly, the model learns to group flows with similar IP prefixes closer in the embedding space. For example, the dark blue cluster at the upper left of Figure 6.1b shares a destination IP address prefix “1.96.\\*.\\*”. Learning this “structure” from the Internet traffic data allows the model to generalize to packets unseen in the training set. ", + "bbox": [ + 173, + 217, + 825, + 356 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/cde0a5c924361a411fcb25b50a80e7b22ba2585568bfe5b2749b8e6ca6968c11.jpg", + "image_caption": [ + "Figure 6.1: Visualization of the embedding space learned by our model on the Internet traffic data. Each point in the scatter plot represents one network flow. " + ], + "image_footnote": [], + "bbox": [ + 202, + 366, + 799, + 542 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "We show the embedding space learned by the model on the search query data in Figure 6.2. Each point in the scatter plot represents one search query. Similarly, the model learns to separate frequent search queries from the rest in Figure 6.2a. By coloring the queries with the number of characters in Figure 6.2b, we have multiple interesting findings. First, queries with similar length are closer in the embedding space, and the y-axis forms the dimension representing query length. Second, if we simply use the query length to predict heavy hitters, many light queries will be misclassified. The model must have learned other structures to separate heavy hitters in Figure 6.2a. ", + "bbox": [ + 173, + 583, + 825, + 681 + ], + "page_idx": 8 + }, + { + "type": "image", + "img_path": "images/07d5243c1460961e52df4412b6854f5658eec23fe6e39fb94b87ee8abf5b7f8f.jpg", + "image_caption": [ + "Figure 6.2: Visualization of the embedding space learned by our model on the search query data. Each point in the scatter plot represents one search query. " + ], + "image_footnote": [], + "bbox": [ + 202, + 690, + 799, + 872 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "7. CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 102, + 312, + 117 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "We have presented a new approach for designing frequency estimation streaming algorithms by augmenting them with a learning model that exploits data properties. We have demonstrated the benefits of our design both analytically and empirically. We envision that our work will motivate a deeper integration of learning in algorithm design, leading to more efficient algorithms. ", + "bbox": [ + 174, + 126, + 825, + 183 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "8. ACKNOWLEDGEMENTS ", + "text_level": 1, + "bbox": [ + 174, + 196, + 390, + 212 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "The authors would like to thank the anonymous reviewers for helpful comments. The work was partially supported by NSF TRIPODS award #1740751, NSF AITF award #1535851 and Simons Investigator Award. We also thank the various companies sponsoring the MIT Center for Wireless Networks and Mobile Computing. ", + "bbox": [ + 174, + 220, + 825, + 276 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 291, + 287, + 306 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Amirali Aghazadeh, Ryan Spring, Daniel LeJeune, Gautam Dasarathy, Anshumali Shrivastava, and Richard G Baraniuk. Mission: Ultra large-scale feature selection using count-sketches. In International Conference on Machine Learning, 2018. ", + "bbox": [ + 176, + 315, + 823, + 358 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, and Ellen Vitercik. Learning to branch. In International Conference on Machine Learning, 2018. ", + "bbox": [ + 173, + 364, + 825, + 395 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Luca Baldassarre, Yen-Huan Li, Jonathan Scarlett, Baran Gozc ¨ u, Ilija Bogunovic, and Volkan ¨ Cevher. Learning-based compressive subsampling. IEEE Journal of Selected Topics in Signal Processing, 10(4):809–822, 2016. ", + "bbox": [ + 178, + 402, + 821, + 445 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ashish Bora, Ajil Jalal, Eric Price, and Alexandros G Dimakis. Compressed sensing using generative models. In International Conference on Machine Learning, pp. 537–546, 2017. ", + "bbox": [ + 173, + 454, + 823, + 483 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Oscar Boykin, Avi Bryant, Edwin Chen, ellchow, Mike Gagnon, Moses Nakamura, Steven Noble, Sam Ritchie, Ashutosh Singhal, and Argyris Zymnis. Algebird. https://twitter. github.io/algebird/, 2016. ", + "bbox": [ + 173, + 491, + 823, + 534 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "CAIDA. Caida internet traces 2016 chicago. http://www.caida.org/data/monitors/passive-equinixchicago.xml. ", + "bbox": [ + 171, + 541, + 823, + 571 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Emmanuel J Candes, Justin Romberg, and Terence Tao. Robust uncertainty principles: Exact signal \\` reconstruction from highly incomplete frequency information. IEEE Transactions on information theory, 52(2):489–509, 2006. ", + "bbox": [ + 174, + 579, + 823, + 622 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams. In International Colloquium on Automata, Languages, and Programming, pp. 693–703. Springer, 2002. ", + "bbox": [ + 174, + 630, + 823, + 672 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yu-Hsin Chen, Tushar Krishna, Joel S Emer, and Vivienne Sze. Eyeriss: An energy-efficient reconfigurable accelerator for deep convolutional neural networks. IEEE Journal of Solid-State Circuits, 52(1):127–138, 2017. ", + "bbox": [ + 174, + 681, + 823, + 724 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Graham Cormode and Marios Hadjieleftheriou. Finding frequent items in data streams. Proceedings of the VLDB Endowment, 1(2):1530–1541, 2008. ", + "bbox": [ + 173, + 732, + 821, + 762 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Graham Cormode and S Muthukrishnan. Summarizing and mining skewed data streams. In Proceedings of the 2005 SIAM International Conference on Data Mining, pp. 44–55. SIAM, 2005a. ", + "bbox": [ + 176, + 768, + 821, + 799 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Graham Cormode and Shan Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms, 55(1):58–75, 2005b. ", + "bbox": [ + 174, + 806, + 821, + 837 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Hanjun Dai, Elias Khalil, Yuyu Zhang, Bistra Dilkina, and Le Song. Learning combinatorial optimization algorithms over graphs. In Advances in Neural Information Processing Systems, pp. 6351–6361, 2017. ", + "bbox": [ + 173, + 843, + 821, + 887 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Erik D Demaine, Alejandro Lopez-Ortiz, and J Ian Munro. Frequency estimation of internet packet ´ streams with limited space. In European Symposium on Algorithms, pp. 348–360. Springer, 2002. ", + "bbox": [ + 174, + 895, + 821, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "David L Donoho. Compressed sensing. IEEE Transactions on information theory, 52(4):1289– 1306, 2006. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Fabon Dzogang, Thomas Lansdall-Welfare, Saatviga Sudhahar, and Nello Cristianini. Scalable preference learning from data streams. In Proceedings of the 24th International Conference on World Wide Web, pp. 885–890. ACM, 2015. ", + "bbox": [ + 176, + 141, + 821, + 184 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Cristian Estan and George Varghese. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Transactions on Computer Systems (TOCS), 21(3): 270–313, 2003. ", + "bbox": [ + 173, + 194, + 826, + 236 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Anna Gilbert and Piotr Indyk. Sparse recovery using sparse matrices. Proceedings of the IEEE, 98 (6):937–947, 2010. ", + "bbox": [ + 173, + 244, + 823, + 275 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Amit Goyal, Hal Daume III, and Graham Cormode. Sketch algorithms for estimating point queries ´ in nlp. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pp. 1093–1103. Association for Computational Linguistics, 2012. ", + "bbox": [ + 174, + 284, + 825, + 340 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Alex Graves. Generating sequences with recurrent neural networks. arXiv preprint arXiv:1308.0850, 2013. ", + "bbox": [ + 174, + 349, + 823, + 378 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Song Han, Huizi Mao, and William J Dally. Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149, 2015. ", + "bbox": [ + 173, + 387, + 825, + 417 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Song Han, Xingyu Liu, Huizi Mao, Jing Pu, Ardavan Pedram, Mark A Horowitz, and William J Dally. Eie: efficient inference engine on compressed deep neural network. In Computer Architecture (ISCA), 2016 ACM/IEEE 43rd Annual International Symposium on, pp. 243–254. IEEE, 2016. ", + "bbox": [ + 173, + 426, + 825, + 483 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Song Han, Junlong Kang, Huizi Mao, Yiming Hu, Xin Li, Yubin Li, Dongliang Xie, Hong Luo, Song Yao, Yu Wang, et al. Ese: Efficient speech recognition engine with sparse lstm on fpga. In Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 75–84. ACM, 2017. ", + "bbox": [ + 173, + 492, + 825, + 549 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "He He, Hal Daume III, and Jason M Eisner. Learning to search in branch and bound algorithms. In Advances in neural information processing systems, pp. 3293–3301, 2014. ", + "bbox": [ + 173, + 558, + 821, + 588 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Herve Jegou, Matthijs Douze, and Cordelia Schmid. Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence, 33(1):117–128, 2011. ", + "bbox": [ + 173, + 595, + 821, + 626 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Hossein Jowhari, Mert Saglam, and G ˘ abor Tardos. Tight bounds for lp samplers, finding duplicates ´ in streams, and related problems. In Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 49–58. ACM, 2011. ", + "bbox": [ + 174, + 633, + 825, + 678 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Richard M Karp, Scott Shenker, and Christos H Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems (TODS), 28(1): 51–55, 2003. ", + "bbox": [ + 173, + 686, + 826, + 729 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Tim Kraska, Alex Beutel, Ed H Chi, Jeffrey Dean, and Neoklis Polyzotis. The case for learned index structures. In Proceedings of the 2018 International Conference on Management of Data (SIGMOD), pp. 489–504. ACM, 2018. ", + "bbox": [ + 173, + 738, + 825, + 781 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Abhishek Kumar, Minho Sung, Jun Jim Xu, and Jia Wang. Data streaming algorithms for efficient and accurate estimation of flow size distribution. In ACM SIGMETRICS Performance Evaluation Review, volume 32, pp. 177–188. ACM, 2004. ", + "bbox": [ + 173, + 790, + 823, + 834 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Zaoxing Liu, Antonis Manousis, Gregory Vorsanger, Vyas Sekar, and Vladimir Braverman. One sketch to rule them all: Rethinking network flow monitoring with univmon. In Proceedings of the 2016 ACM SIGCOMM Conference, pp. 101–114. ACM, 2016. ", + "bbox": [ + 173, + 843, + 823, + 886 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Thodoris Lykouris and Sergei Vassilvitskii. Competitive caching with machine learned advice. In International Conference on Machine Learning, 2018. ", + "bbox": [ + 173, + 895, + 821, + 924 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Laurens van der Maaten and Geoffrey Hinton. Visualizing data using t-sne. Journal of machine learning research, 9(Nov):2579–2605, 2008. ", + "bbox": [ + 171, + 103, + 825, + 132 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Efficient computation of frequent and top-k elements in data streams. In International Conference on Database Theory, pp. 398–412. Springer, 2005. ", + "bbox": [ + 173, + 140, + 823, + 184 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Gregory T Minton and Eric Price. Improved concentration bounds for count-sketch. In Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 669–686. SIAM, 2014. ", + "bbox": [ + 174, + 193, + 823, + 234 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Jayadev Misra and David Gries. Finding repeated elements. Science of computer programming, 2 (2):143–152, 1982. ", + "bbox": [ + 173, + 243, + 823, + 273 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Michael Mitzenmacher. A model for learned bloom filters and optimizing by sandwiching. In Advances in Neural Information Processing Systems, 2018. ", + "bbox": [ + 173, + 281, + 821, + 311 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ali Mousavi, Ankit B Patel, and Richard G Baraniuk. A deep learning approach to structured signal recovery. In Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton Conference on, pp. 1336–1343. IEEE, 2015. ", + "bbox": [ + 174, + 319, + 825, + 363 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ali Mousavi, Gautam Dasarathy, and Richard G Baraniuk. Deepcodec: Adaptive sensing and recovery via deep convolutional neural networks. arXiv preprint arXiv:1707.03386, 2017. ", + "bbox": [ + 173, + 371, + 823, + 400 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Pratanu Roy, Arijit Khan, and Gustavo Alonso. Augmented sketch: Faster and more accurate stream processing. In Proceedings of the 2016 International Conference on Management of Data, pp. 1449–1463. ACM, 2016. ", + "bbox": [ + 173, + 409, + 825, + 452 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ruslan Salakhutdinov and Geoffrey Hinton. Semantic hashing. International Journal of Approximate Reasoning, 50(7):969–978, 2009. ", + "bbox": [ + 171, + 460, + 823, + 489 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Stuart Schechter, Cormac Herley, and Michael Mitzenmacher. Popularity is everything: A new approach to protecting passwords from statistical-guessing attacks. In Proceedings of the 5th USENIX conference on Hot topics in security, pp. 1–8. USENIX Association, 2010. ", + "bbox": [ + 173, + 497, + 823, + 541 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S Muthukrishnan, and Jennifer Rexford. Heavy-hitter detection entirely in the data plane. In Proceedings of the Symposium on SDN Research, pp. 164–176. ACM, 2017. ", + "bbox": [ + 176, + 549, + 823, + 593 + ], + "page_idx": 11 + }, + { + "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, + 601, + 823, + 631 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Vivienne Sze, Yu-Hsin Chen, Tien-Ju Yang, and Joel S Emer. Efficient processing of deep neural networks: A tutorial and survey. Proceedings of the IEEE, 105(12):2295–2329, 2017. ", + "bbox": [ + 174, + 638, + 823, + 669 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Partha Talukdar and William Cohen. Scaling graph-based semi supervised learning to large number of labels using count-min sketch. In Artificial Intelligence and Statistics, pp. 940–947, 2014. ", + "bbox": [ + 171, + 676, + 823, + 707 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Jun Wang, Wei Liu, Sanjiv Kumar, and Shih-Fu Chang. Learning to hash for indexing big data - a survey. Proceedings of the IEEE, 104(1):34–57, 2016. ", + "bbox": [ + 171, + 714, + 825, + 743 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Yair Weiss, Antonio Torralba, and Rob Fergus. Spectral hashing. In Advances in neural information processing systems, pp. 1753–1760, 2009. ", + "bbox": [ + 174, + 752, + 825, + 781 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Minlan Yu, Lavanya Jose, and Rui Miao. Software defined traffic measurement with opensketch. In NSDI, volume 13, pp. 29–42, 2013. ", + "bbox": [ + 169, + 790, + 825, + 820 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "9. ANALYSIS - FULL PROOFS ", + "text_level": 1, + "bbox": [ + 174, + 102, + 415, + 118 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In this section, we analyze the performance of three different approaches, single (uniformly random) hash function, Count-Min sketch, and Learned Count-Min sketch when the frequency of items is from Zipfian distribution. For simplicity, we assume that the number of distinct elements $n$ is equal to the size of the universe $| U |$ , and $f _ { i } = 1 / i$ . We use $[ n ]$ to denote the set $\\{ 1 \\ldots n \\}$ . We also drop the normalization factor $1 / N$ in the definition of estimation error. ", + "bbox": [ + 173, + 126, + 825, + 196 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The following observation is useful throughout this section (in particular, in the section on nonasymptotic analysis). ", + "bbox": [ + 171, + 202, + 821, + 232 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Observation 9.1. For sufficiently large values of $n$ (i.e., $n > 2 5 0 ,$ ), ", + "bbox": [ + 174, + 236, + 612, + 251 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/d744842f055527e4aaeab38ca46d6243238a31cd73bd5c2e9a852f56b8149c82.jpg", + "text": "$$\n\\ln ( n + 1 ) < \\sum _ { i = 1 } ^ { \\tilde { n } } { \\frac { 1 } { i } } < \\ln n + 0 . 5 8\n$$", + "text_format": "latex", + "bbox": [ + 385, + 250, + 612, + 290 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "9.1. SINGLE HASH FUNCTION", + "text_level": 1, + "bbox": [ + 174, + 299, + 385, + 314 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Lemma 9.2. The expected error of a single uniformly random hash function $h : [ n ] \\to [ B ]$ (with $B$ buckets) for estimating the frequency of items whose distribution is Zipfian is $\\Theta \\big ( \\textstyle { \\frac { \\ln ^ { 2 } n } { B } } \\big )$ . Proof: ", + "bbox": [ + 173, + 320, + 823, + 371 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/858364c73a257fa76a519ce408c0d824f59460fba91163f190f971d1ce438e0d.jpg", + "text": "$$\n\\begin{array} { r l } { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\widetilde { \\mathcal { F } } _ { h } ) ] = \\mathbf { E } [ \\displaystyle \\sum _ { j \\in [ n ] } \\big ( \\widetilde { f } _ { j } - f _ { j } \\big ) \\cdot f _ { j } ] = \\displaystyle \\sum _ { j \\in [ n ] } \\mathbf { E } [ \\displaystyle \\sum _ { \\{ q \\neq j \\mid h [ q ] = h [ j ] \\} } f _ { q } ] \\cdot f _ { j } } & { } \\\\ { \\displaystyle } & { = \\displaystyle \\sum _ { j \\in [ n ] } ( \\Theta ( \\frac { \\ln n } { B } ) - \\frac { f _ { j } } { B } ) \\cdot f _ { j } = \\Theta ( \\frac { \\ln ^ { 2 } n } { B } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 228, + 368, + 767, + 452 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Moreover, since each bucket maintains the frequency of items that are mapped to it under $h$ , the space complexity of this approach is proportional to the number of buckets which is $\\Theta ( B )$ . ", + "bbox": [ + 174, + 459, + 825, + 489 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "9.2. COUNT-MIN SKETCH ", + "text_level": 1, + "bbox": [ + 174, + 496, + 357, + 510 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Here, we provide an upper bound and lower bound for the expected estimation error of CountMin sketch with $k$ hash functions and $B$ buckets per row. In the rest of this section, for each $j ~ \\in ~ [ n ] , \\ell ~ \\le ~ k$ , we use $e _ { j , \\ell }$ and $e _ { j }$ respectively to denote the estimation error of $f _ { j }$ by $h _ { \\ell }$ and Count-Min sketch. Recall that the expected error of Count-Min sketch is defined as follows: ", + "bbox": [ + 173, + 516, + 825, + 571 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/da8948319d699db915ff998a09eff8ddd49ecd507ac1228fa9cc49d7cffc4212.jpg", + "text": "$$\n\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { C M } ) ] { \\stackrel { \\cdot } { = } } \\mathbf { E } [ \\sum _ { j \\in [ n ] } ( \\tilde { f } _ { j } - f _ { j } ) \\cdot f _ { j } ] = \\sum _ { j \\in [ n ] } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } ,\n$$", + "text_format": "latex", + "bbox": [ + 295, + 571, + 699, + 607 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Our high-level approach is to partition the interval $[ 0 , B \\ln n ]$ into $m + 1$ smaller intervals by a sequence of thresholds $\\begin{array} { r } { \\Theta ( \\ln ^ { 1 + \\gamma } ( \\frac { n } { B } ) ) = r _ { 0 } \\le \\dots \\le r _ { m } = \\bar { B } \\ln n } \\end{array}$ where $\\gamma$ is a parameter to be determined later. Formally, we define the sequence of $r _ { i } \\mathrm { s }$ to satisfy the following property: ", + "bbox": [ + 174, + 612, + 825, + 656 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/5a6c339df210f30a8405f40934c99046826cde1a8aa91d5622524a73c9e7a09f.jpg", + "text": "$$\n\\forall \\ell > 0 , \\quad r _ { \\ell } : = \\dot { ( \\ln ( \\frac { n } { B } ) + \\ln r _ { \\ell + 1 } ) } \\ln ^ { \\dot { \\gamma } } r _ { \\ell + 1 } .\n$$", + "text_format": "latex", + "bbox": [ + 348, + 655, + 647, + 681 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Claim 9.3. For each $i \\geq 0 , \\ln r _ { i + 1 } \\geq 2 \\ln r _ { i }$ . ", + "bbox": [ + 173, + 691, + 472, + 708 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Proof: By (9.3) and assuming $\\ln r _ { i + 1 } \\geq \\ln ( { \\frac { n } { B } } )$ , $r _ { i } < 2 \\ln ^ { 1 + \\gamma } r _ { i + 1 }$ . Hence, $\\ln r _ { i + 1 } > \\left( { \\frac { r _ { i } } { 2 } } \\right) ^ { \\frac { 1 } { 1 + \\gamma } } >$ $2 \\ln r _ { i }$ for sufficiently large values of $r _ { i } { } ^ { 7 }$ assuming $\\gamma \\le 3$ . ", + "bbox": [ + 171, + 713, + 823, + 747 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Note that as long as $\\ln r _ { i + 1 } \\geq \\ln ( { \\frac { n } { B } } )$ , $r _ { i } \\leq r _ { i + 1 }$ . Otherwise, $\\begin{array} { r } { r _ { i } = o ( \\ln ^ { 1 + \\gamma } ( \\frac { n } { B } ) ) < r _ { 0 } } \\end{array}$ . ", + "bbox": [ + 169, + 752, + 736, + 771 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Corollary 9.4. For each $i \\geq 1$ and $c \\geq 1$ , $\\begin{array} { r } { \\sum _ { j \\geq i } \\ln ^ { - c } r _ { j } = O ( \\ln ^ { - c } r _ { i } ) } \\end{array}$ ", + "bbox": [ + 174, + 775, + 638, + 794 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Then, to compute (9.2), we rewrite ${ \\bf E } [ e _ { j } ]$ using the thresholds $r _ { 0 } , \\cdots , r _ { m }$ as follows: ", + "bbox": [ + 173, + 102, + 730, + 119 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/7a357b76c8fc95bf504f94a5f90c667f377d34493d4fad1490ac2b33881f4f75.jpg", + "text": "$$\n\\begin{array} { l l } { \\displaystyle \\mathbf { E } [ e _ { j } ] = \\int _ { 0 } ^ { \\infty } \\operatorname* { P r } ( e _ { j } \\geq x ) d x } & { \\displaystyle { ( 9 . } } \\\\ { \\displaystyle { = \\int _ { 0 } ^ { \\frac { r _ { 0 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x } } \\\\ { \\displaystyle { \\leq O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 189, + 119, + 808, + 241 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Next, we compute $\\begin{array} { r } { \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) } \\end{array}$ ) for each $t \\in [ r _ { i } , r _ { i + 1 } )$ . ", + "bbox": [ + 173, + 244, + 601, + 263 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lemma 9.5. For each $\\begin{array} { r } { \\div \\left[ r _ { i } , r _ { i + 1 } \\right) , \\mathrm { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) = O \\Big ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma } r _ { i + 1 } } \\Big ) . } \\end{array}$ ", + "bbox": [ + 174, + 265, + 732, + 292 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proof: First we prove the following useful observation. ", + "bbox": [ + 173, + 294, + 539, + 309 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Claim 9.6. For each item $j$ and hash function $\\begin{array} { r } { h _ { \\ell } , \\mathbf { E } [ e _ { j , \\ell } \\mid e _ { j , \\ell } < \\frac { r } { B } ] \\le \\frac { \\ln \\left( \\frac { n } { B } \\right) + \\ln r } { B } . } \\end{array}$ ", + "bbox": [ + 178, + 314, + 725, + 333 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proof: Note that the condition $\\begin{array} { r } { e _ { j , \\ell } < \\frac { r } { B } } \\end{array}$ implies that for all items $\\begin{array} { r } { q < \\frac { B } { r } ( \\mathrm { a n d } q \\neq j ) , h _ { \\ell } ( j ) \\neq h _ { \\ell } ( q ) } \\end{array}$ . Hence, ", + "bbox": [ + 174, + 337, + 823, + 366 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/9f6d0a06c65e990ce8a1b41bab234fa871e7aba5a8e530e7a630fd5482adf1cb.jpg", + "text": "$$\n\\mathbf { E } [ e _ { j , \\ell } \\mid e _ { j , \\ell } < \\frac { r } { B } ] \\leq \\sum _ { q > \\frac { B } { r } } f _ { q } \\cdot \\frac { 1 } { B } \\leq \\frac { \\ln n - \\ln ( \\frac { B } { r } ) } { B } = \\frac { \\ln ( \\frac { n } { B } ) + \\ln r } { B } .\n$$", + "text_format": "latex", + "bbox": [ + 274, + 363, + 722, + 410 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Thus, by Markov’s inequality, for each item $j$ and hash function $h _ { \\ell }$ , ", + "bbox": [ + 173, + 419, + 617, + 434 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/85cb607bda191b1eec1d65428ee948c16b4f654b3b342550b2f9a0e4624d3c5b.jpg", + "text": "$$\n\\operatorname* { P r } ( e _ { j , \\ell } > \\frac { t } { B } \\mid e _ { j , \\ell } \\leq \\frac { r } { B } ) \\leq \\frac { \\ln ( \\frac { n } { B } ) + \\ln r } { t } .\n$$", + "text_format": "latex", + "bbox": [ + 356, + 433, + 640, + 463 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Now, for each $h _ { \\ell }$ in Count-Min sketch, we bound the value of $\\begin{array} { r } { \\operatorname* { P r } ( e _ { j , \\ell } \\geq \\frac { t } { B } ) } \\end{array}$ where $t \\in [ r _ { i } , r _ { i + 1 } )$ ", + "bbox": [ + 176, + 463, + 799, + 478 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Hen ", + "bbox": [ + 173, + 564, + 292, + 578 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/03b12616993a48d49d5a7ff6e1b991a418869c662bf36ccfb466296608dbe4e8.jpg", + "text": "$$\n\\begin{array} { r l } & { \\displaystyle \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { t } { B } ) \\leq \\sum _ { q = i } ^ { m - 1 } \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { r _ { q } } { B } | e _ { j , \\varepsilon } < \\frac { r _ { q + 1 } } { B } ) } \\\\ & { \\qquad \\leq \\displaystyle \\sum _ { q = i } ^ { m - 1 } \\frac { \\ln ( \\frac { n } { B } ) + \\ln r _ { q + 1 } } { r _ { q } } = O ( \\frac { 1 } { \\ln ^ { \\gamma } r _ { i + 1 } } ) \\triangleright \\mathfrak { b y } \\ : ( 9 . 5 ) \\ : \\mathrm { a n d } \\ : \\mathrm { C o r o l l a r y } \\ : 9 . 4 } \\\\ & { \\displaystyle \\operatorname* { s e } , \\ : \\mathrm { f o r } \\ : k \\geq 2 , \\ : } \\\\ & { \\qquad \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) \\leq k \\operatorname* { P r } ( e _ { j , 1 } \\geq \\frac { t } { B } | e _ { j , 1 } < \\frac { r _ { i + 1 } } { B } ) \\Pi _ { \\varepsilon = 2 } ^ { k } \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { t } { B } ) } \\\\ & { \\qquad = O \\Big ( \\frac { k ( \\ln \\frac { ( n ) } { B } + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 1 } } \\Big ) \\triangleright \\mathrm { b y } \\ : ( 9 . 5 ) \\ : \\mathrm { a n d } \\ : ( 9 . 6 ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 205, + 477, + 763, + 643 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Next, for each item $j$ , we bound the contribution of each interval $\\textstyle { \\left( \\frac { r _ { i } } { B } , \\frac { r _ { i + 1 } } { B } \\right) }$ to ${ \\bf E } [ e _ { j } ]$ , namely $\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x . } \\end{array}$ . ", + "bbox": [ + 173, + 651, + 821, + 693 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Claim 9.7. For each $i \\geq 0$ , $\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) . } \\end{array}$ ", + "bbox": [ + 173, + 699, + 653, + 726 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Proof: ", + "bbox": [ + 173, + 729, + 217, + 742 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/2d2b3a9bbc470723d0b3f450ac7a9ba4be4a71c029461e9f5a1f7ec0747379e2.jpg", + "text": "$$\n\\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\bigg ( \\underbrace { \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) } _ { A } + \\underbrace { \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) } _ { B _ { q } } \\bigg ) d x\n$$", + "text_format": "latex", + "bbox": [ + 184, + 739, + 810, + 795 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "First, we compute $\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } A d x } \\end{array}$ ", + "bbox": [ + 173, + 795, + 374, + 820 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/eaa540b95c08cd2d59c1d4b984f41dec66db15a18f7a903fa0a2ffdfadb231fa.jpg", + "text": "$$\n\\begin{array} { r l } & { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) d x \\leq \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { ( B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 1 } ) x } ) d x } \\\\ & { \\qquad = O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 264, + 820, + 732, + 900 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Similarly, R Bri $\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\sum _ { q = i + 1 } ^ { m - 1 } B _ { q } d x } \\end{array}$ is at most: ", + "bbox": [ + 173, + 101, + 454, + 126 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/e01634972c3100ddde0c1d1a32678f488427047e4d27d0c59681ecd02eed023d.jpg", + "text": "$$\n\\begin{array} { r l } { \\displaystyle \\int _ { \\frac { r _ { * } } { \\mathtt { B } } } ^ { r _ { * + 1 } } } & { \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) d x = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * + 1 } } { B } } \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { q + 1 } ) } { r _ { q } \\ln ^ { \\gamma ( k - 1 ) } r _ { q + 1 } } ) d x } \\\\ & { \\quad \\quad = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * + 1 } } { B } } \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } O ( \\frac { k } { \\ln ^ { \\gamma k } r _ { q + 1 } } ) d x \\quad \\mathrm { ~ \\mathrm { [ s ~ b y ~ ( } 9 . 3 \\mathrm { ) } ~ } } \\\\ & { \\quad = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * } } { B } } O ( \\frac { k } { \\ln ^ { \\gamma k } r _ { i + 2 } } ) d x \\quad \\mathrm { ~ [ s ~ b y ~ C o r o l l a r y ~ } 9 . 4 } \\\\ & { \\quad = O ( \\frac { k r _ { i + 1 } } { B \\ln ^ { \\gamma k } r _ { i + 2 } } ) = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 2 } ) } { B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 2 } } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 187, + 126, + 790, + 296 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Hence, ", + "bbox": [ + 173, + 292, + 223, + 305 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/c66a5e011cfefb382755659562abd4ceda1a3d4ed7342884b4958a3708dbe9ab.jpg", + "text": "$$\n\\begin{array} { r l r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = \\displaystyle \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } & \\\\ { \\displaystyle \\qquad \\quad = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) + O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 2 } ) } { B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 2 } } ) } & { \\mathrm { > b y ~ ( 9 . 7 ) - ( 9 . 8 ) } } \\\\ { \\displaystyle \\qquad } & { \\displaystyle \\quad = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \\mathrm { > b y ~ ( 9 . 3 ) } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 183, + 303, + 810, + 425 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Now, we complete the error analysis of (9.4): ", + "bbox": [ + 174, + 435, + 472, + 450 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/3ef19672c73ce5af874fb018e644ee165bf9c6198706fbeeae80d9def6eb4708.jpg", + "text": "$$\n\\begin{array} { l l } { \\displaystyle \\mathbf { E } [ e _ { j } ] \\leq O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } \\\\ { \\displaystyle \\qquad = O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \\mathrm { ~ \\Rightarrow ~ b y ~ ( 9 . 9 ) ~ } } \\\\ { \\displaystyle \\qquad = O ( \\frac { r _ { 0 } } { B } ) + O ( k \\frac { \\ln \\left( \\frac { n } { B } \\right) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { 1 } } ) + O ( \\frac { k } { B \\ln ^ { \\gamma ( k - 1 ) - 2 } r _ { 1 } } ) } & { \\mathrm { ~ ( 9 . I ~ } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 192, + 465, + 805, + 592 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Note that (9.10) requires $\\gamma ( k - 1 ) - 2 \\geq 1$ which is satisfied by setting $\\gamma = 3 / ( k - 1 )$ and $k \\geq 2$ . Thus, for each item $j$ , ", + "bbox": [ + 176, + 589, + 823, + 617 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/da676f3303b538007b0180276c707aace396277fa80082e8689f0c1f75cc924d.jpg", + "text": "$$\n\\mathbf { E } [ e _ { j } ] = O ( r _ { 0 } / B ) = O ( \\frac { \\ln ^ { \\frac { k + 2 } { k - 1 } } ( \\frac { n } { B } ) } { B } )\n$$", + "text_format": "latex", + "bbox": [ + 379, + 614, + 619, + 651 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Lemma 9.8. The expected error of Count-Min sketch of size $k \\times B$ (with $k \\geq 2 ,$ ) for estimating items whose frequency distribution is Zipfian is $O ( \\frac { \\ln n \\ln ^ { \\frac { k + 2 } { k - 1 } } ( n / B ) } { B } )$ . In particular, if $B = \\Theta ( n )$ then $\\begin{array} { r } { { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { \\mathcal { F } } } _ { C M } ) ] = O ( \\frac { \\ln n } { n } ) } \\end{array}$ . ", + "bbox": [ + 173, + 661, + 825, + 719 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Proof: By plugging in our upper bound on the estimation error of each item computed in (9.11) in the definition of expected estimation error of Count-Min (9.2), we have the following. ", + "bbox": [ + 171, + 722, + 825, + 750 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/1768b86ecfae2a60babb0a4b95ab784ed55549853562717d3b9469c4b74fb289.jpg", + "text": "$$\n\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { C M } ) ] = \\sum _ { j = 1 } ^ { n } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } = O ( \\frac { \\ln ^ { \\frac { k + 2 } { k - 1 } } \\left( \\frac { n } { B } \\right) } { B } \\cdot \\ln n ) .\n$$", + "text_format": "latex", + "bbox": [ + 303, + 750, + 691, + 792 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Next, we show a lower bound on the expected error of Count-Min sketch with $B$ buckets (more precisely, of size $( \\boldsymbol { k } \\times \\boldsymbol { B } / k ) .$ ) for estimating the frequency of items that follow Zipf Law. ", + "bbox": [ + 169, + 801, + 825, + 832 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Observation 9.9. For each item $j$ $\\begin{array} { r } { , \\operatorname* { P r } [ e _ { j } \\geq 1 / ( 2 ( \\frac { B } { k } ) \\ln k + 1 ) ] \\geq 1 - \\frac { 1 } { k } . } \\end{array}$ . ", + "bbox": [ + 174, + 835, + 656, + 853 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Proof: For each item $j$ , the probability that none of the first $2 \\big ( \\frac { B } { k } \\big ) \\ln k + 1$ items (excluding itself) collide with it in at least one of the hash functions $h _ { 1 } , \\cdots , h _ { k }$ is at most $\\begin{array} { r } { k ( 1 - \\frac { 1 } { ( B / k ) } ) ^ { 2 ( \\frac { B } { k } ) \\ln k } \\le \\frac { 1 } { k } } \\end{array}$ ", + "bbox": [ + 173, + 857, + 825, + 895 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Hence, with probability at least $\\textstyle 1 - { \\frac { 1 } { k } }$ , the estimation $\\tilde { f } _ { j }$ includes the frequency of one of the top $2 ( \\textstyle { \\frac { B } { k } } ) \\ln k + 1$ frequent items. \u0003 ", + "bbox": [ + 171, + 102, + 825, + 136 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Lemma 9.10. The expected error of Count-Min sketch of size $\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}$ for estimating items whose frequency distribution is Zipfian is at least $\\frac { ( k - 1 ) \\ln { n } } { 2 B \\ln { k } + k }$ . ", + "bbox": [ + 171, + 140, + 825, + 178 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Proof: Observation 9.9 implies that $\\begin{array} { r } { \\mathbf { E } [ e _ { j } ] \\geq ( 1 - \\frac { 1 } { k } ) \\frac { 1 } { 2 ( \\frac { B } { k } ) \\ln k + 1 } = \\frac { k - 1 } { 2 B \\ln k + k } } \\end{array}$ . Hence, ", + "bbox": [ + 173, + 180, + 735, + 202 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/7ed698904f123de337fc310b6d11a21a65fa2b61646d935857a55110b1969b46.jpg", + "text": "$$\n\\begin{array} { r l } { { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\mathcal { \\tilde { F } } _ { C M } ) ] = \\sum _ { j \\in [ n ] } ^ { } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } } \\\\ & { \\geq ( \\frac { k - 1 } { 2 B \\ln k + k } ) \\ln n \\quad \\triangleright \\mathrm { B y ~ O b s e r v a t i o n } 9 . 1 } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 284, + 195, + 714, + 271 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Theorem 9.11. The expected error of Count-Min sketch of size $\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}$ on estimating the frequency of n items from Zipfian distribution is at least $\\Omega \\big ( \\frac { k \\ln n } { B \\ln k } \\big )$ and at most $O ( \\frac { k \\ln n \\ln ^ { \\frac { k + 2 } { k - 1 } } ( \\frac { k n } { B } ) } { B } )$ . ", + "bbox": [ + 173, + 277, + 826, + 321 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "In particular, for the case $B = \\Theta ( n )$ and $k = O ( 1 )$ , the expected error of Count-Min sketch is $\\Theta \\big ( \\textstyle { \\frac { \\ln n } { B } } \\big )$ . ", + "bbox": [ + 176, + 324, + 825, + 357 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Proof: The proof follows from Lemma 9.8 and 9.10. We remark that the bound in Lemma 9.8 is for the expected estimation error of Count-Min sketch of size $k \\times B$ . Hence, to get the bound on the expected error of Count-Min of size $\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}$ , we must replace $B$ with $B / k$ . \u0003 ", + "bbox": [ + 174, + 359, + 826, + 404 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "9.3. LEARNED COUNT-MIN SKETCH ", + "text_level": 1, + "bbox": [ + 174, + 415, + 429, + 430 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Definition 9.12 $\\dot { \\phi }$ -HeavyHitter). Given a set of items $\\mathcal { T } = \\{ i _ { 1 } , \\cdots , i _ { n } \\}$ with frequencies ${ \\vec { f } } =$ $\\langle f _ { 1 } , \\cdots , f _ { n } \\rangle$ , an item $j$ is a $\\phi$ -HeavyHitter of $\\mathcal { T }$ if $f _ { j } \\geq \\phi | | { \\vec { f } } | | _ { 1 }$ . ", + "bbox": [ + 171, + 439, + 825, + 474 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Remark 9.13. If the frequency distribution of items $\\mathcal { T }$ is Zipfian, then the number of $\\phi$ -HeavyHitters is at most $1 / ( \\phi \\ln n )$ . In other words, $B _ { r } \\leq ( \\phi \\ln n ) ^ { - 1 }$ . ", + "bbox": [ + 169, + 476, + 823, + 506 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "To recall, in our Learned Count-Min sketch with parameters $( B _ { r } , B )$ , $B _ { r }$ buckets are reserved for the frequent items returned by HH and the rest of items are fed to a Count-Min sketch of size $\\begin{array} { r } { k \\times \\left( \\frac { B ^ { \\star } - B _ { r } } { k } \\right) } \\end{array}$ where $k$ is a parameter to be determined. We emphasize that the space complexity of Learned Count-Min sketch with parameter $( B _ { r } , B )$ is $B _ { r } + B = O ( B )$ . ", + "bbox": [ + 173, + 516, + 825, + 575 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Theorem 9.14. The optimal expected error of Learned Count-Min sketches with parameters $( B _ { r } , B )$ is at most $\\frac { ( \\ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } }$ . In particular, for $B _ { r } = \\Theta ( B ) = \\Theta ( n )$ , $\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { L - C M } ) ] =$ $O ( { \\textstyle { \\frac { 1 } { n } } } )$ . ", + "bbox": [ + 173, + 578, + 825, + 631 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Proof: Since, the count of top $B _ { r }$ frequent items are stored in their own buckets, for each $j \\le B _ { r }$ , $e _ { j } = 0$ . Hence, ", + "bbox": [ + 173, + 632, + 823, + 660 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/59fa12f35b1162a49011e634459127ebd231af332c0999eccef0a25cfb8ad4b5.jpg", + "text": "$$\n\\begin{array} { l } { { \\displaystyle { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { F } } _ { L - C M } ) ] = \\sum _ { j \\in [ n ] } { \\bf E } [ e _ { j } ] \\cdot f _ { j } } \\ ~ } \\\\ { { \\displaystyle ~ = \\sum _ { j > B _ { r } } { \\bf E } [ e _ { j } ] \\cdot f _ { j } \\quad \\triangleright \\forall j \\le B _ { r } , e _ { j } = 0 } \\ ~ } \\\\ { { \\displaystyle ~ < \\frac { ( \\ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } } \\quad } { \\displaystyle \\triangleright \\mathrm { B y ~ O b s e r v a t i o n ~ } } 9 . 1 } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 267, + 657, + 732, + 767 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Note that the last inequality follows from the guarantee of single hash functions; in other words, setting $k = 1$ in the Count-Min sketch. \u0003 ", + "bbox": [ + 173, + 765, + 825, + 792 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "9.3.1. LEARNED COUNT-MIN SKETCH USING NOISY HEAVYHITTERS ORACLE ", + "text_level": 1, + "bbox": [ + 173, + 803, + 725, + 819 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Unlike the previous part, here we assume that we are given a noisy HeavyHitters oracle $\\mathsf { H H } _ { \\delta }$ such that for each item $j$ $\\begin{array} { r } { , \\dot { \\operatorname* { P r } } \\left( \\mathsf { H } \\mathsf { H } _ { \\delta } ( j , \\frac { 1 } { B _ { r } \\ln n } ) \\neq \\mathsf { H } \\mathsf { H } _ { 0 } ( j , \\frac { 1 } { B _ { r } \\ln n } ) \\right) \\leq \\delta } \\end{array}$ where $\\mathsf { H H } _ { 0 }$ is an ideal HeavyHitter oracle that detects heavy items with no error. ", + "bbox": [ + 173, + 825, + 826, + 869 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Lemma 9.15. In an optimal Learned Count-Min sketch with parameters $( B _ { r } , B )$ and a noisy HeavyHitters oracle $\\mathsf { H H } _ { \\delta }$ , $\\begin{array} { r } { { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , \\tilde { \\mathcal { F } } _ { ( L - C M , \\delta ) } ) ] = O ( \\frac { \\delta ^ { 2 } \\ln ^ { 2 } B _ { r } + \\ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) } \\end{array}$ . ", + "bbox": [ + 173, + 873, + 825, + 910 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Proof: The key observation is that each heavy item, any of $B _ { r }$ most frequent items, may only misclassify with probability $\\delta$ . Hence, for each item $j$ classified as “not heavy”, ", + "bbox": [ + 171, + 103, + 823, + 131 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "where the first term denotes the expected contribution of the misclassified heavy items and the second term denotes the expected contribution of non-heavy items. ", + "bbox": [ + 176, + 161, + 825, + 189 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "The rest of analysis is similar to the proof of Theorem 9.14. ", + "bbox": [ + 173, + 194, + 565, + 209 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/af1433c2d921658eb2267b56432b5a0aeca8e46f992d5515482a62acdcd245f5.jpg", + "text": "$$\n\\begin{array} { r l } { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { ( L - C M , \\delta ) } ^ { * } ) ] = \\displaystyle \\sum _ { j \\in [ n ] } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } & { } \\\\ & { < \\delta \\displaystyle \\sum _ { j \\leq B _ { r } } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } + \\displaystyle \\sum _ { j > B _ { r } } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } \\\\ & { \\leq O ( \\delta \\cdot \\ln B _ { r } + \\ln ( n / B _ { r } ) ) \\cdot O ( \\frac { \\delta \\ln B _ { r } + \\ln ( n / B _ { r } ) } { B - B _ { r } } ) \\quad \\mapsto \\mathbf { B } \\mathbf { y } } \\\\ & { \\leq O ( \\frac { \\delta ^ { 2 } \\ln ^ { 2 } B _ { r } + \\ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 191, + 208, + 764, + 352 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Corollary 9.16. Assuming $B _ { r } = \\Theta ( B ) = \\Theta ( n )$ and $\\delta = { \\cal O } ( 1 / \\ln n ) , { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { \\mathcal { F } } } _ { ( L - C M , \\delta ) } ) ] =$ $O ( 1 / n )$ . ", + "bbox": [ + 173, + 358, + 825, + 390 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Space analysis. Here, we compute the amount of space that is required by this approach. ", + "bbox": [ + 171, + 412, + 756, + 429 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "mma 9.17. The amount of space used by Learned Count-Min sketch of size reserved buckets) for estimating the frequency of items whose distributio $\\begin{array} { r } { k \\cdot \\left( \\frac { B - B _ { r } } { k } \\right) } \\end{array}$ w is off. $B _ { r }$ $O ( B )$ ", + "bbox": [ + 173, + 434, + 826, + 463 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Proof: The amount of space required to store the counters corresponding to functions $h _ { 1 } , \\cdots , h _ { k }$ is $\\overset { \\triangledown } { O } ( \\boldsymbol { k } \\cdot \\big ( \\frac { \\boldsymbol { B } - \\boldsymbol { B } _ { r } } { k } \\big ) \\big )$ . Here, we also need to keep a mapping from the heavy items (top $B _ { r }$ frequent items according to $\\mathsf { H H } _ { \\delta }$ ) to the reserved buckets $B _ { r }$ which requires extra $O ( B _ { r } )$ space; each reserved buckets stores both the hashmap of its corresponding item and its count. \u0003 ", + "bbox": [ + 173, + 467, + 826, + 525 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "9.4. NON-ASYMPTOTIC ANALYSIS OF COUNT-MIN AND LEARNED COUNT-MIN ", + "text_level": 1, + "bbox": [ + 174, + 535, + 725, + 551 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "In this section, we compare the non-asymptotic expected error of Count-Min sketch and out Learned Count-Min sketch with ideal HeavyHitters oracle. Throughout this section, we assume that the amount of available space to the frequency estimation algorithms is $( 1 + \\alpha ) B$ words. More precisely, we compare the expected error of Count-Min sketch with $k$ hash functions and our Learned CountMin sketch with $B _ { r } = \\alpha B$ reserved buckets. Recall that we computed the following bounds on the expected error of these approaches (Lemma 9.10 and Theorem 9.14): ", + "bbox": [ + 173, + 558, + 826, + 642 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/84fd9f7ea8191723bc10946f0a1c57aaffa074221cfea6b0f72483b7e76cff71.jpg", + "text": "$$\n\\mathbf { E } [ \\mathrm { E r r } _ { C M } ] \\geq \\frac { ( k - 1 ) \\ln n } { 2 ( 1 + \\alpha ) B \\ln ( k ) + k } , \\quad \\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { n } { \\alpha B } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } .\n$$", + "text_format": "latex", + "bbox": [ + 248, + 659, + 750, + 694 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "In the rest of this section, we assume that $B \\geq \\gamma n$ and then compute the minimum value of $\\gamma$ that guarantees $\\begin{array} { r } { \\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf { E } [ \\mathrm { E r r } _ { C M } ] } \\end{array}$ . In other words, we compute the minimum amount of space that is required so that our Learned Count-Min sketch performs better than Count-Min sketch by a factor of at least $( 1 + \\varepsilon )$ . ", + "bbox": [ + 173, + 698, + 825, + 757 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "$\\mathbf E [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { 1 } { \\alpha \\gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\frac { ( k - 1 ) \\ln n } { 2 ( 1 + \\alpha ) B \\ln k + k } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf E [ \\mathrm { E r r } _ { C M } ] ,$ Hence, we must have $\\begin{array} { r } { ( 0 . 5 8 - \\ln \\alpha - \\ln \\gamma ) ^ { 2 } \\leq \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + ( \\frac { k } { B } ) ) } \\cdot \\ln n } \\end{array}$ . By solving the corresponding quadratic equation, ", + "bbox": [ + 174, + 772, + 825, + 844 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/7880f08ddf43604963829b8d3493478eee9a6e2e48a108f376d9ed7ef0ae7e5d.jpg", + "text": "$$\n\\ln ^ { 2 } \\gamma + 2 ( \\ln \\alpha - 0 . 5 8 ) \\ln \\gamma + ( ( \\ln \\alpha - 0 . 5 8 ) ^ { 2 } - { \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + { ( \\frac { k } { B } ) } ) } } \\cdot \\ln n ) \\le 0 .\n$$", + "text_format": "latex", + "bbox": [ + 196, + 843, + 799, + 876 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "This implies that $\\begin{array} { r } { \\ln \\gamma = - \\ln \\alpha + 0 . 5 8 - \\sqrt { \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + ( \\frac { k } { B } ) ) } \\cdot \\ln n } } \\end{array}$ . By setting $\\alpha = { \\textstyle \\frac { 1 } { 2 } } , \\gamma \\leq$ $\\begin{array} { r } { \\frac { 3 . 5 8 } { e \\sqrt { \\frac { ( k - 1 ) \\ln { n } } { 2 ( 1 + \\varepsilon ) ( 3 \\ln { k } + ( k / B ) ) } } } . } \\end{array}$ ", + "bbox": [ + 173, + 877, + 828, + 928 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Next, we consider different values of $k$ and show that in each case what is the minimum amount of space in which Learned CM outperforms CM by a factor of 1.06 (setting $\\varepsilon = 0 . 0 6 $ ). ", + "bbox": [ + 171, + 103, + 825, + 133 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "• $\\mathbf k = \\mathbf 1$ . In this case, we are basically comparing the expected error of a single hash function and Learned Count-Min. In particular, in order to get a gap of at least $( 1 + \\varepsilon )$ , by a more careful analysis of Lemma 9.2, $\\gamma$ must satisfy the following condition: ", + "bbox": [ + 217, + 151, + 825, + 193 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/7fad2b446cd94ecdad3603ce91af52ebba5f9b015e027c52bb4b9f697dd62fd6.jpg", + "text": "$$\n\\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { 1 } { \\alpha \\gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\frac { \\ln ^ { 2 } n - 1 . 6 5 } { ( 1 + \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf { E } [ \\mathrm { E r r } _ { h } ] ,\n$$", + "text_format": "latex", + "bbox": [ + 266, + 193, + 789, + 228 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "To simplify it further, we require that $( \\ln ( \\textstyle \\frac { 2 } { \\gamma } ) + 0 . 5 8 ) ^ { 2 } \\leq 3 . 1 8 \\cdot ( \\ln ^ { 2 } n - 1 . 6 5 )$ ) which implies that $\\gamma = \\Theta ( 1 / \\ln n )$ . ", + "bbox": [ + 232, + 228, + 823, + 262 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "• $k = 2$ . In this case, $\\begin{array} { r } { \\gamma \\le \\frac { 3 . 5 8 } { e ^ { \\sqrt { ( \\ln n ) / 4 . 5 } } } } \\end{array}$ for sufficiently large values of $B$ . Hence, we require that the total amount of available space is at least $\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 4 . 5 } } }$ ", + "bbox": [ + 215, + 277, + 823, + 320 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "• $k \\in \\{ 3 , 4 \\}$ : In this case, $\\begin{array} { r } { \\gamma \\le \\frac { 2 } { e \\sqrt { ( \\ln n ) / 3 . 5 } } } \\end{array}$ for sufficiently large values of $B$ . Hence, we require that the total amount of available space is at least $\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 3 . 5 } } }$ ", + "bbox": [ + 215, + 337, + 825, + 378 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "• $\\mathbf { \\delta } _ { k } \\geq \\mathbf { 5 }$ . In this case, $\\begin{array} { r } { \\gamma \\le \\frac { 2 } { e ^ { \\sqrt { ( \\ln n ) / 2 . 6 } } } } \\end{array}$ for sufficiently large values of $B$ . Hence, we require that the total amount of available space is at least $\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 2 . 6 } } }$ ", + "bbox": [ + 215, + 397, + 825, + 438 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "We also note that settings where the number of buckets is close to $n$ are quite common in practice. For example, Goyal et al. (2012) uses $( ( 1 + \\alpha ) B = 2 0 M , n = 3 3 . 5 M )$ and $( ( 1 + \\alpha ) B = 5 \\bar { 0 } M , n =$ $9 4 M )$ with $k = 3$ , while Kumar et al. (2004) uses different pairs of $( ( 1 + \\alpha ) B , n )$ including $B =$ $2 8 8 K , n \\ = \\ 5 6 3 K )$ . Plugging these values into the exact formulas computed above shows that Learned CM has a significantly lower loss than CM. ", + "bbox": [ + 173, + 455, + 825, + 526 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "10. OPTIMAL HASH FUNCTION ", + "text_level": 1, + "bbox": [ + 176, + 540, + 436, + 556 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "In this section we compute an asymptotic bound error bound of optimal hash functions that map items $[ n ]$ to a set of buckets $C [ 1 \\cdots B ]$ . ", + "bbox": [ + 171, + 564, + 823, + 593 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Claim 10.1. For a set of items $I$ , let $f ( I )$ denote the total frequency of all items in $I$ ; $f ( I ) : =$ $\\textstyle \\sum _ { i \\in I } f _ { i }$ . In any optimal hash function of form $\\{ h : I [ B _ { I } ] \\}$ with minimum estimation error, any item with frequency at least $\\textstyle { \\frac { f ( I ) } { B _ { I } } }$ does not collide with any other items in $I$ . ", + "bbox": [ + 173, + 595, + 826, + 646 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Proof: For each bucket $b \\in \\ [ B _ { I } ]$ , lets $f _ { h } ( b )$ denotes the frequency of items mapped to $b$ under $h$ ; $\\begin{array} { r } { \\dot { f } ( b ) : = \\sum _ { i \\in I : h ( i ) = b } f _ { i } } \\end{array}$ . Recall that the estimation error of a hash function $h$ is defined as $\\begin{array} { r } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { h } ( I ) ) : = \\sum _ { i \\in I } f _ { i } \\cdot \\left( f ( h ( i ) ) - i \\right) } \\end{array}$ . Note that we can rewrite $\\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { h } ( I ) )$ as ", + "bbox": [ + 174, + 650, + 820, + 699 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/3a8aed53678ef8b5dc116ebb027c71c46433e7c2631dd3322910603f64ab9e7a.jpg", + "text": "$$\n\\begin{array} { r } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\widetilde { \\mathcal { F } _ { h } } ( I ) ) = \\displaystyle \\sum _ { i \\in I } f _ { i } \\cdot ( f ( h ( i ) ) - f _ { i } ) = \\displaystyle \\sum _ { i \\in I } f _ { i } \\cdot f ( h ( i ) ) - \\displaystyle \\sum _ { i \\in I } f _ { i } ^ { 2 } } \\\\ { = \\displaystyle \\sum _ { b \\in [ B _ { I } ] } f ( b ) ^ { 2 } - \\displaystyle \\sum _ { i \\in I } f _ { i } ^ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 258, + 698, + 740, + 767 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Note that in (10.1) the second term is independent of $h$ and is a constant. Hence, an optimal hash function minimizes the first term, $\\sum { _ { b \\in B _ { I } } \\hat { f ( b ) ^ { 2 } } }$ . ", + "bbox": [ + 173, + 767, + 825, + 797 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Suppose that an item $i ^ { * }$ with frequency at least $\\textstyle { \\frac { f ( I ) } { B _ { I } } }$ collides with a (non-empty) set of items $I ^ { * } \\subseteq$ $I \\setminus \\{ i ^ { * } \\}$ under an optimal hash function $h ^ { * }$ . Since the total frequency of the items mapped to the $b ^ { * }$ ntaining . Next, $i ^ { * }$ is greater than define a new h $\\textstyle { \\frac { f ( I ) } { B _ { I } } }$ (i.e., uncti $\\begin{array} { r } { f ( h ( i ^ { * } ) ) > \\frac { f ( I ) } { B _ { I } } ) } \\end{array}$ , there exists a bucket estimation error com $\\bar { b }$ such tred to $\\begin{array} { r } { f ( \\overline { { b } } ) < \\frac { f ( I ) } { B _ { I } } } \\end{array}$ $\\bar { h }$ $h ^ { * }$ which contradicts the optimality of $h ^ { * }$ : ", + "bbox": [ + 173, + 803, + 825, + 890 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/e7c34b4083fafcaa8b2fb514148f0b60949f9fa81806fe41eeca6b80c65c0e21.jpg", + "text": "$$\n\\begin{array} { r } { \\overline { { h } } ( i ) = \\left\\{ \\begin{array} { l l } { h ^ { * } ( i ) } & { \\mathrm { i f ~ } i \\in I \\setminus I ^ { * } } \\\\ { \\overline { { b } } } & { \\mathrm { o t h e r w i s e . } } \\end{array} \\right. } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 392, + 887, + 596, + 922 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Formally, ", + "bbox": [ + 173, + 104, + 238, + 117 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/9f5aa6041decdbfbebdb2709b1c988dce34a7617afa0f89e84ed7ccdf3c3d76d.jpg", + "text": "$$\n\\begin{array} { r l } { \\widehat { \\mathrm { E r r } ( F ( I ) , \\tilde { F } _ { h ^ { \\ast } } ( I ) ) } - \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { \\overline { { h } } } ( I ) ) = f _ { h ^ { \\ast } } ( b ^ { \\ast } ) ^ { 2 } + f _ { h ^ { \\ast } } ( \\overline { { b } } ) ^ { 2 } - f _ { \\overline { { h } } } ( b ^ { \\ast } ) ^ { 2 } - f _ { \\overline { { h } } } ( \\overline { { b } } ) ^ { 2 } } & { } \\\\ { = ( f _ { i ^ { \\ast } } + f ( I ^ { \\ast } ) ) ^ { 2 } + f _ { h ^ { \\ast } } ( \\overline { { b } } ) ^ { 2 } - f _ { i ^ { \\ast } } ^ { 2 } - ( f _ { h ^ { \\ast } } ( \\overline { { b } } ) + f ( I ^ { \\ast } ) ) ^ { 2 } } & { } \\\\ { = 2 f _ { i ^ { \\ast } } \\cdot f ( I ^ { \\ast } ) - 2 f _ { h ^ { \\ast } } ( \\overline { { b } } ) \\cdot f ( I ^ { \\ast } ) } & { } \\\\ { = 2 f ( I ^ { \\ast } ) \\cdot ( f _ { i ^ { \\ast } } - f _ { h ^ { \\ast } } ( \\overline { { b } } ) ) } & { } \\\\ { > 0 \\quad \\triangleright \\mathrm { S i n c e ~ } f _ { i ^ { \\ast } } > \\frac { f ( I ) } { B } > f _ { h ^ { \\ast } } ( \\overline { { b } } ) . } & { } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 114, + 821, + 232 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Next, we show that in any optimal hash function $h ^ { * } : [ n ] \\ \\to \\ [ B ]$ and assuming Zipfian input distribution, $\\Theta ( B )$ most frequent items do not collide with any other items under $h ^ { * }$ . ", + "bbox": [ + 173, + 238, + 823, + 268 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Lemma 10.2. Suppose that $B = n / \\gamma$ where $\\gamma \\geq e ^ { 4 . 2 }$ is a constant and lets assume that items follow Zipfian distribution. In any hash function $h ^ { * } : [ n ] [ B ]$ with minimum estimation error, none of the $\\frac { B } { 2 \\ln \\gamma }$ most frequent items collide with any other items (i.e., they are mapped to a singleton bucket). ", + "bbox": [ + 173, + 271, + 826, + 318 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Proof: Let $i _ { j ^ { * } }$ be the most frequent item that is not mapped to a singleton bucket under $h ^ { * }$ . If $\\begin{array} { r } { j ^ { * } > \\frac { B } { 2 \\ln \\gamma } } \\end{array}$ then the statement holds. Suppose it is not the case and $\\begin{array} { r } { j ^ { * } \\le \\frac { B } { 2 \\ln \\gamma } } \\end{array}$ . Let $I$ denote the set of items with frequency at most $f _ { j ^ { * } } = 1 / j ^ { * }$ (i.e., $I = \\{ i _ { j } \\mid j \\geq j ^ { * } \\} )$ and let $B _ { I }$ denote the number of buckets that the items with index at least $j ^ { * }$ mapped to; $B _ { I } = B - j ^ { * } + 1$ . Also note that by Observation 9.1, $\\begin{array} { r } { f ( I ) < \\ln ( \\frac { n } { j ^ { * } } ) + 1 } \\end{array}$ . Next, by Claim 10.1, we show that $h ^ { * }$ does not hash the items $\\{ j ^ { * } , \\cdots , n \\}$ to $B _ { I }$ optimally. In particular, we show that the frequency of item $j ^ { * }$ is more than $\\textstyle { \\frac { f ( I ) } { B _ { I } } }$ . To prove this, first we observe that the function $g ( j ) : = j \\cdot ( \\ln ( n / j ) + 1 )$ is strictly increasing in $[ 1 , n ]$ . Hence, for any $\\begin{array} { r } { j ^ { * } \\le \\frac { B } { 2 \\ln \\gamma } } \\end{array}$ , ", + "bbox": [ + 173, + 321, + 826, + 450 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/84a31bab9c5c770f1f3bf0ea424d3b88771a603c06329a88fd8a5dd33e70297d.jpg", + "text": "$$\n\\begin{array} { r l r } { { j ^ { * } \\cdot ( \\ln ( \\frac { n } { j ^ { * } } ) + 1 ) \\le \\frac { B } { 2 \\ln \\gamma } \\cdot ( \\ln ( 2 \\gamma \\ln \\gamma ) + 1 ) } } \\\\ & { } & { \\le B \\cdot ( 1 - \\frac { 1 } { 2 \\ln \\gamma } ) \\quad \\triangleright \\mathrm { S i n c e ~ l n } ( 2 \\ln \\gamma ) + 2 < \\ln \\gamma \\mathrm { ~ f o r ~ l n } \\gamma \\ge 4 . 2 } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 220, + 452, + 781, + 517 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Thus, $\\begin{array} { r } { f _ { j ^ { * } } = \\frac { 1 } { j ^ { * } } > \\frac { \\ln ( n / j ^ { * } ) + 1 } { B _ { I } } > \\frac { f ( I ) } { B _ { I } } } \\end{array}$ which implies that an optimal hash function must map $j ^ { * }$ to a singleton bucket. \u0003 ", + "bbox": [ + 176, + 532, + 825, + 565 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Theorem 10.3. If $n / B \\geq e ^ { 4 . 2 }$ , then the estimation error of any hash function that maps a set of $n$ items following Zipfian distribution to $B$ buckets is $\\Omega \\big ( \\frac { \\ln ^ { 2 } ( \\frac { n } { B } ) } { B } \\big )$ ", + "bbox": [ + 176, + 569, + 821, + 606 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Proof: By Lemma 10.2, in any hash function with minimum estimation error, the $\\scriptstyle \\left( { \\frac { B } { 2 \\ln \\gamma } } \\right)$ most frequent items do not collide with any other items (i.e., they are mapped into a singleton bucket) where $\\gamma = n / B > e ^ { 4 . 2 }$ . ", + "bbox": [ + 173, + 611, + 825, + 656 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Hence, the goal is to minimize (10.1) for the set of items $I$ which consist of all items other than the ( B2 ln γ ) most frequent items. Since the sum of squares of $m$ items that summed to $S$ is at least $S ^ { 2 } / m$ , the multi-set loss of any optimal hash function is at least: ", + "bbox": [ + 174, + 661, + 825, + 709 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/50e1a54e5bfd467e8a6e0f00d3fbaff0da447986feb3081fe3c2a15976bf4646.jpg", + "text": "$$\n\\begin{array} { r l } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\bar { \\mathcal { F } } _ { h ^ { * } } ( I ) ) = \\displaystyle { \\sum _ { b \\in [ B ] } f ( b ) ^ { 2 } - \\sum _ { i \\in [ n ] } f _ { i } ^ { 2 } } } \\\\ { \\displaystyle } & { \\geq \\frac { ( \\sum _ { i \\in I } f _ { i } ) ^ { 2 } } { B ( 1 - \\frac { 1 } { 2 \\ln \\gamma } ) } - \\frac { \\sum _ { i \\in I } f _ { i } ^ { 2 } } { i \\in I } } \\\\ { \\displaystyle } & { \\geq \\frac { ( \\ln ( 2 \\gamma \\ln \\gamma ) - 1 ) ^ { 2 } } { B } - \\frac { 2 \\ln \\gamma } { B } + \\frac { 1 } { n } } \\\\ { \\displaystyle } & { = \\Omega ( \\frac { \\ln ^ { 2 } \\gamma } { B } ) } \\\\ { \\displaystyle } & { = \\Omega ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 210, + 722, + 584, + 905 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "B Since γ > e4 ", + "bbox": [ + 637, + 845, + 743, + 862 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Next, we show a more general statement which basically shows that the estimation error of any Count-Min sketch with $B$ buckets is $\\Omega \\big ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } \\big )$ no matter how many rows (i.e., the value of $k$ ) it has. ", + "bbox": [ + 173, + 103, + 825, + 151 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Theorem 10.4. If $n / B \\geq e ^ { 4 . 2 }$ , then the estimation error of any Count-Min sketch that maps a set of n items following Zipfian distribution to $B$ buckets is $\\Omega \\big ( \\frac { \\ln ^ { 2 } ( \\frac { n } { B } ) } { B } \\big )$ ", + "bbox": [ + 173, + 154, + 821, + 190 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Proof: We prove the statement by showing a reduction that given a Count-Min sketch $C M ( k )$ with hash functions $h _ { 1 } , \\cdot \\cdot \\cdot , h _ { k } \\in \\{ h : [ n ] [ B / k ] \\}$ constructs a single hash function $h ^ { * } : [ n ] \\to [ B ]$ whose estimation error is less than or equal to the estimation error of $C M ( k )$ . ", + "bbox": [ + 174, + 193, + 825, + 234 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "For each item $i$ , we define $C ^ { \\prime } [ i ]$ to be the bucket whose value is returned by $C M ( k )$ as the estimate of $f _ { i } ; C ^ { \\prime } [ i ] : = \\arg \\operatorname* { m i n } _ { j \\in [ k ] } C [ j , h _ { j } ( i ) ]$ . Since the total number of buckets in $C M ( k )$ is $B , | \\{ C ^ { \\prime } [ i ] \\mid i \\in$ $[ n ] \\} | \\leq B$ ; in other words, we only consider the subset of buckets that $C M ( k )$ uses to report the estimates of $\\{ f _ { i } \\mid i \\in [ n ] \\}$ which trivially has size at most $B$ . We define $h ^ { * }$ as follows: ", + "bbox": [ + 173, + 241, + 826, + 299 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "$h ^ { \\ast } ( i ) = ( j ^ { \\ast } , h _ { j ^ { \\ast } } ( i ) ) \\quad \\triangleright$ for each $i \\in [ n ]$ , where $j ^ { * } = \\underset { i \\in [ k ] } { \\arg \\operatorname* { m i n } } C [ j , h _ { j } ( i ) ]$ ", + "bbox": [ + 250, + 299, + 743, + 314 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Unlike $C M ( k )$ , $h ^ { * }$ maps each item to exactly one bucket in $\\{ C [ \\ell , j ] \\mid \\ell \\in [ k ] , j \\in [ B / k ] \\}$ ; hence, for each item $i$ , $C ^ { \\prime } [ h ^ { * } ( i ) ] \\ \\leq \\ C [ h ^ { * } ( i ) ] \\ = \\ \\tilde { f } _ { i }$ where $\\tilde { f } _ { i }$ is the estimate of $f _ { i }$ returned by $C M ( k )$ Moreover, since for each $i$ , $C ^ { \\prime } [ h ^ { * } ( i ) ] \\geq f _ { i }$ , ", + "bbox": [ + 176, + 324, + 820, + 369 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Finally, by Theorem 10.3, the estimation error of $h ^ { * }$ is $\\Omega \\big ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } \\big )$ which implies that the estimation error of CM (k) is Ω( ln2(n/B)B ) as well. \u0003 ", + "bbox": [ + 174, + 387, + 825, + 426 + ], + "page_idx": 19 + } +] \ No newline at end of file diff --git a/parse/train/r1lohoCqY7/r1lohoCqY7_middle.json b/parse/train/r1lohoCqY7/r1lohoCqY7_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..18c4970abb7c93628bdccc65879130ed4b23e5c6 --- /dev/null +++ b/parse/train/r1lohoCqY7/r1lohoCqY7_middle.json @@ -0,0 +1,62148 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 78, + 471, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 79, + 473, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 473, + 96 + ], + "score": 1.0, + "content": "LEARNING-BASED FREQUENCY ESTIMATION ALGORITHMS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 112, + 114, + 347, + 126 + ], + "lines": [ + { + "bbox": [ + 112, + 114, + 349, + 128 + ], + "spans": [ + { + "bbox": [ + 112, + 114, + 349, + 128 + ], + "score": 1.0, + "content": "Chen-Yu Hsu, Piotr Indyk, Dina Katabi & Ali Vakilian", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 113, + 127, + 310, + 171 + ], + "lines": [ + { + "bbox": [ + 112, + 125, + 311, + 138 + ], + "spans": [ + { + "bbox": [ + 112, + 125, + 311, + 138 + ], + "score": 1.0, + "content": "Computer Science and Artificial Intelligence Lab", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 111, + 135, + 268, + 151 + ], + "spans": [ + { + "bbox": [ + 111, + 135, + 268, + 151 + ], + "score": 1.0, + "content": "Massachusetts Institute of Technology", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 112, + 148, + 233, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 148, + 233, + 159 + ], + "score": 1.0, + "content": "Cambridge, MA 02139, USA", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 113, + 159, + 310, + 172 + ], + "spans": [ + { + "bbox": [ + 113, + 159, + 310, + 172 + ], + "score": 1.0, + "content": "{cyhsu,indyk,dk,vakilian}@mit.edu", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "title", + "bbox": [ + 278, + 199, + 333, + 211 + ], + "lines": [ + { + "bbox": [ + 276, + 199, + 335, + 212 + ], + "spans": [ + { + "bbox": [ + 276, + 199, + 335, + 212 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 143, + 225, + 468, + 346 + ], + "lines": [ + { + "bbox": [ + 142, + 226, + 469, + 237 + ], + "spans": [ + { + "bbox": [ + 142, + 226, + 469, + 237 + ], + "score": 1.0, + "content": "Estimating the frequencies of elements in a data stream is a fundamental task in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 236, + 469, + 249 + ], + "spans": [ + { + "bbox": [ + 141, + 236, + 469, + 249 + ], + "score": 1.0, + "content": "data analysis and machine learning. The problem is typically addressed using", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 248, + 469, + 261 + ], + "spans": [ + { + "bbox": [ + 141, + 248, + 469, + 261 + ], + "score": 1.0, + "content": "streaming algorithms which can process very large data using limited storage.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 258, + 469, + 271 + ], + "spans": [ + { + "bbox": [ + 141, + 258, + 469, + 271 + ], + "score": 1.0, + "content": "Today’s streaming algorithms, however, cannot exploit patterns in their input to", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 270, + 469, + 281 + ], + "spans": [ + { + "bbox": [ + 141, + 270, + 469, + 281 + ], + "score": 1.0, + "content": "improve performance. We propose a new class of algorithms that automatically", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 280, + 469, + 293 + ], + "spans": [ + { + "bbox": [ + 141, + 280, + 469, + 293 + ], + "score": 1.0, + "content": "learn relevant patterns in the input data and use them to improve its frequency", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 291, + 470, + 304 + ], + "spans": [ + { + "bbox": [ + 141, + 291, + 470, + 304 + ], + "score": 1.0, + "content": "estimates. The proposed algorithms combine the benefits of machine learning", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 303, + 469, + 315 + ], + "spans": [ + { + "bbox": [ + 142, + 303, + 469, + 315 + ], + "score": 1.0, + "content": "with the formal guarantees available through algorithm theory. We prove that our", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 313, + 469, + 326 + ], + "spans": [ + { + "bbox": [ + 141, + 313, + 469, + 326 + ], + "score": 1.0, + "content": "learning-based algorithms have lower estimation errors than their non-learning", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 325, + 469, + 336 + ], + "spans": [ + { + "bbox": [ + 142, + 325, + 469, + 336 + ], + "score": 1.0, + "content": "counterparts. We also evaluate our algorithms on two real-world datasets and", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 335, + 342, + 348 + ], + "spans": [ + { + "bbox": [ + 141, + 335, + 342, + 348 + ], + "score": 1.0, + "content": "demonstrate empirically their performance gains.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 12 + }, + { + "type": "title", + "bbox": [ + 108, + 364, + 201, + 376 + ], + "lines": [ + { + "bbox": [ + 107, + 364, + 203, + 378 + ], + "spans": [ + { + "bbox": [ + 107, + 364, + 203, + 378 + ], + "score": 1.0, + "content": "1. INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 383, + 505, + 493 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 506, + 397 + ], + "score": 1.0, + "content": "Classical algorithms provide formal guarantees over their performance, but often fail to leverage", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 505, + 407 + ], + "score": 1.0, + "content": "useful patterns in their input data to improve their output. On the other hand, deep learning models", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 405, + 505, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 505, + 418 + ], + "score": 1.0, + "content": "are highly successful at capturing and utilizing complex data patterns, but often lack formal error", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 416, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 506, + 430 + ], + "score": 1.0, + "content": "bounds. The last few years have witnessed a growing effort to bridge this gap and introduce al-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 426, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 506, + 441 + ], + "score": 1.0, + "content": "gorithms that can adapt to data properties while delivering worst case guarantees. Deep learning", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 438, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 506, + 451 + ], + "score": 1.0, + "content": "modules have been integrated into the design of Bloom filters (Kraska et al., 2018; Mitzenmacher,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 448, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 506, + 462 + ], + "score": 1.0, + "content": "2018), caching algorithms (Lykouris & Vassilvitskii, 2018), graph optimization (Dai et al., 2017),", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "similarity search (Salakhutdinov & Hinton, 2009; Weiss et al., 2009) and compressive sensing (Bora", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "score": 1.0, + "content": "et al., 2017). This paper makes a significant step toward this vision by introducing frequency esti-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 482, + 493, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 493, + 495 + ], + "score": 1.0, + "content": "mation streaming algorithms that automatically learn to leverage the properties of the input data.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 505, + 598 + ], + "lines": [ + { + "bbox": [ + 106, + 498, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 498, + 505, + 510 + ], + "score": 1.0, + "content": "Estimating the frequencies of elements in a data stream is one of the most fundamental subroutines", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 510, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 505, + 522 + ], + "score": 1.0, + "content": "in data analysis. It has applications in many areas of machine learning, including feature selec-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 520, + 505, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 505, + 534 + ], + "score": 1.0, + "content": "tion (Aghazadeh et al., 2018), ranking (Dzogang et al., 2015), semi-supervised learning (Talukdar &", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 531, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 506, + 545 + ], + "score": 1.0, + "content": "Cohen, 2014) and natural language processing (Goyal et al., 2012). It has been also used for network", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 542, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 104, + 542, + 506, + 555 + ], + "score": 1.0, + "content": "measurements (Estan & Varghese, 2003; Yu et al., 2013; Liu et al., 2016) and security (Schechter", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 552, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 505, + 568 + ], + "score": 1.0, + "content": "et al., 2010). Frequency estimation algorithms have been implemented in popular data processing", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "libraries, such as Algebird at Twitter (Boykin et al., 2016). They can answer practical questions", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 574, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 505, + 589 + ], + "score": 1.0, + "content": "like: what are the most searched words on the Internet? or how much traffic is sent between any two", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 587, + 204, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 204, + 599 + ], + "score": 1.0, + "content": "machines in a network?", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 603, + 505, + 681 + ], + "lines": [ + { + "bbox": [ + 106, + 603, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 106, + 603, + 423, + 616 + ], + "score": 1.0, + "content": "The frequency estimation problem is formalized as follows: given a sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 604, + 432, + 614 + ], + "score": 0.81, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 603, + 505, + 616 + ], + "score": 1.0, + "content": "of elements from", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 614, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 167, + 626 + ], + "score": 1.0, + "content": "some universe", + "type": "text" + }, + { + "bbox": [ + 167, + 615, + 177, + 624 + ], + "score": 0.75, + "content": "U", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 614, + 248, + 626 + ], + "score": 1.0, + "content": ", for any element", + "type": "text" + }, + { + "bbox": [ + 248, + 614, + 276, + 624 + ], + "score": 0.9, + "content": "i \\in U", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 614, + 317, + 626 + ], + "score": 1.0, + "content": ", estimate", + "type": "text" + }, + { + "bbox": [ + 317, + 614, + 326, + 626 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 614, + 416, + 626 + ], + "score": 1.0, + "content": ", the number of times", + "type": "text" + }, + { + "bbox": [ + 416, + 615, + 422, + 624 + ], + "score": 0.66, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 614, + 464, + 626 + ], + "score": 1.0, + "content": "occurs in", + "type": "text" + }, + { + "bbox": [ + 464, + 614, + 471, + 624 + ], + "score": 0.72, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 614, + 505, + 626 + ], + "score": 1.0, + "content": ". If one", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 625, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 260, + 637 + ], + "score": 1.0, + "content": "could store all arrivals from the stream", + "type": "text" + }, + { + "bbox": [ + 260, + 626, + 268, + 636 + ], + "score": 0.78, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 625, + 505, + 637 + ], + "score": 1.0, + "content": ", one could sort the elements and compute their frequencies.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 636, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 649 + ], + "score": 1.0, + "content": "However, in big data applications, the stream is too large (and may be infinite) and cannot be stored.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 647, + 506, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 506, + 660 + ], + "score": 1.0, + "content": "This challenge has motivated the development of streaming algorithms, which read the elements", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 118, + 671 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 659, + 126, + 668 + ], + "score": 0.81, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 657, + 506, + 671 + ], + "score": 1.0, + "content": "in a single pass and compute a good estimate of the frequencies using a limited amount of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 669, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 505, + 683 + ], + "score": 1.0, + "content": "space.1 Over the last two decades, many such streaming algorithms have been developed, including", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 691, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 119, + 689, + 506, + 704 + ], + "spans": [ + { + "bbox": [ + 119, + 689, + 377, + 704 + ], + "score": 1.0, + "content": "1 Specifically, the goal of the problem is as follows. Given a sequence", + "type": "text" + }, + { + "bbox": [ + 378, + 692, + 385, + 700 + ], + "score": 0.81, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 689, + 451, + 704 + ], + "score": 1.0, + "content": "of elements from", + "type": "text" + }, + { + "bbox": [ + 451, + 692, + 459, + 700 + ], + "score": 0.78, + "content": "U", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 689, + 506, + 704 + ], + "score": 1.0, + "content": ", the desired", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 701, + 506, + 713 + ], + "spans": [ + { + "bbox": [ + 106, + 701, + 166, + 713 + ], + "score": 1.0, + "content": "algorithm reads", + "type": "text" + }, + { + "bbox": [ + 167, + 702, + 174, + 711 + ], + "score": 0.79, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 174, + 701, + 338, + 713 + ], + "score": 1.0, + "content": "in a single pass while writing into memory", + "type": "text" + }, + { + "bbox": [ + 338, + 702, + 346, + 711 + ], + "score": 0.81, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 701, + 506, + 713 + ], + "score": 1.0, + "content": "(whose size can be much smaller than the", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 710, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 142, + 723 + ], + "score": 1.0, + "content": "length of", + "type": "text" + }, + { + "bbox": [ + 143, + 712, + 150, + 721 + ], + "score": 0.73, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 150, + 710, + 253, + 723 + ], + "score": 1.0, + "content": "). Then, given any element", + "type": "text" + }, + { + "bbox": [ + 253, + 712, + 279, + 721 + ], + "score": 0.88, + "content": "\\textit { i } \\in \\textit { U }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 710, + 426, + 723 + ], + "score": 1.0, + "content": ", the algorithm reports an estimation of", + "type": "text" + }, + { + "bbox": [ + 426, + 712, + 435, + 722 + ], + "score": 0.86, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 710, + 506, + 723 + ], + "score": 1.0, + "content": "based only on the", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 720, + 156, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 145, + 732 + ], + "score": 1.0, + "content": "content of", + "type": "text" + }, + { + "bbox": [ + 145, + 722, + 153, + 730 + ], + "score": 0.84, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 720, + 156, + 732 + ], + "score": 1.0, + "content": ".", + "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 2019", + "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": [ + 106, + 78, + 471, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 79, + 473, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 473, + 96 + ], + "score": 1.0, + "content": "LEARNING-BASED FREQUENCY ESTIMATION ALGORITHMS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 112, + 114, + 347, + 126 + ], + "lines": [ + { + "bbox": [ + 112, + 114, + 349, + 128 + ], + "spans": [ + { + "bbox": [ + 112, + 114, + 349, + 128 + ], + "score": 1.0, + "content": "Chen-Yu Hsu, Piotr Indyk, Dina Katabi & Ali Vakilian", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 112, + 114, + 349, + 128 + ] + }, + { + "type": "text", + "bbox": [ + 113, + 127, + 310, + 171 + ], + "lines": [ + { + "bbox": [ + 112, + 125, + 311, + 138 + ], + "spans": [ + { + "bbox": [ + 112, + 125, + 311, + 138 + ], + "score": 1.0, + "content": "Computer Science and Artificial Intelligence Lab", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 111, + 135, + 268, + 151 + ], + "spans": [ + { + "bbox": [ + 111, + 135, + 268, + 151 + ], + "score": 1.0, + "content": "Massachusetts Institute of Technology", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 112, + 148, + 233, + 159 + ], + "spans": [ + { + "bbox": [ + 112, + 148, + 233, + 159 + ], + "score": 1.0, + "content": "Cambridge, MA 02139, USA", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 113, + 159, + 310, + 172 + ], + "spans": [ + { + "bbox": [ + 113, + 159, + 310, + 172 + ], + "score": 1.0, + "content": "{cyhsu,indyk,dk,vakilian}@mit.edu", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5, + "bbox_fs": [ + 111, + 125, + 311, + 172 + ] + }, + { + "type": "title", + "bbox": [ + 278, + 199, + 333, + 211 + ], + "lines": [ + { + "bbox": [ + 276, + 199, + 335, + 212 + ], + "spans": [ + { + "bbox": [ + 276, + 199, + 335, + 212 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 143, + 225, + 468, + 346 + ], + "lines": [ + { + "bbox": [ + 142, + 226, + 469, + 237 + ], + "spans": [ + { + "bbox": [ + 142, + 226, + 469, + 237 + ], + "score": 1.0, + "content": "Estimating the frequencies of elements in a data stream is a fundamental task in", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 236, + 469, + 249 + ], + "spans": [ + { + "bbox": [ + 141, + 236, + 469, + 249 + ], + "score": 1.0, + "content": "data analysis and machine learning. The problem is typically addressed using", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 248, + 469, + 261 + ], + "spans": [ + { + "bbox": [ + 141, + 248, + 469, + 261 + ], + "score": 1.0, + "content": "streaming algorithms which can process very large data using limited storage.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 258, + 469, + 271 + ], + "spans": [ + { + "bbox": [ + 141, + 258, + 469, + 271 + ], + "score": 1.0, + "content": "Today’s streaming algorithms, however, cannot exploit patterns in their input to", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 270, + 469, + 281 + ], + "spans": [ + { + "bbox": [ + 141, + 270, + 469, + 281 + ], + "score": 1.0, + "content": "improve performance. We propose a new class of algorithms that automatically", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 280, + 469, + 293 + ], + "spans": [ + { + "bbox": [ + 141, + 280, + 469, + 293 + ], + "score": 1.0, + "content": "learn relevant patterns in the input data and use them to improve its frequency", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 291, + 470, + 304 + ], + "spans": [ + { + "bbox": [ + 141, + 291, + 470, + 304 + ], + "score": 1.0, + "content": "estimates. The proposed algorithms combine the benefits of machine learning", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 303, + 469, + 315 + ], + "spans": [ + { + "bbox": [ + 142, + 303, + 469, + 315 + ], + "score": 1.0, + "content": "with the formal guarantees available through algorithm theory. We prove that our", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 313, + 469, + 326 + ], + "spans": [ + { + "bbox": [ + 141, + 313, + 469, + 326 + ], + "score": 1.0, + "content": "learning-based algorithms have lower estimation errors than their non-learning", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 325, + 469, + 336 + ], + "spans": [ + { + "bbox": [ + 142, + 325, + 469, + 336 + ], + "score": 1.0, + "content": "counterparts. We also evaluate our algorithms on two real-world datasets and", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 335, + 342, + 348 + ], + "spans": [ + { + "bbox": [ + 141, + 335, + 342, + 348 + ], + "score": 1.0, + "content": "demonstrate empirically their performance gains.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 12, + "bbox_fs": [ + 141, + 226, + 470, + 348 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 364, + 201, + 376 + ], + "lines": [ + { + "bbox": [ + 107, + 364, + 203, + 378 + ], + "spans": [ + { + "bbox": [ + 107, + 364, + 203, + 378 + ], + "score": 1.0, + "content": "1. INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 383, + 505, + 493 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 506, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 506, + 397 + ], + "score": 1.0, + "content": "Classical algorithms provide formal guarantees over their performance, but often fail to leverage", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 394, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 505, + 407 + ], + "score": 1.0, + "content": "useful patterns in their input data to improve their output. On the other hand, deep learning models", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 405, + 505, + 418 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 505, + 418 + ], + "score": 1.0, + "content": "are highly successful at capturing and utilizing complex data patterns, but often lack formal error", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 416, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 506, + 430 + ], + "score": 1.0, + "content": "bounds. The last few years have witnessed a growing effort to bridge this gap and introduce al-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 426, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 426, + 506, + 441 + ], + "score": 1.0, + "content": "gorithms that can adapt to data properties while delivering worst case guarantees. Deep learning", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 438, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 506, + 451 + ], + "score": 1.0, + "content": "modules have been integrated into the design of Bloom filters (Kraska et al., 2018; Mitzenmacher,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 448, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 506, + 462 + ], + "score": 1.0, + "content": "2018), caching algorithms (Lykouris & Vassilvitskii, 2018), graph optimization (Dai et al., 2017),", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 505, + 473 + ], + "score": 1.0, + "content": "similarity search (Salakhutdinov & Hinton, 2009; Weiss et al., 2009) and compressive sensing (Bora", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 471, + 505, + 484 + ], + "score": 1.0, + "content": "et al., 2017). This paper makes a significant step toward this vision by introducing frequency esti-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 482, + 493, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 493, + 495 + ], + "score": 1.0, + "content": "mation streaming algorithms that automatically learn to leverage the properties of the input data.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 381, + 506, + 495 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 505, + 598 + ], + "lines": [ + { + "bbox": [ + 106, + 498, + 505, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 498, + 505, + 510 + ], + "score": 1.0, + "content": "Estimating the frequencies of elements in a data stream is one of the most fundamental subroutines", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 510, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 505, + 522 + ], + "score": 1.0, + "content": "in data analysis. It has applications in many areas of machine learning, including feature selec-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 520, + 505, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 505, + 534 + ], + "score": 1.0, + "content": "tion (Aghazadeh et al., 2018), ranking (Dzogang et al., 2015), semi-supervised learning (Talukdar &", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 531, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 506, + 545 + ], + "score": 1.0, + "content": "Cohen, 2014) and natural language processing (Goyal et al., 2012). It has been also used for network", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 542, + 506, + 555 + ], + "spans": [ + { + "bbox": [ + 104, + 542, + 506, + 555 + ], + "score": 1.0, + "content": "measurements (Estan & Varghese, 2003; Yu et al., 2013; Liu et al., 2016) and security (Schechter", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 552, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 505, + 568 + ], + "score": 1.0, + "content": "et al., 2010). Frequency estimation algorithms have been implemented in popular data processing", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "libraries, such as Algebird at Twitter (Boykin et al., 2016). They can answer practical questions", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 574, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 574, + 505, + 589 + ], + "score": 1.0, + "content": "like: what are the most searched words on the Internet? or how much traffic is sent between any two", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 587, + 204, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 204, + 599 + ], + "score": 1.0, + "content": "machines in a network?", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 33, + "bbox_fs": [ + 104, + 498, + 506, + 599 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 603, + 505, + 681 + ], + "lines": [ + { + "bbox": [ + 106, + 603, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 106, + 603, + 423, + 616 + ], + "score": 1.0, + "content": "The frequency estimation problem is formalized as follows: given a sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 604, + 432, + 614 + ], + "score": 0.81, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 603, + 505, + 616 + ], + "score": 1.0, + "content": "of elements from", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 614, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 167, + 626 + ], + "score": 1.0, + "content": "some universe", + "type": "text" + }, + { + "bbox": [ + 167, + 615, + 177, + 624 + ], + "score": 0.75, + "content": "U", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 614, + 248, + 626 + ], + "score": 1.0, + "content": ", for any element", + "type": "text" + }, + { + "bbox": [ + 248, + 614, + 276, + 624 + ], + "score": 0.9, + "content": "i \\in U", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 614, + 317, + 626 + ], + "score": 1.0, + "content": ", estimate", + "type": "text" + }, + { + "bbox": [ + 317, + 614, + 326, + 626 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 614, + 416, + 626 + ], + "score": 1.0, + "content": ", the number of times", + "type": "text" + }, + { + "bbox": [ + 416, + 615, + 422, + 624 + ], + "score": 0.66, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 614, + 464, + 626 + ], + "score": 1.0, + "content": "occurs in", + "type": "text" + }, + { + "bbox": [ + 464, + 614, + 471, + 624 + ], + "score": 0.72, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 614, + 505, + 626 + ], + "score": 1.0, + "content": ". If one", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 625, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 260, + 637 + ], + "score": 1.0, + "content": "could store all arrivals from the stream", + "type": "text" + }, + { + "bbox": [ + 260, + 626, + 268, + 636 + ], + "score": 0.78, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 625, + 505, + 637 + ], + "score": 1.0, + "content": ", one could sort the elements and compute their frequencies.", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 636, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 505, + 649 + ], + "score": 1.0, + "content": "However, in big data applications, the stream is too large (and may be infinite) and cannot be stored.", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 647, + 506, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 506, + 660 + ], + "score": 1.0, + "content": "This challenge has motivated the development of streaming algorithms, which read the elements", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 657, + 506, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 118, + 671 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 659, + 126, + 668 + ], + "score": 0.81, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 657, + 506, + 671 + ], + "score": 1.0, + "content": "in a single pass and compute a good estimate of the frequencies using a limited amount of", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 669, + 505, + 683 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 505, + 683 + ], + "score": 1.0, + "content": "space.1 Over the last two decades, many such streaming algorithms have been developed, including", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 603, + 506, + 683 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Count-Sketch (Charikar et al., 2002), Count-Min (Cormode & Muthukrishnan, 2005b) and multi-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "stage filters (Estan & Varghese, 2003). The performance guarantees of these algorithms are well-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 477, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 336, + 118 + ], + "score": 1.0, + "content": "understood, with upper and lower bounds matching up to", + "type": "text" + }, + { + "bbox": [ + 336, + 105, + 356, + 117 + ], + "score": 0.88, + "content": "O ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 104, + 477, + 118 + ], + "score": 1.0, + "content": "factors (Jowhari et al., 2011).", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 504, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "However, such streaming algorithms typically assume generic data and do not leverage useful pat-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "terns or properties of their input. For example, in text data, the word frequency is known to be", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "inversely correlated with the length of the word. Analogously, in network data, certain applications", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "tend to generate more traffic than others. If such properties can be harnessed, one could design", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "frequency estimation algorithms that are much more efficient than the existing ones. Yet, it is im-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 175, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 104, + 175, + 506, + 190 + ], + "score": 1.0, + "content": "portant to do so in a general framework that can harness various useful properties, instead of using", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "handcrafted methods specific to a particular pattern or structure (e.g., word length, application type).", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 108, + 204, + 505, + 248 + ], + "lines": [ + { + "bbox": [ + 105, + 204, + 504, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 504, + 217 + ], + "score": 1.0, + "content": "In this paper, we introduce learning-based frequency estimation streaming algorithms. Our algo-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 214, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 505, + 228 + ], + "score": 1.0, + "content": "rithms are equipped with a learning model that enables them to exploit data properties without being", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 240 + ], + "score": 1.0, + "content": "specific to a particular pattern or knowing the useful property a priori. We further provide theoretical", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 237, + 405, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 405, + 249 + ], + "score": 1.0, + "content": "analysis of the guarantees associated with such learning-based algorithms.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 254, + 505, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 266 + ], + "score": 1.0, + "content": "We focus on the important class of “hashing-based” algorithms, which includes some of the most", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 265, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 277 + ], + "score": 1.0, + "content": "used algorithms such as Count-Min, Count-Median and Count-Sketch. Informally, these algorithms", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 275, + 506, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 192, + 289 + ], + "score": 1.0, + "content": "hash data items into", + "type": "text" + }, + { + "bbox": [ + 192, + 276, + 201, + 286 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 275, + 506, + 289 + ], + "score": 1.0, + "content": "buckets, count the number of items hashed into each bucket, and use the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 287, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 505, + 300 + ], + "score": 1.0, + "content": "bucket value as an estimate of item frequency. The process can be repeated using multiple hash", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 298, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 311 + ], + "score": 1.0, + "content": "functions to improve accuracy. Hashing-based algorithms have several useful properties. In partic-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 307, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 322 + ], + "score": 1.0, + "content": "ular, they can handle item deletions, which are implemented by decrementing the respective coun-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 318, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 334 + ], + "score": 1.0, + "content": "ters. Furthermore, some of them (notably Count-Min) never underestimate the true frequencies, i.e.,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 107, + 330, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 107, + 330, + 137, + 344 + ], + "score": 0.93, + "content": "\\tilde { f _ { i } } \\geq f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 331, + 506, + 345 + ], + "score": 1.0, + "content": "holds always. However, hashing algorithms lead to estimation errors due to collisions: when", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "two elements are mapped to the same bucket, they affect each others’ estimates. Although collisions", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 353, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 367 + ], + "score": 1.0, + "content": "are unavoidable given the space constraints, the overall error significantly depends on the pattern", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 366, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 505, + 378 + ], + "score": 1.0, + "content": "of collisions. For example, collisions between high-frequency elements (“heavy hitters”) result in", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "a large estimation error, and ideally should be minimized. The existing algorithms, however, use", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 386, + 461, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 461, + 400 + ], + "score": 1.0, + "content": "random hash functions, which means that collisions are controlled only probabilistically.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 403, + 505, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 402, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 246, + 417 + ], + "score": 1.0, + "content": "Our idea is to use a small subset of", + "type": "text" + }, + { + "bbox": [ + 247, + 405, + 255, + 414 + ], + "score": 0.8, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 402, + 282, + 417 + ], + "score": 1.0, + "content": ", call it", + "type": "text" + }, + { + "bbox": [ + 283, + 404, + 293, + 414 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 402, + 505, + 417 + ], + "score": 1.0, + "content": ", to learn the heavy hitters. We can then assign heavy", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "hitters their own buckets to avoid the more costly collisions. It is important to emphasize that we", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "are learning the properties that identify heavy hitters as opposed to the identities of the heavy hitters", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 437, + 505, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 505, + 449 + ], + "score": 1.0, + "content": "themselves. For example, in the word frequency case, shorter words tend to be more popular. The", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 134, + 460 + ], + "score": 1.0, + "content": "subset", + "type": "text" + }, + { + "bbox": [ + 134, + 448, + 145, + 458 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 447, + 452, + 460 + ], + "score": 1.0, + "content": "itself may miss many of the popular words, but whichever words popular in", + "type": "text" + }, + { + "bbox": [ + 453, + 448, + 463, + 457 + ], + "score": 0.88, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 447, + 505, + 460 + ], + "score": 1.0, + "content": "are likely", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 443, + 471 + ], + "score": 1.0, + "content": "to be short. Our objective is not to learn the identity of high frequency words using", + "type": "text" + }, + { + "bbox": [ + 444, + 459, + 454, + 469 + ], + "score": 0.84, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 458, + 505, + 471 + ], + "score": 1.0, + "content": ". Rather, we", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 263, + 482 + ], + "score": 1.0, + "content": "hope that a learning model trained on", + "type": "text" + }, + { + "bbox": [ + 263, + 470, + 273, + 479 + ], + "score": 0.86, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 469, + 505, + 482 + ], + "score": 1.0, + "content": "learns that short words are more frequent, so that it can", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 480, + 333, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 318, + 493 + ], + "score": 1.0, + "content": "identify popular words even if they did not appear in", + "type": "text" + }, + { + "bbox": [ + 319, + 481, + 329, + 491 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 480, + 333, + 493 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 108, + 497, + 261, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 496, + 262, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 496, + 262, + 510 + ], + "score": 1.0, + "content": "Our main contributions are as follows:", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 132, + 514, + 505, + 636 + ], + "lines": [ + { + "bbox": [ + 132, + 515, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 132, + 515, + 505, + 527 + ], + "score": 1.0, + "content": "• We introduce learning-based frequency estimation streaming algorithms, which learn the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 141, + 526, + 482, + 538 + ], + "spans": [ + { + "bbox": [ + 141, + 526, + 482, + 538 + ], + "score": 1.0, + "content": "properties of heavy hitters in their input and exploit this information to reduce errors", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 132, + 542, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 542, + 505, + 555 + ], + "score": 1.0, + "content": "• We provide performance guarantees showing that our algorithms can deliver a logarithmic", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 140, + 552, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 140, + 552, + 506, + 566 + ], + "score": 1.0, + "content": "factor improvement in the error bound over their non-learning counterparts. Furthermore,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 141, + 564, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 141, + 564, + 505, + 576 + ], + "score": 1.0, + "content": "we show that our learning-based instantiation of Count-Min, a widely used algorithm, is", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 141, + 576, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 141, + 576, + 505, + 587 + ], + "score": 1.0, + "content": "asymptotically optimal among all instantiations of that algorithm. See Table 4.1 in sec-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 142, + 587, + 235, + 597 + ], + "spans": [ + { + "bbox": [ + 142, + 587, + 235, + 597 + ], + "score": 1.0, + "content": "tion 4.1 for the details.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 138, + 602, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 138, + 602, + 506, + 615 + ], + "score": 1.0, + "content": "We evaluate our learning-based algorithms using two real-world datasets: traffic load on", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 141, + 613, + 506, + 627 + ], + "spans": [ + { + "bbox": [ + 141, + 613, + 506, + 627 + ], + "score": 1.0, + "content": "an Internet backbone link and search query popularity. In comparison to their non-learning", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 142, + 625, + 474, + 637 + ], + "spans": [ + { + "bbox": [ + 142, + 626, + 420, + 637 + ], + "score": 1.0, + "content": "counterparts, our algorithms yield performance gains that range from", + "type": "text" + }, + { + "bbox": [ + 420, + 625, + 440, + 635 + ], + "score": 0.85, + "content": "18 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 626, + 451, + 637 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 451, + 625, + 470, + 635 + ], + "score": 0.86, + "content": "71 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 626, + 474, + 637 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 40.5 + }, + { + "type": "title", + "bbox": [ + 107, + 647, + 207, + 659 + ], + "lines": [ + { + "bbox": [ + 106, + 646, + 208, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 208, + 662 + ], + "score": 1.0, + "content": "2. RELATED WORK", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 46 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "Frequency estimation in data streams. Frequency estimation, and the closely related problem of", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "finding frequent elements in a data stream, are some of the most fundamental and well-studied prob-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 104, + 686, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 505, + 702 + ], + "score": 1.0, + "content": "lems in streaming algorithms, see Cormode & Hadjieleftheriou (2008) for an overview. Hashing-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "based algorithms such as Count-Sketch (Charikar et al., 2002), Count-Min (Cormode & Muthukr-", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "ishnan, 2005b) and multi-stage filters (Estan & Varghese, 2003) are widely used solutions for these", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 721, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 734 + ], + "score": 1.0, + "content": "problems. These algorithms also have close connections to sparse recovery and compressed sens-", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 49.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 2019", + "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": [ + 108, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Count-Sketch (Charikar et al., 2002), Count-Min (Cormode & Muthukrishnan, 2005b) and multi-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "stage filters (Estan & Varghese, 2003). The performance guarantees of these algorithms are well-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 477, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 336, + 118 + ], + "score": 1.0, + "content": "understood, with upper and lower bounds matching up to", + "type": "text" + }, + { + "bbox": [ + 336, + 105, + 356, + 117 + ], + "score": 0.88, + "content": "O ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 104, + 477, + 118 + ], + "score": 1.0, + "content": "factors (Jowhari et al., 2011).", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 82, + 505, + 118 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 504, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 106, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "However, such streaming algorithms typically assume generic data and do not leverage useful pat-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "terns or properties of their input. For example, in text data, the word frequency is known to be", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 505, + 156 + ], + "score": 1.0, + "content": "inversely correlated with the length of the word. Analogously, in network data, certain applications", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "score": 1.0, + "content": "tend to generate more traffic than others. If such properties can be harnessed, one could design", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 506, + 178 + ], + "score": 1.0, + "content": "frequency estimation algorithms that are much more efficient than the existing ones. Yet, it is im-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 104, + 175, + 506, + 190 + ], + "spans": [ + { + "bbox": [ + 104, + 175, + 506, + 190 + ], + "score": 1.0, + "content": "portant to do so in a general framework that can harness various useful properties, instead of using", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "handcrafted methods specific to a particular pattern or structure (e.g., word length, application type).", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6, + "bbox_fs": [ + 104, + 121, + 506, + 200 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 204, + 505, + 248 + ], + "lines": [ + { + "bbox": [ + 105, + 204, + 504, + 217 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 504, + 217 + ], + "score": 1.0, + "content": "In this paper, we introduce learning-based frequency estimation streaming algorithms. Our algo-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 214, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 505, + 228 + ], + "score": 1.0, + "content": "rithms are equipped with a learning model that enables them to exploit data properties without being", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 240 + ], + "score": 1.0, + "content": "specific to a particular pattern or knowing the useful property a priori. We further provide theoretical", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 237, + 405, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 405, + 249 + ], + "score": 1.0, + "content": "analysis of the guarantees associated with such learning-based algorithms.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 204, + 505, + 249 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 254, + 505, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 505, + 266 + ], + "score": 1.0, + "content": "We focus on the important class of “hashing-based” algorithms, which includes some of the most", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 265, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 277 + ], + "score": 1.0, + "content": "used algorithms such as Count-Min, Count-Median and Count-Sketch. Informally, these algorithms", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 275, + 506, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 192, + 289 + ], + "score": 1.0, + "content": "hash data items into", + "type": "text" + }, + { + "bbox": [ + 192, + 276, + 201, + 286 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 275, + 506, + 289 + ], + "score": 1.0, + "content": "buckets, count the number of items hashed into each bucket, and use the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 287, + 505, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 505, + 300 + ], + "score": 1.0, + "content": "bucket value as an estimate of item frequency. The process can be repeated using multiple hash", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 298, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 505, + 311 + ], + "score": 1.0, + "content": "functions to improve accuracy. Hashing-based algorithms have several useful properties. In partic-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 307, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 322 + ], + "score": 1.0, + "content": "ular, they can handle item deletions, which are implemented by decrementing the respective coun-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 318, + 505, + 334 + ], + "spans": [ + { + "bbox": [ + 105, + 318, + 505, + 334 + ], + "score": 1.0, + "content": "ters. Furthermore, some of them (notably Count-Min) never underestimate the true frequencies, i.e.,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 107, + 330, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 107, + 330, + 137, + 344 + ], + "score": 0.93, + "content": "\\tilde { f _ { i } } \\geq f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 331, + 506, + 345 + ], + "score": 1.0, + "content": "holds always. However, hashing algorithms lead to estimation errors due to collisions: when", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "spans": [ + { + "bbox": [ + 105, + 343, + 505, + 356 + ], + "score": 1.0, + "content": "two elements are mapped to the same bucket, they affect each others’ estimates. Although collisions", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 353, + 505, + 367 + ], + "spans": [ + { + "bbox": [ + 105, + 353, + 505, + 367 + ], + "score": 1.0, + "content": "are unavoidable given the space constraints, the overall error significantly depends on the pattern", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 366, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 505, + 378 + ], + "score": 1.0, + "content": "of collisions. For example, collisions between high-frequency elements (“heavy hitters”) result in", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 506, + 389 + ], + "score": 1.0, + "content": "a large estimation error, and ideally should be minimized. The existing algorithms, however, use", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 386, + 461, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 461, + 400 + ], + "score": 1.0, + "content": "random hash functions, which means that collisions are controlled only probabilistically.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 254, + 506, + 400 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 403, + 505, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 402, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 402, + 246, + 417 + ], + "score": 1.0, + "content": "Our idea is to use a small subset of", + "type": "text" + }, + { + "bbox": [ + 247, + 405, + 255, + 414 + ], + "score": 0.8, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 402, + 282, + 417 + ], + "score": 1.0, + "content": ", call it", + "type": "text" + }, + { + "bbox": [ + 283, + 404, + 293, + 414 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 294, + 402, + 505, + 417 + ], + "score": 1.0, + "content": ", to learn the heavy hitters. We can then assign heavy", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 505, + 427 + ], + "score": 1.0, + "content": "hitters their own buckets to avoid the more costly collisions. It is important to emphasize that we", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "are learning the properties that identify heavy hitters as opposed to the identities of the heavy hitters", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 437, + 505, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 505, + 449 + ], + "score": 1.0, + "content": "themselves. For example, in the word frequency case, shorter words tend to be more popular. The", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 447, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 134, + 460 + ], + "score": 1.0, + "content": "subset", + "type": "text" + }, + { + "bbox": [ + 134, + 448, + 145, + 458 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 447, + 452, + 460 + ], + "score": 1.0, + "content": "itself may miss many of the popular words, but whichever words popular in", + "type": "text" + }, + { + "bbox": [ + 453, + 448, + 463, + 457 + ], + "score": 0.88, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 447, + 505, + 460 + ], + "score": 1.0, + "content": "are likely", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 458, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 458, + 443, + 471 + ], + "score": 1.0, + "content": "to be short. Our objective is not to learn the identity of high frequency words using", + "type": "text" + }, + { + "bbox": [ + 444, + 459, + 454, + 469 + ], + "score": 0.84, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 458, + 505, + 471 + ], + "score": 1.0, + "content": ". Rather, we", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 469, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 469, + 263, + 482 + ], + "score": 1.0, + "content": "hope that a learning model trained on", + "type": "text" + }, + { + "bbox": [ + 263, + 470, + 273, + 479 + ], + "score": 0.86, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 274, + 469, + 505, + 482 + ], + "score": 1.0, + "content": "learns that short words are more frequent, so that it can", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 480, + 333, + 493 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 318, + 493 + ], + "score": 1.0, + "content": "identify popular words even if they did not appear in", + "type": "text" + }, + { + "bbox": [ + 319, + 481, + 329, + 491 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 480, + 333, + 493 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 402, + 505, + 493 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 497, + 261, + 509 + ], + "lines": [ + { + "bbox": [ + 106, + 496, + 262, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 496, + 262, + 510 + ], + "score": 1.0, + "content": "Our main contributions are as follows:", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 106, + 496, + 262, + 510 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 514, + 505, + 636 + ], + "lines": [ + { + "bbox": [ + 132, + 515, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 132, + 515, + 505, + 527 + ], + "score": 1.0, + "content": "• We introduce learning-based frequency estimation streaming algorithms, which learn the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 141, + 526, + 482, + 538 + ], + "spans": [ + { + "bbox": [ + 141, + 526, + 482, + 538 + ], + "score": 1.0, + "content": "properties of heavy hitters in their input and exploit this information to reduce errors", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 132, + 542, + 505, + 555 + ], + "spans": [ + { + "bbox": [ + 132, + 542, + 505, + 555 + ], + "score": 1.0, + "content": "• We provide performance guarantees showing that our algorithms can deliver a logarithmic", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 140, + 552, + 506, + 566 + ], + "spans": [ + { + "bbox": [ + 140, + 552, + 506, + 566 + ], + "score": 1.0, + "content": "factor improvement in the error bound over their non-learning counterparts. Furthermore,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 141, + 564, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 141, + 564, + 505, + 576 + ], + "score": 1.0, + "content": "we show that our learning-based instantiation of Count-Min, a widely used algorithm, is", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 141, + 576, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 141, + 576, + 505, + 587 + ], + "score": 1.0, + "content": "asymptotically optimal among all instantiations of that algorithm. See Table 4.1 in sec-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 142, + 587, + 235, + 597 + ], + "spans": [ + { + "bbox": [ + 142, + 587, + 235, + 597 + ], + "score": 1.0, + "content": "tion 4.1 for the details.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 138, + 602, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 138, + 602, + 506, + 615 + ], + "score": 1.0, + "content": "We evaluate our learning-based algorithms using two real-world datasets: traffic load on", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 141, + 613, + 506, + 627 + ], + "spans": [ + { + "bbox": [ + 141, + 613, + 506, + 627 + ], + "score": 1.0, + "content": "an Internet backbone link and search query popularity. In comparison to their non-learning", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 142, + 625, + 474, + 637 + ], + "spans": [ + { + "bbox": [ + 142, + 626, + 420, + 637 + ], + "score": 1.0, + "content": "counterparts, our algorithms yield performance gains that range from", + "type": "text" + }, + { + "bbox": [ + 420, + 625, + 440, + 635 + ], + "score": 0.85, + "content": "18 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 626, + 451, + 637 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 451, + 625, + 470, + 635 + ], + "score": 0.86, + "content": "71 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 626, + 474, + 637 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 40.5, + "bbox_fs": [ + 132, + 515, + 506, + 637 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 647, + 207, + 659 + ], + "lines": [ + { + "bbox": [ + 106, + 646, + 208, + 662 + ], + "spans": [ + { + "bbox": [ + 106, + 646, + 208, + 662 + ], + "score": 1.0, + "content": "2. RELATED WORK", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 46 + }, + { + "type": "text", + "bbox": [ + 107, + 666, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "Frequency estimation in data streams. Frequency estimation, and the closely related problem of", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "finding frequent elements in a data stream, are some of the most fundamental and well-studied prob-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 104, + 686, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 505, + 702 + ], + "score": 1.0, + "content": "lems in streaming algorithms, see Cormode & Hadjieleftheriou (2008) for an overview. Hashing-", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "based algorithms such as Count-Sketch (Charikar et al., 2002), Count-Min (Cormode & Muthukr-", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "ishnan, 2005b) and multi-stage filters (Estan & Varghese, 2003) are widely used solutions for these", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 721, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 734 + ], + "score": 1.0, + "content": "problems. These algorithms also have close connections to sparse recovery and compressed sens-", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "ing (Candes et al., 2006; Donoho, 2006), where the hashing output can be considered as a com- `", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 367, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 367, + 106 + ], + "score": 1.0, + "content": "pressed representation of the input data (Gilbert & Indyk, 2010).", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 49.5, + "bbox_fs": [ + 104, + 666, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 503, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "ing (Candes et al., 2006; Donoho, 2006), where the hashing output can be considered as a com- `", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 367, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 367, + 106 + ], + "score": 1.0, + "content": "pressed representation of the input data (Gilbert & Indyk, 2010).", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 506, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 123 + ], + "score": 1.0, + "content": "Several “non-hashing” algorithms for frequency estimation have been also proposed (Misra & Gries,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 120, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 506, + 134 + ], + "score": 1.0, + "content": "1982; Demaine et al., 2002; Karp et al., 2003; Metwally et al., 2005). These algorithms do not pos-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "sess many of the properties of hashing-based methods listed in the introduction (such as the ability", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "to handle deletions), but they often have better accuracy/space tradeoffs. For a fair comparison, our", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 506, + 168 + ], + "score": 1.0, + "content": "evaluation focuses only on hashing algorithms. However, our approach for learning heavy hitters", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 317, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 317, + 177 + ], + "score": 1.0, + "content": "should be useful for non-hashing algorithms as well.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 107, + 182, + 505, + 259 + ], + "lines": [ + { + "bbox": [ + 106, + 182, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 506, + 195 + ], + "score": 1.0, + "content": "Some papers have proposed or analyzed frequency estimation algorithms customized to data that", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 193, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 205 + ], + "score": 1.0, + "content": "follows Zipf Law (Charikar et al., 2002; Cormode & Muthukrishnan, 2005a; Metwally et al., 2005;", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 203, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 506, + 218 + ], + "score": 1.0, + "content": "Minton & Price, 2014; Roy et al., 2016); the last algorithm is somewhat similar to the “lookup", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 214, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 506, + 227 + ], + "score": 1.0, + "content": "table” implementation of the heavy hitter oracle that we use as a baseline in our experiments. Those", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 239 + ], + "score": 1.0, + "content": "algorithms need to know the data distribution a priori, and apply only to one distribution. In contrast,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "our learning-based approach applies to any data property or distribution, and does not need to know", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 248, + 253, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 253, + 260 + ], + "score": 1.0, + "content": "that property or distribution a priori.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 267, + 505, + 378 + ], + "lines": [ + { + "bbox": [ + 105, + 266, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 505, + 281 + ], + "score": 1.0, + "content": "Learning-based algorithms. Recently, researchers have begun exploring the idea of integrating", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 276, + 505, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 505, + 292 + ], + "score": 1.0, + "content": "machine learning models into algorithm design. In particular, researchers have proposed improving", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 289, + 504, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 504, + 302 + ], + "score": 1.0, + "content": "compressed sensing algorithms, either by using neural networks to improve sparse recovery algo-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "rithms (Mousavi et al., 2017; Bora et al., 2017), or by designing linear measurements that are opti-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 311, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 323 + ], + "score": 1.0, + "content": "mized for a particular class of vectors (Baldassarre et al., 2016; Mousavi et al., 2015), or both. The", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 321, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 505, + 335 + ], + "score": 1.0, + "content": "latter methods can be viewed as solving a problem similar to ours, as our goal is to design “measure-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 331, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 234, + 346 + ], + "score": 1.0, + "content": "ments” of the frequency vector", + "type": "text" + }, + { + "bbox": [ + 235, + 333, + 302, + 346 + ], + "score": 0.92, + "content": "( f _ { 1 } , f _ { 2 } \\ldots , f _ { | U | } )", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 331, + 506, + 346 + ], + "score": 1.0, + "content": "tailored to a particular class of vectors. However,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 345, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 402, + 358 + ], + "score": 1.0, + "content": "the aforementioned methods need to explicitly represent a matrix of size", + "type": "text" + }, + { + "bbox": [ + 403, + 345, + 438, + 357 + ], + "score": 0.92, + "content": "B \\times | U |", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 345, + 469, + 358 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 470, + 345, + 479, + 355 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 345, + 505, + 358 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "score": 1.0, + "content": "number of buckets. Hence, they are unsuitable for streaming algorithms which, by definition, have", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 366, + 310, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 310, + 379 + ], + "score": 1.0, + "content": "space limitations much smaller than the input size.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 107, + 383, + 505, + 472 + ], + "lines": [ + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "score": 1.0, + "content": "Another class of problems that benefited from machine learning is distance estimation, i.e., com-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "score": 1.0, + "content": "pression of high-dimensional vectors into compact representations from which one can estimate", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 405, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 505, + 417 + ], + "score": 1.0, + "content": "distances between the original vectors. Early solutions to this problem, such as Locality-Sensitive", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 417, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 429 + ], + "score": 1.0, + "content": "Hashing, have been designed for worst case vectors. Over the last decade, numerous methods for", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 427, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 505, + 440 + ], + "score": 1.0, + "content": "learning such representations have been developed (Salakhutdinov & Hinton, 2009; Weiss et al.,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 438, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 506, + 451 + ], + "score": 1.0, + "content": "2009; Jegou et al., 2011; Wang et al., 2016). Although the objective of those papers is similar to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 449, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 449, + 506, + 462 + ], + "score": 1.0, + "content": "ours, their techniques are not usable in our applications, as they involve a different set of tools and", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 461, + 209, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 209, + 473 + ], + "score": 1.0, + "content": "solve different problems.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 106, + 477, + 505, + 608 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "More broadly, there have been several recent papers that leverage machine learning to design more", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 488, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 505, + 501 + ], + "score": 1.0, + "content": "efficient algorithms. The authors of (Dai et al., 2017) show how to use reinforcement learning and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 499, + 506, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 506, + 512 + ], + "score": 1.0, + "content": "graph embedding to design algorithms for graph optimization (e.g., TSP). Other learning-augmented", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 510, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 505, + 522 + ], + "score": 1.0, + "content": "combinatorial optimization problems are studied in (He et al., 2014; Balcan et al., 2018; Lykouris &", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "score": 1.0, + "content": "Vassilvitskii, 2018). More recently, (Kraska et al., 2018; Mitzenmacher, 2018) have used machine", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "score": 1.0, + "content": "learning to improve indexing data structures, including Bloom filters that (probabilistically) answer", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "queries of the form “is a given element in the data set?” As in those papers, our algorithms use neural", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "score": 1.0, + "content": "networks to learn certain properties of the input. However, we differ from those papers both in our", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "design and theoretical analysis. Our algorithms are designed to reduce collisions between heavy", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 576, + 506, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 588 + ], + "score": 1.0, + "content": "items, as such collisions greatly increase errors. In contrast, in existence indices, all collisions count", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "score": 1.0, + "content": "equally. This also leads to our theoretical analysis being very different from that in (Mitzenmacher,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 596, + 137, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 137, + 611 + ], + "score": 1.0, + "content": "2018).", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 38.5 + }, + { + "type": "title", + "bbox": [ + 108, + 621, + 203, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 619, + 204, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 619, + 204, + 635 + ], + "score": 1.0, + "content": "3. PRELIMINARIES", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45 + }, + { + "type": "title", + "bbox": [ + 108, + 637, + 214, + 649 + ], + "lines": [ + { + "bbox": [ + 106, + 637, + 215, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 215, + 649 + ], + "score": 1.0, + "content": "3.1. ESTIMATION ERROR", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 46 + }, + { + "type": "text", + "bbox": [ + 107, + 656, + 505, + 716 + ], + "lines": [ + { + "bbox": [ + 106, + 655, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 656, + 156, + 669 + ], + "score": 1.0, + "content": "We will use", + "type": "text" + }, + { + "bbox": [ + 156, + 655, + 217, + 669 + ], + "score": 0.93, + "content": "e _ { i } : = | \\tilde { f } _ { i } - f _ { i } |", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 656, + 353, + 669 + ], + "score": 1.0, + "content": "to denote the estimation error for", + "type": "text" + }, + { + "bbox": [ + 353, + 658, + 362, + 669 + ], + "score": 0.88, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 656, + 505, + 669 + ], + "score": 1.0, + "content": ". To measure the overall estimation", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 668, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 228, + 684 + ], + "score": 1.0, + "content": "error between the frequencies", + "type": "text" + }, + { + "bbox": [ + 228, + 669, + 325, + 682 + ], + "score": 0.92, + "content": "\\mathcal { F } = \\{ f _ { 1 } , f _ { 2 } , \\cdot \\cdot \\cdot , f _ { | U | } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 668, + 405, + 684 + ], + "score": 1.0, + "content": "and their estimates", + "type": "text" + }, + { + "bbox": [ + 405, + 668, + 501, + 683 + ], + "score": 0.93, + "content": "\\tilde { \\mathcal { F } } = \\{ \\tilde { f } _ { 1 } , \\tilde { f } _ { 2 } , \\cdot \\cdot \\cdot , \\tilde { f } _ { | U | } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 668, + 505, + 684 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 681, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 232, + 694 + ], + "score": 1.0, + "content": "we will use the expected error", + "type": "text" + }, + { + "bbox": [ + 233, + 682, + 271, + 694 + ], + "score": 0.92, + "content": "E _ { i \\sim \\mathcal { D } } [ e _ { i } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 681, + 303, + 694 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 303, + 683, + 312, + 692 + ], + "score": 0.81, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 681, + 506, + 694 + ], + "score": 1.0, + "content": "models the distribution over the queries to the", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 693, + 505, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 693, + 469, + 705 + ], + "score": 1.0, + "content": "data structure. Similar to past work (Roy et al., 2016), we assume the query distribution", + "type": "text" + }, + { + "bbox": [ + 469, + 693, + 479, + 703 + ], + "score": 0.84, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 693, + 505, + 705 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 703, + 504, + 717 + ], + "spans": [ + { + "bbox": [ + 105, + 703, + 330, + 717 + ], + "score": 1.0, + "content": "same as the distribution of the input stream, i.e., for any", + "type": "text" + }, + { + "bbox": [ + 330, + 705, + 336, + 716 + ], + "score": 0.83, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 703, + 372, + 717 + ], + "score": 1.0, + "content": "we have", + "type": "text" + }, + { + "bbox": [ + 372, + 704, + 463, + 716 + ], + "score": 0.93, + "content": "\\mathrm { P r } _ { i \\sim \\mathcal { D } } [ i = j ] = f _ { j } / N", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 703, + 493, + 717 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 494, + 704, + 504, + 714 + ], + "score": 0.8, + "content": "N", + "type": "inline_equation" + } + ], + "index": 51 + } + ], + "index": 49 + } + ], + "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 2019", + "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, + 503, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 82, + 505, + 106 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 105, + 110, + 506, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 123 + ], + "score": 1.0, + "content": "Several “non-hashing” algorithms for frequency estimation have been also proposed (Misra & Gries,", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 120, + 506, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 506, + 134 + ], + "score": 1.0, + "content": "1982; Demaine et al., 2002; Karp et al., 2003; Metwally et al., 2005). These algorithms do not pos-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 145 + ], + "score": 1.0, + "content": "sess many of the properties of hashing-based methods listed in the introduction (such as the ability", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "to handle deletions), but they often have better accuracy/space tradeoffs. For a fair comparison, our", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 506, + 168 + ], + "score": 1.0, + "content": "evaluation focuses only on hashing algorithms. However, our approach for learning heavy hitters", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 165, + 317, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 317, + 177 + ], + "score": 1.0, + "content": "should be useful for non-hashing algorithms as well.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 110, + 506, + 177 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 182, + 505, + 259 + ], + "lines": [ + { + "bbox": [ + 106, + 182, + 506, + 195 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 506, + 195 + ], + "score": 1.0, + "content": "Some papers have proposed or analyzed frequency estimation algorithms customized to data that", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 193, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 505, + 205 + ], + "score": 1.0, + "content": "follows Zipf Law (Charikar et al., 2002; Cormode & Muthukrishnan, 2005a; Metwally et al., 2005;", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 203, + 506, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 506, + 218 + ], + "score": 1.0, + "content": "Minton & Price, 2014; Roy et al., 2016); the last algorithm is somewhat similar to the “lookup", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 214, + 506, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 506, + 227 + ], + "score": 1.0, + "content": "table” implementation of the heavy hitter oracle that we use as a baseline in our experiments. Those", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 505, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 505, + 239 + ], + "score": 1.0, + "content": "algorithms need to know the data distribution a priori, and apply only to one distribution. In contrast,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "our learning-based approach applies to any data property or distribution, and does not need to know", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 248, + 253, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 248, + 253, + 260 + ], + "score": 1.0, + "content": "that property or distribution a priori.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 182, + 506, + 260 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 267, + 505, + 378 + ], + "lines": [ + { + "bbox": [ + 105, + 266, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 505, + 281 + ], + "score": 1.0, + "content": "Learning-based algorithms. Recently, researchers have begun exploring the idea of integrating", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 276, + 505, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 505, + 292 + ], + "score": 1.0, + "content": "machine learning models into algorithm design. In particular, researchers have proposed improving", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 289, + 504, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 504, + 302 + ], + "score": 1.0, + "content": "compressed sensing algorithms, either by using neural networks to improve sparse recovery algo-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "rithms (Mousavi et al., 2017; Bora et al., 2017), or by designing linear measurements that are opti-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 311, + 505, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 505, + 323 + ], + "score": 1.0, + "content": "mized for a particular class of vectors (Baldassarre et al., 2016; Mousavi et al., 2015), or both. The", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 321, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 505, + 335 + ], + "score": 1.0, + "content": "latter methods can be viewed as solving a problem similar to ours, as our goal is to design “measure-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 331, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 234, + 346 + ], + "score": 1.0, + "content": "ments” of the frequency vector", + "type": "text" + }, + { + "bbox": [ + 235, + 333, + 302, + 346 + ], + "score": 0.92, + "content": "( f _ { 1 } , f _ { 2 } \\ldots , f _ { | U | } )", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 331, + 506, + 346 + ], + "score": 1.0, + "content": "tailored to a particular class of vectors. However,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 345, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 402, + 358 + ], + "score": 1.0, + "content": "the aforementioned methods need to explicitly represent a matrix of size", + "type": "text" + }, + { + "bbox": [ + 403, + 345, + 438, + 357 + ], + "score": 0.92, + "content": "B \\times | U |", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 345, + 469, + 358 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 470, + 345, + 479, + 355 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 345, + 505, + 358 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "score": 1.0, + "content": "number of buckets. Hence, they are unsuitable for streaming algorithms which, by definition, have", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 366, + 310, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 310, + 379 + ], + "score": 1.0, + "content": "space limitations much smaller than the input size.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 266, + 506, + 379 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 383, + 505, + 472 + ], + "lines": [ + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "score": 1.0, + "content": "Another class of problems that benefited from machine learning is distance estimation, i.e., com-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 394, + 506, + 408 + ], + "score": 1.0, + "content": "pression of high-dimensional vectors into compact representations from which one can estimate", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 405, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 505, + 417 + ], + "score": 1.0, + "content": "distances between the original vectors. Early solutions to this problem, such as Locality-Sensitive", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 417, + 505, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 429 + ], + "score": 1.0, + "content": "Hashing, have been designed for worst case vectors. Over the last decade, numerous methods for", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 427, + 505, + 440 + ], + "spans": [ + { + "bbox": [ + 105, + 427, + 505, + 440 + ], + "score": 1.0, + "content": "learning such representations have been developed (Salakhutdinov & Hinton, 2009; Weiss et al.,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 438, + 506, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 506, + 451 + ], + "score": 1.0, + "content": "2009; Jegou et al., 2011; Wang et al., 2016). Although the objective of those papers is similar to", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 449, + 506, + 462 + ], + "spans": [ + { + "bbox": [ + 105, + 449, + 506, + 462 + ], + "score": 1.0, + "content": "ours, their techniques are not usable in our applications, as they involve a different set of tools and", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 461, + 209, + 473 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 209, + 473 + ], + "score": 1.0, + "content": "solve different problems.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 383, + 506, + 473 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 477, + 505, + 608 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "More broadly, there have been several recent papers that leverage machine learning to design more", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 488, + 505, + 501 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 505, + 501 + ], + "score": 1.0, + "content": "efficient algorithms. The authors of (Dai et al., 2017) show how to use reinforcement learning and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 499, + 506, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 506, + 512 + ], + "score": 1.0, + "content": "graph embedding to design algorithms for graph optimization (e.g., TSP). Other learning-augmented", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 510, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 505, + 522 + ], + "score": 1.0, + "content": "combinatorial optimization problems are studied in (He et al., 2014; Balcan et al., 2018; Lykouris &", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "spans": [ + { + "bbox": [ + 106, + 521, + 505, + 533 + ], + "score": 1.0, + "content": "Vassilvitskii, 2018). More recently, (Kraska et al., 2018; Mitzenmacher, 2018) have used machine", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 506, + 545 + ], + "score": 1.0, + "content": "learning to improve indexing data structures, including Bloom filters that (probabilistically) answer", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "queries of the form “is a given element in the data set?” As in those papers, our algorithms use neural", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 505, + 567 + ], + "score": 1.0, + "content": "networks to learn certain properties of the input. However, we differ from those papers both in our", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 505, + 578 + ], + "score": 1.0, + "content": "design and theoretical analysis. Our algorithms are designed to reduce collisions between heavy", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 576, + 506, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 588 + ], + "score": 1.0, + "content": "items, as such collisions greatly increase errors. In contrast, in existence indices, all collisions count", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 505, + 599 + ], + "score": 1.0, + "content": "equally. This also leads to our theoretical analysis being very different from that in (Mitzenmacher,", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 596, + 137, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 137, + 611 + ], + "score": 1.0, + "content": "2018).", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 477, + 506, + 611 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 621, + 203, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 619, + 204, + 635 + ], + "spans": [ + { + "bbox": [ + 106, + 619, + 204, + 635 + ], + "score": 1.0, + "content": "3. PRELIMINARIES", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45 + }, + { + "type": "title", + "bbox": [ + 108, + 637, + 214, + 649 + ], + "lines": [ + { + "bbox": [ + 106, + 637, + 215, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 215, + 649 + ], + "score": 1.0, + "content": "3.1. ESTIMATION ERROR", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 46 + }, + { + "type": "text", + "bbox": [ + 107, + 656, + 505, + 716 + ], + "lines": [ + { + "bbox": [ + 106, + 655, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 656, + 156, + 669 + ], + "score": 1.0, + "content": "We will use", + "type": "text" + }, + { + "bbox": [ + 156, + 655, + 217, + 669 + ], + "score": 0.93, + "content": "e _ { i } : = | \\tilde { f } _ { i } - f _ { i } |", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 656, + 353, + 669 + ], + "score": 1.0, + "content": "to denote the estimation error for", + "type": "text" + }, + { + "bbox": [ + 353, + 658, + 362, + 669 + ], + "score": 0.88, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 656, + 505, + 669 + ], + "score": 1.0, + "content": ". To measure the overall estimation", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 668, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 228, + 684 + ], + "score": 1.0, + "content": "error between the frequencies", + "type": "text" + }, + { + "bbox": [ + 228, + 669, + 325, + 682 + ], + "score": 0.92, + "content": "\\mathcal { F } = \\{ f _ { 1 } , f _ { 2 } , \\cdot \\cdot \\cdot , f _ { | U | } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 668, + 405, + 684 + ], + "score": 1.0, + "content": "and their estimates", + "type": "text" + }, + { + "bbox": [ + 405, + 668, + 501, + 683 + ], + "score": 0.93, + "content": "\\tilde { \\mathcal { F } } = \\{ \\tilde { f } _ { 1 } , \\tilde { f } _ { 2 } , \\cdot \\cdot \\cdot , \\tilde { f } _ { | U | } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 668, + 505, + 684 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 681, + 506, + 694 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 232, + 694 + ], + "score": 1.0, + "content": "we will use the expected error", + "type": "text" + }, + { + "bbox": [ + 233, + 682, + 271, + 694 + ], + "score": 0.92, + "content": "E _ { i \\sim \\mathcal { D } } [ e _ { i } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 681, + 303, + 694 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 303, + 683, + 312, + 692 + ], + "score": 0.81, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 681, + 506, + 694 + ], + "score": 1.0, + "content": "models the distribution over the queries to the", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 693, + 505, + 705 + ], + "spans": [ + { + "bbox": [ + 105, + 693, + 469, + 705 + ], + "score": 1.0, + "content": "data structure. Similar to past work (Roy et al., 2016), we assume the query distribution", + "type": "text" + }, + { + "bbox": [ + 469, + 693, + 479, + 703 + ], + "score": 0.84, + "content": "\\mathcal { D }", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 693, + 505, + 705 + ], + "score": 1.0, + "content": "is the", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 703, + 504, + 717 + ], + "spans": [ + { + "bbox": [ + 105, + 703, + 330, + 717 + ], + "score": 1.0, + "content": "same as the distribution of the input stream, i.e., for any", + "type": "text" + }, + { + "bbox": [ + 330, + 705, + 336, + 716 + ], + "score": 0.83, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 703, + 372, + 717 + ], + "score": 1.0, + "content": "we have", + "type": "text" + }, + { + "bbox": [ + 372, + 704, + 463, + 716 + ], + "score": 0.93, + "content": "\\mathrm { P r } _ { i \\sim \\mathcal { D } } [ i = j ] = f _ { j } / N", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 703, + 493, + 717 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 494, + 704, + 504, + 714 + ], + "score": 0.8, + "content": "N", + "type": "inline_equation" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 81, + 450, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 369, + 96 + ], + "score": 1.0, + "content": "is the sum of all frequencies. This leads to the estimation error of", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 369, + 81, + 379, + 92 + ], + "score": 0.86, + "content": "\\tilde { \\mathcal { F } }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 379, + 81, + 441, + 96 + ], + "score": 1.0, + "content": "with respect to", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 441, + 83, + 450, + 92 + ], + "score": 0.79, + "content": "\\mathcal { F }", + "type": "inline_equation", + "cross_page": true + } + ], + "index": 0 + } + ], + "index": 49, + "bbox_fs": [ + 105, + 655, + 506, + 717 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 81, + 453, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 450, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 369, + 96 + ], + "score": 1.0, + "content": "is the sum of all frequencies. This leads to the estimation error of", + "type": "text" + }, + { + "bbox": [ + 369, + 81, + 379, + 92 + ], + "score": 0.86, + "content": "\\tilde { \\mathcal { F } }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 81, + 441, + 96 + ], + "score": 1.0, + "content": "with respect to", + "type": "text" + }, + { + "bbox": [ + 441, + 83, + 450, + 92 + ], + "score": 0.79, + "content": "\\mathcal { F }", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 93, + 379, + 119 + ], + "lines": [ + { + "bbox": [ + 231, + 93, + 379, + 119 + ], + "spans": [ + { + "bbox": [ + 231, + 93, + 379, + 119 + ], + "score": 0.93, + "content": "\\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } ) : = 1 / N \\sum _ { i \\in U } | \\tilde { f } _ { i } - f _ { i } | \\cdot f _ { i }", + "type": "interline_equation", + "image_path": "e755bcbcb71e52c857d3988b4a20f589de471617b199ab63acfce2d68c4ef3a5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 231, + 93, + 379, + 119 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 504, + 169 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 136 + ], + "score": 1.0, + "content": "We note that the theoretical guarantees of frequency estimation algorithms are typically phrased in", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 134, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 135, + 127, + 150 + ], + "score": 1.0, + "content": "the “", + "type": "text" + }, + { + "bbox": [ + 127, + 135, + 148, + 147 + ], + "score": 0.87, + "content": "( \\epsilon , \\delta )", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 135, + 200, + 150 + ], + "score": 1.0, + "content": "-form”, e.g.,", + "type": "text" + }, + { + "bbox": [ + 200, + 134, + 303, + 148 + ], + "score": 0.92, + "content": "\\mathrm { P r } [ | \\bar { \\tilde { f } } _ { i } - f _ { i } | > \\epsilon N ] < \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 135, + 344, + 150 + ], + "score": 1.0, + "content": "for every", + "type": "text" + }, + { + "bbox": [ + 344, + 137, + 349, + 146 + ], + "score": 0.71, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 135, + 506, + 150 + ], + "score": 1.0, + "content": "(see e.g., Cormode & Muthukrishnan", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 146, + 506, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 356, + 160 + ], + "score": 1.0, + "content": "(2005b)). However, this formulation involves two objectives", + "type": "text" + }, + { + "bbox": [ + 356, + 149, + 362, + 156 + ], + "score": 0.34, + "content": "\\stackrel { \\cdot } { \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 146, + 380, + 160 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 380, + 147, + 387, + 157 + ], + "score": 0.7, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 146, + 506, + 160 + ], + "score": 1.0, + "content": "). We believe that the (single", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 158, + 492, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 158, + 492, + 171 + ], + "score": 1.0, + "content": "objective) expected error in Equation 3.1 is more natural from the machine learning perspective.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5 + }, + { + "type": "title", + "bbox": [ + 107, + 174, + 320, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 174, + 320, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 320, + 187 + ], + "score": 1.0, + "content": "3.2. ALGORITHMS FOR FREQUENCY ESTIMATION", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 104, + 191, + 479, + 204 + ], + "lines": [ + { + "bbox": [ + 104, + 189, + 480, + 206 + ], + "spans": [ + { + "bbox": [ + 104, + 189, + 480, + 206 + ], + "score": 1.0, + "content": "In this section, we recap three variants of hashing-based algorithms for frequency estimation.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 210, + 505, + 286 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 222 + ], + "score": 1.0, + "content": "Single Hash Function. The basic hashing algorithm uses a single uniformly random hash function", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 221, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 107, + 221, + 168, + 233 + ], + "score": 0.91, + "content": "h : { \\bar { U } } [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 221, + 235, + 234 + ], + "score": 1.0, + "content": ", where we use", + "type": "text" + }, + { + "bbox": [ + 235, + 222, + 249, + 233 + ], + "score": 0.88, + "content": "[ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 221, + 325, + 234 + ], + "score": 1.0, + "content": "to denote the set", + "type": "text" + }, + { + "bbox": [ + 325, + 221, + 363, + 233 + ], + "score": 0.93, + "content": "\\{ 1 \\ldots B \\bar { \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 221, + 505, + 234 + ], + "score": 1.0, + "content": ". The algorithm maintains a one-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 232, + 504, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 181, + 245 + ], + "score": 1.0, + "content": "dimensional array", + "type": "text" + }, + { + "bbox": [ + 181, + 232, + 223, + 244 + ], + "score": 0.91, + "content": "C [ 1 \\ldots B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 232, + 458, + 245 + ], + "score": 1.0, + "content": ", in which all entries are initialized to 0. Given an element", + "type": "text" + }, + { + "bbox": [ + 459, + 234, + 463, + 243 + ], + "score": 0.77, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 232, + 504, + 245 + ], + "score": 1.0, + "content": ", the algo-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 240, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 104, + 240, + 176, + 259 + ], + "score": 1.0, + "content": "rithm increments", + "type": "text" + }, + { + "bbox": [ + 177, + 244, + 208, + 255 + ], + "score": 0.92, + "content": "C [ h ( i ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 240, + 417, + 259 + ], + "score": 1.0, + "content": ". It can be seen that at the end of the stream, we have", + "type": "text" + }, + { + "bbox": [ + 417, + 243, + 501, + 258 + ], + "score": 0.93, + "content": "\\begin{array} { r } { C [ b ] = \\sum _ { j : h ( j ) = b } \\mathsf { \\bar { f } } _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 240, + 506, + 259 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 256, + 506, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 160, + 274 + ], + "score": 1.0, + "content": "The estimate", + "type": "text" + }, + { + "bbox": [ + 161, + 257, + 170, + 270 + ], + "score": 0.89, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 256, + 183, + 274 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 183, + 258, + 192, + 270 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 256, + 246, + 274 + ], + "score": 1.0, + "content": "is defined as", + "type": "text" + }, + { + "bbox": [ + 247, + 257, + 377, + 273 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\tilde { f } _ { i } = C [ h ( i ) ] = \\sum _ { j : h ( i ) = h ( j ) } f _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 256, + 506, + 274 + ], + "score": 1.0, + "content": ". Note that it is always the case", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 270, + 160, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 124, + 288 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 124, + 271, + 154, + 286 + ], + "score": 0.92, + "content": "\\tilde { f _ { i } } \\geq f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 270, + 160, + 288 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 291, + 506, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 198, + 306 + ], + "score": 1.0, + "content": "Count-Min. We have", + "type": "text" + }, + { + "bbox": [ + 198, + 293, + 205, + 303 + ], + "score": 0.82, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 291, + 300, + 306 + ], + "score": 1.0, + "content": "distinct hash functions", + "type": "text" + }, + { + "bbox": [ + 300, + 293, + 358, + 304 + ], + "score": 0.93, + "content": "h _ { i } : U \\to [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 291, + 413, + 306 + ], + "score": 1.0, + "content": "and an array", + "type": "text" + }, + { + "bbox": [ + 414, + 293, + 423, + 303 + ], + "score": 0.82, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 291, + 453, + 306 + ], + "score": 1.0, + "content": "of size", + "type": "text" + }, + { + "bbox": [ + 454, + 293, + 481, + 303 + ], + "score": 0.91, + "content": "k \\times B", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 291, + 506, + 306 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 301, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 104, + 301, + 189, + 320 + ], + "score": 1.0, + "content": "algorithm maintains", + "type": "text" + }, + { + "bbox": [ + 189, + 304, + 198, + 313 + ], + "score": 0.83, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 301, + 368, + 320 + ], + "score": 1.0, + "content": ", such that at the end of the stream we have", + "type": "text" + }, + { + "bbox": [ + 368, + 303, + 464, + 318 + ], + "score": 0.92, + "content": "\\begin{array} { r } { C [ \\ell , b ] = \\sum _ { j : h \\ell ( j ) = b } f _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 301, + 506, + 320 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 317, + 478, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 131, + 329 + ], + "score": 0.87, + "content": "i \\in U", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 317, + 227, + 333 + ], + "score": 1.0, + "content": ", the frequency estimate", + "type": "text" + }, + { + "bbox": [ + 228, + 317, + 237, + 330 + ], + "score": 0.89, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 317, + 282, + 333 + ], + "score": 1.0, + "content": "is equal to", + "type": "text" + }, + { + "bbox": [ + 282, + 318, + 358, + 331 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\operatorname* { m i n } _ { \\ell \\le k } C [ \\ell , h _ { \\ell } ( i ) ] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 317, + 443, + 333 + ], + "score": 1.0, + "content": ", and always satisfies", + "type": "text" + }, + { + "bbox": [ + 443, + 317, + 474, + 330 + ], + "score": 0.91, + "content": "\\tilde { f _ { i } } \\geq f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 317, + 478, + 333 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 337, + 505, + 400 + ], + "lines": [ + { + "bbox": [ + 106, + 336, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 310, + 350 + ], + "score": 1.0, + "content": "Count-Sketch. Similarly to Count-Min, we have", + "type": "text" + }, + { + "bbox": [ + 310, + 338, + 317, + 348 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 336, + 413, + 350 + ], + "score": 1.0, + "content": "distinct hash functions", + "type": "text" + }, + { + "bbox": [ + 413, + 338, + 474, + 349 + ], + "score": 0.91, + "content": "h _ { i } : U \\to [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 336, + 505, + 350 + ], + "score": 1.0, + "content": "and an", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 347, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 129, + 361 + ], + "score": 1.0, + "content": "array", + "type": "text" + }, + { + "bbox": [ + 130, + 349, + 139, + 359 + ], + "score": 0.82, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 347, + 168, + 361 + ], + "score": 1.0, + "content": "of size", + "type": "text" + }, + { + "bbox": [ + 169, + 349, + 196, + 359 + ], + "score": 0.9, + "content": "k \\times B", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 347, + 360, + 361 + ], + "score": 1.0, + "content": ". Additionally, in Count-Sketch, we have", + "type": "text" + }, + { + "bbox": [ + 361, + 349, + 367, + 358 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 347, + 428, + 361 + ], + "score": 1.0, + "content": "sign functions", + "type": "text" + }, + { + "bbox": [ + 428, + 349, + 501, + 360 + ], + "score": 0.91, + "content": "g _ { i } : U \\stackrel { \\cdot } { } \\bar { \\{ - 1 , 1 \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 347, + 505, + 361 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 358, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 225, + 375 + ], + "score": 1.0, + "content": "and the algorithm maintains", + "type": "text" + }, + { + "bbox": [ + 226, + 360, + 235, + 370 + ], + "score": 0.83, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 358, + 278, + 375 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 278, + 360, + 408, + 374 + ], + "score": 0.92, + "content": "\\begin{array} { r } { C [ \\ell , b ] = \\sum _ { j : h _ { \\ell } ( j ) = b } f _ { j } \\cdot g _ { \\ell } ( j ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 358, + 455, + 375 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 455, + 361, + 485, + 370 + ], + "score": 0.87, + "content": "\\textit { i } \\in \\textit { U }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 358, + 506, + 375 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 372, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 183, + 388 + ], + "score": 1.0, + "content": "frequency estimate", + "type": "text" + }, + { + "bbox": [ + 184, + 372, + 193, + 387 + ], + "score": 0.89, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 373, + 293, + 388 + ], + "score": 1.0, + "content": "is equal to the median of", + "type": "text" + }, + { + "bbox": [ + 293, + 375, + 385, + 387 + ], + "score": 0.92, + "content": "\\{ g _ { \\ell } ( i ) \\cdot C [ \\ell , h _ { \\ell } ( i ) ] \\} _ { \\ell \\le k }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 373, + 506, + 388 + ], + "score": 1.0, + "content": ". Note that unlike the previous", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 386, + 272, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 237, + 401 + ], + "score": 1.0, + "content": "two methods, here we may have", + "type": "text" + }, + { + "bbox": [ + 237, + 386, + 268, + 399 + ], + "score": 0.94, + "content": "\\tilde { f _ { i } } < f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 387, + 272, + 401 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19 + }, + { + "type": "title", + "bbox": [ + 107, + 405, + 228, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 229, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 229, + 417 + ], + "score": 1.0, + "content": "3.3. ZIPFIAN DISTRIBUTION", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "score": 1.0, + "content": "In our theoretical analysis we assume that the item frequencies follow the Zipf Law. That is, if we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 432, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 383, + 446 + ], + "score": 1.0, + "content": "re-order the items so that their frequencies appear in a sorted order", + "type": "text" + }, + { + "bbox": [ + 383, + 433, + 480, + 444 + ], + "score": 0.92, + "content": "f _ { i _ { 1 } } \\geq f _ { i _ { 2 } } \\geq . . . \\geq f _ { i _ { n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 432, + 505, + 446 + ], + "score": 1.0, + "content": ", then", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 443, + 354, + 457 + ], + "spans": [ + { + "bbox": [ + 107, + 443, + 147, + 457 + ], + "score": 0.92, + "content": "f _ { i _ { j } } \\propto 1 / j", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 443, + 313, + 456 + ], + "score": 1.0, + "content": ". To simplify the notation we assume that", + "type": "text" + }, + { + "bbox": [ + 314, + 443, + 349, + 456 + ], + "score": 0.92, + "content": "f _ { i } = 1 / i", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 443, + 354, + 456 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "title", + "bbox": [ + 108, + 465, + 425, + 479 + ], + "lines": [ + { + "bbox": [ + 105, + 465, + 426, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 426, + 480 + ], + "score": 1.0, + "content": "4. LEARNING-BASED FREQUENCY ESTIMATION ALGORITHMS", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 485, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 505, + 498 + ], + "score": 1.0, + "content": "We aim to develop frequency estimation algorithms that exploit data properties for better perfor-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "mance. To do so, we learn an oracle that identifies heavy hitters, and use the oracle to assign each", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "heavy hitter its unique bucket to avoid collisions. Other items are simply hashed using any classic", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "frequency estimation algorithm (e.g., Count-Min, or Count-Sketch), as shown in the block-diagram", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 528, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 542 + ], + "score": 1.0, + "content": "in Figure 4.1. This design has two useful properties: First, it allows us to augment a classic fre-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "score": 1.0, + "content": "quency estimation algorithm with learning capabilities, producing a learning-based counterpart that", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "inherits the original guarantees of the classic algorithm. For example, if the classic algorithm is", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 562, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 106, + 562, + 506, + 575 + ], + "score": 1.0, + "content": "Count-Min, the resulting learning-based algorithm never underestimates the frequencies. Second, it", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 573, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 505, + 586 + ], + "score": 1.0, + "content": "provably reduces the estimation errors, and for the case of Count-Min it is (asymptotically) optimal.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 590, + 505, + 645 + ], + "lines": [ + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 424, + 603 + ], + "score": 1.0, + "content": "Algorithm 1 provides pseudo code for our design. The design assumes an oracle", + "type": "text" + }, + { + "bbox": [ + 424, + 590, + 451, + 602 + ], + "score": 0.85, + "content": "\\mathsf { H H } ( i )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 590, + 505, + 603 + ], + "score": 1.0, + "content": "that attempts", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 601, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 228, + 613 + ], + "score": 1.0, + "content": "to determine whether an item", + "type": "text" + }, + { + "bbox": [ + 228, + 602, + 234, + 611 + ], + "score": 0.64, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 601, + 505, + 613 + ], + "score": 1.0, + "content": "is a “heavy hitter” or not. All items classified as heavy hitters are", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 612, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 199, + 624 + ], + "score": 1.0, + "content": "assigned to one of the", + "type": "text" + }, + { + "bbox": [ + 199, + 613, + 212, + 623 + ], + "score": 0.89, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 612, + 505, + 624 + ], + "score": 1.0, + "content": "unique buckets reserved for heavy items. All other items are fed to the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 621, + 506, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 150, + 637 + ], + "score": 1.0, + "content": "remaining", + "type": "text" + }, + { + "bbox": [ + 150, + 623, + 183, + 634 + ], + "score": 0.91, + "content": "B - B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 621, + 506, + 637 + ], + "score": 1.0, + "content": "buckets using a conventional frequency estimation algorithm SketchAlg (e.g.,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 634, + 227, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 227, + 646 + ], + "score": 1.0, + "content": "Count-Min or Count-Sketch).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 650, + 505, + 687 + ], + "lines": [ + { + "bbox": [ + 105, + 650, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 314, + 664 + ], + "score": 1.0, + "content": "The estimation procedure is analogous. To compute", + "type": "text" + }, + { + "bbox": [ + 314, + 650, + 323, + 663 + ], + "score": 0.87, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 650, + 463, + 664 + ], + "score": 1.0, + "content": ", the algorithm first checks whether", + "type": "text" + }, + { + "bbox": [ + 464, + 653, + 468, + 662 + ], + "score": 0.79, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 650, + 506, + 664 + ], + "score": 1.0, + "content": "is stored", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 663, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 663, + 505, + 675 + ], + "score": 1.0, + "content": "in a unique bucket, and if so, reports its count. Otherwise, it queries the SketchAlg procedure. Note", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 674, + 454, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 419, + 687 + ], + "score": 1.0, + "content": "that if the element is stored in a unique bucket, its reported count is exact, i.e.,", + "type": "text" + }, + { + "bbox": [ + 420, + 674, + 450, + 687 + ], + "score": 0.92, + "content": "\\tilde { f _ { i } } = f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 674, + 454, + 687 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 107, + 692, + 505, + 725 + ], + "lines": [ + { + "bbox": [ + 105, + 691, + 505, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 451, + 704 + ], + "score": 1.0, + "content": "The oracle is constructed using machine learning and trained with a small subset of", + "type": "text" + }, + { + "bbox": [ + 452, + 693, + 459, + 702 + ], + "score": 0.8, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 691, + 490, + 704 + ], + "score": 1.0, + "content": ", call it", + "type": "text" + }, + { + "bbox": [ + 491, + 692, + 501, + 702 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 691, + 505, + 704 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 703, + 506, + 716 + ], + "spans": [ + { + "bbox": [ + 105, + 703, + 506, + 716 + ], + "score": 1.0, + "content": "Note that the oracle learns the properties that identify heavy hitters as opposed to the identities of", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 713, + 505, + 726 + ], + "spans": [ + { + "bbox": [ + 105, + 713, + 505, + 726 + ], + "score": 1.0, + "content": "the heavy hitters themselves. For example, in the case of word frequency, the oracle would learn that", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45 + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2019", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 81, + 453, + 93 + ], + "lines": [], + "index": 0, + "bbox_fs": [ + 105, + 81, + 450, + 96 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 93, + 379, + 119 + ], + "lines": [ + { + "bbox": [ + 231, + 93, + 379, + 119 + ], + "spans": [ + { + "bbox": [ + 231, + 93, + 379, + 119 + ], + "score": 0.93, + "content": "\\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } ) : = 1 / N \\sum _ { i \\in U } | \\tilde { f } _ { i } - f _ { i } | \\cdot f _ { i }", + "type": "interline_equation", + "image_path": "e755bcbcb71e52c857d3988b4a20f589de471617b199ab63acfce2d68c4ef3a5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 231, + 93, + 379, + 119 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 504, + 169 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 136 + ], + "score": 1.0, + "content": "We note that the theoretical guarantees of frequency estimation algorithms are typically phrased in", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 134, + 506, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 135, + 127, + 150 + ], + "score": 1.0, + "content": "the “", + "type": "text" + }, + { + "bbox": [ + 127, + 135, + 148, + 147 + ], + "score": 0.87, + "content": "( \\epsilon , \\delta )", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 135, + 200, + 150 + ], + "score": 1.0, + "content": "-form”, e.g.,", + "type": "text" + }, + { + "bbox": [ + 200, + 134, + 303, + 148 + ], + "score": 0.92, + "content": "\\mathrm { P r } [ | \\bar { \\tilde { f } } _ { i } - f _ { i } | > \\epsilon N ] < \\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 135, + 344, + 150 + ], + "score": 1.0, + "content": "for every", + "type": "text" + }, + { + "bbox": [ + 344, + 137, + 349, + 146 + ], + "score": 0.71, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 349, + 135, + 506, + 150 + ], + "score": 1.0, + "content": "(see e.g., Cormode & Muthukrishnan", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 146, + 506, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 356, + 160 + ], + "score": 1.0, + "content": "(2005b)). However, this formulation involves two objectives", + "type": "text" + }, + { + "bbox": [ + 356, + 149, + 362, + 156 + ], + "score": 0.34, + "content": "\\stackrel { \\cdot } { \\epsilon }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 146, + 380, + 160 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 380, + 147, + 387, + 157 + ], + "score": 0.7, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 146, + 506, + 160 + ], + "score": 1.0, + "content": "). We believe that the (single", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 158, + 492, + 171 + ], + "spans": [ + { + "bbox": [ + 106, + 158, + 492, + 171 + ], + "score": 1.0, + "content": "objective) expected error in Equation 3.1 is more natural from the machine learning perspective.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 122, + 506, + 171 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 174, + 320, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 174, + 320, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 320, + 187 + ], + "score": 1.0, + "content": "3.2. ALGORITHMS FOR FREQUENCY ESTIMATION", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 104, + 191, + 479, + 204 + ], + "lines": [ + { + "bbox": [ + 104, + 189, + 480, + 206 + ], + "spans": [ + { + "bbox": [ + 104, + 189, + 480, + 206 + ], + "score": 1.0, + "content": "In this section, we recap three variants of hashing-based algorithms for frequency estimation.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 104, + 189, + 480, + 206 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 210, + 505, + 286 + ], + "lines": [ + { + "bbox": [ + 106, + 210, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 505, + 222 + ], + "score": 1.0, + "content": "Single Hash Function. The basic hashing algorithm uses a single uniformly random hash function", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 221, + 505, + 234 + ], + "spans": [ + { + "bbox": [ + 107, + 221, + 168, + 233 + ], + "score": 0.91, + "content": "h : { \\bar { U } } [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 221, + 235, + 234 + ], + "score": 1.0, + "content": ", where we use", + "type": "text" + }, + { + "bbox": [ + 235, + 222, + 249, + 233 + ], + "score": 0.88, + "content": "[ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 221, + 325, + 234 + ], + "score": 1.0, + "content": "to denote the set", + "type": "text" + }, + { + "bbox": [ + 325, + 221, + 363, + 233 + ], + "score": 0.93, + "content": "\\{ 1 \\ldots B \\bar { \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 221, + 505, + 234 + ], + "score": 1.0, + "content": ". The algorithm maintains a one-", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 232, + 504, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 181, + 245 + ], + "score": 1.0, + "content": "dimensional array", + "type": "text" + }, + { + "bbox": [ + 181, + 232, + 223, + 244 + ], + "score": 0.91, + "content": "C [ 1 \\ldots B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 232, + 458, + 245 + ], + "score": 1.0, + "content": ", in which all entries are initialized to 0. Given an element", + "type": "text" + }, + { + "bbox": [ + 459, + 234, + 463, + 243 + ], + "score": 0.77, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 232, + 504, + 245 + ], + "score": 1.0, + "content": ", the algo-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 240, + 506, + 259 + ], + "spans": [ + { + "bbox": [ + 104, + 240, + 176, + 259 + ], + "score": 1.0, + "content": "rithm increments", + "type": "text" + }, + { + "bbox": [ + 177, + 244, + 208, + 255 + ], + "score": 0.92, + "content": "C [ h ( i ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 240, + 417, + 259 + ], + "score": 1.0, + "content": ". It can be seen that at the end of the stream, we have", + "type": "text" + }, + { + "bbox": [ + 417, + 243, + 501, + 258 + ], + "score": 0.93, + "content": "\\begin{array} { r } { C [ b ] = \\sum _ { j : h ( j ) = b } \\mathsf { \\bar { f } } _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 240, + 506, + 259 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 256, + 506, + 274 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 160, + 274 + ], + "score": 1.0, + "content": "The estimate", + "type": "text" + }, + { + "bbox": [ + 161, + 257, + 170, + 270 + ], + "score": 0.89, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 256, + 183, + 274 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 183, + 258, + 192, + 270 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 256, + 246, + 274 + ], + "score": 1.0, + "content": "is defined as", + "type": "text" + }, + { + "bbox": [ + 247, + 257, + 377, + 273 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\tilde { f } _ { i } = C [ h ( i ) ] = \\sum _ { j : h ( i ) = h ( j ) } f _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 256, + 506, + 274 + ], + "score": 1.0, + "content": ". Note that it is always the case", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 270, + 160, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 124, + 288 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 124, + 271, + 154, + 286 + ], + "score": 0.92, + "content": "\\tilde { f _ { i } } \\geq f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 270, + 160, + 288 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5, + "bbox_fs": [ + 104, + 210, + 506, + 288 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 292, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 291, + 506, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 198, + 306 + ], + "score": 1.0, + "content": "Count-Min. We have", + "type": "text" + }, + { + "bbox": [ + 198, + 293, + 205, + 303 + ], + "score": 0.82, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 291, + 300, + 306 + ], + "score": 1.0, + "content": "distinct hash functions", + "type": "text" + }, + { + "bbox": [ + 300, + 293, + 358, + 304 + ], + "score": 0.93, + "content": "h _ { i } : U \\to [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 291, + 413, + 306 + ], + "score": 1.0, + "content": "and an array", + "type": "text" + }, + { + "bbox": [ + 414, + 293, + 423, + 303 + ], + "score": 0.82, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 291, + 453, + 306 + ], + "score": 1.0, + "content": "of size", + "type": "text" + }, + { + "bbox": [ + 454, + 293, + 481, + 303 + ], + "score": 0.91, + "content": "k \\times B", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 291, + 506, + 306 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 301, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 104, + 301, + 189, + 320 + ], + "score": 1.0, + "content": "algorithm maintains", + "type": "text" + }, + { + "bbox": [ + 189, + 304, + 198, + 313 + ], + "score": 0.83, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 301, + 368, + 320 + ], + "score": 1.0, + "content": ", such that at the end of the stream we have", + "type": "text" + }, + { + "bbox": [ + 368, + 303, + 464, + 318 + ], + "score": 0.92, + "content": "\\begin{array} { r } { C [ \\ell , b ] = \\sum _ { j : h \\ell ( j ) = b } f _ { j } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 301, + 506, + 320 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 317, + 478, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 318, + 131, + 329 + ], + "score": 0.87, + "content": "i \\in U", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 317, + 227, + 333 + ], + "score": 1.0, + "content": ", the frequency estimate", + "type": "text" + }, + { + "bbox": [ + 228, + 317, + 237, + 330 + ], + "score": 0.89, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 317, + 282, + 333 + ], + "score": 1.0, + "content": "is equal to", + "type": "text" + }, + { + "bbox": [ + 282, + 318, + 358, + 331 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\operatorname* { m i n } _ { \\ell \\le k } C [ \\ell , h _ { \\ell } ( i ) ] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 358, + 317, + 443, + 333 + ], + "score": 1.0, + "content": ", and always satisfies", + "type": "text" + }, + { + "bbox": [ + 443, + 317, + 474, + 330 + ], + "score": 0.91, + "content": "\\tilde { f _ { i } } \\geq f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 317, + 478, + 333 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 104, + 291, + 506, + 333 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 337, + 505, + 400 + ], + "lines": [ + { + "bbox": [ + 106, + 336, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 310, + 350 + ], + "score": 1.0, + "content": "Count-Sketch. Similarly to Count-Min, we have", + "type": "text" + }, + { + "bbox": [ + 310, + 338, + 317, + 348 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 336, + 413, + 350 + ], + "score": 1.0, + "content": "distinct hash functions", + "type": "text" + }, + { + "bbox": [ + 413, + 338, + 474, + 349 + ], + "score": 0.91, + "content": "h _ { i } : U \\to [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 474, + 336, + 505, + 350 + ], + "score": 1.0, + "content": "and an", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 347, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 129, + 361 + ], + "score": 1.0, + "content": "array", + "type": "text" + }, + { + "bbox": [ + 130, + 349, + 139, + 359 + ], + "score": 0.82, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 347, + 168, + 361 + ], + "score": 1.0, + "content": "of size", + "type": "text" + }, + { + "bbox": [ + 169, + 349, + 196, + 359 + ], + "score": 0.9, + "content": "k \\times B", + "type": "inline_equation" + }, + { + "bbox": [ + 196, + 347, + 360, + 361 + ], + "score": 1.0, + "content": ". Additionally, in Count-Sketch, we have", + "type": "text" + }, + { + "bbox": [ + 361, + 349, + 367, + 358 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 347, + 428, + 361 + ], + "score": 1.0, + "content": "sign functions", + "type": "text" + }, + { + "bbox": [ + 428, + 349, + 501, + 360 + ], + "score": 0.91, + "content": "g _ { i } : U \\stackrel { \\cdot } { } \\bar { \\{ - 1 , 1 \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 347, + 505, + 361 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 358, + 506, + 375 + ], + "spans": [ + { + "bbox": [ + 105, + 358, + 225, + 375 + ], + "score": 1.0, + "content": "and the algorithm maintains", + "type": "text" + }, + { + "bbox": [ + 226, + 360, + 235, + 370 + ], + "score": 0.83, + "content": "C", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 358, + 278, + 375 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 278, + 360, + 408, + 374 + ], + "score": 0.92, + "content": "\\begin{array} { r } { C [ \\ell , b ] = \\sum _ { j : h _ { \\ell } ( j ) = b } f _ { j } \\cdot g _ { \\ell } ( j ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 358, + 455, + 375 + ], + "score": 1.0, + "content": ". For each", + "type": "text" + }, + { + "bbox": [ + 455, + 361, + 485, + 370 + ], + "score": 0.87, + "content": "\\textit { i } \\in \\textit { U }", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 358, + 506, + 375 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 372, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 183, + 388 + ], + "score": 1.0, + "content": "frequency estimate", + "type": "text" + }, + { + "bbox": [ + 184, + 372, + 193, + 387 + ], + "score": 0.89, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 373, + 293, + 388 + ], + "score": 1.0, + "content": "is equal to the median of", + "type": "text" + }, + { + "bbox": [ + 293, + 375, + 385, + 387 + ], + "score": 0.92, + "content": "\\{ g _ { \\ell } ( i ) \\cdot C [ \\ell , h _ { \\ell } ( i ) ] \\} _ { \\ell \\le k }", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 373, + 506, + 388 + ], + "score": 1.0, + "content": ". Note that unlike the previous", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 386, + 272, + 401 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 237, + 401 + ], + "score": 1.0, + "content": "two methods, here we may have", + "type": "text" + }, + { + "bbox": [ + 237, + 386, + 268, + 399 + ], + "score": 0.94, + "content": "\\tilde { f _ { i } } < f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 387, + 272, + 401 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 336, + 506, + 401 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 405, + 228, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 403, + 229, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 229, + 417 + ], + "score": 1.0, + "content": "3.3. ZIPFIAN DISTRIBUTION", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 421, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 434 + ], + "score": 1.0, + "content": "In our theoretical analysis we assume that the item frequencies follow the Zipf Law. That is, if we", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 432, + 505, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 432, + 383, + 446 + ], + "score": 1.0, + "content": "re-order the items so that their frequencies appear in a sorted order", + "type": "text" + }, + { + "bbox": [ + 383, + 433, + 480, + 444 + ], + "score": 0.92, + "content": "f _ { i _ { 1 } } \\geq f _ { i _ { 2 } } \\geq . . . \\geq f _ { i _ { n } }", + "type": "inline_equation" + }, + { + "bbox": [ + 481, + 432, + 505, + 446 + ], + "score": 1.0, + "content": ", then", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 443, + 354, + 457 + ], + "spans": [ + { + "bbox": [ + 107, + 443, + 147, + 457 + ], + "score": 0.92, + "content": "f _ { i _ { j } } \\propto 1 / j", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 443, + 313, + 456 + ], + "score": 1.0, + "content": ". To simplify the notation we assume that", + "type": "text" + }, + { + "bbox": [ + 314, + 443, + 349, + 456 + ], + "score": 0.92, + "content": "f _ { i } = 1 / i", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 443, + 354, + 456 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 420, + 505, + 457 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 465, + 425, + 479 + ], + "lines": [ + { + "bbox": [ + 105, + 465, + 426, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 426, + 480 + ], + "score": 1.0, + "content": "4. LEARNING-BASED FREQUENCY ESTIMATION ALGORITHMS", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 505, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 485, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 505, + 498 + ], + "score": 1.0, + "content": "We aim to develop frequency estimation algorithms that exploit data properties for better perfor-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 505, + 509 + ], + "score": 1.0, + "content": "mance. To do so, we learn an oracle that identifies heavy hitters, and use the oracle to assign each", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "heavy hitter its unique bucket to avoid collisions. Other items are simply hashed using any classic", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 518, + 505, + 531 + ], + "spans": [ + { + "bbox": [ + 106, + 518, + 505, + 531 + ], + "score": 1.0, + "content": "frequency estimation algorithm (e.g., Count-Min, or Count-Sketch), as shown in the block-diagram", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 528, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 505, + 542 + ], + "score": 1.0, + "content": "in Figure 4.1. This design has two useful properties: First, it allows us to augment a classic fre-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "score": 1.0, + "content": "quency estimation algorithm with learning capabilities, producing a learning-based counterpart that", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 505, + 564 + ], + "score": 1.0, + "content": "inherits the original guarantees of the classic algorithm. For example, if the classic algorithm is", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 562, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 106, + 562, + 506, + 575 + ], + "score": 1.0, + "content": "Count-Min, the resulting learning-based algorithm never underestimates the frequencies. Second, it", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 573, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 505, + 586 + ], + "score": 1.0, + "content": "provably reduces the estimation errors, and for the case of Count-Min it is (asymptotically) optimal.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 485, + 506, + 586 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 590, + 505, + 645 + ], + "lines": [ + { + "bbox": [ + 106, + 590, + 505, + 603 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 424, + 603 + ], + "score": 1.0, + "content": "Algorithm 1 provides pseudo code for our design. The design assumes an oracle", + "type": "text" + }, + { + "bbox": [ + 424, + 590, + 451, + 602 + ], + "score": 0.85, + "content": "\\mathsf { H H } ( i )", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 590, + 505, + 603 + ], + "score": 1.0, + "content": "that attempts", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 601, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 228, + 613 + ], + "score": 1.0, + "content": "to determine whether an item", + "type": "text" + }, + { + "bbox": [ + 228, + 602, + 234, + 611 + ], + "score": 0.64, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 601, + 505, + 613 + ], + "score": 1.0, + "content": "is a “heavy hitter” or not. All items classified as heavy hitters are", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 612, + 505, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 199, + 624 + ], + "score": 1.0, + "content": "assigned to one of the", + "type": "text" + }, + { + "bbox": [ + 199, + 613, + 212, + 623 + ], + "score": 0.89, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 612, + 505, + 624 + ], + "score": 1.0, + "content": "unique buckets reserved for heavy items. All other items are fed to the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 621, + 506, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 150, + 637 + ], + "score": 1.0, + "content": "remaining", + "type": "text" + }, + { + "bbox": [ + 150, + 623, + 183, + 634 + ], + "score": 0.91, + "content": "B - B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 621, + 506, + 637 + ], + "score": 1.0, + "content": "buckets using a conventional frequency estimation algorithm SketchAlg (e.g.,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 634, + 227, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 634, + 227, + 646 + ], + "score": 1.0, + "content": "Count-Min or Count-Sketch).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 590, + 506, + 646 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 650, + 505, + 687 + ], + "lines": [ + { + "bbox": [ + 105, + 650, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 650, + 314, + 664 + ], + "score": 1.0, + "content": "The estimation procedure is analogous. To compute", + "type": "text" + }, + { + "bbox": [ + 314, + 650, + 323, + 663 + ], + "score": 0.87, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 650, + 463, + 664 + ], + "score": 1.0, + "content": ", the algorithm first checks whether", + "type": "text" + }, + { + "bbox": [ + 464, + 653, + 468, + 662 + ], + "score": 0.79, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 650, + 506, + 664 + ], + "score": 1.0, + "content": "is stored", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 663, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 663, + 505, + 675 + ], + "score": 1.0, + "content": "in a unique bucket, and if so, reports its count. Otherwise, it queries the SketchAlg procedure. Note", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 674, + 454, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 419, + 687 + ], + "score": 1.0, + "content": "that if the element is stored in a unique bucket, its reported count is exact, i.e.,", + "type": "text" + }, + { + "bbox": [ + 420, + 674, + 450, + 687 + ], + "score": 0.92, + "content": "\\tilde { f _ { i } } = f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 674, + 454, + 687 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 650, + 506, + 687 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 692, + 505, + 725 + ], + "lines": [ + { + "bbox": [ + 105, + 691, + 505, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 451, + 704 + ], + "score": 1.0, + "content": "The oracle is constructed using machine learning and trained with a small subset of", + "type": "text" + }, + { + "bbox": [ + 452, + 693, + 459, + 702 + ], + "score": 0.8, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 691, + 490, + 704 + ], + "score": 1.0, + "content": ", call it", + "type": "text" + }, + { + "bbox": [ + 491, + 692, + 501, + 702 + ], + "score": 0.87, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 691, + 505, + 704 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 703, + 506, + 716 + ], + "spans": [ + { + "bbox": [ + 105, + 703, + 506, + 716 + ], + "score": 1.0, + "content": "Note that the oracle learns the properties that identify heavy hitters as opposed to the identities of", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 713, + 505, + 726 + ], + "spans": [ + { + "bbox": [ + 105, + 713, + 505, + 726 + ], + "score": 1.0, + "content": "the heavy hitters themselves. For example, in the case of word frequency, the oracle would learn that", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "shorter words are more frequent, so that it can identify popular words even if they did not appear in", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 92, + 183, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 92, + 168, + 106 + ], + "score": 1.0, + "content": "the training set", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 168, + 93, + 178, + 104 + ], + "score": 0.86, + "content": "S ^ { \\prime }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 179, + 92, + 183, + 106 + ], + "score": 1.0, + "content": ".", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 691, + 506, + 726 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "shorter words are more frequent, so that it can identify popular words even if they did not appear in", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 92, + 183, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 92, + 168, + 106 + ], + "score": 1.0, + "content": "the training set", + "type": "text" + }, + { + "bbox": [ + 168, + 93, + 178, + 104 + ], + "score": 0.86, + "content": "S ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 92, + 183, + 106 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "title", + "bbox": [ + 107, + 110, + 172, + 122 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 172, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 172, + 122 + ], + "score": 1.0, + "content": "4.1. ANALYSIS", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 127, + 504, + 171 + ], + "lines": [ + { + "bbox": [ + 106, + 128, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 128, + 505, + 139 + ], + "score": 1.0, + "content": "Our algorithms combine simplicity with strong error bounds. Below, we summarize our theoret-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 138, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 505, + 151 + ], + "score": 1.0, + "content": "ical results, and leave all theorems, lemmas, and proofs to the appendix. In particular, Table 4.1", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "score": 1.0, + "content": "lists the results proven in this paper, where each row refers to a specific streaming algorithm, its", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 160, + 405, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 405, + 173 + ], + "score": 1.0, + "content": "corresponding error bound, and the theorem/lemma that proves the bound.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 107, + 177, + 505, + 233 + ], + "lines": [ + { + "bbox": [ + 106, + 178, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 505, + 189 + ], + "score": 1.0, + "content": "First, we show (Theorem 9.11 and Theorem 9.14) that if the heavy hitter oracle is accurate, then the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 188, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 188, + 505, + 200 + ], + "score": 1.0, + "content": "error of the learned variant of Count-Min is up to a logarithmic factor smaller than that of its non-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 199, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 346, + 212 + ], + "score": 1.0, + "content": "learning counterpart. The improvement is maximized when", + "type": "text" + }, + { + "bbox": [ + 346, + 200, + 356, + 209 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 199, + 448, + 212 + ], + "score": 1.0, + "content": "is of the same order as", + "type": "text" + }, + { + "bbox": [ + 449, + 201, + 456, + 209 + ], + "score": 0.72, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 199, + 505, + 212 + ], + "score": 1.0, + "content": "(a common", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 209, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 506, + 223 + ], + "score": 1.0, + "content": "scenario2). Furthermore, we prove that this result continues to hold even if the learned oracle makes", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 221, + 419, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 241, + 234 + ], + "score": 1.0, + "content": "prediction errors with probability", + "type": "text" + }, + { + "bbox": [ + 242, + 222, + 248, + 231 + ], + "score": 0.74, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 221, + 293, + 234 + ], + "score": 1.0, + "content": ", as long as", + "type": "text" + }, + { + "bbox": [ + 294, + 221, + 356, + 233 + ], + "score": 0.93, + "content": "\\delta = { \\cal O } ( 1 / \\ln n )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 221, + 419, + 234 + ], + "score": 1.0, + "content": "(Lemma 9.15).", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 505, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 504, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 504, + 251 + ], + "score": 1.0, + "content": "Second, we show that, asymptotically, our learned Count-Min algorithm cannot be improved any", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "score": 1.0, + "content": "further by designing a better hashing scheme. Specifically, for the case of Learned Count-Min with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 260, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 104, + 260, + 506, + 273 + ], + "score": 1.0, + "content": "a perfect oracle, our design achieves the same asymptotic error as the “Ideal Count-Min”, which", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 271, + 360, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 360, + 284 + ], + "score": 1.0, + "content": "optimizes its hash function for the given input (Theorem 10.4).", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "table", + "bbox": [ + 131, + 315, + 480, + 387 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 288, + 503, + 311 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 286, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 377, + 301 + ], + "score": 1.0, + "content": "Finally, we note that the learning-augmented algorithm inherits any", + "type": "text" + }, + { + "bbox": [ + 378, + 288, + 399, + 299 + ], + "score": 0.91, + "content": "( \\epsilon , \\delta )", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 286, + 505, + 301 + ], + "score": 1.0, + "content": "-guarantees of the original", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 414, + 312 + ], + "score": 1.0, + "content": "version. Specifically, its error is not larger than that of SketchAlg with space", + "type": "text" + }, + { + "bbox": [ + 415, + 299, + 445, + 310 + ], + "score": 0.91, + "content": "B - B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 298, + 505, + 312 + ], + "score": 1.0, + "content": ", for any input.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "table_body", + "bbox": [ + 131, + 315, + 480, + 387 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 315, + 480, + 387 + ], + "spans": [ + { + "bbox": [ + 131, + 315, + 480, + 387 + ], + "score": 0.978, + "html": "
AlgorithmsExpected ErrorAnalysis
Single Hash Function (B)(ln² n/B)Lemma 9.2
Count-Min Sketch (k,B)Ω(k lnnand O( (管)BlnkBTheorem 9.11
Learned Count-Min(B)0(ln²(n/B)/B)Theorem 9.14
Ideal Count-Min(B)(ln²(n/B)/B)Theorem 10.4
", + "type": "table", + "image_path": "9d78dd753541e132318969338b9f40dfeb1894d9deca393806a0c8c053c0df21.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 131, + 315, + 480, + 339.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 131, + 339.0, + 480, + 363.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 131, + 363.0, + 480, + 387.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 107, + 566, + 316, + 578 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 564, + 318, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 318, + 581 + ], + "score": 1.0, + "content": "Algorithm 1 Learning-Based Frequency Estimation", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 388, + 506, + 432 + ], + "lines": [ + { + "bbox": [ + 105, + 386, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 506, + 401 + ], + "score": 1.0, + "content": "Table 4.1: Our performance bounds for different algorithms on streams with frequencies obeying", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 398, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 151, + 411 + ], + "score": 1.0, + "content": "Zipf Law.", + "type": "text" + }, + { + "bbox": [ + 152, + 399, + 159, + 409 + ], + "score": 0.77, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 398, + 216, + 411 + ], + "score": 1.0, + "content": "is a constant", + "type": "text" + }, + { + "bbox": [ + 216, + 399, + 239, + 410 + ], + "score": 0.83, + "content": "\\left( \\geq 2 \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 398, + 423, + 411 + ], + "score": 1.0, + "content": "that refers to the number of hash functions,", + "type": "text" + }, + { + "bbox": [ + 424, + 399, + 433, + 409 + ], + "score": 0.79, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 398, + 505, + 411 + ], + "score": 1.0, + "content": "is the number of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 410, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 160, + 422 + ], + "score": 1.0, + "content": "buckets, and", + "type": "text" + }, + { + "bbox": [ + 160, + 412, + 168, + 420 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 410, + 505, + 422 + ], + "score": 1.0, + "content": "is the number of distinct elements. The space complexity of all algorithms is the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 421, + 470, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 132, + 433 + ], + "score": 1.0, + "content": "same,", + "type": "text" + }, + { + "bbox": [ + 132, + 421, + 156, + 433 + ], + "score": 0.92, + "content": "\\Theta ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 421, + 470, + 433 + ], + "score": 1.0, + "content": ". See section 9.4 for non-asymptotic versions of the some of the above bounds", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5 + }, + { + "type": "title", + "bbox": [ + 107, + 442, + 196, + 454 + ], + "lines": [ + { + "bbox": [ + 106, + 441, + 196, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 196, + 456 + ], + "score": 1.0, + "content": "5. EXPERIMENTS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 462, + 505, + 540 + ], + "lines": [ + { + "bbox": [ + 105, + 462, + 505, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 476 + ], + "score": 1.0, + "content": "Baselines. We compare our learning-based algorithms with their non-learning counterparts. Specif-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 473, + 504, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 504, + 487 + ], + "score": 1.0, + "content": "ically, we augment Count-Min with a learned oracle using Algorithm 1, and call the learning-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 485, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 485, + 505, + 496 + ], + "score": 1.0, + "content": "augmented algorithm “Learned Count-Min”. We then compare Learned Count-Min with traditional", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 496, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 496, + 505, + 507 + ], + "score": 1.0, + "content": "Count-Min. We also compare it with “Learned Count-Min with Ideal Oracle” where the neural-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 506, + 506, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 506, + 519 + ], + "score": 1.0, + "content": "network oracle is replaced with an ideal oracle that knows the identities of the heavy hitters in the test", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 517, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "data, and “Table Lookup with Count-Min” where the heavy hitter oracle is replaced with a lookup", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "table that memorizes heavy hitters in the training set. The comparison with the latter baseline allows", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 118, + 546, + 446, + 557 + ], + "lines": [ + { + "bbox": [ + 119, + 545, + 444, + 559 + ], + "spans": [ + { + "bbox": [ + 119, + 545, + 259, + 559 + ], + "score": 1.0, + "content": "2For example, Goyal et al. (2012) uses", + "type": "text" + }, + { + "bbox": [ + 259, + 546, + 347, + 557 + ], + "score": 0.88, + "content": "B = 2 0 M , n = 3 3 . 5 M", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 545, + 363, + 559 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 363, + 546, + 444, + 557 + ], + "score": 0.87, + "content": "B = 5 0 M , n = 9 4 M", + "type": "inline_equation" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "image", + "bbox": [ + 393, + 576, + 505, + 698 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 393, + 576, + 505, + 698 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 393, + 576, + 505, + 698 + ], + "spans": [ + { + "bbox": [ + 393, + 576, + 505, + 698 + ], + "score": 0.936, + "type": "image", + "image_path": "252885ebf6210b3d238af495bc61e87c586a3d4bfea456512057661696199ae3.jpg" + } + ] + } + ], + "index": 41.0, + "virtual_lines": [ + { + "bbox": [ + 393, + 576, + 505, + 637.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 393, + 637.0, + 505, + 698.0 + ], + "spans": [], + "index": 45 + } + ] + } + ], + "index": 41.0 + }, + { + "type": "image", + "bbox": [ + 108, + 582, + 328, + 713 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 582, + 328, + 713 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 582, + 328, + 713 + ], + "spans": [ + { + "bbox": [ + 108, + 582, + 328, + 713 + ], + "score": 0.116, + "type": "image", + "image_path": "0f609aabef3527949ff1e2f40a522d0558977d0ed1e07fcdc75b200947cb9c6f.jpg" + } + ] + } + ], + "index": 40.5, + "virtual_lines": [ + { + "bbox": [ + 108, + 582, + 328, + 595.1 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 108, + 595.1, + 328, + 608.2 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 108, + 608.2, + 328, + 621.3000000000001 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 108, + 621.3000000000001, + 328, + 634.4000000000001 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 108, + 634.4000000000001, + 328, + 647.5000000000001 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 108, + 647.5000000000001, + 328, + 660.6000000000001 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 108, + 660.6000000000001, + 328, + 673.7000000000002 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 108, + 673.7000000000002, + 328, + 686.8000000000002 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 108, + 686.8000000000002, + 328, + 699.9000000000002 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 108, + 699.9000000000002, + 328, + 713.0000000000002 + ], + "spans": [], + "index": 46 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 153, + 717, + 460, + 729 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 150, + 716, + 460, + 731 + ], + "spans": [ + { + "bbox": [ + 150, + 716, + 460, + 731 + ], + "score": 1.0, + "content": "Figure 4.1: Pseudo-code and block-diagram representation of our algorithms", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + } + ], + "index": 43.75 + } + ], + "page_idx": 4, + "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 2019", + "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": [ + 106, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 506, + 106 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 107, + 110, + 172, + 122 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 172, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 172, + 122 + ], + "score": 1.0, + "content": "4.1. ANALYSIS", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 127, + 504, + 171 + ], + "lines": [ + { + "bbox": [ + 106, + 128, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 128, + 505, + 139 + ], + "score": 1.0, + "content": "Our algorithms combine simplicity with strong error bounds. Below, we summarize our theoret-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 138, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 505, + 151 + ], + "score": 1.0, + "content": "ical results, and leave all theorems, lemmas, and proofs to the appendix. In particular, Table 4.1", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 505, + 162 + ], + "score": 1.0, + "content": "lists the results proven in this paper, where each row refers to a specific streaming algorithm, its", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 160, + 405, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 405, + 173 + ], + "score": 1.0, + "content": "corresponding error bound, and the theorem/lemma that proves the bound.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 128, + 505, + 173 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 177, + 505, + 233 + ], + "lines": [ + { + "bbox": [ + 106, + 178, + 505, + 189 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 505, + 189 + ], + "score": 1.0, + "content": "First, we show (Theorem 9.11 and Theorem 9.14) that if the heavy hitter oracle is accurate, then the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 188, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 188, + 505, + 200 + ], + "score": 1.0, + "content": "error of the learned variant of Count-Min is up to a logarithmic factor smaller than that of its non-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 199, + 505, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 346, + 212 + ], + "score": 1.0, + "content": "learning counterpart. The improvement is maximized when", + "type": "text" + }, + { + "bbox": [ + 346, + 200, + 356, + 209 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 199, + 448, + 212 + ], + "score": 1.0, + "content": "is of the same order as", + "type": "text" + }, + { + "bbox": [ + 449, + 201, + 456, + 209 + ], + "score": 0.72, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 199, + 505, + 212 + ], + "score": 1.0, + "content": "(a common", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 209, + 506, + 223 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 506, + 223 + ], + "score": 1.0, + "content": "scenario2). Furthermore, we prove that this result continues to hold even if the learned oracle makes", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 221, + 419, + 234 + ], + "spans": [ + { + "bbox": [ + 105, + 221, + 241, + 234 + ], + "score": 1.0, + "content": "prediction errors with probability", + "type": "text" + }, + { + "bbox": [ + 242, + 222, + 248, + 231 + ], + "score": 0.74, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 221, + 293, + 234 + ], + "score": 1.0, + "content": ", as long as", + "type": "text" + }, + { + "bbox": [ + 294, + 221, + 356, + 233 + ], + "score": 0.93, + "content": "\\delta = { \\cal O } ( 1 / \\ln n )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 221, + 419, + 234 + ], + "score": 1.0, + "content": "(Lemma 9.15).", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 178, + 506, + 234 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 237, + 505, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 237, + 504, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 237, + 504, + 251 + ], + "score": 1.0, + "content": "Second, we show that, asymptotically, our learned Count-Min algorithm cannot be improved any", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "score": 1.0, + "content": "further by designing a better hashing scheme. Specifically, for the case of Learned Count-Min with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 260, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 104, + 260, + 506, + 273 + ], + "score": 1.0, + "content": "a perfect oracle, our design achieves the same asymptotic error as the “Ideal Count-Min”, which", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 271, + 360, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 360, + 284 + ], + "score": 1.0, + "content": "optimizes its hash function for the given input (Theorem 10.4).", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 237, + 506, + 284 + ] + }, + { + "type": "table", + "bbox": [ + 131, + 315, + 480, + 387 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 288, + 503, + 311 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 286, + 505, + 301 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 377, + 301 + ], + "score": 1.0, + "content": "Finally, we note that the learning-augmented algorithm inherits any", + "type": "text" + }, + { + "bbox": [ + 378, + 288, + 399, + 299 + ], + "score": 0.91, + "content": "( \\epsilon , \\delta )", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 286, + 505, + 301 + ], + "score": 1.0, + "content": "-guarantees of the original", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 298, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 414, + 312 + ], + "score": 1.0, + "content": "version. Specifically, its error is not larger than that of SketchAlg with space", + "type": "text" + }, + { + "bbox": [ + 415, + 299, + 445, + 310 + ], + "score": 0.91, + "content": "B - B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 298, + 505, + 312 + ], + "score": 1.0, + "content": ", for any input.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "table_body", + "bbox": [ + 131, + 315, + 480, + 387 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 131, + 315, + 480, + 387 + ], + "spans": [ + { + "bbox": [ + 131, + 315, + 480, + 387 + ], + "score": 0.978, + "html": "
AlgorithmsExpected ErrorAnalysis
Single Hash Function (B)(ln² n/B)Lemma 9.2
Count-Min Sketch (k,B)Ω(k lnnand O( (管)BlnkBTheorem 9.11
Learned Count-Min(B)0(ln²(n/B)/B)Theorem 9.14
Ideal Count-Min(B)(ln²(n/B)/B)Theorem 10.4
", + "type": "table", + "image_path": "9d78dd753541e132318969338b9f40dfeb1894d9deca393806a0c8c053c0df21.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 131, + 315, + 480, + 339.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 131, + 339.0, + 480, + 363.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 131, + 363.0, + 480, + 387.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 107, + 566, + 316, + 578 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 564, + 318, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 564, + 318, + 581 + ], + "score": 1.0, + "content": "Algorithm 1 Learning-Based Frequency Estimation", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 388, + 506, + 432 + ], + "lines": [ + { + "bbox": [ + 105, + 386, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 386, + 506, + 401 + ], + "score": 1.0, + "content": "Table 4.1: Our performance bounds for different algorithms on streams with frequencies obeying", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 398, + 505, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 151, + 411 + ], + "score": 1.0, + "content": "Zipf Law.", + "type": "text" + }, + { + "bbox": [ + 152, + 399, + 159, + 409 + ], + "score": 0.77, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 398, + 216, + 411 + ], + "score": 1.0, + "content": "is a constant", + "type": "text" + }, + { + "bbox": [ + 216, + 399, + 239, + 410 + ], + "score": 0.83, + "content": "\\left( \\geq 2 \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 398, + 423, + 411 + ], + "score": 1.0, + "content": "that refers to the number of hash functions,", + "type": "text" + }, + { + "bbox": [ + 424, + 399, + 433, + 409 + ], + "score": 0.79, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 398, + 505, + 411 + ], + "score": 1.0, + "content": "is the number of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 410, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 160, + 422 + ], + "score": 1.0, + "content": "buckets, and", + "type": "text" + }, + { + "bbox": [ + 160, + 412, + 168, + 420 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 410, + 505, + 422 + ], + "score": 1.0, + "content": "is the number of distinct elements. The space complexity of all algorithms is the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 421, + 470, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 132, + 433 + ], + "score": 1.0, + "content": "same,", + "type": "text" + }, + { + "bbox": [ + 132, + 421, + 156, + 433 + ], + "score": 0.92, + "content": "\\Theta ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 421, + 470, + 433 + ], + "score": 1.0, + "content": ". See section 9.4 for non-asymptotic versions of the some of the above bounds", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 386, + 506, + 433 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 442, + 196, + 454 + ], + "lines": [ + { + "bbox": [ + 106, + 441, + 196, + 456 + ], + "spans": [ + { + "bbox": [ + 106, + 441, + 196, + 456 + ], + "score": 1.0, + "content": "5. EXPERIMENTS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 462, + 505, + 540 + ], + "lines": [ + { + "bbox": [ + 105, + 462, + 505, + 476 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 505, + 476 + ], + "score": 1.0, + "content": "Baselines. We compare our learning-based algorithms with their non-learning counterparts. Specif-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 473, + 504, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 504, + 487 + ], + "score": 1.0, + "content": "ically, we augment Count-Min with a learned oracle using Algorithm 1, and call the learning-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 485, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 485, + 505, + 496 + ], + "score": 1.0, + "content": "augmented algorithm “Learned Count-Min”. We then compare Learned Count-Min with traditional", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 496, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 496, + 505, + 507 + ], + "score": 1.0, + "content": "Count-Min. We also compare it with “Learned Count-Min with Ideal Oracle” where the neural-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 506, + 506, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 506, + 519 + ], + "score": 1.0, + "content": "network oracle is replaced with an ideal oracle that knows the identities of the heavy hitters in the test", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 517, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "data, and “Table Lookup with Count-Min” where the heavy hitter oracle is replaced with a lookup", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "table that memorizes heavy hitters in the training set. The comparison with the latter baseline allows", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 462, + 506, + 541 + ] + }, + { + "type": "text", + "bbox": [ + 118, + 546, + 446, + 557 + ], + "lines": [ + { + "bbox": [ + 119, + 545, + 444, + 559 + ], + "spans": [ + { + "bbox": [ + 119, + 545, + 259, + 559 + ], + "score": 1.0, + "content": "2For example, Goyal et al. (2012) uses", + "type": "text" + }, + { + "bbox": [ + 259, + 546, + 347, + 557 + ], + "score": 0.88, + "content": "B = 2 0 M , n = 3 3 . 5 M", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 545, + 363, + 559 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 363, + 546, + 444, + 557 + ], + "score": 0.87, + "content": "B = 5 0 M , n = 9 4 M", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "us to show the ability of Learned Count-Min to generalize and detect heavy items unseen in the", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "training set. We repeat the evaluation where we replace Count-Min (CM) with Count-Sketch (CS)", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 477, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 395, + 117 + ], + "score": 1.0, + "content": "and the corresponding variants. We use validation data to select the best", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 396, + 105, + 402, + 114 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 403, + 105, + 477, + 117 + ], + "score": 1.0, + "content": "for all algorithms.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 33, + "bbox_fs": [ + 119, + 545, + 444, + 559 + ] + }, + { + "type": "image", + "bbox": [ + 393, + 576, + 505, + 698 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 393, + 576, + 505, + 698 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 393, + 576, + 505, + 698 + ], + "spans": [ + { + "bbox": [ + 393, + 576, + 505, + 698 + ], + "score": 0.936, + "type": "image", + "image_path": "252885ebf6210b3d238af495bc61e87c586a3d4bfea456512057661696199ae3.jpg" + } + ] + } + ], + "index": 41.0, + "virtual_lines": [ + { + "bbox": [ + 393, + 576, + 505, + 637.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 393, + 637.0, + 505, + 698.0 + ], + "spans": [], + "index": 45 + } + ] + } + ], + "index": 41.0 + }, + { + "type": "image", + "bbox": [ + 108, + 582, + 328, + 713 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 582, + 328, + 713 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 582, + 328, + 713 + ], + "spans": [ + { + "bbox": [ + 108, + 582, + 328, + 713 + ], + "score": 0.116, + "type": "image", + "image_path": "0f609aabef3527949ff1e2f40a522d0558977d0ed1e07fcdc75b200947cb9c6f.jpg" + } + ] + } + ], + "index": 40.5, + "virtual_lines": [ + { + "bbox": [ + 108, + 582, + 328, + 595.1 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 108, + 595.1, + 328, + 608.2 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 108, + 608.2, + 328, + 621.3000000000001 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 108, + 621.3000000000001, + 328, + 634.4000000000001 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 108, + 634.4000000000001, + 328, + 647.5000000000001 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 108, + 647.5000000000001, + 328, + 660.6000000000001 + ], + "spans": [], + "index": 41 + }, + { + "bbox": [ + 108, + 660.6000000000001, + 328, + 673.7000000000002 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 108, + 673.7000000000002, + 328, + 686.8000000000002 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 108, + 686.8000000000002, + 328, + 699.9000000000002 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 108, + 699.9000000000002, + 328, + 713.0000000000002 + ], + "spans": [], + "index": 46 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 153, + 717, + 460, + 729 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 150, + 716, + 460, + 731 + ], + "spans": [ + { + "bbox": [ + 150, + 716, + 460, + 731 + ], + "score": 1.0, + "content": "Figure 4.1: Pseudo-code and block-diagram representation of our algorithms", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 47 + } + ], + "index": 43.75 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "us to show the ability of Learned Count-Min to generalize and detect heavy items unseen in the", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "training set. We repeat the evaluation where we replace Count-Min (CM) with Count-Sketch (CS)", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 477, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 395, + 117 + ], + "score": 1.0, + "content": "and the corresponding variants. We use validation data to select the best", + "type": "text" + }, + { + "bbox": [ + 396, + 105, + 402, + 114 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 105, + 477, + 117 + ], + "score": 1.0, + "content": "for all algorithms.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 505, + 212 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Training a Heavy Hitter Oracle. We construct the heavy hitter oracle by training a neural network", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 135, + 504, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 135, + 504, + 145 + ], + "score": 1.0, + "content": "to predict the heaviness of an item. Note that the prediction of the network is not the final estimation.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 145, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 105, + 145, + 505, + 158 + ], + "score": 1.0, + "content": "It is used in Algorithm 1 to decide whether to assign an item to a unique bucket. We train the network", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 157, + 505, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 505, + 169 + ], + "score": 1.0, + "content": "to predict the item counts (or the log of the counts) and minimize the squared loss of the prediction.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 168, + 504, + 179 + ], + "spans": [ + { + "bbox": [ + 106, + 168, + 504, + 179 + ], + "score": 1.0, + "content": "Empirically, we found that when the counts of heavy items are few orders of magnitude larger than", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 178, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 505, + 191 + ], + "score": 1.0, + "content": "the average counts (as is the case for the Internet traffic data set), predicting the log of the counts", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 190, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 505, + 201 + ], + "score": 1.0, + "content": "leads to more stable training and better results. Once the model is trained, we select the optimal", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 200, + 492, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 492, + 212 + ], + "score": 1.0, + "content": "cutoff threshold using validation data, and use the model as the oracle described in Algorithm 1.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 6.5 + }, + { + "type": "title", + "bbox": [ + 108, + 217, + 267, + 228 + ], + "lines": [ + { + "bbox": [ + 106, + 217, + 267, + 229 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 267, + 229 + ], + "score": 1.0, + "content": "5.1. INTERNET TRAFFIC ESTIMATION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 234, + 503, + 279 + ], + "lines": [ + { + "bbox": [ + 105, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "For our first experiment, the goal is to estimate the number of packets for each network flow. A flow", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "is a sequence of packets between two machines on the Internet. It is identified by the IP addresses", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 256, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 505, + 269 + ], + "score": 1.0, + "content": "of its source and destination and the application ports. Estimating the size of each flow i – i.e., the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 267, + 469, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 194, + 279 + ], + "score": 1.0, + "content": "number of its packets", + "type": "text" + }, + { + "bbox": [ + 195, + 267, + 204, + 279 + ], + "score": 0.52, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 268, + 469, + 279 + ], + "score": 1.0, + "content": "– is a basic task in network management (Sivaraman et al., 2017).", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 107, + 286, + 400, + 363 + ], + "lines": [ + { + "bbox": [ + 106, + 286, + 401, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 401, + 298 + ], + "score": 1.0, + "content": "Dataset: The traffic data is collected at a backbone link of a Tier1 ISP", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 296, + 401, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 401, + 309 + ], + "score": 1.0, + "content": "between Chicago and Seattle in 2016 (CAIDA). Each recording session is", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 308, + 401, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 401, + 320 + ], + "score": 1.0, + "content": "around one hour. Within each minute, there are around 30 million packets", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 319, + 401, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 401, + 330 + ], + "score": 1.0, + "content": "and 1 million unique flows. For a recording session, we use the first 7", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 330, + 401, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 401, + 342 + ], + "score": 1.0, + "content": "minutes for training, the following minute for validation, and estimate the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 340, + 401, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 401, + 353 + ], + "score": 1.0, + "content": "packet counts in subsequent minutes. The distribution of packet counts", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 352, + 341, + 364 + ], + "spans": [ + { + "bbox": [ + 106, + 352, + 341, + 364 + ], + "score": 1.0, + "content": "over Internet flows is heavy tailed, as shown in Figure 5.1.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19 + }, + { + "type": "image", + "bbox": [ + 408, + 290, + 504, + 382 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 408, + 290, + 504, + 382 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 408, + 290, + 504, + 382 + ], + "spans": [ + { + "bbox": [ + 408, + 290, + 504, + 382 + ], + "score": 0.959, + "type": "image", + "image_path": "b84b0ce8368f6022901baab3cb4d2dcb230dbf4255eca9de78b09e8231f0267a.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 408, + 290, + 504, + 336.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 408, + 336.0, + 504, + 382.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 410, + 384, + 502, + 403 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 410, + 384, + 503, + 395 + ], + "spans": [ + { + "bbox": [ + 410, + 384, + 503, + 395 + ], + "score": 1.0, + "content": "Figure 5.1: Frequency of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 428, + 393, + 484, + 404 + ], + "spans": [ + { + "bbox": [ + 428, + 393, + 484, + 404 + ], + "score": 1.0, + "content": "Internet Flows", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.0 + } + ], + "index": 25.75 + }, + { + "type": "text", + "bbox": [ + 106, + 371, + 399, + 404 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 401, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 401, + 383 + ], + "score": 1.0, + "content": "Model: The patterns of the Internet traffic are very dynamic, i.e., the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 382, + 401, + 394 + ], + "spans": [ + { + "bbox": [ + 106, + 382, + 401, + 394 + ], + "score": 1.0, + "content": "flows with heavy traffic change frequently from one minute to the next.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 392, + 401, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 401, + 405 + ], + "score": 1.0, + "content": "However, we hypothesize that the space of IP addresses should be smooth", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 405, + 503, + 448 + ], + "lines": [ + { + "bbox": [ + 105, + 403, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 505, + 417 + ], + "score": 1.0, + "content": "in terms of traffic load. For example, data centers at large companies and university campuses", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 415, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 505, + 427 + ], + "score": 1.0, + "content": "with many students tend to generate heavy traffic. Thus, though the individual flows from these", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "sites change frequently, we could still discover regions of IP addresses with heavy traffic through a", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 437, + 183, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 183, + 450 + ], + "score": 1.0, + "content": "learning approach.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 453, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 106, + 453, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 506, + 466 + ], + "score": 1.0, + "content": "We trained a neural network to predict the log of the packet counts for each flow. The model takes", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 465, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 505, + 477 + ], + "score": 1.0, + "content": "as input the IP addresses and ports in each packet. We use two RNNs to encode the source and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 474, + 506, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 506, + 489 + ], + "score": 1.0, + "content": "destination IP addresses separately. The RNN takes one bit of the IP address at each step, starting", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "from the most significant bit. We use the final states of the RNN as the feature vector for an IP", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "address. The reason to use RNN is that the patterns in the bits are hierarchical, i.e., the more", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 509, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 505, + 521 + ], + "score": 1.0, + "content": "significant bits govern larger regions in the IP space. Additionally, we use two-layer fully-connected", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 519, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 506, + 532 + ], + "score": 1.0, + "content": "networks to encode the source and destination ports. We then concatenate the encoded IP vectors,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 529, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 506, + 543 + ], + "score": 1.0, + "content": "encoded port vectors, and the protocol type as the final features to predict the packet counts 3. The", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 540, + 478, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 478, + 554 + ], + "score": 1.0, + "content": "inference time takes 2.8 microseconds per item on a single GPU without any optimizations4.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 605 + ], + "lines": [ + { + "bbox": [ + 105, + 560, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 573 + ], + "score": 1.0, + "content": "Results: We plot the results of two representative test minutes (the 20th and 50th) in Figure 5.2. All", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 572, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 583 + ], + "score": 1.0, + "content": "plots in the figure refer to the estimation error (Equation 3.1) as a function of the used space. The", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 583, + 506, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 594 + ], + "score": 1.0, + "content": "space includes space for storing the buckets and the model. Since we use the same model for all test", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 594, + 398, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 398, + 605 + ], + "score": 1.0, + "content": "minutes, the model space is amortized over the 50-minute testing period.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5 + }, + { + "type": "text", + "bbox": [ + 106, + 610, + 505, + 654 + ], + "lines": [ + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "Figure 5.2 reveals multiple findings. First, the figure shows that our learning-based algorithms", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "exhibit a better performance than their non-learning counterparts. Specifically, Learned Count-Min,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 632, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 303, + 645 + ], + "score": 1.0, + "content": "compared to Count-Min, reduces the the error by", + "type": "text" + }, + { + "bbox": [ + 303, + 632, + 323, + 643 + ], + "score": 0.87, + "content": "32 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 632, + 379, + 645 + ], + "score": 1.0, + "content": "with space of", + "type": "text" + }, + { + "bbox": [ + 379, + 632, + 411, + 643 + ], + "score": 0.54, + "content": "0 . 5 \\mathrm { M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 632, + 428, + 645 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 429, + 632, + 448, + 643 + ], + "score": 0.86, + "content": "42 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 632, + 506, + 645 + ], + "score": 1.0, + "content": "with space of", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 643, + 504, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 484, + 656 + ], + "score": 1.0, + "content": "1.0 MB (Figure 5.2a). Learned Count-Sketch, compared to Count-Sketch, reduces the error by", + "type": "text" + }, + { + "bbox": [ + 484, + 643, + 504, + 654 + ], + "score": 0.85, + "content": "52 \\%", + "type": "inline_equation" + } + ], + "index": 50 + } + ], + "index": 48.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 2019", + "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" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 670, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 668, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 118, + 668, + 505, + 682 + ], + "score": 1.0, + "content": "3We use RNNs with 64 hidden units. The two-layer fully-connected networks for the ports have 16 and 8", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 680, + 361, + 692 + ], + "spans": [ + { + "bbox": [ + 105, + 680, + 361, + 692 + ], + "score": 1.0, + "content": "hidden units. The final layer before the prediction has 32 hidden units.", + "type": "text" + } + ] + }, + { + "bbox": [ + 117, + 690, + 505, + 703 + ], + "spans": [ + { + "bbox": [ + 117, + 690, + 505, + 703 + ], + "score": 1.0, + "content": "4Note that new specialized hardware such as Google TPU, hardware accelerators and network compres-", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 701, + 505, + 713 + ], + "spans": [ + { + "bbox": [ + 106, + 701, + 505, + 713 + ], + "score": 1.0, + "content": "sion (Han et al., 2017; Sze et al., 2017; Chen et al., 2017; Han et al., 2016; 2015) can drastically improve the", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 712, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 712, + 335, + 723 + ], + "score": 1.0, + "content": "inference time. Further, Nvidia has predicted that GPU will get", + "type": "text" + }, + { + "bbox": [ + 336, + 712, + 359, + 721 + ], + "score": 0.57, + "content": "1 0 0 0 \\mathrm { x }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 712, + 505, + 723 + ], + "score": 1.0, + "content": "faster by 2025. Because of these trends,", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 721, + 497, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 497, + 732 + ], + "score": 1.0, + "content": "the overhead of neural network inference is expected to be less significant in the future (Kraska et al., 2018).", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 83, + 505, + 117 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 505, + 212 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Training a Heavy Hitter Oracle. We construct the heavy hitter oracle by training a neural network", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 135, + 504, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 135, + 504, + 145 + ], + "score": 1.0, + "content": "to predict the heaviness of an item. Note that the prediction of the network is not the final estimation.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 145, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 105, + 145, + 505, + 158 + ], + "score": 1.0, + "content": "It is used in Algorithm 1 to decide whether to assign an item to a unique bucket. We train the network", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 157, + 505, + 169 + ], + "spans": [ + { + "bbox": [ + 105, + 157, + 505, + 169 + ], + "score": 1.0, + "content": "to predict the item counts (or the log of the counts) and minimize the squared loss of the prediction.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 168, + 504, + 179 + ], + "spans": [ + { + "bbox": [ + 106, + 168, + 504, + 179 + ], + "score": 1.0, + "content": "Empirically, we found that when the counts of heavy items are few orders of magnitude larger than", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 178, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 505, + 191 + ], + "score": 1.0, + "content": "the average counts (as is the case for the Internet traffic data set), predicting the log of the counts", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 190, + 505, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 190, + 505, + 201 + ], + "score": 1.0, + "content": "leads to more stable training and better results. Once the model is trained, we select the optimal", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 200, + 492, + 212 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 492, + 212 + ], + "score": 1.0, + "content": "cutoff threshold using validation data, and use the model as the oracle described in Algorithm 1.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 123, + 505, + 212 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 217, + 267, + 228 + ], + "lines": [ + { + "bbox": [ + 106, + 217, + 267, + 229 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 267, + 229 + ], + "score": 1.0, + "content": "5.1. INTERNET TRAFFIC ESTIMATION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 234, + 503, + 279 + ], + "lines": [ + { + "bbox": [ + 105, + 234, + 505, + 246 + ], + "spans": [ + { + "bbox": [ + 105, + 234, + 505, + 246 + ], + "score": 1.0, + "content": "For our first experiment, the goal is to estimate the number of packets for each network flow. A flow", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "is a sequence of packets between two machines on the Internet. It is identified by the IP addresses", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 256, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 505, + 269 + ], + "score": 1.0, + "content": "of its source and destination and the application ports. Estimating the size of each flow i – i.e., the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 267, + 469, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 194, + 279 + ], + "score": 1.0, + "content": "number of its packets", + "type": "text" + }, + { + "bbox": [ + 195, + 267, + 204, + 279 + ], + "score": 0.52, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 268, + 469, + 279 + ], + "score": 1.0, + "content": "– is a basic task in network management (Sivaraman et al., 2017).", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 234, + 505, + 279 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 286, + 400, + 363 + ], + "lines": [ + { + "bbox": [ + 106, + 286, + 401, + 298 + ], + "spans": [ + { + "bbox": [ + 106, + 286, + 401, + 298 + ], + "score": 1.0, + "content": "Dataset: The traffic data is collected at a backbone link of a Tier1 ISP", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 296, + 401, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 401, + 309 + ], + "score": 1.0, + "content": "between Chicago and Seattle in 2016 (CAIDA). Each recording session is", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 308, + 401, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 308, + 401, + 320 + ], + "score": 1.0, + "content": "around one hour. Within each minute, there are around 30 million packets", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 319, + 401, + 330 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 401, + 330 + ], + "score": 1.0, + "content": "and 1 million unique flows. For a recording session, we use the first 7", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 330, + 401, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 401, + 342 + ], + "score": 1.0, + "content": "minutes for training, the following minute for validation, and estimate the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 340, + 401, + 353 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 401, + 353 + ], + "score": 1.0, + "content": "packet counts in subsequent minutes. The distribution of packet counts", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 352, + 341, + 364 + ], + "spans": [ + { + "bbox": [ + 106, + 352, + 341, + 364 + ], + "score": 1.0, + "content": "over Internet flows is heavy tailed, as shown in Figure 5.1.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 286, + 401, + 364 + ] + }, + { + "type": "image", + "bbox": [ + 408, + 290, + 504, + 382 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 408, + 290, + 504, + 382 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 408, + 290, + 504, + 382 + ], + "spans": [ + { + "bbox": [ + 408, + 290, + 504, + 382 + ], + "score": 0.959, + "type": "image", + "image_path": "b84b0ce8368f6022901baab3cb4d2dcb230dbf4255eca9de78b09e8231f0267a.jpg" + } + ] + } + ], + "index": 23.5, + "virtual_lines": [ + { + "bbox": [ + 408, + 290, + 504, + 336.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 408, + 336.0, + 504, + 382.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 410, + 384, + 502, + 403 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 410, + 384, + 503, + 395 + ], + "spans": [ + { + "bbox": [ + 410, + 384, + 503, + 395 + ], + "score": 1.0, + "content": "Figure 5.1: Frequency of", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 428, + 393, + 484, + 404 + ], + "spans": [ + { + "bbox": [ + 428, + 393, + 484, + 404 + ], + "score": 1.0, + "content": "Internet Flows", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.0 + } + ], + "index": 25.75 + }, + { + "type": "text", + "bbox": [ + 106, + 371, + 399, + 404 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 401, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 401, + 383 + ], + "score": 1.0, + "content": "Model: The patterns of the Internet traffic are very dynamic, i.e., the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 382, + 401, + 394 + ], + "spans": [ + { + "bbox": [ + 106, + 382, + 401, + 394 + ], + "score": 1.0, + "content": "flows with heavy traffic change frequently from one minute to the next.", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 392, + 401, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 401, + 405 + ], + "score": 1.0, + "content": "However, we hypothesize that the space of IP addresses should be smooth", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 403, + 505, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 505, + 417 + ], + "score": 1.0, + "content": "in terms of traffic load. For example, data centers at large companies and university campuses", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 415, + 505, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 505, + 427 + ], + "score": 1.0, + "content": "with many students tend to generate heavy traffic. Thus, though the individual flows from these", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "sites change frequently, we could still discover regions of IP addresses with heavy traffic through a", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 437, + 183, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 183, + 450 + ], + "score": 1.0, + "content": "learning approach.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 370, + 401, + 405 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 405, + 503, + 448 + ], + "lines": [], + "index": 31.5, + "bbox_fs": [ + 105, + 403, + 505, + 450 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 453, + 505, + 552 + ], + "lines": [ + { + "bbox": [ + 106, + 453, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 506, + 466 + ], + "score": 1.0, + "content": "We trained a neural network to predict the log of the packet counts for each flow. The model takes", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 465, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 505, + 477 + ], + "score": 1.0, + "content": "as input the IP addresses and ports in each packet. We use two RNNs to encode the source and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 474, + 506, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 506, + 489 + ], + "score": 1.0, + "content": "destination IP addresses separately. The RNN takes one bit of the IP address at each step, starting", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "from the most significant bit. We use the final states of the RNN as the feature vector for an IP", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 506, + 510 + ], + "score": 1.0, + "content": "address. The reason to use RNN is that the patterns in the bits are hierarchical, i.e., the more", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 509, + 505, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 505, + 521 + ], + "score": 1.0, + "content": "significant bits govern larger regions in the IP space. Additionally, we use two-layer fully-connected", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 519, + 506, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 506, + 532 + ], + "score": 1.0, + "content": "networks to encode the source and destination ports. We then concatenate the encoded IP vectors,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 529, + 506, + 543 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 506, + 543 + ], + "score": 1.0, + "content": "encoded port vectors, and the protocol type as the final features to predict the packet counts 3. The", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 540, + 478, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 478, + 554 + ], + "score": 1.0, + "content": "inference time takes 2.8 microseconds per item on a single GPU without any optimizations4.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 38, + "bbox_fs": [ + 105, + 453, + 506, + 554 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 605 + ], + "lines": [ + { + "bbox": [ + 105, + 560, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 573 + ], + "score": 1.0, + "content": "Results: We plot the results of two representative test minutes (the 20th and 50th) in Figure 5.2. All", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 572, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 583 + ], + "score": 1.0, + "content": "plots in the figure refer to the estimation error (Equation 3.1) as a function of the used space. The", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 583, + 506, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 506, + 594 + ], + "score": 1.0, + "content": "space includes space for storing the buckets and the model. Since we use the same model for all test", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 594, + 398, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 398, + 605 + ], + "score": 1.0, + "content": "minutes, the model space is amortized over the 50-minute testing period.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 560, + 506, + 605 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 610, + 505, + 654 + ], + "lines": [ + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 505, + 623 + ], + "score": 1.0, + "content": "Figure 5.2 reveals multiple findings. First, the figure shows that our learning-based algorithms", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "exhibit a better performance than their non-learning counterparts. Specifically, Learned Count-Min,", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 632, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 303, + 645 + ], + "score": 1.0, + "content": "compared to Count-Min, reduces the the error by", + "type": "text" + }, + { + "bbox": [ + 303, + 632, + 323, + 643 + ], + "score": 0.87, + "content": "32 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 632, + 379, + 645 + ], + "score": 1.0, + "content": "with space of", + "type": "text" + }, + { + "bbox": [ + 379, + 632, + 411, + 643 + ], + "score": 0.54, + "content": "0 . 5 \\mathrm { M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 632, + 428, + 645 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 429, + 632, + 448, + 643 + ], + "score": 0.86, + "content": "42 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 632, + 506, + 645 + ], + "score": 1.0, + "content": "with space of", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 643, + 504, + 656 + ], + "spans": [ + { + "bbox": [ + 106, + 643, + 484, + 656 + ], + "score": 1.0, + "content": "1.0 MB (Figure 5.2a). Learned Count-Sketch, compared to Count-Sketch, reduces the error by", + "type": "text" + }, + { + "bbox": [ + 484, + 643, + 504, + 654 + ], + "score": 0.85, + "content": "52 \\%", + "type": "inline_equation" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 375, + 504, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 116, + 387 + ], + "score": 1.0, + "content": "at", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 116, + 375, + 148, + 386 + ], + "score": 0.66, + "content": "0 . 5 \\mathrm { M B }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 149, + 375, + 166, + 387 + ], + "score": 1.0, + "content": "and", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 166, + 375, + 186, + 386 + ], + "score": 0.88, + "content": "57 \\%", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 186, + 375, + 196, + 387 + ], + "score": 1.0, + "content": "at", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 197, + 375, + 229, + 386 + ], + "score": 0.69, + "content": "1 . 0 \\mathrm { M B }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 229, + 375, + 504, + 387 + ], + "score": 1.0, + "content": "(Figure 5.2c). In our experiments, each regular bucket takes 4 bytes.", + "type": "text", + "cross_page": true + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 385, + 506, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 506, + 398 + ], + "score": 1.0, + "content": "For the learned versions, we account for the extra space needed for the unique buckets to store the", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 396, + 488, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 488, + 409 + ], + "score": 1.0, + "content": "item IDs and the counts. One unique bucket takes 8 bytes, twice the space of a normal bucket.5", + "type": "text", + "cross_page": true + } + ], + "index": 7 + } + ], + "index": 48.5, + "bbox_fs": [ + 105, + 610, + 506, + 656 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 147, + 80, + 463, + 345 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 147, + 80, + 463, + 345 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 147, + 80, + 463, + 345 + ], + "spans": [ + { + "bbox": [ + 147, + 80, + 463, + 345 + ], + "score": 0.968, + "type": "image", + "image_path": "31362a49cb96f873e0865d27e2c41b0fdbaa09351ba6398012285fa04ea9cdf5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 147, + 80, + 463, + 168.33333333333331 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 147, + 168.33333333333331, + 463, + 256.66666666666663 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 147, + 256.66666666666663, + 463, + 344.99999999999994 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 127, + 344, + 477, + 356 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 344, + 469, + 356 + ], + "spans": [ + { + "bbox": [ + 141, + 344, + 469, + 356 + ], + "score": 1.0, + "content": "(c) Learned Count-Sketch - 20th test minute (d) Learned Count-Sketch - 50th test minute", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "image_caption", + "bbox": [ + 111, + 358, + 501, + 369 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 356, + 503, + 371 + ], + "spans": [ + { + "bbox": [ + 109, + 356, + 503, + 371 + ], + "score": 1.0, + "content": "Figure 5.2: Comparison of our algorithms with Count-Min and Count-Sketch on Internet traffic data.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 375, + 504, + 408 + ], + "lines": [ + { + "bbox": [ + 105, + 375, + 504, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 116, + 387 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 116, + 375, + 148, + 386 + ], + "score": 0.66, + "content": "0 . 5 \\mathrm { M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 375, + 166, + 387 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 166, + 375, + 186, + 386 + ], + "score": 0.88, + "content": "57 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 375, + 196, + 387 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 197, + 375, + 229, + 386 + ], + "score": 0.69, + "content": "1 . 0 \\mathrm { M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 375, + 504, + 387 + ], + "score": 1.0, + "content": "(Figure 5.2c). In our experiments, each regular bucket takes 4 bytes.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 385, + 506, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 506, + 398 + ], + "score": 1.0, + "content": "For the learned versions, we account for the extra space needed for the unique buckets to store the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 396, + 488, + 409 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 488, + 409 + ], + "score": 1.0, + "content": "item IDs and the counts. One unique bucket takes 8 bytes, twice the space of a normal bucket.5", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 414, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 106, + 414, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 426 + ], + "score": 1.0, + "content": "Second, the figure also shows that our neural-network oracle performs better than memorizing the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "heavy hitters in a lookup table. This is likely due to the dynamic nature of Internet traffic –i.e.,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 435, + 506, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 449 + ], + "score": 1.0, + "content": "the heavy flows in the training set are significantly different from those in the test data. Hence,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "memorization does not work well. On the other hand, our model is able to extract structures in the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 458, + 268, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 458, + 268, + 470 + ], + "score": 1.0, + "content": "input that generalize to unseen test data.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 475, + 505, + 507 + ], + "lines": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "Third, the figure shows that our model’s performance stays roughly the same from the 20th to the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "50th minute (Figure 5.2b and Figure 5.2d), showing that it learns properties of the heavy items that", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 497, + 193, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 193, + 508 + ], + "score": 1.0, + "content": "generalize over time.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 513, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "score": 1.0, + "content": "Lastly, although we achieve significant improvement over Count-Min and Count-Sketch, our scheme", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 525, + 505, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 505, + 537 + ], + "score": 1.0, + "content": "can potentially achieve even better results with an ideal oracle, as shown by the dashed green line in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 535, + 477, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 535, + 477, + 549 + ], + "score": 1.0, + "content": "Figure 5.2. This indicates potential gains from further optimizing the neural network model.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "title", + "bbox": [ + 108, + 552, + 253, + 564 + ], + "lines": [ + { + "bbox": [ + 106, + 552, + 254, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 254, + 565 + ], + "score": 1.0, + "content": "5.2. SEARCH QUERY ESTIMATION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 569, + 399, + 592 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 402, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 402, + 582 + ], + "score": 1.0, + "content": "For our second experiment, the goal is to estimate the number of times a", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 581, + 195, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 195, + 593 + ], + "score": 1.0, + "content": "search query appears.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 107, + 599, + 400, + 687 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 401, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 401, + 612 + ], + "score": 1.0, + "content": "Dataset: We use the AOL query log dataset, which consists of 21 million", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 610, + 401, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 401, + 622 + ], + "score": 1.0, + "content": "search queries collected from 650 thousand users over 90 days. The users", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 622, + 401, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 401, + 633 + ], + "score": 1.0, + "content": "are anonymized in the dataset. There are 3.8 million unique queries. Each", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 632, + 401, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 401, + 645 + ], + "score": 1.0, + "content": "query is a search phrase with multiple words (e.g., “periodic table element", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 643, + 401, + 656 + ], + "spans": [ + { + "bbox": [ + 104, + 643, + 401, + 656 + ], + "score": 1.0, + "content": "poster”). We use the first 5 days for training, the following day for valida-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 653, + 401, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 653, + 401, + 667 + ], + "score": 1.0, + "content": "tion, and estimate the number of times different search queries appear in", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 665, + 400, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 400, + 678 + ], + "score": 1.0, + "content": "subsequent days. The distribution of search query frequency follows the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 676, + 249, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 249, + 689 + ], + "score": 1.0, + "content": "Zipfian law, as shown in Figure 5.3", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 26.5 + }, + { + "type": "image", + "bbox": [ + 408, + 573, + 504, + 667 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 408, + 573, + 504, + 667 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 408, + 573, + 504, + 667 + ], + "spans": [ + { + "bbox": [ + 408, + 573, + 504, + 667 + ], + "score": 0.952, + "type": "image", + "image_path": "20e2bd33e1890ca9b86c1ffbbb65404bf01275ae33a787b13fc82565319f8a2e.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 408, + 573, + 504, + 620.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 408, + 620.0, + 504, + 667.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 410, + 669, + 503, + 689 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 410, + 668, + 504, + 680 + ], + "spans": [ + { + "bbox": [ + 410, + 668, + 504, + 680 + ], + "score": 1.0, + "content": "Figure 5.3: Frequency of", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 429, + 678, + 484, + 690 + ], + "spans": [ + { + "bbox": [ + 429, + 678, + 484, + 690 + ], + "score": 1.0, + "content": "search queries", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + } + ], + "index": 29.0 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 701, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 117, + 699, + 506, + 714 + ], + "spans": [ + { + "bbox": [ + 117, + 699, + 387, + 714 + ], + "score": 1.0, + "content": "5By using hashing with open addressing, it suffices to store IDs hashed into", + "type": "text" + }, + { + "bbox": [ + 388, + 702, + 426, + 712 + ], + "score": 0.68, + "content": "\\log { B _ { r } + t }", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 699, + 506, + 714 + ], + "score": 1.0, + "content": "bits (instead of whole", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 711, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 711, + 295, + 723 + ], + "score": 1.0, + "content": "IDs) to ensure there is no collision with probability", + "type": "text" + }, + { + "bbox": [ + 295, + 711, + 326, + 721 + ], + "score": 0.88, + "content": "1 - 2 ^ { - t }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 711, + 331, + 723 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 331, + 712, + 372, + 722 + ], + "score": 0.84, + "content": "\\log B _ { r } + t", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 711, + 505, + 723 + ], + "score": 1.0, + "content": "is comparable to the number of bits", + "type": "text" + } + ] + }, + { + "bbox": [ + 105, + 721, + 405, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 405, + 733 + ], + "score": 1.0, + "content": "per counter, so the space for a unique bucket is twice the space of a normal bucket.", + "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 2019", + "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": "image", + "bbox": [ + 147, + 80, + 463, + 345 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 147, + 80, + 463, + 345 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 147, + 80, + 463, + 345 + ], + "spans": [ + { + "bbox": [ + 147, + 80, + 463, + 345 + ], + "score": 0.968, + "type": "image", + "image_path": "31362a49cb96f873e0865d27e2c41b0fdbaa09351ba6398012285fa04ea9cdf5.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 147, + 80, + 463, + 168.33333333333331 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 147, + 168.33333333333331, + 463, + 256.66666666666663 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 147, + 256.66666666666663, + 463, + 344.99999999999994 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 127, + 344, + 477, + 356 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 141, + 344, + 469, + 356 + ], + "spans": [ + { + "bbox": [ + 141, + 344, + 469, + 356 + ], + "score": 1.0, + "content": "(c) Learned Count-Sketch - 20th test minute (d) Learned Count-Sketch - 50th test minute", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "image_caption", + "bbox": [ + 111, + 358, + 501, + 369 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 356, + 503, + 371 + ], + "spans": [ + { + "bbox": [ + 109, + 356, + 503, + 371 + ], + "score": 1.0, + "content": "Figure 5.2: Comparison of our algorithms with Count-Min and Count-Sketch on Internet traffic data.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 375, + 504, + 408 + ], + "lines": [], + "index": 6, + "bbox_fs": [ + 105, + 375, + 506, + 409 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 414, + 505, + 469 + ], + "lines": [ + { + "bbox": [ + 106, + 414, + 505, + 426 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 426 + ], + "score": 1.0, + "content": "Second, the figure also shows that our neural-network oracle performs better than memorizing the", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "heavy hitters in a lookup table. This is likely due to the dynamic nature of Internet traffic –i.e.,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 435, + 506, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 506, + 449 + ], + "score": 1.0, + "content": "the heavy flows in the training set are significantly different from those in the test data. Hence,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 505, + 459 + ], + "score": 1.0, + "content": "memorization does not work well. On the other hand, our model is able to extract structures in the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 458, + 268, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 458, + 268, + 470 + ], + "score": 1.0, + "content": "input that generalize to unseen test data.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 414, + 506, + 470 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 475, + 505, + 507 + ], + "lines": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "Third, the figure shows that our model’s performance stays roughly the same from the 20th to the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "50th minute (Figure 5.2b and Figure 5.2d), showing that it learns properties of the heavy items that", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 497, + 193, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 193, + 508 + ], + "score": 1.0, + "content": "generalize over time.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 475, + 505, + 508 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 513, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "score": 1.0, + "content": "Lastly, although we achieve significant improvement over Count-Min and Count-Sketch, our scheme", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 525, + 505, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 525, + 505, + 537 + ], + "score": 1.0, + "content": "can potentially achieve even better results with an ideal oracle, as shown by the dashed green line in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 535, + 477, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 535, + 477, + 549 + ], + "score": 1.0, + "content": "Figure 5.2. This indicates potential gains from further optimizing the neural network model.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 513, + 505, + 549 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 552, + 253, + 564 + ], + "lines": [ + { + "bbox": [ + 106, + 552, + 254, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 254, + 565 + ], + "score": 1.0, + "content": "5.2. SEARCH QUERY ESTIMATION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 569, + 399, + 592 + ], + "lines": [ + { + "bbox": [ + 105, + 568, + 402, + 582 + ], + "spans": [ + { + "bbox": [ + 105, + 568, + 402, + 582 + ], + "score": 1.0, + "content": "For our second experiment, the goal is to estimate the number of times a", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 581, + 195, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 195, + 593 + ], + "score": 1.0, + "content": "search query appears.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 568, + 402, + 593 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 599, + 400, + 687 + ], + "lines": [ + { + "bbox": [ + 105, + 599, + 401, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 401, + 612 + ], + "score": 1.0, + "content": "Dataset: We use the AOL query log dataset, which consists of 21 million", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 610, + 401, + 622 + ], + "spans": [ + { + "bbox": [ + 105, + 610, + 401, + 622 + ], + "score": 1.0, + "content": "search queries collected from 650 thousand users over 90 days. The users", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 622, + 401, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 401, + 633 + ], + "score": 1.0, + "content": "are anonymized in the dataset. There are 3.8 million unique queries. Each", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 632, + 401, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 632, + 401, + 645 + ], + "score": 1.0, + "content": "query is a search phrase with multiple words (e.g., “periodic table element", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 643, + 401, + 656 + ], + "spans": [ + { + "bbox": [ + 104, + 643, + 401, + 656 + ], + "score": 1.0, + "content": "poster”). We use the first 5 days for training, the following day for valida-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 653, + 401, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 653, + 401, + 667 + ], + "score": 1.0, + "content": "tion, and estimate the number of times different search queries appear in", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 665, + 400, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 665, + 400, + 678 + ], + "score": 1.0, + "content": "subsequent days. The distribution of search query frequency follows the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 676, + 249, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 676, + 249, + 689 + ], + "score": 1.0, + "content": "Zipfian law, as shown in Figure 5.3", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 26.5, + "bbox_fs": [ + 104, + 599, + 401, + 689 + ] + }, + { + "type": "image", + "bbox": [ + 408, + 573, + 504, + 667 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 408, + 573, + 504, + 667 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 408, + 573, + 504, + 667 + ], + "spans": [ + { + "bbox": [ + 408, + 573, + 504, + 667 + ], + "score": 0.952, + "type": "image", + "image_path": "20e2bd33e1890ca9b86c1ffbbb65404bf01275ae33a787b13fc82565319f8a2e.jpg" + } + ] + } + ], + "index": 25.5, + "virtual_lines": [ + { + "bbox": [ + 408, + 573, + 504, + 620.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 408, + 620.0, + 504, + 667.0 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 410, + 669, + 503, + 689 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 410, + 668, + 504, + 680 + ], + "spans": [ + { + "bbox": [ + 410, + 668, + 504, + 680 + ], + "score": 1.0, + "content": "Figure 5.3: Frequency of", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 429, + 678, + 484, + 690 + ], + "spans": [ + { + "bbox": [ + 429, + 678, + 484, + 690 + ], + "score": 1.0, + "content": "search queries", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + } + ], + "index": 29.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 106, + 79, + 505, + 198 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 79, + 505, + 198 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 79, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 505, + 198 + ], + "score": 0.97, + "type": "image", + "image_path": "a37a40112838b97af1ac8400a471270b5b3284f5b83e68a8a21a640b55508c1f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 79, + 505, + 118.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 118.66666666666666, + 505, + 158.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 158.33333333333331, + 505, + 197.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 199, + 502, + 211 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 197, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 213 + ], + "score": 1.0, + "content": "Figure 5.4: Comparison of our algorithms with Count-Min and Count-Sketch on search query data.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 106, + 217, + 505, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 216, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 505, + 230 + ], + "score": 1.0, + "content": "Model: Unlike traffic data, popular search queries tend to appear more consistently across multiple", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 227, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 505, + 241 + ], + "score": 1.0, + "content": "days. For example, “google” is the most popular search phrase in most of the days in the dataset.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 238, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 238, + 505, + 252 + ], + "score": 1.0, + "content": "Simply storing the most popular words can easily construct a reasonable heavy hitter predictor.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "However, beyond remembering the popular words, other factors also contribute to the popularity of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 261, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 506, + 273 + ], + "score": 1.0, + "content": "a search phrase that we can learn. For example, popular search phrases appearing in slightly different", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 272, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 272, + 505, + 284 + ], + "score": 1.0, + "content": "forms may be related to similar topics. Though not included in the AOL dataset, in general, metadata", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 282, + 481, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 481, + 295 + ], + "score": 1.0, + "content": "of a search query (e.g., the location of the search) can provide useful context of its popularity.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 299, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 106, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "To construct the heavy hitter oracle, we trained a neural network to predict the number of times", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 311, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 506, + 322 + ], + "score": 1.0, + "content": "a search phrase appears. To process the search phrase, we train an RNN with LSTM cells that", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 320, + 507, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 507, + 335 + ], + "score": 1.0, + "content": "takes characters of a search phrase as input. The final states encoded by the RNN are fed to a", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 333, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 506, + 345 + ], + "score": 1.0, + "content": "fully-connected layer to predict the query frequency. Our character vocabulary includes lower-case", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 342, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 506, + 357 + ], + "score": 1.0, + "content": "English alphabets, numbers, punctuation marks, and a token for unknown characters. We map the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 354, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 363, + 366 + ], + "score": 1.0, + "content": "character IDs to embedding vectors before feeding them to the", + "type": "text" + }, + { + "bbox": [ + 363, + 354, + 390, + 365 + ], + "score": 0.33, + "content": "{ \\mathsf { R N N } } ^ { 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 354, + 505, + 366 + ], + "score": 1.0, + "content": ". We choose RNN due to its", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 365, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 505, + 379 + ], + "score": 1.0, + "content": "effectiveness in processing sequence data (Sutskever et al., 2014; Graves, 2013; Kraska et al., 2018).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 385, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "Results: We plot the estimation error vs. space for two representative test days (the 50th and 80th", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 396, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 505, + 407 + ], + "score": 1.0, + "content": "day) in Figure 5.4. As before, the space includes both the bucket space and the space used by the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 406, + 498, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 498, + 419 + ], + "score": 1.0, + "content": "model. The model space is amortized over the test days since the same model is used for all days.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 423, + 505, + 479 + ], + "lines": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "Similarly, our learned sketches outperforms their conventional counterparts. For Learned Count-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 433, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 311, + 447 + ], + "score": 1.0, + "content": "Min, compared to Count-Min, it reduces the loss by", + "type": "text" + }, + { + "bbox": [ + 311, + 434, + 330, + 445 + ], + "score": 0.86, + "content": "18 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 433, + 339, + 447 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 340, + 434, + 371, + 445 + ], + "score": 0.43, + "content": "0 . 5 \\mathrm { M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 433, + 387, + 447 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 388, + 434, + 407, + 444 + ], + "score": 0.87, + "content": "52 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 433, + 417, + 447 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 417, + 434, + 448, + 444 + ], + "score": 0.49, + "content": "1 . 0 \\mathrm { M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 433, + 505, + 447 + ], + "score": 1.0, + "content": "(Figure 5.4a).", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 444, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 422, + 458 + ], + "score": 1.0, + "content": "For Learned Count-Sketch, compared to Count-Sketch, it reduces the loss by", + "type": "text" + }, + { + "bbox": [ + 422, + 445, + 442, + 456 + ], + "score": 0.85, + "content": "24 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 444, + 453, + 458 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 454, + 445, + 486, + 456 + ], + "score": 0.46, + "content": "0 . 5 \\mathrm { \\bf M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 444, + 506, + 458 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 455, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 126, + 467 + ], + "score": 0.86, + "content": "71 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 455, + 138, + 469 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 138, + 456, + 170, + 467 + ], + "score": 0.33, + "content": "1 . 0 \\mathrm { { M B } }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 455, + 505, + 469 + ], + "score": 1.0, + "content": "(Figure 5.4c). Further, our algorithm performs similarly for the 50th and the 80th", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 467, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 505, + 480 + ], + "score": 1.0, + "content": "day (Figure 5.4b and Figure 5.4d), showing that the properties it learns generalize over a long period.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 483, + 505, + 539 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "The figures also show an interesting difference from the Internet traffic data: memorizing the heavy", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "score": 1.0, + "content": "hitters in a lookup table is quite effective in the low space region. This is likely because the search", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 506, + 506, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 506, + 519 + ], + "score": 1.0, + "content": "queries are less dynamic compared to Internet traffic (i.e., top queries in the training set are also", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 516, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 506, + 531 + ], + "score": 1.0, + "content": "popular on later days). However, as the algorithm is allowed more space, memorization becomes", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 527, + 154, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 154, + 540 + ], + "score": 1.0, + "content": "ineffective.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28 + }, + { + "type": "title", + "bbox": [ + 109, + 545, + 288, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 544, + 289, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 544, + 289, + 557 + ], + "score": 1.0, + "content": "5.3. ANALYZING HEAVY HITTER MODELS", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 562, + 300, + 694 + ], + "lines": [ + { + "bbox": [ + 106, + 561, + 300, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 300, + 573 + ], + "score": 1.0, + "content": "We analyze the accuracy of the neural network", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 573, + 300, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 300, + 585 + ], + "score": 1.0, + "content": "heavy hitter models to better understand the re-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 583, + 301, + 596 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 301, + 596 + ], + "score": 1.0, + "content": "sults on the two datasets. Specifically, we use", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 594, + 300, + 607 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 300, + 607 + ], + "score": 1.0, + "content": "the models to predict whether an item is a heavy", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 605, + 301, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 152, + 618 + ], + "score": 1.0, + "content": "hitter (top", + "type": "text" + }, + { + "bbox": [ + 152, + 606, + 167, + 616 + ], + "score": 0.83, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 605, + 301, + 618 + ], + "score": 1.0, + "content": "in counts) or not, and plot the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 615, + 301, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 301, + 628 + ], + "score": 1.0, + "content": "ROC curves in Figure 5.5. The figures show", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 627, + 301, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 301, + 639 + ], + "score": 1.0, + "content": "that the model for the Internet traffic data has", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 637, + 300, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 300, + 650 + ], + "score": 1.0, + "content": "learned to predict heavy items more effectively,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 649, + 301, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 301, + 661 + ], + "score": 1.0, + "content": "with an AUC score of 0.9. As for the model for", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 660, + 300, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 300, + 672 + ], + "score": 1.0, + "content": "search query data, the AUC score is 0.8. This", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 671, + 300, + 684 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 300, + 684 + ], + "score": 1.0, + "content": "also explains why we see larger improvements", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 682, + 281, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 281, + 694 + ], + "score": 1.0, + "content": "over non-learning algorithms in Figure 5.2.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 37.5 + }, + { + "type": "image", + "bbox": [ + 307, + 565, + 504, + 681 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 307, + 565, + 504, + 681 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 307, + 565, + 504, + 681 + ], + "spans": [ + { + "bbox": [ + 307, + 565, + 504, + 681 + ], + "score": 0.96, + "type": "image", + "image_path": "74f2bb356dc02917bd9b450512f6a7a2ae07a4b54d38462f30771d1570c79025.jpg" + } + ] + } + ], + "index": 47.5, + "virtual_lines": [ + { + "bbox": [ + 307, + 565, + 504, + 579.5 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 307, + 579.5, + 504, + 594.0 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 307, + 594.0, + 504, + 608.5 + ], + "spans": [], + "index": 46 + }, + { + "bbox": [ + 307, + 608.5, + 504, + 623.0 + ], + "spans": [], + "index": 47 + }, + { + "bbox": [ + 307, + 623.0, + 504, + 637.5 + ], + "spans": [], + "index": 48 + }, + { + "bbox": [ + 307, + 637.5, + 504, + 652.0 + ], + "spans": [], + "index": 49 + }, + { + "bbox": [ + 307, + 652.0, + 504, + 666.5 + ], + "spans": [], + "index": 50 + }, + { + "bbox": [ + 307, + 666.5, + 504, + 681.0 + ], + "spans": [], + "index": 51 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 312, + 684, + 500, + 696 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 311, + 684, + 501, + 696 + ], + "spans": [ + { + "bbox": [ + 311, + 684, + 501, + 696 + ], + "score": 1.0, + "content": "Figure 5.5: ROC curves of the learned models.", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 52 + } + ], + "index": 49.75 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 711, + 506, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 709, + 505, + 724 + ], + "spans": [ + { + "bbox": [ + 118, + 709, + 505, + 724 + ], + "score": 1.0, + "content": "6We use an embedding size of 64 dimensions, an RNN with 256 hidden units, and a fully-connected layer", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 721, + 185, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 185, + 732 + ], + "score": 1.0, + "content": "with 32 hidden units.", + "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 2019", + "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": [ + 106, + 79, + 505, + 198 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 79, + 505, + 198 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 79, + 505, + 198 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 505, + 198 + ], + "score": 0.97, + "type": "image", + "image_path": "a37a40112838b97af1ac8400a471270b5b3284f5b83e68a8a21a640b55508c1f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 79, + 505, + 118.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 118.66666666666666, + 505, + 158.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 158.33333333333331, + 505, + 197.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 199, + 502, + 211 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 197, + 505, + 213 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 213 + ], + "score": 1.0, + "content": "Figure 5.4: Comparison of our algorithms with Count-Min and Count-Sketch on search query data.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + } + ], + "index": 2.0 + }, + { + "type": "text", + "bbox": [ + 106, + 217, + 505, + 294 + ], + "lines": [ + { + "bbox": [ + 105, + 216, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 105, + 216, + 505, + 230 + ], + "score": 1.0, + "content": "Model: Unlike traffic data, popular search queries tend to appear more consistently across multiple", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 227, + 505, + 241 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 505, + 241 + ], + "score": 1.0, + "content": "days. For example, “google” is the most popular search phrase in most of the days in the dataset.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 238, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 105, + 238, + 505, + 252 + ], + "score": 1.0, + "content": "Simply storing the most popular words can easily construct a reasonable heavy hitter predictor.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "However, beyond remembering the popular words, other factors also contribute to the popularity of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 261, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 506, + 273 + ], + "score": 1.0, + "content": "a search phrase that we can learn. For example, popular search phrases appearing in slightly different", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 272, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 272, + 505, + 284 + ], + "score": 1.0, + "content": "forms may be related to similar topics. Though not included in the AOL dataset, in general, metadata", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 282, + 481, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 481, + 295 + ], + "score": 1.0, + "content": "of a search query (e.g., the location of the search) can provide useful context of its popularity.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 216, + 506, + 295 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 299, + 505, + 377 + ], + "lines": [ + { + "bbox": [ + 106, + 299, + 505, + 312 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 312 + ], + "score": 1.0, + "content": "To construct the heavy hitter oracle, we trained a neural network to predict the number of times", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 311, + 506, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 311, + 506, + 322 + ], + "score": 1.0, + "content": "a search phrase appears. To process the search phrase, we train an RNN with LSTM cells that", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 320, + 507, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 320, + 507, + 335 + ], + "score": 1.0, + "content": "takes characters of a search phrase as input. The final states encoded by the RNN are fed to a", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 333, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 506, + 345 + ], + "score": 1.0, + "content": "fully-connected layer to predict the query frequency. Our character vocabulary includes lower-case", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 342, + 506, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 342, + 506, + 357 + ], + "score": 1.0, + "content": "English alphabets, numbers, punctuation marks, and a token for unknown characters. We map the", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 354, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 354, + 363, + 366 + ], + "score": 1.0, + "content": "character IDs to embedding vectors before feeding them to the", + "type": "text" + }, + { + "bbox": [ + 363, + 354, + 390, + 365 + ], + "score": 0.33, + "content": "{ \\mathsf { R N N } } ^ { 6 }", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 354, + 505, + 366 + ], + "score": 1.0, + "content": ". We choose RNN due to its", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 365, + 505, + 379 + ], + "spans": [ + { + "bbox": [ + 105, + 365, + 505, + 379 + ], + "score": 1.0, + "content": "effectiveness in processing sequence data (Sutskever et al., 2014; Graves, 2013; Kraska et al., 2018).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 299, + 507, + 379 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 385, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "Results: We plot the estimation error vs. space for two representative test days (the 50th and 80th", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 396, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 505, + 407 + ], + "score": 1.0, + "content": "day) in Figure 5.4. As before, the space includes both the bucket space and the space used by the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 406, + 498, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 498, + 419 + ], + "score": 1.0, + "content": "model. The model space is amortized over the test days since the same model is used for all days.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 384, + 505, + 419 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 423, + 505, + 479 + ], + "lines": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 423, + 505, + 435 + ], + "score": 1.0, + "content": "Similarly, our learned sketches outperforms their conventional counterparts. For Learned Count-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 433, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 311, + 447 + ], + "score": 1.0, + "content": "Min, compared to Count-Min, it reduces the loss by", + "type": "text" + }, + { + "bbox": [ + 311, + 434, + 330, + 445 + ], + "score": 0.86, + "content": "18 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 433, + 339, + 447 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 340, + 434, + 371, + 445 + ], + "score": 0.43, + "content": "0 . 5 \\mathrm { M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 433, + 387, + 447 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 388, + 434, + 407, + 444 + ], + "score": 0.87, + "content": "52 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 433, + 417, + 447 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 417, + 434, + 448, + 444 + ], + "score": 0.49, + "content": "1 . 0 \\mathrm { M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 433, + 505, + 447 + ], + "score": 1.0, + "content": "(Figure 5.4a).", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 444, + 506, + 458 + ], + "spans": [ + { + "bbox": [ + 105, + 444, + 422, + 458 + ], + "score": 1.0, + "content": "For Learned Count-Sketch, compared to Count-Sketch, it reduces the loss by", + "type": "text" + }, + { + "bbox": [ + 422, + 445, + 442, + 456 + ], + "score": 0.85, + "content": "24 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 444, + 453, + 458 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 454, + 445, + 486, + 456 + ], + "score": 0.46, + "content": "0 . 5 \\mathrm { \\bf M B }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 444, + 506, + 458 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 455, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 126, + 467 + ], + "score": 0.86, + "content": "71 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 127, + 455, + 138, + 469 + ], + "score": 1.0, + "content": "at", + "type": "text" + }, + { + "bbox": [ + 138, + 456, + 170, + 467 + ], + "score": 0.33, + "content": "1 . 0 \\mathrm { { M B } }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 455, + 505, + 469 + ], + "score": 1.0, + "content": "(Figure 5.4c). Further, our algorithm performs similarly for the 50th and the 80th", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 467, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 505, + 480 + ], + "score": 1.0, + "content": "day (Figure 5.4b and Figure 5.4d), showing that the properties it learns generalize over a long period.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 423, + 506, + 480 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 483, + 505, + 539 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "The figures also show an interesting difference from the Internet traffic data: memorizing the heavy", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 505, + 507 + ], + "score": 1.0, + "content": "hitters in a lookup table is quite effective in the low space region. This is likely because the search", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 506, + 506, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 506, + 519 + ], + "score": 1.0, + "content": "queries are less dynamic compared to Internet traffic (i.e., top queries in the training set are also", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 516, + 506, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 506, + 531 + ], + "score": 1.0, + "content": "popular on later days). However, as the algorithm is allowed more space, memorization becomes", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 527, + 154, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 154, + 540 + ], + "score": 1.0, + "content": "ineffective.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 483, + 506, + 540 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 545, + 288, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 544, + 289, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 544, + 289, + 557 + ], + "score": 1.0, + "content": "5.3. ANALYZING HEAVY HITTER MODELS", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 107, + 562, + 300, + 694 + ], + "lines": [ + { + "bbox": [ + 106, + 561, + 300, + 573 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 300, + 573 + ], + "score": 1.0, + "content": "We analyze the accuracy of the neural network", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 573, + 300, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 300, + 585 + ], + "score": 1.0, + "content": "heavy hitter models to better understand the re-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 583, + 301, + 596 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 301, + 596 + ], + "score": 1.0, + "content": "sults on the two datasets. Specifically, we use", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 594, + 300, + 607 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 300, + 607 + ], + "score": 1.0, + "content": "the models to predict whether an item is a heavy", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 605, + 301, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 152, + 618 + ], + "score": 1.0, + "content": "hitter (top", + "type": "text" + }, + { + "bbox": [ + 152, + 606, + 167, + 616 + ], + "score": 0.83, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 605, + 301, + 618 + ], + "score": 1.0, + "content": "in counts) or not, and plot the", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 615, + 301, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 301, + 628 + ], + "score": 1.0, + "content": "ROC curves in Figure 5.5. The figures show", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 627, + 301, + 639 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 301, + 639 + ], + "score": 1.0, + "content": "that the model for the Internet traffic data has", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 637, + 300, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 300, + 650 + ], + "score": 1.0, + "content": "learned to predict heavy items more effectively,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 649, + 301, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 301, + 661 + ], + "score": 1.0, + "content": "with an AUC score of 0.9. As for the model for", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 660, + 300, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 300, + 672 + ], + "score": 1.0, + "content": "search query data, the AUC score is 0.8. This", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 671, + 300, + 684 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 300, + 684 + ], + "score": 1.0, + "content": "also explains why we see larger improvements", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 682, + 281, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 281, + 694 + ], + "score": 1.0, + "content": "over non-learning algorithms in Figure 5.2.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 37.5, + "bbox_fs": [ + 105, + 561, + 301, + 694 + ] + }, + { + "type": "image", + "bbox": [ + 307, + 565, + 504, + 681 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 307, + 565, + 504, + 681 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 307, + 565, + 504, + 681 + ], + "spans": [ + { + "bbox": [ + 307, + 565, + 504, + 681 + ], + "score": 0.96, + "type": "image", + "image_path": "74f2bb356dc02917bd9b450512f6a7a2ae07a4b54d38462f30771d1570c79025.jpg" + } + ] + } + ], + "index": 47.5, + "virtual_lines": [ + { + "bbox": [ + 307, + 565, + 504, + 579.5 + ], + "spans": [], + "index": 44 + }, + { + "bbox": [ + 307, + 579.5, + 504, + 594.0 + ], + "spans": [], + "index": 45 + }, + { + "bbox": [ + 307, + 594.0, + 504, + 608.5 + ], + "spans": [], + "index": 46 + }, + { + "bbox": [ + 307, + 608.5, + 504, + 623.0 + ], + "spans": [], + "index": 47 + }, + { + "bbox": [ + 307, + 623.0, + 504, + 637.5 + ], + "spans": [], + "index": 48 + }, + { + "bbox": [ + 307, + 637.5, + 504, + 652.0 + ], + "spans": [], + "index": 49 + }, + { + "bbox": [ + 307, + 652.0, + 504, + 666.5 + ], + "spans": [], + "index": 50 + }, + { + "bbox": [ + 307, + 666.5, + 504, + 681.0 + ], + "spans": [], + "index": 51 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 312, + 684, + 500, + 696 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 311, + 684, + 501, + 696 + ], + "spans": [ + { + "bbox": [ + 311, + 684, + 501, + 696 + ], + "score": 1.0, + "content": "Figure 5.5: ROC curves of the learned models.", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 52 + } + ], + "index": 49.75 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 81, + 307, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 79, + 308, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 308, + 96 + ], + "score": 1.0, + "content": "6. EMBEDDING SPACE VISUALIZATION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 505, + 167 + ], + "lines": [ + { + "bbox": [ + 106, + 101, + 505, + 112 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 505, + 112 + ], + "score": 1.0, + "content": "In this section, we visualize the embedding spaces learned by our heavy hitter models to shed light", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 112, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 505, + 123 + ], + "score": 1.0, + "content": "on the properties or structures the models learned. Specifically, we take the neural network acti-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 120, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 506, + 136 + ], + "score": 1.0, + "content": "vations before the final fully-connected layer, and visualize them in a 2-dimensional space using", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 478, + 146 + ], + "score": 1.0, + "content": "t-SNE (Maaten & Hinton, 2008). To illustrate the differences between heavy hitters (top", + "type": "text" + }, + { + "bbox": [ + 478, + 133, + 493, + 144 + ], + "score": 0.83, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 132, + 505, + 146 + ], + "score": 1.0, + "content": "i n", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 505, + 157 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 157 + ], + "score": 1.0, + "content": "counts) and the rest (“light” items), we randomly sample an equal amount of examples from both", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 495, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 495, + 168 + ], + "score": 1.0, + "content": "classes. We visualize the embedding space for both the Internet traffic and search query datasets.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 172, + 505, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 172, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 505, + 184 + ], + "score": 1.0, + "content": "We show the embedding space learned by the model on the Internet traffic data in Figure 6.1. Each", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 183, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 506, + 196 + ], + "score": 1.0, + "content": "point in the scatter plot represents one Internet traffic flow. By coloring each flow with its number", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 194, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 505, + 207 + ], + "score": 1.0, + "content": "of packets in Figure 6.1a, we see that the model separate flows with more packets (green and yellow", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 205, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 505, + 217 + ], + "score": 1.0, + "content": "clusters) from flows with fewer packets (blue clusters). To understand what structure the model", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 215, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 505, + 228 + ], + "score": 1.0, + "content": "learns to separate these flows, we color each flow with its destination IP address in Figure 6.1b.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 506, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 506, + 239 + ], + "score": 1.0, + "content": "We found that clusters with more packets are often formed by flows sharing similar destination", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 238, + 506, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 506, + 251 + ], + "score": 1.0, + "content": "address prefixes. Interestingly, the model learns to group flows with similar IP prefixes closer in", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "score": 1.0, + "content": "the embedding space. For example, the dark blue cluster at the upper left of Figure 6.1b shares", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 258, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 104, + 258, + 506, + 273 + ], + "score": 1.0, + "content": "a destination IP address prefix “1.96.*.*”. Learning this “structure” from the Internet traffic data", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 270, + 378, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 378, + 284 + ], + "score": 1.0, + "content": "allows the model to generalize to packets unseen in the training set.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5 + }, + { + "type": "image", + "bbox": [ + 124, + 290, + 489, + 430 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 124, + 290, + 489, + 430 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 124, + 290, + 489, + 430 + ], + "spans": [ + { + "bbox": [ + 124, + 290, + 489, + 430 + ], + "score": 0.965, + "type": "image", + "image_path": "cde0a5c924361a411fcb25b50a80e7b22ba2585568bfe5b2749b8e6ca6968c11.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 124, + 290, + 489, + 336.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 124, + 336.6666666666667, + 489, + 383.33333333333337 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 124, + 383.33333333333337, + 489, + 430.00000000000006 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 435, + 503, + 458 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "Figure 6.1: Visualization of the embedding space learned by our model on the Internet traffic data.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 447, + 340, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 340, + 459 + ], + "score": 1.0, + "content": "Each point in the scatter plot represents one network flow.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + } + ], + "index": 19.25 + }, + { + "type": "text", + "bbox": [ + 106, + 462, + 505, + 540 + ], + "lines": [ + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "We show the embedding space learned by the model on the search query data in Figure 6.2. Each", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "point in the scatter plot represents one search query. Similarly, the model learns to separate frequent", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 485, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 505, + 497 + ], + "score": 1.0, + "content": "search queries from the rest in Figure 6.2a. By coloring the queries with the number of characters", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 496, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 505, + 508 + ], + "score": 1.0, + "content": "in Figure 6.2b, we have multiple interesting findings. First, queries with similar length are closer in", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 507, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 505, + 519 + ], + "score": 1.0, + "content": "the embedding space, and the y-axis forms the dimension representing query length. Second, if we", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 517, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 506, + 530 + ], + "score": 1.0, + "content": "simply use the query length to predict heavy hitters, many light queries will be misclassified. The", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 528, + 432, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 432, + 541 + ], + "score": 1.0, + "content": "model must have learned other structures to separate heavy hitters in Figure 6.2a.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25 + }, + { + "type": "image", + "bbox": [ + 124, + 547, + 489, + 691 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 124, + 547, + 489, + 691 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 124, + 547, + 489, + 691 + ], + "spans": [ + { + "bbox": [ + 124, + 547, + 489, + 691 + ], + "score": 0.971, + "type": "image", + "image_path": "07d5243c1460961e52df4412b6854f5658eec23fe6e39fb94b87ee8abf5b7f8f.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 124, + 547, + 489, + 595.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 124, + 595.0, + 489, + 643.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 124, + 643.0, + 489, + 691.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 696, + 504, + 719 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 695, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 505, + 709 + ], + "score": 1.0, + "content": "Figure 6.2: Visualization of the embedding space learned by our model on the search query data.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 706, + 338, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 706, + 338, + 721 + ], + "score": 1.0, + "content": "Each point in the scatter plot represents one search query.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + } + ], + "index": 31.25 + } + ], + "page_idx": 8, + "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 2019", + "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": [ + 106, + 81, + 307, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 79, + 308, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 308, + 96 + ], + "score": 1.0, + "content": "6. EMBEDDING SPACE VISUALIZATION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 505, + 167 + ], + "lines": [ + { + "bbox": [ + 106, + 101, + 505, + 112 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 505, + 112 + ], + "score": 1.0, + "content": "In this section, we visualize the embedding spaces learned by our heavy hitter models to shed light", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 112, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 505, + 123 + ], + "score": 1.0, + "content": "on the properties or structures the models learned. Specifically, we take the neural network acti-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 120, + 506, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 120, + 506, + 136 + ], + "score": 1.0, + "content": "vations before the final fully-connected layer, and visualize them in a 2-dimensional space using", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 478, + 146 + ], + "score": 1.0, + "content": "t-SNE (Maaten & Hinton, 2008). To illustrate the differences between heavy hitters (top", + "type": "text" + }, + { + "bbox": [ + 478, + 133, + 493, + 144 + ], + "score": 0.83, + "content": "1 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 132, + 505, + 146 + ], + "score": 1.0, + "content": "i n", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 505, + 157 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 505, + 157 + ], + "score": 1.0, + "content": "counts) and the rest (“light” items), we randomly sample an equal amount of examples from both", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 495, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 495, + 168 + ], + "score": 1.0, + "content": "classes. We visualize the embedding space for both the Internet traffic and search query datasets.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 101, + 506, + 168 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 172, + 505, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 172, + 505, + 184 + ], + "spans": [ + { + "bbox": [ + 106, + 172, + 505, + 184 + ], + "score": 1.0, + "content": "We show the embedding space learned by the model on the Internet traffic data in Figure 6.1. Each", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 183, + 506, + 196 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 506, + 196 + ], + "score": 1.0, + "content": "point in the scatter plot represents one Internet traffic flow. By coloring each flow with its number", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 194, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 194, + 505, + 207 + ], + "score": 1.0, + "content": "of packets in Figure 6.1a, we see that the model separate flows with more packets (green and yellow", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 205, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 505, + 217 + ], + "score": 1.0, + "content": "clusters) from flows with fewer packets (blue clusters). To understand what structure the model", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 215, + 505, + 228 + ], + "spans": [ + { + "bbox": [ + 105, + 215, + 505, + 228 + ], + "score": 1.0, + "content": "learns to separate these flows, we color each flow with its destination IP address in Figure 6.1b.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 226, + 506, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 226, + 506, + 239 + ], + "score": 1.0, + "content": "We found that clusters with more packets are often formed by flows sharing similar destination", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 238, + 506, + 251 + ], + "spans": [ + { + "bbox": [ + 106, + 238, + 506, + 251 + ], + "score": 1.0, + "content": "address prefixes. Interestingly, the model learns to group flows with similar IP prefixes closer in", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "spans": [ + { + "bbox": [ + 105, + 249, + 505, + 262 + ], + "score": 1.0, + "content": "the embedding space. For example, the dark blue cluster at the upper left of Figure 6.1b shares", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 258, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 104, + 258, + 506, + 273 + ], + "score": 1.0, + "content": "a destination IP address prefix “1.96.*.*”. Learning this “structure” from the Internet traffic data", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 270, + 378, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 378, + 284 + ], + "score": 1.0, + "content": "allows the model to generalize to packets unseen in the training set.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5, + "bbox_fs": [ + 104, + 172, + 506, + 284 + ] + }, + { + "type": "image", + "bbox": [ + 124, + 290, + 489, + 430 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 124, + 290, + 489, + 430 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 124, + 290, + 489, + 430 + ], + "spans": [ + { + "bbox": [ + 124, + 290, + 489, + 430 + ], + "score": 0.965, + "type": "image", + "image_path": "cde0a5c924361a411fcb25b50a80e7b22ba2585568bfe5b2749b8e6ca6968c11.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 124, + 290, + 489, + 336.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 124, + 336.6666666666667, + 489, + 383.33333333333337 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 124, + 383.33333333333337, + 489, + 430.00000000000006 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 435, + 503, + 458 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "Figure 6.1: Visualization of the embedding space learned by our model on the Internet traffic data.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 447, + 340, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 447, + 340, + 459 + ], + "score": 1.0, + "content": "Each point in the scatter plot represents one network flow.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + } + ], + "index": 19.25 + }, + { + "type": "text", + "bbox": [ + 106, + 462, + 505, + 540 + ], + "lines": [ + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 505, + 475 + ], + "score": 1.0, + "content": "We show the embedding space learned by the model on the search query data in Figure 6.2. Each", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "point in the scatter plot represents one search query. Similarly, the model learns to separate frequent", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 485, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 505, + 497 + ], + "score": 1.0, + "content": "search queries from the rest in Figure 6.2a. By coloring the queries with the number of characters", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 496, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 496, + 505, + 508 + ], + "score": 1.0, + "content": "in Figure 6.2b, we have multiple interesting findings. First, queries with similar length are closer in", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 507, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 505, + 519 + ], + "score": 1.0, + "content": "the embedding space, and the y-axis forms the dimension representing query length. Second, if we", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 517, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 506, + 530 + ], + "score": 1.0, + "content": "simply use the query length to predict heavy hitters, many light queries will be misclassified. The", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 528, + 432, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 432, + 541 + ], + "score": 1.0, + "content": "model must have learned other structures to separate heavy hitters in Figure 6.2a.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 462, + 506, + 541 + ] + }, + { + "type": "image", + "bbox": [ + 124, + 547, + 489, + 691 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 124, + 547, + 489, + 691 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 124, + 547, + 489, + 691 + ], + "spans": [ + { + "bbox": [ + 124, + 547, + 489, + 691 + ], + "score": 0.971, + "type": "image", + "image_path": "07d5243c1460961e52df4412b6854f5658eec23fe6e39fb94b87ee8abf5b7f8f.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 124, + 547, + 489, + 595.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 124, + 595.0, + 489, + 643.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 124, + 643.0, + 489, + 691.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 696, + 504, + 719 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 695, + 505, + 709 + ], + "spans": [ + { + "bbox": [ + 105, + 695, + 505, + 709 + ], + "score": 1.0, + "content": "Figure 6.2: Visualization of the embedding space learned by our model on the search query data.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 706, + 338, + 721 + ], + "spans": [ + { + "bbox": [ + 105, + 706, + 338, + 721 + ], + "score": 1.0, + "content": "Each point in the scatter plot represents one search query.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + } + ], + "index": 31.25 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 81, + 191, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 79, + 193, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 193, + 96 + ], + "score": 1.0, + "content": "7. CONCLUSION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 100, + 505, + 145 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 505, + 114 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 505, + 114 + ], + "score": 1.0, + "content": "We have presented a new approach for designing frequency estimation streaming algorithms by", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "augmenting them with a learning model that exploits data properties. We have demonstrated the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 506, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 135 + ], + "score": 1.0, + "content": "benefits of our design both analytically and empirically. We envision that our work will motivate a", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 133, + 456, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 133, + 456, + 146 + ], + "score": 1.0, + "content": "deeper integration of learning in algorithm design, leading to more efficient algorithms.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "title", + "bbox": [ + 107, + 156, + 239, + 168 + ], + "lines": [ + { + "bbox": [ + 107, + 156, + 240, + 170 + ], + "spans": [ + { + "bbox": [ + 107, + 156, + 240, + 170 + ], + "score": 1.0, + "content": "8. ACKNOWLEDGEMENTS", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 175, + 505, + 219 + ], + "lines": [ + { + "bbox": [ + 105, + 174, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 505, + 188 + ], + "score": 1.0, + "content": "The authors would like to thank the anonymous reviewers for helpful comments. The work was", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "score": 1.0, + "content": "partially supported by NSF TRIPODS award #1740751, NSF AITF award #1535851 and Simons", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 197, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 210 + ], + "score": 1.0, + "content": "Investigator Award. We also thank the various companies sponsoring the MIT Center for Wireless", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 207, + 245, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 245, + 222 + ], + "score": 1.0, + "content": "Networks and Mobile Computing.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5 + }, + { + "type": "title", + "bbox": [ + 107, + 231, + 176, + 243 + ], + "lines": [ + { + "bbox": [ + 106, + 231, + 176, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 231, + 176, + 244 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 108, + 250, + 504, + 284 + ], + "lines": [ + { + "bbox": [ + 106, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "Amirali Aghazadeh, Ryan Spring, Daniel LeJeune, Gautam Dasarathy, Anshumali Shrivastava, and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 116, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Richard G Baraniuk. Mission: Ultra large-scale feature selection using count-sketches. In Inter-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 272, + 316, + 284 + ], + "spans": [ + { + "bbox": [ + 115, + 272, + 316, + 284 + ], + "score": 1.0, + "content": "national Conference on Machine Learning, 2018.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 289, + 505, + 313 + ], + "lines": [ + { + "bbox": [ + 105, + 290, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 505, + 303 + ], + "score": 1.0, + "content": "Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, and Ellen Vitercik. Learning to branch. In", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 301, + 336, + 313 + ], + "spans": [ + { + "bbox": [ + 115, + 301, + 336, + 313 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, 2018.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 109, + 319, + 503, + 353 + ], + "lines": [ + { + "bbox": [ + 106, + 319, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 505, + 333 + ], + "score": 1.0, + "content": "Luca Baldassarre, Yen-Huan Li, Jonathan Scarlett, Baran Gozc ¨ u, Ilija Bogunovic, and Volkan ¨", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 330, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 505, + 344 + ], + "score": 1.0, + "content": "Cevher. Learning-based compressive subsampling. IEEE Journal of Selected Topics in Signal", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 342, + 254, + 354 + ], + "spans": [ + { + "bbox": [ + 116, + 342, + 254, + 354 + ], + "score": 1.0, + "content": "Processing, 10(4):809–822, 2016.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 360, + 504, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 359, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 359, + 505, + 373 + ], + "score": 1.0, + "content": "Ashish Bora, Ajil Jalal, Eric Price, and Alexandros G Dimakis. Compressed sensing using genera-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 370, + 454, + 383 + ], + "spans": [ + { + "bbox": [ + 115, + 370, + 454, + 383 + ], + "score": 1.0, + "content": "tive models. In International Conference on Machine Learning, pp. 537–546, 2017.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 106, + 389, + 504, + 423 + ], + "lines": [ + { + "bbox": [ + 106, + 389, + 504, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 389, + 504, + 402 + ], + "score": 1.0, + "content": "Oscar Boykin, Avi Bryant, Edwin Chen, ellchow, Mike Gagnon, Moses Nakamura, Steven No-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 400, + 504, + 414 + ], + "spans": [ + { + "bbox": [ + 115, + 400, + 504, + 414 + ], + "score": 1.0, + "content": "ble, Sam Ritchie, Ashutosh Singhal, and Argyris Zymnis. Algebird. https://twitter.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 412, + 260, + 423 + ], + "spans": [ + { + "bbox": [ + 116, + 412, + 260, + 423 + ], + "score": 1.0, + "content": "github.io/algebird/, 2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 105, + 429, + 504, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 505, + 443 + ], + "score": 1.0, + "content": "CAIDA. Caida internet traces 2016 chicago. http://www.caida.org/data/monitors/passive-equinix-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 440, + 171, + 453 + ], + "spans": [ + { + "bbox": [ + 115, + 440, + 171, + 453 + ], + "score": 1.0, + "content": "chicago.xml.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 504, + 493 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "Emmanuel J Candes, Justin Romberg, and Terence Tao. Robust uncertainty principles: Exact signal `", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 471, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 115, + 471, + 505, + 483 + ], + "score": 1.0, + "content": "reconstruction from highly incomplete frequency information. IEEE Transactions on information", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 481, + 235, + 493 + ], + "spans": [ + { + "bbox": [ + 116, + 481, + 235, + 493 + ], + "score": 1.0, + "content": "theory, 52(2):489–509, 2006.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 499, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "score": 1.0, + "content": "Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 114, + 510, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 114, + 510, + 505, + 524 + ], + "score": 1.0, + "content": "In International Colloquium on Automata, Languages, and Programming, pp. 693–703. Springer,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 520, + 142, + 534 + ], + "spans": [ + { + "bbox": [ + 115, + 520, + 142, + 534 + ], + "score": 1.0, + "content": "2002.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 107, + 540, + 504, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 538, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 505, + 554 + ], + "score": 1.0, + "content": "Yu-Hsin Chen, Tushar Krishna, Joel S Emer, and Vivienne Sze. Eyeriss: An energy-efficient re-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 551, + 504, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 551, + 504, + 563 + ], + "score": 1.0, + "content": "configurable accelerator for deep convolutional neural networks. IEEE Journal of Solid-State", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 117, + 562, + 243, + 574 + ], + "spans": [ + { + "bbox": [ + 117, + 562, + 243, + 574 + ], + "score": 1.0, + "content": "Circuits, 52(1):127–138, 2017.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 580, + 503, + 604 + ], + "lines": [ + { + "bbox": [ + 106, + 579, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 505, + 594 + ], + "score": 1.0, + "content": "Graham Cormode and Marios Hadjieleftheriou. Finding frequent items in data streams. Proceedings", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 592, + 315, + 604 + ], + "spans": [ + { + "bbox": [ + 115, + 592, + 315, + 604 + ], + "score": 1.0, + "content": "of the VLDB Endowment, 1(2):1530–1541, 2008.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 108, + 609, + 503, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "score": 1.0, + "content": "Graham Cormode and S Muthukrishnan. Summarizing and mining skewed data streams. In Pro-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 620, + 502, + 633 + ], + "spans": [ + { + "bbox": [ + 115, + 620, + 502, + 633 + ], + "score": 1.0, + "content": "ceedings of the 2005 SIAM International Conference on Data Mining, pp. 44–55. SIAM, 2005a.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 639, + 503, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 653 + ], + "score": 1.0, + "content": "Graham Cormode and Shan Muthukrishnan. An improved data stream summary: the count-min", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 650, + 403, + 663 + ], + "spans": [ + { + "bbox": [ + 116, + 650, + 403, + 663 + ], + "score": 1.0, + "content": "sketch and its applications. Journal of Algorithms, 55(1):58–75, 2005b.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 106, + 668, + 503, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 667, + 504, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 504, + 682 + ], + "score": 1.0, + "content": "Hanjun Dai, Elias Khalil, Yuyu Zhang, Bistra Dilkina, and Le Song. Learning combinatorial op-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 679, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 505, + 694 + ], + "score": 1.0, + "content": "timization algorithms over graphs. In Advances in Neural Information Processing Systems, pp.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 117, + 691, + 191, + 703 + ], + "spans": [ + { + "bbox": [ + 117, + 691, + 191, + 703 + ], + "score": 1.0, + "content": "6351–6361, 2017.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Erik D Demaine, Alejandro Lopez-Ortiz, and J Ian Munro. Frequency estimation of internet packet ´", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "streams with limited space. In European Symposium on Algorithms, pp. 348–360. Springer, 2002.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5 + } + ], + "page_idx": 9, + "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 2019", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 301, + 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": "title", + "bbox": [ + 108, + 81, + 191, + 93 + ], + "lines": [ + { + "bbox": [ + 106, + 79, + 193, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 79, + 193, + 96 + ], + "score": 1.0, + "content": "7. CONCLUSION", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 107, + 100, + 505, + 145 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 505, + 114 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 505, + 114 + ], + "score": 1.0, + "content": "We have presented a new approach for designing frequency estimation streaming algorithms by", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "augmenting them with a learning model that exploits data properties. We have demonstrated the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 122, + 506, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 506, + 135 + ], + "score": 1.0, + "content": "benefits of our design both analytically and empirically. We envision that our work will motivate a", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 133, + 456, + 146 + ], + "spans": [ + { + "bbox": [ + 106, + 133, + 456, + 146 + ], + "score": 1.0, + "content": "deeper integration of learning in algorithm design, leading to more efficient algorithms.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 100, + 506, + 146 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 156, + 239, + 168 + ], + "lines": [ + { + "bbox": [ + 107, + 156, + 240, + 170 + ], + "spans": [ + { + "bbox": [ + 107, + 156, + 240, + 170 + ], + "score": 1.0, + "content": "8. ACKNOWLEDGEMENTS", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 175, + 505, + 219 + ], + "lines": [ + { + "bbox": [ + 105, + 174, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 174, + 505, + 188 + ], + "score": 1.0, + "content": "The authors would like to thank the anonymous reviewers for helpful comments. The work was", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "spans": [ + { + "bbox": [ + 105, + 186, + 505, + 199 + ], + "score": 1.0, + "content": "partially supported by NSF TRIPODS award #1740751, NSF AITF award #1535851 and Simons", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 197, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 505, + 210 + ], + "score": 1.0, + "content": "Investigator Award. We also thank the various companies sponsoring the MIT Center for Wireless", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 207, + 245, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 207, + 245, + 222 + ], + "score": 1.0, + "content": "Networks and Mobile Computing.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 174, + 505, + 222 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 231, + 176, + 243 + ], + "lines": [ + { + "bbox": [ + 106, + 231, + 176, + 244 + ], + "spans": [ + { + "bbox": [ + 106, + 231, + 176, + 244 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 108, + 250, + 504, + 284 + ], + "lines": [ + { + "bbox": [ + 106, + 249, + 506, + 263 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 506, + 263 + ], + "score": 1.0, + "content": "Amirali Aghazadeh, Ryan Spring, Daniel LeJeune, Gautam Dasarathy, Anshumali Shrivastava, and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 116, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Richard G Baraniuk. Mission: Ultra large-scale feature selection using count-sketches. In Inter-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 272, + 316, + 284 + ], + "spans": [ + { + "bbox": [ + 115, + 272, + 316, + 284 + ], + "score": 1.0, + "content": "national Conference on Machine Learning, 2018.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 249, + 506, + 284 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 289, + 505, + 313 + ], + "lines": [ + { + "bbox": [ + 105, + 290, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 290, + 505, + 303 + ], + "score": 1.0, + "content": "Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, and Ellen Vitercik. Learning to branch. In", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 301, + 336, + 313 + ], + "spans": [ + { + "bbox": [ + 115, + 301, + 336, + 313 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, 2018.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 290, + 505, + 313 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 319, + 503, + 353 + ], + "lines": [ + { + "bbox": [ + 106, + 319, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 106, + 319, + 505, + 333 + ], + "score": 1.0, + "content": "Luca Baldassarre, Yen-Huan Li, Jonathan Scarlett, Baran Gozc ¨ u, Ilija Bogunovic, and Volkan ¨", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 330, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 115, + 330, + 505, + 344 + ], + "score": 1.0, + "content": "Cevher. Learning-based compressive subsampling. IEEE Journal of Selected Topics in Signal", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 342, + 254, + 354 + ], + "spans": [ + { + "bbox": [ + 116, + 342, + 254, + 354 + ], + "score": 1.0, + "content": "Processing, 10(4):809–822, 2016.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 319, + 505, + 354 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 360, + 504, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 359, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 359, + 505, + 373 + ], + "score": 1.0, + "content": "Ashish Bora, Ajil Jalal, Eric Price, and Alexandros G Dimakis. Compressed sensing using genera-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 370, + 454, + 383 + ], + "spans": [ + { + "bbox": [ + 115, + 370, + 454, + 383 + ], + "score": 1.0, + "content": "tive models. In International Conference on Machine Learning, pp. 537–546, 2017.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 106, + 359, + 505, + 383 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 389, + 504, + 423 + ], + "lines": [ + { + "bbox": [ + 106, + 389, + 504, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 389, + 504, + 402 + ], + "score": 1.0, + "content": "Oscar Boykin, Avi Bryant, Edwin Chen, ellchow, Mike Gagnon, Moses Nakamura, Steven No-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 400, + 504, + 414 + ], + "spans": [ + { + "bbox": [ + 115, + 400, + 504, + 414 + ], + "score": 1.0, + "content": "ble, Sam Ritchie, Ashutosh Singhal, and Argyris Zymnis. Algebird. https://twitter.", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 116, + 412, + 260, + 423 + ], + "spans": [ + { + "bbox": [ + 116, + 412, + 260, + 423 + ], + "score": 1.0, + "content": "github.io/algebird/, 2016.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 389, + 504, + 423 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 429, + 504, + 453 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 505, + 443 + ], + "score": 1.0, + "content": "CAIDA. Caida internet traces 2016 chicago. http://www.caida.org/data/monitors/passive-equinix-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 440, + 171, + 453 + ], + "spans": [ + { + "bbox": [ + 115, + 440, + 171, + 453 + ], + "score": 1.0, + "content": "chicago.xml.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 429, + 505, + 453 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 459, + 504, + 493 + ], + "lines": [ + { + "bbox": [ + 106, + 459, + 505, + 472 + ], + "spans": [ + { + "bbox": [ + 106, + 459, + 505, + 472 + ], + "score": 1.0, + "content": "Emmanuel J Candes, Justin Romberg, and Terence Tao. Robust uncertainty principles: Exact signal `", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 471, + 505, + 483 + ], + "spans": [ + { + "bbox": [ + 115, + 471, + 505, + 483 + ], + "score": 1.0, + "content": "reconstruction from highly incomplete frequency information. IEEE Transactions on information", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 116, + 481, + 235, + 493 + ], + "spans": [ + { + "bbox": [ + 116, + 481, + 235, + 493 + ], + "score": 1.0, + "content": "theory, 52(2):489–509, 2006.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 459, + 505, + 493 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 499, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 505, + 513 + ], + "score": 1.0, + "content": "Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams.", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 114, + 510, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 114, + 510, + 505, + 524 + ], + "score": 1.0, + "content": "In International Colloquium on Automata, Languages, and Programming, pp. 693–703. Springer,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 520, + 142, + 534 + ], + "spans": [ + { + "bbox": [ + 115, + 520, + 142, + 534 + ], + "score": 1.0, + "content": "2002.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 105, + 499, + 505, + 534 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 540, + 504, + 574 + ], + "lines": [ + { + "bbox": [ + 106, + 538, + 505, + 554 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 505, + 554 + ], + "score": 1.0, + "content": "Yu-Hsin Chen, Tushar Krishna, Joel S Emer, and Vivienne Sze. Eyeriss: An energy-efficient re-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 551, + 504, + 563 + ], + "spans": [ + { + "bbox": [ + 116, + 551, + 504, + 563 + ], + "score": 1.0, + "content": "configurable accelerator for deep convolutional neural networks. IEEE Journal of Solid-State", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 117, + 562, + 243, + 574 + ], + "spans": [ + { + "bbox": [ + 117, + 562, + 243, + 574 + ], + "score": 1.0, + "content": "Circuits, 52(1):127–138, 2017.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 106, + 538, + 505, + 574 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 580, + 503, + 604 + ], + "lines": [ + { + "bbox": [ + 106, + 579, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 505, + 594 + ], + "score": 1.0, + "content": "Graham Cormode and Marios Hadjieleftheriou. Finding frequent items in data streams. Proceedings", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 592, + 315, + 604 + ], + "spans": [ + { + "bbox": [ + 115, + 592, + 315, + 604 + ], + "score": 1.0, + "content": "of the VLDB Endowment, 1(2):1530–1541, 2008.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 106, + 579, + 505, + 604 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 609, + 503, + 633 + ], + "lines": [ + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 504, + 622 + ], + "score": 1.0, + "content": "Graham Cormode and S Muthukrishnan. Summarizing and mining skewed data streams. In Pro-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 620, + 502, + 633 + ], + "spans": [ + { + "bbox": [ + 115, + 620, + 502, + 633 + ], + "score": 1.0, + "content": "ceedings of the 2005 SIAM International Conference on Data Mining, pp. 44–55. SIAM, 2005a.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 106, + 610, + 504, + 633 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 639, + 503, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 639, + 505, + 653 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 505, + 653 + ], + "score": 1.0, + "content": "Graham Cormode and Shan Muthukrishnan. An improved data stream summary: the count-min", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 650, + 403, + 663 + ], + "spans": [ + { + "bbox": [ + 116, + 650, + 403, + 663 + ], + "score": 1.0, + "content": "sketch and its applications. Journal of Algorithms, 55(1):58–75, 2005b.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 639, + 505, + 663 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 668, + 503, + 703 + ], + "lines": [ + { + "bbox": [ + 105, + 667, + 504, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 667, + 504, + 682 + ], + "score": 1.0, + "content": "Hanjun Dai, Elias Khalil, Yuyu Zhang, Bistra Dilkina, and Le Song. Learning combinatorial op-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 679, + 505, + 694 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 505, + 694 + ], + "score": 1.0, + "content": "timization algorithms over graphs. In Advances in Neural Information Processing Systems, pp.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 117, + 691, + 191, + 703 + ], + "spans": [ + { + "bbox": [ + 117, + 691, + 191, + 703 + ], + "score": 1.0, + "content": "6351–6361, 2017.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 667, + 505, + 703 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Erik D Demaine, Alejandro Lopez-Ortiz, and J Ian Munro. Frequency estimation of internet packet ´", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "streams with limited space. In European Symposium on Algorithms, pp. 348–360. Springer, 2002.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5, + "bbox_fs": [ + 106, + 709, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "David L Donoho. Compressed sensing. IEEE Transactions on information theory, 52(4):1289–", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 117, + 93, + 166, + 105 + ], + "spans": [ + { + "bbox": [ + 117, + 93, + 166, + 105 + ], + "score": 1.0, + "content": "1306, 2006.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 108, + 112, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 112, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 505, + 125 + ], + "score": 1.0, + "content": "Fabon Dzogang, Thomas Lansdall-Welfare, Saatviga Sudhahar, and Nello Cristianini. Scalable", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 506, + 137 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 506, + 137 + ], + "score": 1.0, + "content": "preference learning from data streams. In Proceedings of the 24th International Conference on", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 117, + 135, + 294, + 147 + ], + "spans": [ + { + "bbox": [ + 117, + 135, + 294, + 147 + ], + "score": 1.0, + "content": "World Wide Web, pp. 885–890. ACM, 2015.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 154, + 506, + 187 + ], + "lines": [ + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "Cristian Estan and George Varghese. New directions in traffic measurement and accounting: Focus-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 165, + 504, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 165, + 504, + 177 + ], + "score": 1.0, + "content": "ing on the elephants, ignoring the mice. ACM Transactions on Computer Systems (TOCS), 21(3):", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 176, + 181, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 176, + 181, + 187 + ], + "score": 1.0, + "content": "270–313, 2003.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 504, + 218 + ], + "lines": [ + { + "bbox": [ + 106, + 194, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 194, + 505, + 208 + ], + "score": 1.0, + "content": "Anna Gilbert and Piotr Indyk. Sparse recovery using sparse matrices. Proceedings of the IEEE, 98", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 206, + 195, + 218 + ], + "spans": [ + { + "bbox": [ + 117, + 206, + 195, + 218 + ], + "score": 1.0, + "content": "(6):937–947, 2010.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 107, + 225, + 505, + 270 + ], + "lines": [ + { + "bbox": [ + 105, + 224, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 505, + 238 + ], + "score": 1.0, + "content": "Amit Goyal, Hal Daume III, and Graham Cormode. Sketch algorithms for estimating point queries ´", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 236, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 115, + 236, + 505, + 249 + ], + "score": 1.0, + "content": "in nlp. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Lan-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 248, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 115, + 248, + 505, + 260 + ], + "score": 1.0, + "content": "guage Processing and Computational Natural Language Learning, pp. 1093–1103. Association", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 258, + 267, + 271 + ], + "spans": [ + { + "bbox": [ + 115, + 258, + 267, + 271 + ], + "score": 1.0, + "content": "for Computational Linguistics, 2012.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 277, + 504, + 300 + ], + "lines": [ + { + "bbox": [ + 106, + 276, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 167, + 290 + ], + "score": 1.0, + "content": "Alex Graves.", + "type": "text" + }, + { + "bbox": [ + 181, + 276, + 428, + 291 + ], + "score": 1.0, + "content": "Generating sequences with recurrent neural networks.", + "type": "text" + }, + { + "bbox": [ + 438, + 277, + 506, + 291 + ], + "score": 1.0, + "content": "arXiv preprint", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 288, + 215, + 300 + ], + "spans": [ + { + "bbox": [ + 115, + 288, + 215, + 300 + ], + "score": 1.0, + "content": "arXiv:1308.0850, 2013.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 307, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 308, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 505, + 321 + ], + "score": 1.0, + "content": "Song Han, Huizi Mao, and William J Dally. Deep compression: Compressing deep neural networks", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 319, + 503, + 331 + ], + "spans": [ + { + "bbox": [ + 116, + 319, + 503, + 331 + ], + "score": 1.0, + "content": "with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149, 2015.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 338, + 505, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 339, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 505, + 351 + ], + "score": 1.0, + "content": "Song Han, Xingyu Liu, Huizi Mao, Jing Pu, Ardavan Pedram, Mark A Horowitz, and William J", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 348, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 115, + 348, + 505, + 362 + ], + "score": 1.0, + "content": "Dally. Eie: efficient inference engine on compressed deep neural network. In Computer Archi-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 361, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 115, + 361, + 505, + 372 + ], + "score": 1.0, + "content": "tecture (ISCA), 2016 ACM/IEEE 43rd Annual International Symposium on, pp. 243–254. IEEE,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 370, + 143, + 384 + ], + "spans": [ + { + "bbox": [ + 115, + 370, + 143, + 384 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 106, + 390, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 106, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "Song Han, Junlong Kang, Huizi Mao, Yiming Hu, Xin Li, Yubin Li, Dongliang Xie, Hong Luo,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 400, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 115, + 400, + 505, + 415 + ], + "score": 1.0, + "content": "Song Yao, Yu Wang, et al. Ese: Efficient speech recognition engine with sparse lstm on fpga.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 412, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 114, + 412, + 506, + 426 + ], + "score": 1.0, + "content": "In Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 424, + 246, + 435 + ], + "spans": [ + { + "bbox": [ + 115, + 424, + 246, + 435 + ], + "score": 1.0, + "content": "Arrays, pp. 75–84. ACM, 2017.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 442, + 503, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "He He, Hal Daume III, and Jason M Eisner. Learning to search in branch and bound algorithms. In", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 453, + 416, + 466 + ], + "spans": [ + { + "bbox": [ + 115, + 453, + 416, + 466 + ], + "score": 1.0, + "content": "Advances in neural information processing systems, pp. 3293–3301, 2014.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 106, + 472, + 503, + 496 + ], + "lines": [ + { + "bbox": [ + 105, + 472, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 505, + 486 + ], + "score": 1.0, + "content": "Herve Jegou, Matthijs Douze, and Cordelia Schmid. Product quantization for nearest neighbor", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 483, + 497, + 496 + ], + "spans": [ + { + "bbox": [ + 115, + 483, + 497, + 496 + ], + "score": 1.0, + "content": "search. IEEE transactions on pattern analysis and machine intelligence, 33(1):117–128, 2011.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 502, + 505, + 537 + ], + "lines": [ + { + "bbox": [ + 105, + 501, + 506, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 506, + 516 + ], + "score": 1.0, + "content": "Hossein Jowhari, Mert Saglam, and G ˘ abor Tardos. Tight bounds for lp samplers, finding duplicates ´", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 514, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 115, + 514, + 505, + 527 + ], + "score": 1.0, + "content": "in streams, and related problems. In Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 525, + 400, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 525, + 400, + 538 + ], + "score": 1.0, + "content": "symposium on Principles of database systems, pp. 49–58. ACM, 2011.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 544, + 506, + 578 + ], + "lines": [ + { + "bbox": [ + 105, + 543, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 506, + 558 + ], + "score": 1.0, + "content": "Richard M Karp, Scott Shenker, and Christos H Papadimitriou. A simple algorithm for finding", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 115, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "frequent elements in streams and bags. ACM Transactions on Database Systems (TODS), 28(1):", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 567, + 171, + 578 + ], + "spans": [ + { + "bbox": [ + 116, + 567, + 171, + 578 + ], + "score": 1.0, + "content": "51–55, 2003.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 585, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 585, + 505, + 598 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 505, + 598 + ], + "score": 1.0, + "content": "Tim Kraska, Alex Beutel, Ed H Chi, Jeffrey Dean, and Neoklis Polyzotis. The case for learned", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 596, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 115, + 596, + 505, + 610 + ], + "score": 1.0, + "content": "index structures. In Proceedings of the 2018 International Conference on Management of Data", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 608, + 273, + 619 + ], + "spans": [ + { + "bbox": [ + 116, + 608, + 273, + 619 + ], + "score": 1.0, + "content": "(SIGMOD), pp. 489–504. ACM, 2018.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 106, + 626, + 504, + 661 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "score": 1.0, + "content": "Abhishek Kumar, Minho Sung, Jun Jim Xu, and Jia Wang. Data streaming algorithms for efficient", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "and accurate estimation of flow size distribution. In ACM SIGMETRICS Performance Evaluation", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 649, + 304, + 661 + ], + "spans": [ + { + "bbox": [ + 116, + 649, + 304, + 661 + ], + "score": 1.0, + "content": "Review, volume 32, pp. 177–188. ACM, 2004.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 668, + 504, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "Zaoxing Liu, Antonis Manousis, Gregory Vorsanger, Vyas Sekar, and Vladimir Braverman. One", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 679, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 505, + 692 + ], + "score": 1.0, + "content": "sketch to rule them all: Rethinking network flow monitoring with univmon. In Proceedings of the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 689, + 368, + 703 + ], + "spans": [ + { + "bbox": [ + 115, + 689, + 368, + 703 + ], + "score": 1.0, + "content": "2016 ACM SIGCOMM Conference, pp. 101–114. ACM, 2016.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Thodoris Lykouris and Sergei Vassilvitskii. Competitive caching with machine learned advice. In", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 720, + 336, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 336, + 733 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, 2018.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5 + } + ], + "page_idx": 10, + "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 2019", + "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, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "David L Donoho. Compressed sensing. IEEE Transactions on information theory, 52(4):1289–", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 117, + 93, + 166, + 105 + ], + "spans": [ + { + "bbox": [ + 117, + 93, + 166, + 105 + ], + "score": 1.0, + "content": "1306, 2006.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 105 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 112, + 503, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 112, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 112, + 505, + 125 + ], + "score": 1.0, + "content": "Fabon Dzogang, Thomas Lansdall-Welfare, Saatviga Sudhahar, and Nello Cristianini. Scalable", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 123, + 506, + 137 + ], + "spans": [ + { + "bbox": [ + 115, + 123, + 506, + 137 + ], + "score": 1.0, + "content": "preference learning from data streams. In Proceedings of the 24th International Conference on", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 117, + 135, + 294, + 147 + ], + "spans": [ + { + "bbox": [ + 117, + 135, + 294, + 147 + ], + "score": 1.0, + "content": "World Wide Web, pp. 885–890. ACM, 2015.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 106, + 112, + 506, + 147 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 154, + 506, + 187 + ], + "lines": [ + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "Cristian Estan and George Varghese. New directions in traffic measurement and accounting: Focus-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 165, + 504, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 165, + 504, + 177 + ], + "score": 1.0, + "content": "ing on the elephants, ignoring the mice. ACM Transactions on Computer Systems (TOCS), 21(3):", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 176, + 181, + 187 + ], + "spans": [ + { + "bbox": [ + 116, + 176, + 181, + 187 + ], + "score": 1.0, + "content": "270–313, 2003.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 154, + 505, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 504, + 218 + ], + "lines": [ + { + "bbox": [ + 106, + 194, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 106, + 194, + 505, + 208 + ], + "score": 1.0, + "content": "Anna Gilbert and Piotr Indyk. Sparse recovery using sparse matrices. Proceedings of the IEEE, 98", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 206, + 195, + 218 + ], + "spans": [ + { + "bbox": [ + 117, + 206, + 195, + 218 + ], + "score": 1.0, + "content": "(6):937–947, 2010.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 194, + 505, + 218 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 225, + 505, + 270 + ], + "lines": [ + { + "bbox": [ + 105, + 224, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 224, + 505, + 238 + ], + "score": 1.0, + "content": "Amit Goyal, Hal Daume III, and Graham Cormode. Sketch algorithms for estimating point queries ´", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 236, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 115, + 236, + 505, + 249 + ], + "score": 1.0, + "content": "in nlp. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Lan-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 248, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 115, + 248, + 505, + 260 + ], + "score": 1.0, + "content": "guage Processing and Computational Natural Language Learning, pp. 1093–1103. Association", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 258, + 267, + 271 + ], + "spans": [ + { + "bbox": [ + 115, + 258, + 267, + 271 + ], + "score": 1.0, + "content": "for Computational Linguistics, 2012.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 224, + 505, + 271 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 277, + 504, + 300 + ], + "lines": [ + { + "bbox": [ + 106, + 276, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 276, + 167, + 290 + ], + "score": 1.0, + "content": "Alex Graves.", + "type": "text" + }, + { + "bbox": [ + 181, + 276, + 428, + 291 + ], + "score": 1.0, + "content": "Generating sequences with recurrent neural networks.", + "type": "text" + }, + { + "bbox": [ + 438, + 277, + 506, + 291 + ], + "score": 1.0, + "content": "arXiv preprint", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 115, + 288, + 215, + 300 + ], + "spans": [ + { + "bbox": [ + 115, + 288, + 215, + 300 + ], + "score": 1.0, + "content": "arXiv:1308.0850, 2013.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 106, + 276, + 506, + 300 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 307, + 505, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 308, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 308, + 505, + 321 + ], + "score": 1.0, + "content": "Song Han, Huizi Mao, and William J Dally. Deep compression: Compressing deep neural networks", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 319, + 503, + 331 + ], + "spans": [ + { + "bbox": [ + 116, + 319, + 503, + 331 + ], + "score": 1.0, + "content": "with pruning, trained quantization and huffman coding. arXiv preprint arXiv:1510.00149, 2015.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 106, + 308, + 505, + 331 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 338, + 505, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 339, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 505, + 351 + ], + "score": 1.0, + "content": "Song Han, Xingyu Liu, Huizi Mao, Jing Pu, Ardavan Pedram, Mark A Horowitz, and William J", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 348, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 115, + 348, + 505, + 362 + ], + "score": 1.0, + "content": "Dally. Eie: efficient inference engine on compressed deep neural network. In Computer Archi-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 361, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 115, + 361, + 505, + 372 + ], + "score": 1.0, + "content": "tecture (ISCA), 2016 ACM/IEEE 43rd Annual International Symposium on, pp. 243–254. IEEE,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 370, + 143, + 384 + ], + "spans": [ + { + "bbox": [ + 115, + 370, + 143, + 384 + ], + "score": 1.0, + "content": "2016.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 106, + 339, + 505, + 384 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 390, + 505, + 435 + ], + "lines": [ + { + "bbox": [ + 106, + 390, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 505, + 403 + ], + "score": 1.0, + "content": "Song Han, Junlong Kang, Huizi Mao, Yiming Hu, Xin Li, Yubin Li, Dongliang Xie, Hong Luo,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 400, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 115, + 400, + 505, + 415 + ], + "score": 1.0, + "content": "Song Yao, Yu Wang, et al. Ese: Efficient speech recognition engine with sparse lstm on fpga.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 412, + 506, + 426 + ], + "spans": [ + { + "bbox": [ + 114, + 412, + 506, + 426 + ], + "score": 1.0, + "content": "In Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 424, + 246, + 435 + ], + "spans": [ + { + "bbox": [ + 115, + 424, + 246, + 435 + ], + "score": 1.0, + "content": "Arrays, pp. 75–84. ACM, 2017.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5, + "bbox_fs": [ + 106, + 390, + 506, + 435 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 442, + 503, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 106, + 442, + 505, + 455 + ], + "score": 1.0, + "content": "He He, Hal Daume III, and Jason M Eisner. Learning to search in branch and bound algorithms. In", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 453, + 416, + 466 + ], + "spans": [ + { + "bbox": [ + 115, + 453, + 416, + 466 + ], + "score": 1.0, + "content": "Advances in neural information processing systems, pp. 3293–3301, 2014.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 442, + 505, + 466 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 472, + 503, + 496 + ], + "lines": [ + { + "bbox": [ + 105, + 472, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 505, + 486 + ], + "score": 1.0, + "content": "Herve Jegou, Matthijs Douze, and Cordelia Schmid. Product quantization for nearest neighbor", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 483, + 497, + 496 + ], + "spans": [ + { + "bbox": [ + 115, + 483, + 497, + 496 + ], + "score": 1.0, + "content": "search. IEEE transactions on pattern analysis and machine intelligence, 33(1):117–128, 2011.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 472, + 505, + 496 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 502, + 505, + 537 + ], + "lines": [ + { + "bbox": [ + 105, + 501, + 506, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 506, + 516 + ], + "score": 1.0, + "content": "Hossein Jowhari, Mert Saglam, and G ˘ abor Tardos. Tight bounds for lp samplers, finding duplicates ´", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 514, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 115, + 514, + 505, + 527 + ], + "score": 1.0, + "content": "in streams, and related problems. In Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 525, + 400, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 525, + 400, + 538 + ], + "score": 1.0, + "content": "symposium on Principles of database systems, pp. 49–58. ACM, 2011.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 501, + 506, + 538 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 544, + 506, + 578 + ], + "lines": [ + { + "bbox": [ + 105, + 543, + 506, + 558 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 506, + 558 + ], + "score": 1.0, + "content": "Richard M Karp, Scott Shenker, and Christos H Papadimitriou. A simple algorithm for finding", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 555, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 115, + 555, + 505, + 568 + ], + "score": 1.0, + "content": "frequent elements in streams and bags. ACM Transactions on Database Systems (TODS), 28(1):", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 567, + 171, + 578 + ], + "spans": [ + { + "bbox": [ + 116, + 567, + 171, + 578 + ], + "score": 1.0, + "content": "51–55, 2003.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 543, + 506, + 578 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 585, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 585, + 505, + 598 + ], + "spans": [ + { + "bbox": [ + 106, + 585, + 505, + 598 + ], + "score": 1.0, + "content": "Tim Kraska, Alex Beutel, Ed H Chi, Jeffrey Dean, and Neoklis Polyzotis. The case for learned", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 596, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 115, + 596, + 505, + 610 + ], + "score": 1.0, + "content": "index structures. In Proceedings of the 2018 International Conference on Management of Data", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 608, + 273, + 619 + ], + "spans": [ + { + "bbox": [ + 116, + 608, + 273, + 619 + ], + "score": 1.0, + "content": "(SIGMOD), pp. 489–504. ACM, 2018.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37, + "bbox_fs": [ + 106, + 585, + 505, + 619 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 626, + 504, + 661 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 506, + 640 + ], + "score": 1.0, + "content": "Abhishek Kumar, Minho Sung, Jun Jim Xu, and Jia Wang. Data streaming algorithms for efficient", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "and accurate estimation of flow size distribution. In ACM SIGMETRICS Performance Evaluation", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 649, + 304, + 661 + ], + "spans": [ + { + "bbox": [ + 116, + 649, + 304, + 661 + ], + "score": 1.0, + "content": "Review, volume 32, pp. 177–188. ACM, 2004.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 626, + 506, + 661 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 668, + 504, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "Zaoxing Liu, Antonis Manousis, Gregory Vorsanger, Vyas Sekar, and Vladimir Braverman. One", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 679, + 505, + 692 + ], + "spans": [ + { + "bbox": [ + 115, + 679, + 505, + 692 + ], + "score": 1.0, + "content": "sketch to rule them all: Rethinking network flow monitoring with univmon. In Proceedings of the", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 689, + 368, + 703 + ], + "spans": [ + { + "bbox": [ + 115, + 689, + 368, + 703 + ], + "score": 1.0, + "content": "2016 ACM SIGCOMM Conference, pp. 101–114. ACM, 2016.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 106, + 668, + 505, + 703 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Thodoris Lykouris and Sergei Vassilvitskii. Competitive caching with machine learned advice. In", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 720, + 336, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 336, + 733 + ], + "score": 1.0, + "content": "International Conference on Machine Learning, 2018.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45.5, + "bbox_fs": [ + 106, + 709, + 505, + 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": "Laurens van der Maaten and Geoffrey Hinton. Visualizing data using t-sne. Journal of machine", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 298, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 298, + 106 + ], + "score": 1.0, + "content": "learning research, 9(Nov):2579–2605, 2008.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 111, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Efficient computation of frequent and", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 124, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 116, + 124, + 505, + 136 + ], + "score": 1.0, + "content": "top-k elements in data streams. In International Conference on Database Theory, pp. 398–412.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 180, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 180, + 147 + ], + "score": 1.0, + "content": "Springer, 2005.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 107, + 153, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 152, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 152, + 506, + 167 + ], + "score": 1.0, + "content": "Gregory T Minton and Eric Price. Improved concentration bounds for count-sketch. In Proceedings", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 505, + 177 + ], + "score": 1.0, + "content": "of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 669–686. SIAM,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 114, + 174, + 143, + 187 + ], + "spans": [ + { + "bbox": [ + 114, + 174, + 143, + 187 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 193, + 504, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 208 + ], + "score": 1.0, + "content": "Jayadev Misra and David Gries. Finding repeated elements. Science of computer programming, 2", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 196, + 217 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 196, + 217 + ], + "score": 1.0, + "content": "(2):143–152, 1982.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 223, + 503, + 247 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "Michael Mitzenmacher. A model for learned bloom filters and optimizing by sandwiching. In", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 235, + 354, + 246 + ], + "spans": [ + { + "bbox": [ + 116, + 235, + 354, + 246 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems, 2018.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 505, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 253, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 267 + ], + "score": 1.0, + "content": "Ali Mousavi, Ankit B Patel, and Richard G Baraniuk. A deep learning approach to structured signal", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 264, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 115, + 264, + 505, + 277 + ], + "score": 1.0, + "content": "recovery. In Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 117, + 276, + 296, + 288 + ], + "spans": [ + { + "bbox": [ + 117, + 276, + 296, + 288 + ], + "score": 1.0, + "content": "Conference on, pp. 1336–1343. IEEE, 2015.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 504, + 317 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "score": 1.0, + "content": "Ali Mousavi, Gautam Dasarathy, and Richard G Baraniuk. Deepcodec: Adaptive sensing and re-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 306, + 471, + 318 + ], + "spans": [ + { + "bbox": [ + 116, + 306, + 471, + 318 + ], + "score": 1.0, + "content": "covery via deep convolutional neural networks. arXiv preprint arXiv:1707.03386, 2017.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 106, + 324, + 505, + 358 + ], + "lines": [ + { + "bbox": [ + 106, + 325, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 505, + 337 + ], + "score": 1.0, + "content": "Pratanu Roy, Arijit Khan, and Gustavo Alonso. Augmented sketch: Faster and more accurate stream", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 335, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 115, + 335, + 505, + 349 + ], + "score": 1.0, + "content": "processing. In Proceedings of the 2016 International Conference on Management of Data, pp.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 345, + 218, + 358 + ], + "spans": [ + { + "bbox": [ + 116, + 345, + 218, + 358 + ], + "score": 1.0, + "content": "1449–1463. ACM, 2016.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 105, + 365, + 504, + 388 + ], + "lines": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "score": 1.0, + "content": "Ruslan Salakhutdinov and Geoffrey Hinton. Semantic hashing. International Journal of Approxi-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 376, + 275, + 388 + ], + "spans": [ + { + "bbox": [ + 115, + 376, + 275, + 388 + ], + "score": 1.0, + "content": "mate Reasoning, 50(7):969–978, 2009.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 394, + 504, + 429 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 505, + 408 + ], + "score": 1.0, + "content": "Stuart Schechter, Cormac Herley, and Michael Mitzenmacher. Popularity is everything: A new", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 115, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "approach to protecting passwords from statistical-guessing attacks. In Proceedings of the 5th", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 117, + 417, + 453, + 430 + ], + "spans": [ + { + "bbox": [ + 117, + 417, + 453, + 430 + ], + "score": 1.0, + "content": "USENIX conference on Hot topics in security, pp. 1–8. USENIX Association, 2010.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 108, + 435, + 504, + 470 + ], + "lines": [ + { + "bbox": [ + 107, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 107, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S Muthukrishnan, and Jennifer", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 446, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 115, + 446, + 505, + 460 + ], + "score": 1.0, + "content": "Rexford. Heavy-hitter detection entirely in the data plane. In Proceedings of the Symposium on", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 457, + 287, + 470 + ], + "spans": [ + { + "bbox": [ + 116, + 457, + 287, + 470 + ], + "score": 1.0, + "content": "SDN Research, pp. 164–176. ACM, 2017.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 476, + 504, + 500 + ], + "lines": [ + { + "bbox": [ + 106, + 477, + 504, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 504, + 489 + ], + "score": 1.0, + "content": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to sequence learning with neural networks.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 487, + 427, + 501 + ], + "spans": [ + { + "bbox": [ + 115, + 487, + 427, + 501 + ], + "score": 1.0, + "content": "In Advances in neural information processing systems, pp. 3104–3112, 2014.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 504, + 530 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "Vivienne Sze, Yu-Hsin Chen, Tien-Ju Yang, and Joel S Emer. Efficient processing of deep neural", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 517, + 461, + 529 + ], + "spans": [ + { + "bbox": [ + 115, + 517, + 461, + 529 + ], + "score": 1.0, + "content": "networks: A tutorial and survey. Proceedings of the IEEE, 105(12):2295–2329, 2017.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 105, + 536, + 504, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 536, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 505, + 549 + ], + "score": 1.0, + "content": "Partha Talukdar and William Cohen. Scaling graph-based semi supervised learning to large number", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 547, + 488, + 560 + ], + "spans": [ + { + "bbox": [ + 116, + 547, + 488, + 560 + ], + "score": 1.0, + "content": "of labels using count-min sketch. In Artificial Intelligence and Statistics, pp. 940–947, 2014.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 105, + 566, + 505, + 589 + ], + "lines": [ + { + "bbox": [ + 105, + 565, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 506, + 579 + ], + "score": 1.0, + "content": "Jun Wang, Wei Liu, Sanjiv Kumar, and Shih-Fu Chang. Learning to hash for indexing big data - a", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 578, + 335, + 590 + ], + "spans": [ + { + "bbox": [ + 116, + 578, + 335, + 590 + ], + "score": 1.0, + "content": "survey. Proceedings of the IEEE, 104(1):34–57, 2016.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "score": 1.0, + "content": "Yair Weiss, Antonio Torralba, and Rob Fergus. Spectral hashing. In Advances in neural information", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 114, + 608, + 287, + 619 + ], + "spans": [ + { + "bbox": [ + 114, + 608, + 287, + 619 + ], + "score": 1.0, + "content": "processing systems, pp. 1753–1760, 2009.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 104, + 626, + 505, + 650 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 504, + 638 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 504, + 638 + ], + "score": 1.0, + "content": "Minlan Yu, Lavanya Jose, and Rui Miao. Software defined traffic measurement with opensketch. In", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 637, + 261, + 649 + ], + "spans": [ + { + "bbox": [ + 115, + 637, + 261, + 649 + ], + "score": 1.0, + "content": "NSDI, volume 13, pp. 29–42, 2013.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.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 2019", + "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": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Laurens van der Maaten and Geoffrey Hinton. Visualizing data using t-sne. Journal of machine", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 298, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 298, + 106 + ], + "score": 1.0, + "content": "learning research, 9(Nov):2579–2605, 2008.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 111, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 111, + 505, + 125 + ], + "spans": [ + { + "bbox": [ + 106, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Efficient computation of frequent and", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 124, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 116, + 124, + 505, + 136 + ], + "score": 1.0, + "content": "top-k elements in data streams. In International Conference on Database Theory, pp. 398–412.", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 180, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 180, + 147 + ], + "score": 1.0, + "content": "Springer, 2005.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 106, + 111, + 505, + 147 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 153, + 504, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 152, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 152, + 506, + 167 + ], + "score": 1.0, + "content": "Gregory T Minton and Eric Price. Improved concentration bounds for count-sketch. In Proceedings", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 505, + 177 + ], + "score": 1.0, + "content": "of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 669–686. SIAM,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 114, + 174, + 143, + 187 + ], + "spans": [ + { + "bbox": [ + 114, + 174, + 143, + 187 + ], + "score": 1.0, + "content": "2014.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 152, + 506, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 193, + 504, + 217 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 505, + 208 + ], + "score": 1.0, + "content": "Jayadev Misra and David Gries. Finding repeated elements. Science of computer programming, 2", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 196, + 217 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 196, + 217 + ], + "score": 1.0, + "content": "(2):143–152, 1982.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 192, + 505, + 217 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 223, + 503, + 247 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "Michael Mitzenmacher. A model for learned bloom filters and optimizing by sandwiching. In", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 235, + 354, + 246 + ], + "spans": [ + { + "bbox": [ + 116, + 235, + 354, + 246 + ], + "score": 1.0, + "content": "Advances in Neural Information Processing Systems, 2018.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 222, + 505, + 246 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 505, + 288 + ], + "lines": [ + { + "bbox": [ + 105, + 253, + 505, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 253, + 505, + 267 + ], + "score": 1.0, + "content": "Ali Mousavi, Ankit B Patel, and Richard G Baraniuk. A deep learning approach to structured signal", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 264, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 115, + 264, + 505, + 277 + ], + "score": 1.0, + "content": "recovery. In Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 117, + 276, + 296, + 288 + ], + "spans": [ + { + "bbox": [ + 117, + 276, + 296, + 288 + ], + "score": 1.0, + "content": "Conference on, pp. 1336–1343. IEEE, 2015.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 253, + 505, + 288 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 504, + 317 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 505, + 307 + ], + "score": 1.0, + "content": "Ali Mousavi, Gautam Dasarathy, and Richard G Baraniuk. Deepcodec: Adaptive sensing and re-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 306, + 471, + 318 + ], + "spans": [ + { + "bbox": [ + 116, + 306, + 471, + 318 + ], + "score": 1.0, + "content": "covery via deep convolutional neural networks. arXiv preprint arXiv:1707.03386, 2017.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 106, + 294, + 505, + 318 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 324, + 505, + 358 + ], + "lines": [ + { + "bbox": [ + 106, + 325, + 505, + 337 + ], + "spans": [ + { + "bbox": [ + 106, + 325, + 505, + 337 + ], + "score": 1.0, + "content": "Pratanu Roy, Arijit Khan, and Gustavo Alonso. Augmented sketch: Faster and more accurate stream", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 335, + 505, + 349 + ], + "spans": [ + { + "bbox": [ + 115, + 335, + 505, + 349 + ], + "score": 1.0, + "content": "processing. In Proceedings of the 2016 International Conference on Management of Data, pp.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 345, + 218, + 358 + ], + "spans": [ + { + "bbox": [ + 116, + 345, + 218, + 358 + ], + "score": 1.0, + "content": "1449–1463. ACM, 2016.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18, + "bbox_fs": [ + 106, + 325, + 505, + 358 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 365, + 504, + 388 + ], + "lines": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "spans": [ + { + "bbox": [ + 106, + 365, + 505, + 378 + ], + "score": 1.0, + "content": "Ruslan Salakhutdinov and Geoffrey Hinton. Semantic hashing. International Journal of Approxi-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 376, + 275, + 388 + ], + "spans": [ + { + "bbox": [ + 115, + 376, + 275, + 388 + ], + "score": 1.0, + "content": "mate Reasoning, 50(7):969–978, 2009.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 106, + 365, + 505, + 388 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 394, + 504, + 429 + ], + "lines": [ + { + "bbox": [ + 106, + 394, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 505, + 408 + ], + "score": 1.0, + "content": "Stuart Schechter, Cormac Herley, and Michael Mitzenmacher. Popularity is everything: A new", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 115, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "approach to protecting passwords from statistical-guessing attacks. In Proceedings of the 5th", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 117, + 417, + 453, + 430 + ], + "spans": [ + { + "bbox": [ + 117, + 417, + 453, + 430 + ], + "score": 1.0, + "content": "USENIX conference on Hot topics in security, pp. 1–8. USENIX Association, 2010.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 106, + 394, + 505, + 430 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 435, + 504, + 470 + ], + "lines": [ + { + "bbox": [ + 107, + 435, + 505, + 448 + ], + "spans": [ + { + "bbox": [ + 107, + 435, + 505, + 448 + ], + "score": 1.0, + "content": "Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S Muthukrishnan, and Jennifer", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 446, + 505, + 460 + ], + "spans": [ + { + "bbox": [ + 115, + 446, + 505, + 460 + ], + "score": 1.0, + "content": "Rexford. Heavy-hitter detection entirely in the data plane. In Proceedings of the Symposium on", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 457, + 287, + 470 + ], + "spans": [ + { + "bbox": [ + 116, + 457, + 287, + 470 + ], + "score": 1.0, + "content": "SDN Research, pp. 164–176. ACM, 2017.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 107, + 435, + 505, + 470 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 476, + 504, + 500 + ], + "lines": [ + { + "bbox": [ + 106, + 477, + 504, + 489 + ], + "spans": [ + { + "bbox": [ + 106, + 477, + 504, + 489 + ], + "score": 1.0, + "content": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. Sequence to sequence learning with neural networks.", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 487, + 427, + 501 + ], + "spans": [ + { + "bbox": [ + 115, + 487, + 427, + 501 + ], + "score": 1.0, + "content": "In Advances in neural information processing systems, pp. 3104–3112, 2014.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 106, + 477, + 504, + 501 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 504, + 530 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "Vivienne Sze, Yu-Hsin Chen, Tien-Ju Yang, and Joel S Emer. Efficient processing of deep neural", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 517, + 461, + 529 + ], + "spans": [ + { + "bbox": [ + 115, + 517, + 461, + 529 + ], + "score": 1.0, + "content": "networks: A tutorial and survey. Proceedings of the IEEE, 105(12):2295–2329, 2017.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 106, + 506, + 505, + 529 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 536, + 504, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 536, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 505, + 549 + ], + "score": 1.0, + "content": "Partha Talukdar and William Cohen. Scaling graph-based semi supervised learning to large number", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 547, + 488, + 560 + ], + "spans": [ + { + "bbox": [ + 116, + 547, + 488, + 560 + ], + "score": 1.0, + "content": "of labels using count-min sketch. In Artificial Intelligence and Statistics, pp. 940–947, 2014.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 106, + 536, + 505, + 560 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 566, + 505, + 589 + ], + "lines": [ + { + "bbox": [ + 105, + 565, + 506, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 506, + 579 + ], + "score": 1.0, + "content": "Jun Wang, Wei Liu, Sanjiv Kumar, and Shih-Fu Chang. Learning to hash for indexing big data - a", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 578, + 335, + 590 + ], + "spans": [ + { + "bbox": [ + 116, + 578, + 335, + 590 + ], + "score": 1.0, + "content": "survey. Proceedings of the IEEE, 104(1):34–57, 2016.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 565, + 506, + 590 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 596, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 505, + 609 + ], + "score": 1.0, + "content": "Yair Weiss, Antonio Torralba, and Rob Fergus. Spectral hashing. In Advances in neural information", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 114, + 608, + 287, + 619 + ], + "spans": [ + { + "bbox": [ + 114, + 608, + 287, + 619 + ], + "score": 1.0, + "content": "processing systems, pp. 1753–1760, 2009.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 106, + 596, + 505, + 619 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 626, + 505, + 650 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 504, + 638 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 504, + 638 + ], + "score": 1.0, + "content": "Minlan Yu, Lavanya Jose, and Rui Miao. Software defined traffic measurement with opensketch. In", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 637, + 261, + 649 + ], + "spans": [ + { + "bbox": [ + 115, + 637, + 261, + 649 + ], + "score": 1.0, + "content": "NSDI, volume 13, pp. 29–42, 2013.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 106, + 627, + 504, + 649 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 254, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 254, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 254, + 96 + ], + "score": 1.0, + "content": "9. ANALYSIS - FULL PROOFS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 505, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 505, + 113 + ], + "score": 1.0, + "content": "In this section, we analyze the performance of three different approaches, single (uniformly random)", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "score": 1.0, + "content": "hash function, Count-Min sketch, and Learned Count-Min sketch when the frequency of items is", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 123, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 463, + 135 + ], + "score": 1.0, + "content": "from Zipfian distribution. For simplicity, we assume that the number of distinct elements", + "type": "text" + }, + { + "bbox": [ + 463, + 124, + 470, + 132 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 123, + 505, + 135 + ], + "score": 1.0, + "content": "is equal", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 131, + 505, + 147 + ], + "spans": [ + { + "bbox": [ + 104, + 131, + 213, + 147 + ], + "score": 1.0, + "content": "to the size of the universe", + "type": "text" + }, + { + "bbox": [ + 213, + 133, + 227, + 145 + ], + "score": 0.88, + "content": "| U |", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 131, + 249, + 147 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 249, + 133, + 286, + 145 + ], + "score": 0.92, + "content": "f _ { i } = 1 / i", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 131, + 324, + 147 + ], + "score": 1.0, + "content": ". We use", + "type": "text" + }, + { + "bbox": [ + 324, + 133, + 336, + 145 + ], + "score": 0.88, + "content": "[ n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 131, + 407, + 147 + ], + "score": 1.0, + "content": "to denote the set", + "type": "text" + }, + { + "bbox": [ + 407, + 133, + 444, + 145 + ], + "score": 0.93, + "content": "\\{ 1 \\ldots n \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 131, + 505, + 147 + ], + "score": 1.0, + "content": ". We also drop", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 145, + 369, + 157 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 204, + 157 + ], + "score": 1.0, + "content": "the normalization factor", + "type": "text" + }, + { + "bbox": [ + 205, + 145, + 224, + 156 + ], + "score": 0.86, + "content": "1 / N", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 145, + 369, + 157 + ], + "score": 1.0, + "content": "in the definition of estimation error.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 105, + 160, + 503, + 184 + ], + "lines": [ + { + "bbox": [ + 105, + 160, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 505, + 174 + ], + "score": 1.0, + "content": "The following observation is useful throughout this section (in particular, in the section on non-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 172, + 193, + 185 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 193, + 185 + ], + "score": 1.0, + "content": "asymptotic analysis).", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 107, + 187, + 375, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 186, + 375, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 304, + 200 + ], + "score": 1.0, + "content": "Observation 9.1. For sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 305, + 189, + 312, + 197 + ], + "score": 0.35, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 186, + 333, + 200 + ], + "score": 1.0, + "content": "(i.e.,", + "type": "text" + }, + { + "bbox": [ + 333, + 187, + 370, + 198 + ], + "score": 0.35, + "content": "n > 2 5 0 ,", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 186, + 375, + 200 + ], + "score": 1.0, + "content": "),", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 198, + 375, + 230 + ], + "lines": [ + { + "bbox": [ + 236, + 198, + 375, + 230 + ], + "spans": [ + { + "bbox": [ + 236, + 198, + 375, + 230 + ], + "score": 0.91, + "content": "\\ln ( n + 1 ) < \\sum _ { i = 1 } ^ { \\tilde { n } } { \\frac { 1 } { i } } < \\ln n + 0 . 5 8", + "type": "interline_equation", + "image_path": "d744842f055527e4aaeab38ca46d6243238a31cd73bd5c2e9a852f56b8149c82.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 236, + 198, + 375, + 214.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 236, + 214.0, + 375, + 230.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 237, + 236, + 249 + ], + "lines": [ + { + "bbox": [ + 105, + 237, + 237, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 237, + 250 + ], + "score": 1.0, + "content": "9.1. SINGLE HASH FUNCTION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 504, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 414, + 267 + ], + "score": 1.0, + "content": "Lemma 9.2. The expected error of a single uniformly random hash function", + "type": "text" + }, + { + "bbox": [ + 415, + 255, + 470, + 267 + ], + "score": 0.9, + "content": "h : [ n ] \\to [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 254, + 494, + 267 + ], + "score": 1.0, + "content": "(with", + "type": "text" + }, + { + "bbox": [ + 495, + 255, + 504, + 265 + ], + "score": 0.79, + "content": "B", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 102, + 261, + 458, + 288 + ], + "spans": [ + { + "bbox": [ + 102, + 261, + 415, + 288 + ], + "score": 1.0, + "content": "buckets) for estimating the frequency of items whose distribution is Zipfian is", + "type": "text" + }, + { + "bbox": [ + 415, + 267, + 450, + 281 + ], + "score": 0.91, + "content": "\\Theta \\big ( \\textstyle { \\frac { \\ln ^ { 2 } n } { B } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 261, + 458, + 288 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 282, + 136, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 136, + 297 + ], + "score": 1.0, + "content": "Proof:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 140, + 292, + 470, + 358 + ], + "lines": [ + { + "bbox": [ + 140, + 292, + 470, + 358 + ], + "spans": [ + { + "bbox": [ + 140, + 292, + 470, + 358 + ], + "score": 0.94, + "content": "\\begin{array} { r l } { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\widetilde { \\mathcal { F } } _ { h } ) ] = \\mathbf { E } [ \\displaystyle \\sum _ { j \\in [ n ] } \\big ( \\widetilde { f } _ { j } - f _ { j } \\big ) \\cdot f _ { j } ] = \\displaystyle \\sum _ { j \\in [ n ] } \\mathbf { E } [ \\displaystyle \\sum _ { \\{ q \\neq j \\mid h [ q ] = h [ j ] \\} } f _ { q } ] \\cdot f _ { j } } & { } \\\\ { \\displaystyle } & { = \\displaystyle \\sum _ { j \\in [ n ] } ( \\Theta ( \\frac { \\ln n } { B } ) - \\frac { f _ { j } } { B } ) \\cdot f _ { j } = \\Theta ( \\frac { \\ln ^ { 2 } n } { B } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "858364c73a257fa76a519ce408c0d824f59460fba91163f190f971d1ce438e0d.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 140, + 292, + 470, + 314.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 140, + 314.0, + 470, + 336.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 140, + 336.0, + 470, + 358.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 364, + 505, + 388 + ], + "lines": [ + { + "bbox": [ + 106, + 364, + 505, + 377 + ], + "spans": [ + { + "bbox": [ + 106, + 364, + 478, + 377 + ], + "score": 1.0, + "content": "Moreover, since each bucket maintains the frequency of items that are mapped to it under", + "type": "text" + }, + { + "bbox": [ + 479, + 365, + 485, + 375 + ], + "score": 0.81, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 364, + 505, + 377 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 375, + 472, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 443, + 389 + ], + "score": 1.0, + "content": "space complexity of this approach is proportional to the number of buckets which is", + "type": "text" + }, + { + "bbox": [ + 443, + 376, + 468, + 388 + ], + "score": 0.92, + "content": "\\Theta ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 375, + 472, + 389 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 107, + 393, + 219, + 404 + ], + "lines": [ + { + "bbox": [ + 106, + 392, + 219, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 392, + 219, + 405 + ], + "score": 1.0, + "content": "9.2. COUNT-MIN SKETCH", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 409, + 505, + 453 + ], + "lines": [ + { + "bbox": [ + 106, + 410, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 505, + 421 + ], + "score": 1.0, + "content": "Here, we provide an upper bound and lower bound for the expected estimation error of Count-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 178, + 433 + ], + "score": 1.0, + "content": "Min sketch with", + "type": "text" + }, + { + "bbox": [ + 178, + 421, + 185, + 430 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 420, + 269, + 433 + ], + "score": 1.0, + "content": "hash functions and", + "type": "text" + }, + { + "bbox": [ + 269, + 421, + 279, + 430 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "buckets per row. In the rest of this section, for each", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 107, + 432, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 107, + 432, + 172, + 443 + ], + "score": 0.91, + "content": "j ~ \\in ~ [ n ] , \\ell ~ \\le ~ k", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 432, + 210, + 444 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 210, + 433, + 226, + 444 + ], + "score": 0.88, + "content": "e _ { j , \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 432, + 246, + 444 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 246, + 433, + 256, + 444 + ], + "score": 0.87, + "content": "e _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 432, + 448, + 444 + ], + "score": 1.0, + "content": "respectively to denote the estimation error of", + "type": "text" + }, + { + "bbox": [ + 448, + 432, + 459, + 444 + ], + "score": 0.88, + "content": "f _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 432, + 474, + 444 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 475, + 432, + 486, + 443 + ], + "score": 0.87, + "content": "h _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 432, + 506, + 444 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 442, + 476, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 476, + 455 + ], + "score": 1.0, + "content": "Count-Min sketch. Recall that the expected error of Count-Min sketch is defined as follows:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5 + }, + { + "type": "interline_equation", + "bbox": [ + 181, + 453, + 428, + 481 + ], + "lines": [ + { + "bbox": [ + 181, + 453, + 428, + 481 + ], + "spans": [ + { + "bbox": [ + 181, + 453, + 428, + 481 + ], + "score": 0.91, + "content": "\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { C M } ) ] { \\stackrel { \\cdot } { = } } \\mathbf { E } [ \\sum _ { j \\in [ n ] } ( \\tilde { f } _ { j } - f _ { j } ) \\cdot f _ { j } ] = \\sum _ { j \\in [ n ] } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } ,", + "type": "interline_equation", + "image_path": "da8948319d699db915ff998a09eff8ddd49ecd507ac1228fa9cc49d7cffc4212.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 181, + 453, + 428, + 481 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 485, + 505, + 520 + ], + "lines": [ + { + "bbox": [ + 106, + 485, + 506, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 319, + 499 + ], + "score": 1.0, + "content": "Our high-level approach is to partition the interval", + "type": "text" + }, + { + "bbox": [ + 319, + 486, + 361, + 498 + ], + "score": 0.92, + "content": "[ 0 , B \\ln n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 485, + 382, + 499 + ], + "score": 1.0, + "content": "into", + "type": "text" + }, + { + "bbox": [ + 382, + 486, + 411, + 496 + ], + "score": 0.9, + "content": "m + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 485, + 506, + 499 + ], + "score": 1.0, + "content": "smaller intervals by a", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 103, + 494, + 507, + 514 + ], + "spans": [ + { + "bbox": [ + 103, + 494, + 202, + 514 + ], + "score": 1.0, + "content": "sequence of thresholds", + "type": "text" + }, + { + "bbox": [ + 202, + 497, + 382, + 511 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\Theta ( \\ln ^ { 1 + \\gamma } ( \\frac { n } { B } ) ) = r _ { 0 } \\le \\dots \\le r _ { m } = \\bar { B } \\ln n } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 494, + 412, + 514 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 412, + 500, + 420, + 510 + ], + "score": 0.82, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 494, + 507, + 514 + ], + "score": 1.0, + "content": "is a parameter to be", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 508, + 470, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 322, + 522 + ], + "score": 1.0, + "content": "determined later. Formally, we define the sequence of", + "type": "text" + }, + { + "bbox": [ + 323, + 511, + 336, + 520 + ], + "score": 0.83, + "content": "r _ { i } \\mathrm { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 508, + 470, + 522 + ], + "score": 1.0, + "content": "to satisfy the following property:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "interline_equation", + "bbox": [ + 213, + 519, + 396, + 540 + ], + "lines": [ + { + "bbox": [ + 213, + 519, + 396, + 540 + ], + "spans": [ + { + "bbox": [ + 213, + 519, + 396, + 540 + ], + "score": 0.88, + "content": "\\forall \\ell > 0 , \\quad r _ { \\ell } : = \\dot { ( \\ln ( \\frac { n } { B } ) + \\ln r _ { \\ell + 1 } ) } \\ln ^ { \\dot { \\gamma } } r _ { \\ell + 1 } .", + "type": "interline_equation", + "image_path": "5a6c339df210f30a8405f40934c99046826cde1a8aa91d5622524a73c9e7a09f.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 213, + 519, + 396, + 540 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 548, + 289, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 547, + 290, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 547, + 192, + 563 + ], + "score": 1.0, + "content": "Claim 9.3. For each", + "type": "text" + }, + { + "bbox": [ + 192, + 549, + 286, + 561 + ], + "score": 0.75, + "content": "i \\geq 0 , \\ln r _ { i + 1 } \\geq 2 \\ln r _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 547, + 290, + 563 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 105, + 565, + 504, + 592 + ], + "lines": [ + { + "bbox": [ + 104, + 562, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 104, + 562, + 231, + 581 + ], + "score": 1.0, + "content": "Proof: By (9.3) and assuming", + "type": "text" + }, + { + "bbox": [ + 232, + 567, + 300, + 579 + ], + "score": 0.82, + "content": "\\ln r _ { i + 1 } \\geq \\ln ( { \\frac { n } { B } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 562, + 305, + 581 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 305, + 565, + 379, + 579 + ], + "score": 0.89, + "content": "r _ { i } < 2 \\ln ^ { 1 + \\gamma } r _ { i + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 562, + 415, + 581 + ], + "score": 1.0, + "content": ". Hence,", + "type": "text" + }, + { + "bbox": [ + 415, + 564, + 505, + 580 + ], + "score": 0.88, + "content": "\\ln r _ { i + 1 } > \\left( { \\frac { r _ { i } } { 2 } } \\right) ^ { \\frac { 1 } { 1 + \\gamma } } >", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 579, + 339, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 132, + 591 + ], + "score": 0.89, + "content": "2 \\ln r _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 579, + 255, + 592 + ], + "score": 1.0, + "content": "for sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 255, + 579, + 268, + 591 + ], + "score": 0.89, + "content": "r _ { i } { } ^ { 7 }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 579, + 309, + 592 + ], + "score": 1.0, + "content": "assuming", + "type": "text" + }, + { + "bbox": [ + 310, + 580, + 335, + 591 + ], + "score": 0.88, + "content": "\\gamma \\le 3", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 579, + 339, + 592 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 104, + 596, + 451, + 611 + ], + "lines": [ + { + "bbox": [ + 104, + 594, + 451, + 613 + ], + "spans": [ + { + "bbox": [ + 104, + 594, + 187, + 613 + ], + "score": 1.0, + "content": "Note that as long as", + "type": "text" + }, + { + "bbox": [ + 187, + 597, + 254, + 610 + ], + "score": 0.84, + "content": "\\ln r _ { i + 1 } \\geq \\ln ( { \\frac { n } { B } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 594, + 258, + 613 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 258, + 598, + 298, + 610 + ], + "score": 0.78, + "content": "r _ { i } \\leq r _ { i + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 594, + 349, + 613 + ], + "score": 1.0, + "content": ". Otherwise,", + "type": "text" + }, + { + "bbox": [ + 349, + 596, + 446, + 610 + ], + "score": 0.92, + "content": "\\begin{array} { r } { r _ { i } = o ( \\ln ^ { 1 + \\gamma } ( \\frac { n } { B } ) ) < r _ { 0 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 594, + 451, + 613 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 614, + 391, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 389, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 207, + 630 + ], + "score": 1.0, + "content": "Corollary 9.4. For each", + "type": "text" + }, + { + "bbox": [ + 208, + 615, + 231, + 626 + ], + "score": 0.89, + "content": "i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 612, + 249, + 630 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 249, + 615, + 273, + 627 + ], + "score": 0.85, + "content": "c \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 612, + 277, + 630 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 277, + 613, + 389, + 629 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\sum _ { j \\geq i } \\ln ^ { - c } r _ { j } = O ( \\ln ^ { - c } r _ { i } ) } \\end{array}", + "type": "inline_equation" + } + ], + "index": 34 + } + ], + "index": 34 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 120, + 721, + 240, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 719, + 237, + 734 + ], + "spans": [ + { + "bbox": [ + 118, + 719, + 180, + 734 + ], + "score": 1.0, + "content": "7More precisely,", + "type": "text" + }, + { + "bbox": [ + 181, + 721, + 237, + 732 + ], + "score": 0.89, + "content": "r _ { i } \\geq 1 . 3 \\times 1 0 ^ { 6 }", + "type": "inline_equation" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2019", + "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" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 332, + 504, + 342 + ], + "lines": [ + { + "bbox": [ + 496, + 334, + 504, + 343 + ], + "spans": [ + { + "bbox": [ + 496, + 334, + 504, + 343 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 598, + 504, + 608 + ], + "lines": [ + { + "bbox": [ + 496, + 599, + 504, + 609 + ], + "spans": [ + { + "bbox": [ + 496, + 599, + 504, + 609 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 81, + 254, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 254, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 254, + 96 + ], + "score": 1.0, + "content": "9. ANALYSIS - FULL PROOFS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 100, + 505, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 505, + 113 + ], + "score": 1.0, + "content": "In this section, we analyze the performance of three different approaches, single (uniformly random)", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "spans": [ + { + "bbox": [ + 105, + 110, + 506, + 124 + ], + "score": 1.0, + "content": "hash function, Count-Min sketch, and Learned Count-Min sketch when the frequency of items is", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 123, + 505, + 135 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 463, + 135 + ], + "score": 1.0, + "content": "from Zipfian distribution. For simplicity, we assume that the number of distinct elements", + "type": "text" + }, + { + "bbox": [ + 463, + 124, + 470, + 132 + ], + "score": 0.74, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 123, + 505, + 135 + ], + "score": 1.0, + "content": "is equal", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 104, + 131, + 505, + 147 + ], + "spans": [ + { + "bbox": [ + 104, + 131, + 213, + 147 + ], + "score": 1.0, + "content": "to the size of the universe", + "type": "text" + }, + { + "bbox": [ + 213, + 133, + 227, + 145 + ], + "score": 0.88, + "content": "| U |", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 131, + 249, + 147 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 249, + 133, + 286, + 145 + ], + "score": 0.92, + "content": "f _ { i } = 1 / i", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 131, + 324, + 147 + ], + "score": 1.0, + "content": ". We use", + "type": "text" + }, + { + "bbox": [ + 324, + 133, + 336, + 145 + ], + "score": 0.88, + "content": "[ n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 131, + 407, + 147 + ], + "score": 1.0, + "content": "to denote the set", + "type": "text" + }, + { + "bbox": [ + 407, + 133, + 444, + 145 + ], + "score": 0.93, + "content": "\\{ 1 \\ldots n \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 131, + 505, + 147 + ], + "score": 1.0, + "content": ". We also drop", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 145, + 369, + 157 + ], + "spans": [ + { + "bbox": [ + 106, + 145, + 204, + 157 + ], + "score": 1.0, + "content": "the normalization factor", + "type": "text" + }, + { + "bbox": [ + 205, + 145, + 224, + 156 + ], + "score": 0.86, + "content": "1 / N", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 145, + 369, + 157 + ], + "score": 1.0, + "content": "in the definition of estimation error.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 3, + "bbox_fs": [ + 104, + 100, + 506, + 157 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 160, + 503, + 184 + ], + "lines": [ + { + "bbox": [ + 105, + 160, + 505, + 174 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 505, + 174 + ], + "score": 1.0, + "content": "The following observation is useful throughout this section (in particular, in the section on non-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 172, + 193, + 185 + ], + "spans": [ + { + "bbox": [ + 105, + 172, + 193, + 185 + ], + "score": 1.0, + "content": "asymptotic analysis).", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 160, + 505, + 185 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 187, + 375, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 186, + 375, + 200 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 304, + 200 + ], + "score": 1.0, + "content": "Observation 9.1. For sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 305, + 189, + 312, + 197 + ], + "score": 0.35, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 186, + 333, + 200 + ], + "score": 1.0, + "content": "(i.e.,", + "type": "text" + }, + { + "bbox": [ + 333, + 187, + 370, + 198 + ], + "score": 0.35, + "content": "n > 2 5 0 ,", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 186, + 375, + 200 + ], + "score": 1.0, + "content": "),", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 186, + 375, + 200 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 236, + 198, + 375, + 230 + ], + "lines": [ + { + "bbox": [ + 236, + 198, + 375, + 230 + ], + "spans": [ + { + "bbox": [ + 236, + 198, + 375, + 230 + ], + "score": 0.91, + "content": "\\ln ( n + 1 ) < \\sum _ { i = 1 } ^ { \\tilde { n } } { \\frac { 1 } { i } } < \\ln n + 0 . 5 8", + "type": "interline_equation", + "image_path": "d744842f055527e4aaeab38ca46d6243238a31cd73bd5c2e9a852f56b8149c82.jpg" + } + ] + } + ], + "index": 9.5, + "virtual_lines": [ + { + "bbox": [ + 236, + 198, + 375, + 214.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 236, + 214.0, + 375, + 230.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "title", + "bbox": [ + 107, + 237, + 236, + 249 + ], + "lines": [ + { + "bbox": [ + 105, + 237, + 237, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 237, + 250 + ], + "score": 1.0, + "content": "9.1. SINGLE HASH FUNCTION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 106, + 254, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 106, + 254, + 504, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 414, + 267 + ], + "score": 1.0, + "content": "Lemma 9.2. The expected error of a single uniformly random hash function", + "type": "text" + }, + { + "bbox": [ + 415, + 255, + 470, + 267 + ], + "score": 0.9, + "content": "h : [ n ] \\to [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 254, + 494, + 267 + ], + "score": 1.0, + "content": "(with", + "type": "text" + }, + { + "bbox": [ + 495, + 255, + 504, + 265 + ], + "score": 0.79, + "content": "B", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 102, + 261, + 458, + 288 + ], + "spans": [ + { + "bbox": [ + 102, + 261, + 415, + 288 + ], + "score": 1.0, + "content": "buckets) for estimating the frequency of items whose distribution is Zipfian is", + "type": "text" + }, + { + "bbox": [ + 415, + 267, + 450, + 281 + ], + "score": 0.91, + "content": "\\Theta \\big ( \\textstyle { \\frac { \\ln ^ { 2 } n } { B } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 261, + 458, + 288 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 282, + 136, + 297 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 136, + 297 + ], + "score": 1.0, + "content": "Proof:", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 102, + 254, + 504, + 297 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 140, + 292, + 470, + 358 + ], + "lines": [ + { + "bbox": [ + 140, + 292, + 470, + 358 + ], + "spans": [ + { + "bbox": [ + 140, + 292, + 470, + 358 + ], + "score": 0.94, + "content": "\\begin{array} { r l } { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\widetilde { \\mathcal { F } } _ { h } ) ] = \\mathbf { E } [ \\displaystyle \\sum _ { j \\in [ n ] } \\big ( \\widetilde { f } _ { j } - f _ { j } \\big ) \\cdot f _ { j } ] = \\displaystyle \\sum _ { j \\in [ n ] } \\mathbf { E } [ \\displaystyle \\sum _ { \\{ q \\neq j \\mid h [ q ] = h [ j ] \\} } f _ { q } ] \\cdot f _ { j } } & { } \\\\ { \\displaystyle } & { = \\displaystyle \\sum _ { j \\in [ n ] } ( \\Theta ( \\frac { \\ln n } { B } ) - \\frac { f _ { j } } { B } ) \\cdot f _ { j } = \\Theta ( \\frac { \\ln ^ { 2 } n } { B } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "858364c73a257fa76a519ce408c0d824f59460fba91163f190f971d1ce438e0d.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 140, + 292, + 470, + 314.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 140, + 314.0, + 470, + 336.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 140, + 336.0, + 470, + 358.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 364, + 505, + 388 + ], + "lines": [ + { + "bbox": [ + 106, + 364, + 505, + 377 + ], + "spans": [ + { + "bbox": [ + 106, + 364, + 478, + 377 + ], + "score": 1.0, + "content": "Moreover, since each bucket maintains the frequency of items that are mapped to it under", + "type": "text" + }, + { + "bbox": [ + 479, + 365, + 485, + 375 + ], + "score": 0.81, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 364, + 505, + 377 + ], + "score": 1.0, + "content": ", the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 375, + 472, + 389 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 443, + 389 + ], + "score": 1.0, + "content": "space complexity of this approach is proportional to the number of buckets which is", + "type": "text" + }, + { + "bbox": [ + 443, + 376, + 468, + 388 + ], + "score": 0.92, + "content": "\\Theta ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 375, + 472, + 389 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 364, + 505, + 389 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 393, + 219, + 404 + ], + "lines": [ + { + "bbox": [ + 106, + 392, + 219, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 392, + 219, + 405 + ], + "score": 1.0, + "content": "9.2. COUNT-MIN SKETCH", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 409, + 505, + 453 + ], + "lines": [ + { + "bbox": [ + 106, + 410, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 505, + 421 + ], + "score": 1.0, + "content": "Here, we provide an upper bound and lower bound for the expected estimation error of Count-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 420, + 505, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 178, + 433 + ], + "score": 1.0, + "content": "Min sketch with", + "type": "text" + }, + { + "bbox": [ + 178, + 421, + 185, + 430 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 420, + 269, + 433 + ], + "score": 1.0, + "content": "hash functions and", + "type": "text" + }, + { + "bbox": [ + 269, + 421, + 279, + 430 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 279, + 420, + 505, + 433 + ], + "score": 1.0, + "content": "buckets per row. In the rest of this section, for each", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 107, + 432, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 107, + 432, + 172, + 443 + ], + "score": 0.91, + "content": "j ~ \\in ~ [ n ] , \\ell ~ \\le ~ k", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 432, + 210, + 444 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 210, + 433, + 226, + 444 + ], + "score": 0.88, + "content": "e _ { j , \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 432, + 246, + 444 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 246, + 433, + 256, + 444 + ], + "score": 0.87, + "content": "e _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 432, + 448, + 444 + ], + "score": 1.0, + "content": "respectively to denote the estimation error of", + "type": "text" + }, + { + "bbox": [ + 448, + 432, + 459, + 444 + ], + "score": 0.88, + "content": "f _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 432, + 474, + 444 + ], + "score": 1.0, + "content": "by", + "type": "text" + }, + { + "bbox": [ + 475, + 432, + 486, + 443 + ], + "score": 0.87, + "content": "h _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 432, + 506, + 444 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 442, + 476, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 476, + 455 + ], + "score": 1.0, + "content": "Count-Min sketch. Recall that the expected error of Count-Min sketch is defined as follows:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 410, + 506, + 455 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 181, + 453, + 428, + 481 + ], + "lines": [ + { + "bbox": [ + 181, + 453, + 428, + 481 + ], + "spans": [ + { + "bbox": [ + 181, + 453, + 428, + 481 + ], + "score": 0.91, + "content": "\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { C M } ) ] { \\stackrel { \\cdot } { = } } \\mathbf { E } [ \\sum _ { j \\in [ n ] } ( \\tilde { f } _ { j } - f _ { j } ) \\cdot f _ { j } ] = \\sum _ { j \\in [ n ] } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } ,", + "type": "interline_equation", + "image_path": "da8948319d699db915ff998a09eff8ddd49ecd507ac1228fa9cc49d7cffc4212.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 181, + 453, + 428, + 481 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 485, + 505, + 520 + ], + "lines": [ + { + "bbox": [ + 106, + 485, + 506, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 319, + 499 + ], + "score": 1.0, + "content": "Our high-level approach is to partition the interval", + "type": "text" + }, + { + "bbox": [ + 319, + 486, + 361, + 498 + ], + "score": 0.92, + "content": "[ 0 , B \\ln n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 485, + 382, + 499 + ], + "score": 1.0, + "content": "into", + "type": "text" + }, + { + "bbox": [ + 382, + 486, + 411, + 496 + ], + "score": 0.9, + "content": "m + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 485, + 506, + 499 + ], + "score": 1.0, + "content": "smaller intervals by a", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 103, + 494, + 507, + 514 + ], + "spans": [ + { + "bbox": [ + 103, + 494, + 202, + 514 + ], + "score": 1.0, + "content": "sequence of thresholds", + "type": "text" + }, + { + "bbox": [ + 202, + 497, + 382, + 511 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\Theta ( \\ln ^ { 1 + \\gamma } ( \\frac { n } { B } ) ) = r _ { 0 } \\le \\dots \\le r _ { m } = \\bar { B } \\ln n } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 494, + 412, + 514 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 412, + 500, + 420, + 510 + ], + "score": 0.82, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 494, + 507, + 514 + ], + "score": 1.0, + "content": "is a parameter to be", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 508, + 470, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 322, + 522 + ], + "score": 1.0, + "content": "determined later. Formally, we define the sequence of", + "type": "text" + }, + { + "bbox": [ + 323, + 511, + 336, + 520 + ], + "score": 0.83, + "content": "r _ { i } \\mathrm { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 508, + 470, + 522 + ], + "score": 1.0, + "content": "to satisfy the following property:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 103, + 485, + 507, + 522 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 213, + 519, + 396, + 540 + ], + "lines": [ + { + "bbox": [ + 213, + 519, + 396, + 540 + ], + "spans": [ + { + "bbox": [ + 213, + 519, + 396, + 540 + ], + "score": 0.88, + "content": "\\forall \\ell > 0 , \\quad r _ { \\ell } : = \\dot { ( \\ln ( \\frac { n } { B } ) + \\ln r _ { \\ell + 1 } ) } \\ln ^ { \\dot { \\gamma } } r _ { \\ell + 1 } .", + "type": "interline_equation", + "image_path": "5a6c339df210f30a8405f40934c99046826cde1a8aa91d5622524a73c9e7a09f.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 213, + 519, + 396, + 540 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 548, + 289, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 547, + 290, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 547, + 192, + 563 + ], + "score": 1.0, + "content": "Claim 9.3. For each", + "type": "text" + }, + { + "bbox": [ + 192, + 549, + 286, + 561 + ], + "score": 0.75, + "content": "i \\geq 0 , \\ln r _ { i + 1 } \\geq 2 \\ln r _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 547, + 290, + 563 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 547, + 290, + 563 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 565, + 504, + 592 + ], + "lines": [ + { + "bbox": [ + 104, + 562, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 104, + 562, + 231, + 581 + ], + "score": 1.0, + "content": "Proof: By (9.3) and assuming", + "type": "text" + }, + { + "bbox": [ + 232, + 567, + 300, + 579 + ], + "score": 0.82, + "content": "\\ln r _ { i + 1 } \\geq \\ln ( { \\frac { n } { B } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 562, + 305, + 581 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 305, + 565, + 379, + 579 + ], + "score": 0.89, + "content": "r _ { i } < 2 \\ln ^ { 1 + \\gamma } r _ { i + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 562, + 415, + 581 + ], + "score": 1.0, + "content": ". Hence,", + "type": "text" + }, + { + "bbox": [ + 415, + 564, + 505, + 580 + ], + "score": 0.88, + "content": "\\ln r _ { i + 1 } > \\left( { \\frac { r _ { i } } { 2 } } \\right) ^ { \\frac { 1 } { 1 + \\gamma } } >", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 579, + 339, + 592 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 132, + 591 + ], + "score": 0.89, + "content": "2 \\ln r _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 579, + 255, + 592 + ], + "score": 1.0, + "content": "for sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 255, + 579, + 268, + 591 + ], + "score": 0.89, + "content": "r _ { i } { } ^ { 7 }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 579, + 309, + 592 + ], + "score": 1.0, + "content": "assuming", + "type": "text" + }, + { + "bbox": [ + 310, + 580, + 335, + 591 + ], + "score": 0.88, + "content": "\\gamma \\le 3", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 579, + 339, + 592 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 104, + 562, + 505, + 592 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 596, + 451, + 611 + ], + "lines": [ + { + "bbox": [ + 104, + 594, + 451, + 613 + ], + "spans": [ + { + "bbox": [ + 104, + 594, + 187, + 613 + ], + "score": 1.0, + "content": "Note that as long as", + "type": "text" + }, + { + "bbox": [ + 187, + 597, + 254, + 610 + ], + "score": 0.84, + "content": "\\ln r _ { i + 1 } \\geq \\ln ( { \\frac { n } { B } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 594, + 258, + 613 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 258, + 598, + 298, + 610 + ], + "score": 0.78, + "content": "r _ { i } \\leq r _ { i + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 594, + 349, + 613 + ], + "score": 1.0, + "content": ". Otherwise,", + "type": "text" + }, + { + "bbox": [ + 349, + 596, + 446, + 610 + ], + "score": 0.92, + "content": "\\begin{array} { r } { r _ { i } = o ( \\ln ^ { 1 + \\gamma } ( \\frac { n } { B } ) ) < r _ { 0 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 594, + 451, + 613 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33, + "bbox_fs": [ + 104, + 594, + 451, + 613 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 614, + 391, + 629 + ], + "lines": [ + { + "bbox": [ + 105, + 612, + 389, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 612, + 207, + 630 + ], + "score": 1.0, + "content": "Corollary 9.4. For each", + "type": "text" + }, + { + "bbox": [ + 208, + 615, + 231, + 626 + ], + "score": 0.89, + "content": "i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 612, + 249, + 630 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 249, + 615, + 273, + 627 + ], + "score": 0.85, + "content": "c \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 612, + 277, + 630 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 277, + 613, + 389, + 629 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\sum _ { j \\geq i } \\ln ^ { - c } r _ { j } = O ( \\ln ^ { - c } r _ { i } ) } \\end{array}", + "type": "inline_equation" + } + ], + "index": 34 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 612, + 389, + 630 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 447, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 448, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 248, + 96 + ], + "score": 1.0, + "content": "Then, to compute (9.2), we rewrite", + "type": "text" + }, + { + "bbox": [ + 248, + 82, + 271, + 95 + ], + "score": 0.92, + "content": "{ \\bf E } [ e _ { j } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 81, + 354, + 96 + ], + "score": 1.0, + "content": "using the thresholds", + "type": "text" + }, + { + "bbox": [ + 354, + 84, + 400, + 94 + ], + "score": 0.89, + "content": "r _ { 0 } , \\cdots , r _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 81, + 448, + 96 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 116, + 95, + 495, + 191 + ], + "lines": [ + { + "bbox": [ + 116, + 95, + 495, + 191 + ], + "spans": [ + { + "bbox": [ + 116, + 95, + 495, + 191 + ], + "score": 0.92, + "content": "\\begin{array} { l l } { \\displaystyle \\mathbf { E } [ e _ { j } ] = \\int _ { 0 } ^ { \\infty } \\operatorname* { P r } ( e _ { j } \\geq x ) d x } & { \\displaystyle { ( 9 . } } \\\\ { \\displaystyle { = \\int _ { 0 } ^ { \\frac { r _ { 0 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x } } \\\\ { \\displaystyle { \\leq O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } } \\end{array}", + "type": "interline_equation", + "image_path": "7a357b76c8fc95bf504f94a5f90c667f377d34493d4fad1490ac2b33881f4f75.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 116, + 95, + 495, + 127.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 116, + 127.0, + 495, + 159.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 116, + 159.0, + 495, + 191.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 368, + 209 + ], + "lines": [ + { + "bbox": [ + 104, + 192, + 369, + 212 + ], + "spans": [ + { + "bbox": [ + 104, + 192, + 181, + 212 + ], + "score": 1.0, + "content": "Next, we compute", + "type": "text" + }, + { + "bbox": [ + 182, + 194, + 273, + 209 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 192, + 311, + 212 + ], + "score": 1.0, + "content": ") for each", + "type": "text" + }, + { + "bbox": [ + 311, + 195, + 364, + 208 + ], + "score": 0.91, + "content": "t \\in [ r _ { i } , r _ { i + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 192, + 369, + 212 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 210, + 448, + 232 + ], + "lines": [ + { + "bbox": [ + 102, + 210, + 448, + 234 + ], + "spans": [ + { + "bbox": [ + 102, + 210, + 199, + 234 + ], + "score": 1.0, + "content": "Lemma 9.5. For each", + "type": "text" + }, + { + "bbox": [ + 211, + 210, + 448, + 232 + ], + "score": 0.7, + "content": "\\begin{array} { r } { \\div \\left[ r _ { i } , r _ { i + 1 } \\right) , \\mathrm { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) = O \\Big ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma } r _ { i + 1 } } \\Big ) . } \\end{array}", + "type": "inline_equation", + "image_path": "227bbee75b9b495eebbbcb15b09328033d78c5bdee2a36cf739779bf02741818.jpg" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 233, + 330, + 245 + ], + "lines": [ + { + "bbox": [ + 106, + 232, + 330, + 247 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 330, + 247 + ], + "score": 1.0, + "content": "Proof: First we prove the following useful observation.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 109, + 249, + 444, + 264 + ], + "lines": [ + { + "bbox": [ + 104, + 247, + 436, + 266 + ], + "spans": [ + { + "bbox": [ + 104, + 247, + 212, + 266 + ], + "score": 1.0, + "content": "Claim 9.6. For each item", + "type": "text" + }, + { + "bbox": [ + 212, + 252, + 218, + 263 + ], + "score": 0.79, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 247, + 293, + 266 + ], + "score": 1.0, + "content": "and hash function", + "type": "text" + }, + { + "bbox": [ + 294, + 248, + 436, + 265 + ], + "score": 0.83, + "content": "\\begin{array} { r } { h _ { \\ell } , \\mathbf { E } [ e _ { j , \\ell } \\mid e _ { j , \\ell } < \\frac { r } { B } ] \\le \\frac { \\ln \\left( \\frac { n } { B } \\right) + \\ln r } { B } . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 267, + 504, + 290 + ], + "lines": [ + { + "bbox": [ + 104, + 266, + 505, + 283 + ], + "spans": [ + { + "bbox": [ + 104, + 266, + 228, + 283 + ], + "score": 1.0, + "content": "Proof: Note that the condition", + "type": "text" + }, + { + "bbox": [ + 229, + 269, + 266, + 281 + ], + "score": 0.93, + "content": "\\begin{array} { r } { e _ { j , \\ell } < \\frac { r } { B } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 266, + 363, + 283 + ], + "score": 1.0, + "content": "implies that for all items", + "type": "text" + }, + { + "bbox": [ + 365, + 268, + 501, + 281 + ], + "score": 0.42, + "content": "\\begin{array} { r } { q < \\frac { B } { r } ( \\mathrm { a n d } q \\neq j ) , h _ { \\ell } ( j ) \\neq h _ { \\ell } ( q ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 266, + 505, + 283 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 277, + 138, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 138, + 293 + ], + "score": 1.0, + "content": "Hence,", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 288, + 442, + 325 + ], + "lines": [ + { + "bbox": [ + 168, + 288, + 442, + 325 + ], + "spans": [ + { + "bbox": [ + 168, + 288, + 442, + 325 + ], + "score": 0.94, + "content": "\\mathbf { E } [ e _ { j , \\ell } \\mid e _ { j , \\ell } < \\frac { r } { B } ] \\leq \\sum _ { q > \\frac { B } { r } } f _ { q } \\cdot \\frac { 1 } { B } \\leq \\frac { \\ln n - \\ln ( \\frac { B } { r } ) } { B } = \\frac { \\ln ( \\frac { n } { B } ) + \\ln r } { B } .", + "type": "interline_equation", + "image_path": "9f6d0a06c65e990ce8a1b41bab234fa871e7aba5a8e530e7a630fd5482adf1cb.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 168, + 288, + 442, + 325 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 332, + 378, + 344 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 379, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 283, + 346 + ], + "score": 1.0, + "content": "Thus, by Markov’s inequality, for each item", + "type": "text" + }, + { + "bbox": [ + 284, + 333, + 289, + 344 + ], + "score": 0.82, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 330, + 364, + 346 + ], + "score": 1.0, + "content": "and hash function", + "type": "text" + }, + { + "bbox": [ + 364, + 333, + 375, + 343 + ], + "score": 0.84, + "content": "h _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 330, + 379, + 346 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 218, + 343, + 392, + 367 + ], + "lines": [ + { + "bbox": [ + 218, + 343, + 392, + 367 + ], + "spans": [ + { + "bbox": [ + 218, + 343, + 392, + 367 + ], + "score": 0.85, + "content": "\\operatorname* { P r } ( e _ { j , \\ell } > \\frac { t } { B } \\mid e _ { j , \\ell } \\leq \\frac { r } { B } ) \\leq \\frac { \\ln ( \\frac { n } { B } ) + \\ln r } { t } .", + "type": "interline_equation", + "image_path": "85cb607bda191b1eec1d65428ee948c16b4f654b3b342550b2f9a0e4624d3c5b.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 218, + 343, + 392, + 367 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 367, + 489, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 492, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 164, + 382 + ], + "score": 1.0, + "content": "Now, for each", + "type": "text" + }, + { + "bbox": [ + 165, + 367, + 175, + 378 + ], + "score": 0.88, + "content": "h _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 363, + 355, + 382 + ], + "score": 1.0, + "content": "in Count-Min sketch, we bound the value of", + "type": "text" + }, + { + "bbox": [ + 356, + 366, + 410, + 379 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\operatorname* { P r } ( e _ { j , \\ell } \\geq \\frac { t } { B } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 363, + 438, + 382 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 439, + 366, + 492, + 379 + ], + "score": 0.91, + "content": "t \\in [ r _ { i } , r _ { i + 1 } )", + "type": "inline_equation" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 447, + 179, + 458 + ], + "lines": [ + { + "bbox": [ + 105, + 445, + 125, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 125, + 460 + ], + "score": 1.0, + "content": "Hen", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 378, + 467, + 510 + ], + "lines": [ + { + "bbox": [ + 126, + 378, + 467, + 509 + ], + "spans": [ + { + "bbox": [ + 126, + 378, + 467, + 509 + ], + "score": 0.67, + "content": "\\begin{array} { r l } & { \\displaystyle \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { t } { B } ) \\leq \\sum _ { q = i } ^ { m - 1 } \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { r _ { q } } { B } | e _ { j , \\varepsilon } < \\frac { r _ { q + 1 } } { B } ) } \\\\ & { \\qquad \\leq \\displaystyle \\sum _ { q = i } ^ { m - 1 } \\frac { \\ln ( \\frac { n } { B } ) + \\ln r _ { q + 1 } } { r _ { q } } = O ( \\frac { 1 } { \\ln ^ { \\gamma } r _ { i + 1 } } ) \\triangleright \\mathfrak { b y } \\ : ( 9 . 5 ) \\ : \\mathrm { a n d } \\ : \\mathrm { C o r o l l a r y } \\ : 9 . 4 } \\\\ & { \\displaystyle \\operatorname* { s e } , \\ : \\mathrm { f o r } \\ : k \\geq 2 , \\ : } \\\\ & { \\qquad \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) \\leq k \\operatorname* { P r } ( e _ { j , 1 } \\geq \\frac { t } { B } | e _ { j , 1 } < \\frac { r _ { i + 1 } } { B } ) \\Pi _ { \\varepsilon = 2 } ^ { k } \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { t } { B } ) } \\\\ & { \\qquad = O \\Big ( \\frac { k ( \\ln \\frac { ( n ) } { B } + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 1 } } \\Big ) \\triangleright \\mathrm { b y } \\ : ( 9 . 5 ) \\ : \\mathrm { a n d } \\ : ( 9 . 6 ) } \\end{array}", + "type": "interline_equation", + "image_path": "03b12616993a48d49d5a7ff6e1b991a418869c662bf36ccfb466296608dbe4e8.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 126, + 378, + 467, + 422.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 126, + 422.0, + 467, + 466.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 126, + 466.0, + 467, + 510.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 516, + 503, + 549 + ], + "lines": [ + { + "bbox": [ + 103, + 514, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 103, + 514, + 192, + 533 + ], + "score": 1.0, + "content": "Next, for each item", + "type": "text" + }, + { + "bbox": [ + 193, + 518, + 199, + 529 + ], + "score": 0.77, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 514, + 389, + 533 + ], + "score": 1.0, + "content": ", we bound the contribution of each interval", + "type": "text" + }, + { + "bbox": [ + 389, + 517, + 429, + 531 + ], + "score": 0.92, + "content": "\\textstyle { \\left( \\frac { r _ { i } } { B } , \\frac { r _ { i + 1 } } { B } \\right) }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 514, + 444, + 533 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 444, + 517, + 467, + 530 + ], + "score": 0.92, + "content": "{ \\bf E } [ e _ { j } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 514, + 506, + 533 + ], + "score": 1.0, + "content": ", namely", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 529, + 196, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 192, + 551 + ], + "score": 0.85, + "content": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 532, + 196, + 549 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 106, + 554, + 400, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 552, + 399, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 192, + 576 + ], + "score": 1.0, + "content": "Claim 9.7. For each", + "type": "text" + }, + { + "bbox": [ + 192, + 559, + 216, + 570 + ], + "score": 0.56, + "content": "i \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 552, + 219, + 576 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 219, + 553, + 399, + 576 + ], + "score": 0.76, + "content": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 578, + 133, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 136, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 136, + 591 + ], + "score": 1.0, + "content": "Proof:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 586, + 496, + 630 + ], + "lines": [ + { + "bbox": [ + 113, + 586, + 496, + 630 + ], + "spans": [ + { + "bbox": [ + 113, + 586, + 496, + 630 + ], + "score": 0.88, + "content": "\\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\bigg ( \\underbrace { \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) } _ { A } + \\underbrace { \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) } _ { B _ { q } } \\bigg ) d x", + "type": "interline_equation", + "image_path": "2d2b3a9bbc470723d0b3f450ac7a9ba4be4a71c029461e9f5a1f7ec0747379e2.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 113, + 586, + 496, + 600.6666666666666 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 113, + 600.6666666666666, + 496, + 615.3333333333333 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 113, + 615.3333333333333, + 496, + 629.9999999999999 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 630, + 229, + 650 + ], + "lines": [ + { + "bbox": [ + 106, + 630, + 227, + 651 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 181, + 647 + ], + "score": 1.0, + "content": "First, we compute", + "type": "text" + }, + { + "bbox": [ + 181, + 630, + 227, + 651 + ], + "score": 0.85, + "content": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } A d x } \\end{array}", + "type": "inline_equation" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 650, + 448, + 713 + ], + "lines": [ + { + "bbox": [ + 162, + 650, + 448, + 713 + ], + "spans": [ + { + "bbox": [ + 162, + 650, + 448, + 713 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) d x \\leq \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { ( B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 1 } ) x } ) d x } \\\\ & { \\qquad = O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } \\end{array}", + "type": "interline_equation", + "image_path": "eaa540b95c08cd2d59c1d4b984f41dec66db15a18f7a903fa0a2ffdfadb231fa.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 162, + 650, + 448, + 671.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 162, + 671.0, + 448, + 692.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 162, + 692.0, + 448, + 713.0 + ], + "spans": [], + "index": 28 + } + ] + } + ], + "page_idx": 13, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 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 2019", + "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" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 488, + 505, + 498 + ], + "lines": [ + { + "bbox": [ + 495, + 489, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 495, + 489, + 505, + 500 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 298, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 495, + 299, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 495, + 299, + 505, + 309 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 447, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 448, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 248, + 96 + ], + "score": 1.0, + "content": "Then, to compute (9.2), we rewrite", + "type": "text" + }, + { + "bbox": [ + 248, + 82, + 271, + 95 + ], + "score": 0.92, + "content": "{ \\bf E } [ e _ { j } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 81, + 354, + 96 + ], + "score": 1.0, + "content": "using the thresholds", + "type": "text" + }, + { + "bbox": [ + 354, + 84, + 400, + 94 + ], + "score": 0.89, + "content": "r _ { 0 } , \\cdots , r _ { m }", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 81, + 448, + 96 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 448, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 116, + 95, + 495, + 191 + ], + "lines": [ + { + "bbox": [ + 116, + 95, + 495, + 191 + ], + "spans": [ + { + "bbox": [ + 116, + 95, + 495, + 191 + ], + "score": 0.92, + "content": "\\begin{array} { l l } { \\displaystyle \\mathbf { E } [ e _ { j } ] = \\int _ { 0 } ^ { \\infty } \\operatorname* { P r } ( e _ { j } \\geq x ) d x } & { \\displaystyle { ( 9 . } } \\\\ { \\displaystyle { = \\int _ { 0 } ^ { \\frac { r _ { 0 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x } } \\\\ { \\displaystyle { \\leq O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } } \\end{array}", + "type": "interline_equation", + "image_path": "7a357b76c8fc95bf504f94a5f90c667f377d34493d4fad1490ac2b33881f4f75.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 116, + 95, + 495, + 127.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 116, + 127.0, + 495, + 159.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 116, + 159.0, + 495, + 191.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 368, + 209 + ], + "lines": [ + { + "bbox": [ + 104, + 192, + 369, + 212 + ], + "spans": [ + { + "bbox": [ + 104, + 192, + 181, + 212 + ], + "score": 1.0, + "content": "Next, we compute", + "type": "text" + }, + { + "bbox": [ + 182, + 194, + 273, + 209 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 192, + 311, + 212 + ], + "score": 1.0, + "content": ") for each", + "type": "text" + }, + { + "bbox": [ + 311, + 195, + 364, + 208 + ], + "score": 0.91, + "content": "t \\in [ r _ { i } , r _ { i + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 192, + 369, + 212 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 104, + 192, + 369, + 212 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 210, + 448, + 232 + ], + "lines": [ + { + "bbox": [ + 102, + 210, + 448, + 234 + ], + "spans": [ + { + "bbox": [ + 102, + 210, + 199, + 234 + ], + "score": 1.0, + "content": "Lemma 9.5. For each", + "type": "text" + }, + { + "bbox": [ + 211, + 210, + 448, + 232 + ], + "score": 0.7, + "content": "\\begin{array} { r } { \\div \\left[ r _ { i } , r _ { i + 1 } \\right) , \\mathrm { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) = O \\Big ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma } r _ { i + 1 } } \\Big ) . } \\end{array}", + "type": "inline_equation", + "image_path": "227bbee75b9b495eebbbcb15b09328033d78c5bdee2a36cf739779bf02741818.jpg" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 102, + 210, + 448, + 234 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 233, + 330, + 245 + ], + "lines": [ + { + "bbox": [ + 106, + 232, + 330, + 247 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 330, + 247 + ], + "score": 1.0, + "content": "Proof: First we prove the following useful observation.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 232, + 330, + 247 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 249, + 444, + 264 + ], + "lines": [ + { + "bbox": [ + 104, + 247, + 436, + 266 + ], + "spans": [ + { + "bbox": [ + 104, + 247, + 212, + 266 + ], + "score": 1.0, + "content": "Claim 9.6. For each item", + "type": "text" + }, + { + "bbox": [ + 212, + 252, + 218, + 263 + ], + "score": 0.79, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 247, + 293, + 266 + ], + "score": 1.0, + "content": "and hash function", + "type": "text" + }, + { + "bbox": [ + 294, + 248, + 436, + 265 + ], + "score": 0.83, + "content": "\\begin{array} { r } { h _ { \\ell } , \\mathbf { E } [ e _ { j , \\ell } \\mid e _ { j , \\ell } < \\frac { r } { B } ] \\le \\frac { \\ln \\left( \\frac { n } { B } \\right) + \\ln r } { B } . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 104, + 247, + 436, + 266 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 267, + 504, + 290 + ], + "lines": [ + { + "bbox": [ + 104, + 266, + 505, + 283 + ], + "spans": [ + { + "bbox": [ + 104, + 266, + 228, + 283 + ], + "score": 1.0, + "content": "Proof: Note that the condition", + "type": "text" + }, + { + "bbox": [ + 229, + 269, + 266, + 281 + ], + "score": 0.93, + "content": "\\begin{array} { r } { e _ { j , \\ell } < \\frac { r } { B } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 266, + 363, + 283 + ], + "score": 1.0, + "content": "implies that for all items", + "type": "text" + }, + { + "bbox": [ + 365, + 268, + 501, + 281 + ], + "score": 0.42, + "content": "\\begin{array} { r } { q < \\frac { B } { r } ( \\mathrm { a n d } q \\neq j ) , h _ { \\ell } ( j ) \\neq h _ { \\ell } ( q ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 266, + 505, + 283 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 277, + 138, + 293 + ], + "spans": [ + { + "bbox": [ + 105, + 277, + 138, + 293 + ], + "score": 1.0, + "content": "Hence,", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 104, + 266, + 505, + 293 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 288, + 442, + 325 + ], + "lines": [ + { + "bbox": [ + 168, + 288, + 442, + 325 + ], + "spans": [ + { + "bbox": [ + 168, + 288, + 442, + 325 + ], + "score": 0.94, + "content": "\\mathbf { E } [ e _ { j , \\ell } \\mid e _ { j , \\ell } < \\frac { r } { B } ] \\leq \\sum _ { q > \\frac { B } { r } } f _ { q } \\cdot \\frac { 1 } { B } \\leq \\frac { \\ln n - \\ln ( \\frac { B } { r } ) } { B } = \\frac { \\ln ( \\frac { n } { B } ) + \\ln r } { B } .", + "type": "interline_equation", + "image_path": "9f6d0a06c65e990ce8a1b41bab234fa871e7aba5a8e530e7a630fd5482adf1cb.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 168, + 288, + 442, + 325 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 332, + 378, + 344 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 379, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 283, + 346 + ], + "score": 1.0, + "content": "Thus, by Markov’s inequality, for each item", + "type": "text" + }, + { + "bbox": [ + 284, + 333, + 289, + 344 + ], + "score": 0.82, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 330, + 364, + 346 + ], + "score": 1.0, + "content": "and hash function", + "type": "text" + }, + { + "bbox": [ + 364, + 333, + 375, + 343 + ], + "score": 0.84, + "content": "h _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 330, + 379, + 346 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 330, + 379, + 346 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 218, + 343, + 392, + 367 + ], + "lines": [ + { + "bbox": [ + 218, + 343, + 392, + 367 + ], + "spans": [ + { + "bbox": [ + 218, + 343, + 392, + 367 + ], + "score": 0.85, + "content": "\\operatorname* { P r } ( e _ { j , \\ell } > \\frac { t } { B } \\mid e _ { j , \\ell } \\leq \\frac { r } { B } ) \\leq \\frac { \\ln ( \\frac { n } { B } ) + \\ln r } { t } .", + "type": "interline_equation", + "image_path": "85cb607bda191b1eec1d65428ee948c16b4f654b3b342550b2f9a0e4624d3c5b.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 218, + 343, + 392, + 367 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 367, + 489, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 363, + 492, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 164, + 382 + ], + "score": 1.0, + "content": "Now, for each", + "type": "text" + }, + { + "bbox": [ + 165, + 367, + 175, + 378 + ], + "score": 0.88, + "content": "h _ { \\ell }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 363, + 355, + 382 + ], + "score": 1.0, + "content": "in Count-Min sketch, we bound the value of", + "type": "text" + }, + { + "bbox": [ + 356, + 366, + 410, + 379 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\operatorname* { P r } ( e _ { j , \\ell } \\geq \\frac { t } { B } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 363, + 438, + 382 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 439, + 366, + 492, + 379 + ], + "score": 0.91, + "content": "t \\in [ r _ { i } , r _ { i + 1 } )", + "type": "inline_equation" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 363, + 492, + 382 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 447, + 179, + 458 + ], + "lines": [ + { + "bbox": [ + 105, + 445, + 125, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 125, + 460 + ], + "score": 1.0, + "content": "Hen", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 445, + 125, + 460 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 378, + 467, + 510 + ], + "lines": [ + { + "bbox": [ + 126, + 378, + 467, + 509 + ], + "spans": [ + { + "bbox": [ + 126, + 378, + 467, + 509 + ], + "score": 0.67, + "content": "\\begin{array} { r l } & { \\displaystyle \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { t } { B } ) \\leq \\sum _ { q = i } ^ { m - 1 } \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { r _ { q } } { B } | e _ { j , \\varepsilon } < \\frac { r _ { q + 1 } } { B } ) } \\\\ & { \\qquad \\leq \\displaystyle \\sum _ { q = i } ^ { m - 1 } \\frac { \\ln ( \\frac { n } { B } ) + \\ln r _ { q + 1 } } { r _ { q } } = O ( \\frac { 1 } { \\ln ^ { \\gamma } r _ { i + 1 } } ) \\triangleright \\mathfrak { b y } \\ : ( 9 . 5 ) \\ : \\mathrm { a n d } \\ : \\mathrm { C o r o l l a r y } \\ : 9 . 4 } \\\\ & { \\displaystyle \\operatorname* { s e } , \\ : \\mathrm { f o r } \\ : k \\geq 2 , \\ : } \\\\ & { \\qquad \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) \\leq k \\operatorname* { P r } ( e _ { j , 1 } \\geq \\frac { t } { B } | e _ { j , 1 } < \\frac { r _ { i + 1 } } { B } ) \\Pi _ { \\varepsilon = 2 } ^ { k } \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { t } { B } ) } \\\\ & { \\qquad = O \\Big ( \\frac { k ( \\ln \\frac { ( n ) } { B } + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 1 } } \\Big ) \\triangleright \\mathrm { b y } \\ : ( 9 . 5 ) \\ : \\mathrm { a n d } \\ : ( 9 . 6 ) } \\end{array}", + "type": "interline_equation", + "image_path": "03b12616993a48d49d5a7ff6e1b991a418869c662bf36ccfb466296608dbe4e8.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 126, + 378, + 467, + 422.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 126, + 422.0, + 467, + 466.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 126, + 466.0, + 467, + 510.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 516, + 503, + 549 + ], + "lines": [ + { + "bbox": [ + 103, + 514, + 506, + 533 + ], + "spans": [ + { + "bbox": [ + 103, + 514, + 192, + 533 + ], + "score": 1.0, + "content": "Next, for each item", + "type": "text" + }, + { + "bbox": [ + 193, + 518, + 199, + 529 + ], + "score": 0.77, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 514, + 389, + 533 + ], + "score": 1.0, + "content": ", we bound the contribution of each interval", + "type": "text" + }, + { + "bbox": [ + 389, + 517, + 429, + 531 + ], + "score": 0.92, + "content": "\\textstyle { \\left( \\frac { r _ { i } } { B } , \\frac { r _ { i + 1 } } { B } \\right) }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 514, + 444, + 533 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 444, + 517, + 467, + 530 + ], + "score": 0.92, + "content": "{ \\bf E } [ e _ { j } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 514, + 506, + 533 + ], + "score": 1.0, + "content": ", namely", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 529, + 196, + 551 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 192, + 551 + ], + "score": 0.85, + "content": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 532, + 196, + 549 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 103, + 514, + 506, + 551 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 554, + 400, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 552, + 399, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 552, + 192, + 576 + ], + "score": 1.0, + "content": "Claim 9.7. For each", + "type": "text" + }, + { + "bbox": [ + 192, + 559, + 216, + 570 + ], + "score": 0.56, + "content": "i \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 552, + 219, + 576 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 219, + 553, + 399, + 576 + ], + "score": 0.76, + "content": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 552, + 399, + 576 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 578, + 133, + 588 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 136, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 136, + 591 + ], + "score": 1.0, + "content": "Proof:", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 576, + 136, + 591 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 586, + 496, + 630 + ], + "lines": [ + { + "bbox": [ + 113, + 586, + 496, + 630 + ], + "spans": [ + { + "bbox": [ + 113, + 586, + 496, + 630 + ], + "score": 0.88, + "content": "\\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\bigg ( \\underbrace { \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) } _ { A } + \\underbrace { \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) } _ { B _ { q } } \\bigg ) d x", + "type": "interline_equation", + "image_path": "2d2b3a9bbc470723d0b3f450ac7a9ba4be4a71c029461e9f5a1f7ec0747379e2.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 113, + 586, + 496, + 600.6666666666666 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 113, + 600.6666666666666, + 496, + 615.3333333333333 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 113, + 615.3333333333333, + 496, + 629.9999999999999 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 630, + 229, + 650 + ], + "lines": [ + { + "bbox": [ + 106, + 630, + 227, + 651 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 181, + 647 + ], + "score": 1.0, + "content": "First, we compute", + "type": "text" + }, + { + "bbox": [ + 181, + 630, + 227, + 651 + ], + "score": 0.85, + "content": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } A d x } \\end{array}", + "type": "inline_equation" + } + ], + "index": 25 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 630, + 227, + 651 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 650, + 448, + 713 + ], + "lines": [ + { + "bbox": [ + 162, + 650, + 448, + 713 + ], + "spans": [ + { + "bbox": [ + 162, + 650, + 448, + 713 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) d x \\leq \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { ( B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 1 } ) x } ) d x } \\\\ & { \\qquad = O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } \\end{array}", + "type": "interline_equation", + "image_path": "eaa540b95c08cd2d59c1d4b984f41dec66db15a18f7a903fa0a2ffdfadb231fa.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 162, + 650, + 448, + 671.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 162, + 671.0, + 448, + 692.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 162, + 692.0, + 448, + 713.0 + ], + "spans": [], + "index": 28 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 80, + 278, + 100 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 280, + 102 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 165, + 102 + ], + "score": 1.0, + "content": "Similarly, R Bri", + "type": "text" + }, + { + "bbox": [ + 149, + 80, + 234, + 101 + ], + "score": 0.79, + "content": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\sum _ { q = i + 1 } ^ { m - 1 } B _ { q } d x } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 84, + 280, + 98 + ], + "score": 1.0, + "content": "is at most:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 100, + 484, + 235 + ], + "lines": [ + { + "bbox": [ + 115, + 100, + 484, + 235 + ], + "spans": [ + { + "bbox": [ + 115, + 100, + 484, + 235 + ], + "score": 0.94, + "content": "\\begin{array} { r l } { \\displaystyle \\int _ { \\frac { r _ { * } } { \\mathtt { B } } } ^ { r _ { * + 1 } } } & { \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) d x = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * + 1 } } { B } } \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { q + 1 } ) } { r _ { q } \\ln ^ { \\gamma ( k - 1 ) } r _ { q + 1 } } ) d x } \\\\ & { \\quad \\quad = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * + 1 } } { B } } \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } O ( \\frac { k } { \\ln ^ { \\gamma k } r _ { q + 1 } } ) d x \\quad \\mathrm { ~ \\mathrm { [ s ~ b y ~ ( } 9 . 3 \\mathrm { ) } ~ } } \\\\ & { \\quad = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * } } { B } } O ( \\frac { k } { \\ln ^ { \\gamma k } r _ { i + 2 } } ) d x \\quad \\mathrm { ~ [ s ~ b y ~ C o r o l l a r y ~ } 9 . 4 } \\\\ & { \\quad = O ( \\frac { k r _ { i + 1 } } { B \\ln ^ { \\gamma k } r _ { i + 2 } } ) = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 2 } ) } { B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 2 } } ) } \\end{array}", + "type": "interline_equation", + "image_path": "e01634972c3100ddde0c1d1a32678f488427047e4d27d0c59681ecd02eed023d.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 115, + 100, + 484, + 145.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 115, + 145.0, + 484, + 190.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 115, + 190.0, + 484, + 235.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 232, + 137, + 242 + ], + "lines": [ + { + "bbox": [ + 106, + 230, + 138, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 138, + 245 + ], + "score": 1.0, + "content": "Hence,", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 112, + 240, + 496, + 337 + ], + "lines": [ + { + "bbox": [ + 112, + 240, + 496, + 337 + ], + "spans": [ + { + "bbox": [ + 112, + 240, + 496, + 337 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = \\displaystyle \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } & \\\\ { \\displaystyle \\qquad \\quad = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) + O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 2 } ) } { B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 2 } } ) } & { \\mathrm { > b y ~ ( 9 . 7 ) - ( 9 . 8 ) } } \\\\ { \\displaystyle \\qquad } & { \\displaystyle \\quad = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \\mathrm { > b y ~ ( 9 . 3 ) } } \\end{array}", + "type": "interline_equation", + "image_path": "c66a5e011cfefb382755659562abd4ceda1a3d4ed7342884b4958a3708dbe9ab.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 112, + 240, + 496, + 272.3333333333333 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 112, + 272.3333333333333, + 496, + 304.66666666666663 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 112, + 304.66666666666663, + 496, + 336.99999999999994 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 345, + 289, + 357 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 289, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 289, + 358 + ], + "score": 1.0, + "content": "Now, we complete the error analysis of (9.4):", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 369, + 493, + 469 + ], + "lines": [ + { + "bbox": [ + 118, + 369, + 493, + 469 + ], + "spans": [ + { + "bbox": [ + 118, + 369, + 493, + 469 + ], + "score": 0.93, + "content": "\\begin{array} { l l } { \\displaystyle \\mathbf { E } [ e _ { j } ] \\leq O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } \\\\ { \\displaystyle \\qquad = O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \\mathrm { ~ \\Rightarrow ~ b y ~ ( 9 . 9 ) ~ } } \\\\ { \\displaystyle \\qquad = O ( \\frac { r _ { 0 } } { B } ) + O ( k \\frac { \\ln \\left( \\frac { n } { B } \\right) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { 1 } } ) + O ( \\frac { k } { B \\ln ^ { \\gamma ( k - 1 ) - 2 } r _ { 1 } } ) } & { \\mathrm { ~ ( 9 . I ~ } } \\end{array}", + "type": "interline_equation", + "image_path": "3ef19672c73ce5af874fb018e644ee165bf9c6198706fbeeae80d9def6eb4708.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 118, + 369, + 493, + 402.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 118, + 402.3333333333333, + 493, + 435.66666666666663 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 118, + 435.66666666666663, + 493, + 468.99999999999994 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 467, + 504, + 489 + ], + "lines": [ + { + "bbox": [ + 105, + 465, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 208, + 480 + ], + "score": 1.0, + "content": "Note that (9.10) requires", + "type": "text" + }, + { + "bbox": [ + 208, + 468, + 281, + 479 + ], + "score": 0.9, + "content": "\\gamma ( k - 1 ) - 2 \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 465, + 396, + 480 + ], + "score": 1.0, + "content": "which is satisfied by setting", + "type": "text" + }, + { + "bbox": [ + 396, + 467, + 457, + 479 + ], + "score": 0.92, + "content": "\\gamma = 3 / ( k - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 465, + 475, + 480 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 476, + 468, + 501, + 478 + ], + "score": 0.9, + "content": "k \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 465, + 505, + 480 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 476, + 197, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 476, + 186, + 491 + ], + "score": 1.0, + "content": "Thus, for each item", + "type": "text" + }, + { + "bbox": [ + 187, + 479, + 192, + 489 + ], + "score": 0.77, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 476, + 197, + 491 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 487, + 379, + 516 + ], + "lines": [ + { + "bbox": [ + 232, + 487, + 379, + 516 + ], + "spans": [ + { + "bbox": [ + 232, + 487, + 379, + 516 + ], + "score": 0.94, + "content": "\\mathbf { E } [ e _ { j } ] = O ( r _ { 0 } / B ) = O ( \\frac { \\ln ^ { \\frac { k + 2 } { k - 1 } } ( \\frac { n } { B } ) } { B } )", + "type": "interline_equation", + "image_path": "da676f3303b538007b0180276c707aace396277fa80082e8689f0c1f75cc924d.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 232, + 487, + 379, + 516 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 524, + 505, + 570 + ], + "lines": [ + { + "bbox": [ + 105, + 523, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 357, + 540 + ], + "score": 1.0, + "content": "Lemma 9.8. The expected error of Count-Min sketch of size", + "type": "text" + }, + { + "bbox": [ + 358, + 525, + 386, + 536 + ], + "score": 0.89, + "content": "k \\times B", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 523, + 412, + 540 + ], + "score": 1.0, + "content": "(with", + "type": "text" + }, + { + "bbox": [ + 412, + 525, + 441, + 537 + ], + "score": 0.84, + "content": "k \\geq 2 ,", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 523, + 506, + 540 + ], + "score": 1.0, + "content": ") for estimating", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 102, + 534, + 501, + 561 + ], + "spans": [ + { + "bbox": [ + 102, + 534, + 303, + 561 + ], + "score": 1.0, + "content": "items whose frequency distribution is Zipfian is", + "type": "text" + }, + { + "bbox": [ + 303, + 536, + 379, + 556 + ], + "score": 0.92, + "content": "O ( \\frac { \\ln n \\ln ^ { \\frac { k + 2 } { k - 1 } } ( n / B ) } { B } )", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 534, + 452, + 561 + ], + "score": 1.0, + "content": ". In particular, if", + "type": "text" + }, + { + "bbox": [ + 453, + 543, + 501, + 555 + ], + "score": 0.9, + "content": "B = \\Theta ( n )", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 554, + 246, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 126, + 572 + ], + "score": 1.0, + "content": "then", + "type": "text" + }, + { + "bbox": [ + 126, + 555, + 241, + 570 + ], + "score": 0.9, + "content": "\\begin{array} { r } { { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { \\mathcal { F } } } _ { C M } ) ] = O ( \\frac { \\ln n } { n } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 554, + 246, + 572 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 105, + 572, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "Proof: By plugging in our upper bound on the estimation error of each item computed in (9.11) in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 582, + 452, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 452, + 597 + ], + "score": 1.0, + "content": "the definition of expected estimation error of Count-Min (9.2), we have the following.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 594, + 423, + 628 + ], + "lines": [ + { + "bbox": [ + 186, + 594, + 423, + 628 + ], + "spans": [ + { + "bbox": [ + 186, + 594, + 423, + 628 + ], + "score": 0.93, + "content": "\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { C M } ) ] = \\sum _ { j = 1 } ^ { n } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } = O ( \\frac { \\ln ^ { \\frac { k + 2 } { k - 1 } } \\left( \\frac { n } { B } \\right) } { B } \\cdot \\ln n ) .", + "type": "interline_equation", + "image_path": "1768b86ecfae2a60babb0a4b95ab784ed55549853562717d3b9469c4b74fb289.jpg" + } + ] + } + ], + "index": 20.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 594, + 423, + 611.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 186, + 611.0, + 423, + 628.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 635, + 505, + 659 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 433, + 649 + ], + "score": 1.0, + "content": "Next, we show a lower bound on the expected error of Count-Min sketch with", + "type": "text" + }, + { + "bbox": [ + 434, + 637, + 443, + 646 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 635, + 505, + 649 + ], + "score": 1.0, + "content": "buckets (more", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 647, + 461, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 176, + 660 + ], + "score": 1.0, + "content": "precisely, of size", + "type": "text" + }, + { + "bbox": [ + 176, + 647, + 220, + 659 + ], + "score": 0.9, + "content": "( \\boldsymbol { k } \\times \\boldsymbol { B } / k ) .", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 647, + 461, + 660 + ], + "score": 1.0, + "content": ") for estimating the frequency of items that follow Zipf Law.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 107, + 662, + 402, + 676 + ], + "lines": [ + { + "bbox": [ + 105, + 660, + 402, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 238, + 678 + ], + "score": 1.0, + "content": "Observation 9.9. For each item", + "type": "text" + }, + { + "bbox": [ + 239, + 664, + 244, + 675 + ], + "score": 0.46, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 662, + 399, + 676 + ], + "score": 0.9, + "content": "\\begin{array} { r } { , \\operatorname* { P r } [ e _ { j } \\geq 1 / ( 2 ( \\frac { B } { k } ) \\ln k + 1 ) ] \\geq 1 - \\frac { 1 } { k } . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 660, + 402, + 678 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 679, + 505, + 709 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 195, + 693 + ], + "score": 1.0, + "content": "Proof: For each item", + "type": "text" + }, + { + "bbox": [ + 195, + 681, + 201, + 692 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 678, + 351, + 693 + ], + "score": 1.0, + "content": ", the probability that none of the first", + "type": "text" + }, + { + "bbox": [ + 351, + 679, + 408, + 693 + ], + "score": 0.92, + "content": "2 \\big ( \\frac { B } { k } \\big ) \\ln k + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "items (excluding itself)", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 104, + 687, + 501, + 712 + ], + "spans": [ + { + "bbox": [ + 104, + 687, + 307, + 712 + ], + "score": 1.0, + "content": "collide with it in at least one of the hash functions", + "type": "text" + }, + { + "bbox": [ + 307, + 695, + 352, + 706 + ], + "score": 0.92, + "content": "h _ { 1 } , \\cdots , h _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 687, + 394, + 712 + ], + "score": 1.0, + "content": "is at most", + "type": "text" + }, + { + "bbox": [ + 395, + 692, + 501, + 709 + ], + "score": 0.93, + "content": "\\begin{array} { r } { k ( 1 - \\frac { 1 } { ( B / k ) } ) ^ { 2 ( \\frac { B } { k } ) \\ln k } \\le \\frac { 1 } { k } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 26 + } + ], + "index": 25.5 + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2019", + "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" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 605, + 504, + 615 + ], + "lines": [ + { + "bbox": [ + 496, + 606, + 504, + 616 + ], + "spans": [ + { + "bbox": [ + 496, + 606, + 504, + 616 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 495, + 328, + 504, + 338 + ], + "lines": [ + { + "bbox": [ + 495, + 328, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 495, + 328, + 505, + 340 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 80, + 278, + 100 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 280, + 102 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 165, + 102 + ], + "score": 1.0, + "content": "Similarly, R Bri", + "type": "text" + }, + { + "bbox": [ + 149, + 80, + 234, + 101 + ], + "score": 0.79, + "content": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\sum _ { q = i + 1 } ^ { m - 1 } B _ { q } d x } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 84, + 280, + 98 + ], + "score": 1.0, + "content": "is at most:", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 80, + 280, + 102 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 100, + 484, + 235 + ], + "lines": [ + { + "bbox": [ + 115, + 100, + 484, + 235 + ], + "spans": [ + { + "bbox": [ + 115, + 100, + 484, + 235 + ], + "score": 0.94, + "content": "\\begin{array} { r l } { \\displaystyle \\int _ { \\frac { r _ { * } } { \\mathtt { B } } } ^ { r _ { * + 1 } } } & { \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) d x = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * + 1 } } { B } } \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { q + 1 } ) } { r _ { q } \\ln ^ { \\gamma ( k - 1 ) } r _ { q + 1 } } ) d x } \\\\ & { \\quad \\quad = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * + 1 } } { B } } \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } O ( \\frac { k } { \\ln ^ { \\gamma k } r _ { q + 1 } } ) d x \\quad \\mathrm { ~ \\mathrm { [ s ~ b y ~ ( } 9 . 3 \\mathrm { ) } ~ } } \\\\ & { \\quad = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * } } { B } } O ( \\frac { k } { \\ln ^ { \\gamma k } r _ { i + 2 } } ) d x \\quad \\mathrm { ~ [ s ~ b y ~ C o r o l l a r y ~ } 9 . 4 } \\\\ & { \\quad = O ( \\frac { k r _ { i + 1 } } { B \\ln ^ { \\gamma k } r _ { i + 2 } } ) = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 2 } ) } { B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 2 } } ) } \\end{array}", + "type": "interline_equation", + "image_path": "e01634972c3100ddde0c1d1a32678f488427047e4d27d0c59681ecd02eed023d.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 115, + 100, + 484, + 145.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 115, + 145.0, + 484, + 190.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 115, + 190.0, + 484, + 235.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 232, + 137, + 242 + ], + "lines": [ + { + "bbox": [ + 106, + 230, + 138, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 138, + 245 + ], + "score": 1.0, + "content": "Hence,", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 230, + 138, + 245 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 112, + 240, + 496, + 337 + ], + "lines": [ + { + "bbox": [ + 112, + 240, + 496, + 337 + ], + "spans": [ + { + "bbox": [ + 112, + 240, + 496, + 337 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = \\displaystyle \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } & \\\\ { \\displaystyle \\qquad \\quad = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) + O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 2 } ) } { B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 2 } } ) } & { \\mathrm { > b y ~ ( 9 . 7 ) - ( 9 . 8 ) } } \\\\ { \\displaystyle \\qquad } & { \\displaystyle \\quad = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \\mathrm { > b y ~ ( 9 . 3 ) } } \\end{array}", + "type": "interline_equation", + "image_path": "c66a5e011cfefb382755659562abd4ceda1a3d4ed7342884b4958a3708dbe9ab.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 112, + 240, + 496, + 272.3333333333333 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 112, + 272.3333333333333, + 496, + 304.66666666666663 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 112, + 304.66666666666663, + 496, + 336.99999999999994 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 345, + 289, + 357 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 289, + 358 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 289, + 358 + ], + "score": 1.0, + "content": "Now, we complete the error analysis of (9.4):", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 344, + 289, + 358 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 369, + 493, + 469 + ], + "lines": [ + { + "bbox": [ + 118, + 369, + 493, + 469 + ], + "spans": [ + { + "bbox": [ + 118, + 369, + 493, + 469 + ], + "score": 0.93, + "content": "\\begin{array} { l l } { \\displaystyle \\mathbf { E } [ e _ { j } ] \\leq O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } \\\\ { \\displaystyle \\qquad = O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \\mathrm { ~ \\Rightarrow ~ b y ~ ( 9 . 9 ) ~ } } \\\\ { \\displaystyle \\qquad = O ( \\frac { r _ { 0 } } { B } ) + O ( k \\frac { \\ln \\left( \\frac { n } { B } \\right) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { 1 } } ) + O ( \\frac { k } { B \\ln ^ { \\gamma ( k - 1 ) - 2 } r _ { 1 } } ) } & { \\mathrm { ~ ( 9 . I ~ } } \\end{array}", + "type": "interline_equation", + "image_path": "3ef19672c73ce5af874fb018e644ee165bf9c6198706fbeeae80d9def6eb4708.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 118, + 369, + 493, + 402.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 118, + 402.3333333333333, + 493, + 435.66666666666663 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 118, + 435.66666666666663, + 493, + 468.99999999999994 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 467, + 504, + 489 + ], + "lines": [ + { + "bbox": [ + 105, + 465, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 465, + 208, + 480 + ], + "score": 1.0, + "content": "Note that (9.10) requires", + "type": "text" + }, + { + "bbox": [ + 208, + 468, + 281, + 479 + ], + "score": 0.9, + "content": "\\gamma ( k - 1 ) - 2 \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 465, + 396, + 480 + ], + "score": 1.0, + "content": "which is satisfied by setting", + "type": "text" + }, + { + "bbox": [ + 396, + 467, + 457, + 479 + ], + "score": 0.92, + "content": "\\gamma = 3 / ( k - 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 465, + 475, + 480 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 476, + 468, + 501, + 478 + ], + "score": 0.9, + "content": "k \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 465, + 505, + 480 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 476, + 197, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 476, + 186, + 491 + ], + "score": 1.0, + "content": "Thus, for each item", + "type": "text" + }, + { + "bbox": [ + 187, + 479, + 192, + 489 + ], + "score": 0.77, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 476, + 197, + 491 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 465, + 505, + 491 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 232, + 487, + 379, + 516 + ], + "lines": [ + { + "bbox": [ + 232, + 487, + 379, + 516 + ], + "spans": [ + { + "bbox": [ + 232, + 487, + 379, + 516 + ], + "score": 0.94, + "content": "\\mathbf { E } [ e _ { j } ] = O ( r _ { 0 } / B ) = O ( \\frac { \\ln ^ { \\frac { k + 2 } { k - 1 } } ( \\frac { n } { B } ) } { B } )", + "type": "interline_equation", + "image_path": "da676f3303b538007b0180276c707aace396277fa80082e8689f0c1f75cc924d.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 232, + 487, + 379, + 516 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 524, + 505, + 570 + ], + "lines": [ + { + "bbox": [ + 105, + 523, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 357, + 540 + ], + "score": 1.0, + "content": "Lemma 9.8. The expected error of Count-Min sketch of size", + "type": "text" + }, + { + "bbox": [ + 358, + 525, + 386, + 536 + ], + "score": 0.89, + "content": "k \\times B", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 523, + 412, + 540 + ], + "score": 1.0, + "content": "(with", + "type": "text" + }, + { + "bbox": [ + 412, + 525, + 441, + 537 + ], + "score": 0.84, + "content": "k \\geq 2 ,", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 523, + 506, + 540 + ], + "score": 1.0, + "content": ") for estimating", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 102, + 534, + 501, + 561 + ], + "spans": [ + { + "bbox": [ + 102, + 534, + 303, + 561 + ], + "score": 1.0, + "content": "items whose frequency distribution is Zipfian is", + "type": "text" + }, + { + "bbox": [ + 303, + 536, + 379, + 556 + ], + "score": 0.92, + "content": "O ( \\frac { \\ln n \\ln ^ { \\frac { k + 2 } { k - 1 } } ( n / B ) } { B } )", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 534, + 452, + 561 + ], + "score": 1.0, + "content": ". In particular, if", + "type": "text" + }, + { + "bbox": [ + 453, + 543, + 501, + 555 + ], + "score": 0.9, + "content": "B = \\Theta ( n )", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 554, + 246, + 572 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 126, + 572 + ], + "score": 1.0, + "content": "then", + "type": "text" + }, + { + "bbox": [ + 126, + 555, + 241, + 570 + ], + "score": 0.9, + "content": "\\begin{array} { r } { { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { \\mathcal { F } } } _ { C M } ) ] = O ( \\frac { \\ln n } { n } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 554, + 246, + 572 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 102, + 523, + 506, + 572 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 572, + 505, + 594 + ], + "lines": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 106, + 572, + 505, + 584 + ], + "score": 1.0, + "content": "Proof: By plugging in our upper bound on the estimation error of each item computed in (9.11) in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 582, + 452, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 452, + 597 + ], + "score": 1.0, + "content": "the definition of expected estimation error of Count-Min (9.2), we have the following.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 572, + 505, + 597 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 594, + 423, + 628 + ], + "lines": [ + { + "bbox": [ + 186, + 594, + 423, + 628 + ], + "spans": [ + { + "bbox": [ + 186, + 594, + 423, + 628 + ], + "score": 0.93, + "content": "\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { C M } ) ] = \\sum _ { j = 1 } ^ { n } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } = O ( \\frac { \\ln ^ { \\frac { k + 2 } { k - 1 } } \\left( \\frac { n } { B } \\right) } { B } \\cdot \\ln n ) .", + "type": "interline_equation", + "image_path": "1768b86ecfae2a60babb0a4b95ab784ed55549853562717d3b9469c4b74fb289.jpg" + } + ] + } + ], + "index": 20.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 594, + 423, + 611.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 186, + 611.0, + 423, + 628.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 635, + 505, + 659 + ], + "lines": [ + { + "bbox": [ + 105, + 635, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 635, + 433, + 649 + ], + "score": 1.0, + "content": "Next, we show a lower bound on the expected error of Count-Min sketch with", + "type": "text" + }, + { + "bbox": [ + 434, + 637, + 443, + 646 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 635, + 505, + 649 + ], + "score": 1.0, + "content": "buckets (more", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 647, + 461, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 176, + 660 + ], + "score": 1.0, + "content": "precisely, of size", + "type": "text" + }, + { + "bbox": [ + 176, + 647, + 220, + 659 + ], + "score": 0.9, + "content": "( \\boldsymbol { k } \\times \\boldsymbol { B } / k ) .", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 647, + 461, + 660 + ], + "score": 1.0, + "content": ") for estimating the frequency of items that follow Zipf Law.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 635, + 505, + 660 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 662, + 402, + 676 + ], + "lines": [ + { + "bbox": [ + 105, + 660, + 402, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 238, + 678 + ], + "score": 1.0, + "content": "Observation 9.9. For each item", + "type": "text" + }, + { + "bbox": [ + 239, + 664, + 244, + 675 + ], + "score": 0.46, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 662, + 399, + 676 + ], + "score": 0.9, + "content": "\\begin{array} { r } { , \\operatorname* { P r } [ e _ { j } \\geq 1 / ( 2 ( \\frac { B } { k } ) \\ln k + 1 ) ] \\geq 1 - \\frac { 1 } { k } . } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 660, + 402, + 678 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 660, + 402, + 678 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 679, + 505, + 709 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 195, + 693 + ], + "score": 1.0, + "content": "Proof: For each item", + "type": "text" + }, + { + "bbox": [ + 195, + 681, + 201, + 692 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 678, + 351, + 693 + ], + "score": 1.0, + "content": ", the probability that none of the first", + "type": "text" + }, + { + "bbox": [ + 351, + 679, + 408, + 693 + ], + "score": 0.92, + "content": "2 \\big ( \\frac { B } { k } \\big ) \\ln k + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "items (excluding itself)", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 104, + 687, + 501, + 712 + ], + "spans": [ + { + "bbox": [ + 104, + 687, + 307, + 712 + ], + "score": 1.0, + "content": "collide with it in at least one of the hash functions", + "type": "text" + }, + { + "bbox": [ + 307, + 695, + 352, + 706 + ], + "score": 0.92, + "content": "h _ { 1 } , \\cdots , h _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 687, + 394, + 712 + ], + "score": 1.0, + "content": "is at most", + "type": "text" + }, + { + "bbox": [ + 395, + 692, + 501, + 709 + ], + "score": 0.93, + "content": "\\begin{array} { r } { k ( 1 - \\frac { 1 } { ( B / k ) } ) ^ { 2 ( \\frac { B } { k } ) \\ln k } \\le \\frac { 1 } { k } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 104, + 678, + 505, + 712 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 81, + 505, + 108 + ], + "lines": [ + { + "bbox": [ + 104, + 79, + 507, + 99 + ], + "spans": [ + { + "bbox": [ + 104, + 79, + 237, + 99 + ], + "score": 1.0, + "content": "Hence, with probability at least", + "type": "text" + }, + { + "bbox": [ + 237, + 81, + 263, + 96 + ], + "score": 0.92, + "content": "\\textstyle 1 - { \\frac { 1 } { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 79, + 327, + 99 + ], + "score": 1.0, + "content": ", the estimation", + "type": "text" + }, + { + "bbox": [ + 328, + 81, + 338, + 95 + ], + "score": 0.89, + "content": "\\tilde { f } _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 79, + 507, + 99 + ], + "score": 1.0, + "content": "includes the frequency of one of the top", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 94, + 504, + 109 + ], + "spans": [ + { + "bbox": [ + 107, + 94, + 164, + 109 + ], + "score": 0.91, + "content": "2 ( \\textstyle { \\frac { B } { k } } ) \\ln k + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 94, + 227, + 109 + ], + "score": 1.0, + "content": "frequent items.", + "type": "text" + }, + { + "bbox": [ + 496, + 99, + 504, + 104 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 105, + 111, + 505, + 141 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 357, + 125 + ], + "score": 1.0, + "content": "Lemma 9.10. The expected error of Count-Min sketch of size", + "type": "text" + }, + { + "bbox": [ + 358, + 111, + 393, + 126 + ], + "score": 0.94, + "content": "\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "for estimating items whose", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 124, + 320, + 142 + ], + "spans": [ + { + "bbox": [ + 104, + 124, + 278, + 142 + ], + "score": 1.0, + "content": "frequency distribution is Zipfian is at least", + "type": "text" + }, + { + "bbox": [ + 278, + 124, + 315, + 141 + ], + "score": 0.93, + "content": "\\frac { ( k - 1 ) \\ln { n } } { 2 B \\ln { k } + k }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 124, + 320, + 142 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 106, + 143, + 450, + 160 + ], + "lines": [ + { + "bbox": [ + 103, + 141, + 453, + 165 + ], + "spans": [ + { + "bbox": [ + 103, + 141, + 252, + 165 + ], + "score": 1.0, + "content": "Proof: Observation 9.9 implies that", + "type": "text" + }, + { + "bbox": [ + 253, + 144, + 415, + 162 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathbf { E } [ e _ { j } ] \\geq ( 1 - \\frac { 1 } { k } ) \\frac { 1 } { 2 ( \\frac { B } { k } ) \\ln k + 1 } = \\frac { k - 1 } { 2 B \\ln k + k } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 141, + 453, + 165 + ], + "score": 1.0, + "content": ". Hence,", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 174, + 155, + 437, + 215 + ], + "lines": [ + { + "bbox": [ + 174, + 155, + 437, + 215 + ], + "spans": [ + { + "bbox": [ + 174, + 155, + 437, + 215 + ], + "score": 0.73, + "content": "\\begin{array} { r l } { { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\mathcal { \\tilde { F } } _ { C M } ) ] = \\sum _ { j \\in [ n ] } ^ { } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } } \\\\ & { \\geq ( \\frac { k - 1 } { 2 B \\ln k + k } ) \\ln n \\quad \\triangleright \\mathrm { B y ~ O b s e r v a t i o n } 9 . 1 } \\end{array}", + "type": "interline_equation", + "image_path": "7ed698904f123de337fc310b6d11a21a65fa2b61646d935857a55110b1969b46.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 174, + 155, + 437, + 175.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 174, + 175.0, + 437, + 195.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 174, + 195.0, + 437, + 215.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 220, + 506, + 255 + ], + "lines": [ + { + "bbox": [ + 105, + 218, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 359, + 236 + ], + "score": 1.0, + "content": "Theorem 9.11. The expected error of Count-Min sketch of size", + "type": "text" + }, + { + "bbox": [ + 359, + 220, + 392, + 234 + ], + "score": 0.93, + "content": "\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 218, + 506, + 236 + ], + "score": 1.0, + "content": "on estimating the frequency", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 233, + 462, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 290, + 256 + ], + "score": 1.0, + "content": "of n items from Zipfian distribution is at least", + "type": "text" + }, + { + "bbox": [ + 290, + 240, + 328, + 255 + ], + "score": 0.92, + "content": "\\Omega \\big ( \\frac { k \\ln n } { B \\ln k } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 239, + 379, + 256 + ], + "score": 1.0, + "content": "and at most", + "type": "text" + }, + { + "bbox": [ + 379, + 233, + 456, + 255 + ], + "score": 0.92, + "content": "O ( \\frac { k \\ln n \\ln ^ { \\frac { k + 2 } { k - 1 } } ( \\frac { k n } { B } ) } { B } )", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 233, + 462, + 253 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 108, + 257, + 505, + 283 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 215, + 272 + ], + "score": 1.0, + "content": "In particular, for the case", + "type": "text" + }, + { + "bbox": [ + 216, + 258, + 262, + 270 + ], + "score": 0.93, + "content": "B = \\Theta ( n )", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 257, + 283, + 272 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 283, + 258, + 327, + 270 + ], + "score": 0.91, + "content": "k = O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 257, + 506, + 272 + ], + "score": 1.0, + "content": ", the expected error of Count-Min sketch is", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 266, + 145, + 288 + ], + "spans": [ + { + "bbox": [ + 107, + 270, + 138, + 284 + ], + "score": 0.92, + "content": "\\Theta \\big ( \\textstyle { \\frac { \\ln n } { B } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 266, + 145, + 288 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 107, + 285, + 506, + 320 + ], + "lines": [ + { + "bbox": [ + 105, + 285, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 506, + 298 + ], + "score": 1.0, + "content": "Proof: The proof follows from Lemma 9.8 and 9.10. We remark that the bound in Lemma 9.8 is for", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 343, + 309 + ], + "score": 1.0, + "content": "the expected estimation error of Count-Min sketch of size", + "type": "text" + }, + { + "bbox": [ + 344, + 297, + 371, + 307 + ], + "score": 0.91, + "content": "k \\times B", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 295, + 506, + 309 + ], + "score": 1.0, + "content": ". Hence, to get the bound on the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 307, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 252, + 320 + ], + "score": 1.0, + "content": "expected error of Count-Min of size", + "type": "text" + }, + { + "bbox": [ + 253, + 307, + 288, + 320 + ], + "score": 0.93, + "content": "\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 307, + 358, + 320 + ], + "score": 1.0, + "content": ", we must replace", + "type": "text" + }, + { + "bbox": [ + 359, + 308, + 368, + 317 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 307, + 389, + 320 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 390, + 307, + 409, + 320 + ], + "score": 0.92, + "content": "B / k", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 307, + 413, + 320 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 494, + 307, + 505, + 318 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "title", + "bbox": [ + 107, + 329, + 263, + 341 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 264, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 264, + 342 + ], + "score": 1.0, + "content": "9.3. LEARNED COUNT-MIN SKETCH", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 105, + 348, + 505, + 376 + ], + "lines": [ + { + "bbox": [ + 104, + 347, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 104, + 347, + 174, + 363 + ], + "score": 1.0, + "content": "Definition 9.12", + "type": "text" + }, + { + "bbox": [ + 175, + 350, + 182, + 361 + ], + "score": 0.79, + "content": "\\dot { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 347, + 335, + 363 + ], + "score": 1.0, + "content": "-HeavyHitter). Given a set of items", + "type": "text" + }, + { + "bbox": [ + 335, + 349, + 411, + 362 + ], + "score": 0.92, + "content": "\\mathcal { T } = \\{ i _ { 1 } , \\cdots , i _ { n } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 347, + 484, + 363 + ], + "score": 1.0, + "content": "with frequencies", + "type": "text" + }, + { + "bbox": [ + 484, + 347, + 505, + 362 + ], + "score": 0.88, + "content": "{ \\vec { f } } =", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 107, + 361, + 361, + 376 + ], + "spans": [ + { + "bbox": [ + 107, + 362, + 158, + 375 + ], + "score": 0.91, + "content": "\\langle f _ { 1 } , \\cdots , f _ { n } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 361, + 194, + 376 + ], + "score": 1.0, + "content": ", an item", + "type": "text" + }, + { + "bbox": [ + 195, + 364, + 201, + 375 + ], + "score": 0.76, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 361, + 218, + 376 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 219, + 363, + 226, + 375 + ], + "score": 0.82, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 361, + 289, + 376 + ], + "score": 1.0, + "content": "-HeavyHitter of", + "type": "text" + }, + { + "bbox": [ + 290, + 363, + 298, + 373 + ], + "score": 0.37, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 361, + 307, + 376 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 307, + 361, + 357, + 375 + ], + "score": 0.84, + "content": "f _ { j } \\geq \\phi | | { \\vec { f } } | | _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 361, + 361, + 376 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 104, + 377, + 504, + 401 + ], + "lines": [ + { + "bbox": [ + 105, + 376, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 314, + 391 + ], + "score": 1.0, + "content": "Remark 9.13. If the frequency distribution of items", + "type": "text" + }, + { + "bbox": [ + 314, + 378, + 322, + 388 + ], + "score": 0.69, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 376, + 440, + 391 + ], + "score": 1.0, + "content": "is Zipfian, then the number of", + "type": "text" + }, + { + "bbox": [ + 441, + 378, + 447, + 389 + ], + "score": 0.82, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 376, + 505, + 391 + ], + "score": 1.0, + "content": "-HeavyHitters", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 387, + 329, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 147, + 403 + ], + "score": 1.0, + "content": "is at most", + "type": "text" + }, + { + "bbox": [ + 147, + 389, + 189, + 401 + ], + "score": 0.91, + "content": "1 / ( \\phi \\ln n )", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 387, + 257, + 403 + ], + "score": 1.0, + "content": ". In other words,", + "type": "text" + }, + { + "bbox": [ + 258, + 388, + 325, + 401 + ], + "score": 0.93, + "content": "B _ { r } \\leq ( \\phi \\ln n ) ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 387, + 329, + 403 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 106, + 409, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 106, + 410, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 353, + 421 + ], + "score": 1.0, + "content": "To recall, in our Learned Count-Min sketch with parameters", + "type": "text" + }, + { + "bbox": [ + 354, + 410, + 386, + 421 + ], + "score": 0.89, + "content": "( B _ { r } , B )", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 410, + 391, + 421 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 391, + 410, + 404, + 421 + ], + "score": 0.76, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 410, + 505, + 421 + ], + "score": 1.0, + "content": "buckets are reserved for", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 421, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 505, + 432 + ], + "score": 1.0, + "content": "the frequent items returned by HH and the rest of items are fed to a Count-Min sketch of size", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 429, + 507, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 158, + 445 + ], + "score": 0.93, + "content": "\\begin{array} { r } { k \\times \\left( \\frac { B ^ { \\star } - B _ { r } } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 429, + 187, + 447 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 187, + 433, + 194, + 442 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 429, + 507, + 447 + ], + "score": 1.0, + "content": "is a parameter to be determined. We emphasize that the space complexity of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 443, + 397, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 279, + 456 + ], + "score": 1.0, + "content": "Learned Count-Min sketch with parameter", + "type": "text" + }, + { + "bbox": [ + 279, + 443, + 312, + 456 + ], + "score": 0.93, + "content": "( B _ { r } , B )", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 443, + 322, + 456 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 323, + 443, + 393, + 456 + ], + "score": 0.93, + "content": "B _ { r } + B = O ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 443, + 397, + 456 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 106, + 458, + 505, + 500 + ], + "lines": [ + { + "bbox": [ + 106, + 457, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 505, + 471 + ], + "score": 1.0, + "content": "Theorem 9.14. The optimal expected error of Learned Count-Min sketches with parameters", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 465, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 107, + 472, + 140, + 485 + ], + "score": 0.92, + "content": "( B _ { r } , B )", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 465, + 183, + 489 + ], + "score": 1.0, + "content": "is at most", + "type": "text" + }, + { + "bbox": [ + 183, + 469, + 247, + 487 + ], + "score": 0.93, + "content": "\\frac { ( \\ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } }", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 465, + 321, + 489 + ], + "score": 1.0, + "content": ". In particular, for", + "type": "text" + }, + { + "bbox": [ + 321, + 472, + 406, + 485 + ], + "score": 0.68, + "content": "B _ { r } = \\Theta ( B ) = \\Theta ( n )", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 465, + 410, + 489 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 411, + 471, + 505, + 485 + ], + "score": 0.82, + "content": "\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { L - C M } ) ] =", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 483, + 137, + 503 + ], + "spans": [ + { + "bbox": [ + 107, + 486, + 130, + 500 + ], + "score": 0.9, + "content": "O ( { \\textstyle { \\frac { 1 } { n } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 483, + 137, + 503 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 501, + 504, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 499, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 231, + 515 + ], + "score": 1.0, + "content": "Proof: Since, the count of top", + "type": "text" + }, + { + "bbox": [ + 231, + 502, + 244, + 513 + ], + "score": 0.88, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 499, + 469, + 515 + ], + "score": 1.0, + "content": "frequent items are stored in their own buckets, for each", + "type": "text" + }, + { + "bbox": [ + 469, + 502, + 501, + 513 + ], + "score": 0.9, + "content": "j \\le B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 499, + 506, + 515 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 512, + 171, + 525 + ], + "spans": [ + { + "bbox": [ + 107, + 513, + 135, + 525 + ], + "score": 0.9, + "content": "e _ { j } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 512, + 171, + 525 + ], + "score": 1.0, + "content": ". Hence,", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 521, + 448, + 608 + ], + "lines": [ + { + "bbox": [ + 164, + 521, + 448, + 608 + ], + "spans": [ + { + "bbox": [ + 164, + 521, + 448, + 608 + ], + "score": 0.93, + "content": "\\begin{array} { l } { { \\displaystyle { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { F } } _ { L - C M } ) ] = \\sum _ { j \\in [ n ] } { \\bf E } [ e _ { j } ] \\cdot f _ { j } } \\ ~ } \\\\ { { \\displaystyle ~ = \\sum _ { j > B _ { r } } { \\bf E } [ e _ { j } ] \\cdot f _ { j } \\quad \\triangleright \\forall j \\le B _ { r } , e _ { j } = 0 } \\ ~ } \\\\ { { \\displaystyle ~ < \\frac { ( \\ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } } \\quad } { \\displaystyle \\triangleright \\mathrm { B y ~ O b s e r v a t i o n ~ } } 9 . 1 } \\end{array}", + "type": "interline_equation", + "image_path": "59fa12f35b1162a49011e634459127ebd231af332c0999eccef0a25cfb8ad4b5.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 164, + 521, + 448, + 550.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 164, + 550.0, + 448, + 579.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 164, + 579.0, + 448, + 608.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 606, + 505, + 628 + ], + "lines": [ + { + "bbox": [ + 106, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "Note that the last inequality follows from the guarantee of single hash functions; in other words,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 135, + 628 + ], + "score": 1.0, + "content": "setting", + "type": "text" + }, + { + "bbox": [ + 136, + 617, + 160, + 627 + ], + "score": 0.91, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 616, + 263, + 628 + ], + "score": 1.0, + "content": "in the Count-Min sketch.", + "type": "text" + }, + { + "bbox": [ + 494, + 617, + 505, + 628 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "title", + "bbox": [ + 106, + 636, + 444, + 649 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 443, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 443, + 650 + ], + "score": 1.0, + "content": "9.3.1. LEARNED COUNT-MIN SKETCH USING NOISY HEAVYHITTERS ORACLE", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 506, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 653, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 462, + 667 + ], + "score": 1.0, + "content": "Unlike the previous part, here we assume that we are given a noisy HeavyHitters oracle", + "type": "text" + }, + { + "bbox": [ + 463, + 654, + 483, + 665 + ], + "score": 0.89, + "content": "\\mathsf { H H } _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 653, + 506, + 667 + ], + "score": 1.0, + "content": "such", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 103, + 662, + 507, + 682 + ], + "spans": [ + { + "bbox": [ + 103, + 662, + 177, + 682 + ], + "score": 1.0, + "content": "that for each item", + "type": "text" + }, + { + "bbox": [ + 177, + 666, + 183, + 677 + ], + "score": 0.64, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 664, + 364, + 679 + ], + "score": 0.86, + "content": "\\begin{array} { r } { , \\dot { \\operatorname* { P r } } \\left( \\mathsf { H } \\mathsf { H } _ { \\delta } ( j , \\frac { 1 } { B _ { r } \\ln n } ) \\neq \\mathsf { H } \\mathsf { H } _ { 0 } ( j , \\frac { 1 } { B _ { r } \\ln n } ) \\right) \\leq \\delta } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 662, + 391, + 682 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 391, + 666, + 411, + 676 + ], + "score": 0.9, + "content": "\\mathsf { H H } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 662, + 507, + 682 + ], + "score": 1.0, + "content": "is an ideal HeavyHitter", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 677, + 288, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 288, + 690 + ], + "score": 1.0, + "content": "oracle that detects heavy items with no error.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 106, + 692, + 505, + 721 + ], + "lines": [ + { + "bbox": [ + 105, + 690, + 505, + 706 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 416, + 706 + ], + "score": 1.0, + "content": "Lemma 9.15. In an optimal Learned Count-Min sketch with parameters", + "type": "text" + }, + { + "bbox": [ + 416, + 692, + 449, + 704 + ], + "score": 0.92, + "content": "( B _ { r } , B )", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 690, + 505, + 706 + ], + "score": 1.0, + "content": "and a noisy", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 103, + 700, + 419, + 723 + ], + "spans": [ + { + "bbox": [ + 103, + 700, + 189, + 723 + ], + "score": 1.0, + "content": "HeavyHitters oracle", + "type": "text" + }, + { + "bbox": [ + 190, + 706, + 209, + 718 + ], + "score": 0.87, + "content": "\\mathsf { H H } _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 700, + 213, + 723 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 213, + 703, + 412, + 721 + ], + "score": 0.84, + "content": "\\begin{array} { r } { { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , \\tilde { \\mathcal { F } } _ { ( L - C M , \\delta ) } ) ] = O ( \\frac { \\delta ^ { 2 } \\ln ^ { 2 } B _ { r } + \\ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 700, + 419, + 723 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2019", + "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": "16", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 196, + 505, + 207 + ], + "lines": [ + { + "bbox": [ + 495, + 197, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 495, + 197, + 505, + 208 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 81, + 505, + 108 + ], + "lines": [ + { + "bbox": [ + 104, + 79, + 507, + 99 + ], + "spans": [ + { + "bbox": [ + 104, + 79, + 237, + 99 + ], + "score": 1.0, + "content": "Hence, with probability at least", + "type": "text" + }, + { + "bbox": [ + 237, + 81, + 263, + 96 + ], + "score": 0.92, + "content": "\\textstyle 1 - { \\frac { 1 } { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 79, + 327, + 99 + ], + "score": 1.0, + "content": ", the estimation", + "type": "text" + }, + { + "bbox": [ + 328, + 81, + 338, + 95 + ], + "score": 0.89, + "content": "\\tilde { f } _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 79, + 507, + 99 + ], + "score": 1.0, + "content": "includes the frequency of one of the top", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 94, + 504, + 109 + ], + "spans": [ + { + "bbox": [ + 107, + 94, + 164, + 109 + ], + "score": 0.91, + "content": "2 ( \\textstyle { \\frac { B } { k } } ) \\ln k + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 94, + 227, + 109 + ], + "score": 1.0, + "content": "frequent items.", + "type": "text" + }, + { + "bbox": [ + 496, + 99, + 504, + 104 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 104, + 79, + 507, + 109 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 111, + 505, + 141 + ], + "lines": [ + { + "bbox": [ + 105, + 111, + 505, + 126 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 357, + 125 + ], + "score": 1.0, + "content": "Lemma 9.10. The expected error of Count-Min sketch of size", + "type": "text" + }, + { + "bbox": [ + 358, + 111, + 393, + 126 + ], + "score": 0.94, + "content": "\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 111, + 505, + 125 + ], + "score": 1.0, + "content": "for estimating items whose", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 124, + 320, + 142 + ], + "spans": [ + { + "bbox": [ + 104, + 124, + 278, + 142 + ], + "score": 1.0, + "content": "frequency distribution is Zipfian is at least", + "type": "text" + }, + { + "bbox": [ + 278, + 124, + 315, + 141 + ], + "score": 0.93, + "content": "\\frac { ( k - 1 ) \\ln { n } } { 2 B \\ln { k } + k }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 124, + 320, + 142 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 104, + 111, + 505, + 142 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 143, + 450, + 160 + ], + "lines": [ + { + "bbox": [ + 103, + 141, + 453, + 165 + ], + "spans": [ + { + "bbox": [ + 103, + 141, + 252, + 165 + ], + "score": 1.0, + "content": "Proof: Observation 9.9 implies that", + "type": "text" + }, + { + "bbox": [ + 253, + 144, + 415, + 162 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathbf { E } [ e _ { j } ] \\geq ( 1 - \\frac { 1 } { k } ) \\frac { 1 } { 2 ( \\frac { B } { k } ) \\ln k + 1 } = \\frac { k - 1 } { 2 B \\ln k + k } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 141, + 453, + 165 + ], + "score": 1.0, + "content": ". Hence,", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 103, + 141, + 453, + 165 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 174, + 155, + 437, + 215 + ], + "lines": [ + { + "bbox": [ + 174, + 155, + 437, + 215 + ], + "spans": [ + { + "bbox": [ + 174, + 155, + 437, + 215 + ], + "score": 0.73, + "content": "\\begin{array} { r l } { { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\mathcal { \\tilde { F } } _ { C M } ) ] = \\sum _ { j \\in [ n ] } ^ { } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } } \\\\ & { \\geq ( \\frac { k - 1 } { 2 B \\ln k + k } ) \\ln n \\quad \\triangleright \\mathrm { B y ~ O b s e r v a t i o n } 9 . 1 } \\end{array}", + "type": "interline_equation", + "image_path": "7ed698904f123de337fc310b6d11a21a65fa2b61646d935857a55110b1969b46.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 174, + 155, + 437, + 175.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 174, + 175.0, + 437, + 195.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 174, + 195.0, + 437, + 215.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 220, + 506, + 255 + ], + "lines": [ + { + "bbox": [ + 105, + 218, + 506, + 236 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 359, + 236 + ], + "score": 1.0, + "content": "Theorem 9.11. The expected error of Count-Min sketch of size", + "type": "text" + }, + { + "bbox": [ + 359, + 220, + 392, + 234 + ], + "score": 0.93, + "content": "\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 392, + 218, + 506, + 236 + ], + "score": 1.0, + "content": "on estimating the frequency", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 233, + 462, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 239, + 290, + 256 + ], + "score": 1.0, + "content": "of n items from Zipfian distribution is at least", + "type": "text" + }, + { + "bbox": [ + 290, + 240, + 328, + 255 + ], + "score": 0.92, + "content": "\\Omega \\big ( \\frac { k \\ln n } { B \\ln k } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 239, + 379, + 256 + ], + "score": 1.0, + "content": "and at most", + "type": "text" + }, + { + "bbox": [ + 379, + 233, + 456, + 255 + ], + "score": 0.92, + "content": "O ( \\frac { k \\ln n \\ln ^ { \\frac { k + 2 } { k - 1 } } ( \\frac { k n } { B } ) } { B } )", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 233, + 462, + 253 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 218, + 506, + 256 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 257, + 505, + 283 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 215, + 272 + ], + "score": 1.0, + "content": "In particular, for the case", + "type": "text" + }, + { + "bbox": [ + 216, + 258, + 262, + 270 + ], + "score": 0.93, + "content": "B = \\Theta ( n )", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 257, + 283, + 272 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 283, + 258, + 327, + 270 + ], + "score": 0.91, + "content": "k = O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 257, + 506, + 272 + ], + "score": 1.0, + "content": ", the expected error of Count-Min sketch is", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 266, + 145, + 288 + ], + "spans": [ + { + "bbox": [ + 107, + 270, + 138, + 284 + ], + "score": 0.92, + "content": "\\Theta \\big ( \\textstyle { \\frac { \\ln n } { B } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 266, + 145, + 288 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 257, + 506, + 288 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 285, + 506, + 320 + ], + "lines": [ + { + "bbox": [ + 105, + 285, + 506, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 506, + 298 + ], + "score": 1.0, + "content": "Proof: The proof follows from Lemma 9.8 and 9.10. We remark that the bound in Lemma 9.8 is for", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 295, + 506, + 309 + ], + "spans": [ + { + "bbox": [ + 105, + 295, + 343, + 309 + ], + "score": 1.0, + "content": "the expected estimation error of Count-Min sketch of size", + "type": "text" + }, + { + "bbox": [ + 344, + 297, + 371, + 307 + ], + "score": 0.91, + "content": "k \\times B", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 295, + 506, + 309 + ], + "score": 1.0, + "content": ". Hence, to get the bound on the", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 307, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 252, + 320 + ], + "score": 1.0, + "content": "expected error of Count-Min of size", + "type": "text" + }, + { + "bbox": [ + 253, + 307, + 288, + 320 + ], + "score": 0.93, + "content": "\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 307, + 358, + 320 + ], + "score": 1.0, + "content": ", we must replace", + "type": "text" + }, + { + "bbox": [ + 359, + 308, + 368, + 317 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 307, + 389, + 320 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 390, + 307, + 409, + 320 + ], + "score": 0.92, + "content": "B / k", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 307, + 413, + 320 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 494, + 307, + 505, + 318 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 285, + 506, + 320 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 329, + 263, + 341 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 264, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 264, + 342 + ], + "score": 1.0, + "content": "9.3. LEARNED COUNT-MIN SKETCH", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 105, + 348, + 505, + 376 + ], + "lines": [ + { + "bbox": [ + 104, + 347, + 505, + 363 + ], + "spans": [ + { + "bbox": [ + 104, + 347, + 174, + 363 + ], + "score": 1.0, + "content": "Definition 9.12", + "type": "text" + }, + { + "bbox": [ + 175, + 350, + 182, + 361 + ], + "score": 0.79, + "content": "\\dot { \\phi }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 347, + 335, + 363 + ], + "score": 1.0, + "content": "-HeavyHitter). Given a set of items", + "type": "text" + }, + { + "bbox": [ + 335, + 349, + 411, + 362 + ], + "score": 0.92, + "content": "\\mathcal { T } = \\{ i _ { 1 } , \\cdots , i _ { n } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 347, + 484, + 363 + ], + "score": 1.0, + "content": "with frequencies", + "type": "text" + }, + { + "bbox": [ + 484, + 347, + 505, + 362 + ], + "score": 0.88, + "content": "{ \\vec { f } } =", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 107, + 361, + 361, + 376 + ], + "spans": [ + { + "bbox": [ + 107, + 362, + 158, + 375 + ], + "score": 0.91, + "content": "\\langle f _ { 1 } , \\cdots , f _ { n } \\rangle", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 361, + 194, + 376 + ], + "score": 1.0, + "content": ", an item", + "type": "text" + }, + { + "bbox": [ + 195, + 364, + 201, + 375 + ], + "score": 0.76, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 361, + 218, + 376 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 219, + 363, + 226, + 375 + ], + "score": 0.82, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 361, + 289, + 376 + ], + "score": 1.0, + "content": "-HeavyHitter of", + "type": "text" + }, + { + "bbox": [ + 290, + 363, + 298, + 373 + ], + "score": 0.37, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 361, + 307, + 376 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 307, + 361, + 357, + 375 + ], + "score": 0.84, + "content": "f _ { j } \\geq \\phi | | { \\vec { f } } | | _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 361, + 361, + 376 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 104, + 347, + 505, + 376 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 377, + 504, + 401 + ], + "lines": [ + { + "bbox": [ + 105, + 376, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 376, + 314, + 391 + ], + "score": 1.0, + "content": "Remark 9.13. If the frequency distribution of items", + "type": "text" + }, + { + "bbox": [ + 314, + 378, + 322, + 388 + ], + "score": 0.69, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 376, + 440, + 391 + ], + "score": 1.0, + "content": "is Zipfian, then the number of", + "type": "text" + }, + { + "bbox": [ + 441, + 378, + 447, + 389 + ], + "score": 0.82, + "content": "\\phi", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 376, + 505, + 391 + ], + "score": 1.0, + "content": "-HeavyHitters", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 387, + 329, + 403 + ], + "spans": [ + { + "bbox": [ + 105, + 387, + 147, + 403 + ], + "score": 1.0, + "content": "is at most", + "type": "text" + }, + { + "bbox": [ + 147, + 389, + 189, + 401 + ], + "score": 0.91, + "content": "1 / ( \\phi \\ln n )", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 387, + 257, + 403 + ], + "score": 1.0, + "content": ". In other words,", + "type": "text" + }, + { + "bbox": [ + 258, + 388, + 325, + 401 + ], + "score": 0.93, + "content": "B _ { r } \\leq ( \\phi \\ln n ) ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 387, + 329, + 403 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 376, + 505, + 403 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 409, + 505, + 456 + ], + "lines": [ + { + "bbox": [ + 106, + 410, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 353, + 421 + ], + "score": 1.0, + "content": "To recall, in our Learned Count-Min sketch with parameters", + "type": "text" + }, + { + "bbox": [ + 354, + 410, + 386, + 421 + ], + "score": 0.89, + "content": "( B _ { r } , B )", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 410, + 391, + 421 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 391, + 410, + 404, + 421 + ], + "score": 0.76, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 410, + 505, + 421 + ], + "score": 1.0, + "content": "buckets are reserved for", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 421, + 505, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 421, + 505, + 432 + ], + "score": 1.0, + "content": "the frequent items returned by HH and the rest of items are fed to a Count-Min sketch of size", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 429, + 507, + 447 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 158, + 445 + ], + "score": 0.93, + "content": "\\begin{array} { r } { k \\times \\left( \\frac { B ^ { \\star } - B _ { r } } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 429, + 187, + 447 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 187, + 433, + 194, + 442 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 429, + 507, + 447 + ], + "score": 1.0, + "content": "is a parameter to be determined. We emphasize that the space complexity of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 443, + 397, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 279, + 456 + ], + "score": 1.0, + "content": "Learned Count-Min sketch with parameter", + "type": "text" + }, + { + "bbox": [ + 279, + 443, + 312, + 456 + ], + "score": 0.93, + "content": "( B _ { r } , B )", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 443, + 322, + 456 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 323, + 443, + 393, + 456 + ], + "score": 0.93, + "content": "B _ { r } + B = O ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 443, + 397, + 456 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 410, + 507, + 456 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 458, + 505, + 500 + ], + "lines": [ + { + "bbox": [ + 106, + 457, + 505, + 471 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 505, + 471 + ], + "score": 1.0, + "content": "Theorem 9.14. The optimal expected error of Learned Count-Min sketches with parameters", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 465, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 107, + 472, + 140, + 485 + ], + "score": 0.92, + "content": "( B _ { r } , B )", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 465, + 183, + 489 + ], + "score": 1.0, + "content": "is at most", + "type": "text" + }, + { + "bbox": [ + 183, + 469, + 247, + 487 + ], + "score": 0.93, + "content": "\\frac { ( \\ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } }", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 465, + 321, + 489 + ], + "score": 1.0, + "content": ". In particular, for", + "type": "text" + }, + { + "bbox": [ + 321, + 472, + 406, + 485 + ], + "score": 0.68, + "content": "B _ { r } = \\Theta ( B ) = \\Theta ( n )", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 465, + 410, + 489 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 411, + 471, + 505, + 485 + ], + "score": 0.82, + "content": "\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { L - C M } ) ] =", + "type": "inline_equation" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 483, + 137, + 503 + ], + "spans": [ + { + "bbox": [ + 107, + 486, + 130, + 500 + ], + "score": 0.9, + "content": "O ( { \\textstyle { \\frac { 1 } { n } } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 483, + 137, + 503 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 457, + 505, + 503 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 501, + 504, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 499, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 499, + 231, + 515 + ], + "score": 1.0, + "content": "Proof: Since, the count of top", + "type": "text" + }, + { + "bbox": [ + 231, + 502, + 244, + 513 + ], + "score": 0.88, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 244, + 499, + 469, + 515 + ], + "score": 1.0, + "content": "frequent items are stored in their own buckets, for each", + "type": "text" + }, + { + "bbox": [ + 469, + 502, + 501, + 513 + ], + "score": 0.9, + "content": "j \\le B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 499, + 506, + 515 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 512, + 171, + 525 + ], + "spans": [ + { + "bbox": [ + 107, + 513, + 135, + 525 + ], + "score": 0.9, + "content": "e _ { j } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 512, + 171, + 525 + ], + "score": 1.0, + "content": ". Hence,", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 499, + 506, + 525 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 521, + 448, + 608 + ], + "lines": [ + { + "bbox": [ + 164, + 521, + 448, + 608 + ], + "spans": [ + { + "bbox": [ + 164, + 521, + 448, + 608 + ], + "score": 0.93, + "content": "\\begin{array} { l } { { \\displaystyle { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { F } } _ { L - C M } ) ] = \\sum _ { j \\in [ n ] } { \\bf E } [ e _ { j } ] \\cdot f _ { j } } \\ ~ } \\\\ { { \\displaystyle ~ = \\sum _ { j > B _ { r } } { \\bf E } [ e _ { j } ] \\cdot f _ { j } \\quad \\triangleright \\forall j \\le B _ { r } , e _ { j } = 0 } \\ ~ } \\\\ { { \\displaystyle ~ < \\frac { ( \\ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } } \\quad } { \\displaystyle \\triangleright \\mathrm { B y ~ O b s e r v a t i o n ~ } } 9 . 1 } \\end{array}", + "type": "interline_equation", + "image_path": "59fa12f35b1162a49011e634459127ebd231af332c0999eccef0a25cfb8ad4b5.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 164, + 521, + 448, + 550.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 164, + 550.0, + 448, + 579.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 164, + 579.0, + 448, + 608.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 606, + 505, + 628 + ], + "lines": [ + { + "bbox": [ + 106, + 605, + 505, + 618 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 618 + ], + "score": 1.0, + "content": "Note that the last inequality follows from the guarantee of single hash functions; in other words,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 616, + 505, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 135, + 628 + ], + "score": 1.0, + "content": "setting", + "type": "text" + }, + { + "bbox": [ + 136, + 617, + 160, + 627 + ], + "score": 0.91, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 616, + 263, + 628 + ], + "score": 1.0, + "content": "in the Count-Min sketch.", + "type": "text" + }, + { + "bbox": [ + 494, + 617, + 505, + 628 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 106, + 605, + 505, + 628 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 636, + 444, + 649 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 443, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 443, + 650 + ], + "score": 1.0, + "content": "9.3.1. LEARNED COUNT-MIN SKETCH USING NOISY HEAVYHITTERS ORACLE", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 654, + 506, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 653, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 462, + 667 + ], + "score": 1.0, + "content": "Unlike the previous part, here we assume that we are given a noisy HeavyHitters oracle", + "type": "text" + }, + { + "bbox": [ + 463, + 654, + 483, + 665 + ], + "score": 0.89, + "content": "\\mathsf { H H } _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 653, + 506, + 667 + ], + "score": 1.0, + "content": "such", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 103, + 662, + 507, + 682 + ], + "spans": [ + { + "bbox": [ + 103, + 662, + 177, + 682 + ], + "score": 1.0, + "content": "that for each item", + "type": "text" + }, + { + "bbox": [ + 177, + 666, + 183, + 677 + ], + "score": 0.64, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 664, + 364, + 679 + ], + "score": 0.86, + "content": "\\begin{array} { r } { , \\dot { \\operatorname* { P r } } \\left( \\mathsf { H } \\mathsf { H } _ { \\delta } ( j , \\frac { 1 } { B _ { r } \\ln n } ) \\neq \\mathsf { H } \\mathsf { H } _ { 0 } ( j , \\frac { 1 } { B _ { r } \\ln n } ) \\right) \\leq \\delta } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 662, + 391, + 682 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 391, + 666, + 411, + 676 + ], + "score": 0.9, + "content": "\\mathsf { H H } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 662, + 507, + 682 + ], + "score": 1.0, + "content": "is an ideal HeavyHitter", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 677, + 288, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 288, + 690 + ], + "score": 1.0, + "content": "oracle that detects heavy items with no error.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 103, + 653, + 507, + 690 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 692, + 505, + 721 + ], + "lines": [ + { + "bbox": [ + 105, + 690, + 505, + 706 + ], + "spans": [ + { + "bbox": [ + 105, + 690, + 416, + 706 + ], + "score": 1.0, + "content": "Lemma 9.15. In an optimal Learned Count-Min sketch with parameters", + "type": "text" + }, + { + "bbox": [ + 416, + 692, + 449, + 704 + ], + "score": 0.92, + "content": "( B _ { r } , B )", + "type": "inline_equation" + }, + { + "bbox": [ + 449, + 690, + 505, + 706 + ], + "score": 1.0, + "content": "and a noisy", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 103, + 700, + 419, + 723 + ], + "spans": [ + { + "bbox": [ + 103, + 700, + 189, + 723 + ], + "score": 1.0, + "content": "HeavyHitters oracle", + "type": "text" + }, + { + "bbox": [ + 190, + 706, + 209, + 718 + ], + "score": 0.87, + "content": "\\mathsf { H H } _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 700, + 213, + 723 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 213, + 703, + 412, + 721 + ], + "score": 0.84, + "content": "\\begin{array} { r } { { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , \\tilde { \\mathcal { F } } _ { ( L - C M , \\delta ) } ) ] = O ( \\frac { \\delta ^ { 2 } \\ln ^ { 2 } B _ { r } + \\ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 700, + 419, + 723 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 103, + 690, + 505, + 723 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 104 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 359, + 96 + ], + "score": 1.0, + "content": "Proof: The key observation is that each heavy item, any of", + "type": "text" + }, + { + "bbox": [ + 359, + 83, + 372, + 93 + ], + "score": 0.89, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "most frequent items, may only", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 427, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 220, + 107 + ], + "score": 1.0, + "content": "misclassify with probability", + "type": "text" + }, + { + "bbox": [ + 221, + 94, + 226, + 104 + ], + "score": 0.67, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 92, + 316, + 107 + ], + "score": 1.0, + "content": ". Hence, for each item", + "type": "text" + }, + { + "bbox": [ + 316, + 95, + 322, + 105 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 92, + 427, + 107 + ], + "score": 1.0, + "content": "classified as “not heavy”,", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 108, + 128, + 505, + 150 + ], + "lines": [ + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "where the first term denotes the expected contribution of the misclassified heavy items and the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 138, + 375, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 375, + 151 + ], + "score": 1.0, + "content": "second term denotes the expected contribution of non-heavy items.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 106, + 154, + 346, + 166 + ], + "lines": [ + { + "bbox": [ + 106, + 154, + 346, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 346, + 167 + ], + "score": 1.0, + "content": "The rest of analysis is similar to the proof of Theorem 9.14.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 165, + 468, + 279 + ], + "lines": [ + { + "bbox": [ + 117, + 165, + 468, + 279 + ], + "spans": [ + { + "bbox": [ + 117, + 165, + 468, + 279 + ], + "score": 0.94, + "content": "\\begin{array} { r l } { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { ( L - C M , \\delta ) } ^ { * } ) ] = \\displaystyle \\sum _ { j \\in [ n ] } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } & { } \\\\ & { < \\delta \\displaystyle \\sum _ { j \\leq B _ { r } } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } + \\displaystyle \\sum _ { j > B _ { r } } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } \\\\ & { \\leq O ( \\delta \\cdot \\ln B _ { r } + \\ln ( n / B _ { r } ) ) \\cdot O ( \\frac { \\delta \\ln B _ { r } + \\ln ( n / B _ { r } ) } { B - B _ { r } } ) \\quad \\mapsto \\mathbf { B } \\mathbf { y } } \\\\ & { \\leq O ( \\frac { \\delta ^ { 2 } \\ln ^ { 2 } B _ { r } + \\ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "af1433c2d921658eb2267b56432b5a0aeca8e46f992d5515482a62acdcd245f5.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 117, + 165, + 468, + 203.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 117, + 203.0, + 468, + 241.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 117, + 241.0, + 468, + 279.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 284, + 505, + 309 + ], + "lines": [ + { + "bbox": [ + 105, + 281, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 217, + 300 + ], + "score": 1.0, + "content": "Corollary 9.16. Assuming", + "type": "text" + }, + { + "bbox": [ + 217, + 285, + 307, + 297 + ], + "score": 0.93, + "content": "B _ { r } = \\Theta ( B ) = \\Theta ( n )", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 281, + 327, + 300 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 327, + 283, + 506, + 298 + ], + "score": 0.74, + "content": "\\delta = { \\cal O } ( 1 / \\ln n ) , { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { \\mathcal { F } } } _ { ( L - C M , \\delta ) } ) ] =", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 293, + 145, + 312 + ], + "spans": [ + { + "bbox": [ + 107, + 297, + 139, + 309 + ], + "score": 0.91, + "content": "O ( 1 / n )", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 293, + 145, + 312 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 105, + 327, + 463, + 340 + ], + "lines": [ + { + "bbox": [ + 104, + 326, + 464, + 343 + ], + "spans": [ + { + "bbox": [ + 104, + 326, + 464, + 343 + ], + "score": 1.0, + "content": "Space analysis. Here, we compute the amount of space that is required by this approach.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 344, + 506, + 367 + ], + "lines": [ + { + "bbox": [ + 123, + 339, + 507, + 369 + ], + "spans": [ + { + "bbox": [ + 123, + 339, + 416, + 369 + ], + "score": 1.0, + "content": "mma 9.17. The amount of space used by Learned Count-Min sketch of size reserved buckets) for estimating the frequency of items whose distributio", + "type": "text" + }, + { + "bbox": [ + 417, + 343, + 459, + 357 + ], + "score": 0.91, + "content": "\\begin{array} { r } { k \\cdot \\left( \\frac { B - B _ { r } } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 339, + 469, + 369 + ], + "score": 1.0, + "content": "w is", + "type": "text" + }, + { + "bbox": [ + 494, + 339, + 507, + 369 + ], + "score": 1.0, + "content": "off.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 110, + 356, + 493, + 367 + ], + "spans": [ + { + "bbox": [ + 110, + 356, + 123, + 367 + ], + "score": 0.85, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 356, + 493, + 367 + ], + "score": 0.91, + "content": "O ( B )", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 106, + 370, + 506, + 416 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 506, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 449, + 383 + ], + "score": 1.0, + "content": "Proof: The amount of space required to store the counters corresponding to functions", + "type": "text" + }, + { + "bbox": [ + 449, + 371, + 495, + 382 + ], + "score": 0.92, + "content": "h _ { 1 } , \\cdots , h _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 370, + 506, + 383 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 378, + 507, + 398 + ], + "spans": [ + { + "bbox": [ + 107, + 381, + 167, + 395 + ], + "score": 0.92, + "content": "\\overset { \\triangledown } { O } ( \\boldsymbol { k } \\cdot \\big ( \\frac { \\boldsymbol { B } - \\boldsymbol { B } _ { r } } { k } \\big ) \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 378, + 430, + 398 + ], + "score": 1.0, + "content": ". Here, we also need to keep a mapping from the heavy items (top", + "type": "text" + }, + { + "bbox": [ + 431, + 383, + 444, + 393 + ], + "score": 0.88, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 378, + 507, + 398 + ], + "score": 1.0, + "content": "frequent items", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 393, + 506, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 160, + 407 + ], + "score": 1.0, + "content": "according to", + "type": "text" + }, + { + "bbox": [ + 161, + 394, + 180, + 405 + ], + "score": 0.87, + "content": "\\mathsf { H H } _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 393, + 284, + 407 + ], + "score": 1.0, + "content": ") to the reserved buckets", + "type": "text" + }, + { + "bbox": [ + 284, + 394, + 297, + 405 + ], + "score": 0.89, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 393, + 387, + 407 + ], + "score": 1.0, + "content": "which requires extra", + "type": "text" + }, + { + "bbox": [ + 387, + 394, + 415, + 406 + ], + "score": 0.92, + "content": "O ( B _ { r } )", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 393, + 506, + 407 + ], + "score": 1.0, + "content": "space; each reserved", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 404, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 396, + 416 + ], + "score": 1.0, + "content": "buckets stores both the hashmap of its corresponding item and its count.", + "type": "text" + }, + { + "bbox": [ + 494, + 404, + 506, + 415 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5 + }, + { + "type": "title", + "bbox": [ + 107, + 424, + 444, + 437 + ], + "lines": [ + { + "bbox": [ + 105, + 424, + 445, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 445, + 438 + ], + "score": 1.0, + "content": "9.4. NON-ASYMPTOTIC ANALYSIS OF COUNT-MIN AND LEARNED COUNT-MIN", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 442, + 506, + 509 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 506, + 454 + ], + "score": 1.0, + "content": "In this section, we compare the non-asymptotic expected error of Count-Min sketch and out Learned", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "score": 1.0, + "content": "Count-Min sketch with ideal HeavyHitters oracle. Throughout this section, we assume that the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 374, + 477 + ], + "score": 1.0, + "content": "amount of available space to the frequency estimation algorithms is", + "type": "text" + }, + { + "bbox": [ + 374, + 464, + 410, + 476 + ], + "score": 0.92, + "content": "( 1 + \\alpha ) B", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "words. More precisely,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 338, + 487 + ], + "score": 1.0, + "content": "we compare the expected error of Count-Min sketch with", + "type": "text" + }, + { + "bbox": [ + 338, + 475, + 345, + 485 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "hash functions and our Learned Count-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 174, + 498 + ], + "score": 1.0, + "content": "Min sketch with", + "type": "text" + }, + { + "bbox": [ + 174, + 486, + 216, + 497 + ], + "score": 0.92, + "content": "B _ { r } = \\alpha B", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "reserved buckets. Recall that we computed the following bounds on the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 497, + 385, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 385, + 509 + ], + "score": 1.0, + "content": "expected error of these approaches (Lemma 9.10 and Theorem 9.14):", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5 + }, + { + "type": "interline_equation", + "bbox": [ + 152, + 522, + 459, + 550 + ], + "lines": [ + { + "bbox": [ + 152, + 522, + 459, + 550 + ], + "spans": [ + { + "bbox": [ + 152, + 522, + 459, + 550 + ], + "score": 0.92, + "content": "\\mathbf { E } [ \\mathrm { E r r } _ { C M } ] \\geq \\frac { ( k - 1 ) \\ln n } { 2 ( 1 + \\alpha ) B \\ln ( k ) + k } , \\quad \\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { n } { \\alpha B } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } .", + "type": "interline_equation", + "image_path": "84fd9f7ea8191723bc10946f0a1c57aaffa074221cfea6b0f72483b7e76cff71.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 152, + 522, + 459, + 531.3333333333334 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 152, + 531.3333333333334, + 459, + 540.6666666666667 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 152, + 540.6666666666667, + 459, + 550.0000000000001 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 505, + 600 + ], + "lines": [ + { + "bbox": [ + 106, + 553, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 553, + 276, + 565 + ], + "score": 1.0, + "content": "In the rest of this section, we assume that", + "type": "text" + }, + { + "bbox": [ + 276, + 554, + 312, + 565 + ], + "score": 0.93, + "content": "B \\geq \\gamma n", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 553, + 479, + 565 + ], + "score": 1.0, + "content": "and then compute the minimum value of", + "type": "text" + }, + { + "bbox": [ + 479, + 555, + 487, + 565 + ], + "score": 0.82, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 553, + 505, + 565 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 103, + 560, + 509, + 581 + ], + "spans": [ + { + "bbox": [ + 103, + 560, + 152, + 581 + ], + "score": 1.0, + "content": "guarantees", + "type": "text" + }, + { + "bbox": [ + 152, + 564, + 287, + 578 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf { E } [ \\mathrm { E r r } _ { C M } ] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 560, + 509, + 581 + ], + "score": 1.0, + "content": ". In other words, we compute the minimum amount of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 576, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 588 + ], + "score": 1.0, + "content": "space that is required so that our Learned Count-Min sketch performs better than Count-Min sketch", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 587, + 227, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 193, + 599 + ], + "score": 1.0, + "content": "by a factor of at least", + "type": "text" + }, + { + "bbox": [ + 194, + 588, + 223, + 600 + ], + "score": 0.92, + "content": "( 1 + \\varepsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 587, + 227, + 599 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 612, + 505, + 669 + ], + "lines": [ + { + "bbox": [ + 125, + 612, + 485, + 641 + ], + "spans": [ + { + "bbox": [ + 125, + 612, + 485, + 641 + ], + "score": 0.92, + "content": "\\mathbf E [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { 1 } { \\alpha \\gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\frac { ( k - 1 ) \\ln n } { 2 ( 1 + \\alpha ) B \\ln k + k } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf E [ \\mathrm { E r r } _ { C M } ] ,", + "type": "inline_equation", + "image_path": "eca4b57141977bcb85ad0bb645ef5d6c15a02147b8da7ea5a84e69565e1979b3.jpg" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 639, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 196, + 660 + ], + "score": 1.0, + "content": "Hence, we must have", + "type": "text" + }, + { + "bbox": [ + 196, + 642, + 411, + 659 + ], + "score": 0.91, + "content": "\\begin{array} { r } { ( 0 . 5 8 - \\ln \\alpha - \\ln \\gamma ) ^ { 2 } \\leq \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + ( \\frac { k } { B } ) ) } \\cdot \\ln n } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 639, + 505, + 660 + ], + "score": 1.0, + "content": ". By solving the corre-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 657, + 225, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 657, + 225, + 671 + ], + "score": 1.0, + "content": "sponding quadratic equation,", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32 + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 668, + 489, + 694 + ], + "lines": [ + { + "bbox": [ + 120, + 668, + 489, + 694 + ], + "spans": [ + { + "bbox": [ + 120, + 668, + 489, + 694 + ], + "score": 0.78, + "content": "\\ln ^ { 2 } \\gamma + 2 ( \\ln \\alpha - 0 . 5 8 ) \\ln \\gamma + ( ( \\ln \\alpha - 0 . 5 8 ) ^ { 2 } - { \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + { ( \\frac { k } { B } ) } ) } } \\cdot \\ln n ) \\le 0 .", + "type": "interline_equation", + "image_path": "7880f08ddf43604963829b8d3493478eee9a6e2e48a108f376d9ed7ef0ae7e5d.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 120, + 668, + 489, + 694 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 695, + 507, + 735 + ], + "lines": [ + { + "bbox": [ + 105, + 694, + 505, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 177, + 715 + ], + "score": 1.0, + "content": "This implies that", + "type": "text" + }, + { + "bbox": [ + 178, + 696, + 400, + 715 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\ln \\gamma = - \\ln \\alpha + 0 . 5 8 - \\sqrt { \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + ( \\frac { k } { B } ) ) } \\cdot \\ln n } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 694, + 451, + 715 + ], + "score": 1.0, + "content": ". By setting", + "type": "text" + }, + { + "bbox": [ + 452, + 697, + 505, + 711 + ], + "score": 0.86, + "content": "\\alpha = { \\textstyle \\frac { 1 } { 2 } } , \\gamma \\leq", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 712, + 189, + 735 + ], + "spans": [ + { + "bbox": [ + 106, + 712, + 189, + 735 + ], + "score": 0.62, + "content": "\\begin{array} { r } { \\frac { 3 . 5 8 } { e \\sqrt { \\frac { ( k - 1 ) \\ln { n } } { 2 ( 1 + \\varepsilon ) ( 3 \\ln { k } + ( k / B ) ) } } } . } \\end{array}", + "type": "inline_equation", + "image_path": "75d94c9c1c43b7f0dcff0889c2881bc3454a3b38b08cec214f4cc13092e9665e.jpg" + } + ], + "index": 36 + } + ], + "index": 35.5 + } + ], + "page_idx": 16, + "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 2019", + "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, + 259, + 505, + 269 + ], + "lines": [ + { + "bbox": [ + 495, + 259, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 495, + 259, + 505, + 271 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 104 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 359, + 96 + ], + "score": 1.0, + "content": "Proof: The key observation is that each heavy item, any of", + "type": "text" + }, + { + "bbox": [ + 359, + 83, + 372, + 93 + ], + "score": 0.89, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "most frequent items, may only", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 427, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 220, + 107 + ], + "score": 1.0, + "content": "misclassify with probability", + "type": "text" + }, + { + "bbox": [ + 221, + 94, + 226, + 104 + ], + "score": 0.67, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 92, + 316, + 107 + ], + "score": 1.0, + "content": ". Hence, for each item", + "type": "text" + }, + { + "bbox": [ + 316, + 95, + 322, + 105 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 92, + 427, + 107 + ], + "score": 1.0, + "content": "classified as “not heavy”,", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 107 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 128, + 505, + 150 + ], + "lines": [ + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 127, + 505, + 140 + ], + "score": 1.0, + "content": "where the first term denotes the expected contribution of the misclassified heavy items and the", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 138, + 375, + 151 + ], + "spans": [ + { + "bbox": [ + 106, + 138, + 375, + 151 + ], + "score": 1.0, + "content": "second term denotes the expected contribution of non-heavy items.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 106, + 127, + 505, + 151 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 154, + 346, + 166 + ], + "lines": [ + { + "bbox": [ + 106, + 154, + 346, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 346, + 167 + ], + "score": 1.0, + "content": "The rest of analysis is similar to the proof of Theorem 9.14.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 154, + 346, + 167 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 165, + 468, + 279 + ], + "lines": [ + { + "bbox": [ + 117, + 165, + 468, + 279 + ], + "spans": [ + { + "bbox": [ + 117, + 165, + 468, + 279 + ], + "score": 0.94, + "content": "\\begin{array} { r l } { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { ( L - C M , \\delta ) } ^ { * } ) ] = \\displaystyle \\sum _ { j \\in [ n ] } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } & { } \\\\ & { < \\delta \\displaystyle \\sum _ { j \\leq B _ { r } } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } + \\displaystyle \\sum _ { j > B _ { r } } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } \\\\ & { \\leq O ( \\delta \\cdot \\ln B _ { r } + \\ln ( n / B _ { r } ) ) \\cdot O ( \\frac { \\delta \\ln B _ { r } + \\ln ( n / B _ { r } ) } { B - B _ { r } } ) \\quad \\mapsto \\mathbf { B } \\mathbf { y } } \\\\ & { \\leq O ( \\frac { \\delta ^ { 2 } \\ln ^ { 2 } B _ { r } + \\ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "af1433c2d921658eb2267b56432b5a0aeca8e46f992d5515482a62acdcd245f5.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 117, + 165, + 468, + 203.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 117, + 203.0, + 468, + 241.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 117, + 241.0, + 468, + 279.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 284, + 505, + 309 + ], + "lines": [ + { + "bbox": [ + 105, + 281, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 217, + 300 + ], + "score": 1.0, + "content": "Corollary 9.16. Assuming", + "type": "text" + }, + { + "bbox": [ + 217, + 285, + 307, + 297 + ], + "score": 0.93, + "content": "B _ { r } = \\Theta ( B ) = \\Theta ( n )", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 281, + 327, + 300 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 327, + 283, + 506, + 298 + ], + "score": 0.74, + "content": "\\delta = { \\cal O } ( 1 / \\ln n ) , { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { \\mathcal { F } } } _ { ( L - C M , \\delta ) } ) ] =", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 293, + 145, + 312 + ], + "spans": [ + { + "bbox": [ + 107, + 297, + 139, + 309 + ], + "score": 0.91, + "content": "O ( 1 / n )", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 293, + 145, + 312 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 281, + 506, + 312 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 327, + 463, + 340 + ], + "lines": [ + { + "bbox": [ + 104, + 326, + 464, + 343 + ], + "spans": [ + { + "bbox": [ + 104, + 326, + 464, + 343 + ], + "score": 1.0, + "content": "Space analysis. Here, we compute the amount of space that is required by this approach.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 104, + 326, + 464, + 343 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 344, + 506, + 367 + ], + "lines": [ + { + "bbox": [ + 123, + 339, + 507, + 369 + ], + "spans": [ + { + "bbox": [ + 123, + 339, + 416, + 369 + ], + "score": 1.0, + "content": "mma 9.17. The amount of space used by Learned Count-Min sketch of size reserved buckets) for estimating the frequency of items whose distributio", + "type": "text" + }, + { + "bbox": [ + 417, + 343, + 459, + 357 + ], + "score": 0.91, + "content": "\\begin{array} { r } { k \\cdot \\left( \\frac { B - B _ { r } } { k } \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 460, + 339, + 469, + 369 + ], + "score": 1.0, + "content": "w is", + "type": "text" + }, + { + "bbox": [ + 494, + 339, + 507, + 369 + ], + "score": 1.0, + "content": "off.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 110, + 356, + 493, + 367 + ], + "spans": [ + { + "bbox": [ + 110, + 356, + 123, + 367 + ], + "score": 0.85, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 356, + 493, + 367 + ], + "score": 0.91, + "content": "O ( B )", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 110, + 339, + 507, + 369 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 370, + 506, + 416 + ], + "lines": [ + { + "bbox": [ + 105, + 370, + 506, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 370, + 449, + 383 + ], + "score": 1.0, + "content": "Proof: The amount of space required to store the counters corresponding to functions", + "type": "text" + }, + { + "bbox": [ + 449, + 371, + 495, + 382 + ], + "score": 0.92, + "content": "h _ { 1 } , \\cdots , h _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 370, + 506, + 383 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 378, + 507, + 398 + ], + "spans": [ + { + "bbox": [ + 107, + 381, + 167, + 395 + ], + "score": 0.92, + "content": "\\overset { \\triangledown } { O } ( \\boldsymbol { k } \\cdot \\big ( \\frac { \\boldsymbol { B } - \\boldsymbol { B } _ { r } } { k } \\big ) \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 378, + 430, + 398 + ], + "score": 1.0, + "content": ". Here, we also need to keep a mapping from the heavy items (top", + "type": "text" + }, + { + "bbox": [ + 431, + 383, + 444, + 393 + ], + "score": 0.88, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 378, + 507, + 398 + ], + "score": 1.0, + "content": "frequent items", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 393, + 506, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 160, + 407 + ], + "score": 1.0, + "content": "according to", + "type": "text" + }, + { + "bbox": [ + 161, + 394, + 180, + 405 + ], + "score": 0.87, + "content": "\\mathsf { H H } _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 393, + 284, + 407 + ], + "score": 1.0, + "content": ") to the reserved buckets", + "type": "text" + }, + { + "bbox": [ + 284, + 394, + 297, + 405 + ], + "score": 0.89, + "content": "B _ { r }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 393, + 387, + 407 + ], + "score": 1.0, + "content": "which requires extra", + "type": "text" + }, + { + "bbox": [ + 387, + 394, + 415, + 406 + ], + "score": 0.92, + "content": "O ( B _ { r } )", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 393, + 506, + 407 + ], + "score": 1.0, + "content": "space; each reserved", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 404, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 405, + 396, + 416 + ], + "score": 1.0, + "content": "buckets stores both the hashmap of its corresponding item and its count.", + "type": "text" + }, + { + "bbox": [ + 494, + 404, + 506, + 415 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 370, + 507, + 416 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 424, + 444, + 437 + ], + "lines": [ + { + "bbox": [ + 105, + 424, + 445, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 445, + 438 + ], + "score": 1.0, + "content": "9.4. NON-ASYMPTOTIC ANALYSIS OF COUNT-MIN AND LEARNED COUNT-MIN", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 442, + 506, + 509 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 506, + 454 + ], + "score": 1.0, + "content": "In this section, we compare the non-asymptotic expected error of Count-Min sketch and out Learned", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 453, + 505, + 465 + ], + "score": 1.0, + "content": "Count-Min sketch with ideal HeavyHitters oracle. Throughout this section, we assume that the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 374, + 477 + ], + "score": 1.0, + "content": "amount of available space to the frequency estimation algorithms is", + "type": "text" + }, + { + "bbox": [ + 374, + 464, + 410, + 476 + ], + "score": 0.92, + "content": "( 1 + \\alpha ) B", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 464, + 505, + 477 + ], + "score": 1.0, + "content": "words. More precisely,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 475, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 475, + 338, + 487 + ], + "score": 1.0, + "content": "we compare the expected error of Count-Min sketch with", + "type": "text" + }, + { + "bbox": [ + 338, + 475, + 345, + 485 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 475, + 505, + 487 + ], + "score": 1.0, + "content": "hash functions and our Learned Count-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 486, + 505, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 174, + 498 + ], + "score": 1.0, + "content": "Min sketch with", + "type": "text" + }, + { + "bbox": [ + 174, + 486, + 216, + 497 + ], + "score": 0.92, + "content": "B _ { r } = \\alpha B", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 486, + 505, + 498 + ], + "score": 1.0, + "content": "reserved buckets. Recall that we computed the following bounds on the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 497, + 385, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 385, + 509 + ], + "score": 1.0, + "content": "expected error of these approaches (Lemma 9.10 and Theorem 9.14):", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 442, + 506, + 509 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 152, + 522, + 459, + 550 + ], + "lines": [ + { + "bbox": [ + 152, + 522, + 459, + 550 + ], + "spans": [ + { + "bbox": [ + 152, + 522, + 459, + 550 + ], + "score": 0.92, + "content": "\\mathbf { E } [ \\mathrm { E r r } _ { C M } ] \\geq \\frac { ( k - 1 ) \\ln n } { 2 ( 1 + \\alpha ) B \\ln ( k ) + k } , \\quad \\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { n } { \\alpha B } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } .", + "type": "interline_equation", + "image_path": "84fd9f7ea8191723bc10946f0a1c57aaffa074221cfea6b0f72483b7e76cff71.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 152, + 522, + 459, + 531.3333333333334 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 152, + 531.3333333333334, + 459, + 540.6666666666667 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 152, + 540.6666666666667, + 459, + 550.0000000000001 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 553, + 505, + 600 + ], + "lines": [ + { + "bbox": [ + 106, + 553, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 553, + 276, + 565 + ], + "score": 1.0, + "content": "In the rest of this section, we assume that", + "type": "text" + }, + { + "bbox": [ + 276, + 554, + 312, + 565 + ], + "score": 0.93, + "content": "B \\geq \\gamma n", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 553, + 479, + 565 + ], + "score": 1.0, + "content": "and then compute the minimum value of", + "type": "text" + }, + { + "bbox": [ + 479, + 555, + 487, + 565 + ], + "score": 0.82, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 553, + 505, + 565 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 103, + 560, + 509, + 581 + ], + "spans": [ + { + "bbox": [ + 103, + 560, + 152, + 581 + ], + "score": 1.0, + "content": "guarantees", + "type": "text" + }, + { + "bbox": [ + 152, + 564, + 287, + 578 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf { E } [ \\mathrm { E r r } _ { C M } ] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 560, + 509, + 581 + ], + "score": 1.0, + "content": ". In other words, we compute the minimum amount of", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 576, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 588 + ], + "score": 1.0, + "content": "space that is required so that our Learned Count-Min sketch performs better than Count-Min sketch", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 587, + 227, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 193, + 599 + ], + "score": 1.0, + "content": "by a factor of at least", + "type": "text" + }, + { + "bbox": [ + 194, + 588, + 223, + 600 + ], + "score": 0.92, + "content": "( 1 + \\varepsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 587, + 227, + 599 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28.5, + "bbox_fs": [ + 103, + 553, + 509, + 600 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 612, + 505, + 669 + ], + "lines": [ + { + "bbox": [ + 125, + 612, + 485, + 641 + ], + "spans": [ + { + "bbox": [ + 125, + 612, + 485, + 641 + ], + "score": 0.92, + "content": "\\mathbf E [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { 1 } { \\alpha \\gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\frac { ( k - 1 ) \\ln n } { 2 ( 1 + \\alpha ) B \\ln k + k } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf E [ \\mathrm { E r r } _ { C M } ] ,", + "type": "inline_equation", + "image_path": "eca4b57141977bcb85ad0bb645ef5d6c15a02147b8da7ea5a84e69565e1979b3.jpg" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 639, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 639, + 196, + 660 + ], + "score": 1.0, + "content": "Hence, we must have", + "type": "text" + }, + { + "bbox": [ + 196, + 642, + 411, + 659 + ], + "score": 0.91, + "content": "\\begin{array} { r } { ( 0 . 5 8 - \\ln \\alpha - \\ln \\gamma ) ^ { 2 } \\leq \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + ( \\frac { k } { B } ) ) } \\cdot \\ln n } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 639, + 505, + 660 + ], + "score": 1.0, + "content": ". By solving the corre-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 657, + 225, + 671 + ], + "spans": [ + { + "bbox": [ + 106, + 657, + 225, + 671 + ], + "score": 1.0, + "content": "sponding quadratic equation,", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 612, + 505, + 671 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 668, + 489, + 694 + ], + "lines": [ + { + "bbox": [ + 120, + 668, + 489, + 694 + ], + "spans": [ + { + "bbox": [ + 120, + 668, + 489, + 694 + ], + "score": 0.78, + "content": "\\ln ^ { 2 } \\gamma + 2 ( \\ln \\alpha - 0 . 5 8 ) \\ln \\gamma + ( ( \\ln \\alpha - 0 . 5 8 ) ^ { 2 } - { \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + { ( \\frac { k } { B } ) } ) } } \\cdot \\ln n ) \\le 0 .", + "type": "interline_equation", + "image_path": "7880f08ddf43604963829b8d3493478eee9a6e2e48a108f376d9ed7ef0ae7e5d.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 120, + 668, + 489, + 694 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 695, + 507, + 735 + ], + "lines": [ + { + "bbox": [ + 105, + 694, + 505, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 177, + 715 + ], + "score": 1.0, + "content": "This implies that", + "type": "text" + }, + { + "bbox": [ + 178, + 696, + 400, + 715 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\ln \\gamma = - \\ln \\alpha + 0 . 5 8 - \\sqrt { \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + ( \\frac { k } { B } ) ) } \\cdot \\ln n } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 694, + 451, + 715 + ], + "score": 1.0, + "content": ". By setting", + "type": "text" + }, + { + "bbox": [ + 452, + 697, + 505, + 711 + ], + "score": 0.86, + "content": "\\alpha = { \\textstyle \\frac { 1 } { 2 } } , \\gamma \\leq", + "type": "inline_equation" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 712, + 189, + 735 + ], + "spans": [ + { + "bbox": [ + 106, + 712, + 189, + 735 + ], + "score": 0.62, + "content": "\\begin{array} { r } { \\frac { 3 . 5 8 } { e \\sqrt { \\frac { ( k - 1 ) \\ln { n } } { 2 ( 1 + \\varepsilon ) ( 3 \\ln { k } + ( k / B ) ) } } } . } \\end{array}", + "type": "inline_equation", + "image_path": "75d94c9c1c43b7f0dcff0889c2881bc3454a3b38b08cec214f4cc13092e9665e.jpg" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 694, + 505, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 106 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 257, + 94 + ], + "score": 1.0, + "content": "Next, we consider different values of", + "type": "text" + }, + { + "bbox": [ + 257, + 83, + 264, + 92 + ], + "score": 0.82, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "and show that in each case what is the minimum amount of", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 442, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 398, + 106 + ], + "score": 1.0, + "content": "space in which Learned CM outperforms CM by a factor of 1.06 (setting", + "type": "text" + }, + { + "bbox": [ + 399, + 94, + 437, + 105 + ], + "score": 0.86, + "content": "\\varepsilon = 0 . 0 6 ", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 93, + 442, + 106 + ], + "score": 1.0, + "content": ").", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 133, + 120, + 505, + 153 + ], + "lines": [ + { + "bbox": [ + 132, + 119, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 132, + 119, + 142, + 133 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 120, + 170, + 131 + ], + "score": 0.89, + "content": "\\mathbf k = \\mathbf 1", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 119, + 505, + 133 + ], + "score": 1.0, + "content": ". In this case, we are basically comparing the expected error of a single hash function", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 142, + 131, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 142, + 132, + 427, + 144 + ], + "score": 1.0, + "content": "and Learned Count-Min. In particular, in order to get a gap of at least", + "type": "text" + }, + { + "bbox": [ + 427, + 131, + 457, + 144 + ], + "score": 0.91, + "content": "( 1 + \\varepsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 132, + 505, + 144 + ], + "score": 1.0, + "content": ", by a more", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 142, + 142, + 425, + 155 + ], + "spans": [ + { + "bbox": [ + 142, + 142, + 268, + 155 + ], + "score": 1.0, + "content": "careful analysis of Lemma 9.2,", + "type": "text" + }, + { + "bbox": [ + 268, + 144, + 276, + 153 + ], + "score": 0.74, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 142, + 425, + 155 + ], + "score": 1.0, + "content": "must satisfy the following condition:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "interline_equation", + "bbox": [ + 163, + 153, + 483, + 181 + ], + "lines": [ + { + "bbox": [ + 163, + 153, + 483, + 181 + ], + "spans": [ + { + "bbox": [ + 163, + 153, + 483, + 181 + ], + "score": 0.69, + "content": "\\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { 1 } { \\alpha \\gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\frac { \\ln ^ { 2 } n - 1 . 6 5 } { ( 1 + \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf { E } [ \\mathrm { E r r } _ { h } ] ,", + "type": "interline_equation", + "image_path": "7fad2b446cd94ecdad3603ce91af52ebba5f9b015e027c52bb4b9f697dd62fd6.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 163, + 153, + 483, + 181 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 181, + 504, + 208 + ], + "lines": [ + { + "bbox": [ + 141, + 180, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 141, + 180, + 291, + 196 + ], + "score": 1.0, + "content": "To simplify it further, we require that", + "type": "text" + }, + { + "bbox": [ + 291, + 181, + 444, + 196 + ], + "score": 0.86, + "content": "( \\ln ( \\textstyle \\frac { 2 } { \\gamma } ) + 0 . 5 8 ) ^ { 2 } \\leq 3 . 1 8 \\cdot ( \\ln ^ { 2 } n - 1 . 6 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 180, + 505, + 196 + ], + "score": 1.0, + "content": ") which implies", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 194, + 227, + 209 + ], + "spans": [ + { + "bbox": [ + 141, + 194, + 160, + 209 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 160, + 195, + 223, + 207 + ], + "score": 0.92, + "content": "\\gamma = \\Theta ( 1 / \\ln n )", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 194, + 227, + 209 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 132, + 220, + 504, + 254 + ], + "lines": [ + { + "bbox": [ + 132, + 221, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 221, + 142, + 235 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 222, + 171, + 232 + ], + "score": 0.88, + "content": "k = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 221, + 226, + 235 + ], + "score": 1.0, + "content": ". In this case,", + "type": "text" + }, + { + "bbox": [ + 227, + 221, + 290, + 237 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\gamma \\le \\frac { 3 . 5 8 } { e ^ { \\sqrt { ( \\ln n ) / 4 . 5 } } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 221, + 415, + 234 + ], + "score": 1.0, + "content": "for sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 415, + 222, + 424, + 232 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 221, + 505, + 234 + ], + "score": 1.0, + "content": ". Hence, we require", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 142, + 236, + 383, + 253 + ], + "spans": [ + { + "bbox": [ + 142, + 237, + 340, + 249 + ], + "score": 1.0, + "content": "that the total amount of available space is at least", + "type": "text" + }, + { + "bbox": [ + 340, + 236, + 383, + 253 + ], + "score": 0.93, + "content": "\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 4 . 5 } } }", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 132, + 267, + 505, + 300 + ], + "lines": [ + { + "bbox": [ + 132, + 267, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 132, + 267, + 142, + 282 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 268, + 193, + 281 + ], + "score": 0.89, + "content": "k \\in \\{ 3 , 4 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 267, + 251, + 282 + ], + "score": 1.0, + "content": ": In this case,", + "type": "text" + }, + { + "bbox": [ + 252, + 268, + 316, + 285 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\gamma \\le \\frac { 2 } { e \\sqrt { ( \\ln n ) / 3 . 5 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 268, + 444, + 281 + ], + "score": 1.0, + "content": "for sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 444, + 270, + 453, + 279 + ], + "score": 0.83, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 268, + 505, + 281 + ], + "score": 1.0, + "content": ". Hence, we", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 283, + 414, + 300 + ], + "spans": [ + { + "bbox": [ + 142, + 285, + 371, + 296 + ], + "score": 1.0, + "content": "require that the total amount of available space is at least", + "type": "text" + }, + { + "bbox": [ + 371, + 283, + 414, + 300 + ], + "score": 0.93, + "content": "\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 3 . 5 } } }", + "type": "inline_equation" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 132, + 315, + 505, + 347 + ], + "lines": [ + { + "bbox": [ + 132, + 315, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 142, + 330 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 316, + 171, + 328 + ], + "score": 0.88, + "content": "\\mathbf { \\delta } _ { k } \\geq \\mathbf { 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 315, + 226, + 330 + ], + "score": 1.0, + "content": ". In this case,", + "type": "text" + }, + { + "bbox": [ + 227, + 315, + 290, + 332 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\gamma \\le \\frac { 2 } { e ^ { \\sqrt { ( \\ln n ) / 2 . 6 } } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 316, + 415, + 328 + ], + "score": 1.0, + "content": "for sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 415, + 317, + 424, + 326 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 316, + 505, + 328 + ], + "score": 1.0, + "content": ". Hence, we require", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 142, + 330, + 383, + 347 + ], + "spans": [ + { + "bbox": [ + 142, + 331, + 340, + 343 + ], + "score": 1.0, + "content": "that the total amount of available space is at least", + "type": "text" + }, + { + "bbox": [ + 341, + 330, + 383, + 347 + ], + "score": 0.93, + "content": "\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 2 . 6 } } }", + "type": "inline_equation" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 106, + 361, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 504, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 374, + 373 + ], + "score": 1.0, + "content": "We also note that settings where the number of buckets is close to", + "type": "text" + }, + { + "bbox": [ + 374, + 364, + 381, + 371 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 361, + 504, + 373 + ], + "score": 1.0, + "content": "are quite common in practice.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 258, + 385 + ], + "score": 1.0, + "content": "For example, Goyal et al. (2012) uses", + "type": "text" + }, + { + "bbox": [ + 259, + 372, + 388, + 384 + ], + "score": 0.9, + "content": "( ( 1 + \\alpha ) B = 2 0 M , n = 3 3 . 5 M )", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 371, + 408, + 385 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 408, + 372, + 505, + 384 + ], + "score": 0.89, + "content": "( ( 1 + \\alpha ) B = 5 \\bar { 0 } M , n =", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 131, + 394 + ], + "score": 0.64, + "content": "9 4 M )", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 383, + 154, + 396 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 154, + 384, + 180, + 394 + ], + "score": 0.88, + "content": "k = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 383, + 380, + 396 + ], + "score": 1.0, + "content": ", while Kumar et al. (2004) uses different pairs of", + "type": "text" + }, + { + "bbox": [ + 381, + 384, + 438, + 396 + ], + "score": 0.9, + "content": "( ( 1 + \\alpha ) B , n )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 383, + 483, + 396 + ], + "score": 1.0, + "content": "including", + "type": "text" + }, + { + "bbox": [ + 483, + 384, + 505, + 394 + ], + "score": 0.82, + "content": "B =", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 393, + 506, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 186, + 406 + ], + "score": 0.88, + "content": "2 8 8 K , n \\ = \\ 5 6 3 K )", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 393, + 506, + 407 + ], + "score": 1.0, + "content": ". Plugging these values into the exact formulas computed above shows that", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 406, + 317, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 317, + 417 + ], + "score": 1.0, + "content": "Learned CM has a significantly lower loss than CM.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16 + }, + { + "type": "title", + "bbox": [ + 108, + 428, + 267, + 441 + ], + "lines": [ + { + "bbox": [ + 106, + 427, + 268, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 427, + 268, + 442 + ], + "score": 1.0, + "content": "10. OPTIMAL HASH FUNCTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 105, + 447, + 504, + 470 + ], + "lines": [ + { + "bbox": [ + 105, + 445, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 461 + ], + "score": 1.0, + "content": "In this section we compute an asymptotic bound error bound of optimal hash functions that map", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 457, + 265, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 131, + 471 + ], + "score": 1.0, + "content": "items", + "type": "text" + }, + { + "bbox": [ + 131, + 458, + 143, + 470 + ], + "score": 0.88, + "content": "[ n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 457, + 219, + 471 + ], + "score": 1.0, + "content": "to a set of buckets", + "type": "text" + }, + { + "bbox": [ + 219, + 458, + 261, + 470 + ], + "score": 0.93, + "content": "C [ 1 \\cdots B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 457, + 265, + 471 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 472, + 506, + 512 + ], + "lines": [ + { + "bbox": [ + 106, + 472, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 472, + 236, + 486 + ], + "score": 1.0, + "content": "Claim 10.1. For a set of items", + "type": "text" + }, + { + "bbox": [ + 236, + 474, + 243, + 483 + ], + "score": 0.65, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 472, + 262, + 486 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 262, + 473, + 281, + 485 + ], + "score": 0.91, + "content": "f ( I )", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 472, + 455, + 486 + ], + "score": 1.0, + "content": "denote the total frequency of all items in", + "type": "text" + }, + { + "bbox": [ + 456, + 474, + 462, + 483 + ], + "score": 0.32, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 472, + 468, + 486 + ], + "score": 1.0, + "content": ";", + "type": "text" + }, + { + "bbox": [ + 468, + 473, + 505, + 485 + ], + "score": 0.81, + "content": "f ( I ) : =", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 483, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 140, + 497 + ], + "score": 0.91, + "content": "\\textstyle \\sum _ { i \\in I } f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 483, + 295, + 498 + ], + "score": 1.0, + "content": ". In any optimal hash function of form", + "type": "text" + }, + { + "bbox": [ + 295, + 484, + 359, + 496 + ], + "score": 0.93, + "content": "\\{ h : I [ B _ { I } ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 483, + 506, + 498 + ], + "score": 1.0, + "content": "with minimum estimation error, any", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 495, + 409, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 219, + 514 + ], + "score": 1.0, + "content": "item with frequency at least", + "type": "text" + }, + { + "bbox": [ + 219, + 496, + 237, + 513 + ], + "score": 0.93, + "content": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 495, + 398, + 514 + ], + "score": 1.0, + "content": "does not collide with any other items in", + "type": "text" + }, + { + "bbox": [ + 398, + 499, + 405, + 509 + ], + "score": 0.62, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 495, + 409, + 514 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 515, + 502, + 554 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 504, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 206, + 528 + ], + "score": 1.0, + "content": "Proof: For each bucket", + "type": "text" + }, + { + "bbox": [ + 206, + 515, + 246, + 527 + ], + "score": 0.91, + "content": "b \\in \\ [ B _ { I } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 513, + 268, + 528 + ], + "score": 1.0, + "content": ", lets", + "type": "text" + }, + { + "bbox": [ + 269, + 515, + 292, + 527 + ], + "score": 0.92, + "content": "f _ { h } ( b )", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 513, + 471, + 528 + ], + "score": 1.0, + "content": "denotes the frequency of items mapped to", + "type": "text" + }, + { + "bbox": [ + 472, + 516, + 478, + 525 + ], + "score": 0.75, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 513, + 504, + 528 + ], + "score": 1.0, + "content": "under", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 523, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 113, + 537 + ], + "score": 0.37, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 523, + 120, + 542 + ], + "score": 1.0, + "content": ";", + "type": "text" + }, + { + "bbox": [ + 120, + 526, + 218, + 540 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\dot { f } ( b ) : = \\sum _ { i \\in I : h ( i ) = b } f _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 523, + 440, + 542 + ], + "score": 1.0, + "content": ". Recall that the estimation error of a hash function", + "type": "text" + }, + { + "bbox": [ + 441, + 527, + 448, + 536 + ], + "score": 0.8, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 523, + 506, + 542 + ], + "score": 1.0, + "content": "is defined as", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 539, + 484, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 291, + 554 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { h } ( I ) ) : = \\sum _ { i \\in I } f _ { i } \\cdot \\left( f ( h ( i ) ) - i \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 539, + 396, + 556 + ], + "score": 1.0, + "content": ". Note that we can rewrite", + "type": "text" + }, + { + "bbox": [ + 396, + 540, + 470, + 554 + ], + "score": 0.91, + "content": "\\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { h } ( I ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 539, + 484, + 556 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 158, + 553, + 453, + 608 + ], + "lines": [ + { + "bbox": [ + 158, + 553, + 453, + 608 + ], + "spans": [ + { + "bbox": [ + 158, + 553, + 453, + 608 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\widetilde { \\mathcal { F } _ { h } } ( I ) ) = \\displaystyle \\sum _ { i \\in I } f _ { i } \\cdot ( f ( h ( i ) ) - f _ { i } ) = \\displaystyle \\sum _ { i \\in I } f _ { i } \\cdot f ( h ( i ) ) - \\displaystyle \\sum _ { i \\in I } f _ { i } ^ { 2 } } \\\\ { = \\displaystyle \\sum _ { b \\in [ B _ { I } ] } f ( b ) ^ { 2 } - \\displaystyle \\sum _ { i \\in I } f _ { i } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "3a8aed53678ef8b5dc116ebb027c71c46433e7c2631dd3322910603f64ab9e7a.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 158, + 553, + 453, + 571.3333333333334 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 158, + 571.3333333333334, + 453, + 589.6666666666667 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 158, + 589.6666666666667, + 453, + 608.0000000000001 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 608, + 505, + 632 + ], + "lines": [ + { + "bbox": [ + 106, + 606, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 606, + 324, + 620 + ], + "score": 1.0, + "content": "Note that in (10.1) the second term is independent of", + "type": "text" + }, + { + "bbox": [ + 324, + 608, + 331, + 617 + ], + "score": 0.81, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 606, + 505, + 620 + ], + "score": 1.0, + "content": "and is a constant. Hence, an optimal hash", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 616, + 302, + 633 + ], + "spans": [ + { + "bbox": [ + 104, + 616, + 242, + 633 + ], + "score": 1.0, + "content": "function minimizes the first term,", + "type": "text" + }, + { + "bbox": [ + 243, + 618, + 297, + 632 + ], + "score": 0.93, + "content": "\\sum { _ { b \\in B _ { I } } \\hat { f ( b ) ^ { 2 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 616, + 302, + 633 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 636, + 505, + 705 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 193, + 655 + ], + "score": 1.0, + "content": "Suppose that an item", + "type": "text" + }, + { + "bbox": [ + 193, + 640, + 203, + 649 + ], + "score": 0.84, + "content": "i ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 636, + 299, + 655 + ], + "score": 1.0, + "content": "with frequency at least", + "type": "text" + }, + { + "bbox": [ + 299, + 636, + 317, + 653 + ], + "score": 0.93, + "content": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 636, + 482, + 655 + ], + "score": 1.0, + "content": "collides with a (non-empty) set of items", + "type": "text" + }, + { + "bbox": [ + 482, + 639, + 505, + 651 + ], + "score": 0.87, + "content": "I ^ { * } \\subseteq", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 650, + 506, + 665 + ], + "spans": [ + { + "bbox": [ + 106, + 651, + 141, + 664 + ], + "score": 0.92, + "content": "I \\setminus \\{ i ^ { * } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 650, + 272, + 665 + ], + "score": 1.0, + "content": "under an optimal hash function", + "type": "text" + }, + { + "bbox": [ + 272, + 652, + 283, + 662 + ], + "score": 0.87, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 650, + 506, + 665 + ], + "score": 1.0, + "content": ". Since the total frequency of the items mapped to the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 135, + 659, + 492, + 699 + ], + "spans": [ + { + "bbox": [ + 135, + 666, + 145, + 676 + ], + "score": 0.85, + "content": "b ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 659, + 191, + 699 + ], + "score": 1.0, + "content": "ntaining . Next,", + "type": "text" + }, + { + "bbox": [ + 191, + 666, + 200, + 676 + ], + "score": 0.85, + "content": "i ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 659, + 262, + 699 + ], + "score": 1.0, + "content": "is greater than define a new h", + "type": "text" + }, + { + "bbox": [ + 262, + 663, + 280, + 680 + ], + "score": 0.93, + "content": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 659, + 302, + 699 + ], + "score": 1.0, + "content": "(i.e., uncti", + "type": "text" + }, + { + "bbox": [ + 302, + 663, + 371, + 680 + ], + "score": 0.94, + "content": "\\begin{array} { r } { f ( h ( i ^ { * } ) ) > \\frac { f ( I ) } { B _ { I } } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 659, + 460, + 699 + ], + "score": 1.0, + "content": ", there exists a bucket estimation error com", + "type": "text" + }, + { + "bbox": [ + 460, + 665, + 465, + 676 + ], + "score": 0.8, + "content": "\\bar { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 659, + 492, + 699 + ], + "score": 1.0, + "content": "such tred to", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 678, + 504, + 695 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 157, + 695 + ], + "score": 0.93, + "content": "\\begin{array} { r } { f ( \\overline { { b } } ) < \\frac { f ( I ) } { B _ { I } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 681, + 319, + 691 + ], + "score": 0.81, + "content": "\\bar { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 681, + 504, + 691 + ], + "score": 0.82, + "content": "h ^ { * }", + "type": "inline_equation" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 693, + 264, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 248, + 705 + ], + "score": 1.0, + "content": "which contradicts the optimality of", + "type": "text" + }, + { + "bbox": [ + 249, + 694, + 259, + 703 + ], + "score": 0.87, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 693, + 264, + 705 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35 + }, + { + "type": "interline_equation", + "bbox": [ + 240, + 703, + 365, + 731 + ], + "lines": [ + { + "bbox": [ + 240, + 703, + 365, + 731 + ], + "spans": [ + { + "bbox": [ + 240, + 703, + 365, + 731 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\overline { { h } } ( i ) = \\left\\{ \\begin{array} { l l } { h ^ { * } ( i ) } & { \\mathrm { i f ~ } i \\in I \\setminus I ^ { * } } \\\\ { \\overline { { b } } } & { \\mathrm { o t h e r w i s e . } } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "e7c34b4083fafcaa8b2fb514148f0b60949f9fa81806fe41eeca6b80c65c0e21.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 240, + 703, + 365, + 731 + ], + "spans": [], + "index": 38 + } + ] + } + ], + "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 2019", + "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": "text", + "bbox": [ + 105, + 82, + 505, + 106 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 257, + 94 + ], + "score": 1.0, + "content": "Next, we consider different values of", + "type": "text" + }, + { + "bbox": [ + 257, + 83, + 264, + 92 + ], + "score": 0.82, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "and show that in each case what is the minimum amount of", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 442, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 398, + 106 + ], + "score": 1.0, + "content": "space in which Learned CM outperforms CM by a factor of 1.06 (setting", + "type": "text" + }, + { + "bbox": [ + 399, + 94, + 437, + 105 + ], + "score": 0.86, + "content": "\\varepsilon = 0 . 0 6 ", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 93, + 442, + 106 + ], + "score": 1.0, + "content": ").", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 82, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 133, + 120, + 505, + 153 + ], + "lines": [ + { + "bbox": [ + 132, + 119, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 132, + 119, + 142, + 133 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 120, + 170, + 131 + ], + "score": 0.89, + "content": "\\mathbf k = \\mathbf 1", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 119, + 505, + 133 + ], + "score": 1.0, + "content": ". In this case, we are basically comparing the expected error of a single hash function", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 142, + 131, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 142, + 132, + 427, + 144 + ], + "score": 1.0, + "content": "and Learned Count-Min. In particular, in order to get a gap of at least", + "type": "text" + }, + { + "bbox": [ + 427, + 131, + 457, + 144 + ], + "score": 0.91, + "content": "( 1 + \\varepsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 132, + 505, + 144 + ], + "score": 1.0, + "content": ", by a more", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 142, + 142, + 425, + 155 + ], + "spans": [ + { + "bbox": [ + 142, + 142, + 268, + 155 + ], + "score": 1.0, + "content": "careful analysis of Lemma 9.2,", + "type": "text" + }, + { + "bbox": [ + 268, + 144, + 276, + 153 + ], + "score": 0.74, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 142, + 425, + 155 + ], + "score": 1.0, + "content": "must satisfy the following condition:", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 132, + 119, + 505, + 155 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 163, + 153, + 483, + 181 + ], + "lines": [ + { + "bbox": [ + 163, + 153, + 483, + 181 + ], + "spans": [ + { + "bbox": [ + 163, + 153, + 483, + 181 + ], + "score": 0.69, + "content": "\\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { 1 } { \\alpha \\gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\frac { \\ln ^ { 2 } n - 1 . 6 5 } { ( 1 + \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf { E } [ \\mathrm { E r r } _ { h } ] ,", + "type": "interline_equation", + "image_path": "7fad2b446cd94ecdad3603ce91af52ebba5f9b015e027c52bb4b9f697dd62fd6.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 163, + 153, + 483, + 181 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 142, + 181, + 504, + 208 + ], + "lines": [ + { + "bbox": [ + 141, + 180, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 141, + 180, + 291, + 196 + ], + "score": 1.0, + "content": "To simplify it further, we require that", + "type": "text" + }, + { + "bbox": [ + 291, + 181, + 444, + 196 + ], + "score": 0.86, + "content": "( \\ln ( \\textstyle \\frac { 2 } { \\gamma } ) + 0 . 5 8 ) ^ { 2 } \\leq 3 . 1 8 \\cdot ( \\ln ^ { 2 } n - 1 . 6 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 180, + 505, + 196 + ], + "score": 1.0, + "content": ") which implies", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 194, + 227, + 209 + ], + "spans": [ + { + "bbox": [ + 141, + 194, + 160, + 209 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 160, + 195, + 223, + 207 + ], + "score": 0.92, + "content": "\\gamma = \\Theta ( 1 / \\ln n )", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 194, + 227, + 209 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 141, + 180, + 505, + 209 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 220, + 504, + 254 + ], + "lines": [ + { + "bbox": [ + 132, + 221, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 132, + 221, + 142, + 235 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 222, + 171, + 232 + ], + "score": 0.88, + "content": "k = 2", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 221, + 226, + 235 + ], + "score": 1.0, + "content": ". In this case,", + "type": "text" + }, + { + "bbox": [ + 227, + 221, + 290, + 237 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\gamma \\le \\frac { 3 . 5 8 } { e ^ { \\sqrt { ( \\ln n ) / 4 . 5 } } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 221, + 415, + 234 + ], + "score": 1.0, + "content": "for sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 415, + 222, + 424, + 232 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 221, + 505, + 234 + ], + "score": 1.0, + "content": ". Hence, we require", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 142, + 236, + 383, + 253 + ], + "spans": [ + { + "bbox": [ + 142, + 237, + 340, + 249 + ], + "score": 1.0, + "content": "that the total amount of available space is at least", + "type": "text" + }, + { + "bbox": [ + 340, + 236, + 383, + 253 + ], + "score": 0.93, + "content": "\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 4 . 5 } } }", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 132, + 221, + 505, + 253 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 267, + 505, + 300 + ], + "lines": [ + { + "bbox": [ + 132, + 267, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 132, + 267, + 142, + 282 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 268, + 193, + 281 + ], + "score": 0.89, + "content": "k \\in \\{ 3 , 4 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 267, + 251, + 282 + ], + "score": 1.0, + "content": ": In this case,", + "type": "text" + }, + { + "bbox": [ + 252, + 268, + 316, + 285 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\gamma \\le \\frac { 2 } { e \\sqrt { ( \\ln n ) / 3 . 5 } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 268, + 444, + 281 + ], + "score": 1.0, + "content": "for sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 444, + 270, + 453, + 279 + ], + "score": 0.83, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 268, + 505, + 281 + ], + "score": 1.0, + "content": ". Hence, we", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 142, + 283, + 414, + 300 + ], + "spans": [ + { + "bbox": [ + 142, + 285, + 371, + 296 + ], + "score": 1.0, + "content": "require that the total amount of available space is at least", + "type": "text" + }, + { + "bbox": [ + 371, + 283, + 414, + 300 + ], + "score": 0.93, + "content": "\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 3 . 5 } } }", + "type": "inline_equation" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 132, + 267, + 505, + 300 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 315, + 505, + 347 + ], + "lines": [ + { + "bbox": [ + 132, + 315, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 132, + 315, + 142, + 330 + ], + "score": 1.0, + "content": "•", + "type": "text" + }, + { + "bbox": [ + 142, + 316, + 171, + 328 + ], + "score": 0.88, + "content": "\\mathbf { \\delta } _ { k } \\geq \\mathbf { 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 315, + 226, + 330 + ], + "score": 1.0, + "content": ". In this case,", + "type": "text" + }, + { + "bbox": [ + 227, + 315, + 290, + 332 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\gamma \\le \\frac { 2 } { e ^ { \\sqrt { ( \\ln n ) / 2 . 6 } } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 316, + 415, + 328 + ], + "score": 1.0, + "content": "for sufficiently large values of", + "type": "text" + }, + { + "bbox": [ + 415, + 317, + 424, + 326 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 316, + 505, + 328 + ], + "score": 1.0, + "content": ". Hence, we require", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 142, + 330, + 383, + 347 + ], + "spans": [ + { + "bbox": [ + 142, + 331, + 340, + 343 + ], + "score": 1.0, + "content": "that the total amount of available space is at least", + "type": "text" + }, + { + "bbox": [ + 341, + 330, + 383, + 347 + ], + "score": 0.93, + "content": "\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 2 . 6 } } }", + "type": "inline_equation" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 132, + 315, + 505, + 347 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 361, + 505, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 504, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 374, + 373 + ], + "score": 1.0, + "content": "We also note that settings where the number of buckets is close to", + "type": "text" + }, + { + "bbox": [ + 374, + 364, + 381, + 371 + ], + "score": 0.76, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 361, + 504, + 373 + ], + "score": 1.0, + "content": "are quite common in practice.", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 371, + 505, + 385 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 258, + 385 + ], + "score": 1.0, + "content": "For example, Goyal et al. (2012) uses", + "type": "text" + }, + { + "bbox": [ + 259, + 372, + 388, + 384 + ], + "score": 0.9, + "content": "( ( 1 + \\alpha ) B = 2 0 M , n = 3 3 . 5 M )", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 371, + 408, + 385 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 408, + 372, + 505, + 384 + ], + "score": 0.89, + "content": "( ( 1 + \\alpha ) B = 5 \\bar { 0 } M , n =", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 383, + 505, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 131, + 394 + ], + "score": 0.64, + "content": "9 4 M )", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 383, + 154, + 396 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 154, + 384, + 180, + 394 + ], + "score": 0.88, + "content": "k = 3", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 383, + 380, + 396 + ], + "score": 1.0, + "content": ", while Kumar et al. (2004) uses different pairs of", + "type": "text" + }, + { + "bbox": [ + 381, + 384, + 438, + 396 + ], + "score": 0.9, + "content": "( ( 1 + \\alpha ) B , n )", + "type": "inline_equation" + }, + { + "bbox": [ + 438, + 383, + 483, + 396 + ], + "score": 1.0, + "content": "including", + "type": "text" + }, + { + "bbox": [ + 483, + 384, + 505, + 394 + ], + "score": 0.82, + "content": "B =", + "type": "inline_equation" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 393, + 506, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 186, + 406 + ], + "score": 0.88, + "content": "2 8 8 K , n \\ = \\ 5 6 3 K )", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 393, + 506, + 407 + ], + "score": 1.0, + "content": ". Plugging these values into the exact formulas computed above shows that", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 406, + 317, + 417 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 317, + 417 + ], + "score": 1.0, + "content": "Learned CM has a significantly lower loss than CM.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 361, + 506, + 417 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 428, + 267, + 441 + ], + "lines": [ + { + "bbox": [ + 106, + 427, + 268, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 427, + 268, + 442 + ], + "score": 1.0, + "content": "10. OPTIMAL HASH FUNCTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 105, + 447, + 504, + 470 + ], + "lines": [ + { + "bbox": [ + 105, + 445, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 506, + 461 + ], + "score": 1.0, + "content": "In this section we compute an asymptotic bound error bound of optimal hash functions that map", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 457, + 265, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 131, + 471 + ], + "score": 1.0, + "content": "items", + "type": "text" + }, + { + "bbox": [ + 131, + 458, + 143, + 470 + ], + "score": 0.88, + "content": "[ n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 457, + 219, + 471 + ], + "score": 1.0, + "content": "to a set of buckets", + "type": "text" + }, + { + "bbox": [ + 219, + 458, + 261, + 470 + ], + "score": 0.93, + "content": "C [ 1 \\cdots B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 457, + 265, + 471 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 445, + 506, + 471 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 472, + 506, + 512 + ], + "lines": [ + { + "bbox": [ + 106, + 472, + 505, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 472, + 236, + 486 + ], + "score": 1.0, + "content": "Claim 10.1. For a set of items", + "type": "text" + }, + { + "bbox": [ + 236, + 474, + 243, + 483 + ], + "score": 0.65, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 472, + 262, + 486 + ], + "score": 1.0, + "content": ", let", + "type": "text" + }, + { + "bbox": [ + 262, + 473, + 281, + 485 + ], + "score": 0.91, + "content": "f ( I )", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 472, + 455, + 486 + ], + "score": 1.0, + "content": "denote the total frequency of all items in", + "type": "text" + }, + { + "bbox": [ + 456, + 474, + 462, + 483 + ], + "score": 0.32, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 472, + 468, + 486 + ], + "score": 1.0, + "content": ";", + "type": "text" + }, + { + "bbox": [ + 468, + 473, + 505, + 485 + ], + "score": 0.81, + "content": "f ( I ) : =", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 483, + 506, + 498 + ], + "spans": [ + { + "bbox": [ + 106, + 484, + 140, + 497 + ], + "score": 0.91, + "content": "\\textstyle \\sum _ { i \\in I } f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 483, + 295, + 498 + ], + "score": 1.0, + "content": ". In any optimal hash function of form", + "type": "text" + }, + { + "bbox": [ + 295, + 484, + 359, + 496 + ], + "score": 0.93, + "content": "\\{ h : I [ B _ { I } ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 483, + 506, + 498 + ], + "score": 1.0, + "content": "with minimum estimation error, any", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 495, + 409, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 495, + 219, + 514 + ], + "score": 1.0, + "content": "item with frequency at least", + "type": "text" + }, + { + "bbox": [ + 219, + 496, + 237, + 513 + ], + "score": 0.93, + "content": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 495, + 398, + 514 + ], + "score": 1.0, + "content": "does not collide with any other items in", + "type": "text" + }, + { + "bbox": [ + 398, + 499, + 405, + 509 + ], + "score": 0.62, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 495, + 409, + 514 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 106, + 472, + 506, + 514 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 515, + 502, + 554 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 504, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 206, + 528 + ], + "score": 1.0, + "content": "Proof: For each bucket", + "type": "text" + }, + { + "bbox": [ + 206, + 515, + 246, + 527 + ], + "score": 0.91, + "content": "b \\in \\ [ B _ { I } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 246, + 513, + 268, + 528 + ], + "score": 1.0, + "content": ", lets", + "type": "text" + }, + { + "bbox": [ + 269, + 515, + 292, + 527 + ], + "score": 0.92, + "content": "f _ { h } ( b )", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 513, + 471, + 528 + ], + "score": 1.0, + "content": "denotes the frequency of items mapped to", + "type": "text" + }, + { + "bbox": [ + 472, + 516, + 478, + 525 + ], + "score": 0.75, + "content": "b", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 513, + 504, + 528 + ], + "score": 1.0, + "content": "under", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 523, + 506, + 542 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 113, + 537 + ], + "score": 0.37, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 523, + 120, + 542 + ], + "score": 1.0, + "content": ";", + "type": "text" + }, + { + "bbox": [ + 120, + 526, + 218, + 540 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\dot { f } ( b ) : = \\sum _ { i \\in I : h ( i ) = b } f _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 523, + 440, + 542 + ], + "score": 1.0, + "content": ". Recall that the estimation error of a hash function", + "type": "text" + }, + { + "bbox": [ + 441, + 527, + 448, + 536 + ], + "score": 0.8, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 523, + 506, + 542 + ], + "score": 1.0, + "content": "is defined as", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 539, + 484, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 291, + 554 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { h } ( I ) ) : = \\sum _ { i \\in I } f _ { i } \\cdot \\left( f ( h ( i ) ) - i \\right) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 539, + 396, + 556 + ], + "score": 1.0, + "content": ". Note that we can rewrite", + "type": "text" + }, + { + "bbox": [ + 396, + 540, + 470, + 554 + ], + "score": 0.91, + "content": "\\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { h } ( I ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 539, + 484, + 556 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 513, + 506, + 556 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 158, + 553, + 453, + 608 + ], + "lines": [ + { + "bbox": [ + 158, + 553, + 453, + 608 + ], + "spans": [ + { + "bbox": [ + 158, + 553, + 453, + 608 + ], + "score": 0.84, + "content": "\\begin{array} { r } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\widetilde { \\mathcal { F } _ { h } } ( I ) ) = \\displaystyle \\sum _ { i \\in I } f _ { i } \\cdot ( f ( h ( i ) ) - f _ { i } ) = \\displaystyle \\sum _ { i \\in I } f _ { i } \\cdot f ( h ( i ) ) - \\displaystyle \\sum _ { i \\in I } f _ { i } ^ { 2 } } \\\\ { = \\displaystyle \\sum _ { b \\in [ B _ { I } ] } f ( b ) ^ { 2 } - \\displaystyle \\sum _ { i \\in I } f _ { i } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "3a8aed53678ef8b5dc116ebb027c71c46433e7c2631dd3322910603f64ab9e7a.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 158, + 553, + 453, + 571.3333333333334 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 158, + 571.3333333333334, + 453, + 589.6666666666667 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 158, + 589.6666666666667, + 453, + 608.0000000000001 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 608, + 505, + 632 + ], + "lines": [ + { + "bbox": [ + 106, + 606, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 606, + 324, + 620 + ], + "score": 1.0, + "content": "Note that in (10.1) the second term is independent of", + "type": "text" + }, + { + "bbox": [ + 324, + 608, + 331, + 617 + ], + "score": 0.81, + "content": "h", + "type": "inline_equation" + }, + { + "bbox": [ + 331, + 606, + 505, + 620 + ], + "score": 1.0, + "content": "and is a constant. Hence, an optimal hash", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 616, + 302, + 633 + ], + "spans": [ + { + "bbox": [ + 104, + 616, + 242, + 633 + ], + "score": 1.0, + "content": "function minimizes the first term,", + "type": "text" + }, + { + "bbox": [ + 243, + 618, + 297, + 632 + ], + "score": 0.93, + "content": "\\sum { _ { b \\in B _ { I } } \\hat { f ( b ) ^ { 2 } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 616, + 302, + 633 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 104, + 606, + 505, + 633 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 636, + 505, + 705 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 193, + 655 + ], + "score": 1.0, + "content": "Suppose that an item", + "type": "text" + }, + { + "bbox": [ + 193, + 640, + 203, + 649 + ], + "score": 0.84, + "content": "i ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 636, + 299, + 655 + ], + "score": 1.0, + "content": "with frequency at least", + "type": "text" + }, + { + "bbox": [ + 299, + 636, + 317, + 653 + ], + "score": 0.93, + "content": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 636, + 482, + 655 + ], + "score": 1.0, + "content": "collides with a (non-empty) set of items", + "type": "text" + }, + { + "bbox": [ + 482, + 639, + 505, + 651 + ], + "score": 0.87, + "content": "I ^ { * } \\subseteq", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 650, + 506, + 665 + ], + "spans": [ + { + "bbox": [ + 106, + 651, + 141, + 664 + ], + "score": 0.92, + "content": "I \\setminus \\{ i ^ { * } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 650, + 272, + 665 + ], + "score": 1.0, + "content": "under an optimal hash function", + "type": "text" + }, + { + "bbox": [ + 272, + 652, + 283, + 662 + ], + "score": 0.87, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 650, + 506, + 665 + ], + "score": 1.0, + "content": ". Since the total frequency of the items mapped to the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 135, + 659, + 492, + 699 + ], + "spans": [ + { + "bbox": [ + 135, + 666, + 145, + 676 + ], + "score": 0.85, + "content": "b ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 659, + 191, + 699 + ], + "score": 1.0, + "content": "ntaining . Next,", + "type": "text" + }, + { + "bbox": [ + 191, + 666, + 200, + 676 + ], + "score": 0.85, + "content": "i ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 659, + 262, + 699 + ], + "score": 1.0, + "content": "is greater than define a new h", + "type": "text" + }, + { + "bbox": [ + 262, + 663, + 280, + 680 + ], + "score": 0.93, + "content": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 659, + 302, + 699 + ], + "score": 1.0, + "content": "(i.e., uncti", + "type": "text" + }, + { + "bbox": [ + 302, + 663, + 371, + 680 + ], + "score": 0.94, + "content": "\\begin{array} { r } { f ( h ( i ^ { * } ) ) > \\frac { f ( I ) } { B _ { I } } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 659, + 460, + 699 + ], + "score": 1.0, + "content": ", there exists a bucket estimation error com", + "type": "text" + }, + { + "bbox": [ + 460, + 665, + 465, + 676 + ], + "score": 0.8, + "content": "\\bar { b }", + "type": "inline_equation" + }, + { + "bbox": [ + 466, + 659, + 492, + 699 + ], + "score": 1.0, + "content": "such tred to", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 678, + 504, + 695 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 157, + 695 + ], + "score": 0.93, + "content": "\\begin{array} { r } { f ( \\overline { { b } } ) < \\frac { f ( I ) } { B _ { I } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 681, + 319, + 691 + ], + "score": 0.81, + "content": "\\bar { h }", + "type": "inline_equation" + }, + { + "bbox": [ + 492, + 681, + 504, + 691 + ], + "score": 0.82, + "content": "h ^ { * }", + "type": "inline_equation" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 693, + 264, + 705 + ], + "spans": [ + { + "bbox": [ + 106, + 693, + 248, + 705 + ], + "score": 1.0, + "content": "which contradicts the optimality of", + "type": "text" + }, + { + "bbox": [ + 249, + 694, + 259, + 703 + ], + "score": 0.87, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 693, + 264, + 705 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 636, + 506, + 705 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 240, + 703, + 365, + 731 + ], + "lines": [ + { + "bbox": [ + 240, + 703, + 365, + 731 + ], + "spans": [ + { + "bbox": [ + 240, + 703, + 365, + 731 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\overline { { h } } ( i ) = \\left\\{ \\begin{array} { l l } { h ^ { * } ( i ) } & { \\mathrm { i f ~ } i \\in I \\setminus I ^ { * } } \\\\ { \\overline { { b } } } & { \\mathrm { o t h e r w i s e . } } \\end{array} \\right. } \\end{array}", + "type": "interline_equation", + "image_path": "e7c34b4083fafcaa8b2fb514148f0b60949f9fa81806fe41eeca6b80c65c0e21.jpg" + } + ] + } + ], + "index": 38, + "virtual_lines": [ + { + "bbox": [ + 240, + 703, + 365, + 731 + ], + "spans": [], + "index": 38 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 83, + 146, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 148, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 148, + 96 + ], + "score": 1.0, + "content": "Formally,", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 91, + 503, + 184 + ], + "lines": [ + { + "bbox": [ + 111, + 91, + 503, + 184 + ], + "spans": [ + { + "bbox": [ + 111, + 91, + 503, + 184 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { \\widehat { \\mathrm { E r r } ( F ( I ) , \\tilde { F } _ { h ^ { \\ast } } ( I ) ) } - \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { \\overline { { h } } } ( I ) ) = f _ { h ^ { \\ast } } ( b ^ { \\ast } ) ^ { 2 } + f _ { h ^ { \\ast } } ( \\overline { { b } } ) ^ { 2 } - f _ { \\overline { { h } } } ( b ^ { \\ast } ) ^ { 2 } - f _ { \\overline { { h } } } ( \\overline { { b } } ) ^ { 2 } } & { } \\\\ { = ( f _ { i ^ { \\ast } } + f ( I ^ { \\ast } ) ) ^ { 2 } + f _ { h ^ { \\ast } } ( \\overline { { b } } ) ^ { 2 } - f _ { i ^ { \\ast } } ^ { 2 } - ( f _ { h ^ { \\ast } } ( \\overline { { b } } ) + f ( I ^ { \\ast } ) ) ^ { 2 } } & { } \\\\ { = 2 f _ { i ^ { \\ast } } \\cdot f ( I ^ { \\ast } ) - 2 f _ { h ^ { \\ast } } ( \\overline { { b } } ) \\cdot f ( I ^ { \\ast } ) } & { } \\\\ { = 2 f ( I ^ { \\ast } ) \\cdot ( f _ { i ^ { \\ast } } - f _ { h ^ { \\ast } } ( \\overline { { b } } ) ) } & { } \\\\ { > 0 \\quad \\triangleright \\mathrm { S i n c e ~ } f _ { i ^ { \\ast } } > \\frac { f ( I ) } { B } > f _ { h ^ { \\ast } } ( \\overline { { b } } ) . } & { } \\end{array}", + "type": "interline_equation", + "image_path": "9f5aa6041decdbfbebdb2709b1c988dce34a7617afa0f89e84ed7ccdf3c3d76d.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 111, + 91, + 503, + 122.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 122.0, + 503, + 153.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 153.0, + 503, + 184.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 189, + 504, + 213 + ], + "lines": [ + { + "bbox": [ + 105, + 188, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 315, + 203 + ], + "score": 1.0, + "content": "Next, we show that in any optimal hash function", + "type": "text" + }, + { + "bbox": [ + 316, + 190, + 387, + 202 + ], + "score": 0.93, + "content": "h ^ { * } : [ n ] \\ \\to \\ [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 188, + 505, + 203 + ], + "score": 1.0, + "content": "and assuming Zipfian input", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 200, + 447, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 157, + 213 + ], + "score": 1.0, + "content": "distribution,", + "type": "text" + }, + { + "bbox": [ + 158, + 201, + 182, + 213 + ], + "score": 0.92, + "content": "\\Theta ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 200, + 431, + 213 + ], + "score": 1.0, + "content": "most frequent items do not collide with any other items under", + "type": "text" + }, + { + "bbox": [ + 432, + 201, + 443, + 211 + ], + "score": 0.86, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 200, + 447, + 213 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 106, + 215, + 506, + 252 + ], + "lines": [ + { + "bbox": [ + 104, + 214, + 506, + 229 + ], + "spans": [ + { + "bbox": [ + 104, + 214, + 219, + 229 + ], + "score": 1.0, + "content": "Lemma 10.2. Suppose that", + "type": "text" + }, + { + "bbox": [ + 219, + 216, + 258, + 228 + ], + "score": 0.84, + "content": "B = n / \\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 214, + 285, + 229 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 285, + 215, + 321, + 227 + ], + "score": 0.85, + "content": "\\gamma \\geq e ^ { 4 . 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 214, + 506, + 229 + ], + "score": 1.0, + "content": "is a constant and lets assume that items follow", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 271, + 240 + ], + "score": 1.0, + "content": "Zipfian distribution. In any hash function", + "type": "text" + }, + { + "bbox": [ + 272, + 227, + 331, + 239 + ], + "score": 0.91, + "content": "h ^ { * } : [ n ] [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "with minimum estimation error, none of the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 237, + 501, + 254 + ], + "spans": [ + { + "bbox": [ + 107, + 238, + 128, + 254 + ], + "score": 0.92, + "content": "\\frac { B } { 2 \\ln \\gamma }", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 237, + 501, + 254 + ], + "score": 1.0, + "content": "most frequent items collide with any other items (i.e., they are mapped to a singleton bucket).", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 255, + 506, + 357 + ], + "lines": [ + { + "bbox": [ + 105, + 255, + 507, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 154, + 270 + ], + "score": 1.0, + "content": "Proof: Let", + "type": "text" + }, + { + "bbox": [ + 154, + 257, + 167, + 268 + ], + "score": 0.88, + "content": "i _ { j ^ { * } }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 255, + 476, + 270 + ], + "score": 1.0, + "content": "be the most frequent item that is not mapped to a singleton bucket under", + "type": "text" + }, + { + "bbox": [ + 476, + 256, + 487, + 266 + ], + "score": 0.86, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 255, + 507, + 270 + ], + "score": 1.0, + "content": ". If", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 266, + 508, + 286 + ], + "spans": [ + { + "bbox": [ + 107, + 267, + 151, + 283 + ], + "score": 0.93, + "content": "\\begin{array} { r } { j ^ { * } > \\frac { B } { 2 \\ln \\gamma } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 266, + 375, + 286 + ], + "score": 1.0, + "content": "then the statement holds. Suppose it is not the case and", + "type": "text" + }, + { + "bbox": [ + 375, + 267, + 419, + 282 + ], + "score": 0.93, + "content": "\\begin{array} { r } { j ^ { * } \\le \\frac { B } { 2 \\ln \\gamma } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 266, + 439, + 286 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 440, + 268, + 447, + 278 + ], + "score": 0.7, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 266, + 508, + 286 + ], + "score": 1.0, + "content": "denote the set", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 280, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 236, + 295 + ], + "score": 1.0, + "content": "of items with frequency at most", + "type": "text" + }, + { + "bbox": [ + 236, + 281, + 283, + 294 + ], + "score": 0.92, + "content": "f _ { j ^ { * } } = 1 / j ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 280, + 305, + 295 + ], + "score": 1.0, + "content": "(i.e.,", + "type": "text" + }, + { + "bbox": [ + 306, + 281, + 382, + 294 + ], + "score": 0.91, + "content": "I = \\{ i _ { j } \\mid j \\geq j ^ { * } \\} )", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 280, + 413, + 295 + ], + "score": 1.0, + "content": "and let", + "type": "text" + }, + { + "bbox": [ + 414, + 282, + 427, + 293 + ], + "score": 0.87, + "content": "B _ { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 280, + 506, + 295 + ], + "score": 1.0, + "content": "denote the number", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 293, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 287, + 305 + ], + "score": 1.0, + "content": "of buckets that the items with index at least", + "type": "text" + }, + { + "bbox": [ + 287, + 294, + 298, + 304 + ], + "score": 0.87, + "content": "j ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 293, + 348, + 305 + ], + "score": 1.0, + "content": "mapped to;", + "type": "text" + }, + { + "bbox": [ + 348, + 293, + 426, + 304 + ], + "score": 0.9, + "content": "B _ { I } = B - j ^ { * } + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 293, + 505, + 305 + ], + "score": 1.0, + "content": ". Also note that by", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 303, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 175, + 317 + ], + "score": 1.0, + "content": "Observation 9.1,", + "type": "text" + }, + { + "bbox": [ + 175, + 303, + 252, + 318 + ], + "score": 0.93, + "content": "\\begin{array} { r } { f ( I ) < \\ln ( \\frac { n } { j ^ { * } } ) + 1 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 303, + 397, + 317 + ], + "score": 1.0, + "content": ". Next, by Claim 10.1, we show that", + "type": "text" + }, + { + "bbox": [ + 397, + 304, + 408, + 313 + ], + "score": 0.86, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 303, + 506, + 317 + ], + "score": 1.0, + "content": "does not hash the items", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 316, + 503, + 335 + ], + "spans": [ + { + "bbox": [ + 107, + 319, + 156, + 331 + ], + "score": 0.92, + "content": "\\{ j ^ { * } , \\cdots , n \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 317, + 168, + 335 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 168, + 320, + 181, + 331 + ], + "score": 0.9, + "content": "B _ { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 317, + 420, + 335 + ], + "score": 1.0, + "content": "optimally. In particular, we show that the frequency of item", + "type": "text" + }, + { + "bbox": [ + 420, + 320, + 430, + 331 + ], + "score": 0.88, + "content": "j ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 317, + 483, + 335 + ], + "score": 1.0, + "content": "is more than", + "type": "text" + }, + { + "bbox": [ + 483, + 316, + 501, + 333 + ], + "score": 0.92, + "content": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 317, + 503, + 335 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 331, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 301, + 345 + ], + "score": 1.0, + "content": "To prove this, first we observe that the function", + "type": "text" + }, + { + "bbox": [ + 302, + 332, + 408, + 344 + ], + "score": 0.93, + "content": "g ( j ) : = j \\cdot ( \\ln ( n / j ) + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 331, + 506, + 345 + ], + "score": 1.0, + "content": "is strictly increasing in", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 342, + 244, + 361 + ], + "spans": [ + { + "bbox": [ + 107, + 344, + 128, + 357 + ], + "score": 0.9, + "content": "[ 1 , n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 342, + 194, + 361 + ], + "score": 1.0, + "content": ". Hence, for any", + "type": "text" + }, + { + "bbox": [ + 195, + 343, + 238, + 358 + ], + "score": 0.92, + "content": "\\begin{array} { r } { j ^ { * } \\le \\frac { B } { 2 \\ln \\gamma } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 342, + 244, + 361 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12.5 + }, + { + "type": "interline_equation", + "bbox": [ + 135, + 358, + 478, + 410 + ], + "lines": [ + { + "bbox": [ + 135, + 358, + 478, + 410 + ], + "spans": [ + { + "bbox": [ + 135, + 358, + 478, + 410 + ], + "score": 0.85, + "content": "\\begin{array} { r l r } { { j ^ { * } \\cdot ( \\ln ( \\frac { n } { j ^ { * } } ) + 1 ) \\le \\frac { B } { 2 \\ln \\gamma } \\cdot ( \\ln ( 2 \\gamma \\ln \\gamma ) + 1 ) } } \\\\ & { } & { \\le B \\cdot ( 1 - \\frac { 1 } { 2 \\ln \\gamma } ) \\quad \\triangleright \\mathrm { S i n c e ~ l n } ( 2 \\ln \\gamma ) + 2 < \\ln \\gamma \\mathrm { ~ f o r ~ l n } \\gamma \\ge 4 . 2 } \\end{array}", + "type": "interline_equation", + "image_path": "84a31bab9c5c770f1f3bf0ea424d3b88771a603c06329a88fd8a5dd33e70297d.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 135, + 358, + 478, + 375.3333333333333 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 135, + 375.3333333333333, + 478, + 392.66666666666663 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 135, + 392.66666666666663, + 478, + 409.99999999999994 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 422, + 505, + 448 + ], + "lines": [ + { + "bbox": [ + 104, + 419, + 507, + 441 + ], + "spans": [ + { + "bbox": [ + 104, + 419, + 131, + 441 + ], + "score": 1.0, + "content": "Thus,", + "type": "text" + }, + { + "bbox": [ + 132, + 422, + 255, + 439 + ], + "score": 0.94, + "content": "\\begin{array} { r } { f _ { j ^ { * } } = \\frac { 1 } { j ^ { * } } > \\frac { \\ln ( n / j ^ { * } ) + 1 } { B _ { I } } > \\frac { f ( I ) } { B _ { I } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 419, + 476, + 441 + ], + "score": 1.0, + "content": "which implies that an optimal hash function must map", + "type": "text" + }, + { + "bbox": [ + 476, + 425, + 486, + 436 + ], + "score": 0.87, + "content": "j ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 419, + 507, + 441 + ], + "score": 1.0, + "content": "to a", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 436, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 177, + 450 + ], + "score": 1.0, + "content": "singleton bucket.", + "type": "text" + }, + { + "bbox": [ + 495, + 438, + 505, + 447 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 108, + 451, + 503, + 480 + ], + "lines": [ + { + "bbox": [ + 106, + 450, + 504, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 450, + 181, + 465 + ], + "score": 1.0, + "content": "Theorem 10.3. If", + "type": "text" + }, + { + "bbox": [ + 181, + 451, + 231, + 464 + ], + "score": 0.91, + "content": "n / B \\geq e ^ { 4 . 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 450, + 496, + 465 + ], + "score": 1.0, + "content": ", then the estimation error of any hash function that maps a set of", + "type": "text" + }, + { + "bbox": [ + 497, + 454, + 504, + 462 + ], + "score": 0.69, + "content": "n", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 463, + 354, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 260, + 479 + ], + "score": 1.0, + "content": "items following Zipfian distribution to", + "type": "text" + }, + { + "bbox": [ + 260, + 468, + 269, + 477 + ], + "score": 0.75, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 466, + 312, + 479 + ], + "score": 1.0, + "content": "buckets is", + "type": "text" + }, + { + "bbox": [ + 312, + 463, + 354, + 481 + ], + "score": 0.94, + "content": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( \\frac { n } { B } ) } { B } \\big )", + "type": "inline_equation" + } + ], + "index": 23 + } + ], + "index": 22.5 + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 505, + 520 + ], + "lines": [ + { + "bbox": [ + 102, + 480, + 508, + 502 + ], + "spans": [ + { + "bbox": [ + 102, + 480, + 452, + 502 + ], + "score": 1.0, + "content": "Proof: By Lemma 10.2, in any hash function with minimum estimation error, the", + "type": "text" + }, + { + "bbox": [ + 452, + 483, + 480, + 498 + ], + "score": 0.91, + "content": "\\scriptstyle \\left( { \\frac { B } { 2 \\ln \\gamma } } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 480, + 508, + 502 + ], + "score": 1.0, + "content": "most", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 497, + 504, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 504, + 509 + ], + "score": 1.0, + "content": "frequent items do not collide with any other items (i.e., they are mapped into a singleton bucket)", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 507, + 206, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 133, + 520 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 507, + 201, + 520 + ], + "score": 0.92, + "content": "\\gamma = n / B > e ^ { 4 . 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 507, + 206, + 520 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 524, + 505, + 562 + ], + "lines": [ + { + "bbox": [ + 105, + 524, + 505, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 344, + 537 + ], + "score": 1.0, + "content": "Hence, the goal is to minimize (10.1) for the set of items", + "type": "text" + }, + { + "bbox": [ + 345, + 525, + 351, + 535 + ], + "score": 0.77, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 524, + 505, + 537 + ], + "score": 1.0, + "content": "which consist of all items other than", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 536, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 122, + 548 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 119, + 536, + 154, + 552 + ], + "score": 1.0, + "content": "( B2 ln γ )", + "type": "text" + }, + { + "bbox": [ + 151, + 536, + 354, + 547 + ], + "score": 1.0, + "content": "most frequent items. Since the sum of squares of", + "type": "text" + }, + { + "bbox": [ + 354, + 537, + 364, + 546 + ], + "score": 0.77, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 536, + 455, + 547 + ], + "score": 1.0, + "content": "items that summed to", + "type": "text" + }, + { + "bbox": [ + 455, + 536, + 463, + 546 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 536, + 505, + 547 + ], + "score": 1.0, + "content": "is at least", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 548, + 367, + 563 + ], + "spans": [ + { + "bbox": [ + 107, + 549, + 132, + 562 + ], + "score": 0.92, + "content": "S ^ { 2 } / m", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 548, + 367, + 563 + ], + "score": 1.0, + "content": ", the multi-set loss of any optimal hash function is at least:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 572, + 358, + 717 + ], + "lines": [ + { + "bbox": [ + 129, + 572, + 358, + 717 + ], + "spans": [ + { + "bbox": [ + 129, + 572, + 358, + 717 + ], + "score": 0.95, + "content": "\\begin{array} { r l } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\bar { \\mathcal { F } } _ { h ^ { * } } ( I ) ) = \\displaystyle { \\sum _ { b \\in [ B ] } f ( b ) ^ { 2 } - \\sum _ { i \\in [ n ] } f _ { i } ^ { 2 } } } \\\\ { \\displaystyle } & { \\geq \\frac { ( \\sum _ { i \\in I } f _ { i } ) ^ { 2 } } { B ( 1 - \\frac { 1 } { 2 \\ln \\gamma } ) } - \\frac { \\sum _ { i \\in I } f _ { i } ^ { 2 } } { i \\in I } } \\\\ { \\displaystyle } & { \\geq \\frac { ( \\ln ( 2 \\gamma \\ln \\gamma ) - 1 ) ^ { 2 } } { B } - \\frac { 2 \\ln \\gamma } { B } + \\frac { 1 } { n } } \\\\ { \\displaystyle } & { = \\Omega ( \\frac { \\ln ^ { 2 } \\gamma } { B } ) } \\\\ { \\displaystyle } & { = \\Omega ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "50e1a54e5bfd467e8a6e0f00d3fbaff0da447986feb3081fe3c2a15976bf4646.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 129, + 572, + 358, + 588.1111111111111 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 129, + 588.1111111111111, + 358, + 604.2222222222222 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 129, + 604.2222222222222, + 358, + 620.3333333333333 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 129, + 620.3333333333333, + 358, + 636.4444444444443 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 129, + 636.4444444444443, + 358, + 652.5555555555554 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 129, + 652.5555555555554, + 358, + 668.6666666666665 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 129, + 668.6666666666665, + 358, + 684.7777777777776 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 129, + 684.7777777777776, + 358, + 700.8888888888887 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 129, + 700.8888888888887, + 358, + 716.9999999999998 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 390, + 670, + 455, + 683 + ], + "lines": [ + { + "bbox": [ + 389, + 669, + 456, + 684 + ], + "spans": [ + { + "bbox": [ + 389, + 669, + 456, + 684 + ], + "score": 1.0, + "content": "B Since γ > e4", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + } + ], + "page_idx": 18, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 107, + 26, + 293, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 294, + 39 + ], + "score": 1.0, + "content": "Published as a conference paper at ICLR 2019", + "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, + 698, + 505, + 708 + ], + "lines": [ + { + "bbox": [ + 495, + 699, + 505, + 710 + ], + "spans": [ + { + "bbox": [ + 495, + 699, + 505, + 710 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 494, + 165, + 505, + 176 + ], + "lines": [ + { + "bbox": [ + 503, + 166, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 503, + 166, + 505, + 177 + ], + "score": 0.919, + "content": "1", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 83, + 146, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 148, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 148, + 96 + ], + "score": 1.0, + "content": "Formally,", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 80, + 148, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 91, + 503, + 184 + ], + "lines": [ + { + "bbox": [ + 111, + 91, + 503, + 184 + ], + "spans": [ + { + "bbox": [ + 111, + 91, + 503, + 184 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { \\widehat { \\mathrm { E r r } ( F ( I ) , \\tilde { F } _ { h ^ { \\ast } } ( I ) ) } - \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { \\overline { { h } } } ( I ) ) = f _ { h ^ { \\ast } } ( b ^ { \\ast } ) ^ { 2 } + f _ { h ^ { \\ast } } ( \\overline { { b } } ) ^ { 2 } - f _ { \\overline { { h } } } ( b ^ { \\ast } ) ^ { 2 } - f _ { \\overline { { h } } } ( \\overline { { b } } ) ^ { 2 } } & { } \\\\ { = ( f _ { i ^ { \\ast } } + f ( I ^ { \\ast } ) ) ^ { 2 } + f _ { h ^ { \\ast } } ( \\overline { { b } } ) ^ { 2 } - f _ { i ^ { \\ast } } ^ { 2 } - ( f _ { h ^ { \\ast } } ( \\overline { { b } } ) + f ( I ^ { \\ast } ) ) ^ { 2 } } & { } \\\\ { = 2 f _ { i ^ { \\ast } } \\cdot f ( I ^ { \\ast } ) - 2 f _ { h ^ { \\ast } } ( \\overline { { b } } ) \\cdot f ( I ^ { \\ast } ) } & { } \\\\ { = 2 f ( I ^ { \\ast } ) \\cdot ( f _ { i ^ { \\ast } } - f _ { h ^ { \\ast } } ( \\overline { { b } } ) ) } & { } \\\\ { > 0 \\quad \\triangleright \\mathrm { S i n c e ~ } f _ { i ^ { \\ast } } > \\frac { f ( I ) } { B } > f _ { h ^ { \\ast } } ( \\overline { { b } } ) . } & { } \\end{array}", + "type": "interline_equation", + "image_path": "9f5aa6041decdbfbebdb2709b1c988dce34a7617afa0f89e84ed7ccdf3c3d76d.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 111, + 91, + 503, + 122.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 122.0, + 503, + 153.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 153.0, + 503, + 184.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 189, + 504, + 213 + ], + "lines": [ + { + "bbox": [ + 105, + 188, + 505, + 203 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 315, + 203 + ], + "score": 1.0, + "content": "Next, we show that in any optimal hash function", + "type": "text" + }, + { + "bbox": [ + 316, + 190, + 387, + 202 + ], + "score": 0.93, + "content": "h ^ { * } : [ n ] \\ \\to \\ [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 188, + 505, + 203 + ], + "score": 1.0, + "content": "and assuming Zipfian input", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 200, + 447, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 157, + 213 + ], + "score": 1.0, + "content": "distribution,", + "type": "text" + }, + { + "bbox": [ + 158, + 201, + 182, + 213 + ], + "score": 0.92, + "content": "\\Theta ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 200, + 431, + 213 + ], + "score": 1.0, + "content": "most frequent items do not collide with any other items under", + "type": "text" + }, + { + "bbox": [ + 432, + 201, + 443, + 211 + ], + "score": 0.86, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 200, + 447, + 213 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 188, + 505, + 213 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 215, + 506, + 252 + ], + "lines": [ + { + "bbox": [ + 104, + 214, + 506, + 229 + ], + "spans": [ + { + "bbox": [ + 104, + 214, + 219, + 229 + ], + "score": 1.0, + "content": "Lemma 10.2. Suppose that", + "type": "text" + }, + { + "bbox": [ + 219, + 216, + 258, + 228 + ], + "score": 0.84, + "content": "B = n / \\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 214, + 285, + 229 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 285, + 215, + 321, + 227 + ], + "score": 0.85, + "content": "\\gamma \\geq e ^ { 4 . 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 214, + 506, + 229 + ], + "score": 1.0, + "content": "is a constant and lets assume that items follow", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 105, + 227, + 271, + 240 + ], + "score": 1.0, + "content": "Zipfian distribution. In any hash function", + "type": "text" + }, + { + "bbox": [ + 272, + 227, + 331, + 239 + ], + "score": 0.91, + "content": "h ^ { * } : [ n ] [ B ]", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "with minimum estimation error, none of the", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 237, + 501, + 254 + ], + "spans": [ + { + "bbox": [ + 107, + 238, + 128, + 254 + ], + "score": 0.92, + "content": "\\frac { B } { 2 \\ln \\gamma }", + "type": "inline_equation" + }, + { + "bbox": [ + 128, + 237, + 501, + 254 + ], + "score": 1.0, + "content": "most frequent items collide with any other items (i.e., they are mapped to a singleton bucket).", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 104, + 214, + 506, + 254 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 255, + 506, + 357 + ], + "lines": [ + { + "bbox": [ + 105, + 255, + 507, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 154, + 270 + ], + "score": 1.0, + "content": "Proof: Let", + "type": "text" + }, + { + "bbox": [ + 154, + 257, + 167, + 268 + ], + "score": 0.88, + "content": "i _ { j ^ { * } }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 255, + 476, + 270 + ], + "score": 1.0, + "content": "be the most frequent item that is not mapped to a singleton bucket under", + "type": "text" + }, + { + "bbox": [ + 476, + 256, + 487, + 266 + ], + "score": 0.86, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 255, + 507, + 270 + ], + "score": 1.0, + "content": ". If", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 266, + 508, + 286 + ], + "spans": [ + { + "bbox": [ + 107, + 267, + 151, + 283 + ], + "score": 0.93, + "content": "\\begin{array} { r } { j ^ { * } > \\frac { B } { 2 \\ln \\gamma } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 266, + 375, + 286 + ], + "score": 1.0, + "content": "then the statement holds. Suppose it is not the case and", + "type": "text" + }, + { + "bbox": [ + 375, + 267, + 419, + 282 + ], + "score": 0.93, + "content": "\\begin{array} { r } { j ^ { * } \\le \\frac { B } { 2 \\ln \\gamma } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 266, + 439, + 286 + ], + "score": 1.0, + "content": ". Let", + "type": "text" + }, + { + "bbox": [ + 440, + 268, + 447, + 278 + ], + "score": 0.7, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 266, + 508, + 286 + ], + "score": 1.0, + "content": "denote the set", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 280, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 236, + 295 + ], + "score": 1.0, + "content": "of items with frequency at most", + "type": "text" + }, + { + "bbox": [ + 236, + 281, + 283, + 294 + ], + "score": 0.92, + "content": "f _ { j ^ { * } } = 1 / j ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 280, + 305, + 295 + ], + "score": 1.0, + "content": "(i.e.,", + "type": "text" + }, + { + "bbox": [ + 306, + 281, + 382, + 294 + ], + "score": 0.91, + "content": "I = \\{ i _ { j } \\mid j \\geq j ^ { * } \\} )", + "type": "inline_equation" + }, + { + "bbox": [ + 382, + 280, + 413, + 295 + ], + "score": 1.0, + "content": "and let", + "type": "text" + }, + { + "bbox": [ + 414, + 282, + 427, + 293 + ], + "score": 0.87, + "content": "B _ { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 280, + 506, + 295 + ], + "score": 1.0, + "content": "denote the number", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 293, + 505, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 287, + 305 + ], + "score": 1.0, + "content": "of buckets that the items with index at least", + "type": "text" + }, + { + "bbox": [ + 287, + 294, + 298, + 304 + ], + "score": 0.87, + "content": "j ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 293, + 348, + 305 + ], + "score": 1.0, + "content": "mapped to;", + "type": "text" + }, + { + "bbox": [ + 348, + 293, + 426, + 304 + ], + "score": 0.9, + "content": "B _ { I } = B - j ^ { * } + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 293, + 505, + 305 + ], + "score": 1.0, + "content": ". Also note that by", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 303, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 175, + 317 + ], + "score": 1.0, + "content": "Observation 9.1,", + "type": "text" + }, + { + "bbox": [ + 175, + 303, + 252, + 318 + ], + "score": 0.93, + "content": "\\begin{array} { r } { f ( I ) < \\ln ( \\frac { n } { j ^ { * } } ) + 1 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 303, + 397, + 317 + ], + "score": 1.0, + "content": ". Next, by Claim 10.1, we show that", + "type": "text" + }, + { + "bbox": [ + 397, + 304, + 408, + 313 + ], + "score": 0.86, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 303, + 506, + 317 + ], + "score": 1.0, + "content": "does not hash the items", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 316, + 503, + 335 + ], + "spans": [ + { + "bbox": [ + 107, + 319, + 156, + 331 + ], + "score": 0.92, + "content": "\\{ j ^ { * } , \\cdots , n \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 317, + 168, + 335 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 168, + 320, + 181, + 331 + ], + "score": 0.9, + "content": "B _ { I }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 317, + 420, + 335 + ], + "score": 1.0, + "content": "optimally. In particular, we show that the frequency of item", + "type": "text" + }, + { + "bbox": [ + 420, + 320, + 430, + 331 + ], + "score": 0.88, + "content": "j ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 317, + 483, + 335 + ], + "score": 1.0, + "content": "is more than", + "type": "text" + }, + { + "bbox": [ + 483, + 316, + 501, + 333 + ], + "score": 0.92, + "content": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 317, + 503, + 335 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 331, + 506, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 301, + 345 + ], + "score": 1.0, + "content": "To prove this, first we observe that the function", + "type": "text" + }, + { + "bbox": [ + 302, + 332, + 408, + 344 + ], + "score": 0.93, + "content": "g ( j ) : = j \\cdot ( \\ln ( n / j ) + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 331, + 506, + 345 + ], + "score": 1.0, + "content": "is strictly increasing in", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 342, + 244, + 361 + ], + "spans": [ + { + "bbox": [ + 107, + 344, + 128, + 357 + ], + "score": 0.9, + "content": "[ 1 , n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 342, + 194, + 361 + ], + "score": 1.0, + "content": ". Hence, for any", + "type": "text" + }, + { + "bbox": [ + 195, + 343, + 238, + 358 + ], + "score": 0.92, + "content": "\\begin{array} { r } { j ^ { * } \\le \\frac { B } { 2 \\ln \\gamma } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 342, + 244, + 361 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 255, + 508, + 361 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 135, + 358, + 478, + 410 + ], + "lines": [ + { + "bbox": [ + 135, + 358, + 478, + 410 + ], + "spans": [ + { + "bbox": [ + 135, + 358, + 478, + 410 + ], + "score": 0.85, + "content": "\\begin{array} { r l r } { { j ^ { * } \\cdot ( \\ln ( \\frac { n } { j ^ { * } } ) + 1 ) \\le \\frac { B } { 2 \\ln \\gamma } \\cdot ( \\ln ( 2 \\gamma \\ln \\gamma ) + 1 ) } } \\\\ & { } & { \\le B \\cdot ( 1 - \\frac { 1 } { 2 \\ln \\gamma } ) \\quad \\triangleright \\mathrm { S i n c e ~ l n } ( 2 \\ln \\gamma ) + 2 < \\ln \\gamma \\mathrm { ~ f o r ~ l n } \\gamma \\ge 4 . 2 } \\end{array}", + "type": "interline_equation", + "image_path": "84a31bab9c5c770f1f3bf0ea424d3b88771a603c06329a88fd8a5dd33e70297d.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 135, + 358, + 478, + 375.3333333333333 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 135, + 375.3333333333333, + 478, + 392.66666666666663 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 135, + 392.66666666666663, + 478, + 409.99999999999994 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 422, + 505, + 448 + ], + "lines": [ + { + "bbox": [ + 104, + 419, + 507, + 441 + ], + "spans": [ + { + "bbox": [ + 104, + 419, + 131, + 441 + ], + "score": 1.0, + "content": "Thus,", + "type": "text" + }, + { + "bbox": [ + 132, + 422, + 255, + 439 + ], + "score": 0.94, + "content": "\\begin{array} { r } { f _ { j ^ { * } } = \\frac { 1 } { j ^ { * } } > \\frac { \\ln ( n / j ^ { * } ) + 1 } { B _ { I } } > \\frac { f ( I ) } { B _ { I } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 419, + 476, + 441 + ], + "score": 1.0, + "content": "which implies that an optimal hash function must map", + "type": "text" + }, + { + "bbox": [ + 476, + 425, + 486, + 436 + ], + "score": 0.87, + "content": "j ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 419, + 507, + 441 + ], + "score": 1.0, + "content": "to a", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 436, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 177, + 450 + ], + "score": 1.0, + "content": "singleton bucket.", + "type": "text" + }, + { + "bbox": [ + 495, + 438, + 505, + 447 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 104, + 419, + 507, + 450 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 451, + 503, + 480 + ], + "lines": [ + { + "bbox": [ + 106, + 450, + 504, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 450, + 181, + 465 + ], + "score": 1.0, + "content": "Theorem 10.3. If", + "type": "text" + }, + { + "bbox": [ + 181, + 451, + 231, + 464 + ], + "score": 0.91, + "content": "n / B \\geq e ^ { 4 . 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 450, + 496, + 465 + ], + "score": 1.0, + "content": ", then the estimation error of any hash function that maps a set of", + "type": "text" + }, + { + "bbox": [ + 497, + 454, + 504, + 462 + ], + "score": 0.69, + "content": "n", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 463, + 354, + 481 + ], + "spans": [ + { + "bbox": [ + 105, + 466, + 260, + 479 + ], + "score": 1.0, + "content": "items following Zipfian distribution to", + "type": "text" + }, + { + "bbox": [ + 260, + 468, + 269, + 477 + ], + "score": 0.75, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 466, + 312, + 479 + ], + "score": 1.0, + "content": "buckets is", + "type": "text" + }, + { + "bbox": [ + 312, + 463, + 354, + 481 + ], + "score": 0.94, + "content": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( \\frac { n } { B } ) } { B } \\big )", + "type": "inline_equation" + } + ], + "index": 23 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 450, + 504, + 481 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 505, + 520 + ], + "lines": [ + { + "bbox": [ + 102, + 480, + 508, + 502 + ], + "spans": [ + { + "bbox": [ + 102, + 480, + 452, + 502 + ], + "score": 1.0, + "content": "Proof: By Lemma 10.2, in any hash function with minimum estimation error, the", + "type": "text" + }, + { + "bbox": [ + 452, + 483, + 480, + 498 + ], + "score": 0.91, + "content": "\\scriptstyle \\left( { \\frac { B } { 2 \\ln \\gamma } } \\right)", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 480, + 508, + 502 + ], + "score": 1.0, + "content": "most", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 497, + 504, + 509 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 504, + 509 + ], + "score": 1.0, + "content": "frequent items do not collide with any other items (i.e., they are mapped into a singleton bucket)", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 507, + 206, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 133, + 520 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 507, + 201, + 520 + ], + "score": 0.92, + "content": "\\gamma = n / B > e ^ { 4 . 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 507, + 206, + 520 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25, + "bbox_fs": [ + 102, + 480, + 508, + 520 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 524, + 505, + 562 + ], + "lines": [ + { + "bbox": [ + 105, + 524, + 505, + 537 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 344, + 537 + ], + "score": 1.0, + "content": "Hence, the goal is to minimize (10.1) for the set of items", + "type": "text" + }, + { + "bbox": [ + 345, + 525, + 351, + 535 + ], + "score": 0.77, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 524, + 505, + 537 + ], + "score": 1.0, + "content": "which consist of all items other than", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 536, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 536, + 122, + 548 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 119, + 536, + 154, + 552 + ], + "score": 1.0, + "content": "( B2 ln γ )", + "type": "text" + }, + { + "bbox": [ + 151, + 536, + 354, + 547 + ], + "score": 1.0, + "content": "most frequent items. Since the sum of squares of", + "type": "text" + }, + { + "bbox": [ + 354, + 537, + 364, + 546 + ], + "score": 0.77, + "content": "m", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 536, + 455, + 547 + ], + "score": 1.0, + "content": "items that summed to", + "type": "text" + }, + { + "bbox": [ + 455, + 536, + 463, + 546 + ], + "score": 0.82, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 536, + 505, + 547 + ], + "score": 1.0, + "content": "is at least", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 548, + 367, + 563 + ], + "spans": [ + { + "bbox": [ + 107, + 549, + 132, + 562 + ], + "score": 0.92, + "content": "S ^ { 2 } / m", + "type": "inline_equation" + }, + { + "bbox": [ + 133, + 548, + 367, + 563 + ], + "score": 1.0, + "content": ", the multi-set loss of any optimal hash function is at least:", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 524, + 505, + 563 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 572, + 358, + 717 + ], + "lines": [ + { + "bbox": [ + 129, + 572, + 358, + 717 + ], + "spans": [ + { + "bbox": [ + 129, + 572, + 358, + 717 + ], + "score": 0.95, + "content": "\\begin{array} { r l } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\bar { \\mathcal { F } } _ { h ^ { * } } ( I ) ) = \\displaystyle { \\sum _ { b \\in [ B ] } f ( b ) ^ { 2 } - \\sum _ { i \\in [ n ] } f _ { i } ^ { 2 } } } \\\\ { \\displaystyle } & { \\geq \\frac { ( \\sum _ { i \\in I } f _ { i } ) ^ { 2 } } { B ( 1 - \\frac { 1 } { 2 \\ln \\gamma } ) } - \\frac { \\sum _ { i \\in I } f _ { i } ^ { 2 } } { i \\in I } } \\\\ { \\displaystyle } & { \\geq \\frac { ( \\ln ( 2 \\gamma \\ln \\gamma ) - 1 ) ^ { 2 } } { B } - \\frac { 2 \\ln \\gamma } { B } + \\frac { 1 } { n } } \\\\ { \\displaystyle } & { = \\Omega ( \\frac { \\ln ^ { 2 } \\gamma } { B } ) } \\\\ { \\displaystyle } & { = \\Omega ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "50e1a54e5bfd467e8a6e0f00d3fbaff0da447986feb3081fe3c2a15976bf4646.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 129, + 572, + 358, + 588.1111111111111 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 129, + 588.1111111111111, + 358, + 604.2222222222222 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 129, + 604.2222222222222, + 358, + 620.3333333333333 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 129, + 620.3333333333333, + 358, + 636.4444444444443 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 129, + 636.4444444444443, + 358, + 652.5555555555554 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 129, + 652.5555555555554, + 358, + 668.6666666666665 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 129, + 668.6666666666665, + 358, + 684.7777777777776 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 129, + 684.7777777777776, + 358, + 700.8888888888887 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 129, + 700.8888888888887, + 358, + 716.9999999999998 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "text", + "bbox": [ + 390, + 670, + 455, + 683 + ], + "lines": [ + { + "bbox": [ + 389, + 669, + 456, + 684 + ], + "spans": [ + { + "bbox": [ + 389, + 669, + 456, + 684 + ], + "score": 1.0, + "content": "B Since γ > e4", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39, + "bbox_fs": [ + 389, + 669, + 456, + 684 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 120 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Next, we show a more general statement which basically shows that the estimation error of any", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 104, + 93, + 506, + 111 + ], + "spans": [ + { + "bbox": [ + 104, + 93, + 202, + 111 + ], + "score": 1.0, + "content": "Count-Min sketch with", + "type": "text" + }, + { + "bbox": [ + 202, + 97, + 212, + 107 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 93, + 255, + 111 + ], + "score": 1.0, + "content": "buckets is", + "type": "text" + }, + { + "bbox": [ + 255, + 93, + 305, + 110 + ], + "score": 0.94, + "content": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 93, + 485, + 111 + ], + "score": 1.0, + "content": "no matter how many rows (i.e., the value of", + "type": "text" + }, + { + "bbox": [ + 486, + 97, + 492, + 107 + ], + "score": 0.72, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 93, + 506, + 111 + ], + "score": 1.0, + "content": ") it", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 106, + 126, + 120 + ], + "spans": [ + { + "bbox": [ + 104, + 106, + 126, + 120 + ], + "score": 1.0, + "content": "has.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 122, + 503, + 151 + ], + "lines": [ + { + "bbox": [ + 106, + 120, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 120, + 181, + 136 + ], + "score": 1.0, + "content": "Theorem 10.4. If", + "type": "text" + }, + { + "bbox": [ + 182, + 122, + 231, + 135 + ], + "score": 0.9, + "content": "n / B \\geq e ^ { 4 . 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 120, + 505, + 136 + ], + "score": 1.0, + "content": ", then the estimation error of any Count-Min sketch that maps a set", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 134, + 372, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 279, + 150 + ], + "score": 1.0, + "content": "of n items following Zipfian distribution to", + "type": "text" + }, + { + "bbox": [ + 279, + 138, + 288, + 148 + ], + "score": 0.71, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 136, + 330, + 150 + ], + "score": 1.0, + "content": "buckets is", + "type": "text" + }, + { + "bbox": [ + 330, + 134, + 372, + 151 + ], + "score": 0.93, + "content": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( \\frac { n } { B } ) } { B } \\big )", + "type": "inline_equation" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 107, + 153, + 505, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 151, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 450, + 166 + ], + "score": 1.0, + "content": "Proof: We prove the statement by showing a reduction that given a Count-Min sketch", + "type": "text" + }, + { + "bbox": [ + 451, + 153, + 483, + 164 + ], + "score": 0.91, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 151, + 505, + 166 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 163, + 504, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 167, + 177 + ], + "score": 1.0, + "content": "hash functions", + "type": "text" + }, + { + "bbox": [ + 167, + 164, + 305, + 176 + ], + "score": 0.92, + "content": "h _ { 1 } , \\cdot \\cdot \\cdot , h _ { k } \\in \\{ h : [ n ] [ B / k ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 163, + 441, + 177 + ], + "score": 1.0, + "content": "constructs a single hash function", + "type": "text" + }, + { + "bbox": [ + 441, + 164, + 504, + 176 + ], + "score": 0.92, + "content": "h ^ { * } : [ n ] \\to [ B ]", + "type": "inline_equation" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 175, + 419, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 175, + 383, + 187 + ], + "score": 1.0, + "content": "whose estimation error is less than or equal to the estimation error of", + "type": "text" + }, + { + "bbox": [ + 383, + 175, + 416, + 187 + ], + "score": 0.92, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 175, + 419, + 187 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 191, + 506, + 237 + ], + "lines": [ + { + "bbox": [ + 105, + 191, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 162, + 204 + ], + "score": 1.0, + "content": "For each item", + "type": "text" + }, + { + "bbox": [ + 162, + 193, + 167, + 201 + ], + "score": 0.57, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 191, + 210, + 204 + ], + "score": 1.0, + "content": ", we define", + "type": "text" + }, + { + "bbox": [ + 210, + 191, + 231, + 203 + ], + "score": 0.9, + "content": "C ^ { \\prime } [ i ]", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 191, + 401, + 204 + ], + "score": 1.0, + "content": "to be the bucket whose value is returned by", + "type": "text" + }, + { + "bbox": [ + 401, + 191, + 434, + 203 + ], + "score": 0.91, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 191, + 505, + 204 + ], + "score": 1.0, + "content": "as the estimate of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 201, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 252, + 216 + ], + "score": 0.9, + "content": "f _ { i } ; C ^ { \\prime } [ i ] : = \\arg \\operatorname* { m i n } _ { j \\in [ k ] } C [ j , h _ { j } ( i ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 201, + 399, + 217 + ], + "score": 1.0, + "content": ". Since the total number of buckets in", + "type": "text" + }, + { + "bbox": [ + 399, + 203, + 432, + 215 + ], + "score": 0.9, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 201, + 441, + 217 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 444, + 203, + 505, + 215 + ], + "score": 0.87, + "content": "B , | \\{ C ^ { \\prime } [ i ] \\mid i \\in", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 215, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 107, + 215, + 150, + 227 + ], + "score": 0.91, + "content": "[ n ] \\} | \\leq B", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 216, + 397, + 227 + ], + "score": 1.0, + "content": "; in other words, we only consider the subset of buckets that", + "type": "text" + }, + { + "bbox": [ + 398, + 216, + 430, + 227 + ], + "score": 0.91, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 216, + 505, + 227 + ], + "score": 1.0, + "content": "uses to report the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 226, + 453, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 226, + 157, + 238 + ], + "score": 1.0, + "content": "estimates of", + "type": "text" + }, + { + "bbox": [ + 158, + 226, + 212, + 238 + ], + "score": 0.92, + "content": "\\{ f _ { i } \\mid i \\in [ n ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 226, + 339, + 238 + ], + "score": 1.0, + "content": "which trivially has size at most", + "type": "text" + }, + { + "bbox": [ + 339, + 227, + 348, + 236 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 226, + 394, + 238 + ], + "score": 1.0, + "content": ". We define", + "type": "text" + }, + { + "bbox": [ + 395, + 227, + 406, + 236 + ], + "score": 0.87, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 226, + 453, + 238 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 153, + 237, + 455, + 249 + ], + "lines": [ + { + "bbox": [ + 156, + 234, + 455, + 255 + ], + "spans": [ + { + "bbox": [ + 156, + 237, + 258, + 250 + ], + "score": 0.76, + "content": "h ^ { \\ast } ( i ) = ( j ^ { \\ast } , h _ { j ^ { \\ast } } ( i ) ) \\quad \\triangleright", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 234, + 294, + 252 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 294, + 237, + 322, + 249 + ], + "score": 0.91, + "content": "i \\in [ n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 234, + 353, + 252 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 354, + 237, + 455, + 255 + ], + "score": 0.88, + "content": "j ^ { * } = \\underset { i \\in [ k ] } { \\arg \\operatorname* { m i n } } C [ j , h _ { j } ( i ) ]", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 108, + 257, + 502, + 293 + ], + "lines": [ + { + "bbox": [ + 105, + 255, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 136, + 271 + ], + "score": 1.0, + "content": "Unlike", + "type": "text" + }, + { + "bbox": [ + 136, + 257, + 169, + 269 + ], + "score": 0.86, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 255, + 173, + 271 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 173, + 257, + 185, + 267 + ], + "score": 0.66, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 255, + 351, + 271 + ], + "score": 1.0, + "content": "maps each item to exactly one bucket in", + "type": "text" + }, + { + "bbox": [ + 351, + 257, + 473, + 269 + ], + "score": 0.9, + "content": "\\{ C [ \\ell , j ] \\mid \\ell \\in [ k ] , j \\in [ B / k ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 255, + 505, + 271 + ], + "score": 1.0, + "content": "; hence,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 268, + 501, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 164, + 283 + ], + "score": 1.0, + "content": "for each item", + "type": "text" + }, + { + "bbox": [ + 164, + 271, + 169, + 280 + ], + "score": 0.47, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 268, + 174, + 283 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 174, + 268, + 290, + 281 + ], + "score": 0.86, + "content": "C ^ { \\prime } [ h ^ { * } ( i ) ] \\ \\leq \\ C [ h ^ { * } ( i ) ] \\ = \\ \\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 268, + 320, + 283 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 320, + 268, + 330, + 281 + ], + "score": 0.89, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 268, + 406, + 283 + ], + "score": 1.0, + "content": "is the estimate of", + "type": "text" + }, + { + "bbox": [ + 406, + 271, + 416, + 281 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 268, + 468, + 283 + ], + "score": 1.0, + "content": "returned by", + "type": "text" + }, + { + "bbox": [ + 468, + 270, + 501, + 282 + ], + "score": 0.91, + "content": "C M ( k )", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 279, + 281, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 208, + 294 + ], + "score": 1.0, + "content": "Moreover, since for each", + "type": "text" + }, + { + "bbox": [ + 208, + 282, + 212, + 291 + ], + "score": 0.59, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 279, + 217, + 294 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 217, + 281, + 276, + 293 + ], + "score": 0.87, + "content": "C ^ { \\prime } [ h ^ { * } ( i ) ] \\geq f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 279, + 281, + 294 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 307, + 505, + 338 + ], + "lines": [ + { + "bbox": [ + 105, + 303, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 300, + 324 + ], + "score": 1.0, + "content": "Finally, by Theorem 10.3, the estimation error of", + "type": "text" + }, + { + "bbox": [ + 300, + 309, + 311, + 319 + ], + "score": 0.85, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 303, + 321, + 324 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 321, + 306, + 371, + 322 + ], + "score": 0.92, + "content": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 303, + 505, + 324 + ], + "score": 1.0, + "content": "which implies that the estimation", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 103, + 320, + 504, + 339 + ], + "spans": [ + { + "bbox": [ + 103, + 320, + 236, + 339 + ], + "score": 1.0, + "content": "error of CM (k) is Ω( ln2(n/B)B )", + "type": "text" + }, + { + "bbox": [ + 233, + 323, + 267, + 336 + ], + "score": 1.0, + "content": "as well.", + "type": "text" + }, + { + "bbox": [ + 496, + 327, + 504, + 333 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + } + ], + "page_idx": 19, + "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 2019", + "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": [ + 106, + 82, + 505, + 120 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Next, we show a more general statement which basically shows that the estimation error of any", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 104, + 93, + 506, + 111 + ], + "spans": [ + { + "bbox": [ + 104, + 93, + 202, + 111 + ], + "score": 1.0, + "content": "Count-Min sketch with", + "type": "text" + }, + { + "bbox": [ + 202, + 97, + 212, + 107 + ], + "score": 0.8, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 93, + 255, + 111 + ], + "score": 1.0, + "content": "buckets is", + "type": "text" + }, + { + "bbox": [ + 255, + 93, + 305, + 110 + ], + "score": 0.94, + "content": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 93, + 485, + 111 + ], + "score": 1.0, + "content": "no matter how many rows (i.e., the value of", + "type": "text" + }, + { + "bbox": [ + 486, + 97, + 492, + 107 + ], + "score": 0.72, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 93, + 506, + 111 + ], + "score": 1.0, + "content": ") it", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 106, + 126, + 120 + ], + "spans": [ + { + "bbox": [ + 104, + 106, + 126, + 120 + ], + "score": 1.0, + "content": "has.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 104, + 81, + 506, + 120 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 122, + 503, + 151 + ], + "lines": [ + { + "bbox": [ + 106, + 120, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 120, + 181, + 136 + ], + "score": 1.0, + "content": "Theorem 10.4. If", + "type": "text" + }, + { + "bbox": [ + 182, + 122, + 231, + 135 + ], + "score": 0.9, + "content": "n / B \\geq e ^ { 4 . 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 120, + 505, + 136 + ], + "score": 1.0, + "content": ", then the estimation error of any Count-Min sketch that maps a set", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 134, + 372, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 279, + 150 + ], + "score": 1.0, + "content": "of n items following Zipfian distribution to", + "type": "text" + }, + { + "bbox": [ + 279, + 138, + 288, + 148 + ], + "score": 0.71, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 288, + 136, + 330, + 150 + ], + "score": 1.0, + "content": "buckets is", + "type": "text" + }, + { + "bbox": [ + 330, + 134, + 372, + 151 + ], + "score": 0.93, + "content": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( \\frac { n } { B } ) } { B } \\big )", + "type": "inline_equation" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 120, + 505, + 151 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 153, + 505, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 151, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 151, + 450, + 166 + ], + "score": 1.0, + "content": "Proof: We prove the statement by showing a reduction that given a Count-Min sketch", + "type": "text" + }, + { + "bbox": [ + 451, + 153, + 483, + 164 + ], + "score": 0.91, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 151, + 505, + 166 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 163, + 504, + 177 + ], + "spans": [ + { + "bbox": [ + 105, + 163, + 167, + 177 + ], + "score": 1.0, + "content": "hash functions", + "type": "text" + }, + { + "bbox": [ + 167, + 164, + 305, + 176 + ], + "score": 0.92, + "content": "h _ { 1 } , \\cdot \\cdot \\cdot , h _ { k } \\in \\{ h : [ n ] [ B / k ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 163, + 441, + 177 + ], + "score": 1.0, + "content": "constructs a single hash function", + "type": "text" + }, + { + "bbox": [ + 441, + 164, + 504, + 176 + ], + "score": 0.92, + "content": "h ^ { * } : [ n ] \\to [ B ]", + "type": "inline_equation" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 175, + 419, + 187 + ], + "spans": [ + { + "bbox": [ + 106, + 175, + 383, + 187 + ], + "score": 1.0, + "content": "whose estimation error is less than or equal to the estimation error of", + "type": "text" + }, + { + "bbox": [ + 383, + 175, + 416, + 187 + ], + "score": 0.92, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 175, + 419, + 187 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 151, + 505, + 187 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 191, + 506, + 237 + ], + "lines": [ + { + "bbox": [ + 105, + 191, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 105, + 191, + 162, + 204 + ], + "score": 1.0, + "content": "For each item", + "type": "text" + }, + { + "bbox": [ + 162, + 193, + 167, + 201 + ], + "score": 0.57, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 191, + 210, + 204 + ], + "score": 1.0, + "content": ", we define", + "type": "text" + }, + { + "bbox": [ + 210, + 191, + 231, + 203 + ], + "score": 0.9, + "content": "C ^ { \\prime } [ i ]", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 191, + 401, + 204 + ], + "score": 1.0, + "content": "to be the bucket whose value is returned by", + "type": "text" + }, + { + "bbox": [ + 401, + 191, + 434, + 203 + ], + "score": 0.91, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 434, + 191, + 505, + 204 + ], + "score": 1.0, + "content": "as the estimate of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 201, + 505, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 252, + 216 + ], + "score": 0.9, + "content": "f _ { i } ; C ^ { \\prime } [ i ] : = \\arg \\operatorname* { m i n } _ { j \\in [ k ] } C [ j , h _ { j } ( i ) ]", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 201, + 399, + 217 + ], + "score": 1.0, + "content": ". Since the total number of buckets in", + "type": "text" + }, + { + "bbox": [ + 399, + 203, + 432, + 215 + ], + "score": 0.9, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 201, + 441, + 217 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 444, + 203, + 505, + 215 + ], + "score": 0.87, + "content": "B , | \\{ C ^ { \\prime } [ i ] \\mid i \\in", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 215, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 107, + 215, + 150, + 227 + ], + "score": 0.91, + "content": "[ n ] \\} | \\leq B", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 216, + 397, + 227 + ], + "score": 1.0, + "content": "; in other words, we only consider the subset of buckets that", + "type": "text" + }, + { + "bbox": [ + 398, + 216, + 430, + 227 + ], + "score": 0.91, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 216, + 505, + 227 + ], + "score": 1.0, + "content": "uses to report the", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 226, + 453, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 226, + 157, + 238 + ], + "score": 1.0, + "content": "estimates of", + "type": "text" + }, + { + "bbox": [ + 158, + 226, + 212, + 238 + ], + "score": 0.92, + "content": "\\{ f _ { i } \\mid i \\in [ n ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 226, + 339, + 238 + ], + "score": 1.0, + "content": "which trivially has size at most", + "type": "text" + }, + { + "bbox": [ + 339, + 227, + 348, + 236 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 226, + 394, + 238 + ], + "score": 1.0, + "content": ". We define", + "type": "text" + }, + { + "bbox": [ + 395, + 227, + 406, + 236 + ], + "score": 0.87, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 226, + 453, + 238 + ], + "score": 1.0, + "content": "as follows:", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 191, + 505, + 238 + ] + }, + { + "type": "text", + "bbox": [ + 153, + 237, + 455, + 249 + ], + "lines": [ + { + "bbox": [ + 156, + 234, + 455, + 255 + ], + "spans": [ + { + "bbox": [ + 156, + 237, + 258, + 250 + ], + "score": 0.76, + "content": "h ^ { \\ast } ( i ) = ( j ^ { \\ast } , h _ { j ^ { \\ast } } ( i ) ) \\quad \\triangleright", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 234, + 294, + 252 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 294, + 237, + 322, + 249 + ], + "score": 0.91, + "content": "i \\in [ n ]", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 234, + 353, + 252 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 354, + 237, + 455, + 255 + ], + "score": 0.88, + "content": "j ^ { * } = \\underset { i \\in [ k ] } { \\arg \\operatorname* { m i n } } C [ j , h _ { j } ( i ) ]", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 156, + 234, + 455, + 255 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 257, + 502, + 293 + ], + "lines": [ + { + "bbox": [ + 105, + 255, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 136, + 271 + ], + "score": 1.0, + "content": "Unlike", + "type": "text" + }, + { + "bbox": [ + 136, + 257, + 169, + 269 + ], + "score": 0.86, + "content": "C M ( k )", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 255, + 173, + 271 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 173, + 257, + 185, + 267 + ], + "score": 0.66, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 255, + 351, + 271 + ], + "score": 1.0, + "content": "maps each item to exactly one bucket in", + "type": "text" + }, + { + "bbox": [ + 351, + 257, + 473, + 269 + ], + "score": 0.9, + "content": "\\{ C [ \\ell , j ] \\mid \\ell \\in [ k ] , j \\in [ B / k ] \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 473, + 255, + 505, + 271 + ], + "score": 1.0, + "content": "; hence,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 268, + 501, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 268, + 164, + 283 + ], + "score": 1.0, + "content": "for each item", + "type": "text" + }, + { + "bbox": [ + 164, + 271, + 169, + 280 + ], + "score": 0.47, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 268, + 174, + 283 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 174, + 268, + 290, + 281 + ], + "score": 0.86, + "content": "C ^ { \\prime } [ h ^ { * } ( i ) ] \\ \\leq \\ C [ h ^ { * } ( i ) ] \\ = \\ \\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 268, + 320, + 283 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 320, + 268, + 330, + 281 + ], + "score": 0.89, + "content": "\\tilde { f } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 268, + 406, + 283 + ], + "score": 1.0, + "content": "is the estimate of", + "type": "text" + }, + { + "bbox": [ + 406, + 271, + 416, + 281 + ], + "score": 0.87, + "content": "f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 268, + 468, + 283 + ], + "score": 1.0, + "content": "returned by", + "type": "text" + }, + { + "bbox": [ + 468, + 270, + 501, + 282 + ], + "score": 0.91, + "content": "C M ( k )", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 279, + 281, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 208, + 294 + ], + "score": 1.0, + "content": "Moreover, since for each", + "type": "text" + }, + { + "bbox": [ + 208, + 282, + 212, + 291 + ], + "score": 0.59, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 279, + 217, + 294 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 217, + 281, + 276, + 293 + ], + "score": 0.87, + "content": "C ^ { \\prime } [ h ^ { * } ( i ) ] \\geq f _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 279, + 281, + 294 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 255, + 505, + 294 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 307, + 505, + 338 + ], + "lines": [ + { + "bbox": [ + 105, + 303, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 300, + 324 + ], + "score": 1.0, + "content": "Finally, by Theorem 10.3, the estimation error of", + "type": "text" + }, + { + "bbox": [ + 300, + 309, + 311, + 319 + ], + "score": 0.85, + "content": "h ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 303, + 321, + 324 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 321, + 306, + 371, + 322 + ], + "score": 0.92, + "content": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 371, + 303, + 505, + 324 + ], + "score": 1.0, + "content": "which implies that the estimation", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 103, + 320, + 504, + 339 + ], + "spans": [ + { + "bbox": [ + 103, + 320, + 236, + 339 + ], + "score": 1.0, + "content": "error of CM (k) is Ω( ln2(n/B)B )", + "type": "text" + }, + { + "bbox": [ + 233, + 323, + 267, + 336 + ], + "score": 1.0, + "content": "as well.", + "type": "text" + }, + { + "bbox": [ + 496, + 327, + 504, + 333 + ], + "score": 1.0, + "content": "\u0003", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 103, + 303, + 505, + 339 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/r1lohoCqY7/r1lohoCqY7_model.json b/parse/train/r1lohoCqY7/r1lohoCqY7_model.json new file mode 100644 index 0000000000000000000000000000000000000000..2d2325a1de7a409a5e2a062dede991e074d69b96 --- /dev/null +++ b/parse/train/r1lohoCqY7/r1lohoCqY7_model.json @@ -0,0 +1,36496 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 398, + 627, + 1301, + 627, + 1301, + 963, + 398, + 963 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1065, + 1403, + 1065, + 1403, + 1371, + 298, + 1371 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1386, + 1403, + 1386, + 1403, + 1662, + 298, + 1662 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1677, + 1403, + 1677, + 1403, + 1892, + 298, + 1892 + ], + "score": 0.97 + }, + { + "category_id": 2, + "poly": [ + 297, + 1921, + 1402, + 1921, + 1402, + 2033, + 297, + 2033 + ], + "score": 0.96 + }, + { + "category_id": 0, + "poly": [ + 295, + 218, + 1310, + 218, + 1310, + 263, + 295, + 263 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 314, + 354, + 863, + 354, + 863, + 475, + 314, + 475 + ], + "score": 0.911 + }, + { + "category_id": 0, + "poly": [ + 302, + 1013, + 560, + 1013, + 560, + 1047, + 302, + 1047 + ], + "score": 0.897 + }, + { + "category_id": 0, + "poly": [ + 773, + 555, + 926, + 555, + 926, + 588, + 773, + 588 + ], + "score": 0.877 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.867 + }, + { + "category_id": 1, + "poly": [ + 313, + 319, + 966, + 319, + 966, + 352, + 313, + 352 + ], + "score": 0.822 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 857, + 2088, + 857, + 2112, + 841, + 2112 + ], + "score": 0.704 + }, + { + "category_id": 13, + "poly": [ + 691, + 1708, + 767, + 1708, + 767, + 1736, + 691, + 1736 + ], + "score": 0.9, + "latex": "i \\in U" + }, + { + "category_id": 13, + "poly": [ + 705, + 1979, + 777, + 1979, + 777, + 2004, + 705, + 2004 + ], + "score": 0.88, + "latex": "\\textit { i } \\in \\textit { U }" + }, + { + "category_id": 13, + "poly": [ + 882, + 1708, + 908, + 1708, + 908, + 1740, + 882, + 1740 + ], + "score": 0.87, + "latex": "f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1185, + 1978, + 1210, + 1978, + 1210, + 2007, + 1185, + 2007 + ], + "score": 0.86, + "latex": "f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 405, + 2007, + 426, + 2007, + 426, + 2030, + 405, + 2030 + ], + "score": 0.84, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 1050, + 1924, + 1071, + 1924, + 1071, + 1947, + 1050, + 1947 + ], + "score": 0.81, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 330, + 1831, + 352, + 1831, + 352, + 1857, + 330, + 1857 + ], + "score": 0.81, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 940, + 1952, + 962, + 1952, + 962, + 1975, + 940, + 1975 + ], + "score": 0.81, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 1178, + 1678, + 1201, + 1678, + 1201, + 1706, + 1178, + 1706 + ], + "score": 0.81, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 464, + 1951, + 485, + 1951, + 485, + 1975, + 464, + 1975 + ], + "score": 0.79, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 724, + 1740, + 745, + 1740, + 745, + 1767, + 724, + 1767 + ], + "score": 0.78, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1254, + 1923, + 1277, + 1923, + 1277, + 1947, + 1254, + 1947 + ], + "score": 0.78, + "latex": "U" + }, + { + "category_id": 13, + "poly": [ + 466, + 1709, + 492, + 1709, + 492, + 1736, + 466, + 1736 + ], + "score": 0.75, + "latex": "U" + }, + { + "category_id": 13, + "poly": [ + 398, + 1979, + 417, + 1979, + 417, + 2004, + 398, + 2004 + ], + "score": 0.73, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1290, + 1708, + 1311, + 1708, + 1311, + 1735, + 1290, + 1735 + ], + "score": 0.72, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1158, + 1710, + 1173, + 1710, + 1173, + 1735, + 1158, + 1735 + ], + "score": 0.66, + "latex": "i" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1916.0, + 1049.0, + 1916.0, + 1049.0, + 1956.0, + 332.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1916.0, + 1253.0, + 1916.0, + 1253.0, + 1956.0, + 1072.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 1916.0, + 1406.0, + 1916.0, + 1406.0, + 1956.0, + 1278.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1949.0, + 463.0, + 1949.0, + 463.0, + 1982.0, + 296.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 1949.0, + 939.0, + 1949.0, + 939.0, + 1982.0, + 486.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 1949.0, + 1406.0, + 1949.0, + 1406.0, + 1982.0, + 963.0, + 1982.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1973.0, + 397.0, + 1973.0, + 397.0, + 2011.0, + 292.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 418.0, + 1973.0, + 704.0, + 1973.0, + 704.0, + 2011.0, + 418.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 1973.0, + 1184.0, + 1973.0, + 1184.0, + 2011.0, + 778.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1211.0, + 1973.0, + 1406.0, + 1973.0, + 1406.0, + 2011.0, + 1211.0, + 2011.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2002.0, + 404.0, + 2002.0, + 404.0, + 2034.0, + 292.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 427.0, + 2002.0, + 436.0, + 2002.0, + 436.0, + 2034.0, + 427.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 220.0, + 1315.0, + 220.0, + 1315.0, + 267.0, + 295.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1012.0, + 564.0, + 1012.0, + 564.0, + 1052.0, + 298.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 554.0, + 932.0, + 554.0, + 932.0, + 591.0, + 769.0, + 591.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, + 860.0, + 2087.0, + 860.0, + 2117.0, + 840.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 628.0, + 1304.0, + 628.0, + 1304.0, + 661.0, + 395.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 656.0, + 1305.0, + 656.0, + 1305.0, + 694.0, + 393.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 689.0, + 1305.0, + 689.0, + 1305.0, + 725.0, + 394.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 717.0, + 1305.0, + 717.0, + 1305.0, + 754.0, + 394.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 751.0, + 1304.0, + 751.0, + 1304.0, + 783.0, + 394.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 779.0, + 1304.0, + 779.0, + 1304.0, + 815.0, + 393.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 809.0, + 1306.0, + 809.0, + 1306.0, + 847.0, + 393.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 842.0, + 1305.0, + 842.0, + 1305.0, + 875.0, + 395.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 870.0, + 1305.0, + 870.0, + 1305.0, + 906.0, + 394.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 903.0, + 1305.0, + 903.0, + 1305.0, + 935.0, + 395.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 932.0, + 950.0, + 932.0, + 950.0, + 968.0, + 394.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1061.0, + 1407.0, + 1061.0, + 1407.0, + 1104.0, + 293.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1096.0, + 1405.0, + 1096.0, + 1405.0, + 1132.0, + 296.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1127.0, + 1405.0, + 1127.0, + 1405.0, + 1162.0, + 294.0, + 1162.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1156.0, + 1407.0, + 1156.0, + 1407.0, + 1195.0, + 293.0, + 1195.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1185.0, + 1407.0, + 1185.0, + 1407.0, + 1227.0, + 292.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1218.0, + 1407.0, + 1218.0, + 1407.0, + 1254.0, + 293.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1245.0, + 1407.0, + 1245.0, + 1407.0, + 1285.0, + 292.0, + 1285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1279.0, + 1404.0, + 1279.0, + 1404.0, + 1314.0, + 294.0, + 1314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1309.0, + 1404.0, + 1309.0, + 1404.0, + 1345.0, + 294.0, + 1345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1340.0, + 1371.0, + 1340.0, + 1371.0, + 1375.0, + 293.0, + 1375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1386.0, + 1403.0, + 1386.0, + 1403.0, + 1418.0, + 296.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1418.0, + 1403.0, + 1418.0, + 1403.0, + 1451.0, + 296.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1447.0, + 1405.0, + 1447.0, + 1405.0, + 1484.0, + 294.0, + 1484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1476.0, + 1407.0, + 1476.0, + 1407.0, + 1516.0, + 293.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1508.0, + 1407.0, + 1508.0, + 1407.0, + 1544.0, + 291.0, + 1544.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1536.0, + 1405.0, + 1536.0, + 1405.0, + 1579.0, + 292.0, + 1579.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, + 1596.0, + 1405.0, + 1596.0, + 1405.0, + 1638.0, + 293.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1631.0, + 567.0, + 1631.0, + 567.0, + 1664.0, + 296.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1677.0, + 1177.0, + 1677.0, + 1177.0, + 1712.0, + 296.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1202.0, + 1677.0, + 1405.0, + 1677.0, + 1405.0, + 1712.0, + 1202.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1707.0, + 465.0, + 1707.0, + 465.0, + 1741.0, + 294.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 493.0, + 1707.0, + 690.0, + 1707.0, + 690.0, + 1741.0, + 493.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 1707.0, + 881.0, + 1707.0, + 881.0, + 1741.0, + 768.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 909.0, + 1707.0, + 1157.0, + 1707.0, + 1157.0, + 1741.0, + 909.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 1707.0, + 1289.0, + 1707.0, + 1289.0, + 1741.0, + 1174.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1312.0, + 1707.0, + 1403.0, + 1707.0, + 1403.0, + 1741.0, + 1312.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1738.0, + 723.0, + 1738.0, + 723.0, + 1772.0, + 294.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1738.0, + 1403.0, + 1738.0, + 1403.0, + 1772.0, + 746.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1767.0, + 1404.0, + 1767.0, + 1404.0, + 1803.0, + 293.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1798.0, + 1407.0, + 1798.0, + 1407.0, + 1836.0, + 293.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1826.0, + 329.0, + 1826.0, + 329.0, + 1866.0, + 292.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1826.0, + 1408.0, + 1826.0, + 1408.0, + 1866.0, + 353.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1860.0, + 1404.0, + 1860.0, + 1404.0, + 1898.0, + 293.0, + 1898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 349.0, + 865.0, + 349.0, + 865.0, + 385.0, + 312.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 377.0, + 747.0, + 377.0, + 747.0, + 420.0, + 309.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 413.0, + 648.0, + 413.0, + 648.0, + 444.0, + 313.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 442.0, + 862.0, + 442.0, + 862.0, + 480.0, + 314.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 319.0, + 970.0, + 319.0, + 970.0, + 357.0, + 312.0, + 357.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 706, + 1404, + 706, + 1404, + 1105, + 298, + 1105 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1122, + 1403, + 1122, + 1403, + 1369, + 299, + 1369 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1851, + 1403, + 1851, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 338, + 1402, + 338, + 1402, + 553, + 298, + 553 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 300, + 568, + 1403, + 568, + 1403, + 690, + 300, + 690 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 301, + 229, + 1400, + 229, + 1400, + 324, + 301, + 324 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 368, + 1429, + 1404, + 1429, + 1404, + 1769, + 368, + 1769 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 301, + 1383, + 725, + 1383, + 725, + 1414, + 301, + 1414 + ], + "score": 0.92 + }, + { + "category_id": 0, + "poly": [ + 299, + 1798, + 575, + 1798, + 575, + 1833, + 299, + 1833 + ], + "score": 0.916 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.71 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.135 + }, + { + "category_id": 13, + "poly": [ + 298, + 919, + 383, + 919, + 383, + 956, + 298, + 956 + ], + "score": 0.93, + "latex": "\\tilde { f _ { i } } \\geq f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 936, + 292, + 990, + 292, + 990, + 325, + 936, + 325 + ], + "score": 0.88, + "latex": "O ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 1259, + 1245, + 1288, + 1245, + 1288, + 1272, + 1259, + 1272 + ], + "score": 0.88, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 374, + 1245, + 403, + 1245, + 403, + 1273, + 374, + 1273 + ], + "score": 0.87, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 887, + 1337, + 915, + 1337, + 915, + 1364, + 887, + 1364 + ], + "score": 0.87, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 787, + 1123, + 816, + 1123, + 816, + 1151, + 787, + 1151 + ], + "score": 0.87, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 1254, + 1737, + 1308, + 1737, + 1308, + 1765, + 1254, + 1765 + ], + "score": 0.86, + "latex": "71 \\%" + }, + { + "category_id": 13, + "poly": [ + 733, + 1306, + 761, + 1306, + 761, + 1333, + 733, + 1333 + ], + "score": 0.86, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 1169, + 1737, + 1223, + 1737, + 1223, + 1766, + 1169, + 1766 + ], + "score": 0.85, + "latex": "18 \\%" + }, + { + "category_id": 13, + "poly": [ + 1234, + 1276, + 1263, + 1276, + 1263, + 1304, + 1234, + 1304 + ], + "score": 0.84, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 687, + 1125, + 709, + 1125, + 709, + 1151, + 687, + 1151 + ], + "score": 0.8, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 535, + 769, + 561, + 769, + 561, + 795, + 535, + 795 + ], + "score": 0.8, + "latex": "B" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1795.0, + 578.0, + 1795.0, + 578.0, + 1839.0, + 295.0, + 1839.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, + 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": [ + 297.0, + 708.0, + 1405.0, + 708.0, + 1405.0, + 740.0, + 297.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 737.0, + 1405.0, + 737.0, + 1405.0, + 772.0, + 293.0, + 772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 765.0, + 534.0, + 765.0, + 534.0, + 803.0, + 292.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 765.0, + 1406.0, + 765.0, + 1406.0, + 803.0, + 562.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 798.0, + 1405.0, + 798.0, + 1405.0, + 834.0, + 293.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 829.0, + 1405.0, + 829.0, + 1405.0, + 865.0, + 293.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 855.0, + 1405.0, + 855.0, + 1405.0, + 896.0, + 293.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 886.0, + 1405.0, + 886.0, + 1405.0, + 928.0, + 293.0, + 928.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 921.0, + 297.0, + 921.0, + 297.0, + 961.0, + 294.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 921.0, + 1406.0, + 921.0, + 1406.0, + 961.0, + 384.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 955.0, + 1405.0, + 955.0, + 1405.0, + 991.0, + 293.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 983.0, + 1404.0, + 983.0, + 1404.0, + 1020.0, + 293.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1017.0, + 1404.0, + 1017.0, + 1404.0, + 1050.0, + 294.0, + 1050.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1045.0, + 1406.0, + 1045.0, + 1406.0, + 1082.0, + 292.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1073.0, + 1283.0, + 1073.0, + 1283.0, + 1112.0, + 292.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1118.0, + 686.0, + 1118.0, + 686.0, + 1161.0, + 293.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 1118.0, + 786.0, + 1118.0, + 786.0, + 1161.0, + 710.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 817.0, + 1118.0, + 1404.0, + 1118.0, + 1404.0, + 1161.0, + 817.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1151.0, + 1405.0, + 1151.0, + 1405.0, + 1188.0, + 293.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1184.0, + 1405.0, + 1184.0, + 1405.0, + 1218.0, + 295.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1215.0, + 1405.0, + 1215.0, + 1405.0, + 1249.0, + 295.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1242.0, + 373.0, + 1242.0, + 373.0, + 1280.0, + 294.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1242.0, + 1258.0, + 1242.0, + 1258.0, + 1280.0, + 404.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 1242.0, + 1403.0, + 1242.0, + 1403.0, + 1280.0, + 1289.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1274.0, + 1233.0, + 1274.0, + 1233.0, + 1311.0, + 293.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 1274.0, + 1405.0, + 1274.0, + 1405.0, + 1311.0, + 1264.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1305.0, + 732.0, + 1305.0, + 732.0, + 1341.0, + 293.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 1305.0, + 1405.0, + 1305.0, + 1405.0, + 1341.0, + 762.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1335.0, + 886.0, + 1335.0, + 886.0, + 1371.0, + 293.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 1335.0, + 926.0, + 1335.0, + 926.0, + 1371.0, + 916.0, + 1371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1850.0, + 1407.0, + 1850.0, + 1407.0, + 1886.0, + 294.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1881.0, + 1403.0, + 1881.0, + 1403.0, + 1916.0, + 294.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1906.0, + 1404.0, + 1906.0, + 1404.0, + 1950.0, + 291.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1977.0, + 293.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1970.0, + 1405.0, + 1970.0, + 1405.0, + 2007.0, + 293.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 1405.0, + 2003.0, + 1405.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 338.0, + 1404.0, + 338.0, + 1404.0, + 373.0, + 296.0, + 373.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": [ + 294.0, + 400.0, + 1404.0, + 400.0, + 1404.0, + 434.0, + 294.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 427.0, + 1404.0, + 427.0, + 1404.0, + 465.0, + 293.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 460.0, + 1406.0, + 460.0, + 1406.0, + 495.0, + 294.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 487.0, + 1407.0, + 487.0, + 1407.0, + 530.0, + 291.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 521.0, + 1404.0, + 521.0, + 1404.0, + 557.0, + 293.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 567.0, + 1402.0, + 567.0, + 1402.0, + 604.0, + 293.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 597.0, + 1404.0, + 597.0, + 1404.0, + 635.0, + 294.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 628.0, + 1405.0, + 628.0, + 1405.0, + 667.0, + 293.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 661.0, + 1125.0, + 661.0, + 1125.0, + 694.0, + 296.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 230.0, + 1403.0, + 230.0, + 1403.0, + 264.0, + 297.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 262.0, + 1403.0, + 262.0, + 1403.0, + 296.0, + 297.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 291.0, + 935.0, + 291.0, + 935.0, + 329.0, + 296.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 291.0, + 1325.0, + 291.0, + 1325.0, + 329.0, + 991.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1431.0, + 1405.0, + 1431.0, + 1405.0, + 1466.0, + 367.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1462.0, + 1340.0, + 1462.0, + 1340.0, + 1496.0, + 393.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1506.0, + 1405.0, + 1506.0, + 1405.0, + 1543.0, + 369.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 1536.0, + 1406.0, + 1536.0, + 1406.0, + 1574.0, + 391.0, + 1574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1569.0, + 1404.0, + 1569.0, + 1404.0, + 1602.0, + 394.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1600.0, + 1404.0, + 1600.0, + 1404.0, + 1631.0, + 394.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1631.0, + 653.0, + 1631.0, + 653.0, + 1660.0, + 396.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 1673.0, + 1406.0, + 1673.0, + 1406.0, + 1710.0, + 384.0, + 1710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1704.0, + 1406.0, + 1704.0, + 1406.0, + 1743.0, + 393.0, + 1743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1739.0, + 1168.0, + 1739.0, + 1168.0, + 1770.0, + 395.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1739.0, + 1253.0, + 1739.0, + 1253.0, + 1770.0, + 1224.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1309.0, + 1739.0, + 1319.0, + 1739.0, + 1319.0, + 1770.0, + 1309.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1380.0, + 730.0, + 1380.0, + 730.0, + 1418.0, + 296.0, + 1418.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1327, + 1404, + 1327, + 1404, + 1691, + 297, + 1691 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 743, + 1404, + 743, + 1404, + 1051, + 298, + 1051 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 506, + 1403, + 506, + 1403, + 721, + 298, + 721 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 308, + 1402, + 308, + 1402, + 491, + 298, + 491 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1823, + 1403, + 1823, + 1403, + 1990, + 298, + 1990 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 1066, + 1404, + 1066, + 1404, + 1312, + 298, + 1312 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 294, + 229, + 1399, + 229, + 1399, + 293, + 294, + 293 + ], + "score": 0.95 + }, + { + "category_id": 0, + "poly": [ + 300, + 1725, + 565, + 1725, + 565, + 1759, + 300, + 1759 + ], + "score": 0.899 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 300, + 1771, + 597, + 1771, + 597, + 1804, + 300, + 1804 + ], + "score": 0.86 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.643 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.367 + }, + { + "category_id": 13, + "poly": [ + 436, + 1822, + 603, + 1822, + 603, + 1860, + 436, + 1860 + ], + "score": 0.93, + "latex": "e _ { i } : = | \\tilde { f } _ { i } - f _ { i } |" + }, + { + "category_id": 13, + "poly": [ + 1036, + 1956, + 1288, + 1956, + 1288, + 1991, + 1036, + 1991 + ], + "score": 0.93, + "latex": "\\mathrm { P r } _ { i \\sim \\mathcal { D } } [ i = j ] = f _ { j } / N" + }, + { + "category_id": 13, + "poly": [ + 1126, + 1856, + 1394, + 1856, + 1394, + 1899, + 1126, + 1899 + ], + "score": 0.93, + "latex": "\\tilde { \\mathcal { F } } = \\{ \\tilde { f } _ { 1 } , \\tilde { f } _ { 2 } , \\cdot \\cdot \\cdot , \\tilde { f } _ { | U | } \\}" + }, + { + "category_id": 13, + "poly": [ + 1120, + 959, + 1218, + 959, + 1218, + 993, + 1120, + 993 + ], + "score": 0.92, + "latex": "B \\times | U |" + }, + { + "category_id": 13, + "poly": [ + 653, + 926, + 839, + 926, + 839, + 962, + 653, + 962 + ], + "score": 0.92, + "latex": "( f _ { 1 } , f _ { 2 } \\ldots , f _ { | U | } )" + }, + { + "category_id": 13, + "poly": [ + 635, + 1861, + 904, + 1861, + 904, + 1897, + 635, + 1897 + ], + "score": 0.92, + "latex": "\\mathcal { F } = \\{ f _ { 1 } , f _ { 2 } , \\cdot \\cdot \\cdot , f _ { | U | } \\}" + }, + { + "category_id": 13, + "poly": [ + 648, + 1897, + 753, + 1897, + 753, + 1928, + 648, + 1928 + ], + "score": 0.92, + "latex": "E _ { i \\sim \\mathcal { D } } [ e _ { i } ]" + }, + { + "category_id": 13, + "poly": [ + 983, + 1828, + 1008, + 1828, + 1008, + 1859, + 983, + 1859 + ], + "score": 0.88, + "latex": "f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1305, + 1927, + 1332, + 1927, + 1332, + 1953, + 1305, + 1953 + ], + "score": 0.84, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 919, + 1959, + 936, + 1959, + 936, + 1989, + 919, + 1989 + ], + "score": 0.83, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 1306, + 960, + 1332, + 960, + 1332, + 987, + 1306, + 987 + ], + "score": 0.81, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 844, + 1899, + 869, + 1899, + 869, + 1923, + 844, + 1923 + ], + "score": 0.81, + "latex": "\\mathcal { D }" + }, + { + "category_id": 13, + "poly": [ + 1373, + 1958, + 1401, + 1958, + 1401, + 1984, + 1373, + 1984 + ], + "score": 0.8, + "latex": "N" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1722.0, + 568.0, + 1722.0, + 568.0, + 1764.0, + 296.0, + 1764.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, + 1770.0, + 598.0, + 1770.0, + 598.0, + 1805.0, + 296.0, + 1805.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": [ + 294.0, + 1327.0, + 1404.0, + 1327.0, + 1404.0, + 1363.0, + 294.0, + 1363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1358.0, + 1404.0, + 1358.0, + 1404.0, + 1392.0, + 295.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1388.0, + 1407.0, + 1388.0, + 1407.0, + 1423.0, + 292.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1418.0, + 1404.0, + 1418.0, + 1404.0, + 1452.0, + 295.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1449.0, + 1404.0, + 1449.0, + 1404.0, + 1482.0, + 295.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1480.0, + 1406.0, + 1480.0, + 1406.0, + 1514.0, + 294.0, + 1514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1511.0, + 1405.0, + 1511.0, + 1405.0, + 1545.0, + 295.0, + 1545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1539.0, + 1405.0, + 1539.0, + 1405.0, + 1575.0, + 292.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1569.0, + 1404.0, + 1569.0, + 1404.0, + 1606.0, + 294.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1602.0, + 1406.0, + 1602.0, + 1406.0, + 1636.0, + 294.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1632.0, + 1405.0, + 1632.0, + 1405.0, + 1666.0, + 295.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1657.0, + 381.0, + 1657.0, + 381.0, + 1698.0, + 292.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 739.0, + 1405.0, + 739.0, + 1405.0, + 782.0, + 292.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 769.0, + 1405.0, + 769.0, + 1405.0, + 813.0, + 292.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 804.0, + 1402.0, + 804.0, + 1402.0, + 840.0, + 293.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 832.0, + 1403.0, + 832.0, + 1403.0, + 869.0, + 293.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 864.0, + 1405.0, + 864.0, + 1405.0, + 898.0, + 292.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 893.0, + 1404.0, + 893.0, + 1404.0, + 931.0, + 293.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 922.0, + 652.0, + 922.0, + 652.0, + 963.0, + 292.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 922.0, + 1406.0, + 922.0, + 1406.0, + 963.0, + 840.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 959.0, + 1119.0, + 959.0, + 1119.0, + 995.0, + 294.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 959.0, + 1305.0, + 959.0, + 1305.0, + 995.0, + 1219.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 959.0, + 1404.0, + 959.0, + 1404.0, + 995.0, + 1333.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 990.0, + 1406.0, + 990.0, + 1406.0, + 1026.0, + 294.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1018.0, + 862.0, + 1018.0, + 862.0, + 1054.0, + 294.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 508.0, + 1407.0, + 508.0, + 1407.0, + 542.0, + 296.0, + 542.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 537.0, + 1405.0, + 537.0, + 1405.0, + 572.0, + 294.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 564.0, + 1407.0, + 564.0, + 1407.0, + 606.0, + 292.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 597.0, + 1407.0, + 597.0, + 1407.0, + 633.0, + 293.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 629.0, + 1405.0, + 629.0, + 1405.0, + 664.0, + 294.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 660.0, + 1405.0, + 660.0, + 1405.0, + 695.0, + 294.0, + 695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 689.0, + 704.0, + 689.0, + 704.0, + 724.0, + 293.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 306.0, + 1406.0, + 306.0, + 1406.0, + 344.0, + 294.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 336.0, + 1406.0, + 336.0, + 1406.0, + 373.0, + 294.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 368.0, + 1404.0, + 368.0, + 1404.0, + 403.0, + 293.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 398.0, + 1406.0, + 398.0, + 1406.0, + 435.0, + 293.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 429.0, + 1407.0, + 429.0, + 1407.0, + 468.0, + 293.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 460.0, + 883.0, + 460.0, + 883.0, + 494.0, + 294.0, + 494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1824.0, + 435.0, + 1824.0, + 435.0, + 1861.0, + 296.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1824.0, + 982.0, + 1824.0, + 982.0, + 1861.0, + 604.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1824.0, + 1405.0, + 1824.0, + 1405.0, + 1861.0, + 1009.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1856.0, + 634.0, + 1856.0, + 634.0, + 1901.0, + 292.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1856.0, + 1125.0, + 1856.0, + 1125.0, + 1901.0, + 905.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1856.0, + 1405.0, + 1856.0, + 1405.0, + 1901.0, + 1395.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1893.0, + 647.0, + 1893.0, + 647.0, + 1930.0, + 293.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 1893.0, + 843.0, + 1893.0, + 843.0, + 1930.0, + 754.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 1893.0, + 1407.0, + 1893.0, + 1407.0, + 1930.0, + 870.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1926.0, + 1304.0, + 1926.0, + 1304.0, + 1959.0, + 294.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1333.0, + 1926.0, + 1404.0, + 1926.0, + 1404.0, + 1959.0, + 1333.0, + 1959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1955.0, + 918.0, + 1955.0, + 918.0, + 1992.0, + 293.0, + 1992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 1955.0, + 1035.0, + 1955.0, + 1035.0, + 1992.0, + 937.0, + 1992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 1955.0, + 1372.0, + 1955.0, + 1372.0, + 1992.0, + 1289.0, + 1992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1066.0, + 1404.0, + 1066.0, + 1404.0, + 1100.0, + 296.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1096.0, + 1408.0, + 1096.0, + 1408.0, + 1134.0, + 293.0, + 1134.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1125.0, + 1405.0, + 1125.0, + 1405.0, + 1161.0, + 293.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1159.0, + 1404.0, + 1159.0, + 1404.0, + 1193.0, + 294.0, + 1193.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1187.0, + 1405.0, + 1187.0, + 1405.0, + 1224.0, + 292.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1218.0, + 1406.0, + 1218.0, + 1406.0, + 1254.0, + 293.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1249.0, + 1408.0, + 1249.0, + 1408.0, + 1286.0, + 292.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1282.0, + 582.0, + 1282.0, + 582.0, + 1315.0, + 294.0, + 1315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1403.0, + 229.0, + 1403.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 261.0, + 1020.0, + 261.0, + 1020.0, + 296.0, + 294.0, + 296.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1347, + 1405, + 1347, + 1405, + 1626, + 297, + 1626 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 296, + 584, + 1404, + 584, + 1404, + 796, + 296, + 796 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 938, + 1404, + 938, + 1404, + 1112, + 297, + 1112 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 342, + 1402, + 342, + 1402, + 472, + 297, + 472 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1171, + 1405, + 1171, + 1405, + 1267, + 299, + 1267 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 1924, + 1404, + 1924, + 1404, + 2016, + 299, + 2016 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1639, + 1403, + 1639, + 1403, + 1793, + 298, + 1793 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1808, + 1404, + 1808, + 1404, + 1909, + 298, + 1909 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 297, + 813, + 1405, + 813, + 1405, + 921, + 297, + 921 + ], + "score": 0.971 + }, + { + "category_id": 8, + "poly": [ + 648, + 261, + 1053, + 261, + 1053, + 331, + 648, + 331 + ], + "score": 0.945 + }, + { + "category_id": 0, + "poly": [ + 300, + 1294, + 1183, + 1294, + 1183, + 1332, + 300, + 1332 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 298, + 226, + 1261, + 226, + 1261, + 261, + 298, + 261 + ], + "score": 0.924 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 816, + 74, + 816, + 106, + 298, + 106 + ], + "score": 0.917 + }, + { + "category_id": 0, + "poly": [ + 299, + 1125, + 636, + 1125, + 636, + 1156, + 299, + 1156 + ], + "score": 0.909 + }, + { + "category_id": 9, + "poly": [ + 1345, + 268, + 1400, + 268, + 1400, + 300, + 1345, + 300 + ], + "score": 0.908 + }, + { + "category_id": 1, + "poly": [ + 291, + 531, + 1331, + 531, + 1331, + 567, + 291, + 567 + ], + "score": 0.903 + }, + { + "category_id": 0, + "poly": [ + 298, + 486, + 890, + 486, + 890, + 517, + 298, + 517 + ], + "score": 0.82 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.769 + }, + { + "category_id": 13, + "poly": [ + 660, + 1073, + 745, + 1073, + 745, + 1111, + 660, + 1111 + ], + "score": 0.94, + "latex": "\\tilde { f _ { i } } < f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 687, + 714, + 1049, + 714, + 1049, + 759, + 687, + 759 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\tilde { f } _ { i } = C [ h ( i ) ] = \\sum _ { j : h ( i ) = h ( j ) } f _ { j } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 644, + 259, + 1054, + 259, + 1054, + 333, + 644, + 333 + ], + "score": 0.93, + "latex": "\\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } ) : = 1 / N \\sum _ { i \\in U } | \\tilde { f } _ { i } - f _ { i } | \\cdot f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 905, + 616, + 1011, + 616, + 1011, + 649, + 905, + 649 + ], + "score": 0.93, + "latex": "\\{ 1 \\ldots B \\bar { \\} }" + }, + { + "category_id": 13, + "poly": [ + 1161, + 677, + 1393, + 677, + 1393, + 718, + 1161, + 718 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { C [ b ] = \\sum _ { j : h ( j ) = b } \\mathsf { \\bar { f } } _ { j } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 835, + 815, + 997, + 815, + 997, + 847, + 835, + 847 + ], + "score": 0.93, + "latex": "h _ { i } : U \\to [ B ]" + }, + { + "category_id": 13, + "poly": [ + 873, + 1233, + 972, + 1233, + 972, + 1267, + 873, + 1267 + ], + "score": 0.92, + "latex": "f _ { i } = 1 / i" + }, + { + "category_id": 13, + "poly": [ + 1065, + 1203, + 1336, + 1203, + 1336, + 1236, + 1065, + 1236 + ], + "score": 0.92, + "latex": "f _ { i _ { 1 } } \\geq f _ { i _ { 2 } } \\geq . . . \\geq f _ { i _ { n } }" + }, + { + "category_id": 13, + "poly": [ + 774, + 1000, + 1135, + 1000, + 1135, + 1040, + 774, + 1040 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { C [ \\ell , b ] = \\sum _ { j : h _ { \\ell } ( j ) = b } f _ { j } \\cdot g _ { \\ell } ( j ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1024, + 844, + 1290, + 844, + 1290, + 884, + 1024, + 884 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { C [ \\ell , b ] = \\sum _ { j : h \\ell ( j ) = b } f _ { j } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1167, + 1873, + 1252, + 1873, + 1252, + 1909, + 1167, + 1909 + ], + "score": 0.92, + "latex": "\\tilde { f _ { i } } = f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 815, + 1042, + 1070, + 1042, + 1070, + 1076, + 815, + 1076 + ], + "score": 0.92, + "latex": "\\{ g _ { \\ell } ( i ) \\cdot C [ \\ell , h _ { \\ell } ( i ) ] \\} _ { \\ell \\le k }" + }, + { + "category_id": 13, + "poly": [ + 346, + 755, + 430, + 755, + 430, + 795, + 346, + 795 + ], + "score": 0.92, + "latex": "\\tilde { f _ { i } } \\geq f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 492, + 679, + 578, + 679, + 578, + 711, + 492, + 711 + ], + "score": 0.92, + "latex": "C [ h ( i ) ]" + }, + { + "category_id": 13, + "poly": [ + 785, + 885, + 996, + 885, + 996, + 921, + 785, + 921 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } _ { \\ell \\le k } C [ \\ell , h _ { \\ell } ( i ) ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1233, + 411, + 1233, + 411, + 1270, + 298, + 1270 + ], + "score": 0.92, + "latex": "f _ { i _ { j } } \\propto 1 / j" + }, + { + "category_id": 13, + "poly": [ + 558, + 373, + 843, + 373, + 843, + 412, + 558, + 412 + ], + "score": 0.92, + "latex": "\\mathrm { P r } [ | \\bar { \\tilde { f } } _ { i } - f _ { i } | > \\epsilon N ] < \\delta" + }, + { + "category_id": 13, + "poly": [ + 1233, + 883, + 1317, + 883, + 1317, + 919, + 1233, + 919 + ], + "score": 0.91, + "latex": "\\tilde { f _ { i } } \\geq f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 298, + 616, + 469, + 616, + 469, + 649, + 298, + 649 + ], + "score": 0.91, + "latex": "h : { \\bar { U } } [ B ]" + }, + { + "category_id": 13, + "poly": [ + 1149, + 939, + 1317, + 939, + 1317, + 971, + 1149, + 971 + ], + "score": 0.91, + "latex": "h _ { i } : U \\to [ B ]" + }, + { + "category_id": 13, + "poly": [ + 418, + 1732, + 511, + 1732, + 511, + 1762, + 418, + 1762 + ], + "score": 0.91, + "latex": "B - B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 1262, + 816, + 1338, + 816, + 1338, + 843, + 1262, + 843 + ], + "score": 0.91, + "latex": "k \\times B" + }, + { + "category_id": 13, + "poly": [ + 1191, + 970, + 1393, + 970, + 1393, + 1002, + 1191, + 1002 + ], + "score": 0.91, + "latex": "g _ { i } : U \\stackrel { \\cdot } { } \\bar { \\{ - 1 , 1 \\} }" + }, + { + "category_id": 13, + "poly": [ + 505, + 647, + 621, + 647, + 621, + 680, + 505, + 680 + ], + "score": 0.91, + "latex": "C [ 1 \\ldots B ]" + }, + { + "category_id": 13, + "poly": [ + 470, + 970, + 545, + 970, + 545, + 998, + 470, + 998 + ], + "score": 0.9, + "latex": "k \\times B" + }, + { + "category_id": 13, + "poly": [ + 512, + 1036, + 537, + 1036, + 537, + 1075, + 512, + 1075 + ], + "score": 0.89, + "latex": "\\tilde { f } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 634, + 882, + 659, + 882, + 659, + 918, + 634, + 918 + ], + "score": 0.89, + "latex": "\\tilde { f } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 554, + 1703, + 590, + 1703, + 590, + 1732, + 554, + 1732 + ], + "score": 0.89, + "latex": "B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 448, + 715, + 474, + 715, + 474, + 752, + 448, + 752 + ], + "score": 0.89, + "latex": "\\tilde { f } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 654, + 617, + 694, + 617, + 694, + 649, + 654, + 649 + ], + "score": 0.88, + "latex": "[ B ]" + }, + { + "category_id": 13, + "poly": [ + 874, + 1807, + 899, + 1807, + 899, + 1844, + 874, + 1844 + ], + "score": 0.87, + "latex": "\\tilde { f } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 354, + 377, + 413, + 377, + 413, + 411, + 354, + 411 + ], + "score": 0.87, + "latex": "( \\epsilon , \\delta )" + }, + { + "category_id": 13, + "poly": [ + 1266, + 1003, + 1348, + 1003, + 1348, + 1029, + 1266, + 1029 + ], + "score": 0.87, + "latex": "\\textit { i } \\in \\textit { U }" + }, + { + "category_id": 13, + "poly": [ + 297, + 886, + 365, + 886, + 365, + 915, + 297, + 915 + ], + "score": 0.87, + "latex": "i \\in U" + }, + { + "category_id": 13, + "poly": [ + 510, + 718, + 535, + 718, + 535, + 752, + 510, + 752 + ], + "score": 0.87, + "latex": "f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1364, + 1923, + 1393, + 1923, + 1393, + 1952, + 1364, + 1952 + ], + "score": 0.87, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 1027, + 226, + 1053, + 226, + 1053, + 258, + 1027, + 258 + ], + "score": 0.86, + "latex": "\\tilde { \\mathcal { F } }" + }, + { + "category_id": 13, + "poly": [ + 1180, + 1640, + 1253, + 1640, + 1253, + 1673, + 1180, + 1673 + ], + "score": 0.85, + "latex": "\\mathsf { H H } ( i )" + }, + { + "category_id": 13, + "poly": [ + 526, + 846, + 550, + 846, + 550, + 872, + 526, + 872 + ], + "score": 0.83, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 628, + 1001, + 654, + 1001, + 654, + 1028, + 628, + 1028 + ], + "score": 0.83, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 1150, + 816, + 1175, + 816, + 1175, + 842, + 1150, + 842 + ], + "score": 0.82, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 552, + 816, + 571, + 816, + 571, + 842, + 552, + 842 + ], + "score": 0.82, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 362, + 971, + 387, + 971, + 387, + 998, + 362, + 998 + ], + "score": 0.82, + "latex": "C" + }, + { + "category_id": 13, + "poly": [ + 863, + 941, + 883, + 941, + 883, + 967, + 863, + 967 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1256, + 1925, + 1277, + 1925, + 1277, + 1952, + 1256, + 1952 + ], + "score": 0.8, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 1003, + 971, + 1022, + 971, + 1022, + 997, + 1003, + 997 + ], + "score": 0.8, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1226, + 232, + 1251, + 232, + 1251, + 258, + 1226, + 258 + ], + "score": 0.79, + "latex": "\\mathcal { F }" + }, + { + "category_id": 13, + "poly": [ + 1289, + 1814, + 1302, + 1814, + 1302, + 1839, + 1289, + 1839 + ], + "score": 0.79, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1275, + 650, + 1288, + 650, + 1288, + 675, + 1275, + 675 + ], + "score": 0.77, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 957, + 381, + 971, + 381, + 971, + 406, + 957, + 406 + ], + "score": 0.71, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1058, + 410, + 1075, + 410, + 1075, + 437, + 1058, + 437 + ], + "score": 0.7, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 636, + 1673, + 650, + 1673, + 650, + 1698, + 636, + 1698 + ], + "score": 0.64, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 991, + 415, + 1006, + 415, + 1006, + 436, + 991, + 436 + ], + "score": 0.34, + "latex": "\\stackrel { \\cdot } { \\epsilon }" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1294.0, + 1185.0, + 1294.0, + 1185.0, + 1336.0, + 294.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 109.0, + 296.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1122.0, + 638.0, + 1122.0, + 638.0, + 1160.0, + 295.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 484.0, + 889.0, + 484.0, + 889.0, + 521.0, + 294.0, + 521.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, + 1348.0, + 1403.0, + 1348.0, + 1403.0, + 1385.0, + 296.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1381.0, + 1403.0, + 1381.0, + 1403.0, + 1414.0, + 295.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1409.0, + 1405.0, + 1409.0, + 1405.0, + 1447.0, + 292.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1440.0, + 1405.0, + 1440.0, + 1405.0, + 1477.0, + 295.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1469.0, + 1403.0, + 1469.0, + 1403.0, + 1506.0, + 294.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1501.0, + 1407.0, + 1501.0, + 1407.0, + 1539.0, + 292.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1534.0, + 1405.0, + 1534.0, + 1405.0, + 1567.0, + 296.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1562.0, + 1406.0, + 1562.0, + 1406.0, + 1598.0, + 295.0, + 1598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1593.0, + 1403.0, + 1593.0, + 1403.0, + 1629.0, + 294.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 585.0, + 1404.0, + 585.0, + 1404.0, + 619.0, + 295.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 614.0, + 297.0, + 614.0, + 297.0, + 652.0, + 293.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 470.0, + 614.0, + 653.0, + 614.0, + 653.0, + 652.0, + 470.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 695.0, + 614.0, + 904.0, + 614.0, + 904.0, + 652.0, + 695.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 614.0, + 1405.0, + 614.0, + 1405.0, + 652.0, + 1012.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 645.0, + 504.0, + 645.0, + 504.0, + 681.0, + 294.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 645.0, + 1274.0, + 645.0, + 1274.0, + 681.0, + 622.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 645.0, + 1402.0, + 645.0, + 1402.0, + 681.0, + 1289.0, + 681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 668.0, + 491.0, + 668.0, + 491.0, + 722.0, + 290.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 579.0, + 668.0, + 1160.0, + 668.0, + 1160.0, + 722.0, + 579.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 668.0, + 1406.0, + 668.0, + 1406.0, + 722.0, + 1394.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 712.0, + 447.0, + 712.0, + 447.0, + 762.0, + 293.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 475.0, + 712.0, + 509.0, + 712.0, + 509.0, + 762.0, + 475.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 712.0, + 686.0, + 712.0, + 686.0, + 762.0, + 536.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 712.0, + 1407.0, + 712.0, + 1407.0, + 762.0, + 1050.0, + 762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 752.0, + 345.0, + 752.0, + 345.0, + 800.0, + 292.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 752.0, + 445.0, + 752.0, + 445.0, + 800.0, + 431.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 936.0, + 862.0, + 936.0, + 862.0, + 974.0, + 296.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 936.0, + 1148.0, + 936.0, + 1148.0, + 974.0, + 884.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 936.0, + 1405.0, + 936.0, + 1405.0, + 974.0, + 1318.0, + 974.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 966.0, + 361.0, + 966.0, + 361.0, + 1005.0, + 294.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 966.0, + 469.0, + 966.0, + 469.0, + 1005.0, + 388.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 966.0, + 1002.0, + 966.0, + 1002.0, + 1005.0, + 546.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 966.0, + 1190.0, + 966.0, + 1190.0, + 1005.0, + 1023.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 966.0, + 1404.0, + 966.0, + 1404.0, + 1005.0, + 1394.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 997.0, + 627.0, + 997.0, + 627.0, + 1042.0, + 292.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 997.0, + 773.0, + 997.0, + 773.0, + 1042.0, + 655.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 997.0, + 1265.0, + 997.0, + 1265.0, + 1042.0, + 1136.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 997.0, + 1407.0, + 997.0, + 1407.0, + 1042.0, + 1349.0, + 1042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1038.0, + 511.0, + 1038.0, + 511.0, + 1080.0, + 294.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1038.0, + 814.0, + 1038.0, + 814.0, + 1080.0, + 538.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1038.0, + 1406.0, + 1038.0, + 1406.0, + 1080.0, + 1071.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1076.0, + 659.0, + 1076.0, + 659.0, + 1114.0, + 295.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 1076.0, + 757.0, + 1076.0, + 757.0, + 1114.0, + 746.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 341.0, + 1406.0, + 341.0, + 1406.0, + 379.0, + 293.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 376.0, + 353.0, + 376.0, + 353.0, + 417.0, + 292.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 376.0, + 557.0, + 376.0, + 557.0, + 417.0, + 414.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 376.0, + 956.0, + 376.0, + 956.0, + 417.0, + 844.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 376.0, + 1408.0, + 376.0, + 1408.0, + 417.0, + 972.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 407.0, + 990.0, + 407.0, + 990.0, + 445.0, + 293.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 407.0, + 1057.0, + 407.0, + 1057.0, + 445.0, + 1007.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 407.0, + 1407.0, + 407.0, + 1407.0, + 445.0, + 1076.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 439.0, + 1368.0, + 439.0, + 1368.0, + 476.0, + 295.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1169.0, + 1405.0, + 1169.0, + 1405.0, + 1208.0, + 292.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1201.0, + 1064.0, + 1201.0, + 1064.0, + 1239.0, + 292.0, + 1239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1337.0, + 1201.0, + 1405.0, + 1201.0, + 1405.0, + 1239.0, + 1337.0, + 1239.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1233.0, + 297.0, + 1233.0, + 297.0, + 1269.0, + 294.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 412.0, + 1233.0, + 872.0, + 1233.0, + 872.0, + 1269.0, + 412.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 1233.0, + 985.0, + 1233.0, + 985.0, + 1269.0, + 973.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1922.0, + 1255.0, + 1922.0, + 1255.0, + 1958.0, + 293.0, + 1958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 1922.0, + 1363.0, + 1922.0, + 1363.0, + 1958.0, + 1278.0, + 1958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1922.0, + 1404.0, + 1922.0, + 1404.0, + 1958.0, + 1394.0, + 1958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1953.0, + 1408.0, + 1953.0, + 1408.0, + 1990.0, + 294.0, + 1990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1983.0, + 1405.0, + 1983.0, + 1405.0, + 2019.0, + 294.0, + 2019.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1639.0, + 1179.0, + 1639.0, + 1179.0, + 1676.0, + 296.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 1639.0, + 1405.0, + 1639.0, + 1405.0, + 1676.0, + 1254.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1670.0, + 635.0, + 1670.0, + 635.0, + 1704.0, + 294.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 1670.0, + 1405.0, + 1670.0, + 1405.0, + 1704.0, + 651.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1701.0, + 553.0, + 1701.0, + 553.0, + 1735.0, + 294.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 1701.0, + 1404.0, + 1701.0, + 1404.0, + 1735.0, + 591.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1727.0, + 417.0, + 1727.0, + 417.0, + 1772.0, + 292.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1727.0, + 1407.0, + 1727.0, + 1407.0, + 1772.0, + 512.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1762.0, + 631.0, + 1762.0, + 631.0, + 1795.0, + 296.0, + 1795.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1808.0, + 873.0, + 1808.0, + 873.0, + 1847.0, + 294.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 1808.0, + 1288.0, + 1808.0, + 1288.0, + 1847.0, + 900.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1303.0, + 1808.0, + 1406.0, + 1808.0, + 1406.0, + 1847.0, + 1303.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1842.0, + 1404.0, + 1842.0, + 1404.0, + 1877.0, + 294.0, + 1877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1874.0, + 1166.0, + 1874.0, + 1166.0, + 1911.0, + 293.0, + 1911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 1874.0, + 1263.0, + 1874.0, + 1263.0, + 1911.0, + 1253.0, + 1911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 810.0, + 551.0, + 810.0, + 551.0, + 850.0, + 295.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 810.0, + 834.0, + 810.0, + 834.0, + 850.0, + 572.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 810.0, + 1149.0, + 810.0, + 1149.0, + 850.0, + 998.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 810.0, + 1261.0, + 810.0, + 1261.0, + 850.0, + 1176.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 810.0, + 1406.0, + 810.0, + 1406.0, + 850.0, + 1339.0, + 850.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 837.0, + 525.0, + 837.0, + 525.0, + 889.0, + 289.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 837.0, + 1023.0, + 837.0, + 1023.0, + 889.0, + 551.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 837.0, + 1408.0, + 837.0, + 1408.0, + 889.0, + 1291.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 881.0, + 296.0, + 881.0, + 296.0, + 925.0, + 291.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 881.0, + 633.0, + 881.0, + 633.0, + 925.0, + 366.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 881.0, + 784.0, + 881.0, + 784.0, + 925.0, + 660.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 997.0, + 881.0, + 1232.0, + 881.0, + 1232.0, + 925.0, + 997.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1318.0, + 881.0, + 1328.0, + 881.0, + 1328.0, + 925.0, + 1318.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 225.0, + 1026.0, + 225.0, + 1026.0, + 268.0, + 292.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 225.0, + 1225.0, + 225.0, + 1225.0, + 268.0, + 1054.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 225.0, + 1264.0, + 225.0, + 1264.0, + 268.0, + 1252.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 527.0, + 1335.0, + 527.0, + 1335.0, + 573.0, + 291.0, + 573.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 365, + 877, + 1334, + 877, + 1334, + 1075, + 365, + 1075 + ], + "score": 0.978, + "html": "
AlgorithmsExpected ErrorAnalysis
Single Hash Function (B)(ln² n/B)Lemma 9.2
Count-Min Sketch (k,B)Ω(k lnnand O( (管)BlnkBTheorem 9.11
Learned Count-Min(B)0(ln²(n/B)/B)Theorem 9.14
Ideal Count-Min(B)(ln²(n/B)/B)Theorem 10.4
" + }, + { + "category_id": 1, + "poly": [ + 296, + 1286, + 1405, + 1286, + 1405, + 1502, + 296, + 1502 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 355, + 1402, + 355, + 1402, + 477, + 299, + 477 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 492, + 1403, + 492, + 1403, + 648, + 298, + 648 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 661, + 1404, + 661, + 1404, + 786, + 297, + 786 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 1402, + 229, + 1402, + 292, + 297, + 292 + ], + "score": 0.946 + }, + { + "category_id": 3, + "poly": [ + 1093, + 1602, + 1403, + 1602, + 1403, + 1939, + 1093, + 1939 + ], + "score": 0.936 + }, + { + "category_id": 4, + "poly": [ + 425, + 1993, + 1279, + 1993, + 1279, + 2027, + 425, + 2027 + ], + "score": 0.91 + }, + { + "category_id": 0, + "poly": [ + 299, + 1228, + 545, + 1228, + 545, + 1263, + 299, + 1263 + ], + "score": 0.905 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 815, + 75, + 815, + 105, + 300, + 105 + ], + "score": 0.903 + }, + { + "category_id": 0, + "poly": [ + 298, + 308, + 479, + 308, + 479, + 339, + 298, + 339 + ], + "score": 0.895 + }, + { + "category_id": 1, + "poly": [ + 329, + 1517, + 1241, + 1517, + 1241, + 1549, + 329, + 1549 + ], + "score": 0.811 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.75 + }, + { + "category_id": 1, + "poly": [ + 297, + 1079, + 1407, + 1079, + 1407, + 1202, + 297, + 1202 + ], + "score": 0.632 + }, + { + "category_id": 6, + "poly": [ + 299, + 800, + 1399, + 800, + 1399, + 864, + 299, + 864 + ], + "score": 0.583 + }, + { + "category_id": 6, + "poly": [ + 299, + 1574, + 880, + 1574, + 880, + 1607, + 299, + 1607 + ], + "score": 0.561 + }, + { + "category_id": 1, + "poly": [ + 299, + 800, + 1399, + 800, + 1399, + 864, + 299, + 864 + ], + "score": 0.436 + }, + { + "category_id": 0, + "poly": [ + 299, + 1574, + 880, + 1574, + 880, + 1607, + 299, + 1607 + ], + "score": 0.19 + }, + { + "category_id": 3, + "poly": [ + 301, + 1617, + 912, + 1617, + 912, + 1983, + 301, + 1983 + ], + "score": 0.116 + }, + { + "category_id": 6, + "poly": [ + 297, + 1079, + 1407, + 1079, + 1407, + 1202, + 297, + 1202 + ], + "score": 0.108 + }, + { + "category_id": 13, + "poly": [ + 817, + 615, + 989, + 615, + 989, + 649, + 817, + 649 + ], + "score": 0.93, + "latex": "\\delta = { \\cal O } ( 1 / \\ln n )" + }, + { + "category_id": 13, + "poly": [ + 368, + 1170, + 436, + 1170, + 436, + 1203, + 368, + 1203 + ], + "score": 0.92, + "latex": "\\Theta ( B )" + }, + { + "category_id": 13, + "poly": [ + 1153, + 832, + 1238, + 832, + 1238, + 862, + 1153, + 862 + ], + "score": 0.91, + "latex": "B - B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 436, + 1673, + 551, + 1673, + 551, + 1703, + 436, + 1703 + ], + "score": 0.91, + "latex": "{ \\mathsf { H H } } ( i ) = 1" + }, + { + "category_id": 13, + "poly": [ + 1050, + 800, + 1109, + 800, + 1109, + 833, + 1050, + 833 + ], + "score": 0.91, + "latex": "( \\epsilon , \\delta )" + }, + { + "category_id": 13, + "poly": [ + 722, + 1519, + 966, + 1519, + 966, + 1549, + 722, + 1549 + ], + "score": 0.88, + "latex": "B = 2 0 M , n = 3 3 . 5 M" + }, + { + "category_id": 13, + "poly": [ + 1011, + 1519, + 1236, + 1519, + 1236, + 1549, + 1011, + 1549 + ], + "score": 0.87, + "latex": "B = 5 0 M , n = 9 4 M" + }, + { + "category_id": 13, + "poly": [ + 469, + 261, + 497, + 261, + 497, + 289, + 469, + 289 + ], + "score": 0.86, + "latex": "S ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 719, + 1867, + 804, + 1867, + 804, + 1894, + 719, + 1894 + ], + "score": 0.86, + "latex": "B - B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 841, + 1037, + 1032, + 1037, + 1032, + 1072, + 841, + 1072 + ], + "score": 0.86, + "latex": "\\overline { { \\Theta ( \\ln ^ { 2 } ( n / B ) / B ) } }" + }, + { + "category_id": 13, + "poly": [ + 601, + 1111, + 664, + 1111, + 664, + 1141, + 601, + 1141 + ], + "score": 0.83, + "latex": "\\left( \\geq 2 \\right)" + }, + { + "category_id": 13, + "poly": [ + 749, + 966, + 855, + 966, + 855, + 1004, + 749, + 1004 + ], + "score": 0.83, + "latex": "\\Omega \\big ( \\frac { k \\ln n } { B \\ln k } \\big )" + }, + { + "category_id": 13, + "poly": [ + 908, + 948, + 1126, + 948, + 1126, + 1004, + 908, + 1004 + ], + "score": 0.82, + "latex": "\\begin{array} { r l } { { \\overline { { O ( \\frac { k \\ln n \\ln { k - 1 } } { B } ( \\frac { k n } { B } ) } ) } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 597, + 968, + 668, + 968, + 668, + 1000, + 597, + 1000 + ], + "score": 0.82, + "latex": "( k , B )" + }, + { + "category_id": 13, + "poly": [ + 963, + 556, + 989, + 556, + 989, + 582, + 963, + 582 + ], + "score": 0.8, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 842, + 1003, + 1031, + 1003, + 1031, + 1037, + 842, + 1037 + ], + "score": 0.79, + "latex": "\\overline { { \\Theta ( \\ln ^ { 2 } ( n / B ) / B ) } }" + }, + { + "category_id": 13, + "poly": [ + 1178, + 1111, + 1204, + 1111, + 1204, + 1137, + 1178, + 1137 + ], + "score": 0.79, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 868, + 911, + 1006, + 911, + 1006, + 948, + 868, + 948 + ], + "score": 0.79, + "latex": "\\overline { { \\Theta ( \\ln ^ { 2 } n / B ) } }" + }, + { + "category_id": 13, + "poly": [ + 423, + 1111, + 443, + 1111, + 443, + 1137, + 423, + 1137 + ], + "score": 0.77, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 447, + 1145, + 468, + 1145, + 468, + 1167, + 447, + 1167 + ], + "score": 0.76, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 473, + 1704, + 485, + 1704, + 485, + 1725, + 473, + 1725 + ], + "score": 0.74, + "latex": "_ { i }" + }, + { + "category_id": 13, + "poly": [ + 673, + 617, + 689, + 617, + 689, + 643, + 673, + 643 + ], + "score": 0.74, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 1248, + 560, + 1269, + 560, + 1269, + 582, + 1248, + 582 + ], + "score": 0.72, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 808, + 1759, + 820, + 1759, + 820, + 1780, + 808, + 1780 + ], + "score": 0.72, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 688, + 1618, + 721, + 1618, + 721, + 1645, + 688, + 1645 + ], + "score": 0.66, + "latex": "B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 503, + 1869, + 515, + 1869, + 515, + 1891, + 503, + 1891 + ], + "score": 0.64, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 624, + 1648, + 636, + 1648, + 636, + 1670, + 624, + 1670 + ], + "score": 0.57, + "latex": "_ { i }" + }, + { + "category_id": 13, + "poly": [ + 741, + 1731, + 753, + 1731, + 753, + 1754, + 741, + 1754 + ], + "score": 0.53, + "latex": "_ { i }" + }, + { + "category_id": 13, + "poly": [ + 633, + 914, + 676, + 914, + 676, + 946, + 633, + 946 + ], + "score": 0.51, + "latex": "( B )" + }, + { + "category_id": 13, + "poly": [ + 559, + 1004, + 649, + 1004, + 649, + 1034, + 559, + 1034 + ], + "score": 0.39, + "latex": ". \\mathbf { M i n } ( B )" + }, + { + "category_id": 13, + "poly": [ + 655, + 1619, + 678, + 1619, + 678, + 1644, + 655, + 1644 + ], + "score": 0.37, + "latex": "B" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 1597.0, + 1299.0, + 1597.0, + 1299.0, + 1634.0, + 1194.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 1709.0, + 1290.0, + 1709.0, + 1290.0, + 1745.0, + 1201.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1736.0, + 1285.0, + 1736.0, + 1285.0, + 1772.0, + 1206.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 1786.0, + 1199.0, + 1786.0, + 1199.0, + 1832.0, + 1120.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 1785.0, + 1410.0, + 1785.0, + 1410.0, + 1834.0, + 1294.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1856.0, + 1212.0, + 1856.0, + 1212.0, + 1900.0, + 1125.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1271.0, + 1858.0, + 1386.0, + 1858.0, + 1386.0, + 1902.0, + 1271.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 1884.0, + 1213.0, + 1884.0, + 1213.0, + 1923.0, + 1122.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 1890.0, + 1392.0, + 1890.0, + 1392.0, + 1918.0, + 1261.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 419.0, + 1989.0, + 1279.0, + 1989.0, + 1279.0, + 2032.0, + 419.0, + 2032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1225.0, + 547.0, + 1225.0, + 547.0, + 1268.0, + 295.0, + 1268.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, + 308.0, + 480.0, + 308.0, + 480.0, + 341.0, + 296.0, + 341.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": [ + 294.0, + 797.0, + 1049.0, + 797.0, + 1049.0, + 837.0, + 294.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1110.0, + 797.0, + 1405.0, + 797.0, + 1405.0, + 837.0, + 1110.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 828.0, + 1152.0, + 828.0, + 1152.0, + 868.0, + 294.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 828.0, + 1403.0, + 828.0, + 1403.0, + 868.0, + 1239.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1567.0, + 884.0, + 1567.0, + 884.0, + 1616.0, + 294.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1567.0, + 884.0, + 1567.0, + 884.0, + 1616.0, + 294.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1616.0, + 654.0, + 1616.0, + 654.0, + 1650.0, + 306.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 1616.0, + 687.0, + 1616.0, + 687.0, + 1650.0, + 679.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 722.0, + 1616.0, + 913.0, + 1616.0, + 913.0, + 1650.0, + 722.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1645.0, + 335.0, + 1645.0, + 335.0, + 1676.0, + 306.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 375.0, + 1647.0, + 623.0, + 1647.0, + 623.0, + 1674.0, + 375.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 1647.0, + 672.0, + 1647.0, + 672.0, + 1674.0, + 637.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 1670.0, + 336.0, + 1670.0, + 336.0, + 1704.0, + 305.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 1670.0, + 435.0, + 1670.0, + 435.0, + 1704.0, + 411.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 1670.0, + 610.0, + 1670.0, + 610.0, + 1704.0, + 552.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1698.0, + 335.0, + 1698.0, + 335.0, + 1729.0, + 306.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1699.0, + 472.0, + 1699.0, + 472.0, + 1731.0, + 448.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 1699.0, + 900.0, + 1699.0, + 900.0, + 1731.0, + 486.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1726.0, + 335.0, + 1726.0, + 335.0, + 1757.0, + 306.0, + 1757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 1730.0, + 740.0, + 1730.0, + 740.0, + 1756.0, + 507.0, + 1756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1755.0, + 335.0, + 1755.0, + 335.0, + 1784.0, + 306.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 1756.0, + 807.0, + 1756.0, + 807.0, + 1786.0, + 450.0, + 1786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1756.0, + 866.0, + 1756.0, + 866.0, + 1786.0, + 821.0, + 1786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1783.0, + 335.0, + 1783.0, + 335.0, + 1813.0, + 306.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 1784.0, + 746.0, + 1784.0, + 746.0, + 1812.0, + 507.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 1811.0, + 335.0, + 1811.0, + 335.0, + 1840.0, + 306.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 1810.0, + 523.0, + 1810.0, + 523.0, + 1840.0, + 449.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 304.0, + 1838.0, + 335.0, + 1838.0, + 335.0, + 1867.0, + 304.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 412.0, + 1837.0, + 463.0, + 1837.0, + 463.0, + 1868.0, + 412.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1866.0, + 337.0, + 1866.0, + 337.0, + 1895.0, + 297.0, + 1895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1865.0, + 502.0, + 1865.0, + 502.0, + 1896.0, + 451.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 1865.0, + 718.0, + 1865.0, + 718.0, + 1896.0, + 516.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1865.0, + 889.0, + 1865.0, + 889.0, + 1896.0, + 805.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1893.0, + 337.0, + 1893.0, + 337.0, + 1922.0, + 295.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 1895.0, + 485.0, + 1895.0, + 485.0, + 1921.0, + 415.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1920.0, + 337.0, + 1920.0, + 337.0, + 1950.0, + 295.0, + 1950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 1922.0, + 462.0, + 1922.0, + 462.0, + 1948.0, + 376.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1949.0, + 500.0, + 1949.0, + 500.0, + 1980.0, + 294.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1074.0, + 1407.0, + 1074.0, + 1407.0, + 1115.0, + 292.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1107.0, + 422.0, + 1107.0, + 422.0, + 1144.0, + 294.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 444.0, + 1107.0, + 600.0, + 1107.0, + 600.0, + 1144.0, + 444.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 1107.0, + 1177.0, + 1107.0, + 1177.0, + 1144.0, + 665.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 1107.0, + 1405.0, + 1107.0, + 1405.0, + 1144.0, + 1205.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1141.0, + 446.0, + 1141.0, + 446.0, + 1173.0, + 295.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1141.0, + 1405.0, + 1141.0, + 1405.0, + 1173.0, + 469.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1170.0, + 367.0, + 1170.0, + 367.0, + 1203.0, + 292.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 1170.0, + 1307.0, + 1170.0, + 1307.0, + 1203.0, + 437.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1285.0, + 1405.0, + 1285.0, + 1405.0, + 1324.0, + 294.0, + 1324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1316.0, + 1402.0, + 1316.0, + 1402.0, + 1353.0, + 293.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1348.0, + 1405.0, + 1348.0, + 1405.0, + 1380.0, + 293.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1378.0, + 1405.0, + 1378.0, + 1405.0, + 1411.0, + 295.0, + 1411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1408.0, + 1406.0, + 1408.0, + 1406.0, + 1442.0, + 294.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1438.0, + 1403.0, + 1438.0, + 1403.0, + 1473.0, + 295.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1469.0, + 1405.0, + 1469.0, + 1405.0, + 1504.0, + 295.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 356.0, + 1404.0, + 356.0, + 1404.0, + 388.0, + 295.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 385.0, + 1404.0, + 385.0, + 1404.0, + 421.0, + 293.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 414.0, + 1404.0, + 414.0, + 1404.0, + 451.0, + 292.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 446.0, + 1126.0, + 446.0, + 1126.0, + 481.0, + 293.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 495.0, + 1403.0, + 495.0, + 1403.0, + 525.0, + 296.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 523.0, + 1404.0, + 523.0, + 1404.0, + 557.0, + 296.0, + 557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 553.0, + 962.0, + 553.0, + 962.0, + 590.0, + 293.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 553.0, + 1247.0, + 553.0, + 1247.0, + 590.0, + 990.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 553.0, + 1405.0, + 553.0, + 1405.0, + 590.0, + 1270.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 582.0, + 1407.0, + 582.0, + 1407.0, + 621.0, + 292.0, + 621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 614.0, + 672.0, + 614.0, + 672.0, + 651.0, + 293.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 614.0, + 816.0, + 614.0, + 816.0, + 651.0, + 690.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 614.0, + 1164.0, + 614.0, + 1164.0, + 651.0, + 990.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 660.0, + 1402.0, + 660.0, + 1402.0, + 698.0, + 295.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 692.0, + 1405.0, + 692.0, + 1405.0, + 728.0, + 294.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 724.0, + 1406.0, + 724.0, + 1406.0, + 759.0, + 291.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 754.0, + 1000.0, + 754.0, + 1000.0, + 789.0, + 292.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 227.0, + 1406.0, + 227.0, + 1406.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 258.0, + 468.0, + 258.0, + 468.0, + 295.0, + 295.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 498.0, + 258.0, + 511.0, + 258.0, + 511.0, + 295.0, + 498.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1515.0, + 721.0, + 1515.0, + 721.0, + 1554.0, + 332.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 1515.0, + 1010.0, + 1515.0, + 1010.0, + 1554.0, + 967.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1237.0, + 1515.0, + 1247.0, + 1515.0, + 1247.0, + 1554.0, + 1237.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1074.0, + 1407.0, + 1074.0, + 1407.0, + 1115.0, + 292.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1107.0, + 422.0, + 1107.0, + 422.0, + 1144.0, + 294.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 444.0, + 1107.0, + 600.0, + 1107.0, + 600.0, + 1144.0, + 444.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 1107.0, + 1177.0, + 1107.0, + 1177.0, + 1144.0, + 665.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 1107.0, + 1405.0, + 1107.0, + 1405.0, + 1144.0, + 1205.0, + 1144.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1141.0, + 446.0, + 1141.0, + 446.0, + 1173.0, + 295.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 469.0, + 1141.0, + 1405.0, + 1141.0, + 1405.0, + 1173.0, + 469.0, + 1173.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1170.0, + 367.0, + 1170.0, + 367.0, + 1203.0, + 292.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 1170.0, + 1307.0, + 1170.0, + 1307.0, + 1203.0, + 437.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 797.0, + 1049.0, + 797.0, + 1049.0, + 837.0, + 294.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1110.0, + 797.0, + 1405.0, + 797.0, + 1405.0, + 837.0, + 1110.0, + 837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 828.0, + 1152.0, + 828.0, + 1152.0, + 868.0, + 294.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 828.0, + 1403.0, + 828.0, + 1403.0, + 868.0, + 1239.0, + 868.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 344, + 1404, + 344, + 1404, + 589, + 297, + 589 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1260, + 1404, + 1260, + 1404, + 1536, + 297, + 1536 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 796, + 1113, + 796, + 1113, + 1010, + 298, + 1010 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 651, + 1398, + 651, + 1398, + 775, + 297, + 775 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1558, + 1403, + 1558, + 1403, + 1681, + 298, + 1681 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1403, + 229, + 1403, + 323, + 298, + 323 + ], + "score": 0.959 + }, + { + "category_id": 3, + "poly": [ + 1134, + 807, + 1400, + 807, + 1400, + 1063, + 1134, + 1063 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 297, + 1696, + 1403, + 1696, + 1403, + 1819, + 297, + 1819 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 298, + 1125, + 1399, + 1125, + 1399, + 1245, + 298, + 1245 + ], + "score": 0.925 + }, + { + "category_id": 4, + "poly": [ + 1141, + 1069, + 1397, + 1069, + 1397, + 1122, + 1141, + 1122 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 300, + 605, + 742, + 605, + 742, + 635, + 300, + 635 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 815, + 76, + 815, + 104, + 300, + 104 + ], + "score": 0.891 + }, + { + "category_id": 1, + "poly": [ + 297, + 1032, + 1110, + 1032, + 1110, + 1123, + 297, + 1123 + ], + "score": 0.87 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 859, + 2089, + 859, + 2112, + 840, + 2112 + ], + "score": 0.789 + }, + { + "category_id": 2, + "poly": [ + 295, + 1862, + 1405, + 1862, + 1405, + 2034, + 295, + 2034 + ], + "score": 0.567 + }, + { + "category_id": 13, + "poly": [ + 844, + 1758, + 899, + 1758, + 899, + 1787, + 844, + 1787 + ], + "score": 0.87, + "latex": "32 \\%" + }, + { + "category_id": 13, + "poly": [ + 1192, + 1758, + 1247, + 1758, + 1247, + 1787, + 1192, + 1787 + ], + "score": 0.86, + "latex": "42 \\%" + }, + { + "category_id": 13, + "poly": [ + 1346, + 1788, + 1401, + 1788, + 1401, + 1817, + 1346, + 1817 + ], + "score": 0.85, + "latex": "52 \\%" + }, + { + "category_id": 13, + "poly": [ + 1100, + 293, + 1119, + 293, + 1119, + 319, + 1100, + 319 + ], + "score": 0.8, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 934, + 1979, + 998, + 1979, + 998, + 2004, + 934, + 2004 + ], + "score": 0.57, + "latex": "1 0 0 0 \\mathrm { x }" + }, + { + "category_id": 13, + "poly": [ + 1055, + 1758, + 1143, + 1758, + 1143, + 1787, + 1055, + 1787 + ], + "score": 0.54, + "latex": "0 . 5 \\mathrm { M B }" + }, + { + "category_id": 13, + "poly": [ + 542, + 744, + 568, + 744, + 568, + 776, + 542, + 776 + ], + "score": 0.52, + "latex": "f _ { i }" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 816.0, + 1167.0, + 816.0, + 1167.0, + 1025.0, + 1130.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 828.0, + 1185.0, + 828.0, + 1185.0, + 872.0, + 1154.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1002.0, + 1183.0, + 1002.0, + 1183.0, + 1026.0, + 1153.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 1021.0, + 1236.0, + 1021.0, + 1236.0, + 1044.0, + 1204.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 1019.0, + 1293.0, + 1019.0, + 1293.0, + 1045.0, + 1259.0, + 1045.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1316.0, + 1021.0, + 1349.0, + 1021.0, + 1349.0, + 1044.0, + 1316.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 1022.0, + 1402.0, + 1022.0, + 1402.0, + 1044.0, + 1373.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 1033.0, + 1400.0, + 1033.0, + 1400.0, + 1069.0, + 1177.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 862.5, + 1170.0, + 862.5, + 1170.0, + 888.0, + 1165.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 898.5, + 1187.0, + 898.5, + 1187.0, + 922.5, + 1146.0, + 922.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1164.25, + 931.5, + 1173.25, + 931.5, + 1173.25, + 958.5, + 1164.25, + 958.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 967.0, + 1172.0, + 967.0, + 1172.0, + 996.0, + 1162.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 1068.0, + 1398.0, + 1068.0, + 1398.0, + 1098.0, + 1141.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1191.0, + 1093.0, + 1346.0, + 1093.0, + 1346.0, + 1124.0, + 1191.0, + 1124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 604.0, + 744.0, + 604.0, + 744.0, + 637.0, + 296.0, + 637.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": [ + 840.0, + 2087.0, + 862.0, + 2087.0, + 862.0, + 2118.0, + 840.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1858.0, + 1405.0, + 1858.0, + 1405.0, + 1897.0, + 330.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1891.0, + 1004.0, + 1891.0, + 1004.0, + 1923.0, + 293.0, + 1923.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1918.0, + 1405.0, + 1918.0, + 1405.0, + 1954.0, + 327.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1948.0, + 1403.0, + 1948.0, + 1403.0, + 1981.0, + 295.0, + 1981.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1978.0, + 933.0, + 1978.0, + 933.0, + 2009.0, + 295.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 1978.0, + 1403.0, + 1978.0, + 1403.0, + 2009.0, + 999.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 1382.0, + 2004.0, + 1382.0, + 2034.0, + 295.0, + 2034.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 344.0, + 1404.0, + 344.0, + 1404.0, + 378.0, + 296.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 375.0, + 1401.0, + 375.0, + 1401.0, + 405.0, + 296.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 405.0, + 1405.0, + 405.0, + 1405.0, + 439.0, + 294.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 437.0, + 1404.0, + 437.0, + 1404.0, + 470.0, + 294.0, + 470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 469.0, + 1402.0, + 469.0, + 1402.0, + 499.0, + 295.0, + 499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 495.0, + 1405.0, + 495.0, + 1405.0, + 532.0, + 294.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 528.0, + 1404.0, + 528.0, + 1404.0, + 561.0, + 295.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 558.0, + 1367.0, + 558.0, + 1367.0, + 591.0, + 295.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1260.0, + 1406.0, + 1260.0, + 1406.0, + 1296.0, + 296.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1292.0, + 1405.0, + 1292.0, + 1405.0, + 1325.0, + 295.0, + 1325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1317.0, + 1408.0, + 1317.0, + 1408.0, + 1361.0, + 292.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1352.0, + 1404.0, + 1352.0, + 1404.0, + 1385.0, + 295.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1381.0, + 1406.0, + 1381.0, + 1406.0, + 1419.0, + 294.0, + 1419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1414.0, + 1405.0, + 1414.0, + 1405.0, + 1448.0, + 293.0, + 1448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1442.0, + 1406.0, + 1442.0, + 1406.0, + 1480.0, + 292.0, + 1480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1470.0, + 1407.0, + 1470.0, + 1407.0, + 1510.0, + 294.0, + 1510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1501.0, + 1329.0, + 1501.0, + 1329.0, + 1540.0, + 292.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 795.0, + 1115.0, + 795.0, + 1115.0, + 828.0, + 295.0, + 828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 824.0, + 1116.0, + 824.0, + 1116.0, + 860.0, + 294.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 856.0, + 1115.0, + 856.0, + 1115.0, + 889.0, + 294.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 887.0, + 1115.0, + 887.0, + 1115.0, + 919.0, + 294.0, + 919.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 918.0, + 1115.0, + 918.0, + 1115.0, + 950.0, + 294.0, + 950.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 947.0, + 1116.0, + 947.0, + 1116.0, + 983.0, + 292.0, + 983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 979.0, + 949.0, + 979.0, + 949.0, + 1012.0, + 295.0, + 1012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 651.0, + 1403.0, + 651.0, + 1403.0, + 684.0, + 293.0, + 684.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 683.0, + 1404.0, + 683.0, + 1404.0, + 715.0, + 293.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 712.0, + 1404.0, + 712.0, + 1404.0, + 748.0, + 293.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 745.0, + 541.0, + 745.0, + 541.0, + 777.0, + 296.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 745.0, + 1305.0, + 745.0, + 1305.0, + 777.0, + 569.0, + 777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1557.0, + 1407.0, + 1557.0, + 1407.0, + 1593.0, + 293.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": [ + 293.0, + 1620.0, + 1406.0, + 1620.0, + 1406.0, + 1652.0, + 293.0, + 1652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1650.0, + 1108.0, + 1650.0, + 1108.0, + 1683.0, + 292.0, + 1683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 231.0, + 1405.0, + 231.0, + 1405.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 259.0, + 1405.0, + 259.0, + 1405.0, + 298.0, + 293.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 292.0, + 1099.0, + 292.0, + 1099.0, + 326.0, + 296.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 292.0, + 1326.0, + 292.0, + 1326.0, + 326.0, + 1120.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1696.0, + 1404.0, + 1696.0, + 1404.0, + 1732.0, + 293.0, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1725.0, + 1405.0, + 1725.0, + 1405.0, + 1762.0, + 292.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1758.0, + 843.0, + 1758.0, + 843.0, + 1794.0, + 293.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 900.0, + 1758.0, + 1054.0, + 1758.0, + 1054.0, + 1794.0, + 900.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 1758.0, + 1191.0, + 1758.0, + 1191.0, + 1794.0, + 1144.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1248.0, + 1758.0, + 1407.0, + 1758.0, + 1407.0, + 1794.0, + 1248.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1787.0, + 1345.0, + 1787.0, + 1345.0, + 1823.0, + 296.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1122.0, + 1404.0, + 1122.0, + 1404.0, + 1159.0, + 293.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1153.0, + 1404.0, + 1153.0, + 1404.0, + 1188.0, + 297.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1184.0, + 1405.0, + 1184.0, + 1405.0, + 1218.0, + 296.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1215.0, + 509.0, + 1215.0, + 509.0, + 1251.0, + 294.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1029.0, + 1115.0, + 1029.0, + 1115.0, + 1066.0, + 294.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1062.0, + 1115.0, + 1062.0, + 1115.0, + 1095.0, + 295.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1091.0, + 1116.0, + 1091.0, + 1116.0, + 1126.0, + 293.0, + 1126.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1666, + 1112, + 1666, + 1112, + 1911, + 298, + 1911 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1427, + 1403, + 1427, + 1403, + 1520, + 299, + 1520 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 298, + 1320, + 1404, + 1320, + 1404, + 1411, + 298, + 1411 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 1151, + 1404, + 1151, + 1404, + 1303, + 298, + 1303 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 410, + 223, + 1288, + 223, + 1288, + 959, + 410, + 959 + ], + "score": 0.968 + }, + { + "category_id": 2, + "poly": [ + 297, + 1949, + 1400, + 1949, + 1400, + 2034, + 297, + 2034 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 299, + 1582, + 1110, + 1582, + 1110, + 1645, + 299, + 1645 + ], + "score": 0.953 + }, + { + "category_id": 3, + "poly": [ + 1135, + 1594, + 1402, + 1594, + 1402, + 1854, + 1135, + 1854 + ], + "score": 0.952 + }, + { + "category_id": 4, + "poly": [ + 1141, + 1859, + 1398, + 1859, + 1398, + 1915, + 1141, + 1915 + ], + "score": 0.913 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 814, + 76, + 814, + 104, + 298, + 104 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 298, + 1043, + 1402, + 1043, + 1402, + 1135, + 298, + 1135 + ], + "score": 0.781 + }, + { + "category_id": 4, + "poly": [ + 310, + 995, + 1392, + 995, + 1392, + 1027, + 310, + 1027 + ], + "score": 0.775 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 858, + 2088, + 858, + 2111, + 842, + 2111 + ], + "score": 0.693 + }, + { + "category_id": 0, + "poly": [ + 300, + 1535, + 703, + 1535, + 703, + 1567, + 300, + 1567 + ], + "score": 0.674 + }, + { + "category_id": 4, + "poly": [ + 353, + 958, + 1317, + 958, + 1317, + 988, + 353, + 988 + ], + "score": 0.354 + }, + { + "category_id": 1, + "poly": [ + 300, + 1535, + 703, + 1535, + 703, + 1567, + 300, + 1567 + ], + "score": 0.265 + }, + { + "category_id": 4, + "poly": [ + 298, + 1043, + 1402, + 1043, + 1402, + 1135, + 298, + 1135 + ], + "score": 0.17 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2111, + 841, + 2111 + ], + "score": 0.133 + }, + { + "category_id": 4, + "poly": [ + 361, + 959, + 1327, + 959, + 1327, + 989, + 361, + 989 + ], + "score": 0.103 + }, + { + "category_id": 13, + "poly": [ + 822, + 1976, + 907, + 1976, + 907, + 2004, + 822, + 2004 + ], + "score": 0.88, + "latex": "1 - 2 ^ { - t }" + }, + { + "category_id": 13, + "poly": [ + 463, + 1044, + 518, + 1044, + 518, + 1073, + 463, + 1073 + ], + "score": 0.88, + "latex": "57 \\%" + }, + { + "category_id": 13, + "poly": [ + 921, + 1978, + 1036, + 1978, + 1036, + 2007, + 921, + 2007 + ], + "score": 0.84, + "latex": "\\log B _ { r } + t" + }, + { + "category_id": 13, + "poly": [ + 548, + 1043, + 637, + 1043, + 637, + 1073, + 548, + 1073 + ], + "score": 0.69, + "latex": "1 . 0 \\mathrm { M B }" + }, + { + "category_id": 13, + "poly": [ + 1078, + 1951, + 1184, + 1951, + 1184, + 1979, + 1078, + 1979 + ], + "score": 0.68, + "latex": "\\log { B _ { r } + t }" + }, + { + "category_id": 13, + "poly": [ + 324, + 1043, + 413, + 1043, + 413, + 1073, + 324, + 1073 + ], + "score": 0.66, + "latex": "0 . 5 \\mathrm { M B }" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 223.0, + 489.0, + 223.0, + 489.0, + 242.0, + 460.0, + 242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 223.0, + 950.0, + 223.0, + 950.0, + 241.0, + 920.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 227.0, + 467.0, + 227.0, + 467.0, + 533.0, + 435.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 229.0, + 927.0, + 229.0, + 927.0, + 533.0, + 898.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 230.0, + 716.0, + 230.0, + 716.0, + 259.0, + 618.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 230.0, + 1176.0, + 230.0, + 1176.0, + 259.0, + 1078.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 231.0, + 559.0, + 231.0, + 559.0, + 321.0, + 539.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 231.0, + 1025.0, + 231.0, + 1025.0, + 320.0, + 1005.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 256.0, + 1233.0, + 256.0, + 1233.0, + 288.0, + 1077.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 257.0, + 490.0, + 257.0, + 490.0, + 280.0, + 460.0, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 259.0, + 772.0, + 259.0, + 772.0, + 286.0, + 619.0, + 286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 259.0, + 950.0, + 259.0, + 950.0, + 279.0, + 921.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 295.0, + 491.0, + 295.0, + 491.0, + 317.0, + 459.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 282.0, + 791.0, + 282.0, + 791.0, + 314.0, + 616.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 297.0, + 950.0, + 297.0, + 950.0, + 316.0, + 921.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 285.0, + 1252.0, + 285.0, + 1252.0, + 314.0, + 1075.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 317.0, + 571.0, + 317.0, + 571.0, + 330.0, + 559.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 312.0, + 788.0, + 312.0, + 788.0, + 341.0, + 619.0, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 317.0, + 1043.0, + 317.0, + 1043.0, + 328.0, + 1028.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1079.0, + 312.0, + 1250.0, + 312.0, + 1250.0, + 341.0, + 1079.0, + 341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 332.0, + 490.0, + 332.0, + 490.0, + 354.0, + 460.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 327.0, + 575.0, + 327.0, + 575.0, + 349.0, + 560.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 334.0, + 950.0, + 334.0, + 950.0, + 353.0, + 921.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 327.0, + 1045.0, + 327.0, + 1045.0, + 349.0, + 1029.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 363.0, + 578.0, + 363.0, + 578.0, + 372.0, + 570.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 360.0, + 1058.0, + 360.0, + 1058.0, + 385.0, + 1037.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 369.0, + 490.0, + 369.0, + 490.0, + 391.0, + 460.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 369.0, + 951.0, + 369.0, + 951.0, + 391.0, + 920.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 407.0, + 490.0, + 407.0, + 490.0, + 428.0, + 467.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 407.0, + 950.0, + 407.0, + 950.0, + 427.0, + 928.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 443.0, + 490.0, + 443.0, + 490.0, + 464.0, + 467.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 445.0, + 949.0, + 445.0, + 949.0, + 462.0, + 929.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 468.0, + 562.0, + 468.0, + 562.0, + 476.0, + 554.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 480.0, + 490.0, + 480.0, + 490.0, + 502.0, + 467.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 476.0, + 698.0, + 476.0, + 698.0, + 485.0, + 684.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 481.0, + 950.0, + 481.0, + 950.0, + 502.0, + 928.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 477.0, + 1043.0, + 477.0, + 1043.0, + 491.0, + 1029.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 473.0, + 518.0, + 505.0, + 518.0, + 505.0, + 547.0, + 473.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 524.0, + 579.0, + 524.0, + 579.0, + 547.0, + 547.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 524.0, + 653.0, + 524.0, + 653.0, + 546.0, + 623.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 524.0, + 728.0, + 524.0, + 728.0, + 547.0, + 696.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 524.0, + 801.0, + 524.0, + 801.0, + 546.0, + 771.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 518.0, + 965.0, + 518.0, + 965.0, + 547.0, + 934.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1008.0, + 524.0, + 1041.0, + 524.0, + 1041.0, + 547.0, + 1008.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 524.0, + 1114.0, + 524.0, + 1114.0, + 546.0, + 1083.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1157.0, + 524.0, + 1188.0, + 524.0, + 1188.0, + 547.0, + 1157.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 524.0, + 1263.0, + 524.0, + 1263.0, + 547.0, + 1231.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 537.0, + 693.0, + 537.0, + 693.0, + 569.0, + 582.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 537.0, + 1155.0, + 537.0, + 1155.0, + 569.0, + 1043.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 575.0, + 833.0, + 575.0, + 833.0, + 606.0, + 408.0, + 606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 576.0, + 1293.0, + 576.0, + 1293.0, + 607.0, + 868.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 457.0, + 604.0, + 491.0, + 604.0, + 491.0, + 625.0, + 457.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 604.0, + 952.0, + 604.0, + 952.0, + 625.0, + 919.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 615.0, + 468.0, + 615.0, + 468.0, + 917.0, + 436.0, + 917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 615.0, + 546.0, + 615.0, + 546.0, + 634.0, + 530.0, + 634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 615.0, + 742.0, + 615.0, + 742.0, + 641.0, + 619.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1079.0, + 615.0, + 1204.0, + 615.0, + 1204.0, + 641.0, + 1079.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 899.0, + 616.0, + 927.0, + 616.0, + 927.0, + 916.0, + 899.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 523.0, + 626.0, + 551.0, + 626.0, + 551.0, + 707.0, + 523.0, + 707.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 640.0, + 769.0, + 640.0, + 769.0, + 669.0, + 619.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 640.0, + 1229.0, + 640.0, + 1229.0, + 669.0, + 1078.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 642.0, + 490.0, + 642.0, + 490.0, + 661.0, + 461.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 642.0, + 950.0, + 642.0, + 950.0, + 661.0, + 921.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 677.0, + 491.0, + 677.0, + 491.0, + 700.0, + 459.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 617.0, + 665.0, + 788.0, + 665.0, + 788.0, + 697.0, + 617.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 677.0, + 951.0, + 677.0, + 951.0, + 700.0, + 919.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 667.0, + 1250.0, + 667.0, + 1250.0, + 697.0, + 1077.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 459.0, + 715.0, + 490.0, + 715.0, + 490.0, + 737.0, + 459.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 537.0, + 696.0, + 564.0, + 696.0, + 564.0, + 740.0, + 537.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 691.0, + 787.0, + 691.0, + 787.0, + 726.0, + 619.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 715.0, + 951.0, + 715.0, + 951.0, + 737.0, + 920.0, + 737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 693.0, + 1247.0, + 693.0, + 1247.0, + 725.0, + 1078.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 754.0, + 489.0, + 754.0, + 489.0, + 773.0, + 461.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 754.0, + 950.0, + 754.0, + 950.0, + 773.0, + 921.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 766.0, + 1055.0, + 766.0, + 1055.0, + 773.0, + 1047.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 790.0, + 490.0, + 790.0, + 490.0, + 810.0, + 467.0, + 810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 792.0, + 949.0, + 792.0, + 949.0, + 808.0, + 929.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 826.0, + 490.0, + 826.0, + 490.0, + 847.0, + 467.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 928.0, + 827.0, + 950.0, + 827.0, + 950.0, + 847.0, + 928.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 856.0, + 993.0, + 856.0, + 993.0, + 865.0, + 986.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 863.0, + 489.0, + 863.0, + 489.0, + 884.0, + 467.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 929.0, + 865.0, + 949.0, + 865.0, + 949.0, + 881.0, + 929.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 877.0, + 549.0, + 877.0, + 549.0, + 889.0, + 536.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 900.0, + 505.0, + 900.0, + 505.0, + 930.0, + 472.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 907.0, + 579.0, + 907.0, + 579.0, + 930.0, + 547.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 908.0, + 654.0, + 908.0, + 654.0, + 930.0, + 622.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 908.0, + 727.0, + 908.0, + 727.0, + 930.0, + 696.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 907.0, + 801.0, + 907.0, + 801.0, + 930.0, + 772.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 901.0, + 965.0, + 901.0, + 965.0, + 930.0, + 934.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1008.0, + 907.0, + 1041.0, + 907.0, + 1041.0, + 930.0, + 1008.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 907.0, + 1114.0, + 907.0, + 1114.0, + 930.0, + 1083.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 907.0, + 1188.0, + 907.0, + 1188.0, + 930.0, + 1158.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 907.0, + 1263.0, + 907.0, + 1263.0, + 930.0, + 1231.0, + 930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 920.0, + 692.0, + 920.0, + 692.0, + 952.0, + 582.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 919.0, + 1153.0, + 919.0, + 1153.0, + 951.0, + 1043.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.75, + 404.0, + 1093.75, + 404.0, + 1093.75, + 427.5, + 1062.75, + 427.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 379.0, + 606.0, + 379.0, + 606.0, + 418.0, + 570.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 602.0, + 424.5, + 613.0, + 424.5, + 613.0, + 434.5, + 602.0, + 434.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 437.5, + 631.0, + 437.5, + 631.0, + 452.5, + 614.0, + 452.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1106.0, + 439.5, + 1113.0, + 439.5, + 1113.0, + 454.5, + 1106.0, + 454.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.25, + 453.5, + 1130.25, + 453.5, + 1130.25, + 464.5, + 1117.25, + 464.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.25, + 468.0, + 1024.25, + 468.0, + 1024.25, + 474.5, + 1021.25, + 474.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 483.5, + 570.0, + 483.5, + 570.0, + 488.0, + 567.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 772.0, + 622.0, + 772.0, + 622.0, + 805.5, + 567.0, + 805.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 779.0, + 1075.0, + 779.0, + 1075.0, + 796.5, + 1054.0, + 796.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 822.0, + 1133.0, + 822.0, + 1133.0, + 842.0, + 1098.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 522.0, + 862.5, + 540.0, + 862.5, + 540.0, + 878.5, + 522.0, + 878.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 996.75, + 871.0, + 1000.75, + 871.0, + 1000.75, + 878.5, + 996.75, + 878.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 880.0, + 1014.0, + 880.0, + 1014.0, + 888.0, + 1010.0, + 888.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1943.0, + 1077.0, + 1943.0, + 1077.0, + 1985.0, + 326.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 1943.0, + 1406.0, + 1943.0, + 1406.0, + 1985.0, + 1185.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1976.0, + 821.0, + 1976.0, + 821.0, + 2009.0, + 295.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 908.0, + 1976.0, + 920.0, + 1976.0, + 920.0, + 2009.0, + 908.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1976.0, + 1404.0, + 1976.0, + 1404.0, + 2009.0, + 1037.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2005.0, + 1127.0, + 2005.0, + 1127.0, + 2037.0, + 292.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1604.0, + 1164.0, + 1604.0, + 1164.0, + 1815.0, + 1131.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1154.0, + 1607.0, + 1184.0, + 1607.0, + 1184.0, + 1632.0, + 1154.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1653.0, + 1185.0, + 1653.0, + 1185.0, + 1677.0, + 1156.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1699.0, + 1184.0, + 1699.0, + 1184.0, + 1724.0, + 1153.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 1748.0, + 1184.0, + 1748.0, + 1184.0, + 1771.0, + 1155.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1793.0, + 1184.0, + 1793.0, + 1184.0, + 1817.0, + 1153.0, + 1817.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1209.0, + 1811.0, + 1241.0, + 1811.0, + 1241.0, + 1834.0, + 1209.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.0, + 1811.0, + 1308.0, + 1811.0, + 1308.0, + 1834.0, + 1275.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1810.0, + 1376.0, + 1810.0, + 1376.0, + 1836.0, + 1340.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 1822.0, + 1406.0, + 1822.0, + 1406.0, + 1860.0, + 1176.0, + 1860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 1857.0, + 1400.0, + 1857.0, + 1400.0, + 1891.0, + 1140.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 1886.0, + 1347.0, + 1886.0, + 1347.0, + 1917.0, + 1192.0, + 1917.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": [ + 303.0, + 990.0, + 1399.0, + 990.0, + 1399.0, + 1033.0, + 303.0, + 1033.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": [ + 296.0, + 1535.0, + 707.0, + 1535.0, + 707.0, + 1571.0, + 296.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 958.0, + 1305.0, + 958.0, + 1305.0, + 991.0, + 394.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1043.0, + 323.0, + 1043.0, + 323.0, + 1077.0, + 294.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 1043.0, + 462.0, + 1043.0, + 462.0, + 1077.0, + 414.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.0, + 1043.0, + 547.0, + 1043.0, + 547.0, + 1077.0, + 519.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 1043.0, + 1402.0, + 1043.0, + 1402.0, + 1077.0, + 638.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1072.0, + 1406.0, + 1072.0, + 1406.0, + 1107.0, + 293.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1101.0, + 1357.0, + 1101.0, + 1357.0, + 1138.0, + 292.0, + 1138.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": [ + 394.0, + 958.0, + 1306.0, + 958.0, + 1306.0, + 991.0, + 394.0, + 991.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1665.0, + 1116.0, + 1665.0, + 1116.0, + 1701.0, + 294.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1696.0, + 1115.0, + 1696.0, + 1115.0, + 1730.0, + 294.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1728.0, + 1114.0, + 1728.0, + 1114.0, + 1760.0, + 294.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1756.0, + 1116.0, + 1756.0, + 1116.0, + 1793.0, + 293.0, + 1793.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1788.0, + 1114.0, + 1788.0, + 1114.0, + 1823.0, + 291.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1815.0, + 1115.0, + 1815.0, + 1115.0, + 1855.0, + 292.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1848.0, + 1113.0, + 1848.0, + 1113.0, + 1884.0, + 294.0, + 1884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1880.0, + 694.0, + 1880.0, + 694.0, + 1914.0, + 295.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1426.0, + 1405.0, + 1426.0, + 1405.0, + 1464.0, + 294.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1459.0, + 1404.0, + 1459.0, + 1404.0, + 1493.0, + 294.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1488.0, + 1325.0, + 1488.0, + 1325.0, + 1525.0, + 294.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1320.0, + 1404.0, + 1320.0, + 1404.0, + 1354.0, + 296.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1351.0, + 1405.0, + 1351.0, + 1405.0, + 1385.0, + 296.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1382.0, + 538.0, + 1382.0, + 538.0, + 1413.0, + 293.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1150.0, + 1404.0, + 1150.0, + 1404.0, + 1185.0, + 295.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1181.0, + 1405.0, + 1181.0, + 1405.0, + 1215.0, + 295.0, + 1215.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1210.0, + 1406.0, + 1210.0, + 1406.0, + 1249.0, + 293.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1241.0, + 1405.0, + 1241.0, + 1405.0, + 1277.0, + 293.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1274.0, + 747.0, + 1274.0, + 747.0, + 1307.0, + 297.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1579.0, + 1117.0, + 1579.0, + 1117.0, + 1619.0, + 293.0, + 1619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1616.0, + 543.0, + 1616.0, + 543.0, + 1648.0, + 297.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1043.0, + 323.0, + 1043.0, + 323.0, + 1077.0, + 294.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 1043.0, + 462.0, + 1043.0, + 462.0, + 1077.0, + 414.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 519.0, + 1043.0, + 547.0, + 1043.0, + 547.0, + 1077.0, + 519.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 1043.0, + 1402.0, + 1043.0, + 1402.0, + 1077.0, + 638.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1072.0, + 1406.0, + 1072.0, + 1406.0, + 1107.0, + 293.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1101.0, + 1357.0, + 1101.0, + 1357.0, + 1138.0, + 292.0, + 1138.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1535.0, + 707.0, + 1535.0, + 707.0, + 1571.0, + 296.0, + 1571.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 833, + 1404, + 833, + 1404, + 1048, + 297, + 1048 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 603, + 1404, + 603, + 1404, + 819, + 297, + 819 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 1562, + 834, + 1562, + 834, + 1928, + 299, + 1928 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1344, + 1404, + 1344, + 1404, + 1498, + 298, + 1498 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 1177, + 1403, + 1177, + 1403, + 1331, + 298, + 1331 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 295, + 221, + 1403, + 221, + 1403, + 550, + 295, + 550 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 298, + 1070, + 1403, + 1070, + 1403, + 1160, + 298, + 1160 + ], + "score": 0.969 + }, + { + "category_id": 3, + "poly": [ + 855, + 1571, + 1401, + 1571, + 1401, + 1894, + 855, + 1894 + ], + "score": 0.96 + }, + { + "category_id": 2, + "poly": [ + 297, + 1976, + 1406, + 1976, + 1406, + 2034, + 297, + 2034 + ], + "score": 0.934 + }, + { + "category_id": 0, + "poly": [ + 304, + 1514, + 801, + 1514, + 801, + 1545, + 304, + 1545 + ], + "score": 0.907 + }, + { + "category_id": 4, + "poly": [ + 868, + 1902, + 1391, + 1902, + 1391, + 1935, + 868, + 1935 + ], + "score": 0.898 + }, + { + "category_id": 4, + "poly": [ + 292, + 555, + 1397, + 555, + 1397, + 587, + 292, + 587 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 815, + 76, + 815, + 104, + 299, + 104 + ], + "score": 0.883 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2112, + 840, + 2112 + ], + "score": 0.8 + }, + { + "category_id": 13, + "poly": [ + 1078, + 1208, + 1132, + 1208, + 1132, + 1236, + 1078, + 1236 + ], + "score": 0.87, + "latex": "52 \\%" + }, + { + "category_id": 13, + "poly": [ + 865, + 1208, + 917, + 1208, + 917, + 1237, + 865, + 1237 + ], + "score": 0.86, + "latex": "18 \\%" + }, + { + "category_id": 13, + "poly": [ + 296, + 1268, + 352, + 1268, + 352, + 1298, + 296, + 1298 + ], + "score": 0.86, + "latex": "71 \\%" + }, + { + "category_id": 13, + "poly": [ + 1174, + 1238, + 1229, + 1238, + 1229, + 1267, + 1174, + 1267 + ], + "score": 0.85, + "latex": "24 \\%" + }, + { + "category_id": 13, + "poly": [ + 424, + 1684, + 465, + 1684, + 465, + 1713, + 424, + 1713 + ], + "score": 0.83, + "latex": "1 \\%" + }, + { + "category_id": 13, + "poly": [ + 1161, + 1208, + 1245, + 1208, + 1245, + 1236, + 1161, + 1236 + ], + "score": 0.49, + "latex": "1 . 0 \\mathrm { M B }" + }, + { + "category_id": 13, + "poly": [ + 1262, + 1238, + 1352, + 1238, + 1352, + 1267, + 1262, + 1267 + ], + "score": 0.46, + "latex": "0 . 5 \\mathrm { \\bf M B }" + }, + { + "category_id": 13, + "poly": [ + 945, + 1208, + 1031, + 1208, + 1031, + 1237, + 945, + 1237 + ], + "score": 0.43, + "latex": "0 . 5 \\mathrm { M B }" + }, + { + "category_id": 13, + "poly": [ + 385, + 1268, + 474, + 1268, + 474, + 1298, + 385, + 1298 + ], + "score": 0.33, + "latex": "1 . 0 \\mathrm { { M B } }" + }, + { + "category_id": 13, + "poly": [ + 1010, + 984, + 1084, + 984, + 1084, + 1015, + 1010, + 1015 + ], + "score": 0.33, + "latex": "{ \\mathsf { R N N } } ^ { 6 }" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 205.0, + 1191.0, + 205.0, + 1191.0, + 478.0, + 1117.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 206.0, + 911.0, + 206.0, + 911.0, + 473.0, + 841.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 277.0, + 212.0, + 348.0, + 212.0, + 348.0, + 476.0, + 277.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 225.0, + 332.0, + 225.0, + 332.0, + 238.0, + 312.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 225.0, + 600.0, + 225.0, + 600.0, + 460.0, + 572.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 225.0, + 612.0, + 225.0, + 612.0, + 238.0, + 590.0, + 238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.0, + 228.0, + 782.0, + 228.0, + 782.0, + 253.0, + 707.0, + 253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 228.0, + 1081.0, + 228.0, + 1081.0, + 253.0, + 985.0, + 253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1267.0, + 228.0, + 1361.0, + 228.0, + 1361.0, + 253.0, + 1267.0, + 253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 230.0, + 369.0, + 230.0, + 369.0, + 269.0, + 342.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 230.0, + 503.0, + 230.0, + 503.0, + 253.0, + 426.0, + 253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 975.0, + 236.0, + 987.0, + 236.0, + 987.0, + 245.0, + 975.0, + 245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 249.0, + 333.0, + 249.0, + 333.0, + 267.0, + 310.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 430.0, + 249.0, + 544.0, + 249.0, + 544.0, + 272.0, + 430.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 249.0, + 612.0, + 249.0, + 612.0, + 269.0, + 590.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 707.0, + 248.0, + 826.0, + 248.0, + 826.0, + 275.0, + 707.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 248.0, + 1103.0, + 248.0, + 1103.0, + 275.0, + 986.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 249.0, + 1174.0, + 249.0, + 1174.0, + 269.0, + 1148.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1271.0, + 248.0, + 1383.0, + 248.0, + 1383.0, + 275.0, + 1271.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 265.0, + 560.0, + 265.0, + 560.0, + 294.0, + 429.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 276.0, + 612.0, + 276.0, + 612.0, + 297.0, + 590.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 262.0, + 646.0, + 262.0, + 646.0, + 276.0, + 638.0, + 276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 265.0, + 838.0, + 265.0, + 838.0, + 294.0, + 706.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 987.0, + 267.0, + 1117.0, + 267.0, + 1117.0, + 294.0, + 987.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 265.0, + 1397.0, + 265.0, + 1397.0, + 294.0, + 1268.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 430.0, + 287.0, + 558.0, + 287.0, + 558.0, + 314.0, + 430.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 289.0, + 836.0, + 289.0, + 836.0, + 312.0, + 709.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 989.0, + 288.0, + 1113.0, + 288.0, + 1113.0, + 312.0, + 989.0, + 312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 287.0, + 1395.0, + 287.0, + 1395.0, + 314.0, + 1269.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 306.0, + 332.0, + 306.0, + 332.0, + 321.0, + 312.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 306.0, + 610.0, + 306.0, + 610.0, + 321.0, + 590.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 304.0, + 893.0, + 304.0, + 893.0, + 325.0, + 869.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 303.0, + 1172.0, + 303.0, + 1172.0, + 323.0, + 1150.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 316.0, + 1187.0, + 316.0, + 1187.0, + 327.0, + 1177.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 332.0, + 333.0, + 332.0, + 333.0, + 351.0, + 312.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 332.0, + 612.0, + 332.0, + 612.0, + 351.0, + 591.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 332.0, + 892.0, + 332.0, + 892.0, + 351.0, + 870.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1150.0, + 332.0, + 1174.0, + 332.0, + 1174.0, + 351.0, + 1150.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 360.0, + 612.0, + 360.0, + 612.0, + 379.0, + 589.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 389.0, + 332.0, + 389.0, + 332.0, + 404.0, + 314.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 388.0, + 611.0, + 388.0, + 611.0, + 404.0, + 594.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 385.0, + 893.0, + 385.0, + 893.0, + 405.0, + 872.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 387.0, + 1174.0, + 387.0, + 1174.0, + 405.0, + 1151.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 310.0, + 415.0, + 333.0, + 415.0, + 333.0, + 434.0, + 310.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 529.0, + 417.0, + 553.0, + 417.0, + 553.0, + 429.0, + 529.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 415.0, + 612.0, + 415.0, + 612.0, + 434.0, + 591.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 415.0, + 892.0, + 415.0, + 892.0, + 434.0, + 872.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 415.0, + 1174.0, + 415.0, + 1174.0, + 434.0, + 1151.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 448.0, + 368.0, + 448.0, + 368.0, + 467.0, + 342.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 449.0, + 407.0, + 449.0, + 407.0, + 467.0, + 381.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 449.0, + 448.0, + 449.0, + 448.0, + 467.0, + 421.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 449.0, + 487.0, + 449.0, + 487.0, + 466.0, + 461.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 448.0, + 528.0, + 448.0, + 528.0, + 467.0, + 502.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 543.0, + 450.0, + 563.0, + 450.0, + 563.0, + 465.0, + 543.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 442.0, + 614.0, + 442.0, + 614.0, + 461.0, + 589.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 621.0, + 449.0, + 649.0, + 449.0, + 649.0, + 467.0, + 621.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 449.0, + 687.0, + 449.0, + 687.0, + 467.0, + 660.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 449.0, + 728.0, + 449.0, + 728.0, + 466.0, + 701.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 450.0, + 765.0, + 450.0, + 765.0, + 465.0, + 743.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 449.0, + 807.0, + 449.0, + 807.0, + 467.0, + 782.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 450.0, + 843.0, + 450.0, + 843.0, + 465.0, + 821.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 442.0, + 893.0, + 442.0, + 893.0, + 461.0, + 869.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 448.0, + 928.0, + 448.0, + 928.0, + 466.0, + 902.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 449.0, + 966.0, + 449.0, + 966.0, + 466.0, + 941.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 449.0, + 1006.0, + 449.0, + 1006.0, + 466.0, + 981.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 450.0, + 1044.0, + 450.0, + 1044.0, + 465.0, + 1023.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 449.0, + 1088.0, + 449.0, + 1088.0, + 467.0, + 1062.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.0, + 450.0, + 1123.0, + 450.0, + 1123.0, + 465.0, + 1102.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 449.0, + 1208.0, + 449.0, + 1208.0, + 467.0, + 1181.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 449.0, + 1247.0, + 449.0, + 1247.0, + 467.0, + 1220.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 449.0, + 1287.0, + 449.0, + 1287.0, + 466.0, + 1262.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1301.0, + 449.0, + 1326.0, + 449.0, + 1326.0, + 466.0, + 1301.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1342.0, + 449.0, + 1366.0, + 449.0, + 1366.0, + 467.0, + 1342.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1383.0, + 450.0, + 1404.0, + 450.0, + 1404.0, + 465.0, + 1383.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 459.0, + 484.0, + 459.0, + 484.0, + 483.0, + 400.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 459.0, + 765.0, + 459.0, + 765.0, + 483.0, + 680.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 459.0, + 1045.0, + 459.0, + 1045.0, + 483.0, + 960.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 459.0, + 1325.0, + 459.0, + 1325.0, + 483.0, + 1239.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 489.0, + 554.0, + 489.0, + 554.0, + 523.0, + 308.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 489.0, + 1405.0, + 489.0, + 1405.0, + 523.0, + 587.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 513.0, + 500.0, + 513.0, + 500.0, + 553.0, + 360.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 640.0, + 513.0, + 780.0, + 513.0, + 780.0, + 553.0, + 640.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 513.0, + 1060.0, + 513.0, + 1060.0, + 553.0, + 919.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 513.0, + 1340.0, + 513.0, + 1340.0, + 554.0, + 1200.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 450.0, + 386.5, + 466.0, + 386.5, + 466.0, + 401.5, + 450.0, + 401.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 872.0, + 1571.0, + 906.0, + 1571.0, + 906.0, + 1597.0, + 872.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1573.0, + 1184.0, + 1573.0, + 1184.0, + 1596.0, + 1152.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 1604.0, + 886.0, + 1604.0, + 886.0, + 1764.0, + 850.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 1604.0, + 1087.0, + 1604.0, + 1087.0, + 1615.0, + 1078.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 1607.0, + 1162.0, + 1607.0, + 1162.0, + 1763.0, + 1130.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1069.0, + 1609.0, + 1081.0, + 1609.0, + 1081.0, + 1627.0, + 1069.0, + 1627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 1613.0, + 903.0, + 1613.0, + 903.0, + 1637.0, + 873.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1614.0, + 1181.0, + 1614.0, + 1181.0, + 1636.0, + 1152.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 1624.0, + 1348.0, + 1624.0, + 1348.0, + 1632.0, + 1340.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.0, + 1638.0, + 1333.0, + 1638.0, + 1333.0, + 1650.0, + 1321.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1652.0, + 904.0, + 1652.0, + 904.0, + 1679.0, + 871.0, + 1679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1650.0, + 1042.0, + 1650.0, + 1042.0, + 1658.0, + 1035.0, + 1658.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1654.0, + 1181.0, + 1654.0, + 1181.0, + 1677.0, + 1152.0, + 1677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1649.0, + 1324.0, + 1649.0, + 1324.0, + 1666.0, + 1305.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1017.0, + 1666.0, + 1025.0, + 1666.0, + 1025.0, + 1676.0, + 1017.0, + 1676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 1675.0, + 1296.0, + 1675.0, + 1296.0, + 1685.0, + 1286.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1693.0, + 904.0, + 1693.0, + 904.0, + 1719.0, + 871.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 1693.0, + 999.0, + 1693.0, + 999.0, + 1701.0, + 990.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1702.0, + 990.0, + 1702.0, + 990.0, + 1710.0, + 983.0, + 1710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1697.0, + 1181.0, + 1697.0, + 1181.0, + 1716.0, + 1153.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 1702.0, + 1269.0, + 1702.0, + 1269.0, + 1710.0, + 1261.0, + 1710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 1710.0, + 982.0, + 1710.0, + 982.0, + 1719.0, + 973.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 963.0, + 1719.0, + 973.0, + 1719.0, + 973.0, + 1728.0, + 963.0, + 1728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 1736.0, + 903.0, + 1736.0, + 903.0, + 1759.0, + 873.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1736.0, + 1180.0, + 1736.0, + 1180.0, + 1759.0, + 1152.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1736.0, + 1236.0, + 1736.0, + 1236.0, + 1748.0, + 1224.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 1747.0, + 944.0, + 1747.0, + 944.0, + 1755.0, + 936.0, + 1755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 1754.0, + 937.0, + 1754.0, + 937.0, + 1763.0, + 930.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1751.0, + 1098.0, + 1751.0, + 1098.0, + 1780.0, + 983.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1210.0, + 1756.0, + 1215.0, + 1756.0, + 1215.0, + 1761.0, + 1210.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 1751.0, + 1378.0, + 1751.0, + 1378.0, + 1780.0, + 1261.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 1770.0, + 928.0, + 1770.0, + 928.0, + 1816.0, + 867.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 1778.0, + 1191.0, + 1778.0, + 1191.0, + 1790.0, + 1177.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 933.0, + 1787.0, + 974.0, + 1787.0, + 974.0, + 1809.0, + 933.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1786.0, + 1025.0, + 1786.0, + 1025.0, + 1808.0, + 983.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 1785.0, + 1080.0, + 1785.0, + 1080.0, + 1811.0, + 1036.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 1785.0, + 1127.0, + 1785.0, + 1127.0, + 1811.0, + 1088.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 1787.0, + 1253.0, + 1787.0, + 1253.0, + 1809.0, + 1213.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 1785.0, + 1305.0, + 1785.0, + 1305.0, + 1810.0, + 1263.0, + 1810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1315.0, + 1785.0, + 1357.0, + 1785.0, + 1357.0, + 1811.0, + 1315.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1367.0, + 1787.0, + 1407.0, + 1787.0, + 1407.0, + 1811.0, + 1367.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 920.0, + 1799.0, + 1087.0, + 1799.0, + 1087.0, + 1828.0, + 920.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 1799.0, + 1366.0, + 1799.0, + 1366.0, + 1828.0, + 1200.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 1837.0, + 1084.0, + 1837.0, + 1084.0, + 1868.0, + 897.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1831.0, + 1360.0, + 1831.0, + 1360.0, + 1875.0, + 1179.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 1863.0, + 1078.0, + 1863.0, + 1078.0, + 1897.0, + 903.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 1860.0, + 1342.0, + 1860.0, + 1342.0, + 1902.0, + 1198.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1625.0, + 1073.0, + 1625.0, + 1073.0, + 1631.5, + 1054.0, + 1631.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1636.0, + 1064.0, + 1636.0, + 1064.0, + 1645.0, + 1039.0, + 1645.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1290.0, + 1667.5, + 1306.0, + 1667.5, + 1306.0, + 1675.5, + 1290.0, + 1675.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 1684.0, + 1013.0, + 1684.0, + 1013.0, + 1691.0, + 995.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 1693.0, + 1282.0, + 1693.0, + 1282.0, + 1700.0, + 1266.0, + 1700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.75, + 1708.5, + 1257.75, + 1708.5, + 1257.75, + 1719.0, + 1253.75, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 940.0, + 1732.5, + 968.0, + 1732.5, + 968.0, + 1741.0, + 940.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 1775.0, + 1190.0, + 1775.0, + 1190.0, + 1812.0, + 1161.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1970.0, + 1404.0, + 1970.0, + 1404.0, + 2012.0, + 329.0, + 2012.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2004.0, + 514.0, + 2004.0, + 514.0, + 2035.0, + 296.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1512.0, + 804.0, + 1512.0, + 804.0, + 1549.0, + 296.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1900.0, + 1393.0, + 1900.0, + 1393.0, + 1936.0, + 865.0, + 1936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 548.0, + 1403.0, + 548.0, + 1403.0, + 594.0, + 293.0, + 594.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": [ + 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, + 833.0, + 1405.0, + 833.0, + 1405.0, + 868.0, + 295.0, + 868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 864.0, + 1406.0, + 864.0, + 1406.0, + 896.0, + 292.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 891.0, + 1409.0, + 891.0, + 1409.0, + 931.0, + 292.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 925.0, + 1406.0, + 925.0, + 1406.0, + 959.0, + 295.0, + 959.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 952.0, + 1406.0, + 952.0, + 1406.0, + 992.0, + 292.0, + 992.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 984.0, + 1009.0, + 984.0, + 1009.0, + 1018.0, + 295.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 984.0, + 1404.0, + 984.0, + 1404.0, + 1018.0, + 1085.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1016.0, + 1405.0, + 1016.0, + 1405.0, + 1054.0, + 294.0, + 1054.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 600.0, + 1405.0, + 600.0, + 1405.0, + 639.0, + 292.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 632.0, + 1405.0, + 632.0, + 1405.0, + 672.0, + 292.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 662.0, + 1405.0, + 662.0, + 1405.0, + 701.0, + 292.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 692.0, + 1407.0, + 692.0, + 1407.0, + 732.0, + 292.0, + 732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 726.0, + 1406.0, + 726.0, + 1406.0, + 760.0, + 292.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 758.0, + 1405.0, + 758.0, + 1405.0, + 789.0, + 296.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 785.0, + 1337.0, + 785.0, + 1337.0, + 822.0, + 294.0, + 822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1561.0, + 836.0, + 1561.0, + 836.0, + 1594.0, + 297.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1592.0, + 836.0, + 1592.0, + 836.0, + 1625.0, + 295.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1621.0, + 837.0, + 1621.0, + 837.0, + 1656.0, + 295.0, + 1656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1652.0, + 836.0, + 1652.0, + 836.0, + 1688.0, + 295.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1681.0, + 423.0, + 1681.0, + 423.0, + 1717.0, + 293.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 466.0, + 1681.0, + 837.0, + 1681.0, + 837.0, + 1717.0, + 466.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1711.0, + 837.0, + 1711.0, + 837.0, + 1746.0, + 293.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1743.0, + 837.0, + 1743.0, + 837.0, + 1776.0, + 295.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1772.0, + 836.0, + 1772.0, + 836.0, + 1808.0, + 294.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1804.0, + 837.0, + 1804.0, + 837.0, + 1837.0, + 296.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1835.0, + 836.0, + 1835.0, + 836.0, + 1867.0, + 295.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1865.0, + 836.0, + 1865.0, + 836.0, + 1900.0, + 295.0, + 1900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1896.0, + 781.0, + 1896.0, + 781.0, + 1929.0, + 295.0, + 1929.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": [ + 296.0, + 1377.0, + 1404.0, + 1377.0, + 1404.0, + 1410.0, + 296.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1406.0, + 1406.0, + 1406.0, + 1406.0, + 1442.0, + 293.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1436.0, + 1406.0, + 1436.0, + 1406.0, + 1475.0, + 292.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1464.0, + 429.0, + 1464.0, + 429.0, + 1502.0, + 294.0, + 1502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1177.0, + 1404.0, + 1177.0, + 1404.0, + 1210.0, + 296.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1205.0, + 864.0, + 1205.0, + 864.0, + 1243.0, + 292.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1205.0, + 944.0, + 1205.0, + 944.0, + 1243.0, + 918.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 1205.0, + 1077.0, + 1205.0, + 1077.0, + 1243.0, + 1032.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1205.0, + 1160.0, + 1205.0, + 1160.0, + 1243.0, + 1133.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 1205.0, + 1403.0, + 1205.0, + 1403.0, + 1243.0, + 1246.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1234.0, + 1173.0, + 1234.0, + 1173.0, + 1273.0, + 292.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 1234.0, + 1261.0, + 1234.0, + 1261.0, + 1273.0, + 1230.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 1234.0, + 1407.0, + 1234.0, + 1407.0, + 1273.0, + 1353.0, + 1273.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1265.0, + 295.0, + 1265.0, + 295.0, + 1303.0, + 292.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 353.0, + 1265.0, + 384.0, + 1265.0, + 384.0, + 1303.0, + 353.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 475.0, + 1265.0, + 1405.0, + 1265.0, + 1405.0, + 1303.0, + 475.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1298.0, + 1405.0, + 1298.0, + 1405.0, + 1335.0, + 294.0, + 1335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1068.0, + 1404.0, + 1068.0, + 1404.0, + 1104.0, + 293.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1100.0, + 1404.0, + 1100.0, + 1404.0, + 1133.0, + 294.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1130.0, + 1385.0, + 1130.0, + 1385.0, + 1164.0, + 294.0, + 1164.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 478, + 1405, + 478, + 1405, + 786, + 297, + 786 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1286, + 1405, + 1286, + 1405, + 1500, + 297, + 1500 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 279, + 1403, + 279, + 1403, + 464, + 297, + 464 + ], + "score": 0.978 + }, + { + "category_id": 3, + "poly": [ + 345, + 1521, + 1361, + 1521, + 1361, + 1922, + 345, + 1922 + ], + "score": 0.971 + }, + { + "category_id": 3, + "poly": [ + 345, + 808, + 1361, + 808, + 1361, + 1197, + 345, + 1197 + ], + "score": 0.965 + }, + { + "category_id": 4, + "poly": [ + 296, + 1211, + 1398, + 1211, + 1398, + 1273, + 296, + 1273 + ], + "score": 0.943 + }, + { + "category_id": 4, + "poly": [ + 294, + 1935, + 1401, + 1935, + 1401, + 1999, + 294, + 1999 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 816, + 76, + 816, + 104, + 299, + 104 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.795 + }, + { + "category_id": 0, + "poly": [ + 297, + 226, + 853, + 226, + 853, + 262, + 297, + 262 + ], + "score": 0.733 + }, + { + "category_id": 0, + "poly": [ + 298, + 226, + 853, + 226, + 853, + 262, + 298, + 262 + ], + "score": 0.254 + }, + { + "category_id": 13, + "poly": [ + 1329, + 372, + 1370, + 372, + 1370, + 401, + 1329, + 401 + ], + "score": 0.83, + "latex": "1 \\%" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 1519.0, + 1331.0, + 1519.0, + 1331.0, + 1552.0, + 1295.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 1531.0, + 837.0, + 1531.0, + 837.0, + 1843.0, + 800.0, + 1843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 1543.0, + 807.0, + 1543.0, + 807.0, + 1816.0, + 778.0, + 1816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1544.0, + 396.0, + 1544.0, + 396.0, + 1583.0, + 355.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 1547.0, + 923.0, + 1547.0, + 923.0, + 1593.0, + 881.0, + 1593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 1569.0, + 1332.0, + 1569.0, + 1332.0, + 1608.0, + 1294.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 355.0, + 1594.0, + 397.0, + 1594.0, + 397.0, + 1631.0, + 355.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 1593.0, + 924.0, + 1593.0, + 924.0, + 1641.0, + 881.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1646.0, + 396.0, + 1646.0, + 396.0, + 1681.0, + 369.0, + 1681.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 1643.0, + 927.0, + 1643.0, + 927.0, + 1682.0, + 894.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 1614.0, + 1360.0, + 1614.0, + 1360.0, + 1755.0, + 1289.0, + 1755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 1690.0, + 398.0, + 1690.0, + 398.0, + 1730.0, + 340.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 1690.0, + 925.0, + 1690.0, + 925.0, + 1731.0, + 869.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 1740.0, + 400.0, + 1740.0, + 400.0, + 1779.0, + 340.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 1737.0, + 926.0, + 1737.0, + 926.0, + 1782.0, + 867.0, + 1782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 1729.0, + 1332.0, + 1729.0, + 1332.0, + 1762.0, + 1296.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 340.0, + 1789.0, + 400.0, + 1789.0, + 400.0, + 1827.0, + 340.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 423.0, + 1796.0, + 435.0, + 1796.0, + 435.0, + 1805.0, + 423.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1782.0, + 509.0, + 1782.0, + 509.0, + 1815.0, + 448.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 1789.0, + 923.0, + 1789.0, + 923.0, + 1824.0, + 869.0, + 1824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 1791.0, + 961.0, + 1791.0, + 961.0, + 1807.0, + 947.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 1783.0, + 1033.0, + 1783.0, + 1033.0, + 1812.0, + 973.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 1785.0, + 1318.0, + 1785.0, + 1318.0, + 1813.0, + 1296.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 1817.0, + 437.0, + 1817.0, + 437.0, + 1830.0, + 422.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 1805.0, + 503.0, + 1805.0, + 503.0, + 1838.0, + 446.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 1812.0, + 961.0, + 1812.0, + 961.0, + 1826.0, + 946.0, + 1826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 971.0, + 1800.0, + 1028.0, + 1800.0, + 1028.0, + 1839.0, + 971.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 1836.0, + 735.0, + 1836.0, + 735.0, + 1889.0, + 435.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1834.0, + 797.0, + 1834.0, + 797.0, + 1849.0, + 784.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 1842.0, + 1019.0, + 1842.0, + 1019.0, + 1877.0, + 967.0, + 1877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 1842.0, + 1102.0, + 1842.0, + 1102.0, + 1878.0, + 1027.0, + 1878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 1842.0, + 1178.0, + 1842.0, + 1178.0, + 1878.0, + 1103.0, + 1878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 1844.0, + 1246.0, + 1844.0, + 1246.0, + 1877.0, + 1206.0, + 1877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 356.0, + 1886.0, + 815.0, + 1886.0, + 815.0, + 1931.0, + 356.0, + 1931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 1885.0, + 1256.0, + 1885.0, + 1256.0, + 1924.0, + 968.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 812.0, + 804.0, + 812.0, + 804.0, + 846.0, + 768.0, + 846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1282.0, + 829.0, + 1334.0, + 829.0, + 1334.0, + 870.0, + 1282.0, + 870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 834.0, + 1364.0, + 834.0, + 1364.0, + 1098.0, + 1327.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 800.0, + 839.0, + 837.0, + 839.0, + 837.0, + 1093.0, + 800.0, + 1093.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 860.0, + 1335.0, + 860.0, + 1335.0, + 906.0, + 1281.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 864.0, + 393.0, + 864.0, + 393.0, + 891.0, + 358.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 864.0, + 920.0, + 864.0, + 920.0, + 896.0, + 882.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 871.0, + 794.0, + 871.0, + 794.0, + 906.0, + 768.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1282.0, + 893.0, + 1335.0, + 893.0, + 1335.0, + 939.0, + 1282.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 933.0, + 394.0, + 933.0, + 394.0, + 960.0, + 369.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 930.0, + 794.0, + 930.0, + 794.0, + 963.0, + 768.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 934.0, + 919.0, + 934.0, + 919.0, + 961.0, + 895.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 932.0, + 1333.0, + 932.0, + 1333.0, + 968.0, + 1285.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 965.0, + 1333.0, + 965.0, + 1333.0, + 1000.0, + 1284.0, + 1000.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 342.0, + 995.0, + 398.0, + 995.0, + 398.0, + 1033.0, + 342.0, + 1033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 991.0, + 793.0, + 991.0, + 793.0, + 1018.0, + 768.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 997.0, + 923.0, + 997.0, + 923.0, + 1031.0, + 869.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 999.0, + 1324.0, + 999.0, + 1324.0, + 1037.0, + 1284.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 1048.0, + 791.0, + 1048.0, + 791.0, + 1074.0, + 768.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1034.0, + 1321.0, + 1034.0, + 1321.0, + 1067.0, + 1284.0, + 1067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 345.0, + 1067.0, + 396.0, + 1067.0, + 396.0, + 1100.0, + 345.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 1075.0, + 646.0, + 1075.0, + 646.0, + 1084.0, + 637.0, + 1084.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1065.0, + 719.0, + 1065.0, + 719.0, + 1092.0, + 659.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 1065.0, + 920.0, + 1065.0, + 920.0, + 1095.0, + 873.0, + 1095.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 1064.0, + 1237.0, + 1064.0, + 1237.0, + 1088.0, + 1181.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1068.0, + 1321.0, + 1068.0, + 1321.0, + 1100.0, + 1284.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 1085.0, + 712.0, + 1085.0, + 712.0, + 1114.0, + 657.0, + 1114.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 1085.0, + 1070.0, + 1085.0, + 1070.0, + 1098.0, + 1051.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 1082.0, + 1231.0, + 1082.0, + 1231.0, + 1112.0, + 1177.0, + 1112.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 1091.0, + 652.0, + 1091.0, + 652.0, + 1108.0, + 631.0, + 1108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1093.0, + 1167.0, + 1093.0, + 1167.0, + 1102.0, + 1153.0, + 1102.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 379.0, + 1119.0, + 718.0, + 1119.0, + 718.0, + 1160.0, + 379.0, + 1160.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1113.0, + 786.0, + 1113.0, + 786.0, + 1126.0, + 776.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 1115.0, + 1111.0, + 1115.0, + 1111.0, + 1157.0, + 906.0, + 1157.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1112.0, + 1118.0, + 1232.0, + 1118.0, + 1232.0, + 1154.0, + 1112.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 1166.0, + 791.0, + 1166.0, + 791.0, + 1202.0, + 382.0, + 1202.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 1162.0, + 1345.0, + 1162.0, + 1345.0, + 1200.0, + 882.0, + 1200.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.75, + 1066.5, + 456.75, + 1066.5, + 456.75, + 1085.5, + 421.75, + 1085.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 521.0, + 1080.5, + 551.0, + 1080.5, + 551.0, + 1103.0, + 521.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1210.0, + 1404.0, + 1210.0, + 1404.0, + 1246.0, + 295.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1243.0, + 945.0, + 1243.0, + 945.0, + 1275.0, + 296.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1932.0, + 1403.0, + 1932.0, + 1403.0, + 1971.0, + 294.0, + 1971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1963.0, + 941.0, + 1963.0, + 941.0, + 2003.0, + 294.0, + 2003.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": [ + 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, + 222.0, + 857.0, + 222.0, + 857.0, + 267.0, + 295.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 222.0, + 857.0, + 222.0, + 857.0, + 267.0, + 295.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 480.0, + 1403.0, + 480.0, + 1403.0, + 512.0, + 296.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 510.0, + 1406.0, + 510.0, + 1406.0, + 545.0, + 292.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 540.0, + 1405.0, + 540.0, + 1405.0, + 575.0, + 292.0, + 575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 572.0, + 1403.0, + 572.0, + 1403.0, + 604.0, + 295.0, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 599.0, + 1405.0, + 599.0, + 1405.0, + 636.0, + 292.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 629.0, + 1406.0, + 629.0, + 1406.0, + 666.0, + 294.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 663.0, + 1406.0, + 663.0, + 1406.0, + 698.0, + 295.0, + 698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 692.0, + 1405.0, + 692.0, + 1405.0, + 728.0, + 294.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 719.0, + 1408.0, + 719.0, + 1408.0, + 761.0, + 290.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 752.0, + 1051.0, + 752.0, + 1051.0, + 790.0, + 294.0, + 790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1286.0, + 1405.0, + 1286.0, + 1405.0, + 1321.0, + 296.0, + 1321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1318.0, + 1405.0, + 1318.0, + 1405.0, + 1353.0, + 295.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1348.0, + 1403.0, + 1348.0, + 1403.0, + 1382.0, + 295.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1378.0, + 1403.0, + 1378.0, + 1403.0, + 1413.0, + 294.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1409.0, + 1405.0, + 1409.0, + 1405.0, + 1443.0, + 295.0, + 1443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1437.0, + 1406.0, + 1437.0, + 1406.0, + 1474.0, + 292.0, + 1474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1469.0, + 1201.0, + 1469.0, + 1201.0, + 1503.0, + 295.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 281.0, + 1404.0, + 281.0, + 1404.0, + 313.0, + 295.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 312.0, + 1403.0, + 312.0, + 1403.0, + 344.0, + 295.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 336.0, + 1407.0, + 336.0, + 1407.0, + 380.0, + 292.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 369.0, + 1328.0, + 369.0, + 1328.0, + 406.0, + 294.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1371.0, + 369.0, + 1404.0, + 369.0, + 1404.0, + 406.0, + 1371.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 402.0, + 1405.0, + 402.0, + 1405.0, + 438.0, + 295.0, + 438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 430.0, + 1376.0, + 430.0, + 1376.0, + 468.0, + 294.0, + 468.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 280, + 1403, + 280, + 1403, + 403, + 299, + 403 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 299, + 488, + 1404, + 488, + 1404, + 611, + 299, + 611 + ], + "score": 0.968 + }, + { + "category_id": 0, + "poly": [ + 300, + 226, + 531, + 226, + 531, + 261, + 300, + 261 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 815, + 75, + 815, + 105, + 299, + 105 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 299, + 436, + 666, + 436, + 666, + 469, + 299, + 469 + ], + "score": 0.892 + }, + { + "category_id": 0, + "poly": [ + 299, + 643, + 489, + 643, + 489, + 677, + 299, + 677 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 837, + 2088, + 865, + 2088, + 865, + 2112, + 837, + 2112 + ], + "score": 0.84 + }, + { + "category_id": 1, + "poly": [ + 300, + 695, + 1400, + 695, + 1400, + 789, + 300, + 789 + ], + "score": 0.686 + }, + { + "category_id": 1, + "poly": [ + 294, + 1194, + 1402, + 1194, + 1402, + 1259, + 294, + 1259 + ], + "score": 0.603 + }, + { + "category_id": 1, + "poly": [ + 299, + 1388, + 1401, + 1388, + 1401, + 1482, + 299, + 1482 + ], + "score": 0.563 + }, + { + "category_id": 1, + "poly": [ + 298, + 1275, + 1400, + 1275, + 1400, + 1370, + 298, + 1370 + ], + "score": 0.547 + }, + { + "category_id": 1, + "poly": [ + 297, + 1081, + 1400, + 1081, + 1400, + 1177, + 297, + 1177 + ], + "score": 0.537 + }, + { + "category_id": 1, + "poly": [ + 295, + 1000, + 1400, + 1000, + 1400, + 1066, + 295, + 1066 + ], + "score": 0.534 + }, + { + "category_id": 1, + "poly": [ + 295, + 805, + 1403, + 805, + 1403, + 872, + 295, + 872 + ], + "score": 0.522 + }, + { + "category_id": 1, + "poly": [ + 304, + 887, + 1399, + 887, + 1399, + 982, + 304, + 982 + ], + "score": 0.515 + }, + { + "category_id": 1, + "poly": [ + 297, + 1612, + 1399, + 1612, + 1399, + 1678, + 297, + 1678 + ], + "score": 0.515 + }, + { + "category_id": 1, + "poly": [ + 299, + 1500, + 1400, + 1500, + 1400, + 1595, + 299, + 1595 + ], + "score": 0.5 + }, + { + "category_id": 1, + "poly": [ + 300, + 1694, + 1399, + 1694, + 1399, + 1760, + 300, + 1760 + ], + "score": 0.451 + }, + { + "category_id": 1, + "poly": [ + 298, + 1971, + 1399, + 1971, + 1399, + 2035, + 298, + 2035 + ], + "score": 0.423 + }, + { + "category_id": 1, + "poly": [ + 298, + 1777, + 1399, + 1777, + 1399, + 1842, + 298, + 1842 + ], + "score": 0.403 + }, + { + "category_id": 1, + "poly": [ + 297, + 1858, + 1398, + 1858, + 1398, + 1953, + 297, + 1953 + ], + "score": 0.378 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 222.0, + 537.0, + 222.0, + 537.0, + 269.0, + 295.0, + 269.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": [ + 298.0, + 435.0, + 667.0, + 435.0, + 667.0, + 474.0, + 298.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 643.0, + 491.0, + 643.0, + 491.0, + 680.0, + 296.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2125.0, + 831.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 278.0, + 1404.0, + 278.0, + 1404.0, + 317.0, + 294.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 311.0, + 1405.0, + 311.0, + 1405.0, + 344.0, + 294.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 341.0, + 1408.0, + 341.0, + 1408.0, + 375.0, + 294.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 372.0, + 1269.0, + 372.0, + 1269.0, + 408.0, + 295.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 486.0, + 1404.0, + 486.0, + 1404.0, + 523.0, + 294.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 518.0, + 1405.0, + 518.0, + 1405.0, + 553.0, + 293.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 548.0, + 1405.0, + 548.0, + 1405.0, + 584.0, + 293.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 576.0, + 683.0, + 576.0, + 683.0, + 617.0, + 293.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 693.0, + 1406.0, + 693.0, + 1406.0, + 731.0, + 295.0, + 731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 725.0, + 1404.0, + 725.0, + 1404.0, + 761.0, + 323.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 757.0, + 879.0, + 757.0, + 879.0, + 790.0, + 321.0, + 790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1193.0, + 1404.0, + 1193.0, + 1404.0, + 1233.0, + 294.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1224.0, + 476.0, + 1224.0, + 476.0, + 1261.0, + 322.0, + 1261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1388.0, + 1403.0, + 1388.0, + 1403.0, + 1425.0, + 294.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1418.0, + 1405.0, + 1418.0, + 1405.0, + 1458.0, + 319.0, + 1458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1447.0, + 397.0, + 1447.0, + 397.0, + 1485.0, + 320.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1277.0, + 1404.0, + 1277.0, + 1404.0, + 1312.0, + 296.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1309.0, + 1404.0, + 1309.0, + 1404.0, + 1343.0, + 322.0, + 1343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1338.0, + 655.0, + 1338.0, + 655.0, + 1372.0, + 323.0, + 1372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1082.0, + 1401.0, + 1082.0, + 1401.0, + 1117.0, + 297.0, + 1117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1112.0, + 1400.0, + 1112.0, + 1400.0, + 1150.0, + 322.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1145.0, + 724.0, + 1145.0, + 724.0, + 1177.0, + 323.0, + 1177.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 999.0, + 1404.0, + 999.0, + 1404.0, + 1038.0, + 295.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1030.0, + 1262.0, + 1030.0, + 1262.0, + 1065.0, + 322.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 806.0, + 1405.0, + 806.0, + 1405.0, + 842.0, + 294.0, + 842.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 837.0, + 934.0, + 837.0, + 934.0, + 872.0, + 322.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 887.0, + 1404.0, + 887.0, + 1404.0, + 925.0, + 296.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 917.0, + 1404.0, + 917.0, + 1404.0, + 956.0, + 321.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 950.0, + 707.0, + 950.0, + 707.0, + 984.0, + 324.0, + 984.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1611.0, + 1404.0, + 1611.0, + 1404.0, + 1650.0, + 295.0, + 1650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1645.0, + 875.0, + 1645.0, + 875.0, + 1679.0, + 322.0, + 1679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1497.0, + 1404.0, + 1497.0, + 1404.0, + 1539.0, + 295.0, + 1539.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1532.0, + 1402.0, + 1532.0, + 1402.0, + 1566.0, + 324.0, + 1566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1562.0, + 676.0, + 1562.0, + 676.0, + 1596.0, + 327.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1695.0, + 1402.0, + 1695.0, + 1402.0, + 1730.0, + 296.0, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1724.0, + 1397.0, + 1724.0, + 1397.0, + 1761.0, + 322.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1970.0, + 1403.0, + 1970.0, + 1403.0, + 2006.0, + 296.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2003.0, + 1403.0, + 2003.0, + 1403.0, + 2036.0, + 323.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1776.0, + 1404.0, + 1776.0, + 1404.0, + 1815.0, + 294.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1808.0, + 1122.0, + 1808.0, + 1122.0, + 1844.0, + 324.0, + 1844.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1855.0, + 1402.0, + 1855.0, + 1402.0, + 1897.0, + 293.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1887.0, + 1404.0, + 1887.0, + 1404.0, + 1929.0, + 321.0, + 1929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1921.0, + 533.0, + 1921.0, + 533.0, + 1953.0, + 325.0, + 1953.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.886 + }, + { + "category_id": 1, + "poly": [ + 296, + 855, + 1403, + 855, + 1403, + 920, + 296, + 920 + ], + "score": 0.835 + }, + { + "category_id": 1, + "poly": [ + 298, + 625, + 1405, + 625, + 1405, + 751, + 298, + 751 + ], + "score": 0.821 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.814 + }, + { + "category_id": 1, + "poly": [ + 297, + 541, + 1400, + 541, + 1400, + 607, + 297, + 607 + ], + "score": 0.814 + }, + { + "category_id": 1, + "poly": [ + 297, + 939, + 1405, + 939, + 1405, + 1064, + 297, + 1064 + ], + "score": 0.79 + }, + { + "category_id": 1, + "poly": [ + 296, + 1312, + 1398, + 1312, + 1398, + 1379, + 296, + 1379 + ], + "score": 0.787 + }, + { + "category_id": 1, + "poly": [ + 299, + 772, + 1402, + 772, + 1402, + 836, + 299, + 836 + ], + "score": 0.782 + }, + { + "category_id": 1, + "poly": [ + 297, + 1084, + 1405, + 1084, + 1405, + 1210, + 297, + 1210 + ], + "score": 0.781 + }, + { + "category_id": 1, + "poly": [ + 294, + 228, + 1402, + 228, + 1402, + 294, + 294, + 294 + ], + "score": 0.778 + }, + { + "category_id": 1, + "poly": [ + 296, + 1229, + 1399, + 1229, + 1399, + 1295, + 296, + 1295 + ], + "score": 0.763 + }, + { + "category_id": 1, + "poly": [ + 298, + 1396, + 1405, + 1396, + 1405, + 1494, + 298, + 1494 + ], + "score": 0.762 + }, + { + "category_id": 1, + "poly": [ + 296, + 1741, + 1401, + 1741, + 1401, + 1837, + 296, + 1837 + ], + "score": 0.75 + }, + { + "category_id": 1, + "poly": [ + 296, + 1626, + 1404, + 1626, + 1404, + 1722, + 296, + 1722 + ], + "score": 0.748 + }, + { + "category_id": 1, + "poly": [ + 297, + 1512, + 1406, + 1512, + 1406, + 1608, + 297, + 1608 + ], + "score": 0.743 + }, + { + "category_id": 1, + "poly": [ + 296, + 428, + 1406, + 428, + 1406, + 522, + 296, + 522 + ], + "score": 0.715 + }, + { + "category_id": 1, + "poly": [ + 296, + 1971, + 1399, + 1971, + 1399, + 2035, + 296, + 2035 + ], + "score": 0.697 + }, + { + "category_id": 1, + "poly": [ + 297, + 1856, + 1401, + 1856, + 1401, + 1952, + 297, + 1952 + ], + "score": 0.693 + }, + { + "category_id": 1, + "poly": [ + 301, + 312, + 1399, + 312, + 1399, + 408, + 301, + 408 + ], + "score": 0.689 + }, + { + "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": [ + 296.0, + 857.0, + 1404.0, + 857.0, + 1404.0, + 893.0, + 296.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 888.0, + 1398.0, + 888.0, + 1398.0, + 921.0, + 323.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 624.0, + 1405.0, + 624.0, + 1405.0, + 663.0, + 293.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 657.0, + 1405.0, + 657.0, + 1405.0, + 694.0, + 321.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 689.0, + 1405.0, + 689.0, + 1405.0, + 724.0, + 321.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 719.0, + 742.0, + 719.0, + 742.0, + 755.0, + 322.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 540.0, + 1405.0, + 540.0, + 1405.0, + 580.0, + 295.0, + 580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 574.0, + 544.0, + 574.0, + 544.0, + 608.0, + 325.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 942.0, + 1405.0, + 942.0, + 1405.0, + 975.0, + 296.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 969.0, + 1403.0, + 969.0, + 1403.0, + 1006.0, + 320.0, + 1006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1003.0, + 1405.0, + 1003.0, + 1405.0, + 1035.0, + 321.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1028.0, + 399.0, + 1028.0, + 399.0, + 1068.0, + 320.0, + 1068.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1313.0, + 1403.0, + 1313.0, + 1403.0, + 1351.0, + 294.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1344.0, + 1382.0, + 1344.0, + 1382.0, + 1379.0, + 321.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 768.0, + 465.0, + 768.0, + 465.0, + 808.0, + 295.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 769.0, + 1191.0, + 769.0, + 1191.0, + 809.0, + 505.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 772.0, + 1406.0, + 772.0, + 1406.0, + 809.0, + 1218.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 802.0, + 598.0, + 802.0, + 598.0, + 835.0, + 320.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1086.0, + 1405.0, + 1086.0, + 1405.0, + 1122.0, + 295.0, + 1122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1113.0, + 1405.0, + 1113.0, + 1405.0, + 1155.0, + 320.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1145.0, + 1407.0, + 1145.0, + 1407.0, + 1186.0, + 319.0, + 1186.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1178.0, + 684.0, + 1178.0, + 684.0, + 1211.0, + 320.0, + 1211.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 226.0, + 1405.0, + 226.0, + 1405.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 260.0, + 463.0, + 260.0, + 463.0, + 293.0, + 325.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1228.0, + 1403.0, + 1228.0, + 1403.0, + 1266.0, + 295.0, + 1266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1261.0, + 1157.0, + 1261.0, + 1157.0, + 1296.0, + 321.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1394.0, + 1406.0, + 1394.0, + 1406.0, + 1435.0, + 293.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1429.0, + 1403.0, + 1429.0, + 1403.0, + 1464.0, + 322.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1461.0, + 1113.0, + 1461.0, + 1113.0, + 1496.0, + 323.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1740.0, + 1406.0, + 1740.0, + 1406.0, + 1779.0, + 294.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1771.0, + 1405.0, + 1771.0, + 1405.0, + 1810.0, + 323.0, + 1810.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1804.0, + 847.0, + 1804.0, + 847.0, + 1838.0, + 324.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1627.0, + 1405.0, + 1627.0, + 1405.0, + 1662.0, + 296.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1658.0, + 1404.0, + 1658.0, + 1404.0, + 1695.0, + 322.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1690.0, + 761.0, + 1690.0, + 761.0, + 1722.0, + 323.0, + 1722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1509.0, + 1406.0, + 1509.0, + 1406.0, + 1551.0, + 292.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1543.0, + 1403.0, + 1543.0, + 1403.0, + 1580.0, + 321.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1575.0, + 477.0, + 1575.0, + 477.0, + 1607.0, + 323.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 428.0, + 1403.0, + 428.0, + 1403.0, + 464.0, + 295.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 459.0, + 1402.0, + 459.0, + 1402.0, + 493.0, + 323.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 490.0, + 504.0, + 490.0, + 504.0, + 521.0, + 323.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2007.0, + 296.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 2002.0, + 935.0, + 2002.0, + 935.0, + 2038.0, + 324.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1857.0, + 1405.0, + 1857.0, + 1405.0, + 1892.0, + 296.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1887.0, + 1403.0, + 1887.0, + 1403.0, + 1924.0, + 322.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1915.0, + 1023.0, + 1915.0, + 1023.0, + 1954.0, + 321.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 313.0, + 1404.0, + 313.0, + 1404.0, + 348.0, + 295.0, + 348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 344.0, + 1407.0, + 344.0, + 1407.0, + 381.0, + 322.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 375.0, + 819.0, + 375.0, + 819.0, + 409.0, + 326.0, + 409.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 299, + 75, + 816, + 75, + 816, + 105, + 299, + 105 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.838 + }, + { + "category_id": 1, + "poly": [ + 293, + 229, + 1403, + 229, + 1403, + 294, + 293, + 294 + ], + "score": 0.778 + }, + { + "category_id": 1, + "poly": [ + 298, + 426, + 1402, + 426, + 1402, + 519, + 298, + 519 + ], + "score": 0.75 + }, + { + "category_id": 1, + "poly": [ + 298, + 1657, + 1403, + 1657, + 1403, + 1721, + 298, + 1721 + ], + "score": 0.722 + }, + { + "category_id": 1, + "poly": [ + 291, + 1740, + 1404, + 1740, + 1404, + 1806, + 291, + 1806 + ], + "score": 0.713 + }, + { + "category_id": 1, + "poly": [ + 296, + 538, + 1400, + 538, + 1400, + 603, + 296, + 603 + ], + "score": 0.713 + }, + { + "category_id": 1, + "poly": [ + 295, + 817, + 1400, + 817, + 1400, + 883, + 295, + 883 + ], + "score": 0.707 + }, + { + "category_id": 1, + "poly": [ + 294, + 1491, + 1402, + 1491, + 1402, + 1556, + 294, + 1556 + ], + "score": 0.7 + }, + { + "category_id": 1, + "poly": [ + 293, + 1015, + 1401, + 1015, + 1401, + 1079, + 293, + 1079 + ], + "score": 0.697 + }, + { + "category_id": 1, + "poly": [ + 297, + 311, + 1401, + 311, + 1401, + 406, + 297, + 406 + ], + "score": 0.694 + }, + { + "category_id": 1, + "poly": [ + 295, + 1324, + 1400, + 1324, + 1400, + 1390, + 295, + 1390 + ], + "score": 0.676 + }, + { + "category_id": 1, + "poly": [ + 298, + 1407, + 1401, + 1407, + 1401, + 1473, + 298, + 1473 + ], + "score": 0.674 + }, + { + "category_id": 1, + "poly": [ + 292, + 1574, + 1403, + 1574, + 1403, + 1638, + 292, + 1638 + ], + "score": 0.672 + }, + { + "category_id": 1, + "poly": [ + 297, + 621, + 1399, + 621, + 1399, + 687, + 297, + 687 + ], + "score": 0.672 + }, + { + "category_id": 1, + "poly": [ + 296, + 1097, + 1402, + 1097, + 1402, + 1194, + 296, + 1194 + ], + "score": 0.642 + }, + { + "category_id": 1, + "poly": [ + 300, + 1210, + 1401, + 1210, + 1401, + 1306, + 300, + 1306 + ], + "score": 0.641 + }, + { + "category_id": 1, + "poly": [ + 297, + 902, + 1403, + 902, + 1403, + 996, + 297, + 996 + ], + "score": 0.635 + }, + { + "category_id": 1, + "poly": [ + 299, + 704, + 1403, + 704, + 1403, + 801, + 299, + 801 + ], + "score": 0.557 + }, + { + "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": [ + 295.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 260.0, + 829.0, + 260.0, + 829.0, + 295.0, + 324.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 423.0, + 1406.0, + 423.0, + 1406.0, + 464.0, + 294.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 458.0, + 1404.0, + 458.0, + 1404.0, + 492.0, + 323.0, + 492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 485.0, + 398.0, + 485.0, + 398.0, + 521.0, + 319.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1657.0, + 1404.0, + 1657.0, + 1404.0, + 1693.0, + 297.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1690.0, + 798.0, + 1690.0, + 798.0, + 1721.0, + 319.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1742.0, + 1402.0, + 1742.0, + 1402.0, + 1774.0, + 297.0, + 1774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1770.0, + 726.0, + 1770.0, + 726.0, + 1805.0, + 322.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 536.0, + 1405.0, + 536.0, + 1405.0, + 578.0, + 292.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 568.0, + 545.0, + 568.0, + 545.0, + 603.0, + 321.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 818.0, + 1404.0, + 818.0, + 1404.0, + 855.0, + 295.0, + 855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 850.0, + 1309.0, + 850.0, + 1309.0, + 884.0, + 323.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1491.0, + 1404.0, + 1491.0, + 1404.0, + 1527.0, + 296.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1521.0, + 1358.0, + 1521.0, + 1358.0, + 1557.0, + 323.0, + 1557.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1015.0, + 1403.0, + 1015.0, + 1403.0, + 1051.0, + 295.0, + 1051.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1046.0, + 764.0, + 1046.0, + 764.0, + 1080.0, + 321.0, + 1080.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 310.0, + 1405.0, + 310.0, + 1405.0, + 349.0, + 295.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 345.0, + 1403.0, + 345.0, + 1403.0, + 379.0, + 324.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 373.0, + 502.0, + 373.0, + 502.0, + 409.0, + 321.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1325.0, + 1402.0, + 1325.0, + 1402.0, + 1361.0, + 296.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1353.0, + 1188.0, + 1353.0, + 1188.0, + 1392.0, + 320.0, + 1392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1406.0, + 1405.0, + 1406.0, + 1405.0, + 1444.0, + 296.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1437.0, + 1282.0, + 1437.0, + 1282.0, + 1472.0, + 322.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1571.0, + 1406.0, + 1571.0, + 1406.0, + 1611.0, + 294.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1606.0, + 933.0, + 1606.0, + 933.0, + 1639.0, + 323.0, + 1639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 619.0, + 1404.0, + 619.0, + 1404.0, + 659.0, + 293.0, + 659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 653.0, + 986.0, + 653.0, + 986.0, + 685.0, + 323.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1097.0, + 1404.0, + 1097.0, + 1404.0, + 1136.0, + 295.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1130.0, + 1405.0, + 1130.0, + 1405.0, + 1165.0, + 321.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1159.0, + 1260.0, + 1159.0, + 1260.0, + 1197.0, + 325.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1211.0, + 1403.0, + 1211.0, + 1403.0, + 1246.0, + 298.0, + 1246.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1241.0, + 1405.0, + 1241.0, + 1405.0, + 1279.0, + 321.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1271.0, + 798.0, + 1271.0, + 798.0, + 1308.0, + 323.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 903.0, + 1405.0, + 903.0, + 1405.0, + 937.0, + 295.0, + 937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 932.0, + 1404.0, + 932.0, + 1404.0, + 972.0, + 320.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 961.0, + 608.0, + 961.0, + 608.0, + 995.0, + 324.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 704.0, + 1405.0, + 704.0, + 1405.0, + 743.0, + 294.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 736.0, + 1404.0, + 736.0, + 1404.0, + 771.0, + 322.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 767.0, + 823.0, + 767.0, + 823.0, + 802.0, + 326.0, + 802.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 278, + 1404, + 278, + 1404, + 435, + 296, + 435 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1138, + 1405, + 1138, + 1405, + 1260, + 297, + 1260 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1349, + 1405, + 1349, + 1405, + 1447, + 298, + 1447 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 390, + 817, + 1307, + 817, + 1307, + 992, + 390, + 992 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 298, + 1013, + 1405, + 1013, + 1405, + 1078, + 298, + 1078 + ], + "score": 0.955 + }, + { + "category_id": 8, + "poly": [ + 507, + 1261, + 1192, + 1261, + 1192, + 1336, + 507, + 1336 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 593, + 1447, + 1101, + 1447, + 1101, + 1502, + 593, + 1502 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 293, + 1571, + 1402, + 1571, + 1402, + 1646, + 293, + 1646 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 293, + 447, + 1399, + 447, + 1399, + 513, + 293, + 513 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 297, + 1524, + 804, + 1524, + 804, + 1560, + 297, + 1560 + ], + "score": 0.927 + }, + { + "category_id": 0, + "poly": [ + 298, + 1092, + 610, + 1092, + 610, + 1123, + 298, + 1123 + ], + "score": 0.921 + }, + { + "category_id": 2, + "poly": [ + 335, + 2003, + 669, + 2003, + 669, + 2035, + 335, + 2035 + ], + "score": 0.92 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 816, + 74, + 816, + 106, + 298, + 106 + ], + "score": 0.911 + }, + { + "category_id": 9, + "poly": [ + 1344, + 575, + 1400, + 575, + 1400, + 607, + 1344, + 607 + ], + "score": 0.906 + }, + { + "category_id": 9, + "poly": [ + 1343, + 1455, + 1400, + 1455, + 1400, + 1486, + 1343, + 1486 + ], + "score": 0.904 + }, + { + "category_id": 9, + "poly": [ + 1344, + 1268, + 1400, + 1268, + 1400, + 1299, + 1344, + 1299 + ], + "score": 0.901 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.868 + }, + { + "category_id": 1, + "poly": [ + 295, + 708, + 1402, + 708, + 1402, + 819, + 295, + 819 + ], + "score": 0.865 + }, + { + "category_id": 1, + "poly": [ + 298, + 1706, + 1087, + 1706, + 1087, + 1748, + 298, + 1748 + ], + "score": 0.853 + }, + { + "category_id": 8, + "poly": [ + 659, + 555, + 1040, + 555, + 1040, + 637, + 659, + 637 + ], + "score": 0.848 + }, + { + "category_id": 0, + "poly": [ + 298, + 661, + 658, + 661, + 658, + 694, + 298, + 694 + ], + "score": 0.806 + }, + { + "category_id": 0, + "poly": [ + 299, + 227, + 706, + 227, + 706, + 262, + 299, + 262 + ], + "score": 0.795 + }, + { + "category_id": 2, + "poly": [ + 1374, + 924, + 1402, + 924, + 1402, + 952, + 1374, + 952 + ], + "score": 0.766 + }, + { + "category_id": 2, + "poly": [ + 1374, + 1662, + 1402, + 1662, + 1402, + 1690, + 1374, + 1690 + ], + "score": 0.766 + }, + { + "category_id": 1, + "poly": [ + 299, + 520, + 1044, + 520, + 1044, + 553, + 299, + 553 + ], + "score": 0.725 + }, + { + "category_id": 1, + "poly": [ + 291, + 1657, + 1255, + 1657, + 1255, + 1698, + 291, + 1698 + ], + "score": 0.699 + }, + { + "category_id": 1, + "poly": [ + 298, + 661, + 658, + 661, + 658, + 694, + 298, + 694 + ], + "score": 0.139 + }, + { + "category_id": 1, + "poly": [ + 299, + 227, + 706, + 227, + 706, + 262, + 299, + 262 + ], + "score": 0.133 + }, + { + "category_id": 14, + "poly": [ + 390, + 813, + 1308, + 813, + 1308, + 995, + 390, + 995 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\widetilde { \\mathcal { F } } _ { h } ) ] = \\mathbf { E } [ \\displaystyle \\sum _ { j \\in [ n ] } \\big ( \\widetilde { f } _ { j } - f _ { j } \\big ) \\cdot f _ { j } ] = \\displaystyle \\sum _ { j \\in [ n ] } \\mathbf { E } [ \\displaystyle \\sum _ { \\{ q \\neq j \\mid h [ q ] = h [ j ] \\} } f _ { q } ] \\cdot f _ { j } } & { } \\\\ { \\displaystyle } & { = \\displaystyle \\sum _ { j \\in [ n ] } ( \\Theta ( \\frac { \\ln n } { B } ) - \\frac { f _ { j } } { B } ) \\cdot f _ { j } = \\Theta ( \\frac { \\ln ^ { 2 } n } { B } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1133, + 372, + 1234, + 372, + 1234, + 405, + 1133, + 405 + ], + "score": 0.93, + "latex": "\\{ 1 \\ldots n \\}" + }, + { + "category_id": 13, + "poly": [ + 971, + 1656, + 1241, + 1656, + 1241, + 1697, + 971, + 1697 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { r _ { i } = o ( \\ln ^ { 1 + \\gamma } ( \\frac { n } { B } ) ) < r _ { 0 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 693, + 372, + 796, + 372, + 796, + 405, + 693, + 405 + ], + "score": 0.92, + "latex": "f _ { i } = 1 / i" + }, + { + "category_id": 13, + "poly": [ + 888, + 1350, + 1003, + 1350, + 1003, + 1384, + 888, + 1384 + ], + "score": 0.92, + "latex": "[ 0 , B \\ln n ]" + }, + { + "category_id": 13, + "poly": [ + 1233, + 1045, + 1300, + 1045, + 1300, + 1079, + 1233, + 1079 + ], + "score": 0.92, + "latex": "\\Theta ( B )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1200, + 480, + 1200, + 480, + 1233, + 298, + 1233 + ], + "score": 0.91, + "latex": "j ~ \\in ~ [ n ] , \\ell ~ \\le ~ k" + }, + { + "category_id": 14, + "poly": [ + 505, + 1259, + 1191, + 1259, + 1191, + 1337, + 505, + 1337 + ], + "score": 0.91, + "latex": "\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { C M } ) ] { \\stackrel { \\cdot } { = } } \\mathbf { E } [ \\sum _ { j \\in [ n ] } ( \\tilde { f } _ { j } - f _ { j } ) \\cdot f _ { j } ] = \\sum _ { j \\in [ n ] } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } ," + }, + { + "category_id": 13, + "poly": [ + 1154, + 743, + 1251, + 743, + 1251, + 783, + 1154, + 783 + ], + "score": 0.91, + "latex": "\\Theta \\big ( \\textstyle { \\frac { \\ln ^ { 2 } n } { B } } \\big )" + }, + { + "category_id": 14, + "poly": [ + 658, + 550, + 1043, + 550, + 1043, + 640, + 658, + 640 + ], + "score": 0.91, + "latex": "\\ln ( n + 1 ) < \\sum _ { i = 1 } ^ { \\tilde { n } } { \\frac { 1 } { i } } < \\ln n + 0 . 5 8" + }, + { + "category_id": 13, + "poly": [ + 563, + 1381, + 1063, + 1381, + 1063, + 1421, + 563, + 1421 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\Theta ( \\ln ^ { 1 + \\gamma } ( \\frac { n } { B } ) ) = r _ { 0 } \\le \\dots \\le r _ { m } = \\bar { B } \\ln n } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1063, + 1352, + 1144, + 1352, + 1144, + 1380, + 1063, + 1380 + ], + "score": 0.9, + "latex": "m + 1" + }, + { + "category_id": 13, + "poly": [ + 771, + 1705, + 1081, + 1705, + 1081, + 1749, + 771, + 1749 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\sum _ { j \\geq i } \\ln ^ { - c } r _ { j } = O ( \\ln ^ { - c } r _ { i } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1153, + 709, + 1307, + 709, + 1307, + 743, + 1153, + 743 + ], + "score": 0.9, + "latex": "h : [ n ] \\to [ B ]" + }, + { + "category_id": 13, + "poly": [ + 578, + 1710, + 643, + 1710, + 643, + 1740, + 578, + 1740 + ], + "score": 0.89, + "latex": "i \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 849, + 1571, + 1053, + 1571, + 1053, + 1609, + 849, + 1609 + ], + "score": 0.89, + "latex": "r _ { i } < 2 \\ln ^ { 1 + \\gamma } r _ { i + 1 }" + }, + { + "category_id": 13, + "poly": [ + 711, + 1611, + 746, + 1611, + 746, + 1642, + 711, + 1642 + ], + "score": 0.89, + "latex": "r _ { i } { } ^ { 7 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1611, + 368, + 1611, + 368, + 1642, + 297, + 1642 + ], + "score": 0.89, + "latex": "2 \\ln r _ { i }" + }, + { + "category_id": 13, + "poly": [ + 503, + 2003, + 661, + 2003, + 661, + 2034, + 503, + 2034 + ], + "score": 0.89, + "latex": "r _ { i } \\geq 1 . 3 \\times 1 0 ^ { 6 }" + }, + { + "category_id": 14, + "poly": [ + 592, + 1444, + 1102, + 1444, + 1102, + 1502, + 592, + 1502 + ], + "score": 0.88, + "latex": "\\forall \\ell > 0 , \\quad r _ { \\ell } : = \\dot { ( \\ln ( \\frac { n } { B } ) + \\ln r _ { \\ell + 1 } ) } \\ln ^ { \\dot { \\gamma } } r _ { \\ell + 1 } ." + }, + { + "category_id": 13, + "poly": [ + 862, + 1613, + 931, + 1613, + 931, + 1644, + 862, + 1644 + ], + "score": 0.88, + "latex": "\\gamma \\le 3" + }, + { + "category_id": 13, + "poly": [ + 593, + 372, + 633, + 372, + 633, + 404, + 593, + 404 + ], + "score": 0.88, + "latex": "| U |" + }, + { + "category_id": 13, + "poly": [ + 1155, + 1567, + 1404, + 1567, + 1404, + 1613, + 1155, + 1613 + ], + "score": 0.88, + "latex": "\\ln r _ { i + 1 } > \\left( { \\frac { r _ { i } } { 2 } } \\right) ^ { \\frac { 1 } { 1 + \\gamma } } >" + }, + { + "category_id": 13, + "poly": [ + 1247, + 1201, + 1275, + 1201, + 1275, + 1234, + 1247, + 1234 + ], + "score": 0.88, + "latex": "f _ { j }" + }, + { + "category_id": 13, + "poly": [ + 585, + 1205, + 628, + 1205, + 628, + 1234, + 585, + 1234 + ], + "score": 0.88, + "latex": "e _ { j , \\ell }" + }, + { + "category_id": 13, + "poly": [ + 901, + 372, + 936, + 372, + 936, + 405, + 901, + 405 + ], + "score": 0.88, + "latex": "[ n ]" + }, + { + "category_id": 13, + "poly": [ + 1320, + 1201, + 1351, + 1201, + 1351, + 1231, + 1320, + 1231 + ], + "score": 0.87, + "latex": "h _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 685, + 1205, + 713, + 1205, + 713, + 1234, + 685, + 1234 + ], + "score": 0.87, + "latex": "e _ { j }" + }, + { + "category_id": 13, + "poly": [ + 570, + 404, + 624, + 404, + 624, + 436, + 570, + 436 + ], + "score": 0.86, + "latex": "1 / N" + }, + { + "category_id": 13, + "poly": [ + 694, + 1709, + 759, + 1709, + 759, + 1742, + 694, + 1742 + ], + "score": 0.85, + "latex": "c \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 522, + 1661, + 708, + 1661, + 708, + 1697, + 522, + 1697 + ], + "score": 0.84, + "latex": "\\ln r _ { i + 1 } \\geq \\ln ( { \\frac { n } { B } } )" + }, + { + "category_id": 13, + "poly": [ + 898, + 1421, + 935, + 1421, + 935, + 1446, + 898, + 1446 + ], + "score": 0.83, + "latex": "r _ { i } \\mathrm { s }" + }, + { + "category_id": 13, + "poly": [ + 645, + 1575, + 836, + 1575, + 836, + 1611, + 645, + 1611 + ], + "score": 0.82, + "latex": "\\ln r _ { i + 1 } \\geq \\ln ( { \\frac { n } { B } } )" + }, + { + "category_id": 13, + "poly": [ + 749, + 1171, + 775, + 1171, + 775, + 1197, + 749, + 1197 + ], + "score": 0.82, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 1146, + 1390, + 1167, + 1390, + 1167, + 1418, + 1146, + 1418 + ], + "score": 0.82, + "latex": "\\gamma" + }, + { + "category_id": 13, + "poly": [ + 1331, + 1016, + 1349, + 1016, + 1349, + 1042, + 1331, + 1042 + ], + "score": 0.81, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 496, + 1171, + 515, + 1171, + 515, + 1197, + 496, + 1197 + ], + "score": 0.8, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1375, + 710, + 1401, + 710, + 1401, + 737, + 1375, + 737 + ], + "score": 0.79, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 718, + 1663, + 830, + 1663, + 830, + 1695, + 718, + 1695 + ], + "score": 0.78, + "latex": "r _ { i } \\leq r _ { i + 1 }" + }, + { + "category_id": 13, + "poly": [ + 536, + 1527, + 796, + 1527, + 796, + 1561, + 536, + 1561 + ], + "score": 0.75, + "latex": "i \\geq 0 , \\ln r _ { i + 1 } \\geq 2 \\ln r _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1288, + 347, + 1308, + 347, + 1308, + 369, + 1288, + 369 + ], + "score": 0.74, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 536, + 1527, + 599, + 1527, + 599, + 1558, + 536, + 1558 + ], + "score": 0.52, + "latex": "i \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 927, + 522, + 1029, + 522, + 1029, + 551, + 927, + 551 + ], + "score": 0.35, + "latex": "n > 2 5 0 ," + }, + { + "category_id": 13, + "poly": [ + 848, + 527, + 867, + 527, + 867, + 549, + 848, + 549 + ], + "score": 0.35, + "latex": "n" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1091.0, + 610.0, + 1091.0, + 610.0, + 1127.0, + 296.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1998.0, + 502.0, + 1998.0, + 502.0, + 2039.0, + 330.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 1998.0, + 673.0, + 1998.0, + 673.0, + 2039.0, + 662.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 109.0, + 296.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2123.0, + 831.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 659.0, + 660.0, + 659.0, + 660.0, + 697.0, + 294.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 227.0, + 707.0, + 227.0, + 707.0, + 267.0, + 297.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1378.0, + 928.0, + 1402.0, + 928.0, + 1402.0, + 955.0, + 1378.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1378.0, + 1666.0, + 1402.0, + 1666.0, + 1402.0, + 1693.0, + 1378.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 279.0, + 1405.0, + 279.0, + 1405.0, + 316.0, + 294.0, + 316.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 307.0, + 1406.0, + 307.0, + 1406.0, + 346.0, + 293.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 342.0, + 1287.0, + 342.0, + 1287.0, + 375.0, + 295.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1309.0, + 342.0, + 1405.0, + 342.0, + 1405.0, + 375.0, + 1309.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 366.0, + 592.0, + 366.0, + 592.0, + 411.0, + 291.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 366.0, + 692.0, + 366.0, + 692.0, + 411.0, + 634.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 366.0, + 900.0, + 366.0, + 900.0, + 411.0, + 797.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 366.0, + 1132.0, + 366.0, + 1132.0, + 411.0, + 937.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1235.0, + 366.0, + 1405.0, + 366.0, + 1405.0, + 411.0, + 1235.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 403.0, + 569.0, + 403.0, + 569.0, + 437.0, + 295.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 403.0, + 1027.0, + 403.0, + 1027.0, + 437.0, + 625.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1140.0, + 1403.0, + 1140.0, + 1403.0, + 1172.0, + 295.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1167.0, + 495.0, + 1167.0, + 495.0, + 1204.0, + 292.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 516.0, + 1167.0, + 748.0, + 1167.0, + 748.0, + 1204.0, + 516.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 776.0, + 1167.0, + 1405.0, + 1167.0, + 1405.0, + 1204.0, + 776.0, + 1204.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1200.0, + 297.0, + 1200.0, + 297.0, + 1236.0, + 292.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 481.0, + 1200.0, + 584.0, + 1200.0, + 584.0, + 1236.0, + 481.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1200.0, + 684.0, + 1200.0, + 684.0, + 1236.0, + 629.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 1200.0, + 1246.0, + 1200.0, + 1246.0, + 1236.0, + 714.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 1200.0, + 1319.0, + 1200.0, + 1319.0, + 1236.0, + 1276.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1200.0, + 1406.0, + 1200.0, + 1406.0, + 1236.0, + 1352.0, + 1236.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1229.0, + 1324.0, + 1229.0, + 1324.0, + 1264.0, + 294.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1349.0, + 887.0, + 1349.0, + 887.0, + 1387.0, + 295.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1004.0, + 1349.0, + 1062.0, + 1349.0, + 1062.0, + 1387.0, + 1004.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1145.0, + 1349.0, + 1406.0, + 1349.0, + 1406.0, + 1387.0, + 1145.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1374.0, + 562.0, + 1374.0, + 562.0, + 1428.0, + 288.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1064.0, + 1374.0, + 1145.0, + 1374.0, + 1145.0, + 1428.0, + 1064.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 1374.0, + 1410.0, + 1374.0, + 1410.0, + 1428.0, + 1168.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1413.0, + 897.0, + 1413.0, + 897.0, + 1452.0, + 293.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 1413.0, + 1308.0, + 1413.0, + 1308.0, + 1452.0, + 936.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1013.0, + 1330.0, + 1013.0, + 1330.0, + 1049.0, + 295.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1350.0, + 1013.0, + 1405.0, + 1013.0, + 1405.0, + 1049.0, + 1350.0, + 1049.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1044.0, + 1232.0, + 1044.0, + 1232.0, + 1082.0, + 293.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1301.0, + 1044.0, + 1313.0, + 1044.0, + 1313.0, + 1082.0, + 1301.0, + 1082.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1563.0, + 644.0, + 1563.0, + 644.0, + 1615.0, + 291.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 1563.0, + 848.0, + 1563.0, + 848.0, + 1615.0, + 837.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1563.0, + 1154.0, + 1563.0, + 1154.0, + 1615.0, + 1054.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1609.0, + 710.0, + 1609.0, + 710.0, + 1647.0, + 369.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 1609.0, + 861.0, + 1609.0, + 861.0, + 1647.0, + 747.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1609.0, + 943.0, + 1609.0, + 943.0, + 1647.0, + 932.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 445.0, + 1403.0, + 445.0, + 1403.0, + 486.0, + 293.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 480.0, + 538.0, + 480.0, + 538.0, + 514.0, + 292.0, + 514.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1521.0, + 535.0, + 1521.0, + 535.0, + 1565.0, + 295.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 1521.0, + 806.0, + 1521.0, + 806.0, + 1565.0, + 797.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 707.0, + 1152.0, + 707.0, + 1152.0, + 744.0, + 295.0, + 744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1308.0, + 707.0, + 1374.0, + 707.0, + 1374.0, + 744.0, + 1308.0, + 744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 727.0, + 1153.0, + 727.0, + 1153.0, + 800.0, + 284.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 727.0, + 1273.0, + 727.0, + 1273.0, + 800.0, + 1252.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 785.0, + 378.0, + 785.0, + 378.0, + 825.0, + 292.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1702.0, + 577.0, + 1702.0, + 577.0, + 1751.0, + 294.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 1702.0, + 693.0, + 1702.0, + 693.0, + 1751.0, + 644.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 1702.0, + 770.0, + 1702.0, + 770.0, + 1751.0, + 760.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 1702.0, + 1093.0, + 1702.0, + 1093.0, + 1751.0, + 1082.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 517.0, + 847.0, + 517.0, + 847.0, + 558.0, + 295.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 517.0, + 926.0, + 517.0, + 926.0, + 558.0, + 868.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 517.0, + 1043.0, + 517.0, + 1043.0, + 558.0, + 1030.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1650.0, + 521.0, + 1650.0, + 521.0, + 1704.0, + 290.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 709.0, + 1650.0, + 717.0, + 1650.0, + 717.0, + 1704.0, + 709.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 1650.0, + 970.0, + 1650.0, + 970.0, + 1704.0, + 831.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 1650.0, + 1255.0, + 1650.0, + 1255.0, + 1704.0, + 1242.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 659.0, + 660.0, + 659.0, + 660.0, + 697.0, + 294.0, + 697.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 227.0, + 707.0, + 227.0, + 707.0, + 267.0, + 297.0, + 267.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 325, + 271, + 1373, + 271, + 1373, + 528, + 325, + 528 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 455, + 1808, + 1247, + 1808, + 1247, + 1979, + 455, + 1979 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 422, + 1270, + 1276, + 1270, + 1276, + 1414, + 422, + 1414 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 297, + 1436, + 1398, + 1436, + 1398, + 1527, + 297, + 1527 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 352, + 1056, + 1298, + 1056, + 1298, + 1241, + 352, + 1241 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 313, + 1625, + 1388, + 1625, + 1388, + 1748, + 313, + 1748 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 468, + 807, + 1228, + 807, + 1228, + 899, + 468, + 899 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 295, + 923, + 1052, + 923, + 1052, + 957, + 295, + 957 + ], + "score": 0.927 + }, + { + "category_id": 2, + "poly": [ + 297, + 73, + 816, + 73, + 816, + 106, + 297, + 106 + ], + "score": 0.92 + }, + { + "category_id": 8, + "poly": [ + 612, + 957, + 1090, + 957, + 1090, + 1018, + 612, + 1018 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 295, + 227, + 1242, + 227, + 1242, + 265, + 295, + 265 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 296, + 541, + 1024, + 541, + 1024, + 582, + 296, + 582 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 295, + 1539, + 1113, + 1539, + 1113, + 1599, + 295, + 1599 + ], + "score": 0.911 + }, + { + "category_id": 1, + "poly": [ + 297, + 1242, + 499, + 1242, + 499, + 1274, + 297, + 1274 + ], + "score": 0.906 + }, + { + "category_id": 1, + "poly": [ + 296, + 649, + 918, + 649, + 918, + 683, + 296, + 683 + ], + "score": 0.903 + }, + { + "category_id": 1, + "poly": [ + 297, + 1752, + 638, + 1752, + 638, + 1806, + 297, + 1806 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1343, + 280, + 1402, + 280, + 1402, + 312, + 1343, + 312 + ], + "score": 0.896 + }, + { + "category_id": 9, + "poly": [ + 1343, + 974, + 1401, + 974, + 1401, + 1006, + 1343, + 1006 + ], + "score": 0.896 + }, + { + "category_id": 1, + "poly": [ + 303, + 693, + 1234, + 693, + 1234, + 736, + 303, + 736 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1344, + 1181, + 1402, + 1181, + 1402, + 1213, + 1344, + 1213 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1343, + 1920, + 1402, + 1920, + 1402, + 1952, + 1343, + 1952 + ], + "score": 0.886 + }, + { + "category_id": 1, + "poly": [ + 301, + 1020, + 1360, + 1020, + 1360, + 1054, + 301, + 1054 + ], + "score": 0.879 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.868 + }, + { + "category_id": 1, + "poly": [ + 299, + 590, + 1246, + 590, + 1246, + 642, + 299, + 642 + ], + "score": 0.842 + }, + { + "category_id": 2, + "poly": [ + 1374, + 1356, + 1403, + 1356, + 1403, + 1386, + 1374, + 1386 + ], + "score": 0.816 + }, + { + "category_id": 1, + "poly": [ + 298, + 744, + 1400, + 744, + 1400, + 807, + 298, + 807 + ], + "score": 0.782 + }, + { + "category_id": 1, + "poly": [ + 297, + 1606, + 372, + 1606, + 372, + 1634, + 297, + 1634 + ], + "score": 0.733 + }, + { + "category_id": 2, + "poly": [ + 1374, + 828, + 1403, + 828, + 1403, + 857, + 1374, + 857 + ], + "score": 0.706 + }, + { + "category_id": 14, + "poly": [ + 467, + 800, + 1229, + 800, + 1229, + 903, + 467, + 903 + ], + "score": 0.94, + "latex": "\\mathbf { E } [ e _ { j , \\ell } \\mid e _ { j , \\ell } < \\frac { r } { B } ] \\leq \\sum _ { q > \\frac { B } { r } } f _ { q } \\cdot \\frac { 1 } { B } \\leq \\frac { \\ln n - \\ln ( \\frac { B } { r } ) } { B } = \\frac { \\ln ( \\frac { n } { B } ) + \\ln r } { B } ." + }, + { + "category_id": 13, + "poly": [ + 637, + 748, + 739, + 748, + 739, + 783, + 637, + 783 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { e _ { j , \\ell } < \\frac { r } { B } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 506, + 541, + 760, + 541, + 760, + 581, + 506, + 581 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1083, + 1437, + 1193, + 1437, + 1193, + 1475, + 1083, + 1475 + ], + "score": 0.92, + "latex": "\\textstyle { \\left( \\frac { r _ { i } } { B } , \\frac { r _ { i + 1 } } { B } \\right) }" + }, + { + "category_id": 14, + "poly": [ + 324, + 266, + 1375, + 266, + 1375, + 531, + 324, + 531 + ], + "score": 0.92, + "latex": "\\begin{array} { l l } { \\displaystyle \\mathbf { E } [ e _ { j } ] = \\int _ { 0 } ^ { \\infty } \\operatorname* { P r } ( e _ { j } \\geq x ) d x } & { \\displaystyle { ( 9 . } } \\\\ { \\displaystyle { = \\int _ { 0 } ^ { \\frac { r _ { 0 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x } } \\\\ { \\displaystyle { \\leq O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1235, + 1438, + 1299, + 1438, + 1299, + 1474, + 1235, + 1474 + ], + "score": 0.92, + "latex": "{ \\bf E } [ e _ { j } ]" + }, + { + "category_id": 13, + "poly": [ + 690, + 230, + 753, + 230, + 753, + 265, + 690, + 265 + ], + "score": 0.92, + "latex": "{ \\bf E } [ e _ { j } ]" + }, + { + "category_id": 14, + "poly": [ + 451, + 1807, + 1245, + 1807, + 1245, + 1983, + 451, + 1983 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) d x \\leq \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { ( B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 1 } ) x } ) d x } \\\\ & { \\qquad = O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1220, + 1019, + 1368, + 1019, + 1368, + 1053, + 1220, + 1053 + ], + "score": 0.91, + "latex": "t \\in [ r _ { i } , r _ { i + 1 } )" + }, + { + "category_id": 13, + "poly": [ + 866, + 543, + 1012, + 543, + 1012, + 578, + 866, + 578 + ], + "score": 0.91, + "latex": "t \\in [ r _ { i } , r _ { i + 1 } )" + }, + { + "category_id": 13, + "poly": [ + 985, + 235, + 1113, + 235, + 1113, + 263, + 985, + 263 + ], + "score": 0.89, + "latex": "r _ { 0 } , \\cdots , r _ { m }" + }, + { + "category_id": 14, + "poly": [ + 315, + 1630, + 1380, + 1630, + 1380, + 1752, + 315, + 1752 + ], + "score": 0.88, + "latex": "\\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\bigg ( \\underbrace { \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) } _ { A } + \\underbrace { \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) } _ { B _ { q } } \\bigg ) d x" + }, + { + "category_id": 13, + "poly": [ + 459, + 1021, + 488, + 1021, + 488, + 1050, + 459, + 1050 + ], + "score": 0.88, + "latex": "h _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 989, + 1019, + 1140, + 1019, + 1140, + 1055, + 989, + 1055 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\operatorname* { P r } ( e _ { j , \\ell } \\geq \\frac { t } { B } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1012, + 744, + 1089, + 744, + 1089, + 784, + 1012, + 784 + ], + "score": 0.85, + "latex": "\\begin{array} { r } { q < { \\frac { B } { r } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 1471, + 534, + 1471, + 534, + 1531, + 297, + 1531 + ], + "score": 0.85, + "latex": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 606, + 954, + 1089, + 954, + 1089, + 1021, + 606, + 1021 + ], + "score": 0.85, + "latex": "\\operatorname* { P r } ( e _ { j , \\ell } > \\frac { t } { B } \\mid e _ { j , \\ell } \\leq \\frac { r } { B } ) \\leq \\frac { \\ln ( \\frac { n } { B } ) + \\ln r } { t } ." + }, + { + "category_id": 13, + "poly": [ + 505, + 1751, + 631, + 1751, + 631, + 1811, + 505, + 1811 + ], + "score": 0.85, + "latex": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } A d x } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1013, + 926, + 1042, + 926, + 1042, + 954, + 1013, + 954 + ], + "score": 0.84, + "latex": "h _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 818, + 690, + 1213, + 690, + 1213, + 737, + 818, + 737 + ], + "score": 0.83, + "latex": "\\begin{array} { r } { h _ { \\ell } , \\mathbf { E } [ e _ { j , \\ell } \\mid e _ { j , \\ell } < \\frac { r } { B } ] \\le \\frac { \\ln \\left( \\frac { n } { B } \\right) + \\ln r } { B } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 789, + 927, + 805, + 927, + 805, + 956, + 789, + 956 + ], + "score": 0.82, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 591, + 702, + 607, + 702, + 607, + 732, + 591, + 732 + ], + "score": 0.79, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 537, + 1441, + 554, + 1441, + 554, + 1471, + 537, + 1471 + ], + "score": 0.77, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 610, + 1538, + 1111, + 1538, + 1111, + 1600, + 610, + 1600 + ], + "score": 0.76, + "latex": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 555, + 599, + 702, + 599, + 702, + 633, + 555, + 633 + ], + "score": 0.73, + "latex": "t \\in [ r _ { i } , r _ { i + 1 } )" + }, + { + "category_id": 14, + "poly": [ + 587, + 586, + 1245, + 586, + 1245, + 645, + 587, + 645 + ], + "score": 0.7, + "latex": "\\begin{array} { r } { \\div \\left[ r _ { i } , r _ { i + 1 } \\right) , \\mathrm { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) = O \\Big ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma } r _ { i + 1 } } \\Big ) . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 350, + 1052, + 1298, + 1052, + 1298, + 1416, + 350, + 1416 + ], + "score": 0.67, + "latex": "\\begin{array} { r l } & { \\displaystyle \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { t } { B } ) \\leq \\sum _ { q = i } ^ { m - 1 } \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { r _ { q } } { B } | e _ { j , \\varepsilon } < \\frac { r _ { q + 1 } } { B } ) } \\\\ & { \\qquad \\leq \\displaystyle \\sum _ { q = i } ^ { m - 1 } \\frac { \\ln ( \\frac { n } { B } ) + \\ln r _ { q + 1 } } { r _ { q } } = O ( \\frac { 1 } { \\ln ^ { \\gamma } r _ { i + 1 } } ) \\triangleright \\mathfrak { b y } \\ : ( 9 . 5 ) \\ : \\mathrm { a n d } \\ : \\mathrm { C o r o l l a r y } \\ : 9 . 4 } \\\\ & { \\displaystyle \\operatorname* { s e } , \\ : \\mathrm { f o r } \\ : k \\geq 2 , \\ : } \\\\ & { \\qquad \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) \\leq k \\operatorname* { P r } ( e _ { j , 1 } \\geq \\frac { t } { B } | e _ { j , 1 } < \\frac { r _ { i + 1 } } { B } ) \\Pi _ { \\varepsilon = 2 } ^ { k } \\operatorname* { P r } ( e _ { j , \\varepsilon } \\geq \\frac { t } { B } ) } \\\\ & { \\qquad = O \\Big ( \\frac { k ( \\ln \\frac { ( n ) } { B } + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 1 } } \\Big ) \\triangleright \\mathrm { b y } \\ : ( 9 . 5 ) \\ : \\mathrm { a n d } \\ : ( 9 . 6 ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 605, + 954, + 1088, + 954, + 1088, + 1021, + 605, + 1021 + ], + "score": 0.59, + "latex": "\\operatorname* { P r } ( e _ { j , \\ell } > \\frac { t } { B } \\mid e _ { j , \\ell } \\leq \\frac { r } { B } ) \\leq \\frac { \\ln ( \\frac { n } { B } ) + \\ln r } { t } ." + }, + { + "category_id": 13, + "poly": [ + 536, + 1554, + 600, + 1554, + 600, + 1586, + 536, + 1586 + ], + "score": 0.56, + "latex": "i \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 714, + 587, + 1245, + 587, + 1245, + 645, + 714, + 645 + ], + "score": 0.49, + "latex": "\\begin{array} { r } { \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) = O \\Big ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma } r _ { i + 1 } } \\Big ) . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 422, + 1265, + 1277, + 1265, + 1277, + 1417, + 422, + 1417 + ], + "score": 0.43, + "latex": "\\begin{array} { r l r } { { \\operatorname* { P r } ( e _ { j } \\geq \\frac { t } { B } | e _ { j } < \\frac { r _ { i + 1 } } { B } ) \\leq k \\operatorname* { P r } ( e _ { j , 1 } \\geq \\frac { t } { B } | e _ { j , 1 } < \\frac { r _ { i + 1 } } { B } ) \\Pi _ { \\ell = 2 } ^ { k } \\operatorname* { P r } ( e _ { j , \\ell } \\geq \\frac { t } { B } ) } } \\\\ & { } & { \\qquad = O \\Big ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { t \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 1 } } \\Big ) \\triangleright \\mathfrak b \\mathrm { y } ( 9 . 5 ) \\mathrm { a n d } ( 9 . 6 ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1015, + 745, + 1394, + 745, + 1394, + 783, + 1015, + 783 + ], + "score": 0.42, + "latex": "\\begin{array} { r } { q < \\frac { B } { r } ( \\mathrm { a n d } q \\neq j ) , h _ { \\ell } ( j ) \\neq h _ { \\ell } ( q ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 816, + 700, + 845, + 700, + 845, + 730, + 816, + 730 + ], + "score": 0.37, + "latex": "h _ { \\ell }" + }, + { + "category_id": 13, + "poly": [ + 1146, + 746, + 1216, + 746, + 1216, + 782, + 1146, + 782 + ], + "score": 0.28, + "latex": "q \\neq j ," + }, + { + "category_id": 13, + "poly": [ + 422, + 1244, + 490, + 1244, + 490, + 1273, + 422, + 1273 + ], + "score": 0.27, + "latex": "k \\geq 2" + }, + { + "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, + 871.0, + 2085.0, + 871.0, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1359.0, + 1404.0, + 1359.0, + 1404.0, + 1390.0, + 1376.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 831.0, + 1403.0, + 831.0, + 1403.0, + 860.0, + 1377.0, + 860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1429.0, + 536.0, + 1429.0, + 536.0, + 1482.0, + 288.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 555.0, + 1429.0, + 1082.0, + 1429.0, + 1082.0, + 1482.0, + 555.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 1429.0, + 1234.0, + 1429.0, + 1234.0, + 1482.0, + 1194.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1429.0, + 1407.0, + 1429.0, + 1407.0, + 1482.0, + 1300.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 1464.0, + 369.0, + 1464.0, + 369.0, + 1496.0, + 313.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 535.0, + 1480.0, + 545.0, + 1480.0, + 545.0, + 1526.0, + 535.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 1467.5, + 344.0, + 1467.5, + 344.0, + 1543.0, + 308.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 918.0, + 788.0, + 918.0, + 788.0, + 963.0, + 294.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 918.0, + 1012.0, + 918.0, + 1012.0, + 963.0, + 806.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 918.0, + 1054.0, + 918.0, + 1054.0, + 963.0, + 1043.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 227.0, + 689.0, + 227.0, + 689.0, + 268.0, + 295.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 227.0, + 984.0, + 227.0, + 984.0, + 268.0, + 754.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 227.0, + 1245.0, + 227.0, + 1245.0, + 268.0, + 1114.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 534.0, + 505.0, + 534.0, + 505.0, + 589.0, + 291.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 534.0, + 865.0, + 534.0, + 865.0, + 589.0, + 761.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 534.0, + 1027.0, + 534.0, + 1027.0, + 589.0, + 1013.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1534.0, + 535.0, + 1534.0, + 535.0, + 1602.0, + 294.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 1534.0, + 609.0, + 1534.0, + 609.0, + 1602.0, + 601.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1237.0, + 349.0, + 1237.0, + 349.0, + 1279.0, + 292.0, + 1279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 647.0, + 919.0, + 647.0, + 919.0, + 687.0, + 296.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 522.0, + 1745.0, + 574.0, + 1745.0, + 574.0, + 1775.0, + 522.0, + 1775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1764.0, + 504.0, + 1764.0, + 504.0, + 1799.0, + 296.0, + 1799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 1757.0, + 645.0, + 1757.0, + 645.0, + 1801.0, + 632.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 687.0, + 590.0, + 687.0, + 590.0, + 741.0, + 290.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 687.0, + 815.0, + 687.0, + 815.0, + 741.0, + 608.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1009.0, + 458.0, + 1009.0, + 458.0, + 1062.0, + 292.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 1009.0, + 988.0, + 1009.0, + 988.0, + 1062.0, + 489.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 1009.0, + 1219.0, + 1009.0, + 1219.0, + 1062.0, + 1141.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 585.0, + 554.0, + 585.0, + 554.0, + 650.0, + 284.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 585.0, + 1251.0, + 585.0, + 1251.0, + 650.0, + 1246.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 740.0, + 636.0, + 740.0, + 636.0, + 787.0, + 291.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 740.0, + 1011.0, + 740.0, + 1011.0, + 787.0, + 740.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 740.0, + 1405.0, + 740.0, + 1405.0, + 787.0, + 1395.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 772.0, + 386.0, + 772.0, + 386.0, + 816.0, + 292.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1601.0, + 378.0, + 1601.0, + 378.0, + 1643.0, + 292.0, + 1643.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1458, + 1405, + 1458, + 1405, + 1584, + 296, + 1584 + ], + "score": 0.971 + }, + { + "category_id": 8, + "poly": [ + 325, + 1026, + 1374, + 1026, + 1374, + 1300, + 325, + 1300 + ], + "score": 0.968 + }, + { + "category_id": 8, + "poly": [ + 315, + 669, + 1385, + 669, + 1385, + 935, + 315, + 935 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 290, + 1766, + 1404, + 1766, + 1404, + 1833, + 290, + 1833 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 644, + 1362, + 1055, + 1362, + 1055, + 1436, + 644, + 1436 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 294, + 1589, + 1405, + 1589, + 1405, + 1652, + 294, + 1652 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 295, + 1888, + 1403, + 1888, + 1403, + 1970, + 295, + 1970 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 298, + 960, + 803, + 960, + 803, + 993, + 298, + 993 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 302, + 1299, + 1400, + 1299, + 1400, + 1360, + 302, + 1360 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 298, + 1840, + 1119, + 1840, + 1119, + 1880, + 298, + 1880 + ], + "score": 0.912 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 816, + 74, + 816, + 106, + 298, + 106 + ], + "score": 0.912 + }, + { + "category_id": 9, + "poly": [ + 1330, + 1387, + 1401, + 1387, + 1401, + 1420, + 1330, + 1420 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1330, + 1247, + 1401, + 1247, + 1401, + 1279, + 1330, + 1279 + ], + "score": 0.899 + }, + { + "category_id": 8, + "poly": [ + 312, + 273, + 1341, + 273, + 1341, + 649, + 312, + 649 + ], + "score": 0.889 + }, + { + "category_id": 1, + "poly": [ + 296, + 645, + 383, + 645, + 383, + 673, + 296, + 673 + ], + "score": 0.868 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.864 + }, + { + "category_id": 9, + "poly": [ + 1344, + 594, + 1401, + 594, + 1401, + 625, + 1344, + 625 + ], + "score": 0.845 + }, + { + "category_id": 9, + "poly": [ + 1345, + 876, + 1401, + 876, + 1401, + 906, + 1345, + 906 + ], + "score": 0.827 + }, + { + "category_id": 2, + "poly": [ + 1374, + 1681, + 1402, + 1681, + 1402, + 1709, + 1374, + 1709 + ], + "score": 0.777 + }, + { + "category_id": 1, + "poly": [ + 296, + 223, + 774, + 223, + 774, + 279, + 296, + 279 + ], + "score": 0.698 + }, + { + "category_id": 2, + "poly": [ + 1375, + 913, + 1402, + 913, + 1402, + 941, + 1375, + 941 + ], + "score": 0.612 + }, + { + "category_id": 8, + "poly": [ + 518, + 1656, + 1178, + 1656, + 1178, + 1744, + 518, + 1744 + ], + "score": 0.259 + }, + { + "category_id": 14, + "poly": [ + 321, + 278, + 1346, + 278, + 1346, + 655, + 321, + 655 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } { \\displaystyle \\int _ { \\frac { r _ { * } } { \\mathtt { B } } } ^ { r _ { * + 1 } } } & { \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) d x = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * + 1 } } { B } } \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { q + 1 } ) } { r _ { q } \\ln ^ { \\gamma ( k - 1 ) } r _ { q + 1 } } ) d x } \\\\ & { \\quad \\quad = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * + 1 } } { B } } \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } O ( \\frac { k } { \\ln ^ { \\gamma k } r _ { q + 1 } } ) d x \\quad \\mathrm { ~ \\mathrm { [ s ~ b y ~ ( } 9 . 3 \\mathrm { ) } ~ } } \\\\ & { \\quad = \\displaystyle \\int _ { \\frac { r _ { * } } { B } } ^ { \\frac { r _ { * } } { B } } O ( \\frac { k } { \\ln ^ { \\gamma k } r _ { i + 2 } } ) d x \\quad \\mathrm { ~ [ s ~ b y ~ C o r o l l a r y ~ } 9 . 4 } \\\\ & { \\quad = O ( \\frac { k r _ { i + 1 } } { B \\ln ^ { \\gamma k } r _ { i + 2 } } ) = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 2 } ) } { B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 2 } } ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 646, + 1355, + 1055, + 1355, + 1055, + 1436, + 646, + 1436 + ], + "score": 0.94, + "latex": "\\mathbf { E } [ e _ { j } ] = O ( r _ { 0 } / B ) = O ( \\frac { \\ln ^ { \\frac { k + 2 } { k - 1 } } ( \\frac { n } { B } ) } { B } )" + }, + { + "category_id": 14, + "poly": [ + 518, + 1650, + 1177, + 1650, + 1177, + 1747, + 518, + 1747 + ], + "score": 0.93, + "latex": "\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { C M } ) ] = \\sum _ { j = 1 } ^ { n } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } = O ( \\frac { \\ln ^ { \\frac { k + 2 } { k - 1 } } \\left( \\frac { n } { B } \\right) } { B } \\cdot \\ln n ) ." + }, + { + "category_id": 14, + "poly": [ + 313, + 668, + 1380, + 668, + 1380, + 938, + 313, + 938 + ], + "score": 0.93, + "latex": "\\begin{array} { r l r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\operatorname* { P r } ( e _ { j } \\geq x ) d x = \\displaystyle \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\displaystyle \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } & \\\\ { \\displaystyle \\qquad \\quad = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) + O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 2 } ) } { B \\ln ^ { \\gamma ( k - 1 ) } r _ { i + 2 } } ) } & { \\mathrm { > b y ~ ( 9 . 7 ) - ( 9 . 8 ) } } \\\\ { \\displaystyle \\qquad } & { \\displaystyle \\quad = O ( \\frac { k ( \\ln ( \\frac { n } { B } ) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \\mathrm { > b y ~ ( 9 . 3 ) } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1098, + 1924, + 1393, + 1924, + 1393, + 1972, + 1098, + 1972 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { k ( 1 - \\frac { 1 } { ( B / k ) } ) ^ { 2 ( \\frac { B } { k } ) \\ln k } \\le \\frac { 1 } { k } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 329, + 1026, + 1371, + 1026, + 1371, + 1304, + 329, + 1304 + ], + "score": 0.93, + "latex": "\\begin{array} { l l } { \\displaystyle \\mathbf { E } [ e _ { j } ] \\leq O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\Big ( \\operatorname* { P r } ( e _ { j } \\geq x | e _ { j } < \\frac { r _ { i + 1 } } { B } ) + \\sum _ { q = i + 1 } ^ { m - 1 } \\operatorname* { P r } ( e _ { j } \\geq \\frac { r _ { q } } { B } | e _ { j } < \\frac { r _ { q + 1 } } { B } ) \\Big ) d x } \\\\ { \\displaystyle \\qquad = O ( \\frac { r _ { 0 } } { B } ) + \\sum _ { i = 0 } ^ { m - 1 } O ( \\frac { k ( \\ln \\left( \\frac { n } { B } \\right) + \\ln r _ { i + 1 } ) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { i + 1 } } ) } & { \\mathrm { ~ \\Rightarrow ~ b y ~ ( 9 . 9 ) ~ } } \\\\ { \\displaystyle \\qquad = O ( \\frac { r _ { 0 } } { B } ) + O ( k \\frac { \\ln \\left( \\frac { n } { B } \\right) } { B \\ln ^ { \\gamma ( k - 1 ) - 1 } r _ { 1 } } ) + O ( \\frac { k } { B \\ln ^ { \\gamma ( k - 1 ) - 2 } r _ { 1 } } ) } & { \\mathrm { ~ ( 9 . I ~ } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 977, + 1888, + 1135, + 1888, + 1135, + 1927, + 977, + 1927 + ], + "score": 0.92, + "latex": "2 \\big ( \\frac { B } { k } \\big ) \\ln k + 1" + }, + { + "category_id": 13, + "poly": [ + 1102, + 1299, + 1271, + 1299, + 1271, + 1333, + 1102, + 1333 + ], + "score": 0.92, + "latex": "\\gamma = 3 / ( k - 1 )" + }, + { + "category_id": 13, + "poly": [ + 854, + 1931, + 980, + 1931, + 980, + 1962, + 854, + 1962 + ], + "score": 0.92, + "latex": "h _ { 1 } , \\cdots , h _ { k }" + }, + { + "category_id": 13, + "poly": [ + 844, + 1490, + 1054, + 1490, + 1054, + 1547, + 844, + 1547 + ], + "score": 0.92, + "latex": "O ( \\frac { \\ln n \\ln ^ { \\frac { k + 2 } { k - 1 } } ( n / B ) } { B } )" + }, + { + "category_id": 13, + "poly": [ + 352, + 1544, + 672, + 1544, + 672, + 1584, + 352, + 1584 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { \\mathcal { F } } } _ { C M } ) ] = O ( \\frac { \\ln n } { n } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1259, + 1509, + 1393, + 1509, + 1393, + 1544, + 1259, + 1544 + ], + "score": 0.9, + "latex": "B = \\Theta ( n )" + }, + { + "category_id": 13, + "poly": [ + 579, + 1301, + 782, + 1301, + 782, + 1333, + 579, + 1333 + ], + "score": 0.9, + "latex": "\\gamma ( k - 1 ) - 2 \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 676, + 1839, + 1110, + 1839, + 1110, + 1880, + 676, + 1880 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { , \\operatorname* { P r } [ e _ { j } \\geq 1 / ( 2 ( \\frac { B } { k } ) \\ln k + 1 ) ] \\geq 1 - \\frac { 1 } { k } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1323, + 1300, + 1393, + 1300, + 1393, + 1330, + 1323, + 1330 + ], + "score": 0.9, + "latex": "k \\geq 2" + }, + { + "category_id": 13, + "poly": [ + 490, + 1799, + 613, + 1799, + 613, + 1833, + 490, + 1833 + ], + "score": 0.9, + "latex": "( \\boldsymbol { k } \\times \\boldsymbol { B } / k ) ." + }, + { + "category_id": 13, + "poly": [ + 995, + 1461, + 1074, + 1461, + 1074, + 1489, + 995, + 1489 + ], + "score": 0.89, + "latex": "k \\times B" + }, + { + "category_id": 13, + "poly": [ + 1146, + 1461, + 1227, + 1461, + 1227, + 1492, + 1146, + 1492 + ], + "score": 0.84, + "latex": "k \\geq 2 ," + }, + { + "category_id": 13, + "poly": [ + 1206, + 1770, + 1232, + 1770, + 1232, + 1796, + 1206, + 1796 + ], + "score": 0.82, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 543, + 1894, + 559, + 1894, + 559, + 1924, + 543, + 1924 + ], + "score": 0.81, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 414, + 223, + 650, + 223, + 650, + 281, + 414, + 281 + ], + "score": 0.79, + "latex": "\\begin{array} { r } { \\int _ { \\frac { r _ { i } } { B } } ^ { \\frac { r _ { i + 1 } } { B } } \\sum _ { q = i + 1 } ^ { m - 1 } B _ { q } d x } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 520, + 1333, + 535, + 1333, + 535, + 1361, + 520, + 1361 + ], + "score": 0.77, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 664, + 1845, + 679, + 1845, + 679, + 1876, + 664, + 1876 + ], + "score": 0.46, + "latex": "j" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.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, + 2124.0, + 832.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1378.0, + 1685.0, + 1402.0, + 1685.0, + 1402.0, + 1712.0, + 1378.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 913.0, + 1403.0, + 913.0, + 1403.0, + 946.0, + 1377.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1453.0, + 994.0, + 1453.0, + 994.0, + 1500.0, + 293.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 1453.0, + 1145.0, + 1453.0, + 1145.0, + 1500.0, + 1075.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1228.0, + 1453.0, + 1406.0, + 1453.0, + 1406.0, + 1500.0, + 1228.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 1486.0, + 843.0, + 1486.0, + 843.0, + 1559.0, + 284.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 1486.0, + 1258.0, + 1486.0, + 1258.0, + 1559.0, + 1055.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1486.0, + 1414.0, + 1486.0, + 1414.0, + 1559.0, + 1394.0, + 1559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 1527.0, + 976.0, + 1527.0, + 976.0, + 1552.0, + 951.0, + 1552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1541.0, + 351.0, + 1541.0, + 351.0, + 1589.0, + 293.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 1541.0, + 684.0, + 1541.0, + 684.0, + 1589.0, + 673.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1766.0, + 1205.0, + 1766.0, + 1205.0, + 1803.0, + 293.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 1766.0, + 1405.0, + 1766.0, + 1405.0, + 1803.0, + 1233.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1798.0, + 489.0, + 1798.0, + 489.0, + 1836.0, + 292.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 1798.0, + 1282.0, + 1798.0, + 1282.0, + 1836.0, + 614.0, + 1836.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": [ + 293.0, + 1617.0, + 1256.0, + 1617.0, + 1256.0, + 1659.0, + 293.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1886.0, + 542.0, + 1886.0, + 542.0, + 1926.0, + 295.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 1886.0, + 976.0, + 1886.0, + 976.0, + 1926.0, + 560.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1886.0, + 1404.0, + 1886.0, + 1404.0, + 1926.0, + 1136.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1910.0, + 853.0, + 1910.0, + 853.0, + 1980.0, + 289.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 1910.0, + 1097.0, + 1910.0, + 1097.0, + 1980.0, + 981.0, + 1980.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 1915.5, + 1408.0, + 1915.5, + 1408.0, + 1975.0, + 1227.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 958.0, + 803.0, + 958.0, + 803.0, + 997.0, + 295.0, + 997.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1293.0, + 578.0, + 1293.0, + 578.0, + 1336.0, + 294.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 1293.0, + 1101.0, + 1293.0, + 1101.0, + 1336.0, + 783.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 1293.0, + 1322.0, + 1293.0, + 1322.0, + 1336.0, + 1272.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1293.0, + 1405.0, + 1293.0, + 1405.0, + 1336.0, + 1394.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1324.0, + 519.0, + 1324.0, + 519.0, + 1366.0, + 297.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 536.0, + 1324.0, + 548.0, + 1324.0, + 548.0, + 1366.0, + 536.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1834.0, + 663.0, + 1834.0, + 663.0, + 1886.0, + 294.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 1834.0, + 1118.0, + 1834.0, + 1118.0, + 1886.0, + 1111.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 641.0, + 385.0, + 641.0, + 385.0, + 683.0, + 295.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 651.0, + 234.0, + 778.0, + 234.0, + 778.0, + 274.0, + 651.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 229.5, + 460.0, + 229.5, + 460.0, + 284.0, + 292.0, + 284.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1137, + 1405, + 1137, + 1405, + 1267, + 297, + 1267 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 297, + 1273, + 1405, + 1273, + 1405, + 1389, + 297, + 1389 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 297, + 1923, + 1405, + 1923, + 1405, + 2004, + 297, + 2004 + ], + "score": 0.963 + }, + { + "category_id": 8, + "poly": [ + 458, + 1458, + 1239, + 1458, + 1239, + 1684, + 458, + 1684 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 485, + 449, + 1211, + 449, + 1211, + 597, + 485, + 597 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 299, + 794, + 1406, + 794, + 1406, + 890, + 299, + 890 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 292, + 226, + 1404, + 226, + 1404, + 300, + 292, + 300 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 297, + 1818, + 1406, + 1818, + 1406, + 1915, + 297, + 1915 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 296, + 1685, + 1403, + 1685, + 1403, + 1746, + 296, + 1746 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 294, + 310, + 1403, + 310, + 1403, + 393, + 294, + 393 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 295, + 1393, + 1401, + 1393, + 1401, + 1455, + 295, + 1455 + ], + "score": 0.93 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 816, + 74, + 816, + 106, + 298, + 106 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 293, + 969, + 1403, + 969, + 1403, + 1045, + 293, + 1045 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 297, + 399, + 1250, + 399, + 1250, + 447, + 297, + 447 + ], + "score": 0.912 + }, + { + "category_id": 1, + "poly": [ + 290, + 1049, + 1402, + 1049, + 1402, + 1116, + 290, + 1116 + ], + "score": 0.91 + }, + { + "category_id": 0, + "poly": [ + 299, + 915, + 733, + 915, + 733, + 948, + 299, + 948 + ], + "score": 0.909 + }, + { + "category_id": 1, + "poly": [ + 301, + 716, + 1403, + 716, + 1403, + 788, + 301, + 788 + ], + "score": 0.906 + }, + { + "category_id": 1, + "poly": [ + 297, + 612, + 1406, + 612, + 1406, + 709, + 297, + 709 + ], + "score": 0.897 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 866, + 2088, + 866, + 2113, + 836, + 2113 + ], + "score": 0.869 + }, + { + "category_id": 2, + "poly": [ + 1374, + 545, + 1403, + 545, + 1403, + 575, + 1374, + 575 + ], + "score": 0.813 + }, + { + "category_id": 0, + "poly": [ + 297, + 1768, + 1234, + 1768, + 1234, + 1804, + 297, + 1804 + ], + "score": 0.61 + }, + { + "category_id": 1, + "poly": [ + 297, + 1768, + 1234, + 1768, + 1234, + 1804, + 297, + 1804 + ], + "score": 0.38 + }, + { + "category_id": 13, + "poly": [ + 995, + 310, + 1094, + 310, + 1094, + 351, + 995, + 351 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 457, + 1449, + 1247, + 1449, + 1247, + 1689, + 457, + 1689 + ], + "score": 0.93, + "latex": "\\begin{array} { l } { { \\displaystyle { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { F } } _ { L - C M } ) ] = \\sum _ { j \\in [ n ] } { \\bf E } [ e _ { j } ] \\cdot f _ { j } } \\ ~ } \\\\ { { \\displaystyle ~ = \\sum _ { j > B _ { r } } { \\bf E } [ e _ { j } ] \\cdot f _ { j } \\quad \\triangleright \\forall j \\le B _ { r } , e _ { j } = 0 } \\ ~ } \\\\ { { \\displaystyle ~ < \\frac { ( \\ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } } \\quad } { \\displaystyle \\triangleright \\mathrm { B y ~ O b s e r v a t i o n ~ } } 9 . 1 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 510, + 1305, + 688, + 1305, + 688, + 1353, + 510, + 1353 + ], + "score": 0.93, + "latex": "\\frac { ( \\ln ( n / B _ { r } ) + 0 . 5 8 ) ^ { 2 } } { B - B _ { r } }" + }, + { + "category_id": 13, + "poly": [ + 774, + 347, + 877, + 347, + 877, + 394, + 774, + 394 + ], + "score": 0.93, + "latex": "\\frac { ( k - 1 ) \\ln { n } } { 2 B \\ln { k } + k }" + }, + { + "category_id": 13, + "poly": [ + 717, + 1080, + 904, + 1080, + 904, + 1115, + 717, + 1115 + ], + "score": 0.93, + "latex": "B _ { r } \\leq ( \\phi \\ln n ) ^ { - 1 }" + }, + { + "category_id": 13, + "poly": [ + 600, + 717, + 730, + 717, + 730, + 752, + 600, + 752 + ], + "score": 0.93, + "latex": "B = \\Theta ( n )" + }, + { + "category_id": 13, + "poly": [ + 703, + 853, + 800, + 853, + 800, + 891, + 703, + 891 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 1198, + 441, + 1198, + 441, + 1238, + 297, + 1238 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { k \\times \\left( \\frac { B ^ { \\star } - B _ { r } } { k } \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 777, + 1233, + 868, + 1233, + 868, + 1267, + 777, + 1267 + ], + "score": 0.93, + "latex": "( B _ { r } , B )" + }, + { + "category_id": 13, + "poly": [ + 999, + 613, + 1090, + 613, + 1090, + 652, + 999, + 652 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { k \\times \\left( \\frac { B } { k } \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 898, + 1233, + 1092, + 1233, + 1092, + 1267, + 898, + 1267 + ], + "score": 0.93, + "latex": "B _ { r } + B = O ( B )" + }, + { + "category_id": 13, + "poly": [ + 807, + 668, + 913, + 668, + 913, + 709, + 807, + 709 + ], + "score": 0.92, + "latex": "\\Omega \\big ( \\frac { k \\ln n } { B \\ln k } \\big )" + }, + { + "category_id": 13, + "poly": [ + 1158, + 1924, + 1248, + 1924, + 1248, + 1958, + 1158, + 1958 + ], + "score": 0.92, + "latex": "( B _ { r } , B )" + }, + { + "category_id": 13, + "poly": [ + 298, + 751, + 384, + 751, + 384, + 789, + 298, + 789 + ], + "score": 0.92, + "latex": "\\Theta \\big ( \\textstyle { \\frac { \\ln n } { B } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 933, + 972, + 1143, + 972, + 1143, + 1006, + 933, + 1006 + ], + "score": 0.92, + "latex": "\\mathcal { T } = \\{ i _ { 1 } , \\cdots , i _ { n } \\}" + }, + { + "category_id": 13, + "poly": [ + 660, + 227, + 732, + 227, + 732, + 267, + 660, + 267 + ], + "score": 0.92, + "latex": "\\textstyle 1 - { \\frac { 1 } { k } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1312, + 389, + 1312, + 389, + 1348, + 298, + 1348 + ], + "score": 0.92, + "latex": "( B _ { r } , B )" + }, + { + "category_id": 13, + "poly": [ + 1055, + 649, + 1269, + 649, + 1269, + 710, + 1055, + 710 + ], + "score": 0.92, + "latex": "O ( \\frac { k \\ln n \\ln ^ { \\frac { k + 2 } { k - 1 } } ( \\frac { k n } { B } ) } { B } )" + }, + { + "category_id": 13, + "poly": [ + 1084, + 855, + 1138, + 855, + 1138, + 889, + 1084, + 889 + ], + "score": 0.92, + "latex": "B / k" + }, + { + "category_id": 13, + "poly": [ + 298, + 1008, + 441, + 1008, + 441, + 1044, + 298, + 1044 + ], + "score": 0.91, + "latex": "\\langle f _ { 1 } , \\cdots , f _ { n } \\rangle" + }, + { + "category_id": 13, + "poly": [ + 298, + 263, + 456, + 263, + 456, + 303, + 298, + 303 + ], + "score": 0.91, + "latex": "2 ( \\textstyle { \\frac { B } { k } } ) \\ln k + 1" + }, + { + "category_id": 13, + "poly": [ + 411, + 1082, + 527, + 1082, + 527, + 1115, + 411, + 1115 + ], + "score": 0.91, + "latex": "1 / ( \\phi \\ln n )" + }, + { + "category_id": 13, + "poly": [ + 956, + 825, + 1032, + 825, + 1032, + 854, + 956, + 854 + ], + "score": 0.91, + "latex": "k \\times B" + }, + { + "category_id": 13, + "poly": [ + 788, + 717, + 909, + 717, + 909, + 752, + 788, + 752 + ], + "score": 0.91, + "latex": "k = O ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 378, + 1714, + 447, + 1714, + 447, + 1742, + 378, + 1742 + ], + "score": 0.91, + "latex": "k = 1" + }, + { + "category_id": 13, + "poly": [ + 703, + 400, + 1155, + 400, + 1155, + 450, + 703, + 450 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathbf { E } [ e _ { j } ] \\geq ( 1 - \\frac { 1 } { k } ) \\frac { 1 } { 2 ( \\frac { B } { k } ) \\ln k + 1 } = \\frac { k - 1 } { 2 B \\ln k + k } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 1427, + 376, + 1427, + 376, + 1459, + 298, + 1459 + ], + "score": 0.9, + "latex": "e _ { j } = 0" + }, + { + "category_id": 13, + "poly": [ + 298, + 1350, + 363, + 1350, + 363, + 1390, + 298, + 1390 + ], + "score": 0.9, + "latex": "O ( { \\textstyle { \\frac { 1 } { n } } } )" + }, + { + "category_id": 13, + "poly": [ + 1305, + 1395, + 1392, + 1395, + 1392, + 1427, + 1305, + 1427 + ], + "score": 0.9, + "latex": "j \\le B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 1088, + 1850, + 1142, + 1850, + 1142, + 1880, + 1088, + 1880 + ], + "score": 0.9, + "latex": "\\mathsf { H H } _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 984, + 1139, + 1074, + 1139, + 1074, + 1172, + 984, + 1172 + ], + "score": 0.89, + "latex": "( B _ { r } , B )" + }, + { + "category_id": 13, + "poly": [ + 912, + 225, + 940, + 225, + 940, + 265, + 912, + 265 + ], + "score": 0.89, + "latex": "\\tilde { f } _ { j }" + }, + { + "category_id": 13, + "poly": [ + 1287, + 1819, + 1342, + 1819, + 1342, + 1849, + 1287, + 1849 + ], + "score": 0.89, + "latex": "\\mathsf { H H } _ { \\delta }" + }, + { + "category_id": 13, + "poly": [ + 643, + 1396, + 678, + 1396, + 678, + 1425, + 643, + 1425 + ], + "score": 0.88, + "latex": "B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 1346, + 966, + 1404, + 966, + 1404, + 1006, + 1346, + 1006 + ], + "score": 0.88, + "latex": "{ \\vec { f } } =" + }, + { + "category_id": 13, + "poly": [ + 528, + 1963, + 582, + 1963, + 582, + 1996, + 528, + 1996 + ], + "score": 0.87, + "latex": "\\mathsf { H H } _ { \\delta }" + }, + { + "category_id": 13, + "poly": [ + 512, + 1847, + 1013, + 1847, + 1013, + 1888, + 512, + 1888 + ], + "score": 0.86, + "latex": "\\begin{array} { r } { , \\dot { \\operatorname* { P r } } \\left( \\mathsf { H } \\mathsf { H } _ { \\delta } ( j , \\frac { 1 } { B _ { r } \\ln n } ) \\neq \\mathsf { H } \\mathsf { H } _ { 0 } ( j , \\frac { 1 } { B _ { r } \\ln n } ) \\right) \\leq \\delta } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 854, + 1005, + 993, + 1005, + 993, + 1044, + 854, + 1044 + ], + "score": 0.84, + "latex": "f _ { j } \\geq \\phi | | { \\vec { f } } | | _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 594, + 1955, + 1147, + 1955, + 1147, + 2004, + 594, + 2004 + ], + "score": 0.84, + "latex": "\\begin{array} { r } { { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , \\tilde { \\mathcal { F } } _ { ( L - C M , \\delta ) } ) ] = O ( \\frac { \\delta ^ { 2 } \\ln ^ { 2 } B _ { r } + \\ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1142, + 1309, + 1405, + 1309, + 1405, + 1349, + 1142, + 1349 + ], + "score": 0.82, + "latex": "\\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { L - C M } ) ] =" + }, + { + "category_id": 13, + "poly": [ + 609, + 1011, + 628, + 1011, + 628, + 1042, + 609, + 1042 + ], + "score": 0.82, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 1225, + 1052, + 1244, + 1052, + 1244, + 1083, + 1225, + 1083 + ], + "score": 0.82, + "latex": "\\phi" + }, + { + "category_id": 13, + "poly": [ + 998, + 857, + 1024, + 857, + 1024, + 883, + 998, + 883 + ], + "score": 0.8, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 521, + 1203, + 540, + 1203, + 540, + 1230, + 521, + 1230 + ], + "score": 0.79, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 487, + 974, + 508, + 974, + 508, + 1005, + 487, + 1005 + ], + "score": 0.79, + "latex": "\\dot { \\phi }" + }, + { + "category_id": 13, + "poly": [ + 1088, + 1140, + 1123, + 1140, + 1123, + 1170, + 1088, + 1170 + ], + "score": 0.76, + "latex": "B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 542, + 1012, + 559, + 1012, + 559, + 1042, + 542, + 1042 + ], + "score": 0.76, + "latex": "j" + }, + { + "category_id": 14, + "poly": [ + 484, + 433, + 1216, + 433, + 1216, + 598, + 484, + 598 + ], + "score": 0.73, + "latex": "\\begin{array} { r l } { { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\mathcal { \\tilde { F } } _ { C M } ) ] = \\sum _ { j \\in [ n ] } ^ { } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } } \\\\ & { \\geq ( \\frac { k - 1 } { 2 B \\ln k + k } ) \\ln n \\quad \\triangleright \\mathrm { B y ~ O b s e r v a t i o n } 9 . 1 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 874, + 1052, + 895, + 1052, + 895, + 1078, + 874, + 1078 + ], + "score": 0.69, + "latex": "\\mathcal { T }" + }, + { + "category_id": 13, + "poly": [ + 894, + 1313, + 1130, + 1313, + 1130, + 1348, + 894, + 1348 + ], + "score": 0.68, + "latex": "B _ { r } = \\Theta ( B ) = \\Theta ( n )" + }, + { + "category_id": 13, + "poly": [ + 494, + 1851, + 510, + 1851, + 510, + 1882, + 494, + 1882 + ], + "score": 0.64, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 806, + 1010, + 828, + 1010, + 828, + 1037, + 806, + 1037 + ], + "score": 0.37, + "latex": "\\mathcal { T }" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.0, + 109.0, + 296.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 914.0, + 734.0, + 914.0, + 734.0, + 951.0, + 294.0, + 951.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": [ + 1376.0, + 548.0, + 1404.0, + 548.0, + 1404.0, + 579.0, + 1376.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1768.0, + 1233.0, + 1768.0, + 1233.0, + 1806.0, + 293.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1139.0, + 983.0, + 1139.0, + 983.0, + 1172.0, + 295.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 1139.0, + 1087.0, + 1139.0, + 1087.0, + 1172.0, + 1075.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 1139.0, + 1405.0, + 1139.0, + 1405.0, + 1172.0, + 1124.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1171.0, + 1405.0, + 1171.0, + 1405.0, + 1201.0, + 296.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 442.0, + 1192.0, + 520.0, + 1192.0, + 520.0, + 1244.0, + 442.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1192.0, + 1410.0, + 1192.0, + 1410.0, + 1244.0, + 541.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1232.0, + 776.0, + 1232.0, + 776.0, + 1268.0, + 292.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 1232.0, + 897.0, + 1232.0, + 897.0, + 1268.0, + 869.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 1232.0, + 1103.0, + 1232.0, + 1103.0, + 1268.0, + 1093.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1272.0, + 1405.0, + 1272.0, + 1405.0, + 1309.0, + 295.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1292.0, + 297.0, + 1292.0, + 297.0, + 1359.0, + 287.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 1292.0, + 509.0, + 1292.0, + 509.0, + 1359.0, + 390.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 1292.0, + 893.0, + 1292.0, + 893.0, + 1359.0, + 689.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 1292.0, + 1141.0, + 1292.0, + 1141.0, + 1359.0, + 1131.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1406.0, + 1292.0, + 1411.0, + 1292.0, + 1411.0, + 1359.0, + 1406.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1342.0, + 297.0, + 1342.0, + 297.0, + 1399.0, + 290.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 1342.0, + 382.0, + 1342.0, + 382.0, + 1399.0, + 364.0, + 1399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1918.0, + 1157.0, + 1918.0, + 1157.0, + 1962.0, + 294.0, + 1962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1249.0, + 1918.0, + 1403.0, + 1918.0, + 1403.0, + 1962.0, + 1249.0, + 1962.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1947.0, + 527.0, + 1947.0, + 527.0, + 2010.0, + 287.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 1947.0, + 593.0, + 1947.0, + 593.0, + 2010.0, + 583.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 1947.0, + 1166.0, + 1947.0, + 1166.0, + 2010.0, + 1148.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 792.0, + 1407.0, + 792.0, + 1407.0, + 830.0, + 294.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 822.0, + 955.0, + 822.0, + 955.0, + 859.0, + 293.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 822.0, + 1406.0, + 822.0, + 1406.0, + 859.0, + 1033.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 854.0, + 702.0, + 854.0, + 702.0, + 891.0, + 293.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 854.0, + 997.0, + 854.0, + 997.0, + 891.0, + 801.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 854.0, + 1083.0, + 854.0, + 1083.0, + 891.0, + 1025.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 854.0, + 1149.0, + 854.0, + 1149.0, + 891.0, + 1139.0, + 891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 855.0, + 1404.0, + 855.0, + 1404.0, + 886.0, + 1373.0, + 886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 221.0, + 659.0, + 221.0, + 659.0, + 277.0, + 290.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 221.0, + 911.0, + 221.0, + 911.0, + 277.0, + 733.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 941.0, + 221.0, + 1411.0, + 221.0, + 1411.0, + 277.0, + 941.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 262.0, + 297.0, + 262.0, + 297.0, + 305.0, + 294.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 457.0, + 262.0, + 632.0, + 262.0, + 632.0, + 305.0, + 457.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1380.0, + 275.0, + 1400.0, + 275.0, + 1400.0, + 289.0, + 1380.0, + 289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1816.0, + 1286.0, + 1816.0, + 1286.0, + 1854.0, + 295.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1816.0, + 1406.0, + 1816.0, + 1406.0, + 1854.0, + 1343.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1841.0, + 493.0, + 1841.0, + 493.0, + 1896.0, + 287.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1014.0, + 1841.0, + 1087.0, + 1841.0, + 1087.0, + 1896.0, + 1014.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 1841.0, + 1411.0, + 1841.0, + 1411.0, + 1896.0, + 1143.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1883.0, + 800.0, + 1883.0, + 800.0, + 1917.0, + 296.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1682.0, + 1403.0, + 1682.0, + 1403.0, + 1717.0, + 295.0, + 1717.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1712.0, + 377.0, + 1712.0, + 377.0, + 1747.0, + 295.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1712.0, + 733.0, + 1712.0, + 733.0, + 1747.0, + 448.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1374.0, + 1714.0, + 1405.0, + 1714.0, + 1405.0, + 1746.0, + 1374.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 310.0, + 994.0, + 310.0, + 994.0, + 349.0, + 293.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 310.0, + 1404.0, + 310.0, + 1404.0, + 349.0, + 1095.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 347.0, + 773.0, + 347.0, + 773.0, + 396.0, + 290.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 878.0, + 347.0, + 889.0, + 347.0, + 889.0, + 396.0, + 878.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1387.0, + 642.0, + 1387.0, + 642.0, + 1433.0, + 293.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 1387.0, + 1304.0, + 1387.0, + 1304.0, + 1433.0, + 679.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1387.0, + 1406.0, + 1387.0, + 1406.0, + 1433.0, + 1393.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1423.0, + 297.0, + 1423.0, + 297.0, + 1460.0, + 291.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 377.0, + 1423.0, + 476.0, + 1423.0, + 476.0, + 1460.0, + 377.0, + 1460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 964.0, + 486.0, + 964.0, + 486.0, + 1010.0, + 291.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 964.0, + 932.0, + 964.0, + 932.0, + 1010.0, + 509.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 964.0, + 1345.0, + 964.0, + 1345.0, + 1010.0, + 1144.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 442.0, + 1004.0, + 541.0, + 1004.0, + 541.0, + 1047.0, + 442.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 560.0, + 1004.0, + 608.0, + 1004.0, + 608.0, + 1047.0, + 560.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1004.0, + 805.0, + 1004.0, + 805.0, + 1047.0, + 629.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 1004.0, + 853.0, + 1004.0, + 853.0, + 1047.0, + 829.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 994.0, + 1004.0, + 1003.0, + 1004.0, + 1003.0, + 1047.0, + 994.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 392.0, + 702.0, + 392.0, + 702.0, + 459.0, + 287.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 392.0, + 1261.0, + 392.0, + 1261.0, + 459.0, + 1156.0, + 459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1045.0, + 873.0, + 1045.0, + 873.0, + 1088.0, + 293.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 896.0, + 1045.0, + 1224.0, + 1045.0, + 1224.0, + 1088.0, + 896.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 1045.0, + 1405.0, + 1045.0, + 1405.0, + 1088.0, + 1245.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1076.0, + 410.0, + 1076.0, + 410.0, + 1120.0, + 292.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 1076.0, + 716.0, + 1076.0, + 716.0, + 1120.0, + 528.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1076.0, + 915.0, + 1076.0, + 915.0, + 1120.0, + 905.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 714.0, + 599.0, + 714.0, + 599.0, + 756.0, + 294.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 731.0, + 714.0, + 787.0, + 714.0, + 787.0, + 756.0, + 731.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 714.0, + 1407.0, + 714.0, + 1407.0, + 756.0, + 910.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 740.0, + 297.0, + 740.0, + 297.0, + 800.0, + 289.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 740.0, + 403.0, + 740.0, + 403.0, + 800.0, + 385.0, + 800.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 606.0, + 998.0, + 606.0, + 998.0, + 657.0, + 294.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1091.0, + 606.0, + 1407.0, + 606.0, + 1407.0, + 657.0, + 1091.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 648.0, + 1285.0, + 648.0, + 1285.0, + 705.0, + 1270.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 664.0, + 806.0, + 664.0, + 806.0, + 713.0, + 295.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.0, + 664.0, + 1054.0, + 664.0, + 1054.0, + 713.0, + 914.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 656.5, + 1216.0, + 656.5, + 1216.0, + 692.5, + 1080.0, + 692.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1768.0, + 1233.0, + 1768.0, + 1233.0, + 1806.0, + 293.0, + 1806.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1228, + 1406, + 1228, + 1406, + 1415, + 297, + 1415 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 295, + 1537, + 1405, + 1537, + 1405, + 1668, + 295, + 1668 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1029, + 1406, + 1029, + 1406, + 1157, + 297, + 1157 + ], + "score": 0.971 + }, + { + "category_id": 8, + "poly": [ + 328, + 465, + 1375, + 465, + 1375, + 772, + 328, + 772 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 293, + 228, + 1400, + 228, + 1400, + 291, + 293, + 291 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 423, + 1451, + 1272, + 1451, + 1272, + 1528, + 423, + 1528 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 444, + 292, + 1254, + 292, + 1254, + 357, + 444, + 357 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 300, + 357, + 1405, + 357, + 1405, + 417, + 300, + 417 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 296, + 430, + 962, + 430, + 962, + 463, + 296, + 463 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 296, + 956, + 1408, + 956, + 1408, + 1022, + 296, + 1022 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 816, + 74, + 816, + 105, + 298, + 105 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 292, + 911, + 1288, + 911, + 1288, + 946, + 292, + 946 + ], + "score": 0.918 + }, + { + "category_id": 9, + "poly": [ + 1330, + 309, + 1400, + 309, + 1400, + 340, + 1330, + 340 + ], + "score": 0.876 + }, + { + "category_id": 1, + "poly": [ + 297, + 790, + 1403, + 790, + 1403, + 859, + 297, + 859 + ], + "score": 0.875 + }, + { + "category_id": 0, + "poly": [ + 299, + 1180, + 1234, + 1180, + 1234, + 1214, + 299, + 1214 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2112, + 836, + 2112 + ], + "score": 0.86 + }, + { + "category_id": 2, + "poly": [ + 1374, + 720, + 1403, + 720, + 1403, + 749, + 1374, + 749 + ], + "score": 0.804 + }, + { + "category_id": 1, + "poly": [ + 299, + 1701, + 1405, + 1701, + 1405, + 1860, + 299, + 1860 + ], + "score": 0.589 + }, + { + "category_id": 8, + "poly": [ + 334, + 1861, + 1367, + 1861, + 1367, + 1930, + 334, + 1930 + ], + "score": 0.468 + }, + { + "category_id": 1, + "poly": [ + 295, + 1932, + 1411, + 1932, + 1411, + 2043, + 295, + 2043 + ], + "score": 0.396 + }, + { + "category_id": 8, + "poly": [ + 348, + 1702, + 1356, + 1702, + 1356, + 1782, + 348, + 1782 + ], + "score": 0.21 + }, + { + "category_id": 14, + "poly": [ + 325, + 460, + 1301, + 460, + 1301, + 776, + 325, + 776 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } { \\mathbf { E } [ \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { ( L - C M , \\delta ) } ^ { * } ) ] = \\displaystyle \\sum _ { j \\in [ n ] } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } & { } \\\\ & { < \\delta \\displaystyle \\sum _ { j \\leq B _ { r } } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } + \\displaystyle \\sum _ { j > B _ { r } } \\mathbf { E } [ e _ { j } ] \\cdot f _ { j } } \\\\ & { \\leq O ( \\delta \\cdot \\ln B _ { r } + \\ln ( n / B _ { r } ) ) \\cdot O ( \\frac { \\delta \\ln B _ { r } + \\ln ( n / B _ { r } ) } { B - B _ { r } } ) \\quad \\mapsto \\mathbf { B } \\mathbf { y } } \\\\ & { \\leq O ( \\frac { \\delta ^ { 2 } \\ln ^ { 2 } B _ { r } + \\ln ^ { 2 } ( n / B _ { r } ) } { B - B _ { r } } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 605, + 792, + 854, + 792, + 854, + 826, + 605, + 826 + ], + "score": 0.93, + "latex": "B _ { r } = \\Theta ( B ) = \\Theta ( n )" + }, + { + "category_id": 13, + "poly": [ + 769, + 1539, + 867, + 1539, + 867, + 1571, + 769, + 1571 + ], + "score": 0.93, + "latex": "B \\geq \\gamma n" + }, + { + "category_id": 13, + "poly": [ + 1040, + 1291, + 1141, + 1291, + 1141, + 1324, + 1040, + 1324 + ], + "score": 0.92, + "latex": "( 1 + \\alpha ) B" + }, + { + "category_id": 13, + "poly": [ + 1076, + 1095, + 1155, + 1095, + 1155, + 1128, + 1076, + 1128 + ], + "score": 0.92, + "latex": "O ( B _ { r } )" + }, + { + "category_id": 14, + "poly": [ + 349, + 1701, + 1348, + 1701, + 1348, + 1782, + 349, + 1782 + ], + "score": 0.92, + "latex": "\\mathbf E [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { 1 } { \\alpha \\gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\frac { ( k - 1 ) \\ln n } { 2 ( 1 + \\alpha ) B \\ln k + k } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf E [ \\mathrm { E r r } _ { C M } ] ," + }, + { + "category_id": 13, + "poly": [ + 539, + 1634, + 621, + 1634, + 621, + 1667, + 539, + 1667 + ], + "score": 0.92, + "latex": "( 1 + \\varepsilon )" + }, + { + "category_id": 13, + "poly": [ + 485, + 1352, + 600, + 1352, + 600, + 1382, + 485, + 1382 + ], + "score": 0.92, + "latex": "B _ { r } = \\alpha B" + }, + { + "category_id": 13, + "poly": [ + 1249, + 1031, + 1375, + 1031, + 1375, + 1062, + 1249, + 1062 + ], + "score": 0.92, + "latex": "h _ { 1 } , \\cdots , h _ { k }" + }, + { + "category_id": 14, + "poly": [ + 424, + 1450, + 1275, + 1450, + 1275, + 1528, + 424, + 1528 + ], + "score": 0.92, + "latex": "\\mathbf { E } [ \\mathrm { E r r } _ { C M } ] \\geq \\frac { ( k - 1 ) \\ln n } { 2 ( 1 + \\alpha ) B \\ln ( k ) + k } , \\quad \\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { n } { \\alpha B } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } ." + }, + { + "category_id": 13, + "poly": [ + 298, + 1060, + 464, + 1060, + 464, + 1099, + 298, + 1099 + ], + "score": 0.92, + "latex": "\\overset { \\triangledown } { O } ( \\boldsymbol { k } \\cdot \\big ( \\frac { \\boldsymbol { B } - \\boldsymbol { B } _ { r } } { k } \\big ) \\big )" + }, + { + "category_id": 13, + "poly": [ + 424, + 1567, + 798, + 1567, + 798, + 1607, + 424, + 1607 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf { E } [ \\mathrm { E r r } _ { C M } ] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1159, + 953, + 1277, + 953, + 1277, + 993, + 1159, + 993 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { k \\cdot \\left( \\frac { B - B _ { r } } { k } \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 825, + 387, + 825, + 387, + 861, + 298, + 861 + ], + "score": 0.91, + "latex": "O ( 1 / n )" + }, + { + "category_id": 13, + "poly": [ + 1305, + 989, + 1372, + 989, + 1372, + 1022, + 1305, + 1022 + ], + "score": 0.91, + "latex": "O ( B )" + }, + { + "category_id": 13, + "poly": [ + 547, + 1785, + 1142, + 1785, + 1142, + 1832, + 547, + 1832 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { ( 0 . 5 8 - \\ln \\alpha - \\ln \\gamma ) ^ { 2 } \\leq \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + ( \\frac { k } { B } ) ) } \\cdot \\ln n } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 443, + 290, + 1252, + 290, + 1252, + 359, + 443, + 359 + ], + "score": 0.89, + "latex": "\\mathbf { E } [ \\acute { e _ { j } } ] \\leq \\delta \\cdot ( \\frac { \\ln B _ { r } + 1 } { B - B _ { r } } ) + ( \\frac { \\ln ( n / B _ { r } ) \\acute { + } 1 } { B - B _ { r } } ) = O ( \\frac { \\delta \\ln B _ { r } + \\ln \\acute { ( } n / B _ { r } ) } { B - B _ { r } } ) ," + }, + { + "category_id": 13, + "poly": [ + 791, + 1096, + 827, + 1096, + 827, + 1125, + 791, + 1125 + ], + "score": 0.89, + "latex": "B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 999, + 232, + 1035, + 232, + 1035, + 261, + 999, + 261 + ], + "score": 0.89, + "latex": "B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 1198, + 1065, + 1235, + 1065, + 1235, + 1094, + 1198, + 1094 + ], + "score": 0.88, + "latex": "B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 495, + 1936, + 1113, + 1936, + 1113, + 1987, + 495, + 1987 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\ln \\gamma = - \\ln \\alpha + 0 . 5 8 - \\sqrt { \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + ( \\frac { k } { B } ) ) } \\cdot \\ln n } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 448, + 1096, + 502, + 1096, + 502, + 1125, + 448, + 1125 + ], + "score": 0.87, + "latex": "\\mathsf { H H } _ { \\delta }" + }, + { + "category_id": 13, + "poly": [ + 1256, + 1938, + 1405, + 1938, + 1405, + 1977, + 1256, + 1977 + ], + "score": 0.86, + "latex": "\\alpha = { \\textstyle \\frac { 1 } { 2 } } , \\gamma \\leq" + }, + { + "category_id": 13, + "poly": [ + 307, + 990, + 343, + 990, + 343, + 1020, + 307, + 1020 + ], + "score": 0.85, + "latex": "B _ { r }" + }, + { + "category_id": 13, + "poly": [ + 1332, + 1544, + 1353, + 1544, + 1353, + 1571, + 1332, + 1571 + ], + "score": 0.82, + "latex": "\\gamma" + }, + { + "category_id": 13, + "poly": [ + 880, + 264, + 897, + 264, + 897, + 292, + 880, + 292 + ], + "score": 0.81, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 941, + 1322, + 960, + 1322, + 960, + 1348, + 941, + 1348 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 14, + "poly": [ + 334, + 1857, + 1361, + 1857, + 1361, + 1930, + 334, + 1930 + ], + "score": 0.78, + "latex": "\\ln ^ { 2 } \\gamma + 2 ( \\ln \\alpha - 0 . 5 8 ) \\ln \\gamma + ( ( \\ln \\alpha - 0 . 5 8 ) ^ { 2 } - { \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + { ( \\frac { k } { B } ) } ) } } \\cdot \\ln n ) \\le 0 ." + }, + { + "category_id": 13, + "poly": [ + 910, + 788, + 1406, + 788, + 1406, + 829, + 910, + 829 + ], + "score": 0.74, + "latex": "\\delta = { \\cal O } ( 1 / \\ln n ) , { \\bf E } [ \\mathrm { E r r } ( { \\mathcal F } , { \\tilde { \\mathcal { F } } } _ { ( L - C M , \\delta ) } ) ] =" + }, + { + "category_id": 13, + "poly": [ + 614, + 262, + 630, + 262, + 630, + 289, + 614, + 289 + ], + "score": 0.67, + "latex": "\\delta" + }, + { + "category_id": 14, + "poly": [ + 297, + 1980, + 526, + 1980, + 526, + 2044, + 297, + 2044 + ], + "score": 0.62, + "latex": "\\begin{array} { r } { \\frac { 3 . 5 8 } { e \\sqrt { \\frac { ( k - 1 ) \\ln { n } } { 2 ( 1 + \\varepsilon ) ( 3 \\ln { k } + ( k / B ) ) } } } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 911, + 791, + 1090, + 791, + 1090, + 827, + 911, + 827 + ], + "score": 0.52, + "latex": "\\delta = { \\cal O } ( 1 / \\ln n )" + }, + { + "category_id": 13, + "poly": [ + 336, + 1855, + 1358, + 1855, + 1358, + 1930, + 336, + 1930 + ], + "score": 0.37, + "latex": "\\ln ^ { 2 } \\gamma + 2 ( \\ln \\alpha - 0 . 5 8 ) \\ln \\gamma + ( ( \\ln \\alpha - 0 . 5 8 ) ^ { 2 } - { \\frac { ( k - 1 ) ( 1 - \\alpha ) } { ( 1 + \\varepsilon ) ( 2 ( 1 + \\alpha ) \\ln k + ( { \\frac { k } { B } } ) ) } } \\cdot \\ln n ) \\le 0 ." + }, + { + "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, + 1179.0, + 1237.0, + 1179.0, + 1237.0, + 1217.0, + 294.0, + 1217.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": [ + 1376.0, + 720.0, + 1404.0, + 720.0, + 1404.0, + 754.0, + 1376.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1228.0, + 1406.0, + 1228.0, + 1406.0, + 1263.0, + 292.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1261.0, + 1404.0, + 1261.0, + 1404.0, + 1293.0, + 296.0, + 1293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1291.0, + 1039.0, + 1291.0, + 1039.0, + 1327.0, + 295.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 1291.0, + 1404.0, + 1291.0, + 1404.0, + 1327.0, + 1142.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1322.0, + 940.0, + 1322.0, + 940.0, + 1354.0, + 296.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 961.0, + 1322.0, + 1403.0, + 1322.0, + 1403.0, + 1354.0, + 961.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1352.0, + 484.0, + 1352.0, + 484.0, + 1384.0, + 295.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 1352.0, + 1404.0, + 1352.0, + 1404.0, + 1384.0, + 601.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1382.0, + 1071.0, + 1382.0, + 1071.0, + 1415.0, + 294.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1538.0, + 768.0, + 1538.0, + 768.0, + 1571.0, + 295.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1538.0, + 1331.0, + 1538.0, + 1331.0, + 1571.0, + 868.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1354.0, + 1538.0, + 1405.0, + 1538.0, + 1405.0, + 1571.0, + 1354.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1556.0, + 423.0, + 1556.0, + 423.0, + 1616.0, + 287.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 1556.0, + 1416.0, + 1556.0, + 1416.0, + 1616.0, + 799.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1601.0, + 1404.0, + 1601.0, + 1404.0, + 1636.0, + 293.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1633.0, + 538.0, + 1633.0, + 538.0, + 1666.0, + 295.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 1633.0, + 632.0, + 1633.0, + 632.0, + 1666.0, + 622.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1028.0, + 1248.0, + 1028.0, + 1248.0, + 1066.0, + 292.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1028.0, + 1407.0, + 1028.0, + 1407.0, + 1066.0, + 1376.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1051.0, + 297.0, + 1051.0, + 297.0, + 1107.0, + 294.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1051.0, + 1197.0, + 1051.0, + 1197.0, + 1107.0, + 465.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 1051.0, + 1410.0, + 1051.0, + 1410.0, + 1107.0, + 1236.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1094.0, + 447.0, + 1094.0, + 447.0, + 1131.0, + 292.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 1094.0, + 790.0, + 1094.0, + 790.0, + 1131.0, + 503.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1094.0, + 1075.0, + 1094.0, + 1075.0, + 1131.0, + 828.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1156.0, + 1094.0, + 1407.0, + 1094.0, + 1407.0, + 1131.0, + 1156.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1125.0, + 1101.0, + 1125.0, + 1101.0, + 1158.0, + 294.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 1124.0, + 1406.0, + 1124.0, + 1406.0, + 1155.0, + 1373.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 226.0, + 998.0, + 226.0, + 998.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 226.0, + 1403.0, + 226.0, + 1403.0, + 267.0, + 1036.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 258.0, + 613.0, + 258.0, + 613.0, + 299.0, + 293.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 631.0, + 258.0, + 879.0, + 258.0, + 879.0, + 299.0, + 631.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 258.0, + 1187.0, + 258.0, + 1187.0, + 299.0, + 898.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 355.0, + 1404.0, + 355.0, + 1404.0, + 389.0, + 296.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 386.0, + 1043.0, + 386.0, + 1043.0, + 421.0, + 295.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 430.0, + 963.0, + 430.0, + 963.0, + 464.0, + 296.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 944.0, + 306.0, + 944.0, + 306.0, + 1027.0, + 288.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 344.0, + 944.0, + 1158.0, + 944.0, + 1158.0, + 1027.0, + 344.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1278.0, + 944.0, + 1304.0, + 944.0, + 1304.0, + 1027.0, + 1278.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 944.0, + 1411.0, + 944.0, + 1411.0, + 1027.0, + 1373.0, + 1027.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 907.0, + 1291.0, + 907.0, + 1291.0, + 955.0, + 291.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 781.0, + 604.0, + 781.0, + 604.0, + 834.0, + 292.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 781.0, + 909.0, + 781.0, + 909.0, + 834.0, + 855.0, + 834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 816.0, + 297.0, + 816.0, + 297.0, + 869.0, + 291.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 816.0, + 404.0, + 816.0, + 404.0, + 869.0, + 388.0, + 869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1349.0, + 1697.0, + 1353.0, + 1697.0, + 1353.0, + 1788.0, + 1349.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1775.0, + 546.0, + 1775.0, + 546.0, + 1834.0, + 292.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 1775.0, + 1403.0, + 1775.0, + 1403.0, + 1834.0, + 1143.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1826.0, + 626.0, + 1826.0, + 626.0, + 1864.0, + 295.0, + 1864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1928.0, + 494.0, + 1928.0, + 494.0, + 1987.0, + 292.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1928.0, + 1255.0, + 1928.0, + 1255.0, + 1987.0, + 1114.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 527.0, + 2001.0, + 531.0, + 2001.0, + 531.0, + 2015.0, + 527.0, + 2015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2013.0, + 296.0, + 2013.0, + 296.0, + 2047.0, + 293.0, + 2047.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1769, + 1405, + 1769, + 1405, + 1959, + 296, + 1959 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 296, + 1004, + 1405, + 1004, + 1405, + 1161, + 296, + 1161 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 1313, + 1406, + 1313, + 1406, + 1423, + 297, + 1423 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 369, + 875, + 1403, + 875, + 1403, + 966, + 369, + 966 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 293, + 228, + 1403, + 228, + 1403, + 295, + 293, + 295 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 299, + 1431, + 1396, + 1431, + 1396, + 1539, + 299, + 1539 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 667, + 1956, + 1011, + 1956, + 1011, + 2030, + 667, + 2030 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 369, + 743, + 1403, + 743, + 1403, + 834, + 369, + 834 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 297, + 1689, + 1403, + 1689, + 1403, + 1756, + 297, + 1756 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 294, + 1242, + 1402, + 1242, + 1402, + 1307, + 294, + 1307 + ], + "score": 0.94 + }, + { + "category_id": 8, + "poly": [ + 441, + 1542, + 1257, + 1542, + 1257, + 1688, + 441, + 1688 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 371, + 334, + 1403, + 334, + 1403, + 427, + 371, + 427 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 367, + 612, + 1402, + 612, + 1402, + 706, + 367, + 706 + ], + "score": 0.926 + }, + { + "category_id": 0, + "poly": [ + 301, + 1189, + 744, + 1189, + 744, + 1226, + 301, + 1226 + ], + "score": 0.913 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 816, + 74, + 816, + 105, + 299, + 105 + ], + "score": 0.911 + }, + { + "category_id": 9, + "poly": [ + 1330, + 1623, + 1400, + 1623, + 1400, + 1656, + 1330, + 1656 + ], + "score": 0.896 + }, + { + "category_id": 1, + "poly": [ + 396, + 505, + 1400, + 505, + 1400, + 578, + 396, + 578 + ], + "score": 0.882 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.873 + }, + { + "category_id": 8, + "poly": [ + 452, + 427, + 1344, + 427, + 1344, + 503, + 452, + 503 + ], + "score": 0.801 + }, + { + "category_id": 8, + "poly": [ + 452, + 428, + 1346, + 428, + 1346, + 503, + 452, + 503 + ], + "score": 0.22 + }, + { + "category_id": 13, + "poly": [ + 631, + 876, + 807, + 876, + 807, + 923, + 631, + 923 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\gamma \\le \\frac { 2 } { e ^ { \\sqrt { ( \\ln n ) / 2 . 6 } } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 841, + 1843, + 1033, + 1843, + 1033, + 1889, + 841, + 1889 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { f ( h ( i ^ { * } ) ) > \\frac { f ( I ) } { B _ { I } } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 700, + 745, + 880, + 745, + 880, + 792, + 700, + 792 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\gamma \\le \\frac { 2 } { e \\sqrt { ( \\ln n ) / 3 . 5 } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 631, + 614, + 806, + 614, + 806, + 661, + 631, + 661 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\gamma \\le \\frac { 3 . 5 8 } { e ^ { \\sqrt { ( \\ln n ) / 4 . 5 } } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 675, + 1717, + 826, + 1717, + 826, + 1756, + 675, + 1756 + ], + "score": 0.93, + "latex": "\\sum { _ { b \\in B _ { I } } \\hat { f ( b ) ^ { 2 } } }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1885, + 438, + 1885, + 438, + 1932, + 297, + 1932 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { f ( \\overline { { b } } ) < \\frac { f ( I ) } { B _ { I } } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 667, + 1955, + 1014, + 1955, + 1014, + 2031, + 667, + 2031 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\overline { { h } } ( i ) = \\left\\{ \\begin{array} { l l } { h ^ { * } ( i ) } & { \\mathrm { i f ~ } i \\in I \\setminus I ^ { * } } \\\\ { \\overline { { b } } } & { \\mathrm { o t h e r w i s e . } } \\end{array} \\right. } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 947, + 657, + 1066, + 657, + 1066, + 705, + 947, + 705 + ], + "score": 0.93, + "latex": "\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 4 . 5 } } }" + }, + { + "category_id": 13, + "poly": [ + 1033, + 787, + 1152, + 787, + 1152, + 835, + 1033, + 835 + ], + "score": 0.93, + "latex": "\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 3 . 5 } } }" + }, + { + "category_id": 13, + "poly": [ + 610, + 1274, + 726, + 1274, + 726, + 1307, + 610, + 1307 + ], + "score": 0.93, + "latex": "C [ 1 \\cdots B ]" + }, + { + "category_id": 13, + "poly": [ + 948, + 918, + 1066, + 918, + 1066, + 966, + 948, + 966 + ], + "score": 0.93, + "latex": "\\frac { 5 . 3 7 n } { e ^ { \\sqrt { ( \\ln n ) / 2 . 6 } } }" + }, + { + "category_id": 13, + "poly": [ + 832, + 1769, + 881, + 1769, + 881, + 1816, + 832, + 1816 + ], + "score": 0.93, + "latex": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }" + }, + { + "category_id": 13, + "poly": [ + 611, + 1379, + 660, + 1379, + 660, + 1425, + 611, + 1425 + ], + "score": 0.93, + "latex": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }" + }, + { + "category_id": 13, + "poly": [ + 729, + 1843, + 778, + 1843, + 778, + 1889, + 729, + 1889 + ], + "score": 0.93, + "latex": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }" + }, + { + "category_id": 13, + "poly": [ + 821, + 1346, + 998, + 1346, + 998, + 1380, + 821, + 1380 + ], + "score": 0.93, + "latex": "\\{ h : I [ B _ { I } ] \\}" + }, + { + "category_id": 13, + "poly": [ + 446, + 542, + 620, + 542, + 620, + 577, + 446, + 577 + ], + "score": 0.92, + "latex": "\\gamma = \\Theta ( 1 / \\ln n )" + }, + { + "category_id": 13, + "poly": [ + 748, + 1433, + 812, + 1433, + 812, + 1466, + 748, + 1466 + ], + "score": 0.92, + "latex": "f _ { h } ( b )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1811, + 393, + 1811, + 393, + 1847, + 297, + 1847 + ], + "score": 0.92, + "latex": "I \\setminus \\{ i ^ { * } \\}" + }, + { + "category_id": 13, + "poly": [ + 574, + 1432, + 684, + 1432, + 684, + 1466, + 574, + 1466 + ], + "score": 0.91, + "latex": "b \\in \\ [ B _ { I } ]" + }, + { + "category_id": 13, + "poly": [ + 1188, + 366, + 1272, + 366, + 1272, + 400, + 1188, + 400 + ], + "score": 0.91, + "latex": "( 1 + \\varepsilon )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1346, + 391, + 1346, + 391, + 1383, + 297, + 1383 + ], + "score": 0.91, + "latex": "\\textstyle \\sum _ { i \\in I } f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 335, + 1462, + 608, + 1462, + 608, + 1501, + 335, + 1501 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\dot { f } ( b ) : = \\sum _ { i \\in I : h ( i ) = b } f _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 729, + 1315, + 783, + 1315, + 783, + 1348, + 729, + 1348 + ], + "score": 0.91, + "latex": "f ( I )" + }, + { + "category_id": 13, + "poly": [ + 1101, + 1500, + 1306, + 1500, + 1306, + 1539, + 1101, + 1539 + ], + "score": 0.91, + "latex": "\\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { h } ( I ) )" + }, + { + "category_id": 13, + "poly": [ + 1059, + 1068, + 1217, + 1068, + 1217, + 1100, + 1059, + 1100 + ], + "score": 0.9, + "latex": "( ( 1 + \\alpha ) B , n )" + }, + { + "category_id": 13, + "poly": [ + 720, + 1035, + 1080, + 1035, + 1080, + 1068, + 720, + 1068 + ], + "score": 0.9, + "latex": "( ( 1 + \\alpha ) B = 2 0 M , n = 3 3 . 5 M )" + }, + { + "category_id": 13, + "poly": [ + 396, + 336, + 473, + 336, + 473, + 364, + 396, + 364 + ], + "score": 0.89, + "latex": "\\mathbf k = \\mathbf 1" + }, + { + "category_id": 13, + "poly": [ + 396, + 747, + 538, + 747, + 538, + 783, + 396, + 783 + ], + "score": 0.89, + "latex": "k \\in \\{ 3 , 4 \\}" + }, + { + "category_id": 13, + "poly": [ + 1135, + 1035, + 1404, + 1035, + 1404, + 1067, + 1135, + 1067 + ], + "score": 0.89, + "latex": "( ( 1 + \\alpha ) B = 5 \\bar { 0 } M , n =" + }, + { + "category_id": 13, + "poly": [ + 429, + 1068, + 500, + 1068, + 500, + 1095, + 429, + 1095 + ], + "score": 0.88, + "latex": "k = 3" + }, + { + "category_id": 13, + "poly": [ + 297, + 1097, + 519, + 1097, + 519, + 1128, + 297, + 1128 + ], + "score": 0.88, + "latex": "2 8 8 K , n \\ = \\ 5 6 3 K )" + }, + { + "category_id": 13, + "poly": [ + 396, + 618, + 476, + 618, + 476, + 646, + 396, + 646 + ], + "score": 0.88, + "latex": "k = 2" + }, + { + "category_id": 13, + "poly": [ + 365, + 1273, + 399, + 1273, + 399, + 1307, + 365, + 1307 + ], + "score": 0.88, + "latex": "[ n ]" + }, + { + "category_id": 13, + "poly": [ + 396, + 879, + 476, + 879, + 476, + 912, + 396, + 912 + ], + "score": 0.88, + "latex": "\\mathbf { \\delta } _ { k } \\geq \\mathbf { 5 }" + }, + { + "category_id": 13, + "poly": [ + 296, + 1503, + 811, + 1503, + 811, + 1541, + 296, + 1541 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { h } ( I ) ) : = \\sum _ { i \\in I } f _ { i } \\cdot \\left( f ( h ( i ) ) - i \\right) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1340, + 1776, + 1405, + 1776, + 1405, + 1810, + 1340, + 1810 + ], + "score": 0.87, + "latex": "I ^ { * } \\subseteq" + }, + { + "category_id": 13, + "poly": [ + 757, + 1813, + 788, + 1813, + 788, + 1840, + 757, + 1840 + ], + "score": 0.87, + "latex": "h ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 692, + 1928, + 722, + 1928, + 722, + 1955, + 692, + 1955 + ], + "score": 0.87, + "latex": "h ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 810, + 504, + 1235, + 504, + 1235, + 545, + 810, + 545 + ], + "score": 0.86, + "latex": "( \\ln ( \\textstyle \\frac { 2 } { \\gamma } ) + 0 . 5 8 ) ^ { 2 } \\leq 3 . 1 8 \\cdot ( \\ln ^ { 2 } n - 1 . 6 5 )" + }, + { + "category_id": 13, + "poly": [ + 1109, + 262, + 1215, + 262, + 1215, + 292, + 1109, + 292 + ], + "score": 0.86, + "latex": "\\varepsilon = 0 . 0 6 " + }, + { + "category_id": 13, + "poly": [ + 533, + 1852, + 558, + 1852, + 558, + 1878, + 533, + 1878 + ], + "score": 0.85, + "latex": "i ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 377, + 1851, + 405, + 1851, + 405, + 1879, + 377, + 1879 + ], + "score": 0.85, + "latex": "b ^ { * }" + }, + { + "category_id": 14, + "poly": [ + 440, + 1537, + 1261, + 1537, + 1261, + 1691, + 440, + 1691 + ], + "score": 0.84, + "latex": "\\begin{array} { r } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\widetilde { \\mathcal { F } _ { h } } ( I ) ) = \\displaystyle \\sum _ { i \\in I } f _ { i } \\cdot ( f ( h ( i ) ) - f _ { i } ) = \\displaystyle \\sum _ { i \\in I } f _ { i } \\cdot f ( h ( i ) ) - \\displaystyle \\sum _ { i \\in I } f _ { i } ^ { 2 } } \\\\ { = \\displaystyle \\sum _ { b \\in [ B _ { I } ] } f ( b ) ^ { 2 } - \\displaystyle \\sum _ { i \\in I } f _ { i } ^ { 2 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 538, + 1778, + 564, + 1778, + 564, + 1804, + 538, + 1804 + ], + "score": 0.84, + "latex": "i ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1235, + 750, + 1260, + 750, + 1260, + 776, + 1235, + 776 + ], + "score": 0.83, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 716, + 232, + 734, + 232, + 734, + 258, + 716, + 258 + ], + "score": 0.82, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1369, + 1894, + 1400, + 1894, + 1400, + 1921, + 1369, + 1921 + ], + "score": 0.82, + "latex": "h ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1155, + 619, + 1179, + 619, + 1179, + 645, + 1155, + 645 + ], + "score": 0.82, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 1155, + 881, + 1179, + 881, + 1179, + 907, + 1155, + 907 + ], + "score": 0.82, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 1344, + 1068, + 1405, + 1068, + 1405, + 1097, + 1344, + 1097 + ], + "score": 0.82, + "latex": "B =" + }, + { + "category_id": 13, + "poly": [ + 902, + 1691, + 921, + 1691, + 921, + 1716, + 902, + 1716 + ], + "score": 0.81, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 1302, + 1314, + 1403, + 1314, + 1403, + 1349, + 1302, + 1349 + ], + "score": 0.81, + "latex": "f ( I ) : =" + }, + { + "category_id": 13, + "poly": [ + 868, + 1892, + 888, + 1892, + 888, + 1921, + 868, + 1921 + ], + "score": 0.81, + "latex": "\\bar { h }" + }, + { + "category_id": 13, + "poly": [ + 1225, + 1465, + 1245, + 1465, + 1245, + 1491, + 1225, + 1491 + ], + "score": 0.8, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 1279, + 1848, + 1294, + 1848, + 1294, + 1878, + 1279, + 1878 + ], + "score": 0.8, + "latex": "\\bar { b }" + }, + { + "category_id": 13, + "poly": [ + 1041, + 1013, + 1061, + 1013, + 1061, + 1033, + 1041, + 1033 + ], + "score": 0.76, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1312, + 1435, + 1328, + 1435, + 1328, + 1461, + 1312, + 1461 + ], + "score": 0.75, + "latex": "b" + }, + { + "category_id": 13, + "poly": [ + 746, + 401, + 767, + 401, + 767, + 427, + 746, + 427 + ], + "score": 0.74, + "latex": "\\gamma" + }, + { + "category_id": 14, + "poly": [ + 454, + 425, + 1342, + 425, + 1342, + 505, + 454, + 505 + ], + "score": 0.69, + "latex": "\\mathbf { E } [ \\mathrm { E r r } _ { L - C M } ] \\leq \\frac { ( \\ln ( \\frac { 1 } { \\alpha \\gamma } ) + 0 . 5 8 ) ^ { 2 } } { ( 1 - \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\frac { \\ln ^ { 2 } n - 1 . 6 5 } { ( 1 + \\alpha ) B } \\leq \\frac { 1 } { 1 + \\varepsilon } \\cdot \\mathbf { E } [ \\mathrm { E r r } _ { h } ] ," + }, + { + "category_id": 13, + "poly": [ + 658, + 1317, + 675, + 1317, + 675, + 1343, + 658, + 1343 + ], + "score": 0.65, + "latex": "I" + }, + { + "category_id": 13, + "poly": [ + 297, + 1066, + 366, + 1066, + 366, + 1096, + 297, + 1096 + ], + "score": 0.64, + "latex": "9 4 M )" + }, + { + "category_id": 13, + "poly": [ + 1107, + 1388, + 1125, + 1388, + 1125, + 1414, + 1107, + 1414 + ], + "score": 0.62, + "latex": "I" + }, + { + "category_id": 13, + "poly": [ + 297, + 1465, + 316, + 1465, + 316, + 1492, + 297, + 1492 + ], + "score": 0.37, + "latex": "h" + }, + { + "category_id": 13, + "poly": [ + 1267, + 1317, + 1285, + 1317, + 1285, + 1343, + 1267, + 1343 + ], + "score": 0.32, + "latex": "I" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1187.0, + 747.0, + 1187.0, + 747.0, + 1230.0, + 297.0, + 1230.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": [ + 832.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2122.0, + 832.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1768.0, + 537.0, + 1768.0, + 537.0, + 1820.0, + 293.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 1768.0, + 831.0, + 1768.0, + 831.0, + 1820.0, + 565.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 1768.0, + 1339.0, + 1768.0, + 1339.0, + 1820.0, + 882.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1808.0, + 756.0, + 1808.0, + 756.0, + 1848.0, + 394.0, + 1848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 1808.0, + 1406.0, + 1808.0, + 1406.0, + 1848.0, + 789.0, + 1848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1832.0, + 296.0, + 1832.0, + 296.0, + 1942.0, + 291.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 1832.0, + 532.0, + 1832.0, + 532.0, + 1942.0, + 439.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1832.0, + 728.0, + 1832.0, + 728.0, + 1942.0, + 559.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 779.0, + 1832.0, + 840.0, + 1832.0, + 840.0, + 1942.0, + 779.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 1832.0, + 1278.0, + 1832.0, + 1278.0, + 1942.0, + 1034.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 1832.0, + 1368.0, + 1832.0, + 1368.0, + 1942.0, + 1295.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1832.0, + 1413.0, + 1832.0, + 1413.0, + 1942.0, + 1401.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1927.0, + 691.0, + 1927.0, + 691.0, + 1960.0, + 295.0, + 1960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 1927.0, + 735.0, + 1927.0, + 735.0, + 1960.0, + 723.0, + 1960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 1907.0, + 429.0, + 1907.0, + 429.0, + 1935.0, + 398.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1004.0, + 1040.0, + 1004.0, + 1040.0, + 1038.0, + 295.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 1004.0, + 1402.0, + 1004.0, + 1402.0, + 1038.0, + 1062.0, + 1038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1032.0, + 719.0, + 1032.0, + 719.0, + 1072.0, + 293.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 1032.0, + 1134.0, + 1032.0, + 1134.0, + 1072.0, + 1081.0, + 1072.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 1064.0, + 428.0, + 1064.0, + 428.0, + 1101.0, + 367.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 501.0, + 1064.0, + 1058.0, + 1064.0, + 1058.0, + 1101.0, + 501.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 1064.0, + 1343.0, + 1064.0, + 1343.0, + 1101.0, + 1218.0, + 1101.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1093.0, + 296.0, + 1093.0, + 296.0, + 1132.0, + 293.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 1093.0, + 1406.0, + 1093.0, + 1406.0, + 1132.0, + 520.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1128.0, + 882.0, + 1128.0, + 882.0, + 1161.0, + 295.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1312.0, + 657.0, + 1312.0, + 657.0, + 1351.0, + 295.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 1312.0, + 728.0, + 1312.0, + 728.0, + 1351.0, + 676.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1312.0, + 1266.0, + 1312.0, + 1266.0, + 1351.0, + 784.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 1312.0, + 1301.0, + 1312.0, + 1301.0, + 1351.0, + 1286.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1343.0, + 296.0, + 1343.0, + 296.0, + 1385.0, + 291.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1343.0, + 820.0, + 1343.0, + 820.0, + 1385.0, + 392.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 1343.0, + 1408.0, + 1343.0, + 1408.0, + 1385.0, + 999.0, + 1385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1376.0, + 610.0, + 1376.0, + 610.0, + 1428.0, + 295.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 1376.0, + 1106.0, + 1376.0, + 1106.0, + 1428.0, + 661.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 1376.0, + 1137.0, + 1376.0, + 1137.0, + 1428.0, + 1126.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 875.0, + 395.0, + 875.0, + 395.0, + 918.0, + 367.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 875.0, + 630.0, + 875.0, + 630.0, + 918.0, + 477.0, + 918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 808.0, + 878.0, + 1154.0, + 878.0, + 1154.0, + 913.0, + 808.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 878.0, + 1403.0, + 878.0, + 1403.0, + 913.0, + 1180.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 922.0, + 947.0, + 922.0, + 947.0, + 955.0, + 395.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.0, + 890.5, + 811.0, + 890.5, + 811.0, + 925.5, + 682.0, + 925.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 943.0, + 935.0, + 1078.0, + 935.0, + 1078.0, + 969.5, + 943.0, + 969.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 230.0, + 715.0, + 230.0, + 715.0, + 263.0, + 296.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 230.0, + 1405.0, + 230.0, + 1405.0, + 263.0, + 735.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 260.0, + 1108.0, + 260.0, + 1108.0, + 297.0, + 293.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 260.0, + 1230.0, + 260.0, + 1230.0, + 297.0, + 1216.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1426.0, + 573.0, + 1426.0, + 573.0, + 1469.0, + 294.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 1426.0, + 747.0, + 1426.0, + 747.0, + 1469.0, + 685.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 1426.0, + 1311.0, + 1426.0, + 1311.0, + 1469.0, + 813.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1329.0, + 1426.0, + 1402.0, + 1426.0, + 1402.0, + 1469.0, + 1329.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1455.0, + 296.0, + 1455.0, + 296.0, + 1506.0, + 290.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1455.0, + 334.0, + 1455.0, + 334.0, + 1506.0, + 317.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 1455.0, + 1224.0, + 1455.0, + 1224.0, + 1506.0, + 609.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 1455.0, + 1407.0, + 1455.0, + 1407.0, + 1506.0, + 1246.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 812.0, + 1498.0, + 1100.0, + 1498.0, + 1100.0, + 1546.0, + 812.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 1498.0, + 1345.0, + 1498.0, + 1345.0, + 1546.0, + 1307.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 743.0, + 395.0, + 743.0, + 395.0, + 786.0, + 367.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 539.0, + 743.0, + 699.0, + 743.0, + 699.0, + 786.0, + 539.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 747.0, + 1234.0, + 747.0, + 1234.0, + 783.0, + 881.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 747.0, + 1405.0, + 747.0, + 1405.0, + 783.0, + 1261.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 792.0, + 1032.0, + 792.0, + 1032.0, + 823.0, + 395.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.25, + 761.0, + 884.25, + 761.0, + 884.25, + 795.5, + 755.25, + 795.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 804.0, + 1161.0, + 804.0, + 1161.0, + 838.5, + 1028.0, + 838.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1686.0, + 901.0, + 1686.0, + 901.0, + 1723.0, + 295.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 1686.0, + 1404.0, + 1686.0, + 1404.0, + 1723.0, + 922.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1712.0, + 674.0, + 1712.0, + 674.0, + 1759.0, + 290.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1712.0, + 840.0, + 1712.0, + 840.0, + 1759.0, + 827.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1237.0, + 1407.0, + 1237.0, + 1407.0, + 1282.0, + 292.0, + 1282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1271.0, + 364.0, + 1271.0, + 364.0, + 1311.0, + 294.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 1271.0, + 609.0, + 1271.0, + 609.0, + 1311.0, + 400.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 727.0, + 1271.0, + 737.0, + 1271.0, + 737.0, + 1311.0, + 727.0, + 1311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 333.0, + 395.0, + 333.0, + 395.0, + 371.0, + 367.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 474.0, + 333.0, + 1405.0, + 333.0, + 1405.0, + 371.0, + 474.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 367.0, + 1187.0, + 367.0, + 1187.0, + 401.0, + 395.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 367.0, + 1403.0, + 367.0, + 1403.0, + 401.0, + 1273.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 397.0, + 745.0, + 397.0, + 745.0, + 431.0, + 396.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 397.0, + 1183.0, + 397.0, + 1183.0, + 431.0, + 768.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 614.0, + 395.0, + 614.0, + 395.0, + 654.0, + 367.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 614.0, + 630.0, + 614.0, + 630.0, + 654.0, + 477.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 808.0, + 615.0, + 1154.0, + 615.0, + 1154.0, + 652.0, + 808.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 615.0, + 1404.0, + 615.0, + 1404.0, + 652.0, + 1180.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 659.0, + 946.0, + 659.0, + 946.0, + 693.0, + 395.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 682.75, + 628.5, + 810.75, + 628.5, + 810.75, + 663.5, + 682.75, + 663.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 942.75, + 673.0, + 1077.75, + 673.0, + 1077.75, + 708.0, + 942.75, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 500.0, + 809.0, + 500.0, + 809.0, + 545.0, + 393.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 500.0, + 1405.0, + 500.0, + 1405.0, + 545.0, + 1236.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 540.0, + 445.0, + 540.0, + 445.0, + 582.0, + 393.0, + 582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 621.0, + 540.0, + 633.0, + 540.0, + 633.0, + 582.0, + 621.0, + 582.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1458, + 1404, + 1458, + 1404, + 1562, + 298, + 1562 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 1345, + 1405, + 1345, + 1405, + 1445, + 297, + 1445 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 296, + 527, + 1401, + 527, + 1401, + 592, + 296, + 592 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 377, + 997, + 1323, + 997, + 1323, + 1171, + 377, + 1171 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 301, + 257, + 1397, + 257, + 1397, + 508, + 301, + 508 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 301, + 1174, + 1404, + 1174, + 1404, + 1247, + 301, + 1247 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 300, + 1254, + 1398, + 1254, + 1398, + 1336, + 300, + 1336 + ], + "score": 0.926 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 816, + 74, + 816, + 106, + 298, + 106 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 296, + 599, + 1407, + 599, + 1407, + 702, + 296, + 702 + ], + "score": 0.905 + }, + { + "category_id": 1, + "poly": [ + 295, + 710, + 1406, + 710, + 1406, + 994, + 295, + 994 + ], + "score": 0.901 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.859 + }, + { + "category_id": 8, + "poly": [ + 361, + 1592, + 1342, + 1592, + 1342, + 1989, + 361, + 1989 + ], + "score": 0.817 + }, + { + "category_id": 2, + "poly": [ + 1374, + 1939, + 1404, + 1939, + 1404, + 1969, + 1374, + 1969 + ], + "score": 0.807 + }, + { + "category_id": 2, + "poly": [ + 1374, + 459, + 1403, + 459, + 1403, + 489, + 1374, + 489 + ], + "score": 0.786 + }, + { + "category_id": 9, + "poly": [ + 1086, + 1605, + 1227, + 1605, + 1227, + 1640, + 1086, + 1640 + ], + "score": 0.581 + }, + { + "category_id": 1, + "poly": [ + 297, + 231, + 407, + 231, + 407, + 260, + 297, + 260 + ], + "score": 0.545 + }, + { + "category_id": 8, + "poly": [ + 362, + 1592, + 994, + 1592, + 994, + 1988, + 362, + 1988 + ], + "score": 0.381 + }, + { + "category_id": 0, + "poly": [ + 297, + 231, + 407, + 231, + 407, + 260, + 297, + 260 + ], + "score": 0.309 + }, + { + "category_id": 1, + "poly": [ + 1086, + 1862, + 1266, + 1862, + 1266, + 1899, + 1086, + 1899 + ], + "score": 0.103 + }, + { + "category_id": 14, + "poly": [ + 361, + 1590, + 995, + 1590, + 995, + 1992, + 361, + 1992 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } { \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\bar { \\mathcal { F } } _ { h ^ { * } } ( I ) ) = \\displaystyle { \\sum _ { b \\in [ B ] } f ( b ) ^ { 2 } - \\sum _ { i \\in [ n ] } f _ { i } ^ { 2 } } } \\\\ { \\displaystyle } & { \\geq \\frac { ( \\sum _ { i \\in I } f _ { i } ) ^ { 2 } } { B ( 1 - \\frac { 1 } { 2 \\ln \\gamma } ) } - \\frac { \\sum _ { i \\in I } f _ { i } ^ { 2 } } { i \\in I } } \\\\ { \\displaystyle } & { \\geq \\frac { ( \\ln ( 2 \\gamma \\ln \\gamma ) - 1 ) ^ { 2 } } { B } - \\frac { 2 \\ln \\gamma } { B } + \\frac { 1 } { n } } \\\\ { \\displaystyle } & { = \\Omega ( \\frac { \\ln ^ { 2 } \\gamma } { B } ) } \\\\ { \\displaystyle } & { = \\Omega ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 868, + 1288, + 985, + 1288, + 985, + 1337, + 868, + 1337 + ], + "score": 0.94, + "latex": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( \\frac { n } { B } ) } { B } \\big )" + }, + { + "category_id": 13, + "poly": [ + 367, + 1174, + 710, + 1174, + 710, + 1220, + 367, + 1220 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { f _ { j ^ { * } } = \\frac { 1 } { j ^ { * } } > \\frac { \\ln ( n / j ^ { * } ) + 1 } { B _ { I } } > \\frac { f ( I ) } { B _ { I } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1044, + 744, + 1166, + 744, + 1166, + 786, + 1044, + 786 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { j ^ { * } \\le \\frac { B } { 2 \\ln \\gamma } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 878, + 529, + 1075, + 529, + 1075, + 563, + 878, + 563 + ], + "score": 0.93, + "latex": "h ^ { * } : [ n ] \\ \\to \\ [ B ]" + }, + { + "category_id": 13, + "poly": [ + 839, + 923, + 1135, + 923, + 1135, + 958, + 839, + 958 + ], + "score": 0.93, + "latex": "g ( j ) : = j \\cdot ( \\ln ( n / j ) + 1 )" + }, + { + "category_id": 13, + "poly": [ + 298, + 744, + 421, + 744, + 421, + 787, + 298, + 787 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { j ^ { * } > \\frac { B } { 2 \\ln \\gamma } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 488, + 844, + 700, + 844, + 700, + 885, + 488, + 885 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { f ( I ) < \\ln ( \\frac { n } { j ^ { * } } ) + 1 } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 310, + 254, + 1398, + 254, + 1398, + 512, + 310, + 512 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } { \\widehat { \\mathrm { E r r } ( F ( I ) , \\tilde { F } _ { h ^ { \\ast } } ( I ) ) } - \\mathrm { E r r } ( \\mathcal { F } ( I ) , \\tilde { \\mathcal { F } } _ { \\overline { { h } } } ( I ) ) = f _ { h ^ { \\ast } } ( b ^ { \\ast } ) ^ { 2 } + f _ { h ^ { \\ast } } ( \\overline { { b } } ) ^ { 2 } - f _ { \\overline { { h } } } ( b ^ { \\ast } ) ^ { 2 } - f _ { \\overline { { h } } } ( \\overline { { b } } ) ^ { 2 } } & { } \\\\ { = ( f _ { i ^ { \\ast } } + f ( I ^ { \\ast } ) ) ^ { 2 } + f _ { h ^ { \\ast } } ( \\overline { { b } } ) ^ { 2 } - f _ { i ^ { \\ast } } ^ { 2 } - ( f _ { h ^ { \\ast } } ( \\overline { { b } } ) + f ( I ^ { \\ast } ) ) ^ { 2 } } & { } \\\\ { = 2 f _ { i ^ { \\ast } } \\cdot f ( I ^ { \\ast } ) - 2 f _ { h ^ { \\ast } } ( \\overline { { b } } ) \\cdot f ( I ^ { \\ast } ) } & { } \\\\ { = 2 f ( I ^ { \\ast } ) \\cdot ( f _ { i ^ { \\ast } } - f _ { h ^ { \\ast } } ( \\overline { { b } } ) ) } & { } \\\\ { > 0 \\quad \\triangleright \\mathrm { S i n c e ~ } f _ { i ^ { \\ast } } > \\frac { f ( I ) } { B } > f _ { h ^ { \\ast } } ( \\overline { { b } } ) . } & { } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 658, + 782, + 787, + 782, + 787, + 817, + 658, + 817 + ], + "score": 0.92, + "latex": "f _ { j ^ { * } } = 1 / j ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 299, + 663, + 356, + 663, + 356, + 707, + 299, + 707 + ], + "score": 0.92, + "latex": "\\frac { B } { 2 \\ln \\gamma }" + }, + { + "category_id": 13, + "poly": [ + 372, + 1411, + 560, + 1411, + 560, + 1446, + 372, + 1446 + ], + "score": 0.92, + "latex": "\\gamma = n / B > e ^ { 4 . 2 }" + }, + { + "category_id": 13, + "poly": [ + 542, + 955, + 663, + 955, + 663, + 997, + 542, + 997 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { j ^ { * } \\le \\frac { B } { 2 \\ln \\gamma } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 887, + 436, + 887, + 436, + 922, + 298, + 922 + ], + "score": 0.92, + "latex": "\\{ j ^ { * } , \\cdots , n \\}" + }, + { + "category_id": 13, + "poly": [ + 1344, + 880, + 1393, + 880, + 1393, + 927, + 1344, + 927 + ], + "score": 0.92, + "latex": "\\textstyle { \\frac { f ( I ) } { B _ { I } } }" + }, + { + "category_id": 13, + "poly": [ + 439, + 559, + 506, + 559, + 506, + 593, + 439, + 593 + ], + "score": 0.92, + "latex": "\\Theta ( B )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1527, + 369, + 1527, + 369, + 1562, + 298, + 1562 + ], + "score": 0.92, + "latex": "S ^ { 2 } / m" + }, + { + "category_id": 13, + "poly": [ + 1257, + 1344, + 1335, + 1344, + 1335, + 1386, + 1257, + 1386 + ], + "score": 0.91, + "latex": "\\scriptstyle \\left( { \\frac { B } { 2 \\ln \\gamma } } \\right)" + }, + { + "category_id": 13, + "poly": [ + 341, + 1488, + 420, + 1488, + 420, + 1529, + 341, + 1529 + ], + "score": 0.91, + "latex": "\\scriptstyle \\left( { \\frac { B } { 2 \\ln \\gamma } } \\right)" + }, + { + "category_id": 13, + "poly": [ + 756, + 632, + 922, + 632, + 922, + 665, + 756, + 665 + ], + "score": 0.91, + "latex": "h ^ { * } : [ n ] [ B ]" + }, + { + "category_id": 13, + "poly": [ + 850, + 782, + 1062, + 782, + 1062, + 817, + 850, + 817 + ], + "score": 0.91, + "latex": "I = \\{ i _ { j } \\mid j \\geq j ^ { * } \\} )" + }, + { + "category_id": 13, + "poly": [ + 505, + 1255, + 643, + 1255, + 643, + 1291, + 505, + 1291 + ], + "score": 0.91, + "latex": "n / B \\geq e ^ { 4 . 2 }" + }, + { + "category_id": 13, + "poly": [ + 969, + 816, + 1184, + 816, + 1184, + 846, + 969, + 846 + ], + "score": 0.9, + "latex": "B _ { I } = B - j ^ { * } + 1" + }, + { + "category_id": 13, + "poly": [ + 468, + 889, + 505, + 889, + 505, + 920, + 468, + 920 + ], + "score": 0.9, + "latex": "B _ { I }" + }, + { + "category_id": 13, + "poly": [ + 298, + 958, + 358, + 958, + 358, + 992, + 298, + 992 + ], + "score": 0.9, + "latex": "[ 1 , n ]" + }, + { + "category_id": 13, + "poly": [ + 1168, + 890, + 1196, + 890, + 1196, + 921, + 1168, + 921 + ], + "score": 0.88, + "latex": "j ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 429, + 714, + 464, + 714, + 464, + 747, + 429, + 747 + ], + "score": 0.88, + "latex": "i _ { j ^ { * } }" + }, + { + "category_id": 13, + "poly": [ + 799, + 817, + 828, + 817, + 828, + 846, + 799, + 846 + ], + "score": 0.87, + "latex": "j ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1150, + 786, + 1187, + 786, + 1187, + 814, + 1150, + 814 + ], + "score": 0.87, + "latex": "B _ { I }" + }, + { + "category_id": 13, + "poly": [ + 1324, + 1183, + 1352, + 1183, + 1352, + 1213, + 1324, + 1213 + ], + "score": 0.87, + "latex": "j ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1200, + 561, + 1231, + 561, + 1231, + 587, + 1200, + 587 + ], + "score": 0.86, + "latex": "h ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1324, + 713, + 1355, + 713, + 1355, + 741, + 1324, + 741 + ], + "score": 0.86, + "latex": "h ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1104, + 847, + 1135, + 847, + 1135, + 872, + 1104, + 872 + ], + "score": 0.86, + "latex": "h ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 794, + 598, + 892, + 598, + 892, + 632, + 794, + 632 + ], + "score": 0.85, + "latex": "\\gamma \\geq e ^ { 4 . 2 }" + }, + { + "category_id": 14, + "poly": [ + 375, + 995, + 1329, + 995, + 1329, + 1139, + 375, + 1139 + ], + "score": 0.85, + "latex": "\\begin{array} { r l r } { { j ^ { * } \\cdot ( \\ln ( \\frac { n } { j ^ { * } } ) + 1 ) \\le \\frac { B } { 2 \\ln \\gamma } \\cdot ( \\ln ( 2 \\gamma \\ln \\gamma ) + 1 ) } } \\\\ & { } & { \\le B \\cdot ( 1 - \\frac { 1 } { 2 \\ln \\gamma } ) \\quad \\triangleright \\mathrm { S i n c e ~ l n } ( 2 \\ln \\gamma ) + 2 < \\ln \\gamma \\mathrm { ~ f o r ~ l n } \\gamma \\ge 4 . 2 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 611, + 601, + 719, + 601, + 719, + 634, + 611, + 634 + ], + "score": 0.84, + "latex": "B = n / \\gamma" + }, + { + "category_id": 13, + "poly": [ + 1266, + 1491, + 1288, + 1491, + 1288, + 1517, + 1266, + 1517 + ], + "score": 0.82, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 985, + 1494, + 1012, + 1494, + 1012, + 1517, + 985, + 1517 + ], + "score": 0.77, + "latex": "m" + }, + { + "category_id": 13, + "poly": [ + 959, + 1461, + 977, + 1461, + 977, + 1487, + 959, + 1487 + ], + "score": 0.77, + "latex": "I" + }, + { + "category_id": 13, + "poly": [ + 724, + 1301, + 749, + 1301, + 749, + 1327, + 724, + 1327 + ], + "score": 0.75, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 1223, + 747, + 1242, + 747, + 1242, + 774, + 1223, + 774 + ], + "score": 0.7, + "latex": "I" + }, + { + "category_id": 13, + "poly": [ + 1381, + 1263, + 1402, + 1263, + 1402, + 1285, + 1381, + 1285 + ], + "score": 0.69, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 1085, + 1794, + 1113, + 1794, + 1113, + 1820, + 1085, + 1820 + ], + "score": 0.33, + "latex": "\\vartriangleright" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 817.0, + 72.0, + 817.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": [ + 1376.0, + 1942.0, + 1404.0, + 1942.0, + 1404.0, + 1973.0, + 1376.0, + 1973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1399.0, + 462.0, + 1404.0, + 462.0, + 1404.0, + 493.0, + 1399.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 224.0, + 412.0, + 224.0, + 412.0, + 269.0, + 294.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1458.0, + 958.0, + 1458.0, + 958.0, + 1493.0, + 294.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 1458.0, + 1405.0, + 1458.0, + 1405.0, + 1493.0, + 978.0, + 1493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1491.0, + 340.0, + 1491.0, + 340.0, + 1523.0, + 297.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 1490.0, + 984.0, + 1490.0, + 984.0, + 1521.0, + 421.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1013.0, + 1490.0, + 1265.0, + 1490.0, + 1265.0, + 1521.0, + 1013.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1289.0, + 1490.0, + 1405.0, + 1490.0, + 1405.0, + 1521.0, + 1289.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1524.0, + 297.0, + 1524.0, + 297.0, + 1564.0, + 294.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 1524.0, + 1021.0, + 1524.0, + 1021.0, + 1564.0, + 370.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 331.0, + 1491.5, + 430.0, + 1491.5, + 430.0, + 1535.0, + 331.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 286.0, + 1335.0, + 1256.0, + 1335.0, + 1256.0, + 1397.0, + 286.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1335.0, + 1413.0, + 1335.0, + 1413.0, + 1397.0, + 1336.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1381.0, + 1402.0, + 1381.0, + 1402.0, + 1416.0, + 295.0, + 1416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1410.0, + 371.0, + 1410.0, + 371.0, + 1446.0, + 292.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 1410.0, + 573.0, + 1410.0, + 573.0, + 1446.0, + 561.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 523.0, + 877.0, + 523.0, + 877.0, + 566.0, + 292.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1076.0, + 523.0, + 1405.0, + 523.0, + 1405.0, + 566.0, + 1076.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 558.0, + 438.0, + 558.0, + 438.0, + 594.0, + 296.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 558.0, + 1199.0, + 558.0, + 1199.0, + 594.0, + 507.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 558.0, + 1244.0, + 558.0, + 1244.0, + 594.0, + 1232.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1165.0, + 366.0, + 1165.0, + 366.0, + 1227.0, + 291.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 1165.0, + 1323.0, + 1165.0, + 1323.0, + 1227.0, + 711.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 1165.0, + 1409.0, + 1165.0, + 1409.0, + 1227.0, + 1353.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 547.0, + 1193.0, + 588.0, + 1193.0, + 588.0, + 1228.0, + 547.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1213.0, + 493.0, + 1213.0, + 493.0, + 1250.0, + 295.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1217.0, + 1404.0, + 1217.0, + 1404.0, + 1244.0, + 1376.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1251.0, + 504.0, + 1251.0, + 504.0, + 1294.0, + 295.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 1251.0, + 1380.0, + 1251.0, + 1380.0, + 1294.0, + 644.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1297.0, + 723.0, + 1297.0, + 723.0, + 1333.0, + 292.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 1297.0, + 867.0, + 1297.0, + 867.0, + 1333.0, + 750.0, + 1333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 1280.0, + 997.0, + 1280.0, + 997.0, + 1328.0, + 893.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 595.0, + 610.0, + 595.0, + 610.0, + 638.0, + 291.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 595.0, + 793.0, + 595.0, + 793.0, + 638.0, + 720.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 595.0, + 1408.0, + 595.0, + 1408.0, + 638.0, + 893.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 631.0, + 755.0, + 631.0, + 755.0, + 667.0, + 294.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 631.0, + 1405.0, + 631.0, + 1405.0, + 667.0, + 923.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 661.0, + 1393.0, + 661.0, + 1393.0, + 708.0, + 357.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 709.0, + 428.0, + 709.0, + 428.0, + 750.0, + 292.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 709.0, + 1323.0, + 709.0, + 1323.0, + 750.0, + 465.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1356.0, + 709.0, + 1409.0, + 709.0, + 1409.0, + 750.0, + 1356.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 741.0, + 297.0, + 741.0, + 297.0, + 787.0, + 291.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 422.0, + 739.0, + 1043.0, + 739.0, + 1043.0, + 796.0, + 422.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 739.0, + 1222.0, + 739.0, + 1222.0, + 796.0, + 1167.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 739.0, + 1413.0, + 739.0, + 1413.0, + 796.0, + 1243.0, + 796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 780.0, + 657.0, + 780.0, + 657.0, + 820.0, + 292.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 788.0, + 780.0, + 849.0, + 780.0, + 849.0, + 820.0, + 788.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 780.0, + 1149.0, + 780.0, + 1149.0, + 820.0, + 1063.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 780.0, + 1407.0, + 780.0, + 1407.0, + 820.0, + 1188.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 815.0, + 798.0, + 815.0, + 798.0, + 848.0, + 294.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 815.0, + 968.0, + 815.0, + 968.0, + 848.0, + 829.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 815.0, + 1403.0, + 815.0, + 1403.0, + 848.0, + 1185.0, + 848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 842.0, + 487.0, + 842.0, + 487.0, + 883.0, + 294.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 842.0, + 1103.0, + 842.0, + 1103.0, + 883.0, + 701.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 842.0, + 1408.0, + 842.0, + 1408.0, + 883.0, + 1136.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 881.0, + 467.0, + 881.0, + 467.0, + 931.0, + 437.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 881.0, + 1167.0, + 881.0, + 1167.0, + 931.0, + 506.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 881.0, + 1343.0, + 881.0, + 1343.0, + 931.0, + 1197.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 881.0, + 1399.0, + 881.0, + 1399.0, + 931.0, + 1394.0, + 931.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 922.0, + 838.0, + 922.0, + 838.0, + 961.0, + 294.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 922.0, + 1406.0, + 922.0, + 1406.0, + 961.0, + 1136.0, + 961.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 950.0, + 297.0, + 950.0, + 297.0, + 1005.0, + 294.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 359.0, + 950.0, + 541.0, + 950.0, + 541.0, + 1005.0, + 359.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 664.0, + 950.0, + 679.0, + 950.0, + 679.0, + 1005.0, + 664.0, + 1005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 224.0, + 412.0, + 224.0, + 412.0, + 269.0, + 294.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1082.0, + 1861.0, + 1269.0, + 1861.0, + 1269.0, + 1900.0, + 1082.0, + 1900.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 228, + 1405, + 228, + 1405, + 334, + 297, + 334 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 299, + 425, + 1404, + 425, + 1404, + 519, + 299, + 519 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 298, + 854, + 1405, + 854, + 1405, + 940, + 298, + 940 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 296, + 531, + 1407, + 531, + 1407, + 659, + 296, + 659 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 297, + 339, + 1399, + 339, + 1399, + 420, + 297, + 420 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 299, + 74, + 816, + 74, + 816, + 105, + 299, + 105 + ], + "score": 0.914 + }, + { + "category_id": 2, + "poly": [ + 834, + 2088, + 866, + 2088, + 866, + 2113, + 834, + 2113 + ], + "score": 0.853 + }, + { + "category_id": 1, + "poly": [ + 300, + 716, + 1397, + 716, + 1397, + 815, + 300, + 815 + ], + "score": 0.802 + }, + { + "category_id": 8, + "poly": [ + 660, + 814, + 1036, + 814, + 1036, + 851, + 660, + 851 + ], + "score": 0.797 + }, + { + "category_id": 1, + "poly": [ + 427, + 660, + 1265, + 660, + 1265, + 694, + 427, + 694 + ], + "score": 0.39 + }, + { + "category_id": 13, + "poly": [ + 710, + 260, + 849, + 260, + 849, + 306, + 710, + 306 + ], + "score": 0.94, + "latex": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } \\big )" + }, + { + "category_id": 13, + "poly": [ + 509, + 893, + 648, + 893, + 648, + 939, + 509, + 939 + ], + "score": 0.93, + "latex": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } \\big )" + }, + { + "category_id": 13, + "poly": [ + 919, + 373, + 1036, + 373, + 1036, + 420, + 919, + 420 + ], + "score": 0.93, + "latex": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( \\frac { n } { B } ) } { B } \\big )" + }, + { + "category_id": 13, + "poly": [ + 389, + 902, + 479, + 902, + 479, + 937, + 389, + 937 + ], + "score": 0.93, + "latex": "C M ( k )" + }, + { + "category_id": 13, + "poly": [ + 1066, + 487, + 1156, + 487, + 1156, + 520, + 1066, + 520 + ], + "score": 0.92, + "latex": "C M ( k )" + }, + { + "category_id": 13, + "poly": [ + 466, + 456, + 848, + 456, + 848, + 490, + 466, + 490 + ], + "score": 0.92, + "latex": "h _ { 1 } , \\cdot \\cdot \\cdot , h _ { k } \\in \\{ h : [ n ] [ B / k ] \\}" + }, + { + "category_id": 13, + "poly": [ + 1226, + 457, + 1400, + 457, + 1400, + 490, + 1226, + 490 + ], + "score": 0.92, + "latex": "h ^ { * } : [ n ] \\to [ B ]" + }, + { + "category_id": 13, + "poly": [ + 893, + 852, + 1032, + 852, + 1032, + 896, + 893, + 896 + ], + "score": 0.92, + "latex": "\\Omega \\big ( \\frac { \\ln ^ { 2 } ( n / B ) } { B } \\big )" + }, + { + "category_id": 13, + "poly": [ + 439, + 629, + 589, + 629, + 589, + 662, + 439, + 662 + ], + "score": 0.92, + "latex": "\\{ f _ { i } \\mid i \\in [ n ] \\}" + }, + { + "category_id": 13, + "poly": [ + 819, + 660, + 897, + 660, + 897, + 694, + 819, + 694 + ], + "score": 0.91, + "latex": "i \\in [ n ]" + }, + { + "category_id": 13, + "poly": [ + 1106, + 600, + 1197, + 600, + 1197, + 632, + 1106, + 632 + ], + "score": 0.91, + "latex": "C M ( k )" + }, + { + "category_id": 13, + "poly": [ + 1302, + 751, + 1393, + 751, + 1393, + 785, + 1302, + 785 + ], + "score": 0.91, + "latex": "C M ( k )" + }, + { + "category_id": 13, + "poly": [ + 299, + 599, + 419, + 599, + 419, + 633, + 299, + 633 + ], + "score": 0.91, + "latex": "[ n ] \\} | \\leq B" + }, + { + "category_id": 13, + "poly": [ + 1253, + 425, + 1344, + 425, + 1344, + 457, + 1253, + 457 + ], + "score": 0.91, + "latex": "C M ( k )" + }, + { + "category_id": 13, + "poly": [ + 1116, + 533, + 1206, + 533, + 1206, + 565, + 1116, + 565 + ], + "score": 0.91, + "latex": "C M ( k )" + }, + { + "category_id": 13, + "poly": [ + 585, + 533, + 642, + 533, + 642, + 565, + 585, + 565 + ], + "score": 0.9, + "latex": "C ^ { \\prime } [ i ]" + }, + { + "category_id": 13, + "poly": [ + 297, + 565, + 700, + 565, + 700, + 602, + 297, + 602 + ], + "score": 0.9, + "latex": "f _ { i } ; C ^ { \\prime } [ i ] : = \\arg \\operatorname* { m i n } _ { j \\in [ k ] } C [ j , h _ { j } ( i ) ]" + }, + { + "category_id": 13, + "poly": [ + 976, + 716, + 1314, + 716, + 1314, + 749, + 976, + 749 + ], + "score": 0.9, + "latex": "\\{ C [ \\ell , j ] \\mid \\ell \\in [ k ] , j \\in [ B / k ] \\}" + }, + { + "category_id": 13, + "poly": [ + 660, + 812, + 1034, + 812, + 1034, + 851, + 660, + 851 + ], + "score": 0.9, + "latex": "\\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { h ^ { \\ast } } ) \\leq \\mathrm { E r r } ( \\mathcal { F } , \\tilde { \\mathcal { F } } _ { C M ( k ) } ) ." + }, + { + "category_id": 13, + "poly": [ + 1110, + 565, + 1200, + 565, + 1200, + 598, + 1110, + 598 + ], + "score": 0.9, + "latex": "C M ( k )" + }, + { + "category_id": 13, + "poly": [ + 506, + 339, + 644, + 339, + 644, + 375, + 506, + 375 + ], + "score": 0.9, + "latex": "n / B \\geq e ^ { 4 . 2 }" + }, + { + "category_id": 13, + "poly": [ + 891, + 746, + 918, + 746, + 918, + 783, + 891, + 783 + ], + "score": 0.89, + "latex": "\\tilde { f } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 984, + 660, + 1264, + 660, + 1264, + 710, + 984, + 710 + ], + "score": 0.88, + "latex": "j ^ { * } = \\underset { i \\in [ k ] } { \\arg \\operatorname* { m i n } } C [ j , h _ { j } ( i ) ]" + }, + { + "category_id": 13, + "poly": [ + 1235, + 564, + 1404, + 564, + 1404, + 598, + 1235, + 598 + ], + "score": 0.87, + "latex": "B , | \\{ C ^ { \\prime } [ i ] \\mid i \\in" + }, + { + "category_id": 13, + "poly": [ + 1130, + 753, + 1157, + 753, + 1157, + 783, + 1130, + 783 + ], + "score": 0.87, + "latex": "f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1098, + 631, + 1129, + 631, + 1129, + 657, + 1098, + 657 + ], + "score": 0.87, + "latex": "h ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 604, + 783, + 769, + 783, + 769, + 815, + 604, + 815 + ], + "score": 0.87, + "latex": "C ^ { \\prime } [ h ^ { * } ( i ) ] \\geq f _ { i }" + }, + { + "category_id": 13, + "poly": [ + 485, + 746, + 807, + 746, + 807, + 783, + 485, + 783 + ], + "score": 0.86, + "latex": "C ^ { \\prime } [ h ^ { * } ( i ) ] \\ \\leq \\ C [ h ^ { * } ( i ) ] \\ = \\ \\tilde { f } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 380, + 715, + 471, + 715, + 471, + 749, + 380, + 749 + ], + "score": 0.86, + "latex": "C M ( k )" + }, + { + "category_id": 13, + "poly": [ + 835, + 861, + 866, + 861, + 866, + 888, + 835, + 888 + ], + "score": 0.85, + "latex": "h ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 943, + 631, + 968, + 631, + 968, + 657, + 943, + 657 + ], + "score": 0.81, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 563, + 271, + 589, + 271, + 589, + 298, + 563, + 298 + ], + "score": 0.8, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 435, + 661, + 718, + 661, + 718, + 695, + 435, + 695 + ], + "score": 0.76, + "latex": "h ^ { \\ast } ( i ) = ( j ^ { \\ast } , h _ { j ^ { \\ast } } ( i ) ) \\quad \\triangleright" + }, + { + "category_id": 13, + "poly": [ + 1350, + 272, + 1369, + 272, + 1369, + 298, + 1350, + 298 + ], + "score": 0.72, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 776, + 385, + 801, + 385, + 801, + 412, + 776, + 412 + ], + "score": 0.71, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 483, + 716, + 514, + 716, + 514, + 744, + 483, + 744 + ], + "score": 0.66, + "latex": "h ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 579, + 786, + 591, + 786, + 591, + 809, + 579, + 809 + ], + "score": 0.59, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 452, + 537, + 464, + 537, + 464, + 561, + 452, + 561 + ], + "score": 0.57, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 458, + 754, + 471, + 754, + 471, + 780, + 458, + 780 + ], + "score": 0.47, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1228, + 565, + 1252, + 565, + 1252, + 592, + 1228, + 592 + ], + "score": 0.33, + "latex": "B" + }, + { + "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": [ + 828.0, + 2083.0, + 872.0, + 2083.0, + 872.0, + 2123.0, + 828.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1403.0, + 227.0, + 1403.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 259.0, + 562.0, + 259.0, + 562.0, + 311.0, + 291.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 259.0, + 709.0, + 259.0, + 709.0, + 311.0, + 590.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 259.0, + 1349.0, + 259.0, + 1349.0, + 311.0, + 850.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1370.0, + 259.0, + 1406.0, + 259.0, + 1406.0, + 311.0, + 1370.0, + 311.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 297.0, + 352.0, + 297.0, + 352.0, + 336.0, + 291.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 421.0, + 1252.0, + 421.0, + 1252.0, + 462.0, + 292.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 421.0, + 1405.0, + 421.0, + 1405.0, + 462.0, + 1345.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 453.0, + 465.0, + 453.0, + 465.0, + 493.0, + 292.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 453.0, + 1225.0, + 453.0, + 1225.0, + 493.0, + 849.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 487.0, + 1065.0, + 487.0, + 1065.0, + 521.0, + 297.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1157.0, + 487.0, + 1165.0, + 487.0, + 1165.0, + 521.0, + 1157.0, + 521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 844.0, + 834.0, + 844.0, + 834.0, + 900.0, + 292.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 844.0, + 892.0, + 844.0, + 892.0, + 900.0, + 867.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 844.0, + 1405.0, + 844.0, + 1405.0, + 900.0, + 1033.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 649.0, + 899.0, + 743.0, + 899.0, + 743.0, + 934.0, + 649.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1378.0, + 909.0, + 1400.0, + 909.0, + 1400.0, + 926.0, + 1378.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 919.0, + 605.0, + 919.0, + 605.0, + 944.0, + 577.0, + 944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 890.5, + 656.0, + 890.5, + 656.0, + 943.0, + 287.0, + 943.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 531.0, + 451.0, + 531.0, + 451.0, + 568.0, + 294.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 531.0, + 584.0, + 531.0, + 584.0, + 568.0, + 465.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.0, + 531.0, + 1115.0, + 531.0, + 1115.0, + 568.0, + 643.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1207.0, + 531.0, + 1405.0, + 531.0, + 1405.0, + 568.0, + 1207.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 561.0, + 296.0, + 561.0, + 296.0, + 605.0, + 293.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 701.0, + 561.0, + 1109.0, + 561.0, + 1109.0, + 605.0, + 701.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 561.0, + 1227.0, + 561.0, + 1227.0, + 605.0, + 1201.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1405.0, + 561.0, + 1408.0, + 561.0, + 1408.0, + 605.0, + 1405.0, + 605.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 600.0, + 1105.0, + 600.0, + 1105.0, + 633.0, + 420.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1198.0, + 600.0, + 1404.0, + 600.0, + 1404.0, + 633.0, + 1198.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 629.0, + 438.0, + 629.0, + 438.0, + 663.0, + 295.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 629.0, + 942.0, + 629.0, + 942.0, + 663.0, + 590.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 629.0, + 1097.0, + 629.0, + 1097.0, + 663.0, + 969.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1130.0, + 629.0, + 1260.0, + 629.0, + 1260.0, + 663.0, + 1130.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 336.0, + 505.0, + 336.0, + 505.0, + 378.0, + 295.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 645.0, + 336.0, + 1405.0, + 336.0, + 1405.0, + 378.0, + 645.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 380.0, + 775.0, + 380.0, + 775.0, + 419.0, + 293.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 802.0, + 380.0, + 918.0, + 380.0, + 918.0, + 419.0, + 802.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 948.0, + 362.5, + 1048.0, + 362.5, + 1048.0, + 414.5, + 948.0, + 414.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 711.0, + 379.0, + 711.0, + 379.0, + 753.0, + 294.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 711.0, + 482.0, + 711.0, + 482.0, + 753.0, + 472.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 515.0, + 711.0, + 975.0, + 711.0, + 975.0, + 753.0, + 515.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1315.0, + 711.0, + 1405.0, + 711.0, + 1405.0, + 753.0, + 1315.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 747.0, + 457.0, + 747.0, + 457.0, + 788.0, + 294.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 747.0, + 484.0, + 747.0, + 484.0, + 788.0, + 472.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 808.0, + 747.0, + 890.0, + 747.0, + 890.0, + 788.0, + 808.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 747.0, + 1129.0, + 747.0, + 1129.0, + 788.0, + 919.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 747.0, + 1301.0, + 747.0, + 1301.0, + 788.0, + 1158.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 747.0, + 1403.0, + 747.0, + 1403.0, + 788.0, + 1394.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 777.0, + 578.0, + 777.0, + 578.0, + 818.0, + 294.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 777.0, + 603.0, + 777.0, + 603.0, + 818.0, + 592.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 777.0, + 782.0, + 777.0, + 782.0, + 818.0, + 770.0, + 818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 652.0, + 434.0, + 652.0, + 434.0, + 701.0, + 431.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 652.0, + 818.0, + 652.0, + 818.0, + 701.0, + 719.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 652.0, + 983.0, + 652.0, + 983.0, + 701.0, + 898.0, + 701.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/r1lq1hRqYQ/r1lq1hRqYQ_layout.pdf b/parse/train/r1lq1hRqYQ/r1lq1hRqYQ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f11e2ca77b5e9c27857180cdc33144ddb4667e56 --- /dev/null +++ b/parse/train/r1lq1hRqYQ/r1lq1hRqYQ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c4b0c8377e97b83e8848e777ab2922f1992a34b3ccd4c8f2956723f080cf96ea +size 3200901 diff --git a/parse/train/r1lq1hRqYQ/r1lq1hRqYQ_origin.pdf b/parse/train/r1lq1hRqYQ/r1lq1hRqYQ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3e9a9e3bb8f2736966bf222291fa955cd4efcb46 --- /dev/null +++ b/parse/train/r1lq1hRqYQ/r1lq1hRqYQ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:51d3549f4fb0a1a93e997f1ecb09e9da8af2b0be46af77807a0e5ebcf9083d77 +size 3067761 diff --git a/parse/train/r1lq1hRqYQ/r1lq1hRqYQ_span.pdf b/parse/train/r1lq1hRqYQ/r1lq1hRqYQ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..88bdefc330da19cc8989811f092982c050150ad0 --- /dev/null +++ b/parse/train/r1lq1hRqYQ/r1lq1hRqYQ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2271ce08410c39da7e9902c0cf8b5d192fb3d3335b36e8f358c5bd582856f351 +size 3202710 diff --git a/parse/train/rJe2syrtvS/rJe2syrtvS_layout.pdf b/parse/train/rJe2syrtvS/rJe2syrtvS_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..cd66f8c306061a7d25c9622841eef4ce4f113ec2 --- /dev/null +++ b/parse/train/rJe2syrtvS/rJe2syrtvS_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a13ab86745198efb22d23873074fc52d1fcfd4fb1fd4f9395142bad30fab8ab6 +size 19359119 diff --git a/parse/train/rJe2syrtvS/rJe2syrtvS_origin.pdf b/parse/train/rJe2syrtvS/rJe2syrtvS_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..62140be511a9ecaba120ab974ce93999469cc676 --- /dev/null +++ b/parse/train/rJe2syrtvS/rJe2syrtvS_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c3d438b3a6c3f44802cd67c3105eb3e04f0d8d18aef540dfcd3c581fa77fbdd8 +size 19199535 diff --git a/parse/train/rJe2syrtvS/rJe2syrtvS_span.pdf b/parse/train/rJe2syrtvS/rJe2syrtvS_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c1d715fa594291b8dd26d4f3ff2f350f249bb0a2 --- /dev/null +++ b/parse/train/rJe2syrtvS/rJe2syrtvS_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d070d3c201700d9a367f76f4a112e9023d2058370b0d800facb43de43387d3ec +size 19357879 diff --git a/parse/train/rJeGJaEtPH/rJeGJaEtPH_layout.pdf b/parse/train/rJeGJaEtPH/rJeGJaEtPH_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6764cdb2f9b43214aacd6cb3ccff1a334ea3860c --- /dev/null +++ b/parse/train/rJeGJaEtPH/rJeGJaEtPH_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2a0c1bf9ea791ff8d6bc5e7d9c4d840b7755b548c3ac8fb5c0de759981a2feca +size 4454059 diff --git a/parse/train/rJeGJaEtPH/rJeGJaEtPH_origin.pdf b/parse/train/rJeGJaEtPH/rJeGJaEtPH_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ab4ea3b3fce0e7a0bbc97a0d02f23e05086bfa97 --- /dev/null +++ b/parse/train/rJeGJaEtPH/rJeGJaEtPH_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:179462adc89b677b539df9a806e983d8342348846aee567f57ed06decdbf3eb8 +size 4319296 diff --git a/parse/train/rJeGJaEtPH/rJeGJaEtPH_span.pdf b/parse/train/rJeGJaEtPH/rJeGJaEtPH_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..673181136ff2c7504ca16fc06ce17f116de3aa17 --- /dev/null +++ b/parse/train/rJeGJaEtPH/rJeGJaEtPH_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c4c8a77c8de10cc69be160809732d487397648a83aa9ae1eed56373fa0c02d5c +size 4461100 diff --git a/parse/train/rJed6j0cKX/rJed6j0cKX_layout.pdf b/parse/train/rJed6j0cKX/rJed6j0cKX_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..145f4f55c677515b09baeaabd08dd7a05de906ea --- /dev/null +++ b/parse/train/rJed6j0cKX/rJed6j0cKX_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:58988631b4b515be73f0c9d59823a0895e1165637a1e0fb4096b1d1ebd1fb73b +size 9933751 diff --git a/parse/train/rJed6j0cKX/rJed6j0cKX_origin.pdf b/parse/train/rJed6j0cKX/rJed6j0cKX_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4fd858a3590b978682cb6d99e8301fea627fbaa0 --- /dev/null +++ b/parse/train/rJed6j0cKX/rJed6j0cKX_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:37fb40dae7c1c12db6f861ff2dacd5c3d0ea2605d89986fc8d1e765761ff51ec +size 9684456 diff --git a/parse/train/rJed6j0cKX/rJed6j0cKX_span.pdf b/parse/train/rJed6j0cKX/rJed6j0cKX_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..f68d9d7115efa1b933bf30a3e2e68b9f7e740d88 --- /dev/null +++ b/parse/train/rJed6j0cKX/rJed6j0cKX_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:498433b12dcd16db500398be9296a0accc090cdbf4283539bd57a5b58608e76c +size 9948814 diff --git a/parse/train/rJeqeCEtvH/rJeqeCEtvH_layout.pdf b/parse/train/rJeqeCEtvH/rJeqeCEtvH_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..a73d653ea514bcc3f2a16fc6169136ba11c7d921 --- /dev/null +++ b/parse/train/rJeqeCEtvH/rJeqeCEtvH_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:31acaf7ed621ac514aca9d7aa6ce9002d45f2efe1afaaa6fbb32226e56ed5a04 +size 2005670 diff --git a/parse/train/rJeqeCEtvH/rJeqeCEtvH_origin.pdf b/parse/train/rJeqeCEtvH/rJeqeCEtvH_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ceafb2cfeb7583ac0f62b95ba28f0d66ee05444d --- /dev/null +++ b/parse/train/rJeqeCEtvH/rJeqeCEtvH_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:67c2ae780515e9dd4684f76ce475746788b50e7b15a294d0958f64a36f8dcaa9 +size 1851998 diff --git a/parse/train/rJeqeCEtvH/rJeqeCEtvH_span.pdf b/parse/train/rJeqeCEtvH/rJeqeCEtvH_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..bf8c0009d2e2fd1a992be016787218efd449689c --- /dev/null +++ b/parse/train/rJeqeCEtvH/rJeqeCEtvH_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0c3df393e0182b0b1ae9b02c17ae274bb607cfa2c4eac2889a2ab6612b81c3ef +size 2013554 diff --git a/parse/train/rJg8TeSFDH/rJg8TeSFDH_layout.pdf b/parse/train/rJg8TeSFDH/rJg8TeSFDH_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..def55e2ebdf7c297b13b0645e0226b57d71acd46 --- /dev/null +++ b/parse/train/rJg8TeSFDH/rJg8TeSFDH_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:64380f90eea91a46bcf4924ad6959209318398cec04f11f78b60cb2a5fc6572c +size 10147190 diff --git a/parse/train/rJg8TeSFDH/rJg8TeSFDH_origin.pdf b/parse/train/rJg8TeSFDH/rJg8TeSFDH_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..084b4b04b8b4a9009d063044c85bc4986726e745 --- /dev/null +++ b/parse/train/rJg8TeSFDH/rJg8TeSFDH_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:681efd2227a906687a757ddc42577f5b1f42e5a039f5a642d8c9117705769fd6 +size 5287592 diff --git a/parse/train/rJg8TeSFDH/rJg8TeSFDH_span.pdf b/parse/train/rJg8TeSFDH/rJg8TeSFDH_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e9a3dddcfdad8462d0c092000a50f8c379c6f26f --- /dev/null +++ b/parse/train/rJg8TeSFDH/rJg8TeSFDH_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:357501ec66ddec09740f8698353fb9b3bab42bb56dbd55d42f07e9ce7f6df37f +size 10154296 diff --git a/parse/train/rJvJXZb0W/rJvJXZb0W_layout.pdf b/parse/train/rJvJXZb0W/rJvJXZb0W_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3346153d3e31e38747fb34dd43df4589a0192743 --- /dev/null +++ b/parse/train/rJvJXZb0W/rJvJXZb0W_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:308d604a3abd14e85c6bcadb19b0252064fe40595592f7456bdc45f4187db515 +size 475602 diff --git a/parse/train/rJvJXZb0W/rJvJXZb0W_origin.pdf b/parse/train/rJvJXZb0W/rJvJXZb0W_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c7470390dafa1110523b17940d239c6ba162ecc8 --- /dev/null +++ b/parse/train/rJvJXZb0W/rJvJXZb0W_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:91f3b38b68b3481c574bc325e91ec7ee67a5468a4459555dada75ebc95453863 +size 276227 diff --git a/parse/train/rJvJXZb0W/rJvJXZb0W_span.pdf b/parse/train/rJvJXZb0W/rJvJXZb0W_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..c3066a410e7f04117b1592ba371ccb438d2c6a03 --- /dev/null +++ b/parse/train/rJvJXZb0W/rJvJXZb0W_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bc470625d9af6fd77776abcba1f3d53d826e916b30c6410e1628dafc478891f9 +size 473802 diff --git a/parse/train/rJx0Q6EFPB/rJx0Q6EFPB_layout.pdf b/parse/train/rJx0Q6EFPB/rJx0Q6EFPB_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..b11e1122426be10a55102335270b22243c8fa9ec --- /dev/null +++ b/parse/train/rJx0Q6EFPB/rJx0Q6EFPB_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:fb7a1fcd096b8856aabf61ce12a5d7aeabc03cf90e2ce1cf2f545ce0d6ad7af7 +size 1335063 diff --git a/parse/train/rJx0Q6EFPB/rJx0Q6EFPB_origin.pdf b/parse/train/rJx0Q6EFPB/rJx0Q6EFPB_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..8b9c6058cadd105012c34e6575e16e8d73dedb24 --- /dev/null +++ b/parse/train/rJx0Q6EFPB/rJx0Q6EFPB_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:bc791e6f9174b519ac61c8f9ec4ecadc19eb5069f2575c9811ee7224eecd811b +size 1185782 diff --git a/parse/train/rJx0Q6EFPB/rJx0Q6EFPB_span.pdf b/parse/train/rJx0Q6EFPB/rJx0Q6EFPB_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5b75b04ccacf72dbc3b923d584c997ced78a6327 --- /dev/null +++ b/parse/train/rJx0Q6EFPB/rJx0Q6EFPB_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:18ad8c71d9dc7e6937e1046a75711f62677f50558b2aeb2b46ffc63c99368927 +size 1336022 diff --git a/parse/train/rkZvSe-RZ/rkZvSe-RZ_layout.pdf b/parse/train/rkZvSe-RZ/rkZvSe-RZ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2a9c487cf36d5d6c66bb35736bfc67f8ec34b972 --- /dev/null +++ b/parse/train/rkZvSe-RZ/rkZvSe-RZ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:507e9d879656a053d40715a7161559253dc4561bc4d29931ae91623f882d3782 +size 1287942 diff --git a/parse/train/rkZvSe-RZ/rkZvSe-RZ_origin.pdf b/parse/train/rkZvSe-RZ/rkZvSe-RZ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..35b9050537e34c07d667980d96e1ead57d7879a0 --- /dev/null +++ b/parse/train/rkZvSe-RZ/rkZvSe-RZ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ffdcc8db47bd6febfad3648b0c43e6b2a0381df7c6a83ade0e19db45a3916575 +size 1043189 diff --git a/parse/train/rkZvSe-RZ/rkZvSe-RZ_span.pdf b/parse/train/rkZvSe-RZ/rkZvSe-RZ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..0f5fbbf641500b2a3464712c25d8047032f6f3b9 --- /dev/null +++ b/parse/train/rkZvSe-RZ/rkZvSe-RZ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:9c0909916a05ebc284834b7aa3cef798b7c1d37eb4f229ab560717b1b9301a32 +size 1304077 diff --git a/parse/train/rkaSvlnoG/rkaSvlnoG_layout.pdf b/parse/train/rkaSvlnoG/rkaSvlnoG_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..30695113d5439e8791f40ae0edba8321ced5fa24 --- /dev/null +++ b/parse/train/rkaSvlnoG/rkaSvlnoG_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:6e4a5c75bd57c608b06bf9baf8e764fe9223ed89a4e7efced87cb19892ab5577 +size 560248 diff --git a/parse/train/rkaSvlnoG/rkaSvlnoG_origin.pdf b/parse/train/rkaSvlnoG/rkaSvlnoG_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..31b91c5acb5f7f591a6f4fdc349c13b305eaaaf4 --- /dev/null +++ b/parse/train/rkaSvlnoG/rkaSvlnoG_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:d2585b2e65ade4bd418d59dac790eb29dd5cbdee7f9b0996313eab6a131f64fb +size 478823 diff --git a/parse/train/rkaSvlnoG/rkaSvlnoG_span.pdf b/parse/train/rkaSvlnoG/rkaSvlnoG_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ff60cb0300bd28c4b95d0c05f9e9adab17c01db2 --- /dev/null +++ b/parse/train/rkaSvlnoG/rkaSvlnoG_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a0ddec7d816858b8e71b1c838ef639d4f481ebfa17f1e1ea5d8fd5ac2428bd75 +size 562343 diff --git a/parse/train/rkcya1ZAW/rkcya1ZAW_layout.pdf b/parse/train/rkcya1ZAW/rkcya1ZAW_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..5fd5d97d6d335115a3714e736ee732edf658fc21 --- /dev/null +++ b/parse/train/rkcya1ZAW/rkcya1ZAW_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:52d4632323883cedcebb921b62b61c48d1e9e8374e0d3ede21f74e168c488d57 +size 9418861 diff --git a/parse/train/rkcya1ZAW/rkcya1ZAW_origin.pdf b/parse/train/rkcya1ZAW/rkcya1ZAW_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..377931f4c8a27d2f2abcb3f17ed6d623fba5fe03 --- /dev/null +++ b/parse/train/rkcya1ZAW/rkcya1ZAW_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:7b0733d51230e6a275d6efd4defa8241bf1a2dc5ecdd577f4a6c106ad928118b +size 9144776 diff --git a/parse/train/rkcya1ZAW/rkcya1ZAW_span.pdf b/parse/train/rkcya1ZAW/rkcya1ZAW_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..aade11cac827ca7aa73417aba0c7d4fd2ea97f92 --- /dev/null +++ b/parse/train/rkcya1ZAW/rkcya1ZAW_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:372634dd7aeebbad48f65e0f5ed1adfdf6d36564ba00cb233e082970262ffad7 +size 9437093 diff --git a/parse/train/rkgO66VKDS/rkgO66VKDS_layout.pdf b/parse/train/rkgO66VKDS/rkgO66VKDS_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..eddf15f43a93cc379c3d9fc25802372875476c73 --- /dev/null +++ b/parse/train/rkgO66VKDS/rkgO66VKDS_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b86ad70b5b555060a23067b4ebc7f787bcedde91882ef8d5d40cc0e446d17f92 +size 501754 diff --git a/parse/train/rkgO66VKDS/rkgO66VKDS_origin.pdf b/parse/train/rkgO66VKDS/rkgO66VKDS_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d20e99b153ca93f5940096f9abba462257a9826e --- /dev/null +++ b/parse/train/rkgO66VKDS/rkgO66VKDS_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:16d0c94e6a9b0f6778c3e36453376496c7b5c60b73f7a8056afa6f472a338a6c +size 378327 diff --git a/parse/train/rkgO66VKDS/rkgO66VKDS_span.pdf b/parse/train/rkgO66VKDS/rkgO66VKDS_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..3704cc8fe99e874676af9f11a7a314bc4d6f0640 --- /dev/null +++ b/parse/train/rkgO66VKDS/rkgO66VKDS_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b7f0d736ab3b7f70c90927d033269291b7dfe7683f1ad2e91f81ef63b9c56df0 +size 503873 diff --git a/parse/train/rkgZaT4tDr/rkgZaT4tDr_layout.pdf b/parse/train/rkgZaT4tDr/rkgZaT4tDr_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..01daee2441befdd929196c51f894763bd383036e --- /dev/null +++ b/parse/train/rkgZaT4tDr/rkgZaT4tDr_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f78f40347fe85f64a3cf64ab2e2e5931bc51d510fbcc1ef214518e020f44d6d7 +size 1340676 diff --git a/parse/train/rkgZaT4tDr/rkgZaT4tDr_origin.pdf b/parse/train/rkgZaT4tDr/rkgZaT4tDr_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..1b3daeb1c6d6efddfad82cdc62496dc28bcb086b --- /dev/null +++ b/parse/train/rkgZaT4tDr/rkgZaT4tDr_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:65de1f6fa7a3f78a3d8d44d5f3790cede8176ca890421bcb8c640ec74814d8d9 +size 1230045 diff --git a/parse/train/rkgZaT4tDr/rkgZaT4tDr_span.pdf b/parse/train/rkgZaT4tDr/rkgZaT4tDr_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..9315f60cc790fd5caa3622db4a6da4dd59e8474d --- /dev/null +++ b/parse/train/rkgZaT4tDr/rkgZaT4tDr_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:f83b97d6327ae7f565240b2c56e855b0dba7b161d570c115cf2c18452d461be0 +size 1342012 diff --git a/parse/train/rklz9iAcKQ/rklz9iAcKQ_layout.pdf b/parse/train/rklz9iAcKQ/rklz9iAcKQ_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..6fa6dfc3da9938e086b3b3c3faf62b0b3e4606e3 --- /dev/null +++ b/parse/train/rklz9iAcKQ/rklz9iAcKQ_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:85e8eab5983c2b92102b243225436debc2d93dfb40bc9f9d126a9ee27158a7c9 +size 8785214 diff --git a/parse/train/rklz9iAcKQ/rklz9iAcKQ_origin.pdf b/parse/train/rklz9iAcKQ/rklz9iAcKQ_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..773573acc6a4ecf06035463ff8737eda315f50a4 --- /dev/null +++ b/parse/train/rklz9iAcKQ/rklz9iAcKQ_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5d3ad6ddb6affe44e3e587c5de323d1c91ecfe8d28b2852b725c971264dcd87e +size 8609467 diff --git a/parse/train/rklz9iAcKQ/rklz9iAcKQ_span.pdf b/parse/train/rklz9iAcKQ/rklz9iAcKQ_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4bf76623d7d8f1c1c79f7659740ada56b67c0ce5 --- /dev/null +++ b/parse/train/rklz9iAcKQ/rklz9iAcKQ_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:2eb6add5f79b25b6643dfcf2850221b9b059aac40df52b4637bc5d61625696a6 +size 8788781 diff --git a/parse/train/rygoURNYvS/rygoURNYvS_layout.pdf b/parse/train/rygoURNYvS/rygoURNYvS_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..03b2961cd5bfb1288ab626b926eb8a9a275bc166 --- /dev/null +++ b/parse/train/rygoURNYvS/rygoURNYvS_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3d69a262f5f836e18757ade5f2002f058b560239a8d53bdb2e4e0bb182c6c228 +size 530903 diff --git a/parse/train/rygoURNYvS/rygoURNYvS_origin.pdf b/parse/train/rygoURNYvS/rygoURNYvS_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..2e9df59b86ac2083db9b4064884ceb2c56af6085 --- /dev/null +++ b/parse/train/rygoURNYvS/rygoURNYvS_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:78c996ac218da7ded88e0573f0347c8f8ba13664caa206c0ee71746d8637b26f +size 367564 diff --git a/parse/train/rygoURNYvS/rygoURNYvS_span.pdf b/parse/train/rygoURNYvS/rygoURNYvS_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4529544aa55dbdf23b00cbcfe05b5f2875c8f164 --- /dev/null +++ b/parse/train/rygoURNYvS/rygoURNYvS_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:020b2ec2089017f944a8c25e4cd38214884d1f164715f3c88507f86e9fc45e94 +size 531009 diff --git a/parse/train/uIc4W6MtbDA/uIc4W6MtbDA.md b/parse/train/uIc4W6MtbDA/uIc4W6MtbDA.md new file mode 100644 index 0000000000000000000000000000000000000000..2c1f210ddc80c0df54082128106307879d595089 --- /dev/null +++ b/parse/train/uIc4W6MtbDA/uIc4W6MtbDA.md @@ -0,0 +1,272 @@ +# ERMAS: LEARNING POLICIES ROBUST TO REALITY GAPS IN MULTI-AGENT SIMULATIONS + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +Policies for real-world multi-agent problems, such as optimal taxation, can be learned in multi-agent simulations with AI agents that emulate humans. However, simulations can suffer from reality gaps as humans often act suboptimally or optimize for different objectives (i.e., bounded rationality). We introduce $\epsilon \cdot$ - Robust Multi-Agent Simulation (ERMAS), a robust optimization framework to learn AI policies that are robust to such multi-agent reality gaps. The objective of ERMAS theoretically guarantees robustness to the $\epsilon$ -Nash equilibria of other agents – that is, robustness to behavioral deviations with a regret of at most $\epsilon$ ERMAS efficiently solves a first-order approximation of the robustness objective using meta-learning methods. We show that ERMAS yields robust policies for repeated bimatrix games and optimal adaptive taxation in economic simulations, even when baseline notions of robustness are uninformative or intractable. In particular, we show ERMAS can learn tax policies that are robust to changes in agent risk aversion, improving policy objectives (social welfare) by up to $15 \%$ in complex spatiotemporal simulations using the AI Economist (Zheng et al., 2020). + +# 1 INTRODUCTION + +Reinforcement learning (RL) offers a tool to optimize policy decisions affecting complex, multiagent systems; for example, to improve traffic flow or economic productivity. In practice, the need for efficient policy evaluation necessitates training on simulations of multi-agent systems (MAS). Agents in these systems can be emulated with fixed behavioral rules, or by optimizing for a reward function using RL (Zheng et al., 2020). For instance, the impact of economic policy decisions are often estimated with agent-based models (Holland & Miller, 1991; Bonabeau, 2002). This commonly introduces a reality gap as the reward function and resulting behavior of simulated agents might differ from those of real people (Simon & Schaeffer, 1990). This becomes especially problematic as the complexity of the simulation grows, for example, when increasing the number of agents, or adding agent affordances (Kirman, 1992; Howitt, 2012). As a result, policies learned in imperfect simulations need to be robust against reality gaps in order to be effective in the real world. + +We introduce $\epsilon$ -Robust Multi-Agent Simulation (ERMAS), a robust optimization framework for training robust policies, termed planners, that interact with real-world multi-agent systems. ERMAS trains robust planners by simulating multi-agent systems with RL and sampling worst-case behaviors from the worst-case agents. This form of multi-agent robustness poses a very challenging multilevel (e.g., max-min-min) optimization problem. Existing techniques which could be applied to ERMAS’s multi-agent robustness objective, e.g., naive adversarial robustness (Pinto et al., 2017) and domain randomization (Tobin et al., 2017; Peng et al., 2018), are intractable as they would require an expensive search through a large space of agent reward functions. Alternative frameworks improve robustness, e.g., to changes in environment dynamics, observation or action spaces (Pinto et al., 2017; Li et al., 2019; Tessler et al., 2019), but do not address reality gaps due to reward function mismatches, as they use inappropriate metrics on the space of adversarial perturbations. + +To solve this problem, ERMAS has three key features: 1) It formulates a multi-agent robustness objective equivalent to finding the worst case $\epsilon$ -Nash equilibria. 2) It optimizes a tractable dual problem to the equivalent objective. 3) It approximates the dual problem using local solution concepts and first-order meta-learning techniques (Nichol et al., 2018; Finn et al., 2017). ERMAS ultimately yields policies that are robust to other agents’ behavioral deviations, up to a regret of $\epsilon$ . + +We show that ERMAS learns robust policies in repeated bimatrix games by finding the worst-case reality gaps, corresponding to highly adversarial agents, which in turn leads to more robust planners. We further consider a challenging, large-scale spatiotemporal economy that features a social planner that learns to adjust agent rewards. In both settings, we show policies trained by ERMAS are more robust by testing them in perturbed environments with agents that have optimized for reward functions unused during ERMAS training. This generalization error emulates the challenge faced in transferring policies to the real world. In particular, we show ERMAS can find AI Economist tax policies that achieve higher social welfare across a broad range of agent risk aversion objectives. In all, we demonstrate ERMAS is effective even in settings where baselines fail or become intractable. + +Contributions To summarize, our contributions are: + +• We derive a multi-agent adversarial robustness problem using $\epsilon$ -Nash equilibria, which poses a challenging nested optimization problem. +• We describe how ERMAS efficiently solves the nested problem using dualization, trustregions, and first-order meta-learning techniques. We empirically validate ERMAS by training robust policies in two multi-agent problems: sequential bimatrix games and economic simulations. In particular, ERMAS scales to complex spatiotemporal multi-agent simulations. + +# 2 ROBUSTNESS AND REALITY GAPS IN MULTI-AGENT ENVIRONMENTS + +We seek to learn a policy $\pi _ { p }$ for an agent, termed the planner, that interacts with an environment featuring $N$ other agents. The planner’s objective depends both on its own policy and the behavior of other agents in response to that policy; this is a multi-agent RL problem in which the planner and agents co-adapt. In practice, evaluating (and optimizing) $\pi _ { p }$ requires use of a simulation with agents that emulate those in the environment of interest (i.e. the real world), which might contain agents whose reward function differs from those used in the simulation. Our goal is to train planner policies that are robust to such reality gaps. + +Formally, we build on partially-observable multi-agent Markov Games (MGs) (Sutton & Barto, 2018), defined by the tuple $\dot { M } : = ( S , A , r , \mathcal { T } , \gamma , \overset { \triangledown } { o , \mathcal { T } } )$ , where $S$ and $A$ are the state and action spaces, respectively, and $\mathcal { T }$ are agent indices. Since the MG played by the agents depends on the choice of planner policy, we denote the MG given by $\pi _ { p }$ as $M [ \pi _ { p } ]$ . MGs proceed in episodes that last $H + 1$ steps (possibly infinite), covering $H$ transitions. At each time $t \in [ 0 , H ]$ , the world state is denoted $s _ { t }$ . Each agent $i = 1 , \ldots , N$ receives an observation $o _ { i , t }$ , executes an action $a _ { i , t }$ and receives a reward ${ \boldsymbol { r } } _ { i , t }$ . The environment transitions to the next state $s _ { t + 1 }$ , according to the transition distribution $\tau ( s _ { t + 1 } | s _ { t } , \mathbf { a } _ { t } )$ .1 Each agent observes $o _ { i , t }$ , a part of the state $s _ { t }$ . Agent policies $\pi _ { i }$ are parameterized by $\theta _ { i }$ while the planner policy $\pi _ { p }$ is parameterized by $\theta _ { p }$ . + +The Nash equilibria of $M [ \pi _ { p } ]$ are agent policies where any unilateral deviation is suboptimal: + +$$ +\begin{array} { r } { \mathrm { \mathbb { A } N E } ( \pi _ { p } ) : = \{ \pi \mid \forall i \in [ 1 , N ] , \tilde { \pi } _ { i } \in \Pi : J _ { i } ( \tilde { \pi } _ { i } , \pi _ { - i } , \pi _ { p } ) \leq J _ { i } ( \pi _ { i } , \pi _ { - i } , \pi _ { p } ) \} , } \end{array} +$$ + +where $\begin{array} { r } { J _ { i } ( \pmb { \pi } , \pi _ { p } ) : = \mathbb { E } _ { \pmb { \pi } , \pi _ { p } } \left[ \sum _ { t = 0 } ^ { H } \gamma ^ { t } r _ { t } ^ { ( i ) } \right] } \end{array}$ denotes the objective of agent $i$ . Hence, a rational agent would not unilaterally deviate from $\pi \in \bar { \mathrm { A N E } } ( \pi _ { p } )$ . + +To evaluate a fixed planner policy $\pi _ { p }$ , we simply sample outcomes using policies $\pi \in \tt { A N E } ( \pi _ { p } )$ . Also optimizing $\pi _ { p }$ introduces a form of two-level learning. Under appropriate conditions, this can be solved with simultaneous gradient descent (Zheng et al., 2020; Fiez et al., 2019). + +Robustness Objective As noted before, we wish to learn planner policies $\pi _ { p }$ that are robust to reality gaps arising from changes in agent reward functions, e.g., when agents are boundedly rational.2 We develop a robustness objective for the planner by formalizing such reality gaps as perturbations + +$\xi _ { i } \in \Xi$ to agent objectives, where the uncertainty set $\Xi : ( S , A ) ^ { H } \to \mathbb { R }$ is the space of possible perturbations and represents uncertainty about the objectives of other agents. We extend $\mathtt { A N E } ( \pi _ { p } , \xi )$ to condition the Nash equilibria on perturbations $\boldsymbol { \xi }$ : + +$$ +\begin{array} { r l } & { \mathtt { \mathbb { A } N E } ( \pi _ { p } , \xi ) : = \{ \pi \mid \forall i \in [ 1 , N ] , \tilde { \pi } _ { i } \in \Pi : J _ { i } ^ { \xi } ( \tilde { \pi } _ { i } , \pi _ { - i } , \pi _ { p } ) \leq J _ { i } ^ { \xi } ( \pi _ { i } , \pi _ { - i } , \pi _ { p } ) \} , } \\ & { J _ { i } ^ { \xi } ( \tilde { \pi } _ { i } , \pi _ { - i } , \pi _ { p } ) : = J _ { i } ( \tilde { \pi } _ { i } , \pi _ { - i } , \pi _ { p } ) + \mathbb { E } _ { \tau _ { i } \sim \tilde { \pi } _ { i } , \pi _ { - i } , \pi _ { p } } \left[ \xi _ { i } ( \tau _ { i } ) \right] } \end{array} +$$ + +where $\tau _ { i }$ is a trajectory (sequence of state-action pairs). Following Morimoto $\&$ Doya (2001), a robust planner optimizes its reward, subject to agents playing a perturbed Nash equilibrium $\mathtt { A N E } ( \pi _ { p } , \xi )$ that maximally penalizes the planner: + +$$ +\pi _ { p } ^ { * } = \underset { \pi _ { p } } { \arg \operatorname* { m a x } } ~ \underset { \xi \in \Xi } { \operatorname* { m i n } } ~ \underset { \pi \in \mathrm { { a N E } } ( \pi _ { p } , \xi ) } { \operatorname* { m i n } } ~ J _ { p } ( \pi , \pi _ { p } ) . +$$ + +Note that agent policies $\pi \in \mathop { \mathrm { A N E } } ( \pi _ { p } , \pmb { \xi } )$ describes agents that optimize their own reward function, and we assume an adversary chooses $\boldsymbol { \xi }$ . + +Bounded Uncertainty Set There are two challenges with Equation 4. First, if the adversary can arbitrarily choose $\Xi$ , the worst case is uninformative.3 Second, depending on the complexity of $\Pi$ , the uncertainty set $\Xi$ may be high-dimensional and intractable to search. We address these issues by upper-bounding the size of the uncertainty set, $L _ { \infty }$ norm of $\xi _ { i } \in \Xi$ , by the term $\epsilon$ . Thus $\epsilon$ upper-bounds the difference between the reward functions of agents in the training and testing environments, e.g., between simulation and the real world. This bounded uncertainty set is: + +$$ +\Xi _ { \epsilon } : = \left\{ \xi \left| \operatorname* { s u p } _ { \pi , \pi _ { p } } | \xi _ { i } ( \pi , \pi _ { p } ) | < \epsilon , { \mathrm { f o r } } { \mathrm { a l l } } i \in I \right. \right\} . +$$ + +This uncertainty set is equivalent to the $\epsilon$ -equilibria of $M [ \pi _ { p } ]$ + +$$ +\mathtt { A N E } ( \pi _ { p } , \epsilon ) : = \{ \pi \mid \forall i \in [ 1 , N ] , { \tilde { \pi } } _ { i } \in \Pi : J _ { i } ( { \tilde { \pi } } _ { i } , \pi _ { - i } , \pi _ { p } ) \leq J _ { i } ( \pi _ { i } , \pi _ { - i } , \pi _ { p } ) + \epsilon \} . +$$ + +$\epsilon$ is a tunable hyperparameter—this is the case with most robust RL (Pinto et al., 2017; Li et al., 2019)—but a good starting value is the anticipated error in reward objective estimates (applicationspecific). Using 6, the robustness objective becomes the following constrained optimization problem: + +$$ +\underbrace { \arg \operatorname* { m a x } J _ { p , \operatorname* { m i n } } ^ { * } ( \pi _ { p } , \epsilon ) } _ { \texttt { P l a n n e r - O P T } } , \quad \mathrm { ~ w h e r e ~ } J _ { p , \operatorname* { m i n } } ^ { * } ( \pi _ { p } , \epsilon ) : = \underbrace { \operatorname* { m i n } _ { \pi \in \mathrm { \mathrm { a N E } } ( \pi _ { p } , \epsilon ) } J _ { p } ( \pi , \pi _ { p } ) } _ { \texttt { a g e n t - A d v - S e a r c h } } . +$$ + +Using $\mathtt { A N E } ( \pi _ { p } , \epsilon )$ replaces the problem of intractably searching through $\Xi$ with searching through $\mathtt { A N E } ( \pi _ { p } , \epsilon )$ , and thus merges the two nested min operations in Equation 4. Conceptually, this transfers the worst-case search problem to the agents: Agent-Adv-Search agents find an adversarial equilibrium; Planner-OPT optimizes the planner given adversarial agents. Note that the constraint set in Eq 7 is non-empty for $\epsilon \geq 0$ ; the constraints (Eq 6) simply upper-bound the regret of agents. By definition, for non-empty bounded $\Pi$ , there exists an optimal policy with zero regret. + +# 3 ERMAS: ROBUST POLICIES IN MULTI-AGENT SIMULATIONS + +We now introduce ERMAS, an efficient optimization framework to solve the robustness problem in Equation 7. ERMAS proceeds in three steps. First, it dualizes Equation 7 following constrained RL. +Second, it defines a trust-region for the uncertainty set $\mathtt { A N E } ( \pi _ { p } , \epsilon )$ , approximating the dual problem. +Finally, it uses first-order meta-learning with trust-regions to solve the approximate dual problem. +See Appendix A.1 for the detailed Algorithm description. + +Dualizing Agent-Adv-Search The agent search problem in Equation 7 can be formulated similar to a constrained RL problem (Paternain et al., 2019), where the primary objective of the agents is to minimize the planner’s reward and the secondary objective is to maximize their own reward. While conventional constrained RL enforces a constant lower bound in the constraint, e.g., + +![](images/943d8f634e3d94ae59722df8702225ba2004a9f0331ec0769a80160845c2d6e2.jpg) +Figure 1: ERMAS trains planners that are robust to reality gaps in these testbed multi-agent simulations. (Left) In the repeated bimatrix game, a pair of agents navigates a 2D landscape. Both agents and the planner receive rewards based on visited coordinates. Brighter squares indicate higher payoff. (Right) In the spatiotemporal economic simulation, 4 heterogenous agents perform labor, trade resources, earn income, and pay taxes according to the schedules set by the planner. + +$J _ { i } ( \pi , \pi _ { p } ) \geq C$ , we enforce a dynamic one: $\forall i \in 1 \dots N : J _ { i } ( \pmb { \pi } , \pi _ { p } ) \geq J _ { i } ( \pi _ { i } ^ { * } , \pi _ { - i } , \pi _ { p } ) - \epsilon _ { : }$ , where $\pi _ { i } ^ { * }$ is the optimal unilateral deviation for agent $i$ : $\begin{array} { r } { \pi _ { i } ^ { * } : = \arg \operatorname* { m a x } _ { \tilde { \pi } _ { i } \in \Pi } J _ { i } \big ( \tilde { \pi } _ { i } , \pi _ { - i } , \pi _ { p } \big ) } \end{array}$ . + +Letting $\lambda$ denote Lagrange multipliers, we can dualize Agent-Adv-Search, i.e., Equation 4, as: + +$$ +\underset { \pi } { \mathop { \operatorname* { m i n } } } \underbrace { \Bigg ( J _ { p } ( \pi , \pi _ { p } ) - \sum _ { i = 1 } ^ { N } \lambda _ { i } \left[ J _ { i } ( \pi _ { i } ^ { * } , \pi _ { - i } , \pi _ { p } ) - J _ { i } ( \pi , \pi _ { p } ) - \epsilon _ { i } \right] \Bigg ) } _ { J _ { p , \operatorname* { m i n } } ^ { \dagger } ( \pi _ { p } , \epsilon ) } , +$$ + +This is identical to the dualization of constrained reinforcement learning, whose duality gap is empirically negligible and provably zero under weak assumptions (Paternain et al., 2019). We now abuse notation to denote $\pmb { \theta } : = [ \theta _ { 1 } , \ldots , \theta _ { N } , \theta _ { p } ]$ and $J _ { p } ( \pmb \theta ) \overset { \cdot } { : = } J _ { p } ( \pmb \pi , \pi _ { p } )$ where $\theta$ are the parameters of $\pi$ . To solve Equation 8, the agents apply gradients: + +$$ +\nabla _ { \boldsymbol { \theta } _ { i } } J _ { p , \mathrm { m i n } } ^ { \dagger } ( \pi _ { p } , \epsilon ) = - \nabla _ { \boldsymbol { \theta } _ { i } } J _ { p } ( \pmb { \theta } ) - \lambda _ { i } \nabla _ { \boldsymbol { \theta } _ { i } } \left[ J _ { i } ( \theta _ { i } ^ { \prime } ( \pmb { \theta } ) , \theta _ { - i } ) - J _ { i } ( \pmb { \theta } ) \right] , +$$ + +where $\theta _ { i } ^ { \prime } ( \pmb \theta )$ is the parameters of the optimal unilateral deviation $\pi _ { i } ^ { * }$ for agent $i$ , i.e. the parameters that minimize local regret, which depends on the current policy parameters $\theta _ { i }$ . $\lambda _ { i }$ is updated as: + +$$ +\nabla _ { \lambda _ { i } } J _ { p , \mathrm { m i n } } ^ { \dagger } ( \pi _ { p } , \epsilon ) = J _ { i } ( \pi _ { i } ^ { * } , \pi _ { - i } , \pi _ { p } ) - J _ { i } ( \pi , \pi _ { p } ) - \epsilon _ { i } . +$$ + +Equation 8 still poses a challenge through the $J _ { i } ( \pi _ { i } ^ { * } , \pi _ { - i } , \pi _ { p } )$ terms, which correspond to unknown agent regret. We now detail the efficient approximation of the value and derivative of agent regret using local and meta-learning approximations, respectively. + +Trust Regions using Local $\epsilon$ -equilibria Estimating regret requires knowledge of the optimal unilateral deviation for agent $i$ . We can simplify this problem by proposing a refinement of $\epsilon$ -equilibria inspired by the notion of local Nash equilibria in differentiable games (Ratliff et al., 2014). + +Definition 3.1. A strategy $\pi$ is a local $\epsilon$ -Nash equilibrium if there exists open sets $W _ { i } ~ \subset ~ \Pi ^ { N }$ such that $\pi _ { i } \ \in \ W _ { i }$ and for each $i \in \{ 1 , \ldots , N \}$ we have that $J _ { i } ( \pi _ { i } ^ { \prime } , \pi _ { - i } ) \le J _ { i } ( \pi ) + \epsilon ^ { \prime }$ for all $\pi _ { i } ^ { \prime } \in W _ { i } \setminus \{ \pi _ { i } \}$ , where $\begin{array} { r } { \epsilon ^ { \prime } : = \epsilon \operatorname* { s u p } _ { \pi _ { i } ^ { \prime } \in W _ { i } } K L ( \pi _ { i } | | \pi _ { i } ^ { \prime } ) } \end{array}$ . + +By instead performing Agent-Adv-Search on the local $\epsilon$ -Nash equilibria, we can limit the set of unilateral deviations to consider to a small trust region, $\Pi _ { \eta } ( \pi )$ : + +$$ +\begin{array} { r l } & { \mathbb { A } \mathbb { N } \mathbb { E } ( \pi _ { p } , \eta ) : = \{ \pi \mid \forall i \in [ 1 , N ] , \tilde { \pi } _ { i } \in \Pi _ { \eta } ( \pi _ { i } ) : J _ { i } \big ( \tilde { \pi } _ { i } , \pi _ { - i } , \pi _ { p } \big ) \leq J _ { i } \big ( \pi _ { i } , \pi _ { - i } , \pi _ { p } \big ) + \epsilon \} , } \\ & { \qquad \Pi _ { \eta } ( \pi ) : = \{ \pi ^ { \prime } \in \Pi \mid K L ( \pi | | \pi ^ { \prime } ) \leq \eta \} , } \end{array} +$$ + +![](images/5274686511e733fa2839aabccf052df3ff70f75bf3ce8cab833d5bae3e220e22.jpg) +Figure 2: Validating ERMAS Agent-Adv-Search in constrained repeated bimatrix games. Each point in the above scatter plots describes the average outcome at the end of training for the agents ( $\scriptstyle { \dot { x } }$ -coordinate) and the planner ( $y$ -coordinate). Error bars indicate standard deviation. (Left) The bimatrix reward structure encodes a social dilemma featuring a low-agent-reward/high-planner-reward Nash equilibrium, which is where vanilla MARL converges. Agents trained with ERMAS deviate from this equilibrium in order to reduce planner reward.  governs the extent of the allowable deviation. (Middle) As $\epsilon$ increases, the average per-timestep regret experienced by the agents also increases. Each average is taken over the final 12 episodes after rewards have converged. (Right) Using fixed values of $\lambda$ (rather than allowing it to update, as in the full algorithm) distorts performance and prevents agents from reaching the same $\epsilon$ -equilibria discovered with learned $\lambda$ . + +where $\eta > 0$ defines the size of the trust region. For small $\eta$ , algorithms such as TRPO (Schulman et al., 2017) can be used to efficiently approximate optimal local deviations of $\pi _ { i }$ , affording reasonable approximations of $J _ { i } ( \pi _ { i } ^ { * } , \pi _ { - i } , \pi _ { p } )$ . Note that our usage of trust region algorithms is not for optimization purposes. ERMAS requires the use of trust region optimization to ensure that the equilibria considered by ERMAS are limited to a local neighborhood of the policy space (Eq 11). + +First-Order Meta Learning Approximation The full gradient in Equation 9 is also complicated by the need to estimate the derivative of local regret $\nabla _ { \boldsymbol { \theta } _ { i } } \left[ J _ { i } ( \boldsymbol { \theta } _ { i } ^ { \prime } ( \boldsymbol { \theta } ) , \boldsymbol { \theta } _ { - i } ) - J _ { i } ( \boldsymbol { \theta } ) \right]$ . The second term maximizes the performance of the agent’s policy and is simply found with policy gradient. The first term is less straightforward: it minimizes the performance of the best agent policy in the current trust region. We note that this first term corresponds to a meta-learning gradient. We follow REPTILE (Nichol et al., 2018) to obtain a first-order approximation of a $M$ -step meta-learning gradient: + +$$ +\nabla _ { \theta _ { i } } J _ { i } ( \theta _ { i } ^ { \prime } ( \theta ) , \theta _ { - i } ) = g _ { 1 } - \frac { 1 } { M } \sum _ { i = 1 } ^ { M } g _ { i } , \quad g _ { i } = \nabla _ { \theta _ { i } } J _ { i } \left( \theta _ { i } + \sum _ { j = 1 } ^ { i - 1 } g _ { j } , \theta _ { - i } , \theta _ { p } \right) , +$$ + +where $g _ { i }$ denotes the ith policy gradient in the direction of $J _ { i }$ . In practice, we scale this meta-learning term with the hyperparameter $\beta$ as $\beta < 1$ incorporates a helpful inductive bias where maximizing agent reward leads to local maxima. We can alternatively apply this gradient update periodically, to both mimic $\beta < 1$ and reduce computation overhead. First-order meta-learning approximations are known to be empirically effective, and are necessary for ERMAS to efficiently solve $\operatorname { E q } 8$ . + +ERMAS By solving the dual problem (Eq. 8), ERMAS yields robustness to $\epsilon$ -equilibria and, equivalently, uncertainty in agent objectives. ERMAS solves the dual problem by combining trust regions and meta-learning techniques to estimate and differentiate agent regret. Algorithm 1 and 2 (Appendix A.1) describe an efficient implementation of this procedure for nested policy learning. + +# 4 EXPERIMENTAL VALIDATION IN MULTI-AGENT SIMULATIONS + +# 4.1 ERMAS SOLVES THE INNER LOOP: AG E N T-AD V-SE A R C H + +Constrained Repeated Bimatrix Game We analyze the agent behaviors learned by Agent-Adv-Search in experiments depicted in Figure 2. These experiments apply ERMAS to the classic repeated bimatrix game, which is well-studied in the game theory literature as its Nash equilibria can be solved efficiently. At each timestep, a row player (Agent 1) and column player (Agent 2) simultaneously choose from a finite number of actions. Each pair of actions $( i , j )$ corresponds to a pair of payoffs for the agents $r _ { 1 } ( i , j ) , r _ { 2 } ( i , j )$ . We select the payoff matrices $r _ { 1 }$ and $r _ { 2 }$ , illustrated in Figure 1a, so that only one Nash equilibrium exists and that the equilibrium constitutes a “tragedy-of-the-commons,” where agents selfishly optimizing their own reward leads to less reward overall. To extend this repeated bimatrix game into sequential decision making, we further constrain the game so that, at any timestep, agents can only choose an action adjacent to their action in the previous timestep. We also introduce a passive planner that observes the game and receives a payoff $r _ { p } ( i , j )$ . The planner does not take any actions and its payoff is constructed such that its reward is high when the agents are at the Nash equilibrium. In effect, this toy setting allows us to verify that ERMAS samples realistic worst-case behaviors–that is, that Agents 1 and 2 learn to deviate from their tragedy-of-commons equilibrium in order to reduce the planner’s reward but also without significantly increasing their own regret. + +![](images/3b722fb35f4b942fcce4910c3b2516dc8aa725874c1d244415381579289f8ea9.jpg) +Figure 3: Planner and agent rewards in the repeated bimatrix game over training time. Each line represents an average over 10 seeds, with error bars indicating standard error. The lines correspond to runs of ERMAS and are colored according to $\beta$ , the weight of the meta-learning term of Equation 13. (Left) Planner performance over training episodes. (Middle) Agent 1 performance over training episodes. (Right) Agent 2 performance over training episodes. + +Discovering $\epsilon$ -Equilibria Figure 2 (left) visualizes how the equilibria reached by AI agents balance the reward of the planner (y-axis) and agents ( $\mathbf { \dot { X } } - \mathbf { \dot { X } } - \mathbf { \dot { X } } - \mathbf { \dot { X } } - \mathbf { \dot { X } } = \mathbf { \dot { X } } - \mathbf { \dot { X } } .$ -axis). Conventional multi-agent RL discovers the Nash equilibrium, which is visualized in the top left. At this equilibrium, the agents do not cooperate and the planner receives high reward. For small values of $\epsilon$ , ERMAS also discovers the Nash equilibrium. Because $\epsilon$ acts as a constraint on agent regret, larger values of $\epsilon$ enable ERMAS to deviate farther from the Nash equilibrium, discovering $\epsilon$ -equilibria to the bottom-right that result in lower planner rewards. Deviations from a Nash equilibrium are associated with higher regret, meaning that regret should increase with $\epsilon$ . Figure 2 (middle) clearly demonstrates that ERMAS imparts this trend. As described by Equation 7, this display of adversarial behavior is key to learning a more robust planner. + +# 4.2 ALL THE COMPONENTS OF ERMAS ARE NECESSARY + +Dynamic or Frozen Lagrange multipliers $\lambda _ { i }$ The Lagrange multipliers $\boldsymbol { \lambda }$ balance the dual objectives of seeking stable agent equilibria and minimizing the planner’s reward. Recall that smaller values of $\lambda$ mean agent objectives are more antagonistic. The $\boldsymbol { \lambda }$ are updated using local estimates of agent regret, as described in Equation 8. We can validate that these updates are necessary by analyzing the equilibria learned by ERMAS when $\boldsymbol { \lambda }$ are not updated. Fixing a value of $\boldsymbol { \lambda }$ reduces Equation 8 to learning with shared rewards. Figure 2 (right) visualizes the equilibria discovered with frozen $\lambda$ in the same format as the Figure 2 (left) plot. This visualization shows that freezing $\boldsymbol { \lambda }$ affects the equilibria discovered by ERMAS; the bottom right quadrant which contains the $\epsilon$ -equilibria discovered with dynamic $\lambda$ are not reached for any values of $\lambda$ . This validates that certain $\epsilon$ -equilibria are only reachable with dynamic $\lambda$ and hence the updates in 8 are necessary for proper behavior.4 + +![](images/f26691b56531ed2956c8a36b1b9e767d39ff089799c7e9a988f5a0f6b8b0d54c.jpg) +Figure 4: Robust planner learning in the repeated bimatrix game. Average planner performance as a function of the reward perturbation coefficient $Q$ in the test environment. Each point represents an average over 5 seeds, with error bars indicating standard error. Vertical dashed lines denote the training environment $Q$ . (Left) Average planner performance at convergence. (Right) Performance relative to the vanilla MARL baseline, which is trained without a robustness objective. + +First-order Approximation Using the first order approximation of Equation 13 might slow learning, since we step “away” from the direction that the standard policy gradient suggests. In contrast, we find that the ERMAS update can significantly speed up convergence. Figure 3 depicts the learning curve of variants of ERMAS with varying weights, $\beta$ , on the meta-learning term. For instance, when $\beta = 0$ , the meta-learning term is completely dropped. We find that lines corresponding to larger values of $\beta$ reach improved agent rewards half an order of magnitude faster than lower values of $\beta$ . However, larger values of $\beta$ fail to reach the desirable region of adversarial $\epsilon$ -equilibria. In both cases, very large $\begin{array} { r } { ( \bar { \beta } > \frac { 1 } { N } , } \end{array}$ ) and very small $( \beta \sim 0 )$ fail to fully reach and remain at the adversarial region. However, an appropriate range for $\beta$ gives rapid convergence and good asymptotic behavior. + +# 4.3 SOLVING PL A N N E R-OPT USING AG E N T-AD V-SE A R C H + +We now show that ERMAS yields planners $\pi _ { p }$ which are more robust to uncertainty in the agent’s reward function. Specifically, we empirically validate that ERMAS can find strong solutions to the nested optimization problems Agent-Adv-Search and Planner-OPT, in two simulations: repeated bimatrix games and economic simulations (see Figure 1). + +Evaluation Workflow To measure planner robustness, we evaluate trained planners in test environments with a reality gap (i.e. reward parameterizations that differ from the training environment), containing test agents that are optimized for the test environment’s reward functions and that have not been seen by the planner. We proceed as follows: 1) Train the agents and planner with ERMAS. 2) Fix the planner and transfer it to a test environment, then train new agents from scratch in the test environment with reward functions unseen by the planner. 3) Report the value of the planner objective after the new agents have converged. + +Augmented Repeated Bimatrix Games We now extend the bimatrix game to a nested reinforcement learning problem by allowing the planner to take actions and influence its own experienced reward. The planner now selects an integer $a \geq 0$ that modifies its new reward function: $\bar { a r } _ { p } ( i , j ) - a ^ { 2 }$ . This function is chosen for its quadratic form: $a$ scales the reward but adds a cost $a ^ { 2 }$ which disincentives large values of $a$ . Agents are modified to receive a new reward function $r _ { i } ^ { \prime } = r _ { i } - Q r _ { p }$ where $r _ { i }$ is their original reward function and $Q \leq 1$ is an unknown scalar which may differ between training and testing environments. If $Q = 0$ , agents act identical to the experiments in Figure 2. For environments with larger values of $Q$ , e.g., $Q = 0 . 5$ , agents have an incentive to be adversarial. + +Figure 4 shows the test performance of ERMAS against vanilla multi-agent RL policies learned with $Q _ { \mathrm { t r a i n } } = 0 . 5$ or with $Q _ { \mathrm { t r a i n } } = 0$ . Naturally, MARL trained with $Q _ { \mathrm { t r a i n } } = 0 . 5$ underperforms MARL trained with $Q _ { \mathrm { t r a i n } } = 0$ when evaluated in environments where $Q _ { \mathrm { t e s t } } < 0 . 3$ . However, MARL trained with $Q _ { \mathrm { t r a i n } } = 0 . 5$ outperforms when $Q _ { \mathrm { t e s t } } > 0 . 3$ . Agent-Adv-Search successfully finds the worst-case perturbation, and yields a planner policy at least as good as MARL $Q _ { \mathrm { t r a i n } } = 0 . 5$ . This shows that ERMAS can produce policies which are robust to uncertainty in agents’ objectives and is a tractable adversarial robustness algorithm. + +Existing single-agent and multi-agent robust reinforcement learning algorithms optimize for different robustness objectives than ERMAS. However, some general techniques for addressing Sim2Real can be extended to provide an alternative to ERMAS’s adversarial approach. Our first baseline extends the technique of domain randomization (DR) by applying random perturbations to agent rewards. For DR, agents receive $r _ { i } ^ { \prime } = r _ { i } + \sigma$ , where $\sigma \sim U [ - 1 , 1 ]$ (recall $r _ { i } \in [ 0 , 1 ] ,$ ). These perturbations are randomized periodically between episodes. Even in a simple 4-by-4 bimatrix game, there are $2 3 0 4 = 1 6$ states $\times 1 6$ states $\times 9$ actions possible reward values to perturb; a 2304-dimensional space is too sparse to cover uniformly. Furthermore, in contrast to DR of visual inputs or dynamics, there is a natural latency to the effect of DR of agent rewards: randomization only has an effect if agents learn to adapt to their perturbed rewards. Our second baseline, risk robustness (RR), applies a concavity to planner rewards, e.g., $\log r _ { p }$ . This encourages robustness to environment stochasticity, including the randomness of agent policies. As illustrated in Figure 4, neither the domain randomization nor risk robustness baseline yields meaningful robustness even in this simple setting. + +# 4.4 ERMAS FOR LARGE-SCALE TWO-LEVEL LEARNING: AI ECONOMIST + +We now address an important use-case, tax policy design, to demonstrate ERMAS at scale. We train a robust AI Economist: a planner for optimal taxation that acts in a spatiotemporal economic simulation, see Zheng et al. (2020) for a detailed description. This setting is very challenging given the scale of the simulation and agent affordances. In particular, adversarial and randomization baselines do not scale to this setting. In this simulation, agents optimize their expected utility $\mathbb { E } _ { \pi , \pi _ { p } } \left[ \sum _ { t = 0 } ^ { T } r _ { i , t } \right]$ , where the utility ${ \boldsymbol { r } } _ { i , t }$ is a function of labor $l _ { i , t }$ and post-tax endowments $\tilde { x } _ { i , t }$ : + +$$ +\tilde { z } _ { i , t } = z _ { i , t } - T ( z _ { i , t } ) , \quad \tilde { x } _ { i , t } = \sum _ { t ^ { \prime } \leq t } \tilde { z } _ { i , t } , \quad r _ { i , t } ( \tilde { x } _ { i , t } , l _ { i , t } ) = \frac { \tilde { x } _ { i , t } ^ { 1 - \eta } - 1 } { 1 - \eta } - l _ { i , t } , \quad \eta > 0 , +$$ + +where $\eta$ sets the degree of risk aversion (higher $\eta$ means higher risk aversion). Agents earn income $z _ { i , t }$ and pay taxes $T ( z _ { i , t } )$ , which are set by the planner. The planner optimizes social welfare swf: + +$$ +{ \mathsf { s w f } } = \mathsf { e q } ( x ) \cdot \mathtt { p r o d } ( x ) , \quad \mathsf { e q } ( x ) = 1 - \frac { N } { N - 1 } \mathtt { g i n i } ( x ) , \quad \mathtt { p r o d } ( x ) = \sum _ { i = 1 } ^ { N } x _ { i } , +$$ + +a combination of equality (Gini, 1912) and productivity. + +Figure 5 shows the performance of ERMAS tax policies along with baseline tax policies (Saez, US Federal) and an AI Economist (MARL). All models are trained on agents with $\eta = 0 . 2 3$ . We replicate Zheng et al. (2020): MARL outperforms the Saez tax. However, MARL fails to outperform Saez when testing with $\eta < 0 . 2 2$ and $\eta > 0 . 2 8$ . In contrast, ERMAS yields consistent gains across the depicted range of $\eta$ . This shows that ERMAS’s tax policy can improve swf even if agent risk aversion significantly increases or decreases (e.g., due to economic cycles or exogenous shocks). + +In fact, ERMAS outperforms the baseline AI Economist for the original setting of $\eta = 0 . 2 3$ . This suggests the robustness and performance do not necessarily pose a zero-sum game: ERMAS can find equilibria with high performance and strong generalization. It has been observed empirically in various studies that single-agent robust reinforcement learning similarly yields performance improvements even in the absence of environment perturbations (Pinto et al., 2017). + +# 5 RELATED WORK + +Sim2real: Reality Gaps The Sim2Real problem considers how reality gaps, i.e., mismatches between a simulation and reality, can (negatively) impact RL policies. Robust performance across reality gaps has been studied when applying deep RL to robotic control with visual inputs (James et al., 2019; Christiano et al., 2016; Rusu et al., 2016; Tzeng et al., 2015). To close reality gaps, domain adaptation aims to transfer a simulated distribution (of the world) to the real world (Higgins et al., 2017; Kim et al., 2019). In comparison, the study of reality gaps in multi-agent RL is relatively nascent (Suh et al., 2019; Nachum et al., 2019). + +Multi-Agent Robustness Morimoto & Doya (2001) proposed robust RL for the worst-case adversarial objective (i.e., a max-min optimization problem), inspired by $\mathcal { H } _ { \infty }$ control, and provided analytical solutions in the linear setting. The robust RL problem can be solved using an adversarial player that chooses perturbations. Rather than the worst-case, Pinto et al. (2017) optimized for the $\alpha$ -quantile of reward, using a conditional value-at-risk (CVAR) interpretation of adversarial robustness. We consider perturbations to agent rewards. Other works have studied perturbing transition matrices, observation spaces, and action probabilities, which are relevant to robotics and control applications (Pinto et al., 2017; Tessler et al., 2019; Hou et al., 2020; Li et al., 2019). We also address a more challenging multi-agent setting than previous works. First, agents do not necessarily optimize for the same (robustness) objective. We therefore consider a one-sided robustness problem where only the planner is expected to act robustly. This setting is significantly more difficult than previous works that assume all agents act robustly (Li et al., 2019). Second, we address a challenging nested reinforcement learning setting of interest to important real-world applications such as economics mechanism design (Zheng et al., 2020). Although we formulate ERMAS as using simultaneous gradient descent, ERMAS can be easily extended to use nested optimization solvers such as competitive gradient descent (Schafer & Anandkumar, 2020). ¨ + +![](images/56e995203fcde21443f9a9a16168b1244202cb7c4b065c12c8ceb5ed881f5c51.jpg) +Figure 5: Learning robust optimal taxation in an economic simulation. Results are plotted following the same conventions in Figure 4. Due to the intractability of other robustness algorithms in this setting, we instead compare against different planner choices. “US Federal” uses a fixed tax scheme adapted from the 2018 US Federal income tax rates. “Saez” uses an adaptive, theoretical formula to estimate optimal tax rates. + +See Appendix A.2 for additional related work. + +# 6 FUTURE WORK + +Future work could extend ERMAS to reality gaps due to different causes, such as changes in transition dynamics, agent affordances, number of agents, etc, which might require more refined approximations to the planner’s robustness objective. Furthermore, it would be interesting to apply ERMAS to problems that feature more general solution concepts, e.g., Bayesian Nash equilibria, correlated equilibria, Walrassian equilibria, and others. + +# REFERENCES + +Dirk Bergemann and Stephen Morris. Robust mechanism design. Econometrica, 73(6):1771–1813, 2005. ISSN 00129682, 14680262. URL http://www.jstor.org/stable/3598751. + +Eric Bonabeau. Agent-based modeling: Methods and techniques for simulating human systems. Proceedings of the National Academy of Sciences, 99(suppl 3):7280–7287, May 2002. ISSN 0027-8424, 1091-6490. doi: 10.1073/pnas.082080899. URL https://www.pnas.org/ content/99/suppl_3/7280. Publisher: National Academy of Sciences Section: Colloquium Paper. + +Paul Christiano, Zain Shah, Igor Mordatch, Jonas Schneider, Trevor Blackwell, Joshua Tobin, Pieter Abbeel, and Wojciech Zaremba. Transfer from Simulation to Real World through Learning Deep Inverse Dynamics Model. October 2016. URL https://arxiv.org/abs/1610. 03518v1. + +Paul Dutting, Zhe Feng, Harikrishna Narasimhan, David Parkes, and Sai Srivatsa Ravindranath. ¨ Optimal auctions through deep learning. In International Conference on Machine Learning, pp. 1706–1715, 2019. + +Tanner Fiez, Benjamin Chasnov, and Lillian J. Ratliff. Convergence of Learning Dynamics in Stackelberg Games. arXiv, jun 2019. URL http://arxiv.org/abs/1906.01217. + +Chelsea Finn, Pieter Abbeel, and Sergey Levine. Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. arXiv:1703.03400 [cs], July 2017. URL http://arxiv.org/abs/ 1703.03400. arXiv: 1703.03400. + +C. Gini. Variabilita e mutabilit \` a\` . 1912. + +Irina Higgins, Arka Pal, Andrei A Rusu, Loic Matthey, Christopher P Burgess, Alexander Pritzel, Matthew Botvinick, Charles Blundell, and Alexander Lerchner. Darla: Improving zero-shot transfer in reinforcement learning. arXiv preprint arXiv:1707.08475, 2017. + +John H. Holland and John H. Miller. Artificial Adaptive Agents in Economic Theory. American Economic Review, 81(2):365–71, 1991. URL https://econpapers.repec.org/article/ aeaaecrev/v_3a81_3ay_3a1991_3ai_3a2_3ap_3a365-71.htm. Publisher: American Economic Association. + +Linfang Hou, Liang Pang, Xin Hong, Yanyan Lan, Zhiming Ma, and Dawei Yin. Robust Reinforcement Learning with Wasserstein Constraint. arXiv:2006.00945 [cs, stat], June 2020. URL http://arxiv.org/abs/2006.00945. arXiv: 2006.00945. + +Peter Howitt. What have central bankers learned from modern macroeconomic theory? Journal of Macroeconomics, 34(1):11–22, March 2012. ISSN 0164-0704. doi: 10.1016/j. jmacro.2011.08.005. URL http://www.sciencedirect.com/science/article/ pii/S0164070411000619. + +Stephen James, Paul Wohlhart, Mrinal Kalakrishnan, Dmitry Kalashnikov, Alex Irpan, Julian Ibarz, Sergey Levine, Raia Hadsell, and Konstantinos Bousmalis. Sim-to-real via sim-to-sim: Dataefficient robotic grasping via randomized-to-canonical adaptation networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 12627–12637, 2019. + +Kun Ho Kim, Yihong Gu, Jiaming Song, Shengjia Zhao, and Stefano Ermon. Cross Domain Imitation Learning. arXiv:1910.00105 [cs, stat], September 2019. URL http://arxiv.org/ abs/1910.00105. arXiv: 1910.00105. + +Alan P. Kirman. Whom or What Does the Representative Individual Represent? Journal of Economic Perspectives, 6(2):117–136, June 1992. ISSN 0895-3309. doi: 10.1257/jep.6.2.117. URL https://www.aeaweb.org/articles?id=10.1257/jep.6.2.117. + +Shihui Li, Yi Wu, Xinyue Cui, Honghua Dong, Fei Fang, and Stuart Russell. Robust Multi-Agent Reinforcement Learning via Minimax Deep Deterministic Policy Gradient. Proceedings of the AAAI Conference on Artificial Intelligence, 33:4213–4220, July 2019. doi: 10.1609/aaai.v33i01. 33014213. + +Jun Morimoto and Kenji Doya. Robust Reinforcement Learning. In T. K. Leen, T. G. Dietterich, and V. Tresp (eds.), Advances in Neural Information Processing Systems 13, pp. 1061–1067. MIT Press, 2001. URL http://papers.nips.cc/paper/ 1841-robust-reinforcement-learning.pdf. + +Roger B. Myerson. Mechanism Design, pp. 1–13. Palgrave Macmillan UK, London, 2016. ISBN 978-1-349-95121-5. doi: 10.1057/978-1-349-95121-5 2675-1. URL https://doi.org/ 10.1057/978-1-349-95121-5_2675-1. + +Ofir Nachum, Michael Ahn, Hugo Ponte, Shixiang Gu, and Vikash Kumar. Multi-Agent Manipulation via Locomotion using Hierarchical Sim2Real. arXiv:1908.05224 [cs], October 2019. URL http://arxiv.org/abs/1908.05224. arXiv: 1908.05224. + +Alex Nichol, Joshua Achiam, and John Schulman. On First-Order Meta-Learning Algorithms. arXiv:1803.02999 [cs], October 2018. URL http://arxiv.org/abs/1803.02999. arXiv: 1803.02999. + +Santiago Paternain, Luiz F. O. Chamon, Miguel Calvo-Fullana, and Alejandro Ribeiro. Constrained Reinforcement Learning Has Zero Duality Gap. arXiv:1910.13393 [cs, math, stat], October 2019. URL http://arxiv.org/abs/1910.13393. arXiv: 1910.13393. + +Xue Bin Peng, Marcin Andrychowicz, Wojciech Zaremba, and Pieter Abbeel. Sim-to-Real Transfer of Robotic Control with Dynamics Randomization. 2018 IEEE International Conference on Robotics and Automation (ICRA), pp. 3803–3810, May 2018. doi: 10.1109/ICRA.2018.8460528. URL http://arxiv.org/abs/1710.06537. arXiv: 1710.06537. + +Wolfgang Pesendorfer. Behavioral economics comes of age: A review essay on advances in behavioral economics. Journal of Economic Literature, 44(3):712–721, 2006. + +Lerrel Pinto, James Davidson, Rahul Sukthankar, and Abhinav Gupta. Robust Adversarial Reinforcement Learning. arXiv:1703.02702 [cs], March 2017. URL http://arxiv.org/abs/ 1703.02702. arXiv: 1703.02702. + +Lillian J. Ratliff, Samuel A. Burden, and S. Shankar Sastry. On the Characterization of Local Nash Equilibria in Continuous Games. arXiv:1411.2168 [math], November 2014. URL http: //arxiv.org/abs/1411.2168. arXiv: 1411.2168. + +Andrei A. Rusu, Mel Vecerik, Thomas Rothorl, Nicolas Heess, Razvan Pascanu, and Raia Hadsell.¨ Sim-to-Real Robot Learning from Pixels with Progressive Nets. October 2016. URL https: //arxiv.org/abs/1610.04286v2. + +John Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, and Pieter Abbeel. Trust Region Policy Optimization. arXiv:1502.05477 [cs], April 2017. URL http://arxiv.org/abs/ 1502.05477. arXiv: 1502.05477. + +Florian Schafer and Anima Anandkumar. Competitive Gradient Descent. ¨ arXiv:1905.12103 [cs, math], June 2020. URL http://arxiv.org/abs/1905.12103. arXiv: 1905.12103. + +Herbert A. Simon. From substantive to procedural rationality. In T. J. Kastelein, S. K. Kuipers, W. A. Nijenhuis, and G. R. Wagenaar (eds.), 25 Years of Economic Theory: Retrospect and prospect, pp. 65–86. Springer US, Boston, MA, 1976. ISBN 978-1-4613-4367-7. doi: 10.1007/ 978-1-4613-4367-7 6. URL https://doi.org/10.1007/978-1-4613-4367-7_6. + +Herbert A. Simon and Jonathan Schaeffer. The Game of Chess. Technical report, CARNEGIEMELLON UNIV PITTSBURGH PA ARTIFICIAL INTELLIGENCE AND PSYCHOLOGY PROJECT, December 1990. URL https://apps.dtic.mil/sti/citations/ ADA225613. Section: Technical Reports. + +Young-Ho Suh, Sung-Pil Woo, Hyunhak Kim, and Dong-Hwan Park. A sim2real framework enabling decentralized agents to execute MADDPG tasks. In Proceedings of the Workshop on Distributed Infrastructures for Deep Learning, DIDL ’19, pp. 1–6, Davis, CA, USA, December 2019. Association for Computing Machinery. ISBN 978-1-4503-7037-0. doi: 10.1145/3366622. 3368146. URL https://doi.org/10.1145/3366622.3368146. + +Richard S. Sutton and Andrew G. Barto. Reinforcement learning: An introduction. MIT press, 2018. + +Chen Tessler, Yonathan Efroni, and Shie Mannor. Action Robust Reinforcement Learning and Applications in Continuous Control. arXiv:1901.09184 [cs, stat], May 2019. URL http:// arxiv.org/abs/1901.09184. arXiv: 1901.09184. + +Josh Tobin, Rachel Fong, Alex Ray, Jonas Schneider, Wojciech Zaremba, and Pieter Abbeel. Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real World. arXiv:1703.06907 [cs], March 2017. URL http://arxiv.org/abs/1703.06907. arXiv: 1703.06907. + +Eric Tzeng, Coline Devin, Judy Hoffman, Chelsea Finn, Pieter Abbeel, Sergey Levine, Kate Saenko, and Trevor Darrell. Adapting Deep Visuomotor Representations with Weak Pairwise Constraints. November 2015. URL https://arxiv.org/abs/1511.07111v5. + +Stephan Zheng, Alexander Trott, Sunil Srinivasa, Nikhil Naik, Melvin Gruesbeck, David C. Parkes, and Richard Socher. The AI Economist: Improving Equality and Productivity with AI-Driven Tax Policies. arXiv:2004.13332 [cs, econ, q-fin, stat], April 2020. URL http://arxiv. org/abs/2004.13332. arXiv: 2004.13332. \ No newline at end of file diff --git a/parse/train/uIc4W6MtbDA/uIc4W6MtbDA_content_list.json b/parse/train/uIc4W6MtbDA/uIc4W6MtbDA_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..9c885e90e72a5a2e64170e2be7dce4d0cb19640c --- /dev/null +++ b/parse/train/uIc4W6MtbDA/uIc4W6MtbDA_content_list.json @@ -0,0 +1,1392 @@ +[ + { + "type": "text", + "text": "ERMAS: LEARNING POLICIES ROBUST TO REALITY GAPS IN MULTI-AGENT SIMULATIONS ", + "text_level": 1, + "bbox": [ + 176, + 98, + 820, + 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": "Policies for real-world multi-agent problems, such as optimal taxation, can be learned in multi-agent simulations with AI agents that emulate humans. However, simulations can suffer from reality gaps as humans often act suboptimally or optimize for different objectives (i.e., bounded rationality). We introduce $\\epsilon \\cdot$ - Robust Multi-Agent Simulation (ERMAS), a robust optimization framework to learn AI policies that are robust to such multi-agent reality gaps. The objective of ERMAS theoretically guarantees robustness to the $\\epsilon$ -Nash equilibria of other agents – that is, robustness to behavioral deviations with a regret of at most $\\epsilon$ ERMAS efficiently solves a first-order approximation of the robustness objective using meta-learning methods. We show that ERMAS yields robust policies for repeated bimatrix games and optimal adaptive taxation in economic simulations, even when baseline notions of robustness are uninformative or intractable. In particular, we show ERMAS can learn tax policies that are robust to changes in agent risk aversion, improving policy objectives (social welfare) by up to $15 \\%$ in complex spatiotemporal simulations using the AI Economist (Zheng et al., 2020). ", + "bbox": [ + 233, + 267, + 764, + 474 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 502, + 336, + 518 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Reinforcement learning (RL) offers a tool to optimize policy decisions affecting complex, multiagent systems; for example, to improve traffic flow or economic productivity. In practice, the need for efficient policy evaluation necessitates training on simulations of multi-agent systems (MAS). Agents in these systems can be emulated with fixed behavioral rules, or by optimizing for a reward function using RL (Zheng et al., 2020). For instance, the impact of economic policy decisions are often estimated with agent-based models (Holland & Miller, 1991; Bonabeau, 2002). This commonly introduces a reality gap as the reward function and resulting behavior of simulated agents might differ from those of real people (Simon & Schaeffer, 1990). This becomes especially problematic as the complexity of the simulation grows, for example, when increasing the number of agents, or adding agent affordances (Kirman, 1992; Howitt, 2012). As a result, policies learned in imperfect simulations need to be robust against reality gaps in order to be effective in the real world. ", + "bbox": [ + 174, + 535, + 825, + 686 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We introduce $\\epsilon$ -Robust Multi-Agent Simulation (ERMAS), a robust optimization framework for training robust policies, termed planners, that interact with real-world multi-agent systems. ERMAS trains robust planners by simulating multi-agent systems with RL and sampling worst-case behaviors from the worst-case agents. This form of multi-agent robustness poses a very challenging multilevel (e.g., max-min-min) optimization problem. Existing techniques which could be applied to ERMAS’s multi-agent robustness objective, e.g., naive adversarial robustness (Pinto et al., 2017) and domain randomization (Tobin et al., 2017; Peng et al., 2018), are intractable as they would require an expensive search through a large space of agent reward functions. Alternative frameworks improve robustness, e.g., to changes in environment dynamics, observation or action spaces (Pinto et al., 2017; Li et al., 2019; Tessler et al., 2019), but do not address reality gaps due to reward function mismatches, as they use inappropriate metrics on the space of adversarial perturbations. ", + "bbox": [ + 174, + 694, + 825, + 847 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "To solve this problem, ERMAS has three key features: 1) It formulates a multi-agent robustness objective equivalent to finding the worst case $\\epsilon$ -Nash equilibria. 2) It optimizes a tractable dual problem to the equivalent objective. 3) It approximates the dual problem using local solution concepts and first-order meta-learning techniques (Nichol et al., 2018; Finn et al., 2017). ERMAS ultimately yields policies that are robust to other agents’ behavioral deviations, up to a regret of $\\epsilon$ . ", + "bbox": [ + 174, + 854, + 823, + 924 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "We show that ERMAS learns robust policies in repeated bimatrix games by finding the worst-case reality gaps, corresponding to highly adversarial agents, which in turn leads to more robust planners. We further consider a challenging, large-scale spatiotemporal economy that features a social planner that learns to adjust agent rewards. In both settings, we show policies trained by ERMAS are more robust by testing them in perturbed environments with agents that have optimized for reward functions unused during ERMAS training. This generalization error emulates the challenge faced in transferring policies to the real world. In particular, we show ERMAS can find AI Economist tax policies that achieve higher social welfare across a broad range of agent risk aversion objectives. In all, we demonstrate ERMAS is effective even in settings where baselines fail or become intractable. ", + "bbox": [ + 174, + 103, + 825, + 229 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Contributions To summarize, our contributions are: ", + "bbox": [ + 174, + 244, + 529, + 258 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• We derive a multi-agent adversarial robustness problem using $\\epsilon$ -Nash equilibria, which poses a challenging nested optimization problem. \n• We describe how ERMAS efficiently solves the nested problem using dualization, trustregions, and first-order meta-learning techniques. We empirically validate ERMAS by training robust policies in two multi-agent problems: sequential bimatrix games and economic simulations. In particular, ERMAS scales to complex spatiotemporal multi-agent simulations. ", + "bbox": [ + 215, + 270, + 825, + 378 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 ROBUSTNESS AND REALITY GAPS IN MULTI-AGENT ENVIRONMENTS ", + "text_level": 1, + "bbox": [ + 173, + 398, + 782, + 415 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We seek to learn a policy $\\pi _ { p }$ for an agent, termed the planner, that interacts with an environment featuring $N$ other agents. The planner’s objective depends both on its own policy and the behavior of other agents in response to that policy; this is a multi-agent RL problem in which the planner and agents co-adapt. In practice, evaluating (and optimizing) $\\pi _ { p }$ requires use of a simulation with agents that emulate those in the environment of interest (i.e. the real world), which might contain agents whose reward function differs from those used in the simulation. Our goal is to train planner policies that are robust to such reality gaps. ", + "bbox": [ + 173, + 429, + 825, + 529 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Formally, we build on partially-observable multi-agent Markov Games (MGs) (Sutton & Barto, 2018), defined by the tuple $\\dot { M } : = ( S , A , r , \\mathcal { T } , \\gamma , \\overset { \\triangledown } { o , \\mathcal { T } } )$ , where $S$ and $A$ are the state and action spaces, respectively, and $\\mathcal { T }$ are agent indices. Since the MG played by the agents depends on the choice of planner policy, we denote the MG given by $\\pi _ { p }$ as $M [ \\pi _ { p } ]$ . MGs proceed in episodes that last $H + 1$ steps (possibly infinite), covering $H$ transitions. At each time $t \\in [ 0 , H ]$ , the world state is denoted $s _ { t }$ . Each agent $i = 1 , \\ldots , N$ receives an observation $o _ { i , t }$ , executes an action $a _ { i , t }$ and receives a reward ${ \\boldsymbol { r } } _ { i , t }$ . The environment transitions to the next state $s _ { t + 1 }$ , according to the transition distribution $\\tau ( s _ { t + 1 } | s _ { t } , \\mathbf { a } _ { t } )$ .1 Each agent observes $o _ { i , t }$ , a part of the state $s _ { t }$ . Agent policies $\\pi _ { i }$ are parameterized by $\\theta _ { i }$ while the planner policy $\\pi _ { p }$ is parameterized by $\\theta _ { p }$ . ", + "bbox": [ + 173, + 534, + 825, + 662 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "The Nash equilibria of $M [ \\pi _ { p } ]$ are agent policies where any unilateral deviation is suboptimal: ", + "bbox": [ + 174, + 667, + 784, + 683 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/fe4e6af5b4dc9e7556aa3b7e25df6bc4f2baa0f14ac49567cc0185c33faade2f.jpg", + "text": "$$\n\\begin{array} { r } { \\mathrm { \\mathbb { A } N E } ( \\pi _ { p } ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi : J _ { i } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\} , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 251, + 689, + 745, + 708 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "where $\\begin{array} { r } { J _ { i } ( \\pmb { \\pi } , \\pi _ { p } ) : = \\mathbb { E } _ { \\pmb { \\pi } , \\pi _ { p } } \\left[ \\sum _ { t = 0 } ^ { H } \\gamma ^ { t } r _ { t } ^ { ( i ) } \\right] } \\end{array}$ denotes the objective of agent $i$ . Hence, a rational agent would not unilaterally deviate from $\\pi \\in \\bar { \\mathrm { A N E } } ( \\pi _ { p } )$ . ", + "bbox": [ + 176, + 714, + 820, + 753 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "To evaluate a fixed planner policy $\\pi _ { p }$ , we simply sample outcomes using policies $\\pi \\in \\tt { A N E } ( \\pi _ { p } )$ . Also optimizing $\\pi _ { p }$ introduces a form of two-level learning. Under appropriate conditions, this can be solved with simultaneous gradient descent (Zheng et al., 2020; Fiez et al., 2019). ", + "bbox": [ + 174, + 760, + 825, + 801 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Robustness Objective As noted before, we wish to learn planner policies $\\pi _ { p }$ that are robust to reality gaps arising from changes in agent reward functions, e.g., when agents are boundedly rational.2 We develop a robustness objective for the planner by formalizing such reality gaps as perturbations ", + "bbox": [ + 174, + 818, + 825, + 861 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "$\\xi _ { i } \\in \\Xi$ to agent objectives, where the uncertainty set $\\Xi : ( S , A ) ^ { H } \\to \\mathbb { R }$ is the space of possible perturbations and represents uncertainty about the objectives of other agents. We extend $\\mathtt { A N E } ( \\pi _ { p } , \\xi )$ to condition the Nash equilibria on perturbations $\\boldsymbol { \\xi }$ : ", + "bbox": [ + 173, + 102, + 825, + 146 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/a375886923e5013c126281e75bbd986282fb360a56ed193944e360bb64f23ce0.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathtt { \\mathbb { A } N E } ( \\pi _ { p } , \\xi ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi : J _ { i } ^ { \\xi } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ^ { \\xi } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\} , } \\\\ & { J _ { i } ^ { \\xi } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) : = J _ { i } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) + \\mathbb { E } _ { \\tau _ { i } \\sim \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } } \\left[ \\xi _ { i } ( \\tau _ { i } ) \\right] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 225, + 151, + 769, + 195 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $\\tau _ { i }$ is a trajectory (sequence of state-action pairs). Following Morimoto $\\&$ Doya (2001), a robust planner optimizes its reward, subject to agents playing a perturbed Nash equilibrium $\\mathtt { A N E } ( \\pi _ { p } , \\xi )$ that maximally penalizes the planner: ", + "bbox": [ + 174, + 199, + 825, + 241 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/a099af48d0c272023c274205f3191591e9d377208fe61bc4d30a31469b2a65bc.jpg", + "text": "$$\n\\pi _ { p } ^ { * } = \\underset { \\pi _ { p } } { \\arg \\operatorname* { m a x } } ~ \\underset { \\xi \\in \\Xi } { \\operatorname* { m i n } } ~ \\underset { \\pi \\in \\mathrm { { a N E } } ( \\pi _ { p } , \\xi ) } { \\operatorname* { m i n } } ~ J _ { p } ( \\pi , \\pi _ { p } ) .\n$$", + "text_format": "latex", + "bbox": [ + 351, + 247, + 647, + 275 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Note that agent policies $\\pi \\in \\mathop { \\mathrm { A N E } } ( \\pi _ { p } , \\pmb { \\xi } )$ describes agents that optimize their own reward function, and we assume an adversary chooses $\\boldsymbol { \\xi }$ . ", + "bbox": [ + 173, + 281, + 821, + 310 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Bounded Uncertainty Set There are two challenges with Equation 4. First, if the adversary can arbitrarily choose $\\Xi$ , the worst case is uninformative.3 Second, depending on the complexity of $\\Pi$ , the uncertainty set $\\Xi$ may be high-dimensional and intractable to search. We address these issues by upper-bounding the size of the uncertainty set, $L _ { \\infty }$ norm of $\\xi _ { i } \\in \\Xi$ , by the term $\\epsilon$ . Thus $\\epsilon$ upper-bounds the difference between the reward functions of agents in the training and testing environments, e.g., between simulation and the real world. This bounded uncertainty set is: ", + "bbox": [ + 173, + 324, + 825, + 410 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/d92e97db66d9727045d1b8e2049d8e5b9207209c1bcb3b4a0471630c7b5ce5ed.jpg", + "text": "$$\n\\Xi _ { \\epsilon } : = \\left\\{ \\xi \\left| \\operatorname* { s u p } _ { \\pi , \\pi _ { p } } | \\xi _ { i } ( \\pi , \\pi _ { p } ) | < \\epsilon , { \\mathrm { f o r } } { \\mathrm { a l l } } i \\in I \\right. \\right\\} .\n$$", + "text_format": "latex", + "bbox": [ + 334, + 415, + 661, + 458 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "This uncertainty set is equivalent to the $\\epsilon$ -equilibria of $M [ \\pi _ { p } ]$ ", + "bbox": [ + 174, + 463, + 580, + 478 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/2807cd0b02518cfd6aaff1f1c24c0e443c724d08211ae24e01399522bee080c1.jpg", + "text": "$$\n\\mathtt { A N E } ( \\pi _ { p } , \\epsilon ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , { \\tilde { \\pi } } _ { i } \\in \\Pi : J _ { i } ( { \\tilde { \\pi } } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) + \\epsilon \\} .\n$$", + "text_format": "latex", + "bbox": [ + 232, + 484, + 766, + 502 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "$\\epsilon$ is a tunable hyperparameter—this is the case with most robust RL (Pinto et al., 2017; Li et al., 2019)—but a good starting value is the anticipated error in reward objective estimates (applicationspecific). Using 6, the robustness objective becomes the following constrained optimization problem: ", + "bbox": [ + 176, + 507, + 823, + 563 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/8c18738f67b8625c8f3965014fbbd64612faa31af2bf45ec0f63dc3b30bdcbfc.jpg", + "text": "$$\n\\underbrace { \\arg \\operatorname* { m a x } J _ { p , \\operatorname* { m i n } } ^ { * } ( \\pi _ { p } , \\epsilon ) } _ { \\texttt { P l a n n e r - O P T } } , \\quad \\mathrm { ~ w h e r e ~ } J _ { p , \\operatorname* { m i n } } ^ { * } ( \\pi _ { p } , \\epsilon ) : = \\underbrace { \\operatorname* { m i n } _ { \\pi \\in \\mathrm { \\mathrm { a N E } } ( \\pi _ { p } , \\epsilon ) } J _ { p } ( \\pi , \\pi _ { p } ) } _ { \\texttt { a g e n t - A d v - S e a r c h } } .\n$$", + "text_format": "latex", + "bbox": [ + 254, + 569, + 738, + 617 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Using $\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )$ replaces the problem of intractably searching through $\\Xi$ with searching through $\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )$ , and thus merges the two nested min operations in Equation 4. Conceptually, this transfers the worst-case search problem to the agents: Agent-Adv-Search agents find an adversarial equilibrium; Planner-OPT optimizes the planner given adversarial agents. Note that the constraint set in Eq 7 is non-empty for $\\epsilon \\geq 0$ ; the constraints (Eq 6) simply upper-bound the regret of agents. By definition, for non-empty bounded $\\Pi$ , there exists an optimal policy with zero regret. ", + "bbox": [ + 173, + 622, + 826, + 708 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 ERMAS: ROBUST POLICIES IN MULTI-AGENT SIMULATIONS ", + "text_level": 1, + "bbox": [ + 173, + 726, + 715, + 743 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We now introduce ERMAS, an efficient optimization framework to solve the robustness problem in Equation 7. ERMAS proceeds in three steps. First, it dualizes Equation 7 following constrained RL. \nSecond, it defines a trust-region for the uncertainty set $\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )$ , approximating the dual problem. \nFinally, it uses first-order meta-learning with trust-regions to solve the approximate dual problem. \nSee Appendix A.1 for the detailed Algorithm description. ", + "bbox": [ + 173, + 757, + 825, + 829 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Dualizing Agent-Adv-Search The agent search problem in Equation 7 can be formulated similar to a constrained RL problem (Paternain et al., 2019), where the primary objective of the agents is to minimize the planner’s reward and the secondary objective is to maximize their own reward. While conventional constrained RL enforces a constant lower bound in the constraint, e.g., ", + "bbox": [ + 174, + 843, + 825, + 900 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/943d8f634e3d94ae59722df8702225ba2004a9f0331ec0769a80160845c2d6e2.jpg", + "image_caption": [ + "Figure 1: ERMAS trains planners that are robust to reality gaps in these testbed multi-agent simulations. (Left) In the repeated bimatrix game, a pair of agents navigates a 2D landscape. Both agents and the planner receive rewards based on visited coordinates. Brighter squares indicate higher payoff. (Right) In the spatiotemporal economic simulation, 4 heterogenous agents perform labor, trade resources, earn income, and pay taxes according to the schedules set by the planner. " + ], + "image_footnote": [], + "bbox": [ + 196, + 99, + 816, + 285 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "$J _ { i } ( \\pi , \\pi _ { p } ) \\geq C$ , we enforce a dynamic one: $\\forall i \\in 1 \\dots N : J _ { i } ( \\pmb { \\pi } , \\pi _ { p } ) \\geq J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - \\epsilon _ { : }$ , where $\\pi _ { i } ^ { * }$ is the optimal unilateral deviation for agent $i$ : $\\begin{array} { r } { \\pi _ { i } ^ { * } : = \\arg \\operatorname* { m a x } _ { \\tilde { \\pi } _ { i } \\in \\Pi } J _ { i } \\big ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) } \\end{array}$ . ", + "bbox": [ + 173, + 393, + 823, + 424 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Letting $\\lambda$ denote Lagrange multipliers, we can dualize Agent-Adv-Search, i.e., Equation 4, as: ", + "bbox": [ + 169, + 429, + 823, + 445 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/c4db2af33b6cf9ca361143b6459f55a6578ff376dc2ad85e82de4fc3bdc74523.jpg", + "text": "$$\n\\underset { \\pi } { \\mathop { \\operatorname* { m i n } } } \\underbrace { \\Bigg ( J _ { p } ( \\pi , \\pi _ { p } ) - \\sum _ { i = 1 } ^ { N } \\lambda _ { i } \\left[ J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - J _ { i } ( \\pi , \\pi _ { p } ) - \\epsilon _ { i } \\right] \\Bigg ) } _ { J _ { p , \\operatorname* { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 289, + 452, + 707, + 522 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "This is identical to the dualization of constrained reinforcement learning, whose duality gap is empirically negligible and provably zero under weak assumptions (Paternain et al., 2019). We now abuse notation to denote $\\pmb { \\theta } : = [ \\theta _ { 1 } , \\ldots , \\theta _ { N } , \\theta _ { p } ]$ and $J _ { p } ( \\pmb \\theta ) \\overset { \\cdot } { : = } J _ { p } ( \\pmb \\pi , \\pi _ { p } )$ where $\\theta$ are the parameters of $\\pi$ . To solve Equation 8, the agents apply gradients: ", + "bbox": [ + 174, + 526, + 823, + 584 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/2f02e5b56116b49192e5f318275e047dea2c5e68d3a0916f732a00e0e08c66b6.jpg", + "text": "$$\n\\nabla _ { \\boldsymbol { \\theta } _ { i } } J _ { p , \\mathrm { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) = - \\nabla _ { \\boldsymbol { \\theta } _ { i } } J _ { p } ( \\pmb { \\theta } ) - \\lambda _ { i } \\nabla _ { \\boldsymbol { \\theta } _ { i } } \\left[ J _ { i } ( \\theta _ { i } ^ { \\prime } ( \\pmb { \\theta } ) , \\theta _ { - i } ) - J _ { i } ( \\pmb { \\theta } ) \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 276, + 590, + 720, + 613 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $\\theta _ { i } ^ { \\prime } ( \\pmb \\theta )$ is the parameters of the optimal unilateral deviation $\\pi _ { i } ^ { * }$ for agent $i$ , i.e. the parameters that minimize local regret, which depends on the current policy parameters $\\theta _ { i }$ . $\\lambda _ { i }$ is updated as: ", + "bbox": [ + 174, + 619, + 826, + 650 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/430e741a714f19983a9801db6f5bf585aee2250f12b770a6106294917c4fa709.jpg", + "text": "$$\n\\nabla _ { \\lambda _ { i } } J _ { p , \\mathrm { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) = J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - J _ { i } ( \\pi , \\pi _ { p } ) - \\epsilon _ { i } .\n$$", + "text_format": "latex", + "bbox": [ + 320, + 656, + 678, + 679 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Equation 8 still poses a challenge through the $J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } )$ terms, which correspond to unknown agent regret. We now detail the efficient approximation of the value and derivative of agent regret using local and meta-learning approximations, respectively. ", + "bbox": [ + 173, + 685, + 825, + 729 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Trust Regions using Local $\\epsilon$ -equilibria Estimating regret requires knowledge of the optimal unilateral deviation for agent $i$ . We can simplify this problem by proposing a refinement of $\\epsilon$ -equilibria inspired by the notion of local Nash equilibria in differentiable games (Ratliff et al., 2014). ", + "bbox": [ + 173, + 744, + 825, + 787 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Definition 3.1. A strategy $\\pi$ is a local $\\epsilon$ -Nash equilibrium if there exists open sets $W _ { i } ~ \\subset ~ \\Pi ^ { N }$ such that $\\pi _ { i } \\ \\in \\ W _ { i }$ and for each $i \\in \\{ 1 , \\ldots , N \\}$ we have that $J _ { i } ( \\pi _ { i } ^ { \\prime } , \\pi _ { - i } ) \\le J _ { i } ( \\pi ) + \\epsilon ^ { \\prime }$ for all $\\pi _ { i } ^ { \\prime } \\in W _ { i } \\setminus \\{ \\pi _ { i } \\}$ , where $\\begin{array} { r } { \\epsilon ^ { \\prime } : = \\epsilon \\operatorname* { s u p } _ { \\pi _ { i } ^ { \\prime } \\in W _ { i } } K L ( \\pi _ { i } | | \\pi _ { i } ^ { \\prime } ) } \\end{array}$ . ", + "bbox": [ + 173, + 791, + 825, + 837 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "By instead performing Agent-Adv-Search on the local $\\epsilon$ -Nash equilibria, we can limit the set of unilateral deviations to consider to a small trust region, $\\Pi _ { \\eta } ( \\pi )$ : ", + "bbox": [ + 173, + 848, + 823, + 877 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/56d2d7b3647c5e7733f8bb698a6343abcd27877f866e37ee30c8c07f942bfa88.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { A } \\mathbb { N } \\mathbb { E } ( \\pi _ { p } , \\eta ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi _ { \\eta } ( \\pi _ { i } ) : J _ { i } \\big ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) \\leq J _ { i } \\big ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) + \\epsilon \\} , } \\\\ & { \\qquad \\Pi _ { \\eta } ( \\pi ) : = \\{ \\pi ^ { \\prime } \\in \\Pi \\mid K L ( \\pi | | \\pi ^ { \\prime } ) \\leq \\eta \\} , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 197, + 883, + 769, + 922 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/5274686511e733fa2839aabccf052df3ff70f75bf3ce8cab833d5bae3e220e22.jpg", + "image_caption": [ + "Figure 2: Validating ERMAS Agent-Adv-Search in constrained repeated bimatrix games. Each point in the above scatter plots describes the average outcome at the end of training for the agents ( $\\scriptstyle { \\dot { x } }$ -coordinate) and the planner ( $y$ -coordinate). Error bars indicate standard deviation. (Left) The bimatrix reward structure encodes a social dilemma featuring a low-agent-reward/high-planner-reward Nash equilibrium, which is where vanilla MARL converges. Agents trained with ERMAS deviate from this equilibrium in order to reduce planner reward. \u000f governs the extent of the allowable deviation. (Middle) As $\\epsilon$ increases, the average per-timestep regret experienced by the agents also increases. Each average is taken over the final 12 episodes after rewards have converged. (Right) Using fixed values of $\\lambda$ (rather than allowing it to update, as in the full algorithm) distorts performance and prevents agents from reaching the same $\\epsilon$ -equilibria discovered with learned $\\lambda$ . " + ], + "image_footnote": [], + "bbox": [ + 174, + 102, + 818, + 237 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $\\eta > 0$ defines the size of the trust region. For small $\\eta$ , algorithms such as TRPO (Schulman et al., 2017) can be used to efficiently approximate optimal local deviations of $\\pi _ { i }$ , affording reasonable approximations of $J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } )$ . Note that our usage of trust region algorithms is not for optimization purposes. ERMAS requires the use of trust region optimization to ensure that the equilibria considered by ERMAS are limited to a local neighborhood of the policy space (Eq 11). ", + "bbox": [ + 173, + 415, + 825, + 487 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "First-Order Meta Learning Approximation The full gradient in Equation 9 is also complicated by the need to estimate the derivative of local regret $\\nabla _ { \\boldsymbol { \\theta } _ { i } } \\left[ J _ { i } ( \\boldsymbol { \\theta } _ { i } ^ { \\prime } ( \\boldsymbol { \\theta } ) , \\boldsymbol { \\theta } _ { - i } ) - J _ { i } ( \\boldsymbol { \\theta } ) \\right]$ . The second term maximizes the performance of the agent’s policy and is simply found with policy gradient. The first term is less straightforward: it minimizes the performance of the best agent policy in the current trust region. We note that this first term corresponds to a meta-learning gradient. We follow REPTILE (Nichol et al., 2018) to obtain a first-order approximation of a $M$ -step meta-learning gradient: ", + "bbox": [ + 174, + 501, + 825, + 585 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/9b83645fcce6d614fdf1eb2be61459d1a2e7a8f2d241e0fcc3fb02392f2393a2.jpg", + "text": "$$\n\\nabla _ { \\theta _ { i } } J _ { i } ( \\theta _ { i } ^ { \\prime } ( \\theta ) , \\theta _ { - i } ) = g _ { 1 } - \\frac { 1 } { M } \\sum _ { i = 1 } ^ { M } g _ { i } , \\quad g _ { i } = \\nabla _ { \\theta _ { i } } J _ { i } \\left( \\theta _ { i } + \\sum _ { j = 1 } ^ { i - 1 } g _ { j } , \\theta _ { - i } , \\theta _ { p } \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 245, + 592, + 751, + 642 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "where $g _ { i }$ denotes the ith policy gradient in the direction of $J _ { i }$ . In practice, we scale this meta-learning term with the hyperparameter $\\beta$ as $\\beta < 1$ incorporates a helpful inductive bias where maximizing agent reward leads to local maxima. We can alternatively apply this gradient update periodically, to both mimic $\\beta < 1$ and reduce computation overhead. First-order meta-learning approximations are known to be empirically effective, and are necessary for ERMAS to efficiently solve $\\operatorname { E q } 8$ . ", + "bbox": [ + 173, + 647, + 825, + 718 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "ERMAS By solving the dual problem (Eq. 8), ERMAS yields robustness to $\\epsilon$ -equilibria and, equivalently, uncertainty in agent objectives. ERMAS solves the dual problem by combining trust regions and meta-learning techniques to estimate and differentiate agent regret. Algorithm 1 and 2 (Appendix A.1) describe an efficient implementation of this procedure for nested policy learning. ", + "bbox": [ + 174, + 733, + 825, + 790 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 EXPERIMENTAL VALIDATION IN MULTI-AGENT SIMULATIONS ", + "text_level": 1, + "bbox": [ + 174, + 809, + 720, + 827 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.1 ERMAS SOLVES THE INNER LOOP: AG E N T-AD V-SE A R C H ", + "text_level": 1, + "bbox": [ + 173, + 840, + 625, + 856 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Constrained Repeated Bimatrix Game We analyze the agent behaviors learned by Agent-Adv-Search in experiments depicted in Figure 2. These experiments apply ERMAS to the classic repeated bimatrix game, which is well-studied in the game theory literature as its Nash equilibria can be solved efficiently. At each timestep, a row player (Agent 1) and column player (Agent 2) simultaneously choose from a finite number of actions. Each pair of actions $( i , j )$ corresponds to a pair of payoffs for the agents $r _ { 1 } ( i , j ) , r _ { 2 } ( i , j )$ . We select the payoff matrices $r _ { 1 }$ and $r _ { 2 }$ , illustrated in Figure 1a, so that only one Nash equilibrium exists and that the equilibrium constitutes a “tragedy-of-the-commons,” where agents selfishly optimizing their own reward leads to less reward overall. To extend this repeated bimatrix game into sequential decision making, we further constrain the game so that, at any timestep, agents can only choose an action adjacent to their action in the previous timestep. We also introduce a passive planner that observes the game and receives a payoff $r _ { p } ( i , j )$ . The planner does not take any actions and its payoff is constructed such that its reward is high when the agents are at the Nash equilibrium. In effect, this toy setting allows us to verify that ERMAS samples realistic worst-case behaviors–that is, that Agents 1 and 2 learn to deviate from their tragedy-of-commons equilibrium in order to reduce the planner’s reward but also without significantly increasing their own regret. ", + "bbox": [ + 174, + 867, + 823, + 924 + ], + "page_idx": 4 + }, + { + "type": "image", + "img_path": "images/3b722fb35f4b942fcce4910c3b2516dc8aa725874c1d244415381579289f8ea9.jpg", + "image_caption": [ + "Figure 3: Planner and agent rewards in the repeated bimatrix game over training time. Each line represents an average over 10 seeds, with error bars indicating standard error. The lines correspond to runs of ERMAS and are colored according to $\\beta$ , the weight of the meta-learning term of Equation 13. (Left) Planner performance over training episodes. (Middle) Agent 1 performance over training episodes. (Right) Agent 2 performance over training episodes. " + ], + "image_footnote": [], + "bbox": [ + 176, + 104, + 818, + 250 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 364, + 825, + 531 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Discovering $\\epsilon$ -Equilibria Figure 2 (left) visualizes how the equilibria reached by AI agents balance the reward of the planner (y-axis) and agents ( $\\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } = \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } .$ -axis). Conventional multi-agent RL discovers the Nash equilibrium, which is visualized in the top left. At this equilibrium, the agents do not cooperate and the planner receives high reward. For small values of $\\epsilon$ , ERMAS also discovers the Nash equilibrium. Because $\\epsilon$ acts as a constraint on agent regret, larger values of $\\epsilon$ enable ERMAS to deviate farther from the Nash equilibrium, discovering $\\epsilon$ -equilibria to the bottom-right that result in lower planner rewards. Deviations from a Nash equilibrium are associated with higher regret, meaning that regret should increase with $\\epsilon$ . Figure 2 (middle) clearly demonstrates that ERMAS imparts this trend. As described by Equation 7, this display of adversarial behavior is key to learning a more robust planner. ", + "bbox": [ + 173, + 551, + 825, + 690 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.2 ALL THE COMPONENTS OF ERMAS ARE NECESSARY", + "text_level": 1, + "bbox": [ + 174, + 712, + 586, + 726 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Dynamic or Frozen Lagrange multipliers $\\lambda _ { i }$ The Lagrange multipliers $\\boldsymbol { \\lambda }$ balance the dual objectives of seeking stable agent equilibria and minimizing the planner’s reward. Recall that smaller values of $\\lambda$ mean agent objectives are more antagonistic. The $\\boldsymbol { \\lambda }$ are updated using local estimates of agent regret, as described in Equation 8. We can validate that these updates are necessary by analyzing the equilibria learned by ERMAS when $\\boldsymbol { \\lambda }$ are not updated. Fixing a value of $\\boldsymbol { \\lambda }$ reduces Equation 8 to learning with shared rewards. Figure 2 (right) visualizes the equilibria discovered with frozen $\\lambda$ in the same format as the Figure 2 (left) plot. This visualization shows that freezing $\\boldsymbol { \\lambda }$ affects the equilibria discovered by ERMAS; the bottom right quadrant which contains the $\\epsilon$ -equilibria discovered with dynamic $\\lambda$ are not reached for any values of $\\lambda$ . This validates that certain $\\epsilon$ -equilibria are only reachable with dynamic $\\lambda$ and hence the updates in 8 are necessary for proper behavior.4 ", + "bbox": [ + 173, + 739, + 825, + 878 + ], + "page_idx": 5 + }, + { + "type": "image", + "img_path": "images/f26691b56531ed2956c8a36b1b9e767d39ff089799c7e9a988f5a0f6b8b0d54c.jpg", + "image_caption": [ + "Figure 4: Robust planner learning in the repeated bimatrix game. Average planner performance as a function of the reward perturbation coefficient $Q$ in the test environment. Each point represents an average over 5 seeds, with error bars indicating standard error. Vertical dashed lines denote the training environment $Q$ . (Left) Average planner performance at convergence. (Right) Performance relative to the vanilla MARL baseline, which is trained without a robustness objective. " + ], + "image_footnote": [], + "bbox": [ + 176, + 103, + 820, + 228 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "First-order Approximation Using the first order approximation of Equation 13 might slow learning, since we step “away” from the direction that the standard policy gradient suggests. In contrast, we find that the ERMAS update can significantly speed up convergence. Figure 3 depicts the learning curve of variants of ERMAS with varying weights, $\\beta$ , on the meta-learning term. For instance, when $\\beta = 0$ , the meta-learning term is completely dropped. We find that lines corresponding to larger values of $\\beta$ reach improved agent rewards half an order of magnitude faster than lower values of $\\beta$ . However, larger values of $\\beta$ fail to reach the desirable region of adversarial $\\epsilon$ -equilibria. In both cases, very large $\\begin{array} { r } { ( \\bar { \\beta } > \\frac { 1 } { N } , } \\end{array}$ ) and very small $( \\beta \\sim 0 )$ fail to fully reach and remain at the adversarial region. However, an appropriate range for $\\beta$ gives rapid convergence and good asymptotic behavior. ", + "bbox": [ + 173, + 342, + 825, + 468 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.3 SOLVING PL A N N E R-OPT USING AG E N T-AD V-SE A R C H ", + "text_level": 1, + "bbox": [ + 174, + 488, + 604, + 502 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We now show that ERMAS yields planners $\\pi _ { p }$ which are more robust to uncertainty in the agent’s reward function. Specifically, we empirically validate that ERMAS can find strong solutions to the nested optimization problems Agent-Adv-Search and Planner-OPT, in two simulations: repeated bimatrix games and economic simulations (see Figure 1). ", + "bbox": [ + 174, + 515, + 825, + 570 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Evaluation Workflow To measure planner robustness, we evaluate trained planners in test environments with a reality gap (i.e. reward parameterizations that differ from the training environment), containing test agents that are optimized for the test environment’s reward functions and that have not been seen by the planner. We proceed as follows: 1) Train the agents and planner with ERMAS. 2) Fix the planner and transfer it to a test environment, then train new agents from scratch in the test environment with reward functions unseen by the planner. 3) Report the value of the planner objective after the new agents have converged. ", + "bbox": [ + 173, + 590, + 825, + 688 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Augmented Repeated Bimatrix Games We now extend the bimatrix game to a nested reinforcement learning problem by allowing the planner to take actions and influence its own experienced reward. The planner now selects an integer $a \\geq 0$ that modifies its new reward function: $\\bar { a r } _ { p } ( i , j ) - a ^ { 2 }$ . This function is chosen for its quadratic form: $a$ scales the reward but adds a cost $a ^ { 2 }$ which disincentives large values of $a$ . Agents are modified to receive a new reward function $r _ { i } ^ { \\prime } = r _ { i } - Q r _ { p }$ where $r _ { i }$ is their original reward function and $Q \\leq 1$ is an unknown scalar which may differ between training and testing environments. If $Q = 0$ , agents act identical to the experiments in Figure 2. For environments with larger values of $Q$ , e.g., $Q = 0 . 5$ , agents have an incentive to be adversarial. ", + "bbox": [ + 174, + 707, + 823, + 820 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Figure 4 shows the test performance of ERMAS against vanilla multi-agent RL policies learned with $Q _ { \\mathrm { t r a i n } } = 0 . 5$ or with $Q _ { \\mathrm { t r a i n } } = 0$ . Naturally, MARL trained with $Q _ { \\mathrm { t r a i n } } = 0 . 5$ underperforms MARL trained with $Q _ { \\mathrm { t r a i n } } = 0$ when evaluated in environments where $Q _ { \\mathrm { t e s t } } < 0 . 3$ . However, MARL trained with $Q _ { \\mathrm { t r a i n } } = 0 . 5$ outperforms when $Q _ { \\mathrm { t e s t } } > 0 . 3$ . Agent-Adv-Search successfully finds the worst-case perturbation, and yields a planner policy at least as good as MARL $Q _ { \\mathrm { t r a i n } } = 0 . 5$ . This shows that ERMAS can produce policies which are robust to uncertainty in agents’ objectives and is a tractable adversarial robustness algorithm. ", + "bbox": [ + 174, + 825, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Existing single-agent and multi-agent robust reinforcement learning algorithms optimize for different robustness objectives than ERMAS. However, some general techniques for addressing Sim2Real can be extended to provide an alternative to ERMAS’s adversarial approach. Our first baseline extends the technique of domain randomization (DR) by applying random perturbations to agent rewards. For DR, agents receive $r _ { i } ^ { \\prime } = r _ { i } + \\sigma$ , where $\\sigma \\sim U [ - 1 , 1 ]$ (recall $r _ { i } \\in [ 0 , 1 ] ,$ ). These perturbations are randomized periodically between episodes. Even in a simple 4-by-4 bimatrix game, there are $2 3 0 4 = 1 6$ states $\\times 1 6$ states $\\times 9$ actions possible reward values to perturb; a 2304-dimensional space is too sparse to cover uniformly. Furthermore, in contrast to DR of visual inputs or dynamics, there is a natural latency to the effect of DR of agent rewards: randomization only has an effect if agents learn to adapt to their perturbed rewards. Our second baseline, risk robustness (RR), applies a concavity to planner rewards, e.g., $\\log r _ { p }$ . This encourages robustness to environment stochasticity, including the randomness of agent policies. As illustrated in Figure 4, neither the domain randomization nor risk robustness baseline yields meaningful robustness even in this simple setting. ", + "bbox": [ + 174, + 103, + 825, + 284 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "4.4 ERMAS FOR LARGE-SCALE TWO-LEVEL LEARNING: AI ECONOMIST ", + "text_level": 1, + "bbox": [ + 173, + 300, + 702, + 315 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We now address an important use-case, tax policy design, to demonstrate ERMAS at scale. We train a robust AI Economist: a planner for optimal taxation that acts in a spatiotemporal economic simulation, see Zheng et al. (2020) for a detailed description. This setting is very challenging given the scale of the simulation and agent affordances. In particular, adversarial and randomization baselines do not scale to this setting. In this simulation, agents optimize their expected utility $\\mathbb { E } _ { \\pi , \\pi _ { p } } \\left[ \\sum _ { t = 0 } ^ { T } r _ { i , t } \\right]$ , where the utility ${ \\boldsymbol { r } } _ { i , t }$ is a function of labor $l _ { i , t }$ and post-tax endowments $\\tilde { x } _ { i , t }$ : ", + "bbox": [ + 173, + 327, + 825, + 421 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/a178cb7f591e3d9d9a16df364576284f5797c53cf0ea7cf000670a5232376ab6.jpg", + "text": "$$\n\\tilde { z } _ { i , t } = z _ { i , t } - T ( z _ { i , t } ) , \\quad \\tilde { x } _ { i , t } = \\sum _ { t ^ { \\prime } \\leq t } \\tilde { z } _ { i , t } , \\quad r _ { i , t } ( \\tilde { x } _ { i , t } , l _ { i , t } ) = \\frac { \\tilde { x } _ { i , t } ^ { 1 - \\eta } - 1 } { 1 - \\eta } - l _ { i , t } , \\quad \\eta > 0 ,\n$$", + "text_format": "latex", + "bbox": [ + 207, + 424, + 761, + 468 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "where $\\eta$ sets the degree of risk aversion (higher $\\eta$ means higher risk aversion). Agents earn income $z _ { i , t }$ and pay taxes $T ( z _ { i , t } )$ , which are set by the planner. The planner optimizes social welfare swf: ", + "bbox": [ + 174, + 472, + 826, + 501 + ], + "page_idx": 7 + }, + { + "type": "equation", + "img_path": "images/8471638e02b504cf2b0c426180413da3869cf02fd5fb0749d0d54a52b6de9c70.jpg", + "text": "$$\n{ \\mathsf { s w f } } = \\mathsf { e q } ( x ) \\cdot \\mathtt { p r o d } ( x ) , \\quad \\mathsf { e q } ( x ) = 1 - \\frac { N } { N - 1 } \\mathtt { g i n i } ( x ) , \\quad \\mathtt { p r o d } ( x ) = \\sum _ { i = 1 } ^ { N } x _ { i } ,\n$$", + "text_format": "latex", + "bbox": [ + 212, + 503, + 758, + 547 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "a combination of equality (Gini, 1912) and productivity. ", + "bbox": [ + 173, + 550, + 540, + 565 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Figure 5 shows the performance of ERMAS tax policies along with baseline tax policies (Saez, US Federal) and an AI Economist (MARL). All models are trained on agents with $\\eta = 0 . 2 3$ . We replicate Zheng et al. (2020): MARL outperforms the Saez tax. However, MARL fails to outperform Saez when testing with $\\eta < 0 . 2 2$ and $\\eta > 0 . 2 8$ . In contrast, ERMAS yields consistent gains across the depicted range of $\\eta$ . This shows that ERMAS’s tax policy can improve swf even if agent risk aversion significantly increases or decreases (e.g., due to economic cycles or exogenous shocks). ", + "bbox": [ + 173, + 570, + 825, + 656 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In fact, ERMAS outperforms the baseline AI Economist for the original setting of $\\eta = 0 . 2 3$ . This suggests the robustness and performance do not necessarily pose a zero-sum game: ERMAS can find equilibria with high performance and strong generalization. It has been observed empirically in various studies that single-agent robust reinforcement learning similarly yields performance improvements even in the absence of environment perturbations (Pinto et al., 2017). ", + "bbox": [ + 174, + 661, + 823, + 732 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 751, + 344, + 767 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Sim2real: Reality Gaps The Sim2Real problem considers how reality gaps, i.e., mismatches between a simulation and reality, can (negatively) impact RL policies. Robust performance across reality gaps has been studied when applying deep RL to robotic control with visual inputs (James et al., 2019; Christiano et al., 2016; Rusu et al., 2016; Tzeng et al., 2015). To close reality gaps, domain adaptation aims to transfer a simulated distribution (of the world) to the real world (Higgins et al., 2017; Kim et al., 2019). In comparison, the study of reality gaps in multi-agent RL is relatively nascent (Suh et al., 2019; Nachum et al., 2019). ", + "bbox": [ + 173, + 782, + 825, + 881 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Multi-Agent Robustness Morimoto & Doya (2001) proposed robust RL for the worst-case adversarial objective (i.e., a max-min optimization problem), inspired by $\\mathcal { H } _ { \\infty }$ control, and provided analytical solutions in the linear setting. The robust RL problem can be solved using an adversarial player that chooses perturbations. Rather than the worst-case, Pinto et al. (2017) optimized for the $\\alpha$ -quantile of reward, using a conditional value-at-risk (CVAR) interpretation of adversarial robustness. We consider perturbations to agent rewards. Other works have studied perturbing transition matrices, observation spaces, and action probabilities, which are relevant to robotics and control applications (Pinto et al., 2017; Tessler et al., 2019; Hou et al., 2020; Li et al., 2019). We also address a more challenging multi-agent setting than previous works. First, agents do not necessarily optimize for the same (robustness) objective. We therefore consider a one-sided robustness problem where only the planner is expected to act robustly. This setting is significantly more difficult than previous works that assume all agents act robustly (Li et al., 2019). Second, we address a challenging nested reinforcement learning setting of interest to important real-world applications such as economics mechanism design (Zheng et al., 2020). Although we formulate ERMAS as using simultaneous gradient descent, ERMAS can be easily extended to use nested optimization solvers such as competitive gradient descent (Schafer & Anandkumar, 2020). ¨ ", + "bbox": [ + 176, + 895, + 821, + 924 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/56e995203fcde21443f9a9a16168b1244202cb7c4b065c12c8ceb5ed881f5c51.jpg", + "image_caption": [ + "Figure 5: Learning robust optimal taxation in an economic simulation. Results are plotted following the same conventions in Figure 4. Due to the intractability of other robustness algorithms in this setting, we instead compare against different planner choices. “US Federal” uses a fixed tax scheme adapted from the 2018 US Federal income tax rates. “Saez” uses an adaptive, theoretical formula to estimate optimal tax rates. " + ], + "image_footnote": [], + "bbox": [ + 176, + 103, + 820, + 227 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 342, + 825, + 536 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "See Appendix A.2 for additional related work. ", + "bbox": [ + 176, + 542, + 477, + 558 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "6 FUTURE WORK ", + "text_level": 1, + "bbox": [ + 176, + 582, + 334, + 598 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Future work could extend ERMAS to reality gaps due to different causes, such as changes in transition dynamics, agent affordances, number of agents, etc, which might require more refined approximations to the planner’s robustness objective. Furthermore, it would be interesting to apply ERMAS to problems that feature more general solution concepts, e.g., Bayesian Nash equilibria, correlated equilibria, Walrassian equilibria, and others. ", + "bbox": [ + 174, + 616, + 825, + 685 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 710, + 285, + 726 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Dirk Bergemann and Stephen Morris. Robust mechanism design. Econometrica, 73(6):1771–1813, 2005. ISSN 00129682, 14680262. URL http://www.jstor.org/stable/3598751. ", + "bbox": [ + 174, + 736, + 823, + 765 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Eric Bonabeau. Agent-based modeling: Methods and techniques for simulating human systems. Proceedings of the National Academy of Sciences, 99(suppl 3):7280–7287, May 2002. ISSN 0027-8424, 1091-6490. doi: 10.1073/pnas.082080899. URL https://www.pnas.org/ content/99/suppl_3/7280. Publisher: National Academy of Sciences Section: Colloquium Paper. ", + "bbox": [ + 174, + 781, + 825, + 852 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Paul Christiano, Zain Shah, Igor Mordatch, Jonas Schneider, Trevor Blackwell, Joshua Tobin, Pieter Abbeel, and Wojciech Zaremba. Transfer from Simulation to Real World through Learning Deep Inverse Dynamics Model. October 2016. URL https://arxiv.org/abs/1610. 03518v1. ", + "bbox": [ + 174, + 867, + 823, + 922 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Paul Dutting, Zhe Feng, Harikrishna Narasimhan, David Parkes, and Sai Srivatsa Ravindranath. ¨ Optimal auctions through deep learning. In International Conference on Machine Learning, pp. 1706–1715, 2019. ", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tanner Fiez, Benjamin Chasnov, and Lillian J. Ratliff. Convergence of Learning Dynamics in Stackelberg Games. arXiv, jun 2019. URL http://arxiv.org/abs/1906.01217. ", + "bbox": [ + 173, + 156, + 821, + 185 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Chelsea Finn, Pieter Abbeel, and Sergey Levine. Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. arXiv:1703.03400 [cs], July 2017. URL http://arxiv.org/abs/ 1703.03400. arXiv: 1703.03400. ", + "bbox": [ + 173, + 196, + 825, + 239 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "C. Gini. Variabilita e mutabilit \\` a\\` . 1912. ", + "bbox": [ + 174, + 250, + 431, + 265 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Irina Higgins, Arka Pal, Andrei A Rusu, Loic Matthey, Christopher P Burgess, Alexander Pritzel, Matthew Botvinick, Charles Blundell, and Alexander Lerchner. Darla: Improving zero-shot transfer in reinforcement learning. arXiv preprint arXiv:1707.08475, 2017. ", + "bbox": [ + 173, + 276, + 825, + 319 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "John H. Holland and John H. Miller. Artificial Adaptive Agents in Economic Theory. American Economic Review, 81(2):365–71, 1991. URL https://econpapers.repec.org/article/ aeaaecrev/v_3a81_3ay_3a1991_3ai_3a2_3ap_3a365-71.htm. Publisher: American Economic Association. ", + "bbox": [ + 174, + 329, + 825, + 386 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Linfang Hou, Liang Pang, Xin Hong, Yanyan Lan, Zhiming Ma, and Dawei Yin. Robust Reinforcement Learning with Wasserstein Constraint. arXiv:2006.00945 [cs, stat], June 2020. URL http://arxiv.org/abs/2006.00945. arXiv: 2006.00945. ", + "bbox": [ + 173, + 397, + 825, + 439 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Peter Howitt. What have central bankers learned from modern macroeconomic theory? Journal of Macroeconomics, 34(1):11–22, March 2012. ISSN 0164-0704. doi: 10.1016/j. jmacro.2011.08.005. URL http://www.sciencedirect.com/science/article/ pii/S0164070411000619. ", + "bbox": [ + 173, + 450, + 825, + 507 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Stephen James, Paul Wohlhart, Mrinal Kalakrishnan, Dmitry Kalashnikov, Alex Irpan, Julian Ibarz, Sergey Levine, Raia Hadsell, and Konstantinos Bousmalis. Sim-to-real via sim-to-sim: Dataefficient robotic grasping via randomized-to-canonical adaptation networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 12627–12637, 2019. ", + "bbox": [ + 173, + 518, + 826, + 575 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Kun Ho Kim, Yihong Gu, Jiaming Song, Shengjia Zhao, and Stefano Ermon. Cross Domain Imitation Learning. arXiv:1910.00105 [cs, stat], September 2019. URL http://arxiv.org/ abs/1910.00105. arXiv: 1910.00105. ", + "bbox": [ + 173, + 585, + 825, + 628 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alan P. Kirman. Whom or What Does the Representative Individual Represent? Journal of Economic Perspectives, 6(2):117–136, June 1992. ISSN 0895-3309. doi: 10.1257/jep.6.2.117. URL https://www.aeaweb.org/articles?id=10.1257/jep.6.2.117. ", + "bbox": [ + 174, + 638, + 823, + 683 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Shihui Li, Yi Wu, Xinyue Cui, Honghua Dong, Fei Fang, and Stuart Russell. Robust Multi-Agent Reinforcement Learning via Minimax Deep Deterministic Policy Gradient. Proceedings of the AAAI Conference on Artificial Intelligence, 33:4213–4220, July 2019. doi: 10.1609/aaai.v33i01. 33014213. ", + "bbox": [ + 173, + 693, + 825, + 748 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jun Morimoto and Kenji Doya. Robust Reinforcement Learning. In T. K. Leen, T. G. Dietterich, and V. Tresp (eds.), Advances in Neural Information Processing Systems 13, pp. 1061–1067. MIT Press, 2001. URL http://papers.nips.cc/paper/ 1841-robust-reinforcement-learning.pdf. ", + "bbox": [ + 173, + 760, + 825, + 818 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Roger B. Myerson. Mechanism Design, pp. 1–13. Palgrave Macmillan UK, London, 2016. ISBN 978-1-349-95121-5. doi: 10.1057/978-1-349-95121-5 2675-1. URL https://doi.org/ 10.1057/978-1-349-95121-5_2675-1. ", + "bbox": [ + 173, + 828, + 823, + 869 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Ofir Nachum, Michael Ahn, Hugo Ponte, Shixiang Gu, and Vikash Kumar. Multi-Agent Manipulation via Locomotion using Hierarchical Sim2Real. arXiv:1908.05224 [cs], October 2019. URL http://arxiv.org/abs/1908.05224. arXiv: 1908.05224. ", + "bbox": [ + 174, + 882, + 825, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Alex Nichol, Joshua Achiam, and John Schulman. On First-Order Meta-Learning Algorithms. arXiv:1803.02999 [cs], October 2018. URL http://arxiv.org/abs/1803.02999. arXiv: 1803.02999. ", + "bbox": [ + 174, + 103, + 821, + 145 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Santiago Paternain, Luiz F. O. Chamon, Miguel Calvo-Fullana, and Alejandro Ribeiro. Constrained Reinforcement Learning Has Zero Duality Gap. arXiv:1910.13393 [cs, math, stat], October 2019. URL http://arxiv.org/abs/1910.13393. arXiv: 1910.13393. ", + "bbox": [ + 178, + 156, + 825, + 200 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Xue Bin Peng, Marcin Andrychowicz, Wojciech Zaremba, and Pieter Abbeel. Sim-to-Real Transfer of Robotic Control with Dynamics Randomization. 2018 IEEE International Conference on Robotics and Automation (ICRA), pp. 3803–3810, May 2018. doi: 10.1109/ICRA.2018.8460528. URL http://arxiv.org/abs/1710.06537. arXiv: 1710.06537. ", + "bbox": [ + 173, + 210, + 825, + 267 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Wolfgang Pesendorfer. Behavioral economics comes of age: A review essay on advances in behavioral economics. Journal of Economic Literature, 44(3):712–721, 2006. ", + "bbox": [ + 171, + 277, + 823, + 308 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Lerrel Pinto, James Davidson, Rahul Sukthankar, and Abhinav Gupta. Robust Adversarial Reinforcement Learning. arXiv:1703.02702 [cs], March 2017. URL http://arxiv.org/abs/ 1703.02702. arXiv: 1703.02702. ", + "bbox": [ + 173, + 318, + 823, + 361 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Lillian J. Ratliff, Samuel A. Burden, and S. Shankar Sastry. On the Characterization of Local Nash Equilibria in Continuous Games. arXiv:1411.2168 [math], November 2014. URL http: //arxiv.org/abs/1411.2168. arXiv: 1411.2168. ", + "bbox": [ + 173, + 371, + 825, + 414 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Andrei A. Rusu, Mel Vecerik, Thomas Rothorl, Nicolas Heess, Razvan Pascanu, and Raia Hadsell.¨ Sim-to-Real Robot Learning from Pixels with Progressive Nets. October 2016. URL https: //arxiv.org/abs/1610.04286v2. ", + "bbox": [ + 173, + 424, + 823, + 467 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "John Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, and Pieter Abbeel. Trust Region Policy Optimization. arXiv:1502.05477 [cs], April 2017. URL http://arxiv.org/abs/ 1502.05477. arXiv: 1502.05477. ", + "bbox": [ + 171, + 478, + 825, + 521 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Florian Schafer and Anima Anandkumar. Competitive Gradient Descent. ¨ arXiv:1905.12103 [cs, math], June 2020. URL http://arxiv.org/abs/1905.12103. arXiv: 1905.12103. ", + "bbox": [ + 171, + 531, + 823, + 561 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Herbert A. Simon. From substantive to procedural rationality. In T. J. Kastelein, S. K. Kuipers, W. A. Nijenhuis, and G. R. Wagenaar (eds.), 25 Years of Economic Theory: Retrospect and prospect, pp. 65–86. Springer US, Boston, MA, 1976. ISBN 978-1-4613-4367-7. doi: 10.1007/ 978-1-4613-4367-7 6. URL https://doi.org/10.1007/978-1-4613-4367-7_6. ", + "bbox": [ + 173, + 571, + 826, + 628 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Herbert A. Simon and Jonathan Schaeffer. The Game of Chess. Technical report, CARNEGIEMELLON UNIV PITTSBURGH PA ARTIFICIAL INTELLIGENCE AND PSYCHOLOGY PROJECT, December 1990. URL https://apps.dtic.mil/sti/citations/ ADA225613. Section: Technical Reports. ", + "bbox": [ + 174, + 638, + 826, + 695 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Young-Ho Suh, Sung-Pil Woo, Hyunhak Kim, and Dong-Hwan Park. A sim2real framework enabling decentralized agents to execute MADDPG tasks. In Proceedings of the Workshop on Distributed Infrastructures for Deep Learning, DIDL ’19, pp. 1–6, Davis, CA, USA, December 2019. Association for Computing Machinery. ISBN 978-1-4503-7037-0. doi: 10.1145/3366622. 3368146. URL https://doi.org/10.1145/3366622.3368146. ", + "bbox": [ + 174, + 707, + 825, + 777 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Richard S. Sutton and Andrew G. Barto. Reinforcement learning: An introduction. MIT press, 2018. ", + "bbox": [ + 171, + 787, + 823, + 804 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Chen Tessler, Yonathan Efroni, and Shie Mannor. Action Robust Reinforcement Learning and Applications in Continuous Control. arXiv:1901.09184 [cs, stat], May 2019. URL http:// arxiv.org/abs/1901.09184. arXiv: 1901.09184. ", + "bbox": [ + 173, + 814, + 821, + 856 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Josh Tobin, Rachel Fong, Alex Ray, Jonas Schneider, Wojciech Zaremba, and Pieter Abbeel. Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real World. arXiv:1703.06907 [cs], March 2017. URL http://arxiv.org/abs/1703.06907. arXiv: 1703.06907. ", + "bbox": [ + 173, + 867, + 825, + 922 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Eric Tzeng, Coline Devin, Judy Hoffman, Chelsea Finn, Pieter Abbeel, Sergey Levine, Kate Saenko, and Trevor Darrell. Adapting Deep Visuomotor Representations with Weak Pairwise Constraints. November 2015. URL https://arxiv.org/abs/1511.07111v5. ", + "bbox": [ + 178, + 103, + 823, + 146 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Stephan Zheng, Alexander Trott, Sunil Srinivasa, Nikhil Naik, Melvin Gruesbeck, David C. Parkes, and Richard Socher. The AI Economist: Improving Equality and Productivity with AI-Driven Tax Policies. arXiv:2004.13332 [cs, econ, q-fin, stat], April 2020. URL http://arxiv. org/abs/2004.13332. arXiv: 2004.13332. ", + "bbox": [ + 174, + 155, + 825, + 210 + ], + "page_idx": 11 + } +] \ No newline at end of file diff --git a/parse/train/uIc4W6MtbDA/uIc4W6MtbDA_middle.json b/parse/train/uIc4W6MtbDA/uIc4W6MtbDA_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..c664a97d9086d66fe74e8b917400d89cae6d34d9 --- /dev/null +++ b/parse/train/uIc4W6MtbDA/uIc4W6MtbDA_middle.json @@ -0,0 +1,34508 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 502, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 504, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 504, + 97 + ], + "score": 1.0, + "content": "ERMAS: LEARNING POLICIES ROBUST TO REALITY", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 98, + 391, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 98, + 391, + 118 + ], + "score": 1.0, + "content": "GAPS IN MULTI-AGENT SIMULATIONS", + "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, + 212, + 468, + 376 + ], + "lines": [ + { + "bbox": [ + 142, + 212, + 469, + 223 + ], + "spans": [ + { + "bbox": [ + 142, + 212, + 469, + 223 + ], + "score": 1.0, + "content": "Policies for real-world multi-agent problems, such as optimal taxation, can be", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 223, + 470, + 235 + ], + "spans": [ + { + "bbox": [ + 141, + 223, + 470, + 235 + ], + "score": 1.0, + "content": "learned in multi-agent simulations with AI agents that emulate humans. How-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 234, + 469, + 247 + ], + "spans": [ + { + "bbox": [ + 141, + 234, + 469, + 247 + ], + "score": 1.0, + "content": "ever, simulations can suffer from reality gaps as humans often act suboptimally", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 245, + 470, + 257 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 459, + 257 + ], + "score": 1.0, + "content": "or optimize for different objectives (i.e., bounded rationality). We introduce", + "type": "text" + }, + { + "bbox": [ + 459, + 247, + 465, + 255 + ], + "score": 0.33, + "content": "\\epsilon \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 245, + 470, + 257 + ], + "score": 1.0, + "content": "-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "score": 1.0, + "content": "Robust Multi-Agent Simulation (ERMAS), a robust optimization framework to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 266, + 470, + 280 + ], + "spans": [ + { + "bbox": [ + 141, + 266, + 470, + 280 + ], + "score": 1.0, + "content": "learn AI policies that are robust to such multi-agent reality gaps. The objective", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 277, + 470, + 290 + ], + "spans": [ + { + "bbox": [ + 141, + 277, + 362, + 290 + ], + "score": 1.0, + "content": "of ERMAS theoretically guarantees robustness to the", + "type": "text" + }, + { + "bbox": [ + 362, + 279, + 367, + 288 + ], + "score": 0.74, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 277, + 470, + 290 + ], + "score": 1.0, + "content": "-Nash equilibria of other", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 465, + 300 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 460, + 300 + ], + "score": 1.0, + "content": "agents – that is, robustness to behavioral deviations with a regret of at most", + "type": "text" + }, + { + "bbox": [ + 460, + 291, + 465, + 299 + ], + "score": 0.45, + "content": "\\epsilon", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 299, + 469, + 312 + ], + "spans": [ + { + "bbox": [ + 141, + 299, + 469, + 312 + ], + "score": 1.0, + "content": "ERMAS efficiently solves a first-order approximation of the robustness objective", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 311, + 469, + 322 + ], + "spans": [ + { + "bbox": [ + 142, + 311, + 469, + 322 + ], + "score": 1.0, + "content": "using meta-learning methods. We show that ERMAS yields robust policies for", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 322, + 470, + 334 + ], + "spans": [ + { + "bbox": [ + 142, + 322, + 470, + 334 + ], + "score": 1.0, + "content": "repeated bimatrix games and optimal adaptive taxation in economic simulations,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 333, + 469, + 344 + ], + "spans": [ + { + "bbox": [ + 141, + 333, + 469, + 344 + ], + "score": 1.0, + "content": "even when baseline notions of robustness are uninformative or intractable. In", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 343, + 470, + 356 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 470, + 356 + ], + "score": 1.0, + "content": "particular, we show ERMAS can learn tax policies that are robust to changes in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 354, + 469, + 367 + ], + "spans": [ + { + "bbox": [ + 141, + 354, + 438, + 367 + ], + "score": 1.0, + "content": "agent risk aversion, improving policy objectives (social welfare) by up to", + "type": "text" + }, + { + "bbox": [ + 438, + 354, + 457, + 365 + ], + "score": 0.89, + "content": "15 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 354, + 469, + 367 + ], + "score": 1.0, + "content": "in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 366, + 469, + 378 + ], + "spans": [ + { + "bbox": [ + 141, + 366, + 469, + 378 + ], + "score": 1.0, + "content": "complex spatiotemporal simulations using the AI Economist (Zheng et al., 2020).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 12 + }, + { + "type": "title", + "bbox": [ + 108, + 398, + 206, + 411 + ], + "lines": [ + { + "bbox": [ + 105, + 397, + 208, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 208, + 414 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 424, + 505, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "score": 1.0, + "content": "Reinforcement learning (RL) offers a tool to optimize policy decisions affecting complex, multi-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "agent systems; for example, to improve traffic flow or economic productivity. In practice, the need", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "score": 1.0, + "content": "for efficient policy evaluation necessitates training on simulations of multi-agent systems (MAS).", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "Agents in these systems can be emulated with fixed behavioral rules, or by optimizing for a reward", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "function using RL (Zheng et al., 2020). For instance, the impact of economic policy decisions are of-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 478, + 504, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 504, + 491 + ], + "score": 1.0, + "content": "ten estimated with agent-based models (Holland & Miller, 1991; Bonabeau, 2002). This commonly", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "score": 1.0, + "content": "introduces a reality gap as the reward function and resulting behavior of simulated agents might", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "score": 1.0, + "content": "differ from those of real people (Simon & Schaeffer, 1990). This becomes especially problematic", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "score": 1.0, + "content": "as the complexity of the simulation grows, for example, when increasing the number of agents, or", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 523, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 505, + 535 + ], + "score": 1.0, + "content": "adding agent affordances (Kirman, 1992; Howitt, 2012). As a result, policies learned in imperfect", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 468, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 468, + 546 + ], + "score": 1.0, + "content": "simulations need to be robust against reality gaps in order to be effective in the real world.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 550, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 164, + 563 + ], + "score": 1.0, + "content": "We introduce", + "type": "text" + }, + { + "bbox": [ + 165, + 552, + 170, + 560 + ], + "score": 0.75, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 549, + 505, + 563 + ], + "score": 1.0, + "content": "-Robust Multi-Agent Simulation (ERMAS), a robust optimization framework for", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "training robust policies, termed planners, that interact with real-world multi-agent systems. ERMAS", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "score": 1.0, + "content": "trains robust planners by simulating multi-agent systems with RL and sampling worst-case behaviors", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "score": 1.0, + "content": "from the worst-case agents. This form of multi-agent robustness poses a very challenging multi-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 593, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 506, + 607 + ], + "score": 1.0, + "content": "level (e.g., max-min-min) optimization problem. Existing techniques which could be applied to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "ERMAS’s multi-agent robustness objective, e.g., naive adversarial robustness (Pinto et al., 2017) and", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "domain randomization (Tobin et al., 2017; Peng et al., 2018), are intractable as they would require an", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 640 + ], + "score": 1.0, + "content": "expensive search through a large space of agent reward functions. Alternative frameworks improve", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "robustness, e.g., to changes in environment dynamics, observation or action spaces (Pinto et al.,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "2017; Li et al., 2019; Tessler et al., 2019), but do not address reality gaps due to reward function", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 660, + 459, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 459, + 673 + ], + "score": 1.0, + "content": "mismatches, as they use inappropriate metrics on the space of adversarial perturbations.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 504, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 504, + 689 + ], + "score": 1.0, + "content": "To solve this problem, ERMAS has three key features: 1) It formulates a multi-agent robustness ob-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 275, + 700 + ], + "score": 1.0, + "content": "jective equivalent to finding the worst case", + "type": "text" + }, + { + "bbox": [ + 275, + 690, + 280, + 698 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "-Nash equilibria. 2) It optimizes a tractable dual problem", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "to the equivalent objective. 3) It approximates the dual problem using local solution concepts and", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "first-order meta-learning techniques (Nichol et al., 2018; Finn et al., 2017). ERMAS ultimately", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 456, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 446, + 734 + ], + "score": 1.0, + "content": "yields policies that are robust to other agents’ behavioral deviations, up to a regret of", + "type": "text" + }, + { + "bbox": [ + 446, + 723, + 451, + 730 + ], + "score": 0.67, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 720, + 456, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45 + } + ], + "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, + 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, + 502, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 78, + 504, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 78, + 504, + 97 + ], + "score": 1.0, + "content": "ERMAS: LEARNING POLICIES ROBUST TO REALITY", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 98, + 391, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 98, + 391, + 118 + ], + "score": 1.0, + "content": "GAPS IN MULTI-AGENT SIMULATIONS", + "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, + 212, + 468, + 376 + ], + "lines": [ + { + "bbox": [ + 142, + 212, + 469, + 223 + ], + "spans": [ + { + "bbox": [ + 142, + 212, + 469, + 223 + ], + "score": 1.0, + "content": "Policies for real-world multi-agent problems, such as optimal taxation, can be", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 223, + 470, + 235 + ], + "spans": [ + { + "bbox": [ + 141, + 223, + 470, + 235 + ], + "score": 1.0, + "content": "learned in multi-agent simulations with AI agents that emulate humans. How-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 234, + 469, + 247 + ], + "spans": [ + { + "bbox": [ + 141, + 234, + 469, + 247 + ], + "score": 1.0, + "content": "ever, simulations can suffer from reality gaps as humans often act suboptimally", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 245, + 470, + 257 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 459, + 257 + ], + "score": 1.0, + "content": "or optimize for different objectives (i.e., bounded rationality). We introduce", + "type": "text" + }, + { + "bbox": [ + 459, + 247, + 465, + 255 + ], + "score": 0.33, + "content": "\\epsilon \\cdot", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 245, + 470, + 257 + ], + "score": 1.0, + "content": "-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 469, + 268 + ], + "score": 1.0, + "content": "Robust Multi-Agent Simulation (ERMAS), a robust optimization framework to", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 266, + 470, + 280 + ], + "spans": [ + { + "bbox": [ + 141, + 266, + 470, + 280 + ], + "score": 1.0, + "content": "learn AI policies that are robust to such multi-agent reality gaps. The objective", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 277, + 470, + 290 + ], + "spans": [ + { + "bbox": [ + 141, + 277, + 362, + 290 + ], + "score": 1.0, + "content": "of ERMAS theoretically guarantees robustness to the", + "type": "text" + }, + { + "bbox": [ + 362, + 279, + 367, + 288 + ], + "score": 0.74, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 277, + 470, + 290 + ], + "score": 1.0, + "content": "-Nash equilibria of other", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 465, + 300 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 460, + 300 + ], + "score": 1.0, + "content": "agents – that is, robustness to behavioral deviations with a regret of at most", + "type": "text" + }, + { + "bbox": [ + 460, + 291, + 465, + 299 + ], + "score": 0.45, + "content": "\\epsilon", + "type": "inline_equation" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 299, + 469, + 312 + ], + "spans": [ + { + "bbox": [ + 141, + 299, + 469, + 312 + ], + "score": 1.0, + "content": "ERMAS efficiently solves a first-order approximation of the robustness objective", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 311, + 469, + 322 + ], + "spans": [ + { + "bbox": [ + 142, + 311, + 469, + 322 + ], + "score": 1.0, + "content": "using meta-learning methods. We show that ERMAS yields robust policies for", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 322, + 470, + 334 + ], + "spans": [ + { + "bbox": [ + 142, + 322, + 470, + 334 + ], + "score": 1.0, + "content": "repeated bimatrix games and optimal adaptive taxation in economic simulations,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 333, + 469, + 344 + ], + "spans": [ + { + "bbox": [ + 141, + 333, + 469, + 344 + ], + "score": 1.0, + "content": "even when baseline notions of robustness are uninformative or intractable. In", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 343, + 470, + 356 + ], + "spans": [ + { + "bbox": [ + 141, + 343, + 470, + 356 + ], + "score": 1.0, + "content": "particular, we show ERMAS can learn tax policies that are robust to changes in", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 354, + 469, + 367 + ], + "spans": [ + { + "bbox": [ + 141, + 354, + 438, + 367 + ], + "score": 1.0, + "content": "agent risk aversion, improving policy objectives (social welfare) by up to", + "type": "text" + }, + { + "bbox": [ + 438, + 354, + 457, + 365 + ], + "score": 0.89, + "content": "15 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 354, + 469, + 367 + ], + "score": 1.0, + "content": "in", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 366, + 469, + 378 + ], + "spans": [ + { + "bbox": [ + 141, + 366, + 469, + 378 + ], + "score": 1.0, + "content": "complex spatiotemporal simulations using the AI Economist (Zheng et al., 2020).", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 12, + "bbox_fs": [ + 141, + 212, + 470, + 378 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 398, + 206, + 411 + ], + "lines": [ + { + "bbox": [ + 105, + 397, + 208, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 208, + 414 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 424, + 505, + 544 + ], + "lines": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 505, + 436 + ], + "score": 1.0, + "content": "Reinforcement learning (RL) offers a tool to optimize policy decisions affecting complex, multi-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "agent systems; for example, to improve traffic flow or economic productivity. In practice, the need", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "score": 1.0, + "content": "for efficient policy evaluation necessitates training on simulations of multi-agent systems (MAS).", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 505, + 469 + ], + "score": 1.0, + "content": "Agents in these systems can be emulated with fixed behavioral rules, or by optimizing for a reward", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "function using RL (Zheng et al., 2020). For instance, the impact of economic policy decisions are of-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 478, + 504, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 504, + 491 + ], + "score": 1.0, + "content": "ten estimated with agent-based models (Holland & Miller, 1991; Bonabeau, 2002). This commonly", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "score": 1.0, + "content": "introduces a reality gap as the reward function and resulting behavior of simulated agents might", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 505, + 513 + ], + "score": 1.0, + "content": "differ from those of real people (Simon & Schaeffer, 1990). This becomes especially problematic", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 506, + 525 + ], + "score": 1.0, + "content": "as the complexity of the simulation grows, for example, when increasing the number of agents, or", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 523, + 505, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 505, + 535 + ], + "score": 1.0, + "content": "adding agent affordances (Kirman, 1992; Howitt, 2012). As a result, policies learned in imperfect", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 468, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 468, + 546 + ], + "score": 1.0, + "content": "simulations need to be robust against reality gaps in order to be effective in the real world.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 423, + 506, + 546 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 550, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 505, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 164, + 563 + ], + "score": 1.0, + "content": "We introduce", + "type": "text" + }, + { + "bbox": [ + 165, + 552, + 170, + 560 + ], + "score": 0.75, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 171, + 549, + 505, + 563 + ], + "score": 1.0, + "content": "-Robust Multi-Agent Simulation (ERMAS), a robust optimization framework for", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "training robust policies, termed planners, that interact with real-world multi-agent systems. ERMAS", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 586 + ], + "score": 1.0, + "content": "trains robust planners by simulating multi-agent systems with RL and sampling worst-case behaviors", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 505, + 596 + ], + "score": 1.0, + "content": "from the worst-case agents. This form of multi-agent robustness poses a very challenging multi-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 593, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 593, + 506, + 607 + ], + "score": 1.0, + "content": "level (e.g., max-min-min) optimization problem. Existing techniques which could be applied to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 618 + ], + "score": 1.0, + "content": "ERMAS’s multi-agent robustness objective, e.g., naive adversarial robustness (Pinto et al., 2017) and", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "domain randomization (Tobin et al., 2017; Peng et al., 2018), are intractable as they would require an", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 640 + ], + "score": 1.0, + "content": "expensive search through a large space of agent reward functions. Alternative frameworks improve", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "robustness, e.g., to changes in environment dynamics, observation or action spaces (Pinto et al.,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 505, + 662 + ], + "score": 1.0, + "content": "2017; Li et al., 2019; Tessler et al., 2019), but do not address reality gaps due to reward function", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 660, + 459, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 459, + 673 + ], + "score": 1.0, + "content": "mismatches, as they use inappropriate metrics on the space of adversarial perturbations.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 549, + 506, + 673 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 504, + 689 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 504, + 689 + ], + "score": 1.0, + "content": "To solve this problem, ERMAS has three key features: 1) It formulates a multi-agent robustness ob-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 275, + 700 + ], + "score": 1.0, + "content": "jective equivalent to finding the worst case", + "type": "text" + }, + { + "bbox": [ + 275, + 690, + 280, + 698 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "-Nash equilibria. 2) It optimizes a tractable dual problem", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 712 + ], + "score": 1.0, + "content": "to the equivalent objective. 3) It approximates the dual problem using local solution concepts and", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "first-order meta-learning techniques (Nichol et al., 2018; Finn et al., 2017). ERMAS ultimately", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 456, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 446, + 734 + ], + "score": 1.0, + "content": "yields policies that are robust to other agents’ behavioral deviations, up to a regret of", + "type": "text" + }, + { + "bbox": [ + 446, + 723, + 451, + 730 + ], + "score": 0.67, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 720, + 456, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 676, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 182 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "We show that ERMAS learns robust policies in repeated bimatrix games by finding the worst-case", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "reality gaps, corresponding to highly adversarial agents, which in turn leads to more robust planners.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "We further consider a challenging, large-scale spatiotemporal economy that features a social plan-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "ner that learns to adjust agent rewards. In both settings, we show policies trained by ERMAS are", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 506, + 140 + ], + "score": 1.0, + "content": "more robust by testing them in perturbed environments with agents that have optimized for reward", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "functions unused during ERMAS training. This generalization error emulates the challenge faced", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "score": 1.0, + "content": "in transferring policies to the real world. In particular, we show ERMAS can find AI Economist tax", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 504, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 504, + 172 + ], + "score": 1.0, + "content": "policies that achieve higher social welfare across a broad range of agent risk aversion objectives. In", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 171, + 505, + 182 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 182 + ], + "score": 1.0, + "content": "all, we demonstrate ERMAS is effective even in settings where baselines fail or become intractable.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 324, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 326, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 326, + 207 + ], + "score": 1.0, + "content": "Contributions To summarize, our contributions are:", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 132, + 214, + 505, + 300 + ], + "lines": [ + { + "bbox": [ + 132, + 214, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 132, + 214, + 401, + 227 + ], + "score": 1.0, + "content": "• We derive a multi-agent adversarial robustness problem using", + "type": "text" + }, + { + "bbox": [ + 402, + 217, + 407, + 225 + ], + "score": 0.69, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 214, + 505, + 227 + ], + "score": 1.0, + "content": "-Nash equilibria, which", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 227, + 342, + 238 + ], + "spans": [ + { + "bbox": [ + 141, + 227, + 342, + 238 + ], + "score": 1.0, + "content": "poses a challenging nested optimization problem.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 131, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 131, + 239, + 505, + 253 + ], + "score": 1.0, + "content": "• We describe how ERMAS efficiently solves the nested problem using dualization, trust-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 142, + 253, + 340, + 263 + ], + "spans": [ + { + "bbox": [ + 142, + 253, + 340, + 263 + ], + "score": 1.0, + "content": "regions, and first-order meta-learning techniques.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 139, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 139, + 267, + 505, + 279 + ], + "score": 1.0, + "content": "We empirically validate ERMAS by training robust policies in two multi-agent problems:", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 278, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 142, + 278, + 506, + 291 + ], + "score": 1.0, + "content": "sequential bimatrix games and economic simulations. In particular, ERMAS scales to com-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 289, + 323, + 302 + ], + "spans": [ + { + "bbox": [ + 142, + 289, + 323, + 302 + ], + "score": 1.0, + "content": "plex spatiotemporal multi-agent simulations.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 13 + }, + { + "type": "title", + "bbox": [ + 106, + 316, + 479, + 329 + ], + "lines": [ + { + "bbox": [ + 104, + 315, + 481, + 330 + ], + "spans": [ + { + "bbox": [ + 104, + 315, + 481, + 330 + ], + "score": 1.0, + "content": "2 ROBUSTNESS AND REALITY GAPS IN MULTI-AGENT ENVIRONMENTS", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 340, + 505, + 419 + ], + "lines": [ + { + "bbox": [ + 105, + 340, + 506, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 212, + 354 + ], + "score": 1.0, + "content": "We seek to learn a policy", + "type": "text" + }, + { + "bbox": [ + 213, + 343, + 225, + 353 + ], + "score": 0.86, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 340, + 506, + 354 + ], + "score": 1.0, + "content": "for an agent, termed the planner, that interacts with an environment", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 352, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 352, + 145, + 365 + ], + "score": 1.0, + "content": "featuring", + "type": "text" + }, + { + "bbox": [ + 145, + 352, + 156, + 362 + ], + "score": 0.8, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 352, + 505, + 365 + ], + "score": 1.0, + "content": "other agents. The planner’s objective depends both on its own policy and the behavior", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 363, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 375 + ], + "score": 1.0, + "content": "of other agents in response to that policy; this is a multi-agent RL problem in which the planner", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 373, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 356, + 387 + ], + "score": 1.0, + "content": "and agents co-adapt. In practice, evaluating (and optimizing)", + "type": "text" + }, + { + "bbox": [ + 356, + 375, + 368, + 386 + ], + "score": 0.87, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 373, + 505, + 387 + ], + "score": 1.0, + "content": "requires use of a simulation with", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 384, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 398 + ], + "score": 1.0, + "content": "agents that emulate those in the environment of interest (i.e. the real world), which might contain", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "score": 1.0, + "content": "agents whose reward function differs from those used in the simulation. Our goal is to train planner", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 407, + 281, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 281, + 420 + ], + "score": 1.0, + "content": "policies that are robust to such reality gaps.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 423, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "score": 1.0, + "content": "Formally, we build on partially-observable multi-agent Markov Games (MGs) (Sutton & Barto,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 223, + 447 + ], + "score": 1.0, + "content": "2018), defined by the tuple", + "type": "text" + }, + { + "bbox": [ + 223, + 434, + 333, + 447 + ], + "score": 0.92, + "content": "\\dot { M } : = ( S , A , r , \\mathcal { T } , \\gamma , \\overset { \\triangledown } { o , \\mathcal { T } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 434, + 366, + 447 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 366, + 435, + 374, + 445 + ], + "score": 0.8, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 434, + 394, + 447 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 395, + 435, + 404, + 444 + ], + "score": 0.73, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "are the state and action", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 208, + 459 + ], + "score": 1.0, + "content": "spaces, respectively, and", + "type": "text" + }, + { + "bbox": [ + 209, + 446, + 217, + 456 + ], + "score": 0.79, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 445, + 505, + 459 + ], + "score": 1.0, + "content": "are agent indices. Since the MG played by the agents depends on the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 324, + 469 + ], + "score": 1.0, + "content": "choice of planner policy, we denote the MG given by", + "type": "text" + }, + { + "bbox": [ + 325, + 458, + 336, + 469 + ], + "score": 0.86, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 456, + 349, + 469 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 349, + 457, + 376, + 469 + ], + "score": 0.93, + "content": "M [ \\pi _ { p } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 456, + 506, + 469 + ], + "score": 1.0, + "content": ". MGs proceed in episodes that", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 467, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 123, + 480 + ], + "score": 1.0, + "content": "last", + "type": "text" + }, + { + "bbox": [ + 123, + 468, + 150, + 478 + ], + "score": 0.91, + "content": "H + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 467, + 286, + 480 + ], + "score": 1.0, + "content": "steps (possibly infinite), covering", + "type": "text" + }, + { + "bbox": [ + 287, + 468, + 297, + 478 + ], + "score": 0.81, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 467, + 399, + 480 + ], + "score": 1.0, + "content": "transitions. At each time", + "type": "text" + }, + { + "bbox": [ + 399, + 468, + 440, + 479 + ], + "score": 0.93, + "content": "t \\in [ 0 , H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 467, + 506, + 480 + ], + "score": 1.0, + "content": ", the world state", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 151, + 491 + ], + "score": 1.0, + "content": "is denoted", + "type": "text" + }, + { + "bbox": [ + 151, + 480, + 160, + 489 + ], + "score": 0.85, + "content": "s _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 478, + 216, + 491 + ], + "score": 1.0, + "content": ". Each agent", + "type": "text" + }, + { + "bbox": [ + 216, + 479, + 273, + 490 + ], + "score": 0.93, + "content": "i = 1 , \\ldots , N", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 478, + 373, + 491 + ], + "score": 1.0, + "content": "receives an observation", + "type": "text" + }, + { + "bbox": [ + 373, + 480, + 388, + 491 + ], + "score": 0.88, + "content": "o _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 478, + 470, + 491 + ], + "score": 1.0, + "content": ", executes an action", + "type": "text" + }, + { + "bbox": [ + 471, + 480, + 486, + 491 + ], + "score": 0.88, + "content": "a _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 478, + 506, + 491 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 488, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 104, + 488, + 177, + 503 + ], + "score": 1.0, + "content": "receives a reward", + "type": "text" + }, + { + "bbox": [ + 178, + 491, + 192, + 502 + ], + "score": 0.84, + "content": "{ \\boldsymbol { r } } _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 488, + 375, + 503 + ], + "score": 1.0, + "content": ". The environment transitions to the next state", + "type": "text" + }, + { + "bbox": [ + 375, + 492, + 394, + 501 + ], + "score": 0.9, + "content": "s _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 488, + 506, + 503 + ], + "score": 1.0, + "content": ", according to the transition", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 500, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 155, + 515 + ], + "score": 1.0, + "content": "distribution", + "type": "text" + }, + { + "bbox": [ + 155, + 501, + 217, + 514 + ], + "score": 0.94, + "content": "\\tau ( s _ { t + 1 } | s _ { t } , \\mathbf { a } _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 500, + 311, + 515 + ], + "score": 1.0, + "content": ".1 Each agent observes", + "type": "text" + }, + { + "bbox": [ + 311, + 504, + 326, + 514 + ], + "score": 0.87, + "content": "o _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 500, + 402, + 515 + ], + "score": 1.0, + "content": ", a part of the state", + "type": "text" + }, + { + "bbox": [ + 403, + 504, + 412, + 513 + ], + "score": 0.85, + "content": "s _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 500, + 478, + 515 + ], + "score": 1.0, + "content": ". Agent policies", + "type": "text" + }, + { + "bbox": [ + 478, + 503, + 489, + 513 + ], + "score": 0.85, + "content": "\\pi _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 500, + 505, + 515 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 512, + 395, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 178, + 527 + ], + "score": 1.0, + "content": "parameterized by", + "type": "text" + }, + { + "bbox": [ + 178, + 514, + 187, + 524 + ], + "score": 0.85, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 512, + 287, + 527 + ], + "score": 1.0, + "content": "while the planner policy", + "type": "text" + }, + { + "bbox": [ + 287, + 514, + 299, + 525 + ], + "score": 0.86, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 512, + 380, + 527 + ], + "score": 1.0, + "content": "is parameterized by", + "type": "text" + }, + { + "bbox": [ + 380, + 513, + 391, + 525 + ], + "score": 0.89, + "content": "\\theta _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 512, + 395, + 527 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 529, + 480, + 541 + ], + "lines": [ + { + "bbox": [ + 106, + 528, + 482, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 199, + 543 + ], + "score": 1.0, + "content": "The Nash equilibria of", + "type": "text" + }, + { + "bbox": [ + 199, + 529, + 227, + 542 + ], + "score": 0.92, + "content": "M [ \\pi _ { p } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 528, + 482, + 543 + ], + "score": 1.0, + "content": "are agent policies where any unilateral deviation is suboptimal:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "interline_equation", + "bbox": [ + 154, + 546, + 456, + 561 + ], + "lines": [ + { + "bbox": [ + 154, + 546, + 456, + 561 + ], + "spans": [ + { + "bbox": [ + 154, + 546, + 456, + 561 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\mathrm { \\mathbb { A } N E } ( \\pi _ { p } ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi : J _ { i } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "fe4e6af5b4dc9e7556aa3b7e25df6bc4f2baa0f14ac49567cc0185c33faade2f.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 154, + 546, + 456, + 561 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 566, + 502, + 597 + ], + "lines": [ + { + "bbox": [ + 104, + 563, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 104, + 564, + 133, + 587 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 566, + 275, + 586 + ], + "score": 0.92, + "content": "\\begin{array} { r } { J _ { i } ( \\pmb { \\pi } , \\pi _ { p } ) : = \\mathbb { E } _ { \\pmb { \\pi } , \\pi _ { p } } \\left[ \\sum _ { t = 0 } ^ { H } \\gamma ^ { t } r _ { t } ^ { ( i ) } \\right] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 563, + 399, + 588 + ], + "score": 1.0, + "content": "denotes the objective of agent", + "type": "text" + }, + { + "bbox": [ + 399, + 571, + 404, + 580 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 563, + 505, + 588 + ], + "score": 1.0, + "content": ". Hence, a rational agent", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 583, + 310, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 250, + 599 + ], + "score": 1.0, + "content": "would not unilaterally deviate from", + "type": "text" + }, + { + "bbox": [ + 250, + 585, + 306, + 597 + ], + "score": 0.89, + "content": "\\pi \\in \\bar { \\mathrm { A N E } } ( \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 583, + 310, + 599 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "text", + "bbox": [ + 107, + 602, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 601, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 248, + 616 + ], + "score": 1.0, + "content": "To evaluate a fixed planner policy", + "type": "text" + }, + { + "bbox": [ + 248, + 604, + 259, + 614 + ], + "score": 0.85, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 601, + 442, + 616 + ], + "score": 1.0, + "content": ", we simply sample outcomes using policies", + "type": "text" + }, + { + "bbox": [ + 442, + 602, + 501, + 614 + ], + "score": 0.91, + "content": "\\pi \\in \\tt { A N E } ( \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 601, + 505, + 616 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 613, + 506, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 173, + 626 + ], + "score": 1.0, + "content": "Also optimizing", + "type": "text" + }, + { + "bbox": [ + 174, + 615, + 185, + 626 + ], + "score": 0.86, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 613, + 506, + 626 + ], + "score": 1.0, + "content": "introduces a form of two-level learning. Under appropriate conditions, this can", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 624, + 443, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 443, + 636 + ], + "score": 1.0, + "content": "be solved with simultaneous gradient descent (Zheng et al., 2020; Fiez et al., 2019).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 409, + 661 + ], + "score": 1.0, + "content": "Robustness Objective As noted before, we wish to learn planner policies", + "type": "text" + }, + { + "bbox": [ + 409, + 649, + 421, + 660 + ], + "score": 0.87, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 647, + 505, + 661 + ], + "score": 1.0, + "content": "that are robust to re-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "score": 1.0, + "content": "ality gaps arising from changes in agent reward functions, e.g., when agents are boundedly rational.2", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "We develop a robustness objective for the planner by formalizing such reality gaps as perturbations", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + } + ], + "page_idx": 1, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 690, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 118, + 687, + 486, + 704 + ], + "spans": [ + { + "bbox": [ + 118, + 687, + 301, + 704 + ], + "score": 1.0, + "content": "1Bold-faced quantities denote vectors or sets, e.g.,", + "type": "text" + }, + { + "bbox": [ + 302, + 691, + 369, + 702 + ], + "score": 0.91, + "content": "{ \\pmb a } = ( a _ { 1 } , \\dots , a _ { N } )", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 687, + 448, + 704 + ], + "score": 1.0, + "content": ", the action profile for", + "type": "text" + }, + { + "bbox": [ + 448, + 691, + 457, + 700 + ], + "score": 0.81, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 458, + 687, + 486, + 704 + ], + "score": 1.0, + "content": "agents.", + "type": "text" + } + ] + }, + { + "bbox": [ + 117, + 698, + 506, + 715 + ], + "spans": [ + { + "bbox": [ + 117, + 698, + 418, + 715 + ], + "score": 1.0, + "content": "2This type of reality gap occurs when the simulated environment’s reward function", + "type": "text" + }, + { + "bbox": [ + 418, + 703, + 424, + 711 + ], + "score": 0.75, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 698, + 506, + 715 + ], + "score": 1.0, + "content": "fails to rationalize the", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 711, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 106, + 711, + 505, + 723 + ], + "score": 1.0, + "content": "actual behavior of the agents in the real environment, i.e., when agents in the real world act suboptimally with", + "type": "text" + } + ] + }, + { + "bbox": [ + 106, + 721, + 263, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 263, + 733 + ], + "score": 1.0, + "content": "respect to the simulation’s reward function.", + "type": "text" + } + ] + } + ] + }, + { + "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, + 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": [ + 107, + 82, + 505, + 182 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "We show that ERMAS learns robust policies in repeated bimatrix games by finding the worst-case", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 107 + ], + "score": 1.0, + "content": "reality gaps, corresponding to highly adversarial agents, which in turn leads to more robust planners.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 505, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 505, + 118 + ], + "score": 1.0, + "content": "We further consider a challenging, large-scale spatiotemporal economy that features a social plan-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 505, + 128 + ], + "score": 1.0, + "content": "ner that learns to adjust agent rewards. In both settings, we show policies trained by ERMAS are", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 506, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 506, + 140 + ], + "score": 1.0, + "content": "more robust by testing them in perturbed environments with agents that have optimized for reward", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "functions unused during ERMAS training. This generalization error emulates the challenge faced", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "score": 1.0, + "content": "in transferring policies to the real world. In particular, we show ERMAS can find AI Economist tax", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 159, + 504, + 172 + ], + "spans": [ + { + "bbox": [ + 105, + 159, + 504, + 172 + ], + "score": 1.0, + "content": "policies that achieve higher social welfare across a broad range of agent risk aversion objectives. In", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 171, + 505, + 182 + ], + "spans": [ + { + "bbox": [ + 106, + 171, + 505, + 182 + ], + "score": 1.0, + "content": "all, we demonstrate ERMAS is effective even in settings where baselines fail or become intractable.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 81, + 506, + 182 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 324, + 205 + ], + "lines": [ + { + "bbox": [ + 106, + 192, + 326, + 207 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 326, + 207 + ], + "score": 1.0, + "content": "Contributions To summarize, our contributions are:", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 106, + 192, + 326, + 207 + ] + }, + { + "type": "list", + "bbox": [ + 132, + 214, + 505, + 300 + ], + "lines": [ + { + "bbox": [ + 132, + 214, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 132, + 214, + 401, + 227 + ], + "score": 1.0, + "content": "• We derive a multi-agent adversarial robustness problem using", + "type": "text" + }, + { + "bbox": [ + 402, + 217, + 407, + 225 + ], + "score": 0.69, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 214, + 505, + 227 + ], + "score": 1.0, + "content": "-Nash equilibria, which", + "type": "text" + } + ], + "index": 10, + "is_list_start_line": true + }, + { + "bbox": [ + 141, + 227, + 342, + 238 + ], + "spans": [ + { + "bbox": [ + 141, + 227, + 342, + 238 + ], + "score": 1.0, + "content": "poses a challenging nested optimization problem.", + "type": "text" + } + ], + "index": 11, + "is_list_end_line": true + }, + { + "bbox": [ + 131, + 239, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 131, + 239, + 505, + 253 + ], + "score": 1.0, + "content": "• We describe how ERMAS efficiently solves the nested problem using dualization, trust-", + "type": "text" + } + ], + "index": 12, + "is_list_start_line": true + }, + { + "bbox": [ + 142, + 253, + 340, + 263 + ], + "spans": [ + { + "bbox": [ + 142, + 253, + 340, + 263 + ], + "score": 1.0, + "content": "regions, and first-order meta-learning techniques.", + "type": "text" + } + ], + "index": 13, + "is_list_end_line": true + }, + { + "bbox": [ + 139, + 267, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 139, + 267, + 505, + 279 + ], + "score": 1.0, + "content": "We empirically validate ERMAS by training robust policies in two multi-agent problems:", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 142, + 278, + 506, + 291 + ], + "spans": [ + { + "bbox": [ + 142, + 278, + 506, + 291 + ], + "score": 1.0, + "content": "sequential bimatrix games and economic simulations. In particular, ERMAS scales to com-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 289, + 323, + 302 + ], + "spans": [ + { + "bbox": [ + 142, + 289, + 323, + 302 + ], + "score": 1.0, + "content": "plex spatiotemporal multi-agent simulations.", + "type": "text" + } + ], + "index": 16, + "is_list_end_line": true + } + ], + "index": 13, + "bbox_fs": [ + 131, + 214, + 506, + 302 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 316, + 479, + 329 + ], + "lines": [ + { + "bbox": [ + 104, + 315, + 481, + 330 + ], + "spans": [ + { + "bbox": [ + 104, + 315, + 481, + 330 + ], + "score": 1.0, + "content": "2 ROBUSTNESS AND REALITY GAPS IN MULTI-AGENT ENVIRONMENTS", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 340, + 505, + 419 + ], + "lines": [ + { + "bbox": [ + 105, + 340, + 506, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 212, + 354 + ], + "score": 1.0, + "content": "We seek to learn a policy", + "type": "text" + }, + { + "bbox": [ + 213, + 343, + 225, + 353 + ], + "score": 0.86, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 340, + 506, + 354 + ], + "score": 1.0, + "content": "for an agent, termed the planner, that interacts with an environment", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 352, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 352, + 145, + 365 + ], + "score": 1.0, + "content": "featuring", + "type": "text" + }, + { + "bbox": [ + 145, + 352, + 156, + 362 + ], + "score": 0.8, + "content": "N", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 352, + 505, + 365 + ], + "score": 1.0, + "content": "other agents. The planner’s objective depends both on its own policy and the behavior", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 363, + 505, + 375 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 375 + ], + "score": 1.0, + "content": "of other agents in response to that policy; this is a multi-agent RL problem in which the planner", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 373, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 356, + 387 + ], + "score": 1.0, + "content": "and agents co-adapt. In practice, evaluating (and optimizing)", + "type": "text" + }, + { + "bbox": [ + 356, + 375, + 368, + 386 + ], + "score": 0.87, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 373, + 505, + 387 + ], + "score": 1.0, + "content": "requires use of a simulation with", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 384, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 398 + ], + "score": 1.0, + "content": "agents that emulate those in the environment of interest (i.e. the real world), which might contain", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "score": 1.0, + "content": "agents whose reward function differs from those used in the simulation. Our goal is to train planner", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 407, + 281, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 281, + 420 + ], + "score": 1.0, + "content": "policies that are robust to such reality gaps.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 340, + 506, + 420 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 423, + 505, + 525 + ], + "lines": [ + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 423, + 506, + 437 + ], + "score": 1.0, + "content": "Formally, we build on partially-observable multi-agent Markov Games (MGs) (Sutton & Barto,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 223, + 447 + ], + "score": 1.0, + "content": "2018), defined by the tuple", + "type": "text" + }, + { + "bbox": [ + 223, + 434, + 333, + 447 + ], + "score": 0.92, + "content": "\\dot { M } : = ( S , A , r , \\mathcal { T } , \\gamma , \\overset { \\triangledown } { o , \\mathcal { T } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 434, + 366, + 447 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 366, + 435, + 374, + 445 + ], + "score": 0.8, + "content": "S", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 434, + 394, + 447 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 395, + 435, + 404, + 444 + ], + "score": 0.73, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "are the state and action", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 208, + 459 + ], + "score": 1.0, + "content": "spaces, respectively, and", + "type": "text" + }, + { + "bbox": [ + 209, + 446, + 217, + 456 + ], + "score": 0.79, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 445, + 505, + 459 + ], + "score": 1.0, + "content": "are agent indices. Since the MG played by the agents depends on the", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 456, + 506, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 324, + 469 + ], + "score": 1.0, + "content": "choice of planner policy, we denote the MG given by", + "type": "text" + }, + { + "bbox": [ + 325, + 458, + 336, + 469 + ], + "score": 0.86, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 456, + 349, + 469 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 349, + 457, + 376, + 469 + ], + "score": 0.93, + "content": "M [ \\pi _ { p } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 456, + 506, + 469 + ], + "score": 1.0, + "content": ". MGs proceed in episodes that", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 467, + 506, + 480 + ], + "spans": [ + { + "bbox": [ + 105, + 467, + 123, + 480 + ], + "score": 1.0, + "content": "last", + "type": "text" + }, + { + "bbox": [ + 123, + 468, + 150, + 478 + ], + "score": 0.91, + "content": "H + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 467, + 286, + 480 + ], + "score": 1.0, + "content": "steps (possibly infinite), covering", + "type": "text" + }, + { + "bbox": [ + 287, + 468, + 297, + 478 + ], + "score": 0.81, + "content": "H", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 467, + 399, + 480 + ], + "score": 1.0, + "content": "transitions. At each time", + "type": "text" + }, + { + "bbox": [ + 399, + 468, + 440, + 479 + ], + "score": 0.93, + "content": "t \\in [ 0 , H ]", + "type": "inline_equation" + }, + { + "bbox": [ + 440, + 467, + 506, + 480 + ], + "score": 1.0, + "content": ", the world state", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 478, + 506, + 491 + ], + "spans": [ + { + "bbox": [ + 105, + 478, + 151, + 491 + ], + "score": 1.0, + "content": "is denoted", + "type": "text" + }, + { + "bbox": [ + 151, + 480, + 160, + 489 + ], + "score": 0.85, + "content": "s _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 478, + 216, + 491 + ], + "score": 1.0, + "content": ". Each agent", + "type": "text" + }, + { + "bbox": [ + 216, + 479, + 273, + 490 + ], + "score": 0.93, + "content": "i = 1 , \\ldots , N", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 478, + 373, + 491 + ], + "score": 1.0, + "content": "receives an observation", + "type": "text" + }, + { + "bbox": [ + 373, + 480, + 388, + 491 + ], + "score": 0.88, + "content": "o _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 478, + 470, + 491 + ], + "score": 1.0, + "content": ", executes an action", + "type": "text" + }, + { + "bbox": [ + 471, + 480, + 486, + 491 + ], + "score": 0.88, + "content": "a _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 478, + 506, + 491 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 104, + 488, + 506, + 503 + ], + "spans": [ + { + "bbox": [ + 104, + 488, + 177, + 503 + ], + "score": 1.0, + "content": "receives a reward", + "type": "text" + }, + { + "bbox": [ + 178, + 491, + 192, + 502 + ], + "score": 0.84, + "content": "{ \\boldsymbol { r } } _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 192, + 488, + 375, + 503 + ], + "score": 1.0, + "content": ". The environment transitions to the next state", + "type": "text" + }, + { + "bbox": [ + 375, + 492, + 394, + 501 + ], + "score": 0.9, + "content": "s _ { t + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 488, + 506, + 503 + ], + "score": 1.0, + "content": ", according to the transition", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 500, + 505, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 500, + 155, + 515 + ], + "score": 1.0, + "content": "distribution", + "type": "text" + }, + { + "bbox": [ + 155, + 501, + 217, + 514 + ], + "score": 0.94, + "content": "\\tau ( s _ { t + 1 } | s _ { t } , \\mathbf { a } _ { t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 500, + 311, + 515 + ], + "score": 1.0, + "content": ".1 Each agent observes", + "type": "text" + }, + { + "bbox": [ + 311, + 504, + 326, + 514 + ], + "score": 0.87, + "content": "o _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 326, + 500, + 402, + 515 + ], + "score": 1.0, + "content": ", a part of the state", + "type": "text" + }, + { + "bbox": [ + 403, + 504, + 412, + 513 + ], + "score": 0.85, + "content": "s _ { t }", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 500, + 478, + 515 + ], + "score": 1.0, + "content": ". Agent policies", + "type": "text" + }, + { + "bbox": [ + 478, + 503, + 489, + 513 + ], + "score": 0.85, + "content": "\\pi _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 500, + 505, + 515 + ], + "score": 1.0, + "content": "are", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 512, + 395, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 178, + 527 + ], + "score": 1.0, + "content": "parameterized by", + "type": "text" + }, + { + "bbox": [ + 178, + 514, + 187, + 524 + ], + "score": 0.85, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 512, + 287, + 527 + ], + "score": 1.0, + "content": "while the planner policy", + "type": "text" + }, + { + "bbox": [ + 287, + 514, + 299, + 525 + ], + "score": 0.86, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 512, + 380, + 527 + ], + "score": 1.0, + "content": "is parameterized by", + "type": "text" + }, + { + "bbox": [ + 380, + 513, + 391, + 525 + ], + "score": 0.89, + "content": "\\theta _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 512, + 395, + 527 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 29, + "bbox_fs": [ + 104, + 423, + 506, + 527 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 529, + 480, + 541 + ], + "lines": [ + { + "bbox": [ + 106, + 528, + 482, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 199, + 543 + ], + "score": 1.0, + "content": "The Nash equilibria of", + "type": "text" + }, + { + "bbox": [ + 199, + 529, + 227, + 542 + ], + "score": 0.92, + "content": "M [ \\pi _ { p } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 528, + 482, + 543 + ], + "score": 1.0, + "content": "are agent policies where any unilateral deviation is suboptimal:", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34, + "bbox_fs": [ + 106, + 528, + 482, + 543 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 154, + 546, + 456, + 561 + ], + "lines": [ + { + "bbox": [ + 154, + 546, + 456, + 561 + ], + "spans": [ + { + "bbox": [ + 154, + 546, + 456, + 561 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\mathrm { \\mathbb { A } N E } ( \\pi _ { p } ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi : J _ { i } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "fe4e6af5b4dc9e7556aa3b7e25df6bc4f2baa0f14ac49567cc0185c33faade2f.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 154, + 546, + 456, + 561 + ], + "spans": [], + "index": 35 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 566, + 502, + 597 + ], + "lines": [ + { + "bbox": [ + 104, + 563, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 104, + 564, + 133, + 587 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 566, + 275, + 586 + ], + "score": 0.92, + "content": "\\begin{array} { r } { J _ { i } ( \\pmb { \\pi } , \\pi _ { p } ) : = \\mathbb { E } _ { \\pmb { \\pi } , \\pi _ { p } } \\left[ \\sum _ { t = 0 } ^ { H } \\gamma ^ { t } r _ { t } ^ { ( i ) } \\right] } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 563, + 399, + 588 + ], + "score": 1.0, + "content": "denotes the objective of agent", + "type": "text" + }, + { + "bbox": [ + 399, + 571, + 404, + 580 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 405, + 563, + 505, + 588 + ], + "score": 1.0, + "content": ". Hence, a rational agent", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 583, + 310, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 250, + 599 + ], + "score": 1.0, + "content": "would not unilaterally deviate from", + "type": "text" + }, + { + "bbox": [ + 250, + 585, + 306, + 597 + ], + "score": 0.89, + "content": "\\pi \\in \\bar { \\mathrm { A N E } } ( \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 583, + 310, + 599 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 104, + 563, + 505, + 599 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 602, + 505, + 635 + ], + "lines": [ + { + "bbox": [ + 105, + 601, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 248, + 616 + ], + "score": 1.0, + "content": "To evaluate a fixed planner policy", + "type": "text" + }, + { + "bbox": [ + 248, + 604, + 259, + 614 + ], + "score": 0.85, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 260, + 601, + 442, + 616 + ], + "score": 1.0, + "content": ", we simply sample outcomes using policies", + "type": "text" + }, + { + "bbox": [ + 442, + 602, + 501, + 614 + ], + "score": 0.91, + "content": "\\pi \\in \\tt { A N E } ( \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 601, + 505, + 616 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 613, + 506, + 626 + ], + "spans": [ + { + "bbox": [ + 105, + 613, + 173, + 626 + ], + "score": 1.0, + "content": "Also optimizing", + "type": "text" + }, + { + "bbox": [ + 174, + 615, + 185, + 626 + ], + "score": 0.86, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 613, + 506, + 626 + ], + "score": 1.0, + "content": "introduces a form of two-level learning. Under appropriate conditions, this can", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 624, + 443, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 443, + 636 + ], + "score": 1.0, + "content": "be solved with simultaneous gradient descent (Zheng et al., 2020; Fiez et al., 2019).", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 601, + 506, + 636 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 648, + 505, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 409, + 661 + ], + "score": 1.0, + "content": "Robustness Objective As noted before, we wish to learn planner policies", + "type": "text" + }, + { + "bbox": [ + 409, + 649, + 421, + 660 + ], + "score": 0.87, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 647, + 505, + 661 + ], + "score": 1.0, + "content": "that are robust to re-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 505, + 672 + ], + "score": 1.0, + "content": "ality gaps arising from changes in agent reward functions, e.g., when agents are boundedly rational.2", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 505, + 684 + ], + "score": 1.0, + "content": "We develop a robustness objective for the planner by formalizing such reality gaps as perturbations", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 105, + 647, + 505, + 684 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 137, + 94 + ], + "score": 0.91, + "content": "\\xi _ { i } \\in \\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 81, + 327, + 96 + ], + "score": 1.0, + "content": "to agent objectives, where the uncertainty set", + "type": "text" + }, + { + "bbox": [ + 327, + 82, + 406, + 95 + ], + "score": 0.93, + "content": "\\Xi : ( S , A ) ^ { H } \\to \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "is the space of possible", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 504, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 456, + 108 + ], + "score": 1.0, + "content": "perturbations and represents uncertainty about the objectives of other agents. We extend", + "type": "text" + }, + { + "bbox": [ + 457, + 93, + 504, + 106 + ], + "score": 0.91, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\xi )", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 314, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 302, + 118 + ], + "score": 1.0, + "content": "to condition the Nash equilibria on perturbations", + "type": "text" + }, + { + "bbox": [ + 303, + 105, + 309, + 116 + ], + "score": 0.84, + "content": "\\boldsymbol { \\xi }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 104, + 314, + 118 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 120, + 471, + 155 + ], + "lines": [ + { + "bbox": [ + 138, + 120, + 471, + 155 + ], + "spans": [ + { + "bbox": [ + 138, + 120, + 471, + 155 + ], + "score": 0.87, + "content": "\\begin{array} { r l } & { \\mathtt { \\mathbb { A } N E } ( \\pi _ { p } , \\xi ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi : J _ { i } ^ { \\xi } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ^ { \\xi } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\} , } \\\\ & { J _ { i } ^ { \\xi } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) : = J _ { i } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) + \\mathbb { E } _ { \\tau _ { i } \\sim \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } } \\left[ \\xi _ { i } ( \\tau _ { i } ) \\right] } \\end{array}", + "type": "interline_equation", + "image_path": "a375886923e5013c126281e75bbd986282fb360a56ed193944e360bb64f23ce0.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 138, + 120, + 471, + 131.66666666666666 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 138, + 131.66666666666666, + 471, + 143.33333333333331 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 138, + 143.33333333333331, + 471, + 154.99999999999997 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 158, + 505, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 158, + 504, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 133, + 171 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 160, + 142, + 169 + ], + "score": 0.84, + "content": "\\tau _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 158, + 417, + 171 + ], + "score": 1.0, + "content": "is a trajectory (sequence of state-action pairs). Following Morimoto", + "type": "text" + }, + { + "bbox": [ + 418, + 159, + 426, + 169 + ], + "score": 0.33, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 158, + 504, + 171 + ], + "score": 1.0, + "content": "Doya (2001), a ro-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 168, + 504, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 456, + 183 + ], + "score": 1.0, + "content": "bust planner optimizes its reward, subject to agents playing a perturbed Nash equilibrium", + "type": "text" + }, + { + "bbox": [ + 457, + 170, + 504, + 182 + ], + "score": 0.79, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\xi )", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 180, + 258, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 258, + 192 + ], + "score": 1.0, + "content": "that maximally penalizes the planner:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 215, + 196, + 396, + 218 + ], + "lines": [ + { + "bbox": [ + 215, + 196, + 396, + 218 + ], + "spans": [ + { + "bbox": [ + 215, + 196, + 396, + 218 + ], + "score": 0.93, + "content": "\\pi _ { p } ^ { * } = \\underset { \\pi _ { p } } { \\arg \\operatorname* { m a x } } ~ \\underset { \\xi \\in \\Xi } { \\operatorname* { m i n } } ~ \\underset { \\pi \\in \\mathrm { { a N E } } ( \\pi _ { p } , \\xi ) } { \\operatorname* { m i n } } ~ J _ { p } ( \\pi , \\pi _ { p } ) .", + "type": "interline_equation", + "image_path": "a099af48d0c272023c274205f3191591e9d377208fe61bc4d30a31469b2a65bc.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 215, + 196, + 396, + 218 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 223, + 503, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 204, + 237 + ], + "score": 1.0, + "content": "Note that agent policies", + "type": "text" + }, + { + "bbox": [ + 204, + 223, + 271, + 236 + ], + "score": 0.93, + "content": "\\pi \\in \\mathop { \\mathrm { A N E } } ( \\pi _ { p } , \\pmb { \\xi } )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "describes agents that optimize their own reward function,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 235, + 267, + 248 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 256, + 248 + ], + "score": 1.0, + "content": "and we assume an adversary chooses", + "type": "text" + }, + { + "bbox": [ + 256, + 236, + 263, + 246 + ], + "score": 0.83, + "content": "\\boldsymbol { \\xi }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 235, + 267, + 248 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 257, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 505, + 271 + ], + "score": 1.0, + "content": "Bounded Uncertainty Set There are two challenges with Equation 4. First, if the adversary can", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 181, + 281 + ], + "score": 1.0, + "content": "arbitrarily choose", + "type": "text" + }, + { + "bbox": [ + 181, + 270, + 190, + 279 + ], + "score": 0.46, + "content": "\\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 268, + 505, + 281 + ], + "score": 1.0, + "content": ", the worst case is uninformative.3 Second, depending on the complexity of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 279, + 506, + 293 + ], + "spans": [ + { + "bbox": [ + 107, + 280, + 115, + 290 + ], + "score": 0.53, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 279, + 200, + 293 + ], + "score": 1.0, + "content": ", the uncertainty set", + "type": "text" + }, + { + "bbox": [ + 200, + 281, + 210, + 290 + ], + "score": 0.61, + "content": "\\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 279, + 506, + 293 + ], + "score": 1.0, + "content": "may be high-dimensional and intractable to search. We address these", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 291, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 336, + 304 + ], + "score": 1.0, + "content": "issues by upper-bounding the size of the uncertainty set,", + "type": "text" + }, + { + "bbox": [ + 336, + 291, + 352, + 302 + ], + "score": 0.89, + "content": "L _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 291, + 389, + 304 + ], + "score": 1.0, + "content": "norm of", + "type": "text" + }, + { + "bbox": [ + 389, + 291, + 419, + 303 + ], + "score": 0.92, + "content": "\\xi _ { i } \\in \\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 291, + 471, + 304 + ], + "score": 1.0, + "content": ", by the term", + "type": "text" + }, + { + "bbox": [ + 472, + 294, + 477, + 301 + ], + "score": 0.47, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 291, + 506, + 304 + ], + "score": 1.0, + "content": ". Thus", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 301, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 107, + 304, + 112, + 312 + ], + "score": 0.61, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 301, + 506, + 316 + ], + "score": 1.0, + "content": "upper-bounds the difference between the reward functions of agents in the training and testing", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 313, + 472, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 472, + 326 + ], + "score": 1.0, + "content": "environments, e.g., between simulation and the real world. This bounded uncertainty set is:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14.5 + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 329, + 405, + 363 + ], + "lines": [ + { + "bbox": [ + 205, + 329, + 405, + 363 + ], + "spans": [ + { + "bbox": [ + 205, + 329, + 405, + 363 + ], + "score": 0.94, + "content": "\\Xi _ { \\epsilon } : = \\left\\{ \\xi \\left| \\operatorname* { s u p } _ { \\pi , \\pi _ { p } } | \\xi _ { i } ( \\pi , \\pi _ { p } ) | < \\epsilon , { \\mathrm { f o r } } { \\mathrm { a l l } } i \\in I \\right. \\right\\} .", + "type": "interline_equation", + "image_path": "d92e97db66d9727045d1b8e2049d8e5b9207209c1bcb3b4a0471630c7b5ce5ed.jpg" + } + ] + } + ], + "index": 18.5, + "virtual_lines": [ + { + "bbox": [ + 205, + 329, + 405, + 346.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 205, + 346.0, + 405, + 363.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 367, + 355, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 364, + 352, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 265, + 383 + ], + "score": 1.0, + "content": "This uncertainty set is equivalent to the", + "type": "text" + }, + { + "bbox": [ + 265, + 370, + 271, + 378 + ], + "score": 0.75, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 364, + 324, + 383 + ], + "score": 1.0, + "content": "-equilibria of", + "type": "text" + }, + { + "bbox": [ + 324, + 367, + 352, + 380 + ], + "score": 0.93, + "content": "M [ \\pi _ { p } ]", + "type": "inline_equation" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 142, + 384, + 469, + 398 + ], + "lines": [ + { + "bbox": [ + 142, + 384, + 469, + 398 + ], + "spans": [ + { + "bbox": [ + 142, + 384, + 469, + 398 + ], + "score": 0.89, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , { \\tilde { \\pi } } _ { i } \\in \\Pi : J _ { i } ( { \\tilde { \\pi } } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) + \\epsilon \\} .", + "type": "interline_equation", + "image_path": "2807cd0b02518cfd6aaff1f1c24c0e443c724d08211ae24e01399522bee080c1.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 142, + 384, + 469, + 398 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 402, + 504, + 446 + ], + "lines": [ + { + "bbox": [ + 106, + 402, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 112, + 413 + ], + "score": 0.71, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 112, + 402, + 506, + 415 + ], + "score": 1.0, + "content": "is a tunable hyperparameter—this is the case with most robust RL (Pinto et al., 2017; Li et al.,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 414, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 425 + ], + "score": 1.0, + "content": "2019)—but a good starting value is the anticipated error in reward objective estimates (application-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 425, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 438 + ], + "score": 1.0, + "content": "specific). Using 6, the robustness objective becomes the following constrained optimization prob-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 436, + 128, + 448 + ], + "spans": [ + { + "bbox": [ + 104, + 436, + 128, + 448 + ], + "score": 1.0, + "content": "lem:", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5 + }, + { + "type": "interline_equation", + "bbox": [ + 156, + 451, + 452, + 489 + ], + "lines": [ + { + "bbox": [ + 156, + 451, + 452, + 489 + ], + "spans": [ + { + "bbox": [ + 156, + 451, + 452, + 489 + ], + "score": 0.91, + "content": "\\underbrace { \\arg \\operatorname* { m a x } J _ { p , \\operatorname* { m i n } } ^ { * } ( \\pi _ { p } , \\epsilon ) } _ { \\texttt { P l a n n e r - O P T } } , \\quad \\mathrm { ~ w h e r e ~ } J _ { p , \\operatorname* { m i n } } ^ { * } ( \\pi _ { p } , \\epsilon ) : = \\underbrace { \\operatorname* { m i n } _ { \\pi \\in \\mathrm { \\mathrm { a N E } } ( \\pi _ { p } , \\epsilon ) } J _ { p } ( \\pi , \\pi _ { p } ) } _ { \\texttt { a g e n t - A d v - S e a r c h } } .", + "type": "interline_equation", + "image_path": "8c18738f67b8625c8f3965014fbbd64612faa31af2bf45ec0f63dc3b30bdcbfc.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 156, + 451, + 452, + 463.6666666666667 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 156, + 463.6666666666667, + 452, + 476.33333333333337 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 156, + 476.33333333333337, + 452, + 489.00000000000006 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 493, + 506, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 493, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 493, + 133, + 507 + ], + "score": 1.0, + "content": "Using", + "type": "text" + }, + { + "bbox": [ + 133, + 494, + 179, + 506 + ], + "score": 0.91, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 493, + 399, + 507 + ], + "score": 1.0, + "content": "replaces the problem of intractably searching through", + "type": "text" + }, + { + "bbox": [ + 399, + 494, + 408, + 504 + ], + "score": 0.61, + "content": "\\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 493, + 505, + 507 + ], + "score": 1.0, + "content": "with searching through", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 504, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 106, + 505, + 152, + 517 + ], + "score": 0.92, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 504, + 505, + 517 + ], + "score": 1.0, + "content": ", and thus merges the two nested min operations in Equation 4. Conceptually, this trans-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 515, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 505, + 528 + ], + "score": 1.0, + "content": "fers the worst-case search problem to the agents: Agent-Adv-Search agents find an adversarial", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 527, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 505, + 540 + ], + "score": 1.0, + "content": "equilibrium; Planner-OPT optimizes the planner given adversarial agents. Note that the con-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 537, + 506, + 551 + ], + "spans": [ + { + "bbox": [ + 104, + 537, + 250, + 551 + ], + "score": 1.0, + "content": "straint set in Eq 7 is non-empty for", + "type": "text" + }, + { + "bbox": [ + 251, + 538, + 275, + 549 + ], + "score": 0.9, + "content": "\\epsilon \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 537, + 506, + 551 + ], + "score": 1.0, + "content": "; the constraints (Eq 6) simply upper-bound the regret of", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 548, + 492, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 548, + 291, + 561 + ], + "score": 1.0, + "content": "agents. By definition, for non-empty bounded", + "type": "text" + }, + { + "bbox": [ + 291, + 549, + 300, + 558 + ], + "score": 0.37, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 548, + 492, + 561 + ], + "score": 1.0, + "content": ", there exists an optimal policy with zero regret.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31.5 + }, + { + "type": "title", + "bbox": [ + 106, + 575, + 438, + 589 + ], + "lines": [ + { + "bbox": [ + 104, + 574, + 440, + 591 + ], + "spans": [ + { + "bbox": [ + 104, + 574, + 440, + 591 + ], + "score": 1.0, + "content": "3 ERMAS: ROBUST POLICIES IN MULTI-AGENT SIMULATIONS", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 505, + 657 + ], + "lines": [ + { + "bbox": [ + 106, + 601, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 613 + ], + "score": 1.0, + "content": "We now introduce ERMAS, an efficient optimization framework to solve the robustness problem in", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 612, + 504, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 504, + 624 + ], + "score": 1.0, + "content": "Equation 7. ERMAS proceeds in three steps. First, it dualizes Equation 7 following constrained RL.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 622, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 323, + 637 + ], + "score": 1.0, + "content": "Second, it defines a trust-region for the uncertainty set", + "type": "text" + }, + { + "bbox": [ + 323, + 623, + 369, + 635 + ], + "score": 0.91, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 622, + 505, + 637 + ], + "score": 1.0, + "content": ", approximating the dual problem.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 633, + 505, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 647 + ], + "score": 1.0, + "content": "Finally, it uses first-order meta-learning with trust-regions to solve the approximate dual problem.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 644, + 350, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 350, + 658 + ], + "score": 1.0, + "content": "See Appendix A.1 for the detailed Algorithm description.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 107, + 668, + 505, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 506, + 680 + ], + "score": 1.0, + "content": "Dualizing Agent-Adv-Search The agent search problem in Equation 7 can be formulated", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 679, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 679, + 505, + 691 + ], + "score": 1.0, + "content": "similar to a constrained RL problem (Paternain et al., 2019), where the primary objective of the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 691, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 505, + 702 + ], + "score": 1.0, + "content": "agents is to minimize the planner’s reward and the secondary objective is to maximize their own", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 104, + 700, + 506, + 716 + ], + "spans": [ + { + "bbox": [ + 104, + 700, + 506, + 716 + ], + "score": 1.0, + "content": "reward. While conventional constrained RL enforces a constant lower bound in the constraint, e.g.,", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 119, + 721, + 294, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 718, + 292, + 734 + ], + "spans": [ + { + "bbox": [ + 118, + 718, + 208, + 734 + ], + "score": 1.0, + "content": "3For instance, by setting", + "type": "text" + }, + { + "bbox": [ + 208, + 722, + 217, + 732 + ], + "score": 0.84, + "content": "\\xi _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 718, + 252, + 734 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 253, + 720, + 292, + 732 + ], + "score": 0.92, + "content": "J _ { i } ^ { \\xi } = - J _ { p }", + "type": "inline_equation" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 26, + 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": "text", + "bbox": [ + 106, + 81, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 137, + 94 + ], + "score": 0.91, + "content": "\\xi _ { i } \\in \\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 81, + 327, + 96 + ], + "score": 1.0, + "content": "to agent objectives, where the uncertainty set", + "type": "text" + }, + { + "bbox": [ + 327, + 82, + 406, + 95 + ], + "score": 0.93, + "content": "\\Xi : ( S , A ) ^ { H } \\to \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "is the space of possible", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 504, + 108 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 456, + 108 + ], + "score": 1.0, + "content": "perturbations and represents uncertainty about the objectives of other agents. We extend", + "type": "text" + }, + { + "bbox": [ + 457, + 93, + 504, + 106 + ], + "score": 0.91, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\xi )", + "type": "inline_equation" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 314, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 302, + 118 + ], + "score": 1.0, + "content": "to condition the Nash equilibria on perturbations", + "type": "text" + }, + { + "bbox": [ + 303, + 105, + 309, + 116 + ], + "score": 0.84, + "content": "\\boldsymbol { \\xi }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 104, + 314, + 118 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 506, + 118 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 120, + 471, + 155 + ], + "lines": [ + { + "bbox": [ + 138, + 120, + 471, + 155 + ], + "spans": [ + { + "bbox": [ + 138, + 120, + 471, + 155 + ], + "score": 0.87, + "content": "\\begin{array} { r l } & { \\mathtt { \\mathbb { A } N E } ( \\pi _ { p } , \\xi ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi : J _ { i } ^ { \\xi } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ^ { \\xi } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\} , } \\\\ & { J _ { i } ^ { \\xi } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) : = J _ { i } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) + \\mathbb { E } _ { \\tau _ { i } \\sim \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } } \\left[ \\xi _ { i } ( \\tau _ { i } ) \\right] } \\end{array}", + "type": "interline_equation", + "image_path": "a375886923e5013c126281e75bbd986282fb360a56ed193944e360bb64f23ce0.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 138, + 120, + 471, + 131.66666666666666 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 138, + 131.66666666666666, + 471, + 143.33333333333331 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 138, + 143.33333333333331, + 471, + 154.99999999999997 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 158, + 505, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 158, + 504, + 171 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 133, + 171 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 160, + 142, + 169 + ], + "score": 0.84, + "content": "\\tau _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 158, + 417, + 171 + ], + "score": 1.0, + "content": "is a trajectory (sequence of state-action pairs). Following Morimoto", + "type": "text" + }, + { + "bbox": [ + 418, + 159, + 426, + 169 + ], + "score": 0.33, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 158, + 504, + 171 + ], + "score": 1.0, + "content": "Doya (2001), a ro-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 168, + 504, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 168, + 456, + 183 + ], + "score": 1.0, + "content": "bust planner optimizes its reward, subject to agents playing a perturbed Nash equilibrium", + "type": "text" + }, + { + "bbox": [ + 457, + 170, + 504, + 182 + ], + "score": 0.79, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\xi )", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 180, + 258, + 192 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 258, + 192 + ], + "score": 1.0, + "content": "that maximally penalizes the planner:", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 158, + 504, + 192 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 215, + 196, + 396, + 218 + ], + "lines": [ + { + "bbox": [ + 215, + 196, + 396, + 218 + ], + "spans": [ + { + "bbox": [ + 215, + 196, + 396, + 218 + ], + "score": 0.93, + "content": "\\pi _ { p } ^ { * } = \\underset { \\pi _ { p } } { \\arg \\operatorname* { m a x } } ~ \\underset { \\xi \\in \\Xi } { \\operatorname* { m i n } } ~ \\underset { \\pi \\in \\mathrm { { a N E } } ( \\pi _ { p } , \\xi ) } { \\operatorname* { m i n } } ~ J _ { p } ( \\pi , \\pi _ { p } ) .", + "type": "interline_equation", + "image_path": "a099af48d0c272023c274205f3191591e9d377208fe61bc4d30a31469b2a65bc.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 215, + 196, + 396, + 218 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 223, + 503, + 246 + ], + "lines": [ + { + "bbox": [ + 105, + 222, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 105, + 222, + 204, + 237 + ], + "score": 1.0, + "content": "Note that agent policies", + "type": "text" + }, + { + "bbox": [ + 204, + 223, + 271, + 236 + ], + "score": 0.93, + "content": "\\pi \\in \\mathop { \\mathrm { A N E } } ( \\pi _ { p } , \\pmb { \\xi } )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 222, + 505, + 237 + ], + "score": 1.0, + "content": "describes agents that optimize their own reward function,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 235, + 267, + 248 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 256, + 248 + ], + "score": 1.0, + "content": "and we assume an adversary chooses", + "type": "text" + }, + { + "bbox": [ + 256, + 236, + 263, + 246 + ], + "score": 0.83, + "content": "\\boldsymbol { \\xi }", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 235, + 267, + 248 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 105, + 222, + 505, + 248 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 257, + 505, + 325 + ], + "lines": [ + { + "bbox": [ + 105, + 257, + 505, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 505, + 271 + ], + "score": 1.0, + "content": "Bounded Uncertainty Set There are two challenges with Equation 4. First, if the adversary can", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 181, + 281 + ], + "score": 1.0, + "content": "arbitrarily choose", + "type": "text" + }, + { + "bbox": [ + 181, + 270, + 190, + 279 + ], + "score": 0.46, + "content": "\\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 268, + 505, + 281 + ], + "score": 1.0, + "content": ", the worst case is uninformative.3 Second, depending on the complexity of", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 107, + 279, + 506, + 293 + ], + "spans": [ + { + "bbox": [ + 107, + 280, + 115, + 290 + ], + "score": 0.53, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 279, + 200, + 293 + ], + "score": 1.0, + "content": ", the uncertainty set", + "type": "text" + }, + { + "bbox": [ + 200, + 281, + 210, + 290 + ], + "score": 0.61, + "content": "\\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 279, + 506, + 293 + ], + "score": 1.0, + "content": "may be high-dimensional and intractable to search. We address these", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 291, + 506, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 336, + 304 + ], + "score": 1.0, + "content": "issues by upper-bounding the size of the uncertainty set,", + "type": "text" + }, + { + "bbox": [ + 336, + 291, + 352, + 302 + ], + "score": 0.89, + "content": "L _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 291, + 389, + 304 + ], + "score": 1.0, + "content": "norm of", + "type": "text" + }, + { + "bbox": [ + 389, + 291, + 419, + 303 + ], + "score": 0.92, + "content": "\\xi _ { i } \\in \\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 291, + 471, + 304 + ], + "score": 1.0, + "content": ", by the term", + "type": "text" + }, + { + "bbox": [ + 472, + 294, + 477, + 301 + ], + "score": 0.47, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 291, + 506, + 304 + ], + "score": 1.0, + "content": ". Thus", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 107, + 301, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 107, + 304, + 112, + 312 + ], + "score": 0.61, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 301, + 506, + 316 + ], + "score": 1.0, + "content": "upper-bounds the difference between the reward functions of agents in the training and testing", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 313, + 472, + 326 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 472, + 326 + ], + "score": 1.0, + "content": "environments, e.g., between simulation and the real world. This bounded uncertainty set is:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 14.5, + "bbox_fs": [ + 105, + 257, + 506, + 326 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 329, + 405, + 363 + ], + "lines": [ + { + "bbox": [ + 205, + 329, + 405, + 363 + ], + "spans": [ + { + "bbox": [ + 205, + 329, + 405, + 363 + ], + "score": 0.94, + "content": "\\Xi _ { \\epsilon } : = \\left\\{ \\xi \\left| \\operatorname* { s u p } _ { \\pi , \\pi _ { p } } | \\xi _ { i } ( \\pi , \\pi _ { p } ) | < \\epsilon , { \\mathrm { f o r } } { \\mathrm { a l l } } i \\in I \\right. \\right\\} .", + "type": "interline_equation", + "image_path": "d92e97db66d9727045d1b8e2049d8e5b9207209c1bcb3b4a0471630c7b5ce5ed.jpg" + } + ] + } + ], + "index": 18.5, + "virtual_lines": [ + { + "bbox": [ + 205, + 329, + 405, + 346.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 205, + 346.0, + 405, + 363.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 367, + 355, + 379 + ], + "lines": [ + { + "bbox": [ + 105, + 364, + 352, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 364, + 265, + 383 + ], + "score": 1.0, + "content": "This uncertainty set is equivalent to the", + "type": "text" + }, + { + "bbox": [ + 265, + 370, + 271, + 378 + ], + "score": 0.75, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 364, + 324, + 383 + ], + "score": 1.0, + "content": "-equilibria of", + "type": "text" + }, + { + "bbox": [ + 324, + 367, + 352, + 380 + ], + "score": 0.93, + "content": "M [ \\pi _ { p } ]", + "type": "inline_equation" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 364, + 352, + 383 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 142, + 384, + 469, + 398 + ], + "lines": [ + { + "bbox": [ + 142, + 384, + 469, + 398 + ], + "spans": [ + { + "bbox": [ + 142, + 384, + 469, + 398 + ], + "score": 0.89, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , { \\tilde { \\pi } } _ { i } \\in \\Pi : J _ { i } ( { \\tilde { \\pi } } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) + \\epsilon \\} .", + "type": "interline_equation", + "image_path": "2807cd0b02518cfd6aaff1f1c24c0e443c724d08211ae24e01399522bee080c1.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 142, + 384, + 469, + 398 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 402, + 504, + 446 + ], + "lines": [ + { + "bbox": [ + 106, + 402, + 506, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 405, + 112, + 413 + ], + "score": 0.71, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 112, + 402, + 506, + 415 + ], + "score": 1.0, + "content": "is a tunable hyperparameter—this is the case with most robust RL (Pinto et al., 2017; Li et al.,", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 414, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 106, + 414, + 505, + 425 + ], + "score": 1.0, + "content": "2019)—but a good starting value is the anticipated error in reward objective estimates (application-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 425, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 438 + ], + "score": 1.0, + "content": "specific). Using 6, the robustness objective becomes the following constrained optimization prob-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 436, + 128, + 448 + ], + "spans": [ + { + "bbox": [ + 104, + 436, + 128, + 448 + ], + "score": 1.0, + "content": "lem:", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5, + "bbox_fs": [ + 104, + 402, + 506, + 448 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 156, + 451, + 452, + 489 + ], + "lines": [ + { + "bbox": [ + 156, + 451, + 452, + 489 + ], + "spans": [ + { + "bbox": [ + 156, + 451, + 452, + 489 + ], + "score": 0.91, + "content": "\\underbrace { \\arg \\operatorname* { m a x } J _ { p , \\operatorname* { m i n } } ^ { * } ( \\pi _ { p } , \\epsilon ) } _ { \\texttt { P l a n n e r - O P T } } , \\quad \\mathrm { ~ w h e r e ~ } J _ { p , \\operatorname* { m i n } } ^ { * } ( \\pi _ { p } , \\epsilon ) : = \\underbrace { \\operatorname* { m i n } _ { \\pi \\in \\mathrm { \\mathrm { a N E } } ( \\pi _ { p } , \\epsilon ) } J _ { p } ( \\pi , \\pi _ { p } ) } _ { \\texttt { a g e n t - A d v - S e a r c h } } .", + "type": "interline_equation", + "image_path": "8c18738f67b8625c8f3965014fbbd64612faa31af2bf45ec0f63dc3b30bdcbfc.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 156, + 451, + 452, + 463.6666666666667 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 156, + 463.6666666666667, + 452, + 476.33333333333337 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 156, + 476.33333333333337, + 452, + 489.00000000000006 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 493, + 506, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 493, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 106, + 493, + 133, + 507 + ], + "score": 1.0, + "content": "Using", + "type": "text" + }, + { + "bbox": [ + 133, + 494, + 179, + 506 + ], + "score": 0.91, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 179, + 493, + 399, + 507 + ], + "score": 1.0, + "content": "replaces the problem of intractably searching through", + "type": "text" + }, + { + "bbox": [ + 399, + 494, + 408, + 504 + ], + "score": 0.61, + "content": "\\Xi", + "type": "inline_equation" + }, + { + "bbox": [ + 409, + 493, + 505, + 507 + ], + "score": 1.0, + "content": "with searching through", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 504, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 106, + 505, + 152, + 517 + ], + "score": 0.92, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 504, + 505, + 517 + ], + "score": 1.0, + "content": ", and thus merges the two nested min operations in Equation 4. Conceptually, this trans-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 515, + 505, + 528 + ], + "spans": [ + { + "bbox": [ + 105, + 515, + 505, + 528 + ], + "score": 1.0, + "content": "fers the worst-case search problem to the agents: Agent-Adv-Search agents find an adversarial", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 527, + 505, + 540 + ], + "spans": [ + { + "bbox": [ + 106, + 527, + 505, + 540 + ], + "score": 1.0, + "content": "equilibrium; Planner-OPT optimizes the planner given adversarial agents. Note that the con-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 104, + 537, + 506, + 551 + ], + "spans": [ + { + "bbox": [ + 104, + 537, + 250, + 551 + ], + "score": 1.0, + "content": "straint set in Eq 7 is non-empty for", + "type": "text" + }, + { + "bbox": [ + 251, + 538, + 275, + 549 + ], + "score": 0.9, + "content": "\\epsilon \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 537, + 506, + 551 + ], + "score": 1.0, + "content": "; the constraints (Eq 6) simply upper-bound the regret of", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 548, + 492, + 561 + ], + "spans": [ + { + "bbox": [ + 105, + 548, + 291, + 561 + ], + "score": 1.0, + "content": "agents. By definition, for non-empty bounded", + "type": "text" + }, + { + "bbox": [ + 291, + 549, + 300, + 558 + ], + "score": 0.37, + "content": "\\Pi", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 548, + 492, + 561 + ], + "score": 1.0, + "content": ", there exists an optimal policy with zero regret.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31.5, + "bbox_fs": [ + 104, + 493, + 506, + 561 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 575, + 438, + 589 + ], + "lines": [ + { + "bbox": [ + 104, + 574, + 440, + 591 + ], + "spans": [ + { + "bbox": [ + 104, + 574, + 440, + 591 + ], + "score": 1.0, + "content": "3 ERMAS: ROBUST POLICIES IN MULTI-AGENT SIMULATIONS", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "list", + "bbox": [ + 106, + 600, + 505, + 657 + ], + "lines": [ + { + "bbox": [ + 106, + 601, + 505, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 601, + 505, + 613 + ], + "score": 1.0, + "content": "We now introduce ERMAS, an efficient optimization framework to solve the robustness problem in", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 612, + 504, + 624 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 504, + 624 + ], + "score": 1.0, + "content": "Equation 7. ERMAS proceeds in three steps. First, it dualizes Equation 7 following constrained RL.", + "type": "text" + } + ], + "index": 37, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 622, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 323, + 637 + ], + "score": 1.0, + "content": "Second, it defines a trust-region for the uncertainty set", + "type": "text" + }, + { + "bbox": [ + 323, + 623, + 369, + 635 + ], + "score": 0.91, + "content": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 622, + 505, + 637 + ], + "score": 1.0, + "content": ", approximating the dual problem.", + "type": "text" + } + ], + "index": 38, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 633, + 505, + 647 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 505, + 647 + ], + "score": 1.0, + "content": "Finally, it uses first-order meta-learning with trust-regions to solve the approximate dual problem.", + "type": "text" + } + ], + "index": 39, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 105, + 644, + 350, + 658 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 350, + 658 + ], + "score": 1.0, + "content": "See Appendix A.1 for the detailed Algorithm description.", + "type": "text" + } + ], + "index": 40, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 38, + "bbox_fs": [ + 105, + 601, + 505, + 658 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 668, + 505, + 713 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 506, + 680 + ], + "score": 1.0, + "content": "Dualizing Agent-Adv-Search The agent search problem in Equation 7 can be formulated", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 679, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 679, + 505, + 691 + ], + "score": 1.0, + "content": "similar to a constrained RL problem (Paternain et al., 2019), where the primary objective of the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 691, + 505, + 702 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 505, + 702 + ], + "score": 1.0, + "content": "agents is to minimize the planner’s reward and the secondary objective is to maximize their own", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 104, + 700, + 506, + 716 + ], + "spans": [ + { + "bbox": [ + 104, + 700, + 506, + 716 + ], + "score": 1.0, + "content": "reward. While conventional constrained RL enforces a constant lower bound in the constraint, e.g.,", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5, + "bbox_fs": [ + 104, + 668, + 506, + 716 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 120, + 79, + 500, + 226 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 120, + 79, + 500, + 226 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 120, + 79, + 491, + 226 + ], + "spans": [ + { + "bbox": [ + 120, + 79, + 491, + 226 + ], + "score": 0.962, + "type": "image", + "image_path": "943d8f634e3d94ae59722df8702225ba2004a9f0331ec0769a80160845c2d6e2.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 120, + 79, + 500, + 128.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 120, + 128.0, + 500, + 177.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 120, + 177.0, + 500, + 226.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 235, + 505, + 291 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 235, + 504, + 247 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 504, + 247 + ], + "score": 1.0, + "content": "Figure 1: ERMAS trains planners that are robust to reality gaps in these testbed multi-agent simula-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 245, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 259 + ], + "score": 1.0, + "content": "tions. (Left) In the repeated bimatrix game, a pair of agents navigates a 2D landscape. Both agents", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 257, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 505, + 270 + ], + "score": 1.0, + "content": "and the planner receive rewards based on visited coordinates. Brighter squares indicate higher pay-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 267, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 506, + 281 + ], + "score": 1.0, + "content": "off. (Right) In the spatiotemporal economic simulation, 4 heterogenous agents perform labor, trade", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 279, + 442, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 442, + 291 + ], + "score": 1.0, + "content": "resources, earn income, and pay taxes according to the schedules set by the planner.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 106, + 312, + 504, + 336 + ], + "lines": [ + { + "bbox": [ + 107, + 311, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 107, + 313, + 168, + 325 + ], + "score": 0.91, + "content": "J _ { i } ( \\pi , \\pi _ { p } ) \\geq C", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 311, + 282, + 326 + ], + "score": 1.0, + "content": ", we enforce a dynamic one:", + "type": "text" + }, + { + "bbox": [ + 283, + 313, + 475, + 325 + ], + "score": 0.89, + "content": "\\forall i \\in 1 \\dots N : J _ { i } ( \\pmb { \\pi } , \\pi _ { p } ) \\geq J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - \\epsilon _ { : }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 311, + 505, + 326 + ], + "score": 1.0, + "content": ", where", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 321, + 452, + 339 + ], + "spans": [ + { + "bbox": [ + 107, + 325, + 118, + 336 + ], + "score": 0.88, + "content": "\\pi _ { i } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 321, + 294, + 339 + ], + "score": 1.0, + "content": "is the optimal unilateral deviation for agent", + "type": "text" + }, + { + "bbox": [ + 294, + 325, + 299, + 334 + ], + "score": 0.5, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 321, + 303, + 339 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 303, + 325, + 447, + 337 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\pi _ { i } ^ { * } : = \\arg \\operatorname* { m a x } _ { \\tilde { \\pi } _ { i } \\in \\Pi } J _ { i } \\big ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 321, + 452, + 339 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 104, + 340, + 504, + 353 + ], + "lines": [ + { + "bbox": [ + 105, + 339, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 137, + 354 + ], + "score": 1.0, + "content": "Letting", + "type": "text" + }, + { + "bbox": [ + 138, + 341, + 146, + 351 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 339, + 505, + 354 + ], + "score": 1.0, + "content": "denote Lagrange multipliers, we can dualize Agent-Adv-Search, i.e., Equation 4, as:", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 358, + 433, + 414 + ], + "lines": [ + { + "bbox": [ + 177, + 358, + 433, + 414 + ], + "spans": [ + { + "bbox": [ + 177, + 358, + 433, + 414 + ], + "score": 0.93, + "content": "\\underset { \\pi } { \\mathop { \\operatorname* { m i n } } } \\underbrace { \\Bigg ( J _ { p } ( \\pi , \\pi _ { p } ) - \\sum _ { i = 1 } ^ { N } \\lambda _ { i } \\left[ J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - J _ { i } ( \\pi , \\pi _ { p } ) - \\epsilon _ { i } \\right] \\Bigg ) } _ { J _ { p , \\operatorname* { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) } ,", + "type": "interline_equation", + "image_path": "c4db2af33b6cf9ca361143b6459f55a6578ff376dc2ad85e82de4fc3bdc74523.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 177, + 358, + 433, + 376.6666666666667 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 177, + 376.6666666666667, + 433, + 395.33333333333337 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 177, + 395.33333333333337, + 433, + 414.00000000000006 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 417, + 504, + 463 + ], + "lines": [ + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "score": 1.0, + "content": "This is identical to the dualization of constrained reinforcement learning, whose duality gap is em-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 429, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 505, + 441 + ], + "score": 1.0, + "content": "pirically negligible and provably zero under weak assumptions (Paternain et al., 2019). We now", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 440, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 207, + 453 + ], + "score": 1.0, + "content": "abuse notation to denote", + "type": "text" + }, + { + "bbox": [ + 207, + 440, + 293, + 452 + ], + "score": 0.91, + "content": "\\pmb { \\theta } : = [ \\theta _ { 1 } , \\ldots , \\theta _ { N } , \\theta _ { p } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 440, + 312, + 453 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 312, + 440, + 393, + 452 + ], + "score": 0.93, + "content": "J _ { p } ( \\pmb \\theta ) \\overset { \\cdot } { : = } J _ { p } ( \\pmb \\pi , \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 440, + 421, + 453 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 422, + 441, + 428, + 450 + ], + "score": 0.8, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 440, + 505, + 453 + ], + "score": 1.0, + "content": "are the parameters", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 451, + 323, + 463 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 117, + 463 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 452, + 124, + 461 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 125, + 451, + 323, + 463 + ], + "score": 1.0, + "content": ". To solve Equation 8, the agents apply gradients:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15.5 + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 468, + 441, + 486 + ], + "lines": [ + { + "bbox": [ + 169, + 468, + 441, + 486 + ], + "spans": [ + { + "bbox": [ + 169, + 468, + 441, + 486 + ], + "score": 0.89, + "content": "\\nabla _ { \\boldsymbol { \\theta } _ { i } } J _ { p , \\mathrm { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) = - \\nabla _ { \\boldsymbol { \\theta } _ { i } } J _ { p } ( \\pmb { \\theta } ) - \\lambda _ { i } \\nabla _ { \\boldsymbol { \\theta } _ { i } } \\left[ J _ { i } ( \\theta _ { i } ^ { \\prime } ( \\pmb { \\theta } ) , \\theta _ { - i } ) - J _ { i } ( \\pmb { \\theta } ) \\right] ,", + "type": "interline_equation", + "image_path": "2f02e5b56116b49192e5f318275e047dea2c5e68d3a0916f732a00e0e08c66b6.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 169, + 468, + 441, + 486 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 491, + 506, + 515 + ], + "lines": [ + { + "bbox": [ + 106, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 133, + 505 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 492, + 156, + 504 + ], + "score": 0.93, + "content": "\\theta _ { i } ^ { \\prime } ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 491, + 367, + 505 + ], + "score": 1.0, + "content": "is the parameters of the optimal unilateral deviation", + "type": "text" + }, + { + "bbox": [ + 367, + 492, + 379, + 504 + ], + "score": 0.89, + "content": "\\pi _ { i } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 491, + 419, + 505 + ], + "score": 1.0, + "content": "for agent", + "type": "text" + }, + { + "bbox": [ + 419, + 493, + 424, + 502 + ], + "score": 0.76, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 491, + 506, + 505 + ], + "score": 1.0, + "content": ", i.e. the parameters", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 504, + 488, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 504, + 407, + 515 + ], + "score": 1.0, + "content": "that minimize local regret, which depends on the current policy parameters", + "type": "text" + }, + { + "bbox": [ + 407, + 504, + 416, + 514 + ], + "score": 0.85, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 504, + 421, + 515 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 421, + 504, + 431, + 514 + ], + "score": 0.84, + "content": "\\lambda _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 504, + 488, + 515 + ], + "score": 1.0, + "content": "is updated as:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5 + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 520, + 415, + 538 + ], + "lines": [ + { + "bbox": [ + 196, + 520, + 415, + 538 + ], + "spans": [ + { + "bbox": [ + 196, + 520, + 415, + 538 + ], + "score": 0.9, + "content": "\\nabla _ { \\lambda _ { i } } J _ { p , \\mathrm { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) = J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - J _ { i } ( \\pi , \\pi _ { p } ) - \\epsilon _ { i } .", + "type": "interline_equation", + "image_path": "430e741a714f19983a9801db6f5bf585aee2250f12b770a6106294917c4fa709.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 196, + 520, + 415, + 538 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 543, + 505, + 578 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 291, + 557 + ], + "score": 1.0, + "content": "Equation 8 still poses a challenge through the", + "type": "text" + }, + { + "bbox": [ + 291, + 544, + 353, + 556 + ], + "score": 0.93, + "content": "J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 543, + 505, + 557 + ], + "score": 1.0, + "content": "terms, which correspond to unknown", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "score": 1.0, + "content": "agent regret. We now detail the efficient approximation of the value and derivative of agent regret", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 566, + 346, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 346, + 578 + ], + "score": 1.0, + "content": "using local and meta-learning approximations, respectively.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 590, + 505, + 624 + ], + "lines": [ + { + "bbox": [ + 106, + 590, + 504, + 604 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 219, + 604 + ], + "score": 1.0, + "content": "Trust Regions using Local", + "type": "text" + }, + { + "bbox": [ + 219, + 592, + 224, + 600 + ], + "score": 0.66, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 590, + 504, + 604 + ], + "score": 1.0, + "content": "-equilibria Estimating regret requires knowledge of the optimal uni-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 601, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 211, + 614 + ], + "score": 1.0, + "content": "lateral deviation for agent", + "type": "text" + }, + { + "bbox": [ + 211, + 602, + 216, + 611 + ], + "score": 0.72, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 601, + 457, + 614 + ], + "score": 1.0, + "content": ". We can simplify this problem by proposing a refinement of", + "type": "text" + }, + { + "bbox": [ + 457, + 603, + 462, + 611 + ], + "score": 0.67, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 601, + 506, + 614 + ], + "score": 1.0, + "content": "-equilibria", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 613, + 471, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 613, + 471, + 625 + ], + "score": 1.0, + "content": "inspired by the notion of local Nash equilibria in differentiable games (Ratliff et al., 2014).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 627, + 505, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 625, + 504, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 219, + 640 + ], + "score": 1.0, + "content": "Definition 3.1. A strategy", + "type": "text" + }, + { + "bbox": [ + 219, + 630, + 228, + 638 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 625, + 272, + 640 + ], + "score": 1.0, + "content": "is a local", + "type": "text" + }, + { + "bbox": [ + 272, + 630, + 278, + 637 + ], + "score": 0.76, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 625, + 456, + 640 + ], + "score": 1.0, + "content": "-Nash equilibrium if there exists open sets", + "type": "text" + }, + { + "bbox": [ + 456, + 626, + 504, + 639 + ], + "score": 0.9, + "content": "W _ { i } ~ \\subset ~ \\Pi ^ { N }", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 146, + 651 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 147, + 639, + 185, + 650 + ], + "score": 0.91, + "content": "\\pi _ { i } \\ \\in \\ W _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 637, + 242, + 651 + ], + "score": 1.0, + "content": "and for each", + "type": "text" + }, + { + "bbox": [ + 243, + 639, + 309, + 650 + ], + "score": 0.9, + "content": "i \\in \\{ 1 , \\ldots , N \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 637, + 367, + 651 + ], + "score": 1.0, + "content": "we have that", + "type": "text" + }, + { + "bbox": [ + 367, + 639, + 475, + 651 + ], + "score": 0.92, + "content": "J _ { i } ( \\pi _ { i } ^ { \\prime } , \\pi _ { - i } ) \\le J _ { i } ( \\pi ) + \\epsilon ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "for all", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 648, + 324, + 664 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 170, + 662 + ], + "score": 0.93, + "content": "\\pi _ { i } ^ { \\prime } \\in W _ { i } \\setminus \\{ \\pi _ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 648, + 200, + 664 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 201, + 650, + 318, + 664 + ], + "score": 0.81, + "content": "\\begin{array} { r } { \\epsilon ^ { \\prime } : = \\epsilon \\operatorname* { s u p } _ { \\pi _ { i } ^ { \\prime } \\in W _ { i } } K L ( \\pi _ { i } | | \\pi _ { i } ^ { \\prime } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 648, + 324, + 664 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 106, + 672, + 504, + 695 + ], + "lines": [ + { + "bbox": [ + 105, + 671, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 349, + 685 + ], + "score": 1.0, + "content": "By instead performing Agent-Adv-Search on the local", + "type": "text" + }, + { + "bbox": [ + 349, + 675, + 354, + 682 + ], + "score": 0.78, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 671, + 506, + 685 + ], + "score": 1.0, + "content": "-Nash equilibria, we can limit the set", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 682, + 370, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 339, + 697 + ], + "score": 1.0, + "content": "of unilateral deviations to consider to a small trust region,", + "type": "text" + }, + { + "bbox": [ + 339, + 684, + 366, + 696 + ], + "score": 0.91, + "content": "\\Pi _ { \\eta } ( \\pi )", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 682, + 370, + 697 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 700, + 471, + 731 + ], + "lines": [ + { + "bbox": [ + 121, + 700, + 471, + 731 + ], + "spans": [ + { + "bbox": [ + 121, + 700, + 471, + 731 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { \\mathbb { A } \\mathbb { N } \\mathbb { E } ( \\pi _ { p } , \\eta ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi _ { \\eta } ( \\pi _ { i } ) : J _ { i } \\big ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) \\leq J _ { i } \\big ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) + \\epsilon \\} , } \\\\ & { \\qquad \\Pi _ { \\eta } ( \\pi ) : = \\{ \\pi ^ { \\prime } \\in \\Pi \\mid K L ( \\pi | | \\pi ^ { \\prime } ) \\leq \\eta \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "56d2d7b3647c5e7733f8bb698a6343abcd27877f866e37ee30c8c07f942bfa88.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 121, + 700, + 471, + 710.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 121, + 710.3333333333334, + 471, + 720.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 121, + 720.6666666666667, + 471, + 731.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + } + ], + "page_idx": 3, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "4", + "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": [ + 120, + 79, + 500, + 226 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 120, + 79, + 500, + 226 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 120, + 79, + 491, + 226 + ], + "spans": [ + { + "bbox": [ + 120, + 79, + 491, + 226 + ], + "score": 0.962, + "type": "image", + "image_path": "943d8f634e3d94ae59722df8702225ba2004a9f0331ec0769a80160845c2d6e2.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 120, + 79, + 500, + 128.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 120, + 128.0, + 500, + 177.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 120, + 177.0, + 500, + 226.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 235, + 505, + 291 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 235, + 504, + 247 + ], + "spans": [ + { + "bbox": [ + 106, + 235, + 504, + 247 + ], + "score": 1.0, + "content": "Figure 1: ERMAS trains planners that are robust to reality gaps in these testbed multi-agent simula-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 245, + 505, + 259 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 259 + ], + "score": 1.0, + "content": "tions. (Left) In the repeated bimatrix game, a pair of agents navigates a 2D landscape. Both agents", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 257, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 505, + 270 + ], + "score": 1.0, + "content": "and the planner receive rewards based on visited coordinates. Brighter squares indicate higher pay-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 267, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 506, + 281 + ], + "score": 1.0, + "content": "off. (Right) In the spatiotemporal economic simulation, 4 heterogenous agents perform labor, trade", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 279, + 442, + 291 + ], + "spans": [ + { + "bbox": [ + 105, + 279, + 442, + 291 + ], + "score": 1.0, + "content": "resources, earn income, and pay taxes according to the schedules set by the planner.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 106, + 312, + 504, + 336 + ], + "lines": [ + { + "bbox": [ + 107, + 311, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 107, + 313, + 168, + 325 + ], + "score": 0.91, + "content": "J _ { i } ( \\pi , \\pi _ { p } ) \\geq C", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 311, + 282, + 326 + ], + "score": 1.0, + "content": ", we enforce a dynamic one:", + "type": "text" + }, + { + "bbox": [ + 283, + 313, + 475, + 325 + ], + "score": 0.89, + "content": "\\forall i \\in 1 \\dots N : J _ { i } ( \\pmb { \\pi } , \\pi _ { p } ) \\geq J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - \\epsilon _ { : }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 311, + 505, + 326 + ], + "score": 1.0, + "content": ", where", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 321, + 452, + 339 + ], + "spans": [ + { + "bbox": [ + 107, + 325, + 118, + 336 + ], + "score": 0.88, + "content": "\\pi _ { i } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 321, + 294, + 339 + ], + "score": 1.0, + "content": "is the optimal unilateral deviation for agent", + "type": "text" + }, + { + "bbox": [ + 294, + 325, + 299, + 334 + ], + "score": 0.5, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 321, + 303, + 339 + ], + "score": 1.0, + "content": ":", + "type": "text" + }, + { + "bbox": [ + 303, + 325, + 447, + 337 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\pi _ { i } ^ { * } : = \\arg \\operatorname* { m a x } _ { \\tilde { \\pi } _ { i } \\in \\Pi } J _ { i } \\big ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 321, + 452, + 339 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 107, + 311, + 505, + 339 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 340, + 504, + 353 + ], + "lines": [ + { + "bbox": [ + 105, + 339, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 137, + 354 + ], + "score": 1.0, + "content": "Letting", + "type": "text" + }, + { + "bbox": [ + 138, + 341, + 146, + 351 + ], + "score": 0.76, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 339, + 505, + 354 + ], + "score": 1.0, + "content": "denote Lagrange multipliers, we can dualize Agent-Adv-Search, i.e., Equation 4, as:", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 339, + 505, + 354 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 358, + 433, + 414 + ], + "lines": [ + { + "bbox": [ + 177, + 358, + 433, + 414 + ], + "spans": [ + { + "bbox": [ + 177, + 358, + 433, + 414 + ], + "score": 0.93, + "content": "\\underset { \\pi } { \\mathop { \\operatorname* { m i n } } } \\underbrace { \\Bigg ( J _ { p } ( \\pi , \\pi _ { p } ) - \\sum _ { i = 1 } ^ { N } \\lambda _ { i } \\left[ J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - J _ { i } ( \\pi , \\pi _ { p } ) - \\epsilon _ { i } \\right] \\Bigg ) } _ { J _ { p , \\operatorname* { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) } ,", + "type": "interline_equation", + "image_path": "c4db2af33b6cf9ca361143b6459f55a6578ff376dc2ad85e82de4fc3bdc74523.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 177, + 358, + 433, + 376.6666666666667 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 177, + 376.6666666666667, + 433, + 395.33333333333337 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 177, + 395.33333333333337, + 433, + 414.00000000000006 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 417, + 504, + 463 + ], + "lines": [ + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 505, + 430 + ], + "score": 1.0, + "content": "This is identical to the dualization of constrained reinforcement learning, whose duality gap is em-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 429, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 505, + 441 + ], + "score": 1.0, + "content": "pirically negligible and provably zero under weak assumptions (Paternain et al., 2019). We now", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 440, + 505, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 207, + 453 + ], + "score": 1.0, + "content": "abuse notation to denote", + "type": "text" + }, + { + "bbox": [ + 207, + 440, + 293, + 452 + ], + "score": 0.91, + "content": "\\pmb { \\theta } : = [ \\theta _ { 1 } , \\ldots , \\theta _ { N } , \\theta _ { p } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 440, + 312, + 453 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 312, + 440, + 393, + 452 + ], + "score": 0.93, + "content": "J _ { p } ( \\pmb \\theta ) \\overset { \\cdot } { : = } J _ { p } ( \\pmb \\pi , \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 440, + 421, + 453 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 422, + 441, + 428, + 450 + ], + "score": 0.8, + "content": "\\theta", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 440, + 505, + 453 + ], + "score": 1.0, + "content": "are the parameters", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 451, + 323, + 463 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 117, + 463 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 118, + 452, + 124, + 461 + ], + "score": 0.77, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 125, + 451, + 323, + 463 + ], + "score": 1.0, + "content": ". To solve Equation 8, the agents apply gradients:", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 417, + 505, + 463 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 468, + 441, + 486 + ], + "lines": [ + { + "bbox": [ + 169, + 468, + 441, + 486 + ], + "spans": [ + { + "bbox": [ + 169, + 468, + 441, + 486 + ], + "score": 0.89, + "content": "\\nabla _ { \\boldsymbol { \\theta } _ { i } } J _ { p , \\mathrm { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) = - \\nabla _ { \\boldsymbol { \\theta } _ { i } } J _ { p } ( \\pmb { \\theta } ) - \\lambda _ { i } \\nabla _ { \\boldsymbol { \\theta } _ { i } } \\left[ J _ { i } ( \\theta _ { i } ^ { \\prime } ( \\pmb { \\theta } ) , \\theta _ { - i } ) - J _ { i } ( \\pmb { \\theta } ) \\right] ,", + "type": "interline_equation", + "image_path": "2f02e5b56116b49192e5f318275e047dea2c5e68d3a0916f732a00e0e08c66b6.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 169, + 468, + 441, + 486 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 491, + 506, + 515 + ], + "lines": [ + { + "bbox": [ + 106, + 491, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 133, + 505 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 492, + 156, + 504 + ], + "score": 0.93, + "content": "\\theta _ { i } ^ { \\prime } ( \\pmb \\theta )", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 491, + 367, + 505 + ], + "score": 1.0, + "content": "is the parameters of the optimal unilateral deviation", + "type": "text" + }, + { + "bbox": [ + 367, + 492, + 379, + 504 + ], + "score": 0.89, + "content": "\\pi _ { i } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 491, + 419, + 505 + ], + "score": 1.0, + "content": "for agent", + "type": "text" + }, + { + "bbox": [ + 419, + 493, + 424, + 502 + ], + "score": 0.76, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 491, + 506, + 505 + ], + "score": 1.0, + "content": ", i.e. the parameters", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 504, + 488, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 504, + 407, + 515 + ], + "score": 1.0, + "content": "that minimize local regret, which depends on the current policy parameters", + "type": "text" + }, + { + "bbox": [ + 407, + 504, + 416, + 514 + ], + "score": 0.85, + "content": "\\theta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 504, + 421, + 515 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 421, + 504, + 431, + 514 + ], + "score": 0.84, + "content": "\\lambda _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 504, + 488, + 515 + ], + "score": 1.0, + "content": "is updated as:", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19.5, + "bbox_fs": [ + 106, + 491, + 506, + 515 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 520, + 415, + 538 + ], + "lines": [ + { + "bbox": [ + 196, + 520, + 415, + 538 + ], + "spans": [ + { + "bbox": [ + 196, + 520, + 415, + 538 + ], + "score": 0.9, + "content": "\\nabla _ { \\lambda _ { i } } J _ { p , \\mathrm { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) = J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - J _ { i } ( \\pi , \\pi _ { p } ) - \\epsilon _ { i } .", + "type": "interline_equation", + "image_path": "430e741a714f19983a9801db6f5bf585aee2250f12b770a6106294917c4fa709.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 196, + 520, + 415, + 538 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 543, + 505, + 578 + ], + "lines": [ + { + "bbox": [ + 106, + 543, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 106, + 543, + 291, + 557 + ], + "score": 1.0, + "content": "Equation 8 still poses a challenge through the", + "type": "text" + }, + { + "bbox": [ + 291, + 544, + 353, + 556 + ], + "score": 0.93, + "content": "J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 543, + 505, + 557 + ], + "score": 1.0, + "content": "terms, which correspond to unknown", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 506, + 568 + ], + "score": 1.0, + "content": "agent regret. We now detail the efficient approximation of the value and derivative of agent regret", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 566, + 346, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 566, + 346, + 578 + ], + "score": 1.0, + "content": "using local and meta-learning approximations, respectively.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 543, + 506, + 578 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 590, + 505, + 624 + ], + "lines": [ + { + "bbox": [ + 106, + 590, + 504, + 604 + ], + "spans": [ + { + "bbox": [ + 106, + 590, + 219, + 604 + ], + "score": 1.0, + "content": "Trust Regions using Local", + "type": "text" + }, + { + "bbox": [ + 219, + 592, + 224, + 600 + ], + "score": 0.66, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 590, + 504, + 604 + ], + "score": 1.0, + "content": "-equilibria Estimating regret requires knowledge of the optimal uni-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 601, + 506, + 614 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 211, + 614 + ], + "score": 1.0, + "content": "lateral deviation for agent", + "type": "text" + }, + { + "bbox": [ + 211, + 602, + 216, + 611 + ], + "score": 0.72, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 601, + 457, + 614 + ], + "score": 1.0, + "content": ". We can simplify this problem by proposing a refinement of", + "type": "text" + }, + { + "bbox": [ + 457, + 603, + 462, + 611 + ], + "score": 0.67, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 463, + 601, + 506, + 614 + ], + "score": 1.0, + "content": "-equilibria", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 613, + 471, + 625 + ], + "spans": [ + { + "bbox": [ + 106, + 613, + 471, + 625 + ], + "score": 1.0, + "content": "inspired by the notion of local Nash equilibria in differentiable games (Ratliff et al., 2014).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 590, + 506, + 625 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 627, + 505, + 663 + ], + "lines": [ + { + "bbox": [ + 105, + 625, + 504, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 625, + 219, + 640 + ], + "score": 1.0, + "content": "Definition 3.1. A strategy", + "type": "text" + }, + { + "bbox": [ + 219, + 630, + 228, + 638 + ], + "score": 0.75, + "content": "\\pi", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 625, + 272, + 640 + ], + "score": 1.0, + "content": "is a local", + "type": "text" + }, + { + "bbox": [ + 272, + 630, + 278, + 637 + ], + "score": 0.76, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 625, + 456, + 640 + ], + "score": 1.0, + "content": "-Nash equilibrium if there exists open sets", + "type": "text" + }, + { + "bbox": [ + 456, + 626, + 504, + 639 + ], + "score": 0.9, + "content": "W _ { i } ~ \\subset ~ \\Pi ^ { N }", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 146, + 651 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 147, + 639, + 185, + 650 + ], + "score": 0.91, + "content": "\\pi _ { i } \\ \\in \\ W _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 186, + 637, + 242, + 651 + ], + "score": 1.0, + "content": "and for each", + "type": "text" + }, + { + "bbox": [ + 243, + 639, + 309, + 650 + ], + "score": 0.9, + "content": "i \\in \\{ 1 , \\ldots , N \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 310, + 637, + 367, + 651 + ], + "score": 1.0, + "content": "we have that", + "type": "text" + }, + { + "bbox": [ + 367, + 639, + 475, + 651 + ], + "score": 0.92, + "content": "J _ { i } ( \\pi _ { i } ^ { \\prime } , \\pi _ { - i } ) \\le J _ { i } ( \\pi ) + \\epsilon ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "for all", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 648, + 324, + 664 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 170, + 662 + ], + "score": 0.93, + "content": "\\pi _ { i } ^ { \\prime } \\in W _ { i } \\setminus \\{ \\pi _ { i } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 170, + 648, + 200, + 664 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 201, + 650, + 318, + 664 + ], + "score": 0.81, + "content": "\\begin{array} { r } { \\epsilon ^ { \\prime } : = \\epsilon \\operatorname* { s u p } _ { \\pi _ { i } ^ { \\prime } \\in W _ { i } } K L ( \\pi _ { i } | | \\pi _ { i } ^ { \\prime } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 648, + 324, + 664 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 625, + 505, + 664 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 672, + 504, + 695 + ], + "lines": [ + { + "bbox": [ + 105, + 671, + 506, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 349, + 685 + ], + "score": 1.0, + "content": "By instead performing Agent-Adv-Search on the local", + "type": "text" + }, + { + "bbox": [ + 349, + 675, + 354, + 682 + ], + "score": 0.78, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 671, + 506, + 685 + ], + "score": 1.0, + "content": "-Nash equilibria, we can limit the set", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 682, + 370, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 339, + 697 + ], + "score": 1.0, + "content": "of unilateral deviations to consider to a small trust region,", + "type": "text" + }, + { + "bbox": [ + 339, + 684, + 366, + 696 + ], + "score": 0.91, + "content": "\\Pi _ { \\eta } ( \\pi )", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 682, + 370, + 697 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 671, + 506, + 697 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 700, + 471, + 731 + ], + "lines": [ + { + "bbox": [ + 121, + 700, + 471, + 731 + ], + "spans": [ + { + "bbox": [ + 121, + 700, + 471, + 731 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { \\mathbb { A } \\mathbb { N } \\mathbb { E } ( \\pi _ { p } , \\eta ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi _ { \\eta } ( \\pi _ { i } ) : J _ { i } \\big ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) \\leq J _ { i } \\big ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) + \\epsilon \\} , } \\\\ & { \\qquad \\Pi _ { \\eta } ( \\pi ) : = \\{ \\pi ^ { \\prime } \\in \\Pi \\mid K L ( \\pi | | \\pi ^ { \\prime } ) \\leq \\eta \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "56d2d7b3647c5e7733f8bb698a6343abcd27877f866e37ee30c8c07f942bfa88.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 121, + 700, + 471, + 710.3333333333334 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 121, + 710.3333333333334, + 471, + 720.6666666666667 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 121, + 720.6666666666667, + 471, + 731.0000000000001 + ], + "spans": [], + "index": 35 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 81, + 501, + 188 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 81, + 501, + 188 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 81, + 501, + 188 + ], + "spans": [ + { + "bbox": [ + 107, + 81, + 501, + 188 + ], + "score": 0.965, + "type": "image", + "image_path": "5274686511e733fa2839aabccf052df3ff70f75bf3ce8cab833d5bae3e220e22.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 81, + 501, + 116.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 116.66666666666666, + 501, + 152.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 152.33333333333331, + 501, + 187.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 198, + 505, + 309 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 199, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 505, + 210 + ], + "score": 1.0, + "content": "Figure 2: Validating ERMAS Agent-Adv-Search in constrained repeated bimatrix games. Each", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "point in the above scatter plots describes the average outcome at the end of training for the agents", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 110, + 233 + ], + "score": 1.0, + "content": "(", + "type": "text" + }, + { + "bbox": [ + 110, + 222, + 117, + 230 + ], + "score": 0.67, + "content": "\\scriptstyle { \\dot { x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 220, + 233, + 233 + ], + "score": 1.0, + "content": "-coordinate) and the planner (", + "type": "text" + }, + { + "bbox": [ + 233, + 222, + 240, + 232 + ], + "score": 0.74, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "-coordinate). Error bars indicate standard deviation. (Left) The bi-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 232, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 505, + 243 + ], + "score": 1.0, + "content": "matrix reward structure encodes a social dilemma featuring a low-agent-reward/high-planner-reward", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "score": 1.0, + "content": "Nash equilibrium, which is where vanilla MARL converges. Agents trained with ERMAS deviate", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "score": 1.0, + "content": "from this equilibrium in order to reduce planner reward. \u000f governs the extent of the allowable de-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 264, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 197, + 277 + ], + "score": 1.0, + "content": "viation. (Middle) As", + "type": "text" + }, + { + "bbox": [ + 197, + 266, + 204, + 274 + ], + "score": 0.59, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 264, + 506, + 277 + ], + "score": 1.0, + "content": "increases, the average per-timestep regret experienced by the agents also", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "increases. Each average is taken over the final 12 episodes after rewards have converged. (Right)", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 286, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 195, + 299 + ], + "score": 1.0, + "content": "Using fixed values of", + "type": "text" + }, + { + "bbox": [ + 196, + 286, + 203, + 296 + ], + "score": 0.77, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 286, + 505, + 299 + ], + "score": 1.0, + "content": "(rather than allowing it to update, as in the full algorithm) distorts perfor-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 298, + 468, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 312, + 308 + ], + "score": 1.0, + "content": "mance and prevents agents from reaching the same", + "type": "text" + }, + { + "bbox": [ + 312, + 299, + 317, + 307 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 298, + 457, + 308 + ], + "score": 1.0, + "content": "-equilibria discovered with learned", + "type": "text" + }, + { + "bbox": [ + 457, + 298, + 464, + 307 + ], + "score": 0.74, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 298, + 468, + 308 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 7.5 + } + ], + "index": 4.25 + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 505, + 386 + ], + "lines": [ + { + "bbox": [ + 106, + 330, + 505, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 134, + 342 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 331, + 162, + 342 + ], + "score": 0.9, + "content": "\\eta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 330, + 353, + 342 + ], + "score": 1.0, + "content": "defines the size of the trust region. For small", + "type": "text" + }, + { + "bbox": [ + 354, + 333, + 360, + 342 + ], + "score": 0.71, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 330, + 505, + 342 + ], + "score": 1.0, + "content": ", algorithms such as TRPO (Schul-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 450, + 354 + ], + "score": 1.0, + "content": "man et al., 2017) can be used to efficiently approximate optimal local deviations of", + "type": "text" + }, + { + "bbox": [ + 451, + 343, + 461, + 352 + ], + "score": 0.83, + "content": "\\pi _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 340, + 505, + 354 + ], + "score": 1.0, + "content": ", affording", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 352, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 227, + 365 + ], + "score": 1.0, + "content": "reasonable approximations of", + "type": "text" + }, + { + "bbox": [ + 228, + 352, + 290, + 365 + ], + "score": 0.93, + "content": "J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 352, + 505, + 365 + ], + "score": 1.0, + "content": ". Note that our usage of trust region algorithms is not", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "score": 1.0, + "content": "for optimization purposes. ERMAS requires the use of trust region optimization to ensure that the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 374, + 497, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 497, + 387 + ], + "score": 1.0, + "content": "equilibria considered by ERMAS are limited to a local neighborhood of the policy space (Eq 11).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 107, + 397, + 505, + 464 + ], + "lines": [ + { + "bbox": [ + 105, + 397, + 505, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 505, + 410 + ], + "score": 1.0, + "content": "First-Order Meta Learning Approximation The full gradient in Equation 9 is also complicated", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 409, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 316, + 421 + ], + "score": 1.0, + "content": "by the need to estimate the derivative of local regret", + "type": "text" + }, + { + "bbox": [ + 316, + 409, + 431, + 421 + ], + "score": 0.89, + "content": "\\nabla _ { \\boldsymbol { \\theta } _ { i } } \\left[ J _ { i } ( \\boldsymbol { \\theta } _ { i } ^ { \\prime } ( \\boldsymbol { \\theta } ) , \\boldsymbol { \\theta } _ { - i } ) - J _ { i } ( \\boldsymbol { \\theta } ) \\right]", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 409, + 505, + 421 + ], + "score": 1.0, + "content": ". The second term", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 420, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 506, + 433 + ], + "score": 1.0, + "content": "maximizes the performance of the agent’s policy and is simply found with policy gradient. The first", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 430, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 506, + 444 + ], + "score": 1.0, + "content": "term is less straightforward: it minimizes the performance of the best agent policy in the current trust", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 441, + 506, + 455 + ], + "spans": [ + { + "bbox": [ + 104, + 441, + 506, + 455 + ], + "score": 1.0, + "content": "region. We note that this first term corresponds to a meta-learning gradient. We follow REPTILE", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 452, + 482, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 355, + 465 + ], + "score": 1.0, + "content": "(Nichol et al., 2018) to obtain a first-order approximation of a", + "type": "text" + }, + { + "bbox": [ + 355, + 453, + 367, + 462 + ], + "score": 0.81, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 452, + 482, + 465 + ], + "score": 1.0, + "content": "-step meta-learning gradient:", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5 + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 469, + 460, + 509 + ], + "lines": [ + { + "bbox": [ + 150, + 469, + 460, + 509 + ], + "spans": [ + { + "bbox": [ + 150, + 469, + 460, + 509 + ], + "score": 0.94, + "content": "\\nabla _ { \\theta _ { i } } J _ { i } ( \\theta _ { i } ^ { \\prime } ( \\theta ) , \\theta _ { - i } ) = g _ { 1 } - \\frac { 1 } { M } \\sum _ { i = 1 } ^ { M } g _ { i } , \\quad g _ { i } = \\nabla _ { \\theta _ { i } } J _ { i } \\left( \\theta _ { i } + \\sum _ { j = 1 } ^ { i - 1 } g _ { j } , \\theta _ { - i } , \\theta _ { p } \\right) ,", + "type": "interline_equation", + "image_path": "9b83645fcce6d614fdf1eb2be61459d1a2e7a8f2d241e0fcc3fb02392f2393a2.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 150, + 469, + 460, + 482.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 150, + 482.3333333333333, + 460, + 495.66666666666663 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 150, + 495.66666666666663, + 460, + 508.99999999999994 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 513, + 505, + 569 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 132, + 527 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 515, + 142, + 525 + ], + "score": 0.85, + "content": "g _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 513, + 335, + 527 + ], + "score": 1.0, + "content": "denotes the ith policy gradient in the direction of", + "type": "text" + }, + { + "bbox": [ + 335, + 514, + 345, + 525 + ], + "score": 0.88, + "content": "J _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 513, + 505, + 527 + ], + "score": 1.0, + "content": ". In practice, we scale this meta-learning", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 523, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 228, + 538 + ], + "score": 1.0, + "content": "term with the hyperparameter", + "type": "text" + }, + { + "bbox": [ + 229, + 525, + 236, + 536 + ], + "score": 0.85, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 523, + 249, + 538 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 249, + 525, + 277, + 536 + ], + "score": 0.91, + "content": "\\beta < 1", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 523, + 505, + 538 + ], + "score": 1.0, + "content": "incorporates a helpful inductive bias where maximizing", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 535, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 104, + 535, + 506, + 549 + ], + "score": 1.0, + "content": "agent reward leads to local maxima. We can alternatively apply this gradient update periodically, to", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 545, + 506, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 154, + 560 + ], + "score": 1.0, + "content": "both mimic", + "type": "text" + }, + { + "bbox": [ + 155, + 547, + 181, + 558 + ], + "score": 0.92, + "content": "\\beta < 1", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 545, + 506, + 560 + ], + "score": 1.0, + "content": "and reduce computation overhead. First-order meta-learning approximations are", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 558, + 468, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 444, + 570 + ], + "score": 1.0, + "content": "known to be empirically effective, and are necessary for ERMAS to efficiently solve", + "type": "text" + }, + { + "bbox": [ + 445, + 558, + 465, + 569 + ], + "score": 0.33, + "content": "\\operatorname { E q } 8", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 558, + 468, + 570 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 581, + 505, + 626 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 436, + 594 + ], + "score": 1.0, + "content": "ERMAS By solving the dual problem (Eq. 8), ERMAS yields robustness to", + "type": "text" + }, + { + "bbox": [ + 437, + 584, + 442, + 591 + ], + "score": 0.65, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "-equilibria and,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 592, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 506, + 605 + ], + "score": 1.0, + "content": "equivalently, uncertainty in agent objectives. ERMAS solves the dual problem by combining trust", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 604, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 615 + ], + "score": 1.0, + "content": "regions and meta-learning techniques to estimate and differentiate agent regret. Algorithm 1 and 2", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 614, + 496, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 496, + 628 + ], + "score": 1.0, + "content": "(Appendix A.1) describe an efficient implementation of this procedure for nested policy learning.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33.5 + }, + { + "type": "title", + "bbox": [ + 107, + 641, + 441, + 655 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 443, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 443, + 657 + ], + "score": 1.0, + "content": "4 EXPERIMENTAL VALIDATION IN MULTI-AGENT SIMULATIONS", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "title", + "bbox": [ + 106, + 666, + 383, + 678 + ], + "lines": [ + { + "bbox": [ + 105, + 666, + 384, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 384, + 680 + ], + "score": 1.0, + "content": "4.1 ERMAS SOLVES THE INNER LOOP: AG E N T-AD V-SE A R C H", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "score": 1.0, + "content": "Constrained Repeated Bimatrix Game We analyze the agent behaviors learned by", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Agent-Adv-Search in experiments depicted in Figure 2. These experiments apply ERMAS", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "to the classic repeated bimatrix game, which is well-studied in the game theory literature as its Nash", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 721, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 506, + 734 + ], + "score": 1.0, + "content": "equilibria can be solved efficiently. At each timestep, a row player (Agent 1) and column player", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39.5 + } + ], + "page_idx": 4, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 306, + 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": [ + 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": [ + 107, + 81, + 501, + 188 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 81, + 501, + 188 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 81, + 501, + 188 + ], + "spans": [ + { + "bbox": [ + 107, + 81, + 501, + 188 + ], + "score": 0.965, + "type": "image", + "image_path": "5274686511e733fa2839aabccf052df3ff70f75bf3ce8cab833d5bae3e220e22.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 81, + 501, + 116.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 116.66666666666666, + 501, + 152.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 152.33333333333331, + 501, + 187.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 198, + 505, + 309 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 199, + 505, + 210 + ], + "spans": [ + { + "bbox": [ + 106, + 199, + 505, + 210 + ], + "score": 1.0, + "content": "Figure 2: Validating ERMAS Agent-Adv-Search in constrained repeated bimatrix games. Each", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "point in the above scatter plots describes the average outcome at the end of training for the agents", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 110, + 233 + ], + "score": 1.0, + "content": "(", + "type": "text" + }, + { + "bbox": [ + 110, + 222, + 117, + 230 + ], + "score": 0.67, + "content": "\\scriptstyle { \\dot { x } }", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 220, + 233, + 233 + ], + "score": 1.0, + "content": "-coordinate) and the planner (", + "type": "text" + }, + { + "bbox": [ + 233, + 222, + 240, + 232 + ], + "score": 0.74, + "content": "y", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "-coordinate). Error bars indicate standard deviation. (Left) The bi-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 232, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 505, + 243 + ], + "score": 1.0, + "content": "matrix reward structure encodes a social dilemma featuring a low-agent-reward/high-planner-reward", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 506, + 255 + ], + "score": 1.0, + "content": "Nash equilibrium, which is where vanilla MARL converges. Agents trained with ERMAS deviate", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "score": 1.0, + "content": "from this equilibrium in order to reduce planner reward. \u000f governs the extent of the allowable de-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 264, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 197, + 277 + ], + "score": 1.0, + "content": "viation. (Middle) As", + "type": "text" + }, + { + "bbox": [ + 197, + 266, + 204, + 274 + ], + "score": 0.59, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 264, + 506, + 277 + ], + "score": 1.0, + "content": "increases, the average per-timestep regret experienced by the agents also", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 288 + ], + "score": 1.0, + "content": "increases. Each average is taken over the final 12 episodes after rewards have converged. (Right)", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 286, + 505, + 299 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 195, + 299 + ], + "score": 1.0, + "content": "Using fixed values of", + "type": "text" + }, + { + "bbox": [ + 196, + 286, + 203, + 296 + ], + "score": 0.77, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 286, + 505, + 299 + ], + "score": 1.0, + "content": "(rather than allowing it to update, as in the full algorithm) distorts perfor-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 298, + 468, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 312, + 308 + ], + "score": 1.0, + "content": "mance and prevents agents from reaching the same", + "type": "text" + }, + { + "bbox": [ + 312, + 299, + 317, + 307 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 298, + 457, + 308 + ], + "score": 1.0, + "content": "-equilibria discovered with learned", + "type": "text" + }, + { + "bbox": [ + 457, + 298, + 464, + 307 + ], + "score": 0.74, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 298, + 468, + 308 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 7.5 + } + ], + "index": 4.25 + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 505, + 386 + ], + "lines": [ + { + "bbox": [ + 106, + 330, + 505, + 342 + ], + "spans": [ + { + "bbox": [ + 106, + 330, + 134, + 342 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 331, + 162, + 342 + ], + "score": 0.9, + "content": "\\eta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 330, + 353, + 342 + ], + "score": 1.0, + "content": "defines the size of the trust region. For small", + "type": "text" + }, + { + "bbox": [ + 354, + 333, + 360, + 342 + ], + "score": 0.71, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 361, + 330, + 505, + 342 + ], + "score": 1.0, + "content": ", algorithms such as TRPO (Schul-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 340, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 105, + 340, + 450, + 354 + ], + "score": 1.0, + "content": "man et al., 2017) can be used to efficiently approximate optimal local deviations of", + "type": "text" + }, + { + "bbox": [ + 451, + 343, + 461, + 352 + ], + "score": 0.83, + "content": "\\pi _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 340, + 505, + 354 + ], + "score": 1.0, + "content": ", affording", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 352, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 105, + 352, + 227, + 365 + ], + "score": 1.0, + "content": "reasonable approximations of", + "type": "text" + }, + { + "bbox": [ + 228, + 352, + 290, + 365 + ], + "score": 0.93, + "content": "J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 352, + 505, + 365 + ], + "score": 1.0, + "content": ". Note that our usage of trust region algorithms is not", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 106, + 363, + 505, + 376 + ], + "score": 1.0, + "content": "for optimization purposes. ERMAS requires the use of trust region optimization to ensure that the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 374, + 497, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 374, + 497, + 387 + ], + "score": 1.0, + "content": "equilibria considered by ERMAS are limited to a local neighborhood of the policy space (Eq 11).", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 330, + 505, + 387 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 397, + 505, + 464 + ], + "lines": [ + { + "bbox": [ + 105, + 397, + 505, + 410 + ], + "spans": [ + { + "bbox": [ + 105, + 397, + 505, + 410 + ], + "score": 1.0, + "content": "First-Order Meta Learning Approximation The full gradient in Equation 9 is also complicated", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 409, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 316, + 421 + ], + "score": 1.0, + "content": "by the need to estimate the derivative of local regret", + "type": "text" + }, + { + "bbox": [ + 316, + 409, + 431, + 421 + ], + "score": 0.89, + "content": "\\nabla _ { \\boldsymbol { \\theta } _ { i } } \\left[ J _ { i } ( \\boldsymbol { \\theta } _ { i } ^ { \\prime } ( \\boldsymbol { \\theta } ) , \\boldsymbol { \\theta } _ { - i } ) - J _ { i } ( \\boldsymbol { \\theta } ) \\right]", + "type": "inline_equation" + }, + { + "bbox": [ + 432, + 409, + 505, + 421 + ], + "score": 1.0, + "content": ". The second term", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 420, + 506, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 506, + 433 + ], + "score": 1.0, + "content": "maximizes the performance of the agent’s policy and is simply found with policy gradient. The first", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 430, + 506, + 444 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 506, + 444 + ], + "score": 1.0, + "content": "term is less straightforward: it minimizes the performance of the best agent policy in the current trust", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 441, + 506, + 455 + ], + "spans": [ + { + "bbox": [ + 104, + 441, + 506, + 455 + ], + "score": 1.0, + "content": "region. We note that this first term corresponds to a meta-learning gradient. We follow REPTILE", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 452, + 482, + 465 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 355, + 465 + ], + "score": 1.0, + "content": "(Nichol et al., 2018) to obtain a first-order approximation of a", + "type": "text" + }, + { + "bbox": [ + 355, + 453, + 367, + 462 + ], + "score": 0.81, + "content": "M", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 452, + 482, + 465 + ], + "score": 1.0, + "content": "-step meta-learning gradient:", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 20.5, + "bbox_fs": [ + 104, + 397, + 506, + 465 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 150, + 469, + 460, + 509 + ], + "lines": [ + { + "bbox": [ + 150, + 469, + 460, + 509 + ], + "spans": [ + { + "bbox": [ + 150, + 469, + 460, + 509 + ], + "score": 0.94, + "content": "\\nabla _ { \\theta _ { i } } J _ { i } ( \\theta _ { i } ^ { \\prime } ( \\theta ) , \\theta _ { - i } ) = g _ { 1 } - \\frac { 1 } { M } \\sum _ { i = 1 } ^ { M } g _ { i } , \\quad g _ { i } = \\nabla _ { \\theta _ { i } } J _ { i } \\left( \\theta _ { i } + \\sum _ { j = 1 } ^ { i - 1 } g _ { j } , \\theta _ { - i } , \\theta _ { p } \\right) ,", + "type": "interline_equation", + "image_path": "9b83645fcce6d614fdf1eb2be61459d1a2e7a8f2d241e0fcc3fb02392f2393a2.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 150, + 469, + 460, + 482.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 150, + 482.3333333333333, + 460, + 495.66666666666663 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 150, + 495.66666666666663, + 460, + 508.99999999999994 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 513, + 505, + 569 + ], + "lines": [ + { + "bbox": [ + 105, + 513, + 505, + 527 + ], + "spans": [ + { + "bbox": [ + 105, + 513, + 132, + 527 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 515, + 142, + 525 + ], + "score": 0.85, + "content": "g _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 513, + 335, + 527 + ], + "score": 1.0, + "content": "denotes the ith policy gradient in the direction of", + "type": "text" + }, + { + "bbox": [ + 335, + 514, + 345, + 525 + ], + "score": 0.88, + "content": "J _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 513, + 505, + 527 + ], + "score": 1.0, + "content": ". In practice, we scale this meta-learning", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 523, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 228, + 538 + ], + "score": 1.0, + "content": "term with the hyperparameter", + "type": "text" + }, + { + "bbox": [ + 229, + 525, + 236, + 536 + ], + "score": 0.85, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 237, + 523, + 249, + 538 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 249, + 525, + 277, + 536 + ], + "score": 0.91, + "content": "\\beta < 1", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 523, + 505, + 538 + ], + "score": 1.0, + "content": "incorporates a helpful inductive bias where maximizing", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 104, + 535, + 506, + 549 + ], + "spans": [ + { + "bbox": [ + 104, + 535, + 506, + 549 + ], + "score": 1.0, + "content": "agent reward leads to local maxima. We can alternatively apply this gradient update periodically, to", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 545, + 506, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 154, + 560 + ], + "score": 1.0, + "content": "both mimic", + "type": "text" + }, + { + "bbox": [ + 155, + 547, + 181, + 558 + ], + "score": 0.92, + "content": "\\beta < 1", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 545, + 506, + 560 + ], + "score": 1.0, + "content": "and reduce computation overhead. First-order meta-learning approximations are", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 558, + 468, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 558, + 444, + 570 + ], + "score": 1.0, + "content": "known to be empirically effective, and are necessary for ERMAS to efficiently solve", + "type": "text" + }, + { + "bbox": [ + 445, + 558, + 465, + 569 + ], + "score": 0.33, + "content": "\\operatorname { E q } 8", + "type": "inline_equation" + }, + { + "bbox": [ + 465, + 558, + 468, + 570 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 29, + "bbox_fs": [ + 104, + 513, + 506, + 570 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 581, + 505, + 626 + ], + "lines": [ + { + "bbox": [ + 105, + 581, + 505, + 594 + ], + "spans": [ + { + "bbox": [ + 105, + 581, + 436, + 594 + ], + "score": 1.0, + "content": "ERMAS By solving the dual problem (Eq. 8), ERMAS yields robustness to", + "type": "text" + }, + { + "bbox": [ + 437, + 584, + 442, + 591 + ], + "score": 0.65, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 442, + 581, + 505, + 594 + ], + "score": 1.0, + "content": "-equilibria and,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 592, + 506, + 605 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 506, + 605 + ], + "score": 1.0, + "content": "equivalently, uncertainty in agent objectives. ERMAS solves the dual problem by combining trust", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 604, + 506, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 604, + 506, + 615 + ], + "score": 1.0, + "content": "regions and meta-learning techniques to estimate and differentiate agent regret. Algorithm 1 and 2", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 614, + 496, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 614, + 496, + 628 + ], + "score": 1.0, + "content": "(Appendix A.1) describe an efficient implementation of this procedure for nested policy learning.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 581, + 506, + 628 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 641, + 441, + 655 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 443, + 657 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 443, + 657 + ], + "score": 1.0, + "content": "4 EXPERIMENTAL VALIDATION IN MULTI-AGENT SIMULATIONS", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "title", + "bbox": [ + 106, + 666, + 383, + 678 + ], + "lines": [ + { + "bbox": [ + 105, + 666, + 384, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 384, + 680 + ], + "score": 1.0, + "content": "4.1 ERMAS SOLVES THE INNER LOOP: AG E N T-AD V-SE A R C H", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 506, + 700 + ], + "score": 1.0, + "content": "Constrained Repeated Bimatrix Game We analyze the agent behaviors learned by", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Agent-Adv-Search in experiments depicted in Figure 2. These experiments apply ERMAS", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "to the classic repeated bimatrix game, which is well-studied in the game theory literature as its Nash", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 721, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 506, + 734 + ], + "score": 1.0, + "content": "equilibria can be solved efficiently. At each timestep, a row player (Agent 1) and column player", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 463, + 302 + ], + "score": 1.0, + "content": "(Agent 2) simultaneously choose from a finite number of actions. Each pair of actions", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 464, + 289, + 484, + 301 + ], + "score": 0.91, + "content": "( i , j )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 485, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "cor-", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 300, + 506, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 284, + 314 + ], + "score": 1.0, + "content": "responds to a pair of payoffs for the agents", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 284, + 300, + 348, + 312 + ], + "score": 0.93, + "content": "r _ { 1 } ( i , j ) , r _ { 2 } ( i , j )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 348, + 300, + 476, + 314 + ], + "score": 1.0, + "content": ". We select the payoff matrices", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 476, + 302, + 486, + 312 + ], + "score": 0.84, + "content": "r _ { 1 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 487, + 300, + 506, + 314 + ], + "score": 1.0, + "content": "and", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 117, + 322 + ], + "score": 0.83, + "content": "r _ { 2 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 117, + 311, + 505, + 324 + ], + "score": 1.0, + "content": ", illustrated in Figure 1a, so that only one Nash equilibrium exists and that the equilibrium consti-", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 323, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 505, + 335 + ], + "score": 1.0, + "content": "tutes a “tragedy-of-the-commons,” where agents selfishly optimizing their own reward leads to less", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 333, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 506, + 346 + ], + "score": 1.0, + "content": "reward overall. To extend this repeated bimatrix game into sequential decision making, we further", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 345, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 505, + 357 + ], + "score": 1.0, + "content": "constrain the game so that, at any timestep, agents can only choose an action adjacent to their action", + "type": "text", + "cross_page": true + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 356, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 368 + ], + "score": 1.0, + "content": "in the previous timestep. We also introduce a passive planner that observes the game and receives", + "type": "text", + "cross_page": true + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 366, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 104, + 366, + 142, + 378 + ], + "score": 1.0, + "content": "a payoff", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 143, + 366, + 173, + 378 + ], + "score": 0.93, + "content": "r _ { p } ( i , j )", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 173, + 366, + 506, + 378 + ], + "score": 1.0, + "content": ". The planner does not take any actions and its payoff is constructed such that its", + "type": "text", + "cross_page": true + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 376, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 104, + 376, + 506, + 390 + ], + "score": 1.0, + "content": "reward is high when the agents are at the Nash equilibrium. In effect, this toy setting allows us", + "type": "text", + "cross_page": true + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 388, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 505, + 400 + ], + "score": 1.0, + "content": "to verify that ERMAS samples realistic worst-case behaviors–that is, that Agents 1 and 2 learn to", + "type": "text", + "cross_page": true + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "score": 1.0, + "content": "deviate from their tragedy-of-commons equilibrium in order to reduce the planner’s reward but also", + "type": "text", + "cross_page": true + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 410, + 302, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 302, + 422 + ], + "score": 1.0, + "content": "without significantly increasing their own regret.", + "type": "text", + "cross_page": true + } + ], + "index": 19 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 686, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 83, + 501, + 198 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 83, + 501, + 198 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 83, + 501, + 198 + ], + "spans": [ + { + "bbox": [ + 108, + 83, + 501, + 198 + ], + "score": 0.965, + "type": "image", + "image_path": "3b722fb35f4b942fcce4910c3b2516dc8aa725874c1d244415381579289f8ea9.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 83, + 501, + 121.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 121.33333333333334, + 501, + 159.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 159.66666666666669, + 501, + 198.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 209, + 505, + 264 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 209, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 106, + 209, + 505, + 221 + ], + "score": 1.0, + "content": "Figure 3: Planner and agent rewards in the repeated bimatrix game over training time. Each line", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "represents an average over 10 seeds, with error bars indicating standard error. The lines correspond", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 298, + 244 + ], + "score": 1.0, + "content": "to runs of ERMAS and are colored according to", + "type": "text" + }, + { + "bbox": [ + 298, + 231, + 306, + 243 + ], + "score": 0.84, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 231, + 505, + 244 + ], + "score": 1.0, + "content": ", the weight of the meta-learning term of Equation", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 240, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 256 + ], + "score": 1.0, + "content": "13. (Left) Planner performance over training episodes. (Middle) Agent 1 performance over training", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 253, + 360, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 360, + 266 + ], + "score": 1.0, + "content": "episodes. (Right) Agent 2 performance over training episodes.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 289, + 505, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 463, + 302 + ], + "score": 1.0, + "content": "(Agent 2) simultaneously choose from a finite number of actions. Each pair of actions", + "type": "text" + }, + { + "bbox": [ + 464, + 289, + 484, + 301 + ], + "score": 0.91, + "content": "( i , j )", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 289, + 505, + 302 + ], + "score": 1.0, + "content": "cor-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 300, + 506, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 300, + 284, + 314 + ], + "score": 1.0, + "content": "responds to a pair of payoffs for the agents", + "type": "text" + }, + { + "bbox": [ + 284, + 300, + 348, + 312 + ], + "score": 0.93, + "content": "r _ { 1 } ( i , j ) , r _ { 2 } ( i , j )", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 300, + 476, + 314 + ], + "score": 1.0, + "content": ". We select the payoff matrices", + "type": "text" + }, + { + "bbox": [ + 476, + 302, + 486, + 312 + ], + "score": 0.84, + "content": "r _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 300, + 506, + 314 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 311, + 505, + 324 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 117, + 322 + ], + "score": 0.83, + "content": "r _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 311, + 505, + 324 + ], + "score": 1.0, + "content": ", illustrated in Figure 1a, so that only one Nash equilibrium exists and that the equilibrium consti-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 323, + 505, + 335 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 505, + 335 + ], + "score": 1.0, + "content": "tutes a “tragedy-of-the-commons,” where agents selfishly optimizing their own reward leads to less", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 333, + 506, + 346 + ], + "spans": [ + { + "bbox": [ + 105, + 333, + 506, + 346 + ], + "score": 1.0, + "content": "reward overall. To extend this repeated bimatrix game into sequential decision making, we further", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 345, + 505, + 357 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 505, + 357 + ], + "score": 1.0, + "content": "constrain the game so that, at any timestep, agents can only choose an action adjacent to their action", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 356, + 505, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 368 + ], + "score": 1.0, + "content": "in the previous timestep. We also introduce a passive planner that observes the game and receives", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 366, + 506, + 378 + ], + "spans": [ + { + "bbox": [ + 104, + 366, + 142, + 378 + ], + "score": 1.0, + "content": "a payoff", + "type": "text" + }, + { + "bbox": [ + 143, + 366, + 173, + 378 + ], + "score": 0.93, + "content": "r _ { p } ( i , j )", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 366, + 506, + 378 + ], + "score": 1.0, + "content": ". The planner does not take any actions and its payoff is constructed such that its", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 376, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 104, + 376, + 506, + 390 + ], + "score": 1.0, + "content": "reward is high when the agents are at the Nash equilibrium. In effect, this toy setting allows us", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 388, + 505, + 400 + ], + "spans": [ + { + "bbox": [ + 105, + 388, + 505, + 400 + ], + "score": 1.0, + "content": "to verify that ERMAS samples realistic worst-case behaviors–that is, that Agents 1 and 2 learn to", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 506, + 412 + ], + "score": 1.0, + "content": "deviate from their tragedy-of-commons equilibrium in order to reduce the planner’s reward but also", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 410, + 302, + 422 + ], + "spans": [ + { + "bbox": [ + 106, + 410, + 302, + 422 + ], + "score": 1.0, + "content": "without significantly increasing their own regret.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 437, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 105, + 437, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 159, + 450 + ], + "score": 1.0, + "content": "Discovering", + "type": "text" + }, + { + "bbox": [ + 160, + 439, + 165, + 447 + ], + "score": 0.6, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 437, + 505, + 450 + ], + "score": 1.0, + "content": "-Equilibria Figure 2 (left) visualizes how the equilibria reached by AI agents bal-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 448, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 312, + 461 + ], + "score": 1.0, + "content": "ance the reward of the planner (y-axis) and agents (", + "type": "text" + }, + { + "bbox": [ + 312, + 450, + 318, + 458 + ], + "score": 0.44, + "content": "\\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } = \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } .", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 448, + 506, + 461 + ], + "score": 1.0, + "content": "-axis). Conventional multi-agent RL discovers", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 459, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 472 + ], + "score": 1.0, + "content": "the Nash equilibrium, which is visualized in the top left. At this equilibrium, the agents do not", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 384, + 482 + ], + "score": 1.0, + "content": "cooperate and the planner receives high reward. For small values of", + "type": "text" + }, + { + "bbox": [ + 384, + 472, + 390, + 480 + ], + "score": 0.62, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 470, + 505, + 482 + ], + "score": 1.0, + "content": ", ERMAS also discovers the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 480, + 505, + 494 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 218, + 494 + ], + "score": 1.0, + "content": "Nash equilibrium. Because", + "type": "text" + }, + { + "bbox": [ + 218, + 483, + 224, + 491 + ], + "score": 0.51, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 480, + 433, + 494 + ], + "score": 1.0, + "content": "acts as a constraint on agent regret, larger values of", + "type": "text" + }, + { + "bbox": [ + 433, + 483, + 439, + 491 + ], + "score": 0.56, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 480, + 505, + 494 + ], + "score": 1.0, + "content": "enable ERMAS", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 492, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 336, + 505 + ], + "score": 1.0, + "content": "to deviate farther from the Nash equilibrium, discovering", + "type": "text" + }, + { + "bbox": [ + 337, + 494, + 342, + 502 + ], + "score": 0.65, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 492, + 506, + 505 + ], + "score": 1.0, + "content": "-equilibria to the bottom-right that result", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "score": 1.0, + "content": "in lower planner rewards. Deviations from a Nash equilibrium are associated with higher regret,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 514, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 269, + 526 + ], + "score": 1.0, + "content": "meaning that regret should increase with", + "type": "text" + }, + { + "bbox": [ + 269, + 516, + 275, + 524 + ], + "score": 0.26, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 514, + 505, + 526 + ], + "score": 1.0, + "content": ". Figure 2 (middle) clearly demonstrates that ERMAS im-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 104, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "parts this trend. As described by Equation 7, this display of adversarial behavior is key to learning a", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 536, + 191, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 191, + 549 + ], + "score": 1.0, + "content": "more robust planner.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 24.5 + }, + { + "type": "title", + "bbox": [ + 107, + 564, + 359, + 575 + ], + "lines": [ + { + "bbox": [ + 106, + 564, + 360, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 360, + 577 + ], + "score": 1.0, + "content": "4.2 ALL THE COMPONENTS OF ERMAS ARE NECESSARY", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 586, + 505, + 696 + ], + "lines": [ + { + "bbox": [ + 106, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 586, + 286, + 599 + ], + "score": 1.0, + "content": "Dynamic or Frozen Lagrange multipliers", + "type": "text" + }, + { + "bbox": [ + 286, + 587, + 297, + 597 + ], + "score": 0.87, + "content": "\\lambda _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 586, + 410, + 599 + ], + "score": 1.0, + "content": "The Lagrange multipliers", + "type": "text" + }, + { + "bbox": [ + 411, + 587, + 419, + 596 + ], + "score": 0.62, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 586, + 505, + 599 + ], + "score": 1.0, + "content": "balance the dual ob-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 597, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 506, + 610 + ], + "score": 1.0, + "content": "jectives of seeking stable agent equilibria and minimizing the planner’s reward. Recall that smaller", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 608, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 145, + 621 + ], + "score": 1.0, + "content": "values of", + "type": "text" + }, + { + "bbox": [ + 145, + 609, + 152, + 618 + ], + "score": 0.74, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 608, + 352, + 621 + ], + "score": 1.0, + "content": "mean agent objectives are more antagonistic. The", + "type": "text" + }, + { + "bbox": [ + 352, + 609, + 360, + 618 + ], + "score": 0.67, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 608, + 506, + 621 + ], + "score": 1.0, + "content": "are updated using local estimates of", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "agent regret, as described in Equation 8. We can validate that these updates are necessary by analyz-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 280, + 643 + ], + "score": 1.0, + "content": "ing the equilibria learned by ERMAS when", + "type": "text" + }, + { + "bbox": [ + 281, + 631, + 289, + 640 + ], + "score": 0.53, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 630, + 425, + 643 + ], + "score": 1.0, + "content": "are not updated. Fixing a value of", + "type": "text" + }, + { + "bbox": [ + 425, + 631, + 433, + 640 + ], + "score": 0.61, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 630, + 505, + 643 + ], + "score": 1.0, + "content": "reduces Equation", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 641, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 505, + 654 + ], + "score": 1.0, + "content": "8 to learning with shared rewards. Figure 2 (right) visualizes the equilibria discovered with frozen", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 651, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 115, + 662 + ], + "score": 0.72, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 651, + 452, + 664 + ], + "score": 1.0, + "content": "in the same format as the Figure 2 (left) plot. This visualization shows that freezing", + "type": "text" + }, + { + "bbox": [ + 452, + 653, + 460, + 662 + ], + "score": 0.65, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 651, + 506, + 664 + ], + "score": 1.0, + "content": "affects the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 662, + 506, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 425, + 675 + ], + "score": 1.0, + "content": "equilibria discovered by ERMAS; the bottom right quadrant which contains the", + "type": "text" + }, + { + "bbox": [ + 425, + 665, + 431, + 673 + ], + "score": 0.65, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 662, + 506, + 675 + ], + "score": 1.0, + "content": "-equilibria discov-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 674, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 183, + 687 + ], + "score": 1.0, + "content": "ered with dynamic", + "type": "text" + }, + { + "bbox": [ + 183, + 675, + 191, + 684 + ], + "score": 0.75, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 674, + 325, + 687 + ], + "score": 1.0, + "content": "are not reached for any values of", + "type": "text" + }, + { + "bbox": [ + 325, + 675, + 332, + 684 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 674, + 442, + 687 + ], + "score": 1.0, + "content": ". This validates that certain", + "type": "text" + }, + { + "bbox": [ + 442, + 676, + 448, + 684 + ], + "score": 0.58, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 674, + 506, + 687 + ], + "score": 1.0, + "content": "-equilibria are", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 684, + 482, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 224, + 697 + ], + "score": 1.0, + "content": "only reachable with dynamic", + "type": "text" + }, + { + "bbox": [ + 225, + 685, + 232, + 695 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 684, + 482, + 697 + ], + "score": 1.0, + "content": "and hence the updates in 8 are necessary for proper behavior.4", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 35.5 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 115, + 721, + 495, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 719, + 496, + 734 + ], + "spans": [ + { + "bbox": [ + 118, + 719, + 292, + 734 + ], + "score": 1.0, + "content": "4However, we recommend temporarily freezing", + "type": "text" + }, + { + "bbox": [ + 293, + 723, + 298, + 730 + ], + "score": 0.81, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 719, + 496, + 734 + ], + "score": 1.0, + "content": "at the top of Algorithm 2 to “warm up” agent policies.", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 108, + 27, + 306, + 37 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 308, + 39 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 308, + 39 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "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": "image", + "bbox": [ + 108, + 83, + 501, + 198 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 83, + 501, + 198 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 83, + 501, + 198 + ], + "spans": [ + { + "bbox": [ + 108, + 83, + 501, + 198 + ], + "score": 0.965, + "type": "image", + "image_path": "3b722fb35f4b942fcce4910c3b2516dc8aa725874c1d244415381579289f8ea9.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 83, + 501, + 121.33333333333334 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 121.33333333333334, + 501, + 159.66666666666669 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 159.66666666666669, + 501, + 198.00000000000003 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 209, + 505, + 264 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 209, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 106, + 209, + 505, + 221 + ], + "score": 1.0, + "content": "Figure 3: Planner and agent rewards in the repeated bimatrix game over training time. Each line", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "represents an average over 10 seeds, with error bars indicating standard error. The lines correspond", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 298, + 244 + ], + "score": 1.0, + "content": "to runs of ERMAS and are colored according to", + "type": "text" + }, + { + "bbox": [ + 298, + 231, + 306, + 243 + ], + "score": 0.84, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 231, + 505, + 244 + ], + "score": 1.0, + "content": ", the weight of the meta-learning term of Equation", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 240, + 505, + 256 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 256 + ], + "score": 1.0, + "content": "13. (Left) Planner performance over training episodes. (Middle) Agent 1 performance over training", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 253, + 360, + 266 + ], + "spans": [ + { + "bbox": [ + 106, + 253, + 360, + 266 + ], + "score": 1.0, + "content": "episodes. (Right) Agent 2 performance over training episodes.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 289, + 505, + 421 + ], + "lines": [], + "index": 13.5, + "bbox_fs": [ + 104, + 289, + 506, + 422 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 437, + 505, + 547 + ], + "lines": [ + { + "bbox": [ + 105, + 437, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 159, + 450 + ], + "score": 1.0, + "content": "Discovering", + "type": "text" + }, + { + "bbox": [ + 160, + 439, + 165, + 447 + ], + "score": 0.6, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 437, + 505, + 450 + ], + "score": 1.0, + "content": "-Equilibria Figure 2 (left) visualizes how the equilibria reached by AI agents bal-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 448, + 506, + 461 + ], + "spans": [ + { + "bbox": [ + 105, + 448, + 312, + 461 + ], + "score": 1.0, + "content": "ance the reward of the planner (y-axis) and agents (", + "type": "text" + }, + { + "bbox": [ + 312, + 450, + 318, + 458 + ], + "score": 0.44, + "content": "\\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } = \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } .", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 448, + 506, + 461 + ], + "score": 1.0, + "content": "-axis). Conventional multi-agent RL discovers", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 459, + 506, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 506, + 472 + ], + "score": 1.0, + "content": "the Nash equilibrium, which is visualized in the top left. At this equilibrium, the agents do not", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 470, + 505, + 482 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 384, + 482 + ], + "score": 1.0, + "content": "cooperate and the planner receives high reward. For small values of", + "type": "text" + }, + { + "bbox": [ + 384, + 472, + 390, + 480 + ], + "score": 0.62, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 470, + 505, + 482 + ], + "score": 1.0, + "content": ", ERMAS also discovers the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 480, + 505, + 494 + ], + "spans": [ + { + "bbox": [ + 105, + 480, + 218, + 494 + ], + "score": 1.0, + "content": "Nash equilibrium. Because", + "type": "text" + }, + { + "bbox": [ + 218, + 483, + 224, + 491 + ], + "score": 0.51, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 480, + 433, + 494 + ], + "score": 1.0, + "content": "acts as a constraint on agent regret, larger values of", + "type": "text" + }, + { + "bbox": [ + 433, + 483, + 439, + 491 + ], + "score": 0.56, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 480, + 505, + 494 + ], + "score": 1.0, + "content": "enable ERMAS", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 492, + 506, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 492, + 336, + 505 + ], + "score": 1.0, + "content": "to deviate farther from the Nash equilibrium, discovering", + "type": "text" + }, + { + "bbox": [ + 337, + 494, + 342, + 502 + ], + "score": 0.65, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 492, + 506, + 505 + ], + "score": 1.0, + "content": "-equilibria to the bottom-right that result", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 505, + 516 + ], + "score": 1.0, + "content": "in lower planner rewards. Deviations from a Nash equilibrium are associated with higher regret,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 514, + 505, + 526 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 269, + 526 + ], + "score": 1.0, + "content": "meaning that regret should increase with", + "type": "text" + }, + { + "bbox": [ + 269, + 516, + 275, + 524 + ], + "score": 0.26, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 514, + 505, + 526 + ], + "score": 1.0, + "content": ". Figure 2 (middle) clearly demonstrates that ERMAS im-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 104, + 524, + 506, + 538 + ], + "score": 1.0, + "content": "parts this trend. As described by Equation 7, this display of adversarial behavior is key to learning a", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 536, + 191, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 191, + 549 + ], + "score": 1.0, + "content": "more robust planner.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 24.5, + "bbox_fs": [ + 104, + 437, + 506, + 549 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 564, + 359, + 575 + ], + "lines": [ + { + "bbox": [ + 106, + 564, + 360, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 564, + 360, + 577 + ], + "score": 1.0, + "content": "4.2 ALL THE COMPONENTS OF ERMAS ARE NECESSARY", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 106, + 586, + 505, + 696 + ], + "lines": [ + { + "bbox": [ + 106, + 586, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 586, + 286, + 599 + ], + "score": 1.0, + "content": "Dynamic or Frozen Lagrange multipliers", + "type": "text" + }, + { + "bbox": [ + 286, + 587, + 297, + 597 + ], + "score": 0.87, + "content": "\\lambda _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 586, + 410, + 599 + ], + "score": 1.0, + "content": "The Lagrange multipliers", + "type": "text" + }, + { + "bbox": [ + 411, + 587, + 419, + 596 + ], + "score": 0.62, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 419, + 586, + 505, + 599 + ], + "score": 1.0, + "content": "balance the dual ob-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 597, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 506, + 610 + ], + "score": 1.0, + "content": "jectives of seeking stable agent equilibria and minimizing the planner’s reward. Recall that smaller", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 608, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 145, + 621 + ], + "score": 1.0, + "content": "values of", + "type": "text" + }, + { + "bbox": [ + 145, + 609, + 152, + 618 + ], + "score": 0.74, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 608, + 352, + 621 + ], + "score": 1.0, + "content": "mean agent objectives are more antagonistic. The", + "type": "text" + }, + { + "bbox": [ + 352, + 609, + 360, + 618 + ], + "score": 0.67, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 608, + 506, + 621 + ], + "score": 1.0, + "content": "are updated using local estimates of", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "agent regret, as described in Equation 8. We can validate that these updates are necessary by analyz-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 630, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 105, + 630, + 280, + 643 + ], + "score": 1.0, + "content": "ing the equilibria learned by ERMAS when", + "type": "text" + }, + { + "bbox": [ + 281, + 631, + 289, + 640 + ], + "score": 0.53, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 630, + 425, + 643 + ], + "score": 1.0, + "content": "are not updated. Fixing a value of", + "type": "text" + }, + { + "bbox": [ + 425, + 631, + 433, + 640 + ], + "score": 0.61, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 630, + 505, + 643 + ], + "score": 1.0, + "content": "reduces Equation", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 641, + 505, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 505, + 654 + ], + "score": 1.0, + "content": "8 to learning with shared rewards. Figure 2 (right) visualizes the equilibria discovered with frozen", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 651, + 506, + 664 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 115, + 662 + ], + "score": 0.72, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 651, + 452, + 664 + ], + "score": 1.0, + "content": "in the same format as the Figure 2 (left) plot. This visualization shows that freezing", + "type": "text" + }, + { + "bbox": [ + 452, + 653, + 460, + 662 + ], + "score": 0.65, + "content": "\\boldsymbol { \\lambda }", + "type": "inline_equation" + }, + { + "bbox": [ + 461, + 651, + 506, + 664 + ], + "score": 1.0, + "content": "affects the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 662, + 506, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 425, + 675 + ], + "score": 1.0, + "content": "equilibria discovered by ERMAS; the bottom right quadrant which contains the", + "type": "text" + }, + { + "bbox": [ + 425, + 665, + 431, + 673 + ], + "score": 0.65, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 662, + 506, + 675 + ], + "score": 1.0, + "content": "-equilibria discov-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 674, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 674, + 183, + 687 + ], + "score": 1.0, + "content": "ered with dynamic", + "type": "text" + }, + { + "bbox": [ + 183, + 675, + 191, + 684 + ], + "score": 0.75, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 191, + 674, + 325, + 687 + ], + "score": 1.0, + "content": "are not reached for any values of", + "type": "text" + }, + { + "bbox": [ + 325, + 675, + 332, + 684 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 674, + 442, + 687 + ], + "score": 1.0, + "content": ". This validates that certain", + "type": "text" + }, + { + "bbox": [ + 442, + 676, + 448, + 684 + ], + "score": 0.58, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 674, + 506, + 687 + ], + "score": 1.0, + "content": "-equilibria are", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 684, + 482, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 224, + 697 + ], + "score": 1.0, + "content": "only reachable with dynamic", + "type": "text" + }, + { + "bbox": [ + 225, + 685, + 232, + 695 + ], + "score": 0.79, + "content": "\\lambda", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 684, + 482, + 697 + ], + "score": 1.0, + "content": "and hence the updates in 8 are necessary for proper behavior.4", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 586, + 506, + 697 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 82, + 502, + 181 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 82, + 502, + 181 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 82, + 502, + 181 + ], + "spans": [ + { + "bbox": [ + 108, + 82, + 502, + 181 + ], + "score": 0.932, + "type": "image", + "image_path": "f26691b56531ed2956c8a36b1b9e767d39ff089799c7e9a988f5a0f6b8b0d54c.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 82, + 502, + 115.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 115.0, + 502, + 148.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 148.0, + 502, + 181.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 192, + 505, + 247 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 192, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 505, + 204 + ], + "score": 1.0, + "content": "Figure 4: Robust planner learning in the repeated bimatrix game. Average planner performance as", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 202, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 304, + 216 + ], + "score": 1.0, + "content": "a function of the reward perturbation coefficient", + "type": "text" + }, + { + "bbox": [ + 304, + 203, + 313, + 215 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 202, + 505, + 216 + ], + "score": 1.0, + "content": "in the test environment. Each point represents", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 214, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 505, + 226 + ], + "score": 1.0, + "content": "an average over 5 seeds, with error bars indicating standard error. Vertical dashed lines denote the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 225, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 192, + 238 + ], + "score": 1.0, + "content": "training environment", + "type": "text" + }, + { + "bbox": [ + 192, + 225, + 201, + 236 + ], + "score": 0.77, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 225, + 505, + 238 + ], + "score": 1.0, + "content": ". (Left) Average planner performance at convergence. (Right) Performance", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 236, + 452, + 248 + ], + "spans": [ + { + "bbox": [ + 106, + 236, + 452, + 248 + ], + "score": 1.0, + "content": "relative to the vanilla MARL baseline, which is trained without a robustness objective.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 106, + 271, + 505, + 371 + ], + "lines": [ + { + "bbox": [ + 106, + 271, + 504, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 504, + 284 + ], + "score": 1.0, + "content": "First-order Approximation Using the first order approximation of Equation 13 might slow learn-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 281, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 104, + 281, + 506, + 297 + ], + "score": 1.0, + "content": "ing, since we step “away” from the direction that the standard policy gradient suggests. In contrast,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 293, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 505, + 307 + ], + "score": 1.0, + "content": "we find that the ERMAS update can significantly speed up convergence. Figure 3 depicts the learn-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 303, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 329, + 318 + ], + "score": 1.0, + "content": "ing curve of variants of ERMAS with varying weights,", + "type": "text" + }, + { + "bbox": [ + 329, + 305, + 337, + 316 + ], + "score": 0.82, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 303, + 506, + 318 + ], + "score": 1.0, + "content": ", on the meta-learning term. For instance,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 315, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 131, + 329 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 131, + 316, + 160, + 327 + ], + "score": 0.91, + "content": "\\beta = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 315, + 506, + 329 + ], + "score": 1.0, + "content": ", the meta-learning term is completely dropped. We find that lines corresponding to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 327, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 170, + 339 + ], + "score": 1.0, + "content": "larger values of", + "type": "text" + }, + { + "bbox": [ + 170, + 327, + 178, + 338 + ], + "score": 0.86, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 327, + 505, + 339 + ], + "score": 1.0, + "content": "reach improved agent rewards half an order of magnitude faster than lower values", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 336, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 117, + 350 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 338, + 124, + 349 + ], + "score": 0.82, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 125, + 336, + 231, + 350 + ], + "score": 1.0, + "content": ". However, larger values of", + "type": "text" + }, + { + "bbox": [ + 231, + 338, + 239, + 349 + ], + "score": 0.85, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 336, + 423, + 350 + ], + "score": 1.0, + "content": "fail to reach the desirable region of adversarial", + "type": "text" + }, + { + "bbox": [ + 424, + 339, + 429, + 347 + ], + "score": 0.59, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 336, + 505, + 350 + ], + "score": 1.0, + "content": "-equilibria. In both", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 347, + 506, + 363 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 178, + 363 + ], + "score": 1.0, + "content": "cases, very large", + "type": "text" + }, + { + "bbox": [ + 178, + 348, + 212, + 361 + ], + "score": 0.89, + "content": "\\begin{array} { r } { ( \\bar { \\beta } > \\frac { 1 } { N } , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 347, + 280, + 363 + ], + "score": 1.0, + "content": ") and very small", + "type": "text" + }, + { + "bbox": [ + 281, + 348, + 310, + 360 + ], + "score": 0.86, + "content": "( \\beta \\sim 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 347, + 506, + 363 + ], + "score": 1.0, + "content": "fail to fully reach and remain at the adversarial", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 275, + 372 + ], + "score": 1.0, + "content": "region. However, an appropriate range for", + "type": "text" + }, + { + "bbox": [ + 275, + 360, + 283, + 371 + ], + "score": 0.86, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "gives rapid convergence and good asymptotic behavior.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12 + }, + { + "type": "title", + "bbox": [ + 107, + 387, + 370, + 398 + ], + "lines": [ + { + "bbox": [ + 106, + 386, + 371, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 386, + 371, + 399 + ], + "score": 1.0, + "content": "4.3 SOLVING PL A N N E R-OPT USING AG E N T-AD V-SE A R C H", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 408, + 505, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 409, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 284, + 420 + ], + "score": 1.0, + "content": "We now show that ERMAS yields planners", + "type": "text" + }, + { + "bbox": [ + 284, + 411, + 295, + 421 + ], + "score": 0.87, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 409, + 505, + 420 + ], + "score": 1.0, + "content": "which are more robust to uncertainty in the agent’s", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 420, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 431 + ], + "score": 1.0, + "content": "reward function. Specifically, we empirically validate that ERMAS can find strong solutions to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 431, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 505, + 443 + ], + "score": 1.0, + "content": "the nested optimization problems Agent-Adv-Search and Planner-OPT, in two simulations:", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 441, + 374, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 374, + 454 + ], + "score": 1.0, + "content": "repeated bimatrix games and economic simulations (see Figure 1).", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "text", + "bbox": [ + 106, + 468, + 505, + 545 + ], + "lines": [ + { + "bbox": [ + 106, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "Evaluation Workflow To measure planner robustness, we evaluate trained planners in test envi-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 479, + 504, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 504, + 491 + ], + "score": 1.0, + "content": "ronments with a reality gap (i.e. reward parameterizations that differ from the training environment),", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "score": 1.0, + "content": "containing test agents that are optimized for the test environment’s reward functions and that have", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 502, + 504, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 504, + 513 + ], + "score": 1.0, + "content": "not been seen by the planner. We proceed as follows: 1) Train the agents and planner with ERMAS.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 512, + 504, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 504, + 524 + ], + "score": 1.0, + "content": "2) Fix the planner and transfer it to a test environment, then train new agents from scratch in the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 523, + 505, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 505, + 536 + ], + "score": 1.0, + "content": "test environment with reward functions unseen by the planner. 3) Report the value of the planner", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 534, + 294, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 294, + 546 + ], + "score": 1.0, + "content": "objective after the new agents have converged.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 504, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 560, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 573 + ], + "score": 1.0, + "content": "Augmented Repeated Bimatrix Games We now extend the bimatrix game to a nested reinforce-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 571, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 583 + ], + "score": 1.0, + "content": "ment learning problem by allowing the planner to take actions and influence its own experienced re-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 270, + 595 + ], + "score": 1.0, + "content": "ward. The planner now selects an integer", + "type": "text" + }, + { + "bbox": [ + 270, + 583, + 295, + 593 + ], + "score": 0.92, + "content": "a \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 582, + 447, + 595 + ], + "score": 1.0, + "content": "that modifies its new reward function:", + "type": "text" + }, + { + "bbox": [ + 447, + 582, + 501, + 594 + ], + "score": 0.92, + "content": "\\bar { a r } _ { p } ( i , j ) - a ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 582, + 505, + 595 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 592, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 290, + 607 + ], + "score": 1.0, + "content": "This function is chosen for its quadratic form:", + "type": "text" + }, + { + "bbox": [ + 290, + 596, + 297, + 604 + ], + "score": 0.69, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 592, + 427, + 607 + ], + "score": 1.0, + "content": "scales the reward but adds a cost", + "type": "text" + }, + { + "bbox": [ + 428, + 594, + 439, + 604 + ], + "score": 0.86, + "content": "a ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 592, + 506, + 607 + ], + "score": 1.0, + "content": "which disincen-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 605, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 189, + 618 + ], + "score": 1.0, + "content": "tives large values of", + "type": "text" + }, + { + "bbox": [ + 189, + 607, + 195, + 615 + ], + "score": 0.64, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 605, + 416, + 618 + ], + "score": 1.0, + "content": ". Agents are modified to receive a new reward function", + "type": "text" + }, + { + "bbox": [ + 417, + 605, + 477, + 617 + ], + "score": 0.92, + "content": "r _ { i } ^ { \\prime } = r _ { i } - Q r _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 605, + 506, + 618 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 116, + 627 + ], + "score": 0.83, + "content": "r _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 615, + 270, + 630 + ], + "score": 1.0, + "content": "is their original reward function and", + "type": "text" + }, + { + "bbox": [ + 271, + 616, + 302, + 627 + ], + "score": 0.91, + "content": "Q \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "is an unknown scalar which may differ between", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 254, + 639 + ], + "score": 1.0, + "content": "training and testing environments. If", + "type": "text" + }, + { + "bbox": [ + 254, + 627, + 281, + 638 + ], + "score": 0.91, + "content": "Q = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 627, + 505, + 639 + ], + "score": 1.0, + "content": ", agents act identical to the experiments in Figure 2. For", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 638, + 488, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 247, + 650 + ], + "score": 1.0, + "content": "environments with larger values of", + "type": "text" + }, + { + "bbox": [ + 248, + 639, + 256, + 649 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 638, + 279, + 650 + ], + "score": 1.0, + "content": ", e.g.,", + "type": "text" + }, + { + "bbox": [ + 279, + 639, + 314, + 650 + ], + "score": 0.91, + "content": "Q = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 638, + 488, + 650 + ], + "score": 1.0, + "content": ", agents have an incentive to be adversarial.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 32.5 + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "Figure 4 shows the test performance of ERMAS against vanilla multi-agent RL policies learned with", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 156, + 677 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 666, + 189, + 678 + ], + "score": 1.0, + "content": "or with", + "type": "text" + }, + { + "bbox": [ + 190, + 666, + 231, + 677 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 666, + 361, + 678 + ], + "score": 1.0, + "content": ". Naturally, MARL trained with", + "type": "text" + }, + { + "bbox": [ + 361, + 666, + 411, + 677 + ], + "score": 0.9, + "content": "Q _ { \\mathrm { t r a i n } } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "underperforms MARL", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 156, + 690 + ], + "score": 1.0, + "content": "trained with", + "type": "text" + }, + { + "bbox": [ + 156, + 677, + 197, + 688 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 676, + 354, + 690 + ], + "score": 1.0, + "content": "when evaluated in environments where", + "type": "text" + }, + { + "bbox": [ + 354, + 677, + 400, + 688 + ], + "score": 0.89, + "content": "Q _ { \\mathrm { t e s t } } < 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 676, + 506, + 690 + ], + "score": 1.0, + "content": ". However, MARL trained", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 128, + 701 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 128, + 688, + 180, + 699 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 687, + 259, + 701 + ], + "score": 1.0, + "content": "outperforms when", + "type": "text" + }, + { + "bbox": [ + 259, + 688, + 309, + 699 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t e s t } } > 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 687, + 505, + 701 + ], + "score": 1.0, + "content": ". Agent-Adv-Search successfully finds the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 428, + 712 + ], + "score": 1.0, + "content": "worst-case perturbation, and yields a planner policy at least as good as MARL", + "type": "text" + }, + { + "bbox": [ + 428, + 699, + 479, + 710 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 698, + 505, + 712 + ], + "score": 1.0, + "content": ". This", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "shows that ERMAS can produce policies which are robust to uncertainty in agents’ objectives and", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 720, + 294, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 294, + 733 + ], + "score": 1.0, + "content": "is a tractable adversarial robustness algorithm.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40 + } + ], + "page_idx": 6, + "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": [ + 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": [ + 108, + 82, + 502, + 181 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 82, + 502, + 181 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 82, + 502, + 181 + ], + "spans": [ + { + "bbox": [ + 108, + 82, + 502, + 181 + ], + "score": 0.932, + "type": "image", + "image_path": "f26691b56531ed2956c8a36b1b9e767d39ff089799c7e9a988f5a0f6b8b0d54c.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 82, + 502, + 115.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 115.0, + 502, + 148.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 148.0, + 502, + 181.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 192, + 505, + 247 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 192, + 505, + 204 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 505, + 204 + ], + "score": 1.0, + "content": "Figure 4: Robust planner learning in the repeated bimatrix game. Average planner performance as", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 202, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 202, + 304, + 216 + ], + "score": 1.0, + "content": "a function of the reward perturbation coefficient", + "type": "text" + }, + { + "bbox": [ + 304, + 203, + 313, + 215 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 202, + 505, + 216 + ], + "score": 1.0, + "content": "in the test environment. Each point represents", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 214, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 505, + 226 + ], + "score": 1.0, + "content": "an average over 5 seeds, with error bars indicating standard error. Vertical dashed lines denote the", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 225, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 192, + 238 + ], + "score": 1.0, + "content": "training environment", + "type": "text" + }, + { + "bbox": [ + 192, + 225, + 201, + 236 + ], + "score": 0.77, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 202, + 225, + 505, + 238 + ], + "score": 1.0, + "content": ". (Left) Average planner performance at convergence. (Right) Performance", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 236, + 452, + 248 + ], + "spans": [ + { + "bbox": [ + 106, + 236, + 452, + 248 + ], + "score": 1.0, + "content": "relative to the vanilla MARL baseline, which is trained without a robustness objective.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 106, + 271, + 505, + 371 + ], + "lines": [ + { + "bbox": [ + 106, + 271, + 504, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 504, + 284 + ], + "score": 1.0, + "content": "First-order Approximation Using the first order approximation of Equation 13 might slow learn-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 281, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 104, + 281, + 506, + 297 + ], + "score": 1.0, + "content": "ing, since we step “away” from the direction that the standard policy gradient suggests. In contrast,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 293, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 505, + 307 + ], + "score": 1.0, + "content": "we find that the ERMAS update can significantly speed up convergence. Figure 3 depicts the learn-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 303, + 506, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 303, + 329, + 318 + ], + "score": 1.0, + "content": "ing curve of variants of ERMAS with varying weights,", + "type": "text" + }, + { + "bbox": [ + 329, + 305, + 337, + 316 + ], + "score": 0.82, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 303, + 506, + 318 + ], + "score": 1.0, + "content": ", on the meta-learning term. For instance,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 315, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 106, + 315, + 131, + 329 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 131, + 316, + 160, + 327 + ], + "score": 0.91, + "content": "\\beta = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 315, + 506, + 329 + ], + "score": 1.0, + "content": ", the meta-learning term is completely dropped. We find that lines corresponding to", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 327, + 505, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 327, + 170, + 339 + ], + "score": 1.0, + "content": "larger values of", + "type": "text" + }, + { + "bbox": [ + 170, + 327, + 178, + 338 + ], + "score": 0.86, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 327, + 505, + 339 + ], + "score": 1.0, + "content": "reach improved agent rewards half an order of magnitude faster than lower values", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 336, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 106, + 336, + 117, + 350 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 338, + 124, + 349 + ], + "score": 0.82, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 125, + 336, + 231, + 350 + ], + "score": 1.0, + "content": ". However, larger values of", + "type": "text" + }, + { + "bbox": [ + 231, + 338, + 239, + 349 + ], + "score": 0.85, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 239, + 336, + 423, + 350 + ], + "score": 1.0, + "content": "fail to reach the desirable region of adversarial", + "type": "text" + }, + { + "bbox": [ + 424, + 339, + 429, + 347 + ], + "score": 0.59, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 336, + 505, + 350 + ], + "score": 1.0, + "content": "-equilibria. In both", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 347, + 506, + 363 + ], + "spans": [ + { + "bbox": [ + 105, + 347, + 178, + 363 + ], + "score": 1.0, + "content": "cases, very large", + "type": "text" + }, + { + "bbox": [ + 178, + 348, + 212, + 361 + ], + "score": 0.89, + "content": "\\begin{array} { r } { ( \\bar { \\beta } > \\frac { 1 } { N } , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 347, + 280, + 363 + ], + "score": 1.0, + "content": ") and very small", + "type": "text" + }, + { + "bbox": [ + 281, + 348, + 310, + 360 + ], + "score": 0.86, + "content": "( \\beta \\sim 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 347, + 506, + 363 + ], + "score": 1.0, + "content": "fail to fully reach and remain at the adversarial", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 359, + 505, + 372 + ], + "spans": [ + { + "bbox": [ + 105, + 359, + 275, + 372 + ], + "score": 1.0, + "content": "region. However, an appropriate range for", + "type": "text" + }, + { + "bbox": [ + 275, + 360, + 283, + 371 + ], + "score": 0.86, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 283, + 359, + 505, + 372 + ], + "score": 1.0, + "content": "gives rapid convergence and good asymptotic behavior.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 12, + "bbox_fs": [ + 104, + 271, + 506, + 372 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 387, + 370, + 398 + ], + "lines": [ + { + "bbox": [ + 106, + 386, + 371, + 399 + ], + "spans": [ + { + "bbox": [ + 106, + 386, + 371, + 399 + ], + "score": 1.0, + "content": "4.3 SOLVING PL A N N E R-OPT USING AG E N T-AD V-SE A R C H", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 408, + 505, + 452 + ], + "lines": [ + { + "bbox": [ + 106, + 409, + 505, + 421 + ], + "spans": [ + { + "bbox": [ + 106, + 409, + 284, + 420 + ], + "score": 1.0, + "content": "We now show that ERMAS yields planners", + "type": "text" + }, + { + "bbox": [ + 284, + 411, + 295, + 421 + ], + "score": 0.87, + "content": "\\pi _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 409, + 505, + 420 + ], + "score": 1.0, + "content": "which are more robust to uncertainty in the agent’s", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 420, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 420, + 505, + 431 + ], + "score": 1.0, + "content": "reward function. Specifically, we empirically validate that ERMAS can find strong solutions to", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 431, + 505, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 505, + 443 + ], + "score": 1.0, + "content": "the nested optimization problems Agent-Adv-Search and Planner-OPT, in two simulations:", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 441, + 374, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 374, + 454 + ], + "score": 1.0, + "content": "repeated bimatrix games and economic simulations (see Figure 1).", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 105, + 409, + 505, + 454 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 468, + 505, + 545 + ], + "lines": [ + { + "bbox": [ + 106, + 468, + 505, + 480 + ], + "spans": [ + { + "bbox": [ + 106, + 468, + 505, + 480 + ], + "score": 1.0, + "content": "Evaluation Workflow To measure planner robustness, we evaluate trained planners in test envi-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 479, + 504, + 491 + ], + "spans": [ + { + "bbox": [ + 106, + 479, + 504, + 491 + ], + "score": 1.0, + "content": "ronments with a reality gap (i.e. reward parameterizations that differ from the training environment),", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 490, + 505, + 502 + ], + "score": 1.0, + "content": "containing test agents that are optimized for the test environment’s reward functions and that have", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 502, + 504, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 504, + 513 + ], + "score": 1.0, + "content": "not been seen by the planner. We proceed as follows: 1) Train the agents and planner with ERMAS.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 512, + 504, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 504, + 524 + ], + "score": 1.0, + "content": "2) Fix the planner and transfer it to a test environment, then train new agents from scratch in the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 523, + 505, + 536 + ], + "spans": [ + { + "bbox": [ + 105, + 523, + 505, + 536 + ], + "score": 1.0, + "content": "test environment with reward functions unseen by the planner. 3) Report the value of the planner", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 534, + 294, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 294, + 546 + ], + "score": 1.0, + "content": "objective after the new agents have converged.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 468, + 505, + 546 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 504, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 560, + 506, + 573 + ], + "spans": [ + { + "bbox": [ + 105, + 560, + 506, + 573 + ], + "score": 1.0, + "content": "Augmented Repeated Bimatrix Games We now extend the bimatrix game to a nested reinforce-", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 571, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 571, + 505, + 583 + ], + "score": 1.0, + "content": "ment learning problem by allowing the planner to take actions and influence its own experienced re-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 582, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 105, + 582, + 270, + 595 + ], + "score": 1.0, + "content": "ward. The planner now selects an integer", + "type": "text" + }, + { + "bbox": [ + 270, + 583, + 295, + 593 + ], + "score": 0.92, + "content": "a \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 582, + 447, + 595 + ], + "score": 1.0, + "content": "that modifies its new reward function:", + "type": "text" + }, + { + "bbox": [ + 447, + 582, + 501, + 594 + ], + "score": 0.92, + "content": "\\bar { a r } _ { p } ( i , j ) - a ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 582, + 505, + 595 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 592, + 506, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 592, + 290, + 607 + ], + "score": 1.0, + "content": "This function is chosen for its quadratic form:", + "type": "text" + }, + { + "bbox": [ + 290, + 596, + 297, + 604 + ], + "score": 0.69, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 297, + 592, + 427, + 607 + ], + "score": 1.0, + "content": "scales the reward but adds a cost", + "type": "text" + }, + { + "bbox": [ + 428, + 594, + 439, + 604 + ], + "score": 0.86, + "content": "a ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 592, + 506, + 607 + ], + "score": 1.0, + "content": "which disincen-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 605, + 506, + 618 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 189, + 618 + ], + "score": 1.0, + "content": "tives large values of", + "type": "text" + }, + { + "bbox": [ + 189, + 607, + 195, + 615 + ], + "score": 0.64, + "content": "a", + "type": "inline_equation" + }, + { + "bbox": [ + 195, + 605, + 416, + 618 + ], + "score": 1.0, + "content": ". Agents are modified to receive a new reward function", + "type": "text" + }, + { + "bbox": [ + 417, + 605, + 477, + 617 + ], + "score": 0.92, + "content": "r _ { i } ^ { \\prime } = r _ { i } - Q r _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 605, + 506, + 618 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 615, + 506, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 618, + 116, + 627 + ], + "score": 0.83, + "content": "r _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 116, + 615, + 270, + 630 + ], + "score": 1.0, + "content": "is their original reward function and", + "type": "text" + }, + { + "bbox": [ + 271, + 616, + 302, + 627 + ], + "score": 0.91, + "content": "Q \\leq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 615, + 506, + 630 + ], + "score": 1.0, + "content": "is an unknown scalar which may differ between", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 254, + 639 + ], + "score": 1.0, + "content": "training and testing environments. If", + "type": "text" + }, + { + "bbox": [ + 254, + 627, + 281, + 638 + ], + "score": 0.91, + "content": "Q = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 627, + 505, + 639 + ], + "score": 1.0, + "content": ", agents act identical to the experiments in Figure 2. For", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 638, + 488, + 650 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 247, + 650 + ], + "score": 1.0, + "content": "environments with larger values of", + "type": "text" + }, + { + "bbox": [ + 248, + 639, + 256, + 649 + ], + "score": 0.84, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 638, + 279, + 650 + ], + "score": 1.0, + "content": ", e.g.,", + "type": "text" + }, + { + "bbox": [ + 279, + 639, + 314, + 650 + ], + "score": 0.91, + "content": "Q = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 638, + 488, + 650 + ], + "score": 1.0, + "content": ", agents have an incentive to be adversarial.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 560, + 506, + 650 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 654, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "Figure 4 shows the test performance of ERMAS against vanilla multi-agent RL policies learned with", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 156, + 677 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 666, + 189, + 678 + ], + "score": 1.0, + "content": "or with", + "type": "text" + }, + { + "bbox": [ + 190, + 666, + 231, + 677 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 666, + 361, + 678 + ], + "score": 1.0, + "content": ". Naturally, MARL trained with", + "type": "text" + }, + { + "bbox": [ + 361, + 666, + 411, + 677 + ], + "score": 0.9, + "content": "Q _ { \\mathrm { t r a i n } } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "underperforms MARL", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 676, + 506, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 156, + 690 + ], + "score": 1.0, + "content": "trained with", + "type": "text" + }, + { + "bbox": [ + 156, + 677, + 197, + 688 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 676, + 354, + 690 + ], + "score": 1.0, + "content": "when evaluated in environments where", + "type": "text" + }, + { + "bbox": [ + 354, + 677, + 400, + 688 + ], + "score": 0.89, + "content": "Q _ { \\mathrm { t e s t } } < 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 676, + 506, + 690 + ], + "score": 1.0, + "content": ". However, MARL trained", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 128, + 701 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 128, + 688, + 180, + 699 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 687, + 259, + 701 + ], + "score": 1.0, + "content": "outperforms when", + "type": "text" + }, + { + "bbox": [ + 259, + 688, + 309, + 699 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t e s t } } > 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 687, + 505, + 701 + ], + "score": 1.0, + "content": ". Agent-Adv-Search successfully finds the", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 428, + 712 + ], + "score": 1.0, + "content": "worst-case perturbation, and yields a planner policy at least as good as MARL", + "type": "text" + }, + { + "bbox": [ + 428, + 699, + 479, + 710 + ], + "score": 0.91, + "content": "Q _ { \\mathrm { t r a i n } } = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 479, + 698, + 505, + 712 + ], + "score": 1.0, + "content": ". This", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 505, + 723 + ], + "score": 1.0, + "content": "shows that ERMAS can produce policies which are robust to uncertainty in agents’ objectives and", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 720, + 294, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 294, + 733 + ], + "score": 1.0, + "content": "is a tractable adversarial robustness algorithm.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 40, + "bbox_fs": [ + 105, + 655, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 225 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "Existing single-agent and multi-agent robust reinforcement learning algorithms optimize for differ-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "ent robustness objectives than ERMAS. However, some general techniques for addressing Sim2Real", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "score": 1.0, + "content": "can be extended to provide an alternative to ERMAS’s adversarial approach. Our first baseline", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 505, + 129 + ], + "score": 1.0, + "content": "extends the technique of domain randomization (DR) by applying random perturbations to agent", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 237, + 140 + ], + "score": 1.0, + "content": "rewards. For DR, agents receive", + "type": "text" + }, + { + "bbox": [ + 237, + 127, + 285, + 138 + ], + "score": 0.93, + "content": "r _ { i } ^ { \\prime } = r _ { i } + \\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 126, + 315, + 140 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 316, + 127, + 371, + 138 + ], + "score": 0.93, + "content": "\\sigma \\sim U [ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 126, + 400, + 140 + ], + "score": 1.0, + "content": "(recall", + "type": "text" + }, + { + "bbox": [ + 400, + 126, + 443, + 138 + ], + "score": 0.9, + "content": "r _ { i } \\in [ 0 , 1 ] ,", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 126, + 505, + 140 + ], + "score": 1.0, + "content": "). These pertur-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "bations are randomized periodically between episodes. Even in a simple 4-by-4 bimatrix game, there", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 120, + 161 + ], + "score": 1.0, + "content": "are", + "type": "text" + }, + { + "bbox": [ + 121, + 149, + 165, + 159 + ], + "score": 0.88, + "content": "2 3 0 4 = 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 148, + 192, + 161 + ], + "score": 1.0, + "content": "states", + "type": "text" + }, + { + "bbox": [ + 192, + 149, + 212, + 159 + ], + "score": 0.88, + "content": "\\times 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 148, + 239, + 161 + ], + "score": 1.0, + "content": "states", + "type": "text" + }, + { + "bbox": [ + 239, + 149, + 255, + 159 + ], + "score": 0.87, + "content": "\\times 9", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 148, + 506, + 161 + ], + "score": 1.0, + "content": "actions possible reward values to perturb; a 2304-dimensional", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 506, + 173 + ], + "score": 1.0, + "content": "space is too sparse to cover uniformly. Furthermore, in contrast to DR of visual inputs or dynamics,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "score": 1.0, + "content": "there is a natural latency to the effect of DR of agent rewards: randomization only has an effect if", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "agents learn to adapt to their perturbed rewards. Our second baseline, risk robustness (RR), applies", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 104, + 192, + 258, + 205 + ], + "score": 1.0, + "content": "a concavity to planner rewards, e.g.,", + "type": "text" + }, + { + "bbox": [ + 258, + 192, + 283, + 205 + ], + "score": 0.87, + "content": "\\log r _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 192, + 505, + 205 + ], + "score": 1.0, + "content": ". This encourages robustness to environment stochas-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 204, + 504, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 504, + 215 + ], + "score": 1.0, + "content": "ticity, including the randomness of agent policies. As illustrated in Figure 4, neither the domain", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 213, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 505, + 227 + ], + "score": 1.0, + "content": "randomization nor risk robustness baseline yields meaningful robustness even in this simple setting.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 106, + 238, + 430, + 250 + ], + "lines": [ + { + "bbox": [ + 105, + 238, + 432, + 251 + ], + "spans": [ + { + "bbox": [ + 105, + 238, + 432, + 251 + ], + "score": 1.0, + "content": "4.4 ERMAS FOR LARGE-SCALE TWO-LEVEL LEARNING: AI ECONOMIST", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 259, + 505, + 334 + ], + "lines": [ + { + "bbox": [ + 106, + 258, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 506, + 272 + ], + "score": 1.0, + "content": "We now address an important use-case, tax policy design, to demonstrate ERMAS at scale. We", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "train a robust AI Economist: a planner for optimal taxation that acts in a spatiotemporal economic", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "score": 1.0, + "content": "simulation, see Zheng et al. (2020) for a detailed description. This setting is very challenging given", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 291, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 304 + ], + "score": 1.0, + "content": "the scale of the simulation and agent affordances. In particular, adversarial and randomization", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 302, + 504, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 504, + 316 + ], + "score": 1.0, + "content": "baselines do not scale to this setting. In this simulation, agents optimize their expected utility", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 313, + 494, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 182, + 334 + ], + "score": 0.92, + "content": "\\mathbb { E } _ { \\pi , \\pi _ { p } } \\left[ \\sum _ { t = 0 } ^ { T } r _ { i , t } \\right]", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 315, + 253, + 333 + ], + "score": 1.0, + "content": ", where the utility", + "type": "text" + }, + { + "bbox": [ + 253, + 319, + 268, + 330 + ], + "score": 0.86, + "content": "{ \\boldsymbol { r } } _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 315, + 354, + 333 + ], + "score": 1.0, + "content": "is a function of labor", + "type": "text" + }, + { + "bbox": [ + 355, + 318, + 367, + 330 + ], + "score": 0.89, + "content": "l _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 315, + 473, + 333 + ], + "score": 1.0, + "content": "and post-tax endowments", + "type": "text" + }, + { + "bbox": [ + 473, + 320, + 488, + 330 + ], + "score": 0.88, + "content": "\\tilde { x } _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 315, + 494, + 333 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16.5 + }, + { + "type": "interline_equation", + "bbox": [ + 127, + 336, + 466, + 371 + ], + "lines": [ + { + "bbox": [ + 127, + 336, + 466, + 371 + ], + "spans": [ + { + "bbox": [ + 127, + 336, + 466, + 371 + ], + "score": 0.93, + "content": "\\tilde { z } _ { i , t } = z _ { i , t } - T ( z _ { i , t } ) , \\quad \\tilde { x } _ { i , t } = \\sum _ { t ^ { \\prime } \\leq t } \\tilde { z } _ { i , t } , \\quad r _ { i , t } ( \\tilde { x } _ { i , t } , l _ { i , t } ) = \\frac { \\tilde { x } _ { i , t } ^ { 1 - \\eta } - 1 } { 1 - \\eta } - l _ { i , t } , \\quad \\eta > 0 ,", + "type": "interline_equation", + "image_path": "a178cb7f591e3d9d9a16df364576284f5797c53cf0ea7cf000670a5232376ab6.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 127, + 336, + 466, + 347.6666666666667 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 127, + 347.6666666666667, + 466, + 359.33333333333337 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 127, + 359.33333333333337, + 466, + 371.00000000000006 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 374, + 506, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 373, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 373, + 133, + 387 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 376, + 140, + 385 + ], + "score": 0.82, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 373, + 298, + 387 + ], + "score": 1.0, + "content": "sets the degree of risk aversion (higher", + "type": "text" + }, + { + "bbox": [ + 298, + 376, + 305, + 385 + ], + "score": 0.81, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 373, + 505, + 387 + ], + "score": 1.0, + "content": "means higher risk aversion). Agents earn income", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 384, + 502, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 121, + 397 + ], + "score": 0.86, + "content": "z _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 384, + 179, + 397 + ], + "score": 1.0, + "content": "and pay taxes", + "type": "text" + }, + { + "bbox": [ + 179, + 385, + 208, + 397 + ], + "score": 0.93, + "content": "T ( z _ { i , t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 384, + 502, + 397 + ], + "score": 1.0, + "content": ", which are set by the planner. The planner optimizes social welfare swf:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 399, + 464, + 434 + ], + "lines": [ + { + "bbox": [ + 130, + 399, + 464, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 464, + 434 + ], + "score": 0.89, + "content": "{ \\mathsf { s w f } } = \\mathsf { e q } ( x ) \\cdot \\mathtt { p r o d } ( x ) , \\quad \\mathsf { e q } ( x ) = 1 - \\frac { N } { N - 1 } \\mathtt { g i n i } ( x ) , \\quad \\mathtt { p r o d } ( x ) = \\sum _ { i = 1 } ^ { N } x _ { i } ,", + "type": "interline_equation", + "image_path": "8471638e02b504cf2b0c426180413da3869cf02fd5fb0749d0d54a52b6de9c70.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 130, + 399, + 464, + 410.6666666666667 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 130, + 410.6666666666667, + 464, + 422.33333333333337 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 130, + 422.33333333333337, + 464, + 434.00000000000006 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 436, + 331, + 448 + ], + "lines": [ + { + "bbox": [ + 104, + 435, + 333, + 451 + ], + "spans": [ + { + "bbox": [ + 104, + 435, + 333, + 451 + ], + "score": 1.0, + "content": "a combination of equality (Gini, 1912) and productivity.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 452, + 505, + 520 + ], + "lines": [ + { + "bbox": [ + 105, + 452, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 505, + 466 + ], + "score": 1.0, + "content": "Figure 5 shows the performance of ERMAS tax policies along with baseline tax policies (Saez,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 443, + 477 + ], + "score": 1.0, + "content": "US Federal) and an AI Economist (MARL). All models are trained on agents with", + "type": "text" + }, + { + "bbox": [ + 444, + 465, + 483, + 476 + ], + "score": 0.9, + "content": "\\eta = 0 . 2 3", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 464, + 505, + 477 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 475, + 504, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 504, + 488 + ], + "score": 1.0, + "content": "replicate Zheng et al. (2020): MARL outperforms the Saez tax. However, MARL fails to outperform", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 486, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 201, + 499 + ], + "score": 1.0, + "content": "Saez when testing with", + "type": "text" + }, + { + "bbox": [ + 201, + 487, + 240, + 497 + ], + "score": 0.92, + "content": "\\eta < 0 . 2 2", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 486, + 258, + 499 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 258, + 487, + 296, + 497 + ], + "score": 0.91, + "content": "\\eta > 0 . 2 8", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 486, + 505, + 499 + ], + "score": 1.0, + "content": ". In contrast, ERMAS yields consistent gains across", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 194, + 510 + ], + "score": 1.0, + "content": "the depicted range of", + "type": "text" + }, + { + "bbox": [ + 195, + 499, + 201, + 509 + ], + "score": 0.79, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 497, + 506, + 510 + ], + "score": 1.0, + "content": ". This shows that ERMAS’s tax policy can improve swf even if agent risk", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 508, + 494, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 494, + 521 + ], + "score": 1.0, + "content": "aversion significantly increases or decreases (e.g., due to economic cycles or exogenous shocks).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 107, + 524, + 504, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 440, + 538 + ], + "score": 1.0, + "content": "In fact, ERMAS outperforms the baseline AI Economist for the original setting of", + "type": "text" + }, + { + "bbox": [ + 440, + 525, + 479, + 537 + ], + "score": 0.9, + "content": "\\eta = 0 . 2 3", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 524, + 506, + 538 + ], + "score": 1.0, + "content": ". This", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 536, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 549 + ], + "score": 1.0, + "content": "suggests the robustness and performance do not necessarily pose a zero-sum game: ERMAS can", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 546, + 504, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 504, + 560 + ], + "score": 1.0, + "content": "find equilibria with high performance and strong generalization. It has been observed empirically", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 558, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 505, + 571 + ], + "score": 1.0, + "content": "in various studies that single-agent robust reinforcement learning similarly yields performance im-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 569, + 433, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 433, + 581 + ], + "score": 1.0, + "content": "provements even in the absence of environment perturbations (Pinto et al., 2017).", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37 + }, + { + "type": "title", + "bbox": [ + 108, + 595, + 211, + 608 + ], + "lines": [ + { + "bbox": [ + 104, + 595, + 213, + 610 + ], + "spans": [ + { + "bbox": [ + 104, + 595, + 213, + 610 + ], + "score": 1.0, + "content": "5 RELATED WORK", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 620, + 505, + 698 + ], + "lines": [ + { + "bbox": [ + 105, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 505, + 633 + ], + "score": 1.0, + "content": "Sim2real: Reality Gaps The Sim2Real problem considers how reality gaps, i.e., mismatches", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 631, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 505, + 644 + ], + "score": 1.0, + "content": "between a simulation and reality, can (negatively) impact RL policies. Robust performance across", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 643, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 655 + ], + "score": 1.0, + "content": "reality gaps has been studied when applying deep RL to robotic control with visual inputs (James", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 104, + 652, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 104, + 652, + 506, + 667 + ], + "score": 1.0, + "content": "et al., 2019; Christiano et al., 2016; Rusu et al., 2016; Tzeng et al., 2015). To close reality gaps,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 664, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 505, + 677 + ], + "score": 1.0, + "content": "domain adaptation aims to transfer a simulated distribution (of the world) to the real world (Higgins", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 675, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 104, + 675, + 505, + 689 + ], + "score": 1.0, + "content": "et al., 2017; Kim et al., 2019). In comparison, the study of reality gaps in multi-agent RL is relatively", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 686, + 299, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 299, + 699 + ], + "score": 1.0, + "content": "nascent (Suh et al., 2019; Nachum et al., 2019).", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Multi-Agent Robustness Morimoto & Doya (2001) proposed robust RL for the worst-case ad-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 720, + 504, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 395, + 733 + ], + "score": 1.0, + "content": "versarial objective (i.e., a max-min optimization problem), inspired by", + "type": "text" + }, + { + "bbox": [ + 396, + 721, + 414, + 732 + ], + "score": 0.9, + "content": "\\mathcal { H } _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 720, + 504, + 733 + ], + "score": 1.0, + "content": "control, and provided", + "type": "text" + } + ], + "index": 49 + } + ], + "index": 48.5 + } + ], + "page_idx": 7, + "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, + 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, + 225 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "score": 1.0, + "content": "Existing single-agent and multi-agent robust reinforcement learning algorithms optimize for differ-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "ent robustness objectives than ERMAS. However, some general techniques for addressing Sim2Real", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 118 + ], + "score": 1.0, + "content": "can be extended to provide an alternative to ERMAS’s adversarial approach. Our first baseline", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 505, + 129 + ], + "score": 1.0, + "content": "extends the technique of domain randomization (DR) by applying random perturbations to agent", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 237, + 140 + ], + "score": 1.0, + "content": "rewards. For DR, agents receive", + "type": "text" + }, + { + "bbox": [ + 237, + 127, + 285, + 138 + ], + "score": 0.93, + "content": "r _ { i } ^ { \\prime } = r _ { i } + \\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 126, + 315, + 140 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 316, + 127, + 371, + 138 + ], + "score": 0.93, + "content": "\\sigma \\sim U [ - 1 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 126, + 400, + 140 + ], + "score": 1.0, + "content": "(recall", + "type": "text" + }, + { + "bbox": [ + 400, + 126, + 443, + 138 + ], + "score": 0.9, + "content": "r _ { i } \\in [ 0 , 1 ] ,", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 126, + 505, + 140 + ], + "score": 1.0, + "content": "). These pertur-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "spans": [ + { + "bbox": [ + 105, + 137, + 505, + 150 + ], + "score": 1.0, + "content": "bations are randomized periodically between episodes. Even in a simple 4-by-4 bimatrix game, there", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 148, + 506, + 161 + ], + "spans": [ + { + "bbox": [ + 105, + 148, + 120, + 161 + ], + "score": 1.0, + "content": "are", + "type": "text" + }, + { + "bbox": [ + 121, + 149, + 165, + 159 + ], + "score": 0.88, + "content": "2 3 0 4 = 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 148, + 192, + 161 + ], + "score": 1.0, + "content": "states", + "type": "text" + }, + { + "bbox": [ + 192, + 149, + 212, + 159 + ], + "score": 0.88, + "content": "\\times 1 6", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 148, + 239, + 161 + ], + "score": 1.0, + "content": "states", + "type": "text" + }, + { + "bbox": [ + 239, + 149, + 255, + 159 + ], + "score": 0.87, + "content": "\\times 9", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 148, + 506, + 161 + ], + "score": 1.0, + "content": "actions possible reward values to perturb; a 2304-dimensional", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 158, + 506, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 158, + 506, + 173 + ], + "score": 1.0, + "content": "space is too sparse to cover uniformly. Furthermore, in contrast to DR of visual inputs or dynamics,", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "spans": [ + { + "bbox": [ + 105, + 170, + 506, + 183 + ], + "score": 1.0, + "content": "there is a natural latency to the effect of DR of agent rewards: randomization only has an effect if", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 181, + 506, + 194 + ], + "score": 1.0, + "content": "agents learn to adapt to their perturbed rewards. Our second baseline, risk robustness (RR), applies", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 192, + 505, + 205 + ], + "spans": [ + { + "bbox": [ + 104, + 192, + 258, + 205 + ], + "score": 1.0, + "content": "a concavity to planner rewards, e.g.,", + "type": "text" + }, + { + "bbox": [ + 258, + 192, + 283, + 205 + ], + "score": 0.87, + "content": "\\log r _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 192, + 505, + 205 + ], + "score": 1.0, + "content": ". This encourages robustness to environment stochas-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 204, + 504, + 215 + ], + "spans": [ + { + "bbox": [ + 105, + 204, + 504, + 215 + ], + "score": 1.0, + "content": "ticity, including the randomness of agent policies. As illustrated in Figure 4, neither the domain", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 213, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 505, + 227 + ], + "score": 1.0, + "content": "randomization nor risk robustness baseline yields meaningful robustness even in this simple setting.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 6, + "bbox_fs": [ + 104, + 83, + 506, + 227 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 238, + 430, + 250 + ], + "lines": [ + { + "bbox": [ + 105, + 238, + 432, + 251 + ], + "spans": [ + { + "bbox": [ + 105, + 238, + 432, + 251 + ], + "score": 1.0, + "content": "4.4 ERMAS FOR LARGE-SCALE TWO-LEVEL LEARNING: AI ECONOMIST", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 259, + 505, + 334 + ], + "lines": [ + { + "bbox": [ + 106, + 258, + 506, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 506, + 272 + ], + "score": 1.0, + "content": "We now address an important use-case, tax policy design, to demonstrate ERMAS at scale. We", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 270, + 505, + 282 + ], + "spans": [ + { + "bbox": [ + 106, + 270, + 505, + 282 + ], + "score": 1.0, + "content": "train a robust AI Economist: a planner for optimal taxation that acts in a spatiotemporal economic", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 294 + ], + "score": 1.0, + "content": "simulation, see Zheng et al. (2020) for a detailed description. This setting is very challenging given", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 291, + 505, + 304 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 304 + ], + "score": 1.0, + "content": "the scale of the simulation and agent affordances. In particular, adversarial and randomization", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 302, + 504, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 504, + 316 + ], + "score": 1.0, + "content": "baselines do not scale to this setting. In this simulation, agents optimize their expected utility", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 313, + 494, + 334 + ], + "spans": [ + { + "bbox": [ + 106, + 313, + 182, + 334 + ], + "score": 0.92, + "content": "\\mathbb { E } _ { \\pi , \\pi _ { p } } \\left[ \\sum _ { t = 0 } ^ { T } r _ { i , t } \\right]", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 315, + 253, + 333 + ], + "score": 1.0, + "content": ", where the utility", + "type": "text" + }, + { + "bbox": [ + 253, + 319, + 268, + 330 + ], + "score": 0.86, + "content": "{ \\boldsymbol { r } } _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 315, + 354, + 333 + ], + "score": 1.0, + "content": "is a function of labor", + "type": "text" + }, + { + "bbox": [ + 355, + 318, + 367, + 330 + ], + "score": 0.89, + "content": "l _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 367, + 315, + 473, + 333 + ], + "score": 1.0, + "content": "and post-tax endowments", + "type": "text" + }, + { + "bbox": [ + 473, + 320, + 488, + 330 + ], + "score": 0.88, + "content": "\\tilde { x } _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 488, + 315, + 494, + 333 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 258, + 506, + 334 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 127, + 336, + 466, + 371 + ], + "lines": [ + { + "bbox": [ + 127, + 336, + 466, + 371 + ], + "spans": [ + { + "bbox": [ + 127, + 336, + 466, + 371 + ], + "score": 0.93, + "content": "\\tilde { z } _ { i , t } = z _ { i , t } - T ( z _ { i , t } ) , \\quad \\tilde { x } _ { i , t } = \\sum _ { t ^ { \\prime } \\leq t } \\tilde { z } _ { i , t } , \\quad r _ { i , t } ( \\tilde { x } _ { i , t } , l _ { i , t } ) = \\frac { \\tilde { x } _ { i , t } ^ { 1 - \\eta } - 1 } { 1 - \\eta } - l _ { i , t } , \\quad \\eta > 0 ,", + "type": "interline_equation", + "image_path": "a178cb7f591e3d9d9a16df364576284f5797c53cf0ea7cf000670a5232376ab6.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 127, + 336, + 466, + 347.6666666666667 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 127, + 347.6666666666667, + 466, + 359.33333333333337 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 127, + 359.33333333333337, + 466, + 371.00000000000006 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 374, + 506, + 397 + ], + "lines": [ + { + "bbox": [ + 106, + 373, + 505, + 387 + ], + "spans": [ + { + "bbox": [ + 106, + 373, + 133, + 387 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 376, + 140, + 385 + ], + "score": 0.82, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 373, + 298, + 387 + ], + "score": 1.0, + "content": "sets the degree of risk aversion (higher", + "type": "text" + }, + { + "bbox": [ + 298, + 376, + 305, + 385 + ], + "score": 0.81, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 373, + 505, + 387 + ], + "score": 1.0, + "content": "means higher risk aversion). Agents earn income", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 384, + 502, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 387, + 121, + 397 + ], + "score": 0.86, + "content": "z _ { i , t }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 384, + 179, + 397 + ], + "score": 1.0, + "content": "and pay taxes", + "type": "text" + }, + { + "bbox": [ + 179, + 385, + 208, + 397 + ], + "score": 0.93, + "content": "T ( z _ { i , t } )", + "type": "inline_equation" + }, + { + "bbox": [ + 208, + 384, + 502, + 397 + ], + "score": 1.0, + "content": ", which are set by the planner. The planner optimizes social welfare swf:", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 106, + 373, + 505, + 397 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 399, + 464, + 434 + ], + "lines": [ + { + "bbox": [ + 130, + 399, + 464, + 434 + ], + "spans": [ + { + "bbox": [ + 130, + 399, + 464, + 434 + ], + "score": 0.89, + "content": "{ \\mathsf { s w f } } = \\mathsf { e q } ( x ) \\cdot \\mathtt { p r o d } ( x ) , \\quad \\mathsf { e q } ( x ) = 1 - \\frac { N } { N - 1 } \\mathtt { g i n i } ( x ) , \\quad \\mathtt { p r o d } ( x ) = \\sum _ { i = 1 } ^ { N } x _ { i } ,", + "type": "interline_equation", + "image_path": "8471638e02b504cf2b0c426180413da3869cf02fd5fb0749d0d54a52b6de9c70.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 130, + 399, + 464, + 410.6666666666667 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 130, + 410.6666666666667, + 464, + 422.33333333333337 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 130, + 422.33333333333337, + 464, + 434.00000000000006 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 436, + 331, + 448 + ], + "lines": [ + { + "bbox": [ + 104, + 435, + 333, + 451 + ], + "spans": [ + { + "bbox": [ + 104, + 435, + 333, + 451 + ], + "score": 1.0, + "content": "a combination of equality (Gini, 1912) and productivity.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 104, + 435, + 333, + 451 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 452, + 505, + 520 + ], + "lines": [ + { + "bbox": [ + 105, + 452, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 505, + 466 + ], + "score": 1.0, + "content": "Figure 5 shows the performance of ERMAS tax policies along with baseline tax policies (Saez,", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 464, + 505, + 477 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 443, + 477 + ], + "score": 1.0, + "content": "US Federal) and an AI Economist (MARL). All models are trained on agents with", + "type": "text" + }, + { + "bbox": [ + 444, + 465, + 483, + 476 + ], + "score": 0.9, + "content": "\\eta = 0 . 2 3", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 464, + 505, + 477 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 475, + 504, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 475, + 504, + 488 + ], + "score": 1.0, + "content": "replicate Zheng et al. (2020): MARL outperforms the Saez tax. However, MARL fails to outperform", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 486, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 486, + 201, + 499 + ], + "score": 1.0, + "content": "Saez when testing with", + "type": "text" + }, + { + "bbox": [ + 201, + 487, + 240, + 497 + ], + "score": 0.92, + "content": "\\eta < 0 . 2 2", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 486, + 258, + 499 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 258, + 487, + 296, + 497 + ], + "score": 0.91, + "content": "\\eta > 0 . 2 8", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 486, + 505, + 499 + ], + "score": 1.0, + "content": ". In contrast, ERMAS yields consistent gains across", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 106, + 497, + 506, + 510 + ], + "spans": [ + { + "bbox": [ + 106, + 497, + 194, + 510 + ], + "score": 1.0, + "content": "the depicted range of", + "type": "text" + }, + { + "bbox": [ + 195, + 499, + 201, + 509 + ], + "score": 0.79, + "content": "\\eta", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 497, + 506, + 510 + ], + "score": 1.0, + "content": ". This shows that ERMAS’s tax policy can improve swf even if agent risk", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 508, + 494, + 521 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 494, + 521 + ], + "score": 1.0, + "content": "aversion significantly increases or decreases (e.g., due to economic cycles or exogenous shocks).", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 31.5, + "bbox_fs": [ + 105, + 452, + 506, + 521 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 524, + 504, + 580 + ], + "lines": [ + { + "bbox": [ + 105, + 524, + 506, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 524, + 440, + 538 + ], + "score": 1.0, + "content": "In fact, ERMAS outperforms the baseline AI Economist for the original setting of", + "type": "text" + }, + { + "bbox": [ + 440, + 525, + 479, + 537 + ], + "score": 0.9, + "content": "\\eta = 0 . 2 3", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 524, + 506, + 538 + ], + "score": 1.0, + "content": ". This", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 536, + 505, + 549 + ], + "spans": [ + { + "bbox": [ + 105, + 536, + 505, + 549 + ], + "score": 1.0, + "content": "suggests the robustness and performance do not necessarily pose a zero-sum game: ERMAS can", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 546, + 504, + 560 + ], + "spans": [ + { + "bbox": [ + 105, + 546, + 504, + 560 + ], + "score": 1.0, + "content": "find equilibria with high performance and strong generalization. It has been observed empirically", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 558, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 505, + 571 + ], + "score": 1.0, + "content": "in various studies that single-agent robust reinforcement learning similarly yields performance im-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 569, + 433, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 433, + 581 + ], + "score": 1.0, + "content": "provements even in the absence of environment perturbations (Pinto et al., 2017).", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 524, + 506, + 581 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 595, + 211, + 608 + ], + "lines": [ + { + "bbox": [ + 104, + 595, + 213, + 610 + ], + "spans": [ + { + "bbox": [ + 104, + 595, + 213, + 610 + ], + "score": 1.0, + "content": "5 RELATED WORK", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 620, + 505, + 698 + ], + "lines": [ + { + "bbox": [ + 105, + 620, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 505, + 633 + ], + "score": 1.0, + "content": "Sim2real: Reality Gaps The Sim2Real problem considers how reality gaps, i.e., mismatches", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 631, + 505, + 644 + ], + "spans": [ + { + "bbox": [ + 105, + 631, + 505, + 644 + ], + "score": 1.0, + "content": "between a simulation and reality, can (negatively) impact RL policies. Robust performance across", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 643, + 505, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 643, + 505, + 655 + ], + "score": 1.0, + "content": "reality gaps has been studied when applying deep RL to robotic control with visual inputs (James", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 104, + 652, + 506, + 667 + ], + "spans": [ + { + "bbox": [ + 104, + 652, + 506, + 667 + ], + "score": 1.0, + "content": "et al., 2019; Christiano et al., 2016; Rusu et al., 2016; Tzeng et al., 2015). To close reality gaps,", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 664, + 505, + 677 + ], + "spans": [ + { + "bbox": [ + 105, + 664, + 505, + 677 + ], + "score": 1.0, + "content": "domain adaptation aims to transfer a simulated distribution (of the world) to the real world (Higgins", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 104, + 675, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 104, + 675, + 505, + 689 + ], + "score": 1.0, + "content": "et al., 2017; Kim et al., 2019). In comparison, the study of reality gaps in multi-agent RL is relatively", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 686, + 299, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 299, + 699 + ], + "score": 1.0, + "content": "nascent (Suh et al., 2019; Nachum et al., 2019).", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44, + "bbox_fs": [ + 104, + 620, + 506, + 699 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Multi-Agent Robustness Morimoto & Doya (2001) proposed robust RL for the worst-case ad-", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 720, + 504, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 395, + 733 + ], + "score": 1.0, + "content": "versarial objective (i.e., a max-min optimization problem), inspired by", + "type": "text" + }, + { + "bbox": [ + 396, + 721, + 414, + 732 + ], + "score": 0.9, + "content": "\\mathcal { H } _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 720, + 504, + 733 + ], + "score": 1.0, + "content": "control, and provided", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "score": 1.0, + "content": "analytical solutions in the linear setting. The robust RL problem can be solved using an adversarial", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 282, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 506, + 295 + ], + "score": 1.0, + "content": "player that chooses perturbations. Rather than the worst-case, Pinto et al. (2017) optimized for the", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 293, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 107, + 295, + 114, + 303 + ], + "score": 0.7, + "content": "\\alpha", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 114, + 293, + 506, + 307 + ], + "score": 1.0, + "content": "-quantile of reward, using a conditional value-at-risk (CVAR) interpretation of adversarial robust-", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 305, + 504, + 316 + ], + "spans": [ + { + "bbox": [ + 106, + 305, + 504, + 316 + ], + "score": 1.0, + "content": "ness. We consider perturbations to agent rewards. Other works have studied perturbing transition", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 314, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 104, + 314, + 505, + 329 + ], + "score": 1.0, + "content": "matrices, observation spaces, and action probabilities, which are relevant to robotics and control ap-", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 326, + 506, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 326, + 506, + 339 + ], + "score": 1.0, + "content": "plications (Pinto et al., 2017; Tessler et al., 2019; Hou et al., 2020; Li et al., 2019). We also address a", + "type": "text", + "cross_page": true + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 337, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 350 + ], + "score": 1.0, + "content": "more challenging multi-agent setting than previous works. First, agents do not necessarily optimize", + "type": "text", + "cross_page": true + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 349, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 505, + 360 + ], + "score": 1.0, + "content": "for the same (robustness) objective. We therefore consider a one-sided robustness problem where", + "type": "text", + "cross_page": true + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 360, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 505, + 371 + ], + "score": 1.0, + "content": "only the planner is expected to act robustly. This setting is significantly more difficult than previous", + "type": "text", + "cross_page": true + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 370, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 505, + 381 + ], + "score": 1.0, + "content": "works that assume all agents act robustly (Li et al., 2019). Second, we address a challenging nested", + "type": "text", + "cross_page": true + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 380, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 393 + ], + "score": 1.0, + "content": "reinforcement learning setting of interest to important real-world applications such as economics", + "type": "text", + "cross_page": true + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 391, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 505, + 405 + ], + "score": 1.0, + "content": "mechanism design (Zheng et al., 2020). Although we formulate ERMAS as using simultaneous gra-", + "type": "text", + "cross_page": true + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 402, + 505, + 415 + ], + "score": 1.0, + "content": "dient descent, ERMAS can be easily extended to use nested optimization solvers such as competitive", + "type": "text", + "cross_page": true + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 414, + 306, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 306, + 426 + ], + "score": 1.0, + "content": "gradient descent (Schafer & Anandkumar, 2020). ¨", + "type": "text", + "cross_page": true + } + ], + "index": 21 + } + ], + "index": 48.5, + "bbox_fs": [ + 106, + 709, + 504, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 82, + 502, + 180 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 82, + 502, + 180 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 82, + 502, + 180 + ], + "spans": [ + { + "bbox": [ + 108, + 82, + 502, + 180 + ], + "score": 0.958, + "type": "image", + "image_path": "56e995203fcde21443f9a9a16168b1244202cb7c4b065c12c8ceb5ed881f5c51.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 82, + 502, + 114.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 114.66666666666666, + 502, + 147.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 147.33333333333331, + 502, + 179.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 191, + 505, + 246 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 104, + 189, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 104, + 189, + 506, + 205 + ], + "score": 1.0, + "content": "Figure 5: Learning robust optimal taxation in an economic simulation. Results are plotted following", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 203, + 505, + 214 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 505, + 214 + ], + "score": 1.0, + "content": "the same conventions in Figure 4. Due to the intractability of other robustness algorithms in this", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 213, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 506, + 226 + ], + "score": 1.0, + "content": "setting, we instead compare against different planner choices. “US Federal” uses a fixed tax scheme", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 224, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 505, + 237 + ], + "score": 1.0, + "content": "adapted from the 2018 US Federal income tax rates. “Saez” uses an adaptive, theoretical formula to", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 235, + 213, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 213, + 248 + ], + "score": 1.0, + "content": "estimate optimal tax rates.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 271, + 505, + 425 + ], + "lines": [ + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 106, + 271, + 505, + 284 + ], + "score": 1.0, + "content": "analytical solutions in the linear setting. The robust RL problem can be solved using an adversarial", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 282, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 506, + 295 + ], + "score": 1.0, + "content": "player that chooses perturbations. Rather than the worst-case, Pinto et al. (2017) optimized for the", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 293, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 107, + 295, + 114, + 303 + ], + "score": 0.7, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 293, + 506, + 307 + ], + "score": 1.0, + "content": "-quantile of reward, using a conditional value-at-risk (CVAR) interpretation of adversarial robust-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 305, + 504, + 316 + ], + "spans": [ + { + "bbox": [ + 106, + 305, + 504, + 316 + ], + "score": 1.0, + "content": "ness. We consider perturbations to agent rewards. Other works have studied perturbing transition", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 314, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 104, + 314, + 505, + 329 + ], + "score": 1.0, + "content": "matrices, observation spaces, and action probabilities, which are relevant to robotics and control ap-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 326, + 506, + 339 + ], + "spans": [ + { + "bbox": [ + 106, + 326, + 506, + 339 + ], + "score": 1.0, + "content": "plications (Pinto et al., 2017; Tessler et al., 2019; Hou et al., 2020; Li et al., 2019). We also address a", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 337, + 505, + 350 + ], + "spans": [ + { + "bbox": [ + 105, + 337, + 505, + 350 + ], + "score": 1.0, + "content": "more challenging multi-agent setting than previous works. First, agents do not necessarily optimize", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 349, + 505, + 360 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 505, + 360 + ], + "score": 1.0, + "content": "for the same (robustness) objective. We therefore consider a one-sided robustness problem where", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 360, + 505, + 371 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 505, + 371 + ], + "score": 1.0, + "content": "only the planner is expected to act robustly. This setting is significantly more difficult than previous", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 370, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 505, + 381 + ], + "score": 1.0, + "content": "works that assume all agents act robustly (Li et al., 2019). Second, we address a challenging nested", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 380, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 105, + 380, + 505, + 393 + ], + "score": 1.0, + "content": "reinforcement learning setting of interest to important real-world applications such as economics", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 391, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 505, + 405 + ], + "score": 1.0, + "content": "mechanism design (Zheng et al., 2020). Although we formulate ERMAS as using simultaneous gra-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 402, + 505, + 415 + ], + "score": 1.0, + "content": "dient descent, ERMAS can be easily extended to use nested optimization solvers such as competitive", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 414, + 306, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 414, + 306, + 426 + ], + "score": 1.0, + "content": "gradient descent (Schafer & Anandkumar, 2020). ¨", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 108, + 430, + 292, + 442 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 294, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 294, + 443 + ], + "score": 1.0, + "content": "See Appendix A.2 for additional related work.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "title", + "bbox": [ + 108, + 461, + 205, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 207, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 207, + 475 + ], + "score": 1.0, + "content": "6 FUTURE WORK", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 488, + 505, + 543 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 500 + ], + "score": 1.0, + "content": "Future work could extend ERMAS to reality gaps due to different causes, such as changes in transi-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 500, + 504, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 504, + 511 + ], + "score": 1.0, + "content": "tion dynamics, agent affordances, number of agents, etc, which might require more refined approxi-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 104, + 509, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 104, + 509, + 505, + 523 + ], + "score": 1.0, + "content": "mations to the planner’s robustness objective. Furthermore, it would be interesting to apply ERMAS", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 521, + 505, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 505, + 534 + ], + "score": 1.0, + "content": "to problems that feature more general solution concepts, e.g., Bayesian Nash equilibria, correlated", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 532, + 285, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 285, + 546 + ], + "score": 1.0, + "content": "equilibria, Walrassian equilibria, and others.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26 + }, + { + "type": "title", + "bbox": [ + 107, + 563, + 175, + 575 + ], + "lines": [ + { + "bbox": [ + 106, + 563, + 176, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 176, + 577 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 583, + 504, + 606 + ], + "lines": [ + { + "bbox": [ + 106, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "Dirk Bergemann and Stephen Morris. Robust mechanism design. Econometrica, 73(6):1771–1813,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 595, + 494, + 607 + ], + "spans": [ + { + "bbox": [ + 116, + 595, + 494, + 607 + ], + "score": 1.0, + "content": "2005. ISSN 00129682, 14680262. URL http://www.jstor.org/stable/3598751.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 505, + 675 + ], + "lines": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "Eric Bonabeau. Agent-based modeling: Methods and techniques for simulating human systems.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 629, + 506, + 644 + ], + "spans": [ + { + "bbox": [ + 116, + 629, + 506, + 644 + ], + "score": 1.0, + "content": "Proceedings of the National Academy of Sciences, 99(suppl 3):7280–7287, May 2002. ISSN", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 640, + 504, + 654 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 504, + 654 + ], + "score": 1.0, + "content": "0027-8424, 1091-6490. doi: 10.1073/pnas.082080899. URL https://www.pnas.org/", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 651, + 505, + 665 + ], + "spans": [ + { + "bbox": [ + 116, + 651, + 505, + 665 + ], + "score": 1.0, + "content": "content/99/suppl_3/7280. Publisher: National Academy of Sciences Section: Collo-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 663, + 171, + 677 + ], + "spans": [ + { + "bbox": [ + 116, + 663, + 171, + 677 + ], + "score": 1.0, + "content": "quium Paper.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 699 + ], + "score": 1.0, + "content": "Paul Christiano, Zain Shah, Igor Mordatch, Jonas Schneider, Trevor Blackwell, Joshua Tobin, Pieter", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 697, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 115, + 697, + 506, + 712 + ], + "score": 1.0, + "content": "Abbeel, and Wojciech Zaremba. Transfer from Simulation to Real World through Learning", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 114, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 114, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Deep Inverse Dynamics Model. October 2016. URL https://arxiv.org/abs/1610.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 720, + 164, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 164, + 732 + ], + "score": 1.0, + "content": "03518v1.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5 + } + ], + "page_idx": 8, + "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, + 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": [ + 108, + 82, + 502, + 180 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 82, + 502, + 180 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 82, + 502, + 180 + ], + "spans": [ + { + "bbox": [ + 108, + 82, + 502, + 180 + ], + "score": 0.958, + "type": "image", + "image_path": "56e995203fcde21443f9a9a16168b1244202cb7c4b065c12c8ceb5ed881f5c51.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 82, + 502, + 114.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 114.66666666666666, + 502, + 147.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 147.33333333333331, + 502, + 179.99999999999997 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 191, + 505, + 246 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 104, + 189, + 506, + 205 + ], + "spans": [ + { + "bbox": [ + 104, + 189, + 506, + 205 + ], + "score": 1.0, + "content": "Figure 5: Learning robust optimal taxation in an economic simulation. Results are plotted following", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 203, + 505, + 214 + ], + "spans": [ + { + "bbox": [ + 106, + 203, + 505, + 214 + ], + "score": 1.0, + "content": "the same conventions in Figure 4. Due to the intractability of other robustness algorithms in this", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 213, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 105, + 213, + 506, + 226 + ], + "score": 1.0, + "content": "setting, we instead compare against different planner choices. “US Federal” uses a fixed tax scheme", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 224, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 505, + 237 + ], + "score": 1.0, + "content": "adapted from the 2018 US Federal income tax rates. “Saez” uses an adaptive, theoretical formula to", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 235, + 213, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 213, + 248 + ], + "score": 1.0, + "content": "estimate optimal tax rates.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5 + } + ], + "index": 3.0 + }, + { + "type": "text", + "bbox": [ + 107, + 271, + 505, + 425 + ], + "lines": [], + "index": 14.5, + "bbox_fs": [ + 104, + 271, + 506, + 426 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 108, + 430, + 292, + 442 + ], + "lines": [ + { + "bbox": [ + 105, + 429, + 294, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 294, + 443 + ], + "score": 1.0, + "content": "See Appendix A.2 for additional related work.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 429, + 294, + 443 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 461, + 205, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 460, + 207, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 460, + 207, + 475 + ], + "score": 1.0, + "content": "6 FUTURE WORK", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 488, + 505, + 543 + ], + "lines": [ + { + "bbox": [ + 105, + 488, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 488, + 505, + 500 + ], + "score": 1.0, + "content": "Future work could extend ERMAS to reality gaps due to different causes, such as changes in transi-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 500, + 504, + 511 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 504, + 511 + ], + "score": 1.0, + "content": "tion dynamics, agent affordances, number of agents, etc, which might require more refined approxi-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 104, + 509, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 104, + 509, + 505, + 523 + ], + "score": 1.0, + "content": "mations to the planner’s robustness objective. Furthermore, it would be interesting to apply ERMAS", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 521, + 505, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 521, + 505, + 534 + ], + "score": 1.0, + "content": "to problems that feature more general solution concepts, e.g., Bayesian Nash equilibria, correlated", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 532, + 285, + 546 + ], + "spans": [ + { + "bbox": [ + 106, + 532, + 285, + 546 + ], + "score": 1.0, + "content": "equilibria, Walrassian equilibria, and others.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 26, + "bbox_fs": [ + 104, + 488, + 505, + 546 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 563, + 175, + 575 + ], + "lines": [ + { + "bbox": [ + 106, + 563, + 176, + 577 + ], + "spans": [ + { + "bbox": [ + 106, + 563, + 176, + 577 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 107, + 583, + 504, + 606 + ], + "lines": [ + { + "bbox": [ + 106, + 583, + 505, + 596 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 596 + ], + "score": 1.0, + "content": "Dirk Bergemann and Stephen Morris. Robust mechanism design. Econometrica, 73(6):1771–1813,", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 595, + 494, + 607 + ], + "spans": [ + { + "bbox": [ + 116, + 595, + 494, + 607 + ], + "score": 1.0, + "content": "2005. ISSN 00129682, 14680262. URL http://www.jstor.org/stable/3598751.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 106, + 583, + 505, + 607 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 619, + 505, + 675 + ], + "lines": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 505, + 632 + ], + "score": 1.0, + "content": "Eric Bonabeau. Agent-based modeling: Methods and techniques for simulating human systems.", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 629, + 506, + 644 + ], + "spans": [ + { + "bbox": [ + 116, + 629, + 506, + 644 + ], + "score": 1.0, + "content": "Proceedings of the National Academy of Sciences, 99(suppl 3):7280–7287, May 2002. ISSN", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 640, + 504, + 654 + ], + "spans": [ + { + "bbox": [ + 115, + 640, + 504, + 654 + ], + "score": 1.0, + "content": "0027-8424, 1091-6490. doi: 10.1073/pnas.082080899. URL https://www.pnas.org/", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 651, + 505, + 665 + ], + "spans": [ + { + "bbox": [ + 116, + 651, + 505, + 665 + ], + "score": 1.0, + "content": "content/99/suppl_3/7280. Publisher: National Academy of Sciences Section: Collo-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 663, + 171, + 677 + ], + "spans": [ + { + "bbox": [ + 116, + 663, + 171, + 677 + ], + "score": 1.0, + "content": "quium Paper.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 619, + 506, + 677 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 699 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 699 + ], + "score": 1.0, + "content": "Paul Christiano, Zain Shah, Igor Mordatch, Jonas Schneider, Trevor Blackwell, Joshua Tobin, Pieter", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 697, + 506, + 712 + ], + "spans": [ + { + "bbox": [ + 115, + 697, + 506, + 712 + ], + "score": 1.0, + "content": "Abbeel, and Wojciech Zaremba. Transfer from Simulation to Real World through Learning", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 114, + 709, + 504, + 722 + ], + "spans": [ + { + "bbox": [ + 114, + 709, + 504, + 722 + ], + "score": 1.0, + "content": "Deep Inverse Dynamics Model. October 2016. URL https://arxiv.org/abs/1610.", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 720, + 164, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 164, + 732 + ], + "score": 1.0, + "content": "03518v1.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 687, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 504, + 94 + ], + "score": 1.0, + "content": "Paul Dutting, Zhe Feng, Harikrishna Narasimhan, David Parkes, and Sai Srivatsa Ravindranath. ¨", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 505, + 108 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 505, + 108 + ], + "score": 1.0, + "content": "Optimal auctions through deep learning. In International Conference on Machine Learning, pp.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 117, + 104, + 191, + 116 + ], + "spans": [ + { + "bbox": [ + 117, + 104, + 191, + 116 + ], + "score": 1.0, + "content": "1706–1715, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 124, + 503, + 147 + ], + "lines": [ + { + "bbox": [ + 106, + 124, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 505, + 137 + ], + "score": 1.0, + "content": "Tanner Fiez, Benjamin Chasnov, and Lillian J. Ratliff. Convergence of Learning Dynamics in Stack-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 136, + 459, + 149 + ], + "spans": [ + { + "bbox": [ + 116, + 136, + 459, + 149 + ], + "score": 1.0, + "content": "elberg Games. arXiv, jun 2019. URL http://arxiv.org/abs/1906.01217.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 156, + 505, + 190 + ], + "lines": [ + { + "bbox": [ + 106, + 156, + 505, + 169 + ], + "spans": [ + { + "bbox": [ + 106, + 156, + 505, + 169 + ], + "score": 1.0, + "content": "Chelsea Finn, Pieter Abbeel, and Sergey Levine. Model-Agnostic Meta-Learning for Fast Adapta-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 167, + 504, + 180 + ], + "spans": [ + { + "bbox": [ + 116, + 167, + 504, + 180 + ], + "score": 1.0, + "content": "tion of Deep Networks. arXiv:1703.03400 [cs], July 2017. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 117, + 178, + 262, + 189 + ], + "spans": [ + { + "bbox": [ + 117, + 178, + 262, + 189 + ], + "score": 1.0, + "content": "1703.03400. arXiv: 1703.03400.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 107, + 198, + 264, + 210 + ], + "lines": [ + { + "bbox": [ + 106, + 198, + 266, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 266, + 211 + ], + "score": 1.0, + "content": "C. Gini. Variabilita e mutabilit ` a` . 1912.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 219, + 505, + 253 + ], + "lines": [ + { + "bbox": [ + 105, + 218, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 505, + 232 + ], + "score": 1.0, + "content": "Irina Higgins, Arka Pal, Andrei A Rusu, Loic Matthey, Christopher P Burgess, Alexander Pritzel,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 230, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 115, + 230, + 505, + 243 + ], + "score": 1.0, + "content": "Matthew Botvinick, Charles Blundell, and Alexander Lerchner. Darla: Improving zero-shot trans-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 241, + 399, + 254 + ], + "spans": [ + { + "bbox": [ + 115, + 241, + 399, + 254 + ], + "score": 1.0, + "content": "fer in reinforcement learning. arXiv preprint arXiv:1707.08475, 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 107, + 261, + 505, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 262, + 504, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 504, + 273 + ], + "score": 1.0, + "content": "John H. Holland and John H. Miller. Artificial Adaptive Agents in Economic Theory. American Eco-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 273, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 115, + 273, + 505, + 285 + ], + "score": 1.0, + "content": "nomic Review, 81(2):365–71, 1991. URL https://econpapers.repec.org/article/", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 285, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 115, + 285, + 506, + 295 + ], + "score": 1.0, + "content": "aeaaecrev/v_3a81_3ay_3a1991_3ai_3a2_3ap_3a365-71.htm. Publisher: Amer-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 295, + 230, + 307 + ], + "spans": [ + { + "bbox": [ + 116, + 295, + 230, + 307 + ], + "score": 1.0, + "content": "ican Economic Association.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 315, + 505, + 348 + ], + "lines": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "score": 1.0, + "content": "Linfang Hou, Liang Pang, Xin Hong, Yanyan Lan, Zhiming Ma, and Dawei Yin. Robust Rein-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 326, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 116, + 326, + 505, + 338 + ], + "score": 1.0, + "content": "forcement Learning with Wasserstein Constraint. arXiv:2006.00945 [cs, stat], June 2020. URL", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 336, + 389, + 349 + ], + "spans": [ + { + "bbox": [ + 116, + 336, + 389, + 349 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/2006.00945. arXiv: 2006.00945.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 357, + 505, + 402 + ], + "lines": [ + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "Peter Howitt. What have central bankers learned from modern macroeconomic theory? Jour-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 115, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "nal of Macroeconomics, 34(1):11–22, March 2012. ISSN 0164-0704. doi: 10.1016/j.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 380, + 504, + 392 + ], + "spans": [ + { + "bbox": [ + 115, + 380, + 504, + 392 + ], + "score": 1.0, + "content": "jmacro.2011.08.005. URL http://www.sciencedirect.com/science/article/", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 114, + 390, + 248, + 402 + ], + "spans": [ + { + "bbox": [ + 114, + 390, + 248, + 402 + ], + "score": 1.0, + "content": "pii/S0164070411000619.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5 + }, + { + "type": "text", + "bbox": [ + 106, + 411, + 506, + 456 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 506, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 506, + 424 + ], + "score": 1.0, + "content": "Stephen James, Paul Wohlhart, Mrinal Kalakrishnan, Dmitry Kalashnikov, Alex Irpan, Julian Ibarz,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 422, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 115, + 422, + 506, + 434 + ], + "score": 1.0, + "content": "Sergey Levine, Raia Hadsell, and Konstantinos Bousmalis. Sim-to-real via sim-to-sim: Data-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 433, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 116, + 433, + 506, + 446 + ], + "score": 1.0, + "content": "efficient robotic grasping via randomized-to-canonical adaptation networks. In Proceedings of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 444, + 487, + 456 + ], + "spans": [ + { + "bbox": [ + 115, + 444, + 487, + 456 + ], + "score": 1.0, + "content": "the IEEE Conference on Computer Vision and Pattern Recognition, pp. 12627–12637, 2019.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 106, + 464, + 505, + 498 + ], + "lines": [ + { + "bbox": [ + 106, + 464, + 504, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 504, + 478 + ], + "score": 1.0, + "content": "Kun Ho Kim, Yihong Gu, Jiaming Song, Shengjia Zhao, and Stefano Ermon. Cross Domain Im-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 475, + 504, + 489 + ], + "spans": [ + { + "bbox": [ + 115, + 475, + 504, + 489 + ], + "score": 1.0, + "content": "itation Learning. arXiv:1910.00105 [cs, stat], September 2019. URL http://arxiv.org/", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 487, + 286, + 498 + ], + "spans": [ + { + "bbox": [ + 116, + 487, + 286, + 498 + ], + "score": 1.0, + "content": "abs/1910.00105. arXiv: 1910.00105.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 504, + 541 + ], + "lines": [ + { + "bbox": [ + 105, + 506, + 504, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 504, + 519 + ], + "score": 1.0, + "content": "Alan P. Kirman. Whom or What Does the Representative Individual Represent? Journal of Eco-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 116, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "nomic Perspectives, 6(2):117–136, June 1992. ISSN 0895-3309. doi: 10.1257/jep.6.2.117. URL", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 528, + 445, + 542 + ], + "spans": [ + { + "bbox": [ + 116, + 528, + 445, + 542 + ], + "score": 1.0, + "content": "https://www.aeaweb.org/articles?id=10.1257/jep.6.2.117.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 549, + 505, + 593 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "score": 1.0, + "content": "Shihui Li, Yi Wu, Xinyue Cui, Honghua Dong, Fei Fang, and Stuart Russell. Robust Multi-Agent", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 560, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 116, + 560, + 505, + 572 + ], + "score": 1.0, + "content": "Reinforcement Learning via Minimax Deep Deterministic Policy Gradient. Proceedings of the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 114, + 570, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 114, + 570, + 506, + 585 + ], + "score": 1.0, + "content": "AAAI Conference on Artificial Intelligence, 33:4213–4220, July 2019. doi: 10.1609/aaai.v33i01.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 582, + 162, + 593 + ], + "spans": [ + { + "bbox": [ + 115, + 582, + 162, + 593 + ], + "score": 1.0, + "content": "33014213.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 106, + 602, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 105, + 601, + 505, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 256, + 615 + ], + "score": 1.0, + "content": "Jun Morimoto and Kenji Doya.", + "type": "text" + }, + { + "bbox": [ + 269, + 601, + 505, + 615 + ], + "score": 1.0, + "content": "Robust Reinforcement Learning. In T. K. Leen,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 613, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 115, + 613, + 505, + 626 + ], + "score": 1.0, + "content": "T. G. Dietterich, and V. Tresp (eds.), Advances in Neural Information Processing Sys-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 115, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "tems 13, pp. 1061–1067. MIT Press, 2001. URL http://papers.nips.cc/paper/", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 636, + 351, + 648 + ], + "spans": [ + { + "bbox": [ + 116, + 636, + 351, + 648 + ], + "score": 1.0, + "content": "1841-robust-reinforcement-learning.pdf.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 106, + 656, + 504, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 656, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 106, + 656, + 505, + 668 + ], + "score": 1.0, + "content": "Roger B. Myerson. Mechanism Design, pp. 1–13. Palgrave Macmillan UK, London, 2016. ISBN", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 666, + 504, + 680 + ], + "spans": [ + { + "bbox": [ + 115, + 666, + 504, + 680 + ], + "score": 1.0, + "content": "978-1-349-95121-5. doi: 10.1057/978-1-349-95121-5 2675-1. URL https://doi.org/", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 117, + 678, + 315, + 689 + ], + "spans": [ + { + "bbox": [ + 117, + 678, + 315, + 689 + ], + "score": 1.0, + "content": "10.1057/978-1-349-95121-5_2675-1.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Ofir Nachum, Michael Ahn, Hugo Ponte, Shixiang Gu, and Vikash Kumar. Multi-Agent Manipula-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 709, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 721 + ], + "score": 1.0, + "content": "tion via Locomotion using Hierarchical Sim2Real. arXiv:1908.05224 [cs], October 2019. URL", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 720, + 388, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 388, + 732 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1908.05224. arXiv: 1908.05224.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45 + } + ], + "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, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 504, + 94 + ], + "score": 1.0, + "content": "Paul Dutting, Zhe Feng, Harikrishna Narasimhan, David Parkes, and Sai Srivatsa Ravindranath. ¨", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 92, + 505, + 108 + ], + "spans": [ + { + "bbox": [ + 115, + 92, + 505, + 108 + ], + "score": 1.0, + "content": "Optimal auctions through deep learning. In International Conference on Machine Learning, pp.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 117, + 104, + 191, + 116 + ], + "spans": [ + { + "bbox": [ + 117, + 104, + 191, + 116 + ], + "score": 1.0, + "content": "1706–1715, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 82, + 505, + 116 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 124, + 503, + 147 + ], + "lines": [ + { + "bbox": [ + 106, + 124, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 505, + 137 + ], + "score": 1.0, + "content": "Tanner Fiez, Benjamin Chasnov, and Lillian J. Ratliff. Convergence of Learning Dynamics in Stack-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 136, + 459, + 149 + ], + "spans": [ + { + "bbox": [ + 116, + 136, + 459, + 149 + ], + "score": 1.0, + "content": "elberg Games. arXiv, jun 2019. URL http://arxiv.org/abs/1906.01217.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 106, + 124, + 505, + 149 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 156, + 505, + 190 + ], + "lines": [ + { + "bbox": [ + 106, + 156, + 505, + 169 + ], + "spans": [ + { + "bbox": [ + 106, + 156, + 505, + 169 + ], + "score": 1.0, + "content": "Chelsea Finn, Pieter Abbeel, and Sergey Levine. Model-Agnostic Meta-Learning for Fast Adapta-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 167, + 504, + 180 + ], + "spans": [ + { + "bbox": [ + 116, + 167, + 504, + 180 + ], + "score": 1.0, + "content": "tion of Deep Networks. arXiv:1703.03400 [cs], July 2017. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 117, + 178, + 262, + 189 + ], + "spans": [ + { + "bbox": [ + 117, + 178, + 262, + 189 + ], + "score": 1.0, + "content": "1703.03400. arXiv: 1703.03400.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 156, + 505, + 189 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 198, + 264, + 210 + ], + "lines": [ + { + "bbox": [ + 106, + 198, + 266, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 266, + 211 + ], + "score": 1.0, + "content": "C. Gini. Variabilita e mutabilit ` a` . 1912.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 198, + 266, + 211 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 219, + 505, + 253 + ], + "lines": [ + { + "bbox": [ + 105, + 218, + 505, + 232 + ], + "spans": [ + { + "bbox": [ + 105, + 218, + 505, + 232 + ], + "score": 1.0, + "content": "Irina Higgins, Arka Pal, Andrei A Rusu, Loic Matthey, Christopher P Burgess, Alexander Pritzel,", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 230, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 115, + 230, + 505, + 243 + ], + "score": 1.0, + "content": "Matthew Botvinick, Charles Blundell, and Alexander Lerchner. Darla: Improving zero-shot trans-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 241, + 399, + 254 + ], + "spans": [ + { + "bbox": [ + 115, + 241, + 399, + 254 + ], + "score": 1.0, + "content": "fer in reinforcement learning. arXiv preprint arXiv:1707.08475, 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 218, + 505, + 254 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 261, + 505, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 262, + 504, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 262, + 504, + 273 + ], + "score": 1.0, + "content": "John H. Holland and John H. Miller. Artificial Adaptive Agents in Economic Theory. American Eco-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 273, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 115, + 273, + 505, + 285 + ], + "score": 1.0, + "content": "nomic Review, 81(2):365–71, 1991. URL https://econpapers.repec.org/article/", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 285, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 115, + 285, + 506, + 295 + ], + "score": 1.0, + "content": "aeaaecrev/v_3a81_3ay_3a1991_3ai_3a2_3ap_3a365-71.htm. Publisher: Amer-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 295, + 230, + 307 + ], + "spans": [ + { + "bbox": [ + 116, + 295, + 230, + 307 + ], + "score": 1.0, + "content": "ican Economic Association.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 262, + 506, + 307 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 315, + 505, + 348 + ], + "lines": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 505, + 328 + ], + "score": 1.0, + "content": "Linfang Hou, Liang Pang, Xin Hong, Yanyan Lan, Zhiming Ma, and Dawei Yin. Robust Rein-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 326, + 505, + 338 + ], + "spans": [ + { + "bbox": [ + 116, + 326, + 505, + 338 + ], + "score": 1.0, + "content": "forcement Learning with Wasserstein Constraint. arXiv:2006.00945 [cs, stat], June 2020. URL", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 116, + 336, + 389, + 349 + ], + "spans": [ + { + "bbox": [ + 116, + 336, + 389, + 349 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/2006.00945. arXiv: 2006.00945.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 315, + 505, + 349 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 357, + 505, + 402 + ], + "lines": [ + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 505, + 369 + ], + "score": 1.0, + "content": "Peter Howitt. What have central bankers learned from modern macroeconomic theory? Jour-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 115, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "nal of Macroeconomics, 34(1):11–22, March 2012. ISSN 0164-0704. doi: 10.1016/j.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 380, + 504, + 392 + ], + "spans": [ + { + "bbox": [ + 115, + 380, + 504, + 392 + ], + "score": 1.0, + "content": "jmacro.2011.08.005. URL http://www.sciencedirect.com/science/article/", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 114, + 390, + 248, + 402 + ], + "spans": [ + { + "bbox": [ + 114, + 390, + 248, + 402 + ], + "score": 1.0, + "content": "pii/S0164070411000619.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5, + "bbox_fs": [ + 106, + 357, + 505, + 402 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 411, + 506, + 456 + ], + "lines": [ + { + "bbox": [ + 105, + 410, + 506, + 424 + ], + "spans": [ + { + "bbox": [ + 105, + 410, + 506, + 424 + ], + "score": 1.0, + "content": "Stephen James, Paul Wohlhart, Mrinal Kalakrishnan, Dmitry Kalashnikov, Alex Irpan, Julian Ibarz,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 115, + 422, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 115, + 422, + 506, + 434 + ], + "score": 1.0, + "content": "Sergey Levine, Raia Hadsell, and Konstantinos Bousmalis. Sim-to-real via sim-to-sim: Data-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 116, + 433, + 506, + 446 + ], + "spans": [ + { + "bbox": [ + 116, + 433, + 506, + 446 + ], + "score": 1.0, + "content": "efficient robotic grasping via randomized-to-canonical adaptation networks. In Proceedings of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 444, + 487, + 456 + ], + "spans": [ + { + "bbox": [ + 115, + 444, + 487, + 456 + ], + "score": 1.0, + "content": "the IEEE Conference on Computer Vision and Pattern Recognition, pp. 12627–12637, 2019.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 410, + 506, + 456 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 464, + 505, + 498 + ], + "lines": [ + { + "bbox": [ + 106, + 464, + 504, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 464, + 504, + 478 + ], + "score": 1.0, + "content": "Kun Ho Kim, Yihong Gu, Jiaming Song, Shengjia Zhao, and Stefano Ermon. Cross Domain Im-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 475, + 504, + 489 + ], + "spans": [ + { + "bbox": [ + 115, + 475, + 504, + 489 + ], + "score": 1.0, + "content": "itation Learning. arXiv:1910.00105 [cs, stat], September 2019. URL http://arxiv.org/", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 116, + 487, + 286, + 498 + ], + "spans": [ + { + "bbox": [ + 116, + 487, + 286, + 498 + ], + "score": 1.0, + "content": "abs/1910.00105. arXiv: 1910.00105.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 106, + 464, + 504, + 498 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 504, + 541 + ], + "lines": [ + { + "bbox": [ + 105, + 506, + 504, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 504, + 519 + ], + "score": 1.0, + "content": "Alan P. Kirman. Whom or What Does the Representative Individual Represent? Journal of Eco-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 518, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 116, + 518, + 505, + 530 + ], + "score": 1.0, + "content": "nomic Perspectives, 6(2):117–136, June 1992. ISSN 0895-3309. doi: 10.1257/jep.6.2.117. URL", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 528, + 445, + 542 + ], + "spans": [ + { + "bbox": [ + 116, + 528, + 445, + 542 + ], + "score": 1.0, + "content": "https://www.aeaweb.org/articles?id=10.1257/jep.6.2.117.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 105, + 506, + 505, + 542 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 549, + 505, + 593 + ], + "lines": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "spans": [ + { + "bbox": [ + 105, + 549, + 506, + 562 + ], + "score": 1.0, + "content": "Shihui Li, Yi Wu, Xinyue Cui, Honghua Dong, Fei Fang, and Stuart Russell. Robust Multi-Agent", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 560, + 505, + 572 + ], + "spans": [ + { + "bbox": [ + 116, + 560, + 505, + 572 + ], + "score": 1.0, + "content": "Reinforcement Learning via Minimax Deep Deterministic Policy Gradient. Proceedings of the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 114, + 570, + 506, + 585 + ], + "spans": [ + { + "bbox": [ + 114, + 570, + 506, + 585 + ], + "score": 1.0, + "content": "AAAI Conference on Artificial Intelligence, 33:4213–4220, July 2019. doi: 10.1609/aaai.v33i01.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 582, + 162, + 593 + ], + "spans": [ + { + "bbox": [ + 115, + 582, + 162, + 593 + ], + "score": 1.0, + "content": "33014213.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 549, + 506, + 593 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 602, + 505, + 648 + ], + "lines": [ + { + "bbox": [ + 105, + 601, + 505, + 615 + ], + "spans": [ + { + "bbox": [ + 105, + 601, + 256, + 615 + ], + "score": 1.0, + "content": "Jun Morimoto and Kenji Doya.", + "type": "text" + }, + { + "bbox": [ + 269, + 601, + 505, + 615 + ], + "score": 1.0, + "content": "Robust Reinforcement Learning. In T. K. Leen,", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 613, + 505, + 626 + ], + "spans": [ + { + "bbox": [ + 115, + 613, + 505, + 626 + ], + "score": 1.0, + "content": "T. G. Dietterich, and V. Tresp (eds.), Advances in Neural Information Processing Sys-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 624, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 115, + 624, + 505, + 637 + ], + "score": 1.0, + "content": "tems 13, pp. 1061–1067. MIT Press, 2001. URL http://papers.nips.cc/paper/", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 636, + 351, + 648 + ], + "spans": [ + { + "bbox": [ + 116, + 636, + 351, + 648 + ], + "score": 1.0, + "content": "1841-robust-reinforcement-learning.pdf.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 601, + 505, + 648 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 656, + 504, + 689 + ], + "lines": [ + { + "bbox": [ + 106, + 656, + 505, + 668 + ], + "spans": [ + { + "bbox": [ + 106, + 656, + 505, + 668 + ], + "score": 1.0, + "content": "Roger B. Myerson. Mechanism Design, pp. 1–13. Palgrave Macmillan UK, London, 2016. ISBN", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 666, + 504, + 680 + ], + "spans": [ + { + "bbox": [ + 115, + 666, + 504, + 680 + ], + "score": 1.0, + "content": "978-1-349-95121-5. doi: 10.1057/978-1-349-95121-5 2675-1. URL https://doi.org/", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 117, + 678, + 315, + 689 + ], + "spans": [ + { + "bbox": [ + 117, + 678, + 315, + 689 + ], + "score": 1.0, + "content": "10.1057/978-1-349-95121-5_2675-1.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 106, + 656, + 505, + 689 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "Ofir Nachum, Michael Ahn, Hugo Ponte, Shixiang Gu, and Vikash Kumar. Multi-Agent Manipula-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 709, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 721 + ], + "score": 1.0, + "content": "tion via Locomotion using Hierarchical Sim2Real. arXiv:1908.05224 [cs], October 2019. URL", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 720, + 388, + 732 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 388, + 732 + ], + "score": 1.0, + "content": "http://arxiv.org/abs/1908.05224. arXiv: 1908.05224.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45, + "bbox_fs": [ + 106, + 699, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 503, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Alex Nichol, Joshua Achiam, and John Schulman. On First-Order Meta-Learning Algorithms.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "arXiv:1803.02999 [cs], October 2018. URL http://arxiv.org/abs/1803.02999.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 197, + 116 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 197, + 116 + ], + "score": 1.0, + "content": "arXiv: 1803.02999.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 109, + 124, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 125, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 505, + 137 + ], + "score": 1.0, + "content": "Santiago Paternain, Luiz F. O. Chamon, Miguel Calvo-Fullana, and Alejandro Ribeiro. Constrained", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 136, + 505, + 148 + ], + "spans": [ + { + "bbox": [ + 116, + 136, + 505, + 148 + ], + "score": 1.0, + "content": "Reinforcement Learning Has Zero Duality Gap. arXiv:1910.13393 [cs, math, stat], October 2019.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 146, + 411, + 160 + ], + "spans": [ + { + "bbox": [ + 116, + 146, + 411, + 160 + ], + "score": 1.0, + "content": "URL http://arxiv.org/abs/1910.13393. arXiv: 1910.13393.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 106, + 167, + 505, + 212 + ], + "lines": [ + { + "bbox": [ + 105, + 167, + 505, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 167, + 505, + 180 + ], + "score": 1.0, + "content": "Xue Bin Peng, Marcin Andrychowicz, Wojciech Zaremba, and Pieter Abbeel. Sim-to-Real Trans-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 178, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 115, + 178, + 505, + 191 + ], + "score": 1.0, + "content": "fer of Robotic Control with Dynamics Randomization. 2018 IEEE International Conference on", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 189, + 506, + 203 + ], + "spans": [ + { + "bbox": [ + 115, + 189, + 506, + 203 + ], + "score": 1.0, + "content": "Robotics and Automation (ICRA), pp. 3803–3810, May 2018. doi: 10.1109/ICRA.2018.8460528.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 200, + 412, + 213 + ], + "spans": [ + { + "bbox": [ + 116, + 200, + 412, + 213 + ], + "score": 1.0, + "content": "URL http://arxiv.org/abs/1710.06537. arXiv: 1710.06537.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 105, + 220, + 504, + 244 + ], + "lines": [ + { + "bbox": [ + 106, + 219, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 505, + 233 + ], + "score": 1.0, + "content": "Wolfgang Pesendorfer. Behavioral economics comes of age: A review essay on advances in behav-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 231, + 406, + 244 + ], + "spans": [ + { + "bbox": [ + 115, + 231, + 406, + 244 + ], + "score": 1.0, + "content": "ioral economics. Journal of Economic Literature, 44(3):712–721, 2006.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 106, + 252, + 504, + 286 + ], + "lines": [ + { + "bbox": [ + 106, + 252, + 504, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 504, + 264 + ], + "score": 1.0, + "content": "Lerrel Pinto, James Davidson, Rahul Sukthankar, and Abhinav Gupta. Robust Adversarial Rein-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 263, + 504, + 275 + ], + "spans": [ + { + "bbox": [ + 116, + 263, + 504, + 275 + ], + "score": 1.0, + "content": "forcement Learning. arXiv:1703.02702 [cs], March 2017. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 117, + 275, + 262, + 285 + ], + "spans": [ + { + "bbox": [ + 117, + 275, + 262, + 285 + ], + "score": 1.0, + "content": "1703.02702. arXiv: 1703.02702.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 505, + 328 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 505, + 307 + ], + "score": 1.0, + "content": "Lillian J. Ratliff, Samuel A. Burden, and S. Shankar Sastry. On the Characterization of Local", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 114, + 304, + 505, + 319 + ], + "spans": [ + { + "bbox": [ + 114, + 304, + 505, + 319 + ], + "score": 1.0, + "content": "Nash Equilibria in Continuous Games. arXiv:1411.2168 [math], November 2014. URL http:", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 316, + 348, + 328 + ], + "spans": [ + { + "bbox": [ + 116, + 316, + 348, + 328 + ], + "score": 1.0, + "content": "//arxiv.org/abs/1411.2168. arXiv: 1411.2168.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 336, + 504, + 370 + ], + "lines": [ + { + "bbox": [ + 106, + 337, + 504, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 337, + 504, + 348 + ], + "score": 1.0, + "content": "Andrei A. Rusu, Mel Vecerik, Thomas Rothorl, Nicolas Heess, Razvan Pascanu, and Raia Hadsell.¨", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 348, + 504, + 360 + ], + "spans": [ + { + "bbox": [ + 116, + 348, + 504, + 360 + ], + "score": 1.0, + "content": "Sim-to-Real Robot Learning from Pixels with Progressive Nets. October 2016. URL https:", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 117, + 359, + 289, + 371 + ], + "spans": [ + { + "bbox": [ + 117, + 359, + 289, + 371 + ], + "score": 1.0, + "content": "//arxiv.org/abs/1610.04286v2.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 105, + 379, + 505, + 413 + ], + "lines": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "score": 1.0, + "content": "John Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, and Pieter Abbeel. Trust Region", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 390, + 504, + 403 + ], + "spans": [ + { + "bbox": [ + 116, + 390, + 504, + 403 + ], + "score": 1.0, + "content": "Policy Optimization. arXiv:1502.05477 [cs], April 2017. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 117, + 402, + 263, + 412 + ], + "spans": [ + { + "bbox": [ + 117, + 402, + 263, + 412 + ], + "score": 1.0, + "content": "1502.05477. arXiv: 1502.05477.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 105, + 421, + 504, + 445 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "Florian Schafer and Anima Anandkumar. Competitive Gradient Descent. ¨ arXiv:1905.12103 [cs,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 433, + 487, + 445 + ], + "spans": [ + { + "bbox": [ + 115, + 433, + 487, + 445 + ], + "score": 1.0, + "content": "math], June 2020. URL http://arxiv.org/abs/1905.12103. arXiv: 1905.12103.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "text", + "bbox": [ + 106, + 453, + 506, + 498 + ], + "lines": [ + { + "bbox": [ + 105, + 452, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 506, + 467 + ], + "score": 1.0, + "content": "Herbert A. Simon. From substantive to procedural rationality. In T. J. Kastelein, S. K. Kuipers,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 464, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 116, + 464, + 506, + 477 + ], + "score": 1.0, + "content": "W. A. Nijenhuis, and G. R. Wagenaar (eds.), 25 Years of Economic Theory: Retrospect and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 114, + 476, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 114, + 476, + 506, + 487 + ], + "score": 1.0, + "content": "prospect, pp. 65–86. Springer US, Boston, MA, 1976. ISBN 978-1-4613-4367-7. doi: 10.1007/", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 486, + 498, + 499 + ], + "spans": [ + { + "bbox": [ + 115, + 486, + 498, + 499 + ], + "score": 1.0, + "content": "978-1-4613-4367-7 6. URL https://doi.org/10.1007/978-1-4613-4367-7_6.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5 + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 506, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 507, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 505, + 519 + ], + "score": 1.0, + "content": "Herbert A. Simon and Jonathan Schaeffer. The Game of Chess. Technical report, CARNEGIE-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 518, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 115, + 518, + 505, + 529 + ], + "score": 1.0, + "content": "MELLON UNIV PITTSBURGH PA ARTIFICIAL INTELLIGENCE AND PSYCHOL-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 529, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 115, + 529, + 505, + 542 + ], + "score": 1.0, + "content": "OGY PROJECT, December 1990. URL https://apps.dtic.mil/sti/citations/", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 540, + 289, + 552 + ], + "spans": [ + { + "bbox": [ + 115, + 540, + 289, + 552 + ], + "score": 1.0, + "content": "ADA225613. Section: Technical Reports.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 107, + 560, + 504, + 573 + ], + "spans": [ + { + "bbox": [ + 107, + 560, + 504, + 573 + ], + "score": 1.0, + "content": "Young-Ho Suh, Sung-Pil Woo, Hyunhak Kim, and Dong-Hwan Park. A sim2real framework en-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 570, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 116, + 570, + 505, + 584 + ], + "score": 1.0, + "content": "abling decentralized agents to execute MADDPG tasks. In Proceedings of the Workshop on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 581, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 115, + 581, + 506, + 596 + ], + "score": 1.0, + "content": "Distributed Infrastructures for Deep Learning, DIDL ’19, pp. 1–6, Davis, CA, USA, December", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 593, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 115, + 593, + 505, + 606 + ], + "score": 1.0, + "content": "2019. Association for Computing Machinery. ISBN 978-1-4503-7037-0. doi: 10.1145/3366622.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 604, + 418, + 616 + ], + "spans": [ + { + "bbox": [ + 116, + 604, + 418, + 616 + ], + "score": 1.0, + "content": "3368146. URL https://doi.org/10.1145/3366622.3368146.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 105, + 624, + 504, + 637 + ], + "lines": [ + { + "bbox": [ + 105, + 623, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 505, + 637 + ], + "score": 1.0, + "content": "Richard S. Sutton and Andrew G. Barto. Reinforcement learning: An introduction. MIT press, 2018.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39 + }, + { + "type": "text", + "bbox": [ + 106, + 645, + 503, + 678 + ], + "lines": [ + { + "bbox": [ + 106, + 644, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 657 + ], + "score": 1.0, + "content": "Chen Tessler, Yonathan Efroni, and Shie Mannor. Action Robust Reinforcement Learning and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 117, + 656, + 504, + 668 + ], + "spans": [ + { + "bbox": [ + 117, + 656, + 504, + 668 + ], + "score": 1.0, + "content": "Applications in Continuous Control. arXiv:1901.09184 [cs, stat], May 2019. URL http://", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 667, + 347, + 678 + ], + "spans": [ + { + "bbox": [ + 115, + 667, + 347, + 678 + ], + "score": 1.0, + "content": "arxiv.org/abs/1901.09184. arXiv: 1901.09184.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 106, + 687, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "Josh Tobin, Rachel Fong, Alex Ray, Jonas Schneider, Wojciech Zaremba, and Pieter Abbeel. Do-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 115, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "main Randomization for Transferring Deep Neural Networks from Simulation to the Real World.", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "arXiv:1703.06907 [cs], March 2017. URL http://arxiv.org/abs/1703.06907. arXiv:", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 721, + 169, + 731 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 169, + 731 + ], + "score": 1.0, + "content": "1703.06907.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.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, + 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": [ + 107, + 82, + 503, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Alex Nichol, Joshua Achiam, and John Schulman. On First-Order Meta-Learning Algorithms.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "arXiv:1803.02999 [cs], October 2018. URL http://arxiv.org/abs/1803.02999.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 197, + 116 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 197, + 116 + ], + "score": 1.0, + "content": "arXiv: 1803.02999.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 505, + 116 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 124, + 505, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 125, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 505, + 137 + ], + "score": 1.0, + "content": "Santiago Paternain, Luiz F. O. Chamon, Miguel Calvo-Fullana, and Alejandro Ribeiro. Constrained", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 116, + 136, + 505, + 148 + ], + "spans": [ + { + "bbox": [ + 116, + 136, + 505, + 148 + ], + "score": 1.0, + "content": "Reinforcement Learning Has Zero Duality Gap. arXiv:1910.13393 [cs, math, stat], October 2019.", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 116, + 146, + 411, + 160 + ], + "spans": [ + { + "bbox": [ + 116, + 146, + 411, + 160 + ], + "score": 1.0, + "content": "URL http://arxiv.org/abs/1910.13393. arXiv: 1910.13393.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 125, + 505, + 160 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 167, + 505, + 212 + ], + "lines": [ + { + "bbox": [ + 105, + 167, + 505, + 180 + ], + "spans": [ + { + "bbox": [ + 105, + 167, + 505, + 180 + ], + "score": 1.0, + "content": "Xue Bin Peng, Marcin Andrychowicz, Wojciech Zaremba, and Pieter Abbeel. Sim-to-Real Trans-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 115, + 178, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 115, + 178, + 505, + 191 + ], + "score": 1.0, + "content": "fer of Robotic Control with Dynamics Randomization. 2018 IEEE International Conference on", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 189, + 506, + 203 + ], + "spans": [ + { + "bbox": [ + 115, + 189, + 506, + 203 + ], + "score": 1.0, + "content": "Robotics and Automation (ICRA), pp. 3803–3810, May 2018. doi: 10.1109/ICRA.2018.8460528.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 116, + 200, + 412, + 213 + ], + "spans": [ + { + "bbox": [ + 116, + 200, + 412, + 213 + ], + "score": 1.0, + "content": "URL http://arxiv.org/abs/1710.06537. arXiv: 1710.06537.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 167, + 506, + 213 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 220, + 504, + 244 + ], + "lines": [ + { + "bbox": [ + 106, + 219, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 106, + 219, + 505, + 233 + ], + "score": 1.0, + "content": "Wolfgang Pesendorfer. Behavioral economics comes of age: A review essay on advances in behav-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 231, + 406, + 244 + ], + "spans": [ + { + "bbox": [ + 115, + 231, + 406, + 244 + ], + "score": 1.0, + "content": "ioral economics. Journal of Economic Literature, 44(3):712–721, 2006.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 106, + 219, + 505, + 244 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 252, + 504, + 286 + ], + "lines": [ + { + "bbox": [ + 106, + 252, + 504, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 504, + 264 + ], + "score": 1.0, + "content": "Lerrel Pinto, James Davidson, Rahul Sukthankar, and Abhinav Gupta. Robust Adversarial Rein-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 116, + 263, + 504, + 275 + ], + "spans": [ + { + "bbox": [ + 116, + 263, + 504, + 275 + ], + "score": 1.0, + "content": "forcement Learning. arXiv:1703.02702 [cs], March 2017. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 117, + 275, + 262, + 285 + ], + "spans": [ + { + "bbox": [ + 117, + 275, + 262, + 285 + ], + "score": 1.0, + "content": "1703.02702. arXiv: 1703.02702.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 252, + 504, + 285 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 294, + 505, + 328 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 505, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 505, + 307 + ], + "score": 1.0, + "content": "Lillian J. Ratliff, Samuel A. Burden, and S. Shankar Sastry. On the Characterization of Local", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 114, + 304, + 505, + 319 + ], + "spans": [ + { + "bbox": [ + 114, + 304, + 505, + 319 + ], + "score": 1.0, + "content": "Nash Equilibria in Continuous Games. arXiv:1411.2168 [math], November 2014. URL http:", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 316, + 348, + 328 + ], + "spans": [ + { + "bbox": [ + 116, + 316, + 348, + 328 + ], + "score": 1.0, + "content": "//arxiv.org/abs/1411.2168. arXiv: 1411.2168.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 294, + 505, + 328 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 336, + 504, + 370 + ], + "lines": [ + { + "bbox": [ + 106, + 337, + 504, + 348 + ], + "spans": [ + { + "bbox": [ + 106, + 337, + 504, + 348 + ], + "score": 1.0, + "content": "Andrei A. Rusu, Mel Vecerik, Thomas Rothorl, Nicolas Heess, Razvan Pascanu, and Raia Hadsell.¨", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 348, + 504, + 360 + ], + "spans": [ + { + "bbox": [ + 116, + 348, + 504, + 360 + ], + "score": 1.0, + "content": "Sim-to-Real Robot Learning from Pixels with Progressive Nets. October 2016. URL https:", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 117, + 359, + 289, + 371 + ], + "spans": [ + { + "bbox": [ + 117, + 359, + 289, + 371 + ], + "score": 1.0, + "content": "//arxiv.org/abs/1610.04286v2.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 106, + 337, + 504, + 371 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 379, + 505, + 413 + ], + "lines": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 505, + 392 + ], + "score": 1.0, + "content": "John Schulman, Sergey Levine, Philipp Moritz, Michael I. Jordan, and Pieter Abbeel. Trust Region", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 390, + 504, + 403 + ], + "spans": [ + { + "bbox": [ + 116, + 390, + 504, + 403 + ], + "score": 1.0, + "content": "Policy Optimization. arXiv:1502.05477 [cs], April 2017. URL http://arxiv.org/abs/", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 117, + 402, + 263, + 412 + ], + "spans": [ + { + "bbox": [ + 117, + 402, + 263, + 412 + ], + "score": 1.0, + "content": "1502.05477. arXiv: 1502.05477.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 378, + 505, + 412 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 421, + 504, + 445 + ], + "lines": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 105, + 421, + 505, + 435 + ], + "score": 1.0, + "content": "Florian Schafer and Anima Anandkumar. Competitive Gradient Descent. ¨ arXiv:1905.12103 [cs,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 433, + 487, + 445 + ], + "spans": [ + { + "bbox": [ + 115, + 433, + 487, + 445 + ], + "score": 1.0, + "content": "math], June 2020. URL http://arxiv.org/abs/1905.12103. arXiv: 1905.12103.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 421, + 505, + 445 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 453, + 506, + 498 + ], + "lines": [ + { + "bbox": [ + 105, + 452, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 105, + 452, + 506, + 467 + ], + "score": 1.0, + "content": "Herbert A. Simon. From substantive to procedural rationality. In T. J. Kastelein, S. K. Kuipers,", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 464, + 506, + 477 + ], + "spans": [ + { + "bbox": [ + 116, + 464, + 506, + 477 + ], + "score": 1.0, + "content": "W. A. Nijenhuis, and G. R. Wagenaar (eds.), 25 Years of Economic Theory: Retrospect and", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 114, + 476, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 114, + 476, + 506, + 487 + ], + "score": 1.0, + "content": "prospect, pp. 65–86. Springer US, Boston, MA, 1976. ISBN 978-1-4613-4367-7. doi: 10.1007/", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 486, + 498, + 499 + ], + "spans": [ + { + "bbox": [ + 115, + 486, + 498, + 499 + ], + "score": 1.0, + "content": "978-1-4613-4367-7 6. URL https://doi.org/10.1007/978-1-4613-4367-7_6.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 452, + 506, + 499 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 506, + 506, + 551 + ], + "lines": [ + { + "bbox": [ + 106, + 507, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 507, + 505, + 519 + ], + "score": 1.0, + "content": "Herbert A. Simon and Jonathan Schaeffer. The Game of Chess. Technical report, CARNEGIE-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 518, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 115, + 518, + 505, + 529 + ], + "score": 1.0, + "content": "MELLON UNIV PITTSBURGH PA ARTIFICIAL INTELLIGENCE AND PSYCHOL-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 529, + 505, + 542 + ], + "spans": [ + { + "bbox": [ + 115, + 529, + 505, + 542 + ], + "score": 1.0, + "content": "OGY PROJECT, December 1990. URL https://apps.dtic.mil/sti/citations/", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 540, + 289, + 552 + ], + "spans": [ + { + "bbox": [ + 115, + 540, + 289, + 552 + ], + "score": 1.0, + "content": "ADA225613. Section: Technical Reports.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 31.5, + "bbox_fs": [ + 106, + 507, + 505, + 552 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 560, + 505, + 616 + ], + "lines": [ + { + "bbox": [ + 107, + 560, + 504, + 573 + ], + "spans": [ + { + "bbox": [ + 107, + 560, + 504, + 573 + ], + "score": 1.0, + "content": "Young-Ho Suh, Sung-Pil Woo, Hyunhak Kim, and Dong-Hwan Park. A sim2real framework en-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 570, + 505, + 584 + ], + "spans": [ + { + "bbox": [ + 116, + 570, + 505, + 584 + ], + "score": 1.0, + "content": "abling decentralized agents to execute MADDPG tasks. In Proceedings of the Workshop on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 581, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 115, + 581, + 506, + 596 + ], + "score": 1.0, + "content": "Distributed Infrastructures for Deep Learning, DIDL ’19, pp. 1–6, Davis, CA, USA, December", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 593, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 115, + 593, + 505, + 606 + ], + "score": 1.0, + "content": "2019. Association for Computing Machinery. ISBN 978-1-4503-7037-0. doi: 10.1145/3366622.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 116, + 604, + 418, + 616 + ], + "spans": [ + { + "bbox": [ + 116, + 604, + 418, + 616 + ], + "score": 1.0, + "content": "3368146. URL https://doi.org/10.1145/3366622.3368146.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36, + "bbox_fs": [ + 107, + 560, + 506, + 616 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 624, + 504, + 637 + ], + "lines": [ + { + "bbox": [ + 105, + 623, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 505, + 637 + ], + "score": 1.0, + "content": "Richard S. Sutton and Andrew G. Barto. Reinforcement learning: An introduction. MIT press, 2018.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 39, + "bbox_fs": [ + 105, + 623, + 505, + 637 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 645, + 503, + 678 + ], + "lines": [ + { + "bbox": [ + 106, + 644, + 505, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 505, + 657 + ], + "score": 1.0, + "content": "Chen Tessler, Yonathan Efroni, and Shie Mannor. Action Robust Reinforcement Learning and", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 117, + 656, + 504, + 668 + ], + "spans": [ + { + "bbox": [ + 117, + 656, + 504, + 668 + ], + "score": 1.0, + "content": "Applications in Continuous Control. arXiv:1901.09184 [cs, stat], May 2019. URL http://", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 667, + 347, + 678 + ], + "spans": [ + { + "bbox": [ + 115, + 667, + 347, + 678 + ], + "score": 1.0, + "content": "arxiv.org/abs/1901.09184. arXiv: 1901.09184.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41, + "bbox_fs": [ + 106, + 644, + 505, + 678 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 687, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "Josh Tobin, Rachel Fong, Alex Ray, Jonas Schneider, Wojciech Zaremba, and Pieter Abbeel. Do-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 115, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "main Randomization for Transferring Deep Neural Networks from Simulation to the Real World.", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "arXiv:1703.06907 [cs], March 2017. URL http://arxiv.org/abs/1703.06907. arXiv:", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 116, + 721, + 169, + 731 + ], + "spans": [ + { + "bbox": [ + 116, + 721, + 169, + 731 + ], + "score": 1.0, + "content": "1703.06907.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 687, + 505, + 731 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 109, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Eric Tzeng, Coline Devin, Judy Hoffman, Chelsea Finn, Pieter Abbeel, Sergey Levine, Kate Saenko,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "and Trevor Darrell. Adapting Deep Visuomotor Representations with Weak Pairwise Constraints.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 418, + 117 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 418, + 117 + ], + "score": 1.0, + "content": "November 2015. URL https://arxiv.org/abs/1511.07111v5.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 123, + 505, + 167 + ], + "lines": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Stephan Zheng, Alexander Trott, Sunil Srinivasa, Nikhil Naik, Melvin Gruesbeck, David C. Parkes,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 505, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 505, + 146 + ], + "score": 1.0, + "content": "and Richard Socher. The AI Economist: Improving Equality and Productivity with AI-Driven", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 144, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 115, + 144, + 505, + 158 + ], + "score": 1.0, + "content": "Tax Policies. arXiv:2004.13332 [cs, econ, q-fin, stat], April 2020. URL http://arxiv.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 156, + 310, + 168 + ], + "spans": [ + { + "bbox": [ + 116, + 156, + 310, + 168 + ], + "score": 1.0, + "content": "org/abs/2004.13332. arXiv: 2004.13332.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + } + ], + "page_idx": 11, + "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": "12", + "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": [ + 109, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Eric Tzeng, Coline Devin, Judy Hoffman, Chelsea Finn, Pieter Abbeel, Sergey Levine, Kate Saenko,", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "and Trevor Darrell. Adapting Deep Visuomotor Representations with Weak Pairwise Constraints.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 418, + 117 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 418, + 117 + ], + "score": 1.0, + "content": "November 2015. URL https://arxiv.org/abs/1511.07111v5.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 81, + 505, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 123, + 505, + 167 + ], + "lines": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Stephan Zheng, Alexander Trott, Sunil Srinivasa, Nikhil Naik, Melvin Gruesbeck, David C. Parkes,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 505, + 146 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 505, + 146 + ], + "score": 1.0, + "content": "and Richard Socher. The AI Economist: Improving Equality and Productivity with AI-Driven", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 144, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 115, + 144, + 505, + 158 + ], + "score": 1.0, + "content": "Tax Policies. arXiv:2004.13332 [cs, econ, q-fin, stat], April 2020. URL http://arxiv.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 156, + 310, + 168 + ], + "spans": [ + { + "bbox": [ + 116, + 156, + 310, + 168 + ], + "score": 1.0, + "content": "org/abs/2004.13332. arXiv: 2004.13332.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 123, + 505, + 168 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/uIc4W6MtbDA/uIc4W6MtbDA_model.json b/parse/train/uIc4W6MtbDA/uIc4W6MtbDA_model.json new file mode 100644 index 0000000000000000000000000000000000000000..d2c7d472fba82918951356a575b3ba70d3481d7e --- /dev/null +++ b/parse/train/uIc4W6MtbDA/uIc4W6MtbDA_model.json @@ -0,0 +1,19672 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1529, + 1403, + 1529, + 1403, + 1866, + 298, + 1866 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1178, + 1403, + 1178, + 1403, + 1513, + 298, + 1513 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 398, + 589, + 1302, + 589, + 1302, + 1047, + 398, + 1047 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1881, + 1401, + 1881, + 1401, + 2034, + 298, + 2034 + ], + "score": 0.976 + }, + { + "category_id": 0, + "poly": [ + 300, + 218, + 1397, + 218, + 1397, + 324, + 300, + 324 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 313, + 378, + 680, + 378, + 680, + 438, + 313, + 438 + ], + "score": 0.927 + }, + { + "category_id": 0, + "poly": [ + 302, + 1107, + 573, + 1107, + 573, + 1142, + 302, + 1142 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 104, + 298, + 104 + ], + "score": 0.886 + }, + { + "category_id": 0, + "poly": [ + 773, + 519, + 926, + 519, + 926, + 553, + 773, + 553 + ], + "score": 0.87 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 857, + 2088, + 857, + 2112, + 842, + 2112 + ], + "score": 0.612 + }, + { + "category_id": 13, + "poly": [ + 1218, + 986, + 1272, + 986, + 1272, + 1015, + 1218, + 1015 + ], + "score": 0.89, + "latex": "15 \\%" + }, + { + "category_id": 13, + "poly": [ + 459, + 1535, + 474, + 1535, + 474, + 1557, + 459, + 1557 + ], + "score": 0.75, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1007, + 777, + 1022, + 777, + 1022, + 800, + 1007, + 800 + ], + "score": 0.74, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 766, + 1917, + 779, + 1917, + 779, + 1939, + 766, + 1939 + ], + "score": 0.7, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1241, + 2009, + 1255, + 2009, + 1255, + 2030, + 1241, + 2030 + ], + "score": 0.67, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1279, + 809, + 1294, + 809, + 1294, + 831, + 1279, + 831 + ], + "score": 0.45, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1276, + 687, + 1293, + 687, + 1293, + 710, + 1276, + 710 + ], + "score": 0.33, + "latex": "\\epsilon \\cdot" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 217.0, + 1402.0, + 217.0, + 1402.0, + 272.0, + 294.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 274.0, + 1088.0, + 274.0, + 1088.0, + 329.0, + 296.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1104.0, + 579.0, + 1104.0, + 579.0, + 1151.0, + 294.0, + 1151.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, + 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, + 858.0, + 2088.0, + 858.0, + 2116.0, + 841.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1527.0, + 458.0, + 1527.0, + 458.0, + 1565.0, + 294.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 475.0, + 1527.0, + 1404.0, + 1527.0, + 1404.0, + 1565.0, + 475.0, + 1565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1561.0, + 1404.0, + 1561.0, + 1404.0, + 1596.0, + 294.0, + 1596.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1589.0, + 1405.0, + 1589.0, + 1405.0, + 1628.0, + 293.0, + 1628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1619.0, + 1403.0, + 1619.0, + 1403.0, + 1657.0, + 293.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1648.0, + 1407.0, + 1648.0, + 1407.0, + 1688.0, + 292.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1680.0, + 1407.0, + 1680.0, + 1407.0, + 1719.0, + 293.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1711.0, + 1405.0, + 1711.0, + 1405.0, + 1748.0, + 294.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1743.0, + 1405.0, + 1743.0, + 1405.0, + 1778.0, + 294.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1773.0, + 1405.0, + 1773.0, + 1405.0, + 1808.0, + 292.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1802.0, + 1405.0, + 1802.0, + 1405.0, + 1839.0, + 293.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1835.0, + 1275.0, + 1835.0, + 1275.0, + 1870.0, + 294.0, + 1870.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1177.0, + 1403.0, + 1177.0, + 1403.0, + 1212.0, + 293.0, + 1212.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1208.0, + 1406.0, + 1208.0, + 1406.0, + 1244.0, + 292.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1238.0, + 1403.0, + 1238.0, + 1403.0, + 1275.0, + 293.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1270.0, + 1405.0, + 1270.0, + 1405.0, + 1305.0, + 296.0, + 1305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1300.0, + 1404.0, + 1300.0, + 1404.0, + 1334.0, + 294.0, + 1334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1329.0, + 1402.0, + 1329.0, + 1402.0, + 1364.0, + 294.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1362.0, + 1404.0, + 1362.0, + 1404.0, + 1396.0, + 294.0, + 1396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1390.0, + 1405.0, + 1390.0, + 1405.0, + 1426.0, + 294.0, + 1426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1421.0, + 1407.0, + 1421.0, + 1407.0, + 1459.0, + 293.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1453.0, + 1405.0, + 1453.0, + 1405.0, + 1488.0, + 294.0, + 1488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1483.0, + 1301.0, + 1483.0, + 1301.0, + 1517.0, + 294.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 590.0, + 1305.0, + 590.0, + 1305.0, + 622.0, + 395.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 620.0, + 1306.0, + 620.0, + 1306.0, + 654.0, + 393.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 650.0, + 1304.0, + 650.0, + 1304.0, + 687.0, + 393.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 681.0, + 1275.0, + 681.0, + 1275.0, + 716.0, + 392.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 681.0, + 1306.0, + 681.0, + 1306.0, + 716.0, + 1294.0, + 716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 711.0, + 1305.0, + 711.0, + 1305.0, + 745.0, + 393.0, + 745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 741.0, + 1306.0, + 741.0, + 1306.0, + 778.0, + 392.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 772.0, + 1006.0, + 772.0, + 1006.0, + 806.0, + 394.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 772.0, + 1306.0, + 772.0, + 1306.0, + 806.0, + 1023.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 804.0, + 1278.0, + 804.0, + 1278.0, + 835.0, + 394.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 804.0, + 1306.0, + 804.0, + 1306.0, + 835.0, + 1295.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 833.0, + 1305.0, + 833.0, + 1305.0, + 867.0, + 394.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 865.0, + 1305.0, + 865.0, + 1305.0, + 896.0, + 395.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 897.0, + 1306.0, + 897.0, + 1306.0, + 929.0, + 395.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 926.0, + 1305.0, + 926.0, + 1305.0, + 957.0, + 394.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 955.0, + 1306.0, + 955.0, + 1306.0, + 990.0, + 392.0, + 990.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 986.0, + 1217.0, + 986.0, + 1217.0, + 1020.0, + 393.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 986.0, + 1305.0, + 986.0, + 1305.0, + 1020.0, + 1273.0, + 1020.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1017.0, + 1305.0, + 1017.0, + 1305.0, + 1052.0, + 393.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1878.0, + 1402.0, + 1878.0, + 1402.0, + 1915.0, + 294.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1911.0, + 765.0, + 1911.0, + 765.0, + 1946.0, + 292.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1946.0, + 780.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1979.0, + 293.0, + 1979.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, + 2002.0, + 1240.0, + 2002.0, + 1240.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 2002.0, + 1267.0, + 2002.0, + 1267.0, + 2039.0, + 1256.0, + 2039.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, + 229, + 1404, + 229, + 1404, + 506, + 298, + 506 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 1177, + 1404, + 1177, + 1404, + 1460, + 297, + 1460 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 947, + 1404, + 947, + 1404, + 1164, + 297, + 1164 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 298, + 1800, + 1403, + 1800, + 1403, + 1897, + 298, + 1897 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 298, + 1673, + 1403, + 1673, + 1403, + 1766, + 298, + 1766 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 369, + 597, + 1403, + 597, + 1403, + 834, + 369, + 834 + ], + "score": 0.962 + }, + { + "category_id": 2, + "poly": [ + 297, + 1918, + 1403, + 1918, + 1403, + 2033, + 297, + 2033 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 300, + 1573, + 1397, + 1573, + 1397, + 1660, + 300, + 1660 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 423, + 1519, + 1270, + 1519, + 1270, + 1559, + 423, + 1559 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 298, + 1471, + 1336, + 1471, + 1336, + 1505, + 298, + 1505 + ], + "score": 0.911 + }, + { + "category_id": 0, + "poly": [ + 295, + 878, + 1333, + 878, + 1333, + 914, + 295, + 914 + ], + "score": 0.905 + }, + { + "category_id": 1, + "poly": [ + 298, + 539, + 902, + 539, + 902, + 570, + 298, + 570 + ], + "score": 0.899 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1524, + 1400, + 1524, + 1400, + 1554, + 1366, + 1554 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.814 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.733 + }, + { + "category_id": 13, + "poly": [ + 433, + 1394, + 603, + 1394, + 603, + 1428, + 433, + 1428 + ], + "score": 0.94, + "latex": "\\tau ( s _ { t + 1 } | s _ { t } , \\mathbf { a } _ { t } )" + }, + { + "category_id": 13, + "poly": [ + 1110, + 1300, + 1223, + 1300, + 1223, + 1333, + 1110, + 1333 + ], + "score": 0.93, + "latex": "t \\in [ 0 , H ]" + }, + { + "category_id": 13, + "poly": [ + 602, + 1332, + 760, + 1332, + 760, + 1362, + 602, + 1362 + ], + "score": 0.93, + "latex": "i = 1 , \\ldots , N" + }, + { + "category_id": 13, + "poly": [ + 971, + 1270, + 1047, + 1270, + 1047, + 1303, + 971, + 1303 + ], + "score": 0.93, + "latex": "M [ \\pi _ { p } ]" + }, + { + "category_id": 13, + "poly": [ + 555, + 1472, + 631, + 1472, + 631, + 1507, + 555, + 1507 + ], + "score": 0.92, + "latex": "M [ \\pi _ { p } ]" + }, + { + "category_id": 13, + "poly": [ + 621, + 1208, + 925, + 1208, + 925, + 1242, + 621, + 1242 + ], + "score": 0.92, + "latex": "\\dot { M } : = ( S , A , r , \\mathcal { T } , \\gamma , \\overset { \\triangledown } { o , \\mathcal { T } } )" + }, + { + "category_id": 13, + "poly": [ + 373, + 1573, + 765, + 1573, + 765, + 1629, + 373, + 1629 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { J _ { i } ( \\pmb { \\pi } , \\pi _ { p } ) : = \\mathbb { E } _ { \\pmb { \\pi } , \\pi _ { p } } \\left[ \\sum _ { t = 0 } ^ { H } \\gamma ^ { t } r _ { t } ^ { ( i ) } \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 343, + 1301, + 419, + 1301, + 419, + 1330, + 343, + 1330 + ], + "score": 0.91, + "latex": "H + 1" + }, + { + "category_id": 13, + "poly": [ + 1229, + 1673, + 1393, + 1673, + 1393, + 1707, + 1229, + 1707 + ], + "score": 0.91, + "latex": "\\pi \\in \\tt { A N E } ( \\pi _ { p } )" + }, + { + "category_id": 13, + "poly": [ + 839, + 1921, + 1025, + 1921, + 1025, + 1951, + 839, + 1951 + ], + "score": 0.91, + "latex": "{ \\pmb a } = ( a _ { 1 } , \\dots , a _ { N } )" + }, + { + "category_id": 13, + "poly": [ + 1044, + 1367, + 1097, + 1367, + 1097, + 1394, + 1044, + 1394 + ], + "score": 0.9, + "latex": "s _ { t + 1 }" + }, + { + "category_id": 13, + "poly": [ + 696, + 1627, + 851, + 1627, + 851, + 1661, + 696, + 1661 + ], + "score": 0.89, + "latex": "\\pi \\in \\bar { \\mathrm { A N E } } ( \\pi _ { p } )" + }, + { + "category_id": 13, + "poly": [ + 1058, + 1426, + 1087, + 1426, + 1087, + 1460, + 1058, + 1460 + ], + "score": 0.89, + "latex": "\\theta _ { p }" + }, + { + "category_id": 13, + "poly": [ + 1038, + 1336, + 1079, + 1336, + 1079, + 1364, + 1038, + 1364 + ], + "score": 0.88, + "latex": "o _ { i , t }" + }, + { + "category_id": 13, + "poly": [ + 1309, + 1335, + 1352, + 1335, + 1352, + 1364, + 1309, + 1364 + ], + "score": 0.88, + "latex": "a _ { i , t }" + }, + { + "category_id": 13, + "poly": [ + 1138, + 1805, + 1171, + 1805, + 1171, + 1834, + 1138, + 1834 + ], + "score": 0.87, + "latex": "\\pi _ { p }" + }, + { + "category_id": 13, + "poly": [ + 866, + 1400, + 906, + 1400, + 906, + 1429, + 866, + 1429 + ], + "score": 0.87, + "latex": "o _ { i , t }" + }, + { + "category_id": 14, + "poly": [ + 428, + 1519, + 1268, + 1519, + 1268, + 1559, + 428, + 1559 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\mathrm { \\mathbb { A } N E } ( \\pi _ { p } ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi : J _ { i } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\} , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 991, + 1044, + 1024, + 1044, + 1024, + 1074, + 991, + 1074 + ], + "score": 0.87, + "latex": "\\pi _ { p }" + }, + { + "category_id": 13, + "poly": [ + 799, + 1430, + 831, + 1430, + 831, + 1460, + 799, + 1460 + ], + "score": 0.86, + "latex": "\\pi _ { p }" + }, + { + "category_id": 13, + "poly": [ + 592, + 954, + 625, + 954, + 625, + 982, + 592, + 982 + ], + "score": 0.86, + "latex": "\\pi _ { p }" + }, + { + "category_id": 13, + "poly": [ + 484, + 1709, + 516, + 1709, + 516, + 1739, + 484, + 1739 + ], + "score": 0.86, + "latex": "\\pi _ { p }" + }, + { + "category_id": 13, + "poly": [ + 903, + 1273, + 935, + 1273, + 935, + 1304, + 903, + 1304 + ], + "score": 0.86, + "latex": "\\pi _ { p }" + }, + { + "category_id": 13, + "poly": [ + 496, + 1428, + 521, + 1428, + 521, + 1456, + 496, + 1456 + ], + "score": 0.85, + "latex": "\\theta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 690, + 1680, + 722, + 1680, + 722, + 1707, + 690, + 1707 + ], + "score": 0.85, + "latex": "\\pi _ { p }" + }, + { + "category_id": 13, + "poly": [ + 1120, + 1400, + 1146, + 1400, + 1146, + 1426, + 1120, + 1426 + ], + "score": 0.85, + "latex": "s _ { t }" + }, + { + "category_id": 13, + "poly": [ + 422, + 1335, + 447, + 1335, + 447, + 1361, + 422, + 1361 + ], + "score": 0.85, + "latex": "s _ { t }" + }, + { + "category_id": 13, + "poly": [ + 1330, + 1399, + 1359, + 1399, + 1359, + 1426, + 1330, + 1426 + ], + "score": 0.85, + "latex": "\\pi _ { i }" + }, + { + "category_id": 13, + "poly": [ + 495, + 1364, + 534, + 1364, + 534, + 1395, + 495, + 1395 + ], + "score": 0.84, + "latex": "{ \\boldsymbol { r } } _ { i , t }" + }, + { + "category_id": 13, + "poly": [ + 1246, + 1921, + 1272, + 1921, + 1272, + 1945, + 1246, + 1945 + ], + "score": 0.81, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 798, + 1302, + 827, + 1302, + 827, + 1328, + 798, + 1328 + ], + "score": 0.81, + "latex": "H" + }, + { + "category_id": 13, + "poly": [ + 405, + 980, + 434, + 980, + 434, + 1008, + 405, + 1008 + ], + "score": 0.8, + "latex": "N" + }, + { + "category_id": 13, + "poly": [ + 1018, + 1210, + 1041, + 1210, + 1041, + 1237, + 1018, + 1237 + ], + "score": 0.8, + "latex": "S" + }, + { + "category_id": 13, + "poly": [ + 581, + 1241, + 603, + 1241, + 603, + 1267, + 581, + 1267 + ], + "score": 0.79, + "latex": "\\mathcal { T }" + }, + { + "category_id": 13, + "poly": [ + 1163, + 1955, + 1178, + 1955, + 1178, + 1975, + 1163, + 1975 + ], + "score": 0.75, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 1098, + 1210, + 1123, + 1210, + 1123, + 1236, + 1098, + 1236 + ], + "score": 0.73, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 1117, + 603, + 1132, + 603, + 1132, + 625, + 1117, + 625 + ], + "score": 0.69, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1111, + 1588, + 1124, + 1588, + 1124, + 1613, + 1111, + 1613 + ], + "score": 0.67, + "latex": "i" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 1911.0, + 838.0, + 1911.0, + 838.0, + 1958.0, + 330.0, + 1958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1026.0, + 1911.0, + 1245.0, + 1911.0, + 1245.0, + 1958.0, + 1026.0, + 1958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1911.0, + 1351.0, + 1911.0, + 1351.0, + 1958.0, + 1273.0, + 1958.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1941.0, + 1162.0, + 1941.0, + 1162.0, + 1988.0, + 327.0, + 1988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1179.0, + 1941.0, + 1407.0, + 1941.0, + 1407.0, + 1988.0, + 1179.0, + 1988.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1977.0, + 1404.0, + 1977.0, + 1404.0, + 2010.0, + 295.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2004.0, + 733.0, + 2004.0, + 733.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 876.0, + 1337.0, + 876.0, + 1337.0, + 917.0, + 291.0, + 917.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, + 2120.0, + 838.0, + 2120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 227.0, + 1406.0, + 227.0, + 1406.0, + 267.0, + 295.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 298.0, + 294.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 289.0, + 1404.0, + 289.0, + 1404.0, + 328.0, + 295.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 320.0, + 1405.0, + 320.0, + 1405.0, + 357.0, + 293.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 353.0, + 1406.0, + 353.0, + 1406.0, + 390.0, + 293.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 382.0, + 1405.0, + 382.0, + 1405.0, + 419.0, + 294.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 412.0, + 1406.0, + 412.0, + 1406.0, + 449.0, + 293.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 442.0, + 1402.0, + 442.0, + 1402.0, + 479.0, + 294.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 475.0, + 1404.0, + 475.0, + 1404.0, + 508.0, + 296.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1175.0, + 1406.0, + 1175.0, + 1406.0, + 1214.0, + 292.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1207.0, + 620.0, + 1207.0, + 620.0, + 1244.0, + 294.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 1207.0, + 1017.0, + 1207.0, + 1017.0, + 1244.0, + 926.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1042.0, + 1207.0, + 1097.0, + 1207.0, + 1097.0, + 1244.0, + 1042.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 1207.0, + 1406.0, + 1207.0, + 1406.0, + 1244.0, + 1124.0, + 1244.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1238.0, + 580.0, + 1238.0, + 580.0, + 1275.0, + 292.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1238.0, + 1405.0, + 1238.0, + 1405.0, + 1275.0, + 604.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1268.0, + 902.0, + 1268.0, + 902.0, + 1304.0, + 294.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 936.0, + 1268.0, + 970.0, + 1268.0, + 970.0, + 1304.0, + 936.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1268.0, + 1406.0, + 1268.0, + 1406.0, + 1304.0, + 1048.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1299.0, + 342.0, + 1299.0, + 342.0, + 1336.0, + 294.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 1299.0, + 797.0, + 1299.0, + 797.0, + 1336.0, + 420.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1299.0, + 1109.0, + 1299.0, + 1109.0, + 1336.0, + 828.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1299.0, + 1406.0, + 1299.0, + 1406.0, + 1336.0, + 1224.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1329.0, + 421.0, + 1329.0, + 421.0, + 1366.0, + 292.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1329.0, + 601.0, + 1329.0, + 601.0, + 1366.0, + 448.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 1329.0, + 1037.0, + 1329.0, + 1037.0, + 1366.0, + 761.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 1329.0, + 1308.0, + 1329.0, + 1308.0, + 1366.0, + 1080.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 1329.0, + 1407.0, + 1329.0, + 1407.0, + 1366.0, + 1353.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1358.0, + 494.0, + 1358.0, + 494.0, + 1398.0, + 291.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 535.0, + 1358.0, + 1043.0, + 1358.0, + 1043.0, + 1398.0, + 535.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 1358.0, + 1406.0, + 1358.0, + 1406.0, + 1398.0, + 1098.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1391.0, + 432.0, + 1391.0, + 432.0, + 1432.0, + 292.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1391.0, + 865.0, + 1391.0, + 865.0, + 1432.0, + 604.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 1391.0, + 1119.0, + 1391.0, + 1119.0, + 1432.0, + 907.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 1391.0, + 1329.0, + 1391.0, + 1329.0, + 1432.0, + 1147.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1391.0, + 1405.0, + 1391.0, + 1405.0, + 1432.0, + 1360.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1424.0, + 495.0, + 1424.0, + 495.0, + 1465.0, + 292.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 522.0, + 1424.0, + 798.0, + 1424.0, + 798.0, + 1465.0, + 522.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 1424.0, + 1057.0, + 1424.0, + 1057.0, + 1465.0, + 832.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 1424.0, + 1099.0, + 1424.0, + 1099.0, + 1465.0, + 1088.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 945.0, + 591.0, + 945.0, + 591.0, + 985.0, + 294.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 945.0, + 1406.0, + 945.0, + 1406.0, + 985.0, + 626.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 980.0, + 404.0, + 980.0, + 404.0, + 1015.0, + 295.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 435.0, + 980.0, + 1404.0, + 980.0, + 1404.0, + 1015.0, + 435.0, + 1015.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1010.0, + 1405.0, + 1010.0, + 1405.0, + 1044.0, + 295.0, + 1044.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1038.0, + 990.0, + 1038.0, + 990.0, + 1075.0, + 294.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 1038.0, + 1405.0, + 1038.0, + 1405.0, + 1075.0, + 1025.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1069.0, + 1405.0, + 1069.0, + 1405.0, + 1106.0, + 292.0, + 1106.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1099.0, + 1406.0, + 1099.0, + 1406.0, + 1136.0, + 292.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1131.0, + 783.0, + 1131.0, + 783.0, + 1168.0, + 294.0, + 1168.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1799.0, + 1137.0, + 1799.0, + 1137.0, + 1837.0, + 294.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 1799.0, + 1404.0, + 1799.0, + 1404.0, + 1837.0, + 1172.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1833.0, + 1403.0, + 1833.0, + 1403.0, + 1869.0, + 293.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1863.0, + 1404.0, + 1863.0, + 1404.0, + 1901.0, + 294.0, + 1901.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1671.0, + 689.0, + 1671.0, + 689.0, + 1712.0, + 293.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 723.0, + 1671.0, + 1228.0, + 1671.0, + 1228.0, + 1712.0, + 723.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1671.0, + 1404.0, + 1671.0, + 1404.0, + 1712.0, + 1394.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1703.0, + 483.0, + 1703.0, + 483.0, + 1741.0, + 293.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 1703.0, + 1407.0, + 1703.0, + 1407.0, + 1741.0, + 517.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1735.0, + 1231.0, + 1735.0, + 1231.0, + 1769.0, + 294.0, + 1769.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 596.0, + 1116.0, + 596.0, + 1116.0, + 632.0, + 367.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 596.0, + 1403.0, + 596.0, + 1403.0, + 632.0, + 1133.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 631.0, + 950.0, + 631.0, + 950.0, + 662.0, + 393.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 666.0, + 1405.0, + 666.0, + 1405.0, + 705.0, + 365.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 704.0, + 947.0, + 704.0, + 947.0, + 733.0, + 396.0, + 733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 388.0, + 742.0, + 1403.0, + 742.0, + 1403.0, + 775.0, + 388.0, + 775.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 773.0, + 1406.0, + 773.0, + 1406.0, + 809.0, + 395.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 803.0, + 899.0, + 803.0, + 899.0, + 840.0, + 395.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1568.0, + 372.0, + 1568.0, + 372.0, + 1632.0, + 291.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 1566.0, + 1110.0, + 1566.0, + 1110.0, + 1634.0, + 766.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 1566.0, + 1405.0, + 1566.0, + 1405.0, + 1634.0, + 1125.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1622.0, + 695.0, + 1622.0, + 695.0, + 1664.0, + 294.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 1622.0, + 862.0, + 1622.0, + 862.0, + 1664.0, + 852.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1469.0, + 554.0, + 1469.0, + 554.0, + 1509.0, + 295.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 1469.0, + 1340.0, + 1469.0, + 1340.0, + 1509.0, + 632.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 536.0, + 906.0, + 536.0, + 906.0, + 575.0, + 297.0, + 575.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 716, + 1404, + 716, + 1404, + 903, + 296, + 903 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 300, + 1119, + 1402, + 1119, + 1402, + 1241, + 300, + 1241 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1668, + 1404, + 1668, + 1404, + 1825, + 297, + 1825 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1857, + 1404, + 1857, + 1404, + 1982, + 298, + 1982 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 296, + 227, + 1404, + 227, + 1404, + 324, + 296, + 324 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 298, + 441, + 1403, + 441, + 1403, + 533, + 298, + 533 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 297, + 1371, + 1406, + 1371, + 1406, + 1559, + 297, + 1559 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 438, + 1256, + 1257, + 1256, + 1257, + 1358, + 438, + 1358 + ], + "score": 0.958 + }, + { + "category_id": 8, + "poly": [ + 597, + 549, + 1098, + 549, + 1098, + 605, + 597, + 605 + ], + "score": 0.955 + }, + { + "category_id": 1, + "poly": [ + 297, + 621, + 1399, + 621, + 1399, + 686, + 297, + 686 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 569, + 916, + 1123, + 916, + 1123, + 1008, + 569, + 1008 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 299, + 1021, + 988, + 1021, + 988, + 1055, + 299, + 1055 + ], + "score": 0.936 + }, + { + "category_id": 2, + "poly": [ + 333, + 2003, + 817, + 2003, + 817, + 2035, + 333, + 2035 + ], + "score": 0.918 + }, + { + "category_id": 8, + "poly": [ + 429, + 340, + 1311, + 340, + 1311, + 382, + 429, + 382 + ], + "score": 0.913 + }, + { + "category_id": 0, + "poly": [ + 296, + 1599, + 1219, + 1599, + 1219, + 1637, + 296, + 1637 + ], + "score": 0.91 + }, + { + "category_id": 8, + "poly": [ + 391, + 1067, + 1302, + 1067, + 1302, + 1108, + 391, + 1108 + ], + "score": 0.909 + }, + { + "category_id": 9, + "poly": [ + 1365, + 947, + 1400, + 947, + 1400, + 978, + 1365, + 978 + ], + "score": 0.883 + }, + { + "category_id": 9, + "poly": [ + 1366, + 552, + 1400, + 552, + 1400, + 581, + 1366, + 581 + ], + "score": 0.88 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1261, + 1400, + 1261, + 1400, + 1292, + 1365, + 1292 + ], + "score": 0.879 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1073, + 1400, + 1073, + 1400, + 1102, + 1366, + 1102 + ], + "score": 0.876 + }, + { + "category_id": 8, + "poly": [ + 386, + 389, + 1053, + 389, + 1053, + 430, + 386, + 430 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1366, + 394, + 1400, + 394, + 1400, + 423, + 1366, + 423 + ], + "score": 0.858 + }, + { + "category_id": 9, + "poly": [ + 1366, + 347, + 1400, + 347, + 1400, + 376, + 1366, + 376 + ], + "score": 0.852 + }, + { + "category_id": 2, + "poly": [ + 297, + 74, + 854, + 74, + 854, + 105, + 297, + 105 + ], + "score": 0.751 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.643 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 860, + 2088, + 860, + 2112, + 841, + 2112 + ], + "score": 0.558 + }, + { + "category_id": 2, + "poly": [ + 298, + 74, + 854, + 74, + 854, + 105, + 298, + 105 + ], + "score": 0.2 + }, + { + "category_id": 14, + "poly": [ + 570, + 915, + 1126, + 915, + 1126, + 1010, + 570, + 1010 + ], + "score": 0.94, + "latex": "\\Xi _ { \\epsilon } : = \\left\\{ \\xi \\left| \\operatorname* { s u p } _ { \\pi , \\pi _ { p } } | \\xi _ { i } ( \\pi , \\pi _ { p } ) | < \\epsilon , { \\mathrm { f o r } } { \\mathrm { a l l } } i \\in I \\right. \\right\\} ." + }, + { + "category_id": 13, + "poly": [ + 911, + 228, + 1128, + 228, + 1128, + 264, + 911, + 264 + ], + "score": 0.93, + "latex": "\\Xi : ( S , A ) ^ { H } \\to \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 902, + 1022, + 978, + 1022, + 978, + 1058, + 902, + 1058 + ], + "score": 0.93, + "latex": "M [ \\pi _ { p } ]" + }, + { + "category_id": 13, + "poly": [ + 569, + 622, + 755, + 622, + 755, + 656, + 569, + 656 + ], + "score": 0.93, + "latex": "\\pi \\in \\mathop { \\mathrm { A N E } } ( \\pi _ { p } , \\pmb { \\xi } )" + }, + { + "category_id": 14, + "poly": [ + 598, + 546, + 1101, + 546, + 1101, + 606, + 598, + 606 + ], + "score": 0.93, + "latex": "\\pi _ { p } ^ { * } = \\underset { \\pi _ { p } } { \\arg \\operatorname* { m a x } } ~ \\underset { \\xi \\in \\Xi } { \\operatorname* { m i n } } ~ \\underset { \\pi \\in \\mathrm { { a N E } } ( \\pi _ { p } , \\xi ) } { \\operatorname* { m i n } } ~ J _ { p } ( \\pi , \\pi _ { p } ) ." + }, + { + "category_id": 13, + "poly": [ + 1083, + 811, + 1164, + 811, + 1164, + 843, + 1083, + 843 + ], + "score": 0.92, + "latex": "\\xi _ { i } \\in \\Xi" + }, + { + "category_id": 13, + "poly": [ + 703, + 2002, + 813, + 2002, + 813, + 2036, + 703, + 2036 + ], + "score": 0.92, + "latex": "J _ { i } ^ { \\xi } = - J _ { p }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1404, + 423, + 1404, + 423, + 1437, + 297, + 1437 + ], + "score": 0.92, + "latex": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )" + }, + { + "category_id": 13, + "poly": [ + 1270, + 261, + 1400, + 261, + 1400, + 296, + 1270, + 296 + ], + "score": 0.91, + "latex": "\\mathtt { A N E } ( \\pi _ { p } , \\xi )" + }, + { + "category_id": 13, + "poly": [ + 371, + 1373, + 498, + 1373, + 498, + 1406, + 371, + 1406 + ], + "score": 0.91, + "latex": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )" + }, + { + "category_id": 13, + "poly": [ + 899, + 1731, + 1025, + 1731, + 1025, + 1765, + 899, + 1765 + ], + "score": 0.91, + "latex": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon )" + }, + { + "category_id": 14, + "poly": [ + 435, + 1255, + 1257, + 1255, + 1257, + 1360, + 435, + 1360 + ], + "score": 0.91, + "latex": "\\underbrace { \\arg \\operatorname* { m a x } J _ { p , \\operatorname* { m i n } } ^ { * } ( \\pi _ { p } , \\epsilon ) } _ { \\texttt { P l a n n e r - O P T } } , \\quad \\mathrm { ~ w h e r e ~ } J _ { p , \\operatorname* { m i n } } ^ { * } ( \\pi _ { p } , \\epsilon ) : = \\underbrace { \\operatorname* { m i n } _ { \\pi \\in \\mathrm { \\mathrm { a N E } } ( \\pi _ { p } , \\epsilon ) } J _ { p } ( \\pi , \\pi _ { p } ) } _ { \\texttt { a g e n t - A d v - S e a r c h } } ." + }, + { + "category_id": 13, + "poly": [ + 297, + 231, + 383, + 231, + 383, + 263, + 297, + 263 + ], + "score": 0.91, + "latex": "\\xi _ { i } \\in \\Xi" + }, + { + "category_id": 13, + "poly": [ + 698, + 1495, + 766, + 1495, + 766, + 1525, + 698, + 1525 + ], + "score": 0.9, + "latex": "\\epsilon \\geq 0" + }, + { + "category_id": 14, + "poly": [ + 395, + 1068, + 1304, + 1068, + 1304, + 1107, + 395, + 1107 + ], + "score": 0.89, + "latex": "\\mathtt { A N E } ( \\pi _ { p } , \\epsilon ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , { \\tilde { \\pi } } _ { i } \\in \\Pi : J _ { i } ( { \\tilde { \\pi } } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) + \\epsilon \\} ." + }, + { + "category_id": 13, + "poly": [ + 935, + 811, + 980, + 811, + 980, + 841, + 935, + 841 + ], + "score": 0.89, + "latex": "L _ { \\infty }" + }, + { + "category_id": 14, + "poly": [ + 386, + 335, + 1309, + 335, + 1309, + 433, + 386, + 433 + ], + "score": 0.87, + "latex": "\\begin{array} { r l } & { \\mathtt { \\mathbb { A } N E } ( \\pi _ { p } , \\xi ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi : J _ { i } ^ { \\xi } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\leq J _ { i } ^ { \\xi } ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } ) \\} , } \\\\ & { J _ { i } ^ { \\xi } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) : = J _ { i } ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } ) + \\mathbb { E } _ { \\tau _ { i } \\sim \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } } \\left[ \\xi _ { i } ( \\tau _ { i } ) \\right] } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 842, + 293, + 860, + 293, + 860, + 324, + 842, + 324 + ], + "score": 0.84, + "latex": "\\boldsymbol { \\xi }" + }, + { + "category_id": 13, + "poly": [ + 580, + 2006, + 603, + 2006, + 603, + 2034, + 580, + 2034 + ], + "score": 0.84, + "latex": "\\xi _ { i }" + }, + { + "category_id": 13, + "poly": [ + 372, + 447, + 396, + 447, + 396, + 472, + 372, + 472 + ], + "score": 0.84, + "latex": "\\tau _ { i }" + }, + { + "category_id": 13, + "poly": [ + 713, + 657, + 731, + 657, + 731, + 685, + 713, + 685 + ], + "score": 0.83, + "latex": "\\boldsymbol { \\xi }" + }, + { + "category_id": 13, + "poly": [ + 1270, + 473, + 1400, + 473, + 1400, + 506, + 1270, + 506 + ], + "score": 0.79, + "latex": "\\mathtt { A N E } ( \\pi _ { p } , \\xi )" + }, + { + "category_id": 13, + "poly": [ + 738, + 1028, + 753, + 1028, + 753, + 1050, + 738, + 1050 + ], + "score": 0.75, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 297, + 1127, + 312, + 1127, + 312, + 1148, + 297, + 1148 + ], + "score": 0.71, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1110, + 1374, + 1136, + 1374, + 1136, + 1401, + 1110, + 1401 + ], + "score": 0.61, + "latex": "\\Xi" + }, + { + "category_id": 13, + "poly": [ + 557, + 781, + 584, + 781, + 584, + 808, + 557, + 808 + ], + "score": 0.61, + "latex": "\\Xi" + }, + { + "category_id": 13, + "poly": [ + 298, + 847, + 313, + 847, + 313, + 868, + 298, + 868 + ], + "score": 0.61, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 298, + 780, + 321, + 780, + 321, + 807, + 298, + 807 + ], + "score": 0.53, + "latex": "\\Pi" + }, + { + "category_id": 13, + "poly": [ + 1312, + 817, + 1327, + 817, + 1327, + 838, + 1312, + 838 + ], + "score": 0.47, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 504, + 751, + 529, + 751, + 529, + 777, + 504, + 777 + ], + "score": 0.46, + "latex": "\\Xi" + }, + { + "category_id": 13, + "poly": [ + 811, + 1525, + 835, + 1525, + 835, + 1552, + 811, + 1552 + ], + "score": 0.37, + "latex": "\\Pi" + }, + { + "category_id": 13, + "poly": [ + 1162, + 443, + 1186, + 443, + 1186, + 470, + 1162, + 470 + ], + "score": 0.33, + "latex": "\\&" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1996.0, + 579.0, + 1996.0, + 579.0, + 2041.0, + 329.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 1996.0, + 702.0, + 1996.0, + 702.0, + 2041.0, + 604.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 814.0, + 1996.0, + 823.0, + 1996.0, + 823.0, + 2041.0, + 814.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1596.0, + 1223.0, + 1596.0, + 1223.0, + 1642.0, + 291.0, + 1642.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, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2118.0, + 837.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 72.0, + 857.0, + 72.0, + 857.0, + 108.0, + 296.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 715.0, + 1405.0, + 715.0, + 1405.0, + 753.0, + 293.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 747.0, + 503.0, + 747.0, + 503.0, + 783.0, + 295.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 747.0, + 1405.0, + 747.0, + 1405.0, + 783.0, + 530.0, + 783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 777.0, + 297.0, + 777.0, + 297.0, + 815.0, + 294.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 777.0, + 556.0, + 777.0, + 556.0, + 815.0, + 322.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 777.0, + 1406.0, + 777.0, + 1406.0, + 815.0, + 585.0, + 815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 811.0, + 934.0, + 811.0, + 934.0, + 847.0, + 294.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 811.0, + 1082.0, + 811.0, + 1082.0, + 847.0, + 981.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 811.0, + 1311.0, + 811.0, + 1311.0, + 847.0, + 1165.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1328.0, + 811.0, + 1406.0, + 811.0, + 1406.0, + 847.0, + 1328.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 838.0, + 297.0, + 838.0, + 297.0, + 880.0, + 291.0, + 880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 838.0, + 1407.0, + 838.0, + 1407.0, + 880.0, + 314.0, + 880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 870.0, + 1313.0, + 870.0, + 1313.0, + 906.0, + 295.0, + 906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1119.0, + 296.0, + 1119.0, + 296.0, + 1155.0, + 293.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 1119.0, + 1406.0, + 1119.0, + 1406.0, + 1155.0, + 313.0, + 1155.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1151.0, + 1403.0, + 1151.0, + 1403.0, + 1183.0, + 295.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1181.0, + 1404.0, + 1181.0, + 1404.0, + 1217.0, + 293.0, + 1217.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1212.0, + 356.0, + 1212.0, + 356.0, + 1245.0, + 291.0, + 1245.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1670.0, + 1404.0, + 1670.0, + 1404.0, + 1704.0, + 297.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1701.0, + 1401.0, + 1701.0, + 1401.0, + 1734.0, + 296.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1729.0, + 898.0, + 1729.0, + 898.0, + 1771.0, + 294.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1026.0, + 1729.0, + 1404.0, + 1729.0, + 1404.0, + 1771.0, + 1026.0, + 1771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1759.0, + 1404.0, + 1759.0, + 1404.0, + 1799.0, + 292.0, + 1799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1789.0, + 974.0, + 1789.0, + 974.0, + 1828.0, + 294.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1856.0, + 1406.0, + 1856.0, + 1406.0, + 1891.0, + 292.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1888.0, + 1404.0, + 1888.0, + 1404.0, + 1921.0, + 294.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1921.0, + 1405.0, + 1921.0, + 1405.0, + 1952.0, + 293.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1945.0, + 1408.0, + 1945.0, + 1408.0, + 1989.0, + 291.0, + 1989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 226.0, + 296.0, + 226.0, + 296.0, + 267.0, + 291.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 226.0, + 910.0, + 226.0, + 910.0, + 267.0, + 384.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 226.0, + 1406.0, + 226.0, + 1406.0, + 267.0, + 1129.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 258.0, + 1269.0, + 258.0, + 1269.0, + 300.0, + 293.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 258.0, + 1404.0, + 258.0, + 1404.0, + 300.0, + 1401.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 289.0, + 841.0, + 289.0, + 841.0, + 328.0, + 293.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 289.0, + 874.0, + 289.0, + 874.0, + 328.0, + 861.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 440.0, + 371.0, + 440.0, + 371.0, + 477.0, + 294.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 440.0, + 1161.0, + 440.0, + 1161.0, + 477.0, + 397.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 440.0, + 1402.0, + 440.0, + 1402.0, + 477.0, + 1187.0, + 477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 469.0, + 1269.0, + 469.0, + 1269.0, + 509.0, + 292.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 500.0, + 719.0, + 500.0, + 719.0, + 536.0, + 293.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1370.0, + 370.0, + 1370.0, + 370.0, + 1410.0, + 295.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 499.0, + 1370.0, + 1109.0, + 1370.0, + 1109.0, + 1410.0, + 499.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 1370.0, + 1404.0, + 1370.0, + 1404.0, + 1410.0, + 1137.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1402.0, + 1403.0, + 1402.0, + 1403.0, + 1438.0, + 424.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1433.0, + 1404.0, + 1433.0, + 1404.0, + 1469.0, + 294.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1464.0, + 1404.0, + 1464.0, + 1404.0, + 1500.0, + 295.0, + 1500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1492.0, + 697.0, + 1492.0, + 697.0, + 1531.0, + 291.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 767.0, + 1492.0, + 1407.0, + 1492.0, + 1407.0, + 1531.0, + 767.0, + 1531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1524.0, + 810.0, + 1524.0, + 810.0, + 1561.0, + 292.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1524.0, + 1367.0, + 1524.0, + 1367.0, + 1561.0, + 836.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 617.0, + 568.0, + 617.0, + 568.0, + 660.0, + 293.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 617.0, + 1405.0, + 617.0, + 1405.0, + 660.0, + 756.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 653.0, + 712.0, + 653.0, + 712.0, + 690.0, + 295.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 653.0, + 743.0, + 653.0, + 743.0, + 690.0, + 732.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1013.0, + 737.0, + 1013.0, + 737.0, + 1064.0, + 293.0, + 1064.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 1013.0, + 901.0, + 1013.0, + 901.0, + 1064.0, + 754.0, + 1064.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 979.0, + 1013.0, + 991.0, + 1013.0, + 991.0, + 1064.0, + 979.0, + 1064.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1161, + 1401, + 1161, + 1401, + 1287, + 299, + 1287 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 1743, + 1403, + 1743, + 1403, + 1844, + 297, + 1844 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 297, + 1511, + 1405, + 1511, + 1405, + 1606, + 297, + 1606 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 1640, + 1404, + 1640, + 1404, + 1735, + 296, + 1735 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 494, + 997, + 1203, + 997, + 1203, + 1146, + 494, + 1146 + ], + "score": 0.971 + }, + { + "category_id": 3, + "poly": [ + 335, + 222, + 1366, + 222, + 1366, + 630, + 335, + 630 + ], + "score": 0.962 + }, + { + "category_id": 4, + "poly": [ + 295, + 653, + 1405, + 653, + 1405, + 809, + 295, + 809 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 298, + 1366, + 1407, + 1366, + 1407, + 1431, + 298, + 1431 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 297, + 1867, + 1400, + 1867, + 1400, + 1933, + 297, + 1933 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 296, + 868, + 1400, + 868, + 1400, + 935, + 296, + 935 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 544, + 1450, + 1154, + 1450, + 1154, + 1495, + 544, + 1495 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 471, + 1306, + 1226, + 1306, + 1226, + 1350, + 471, + 1350 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 291, + 946, + 1401, + 946, + 1401, + 981, + 291, + 981 + ], + "score": 0.917 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1456, + 1399, + 1456, + 1399, + 1486, + 1352, + 1486 + ], + "score": 0.903 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1029, + 1400, + 1029, + 1400, + 1060, + 1365, + 1060 + ], + "score": 0.877 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1995, + 1401, + 1995, + 1401, + 2024, + 1351, + 2024 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1312, + 1400, + 1312, + 1400, + 1342, + 1366, + 1342 + ], + "score": 0.873 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1952, + 1400, + 1952, + 1400, + 1983, + 1352, + 1983 + ], + "score": 0.869 + }, + { + "category_id": 8, + "poly": [ + 343, + 1948, + 1312, + 1948, + 1312, + 1987, + 343, + 1987 + ], + "score": 0.859 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.781 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2111, + 840, + 2111 + ], + "score": 0.772 + }, + { + "category_id": 8, + "poly": [ + 390, + 1991, + 830, + 1991, + 830, + 2029, + 390, + 2029 + ], + "score": 0.257 + }, + { + "category_id": 4, + "poly": [ + 975, + 599, + 1391, + 599, + 1391, + 628, + 975, + 628 + ], + "score": 0.131 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 854, + 76, + 854, + 104, + 298, + 104 + ], + "score": 0.108 + }, + { + "category_id": 14, + "poly": [ + 493, + 996, + 1203, + 996, + 1203, + 1150, + 493, + 1150 + ], + "score": 0.93, + "latex": "\\underset { \\pi } { \\mathop { \\operatorname* { m i n } } } \\underbrace { \\Bigg ( J _ { p } ( \\pi , \\pi _ { p } ) - \\sum _ { i = 1 } ^ { N } \\lambda _ { i } \\left[ J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - J _ { i } ( \\pi , \\pi _ { p } ) - \\epsilon _ { i } \\right] \\Bigg ) } _ { J _ { p , \\operatorname* { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) } ," + }, + { + "category_id": 13, + "poly": [ + 810, + 1512, + 982, + 1512, + 982, + 1547, + 810, + 1547 + ], + "score": 0.93, + "latex": "J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1806, + 473, + 1806, + 473, + 1839, + 297, + 1839 + ], + "score": 0.93, + "latex": "\\pi _ { i } ^ { \\prime } \\in W _ { i } \\setminus \\{ \\pi _ { i } \\}" + }, + { + "category_id": 13, + "poly": [ + 372, + 1367, + 435, + 1367, + 435, + 1402, + 372, + 1402 + ], + "score": 0.93, + "latex": "\\theta _ { i } ^ { \\prime } ( \\pmb \\theta )" + }, + { + "category_id": 13, + "poly": [ + 868, + 1223, + 1093, + 1223, + 1093, + 1258, + 868, + 1258 + ], + "score": 0.93, + "latex": "J _ { p } ( \\pmb \\theta ) \\overset { \\cdot } { : = } J _ { p } ( \\pmb \\pi , \\pi _ { p } )" + }, + { + "category_id": 13, + "poly": [ + 1022, + 1775, + 1321, + 1775, + 1321, + 1809, + 1022, + 1809 + ], + "score": 0.92, + "latex": "J _ { i } ( \\pi _ { i } ^ { \\prime } , \\pi _ { - i } ) \\le J _ { i } ( \\pi ) + \\epsilon ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 577, + 1224, + 815, + 1224, + 815, + 1257, + 577, + 1257 + ], + "score": 0.91, + "latex": "\\pmb { \\theta } : = [ \\theta _ { 1 } , \\ldots , \\theta _ { N } , \\theta _ { p } ]" + }, + { + "category_id": 13, + "poly": [ + 943, + 1900, + 1018, + 1900, + 1018, + 1934, + 943, + 1934 + ], + "score": 0.91, + "latex": "\\Pi _ { \\eta } ( \\pi )" + }, + { + "category_id": 13, + "poly": [ + 298, + 870, + 467, + 870, + 467, + 904, + 298, + 904 + ], + "score": 0.91, + "latex": "J _ { i } ( \\pi , \\pi _ { p } ) \\geq C" + }, + { + "category_id": 13, + "poly": [ + 409, + 1776, + 516, + 1776, + 516, + 1806, + 409, + 1806 + ], + "score": 0.91, + "latex": "\\pi _ { i } \\ \\in \\ W _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1269, + 1741, + 1401, + 1741, + 1401, + 1775, + 1269, + 1775 + ], + "score": 0.9, + "latex": "W _ { i } ~ \\subset ~ \\Pi ^ { N }" + }, + { + "category_id": 13, + "poly": [ + 675, + 1776, + 861, + 1776, + 861, + 1808, + 675, + 1808 + ], + "score": 0.9, + "latex": "i \\in \\{ 1 , \\ldots , N \\}" + }, + { + "category_id": 14, + "poly": [ + 546, + 1447, + 1154, + 1447, + 1154, + 1496, + 546, + 1496 + ], + "score": 0.9, + "latex": "\\nabla _ { \\lambda _ { i } } J _ { p , \\mathrm { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) = J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - J _ { i } ( \\pi , \\pi _ { p } ) - \\epsilon _ { i } ." + }, + { + "category_id": 14, + "poly": [ + 337, + 1946, + 1310, + 1946, + 1310, + 2032, + 337, + 2032 + ], + "score": 0.9, + "latex": "\\begin{array} { r l } & { \\mathbb { A } \\mathbb { N } \\mathbb { E } ( \\pi _ { p } , \\eta ) : = \\{ \\pi \\mid \\forall i \\in [ 1 , N ] , \\tilde { \\pi } _ { i } \\in \\Pi _ { \\eta } ( \\pi _ { i } ) : J _ { i } \\big ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) \\leq J _ { i } \\big ( \\pi _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) + \\epsilon \\} , } \\\\ & { \\qquad \\Pi _ { \\eta } ( \\pi ) : = \\{ \\pi ^ { \\prime } \\in \\Pi \\mid K L ( \\pi | | \\pi ^ { \\prime } ) \\leq \\eta \\} , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 787, + 870, + 1321, + 870, + 1321, + 903, + 787, + 903 + ], + "score": 0.89, + "latex": "\\forall i \\in 1 \\dots N : J _ { i } ( \\pmb { \\pi } , \\pi _ { p } ) \\geq J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } ) - \\epsilon _ { : }" + }, + { + "category_id": 13, + "poly": [ + 843, + 904, + 1242, + 904, + 1242, + 938, + 843, + 938 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { \\pi _ { i } ^ { * } : = \\arg \\operatorname* { m a x } _ { \\tilde { \\pi } _ { i } \\in \\Pi } J _ { i } \\big ( \\tilde { \\pi } _ { i } , \\pi _ { - i } , \\pi _ { p } \\big ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1022, + 1369, + 1055, + 1369, + 1055, + 1402, + 1022, + 1402 + ], + "score": 0.89, + "latex": "\\pi _ { i } ^ { * }" + }, + { + "category_id": 14, + "poly": [ + 472, + 1302, + 1225, + 1302, + 1225, + 1351, + 472, + 1351 + ], + "score": 0.89, + "latex": "\\nabla _ { \\boldsymbol { \\theta } _ { i } } J _ { p , \\mathrm { m i n } } ^ { \\dagger } ( \\pi _ { p } , \\epsilon ) = - \\nabla _ { \\boldsymbol { \\theta } _ { i } } J _ { p } ( \\pmb { \\theta } ) - \\lambda _ { i } \\nabla _ { \\boldsymbol { \\theta } _ { i } } \\left[ J _ { i } ( \\theta _ { i } ^ { \\prime } ( \\pmb { \\theta } ) , \\theta _ { - i } ) - J _ { i } ( \\pmb { \\theta } ) \\right] ," + }, + { + "category_id": 13, + "poly": [ + 298, + 904, + 329, + 904, + 329, + 934, + 298, + 934 + ], + "score": 0.88, + "latex": "\\pi _ { i } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1133, + 1400, + 1157, + 1400, + 1157, + 1429, + 1133, + 1429 + ], + "score": 0.85, + "latex": "\\theta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1171, + 1400, + 1198, + 1400, + 1198, + 1429, + 1171, + 1429 + ], + "score": 0.84, + "latex": "\\lambda _ { i }" + }, + { + "category_id": 13, + "poly": [ + 559, + 1806, + 886, + 1806, + 886, + 1845, + 559, + 1845 + ], + "score": 0.81, + "latex": "\\begin{array} { r } { \\epsilon ^ { \\prime } : = \\epsilon \\operatorname* { s u p } _ { \\pi _ { i } ^ { \\prime } \\in W _ { i } } K L ( \\pi _ { i } | | \\pi _ { i } ^ { \\prime } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1173, + 1225, + 1190, + 1225, + 1190, + 1251, + 1173, + 1251 + ], + "score": 0.8, + "latex": "\\theta" + }, + { + "category_id": 13, + "poly": [ + 971, + 1875, + 984, + 1875, + 984, + 1896, + 971, + 1896 + ], + "score": 0.78, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 328, + 1258, + 347, + 1258, + 347, + 1281, + 328, + 1281 + ], + "score": 0.77, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 758, + 1750, + 773, + 1750, + 773, + 1772, + 758, + 1772 + ], + "score": 0.76, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1166, + 1370, + 1179, + 1370, + 1179, + 1395, + 1166, + 1395 + ], + "score": 0.76, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 384, + 948, + 407, + 948, + 407, + 975, + 384, + 975 + ], + "score": 0.76, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 611, + 1751, + 635, + 1751, + 635, + 1773, + 611, + 1773 + ], + "score": 0.75, + "latex": "\\pi" + }, + { + "category_id": 13, + "poly": [ + 588, + 1674, + 600, + 1674, + 600, + 1699, + 588, + 1699 + ], + "score": 0.72, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 1271, + 1677, + 1286, + 1677, + 1286, + 1699, + 1271, + 1699 + ], + "score": 0.67, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 610, + 1647, + 624, + 1647, + 624, + 1669, + 610, + 1669 + ], + "score": 0.66, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 818, + 904, + 831, + 904, + 831, + 928, + 818, + 928 + ], + "score": 0.5, + "latex": "i" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 227.0, + 494.0, + 227.0, + 494.0, + 259.0, + 402.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 227.0, + 690.0, + 227.0, + 690.0, + 257.0, + 597.0, + 257.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 225.0, + 884.0, + 225.0, + 884.0, + 259.0, + 797.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 250.0, + 519.0, + 250.0, + 519.0, + 278.0, + 378.0, + 278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 574.0, + 250.0, + 715.0, + 250.0, + 715.0, + 278.0, + 574.0, + 278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 770.0, + 249.0, + 911.0, + 249.0, + 911.0, + 277.0, + 770.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 270.0, + 366.0, + 270.0, + 366.0, + 445.0, + 332.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 290.0, + 674.0, + 290.0, + 674.0, + 305.0, + 657.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 853.0, + 290.0, + 868.0, + 290.0, + 868.0, + 305.0, + 853.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 293.0, + 472.0, + 293.0, + 472.0, + 303.0, + 463.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 315.0, + 1027.0, + 315.0, + 1027.0, + 334.0, + 1006.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 322.0, + 1047.0, + 322.0, + 1047.0, + 332.0, + 1039.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 815.0, + 333.0, + 825.0, + 333.0, + 825.0, + 344.0, + 815.0, + 344.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 342.0, + 1213.0, + 342.0, + 1213.0, + 362.0, + 1159.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1069.0, + 386.0, + 1112.0, + 386.0, + 1112.0, + 515.0, + 1069.0, + 515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 410.0, + 1250.0, + 410.0, + 1250.0, + 448.0, + 1230.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 441.0, + 730.0, + 441.0, + 730.0, + 468.0, + 558.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 475.0, + 569.0, + 475.0, + 569.0, + 504.0, + 510.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 475.0, + 673.0, + 475.0, + 673.0, + 504.0, + 614.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 475.0, + 776.0, + 475.0, + 776.0, + 504.0, + 719.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 476.0, + 880.0, + 476.0, + 880.0, + 502.0, + 823.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 508.0, + 510.0, + 508.0, + 510.0, + 535.0, + 362.0, + 535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 510.0, + 650.0, + 510.0, + 650.0, + 520.0, + 637.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 509.0, + 756.0, + 509.0, + 756.0, + 528.0, + 742.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 531.0, + 518.0, + 547.0, + 518.0, + 547.0, + 533.0, + 531.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 535.0, + 1359.0, + 535.0, + 1359.0, + 549.0, + 1344.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 541.0, + 508.0, + 541.0, + 508.0, + 569.0, + 362.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 554.0, + 554.0, + 554.0, + 554.0, + 560.0, + 548.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 553.0, + 660.0, + 553.0, + 660.0, + 562.0, + 650.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 596.0, + 780.0, + 596.0, + 780.0, + 630.0, + 483.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 597.0, + 1372.0, + 597.0, + 1372.0, + 627.0, + 974.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 655.0, + 1402.0, + 655.0, + 1402.0, + 688.0, + 295.0, + 688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 682.0, + 1403.0, + 682.0, + 1403.0, + 722.0, + 293.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 714.0, + 1405.0, + 714.0, + 1405.0, + 752.0, + 293.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 744.0, + 1406.0, + 744.0, + 1406.0, + 782.0, + 294.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 776.0, + 1228.0, + 776.0, + 1228.0, + 810.0, + 293.0, + 810.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, + 2086.0, + 863.0, + 2086.0, + 863.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 596.0, + 1393.0, + 596.0, + 1393.0, + 631.0, + 973.0, + 631.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": [ + 294.0, + 1159.0, + 1403.0, + 1159.0, + 1403.0, + 1197.0, + 294.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1193.0, + 1405.0, + 1193.0, + 1405.0, + 1226.0, + 294.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1224.0, + 576.0, + 1224.0, + 576.0, + 1260.0, + 294.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 816.0, + 1224.0, + 867.0, + 1224.0, + 867.0, + 1260.0, + 816.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 1224.0, + 1172.0, + 1224.0, + 1172.0, + 1260.0, + 1094.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1191.0, + 1224.0, + 1405.0, + 1224.0, + 1405.0, + 1260.0, + 1191.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1255.0, + 327.0, + 1255.0, + 327.0, + 1288.0, + 295.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 1255.0, + 898.0, + 1255.0, + 898.0, + 1288.0, + 348.0, + 1288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1738.0, + 610.0, + 1738.0, + 610.0, + 1778.0, + 292.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 1738.0, + 757.0, + 1738.0, + 757.0, + 1778.0, + 636.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1738.0, + 1268.0, + 1738.0, + 1268.0, + 1778.0, + 774.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1738.0, + 1405.0, + 1738.0, + 1405.0, + 1778.0, + 1402.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1772.0, + 408.0, + 1772.0, + 408.0, + 1811.0, + 293.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 517.0, + 1772.0, + 674.0, + 1772.0, + 674.0, + 1811.0, + 517.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 1772.0, + 1021.0, + 1772.0, + 1021.0, + 1811.0, + 862.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1772.0, + 1405.0, + 1772.0, + 1405.0, + 1811.0, + 1322.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1802.0, + 296.0, + 1802.0, + 296.0, + 1846.0, + 293.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 474.0, + 1802.0, + 558.0, + 1802.0, + 558.0, + 1846.0, + 474.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 1802.0, + 900.0, + 1802.0, + 900.0, + 1846.0, + 887.0, + 1846.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1511.0, + 809.0, + 1511.0, + 809.0, + 1549.0, + 295.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1511.0, + 1405.0, + 1511.0, + 1405.0, + 1549.0, + 983.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1541.0, + 1407.0, + 1541.0, + 1407.0, + 1579.0, + 292.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1574.0, + 962.0, + 1574.0, + 962.0, + 1608.0, + 295.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1640.0, + 609.0, + 1640.0, + 609.0, + 1678.0, + 295.0, + 1678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1640.0, + 1402.0, + 1640.0, + 1402.0, + 1678.0, + 625.0, + 1678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1670.0, + 587.0, + 1670.0, + 587.0, + 1708.0, + 294.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 1670.0, + 1270.0, + 1670.0, + 1270.0, + 1708.0, + 601.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1287.0, + 1670.0, + 1406.0, + 1670.0, + 1406.0, + 1708.0, + 1287.0, + 1708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1703.0, + 1309.0, + 1703.0, + 1309.0, + 1737.0, + 296.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1364.0, + 371.0, + 1364.0, + 371.0, + 1405.0, + 295.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 1364.0, + 1021.0, + 1364.0, + 1021.0, + 1405.0, + 436.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1056.0, + 1364.0, + 1165.0, + 1364.0, + 1165.0, + 1405.0, + 1056.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 1364.0, + 1407.0, + 1364.0, + 1407.0, + 1405.0, + 1180.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1400.0, + 1132.0, + 1400.0, + 1132.0, + 1432.0, + 296.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 1400.0, + 1170.0, + 1400.0, + 1170.0, + 1432.0, + 1158.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1400.0, + 1358.0, + 1400.0, + 1358.0, + 1432.0, + 1199.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1864.0, + 970.0, + 1864.0, + 970.0, + 1905.0, + 292.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1864.0, + 1406.0, + 1864.0, + 1406.0, + 1905.0, + 985.0, + 1905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1897.0, + 942.0, + 1897.0, + 942.0, + 1938.0, + 292.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1019.0, + 1897.0, + 1030.0, + 1897.0, + 1030.0, + 1938.0, + 1019.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 866.0, + 786.0, + 866.0, + 786.0, + 907.0, + 468.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 866.0, + 1405.0, + 866.0, + 1405.0, + 907.0, + 1322.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 894.0, + 297.0, + 894.0, + 297.0, + 942.0, + 293.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 894.0, + 817.0, + 894.0, + 817.0, + 942.0, + 330.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 894.0, + 842.0, + 894.0, + 842.0, + 942.0, + 832.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 894.0, + 1256.0, + 894.0, + 1256.0, + 942.0, + 1243.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 942.0, + 383.0, + 942.0, + 383.0, + 985.0, + 293.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 942.0, + 1404.0, + 942.0, + 1404.0, + 985.0, + 408.0, + 985.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1105, + 1403, + 1105, + 1403, + 1291, + 299, + 1291 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 297, + 916, + 1403, + 916, + 1403, + 1073, + 297, + 1073 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1427, + 1403, + 1427, + 1403, + 1582, + 297, + 1582 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1615, + 1403, + 1615, + 1403, + 1740, + 298, + 1740 + ], + "score": 0.977 + }, + { + "category_id": 4, + "poly": [ + 296, + 551, + 1405, + 551, + 1405, + 859, + 296, + 859 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 299, + 1910, + 1402, + 1910, + 1402, + 2035, + 299, + 2035 + ], + "score": 0.973 + }, + { + "category_id": 3, + "poly": [ + 299, + 225, + 1394, + 225, + 1394, + 524, + 299, + 524 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 418, + 1308, + 1280, + 1308, + 1280, + 1412, + 418, + 1412 + ], + "score": 0.953 + }, + { + "category_id": 0, + "poly": [ + 298, + 1783, + 1227, + 1783, + 1227, + 1821, + 298, + 1821 + ], + "score": 0.908 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1345, + 1399, + 1345, + 1399, + 1376, + 1352, + 1376 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 300, + 77, + 852, + 77, + 852, + 104, + 300, + 104 + ], + "score": 0.881 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.728 + }, + { + "category_id": 0, + "poly": [ + 295, + 1852, + 1065, + 1852, + 1065, + 1886, + 295, + 1886 + ], + "score": 0.274 + }, + { + "category_id": 14, + "poly": [ + 418, + 1304, + 1279, + 1304, + 1279, + 1415, + 418, + 1415 + ], + "score": 0.94, + "latex": "\\nabla _ { \\theta _ { i } } J _ { i } ( \\theta _ { i } ^ { \\prime } ( \\theta ) , \\theta _ { - i } ) = g _ { 1 } - \\frac { 1 } { M } \\sum _ { i = 1 } ^ { M } g _ { i } , \\quad g _ { i } = \\nabla _ { \\theta _ { i } } J _ { i } \\left( \\theta _ { i } + \\sum _ { j = 1 } ^ { i - 1 } g _ { j } , \\theta _ { - i } , \\theta _ { p } \\right) ," + }, + { + "category_id": 13, + "poly": [ + 634, + 980, + 806, + 980, + 806, + 1014, + 634, + 1014 + ], + "score": 0.93, + "latex": "J _ { i } ( \\pi _ { i } ^ { * } , \\pi _ { - i } , \\pi _ { p } )" + }, + { + "category_id": 13, + "poly": [ + 431, + 1520, + 504, + 1520, + 504, + 1551, + 431, + 1551 + ], + "score": 0.92, + "latex": "\\beta < 1" + }, + { + "category_id": 13, + "poly": [ + 694, + 1459, + 770, + 1459, + 770, + 1490, + 694, + 1490 + ], + "score": 0.91, + "latex": "\\beta < 1" + }, + { + "category_id": 13, + "poly": [ + 374, + 920, + 452, + 920, + 452, + 951, + 374, + 951 + ], + "score": 0.9, + "latex": "\\eta > 0" + }, + { + "category_id": 13, + "poly": [ + 879, + 1137, + 1199, + 1137, + 1199, + 1171, + 879, + 1171 + ], + "score": 0.89, + "latex": "\\nabla _ { \\boldsymbol { \\theta } _ { i } } \\left[ J _ { i } ( \\boldsymbol { \\theta } _ { i } ^ { \\prime } ( \\boldsymbol { \\theta } ) , \\boldsymbol { \\theta } _ { - i } ) - J _ { i } ( \\boldsymbol { \\theta } ) \\right]" + }, + { + "category_id": 13, + "poly": [ + 933, + 1430, + 959, + 1430, + 959, + 1459, + 933, + 1459 + ], + "score": 0.88, + "latex": "J _ { i }" + }, + { + "category_id": 13, + "poly": [ + 370, + 1433, + 396, + 1433, + 396, + 1460, + 370, + 1460 + ], + "score": 0.85, + "latex": "g _ { i }" + }, + { + "category_id": 13, + "poly": [ + 637, + 1460, + 658, + 1460, + 658, + 1490, + 637, + 1490 + ], + "score": 0.85, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 1253, + 954, + 1281, + 954, + 1281, + 980, + 1253, + 980 + ], + "score": 0.83, + "latex": "\\pi _ { i }" + }, + { + "category_id": 13, + "poly": [ + 988, + 1260, + 1020, + 1260, + 1020, + 1286, + 988, + 1286 + ], + "score": 0.81, + "latex": "M" + }, + { + "category_id": 13, + "poly": [ + 545, + 797, + 566, + 797, + 566, + 823, + 545, + 823 + ], + "score": 0.77, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 649, + 618, + 667, + 618, + 667, + 645, + 649, + 645 + ], + "score": 0.74, + "latex": "y" + }, + { + "category_id": 13, + "poly": [ + 1272, + 828, + 1291, + 828, + 1291, + 854, + 1272, + 854 + ], + "score": 0.74, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 984, + 925, + 1002, + 925, + 1002, + 951, + 984, + 951 + ], + "score": 0.71, + "latex": "\\eta" + }, + { + "category_id": 13, + "poly": [ + 868, + 832, + 883, + 832, + 883, + 854, + 868, + 854 + ], + "score": 0.7, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 307, + 619, + 326, + 619, + 326, + 641, + 307, + 641 + ], + "score": 0.67, + "latex": "\\scriptstyle { \\dot { x } }" + }, + { + "category_id": 13, + "poly": [ + 1214, + 1623, + 1228, + 1623, + 1228, + 1644, + 1214, + 1644 + ], + "score": 0.65, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 549, + 740, + 567, + 740, + 567, + 762, + 549, + 762 + ], + "score": 0.59, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 879, + 1137, + 924, + 1137, + 924, + 1170, + 879, + 1170 + ], + "score": 0.51, + "latex": "\\nabla _ { \\theta _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 1331, + 282, + 1384, + 282, + 1384, + 300, + 1331, + 300 + ], + "score": 0.39, + "latex": "\\lambda = 0 . 1" + }, + { + "category_id": 13, + "poly": [ + 1237, + 1551, + 1293, + 1551, + 1293, + 1583, + 1237, + 1583 + ], + "score": 0.33, + "latex": "\\operatorname { E q } 8" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 553.0, + 1403.0, + 553.0, + 1403.0, + 585.0, + 295.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 581.0, + 1403.0, + 581.0, + 1403.0, + 617.0, + 294.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 612.0, + 306.0, + 612.0, + 306.0, + 648.0, + 293.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 612.0, + 648.0, + 612.0, + 648.0, + 648.0, + 327.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 612.0, + 1405.0, + 612.0, + 1405.0, + 648.0, + 668.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 645.0, + 1405.0, + 645.0, + 1405.0, + 677.0, + 295.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 672.0, + 1407.0, + 672.0, + 1407.0, + 710.0, + 293.0, + 710.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 702.0, + 1403.0, + 702.0, + 1403.0, + 739.0, + 293.0, + 739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 734.0, + 548.0, + 734.0, + 548.0, + 770.0, + 294.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 734.0, + 1406.0, + 734.0, + 1406.0, + 770.0, + 568.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 765.0, + 1405.0, + 765.0, + 1405.0, + 801.0, + 294.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 796.0, + 544.0, + 796.0, + 544.0, + 831.0, + 294.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 796.0, + 1403.0, + 796.0, + 1403.0, + 831.0, + 567.0, + 831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 829.0, + 867.0, + 829.0, + 867.0, + 858.0, + 294.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 829.0, + 1271.0, + 829.0, + 1271.0, + 858.0, + 884.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1292.0, + 829.0, + 1301.0, + 829.0, + 1301.0, + 858.0, + 1292.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 227.0, + 646.0, + 227.0, + 646.0, + 255.0, + 376.0, + 255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 225.0, + 1007.0, + 225.0, + 1007.0, + 259.0, + 732.0, + 259.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 225.0, + 1346.0, + 225.0, + 1346.0, + 256.0, + 1115.0, + 256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 242.0, + 1100.0, + 242.0, + 1100.0, + 267.0, + 1051.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 256.0, + 529.0, + 256.0, + 529.0, + 283.0, + 385.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 265.0, + 605.0, + 265.0, + 605.0, + 280.0, + 584.0, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 260.0, + 660.0, + 260.0, + 660.0, + 285.0, + 606.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 661.0, + 255.0, + 751.0, + 255.0, + 751.0, + 431.0, + 661.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1329.0, + 260.0, + 1394.0, + 260.0, + 1394.0, + 285.0, + 1329.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 286.0, + 331.0, + 286.0, + 331.0, + 449.0, + 299.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 274.0, + 376.0, + 274.0, + 376.0, + 296.0, + 332.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 275.0, + 734.0, + 275.0, + 734.0, + 293.0, + 705.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 286.0, + 1049.0, + 286.0, + 1049.0, + 449.0, + 1018.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 282.0, + 1095.0, + 282.0, + 1095.0, + 303.0, + 1053.0, + 303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 287.0, + 1317.0, + 287.0, + 1317.0, + 298.0, + 1306.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1326.0, + 277.0, + 1330.0, + 277.0, + 1330.0, + 306.0, + 1326.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1385.0, + 277.0, + 1390.0, + 277.0, + 1390.0, + 306.0, + 1385.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 307.0, + 375.0, + 307.0, + 375.0, + 328.0, + 332.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 379.0, + 296.0, + 407.0, + 296.0, + 407.0, + 445.0, + 379.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 295.0, + 673.0, + 295.0, + 673.0, + 320.0, + 610.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 306.0, + 737.0, + 306.0, + 737.0, + 330.0, + 703.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 306.0, + 1260.0, + 306.0, + 1260.0, + 325.0, + 1232.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 308.0, + 1317.0, + 308.0, + 1317.0, + 318.0, + 1307.0, + 318.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1326.0, + 298.0, + 1376.0, + 298.0, + 1376.0, + 325.0, + 1326.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 315.0, + 668.0, + 315.0, + 668.0, + 340.0, + 609.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 321.0, + 1095.0, + 321.0, + 1095.0, + 342.0, + 1053.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 327.0, + 1317.0, + 327.0, + 1317.0, + 338.0, + 1306.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1326.0, + 320.0, + 1376.0, + 320.0, + 1376.0, + 345.0, + 1326.0, + 345.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 341.0, + 375.0, + 341.0, + 375.0, + 362.0, + 334.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 337.0, + 664.0, + 337.0, + 664.0, + 358.0, + 609.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 340.0, + 736.0, + 340.0, + 736.0, + 362.0, + 703.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 347.0, + 1317.0, + 347.0, + 1317.0, + 358.0, + 1306.0, + 358.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1326.0, + 340.0, + 1376.0, + 340.0, + 1376.0, + 365.0, + 1326.0, + 365.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 504.0, + 357.0, + 520.0, + 357.0, + 520.0, + 372.0, + 504.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 358.0, + 664.0, + 358.0, + 664.0, + 379.0, + 609.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 360.0, + 1095.0, + 360.0, + 1095.0, + 381.0, + 1053.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1257.0, + 360.0, + 1275.0, + 360.0, + 1275.0, + 375.0, + 1257.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 367.0, + 1318.0, + 367.0, + 1318.0, + 378.0, + 1306.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1326.0, + 360.0, + 1377.0, + 360.0, + 1377.0, + 384.0, + 1326.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 375.0, + 375.0, + 375.0, + 375.0, + 427.0, + 334.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 378.0, + 667.0, + 378.0, + 667.0, + 421.0, + 608.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 388.0, + 752.0, + 388.0, + 752.0, + 475.0, + 675.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 401.0, + 1094.0, + 401.0, + 1094.0, + 417.0, + 1078.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 406.0, + 1124.0, + 406.0, + 1124.0, + 421.0, + 1107.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1143.0, + 403.0, + 1155.0, + 403.0, + 1155.0, + 414.0, + 1143.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1303.0, + 386.0, + 1320.0, + 386.0, + 1320.0, + 401.0, + 1303.0, + 401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 379.0, + 1384.0, + 379.0, + 1384.0, + 404.0, + 1327.0, + 404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 443.0, + 373.0, + 443.0, + 373.0, + 461.0, + 329.0, + 461.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 436.0, + 391.0, + 436.0, + 391.0, + 451.0, + 376.0, + 451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 431.0, + 578.0, + 431.0, + 578.0, + 478.0, + 420.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 438.0, + 1094.0, + 438.0, + 1094.0, + 456.0, + 1051.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 442.0, + 1357.0, + 442.0, + 1357.0, + 478.0, + 1234.0, + 478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 354.0, + 480.0, + 642.0, + 480.0, + 642.0, + 504.0, + 354.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 482.0, + 789.0, + 482.0, + 789.0, + 503.0, + 726.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 793.0, + 478.0, + 1015.0, + 478.0, + 1015.0, + 505.0, + 793.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1081.0, + 482.0, + 1123.0, + 482.0, + 1123.0, + 503.0, + 1081.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 482.0, + 1193.0, + 482.0, + 1193.0, + 503.0, + 1151.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 482.0, + 1262.0, + 482.0, + 1262.0, + 503.0, + 1220.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1290.0, + 482.0, + 1331.0, + 482.0, + 1331.0, + 503.0, + 1290.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 497.0, + 632.0, + 497.0, + 632.0, + 524.0, + 390.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 792.0, + 494.0, + 950.0, + 494.0, + 950.0, + 526.0, + 792.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 497.0, + 1354.0, + 497.0, + 1354.0, + 525.0, + 1107.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 292.0, + 1237.0, + 292.0, + 1237.0, + 306.0, + 1234.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 378.0, + 644.0, + 378.0, + 644.0, + 397.0, + 608.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1781.0, + 1232.0, + 1781.0, + 1232.0, + 1825.0, + 292.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 107.0, + 298.0, + 107.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, + 1851.0, + 1068.0, + 1851.0, + 1068.0, + 1889.0, + 293.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1105.0, + 1405.0, + 1105.0, + 1405.0, + 1141.0, + 294.0, + 1141.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1137.0, + 878.0, + 1137.0, + 878.0, + 1172.0, + 295.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1200.0, + 1137.0, + 1405.0, + 1137.0, + 1405.0, + 1172.0, + 1200.0, + 1172.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1167.0, + 1407.0, + 1167.0, + 1407.0, + 1203.0, + 293.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1197.0, + 1407.0, + 1197.0, + 1407.0, + 1234.0, + 293.0, + 1234.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1226.0, + 1408.0, + 1226.0, + 1408.0, + 1264.0, + 290.0, + 1264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1258.0, + 987.0, + 1258.0, + 987.0, + 1292.0, + 295.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1021.0, + 1258.0, + 1340.0, + 1258.0, + 1340.0, + 1292.0, + 1021.0, + 1292.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 918.0, + 373.0, + 918.0, + 373.0, + 952.0, + 297.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 918.0, + 983.0, + 918.0, + 983.0, + 952.0, + 453.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 918.0, + 1404.0, + 918.0, + 1404.0, + 952.0, + 1003.0, + 952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 946.0, + 1252.0, + 946.0, + 1252.0, + 986.0, + 292.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1282.0, + 946.0, + 1405.0, + 946.0, + 1405.0, + 986.0, + 1282.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 978.0, + 633.0, + 978.0, + 633.0, + 1016.0, + 292.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 978.0, + 1405.0, + 978.0, + 1405.0, + 1016.0, + 807.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1009.0, + 1405.0, + 1009.0, + 1405.0, + 1047.0, + 295.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1040.0, + 1381.0, + 1040.0, + 1381.0, + 1077.0, + 295.0, + 1077.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1426.0, + 369.0, + 1426.0, + 369.0, + 1465.0, + 294.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 397.0, + 1426.0, + 932.0, + 1426.0, + 932.0, + 1465.0, + 397.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 1426.0, + 1405.0, + 1426.0, + 1405.0, + 1465.0, + 960.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1455.0, + 636.0, + 1455.0, + 636.0, + 1495.0, + 292.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 659.0, + 1455.0, + 693.0, + 1455.0, + 693.0, + 1495.0, + 659.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 771.0, + 1455.0, + 1405.0, + 1455.0, + 1405.0, + 1495.0, + 771.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1487.0, + 1406.0, + 1487.0, + 1406.0, + 1527.0, + 291.0, + 1527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1516.0, + 430.0, + 1516.0, + 430.0, + 1556.0, + 292.0, + 1556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 1516.0, + 1407.0, + 1516.0, + 1407.0, + 1556.0, + 505.0, + 1556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1552.0, + 1236.0, + 1552.0, + 1236.0, + 1586.0, + 295.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1294.0, + 1552.0, + 1301.0, + 1552.0, + 1301.0, + 1586.0, + 1294.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1615.0, + 1213.0, + 1615.0, + 1213.0, + 1652.0, + 294.0, + 1652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1229.0, + 1615.0, + 1404.0, + 1615.0, + 1404.0, + 1652.0, + 1229.0, + 1652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1646.0, + 1407.0, + 1646.0, + 1407.0, + 1682.0, + 293.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1679.0, + 1407.0, + 1679.0, + 1407.0, + 1711.0, + 293.0, + 1711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1706.0, + 1379.0, + 1706.0, + 1379.0, + 1747.0, + 293.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1908.0, + 1406.0, + 1908.0, + 1406.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1943.0, + 1404.0, + 1943.0, + 1404.0, + 1976.0, + 294.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1974.0, + 1404.0, + 1974.0, + 1404.0, + 2006.0, + 294.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 1406.0, + 2003.0, + 1406.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 803, + 1403, + 803, + 1403, + 1170, + 298, + 1170 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1628, + 1404, + 1628, + 1404, + 1934, + 297, + 1934 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1214, + 1404, + 1214, + 1404, + 1521, + 297, + 1521 + ], + "score": 0.979 + }, + { + "category_id": 3, + "poly": [ + 301, + 231, + 1393, + 231, + 1393, + 552, + 301, + 552 + ], + "score": 0.965 + }, + { + "category_id": 4, + "poly": [ + 296, + 582, + 1404, + 582, + 1404, + 735, + 296, + 735 + ], + "score": 0.965 + }, + { + "category_id": 0, + "poly": [ + 299, + 1568, + 999, + 1568, + 999, + 1599, + 299, + 1599 + ], + "score": 0.903 + }, + { + "category_id": 2, + "poly": [ + 321, + 2005, + 1376, + 2005, + 1376, + 2035, + 321, + 2035 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 300, + 77, + 852, + 77, + 852, + 103, + 300, + 103 + ], + "score": 0.822 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 859, + 2089, + 859, + 2112, + 840, + 2112 + ], + "score": 0.797 + }, + { + "category_id": 13, + "poly": [ + 790, + 835, + 967, + 835, + 967, + 868, + 790, + 868 + ], + "score": 0.93, + "latex": "r _ { 1 } ( i , j ) , r _ { 2 } ( i , j )" + }, + { + "category_id": 13, + "poly": [ + 398, + 1017, + 482, + 1017, + 482, + 1052, + 398, + 1052 + ], + "score": 0.93, + "latex": "r _ { p } ( i , j )" + }, + { + "category_id": 13, + "poly": [ + 1289, + 804, + 1347, + 804, + 1347, + 838, + 1289, + 838 + ], + "score": 0.91, + "latex": "( i , j )" + }, + { + "category_id": 13, + "poly": [ + 797, + 1631, + 825, + 1631, + 825, + 1660, + 797, + 1660 + ], + "score": 0.87, + "latex": "\\lambda _ { i }" + }, + { + "category_id": 13, + "poly": [ + 829, + 644, + 850, + 644, + 850, + 675, + 829, + 675 + ], + "score": 0.84, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 1324, + 841, + 1352, + 841, + 1352, + 867, + 1324, + 867 + ], + "score": 0.84, + "latex": "r _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 870, + 325, + 870, + 325, + 897, + 297, + 897 + ], + "score": 0.83, + "latex": "r _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 814, + 2010, + 830, + 2010, + 830, + 2029, + 814, + 2029 + ], + "score": 0.81, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 625, + 1905, + 645, + 1905, + 645, + 1931, + 625, + 1931 + ], + "score": 0.79, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 905, + 1875, + 924, + 1875, + 924, + 1901, + 905, + 1901 + ], + "score": 0.79, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 511, + 1875, + 531, + 1875, + 531, + 1902, + 511, + 1902 + ], + "score": 0.75, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 404, + 1692, + 423, + 1692, + 423, + 1718, + 404, + 1718 + ], + "score": 0.74, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 297, + 1814, + 320, + 1814, + 320, + 1841, + 297, + 1841 + ], + "score": 0.72, + "latex": "\\lambda" + }, + { + "category_id": 13, + "poly": [ + 979, + 1692, + 1001, + 1692, + 1001, + 1718, + 979, + 1718 + ], + "score": 0.67, + "latex": "\\boldsymbol { \\lambda }" + }, + { + "category_id": 13, + "poly": [ + 1257, + 1814, + 1280, + 1814, + 1280, + 1841, + 1257, + 1841 + ], + "score": 0.65, + "latex": "\\boldsymbol { \\lambda }" + }, + { + "category_id": 13, + "poly": [ + 937, + 1373, + 952, + 1373, + 952, + 1395, + 937, + 1395 + ], + "score": 0.65, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1183, + 1848, + 1198, + 1848, + 1198, + 1870, + 1183, + 1870 + ], + "score": 0.65, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1142, + 1631, + 1165, + 1631, + 1165, + 1657, + 1142, + 1657 + ], + "score": 0.62, + "latex": "\\boldsymbol { \\lambda }" + }, + { + "category_id": 13, + "poly": [ + 1068, + 1312, + 1084, + 1312, + 1084, + 1335, + 1068, + 1335 + ], + "score": 0.62, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1182, + 1753, + 1204, + 1753, + 1204, + 1779, + 1182, + 1779 + ], + "score": 0.61, + "latex": "\\boldsymbol { \\lambda }" + }, + { + "category_id": 13, + "poly": [ + 445, + 1221, + 459, + 1221, + 459, + 1244, + 445, + 1244 + ], + "score": 0.6, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1230, + 1879, + 1245, + 1879, + 1245, + 1902, + 1230, + 1902 + ], + "score": 0.58, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1204, + 1343, + 1220, + 1343, + 1220, + 1365, + 1204, + 1365 + ], + "score": 0.56, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 781, + 1753, + 803, + 1753, + 803, + 1779, + 781, + 1779 + ], + "score": 0.53, + "latex": "\\boldsymbol { \\lambda }" + }, + { + "category_id": 13, + "poly": [ + 607, + 1344, + 624, + 1344, + 624, + 1365, + 607, + 1365 + ], + "score": 0.51, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 869, + 1251, + 886, + 1251, + 886, + 1273, + 869, + 1273 + ], + "score": 0.44, + "latex": "\\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } = \\mathbf { \\dot { X } } - \\mathbf { \\dot { X } } ." + }, + { + "category_id": 13, + "poly": [ + 749, + 1434, + 764, + 1434, + 764, + 1456, + 749, + 1456 + ], + "score": 0.26, + "latex": "\\epsilon" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 236.0, + 791.0, + 236.0, + 791.0, + 264.0, + 718.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 237.0, + 954.0, + 237.0, + 954.0, + 261.0, + 866.0, + 261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1028.0, + 236.0, + 1100.0, + 236.0, + 1100.0, + 264.0, + 1028.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 285.0, + 379.0, + 285.0, + 379.0, + 305.0, + 334.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 693.0, + 281.0, + 743.0, + 281.0, + 743.0, + 305.0, + 693.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 281.0, + 1099.0, + 281.0, + 1099.0, + 305.0, + 1051.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 316.0, + 331.0, + 316.0, + 331.0, + 472.0, + 302.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 334.0, + 310.0, + 375.0, + 310.0, + 375.0, + 354.0, + 334.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 297.0, + 753.0, + 297.0, + 753.0, + 415.0, + 652.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 956.0, + 299.0, + 1017.0, + 299.0, + 1017.0, + 334.0, + 956.0, + 334.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 316.0, + 1092.0, + 316.0, + 1092.0, + 397.0, + 1027.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 345.0, + 813.0, + 345.0, + 813.0, + 375.0, + 760.0, + 375.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 694.0, + 348.0, + 733.0, + 348.0, + 733.0, + 370.0, + 694.0, + 370.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 359.0, + 376.0, + 359.0, + 376.0, + 380.0, + 335.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 384.0, + 376.0, + 384.0, + 376.0, + 405.0, + 335.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 673.0, + 382.0, + 734.0, + 382.0, + 734.0, + 412.0, + 673.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 375.0, + 1092.0, + 375.0, + 1092.0, + 413.0, + 1030.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 408.0, + 375.0, + 408.0, + 375.0, + 429.0, + 335.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 426.0, + 661.0, + 426.0, + 661.0, + 442.0, + 625.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 666.0, + 404.0, + 734.0, + 404.0, + 734.0, + 472.0, + 666.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 402.0, + 1092.0, + 402.0, + 1092.0, + 473.0, + 1027.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 357.0, + 435.0, + 378.0, + 435.0, + 378.0, + 454.0, + 357.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 448.0, + 734.0, + 448.0, + 734.0, + 469.0, + 692.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 330.0, + 460.0, + 375.0, + 460.0, + 375.0, + 476.0, + 330.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 462.0, + 660.0, + 462.0, + 660.0, + 487.0, + 495.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 467.0, + 1093.0, + 467.0, + 1093.0, + 487.0, + 1052.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 482.0, + 376.0, + 482.0, + 376.0, + 503.0, + 328.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 479.0, + 736.0, + 479.0, + 736.0, + 504.0, + 692.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 375.0, + 506.0, + 395.0, + 506.0, + 395.0, + 525.0, + 375.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 505.0, + 472.0, + 505.0, + 472.0, + 525.0, + 425.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 486.0, + 505.0, + 533.0, + 505.0, + 533.0, + 525.0, + 486.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 548.0, + 505.0, + 594.0, + 505.0, + 594.0, + 525.0, + 548.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 505.0, + 656.0, + 505.0, + 656.0, + 525.0, + 609.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 508.0, + 751.0, + 508.0, + 751.0, + 524.0, + 735.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 505.0, + 831.0, + 505.0, + 831.0, + 525.0, + 784.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 843.0, + 505.0, + 892.0, + 505.0, + 892.0, + 525.0, + 843.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 505.0, + 955.0, + 505.0, + 955.0, + 525.0, + 904.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 964.0, + 505.0, + 1015.0, + 505.0, + 1015.0, + 525.0, + 964.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1094.0, + 508.0, + 1110.0, + 508.0, + 1110.0, + 524.0, + 1094.0, + 524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 504.0, + 1188.0, + 504.0, + 1188.0, + 528.0, + 1140.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1202.0, + 505.0, + 1249.0, + 505.0, + 1249.0, + 525.0, + 1202.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 505.0, + 1311.0, + 505.0, + 1311.0, + 525.0, + 1264.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1326.0, + 505.0, + 1372.0, + 505.0, + 1372.0, + 525.0, + 1326.0, + 525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 781.0, + 522.0, + 991.0, + 522.0, + 991.0, + 552.0, + 781.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 421.0, + 324.0, + 475.0, + 324.0, + 475.0, + 352.5, + 421.0, + 352.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1169.75, + 380.5, + 1194.75, + 380.5, + 1194.75, + 392.5, + 1169.75, + 392.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 583.0, + 1404.0, + 583.0, + 1404.0, + 616.0, + 295.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 612.0, + 1404.0, + 612.0, + 1404.0, + 648.0, + 293.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 643.0, + 828.0, + 643.0, + 828.0, + 680.0, + 294.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 643.0, + 1405.0, + 643.0, + 1405.0, + 680.0, + 851.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 669.0, + 1404.0, + 669.0, + 1404.0, + 713.0, + 294.0, + 713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 703.0, + 1000.0, + 703.0, + 1000.0, + 740.0, + 295.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1567.0, + 1002.0, + 1567.0, + 1002.0, + 1603.0, + 295.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1998.0, + 813.0, + 1998.0, + 813.0, + 2039.0, + 329.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 1998.0, + 1380.0, + 1998.0, + 1380.0, + 2039.0, + 831.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 70.0, + 857.0, + 70.0, + 857.0, + 109.0, + 295.0, + 109.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": [ + 294.0, + 803.0, + 1288.0, + 803.0, + 1288.0, + 841.0, + 294.0, + 841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 803.0, + 1404.0, + 803.0, + 1404.0, + 841.0, + 1348.0, + 841.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 836.0, + 789.0, + 836.0, + 789.0, + 873.0, + 293.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 836.0, + 1323.0, + 836.0, + 1323.0, + 873.0, + 968.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 836.0, + 1407.0, + 836.0, + 1407.0, + 873.0, + 1353.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 866.0, + 1403.0, + 866.0, + 1403.0, + 900.0, + 326.0, + 900.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 898.0, + 1405.0, + 898.0, + 1405.0, + 932.0, + 294.0, + 932.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 926.0, + 1407.0, + 926.0, + 1407.0, + 963.0, + 293.0, + 963.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 959.0, + 1405.0, + 959.0, + 1405.0, + 993.0, + 294.0, + 993.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 989.0, + 1405.0, + 989.0, + 1405.0, + 1023.0, + 294.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1017.0, + 397.0, + 1017.0, + 397.0, + 1052.0, + 291.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1017.0, + 1406.0, + 1017.0, + 1406.0, + 1052.0, + 483.0, + 1052.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1046.0, + 1407.0, + 1046.0, + 1407.0, + 1085.0, + 291.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1079.0, + 1405.0, + 1079.0, + 1405.0, + 1113.0, + 294.0, + 1113.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1107.0, + 1407.0, + 1107.0, + 1407.0, + 1147.0, + 292.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1140.0, + 840.0, + 1140.0, + 840.0, + 1174.0, + 296.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1629.0, + 796.0, + 1629.0, + 796.0, + 1664.0, + 295.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 826.0, + 1629.0, + 1141.0, + 1629.0, + 1141.0, + 1664.0, + 826.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 1629.0, + 1404.0, + 1629.0, + 1404.0, + 1664.0, + 1166.0, + 1664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1660.0, + 1406.0, + 1660.0, + 1406.0, + 1696.0, + 294.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1690.0, + 403.0, + 1690.0, + 403.0, + 1725.0, + 294.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1690.0, + 978.0, + 1690.0, + 978.0, + 1725.0, + 424.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 1690.0, + 1406.0, + 1690.0, + 1406.0, + 1725.0, + 1002.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1720.0, + 1405.0, + 1720.0, + 1405.0, + 1758.0, + 292.0, + 1758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1752.0, + 780.0, + 1752.0, + 780.0, + 1787.0, + 294.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 1752.0, + 1181.0, + 1752.0, + 1181.0, + 1787.0, + 804.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 1752.0, + 1405.0, + 1752.0, + 1405.0, + 1787.0, + 1205.0, + 1787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1782.0, + 1405.0, + 1782.0, + 1405.0, + 1818.0, + 292.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1811.0, + 1256.0, + 1811.0, + 1256.0, + 1847.0, + 321.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1281.0, + 1811.0, + 1406.0, + 1811.0, + 1406.0, + 1847.0, + 1281.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1841.0, + 1182.0, + 1841.0, + 1182.0, + 1877.0, + 292.0, + 1877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1841.0, + 1407.0, + 1841.0, + 1407.0, + 1877.0, + 1199.0, + 1877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1874.0, + 510.0, + 1874.0, + 510.0, + 1909.0, + 294.0, + 1909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 532.0, + 1874.0, + 904.0, + 1874.0, + 904.0, + 1909.0, + 532.0, + 1909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 1874.0, + 1229.0, + 1874.0, + 1229.0, + 1909.0, + 925.0, + 1909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 1874.0, + 1406.0, + 1874.0, + 1406.0, + 1909.0, + 1246.0, + 1909.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1902.0, + 624.0, + 1902.0, + 624.0, + 1938.0, + 292.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1902.0, + 1341.0, + 1902.0, + 1341.0, + 1938.0, + 646.0, + 1938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1215.0, + 444.0, + 1215.0, + 444.0, + 1250.0, + 294.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 1215.0, + 1404.0, + 1215.0, + 1404.0, + 1250.0, + 460.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1245.0, + 868.0, + 1245.0, + 868.0, + 1281.0, + 294.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 1245.0, + 1406.0, + 1245.0, + 1406.0, + 1281.0, + 887.0, + 1281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1275.0, + 1406.0, + 1275.0, + 1406.0, + 1312.0, + 294.0, + 1312.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1306.0, + 1067.0, + 1306.0, + 1067.0, + 1341.0, + 292.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 1306.0, + 1405.0, + 1306.0, + 1405.0, + 1341.0, + 1085.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1334.0, + 606.0, + 1334.0, + 606.0, + 1373.0, + 292.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1334.0, + 1203.0, + 1334.0, + 1203.0, + 1373.0, + 625.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 1334.0, + 1405.0, + 1334.0, + 1405.0, + 1373.0, + 1221.0, + 1373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1367.0, + 936.0, + 1367.0, + 936.0, + 1403.0, + 294.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 953.0, + 1367.0, + 1406.0, + 1367.0, + 1406.0, + 1403.0, + 953.0, + 1403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1395.0, + 1405.0, + 1395.0, + 1405.0, + 1435.0, + 292.0, + 1435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1429.0, + 748.0, + 1429.0, + 748.0, + 1463.0, + 292.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 1429.0, + 1404.0, + 1429.0, + 1404.0, + 1463.0, + 765.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1458.0, + 1407.0, + 1458.0, + 1407.0, + 1496.0, + 291.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1490.0, + 532.0, + 1490.0, + 532.0, + 1525.0, + 294.0, + 1525.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1556, + 1402, + 1556, + 1402, + 1806, + 298, + 1806 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 754, + 1404, + 754, + 1404, + 1032, + 297, + 1032 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 297, + 1301, + 1404, + 1301, + 1404, + 1515, + 297, + 1515 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1819, + 1403, + 1819, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 1136, + 1403, + 1136, + 1403, + 1258, + 298, + 1258 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 296, + 534, + 1405, + 534, + 1405, + 687, + 296, + 687 + ], + "score": 0.966 + }, + { + "category_id": 3, + "poly": [ + 302, + 229, + 1396, + 229, + 1396, + 505, + 302, + 505 + ], + "score": 0.932 + }, + { + "category_id": 2, + "poly": [ + 299, + 77, + 852, + 77, + 852, + 104, + 299, + 104 + ], + "score": 0.858 + }, + { + "category_id": 0, + "poly": [ + 298, + 1076, + 1029, + 1076, + 1029, + 1107, + 298, + 1107 + ], + "score": 0.676 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 858, + 2088, + 858, + 2111, + 842, + 2111 + ], + "score": 0.666 + }, + { + "category_id": 1, + "poly": [ + 298, + 1076, + 1029, + 1076, + 1029, + 1107, + 298, + 1107 + ], + "score": 0.234 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 859, + 2088, + 859, + 2111, + 842, + 2111 + ], + "score": 0.198 + }, + { + "category_id": 3, + "poly": [ + 302, + 230, + 1395, + 230, + 1395, + 504, + 302, + 504 + ], + "score": 0.137 + }, + { + "category_id": 13, + "poly": [ + 1244, + 1617, + 1393, + 1617, + 1393, + 1652, + 1244, + 1652 + ], + "score": 0.92, + "latex": "\\bar { a r } _ { p } ( i , j ) - a ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1159, + 1682, + 1326, + 1682, + 1326, + 1716, + 1159, + 1716 + ], + "score": 0.92, + "latex": "r _ { i } ^ { \\prime } = r _ { i } - Q r _ { p }" + }, + { + "category_id": 13, + "poly": [ + 751, + 1620, + 820, + 1620, + 820, + 1649, + 751, + 1649 + ], + "score": 0.92, + "latex": "a \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 708, + 1744, + 783, + 1744, + 783, + 1774, + 708, + 1774 + ], + "score": 0.91, + "latex": "Q = 0" + }, + { + "category_id": 13, + "poly": [ + 528, + 1852, + 643, + 1852, + 643, + 1882, + 528, + 1882 + ], + "score": 0.91, + "latex": "Q _ { \\mathrm { t r a i n } } = 0" + }, + { + "category_id": 13, + "poly": [ + 366, + 878, + 446, + 878, + 446, + 909, + 366, + 909 + ], + "score": 0.91, + "latex": "\\beta = 0" + }, + { + "category_id": 13, + "poly": [ + 722, + 1912, + 859, + 1912, + 859, + 1944, + 722, + 1944 + ], + "score": 0.91, + "latex": "Q _ { \\mathrm { t e s t } } > 0 . 3" + }, + { + "category_id": 13, + "poly": [ + 753, + 1713, + 841, + 1713, + 841, + 1744, + 753, + 1744 + ], + "score": 0.91, + "latex": "Q \\leq 1" + }, + { + "category_id": 13, + "poly": [ + 777, + 1775, + 874, + 1775, + 874, + 1806, + 777, + 1806 + ], + "score": 0.91, + "latex": "Q = 0 . 5" + }, + { + "category_id": 13, + "poly": [ + 357, + 1912, + 502, + 1912, + 502, + 1944, + 357, + 1944 + ], + "score": 0.91, + "latex": "Q _ { \\mathrm { t r a i n } } = 0 . 5" + }, + { + "category_id": 13, + "poly": [ + 436, + 1882, + 549, + 1882, + 549, + 1913, + 436, + 1913 + ], + "score": 0.91, + "latex": "Q _ { \\mathrm { t r a i n } } = 0" + }, + { + "category_id": 13, + "poly": [ + 297, + 1851, + 435, + 1851, + 435, + 1883, + 297, + 1883 + ], + "score": 0.91, + "latex": "Q _ { \\mathrm { t r a i n } } = 0 . 5" + }, + { + "category_id": 13, + "poly": [ + 1191, + 1943, + 1331, + 1943, + 1331, + 1974, + 1191, + 1974 + ], + "score": 0.91, + "latex": "Q _ { \\mathrm { t r a i n } } = 0 . 5" + }, + { + "category_id": 13, + "poly": [ + 1005, + 1851, + 1143, + 1851, + 1143, + 1882, + 1005, + 1882 + ], + "score": 0.9, + "latex": "Q _ { \\mathrm { t r a i n } } = 0 . 5" + }, + { + "category_id": 13, + "poly": [ + 986, + 1883, + 1112, + 1883, + 1112, + 1913, + 986, + 1913 + ], + "score": 0.89, + "latex": "Q _ { \\mathrm { t e s t } } < 0 . 3" + }, + { + "category_id": 13, + "poly": [ + 497, + 967, + 589, + 967, + 589, + 1004, + 497, + 1004 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { ( \\bar { \\beta } > \\frac { 1 } { N } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 790, + 1142, + 822, + 1142, + 822, + 1170, + 790, + 1170 + ], + "score": 0.87, + "latex": "\\pi _ { p }" + }, + { + "category_id": 13, + "poly": [ + 781, + 969, + 863, + 969, + 863, + 1000, + 781, + 1000 + ], + "score": 0.86, + "latex": "( \\beta \\sim 0 )" + }, + { + "category_id": 13, + "poly": [ + 1189, + 1650, + 1220, + 1650, + 1220, + 1679, + 1189, + 1679 + ], + "score": 0.86, + "latex": "a ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 474, + 909, + 495, + 909, + 495, + 939, + 474, + 939 + ], + "score": 0.86, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 766, + 1001, + 787, + 1001, + 787, + 1031, + 766, + 1031 + ], + "score": 0.86, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 644, + 940, + 664, + 940, + 664, + 970, + 644, + 970 + ], + "score": 0.85, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 846, + 566, + 872, + 566, + 872, + 598, + 846, + 598 + ], + "score": 0.84, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 689, + 1775, + 712, + 1775, + 712, + 1805, + 689, + 1805 + ], + "score": 0.84, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 297, + 1717, + 323, + 1717, + 323, + 1743, + 297, + 1743 + ], + "score": 0.83, + "latex": "r _ { i }" + }, + { + "category_id": 13, + "poly": [ + 326, + 939, + 347, + 939, + 347, + 970, + 326, + 970 + ], + "score": 0.82, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 916, + 848, + 937, + 848, + 937, + 878, + 916, + 878 + ], + "score": 0.82, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 536, + 627, + 561, + 627, + 561, + 658, + 536, + 658 + ], + "score": 0.77, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 807, + 1658, + 826, + 1658, + 826, + 1680, + 807, + 1680 + ], + "score": 0.69, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 526, + 1687, + 543, + 1687, + 543, + 1709, + 526, + 1709 + ], + "score": 0.64, + "latex": "a" + }, + { + "category_id": 13, + "poly": [ + 1178, + 943, + 1193, + 943, + 1193, + 966, + 1178, + 966 + ], + "score": 0.59, + "latex": "\\epsilon" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 535.0, + 1403.0, + 535.0, + 1403.0, + 568.0, + 295.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 563.0, + 845.0, + 563.0, + 845.0, + 601.0, + 293.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 563.0, + 1403.0, + 563.0, + 1403.0, + 601.0, + 873.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 596.0, + 1403.0, + 596.0, + 1403.0, + 629.0, + 294.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 626.0, + 535.0, + 626.0, + 535.0, + 663.0, + 294.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 562.0, + 626.0, + 1405.0, + 626.0, + 1405.0, + 663.0, + 562.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 657.0, + 1256.0, + 657.0, + 1256.0, + 690.0, + 295.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 228.0, + 881.0, + 228.0, + 881.0, + 399.0, + 849.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 248.0, + 773.0, + 248.0, + 773.0, + 274.0, + 713.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 251.0, + 932.0, + 251.0, + 932.0, + 278.0, + 885.0, + 278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 257.0, + 383.0, + 257.0, + 383.0, + 283.0, + 335.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 268.0, + 764.0, + 268.0, + 764.0, + 294.0, + 712.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 273.0, + 330.0, + 273.0, + 330.0, + 428.0, + 302.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 278.0, + 932.0, + 278.0, + 932.0, + 304.0, + 885.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 289.0, + 383.0, + 289.0, + 383.0, + 315.0, + 335.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 712.0, + 289.0, + 822.0, + 289.0, + 822.0, + 313.0, + 712.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 313.0, + 713.0, + 313.0, + 713.0, + 328.0, + 686.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 311.0, + 745.0, + 311.0, + 745.0, + 330.0, + 715.0, + 330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 307.0, + 931.0, + 307.0, + 931.0, + 329.0, + 886.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 321.0, + 384.0, + 321.0, + 384.0, + 347.0, + 335.0, + 347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 330.0, + 835.0, + 330.0, + 835.0, + 351.0, + 715.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 912.0, + 336.0, + 932.0, + 336.0, + 932.0, + 357.0, + 912.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 354.0, + 381.0, + 354.0, + 381.0, + 376.0, + 337.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 359.0, + 932.0, + 359.0, + 932.0, + 385.0, + 881.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 387.0, + 384.0, + 387.0, + 384.0, + 409.0, + 361.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 384.0, + 931.0, + 384.0, + 931.0, + 476.0, + 852.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 415.0, + 383.0, + 415.0, + 383.0, + 441.0, + 328.0, + 441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 413.0, + 932.0, + 413.0, + 932.0, + 439.0, + 881.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 441.0, + 932.0, + 441.0, + 932.0, + 464.0, + 883.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 460.0, + 422.0, + 460.0, + 422.0, + 483.0, + 389.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 460.0, + 483.0, + 460.0, + 483.0, + 483.0, + 446.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 493.0, + 458.0, + 544.0, + 458.0, + 544.0, + 485.0, + 493.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 458.0, + 601.0, + 458.0, + 601.0, + 483.0, + 565.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 458.0, + 661.0, + 458.0, + 661.0, + 482.0, + 625.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 458.0, + 721.0, + 458.0, + 721.0, + 483.0, + 685.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 458.0, + 779.0, + 458.0, + 779.0, + 483.0, + 743.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 458.0, + 838.0, + 458.0, + 838.0, + 483.0, + 804.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 458.0, + 973.0, + 458.0, + 973.0, + 483.0, + 937.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 457.0, + 1037.0, + 457.0, + 1037.0, + 485.0, + 993.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 457.0, + 1098.0, + 457.0, + 1098.0, + 485.0, + 1054.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 457.0, + 1218.0, + 457.0, + 1218.0, + 485.0, + 1105.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1227.0, + 456.0, + 1349.0, + 456.0, + 1349.0, + 486.0, + 1227.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 458.0, + 1388.0, + 458.0, + 1388.0, + 482.0, + 1351.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 475.0, + 822.0, + 475.0, + 822.0, + 507.0, + 410.0, + 507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 957.0, + 475.0, + 1370.0, + 475.0, + 1370.0, + 507.0, + 957.0, + 507.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": [ + 295.0, + 1074.0, + 1033.0, + 1074.0, + 1033.0, + 1110.0, + 295.0, + 1110.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": [ + 848.0, + 227.0, + 881.0, + 227.0, + 881.0, + 399.0, + 848.0, + 399.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 250.0, + 773.0, + 250.0, + 773.0, + 272.0, + 714.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 251.0, + 934.0, + 251.0, + 934.0, + 277.0, + 886.0, + 277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 257.0, + 382.0, + 257.0, + 382.0, + 283.0, + 335.0, + 283.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 268.0, + 763.0, + 268.0, + 763.0, + 294.0, + 713.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 274.0, + 330.0, + 274.0, + 330.0, + 428.0, + 302.0, + 428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 279.0, + 933.0, + 279.0, + 933.0, + 305.0, + 885.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 286.0, + 821.0, + 286.0, + 821.0, + 315.0, + 711.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 288.0, + 382.0, + 288.0, + 382.0, + 315.0, + 335.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 686.0, + 309.0, + 745.0, + 309.0, + 745.0, + 332.0, + 686.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 887.0, + 307.0, + 932.0, + 307.0, + 932.0, + 329.0, + 887.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 320.0, + 384.0, + 320.0, + 384.0, + 346.0, + 335.0, + 346.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 328.0, + 836.0, + 328.0, + 836.0, + 353.0, + 713.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 336.0, + 933.0, + 336.0, + 933.0, + 357.0, + 913.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 354.0, + 381.0, + 354.0, + 381.0, + 376.0, + 337.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 359.0, + 933.0, + 359.0, + 933.0, + 385.0, + 881.0, + 385.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 386.0, + 385.0, + 386.0, + 385.0, + 409.0, + 363.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 386.0, + 933.0, + 386.0, + 933.0, + 475.0, + 854.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 416.0, + 382.0, + 416.0, + 382.0, + 442.0, + 329.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 415.0, + 932.0, + 415.0, + 932.0, + 437.0, + 881.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 441.0, + 933.0, + 441.0, + 933.0, + 463.0, + 881.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 460.0, + 422.0, + 460.0, + 422.0, + 484.0, + 389.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 459.0, + 487.0, + 459.0, + 487.0, + 483.0, + 447.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 459.0, + 543.0, + 459.0, + 543.0, + 483.0, + 506.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 459.0, + 601.0, + 459.0, + 601.0, + 483.0, + 565.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 459.0, + 662.0, + 459.0, + 662.0, + 483.0, + 625.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 459.0, + 721.0, + 459.0, + 721.0, + 483.0, + 684.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 459.0, + 779.0, + 459.0, + 779.0, + 483.0, + 743.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 804.0, + 459.0, + 837.0, + 459.0, + 837.0, + 484.0, + 804.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 459.0, + 973.0, + 459.0, + 973.0, + 484.0, + 938.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 995.0, + 459.0, + 1035.0, + 459.0, + 1035.0, + 483.0, + 995.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1055.0, + 459.0, + 1095.0, + 459.0, + 1095.0, + 483.0, + 1055.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 458.0, + 1162.0, + 458.0, + 1162.0, + 484.0, + 1113.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 458.0, + 1220.0, + 458.0, + 1220.0, + 484.0, + 1170.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 455.0, + 1348.0, + 455.0, + 1348.0, + 485.0, + 1224.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 459.0, + 1388.0, + 459.0, + 1388.0, + 483.0, + 1351.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 477.0, + 821.0, + 477.0, + 821.0, + 505.0, + 411.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 958.0, + 476.0, + 1370.0, + 476.0, + 1370.0, + 506.0, + 958.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1556.0, + 1406.0, + 1556.0, + 1406.0, + 1594.0, + 294.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1587.0, + 1403.0, + 1587.0, + 1403.0, + 1621.0, + 293.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1618.0, + 750.0, + 1618.0, + 750.0, + 1653.0, + 292.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 1618.0, + 1243.0, + 1618.0, + 1243.0, + 1653.0, + 821.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1618.0, + 1404.0, + 1618.0, + 1404.0, + 1653.0, + 1394.0, + 1653.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1647.0, + 806.0, + 1647.0, + 806.0, + 1687.0, + 292.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 827.0, + 1647.0, + 1188.0, + 1647.0, + 1188.0, + 1687.0, + 827.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 1647.0, + 1406.0, + 1647.0, + 1406.0, + 1687.0, + 1221.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1681.0, + 525.0, + 1681.0, + 525.0, + 1719.0, + 293.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 544.0, + 1681.0, + 1158.0, + 1681.0, + 1158.0, + 1719.0, + 544.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 1681.0, + 1406.0, + 1681.0, + 1406.0, + 1719.0, + 1327.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1710.0, + 296.0, + 1710.0, + 296.0, + 1750.0, + 292.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1710.0, + 752.0, + 1710.0, + 752.0, + 1750.0, + 324.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 1710.0, + 1406.0, + 1710.0, + 1406.0, + 1750.0, + 842.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1743.0, + 707.0, + 1743.0, + 707.0, + 1777.0, + 294.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1743.0, + 1404.0, + 1743.0, + 1404.0, + 1777.0, + 784.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1773.0, + 688.0, + 1773.0, + 688.0, + 1807.0, + 293.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 1773.0, + 776.0, + 1773.0, + 776.0, + 1807.0, + 713.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1773.0, + 1357.0, + 1773.0, + 1357.0, + 1807.0, + 875.0, + 1807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 754.0, + 1402.0, + 754.0, + 1402.0, + 791.0, + 295.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 783.0, + 1406.0, + 783.0, + 1406.0, + 826.0, + 291.0, + 826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 814.0, + 1404.0, + 814.0, + 1404.0, + 854.0, + 294.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 844.0, + 915.0, + 844.0, + 915.0, + 884.0, + 292.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 844.0, + 1406.0, + 844.0, + 1406.0, + 884.0, + 938.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 877.0, + 365.0, + 877.0, + 365.0, + 914.0, + 295.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 877.0, + 1406.0, + 877.0, + 1406.0, + 914.0, + 447.0, + 914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 909.0, + 473.0, + 909.0, + 473.0, + 942.0, + 295.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 496.0, + 909.0, + 1405.0, + 909.0, + 1405.0, + 942.0, + 496.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 936.0, + 325.0, + 936.0, + 325.0, + 973.0, + 295.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 936.0, + 643.0, + 936.0, + 643.0, + 973.0, + 348.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 665.0, + 936.0, + 1177.0, + 936.0, + 1177.0, + 973.0, + 665.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1194.0, + 936.0, + 1404.0, + 936.0, + 1404.0, + 973.0, + 1194.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 965.0, + 496.0, + 965.0, + 496.0, + 1010.0, + 292.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 965.0, + 780.0, + 965.0, + 780.0, + 1010.0, + 590.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 864.0, + 965.0, + 1407.0, + 965.0, + 1407.0, + 1010.0, + 864.0, + 1010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 999.0, + 765.0, + 999.0, + 765.0, + 1036.0, + 294.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 788.0, + 999.0, + 1404.0, + 999.0, + 1404.0, + 1036.0, + 788.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1301.0, + 1404.0, + 1301.0, + 1404.0, + 1336.0, + 295.0, + 1336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1333.0, + 1400.0, + 1333.0, + 1400.0, + 1364.0, + 295.0, + 1364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1363.0, + 1404.0, + 1363.0, + 1404.0, + 1397.0, + 294.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1395.0, + 1402.0, + 1395.0, + 1402.0, + 1425.0, + 295.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1423.0, + 1402.0, + 1423.0, + 1402.0, + 1456.0, + 294.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1455.0, + 1404.0, + 1455.0, + 1404.0, + 1489.0, + 294.0, + 1489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1484.0, + 818.0, + 1484.0, + 818.0, + 1518.0, + 295.0, + 1518.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1821.0, + 1403.0, + 1821.0, + 1403.0, + 1855.0, + 294.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 436.0, + 1851.0, + 527.0, + 1851.0, + 527.0, + 1886.0, + 436.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 1851.0, + 1004.0, + 1851.0, + 1004.0, + 1886.0, + 644.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 1851.0, + 1405.0, + 1851.0, + 1405.0, + 1886.0, + 1144.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1880.0, + 435.0, + 1880.0, + 435.0, + 1918.0, + 292.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 1880.0, + 985.0, + 1880.0, + 985.0, + 1918.0, + 550.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 1880.0, + 1407.0, + 1880.0, + 1407.0, + 1918.0, + 1113.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1911.0, + 356.0, + 1911.0, + 356.0, + 1949.0, + 293.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 1911.0, + 721.0, + 1911.0, + 721.0, + 1949.0, + 503.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 1911.0, + 1405.0, + 1911.0, + 1405.0, + 1949.0, + 860.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1941.0, + 1190.0, + 1941.0, + 1190.0, + 1979.0, + 293.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1332.0, + 1941.0, + 1404.0, + 1941.0, + 1404.0, + 1979.0, + 1332.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2010.0, + 293.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 2002.0, + 817.0, + 2002.0, + 817.0, + 2037.0, + 292.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1137.0, + 789.0, + 1137.0, + 789.0, + 1169.0, + 296.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 1137.0, + 1405.0, + 1137.0, + 1405.0, + 1169.0, + 823.0, + 1169.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1167.0, + 1405.0, + 1167.0, + 1405.0, + 1199.0, + 294.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1199.0, + 1405.0, + 1199.0, + 1405.0, + 1232.0, + 296.0, + 1232.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1227.0, + 1040.0, + 1227.0, + 1040.0, + 1263.0, + 292.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1074.0, + 1033.0, + 1074.0, + 1033.0, + 1110.0, + 295.0, + 1110.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 230, + 1404, + 230, + 1404, + 627, + 298, + 627 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 297, + 1724, + 1403, + 1724, + 1403, + 1939, + 297, + 1939 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 1258, + 1404, + 1258, + 1404, + 1445, + 297, + 1445 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 299, + 1457, + 1402, + 1457, + 1402, + 1613, + 299, + 1613 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 720, + 1404, + 720, + 1404, + 928, + 297, + 928 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1039, + 1407, + 1039, + 1407, + 1103, + 298, + 1103 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 300, + 1972, + 1398, + 1972, + 1398, + 2034, + 300, + 2034 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 354, + 937, + 1300, + 937, + 1300, + 1029, + 354, + 1029 + ], + "score": 0.94 + }, + { + "category_id": 8, + "poly": [ + 364, + 1121, + 1287, + 1121, + 1287, + 1201, + 364, + 1201 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 297, + 1212, + 922, + 1212, + 922, + 1246, + 297, + 1246 + ], + "score": 0.927 + }, + { + "category_id": 0, + "poly": [ + 301, + 1655, + 587, + 1655, + 587, + 1691, + 301, + 1691 + ], + "score": 0.907 + }, + { + "category_id": 9, + "poly": [ + 1352, + 966, + 1400, + 966, + 1400, + 996, + 1352, + 996 + ], + "score": 0.873 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1143, + 1400, + 1143, + 1400, + 1175, + 1352, + 1175 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.823 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.789 + }, + { + "category_id": 0, + "poly": [ + 297, + 663, + 1196, + 663, + 1196, + 696, + 297, + 696 + ], + "score": 0.695 + }, + { + "category_id": 1, + "poly": [ + 297, + 663, + 1196, + 663, + 1196, + 696, + 297, + 696 + ], + "score": 0.233 + }, + { + "category_id": 13, + "poly": [ + 499, + 1070, + 579, + 1070, + 579, + 1104, + 499, + 1104 + ], + "score": 0.93, + "latex": "T ( z _ { i , t } )" + }, + { + "category_id": 13, + "poly": [ + 878, + 353, + 1033, + 353, + 1033, + 386, + 878, + 386 + ], + "score": 0.93, + "latex": "\\sigma \\sim U [ - 1 , 1 ]" + }, + { + "category_id": 14, + "poly": [ + 354, + 934, + 1297, + 934, + 1297, + 1032, + 354, + 1032 + ], + "score": 0.93, + "latex": "\\tilde { z } _ { i , t } = z _ { i , t } - T ( z _ { i , t } ) , \\quad \\tilde { x } _ { i , t } = \\sum _ { t ^ { \\prime } \\leq t } \\tilde { z } _ { i , t } , \\quad r _ { i , t } ( \\tilde { x } _ { i , t } , l _ { i , t } ) = \\frac { \\tilde { x } _ { i , t } ^ { 1 - \\eta } - 1 } { 1 - \\eta } - l _ { i , t } , \\quad \\eta > 0 ," + }, + { + "category_id": 13, + "poly": [ + 660, + 353, + 793, + 353, + 793, + 386, + 660, + 386 + ], + "score": 0.93, + "latex": "r _ { i } ^ { \\prime } = r _ { i } + \\sigma" + }, + { + "category_id": 13, + "poly": [ + 297, + 872, + 507, + 872, + 507, + 928, + 297, + 928 + ], + "score": 0.92, + "latex": "\\mathbb { E } _ { \\pi , \\pi _ { p } } \\left[ \\sum _ { t = 0 } ^ { T } r _ { i , t } \\right]" + }, + { + "category_id": 13, + "poly": [ + 561, + 1353, + 668, + 1353, + 668, + 1383, + 561, + 1383 + ], + "score": 0.92, + "latex": "\\eta < 0 . 2 2" + }, + { + "category_id": 13, + "poly": [ + 718, + 1353, + 823, + 1353, + 823, + 1383, + 718, + 1383 + ], + "score": 0.91, + "latex": "\\eta > 0 . 2 8" + }, + { + "category_id": 13, + "poly": [ + 1113, + 352, + 1232, + 352, + 1232, + 385, + 1113, + 385 + ], + "score": 0.9, + "latex": "r _ { i } \\in [ 0 , 1 ] ," + }, + { + "category_id": 13, + "poly": [ + 1234, + 1292, + 1344, + 1292, + 1344, + 1324, + 1234, + 1324 + ], + "score": 0.9, + "latex": "\\eta = 0 . 2 3" + }, + { + "category_id": 13, + "poly": [ + 1100, + 2004, + 1150, + 2004, + 1150, + 2034, + 1100, + 2034 + ], + "score": 0.9, + "latex": "\\mathcal { H } _ { \\infty }" + }, + { + "category_id": 13, + "poly": [ + 1224, + 1460, + 1333, + 1460, + 1333, + 1492, + 1224, + 1492 + ], + "score": 0.9, + "latex": "\\eta = 0 . 2 3" + }, + { + "category_id": 13, + "poly": [ + 987, + 885, + 1021, + 885, + 1021, + 917, + 987, + 917 + ], + "score": 0.89, + "latex": "l _ { i , t }" + }, + { + "category_id": 14, + "poly": [ + 362, + 1111, + 1290, + 1111, + 1290, + 1207, + 362, + 1207 + ], + "score": 0.89, + "latex": "{ \\mathsf { s w f } } = \\mathsf { e q } ( x ) \\cdot \\mathtt { p r o d } ( x ) , \\quad \\mathsf { e q } ( x ) = 1 - \\frac { N } { N - 1 } \\mathtt { g i n i } ( x ) , \\quad \\mathtt { p r o d } ( x ) = \\sum _ { i = 1 } ^ { N } x _ { i } ," + }, + { + "category_id": 13, + "poly": [ + 1316, + 890, + 1357, + 890, + 1357, + 918, + 1316, + 918 + ], + "score": 0.88, + "latex": "\\tilde { x } _ { i , t }" + }, + { + "category_id": 13, + "poly": [ + 337, + 414, + 461, + 414, + 461, + 443, + 337, + 443 + ], + "score": 0.88, + "latex": "2 3 0 4 = 1 6" + }, + { + "category_id": 13, + "poly": [ + 535, + 415, + 591, + 415, + 591, + 443, + 535, + 443 + ], + "score": 0.88, + "latex": "\\times 1 6" + }, + { + "category_id": 13, + "poly": [ + 719, + 536, + 788, + 536, + 788, + 570, + 719, + 570 + ], + "score": 0.87, + "latex": "\\log r _ { p }" + }, + { + "category_id": 13, + "poly": [ + 665, + 415, + 709, + 415, + 709, + 443, + 665, + 443 + ], + "score": 0.87, + "latex": "\\times 9" + }, + { + "category_id": 13, + "poly": [ + 297, + 1076, + 337, + 1076, + 337, + 1104, + 297, + 1104 + ], + "score": 0.86, + "latex": "z _ { i , t }" + }, + { + "category_id": 13, + "poly": [ + 705, + 888, + 745, + 888, + 745, + 917, + 705, + 917 + ], + "score": 0.86, + "latex": "{ \\boldsymbol { r } } _ { i , t }" + }, + { + "category_id": 13, + "poly": [ + 372, + 1046, + 391, + 1046, + 391, + 1071, + 372, + 1071 + ], + "score": 0.82, + "latex": "\\eta" + }, + { + "category_id": 13, + "poly": [ + 830, + 1045, + 849, + 1045, + 849, + 1072, + 830, + 1072 + ], + "score": 0.81, + "latex": "\\eta" + }, + { + "category_id": 13, + "poly": [ + 542, + 1388, + 560, + 1388, + 560, + 1414, + 542, + 1414 + ], + "score": 0.79, + "latex": "\\eta" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1653.0, + 593.0, + 1653.0, + 593.0, + 1695.0, + 291.0, + 1695.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, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2116.0, + 839.0, + 2116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 662.0, + 1200.0, + 662.0, + 1200.0, + 699.0, + 294.0, + 699.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 232.0, + 1404.0, + 232.0, + 1404.0, + 264.0, + 296.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 262.0, + 1405.0, + 262.0, + 1405.0, + 296.0, + 293.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 291.0, + 1406.0, + 291.0, + 1406.0, + 328.0, + 294.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 318.0, + 1405.0, + 318.0, + 1405.0, + 360.0, + 292.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 351.0, + 659.0, + 351.0, + 659.0, + 391.0, + 292.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 794.0, + 351.0, + 877.0, + 351.0, + 877.0, + 391.0, + 794.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 351.0, + 1112.0, + 351.0, + 1112.0, + 391.0, + 1034.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 351.0, + 1405.0, + 351.0, + 1405.0, + 391.0, + 1233.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 381.0, + 1404.0, + 381.0, + 1404.0, + 418.0, + 293.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 413.0, + 336.0, + 413.0, + 336.0, + 449.0, + 293.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 413.0, + 534.0, + 413.0, + 534.0, + 449.0, + 462.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 413.0, + 664.0, + 413.0, + 664.0, + 449.0, + 592.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 710.0, + 413.0, + 1406.0, + 413.0, + 1406.0, + 449.0, + 710.0, + 449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 441.0, + 1406.0, + 441.0, + 1406.0, + 482.0, + 292.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 474.0, + 1406.0, + 474.0, + 1406.0, + 509.0, + 293.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 504.0, + 1406.0, + 504.0, + 1406.0, + 541.0, + 292.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 535.0, + 718.0, + 535.0, + 718.0, + 571.0, + 291.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 789.0, + 535.0, + 1404.0, + 535.0, + 1404.0, + 571.0, + 789.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 567.0, + 1402.0, + 567.0, + 1402.0, + 599.0, + 294.0, + 599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 593.0, + 1404.0, + 593.0, + 1404.0, + 633.0, + 293.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1723.0, + 1405.0, + 1723.0, + 1405.0, + 1760.0, + 294.0, + 1760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1754.0, + 1405.0, + 1754.0, + 1405.0, + 1791.0, + 292.0, + 1791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1787.0, + 1405.0, + 1787.0, + 1405.0, + 1822.0, + 293.0, + 1822.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1812.0, + 1407.0, + 1812.0, + 1407.0, + 1855.0, + 291.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1845.0, + 1405.0, + 1845.0, + 1405.0, + 1882.0, + 292.0, + 1882.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1875.0, + 1404.0, + 1875.0, + 1404.0, + 1915.0, + 291.0, + 1915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1908.0, + 832.0, + 1908.0, + 832.0, + 1942.0, + 293.0, + 1942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1257.0, + 1404.0, + 1257.0, + 1404.0, + 1296.0, + 294.0, + 1296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1290.0, + 1233.0, + 1290.0, + 1233.0, + 1326.0, + 295.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 1290.0, + 1405.0, + 1290.0, + 1405.0, + 1326.0, + 1345.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1321.0, + 1402.0, + 1321.0, + 1402.0, + 1357.0, + 294.0, + 1357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1352.0, + 560.0, + 1352.0, + 560.0, + 1387.0, + 295.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 669.0, + 1352.0, + 717.0, + 1352.0, + 717.0, + 1387.0, + 669.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 824.0, + 1352.0, + 1405.0, + 1352.0, + 1405.0, + 1387.0, + 824.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1382.0, + 541.0, + 1382.0, + 541.0, + 1418.0, + 295.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 561.0, + 1382.0, + 1406.0, + 1382.0, + 1406.0, + 1418.0, + 561.0, + 1418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1413.0, + 1374.0, + 1413.0, + 1374.0, + 1449.0, + 294.0, + 1449.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1456.0, + 1223.0, + 1456.0, + 1223.0, + 1495.0, + 293.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1456.0, + 1406.0, + 1456.0, + 1406.0, + 1495.0, + 1334.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1490.0, + 1404.0, + 1490.0, + 1404.0, + 1526.0, + 293.0, + 1526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1519.0, + 1401.0, + 1519.0, + 1401.0, + 1556.0, + 294.0, + 1556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1550.0, + 1404.0, + 1550.0, + 1404.0, + 1588.0, + 293.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1582.0, + 1203.0, + 1582.0, + 1203.0, + 1616.0, + 293.0, + 1616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 719.0, + 1406.0, + 719.0, + 1406.0, + 757.0, + 295.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 752.0, + 1404.0, + 752.0, + 1404.0, + 786.0, + 295.0, + 786.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 779.0, + 1405.0, + 779.0, + 1405.0, + 819.0, + 292.0, + 819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 811.0, + 1405.0, + 811.0, + 1405.0, + 847.0, + 294.0, + 847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 841.0, + 1402.0, + 841.0, + 1402.0, + 878.0, + 294.0, + 878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 875.0, + 704.0, + 875.0, + 704.0, + 925.0, + 508.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 875.0, + 986.0, + 875.0, + 986.0, + 925.0, + 746.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1022.0, + 875.0, + 1315.0, + 875.0, + 1315.0, + 925.0, + 1022.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1358.0, + 875.0, + 1373.0, + 875.0, + 1373.0, + 925.0, + 1358.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 883.0, + 371.0, + 883.0, + 371.0, + 924.0, + 295.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1038.0, + 371.0, + 1038.0, + 371.0, + 1075.0, + 295.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1038.0, + 829.0, + 1038.0, + 829.0, + 1075.0, + 392.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 850.0, + 1038.0, + 1405.0, + 1038.0, + 1405.0, + 1075.0, + 850.0, + 1075.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1068.0, + 296.0, + 1068.0, + 296.0, + 1104.0, + 293.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 338.0, + 1068.0, + 498.0, + 1068.0, + 498.0, + 1104.0, + 338.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 580.0, + 1068.0, + 1396.0, + 1068.0, + 1396.0, + 1104.0, + 580.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1971.0, + 1402.0, + 1971.0, + 1402.0, + 2007.0, + 295.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2002.0, + 1099.0, + 2002.0, + 1099.0, + 2037.0, + 296.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1151.0, + 2002.0, + 1402.0, + 2002.0, + 1402.0, + 2037.0, + 1151.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1209.0, + 925.0, + 1209.0, + 925.0, + 1253.0, + 291.0, + 1253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 662.0, + 1200.0, + 662.0, + 1200.0, + 699.0, + 294.0, + 699.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 753, + 1405, + 753, + 1405, + 1181, + 298, + 1181 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 299, + 1357, + 1403, + 1357, + 1403, + 1510, + 299, + 1510 + ], + "score": 0.973 + }, + { + "category_id": 4, + "poly": [ + 296, + 532, + 1405, + 532, + 1405, + 685, + 296, + 685 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 299, + 1721, + 1403, + 1721, + 1403, + 1875, + 299, + 1875 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1402, + 1911, + 1402, + 2032, + 299, + 2032 + ], + "score": 0.958 + }, + { + "category_id": 3, + "poly": [ + 301, + 228, + 1395, + 228, + 1395, + 501, + 301, + 501 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 299, + 1622, + 1401, + 1622, + 1401, + 1684, + 299, + 1684 + ], + "score": 0.937 + }, + { + "category_id": 1, + "poly": [ + 300, + 1197, + 812, + 1197, + 812, + 1228, + 300, + 1228 + ], + "score": 0.912 + }, + { + "category_id": 0, + "poly": [ + 300, + 1281, + 570, + 1281, + 570, + 1317, + 300, + 1317 + ], + "score": 0.893 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 852, + 76, + 852, + 104, + 299, + 104 + ], + "score": 0.83 + }, + { + "category_id": 0, + "poly": [ + 299, + 1566, + 488, + 1566, + 488, + 1599, + 299, + 1599 + ], + "score": 0.828 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.746 + }, + { + "category_id": 13, + "poly": [ + 298, + 821, + 318, + 821, + 318, + 844, + 298, + 844 + ], + "score": 0.7, + "latex": "\\alpha" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 527.0, + 1406.0, + 527.0, + 1406.0, + 572.0, + 291.0, + 572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 564.0, + 1403.0, + 564.0, + 1403.0, + 597.0, + 295.0, + 597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 593.0, + 1406.0, + 593.0, + 1406.0, + 628.0, + 293.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 623.0, + 1405.0, + 623.0, + 1405.0, + 660.0, + 295.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 653.0, + 594.0, + 653.0, + 594.0, + 690.0, + 294.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 238.0, + 801.0, + 238.0, + 801.0, + 267.0, + 729.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 241.0, + 895.0, + 241.0, + 895.0, + 448.0, + 856.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 245.0, + 737.0, + 245.0, + 737.0, + 260.0, + 715.0, + 260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 248.0, + 365.0, + 248.0, + 365.0, + 275.0, + 324.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 894.0, + 256.0, + 925.0, + 256.0, + 925.0, + 282.0, + 894.0, + 282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 259.0, + 336.0, + 259.0, + 336.0, + 427.0, + 300.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 260.0, + 792.0, + 260.0, + 792.0, + 285.0, + 735.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 266.0, + 737.0, + 266.0, + 737.0, + 279.0, + 715.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 280.0, + 826.0, + 280.0, + 826.0, + 306.0, + 737.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 293.0, + 365.0, + 293.0, + 365.0, + 320.0, + 323.0, + 320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 715.0, + 301.0, + 786.0, + 301.0, + 786.0, + 327.0, + 715.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 297.0, + 928.0, + 297.0, + 928.0, + 327.0, + 893.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 339.0, + 364.0, + 339.0, + 364.0, + 364.0, + 321.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 342.0, + 924.0, + 342.0, + 924.0, + 364.0, + 903.0, + 364.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 384.0, + 365.0, + 384.0, + 365.0, + 411.0, + 322.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 383.0, + 926.0, + 383.0, + 926.0, + 411.0, + 890.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 429.0, + 367.0, + 429.0, + 367.0, + 456.0, + 324.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 885.0, + 425.0, + 925.0, + 425.0, + 925.0, + 453.0, + 885.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 453.0, + 464.0, + 453.0, + 464.0, + 482.0, + 363.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 467.0, + 453.0, + 727.0, + 453.0, + 727.0, + 481.0, + 467.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 454.0, + 833.0, + 454.0, + 833.0, + 480.0, + 734.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 453.0, + 1023.0, + 453.0, + 1023.0, + 482.0, + 923.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 453.0, + 1288.0, + 453.0, + 1288.0, + 481.0, + 1030.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1295.0, + 453.0, + 1393.0, + 453.0, + 1393.0, + 480.0, + 1295.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 475.0, + 471.0, + 722.0, + 471.0, + 722.0, + 503.0, + 475.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 469.0, + 1283.0, + 469.0, + 1283.0, + 506.0, + 1034.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 284.0, + 738.0, + 284.0, + 738.0, + 299.0, + 713.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1279.0, + 575.0, + 1279.0, + 575.0, + 1322.0, + 293.0, + 1322.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, + 1566.0, + 490.0, + 1566.0, + 490.0, + 1603.0, + 297.0, + 1603.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, + 754.0, + 1405.0, + 754.0, + 1405.0, + 789.0, + 295.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 784.0, + 1406.0, + 784.0, + 1406.0, + 820.0, + 293.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 815.0, + 297.0, + 815.0, + 297.0, + 853.0, + 292.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 815.0, + 1406.0, + 815.0, + 1406.0, + 853.0, + 319.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 848.0, + 1402.0, + 848.0, + 1402.0, + 879.0, + 296.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 873.0, + 1405.0, + 873.0, + 1405.0, + 915.0, + 291.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 906.0, + 1407.0, + 906.0, + 1407.0, + 942.0, + 295.0, + 942.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 938.0, + 1405.0, + 938.0, + 1405.0, + 973.0, + 293.0, + 973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 970.0, + 1403.0, + 970.0, + 1403.0, + 1001.0, + 296.0, + 1001.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1000.0, + 1403.0, + 1000.0, + 1403.0, + 1032.0, + 296.0, + 1032.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1029.0, + 1403.0, + 1029.0, + 1403.0, + 1061.0, + 296.0, + 1061.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1058.0, + 1405.0, + 1058.0, + 1405.0, + 1094.0, + 293.0, + 1094.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1088.0, + 1403.0, + 1088.0, + 1403.0, + 1126.0, + 292.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1119.0, + 1403.0, + 1119.0, + 1403.0, + 1154.0, + 295.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1151.0, + 850.0, + 1151.0, + 850.0, + 1184.0, + 293.0, + 1184.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1356.0, + 1403.0, + 1356.0, + 1403.0, + 1391.0, + 293.0, + 1391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1389.0, + 1402.0, + 1389.0, + 1402.0, + 1422.0, + 295.0, + 1422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1415.0, + 1405.0, + 1415.0, + 1405.0, + 1455.0, + 290.0, + 1455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1448.0, + 1405.0, + 1448.0, + 1405.0, + 1485.0, + 294.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1480.0, + 793.0, + 1480.0, + 793.0, + 1517.0, + 295.0, + 1517.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": [ + 323.0, + 1749.0, + 1407.0, + 1749.0, + 1407.0, + 1790.0, + 323.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1778.0, + 1402.0, + 1778.0, + 1402.0, + 1819.0, + 322.0, + 1819.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1811.0, + 1405.0, + 1811.0, + 1405.0, + 1848.0, + 323.0, + 1848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1844.0, + 477.0, + 1844.0, + 477.0, + 1883.0, + 323.0, + 1883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1909.0, + 1404.0, + 1909.0, + 1404.0, + 1944.0, + 294.0, + 1944.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1938.0, + 1406.0, + 1938.0, + 1406.0, + 1978.0, + 322.0, + 1978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1970.0, + 1402.0, + 1970.0, + 1402.0, + 2007.0, + 319.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 2001.0, + 458.0, + 2001.0, + 458.0, + 2035.0, + 322.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1621.0, + 1405.0, + 1621.0, + 1405.0, + 1657.0, + 295.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1653.0, + 1373.0, + 1653.0, + 1373.0, + 1688.0, + 324.0, + 1688.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1194.0, + 818.0, + 1194.0, + 818.0, + 1232.0, + 294.0, + 1232.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1942, + 1403, + 1942, + 1403, + 2034, + 299, + 2034 + ], + "score": 0.896 + }, + { + "category_id": 1, + "poly": [ + 296, + 1674, + 1405, + 1674, + 1405, + 1801, + 296, + 1801 + ], + "score": 0.895 + }, + { + "category_id": 1, + "poly": [ + 297, + 1290, + 1404, + 1290, + 1404, + 1385, + 297, + 1385 + ], + "score": 0.893 + }, + { + "category_id": 1, + "poly": [ + 297, + 1526, + 1405, + 1526, + 1405, + 1649, + 297, + 1649 + ], + "score": 0.89 + }, + { + "category_id": 1, + "poly": [ + 297, + 1824, + 1401, + 1824, + 1401, + 1916, + 297, + 1916 + ], + "score": 0.888 + }, + { + "category_id": 1, + "poly": [ + 296, + 994, + 1403, + 994, + 1403, + 1117, + 296, + 1117 + ], + "score": 0.888 + }, + { + "category_id": 1, + "poly": [ + 298, + 1408, + 1400, + 1408, + 1400, + 1504, + 298, + 1504 + ], + "score": 0.882 + }, + { + "category_id": 1, + "poly": [ + 297, + 1142, + 1406, + 1142, + 1406, + 1267, + 297, + 1267 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.871 + }, + { + "category_id": 1, + "poly": [ + 296, + 876, + 1404, + 876, + 1404, + 969, + 296, + 969 + ], + "score": 0.856 + }, + { + "category_id": 1, + "poly": [ + 298, + 552, + 736, + 552, + 736, + 585, + 298, + 585 + ], + "score": 0.847 + }, + { + "category_id": 1, + "poly": [ + 298, + 727, + 1404, + 727, + 1404, + 852, + 298, + 852 + ], + "score": 0.835 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 866, + 2088, + 866, + 2113, + 836, + 2113 + ], + "score": 0.818 + }, + { + "category_id": 1, + "poly": [ + 299, + 228, + 1400, + 228, + 1400, + 323, + 299, + 323 + ], + "score": 0.816 + }, + { + "category_id": 1, + "poly": [ + 297, + 347, + 1398, + 347, + 1398, + 411, + 297, + 411 + ], + "score": 0.816 + }, + { + "category_id": 1, + "poly": [ + 297, + 434, + 1405, + 434, + 1405, + 528, + 297, + 528 + ], + "score": 0.799 + }, + { + "category_id": 1, + "poly": [ + 295, + 609, + 1403, + 609, + 1403, + 704, + 295, + 704 + ], + "score": 0.798 + }, + { + "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": [ + 297.0, + 1942.0, + 1403.0, + 1942.0, + 1403.0, + 1976.0, + 297.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2005.0, + 323.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2002.0, + 1080.0, + 2002.0, + 1080.0, + 2036.0, + 323.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1672.0, + 713.0, + 1672.0, + 713.0, + 1709.0, + 294.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 1671.0, + 1405.0, + 1671.0, + 1405.0, + 1709.0, + 749.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1703.0, + 1405.0, + 1703.0, + 1405.0, + 1741.0, + 320.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1734.0, + 1403.0, + 1734.0, + 1403.0, + 1772.0, + 320.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1768.0, + 975.0, + 1768.0, + 975.0, + 1801.0, + 323.0, + 1801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1290.0, + 1402.0, + 1290.0, + 1402.0, + 1328.0, + 295.0, + 1328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1320.0, + 1401.0, + 1320.0, + 1401.0, + 1359.0, + 321.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1353.0, + 796.0, + 1353.0, + 796.0, + 1384.0, + 324.0, + 1384.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": [ + 323.0, + 1557.0, + 1403.0, + 1557.0, + 1403.0, + 1590.0, + 323.0, + 1590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1586.0, + 1407.0, + 1586.0, + 1407.0, + 1626.0, + 319.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1618.0, + 450.0, + 1618.0, + 450.0, + 1648.0, + 321.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1823.0, + 1405.0, + 1823.0, + 1405.0, + 1857.0, + 295.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1851.0, + 1401.0, + 1851.0, + 1401.0, + 1889.0, + 321.0, + 1889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1886.0, + 875.0, + 1886.0, + 875.0, + 1916.0, + 325.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 994.0, + 1405.0, + 994.0, + 1405.0, + 1026.0, + 295.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1024.0, + 1404.0, + 1024.0, + 1404.0, + 1060.0, + 321.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1057.0, + 1401.0, + 1057.0, + 1401.0, + 1089.0, + 321.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1086.0, + 691.0, + 1086.0, + 691.0, + 1118.0, + 319.0, + 1118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1407.0, + 1402.0, + 1407.0, + 1402.0, + 1444.0, + 294.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1439.0, + 1404.0, + 1439.0, + 1404.0, + 1473.0, + 323.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1469.0, + 1238.0, + 1469.0, + 1238.0, + 1507.0, + 323.0, + 1507.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1141.0, + 1406.0, + 1141.0, + 1406.0, + 1179.0, + 294.0, + 1179.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1173.0, + 1407.0, + 1173.0, + 1407.0, + 1208.0, + 320.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1204.0, + 1408.0, + 1204.0, + 1408.0, + 1241.0, + 323.0, + 1241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1234.0, + 1355.0, + 1234.0, + 1355.0, + 1269.0, + 320.0, + 1269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 875.0, + 1404.0, + 875.0, + 1404.0, + 913.0, + 293.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 907.0, + 1405.0, + 907.0, + 1405.0, + 941.0, + 323.0, + 941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 936.0, + 1081.0, + 936.0, + 1081.0, + 972.0, + 323.0, + 972.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 552.0, + 739.0, + 552.0, + 739.0, + 587.0, + 295.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 729.0, + 1402.0, + 729.0, + 1402.0, + 761.0, + 294.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 759.0, + 1403.0, + 759.0, + 1403.0, + 794.0, + 321.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 792.0, + 1406.0, + 792.0, + 1406.0, + 821.0, + 322.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 820.0, + 641.0, + 820.0, + 641.0, + 853.0, + 324.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 1402.0, + 229.0, + 1402.0, + 263.0, + 295.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 257.0, + 1404.0, + 257.0, + 1404.0, + 300.0, + 322.0, + 300.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 291.0, + 532.0, + 291.0, + 532.0, + 323.0, + 325.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 347.0, + 1403.0, + 347.0, + 1403.0, + 383.0, + 296.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 378.0, + 1277.0, + 378.0, + 1277.0, + 414.0, + 323.0, + 414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 434.0, + 1403.0, + 434.0, + 1403.0, + 471.0, + 295.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 466.0, + 1402.0, + 466.0, + 1402.0, + 500.0, + 324.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 497.0, + 730.0, + 497.0, + 730.0, + 527.0, + 325.0, + 527.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 608.0, + 1405.0, + 608.0, + 1405.0, + 647.0, + 293.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 639.0, + 1405.0, + 639.0, + 1405.0, + 676.0, + 322.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 670.0, + 1111.0, + 670.0, + 1111.0, + 706.0, + 322.0, + 706.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.866 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.814 + }, + { + "category_id": 1, + "poly": [ + 293, + 1172, + 1400, + 1172, + 1400, + 1238, + 293, + 1238 + ], + "score": 0.678 + }, + { + "category_id": 1, + "poly": [ + 298, + 1408, + 1406, + 1408, + 1406, + 1531, + 298, + 1531 + ], + "score": 0.659 + }, + { + "category_id": 1, + "poly": [ + 297, + 1260, + 1406, + 1260, + 1406, + 1384, + 297, + 1384 + ], + "score": 0.658 + }, + { + "category_id": 1, + "poly": [ + 294, + 1054, + 1403, + 1054, + 1403, + 1148, + 294, + 1148 + ], + "score": 0.628 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1399, + 229, + 1399, + 322, + 299, + 322 + ], + "score": 0.628 + }, + { + "category_id": 1, + "poly": [ + 298, + 1556, + 1405, + 1556, + 1405, + 1713, + 298, + 1713 + ], + "score": 0.625 + }, + { + "category_id": 1, + "poly": [ + 303, + 347, + 1403, + 347, + 1403, + 442, + 303, + 442 + ], + "score": 0.608 + }, + { + "category_id": 1, + "poly": [ + 297, + 1910, + 1404, + 1910, + 1404, + 2033, + 297, + 2033 + ], + "score": 0.604 + }, + { + "category_id": 1, + "poly": [ + 297, + 701, + 1402, + 701, + 1402, + 795, + 297, + 795 + ], + "score": 0.57 + }, + { + "category_id": 1, + "poly": [ + 296, + 936, + 1401, + 936, + 1401, + 1030, + 296, + 1030 + ], + "score": 0.55 + }, + { + "category_id": 1, + "poly": [ + 292, + 613, + 1402, + 613, + 1402, + 679, + 292, + 679 + ], + "score": 0.545 + }, + { + "category_id": 1, + "poly": [ + 297, + 1792, + 1399, + 1792, + 1399, + 1886, + 297, + 1886 + ], + "score": 0.522 + }, + { + "category_id": 1, + "poly": [ + 294, + 1735, + 1400, + 1735, + 1400, + 1770, + 294, + 1770 + ], + "score": 0.505 + }, + { + "category_id": 1, + "poly": [ + 296, + 465, + 1405, + 465, + 1405, + 590, + 296, + 590 + ], + "score": 0.505 + }, + { + "category_id": 1, + "poly": [ + 295, + 818, + 1405, + 818, + 1405, + 913, + 295, + 913 + ], + "score": 0.225 + }, + { + "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, + 868.0, + 2085.0, + 868.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1170.0, + 1404.0, + 1170.0, + 1404.0, + 1209.0, + 293.0, + 1209.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1204.0, + 1353.0, + 1204.0, + 1353.0, + 1237.0, + 322.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1409.0, + 1404.0, + 1409.0, + 1404.0, + 1442.0, + 295.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1439.0, + 1404.0, + 1439.0, + 1404.0, + 1472.0, + 322.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1470.0, + 1404.0, + 1470.0, + 1404.0, + 1506.0, + 322.0, + 1506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1500.0, + 804.0, + 1500.0, + 804.0, + 1535.0, + 321.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1257.0, + 1406.0, + 1257.0, + 1406.0, + 1298.0, + 292.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1289.0, + 1407.0, + 1289.0, + 1407.0, + 1327.0, + 323.0, + 1327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1323.0, + 1407.0, + 1323.0, + 1407.0, + 1355.0, + 319.0, + 1355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1350.0, + 1384.0, + 1350.0, + 1384.0, + 1387.0, + 321.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1051.0, + 1404.0, + 1051.0, + 1404.0, + 1091.0, + 293.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1086.0, + 1401.0, + 1086.0, + 1401.0, + 1120.0, + 323.0, + 1120.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1117.0, + 733.0, + 1117.0, + 733.0, + 1147.0, + 325.0, + 1147.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 225.0, + 1403.0, + 225.0, + 1403.0, + 266.0, + 293.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 261.0, + 1404.0, + 261.0, + 1404.0, + 295.0, + 323.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 291.0, + 549.0, + 291.0, + 549.0, + 323.0, + 324.0, + 323.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1558.0, + 1402.0, + 1558.0, + 1402.0, + 1592.0, + 298.0, + 1592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1586.0, + 1403.0, + 1586.0, + 1403.0, + 1624.0, + 323.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1616.0, + 1407.0, + 1616.0, + 1407.0, + 1657.0, + 322.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1648.0, + 1405.0, + 1648.0, + 1405.0, + 1685.0, + 322.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1679.0, + 1162.0, + 1679.0, + 1162.0, + 1712.0, + 323.0, + 1712.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 348.0, + 1404.0, + 348.0, + 1404.0, + 382.0, + 297.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 379.0, + 1403.0, + 379.0, + 1403.0, + 413.0, + 323.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 408.0, + 1143.0, + 408.0, + 1143.0, + 446.0, + 323.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1910.0, + 1404.0, + 1910.0, + 1404.0, + 1946.0, + 292.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1941.0, + 1404.0, + 1941.0, + 1404.0, + 1977.0, + 322.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1972.0, + 1405.0, + 1972.0, + 1405.0, + 2008.0, + 321.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 2003.0, + 472.0, + 2003.0, + 472.0, + 2033.0, + 324.0, + 2033.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 702.0, + 1402.0, + 702.0, + 1402.0, + 736.0, + 295.0, + 736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 732.0, + 1402.0, + 732.0, + 1402.0, + 766.0, + 324.0, + 766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 764.0, + 730.0, + 764.0, + 730.0, + 794.0, + 325.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 938.0, + 1402.0, + 938.0, + 1402.0, + 968.0, + 297.0, + 968.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 967.0, + 1402.0, + 967.0, + 1402.0, + 1002.0, + 323.0, + 1002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 999.0, + 803.0, + 999.0, + 803.0, + 1031.0, + 325.0, + 1031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 611.0, + 1404.0, + 611.0, + 1404.0, + 649.0, + 295.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 643.0, + 1128.0, + 643.0, + 1128.0, + 678.0, + 321.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1790.0, + 1405.0, + 1790.0, + 1405.0, + 1827.0, + 296.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1823.0, + 1400.0, + 1823.0, + 1400.0, + 1857.0, + 325.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1855.0, + 966.0, + 1855.0, + 966.0, + 1886.0, + 322.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1733.0, + 1404.0, + 1733.0, + 1404.0, + 1772.0, + 294.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 465.0, + 1405.0, + 465.0, + 1405.0, + 502.0, + 294.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 496.0, + 1405.0, + 496.0, + 1405.0, + 531.0, + 322.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 527.0, + 1406.0, + 527.0, + 1406.0, + 564.0, + 322.0, + 564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 557.0, + 1145.0, + 557.0, + 1145.0, + 593.0, + 323.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 819.0, + 1405.0, + 819.0, + 1405.0, + 853.0, + 294.0, + 853.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 846.0, + 1403.0, + 846.0, + 1403.0, + 887.0, + 319.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 880.0, + 967.0, + 880.0, + 967.0, + 913.0, + 323.0, + 913.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 343, + 1403, + 343, + 1403, + 466, + 299, + 466 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 303, + 228, + 1401, + 228, + 1401, + 324, + 303, + 324 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.831 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.813 + }, + { + "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": [ + 297.0, + 73.0, + 857.0, + 73.0, + 857.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 343.0, + 1404.0, + 343.0, + 1404.0, + 379.0, + 294.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 373.0, + 1404.0, + 373.0, + 1404.0, + 408.0, + 321.0, + 408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 402.0, + 1403.0, + 402.0, + 1403.0, + 439.0, + 322.0, + 439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 436.0, + 863.0, + 436.0, + 863.0, + 467.0, + 324.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 227.0, + 1404.0, + 227.0, + 1404.0, + 266.0, + 297.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 261.0, + 1405.0, + 261.0, + 1405.0, + 296.0, + 323.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 289.0, + 1162.0, + 289.0, + 1162.0, + 326.0, + 323.0, + 326.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/uKhGRvM8QNH/uKhGRvM8QNH.md b/parse/train/uKhGRvM8QNH/uKhGRvM8QNH.md new file mode 100644 index 0000000000000000000000000000000000000000..7f99a7e8fca8ba2f1f509dba7edaa69c4d081b09 --- /dev/null +++ b/parse/train/uKhGRvM8QNH/uKhGRvM8QNH.md @@ -0,0 +1,295 @@ +# IMPROVE OBJECT DETECTION WITH FEATURE-BASED KNOWLEDGE DISTILLATION: TOWARDS ACCURATE AND EFFICIENT DETECTORS + +Linfeng Zhang Institute for Interdisciplinary Information Sciences, Tsinghua University + +Kaisheng Ma ∗ Institute for Interdisciplinary Information Sciences, Tsinghua University + +# ABSTRACT + +Knowledge distillation, in which a student model is trained to mimic a teacher model, has been proved as an effective technique for model compression and model accuracy boosting. However, most knowledge distillation methods, designed for image classification, have failed on more challenging tasks, such as object detection. In this paper, we suggest that the failure of knowledge distillation on object detection is mainly caused by two reasons: (1) the imbalance between pixels of foreground and background and (2) lack of distillation on the relation between different pixels. Observing the above reasons, we propose attention-guided distillation and non-local distillation to address the two problems, respectively. Attention-guided distillation is proposed to find the crucial pixels of foreground objects with attention mechanism and then make the students take more effort to learn their features. Non-local distillation is proposed to enable students to learn not only the feature of an individual pixel but also the relation between different pixels captured by non-local modules. Experiments show that our methods achieve excellent AP improvements on both one-stage and two-stage, both anchor-based and anchor-free detectors. For example, Faster RCNN (ResNet101 backbone) with our distillation achieves 43.9 AP on COCO2017, which is 4.1 higher than the baseline. Codes have been released on Github†. + +# 1 INTRODUCTION + +Recently, excellent breakthrough in various domains has been achieved with the success of deep learning (Ronneberger et al., 2015; Devlin et al., 2018; Ren et al., 2015). However, the most advanced deep neural networks always consume a large amount of computation and memory, which has limited their deployment in edge devices such as self-driving cars and mobile phones. To address this problem, abundant techniques are proposed, including pruning (Han et al., 2016; Zhang et al., 2018; Liu et al., 2018; Frankle & Carbin, 2018), quantization (Nagel et al., 2019; Zhou et al., 2017), compact model design (Sandler et al., 2018; Howard et al., 2019; Ma et al., 2018; Iandola et al., 2016) and knowledge distillation (Hinton et al., 2014; Bucilua et al., 2006). Knowledge distillation, which is ˇ also known as teacher-student learning, aims to transfer the knowledge of an over-parameterized teacher to a lightweight student. Since the student is trained to mimic the logits or features of the teacher, the student can inherit the dark knowledge from the teacher, and thus often achieves much higher accuracy. Due to its simplicity and effectiveness, knowledge distillation has become a popular technique for both model compression and model accuracy boosting. + +![](images/ab781c0c9e775df09707b0c93a6aab5e53ce6655c2fbadbcea02d8a117d9474d.jpg) +Figure 1: Results overview. + +As one of the most crucial challenges in computer vision, object detection has an urgent requirement of both accurate and efficient models. Unfortunately, most of the existing knowledge distillation methods in computer vision are designed for image classification and usually leads to trivial improvements on object detection (Li et al., 2017). In this paper, we impute the failure of knowledge distillation on object detection to the following two issues, which will be solved later, respectively. + +Imbalance between foreground and background. In an image to be detected, the background pixels are often more overwhelming than the pixels of the foreground objects. However, in previous knowledge distillation, the student is always trained to mimic the features of all pixels with the same priority. As a result, students have paid most of their attention to learning background pixels features, which suppresses student’s learning on features of the foreground objects. Since foreground pixels are more crucial in detection, the imbalance hurts the performance of knowledge distillation severely. To overcome this obstacle, we propose the attention-guided distillation which distills only the crucial foreground pixels. Since the attention map can reflect the position of the important pixels (Zhou et al., 2016), we adopt the attention map as the mask for knowledge distillation. Concretely, the pixel with a higher attention value is regarded as a pixel of a foreground object and then is learned by the student model with a higher priority. Compared with the previous binary mask method (Wang et al., 2019), the mask generated by attention maps in our methods is more fine-grained and requires no additional supervision. Compared with the previous attention-based distillation methods (Zagoruyko & Komodakis, 2017), the attention map in our methods is not only utilized as the information to be distilled but also utilized as the mask signal for feature distillation. + +Lack of distillation on relation information. It is generally acknowledged that the relation between different objects contains valuable information in object detection. Recently, lots of researchers successfully improve the performance of detectors by enabling detectors to capture and make use of these relations, such as non-local modules (Wang et al., 2018) and relation networks (Hu et al., 2018). However, the existing object detection knowledge distillation methods only distill the information of individual pixels but ignore the relation of different pixels. To solve this issue, we propose the non-local distillation, which aims to capture the relation information of students and teachers with non-local modules and then distill them from teachers to students. + +Since the non-local modules and attention mechanism in our methods are only required in the training period, our methods don’t introduce additional computation and parameters in the inference period. Besides, our methods are feature-based distillation methods which do not depend on a specific detection algorithm so they can be directly utilized in all kinds of detectors without any modification. On MS COCO2017, 2.9, 2.9 and $2 . 2 \mathrm { A P }$ improvements can be observed on two-stage, one-stage, and anchor-free models on average, respectively. Experiments on Mask RCNN show that our methods can also improve the performance of instance segmentation by 2.0 AP, on average. We have conducted a detailed ablation study and sensitivity study to show the effectiveness and stability of each distillation loss. Moreover, we study the relation between teachers and students on object detection and find that knowledge distillation on object detection requires a high AP teacher, which is different from the conclusion in image classification where a high AP teacher may harm the performance of students (Mirzadeh et al., 2019; Cho & Hariharan, 2019). We hope that these results are worth more contemplation of knowledge distillation on tasks except for image classification. To sum up, the contribution of this paper can be summarized as follows. + +• We propose the attention-guided distillation, which emphasizes students’ learning on the foreground objects and suppresses students’ learning on the background pixels. We propose the non-local distillation, which enables the students to learn not only the information of the individual pixel but also the relation between different pixels from teachers. We show that a teacher with higher AP is usually a better teacher in knowledge distillation on object detection, which is different from the conclusion in image classification. + +# 2 RELATED WORK + +As an effective method for model compression and model accuracy boosting, knowledge distillation has been widely utilized in various domains and tasks, including image classification (Hinton et al., 2014; Romero et al., 2015; Zagoruyko & Komodakis, 2017), object detection (Chen et al., 2017; Li et al., 2017; Wang et al., 2019; Bajestani & Yang, 2020), semantic segmentation (Liu et al., 2019), face recognition (Ge et al., 2018), pretrained language model (Sanh et al., 2019; Xu et al., 2020), multi-exit networks training (Zhang et al., 2019b;a), model robustness (Zhang et al., 2020b) and so on. Hinton et al. (2014) first propose the concept of knowledge distillation where the students are trained to mimic the results after softmax layers of teachers. Then, abundant methods are proposed to transfer the knowledge in teacher’s features (Romero et al., 2015) or the variants, such as attention (Zagoruyko & Komodakis, 2017; Hou et al., 2019), FSP (Yim et al., 2017), mutual information (Ahn et al., 2019), positive features (Heo et al., 2019), relation of samples in a batch (Park et al., 2019; Tung & Mori, 2019). + +![](images/61041fd13485e47decbb5cc309be0e4c87bfab8bdf3205e1793c3584c2e2e466.jpg) +Figure 2: Details of our methods: (a) Attention-guided distillation generates the spatial and channel attention with average pooling in the channel and spatial dimension, respectively. Then, students are encouraged to mimic the attention of teachers. Besides, students are also trained to mimic the feature of teachers, which is masked by the attention of both students and teachers. (b) Nonlocal distillation captures the relation of pixels in an image with non-local modules. The relation information of teachers is learned by students with $L _ { 2 }$ norm loss. (c) The architecture of non-local modules. ‘1x1’ is convolution layer with 1x1 kernel. (d) Distillation loss is applied to backbone features with different resolutions. The detection head and neck are not involved in our methods. + +Improving the performance of object detection becomes a hot topic in knowledge distillation recently. Chen et al. (2017) design the first knowledge distillation method on object detection, which includes distillation loss on the backbone, the classification head and the regression head. Then, many researchers find that the imbalance between the foreground objects and background is a crucial problem in detection distillation. Instead of distilling the whole features of backbone networks, Li et al. (2017) only apply $L _ { 2 }$ distillation loss to the features + +![](images/d2c71a8917cfd59868cd1078ccf778786d6d211dffd11090042191011e3fcae8.jpg) +Figure 3: Comparison between the proposed attention-guided distillation and other methods. + +sampled by RPN. Bajestani & Yang (2020) propose the temporal knowledge distillation, which introduces a hyper-parameter to balance the distillation loss between the pixels of the foreground and background. Wang et al. (2019) propose the fine-grained feature imitation, which only distills the feature near object anchor locations. However, although these works have tried to distill only the pixels of foreground objects, they always reply on the annotation in groundtruth, anchors, and bounding boxes and thus can not be transferred to different kinds of detectors and tasks. In contrast, in our method, the pixels of foreground objects are found with attention mechanism, which can be easily generated from features. As a result, it can be directly utilized in all kinds of detectors without any modification. As shown in Figure 3, the difference between the previous mask-based detection distillation method (Wang et al., 2019) and our attention-guided distillation can be summarized as follows (i) Our methods generate the mask with attention mechanism while they generate the mask with ground truth bounding boxes and anchor priors. (ii) The mask in our methods is a pixel-wise and fine-grained mask while the mask in their method is an object-wise and binary mask. (iii) The masks in our methods are composed of a spatial mask and a channel mask while they only have a spatial mask. More detailed comparison with related work can be found in Appendix.E. + +# 3 METHODOLOGY + +# 3.1 ATTENTION-GUIDED DISTILLATION + +We use $A \in \mathbb { R } ^ { C , H , W }$ to denote the feature of the backbone in an object detection model, where $C , H , W$ denotes its channel number, height and width, respectively. Then, the generation of the spatial attention map and channel attention map is equivalent to finding the mapping function $\mathcal { G } ^ { s } : \mathbf { \bar { \mathbb { R } } } ^ { C , H , W } \mathbb { R } ^ { H , W }$ and $\mathcal { G } ^ { c } : \mathbb { R } ^ { C , H , W } \mathbb { R } ^ { C }$ , respectively. Note that the superscripts $s$ and $c$ here are utilized to discriminate ‘spatial’ and ‘channel’. Since the absolute value of each element in the feature implies its importance, we construct $\mathcal G ^ { s }$ by summing the absolute values across the channel dimension and construct $\mathcal G ^ { c }$ by summing the absolute values across the width and height dimension, which can be formulated as $\begin{array} { r } { \mathcal { G } ^ { c } ( A ) = \frac { 1 } { H W } \sum _ { H } ^ { i = 1 } \sum _ { W } ^ { j = 1 } | A . , _ { i , j } | } \end{array}$ and $\begin{array} { r } { \mathcal G ^ { s } ( A ) = \frac { 1 } { C } \sum _ { C } ^ { \bar { k = 1 } } | A _ { k , \cdot , \cdot } | . } \end{array}$ where $i , j , k$ denotes the $\dot { \iota } _ { t h } , j _ { t h } , k _ { t h }$ slice of $A$ in the height, width, and channel dimension, respectively. Then, the spatial attention mask $M ^ { s }$ and the channel attention mask $M ^ { c }$ used in attentionguided distillation can be obtained by summing the attention maps from the teacher and the student detector, which can be formulated as $M ^ { s } \stackrel { \smile } { = } H W \cdot \mathrm { s o f t m a x } ( \hat { ( } \mathcal G ^ { s } ( A ^ { S } ) + \mathcal G ^ { s } ( A ^ { T } ) ) / T ) , M ^ { c } =$ $C \cdot \operatorname { s o f t m a x } ( ( { \mathcal { G } } ^ { c } ( A ^ { { \mathcal { S } } } ) + { \mathcal { G } } ^ { c } ( A ^ { { \mathcal { T } } } ) ) / T )$ . Note that the superscripts $s$ and $\tau$ here are used to discriminate students and teachers. $T$ is a hyper-parameter in softmax introduced by Hinton et al. to adjust the distribution of elements in attention masks (see Figure 4). The attention-guided distillation loss $\mathcal { L } _ { A G D }$ is composed of two components – attention transfer loss $\mathcal { L } _ { A T }$ and attention-masked loss $\mathcal { L } _ { A M }$ . $\mathcal { L } _ { A T }$ is utilized to encourage the student model to mimic the spatial and channel attention of the teacher model, which can be formulated as + +$$ +\mathcal { L } _ { A T } = \mathcal { L } _ { 2 } ( \mathcal { G } ^ { s } ( A ^ { \mathcal { S } } ) , \mathcal { G } ^ { s } ( A ^ { \mathcal { T } } ) ) + \mathcal { L } _ { 2 } ( \mathcal { G } ^ { c } ( A ^ { \mathcal { S } } ) , \mathcal { G } ^ { c } ( A ^ { \mathcal { T } } ) ) . +$$ + +$\mathcal { L } _ { A M }$ is utilized to encourage the student to mimic the features of teacher models by a $\mathcal { L } _ { 2 }$ norm loss masked by $M ^ { s }$ and $M ^ { c }$ , which can be formulated as + +$$ +\mathcal { L } _ { A M } = \left( \sum _ { k = 1 } ^ { C } \sum _ { i = 1 } ^ { H } \sum _ { j = 1 } ^ { W } ( A _ { k , i , j } ^ { \mathcal { T } } - A _ { k , i , j } ^ { S } ) ^ { 2 } \cdot M _ { i , j } ^ { s } \cdot M _ { k } ^ { c } \right) ^ { \frac { 1 } { 2 } } . +$$ + +# 3.2 NON-LOCAL DISTILLATION + +Non-local module (Wang et al., 2018) is an effective method to improve the performance of neural networks by capturing the global relation information. In this paper, we apply non-local modules to capture the relation between pixels in an image, which can be formulated as $\begin{array} { r l } { r _ { i , j } } & { { } = } \end{array}$ $\begin{array} { r } { \frac { 1 } { W H } \sum _ { H } ^ { i ^ { ' } = 1 } { \sum _ { W } ^ { j ^ { ' } = 1 } { f ( A . , { i , j } , A . _ { { i ^ { ' } , j ^ { ' } } } ) g ( A . _ { { \cdot , i ^ { ' } , j ^ { ' } } } ) } } } \end{array}$ , where $r$ denotes the obtained relation information. $i , j$ are the spatial indexes of an output position whose response is to be computed. $i ^ { \prime } , j ^ { \prime }$ are the spatial indexes that enumerates all possible positions. $f$ is a pairwise function for computing the relation of two pixels and $g$ is an unary function for computing the representation of an individual pixel. Now, we can introduce the proposed non-local distillation loss $\mathcal { L } _ { N L D }$ as the $\mathcal { L } _ { 2 }$ loss between the relation information of the students and teachers, which can be formulated as $\mathcal { L } _ { N L D } = \mathcal { L } _ { 2 } ( r ^ { S } , r ^ { T } )$ . + +# 3.3 OVERALL LOSS FUNCTION + +We introduce three hyper-parameters $\alpha , \beta , \gamma$ to balance different distillation loss in our methods. The overall distillation loss can be formulated as + +$$ +\begin{array} { r } \mathcal { L } _ { D i s t i l l } ( A ^ { \mathcal { T } } , A ^ { \mathcal { S } } ) = \underbrace { \alpha \cdot \mathcal { L } _ { A T } + \beta \cdot \mathcal { L } _ { A M } } _ \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \end{array} +$$ + +![](images/c2786986263c9ba41fd1a2ae5941b7a7b93eed5f9f4b273a6df235b3d2eb1e58.jpg) +Figure 4: Visualization and distribution of the spatial attention with different $T$ . With a smaller $T$ , the pixels of high attention values are emphasized more in knowledge distillation. + +The overall distillation loss is a model-agnostic loss, which can be added to the original training loss of any detection model directly. The sensitivity study of each hyper-parameter and the ablation study of each loss are shown in Figure 5 and Table 4, respectively. + +# 4 EXPERIMENT + +# 4.1 EXPERIMENTS SETTINGS + +The proposed knowledge distillation method is evaluated on MS COCO2017, which is a large-scale dataset that contains over $1 2 0 \mathrm { k }$ images spanning 80 categories (Lin et al., 2014). The benchmark detection networks are composed of both two-stage detection models, including Faster RCNN (Ren et al., 2015), Cascade RCNN (Cai & Vasconcelos, 2019), Dynamic RCNN (Zhang et al., 2020a), Grid RCNN (Lu et al., 2019) and one-stage detection models, including the RetinaNet (Lin et al., 2017), Fsaf RetinaNet (Zhu et al., 2019). Besides, we also evaluate our methods on the Mask RCNN(He et al., 2017), Cascade Mask RCNN (Cai & Vasconcelos, 2019), and anchor-free models - RepPoints (Yang et al., 2019). We adopt the ResNet50 and ResNet101 (He et al., 2016) as the backbone network of each detection model. We pre-train the backbone model on ImageNet (Deng et al., 2009) and then finetune it on MS COCO2017. We have compared our methods with three kinds of object detection knowledge distillation methods (Chen et al., 2017; Wang et al., 2019; Heo et al., 2019). All the experiments in this paper are implemented with PyTorch (Paszke et al., 2019) with mmdetection2 framework (Chen et al., 2019). The reported fps is measured on one RTX 2080Ti GPU. We adopt the same hyper-parameters settings $\lbrace \alpha = \gamma = 7 ^ { ^ { \circ } } \times 1 0 ^ { - 5 }$ , $\beta = 4 \times 1 0 ^ { - 3 } , T = 0 . 1 \}$ for all the two-stage models and $\left\{ \alpha = \gamma = 4 \times 1 0 ^ { - 4 } , \beta = 2 \times 1 0 ^ { - 2 } , T = 0 . 5 \right\}$ for all the onestage models. Cascade Mask RCNN with ResNeXt101 backbone is utilized as the teacher for all the two-stage students and RetinaNet with ResNeXt101 backbone is utilized as the teacher for all the one-stage students. Please refer to the codes in Github for more details. + +# 4.2 EXPERIMENT RESULTS + +In this section, we show the experiment results of the baseline detectors and our models in Table 1 and Table 2, and compare our methods with other three knowledge distillation methods in Table 3. It is observed that: (i) Consistent and significant AP boost can be observed on all the 9 kinds of detectors. On average, there are 2.9, 2.9, and 2.2 AP improvements on the two-stage, one-stage, and anchor-free detectors, respectively. (ii) With the proposed method, a student model with ResNet50 backbone can outperform the same model with ResNet101 backbone by $1 . 2 \mathrm { A P }$ on average. (iii) On Mask RCNN related models, there are 2.3 improvements on bounding box AP and 2.0 improvements on mask AP on average respectively, indicating the proposed method can be utilized in not only object detection but also instance segmentation. (iv) Our methods achieve 2.2 higher AP than the second-best distillation method, on average. (v) There are 2.7 and 2.9 AP improvements on models with ResNet50 and ResNet101 backbones, respectively, indicating that deeper detectors benefit more from knowledge distillation. + +Table 1: Experiments on MS COCO2017 with the proposed distillation method. + +
ModelBackboneAPAP50AP75APsAPMAPLFPSParams
Faster RCNNResNet5038.459.042.021.542.150.318.143.57
Our Faster RCNNResNet5041.562.245.123.545.055.318.143.57
Faster RCNNResNet10139.860.143.322.543.652.814.262.57
Our Faster RCNNResNet10143.964.248.125.348.058.714.262.57
Cascade RCNNResNet5041.059.444.422.744.454.315.471.22
Our Cascade RCNNResNet5044.462.748.324.848.059.315.471.22
Cascade RCNNResNet10142.560.746.423.546.556.411.790.21
Our Cascade RCNNResNet10145.263.549.426.248.760.811.790.21
Dynamic RCNNResNet5039.858.343.223.042.852.418.143.57
Our Dynamic RCNNResNet5042.861.247.023.946.257.718.143.57
Dynamic RCNNResNet10141.259.745.324.044.954.314.262.57
Our Dynamic RCNNResNet10144.863.048.925.048.960.414.262.57
Grid RCNNResNet5040.458.443.622.843.953.314.066.37
Our Grid RCNNResNet5042.661.146.124.246.655.814.066.37
Grid RCNNResNet10141.659.845.023.745.754.711.085.36
Our Grid RCNNResNet10144.863.648.926.548.959.611.085.36
RetinaNetResNet5037.456.739.620.040.749.717.737.74
Our RetinaNetResNet5039.658.842.122.743.352.517.737.74
RetinaNetResNet10138.958.041.521.042.852.413.556.74
Our RetinaNetResNet10141.360.844.322.746.055.213.556.74
Fsaf RetinaNet Our Fsaf RetinaNetResNet5037.856.839.820.441.148.820.036.19
ResNet5041.461.044.223.145.255.220.036.19
Fsaf RetinaNetResNet10139.358.642.122.143.451.215.055.19
Our Fsaf RetinaNetResNet10142.662.045.524.547.056.215.055.19
RepPointsResNet5038.659.641.622.542.250.418.236.62
Our RepPointsResNet5040.661.743.823.444.653.018.236.62
RepPointsResNet10140.561.343.523.444.753.213.255.62
Our RepPointsResNet10142.7
63.746.424.947.256.413.255.62
+ +Table 2: Experiments on MS COCO2017 with the proposed distillation method on Mask RCNN. + +
ModelBackboneBounding box APMask AP
APAPsAPMAPLAPAPsAPMAPL
Mask RCNNResNet5039.222.942.651.235.419.138.648.4
Our mask RCNNResNet5041.723.445.355.837.419.740.552.1
Mask RCNNResNet10140.823.045.054.136.619.240.250.5
Our Mask RCNNResNet10143.024.747.257.138.720.742.353.3
Cascade Mask RCNNResNet5041.923.244.955.936.518.939.250.7
Our Cascade Mask RCNNResNet5043.824.947.258.438.020.240.952.8
CascadeMask RCNNResNet10142.924.446.557.037.319.740.651.5
Our Cascade Mask RCNNResNet10145.426.349.060.939.621.342.855.0
+ +# 4.3 ABLATION STUDY AND SENSITIVITY STUDY + +Ablation study. Table 4 shows the ablation study of the proposed attention-guided distillation $( { \mathcal { L } } _ { A T }$ and $\mathcal { L } _ { A M }$ ) and non-local distillation $( \mathcal { L } _ { N L D } )$ . It is observed that: (i) Attention-guided distillation and non-local distillation lead to 2.8 and $1 . 4 ~ \mathrm { A P }$ improvements, respectively. (ii) $\mathcal { L } _ { A T }$ and $\mathcal { L } _ { A M }$ lead to 1.2 and $2 . 4 \ : \mathrm { A P }$ improvements respectively, indicating that most of the benefits of attentionguided distillation are obtained from the feature loss masked by the attention maps $( \mathcal { L } _ { A M } )$ . (iii) + +There are 3.1 AP improvements with the combination of attention-guided distillation and non-local distillation. These observations indicate that each distillation loss in our methods has their individual effectiveness and they can be utilized together to achieve better performance. We also give an ablation study to the spatial and channel attention in Appendix A. + +Sensitivity study on hyper-parameters. Four hyper-parameters are introduced in this paper. $\alpha$ , $\beta$ , and $\gamma$ are utilized to balance the magnitude of different distillation loss and $T$ is utilized to adjust the distribution of attention masks. The hyper-parameter sensitivity study on MS COCO2017 with Faster RCNN (ResNet50 backbone) is introduced in Figure 5. It is observed that the worst hyper-parameters only lead to 0.3 AP drop compared with the highest AP, which is still 2.9 higher compared with the baseline model, indicating that our methods are not sensitive to the choice of hyper-parameters. + +Sensitivity study on the types of non-local modules. There are four kinds of non-local modules, including Gaussian, embedded Gaussian, dot production, and concatenation. Table 5 shows the performance of our methods with different types of non-local modules. It is observed that the worst non-local type (Gaussian) is only 0.2 AP lower than the best non-local type (Embedded Gaussian and Concatenation), indicating our methods are not sensitive to the choice of non-local modules. + +Table 3: Comparison between our methods and other distillation methods. Note that we don’t compare our methods with Chen’s and Wang’s methods on RetinaNet because their methods can not be utilized in one-stage models. ResNet50 is utilized as backbone in these models. + +
ModelAPAP50 AP75APs 21.5APMAPL
Faster RCNN + Chen etal.Method + Wang et al. Method + Heo et al. Method + Our Methods38.4 38.7 39.1 38.9 41.559.0 59.0 59.8 60.1 62.242.0 42.1 22.0 42.8 22.2 42.6 21.8 45.1 23.542.1 41.9 42.9 42.7 45.050.3 51.0 51.1 50.7 55.3
Cascade RCNN + Chen et al.Method + Wang et al. Method +Heo etal.Method + Our Methods41.0 41.6 42.1 41.7 44.459.4 62.1 62.7 62.3 62.744.4 45.7 46.1 45.7 48.322.7 23.9 24.4 23.9 24.844.4 54.3 45.8 54.7 46.4 55.6 45.7 55.3 48.0 59.3
RetinaNet + Heo et al. Method + Our Methods37.4 37.8 39.656.7 58.3 58.839.6 41.1 21.6 42.1 22.720.0 40.7 41.2 43.349.7 48.3 52.5
+ +Table 4: Ablation study of the three distillation loss. + +
LossLAT LAM LNLD× × ×√ × ×× √ ×× × √√ √ ×√ 1 √
ResultAP APs38.439.640.839.841.241.5
APM21.522.722.822.723.023.5
APL42.1 50.342.9 52.544.3 54.343.1 52.344.6 55.345.0 55.3
+ +Table 5: Results of different types of non-local modules on Faster RCNN (ResNet50 backbone). + +
Non-Local TypeAP
Embedded Gaussian41.5
Dot Production41.4
Concatenation41.5
Gaussian41.3
+ +# 5 DISCUSSION + +# 5.1 ANALYSIS ON THE BENEFITS OF KNOWLEDGE DISTILLATION + +Qualitative analysis. Figure 6 shows the comparison of detection results between a baseline and a distilled detector. It is observed that: (i) Our methods improve the detection ability on small-objects. In the first three figures, the distilled model can correctly detect cars, the handbag, and the person in the car, respectively. (ii) Our methods prevent models from generating multiple bounding boxes for the same object. In the last two figures, the baseline model generates multiple bounding boxes for the boat and the train while the distilled model avoids these errors. + +Analysis on the types of detection error. We have analyzed the different types of detection errors in the baseline and distilled models in Figure 7. The number in the legend indicates AUC (area under the curve). It is observed that our distillation method leads to error reduction on all kinds of error. In brief, our methods can improve the ability of both localization and classification. + +![](images/b7951f3b430017bae85e2b29f2363772d7a73ae9490557bdf248cde346a3e21d.jpg) +Figure 5: Hyper-parameter sensitivity study of $\alpha , \beta , \gamma , T$ with Faster RCNN on MS COCO2017. + +![](images/86857e4ff1d4a330c3626149534379966c91305c46958428ee987f41ef23f2f0.jpg) +Figure 6: Qualitative analysis on MS COCO2017 with distilled and baseline Faster RCNN. We mark the undetected and wrongly detected objects of the baseline detector with orange boxes. + +5.2 RELATION BETWEEN STUDENT DETECTORS AND TEACHER DETECTORS. + +There is sufficient research focusing on the relation between students and teachers. Mirzadeh et al. (2019) and Cho & Hariharan (2019) show that a teacher with higher accuracy may not be the better teacher for knowledge distillation and sometimes a teacher with too high accuracy may harm the performance of students. Besides, Mobahi et al. (2020) and Yuan et al. (2019) show that the same model and even a model with lower accuracy than the student model can be utilized as the teacher model for knowledge distillation. However, all their experiments are conducted on image classification. In this section, we study whether these observations still hold in the task of object detection. As shown in Figure 8 , we conduct experiments on Faster RCNN (ResNet50 backbone) and Cascade RCNN (ResNet50 backbone) students with teacher models of different AP. It is observed that: (i) In all of our experiments, the student with a higher AP teacher always achieves higher AP. (ii) When the teacher has lower or the same AP as the student, there are very limited and even negative improvements with knowledge distillation. This observation indicates that the relation between students and teachers on object detection is opposite to that on image classification. Our experiment results suggest that there is a strong positive correlation between the AP of students and teachers. A high AP teacher tends to improve the performance of students significantly. + +We think that the reason why a high AP teacher model is crucial in object detection but not very necessary in image classification is that object detection is a more challenging task. As a result, a weaker teacher model may introduce more negative influence on students, which prevents students from achieving higher AP. In contrast, on image classification, most of teacher models can achieve a very high training accuracy so they don’t introduce so much error. + +![](images/e0a896ee35c3861ffcb870a29298a306e2b90e41f689b4cfea61ab6a8d4433aa.jpg) +Figure 7: Distribution of error types on distilled and baseline Faster RCNN. Loc - Localization error; Sim & Oth - Classification error on similar & not similar classes; BG - False positive prediction fired on background. FN - False Negative prediction. +Figure 8: Relation between students and teachers on Faster RCNN and Cascade RCNN in MS COCO2017. + +# 6 CONCLUSION + +In this paper, we have proposed two knowledge distillation methods, including attention-guided distillation and the non-local distillation to improve the performance of object detection models. Attention-guided distillation manages to find the crucial pixels and channels from the whole feature map with attention mechanism and then enables the student to focus more on these crucial pixels and channels instead of the whole feature map. Non-local distillation enables students to learn not only the information of an individual pixel but also the relation between different pixels captured by the non-local modules. Experiments on 9 kinds of models including two-stage, one-stage, anchor-free and anchor-based models have been provided to evaluate our methods. + +Besides, we have also given a study on the relation between students and teachers in object detection. Our experiments show that there is a strong positive correlation between the AP of teachers and students. A high AP teacher detector plays an essential role in knowledge distillation. This observation is much different from the previous conclusion in image classification, where a teacher model with very high accuracy may harm the performance of knowledge distillation. We hope that our result may call for more rethinking works on knowledge distillation in tasks except image classification. + +# 7 ACKNOWLEDGEMENT + +This work was partially supported by Institute for interdisciplinary Information Core Technology. + +# REFERENCES + +Sungsoo Ahn, Shell Xu Hu, Andreas Damianou, Neil D Lawrence, and Zhenwen Dai. Variational information distillation for knowledge transfer. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 9163–9171, 2019. + +Mohammad Farhadi Bajestani and Yezhou Yang. Tkd: Temporal knowledge distillation for active perception. In The IEEE Winter Conference on Applications of Computer Vision, pp. 953–962, 2020. + +Cristian Bucilua, Rich Caruana, and Alexandru Niculescu-Mizil. Model compression. In ˇ Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 535–541. ACM, 2006. + +Zhaowei Cai and Nuno Vasconcelos. Cascade r-cnn: High quality object detection and instance segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1–1, 2019. ISSN 1939-3539. doi: 10.1109/tpami.2019.2956516. URL http://dx.doi.org/10.1109/ tpami.2019.2956516. + +Guobin Chen, Wongun Choi, Xiang Yu, Tony Han, and Manmohan Chandraker. Learning efficient object detection models with knowledge distillation. In Advances in Neural Information Processing Systems, pp. 742–751, 2017. + +Kai Chen, Jiaqi Wang, Jiangmiao Pang, Yuhang Cao, Yu Xiong, Xiaoxiao Li, Shuyang Sun, Wansen Feng, Ziwei Liu, Jiarui Xu, et al. Mmdetection: Open mmlab detection toolbox and benchmark. arXiv preprint arXiv:1906.07155, 2019. + +Jang Hyun Cho and Bharath Hariharan. On the efficacy of knowledge distillation. In The IEEE International Conference on Computer Vision (ICCV), October 2019. + +Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale hierarchical image database. In CVPR, pp. 248–255, 2009. + +Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep bidirectional transformers for language understanding. In NAACL, 2018. + +Jonathan Frankle and Michael Carbin. The lottery ticket hypothesis: Finding sparse, trainable neural networks. arXiv preprint arXiv:1803.03635, 2018. + +Shiming Ge, Shengwei Zhao, Chenyu Li, and Jia Li. Low-resolution face recognition in the wild via selective knowledge distillation. IEEE Transactions on Image Processing, 28(4):2051–2062, 2018. + +Song Han, Huizi Mao, and William J Dally. Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. In ICLR, 2016. + +Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In CVPR, pp. 770–778, 2016. + +Kaiming He, Georgia Gkioxari, Piotr Dollar, and Ross Girshick. Mask r-cnn. 2017 IEEE International Conference on Computer Vision (ICCV), Oct 2017. + +Byeongho Heo, Jeesoo Kim, Sangdoo Yun, Hyojin Park, Nojun Kwak, and Jin Young Choi. A comprehensive overhaul of feature distillation. In Proceedings of the IEEE International Conference on Computer Vision, pp. 1921–1930, 2019. + +Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. In NeurIPS, 2014. + +Yuenan Hou, Zheng Ma, Chunxiao Liu, and Chen Change Loy. Learning lightweight lane detection cnns by self attention distillation. In Proceedings of the IEEE International Conference on Computer Vision, pp. 1013–1021, 2019. + +Andrew Howard, Mark Sandler, Grace Chu, Liang-Chieh Chen, Bo Chen, Mingxing Tan, Weijun Wang, Yukun Zhu, Ruoming Pang, Vijay Vasudevan, et al. Searching for mobilenetv3. arXiv preprint arXiv:1905.02244, 2019. + +Han Hu, Jiayuan Gu, Zheng Zhang, Jifeng Dai, and Yichen Wei. Relation networks for object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3588–3597, 2018. + +Forrest N Iandola, Song Han, Matthew W Moskewicz, Khalid Ashraf, William J Dally, and Kurt Keutzer. Squeezenet: Alexnet-level accuracy with 50x fewer parameters and¡ $0 . 5 \mathrm { m b }$ model size. In ICLR, 2016. + +Quanquan Li, Shengying Jin, and Junjie Yan. Mimicking very efficient network for object detection. In Proceedings of the ieee conference on computer vision and pattern recognition, pp. 6356–6364, 2017. + +Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ´ European conference on computer vision, pp. 740–755. Springer, 2014. + +Tsung-Yi Lin, Priya Goyal, Ross Girshick, Kaiming He, and Piotr Dollar. Focal loss for dense object ´ detection. In Proceedings of the IEEE international conference on computer vision, 2017. + +Yifan Liu, Ke Chen, Chris Liu, Zengchang Qin, Zhenbo Luo, and Jingdong Wang. Structured knowledge distillation for semantic segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2604–2613, 2019. + +Zhuang Liu, Mingjie Sun, Tinghui Zhou, Gao Huang, and Trevor Darrell. Rethinking the value of network pruning. arXiv preprint arXiv:1810.05270, 2018. + +Xin Lu, Buyu Li, Yuxin Yue, Quanquan Li, and Junjie Yan. Grid r-cnn. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019. + +Ningning Ma, Xiangyu Zhang, Hai-Tao Zheng, and Jian Sun. Shufflenet v2: Practical guidelines for efficient cnn architecture design. In Proceedings of the European Conference on Computer Vision (ECCV), pp. 116–131, 2018. + +Seyed-Iman Mirzadeh, Mehrdad Farajtabar, Ang Li, and Hassan Ghasemzadeh. Improved knowledge distillation via teacher assistant: Bridging the gap between student and teacher. arXiv preprint arXiv:1902.03393, 2019. + +Hossein Mobahi, Mehrdad Farajtabar, and Peter L Bartlett. Self-distillation amplifies regularization in hilbert space. arXiv preprint arXiv:2002.05715, 2020. + +Markus Nagel, Mart van Baalen, Tijmen Blankevoort, and Max Welling. Data-free quantization through weight equalization and bias correction. In The IEEE International Conference on Computer Vision (ICCV), October 2019. + +Wonpyo Park, Dongju Kim, Yan Lu, and Minsu Cho. Relational knowledge distillation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3967–3976, 2019. + +Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. Pytorch: An imperative style, high-performance deep learning library. In NeurIPS, pp. 8024–8035. 2019. + +Shaoqing Ren, Kaiming He, Ross Girshick, and Jian Sun. Faster r-cnn: Towards real-time object detection with region proposal networks. In Advances in neural information processing systems, pp. 91–99, 2015. + +Adriana Romero, Nicolas Ballas, Samira Ebrahimi Kahou, Antoine Chassang, Carlo Gatta, and Yoshua Bengio. Fitnets: Hints for thin deep nets. In ICLR, 2015. + +Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedical image segmentation. In International Conference on Medical image computing and computerassisted intervention, pp. 234–241. Springer, 2015. + +Mark Sandler, Andrew Howard, Menglong Zhu, Andrey Zhmoginov, and Liang-Chieh Chen. Mobilenetv2: Inverted residuals and linear bottlenecks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4510–4520, 2018. + +Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf. Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter. arXiv preprint arXiv:1910.01108, 2019. + +Frederick Tung and Greg Mori. Similarity-preserving knowledge distillation. In Proceedings of the IEEE International Conference on Computer Vision, pp. 1365–1374, 2019. + +Tao Wang, Li Yuan, Xiaopeng Zhang, and Jiashi Feng. Distilling object detectors with fine-grained feature imitation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4933–4942, 2019. + +Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaiming He. Non-local neural networks. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 7794–7803, 2018. + +Canwen Xu, Wangchunshu Zhou, Tao Ge, Furu Wei, and Ming Zhou. Bert-of-theseus: Compressing bert by progressive module replacing. arXiv preprint arXiv:2002.02925, 2020. + +Ze Yang, Shaohui Liu, Han Hu, Liwei Wang, and Stephen Lin. Reppoints: Point set representation for object detection. In The IEEE International Conference on Computer Vision (ICCV), Oct 2019. + +Junho Yim, Donggyu Joo, Jihoon Bae, and Junmo Kim. A gift from knowledge distillation: Fast optimization, network minimization and transfer learning. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4133–4141, 2017. + +Li Yuan, Francis EH Tay, Guilin Li, Tao Wang, and Jiashi Feng. Revisit knowledge distillation: a teacher-free framework. arXiv preprint arXiv:1909.11723, 2019. + +Sergey Zagoruyko and Nikos Komodakis. Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. In ICLR, 2017. + +Hongkai Zhang, Hong Chang, Bingpeng Ma, Naiyan Wang, and Xilin Chen. Dynamic R-CNN: Towards high quality object detection via dynamic training. arXiv preprint arXiv:2004.06002, 2020a. + +Linfeng Zhang, Jiebo Song, Anni Gao, Jingwei Chen, Chenglong Bao, and Kaisheng Ma. Be your own teacher: Improve the performance of convolutional neural networks via self distillation. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), October 2019a. + +Linfeng Zhang, Zhanhong Tan, Jiebo Song, Jingwei Chen, Chenglong Bao, and Kaisheng Ma. Scan: A scalable neural networks framework towards compact and efficient models. In Advances in Neural Information Processing Systems 32, pp. 4027–4036. Curran Associates, Inc., 2019b. + +Linfeng Zhang, Muzhou Yu, Tong Chen, Zuoqiang Shi, Chenglong Bao, and Kaisheng Ma. Auxiliary training: Towards accurate and robust models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 372–381, 2020b. + +Tianyun Zhang, Shaokai Ye, Kaiqi Zhang, Jian Tang, Wujie Wen, Makan Fardad, and Yanzhi Wang. A systematic dnn weight pruning framework using alternating direction method of multipliers. In The European Conference on Computer Vision (ECCV), September 2018. + +Aojun Zhou, Anbang Yao, Yiwen Guo, Lin Xu, and Yurong Chen. Incremental network quantization: Towards lossless cnns with low-precision weights. arXiv preprint arXiv:1702.03044, 2017. + +Bolei Zhou, Aditya Khosla, Agata Lapedriza, Aude Oliva, and Antonio Torralba. Learning deep features for discriminative localization. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2016. + +Chenchen Zhu, Yihui He, and Marios Savvides. Feature selective anchor-free module for singleshot object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 840–849, 2019. + +# A ABLATION STUDY ON THE SPATIAL AND CHANNEL ATTENTION + +Different from previous attention-based knowledge distillation methods, the attention-guided distillation in our methods uses not only spatial attention but also the channel attention. In this appendix, we have conducted an ablation study on the two kinds of attention with Faster RCNN (ResNet50) on MS COCO2017 to show their individual effectiveness. + +It is observed that spatial attention and channel attention lead to 2.6 and 2.3 AP improvements, respectively. In contrast, the combination of the two kinds of attention leads to $2 . 8 \mathrm { \ A P }$ improvements. These results indicate that both spatial and channel attention have their individual effectiveness and they can be utilized together to achieve better performance. + +Table 6: Ablation study on the spatial attention and channel attention. + +
Attention TypeSpatial Channel× ×√ ×X √√ √
ResultAP38.441.040.741.2
APs21.522.722.923.0
APM42.144.744.144.6
APL50.354.254.155.3
+ +# B ADAPTATION LAYERS IN KNOWLEDGE DISTILLATION + +The adaptation layers in knowledge distillation are first proposed by Romero et al. (2015) to adjust the feature size of students and teachers. Then, recent research finds that the adaptation layers play an important role in improving the performance of students (Chen et al., 2017). In this paper, we adopt different kinds of adaptation layers for different distillation loss. Concretely, We adopt 1x1 convolutional layers for $\mathcal { L } _ { A M }$ and $\mathcal { L } _ { N L D }$ , $3 { \tt X } 3$ convolutional layers for $\mathcal { L } _ { A T } ^ { s p a t i a l }$ , and fully connected layers for don’t intr $\mathcal { L } _ { A T } ^ { c h a n n e l }$ . Note that the adaptation layers are only utilized in the training period and theyitional computation and parameters. + +# C EXPERIMENTS ON SMALLER BACKBONES + +According to the insightful comments of the reviewers, we conduct a series of experiments on models with small backbones including ResNet18 and RegNet-800M, and compact detectors including Yolo v3 and SSD. As shown in Table 7, our methods also achieve significant AP improvements on these compact models. Note that more experiments with small backbones will be added in the camera ready version. + +Table 7: Experiments on MS COCO2017 with our method on small backbones. + +
ModelBackboneAPAP50AP75APsAPMAPLFPS Params
Faster RCNN Our Faster RCNNResNet18 ResNet1834.6 37.055.0 57.237.1 39.719.3 19.936.9 39.745.9 50.328.1 28.130.57 30.57
Grid RCNNResNet1836.654.239.720.139.848.226.766.37
Our Grid RCNN RetinaNetResNet18 ResNet1838.8 33.456.7 51.841.5 35.121.1 16.941.6 35.652.7 44.926.7 25.866.37 23.30
Our RetinaNet RetinaNetResNet18 RegNet-800M35.9 35.654.4 54.738.0 37.717.9 19.739.1 39.049.4 47.825.8 22.423.30 19.27
Our RetinaNet Yolo v3RegNet-800M DarkNet5338.4 33.457.4 56.340.7 35.221.4 19.542.0 36.452.3 43.622.4 42.219.27 61.95
Our Yolo v3DarkNet5335.858.238.121.239.045.642.261.95
SSD Our SSDVGG16 VGG1629.4 31.249.3 52.131.0 32.811.7 12.634.1 37.444.9 46.226.1 26.138.08 38.08
+ +# D EXPERIMENTS ON CITYSCAPES + +According to the insightful comments of the reviewers, as shown in Table 8, we conduct a series of experiments to show the effectiveness of our method on Cityscapes. Note that more experiments on Cityscapes will be added in the camera ready version. + +Table 8: Experiments on Cityscapes with our method. + +
ModelBackboneBox APMask AP
Faster RCNNResNet5040.3N/A
Our Faster RCNNResNet5043.5N/A
Mask RCNNResNet5041.035.8
Our Mask RCNNResNet5043.037.5
+ +# E COMPARISION WITH RELATED WORK + +Comparison on Methodology and Application. Feature distillation is utilized in all the five methods. However, Chen et al. distill not only the feature, but also the classification logits and bounding box regression results, which has limited their application scenes in one stage and anchor-free models. Li et al. and Wang et al. distill the features in the regions of proposals and near object anchor locations, respectively. As a result, their methods reply on the supervision of anchors and groundtruths and can’t be utilized in one stage and anchor free models. Bajestani & Yang is utilized for active perception on video, which can not be utilized in image-based detection. In contrast, in our method, the attention mask and relation information can be easily generated from the backbone features, which has no requirements on groundtruths, anchors and proposals. As a result, it can be easily used in different kinds of models and tasks without any modification. + +Table 9: Comparision on methodology and application. + +
MethodFeature Classfy Regress Relation|One-Stage Two-Stage Anchor-based Anchor-free Segment.
Our Method×√√√√
Chen et al.××√广××
Li et al.××××√1××
Wang et al.>>>>××××√√××
Bajestani & Yang√×××√√√××
+ +Comparison on Motivation. Chen et al.’s method is a direct application of knowledge distillation on object detection. The other three methods and our method are motivated by the imbalance between foreground and background piexles and these methods try to address this issue by reweighting the distillation loss. Besides, our method is also motivated by the effect of the relation among pixels in an image, which is ignored by the other methods. \ No newline at end of file diff --git a/parse/train/uKhGRvM8QNH/uKhGRvM8QNH_content_list.json b/parse/train/uKhGRvM8QNH/uKhGRvM8QNH_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..3cff2a3465da565a7c958acf69d67c06cea765d6 --- /dev/null +++ b/parse/train/uKhGRvM8QNH/uKhGRvM8QNH_content_list.json @@ -0,0 +1,1600 @@ +[ + { + "type": "text", + "text": "IMPROVE OBJECT DETECTION WITH FEATURE-BASED KNOWLEDGE DISTILLATION: TOWARDS ACCURATE AND EFFICIENT DETECTORS ", + "text_level": 1, + "bbox": [ + 174, + 98, + 823, + 171 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Linfeng Zhang Institute for Interdisciplinary Information Sciences, Tsinghua University ", + "bbox": [ + 184, + 195, + 455, + 238 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Kaisheng Ma ∗ Institute for Interdisciplinary Information Sciences, Tsinghua University ", + "bbox": [ + 508, + 195, + 781, + 238 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "ABSTRACT ", + "text_level": 1, + "bbox": [ + 452, + 273, + 544, + 289 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Knowledge distillation, in which a student model is trained to mimic a teacher model, has been proved as an effective technique for model compression and model accuracy boosting. However, most knowledge distillation methods, designed for image classification, have failed on more challenging tasks, such as object detection. In this paper, we suggest that the failure of knowledge distillation on object detection is mainly caused by two reasons: (1) the imbalance between pixels of foreground and background and (2) lack of distillation on the relation between different pixels. Observing the above reasons, we propose attention-guided distillation and non-local distillation to address the two problems, respectively. Attention-guided distillation is proposed to find the crucial pixels of foreground objects with attention mechanism and then make the students take more effort to learn their features. Non-local distillation is proposed to enable students to learn not only the feature of an individual pixel but also the relation between different pixels captured by non-local modules. Experiments show that our methods achieve excellent AP improvements on both one-stage and two-stage, both anchor-based and anchor-free detectors. For example, Faster RCNN (ResNet101 backbone) with our distillation achieves 43.9 AP on COCO2017, which is 4.1 higher than the baseline. Codes have been released on Github†. ", + "bbox": [ + 232, + 304, + 764, + 553 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 575, + 336, + 590 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Recently, excellent breakthrough in various domains has been achieved with the success of deep learning (Ronneberger et al., 2015; Devlin et al., 2018; Ren et al., 2015). However, the most advanced deep neural networks always consume a large amount of computation and memory, which has limited their deployment in edge devices such as self-driving cars and mobile phones. To address this problem, abundant techniques are proposed, including pruning (Han et al., 2016; Zhang et al., 2018; Liu et al., 2018; Frankle & Carbin, 2018), quantization (Nagel et al., 2019; Zhou et al., 2017), compact model design (Sandler et al., 2018; Howard et al., 2019; Ma et al., 2018; Iandola et al., 2016) and knowledge distillation (Hinton et al., 2014; Bucilua et al., 2006). Knowledge distillation, which is ˇ also known as teacher-student learning, aims to transfer the knowledge of an over-parameterized teacher to a lightweight student. Since the student is trained to mimic the logits or features of the teacher, the student can inherit the dark knowledge from the teacher, and thus often achieves much higher accuracy. Due to its simplicity and effectiveness, knowledge distillation has become a popular technique for both model compression and model accuracy boosting. ", + "bbox": [ + 174, + 598, + 539, + 833 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/ab781c0c9e775df09707b0c93a6aab5e53ce6655c2fbadbcea02d8a117d9474d.jpg", + "image_caption": [ + "Figure 1: Results overview. " + ], + "image_footnote": [], + "bbox": [ + 555, + 613, + 821, + 813 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "", + "bbox": [ + 176, + 834, + 825, + 888 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "As one of the most crucial challenges in computer vision, object detection has an urgent requirement of both accurate and efficient models. Unfortunately, most of the existing knowledge distillation methods in computer vision are designed for image classification and usually leads to trivial improvements on object detection (Li et al., 2017). In this paper, we impute the failure of knowledge distillation on object detection to the following two issues, which will be solved later, respectively. ", + "bbox": [ + 174, + 103, + 823, + 172 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Imbalance between foreground and background. In an image to be detected, the background pixels are often more overwhelming than the pixels of the foreground objects. However, in previous knowledge distillation, the student is always trained to mimic the features of all pixels with the same priority. As a result, students have paid most of their attention to learning background pixels features, which suppresses student’s learning on features of the foreground objects. Since foreground pixels are more crucial in detection, the imbalance hurts the performance of knowledge distillation severely. To overcome this obstacle, we propose the attention-guided distillation which distills only the crucial foreground pixels. Since the attention map can reflect the position of the important pixels (Zhou et al., 2016), we adopt the attention map as the mask for knowledge distillation. Concretely, the pixel with a higher attention value is regarded as a pixel of a foreground object and then is learned by the student model with a higher priority. Compared with the previous binary mask method (Wang et al., 2019), the mask generated by attention maps in our methods is more fine-grained and requires no additional supervision. Compared with the previous attention-based distillation methods (Zagoruyko & Komodakis, 2017), the attention map in our methods is not only utilized as the information to be distilled but also utilized as the mask signal for feature distillation. ", + "bbox": [ + 174, + 181, + 825, + 388 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Lack of distillation on relation information. It is generally acknowledged that the relation between different objects contains valuable information in object detection. Recently, lots of researchers successfully improve the performance of detectors by enabling detectors to capture and make use of these relations, such as non-local modules (Wang et al., 2018) and relation networks (Hu et al., 2018). However, the existing object detection knowledge distillation methods only distill the information of individual pixels but ignore the relation of different pixels. To solve this issue, we propose the non-local distillation, which aims to capture the relation information of students and teachers with non-local modules and then distill them from teachers to students. ", + "bbox": [ + 174, + 395, + 825, + 507 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Since the non-local modules and attention mechanism in our methods are only required in the training period, our methods don’t introduce additional computation and parameters in the inference period. Besides, our methods are feature-based distillation methods which do not depend on a specific detection algorithm so they can be directly utilized in all kinds of detectors without any modification. On MS COCO2017, 2.9, 2.9 and $2 . 2 \\mathrm { A P }$ improvements can be observed on two-stage, one-stage, and anchor-free models on average, respectively. Experiments on Mask RCNN show that our methods can also improve the performance of instance segmentation by 2.0 AP, on average. We have conducted a detailed ablation study and sensitivity study to show the effectiveness and stability of each distillation loss. Moreover, we study the relation between teachers and students on object detection and find that knowledge distillation on object detection requires a high AP teacher, which is different from the conclusion in image classification where a high AP teacher may harm the performance of students (Mirzadeh et al., 2019; Cho & Hariharan, 2019). We hope that these results are worth more contemplation of knowledge distillation on tasks except for image classification. To sum up, the contribution of this paper can be summarized as follows. ", + "bbox": [ + 173, + 513, + 825, + 708 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "• We propose the attention-guided distillation, which emphasizes students’ learning on the foreground objects and suppresses students’ learning on the background pixels. We propose the non-local distillation, which enables the students to learn not only the information of the individual pixel but also the relation between different pixels from teachers. We show that a teacher with higher AP is usually a better teacher in knowledge distillation on object detection, which is different from the conclusion in image classification. ", + "bbox": [ + 215, + 719, + 825, + 813 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 RELATED WORK ", + "text_level": 1, + "bbox": [ + 176, + 837, + 344, + 853 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "As an effective method for model compression and model accuracy boosting, knowledge distillation has been widely utilized in various domains and tasks, including image classification (Hinton et al., 2014; Romero et al., 2015; Zagoruyko & Komodakis, 2017), object detection (Chen et al., 2017; Li et al., 2017; Wang et al., 2019; Bajestani & Yang, 2020), semantic segmentation (Liu et al., 2019), face recognition (Ge et al., 2018), pretrained language model (Sanh et al., 2019; Xu et al., 2020), multi-exit networks training (Zhang et al., 2019b;a), model robustness (Zhang et al., 2020b) and so on. Hinton et al. (2014) first propose the concept of knowledge distillation where the students are trained to mimic the results after softmax layers of teachers. Then, abundant methods are proposed to transfer the knowledge in teacher’s features (Romero et al., 2015) or the variants, such as attention (Zagoruyko & Komodakis, 2017; Hou et al., 2019), FSP (Yim et al., 2017), mutual information (Ahn et al., 2019), positive features (Heo et al., 2019), relation of samples in a batch (Park et al., 2019; Tung & Mori, 2019). ", + "bbox": [ + 174, + 867, + 825, + 924 + ], + "page_idx": 1 + }, + { + "type": "image", + "img_path": "images/61041fd13485e47decbb5cc309be0e4c87bfab8bdf3205e1793c3584c2e2e466.jpg", + "image_caption": [ + "Figure 2: Details of our methods: (a) Attention-guided distillation generates the spatial and channel attention with average pooling in the channel and spatial dimension, respectively. Then, students are encouraged to mimic the attention of teachers. Besides, students are also trained to mimic the feature of teachers, which is masked by the attention of both students and teachers. (b) Nonlocal distillation captures the relation of pixels in an image with non-local modules. The relation information of teachers is learned by students with $L _ { 2 }$ norm loss. (c) The architecture of non-local modules. ‘1x1’ is convolution layer with 1x1 kernel. (d) Distillation loss is applied to backbone features with different resolutions. The detection head and neck are not involved in our methods. " + ], + "image_footnote": [], + "bbox": [ + 176, + 101, + 823, + 343 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 173, + 500, + 825, + 611 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Improving the performance of object detection becomes a hot topic in knowledge distillation recently. Chen et al. (2017) design the first knowledge distillation method on object detection, which includes distillation loss on the backbone, the classification head and the regression head. Then, many researchers find that the imbalance between the foreground objects and background is a crucial problem in detection distillation. Instead of distilling the whole features of backbone networks, Li et al. (2017) only apply $L _ { 2 }$ distillation loss to the features ", + "bbox": [ + 174, + 619, + 482, + 785 + ], + "page_idx": 2 + }, + { + "type": "image", + "img_path": "images/d2c71a8917cfd59868cd1078ccf778786d6d211dffd11090042191011e3fcae8.jpg", + "image_caption": [ + "Figure 3: Comparison between the proposed attention-guided distillation and other methods. " + ], + "image_footnote": [], + "bbox": [ + 500, + 618, + 821, + 739 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "sampled by RPN. Bajestani & Yang (2020) propose the temporal knowledge distillation, which introduces a hyper-parameter to balance the distillation loss between the pixels of the foreground and background. Wang et al. (2019) propose the fine-grained feature imitation, which only distills the feature near object anchor locations. However, although these works have tried to distill only the pixels of foreground objects, they always reply on the annotation in groundtruth, anchors, and bounding boxes and thus can not be transferred to different kinds of detectors and tasks. In contrast, in our method, the pixels of foreground objects are found with attention mechanism, which can be easily generated from features. As a result, it can be directly utilized in all kinds of detectors without any modification. As shown in Figure 3, the difference between the previous mask-based detection distillation method (Wang et al., 2019) and our attention-guided distillation can be summarized as follows (i) Our methods generate the mask with attention mechanism while they generate the mask with ground truth bounding boxes and anchor priors. (ii) The mask in our methods is a pixel-wise and fine-grained mask while the mask in their method is an object-wise and binary mask. (iii) The masks in our methods are composed of a spatial mask and a channel mask while they only have a spatial mask. More detailed comparison with related work can be found in Appendix.E. ", + "bbox": [ + 173, + 785, + 825, + 924 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 174 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3 METHODOLOGY ", + "text_level": 1, + "bbox": [ + 176, + 195, + 341, + 212 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.1 ATTENTION-GUIDED DISTILLATION ", + "text_level": 1, + "bbox": [ + 176, + 227, + 460, + 242 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We use $A \\in \\mathbb { R } ^ { C , H , W }$ to denote the feature of the backbone in an object detection model, where $C , H , W$ denotes its channel number, height and width, respectively. Then, the generation of the spatial attention map and channel attention map is equivalent to finding the mapping function $\\mathcal { G } ^ { s } : \\mathbf { \\bar { \\mathbb { R } } } ^ { C , H , W } \\mathbb { R } ^ { H , W }$ and $\\mathcal { G } ^ { c } : \\mathbb { R } ^ { C , H , W } \\mathbb { R } ^ { C }$ , respectively. Note that the superscripts $s$ and $c$ here are utilized to discriminate ‘spatial’ and ‘channel’. Since the absolute value of each element in the feature implies its importance, we construct $\\mathcal G ^ { s }$ by summing the absolute values across the channel dimension and construct $\\mathcal G ^ { c }$ by summing the absolute values across the width and height dimension, which can be formulated as $\\begin{array} { r } { \\mathcal { G } ^ { c } ( A ) = \\frac { 1 } { H W } \\sum _ { H } ^ { i = 1 } \\sum _ { W } ^ { j = 1 } | A . , _ { i , j } | } \\end{array}$ and $\\begin{array} { r } { \\mathcal G ^ { s } ( A ) = \\frac { 1 } { C } \\sum _ { C } ^ { \\bar { k = 1 } } | A _ { k , \\cdot , \\cdot } | . } \\end{array}$ where $i , j , k$ denotes the $\\dot { \\iota } _ { t h } , j _ { t h } , k _ { t h }$ slice of $A$ in the height, width, and channel dimension, respectively. Then, the spatial attention mask $M ^ { s }$ and the channel attention mask $M ^ { c }$ used in attentionguided distillation can be obtained by summing the attention maps from the teacher and the student detector, which can be formulated as $M ^ { s } \\stackrel { \\smile } { = } H W \\cdot \\mathrm { s o f t m a x } ( \\hat { ( } \\mathcal G ^ { s } ( A ^ { S } ) + \\mathcal G ^ { s } ( A ^ { T } ) ) / T ) , M ^ { c } =$ $C \\cdot \\operatorname { s o f t m a x } ( ( { \\mathcal { G } } ^ { c } ( A ^ { { \\mathcal { S } } } ) + { \\mathcal { G } } ^ { c } ( A ^ { { \\mathcal { T } } } ) ) / T )$ . Note that the superscripts $s$ and $\\tau$ here are used to discriminate students and teachers. $T$ is a hyper-parameter in softmax introduced by Hinton et al. to adjust the distribution of elements in attention masks (see Figure 4). The attention-guided distillation loss $\\mathcal { L } _ { A G D }$ is composed of two components – attention transfer loss $\\mathcal { L } _ { A T }$ and attention-masked loss $\\mathcal { L } _ { A M }$ . $\\mathcal { L } _ { A T }$ is utilized to encourage the student model to mimic the spatial and channel attention of the teacher model, which can be formulated as ", + "bbox": [ + 173, + 252, + 825, + 507 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/c398743247e2c0735fca38bd21c7dc288e086c4336496f3c83360d813fa4e41c.jpg", + "text": "$$\n\\mathcal { L } _ { A T } = \\mathcal { L } _ { 2 } ( \\mathcal { G } ^ { s } ( A ^ { \\mathcal { S } } ) , \\mathcal { G } ^ { s } ( A ^ { \\mathcal { T } } ) ) + \\mathcal { L } _ { 2 } ( \\mathcal { G } ^ { c } ( A ^ { \\mathcal { S } } ) , \\mathcal { G } ^ { c } ( A ^ { \\mathcal { T } } ) ) .\n$$", + "text_format": "latex", + "bbox": [ + 313, + 512, + 684, + 532 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "$\\mathcal { L } _ { A M }$ is utilized to encourage the student to mimic the features of teacher models by a $\\mathcal { L } _ { 2 }$ norm loss masked by $M ^ { s }$ and $M ^ { c }$ , which can be formulated as ", + "bbox": [ + 173, + 540, + 823, + 568 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/ee330a087eecfafc8872384eba344c1bb104f26fcf27b7d1191705426d02a260.jpg", + "text": "$$\n\\mathcal { L } _ { A M } = \\left( \\sum _ { k = 1 } ^ { C } \\sum _ { i = 1 } ^ { H } \\sum _ { j = 1 } ^ { W } ( A _ { k , i , j } ^ { \\mathcal { T } } - A _ { k , i , j } ^ { S } ) ^ { 2 } \\cdot M _ { i , j } ^ { s } \\cdot M _ { k } ^ { c } \\right) ^ { \\frac { 1 } { 2 } } .\n$$", + "text_format": "latex", + "bbox": [ + 308, + 575, + 689, + 631 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.2 NON-LOCAL DISTILLATION ", + "text_level": 1, + "bbox": [ + 176, + 646, + 406, + 660 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Non-local module (Wang et al., 2018) is an effective method to improve the performance of neural networks by capturing the global relation information. In this paper, we apply non-local modules to capture the relation between pixels in an image, which can be formulated as $\\begin{array} { r l } { r _ { i , j } } & { { } = } \\end{array}$ $\\begin{array} { r } { \\frac { 1 } { W H } \\sum _ { H } ^ { i ^ { ' } = 1 } { \\sum _ { W } ^ { j ^ { ' } = 1 } { f ( A . , { i , j } , A . _ { { i ^ { ' } , j ^ { ' } } } ) g ( A . _ { { \\cdot , i ^ { ' } , j ^ { ' } } } ) } } } \\end{array}$ , where $r$ denotes the obtained relation information. $i , j$ are the spatial indexes of an output position whose response is to be computed. $i ^ { \\prime } , j ^ { \\prime }$ are the spatial indexes that enumerates all possible positions. $f$ is a pairwise function for computing the relation of two pixels and $g$ is an unary function for computing the representation of an individual pixel. Now, we can introduce the proposed non-local distillation loss $\\mathcal { L } _ { N L D }$ as the $\\mathcal { L } _ { 2 }$ loss between the relation information of the students and teachers, which can be formulated as $\\mathcal { L } _ { N L D } = \\mathcal { L } _ { 2 } ( r ^ { S } , r ^ { T } )$ . ", + "bbox": [ + 173, + 671, + 825, + 810 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "3.3 OVERALL LOSS FUNCTION ", + "text_level": 1, + "bbox": [ + 176, + 828, + 403, + 843 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We introduce three hyper-parameters $\\alpha , \\beta , \\gamma$ to balance different distillation loss in our methods. The overall distillation loss can be formulated as ", + "bbox": [ + 171, + 854, + 821, + 883 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/7152295a1c0eeade66848eaf3c970598352d6f66865d4ecb50c4a53b147cea17.jpg", + "text": "$$\n\\begin{array} { r } \\mathcal { L } _ { D i s t i l l } ( A ^ { \\mathcal { T } } , A ^ { \\mathcal { S } } ) = \\underbrace { \\alpha \\cdot \\mathcal { L } _ { A T } + \\beta \\cdot \\mathcal { L } _ { A M } } _ \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 303, + 890, + 681, + 912 + ], + "page_idx": 3 + }, + { + "type": "image", + "img_path": "images/c2786986263c9ba41fd1a2ae5941b7a7b93eed5f9f4b273a6df235b3d2eb1e58.jpg", + "image_caption": [ + "Figure 4: Visualization and distribution of the spatial attention with different $T$ . With a smaller $T$ , the pixels of high attention values are emphasized more in knowledge distillation. " + ], + "image_footnote": [], + "bbox": [ + 178, + 102, + 818, + 214 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The overall distillation loss is a model-agnostic loss, which can be added to the original training loss of any detection model directly. The sensitivity study of each hyper-parameter and the ablation study of each loss are shown in Figure 5 and Table 4, respectively. ", + "bbox": [ + 174, + 296, + 825, + 338 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4 EXPERIMENT ", + "text_level": 1, + "bbox": [ + 176, + 372, + 316, + 388 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.1 EXPERIMENTS SETTINGS ", + "text_level": 1, + "bbox": [ + 176, + 412, + 388, + 426 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The proposed knowledge distillation method is evaluated on MS COCO2017, which is a large-scale dataset that contains over $1 2 0 \\mathrm { k }$ images spanning 80 categories (Lin et al., 2014). The benchmark detection networks are composed of both two-stage detection models, including Faster RCNN (Ren et al., 2015), Cascade RCNN (Cai & Vasconcelos, 2019), Dynamic RCNN (Zhang et al., 2020a), Grid RCNN (Lu et al., 2019) and one-stage detection models, including the RetinaNet (Lin et al., 2017), Fsaf RetinaNet (Zhu et al., 2019). Besides, we also evaluate our methods on the Mask RCNN(He et al., 2017), Cascade Mask RCNN (Cai & Vasconcelos, 2019), and anchor-free models - RepPoints (Yang et al., 2019). We adopt the ResNet50 and ResNet101 (He et al., 2016) as the backbone network of each detection model. We pre-train the backbone model on ImageNet (Deng et al., 2009) and then finetune it on MS COCO2017. We have compared our methods with three kinds of object detection knowledge distillation methods (Chen et al., 2017; Wang et al., 2019; Heo et al., 2019). All the experiments in this paper are implemented with PyTorch (Paszke et al., 2019) with mmdetection2 framework (Chen et al., 2019). The reported fps is measured on one RTX 2080Ti GPU. We adopt the same hyper-parameters settings $\\lbrace \\alpha = \\gamma = 7 ^ { ^ { \\circ } } \\times 1 0 ^ { - 5 }$ , $\\beta = 4 \\times 1 0 ^ { - 3 } , T = 0 . 1 \\}$ for all the two-stage models and $\\left\\{ \\alpha = \\gamma = 4 \\times 1 0 ^ { - 4 } , \\beta = 2 \\times 1 0 ^ { - 2 } , T = 0 . 5 \\right\\}$ for all the onestage models. Cascade Mask RCNN with ResNeXt101 backbone is utilized as the teacher for all the two-stage students and RetinaNet with ResNeXt101 backbone is utilized as the teacher for all the one-stage students. Please refer to the codes in Github for more details. ", + "bbox": [ + 173, + 444, + 825, + 694 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "4.2 EXPERIMENT RESULTS ", + "text_level": 1, + "bbox": [ + 176, + 726, + 374, + 739 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "In this section, we show the experiment results of the baseline detectors and our models in Table 1 and Table 2, and compare our methods with other three knowledge distillation methods in Table 3. It is observed that: (i) Consistent and significant AP boost can be observed on all the 9 kinds of detectors. On average, there are 2.9, 2.9, and 2.2 AP improvements on the two-stage, one-stage, and anchor-free detectors, respectively. (ii) With the proposed method, a student model with ResNet50 backbone can outperform the same model with ResNet101 backbone by $1 . 2 \\mathrm { A P }$ on average. (iii) On Mask RCNN related models, there are 2.3 improvements on bounding box AP and 2.0 improvements on mask AP on average respectively, indicating the proposed method can be utilized in not only object detection but also instance segmentation. (iv) Our methods achieve 2.2 higher AP than the second-best distillation method, on average. (v) There are 2.7 and 2.9 AP improvements on models with ResNet50 and ResNet101 backbones, respectively, indicating that deeper detectors benefit more from knowledge distillation. ", + "bbox": [ + 173, + 757, + 825, + 924 + ], + "page_idx": 4 + }, + { + "type": "table", + "img_path": "images/7afd901d12dbb78ac00bac49d459cd830454bdf1bd098f4519b72c982fa6042e.jpg", + "table_caption": [ + "Table 1: Experiments on MS COCO2017 with the proposed distillation method. " + ], + "table_footnote": [], + "table_body": "
ModelBackboneAPAP50AP75APsAPMAPLFPSParams
Faster RCNNResNet5038.459.042.021.542.150.318.143.57
Our Faster RCNNResNet5041.562.245.123.545.055.318.143.57
Faster RCNNResNet10139.860.143.322.543.652.814.262.57
Our Faster RCNNResNet10143.964.248.125.348.058.714.262.57
Cascade RCNNResNet5041.059.444.422.744.454.315.471.22
Our Cascade RCNNResNet5044.462.748.324.848.059.315.471.22
Cascade RCNNResNet10142.560.746.423.546.556.411.790.21
Our Cascade RCNNResNet10145.263.549.426.248.760.811.790.21
Dynamic RCNNResNet5039.858.343.223.042.852.418.143.57
Our Dynamic RCNNResNet5042.861.247.023.946.257.718.143.57
Dynamic RCNNResNet10141.259.745.324.044.954.314.262.57
Our Dynamic RCNNResNet10144.863.048.925.048.960.414.262.57
Grid RCNNResNet5040.458.443.622.843.953.314.066.37
Our Grid RCNNResNet5042.661.146.124.246.655.814.066.37
Grid RCNNResNet10141.659.845.023.745.754.711.085.36
Our Grid RCNNResNet10144.863.648.926.548.959.611.085.36
RetinaNetResNet5037.456.739.620.040.749.717.737.74
Our RetinaNetResNet5039.658.842.122.743.352.517.737.74
RetinaNetResNet10138.958.041.521.042.852.413.556.74
Our RetinaNetResNet10141.360.844.322.746.055.213.556.74
Fsaf RetinaNet Our Fsaf RetinaNetResNet5037.856.839.820.441.148.820.036.19
ResNet5041.461.044.223.145.255.220.036.19
Fsaf RetinaNetResNet10139.358.642.122.143.451.215.055.19
Our Fsaf RetinaNetResNet10142.662.045.524.547.056.215.055.19
RepPointsResNet5038.659.641.622.542.250.418.236.62
Our RepPointsResNet5040.661.743.823.444.653.018.236.62
RepPointsResNet10140.561.343.523.444.753.213.255.62
Our RepPointsResNet10142.7
63.746.424.947.256.413.255.62
", + "bbox": [ + 199, + 126, + 802, + 582 + ], + "page_idx": 5 + }, + { + "type": "table", + "img_path": "images/bba8b8d0b96c113302029a6fe21c551b3197abfd12f28a9a97bb6d2c6a1df018.jpg", + "table_caption": [ + "Table 2: Experiments on MS COCO2017 with the proposed distillation method on Mask RCNN. " + ], + "table_footnote": [], + "table_body": "
ModelBackboneBounding box APMask AP
APAPsAPMAPLAPAPsAPMAPL
Mask RCNNResNet5039.222.942.651.235.419.138.648.4
Our mask RCNNResNet5041.723.445.355.837.419.740.552.1
Mask RCNNResNet10140.823.045.054.136.619.240.250.5
Our Mask RCNNResNet10143.024.747.257.138.720.742.353.3
Cascade Mask RCNNResNet5041.923.244.955.936.518.939.250.7
Our Cascade Mask RCNNResNet5043.824.947.258.438.020.240.952.8
CascadeMask RCNNResNet10142.924.446.557.037.319.740.651.5
Our Cascade Mask RCNNResNet10145.426.349.060.939.621.342.855.0
", + "bbox": [ + 212, + 632, + 785, + 790 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "4.3 ABLATION STUDY AND SENSITIVITY STUDY ", + "text_level": 1, + "bbox": [ + 174, + 825, + 522, + 840 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Ablation study. Table 4 shows the ablation study of the proposed attention-guided distillation $( { \\mathcal { L } } _ { A T }$ and $\\mathcal { L } _ { A M }$ ) and non-local distillation $( \\mathcal { L } _ { N L D } )$ . It is observed that: (i) Attention-guided distillation and non-local distillation lead to 2.8 and $1 . 4 ~ \\mathrm { A P }$ improvements, respectively. (ii) $\\mathcal { L } _ { A T }$ and $\\mathcal { L } _ { A M }$ lead to 1.2 and $2 . 4 \\ : \\mathrm { A P }$ improvements respectively, indicating that most of the benefits of attentionguided distillation are obtained from the feature loss masked by the attention maps $( \\mathcal { L } _ { A M } )$ . (iii) ", + "bbox": [ + 174, + 853, + 825, + 924 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "There are 3.1 AP improvements with the combination of attention-guided distillation and non-local distillation. These observations indicate that each distillation loss in our methods has their individual effectiveness and they can be utilized together to achieve better performance. We also give an ablation study to the spatial and channel attention in Appendix A. ", + "bbox": [ + 174, + 103, + 823, + 160 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Sensitivity study on hyper-parameters. Four hyper-parameters are introduced in this paper. $\\alpha$ , $\\beta$ , and $\\gamma$ are utilized to balance the magnitude of different distillation loss and $T$ is utilized to adjust the distribution of attention masks. The hyper-parameter sensitivity study on MS COCO2017 with Faster RCNN (ResNet50 backbone) is introduced in Figure 5. It is observed that the worst hyper-parameters only lead to 0.3 AP drop compared with the highest AP, which is still 2.9 higher compared with the baseline model, indicating that our methods are not sensitive to the choice of hyper-parameters. ", + "bbox": [ + 173, + 166, + 825, + 263 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Sensitivity study on the types of non-local modules. There are four kinds of non-local modules, including Gaussian, embedded Gaussian, dot production, and concatenation. Table 5 shows the performance of our methods with different types of non-local modules. It is observed that the worst non-local type (Gaussian) is only 0.2 AP lower than the best non-local type (Embedded Gaussian and Concatenation), indicating our methods are not sensitive to the choice of non-local modules. ", + "bbox": [ + 174, + 270, + 825, + 340 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/8ada90f305f21d053afc3f09be6190d829f42a58fc2c2054a755bac754502548.jpg", + "table_caption": [ + "Table 3: Comparison between our methods and other distillation methods. Note that we don’t compare our methods with Chen’s and Wang’s methods on RetinaNet because their methods can not be utilized in one-stage models. ResNet50 is utilized as backbone in these models. " + ], + "table_footnote": [], + "table_body": "
ModelAPAP50 AP75APs 21.5APMAPL
Faster RCNN + Chen etal.Method + Wang et al. Method + Heo et al. Method + Our Methods38.4 38.7 39.1 38.9 41.559.0 59.0 59.8 60.1 62.242.0 42.1 22.0 42.8 22.2 42.6 21.8 45.1 23.542.1 41.9 42.9 42.7 45.050.3 51.0 51.1 50.7 55.3
Cascade RCNN + Chen et al.Method + Wang et al. Method +Heo etal.Method + Our Methods41.0 41.6 42.1 41.7 44.459.4 62.1 62.7 62.3 62.744.4 45.7 46.1 45.7 48.322.7 23.9 24.4 23.9 24.844.4 54.3 45.8 54.7 46.4 55.6 45.7 55.3 48.0 59.3
RetinaNet + Heo et al. Method + Our Methods37.4 37.8 39.656.7 58.3 58.839.6 41.1 21.6 42.1 22.720.0 40.7 41.2 43.349.7 48.3 52.5
", + "bbox": [ + 264, + 410, + 733, + 630 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/3df24046f01c2245e58cdfc95f7939dbde91ce534aee57f3a68ed22dca7537de.jpg", + "table_caption": [ + "Table 4: Ablation study of the three distillation loss. " + ], + "table_footnote": [], + "table_body": "
LossLAT LAM LNLD× × ×√ × ×× √ ×× × √√ √ ×√ 1 √
ResultAP APs38.439.640.839.841.241.5
APM21.522.722.822.723.023.5
APL42.1 50.342.9 52.544.3 54.343.1 52.344.6 55.345.0 55.3
", + "bbox": [ + 197, + 685, + 607, + 797 + ], + "page_idx": 6 + }, + { + "type": "table", + "img_path": "images/875df1a66b49b4b986d95d9f4909a276a2cf568ddcdc303eae32561afb676f90.jpg", + "table_caption": [ + "Table 5: Results of different types of non-local modules on Faster RCNN (ResNet50 backbone). " + ], + "table_footnote": [], + "table_body": "
Non-Local TypeAP
Embedded Gaussian41.5
Dot Production41.4
Concatenation41.5
Gaussian41.3
", + "bbox": [ + 629, + 719, + 834, + 804 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5 DISCUSSION ", + "text_level": 1, + "bbox": [ + 174, + 821, + 312, + 838 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "5.1 ANALYSIS ON THE BENEFITS OF KNOWLEDGE DISTILLATION ", + "text_level": 1, + "bbox": [ + 174, + 854, + 638, + 869 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Qualitative analysis. Figure 6 shows the comparison of detection results between a baseline and a distilled detector. It is observed that: (i) Our methods improve the detection ability on small-objects. In the first three figures, the distilled model can correctly detect cars, the handbag, and the person in the car, respectively. (ii) Our methods prevent models from generating multiple bounding boxes for the same object. In the last two figures, the baseline model generates multiple bounding boxes for the boat and the train while the distilled model avoids these errors. ", + "bbox": [ + 176, + 881, + 825, + 924 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 823, + 145 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "Analysis on the types of detection error. We have analyzed the different types of detection errors in the baseline and distilled models in Figure 7. The number in the legend indicates AUC (area under the curve). It is observed that our distillation method leads to error reduction on all kinds of error. In brief, our methods can improve the ability of both localization and classification. ", + "bbox": [ + 174, + 152, + 825, + 208 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/b7951f3b430017bae85e2b29f2363772d7a73ae9490557bdf248cde346a3e21d.jpg", + "image_caption": [ + "Figure 5: Hyper-parameter sensitivity study of $\\alpha , \\beta , \\gamma , T$ with Faster RCNN on MS COCO2017. " + ], + "image_footnote": [], + "bbox": [ + 176, + 229, + 820, + 318 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/86857e4ff1d4a330c3626149534379966c91305c46958428ee987f41ef23f2f0.jpg", + "image_caption": [ + "Figure 6: Qualitative analysis on MS COCO2017 with distilled and baseline Faster RCNN. We mark the undetected and wrongly detected objects of the baseline detector with orange boxes. " + ], + "image_footnote": [], + "bbox": [ + 183, + 385, + 813, + 522 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5.2 RELATION BETWEEN STUDENT DETECTORS AND TEACHER DETECTORS. ", + "bbox": [ + 174, + 608, + 718, + 623 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "There is sufficient research focusing on the relation between students and teachers. Mirzadeh et al. (2019) and Cho & Hariharan (2019) show that a teacher with higher accuracy may not be the better teacher for knowledge distillation and sometimes a teacher with too high accuracy may harm the performance of students. Besides, Mobahi et al. (2020) and Yuan et al. (2019) show that the same model and even a model with lower accuracy than the student model can be utilized as the teacher model for knowledge distillation. However, all their experiments are conducted on image classification. In this section, we study whether these observations still hold in the task of object detection. As shown in Figure 8 , we conduct experiments on Faster RCNN (ResNet50 backbone) and Cascade RCNN (ResNet50 backbone) students with teacher models of different AP. It is observed that: (i) In all of our experiments, the student with a higher AP teacher always achieves higher AP. (ii) When the teacher has lower or the same AP as the student, there are very limited and even negative improvements with knowledge distillation. This observation indicates that the relation between students and teachers on object detection is opposite to that on image classification. Our experiment results suggest that there is a strong positive correlation between the AP of students and teachers. A high AP teacher tends to improve the performance of students significantly. ", + "bbox": [ + 173, + 638, + 825, + 847 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We think that the reason why a high AP teacher model is crucial in object detection but not very necessary in image classification is that object detection is a more challenging task. As a result, a weaker teacher model may introduce more negative influence on students, which prevents students from achieving higher AP. In contrast, on image classification, most of teacher models can achieve a very high training accuracy so they don’t introduce so much error. ", + "bbox": [ + 174, + 854, + 823, + 924 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/e0a896ee35c3861ffcb870a29298a306e2b90e41f689b4cfea61ab6a8d4433aa.jpg", + "image_caption": [ + "Figure 7: Distribution of error types on distilled and baseline Faster RCNN. Loc - Localization error; Sim & Oth - Classification error on similar & not similar classes; BG - False positive prediction fired on background. FN - False Negative prediction. ", + "Figure 8: Relation between students and teachers on Faster RCNN and Cascade RCNN in MS COCO2017. " + ], + "image_footnote": [], + "bbox": [ + 178, + 99, + 816, + 228 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "6 CONCLUSION ", + "text_level": 1, + "bbox": [ + 176, + 321, + 318, + 337 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "In this paper, we have proposed two knowledge distillation methods, including attention-guided distillation and the non-local distillation to improve the performance of object detection models. Attention-guided distillation manages to find the crucial pixels and channels from the whole feature map with attention mechanism and then enables the student to focus more on these crucial pixels and channels instead of the whole feature map. Non-local distillation enables students to learn not only the information of an individual pixel but also the relation between different pixels captured by the non-local modules. Experiments on 9 kinds of models including two-stage, one-stage, anchor-free and anchor-based models have been provided to evaluate our methods. ", + "bbox": [ + 174, + 352, + 825, + 463 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Besides, we have also given a study on the relation between students and teachers in object detection. Our experiments show that there is a strong positive correlation between the AP of teachers and students. A high AP teacher detector plays an essential role in knowledge distillation. This observation is much different from the previous conclusion in image classification, where a teacher model with very high accuracy may harm the performance of knowledge distillation. We hope that our result may call for more rethinking works on knowledge distillation in tasks except image classification. ", + "bbox": [ + 174, + 472, + 825, + 555 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "7 ACKNOWLEDGEMENT ", + "text_level": 1, + "bbox": [ + 176, + 575, + 388, + 590 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "This work was partially supported by Institute for interdisciplinary Information Core Technology. ", + "bbox": [ + 169, + 606, + 808, + 621 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 641, + 287, + 656 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Sungsoo Ahn, Shell Xu Hu, Andreas Damianou, Neil D Lawrence, and Zhenwen Dai. Variational information distillation for knowledge transfer. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 9163–9171, 2019. ", + "bbox": [ + 176, + 664, + 823, + 707 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Mohammad Farhadi Bajestani and Yezhou Yang. Tkd: Temporal knowledge distillation for active perception. In The IEEE Winter Conference on Applications of Computer Vision, pp. 953–962, 2020. ", + "bbox": [ + 176, + 714, + 823, + 757 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Cristian Bucilua, Rich Caruana, and Alexandru Niculescu-Mizil. Model compression. In ˇ Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 535–541. ACM, 2006. ", + "bbox": [ + 174, + 765, + 823, + 808 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Zhaowei Cai and Nuno Vasconcelos. Cascade r-cnn: High quality object detection and instance segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1–1, 2019. ISSN 1939-3539. doi: 10.1109/tpami.2019.2956516. URL http://dx.doi.org/10.1109/ tpami.2019.2956516. ", + "bbox": [ + 174, + 816, + 825, + 872 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Guobin Chen, Wongun Choi, Xiang Yu, Tony Han, and Manmohan Chandraker. Learning efficient object detection models with knowledge distillation. In Advances in Neural Information Processing Systems, pp. 742–751, 2017. ", + "bbox": [ + 174, + 882, + 823, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Kai Chen, Jiaqi Wang, Jiangmiao Pang, Yuhang Cao, Yu Xiong, Xiaoxiao Li, Shuyang Sun, Wansen Feng, Ziwei Liu, Jiarui Xu, et al. Mmdetection: Open mmlab detection toolbox and benchmark. arXiv preprint arXiv:1906.07155, 2019. ", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jang Hyun Cho and Bharath Hariharan. On the efficacy of knowledge distillation. In The IEEE International Conference on Computer Vision (ICCV), October 2019. ", + "bbox": [ + 169, + 156, + 823, + 185 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale hierarchical image database. In CVPR, pp. 248–255, 2009. ", + "bbox": [ + 173, + 195, + 821, + 226 + ], + "page_idx": 9 + }, + { + "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, 2018. ", + "bbox": [ + 173, + 234, + 823, + 263 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jonathan Frankle and Michael Carbin. The lottery ticket hypothesis: Finding sparse, trainable neural networks. arXiv preprint arXiv:1803.03635, 2018. ", + "bbox": [ + 173, + 273, + 823, + 303 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Shiming Ge, Shengwei Zhao, Chenyu Li, and Jia Li. Low-resolution face recognition in the wild via selective knowledge distillation. IEEE Transactions on Image Processing, 28(4):2051–2062, 2018. ", + "bbox": [ + 176, + 313, + 823, + 356 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Song Han, Huizi Mao, and William J Dally. Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding. In ICLR, 2016. ", + "bbox": [ + 171, + 366, + 823, + 395 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In CVPR, pp. 770–778, 2016. ", + "bbox": [ + 173, + 405, + 821, + 435 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Kaiming He, Georgia Gkioxari, Piotr Dollar, and Ross Girshick. Mask r-cnn. 2017 IEEE International Conference on Computer Vision (ICCV), Oct 2017. ", + "bbox": [ + 173, + 444, + 821, + 474 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Byeongho Heo, Jeesoo Kim, Sangdoo Yun, Hyojin Park, Nojun Kwak, and Jin Young Choi. A comprehensive overhaul of feature distillation. In Proceedings of the IEEE International Conference on Computer Vision, pp. 1921–1930, 2019. ", + "bbox": [ + 173, + 483, + 823, + 526 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. In NeurIPS, 2014. ", + "bbox": [ + 173, + 536, + 823, + 566 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yuenan Hou, Zheng Ma, Chunxiao Liu, and Chen Change Loy. Learning lightweight lane detection cnns by self attention distillation. In Proceedings of the IEEE International Conference on Computer Vision, pp. 1013–1021, 2019. ", + "bbox": [ + 174, + 575, + 820, + 619 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Andrew Howard, Mark Sandler, Grace Chu, Liang-Chieh Chen, Bo Chen, Mingxing Tan, Weijun Wang, Yukun Zhu, Ruoming Pang, Vijay Vasudevan, et al. Searching for mobilenetv3. arXiv preprint arXiv:1905.02244, 2019. ", + "bbox": [ + 174, + 628, + 823, + 672 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Han Hu, Jiayuan Gu, Zheng Zhang, Jifeng Dai, and Yichen Wei. Relation networks for object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3588–3597, 2018. ", + "bbox": [ + 173, + 683, + 825, + 726 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Forrest N Iandola, Song Han, Matthew W Moskewicz, Khalid Ashraf, William J Dally, and Kurt Keutzer. Squeezenet: Alexnet-level accuracy with 50x fewer parameters and¡ $0 . 5 \\mathrm { m b }$ model size. In ICLR, 2016. ", + "bbox": [ + 173, + 736, + 826, + 779 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Quanquan Li, Shengying Jin, and Junjie Yan. Mimicking very efficient network for object detection. In Proceedings of the ieee conference on computer vision and pattern recognition, pp. 6356–6364, 2017. ", + "bbox": [ + 173, + 787, + 823, + 832 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ´ European conference on computer vision, pp. 740–755. Springer, 2014. ", + "bbox": [ + 176, + 842, + 823, + 886 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Tsung-Yi Lin, Priya Goyal, Ross Girshick, Kaiming He, and Piotr Dollar. Focal loss for dense object ´ detection. In Proceedings of the IEEE international conference on computer vision, 2017. ", + "bbox": [ + 173, + 895, + 821, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Yifan Liu, Ke Chen, Chris Liu, Zengchang Qin, Zhenbo Luo, and Jingdong Wang. Structured knowledge distillation for semantic segmentation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2604–2613, 2019. ", + "bbox": [ + 176, + 103, + 821, + 146 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Zhuang Liu, Mingjie Sun, Tinghui Zhou, Gao Huang, and Trevor Darrell. Rethinking the value of network pruning. arXiv preprint arXiv:1810.05270, 2018. ", + "bbox": [ + 171, + 155, + 823, + 184 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Xin Lu, Buyu Li, Yuxin Yue, Quanquan Li, and Junjie Yan. Grid r-cnn. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019. ", + "bbox": [ + 173, + 193, + 825, + 223 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Ningning Ma, Xiangyu Zhang, Hai-Tao Zheng, and Jian Sun. Shufflenet v2: Practical guidelines for efficient cnn architecture design. In Proceedings of the European Conference on Computer Vision (ECCV), pp. 116–131, 2018. ", + "bbox": [ + 174, + 231, + 823, + 275 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Seyed-Iman Mirzadeh, Mehrdad Farajtabar, Ang Li, and Hassan Ghasemzadeh. Improved knowledge distillation via teacher assistant: Bridging the gap between student and teacher. arXiv preprint arXiv:1902.03393, 2019. ", + "bbox": [ + 173, + 284, + 826, + 327 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Hossein Mobahi, Mehrdad Farajtabar, and Peter L Bartlett. Self-distillation amplifies regularization in hilbert space. arXiv preprint arXiv:2002.05715, 2020. ", + "bbox": [ + 171, + 335, + 823, + 366 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Markus Nagel, Mart van Baalen, Tijmen Blankevoort, and Max Welling. Data-free quantization through weight equalization and bias correction. In The IEEE International Conference on Computer Vision (ICCV), October 2019. ", + "bbox": [ + 173, + 373, + 826, + 416 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Wonpyo Park, Dongju Kim, Yan Lu, and Minsu Cho. Relational knowledge distillation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3967–3976, 2019. ", + "bbox": [ + 176, + 426, + 823, + 468 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. Pytorch: An imperative style, high-performance deep learning library. In NeurIPS, pp. 8024–8035. 2019. ", + "bbox": [ + 174, + 478, + 826, + 549 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Shaoqing Ren, Kaiming He, Ross Girshick, and Jian Sun. Faster r-cnn: Towards real-time object detection with region proposal networks. In Advances in neural information processing systems, pp. 91–99, 2015. ", + "bbox": [ + 174, + 558, + 825, + 602 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Adriana Romero, Nicolas Ballas, Samira Ebrahimi Kahou, Antoine Chassang, Carlo Gatta, and Yoshua Bengio. Fitnets: Hints for thin deep nets. In ICLR, 2015. ", + "bbox": [ + 174, + 609, + 823, + 640 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedical image segmentation. In International Conference on Medical image computing and computerassisted intervention, pp. 234–241. Springer, 2015. ", + "bbox": [ + 173, + 647, + 826, + 691 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Mark Sandler, Andrew Howard, Menglong Zhu, Andrey Zhmoginov, and Liang-Chieh Chen. Mobilenetv2: Inverted residuals and linear bottlenecks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4510–4520, 2018. ", + "bbox": [ + 174, + 700, + 823, + 744 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf. Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter. arXiv preprint arXiv:1910.01108, 2019. ", + "bbox": [ + 171, + 752, + 823, + 782 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Frederick Tung and Greg Mori. Similarity-preserving knowledge distillation. In Proceedings of the IEEE International Conference on Computer Vision, pp. 1365–1374, 2019. ", + "bbox": [ + 169, + 791, + 823, + 820 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Tao Wang, Li Yuan, Xiaopeng Zhang, and Jiashi Feng. Distilling object detectors with fine-grained feature imitation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4933–4942, 2019. ", + "bbox": [ + 173, + 829, + 823, + 872 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaiming He. Non-local neural networks. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 7794–7803, 2018. ", + "bbox": [ + 174, + 881, + 825, + 922 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Canwen Xu, Wangchunshu Zhou, Tao Ge, Furu Wei, and Ming Zhou. Bert-of-theseus: Compressing bert by progressive module replacing. arXiv preprint arXiv:2002.02925, 2020. ", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Ze Yang, Shaohui Liu, Han Hu, Liwei Wang, and Stephen Lin. Reppoints: Point set representation for object detection. In The IEEE International Conference on Computer Vision (ICCV), Oct 2019. ", + "bbox": [ + 174, + 142, + 823, + 185 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Junho Yim, Donggyu Joo, Jihoon Bae, and Junmo Kim. A gift from knowledge distillation: Fast optimization, network minimization and transfer learning. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4133–4141, 2017. ", + "bbox": [ + 176, + 195, + 823, + 239 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Li Yuan, Francis EH Tay, Guilin Li, Tao Wang, and Jiashi Feng. Revisit knowledge distillation: a teacher-free framework. arXiv preprint arXiv:1909.11723, 2019. ", + "bbox": [ + 173, + 250, + 825, + 279 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Sergey Zagoruyko and Nikos Komodakis. Paying more attention to attention: Improving the performance of convolutional neural networks via attention transfer. In ICLR, 2017. ", + "bbox": [ + 171, + 289, + 821, + 318 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Hongkai Zhang, Hong Chang, Bingpeng Ma, Naiyan Wang, and Xilin Chen. Dynamic R-CNN: Towards high quality object detection via dynamic training. arXiv preprint arXiv:2004.06002, 2020a. ", + "bbox": [ + 176, + 328, + 823, + 371 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Linfeng Zhang, Jiebo Song, Anni Gao, Jingwei Chen, Chenglong Bao, and Kaisheng Ma. Be your own teacher: Improve the performance of convolutional neural networks via self distillation. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), October 2019a. ", + "bbox": [ + 173, + 381, + 826, + 438 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Linfeng Zhang, Zhanhong Tan, Jiebo Song, Jingwei Chen, Chenglong Bao, and Kaisheng Ma. Scan: A scalable neural networks framework towards compact and efficient models. In Advances in Neural Information Processing Systems 32, pp. 4027–4036. Curran Associates, Inc., 2019b. ", + "bbox": [ + 173, + 449, + 825, + 492 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Linfeng Zhang, Muzhou Yu, Tong Chen, Zuoqiang Shi, Chenglong Bao, and Kaisheng Ma. Auxiliary training: Towards accurate and robust models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 372–381, 2020b. ", + "bbox": [ + 174, + 502, + 823, + 546 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Tianyun Zhang, Shaokai Ye, Kaiqi Zhang, Jian Tang, Wujie Wen, Makan Fardad, and Yanzhi Wang. A systematic dnn weight pruning framework using alternating direction method of multipliers. In The European Conference on Computer Vision (ECCV), September 2018. ", + "bbox": [ + 176, + 555, + 821, + 598 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Aojun Zhou, Anbang Yao, Yiwen Guo, Lin Xu, and Yurong Chen. Incremental network quantization: Towards lossless cnns with low-precision weights. arXiv preprint arXiv:1702.03044, 2017. ", + "bbox": [ + 173, + 609, + 820, + 638 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Bolei Zhou, Aditya Khosla, Agata Lapedriza, Aude Oliva, and Antonio Torralba. Learning deep features for discriminative localization. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2016. ", + "bbox": [ + 173, + 648, + 825, + 691 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Chenchen Zhu, Yihui He, and Marios Savvides. Feature selective anchor-free module for singleshot object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 840–849, 2019. ", + "bbox": [ + 178, + 702, + 821, + 744 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "A ABLATION STUDY ON THE SPATIAL AND CHANNEL ATTENTION ", + "text_level": 1, + "bbox": [ + 178, + 772, + 736, + 789 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Different from previous attention-based knowledge distillation methods, the attention-guided distillation in our methods uses not only spatial attention but also the channel attention. In this appendix, we have conducted an ablation study on the two kinds of attention with Faster RCNN (ResNet50) on MS COCO2017 to show their individual effectiveness. ", + "bbox": [ + 174, + 804, + 823, + 861 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "It is observed that spatial attention and channel attention lead to 2.6 and 2.3 AP improvements, respectively. In contrast, the combination of the two kinds of attention leads to $2 . 8 \\mathrm { \\ A P }$ improvements. These results indicate that both spatial and channel attention have their individual effectiveness and they can be utilized together to achieve better performance. ", + "bbox": [ + 176, + 867, + 825, + 924 + ], + "page_idx": 11 + }, + { + "type": "table", + "img_path": "images/7acabf4b09c5067978bf878ed570b27b0ff5b9beb113ef61cc5a34e3f1e6fec6.jpg", + "table_caption": [ + "Table 6: Ablation study on the spatial attention and channel attention. " + ], + "table_footnote": [], + "table_body": "
Attention TypeSpatial Channel× ×√ ×X √√ √
ResultAP38.441.040.741.2
APs21.522.722.923.0
APM42.144.744.144.6
APL50.354.254.155.3
", + "bbox": [ + 313, + 132, + 684, + 232 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "B ADAPTATION LAYERS IN KNOWLEDGE DISTILLATION ", + "text_level": 1, + "bbox": [ + 173, + 263, + 655, + 280 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "The adaptation layers in knowledge distillation are first proposed by Romero et al. (2015) to adjust the feature size of students and teachers. Then, recent research finds that the adaptation layers play an important role in improving the performance of students (Chen et al., 2017). In this paper, we adopt different kinds of adaptation layers for different distillation loss. Concretely, We adopt 1x1 convolutional layers for $\\mathcal { L } _ { A M }$ and $\\mathcal { L } _ { N L D }$ , $3 { \\tt X } 3$ convolutional layers for $\\mathcal { L } _ { A T } ^ { s p a t i a l }$ , and fully connected layers for don’t intr $\\mathcal { L } _ { A T } ^ { c h a n n e l }$ . Note that the adaptation layers are only utilized in the training period and theyitional computation and parameters. ", + "bbox": [ + 173, + 296, + 825, + 398 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "C EXPERIMENTS ON SMALLER BACKBONES ", + "text_level": 1, + "bbox": [ + 174, + 421, + 557, + 438 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "According to the insightful comments of the reviewers, we conduct a series of experiments on models with small backbones including ResNet18 and RegNet-800M, and compact detectors including Yolo v3 and SSD. As shown in Table 7, our methods also achieve significant AP improvements on these compact models. Note that more experiments with small backbones will be added in the camera ready version. ", + "bbox": [ + 174, + 454, + 825, + 525 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/caa8e517e6577264cea211b227c692d7b1e87f2d1f6bf744efed0323e02c83ba.jpg", + "table_caption": [ + "Table 7: Experiments on MS COCO2017 with our method on small backbones. " + ], + "table_footnote": [], + "table_body": "
ModelBackboneAPAP50AP75APsAPMAPLFPS Params
Faster RCNN Our Faster RCNNResNet18 ResNet1834.6 37.055.0 57.237.1 39.719.3 19.936.9 39.745.9 50.328.1 28.130.57 30.57
Grid RCNNResNet1836.654.239.720.139.848.226.766.37
Our Grid RCNN RetinaNetResNet18 ResNet1838.8 33.456.7 51.841.5 35.121.1 16.941.6 35.652.7 44.926.7 25.866.37 23.30
Our RetinaNet RetinaNetResNet18 RegNet-800M35.9 35.654.4 54.738.0 37.717.9 19.739.1 39.049.4 47.825.8 22.423.30 19.27
Our RetinaNet Yolo v3RegNet-800M DarkNet5338.4 33.457.4 56.340.7 35.221.4 19.542.0 36.452.3 43.622.4 42.219.27 61.95
Our Yolo v3DarkNet5335.858.238.121.239.045.642.261.95
SSD Our SSDVGG16 VGG1629.4 31.249.3 52.131.0 32.811.7 12.634.1 37.444.9 46.226.1 26.138.08 38.08
", + "bbox": [ + 171, + 575, + 839, + 803 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "D EXPERIMENTS ON CITYSCAPES ", + "text_level": 1, + "bbox": [ + 176, + 848, + 470, + 864 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "According to the insightful comments of the reviewers, as shown in Table 8, we conduct a series of experiments to show the effectiveness of our method on Cityscapes. Note that more experiments on Cityscapes will be added in the camera ready version. ", + "bbox": [ + 176, + 882, + 825, + 924 + ], + "page_idx": 12 + }, + { + "type": "table", + "img_path": "images/62f91122962eb7235738d42fed3116b6f3512c68a10d204eff8b1c8af33a6a5c.jpg", + "table_caption": [ + "Table 8: Experiments on Cityscapes with our method. " + ], + "table_footnote": [], + "table_body": "
ModelBackboneBox APMask AP
Faster RCNNResNet5040.3N/A
Our Faster RCNNResNet5043.5N/A
Mask RCNNResNet5041.035.8
Our Mask RCNNResNet5043.037.5
", + "bbox": [ + 323, + 127, + 673, + 218 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "E COMPARISION WITH RELATED WORK ", + "text_level": 1, + "bbox": [ + 173, + 247, + 521, + 263 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Comparison on Methodology and Application. Feature distillation is utilized in all the five methods. However, Chen et al. distill not only the feature, but also the classification logits and bounding box regression results, which has limited their application scenes in one stage and anchor-free models. Li et al. and Wang et al. distill the features in the regions of proposals and near object anchor locations, respectively. As a result, their methods reply on the supervision of anchors and groundtruths and can’t be utilized in one stage and anchor free models. Bajestani & Yang is utilized for active perception on video, which can not be utilized in image-based detection. In contrast, in our method, the attention mask and relation information can be easily generated from the backbone features, which has no requirements on groundtruths, anchors and proposals. As a result, it can be easily used in different kinds of models and tasks without any modification. ", + "bbox": [ + 173, + 279, + 825, + 419 + ], + "page_idx": 13 + }, + { + "type": "table", + "img_path": "images/6fc76be632e1640c9a39ace20db765e9a86649e80610ea40f3b40adeb382e85c.jpg", + "table_caption": [ + "Table 9: Comparision on methodology and application. " + ], + "table_footnote": [], + "table_body": "
MethodFeature Classfy Regress Relation|One-Stage Two-Stage Anchor-based Anchor-free Segment.
Our Method×√√√√
Chen et al.××√广××
Li et al.××××√1××
Wang et al.>>>>××××√√××
Bajestani & Yang√×××√√√××
", + "bbox": [ + 173, + 468, + 825, + 568 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Comparison on Motivation. Chen et al.’s method is a direct application of knowledge distillation on object detection. The other three methods and our method are motivated by the imbalance between foreground and background piexles and these methods try to address this issue by reweighting the distillation loss. Besides, our method is also motivated by the effect of the relation among pixels in an image, which is ignored by the other methods. ", + "bbox": [ + 173, + 588, + 825, + 659 + ], + "page_idx": 13 + } +] \ No newline at end of file diff --git a/parse/train/uKhGRvM8QNH/uKhGRvM8QNH_middle.json b/parse/train/uKhGRvM8QNH/uKhGRvM8QNH_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..21e20b5e83abf7d54dee57f1e763c6e0fbc2b3e9 --- /dev/null +++ b/parse/train/uKhGRvM8QNH/uKhGRvM8QNH_middle.json @@ -0,0 +1,33113 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 78, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 506, + 97 + ], + "score": 1.0, + "content": "IMPROVE OBJECT DETECTION WITH FEATURE-BASED", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 98, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 98, + 506, + 117 + ], + "score": 1.0, + "content": "KNOWLEDGE DISTILLATION: TOWARDS ACCURATE", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 119, + 317, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 119, + 317, + 137 + ], + "score": 1.0, + "content": "AND EFFICIENT DETECTORS", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 113, + 155, + 279, + 189 + ], + "lines": [ + { + "bbox": [ + 111, + 154, + 179, + 168 + ], + "spans": [ + { + "bbox": [ + 111, + 154, + 179, + 168 + ], + "score": 1.0, + "content": "Linfeng Zhang", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 111, + 165, + 280, + 178 + ], + "spans": [ + { + "bbox": [ + 111, + 165, + 280, + 178 + ], + "score": 1.0, + "content": "Institute for Interdisciplinary Information", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 112, + 177, + 236, + 190 + ], + "spans": [ + { + "bbox": [ + 112, + 177, + 236, + 190 + ], + "score": 1.0, + "content": "Sciences, Tsinghua University", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 311, + 155, + 478, + 189 + ], + "lines": [ + { + "bbox": [ + 310, + 154, + 377, + 168 + ], + "spans": [ + { + "bbox": [ + 310, + 154, + 377, + 168 + ], + "score": 1.0, + "content": "Kaisheng Ma ∗", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 309, + 165, + 478, + 178 + ], + "spans": [ + { + "bbox": [ + 309, + 165, + 478, + 178 + ], + "score": 1.0, + "content": "Institute for Interdisciplinary Information", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 310, + 176, + 434, + 190 + ], + "spans": [ + { + "bbox": [ + 310, + 176, + 434, + 190 + ], + "score": 1.0, + "content": "Sciences, Tsinghua University", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7 + }, + { + "type": "title", + "bbox": [ + 277, + 217, + 333, + 229 + ], + "lines": [ + { + "bbox": [ + 276, + 217, + 335, + 230 + ], + "spans": [ + { + "bbox": [ + 276, + 217, + 335, + 230 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 142, + 241, + 468, + 438 + ], + "lines": [ + { + "bbox": [ + 142, + 241, + 469, + 252 + ], + "spans": [ + { + "bbox": [ + 142, + 241, + 469, + 252 + ], + "score": 1.0, + "content": "Knowledge distillation, in which a student model is trained to mimic a teacher", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 252, + 469, + 264 + ], + "spans": [ + { + "bbox": [ + 141, + 252, + 469, + 264 + ], + "score": 1.0, + "content": "model, has been proved as an effective technique for model compression and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 262, + 470, + 276 + ], + "spans": [ + { + "bbox": [ + 141, + 262, + 470, + 276 + ], + "score": 1.0, + "content": "model accuracy boosting. However, most knowledge distillation methods, de-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 273, + 469, + 285 + ], + "spans": [ + { + "bbox": [ + 141, + 273, + 469, + 285 + ], + "score": 1.0, + "content": "signed for image classification, have failed on more challenging tasks, such as ob-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 285, + 469, + 297 + ], + "spans": [ + { + "bbox": [ + 141, + 285, + 469, + 297 + ], + "score": 1.0, + "content": "ject detection. In this paper, we suggest that the failure of knowledge distillation", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 296, + 469, + 308 + ], + "spans": [ + { + "bbox": [ + 141, + 296, + 469, + 308 + ], + "score": 1.0, + "content": "on object detection is mainly caused by two reasons: (1) the imbalance between", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 307, + 469, + 318 + ], + "spans": [ + { + "bbox": [ + 141, + 307, + 469, + 318 + ], + "score": 1.0, + "content": "pixels of foreground and background and (2) lack of distillation on the relation be-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 317, + 470, + 331 + ], + "spans": [ + { + "bbox": [ + 141, + 317, + 470, + 331 + ], + "score": 1.0, + "content": "tween different pixels. Observing the above reasons, we propose attention-guided", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 327, + 469, + 341 + ], + "spans": [ + { + "bbox": [ + 141, + 327, + 469, + 341 + ], + "score": 1.0, + "content": "distillation and non-local distillation to address the two problems, respectively.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 339, + 469, + 352 + ], + "spans": [ + { + "bbox": [ + 141, + 339, + 469, + 352 + ], + "score": 1.0, + "content": "Attention-guided distillation is proposed to find the crucial pixels of foreground", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 351, + 470, + 362 + ], + "spans": [ + { + "bbox": [ + 141, + 351, + 470, + 362 + ], + "score": 1.0, + "content": "objects with attention mechanism and then make the students take more effort", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 142, + 362, + 469, + 372 + ], + "spans": [ + { + "bbox": [ + 142, + 362, + 469, + 372 + ], + "score": 1.0, + "content": "to learn their features. Non-local distillation is proposed to enable students to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 372, + 470, + 384 + ], + "spans": [ + { + "bbox": [ + 141, + 372, + 470, + 384 + ], + "score": 1.0, + "content": "learn not only the feature of an individual pixel but also the relation between dif-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 383, + 469, + 395 + ], + "spans": [ + { + "bbox": [ + 141, + 383, + 469, + 395 + ], + "score": 1.0, + "content": "ferent pixels captured by non-local modules. Experiments show that our meth-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 394, + 470, + 407 + ], + "spans": [ + { + "bbox": [ + 141, + 394, + 470, + 407 + ], + "score": 1.0, + "content": "ods achieve excellent AP improvements on both one-stage and two-stage, both", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 405, + 469, + 417 + ], + "spans": [ + { + "bbox": [ + 141, + 405, + 469, + 417 + ], + "score": 1.0, + "content": "anchor-based and anchor-free detectors. For example, Faster RCNN (ResNet101", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 142, + 416, + 469, + 427 + ], + "spans": [ + { + "bbox": [ + 142, + 416, + 469, + 427 + ], + "score": 1.0, + "content": "backbone) with our distillation achieves 43.9 AP on COCO2017, which is 4.1", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 427, + 397, + 438 + ], + "spans": [ + { + "bbox": [ + 141, + 427, + 397, + 438 + ], + "score": 1.0, + "content": "higher than the baseline. Codes have been released on Github†.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 108, + 456, + 206, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 454, + 208, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 208, + 471 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 474, + 330, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 331, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 331, + 486 + ], + "score": 1.0, + "content": "Recently, excellent breakthrough in various domains has", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 485, + 330, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 330, + 497 + ], + "score": 1.0, + "content": "been achieved with the success of deep learning (Ron-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 495, + 330, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 330, + 509 + ], + "score": 1.0, + "content": "neberger et al., 2015; Devlin et al., 2018; Ren et al.,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 506, + 331, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 331, + 519 + ], + "score": 1.0, + "content": "2015). However, the most advanced deep neural net-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 518, + 331, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 331, + 531 + ], + "score": 1.0, + "content": "works always consume a large amount of computa-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 529, + 331, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 331, + 541 + ], + "score": 1.0, + "content": "tion and memory, which has limited their deployment", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 540, + 331, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 331, + 552 + ], + "score": 1.0, + "content": "in edge devices such as self-driving cars and mobile", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 551, + 331, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 331, + 563 + ], + "score": 1.0, + "content": "phones. To address this problem, abundant techniques", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 562, + 331, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 331, + 574 + ], + "score": 1.0, + "content": "are proposed, including pruning (Han et al., 2016;", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 573, + 331, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 331, + 585 + ], + "score": 1.0, + "content": "Zhang et al., 2018; Liu et al., 2018; Frankle & Carbin,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 583, + 331, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 331, + 597 + ], + "score": 1.0, + "content": "2018), quantization (Nagel et al., 2019; Zhou et al.,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 594, + 331, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 331, + 607 + ], + "score": 1.0, + "content": "2017), compact model design (Sandler et al., 2018;", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 605, + 331, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 331, + 617 + ], + "score": 1.0, + "content": "Howard et al., 2019; Ma et al., 2018; Iandola et al.,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 616, + 330, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 330, + 628 + ], + "score": 1.0, + "content": "2016) and knowledge distillation (Hinton et al., 2014;", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 627, + 330, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 330, + 640 + ], + "score": 1.0, + "content": "Bucilua et al., 2006). Knowledge distillation, which is ˇ", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 639, + 330, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 330, + 650 + ], + "score": 1.0, + "content": "also known as teacher-student learning, aims to trans-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 649, + 331, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 331, + 661 + ], + "score": 1.0, + "content": "fer the knowledge of an over-parameterized teacher to a", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 37 + }, + { + "type": "image", + "bbox": [ + 340, + 486, + 503, + 644 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 340, + 486, + 503, + 644 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 340, + 486, + 503, + 644 + ], + "spans": [ + { + "bbox": [ + 340, + 486, + 503, + 644 + ], + "score": 0.964, + "type": "image", + "image_path": "ab781c0c9e775df09707b0c93a6aab5e53ce6655c2fbadbcea02d8a117d9474d.jpg" + } + ] + } + ], + "index": 52, + "virtual_lines": [ + { + "bbox": [ + 340, + 486, + 503, + 498.15384615384613 + ], + "spans": [], + "index": 46 + }, + { + "bbox": [ + 340, + 498.15384615384613, + 503, + 510.30769230769226 + ], + "spans": [], + "index": 47 + }, + { + "bbox": [ + 340, + 510.30769230769226, + 503, + 522.4615384615385 + ], + "spans": [], + "index": 48 + }, + { + "bbox": [ + 340, + 522.4615384615385, + 503, + 534.6153846153846 + ], + "spans": [], + "index": 49 + }, + { + "bbox": [ + 340, + 534.6153846153846, + 503, + 546.7692307692308 + ], + "spans": [], + "index": 50 + }, + { + "bbox": [ + 340, + 546.7692307692308, + 503, + 558.923076923077 + ], + "spans": [], + "index": 51 + }, + { + "bbox": [ + 340, + 558.923076923077, + 503, + 571.0769230769232 + ], + "spans": [], + "index": 52 + }, + { + "bbox": [ + 340, + 571.0769230769232, + 503, + 583.2307692307694 + ], + "spans": [], + "index": 53 + }, + { + "bbox": [ + 340, + 583.2307692307694, + 503, + 595.3846153846156 + ], + "spans": [], + "index": 54 + }, + { + "bbox": [ + 340, + 595.3846153846156, + 503, + 607.5384615384618 + ], + "spans": [], + "index": 55 + }, + { + "bbox": [ + 340, + 607.5384615384618, + 503, + 619.692307692308 + ], + "spans": [], + "index": 56 + }, + { + "bbox": [ + 340, + 619.692307692308, + 503, + 631.8461538461542 + ], + "spans": [], + "index": 57 + }, + { + "bbox": [ + 340, + 631.8461538461542, + 503, + 644.0000000000003 + ], + "spans": [], + "index": 58 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 364, + 646, + 478, + 657 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 363, + 645, + 478, + 658 + ], + "spans": [ + { + "bbox": [ + 363, + 645, + 478, + 658 + ], + "score": 1.0, + "content": "Figure 1: Results overview.", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 59 + } + ], + "index": 55.5 + }, + { + "type": "text", + "bbox": [ + 108, + 661, + 505, + 704 + ], + "lines": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "lightweight student. Since the student is trained to mimic the logits or features of the teacher, the", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 671, + 504, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 504, + 683 + ], + "score": 1.0, + "content": "student can inherit the dark knowledge from the teacher, and thus often achieves much higher accu-", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 105, + 682, + 505, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 505, + 696 + ], + "score": 1.0, + "content": "racy. Due to its simplicity and effectiveness, knowledge distillation has become a popular technique", + "type": "text" + } + ], + "index": 62 + }, + { + "bbox": [ + 105, + 692, + 342, + 708 + ], + "spans": [ + { + "bbox": [ + 105, + 692, + 342, + 708 + ], + "score": 1.0, + "content": "for both model compression and model accuracy boosting.", + "type": "text" + } + ], + "index": 63 + } + ], + "index": 61.5 + } + ], + "page_idx": 0, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 117, + 711, + 478, + 732 + ], + "lines": [ + { + "bbox": [ + 118, + 708, + 204, + 722 + ], + "spans": [ + { + "bbox": [ + 118, + 708, + 204, + 722 + ], + "score": 1.0, + "content": "∗Corresponding author", + "type": "text" + } + ] + }, + { + "bbox": [ + 118, + 719, + 479, + 733 + ], + "spans": [ + { + "bbox": [ + 118, + 719, + 479, + 733 + ], + "score": 1.0, + "content": "†https://github.com/ArchipLab-LinfengZhang/Object-Detection-Knowledge-Distillation-ICLR2021", + "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, + 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, + 78, + 504, + 136 + ], + "lines": [ + { + "bbox": [ + 105, + 77, + 506, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 77, + 506, + 97 + ], + "score": 1.0, + "content": "IMPROVE OBJECT DETECTION WITH FEATURE-BASED", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 98, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 98, + 506, + 117 + ], + "score": 1.0, + "content": "KNOWLEDGE DISTILLATION: TOWARDS ACCURATE", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 119, + 317, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 119, + 317, + 137 + ], + "score": 1.0, + "content": "AND EFFICIENT DETECTORS", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 113, + 155, + 279, + 189 + ], + "lines": [ + { + "bbox": [ + 111, + 154, + 179, + 168 + ], + "spans": [ + { + "bbox": [ + 111, + 154, + 179, + 168 + ], + "score": 1.0, + "content": "Linfeng Zhang", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 111, + 165, + 280, + 178 + ], + "spans": [ + { + "bbox": [ + 111, + 165, + 280, + 178 + ], + "score": 1.0, + "content": "Institute for Interdisciplinary Information", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 112, + 177, + 236, + 190 + ], + "spans": [ + { + "bbox": [ + 112, + 177, + 236, + 190 + ], + "score": 1.0, + "content": "Sciences, Tsinghua University", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 111, + 154, + 280, + 190 + ] + }, + { + "type": "text", + "bbox": [ + 311, + 155, + 478, + 189 + ], + "lines": [ + { + "bbox": [ + 310, + 154, + 377, + 168 + ], + "spans": [ + { + "bbox": [ + 310, + 154, + 377, + 168 + ], + "score": 1.0, + "content": "Kaisheng Ma ∗", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 309, + 165, + 478, + 178 + ], + "spans": [ + { + "bbox": [ + 309, + 165, + 478, + 178 + ], + "score": 1.0, + "content": "Institute for Interdisciplinary Information", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 310, + 176, + 434, + 190 + ], + "spans": [ + { + "bbox": [ + 310, + 176, + 434, + 190 + ], + "score": 1.0, + "content": "Sciences, Tsinghua University", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7, + "bbox_fs": [ + 309, + 154, + 478, + 190 + ] + }, + { + "type": "title", + "bbox": [ + 277, + 217, + 333, + 229 + ], + "lines": [ + { + "bbox": [ + 276, + 217, + 335, + 230 + ], + "spans": [ + { + "bbox": [ + 276, + 217, + 335, + 230 + ], + "score": 1.0, + "content": "ABSTRACT", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 142, + 241, + 468, + 438 + ], + "lines": [ + { + "bbox": [ + 142, + 241, + 469, + 252 + ], + "spans": [ + { + "bbox": [ + 142, + 241, + 469, + 252 + ], + "score": 1.0, + "content": "Knowledge distillation, in which a student model is trained to mimic a teacher", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 252, + 469, + 264 + ], + "spans": [ + { + "bbox": [ + 141, + 252, + 469, + 264 + ], + "score": 1.0, + "content": "model, has been proved as an effective technique for model compression and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 262, + 470, + 276 + ], + "spans": [ + { + "bbox": [ + 141, + 262, + 470, + 276 + ], + "score": 1.0, + "content": "model accuracy boosting. However, most knowledge distillation methods, de-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 273, + 469, + 285 + ], + "spans": [ + { + "bbox": [ + 141, + 273, + 469, + 285 + ], + "score": 1.0, + "content": "signed for image classification, have failed on more challenging tasks, such as ob-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 141, + 285, + 469, + 297 + ], + "spans": [ + { + "bbox": [ + 141, + 285, + 469, + 297 + ], + "score": 1.0, + "content": "ject detection. In this paper, we suggest that the failure of knowledge distillation", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 296, + 469, + 308 + ], + "spans": [ + { + "bbox": [ + 141, + 296, + 469, + 308 + ], + "score": 1.0, + "content": "on object detection is mainly caused by two reasons: (1) the imbalance between", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 141, + 307, + 469, + 318 + ], + "spans": [ + { + "bbox": [ + 141, + 307, + 469, + 318 + ], + "score": 1.0, + "content": "pixels of foreground and background and (2) lack of distillation on the relation be-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 141, + 317, + 470, + 331 + ], + "spans": [ + { + "bbox": [ + 141, + 317, + 470, + 331 + ], + "score": 1.0, + "content": "tween different pixels. Observing the above reasons, we propose attention-guided", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 141, + 327, + 469, + 341 + ], + "spans": [ + { + "bbox": [ + 141, + 327, + 469, + 341 + ], + "score": 1.0, + "content": "distillation and non-local distillation to address the two problems, respectively.", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 141, + 339, + 469, + 352 + ], + "spans": [ + { + "bbox": [ + 141, + 339, + 469, + 352 + ], + "score": 1.0, + "content": "Attention-guided distillation is proposed to find the crucial pixels of foreground", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 141, + 351, + 470, + 362 + ], + "spans": [ + { + "bbox": [ + 141, + 351, + 470, + 362 + ], + "score": 1.0, + "content": "objects with attention mechanism and then make the students take more effort", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 142, + 362, + 469, + 372 + ], + "spans": [ + { + "bbox": [ + 142, + 362, + 469, + 372 + ], + "score": 1.0, + "content": "to learn their features. Non-local distillation is proposed to enable students to", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 141, + 372, + 470, + 384 + ], + "spans": [ + { + "bbox": [ + 141, + 372, + 470, + 384 + ], + "score": 1.0, + "content": "learn not only the feature of an individual pixel but also the relation between dif-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 141, + 383, + 469, + 395 + ], + "spans": [ + { + "bbox": [ + 141, + 383, + 469, + 395 + ], + "score": 1.0, + "content": "ferent pixels captured by non-local modules. Experiments show that our meth-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 141, + 394, + 470, + 407 + ], + "spans": [ + { + "bbox": [ + 141, + 394, + 470, + 407 + ], + "score": 1.0, + "content": "ods achieve excellent AP improvements on both one-stage and two-stage, both", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 141, + 405, + 469, + 417 + ], + "spans": [ + { + "bbox": [ + 141, + 405, + 469, + 417 + ], + "score": 1.0, + "content": "anchor-based and anchor-free detectors. For example, Faster RCNN (ResNet101", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 142, + 416, + 469, + 427 + ], + "spans": [ + { + "bbox": [ + 142, + 416, + 469, + 427 + ], + "score": 1.0, + "content": "backbone) with our distillation achieves 43.9 AP on COCO2017, which is 4.1", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 141, + 427, + 397, + 438 + ], + "spans": [ + { + "bbox": [ + 141, + 427, + 397, + 438 + ], + "score": 1.0, + "content": "higher than the baseline. Codes have been released on Github†.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 18.5, + "bbox_fs": [ + 141, + 241, + 470, + 438 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 456, + 206, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 454, + 208, + 471 + ], + "spans": [ + { + "bbox": [ + 105, + 454, + 208, + 471 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 107, + 474, + 330, + 660 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 331, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 331, + 486 + ], + "score": 1.0, + "content": "Recently, excellent breakthrough in various domains has", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 485, + 330, + 497 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 330, + 497 + ], + "score": 1.0, + "content": "been achieved with the success of deep learning (Ron-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 495, + 330, + 509 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 330, + 509 + ], + "score": 1.0, + "content": "neberger et al., 2015; Devlin et al., 2018; Ren et al.,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 506, + 331, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 506, + 331, + 519 + ], + "score": 1.0, + "content": "2015). However, the most advanced deep neural net-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 518, + 331, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 331, + 531 + ], + "score": 1.0, + "content": "works always consume a large amount of computa-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 529, + 331, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 529, + 331, + 541 + ], + "score": 1.0, + "content": "tion and memory, which has limited their deployment", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 540, + 331, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 331, + 552 + ], + "score": 1.0, + "content": "in edge devices such as self-driving cars and mobile", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 551, + 331, + 563 + ], + "spans": [ + { + "bbox": [ + 106, + 551, + 331, + 563 + ], + "score": 1.0, + "content": "phones. To address this problem, abundant techniques", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 562, + 331, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 562, + 331, + 574 + ], + "score": 1.0, + "content": "are proposed, including pruning (Han et al., 2016;", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 573, + 331, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 573, + 331, + 585 + ], + "score": 1.0, + "content": "Zhang et al., 2018; Liu et al., 2018; Frankle & Carbin,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 583, + 331, + 597 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 331, + 597 + ], + "score": 1.0, + "content": "2018), quantization (Nagel et al., 2019; Zhou et al.,", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 594, + 331, + 607 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 331, + 607 + ], + "score": 1.0, + "content": "2017), compact model design (Sandler et al., 2018;", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 605, + 331, + 617 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 331, + 617 + ], + "score": 1.0, + "content": "Howard et al., 2019; Ma et al., 2018; Iandola et al.,", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 616, + 330, + 628 + ], + "spans": [ + { + "bbox": [ + 106, + 616, + 330, + 628 + ], + "score": 1.0, + "content": "2016) and knowledge distillation (Hinton et al., 2014;", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 627, + 330, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 330, + 640 + ], + "score": 1.0, + "content": "Bucilua et al., 2006). Knowledge distillation, which is ˇ", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 639, + 330, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 639, + 330, + 650 + ], + "score": 1.0, + "content": "also known as teacher-student learning, aims to trans-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 649, + 331, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 331, + 661 + ], + "score": 1.0, + "content": "fer the knowledge of an over-parameterized teacher to a", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "lightweight student. Since the student is trained to mimic the logits or features of the teacher, the", + "type": "text" + } + ], + "index": 60 + }, + { + "bbox": [ + 106, + 671, + 504, + 683 + ], + "spans": [ + { + "bbox": [ + 106, + 671, + 504, + 683 + ], + "score": 1.0, + "content": "student can inherit the dark knowledge from the teacher, and thus often achieves much higher accu-", + "type": "text" + } + ], + "index": 61 + }, + { + "bbox": [ + 105, + 682, + 505, + 696 + ], + "spans": [ + { + "bbox": [ + 105, + 682, + 505, + 696 + ], + "score": 1.0, + "content": "racy. Due to its simplicity and effectiveness, knowledge distillation has become a popular technique", + "type": "text" + } + ], + "index": 62 + }, + { + "bbox": [ + 105, + 692, + 342, + 708 + ], + "spans": [ + { + "bbox": [ + 105, + 692, + 342, + 708 + ], + "score": 1.0, + "content": "for both model compression and model accuracy boosting.", + "type": "text" + } + ], + "index": 63 + } + ], + "index": 37, + "bbox_fs": [ + 105, + 474, + 331, + 661 + ] + }, + { + "type": "image", + "bbox": [ + 340, + 486, + 503, + 644 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 340, + 486, + 503, + 644 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 340, + 486, + 503, + 644 + ], + "spans": [ + { + "bbox": [ + 340, + 486, + 503, + 644 + ], + "score": 0.964, + "type": "image", + "image_path": "ab781c0c9e775df09707b0c93a6aab5e53ce6655c2fbadbcea02d8a117d9474d.jpg" + } + ] + } + ], + "index": 52, + "virtual_lines": [ + { + "bbox": [ + 340, + 486, + 503, + 498.15384615384613 + ], + "spans": [], + "index": 46 + }, + { + "bbox": [ + 340, + 498.15384615384613, + 503, + 510.30769230769226 + ], + "spans": [], + "index": 47 + }, + { + "bbox": [ + 340, + 510.30769230769226, + 503, + 522.4615384615385 + ], + "spans": [], + "index": 48 + }, + { + "bbox": [ + 340, + 522.4615384615385, + 503, + 534.6153846153846 + ], + "spans": [], + "index": 49 + }, + { + "bbox": [ + 340, + 534.6153846153846, + 503, + 546.7692307692308 + ], + "spans": [], + "index": 50 + }, + { + "bbox": [ + 340, + 546.7692307692308, + 503, + 558.923076923077 + ], + "spans": [], + "index": 51 + }, + { + "bbox": [ + 340, + 558.923076923077, + 503, + 571.0769230769232 + ], + "spans": [], + "index": 52 + }, + { + "bbox": [ + 340, + 571.0769230769232, + 503, + 583.2307692307694 + ], + "spans": [], + "index": 53 + }, + { + "bbox": [ + 340, + 583.2307692307694, + 503, + 595.3846153846156 + ], + "spans": [], + "index": 54 + }, + { + "bbox": [ + 340, + 595.3846153846156, + 503, + 607.5384615384618 + ], + "spans": [], + "index": 55 + }, + { + "bbox": [ + 340, + 607.5384615384618, + 503, + 619.692307692308 + ], + "spans": [], + "index": 56 + }, + { + "bbox": [ + 340, + 619.692307692308, + 503, + 631.8461538461542 + ], + "spans": [], + "index": 57 + }, + { + "bbox": [ + 340, + 631.8461538461542, + 503, + 644.0000000000003 + ], + "spans": [], + "index": 58 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 364, + 646, + 478, + 657 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 363, + 645, + 478, + 658 + ], + "spans": [ + { + "bbox": [ + 363, + 645, + 478, + 658 + ], + "score": 1.0, + "content": "Figure 1: Results overview.", + "type": "text" + } + ], + "index": 59 + } + ], + "index": 59 + } + ], + "index": 55.5 + }, + { + "type": "text", + "bbox": [ + 108, + 661, + 505, + 704 + ], + "lines": [], + "index": 61.5, + "bbox_fs": [ + 105, + 660, + 505, + 708 + ], + "lines_deleted": true + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 137 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "As one of the most crucial challenges in computer vision, object detection has an urgent requirement", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "of both accurate and efficient models. Unfortunately, most of the existing knowledge distillation", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "methods in computer vision are designed for image classification and usually leads to trivial im-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 506, + 129 + ], + "score": 1.0, + "content": "provements on object detection (Li et al., 2017). In this paper, we impute the failure of knowledge", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 501, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 501, + 140 + ], + "score": 1.0, + "content": "distillation on object detection to the following two issues, which will be solved later, respectively.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 107, + 144, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 142, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 155 + ], + "score": 1.0, + "content": "Imbalance between foreground and background. In an image to be detected, the background", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "pixels are often more overwhelming than the pixels of the foreground objects. However, in previous", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 164, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 179 + ], + "score": 1.0, + "content": "knowledge distillation, the student is always trained to mimic the features of all pixels with the same", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "priority. As a result, students have paid most of their attention to learning background pixels features,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "which suppresses student’s learning on features of the foreground objects. Since foreground pixels", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 198, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 505, + 211 + ], + "score": 1.0, + "content": "are more crucial in detection, the imbalance hurts the performance of knowledge distillation severely.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "To overcome this obstacle, we propose the attention-guided distillation which distills only the crucial", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "foreground pixels. Since the attention map can reflect the position of the important pixels (Zhou", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "et al., 2016), we adopt the attention map as the mask for knowledge distillation. Concretely, the pixel", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "with a higher attention value is regarded as a pixel of a foreground object and then is learned by the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "score": 1.0, + "content": "student model with a higher priority. Compared with the previous binary mask method (Wang et al.,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "score": 1.0, + "content": "2019), the mask generated by attention maps in our methods is more fine-grained and requires no", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 275, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 287 + ], + "score": 1.0, + "content": "additional supervision. Compared with the previous attention-based distillation methods (Zagoruyko", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 286, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 505, + 298 + ], + "score": 1.0, + "content": "& Komodakis, 2017), the attention map in our methods is not only utilized as the information to be", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 297, + 374, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 374, + 309 + ], + "score": 1.0, + "content": "distilled but also utilized as the mask signal for feature distillation.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 505, + 402 + ], + "lines": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "Lack of distillation on relation information. It is generally acknowledged that the relation between", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 324, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 506, + 338 + ], + "score": 1.0, + "content": "different objects contains valuable information in object detection. Recently, lots of researchers suc-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "cessfully improve the performance of detectors by enabling detectors to capture and make use of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 346, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 359 + ], + "score": 1.0, + "content": "these relations, such as non-local modules (Wang et al., 2018) and relation networks (Hu et al.,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "2018). However, the existing object detection knowledge distillation methods only distill the infor-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 367, + 506, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 382 + ], + "score": 1.0, + "content": "mation of individual pixels but ignore the relation of different pixels. To solve this issue, we propose", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 380, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 505, + 391 + ], + "score": 1.0, + "content": "the non-local distillation, which aims to capture the relation information of students and teachers", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 390, + 392, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 392, + 402 + ], + "score": 1.0, + "content": "with non-local modules and then distill them from teachers to students.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 106, + 407, + 505, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "score": 1.0, + "content": "Since the non-local modules and attention mechanism in our methods are only required in the train-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 418, + 506, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 506, + 431 + ], + "score": 1.0, + "content": "ing period, our methods don’t introduce additional computation and parameters in the inference", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 429, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 104, + 429, + 506, + 442 + ], + "score": 1.0, + "content": "period. Besides, our methods are feature-based distillation methods which do not depend on a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 440, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 454 + ], + "score": 1.0, + "content": "specific detection algorithm so they can be directly utilized in all kinds of detectors without any", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 450, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 294, + 465 + ], + "score": 1.0, + "content": "modification. On MS COCO2017, 2.9, 2.9 and", + "type": "text" + }, + { + "bbox": [ + 294, + 451, + 324, + 462 + ], + "score": 0.25, + "content": "2 . 2 \\mathrm { A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 450, + 506, + 465 + ], + "score": 1.0, + "content": "improvements can be observed on two-stage,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 462, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 506, + 475 + ], + "score": 1.0, + "content": "one-stage, and anchor-free models on average, respectively. Experiments on Mask RCNN show that", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 473, + 506, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 486 + ], + "score": 1.0, + "content": "our methods can also improve the performance of instance segmentation by 2.0 AP, on average. We", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "have conducted a detailed ablation study and sensitivity study to show the effectiveness and stability", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 495, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 506, + 507 + ], + "score": 1.0, + "content": "of each distillation loss. Moreover, we study the relation between teachers and students on object", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 506, + 506, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 506, + 519 + ], + "score": 1.0, + "content": "detection and find that knowledge distillation on object detection requires a high AP teacher, which", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 517, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "is different from the conclusion in image classification where a high AP teacher may harm the per-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 527, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 505, + 541 + ], + "score": 1.0, + "content": "formance of students (Mirzadeh et al., 2019; Cho & Hariharan, 2019). We hope that these results", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "are worth more contemplation of knowledge distillation on tasks except for image classification. To", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 550, + 383, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 383, + 562 + ], + "score": 1.0, + "content": "sum up, the contribution of this paper can be summarized as follows.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 34.5 + }, + { + "type": "text", + "bbox": [ + 132, + 570, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 131, + 570, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 131, + 570, + 505, + 583 + ], + "score": 1.0, + "content": "• We propose the attention-guided distillation, which emphasizes students’ learning on the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 142, + 582, + 460, + 594 + ], + "spans": [ + { + "bbox": [ + 142, + 582, + 460, + 594 + ], + "score": 1.0, + "content": "foreground objects and suppresses students’ learning on the background pixels.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 140, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 140, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "We propose the non-local distillation, which enables the students to learn not only the infor-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 142, + 608, + 501, + 618 + ], + "spans": [ + { + "bbox": [ + 142, + 608, + 501, + 618 + ], + "score": 1.0, + "content": "mation of the individual pixel but also the relation between different pixels from teachers.", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 137, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 137, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "We show that a teacher with higher AP is usually a better teacher in knowledge distillation", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 141, + 632, + 471, + 645 + ], + "spans": [ + { + "bbox": [ + 141, + 632, + 471, + 645 + ], + "score": 1.0, + "content": "on object detection, which is different from the conclusion in image classification.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44.5 + }, + { + "type": "title", + "bbox": [ + 108, + 663, + 211, + 676 + ], + "lines": [ + { + "bbox": [ + 104, + 662, + 213, + 678 + ], + "spans": [ + { + "bbox": [ + 104, + 662, + 213, + 678 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 48 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "As an effective method for model compression and model accuracy boosting, knowledge distillation", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "has been widely utilized in various domains and tasks, including image classification (Hinton et al.,", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "2014; Romero et al., 2015; Zagoruyko & Komodakis, 2017), object detection (Chen et al., 2017; Li", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "et al., 2017; Wang et al., 2019; Bajestani & Yang, 2020), semantic segmentation (Liu et al., 2019),", + "type": "text" + } + ], + "index": 52 + } + ], + "index": 50.5 + } + ], + "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": "text", + "bbox": [ + 107, + 82, + 504, + 137 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "As one of the most crucial challenges in computer vision, object detection has an urgent requirement", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "of both accurate and efficient models. Unfortunately, most of the existing knowledge distillation", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 506, + 117 + ], + "score": 1.0, + "content": "methods in computer vision are designed for image classification and usually leads to trivial im-", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 114, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 114, + 506, + 129 + ], + "score": 1.0, + "content": "provements on object detection (Li et al., 2017). In this paper, we impute the failure of knowledge", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 501, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 501, + 140 + ], + "score": 1.0, + "content": "distillation on object detection to the following two issues, which will be solved later, respectively.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 82, + 506, + 140 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 144, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 142, + 505, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 505, + 155 + ], + "score": 1.0, + "content": "Imbalance between foreground and background. In an image to be detected, the background", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "pixels are often more overwhelming than the pixels of the foreground objects. However, in previous", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 164, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 164, + 505, + 179 + ], + "score": 1.0, + "content": "knowledge distillation, the student is always trained to mimic the features of all pixels with the same", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 505, + 190 + ], + "score": 1.0, + "content": "priority. As a result, students have paid most of their attention to learning background pixels features,", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "spans": [ + { + "bbox": [ + 105, + 187, + 505, + 200 + ], + "score": 1.0, + "content": "which suppresses student’s learning on features of the foreground objects. Since foreground pixels", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 198, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 198, + 505, + 211 + ], + "score": 1.0, + "content": "are more crucial in detection, the imbalance hurts the performance of knowledge distillation severely.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 209, + 505, + 222 + ], + "score": 1.0, + "content": "To overcome this obstacle, we propose the attention-guided distillation which distills only the crucial", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "spans": [ + { + "bbox": [ + 105, + 220, + 505, + 233 + ], + "score": 1.0, + "content": "foreground pixels. Since the attention map can reflect the position of the important pixels (Zhou", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 505, + 244 + ], + "score": 1.0, + "content": "et al., 2016), we adopt the attention map as the mask for knowledge distillation. Concretely, the pixel", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "spans": [ + { + "bbox": [ + 105, + 242, + 505, + 255 + ], + "score": 1.0, + "content": "with a higher attention value is regarded as a pixel of a foreground object and then is learned by the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 505, + 266 + ], + "score": 1.0, + "content": "student model with a higher priority. Compared with the previous binary mask method (Wang et al.,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 263, + 506, + 277 + ], + "score": 1.0, + "content": "2019), the mask generated by attention maps in our methods is more fine-grained and requires no", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 275, + 505, + 287 + ], + "spans": [ + { + "bbox": [ + 105, + 275, + 505, + 287 + ], + "score": 1.0, + "content": "additional supervision. Compared with the previous attention-based distillation methods (Zagoruyko", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 286, + 505, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 505, + 298 + ], + "score": 1.0, + "content": "& Komodakis, 2017), the attention map in our methods is not only utilized as the information to be", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 297, + 374, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 374, + 309 + ], + "score": 1.0, + "content": "distilled but also utilized as the mask signal for feature distillation.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 142, + 506, + 309 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 313, + 505, + 402 + ], + "lines": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 326 + ], + "score": 1.0, + "content": "Lack of distillation on relation information. It is generally acknowledged that the relation between", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 324, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 506, + 338 + ], + "score": 1.0, + "content": "different objects contains valuable information in object detection. Recently, lots of researchers suc-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 335, + 506, + 348 + ], + "score": 1.0, + "content": "cessfully improve the performance of detectors by enabling detectors to capture and make use of", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 346, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 505, + 359 + ], + "score": 1.0, + "content": "these relations, such as non-local modules (Wang et al., 2018) and relation networks (Hu et al.,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "2018). However, the existing object detection knowledge distillation methods only distill the infor-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 367, + 506, + 382 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 382 + ], + "score": 1.0, + "content": "mation of individual pixels but ignore the relation of different pixels. To solve this issue, we propose", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 380, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 505, + 391 + ], + "score": 1.0, + "content": "the non-local distillation, which aims to capture the relation information of students and teachers", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 390, + 392, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 392, + 402 + ], + "score": 1.0, + "content": "with non-local modules and then distill them from teachers to students.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 313, + 506, + 402 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 407, + 505, + 561 + ], + "lines": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 407, + 505, + 419 + ], + "score": 1.0, + "content": "Since the non-local modules and attention mechanism in our methods are only required in the train-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 418, + 506, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 506, + 431 + ], + "score": 1.0, + "content": "ing period, our methods don’t introduce additional computation and parameters in the inference", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 429, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 104, + 429, + 506, + 442 + ], + "score": 1.0, + "content": "period. Besides, our methods are feature-based distillation methods which do not depend on a", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 440, + 505, + 454 + ], + "spans": [ + { + "bbox": [ + 105, + 440, + 505, + 454 + ], + "score": 1.0, + "content": "specific detection algorithm so they can be directly utilized in all kinds of detectors without any", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 450, + 506, + 465 + ], + "spans": [ + { + "bbox": [ + 105, + 450, + 294, + 465 + ], + "score": 1.0, + "content": "modification. On MS COCO2017, 2.9, 2.9 and", + "type": "text" + }, + { + "bbox": [ + 294, + 451, + 324, + 462 + ], + "score": 0.25, + "content": "2 . 2 \\mathrm { A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 324, + 450, + 506, + 465 + ], + "score": 1.0, + "content": "improvements can be observed on two-stage,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 462, + 506, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 506, + 475 + ], + "score": 1.0, + "content": "one-stage, and anchor-free models on average, respectively. Experiments on Mask RCNN show that", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 473, + 506, + 486 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 486 + ], + "score": 1.0, + "content": "our methods can also improve the performance of instance segmentation by 2.0 AP, on average. We", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 497 + ], + "score": 1.0, + "content": "have conducted a detailed ablation study and sensitivity study to show the effectiveness and stability", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 495, + 506, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 495, + 506, + 507 + ], + "score": 1.0, + "content": "of each distillation loss. Moreover, we study the relation between teachers and students on object", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 506, + 506, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 506, + 519 + ], + "score": 1.0, + "content": "detection and find that knowledge distillation on object detection requires a high AP teacher, which", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 517, + 505, + 530 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 505, + 530 + ], + "score": 1.0, + "content": "is different from the conclusion in image classification where a high AP teacher may harm the per-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 527, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 505, + 541 + ], + "score": 1.0, + "content": "formance of students (Mirzadeh et al., 2019; Cho & Hariharan, 2019). We hope that these results", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "are worth more contemplation of knowledge distillation on tasks except for image classification. To", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 106, + 550, + 383, + 562 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 383, + 562 + ], + "score": 1.0, + "content": "sum up, the contribution of this paper can be summarized as follows.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 34.5, + "bbox_fs": [ + 104, + 407, + 506, + 562 + ] + }, + { + "type": "text", + "bbox": [ + 132, + 570, + 505, + 644 + ], + "lines": [ + { + "bbox": [ + 131, + 570, + 505, + 583 + ], + "spans": [ + { + "bbox": [ + 131, + 570, + 505, + 583 + ], + "score": 1.0, + "content": "• We propose the attention-guided distillation, which emphasizes students’ learning on the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 142, + 582, + 460, + 594 + ], + "spans": [ + { + "bbox": [ + 142, + 582, + 460, + 594 + ], + "score": 1.0, + "content": "foreground objects and suppresses students’ learning on the background pixels.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 140, + 596, + 505, + 608 + ], + "spans": [ + { + "bbox": [ + 140, + 596, + 505, + 608 + ], + "score": 1.0, + "content": "We propose the non-local distillation, which enables the students to learn not only the infor-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 142, + 608, + 501, + 618 + ], + "spans": [ + { + "bbox": [ + 142, + 608, + 501, + 618 + ], + "score": 1.0, + "content": "mation of the individual pixel but also the relation between different pixels from teachers.", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 137, + 621, + 505, + 634 + ], + "spans": [ + { + "bbox": [ + 137, + 621, + 505, + 634 + ], + "score": 1.0, + "content": "We show that a teacher with higher AP is usually a better teacher in knowledge distillation", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 141, + 632, + 471, + 645 + ], + "spans": [ + { + "bbox": [ + 141, + 632, + 471, + 645 + ], + "score": 1.0, + "content": "on object detection, which is different from the conclusion in image classification.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 44.5, + "bbox_fs": [ + 131, + 570, + 505, + 645 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 663, + 211, + 676 + ], + "lines": [ + { + "bbox": [ + 104, + 662, + 213, + 678 + ], + "spans": [ + { + "bbox": [ + 104, + 662, + 213, + 678 + ], + "score": 1.0, + "content": "2 RELATED WORK", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 48 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "As an effective method for model compression and model accuracy boosting, knowledge distillation", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "has been widely utilized in various domains and tasks, including image classification (Hinton et al.,", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 722 + ], + "score": 1.0, + "content": "2014; Romero et al., 2015; Zagoruyko & Komodakis, 2017), object detection (Chen et al., 2017; Li", + "type": "text" + } + ], + "index": 51 + }, + { + "bbox": [ + 105, + 721, + 505, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 732 + ], + "score": 1.0, + "content": "et al., 2017; Wang et al., 2019; Bajestani & Yang, 2020), semantic segmentation (Liu et al., 2019),", + "type": "text" + } + ], + "index": 52 + }, + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "score": 1.0, + "content": "face recognition (Ge et al., 2018), pretrained language model (Sanh et al., 2019; Xu et al., 2020),", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 407, + 506, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 506, + 420 + ], + "score": 1.0, + "content": "multi-exit networks training (Zhang et al., 2019b;a), model robustness (Zhang et al., 2020b) and", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 419, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 505, + 431 + ], + "score": 1.0, + "content": "so on. Hinton et al. (2014) first propose the concept of knowledge distillation where the students", + "type": "text", + "cross_page": true + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 430, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 505, + 442 + ], + "score": 1.0, + "content": "are trained to mimic the results after softmax layers of teachers. Then, abundant methods are pro-", + "type": "text", + "cross_page": true + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "score": 1.0, + "content": "posed to transfer the knowledge in teacher’s features (Romero et al., 2015) or the variants, such as", + "type": "text", + "cross_page": true + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "attention (Zagoruyko & Komodakis, 2017; Hou et al., 2019), FSP (Yim et al., 2017), mutual infor-", + "type": "text", + "cross_page": true + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "mation (Ahn et al., 2019), positive features (Heo et al., 2019), relation of samples in a batch (Park", + "type": "text", + "cross_page": true + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 474, + 242, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 242, + 486 + ], + "score": 1.0, + "content": "et al., 2019; Tung & Mori, 2019).", + "type": "text", + "cross_page": true + } + ], + "index": 18 + } + ], + "index": 50.5, + "bbox_fs": [ + 105, + 687, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 80, + 504, + 272 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 80, + 504, + 272 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 80, + 504, + 272 + ], + "spans": [ + { + "bbox": [ + 108, + 80, + 504, + 272 + ], + "score": 0.974, + "type": "image", + "image_path": "61041fd13485e47decbb5cc309be0e4c87bfab8bdf3205e1793c3584c2e2e466.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 80, + 504, + 144.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 144.0, + 504, + 208.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 208.0, + 504, + 272.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 284, + 505, + 373 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 284, + 505, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 284, + 505, + 297 + ], + "score": 1.0, + "content": "Figure 2: Details of our methods: (a) Attention-guided distillation generates the spatial and channel", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 296, + 505, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 308 + ], + "score": 1.0, + "content": "attention with average pooling in the channel and spatial dimension, respectively. Then, students", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 307, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 318 + ], + "score": 1.0, + "content": "are encouraged to mimic the attention of teachers. Besides, students are also trained to mimic", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 317, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 505, + 329 + ], + "score": 1.0, + "content": "the feature of teachers, which is masked by the attention of both students and teachers. (b) Non-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 328, + 505, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 328, + 505, + 341 + ], + "score": 1.0, + "content": "local distillation captures the relation of pixels in an image with non-local modules. The relation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 339, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 312, + 351 + ], + "score": 1.0, + "content": "information of teachers is learned by students with", + "type": "text" + }, + { + "bbox": [ + 313, + 340, + 325, + 350 + ], + "score": 0.88, + "content": "L _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 339, + 505, + 351 + ], + "score": 1.0, + "content": "norm loss. (c) The architecture of non-local", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "score": 1.0, + "content": "modules. ‘1x1’ is convolution layer with 1x1 kernel. (d) Distillation loss is applied to backbone", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 362, + 493, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 362, + 493, + 373 + ], + "score": 1.0, + "content": "features with different resolutions. The detection head and neck are not involved in our methods.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 6.5 + } + ], + "index": 3.75 + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 505, + 484 + ], + "lines": [ + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "spans": [ + { + "bbox": [ + 106, + 397, + 505, + 409 + ], + "score": 1.0, + "content": "face recognition (Ge et al., 2018), pretrained language model (Sanh et al., 2019; Xu et al., 2020),", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 407, + 506, + 420 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 506, + 420 + ], + "score": 1.0, + "content": "multi-exit networks training (Zhang et al., 2019b;a), model robustness (Zhang et al., 2020b) and", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 419, + 505, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 505, + 431 + ], + "score": 1.0, + "content": "so on. Hinton et al. (2014) first propose the concept of knowledge distillation where the students", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 430, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 430, + 505, + 442 + ], + "score": 1.0, + "content": "are trained to mimic the results after softmax layers of teachers. Then, abundant methods are pro-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 506, + 453 + ], + "score": 1.0, + "content": "posed to transfer the knowledge in teacher’s features (Romero et al., 2015) or the variants, such as", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "attention (Zagoruyko & Komodakis, 2017; Hou et al., 2019), FSP (Yim et al., 2017), mutual infor-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 106, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "mation (Ahn et al., 2019), positive features (Heo et al., 2019), relation of samples in a batch (Park", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 474, + 242, + 486 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 242, + 486 + ], + "score": 1.0, + "content": "et al., 2019; Tung & Mori, 2019).", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 107, + 491, + 295, + 622 + ], + "lines": [ + { + "bbox": [ + 106, + 490, + 296, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 296, + 503 + ], + "score": 1.0, + "content": "Improving the performance of object detection", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 502, + 296, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 296, + 513 + ], + "score": 1.0, + "content": "becomes a hot topic in knowledge distillation", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 513, + 297, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 513, + 297, + 524 + ], + "score": 1.0, + "content": "recently. Chen et al. (2017) design the first", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 523, + 297, + 535 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 297, + 535 + ], + "score": 1.0, + "content": "knowledge distillation method on object de-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 535, + 297, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 535, + 297, + 545 + ], + "score": 1.0, + "content": "tection, which includes distillation loss on the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 546, + 297, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 546, + 297, + 556 + ], + "score": 1.0, + "content": "backbone, the classification head and the re-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 556, + 297, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 297, + 567 + ], + "score": 1.0, + "content": "gression head. Then, many researchers find that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 567, + 297, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 297, + 579 + ], + "score": 1.0, + "content": "the imbalance between the foreground objects", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 579, + 296, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 296, + 589 + ], + "score": 1.0, + "content": "and background is a crucial problem in detec-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 589, + 297, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 589, + 297, + 600 + ], + "score": 1.0, + "content": "tion distillation. Instead of distilling the whole", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 600, + 297, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 297, + 612 + ], + "score": 1.0, + "content": "features of backbone networks, Li et al. (2017)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 610, + 297, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 154, + 623 + ], + "score": 1.0, + "content": "only apply", + "type": "text" + }, + { + "bbox": [ + 154, + 611, + 167, + 622 + ], + "score": 0.87, + "content": "L _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 610, + 297, + 623 + ], + "score": 1.0, + "content": "distillation loss to the features", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 24.5 + }, + { + "type": "image", + "bbox": [ + 306, + 490, + 503, + 586 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 306, + 490, + 503, + 586 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 306, + 490, + 503, + 586 + ], + "spans": [ + { + "bbox": [ + 306, + 490, + 503, + 586 + ], + "score": 0.972, + "type": "image", + "image_path": "d2c71a8917cfd59868cd1078ccf778786d6d211dffd11090042191011e3fcae8.jpg" + } + ] + } + ], + "index": 34.5, + "virtual_lines": [ + { + "bbox": [ + 306, + 490, + 503, + 502.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 306, + 502.0, + 503, + 514.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 306, + 514.0, + 503, + 526.0 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 306, + 526.0, + 503, + 538.0 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 306, + 538.0, + 503, + 550.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 306, + 550.0, + 503, + 562.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 306, + 562.0, + 503, + 574.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 306, + 574.0, + 503, + 586.0 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 303, + 590, + 504, + 612 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 304, + 589, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 304, + 589, + 505, + 601 + ], + "score": 1.0, + "content": "Figure 3: Comparison between the proposed", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 303, + 600, + 495, + 612 + ], + "spans": [ + { + "bbox": [ + 303, + 600, + 495, + 612 + ], + "score": 1.0, + "content": "attention-guided distillation and other methods.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + } + ], + "index": 37.0 + }, + { + "type": "text", + "bbox": [ + 106, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "sampled by RPN. Bajestani & Yang (2020) propose the temporal knowledge distillation, which", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "score": 1.0, + "content": "introduces a hyper-parameter to balance the distillation loss between the pixels of the foreground", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "and background. Wang et al. (2019) propose the fine-grained feature imitation, which only distills", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "the feature near object anchor locations. However, although these works have tried to distill only", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "the pixels of foreground objects, they always reply on the annotation in groundtruth, anchors, and", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "bounding boxes and thus can not be transferred to different kinds of detectors and tasks. In contrast,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "in our method, the pixels of foreground objects are found with attention mechanism, which can be", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "easily generated from features. As a result, it can be directly utilized in all kinds of detectors without", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "any modification. As shown in Figure 3, the difference between the previous mask-based detection", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "distillation method (Wang et al., 2019) and our attention-guided distillation can be summarized as", + "type": "text" + } + ], + "index": 50 + } + ], + "index": 45.5 + } + ], + "page_idx": 2, + "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": [ + 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": [ + 108, + 80, + 504, + 272 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 80, + 504, + 272 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 80, + 504, + 272 + ], + "spans": [ + { + "bbox": [ + 108, + 80, + 504, + 272 + ], + "score": 0.974, + "type": "image", + "image_path": "61041fd13485e47decbb5cc309be0e4c87bfab8bdf3205e1793c3584c2e2e466.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 80, + 504, + 144.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 144.0, + 504, + 208.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 208.0, + 504, + 272.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 284, + 505, + 373 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 284, + 505, + 297 + ], + "spans": [ + { + "bbox": [ + 106, + 284, + 505, + 297 + ], + "score": 1.0, + "content": "Figure 2: Details of our methods: (a) Attention-guided distillation generates the spatial and channel", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 296, + 505, + 308 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 308 + ], + "score": 1.0, + "content": "attention with average pooling in the channel and spatial dimension, respectively. Then, students", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 307, + 505, + 318 + ], + "spans": [ + { + "bbox": [ + 105, + 307, + 505, + 318 + ], + "score": 1.0, + "content": "are encouraged to mimic the attention of teachers. Besides, students are also trained to mimic", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 317, + 505, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 505, + 329 + ], + "score": 1.0, + "content": "the feature of teachers, which is masked by the attention of both students and teachers. (b) Non-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 328, + 505, + 341 + ], + "spans": [ + { + "bbox": [ + 105, + 328, + 505, + 341 + ], + "score": 1.0, + "content": "local distillation captures the relation of pixels in an image with non-local modules. The relation", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 339, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 339, + 312, + 351 + ], + "score": 1.0, + "content": "information of teachers is learned by students with", + "type": "text" + }, + { + "bbox": [ + 313, + 340, + 325, + 350 + ], + "score": 0.88, + "content": "L _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 325, + 339, + 505, + 351 + ], + "score": 1.0, + "content": "norm loss. (c) The architecture of non-local", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 105, + 350, + 505, + 362 + ], + "score": 1.0, + "content": "modules. ‘1x1’ is convolution layer with 1x1 kernel. (d) Distillation loss is applied to backbone", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 362, + 493, + 373 + ], + "spans": [ + { + "bbox": [ + 106, + 362, + 493, + 373 + ], + "score": 1.0, + "content": "features with different resolutions. The detection head and neck are not involved in our methods.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 6.5 + } + ], + "index": 3.75 + }, + { + "type": "text", + "bbox": [ + 106, + 396, + 505, + 484 + ], + "lines": [], + "index": 14.5, + "bbox_fs": [ + 105, + 397, + 506, + 486 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 491, + 295, + 622 + ], + "lines": [ + { + "bbox": [ + 106, + 490, + 296, + 503 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 296, + 503 + ], + "score": 1.0, + "content": "Improving the performance of object detection", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 502, + 296, + 513 + ], + "spans": [ + { + "bbox": [ + 106, + 502, + 296, + 513 + ], + "score": 1.0, + "content": "becomes a hot topic in knowledge distillation", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 513, + 297, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 513, + 297, + 524 + ], + "score": 1.0, + "content": "recently. Chen et al. (2017) design the first", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 523, + 297, + 535 + ], + "spans": [ + { + "bbox": [ + 106, + 523, + 297, + 535 + ], + "score": 1.0, + "content": "knowledge distillation method on object de-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 535, + 297, + 545 + ], + "spans": [ + { + "bbox": [ + 106, + 535, + 297, + 545 + ], + "score": 1.0, + "content": "tection, which includes distillation loss on the", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 546, + 297, + 556 + ], + "spans": [ + { + "bbox": [ + 106, + 546, + 297, + 556 + ], + "score": 1.0, + "content": "backbone, the classification head and the re-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 556, + 297, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 556, + 297, + 567 + ], + "score": 1.0, + "content": "gression head. Then, many researchers find that", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 567, + 297, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 297, + 579 + ], + "score": 1.0, + "content": "the imbalance between the foreground objects", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 579, + 296, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 579, + 296, + 589 + ], + "score": 1.0, + "content": "and background is a crucial problem in detec-", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 589, + 297, + 600 + ], + "spans": [ + { + "bbox": [ + 106, + 589, + 297, + 600 + ], + "score": 1.0, + "content": "tion distillation. Instead of distilling the whole", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 600, + 297, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 297, + 612 + ], + "score": 1.0, + "content": "features of backbone networks, Li et al. (2017)", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 610, + 297, + 623 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 154, + 623 + ], + "score": 1.0, + "content": "only apply", + "type": "text" + }, + { + "bbox": [ + 154, + 611, + 167, + 622 + ], + "score": 0.87, + "content": "L _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 610, + 297, + 623 + ], + "score": 1.0, + "content": "distillation loss to the features", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 490, + 297, + 623 + ] + }, + { + "type": "image", + "bbox": [ + 306, + 490, + 503, + 586 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 306, + 490, + 503, + 586 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 306, + 490, + 503, + 586 + ], + "spans": [ + { + "bbox": [ + 306, + 490, + 503, + 586 + ], + "score": 0.972, + "type": "image", + "image_path": "d2c71a8917cfd59868cd1078ccf778786d6d211dffd11090042191011e3fcae8.jpg" + } + ] + } + ], + "index": 34.5, + "virtual_lines": [ + { + "bbox": [ + 306, + 490, + 503, + 502.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 306, + 502.0, + 503, + 514.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 306, + 514.0, + 503, + 526.0 + ], + "spans": [], + "index": 33 + }, + { + "bbox": [ + 306, + 526.0, + 503, + 538.0 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 306, + 538.0, + 503, + 550.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 306, + 550.0, + 503, + 562.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 306, + 562.0, + 503, + 574.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 306, + 574.0, + 503, + 586.0 + ], + "spans": [], + "index": 38 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 303, + 590, + 504, + 612 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 304, + 589, + 505, + 601 + ], + "spans": [ + { + "bbox": [ + 304, + 589, + 505, + 601 + ], + "score": 1.0, + "content": "Figure 3: Comparison between the proposed", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 303, + 600, + 495, + 612 + ], + "spans": [ + { + "bbox": [ + 303, + 600, + 495, + 612 + ], + "score": 1.0, + "content": "attention-guided distillation and other methods.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + } + ], + "index": 37.0 + }, + { + "type": "text", + "bbox": [ + 106, + 622, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 505, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 633 + ], + "score": 1.0, + "content": "sampled by RPN. Bajestani & Yang (2020) propose the temporal knowledge distillation, which", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 506, + 645 + ], + "score": 1.0, + "content": "introduces a hyper-parameter to balance the distillation loss between the pixels of the foreground", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 644, + 506, + 657 + ], + "spans": [ + { + "bbox": [ + 106, + 644, + 506, + 657 + ], + "score": 1.0, + "content": "and background. Wang et al. (2019) propose the fine-grained feature imitation, which only distills", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 654, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 505, + 667 + ], + "score": 1.0, + "content": "the feature near object anchor locations. However, although these works have tried to distill only", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "spans": [ + { + "bbox": [ + 106, + 666, + 506, + 678 + ], + "score": 1.0, + "content": "the pixels of foreground objects, they always reply on the annotation in groundtruth, anchors, and", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "spans": [ + { + "bbox": [ + 106, + 677, + 505, + 689 + ], + "score": 1.0, + "content": "bounding boxes and thus can not be transferred to different kinds of detectors and tasks. In contrast,", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "in our method, the pixels of foreground objects are found with attention mechanism, which can be", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "easily generated from features. As a result, it can be directly utilized in all kinds of detectors without", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "any modification. As shown in Figure 3, the difference between the previous mask-based detection", + "type": "text" + } + ], + "index": 49 + }, + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 506, + 733 + ], + "score": 1.0, + "content": "distillation method (Wang et al., 2019) and our attention-guided distillation can be summarized as", + "type": "text" + } + ], + "index": 50 + }, + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "follows (i) Our methods generate the mask with attention mechanism while they generate the mask", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 505, + 106 + ], + "score": 1.0, + "content": "with ground truth bounding boxes and anchor priors. (ii) The mask in our methods is a pixel-wise", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "and fine-grained mask while the mask in their method is an object-wise and binary mask. (iii) The", + "type": "text", + "cross_page": true + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 113, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 506, + 129 + ], + "score": 1.0, + "content": "masks in our methods are composed of a spatial mask and a channel mask while they only have a", + "type": "text", + "cross_page": true + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 458, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 458, + 139 + ], + "score": 1.0, + "content": "spatial mask. More detailed comparison with related work can be found in Appendix.E.", + "type": "text", + "cross_page": true + } + ], + "index": 4 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 622, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 138 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "follows (i) Our methods generate the mask with attention mechanism while they generate the mask", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 505, + 106 + ], + "score": 1.0, + "content": "with ground truth bounding boxes and anchor priors. (ii) The mask in our methods is a pixel-wise", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "and fine-grained mask while the mask in their method is an object-wise and binary mask. (iii) The", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 113, + 506, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 113, + 506, + 129 + ], + "score": 1.0, + "content": "masks in our methods are composed of a spatial mask and a channel mask while they only have a", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 458, + 139 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 458, + 139 + ], + "score": 1.0, + "content": "spatial mask. More detailed comparison with related work can be found in Appendix.E.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 2 + }, + { + "type": "title", + "bbox": [ + 108, + 155, + 209, + 168 + ], + "lines": [ + { + "bbox": [ + 104, + 153, + 211, + 171 + ], + "spans": [ + { + "bbox": [ + 104, + 153, + 211, + 171 + ], + "score": 1.0, + "content": "3 METHODOLOGY", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 108, + 180, + 282, + 192 + ], + "lines": [ + { + "bbox": [ + 106, + 181, + 284, + 193 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 284, + 193 + ], + "score": 1.0, + "content": "3.1 ATTENTION-GUIDED DISTILLATION", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 200, + 505, + 402 + ], + "lines": [ + { + "bbox": [ + 105, + 199, + 506, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 140, + 214 + ], + "score": 1.0, + "content": "We use", + "type": "text" + }, + { + "bbox": [ + 140, + 200, + 197, + 212 + ], + "score": 0.9, + "content": "A \\in \\mathbb { R } ^ { C , H , W }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 199, + 506, + 214 + ], + "score": 1.0, + "content": "to denote the feature of the backbone in an object detection model, where", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 213, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 107, + 213, + 144, + 224 + ], + "score": 0.9, + "content": "C , H , W", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 213, + 506, + 226 + ], + "score": 1.0, + "content": "denotes its channel number, height and width, respectively. Then, the generation of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 224, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 505, + 236 + ], + "score": 1.0, + "content": "the spatial attention map and channel attention map is equivalent to finding the mapping function", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 231, + 504, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 204, + 245 + ], + "score": 0.91, + "content": "\\mathcal { G } ^ { s } : \\mathbf { \\bar { \\mathbb { R } } } ^ { C , H , W } \\mathbb { R } ^ { H , W }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 231, + 223, + 249 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 223, + 234, + 309, + 245 + ], + "score": 0.92, + "content": "\\mathcal { G } ^ { c } : \\mathbb { R } ^ { C , H , W } \\mathbb { R } ^ { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 231, + 473, + 249 + ], + "score": 1.0, + "content": ", respectively. Note that the superscripts", + "type": "text" + }, + { + "bbox": [ + 473, + 237, + 479, + 245 + ], + "score": 0.72, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 231, + 498, + 249 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 498, + 237, + 504, + 245 + ], + "score": 0.64, + "content": "c", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "here are utilized to discriminate ‘spatial’ and ‘channel’. Since the absolute value of each element in", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 257, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 296, + 270 + ], + "score": 1.0, + "content": "the feature implies its importance, we construct", + "type": "text" + }, + { + "bbox": [ + 297, + 257, + 308, + 267 + ], + "score": 0.87, + "content": "\\mathcal G ^ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 257, + 505, + 270 + ], + "score": 1.0, + "content": "by summing the absolute values across the chan-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 267, + 504, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 220, + 280 + ], + "score": 1.0, + "content": "nel dimension and construct", + "type": "text" + }, + { + "bbox": [ + 221, + 268, + 232, + 279 + ], + "score": 0.87, + "content": "\\mathcal G ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 267, + 504, + 280 + ], + "score": 1.0, + "content": "by summing the absolute values across the width and height dimen-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 102, + 274, + 502, + 299 + ], + "spans": [ + { + "bbox": [ + 102, + 274, + 239, + 299 + ], + "score": 1.0, + "content": "sion, which can be formulated as", + "type": "text" + }, + { + "bbox": [ + 239, + 278, + 378, + 293 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { G } ^ { c } ( A ) = \\frac { 1 } { H W } \\sum _ { H } ^ { i = 1 } \\sum _ { W } ^ { j = 1 } | A . , _ { i , j } | } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 274, + 396, + 299 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 396, + 278, + 502, + 294 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal G ^ { s } ( A ) = \\frac { 1 } { C } \\sum _ { C } ^ { \\bar { k = 1 } } | A _ { k , \\cdot , \\cdot } | . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 291, + 506, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 133, + 305 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 292, + 156, + 303 + ], + "score": 0.9, + "content": "i , j , k", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 291, + 204, + 305 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 208, + 292, + 253, + 303 + ], + "score": 0.32, + "content": "\\dot { \\iota } _ { t h } , j _ { t h } , k _ { t h }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 291, + 285, + 305 + ], + "score": 1.0, + "content": "slice of", + "type": "text" + }, + { + "bbox": [ + 286, + 293, + 294, + 302 + ], + "score": 0.75, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 291, + 506, + 305 + ], + "score": 1.0, + "content": "in the height, width, and channel dimension, respec-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 302, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 267, + 315 + ], + "score": 1.0, + "content": "tively. Then, the spatial attention mask", + "type": "text" + }, + { + "bbox": [ + 268, + 303, + 284, + 313 + ], + "score": 0.88, + "content": "M ^ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 302, + 414, + 315 + ], + "score": 1.0, + "content": "and the channel attention mask", + "type": "text" + }, + { + "bbox": [ + 415, + 303, + 431, + 313 + ], + "score": 0.87, + "content": "M ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 302, + 505, + 315 + ], + "score": 1.0, + "content": "used in attention-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 313, + 506, + 326 + ], + "spans": [ + { + "bbox": [ + 104, + 313, + 506, + 326 + ], + "score": 1.0, + "content": "guided distillation can be obtained by summing the attention maps from the teacher and the stu-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 323, + 507, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 277, + 336 + ], + "score": 1.0, + "content": "dent detector, which can be formulated as", + "type": "text" + }, + { + "bbox": [ + 277, + 324, + 507, + 336 + ], + "score": 0.82, + "content": "M ^ { s } \\stackrel { \\smile } { = } H W \\cdot \\mathrm { s o f t m a x } ( \\hat { ( } \\mathcal G ^ { s } ( A ^ { S } ) + \\mathcal G ^ { s } ( A ^ { T } ) ) / T ) , M ^ { c } =", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 107, + 335, + 257, + 347 + ], + "score": 0.85, + "content": "C \\cdot \\operatorname { s o f t m a x } ( ( { \\mathcal { G } } ^ { c } ( A ^ { { \\mathcal { S } } } ) + { \\mathcal { G } } ^ { c } ( A ^ { { \\mathcal { T } } } ) ) / T )", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 334, + 365, + 348 + ], + "score": 1.0, + "content": ". Note that the superscripts", + "type": "text" + }, + { + "bbox": [ + 365, + 336, + 373, + 345 + ], + "score": 0.82, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 334, + 391, + 348 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 392, + 336, + 401, + 345 + ], + "score": 0.81, + "content": "\\tau", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "here are used to discrimi-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 346, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 217, + 359 + ], + "score": 1.0, + "content": "nate students and teachers.", + "type": "text" + }, + { + "bbox": [ + 217, + 348, + 225, + 356 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 346, + 505, + 359 + ], + "score": 1.0, + "content": "is a hyper-parameter in softmax introduced by Hinton et al. to adjust", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "the distribution of elements in attention masks (see Figure 4). The attention-guided distillation loss", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 107, + 369, + 134, + 379 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { A G D }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 368, + 374, + 381 + ], + "score": 1.0, + "content": "is composed of two components – attention transfer loss", + "type": "text" + }, + { + "bbox": [ + 374, + 369, + 394, + 379 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { A T }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "and attention-masked loss", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 129, + 390 + ], + "score": 0.79, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 379, + 133, + 392 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 134, + 379, + 154, + 390 + ], + "score": 0.79, + "content": "\\mathcal { L } _ { A T }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "is utilized to encourage the student model to mimic the spatial and channel attention of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 390, + 294, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 294, + 402 + ], + "score": 1.0, + "content": "the teacher model, which can be formulated as", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 15.5 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 406, + 419, + 422 + ], + "lines": [ + { + "bbox": [ + 192, + 406, + 419, + 422 + ], + "spans": [ + { + "bbox": [ + 192, + 406, + 419, + 422 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { A T } = \\mathcal { L } _ { 2 } ( \\mathcal { G } ^ { s } ( A ^ { \\mathcal { S } } ) , \\mathcal { G } ^ { s } ( A ^ { \\mathcal { T } } ) ) + \\mathcal { L } _ { 2 } ( \\mathcal { G } ^ { c } ( A ^ { \\mathcal { S } } ) , \\mathcal { G } ^ { c } ( A ^ { \\mathcal { T } } ) ) .", + "type": "interline_equation", + "image_path": "c398743247e2c0735fca38bd21c7dc288e086c4336496f3c83360d813fa4e41c.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 192, + 406, + 419, + 422 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 504, + 450 + ], + "lines": [ + { + "bbox": [ + 106, + 426, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 428, + 129, + 439 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 426, + 450, + 441 + ], + "score": 1.0, + "content": "is utilized to encourage the student to mimic the features of teacher models by a", + "type": "text" + }, + { + "bbox": [ + 450, + 429, + 462, + 439 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 426, + 505, + 441 + ], + "score": 1.0, + "content": "norm loss", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 438, + 318, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 152, + 451 + ], + "score": 1.0, + "content": "masked by", + "type": "text" + }, + { + "bbox": [ + 152, + 439, + 168, + 449 + ], + "score": 0.88, + "content": "M ^ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 438, + 186, + 451 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 186, + 439, + 202, + 449 + ], + "score": 0.87, + "content": "M ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 438, + 318, + 451 + ], + "score": 1.0, + "content": ", which can be formulated as", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 456, + 422, + 500 + ], + "lines": [ + { + "bbox": [ + 189, + 456, + 422, + 500 + ], + "spans": [ + { + "bbox": [ + 189, + 456, + 422, + 500 + ], + "score": 0.95, + "content": "\\mathcal { L } _ { A M } = \\left( \\sum _ { k = 1 } ^ { C } \\sum _ { i = 1 } ^ { H } \\sum _ { j = 1 } ^ { W } ( A _ { k , i , j } ^ { \\mathcal { T } } - A _ { k , i , j } ^ { S } ) ^ { 2 } \\cdot M _ { i , j } ^ { s } \\cdot M _ { k } ^ { c } \\right) ^ { \\frac { 1 } { 2 } } .", + "type": "interline_equation", + "image_path": "ee330a087eecfafc8872384eba344c1bb104f26fcf27b7d1191705426d02a260.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 189, + 456, + 422, + 470.6666666666667 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 189, + 470.6666666666667, + 422, + 485.33333333333337 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 189, + 485.33333333333337, + 422, + 500.00000000000006 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 512, + 249, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 510, + 250, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 250, + 525 + ], + "score": 1.0, + "content": "3.2 NON-LOCAL DISTILLATION", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 532, + 505, + 642 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "Non-local module (Wang et al., 2018) is an effective method to improve the performance of neu-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 545, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 505, + 557 + ], + "score": 1.0, + "content": "ral networks by capturing the global relation information. In this paper, we apply non-local", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 555, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 104, + 555, + 475, + 570 + ], + "score": 1.0, + "content": "modules to capture the relation between pixels in an image, which can be formulated as", + "type": "text" + }, + { + "bbox": [ + 476, + 556, + 505, + 568 + ], + "score": 0.88, + "content": "\\begin{array} { r l } { r _ { i , j } } & { { } = } \\end{array}", + "type": "inline_equation" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 567, + 507, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 567, + 294, + 586 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\frac { 1 } { W H } \\sum _ { H } ^ { i ^ { ' } = 1 } { \\sum _ { W } ^ { j ^ { ' } = 1 } { f ( A . , { i , j } , A . _ { { i ^ { ' } , j ^ { ' } } } ) g ( A . _ { { \\cdot , i ^ { ' } , j ^ { ' } } } ) } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 567, + 326, + 586 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 326, + 574, + 332, + 582 + ], + "score": 0.69, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 567, + 507, + 586 + ], + "score": 1.0, + "content": "denotes the obtained relation information.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 584, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 120, + 598 + ], + "score": 0.88, + "content": "i , j", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 585, + 435, + 599 + ], + "score": 1.0, + "content": "are the spatial indexes of an output position whose response is to be computed.", + "type": "text" + }, + { + "bbox": [ + 435, + 584, + 455, + 598 + ], + "score": 0.88, + "content": "i ^ { \\prime } , j ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 585, + 505, + 599 + ], + "score": 1.0, + "content": "are the spa-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 597, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 306, + 611 + ], + "score": 1.0, + "content": "tial indexes that enumerates all possible positions.", + "type": "text" + }, + { + "bbox": [ + 306, + 598, + 313, + 609 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 597, + 505, + 611 + ], + "score": 1.0, + "content": "is a pairwise function for computing the relation", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 608, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 175, + 621 + ], + "score": 1.0, + "content": "of two pixels and", + "type": "text" + }, + { + "bbox": [ + 175, + 610, + 182, + 620 + ], + "score": 0.8, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 608, + 505, + 621 + ], + "score": 1.0, + "content": "is an unary function for computing the representation of an individual pixel. Now,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 620, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 334, + 633 + ], + "score": 1.0, + "content": "we can introduce the proposed non-local distillation loss", + "type": "text" + }, + { + "bbox": [ + 335, + 620, + 362, + 631 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { N L D }", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 620, + 389, + 633 + ], + "score": 1.0, + "content": "as the", + "type": "text" + }, + { + "bbox": [ + 390, + 620, + 402, + 631 + ], + "score": 0.87, + "content": "\\mathcal { L } _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 620, + 506, + 633 + ], + "score": 1.0, + "content": "loss between the relation", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 104, + 628, + 474, + 644 + ], + "spans": [ + { + "bbox": [ + 104, + 628, + 383, + 644 + ], + "score": 1.0, + "content": "information of the students and teachers, which can be formulated as", + "type": "text" + }, + { + "bbox": [ + 383, + 630, + 470, + 642 + ], + "score": 0.93, + "content": "\\mathcal { L } _ { N L D } = \\mathcal { L } _ { 2 } ( r ^ { S } , r ^ { T } )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 628, + 474, + 644 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36 + }, + { + "type": "title", + "bbox": [ + 108, + 656, + 247, + 668 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 248, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 248, + 669 + ], + "score": 1.0, + "content": "3.3 OVERALL LOSS FUNCTION", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 105, + 677, + 503, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 260, + 691 + ], + "score": 1.0, + "content": "We introduce three hyper-parameters", + "type": "text" + }, + { + "bbox": [ + 261, + 678, + 289, + 689 + ], + "score": 0.92, + "content": "\\alpha , \\beta , \\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 676, + 505, + 691 + ], + "score": 1.0, + "content": "to balance different distillation loss in our methods.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 689, + 303, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 303, + 700 + ], + "score": 1.0, + "content": "The overall distillation loss can be formulated as", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 705, + 417, + 723 + ], + "lines": [ + { + "bbox": [ + 186, + 705, + 417, + 723 + ], + "spans": [ + { + "bbox": [ + 186, + 705, + 417, + 723 + ], + "score": 0.87, + "content": "\\begin{array} { r } \\mathcal { L } _ { D i s t i l l } ( A ^ { \\mathcal { T } } , A ^ { \\mathcal { S } } ) = \\underbrace { \\alpha \\cdot \\mathcal { L } _ { A T } + \\beta \\cdot \\mathcal { L } _ { A M } } _ \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\end{array}", + "type": "interline_equation", + "image_path": "7152295a1c0eeade66848eaf3c970598352d6f66865d4ecb50c4a53b147cea17.jpg" + } + ] + } + ], + "index": 44, + "virtual_lines": [ + { + "bbox": [ + 186, + 705, + 417, + 723 + ], + "spans": [], + "index": 44 + } + ] + } + ], + "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, + 752, + 308, + 759 + ], + "lines": [] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 138 + ], + "lines": [], + "index": 2, + "bbox_fs": [ + 105, + 82, + 506, + 139 + ], + "lines_deleted": true + }, + { + "type": "title", + "bbox": [ + 108, + 155, + 209, + 168 + ], + "lines": [ + { + "bbox": [ + 104, + 153, + 211, + 171 + ], + "spans": [ + { + "bbox": [ + 104, + 153, + 211, + 171 + ], + "score": 1.0, + "content": "3 METHODOLOGY", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "title", + "bbox": [ + 108, + 180, + 282, + 192 + ], + "lines": [ + { + "bbox": [ + 106, + 181, + 284, + 193 + ], + "spans": [ + { + "bbox": [ + 106, + 181, + 284, + 193 + ], + "score": 1.0, + "content": "3.1 ATTENTION-GUIDED DISTILLATION", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 200, + 505, + 402 + ], + "lines": [ + { + "bbox": [ + 105, + 199, + 506, + 214 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 140, + 214 + ], + "score": 1.0, + "content": "We use", + "type": "text" + }, + { + "bbox": [ + 140, + 200, + 197, + 212 + ], + "score": 0.9, + "content": "A \\in \\mathbb { R } ^ { C , H , W }", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 199, + 506, + 214 + ], + "score": 1.0, + "content": "to denote the feature of the backbone in an object detection model, where", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 213, + 506, + 226 + ], + "spans": [ + { + "bbox": [ + 107, + 213, + 144, + 224 + ], + "score": 0.9, + "content": "C , H , W", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 213, + 506, + 226 + ], + "score": 1.0, + "content": "denotes its channel number, height and width, respectively. Then, the generation of", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 224, + 505, + 236 + ], + "spans": [ + { + "bbox": [ + 106, + 224, + 505, + 236 + ], + "score": 1.0, + "content": "the spatial attention map and channel attention map is equivalent to finding the mapping function", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 231, + 504, + 249 + ], + "spans": [ + { + "bbox": [ + 106, + 234, + 204, + 245 + ], + "score": 0.91, + "content": "\\mathcal { G } ^ { s } : \\mathbf { \\bar { \\mathbb { R } } } ^ { C , H , W } \\mathbb { R } ^ { H , W }", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 231, + 223, + 249 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 223, + 234, + 309, + 245 + ], + "score": 0.92, + "content": "\\mathcal { G } ^ { c } : \\mathbb { R } ^ { C , H , W } \\mathbb { R } ^ { C }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 231, + 473, + 249 + ], + "score": 1.0, + "content": ", respectively. Note that the superscripts", + "type": "text" + }, + { + "bbox": [ + 473, + 237, + 479, + 245 + ], + "score": 0.72, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 231, + 498, + 249 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 498, + 237, + 504, + 245 + ], + "score": 0.64, + "content": "c", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 245, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 245, + 505, + 257 + ], + "score": 1.0, + "content": "here are utilized to discriminate ‘spatial’ and ‘channel’. Since the absolute value of each element in", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 257, + 505, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 296, + 270 + ], + "score": 1.0, + "content": "the feature implies its importance, we construct", + "type": "text" + }, + { + "bbox": [ + 297, + 257, + 308, + 267 + ], + "score": 0.87, + "content": "\\mathcal G ^ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 309, + 257, + 505, + 270 + ], + "score": 1.0, + "content": "by summing the absolute values across the chan-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 267, + 504, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 267, + 220, + 280 + ], + "score": 1.0, + "content": "nel dimension and construct", + "type": "text" + }, + { + "bbox": [ + 221, + 268, + 232, + 279 + ], + "score": 0.87, + "content": "\\mathcal G ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 233, + 267, + 504, + 280 + ], + "score": 1.0, + "content": "by summing the absolute values across the width and height dimen-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 102, + 274, + 502, + 299 + ], + "spans": [ + { + "bbox": [ + 102, + 274, + 239, + 299 + ], + "score": 1.0, + "content": "sion, which can be formulated as", + "type": "text" + }, + { + "bbox": [ + 239, + 278, + 378, + 293 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\mathcal { G } ^ { c } ( A ) = \\frac { 1 } { H W } \\sum _ { H } ^ { i = 1 } \\sum _ { W } ^ { j = 1 } | A . , _ { i , j } | } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 274, + 396, + 299 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 396, + 278, + 502, + 294 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\mathcal G ^ { s } ( A ) = \\frac { 1 } { C } \\sum _ { C } ^ { \\bar { k = 1 } } | A _ { k , \\cdot , \\cdot } | . } \\end{array}", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 291, + 506, + 305 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 133, + 305 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 292, + 156, + 303 + ], + "score": 0.9, + "content": "i , j , k", + "type": "inline_equation" + }, + { + "bbox": [ + 157, + 291, + 204, + 305 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 208, + 292, + 253, + 303 + ], + "score": 0.32, + "content": "\\dot { \\iota } _ { t h } , j _ { t h } , k _ { t h }", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 291, + 285, + 305 + ], + "score": 1.0, + "content": "slice of", + "type": "text" + }, + { + "bbox": [ + 286, + 293, + 294, + 302 + ], + "score": 0.75, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 291, + 506, + 305 + ], + "score": 1.0, + "content": "in the height, width, and channel dimension, respec-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 302, + 505, + 315 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 267, + 315 + ], + "score": 1.0, + "content": "tively. Then, the spatial attention mask", + "type": "text" + }, + { + "bbox": [ + 268, + 303, + 284, + 313 + ], + "score": 0.88, + "content": "M ^ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 302, + 414, + 315 + ], + "score": 1.0, + "content": "and the channel attention mask", + "type": "text" + }, + { + "bbox": [ + 415, + 303, + 431, + 313 + ], + "score": 0.87, + "content": "M ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 302, + 505, + 315 + ], + "score": 1.0, + "content": "used in attention-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 104, + 313, + 506, + 326 + ], + "spans": [ + { + "bbox": [ + 104, + 313, + 506, + 326 + ], + "score": 1.0, + "content": "guided distillation can be obtained by summing the attention maps from the teacher and the stu-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 323, + 507, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 277, + 336 + ], + "score": 1.0, + "content": "dent detector, which can be formulated as", + "type": "text" + }, + { + "bbox": [ + 277, + 324, + 507, + 336 + ], + "score": 0.82, + "content": "M ^ { s } \\stackrel { \\smile } { = } H W \\cdot \\mathrm { s o f t m a x } ( \\hat { ( } \\mathcal G ^ { s } ( A ^ { S } ) + \\mathcal G ^ { s } ( A ^ { T } ) ) / T ) , M ^ { c } =", + "type": "inline_equation" + } + ], + "index": 18 + }, + { + "bbox": [ + 107, + 334, + 505, + 348 + ], + "spans": [ + { + "bbox": [ + 107, + 335, + 257, + 347 + ], + "score": 0.85, + "content": "C \\cdot \\operatorname { s o f t m a x } ( ( { \\mathcal { G } } ^ { c } ( A ^ { { \\mathcal { S } } } ) + { \\mathcal { G } } ^ { c } ( A ^ { { \\mathcal { T } } } ) ) / T )", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 334, + 365, + 348 + ], + "score": 1.0, + "content": ". Note that the superscripts", + "type": "text" + }, + { + "bbox": [ + 365, + 336, + 373, + 345 + ], + "score": 0.82, + "content": "s", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 334, + 391, + 348 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 392, + 336, + 401, + 345 + ], + "score": 0.81, + "content": "\\tau", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 334, + 505, + 348 + ], + "score": 1.0, + "content": "here are used to discrimi-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 346, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 346, + 217, + 359 + ], + "score": 1.0, + "content": "nate students and teachers.", + "type": "text" + }, + { + "bbox": [ + 217, + 348, + 225, + 356 + ], + "score": 0.81, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 346, + 505, + 359 + ], + "score": 1.0, + "content": "is a hyper-parameter in softmax introduced by Hinton et al. to adjust", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "the distribution of elements in attention masks (see Figure 4). The attention-guided distillation loss", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 368, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 107, + 369, + 134, + 379 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { A G D }", + "type": "inline_equation" + }, + { + "bbox": [ + 134, + 368, + 374, + 381 + ], + "score": 1.0, + "content": "is composed of two components – attention transfer loss", + "type": "text" + }, + { + "bbox": [ + 374, + 369, + 394, + 379 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { A T }", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 368, + 505, + 381 + ], + "score": 1.0, + "content": "and attention-masked loss", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 379, + 506, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 129, + 390 + ], + "score": 0.79, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 379, + 133, + 392 + ], + "score": 1.0, + "content": ".", + "type": "text" + }, + { + "bbox": [ + 134, + 379, + 154, + 390 + ], + "score": 0.79, + "content": "\\mathcal { L } _ { A T }", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 379, + 506, + 392 + ], + "score": 1.0, + "content": "is utilized to encourage the student model to mimic the spatial and channel attention of", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 390, + 294, + 402 + ], + "spans": [ + { + "bbox": [ + 106, + 390, + 294, + 402 + ], + "score": 1.0, + "content": "the teacher model, which can be formulated as", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 15.5, + "bbox_fs": [ + 102, + 199, + 507, + 402 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 406, + 419, + 422 + ], + "lines": [ + { + "bbox": [ + 192, + 406, + 419, + 422 + ], + "spans": [ + { + "bbox": [ + 192, + 406, + 419, + 422 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { A T } = \\mathcal { L } _ { 2 } ( \\mathcal { G } ^ { s } ( A ^ { \\mathcal { S } } ) , \\mathcal { G } ^ { s } ( A ^ { \\mathcal { T } } ) ) + \\mathcal { L } _ { 2 } ( \\mathcal { G } ^ { c } ( A ^ { \\mathcal { S } } ) , \\mathcal { G } ^ { c } ( A ^ { \\mathcal { T } } ) ) .", + "type": "interline_equation", + "image_path": "c398743247e2c0735fca38bd21c7dc288e086c4336496f3c83360d813fa4e41c.jpg" + } + ] + } + ], + "index": 25, + "virtual_lines": [ + { + "bbox": [ + 192, + 406, + 419, + 422 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 428, + 504, + 450 + ], + "lines": [ + { + "bbox": [ + 106, + 426, + 505, + 441 + ], + "spans": [ + { + "bbox": [ + 106, + 428, + 129, + 439 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + }, + { + "bbox": [ + 129, + 426, + 450, + 441 + ], + "score": 1.0, + "content": "is utilized to encourage the student to mimic the features of teacher models by a", + "type": "text" + }, + { + "bbox": [ + 450, + 429, + 462, + 439 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 426, + 505, + 441 + ], + "score": 1.0, + "content": "norm loss", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 438, + 318, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 152, + 451 + ], + "score": 1.0, + "content": "masked by", + "type": "text" + }, + { + "bbox": [ + 152, + 439, + 168, + 449 + ], + "score": 0.88, + "content": "M ^ { s }", + "type": "inline_equation" + }, + { + "bbox": [ + 168, + 438, + 186, + 451 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 186, + 439, + 202, + 449 + ], + "score": 0.87, + "content": "M ^ { c }", + "type": "inline_equation" + }, + { + "bbox": [ + 203, + 438, + 318, + 451 + ], + "score": 1.0, + "content": ", which can be formulated as", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 105, + 426, + 505, + 451 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 456, + 422, + 500 + ], + "lines": [ + { + "bbox": [ + 189, + 456, + 422, + 500 + ], + "spans": [ + { + "bbox": [ + 189, + 456, + 422, + 500 + ], + "score": 0.95, + "content": "\\mathcal { L } _ { A M } = \\left( \\sum _ { k = 1 } ^ { C } \\sum _ { i = 1 } ^ { H } \\sum _ { j = 1 } ^ { W } ( A _ { k , i , j } ^ { \\mathcal { T } } - A _ { k , i , j } ^ { S } ) ^ { 2 } \\cdot M _ { i , j } ^ { s } \\cdot M _ { k } ^ { c } \\right) ^ { \\frac { 1 } { 2 } } .", + "type": "interline_equation", + "image_path": "ee330a087eecfafc8872384eba344c1bb104f26fcf27b7d1191705426d02a260.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 189, + 456, + 422, + 470.6666666666667 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 189, + 470.6666666666667, + 422, + 485.33333333333337 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 189, + 485.33333333333337, + 422, + 500.00000000000006 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "title", + "bbox": [ + 108, + 512, + 249, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 510, + 250, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 510, + 250, + 525 + ], + "score": 1.0, + "content": "3.2 NON-LOCAL DISTILLATION", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 532, + 505, + 642 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "Non-local module (Wang et al., 2018) is an effective method to improve the performance of neu-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 545, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 545, + 505, + 557 + ], + "score": 1.0, + "content": "ral networks by capturing the global relation information. In this paper, we apply non-local", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 104, + 555, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 104, + 555, + 475, + 570 + ], + "score": 1.0, + "content": "modules to capture the relation between pixels in an image, which can be formulated as", + "type": "text" + }, + { + "bbox": [ + 476, + 556, + 505, + 568 + ], + "score": 0.88, + "content": "\\begin{array} { r l } { r _ { i , j } } & { { } = } \\end{array}", + "type": "inline_equation" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 567, + 507, + 586 + ], + "spans": [ + { + "bbox": [ + 106, + 567, + 294, + 586 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\frac { 1 } { W H } \\sum _ { H } ^ { i ^ { ' } = 1 } { \\sum _ { W } ^ { j ^ { ' } = 1 } { f ( A . , { i , j } , A . _ { { i ^ { ' } , j ^ { ' } } } ) g ( A . _ { { \\cdot , i ^ { ' } , j ^ { ' } } } ) } } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 567, + 326, + 586 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 326, + 574, + 332, + 582 + ], + "score": 0.69, + "content": "r", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 567, + 507, + 586 + ], + "score": 1.0, + "content": "denotes the obtained relation information.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 106, + 584, + 505, + 599 + ], + "spans": [ + { + "bbox": [ + 106, + 587, + 120, + 598 + ], + "score": 0.88, + "content": "i , j", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 585, + 435, + 599 + ], + "score": 1.0, + "content": "are the spatial indexes of an output position whose response is to be computed.", + "type": "text" + }, + { + "bbox": [ + 435, + 584, + 455, + 598 + ], + "score": 0.88, + "content": "i ^ { \\prime } , j ^ { \\prime }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 585, + 505, + 599 + ], + "score": 1.0, + "content": "are the spa-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 597, + 505, + 611 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 306, + 611 + ], + "score": 1.0, + "content": "tial indexes that enumerates all possible positions.", + "type": "text" + }, + { + "bbox": [ + 306, + 598, + 313, + 609 + ], + "score": 0.84, + "content": "f", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 597, + 505, + 611 + ], + "score": 1.0, + "content": "is a pairwise function for computing the relation", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 608, + 505, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 175, + 621 + ], + "score": 1.0, + "content": "of two pixels and", + "type": "text" + }, + { + "bbox": [ + 175, + 610, + 182, + 620 + ], + "score": 0.8, + "content": "g", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 608, + 505, + 621 + ], + "score": 1.0, + "content": "is an unary function for computing the representation of an individual pixel. Now,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 620, + 506, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 620, + 334, + 633 + ], + "score": 1.0, + "content": "we can introduce the proposed non-local distillation loss", + "type": "text" + }, + { + "bbox": [ + 335, + 620, + 362, + 631 + ], + "score": 0.91, + "content": "\\mathcal { L } _ { N L D }", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 620, + 389, + 633 + ], + "score": 1.0, + "content": "as the", + "type": "text" + }, + { + "bbox": [ + 390, + 620, + 402, + 631 + ], + "score": 0.87, + "content": "\\mathcal { L } _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 620, + 506, + 633 + ], + "score": 1.0, + "content": "loss between the relation", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 104, + 628, + 474, + 644 + ], + "spans": [ + { + "bbox": [ + 104, + 628, + 383, + 644 + ], + "score": 1.0, + "content": "information of the students and teachers, which can be formulated as", + "type": "text" + }, + { + "bbox": [ + 383, + 630, + 470, + 642 + ], + "score": 0.93, + "content": "\\mathcal { L } _ { N L D } = \\mathcal { L } _ { 2 } ( r ^ { S } , r ^ { T } )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 628, + 474, + 644 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 36, + "bbox_fs": [ + 104, + 533, + 507, + 644 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 656, + 247, + 668 + ], + "lines": [ + { + "bbox": [ + 105, + 655, + 248, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 248, + 669 + ], + "score": 1.0, + "content": "3.3 OVERALL LOSS FUNCTION", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 105, + 677, + 503, + 700 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 260, + 691 + ], + "score": 1.0, + "content": "We introduce three hyper-parameters", + "type": "text" + }, + { + "bbox": [ + 261, + 678, + 289, + 689 + ], + "score": 0.92, + "content": "\\alpha , \\beta , \\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 676, + 505, + 691 + ], + "score": 1.0, + "content": "to balance different distillation loss in our methods.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 689, + 303, + 700 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 303, + 700 + ], + "score": 1.0, + "content": "The overall distillation loss can be formulated as", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 105, + 676, + 505, + 700 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 705, + 417, + 723 + ], + "lines": [ + { + "bbox": [ + 186, + 705, + 417, + 723 + ], + "spans": [ + { + "bbox": [ + 186, + 705, + 417, + 723 + ], + "score": 0.87, + "content": "\\begin{array} { r } \\mathcal { L } _ { D i s t i l l } ( A ^ { \\mathcal { T } } , A ^ { \\mathcal { S } } ) = \\underbrace { \\alpha \\cdot \\mathcal { L } _ { A T } + \\beta \\cdot \\mathcal { L } _ { A M } } _ \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\end{array}", + "type": "interline_equation", + "image_path": "7152295a1c0eeade66848eaf3c970598352d6f66865d4ecb50c4a53b147cea17.jpg" + } + ] + } + ], + "index": 44, + "virtual_lines": [ + { + "bbox": [ + 186, + 705, + 417, + 723 + ], + "spans": [], + "index": 44 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 81, + 501, + 170 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 81, + 501, + 170 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 81, + 501, + 170 + ], + "spans": [ + { + "bbox": [ + 109, + 81, + 501, + 170 + ], + "score": 0.969, + "type": "image", + "image_path": "c2786986263c9ba41fd1a2ae5941b7a7b93eed5f9f4b273a6df235b3d2eb1e58.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 81, + 501, + 110.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 110.66666666666667, + 501, + 140.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 140.33333333333334, + 501, + 170.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 182, + 504, + 204 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 182, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 417, + 194 + ], + "score": 1.0, + "content": "Figure 4: Visualization and distribution of the spatial attention with different", + "type": "text" + }, + { + "bbox": [ + 417, + 182, + 426, + 192 + ], + "score": 0.59, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 182, + 492, + 194 + ], + "score": 1.0, + "content": ". With a smaller", + "type": "text" + }, + { + "bbox": [ + 493, + 182, + 501, + 192 + ], + "score": 0.71, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 182, + 505, + 194 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 192, + 434, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 434, + 205 + ], + "score": 1.0, + "content": "the pixels of high attention values are emphasized more in knowledge distillation.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "text", + "bbox": [ + 107, + 235, + 505, + 268 + ], + "lines": [ + { + "bbox": [ + 105, + 232, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 505, + 249 + ], + "score": 1.0, + "content": "The overall distillation loss is a model-agnostic loss, which can be added to the original training", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "score": 1.0, + "content": "loss of any detection model directly. The sensitivity study of each hyper-parameter and the ablation", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 257, + 372, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 372, + 270 + ], + "score": 1.0, + "content": "study of each loss are shown in Figure 5 and Table 4, respectively.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 108, + 295, + 194, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 196, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 196, + 310 + ], + "score": 1.0, + "content": "4 EXPERIMENT", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "title", + "bbox": [ + 108, + 327, + 238, + 338 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 240, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 240, + 340 + ], + "score": 1.0, + "content": "4.1 EXPERIMENTS SETTINGS", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 352, + 505, + 550 + ], + "lines": [ + { + "bbox": [ + 106, + 352, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 352, + 505, + 365 + ], + "score": 1.0, + "content": "The proposed knowledge distillation method is evaluated on MS COCO2017, which is a large-scale", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 212, + 376 + ], + "score": 1.0, + "content": "dataset that contains over", + "type": "text" + }, + { + "bbox": [ + 213, + 363, + 234, + 374 + ], + "score": 0.43, + "content": "1 2 0 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 363, + 505, + 376 + ], + "score": 1.0, + "content": "images spanning 80 categories (Lin et al., 2014). The benchmark", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 373, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 104, + 373, + 506, + 388 + ], + "score": 1.0, + "content": "detection networks are composed of both two-stage detection models, including Faster RCNN (Ren", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 385, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 398 + ], + "score": 1.0, + "content": "et al., 2015), Cascade RCNN (Cai & Vasconcelos, 2019), Dynamic RCNN (Zhang et al., 2020a),", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "score": 1.0, + "content": "Grid RCNN (Lu et al., 2019) and one-stage detection models, including the RetinaNet (Lin et al.,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 408, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 408, + 505, + 419 + ], + "score": 1.0, + "content": "2017), Fsaf RetinaNet (Zhu et al., 2019). Besides, we also evaluate our methods on the Mask", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 418, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 505, + 430 + ], + "score": 1.0, + "content": "RCNN(He et al., 2017), Cascade Mask RCNN (Cai & Vasconcelos, 2019), and anchor-free models", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 429, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 505, + 442 + ], + "score": 1.0, + "content": "- RepPoints (Yang et al., 2019). We adopt the ResNet50 and ResNet101 (He et al., 2016) as the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 438, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 104, + 438, + 506, + 454 + ], + "score": 1.0, + "content": "backbone network of each detection model. We pre-train the backbone model on ImageNet (Deng", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 451, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 505, + 464 + ], + "score": 1.0, + "content": "et al., 2009) and then finetune it on MS COCO2017. We have compared our methods with three", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 461, + 506, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 506, + 474 + ], + "score": 1.0, + "content": "kinds of object detection knowledge distillation methods (Chen et al., 2017; Wang et al., 2019; Heo", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "score": 1.0, + "content": "et al., 2019). All the experiments in this paper are implemented with PyTorch (Paszke et al., 2019)", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "with mmdetection2 framework (Chen et al., 2019). The reported fps is measured on one RTX 2080Ti", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 494, + 504, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 494, + 315, + 508 + ], + "score": 1.0, + "content": "GPU. We adopt the same hyper-parameters settings", + "type": "text" + }, + { + "bbox": [ + 315, + 494, + 399, + 506 + ], + "score": 0.75, + "content": "\\lbrace \\alpha = \\gamma = 7 ^ { ^ { \\circ } } \\times 1 0 ^ { - 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 494, + 401, + 508 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 401, + 494, + 504, + 507 + ], + "score": 0.67, + "content": "\\beta = 4 \\times 1 0 ^ { - 3 } , T = 0 . 1 \\}", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 504, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 104, + 504, + 241, + 520 + ], + "score": 1.0, + "content": "for all the two-stage models and", + "type": "text" + }, + { + "bbox": [ + 241, + 506, + 441, + 518 + ], + "score": 0.84, + "content": "\\left\\{ \\alpha = \\gamma = 4 \\times 1 0 ^ { - 4 } , \\beta = 2 \\times 1 0 ^ { - 2 } , T = 0 . 5 \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 504, + 506, + 520 + ], + "score": 1.0, + "content": "for all the one-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "score": 1.0, + "content": "stage models. Cascade Mask RCNN with ResNeXt101 backbone is utilized as the teacher for all the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "score": 1.0, + "content": "two-stage students and RetinaNet with ResNeXt101 backbone is utilized as the teacher for all the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 539, + 393, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 539, + 393, + 550 + ], + "score": 1.0, + "content": "one-stage students. Please refer to the codes in Github for more details.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 108, + 575, + 229, + 586 + ], + "lines": [ + { + "bbox": [ + 106, + 574, + 230, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 230, + 587 + ], + "score": 1.0, + "content": "4.2 EXPERIMENT RESULTS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "In this section, we show the experiment results of the baseline detectors and our models in Table 1", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "score": 1.0, + "content": "and Table 2, and compare our methods with other three knowledge distillation methods in Table 3.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "score": 1.0, + "content": "It is observed that: (i) Consistent and significant AP boost can be observed on all the 9 kinds of", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 633, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 506, + 645 + ], + "score": 1.0, + "content": "detectors. On average, there are 2.9, 2.9, and 2.2 AP improvements on the two-stage, one-stage, and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 644, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 656 + ], + "score": 1.0, + "content": "anchor-free detectors, respectively. (ii) With the proposed method, a student model with ResNet50", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 394, + 667 + ], + "score": 1.0, + "content": "backbone can outperform the same model with ResNet101 backbone by", + "type": "text" + }, + { + "bbox": [ + 395, + 655, + 424, + 666 + ], + "score": 0.35, + "content": "1 . 2 \\mathrm { A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "on average. (iii) On", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "Mask RCNN related models, there are 2.3 improvements on bounding box AP and 2.0 improvements", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "on mask AP on average respectively, indicating the proposed method can be utilized in not only", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "object detection but also instance segmentation. (iv) Our methods achieve 2.2 higher AP than the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "second-best distillation method, on average. (v) There are 2.7 and 2.9 AP improvements on models", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "with ResNet50 and ResNet101 backbones, respectively, indicating that deeper detectors benefit more", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 721, + 222, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 222, + 733 + ], + "score": 1.0, + "content": "from knowledge distillation.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 34.5 + } + ], + "page_idx": 4, + "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, + 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, + 81, + 501, + 170 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 81, + 501, + 170 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 81, + 501, + 170 + ], + "spans": [ + { + "bbox": [ + 109, + 81, + 501, + 170 + ], + "score": 0.969, + "type": "image", + "image_path": "c2786986263c9ba41fd1a2ae5941b7a7b93eed5f9f4b273a6df235b3d2eb1e58.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 81, + 501, + 110.66666666666667 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 110.66666666666667, + 501, + 140.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 140.33333333333334, + 501, + 170.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 105, + 182, + 504, + 204 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 182, + 505, + 194 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 417, + 194 + ], + "score": 1.0, + "content": "Figure 4: Visualization and distribution of the spatial attention with different", + "type": "text" + }, + { + "bbox": [ + 417, + 182, + 426, + 192 + ], + "score": 0.59, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 182, + 492, + 194 + ], + "score": 1.0, + "content": ". With a smaller", + "type": "text" + }, + { + "bbox": [ + 493, + 182, + 501, + 192 + ], + "score": 0.71, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 182, + 505, + 194 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 192, + 434, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 434, + 205 + ], + "score": 1.0, + "content": "the pixels of high attention values are emphasized more in knowledge distillation.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "text", + "bbox": [ + 107, + 235, + 505, + 268 + ], + "lines": [ + { + "bbox": [ + 105, + 232, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 232, + 505, + 249 + ], + "score": 1.0, + "content": "The overall distillation loss is a model-agnostic loss, which can be added to the original training", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "spans": [ + { + "bbox": [ + 106, + 246, + 505, + 258 + ], + "score": 1.0, + "content": "loss of any detection model directly. The sensitivity study of each hyper-parameter and the ablation", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 257, + 372, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 372, + 270 + ], + "score": 1.0, + "content": "study of each loss are shown in Figure 5 and Table 4, respectively.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 232, + 505, + 270 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 295, + 194, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 294, + 196, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 294, + 196, + 310 + ], + "score": 1.0, + "content": "4 EXPERIMENT", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "title", + "bbox": [ + 108, + 327, + 238, + 338 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 240, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 240, + 340 + ], + "score": 1.0, + "content": "4.1 EXPERIMENTS SETTINGS", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 352, + 505, + 550 + ], + "lines": [ + { + "bbox": [ + 106, + 352, + 505, + 365 + ], + "spans": [ + { + "bbox": [ + 106, + 352, + 505, + 365 + ], + "score": 1.0, + "content": "The proposed knowledge distillation method is evaluated on MS COCO2017, which is a large-scale", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 363, + 505, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 363, + 212, + 376 + ], + "score": 1.0, + "content": "dataset that contains over", + "type": "text" + }, + { + "bbox": [ + 213, + 363, + 234, + 374 + ], + "score": 0.43, + "content": "1 2 0 \\mathrm { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 363, + 505, + 376 + ], + "score": 1.0, + "content": "images spanning 80 categories (Lin et al., 2014). The benchmark", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 373, + 506, + 388 + ], + "spans": [ + { + "bbox": [ + 104, + 373, + 506, + 388 + ], + "score": 1.0, + "content": "detection networks are composed of both two-stage detection models, including Faster RCNN (Ren", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 385, + 505, + 398 + ], + "spans": [ + { + "bbox": [ + 105, + 385, + 505, + 398 + ], + "score": 1.0, + "content": "et al., 2015), Cascade RCNN (Cai & Vasconcelos, 2019), Dynamic RCNN (Zhang et al., 2020a),", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 505, + 408 + ], + "score": 1.0, + "content": "Grid RCNN (Lu et al., 2019) and one-stage detection models, including the RetinaNet (Lin et al.,", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 408, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 408, + 505, + 419 + ], + "score": 1.0, + "content": "2017), Fsaf RetinaNet (Zhu et al., 2019). Besides, we also evaluate our methods on the Mask", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 418, + 505, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 505, + 430 + ], + "score": 1.0, + "content": "RCNN(He et al., 2017), Cascade Mask RCNN (Cai & Vasconcelos, 2019), and anchor-free models", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 429, + 505, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 429, + 505, + 442 + ], + "score": 1.0, + "content": "- RepPoints (Yang et al., 2019). We adopt the ResNet50 and ResNet101 (He et al., 2016) as the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 104, + 438, + 506, + 454 + ], + "spans": [ + { + "bbox": [ + 104, + 438, + 506, + 454 + ], + "score": 1.0, + "content": "backbone network of each detection model. We pre-train the backbone model on ImageNet (Deng", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 451, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 451, + 505, + 464 + ], + "score": 1.0, + "content": "et al., 2009) and then finetune it on MS COCO2017. We have compared our methods with three", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 461, + 506, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 461, + 506, + 474 + ], + "score": 1.0, + "content": "kinds of object detection knowledge distillation methods (Chen et al., 2017; Wang et al., 2019; Heo", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 487 + ], + "score": 1.0, + "content": "et al., 2019). All the experiments in this paper are implemented with PyTorch (Paszke et al., 2019)", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "with mmdetection2 framework (Chen et al., 2019). The reported fps is measured on one RTX 2080Ti", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 494, + 504, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 494, + 315, + 508 + ], + "score": 1.0, + "content": "GPU. We adopt the same hyper-parameters settings", + "type": "text" + }, + { + "bbox": [ + 315, + 494, + 399, + 506 + ], + "score": 0.75, + "content": "\\lbrace \\alpha = \\gamma = 7 ^ { ^ { \\circ } } \\times 1 0 ^ { - 5 }", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 494, + 401, + 508 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 401, + 494, + 504, + 507 + ], + "score": 0.67, + "content": "\\beta = 4 \\times 1 0 ^ { - 3 } , T = 0 . 1 \\}", + "type": "inline_equation" + } + ], + "index": 23 + }, + { + "bbox": [ + 104, + 504, + 506, + 520 + ], + "spans": [ + { + "bbox": [ + 104, + 504, + 241, + 520 + ], + "score": 1.0, + "content": "for all the two-stage models and", + "type": "text" + }, + { + "bbox": [ + 241, + 506, + 441, + 518 + ], + "score": 0.84, + "content": "\\left\\{ \\alpha = \\gamma = 4 \\times 1 0 ^ { - 4 } , \\beta = 2 \\times 1 0 ^ { - 2 } , T = 0 . 5 \\right\\}", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 504, + 506, + 520 + ], + "score": 1.0, + "content": "for all the one-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 516, + 505, + 529 + ], + "score": 1.0, + "content": "stage models. Cascade Mask RCNN with ResNeXt101 backbone is utilized as the teacher for all the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "spans": [ + { + "bbox": [ + 105, + 528, + 506, + 540 + ], + "score": 1.0, + "content": "two-stage students and RetinaNet with ResNeXt101 backbone is utilized as the teacher for all the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 539, + 393, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 539, + 393, + 550 + ], + "score": 1.0, + "content": "one-stage students. Please refer to the codes in Github for more details.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 18.5, + "bbox_fs": [ + 104, + 352, + 506, + 550 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 575, + 229, + 586 + ], + "lines": [ + { + "bbox": [ + 106, + 574, + 230, + 587 + ], + "spans": [ + { + "bbox": [ + 106, + 574, + 230, + 587 + ], + "score": 1.0, + "content": "4.2 EXPERIMENT RESULTS", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 106, + 600, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 600, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 600, + 505, + 612 + ], + "score": 1.0, + "content": "In this section, we show the experiment results of the baseline detectors and our models in Table 1", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 105, + 611, + 506, + 623 + ], + "score": 1.0, + "content": "and Table 2, and compare our methods with other three knowledge distillation methods in Table 3.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "spans": [ + { + "bbox": [ + 105, + 621, + 506, + 635 + ], + "score": 1.0, + "content": "It is observed that: (i) Consistent and significant AP boost can be observed on all the 9 kinds of", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 106, + 633, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 106, + 633, + 506, + 645 + ], + "score": 1.0, + "content": "detectors. On average, there are 2.9, 2.9, and 2.2 AP improvements on the two-stage, one-stage, and", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 644, + 506, + 656 + ], + "spans": [ + { + "bbox": [ + 105, + 644, + 506, + 656 + ], + "score": 1.0, + "content": "anchor-free detectors, respectively. (ii) With the proposed method, a student model with ResNet50", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 655, + 505, + 667 + ], + "spans": [ + { + "bbox": [ + 105, + 655, + 394, + 667 + ], + "score": 1.0, + "content": "backbone can outperform the same model with ResNet101 backbone by", + "type": "text" + }, + { + "bbox": [ + 395, + 655, + 424, + 666 + ], + "score": 0.35, + "content": "1 . 2 \\mathrm { A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 424, + 655, + 505, + 667 + ], + "score": 1.0, + "content": "on average. (iii) On", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "spans": [ + { + "bbox": [ + 105, + 666, + 505, + 678 + ], + "score": 1.0, + "content": "Mask RCNN related models, there are 2.3 improvements on bounding box AP and 2.0 improvements", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "score": 1.0, + "content": "on mask AP on average respectively, indicating the proposed method can be utilized in not only", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 688, + 505, + 700 + ], + "score": 1.0, + "content": "object detection but also instance segmentation. (iv) Our methods achieve 2.2 higher AP than the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "second-best distillation method, on average. (v) There are 2.7 and 2.9 AP improvements on models", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 506, + 723 + ], + "score": 1.0, + "content": "with ResNet50 and ResNet101 backbones, respectively, indicating that deeper detectors benefit more", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 721, + 222, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 222, + 733 + ], + "score": 1.0, + "content": "from knowledge distillation.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 600, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 122, + 100, + 491, + 461 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 145, + 89, + 465, + 100 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 144, + 88, + 466, + 102 + ], + "spans": [ + { + "bbox": [ + 144, + 88, + 466, + 102 + ], + "score": 1.0, + "content": "Table 1: Experiments on MS COCO2017 with the proposed distillation method.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 122, + 100, + 491, + 461 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 122, + 100, + 491, + 461 + ], + "spans": [ + { + "bbox": [ + 122, + 100, + 491, + 461 + ], + "score": 0.984, + "html": "
ModelBackboneAPAP50AP75APsAPMAPLFPSParams
Faster RCNNResNet5038.459.042.021.542.150.318.143.57
Our Faster RCNNResNet5041.562.245.123.545.055.318.143.57
Faster RCNNResNet10139.860.143.322.543.652.814.262.57
Our Faster RCNNResNet10143.964.248.125.348.058.714.262.57
Cascade RCNNResNet5041.059.444.422.744.454.315.471.22
Our Cascade RCNNResNet5044.462.748.324.848.059.315.471.22
Cascade RCNNResNet10142.560.746.423.546.556.411.790.21
Our Cascade RCNNResNet10145.263.549.426.248.760.811.790.21
Dynamic RCNNResNet5039.858.343.223.042.852.418.143.57
Our Dynamic RCNNResNet5042.861.247.023.946.257.718.143.57
Dynamic RCNNResNet10141.259.745.324.044.954.314.262.57
Our Dynamic RCNNResNet10144.863.048.925.048.960.414.262.57
Grid RCNNResNet5040.458.443.622.843.953.314.066.37
Our Grid RCNNResNet5042.661.146.124.246.655.814.066.37
Grid RCNNResNet10141.659.845.023.745.754.711.085.36
Our Grid RCNNResNet10144.863.648.926.548.959.611.085.36
RetinaNetResNet5037.456.739.620.040.749.717.737.74
Our RetinaNetResNet5039.658.842.122.743.352.517.737.74
RetinaNetResNet10138.958.041.521.042.852.413.556.74
Our RetinaNetResNet10141.360.844.322.746.055.213.556.74
Fsaf RetinaNet Our Fsaf RetinaNetResNet5037.856.839.820.441.148.820.036.19
ResNet5041.461.044.223.145.255.220.036.19
Fsaf RetinaNetResNet10139.358.642.122.143.451.215.055.19
Our Fsaf RetinaNetResNet10142.662.045.524.547.056.215.055.19
RepPointsResNet5038.659.641.622.542.250.418.236.62
Our RepPointsResNet5040.661.743.823.444.653.018.236.62
RepPointsResNet10140.561.343.523.444.753.213.255.62
Our RepPointsResNet10142.7
63.746.424.947.256.413.255.62
", + "type": "table", + "image_path": "7afd901d12dbb78ac00bac49d459cd830454bdf1bd098f4519b72c982fa6042e.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 122, + 100, + 491, + 220.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 122, + 220.33333333333331, + 491, + 340.66666666666663 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 122, + 340.66666666666663, + 491, + 460.99999999999994 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "table", + "bbox": [ + 130, + 501, + 481, + 626 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 113, + 488, + 497, + 500 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 111, + 487, + 498, + 501 + ], + "spans": [ + { + "bbox": [ + 111, + 487, + 498, + 501 + ], + "score": 1.0, + "content": "Table 2: Experiments on MS COCO2017 with the proposed distillation method on Mask RCNN.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "table_body", + "bbox": [ + 130, + 501, + 481, + 626 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 130, + 501, + 481, + 626 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 481, + 626 + ], + "score": 0.983, + "html": "
ModelBackboneBounding box APMask AP
APAPsAPMAPLAPAPsAPMAPL
Mask RCNNResNet5039.222.942.651.235.419.138.648.4
Our mask RCNNResNet5041.723.445.355.837.419.740.552.1
Mask RCNNResNet10140.823.045.054.136.619.240.250.5
Our Mask RCNNResNet10143.024.747.257.138.720.742.353.3
Cascade Mask RCNNResNet5041.923.244.955.936.518.939.250.7
Our Cascade Mask RCNNResNet5043.824.947.258.438.020.240.952.8
CascadeMask RCNNResNet10142.924.446.557.037.319.740.651.5
Our Cascade Mask RCNNResNet10145.426.349.060.939.621.342.855.0
", + "type": "table", + "image_path": "bba8b8d0b96c113302029a6fe21c551b3197abfd12f28a9a97bb6d2c6a1df018.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 130, + 501, + 481, + 542.6666666666666 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 130, + 542.6666666666666, + 481, + 584.3333333333333 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 130, + 584.3333333333333, + 481, + 625.9999999999999 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 5.0 + }, + { + "type": "title", + "bbox": [ + 107, + 654, + 320, + 666 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 321, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 321, + 667 + ], + "score": 1.0, + "content": "4.3 ABLATION STUDY AND SENSITIVITY STUDY", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 675, + 504, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 482, + 691 + ], + "score": 1.0, + "content": "Ablation study. Table 4 shows the ablation study of the proposed attention-guided distillation", + "type": "text" + }, + { + "bbox": [ + 482, + 677, + 504, + 688 + ], + "score": 0.84, + "content": "( { \\mathcal { L } } _ { A T }", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 124, + 700 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 688, + 147, + 699 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 687, + 256, + 700 + ], + "score": 1.0, + "content": ") and non-local distillation", + "type": "text" + }, + { + "bbox": [ + 256, + 688, + 290, + 699 + ], + "score": 0.88, + "content": "( \\mathcal { L } _ { N L D } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 687, + 505, + 700 + ], + "score": 1.0, + "content": ". It is observed that: (i) Attention-guided distillation", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 696, + 504, + 713 + ], + "spans": [ + { + "bbox": [ + 104, + 696, + 276, + 713 + ], + "score": 1.0, + "content": "and non-local distillation lead to 2.8 and", + "type": "text" + }, + { + "bbox": [ + 276, + 699, + 306, + 709 + ], + "score": 0.3, + "content": "1 . 4 ~ \\mathrm { A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 696, + 440, + 713 + ], + "score": 1.0, + "content": "improvements, respectively. (ii)", + "type": "text" + }, + { + "bbox": [ + 441, + 699, + 461, + 710 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { A T }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 696, + 480, + 713 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 481, + 699, + 504, + 710 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 168, + 722 + ], + "score": 1.0, + "content": "lead to 1.2 and", + "type": "text" + }, + { + "bbox": [ + 168, + 710, + 198, + 720 + ], + "score": 0.42, + "content": "2 . 4 \\ : \\mathrm { A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "improvements respectively, indicating that most of the benefits of attention-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 451, + 734 + ], + "score": 1.0, + "content": "guided distillation are obtained from the feature loss masked by the attention maps", + "type": "text" + }, + { + "bbox": [ + 451, + 721, + 480, + 732 + ], + "score": 0.9, + "content": "( \\mathcal { L } _ { A M } )", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 720, + 505, + 734 + ], + "score": 1.0, + "content": ". (iii)", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + } + ], + "page_idx": 5, + "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": [ + 302, + 751, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 310, + 762 + ], + "score": 1.0, + "content": "6", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 122, + 100, + 491, + 461 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 145, + 89, + 465, + 100 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 144, + 88, + 466, + 102 + ], + "spans": [ + { + "bbox": [ + 144, + 88, + 466, + 102 + ], + "score": 1.0, + "content": "Table 1: Experiments on MS COCO2017 with the proposed distillation method.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 122, + 100, + 491, + 461 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 122, + 100, + 491, + 461 + ], + "spans": [ + { + "bbox": [ + 122, + 100, + 491, + 461 + ], + "score": 0.984, + "html": "
ModelBackboneAPAP50AP75APsAPMAPLFPSParams
Faster RCNNResNet5038.459.042.021.542.150.318.143.57
Our Faster RCNNResNet5041.562.245.123.545.055.318.143.57
Faster RCNNResNet10139.860.143.322.543.652.814.262.57
Our Faster RCNNResNet10143.964.248.125.348.058.714.262.57
Cascade RCNNResNet5041.059.444.422.744.454.315.471.22
Our Cascade RCNNResNet5044.462.748.324.848.059.315.471.22
Cascade RCNNResNet10142.560.746.423.546.556.411.790.21
Our Cascade RCNNResNet10145.263.549.426.248.760.811.790.21
Dynamic RCNNResNet5039.858.343.223.042.852.418.143.57
Our Dynamic RCNNResNet5042.861.247.023.946.257.718.143.57
Dynamic RCNNResNet10141.259.745.324.044.954.314.262.57
Our Dynamic RCNNResNet10144.863.048.925.048.960.414.262.57
Grid RCNNResNet5040.458.443.622.843.953.314.066.37
Our Grid RCNNResNet5042.661.146.124.246.655.814.066.37
Grid RCNNResNet10141.659.845.023.745.754.711.085.36
Our Grid RCNNResNet10144.863.648.926.548.959.611.085.36
RetinaNetResNet5037.456.739.620.040.749.717.737.74
Our RetinaNetResNet5039.658.842.122.743.352.517.737.74
RetinaNetResNet10138.958.041.521.042.852.413.556.74
Our RetinaNetResNet10141.360.844.322.746.055.213.556.74
Fsaf RetinaNet Our Fsaf RetinaNetResNet5037.856.839.820.441.148.820.036.19
ResNet5041.461.044.223.145.255.220.036.19
Fsaf RetinaNetResNet10139.358.642.122.143.451.215.055.19
Our Fsaf RetinaNetResNet10142.662.045.524.547.056.215.055.19
RepPointsResNet5038.659.641.622.542.250.418.236.62
Our RepPointsResNet5040.661.743.823.444.653.018.236.62
RepPointsResNet10140.561.343.523.444.753.213.255.62
Our RepPointsResNet10142.7
63.746.424.947.256.413.255.62
", + "type": "table", + "image_path": "7afd901d12dbb78ac00bac49d459cd830454bdf1bd098f4519b72c982fa6042e.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 122, + 100, + 491, + 220.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 122, + 220.33333333333331, + 491, + 340.66666666666663 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 122, + 340.66666666666663, + 491, + 460.99999999999994 + ], + "spans": [], + "index": 3 + } + ] + } + ], + "index": 1.0 + }, + { + "type": "table", + "bbox": [ + 130, + 501, + 481, + 626 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 113, + 488, + 497, + 500 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 111, + 487, + 498, + 501 + ], + "spans": [ + { + "bbox": [ + 111, + 487, + 498, + 501 + ], + "score": 1.0, + "content": "Table 2: Experiments on MS COCO2017 with the proposed distillation method on Mask RCNN.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "table_body", + "bbox": [ + 130, + 501, + 481, + 626 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 130, + 501, + 481, + 626 + ], + "spans": [ + { + "bbox": [ + 130, + 501, + 481, + 626 + ], + "score": 0.983, + "html": "
ModelBackboneBounding box APMask AP
APAPsAPMAPLAPAPsAPMAPL
Mask RCNNResNet5039.222.942.651.235.419.138.648.4
Our mask RCNNResNet5041.723.445.355.837.419.740.552.1
Mask RCNNResNet10140.823.045.054.136.619.240.250.5
Our Mask RCNNResNet10143.024.747.257.138.720.742.353.3
Cascade Mask RCNNResNet5041.923.244.955.936.518.939.250.7
Our Cascade Mask RCNNResNet5043.824.947.258.438.020.240.952.8
CascadeMask RCNNResNet10142.924.446.557.037.319.740.651.5
Our Cascade Mask RCNNResNet10145.426.349.060.939.621.342.855.0
", + "type": "table", + "image_path": "bba8b8d0b96c113302029a6fe21c551b3197abfd12f28a9a97bb6d2c6a1df018.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 130, + 501, + 481, + 542.6666666666666 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 130, + 542.6666666666666, + 481, + 584.3333333333333 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 130, + 584.3333333333333, + 481, + 625.9999999999999 + ], + "spans": [], + "index": 7 + } + ] + } + ], + "index": 5.0 + }, + { + "type": "title", + "bbox": [ + 107, + 654, + 320, + 666 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 321, + 667 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 321, + 667 + ], + "score": 1.0, + "content": "4.3 ABLATION STUDY AND SENSITIVITY STUDY", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 675, + 504, + 691 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 482, + 691 + ], + "score": 1.0, + "content": "Ablation study. Table 4 shows the ablation study of the proposed attention-guided distillation", + "type": "text" + }, + { + "bbox": [ + 482, + 677, + 504, + 688 + ], + "score": 0.84, + "content": "( { \\mathcal { L } } _ { A T }", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 124, + 700 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 124, + 688, + 147, + 699 + ], + "score": 0.89, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 687, + 256, + 700 + ], + "score": 1.0, + "content": ") and non-local distillation", + "type": "text" + }, + { + "bbox": [ + 256, + 688, + 290, + 699 + ], + "score": 0.88, + "content": "( \\mathcal { L } _ { N L D } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 687, + 505, + 700 + ], + "score": 1.0, + "content": ". It is observed that: (i) Attention-guided distillation", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 696, + 504, + 713 + ], + "spans": [ + { + "bbox": [ + 104, + 696, + 276, + 713 + ], + "score": 1.0, + "content": "and non-local distillation lead to 2.8 and", + "type": "text" + }, + { + "bbox": [ + 276, + 699, + 306, + 709 + ], + "score": 0.3, + "content": "1 . 4 ~ \\mathrm { A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 696, + 440, + 713 + ], + "score": 1.0, + "content": "improvements, respectively. (ii)", + "type": "text" + }, + { + "bbox": [ + 441, + 699, + 461, + 710 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { A T }", + "type": "inline_equation" + }, + { + "bbox": [ + 462, + 696, + 480, + 713 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 481, + 699, + 504, + 710 + ], + "score": 0.9, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 168, + 722 + ], + "score": 1.0, + "content": "lead to 1.2 and", + "type": "text" + }, + { + "bbox": [ + 168, + 710, + 198, + 720 + ], + "score": 0.42, + "content": "2 . 4 \\ : \\mathrm { A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "improvements respectively, indicating that most of the benefits of attention-", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 451, + 734 + ], + "score": 1.0, + "content": "guided distillation are obtained from the feature loss masked by the attention maps", + "type": "text" + }, + { + "bbox": [ + 451, + 721, + 480, + 732 + ], + "score": 0.9, + "content": "( \\mathcal { L } _ { A M } )", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 720, + 505, + 734 + ], + "score": 1.0, + "content": ". (iii)", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11, + "bbox_fs": [ + 104, + 675, + 505, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 127 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "There are 3.1 AP improvements with the combination of attention-guided distillation and non-local", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 105 + ], + "score": 1.0, + "content": "distillation. These observations indicate that each distillation loss in our methods has their individual", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "effectiveness and they can be utilized together to achieve better performance. We also give an", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 370, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 115, + 370, + 127 + ], + "score": 1.0, + "content": "ablation study to the spatial and channel attention in Appendix A.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "text", + "bbox": [ + 106, + 132, + 505, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 131, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 493, + 146 + ], + "score": 1.0, + "content": "Sensitivity study on hyper-parameters. Four hyper-parameters are introduced in this paper.", + "type": "text" + }, + { + "bbox": [ + 493, + 135, + 501, + 142 + ], + "score": 0.59, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 131, + 506, + 146 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 114, + 155 + ], + "score": 0.82, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 144, + 137, + 156 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 137, + 145, + 145, + 155 + ], + "score": 0.81, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 144, + 439, + 156 + ], + "score": 1.0, + "content": "are utilized to balance the magnitude of different distillation loss and", + "type": "text" + }, + { + "bbox": [ + 439, + 144, + 448, + 153 + ], + "score": 0.79, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 144, + 506, + 156 + ], + "score": 1.0, + "content": "is utilized to", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "adjust the distribution of attention masks. The hyper-parameter sensitivity study on MS COCO2017", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "score": 1.0, + "content": "with Faster RCNN (ResNet50 backbone) is introduced in Figure 5. It is observed that the worst", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "score": 1.0, + "content": "hyper-parameters only lead to 0.3 AP drop compared with the highest AP, which is still 2.9 higher", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 187, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 187, + 506, + 200 + ], + "score": 1.0, + "content": "compared with the baseline model, indicating that our methods are not sensitive to the choice of", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 200, + 180, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 180, + 211 + ], + "score": 1.0, + "content": "hyper-parameters.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 107, + 214, + 505, + 270 + ], + "lines": [ + { + "bbox": [ + 106, + 215, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 215, + 505, + 227 + ], + "score": 1.0, + "content": "Sensitivity study on the types of non-local modules. There are four kinds of non-local modules,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 226, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 226, + 505, + 238 + ], + "score": 1.0, + "content": "including Gaussian, embedded Gaussian, dot production, and concatenation. Table 5 shows the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 506, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 506, + 249 + ], + "score": 1.0, + "content": "performance of our methods with different types of non-local modules. It is observed that the worst", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 247, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 505, + 261 + ], + "score": 1.0, + "content": "non-local type (Gaussian) is only 0.2 AP lower than the best non-local type (Embedded Gaussian", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 259, + 493, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 493, + 272 + ], + "score": 1.0, + "content": "and Concatenation), indicating our methods are not sensitive to the choice of non-local modules.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13 + }, + { + "type": "table", + "bbox": [ + 162, + 325, + 449, + 499 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 290, + 502, + 324 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 291, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 505, + 302 + ], + "score": 1.0, + "content": "Table 3: Comparison between our methods and other distillation methods. Note that we don’t", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "compare our methods with Chen’s and Wang’s methods on RetinaNet because their methods can not", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 313, + 438, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 438, + 325 + ], + "score": 1.0, + "content": "be utilized in one-stage models. ResNet50 is utilized as backbone in these models.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "table_body", + "bbox": [ + 162, + 325, + 449, + 499 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 162, + 325, + 449, + 499 + ], + "spans": [ + { + "bbox": [ + 162, + 325, + 449, + 499 + ], + "score": 0.984, + "html": "
ModelAPAP50 AP75APs 21.5APMAPL
Faster RCNN + Chen etal.Method + Wang et al. Method + Heo et al. Method + Our Methods38.4 38.7 39.1 38.9 41.559.0 59.0 59.8 60.1 62.242.0 42.1 22.0 42.8 22.2 42.6 21.8 45.1 23.542.1 41.9 42.9 42.7 45.050.3 51.0 51.1 50.7 55.3
Cascade RCNN + Chen et al.Method + Wang et al. Method +Heo etal.Method + Our Methods41.0 41.6 42.1 41.7 44.459.4 62.1 62.7 62.3 62.744.4 45.7 46.1 45.7 48.322.7 23.9 24.4 23.9 24.844.4 54.3 45.8 54.7 46.4 55.6 45.7 55.3 48.0 59.3
RetinaNet + Heo et al. Method + Our Methods37.4 37.8 39.656.7 58.3 58.839.6 41.1 21.6 42.1 22.720.0 40.7 41.2 43.349.7 48.3 52.5
", + "type": "table", + "image_path": "8ada90f305f21d053afc3f09be6190d829f42a58fc2c2054a755bac754502548.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 162, + 325, + 449, + 383.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 162, + 383.0, + 449, + 441.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 162, + 441.0, + 449, + 499.0 + ], + "spans": [], + "index": 21 + } + ] + } + ], + "index": 18.5 + }, + { + "type": "table", + "bbox": [ + 121, + 543, + 372, + 632 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 141, + 531, + 351, + 542 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 141, + 531, + 351, + 544 + ], + "spans": [ + { + "bbox": [ + 141, + 531, + 351, + 544 + ], + "score": 1.0, + "content": "Table 4: Ablation study of the three distillation loss.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "table_body", + "bbox": [ + 121, + 543, + 372, + 632 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 121, + 543, + 372, + 632 + ], + "spans": [ + { + "bbox": [ + 121, + 543, + 372, + 632 + ], + "score": 0.98, + "html": "
LossLAT LAM LNLD× × ×√ × ×× √ ×× × √√ √ ×√ 1 √
ResultAP APs38.439.640.839.841.241.5
APM21.522.722.822.723.023.5
APL42.1 50.342.9 52.544.3 54.343.1 52.344.6 55.345.0 55.3
", + "type": "table", + "image_path": "3df24046f01c2245e58cdfc95f7939dbde91ce534aee57f3a68ed22dca7537de.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 121, + 543, + 372, + 572.6666666666666 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 121, + 572.6666666666666, + 372, + 602.3333333333333 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 121, + 602.3333333333333, + 372, + 631.9999999999999 + ], + "spans": [], + "index": 30 + } + ] + } + ], + "index": 25.0 + }, + { + "type": "table", + "bbox": [ + 385, + 570, + 511, + 637 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 385, + 526, + 504, + 570 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 385, + 526, + 504, + 537 + ], + "spans": [ + { + "bbox": [ + 385, + 526, + 504, + 537 + ], + "score": 1.0, + "content": "Table 5: Results of different", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 385, + 537, + 504, + 548 + ], + "spans": [ + { + "bbox": [ + 385, + 537, + 504, + 548 + ], + "score": 1.0, + "content": "types of non-local modules", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 385, + 548, + 504, + 559 + ], + "spans": [ + { + "bbox": [ + 385, + 548, + 504, + 559 + ], + "score": 1.0, + "content": "on Faster RCNN (ResNet50", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 384, + 558, + 434, + 572 + ], + "spans": [ + { + "bbox": [ + 384, + 558, + 434, + 572 + ], + "score": 1.0, + "content": "backbone).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25.0 + }, + { + "type": "table_body", + "bbox": [ + 385, + 570, + 511, + 637 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 385, + 570, + 511, + 637 + ], + "spans": [ + { + "bbox": [ + 385, + 570, + 511, + 637 + ], + "score": 0.975, + "html": "
Non-Local TypeAP
Embedded Gaussian41.5
Dot Production41.4
Concatenation41.5
Gaussian41.3
", + "type": "table", + "image_path": "875df1a66b49b4b986d95d9f4909a276a2cf568ddcdc303eae32561afb676f90.jpg" + } + ] + } + ], + "index": 30.0, + "virtual_lines": [ + { + "bbox": [ + 385, + 570, + 511, + 603.5 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 385, + 603.5, + 511, + 637.0 + ], + "spans": [], + "index": 31 + } + ] + } + ], + "index": 27.5 + }, + { + "type": "title", + "bbox": [ + 107, + 651, + 191, + 664 + ], + "lines": [ + { + "bbox": [ + 104, + 649, + 192, + 668 + ], + "spans": [ + { + "bbox": [ + 104, + 649, + 192, + 668 + ], + "score": 1.0, + "content": "5 DISCUSSION", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "title", + "bbox": [ + 107, + 677, + 391, + 689 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 393, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 393, + 690 + ], + "score": 1.0, + "content": "5.1 ANALYSIS ON THE BENEFITS OF KNOWLEDGE DISTILLATION", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 108, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "Qualitative analysis. Figure 6 shows the comparison of detection results between a baseline and a", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "distilled detector. It is observed that: (i) Our methods improve the detection ability on small-objects.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "In the first three figures, the distilled model can correctly detect cars, the handbag, and the person in", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + } + ], + "page_idx": 6, + "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, + 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": [ + 107, + 82, + 504, + 127 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 94 + ], + "score": 1.0, + "content": "There are 3.1 AP improvements with the combination of attention-guided distillation and non-local", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 105 + ], + "score": 1.0, + "content": "distillation. These observations indicate that each distillation loss in our methods has their individual", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 505, + 117 + ], + "score": 1.0, + "content": "effectiveness and they can be utilized together to achieve better performance. We also give an", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 106, + 115, + 370, + 127 + ], + "spans": [ + { + "bbox": [ + 106, + 115, + 370, + 127 + ], + "score": 1.0, + "content": "ablation study to the spatial and channel attention in Appendix A.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5, + "bbox_fs": [ + 105, + 82, + 505, + 127 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 132, + 505, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 131, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 131, + 493, + 146 + ], + "score": 1.0, + "content": "Sensitivity study on hyper-parameters. Four hyper-parameters are introduced in this paper.", + "type": "text" + }, + { + "bbox": [ + 493, + 135, + 501, + 142 + ], + "score": 0.59, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 131, + 506, + 146 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 144, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 114, + 155 + ], + "score": 0.82, + "content": "\\beta", + "type": "inline_equation" + }, + { + "bbox": [ + 114, + 144, + 137, + 156 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 137, + 145, + 145, + 155 + ], + "score": 0.81, + "content": "\\gamma", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 144, + 439, + 156 + ], + "score": 1.0, + "content": "are utilized to balance the magnitude of different distillation loss and", + "type": "text" + }, + { + "bbox": [ + 439, + 144, + 448, + 153 + ], + "score": 0.79, + "content": "T", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 144, + 506, + 156 + ], + "score": 1.0, + "content": "is utilized to", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "adjust the distribution of attention masks. The hyper-parameter sensitivity study on MS COCO2017", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "spans": [ + { + "bbox": [ + 106, + 166, + 505, + 177 + ], + "score": 1.0, + "content": "with Faster RCNN (ResNet50 backbone) is introduced in Figure 5. It is observed that the worst", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "score": 1.0, + "content": "hyper-parameters only lead to 0.3 AP drop compared with the highest AP, which is still 2.9 higher", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 187, + 506, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 187, + 506, + 200 + ], + "score": 1.0, + "content": "compared with the baseline model, indicating that our methods are not sensitive to the choice of", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 200, + 180, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 200, + 180, + 211 + ], + "score": 1.0, + "content": "hyper-parameters.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7, + "bbox_fs": [ + 104, + 131, + 506, + 211 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 214, + 505, + 270 + ], + "lines": [ + { + "bbox": [ + 106, + 215, + 505, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 215, + 505, + 227 + ], + "score": 1.0, + "content": "Sensitivity study on the types of non-local modules. There are four kinds of non-local modules,", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 226, + 505, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 226, + 505, + 238 + ], + "score": 1.0, + "content": "including Gaussian, embedded Gaussian, dot production, and concatenation. Table 5 shows the", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 237, + 506, + 249 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 506, + 249 + ], + "score": 1.0, + "content": "performance of our methods with different types of non-local modules. It is observed that the worst", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 247, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 105, + 247, + 505, + 261 + ], + "score": 1.0, + "content": "non-local type (Gaussian) is only 0.2 AP lower than the best non-local type (Embedded Gaussian", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 259, + 493, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 259, + 493, + 272 + ], + "score": 1.0, + "content": "and Concatenation), indicating our methods are not sensitive to the choice of non-local modules.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 215, + 506, + 272 + ] + }, + { + "type": "table", + "bbox": [ + 162, + 325, + 449, + 499 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 107, + 290, + 502, + 324 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 291, + 505, + 302 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 505, + 302 + ], + "score": 1.0, + "content": "Table 3: Comparison between our methods and other distillation methods. Note that we don’t", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "compare our methods with Chen’s and Wang’s methods on RetinaNet because their methods can not", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 313, + 438, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 438, + 325 + ], + "score": 1.0, + "content": "be utilized in one-stage models. ResNet50 is utilized as backbone in these models.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17 + }, + { + "type": "table_body", + "bbox": [ + 162, + 325, + 449, + 499 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 162, + 325, + 449, + 499 + ], + "spans": [ + { + "bbox": [ + 162, + 325, + 449, + 499 + ], + "score": 0.984, + "html": "
ModelAPAP50 AP75APs 21.5APMAPL
Faster RCNN + Chen etal.Method + Wang et al. Method + Heo et al. Method + Our Methods38.4 38.7 39.1 38.9 41.559.0 59.0 59.8 60.1 62.242.0 42.1 22.0 42.8 22.2 42.6 21.8 45.1 23.542.1 41.9 42.9 42.7 45.050.3 51.0 51.1 50.7 55.3
Cascade RCNN + Chen et al.Method + Wang et al. Method +Heo etal.Method + Our Methods41.0 41.6 42.1 41.7 44.459.4 62.1 62.7 62.3 62.744.4 45.7 46.1 45.7 48.322.7 23.9 24.4 23.9 24.844.4 54.3 45.8 54.7 46.4 55.6 45.7 55.3 48.0 59.3
RetinaNet + Heo et al. Method + Our Methods37.4 37.8 39.656.7 58.3 58.839.6 41.1 21.6 42.1 22.720.0 40.7 41.2 43.349.7 48.3 52.5
", + "type": "table", + "image_path": "8ada90f305f21d053afc3f09be6190d829f42a58fc2c2054a755bac754502548.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 162, + 325, + 449, + 383.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 162, + 383.0, + 449, + 441.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 162, + 441.0, + 449, + 499.0 + ], + "spans": [], + "index": 21 + } + ] + } + ], + "index": 18.5 + }, + { + "type": "table", + "bbox": [ + 121, + 543, + 372, + 632 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 141, + 531, + 351, + 542 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 141, + 531, + 351, + 544 + ], + "spans": [ + { + "bbox": [ + 141, + 531, + 351, + 544 + ], + "score": 1.0, + "content": "Table 4: Ablation study of the three distillation loss.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "table_body", + "bbox": [ + 121, + 543, + 372, + 632 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 121, + 543, + 372, + 632 + ], + "spans": [ + { + "bbox": [ + 121, + 543, + 372, + 632 + ], + "score": 0.98, + "html": "
LossLAT LAM LNLD× × ×√ × ×× √ ×× × √√ √ ×√ 1 √
ResultAP APs38.439.640.839.841.241.5
APM21.522.722.822.723.023.5
APL42.1 50.342.9 52.544.3 54.343.1 52.344.6 55.345.0 55.3
", + "type": "table", + "image_path": "3df24046f01c2245e58cdfc95f7939dbde91ce534aee57f3a68ed22dca7537de.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 121, + 543, + 372, + 572.6666666666666 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 121, + 572.6666666666666, + 372, + 602.3333333333333 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 121, + 602.3333333333333, + 372, + 631.9999999999999 + ], + "spans": [], + "index": 30 + } + ] + } + ], + "index": 25.0 + }, + { + "type": "table", + "bbox": [ + 385, + 570, + 511, + 637 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 385, + 526, + 504, + 570 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 385, + 526, + 504, + 537 + ], + "spans": [ + { + "bbox": [ + 385, + 526, + 504, + 537 + ], + "score": 1.0, + "content": "Table 5: Results of different", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 385, + 537, + 504, + 548 + ], + "spans": [ + { + "bbox": [ + 385, + 537, + 504, + 548 + ], + "score": 1.0, + "content": "types of non-local modules", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 385, + 548, + 504, + 559 + ], + "spans": [ + { + "bbox": [ + 385, + 548, + 504, + 559 + ], + "score": 1.0, + "content": "on Faster RCNN (ResNet50", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 384, + 558, + 434, + 572 + ], + "spans": [ + { + "bbox": [ + 384, + 558, + 434, + 572 + ], + "score": 1.0, + "content": "backbone).", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 25.0 + }, + { + "type": "table_body", + "bbox": [ + 385, + 570, + 511, + 637 + ], + "group_id": 2, + "lines": [ + { + "bbox": [ + 385, + 570, + 511, + 637 + ], + "spans": [ + { + "bbox": [ + 385, + 570, + 511, + 637 + ], + "score": 0.975, + "html": "
Non-Local TypeAP
Embedded Gaussian41.5
Dot Production41.4
Concatenation41.5
Gaussian41.3
", + "type": "table", + "image_path": "875df1a66b49b4b986d95d9f4909a276a2cf568ddcdc303eae32561afb676f90.jpg" + } + ] + } + ], + "index": 30.0, + "virtual_lines": [ + { + "bbox": [ + 385, + 570, + 511, + 603.5 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 385, + 603.5, + 511, + 637.0 + ], + "spans": [], + "index": 31 + } + ] + } + ], + "index": 27.5 + }, + { + "type": "title", + "bbox": [ + 107, + 651, + 191, + 664 + ], + "lines": [ + { + "bbox": [ + 104, + 649, + 192, + 668 + ], + "spans": [ + { + "bbox": [ + 104, + 649, + 192, + 668 + ], + "score": 1.0, + "content": "5 DISCUSSION", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "title", + "bbox": [ + 107, + 677, + 391, + 689 + ], + "lines": [ + { + "bbox": [ + 105, + 677, + 393, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 677, + 393, + 690 + ], + "score": 1.0, + "content": "5.1 ANALYSIS ON THE BENEFITS OF KNOWLEDGE DISTILLATION", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 108, + 698, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 506, + 711 + ], + "score": 1.0, + "content": "Qualitative analysis. Figure 6 shows the comparison of detection results between a baseline and a", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "distilled detector. It is observed that: (i) Our methods improve the detection ability on small-objects.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 721, + 505, + 733 + ], + "score": 1.0, + "content": "In the first three figures, the distilled model can correctly detect cars, the handbag, and the person in", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "the car, respectively. (ii) Our methods prevent models from generating multiple bounding boxes for", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "the same object. In the last two figures, the baseline model generates multiple bounding boxes for", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 374, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 374, + 117 + ], + "score": 1.0, + "content": "the boat and the train while the distilled model avoids these errors.", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 699, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 115 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 506, + 95 + ], + "score": 1.0, + "content": "the car, respectively. (ii) Our methods prevent models from generating multiple bounding boxes for", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "the same object. In the last two figures, the baseline model generates multiple bounding boxes for", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 374, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 374, + 117 + ], + "score": 1.0, + "content": "the boat and the train while the distilled model avoids these errors.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "Analysis on the types of detection error. We have analyzed the different types of detection errors", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "in the baseline and distilled models in Figure 7. The number in the legend indicates AUC (area", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 506, + 155 + ], + "score": 1.0, + "content": "under the curve). It is observed that our distillation method leads to error reduction on all kinds of", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 155, + 465, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 465, + 166 + ], + "score": 1.0, + "content": "error. In brief, our methods can improve the ability of both localization and classification.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + }, + { + "type": "image", + "bbox": [ + 108, + 182, + 502, + 252 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 182, + 502, + 252 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 182, + 502, + 252 + ], + "spans": [ + { + "bbox": [ + 108, + 182, + 502, + 252 + ], + "score": 0.963, + "type": "image", + "image_path": "b7951f3b430017bae85e2b29f2363772d7a73ae9490557bdf248cde346a3e21d.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 108, + 182, + 502, + 205.33333333333334 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 108, + 205.33333333333334, + 502, + 228.66666666666669 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 108, + 228.66666666666669, + 502, + 252.00000000000003 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 262, + 499, + 274 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 260, + 500, + 276 + ], + "spans": [ + { + "bbox": [ + 110, + 260, + 299, + 276 + ], + "score": 1.0, + "content": "Figure 5: Hyper-parameter sensitivity study of", + "type": "text" + }, + { + "bbox": [ + 300, + 262, + 340, + 274 + ], + "score": 0.93, + "content": "\\alpha , \\beta , \\gamma , T", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 260, + 500, + 276 + ], + "score": 1.0, + "content": "with Faster RCNN on MS COCO2017.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + } + ], + "index": 9.0 + }, + { + "type": "image", + "bbox": [ + 112, + 305, + 498, + 414 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 112, + 305, + 498, + 414 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 112, + 305, + 498, + 414 + ], + "spans": [ + { + "bbox": [ + 112, + 305, + 498, + 414 + ], + "score": 0.971, + "type": "image", + "image_path": "86857e4ff1d4a330c3626149534379966c91305c46958428ee987f41ef23f2f0.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 112, + 305, + 498, + 341.3333333333333 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 112, + 341.3333333333333, + 498, + 377.66666666666663 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 112, + 377.66666666666663, + 498, + 413.99999999999994 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 425, + 504, + 448 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "Figure 6: Qualitative analysis on MS COCO2017 with distilled and baseline Faster RCNN. We mark", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 437, + 458, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 458, + 448 + ], + "score": 1.0, + "content": "the undetected and wrongly detected objects of the baseline detector with orange boxes.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + } + ], + "index": 13.25 + }, + { + "type": "text", + "bbox": [ + 107, + 482, + 440, + 494 + ], + "lines": [ + { + "bbox": [ + 105, + 481, + 443, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 443, + 495 + ], + "score": 1.0, + "content": "5.2 RELATION BETWEEN STUDENT DETECTORS AND TEACHER DETECTORS.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 506, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "There is sufficient research focusing on the relation between students and teachers. Mirzadeh et al.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 517, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 506, + 530 + ], + "score": 1.0, + "content": "(2019) and Cho & Hariharan (2019) show that a teacher with higher accuracy may not be the better", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "teacher for knowledge distillation and sometimes a teacher with too high accuracy may harm the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "performance of students. Besides, Mobahi et al. (2020) and Yuan et al. (2019) show that the same", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "model and even a model with lower accuracy than the student model can be utilized as the teacher", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "model for knowledge distillation. However, all their experiments are conducted on image classifica-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "tion. In this section, we study whether these observations still hold in the task of object detection.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "As shown in Figure 8 , we conduct experiments on Faster RCNN (ResNet50 backbone) and Cas-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "cade RCNN (ResNet50 backbone) students with teacher models of different AP. It is observed that:", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "(i) In all of our experiments, the student with a higher AP teacher always achieves higher AP. (ii)", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "When the teacher has lower or the same AP as the student, there are very limited and even negative", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "improvements with knowledge distillation. This observation indicates that the relation between stu-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 638, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 651 + ], + "score": 1.0, + "content": "dents and teachers on object detection is opposite to that on image classification. Our experiment", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 649, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 505, + 662 + ], + "score": 1.0, + "content": "results suggest that there is a strong positive correlation between the AP of students and teachers. A", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 661, + 407, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 661, + 407, + 672 + ], + "score": 1.0, + "content": "high AP teacher tends to improve the performance of students significantly.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 675, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 675, + 505, + 690 + ], + "score": 1.0, + "content": "We think that the reason why a high AP teacher model is crucial in object detection but not very", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "necessary in image classification is that object detection is a more challenging task. As a result, a", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "weaker teacher model may introduce more negative influence on students, which prevents students", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "from achieving higher AP. In contrast, on image classification, most of teacher models can achieve", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 720, + 378, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 378, + 732 + ], + "score": 1.0, + "content": "a very high training accuracy so they don’t introduce so much error.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34 + } + ], + "page_idx": 7, + "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, + 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, + 504, + 115 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 82, + 506, + 117 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 165 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "Analysis on the types of detection error. We have analyzed the different types of detection errors", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 505, + 144 + ], + "score": 1.0, + "content": "in the baseline and distilled models in Figure 7. The number in the legend indicates AUC (area", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 144, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 105, + 144, + 506, + 155 + ], + "score": 1.0, + "content": "under the curve). It is observed that our distillation method leads to error reduction on all kinds of", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 155, + 465, + 166 + ], + "spans": [ + { + "bbox": [ + 105, + 155, + 465, + 166 + ], + "score": 1.0, + "content": "error. In brief, our methods can improve the ability of both localization and classification.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 121, + 506, + 166 + ] + }, + { + "type": "image", + "bbox": [ + 108, + 182, + 502, + 252 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 182, + 502, + 252 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 182, + 502, + 252 + ], + "spans": [ + { + "bbox": [ + 108, + 182, + 502, + 252 + ], + "score": 0.963, + "type": "image", + "image_path": "b7951f3b430017bae85e2b29f2363772d7a73ae9490557bdf248cde346a3e21d.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 108, + 182, + 502, + 205.33333333333334 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 108, + 205.33333333333334, + 502, + 228.66666666666669 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 108, + 228.66666666666669, + 502, + 252.00000000000003 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 108, + 262, + 499, + 274 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 110, + 260, + 500, + 276 + ], + "spans": [ + { + "bbox": [ + 110, + 260, + 299, + 276 + ], + "score": 1.0, + "content": "Figure 5: Hyper-parameter sensitivity study of", + "type": "text" + }, + { + "bbox": [ + 300, + 262, + 340, + 274 + ], + "score": 0.93, + "content": "\\alpha , \\beta , \\gamma , T", + "type": "inline_equation" + }, + { + "bbox": [ + 340, + 260, + 500, + 276 + ], + "score": 1.0, + "content": "with Faster RCNN on MS COCO2017.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + } + ], + "index": 9.0 + }, + { + "type": "image", + "bbox": [ + 112, + 305, + 498, + 414 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 112, + 305, + 498, + 414 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 112, + 305, + 498, + 414 + ], + "spans": [ + { + "bbox": [ + 112, + 305, + 498, + 414 + ], + "score": 0.971, + "type": "image", + "image_path": "86857e4ff1d4a330c3626149534379966c91305c46958428ee987f41ef23f2f0.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 112, + 305, + 498, + 341.3333333333333 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 112, + 341.3333333333333, + 498, + 377.66666666666663 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 112, + 377.66666666666663, + 498, + 413.99999999999994 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 107, + 425, + 504, + 448 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 505, + 437 + ], + "score": 1.0, + "content": "Figure 6: Qualitative analysis on MS COCO2017 with distilled and baseline Faster RCNN. We mark", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 437, + 458, + 448 + ], + "spans": [ + { + "bbox": [ + 106, + 437, + 458, + 448 + ], + "score": 1.0, + "content": "the undetected and wrongly detected objects of the baseline detector with orange boxes.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + } + ], + "index": 13.25 + }, + { + "type": "text", + "bbox": [ + 107, + 482, + 440, + 494 + ], + "lines": [ + { + "bbox": [ + 105, + 481, + 443, + 495 + ], + "spans": [ + { + "bbox": [ + 105, + 481, + 443, + 495 + ], + "score": 1.0, + "content": "5.2 RELATION BETWEEN STUDENT DETECTORS AND TEACHER DETECTORS.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 481, + 443, + 495 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 506, + 505, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "spans": [ + { + "bbox": [ + 106, + 506, + 505, + 519 + ], + "score": 1.0, + "content": "There is sufficient research focusing on the relation between students and teachers. Mirzadeh et al.", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 517, + 506, + 530 + ], + "spans": [ + { + "bbox": [ + 106, + 517, + 506, + 530 + ], + "score": 1.0, + "content": "(2019) and Cho & Hariharan (2019) show that a teacher with higher accuracy may not be the better", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 528, + 505, + 541 + ], + "score": 1.0, + "content": "teacher for knowledge distillation and sometimes a teacher with too high accuracy may harm the", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 506, + 552 + ], + "score": 1.0, + "content": "performance of students. Besides, Mobahi et al. (2020) and Yuan et al. (2019) show that the same", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 506, + 563 + ], + "score": 1.0, + "content": "model and even a model with lower accuracy than the student model can be utilized as the teacher", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 505, + 574 + ], + "score": 1.0, + "content": "model for knowledge distillation. However, all their experiments are conducted on image classifica-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "spans": [ + { + "bbox": [ + 105, + 572, + 505, + 585 + ], + "score": 1.0, + "content": "tion. In this section, we study whether these observations still hold in the task of object detection.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "As shown in Figure 8 , we conduct experiments on Faster RCNN (ResNet50 backbone) and Cas-", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "spans": [ + { + "bbox": [ + 106, + 594, + 505, + 606 + ], + "score": 1.0, + "content": "cade RCNN (ResNet50 backbone) students with teacher models of different AP. It is observed that:", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 617 + ], + "score": 1.0, + "content": "(i) In all of our experiments, the student with a higher AP teacher always achieves higher AP. (ii)", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 505, + 629 + ], + "score": 1.0, + "content": "When the teacher has lower or the same AP as the student, there are very limited and even negative", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 627, + 505, + 639 + ], + "score": 1.0, + "content": "improvements with knowledge distillation. This observation indicates that the relation between stu-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 638, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 506, + 651 + ], + "score": 1.0, + "content": "dents and teachers on object detection is opposite to that on image classification. Our experiment", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 649, + 505, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 505, + 662 + ], + "score": 1.0, + "content": "results suggest that there is a strong positive correlation between the AP of students and teachers. A", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 661, + 407, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 661, + 407, + 672 + ], + "score": 1.0, + "content": "high AP teacher tends to improve the performance of students significantly.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 506, + 506, + 672 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 677, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 675, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 106, + 675, + 505, + 690 + ], + "score": 1.0, + "content": "We think that the reason why a high AP teacher model is crucial in object detection but not very", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 506, + 701 + ], + "score": 1.0, + "content": "necessary in image classification is that object detection is a more challenging task. As a result, a", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "weaker teacher model may introduce more negative influence on students, which prevents students", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 505, + 722 + ], + "score": 1.0, + "content": "from achieving higher AP. In contrast, on image classification, most of teacher models can achieve", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 720, + 378, + 732 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 378, + 732 + ], + "score": 1.0, + "content": "a very high training accuracy so they don’t introduce so much error.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 675, + 506, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 109, + 79, + 500, + 181 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 79, + 500, + 181 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 79, + 500, + 181 + ], + "spans": [ + { + "bbox": [ + 109, + 79, + 500, + 181 + ], + "score": 0.603, + "type": "image", + "image_path": "e0a896ee35c3861ffcb870a29298a306e2b90e41f689b4cfea61ab6a8d4433aa.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 79, + 500, + 113.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 113.0, + 500, + 147.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 147.0, + 500, + 181.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 192, + 366, + 237 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 192, + 367, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 367, + 205 + ], + "score": 1.0, + "content": "Figure 7: Distribution of error types on distilled and baseline", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 203, + 366, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 366, + 216 + ], + "score": 1.0, + "content": "Faster RCNN. Loc - Localization error; Sim & Oth - Classifica-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 214, + 366, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 366, + 227 + ], + "score": 1.0, + "content": "tion error on similar & not similar classes; BG - False positive", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 225, + 363, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 363, + 238 + ], + "score": 1.0, + "content": "prediction fired on background. FN - False Negative prediction.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.0 + }, + { + "type": "image_caption", + "bbox": [ + 371, + 193, + 505, + 236 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 371, + 192, + 504, + 204 + ], + "spans": [ + { + "bbox": [ + 371, + 192, + 504, + 204 + ], + "score": 1.0, + "content": "Figure 8: Relation between stu-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 371, + 203, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 371, + 203, + 505, + 215 + ], + "score": 1.0, + "content": "dents and teachers on Faster", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 370, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 370, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "RCNN and Cascade RCNN in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 370, + 224, + 442, + 237 + ], + "spans": [ + { + "bbox": [ + 370, + 224, + 442, + 237 + ], + "score": 1.0, + "content": "MS COCO2017.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7.0 + } + ], + "index": 6.0 + }, + { + "type": "title", + "bbox": [ + 108, + 255, + 195, + 267 + ], + "lines": [ + { + "bbox": [ + 104, + 253, + 197, + 271 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 197, + 271 + ], + "score": 1.0, + "content": "6 CONCLUSION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 279, + 505, + 367 + ], + "lines": [ + { + "bbox": [ + 105, + 280, + 505, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 292 + ], + "score": 1.0, + "content": "In this paper, we have proposed two knowledge distillation methods, including attention-guided", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 291, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 303 + ], + "score": 1.0, + "content": "distillation and the non-local distillation to improve the performance of object detection models.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 302, + 506, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 506, + 314 + ], + "score": 1.0, + "content": "Attention-guided distillation manages to find the crucial pixels and channels from the whole feature", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 313, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 325 + ], + "score": 1.0, + "content": "map with attention mechanism and then enables the student to focus more on these crucial pixels and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 323, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 505, + 336 + ], + "score": 1.0, + "content": "channels instead of the whole feature map. Non-local distillation enables students to learn not only", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "score": 1.0, + "content": "the information of an individual pixel but also the relation between different pixels captured by the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 345, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 505, + 358 + ], + "score": 1.0, + "content": "non-local modules. Experiments on 9 kinds of models including two-stage, one-stage, anchor-free", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 357, + 389, + 368 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 389, + 368 + ], + "score": 1.0, + "content": "and anchor-based models have been provided to evaluate our methods.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 374, + 505, + 440 + ], + "lines": [ + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "score": 1.0, + "content": "Besides, we have also given a study on the relation between students and teachers in object detection.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "Our experiments show that there is a strong positive correlation between the AP of teachers and stu-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 396, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 505, + 407 + ], + "score": 1.0, + "content": "dents. A high AP teacher detector plays an essential role in knowledge distillation. This observation", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "is much different from the previous conclusion in image classification, where a teacher model with", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 417, + 506, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 506, + 429 + ], + "score": 1.0, + "content": "very high accuracy may harm the performance of knowledge distillation. We hope that our result", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 429, + 498, + 440 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 498, + 440 + ], + "score": 1.0, + "content": "may call for more rethinking works on knowledge distillation in tasks except image classification.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5 + }, + { + "type": "title", + "bbox": [ + 108, + 456, + 238, + 468 + ], + "lines": [ + { + "bbox": [ + 104, + 454, + 240, + 470 + ], + "spans": [ + { + "bbox": [ + 104, + 454, + 240, + 470 + ], + "score": 1.0, + "content": "7 ACKNOWLEDGEMENT", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 104, + 480, + 495, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 497, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 497, + 496 + ], + "score": 1.0, + "content": "This work was partially supported by Institute for interdisciplinary Information Core Technology.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "title", + "bbox": [ + 107, + 508, + 176, + 520 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 176, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 176, + 522 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 108, + 526, + 504, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 526, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 106, + 526, + 505, + 538 + ], + "score": 1.0, + "content": "Sungsoo Ahn, Shell Xu Hu, Andreas Damianou, Neil D Lawrence, and Zhenwen Dai. Variational", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 537, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 115, + 537, + 505, + 550 + ], + "score": 1.0, + "content": "information distillation for knowledge transfer. In Proceedings of the IEEE Conference on Com-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 549, + 359, + 560 + ], + "spans": [ + { + "bbox": [ + 115, + 549, + 359, + 560 + ], + "score": 1.0, + "content": "puter Vision and Pattern Recognition, pp. 9163–9171, 2019.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "text", + "bbox": [ + 108, + 566, + 504, + 600 + ], + "lines": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "Mohammad Farhadi Bajestani and Yezhou Yang. Tkd: Temporal knowledge distillation for active", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 116, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "perception. In The IEEE Winter Conference on Applications of Computer Vision, pp. 953–962,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 586, + 143, + 601 + ], + "spans": [ + { + "bbox": [ + 115, + 586, + 143, + 601 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 107, + 606, + 504, + 640 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 620 + ], + "score": 1.0, + "content": "Cristian Bucilua, Rich Caruana, and Alexandru Niculescu-Mizil. Model compression. In ˇ Pro-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 618, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 116, + 618, + 505, + 631 + ], + "score": 1.0, + "content": "ceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 629, + 256, + 641 + ], + "spans": [ + { + "bbox": [ + 116, + 629, + 256, + 641 + ], + "score": 1.0, + "content": "mining, pp. 535–541. ACM, 2006.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 647, + 505, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 645, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 506, + 662 + ], + "score": 1.0, + "content": "Zhaowei Cai and Nuno Vasconcelos. Cascade r-cnn: High quality object detection and instance seg-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 659, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 115, + 659, + 505, + 671 + ], + "score": 1.0, + "content": "mentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1–1, 2019. ISSN", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 669, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 115, + 669, + 505, + 682 + ], + "score": 1.0, + "content": "1939-3539. doi: 10.1109/tpami.2019.2956516. URL http://dx.doi.org/10.1109/", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 681, + 230, + 692 + ], + "spans": [ + { + "bbox": [ + 116, + 681, + 230, + 692 + ], + "score": 1.0, + "content": "tpami.2019.2956516.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "Guobin Chen, Wongun Choi, Xiang Yu, Tony Han, and Manmohan Chandraker. Learning efficient", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "object detection models with knowledge distillation. In Advances in Neural Information Process-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 720, + 249, + 733 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 249, + 733 + ], + "score": 1.0, + "content": "ing Systems, pp. 742–751, 2017.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43 + } + ], + "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": "image", + "bbox": [ + 109, + 79, + 500, + 181 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 109, + 79, + 500, + 181 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 109, + 79, + 500, + 181 + ], + "spans": [ + { + "bbox": [ + 109, + 79, + 500, + 181 + ], + "score": 0.603, + "type": "image", + "image_path": "e0a896ee35c3861ffcb870a29298a306e2b90e41f689b4cfea61ab6a8d4433aa.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 109, + 79, + 500, + 113.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 109, + 113.0, + 500, + 147.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 109, + 147.0, + 500, + 181.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 192, + 366, + 237 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 192, + 367, + 205 + ], + "spans": [ + { + "bbox": [ + 106, + 192, + 367, + 205 + ], + "score": 1.0, + "content": "Figure 7: Distribution of error types on distilled and baseline", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 203, + 366, + 216 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 366, + 216 + ], + "score": 1.0, + "content": "Faster RCNN. Loc - Localization error; Sim & Oth - Classifica-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 214, + 366, + 227 + ], + "spans": [ + { + "bbox": [ + 105, + 214, + 366, + 227 + ], + "score": 1.0, + "content": "tion error on similar & not similar classes; BG - False positive", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 225, + 363, + 238 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 363, + 238 + ], + "score": 1.0, + "content": "prediction fired on background. FN - False Negative prediction.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 6.0 + }, + { + "type": "image_caption", + "bbox": [ + 371, + 193, + 505, + 236 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 371, + 192, + 504, + 204 + ], + "spans": [ + { + "bbox": [ + 371, + 192, + 504, + 204 + ], + "score": 1.0, + "content": "Figure 8: Relation between stu-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 371, + 203, + 505, + 215 + ], + "spans": [ + { + "bbox": [ + 371, + 203, + 505, + 215 + ], + "score": 1.0, + "content": "dents and teachers on Faster", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 370, + 213, + 505, + 226 + ], + "spans": [ + { + "bbox": [ + 370, + 213, + 505, + 226 + ], + "score": 1.0, + "content": "RCNN and Cascade RCNN in", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 370, + 224, + 442, + 237 + ], + "spans": [ + { + "bbox": [ + 370, + 224, + 442, + 237 + ], + "score": 1.0, + "content": "MS COCO2017.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 7.0 + } + ], + "index": 6.0 + }, + { + "type": "title", + "bbox": [ + 108, + 255, + 195, + 267 + ], + "lines": [ + { + "bbox": [ + 104, + 253, + 197, + 271 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 197, + 271 + ], + "score": 1.0, + "content": "6 CONCLUSION", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 279, + 505, + 367 + ], + "lines": [ + { + "bbox": [ + 105, + 280, + 505, + 292 + ], + "spans": [ + { + "bbox": [ + 105, + 280, + 505, + 292 + ], + "score": 1.0, + "content": "In this paper, we have proposed two knowledge distillation methods, including attention-guided", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 291, + 505, + 303 + ], + "spans": [ + { + "bbox": [ + 105, + 291, + 505, + 303 + ], + "score": 1.0, + "content": "distillation and the non-local distillation to improve the performance of object detection models.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 302, + 506, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 506, + 314 + ], + "score": 1.0, + "content": "Attention-guided distillation manages to find the crucial pixels and channels from the whole feature", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 313, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 505, + 325 + ], + "score": 1.0, + "content": "map with attention mechanism and then enables the student to focus more on these crucial pixels and", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 323, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 323, + 505, + 336 + ], + "score": 1.0, + "content": "channels instead of the whole feature map. Non-local distillation enables students to learn not only", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 334, + 505, + 347 + ], + "score": 1.0, + "content": "the information of an individual pixel but also the relation between different pixels captured by the", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 345, + 505, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 505, + 358 + ], + "score": 1.0, + "content": "non-local modules. Experiments on 9 kinds of models including two-stage, one-stage, anchor-free", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 357, + 389, + 368 + ], + "spans": [ + { + "bbox": [ + 106, + 357, + 389, + 368 + ], + "score": 1.0, + "content": "and anchor-based models have been provided to evaluate our methods.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 280, + 506, + 368 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 374, + 505, + 440 + ], + "lines": [ + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 505, + 386 + ], + "score": 1.0, + "content": "Besides, we have also given a study on the relation between students and teachers in object detection.", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 105, + 384, + 505, + 397 + ], + "score": 1.0, + "content": "Our experiments show that there is a strong positive correlation between the AP of teachers and stu-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 396, + 505, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 505, + 407 + ], + "score": 1.0, + "content": "dents. A high AP teacher detector plays an essential role in knowledge distillation. This observation", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 105, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "is much different from the previous conclusion in image classification, where a teacher model with", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 417, + 506, + 429 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 506, + 429 + ], + "score": 1.0, + "content": "very high accuracy may harm the performance of knowledge distillation. We hope that our result", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 429, + 498, + 440 + ], + "spans": [ + { + "bbox": [ + 106, + 429, + 498, + 440 + ], + "score": 1.0, + "content": "may call for more rethinking works on knowledge distillation in tasks except image classification.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 373, + 506, + 440 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 456, + 238, + 468 + ], + "lines": [ + { + "bbox": [ + 104, + 454, + 240, + 470 + ], + "spans": [ + { + "bbox": [ + 104, + 454, + 240, + 470 + ], + "score": 1.0, + "content": "7 ACKNOWLEDGEMENT", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 104, + 480, + 495, + 492 + ], + "lines": [ + { + "bbox": [ + 105, + 477, + 497, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 497, + 496 + ], + "score": 1.0, + "content": "This work was partially supported by Institute for interdisciplinary Information Core Technology.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 477, + 497, + 496 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 508, + 176, + 520 + ], + "lines": [ + { + "bbox": [ + 106, + 508, + 176, + 522 + ], + "spans": [ + { + "bbox": [ + 106, + 508, + 176, + 522 + ], + "score": 1.0, + "content": "REFERENCES", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 108, + 526, + 504, + 560 + ], + "lines": [ + { + "bbox": [ + 106, + 526, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 106, + 526, + 505, + 538 + ], + "score": 1.0, + "content": "Sungsoo Ahn, Shell Xu Hu, Andreas Damianou, Neil D Lawrence, and Zhenwen Dai. Variational", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 537, + 505, + 550 + ], + "spans": [ + { + "bbox": [ + 115, + 537, + 505, + 550 + ], + "score": 1.0, + "content": "information distillation for knowledge transfer. In Proceedings of the IEEE Conference on Com-", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 549, + 359, + 560 + ], + "spans": [ + { + "bbox": [ + 115, + 549, + 359, + 560 + ], + "score": 1.0, + "content": "puter Vision and Pattern Recognition, pp. 9163–9171, 2019.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 526, + 505, + 560 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 566, + 504, + 600 + ], + "lines": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 105, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "Mohammad Farhadi Bajestani and Yezhou Yang. Tkd: Temporal knowledge distillation for active", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 116, + 578, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 116, + 578, + 505, + 590 + ], + "score": 1.0, + "content": "perception. In The IEEE Winter Conference on Applications of Computer Vision, pp. 953–962,", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 115, + 586, + 143, + 601 + ], + "spans": [ + { + "bbox": [ + 115, + 586, + 143, + 601 + ], + "score": 1.0, + "content": "2020.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 566, + 505, + 601 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 606, + 504, + 640 + ], + "lines": [ + { + "bbox": [ + 105, + 605, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 105, + 605, + 505, + 620 + ], + "score": 1.0, + "content": "Cristian Bucilua, Rich Caruana, and Alexandru Niculescu-Mizil. Model compression. In ˇ Pro-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 618, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 116, + 618, + 505, + 631 + ], + "score": 1.0, + "content": "ceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 116, + 629, + 256, + 641 + ], + "spans": [ + { + "bbox": [ + 116, + 629, + 256, + 641 + ], + "score": 1.0, + "content": "mining, pp. 535–541. ACM, 2006.", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 605, + 505, + 641 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 647, + 505, + 691 + ], + "lines": [ + { + "bbox": [ + 105, + 645, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 506, + 662 + ], + "score": 1.0, + "content": "Zhaowei Cai and Nuno Vasconcelos. Cascade r-cnn: High quality object detection and instance seg-", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 659, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 115, + 659, + 505, + 671 + ], + "score": 1.0, + "content": "mentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, pp. 1–1, 2019. ISSN", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 115, + 669, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 115, + 669, + 505, + 682 + ], + "score": 1.0, + "content": "1939-3539. doi: 10.1109/tpami.2019.2956516. URL http://dx.doi.org/10.1109/", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 681, + 230, + 692 + ], + "spans": [ + { + "bbox": [ + 116, + 681, + 230, + 692 + ], + "score": 1.0, + "content": "tpami.2019.2956516.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 645, + 506, + 692 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 699, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "Guobin Chen, Wongun Choi, Xiang Yu, Tony Han, and Manmohan Chandraker. Learning efficient", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 116, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "object detection models with knowledge distillation. In Advances in Neural Information Process-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 115, + 720, + 249, + 733 + ], + "spans": [ + { + "bbox": [ + 115, + 720, + 249, + 733 + ], + "score": 1.0, + "content": "ing Systems, pp. 742–751, 2017.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43, + "bbox_fs": [ + 106, + 698, + 505, + 733 + ] + } + ] + }, + { + "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": "Kai Chen, Jiaqi Wang, Jiangmiao Pang, Yuhang Cao, Yu Xiong, Xiaoxiao Li, Shuyang Sun, Wansen", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "Feng, Ziwei Liu, Jiarui Xu, et al. Mmdetection: Open mmlab detection toolbox and benchmark.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 279, + 116 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 279, + 116 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1906.07155, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 104, + 124, + 504, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 124, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 124, + 505, + 137 + ], + "score": 1.0, + "content": "Jang Hyun Cho and Bharath Hariharan. On the efficacy of knowledge distillation. In The IEEE", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 396, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 396, + 147 + ], + "score": 1.0, + "content": "International Conference on Computer Vision (ICCV), October 2019.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 155, + 503, + 179 + ], + "lines": [ + { + "bbox": [ + 106, + 155, + 504, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 504, + 168 + ], + "score": 1.0, + "content": "Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 166, + 354, + 180 + ], + "spans": [ + { + "bbox": [ + 115, + 166, + 354, + 180 + ], + "score": 1.0, + "content": "hierarchical image database. In CVPR, pp. 248–255, 2009.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 504, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 506, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 506, + 201 + ], + "score": 1.0, + "content": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 197, + 407, + 210 + ], + "spans": [ + { + "bbox": [ + 116, + 197, + 407, + 210 + ], + "score": 1.0, + "content": "bidirectional transformers for language understanding. In NAACL, 2018.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 217, + 504, + 240 + ], + "lines": [ + { + "bbox": [ + 106, + 217, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 505, + 230 + ], + "score": 1.0, + "content": "Jonathan Frankle and Michael Carbin. The lottery ticket hypothesis: Finding sparse, trainable neural", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 229, + 321, + 240 + ], + "spans": [ + { + "bbox": [ + 115, + 229, + 321, + 240 + ], + "score": 1.0, + "content": "networks. arXiv preprint arXiv:1803.03635, 2018.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "text", + "bbox": [ + 108, + 248, + 504, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 248, + 506, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 506, + 262 + ], + "score": 1.0, + "content": "Shiming Ge, Shengwei Zhao, Chenyu Li, and Jia Li. Low-resolution face recognition in the wild", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 259, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 115, + 259, + 506, + 273 + ], + "score": 1.0, + "content": "via selective knowledge distillation. IEEE Transactions on Image Processing, 28(4):2051–2062,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 268, + 143, + 283 + ], + "spans": [ + { + "bbox": [ + 115, + 268, + 143, + 283 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 105, + 290, + 504, + 313 + ], + "lines": [ + { + "bbox": [ + 106, + 291, + 504, + 304 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 504, + 304 + ], + "score": 1.0, + "content": "Song Han, Huizi Mao, and William J Dally. Deep compression: Compressing deep neural networks", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 301, + 403, + 314 + ], + "spans": [ + { + "bbox": [ + 116, + 301, + 403, + 314 + ], + "score": 1.0, + "content": "with pruning, trained quantization and huffman coding. In ICLR, 2016.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 321, + 503, + 345 + ], + "lines": [ + { + "bbox": [ + 105, + 319, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 505, + 336 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recog-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 333, + 267, + 345 + ], + "spans": [ + { + "bbox": [ + 115, + 333, + 267, + 345 + ], + "score": 1.0, + "content": "nition. In CVPR, pp. 770–778, 2016.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 352, + 503, + 376 + ], + "lines": [ + { + "bbox": [ + 106, + 352, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 352, + 505, + 366 + ], + "score": 1.0, + "content": "Kaiming He, Georgia Gkioxari, Piotr Dollar, and Ross Girshick. Mask r-cnn. 2017 IEEE Interna-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 364, + 349, + 376 + ], + "spans": [ + { + "bbox": [ + 115, + 364, + 349, + 376 + ], + "score": 1.0, + "content": "tional Conference on Computer Vision (ICCV), Oct 2017.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 106, + 383, + 504, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 383, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 505, + 397 + ], + "score": 1.0, + "content": "Byeongho Heo, Jeesoo Kim, Sangdoo Yun, Hyojin Park, Nojun Kwak, and Jin Young Choi. A com-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 115, + 395, + 506, + 408 + ], + "score": 1.0, + "content": "prehensive overhaul of feature distillation. In Proceedings of the IEEE International Conference", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 406, + 290, + 418 + ], + "spans": [ + { + "bbox": [ + 116, + 406, + 290, + 418 + ], + "score": 1.0, + "content": "on Computer Vision, pp. 1921–1930, 2019.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 425, + 504, + 449 + ], + "lines": [ + { + "bbox": [ + 106, + 425, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 505, + 438 + ], + "score": 1.0, + "content": "Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. In", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 437, + 181, + 449 + ], + "spans": [ + { + "bbox": [ + 116, + 437, + 181, + 449 + ], + "score": 1.0, + "content": "NeurIPS, 2014.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 456, + 502, + 491 + ], + "lines": [ + { + "bbox": [ + 106, + 456, + 504, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 504, + 470 + ], + "score": 1.0, + "content": "Yuenan Hou, Zheng Ma, Chunxiao Liu, and Chen Change Loy. Learning lightweight lane detec-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 468, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 116, + 468, + 505, + 481 + ], + "score": 1.0, + "content": "tion cnns by self attention distillation. In Proceedings of the IEEE International Conference on", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 479, + 279, + 491 + ], + "spans": [ + { + "bbox": [ + 116, + 479, + 279, + 491 + ], + "score": 1.0, + "content": "Computer Vision, pp. 1013–1021, 2019.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 513 + ], + "score": 1.0, + "content": "Andrew Howard, Mark Sandler, Grace Chu, Liang-Chieh Chen, Bo Chen, Mingxing Tan, Weijun", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 117, + 510, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 117, + 510, + 505, + 522 + ], + "score": 1.0, + "content": "Wang, Yukun Zhu, Ruoming Pang, Vijay Vasudevan, et al. Searching for mobilenetv3. arXiv", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 522, + 254, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 522, + 254, + 533 + ], + "score": 1.0, + "content": "preprint arXiv:1905.02244, 2019.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29 + }, + { + "type": "text", + "bbox": [ + 106, + 541, + 505, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "score": 1.0, + "content": "Han Hu, Jiayuan Gu, Zheng Zhang, Jifeng Dai, and Yichen Wei. Relation networks for object", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 552, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 115, + 552, + 505, + 565 + ], + "score": 1.0, + "content": "detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 564, + 206, + 575 + ], + "spans": [ + { + "bbox": [ + 115, + 564, + 206, + 575 + ], + "score": 1.0, + "content": "pp. 3588–3597, 2018.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 106, + 583, + 506, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "Forrest N Iandola, Song Han, Matthew W Moskewicz, Khalid Ashraf, William J Dally, and Kurt", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 595, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 116, + 595, + 426, + 607 + ], + "score": 1.0, + "content": "Keutzer. Squeezenet: Alexnet-level accuracy with 50x fewer parameters and¡", + "type": "text" + }, + { + "bbox": [ + 427, + 595, + 456, + 605 + ], + "score": 0.4, + "content": "0 . 5 \\mathrm { m b }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 595, + 505, + 607 + ], + "score": 1.0, + "content": "model size.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 605, + 179, + 616 + ], + "spans": [ + { + "bbox": [ + 116, + 605, + 179, + 616 + ], + "score": 1.0, + "content": "In ICLR, 2016.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 504, + 659 + ], + "lines": [ + { + "bbox": [ + 107, + 625, + 504, + 638 + ], + "spans": [ + { + "bbox": [ + 107, + 625, + 504, + 638 + ], + "score": 1.0, + "content": "Quanquan Li, Shengying Jin, and Junjie Yan. Mimicking very efficient network for object detection.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 635, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 115, + 635, + 506, + 649 + ], + "score": 1.0, + "content": "In Proceedings of the ieee conference on computer vision and pattern recognition, pp. 6356–6364,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 646, + 144, + 659 + ], + "spans": [ + { + "bbox": [ + 115, + 646, + 144, + 659 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38 + }, + { + "type": "text", + "bbox": [ + 108, + 667, + 504, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 667, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 506, + 680 + ], + "score": 1.0, + "content": "Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 116, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "Dollar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ´ European", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 689, + 363, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 689, + 363, + 702 + ], + "score": 1.0, + "content": "conference on computer vision, pp. 740–755. Springer, 2014.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Tsung-Yi Lin, Priya Goyal, Ross Girshick, Kaiming He, and Piotr Dollar. Focal loss for dense object ´", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 720, + 478, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 478, + 733 + ], + "score": 1.0, + "content": "detection. In Proceedings of the IEEE international conference on computer vision, 2017.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5 + } + ], + "page_idx": 9, + "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, + 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": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "Kai Chen, Jiaqi Wang, Jiangmiao Pang, Yuhang Cao, Yu Xiong, Xiaoxiao Li, Shuyang Sun, Wansen", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "Feng, Ziwei Liu, Jiarui Xu, et al. Mmdetection: Open mmlab detection toolbox and benchmark.", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 279, + 116 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 279, + 116 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1906.07155, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 116 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 124, + 504, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 124, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 124, + 505, + 137 + ], + "score": 1.0, + "content": "Jang Hyun Cho and Bharath Hariharan. On the efficacy of knowledge distillation. In The IEEE", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 396, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 396, + 147 + ], + "score": 1.0, + "content": "International Conference on Computer Vision (ICCV), October 2019.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 105, + 124, + 505, + 147 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 155, + 503, + 179 + ], + "lines": [ + { + "bbox": [ + 106, + 155, + 504, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 155, + 504, + 168 + ], + "score": 1.0, + "content": "Jia Deng, Wei Dong, Richard Socher, Li-Jia Li, Kai Li, and Li Fei-Fei. Imagenet: A large-scale", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 166, + 354, + 180 + ], + "spans": [ + { + "bbox": [ + 115, + 166, + 354, + 180 + ], + "score": 1.0, + "content": "hierarchical image database. In CVPR, pp. 248–255, 2009.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 106, + 155, + 504, + 180 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 504, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 185, + 506, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 185, + 506, + 201 + ], + "score": 1.0, + "content": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 116, + 197, + 407, + 210 + ], + "spans": [ + { + "bbox": [ + 116, + 197, + 407, + 210 + ], + "score": 1.0, + "content": "bidirectional transformers for language understanding. In NAACL, 2018.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 105, + 185, + 506, + 210 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 217, + 504, + 240 + ], + "lines": [ + { + "bbox": [ + 106, + 217, + 505, + 230 + ], + "spans": [ + { + "bbox": [ + 106, + 217, + 505, + 230 + ], + "score": 1.0, + "content": "Jonathan Frankle and Michael Carbin. The lottery ticket hypothesis: Finding sparse, trainable neural", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 229, + 321, + 240 + ], + "spans": [ + { + "bbox": [ + 115, + 229, + 321, + 240 + ], + "score": 1.0, + "content": "networks. arXiv preprint arXiv:1803.03635, 2018.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 106, + 217, + 505, + 240 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 248, + 504, + 282 + ], + "lines": [ + { + "bbox": [ + 106, + 248, + 506, + 262 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 506, + 262 + ], + "score": 1.0, + "content": "Shiming Ge, Shengwei Zhao, Chenyu Li, and Jia Li. Low-resolution face recognition in the wild", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 259, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 115, + 259, + 506, + 273 + ], + "score": 1.0, + "content": "via selective knowledge distillation. IEEE Transactions on Image Processing, 28(4):2051–2062,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 268, + 143, + 283 + ], + "spans": [ + { + "bbox": [ + 115, + 268, + 143, + 283 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 248, + 506, + 283 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 290, + 504, + 313 + ], + "lines": [ + { + "bbox": [ + 106, + 291, + 504, + 304 + ], + "spans": [ + { + "bbox": [ + 106, + 291, + 504, + 304 + ], + "score": 1.0, + "content": "Song Han, Huizi Mao, and William J Dally. Deep compression: Compressing deep neural networks", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 301, + 403, + 314 + ], + "spans": [ + { + "bbox": [ + 116, + 301, + 403, + 314 + ], + "score": 1.0, + "content": "with pruning, trained quantization and huffman coding. In ICLR, 2016.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 106, + 291, + 504, + 314 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 321, + 503, + 345 + ], + "lines": [ + { + "bbox": [ + 105, + 319, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 319, + 505, + 336 + ], + "score": 1.0, + "content": "Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recog-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 333, + 267, + 345 + ], + "spans": [ + { + "bbox": [ + 115, + 333, + 267, + 345 + ], + "score": 1.0, + "content": "nition. In CVPR, pp. 770–778, 2016.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 319, + 505, + 345 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 352, + 503, + 376 + ], + "lines": [ + { + "bbox": [ + 106, + 352, + 505, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 352, + 505, + 366 + ], + "score": 1.0, + "content": "Kaiming He, Georgia Gkioxari, Piotr Dollar, and Ross Girshick. Mask r-cnn. 2017 IEEE Interna-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 364, + 349, + 376 + ], + "spans": [ + { + "bbox": [ + 115, + 364, + 349, + 376 + ], + "score": 1.0, + "content": "tional Conference on Computer Vision (ICCV), Oct 2017.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 106, + 352, + 505, + 376 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 383, + 504, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 383, + 505, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 383, + 505, + 397 + ], + "score": 1.0, + "content": "Byeongho Heo, Jeesoo Kim, Sangdoo Yun, Hyojin Park, Nojun Kwak, and Jin Young Choi. A com-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 115, + 395, + 506, + 408 + ], + "score": 1.0, + "content": "prehensive overhaul of feature distillation. In Proceedings of the IEEE International Conference", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 406, + 290, + 418 + ], + "spans": [ + { + "bbox": [ + 116, + 406, + 290, + 418 + ], + "score": 1.0, + "content": "on Computer Vision, pp. 1921–1930, 2019.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 383, + 506, + 418 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 425, + 504, + 449 + ], + "lines": [ + { + "bbox": [ + 106, + 425, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 425, + 505, + 438 + ], + "score": 1.0, + "content": "Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. In", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 437, + 181, + 449 + ], + "spans": [ + { + "bbox": [ + 116, + 437, + 181, + 449 + ], + "score": 1.0, + "content": "NeurIPS, 2014.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23.5, + "bbox_fs": [ + 106, + 425, + 505, + 449 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 456, + 502, + 491 + ], + "lines": [ + { + "bbox": [ + 106, + 456, + 504, + 470 + ], + "spans": [ + { + "bbox": [ + 106, + 456, + 504, + 470 + ], + "score": 1.0, + "content": "Yuenan Hou, Zheng Ma, Chunxiao Liu, and Chen Change Loy. Learning lightweight lane detec-", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 116, + 468, + 505, + 481 + ], + "spans": [ + { + "bbox": [ + 116, + 468, + 505, + 481 + ], + "score": 1.0, + "content": "tion cnns by self attention distillation. In Proceedings of the IEEE International Conference on", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 479, + 279, + 491 + ], + "spans": [ + { + "bbox": [ + 116, + 479, + 279, + 491 + ], + "score": 1.0, + "content": "Computer Vision, pp. 1013–1021, 2019.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 106, + 456, + 505, + 491 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 498, + 504, + 533 + ], + "lines": [ + { + "bbox": [ + 105, + 497, + 505, + 513 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 513 + ], + "score": 1.0, + "content": "Andrew Howard, Mark Sandler, Grace Chu, Liang-Chieh Chen, Bo Chen, Mingxing Tan, Weijun", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 117, + 510, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 117, + 510, + 505, + 522 + ], + "score": 1.0, + "content": "Wang, Yukun Zhu, Ruoming Pang, Vijay Vasudevan, et al. Searching for mobilenetv3. arXiv", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 115, + 522, + 254, + 533 + ], + "spans": [ + { + "bbox": [ + 115, + 522, + 254, + 533 + ], + "score": 1.0, + "content": "preprint arXiv:1905.02244, 2019.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 497, + 505, + 533 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 541, + 505, + 575 + ], + "lines": [ + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 540, + 506, + 554 + ], + "score": 1.0, + "content": "Han Hu, Jiayuan Gu, Zheng Zhang, Jifeng Dai, and Yichen Wei. Relation networks for object", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 115, + 552, + 505, + 565 + ], + "spans": [ + { + "bbox": [ + 115, + 552, + 505, + 565 + ], + "score": 1.0, + "content": "detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition,", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 564, + 206, + 575 + ], + "spans": [ + { + "bbox": [ + 115, + 564, + 206, + 575 + ], + "score": 1.0, + "content": "pp. 3588–3597, 2018.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 540, + 506, + 575 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 583, + 506, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 583, + 505, + 595 + ], + "score": 1.0, + "content": "Forrest N Iandola, Song Han, Matthew W Moskewicz, Khalid Ashraf, William J Dally, and Kurt", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 595, + 505, + 607 + ], + "spans": [ + { + "bbox": [ + 116, + 595, + 426, + 607 + ], + "score": 1.0, + "content": "Keutzer. Squeezenet: Alexnet-level accuracy with 50x fewer parameters and¡", + "type": "text" + }, + { + "bbox": [ + 427, + 595, + 456, + 605 + ], + "score": 0.4, + "content": "0 . 5 \\mathrm { m b }", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 595, + 505, + 607 + ], + "score": 1.0, + "content": "model size.", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 116, + 605, + 179, + 616 + ], + "spans": [ + { + "bbox": [ + 116, + 605, + 179, + 616 + ], + "score": 1.0, + "content": "In ICLR, 2016.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 106, + 583, + 505, + 616 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 504, + 659 + ], + "lines": [ + { + "bbox": [ + 107, + 625, + 504, + 638 + ], + "spans": [ + { + "bbox": [ + 107, + 625, + 504, + 638 + ], + "score": 1.0, + "content": "Quanquan Li, Shengying Jin, and Junjie Yan. Mimicking very efficient network for object detection.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 635, + 506, + 649 + ], + "spans": [ + { + "bbox": [ + 115, + 635, + 506, + 649 + ], + "score": 1.0, + "content": "In Proceedings of the ieee conference on computer vision and pattern recognition, pp. 6356–6364,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 115, + 646, + 144, + 659 + ], + "spans": [ + { + "bbox": [ + 115, + 646, + 144, + 659 + ], + "score": 1.0, + "content": "2017.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38, + "bbox_fs": [ + 107, + 625, + 506, + 659 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 667, + 504, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 667, + 506, + 680 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 506, + 680 + ], + "score": 1.0, + "content": "Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 116, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "Dollar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ´ European", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 116, + 689, + 363, + 702 + ], + "spans": [ + { + "bbox": [ + 116, + 689, + 363, + 702 + ], + "score": 1.0, + "content": "conference on computer vision, pp. 740–755. Springer, 2014.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41, + "bbox_fs": [ + 106, + 667, + 506, + 702 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Tsung-Yi Lin, Priya Goyal, Ross Girshick, Kaiming He, and Piotr Dollar. Focal loss for dense object ´", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 116, + 720, + 478, + 733 + ], + "spans": [ + { + "bbox": [ + 116, + 720, + 478, + 733 + ], + "score": 1.0, + "content": "detection. In Proceedings of the IEEE international conference on computer vision, 2017.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 43.5, + "bbox_fs": [ + 106, + 709, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Yifan Liu, Ke Chen, Chris Liu, Zengchang Qin, Zhenbo Luo, and Jingdong Wang. Structured", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "knowledge distillation for semantic segmentation. In Proceedings of the IEEE Conference on", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 117, + 104, + 378, + 118 + ], + "spans": [ + { + "bbox": [ + 117, + 104, + 378, + 118 + ], + "score": 1.0, + "content": "Computer Vision and Pattern Recognition, pp. 2604–2613, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 105, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 124, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 505, + 136 + ], + "score": 1.0, + "content": "Zhuang Liu, Mingjie Sun, Tinghui Zhou, Gao Huang, and Trevor Darrell. Rethinking the value of", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 351, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 351, + 147 + ], + "score": 1.0, + "content": "network pruning. arXiv preprint arXiv:1810.05270, 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "score": 1.0, + "content": "Xin Lu, Buyu Li, Yuxin Yue, Quanquan Li, and Junjie Yan. Grid r-cnn. In Proceedings of the IEEE", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 374, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 374, + 177 + ], + "score": 1.0, + "content": "Conference on Computer Vision and Pattern Recognition, 2019.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 183, + 504, + 218 + ], + "lines": [ + { + "bbox": [ + 105, + 183, + 506, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 506, + 197 + ], + "score": 1.0, + "content": "Ningning Ma, Xiangyu Zhang, Hai-Tao Zheng, and Jian Sun. Shufflenet v2: Practical guidelines", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 195, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 115, + 195, + 505, + 208 + ], + "score": 1.0, + "content": "for efficient cnn architecture design. In Proceedings of the European Conference on Computer", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 206, + 261, + 218 + ], + "spans": [ + { + "bbox": [ + 117, + 206, + 261, + 218 + ], + "score": 1.0, + "content": "Vision (ECCV), pp. 116–131, 2018.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 106, + 225, + 506, + 259 + ], + "lines": [ + { + "bbox": [ + 106, + 225, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 225, + 505, + 237 + ], + "score": 1.0, + "content": "Seyed-Iman Mirzadeh, Mehrdad Farajtabar, Ang Li, and Hassan Ghasemzadeh. Improved knowl-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 116, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "edge distillation via teacher assistant: Bridging the gap between student and teacher. arXiv", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 248, + 254, + 259 + ], + "spans": [ + { + "bbox": [ + 115, + 248, + 254, + 259 + ], + "score": 1.0, + "content": "preprint arXiv:1902.03393, 2019.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 105, + 266, + 504, + 290 + ], + "lines": [ + { + "bbox": [ + 105, + 265, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 280 + ], + "score": 1.0, + "content": "Hossein Mobahi, Mehrdad Farajtabar, and Peter L Bartlett. Self-distillation amplifies regularization", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 277, + 345, + 290 + ], + "spans": [ + { + "bbox": [ + 116, + 277, + 345, + 290 + ], + "score": 1.0, + "content": "in hilbert space. arXiv preprint arXiv:2002.05715, 2020.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 296, + 506, + 330 + ], + "lines": [ + { + "bbox": [ + 105, + 296, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 310 + ], + "score": 1.0, + "content": "Markus Nagel, Mart van Baalen, Tijmen Blankevoort, and Max Welling. Data-free quantization", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 116, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "through weight equalization and bias correction. In The IEEE International Conference on Com-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 114, + 320, + 261, + 331 + ], + "spans": [ + { + "bbox": [ + 114, + 320, + 261, + 331 + ], + "score": 1.0, + "content": "puter Vision (ICCV), October 2019.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 108, + 338, + 504, + 371 + ], + "lines": [ + { + "bbox": [ + 106, + 338, + 504, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 504, + 351 + ], + "score": 1.0, + "content": "Wonpyo Park, Dongju Kim, Yan Lu, and Minsu Cho. Relational knowledge distillation. In Pro-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 115, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "ceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3967–3976,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 358, + 143, + 373 + ], + "spans": [ + { + "bbox": [ + 115, + 358, + 143, + 373 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 107, + 379, + 506, + 435 + ], + "lines": [ + { + "bbox": [ + 106, + 379, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 505, + 392 + ], + "score": 1.0, + "content": "Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 391, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 116, + 391, + 505, + 403 + ], + "score": 1.0, + "content": "Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 400, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 115, + 400, + 506, + 416 + ], + "score": 1.0, + "content": "Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 411, + 506, + 427 + ], + "spans": [ + { + "bbox": [ + 114, + 411, + 506, + 427 + ], + "score": 1.0, + "content": "Lu Fang, Junjie Bai, and Soumith Chintala. Pytorch: An imperative style, high-performance deep", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 423, + 324, + 436 + ], + "spans": [ + { + "bbox": [ + 115, + 423, + 324, + 436 + ], + "score": 1.0, + "content": "learning library. In NeurIPS, pp. 8024–8035. 2019.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 442, + 505, + 477 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 506, + 456 + ], + "score": 1.0, + "content": "Shaoqing Ren, Kaiming He, Ross Girshick, and Jian Sun. Faster r-cnn: Towards real-time object", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 453, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 115, + 453, + 506, + 467 + ], + "score": 1.0, + "content": "detection with region proposal networks. In Advances in neural information processing systems,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 465, + 186, + 477 + ], + "spans": [ + { + "bbox": [ + 115, + 465, + 186, + 477 + ], + "score": 1.0, + "content": "pp. 91–99, 2015.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 483, + 504, + 507 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "Adriana Romero, Nicolas Ballas, Samira Ebrahimi Kahou, Antoine Chassang, Carlo Gatta, and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 495, + 378, + 507 + ], + "spans": [ + { + "bbox": [ + 116, + 495, + 378, + 507 + ], + "score": 1.0, + "content": "Yoshua Bengio. Fitnets: Hints for thin deep nets. In ICLR, 2015.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 106, + 513, + 506, + 548 + ], + "lines": [ + { + "bbox": [ + 106, + 514, + 504, + 527 + ], + "spans": [ + { + "bbox": [ + 106, + 514, + 504, + 527 + ], + "score": 1.0, + "content": "Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedi-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 525, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 525, + 505, + 538 + ], + "score": 1.0, + "content": "cal image segmentation. In International Conference on Medical image computing and computer-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 536, + 322, + 548 + ], + "spans": [ + { + "bbox": [ + 115, + 536, + 322, + 548 + ], + "score": 1.0, + "content": "assisted intervention, pp. 234–241. Springer, 2015.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 555, + 504, + 590 + ], + "lines": [ + { + "bbox": [ + 105, + 554, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 505, + 568 + ], + "score": 1.0, + "content": "Mark Sandler, Andrew Howard, Menglong Zhu, Andrey Zhmoginov, and Liang-Chieh Chen. Mo-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 116, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "bilenetv2: Inverted residuals and linear bottlenecks. In Proceedings of the IEEE Conference on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 117, + 577, + 378, + 591 + ], + "spans": [ + { + "bbox": [ + 117, + 577, + 378, + 591 + ], + "score": 1.0, + "content": "Computer Vision and Pattern Recognition, pp. 4510–4520, 2018.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 105, + 596, + 504, + 620 + ], + "lines": [ + { + "bbox": [ + 107, + 596, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 107, + 596, + 506, + 609 + ], + "score": 1.0, + "content": "Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf. Distilbert, a distilled version of", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 608, + 443, + 621 + ], + "spans": [ + { + "bbox": [ + 115, + 608, + 443, + 621 + ], + "score": 1.0, + "content": "bert: smaller, faster, cheaper and lighter. arXiv preprint arXiv:1910.01108, 2019.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 104, + 627, + 504, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "score": 1.0, + "content": "Frederick Tung and Greg Mori. Similarity-preserving knowledge distillation. In Proceedings of the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 637, + 418, + 650 + ], + "spans": [ + { + "bbox": [ + 116, + 637, + 418, + 650 + ], + "score": 1.0, + "content": "IEEE International Conference on Computer Vision, pp. 1365–1374, 2019.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5 + }, + { + "type": "text", + "bbox": [ + 106, + 657, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 106, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "Tao Wang, Li Yuan, Xiaopeng Zhang, and Jiashi Feng. Distilling object detectors with fine-grained", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 667, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 115, + 667, + 505, + 682 + ], + "score": 1.0, + "content": "feature imitation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recog-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 679, + 234, + 691 + ], + "spans": [ + { + "bbox": [ + 116, + 679, + 234, + 691 + ], + "score": 1.0, + "content": "nition, pp. 4933–4942, 2019.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42 + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaiming He. Non-local neural networks. In", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 7794–7803,", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 114, + 718, + 143, + 733 + ], + "spans": [ + { + "bbox": [ + 114, + 718, + 143, + 733 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45 + } + ], + "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, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 13 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 503, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Yifan Liu, Ke Chen, Chris Liu, Zengchang Qin, Zhenbo Luo, and Jingdong Wang. Structured", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "knowledge distillation for semantic segmentation. In Proceedings of the IEEE Conference on", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 117, + 104, + 378, + 118 + ], + "spans": [ + { + "bbox": [ + 117, + 104, + 378, + 118 + ], + "score": 1.0, + "content": "Computer Vision and Pattern Recognition, pp. 2604–2613, 2019.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 81, + 505, + 118 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 123, + 504, + 146 + ], + "lines": [ + { + "bbox": [ + 106, + 124, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 106, + 124, + 505, + 136 + ], + "score": 1.0, + "content": "Zhuang Liu, Mingjie Sun, Tinghui Zhou, Gao Huang, and Trevor Darrell. Rethinking the value of", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 135, + 351, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 135, + 351, + 147 + ], + "score": 1.0, + "content": "network pruning. arXiv preprint arXiv:1810.05270, 2018.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5, + "bbox_fs": [ + 106, + 124, + 505, + 147 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 506, + 167 + ], + "score": 1.0, + "content": "Xin Lu, Buyu Li, Yuxin Yue, Quanquan Li, and Junjie Yan. Grid r-cnn. In Proceedings of the IEEE", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 164, + 374, + 177 + ], + "spans": [ + { + "bbox": [ + 116, + 164, + 374, + 177 + ], + "score": 1.0, + "content": "Conference on Computer Vision and Pattern Recognition, 2019.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 153, + 506, + 177 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 183, + 504, + 218 + ], + "lines": [ + { + "bbox": [ + 105, + 183, + 506, + 197 + ], + "spans": [ + { + "bbox": [ + 105, + 183, + 506, + 197 + ], + "score": 1.0, + "content": "Ningning Ma, Xiangyu Zhang, Hai-Tao Zheng, and Jian Sun. Shufflenet v2: Practical guidelines", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 195, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 115, + 195, + 505, + 208 + ], + "score": 1.0, + "content": "for efficient cnn architecture design. In Proceedings of the European Conference on Computer", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 117, + 206, + 261, + 218 + ], + "spans": [ + { + "bbox": [ + 117, + 206, + 261, + 218 + ], + "score": 1.0, + "content": "Vision (ECCV), pp. 116–131, 2018.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 183, + 506, + 218 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 225, + 506, + 259 + ], + "lines": [ + { + "bbox": [ + 106, + 225, + 505, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 225, + 505, + 237 + ], + "score": 1.0, + "content": "Seyed-Iman Mirzadeh, Mehrdad Farajtabar, Ang Li, and Hassan Ghasemzadeh. Improved knowl-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 237, + 505, + 249 + ], + "spans": [ + { + "bbox": [ + 116, + 237, + 505, + 249 + ], + "score": 1.0, + "content": "edge distillation via teacher assistant: Bridging the gap between student and teacher. arXiv", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 248, + 254, + 259 + ], + "spans": [ + { + "bbox": [ + 115, + 248, + 254, + 259 + ], + "score": 1.0, + "content": "preprint arXiv:1902.03393, 2019.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 225, + 505, + 259 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 266, + 504, + 290 + ], + "lines": [ + { + "bbox": [ + 105, + 265, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 265, + 505, + 280 + ], + "score": 1.0, + "content": "Hossein Mobahi, Mehrdad Farajtabar, and Peter L Bartlett. Self-distillation amplifies regularization", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 277, + 345, + 290 + ], + "spans": [ + { + "bbox": [ + 116, + 277, + 345, + 290 + ], + "score": 1.0, + "content": "in hilbert space. arXiv preprint arXiv:2002.05715, 2020.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 105, + 265, + 505, + 290 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 296, + 506, + 330 + ], + "lines": [ + { + "bbox": [ + 105, + 296, + 505, + 310 + ], + "spans": [ + { + "bbox": [ + 105, + 296, + 505, + 310 + ], + "score": 1.0, + "content": "Markus Nagel, Mart van Baalen, Tijmen Blankevoort, and Max Welling. Data-free quantization", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 116, + 307, + 505, + 321 + ], + "score": 1.0, + "content": "through weight equalization and bias correction. In The IEEE International Conference on Com-", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 114, + 320, + 261, + 331 + ], + "spans": [ + { + "bbox": [ + 114, + 320, + 261, + 331 + ], + "score": 1.0, + "content": "puter Vision (ICCV), October 2019.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 296, + 505, + 331 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 338, + 504, + 371 + ], + "lines": [ + { + "bbox": [ + 106, + 338, + 504, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 504, + 351 + ], + "score": 1.0, + "content": "Wonpyo Park, Dongju Kim, Yan Lu, and Minsu Cho. Relational knowledge distillation. In Pro-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 349, + 505, + 362 + ], + "spans": [ + { + "bbox": [ + 115, + 349, + 505, + 362 + ], + "score": 1.0, + "content": "ceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3967–3976,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 115, + 358, + 143, + 373 + ], + "spans": [ + { + "bbox": [ + 115, + 358, + 143, + 373 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 106, + 338, + 505, + 373 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 379, + 506, + 435 + ], + "lines": [ + { + "bbox": [ + 106, + 379, + 505, + 392 + ], + "spans": [ + { + "bbox": [ + 106, + 379, + 505, + 392 + ], + "score": 1.0, + "content": "Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 116, + 391, + 505, + 403 + ], + "spans": [ + { + "bbox": [ + 116, + 391, + 505, + 403 + ], + "score": 1.0, + "content": "Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 400, + 506, + 416 + ], + "spans": [ + { + "bbox": [ + 115, + 400, + 506, + 416 + ], + "score": 1.0, + "content": "Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner,", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 114, + 411, + 506, + 427 + ], + "spans": [ + { + "bbox": [ + 114, + 411, + 506, + 427 + ], + "score": 1.0, + "content": "Lu Fang, Junjie Bai, and Soumith Chintala. Pytorch: An imperative style, high-performance deep", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 115, + 423, + 324, + 436 + ], + "spans": [ + { + "bbox": [ + 115, + 423, + 324, + 436 + ], + "score": 1.0, + "content": "learning library. In NeurIPS, pp. 8024–8035. 2019.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 106, + 379, + 506, + 436 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 442, + 505, + 477 + ], + "lines": [ + { + "bbox": [ + 105, + 442, + 506, + 456 + ], + "spans": [ + { + "bbox": [ + 105, + 442, + 506, + 456 + ], + "score": 1.0, + "content": "Shaoqing Ren, Kaiming He, Ross Girshick, and Jian Sun. Faster r-cnn: Towards real-time object", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 453, + 506, + 467 + ], + "spans": [ + { + "bbox": [ + 115, + 453, + 506, + 467 + ], + "score": 1.0, + "content": "detection with region proposal networks. In Advances in neural information processing systems,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 465, + 186, + 477 + ], + "spans": [ + { + "bbox": [ + 115, + 465, + 186, + 477 + ], + "score": 1.0, + "content": "pp. 91–99, 2015.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 442, + 506, + 477 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 483, + 504, + 507 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 505, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 505, + 496 + ], + "score": 1.0, + "content": "Adriana Romero, Nicolas Ballas, Samira Ebrahimi Kahou, Antoine Chassang, Carlo Gatta, and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 495, + 378, + 507 + ], + "spans": [ + { + "bbox": [ + 116, + 495, + 378, + 507 + ], + "score": 1.0, + "content": "Yoshua Bengio. Fitnets: Hints for thin deep nets. In ICLR, 2015.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 483, + 505, + 507 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 513, + 506, + 548 + ], + "lines": [ + { + "bbox": [ + 106, + 514, + 504, + 527 + ], + "spans": [ + { + "bbox": [ + 106, + 514, + 504, + 527 + ], + "score": 1.0, + "content": "Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedi-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 525, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 525, + 505, + 538 + ], + "score": 1.0, + "content": "cal image segmentation. In International Conference on Medical image computing and computer-", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 115, + 536, + 322, + 548 + ], + "spans": [ + { + "bbox": [ + 115, + 536, + 322, + 548 + ], + "score": 1.0, + "content": "assisted intervention, pp. 234–241. Springer, 2015.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32, + "bbox_fs": [ + 106, + 514, + 505, + 548 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 555, + 504, + 590 + ], + "lines": [ + { + "bbox": [ + 105, + 554, + 505, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 505, + 568 + ], + "score": 1.0, + "content": "Mark Sandler, Andrew Howard, Menglong Zhu, Andrey Zhmoginov, and Liang-Chieh Chen. Mo-", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 566, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 116, + 566, + 505, + 579 + ], + "score": 1.0, + "content": "bilenetv2: Inverted residuals and linear bottlenecks. In Proceedings of the IEEE Conference on", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 117, + 577, + 378, + 591 + ], + "spans": [ + { + "bbox": [ + 117, + 577, + 378, + 591 + ], + "score": 1.0, + "content": "Computer Vision and Pattern Recognition, pp. 4510–4520, 2018.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 554, + 505, + 591 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 596, + 504, + 620 + ], + "lines": [ + { + "bbox": [ + 107, + 596, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 107, + 596, + 506, + 609 + ], + "score": 1.0, + "content": "Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf. Distilbert, a distilled version of", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 608, + 443, + 621 + ], + "spans": [ + { + "bbox": [ + 115, + 608, + 443, + 621 + ], + "score": 1.0, + "content": "bert: smaller, faster, cheaper and lighter. arXiv preprint arXiv:1910.01108, 2019.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 107, + 596, + 506, + 621 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 627, + 504, + 650 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 640 + ], + "score": 1.0, + "content": "Frederick Tung and Greg Mori. Similarity-preserving knowledge distillation. In Proceedings of the", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 637, + 418, + 650 + ], + "spans": [ + { + "bbox": [ + 116, + 637, + 418, + 650 + ], + "score": 1.0, + "content": "IEEE International Conference on Computer Vision, pp. 1365–1374, 2019.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 39.5, + "bbox_fs": [ + 105, + 626, + 505, + 650 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 657, + 504, + 691 + ], + "lines": [ + { + "bbox": [ + 106, + 657, + 505, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 657, + 505, + 669 + ], + "score": 1.0, + "content": "Tao Wang, Li Yuan, Xiaopeng Zhang, and Jiashi Feng. Distilling object detectors with fine-grained", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 115, + 667, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 115, + 667, + 505, + 682 + ], + "score": 1.0, + "content": "feature imitation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recog-", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 116, + 679, + 234, + 691 + ], + "spans": [ + { + "bbox": [ + 116, + 679, + 234, + 691 + ], + "score": 1.0, + "content": "nition, pp. 4933–4942, 2019.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42, + "bbox_fs": [ + 106, + 657, + 505, + 691 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 698, + 505, + 731 + ], + "lines": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 505, + 711 + ], + "score": 1.0, + "content": "Xiaolong Wang, Ross Girshick, Abhinav Gupta, and Kaiming He. Non-local neural networks. In", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 115, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 7794–7803,", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 114, + 718, + 143, + 733 + ], + "spans": [ + { + "bbox": [ + 114, + 718, + 143, + 733 + ], + "score": 1.0, + "content": "2018.", + "type": "text" + } + ], + "index": 46 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 698, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Canwen Xu, Wangchunshu Zhou, Tao Ge, Furu Wei, and Ming Zhou. Bert-of-theseus: Compressing", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 433, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 433, + 106 + ], + "score": 1.0, + "content": "bert by progressive module replacing. arXiv preprint arXiv:2002.02925, 2020.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 113, + 504, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 112, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 112, + 505, + 127 + ], + "score": 1.0, + "content": "Ze Yang, Shaohui Liu, Han Hu, Liwei Wang, and Stephen Lin. Reppoints: Point set representation", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 124, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 115, + 124, + 505, + 137 + ], + "score": 1.0, + "content": "for object detection. In The IEEE International Conference on Computer Vision (ICCV), Oct", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 114, + 134, + 143, + 148 + ], + "spans": [ + { + "bbox": [ + 114, + 134, + 143, + 148 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 108, + 155, + 504, + 190 + ], + "lines": [ + { + "bbox": [ + 106, + 156, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 156, + 505, + 168 + ], + "score": 1.0, + "content": "Junho Yim, Donggyu Joo, Jihoon Bae, and Junmo Kim. A gift from knowledge distillation: Fast", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 167, + 505, + 180 + ], + "spans": [ + { + "bbox": [ + 116, + 167, + 505, + 180 + ], + "score": 1.0, + "content": "optimization, network minimization and transfer learning. In Proceedings of the IEEE Conference", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 178, + 390, + 190 + ], + "spans": [ + { + "bbox": [ + 116, + 178, + 390, + 190 + ], + "score": 1.0, + "content": "on Computer Vision and Pattern Recognition, pp. 4133–4141, 2017.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 198, + 505, + 221 + ], + "lines": [ + { + "bbox": [ + 105, + 197, + 506, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 506, + 212 + ], + "score": 1.0, + "content": "Li Yuan, Francis EH Tay, Guilin Li, Tao Wang, and Jiashi Feng. Revisit knowledge distillation: a", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 209, + 378, + 221 + ], + "spans": [ + { + "bbox": [ + 115, + 209, + 378, + 221 + ], + "score": 1.0, + "content": "teacher-free framework. arXiv preprint arXiv:1909.11723, 2019.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 105, + 229, + 503, + 252 + ], + "lines": [ + { + "bbox": [ + 106, + 230, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 505, + 243 + ], + "score": 1.0, + "content": "Sergey Zagoruyko and Nikos Komodakis. Paying more attention to attention: Improving the perfor-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 241, + 429, + 252 + ], + "spans": [ + { + "bbox": [ + 115, + 241, + 429, + 252 + ], + "score": 1.0, + "content": "mance of convolutional neural networks via attention transfer. In ICLR, 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "text", + "bbox": [ + 108, + 260, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Hongkai Zhang, Hong Chang, Bingpeng Ma, Naiyan Wang, and Xilin Chen. Dynamic R-CNN:", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 271, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 115, + 271, + 506, + 285 + ], + "score": 1.0, + "content": "Towards high quality object detection via dynamic training. arXiv preprint arXiv:2004.06002,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 280, + 147, + 295 + ], + "spans": [ + { + "bbox": [ + 115, + 280, + 147, + 295 + ], + "score": 1.0, + "content": "2020a.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 106, + 302, + 506, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 302, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 316 + ], + "score": 1.0, + "content": "Linfeng Zhang, Jiebo Song, Anni Gao, Jingwei Chen, Chenglong Bao, and Kaisheng Ma. Be your", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 314, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 116, + 314, + 505, + 325 + ], + "score": 1.0, + "content": "own teacher: Improve the performance of convolutional neural networks via self distillation. In", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 325, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 325, + 506, + 338 + ], + "score": 1.0, + "content": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), October", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 335, + 147, + 348 + ], + "spans": [ + { + "bbox": [ + 115, + 335, + 147, + 348 + ], + "score": 1.0, + "content": "2019a.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5 + }, + { + "type": "text", + "bbox": [ + 106, + 356, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 105, + 356, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 370 + ], + "score": 1.0, + "content": "Linfeng Zhang, Zhanhong Tan, Jiebo Song, Jingwei Chen, Chenglong Bao, and Kaisheng Ma. Scan:", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 116, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "A scalable neural networks framework towards compact and efficient models. In Advances in", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 378, + 485, + 392 + ], + "spans": [ + { + "bbox": [ + 115, + 378, + 485, + 392 + ], + "score": 1.0, + "content": "Neural Information Processing Systems 32, pp. 4027–4036. Curran Associates, Inc., 2019b.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 107, + 398, + 504, + 433 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 505, + 412 + ], + "score": 1.0, + "content": "Linfeng Zhang, Muzhou Yu, Tong Chen, Zuoqiang Shi, Chenglong Bao, and Kaisheng Ma. Auxil-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 408, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 115, + 408, + 506, + 423 + ], + "score": 1.0, + "content": "iary training: Towards accurate and robust models. In Proceedings of the IEEE/CVF Conference", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 420, + 385, + 434 + ], + "spans": [ + { + "bbox": [ + 116, + 420, + 385, + 434 + ], + "score": 1.0, + "content": "on Computer Vision and Pattern Recognition, pp. 372–381, 2020b.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 108, + 440, + 503, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 455 + ], + "score": 1.0, + "content": "Tianyun Zhang, Shaokai Ye, Kaiqi Zhang, Jian Tang, Wujie Wen, Makan Fardad, and Yanzhi Wang.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 115, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "A systematic dnn weight pruning framework using alternating direction method of multipliers. In", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 461, + 413, + 475 + ], + "spans": [ + { + "bbox": [ + 115, + 461, + 413, + 475 + ], + "score": 1.0, + "content": "The European Conference on Computer Vision (ECCV), September 2018.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 483, + 502, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 504, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 504, + 496 + ], + "score": 1.0, + "content": "Aojun Zhou, Anbang Yao, Yiwen Guo, Lin Xu, and Yurong Chen. Incremental network quantiza-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 494, + 504, + 507 + ], + "spans": [ + { + "bbox": [ + 115, + 494, + 504, + 507 + ], + "score": 1.0, + "content": "tion: Towards lossless cnns with low-precision weights. arXiv preprint arXiv:1702.03044, 2017.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 106, + 514, + 505, + 548 + ], + "lines": [ + { + "bbox": [ + 104, + 512, + 506, + 528 + ], + "spans": [ + { + "bbox": [ + 104, + 512, + 506, + 528 + ], + "score": 1.0, + "content": "Bolei Zhou, Aditya Khosla, Agata Lapedriza, Aude Oliva, and Antonio Torralba. Learning deep", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 524, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 524, + 505, + 538 + ], + "score": 1.0, + "content": "features for discriminative localization. In Proceedings of the IEEE Conference on Computer", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 117, + 536, + 325, + 549 + ], + "spans": [ + { + "bbox": [ + 117, + 536, + 325, + 549 + ], + "score": 1.0, + "content": "Vision and Pattern Recognition (CVPR), June 2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 109, + 556, + 503, + 590 + ], + "lines": [ + { + "bbox": [ + 107, + 555, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 107, + 555, + 505, + 569 + ], + "score": 1.0, + "content": "Chenchen Zhu, Yihui He, and Marios Savvides. Feature selective anchor-free module for single-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 117, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 117, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "shot object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 578, + 249, + 590 + ], + "spans": [ + { + "bbox": [ + 115, + 578, + 249, + 590 + ], + "score": 1.0, + "content": "Recognition, pp. 840–849, 2019.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "title", + "bbox": [ + 109, + 612, + 451, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 612, + 453, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 453, + 627 + ], + "score": 1.0, + "content": "A ABLATION STUDY ON THE SPATIAL AND CHANNEL ATTENTION", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 637, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Different from previous attention-based knowledge distillation methods, the attention-guided distil-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "lation in our methods uses not only spatial attention but also the channel attention. In this appendix,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "we have conducted an ablation study on the two kinds of attention with Faster RCNN (ResNet50)", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 671, + 340, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 340, + 682 + ], + "score": 1.0, + "content": "on MS COCO2017 to show their individual effectiveness.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "It is observed that spatial attention and channel attention lead to 2.6 and 2.3 AP improvements, re-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 413, + 711 + ], + "score": 1.0, + "content": "spectively. In contrast, the combination of the two kinds of attention leads to", + "type": "text" + }, + { + "bbox": [ + 413, + 699, + 443, + 709 + ], + "score": 0.26, + "content": "2 . 8 \\mathrm { \\ A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "improvements.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 709, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 721 + ], + "score": 1.0, + "content": "These results indicate that both spatial and channel attention have their individual effectiveness and", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 721, + 344, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 344, + 732 + ], + "score": 1.0, + "content": "they can be utilized together to achieve better performance.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5 + } + ], + "page_idx": 11, + "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": [ + 301, + 751, + 311, + 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": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "score": 1.0, + "content": "Canwen Xu, Wangchunshu Zhou, Tao Ge, Furu Wei, and Ming Zhou. Bert-of-theseus: Compressing", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 115, + 93, + 433, + 106 + ], + "spans": [ + { + "bbox": [ + 115, + 93, + 433, + 106 + ], + "score": 1.0, + "content": "bert by progressive module replacing. arXiv preprint arXiv:2002.02925, 2020.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 113, + 504, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 112, + 505, + 127 + ], + "spans": [ + { + "bbox": [ + 105, + 112, + 505, + 127 + ], + "score": 1.0, + "content": "Ze Yang, Shaohui Liu, Han Hu, Liwei Wang, and Stephen Lin. Reppoints: Point set representation", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 124, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 115, + 124, + 505, + 137 + ], + "score": 1.0, + "content": "for object detection. In The IEEE International Conference on Computer Vision (ICCV), Oct", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 114, + 134, + 143, + 148 + ], + "spans": [ + { + "bbox": [ + 114, + 134, + 143, + 148 + ], + "score": 1.0, + "content": "2019.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 112, + 505, + 148 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 155, + 504, + 190 + ], + "lines": [ + { + "bbox": [ + 106, + 156, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 156, + 505, + 168 + ], + "score": 1.0, + "content": "Junho Yim, Donggyu Joo, Jihoon Bae, and Junmo Kim. A gift from knowledge distillation: Fast", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 167, + 505, + 180 + ], + "spans": [ + { + "bbox": [ + 116, + 167, + 505, + 180 + ], + "score": 1.0, + "content": "optimization, network minimization and transfer learning. In Proceedings of the IEEE Conference", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 116, + 178, + 390, + 190 + ], + "spans": [ + { + "bbox": [ + 116, + 178, + 390, + 190 + ], + "score": 1.0, + "content": "on Computer Vision and Pattern Recognition, pp. 4133–4141, 2017.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 156, + 505, + 190 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 198, + 505, + 221 + ], + "lines": [ + { + "bbox": [ + 105, + 197, + 506, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 506, + 212 + ], + "score": 1.0, + "content": "Li Yuan, Francis EH Tay, Guilin Li, Tao Wang, and Jiashi Feng. Revisit knowledge distillation: a", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 209, + 378, + 221 + ], + "spans": [ + { + "bbox": [ + 115, + 209, + 378, + 221 + ], + "score": 1.0, + "content": "teacher-free framework. arXiv preprint arXiv:1909.11723, 2019.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 197, + 506, + 221 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 229, + 503, + 252 + ], + "lines": [ + { + "bbox": [ + 106, + 230, + 505, + 243 + ], + "spans": [ + { + "bbox": [ + 106, + 230, + 505, + 243 + ], + "score": 1.0, + "content": "Sergey Zagoruyko and Nikos Komodakis. Paying more attention to attention: Improving the perfor-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 241, + 429, + 252 + ], + "spans": [ + { + "bbox": [ + 115, + 241, + 429, + 252 + ], + "score": 1.0, + "content": "mance of convolutional neural networks via attention transfer. In ICLR, 2017.", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 106, + 230, + 505, + 252 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 260, + 504, + 294 + ], + "lines": [ + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "spans": [ + { + "bbox": [ + 106, + 261, + 505, + 273 + ], + "score": 1.0, + "content": "Hongkai Zhang, Hong Chang, Bingpeng Ma, Naiyan Wang, and Xilin Chen. Dynamic R-CNN:", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 115, + 271, + 506, + 285 + ], + "spans": [ + { + "bbox": [ + 115, + 271, + 506, + 285 + ], + "score": 1.0, + "content": "Towards high quality object detection via dynamic training. arXiv preprint arXiv:2004.06002,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 115, + 280, + 147, + 295 + ], + "spans": [ + { + "bbox": [ + 115, + 280, + 147, + 295 + ], + "score": 1.0, + "content": "2020a.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 261, + 506, + 295 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 302, + 506, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 302, + 506, + 316 + ], + "spans": [ + { + "bbox": [ + 105, + 302, + 506, + 316 + ], + "score": 1.0, + "content": "Linfeng Zhang, Jiebo Song, Anni Gao, Jingwei Chen, Chenglong Bao, and Kaisheng Ma. Be your", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 314, + 505, + 325 + ], + "spans": [ + { + "bbox": [ + 116, + 314, + 505, + 325 + ], + "score": 1.0, + "content": "own teacher: Improve the performance of convolutional neural networks via self distillation. In", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 115, + 325, + 506, + 338 + ], + "spans": [ + { + "bbox": [ + 115, + 325, + 506, + 338 + ], + "score": 1.0, + "content": "Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), October", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 335, + 147, + 348 + ], + "spans": [ + { + "bbox": [ + 115, + 335, + 147, + 348 + ], + "score": 1.0, + "content": "2019a.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 16.5, + "bbox_fs": [ + 105, + 302, + 506, + 348 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 356, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 105, + 356, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 505, + 370 + ], + "score": 1.0, + "content": "Linfeng Zhang, Zhanhong Tan, Jiebo Song, Jingwei Chen, Chenglong Bao, and Kaisheng Ma. Scan:", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 116, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "A scalable neural networks framework towards compact and efficient models. In Advances in", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 115, + 378, + 485, + 392 + ], + "spans": [ + { + "bbox": [ + 115, + 378, + 485, + 392 + ], + "score": 1.0, + "content": "Neural Information Processing Systems 32, pp. 4027–4036. Curran Associates, Inc., 2019b.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 356, + 506, + 392 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 398, + 504, + 433 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 505, + 412 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 505, + 412 + ], + "score": 1.0, + "content": "Linfeng Zhang, Muzhou Yu, Tong Chen, Zuoqiang Shi, Chenglong Bao, and Kaisheng Ma. Auxil-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 408, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 115, + 408, + 506, + 423 + ], + "score": 1.0, + "content": "iary training: Towards accurate and robust models. In Proceedings of the IEEE/CVF Conference", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 420, + 385, + 434 + ], + "spans": [ + { + "bbox": [ + 116, + 420, + 385, + 434 + ], + "score": 1.0, + "content": "on Computer Vision and Pattern Recognition, pp. 372–381, 2020b.", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 398, + 506, + 434 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 440, + 503, + 474 + ], + "lines": [ + { + "bbox": [ + 105, + 439, + 505, + 455 + ], + "spans": [ + { + "bbox": [ + 105, + 439, + 505, + 455 + ], + "score": 1.0, + "content": "Tianyun Zhang, Shaokai Ye, Kaiqi Zhang, Jian Tang, Wujie Wen, Makan Fardad, and Yanzhi Wang.", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 115, + 452, + 505, + 464 + ], + "spans": [ + { + "bbox": [ + 115, + 452, + 505, + 464 + ], + "score": 1.0, + "content": "A systematic dnn weight pruning framework using alternating direction method of multipliers. In", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 115, + 461, + 413, + 475 + ], + "spans": [ + { + "bbox": [ + 115, + 461, + 413, + 475 + ], + "score": 1.0, + "content": "The European Conference on Computer Vision (ECCV), September 2018.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 439, + 505, + 475 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 483, + 502, + 506 + ], + "lines": [ + { + "bbox": [ + 106, + 483, + 504, + 496 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 504, + 496 + ], + "score": 1.0, + "content": "Aojun Zhou, Anbang Yao, Yiwen Guo, Lin Xu, and Yurong Chen. Incremental network quantiza-", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 115, + 494, + 504, + 507 + ], + "spans": [ + { + "bbox": [ + 115, + 494, + 504, + 507 + ], + "score": 1.0, + "content": "tion: Towards lossless cnns with low-precision weights. arXiv preprint arXiv:1702.03044, 2017.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 106, + 483, + 504, + 507 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 514, + 505, + 548 + ], + "lines": [ + { + "bbox": [ + 104, + 512, + 506, + 528 + ], + "spans": [ + { + "bbox": [ + 104, + 512, + 506, + 528 + ], + "score": 1.0, + "content": "Bolei Zhou, Aditya Khosla, Agata Lapedriza, Aude Oliva, and Antonio Torralba. Learning deep", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 116, + 524, + 505, + 538 + ], + "spans": [ + { + "bbox": [ + 116, + 524, + 505, + 538 + ], + "score": 1.0, + "content": "features for discriminative localization. In Proceedings of the IEEE Conference on Computer", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 117, + 536, + 325, + 549 + ], + "spans": [ + { + "bbox": [ + 117, + 536, + 325, + 549 + ], + "score": 1.0, + "content": "Vision and Pattern Recognition (CVPR), June 2016.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31, + "bbox_fs": [ + 104, + 512, + 506, + 549 + ] + }, + { + "type": "text", + "bbox": [ + 109, + 556, + 503, + 590 + ], + "lines": [ + { + "bbox": [ + 107, + 555, + 505, + 569 + ], + "spans": [ + { + "bbox": [ + 107, + 555, + 505, + 569 + ], + "score": 1.0, + "content": "Chenchen Zhu, Yihui He, and Marios Savvides. Feature selective anchor-free module for single-", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 117, + 567, + 505, + 579 + ], + "spans": [ + { + "bbox": [ + 117, + 567, + 505, + 579 + ], + "score": 1.0, + "content": "shot object detection. In Proceedings of the IEEE Conference on Computer Vision and Pattern", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 115, + 578, + 249, + 590 + ], + "spans": [ + { + "bbox": [ + 115, + 578, + 249, + 590 + ], + "score": 1.0, + "content": "Recognition, pp. 840–849, 2019.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 107, + 555, + 505, + 590 + ] + }, + { + "type": "title", + "bbox": [ + 109, + 612, + 451, + 625 + ], + "lines": [ + { + "bbox": [ + 106, + 612, + 453, + 627 + ], + "spans": [ + { + "bbox": [ + 106, + 612, + 453, + 627 + ], + "score": 1.0, + "content": "A ABLATION STUDY ON THE SPATIAL AND CHANNEL ATTENTION", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 107, + 637, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 505, + 650 + ], + "score": 1.0, + "content": "Different from previous attention-based knowledge distillation methods, the attention-guided distil-", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 649, + 505, + 661 + ], + "score": 1.0, + "content": "lation in our methods uses not only spatial attention but also the channel attention. In this appendix,", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "spans": [ + { + "bbox": [ + 106, + 660, + 505, + 672 + ], + "score": 1.0, + "content": "we have conducted an ablation study on the two kinds of attention with Faster RCNN (ResNet50)", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 671, + 340, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 340, + 682 + ], + "score": 1.0, + "content": "on MS COCO2017 to show their individual effectiveness.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 638, + 505, + 682 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 687, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 686, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 104, + 686, + 505, + 700 + ], + "score": 1.0, + "content": "It is observed that spatial attention and channel attention lead to 2.6 and 2.3 AP improvements, re-", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 413, + 711 + ], + "score": 1.0, + "content": "spectively. In contrast, the combination of the two kinds of attention leads to", + "type": "text" + }, + { + "bbox": [ + 413, + 699, + 443, + 709 + ], + "score": 0.26, + "content": "2 . 8 \\mathrm { \\ A P }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "improvements.", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 709, + 505, + 721 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 721 + ], + "score": 1.0, + "content": "These results indicate that both spatial and channel attention have their individual effectiveness and", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 721, + 344, + 732 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 344, + 732 + ], + "score": 1.0, + "content": "they can be utilized together to achieve better performance.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 42.5, + "bbox_fs": [ + 104, + 686, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 192, + 105, + 419, + 184 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 165, + 89, + 445, + 101 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 165, + 89, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 89, + 445, + 102 + ], + "score": 1.0, + "content": "Table 6: Ablation study on the spatial attention and channel attention.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 192, + 105, + 419, + 184 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 192, + 105, + 419, + 184 + ], + "spans": [ + { + "bbox": [ + 192, + 105, + 419, + 184 + ], + "score": 0.981, + "html": "
Attention TypeSpatial Channel× ×√ ×X √√ √
ResultAP38.441.040.741.2
APs21.522.722.923.0
APM42.144.744.144.6
APL50.354.254.155.3
", + "type": "table", + "image_path": "7acabf4b09c5067978bf878ed570b27b0ff5b9beb113ef61cc5a34e3f1e6fec6.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 192, + 105, + 419, + 118.16666666666667 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 192, + 118.16666666666667, + 419, + 131.33333333333334 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 192, + 131.33333333333334, + 419, + 144.5 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 192, + 144.5, + 419, + 157.66666666666666 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 192, + 157.66666666666666, + 419, + 170.83333333333331 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 192, + 170.83333333333331, + 419, + 183.99999999999997 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "title", + "bbox": [ + 106, + 209, + 401, + 222 + ], + "lines": [ + { + "bbox": [ + 105, + 208, + 403, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 403, + 224 + ], + "score": 1.0, + "content": "B ADAPTATION LAYERS IN KNOWLEDGE DISTILLATION", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 235, + 505, + 316 + ], + "lines": [ + { + "bbox": [ + 105, + 235, + 506, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 506, + 248 + ], + "score": 1.0, + "content": "The adaptation layers in knowledge distillation are first proposed by Romero et al. (2015) to adjust", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 245, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 260 + ], + "score": 1.0, + "content": "the feature size of students and teachers. Then, recent research finds that the adaptation layers play", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "score": 1.0, + "content": "an important role in improving the performance of students (Chen et al., 2017). In this paper, we", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "adopt different kinds of adaptation layers for different distillation loss. Concretely, We adopt 1x1", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 101, + 274, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 101, + 274, + 203, + 300 + ], + "score": 1.0, + "content": "convolutional layers for", + "type": "text" + }, + { + "bbox": [ + 203, + 281, + 226, + 293 + ], + "score": 0.93, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 274, + 243, + 300 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 243, + 281, + 271, + 293 + ], + "score": 0.86, + "content": "\\mathcal { L } _ { N L D }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 274, + 274, + 300 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 274, + 281, + 291, + 292 + ], + "score": 0.38, + "content": "3 { \\tt X } 3", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 274, + 388, + 300 + ], + "score": 1.0, + "content": "convolutional layers for", + "type": "text" + }, + { + "bbox": [ + 388, + 279, + 421, + 294 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { A T } ^ { s p a t i a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 274, + 506, + 300 + ], + "score": 1.0, + "content": ", and fully connected", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 101, + 287, + 509, + 317 + ], + "spans": [ + { + "bbox": [ + 101, + 287, + 147, + 317 + ], + "score": 1.0, + "content": "layers for don’t intr", + "type": "text" + }, + { + "bbox": [ + 147, + 293, + 184, + 306 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { A T } ^ { c h a n n e l }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 287, + 509, + 317 + ], + "score": 1.0, + "content": ". Note that the adaptation layers are only utilized in the training period and theyitional computation and parameters.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5 + }, + { + "type": "title", + "bbox": [ + 107, + 334, + 341, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 332, + 342, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 332, + 342, + 348 + ], + "score": 1.0, + "content": "C EXPERIMENTS ON SMALLER BACKBONES", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 360, + 505, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 504, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 504, + 372 + ], + "score": 1.0, + "content": "According to the insightful comments of the reviewers, we conduct a series of experiments on mod-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 369, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 384 + ], + "score": 1.0, + "content": "els with small backbones including ResNet18 and RegNet-800M, and compact detectors including", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "Yolo v3 and SSD. As shown in Table 7, our methods also achieve significant AP improvements", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 392, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 506, + 405 + ], + "score": 1.0, + "content": "on these compact models. Note that more experiments with small backbones will be added in the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 404, + 196, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 196, + 417 + ], + "score": 1.0, + "content": "camera ready version.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17 + }, + { + "type": "table", + "bbox": [ + 105, + 456, + 514, + 636 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 145, + 436, + 464, + 448 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 145, + 435, + 466, + 450 + ], + "spans": [ + { + "bbox": [ + 145, + 435, + 466, + 450 + ], + "score": 1.0, + "content": "Table 7: Experiments on MS COCO2017 with our method on small backbones.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "table_body", + "bbox": [ + 105, + 456, + 514, + 636 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 456, + 514, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 514, + 636 + ], + "score": 0.985, + "html": "
ModelBackboneAPAP50AP75APsAPMAPLFPS Params
Faster RCNN Our Faster RCNNResNet18 ResNet1834.6 37.055.0 57.237.1 39.719.3 19.936.9 39.745.9 50.328.1 28.130.57 30.57
Grid RCNNResNet1836.654.239.720.139.848.226.766.37
Our Grid RCNN RetinaNetResNet18 ResNet1838.8 33.456.7 51.841.5 35.121.1 16.941.6 35.652.7 44.926.7 25.866.37 23.30
Our RetinaNet RetinaNetResNet18 RegNet-800M35.9 35.654.4 54.738.0 37.717.9 19.739.1 39.049.4 47.825.8 22.423.30 19.27
Our RetinaNet Yolo v3RegNet-800M DarkNet5338.4 33.457.4 56.340.7 35.221.4 19.542.0 36.452.3 43.622.4 42.219.27 61.95
Our Yolo v3DarkNet5335.858.238.121.239.045.642.261.95
SSD Our SSDVGG16 VGG1629.4 31.249.3 52.131.0 32.811.7 12.634.1 37.444.9 46.226.1 26.138.08 38.08
", + "type": "table", + "image_path": "caa8e517e6577264cea211b227c692d7b1e87f2d1f6bf744efed0323e02c83ba.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 105, + 456, + 514, + 516.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 105, + 516.0, + 514, + 576.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 105, + 576.0, + 514, + 636.0 + ], + "spans": [], + "index": 23 + } + ] + } + ], + "index": 21.0 + }, + { + "type": "title", + "bbox": [ + 108, + 672, + 288, + 685 + ], + "lines": [ + { + "bbox": [ + 105, + 671, + 290, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 290, + 687 + ], + "score": 1.0, + "content": "D EXPERIMENTS ON CITYSCAPES", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "According to the insightful comments of the reviewers, as shown in Table 8, we conduct a series of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "experiments to show the effectiveness of our method on Cityscapes. Note that more experiments on", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 720, + 323, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 323, + 733 + ], + "score": 1.0, + "content": "Cityscapes will be added in the camera ready version.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + } + ], + "page_idx": 12, + "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, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "13", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 192, + 105, + 419, + 184 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 165, + 89, + 445, + 101 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 165, + 89, + 445, + 102 + ], + "spans": [ + { + "bbox": [ + 165, + 89, + 445, + 102 + ], + "score": 1.0, + "content": "Table 6: Ablation study on the spatial attention and channel attention.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 192, + 105, + 419, + 184 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 192, + 105, + 419, + 184 + ], + "spans": [ + { + "bbox": [ + 192, + 105, + 419, + 184 + ], + "score": 0.981, + "html": "
Attention TypeSpatial Channel× ×√ ×X √√ √
ResultAP38.441.040.741.2
APs21.522.722.923.0
APM42.144.744.144.6
APL50.354.254.155.3
", + "type": "table", + "image_path": "7acabf4b09c5067978bf878ed570b27b0ff5b9beb113ef61cc5a34e3f1e6fec6.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 192, + 105, + 419, + 118.16666666666667 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 192, + 118.16666666666667, + 419, + 131.33333333333334 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 192, + 131.33333333333334, + 419, + 144.5 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 192, + 144.5, + 419, + 157.66666666666666 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 192, + 157.66666666666666, + 419, + 170.83333333333331 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 192, + 170.83333333333331, + 419, + 183.99999999999997 + ], + "spans": [], + "index": 6 + } + ] + } + ], + "index": 1.75 + }, + { + "type": "title", + "bbox": [ + 106, + 209, + 401, + 222 + ], + "lines": [ + { + "bbox": [ + 105, + 208, + 403, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 403, + 224 + ], + "score": 1.0, + "content": "B ADAPTATION LAYERS IN KNOWLEDGE DISTILLATION", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 235, + 505, + 316 + ], + "lines": [ + { + "bbox": [ + 105, + 235, + 506, + 248 + ], + "spans": [ + { + "bbox": [ + 105, + 235, + 506, + 248 + ], + "score": 1.0, + "content": "The adaptation layers in knowledge distillation are first proposed by Romero et al. (2015) to adjust", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 245, + 505, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 245, + 505, + 260 + ], + "score": 1.0, + "content": "the feature size of students and teachers. Then, recent research finds that the adaptation layers play", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "spans": [ + { + "bbox": [ + 105, + 257, + 506, + 270 + ], + "score": 1.0, + "content": "an important role in improving the performance of students (Chen et al., 2017). In this paper, we", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 268, + 505, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 268, + 505, + 281 + ], + "score": 1.0, + "content": "adopt different kinds of adaptation layers for different distillation loss. Concretely, We adopt 1x1", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 101, + 274, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 101, + 274, + 203, + 300 + ], + "score": 1.0, + "content": "convolutional layers for", + "type": "text" + }, + { + "bbox": [ + 203, + 281, + 226, + 293 + ], + "score": 0.93, + "content": "\\mathcal { L } _ { A M }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 274, + 243, + 300 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 243, + 281, + 271, + 293 + ], + "score": 0.86, + "content": "\\mathcal { L } _ { N L D }", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 274, + 274, + 300 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 274, + 281, + 291, + 292 + ], + "score": 0.38, + "content": "3 { \\tt X } 3", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 274, + 388, + 300 + ], + "score": 1.0, + "content": "convolutional layers for", + "type": "text" + }, + { + "bbox": [ + 388, + 279, + 421, + 294 + ], + "score": 0.92, + "content": "\\mathcal { L } _ { A T } ^ { s p a t i a l }", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 274, + 506, + 300 + ], + "score": 1.0, + "content": ", and fully connected", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 101, + 287, + 509, + 317 + ], + "spans": [ + { + "bbox": [ + 101, + 287, + 147, + 317 + ], + "score": 1.0, + "content": "layers for don’t intr", + "type": "text" + }, + { + "bbox": [ + 147, + 293, + 184, + 306 + ], + "score": 0.88, + "content": "\\mathcal { L } _ { A T } ^ { c h a n n e l }", + "type": "inline_equation" + }, + { + "bbox": [ + 185, + 287, + 509, + 317 + ], + "score": 1.0, + "content": ". Note that the adaptation layers are only utilized in the training period and theyitional computation and parameters.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 10.5, + "bbox_fs": [ + 101, + 235, + 509, + 317 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 334, + 341, + 347 + ], + "lines": [ + { + "bbox": [ + 105, + 332, + 342, + 348 + ], + "spans": [ + { + "bbox": [ + 105, + 332, + 342, + 348 + ], + "score": 1.0, + "content": "C EXPERIMENTS ON SMALLER BACKBONES", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "text", + "bbox": [ + 107, + 360, + 505, + 416 + ], + "lines": [ + { + "bbox": [ + 106, + 360, + 504, + 372 + ], + "spans": [ + { + "bbox": [ + 106, + 360, + 504, + 372 + ], + "score": 1.0, + "content": "According to the insightful comments of the reviewers, we conduct a series of experiments on mod-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 369, + 505, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 384 + ], + "score": 1.0, + "content": "els with small backbones including ResNet18 and RegNet-800M, and compact detectors including", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 381, + 505, + 394 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 505, + 394 + ], + "score": 1.0, + "content": "Yolo v3 and SSD. As shown in Table 7, our methods also achieve significant AP improvements", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 392, + 506, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 392, + 506, + 405 + ], + "score": 1.0, + "content": "on these compact models. Note that more experiments with small backbones will be added in the", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 404, + 196, + 417 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 196, + 417 + ], + "score": 1.0, + "content": "camera ready version.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 360, + 506, + 417 + ] + }, + { + "type": "table", + "bbox": [ + 105, + 456, + 514, + 636 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 145, + 436, + 464, + 448 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 145, + 435, + 466, + 450 + ], + "spans": [ + { + "bbox": [ + 145, + 435, + 466, + 450 + ], + "score": 1.0, + "content": "Table 7: Experiments on MS COCO2017 with our method on small backbones.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "table_body", + "bbox": [ + 105, + 456, + 514, + 636 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 105, + 456, + 514, + 636 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 514, + 636 + ], + "score": 0.985, + "html": "
ModelBackboneAPAP50AP75APsAPMAPLFPS Params
Faster RCNN Our Faster RCNNResNet18 ResNet1834.6 37.055.0 57.237.1 39.719.3 19.936.9 39.745.9 50.328.1 28.130.57 30.57
Grid RCNNResNet1836.654.239.720.139.848.226.766.37
Our Grid RCNN RetinaNetResNet18 ResNet1838.8 33.456.7 51.841.5 35.121.1 16.941.6 35.652.7 44.926.7 25.866.37 23.30
Our RetinaNet RetinaNetResNet18 RegNet-800M35.9 35.654.4 54.738.0 37.717.9 19.739.1 39.049.4 47.825.8 22.423.30 19.27
Our RetinaNet Yolo v3RegNet-800M DarkNet5338.4 33.457.4 56.340.7 35.221.4 19.542.0 36.452.3 43.622.4 42.219.27 61.95
Our Yolo v3DarkNet5335.858.238.121.239.045.642.261.95
SSD Our SSDVGG16 VGG1629.4 31.249.3 52.131.0 32.811.7 12.634.1 37.444.9 46.226.1 26.138.08 38.08
", + "type": "table", + "image_path": "caa8e517e6577264cea211b227c692d7b1e87f2d1f6bf744efed0323e02c83ba.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 105, + 456, + 514, + 516.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 105, + 516.0, + 514, + 576.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 105, + 576.0, + 514, + 636.0 + ], + "spans": [], + "index": 23 + } + ] + } + ], + "index": 21.0 + }, + { + "type": "title", + "bbox": [ + 108, + 672, + 288, + 685 + ], + "lines": [ + { + "bbox": [ + 105, + 671, + 290, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 290, + 687 + ], + "score": 1.0, + "content": "D EXPERIMENTS ON CITYSCAPES", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 108, + 699, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "According to the insightful comments of the reviewers, as shown in Table 8, we conduct a series of", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "experiments to show the effectiveness of our method on Cityscapes. Note that more experiments on", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 720, + 323, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 323, + 733 + ], + "score": 1.0, + "content": "Cityscapes will be added in the camera ready version.", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 106, + 699, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 198, + 101, + 412, + 173 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 197, + 89, + 414, + 101 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 196, + 87, + 414, + 103 + ], + "spans": [ + { + "bbox": [ + 196, + 87, + 414, + 103 + ], + "score": 1.0, + "content": "Table 8: Experiments on Cityscapes with our method.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 198, + 101, + 412, + 173 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 198, + 101, + 412, + 173 + ], + "spans": [ + { + "bbox": [ + 198, + 101, + 412, + 173 + ], + "score": 0.982, + "html": "
ModelBackboneBox APMask AP
Faster RCNNResNet5040.3N/A
Our Faster RCNNResNet5043.5N/A
Mask RCNNResNet5041.035.8
Our Mask RCNNResNet5043.037.5
", + "type": "table", + "image_path": "62f91122962eb7235738d42fed3116b6f3512c68a10d204eff8b1c8af33a6a5c.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 198, + 101, + 412, + 115.4 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 198, + 115.4, + 412, + 129.8 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 198, + 129.8, + 412, + 144.20000000000002 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 198, + 144.20000000000002, + 412, + 158.60000000000002 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 198, + 158.60000000000002, + 412, + 173.00000000000003 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 1.5 + }, + { + "type": "title", + "bbox": [ + 106, + 196, + 319, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 320, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 320, + 211 + ], + "score": 1.0, + "content": "E COMPARISION WITH RELATED WORK", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 221, + 505, + 332 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 504, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 504, + 234 + ], + "score": 1.0, + "content": "Comparison on Methodology and Application. Feature distillation is utilized in all the five meth-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 232, + 504, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 504, + 245 + ], + "score": 1.0, + "content": "ods. However, Chen et al. distill not only the feature, but also the classification logits and bound-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "ing box regression results, which has limited their application scenes in one stage and anchor-free", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 254, + 506, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 506, + 267 + ], + "score": 1.0, + "content": "models. Li et al. and Wang et al. distill the features in the regions of proposals and near object", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 266, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 506, + 278 + ], + "score": 1.0, + "content": "anchor locations, respectively. As a result, their methods reply on the supervision of anchors and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 276, + 506, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 506, + 289 + ], + "score": 1.0, + "content": "groundtruths and can’t be utilized in one stage and anchor free models. Bajestani & Yang is utilized", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 287, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 506, + 300 + ], + "score": 1.0, + "content": "for active perception on video, which can not be utilized in image-based detection. In contrast, in", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 299, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 311 + ], + "score": 1.0, + "content": "our method, the attention mask and relation information can be easily generated from the backbone", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "score": 1.0, + "content": "features, which has no requirements on groundtruths, anchors and proposals. As a result, it can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 321, + 411, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 411, + 333 + ], + "score": 1.0, + "content": "easily used in different kinds of models and tasks without any modification.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5 + }, + { + "type": "table", + "bbox": [ + 106, + 371, + 505, + 450 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 194, + 356, + 416, + 368 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 193, + 354, + 417, + 369 + ], + "spans": [ + { + "bbox": [ + 193, + 354, + 417, + 369 + ], + "score": 1.0, + "content": "Table 9: Comparision on methodology and application.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "table_body", + "bbox": [ + 106, + 371, + 505, + 450 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 371, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 505, + 450 + ], + "score": 0.98, + "html": "
MethodFeature Classfy Regress Relation|One-Stage Two-Stage Anchor-based Anchor-free Segment.
Our Method×√√√√
Chen et al.××√广××
Li et al.××××√1××
Wang et al.>>>>××××√√××
Bajestani & Yang√×××√√√××
", + "type": "table", + "image_path": "6fc76be632e1640c9a39ace20db765e9a86649e80610ea40f3b40adeb382e85c.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 106, + 371, + 505, + 397.3333333333333 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 106, + 397.3333333333333, + 505, + 423.66666666666663 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 106, + 423.66666666666663, + 505, + 449.99999999999994 + ], + "spans": [], + "index": 20 + } + ] + } + ], + "index": 18.0 + }, + { + "type": "text", + "bbox": [ + 106, + 466, + 505, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "score": 1.0, + "content": "Comparison on Motivation. Chen et al.’s method is a direct application of knowledge distillation", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "on object detection. The other three methods and our method are motivated by the imbalance be-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 487, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 104, + 487, + 505, + 502 + ], + "score": 1.0, + "content": "tween foreground and background piexles and these methods try to address this issue by reweighting", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "score": 1.0, + "content": "the distillation loss. Besides, our method is also motivated by the effect of the relation among pixels", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 511, + 315, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 315, + 523 + ], + "score": 1.0, + "content": "in an image, which is ignored by the other methods.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + } + ], + "page_idx": 13, + "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, + 763 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "14", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "table", + "bbox": [ + 198, + 101, + 412, + 173 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 197, + 89, + 414, + 101 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 196, + 87, + 414, + 103 + ], + "spans": [ + { + "bbox": [ + 196, + 87, + 414, + 103 + ], + "score": 1.0, + "content": "Table 8: Experiments on Cityscapes with our method.", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "table_body", + "bbox": [ + 198, + 101, + 412, + 173 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 198, + 101, + 412, + 173 + ], + "spans": [ + { + "bbox": [ + 198, + 101, + 412, + 173 + ], + "score": 0.982, + "html": "
ModelBackboneBox APMask AP
Faster RCNNResNet5040.3N/A
Our Faster RCNNResNet5043.5N/A
Mask RCNNResNet5041.035.8
Our Mask RCNNResNet5043.037.5
", + "type": "table", + "image_path": "62f91122962eb7235738d42fed3116b6f3512c68a10d204eff8b1c8af33a6a5c.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 198, + 101, + 412, + 115.4 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 198, + 115.4, + 412, + 129.8 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 198, + 129.8, + 412, + 144.20000000000002 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 198, + 144.20000000000002, + 412, + 158.60000000000002 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 198, + 158.60000000000002, + 412, + 173.00000000000003 + ], + "spans": [], + "index": 5 + } + ] + } + ], + "index": 1.5 + }, + { + "type": "title", + "bbox": [ + 106, + 196, + 319, + 209 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 320, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 320, + 211 + ], + "score": 1.0, + "content": "E COMPARISION WITH RELATED WORK", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 221, + 505, + 332 + ], + "lines": [ + { + "bbox": [ + 106, + 222, + 504, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 222, + 504, + 234 + ], + "score": 1.0, + "content": "Comparison on Methodology and Application. Feature distillation is utilized in all the five meth-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 232, + 504, + 245 + ], + "spans": [ + { + "bbox": [ + 106, + 232, + 504, + 245 + ], + "score": 1.0, + "content": "ods. However, Chen et al. distill not only the feature, but also the classification logits and bound-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 244, + 505, + 257 + ], + "spans": [ + { + "bbox": [ + 106, + 244, + 505, + 257 + ], + "score": 1.0, + "content": "ing box regression results, which has limited their application scenes in one stage and anchor-free", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 105, + 254, + 506, + 267 + ], + "spans": [ + { + "bbox": [ + 105, + 254, + 506, + 267 + ], + "score": 1.0, + "content": "models. Li et al. and Wang et al. distill the features in the regions of proposals and near object", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 266, + 506, + 278 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 506, + 278 + ], + "score": 1.0, + "content": "anchor locations, respectively. As a result, their methods reply on the supervision of anchors and", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 276, + 506, + 289 + ], + "spans": [ + { + "bbox": [ + 105, + 276, + 506, + 289 + ], + "score": 1.0, + "content": "groundtruths and can’t be utilized in one stage and anchor free models. Bajestani & Yang is utilized", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 287, + 506, + 300 + ], + "spans": [ + { + "bbox": [ + 105, + 287, + 506, + 300 + ], + "score": 1.0, + "content": "for active perception on video, which can not be utilized in image-based detection. In contrast, in", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 106, + 299, + 505, + 311 + ], + "spans": [ + { + "bbox": [ + 106, + 299, + 505, + 311 + ], + "score": 1.0, + "content": "our method, the attention mask and relation information can be easily generated from the backbone", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "score": 1.0, + "content": "features, which has no requirements on groundtruths, anchors and proposals. As a result, it can be", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 321, + 411, + 333 + ], + "spans": [ + { + "bbox": [ + 105, + 321, + 411, + 333 + ], + "score": 1.0, + "content": "easily used in different kinds of models and tasks without any modification.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 222, + 506, + 333 + ] + }, + { + "type": "table", + "bbox": [ + 106, + 371, + 505, + 450 + ], + "blocks": [ + { + "type": "table_caption", + "bbox": [ + 194, + 356, + 416, + 368 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 193, + 354, + 417, + 369 + ], + "spans": [ + { + "bbox": [ + 193, + 354, + 417, + 369 + ], + "score": 1.0, + "content": "Table 9: Comparision on methodology and application.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "table_body", + "bbox": [ + 106, + 371, + 505, + 450 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 371, + 505, + 450 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 505, + 450 + ], + "score": 0.98, + "html": "
MethodFeature Classfy Regress Relation|One-Stage Two-Stage Anchor-based Anchor-free Segment.
Our Method×√√√√
Chen et al.××√广××
Li et al.××××√1××
Wang et al.>>>>××××√√××
Bajestani & Yang√×××√√√××
", + "type": "table", + "image_path": "6fc76be632e1640c9a39ace20db765e9a86649e80610ea40f3b40adeb382e85c.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 106, + 371, + 505, + 397.3333333333333 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 106, + 397.3333333333333, + 505, + 423.66666666666663 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 106, + 423.66666666666663, + 505, + 449.99999999999994 + ], + "spans": [], + "index": 20 + } + ] + } + ], + "index": 18.0 + }, + { + "type": "text", + "bbox": [ + 106, + 466, + 505, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 466, + 505, + 478 + ], + "score": 1.0, + "content": "Comparison on Motivation. Chen et al.’s method is a direct application of knowledge distillation", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 477, + 505, + 490 + ], + "score": 1.0, + "content": "on object detection. The other three methods and our method are motivated by the imbalance be-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 104, + 487, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 104, + 487, + 505, + 502 + ], + "score": 1.0, + "content": "tween foreground and background piexles and these methods try to address this issue by reweighting", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 105, + 498, + 505, + 512 + ], + "score": 1.0, + "content": "the distillation loss. Besides, our method is also motivated by the effect of the relation among pixels", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 511, + 315, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 511, + 315, + 523 + ], + "score": 1.0, + "content": "in an image, which is ignored by the other methods.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 104, + 466, + 505, + 523 + ] + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/uKhGRvM8QNH/uKhGRvM8QNH_model.json b/parse/train/uKhGRvM8QNH/uKhGRvM8QNH_model.json new file mode 100644 index 0000000000000000000000000000000000000000..bda3b5f601f4efd0f85e4ec491b747944034a4de --- /dev/null +++ b/parse/train/uKhGRvM8QNH/uKhGRvM8QNH_model.json @@ -0,0 +1,18123 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 397, + 671, + 1302, + 671, + 1302, + 1217, + 397, + 1217 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 299, + 1319, + 918, + 1319, + 918, + 1835, + 299, + 1835 + ], + "score": 0.977 + }, + { + "category_id": 0, + "poly": [ + 299, + 218, + 1402, + 218, + 1402, + 380, + 299, + 380 + ], + "score": 0.964 + }, + { + "category_id": 3, + "poly": [ + 946, + 1351, + 1398, + 1351, + 1398, + 1790, + 946, + 1790 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 300, + 1838, + 1404, + 1838, + 1404, + 1958, + 300, + 1958 + ], + "score": 0.959 + }, + { + "category_id": 2, + "poly": [ + 327, + 1977, + 1329, + 1977, + 1329, + 2034, + 327, + 2034 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 314, + 431, + 777, + 431, + 777, + 525, + 314, + 525 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 864, + 432, + 1328, + 432, + 1328, + 525, + 864, + 525 + ], + "score": 0.894 + }, + { + "category_id": 0, + "poly": [ + 302, + 1267, + 573, + 1267, + 573, + 1301, + 302, + 1301 + ], + "score": 0.884 + }, + { + "category_id": 0, + "poly": [ + 772, + 605, + 927, + 605, + 927, + 638, + 772, + 638 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 813, + 76, + 813, + 104, + 299, + 104 + ], + "score": 0.883 + }, + { + "category_id": 4, + "poly": [ + 1013, + 1795, + 1329, + 1795, + 1329, + 1827, + 1013, + 1827 + ], + "score": 0.834 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 857, + 2088, + 857, + 2112, + 841, + 2112 + ], + "score": 0.701 + }, + { + "category_id": 4, + "poly": [ + 1012, + 1795, + 1329, + 1795, + 1329, + 1827, + 1012, + 1827 + ], + "score": 0.248 + }, + { + "category_id": 0, + "poly": [ + 865, + 433, + 1039, + 433, + 1039, + 463, + 865, + 463 + ], + "score": 0.095 + }, + { + "category_id": 15, + "poly": [ + 293.0, + 216.0, + 1406.0, + 216.0, + 1406.0, + 272.0, + 293.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 274.0, + 1406.0, + 274.0, + 1406.0, + 325.0, + 293.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 331.0, + 882.0, + 331.0, + 882.0, + 381.0, + 294.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 984.0, + 1355.0, + 1025.0, + 1355.0, + 1025.0, + 1379.0, + 984.0, + 1379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 1376.0, + 1384.0, + 1376.0, + 1384.0, + 1401.0, + 1253.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 984.0, + 1390.0, + 1026.0, + 1390.0, + 1026.0, + 1415.0, + 984.0, + 1415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 1408.0, + 1071.0, + 1408.0, + 1071.0, + 1433.0, + 1033.0, + 1433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1257.0, + 1409.0, + 1383.0, + 1409.0, + 1383.0, + 1432.0, + 1257.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 984.0, + 1425.0, + 1026.0, + 1425.0, + 1026.0, + 1451.0, + 984.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 1441.0, + 1112.0, + 1441.0, + 1112.0, + 1456.0, + 1093.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 947.0, + 1443.0, + 977.0, + 1443.0, + 977.0, + 1614.0, + 947.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 1448.0, + 1093.0, + 1448.0, + 1093.0, + 1463.0, + 1073.0, + 1463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 1455.0, + 1172.0, + 1455.0, + 1172.0, + 1466.0, + 1155.0, + 1466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 1457.0, + 1131.0, + 1457.0, + 1131.0, + 1471.0, + 1113.0, + 1471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1460.0, + 1025.0, + 1460.0, + 1025.0, + 1485.0, + 985.0, + 1485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1175.0, + 1487.0, + 1191.0, + 1487.0, + 1191.0, + 1499.0, + 1175.0, + 1499.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1135.0, + 1489.0, + 1151.0, + 1489.0, + 1151.0, + 1501.0, + 1135.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1494.0, + 1025.0, + 1494.0, + 1025.0, + 1519.0, + 985.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1216.0, + 1496.0, + 1232.0, + 1496.0, + 1232.0, + 1508.0, + 1216.0, + 1508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 1499.0, + 1253.0, + 1499.0, + 1253.0, + 1515.0, + 1233.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1197.0, + 1508.0, + 1210.0, + 1508.0, + 1210.0, + 1521.0, + 1197.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1253.0, + 1519.0, + 1272.0, + 1519.0, + 1272.0, + 1534.0, + 1253.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1529.0, + 1025.0, + 1529.0, + 1025.0, + 1554.0, + 985.0, + 1554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 1537.0, + 1294.0, + 1537.0, + 1294.0, + 1551.0, + 1273.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 1551.0, + 1351.0, + 1551.0, + 1351.0, + 1562.0, + 1335.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 1556.0, + 1311.0, + 1556.0, + 1311.0, + 1568.0, + 1296.0, + 1568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1565.0, + 1026.0, + 1565.0, + 1026.0, + 1589.0, + 985.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1565.0, + 1049.0, + 1565.0, + 1049.0, + 1575.0, + 1035.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1571.0, + 1070.0, + 1571.0, + 1070.0, + 1582.0, + 1052.0, + 1582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1315.0, + 1568.0, + 1332.0, + 1568.0, + 1332.0, + 1579.0, + 1315.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1569.0, + 1369.0, + 1569.0, + 1369.0, + 1578.0, + 1360.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1153.0, + 1579.0, + 1173.0, + 1579.0, + 1173.0, + 1594.0, + 1153.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 1584.0, + 1113.0, + 1584.0, + 1113.0, + 1600.0, + 1092.0, + 1600.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1598.0, + 1026.0, + 1598.0, + 1026.0, + 1624.0, + 985.0, + 1624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 1592.0, + 1093.0, + 1592.0, + 1093.0, + 1606.0, + 1073.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1595.0, + 1131.0, + 1595.0, + 1131.0, + 1611.0, + 1114.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 1599.0, + 1193.0, + 1599.0, + 1193.0, + 1613.0, + 1173.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 1604.0, + 1254.0, + 1604.0, + 1254.0, + 1620.0, + 1213.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1605.0, + 1393.0, + 1605.0, + 1393.0, + 1617.0, + 1376.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1618.0, + 1151.0, + 1618.0, + 1151.0, + 1629.0, + 1133.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1193.0, + 1618.0, + 1211.0, + 1618.0, + 1211.0, + 1629.0, + 1193.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1634.0, + 1025.0, + 1634.0, + 1025.0, + 1660.0, + 985.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1255.0, + 1627.0, + 1295.0, + 1627.0, + 1295.0, + 1641.0, + 1255.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 1642.0, + 1310.0, + 1642.0, + 1310.0, + 1654.0, + 1296.0, + 1654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 1632.0, + 1375.0, + 1632.0, + 1375.0, + 1651.0, + 1334.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1314.0, + 1651.0, + 1335.0, + 1651.0, + 1335.0, + 1666.0, + 1314.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 1660.0, + 1392.0, + 1660.0, + 1392.0, + 1672.0, + 1376.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 1668.0, + 1025.0, + 1668.0, + 1025.0, + 1692.0, + 985.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 1719.5, + 1049.0, + 1719.5, + 1049.0, + 1741.5, + 1023.0, + 1741.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1114.0, + 1703.5, + 1176.0, + 1703.5, + 1176.0, + 1719.5, + 1114.0, + 1719.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1702.0, + 1319.0, + 1702.0, + 1319.0, + 1721.0, + 1251.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 1711.5, + 1259.0, + 1711.5, + 1259.0, + 1730.5, + 1174.0, + 1730.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1275.75, + 1710.0, + 1359.75, + 1710.0, + 1359.75, + 1730.0, + 1275.75, + 1730.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1300.0, + 1707.5, + 1380.0, + 1707.5, + 1380.0, + 1727.0, + 1300.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1707.0, + 1399.0, + 1707.0, + 1399.0, + 1726.0, + 1322.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 1716.5, + 1160.0, + 1716.5, + 1160.0, + 1739.0, + 1059.0, + 1739.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 1716.0, + 1198.0, + 1716.0, + 1198.0, + 1736.0, + 1105.0, + 1736.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1209.75, + 1713.0, + 1298.75, + 1713.0, + 1298.75, + 1732.0, + 1209.75, + 1732.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1229.0, + 1733.5, + 1282.0, + 1733.5, + 1282.0, + 1752.0, + 1229.0, + 1752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1718.5, + 1138.0, + 1718.5, + 1138.0, + 1737.0, + 1039.0, + 1737.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1102.25, + 1709.0, + 1252.25, + 1709.0, + 1252.25, + 1751.0, + 1102.25, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1175.75, + 1718.5, + 1279.75, + 1718.5, + 1279.75, + 1739.5, + 1175.75, + 1739.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1242.0, + 1716.0, + 1340.0, + 1716.0, + 1340.0, + 1735.5, + 1242.0, + 1735.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 1745.0, + 1037.0, + 1745.0, + 1037.0, + 1763.5, + 967.0, + 1763.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 1750.0, + 1139.0, + 1750.0, + 1139.0, + 1766.0, + 1059.0, + 1766.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1969.0, + 569.0, + 1969.0, + 569.0, + 2008.0, + 329.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1999.0, + 1331.0, + 1999.0, + 1331.0, + 2037.0, + 329.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1263.0, + 579.0, + 1263.0, + 579.0, + 1309.0, + 294.0, + 1309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 604.0, + 932.0, + 604.0, + 932.0, + 641.0, + 769.0, + 641.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": [ + 1011.0, + 1793.0, + 1330.0, + 1793.0, + 1330.0, + 1830.0, + 1011.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 860.0, + 2087.0, + 860.0, + 2117.0, + 840.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1011.0, + 1793.0, + 1332.0, + 1793.0, + 1332.0, + 1830.0, + 1011.0, + 1830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 429.0, + 1048.0, + 429.0, + 1048.0, + 467.0, + 862.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 670.0, + 1305.0, + 670.0, + 1305.0, + 702.0, + 396.0, + 702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 701.0, + 1305.0, + 701.0, + 1305.0, + 734.0, + 394.0, + 734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 730.0, + 1307.0, + 730.0, + 1307.0, + 767.0, + 393.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 761.0, + 1305.0, + 761.0, + 1305.0, + 794.0, + 394.0, + 794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 793.0, + 1305.0, + 793.0, + 1305.0, + 826.0, + 393.0, + 826.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 823.0, + 1305.0, + 823.0, + 1305.0, + 856.0, + 394.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 854.0, + 1305.0, + 854.0, + 1305.0, + 884.0, + 393.0, + 884.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 881.0, + 1307.0, + 881.0, + 1307.0, + 921.0, + 392.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 911.0, + 1304.0, + 911.0, + 1304.0, + 949.0, + 393.0, + 949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 943.0, + 1305.0, + 943.0, + 1305.0, + 978.0, + 394.0, + 978.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 975.0, + 1306.0, + 975.0, + 1306.0, + 1007.0, + 394.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1007.0, + 1305.0, + 1007.0, + 1305.0, + 1036.0, + 395.0, + 1036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1034.0, + 1306.0, + 1034.0, + 1306.0, + 1067.0, + 392.0, + 1067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1065.0, + 1305.0, + 1065.0, + 1305.0, + 1098.0, + 393.0, + 1098.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1095.0, + 1306.0, + 1095.0, + 1306.0, + 1131.0, + 392.0, + 1131.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1127.0, + 1303.0, + 1127.0, + 1303.0, + 1159.0, + 393.0, + 1159.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1158.0, + 1303.0, + 1158.0, + 1303.0, + 1187.0, + 395.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 1187.0, + 1104.0, + 1187.0, + 1104.0, + 1218.0, + 394.0, + 1218.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1317.0, + 920.0, + 1317.0, + 920.0, + 1351.0, + 295.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1349.0, + 919.0, + 1349.0, + 919.0, + 1383.0, + 295.0, + 1383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1377.0, + 919.0, + 1377.0, + 919.0, + 1414.0, + 294.0, + 1414.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1407.0, + 920.0, + 1407.0, + 920.0, + 1444.0, + 293.0, + 1444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1440.0, + 920.0, + 1440.0, + 920.0, + 1475.0, + 294.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1470.0, + 921.0, + 1470.0, + 921.0, + 1504.0, + 294.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1501.0, + 921.0, + 1501.0, + 921.0, + 1535.0, + 294.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1532.0, + 920.0, + 1532.0, + 920.0, + 1564.0, + 296.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1563.0, + 921.0, + 1563.0, + 921.0, + 1595.0, + 293.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1593.0, + 920.0, + 1593.0, + 920.0, + 1625.0, + 295.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1620.0, + 921.0, + 1620.0, + 921.0, + 1659.0, + 292.0, + 1659.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1652.0, + 920.0, + 1652.0, + 920.0, + 1687.0, + 294.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1681.0, + 920.0, + 1681.0, + 920.0, + 1715.0, + 294.0, + 1715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1713.0, + 919.0, + 1713.0, + 919.0, + 1746.0, + 295.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1743.0, + 919.0, + 1743.0, + 919.0, + 1778.0, + 295.0, + 1778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1775.0, + 919.0, + 1775.0, + 919.0, + 1808.0, + 296.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1805.0, + 921.0, + 1805.0, + 921.0, + 1838.0, + 295.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1835.0, + 1403.0, + 1835.0, + 1403.0, + 1869.0, + 295.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1865.0, + 1401.0, + 1865.0, + 1401.0, + 1899.0, + 296.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1895.0, + 1404.0, + 1895.0, + 1404.0, + 1935.0, + 294.0, + 1935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1923.0, + 952.0, + 1923.0, + 952.0, + 1967.0, + 294.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 428.0, + 499.0, + 428.0, + 499.0, + 469.0, + 311.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 311.0, + 459.0, + 778.0, + 459.0, + 778.0, + 497.0, + 311.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 492.0, + 656.0, + 492.0, + 656.0, + 530.0, + 312.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 431.0, + 1049.0, + 431.0, + 1049.0, + 465.0, + 860.0, + 465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 459.0, + 1328.0, + 459.0, + 1328.0, + 497.0, + 861.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 491.0, + 1207.0, + 491.0, + 1207.0, + 529.0, + 862.0, + 529.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 0, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1132, + 1404, + 1132, + 1404, + 1559, + 297, + 1559 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 400, + 1404, + 400, + 1404, + 856, + 298, + 856 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 872, + 1404, + 872, + 1404, + 1117, + 298, + 1117 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 1911, + 1403, + 1911, + 1403, + 2034, + 298, + 2034 + ], + "score": 0.972 + }, + { + "category_id": 1, + "poly": [ + 298, + 229, + 1402, + 229, + 1402, + 383, + 298, + 383 + ], + "score": 0.97 + }, + { + "category_id": 1, + "poly": [ + 369, + 1585, + 1403, + 1585, + 1403, + 1791, + 369, + 1791 + ], + "score": 0.952 + }, + { + "category_id": 0, + "poly": [ + 300, + 1842, + 587, + 1842, + 587, + 1878, + 300, + 1878 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.69 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.204 + }, + { + "category_id": 13, + "poly": [ + 819, + 1255, + 900, + 1255, + 900, + 1284, + 819, + 1284 + ], + "score": 0.25, + "latex": "2 . 2 \\mathrm { A P }" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1839.0, + 594.0, + 1839.0, + 594.0, + 1886.0, + 291.0, + 1886.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, + 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": [ + 295.0, + 1131.0, + 1404.0, + 1131.0, + 1404.0, + 1166.0, + 295.0, + 1166.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1163.0, + 1406.0, + 1163.0, + 1406.0, + 1199.0, + 292.0, + 1199.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1192.0, + 1407.0, + 1192.0, + 1407.0, + 1230.0, + 290.0, + 1230.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1224.0, + 1404.0, + 1224.0, + 1404.0, + 1263.0, + 294.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1250.0, + 818.0, + 1250.0, + 818.0, + 1294.0, + 292.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 1250.0, + 1408.0, + 1250.0, + 1408.0, + 1294.0, + 901.0, + 1294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1285.0, + 1407.0, + 1285.0, + 1407.0, + 1320.0, + 294.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1315.0, + 1406.0, + 1315.0, + 1406.0, + 1351.0, + 294.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1343.0, + 1404.0, + 1343.0, + 1404.0, + 1381.0, + 292.0, + 1381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1375.0, + 1406.0, + 1375.0, + 1406.0, + 1411.0, + 292.0, + 1411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1406.0, + 1406.0, + 1406.0, + 1406.0, + 1442.0, + 295.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1437.0, + 1404.0, + 1437.0, + 1404.0, + 1473.0, + 292.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1466.0, + 1404.0, + 1466.0, + 1404.0, + 1504.0, + 292.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1499.0, + 1406.0, + 1499.0, + 1406.0, + 1534.0, + 294.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1530.0, + 1065.0, + 1530.0, + 1065.0, + 1562.0, + 295.0, + 1562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 397.0, + 1404.0, + 397.0, + 1404.0, + 433.0, + 293.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 429.0, + 1404.0, + 429.0, + 1404.0, + 464.0, + 293.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 457.0, + 1405.0, + 457.0, + 1405.0, + 498.0, + 292.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 488.0, + 1405.0, + 488.0, + 1405.0, + 530.0, + 292.0, + 530.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": [ + 292.0, + 551.0, + 1404.0, + 551.0, + 1404.0, + 587.0, + 292.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 582.0, + 1404.0, + 582.0, + 1404.0, + 617.0, + 294.0, + 617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 613.0, + 1405.0, + 613.0, + 1405.0, + 648.0, + 293.0, + 648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 643.0, + 1404.0, + 643.0, + 1404.0, + 678.0, + 293.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 674.0, + 1405.0, + 674.0, + 1405.0, + 709.0, + 294.0, + 709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 700.0, + 1404.0, + 700.0, + 1404.0, + 741.0, + 292.0, + 741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 733.0, + 1406.0, + 733.0, + 1406.0, + 771.0, + 293.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 765.0, + 1404.0, + 765.0, + 1404.0, + 799.0, + 294.0, + 799.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 796.0, + 1405.0, + 796.0, + 1405.0, + 830.0, + 294.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 825.0, + 1039.0, + 825.0, + 1039.0, + 859.0, + 295.0, + 859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 871.0, + 1405.0, + 871.0, + 1405.0, + 908.0, + 293.0, + 908.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 901.0, + 1406.0, + 901.0, + 1406.0, + 939.0, + 293.0, + 939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 932.0, + 1408.0, + 932.0, + 1408.0, + 969.0, + 293.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 962.0, + 1405.0, + 962.0, + 1405.0, + 998.0, + 293.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 994.0, + 1404.0, + 994.0, + 1404.0, + 1028.0, + 294.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1022.0, + 1406.0, + 1022.0, + 1406.0, + 1062.0, + 293.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1057.0, + 1404.0, + 1057.0, + 1404.0, + 1087.0, + 296.0, + 1087.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1084.0, + 1091.0, + 1084.0, + 1091.0, + 1119.0, + 295.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1909.0, + 1404.0, + 1909.0, + 1404.0, + 1946.0, + 293.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1943.0, + 1405.0, + 1943.0, + 1405.0, + 1976.0, + 294.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 1407.0, + 1971.0, + 1407.0, + 2007.0, + 293.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2003.0, + 1403.0, + 2003.0, + 1403.0, + 2035.0, + 294.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 228.0, + 1404.0, + 228.0, + 1404.0, + 266.0, + 296.0, + 266.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": [ + 292.0, + 290.0, + 1406.0, + 290.0, + 1406.0, + 326.0, + 292.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 319.0, + 1406.0, + 319.0, + 1406.0, + 359.0, + 292.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 350.0, + 1394.0, + 350.0, + 1394.0, + 389.0, + 293.0, + 389.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 1584.0, + 1405.0, + 1584.0, + 1405.0, + 1620.0, + 365.0, + 1620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1617.0, + 1279.0, + 1617.0, + 1279.0, + 1651.0, + 395.0, + 1651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 1657.0, + 1403.0, + 1657.0, + 1403.0, + 1690.0, + 390.0, + 1690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1689.0, + 1394.0, + 1689.0, + 1394.0, + 1719.0, + 396.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 1726.0, + 1403.0, + 1726.0, + 1403.0, + 1762.0, + 382.0, + 1762.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 1757.0, + 1311.0, + 1757.0, + 1311.0, + 1793.0, + 393.0, + 1793.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1102, + 1405, + 1102, + 1405, + 1347, + 297, + 1347 + ], + "score": 0.978 + }, + { + "category_id": 3, + "poly": [ + 301, + 224, + 1401, + 224, + 1401, + 758, + 301, + 758 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 297, + 1729, + 1404, + 1729, + 1404, + 2034, + 297, + 2034 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 850, + 1363, + 1398, + 1363, + 1398, + 1630, + 850, + 1630 + ], + "score": 0.972 + }, + { + "category_id": 4, + "poly": [ + 296, + 791, + 1404, + 791, + 1404, + 1037, + 296, + 1037 + ], + "score": 0.966 + }, + { + "category_id": 1, + "poly": [ + 299, + 1364, + 822, + 1364, + 822, + 1728, + 299, + 1728 + ], + "score": 0.963 + }, + { + "category_id": 4, + "poly": [ + 843, + 1639, + 1402, + 1639, + 1402, + 1701, + 843, + 1701 + ], + "score": 0.909 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 812, + 76, + 812, + 104, + 299, + 104 + ], + "score": 0.884 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.645 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.335 + }, + { + "category_id": 13, + "poly": [ + 870, + 945, + 904, + 945, + 904, + 974, + 870, + 974 + ], + "score": 0.88, + "latex": "L _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 429, + 1699, + 464, + 1699, + 464, + 1729, + 429, + 1729 + ], + "score": 0.87, + "latex": "L _ { 2 }" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 225.0, + 582.0, + 225.0, + 582.0, + 251.0, + 441.0, + 251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 227.0, + 1005.0, + 227.0, + 1005.0, + 251.0, + 866.0, + 251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 228.0, + 1237.0, + 228.0, + 1237.0, + 253.0, + 1176.0, + 253.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 243.0, + 1242.0, + 243.0, + 1242.0, + 269.0, + 1215.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 262.0, + 442.0, + 262.0, + 442.0, + 285.0, + 365.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 268.0, + 672.0, + 268.0, + 672.0, + 288.0, + 595.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 269.0, + 1096.0, + 269.0, + 1096.0, + 293.0, + 1015.0, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 268.0, + 1244.0, + 268.0, + 1244.0, + 287.0, + 1213.0, + 287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1282.0, + 264.0, + 1316.0, + 264.0, + 1316.0, + 287.0, + 1282.0, + 287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 289.0, + 350.0, + 289.0, + 350.0, + 326.0, + 315.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 641.0, + 284.0, + 672.0, + 284.0, + 672.0, + 308.0, + 641.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 288.0, + 834.0, + 288.0, + 834.0, + 304.0, + 820.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1058.0, + 285.0, + 1094.0, + 285.0, + 1094.0, + 309.0, + 1058.0, + 309.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 290.0, + 1280.0, + 290.0, + 1280.0, + 314.0, + 1231.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 284.0, + 1311.0, + 284.0, + 1311.0, + 305.0, + 1291.0, + 305.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 303.0, + 692.0, + 303.0, + 692.0, + 324.0, + 633.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 301.0, + 1098.0, + 301.0, + 1098.0, + 325.0, + 1039.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1276.0, + 300.0, + 1316.0, + 300.0, + 1316.0, + 328.0, + 1276.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 641.0, + 318.0, + 685.0, + 318.0, + 685.0, + 339.0, + 641.0, + 339.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 319.0, + 1091.0, + 319.0, + 1091.0, + 340.0, + 1047.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 320.0, + 1340.0, + 320.0, + 1340.0, + 340.0, + 1259.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 811.0, + 329.0, + 942.0, + 329.0, + 942.0, + 349.0, + 811.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 331.0, + 1255.0, + 331.0, + 1255.0, + 359.0, + 1218.0, + 359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 360.0, + 386.0, + 360.0, + 386.0, + 376.0, + 371.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 347.0, + 503.0, + 347.0, + 503.0, + 371.0, + 393.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 524.0, + 347.0, + 626.0, + 347.0, + 626.0, + 371.0, + 524.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 350.0, + 1278.0, + 350.0, + 1278.0, + 373.0, + 1195.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 367.0, + 357.0, + 367.0, + 357.0, + 388.0, + 305.0, + 388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 384.0, + 381.0, + 384.0, + 381.0, + 422.0, + 302.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 496.0, + 382.0, + 524.0, + 382.0, + 524.0, + 417.0, + 496.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 376.0, + 709.0, + 376.0, + 709.0, + 417.0, + 648.0, + 417.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 381.0, + 856.0, + 381.0, + 856.0, + 418.0, + 799.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 398.0, + 949.0, + 398.0, + 949.0, + 409.0, + 939.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 377.0, + 1218.0, + 377.0, + 1218.0, + 420.0, + 1165.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1248.0, + 378.0, + 1304.0, + 378.0, + 1304.0, + 418.0, + 1248.0, + 418.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1329.0, + 378.0, + 1384.0, + 378.0, + 1384.0, + 419.0, + 1329.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 414.0, + 517.0, + 414.0, + 517.0, + 429.0, + 502.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 409.0, + 710.0, + 409.0, + 710.0, + 429.0, + 642.0, + 429.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 801.0, + 411.0, + 855.0, + 411.0, + 855.0, + 436.0, + 801.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 429.0, + 518.0, + 429.0, + 518.0, + 444.0, + 502.0, + 444.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 429.0, + 655.0, + 429.0, + 655.0, + 445.0, + 637.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 662.0, + 424.0, + 691.0, + 424.0, + 691.0, + 448.0, + 662.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1245.0, + 425.0, + 1280.0, + 425.0, + 1280.0, + 453.0, + 1245.0, + 453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 336.0, + 439.0, + 393.0, + 439.0, + 393.0, + 487.0, + 336.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 399.0, + 465.0, + 420.0, + 465.0, + 420.0, + 485.0, + 399.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 447.0, + 468.0, + 447.0, + 468.0, + 492.0, + 439.0, + 492.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 443.0, + 561.0, + 443.0, + 561.0, + 488.0, + 472.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 463.0, + 617.0, + 463.0, + 617.0, + 487.0, + 591.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 620.0, + 443.0, + 678.0, + 443.0, + 678.0, + 487.0, + 620.0, + 487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 440.0, + 958.0, + 440.0, + 958.0, + 489.0, + 903.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1165.0, + 452.0, + 1362.0, + 452.0, + 1362.0, + 475.0, + 1165.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 493.0, + 376.0, + 493.0, + 376.0, + 510.0, + 362.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 491.0, + 518.0, + 491.0, + 518.0, + 506.0, + 502.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 487.0, + 654.0, + 487.0, + 654.0, + 503.0, + 637.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1214.0, + 482.0, + 1319.0, + 482.0, + 1319.0, + 505.0, + 1214.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 524.0, + 357.0, + 524.0, + 357.0, + 545.0, + 302.0, + 545.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 512.0, + 373.0, + 512.0, + 373.0, + 522.0, + 363.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 501.0, + 475.0, + 501.0, + 475.0, + 538.0, + 425.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 507.0, + 518.0, + 507.0, + 518.0, + 537.0, + 502.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 549.0, + 500.0, + 605.0, + 500.0, + 605.0, + 537.0, + 549.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 502.0, + 705.0, + 502.0, + 705.0, + 543.0, + 637.0, + 543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 515.0, + 852.0, + 515.0, + 852.0, + 536.0, + 797.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 534.0, + 382.0, + 534.0, + 382.0, + 562.0, + 358.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 537.0, + 518.0, + 537.0, + 518.0, + 552.0, + 502.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 531.0, + 591.0, + 531.0, + 591.0, + 554.0, + 563.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 538.0, + 707.0, + 538.0, + 707.0, + 559.0, + 650.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 529.0, + 853.0, + 529.0, + 853.0, + 553.0, + 796.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 930.0, + 528.0, + 974.0, + 528.0, + 974.0, + 554.0, + 930.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 538.0, + 1391.0, + 538.0, + 1391.0, + 548.0, + 1375.0, + 548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 542.0, + 518.0, + 542.0, + 518.0, + 696.0, + 301.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 554.0, + 710.0, + 554.0, + 710.0, + 590.0, + 642.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 797.0, + 546.0, + 853.0, + 546.0, + 853.0, + 571.0, + 797.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 574.0, + 942.0, + 574.0, + 942.0, + 589.0, + 927.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1288.0, + 580.0, + 1298.0, + 580.0, + 1298.0, + 589.0, + 1288.0, + 589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1346.0, + 548.0, + 1400.0, + 548.0, + 1400.0, + 581.0, + 1346.0, + 581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 816.0, + 593.0, + 944.0, + 593.0, + 944.0, + 612.0, + 816.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1206.0, + 599.0, + 1323.0, + 599.0, + 1323.0, + 622.0, + 1206.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 616.0, + 441.0, + 616.0, + 441.0, + 641.0, + 362.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 622.0, + 672.0, + 622.0, + 672.0, + 646.0, + 592.0, + 646.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 613.0, + 865.0, + 613.0, + 865.0, + 643.0, + 774.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 627.0, + 1094.0, + 627.0, + 1094.0, + 651.0, + 1015.0, + 651.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1191.0, + 615.0, + 1358.0, + 615.0, + 1358.0, + 718.0, + 1191.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 652.0, + 591.0, + 652.0, + 591.0, + 664.0, + 581.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 640.0, + 686.0, + 640.0, + 686.0, + 680.0, + 627.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 638.0, + 781.0, + 638.0, + 781.0, + 662.0, + 750.0, + 662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 641.0, + 835.0, + 641.0, + 835.0, + 657.0, + 820.0, + 657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 641.0, + 1096.0, + 641.0, + 1096.0, + 672.0, + 1039.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 643.0, + 1391.0, + 643.0, + 1391.0, + 677.0, + 1334.0, + 677.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 673.0, + 680.0, + 673.0, + 680.0, + 694.0, + 636.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 668.0, + 1087.0, + 668.0, + 1087.0, + 685.0, + 1047.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 671.0, + 1400.0, + 671.0, + 1400.0, + 696.0, + 1347.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1355.0, + 689.0, + 1392.0, + 689.0, + 1392.0, + 706.0, + 1355.0, + 706.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 433.0, + 703.0, + 572.0, + 703.0, + 572.0, + 729.0, + 433.0, + 729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 703.0, + 996.0, + 703.0, + 996.0, + 726.0, + 859.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1213.0, + 706.0, + 1320.0, + 706.0, + 1320.0, + 726.0, + 1213.0, + 726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 731.0, + 661.0, + 731.0, + 661.0, + 758.0, + 368.0, + 758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 796.0, + 731.0, + 1032.0, + 731.0, + 1032.0, + 758.0, + 796.0, + 758.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 729.0, + 1372.0, + 729.0, + 1372.0, + 755.0, + 1162.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1231.0, + 222.0, + 1296.0, + 222.0, + 1296.0, + 252.0, + 1231.0, + 252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 438.0, + 238.0, + 604.0, + 238.0, + 604.0, + 277.5, + 438.0, + 277.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.75, + 244.0, + 1026.75, + 244.0, + 1026.75, + 280.0, + 862.75, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 266.5, + 861.0, + 266.5, + 861.0, + 287.5, + 791.0, + 287.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1321.25, + 262.0, + 1381.25, + 262.0, + 1381.25, + 293.0, + 1321.25, + 293.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.25, + 282.0, + 1359.25, + 282.0, + 1359.25, + 319.0, + 1296.25, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 303.0, + 1243.0, + 303.0, + 1243.0, + 333.5, + 1176.0, + 333.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 326.5, + 1199.0, + 326.5, + 1199.0, + 357.0, + 1136.0, + 357.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1273.0, + 335.0, + 1323.0, + 335.0, + 1323.0, + 357.5, + 1273.0, + 357.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 329.0, + 1370.0, + 329.0, + 1370.0, + 359.5, + 1310.0, + 359.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.75, + 350.0, + 1198.75, + 350.0, + 1198.75, + 376.0, + 1141.75, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1267.25, + 348.0, + 1333.25, + 348.0, + 1333.25, + 379.0, + 1267.25, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1311.0, + 347.5, + 1371.0, + 347.5, + 1371.0, + 379.5, + 1311.0, + 379.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 986.0, + 386.0, + 1054.0, + 386.0, + 1054.0, + 411.0, + 986.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.75, + 395.0, + 978.75, + 395.0, + 978.75, + 424.5, + 935.75, + 424.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 308.0, + 415.5, + 360.0, + 415.5, + 360.0, + 441.5, + 308.0, + 441.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 416.5, + 1330.0, + 416.5, + 1330.0, + 443.0, + 1264.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.75, + 461.0, + 584.75, + 461.0, + 584.75, + 502.5, + 577.75, + 502.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 519.5, + 1055.0, + 519.5, + 1055.0, + 548.0, + 981.0, + 548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1210.0, + 478.5, + 1435.0, + 478.5, + 1435.0, + 590.0, + 1210.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.75, + 530.0, + 474.75, + 530.0, + 474.75, + 556.0, + 424.75, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.75, + 575.0, + 657.75, + 575.0, + 657.75, + 604.0, + 530.75, + 604.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 672.0, + 600.0, + 672.0, + 600.0, + 705.0, + 439.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 672.0, + 1028.0, + 672.0, + 1028.0, + 705.0, + 865.0, + 705.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1514.0, + 945.0, + 1514.0, + 945.0, + 1525.0, + 927.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 1604.0, + 971.0, + 1604.0, + 971.0, + 1637.0, + 913.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1068.0, + 1602.0, + 1172.0, + 1602.0, + 1172.0, + 1632.0, + 1068.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 1606.0, + 1387.0, + 1606.0, + 1387.0, + 1632.0, + 1221.0, + 1632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 791.0, + 1404.0, + 791.0, + 1404.0, + 825.0, + 296.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 823.0, + 1404.0, + 823.0, + 1404.0, + 856.0, + 294.0, + 856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 853.0, + 1405.0, + 853.0, + 1405.0, + 885.0, + 293.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 882.0, + 1404.0, + 882.0, + 1404.0, + 916.0, + 294.0, + 916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 912.0, + 1404.0, + 912.0, + 1404.0, + 948.0, + 293.0, + 948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 942.0, + 869.0, + 942.0, + 869.0, + 976.0, + 294.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 942.0, + 1405.0, + 942.0, + 1405.0, + 976.0, + 905.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 974.0, + 1404.0, + 974.0, + 1404.0, + 1008.0, + 294.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1007.0, + 1372.0, + 1007.0, + 1372.0, + 1037.0, + 295.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 845.0, + 1638.0, + 1404.0, + 1638.0, + 1404.0, + 1672.0, + 845.0, + 1672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 844.0, + 1669.0, + 1377.0, + 1669.0, + 1377.0, + 1702.0, + 844.0, + 1702.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, + 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, + 1104.0, + 1403.0, + 1104.0, + 1403.0, + 1137.0, + 295.0, + 1137.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1132.0, + 1406.0, + 1132.0, + 1406.0, + 1167.0, + 292.0, + 1167.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1165.0, + 1405.0, + 1165.0, + 1405.0, + 1198.0, + 294.0, + 1198.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1195.0, + 1403.0, + 1195.0, + 1403.0, + 1229.0, + 294.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1225.0, + 1406.0, + 1225.0, + 1406.0, + 1260.0, + 292.0, + 1260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1256.0, + 1405.0, + 1256.0, + 1405.0, + 1289.0, + 295.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1287.0, + 1405.0, + 1287.0, + 1405.0, + 1320.0, + 295.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1317.0, + 674.0, + 1317.0, + 674.0, + 1350.0, + 295.0, + 1350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1728.0, + 1405.0, + 1728.0, + 1405.0, + 1761.0, + 293.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1759.0, + 1406.0, + 1759.0, + 1406.0, + 1794.0, + 294.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1789.0, + 1406.0, + 1789.0, + 1406.0, + 1825.0, + 295.0, + 1825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1819.0, + 1405.0, + 1819.0, + 1405.0, + 1855.0, + 295.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1850.0, + 1406.0, + 1850.0, + 1406.0, + 1885.0, + 295.0, + 1885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1883.0, + 1405.0, + 1883.0, + 1405.0, + 1914.0, + 295.0, + 1914.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1909.0, + 1405.0, + 1909.0, + 1405.0, + 1945.0, + 294.0, + 1945.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, + 1973.0, + 1406.0, + 1973.0, + 1406.0, + 2008.0, + 295.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2002.0, + 1406.0, + 2002.0, + 1406.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1363.0, + 824.0, + 1363.0, + 824.0, + 1398.0, + 295.0, + 1398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1395.0, + 824.0, + 1395.0, + 824.0, + 1427.0, + 295.0, + 1427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1425.0, + 826.0, + 1425.0, + 826.0, + 1457.0, + 295.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1455.0, + 826.0, + 1455.0, + 826.0, + 1487.0, + 295.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1487.0, + 825.0, + 1487.0, + 825.0, + 1516.0, + 296.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1517.0, + 825.0, + 1517.0, + 825.0, + 1546.0, + 296.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1547.0, + 827.0, + 1547.0, + 827.0, + 1577.0, + 294.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1575.0, + 826.0, + 1575.0, + 826.0, + 1609.0, + 294.0, + 1609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1609.0, + 824.0, + 1609.0, + 824.0, + 1638.0, + 297.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1637.0, + 826.0, + 1637.0, + 826.0, + 1669.0, + 295.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1667.0, + 825.0, + 1667.0, + 825.0, + 1701.0, + 294.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1697.0, + 428.0, + 1697.0, + 428.0, + 1731.0, + 296.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 1697.0, + 826.0, + 1697.0, + 826.0, + 1731.0, + 465.0, + 1731.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 558, + 1405, + 558, + 1405, + 1117, + 296, + 1117 + ], + "score": 0.985 + }, + { + "category_id": 1, + "poly": [ + 296, + 1480, + 1405, + 1480, + 1405, + 1786, + 296, + 1786 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 1404, + 228, + 1404, + 385, + 298, + 385 + ], + "score": 0.977 + }, + { + "category_id": 8, + "poly": [ + 525, + 1273, + 1167, + 1273, + 1167, + 1388, + 525, + 1388 + ], + "score": 0.962 + }, + { + "category_id": 1, + "poly": [ + 297, + 1189, + 1400, + 1189, + 1400, + 1252, + 297, + 1252 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 520, + 1962, + 1181, + 1962, + 1181, + 2042, + 520, + 2042 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 294, + 1882, + 1398, + 1882, + 1398, + 1945, + 294, + 1945 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 533, + 1131, + 1163, + 1131, + 1163, + 1174, + 533, + 1174 + ], + "score": 0.945 + }, + { + "category_id": 0, + "poly": [ + 300, + 502, + 786, + 502, + 786, + 534, + 300, + 534 + ], + "score": 0.91 + }, + { + "category_id": 0, + "poly": [ + 300, + 431, + 581, + 431, + 581, + 467, + 300, + 467 + ], + "score": 0.909 + }, + { + "category_id": 0, + "poly": [ + 300, + 1824, + 687, + 1824, + 687, + 1857, + 300, + 1857 + ], + "score": 0.909 + }, + { + "category_id": 0, + "poly": [ + 300, + 1423, + 693, + 1423, + 693, + 1455, + 300, + 1455 + ], + "score": 0.899 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.899 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1138, + 1400, + 1138, + 1400, + 1169, + 1366, + 1169 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1320, + 1400, + 1320, + 1400, + 1349, + 1366, + 1349 + ], + "score": 0.883 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1968, + 1401, + 1968, + 1401, + 1997, + 1365, + 1997 + ], + "score": 0.87 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.788 + }, + { + "category_id": 14, + "poly": [ + 526, + 1269, + 1173, + 1269, + 1173, + 1391, + 526, + 1391 + ], + "score": 0.95, + "latex": "\\mathcal { L } _ { A M } = \\left( \\sum _ { k = 1 } ^ { C } \\sum _ { i = 1 } ^ { H } \\sum _ { j = 1 } ^ { W } ( A _ { k , i , j } ^ { \\mathcal { T } } - A _ { k , i , j } ^ { S } ) ^ { 2 } \\cdot M _ { i , j } ^ { s } \\cdot M _ { k } ^ { c } \\right) ^ { \\frac { 1 } { 2 } } ." + }, + { + "category_id": 13, + "poly": [ + 1066, + 1750, + 1306, + 1750, + 1306, + 1786, + 1066, + 1786 + ], + "score": 0.93, + "latex": "\\mathcal { L } _ { N L D } = \\mathcal { L } _ { 2 } ( r ^ { S } , r ^ { T } )" + }, + { + "category_id": 13, + "poly": [ + 725, + 1885, + 804, + 1885, + 804, + 1916, + 725, + 1916 + ], + "score": 0.92, + "latex": "\\alpha , \\beta , \\gamma" + }, + { + "category_id": 13, + "poly": [ + 1101, + 774, + 1395, + 774, + 1395, + 817, + 1101, + 817 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\mathcal G ^ { s } ( A ) = \\frac { 1 } { C } \\sum _ { C } ^ { \\bar { k = 1 } } | A _ { k , \\cdot , \\cdot } | . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 622, + 651, + 859, + 651, + 859, + 683, + 622, + 683 + ], + "score": 0.92, + "latex": "\\mathcal { G } ^ { c } : \\mathbb { R } ^ { C , H , W } \\mathbb { R } ^ { C }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1575, + 819, + 1575, + 819, + 1629, + 297, + 1629 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\frac { 1 } { W H } \\sum _ { H } ^ { i ^ { ' } = 1 } { \\sum _ { W } ^ { j ^ { ' } = 1 } { f ( A . , { i , j } , A . _ { { i ^ { ' } , j ^ { ' } } } ) g ( A . _ { { \\cdot , i ^ { ' } , j ^ { ' } } } ) } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 666, + 774, + 1052, + 774, + 1052, + 816, + 666, + 816 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\mathcal { G } ^ { c } ( A ) = \\frac { 1 } { H W } \\sum _ { H } ^ { i = 1 } \\sum _ { W } ^ { j = 1 } | A . , _ { i , j } | } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 651, + 568, + 651, + 568, + 683, + 297, + 683 + ], + "score": 0.91, + "latex": "\\mathcal { G } ^ { s } : \\mathbf { \\bar { \\mathbb { R } } } ^ { C , H , W } \\mathbb { R } ^ { H , W }" + }, + { + "category_id": 13, + "poly": [ + 931, + 1723, + 1008, + 1723, + 1008, + 1753, + 931, + 1753 + ], + "score": 0.91, + "latex": "\\mathcal { L } _ { N L D }" + }, + { + "category_id": 13, + "poly": [ + 1040, + 1025, + 1097, + 1025, + 1097, + 1055, + 1040, + 1055 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { A T }" + }, + { + "category_id": 13, + "poly": [ + 390, + 558, + 549, + 558, + 549, + 590, + 390, + 590 + ], + "score": 0.9, + "latex": "A \\in \\mathbb { R } ^ { C , H , W }" + }, + { + "category_id": 13, + "poly": [ + 371, + 812, + 436, + 812, + 436, + 843, + 371, + 843 + ], + "score": 0.9, + "latex": "i , j , k" + }, + { + "category_id": 14, + "poly": [ + 535, + 1130, + 1164, + 1130, + 1164, + 1173, + 535, + 1173 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { A T } = \\mathcal { L } _ { 2 } ( \\mathcal { G } ^ { s } ( A ^ { \\mathcal { S } } ) , \\mathcal { G } ^ { s } ( A ^ { \\mathcal { T } } ) ) + \\mathcal { L } _ { 2 } ( \\mathcal { G } ^ { c } ( A ^ { \\mathcal { S } } ) , \\mathcal { G } ^ { c } ( A ^ { \\mathcal { T } } ) ) ." + }, + { + "category_id": 13, + "poly": [ + 298, + 593, + 400, + 593, + 400, + 624, + 298, + 624 + ], + "score": 0.9, + "latex": "C , H , W" + }, + { + "category_id": 13, + "poly": [ + 297, + 1191, + 360, + 1191, + 360, + 1222, + 297, + 1222 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { A M }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1025, + 373, + 1025, + 373, + 1055, + 298, + 1055 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { A G D }" + }, + { + "category_id": 13, + "poly": [ + 1251, + 1192, + 1285, + 1192, + 1285, + 1221, + 1251, + 1221 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1211, + 1624, + 1266, + 1624, + 1266, + 1663, + 1211, + 1663 + ], + "score": 0.88, + "latex": "i ^ { \\prime } , j ^ { \\prime }" + }, + { + "category_id": 13, + "poly": [ + 424, + 1221, + 467, + 1221, + 467, + 1248, + 424, + 1248 + ], + "score": 0.88, + "latex": "M ^ { s }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1632, + 336, + 1632, + 336, + 1662, + 297, + 1662 + ], + "score": 0.88, + "latex": "i , j" + }, + { + "category_id": 13, + "poly": [ + 745, + 843, + 790, + 843, + 790, + 870, + 745, + 870 + ], + "score": 0.88, + "latex": "M ^ { s }" + }, + { + "category_id": 13, + "poly": [ + 1323, + 1547, + 1403, + 1547, + 1403, + 1580, + 1323, + 1580 + ], + "score": 0.88, + "latex": "\\begin{array} { r l } { r _ { i , j } } & { { } = } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 519, + 1221, + 563, + 1221, + 563, + 1248, + 519, + 1248 + ], + "score": 0.87, + "latex": "M ^ { c }" + }, + { + "category_id": 13, + "poly": [ + 825, + 715, + 858, + 715, + 858, + 744, + 825, + 744 + ], + "score": 0.87, + "latex": "\\mathcal G ^ { s }" + }, + { + "category_id": 13, + "poly": [ + 614, + 746, + 647, + 746, + 647, + 775, + 614, + 775 + ], + "score": 0.87, + "latex": "\\mathcal G ^ { c }" + }, + { + "category_id": 14, + "poly": [ + 517, + 1960, + 1159, + 1960, + 1159, + 2010, + 517, + 2010 + ], + "score": 0.87, + "latex": "\\begin{array} { r } \\mathcal { L } _ { D i s t i l l } ( A ^ { \\mathcal { T } } , A ^ { \\mathcal { S } } ) = \\underbrace { \\alpha \\cdot \\mathcal { L } _ { A T } + \\beta \\cdot \\mathcal { L } _ { A M } } _ \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1084, + 1723, + 1118, + 1723, + 1118, + 1753, + 1084, + 1753 + ], + "score": 0.87, + "latex": "\\mathcal { L } _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1153, + 843, + 1198, + 843, + 1198, + 870, + 1153, + 870 + ], + "score": 0.87, + "latex": "M ^ { c }" + }, + { + "category_id": 13, + "poly": [ + 298, + 931, + 715, + 931, + 715, + 966, + 298, + 966 + ], + "score": 0.85, + "latex": "C \\cdot \\operatorname { s o f t m a x } ( ( { \\mathcal { G } } ^ { c } ( A ^ { { \\mathcal { S } } } ) + { \\mathcal { G } } ^ { c } ( A ^ { { \\mathcal { T } } } ) ) / T )" + }, + { + "category_id": 13, + "poly": [ + 851, + 1663, + 870, + 1663, + 870, + 1693, + 851, + 1693 + ], + "score": 0.84, + "latex": "f" + }, + { + "category_id": 13, + "poly": [ + 772, + 900, + 1409, + 900, + 1409, + 936, + 772, + 936 + ], + "score": 0.82, + "latex": "M ^ { s } \\stackrel { \\smile } { = } H W \\cdot \\mathrm { s o f t m a x } ( \\hat { ( } \\mathcal G ^ { s } ( A ^ { S } ) + \\mathcal G ^ { s } ( A ^ { T } ) ) / T ) , M ^ { c } =" + }, + { + "category_id": 13, + "poly": [ + 1016, + 935, + 1038, + 935, + 1038, + 960, + 1016, + 960 + ], + "score": 0.82, + "latex": "s" + }, + { + "category_id": 13, + "poly": [ + 1089, + 935, + 1114, + 935, + 1114, + 961, + 1089, + 961 + ], + "score": 0.81, + "latex": "\\tau" + }, + { + "category_id": 13, + "poly": [ + 604, + 967, + 627, + 967, + 627, + 991, + 604, + 991 + ], + "score": 0.81, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 488, + 1696, + 507, + 1696, + 507, + 1724, + 488, + 1724 + ], + "score": 0.8, + "latex": "g" + }, + { + "category_id": 13, + "poly": [ + 297, + 1057, + 360, + 1057, + 360, + 1086, + 297, + 1086 + ], + "score": 0.79, + "latex": "\\mathcal { L } _ { A M }" + }, + { + "category_id": 13, + "poly": [ + 373, + 1055, + 430, + 1055, + 430, + 1086, + 373, + 1086 + ], + "score": 0.79, + "latex": "\\mathcal { L } _ { A T }" + }, + { + "category_id": 13, + "poly": [ + 795, + 816, + 819, + 816, + 819, + 839, + 795, + 839 + ], + "score": 0.75, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 570, + 813, + 605, + 813, + 605, + 843, + 570, + 843 + ], + "score": 0.74, + "latex": "i _ { t h }" + }, + { + "category_id": 13, + "poly": [ + 1316, + 659, + 1333, + 659, + 1333, + 681, + 1316, + 681 + ], + "score": 0.72, + "latex": "s" + }, + { + "category_id": 13, + "poly": [ + 907, + 1597, + 924, + 1597, + 924, + 1618, + 907, + 1618 + ], + "score": 0.69, + "latex": "r" + }, + { + "category_id": 13, + "poly": [ + 663, + 813, + 704, + 813, + 704, + 843, + 663, + 843 + ], + "score": 0.68, + "latex": "k _ { t h }" + }, + { + "category_id": 13, + "poly": [ + 1386, + 659, + 1402, + 659, + 1402, + 681, + 1386, + 681 + ], + "score": 0.64, + "latex": "c" + }, + { + "category_id": 13, + "poly": [ + 615, + 813, + 653, + 813, + 653, + 844, + 615, + 844 + ], + "score": 0.59, + "latex": "j _ { t h }" + }, + { + "category_id": 13, + "poly": [ + 578, + 813, + 705, + 813, + 705, + 844, + 578, + 844 + ], + "score": 0.32, + "latex": "\\dot { \\iota } _ { t h } , j _ { t h } , k _ { t h }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 503.0, + 791.0, + 503.0, + 791.0, + 538.0, + 295.0, + 538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 426.0, + 587.0, + 426.0, + 587.0, + 476.0, + 290.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1820.0, + 690.0, + 1820.0, + 690.0, + 1861.0, + 292.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1419.0, + 697.0, + 1419.0, + 697.0, + 1461.0, + 292.0, + 1461.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": [ + 838.0, + 2086.0, + 862.0, + 2086.0, + 862.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 554.0, + 389.0, + 554.0, + 389.0, + 597.0, + 293.0, + 597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 554.0, + 1406.0, + 554.0, + 1406.0, + 597.0, + 550.0, + 597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 592.0, + 1406.0, + 592.0, + 1406.0, + 628.0, + 401.0, + 628.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 624.0, + 1403.0, + 624.0, + 1403.0, + 656.0, + 295.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 643.0, + 296.0, + 643.0, + 296.0, + 692.0, + 291.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 643.0, + 621.0, + 643.0, + 621.0, + 692.0, + 569.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 643.0, + 1315.0, + 643.0, + 1315.0, + 692.0, + 860.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 643.0, + 1385.0, + 643.0, + 1385.0, + 692.0, + 1334.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 643.0, + 1411.0, + 643.0, + 1411.0, + 692.0, + 1403.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 683.0, + 1403.0, + 683.0, + 1403.0, + 715.0, + 295.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 714.0, + 824.0, + 714.0, + 824.0, + 750.0, + 294.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 859.0, + 714.0, + 1405.0, + 714.0, + 1405.0, + 750.0, + 859.0, + 750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 742.0, + 613.0, + 742.0, + 613.0, + 778.0, + 294.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 648.0, + 742.0, + 1402.0, + 742.0, + 1402.0, + 778.0, + 648.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 763.0, + 665.0, + 763.0, + 665.0, + 832.0, + 284.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1053.0, + 763.0, + 1100.0, + 763.0, + 1100.0, + 832.0, + 1053.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1396.0, + 763.0, + 1412.0, + 763.0, + 1412.0, + 832.0, + 1396.0, + 832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 809.0, + 370.0, + 809.0, + 370.0, + 849.0, + 294.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 809.0, + 569.0, + 809.0, + 569.0, + 849.0, + 437.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 809.0, + 794.0, + 809.0, + 794.0, + 849.0, + 706.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 809.0, + 1406.0, + 809.0, + 1406.0, + 849.0, + 820.0, + 849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 840.0, + 744.0, + 840.0, + 744.0, + 875.0, + 293.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 840.0, + 1152.0, + 840.0, + 1152.0, + 875.0, + 791.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 840.0, + 1405.0, + 840.0, + 1405.0, + 875.0, + 1199.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 870.0, + 1406.0, + 870.0, + 1406.0, + 907.0, + 291.0, + 907.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 899.0, + 771.0, + 899.0, + 771.0, + 935.0, + 293.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 928.0, + 297.0, + 928.0, + 297.0, + 969.0, + 293.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 928.0, + 1015.0, + 928.0, + 1015.0, + 969.0, + 716.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 928.0, + 1088.0, + 928.0, + 1088.0, + 969.0, + 1039.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 928.0, + 1405.0, + 928.0, + 1405.0, + 969.0, + 1115.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 962.0, + 603.0, + 962.0, + 603.0, + 998.0, + 293.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 962.0, + 1405.0, + 962.0, + 1405.0, + 998.0, + 628.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 992.0, + 1403.0, + 992.0, + 1403.0, + 1028.0, + 294.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1024.0, + 297.0, + 1024.0, + 297.0, + 1060.0, + 294.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 374.0, + 1024.0, + 1039.0, + 1024.0, + 1039.0, + 1060.0, + 374.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 1024.0, + 1405.0, + 1024.0, + 1405.0, + 1060.0, + 1098.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1054.0, + 372.0, + 1054.0, + 372.0, + 1090.0, + 361.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 1054.0, + 1407.0, + 1054.0, + 1407.0, + 1090.0, + 431.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1086.0, + 819.0, + 1086.0, + 819.0, + 1118.0, + 295.0, + 1118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1481.0, + 1403.0, + 1481.0, + 1403.0, + 1519.0, + 293.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1514.0, + 1405.0, + 1514.0, + 1405.0, + 1549.0, + 294.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1542.0, + 1322.0, + 1542.0, + 1322.0, + 1584.0, + 291.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 820.0, + 1577.0, + 906.0, + 1577.0, + 906.0, + 1629.0, + 820.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 1577.0, + 1409.0, + 1577.0, + 1409.0, + 1629.0, + 925.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1627.0, + 296.0, + 1627.0, + 296.0, + 1666.0, + 293.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 1627.0, + 1210.0, + 1627.0, + 1210.0, + 1666.0, + 337.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1267.0, + 1627.0, + 1403.0, + 1627.0, + 1403.0, + 1666.0, + 1267.0, + 1666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1660.0, + 850.0, + 1660.0, + 850.0, + 1698.0, + 293.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1660.0, + 1405.0, + 1660.0, + 1405.0, + 1698.0, + 871.0, + 1698.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1691.0, + 487.0, + 1691.0, + 487.0, + 1727.0, + 294.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 1691.0, + 1405.0, + 1691.0, + 1405.0, + 1727.0, + 508.0, + 1727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1723.0, + 930.0, + 1723.0, + 930.0, + 1759.0, + 294.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1009.0, + 1723.0, + 1083.0, + 1723.0, + 1083.0, + 1759.0, + 1009.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 1723.0, + 1406.0, + 1723.0, + 1406.0, + 1759.0, + 1119.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1747.0, + 1065.0, + 1747.0, + 1065.0, + 1790.0, + 291.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 1747.0, + 1319.0, + 1747.0, + 1319.0, + 1790.0, + 1307.0, + 1790.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 1406.0, + 229.0, + 1406.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 258.0, + 1405.0, + 258.0, + 1405.0, + 296.0, + 294.0, + 296.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": [ + 292.0, + 316.0, + 1408.0, + 316.0, + 1408.0, + 360.0, + 292.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 352.0, + 1273.0, + 352.0, + 1273.0, + 387.0, + 293.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 361.0, + 1186.0, + 1250.0, + 1186.0, + 1250.0, + 1226.0, + 361.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1286.0, + 1186.0, + 1404.0, + 1186.0, + 1404.0, + 1226.0, + 1286.0, + 1226.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1219.0, + 423.0, + 1219.0, + 423.0, + 1254.0, + 293.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 468.0, + 1219.0, + 518.0, + 1219.0, + 518.0, + 1254.0, + 468.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 1219.0, + 886.0, + 1219.0, + 886.0, + 1254.0, + 564.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1880.0, + 724.0, + 1880.0, + 724.0, + 1920.0, + 294.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1880.0, + 1404.0, + 1880.0, + 1404.0, + 1920.0, + 805.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1914.0, + 842.0, + 1914.0, + 842.0, + 1945.0, + 297.0, + 1945.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 978, + 1405, + 978, + 1405, + 1528, + 297, + 1528 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 297, + 1668, + 1404, + 1668, + 1404, + 2034, + 297, + 2034 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 299, + 653, + 1403, + 653, + 1403, + 746, + 299, + 746 + ], + "score": 0.975 + }, + { + "category_id": 3, + "poly": [ + 303, + 227, + 1394, + 227, + 1394, + 474, + 303, + 474 + ], + "score": 0.969 + }, + { + "category_id": 0, + "poly": [ + 300, + 909, + 663, + 909, + 663, + 941, + 300, + 941 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 300, + 821, + 540, + 821, + 540, + 856, + 300, + 856 + ], + "score": 0.896 + }, + { + "category_id": 0, + "poly": [ + 300, + 1598, + 638, + 1598, + 638, + 1628, + 300, + 1628 + ], + "score": 0.889 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.886 + }, + { + "category_id": 4, + "poly": [ + 293, + 506, + 1402, + 506, + 1402, + 569, + 293, + 569 + ], + "score": 0.781 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 858, + 2088, + 858, + 2112, + 841, + 2112 + ], + "score": 0.718 + }, + { + "category_id": 1, + "poly": [ + 293, + 506, + 1402, + 506, + 1402, + 569, + 293, + 569 + ], + "score": 0.227 + }, + { + "category_id": 13, + "poly": [ + 672, + 1407, + 1225, + 1407, + 1225, + 1439, + 672, + 1439 + ], + "score": 0.84, + "latex": "\\left\\{ \\alpha = \\gamma = 4 \\times 1 0 ^ { - 4 } , \\beta = 2 \\times 1 0 ^ { - 2 } , T = 0 . 5 \\right\\}" + }, + { + "category_id": 13, + "poly": [ + 877, + 1374, + 1109, + 1374, + 1109, + 1407, + 877, + 1407 + ], + "score": 0.75, + "latex": "\\lbrace \\alpha = \\gamma = 7 ^ { ^ { \\circ } } \\times 1 0 ^ { - 5 }" + }, + { + "category_id": 13, + "poly": [ + 1370, + 508, + 1393, + 508, + 1393, + 534, + 1370, + 534 + ], + "score": 0.71, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1116, + 1374, + 1401, + 1374, + 1401, + 1409, + 1116, + 1409 + ], + "score": 0.67, + "latex": "\\beta = 4 \\times 1 0 ^ { - 3 } , T = 0 . 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 1161, + 508, + 1184, + 508, + 1184, + 534, + 1161, + 534 + ], + "score": 0.59, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 592, + 1011, + 652, + 1011, + 652, + 1040, + 592, + 1040 + ], + "score": 0.43, + "latex": "1 2 0 \\mathrm { k }" + }, + { + "category_id": 13, + "poly": [ + 1098, + 1821, + 1179, + 1821, + 1179, + 1850, + 1098, + 1850 + ], + "score": 0.35, + "latex": "1 . 2 \\mathrm { A P }" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 235.0, + 1367.0, + 235.0, + 1367.0, + 247.0, + 1341.0, + 247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 249.0, + 1182.0, + 249.0, + 1182.0, + 260.0, + 1170.0, + 260.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1342.0, + 247.0, + 1367.0, + 247.0, + 1367.0, + 255.0, + 1342.0, + 255.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1159.0, + 257.0, + 1186.0, + 257.0, + 1186.0, + 302.0, + 1159.0, + 302.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 254.0, + 1368.0, + 254.0, + 1368.0, + 275.0, + 1341.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 288.0, + 1186.0, + 288.0, + 1186.0, + 308.0, + 1166.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1218.0, + 325.0, + 1231.0, + 325.0, + 1231.0, + 335.0, + 1218.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 324.0, + 1269.0, + 324.0, + 1269.0, + 337.0, + 1252.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1293.0, + 325.0, + 1305.0, + 325.0, + 1305.0, + 336.0, + 1293.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 325.0, + 1342.0, + 325.0, + 1342.0, + 336.0, + 1330.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 335.0, + 1185.0, + 335.0, + 1185.0, + 353.0, + 1171.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 343.0, + 1370.0, + 343.0, + 1370.0, + 355.0, + 1341.0, + 355.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1175.0, + 353.0, + 1183.0, + 353.0, + 1183.0, + 363.0, + 1175.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 353.0, + 1370.0, + 353.0, + 1370.0, + 366.0, + 1341.0, + 366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 355.0, + 1171.0, + 355.0, + 1171.0, + 410.0, + 1155.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1341.0, + 363.0, + 1370.0, + 363.0, + 1370.0, + 376.0, + 1341.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 371.0, + 1371.0, + 371.0, + 1371.0, + 387.0, + 1339.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1243.0, + 442.0, + 1317.0, + 442.0, + 1317.0, + 458.0, + 1243.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 452.0, + 1154.0, + 452.0, + 1154.0, + 475.0, + 483.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 454.0, + 1370.0, + 454.0, + 1370.0, + 473.0, + 1190.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 318.0, + 1196.0, + 318.0, + 1196.0, + 338.5, + 1173.0, + 338.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 453.0, + 404.0, + 453.0, + 404.0, + 468.5, + 363.0, + 468.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 906.0, + 668.0, + 906.0, + 668.0, + 945.0, + 294.0, + 945.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 818.0, + 545.0, + 818.0, + 545.0, + 862.0, + 293.0, + 862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1597.0, + 641.0, + 1597.0, + 641.0, + 1632.0, + 295.0, + 1632.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": [ + 295.0, + 506.0, + 1160.0, + 506.0, + 1160.0, + 541.0, + 295.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 506.0, + 1369.0, + 506.0, + 1369.0, + 541.0, + 1185.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 506.0, + 1404.0, + 506.0, + 1404.0, + 541.0, + 1394.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 536.0, + 1208.0, + 536.0, + 1208.0, + 572.0, + 295.0, + 572.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": [ + 295.0, + 980.0, + 1405.0, + 980.0, + 1405.0, + 1016.0, + 295.0, + 1016.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1011.0, + 591.0, + 1011.0, + 591.0, + 1046.0, + 294.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 1011.0, + 1405.0, + 1011.0, + 1405.0, + 1046.0, + 653.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1037.0, + 1406.0, + 1037.0, + 1406.0, + 1078.0, + 291.0, + 1078.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1071.0, + 1405.0, + 1071.0, + 1405.0, + 1107.0, + 294.0, + 1107.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1099.0, + 1405.0, + 1099.0, + 1405.0, + 1136.0, + 292.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1134.0, + 1405.0, + 1134.0, + 1405.0, + 1165.0, + 295.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1162.0, + 1405.0, + 1162.0, + 1405.0, + 1196.0, + 292.0, + 1196.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1193.0, + 1405.0, + 1193.0, + 1405.0, + 1229.0, + 294.0, + 1229.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1217.0, + 1406.0, + 1217.0, + 1406.0, + 1263.0, + 291.0, + 1263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1253.0, + 1403.0, + 1253.0, + 1403.0, + 1289.0, + 294.0, + 1289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1283.0, + 1406.0, + 1283.0, + 1406.0, + 1319.0, + 294.0, + 1319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1314.0, + 1406.0, + 1314.0, + 1406.0, + 1353.0, + 292.0, + 1353.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": [ + 292.0, + 1374.0, + 876.0, + 1374.0, + 876.0, + 1412.0, + 292.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1110.0, + 1374.0, + 1115.0, + 1374.0, + 1115.0, + 1412.0, + 1110.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 1374.0, + 1405.0, + 1374.0, + 1405.0, + 1412.0, + 1402.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1402.0, + 671.0, + 1402.0, + 671.0, + 1445.0, + 291.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 1402.0, + 1406.0, + 1402.0, + 1406.0, + 1445.0, + 1226.0, + 1445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1436.0, + 1405.0, + 1436.0, + 1405.0, + 1470.0, + 292.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1468.0, + 1406.0, + 1468.0, + 1406.0, + 1501.0, + 294.0, + 1501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1499.0, + 1094.0, + 1499.0, + 1094.0, + 1528.0, + 295.0, + 1528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1668.0, + 1404.0, + 1668.0, + 1404.0, + 1702.0, + 292.0, + 1702.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1698.0, + 1406.0, + 1698.0, + 1406.0, + 1731.0, + 292.0, + 1731.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1727.0, + 1407.0, + 1727.0, + 1407.0, + 1765.0, + 292.0, + 1765.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1760.0, + 1406.0, + 1760.0, + 1406.0, + 1794.0, + 295.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1789.0, + 1406.0, + 1789.0, + 1406.0, + 1823.0, + 294.0, + 1823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1821.0, + 1097.0, + 1821.0, + 1097.0, + 1855.0, + 294.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1180.0, + 1821.0, + 1405.0, + 1821.0, + 1405.0, + 1855.0, + 1180.0, + 1855.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1850.0, + 1405.0, + 1850.0, + 1405.0, + 1886.0, + 292.0, + 1886.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1880.0, + 1405.0, + 1880.0, + 1405.0, + 1918.0, + 292.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1912.0, + 1404.0, + 1912.0, + 1404.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1943.0, + 1404.0, + 1943.0, + 1404.0, + 1977.0, + 294.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1970.0, + 1406.0, + 1970.0, + 1406.0, + 2009.0, + 294.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2003.0, + 618.0, + 2003.0, + 618.0, + 2037.0, + 295.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 646.0, + 1405.0, + 646.0, + 1405.0, + 692.0, + 292.0, + 692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 684.0, + 1404.0, + 684.0, + 1404.0, + 718.0, + 295.0, + 718.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 714.0, + 1035.0, + 714.0, + 1035.0, + 751.0, + 294.0, + 751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 506.0, + 1160.0, + 506.0, + 1160.0, + 541.0, + 295.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1185.0, + 506.0, + 1369.0, + 506.0, + 1369.0, + 541.0, + 1185.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 506.0, + 1404.0, + 506.0, + 1404.0, + 541.0, + 1394.0, + 541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 536.0, + 1208.0, + 536.0, + 1208.0, + 572.0, + 295.0, + 572.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 339, + 278, + 1364, + 278, + 1364, + 1283, + 339, + 1283 + ], + "score": 0.984, + "html": "
ModelBackboneAPAP50AP75APsAPMAPLFPSParams
Faster RCNNResNet5038.459.042.021.542.150.318.143.57
Our Faster RCNNResNet5041.562.245.123.545.055.318.143.57
Faster RCNNResNet10139.860.143.322.543.652.814.262.57
Our Faster RCNNResNet10143.964.248.125.348.058.714.262.57
Cascade RCNNResNet5041.059.444.422.744.454.315.471.22
Our Cascade RCNNResNet5044.462.748.324.848.059.315.471.22
Cascade RCNNResNet10142.560.746.423.546.556.411.790.21
Our Cascade RCNNResNet10145.263.549.426.248.760.811.790.21
Dynamic RCNNResNet5039.858.343.223.042.852.418.143.57
Our Dynamic RCNNResNet5042.861.247.023.946.257.718.143.57
Dynamic RCNNResNet10141.259.745.324.044.954.314.262.57
Our Dynamic RCNNResNet10144.863.048.925.048.960.414.262.57
Grid RCNNResNet5040.458.443.622.843.953.314.066.37
Our Grid RCNNResNet5042.661.146.124.246.655.814.066.37
Grid RCNNResNet10141.659.845.023.745.754.711.085.36
Our Grid RCNNResNet10144.863.648.926.548.959.611.085.36
RetinaNetResNet5037.456.739.620.040.749.717.737.74
Our RetinaNetResNet5039.658.842.122.743.352.517.737.74
RetinaNetResNet10138.958.041.521.042.852.413.556.74
Our RetinaNetResNet10141.360.844.322.746.055.213.556.74
Fsaf RetinaNet Our Fsaf RetinaNetResNet5037.856.839.820.441.148.820.036.19
ResNet5041.461.044.223.145.255.220.036.19
Fsaf RetinaNetResNet10139.358.642.122.143.451.215.055.19
Our Fsaf RetinaNetResNet10142.662.045.524.547.056.215.055.19
RepPointsResNet5038.659.641.622.542.250.418.236.62
Our RepPointsResNet5040.661.743.823.444.653.018.236.62
RepPointsResNet10140.561.343.523.444.753.213.255.62
Our RepPointsResNet10142.7
63.746.424.947.256.413.255.62
" + }, + { + "category_id": 5, + "poly": [ + 363, + 1392, + 1338, + 1392, + 1338, + 1740, + 363, + 1740 + ], + "score": 0.983, + "html": "
ModelBackboneBounding box APMask AP
APAPsAPMAPLAPAPsAPMAPL
Mask RCNNResNet5039.222.942.651.235.419.138.648.4
Our mask RCNNResNet5041.723.445.355.837.419.740.552.1
Mask RCNNResNet10140.823.045.054.136.619.240.250.5
Our Mask RCNNResNet10143.024.747.257.138.720.742.353.3
Cascade Mask RCNNResNet5041.923.244.955.936.518.939.250.7
Our Cascade Mask RCNNResNet5043.824.947.258.438.020.240.952.8
CascadeMask RCNNResNet10142.924.446.557.037.319.740.651.5
Our Cascade Mask RCNNResNet10145.426.349.060.939.621.342.855.0
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1880, + 1403, + 1880, + 1403, + 2035, + 298, + 2035 + ], + "score": 0.976 + }, + { + "category_id": 0, + "poly": [ + 298, + 1819, + 890, + 1819, + 890, + 1852, + 298, + 1852 + ], + "score": 0.922 + }, + { + "category_id": 6, + "poly": [ + 314, + 1356, + 1382, + 1356, + 1382, + 1389, + 314, + 1389 + ], + "score": 0.903 + }, + { + "category_id": 6, + "poly": [ + 403, + 248, + 1292, + 248, + 1292, + 280, + 403, + 280 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.899 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2113, + 840, + 2113 + ], + "score": 0.778 + }, + { + "category_id": 13, + "poly": [ + 1225, + 1943, + 1283, + 1943, + 1283, + 1974, + 1225, + 1974 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { A T }" + }, + { + "category_id": 13, + "poly": [ + 1255, + 2003, + 1334, + 2003, + 1334, + 2035, + 1255, + 2035 + ], + "score": 0.9, + "latex": "( \\mathcal { L } _ { A M } )" + }, + { + "category_id": 13, + "poly": [ + 1337, + 1943, + 1400, + 1943, + 1400, + 1974, + 1337, + 1974 + ], + "score": 0.9, + "latex": "\\mathcal { L } _ { A M }" + }, + { + "category_id": 13, + "poly": [ + 346, + 1912, + 410, + 1912, + 410, + 1943, + 346, + 1943 + ], + "score": 0.89, + "latex": "\\mathcal { L } _ { A M }" + }, + { + "category_id": 13, + "poly": [ + 713, + 1912, + 806, + 1912, + 806, + 1943, + 713, + 1943 + ], + "score": 0.88, + "latex": "( \\mathcal { L } _ { N L D } )" + }, + { + "category_id": 13, + "poly": [ + 1341, + 1882, + 1401, + 1882, + 1401, + 1913, + 1341, + 1913 + ], + "score": 0.84, + "latex": "( { \\mathcal { L } } _ { A T }" + }, + { + "category_id": 13, + "poly": [ + 469, + 1973, + 552, + 1973, + 552, + 2002, + 469, + 2002 + ], + "score": 0.42, + "latex": "2 . 4 \\ : \\mathrm { A P }" + }, + { + "category_id": 13, + "poly": [ + 768, + 1944, + 851, + 1944, + 851, + 1972, + 768, + 1972 + ], + "score": 0.3, + "latex": "1 . 4 ~ \\mathrm { A P }" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1819.0, + 893.0, + 1819.0, + 893.0, + 1854.0, + 295.0, + 1854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 1354.0, + 1386.0, + 1354.0, + 1386.0, + 1393.0, + 309.0, + 1393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 246.0, + 1297.0, + 246.0, + 1297.0, + 286.0, + 401.0, + 286.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, + 2087.0, + 862.0, + 2087.0, + 862.0, + 2117.0, + 840.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1875.0, + 1340.0, + 1875.0, + 1340.0, + 1920.0, + 292.0, + 1920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 345.0, + 1910.0, + 345.0, + 1947.0, + 294.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 1910.0, + 712.0, + 1910.0, + 712.0, + 1947.0, + 411.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 1910.0, + 1405.0, + 1910.0, + 1405.0, + 1947.0, + 807.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1935.0, + 767.0, + 1935.0, + 767.0, + 1983.0, + 291.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 852.0, + 1935.0, + 1224.0, + 1935.0, + 1224.0, + 1983.0, + 852.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1935.0, + 1336.0, + 1935.0, + 1336.0, + 1983.0, + 1284.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1935.0, + 1404.0, + 1935.0, + 1404.0, + 1983.0, + 1401.0, + 1983.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1971.0, + 468.0, + 1971.0, + 468.0, + 2008.0, + 293.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 1971.0, + 1403.0, + 1971.0, + 1403.0, + 2008.0, + 553.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2001.0, + 1254.0, + 2001.0, + 1254.0, + 2039.0, + 294.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1335.0, + 2001.0, + 1404.0, + 2001.0, + 1404.0, + 2039.0, + 1335.0, + 2039.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 451, + 903, + 1248, + 903, + 1248, + 1388, + 451, + 1388 + ], + "score": 0.984, + "html": "
ModelAPAP50 AP75APs 21.5APMAPL
Faster RCNN + Chen etal.Method + Wang et al. Method + Heo et al. Method + Our Methods38.4 38.7 39.1 38.9 41.559.0 59.0 59.8 60.1 62.242.0 42.1 22.0 42.8 22.2 42.6 21.8 45.1 23.542.1 41.9 42.9 42.7 45.050.3 51.0 51.1 50.7 55.3
Cascade RCNN + Chen et al.Method + Wang et al. Method +Heo etal.Method + Our Methods41.0 41.6 42.1 41.7 44.459.4 62.1 62.7 62.3 62.744.4 45.7 46.1 45.7 48.322.7 23.9 24.4 23.9 24.844.4 54.3 45.8 54.7 46.4 55.6 45.7 55.3 48.0 59.3
RetinaNet + Heo et al. Method + Our Methods37.4 37.8 39.656.7 58.3 58.839.6 41.1 21.6 42.1 22.720.0 40.7 41.2 43.349.7 48.3 52.5
" + }, + { + "category_id": 5, + "poly": [ + 337, + 1510, + 1035, + 1510, + 1035, + 1756, + 337, + 1756 + ], + "score": 0.98, + "html": "
LossLAT LAM LNLD× × ×√ × ×× √ ×× × √√ √ ×√ 1 √
ResultAP APs38.439.640.839.841.241.5
APM21.522.722.822.723.023.5
APL42.1 50.342.9 52.544.3 54.343.1 52.344.6 55.345.0 55.3
" + }, + { + "category_id": 1, + "poly": [ + 297, + 369, + 1404, + 369, + 1404, + 583, + 297, + 583 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 597, + 1403, + 597, + 1403, + 752, + 298, + 752 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1402, + 229, + 1402, + 353, + 299, + 353 + ], + "score": 0.976 + }, + { + "category_id": 5, + "poly": [ + 1072, + 1586, + 1420, + 1586, + 1420, + 1771, + 1072, + 1771 + ], + "score": 0.975, + "html": "
Non-Local TypeAP
Embedded Gaussian41.5
Dot Production41.4
Concatenation41.5
Gaussian41.3
" + }, + { + "category_id": 1, + "poly": [ + 300, + 1941, + 1404, + 1941, + 1404, + 2034, + 300, + 2034 + ], + "score": 0.974 + }, + { + "category_id": 6, + "poly": [ + 298, + 808, + 1397, + 808, + 1397, + 901, + 298, + 901 + ], + "score": 0.952 + }, + { + "category_id": 6, + "poly": [ + 1071, + 1463, + 1402, + 1463, + 1402, + 1584, + 1071, + 1584 + ], + "score": 0.948 + }, + { + "category_id": 6, + "poly": [ + 392, + 1477, + 976, + 1477, + 976, + 1508, + 392, + 1508 + ], + "score": 0.925 + }, + { + "category_id": 0, + "poly": [ + 298, + 1811, + 531, + 1811, + 531, + 1847, + 298, + 1847 + ], + "score": 0.924 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.897 + }, + { + "category_id": 0, + "poly": [ + 298, + 1882, + 1088, + 1882, + 1088, + 1915, + 298, + 1915 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 842, + 2087, + 858, + 2087, + 858, + 2111, + 842, + 2111 + ], + "score": 0.659 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 859, + 2087, + 859, + 2111, + 841, + 2111 + ], + "score": 0.285 + }, + { + "category_id": 13, + "poly": [ + 297, + 400, + 318, + 400, + 318, + 431, + 297, + 431 + ], + "score": 0.82, + "latex": "\\beta" + }, + { + "category_id": 13, + "poly": [ + 382, + 404, + 405, + 404, + 405, + 432, + 382, + 432 + ], + "score": 0.81, + "latex": "\\gamma" + }, + { + "category_id": 13, + "poly": [ + 1221, + 400, + 1246, + 400, + 1246, + 427, + 1221, + 427 + ], + "score": 0.79, + "latex": "T" + }, + { + "category_id": 13, + "poly": [ + 1372, + 376, + 1394, + 376, + 1394, + 397, + 1372, + 397 + ], + "score": 0.59, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 469, + 1021, + 490, + 1021, + 490, + 1043, + 469, + 1043 + ], + "score": 0.43, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 470, + 1217, + 490, + 1217, + 490, + 1239, + 470, + 1239 + ], + "score": 0.39, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 469, + 1051, + 490, + 1051, + 490, + 1073, + 469, + 1073 + ], + "score": 0.38, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 469, + 1187, + 490, + 1187, + 490, + 1209, + 469, + 1209 + ], + "score": 0.38, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 469, + 1156, + 490, + 1156, + 490, + 1180, + 469, + 1180 + ], + "score": 0.31, + "latex": "^ +" + }, + { + "category_id": 13, + "poly": [ + 469, + 989, + 490, + 989, + 490, + 1012, + 469, + 1012 + ], + "score": 0.3, + "latex": "^ +" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 810.0, + 1403.0, + 810.0, + 1403.0, + 840.0, + 297.0, + 840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 840.0, + 1405.0, + 840.0, + 1405.0, + 873.0, + 293.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 870.0, + 1217.0, + 870.0, + 1217.0, + 903.0, + 293.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1462.0, + 1401.0, + 1462.0, + 1401.0, + 1494.0, + 1072.0, + 1494.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1071.0, + 1493.0, + 1401.0, + 1493.0, + 1401.0, + 1524.0, + 1071.0, + 1524.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1072.0, + 1523.0, + 1400.0, + 1523.0, + 1400.0, + 1555.0, + 1072.0, + 1555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1069.0, + 1550.0, + 1206.0, + 1550.0, + 1206.0, + 1589.0, + 1069.0, + 1589.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1475.0, + 977.0, + 1475.0, + 977.0, + 1512.0, + 392.0, + 1512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1805.0, + 535.0, + 1805.0, + 535.0, + 1856.0, + 290.0, + 1856.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": [ + 294.0, + 1881.0, + 1092.0, + 1881.0, + 1092.0, + 1919.0, + 294.0, + 1919.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, + 2118.0, + 839.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 366.0, + 1371.0, + 366.0, + 1371.0, + 406.0, + 292.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 366.0, + 1408.0, + 366.0, + 1408.0, + 406.0, + 1395.0, + 406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 400.0, + 381.0, + 400.0, + 381.0, + 434.0, + 319.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 406.0, + 400.0, + 1220.0, + 400.0, + 1220.0, + 434.0, + 406.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 400.0, + 1406.0, + 400.0, + 1406.0, + 434.0, + 1247.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 429.0, + 1405.0, + 429.0, + 1405.0, + 464.0, + 295.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 463.0, + 1405.0, + 463.0, + 1405.0, + 493.0, + 296.0, + 493.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": [ + 291.0, + 520.0, + 1407.0, + 520.0, + 1407.0, + 556.0, + 291.0, + 556.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 556.0, + 502.0, + 556.0, + 502.0, + 588.0, + 296.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 599.0, + 1404.0, + 599.0, + 1404.0, + 632.0, + 296.0, + 632.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 629.0, + 1404.0, + 629.0, + 1404.0, + 663.0, + 296.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 659.0, + 1407.0, + 659.0, + 1407.0, + 694.0, + 292.0, + 694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 688.0, + 1405.0, + 688.0, + 1405.0, + 725.0, + 294.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 720.0, + 1370.0, + 720.0, + 1370.0, + 756.0, + 294.0, + 756.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 230.0, + 1404.0, + 230.0, + 1404.0, + 263.0, + 295.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 262.0, + 1404.0, + 262.0, + 1404.0, + 294.0, + 295.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 291.0, + 1404.0, + 291.0, + 1404.0, + 326.0, + 294.0, + 326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 321.0, + 1030.0, + 321.0, + 1030.0, + 354.0, + 295.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1942.0, + 1406.0, + 1942.0, + 1406.0, + 1975.0, + 296.0, + 1975.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": [ + 294.0, + 2003.0, + 1403.0, + 2003.0, + 1403.0, + 2037.0, + 294.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1407, + 1404, + 1407, + 1404, + 1866, + 297, + 1866 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 299, + 1881, + 1402, + 1881, + 1402, + 2034, + 299, + 2034 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 338, + 1404, + 338, + 1404, + 461, + 298, + 461 + ], + "score": 0.974 + }, + { + "category_id": 3, + "poly": [ + 313, + 848, + 1386, + 848, + 1386, + 1150, + 313, + 1150 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 298, + 230, + 1402, + 230, + 1402, + 322, + 298, + 322 + ], + "score": 0.965 + }, + { + "category_id": 3, + "poly": [ + 300, + 508, + 1395, + 508, + 1395, + 701, + 300, + 701 + ], + "score": 0.963 + }, + { + "category_id": 4, + "poly": [ + 298, + 1181, + 1401, + 1181, + 1401, + 1246, + 298, + 1246 + ], + "score": 0.933 + }, + { + "category_id": 4, + "poly": [ + 302, + 728, + 1388, + 728, + 1388, + 763, + 302, + 763 + ], + "score": 0.911 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 813, + 76, + 813, + 104, + 300, + 104 + ], + "score": 0.896 + }, + { + "category_id": 2, + "poly": [ + 841, + 2089, + 858, + 2089, + 858, + 2111, + 841, + 2111 + ], + "score": 0.792 + }, + { + "category_id": 1, + "poly": [ + 299, + 1340, + 1223, + 1340, + 1223, + 1373, + 299, + 1373 + ], + "score": 0.784 + }, + { + "category_id": 0, + "poly": [ + 299, + 1340, + 1223, + 1340, + 1223, + 1373, + 299, + 1373 + ], + "score": 0.146 + }, + { + "category_id": 13, + "poly": [ + 834, + 730, + 945, + 730, + 945, + 762, + 834, + 762 + ], + "score": 0.93, + "latex": "\\alpha , \\beta , \\gamma , T" + }, + { + "category_id": 15, + "poly": [ + 312.0, + 858.0, + 344.0, + 858.0, + 344.0, + 995.0, + 312.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 911.0, + 408.0, + 911.0, + 408.0, + 920.0, + 393.0, + 920.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 1012.0, + 338.0, + 1012.0, + 338.0, + 1143.0, + 307.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 509.0, + 365.0, + 509.0, + 365.0, + 663.0, + 293.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 509.0, + 635.0, + 509.0, + 635.0, + 531.0, + 596.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 762.0, + 524.0, + 854.0, + 524.0, + 854.0, + 546.0, + 762.0, + 546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 509.0, + 901.0, + 509.0, + 901.0, + 533.0, + 861.0, + 533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 509.0, + 1169.0, + 509.0, + 1169.0, + 531.0, + 1129.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 535.0, + 366.0, + 535.0, + 366.0, + 559.0, + 326.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 535.0, + 636.0, + 535.0, + 636.0, + 559.0, + 596.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 535.0, + 904.0, + 535.0, + 904.0, + 559.0, + 861.0, + 559.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 563.0, + 365.0, + 563.0, + 365.0, + 585.0, + 326.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 563.0, + 636.0, + 563.0, + 636.0, + 586.0, + 596.0, + 586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 860.0, + 560.0, + 904.0, + 560.0, + 904.0, + 587.0, + 860.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 553.0, + 1171.0, + 553.0, + 1171.0, + 577.0, + 1129.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 590.0, + 365.0, + 590.0, + 365.0, + 612.0, + 326.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 570.0, + 593.0, + 586.0, + 593.0, + 586.0, + 608.0, + 570.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 590.0, + 638.0, + 590.0, + 638.0, + 614.0, + 596.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 589.0, + 902.0, + 589.0, + 902.0, + 612.0, + 862.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 597.0, + 943.0, + 597.0, + 943.0, + 607.0, + 932.0, + 607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 598.0, + 1169.0, + 598.0, + 1169.0, + 622.0, + 1129.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 618.0, + 365.0, + 618.0, + 365.0, + 640.0, + 326.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 618.0, + 636.0, + 618.0, + 636.0, + 640.0, + 596.0, + 640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 641.0, + 624.0, + 652.0, + 624.0, + 652.0, + 635.0, + 641.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 841.0, + 620.0, + 856.0, + 620.0, + 856.0, + 636.0, + 841.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 616.0, + 902.0, + 616.0, + 902.0, + 639.0, + 861.0, + 639.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 620.0, + 922.0, + 620.0, + 922.0, + 635.0, + 906.0, + 635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 624.0, + 1281.0, + 624.0, + 1281.0, + 647.0, + 1177.0, + 647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 644.0, + 365.0, + 644.0, + 365.0, + 666.0, + 326.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 644.0, + 635.0, + 644.0, + 635.0, + 666.0, + 595.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 642.0, + 901.0, + 642.0, + 901.0, + 666.0, + 861.0, + 666.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 644.0, + 1167.0, + 644.0, + 1167.0, + 664.0, + 1127.0, + 664.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 657.0, + 412.0, + 657.0, + 412.0, + 679.0, + 393.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 658.0, + 462.0, + 658.0, + 462.0, + 676.0, + 445.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 494.0, + 657.0, + 513.0, + 657.0, + 513.0, + 679.0, + 494.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 654.0, + 565.0, + 654.0, + 565.0, + 682.0, + 546.0, + 682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 663.0, + 657.0, + 682.0, + 657.0, + 682.0, + 680.0, + 663.0, + 680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 714.0, + 658.0, + 730.0, + 658.0, + 730.0, + 676.0, + 714.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 763.0, + 657.0, + 783.0, + 657.0, + 783.0, + 679.0, + 763.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 816.0, + 659.0, + 831.0, + 659.0, + 831.0, + 679.0, + 816.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 931.0, + 657.0, + 946.0, + 657.0, + 946.0, + 678.0, + 931.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 658.0, + 996.0, + 658.0, + 996.0, + 676.0, + 981.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 658.0, + 1047.0, + 658.0, + 1047.0, + 676.0, + 1030.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1080.0, + 658.0, + 1095.0, + 658.0, + 1095.0, + 676.0, + 1080.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1196.0, + 656.0, + 1215.0, + 656.0, + 1215.0, + 679.0, + 1196.0, + 679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 658.0, + 1263.0, + 658.0, + 1263.0, + 676.0, + 1247.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1296.0, + 657.0, + 1316.0, + 657.0, + 1316.0, + 678.0, + 1296.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 658.0, + 1363.0, + 658.0, + 1363.0, + 676.0, + 1347.0, + 676.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 437.0, + 674.0, + 521.0, + 674.0, + 521.0, + 700.0, + 437.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 673.0, + 791.0, + 673.0, + 791.0, + 703.0, + 703.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 673.0, + 1055.0, + 673.0, + 1055.0, + 703.0, + 968.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 673.0, + 1331.0, + 673.0, + 1331.0, + 700.0, + 1241.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 520.0, + 587.0, + 520.0, + 587.0, + 550.5, + 508.0, + 550.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 522.0, + 1118.0, + 522.0, + 1118.0, + 548.5, + 1046.0, + 548.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1181.0, + 1405.0, + 1181.0, + 1405.0, + 1216.0, + 294.0, + 1216.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1215.0, + 1274.0, + 1215.0, + 1274.0, + 1247.0, + 297.0, + 1247.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 306.0, + 723.0, + 833.0, + 723.0, + 833.0, + 767.0, + 306.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 946.0, + 723.0, + 1391.0, + 723.0, + 1391.0, + 767.0, + 946.0, + 767.0 + ], + "score": 1.0, + "text": "" + }, + { + "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": [ + 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, + 1338.0, + 1231.0, + 1338.0, + 1231.0, + 1376.0, + 293.0, + 1376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1407.0, + 1404.0, + 1407.0, + 1404.0, + 1442.0, + 295.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1437.0, + 1406.0, + 1437.0, + 1406.0, + 1473.0, + 295.0, + 1473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1468.0, + 1405.0, + 1468.0, + 1405.0, + 1503.0, + 295.0, + 1503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1499.0, + 1406.0, + 1499.0, + 1406.0, + 1534.0, + 294.0, + 1534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1529.0, + 1406.0, + 1529.0, + 1406.0, + 1564.0, + 294.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1560.0, + 1404.0, + 1560.0, + 1404.0, + 1595.0, + 294.0, + 1595.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1589.0, + 1404.0, + 1589.0, + 1404.0, + 1625.0, + 294.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1620.0, + 1404.0, + 1620.0, + 1404.0, + 1655.0, + 295.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1650.0, + 1404.0, + 1650.0, + 1404.0, + 1685.0, + 295.0, + 1685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1681.0, + 1404.0, + 1681.0, + 1404.0, + 1716.0, + 295.0, + 1716.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1710.0, + 1405.0, + 1710.0, + 1405.0, + 1748.0, + 294.0, + 1748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1743.0, + 1404.0, + 1743.0, + 1404.0, + 1776.0, + 294.0, + 1776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1774.0, + 1406.0, + 1774.0, + 1406.0, + 1809.0, + 294.0, + 1809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1804.0, + 1405.0, + 1804.0, + 1405.0, + 1839.0, + 292.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1837.0, + 1133.0, + 1837.0, + 1133.0, + 1869.0, + 296.0, + 1869.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1877.0, + 1404.0, + 1877.0, + 1404.0, + 1918.0, + 295.0, + 1918.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1909.0, + 1406.0, + 1909.0, + 1406.0, + 1948.0, + 293.0, + 1948.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, + 1973.0, + 1404.0, + 1973.0, + 1404.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2002.0, + 1052.0, + 2002.0, + 1052.0, + 2035.0, + 294.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 337.0, + 1405.0, + 337.0, + 1405.0, + 374.0, + 292.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 369.0, + 1405.0, + 369.0, + 1405.0, + 402.0, + 293.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 400.0, + 1406.0, + 400.0, + 1406.0, + 431.0, + 293.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 431.0, + 1294.0, + 431.0, + 1294.0, + 463.0, + 294.0, + 463.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 229.0, + 1406.0, + 229.0, + 1406.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 260.0, + 1404.0, + 260.0, + 1404.0, + 295.0, + 294.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 289.0, + 1039.0, + 289.0, + 1039.0, + 325.0, + 293.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1338.0, + 1231.0, + 1338.0, + 1231.0, + 1376.0, + 293.0, + 1376.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1039, + 1404, + 1039, + 1404, + 1223, + 298, + 1223 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 298, + 777, + 1404, + 777, + 1404, + 1022, + 298, + 1022 + ], + "score": 0.979 + }, + { + "category_id": 4, + "poly": [ + 296, + 536, + 1017, + 536, + 1017, + 659, + 296, + 659 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 291, + 1334, + 1377, + 1334, + 1377, + 1368, + 291, + 1368 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 812, + 76, + 812, + 104, + 300, + 104 + ], + "score": 0.887 + }, + { + "category_id": 0, + "poly": [ + 300, + 1267, + 662, + 1267, + 662, + 1301, + 300, + 1301 + ], + "score": 0.865 + }, + { + "category_id": 0, + "poly": [ + 300, + 709, + 543, + 709, + 543, + 744, + 300, + 744 + ], + "score": 0.854 + }, + { + "category_id": 4, + "poly": [ + 1033, + 537, + 1403, + 537, + 1403, + 657, + 1033, + 657 + ], + "score": 0.831 + }, + { + "category_id": 0, + "poly": [ + 299, + 1413, + 489, + 1413, + 489, + 1447, + 299, + 1447 + ], + "score": 0.794 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 858, + 2088, + 858, + 2111, + 840, + 2111 + ], + "score": 0.755 + }, + { + "category_id": 1, + "poly": [ + 299, + 1942, + 1400, + 1942, + 1400, + 2034, + 299, + 2034 + ], + "score": 0.677 + }, + { + "category_id": 1, + "poly": [ + 300, + 1463, + 1400, + 1463, + 1400, + 1557, + 300, + 1557 + ], + "score": 0.67 + }, + { + "category_id": 3, + "poly": [ + 305, + 222, + 1391, + 222, + 1391, + 505, + 305, + 505 + ], + "score": 0.603 + }, + { + "category_id": 1, + "poly": [ + 300, + 1573, + 1401, + 1573, + 1401, + 1668, + 300, + 1668 + ], + "score": 0.595 + }, + { + "category_id": 1, + "poly": [ + 299, + 1685, + 1402, + 1685, + 1402, + 1780, + 299, + 1780 + ], + "score": 0.538 + }, + { + "category_id": 1, + "poly": [ + 298, + 1798, + 1404, + 1798, + 1404, + 1922, + 298, + 1922 + ], + "score": 0.48 + }, + { + "category_id": 1, + "poly": [ + 299, + 1413, + 489, + 1413, + 489, + 1447, + 299, + 1447 + ], + "score": 0.091 + }, + { + "category_id": 15, + "poly": [ + 295.0, + 536.0, + 1020.0, + 536.0, + 1020.0, + 570.0, + 295.0, + 570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 565.0, + 1019.0, + 565.0, + 1019.0, + 601.0, + 293.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 595.0, + 1019.0, + 595.0, + 1019.0, + 631.0, + 293.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 626.0, + 1011.0, + 626.0, + 1011.0, + 663.0, + 293.0, + 663.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": [ + 291.0, + 1262.0, + 667.0, + 1262.0, + 667.0, + 1308.0, + 291.0, + 1308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 703.0, + 549.0, + 703.0, + 549.0, + 753.0, + 291.0, + 753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 536.0, + 1402.0, + 536.0, + 1402.0, + 568.0, + 1033.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1032.0, + 566.0, + 1405.0, + 566.0, + 1405.0, + 598.0, + 1032.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 594.0, + 1405.0, + 594.0, + 1405.0, + 630.0, + 1029.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1029.0, + 623.0, + 1230.0, + 623.0, + 1230.0, + 660.0, + 1029.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1413.0, + 491.0, + 1413.0, + 491.0, + 1450.0, + 296.0, + 1450.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": [ + 404.0, + 228.0, + 574.0, + 228.0, + 574.0, + 251.0, + 404.0, + 251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 227.0, + 928.0, + 227.0, + 928.0, + 252.0, + 756.0, + 252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 222.0, + 1089.0, + 222.0, + 1089.0, + 241.0, + 1063.0, + 241.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 245.0, + 356.0, + 245.0, + 356.0, + 267.0, + 327.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 244.0, + 710.0, + 244.0, + 710.0, + 265.0, + 680.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 252.0, + 1091.0, + 252.0, + 1091.0, + 275.0, + 1062.0, + 275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 244.0, + 1352.0, + 244.0, + 1352.0, + 261.0, + 1336.0, + 261.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1315.0, + 275.0, + 1326.0, + 275.0, + 1326.0, + 285.0, + 1315.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 286.0, + 358.0, + 286.0, + 358.0, + 308.0, + 325.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 286.0, + 712.0, + 286.0, + 712.0, + 308.0, + 679.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 285.0, + 1091.0, + 285.0, + 1091.0, + 307.0, + 1062.0, + 307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1033.0, + 299.0, + 1065.0, + 299.0, + 1065.0, + 398.0, + 1033.0, + 398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1149.0, + 308.0, + 1161.0, + 308.0, + 1161.0, + 317.0, + 1149.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 302.0, + 319.0, + 355.0, + 319.0, + 355.0, + 400.0, + 302.0, + 400.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 318.0, + 711.0, + 318.0, + 711.0, + 397.0, + 656.0, + 397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 319.0, + 1089.0, + 319.0, + 1089.0, + 338.0, + 1063.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1340.0, + 340.0, + 1350.0, + 340.0, + 1350.0, + 349.0, + 1340.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 356.0, + 449.0, + 356.0, + 449.0, + 377.0, + 382.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 356.0, + 806.0, + 356.0, + 806.0, + 377.0, + 739.0, + 377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1063.0, + 350.0, + 1086.0, + 350.0, + 1086.0, + 371.0, + 1063.0, + 371.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 361.0, + 1211.0, + 361.0, + 1211.0, + 372.0, + 1201.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 356.0, + 1246.0, + 356.0, + 1246.0, + 368.0, + 1225.0, + 368.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 371.0, + 356.0, + 371.0, + 356.0, + 393.0, + 325.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 369.0, + 449.0, + 369.0, + 449.0, + 419.0, + 381.0, + 419.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 369.0, + 712.0, + 369.0, + 712.0, + 392.0, + 679.0, + 392.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 371.0, + 806.0, + 371.0, + 806.0, + 420.0, + 739.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 381.0, + 1093.0, + 381.0, + 1093.0, + 403.0, + 1062.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 368.0, + 1128.0, + 368.0, + 1128.0, + 379.0, + 1117.0, + 379.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 373.0, + 1163.0, + 373.0, + 1163.0, + 387.0, + 1147.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1229.0, + 372.0, + 1363.0, + 372.0, + 1363.0, + 415.0, + 1229.0, + 415.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 414.0, + 356.0, + 414.0, + 356.0, + 437.0, + 325.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 413.0, + 446.0, + 413.0, + 446.0, + 433.0, + 383.0, + 433.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 413.0, + 711.0, + 413.0, + 711.0, + 435.0, + 679.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 414.0, + 804.0, + 414.0, + 804.0, + 434.0, + 739.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 414.0, + 1093.0, + 414.0, + 1093.0, + 437.0, + 1062.0, + 437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1230.0, + 414.0, + 1247.0, + 414.0, + 1247.0, + 427.0, + 1230.0, + 427.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 409.0, + 1376.0, + 409.0, + 1376.0, + 432.0, + 1254.0, + 432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 427.0, + 444.0, + 427.0, + 444.0, + 446.0, + 382.0, + 446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 428.0, + 801.0, + 428.0, + 801.0, + 448.0, + 739.0, + 448.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1116.0, + 431.0, + 1132.0, + 431.0, + 1132.0, + 445.0, + 1116.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 425.0, + 1322.0, + 425.0, + 1322.0, + 452.0, + 1254.0, + 452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 382.0, + 440.0, + 443.0, + 440.0, + 443.0, + 489.0, + 382.0, + 489.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 455.0, + 465.0, + 487.0, + 465.0, + 487.0, + 488.0, + 455.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 466.0, + 544.0, + 466.0, + 544.0, + 488.0, + 513.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 466.0, + 600.0, + 466.0, + 600.0, + 488.0, + 569.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 626.0, + 466.0, + 655.0, + 466.0, + 655.0, + 488.0, + 626.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 456.0, + 726.0, + 456.0, + 726.0, + 488.0, + 679.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 442.0, + 800.0, + 442.0, + 800.0, + 490.0, + 739.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 465.0, + 841.0, + 465.0, + 841.0, + 488.0, + 810.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 466.0, + 897.0, + 466.0, + 897.0, + 488.0, + 867.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 922.0, + 466.0, + 953.0, + 466.0, + 953.0, + 488.0, + 922.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 981.0, + 469.0, + 1007.0, + 469.0, + 1007.0, + 486.0, + 981.0, + 486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1062.0, + 446.0, + 1091.0, + 446.0, + 1091.0, + 469.0, + 1062.0, + 469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1101.0, + 459.0, + 1128.0, + 459.0, + 1128.0, + 482.0, + 1101.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 459.0, + 1174.0, + 459.0, + 1174.0, + 482.0, + 1146.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1190.0, + 459.0, + 1219.0, + 459.0, + 1219.0, + 483.0, + 1190.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1235.0, + 458.0, + 1263.0, + 458.0, + 1263.0, + 483.0, + 1235.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1279.0, + 458.0, + 1308.0, + 458.0, + 1308.0, + 483.0, + 1279.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1324.0, + 459.0, + 1353.0, + 459.0, + 1353.0, + 483.0, + 1324.0, + 483.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1369.0, + 462.0, + 1395.0, + 462.0, + 1395.0, + 481.0, + 1369.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 481.0, + 514.0, + 481.0, + 514.0, + 506.0, + 460.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 819.0, + 481.0, + 873.0, + 481.0, + 873.0, + 505.0, + 819.0, + 505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 482.0, + 1290.0, + 482.0, + 1290.0, + 506.0, + 1199.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.75, + 455.0, + 361.75, + 455.0, + 361.75, + 486.5, + 332.75, + 486.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1038.0, + 1404.0, + 1038.0, + 1404.0, + 1074.0, + 294.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1069.0, + 1404.0, + 1069.0, + 1404.0, + 1104.0, + 294.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1101.0, + 1404.0, + 1101.0, + 1404.0, + 1132.0, + 296.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1130.0, + 1404.0, + 1130.0, + 1404.0, + 1165.0, + 293.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1160.0, + 1406.0, + 1160.0, + 1406.0, + 1194.0, + 294.0, + 1194.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1192.0, + 1385.0, + 1192.0, + 1385.0, + 1224.0, + 296.0, + 1224.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 779.0, + 1405.0, + 779.0, + 1405.0, + 812.0, + 294.0, + 812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 810.0, + 1405.0, + 810.0, + 1405.0, + 843.0, + 294.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 840.0, + 1406.0, + 840.0, + 1406.0, + 873.0, + 296.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 871.0, + 1405.0, + 871.0, + 1405.0, + 903.0, + 293.0, + 903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 899.0, + 1404.0, + 899.0, + 1404.0, + 934.0, + 293.0, + 934.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 929.0, + 1404.0, + 929.0, + 1404.0, + 965.0, + 293.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 961.0, + 1405.0, + 961.0, + 1405.0, + 995.0, + 292.0, + 995.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 993.0, + 1083.0, + 993.0, + 1083.0, + 1023.0, + 296.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1326.0, + 1383.0, + 1326.0, + 1383.0, + 1378.0, + 294.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1977.0, + 295.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1971.0, + 1405.0, + 1971.0, + 1405.0, + 2008.0, + 323.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 2002.0, + 692.0, + 2002.0, + 692.0, + 2037.0, + 321.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1463.0, + 1404.0, + 1463.0, + 1404.0, + 1497.0, + 296.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1493.0, + 1404.0, + 1493.0, + 1404.0, + 1529.0, + 321.0, + 1529.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1525.0, + 999.0, + 1525.0, + 999.0, + 1558.0, + 320.0, + 1558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1573.0, + 1403.0, + 1573.0, + 1403.0, + 1610.0, + 294.0, + 1610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1607.0, + 1403.0, + 1607.0, + 1403.0, + 1641.0, + 323.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1630.0, + 398.0, + 1630.0, + 398.0, + 1671.0, + 320.0, + 1671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1681.0, + 1403.0, + 1681.0, + 1403.0, + 1724.0, + 294.0, + 1724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1717.0, + 1404.0, + 1717.0, + 1404.0, + 1753.0, + 323.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1748.0, + 713.0, + 1748.0, + 713.0, + 1781.0, + 323.0, + 1781.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1793.0, + 1406.0, + 1793.0, + 1406.0, + 1839.0, + 292.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1831.0, + 1405.0, + 1831.0, + 1405.0, + 1865.0, + 321.0, + 1865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1859.0, + 1404.0, + 1859.0, + 1404.0, + 1897.0, + 322.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1892.0, + 639.0, + 1892.0, + 639.0, + 1924.0, + 323.0, + 1924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1413.0, + 491.0, + 1413.0, + 491.0, + 1450.0, + 296.0, + 1450.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 8, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.882 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.825 + }, + { + "category_id": 1, + "poly": [ + 295, + 605, + 1402, + 605, + 1402, + 669, + 295, + 669 + ], + "score": 0.708 + }, + { + "category_id": 1, + "poly": [ + 300, + 690, + 1402, + 690, + 1402, + 785, + 300, + 785 + ], + "score": 0.699 + }, + { + "category_id": 1, + "poly": [ + 299, + 1386, + 1401, + 1386, + 1401, + 1482, + 299, + 1482 + ], + "score": 0.681 + }, + { + "category_id": 1, + "poly": [ + 297, + 893, + 1399, + 893, + 1399, + 959, + 297, + 959 + ], + "score": 0.675 + }, + { + "category_id": 1, + "poly": [ + 294, + 807, + 1401, + 807, + 1401, + 872, + 294, + 872 + ], + "score": 0.674 + }, + { + "category_id": 1, + "poly": [ + 297, + 980, + 1398, + 980, + 1398, + 1045, + 297, + 1045 + ], + "score": 0.655 + }, + { + "category_id": 1, + "poly": [ + 298, + 1269, + 1397, + 1269, + 1397, + 1365, + 298, + 1365 + ], + "score": 0.651 + }, + { + "category_id": 1, + "poly": [ + 296, + 1183, + 1400, + 1183, + 1400, + 1248, + 296, + 1248 + ], + "score": 0.645 + }, + { + "category_id": 1, + "poly": [ + 296, + 518, + 1401, + 518, + 1401, + 583, + 296, + 583 + ], + "score": 0.64 + }, + { + "category_id": 1, + "poly": [ + 297, + 1736, + 1402, + 1736, + 1402, + 1831, + 297, + 1831 + ], + "score": 0.626 + }, + { + "category_id": 1, + "poly": [ + 297, + 1066, + 1401, + 1066, + 1401, + 1161, + 297, + 1161 + ], + "score": 0.62 + }, + { + "category_id": 1, + "poly": [ + 297, + 1503, + 1404, + 1503, + 1404, + 1599, + 297, + 1599 + ], + "score": 0.617 + }, + { + "category_id": 1, + "poly": [ + 297, + 1621, + 1406, + 1621, + 1406, + 1714, + 297, + 1714 + ], + "score": 0.604 + }, + { + "category_id": 1, + "poly": [ + 299, + 229, + 1400, + 229, + 1400, + 323, + 299, + 323 + ], + "score": 0.583 + }, + { + "category_id": 1, + "poly": [ + 296, + 431, + 1398, + 431, + 1398, + 498, + 296, + 498 + ], + "score": 0.56 + }, + { + "category_id": 1, + "poly": [ + 297, + 1971, + 1398, + 1971, + 1398, + 2035, + 297, + 2035 + ], + "score": 0.559 + }, + { + "category_id": 1, + "poly": [ + 300, + 1854, + 1401, + 1854, + 1401, + 1950, + 300, + 1950 + ], + "score": 0.536 + }, + { + "category_id": 1, + "poly": [ + 290, + 345, + 1402, + 345, + 1402, + 409, + 290, + 409 + ], + "score": 0.498 + }, + { + "category_id": 13, + "poly": [ + 1187, + 1653, + 1269, + 1653, + 1269, + 1683, + 1187, + 1683 + ], + "score": 0.4, + "latex": "0 . 5 \\mathrm { m b }" + }, + { + "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, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 605.0, + 1404.0, + 605.0, + 1404.0, + 641.0, + 295.0, + 641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 637.0, + 894.0, + 637.0, + 894.0, + 669.0, + 322.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 690.0, + 1406.0, + 690.0, + 1406.0, + 728.0, + 295.0, + 728.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 720.0, + 1406.0, + 720.0, + 1406.0, + 761.0, + 320.0, + 761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 747.0, + 398.0, + 747.0, + 398.0, + 788.0, + 320.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1383.0, + 1405.0, + 1383.0, + 1405.0, + 1425.0, + 293.0, + 1425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1418.0, + 1405.0, + 1418.0, + 1405.0, + 1452.0, + 325.0, + 1452.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1450.0, + 708.0, + 1450.0, + 708.0, + 1482.0, + 320.0, + 1482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 887.0, + 1404.0, + 887.0, + 1404.0, + 936.0, + 292.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 925.0, + 742.0, + 925.0, + 742.0, + 960.0, + 322.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 809.0, + 1402.0, + 809.0, + 1402.0, + 845.0, + 296.0, + 845.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 838.0, + 1122.0, + 838.0, + 1122.0, + 873.0, + 323.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 980.0, + 1403.0, + 980.0, + 1403.0, + 1018.0, + 295.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1013.0, + 971.0, + 1013.0, + 971.0, + 1046.0, + 322.0, + 1046.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1269.0, + 1402.0, + 1269.0, + 1402.0, + 1307.0, + 297.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1302.0, + 1403.0, + 1302.0, + 1403.0, + 1337.0, + 324.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1332.0, + 775.0, + 1332.0, + 775.0, + 1366.0, + 324.0, + 1366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1183.0, + 1405.0, + 1183.0, + 1405.0, + 1219.0, + 296.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1214.0, + 503.0, + 1214.0, + 503.0, + 1248.0, + 323.0, + 1248.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 514.0, + 1406.0, + 514.0, + 1406.0, + 560.0, + 293.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 548.0, + 1133.0, + 548.0, + 1133.0, + 584.0, + 323.0, + 584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1738.0, + 1401.0, + 1738.0, + 1401.0, + 1773.0, + 298.0, + 1773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1766.0, + 1406.0, + 1766.0, + 1406.0, + 1805.0, + 320.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1796.0, + 400.0, + 1796.0, + 400.0, + 1832.0, + 320.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1066.0, + 1403.0, + 1066.0, + 1403.0, + 1104.0, + 295.0, + 1104.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1099.0, + 1406.0, + 1099.0, + 1406.0, + 1135.0, + 321.0, + 1135.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1129.0, + 808.0, + 1129.0, + 808.0, + 1163.0, + 324.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1502.0, + 1406.0, + 1502.0, + 1406.0, + 1541.0, + 292.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1534.0, + 1405.0, + 1534.0, + 1405.0, + 1571.0, + 321.0, + 1571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1567.0, + 574.0, + 1567.0, + 574.0, + 1599.0, + 321.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1622.0, + 1404.0, + 1622.0, + 1404.0, + 1655.0, + 295.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1653.0, + 1186.0, + 1653.0, + 1186.0, + 1687.0, + 324.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 1653.0, + 1404.0, + 1653.0, + 1404.0, + 1687.0, + 1270.0, + 1687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1682.0, + 498.0, + 1682.0, + 498.0, + 1713.0, + 324.0, + 1713.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": [ + 323.0, + 261.0, + 1404.0, + 261.0, + 1404.0, + 295.0, + 323.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 291.0, + 776.0, + 291.0, + 776.0, + 324.0, + 323.0, + 324.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 432.0, + 1402.0, + 432.0, + 1402.0, + 468.0, + 295.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 463.0, + 985.0, + 463.0, + 985.0, + 500.0, + 322.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1971.0, + 1403.0, + 1971.0, + 1403.0, + 2007.0, + 296.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 2002.0, + 1328.0, + 2002.0, + 1328.0, + 2038.0, + 323.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1853.0, + 1406.0, + 1853.0, + 1406.0, + 1891.0, + 295.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1885.0, + 1405.0, + 1885.0, + 1405.0, + 1922.0, + 323.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1915.0, + 1009.0, + 1915.0, + 1009.0, + 1952.0, + 323.0, + 1952.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 346.0, + 1405.0, + 346.0, + 1405.0, + 382.0, + 294.0, + 382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 376.0, + 1101.0, + 376.0, + 1101.0, + 410.0, + 321.0, + 410.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.886 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.827 + }, + { + "category_id": 1, + "poly": [ + 293, + 741, + 1402, + 741, + 1402, + 806, + 293, + 806 + ], + "score": 0.758 + }, + { + "category_id": 1, + "poly": [ + 298, + 1343, + 1401, + 1343, + 1401, + 1409, + 298, + 1409 + ], + "score": 0.756 + }, + { + "category_id": 1, + "poly": [ + 299, + 1053, + 1406, + 1053, + 1406, + 1210, + 299, + 1210 + ], + "score": 0.752 + }, + { + "category_id": 1, + "poly": [ + 300, + 939, + 1400, + 939, + 1400, + 1033, + 300, + 1033 + ], + "score": 0.742 + }, + { + "category_id": 1, + "poly": [ + 293, + 1657, + 1401, + 1657, + 1401, + 1723, + 293, + 1723 + ], + "score": 0.722 + }, + { + "category_id": 1, + "poly": [ + 299, + 1543, + 1401, + 1543, + 1401, + 1639, + 299, + 1639 + ], + "score": 0.713 + }, + { + "category_id": 1, + "poly": [ + 296, + 824, + 1406, + 824, + 1406, + 918, + 296, + 918 + ], + "score": 0.71 + }, + { + "category_id": 1, + "poly": [ + 296, + 626, + 1406, + 626, + 1406, + 721, + 296, + 721 + ], + "score": 0.701 + }, + { + "category_id": 1, + "poly": [ + 298, + 1230, + 1403, + 1230, + 1403, + 1325, + 298, + 1325 + ], + "score": 0.685 + }, + { + "category_id": 1, + "poly": [ + 291, + 1742, + 1401, + 1742, + 1401, + 1807, + 291, + 1807 + ], + "score": 0.67 + }, + { + "category_id": 1, + "poly": [ + 302, + 229, + 1399, + 229, + 1399, + 324, + 302, + 324 + ], + "score": 0.62 + }, + { + "category_id": 1, + "poly": [ + 298, + 511, + 1402, + 511, + 1402, + 607, + 298, + 607 + ], + "score": 0.609 + }, + { + "category_id": 1, + "poly": [ + 295, + 427, + 1403, + 427, + 1403, + 492, + 295, + 492 + ], + "score": 0.604 + }, + { + "category_id": 1, + "poly": [ + 297, + 1826, + 1400, + 1826, + 1400, + 1920, + 297, + 1920 + ], + "score": 0.596 + }, + { + "category_id": 1, + "poly": [ + 294, + 343, + 1401, + 343, + 1401, + 408, + 294, + 408 + ], + "score": 0.552 + }, + { + "category_id": 1, + "poly": [ + 296, + 1427, + 1407, + 1427, + 1407, + 1524, + 296, + 1524 + ], + "score": 0.543 + }, + { + "category_id": 1, + "poly": [ + 299, + 1941, + 1404, + 1941, + 1404, + 2033, + 299, + 2033 + ], + "score": 0.542 + }, + { + "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, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 737.0, + 1404.0, + 737.0, + 1404.0, + 780.0, + 292.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 772.0, + 961.0, + 772.0, + 961.0, + 808.0, + 324.0, + 808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1344.0, + 1405.0, + 1344.0, + 1405.0, + 1380.0, + 296.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1375.0, + 1052.0, + 1375.0, + 1052.0, + 1410.0, + 324.0, + 1410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1054.0, + 1403.0, + 1054.0, + 1403.0, + 1090.0, + 296.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1087.0, + 1404.0, + 1087.0, + 1404.0, + 1121.0, + 324.0, + 1121.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1113.0, + 1407.0, + 1113.0, + 1407.0, + 1156.0, + 321.0, + 1156.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1142.0, + 1406.0, + 1142.0, + 1406.0, + 1188.0, + 319.0, + 1188.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1176.0, + 900.0, + 1176.0, + 900.0, + 1213.0, + 321.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 939.0, + 1400.0, + 939.0, + 1400.0, + 976.0, + 296.0, + 976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 970.0, + 1404.0, + 970.0, + 1404.0, + 1008.0, + 321.0, + 1008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 996.0, + 399.0, + 996.0, + 399.0, + 1037.0, + 320.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1658.0, + 1406.0, + 1658.0, + 1406.0, + 1694.0, + 298.0, + 1694.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1689.0, + 1231.0, + 1689.0, + 1231.0, + 1725.0, + 322.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1541.0, + 1405.0, + 1541.0, + 1405.0, + 1580.0, + 293.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1574.0, + 1403.0, + 1574.0, + 1403.0, + 1611.0, + 323.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1604.0, + 1052.0, + 1604.0, + 1052.0, + 1642.0, + 325.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 824.0, + 1404.0, + 824.0, + 1404.0, + 863.0, + 293.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 855.0, + 1403.0, + 855.0, + 1403.0, + 893.0, + 323.0, + 893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 889.0, + 726.0, + 889.0, + 726.0, + 921.0, + 319.0, + 921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 626.0, + 1403.0, + 626.0, + 1403.0, + 660.0, + 295.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 659.0, + 1404.0, + 659.0, + 1404.0, + 693.0, + 323.0, + 693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 689.0, + 707.0, + 689.0, + 707.0, + 721.0, + 320.0, + 721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1229.0, + 1407.0, + 1229.0, + 1407.0, + 1267.0, + 294.0, + 1267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1259.0, + 1408.0, + 1259.0, + 1408.0, + 1299.0, + 321.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1292.0, + 519.0, + 1292.0, + 519.0, + 1326.0, + 321.0, + 1326.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1741.0, + 1403.0, + 1741.0, + 1403.0, + 1780.0, + 294.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1772.0, + 1162.0, + 1772.0, + 1162.0, + 1808.0, + 323.0, + 1808.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 227.0, + 1404.0, + 227.0, + 1404.0, + 267.0, + 296.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 261.0, + 1403.0, + 261.0, + 1403.0, + 295.0, + 323.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 290.0, + 1051.0, + 290.0, + 1051.0, + 328.0, + 326.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 510.0, + 1406.0, + 510.0, + 1406.0, + 549.0, + 293.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 542.0, + 1404.0, + 542.0, + 1404.0, + 579.0, + 322.0, + 579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 574.0, + 726.0, + 574.0, + 726.0, + 608.0, + 326.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 426.0, + 1406.0, + 426.0, + 1406.0, + 466.0, + 294.0, + 466.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 458.0, + 1039.0, + 458.0, + 1039.0, + 493.0, + 324.0, + 493.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1827.0, + 1405.0, + 1827.0, + 1405.0, + 1861.0, + 295.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1855.0, + 1405.0, + 1855.0, + 1405.0, + 1895.0, + 321.0, + 1895.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1888.0, + 652.0, + 1888.0, + 652.0, + 1921.0, + 323.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 346.0, + 1404.0, + 346.0, + 1404.0, + 378.0, + 297.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 376.0, + 977.0, + 376.0, + 977.0, + 409.0, + 322.0, + 409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1430.0, + 1401.0, + 1430.0, + 1401.0, + 1464.0, + 296.0, + 1464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1461.0, + 1404.0, + 1461.0, + 1404.0, + 1495.0, + 324.0, + 1495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1490.0, + 897.0, + 1490.0, + 897.0, + 1523.0, + 322.0, + 1523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1940.0, + 1405.0, + 1940.0, + 1405.0, + 1977.0, + 294.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2007.0, + 321.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1996.0, + 399.0, + 1996.0, + 399.0, + 2037.0, + 319.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 299, + 1772, + 1402, + 1772, + 1402, + 1895, + 299, + 1895 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 300, + 1911, + 1403, + 1911, + 1403, + 2034, + 300, + 2034 + ], + "score": 0.963 + }, + { + "category_id": 2, + "poly": [ + 300, + 75, + 813, + 75, + 813, + 105, + 300, + 105 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 304, + 1546, + 1398, + 1546, + 1398, + 1640, + 304, + 1640 + ], + "score": 0.836 + }, + { + "category_id": 2, + "poly": [ + 837, + 2088, + 864, + 2088, + 864, + 2112, + 837, + 2112 + ], + "score": 0.835 + }, + { + "category_id": 1, + "poly": [ + 300, + 724, + 1401, + 724, + 1401, + 818, + 300, + 818 + ], + "score": 0.807 + }, + { + "category_id": 1, + "poly": [ + 296, + 1342, + 1397, + 1342, + 1397, + 1406, + 296, + 1406 + ], + "score": 0.781 + }, + { + "category_id": 1, + "poly": [ + 297, + 841, + 1406, + 841, + 1406, + 965, + 297, + 965 + ], + "score": 0.781 + }, + { + "category_id": 0, + "poly": [ + 303, + 1701, + 1254, + 1701, + 1254, + 1738, + 303, + 1738 + ], + "score": 0.768 + }, + { + "category_id": 1, + "poly": [ + 294, + 638, + 1399, + 638, + 1399, + 701, + 294, + 701 + ], + "score": 0.762 + }, + { + "category_id": 1, + "poly": [ + 297, + 990, + 1405, + 990, + 1405, + 1085, + 297, + 1085 + ], + "score": 0.72 + }, + { + "category_id": 1, + "poly": [ + 301, + 1223, + 1398, + 1223, + 1398, + 1319, + 301, + 1319 + ], + "score": 0.715 + }, + { + "category_id": 1, + "poly": [ + 299, + 1106, + 1401, + 1106, + 1401, + 1203, + 299, + 1203 + ], + "score": 0.715 + }, + { + "category_id": 1, + "poly": [ + 297, + 1428, + 1405, + 1428, + 1405, + 1523, + 297, + 1523 + ], + "score": 0.707 + }, + { + "category_id": 1, + "poly": [ + 297, + 550, + 1403, + 550, + 1403, + 615, + 297, + 615 + ], + "score": 0.685 + }, + { + "category_id": 1, + "poly": [ + 294, + 228, + 1402, + 228, + 1402, + 294, + 294, + 294 + ], + "score": 0.649 + }, + { + "category_id": 1, + "poly": [ + 299, + 315, + 1401, + 315, + 1401, + 409, + 299, + 409 + ], + "score": 0.646 + }, + { + "category_id": 1, + "poly": [ + 300, + 433, + 1402, + 433, + 1402, + 528, + 300, + 528 + ], + "score": 0.592 + }, + { + "category_id": 1, + "poly": [ + 303, + 1701, + 1254, + 1701, + 1254, + 1738, + 303, + 1738 + ], + "score": 0.122 + }, + { + "category_id": 13, + "poly": [ + 1149, + 1943, + 1231, + 1943, + 1231, + 1972, + 1149, + 1972 + ], + "score": 0.26, + "latex": "2 . 8 \\mathrm { \\ A P }" + }, + { + "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": [ + 833.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2124.0, + 833.0, + 2124.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1701.0, + 1260.0, + 1701.0, + 1260.0, + 1742.0, + 296.0, + 1742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1773.0, + 1404.0, + 1773.0, + 1404.0, + 1806.0, + 295.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1804.0, + 1404.0, + 1804.0, + 1404.0, + 1837.0, + 295.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1835.0, + 1403.0, + 1835.0, + 1403.0, + 1867.0, + 295.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1864.0, + 945.0, + 1864.0, + 945.0, + 1897.0, + 294.0, + 1897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1907.0, + 1405.0, + 1907.0, + 1405.0, + 1947.0, + 291.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 1148.0, + 1942.0, + 1148.0, + 1977.0, + 294.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1232.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1977.0, + 1232.0, + 1977.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2005.0, + 295.0, + 2005.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2003.0, + 958.0, + 2003.0, + 958.0, + 2035.0, + 296.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1542.0, + 1403.0, + 1542.0, + 1403.0, + 1583.0, + 298.0, + 1583.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1577.0, + 1404.0, + 1577.0, + 1404.0, + 1611.0, + 325.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1608.0, + 693.0, + 1608.0, + 693.0, + 1641.0, + 322.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 726.0, + 1405.0, + 726.0, + 1405.0, + 760.0, + 296.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 753.0, + 1406.0, + 753.0, + 1406.0, + 792.0, + 320.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 780.0, + 410.0, + 780.0, + 410.0, + 821.0, + 320.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1342.0, + 1402.0, + 1342.0, + 1402.0, + 1378.0, + 297.0, + 1378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1373.0, + 1402.0, + 1373.0, + 1402.0, + 1409.0, + 322.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 841.0, + 1406.0, + 841.0, + 1406.0, + 880.0, + 292.0, + 880.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 873.0, + 1403.0, + 873.0, + 1403.0, + 905.0, + 323.0, + 905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 904.0, + 1406.0, + 904.0, + 1406.0, + 940.0, + 321.0, + 940.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 931.0, + 409.0, + 931.0, + 409.0, + 969.0, + 320.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 639.0, + 1403.0, + 639.0, + 1403.0, + 675.0, + 295.0, + 675.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 670.0, + 1194.0, + 670.0, + 1194.0, + 701.0, + 322.0, + 701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 990.0, + 1405.0, + 990.0, + 1405.0, + 1028.0, + 294.0, + 1028.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1022.0, + 1406.0, + 1022.0, + 1406.0, + 1056.0, + 323.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1050.0, + 1348.0, + 1050.0, + 1348.0, + 1089.0, + 320.0, + 1089.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1220.0, + 1404.0, + 1220.0, + 1404.0, + 1265.0, + 293.0, + 1265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1256.0, + 1404.0, + 1256.0, + 1404.0, + 1291.0, + 321.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1283.0, + 1149.0, + 1283.0, + 1149.0, + 1322.0, + 321.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1106.0, + 1405.0, + 1106.0, + 1405.0, + 1145.0, + 294.0, + 1145.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1136.0, + 1406.0, + 1136.0, + 1406.0, + 1175.0, + 320.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1168.0, + 1072.0, + 1168.0, + 1072.0, + 1206.0, + 323.0, + 1206.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1424.0, + 1406.0, + 1424.0, + 1406.0, + 1469.0, + 291.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1458.0, + 1405.0, + 1458.0, + 1405.0, + 1496.0, + 323.0, + 1496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1491.0, + 904.0, + 1491.0, + 904.0, + 1525.0, + 326.0, + 1525.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 548.0, + 1408.0, + 548.0, + 1408.0, + 590.0, + 292.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 581.0, + 1051.0, + 581.0, + 1051.0, + 616.0, + 322.0, + 616.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 226.0, + 1405.0, + 226.0, + 1405.0, + 269.0, + 293.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 260.0, + 1203.0, + 260.0, + 1203.0, + 296.0, + 322.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 313.0, + 1405.0, + 313.0, + 1405.0, + 354.0, + 292.0, + 354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 345.0, + 1405.0, + 345.0, + 1405.0, + 381.0, + 320.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 374.0, + 399.0, + 374.0, + 399.0, + 412.0, + 319.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 434.0, + 1404.0, + 434.0, + 1404.0, + 468.0, + 295.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 466.0, + 1404.0, + 466.0, + 1404.0, + 500.0, + 324.0, + 500.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 496.0, + 1084.0, + 496.0, + 1084.0, + 530.0, + 324.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1701.0, + 1260.0, + 1701.0, + 1260.0, + 1742.0, + 296.0, + 1742.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 294, + 1267, + 1428, + 1267, + 1428, + 1767, + 294, + 1767 + ], + "score": 0.985, + "html": "
ModelBackboneAPAP50AP75APsAPMAPLFPS Params
Faster RCNN Our Faster RCNNResNet18 ResNet1834.6 37.055.0 57.237.1 39.719.3 19.936.9 39.745.9 50.328.1 28.130.57 30.57
Grid RCNNResNet1836.654.239.720.139.848.226.766.37
Our Grid RCNN RetinaNetResNet18 ResNet1838.8 33.456.7 51.841.5 35.121.1 16.941.6 35.652.7 44.926.7 25.866.37 23.30
Our RetinaNet RetinaNetResNet18 RegNet-800M35.9 35.654.4 54.738.0 37.717.9 19.739.1 39.049.4 47.825.8 22.423.30 19.27
Our RetinaNet Yolo v3RegNet-800M DarkNet5338.4 33.457.4 56.340.7 35.221.4 19.542.0 36.452.3 43.622.4 42.219.27 61.95
Our Yolo v3DarkNet5335.858.238.121.239.045.642.261.95
SSD Our SSDVGG16 VGG1629.4 31.249.3 52.131.0 32.811.7 12.634.1 37.444.9 46.226.1 26.138.08 38.08
" + }, + { + "category_id": 1, + "poly": [ + 297, + 653, + 1405, + 653, + 1405, + 880, + 297, + 880 + ], + "score": 0.981 + }, + { + "category_id": 5, + "poly": [ + 534, + 293, + 1166, + 293, + 1166, + 512, + 534, + 512 + ], + "score": 0.981, + "html": "
Attention TypeSpatial Channel× ×√ ×X √√ √
ResultAP38.441.040.741.2
APs21.522.722.923.0
APM42.144.744.144.6
APL50.354.254.155.3
" + }, + { + "category_id": 1, + "poly": [ + 298, + 1000, + 1404, + 1000, + 1404, + 1156, + 298, + 1156 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 300, + 1942, + 1405, + 1942, + 1405, + 2034, + 300, + 2034 + ], + "score": 0.975 + }, + { + "category_id": 6, + "poly": [ + 461, + 249, + 1237, + 249, + 1237, + 283, + 461, + 283 + ], + "score": 0.919 + }, + { + "category_id": 0, + "poly": [ + 301, + 1868, + 802, + 1868, + 802, + 1905, + 301, + 1905 + ], + "score": 0.911 + }, + { + "category_id": 0, + "poly": [ + 298, + 928, + 948, + 928, + 948, + 964, + 298, + 964 + ], + "score": 0.91 + }, + { + "category_id": 6, + "poly": [ + 403, + 1212, + 1290, + 1212, + 1290, + 1246, + 403, + 1246 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 105, + 299, + 105 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.85 + }, + { + "category_id": 0, + "poly": [ + 296, + 582, + 1116, + 582, + 1116, + 619, + 296, + 619 + ], + "score": 0.834 + }, + { + "category_id": 13, + "poly": [ + 565, + 782, + 628, + 782, + 628, + 814, + 565, + 814 + ], + "score": 0.93, + "latex": "\\mathcal { L } _ { A M }" + }, + { + "category_id": 13, + "poly": [ + 1079, + 777, + 1170, + 777, + 1170, + 817, + 1079, + 817 + ], + "score": 0.92, + "latex": "\\mathcal { L } _ { A T } ^ { s p a t i a l }" + }, + { + "category_id": 13, + "poly": [ + 411, + 814, + 513, + 814, + 513, + 851, + 411, + 851 + ], + "score": 0.88, + "latex": "\\mathcal { L } _ { A T } ^ { c h a n n e l }" + }, + { + "category_id": 13, + "poly": [ + 677, + 782, + 753, + 782, + 753, + 814, + 677, + 814 + ], + "score": 0.86, + "latex": "\\mathcal { L } _ { N L D }" + }, + { + "category_id": 13, + "poly": [ + 763, + 782, + 809, + 782, + 809, + 813, + 763, + 813 + ], + "score": 0.38, + "latex": "3 { \\tt X } 3" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 248.0, + 1238.0, + 248.0, + 1238.0, + 284.0, + 460.0, + 284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1865.0, + 807.0, + 1865.0, + 807.0, + 1911.0, + 293.0, + 1911.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 924.0, + 950.0, + 924.0, + 950.0, + 969.0, + 294.0, + 969.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1210.0, + 1295.0, + 1210.0, + 1295.0, + 1250.0, + 404.0, + 1250.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": [ + 832.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 578.0, + 1120.0, + 578.0, + 1120.0, + 624.0, + 292.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 653.0, + 1406.0, + 653.0, + 1406.0, + 690.0, + 294.0, + 690.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 683.0, + 1403.0, + 683.0, + 1403.0, + 723.0, + 294.0, + 723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 715.0, + 1406.0, + 715.0, + 1406.0, + 752.0, + 292.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 746.0, + 1405.0, + 746.0, + 1405.0, + 782.0, + 295.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 763.0, + 564.0, + 763.0, + 564.0, + 835.0, + 283.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 763.0, + 676.0, + 763.0, + 676.0, + 835.0, + 629.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 763.0, + 762.0, + 763.0, + 762.0, + 835.0, + 754.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 810.0, + 763.0, + 1078.0, + 763.0, + 1078.0, + 835.0, + 810.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 763.0, + 1406.0, + 763.0, + 1406.0, + 835.0, + 1171.0, + 835.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 282.0, + 798.0, + 410.0, + 798.0, + 410.0, + 881.0, + 282.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 514.0, + 798.0, + 1415.0, + 798.0, + 1415.0, + 881.0, + 514.0, + 881.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1002.0, + 1401.0, + 1002.0, + 1401.0, + 1035.0, + 296.0, + 1035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1026.0, + 1404.0, + 1026.0, + 1404.0, + 1069.0, + 293.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1061.0, + 1405.0, + 1061.0, + 1405.0, + 1097.0, + 296.0, + 1097.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1091.0, + 1406.0, + 1091.0, + 1406.0, + 1127.0, + 293.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1123.0, + 547.0, + 1123.0, + 547.0, + 1161.0, + 293.0, + 1161.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1942.0, + 1405.0, + 1942.0, + 1405.0, + 1976.0, + 296.0, + 1976.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1972.0, + 1404.0, + 1972.0, + 1404.0, + 2006.0, + 295.0, + 2006.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 2001.0, + 899.0, + 2001.0, + 899.0, + 2038.0, + 295.0, + 2038.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 616, + 1405, + 616, + 1405, + 923, + 297, + 923 + ], + "score": 0.984 + }, + { + "category_id": 5, + "poly": [ + 550, + 283, + 1147, + 283, + 1147, + 482, + 550, + 482 + ], + "score": 0.982, + "html": "
ModelBackboneBox APMask AP
Faster RCNNResNet5040.3N/A
Our Faster RCNNResNet5043.5N/A
Mask RCNNResNet5041.035.8
Our Mask RCNNResNet5043.037.5
" + }, + { + "category_id": 5, + "poly": [ + 296, + 1032, + 1403, + 1032, + 1403, + 1251, + 296, + 1251 + ], + "score": 0.98, + "html": "
MethodFeature Classfy Regress Relation|One-Stage Two-Stage Anchor-based Anchor-free Segment.
Our Method×√√√√
Chen et al.××√广××
Li et al.××××√1××
Wang et al.>>>>××××√√××
Bajestani & Yang√×××√√√××
" + }, + { + "category_id": 1, + "poly": [ + 297, + 1295, + 1403, + 1295, + 1403, + 1451, + 297, + 1451 + ], + "score": 0.973 + }, + { + "category_id": 0, + "poly": [ + 297, + 546, + 887, + 546, + 887, + 583, + 297, + 583 + ], + "score": 0.921 + }, + { + "category_id": 6, + "poly": [ + 549, + 249, + 1150, + 249, + 1150, + 281, + 549, + 281 + ], + "score": 0.917 + }, + { + "category_id": 6, + "poly": [ + 539, + 989, + 1157, + 989, + 1157, + 1023, + 539, + 1023 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 813, + 75, + 813, + 105, + 299, + 105 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2112, + 836, + 2112 + ], + "score": 0.845 + }, + { + "category_id": 15, + "poly": [ + 293.0, + 544.0, + 891.0, + 544.0, + 891.0, + 587.0, + 293.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 546.0, + 244.0, + 1152.0, + 244.0, + 1152.0, + 288.0, + 546.0, + 288.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 986.0, + 1159.0, + 986.0, + 1159.0, + 1027.0, + 538.0, + 1027.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": [ + 832.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2122.0, + 832.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 618.0, + 1402.0, + 618.0, + 1402.0, + 650.0, + 297.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 646.0, + 1402.0, + 646.0, + 1402.0, + 683.0, + 295.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 678.0, + 1405.0, + 678.0, + 1405.0, + 714.0, + 295.0, + 714.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 708.0, + 1406.0, + 708.0, + 1406.0, + 744.0, + 294.0, + 744.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 739.0, + 1407.0, + 739.0, + 1407.0, + 773.0, + 292.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 768.0, + 1407.0, + 768.0, + 1407.0, + 804.0, + 292.0, + 804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 799.0, + 1406.0, + 799.0, + 1406.0, + 836.0, + 294.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 832.0, + 1403.0, + 832.0, + 1403.0, + 864.0, + 295.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 860.0, + 1405.0, + 860.0, + 1405.0, + 897.0, + 294.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 892.0, + 1142.0, + 892.0, + 1142.0, + 926.0, + 294.0, + 926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1297.0, + 1404.0, + 1297.0, + 1404.0, + 1330.0, + 297.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1326.0, + 1403.0, + 1326.0, + 1403.0, + 1362.0, + 293.0, + 1362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1353.0, + 1405.0, + 1353.0, + 1405.0, + 1397.0, + 291.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1385.0, + 1405.0, + 1385.0, + 1405.0, + 1424.0, + 294.0, + 1424.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1420.0, + 876.0, + 1420.0, + 876.0, + 1453.0, + 295.0, + 1453.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/uXc42E9ZPFs/uXc42E9ZPFs_layout.pdf b/parse/train/uXc42E9ZPFs/uXc42E9ZPFs_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..791474a5f627261e26c1736b4bd1bd7e492e3cd6 --- /dev/null +++ b/parse/train/uXc42E9ZPFs/uXc42E9ZPFs_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:716a82b4d3ec7a950463f64bf2963e70d4434160fa3859b7592c46008ded35c9 +size 3937061 diff --git a/parse/train/uXc42E9ZPFs/uXc42E9ZPFs_origin.pdf b/parse/train/uXc42E9ZPFs/uXc42E9ZPFs_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..39e86fc0a2656a27bbc6dce74b59ec7675025d1d --- /dev/null +++ b/parse/train/uXc42E9ZPFs/uXc42E9ZPFs_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0a2fc447963adf027e9a3568e6e125a047fb45de8e309444cf07758a7b58d1bb +size 3769516 diff --git a/parse/train/uXc42E9ZPFs/uXc42E9ZPFs_span.pdf b/parse/train/uXc42E9ZPFs/uXc42E9ZPFs_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..869743a6c7ceabb2864d09558f17dd3e10885d3e --- /dev/null +++ b/parse/train/uXc42E9ZPFs/uXc42E9ZPFs_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:35e42230d0e0cf066dea3d318a73815425f3282761798fc0ebdd59dd7981bdef +size 3938153 diff --git a/parse/train/ujmgfuxSLrO/ujmgfuxSLrO_layout.pdf b/parse/train/ujmgfuxSLrO/ujmgfuxSLrO_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..516dd0093b5d439620076c88e3afbbcf87a42b0b --- /dev/null +++ b/parse/train/ujmgfuxSLrO/ujmgfuxSLrO_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:574d2051954ec29b0d766aefddd783091bca989e5f5138230913169a3aff3100 +size 1154184 diff --git a/parse/train/ujmgfuxSLrO/ujmgfuxSLrO_origin.pdf b/parse/train/ujmgfuxSLrO/ujmgfuxSLrO_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..848f51ab0cec194f434b0a8c427cc7c510e583f0 --- /dev/null +++ b/parse/train/ujmgfuxSLrO/ujmgfuxSLrO_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3527d4dedf78eff85fcc6ed68ab9eb7e891ac06842005077f5371dfa60f82240 +size 824396 diff --git a/parse/train/ujmgfuxSLrO/ujmgfuxSLrO_span.pdf b/parse/train/ujmgfuxSLrO/ujmgfuxSLrO_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..d2ba138a7cc12131f7d80d76af2633c69b9ea7c7 --- /dev/null +++ b/parse/train/ujmgfuxSLrO/ujmgfuxSLrO_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:ab5223700ece32d4809cec366c8c9e691eab7b2267b1f71e95f10ff1e6ce4228 +size 1164630 diff --git a/parse/train/v2tmeZVV9-c/v2tmeZVV9-c_layout.pdf b/parse/train/v2tmeZVV9-c/v2tmeZVV9-c_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..943a991f9b2c6b26eb1f0ba8aeafeb04cfd17f4c --- /dev/null +++ b/parse/train/v2tmeZVV9-c/v2tmeZVV9-c_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3eb10b6511f04e514a7f4d09e6d1a61b17a2e60063d5ac35b8c6bb6465bd197e +size 2189501 diff --git a/parse/train/v2tmeZVV9-c/v2tmeZVV9-c_origin.pdf b/parse/train/v2tmeZVV9-c/v2tmeZVV9-c_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..dcd8e3b24f849c9aa16eed78de57a3bb3c8c6b90 --- /dev/null +++ b/parse/train/v2tmeZVV9-c/v2tmeZVV9-c_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:a13b6ea7945dbb4f59a90ad228bd7330b5d099c4bd2530629021b243b7717fb4 +size 2023490 diff --git a/parse/train/v2tmeZVV9-c/v2tmeZVV9-c_span.pdf b/parse/train/v2tmeZVV9-c/v2tmeZVV9-c_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..76c2181a608065908eee617e87d872ff45810b17 --- /dev/null +++ b/parse/train/v2tmeZVV9-c/v2tmeZVV9-c_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:8db889968ba95c743d7c7d94aa064e297e64b7414cf32542531e8259baf681b7 +size 2199986 diff --git a/parse/train/wHoIjrT6MMb/wHoIjrT6MMb_layout.pdf b/parse/train/wHoIjrT6MMb/wHoIjrT6MMb_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..fcd03dd7dfbf76f2eeeeffafed2cff534676a2a2 --- /dev/null +++ b/parse/train/wHoIjrT6MMb/wHoIjrT6MMb_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:b5387ad8789f548fcd899d5f7fe61b953479fbaf6bc1485a5ddd343044fbd21a +size 4408345 diff --git a/parse/train/wHoIjrT6MMb/wHoIjrT6MMb_origin.pdf b/parse/train/wHoIjrT6MMb/wHoIjrT6MMb_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e231bea0e40e7e720c4d4149bc434de570da0af1 --- /dev/null +++ b/parse/train/wHoIjrT6MMb/wHoIjrT6MMb_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5304da27abb41b31803d7d454808a04322c04685e4d10a46f3f7f91a1f9232e1 +size 4201113 diff --git a/parse/train/wHoIjrT6MMb/wHoIjrT6MMb_span.pdf b/parse/train/wHoIjrT6MMb/wHoIjrT6MMb_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..46c0669b6ca37db9d22721902b36015e7a53a3fc --- /dev/null +++ b/parse/train/wHoIjrT6MMb/wHoIjrT6MMb_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:477264985c0d8260d5d55b9b81f1ef51c9a58414ae92854853bc4843411f1aed +size 4422994 diff --git a/parse/train/wtLW-Amuds/wtLW-Amuds_layout.pdf b/parse/train/wtLW-Amuds/wtLW-Amuds_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..dd927541ede48850f0be2edd60126ab30d028fdb --- /dev/null +++ b/parse/train/wtLW-Amuds/wtLW-Amuds_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:3acc10076134a4f2b461928e7d771b0dcbb3df86f54553a97385c78a80d93126 +size 4122581 diff --git a/parse/train/wtLW-Amuds/wtLW-Amuds_origin.pdf b/parse/train/wtLW-Amuds/wtLW-Amuds_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..e56875823d8cf5308b2de5b03c198ad60fb8098d --- /dev/null +++ b/parse/train/wtLW-Amuds/wtLW-Amuds_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:c06e708e9746a32d91d0810bf75524eebb7eb076c57f53174b802f8eb4e83c95 +size 3962830 diff --git a/parse/train/wtLW-Amuds/wtLW-Amuds_span.pdf b/parse/train/wtLW-Amuds/wtLW-Amuds_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..4c02764133cc95631b1689c535ab108fb49ec46f --- /dev/null +++ b/parse/train/wtLW-Amuds/wtLW-Amuds_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:5a8b9a9be8cef33d0f12b170698b13c14d478ffadb4e3a439afbad009ef8f09e +size 4133044 diff --git a/parse/train/yxafu6ZtUux/yxafu6ZtUux.md b/parse/train/yxafu6ZtUux/yxafu6ZtUux.md new file mode 100644 index 0000000000000000000000000000000000000000..59dbb0a870404786c09ab0b6a88312b25b864f95 --- /dev/null +++ b/parse/train/yxafu6ZtUux/yxafu6ZtUux.md @@ -0,0 +1,1443 @@ +# AN ONLINE SEQUENTIAL TEST FOR QUALITATIVETREATMENT EFFECTS + +Anonymous authors Paper under double-blind review + +# ABSTRACT + +Tech companies (e.g., Google or Facebook) often use randomized online experiments and/or A/B testing primarily based on the average treatment effects to compare their new product with an old one. However, it is also critically important to detect qualitative treatment effects such that the new one may significantly outperform the existing one only under some specific circumstances. The aim of this paper is to develop a powerful testing procedure to efficiently detect such qualitative treatment effects. We propose a scalable online updating algorithm to implement our test procedure. It has three novelties including adaptive randomization, sequential monitoring, and online updating with guaranteed type-I error control. We also thoroughly examine the theoretical properties of our testing procedure including the limiting distribution of test statistics and the justification of an efficient bootstrap method. Extensive empirical studies are conducted to examine the finite sample performance of our test procedure. + +# 1 INTRODUCTION + +Tech companies use randomized online experiments, or A/B testing to compare their new product with a well-established one. Most works in the literature focus on the average treatment effects (ATE) between the new and existing products (see Kharitonov et al., 2015; Johari et al., 2015; 2017; Yang et al., 2017; Ju et al., 2019, and the references therein). In addition to ATE, sometimes we are interested in locating the subgroup (if exists) that the new product performs significantly better than the existing one, as early as possible. Consider a ride-hailing company (e.g., Uber). Suppose some passengers are in the recession state (at a high risk of stopping using the companys app) and the company comes up with certain strategy to intervene the recession process. We would like to if there are some subgroups that are sensitive to the strategy and pin-point these subgroups if exists. It motivates us to consider the null hypothesis that the treatment effect is nonpositive for all passenger. + +Such a null hypothesis is closely related to the notion of qualitative treatment effects in medical studies (QTE, Gail & Simon, 1985; Roth & Simon, 2018; Shi et al., 2020a), and conditional moment inequalities in economics (see for example, Andrews & Shi, 2013; 2014; Chernozhukov et al., 2013; Armstrong & Chan, 2016; Chang et al., 2015; Hsu, 2017). However, these tests are computed offline and might not be suitable to implement in online settings. Moreover, it is assumed in those papers that observations are independent. In online experiment, one may wish to adaptively allocate the treatment based on the observed data stream in order to maximize the cumulative reward or to detect the alternative more efficiently. The independence assumption is thus violated. In addition, an online experiment is desired to be terminated as early as possible in order to save time and budget. Sequential testing for qualitative treatment effects has been less explored. + +In the literature, there is a line of research on estimation and inference of the heterogeneous treatment effects (HTE) (Athey & Imbens, 2016; Taddy et al., 2016; Wager & Athey, 2018; Yu et al., 2020). In particular, Yu et al. (2020) proposed an online test for HTE. We remark that HTE and QTE are related yet fundamentally different hypotheses. There are cases where HTE exists whereas QTE does not. See Figure 1 for an illustration. Consequently, applying their test will fail in our setting. + +The contributions of this paper are summarized as follows. First, we propose a new testing procedure for treatment comparison based on the notion of QTE. When the null hypothesis is not rejected, the new product is no better than the control for any realization of covariates, and thus it is not useful at all. Otherwise, the company could implement different products according to the auxiliary covariates observed, to maximize the average reward obtained. We remark that there are plenty cases where the treatment effects are always nonpositive (see Section 5 of Chang et al., 2015; Shi et al., 2020a). A by-product of our test is that it yields a decision rule to implement personalization when the null is rejected (see Section 3.1 for details). Although we primarily focus on QTE in this paper, our procedure can be easily extended to testing ATE as well (see Appendix D for details). + +![](images/bdfa07c6e548c34b414e3b216be9e7ed4ed71107e91e13b03ab1e2e9975a4e3b.jpg) +Figure 1: Plots demonstrating QTE. $X$ denotes the observed covariates, $A$ denotes the received treatment and $Y$ denotes the associated reward. In the ride-hailing example, $X$ is a feature vector describing the characteristics of a passenger, $A$ is a binary strategy indicator and $Y$ is the passenger’s number of rides in the following two weeks. In the left panel, the treatment effect does not depend on $X$ . Neither HTE nor QTE exists in this case. In the middle panel, HTE exists. However, the treatment effect is always negative. As such, QTE does not exist. In the right penal, both QTE and HTE exist. + +Second, we propose a scalable online updating algorithm to implement our test. To allow for sequential monitoring, our procedure leverages idea from the $\alpha$ spending function approach (Lan & DeMets, 1983) originally designed for sequential analysis in a clinical trial (see Jennison & Turnbull, 1999, for an overview). Classical sequential tests focus on ATE. The test statistic at each interim stage is asymptotically normal and the stopping boundary can be recursively updated via numerical integration. However, the limiting distribution of the proposed test statistic does not have a tractable analytical form, making the numerical integration method difficult to apply. To resolve this issue, we propose a scalable bootstrap-assisted procedure to determine the stopping boundary. + +Third, we adopt a theoretical framework that allows the maximum number of interim analyses $K$ to diverge as the number of observations increases, since tech companies might analyze the results every few minutes (or hours) to determine whether to stop the experiment or continue collecting more data. It is ultimately different from classical sequential analysis where $K$ is fixed. Moreover, the derivation of the asymptotic property of the proposed test is further complicated due to the adaptive randomization procedure, which makes observations dependent of each other. Despite these technical challenges, we establish a nonasymptotic upper bound on the type-I error rate by explicitly characterizing the conditions needed on randomization procedure, $K$ and the number of samples observed at the initial decision point to ensure the validity of our test. + +# 2 BACKGROUND AND PROBLEM FORMULATION + +We propose a potential outcome framework (Rubin, 2005) to formulate our problem. Suppose that we have two products including the control and the treatment. The observed data at time point $t$ consists of a sequence of triples $\{ ( X _ { i } , A _ { i } , Y _ { i } ) \} _ { i = 1 } ^ { N ( t ) }$ , where $N ( \cdot )$ is a counting process that is independent of the data stream $\{ ( X _ { i } , A _ { i } , Y _ { i } ) \} _ { i = 1 } ^ { + \infty }$ , $A _ { i }$ is a binary random variable indicating the product executed for the $i$ -th experiment, $X _ { i } \in \mathbb { R } ^ { p }$ denotes the associated covariates, and $Y _ { i }$ stands for the associated reward (the larger the better by convention). We allow $A _ { i }$ to depend on $X _ { i }$ and past observations $\{ ( X _ { j } , A _ { j } , Y _ { j } ) \} _ { j < i }$ so that the randomization procedure can be adaptively changed. In corresponding product is executed for the are independently and identically distribut addition, define $Y _ { i } ^ { * } ( 0 )$ and $Y _ { i } ^ { * } ( 1 )$ to be the potential outcome that would have been observed if the $i$ -th experimd copies of $\{ ( X _ { i } , Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 ) ) \} _ { i = 1 } ^ { + \infty }$ $( X , Y ^ { * } \bar { ( 0 ) } , Y ^ { * } ( 1 ) )$ $\mathbb { X }$ $X$ and $\bar { Q } _ { 0 } ( x , a ) \stackrel { \cdot } { = } \mathrm { E } \{ Y ^ { * } ( a ) | X \stackrel { \cdot } { = } x \}$ for $a = 0 , 1$ , we focus on testing the following hypotheses: + +$$ +H _ { 0 } : Q _ { 0 } ( x , 1 ) \leq Q _ { 0 } ( x , 0 ) , \forall x \in \mathbb { X } { \mathrm { ~ ~ v e r s u s ~ } } H _ { 1 } : Q _ { 0 } ( x , 1 ) > Q _ { 0 } ( x , 0 ) , \exists x \in \mathbb { X } . +$$ + +Notice that when there are no covariates, i.e., $\mathbb { X } = \emptyset$ , the hypotheses are reduced to $H _ { 0 } : \tau _ { 0 } \leq 0$ versus $H _ { 1 } : \tau _ { 0 } > 0$ , where $\tau _ { 0 }$ corresponds to ATE, i.e, $\tau _ { 0 } \stackrel { } { = } \mathrm { E } \{ Y ^ { \ast } ( 1 ) - Y ^ { \ast } ( 0 ) \}$ . In general, we require $\mathbb { X }$ to be a compact set. We consider a large linear approximation space $\mathcal { Q }$ for the conditional mean function $Q _ { 0 }$ . Specifically, let $\mathcal { Q } = \{ Q \in \langle x , a ; \beta _ { 0 } , \hat { \beta _ { 1 } } \rangle = \varphi ^ { \top } ( x ) \hat { \beta _ { a } } : \beta _ { 0 } , \beta _ { 1 } \in \mathbb { R } ^ { q } \}$ be the approximation space, where $\varphi ( x )$ is a $q$ -dimensional vector composed of basis functions on $\mathbb { X }$ . The dimension $q$ is allowed to diverge with the number of observations in order to alleviate the effects of model misspecification. The use of linear approximation space simplifies the computation of our testing procedure. When $Q _ { 0 }$ is well approximated, it suffices to test + +$$ +H _ { 0 } : \varphi ^ { \top } ( x ) ( \beta _ { 1 } ^ { * } - \beta _ { 0 } ^ { * } ) \leq 0 , \forall x \in \mathbb { X } \mathrm { ~ \mathrm { ~ v e r s u s ~ } ~ } H _ { 1 } : \varphi ^ { \top } ( x ) ( \beta _ { 1 } ^ { * } - \beta _ { 0 } ^ { * } ) > 0 , \exists x \in \mathbb { X } . +$$ + +For clarity, here we assume $Q _ { 0 } ( x , a ) = Q ( x , a ; \beta _ { 0 } ^ { * } , \beta _ { 1 } ^ { * } )$ for some $\beta _ { 0 } ^ { * }$ and $\beta _ { 1 } ^ { * }$ . In Appendix B, we allow the approximation error $\begin{array} { r } { \operatorname* { i n f } _ { \beta _ { 0 } , \beta _ { 1 } \in \mathbb { R } ^ { p } } \operatorname* { s u p } _ { x \in \mathbb { X } , a \in \{ 0 , 1 \} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \beta _ { 0 } , \beta _ { 1 } ) | } \end{array}$ to be nonzero. + +Let ${ \mathcal { F } } _ { j }$ denote the sub-dataset $\{ ( X _ { i } , A _ { i } , Y _ { i } ) \} _ { 1 \leq i \leq j }$ for $j \geq 1$ and $\mathcal { F } _ { 0 } = \emptyset$ . Throughout this paper, we assume that the following two assumptions hold. + +(A1) $Y _ { i } = A _ { i } Y _ { i } ^ { * } ( 1 ) + ( 1 - A _ { i } ) Y _ { i } ^ { * } ( 0 )$ for $\forall i \geq 1$ . (A2) $A _ { i }$ is independent of $Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 )$ , $\{ ( X _ { k } , Y _ { k } ^ { * } ( 0 ) , Y _ { k } ^ { * } ( 1 ) ) \} _ { k > i }$ given $X _ { i }$ and $\mathcal { F } _ { i - 1 }$ , for any $i$ + +Assumption (A1) is referred to be the stable unit treatment value assumption (Rubin, 1974) and Assumption (A2) is the sequential randomization assumption (Zhang et al., 2013) and is automatically satisfied in a randomized study where the treatments are independently generated of the observed data. (A2) essentially assumes there is no unmeasured confounders. These assumptions guarantee that both regression coefficients (defined through potential outcomes) are estimable from the observed dataset as shown in the following lemma. + +Lemma 1 Let $\mathbb { I } ( \cdot )$ denotes the indicator function. Under (A1)-(A2), we have + +$$ +E [ \mathbb { I } ( A _ { i } = a ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } ^ { * } \} ] = 0 , \forall a \in \{ 0 , 1 \} , i \geq 1 . +$$ + +3 ONLINE SEQUENTIAL TESTING FOR QTE + +# 3.1 TEST STATISTICS AND THEIR LIMITING DISTRIBUTION + +We first present our test statistic for testing $H _ { 0 }$ . In view of Lemma 1, we estimate $\beta _ { a }$ by using the ordinary least squares estimator + +$$ +\widehat { \beta } _ { a } ( t ) = { \widehat \Sigma } _ { a } ^ { - 1 } ( t ) \left\{ \frac { 1 } { N ( t ) } \sum _ { i = 1 } ^ { N ( t ) } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) Y _ { i } \right\} +$$ + +at each time point $t$ for $a \in \{ 0 , 1 \}$ , where $\begin{array} { r } { \widehat { \Sigma } _ { a } ( t ) = N ^ { - 1 } ( t ) \sum _ { i = 1 } ^ { N ( t ) } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) } \end{array}$ . A generalized inverse might be used even if $\widehat { \Sigma } _ { a } ( t )$ is not invertible. Consider the following test statistic $\begin{array} { r } { S ( t ) = \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) \{ \widehat \beta _ { 1 } ( t ) - \widehat \beta _ { 0 } ( t ) \} } \end{array}$ . Under $H _ { 0 }$ , we expect $S ( t )$ to be small. A large $S ( t )$ can be interpreted as the evidence against $H _ { 0 }$ . As such, we reject $H _ { 0 }$ for large $S ( t )$ . We remark that when $H _ { 0 }$ is rejected, we can apply the decision rule $d ( x ) = \arg \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \varphi ^ { \top } ( x ) \widehat { \beta } _ { a } ( t )$ for personalized recommendation. + +To determine the rejection region, we next discuss the limiting distribution of $S ( t )$ . Under $H _ { 0 }$ , + +$$ +\begin{array} { r } { S ( t ) \le \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) \{ \widehat { \beta } _ { 1 } ( t ) - \beta _ { 1 } ^ { * } - \widehat { \beta } _ { 0 } ( t ) + \beta _ { 0 } ^ { * } \} + \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) ( \beta _ { 1 } ^ { * } - \beta _ { 0 } ^ { * } ) } \\ { \le \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) \{ \widehat { \beta } _ { 1 } ( t ) - \beta _ { 1 } ^ { * } - \widehat { \beta } _ { 0 } ( t ) + \beta _ { 0 } ^ { * } \} . } \end{array} +$$ + +Both equalities hold when $\beta _ { 0 } ^ { * } ~ = ~ \beta _ { 1 } ^ { * }$ . Suppose there exists some function $\pi ^ { * } ( \cdot , \cdot )$ defined on $\{ 0 , 1 \} \times \mathbb { X }$ that satisfies $\begin{array} { r } { { \mathrm { E } } ^ { X } | \sum _ { i = 1 } ^ { n } n ^ { - 1 } \pi _ { i - 1 } ( a , X ) - \pi ^ { * } ( a , X ) | \ \stackrel { P } { \to } \ 0 , \forall a \ \in \ \{ 0 , 1 \} } \end{array}$ as $n \infty$ , where $\pi _ { n } ( \cdot , \cdot ) = \operatorname* { P r } ( A _ { n } = a | X _ { n } = x , { \mathcal { F } } _ { n - 1 } )$ , and the expectation $\operatorname { E } ^ { X }$ is taken with respect to $X$ . This condition implies that the treatment assignment mechanism cannot be arbitrary (see the discussion below Theorem 1 for details). Then we will show + +$$ +B ( t ) \equiv \sqrt { N ( t ) } \{ \widehat { \beta } _ { 1 } ( t ) - \beta _ { 1 } ^ { * } - \widehat { \beta } _ { 0 } ( t ) + \beta _ { 0 } ^ { * } \} \stackrel { d } { } N ( 0 , \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \Phi _ { a } \Sigma _ { a } ^ { - 1 } ) , \mathrm { a s } N ( t ) \infty , +$$ + +where $\Sigma _ { a } = \mathrm { E } \pi ^ { * } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X )$ , $\Phi _ { a } = \mathrm { E } \pi ^ { * } ( a , X ) \sigma ^ { 2 } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X )$ , and $\sigma ^ { 2 } ( a , x ) =$ $\operatorname { E } [ \{ Y ^ { * } ( a ) - \varphi ^ { \top } ( X ) \beta _ { a } \} ^ { 2 } | X = x ]$ , for any $x \in \mathbb { X }$ . According to equation 3, the right-hand-side (RHS) of equation 2 is to converge in distribution to the maximum of some Gaussian random variables. This observation forms the basis of our test. + +We next discuss the sequential implementation of our test. Assume that the interim analyses are conducted at time points $t _ { 1 } , t _ { 2 } , \ldots , t _ { K } \in [ 0 , \ldots , T ]$ such that $0 < t _ { 1 } < t _ { 2 } < \cdots < t _ { K } = T$ . We allow $K$ to grow with the number of observations. In the most extreme case, one may set $t _ { k } = \operatorname* { i n f } _ { t } \{ N ( t ) \geq N ( t _ { k - 1 } ) + 1 \} , \forall k \geq 2$ . That is, we make a decision regarding the null hypothesis upon the arrival of each observation. In addition, we assume that $t _ { 1 }$ is large so that there are enough number of samples $N ( t _ { 1 } )$ to guarantee the validity of the normal approximation for $B ( t _ { 1 } )$ . We remark that in typical tech companies such as Amazon, Facebook, etc., massive data are collected even within a short time interval. Large sample approximation is validated in these applications. + +To guarantee our test controls the type-I error, we reject $H _ { 0 }$ and terminate the experiment at $t _ { k }$ if $\sqrt { N ( t _ { k } ) } S ( t _ { k } ) \geq z _ { k }$ for some $k = 1 , \ldots , K$ with some suitably chosen $z _ { 1 } , \dotsc , z _ { K } > 0$ that satisfy + +$$ +\operatorname* { P r } \bigg ( \operatorname* { m a x } _ { k \in \{ 1 , \dots , K \} } \{ \sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \} > 0 \bigg ) \leq \alpha + o ( 1 ) +$$ + +for a given significance level $\alpha > 0$ under $H _ { 0 }$ . In view of equation 2, it suffices to find $\{ z _ { k } \} _ { k }$ that satisfy + +$$ +\operatorname* { P r } \left\{ \operatorname* { m a x } _ { k \in \{ 1 , \ldots , K \} } \left( \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) B ( t _ { k } ) - z _ { k } \right) > 0 \right\} \leq \alpha + o ( 1 ) , +$$ + +where the stochastic process $B ( \cdot )$ is defined in equation 3. + +To determine $\{ z _ { k } \} _ { k }$ , we need to derive the asymptotic distribution of the left-hand-side (LHS) of equation 4. To this end, define a mean-zero Gaussian process $G ( t )$ with covariance function + +$$ +\mathrm { C o v } ( G ( t ) , G ( t ^ { \prime } ) ) = N ^ { 1 / 2 } ( t ) N ^ { - 1 / 2 } ( t ^ { \prime } ) \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \Phi _ { a } \Sigma _ { a } ^ { - 1 } , \forall 0 < t \leq t ^ { \prime } . +$$ + +In the following, we show that the LHS of equation 4 can be uniformly approximated by $G ( \cdot )$ , for any $\{ z _ { k } \} _ { k = 1 , . . . , K }$ . To establish our theoretical results, we need some regularity conditions on $\dot { \varphi } ( \cdot )$ . To save space, we summarize these assumptions in (A3) and put them in Appendix $\mathbf { B }$ . + +Theorem 1 Assume (A1)-(A3) hold. For $a = 0 , 1$ , assume $\operatorname* { i n f } _ { x \in \mathbb { X } } \pi ^ { * } ( a , x ) > 0$ and $\left| Y ^ { * } ( a ) \right|$ is bounded almost surely. Assume there exists some $0 < \alpha _ { 0 } \le 1$ such that for any sequence $\{ j _ { n } \} _ { n }$ that satisfies $j _ { n } ^ { \alpha _ { 0 } } / \log ^ { \alpha _ { 0 } } j _ { n } \gg q ^ { 2 }$ , the following event occurs with probability at least $1 - O \big ( j _ { n } ^ { - \alpha _ { 0 } } \big )$ , + +$$ +\operatorname* { s u p } _ { a \in \{ 0 , 1 \} } E \left| \sum _ { i = 1 } ^ { k } \{ \pi _ { i - 1 } ( a , x ) - \pi ^ { * } ( a , x ) \} \right| \leq O ( 1 ) q k ^ { 1 - \alpha _ { 0 } } \log ^ { \alpha _ { 0 } } k , \forall k \geq j _ { n } , +$$ + +where $O ( 1 )$ denotes some positive constant. Assume $N ^ { \alpha _ { 0 } } ( t _ { 1 } ) / \log ^ { \alpha _ { 0 } } N ( t _ { 1 } ) \gg q ^ { 2 }$ and $N ( t _ { 1 } ) \gg$ $\log N ( T )$ almost surely. Then conditional on the counting process $N ( \cdot )$ , there exists some constant $c > 0$ such that + +$$ +\begin{array} { r l r } { { \operatorname* { s u p } _ { 1 , \ldots , z _ { K } } P r \{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } ( \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) B ( t _ { K } ) - z _ { k } ) > 0 \} - P r \{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } ( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { K } ) - z _ { k } ) \} } } \\ & { } & { \leq c q ^ { 3 / 4 } N ^ { - 1 / 8 } ( t _ { 1 } ) \log ^ { 1 5 / 8 } \{ K N ( t _ { 1 } ) \} + q N ^ { - \alpha _ { 0 } / 3 } ( t _ { 1 } ) \log ^ { ( 5 + \alpha _ { 0 } ) / 3 } \{ K N ( t _ { 1 } ) \} } \end{array} +$$ + +Theorem 1 implies that the approximation error depends on the number of observations obtained up to the first decision point $\bar { N ( t _ { 1 } ) }$ , the maximum number of interim analyses $K$ , the total number of basis functions $q$ , and $\alpha _ { 0 }$ , which characterizes the convergence rate of the treatment assignment mechanism $\scriptstyle \sum _ { i = 1 } ^ { n } { n ^ { - 1 } \pi _ { i - 1 } }$ . Clearly, the error will decay to zero when the followings hold with probability tending to 1, + +$$ +q = O ( N ^ { \alpha _ { * } } ( t _ { 1 } ) ) , \mathrm { f o r s o m e } 0 \leq \alpha ^ { * } < \operatorname* { m i n } ( 1 / 6 , \alpha _ { 0 } / 3 ) , +$$ + +$$ +\log ( K ) \ll \operatorname * { m i n } \{ N ^ { 1 / 1 5 - 2 \alpha ^ { * } / 5 } ( t _ { 1 } ) , N ^ { ( \alpha _ { 0 } - 3 \alpha ^ { * } ) / ( 5 + \alpha _ { 0 } ) } ( t _ { 1 } ) \} . +$$ + +In Appendix C, we show that $\alpha _ { 0 } = 1 / 2$ , when an $\epsilon$ -greedy strategy is used for randomization to balance the trade-off between exploration and exploitation. In this case, 6 requires $q$ to grow at a slower rate than $N ^ { 1 / 6 } ( t _ { 1 } )$ . This condition is automatically satisfied when $q$ is bounded. Condition 7 is satisfied when $K$ grows polynomially fast with respect to $N ( t _ { 1 } )$ . In addition to $\epsilon$ -greedy, other adaptive allocation procedures (e.g., upper confidence bound or Thompson sampling) could be applied as well. + +As discussed in the introduction, the derivation of Theorem 1 is nontrivial. One way to obtain the magnitude of the approximation error is to apply the strong approximation theorem for multidimensional martingales (see Morrow & Philipp, 1982; Zhang, 2004). However, the rate of approximation typically depends on the dimension and decays fast as the dimension increases. To derive Theorem 1, we view $\{ \varphi ^ { \top } ( x ) B ( t _ { K } ) \} _ { x \in \mathbb { X } , k \in \{ 1 , \dots , \kappa \} }$ as a high-dimensional martingale and adopt the Gaussian approximation techniques that have been recently developed by Belloni $\&$ Oliveira (2018). In view of equation 2, an application of Theorem 1 yields the following result. + +Theorem 2 Assume that the conditions of Theorem $^ { l }$ hold, equation $6$ and equation 7 hold with probability tending to 1. Then for any $z _ { 1 } , \ldots , z _ { k }$ that satisfy + +$$ +P r \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - z _ { k } \right) > 0 \right\} = \alpha + o ( 1 ) , +$$ + +as $N ( t _ { 1 } )$ diverges to infinity, we have under $H _ { 0 }$ , + +$$ +P r \left( \operatorname* { m a x } _ { k \in \{ 1 , \dots , K \} } \{ \sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \} > 0 \right) \leq \alpha + o ( 1 ) . +$$ + +The above equality holds when $\beta _ { 0 } ^ { * } = \beta _ { 1 } ^ { * }$ . + +Theorem 2 suggests that the type-I error rate of the proposed test can be well controlled. It remains to find critical values $\left\{ z _ { k } \right\} _ { 1 \leq k \leq K }$ that satisfy equation 8. In the next section, we propose a bootstrapassisted procedure to determine these critical values. + +# 3.2 BOOTSTRAP STOPPING BOUNDARY + +We first outline a method based on the wild bootstrap (Wu, 1986) to approximate the limiting distribution of $\{ S ( t _ { k } ) \} _ { k }$ . Then we discuss its limitation and present our proposal, a scalable bootstrap algorithm to determine the stopping boundary. + +The idea is to generate bootstrap samples $\{ \widehat { \beta } _ { a } ^ { \mathrm { M B } } ( t _ { k } ) \} _ { a , k }$ that have asymptotically the same joint distribution as $\{ \widehat { \beta } _ { a } ( t _ { k } ) - \beta _ { a } ^ { * } \} _ { a , k }$ . Then the joint distribution of $\{ S ( t _ { k } ) \} _ { k }$ can be well-approximated by the conditional distribution of $\{ \widehat { S } ^ { \mathrm { M B } } ( t _ { k } ) \} _ { k }$ given the data, where $\begin{array} { r } { \widehat { S } ^ { \mathrm { M B } } ( t ) = \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) \{ \widehat { \beta } _ { 1 } ^ { \mathrm { M B } } ( t ) - } \end{array}$ $\widehat { \beta } _ { 0 } ^ { \mathrm { M B } } ( t ) \}$ for any $t$ . Specifically, let $\{ \xi _ { i } \} _ { i = 1 } ^ { + \infty }$ be a sequence of i.i.d. standard normal random variables b independent of $\{ ( X _ { i } , A _ { i } , Y _ { i } ) \} _ { i = 1 } ^ { + \infty }$ . For $a \in \{ 0 , 1 \}$ , define + +$$ +\widehat { \beta } _ { a } ^ { \mathrm { M B } } ( t ) = \widehat { \Sigma } _ { a } ^ { - 1 } ( t ) \left[ \frac { 1 } { N ( t ) } \sum _ { i = 1 } ^ { N ( t ) } \mathbb { I } ( A _ { i } = a ) \varphi _ { i } ( X ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \widehat { \beta } ( t ) \} \xi _ { i } \right] , \forall a \in \{ 0 , 1 \} . +$$ + +Both the asymptotic means of $\sqrt { N ( t ) } \widehat { \beta } _ { a } ^ { \mathrm { M B } } ( t )$ and $\sqrt { N ( t ) } ( \widehat { \beta } _ { a } ( t ) - \beta _ { a } ^ { * } )$ are zero. In addition, their covariance functions are asymptotically the same. By design, $\{ \widehat { \beta } _ { a } ^ { \mathrm { M B } } ( t _ { k } ) \} _ { a , k }$ is multivariate normal. Similar to equation 3, we can show $\{ \widehat { \beta } _ { a } ( t _ { k } ) - \beta _ { a } ^ { * } \} _ { a , k }$ is asymptotically multivariate normal. Consequently, the limiting distributions of $\{ \widehat { \beta } _ { a } ^ { \mathrm { M B } } ( t _ { k } ) \} _ { a , k }$ and $\{ \widehat { \beta } _ { a } ( t _ { k } ) - \beta _ { a } ^ { * } \} _ { a , k }$ are asymptotically equivalent. As such, the bootstrap approximation is valid. + +However, calculating $\widehat { \beta } _ { a } ^ { \mathrm { M B } } ( t _ { k } )$ requires $O ( N ( t _ { k } ) )$ operations. The time complexity of the resulting bootstrap algorithm is $O ( B N ( t _ { k } ) )$ up to the $k$ -th interim stage, where $B$ is the total number of bootstrap samples. This can be time consuming when $\{ N ( t _ { k } ) - \mathbf { \bar { \phi } } N ( t _ { k - 1 } ) \} _ { k = 1 } ^ { K }$ are large. To facilitate the computation, we observe that in the calculation of ${ \widehat { \beta } } _ { a } ^ { \mathrm { M B } }$ , the random noise is generated upon the arrival of each observation. This is unnecessary as we aim to approximate the distribution of ${ \widehat \beta } _ { a } ( \cdot )$ only at finitely many time points. + +We next present our proposal. Let $\{ e _ { i , a } \} _ { i = 1 , . . . , K , a = 0 , 1 }$ be a sequence of i.i.d $N ( 0 , I _ { q } )$ random vectors independent of the observed data, where $I _ { q }$ denotes the $q \times q$ identity matrix. At the $k$ - th interim stage, we compute $\begin{array} { r } { \widehat { S } ^ { \mathtt { M B } * } ( t _ { k } ) = \operatorname* { s u p } _ { x \in \mathbb { X } } \bar { \varphi } ^ { \top } ( x ) \{ \widehat { \beta } _ { 1 } ^ { \mathtt { M B } * } ( t _ { k } ) - \widehat { \beta } _ { 0 } ^ { \mathtt { M B } * } ( t _ { k } ) \} } \end{array}$ , where $\widehat { \beta } _ { a } ^ { \mathrm { M B * } } ( t _ { k } )$ equals + +$$ +\frac { 1 } { \mathrm { V } ( t _ { k } ) } \sum _ { j = 1 } ^ { k } \left( \sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \widehat { \Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ( X _ { i } ) ^ { \top } \widehat { \beta } _ { a } ( t _ { j } ) \} ^ { 2 } \widehat { \Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \right) ^ { 1 / 2 } e _ { j , a } . +$$ + +For any $k _ { 1 }$ and $k _ { 2 }$ , the conditional covariance of $\sqrt { N ( t _ { k _ { 1 } } ) } \{ \widehat { \beta } _ { 1 } ^ { \mathrm { M B } * } ( t _ { k _ { 1 } } ) \ - \ \widehat { \beta } _ { 0 } ^ { \mathrm { M B } * } ( t _ { k _ { 1 } } ) \}$ and $\sqrt { N ( t _ { k _ { 2 } } ) } \{ \widehat { \beta } _ { 1 } ^ { \mathrm { M B } * } ( t _ { k _ { 2 } } ) - \widehat { \beta } _ { 0 } ^ { \mathrm { M B } * } ( t _ { k _ { 2 } } ) \}$ equals + +$$ +\frac { 1 } { \sqrt { N ( t _ { k _ { 1 } } ) N ( t _ { k _ { 2 } } ) } } \sum _ { a = 0 } ^ { 1 } \sum _ { j = 1 } ^ { k _ { 1 } } \sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \widehat { \Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \widehat { \beta } _ { a } ( t _ { j } ) \} ^ { 2 } \widehat { \Sigma } _ { a } ^ { - 1 } ( t _ { k _ { 1 } } ) , +$$ + +Under the given conditions in Theorem 1, it is to converge to + +$$ +\frac { \sqrt { N ( t _ { k _ { 1 } } ) } } { \sqrt { N ( t _ { k _ { 2 } } ) } } \sum _ { a = 0 } ^ { 1 } \Sigma _ { a } ^ { - 1 } \Phi ( a ) \Sigma _ { a } ^ { - 1 } = \mathrm { C o v } ( G ( t _ { k _ { 1 } } ) , G ( t _ { k _ { 2 } } ) ) . +$$ + +This means $\{ \sqrt { N ( t _ { k } ) } ( \widehat { \beta } _ { 1 } ^ { \mathrm { M B } ^ { * } } ( t _ { k } ) - \widehat { \beta } _ { 0 } ^ { \mathrm { M B } ^ { * } } ( t _ { k } ) ) \} _ { k }$ and $\{ G ( t _ { k } ) \} _ { k }$ have the same asymptotic distribution. Consequently, $\{ \sqrt { N ( t _ { k } ) } \widehat { S } ^ { \mathrm { M B } * } ( t _ { k } ) \} _ { k = 1 } ^ { K }$ can be used to approximate the joint distribution of $\{ \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) G ( t _ { k } ) \} _ { k = 1 } ^ { \cdot }$ . + +To choose $\{ z _ { k } \} _ { k }$ that satisfies equation 8, we adopt the $\alpha$ -spending approach that allocates the total allowable type I error at each interim stage according to an error-spending function. This guarantees our test controls the type-I error. We begin by specifying an $\alpha$ spending function $\alpha ( t )$ that is nonincreasing and satisfies $\alpha ( 0 ) = 0$ , $\alpha ( T ) = \alpha$ . Popular choices of $\alpha ( \cdot )$ include + +$$ +\alpha _ { 1 } ( t ) = \alpha \log \left( 1 + ( e - 1 ) \frac { t } { T } \right) , \quad \quad \quad \quad \alpha _ { 2 } ( t ) = 2 - 2 \Phi \left( \frac { \Phi ^ { - 1 } ( 1 - \alpha / 2 ) \sqrt { T } } { \sqrt { t } } \right) , +$$ + +$$ +\alpha _ { 3 } ( t ) = \alpha \left( \frac { t } { T } \right) ^ { \theta } , \mathrm { f o r } \theta > 0 , \alpha _ { 4 } ( t ) = \alpha \frac { 1 - \exp ( - \gamma t / T ) } { 1 - \exp ( - \gamma ) } , \mathrm { f o r } \gamma \neq 0 , +$$ + +where $\Phi ( \cdot )$ denotes the cumulative distribution function of a standard normal variable and $\Phi ^ { - 1 } ( \cdot )$ is its quantile function. Based on $\alpha ( \cdot )$ , we iteratively calculate $\widehat { z } _ { k } , k = 1 , \ldots , K$ as the solution of + +$$ +\mathrm { P r } ^ { * } \left\{ \operatorname* { m a x } _ { j \in \{ 1 , \dots , k - 1 \} } \left( \sqrt { N ( t _ { j } ) } \widehat { S } ^ { \mathrm { M B } * } ( t _ { j } ) - \widehat { z } _ { j } \right) \leq 0 , \sqrt { N ( t _ { k } ) } \widehat { S } ^ { \mathrm { M B } * } ( t _ { k } ) > \widehat { z } _ { k } \right\} = \alpha ( t _ { k } ) - \alpha ( t _ { k - 1 } ) , +$$ + +and reject $H _ { 0 }$ when $\sqrt { N ( t _ { k } ) } S ( t _ { k } ) > \widehat { z } _ { k }$ holds for some $k$ . + +The validity of the bootstrap test is summarized in Theorems 3 and 4 below. + +Theorem 3 Assume the conditions in Theorem $^ { l }$ hold. Assume $q = O ( N ^ { \alpha ^ { * } } ( t _ { 1 } ) )$ for some $0 ~ <$ $\alpha ^ { * } < 1 / 3$ , almost surely. Then conditional on the counting process $N ( \cdot )$ , we have + +$$ +\begin{array} { r } { \underset { 1 , \cdots , z _ { K } } { \operatorname* { s u p } } \left| P r ^ { * } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \sqrt { N ( t _ { k } ) } \widehat { S } ^ { M B * } ( t _ { k } ) - z _ { k } \right) > 0 \right\} - P r \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - z _ { k } \right) \right\} \right| } \\ { \leq c \left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \log ^ { 1 1 / 6 } \{ K N ( t _ { 1 } ) \} + q N ^ { - \alpha _ { 0 } / 3 } ( t _ { 1 } ) \log ^ { ( 5 + \alpha _ { 0 } ) / 3 } \{ K \} \right] , } \end{array} +$$ + +for some constant $c > 0$ with probability at least $1 - O ( N ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ , where $\textstyle P r ^ { * } ( \cdot )$ denotes the probability measure conditional on the data stream $\{ X _ { i } , A _ { i } , Y _ { i } \} _ { i = 1 } ^ { + \infty }$ . + +Theorem 4 Assume the conditions in Theorem 3 hold. Then conditional on $N ( \cdot )$ , the critical values $\{ \widehat { z } _ { k } \} _ { k }$ satisfy + +$$ +\begin{array} { r l } & { \left| P r \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - \widehat z _ { k } \right) > 0 \right\} - \alpha \right| } \\ { \leq } & { c \left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \log ^ { 1 1 / 6 } \{ K N ( t _ { 1 } ) \} + q N ^ { - \alpha _ { 0 } / 3 } ( t _ { 1 } ) \log ^ { ( 5 + \alpha _ { 0 } ) / 3 } \{ K N ( t _ { 1 } ) \} \right] , } \end{array} +$$ + +for some constant $c > 0$ . + +When the RHS of equation 11 is $o _ { p } ( 1 )$ , it follows from Theorems 2 and 4 that our test is valid. The conditional distribution in equation 10 can be approximated by the empirical distribution of Bootstrap samples. + +Finally, we remark that our test can be online updated as batches of observations arrive at the end of each interim stage. A pseudocode summarizing our procedure is given in Algorithm 1 in the appendix. The spatial complexity of the proposed algorithm is $O ( B )$ , where $B$ is the number of bootstrap samples. The time complexity is $\bar { O ( } B k + \bar { N } ( t _ { k } ) )$ up to the $k$ -th interim stage. Suppose $N ( t _ { j } ) - N ( t _ { j - 1 } ) = n$ for any $1 \leq j \leq K$ , we have $B k + N ( t _ { k } ) = ( B + n ) k \ll B n k = B N ( t _ { k } )$ for large $n$ and $B$ . Hence, our procedure is much faster compared to the standard wild bootstrap. + +# 4 NUMERICAL STUDIES + +# 4.1 SIMULATION STUDIES + +In this section, we conduct Monte Carlo simulations to examine the finite sample properties of the proposed test. We generated the potential outcomes as $Y _ { i } ^ { * } ( a ) = 1 + ( X _ { i 1 } - X _ { i 2 } ) / 2 + a \tau ( X _ { i } ) + \varepsilon _ { i }$ , where $\varepsilon _ { i }$ ’s are i.i.d $N ( 0 , 0 . 5 ^ { 2 } )$ . The covariates $X _ { i } ~ = ~ ( X _ { i 1 } , X _ { i 2 } , X _ { i 3 } ) ^ { \top }$ were generated as follows. We first generated $X _ { i } ^ { * } ~ = ~ ( X _ { i 1 } ^ { * } , X _ { i 2 } ^ { * } , X _ { i 3 } ^ { * } ) ^ { \top }$ from a multivariate normal distribution with zero mean and covariance matrix equal to $\{ 0 . 5 ^ { | i - j | } \} _ { i , j }$ . Then we set $X _ { i j } ~ = ~ X _ { i j } ^ { * } \mathbb { I } ( X _ { i j } ^ { * } | ~ \le$ $2 ) + 2 \mathrm { s g n } ( X _ { i j } ^ { * } ) \mathbb { I } ( X _ { i j } ^ { * } | > 2 )$ . We consider two randomization designs. In the first design, the treatment assignment is nondynamic and completely random. Specifically we set $\textstyle \pi _ { i } ( a , x ) = 0 . 5$ , for any $a , x$ and $i$ . In the second design, we use an $\epsilon$ -greedy strategy to generate the treatment with $\varepsilon = 0 . 3$ . In addition, we set $N ( T _ { 1 } ) = 2 0 0 0$ and $\bar { N ( T _ { j } ) } - \bar { N } \bar { ( T _ { j - 1 } ) } ^ { - } = 2 \bar { n }$ for $2 \leq j \leq K$ and some $n > 0$ . We consider two combinations of $( n , K )$ , corresponding to $( n , K ) = ( 2 0 0 , 5 )$ and (20, 50). + +We set the significance level √ $\alpha = 0 . 0 5$ and choose $B \ = \ 1 0 0 0 0$ . We set $\tau ( X _ { i } ) = \phi _ { \delta } \{ ( X _ { i 1 } +$ $X _ { i 2 } ) / \sqrt { 2 } \} X _ { i 3 } ^ { 2 }$ for some function $\phi _ { \delta }$ parameterized by some $\delta \geq 0$ . We consider two scenarios for $\phi _ { \delta }$ . Specifically, we set $\phi _ { \delta } ( x ) = \delta x ^ { 2 } / 3$ in Scenario 1 and $\phi _ { \delta } = \delta \cos ( \pi x )$ in Scenario 2. For each setting, we further consider four cases by setting $\delta = 0 , 0 . 1 , 0 . 1 5 , 0 . 2 , 0 . 2 5$ and 0.3. When $\delta = 0$ , $H _ { 0 }$ holds. Otherwise, $H _ { 1 }$ holds. For all settings, we construct the basis function $\varphi ( \cdot )$ using additive cubic splines. For each univariate spline, we set the number of internal knots to be 4. These knots are equally spaced between $[ - 2 , 2 ]$ . + +We denote our test by BAT, short for bootstrap-assisted test. We run our experiments on a single computer instance with 40 Intel(R) Xeon(R) 2.20GHz CPUs. It takes 1-2 seconds on average to compute each test. In Table 1 (see Appendix G), we report the rejection probabilities and average stopping times (defined as the average number of samples consumed when the experiment is terminated) of the proposed test aggregated over 400 simulations when $\alpha _ { 1 } ( \cdot )$ is chosen as the spending function. In Figure 2, we plot the rejection probabilities of our tests and the average stopping times of the experiments. It can be seen that the type-I error rates are close to the nominal level in all cases. The power of our test increases as $\delta$ increases, demonstrating its consistency. In addition, when $\delta > 0$ , our experiments are stopped early in all cases. + +To further evaluate our method, we compare it with a test based on the law of iterated logarithm (denoted by LIL). LIL determines the decision boundary based on an always valid finite error bound (see Appendix $\mathrm { F }$ for details about the competing method). It can be seen from Figure 2 that our method has much larger power than the law of iterated logarithm approach. + +# 4.2 REAL DATA ANALYSIS + +In this section, we apply the proposed method to a Yahoo! Today Module user click log dataset1, which contains 45,811,883 user visits to the Today Module, during the first ten days in May 2009. For the $i$ th visit, the dataset contains an ID of the new article recommended to the user, a binary response variable $Y _ { i }$ indicating whether the user clicked the article or not, and a five dimensional feature vector summarizing information of the user. Due to privacy concerns, feature definitions and article names were not included in the data. Each feature vector sums up to 1. Therefore, we took the first three and the fifth elements to form the covariates $X _ { i }$ . For illustration, we only consider a subset of data that contains visits on May 1st where the recommended article ID is either 109510 or 109520. These two articles were being recommended most on that day. This gives us a total of 405888 visits. On the reduced dataset, define $A _ { i } = 1$ if the recommended article is 109510 and $A _ { i } = 0$ otherwise. + +![](images/e8f1dd4aee2e95fb37aee7ba9ac609bd8fce0a4c6bbedd073021aa180f59c5ff.jpg) +Figure 2: Rejection probabilities and average stopping times of the proposed test when $\alpha _ { 1 } ( \cdot )$ is chosen as the spending function. From left to right: Scenario 1 with random design, Scenario 1 with $\epsilon$ -greedy design, Scenario 2 with random design and Scenario 2 with $\epsilon$ -greedy design. + +We first conduct A/A experiments (which compare these two articles against themselves) to examine the validity of our test. The A/A experiments are done when every 2000 more users are available, we randomly assign 1000 users to arm A, and the other 1000 users in arm B. We expect our test will not reject $H _ { 0 }$ in A/A experiments, since the articles being recommended are the same. Then, we conduct A/B experiment to test the QTE of these two articles. The test statistics and their corresponding critical values are plotted in Figure 3. On average it takes several seconds to implement our test. It can be seen that our test is able to be reject $H _ { 0 }$ after obtaining the first one-third of the observations, in the A/B experiment. In the A/A experiments, we fail to reject $H _ { 0 }$ , as expected. + +# 5 DISCUSSION + +In this paper, we propose a new testing procedure for evaluating the performance of technology products in tech companies based on the notion of qualitative treatment effects. Currently, we only focus on comparing two products. It would be practically useful to develop a multiple testing procedure under settings with multiple treatment options. These topics warrant further investigations. + +![](images/d07ec0bda641ab04da632fa857aca2761150230607e09e18e0434c03477db667.jpg) +Figure 3: Critical values and test statistics. + +# REFERENCES + +Donald W. K. Andrews and Xiaoxia Shi. Inference based on conditional moment inequalities. Econometrica, 81(2):609–666, 2013. ISSN 0012-9682. doi: 10.3982/ECTA9370. URL http://dx.doi.org/10.3982/ECTA9370. + +Donald W. K. Andrews and Xiaoxia Shi. Nonparametric inference based on conditional moment inequalities. J. Econometrics, 179(1):31–45, 2014. ISSN 0304-4076. doi: 10.1016/j.jeconom. 2013.10.005. URL http://dx.doi.org/10.1016/j.jeconom.2013.10.005. + +Timothy B. Armstrong and Hock Peng Chan. Multiscale adaptive inference on conditional moment inequalities. J. Econometrics, 194(1):24–43, 2016. ISSN 0304-4076. doi: 10.1016/j.jeconom. 2016.04.001. URL http://dx.doi.org/10.1016/j.jeconom.2016.04.001. + +Susan Athey and Guido Imbens. Recursive partitioning for heterogeneous causal effects. Proc. Natl. Acad. Sci. USA, 113(27):7353–7360, 2016. ISSN 1091-6490. doi: 10.1073/pnas.1510489113. URL https://doi.org/10.1073/pnas.1510489113. + +Alexandre Belloni and Roberto I Oliveira. A high dimensional central limit theorem for martingales, with applications to context tree models. arXiv preprint arXiv:1809.02741, 2018. + +Bernard Bercu and Abderrahmen Touati. Exponential inequalities for self-normalized martingales with applications. Ann. Appl. Probab., 18(5):1848–1869, 2008. ISSN 1050-5164. doi: 10.1214/ 07-AAP506. URL https://doi.org/10.1214/07-AAP506. + +Prabir Burman and Keh-Wei Chen. Nonparametric estimation of a regression function. Ann. Statist., 17(4):1567–1596, 1989. ISSN 0090-5364. doi: 10.1214/aos/1176347382. + +Minsu Chang, Sokbae Lee, and Yoon-Jae Whang. Nonparametric tests of conditional treatment effects with an application to single-sex schooling on academic achievements. Econom. J., 18(3): 307–346, 2015. ISSN 1368-4221. + +Xiaohong Chen and Timothy M. Christensen. Optimal uniform convergence rates and asymptotic normality for series estimators under weak dependence and weak conditions. J. Econometrics, 188(2):447–465, 2015. ISSN 0304-4076. doi: 10.1016/j.jeconom.2015.03.010. + +Victor Chernozhukov, Sokbae Lee, and Adam M. Rosen. Intersection bounds: estimation and inference. Econometrica, 81(2):667–737, 2013. ISSN 0012-9682. doi: 10.3982/ECTA8718. URL http://dx.doi.org/10.3982/ECTA8718. + +Victor Chernozhukov, Denis Chetverikov, and Kengo Kato. Empirical and multiplier bootstraps for suprema of empirical processes of increasing complexity, and related Gaussian couplings. Stochastic Process. Appl., 126(12):3632–3651, 2016. ISSN 0304-4149. doi: 10.1016/j.spa.2016. 04.009. URL https://doi.org/10.1016/j.spa.2016.04.009. + +Victor Chernozhukov, Denis Chetverikov, and Kengo Kato. Detailed proof of nazarov’s inequality. arXiv preprint arXiv:1711.10696, 2017. + +M Gail and R Simon. Testing for qualitative interactions between treatment effects and patient subsets. Biometrics, 41(2):361–372, 1985. + +Yu-Chin Hsu. Consistent tests for conditional treatment effects. The Econometrics Journal, 20(1): 1–22, 2017. + +Jianhua Z. Huang. Projection estimation in multiple regression with application to functional ANOVA models. Ann. Statist., 26(1):242–272, 1998. ISSN 0090-5364. doi: 10.1214/aos/ 1030563984. + +Christopher Jennison and Bruce W Turnbull. Group sequential methods with applications to clinical trials. Chapman and Hall/CRC, 1999. + +Ramesh Johari, Leo Pekelis, and David J Walsh. Always valid inference: Bringing sequential analysis to a/b testing. arXiv preprint arXiv:1512.04922, 2015. + +Ramesh Johari, Pete Koomen, Leonid Pekelis, and David Walsh. Peeking at a/b tests: Why it matters, and what to do about it. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1517–1525. ACM, 2017. + +Nianqiao Ju, Diane Hu, Adam Henderson, and Liangjie Hong. A sequential test for selecting the better variant: Online a/b testing, adaptive allocation, and continuous monitoring. In Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 492–500. ACM, 2019. + +Eugene Kharitonov, Aleksandr Vorobev, Craig Macdonald, Pavel Serdyukov, and Iadh Ounis. Sequential testing for early stopping of online experiments. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 473–482. ACM, 2015. + +K. K. Gordon Lan and David L. DeMets. Discrete sequential boundaries for clinical trials. Biometrika, 70(3):659–663, 1983. ISSN 0006-3444. doi: 10.2307/2336502. URL https: //doi.org/10.2307/2336502. + +Gregory Morrow and Walter Philipp. An almost sure invariance principle for Hilbert space valued martingales. Trans. Amer. Math. Soc., 273(1):231–251, 1982. ISSN 0002-9947. doi: 10.2307/ 1999203. URL https://doi.org/10.2307/1999203. + +Jeremy Roth and Noah Simon. A framework for estimating and testing qualitative interactions with applications to predictive biomarkers. Biostatistics, 19(3):263–280, 2018. ISSN 1468-4357. doi: 10.1093/biostatistics/kxx038. URL https://doi.org/10.1093/ biostatistics/kxx038. + +D.B. Rubin. Estimating causal effects of treatments in randomized and non-randomized studies. J. Edu. Psychol., 66:688–701, 1974. + +Donald B. Rubin. Causal inference using potential outcomes: design, modeling, decisions. J. Amer. Statist. Assoc., 100(469):322–331, 2005. ISSN 0162-1459. doi: 10.1198/016214504000001880. URL https://doi.org/10.1198/016214504000001880. + +Chengchun Shi, Wenbin Lu, and Rui Song. A sparse random projection-based test for overall qualitative treatment effects. Journal of the American Statistical Association, 115(531):12011213, 2020a. + +Chengchun Shi, Sheng Zhang, Rui Song, and Wenbin Lu. Statistical Inference of the Value Function for Reinforcement Learning in Infinite Horizon Settings. Under review, 2020b. + +Charles J. Stone. Optimal global rates of convergence for nonparametric regression. Ann. Statist., 10(4):1040–1053, 1982. ISSN 0090-5364. + +Matt Taddy, Matt Gardner, Liyun Chen, and David Draper. A nonparametric bayesian analysis of heterogenous treatment effects in digital experimentation. Journal of Business & Economic Statistics, 34(4):661–672, 2016. + +Stefan Wager and Susan Athey. Estimation and inference of heterogeneous treatment effects using random forests. J. Amer. Statist. Assoc., 113(523):1228–1242, 2018. ISSN 0162-1459. doi: 10.1080/01621459.2017.1319839. URL https://doi.org/10.1080/01621459. 2017.1319839. + +C.-F. J. Wu. Jackknife, bootstrap and other resampling methods in regression analysis. Ann. Statist., 14(4):1261–1350, 1986. ISSN 0090-5364. doi: 10.1214/aos/1176350142. URL https:// doi.org/10.1214/aos/1176350142. With discussion and a rejoinder by the author. + +Fanny Yang, Aaditya Ramdas, Kevin G Jamieson, and Martin J Wainwright. A framework for multia (rmed)/b (andit) testing with online fdr control. In Advances in Neural Information Processing Systems, pp. 5957–5966, 2017. + +Miao Yu, Wenbin Lu, and Rui Song. A new framework for online testing of heterogeneous treatment effect. In AAAI, pp. 10310–10317, 2020. + +Input: Number of bootstrap samples $B$ , an $\alpha$ spending function $\alpha ( \cdot )$ + +Initialize: $n = 0$ , $\widehat { \Sigma } _ { 0 } = \widehat { \Sigma } _ { 1 } = { \cal O } _ { p + 1 }$ , $\widehat { \gamma } _ { 0 } = \widehat { \gamma } _ { 1 } = 0 _ { p + 1 }$ , $\widehat { \beta } _ { 0 , b } = \widehat { \beta } _ { 1 , b } = 0 _ { p + 1 }$ , and a set $\mathcal { T } = \{ 1 , \ldots , B \}$ . +For $k = 1$ to $K$ do + +Initialize: $m = 0$ and $\widehat { \Phi } _ { 0 } = \widehat { \Phi } _ { 1 } = O _ { p + 1 }$ + +Step 1: Online update of ${ \widehat { \beta } } _ { a }$ +For $i = N ( t _ { k - 1 } ) \bar { { + } 1 }$ to $N ( t _ { k } )$ do $n = n + 1$ and $m = m + 1$ ; $\widehat { \Sigma } _ { a } = ( 1 - n ^ { - 1 } ) \widehat { \Sigma } _ { a } + n ^ { - 1 } \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;$ $\widehat { \gamma } _ { a } = ( 1 - n ^ { - 1 } ) \widehat { \gamma } _ { a } + n ^ { - 1 } \varphi ( X _ { i } ) Y _ { i } \mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;$ + +bCompute $\widehat { \beta } _ { a } = \widehat { \Sigma } _ { a } ^ { - 1 } \widehat { \gamma } _ { a }$ for $a \in \{ 0 , 1 \}$ and $S = \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) ( \widehat { \beta } _ { 1 } - \widehat { \beta } _ { 0 } ) ;$ + +# Step 2: Bootstrap + +Generate two independent ${ \cal N } ( 0 , I _ { p + 1 } )$ Gaussian vectors $e _ { 0 } , e _ { 1 }$ + +# Step 3: Reject or not + +Set $z$ to be the upper $\{ \alpha ( t ) - | \mathcal { T } | ^ { c } / B | \} / ( 1 - | \mathcal { T } ^ { c } | / B )$ -th percentile of $\{ \widehat { S } _ { b } \} _ { b \in \mathbb { Z } }$ Update $\mathcal { T }$ as ${ \mathcal { T } } \{ b \in { \mathcal { T } } : { \widehat { S } } _ { b } \leq z \}$ . + +If $S > z$ : Reject $H _ { 0 }$ and terminate the experiment. + +Algorithm 1: the Pseudocode that summarizing the online bootstrap testing procedure. + +Baqun Zhang, Anastasios A Tsiatis, Eric B Laber, and Marie Davidian. Robust estimation of optimal dynamic treatment regimes for sequential treatment decisions. Biometrika, 100(3):681–694, 2013. + +Li-xin Zhang. Strong approximations of martingale vectors and their applications in Markovchain adaptive designs. Acta Math. Appl. Sin. Engl. Ser., 20(2):337–352, 2004. ISSN 0168-9673. doi: 10.1007/s10255-004-0173-z. URL https://doi.org/10.1007/ $\mathtt { s 1 0 2 5 5 - 0 0 4 - 0 1 7 3 - z }$ . + +# A NOTATIONS + +We introduce some general notations used in the appendix. For any matrix Mat, we use $\left\| \mathbf { M a t } \right\| _ { p }$ to denote the matrix norm induced by the corresponding $\ell _ { p }$ norm of vectors, for $1 \leq p \leq + \infty$ . For two nonnegative sequences $\{ s _ { 1 , n } \} _ { n }$ and $\{ s _ { 2 , n } \} _ { n }$ , we will use the notation $s _ { 1 , n } \preceq s _ { 2 , n }$ to represent that $s _ { 1 , n } \leq \bar { c } s _ { 2 , n }$ for some universal constant $\bar { c } > 0$ whose value is allowed to change from place to place. When a matrix Mat is degenerate, $\mathrm { { M a t } ^ { - 1 } }$ denotes the Moore-Penrose inverse of Mat. For any vector $\psi$ , we use $\psi ^ { ( i ) }$ to denote its $i$ -th element. + +In Algorithm 1, we use $O _ { p + 1 }$ to denote a $( p + 1 ) \times ( p + 1 )$ zero matrix and $0 _ { p + 1 }$ to denote a $( p + 1 )$ -dimensional zero vector. + +# B MORE ON THE BASIS FUNCTION + +# B.1 CONDITION (A3) + +(A3). Assume $\lambda _ { \operatorname* { m i n } } [ \mathrm { E } \varphi ( X ) \varphi ^ { \top } ( X ) ] \asymp 1 , \lambda _ { \operatorname* { m a x } } [ \mathrm { E } \varphi ( X ) \varphi ^ { \top } ( X ) ] \asymp 1 , \operatorname* { s u p } _ { x } \| \varphi ( x ) \| _ { 1 } = O ( q ^ { \top } ) ,$ , $\begin{array} { r } { \operatorname* { l i m } \operatorname* { i n f } _ { q } \operatorname* { i n f } _ { x \in \mathbb { X } } \| \varphi ( x ) \| _ { 2 } > 0 } \end{array}$ . In addition, assume + +$$ +\operatorname* { s u p } _ { x , y \in \mathbb { X } } \frac { \| \varphi ( x ) - \varphi ( y ) \| _ { 2 } } { \| x - y \| _ { 2 } } \preceq q ^ { 1 / 2 } . +$$ + +When a tensor-product B-spline is used (see Section 6 of Chen & Christensen, 2015, for a brief overview of tenor-product B-splines), (A3) is automatically satisfied. Specifically, $\lambda _ { \operatorname* { m i n } } [ \mathrm { E } \varphi ( X ) \varphi ^ { \top } ( X ) ] \asymp 1$ , $\dot { \lambda } _ { \mathrm { m a x } } [ \mathrm { E } \varphi ( X ) \dot { \varphi } ^ { \top } ( X ) ] \asymp 1$ follow from Theorem 3.3 of (Burman & Chen, 1989). $\operatorname* { s u p } _ { x } \| \varphi ( x ) \| _ { 1 } = O ( q ^ { 1 / 2 } )$ follows by noting that the absolute value of each element in $\varphi ( x )$ is bounded by some universal constant. $\begin{array} { r } { \operatorname* { l i m } \operatorname* { i n f } _ { q } \operatorname* { i n f } _ { x \in \mathbb { X } } \| \varphi ( x ) \| _ { 2 } > 0 } \end{array}$ follows from the arguments used in the proof of Lemma E.4 of Shi et al. (2020b). The last condition in equation 12 holds by noting that each function in the vector $\varphi ( \cdot )$ is Lipschitz continuous when a tensor-product B-spline is used. + +# B.2 ON THE APPROXIMATION ERROR + +The proposed test remains valid as long as the approximation error satisfies + +$$ +\operatorname* { i n f } _ { \beta _ { 0 } , \beta _ { 1 } \in \mathbb { R } ^ { p } } \operatorname* { s u p } _ { x \in \mathbb { X } , a \in \{ 0 , 1 \} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \beta _ { 0 } , \beta _ { 1 } ) | = o ( \{ N ( T ) \} ^ { - 1 / 2 } ) , +$$ + +with probability tending to 1. In the following, we introduce some sufficient conditions for equation 13. + +Suppose the Q-function $Q _ { 0 } ( \cdot , a )$ is $p$ -smooth (see the definition of $p$ -smoothness in Stone, 1982), for $a \in [ 0 , 1 ]$ . When a tensor-product B-spline or Wavelet basis is used for $\varphi ( \cdot )$ , then there exist some $\beta _ { 0 } ^ { \ast }$ and $\beta _ { 1 } ^ { * }$ that satisfy + +$$ +\operatorname* { i n f } _ { \beta _ { 0 } , \beta _ { 1 } \in \mathbb { R } ^ { p } } \operatorname* { s u p } _ { x \in \mathbb { X } , a \in \{ 0 , 1 \} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \beta _ { 0 } , \beta _ { 1 } ) | = O ( q ^ { - p / d } ) . +$$ + +See Section 2.2 of Huang (1998) for detailed discussions on the approximation power of these basis functions. Condition equation 13 is thus automatically satisfied when + +$$ +q \gg \{ N ( T ) \} ^ { d / ( 2 p ) } , +$$ + +with probability tending to 1. + +# C ADAPTIVE RANDOMIZATION + +In practice, the company might want to allocate more traffic to a better treatment based on the observed data stream. The $\epsilon$ -greedy strategy is commonly used to balance the trade-off between exploration and exploitation. For a given $0 < \varepsilon _ { 0 } < 1$ , consider the following randomization procedure: for some integer $N _ { 0 } > 0$ and any $j \geq N _ { 0 }$ , $a \in \{ 0 , 1 \}$ , $x \in \mathbb { X }$ , we set + +π $\begin{array} { r } { \tau _ { j - 1 } ( a , x ) = ( 1 - \varepsilon _ { 0 } ) a \mathbb { I } \{ \varphi ^ { \top } ( x ) ( \widehat { \beta } _ { 1 , j - 1 } - \widehat { \beta } _ { 0 , j - 1 } ) > 0 \} + \varepsilon _ { 0 } ( 1 - a ) \mathbb { I } \{ \varphi ^ { \top } ( x ) ( \widehat { \beta } _ { 1 , j - 1 } - \widehat { \beta } _ { 0 , j - 1 } ) \leq 0 } \end{array}$ }, where + +$$ +\widehat { \beta } _ { a , j } = \widehat { \Sigma } _ { a , j } ^ { - 1 } \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \{ \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) Y _ { i } \} \mathrm { a n d } \widehat { \Sigma } _ { a , j } = \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) . +$$ + +It is immediate to see that $\widehat { \Sigma } _ { a } ( t ) = \widehat { \Sigma } _ { a , n ( t ) }$ and $\widehat { \beta } _ { a } ( t ) = \widehat { \beta } _ { a , n ( t ) }$ . Define + +$$ +\pi ^ { * } ( a , x ) = ( 1 - \varepsilon _ { 0 } ) a \mathbb { I } \{ \varphi ^ { \top } ( x ) ( \beta _ { 1 } - \beta _ { 0 } ) > 0 \} + \varepsilon _ { 0 } ( 1 - a ) \mathbb { I } \{ \varphi ^ { \top } ( x ) ( \beta _ { 1 } - \beta _ { 0 } ) \leq 0 \} +$$ + +for any $a \in \{ 0 , 1 \}$ and $x \in \mathbb { X }$ . + +Lemma 2 Assume (A1)-(A3) hold. Assume $\operatorname* { i n f } _ { x \in \mathbb { X } } \pi ^ { * } ( a , x ) > 0$ and $\left| Y ^ { * } ( a ) \right|$ is bounded almost surely, for $a \in \{ 0 , 1 \}$ . Assume $P r ( | \varphi ^ { \top } ( X ) ( \beta _ { 1 } - \bar { \beta } _ { 0 } ) | \le \epsilon ) \ \le L _ { 0 } \mathfrak { e }$ , for some constant $L _ { 0 } > 0$ and any $\epsilon > 0$ . Then for any $\{ j _ { n } \} _ { n }$ that satisfies $\sqrt { j _ { n } } / \sqrt { \log j _ { n } } \gg q ^ { 2 }$ , the following event occurs with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ , + +$$ + \sum _ { a \in \{ 0 , 1 \} } E ^ { \mathcal { F } _ { i - 1 } } | \sum _ { i = 1 } ^ { k } \{ \pi _ { i - 1 } ( a , X ) - \pi ^ { * } ( a , X ) \} | \preceq q \sqrt { k \log k } , \forall k \geq j _ { n } . +$$ + +Lemma 2 implies that Condition equation 5 in Theorem 1 automatically holds with $\alpha _ { 0 } = 1 / 2$ , when the epsilon-greedy strategy is used. When $\varphi ^ { \top } ( X ) ( \beta _ { 1 } - \beta _ { 0 } )$ is a continuous random variable, the assumption $\bar { \operatorname* { P r } } ( | \varphi ^ { \top } ( X ) ( \bar { \beta _ { 1 } } - \beta _ { 0 } ) | \leq \epsilon ) \leq { \dot { L _ { 0 } } } \epsilon$ for any $\epsilon > 0$ in Lemma 2 is satisfied if $\varphi ^ { \top } ( X ) ( \beta _ { 1 } -$ $\beta _ { 0 , }$ ) has a bounded probability density function. When $\varphi ^ { \top } ( X ) ( \beta _ { 1 } - \beta _ { 0 } )$ is discrete, this assumption is satisfied if $\begin{array} { r } { \operatorname* { i n f } _ { x \in \bar { \mathbb { X } } } | \varphi ^ { \top } ( x ) \dot { ( \beta _ { 1 } - \beta _ { 0 } ) } | > 0 } \end{array}$ . + +# D TESTING THE AVERAGE TREATMENT EFFECTS + +# D.1 THE ALGORITHM + +We focus on testing the following hypothesis, + +$$ +H _ { 0 } : { \mathrm { E } } Y _ { i } ^ { * } ( 1 ) \leq { \mathrm { E } } Y _ { i } ^ { * } ( 0 ) { \mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \mathrm { E } } Y _ { i } ^ { * } ( 1 ) > { \mathrm { E } } Y _ { i } ^ { * } ( 0 ) . +$$ + +Under (A1) and (A2), it suffices to test + +$$ +H _ { 0 } : { \mathrm { E } } Q ( X _ { i } , 1 ) \leq { \mathrm { E } } Q ( X _ { i } , 0 ) { \mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \mathrm { E } } Q ( X _ { i } , 1 ) > { \mathrm { E } } Q ( X _ { i } , 0 ) . +$$ + +We similarly use basis approximations to model the Q-function. Our proposal is summarized in the following algorithm. We next conduct simulation studies to evaluate this algorithm. + +Input: Number of bootstrap samples $B$ , an $\alpha$ spending function $\alpha ( \cdot )$ + +Initialize: $n = 0$ , $\widehat { \Sigma } _ { 0 } = \widehat { \Sigma } _ { 1 } = O _ { p + 1 }$ , $\widehat { \gamma } _ { 0 } = \widehat { \gamma } _ { 1 } = 0 _ { p + 1 }$ , $\widehat { \beta } _ { 0 , b } = \widehat { \beta } _ { 1 , b } = 0 _ { p + 1 }$ , $\bar { \varphi } = 0$ and a set $\mathcal { T } = \{ 1 , \ldots , B \}$ . +For $k = 1$ to $K$ do + +Initialize: $m = 0$ , $\widehat { \phi } = 0$ and $\widehat { \Phi } _ { 0 } = \widehat { \Phi } _ { 1 } = O _ { p + 1 }$ + +For $i = N ( t _ { k - 1 } ) + 1$ to $N ( t _ { k } )$ do + +bCompute $\widehat { \beta } _ { a } = \widehat { \Sigma } _ { a } ^ { - 1 } \widehat { \gamma } _ { a }$ for $a \in \{ 0 , 1 \}$ and $S = \bar { \varphi } ^ { \top } ( \widehat { \beta } _ { 1 } - \widehat { \beta } _ { 0 } )$ ; + +For $b = 1 , \dots , B$ do + +Generate two independent $N ( 0 , I _ { p + 1 } )$ Gaussian vectors e0, e1, $N ( 0 , 1 )$ random variable $e _ { 2 }$ $\widehat { \beta } _ { a , b } = ( 1 - m n ^ { - 1 } ) \widehat { \beta } _ { a , b } + n ^ { - 1 } \widehat { \Phi } _ { a } ^ { 1 / 2 } e _ { a } + n ^ { - 1 } \widehat { \phi } ^ { 1 / 2 } e _ { 2 } , a = 0 , 1$ ; +Compute $\widehat { S } _ { b } = \bar { \varphi } ^ { \top } ( \widehat { \beta } _ { 1 , b } - \widehat { \beta } _ { 0 , b } )$ ; Set $z$ to be the upper $\{ \alpha ( t ) - | \mathcal { T } | ^ { c } / B | \} / ( 1 - | \mathcal { T } ^ { c } | / B )$ -th percentile of $\{ \widehat { S } _ { b } \} _ { b \in \mathbb { Z } }$ ; Update $\mathcal { T }$ as ${ \mathcal { T } } \{ b \in { \mathcal { T } } : { \widehat { S } } _ { b } \leq z \}$ . +If $S > z$ : + +Reject $H _ { 0 }$ and terminate the experiment; + +# D.2 NUMERICAL STUDIES + +In this section, we compare our procedure with the always valid test for testing ATE (Johari et al., 2015). We generate the potential outcomes with the same model, except that $\varepsilon _ { i }$ ’s are i.i.d $N ( 0 , 1 )$ . However, we set $N ( T _ { 1 } ) \stackrel { - } { = } 1 0 0 0$ and $N ( T _ { j } ) - N ( T _ { j - 1 } ) = 2 n$ for $2 \leq j \leq K$ and some $n > 0$ . We consider two combinations of $( n , K )$ , corresponding to $( n , K ) = ( 1 0 0 , 5 )$ and (10, 50). For all settings, we use a linear function to approximate $Q$ . + +In Table 2 (see Appendix G) and Figure 4, we show the rejection probabilities and average stopping times of the proposed test aggregated over 400 simulations, when $\alpha _ { 1 } ( \cdot )$ is chosen as the spending function. It can be seen that our method behaves better than the always valid test when the effect size is small, and comparable when the effect size is large. The always valid test fails in the adaptive randomization settings, as the type-I error rates are around $50 \%$ under the null hypothesis. + +# E PROOFS + +Note that we require $\mathbb { X }$ to be a compact set. To simplify the proof, we assume $\mathbb { X } = [ 0 , 1 ] ^ { d }$ . + +![](images/190f52fa2835cb10c09afb066ce68d7c745ed90ba954fd3930ae64a0529ced2e.jpg) +Figure 4: Rejection probabilities and average stopping times of the proposed test when $\alpha _ { 1 } ( \cdot )$ is chosen as the spending function. + +# E.1 PROOF OF LEMMA 1 + +Set $\mathcal { F } _ { 0 } = \emptyset$ . We state the following lemma before proving Lemma 1. + +Lemma 3 For any $j \geq 1$ $, ( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \perp \mathcal { F } _ { j - 1 } .$ + +For any $a \in \{ 0 , 1 \} , i \geq 1$ , notice that + +$$ +\begin{array} { r } { \mathrm { E I } ( A _ { i } = a ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} = \mathrm { E I } ( A _ { i } = a ) \{ Y _ { i } ^ { \ast } ( a ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} } \\ { = \mathrm { E E } ^ { X _ { i } , F _ { i - 1 } } [ \mathbb { I } ( A _ { i } = a ) \{ Y _ { i } ^ { \ast } ( a ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ] , } \end{array} +$$ + +where the first equation is due to Assumption (A1) and $\mathrm { E } ^ { X _ { i } , \mathcal { F } _ { i - 1 } }$ denotes the conditional expectation given $\mathcal { F } _ { i - 1 }$ and $X _ { i }$ . By Assumption (A2), we have + +$$ +{ } _ { \mathfrak { X } ^ { \lambda _ { i } , F _ { i - 1 } } [ \mathbb { I } ( A _ { i } = a ) \{ Y _ { i } ^ { * } ( a ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ] } = \{ \mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \mathbb { I } ( A _ { i } = a ) \} [ \mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \{ Y _ { i } ^ { * } ( a ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ] +$$ + +The second term on the RHS equals zero due to Lemma 3 and our model assumption $\operatorname { E } \{ Y _ { i } ^ { * } ( a ) | X _ { i } \} = \varphi ^ { \top } ( X _ { i } ) \beta _ { a }$ . The proof is hence completed. + +# E.2 PROOF OF THEOREM 1 + +Let $n ( \cdot )$ be the realization of the counting process $N ( \cdot )$ . We will show the assertion in Theorem 1 holds for any such realizations that satisfy $n ( t _ { 1 } ) < n ( t _ { 2 } ) < \cdot \cdot \cdot < n ( t _ { K } )$ . The case where some of the $n ( t _ { k } )$ ’s are the same can be similarly discussed. + +For any $j \geq 1$ , define $\sigma ( \mathcal { F } _ { j } )$ to be the $\sigma$ -algebra generated by ${ \mathcal { F } } _ { j }$ . For $a \in \{ 0 , 1 \}$ , define + +$$ +\widehat { \Sigma } _ { a , j } = \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \ \mathrm { ~ a n d ~ } \widehat { \beta } _ { a , j } = \widehat { \Sigma } _ { a , j } ^ { - 1 } \left( \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) Y _ { i } \right) . +$$ + +It is immediate to see that $\widehat { \Sigma } _ { a } ( t ) = \widehat { \Sigma } _ { a , n ( t ) }$ and $\widehat { \beta } _ { a } ( t ) = \widehat { \beta } _ { a , n ( t ) }$ . Define $\delta _ { n } = q n ^ { - \alpha _ { 0 } } \log ^ { \alpha _ { 0 } } n$ . We state the following lemmas before proving Theorem 1. + +Lemma 4 There exists some constant $0 ~ < ~ \epsilon _ { 0 } ~ < ~ 1$ such that $\lambda _ { \operatorname* { m i n } } [ E \varphi ( X ) \varphi ^ { \top } ( X ) ] ~ \geq ~ \epsilon _ { 0 } ,$ , $\begin{array} { r } { \operatorname* { m a x } [ E \varphi ( X ) \varphi ^ { \top } ( X ) ] \leq \epsilon _ { 0 } ^ { - 1 } , \operatorname* { s u p } _ { x } \| \varphi ( x ) \| _ { 2 } \leq \operatorname* { s u p } _ { x } \| \varphi ( x ) \| _ { 1 } \leq \epsilon _ { 0 } ^ { - 1 } \sqrt { q } , \operatorname* { m i n } _ { a \in \{ 0 , 1 \} } \lambda _ { \operatorname* { m i n } } [ \Sigma _ { a } ] \geqslant \epsilon _ { 0 } ^ { - 1 } } \end{array}$ 0, $\begin{array} { r } { \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \| \beta _ { a } \| _ { 2 } \leq \epsilon _ { 0 } ^ { - 1 } , } \end{array}$ , $\begin{array} { r } { \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } | Y ^ { * } ( a ) | \leq \epsilon _ { 0 } ^ { - 1 } } \end{array}$ and $\begin{array} { r } { \operatorname* { s u p } _ { x } \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } | \varphi ^ { \top } ( x ) \beta _ { a } | \leq \epsilon _ { 0 } ^ { - 1 } } \end{array}$ . + +Lemma 5 Assume the conditions in Theorem $I$ hold. Then for any sequence $\{ j _ { n } \} _ { n }$ that satisfies $j _ { n } ^ { \alpha _ { 0 } } / \log ^ { \alpha _ { 0 } } ( j _ { n } ) \gg q ^ { 2 }$ , we have with probability at least $1 - O ( j _ { n } ^ { - \alpha _ { 0 } } )$ that for any $a \in \{ 0 , 1 \}$ and + +any $k \geq j _ { n }$ + +$$ +\begin{array} { r } { \| ( \widehat { \Sigma } _ { a , k } - \Sigma _ { a } ) \| _ { 2 } \preceq q \delta _ { k } + \sqrt { q k ^ { - 1 } \log k } , } \\ { \| ( \widehat { \Sigma } _ { a , k } ^ { - 1 } - \Sigma _ { a } ^ { - 1 } ) \| _ { 2 } \preceq q \delta _ { k } + \sqrt { q k ^ { - 1 } \log k } . } \end{array} +$$ + +Lemma 6 Assume the conditions in Theorem $^ { l }$ hold. The for any sequence $\{ j _ { n } \} _ { n }$ that satisfies $j _ { n } / \log ( j _ { n } ) \gg q ,$ , we have with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ that for any $a \in \{ 0 , 1 \}$ and any $k \geq j _ { n } ,$ , + +$$ +\left\| \sum _ { i = 1 } ^ { k } \varphi ( X _ { i } ) \mathbb { I } ( A _ { i } = a ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \right\| _ { 2 } \preceq \sqrt { q k \log k } . +$$ + +For $a \in \{ 0 , 1 \}$ , + +$$ +\widehat { \beta } _ { a , k } - \beta _ { a } = \widehat { \Sigma } _ { a } ^ { - 1 } \left[ \frac { 1 } { k } \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \right] , +$$ + +and hence + +$$ +\begin{array} { r l } & { \Bigg \| \widehat { \beta } _ { a , k } - \beta _ { a } - \Sigma _ { a } ^ { - 1 } \left[ \frac { 1 } { k } \displaystyle \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \right] \Bigg \| _ { 2 } } \\ { \leq } & { \| \widehat { \Sigma } _ { a , k } ^ { - 1 } - \Sigma _ { a } ^ { - 1 } \| _ { 2 } \Bigg \| \frac { 1 } { k } \displaystyle \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \Bigg \| _ { 2 } } \\ { \leq } & { ( q \delta _ { k } + \sqrt { q k ^ { - 1 } \log k } ) q ^ { 1 / 2 } k ^ { - 1 / 2 } \log ^ { 1 / 2 } k , ~ \forall k \geq j _ { n } , } \end{array} +$$ + +with probability at least $1 - O \big ( j _ { n } ^ { - \alpha _ { 0 } } \big )$ , by Lemma 5 and Lemma 6. Define + +$$ +B ^ { * } ( t ) = { \frac { 1 } { \sqrt { n ( t ) } } } \sum _ { i = 1 } ^ { n ( t ) } [ \Sigma _ { 1 } ^ { - 1 } \varphi ( X _ { i } ) A _ { i } \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } \} - \Sigma _ { 0 } ^ { - 1 } \varphi ( X _ { i } ) ( 1 - A _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 0 } \} ] . +$$ + +It follows that + +$$ +\begin{array} { r } { \| B ^ { * } ( t _ { k } ) - B ( t _ { k } ) \| _ { 2 } \preceq \{ q ^ { 3 / 2 } \delta _ { n ( t _ { k } ) } + q \sqrt { n ^ { - 1 } ( t _ { k } ) \log n ( t _ { k } ) } \} n ^ { - 1 / 2 } ( t _ { k } ) \log ^ { 1 / 2 } n ( t _ { k } ) , \forall k \geq 1 , } \end{array} +$$ + +with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ , and hence + +$$ +\operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) B ( t _ { k } ) \| _ { 2 } \leq \bar { c } \{ q ^ { 2 } \delta _ { n ( t _ { k } ) } + q ^ { 3 / 2 } \sqrt { n ^ { - 1 } ( t _ { k } ) \log n ( t _ { k } ) } \} \sqrt { n ^ { - 1 } ( t _ { k } ) \log n ( t _ { k } ) } . +$$ + +with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ , for some constant $\bar { c } > 0$ , by equation 41. Under the given conditions on $q$ and $n ( t _ { 1 } )$ , we have + +$$ +q \sqrt { n ^ { - 1 } ( t _ { k } ) \log n ( t _ { k } ) } = o ( 1 ) , ~ \forall k \geq 1 , +$$ + +and hence + +$$ +\| \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) B ( t _ { k } ) \| _ { 2 } \leq { \bar { c } } \{ q \delta _ { n ( t _ { k } ) } + \sqrt { q n ^ { - 1 } ( t _ { k } ) \log n ( t _ { k } ) } \} , \forall k \geq 1 , +$$ + +Thus, for any given $z _ { 1 } , z _ { 2 } , \dotsc , z _ { K }$ , we obtain + +$$ +\begin{array} { r l } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } \right) \leq 0 \right\} - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) ) } \\ { \leq } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ( t _ { k } ) - z _ { k } \right) \leq 0 \right\} } \\ { \leq } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } \right) \leq 0 \right\} + O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) ) , } \end{array} +$$ + +where + +$$ +\begin{array} { r } { z _ { k , - } = z _ { k } - \bar { c } \{ q \delta _ { n ( t _ { k } ) } + \sqrt { q n ^ { - 1 } ( t _ { k } ) \log n ( t _ { k } ) } \} , } \\ { z _ { k , + } = z _ { k } + \bar { c } \{ q \delta _ { n ( t _ { k } ) } + \sqrt { q n ^ { - 1 } ( t _ { k } ) \log n ( t _ { k } ) } \} . } \end{array} +$$ + +For any $i \geq 1 , 1 \leq k \leq K$ , define a $q$ -dimensional vector + +$$ +\dot { \iota } _ { i , k } = \frac { 1 } { \sqrt { n ( t _ { k } ) } } [ \Sigma _ { 1 } ^ { - 1 } \varphi ( X _ { i } ) A _ { i } \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } \} - \Sigma _ { 0 } ^ { - 1 } \varphi ( X _ { i } ) ( 1 - A _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 0 } \} ] \mathbb { I } ( i \leq n ( t _ { k } ) , 1 ) . +$$ + +or equivalently, + +$$ +\dot { \iota } _ { i , k } = \frac { 1 } { \sqrt { n ( t _ { k } ) } } [ \Sigma _ { 1 } ^ { - 1 } \varphi ( X _ { i } ) A _ { i } \{ Y _ { i } ^ { * } ( 1 ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } \} - \Sigma _ { 0 } ^ { - 1 } \varphi ( X _ { i } ) ( 1 - A _ { i } ) \{ Y _ { i } ^ { * } ( 0 ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { 0 } \} ] \mathbb { I } ( \dot { \iota } _ { i } ) \mathbb { 1 } - \mu _ { 0 } \mathbb { 1 } / \mathbb { 1 } \mu _ { 0 } ] +$$ + +by Condition (A1). Let $\pmb { \xi } _ { i } = ( \xi _ { i , 1 } ^ { \top } , \xi _ { i , 2 } ^ { \top } , \cdot \cdot \cdot , \xi _ { i , K } ^ { \top } ) ^ { \top }$ and $\begin{array} { r } { \mathcal { M } _ { j } = \sum _ { i = 1 } ^ { j } \pmb { \xi } _ { i } } \end{array}$ . The sequence $\{ \mathcal { M } _ { i } \} _ { i \ge 1 }$ forms a multivariate martingale with respect to the filtration $\{ \sigma ( \mathcal { F } _ { i } ) : i \ge 1 \}$ , since + +$$ +\begin{array} { r } { \mathrm { E } ( \xi _ { i , k } | \mathcal { F } _ { i } ) = [ \{ \mathrm { E } ( \xi _ { i , k } | A _ { i } , X _ { i } , \mathcal { F } _ { i } ) \} | \mathcal { F } _ { i } ] = 0 , } \end{array} +$$ + +by (A2). Let $n ( t _ { 0 } ) = 0$ . For any $i$ such that $n ( t _ { k - 1 } ) < i \leq n ( t _ { k } )$ for some $1 \leq k \leq K$ , we have + +$$ +\xi _ { i } | | _ { \infty } \leq \frac { 1 } { \sqrt { n ( t _ { k } ) } } \{ \| \Sigma _ { 1 } ^ { - 1 } \varphi ( X _ { i } ) \{ Y _ { i } ^ { * } ( 1 ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } \} \| _ { 2 } + \| \Sigma _ { 0 } ^ { - 1 } \varphi ( X _ { i } ) \{ Y _ { i } ^ { * } ( 0 ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { 0 } \} \| _ { 2 } \} +$$ + +where the second inequality is due to Lemma 4. Therefore, + +$$ +\mathbb { E } \| \pmb { \xi } _ { i } \| _ { \infty } ^ { 3 } \preceq \frac { q ^ { 3 / 2 } } { n ^ { 3 / 2 } ( t _ { k } ) } . +$$ + +It follows that + +$$ +\begin{array} { r l } { { } } & { \underset { i = 1 } { \overset { n ( t _ { k } ) } { \sum } } \ \mathrm { E } \| \xi _ { i } \| _ { \infty } ^ { 3 } = \underset { k = 1 } { \overset { K } { \sum } } \ \underset { i = n ( t _ { k - 1 } ) + 1 } { \overset { n ( t _ { k } ) } { \sum } } \ \mathrm { E } \| \xi _ { i } \| _ { \infty } ^ { 3 } \preceq q ^ { 3 / 2 } \underset { k = 1 } { \overset { K } { \sum } } \ \frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } } \\ { { \leq } } & { \frac { q ^ { 3 / 2 } } { \sqrt { n ( t _ { 1 } ) } } + q ^ { 3 / 2 } \underset { k = 2 } { \overset { K } { \sum } } \ \frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } \leq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) + q ^ { 3 / 2 } \int _ { n ( t _ { 1 } ) } ^ { + \infty } x ^ { - 3 / 2 } d x = 3 q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { k } ) } \end{array} +$$ + +Define a sequence of independent Gaussian vectors $\{ \eta _ { i } \} _ { i \ge 1 }$ that satisfy $\pmb { \eta _ { i } } \sim N ( 0 , \mathbb { E } ( \pmb { \xi } _ { i } \pmb { \xi } _ { i } ^ { \top } | \mathcal { F } _ { i - 1 } ) )$ for any $i \geq 1$ . Then the distribution of $\eta _ { i }$ is the same as + +$$ +\left( \frac { \mathbb { I } ( i \leq n ( t _ { 1 } ) ) } { \sqrt { n ( t _ { 1 } ) } } Z ^ { \top } , \frac { \mathbb { I } ( i \leq n ( t _ { 2 } ) ) } { \sqrt { n ( t _ { 2 } ) } } Z ^ { \top } , \cdots , \frac { \mathbb { I } ( i \leq n ( t _ { K } ) ) } { \sqrt { n ( t _ { K } ) } } Z ^ { \top } \right) , +$$ + +where $Z$ is a $p$ -dimensional mean-zero Gaussian vector with covariance matrix + +$$ +\begin{array} { r l } & { \quad \mathrm { C o v } [ \displaystyle \sum _ { \alpha \in \{ 0 , 1 \} } \sum _ { a } ^ { - 1 } \varphi ( X _ { i } ) ] [ ( A _ { i } = a ) \{ Y _ { i } ^ { * } ( a ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ] \mathcal { F } _ { i - 1 } ] } \\ { = } & { \quad \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \mathbb { E } [ \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) ] [ ( A _ { i } = a ) \{ Y _ { i } ^ { * } ( a ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ^ { 2 } ] \mathcal { F } _ { i - 1 } ] \Sigma _ { a } ^ { - 1 } } \\ { = } & { \quad \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \mathbb { E } [ \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) ] [ ( A _ { i } = a ) \sigma ^ { 2 } ( a , X _ { i } ) | \mathcal { F } _ { i - 1 } ] \Sigma _ { a } ^ { - 1 } } \\ & { = \quad \displaystyle \sum _ { a \in \{ 0 , 1 \} } \sum _ { a } ^ { - 1 } \mathbb { E } \{ \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \pi _ { i - 1 } ( a , X _ { i } ) \sigma ^ { 2 } ( a , X _ { i } ) | \mathcal { F } _ { i - 1 } \} \Sigma _ { a } ^ { - 1 } } \\ { = } & { \quad \displaystyle \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \mathbb { E } \{ \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \pi _ { i - 1 } ( a , X _ { i } ) \sigma ^ { 2 } ( a , X _ { i } ) | \mathcal { F } _ { i - 1 } \} \Sigma _ { a } ^ { - 1 } } \\ { = } & { \quad \displaystyle \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \mathbb { E } ^ { \mathcal { F } _ { i - 1 } } \pi _ { i - 1 } ( a , X ) \sigma ^ { 2 } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X ) \Sigma _ { a } ^ { - 1 } , } \end{array} +$$ + +where the second equality follows from (A2) and Lemma 3, the third equality is due to the definition of $\pi _ { i - 1 }$ and the last equality follows from Lemma 3. + +Similar to equation 19, we can show that + +$$ +\sum _ { i = 1 } ^ { n ( t _ { K } ) } \operatorname { E } \lVert \pmb { \eta } _ { i } \rVert _ { \infty } ^ { 3 } \preceq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) . +$$ + +Using similar arguments in equation 20, we can show that for any $1 \leq k _ { 1 } \leq k _ { 2 } \leq K$ , + +$$ +\sum _ { i = 1 } ^ { \langle t \kappa \rangle } \mathbf { E } \{ \xi _ { i } , _ { k _ { 1 } } \xi _ { i , k _ { 2 } } ^ { \top } | \mathcal { F } _ { i - 1 } \} = \frac { 1 } { \sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \mathbf { E } ^ { \mathcal { F } _ { i - 1 } } \pi _ { i - 1 } ( a , X ) \sigma ^ { 2 } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X ) , +$$ + +Let + +$$ +\begin{array} { c } { { V ( k _ { 1 } , k _ { 2 } ) = \displaystyle \frac { 1 } { \sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \mathbb { E } ^ { \mathcal { F } _ { i - 1 } } \pi ^ { * } ( a , X ) \sigma ^ { 2 } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X ) \Sigma _ { a } ^ { - 1 } } } \\ { { = \displaystyle \frac { 1 } { \sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \Phi _ { a } \Sigma _ { a } ^ { - 1 } = \displaystyle \frac { \sqrt { n ( t _ { k _ { 1 } } ) } } { \sqrt { n ( t _ { k _ { 2 } } ) } } \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \Phi _ { a } \Sigma _ { a } ^ { - 1 } . } } \end{array} +$$ + +Consider an arbitrary sequence of $\mathbb { R } ^ { p + 1 }$ vectors $\left\{ b _ { k } \right\} _ { 1 \leq k \leq K }$ . Under the given conditions, we have + +$$ +\begin{array} { r l } & { \left| b _ { k _ { 1 } } ^ { \top } \left( \displaystyle \sum _ { i = 1 } ^ { n ( t _ { K } ) } \mathsf { E } ( \xi _ { i , k _ { 1 } } \xi _ { 1 , k _ { 2 } } ^ { \top } | \mathcal { F } _ { i - 1 } ) - V ( k _ { 1 } , k _ { 2 } ) \right) b _ { k _ { 2 } } \right| } \\ { \ \preceq } & { \frac { 1 } { n ( t _ { k _ { 1 } } ) } \displaystyle \sum _ { a \in \{ 0 , 1 \} } \left\| \displaystyle \sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \mathsf { E } ^ { \mathcal { F } _ { i - 1 } } \left\{ \pi _ { i - 1 } ( a , X ) - \pi ^ { * } ( a , X ) \right\} \sigma ^ { 2 } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X ) \right\| _ { 2 } \| b _ { k _ { 1 } } \| _ { 2 } \| b _ { k _ { 2 } } \| _ { 2 } . } \end{array} +$$ + +Define a matrix $V$ as + +$$ +V = \left( \begin{array} { c c c c } { { V ( 1 , 1 ) } } & { { V ( 1 , 2 ) } } & { { . . . } } & { { V ( 1 , K ) } } \\ { { V ( 2 , 1 ) } } & { { V ( 2 , 2 ) } } & { { . . . } } & { { V ( 2 , K ) } } \\ { { \vdots } } & { { \vdots } } & { { } } & { { \vdots } } \\ { { V ( K , 1 ) } } & { { V ( K , 2 ) } } & { { . . . } } & { { V ( K , K ) } } \end{array} \right) . +$$ + +It follows that + +$$ +\left| \sum _ { i = 1 } ^ { \boldsymbol { n } ( t _ { k } ) } \mathrm { E } ( \xi _ { i } \xi _ { i } ^ { \top } | \mathcal { F } _ { i - 1 } ) - V \right| \Bigg | _ { 2 } \preceq \operatorname* { s u p } _ { a \in \{ 0 , 1 \} } \left\| \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \mathrm { E } ^ { \mathcal { F } _ { i - 1 } } \{ \pi _ { i - 1 } ( a , X ) - \pi ^ { * } ( a , X ) \} \sigma ^ { 2 } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X ) \right\| ^ { 2 } , +$$ + +Using similar arguments in proving equation 14, we can show the RHS of the above equation is upper bounded by + +$$ +\epsilon _ { 0 } ^ { - 2 } q \operatorname* { s u p } _ { \stackrel { a \in \{ 0 , 1 \} } { x \in \mathbb { X } , j \geq n ( t _ { 1 } ) } } \left| \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \{ \pi _ { i - 1 } ( a , x ) - \pi ^ { * } ( a , x ) \} \right| , +$$ + +and hence by $\epsilon _ { 0 } ^ { - 2 } q \delta _ { n ( t _ { 1 } ) }$ , with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ . Therefore, we have + +$$ +\lambda _ { \operatorname* { m i n } } \left[ { V + \delta _ { n ( t _ { 1 } ) } I _ { K p \times K p } - \sum _ { i = 1 } ^ { n ( t _ { K } ) } \operatorname { E } ( \pmb { \xi } _ { i } \pmb { \xi } _ { i } ^ { \top } | \mathcal { F } _ { i - 1 } ) } \right] \geq 0 , +$$ + +with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ , where $I _ { K p \times K p }$ denotes a $K p \times K p$ identity matrix. + +Moreover, notice that + +$$ +\operatorname* { s u p } _ { a \in \{ 0 , 1 \} } \left| { \frac { 1 } { j } } \sum _ { i = 1 } ^ { j } \{ \pi _ { i - 1 } ( a , x ) - \pi ^ { * } ( a , x ) \} \right| +$$ + +is bounded between 0 and 1. For any $a \in \{ 0 , 1 \}$ and any $z > 0$ , we have + +$$ +\begin{array} { r l } { { } } & { { } \underset { x \in \{ 0 , 1 \} } { \operatorname* { s u p } } } \\ { { \leq } } & { { } \underset { x \in \mathcal { X } , j \geq n ( t _ { 1 } ) } { \operatorname* { s u p } } | \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \{ \pi _ { i - 1 } ( a , x ) - \pi ^ { * } ( a , x ) \} | } \\ { { + } } & { { } \operatorname* { P r } ( \underset { x \in \mathcal { X } , j \geq n ( t _ { 1 } ) } { \operatorname* { s u p } } | \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \{ \pi _ { i - 1 } ( a , x ) - \pi ^ { * } ( a , x ) \} | \mathbb { 1 } ( \underset { a \leq t \leq \{ 0 , 1 \} } { \operatorname* { s u p } } | \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \{ \pi _ { i - 1 } ( a , x ) - \pi ^ { * } ( a , x ) \} | | } \\ { + } & { { } \operatorname* { P r } ( \underset { x \in \mathcal { X } , j \geq n ( t _ { 1 } ) } { \operatorname* { s u p } } | | \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \{ \pi _ { i - 1 } ( a , x ) - \pi ^ { * } ( a , x ) \} | > z ) . } \end{array} +$$ + +Under the given conditions, we have + +$$ +\left. \underset { x \in \mathbb { X } , j \geq n ( t _ { 1 } ) } { \operatorname* { E } } \right| \frac { 1 } { j } \sum _ { i = 1 } ^ { j } \{ \pi _ { i - 1 } ( a , x ) - \pi ^ { * } ( a , x ) \} \Bigg | \preceq \delta _ { n ( t _ { 1 } ) } + O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) ) . +$$ + +Therefore, we obtain + +$$ +\mathbf { E } \left\| \sum _ { i = 1 } ^ { n ( t _ { K } ) } \mathrm { E } ( \pmb { \xi } _ { i } \pmb { \xi } _ { i } ^ { \top } | \mathcal { F } _ { i - 1 } ) - V \right\| _ { 2 } \preceq q n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) + q \delta _ { n ( t _ { 1 } ) } , +$$ + +or + +$$ +\mathbf { E } \left\| \sum _ { i = 1 } ^ { n ( t _ { K } ) } \mathbf { E } ( \pmb { \xi } _ { i } \pmb { \xi } _ { i } ^ { \top } | \mathcal { F } _ { i - 1 } ) - V \right\| _ { 2 } \preceq q \delta _ { n ( t _ { 1 } ) } , +$$ + +since $n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) \ll \delta _ { n ( t _ { 1 } ) }$ . Combining equation 19 with equation 21, equation 23 and equation 24, an application of Theorem 2.1 in Belloni & Oliveira (2018) yields that + +$$ +\begin{array} { r l } & { | \mathrm { E } \psi ( \mathcal { M } _ { n ( t _ { K } ) } ) - \mathrm { E } \psi ( N ( 0 , { \pmb V } ) ) | } \\ { \preceq } & { c _ { 0 } ( \psi ) n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) + c _ { 2 } ( \psi ) q \delta _ { n ( t _ { 1 } ) } + c _ { 3 } ( \psi ) q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) , } \end{array} +$$ + +for any thrice differential function $\psi ( \cdot )$ , and + +$$ +c _ { 0 } ( \psi ) = \operatorname* { s u p } _ { z , z ^ { \prime } \in \mathbb { R } ^ { p K } } | \psi ( z ) - \psi ( z ^ { \prime } ) | \mathrm { ~ a n d ~ } c _ { i } = \operatorname* { s u p } _ { z \in \mathbb { R } ^ { p K } } \sum _ { j _ { 1 } , \cdots , j _ { i } } | \partial _ { j _ { 1 } } \partial _ { j _ { 2 } } \cdots \partial _ { j _ { i } } \psi ( z ) | , i = 2 , 3 , +$$ + +where $\partial _ { j } g ( z )$ denotes the partial derivative $\partial g ( z ) / \partial z ^ { ( j ) }$ for any function $\mathbf { g } ( \cdot )$ and $z ^ { ( j ) }$ stands for the $j$ -th element of $z$ . + +Let ${ \mathbb X } _ { k , 0 }$ be an $\varepsilon$ -net of $\mathbb { X }$ that satisfies the following: for any $x \in \mathbb { X }$ , there exists some $x _ { 0 } \in \mathbb { X } _ { 0 }$ such that $\| x - x _ { 0 } \| _ { 2 } \leq \varepsilon$ . Set $\varepsilon = \sqrt { d } / n ^ { 4 } ( t _ { 1 } )$ . Since $\mathbb { X } = [ 0 , 1 ] ^ { d }$ , there exists some ${ \mathbb X } _ { 0 }$ with + +$$ +| \mathbb { X } _ { 0 } | \leq n ^ { 4 d } ( t _ { 1 } ) , +$$ + +where $| \mathbb { X } _ { 0 } |$ denotes the number of elements in ${ \mathbb X } _ { 0 }$ . Under Condition (A3), we have + +$$ +\operatorname* { s u p } _ { x \in \mathbb { X } } \operatorname* { i n f } _ { x _ { 0 } \in \mathbb { X } _ { 0 } } \| \varphi ( x ) - \varphi ( x _ { 0 } ) \| _ { 2 } \preceq \frac { \sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } . +$$ + +It follows that + +$$ +\operatorname* { s u p } _ { \| \nu \| _ { 2 } = 1 } | \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) \nu - \operatorname* { s u p } _ { x \in \mathbb { X } _ { 0 } } \varphi ^ { \top } ( x ) \nu | \preceq \frac { \sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } . +$$ + +Using similar arguments in showing equation 17, we can show the following event occurs with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ , + +$$ +\| B ^ { * } ( t _ { k } ) \| _ { 2 } \preceq q ^ { 1 / 2 } \log ^ { 1 / 2 } n ( t _ { k } ) , ~ \forall k \geq 1 . +$$ + +This together with equation 27 yields + +$$ +\begin{array} { r l } & { \left| \underset { k \in \{ 1 , \cdots , K \} } { \operatorname* { m a x } } \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - \underset { k \in \{ 1 , \cdots , K \} } { \operatorname* { m a x } } \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) \right| } \\ { \leq } & { \underset { k \in \{ 1 , \cdots , K \} } { \operatorname* { m a x } } \left| \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) \right| \preceq \frac { q \log n ^ { 1 / 2 } ( t _ { K } ) } { n ^ { 4 } ( t _ { 1 } ) } , } \end{array} +$$ + +with probability at least $\mathrm { ~ 1 ~ - ~ } O ( n ^ { - 1 } ( t _ { 1 } ) )$ . Under the given conditions, we have $n ( t _ { 1 } ) ~ \gg$ $\operatorname* { m a x } ( q , \log n ( t _ { K } ) )$ . It follows that there exists some constant $\bar { c } ^ { * } > 0$ such that + +$$ +\left. \operatorname* { m a x } _ { k \in \{ 1 , \ldots , K \} } \operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) B ^ { \ast } ( t _ { k } ) - \operatorname* { m a x } _ { k \in \{ 1 , \ldots , K \} } \operatorname* { s u p } _ { x \in \mathbb { X } _ { 0 } } \varphi ^ { \top } ( x ) B ^ { \ast } ( t _ { k } ) \right. \leq { \vec { c } } ^ { \ast } n ^ { - 2 } ( t _ { 1 } ) , +$$ + +with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ . + +Define + +$$ +\begin{array} { r l } & { z _ { k , - } ^ { * } = z _ { k } - \bar { c } \{ q \delta _ { n ( t _ { k } ) } + \sqrt { q n ^ { - 1 } ( t _ { k } ) \log n ( t _ { k } ) } \} - \bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , } \\ & { z _ { k , + } ^ { * } = z _ { k } + \bar { c } \{ q \delta _ { n ( t _ { k } ) } + \sqrt { q n ^ { - 1 } ( t _ { k } ) \log n ( t _ { k } ) } \} + \bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) . } \end{array} +$$ + +Combining equation 28 with equation 18 yields + +$$ +\begin{array} { r l } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \right) \leq 0 \right\} - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) ) } \\ { \leq } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ( t _ { k } ) - z _ { k } \right) \leq 0 \right\} } \\ { \leq } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \right) \leq 0 \right\} + O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) ) . } \end{array} +$$ + +Notice that $\mathcal { M } _ { n ( t _ { K } ) } = \{ B ^ { * } ( t _ { 1 } ) ^ { \top } , B ^ { * } ( t _ { 2 } ) ^ { \top } , \cdot \cdot \cdot , B ^ { * } ( t _ { K } ) ^ { \top } \} ^ { \top }$ . By equation 26 and Lemma 4, there exist a set of vectors $d _ { 1 } , d _ { 2 } , \dots , d _ { L } \in \mathbb { R } ^ { q K }$ with $L \leq n ^ { 4 d } ( t _ { 1 } ) K$ , $\mathrm { m a x } _ { j } \| d _ { j } \| _ { 1 } \leq \epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }$ and a function $k ( \cdot )$ that maps $\{ 1 , \ldots , L \}$ into $\{ 1 , \ldots , K \}$ such that + +$$ +\operatorname* { m a x } _ { k \in \{ 1 , \ldots , K \} } \left\{ \operatorname* { s u p } _ { x \in \mathbb { X } _ { 0 } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - \nu _ { k } \right\} = \operatorname* { m a x } _ { 1 \leq j \leq L } \{ d _ { j } ^ { \top } \mathcal { M } _ { n ( t _ { K } ) } - \nu _ { k ( j ) } \} , +$$ + +for any $\{ \nu _ { k } \} _ { k = 1 } ^ { K }$ . For any $\eta > 0$ , $m \in \mathbb { R } ^ { q K }$ , consider the function $\phi _ { \eta , \{ \nu _ { k } \} _ { k } } : \mathbb { R } ^ { q K } \mathbb { R }$ , defined as + +$$ +\phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( m ) = \frac { 1 } { \eta } \log \left\{ \sum _ { j = 1 } ^ { L } \exp [ \eta \{ d _ { j } ^ { \top } m - \eta \nu _ { k ( j ) } \} ] \right\} . +$$ + +It has the following property: + +$$ +\begin{array} { r l } & { \underset { 1 \leq j \leq L } { \operatorname* { m a x } } \{ d _ { j } ^ { \top } m - \nu _ { k ( j ) } \} \leq \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( m ) \leq \underset { 1 \leq j \leq L } { \operatorname* { m a x } } \{ d _ { j } ^ { \top } m - \nu _ { k ( j ) } \} + \eta ^ { - 1 } \log L } \\ { \leq } & { \underset { 1 \leq j \leq L } { \operatorname* { m a x } } \{ d _ { j } ^ { \top } m - \nu _ { k ( j ) } \} + \eta ^ { - 1 } \{ \log K + 4 d \log n ( t _ { 1 } ) \} } \\ { = } & { \underset { 1 \leq j \leq L } { \operatorname* { m a x } } [ d _ { j } ^ { \top } m - \{ \nu _ { k ( j ) } - \eta ^ { - 1 } \log K - \eta ^ { - 1 } 4 d \log n ( t _ { 1 } ) \} ] . } \end{array} +$$ + +It follows that + +$$ +\begin{array} { r l } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \right) \leq 0 \right\} \leq \operatorname* { P r } \left\{ \phi _ { \eta , \{ z _ { k , + } ^ { * * } \} _ { k } ^ { * * } \left( \mathcal { M } _ { n ( t _ { K } ) } \right) \leq 0 } , \quad \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \Omega , } } \\ & \right\{ \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \right) \leq 0 \right\} } & { \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \mathrm { ~ } \Omega ~ } \\ { = } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - ( z _ { k , - } ^ { * } - 3 \delta ) \right) \leq 3 \delta \right\} \geq \operatorname* { P r } \left\{ \phi _ { \eta , \{ z _ { k , - } ^ { * * } \} _ { k } } \left( \mathcal { M } _ { n ( t _ { K } ) } \right) \leq 3 \delta \right\} } \end{array} +$$ + +where + +The value of $\delta$ will be specified later. In addition, with some calculations, we have + +$$ +\begin{array} { r l } { \partial _ { t } \phi _ { \mathrm { c a i r c } } \Delta \phi _ { \mathrm { c a i r c } } } & { \to - \frac { \sqrt { 2 } - \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \rho \mathrm { e r f } ( \phi _ { \mathrm { c a i r c } } ^ { 2 } - \phi _ { \mathrm { c a c i r c } } ^ { 2 } ) , } \\ { \partial _ { t } \phi _ { \mathrm { c a i r c } } \Delta \phi _ { \mathrm { c a i r c } } } & { \to - \frac { \sqrt { 2 } - \alpha ^ { 2 } } { \sqrt { 2 } } \rho \mathrm { e r f } ( \phi _ { \mathrm { c a i r c } } ^ { 2 } ) \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \exp ( - \pi \phi _ { \mathrm { c a i r c } } ^ { 2 } ) , } \\ { \partial _ { t } \phi _ { \mathrm { c a i r c } } \Delta \phi _ { \mathrm { c a i r c } } } & { \to \frac { \sqrt { 2 } - \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \exp ( \exp ( - \pi \phi _ { \mathrm { c a i r c } } ^ { 2 } ) ) , } \\ { \phantom { = } } & { \to \frac { \sqrt { 2 } - \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \exp ( \exp ( - \pi \phi _ { \mathrm { c a i r c } } ^ { 2 } ) ) , } \\ { \phantom { = } } & { \to \frac { \sqrt { 2 } - \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \exp ( \exp ( - \pi \phi _ { \mathrm { c a c c } } ^ { 2 } ) ) ^ { \frac { 1 } { \sqrt { 2 } } } , } \\ \frac { \sqrt { 2 } - \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac { \alpha ^ { 2 } } { \sqrt { 2 } } \frac \end{array} +$$ + +Since $\operatorname* { m a x } _ { i } \| d _ { i } \| _ { 1 } \leq \epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }$ , we obtain that + +$$ +\begin{array} { r l r } { { \sum _ { j } | \partial _ { j } \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( m ) | \le \epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 } , \sum _ { j _ { 1 } , j _ { 2 } } | \partial _ { j _ { 1 } } \partial _ { j _ { 2 } } \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( m ) | \le 2 \eta \epsilon _ { 0 } ^ { - 2 } q , } } \\ & { } & { \ \sum _ { j _ { 1 } , j _ { 2 } , j _ { 3 } } | \partial _ { j _ { 1 } } \partial _ { j _ { 2 } } \partial _ { j _ { 3 } } \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( m ) | \le 6 \eta ^ { 2 } \epsilon _ { 0 } ^ { - 3 } q ^ { 3 / 2 } . } \end{array} +$$ + +By Lemma 5.1 of Chernozhukov et al. (2016), for any $\delta > 0$ , there exists some function $\mathbf { g } _ { \delta } ( \cdot ) : \mathbb { R } \to$ $\mathbb { R }$ with $\| \mathbf { g } _ { \delta } ^ { \prime } \| _ { \infty } \leq \delta ^ { - 1 } , \| \mathbf { g } _ { \delta } ^ { \prime \prime } \| _ { \infty } \leq K _ { 0 } \delta ^ { - 2 } , \| \mathbf { g } _ { \delta } ^ { \prime \prime \prime } \| _ { \infty } \leq K _ { 0 } \delta ^ { - 3 } \mathbf { f }$ or some constant $K _ { 0 } > 0$ such that + +It follows that + +$$ +\mathbb { I } ( \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( m ) \le 0 ) \le \mathtt { g o } \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( m ) \le \mathbb { I } ( \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( m ) \le 3 \delta ) , +$$ + +for any $m \in \mathbb { R } ^ { q K }$ . Combining this together with equation 30, equation 31 and equation 32, we obtain that + +$$ +\begin{array} { r l } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \right) \leq 0 \right\} \leq \mathrm { E } \mathrm { g } _ { \delta } \circ \phi _ { \eta , \{ z _ { k , + } ^ { * * } \} _ { k } } \big ( \mathcal { M } _ { n ( t _ { K } ) } \big ) , } \\ & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \right) \leq 0 \right\} \geq \mathrm { E } \mathrm { g } _ { \delta } \circ \phi _ { \eta , \{ z _ { k , - } ^ { * * } \} _ { k } } \big ( \mathcal { M } _ { n ( t _ { K } ) } \big ) . } \end{array} +$$ + +Consider the function $\mathbf { g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } }$ . Apparently, we have + +$$ +\operatorname* { s u p } _ { \delta , \eta , \{ \nu _ { k } \} _ { k } } c _ { 0 } ( \mathbf { g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ) \leq 1 . +$$ + +By equation 33, we can show that + +$$ +\begin{array} { r l r } & { } & { \underset { \delta , \eta , \{ \nu _ { k } \} _ { k } } { \operatorname* { s u p } } c _ { 2 } ( \mathbf { g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ) \preceq \delta ^ { - 2 } q + \delta ^ { - 1 } \eta q , } \\ & { } & { \underset { \delta , \eta , \{ \nu _ { k } \} _ { k } } { \operatorname* { s u p } } c _ { 3 } ( \mathbf { g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ) \preceq \delta ^ { - 3 } q ^ { 3 / 2 } + \delta ^ { - 2 } \eta q ^ { 3 / 2 } + \delta ^ { - 1 } \eta ^ { 2 } q ^ { 3 / 2 } . } \end{array} +$$ + +Set $\delta = \eta ^ { - 1 } \{ \log K + 4 d \log n ( t _ { 1 } ) \}$ , we obtain + +$$ +\operatorname* { s u p } _ { \eta , \{ \nu _ { k } \} _ { k } } c _ { i } ( \mathbf { g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ) \preceq q ^ { i / 2 } \eta ^ { i } \{ \log ^ { i } K + \log ^ { i } n ( t _ { 1 } ) \} , i = 2 , 3 . +$$ + +Combining equation 37 together with equation 25 and equation 36 yields + +$$ +\begin{array} { r l } & { \underset { \delta , \eta , \{ \nu _ { k } \} _ { k } } { \operatorname* { s u p } } \vert \mathrm { E g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( \mathcal { M } _ { n ( t _ { K } ) } ) - \mathrm { E g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( N ( 0 , V ) ) \vert } \\ { \overset { \mathrm { } } { \to } } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \eta ^ { 3 } \{ \log ^ { 3 } N + \log ^ { 3 } n ( t _ { 1 } ) \} + q ^ { 2 } \eta ^ { 2 } \{ \log ^ { 2 } N + \log ^ { 2 } n ( t _ { 1 } ) \} \delta _ { n ( t _ { 1 } ) } + n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) . } \end{array} +$$ + +This together with equation 34 and equation 35 yields + +$$ +\begin{array} { r l } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \right) \leq 0 \right\} - \mathrm { E g } _ { \delta } \circ \phi _ { \eta , \{ z _ { k , + } ^ { * } \} _ { k } } ( N ( 0 , V ) ) \quad ( 3 ) } \\ { \preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \eta ^ { 3 } \{ \log ^ { 3 } K + \log ^ { 3 } n ( t _ { 1 } ) \} + q ^ { 2 } \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \delta _ { n ( t _ { 1 } ) } + n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) , } \\ & { \mathrm { E g } _ { \delta } \circ \phi _ { \eta , \{ z _ { k , - } ^ { * } \} _ { k } } ( N ( 0 , V ) ) - \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \right) \leq 0 \right\} \quad ( 3 ) } \\ { \preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \eta ^ { 3 } \{ \log ^ { 3 } K + \log ^ { 3 } n ( t _ { 1 } ) \} + q ^ { 2 } \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \delta _ { n ( t _ { 1 } ) } + n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) . } \end{array} +$$ + +Similar to equation 31-equation 35, we can show + +$$ +\begin{array} { r l } & { { \mathrm { E g } } _ { \delta } \circ \phi _ { \eta , \{ z _ { k , + } ^ { * * } \} _ { k } } ( N ( 0 , V ) ) \leq \operatorname* { P r } \left( \phi _ { \eta , \{ z _ { k , + } ^ { * * } \} _ { k } } ( N ( 0 , V ) ) \leq 3 \delta \right) } \\ { \leq } & { \operatorname* { P r } \left( \underset { 1 \leq j \leq L } { \operatorname* { m a x } } \{ d _ { j } ^ { \top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * } \} \leq 3 \delta \right) = \operatorname* { P r } \left( \underset { 1 \leq j \leq L } { \operatorname* { m a x } } \{ d _ { j } ^ { \top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * * } \} \leq 0 \right) , } \\ & { { \mathrm { E g } } _ { \delta } \circ \phi _ { \eta , \{ z _ { k , - } ^ { * * } \} _ { k } } ( N ( 0 , V ) ) \geq \operatorname* { P r } \left( \phi _ { \eta , \{ z _ { k , - } ^ { * * } \} _ { k } } ( N ( 0 , V ) ) \leq 0 \right) } \\ { \geq } & { \operatorname* { P r } \left( \underset { 1 \leq j \leq L } { \operatorname* { m a x } } \{ d _ { j } ^ { \top } N ( 0 , V ) - z _ { k ( j ) , - } ^ { * * * } \} \leq 0 \right) , } \end{array} +$$ + +where + +$= z _ { k , + } ^ { * } + \eta ^ { - 1 } \{ \log K + 4 d \log n ( t _ { 1 } ) \} + 3 \delta \mathrm { ~ a n d ~ } z _ { k , - } ^ { * * * } = z _ { k , - } ^ { * } - \eta ^ { - 1 } \{ \log K + 4 d \log n ( t _ { 1 } ) \} - 3 \delta ,$ for each $k$ . Notice that for any $\{ \nu _ { k } \} _ { k }$ , we have + +$$ +\operatorname* { P r } \left\{ \operatorname* { m a x } _ { k \in \{ 1 , \ldots , K \} } \left( \operatorname* { s u p } _ { x \in \Xi _ { 0 } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - \nu _ { k } \right) \leq 0 \right\} = \operatorname* { P r } \left( \operatorname* { m a x } _ { 1 \leq j \leq L } \{ d _ { j } ^ { \top } N ( 0 , V ) - \nu _ { k ( j ) } \} \leq 0 \right) . +$$ + +This together with equation 38 and equation 39 yields + +$$ +\begin{array} { r l r } & { } & { \mathrm { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { R } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \right) \leq 0 \right\} - \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { R } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \right) \leq 0 \right\} } \\ & { } & { \preceq \ 3 n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \eta ^ { 3 } \{ \log ^ { 3 } K + \log ^ { 3 } n ( t _ { 1 } ) \} + q ^ { 2 } \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \delta _ { n ( t _ { 1 } ) } + n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) \delta _ { n ( t _ { 1 } ) } } \\ & { } & { \mathrm { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { R } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \right) \leq 0 \right\} - \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { R } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \right) \leq 0 \right\} } \\ & { } & { \preceq \lambda n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \eta ^ { 3 } \{ \log ^ { 3 } K + \log ^ { 3 } n ( t _ { 1 } ) \} + q ^ { 2 } \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \delta _ { n ( t _ { 1 } ) } + n ^ { - \alpha _ { 0 } } , } \end{array} +$$ + +In view of equation 29, we have shown that + +$$ +\begin{array} { r l r } & { } & { \mathrm { P r } \left\{ \underset { k \in \{ 1 , \dots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) B ( t _ { k } ) - z _ { k } \right) \leq 0 \right\} - \mathrm { P r } \left\{ \underset { k \in \{ 1 , \dots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \right) \leq 0 \right\} } \\ & { } & { \qquad \preceq \lambda \mathrm { \Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \eta ^ { 3 } \{ \log ^ { 3 } K + \log ^ { 3 } n ( t _ { 1 } ) \} + q ^ { 2 } \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \delta _ { n ( t _ { 1 } ) } + n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) , } \\ & { } & { \mathrm { P r } \left\{ \underset { k \in \{ 1 , \dots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \right) \leq 0 \right\} - \mathrm { P r } \left\{ \underset { k \in \{ 1 , \dots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } } { \operatorname* { m p } } \varphi ^ { \top } ( x ) B ( t _ { k } ) - z _ { k } \right) \leq 0 \right\} } \\ & { } & { \qquad \preceq \lambda \mathrm { \Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \eta ^ { 3 } \{ \log ^ { 3 } K + \log ^ { 3 } n ( t _ { 1 } ) \} + q ^ { 2 } \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \delta _ { n ( t _ { 1 } ) } + n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) . } \end{array} +$$ + +The covariance matrix $\operatorname { C o v } ( G ( t _ { k } ) )$ is given by $\begin{array} { r } { \sum _ { a \in \{ 0 , 1 \} } \sum _ { a } ^ { - 1 } \Phi _ { a } \Sigma _ { a } ^ { - 1 } } \end{array}$ and is nonsingular by Lemma 4. In addition, we have $\| \varphi ( x ) \| _ { 2 } \geq \bar { c } , \forall x \in \mathbb { X } _ { 0 }$ , by Condition A3. Thus, there exists some constant $c _ { * } > 0$ such that + +$$ +c _ { * } \leq \varphi ^ { \top } ( x ) \left( \sum _ { a \in \{ 0 , 1 \} } \Sigma _ { a } ^ { - 1 } \Phi _ { a } \Sigma _ { a } ^ { - 1 } \right) ^ { 1 / 2 } \varphi ( x ) , \forall x \in \mathbb { X } _ { 0 } . +$$ + +By Theorem 1 of Chernozhukov et al. (2017), we obtain that + +$$ +\begin{array} { r l } & { \operatorname* { p } _ { \mathrm { { r } } } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * * } \right) \leq 0 \right\} - \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \right) \leq 0 \right\} } \\ & { \ l ^ { - 1 } \{ \log K + \log n ( t _ { 1 } ) \} ^ { 3 / 2 } + q \delta _ { n ( t _ { 1 } ) } \{ \log K + \log n ( t _ { 1 } ) \} ^ { 1 / 2 } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } \{ \log K + \log n ( t _ { 1 } ) \} } \end{array} +$$ + +Thus, we obtain + +$$ +\begin{array} { r l } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathfrak { X } } { \operatorname* { m a x } } \varphi ^ { \top } ( x ) B ( t _ { k } ) - z _ { k } \right) \leq 0 \right\} - \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathfrak { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - z _ { k } \right) \leq 0 \right\} \bigg | } \\ & { \ i ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \eta ^ { 3 } \{ \log ^ { 3 } K + \log ^ { 3 } n ( t _ { 1 } ) \} + q ^ { 2 } \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \delta _ { n ( t _ { 1 } ) } + n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) } \\ & { \ j ^ { - 1 } \{ \log K + \log n ( t _ { 1 } ) \} ^ { 3 / 2 } + q \delta _ { n ( t _ { 1 } ) } \{ \log K + \log n ( t _ { 1 } ) \} ^ { 1 / 2 } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } \{ \log K + \log n ( t _ { 1 } ) \} } \end{array} +$$ + +Setting $\eta = \operatorname* { m i n } ( q ^ { - 3 / 4 } n ^ { 1 / 8 } ( t _ { 1 } ) \log ^ { - 3 / 8 } \{ K n ( t _ { 1 } ) \} , q ^ { - 1 } n ^ { - \alpha _ { 0 } / 3 } ( t _ { 1 } ) \log ^ { - \alpha _ { 0 } / 3 - 1 / 6 } \{ K n ( t _ { 1 } ) \} )$ yields the desired results. The proof is hence completed. + +# E.3 PROOF OF LEMMA 3 + +The assertion trivially holds for $j = 1$ . We prove it holds for any $j \geq 2$ , by induction. By (A2), we have $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , \overset { \cdot } { Y _ { j } ^ { * } } ( 1 ) ) \overset { } { \bot } \overset { } { A _ { 1 } } | X _ { 1 }$ . Since $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \perp ( X _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )$ , this further implies $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \perp { \cal A } _ { 1 }$ and hence $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \perp ( X _ { 1 } , A _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )$ . By (A1), $Y _ { 1 }$ is completely determined by $A _ { 1 }$ , $Y _ { 1 } ^ { * } ( \bar { 0 } )$ and $Y _ { 1 } ^ { * } ( 1 )$ . Therefore, we obtain $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \perp F _ { 1 }$ . + +Suppose we have shown that $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ \bot ~ \mathcal { F } _ { k }$ for some $k \ < \ j \ - \ 1$ . To prove $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \ \perp \ \mathcal { F } _ { k + 1 } ,$ , it suffices to show $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ .$ ⊥⊥ $( X _ { k + 1 } , A _ { k + 1 } , Y _ { k + 1 } )$ . By (A1), $Y _ { k + 1 }$ is determined by $A _ { k + 1 }$ , $Y _ { k + 1 } ^ { * } ( 0 )$ and $Y _ { k + 1 } ^ { * } ( 1 )$ . Since $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ .$ ⊥⊥ $( X _ { k + 1 } , Y _ { k + 1 } ^ { * } ( 0 ) , Y _ { k + 1 } ^ { * } ( 1 ) )$ , it suffices to show $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \ \perp \ A _ { k + 1 }$ . This is implied by $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \perp A _ { k + 1 } | X _ { k + 1 } , \mathcal { F } _ { k }$ and that $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \perp \perp X _ { k + 1 } , \mathcal { F } _ { k }$ . The proof is hence completed. + +# E.4 PROOF OF LEMMA 4 + +The assertions + +$$ +\epsilon _ { 0 } \le \lambda _ { \operatorname* { m i n } } [ \mathsf { E } \varphi ( X ) \varphi ^ { \top } ( X ) ] \le \lambda _ { \operatorname* { m a x } } [ \mathsf { E } \varphi ( X ) \varphi ^ { \top } ( X ) ] \le \epsilon _ { 0 } ^ { - 1 } , +$$ + +and + +$$ +\operatorname* { s u p } _ { x } \| \varphi ( x ) \| _ { 1 } \leq \epsilon _ { 0 } ^ { - 1 } \sqrt { q } , +$$ + +for some $0 ~ < ~ \epsilon _ { 0 } ~ < ~ 1$ are directly implied by the conditions that $\lambda _ { \mathrm { m i n } } [ \mathrm { E } \varphi ( X ) \varphi ^ { \top } ( X ) ] \ \asymp \ 1$ , $\lambda _ { \mathrm { m a x } } [ \mathrm { E } \varphi ( X ) \varphi ^ { \top } ( X ) ] \ \asymp \ 1$ , $\begin{array} { r } { \operatorname* { s u p } _ { x } \| \varphi ( x ) \| _ { 1 } \ \leq \ \epsilon _ { 0 } ^ { - 1 } \sqrt { q } } \end{array}$ . Since $\| \varphi ( x ) \| _ { 2 } ~ \leq ~ \| \varphi ( x ) \| _ { 1 }$ , we obtain $\begin{array} { r } { \operatorname* { s u p } _ { x } \| \varphi ( x ) \| _ { 2 } \leq \operatorname* { s u p } _ { x } \| \varphi ( x ) \| _ { 1 } \leq \epsilon _ { 0 } ^ { - 1 } \sqrt { q } } \end{array}$ . + +Under the condition $\begin{array} { r } { \operatorname* { i n f } _ { a , x } \pi ^ { * } ( a , x ) > 0 } \end{array}$ , we can similarly show that $\lambda _ { \operatorname* { m i n } } [ \Sigma _ { a } ] \geq \epsilon _ { 0 }$ for some $\epsilon _ { 0 } > 0$ . + +Since $\lvert Y ^ { * } ( 0 ) \rvert$ and $\lvert Y ^ { * } ( 1 ) \rvert$ are bounded, there exists some constant $0 ~ < ~ \epsilon _ { 0 } ~ < ~ 1$ that satisfies $\begin{array} { r } { \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } | Y ^ { * } ( a ) | \leq \epsilon _ { 0 } ^ { - 1 } } \end{array}$ . Notice that $\varphi ^ { \top } ( x ) \beta _ { a } = \operatorname { E } \{ Y ^ { * } ( a ) | X = x \}$ . Boundedness of $\left| Y ^ { * } ( a ) \right|$ implies that the conditional mean $\operatorname { E } \{ Y ^ { * } ( a ) | X \}$ is a bounded random variable as well. As a result, we obtain $\begin{array} { r } { \operatorname* { s u p } _ { x \in \mathbb { X } } \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } | \varphi ^ { \top } ( x ) \beta _ { a } | \leq \epsilon _ { 0 } ^ { - 1 } } \end{array}$ . + +Notice that $\beta _ { a } = \Sigma _ { a } ^ { - 1 } \mathrm { E } \varphi ^ { \top } ( X ) Y ^ { \ast } ( a )$ . Since $\lambda _ { \operatorname* { m i n } } [ \Sigma _ { a } ]$ is bounded away from 0, it suffices to show $\| \mathrm { E } \varphi ^ { \top } ( X ) Y ^ { * } ( a ) \| _ { 2 } \stackrel { } { = } { \cal O } ( 1 )$ , or equivalently, + +$$ +\operatorname* { s u p } _ { \nu \in \mathbb { R } ^ { p } , \| \nu \| _ { 2 } = 1 } | \mathrm { E } \nu ^ { \top } \varphi ( X ) Y ^ { \ast } ( a ) | = O ( 1 ) . +$$ + +By Cauchy-Schwarz inequality, it suffices to show + +$$ +\operatorname* { s u p } _ { \nu \in \mathbb { R } ^ { p } , \| \nu \| _ { 2 } = 1 } \mathrm { E } | Y ^ { * } ( a ) | ^ { 2 } \mathrm { E } | \nu ^ { \top } \varphi ( X ) | ^ { 2 } = O ( 1 ) . +$$ + +Since $| Y ^ { * } ( a ) | = O ( 1 )$ almost surely, we have by the condition $\lambda _ { \operatorname* { m a x } } [ \mathrm { E } \varphi ( X ) \varphi ^ { \top } ( X ) ] = O ( 1 )$ that + +$$ +\operatorname* { s u p } _ { \nu \in \mathbb { R } ^ { p } , \| \nu \| _ { 2 } = 1 } \mathbf { E } | \nu ^ { \top } \varphi ( X ) | ^ { 2 } = \operatorname* { s u p } _ { \nu \in \mathbb { R } ^ { p } , \| \nu \| _ { 2 } = 1 } \nu ^ { \top } \mathbf { E } \varphi ( X ) \varphi ^ { \top } ( X ) \nu \leq \lambda _ { \operatorname* { m a x } } [ \mathbf { E } \varphi ( X ) \varphi ^ { \top } ( X ) ] = O ( 1 ) . +$$ + +The proof is hence completed. + +# E.5 PROOF OF LEMMA 5 + +# E.5.1 PROOF OF EQUATION 14 + +Notice that + +$$ +\begin{array} { r } { \| j ( \widehat { \Sigma } _ { 1 , j } - \Sigma _ { 1 } ) \| _ { 2 } = \left\| \displaystyle \sum _ { i = 1 } ^ { j } \{ A _ { i } \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) - \mathrm { \mathrm { E } } ^ { \mathcal { F } _ { i - 1 } } \pi _ { i - 1 } ( 1 , X ) \varphi ( X ) \varphi ^ { \top } ( X ) \} \right\| _ { 2 } } \\ { + j \left\| \mathrm { E } ^ { \mathcal { F } _ { i - 1 } } \varphi ( X ) \varphi ^ { \top } ( X ) \left( \displaystyle \frac { 1 } { j } \displaystyle \sum _ { i = 1 } ^ { j } \pi _ { i - 1 } ( 1 , X ) - \pi ^ { * } ( 1 , X ) \right) \right\| _ { 2 } . } \end{array} +$$ + +By Lemma 4, we have + +$$ +\begin{array} { r } { \left| { \mathrm { E } } ^ { \mathcal { F } _ { i - 1 } } \varphi ( X ) \varphi ^ { \top } ( X ) \left( \frac { 1 } { j } \displaystyle \sum _ { i = 1 } ^ { j } \pi _ { i - 1 } ( 1 , X ) - \pi ^ { * } ( 1 , X ) \right) \right| \Big | _ { 2 } \leq \varepsilon _ { 0 } ^ { - 2 } q { \mathrm { E } } ^ { \mathcal { F } _ { i - 1 } } \left| \frac { 1 } { j } \displaystyle \sum _ { i = 1 } ^ { j } \pi _ { i - 1 } ( 1 , X ) - \pi ^ { * } ( 1 , X ) \right| } \\ { \leq \varepsilon _ { 0 } ^ { - 2 } q ^ { 2 } j ^ { - \alpha _ { 0 } } \log ^ { \alpha _ { 0 } } j , \forall j \geq . } \end{array} +$$ + +with probability at least $1 - O \big ( j _ { n } ^ { - \alpha _ { 0 } } \big )$ + +Consider the first term on the RHS of equation 42. For any $i \geq 1$ , define $M _ { i } = \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ A _ { i } -$ $\pi _ { i - 1 } ( 1 , X _ { i } ) \}$ . Notice that $\{ M _ { i } \} _ { i \geq 1 }$ forms a martingale difference sequence with respect to the filtration $\{ \sigma ( \mathcal { F } _ { i - 1 } ) : i \ge 2 \}$ , since + +$$ +\begin{array} { r l } & { \mathbb { E } [ \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ A _ { i } - \pi _ { i - 1 } ( X _ { i } ) \} \vert \mathcal { F } _ { i - 1 } ] } \\ { = } & { \mathbb { E } ^ { \mathcal { F } _ { i - 1 } } [ \mathbb { E } ( \varphi ( X _ { i } ) \varphi ( X _ { i } ) ^ { \top } \{ A _ { i } - \pi _ { i - 1 } ( X _ { i } ) \} \vert \mathcal { F } _ { i - 1 } , X _ { i } ) ] = 0 , } \end{array} +$$ + +where $\mathrm { E } ^ { \mathcal { F } _ { i } , { X } _ { i } }$ denotes the conditional expectation given $X _ { i }$ and ${ \mathcal { F } } _ { i }$ . Here, the first equality is due to that $X _ { i } \perp \perp F _ { i - 1 }$ , implied by Lemma 3. Under the given conditions on the basis function $\varphi ( \cdot )$ , using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that the following event occurs with probability at least $1 - O ( j ^ { - 2 } )$ , + +$$ +\left\| \sum _ { i = 1 } ^ { j } M _ { i } \right\| _ { 2 } \preceq \sqrt { q j \log ( j ) } . +$$ + +Notice that $\textstyle \sum _ { k \geq j } k ^ { - 2 } \leq j ^ { - 2 } + \sum _ { k > j } \{ k ( k - 1 ) \} ^ { - 1 } = j ^ { - 2 } + j ^ { - 1 }$ . Thus, the following occurs with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ , + +$$ +\left\| \sum _ { i = 1 } ^ { j } \{ A _ { i } \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) - \mathbf { E } ^ { \mathcal { F } _ { i - 1 } } \pi _ { i - 1 } ( 1 , X ) \varphi ( X ) \varphi ^ { \top } ( X ) \} \right\| _ { 2 } \preceq \sqrt { q j \log j } , ~ \forall j \geq j _ { n } . +$$ + +It follows that + +$$ +\begin{array} { r } { \| \big ( \widehat { \Sigma } _ { 1 , k } - \Sigma _ { 1 } \big ) \| _ { 2 } \preceq q \delta _ { k } + \sqrt { q k ^ { - 1 } \log k } , \forall k \geq j _ { n } , } \end{array} +$$ + +with probability at least $1 - O ( j ^ { - \alpha _ { 0 } } )$ . Similarly, we can show + +$$ +\begin{array} { r } { \| \big ( \widehat { \Sigma } _ { 0 , k } - \Sigma _ { 0 } \big ) \| _ { 2 } \preceq q \delta _ { k } + \sqrt { q k ^ { - 1 } \log k } , \forall k \geq j _ { n } , } \end{array} +$$ + +with probability at least $1 - O \big ( j _ { n } ^ { - \alpha _ { 0 } } \big )$ . The proof is hence completed. + +# E.5.2 PROOF OF EQUATION 15 + +When $j _ { n }$ satisfies $j _ { n } ^ { \alpha _ { 0 } } / \log ^ { \alpha _ { 0 } } ( j _ { n } ) \gg q ^ { 2 }$ , it follows from equation 14 and equation 40 that + +$$ +\begin{array} { r } { \lambda _ { \operatorname* { m i n } } [ \widehat { \Sigma } _ { a , k } ] \geq \lambda _ { \operatorname* { m i n } } [ \Sigma _ { a } ] - \Vert \widehat { \Sigma } _ { a , k } - \Sigma _ { a } \Vert _ { 2 } \geq 2 ^ { - 1 } \varepsilon _ { 0 } , \forall k \geq j _ { n } , } \end{array} +$$ + +with probability at least $1 - O \big ( j _ { n } ^ { - \alpha _ { 0 } } \big )$ . Combining equation 40 with equation 45 and equation 14, we obtain + +$$ +\begin{array} { r l r } & { } & { \Vert \widehat { \Sigma } _ { a , k } ^ { - 1 } - \Sigma _ { a } ^ { - 1 } \Vert _ { 2 } = \Vert \widehat { \Sigma } _ { a , k } ^ { - 1 } ( \widehat { \Sigma } _ { a , k } - \Sigma _ { a } ) \Sigma _ { a } ^ { - 1 } \Vert _ { 2 } \leq \lambda _ { \operatorname* { m i n } } [ \Sigma _ { a } ] \lambda _ { \operatorname* { m i n } } [ \widehat { \Sigma } _ { a , k } ) \Vert \widehat { \Sigma } _ { a , k } - \Sigma _ { a } \Vert _ { 2 } } \\ & { } & { \preceq q \delta _ { k } + \sqrt { q k ^ { - 1 } \log k } , \forall k \geq j _ { n } , } \end{array} +$$ + +with probability at least $1 - O \big ( j _ { n } ^ { - \alpha _ { 0 } } \big )$ . The proof is hence completed. + +# E.6 PROOF OF LEMMA 6 + +For any $l \in \{ 1 , \ldots , q \}$ and $i \geq 1$ , define $M _ { i } ( l ) = \varphi ^ { ( l ) } ( X _ { i } ) A _ { i } \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } \}$ . Here, $\varphi ^ { ( l ) } ( X _ { i } )$ corresponds to the $l$ -th element of $\varphi ( X _ { i } )$ . Similar to equation 43, we can show $\{ \dot { M } _ { i } ( l ) \} _ { i \geq 1 }$ forms a martingale difference sequence with respect to the filtration $\{ \sigma ( \mathcal { F } _ { i - 1 } ) : i \ge 1 \}$ . By equation 43, we have for any $l$ , + +$$ +\begin{array} { r } { \mathbb { E } \{ \varphi ^ { ( l ) } ( X _ { i } ) \} ^ { 2 } \le \lambda _ { \operatorname* { m a x } } [ \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) ] \le \epsilon _ { 0 } ^ { - 1 } . } \end{array} +$$ + +Notice that + +$$ +\begin{array} { r l } & { \mathbb { E } \{ M _ { i } ^ { 2 } ( l ) | \mathcal { F } _ { i - 1 } \} = \mathbb { E } [ \{ \varphi ^ { ( l ) } ( X _ { i } ) \} ^ { 2 } A _ { i } \{ Y _ { i } ^ { * } ( 1 ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } \} ^ { 2 } | \mathcal { F } _ { i - 1 } ] } \\ { \le } & { \mathbb { E } [ \{ \varphi ^ { ( l ) } ( X _ { i } ) \} ^ { 2 } \{ Y _ { i } ^ { * } ( 1 ) - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } \} ^ { 2 } | \mathcal { F } _ { i - 1 } ] = \mathbb { E } \sigma ^ { 2 } ( 1 , X _ { i } ) \{ \varphi ^ { ( l ) } ( X _ { i } ) \} ^ { 2 } } \\ { \le } & { 4 \epsilon _ { 0 } ^ { - 2 } \mathbb { E } \{ \varphi ^ { ( l ) } ( X _ { i } ) \} ^ { 2 } \le 4 \epsilon _ { 0 } ^ { - 3 } , } \end{array} +$$ + +where the first equality is due to (A1), the first inequality is due to that $A$ is bounded between 0 and 1, the second equality follows from Lemma 3, the second inequality follows from Lemma 4, and the last inequality is due to equation 46. It follows that + +$$ +\sum _ { i = 1 } ^ { k } \operatorname { E } \{ M _ { i } ^ { 2 } ( l ) | \mathcal { F } _ { i - 1 } \} \leq 4 k \epsilon _ { 0 } ^ { - 3 } . +$$ + +Similarly, by (A1) and Lemma 4, we have + +$$ +\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) \leq 4 \epsilon _ { 0 } ^ { - 2 } \sum _ { i = 1 } ^ { k } \{ \psi ^ { ( l ) } ( X _ { i } ) \} ^ { 2 } . +$$ + +Similar to equation 44, we can show with probability at least $1 - O ( j ^ { - 1 } )$ that + +$$ +\sum _ { i = 1 } ^ { k } [ M _ { i } ^ { 2 } ( l ) - \mathtt { E } \{ M _ { i } ^ { 2 } ( l ) | \mathcal { F } _ { i - 1 } \} ] \preceq \sqrt { q k \log k } , \forall k \ge j . +$$ + +Thus, for any sequence $j _ { n }$ that satisfies $j _ { n } / \log ( j _ { n } ) \gg q$ , we have by equation 47 that + +$$ +\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) + \sum _ { i = 1 } ^ { k } \mathrm { E } \{ M _ { i } ^ { 2 } ( l ) | \mathcal { F } _ { i - 1 } \} \leq \bar { c } k , \forall k \geq j _ { n } , +$$ + +for some constant $\bar { c } > 0$ , with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . It follows that + +$$ +\begin{array} { r l } & { \mathbb { P } _ { \mathbb { P } } ( \underset { \mathrm { S t } } { \bigcap } \underset { s = 1 } { \overset { k } { \sum } } M _ { i } ( \ell ) \leq 2 \sqrt { \ 6 \mathbb { k } } \log k ) \Bigg \} } \\ & \mathbb { P } _ { \mathbb { P } } ( \{ \underset { s = 2 } { \bigcap } \underset { s = 1 } { \overset { k } { \prod } } \frac { \lambda } { \underset { s = 1 } { \prod } } ( \lambda ) \leq 2 \sqrt { 6 \mathbb { k } \mathbb { k } \log k } \} \prod _ { s = 2 } \Biggl \{ \underset { s = 1 } { \overset { k } { \prod } } \underset { s = 1 } { \overset { k } { \sum } } \big [ M _ { i } ^ { 2 } ( \ell ) + \frac { 4 \lambda _ { i } ^ { 2 } ( \ell ) ( \ell ) ( \mathcal { F } _ { i - 1 } ) } { \underset { s = 1 } { \overset { k } { \prod } } } ] \leq \mathbb { e } \mathbb { k } \} \Bigg \} \\ & { \mathcal { O } _ { \mathbb { Q } ^ { ( - 1 ) } } ^ { - 1 } \succeq \mathbb { P r } ( \{ \underset { \mathrm { S t } \geq \delta _ { i } } { \bigcap } \underset { s = 1 } { \overset { k } { \sum } } ( \lambda ) ^ { \frac { \ell } { \ell } } ( \ell ) + \underset { s = 1 } { \overset { k } { \prod } } ( \ell ) ( \mathcal { F } _ { i } ) \underset { s = 1 } { \overset { k } { \sum } } \} \leq \mathbb { E } \mathbb { k } \} \Bigg ) - \mathcal { O } ( \underset { \mathbb { P } } { \longrightarrow } ^ { - 1 } ) } \\ & \mathbb { P } _ { \mathbb { P } } ( \{ \underset { \mathrm { S t } \geq \delta _ { i } } { \bigcup } \underset { s = 1 } { \overset { k } { \sum } } \frac { \lambda } { \underset { s = 1 } { \overset { k } { \prod } } ( \ell ) \leq 2 \sqrt { 6 \mathbb { k } \log \ell } } \} \int \prod _ { s = \underset { i = 1 } { \overset { k } { \sum } } \sum _ { i } \mathcal { M } _ { i } ^ { 2 } ( \ell ) + \underset { s = 1 } { \overset { k } { \sum } } ( \lambda ) ^ { \frac { \ell } { \sum } } ( \ell ) \mathcal { F } _ { i - 1 } \mathbb { I } \} \leq \mathbb { e } \mathbb { k } \Bigg \} ) } \\ & 1 - \mathbb { P } _ \mathbb \end{array} +$$ + +By Bonferroni’s inequality and Theorem 2.1 of Bercu & Touati (2008), we have + +$$ +\begin{array} { r l } & { \operatorname* { P r } ( \displaystyle \bigcap _ { k \geq j _ { n } } \{ \displaystyle \sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | \leq 2 \sqrt { c k \log { k } } \} ) \geq 1 - O ( j _ { n } ^ { - 1 } ) } \\ { - } & { \displaystyle \sum _ { k \geq j _ { n } } \operatorname* { P r } _ { \epsilon } ( \{ | \displaystyle \sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \sqrt { c k \log { k } } \} \bigcap _ { k ^ { \prime } \geq j _ { n } } \{ \displaystyle \sum _ { i = 1 } ^ { k ^ { \prime } } [ \displaystyle M _ { i } ^ { 2 } ( l ) + \{ M _ { i } ^ { 2 } ( l ) | \mathcal { F } _ { i - 1 } \} ] \leq \bar { \alpha } k ^ { \prime } \} \} ) } \\ { \geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - \displaystyle \sum _ { k \geq j _ { n } } \operatorname* { P r } ( \{ | \displaystyle \sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \sqrt { c k \log { k } } \} \bigcap \{ \displaystyle \sum _ { i = 1 } ^ { k } [ \displaystyle M _ { i } ^ { 2 } ( l ) + \{ M _ { i } ^ { 2 } ( l ) | \mathcal { F } _ { i - 1 } \} ] \leq \bar { \alpha } k \} } \\ { \geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - 2 \displaystyle \sum _ { k \geq j _ { n } } \exp ( - \frac { 4 \bar { c } k \log { k } } { 2 \bar { c k } } ) = 1 - O ( j _ { n } ^ { - 1 } ) - \displaystyle \sum _ { k \geq j _ { n } } 2 k ^ { - 2 } . } \end{array} +$$ + +The last term on the RHS of equation 49 is $1 - O ( j _ { n } ^ { - 1 } )$ . To summarize, we have shown that the following event occurs with probability at least $1 - \dot { O } ( j _ { n } ^ { - 1 } )$ , + +$$ +\bigcap _ { k \geq j _ { n } } \left\{ | \sum _ { i = 1 } ^ { k } M _ { i } ( l ) | \leq 2 { \sqrt { { \bar { c } } k \log k } } \right\} . +$$ + +By Bonferroni’s inequality, we have + +$$ +\bigcap _ { k \geq j _ { n } } \left\{ \left. \sum _ { i = 1 } ^ { k } \varphi ( X _ { i } ) A _ { i } \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } \} \right. _ { 2 } \leq 2 \sqrt { \bar { c } q k \log k } \right\} , +$$ + +with probability at least $1 - O ( j _ { n } ^ { - 1 / 2 } )$ . Similarly, we can show + +$$ +\bigcap _ { k \geq j _ { n } } \left\{ \left. \sum _ { i = 1 } ^ { k } \varphi ( X _ { i } ) ( 1 - A _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 0 } \} \right. _ { 2 } \leq c \sqrt { q k \log k } \right\} , +$$ + +for some constant $c > 0$ , with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . The proof is hence completed. + +# E.7 PROOF OF THEOREM 3 + +We state the following lemmas before presenting the proof. + +Lemma 7 Assume the conditions in Theorem 3 hold. Then for any sequence $\{ j _ { n } \} _ { n }$ that satisfies $j _ { n } ^ { \alpha _ { 0 } } / \log ^ { \alpha _ { 0 } } j _ { n } \gg q ^ { 2 }$ , we have with probability at least $1 - O \big ( j _ { n } ^ { - \alpha _ { 0 } } \big )$ that + +$$ +\| \widehat { \beta } _ { a , k } - \beta _ { a } \| _ { 2 } \preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \sqrt { \log k } , \quad \forall a \in \{ 0 , 1 \} , \forall k \geq j _ { n } . +$$ + +Lemma 8 Assume the conditions in Theorem 3 hold. Then for any sequence $\{ j _ { n } \} _ { n }$ that satisfies $j _ { n } ^ { \alpha _ { 0 } } / \log ^ { \alpha _ { 0 } } j _ { n } \gg q ^ { 2 }$ , we have with probability at least $1 - O \big ( j _ { n } ^ { - \alpha _ { 0 } } \big )$ that + +$$ +\begin{array} { r l r } & { } & { \left| \left| \frac { 1 } { k } \displaystyle \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ^ { 2 } - \Phi _ { a } \right| \right| _ { 2 } \preceq q \delta _ { k } + q ^ { 1 / 2 } k ^ { - 1 / 2 } \sqrt { \log k } , } \\ & { } & { \forall a \in \{ 0 , 1 \} , k \geq j _ { n } . } \end{array} +$$ + +Similar to the proof of Theorem 1, we will show the assertion in Theorem 3 holds for any $n ( \cdot )$ that correspond to the realizations of $N ( \cdot )$ that satisfy $n ( t _ { 1 } ) < n ( t _ { 2 } ) < \cdots < n ( t _ { K } )$ . For any $1 \leq k _ { 1 } \leq k _ { 2 } \leq K$ , define + +$$ +\begin{array} { l } { { \displaystyle \widehat { V } ( k _ { 1 } , k _ { 2 } ) = \sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } \mathrm { C o v } \left( \widehat { \beta } _ { 1 } ^ { \mathrm { M B } * } ( t _ { k 1 } ) - \widehat { \beta } _ { 0 } ^ { \mathrm { M B } * } ( t _ { k 1 } ) , \widehat { \beta } _ { 1 } ^ { \mathrm { M B } * } ( t _ { k 2 } ) - \widehat { \beta } _ { 0 } ^ { \mathrm { M B } * } ( t _ { k 2 } ) | \{ ( X _ { i } , A _ { i } , Y _ { i } ) \} _ { i = 1 , \ldots , n } ^ { + \infty } \right) } } \\ { { \displaystyle = \frac { 1 } { \sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \sum _ { a = 0 } ^ { 1 } \sum _ { j = 1 } ^ { k _ { 1 } } \sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \widehat { \Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \widehat { \beta } _ { a } ( t _ { j } ) \} ^ { 2 } \widehat { \Sigma } _ { a } ^ { - 1 } ( t _ { k 1 } ) , } } \end{array} +$$ + +and + +$$ +\widehat { \pmb { V } } = \left( \begin{array} { c c c c } { \widehat { V } ( 1 , 1 ) } & { \widehat { V } ( 1 , 2 ) } & { \ldots } & { \widehat { V } ( 1 , K ) } \\ { \widehat { V } ( 2 , 1 ) } & { \widehat { V } ( 2 , 2 ) } & { \ldots } & { \widehat { V } ( 2 , K ) } \\ { \vdots } & { \vdots } & { \vdots } \\ { \widehat { V } ( K , 1 ) } & { \widehat { V } ( K , 2 ) } & { \ldots } & { \widehat { V } ( K , K ) } \end{array} \right) . +$$ + +We aim to bound the entrywise $\ell _ { \infty }$ norm of $\widehat { V } - V$ where $V$ is defined in equation 22. It suffices to bound $\begin{array} { r l } { \operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } \operatorname* { s u p } _ { b _ { 1 } , b _ { 2 } \in \mathbb { R } ^ { p + 1 } , \| b _ { 1 } \| _ { 2 } = \| b _ { 2 } \| _ { 2 } = 1 } | b _ { 1 } ^ { T } \{ \widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \} b _ { 2 } | } & { = \| b _ { 2 } ^ { T } \{ ( k _ { 2 } , k _ { 2 } ) - V ( k _ { 2 } , k _ { 2 } ) \} b _ { 1 } \| _ { 2 } = \| b _ { 2 } ^ { T } \{ ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \} b _ { 2 } \| } \end{array}$ $\begin{array} { r } { \operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } \| \widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \| _ { 2 } } \end{array}$ . For any $k _ { 1 } , k _ { 2 }$ , we decompose $\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } )$ as + +Vb (k1, k ${ \mathrm { ~ \psi ~ } } _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) = \widehat { V } ( k _ { 1 } , k _ { 2 } ) - \widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) + \widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) + \widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) ,$ where + +$$ +\begin{array} { c } { { k _ { 1 } , k _ { 2 } ) = \displaystyle { \frac { 1 } { \sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \sum _ { a = 0 } ^ { 1 } \sum _ { j = 1 } ^ { k _ { 1 } } \sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \Sigma _ { a } ^ { - 1 } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \widehat \beta _ { a } ( t _ { j } ) \} ^ { 2 } \Sigma _ { a } ^ { - 1 } \mathbb { I } ( X _ { i } ) \varphi ( X _ { i } ) } } } \\ { { \widehat { V } ^ { \ast \ast } ( k _ { 1 } , k _ { 2 } ) = \displaystyle { \frac { 1 } { \sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \sum _ { a = 0 } ^ { 1 } \sum _ { j = 1 } ^ { n ( t _ { k _ { 1 } } ) } \Sigma _ { a } ^ { - 1 } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ^ { 2 } \Sigma _ { a } ^ { - 1 } \mathbb { I } ( X _ { i } ) \varphi ( X _ { i } ) \varphi ( X _ { i } ) \} ^ { 2 } \Sigma _ { a } ^ { - 1 } \mathbb { I } ( X _ { i } ) \varphi ( X _ { i } ) \varphi ( X _ { j } ) } } } \end{array} +$$ + +By Lemma 4 and Lemma 8, we obtain that + +$$ +\begin{array} { r l } & { \underset { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } { \operatorname* { m a x } } \| \hat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \| _ { 2 } } \\ { \leq } & { \underset { 1 \leq k _ { 1 } \leq k _ { 1 } \leq K } { \operatorname* { m a x } } \underset { a = 0 } { \overset { 1 } { \sum } } \Bigg \| \frac { 1 } { n ( t _ { k _ { 1 } } ) } \underset { j = 1 } { \overset { n ( t _ { k _ { 1 } } ) } { \sum } } \underset { 2 = 1 } { \overset { n ( t _ { k } ) } { \sum } } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ^ { 2 } \Sigma _ { a } ^ { - 1 } - \Sigma _ { a } ^ { - 1 } \Phi _ { a } \Sigma _ { a } ^ { - } } \\ { \leq } & { \underset { 1 \leq k _ { 1 } \leq K } { \operatorname* { m a x } } \frac { 1 } { \epsilon _ { 0 } ^ { 2 } } \underset { a = 0 } { \overset { 1 } { \sum } } \Bigg \| \frac { 1 } { n ( t _ { k _ { 1 } } ) } \underset { j = 1 } { \overset { n ( t _ { k _ { 1 } } ) } { \sum } } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ^ { 2 } - \Phi _ { a } \Bigg \| _ { 2 } } \\ { \overset { \leq } } & { q \delta _ { n ( t _ { 1 } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \sqrt { \log n ( t _ { 1 } ) } , } \end{array} +$$ + +with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ . + +Notice that + +$$ +\begin{array} { r l r } { { \sum _ { i = 1 } ^ { n } \operatorname { n u f f } _ { k \to i } \hat { \mathcal { V } } ^ { * } ( k _ { 1 } , k _ { 2 } ) = \sum _ { s = i } ^ { 1 } \sum _ { i = 1 } ^ { k } \sum _ { m \in \{ i , j \} } \Sigma _ { a } ^ { - 1 } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \xi _ { i } - \varphi ^ { \top } ( X _ { i } ) \hat { \mathcal { B } } _ { a } ( t _ { j } ) \big ] ^ { 2 } \Sigma _ { a } ^ { - 1 } } } \\ & { } & { \underset { = 1 } { \overset { k _ { 1 } } { \sum } } \underset { = 1 } { \overset { n ( \cdot ) } { \sum } } \sum _ { i = 1 } ^ { n } \sum _ { ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) } \xi ^ { \top } ( X _ { i } ) \big \{ ( Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } + \varphi ^ { \top } ( X _ { i } ) \beta _ { a } - \varphi ^ { \top } ( X _ { i } ) \hat { \mathcal { B } } _ { a } ( t _ { j } ) \big ) ^ { 2 } \Sigma _ { a } ^ { - 1 } } \\ & { } & { + \sum _ { 1 } ^ { k _ { 1 } } \sum _ { i = 0 } ^ { k } \sum _ { \beta = 1 } ^ { k } \sum _ { \beta = 1 } ^ { k } \sum _ { 0 } ^ { k } \sum _ { 0 } ^ { - 1 } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ \varphi ^ { \top } ( X _ { i } ) \} \hat { \varphi } _ { a } - \varphi ^ { \top } ( X _ { i } ) \hat { \mathcal { B } } _ { a } ( t _ { j } ) \big \} ^ { 2 } \Sigma _ { a } ^ { - 1 } } \\ & { } & + 2 \sum _ { a = 0 } ^ { 1 } \sum _ { i = 1 } ^ { k _ { 1 } } \sum _ { \beta = 1 } ^ { k _ { 2 } } \sum _ { \alpha } ^ { - 1 } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ \varphi ^ { \top } ( X _ { i } ) \beta _ { \alpha } - \varphi ^ { \top } ( X _ { i } \end{array} +$$ + +It follows that + +$$ +\begin{array} { r l } { \displaystyle \operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } \left\| \widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \right\| _ { 2 } } & { { } } \\ { \displaystyle \operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq K } \frac { 1 } { n ( t _ { k _ { 1 } } ) } \left\| \displaystyle \sum _ { a = 0 } ^ { 1 } \sum _ { j = 1 } ^ { k _ { 1 } } \sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \Sigma _ { a } ^ { - 1 } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ \varphi ^ { \top } ( X _ { i } ) \beta _ { a } - \varphi ^ { \top } ( X _ { i } ) \widehat { \beta } _ { a } ( t _ { j } ) \} ^ { \top } \mathbb { I } ( X _ { i } ) \right\| _ { 2 } ^ { 2 } } & { { } } \\ { \displaystyle \operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq K } \frac { 2 } { n ( t _ { k _ { 1 } } ) } \left\| \displaystyle \sum _ { a = 0 } ^ { 1 } \sum _ { j = 1 } ^ { k _ { 1 } } \sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \Sigma _ { a } ^ { - 1 } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \varphi ^ { \top } ( X _ { i } ) ( \beta _ { a } - \varphi ^ { \top } ( X _ { i } ) \mathbb { I } ( X _ { i } ) \mathbb { I } ( \beta _ { a } - \varphi ^ { \top } ( X _ { i } ) \mathbb { I } ( \beta _ { a } ) ) \varphi ( X _ { i } ) \mathbb { I } ( \beta _ { a } ) \right\| _ { 2 } ^ { 2 } } & { { } = 0 } \end{array} +$$ + +By Lemma 4, we obtain that + +$$ +\begin{array} { r l } & { \quad \underset { 1 \leq k \leq k \leq K } { \operatorname* { m a x } } \| \hat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \| _ { 2 } } \\ & { \quad \underset { 1 \leq k \leq K } { \operatorname* { m a x } } \frac { 1 } { K } \| \underset { 2 \leq - 1 : = n ( \{ k _ { 1 } , - 1 \} + 1 ) } { \overset { k _ { 1 } } { \sum } } \mathbb { \overset { n ( k _ { 2 } ) } { \sum } } \mathbb { \overset { \eta ( A _ { i } ) } { = } } \alpha ^ { \top } ( X _ { i } ) \boldsymbol { \varphi } ^ { \top } ( X _ { i } ) \boldsymbol { \{ \varphi } } ^ { \top } ( X _ { i } ) \beta _ { a } - \boldsymbol { \varphi } ^ { \top } ( X _ { i } ) \beta _ { a } ( t _ { 2 } ) \boldsymbol { \} ^ { 2 } \| _ { 2 } } \\ & { \quad \underset { \theta \leq \{ 0 , 1 \} } { \overset { \operatorname* { m a x } } { = } } \frac { 1 } { K } \| \underset { 1 \leq k \leq K } { \sum } \mathbb { \overset { n ( k _ { 1 } ) } { = } } \mathbb { \overset { n ( k _ { 2 } ) } { = } } \mathbb { \overset { n ( k _ { 1 } ) } { = } } \mathbb { \overset { n ( k _ { 2 } ) } { = } } \mathbb { \overset { n ( k _ { 1 } ) } { = } } \mathbb { \overset { n ( k _ { 2 } ) } { = } } \mathbb { \overset { n ( k _ { 1 } ) } { = } } \mathbb { \overset { n ( k _ { 2 } ) } { = } } \mathbb { \overset { n ( k _ { 1 } ) } { = } } \mathbb { \overset { n ( k _ { 2 } ) } { = } } \mathbb { \overset { n ( k _ { 1 } ) } { = } } \mathbb { \overset { n ( k _ { 2 } ) } { = } } \mathbb { \overset { n ( k _ { 1 } ) } { = } } \mathbb { \overset { n ( k _ { 2 } ) } { = } } \mathbb { \overset { n ( k _ { 1 } ) } { = } } } \end{array} +$$ + +By Lemmas 4 and 7, we have with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ that + +$$ +\frac { 1 } { n ( t _ { k _ { 1 } } ) } \| \Psi _ { 1 , a , k _ { 1 } } \| _ { 2 } \preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \log \{ n ( t _ { 1 } ) \} \left\| \frac { 1 } { n ( t _ { k _ { 1 } } ) } \sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \right\| _ { 2 } , +$$ + +Similar to Lemma 5, we can show there exists some constant $c _ { * } > 0$ that + +$$ +\begin{array} { r l } & { \frac { 1 } { n ( t _ { k _ { 1 } } ) } \left\| \displaystyle \sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \mathbb { I } \big ( A _ { i } = a \big ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) - \mathrm { E } ^ { \mathcal { F } _ { i - 1 } } \{ \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \} \big ] \right\| _ { 2 } } \\ & { \quad \quad \leq c _ { * } \{ q \delta _ { n ( t _ { k _ { 1 } } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \sqrt { \log n ( t _ { k _ { 1 } } ) } \} , \forall 1 \leq k _ { 1 } \leq K , a \in \{ 0 , 1 \} , } \end{array} +$$ + +with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ . By Lemma 4, we can show with probability at least $1 - \bar { O } ( n ^ { - 1 } ( t _ { 1 } ) )$ that + +$$ +\operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq K } \frac { 1 } { n ( t _ { k _ { 1 } } ) } \left\| \sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \mathrm { E } ^ { \mathcal { F } _ { i - 1 } } \{ \mathbb I ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \} \right\| _ { 2 } = O ( 1 ) . +$$ + +This together with equation 52 and equation 53 yields + +with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ + +$\begin{array} { r } { n ^ { - 1 } ( t _ { k 1 } ) \| \Psi _ { 1 , a , k _ { 1 } } \| _ { 2 } \preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \log \{ n ( t _ { 1 } ) \} , \forall 1 \leq k _ { 1 } \leq K , a \in \{ 0 , 1 \} , } \end{array}$ . + +Moreover, using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that for any $1 \leq k _ { 1 } \leq K$ , the following event occurs with probability at least $1 - O ( n ^ { - 2 } ( t _ { k _ { 1 } } ) )$ , + +$$ +\frac { 1 } { \iota ( t _ { k _ { 1 } } ) } \left\| \sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \varphi ^ { ( l ) } ( X _ { i } ) \right\| _ { 2 } \preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \sqrt { \log n ( t _ { k _ { 1 } } ) } , +$$ + +$\begin{array} { r } { \sum _ { k _ { 1 } = 1 } ^ { K } n ^ { - 2 } ( t _ { k _ { 1 } } ) \leq n ^ { - 1 } ( t _ { 1 } ) } \end{array}$ $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ + +$$ +\frac { 1 } { \iota ( t _ { k _ { 1 } } ) } \left\| \sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \varphi ^ { ( l ) } ( X _ { i } ) \right\| _ { 2 } \preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \sqrt { \log n ( t _ { k _ { 1 } } ) } , +$$ + +In addition, it follows from Lemma 7 that + +$$ +\begin{array} { r } { n ^ { - 1 } ( t _ { k _ { 1 } } ) \| \Psi _ { 2 , a , k _ { 1 } } \| _ { 2 } \preceq q ^ { 3 / 2 } n ^ { - 1 } ( t _ { 1 } ) \log \{ n ( t _ { 1 } ) \} , \forall 1 \leq k _ { 1 } \leq K , a \in \{ 0 , 1 \} . } \end{array} +$$ + +This together with equation 54 yields that + +$$ +\operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } \Big \| \widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \Big \| _ { 2 } \preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) , +$$ + +with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ . Under the given conditions, we have + +$$ +\operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } \Big \| \widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \Big \| _ { 2 } \preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \log ^ { 1 / 2 } n ( t _ { 1 } ) , +$$ + +with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ + +Moreover, with some calculations, we can show that + +$$ +\begin{array} { r l } & { \underset { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } { \operatorname* { m a x } } \left\| \widehat { V } ( k _ { 1 } , k _ { 2 } ) - \widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \right\| _ { 2 } \leq \underset { a = 0 } { \overset { 1 } { \sum } } \underset { j \geq 1 } { \operatorname* { m a x } } \left\| \Sigma _ { a } ^ { - 1 } - \widehat { \Sigma } _ { a } ^ { - 1 } ( l _ { j } ) \right\| _ { 2 } } \\ { \times } & { \underset { 1 \leq k _ { 1 } \leq K } { \operatorname* { m a x } } \frac { 2 } { n ( t _ { k _ { 1 } } ) } \left\| \underset { j = 1 } { \overset { k _ { 1 } } { \sum } } \underset { i = n ( t _ { j - 1 } ) + 1 } { \overset { n ( t _ { j } ) } { \sum } } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \widehat { \beta } _ { a } ( t _ { j } ) \} ^ { 2 } \Sigma _ { a } ^ { - 1 } \right\| _ { 2 } } \\ { + } & { \underset { a = 0 } { \overset { 1 } { \sum } } \underset { 1 \leq k _ { 1 } \leq K } { \operatorname* { m a x } } \frac { 1 } { n ( t _ { k _ { 1 } } ) } \left\| \underset { j = 1 } { \overset { k _ { 1 } } { \sum } } \underset { i = n ( t _ { j - 1 } ) + 1 } { \overset { n ( t _ { i } ) } { \sum } } \Sigma _ { a } ^ { - 1 } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \widehat { \beta } _ { a } ( t _ { j } ) \} ^ { 2 } \Sigma _ { a } ^ { - 1 } \right\| } \\ { \times } & { \underset { j \geq 1 } { \operatorname* { m a x } } \| \Sigma _ { a } ^ { - 1 } - \widehat { \Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \| _ { 2 } ^ { 2 } . } \end{array} +$$ + +In view of Lemma 4 and Lemma 5, we have with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ that + +$$ +\begin{array} { r l } & { \underset { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } { \operatorname* { m a x } } \left\| \widehat { V } ( k _ { 1 } , k _ { 2 } ) - \widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \right\| _ { 2 } \leq O ( 1 ) ( q \delta _ { n ( t _ { 1 } ) } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } ) } \\ { \times } & { \underset { 1 \leq k _ { 1 } \leq K } { \operatorname* { m a x } } \frac { 1 } { n ( t _ { k _ { 1 } } ) } \left\| \underset { \underset { j = 1 } { \overset { k _ { 1 } } { \sum } } i = n ( t _ { j - 1 } ) + 1 } { \overset { n ( t _ { j } ) } { \sum } } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \widehat { \beta } _ { a } ( t _ { j } ) \} ^ { 2 } \right\| , } \end{array} +$$ + +where $O ( 1 )$ denotes some positive constant. Similar to equation 50 and equation 55, we can show with probability at least $1 \stackrel { - } { - } O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ that + +$$ +\operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq K } \left\| { \frac { 1 } { n ( t _ { k _ { 1 } } ) } } \Psi _ { 3 , a , k _ { 1 } } - \Psi _ { a } \right\| _ { 2 } = o ( 1 ) . +$$ + +Similar to Lemma 4, we can show $\begin{array} { r } { \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \| \Psi _ { a } \| _ { 2 } = O ( 1 ) } \end{array}$ . It follows that + +$$ +\operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } \Big \| \widehat { V } ( k _ { 1 } , k _ { 2 } ) - \widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \Big \| _ { 2 } \preceq q \delta _ { n ( t _ { 1 } ) } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } , +$$ + +with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ . Combining this together with equation 50 and equation 55, we obtain with probability at least $1 - \dot { O } ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ that + +$$ +\operatorname* { m a x } _ { 1 \leq k _ { 1 } \leq k _ { 2 } \leq K } \left\| { \widehat { V } } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \right\| _ { 2 } \preceq q \delta _ { n ( t _ { 1 } ) } + { \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } } . +$$ + +Consider the function $\mathbf { g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } }$ defined in the proof of Theorem 1. We fix $\delta = \eta ^ { - 1 } \{ \log K +$ $4 d \log n ( t _ { 1 } ) \}$ . Based on Lemma A2 in Belloni $\&$ Oliveira (2018), we have with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ that + +$$ +\begin{array} { r l r } & { } & { \underset { \{ \nu _ { k } \} _ { k } } { \operatorname* { s u p } } \left| { \mathbf E } ^ { * } { \mathbf g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( N ( 0 , \widehat { V } ) ) - { \mathbf E } { \mathbf g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k } \} _ { k } } ( N ( 0 , { \pmb V } ) ) \right| } \\ & { } & { \preceq q \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \left( q \delta _ { n ( t _ { 1 } ) } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } \right) , } \end{array} +$$ + +where $\mathbf { E } ^ { \ast }$ denotes the expectation conditional on the observed data. For a given set of thresholds $\{ \nu _ { k } \} _ { k }$ , using similar arguments in proving equation 31, equation 32, equation 34 and equation 35, we can show with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ that + +$$ +\begin{array} { r l } & { \operatorname* { P r } ^ { * } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \sqrt { n ( t _ { k } ) } \widehat { S } ^ { \scriptscriptstyle { \mathrm { M B } * } } - \nu _ { k } \right) \le 0 \right\} \le \mathrm { E } ^ { * } \mathtt { g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k , + } \} _ { k } } ( N ( 0 , \widehat { V } ) ) } \\ { \le } & { \mathrm { E } \underline { { \mathtt { g } } } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k , + } \} _ { k } } ( N ( 0 , V ) ) + O ( 1 ) q \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \left( q \delta _ { n ( t _ { 1 } ) } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } \right) } \\ { \le } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \overline { { \mathtt { X } } } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - \nu _ { k , + } ^ { * } \right) \le 0 \right\} } \\ { + } & { O ( 1 ) q \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \left( q \delta _ { n ( t _ { 1 } ) } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } \right) , } \end{array} +$$ + +and + +$$ +\begin{array} { r l } & { \operatorname* { P r } ^ { * } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \sqrt { n ( t _ { k } ) } \widehat { S } ^ { \scriptscriptstyle { \mathrm { M B } * } } - \nu _ { k } \right) \leq 0 \right\} \geq \mathrm { E } ^ { * } \mathrm { g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k , - } \} _ { k } } ( N ( 0 , \widehat { V } ) ) } \\ { \geq } & { \mathrm { E } \mathrm { g } _ { \delta } \circ \phi _ { \eta , \{ \nu _ { k , - } \} _ { k } } ( N ( 0 , V ) ) - O ( 1 ) q \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \left( q \delta _ { n ( t _ { 1 } ) } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } \right) } \\ { \geq } & { \operatorname* { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - \nu _ { k , - } ^ { * } \right) \leq 0 \right\} } \\ { - } & { O ( 1 ) q \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} \left( q \delta _ { n ( t _ { 1 } ) } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } \right) , } \end{array} +$$ + +where $O ( 1 )$ denotes some positive constant, and + +$$ +\begin{array} { r l } & { \nu _ { k , + } = \nu _ { k } + \eta ^ { - 1 } \{ 4 d \log n ( t _ { 1 } ) + \log K \} + \bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \nu _ { k , + } ^ { * } = \nu _ { k , + } + 3 \eta ^ { - 1 } \{ 4 d \log n ( t _ { 1 } ) + \log K \} } \\ & { \nu _ { k , - } = \nu _ { k } - 3 \eta ^ { - 1 } \{ 4 d \log n ( t _ { 1 } ) + \log K \} - \bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \nu _ { k , - } ^ { * } = \nu _ { k , - } - \eta ^ { - 1 } \{ 4 d \log n ( t _ { 1 } ) + \log K \} } \end{array} +$$ + +By Theorem 2 of Chernozhukov et al. (2017), we obtain that + +$$ +\begin{array} { r } { \mathtt { p } _ { \mathrm { T } } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - \nu _ { k , + } ^ { * } \right) \le 0 \right\} - \mathtt { P r } \left\{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } \left( \underset { x \in \mathbb { X } _ { 0 } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - \nu _ { k , - } ^ { * } \right) \le 0 \right\} } \\ { \preceq \eta ^ { - 1 } \{ \log ^ { 3 / 2 } n ( t _ { 1 } ) + \log ^ { 3 / 2 } K \} + \bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \{ \log ^ { 1 / 2 } n ( t _ { 1 } ) + \log ^ { 1 / 2 } K \} . } \end{array} +$$ + +It follows that + +$$ +\begin{array} { r } { \underset { \nu _ { k } \not \mathrm { J } _ { k } } { \operatorname* { s u p } } | { \operatorname* { P r } } ^ { * } \{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } ( \sqrt { n ( t _ { k } ) } \widehat { S } ^ { \mathrm { M B } * } - \nu _ { k } ) \leq 0 \} - { \operatorname* { P r } } \{ \underset { k \in \{ 1 , \ldots , K \} } { \operatorname* { m a x } } ( \underset { x \in \mathbb { X } } { \operatorname* { s u p } } \varphi ^ { \top } ( x ) G ( t _ { k } ) - \nu _ { k } ) \leq 0 \} } \\ { \preceq q \eta ^ { 2 } \{ \log ^ { 2 } K + \log ^ { 2 } n ( t _ { 1 } ) \} ( q \delta _ { n ( t _ { 1 } ) } + \sqrt { q n ^ { - 1 } ( t _ { 1 } ) \log n ( t _ { 1 } ) } ) } \\ { + \eta ^ { - 1 } \{ \log ^ { 3 / 2 } n ( t _ { 1 } ) + \log ^ { 3 / 2 } K \} + \bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \{ \log ^ { 1 / 2 } n ( t _ { 1 } ) + \log ^ { 1 / 2 } K \} } \end{array} +$$ + +with probability at least $1 - O ( n ^ { - \alpha _ { 0 } } ( t _ { 1 } ) )$ . Set + +$$ +\eta = \operatorname* { m i n } [ q ^ { - 1 } n ^ { \alpha _ { 0 } / 3 } ( t _ { 1 } ) \log ^ { - ( 1 + 2 \alpha _ { 0 } ) / 6 } \{ K n ( t _ { 1 } ) \} , q ^ { - 1 / 2 } n ^ { 1 / 6 } ( t _ { 1 } ) \log ^ { - 1 / 3 } \{ K n ( t _ { 1 } ) \} ] , +$$ + +we obtain the desired result. + +# E.8 PROOF OF LEMMA 7 + +Combining Lemma 6 with Lemma 4 yields that + +$$ +\left. \Sigma _ { a } ^ { - 1 } \left( \frac { 1 } { k } \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \right) \right. _ { 2 } \preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \sqrt { \log k } , \forall k \geq j _ { n } , a \in \{ 0 , 1 \} , +$$ + +with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . Combining this together with equation 16 yields that + +$$ +\begin{array} { r } { \| \widehat { \beta } _ { a , k } - \beta _ { a } \| _ { 2 } \preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \sqrt { \log k } , \forall k \geq j _ { n } , a \in \{ 0 , 1 \} , } \end{array} +$$ + +with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . The proof is hence completed. + +# E.9 PROOF OF LEMMA 8 + +Notice that + +$$ +\begin{array} { r l } & { \left\| \frac { 1 } { k } \displaystyle \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) ( Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } ) ^ { 2 } - \Phi _ { a } \right\| _ { 2 } } \\ { \le } & { \left\| \frac { 1 } { k } \displaystyle \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) [ \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ^ { 2 } - \sigma ^ { 2 } ( a , X _ { i } ) ] \right\| _ { 2 } } \\ { + } & { \left\| \frac { 1 } { k } \displaystyle \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \sigma ^ { 2 } ( a , X _ { i } ) - \Phi _ { a } \right\| _ { 2 } . } \end{array} +$$ + +Similar to the proof of Lemma 5, we can show that the second term on the RHS of equation 56 is of the order $O ( q \delta _ { k } + \sqrt { q k ^ { - 1 } \log k } )$ , for any $a \in \{ 0 , 1 \}$ and any $k \geq j _ { n }$ , with probability at least $1 - O \big ( j _ { n } ^ { - \alpha _ { 0 } } \big )$ . As for the first term, notice that each element in the matrix + +$$ +\frac { 1 } { k } \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) \{ ( Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } ) ^ { 2 } - \sigma ^ { 2 } ( a , X _ { i } ) \} +$$ + +corresponds to a martingale with respect to the filtration $\{ \sigma ( \mathcal { F } _ { i - 1 } ) : i \ge 1 \}$ , under (A1) and (A2). Using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that + +$$ +\left. \frac { 1 } { k } \sum _ { i = 1 } ^ { k } \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) [ \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} ^ { 2 } - \sigma ^ { 2 } ( a , X _ { i } ) ] \right. _ { 2 } \preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \sqrt { \log k } , +$$ + +with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . The proof is hence completed. + +# E.10 PROOF OF LEMMA 2 + +We begin by providing an upper bound for $\begin{array} { r } { \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \| \widehat { \beta } _ { a , k } - \beta _ { a } \| _ { 2 } } \end{array}$ . With some calculations, we have + +$$ +\begin{array} { r } { \displaystyle \underset { a \in \{ 0 , 1 \} } { \operatorname* { m a x } } \| \widehat { \beta } _ { a , k } - \beta _ { a } \| _ { 2 } = \displaystyle \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \frac { 1 } { k } \left\| \widehat { \boldsymbol { \Sigma } } _ { a , k } ^ { - 1 } \left( \displaystyle \sum _ { i = 1 } ^ { k } \varphi ( X _ { i } ) \mathbb { I } ( A _ { i } = a ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \right) \right\| _ { 2 } } \\ { \leq \displaystyle \operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \left\| \widehat { \boldsymbol { \Sigma } } _ { a , k } ^ { - 1 } \right\| _ { 2 a \in \{ 0 , 1 \} } \displaystyle \operatorname* { m a x } _ { k } \left\| \displaystyle \sum _ { i = 1 } ^ { k } \varphi ( X _ { i } ) \mathbb { I } ( A _ { i } = a ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \right\| _ { 2 } . } \end{array} +$$ + +By Lemma 6, we obtain with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ that + +$$ +\operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \frac { 1 } { k } \left. \sum _ { i = 1 } ^ { k } \varphi ( X _ { i } ) \mathbb { I } ( A _ { i } = a ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \right. _ { 2 } \preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \sqrt { \log k } , \forall k \geq j _ { n } . +$$ + +Similarly, we can show with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ that + +$$ +\operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \frac { 1 } { k } \left\| \sum _ { i = 1 } ^ { k } \varphi ( X _ { i } ) \mathbb { I } ( A _ { i } = a ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { a } \} \right\| _ { 2 } \preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \sqrt { \log j _ { n } } , +$$ + +Similar to equation 42, we have + +$$ +\begin{array} { r l r } & { } & { \underset { a \in \{ 0 , 1 \} } { \operatorname* { m a x } } ~ \lambda _ { \mathrm { m i n } } [ \widehat { \Sigma } _ { a , k } ] \geq \underset { a \in \{ 0 , 1 \} } { \operatorname* { m i n } } ~ \lambda _ { \mathrm { m i n } } \left( \mathrm { E } ^ { \mathcal { F } _ { i - 1 } } \varphi ( X ) \varphi ^ { \top } ( X ) \frac { 1 } { k } \underset { i = 1 } { \overset { k } { \sum } } \pi _ { i - 1 } ( a , X ) \right) } \\ & { } & { - \underset { a \in \{ 0 , 1 \} } { \operatorname* { m a x } } ~ \frac { 1 } { k } \left\| \sum _ { i = 1 } ^ { k } \{ \mathbb { I } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) - \mathrm { E } ^ { \mathcal { F } _ { i - 1 } } \pi _ { i - 1 } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X ) \} \right\| _ { 2 } . } \end{array} +$$ + +Using similar arguments in proving equation 44, we can show that + +$$ +\operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \left\| \sum _ { i = 1 } ^ { k } \{ { \mathbb { I } } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) - \mathbf { E } ^ { \mathcal { F } _ { i - 1 } } \pi _ { i - 1 } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X ) \} \right\| _ { 2 } \preceq \sqrt { q k \log k } , +$$ + +with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . Similarly, we can show + +$$ +\operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \left\| \sum _ { i = 1 } ^ { k } \{ { \mathbb { I } } ( A _ { i } = a ) \varphi ( X _ { i } ) \varphi ^ { \top } ( X _ { i } ) - \mathbf { E } ^ { \mathcal { F } _ { i - 1 } } \pi _ { i - 1 } ( a , X ) \varphi ( X ) \varphi ^ { \top } ( X ) \} \right\| _ { 2 } \preceq \sqrt { q k \log j _ { n } } , +$$ + +with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ + +Without loss of generality, assume $\varepsilon _ { 0 } \leq 1 / 2$ . Notice that we have $\pi _ { i - 1 } ( a , x ) \geq \varepsilon _ { 0 }$ , for any $a \in$ $\{ 0 , 1 \} , x \in \mathbb { X }$ and $i \geq N _ { 0 }$ . This together with Lemma equation 4 implies that + +$$ +\operatorname* { i n f } _ { a \in \{ 0 , 1 \} , n \geq j _ { n } } \lambda _ { \operatorname* { m i n } } \left( \mathrm { E } ^ { \mathcal { F } _ { i - 1 } } \varphi ( X ) \varphi ^ { \top } ( X ) \frac { 1 } { n } \sum _ { i = 1 } ^ { n } \pi _ { i - 1 } ( a , X ) \right) \geq \frac { n - N _ { 0 } } { n } \varepsilon _ { 0 } \geq \frac { j - N _ { 0 } } { j } \varepsilon _ { 0 } . +$$ + +Combining this together with equation 60 and equation 61 yields + +$$ +\operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \lambda _ { \operatorname* { m i n } } [ \widehat { \Sigma } _ { a , k } ] \geq \frac { \varepsilon _ { 0 } } { 2 } , \forall k \geq L ^ { * } \sqrt { q \log j _ { n } } , +$$ + +for some constant $L ^ { * } \geq 1$ , with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . This together with equation 58 and equation 59 yields that + +$$ +\operatorname* { m a x } _ { a \in \{ 0 , 1 \} } \| \widehat { \beta } _ { a , k } - \beta _ { a } \| _ { 2 } \preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \sqrt { \log \operatorname* { m a x } ( k , j _ { n } ) } , \forall k \geq L ^ { * } \sqrt { q \log j _ { n } } , +$$ + +with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ + +By Condition (A3), we have + +$$ +\begin{array} { r } { | \varphi ^ { \mathsf { T } } ( X ) ( \widehat { \beta } _ { 1 , k } - \widehat { \beta } _ { 0 , k } - \beta _ { 1 } + \beta _ { 0 } ) | \leq \bar { L } q k ^ { - 1 / 2 } \log ^ { 1 / 2 } \operatorname* { m a x } ( k , j _ { n } ) , \forall k \geq L ^ { * } \sqrt { q \log j _ { n } } , } \end{array} +$$ + +for some constant $\bar { L } > 0$ , with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . + +For any $z _ { 1 } , z _ { 2 } \in \mathbb { R }$ , we have $\mathbb { I } ( z _ { 1 } > 0 ) \neq \mathbb { I } ( z _ { 2 } > 0 )$ only when $| z _ { 1 } - z _ { 2 } | \geq | z _ { 2 } |$ . Hence, under the event defined in equation 62, the event $\mathbb { I } \{ \varphi ^ { \top } ( X ) ( \widehat { \beta } _ { 1 , k } - \widehat { \beta } _ { 0 , k } ) > 0 \} \neq \mathbb { I } \{ \varphi ^ { \top } ( X ) ( \beta _ { 1 } - \beta _ { 0 } ) > 0 \}$ occurs only when + +$$ +\begin{array} { r } { | \varphi ^ { \top } ( X ) ( \beta _ { 1 } - \beta _ { 0 } ) | \le | \varphi ^ { \top } ( X ) ( \widehat \beta _ { 1 , k } - \widehat \beta _ { 0 , k } - \beta _ { 1 } + \beta _ { 0 } ) | \le \bar { L } q k ^ { - 1 / 2 } \sqrt { \log \operatorname* { m a x } ( k , j _ { n } ) } , } \end{array} +$$ + +for any $k \geq j _ { n }$ . Under the given conditions, we have + +$$ +\begin{array} { r } { \operatorname* { P r } \Big ( | \varphi ^ { \top } ( X ) ( \beta _ { 1 } - \beta _ { 0 } ) | \leq \bar { L } q k ^ { - 1 / 2 } \log ^ { 1 / 2 } \operatorname* { m a x } ( k , j _ { n } ) \Big ) \leq \bar { L } L _ { 0 } q k ^ { - 1 / 2 } \log ^ { 1 / 2 } \operatorname* { m a x } ( k , j _ { n } ) . } \end{array} +$$ + +Notice that when $\mathbb { I } \{ \varphi ^ { \top } ( X ) ( \widehat { \beta } _ { 1 , k } \ - \ \widehat { \beta } _ { 0 , k } ) \ > \ \ 0 \} = \mathbb { I } \{ \varphi ^ { \top } ( X ) ( \beta _ { 1 } \ - \ \beta _ { 0 } ) \ > \ \ 0 \}$ , we have $\pi _ { k } ( a , X ) = \pi ^ { * } ( a , X ) $ . Thus, we obtain $\pi _ { k } ( a , X ) ~ = ~ \pi ^ { * } ( a , X )$ if $\begin{array} { r l } { \vert \varphi ^ { \top } ( X ) ( \beta _ { 1 } - \beta _ { 0 } ) \vert } & { { } > } \end{array}$ $\bar { L } q k ^ { - 1 / 2 } \sqrt { \log \operatorname* { m a x } ( k , j _ { n } ) }$ , for any $k \geq L ^ { * } { \sqrt { q \log j _ { n } } }$ . Set $k _ { 0 } = L ^ { * } { \sqrt { q \log j _ { n } } }$ . By equation 62 and equation 63, we have with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ that + +$$ +\begin{array} { r l } { { \sum _ { \alpha \in \{ 0 , 1 \} } \sum _ { i = 1 } ^ { K } \Big \{ \underset { i = 1 } { \overset { K } { \sum } } \{ \alpha _ { i - 1 } ( \alpha , X ) - \pi ^ { * } ( \alpha , X ) \} \Big \} \Bigg \{ \underset { \alpha \in \{ 0 , 1 \} } { \sum } \sum _ { i = 1 } ^ { K } \sum _ { i = 1 } ^ { K } \big \lvert \pi _ { i - 1 } ( \alpha , X ) - \pi ^ { * } ( \alpha , X ) \big \rvert } } \\ { + \ } & { \sum _ { \alpha \in \{ 0 , 1 \} } \sum _ { i = K + 1 } ^ { K } \sum _ { i = 1 } ^ { K } \big \lvert \pi _ { i - 1 } ( \alpha , X ) - \pi ^ { * } ( \alpha , X ) \big \rvert \leq 2 L ^ { * } \sqrt { \| \Phi \| _ { 2 } } } \\ { + \ } & { \mathrm { a s t ~ } \big \{ \underset { i = 1 } { \overset { K } { \sum } } \big \} \sum _ { i = 1 } ^ { K } \mathbb { E } ^ { I _ { i - 1 } } \big \lvert \pi _ { i - 1 } ( \alpha , X ) - \pi ^ { * } ( \alpha , X ) \big \rvert \mathbb { E } \big \| \mathcal { E } ^ { T } ( X ) ( \beta _ { 1 } - \beta _ { 0 } ) \big \rvert > L \bar { q } ^ { 1 - 1 / 2 } \log ^ { 1 / 2 } \delta \big \} } \\ { + \ } & { \underset { \mathrm { a s t ~ } \{ 0 , 1 \} + \kappa = + 1 } { \overset { K } { \sum } } \mathbb { E } ^ { I _ { i } } \big \lvert \pi _ { i - 1 } ( \alpha , X ) - \pi ^ { * } ( \alpha , X ) \big \rvert \mathbb { E } \big \| \mathcal { E } ^ { T } ( X ) ( \beta _ { 1 } - \beta _ { 0 } ) \big \rvert \leq L \bar { q } ^ { 1 - 1 / 2 } \log ^ { 1 / 2 } \delta \big \} } \\ { + \ } & \underset { \mathrm { a s t ~ } \{ 0 , 1 \} + \kappa = + 1 } { \overset { K } { \sum } } \mathbb { E } ^ { I _ { i } } \cdot \big \| \pi _ { i - 1 } ( \alpha , X ) - \pi ^ { * } ( \alpha , X ) \big \| \mathbb { E } \big \| \mathcal { E } ^ { T } ( X ) ( \beta _ { 1 } - \beta _ { 0 } ) \big \| \leq L \bar { q } ^ { 1 - 1 / 2 } \log ^ { 1 / 2 } \delta \big \end{array} +$$ + +The proof is hence completed. + +# F COMPARISON OF THE BASELINE + +Consider our test statistic $S ( t )$ . Under $H _ { 0 }$ , it can be bounded from above by + +$$ +\operatorname* { s u p } _ { x \in \mathbb { X } } \varphi ^ { \top } ( x ) \{ { \widehat { \beta } } _ { 1 } ( t ) - \beta _ { 1 } ^ { * } - { \widehat { \beta } } _ { 0 } ( t ) + \beta _ { 0 } ^ { * } \} . +$$ + +It suffices to provide an upper bound for the above expression. By Cauchy-Schwarz inequality, equation 64 can be upper bounded by + +$$ +\operatorname* { s u p } _ { x \in \mathbb { X } } \| \varphi ( x ) \| _ { 2 } \| { \widehat { \beta } } _ { 1 } ( t ) - \beta _ { 1 } ^ { * } - { \widehat { \beta } } _ { 0 } ( t ) + \beta _ { 0 } ^ { * } \| _ { 2 } . +$$ + +It suffices to provide anytime upper bound for $\| \widehat { \beta } _ { 1 } ( t ) - \beta _ { 1 } ^ { * } - \widehat { \beta } _ { 0 } ( t ) - \beta _ { 0 } ^ { * } \| _ { 2 }$ . + +Recall that + +$$ +\begin{array} { r l } & { \widehat { \beta } _ { 1 } ( t ) - \beta _ { 1 } ^ { * } - \widehat { \beta } _ { 0 } ( t ) + \beta _ { 0 } ^ { * } } \\ { = } & { \frac { 1 } { N ( t ) } \displaystyle \sum _ { i = 1 } ^ { N ( t ) } [ \mathbb { I } ( A _ { i } = 1 ) \widehat { \Sigma } _ { 1 } ^ { - 1 } ( t ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } ^ { * } \} - \mathbb { I } ( A _ { i } = 0 ) \widehat { \Sigma } _ { 0 } ^ { - 1 } ( t ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \} ] } \end{array} +$$ + +The above expression is asymptotically equivalent to + +$$ +\frac { 1 } { N ( t ) } \sum _ { i = 1 } ^ { N ( t ) } [ \mathbb { I } ( A _ { i } = 1 ) \Sigma _ { 1 } ^ { - 1 } \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 1 } ^ { * } \} - \mathbb { I } ( A _ { i } = 0 ) \Sigma _ { 0 } ^ { - 1 } \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \beta _ { 0 } ^ { * } \} ] . +$$ + +By the law of iterated logarithm, the $\ell$ -th dimension of the above expression can be upper bounded by + +$$ +N ^ { - 1 / 2 } ( t ) \sqrt { 2 \sigma _ { \ell } ^ { 2 } \log \log \{ N ( t ) \} } , +$$ + +where $\textstyle \sum _ { \ell } { \widehat { \sigma } } _ { \ell } ^ { 2 }$ can be consistently estimated by + +$$ +{ \frac { 1 } { \mathrm { V } ( t ) } } \sum _ { i = 1 } ^ { N ( t ) } \| \mathbb { I } ( A _ { i } = 1 ) { \widehat { \Sigma } } _ { 1 } ^ { - 1 } ( t ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) { \widehat { \beta } } _ { 1 } ( t ) \} - \mathbb { I } ( A _ { i } = 0 ) { \widehat { \Sigma } } _ { 0 } ^ { - 1 } ( t ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) { \widehat { \beta } } _ { 0 } ( t ) \} \varphi ( X _ { i } ) \| \varphi ( X _ { i } ) \| _ { L ^ { \infty } ( L ^ { \infty } ( H ) ) } , +$$ + +As such, the finite error bound is given by + +$$ +\begin{array} { r l r } { \displaystyle } & { } & { \displaystyle \operatorname* { s u p } _ { x \in \widetilde { \mathbb { X } } } \| \varphi ( x ) \| _ { 2 } \frac { \sqrt { 2 \log \log \{ 1 \} } } { \sqrt { N ( t ) } } } \\ { \displaystyle } & { } & { \displaystyle \sqrt { \frac { 1 } { N ( t ) } \sum _ { i = 1 } ^ { N ( t ) } \| \mathbb { I } ( A _ { i } = 1 ) \widehat { \Sigma } _ { 1 } ^ { - 1 } ( t ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \widehat { \beta } _ { 1 } ( t ) \} - \mathbb { I } ( A _ { i } = 0 ) \widehat { \Sigma } _ { 0 } ^ { - 1 } ( t ) \varphi ( X _ { i } ) \{ Y _ { i } - \varphi ^ { \top } ( X _ { i } ) \} } } \end{array} +$$ + +# G ADDITIONAL TABLES AND FIGURES + +
methodBATLIL
RandomAdaptiveRandomAdaptive
(n,K8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S10.000.105.0(1.1)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
17.2(1.9)3400(24)18.5(1.9)3409(23)0.0(0.0)3600(0)0.0(0.0)3600(0)
(200,5)0.150.200.250.3036.0(2.4)55.8(2.5)79.5(2.0)93.2(1.3)3184(32)35.5(2.4)3189(32)0.2(0.2)3599(0)0.0(0.0)3600(0)
2914(36)60.0(2.4)2908(36)0.5(0.4)3598(1)0.8(0.4)3595(3)
2545(35)81.5(1.9)2528(34)1.8(0.7)3590(4)2.8(0.8)3585(5)
2286(27)95.2(1.1)2280(26)7.2(1.3)3560(10)7.5(1.3)3549(11)
(20,50)0.000.100.150.200.250.305.2(1.1)17.2(1.9)3879(18)5.5(1.1)3882(18)0.0(0.0)3960(0)0.0(0.0)3960(0)
3716(29)24.0(2.1)3651(32)0.0(0.0)3960(0)0.0(0.0)3960(0)
39.5(2.4)61.8(2.4)84.0(1.8)95.8(1.0)3394(40)3021(44)41.2(2.5)61.0(2.4)3365(40)0.0(0.0)3960(0)0.2(0.2)3958(1)
3013(44)0.8(0.4)3949(6)0.2(0.2)3956(3)
2588(39)83.5(1.9)2579(39)4.8(1.1)3919(11)3.5(0.9)3936(8)
2281(28)95.5(1.0)2275(28)12.8(1.7)3847(18)14.5(1.8)3873(15)
S1(200,5)0.000.100.150.200.250.305.0(1.1)8.8(1.4)25.5(2.2)57.2(2.5)87.2(1.7)98.0(0.7)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
3511(17)3346(26)8.8(1.4)3515(16)0.0(0.0)3600(0)0.0(0.0)3600(0)
26.0(2.2)3337(27)0.0(0.0)3600(0)0.0(0.0)3600(0)
3004(34)2569(32)2224(21)60.2(2.4)88.2(1.6)3000(34)2581(32)0.0(0.0)3600(0)0.0(0.0)3600(0)
(32)2.0(0.7)3594(4)1.5(0.6)3589(5)3574(8)
97.8(0.7)2254(24)10.2(1.5)3559(9)6.2(1.2)
(20,50)0.000.100.150.200.250.305.2(1.1)8.2(1.4)28.0(2.2)64.8(2.4)92.2(1.3)99.2(0.4)3879(18)3839(21)5.5(1.1)7.0(1.3)3882(18)3852(21)0.0(0.0)3960(0)0.0(0.0)3960(0)3960(0)
0.0(0.0)3960(0)0.0(0.0)
3599(34)27.8(2.2)3627(33)0.0(0.0)3960(0)0.2(0.2)3956(3)
3165(41)62.0(2.4)3168(41)1.0(0.5)3951(5)0.8(0.4)3955(4)3936(8)3868(15)
2608(35)2238(23)90.2(1.5)99.2(0.4)2597(36)2250(24)5.0(1.1)14.5(1.8)3926(10)3854(16)2.8(0.8)13.8(1.7)
+ +Table 1: QTE: rejection probabilities (multiplied by 100) and average stopping times under Scenarios 1 and 2 when $\alpha _ { 1 } ( \cdot )$ is chosen as the spending function. Standard errors are reported in the parentheses. + +Table 2: ATE: rejection probabilities (multiplied by 100) and average stopping times under Scenarios 1 and 2 when $\alpha _ { 1 } ( \cdot )$ is chosen as the spending function. Standard errors are reported in the parentheses. + +
methodBATAVT
RandomAdaptiveRandomAdaptive
(n,K)8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S1(200,5)0.000.100.150.200.250.305.2(1.1)27.5(2.2)45.5(2.5)62.5(2.4)80.2(2.0)88.2(1.6)1763(8)6.2(1.2)1762(8)0.2(0.2)1800(0)51.2(2.5)1586(11)
1644(15)26.0(2.2)1647(14)6.8(1.3)1771(6)89.0(1.6)1344(9)
1511(17)1391(18)1263(17)1176(14)44.2(2.5)1527(17)19.0(2.0)1718(10)98.0(0.7)1250(6)
64.2(2.4)1383(18)42.8(2.5)1581(15)99.5(0.4)1196(6)
78.8(2.0)1266(17)72.8(2.2)1394(17)99.8(0.2)1145(5)1091(5)
88.8(1.6)1179(14)89.2(1.5)1216(14)100.0(0.0)
(20,50)0.000.100.150.200.250.305.8(1.2)27.5(2.2)45.5(2.5)67.0(2.4)83.8(1.8)92.0(1.4)1933(9)1771(18)1617(22)1446(22)1287(19)1182(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)
27.5(2.2)1771(18)8.0(1.4)1929(9)89.2(1.5)1276(13)
45.8(2.5)1630(21)25.2(2.2)1826(15)97.8(0.7)1166(7)
65.5(2.4)82.5(1.9)91.5(1.4)1459(22)53.8(2.5)1617(20)99.0(0.5)1105(6)
1288(19)79.0(2.0)1379(19)99.8(0.2)1061(4)1030(2)
1193(16)94.0(1.2)1187(15)100.0(0.0)
S2(200,5)0.000.100.150.200.250.305.2(1.1)18.2(1.9)29.0(2.3)40.5(2.5)50.5(2.5)62.5(2.4)1763(8)1692(12)6.2(1.2)16.8(1.9)1762(8)1699(12)0.2(0.2)1800(0)51.2(2.5)82.2(1.9)1586(11)1406(10)
3.0(0.9)1788(3)
1633(15)1559(17)1489(18)1407(18)25.2(2.2)1642(15)8.5(1.4)1762(7)91.8(1.4)1323(9)
42.0(2.5)49.8(2.5)62.5(2.4)1548(17)1492(18)1413(18)17.2(1.9)1724(10)97.8(0.7)1257(7)
33.0(2.4)53.5(2.5)1641(14)99.0(0.5)99.5(0.4)1218(6)1181(6)
62.5(2.4)1522(16)
(20,50)0.000.100.150.200.250.305.8(1.2)19.0(2.0)28.5(2.3)39.0(2.4)50.7(2.5)65.2(2.4)1933(9)1839(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)1360(15)
19.0(2.0)1837(16)3.5(0.9)1961(5)81.0(2.0)
1763(19)1680(21)28.0(2.2)1771(18)11.5(1.6)1911(10)90.8(1.4)1256(12)1171(8)1124(6)1092(5)
1680(21)41.8(2.5)1685(20)24.0(2.1)1830(15)97.5(0.8)
1592(22)1479(22)52.5(2.5)1568(22)44.2(2.5)1688(19)1539(20)99.0(0.5)99.2(0.4)
63.7(2.4)1481(22)63.5(2.4)
+ +![](images/3a71b11105d6bd40963e8e996977b72b9608eefdc9f17ccca0092181f0fe9212.jpg) +Figure 5: Alpha spending functions when $\theta = 0 . 5 , \gamma = 1 . 0$ . \ No newline at end of file diff --git a/parse/train/yxafu6ZtUux/yxafu6ZtUux_content_list.json b/parse/train/yxafu6ZtUux/yxafu6ZtUux_content_list.json new file mode 100644 index 0000000000000000000000000000000000000000..776f24d4639cfe4878865c214a8f404a5b4bd7d7 --- /dev/null +++ b/parse/train/yxafu6ZtUux/yxafu6ZtUux_content_list.json @@ -0,0 +1,6395 @@ +[ + { + "type": "text", + "text": "AN ONLINE SEQUENTIAL TEST FOR QUALITATIVETREATMENT EFFECTS", + "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, + 236, + 544, + 251 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Tech companies (e.g., Google or Facebook) often use randomized online experiments and/or A/B testing primarily based on the average treatment effects to compare their new product with an old one. However, it is also critically important to detect qualitative treatment effects such that the new one may significantly outperform the existing one only under some specific circumstances. The aim of this paper is to develop a powerful testing procedure to efficiently detect such qualitative treatment effects. We propose a scalable online updating algorithm to implement our test procedure. It has three novelties including adaptive randomization, sequential monitoring, and online updating with guaranteed type-I error control. We also thoroughly examine the theoretical properties of our testing procedure including the limiting distribution of test statistics and the justification of an efficient bootstrap method. Extensive empirical studies are conducted to examine the finite sample performance of our test procedure. ", + "bbox": [ + 233, + 267, + 764, + 446 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "1 INTRODUCTION ", + "text_level": 1, + "bbox": [ + 176, + 474, + 336, + 491 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Tech companies use randomized online experiments, or A/B testing to compare their new product with a well-established one. Most works in the literature focus on the average treatment effects (ATE) between the new and existing products (see Kharitonov et al., 2015; Johari et al., 2015; 2017; Yang et al., 2017; Ju et al., 2019, and the references therein). In addition to ATE, sometimes we are interested in locating the subgroup (if exists) that the new product performs significantly better than the existing one, as early as possible. Consider a ride-hailing company (e.g., Uber). Suppose some passengers are in the recession state (at a high risk of stopping using the companys app) and the company comes up with certain strategy to intervene the recession process. We would like to if there are some subgroups that are sensitive to the strategy and pin-point these subgroups if exists. It motivates us to consider the null hypothesis that the treatment effect is nonpositive for all passenger. ", + "bbox": [ + 174, + 498, + 825, + 638 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "Such a null hypothesis is closely related to the notion of qualitative treatment effects in medical studies (QTE, Gail & Simon, 1985; Roth & Simon, 2018; Shi et al., 2020a), and conditional moment inequalities in economics (see for example, Andrews & Shi, 2013; 2014; Chernozhukov et al., 2013; Armstrong & Chan, 2016; Chang et al., 2015; Hsu, 2017). However, these tests are computed offline and might not be suitable to implement in online settings. Moreover, it is assumed in those papers that observations are independent. In online experiment, one may wish to adaptively allocate the treatment based on the observed data stream in order to maximize the cumulative reward or to detect the alternative more efficiently. The independence assumption is thus violated. In addition, an online experiment is desired to be terminated as early as possible in order to save time and budget. Sequential testing for qualitative treatment effects has been less explored. ", + "bbox": [ + 174, + 645, + 825, + 784 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "In the literature, there is a line of research on estimation and inference of the heterogeneous treatment effects (HTE) (Athey & Imbens, 2016; Taddy et al., 2016; Wager & Athey, 2018; Yu et al., 2020). In particular, Yu et al. (2020) proposed an online test for HTE. We remark that HTE and QTE are related yet fundamentally different hypotheses. There are cases where HTE exists whereas QTE does not. See Figure 1 for an illustration. Consequently, applying their test will fail in our setting. ", + "bbox": [ + 174, + 791, + 823, + 861 + ], + "page_idx": 0 + }, + { + "type": "text", + "text": "The contributions of this paper are summarized as follows. First, we propose a new testing procedure for treatment comparison based on the notion of QTE. When the null hypothesis is not rejected, the new product is no better than the control for any realization of covariates, and thus it is not useful at all. Otherwise, the company could implement different products according to the auxiliary covariates observed, to maximize the average reward obtained. We remark that there are plenty cases where the treatment effects are always nonpositive (see Section 5 of Chang et al., 2015; Shi et al., 2020a). A by-product of our test is that it yields a decision rule to implement personalization when the null is rejected (see Section 3.1 for details). Although we primarily focus on QTE in this paper, our procedure can be easily extended to testing ATE as well (see Appendix D for details). ", + "bbox": [ + 174, + 867, + 823, + 924 + ], + "page_idx": 0 + }, + { + "type": "image", + "img_path": "images/bdfa07c6e548c34b414e3b216be9e7ed4ed71107e91e13b03ab1e2e9975a4e3b.jpg", + "image_caption": [ + "Figure 1: Plots demonstrating QTE. $X$ denotes the observed covariates, $A$ denotes the received treatment and $Y$ denotes the associated reward. In the ride-hailing example, $X$ is a feature vector describing the characteristics of a passenger, $A$ is a binary strategy indicator and $Y$ is the passenger’s number of rides in the following two weeks. In the left panel, the treatment effect does not depend on $X$ . Neither HTE nor QTE exists in this case. In the middle panel, HTE exists. However, the treatment effect is always negative. As such, QTE does not exist. In the right penal, both QTE and HTE exist. " + ], + "image_footnote": [], + "bbox": [ + 287, + 117, + 696, + 205 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 303, + 825, + 373 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Second, we propose a scalable online updating algorithm to implement our test. To allow for sequential monitoring, our procedure leverages idea from the $\\alpha$ spending function approach (Lan & DeMets, 1983) originally designed for sequential analysis in a clinical trial (see Jennison & Turnbull, 1999, for an overview). Classical sequential tests focus on ATE. The test statistic at each interim stage is asymptotically normal and the stopping boundary can be recursively updated via numerical integration. However, the limiting distribution of the proposed test statistic does not have a tractable analytical form, making the numerical integration method difficult to apply. To resolve this issue, we propose a scalable bootstrap-assisted procedure to determine the stopping boundary. ", + "bbox": [ + 174, + 380, + 825, + 492 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Third, we adopt a theoretical framework that allows the maximum number of interim analyses $K$ to diverge as the number of observations increases, since tech companies might analyze the results every few minutes (or hours) to determine whether to stop the experiment or continue collecting more data. It is ultimately different from classical sequential analysis where $K$ is fixed. Moreover, the derivation of the asymptotic property of the proposed test is further complicated due to the adaptive randomization procedure, which makes observations dependent of each other. Despite these technical challenges, we establish a nonasymptotic upper bound on the type-I error rate by explicitly characterizing the conditions needed on randomization procedure, $K$ and the number of samples observed at the initial decision point to ensure the validity of our test. ", + "bbox": [ + 173, + 498, + 825, + 623 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "2 BACKGROUND AND PROBLEM FORMULATION", + "text_level": 1, + "bbox": [ + 174, + 645, + 581, + 660 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "We propose a potential outcome framework (Rubin, 2005) to formulate our problem. Suppose that we have two products including the control and the treatment. The observed data at time point $t$ consists of a sequence of triples $\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { N ( t ) }$ , where $N ( \\cdot )$ is a counting process that is independent of the data stream $\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { + \\infty }$ , $A _ { i }$ is a binary random variable indicating the product executed for the $i$ -th experiment, $X _ { i } \\in \\mathbb { R } ^ { p }$ denotes the associated covariates, and $Y _ { i }$ stands for the associated reward (the larger the better by convention). We allow $A _ { i }$ to depend on $X _ { i }$ and past observations $\\{ ( X _ { j } , A _ { j } , Y _ { j } ) \\} _ { j < i }$ so that the randomization procedure can be adaptively changed. In corresponding product is executed for the are independently and identically distribut addition, define $Y _ { i } ^ { * } ( 0 )$ and $Y _ { i } ^ { * } ( 1 )$ to be the potential outcome that would have been observed if the $i$ -th experimd copies of $\\{ ( X _ { i } , Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 ) ) \\} _ { i = 1 } ^ { + \\infty }$ $( X , Y ^ { * } \\bar { ( 0 ) } , Y ^ { * } ( 1 ) )$ $\\mathbb { X }$ $X$ and $\\bar { Q } _ { 0 } ( x , a ) \\stackrel { \\cdot } { = } \\mathrm { E } \\{ Y ^ { * } ( a ) | X \\stackrel { \\cdot } { = } x \\}$ for $a = 0 , 1$ , we focus on testing the following hypotheses: ", + "bbox": [ + 173, + 666, + 825, + 828 + ], + "page_idx": 1 + }, + { + "type": "equation", + "img_path": "images/65b1ea09972c584098db202cc61cab852b995c7068655f826f4de3b201480845.jpg", + "text": "$$\nH _ { 0 } : Q _ { 0 } ( x , 1 ) \\leq Q _ { 0 } ( x , 0 ) , \\forall x \\in \\mathbb { X } { \\mathrm { ~ ~ v e r s u s ~ } } H _ { 1 } : Q _ { 0 } ( x , 1 ) > Q _ { 0 } ( x , 0 ) , \\exists x \\in \\mathbb { X } .\n$$", + "text_format": "latex", + "bbox": [ + 218, + 832, + 745, + 849 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "Notice that when there are no covariates, i.e., $\\mathbb { X } = \\emptyset$ , the hypotheses are reduced to $H _ { 0 } : \\tau _ { 0 } \\leq 0$ versus $H _ { 1 } : \\tau _ { 0 } > 0$ , where $\\tau _ { 0 }$ corresponds to ATE, i.e, $\\tau _ { 0 } \\stackrel { } { = } \\mathrm { E } \\{ Y ^ { \\ast } ( 1 ) - Y ^ { \\ast } ( 0 ) \\}$ . In general, we require $\\mathbb { X }$ to be a compact set. We consider a large linear approximation space $\\mathcal { Q }$ for the conditional mean function $Q _ { 0 }$ . Specifically, let $\\mathcal { Q } = \\{ Q \\in \\langle x , a ; \\beta _ { 0 } , \\hat { \\beta _ { 1 } } \\rangle = \\varphi ^ { \\top } ( x ) \\hat { \\beta _ { a } } : \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { q } \\}$ be the approximation space, where $\\varphi ( x )$ is a $q$ -dimensional vector composed of basis functions on $\\mathbb { X }$ . The dimension $q$ is allowed to diverge with the number of observations in order to alleviate the effects of model misspecification. The use of linear approximation space simplifies the computation of our testing procedure. When $Q _ { 0 }$ is well approximated, it suffices to test ", + "bbox": [ + 174, + 853, + 825, + 924 + ], + "page_idx": 1 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 103, + 825, + 146 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/2eac75b3ac71122b17af5136f098f288e74104c140466fc3e530f0ac07d59408.jpg", + "text": "$$\nH _ { 0 } : \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) \\leq 0 , \\forall x \\in \\mathbb { X } \\mathrm { ~ \\mathrm { ~ v e r s u s ~ } ~ } H _ { 1 } : \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) > 0 , \\exists x \\in \\mathbb { X } .\n$$", + "text_format": "latex", + "bbox": [ + 214, + 150, + 753, + 170 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "For clarity, here we assume $Q _ { 0 } ( x , a ) = Q ( x , a ; \\beta _ { 0 } ^ { * } , \\beta _ { 1 } ^ { * } )$ for some $\\beta _ { 0 } ^ { * }$ and $\\beta _ { 1 } ^ { * }$ . In Appendix B, we allow the approximation error $\\begin{array} { r } { \\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | } \\end{array}$ to be nonzero. ", + "bbox": [ + 174, + 174, + 825, + 205 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Let ${ \\mathcal { F } } _ { j }$ denote the sub-dataset $\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { 1 \\leq i \\leq j }$ for $j \\geq 1$ and $\\mathcal { F } _ { 0 } = \\emptyset$ . Throughout this paper, we assume that the following two assumptions hold. ", + "bbox": [ + 174, + 210, + 821, + 241 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "(A1) $Y _ { i } = A _ { i } Y _ { i } ^ { * } ( 1 ) + ( 1 - A _ { i } ) Y _ { i } ^ { * } ( 0 )$ for $\\forall i \\geq 1$ . (A2) $A _ { i }$ is independent of $Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 )$ , $\\{ ( X _ { k } , Y _ { k } ^ { * } ( 0 ) , Y _ { k } ^ { * } ( 1 ) ) \\} _ { k > i }$ given $X _ { i }$ and $\\mathcal { F } _ { i - 1 }$ , for any $i$ ", + "bbox": [ + 173, + 250, + 812, + 281 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Assumption (A1) is referred to be the stable unit treatment value assumption (Rubin, 1974) and Assumption (A2) is the sequential randomization assumption (Zhang et al., 2013) and is automatically satisfied in a randomized study where the treatments are independently generated of the observed data. (A2) essentially assumes there is no unmeasured confounders. These assumptions guarantee that both regression coefficients (defined through potential outcomes) are estimable from the observed dataset as shown in the following lemma. ", + "bbox": [ + 173, + 285, + 825, + 369 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Lemma 1 Let $\\mathbb { I } ( \\cdot )$ denotes the indicator function. Under (A1)-(A2), we have ", + "bbox": [ + 173, + 380, + 678, + 395 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/2b778884f309f595ba78613746895bc356b05eb2645e9fd3f1cfd5fc58f2b850.jpg", + "text": "$$\nE [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ^ { * } \\} ] = 0 , \\forall a \\in \\{ 0 , 1 \\} , i \\geq 1 .\n$$", + "text_format": "latex", + "bbox": [ + 289, + 398, + 674, + 419 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3 ONLINE SEQUENTIAL TESTING FOR QTE ", + "bbox": [ + 174, + 436, + 547, + 454 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "3.1 TEST STATISTICS AND THEIR LIMITING DISTRIBUTION ", + "text_level": 1, + "bbox": [ + 173, + 468, + 589, + 483 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "We first present our test statistic for testing $H _ { 0 }$ . In view of Lemma 1, we estimate $\\beta _ { a }$ by using the ordinary least squares estimator ", + "bbox": [ + 173, + 493, + 823, + 522 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/0d2ead2b29bf363e5280bcabe1998b93a0bff663ab850d7dd23fb3fe59b8ce32.jpg", + "text": "$$\n\\widehat { \\beta } _ { a } ( t ) = { \\widehat \\Sigma } _ { a } ^ { - 1 } ( t ) \\left\\{ \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\right\\}\n$$", + "text_format": "latex", + "bbox": [ + 308, + 526, + 643, + 577 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "at each time point $t$ for $a \\in \\{ 0 , 1 \\}$ , where $\\begin{array} { r } { \\widehat { \\Sigma } _ { a } ( t ) = N ^ { - 1 } ( t ) \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) } \\end{array}$ . A generalized inverse might be used even if $\\widehat { \\Sigma } _ { a } ( t )$ is not invertible. Consider the following test statistic $\\begin{array} { r } { S ( t ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ \\widehat \\beta _ { 1 } ( t ) - \\widehat \\beta _ { 0 } ( t ) \\} } \\end{array}$ . Under $H _ { 0 }$ , we expect $S ( t )$ to be small. A large $S ( t )$ can be interpreted as the evidence against $H _ { 0 }$ . As such, we reject $H _ { 0 }$ for large $S ( t )$ . We remark that when $H _ { 0 }$ is rejected, we can apply the decision rule $d ( x ) = \\arg \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\varphi ^ { \\top } ( x ) \\widehat { \\beta } _ { a } ( t )$ for personalized recommendation. ", + "bbox": [ + 173, + 582, + 826, + 680 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "To determine the rejection region, we next discuss the limiting distribution of $S ( t )$ . Under $H _ { 0 }$ , ", + "bbox": [ + 169, + 685, + 794, + 702 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/a6e33106058f086e77ae4d70e8c25c62851033e2d3188a96c0c0fc314947bf82.jpg", + "text": "$$\n\\begin{array} { r } { S ( t ) \\le \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} + \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) } \\\\ { \\le \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 250, + 705, + 715, + 766 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "Both equalities hold when $\\beta _ { 0 } ^ { * } ~ = ~ \\beta _ { 1 } ^ { * }$ . Suppose there exists some function $\\pi ^ { * } ( \\cdot , \\cdot )$ defined on $\\{ 0 , 1 \\} \\times \\mathbb { X }$ that satisfies $\\begin{array} { r } { { \\mathrm { E } } ^ { X } | \\sum _ { i = 1 } ^ { n } n ^ { - 1 } \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) | \\ \\stackrel { P } { \\to } \\ 0 , \\forall a \\ \\in \\ \\{ 0 , 1 \\} } \\end{array}$ as $n \\infty$ , where $\\pi _ { n } ( \\cdot , \\cdot ) = \\operatorname* { P r } ( A _ { n } = a | X _ { n } = x , { \\mathcal { F } } _ { n - 1 } )$ , and the expectation $\\operatorname { E } ^ { X }$ is taken with respect to $X$ . This condition implies that the treatment assignment mechanism cannot be arbitrary (see the discussion below Theorem 1 for details). Then we will show ", + "bbox": [ + 173, + 768, + 828, + 848 + ], + "page_idx": 2 + }, + { + "type": "equation", + "img_path": "images/afe6664799fa6668b3e113e66c2da44fdcbb85d62599f3ae96841f82705ca3a8.jpg", + "text": "$$\nB ( t ) \\equiv \\sqrt { N ( t ) } \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} \\stackrel { d } { } N ( 0 , \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } ) , \\mathrm { a s } N ( t ) \\infty ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 852, + 781, + 888 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "where $\\Sigma _ { a } = \\mathrm { E } \\pi ^ { * } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X )$ , $\\Phi _ { a } = \\mathrm { E } \\pi ^ { * } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X )$ , and $\\sigma ^ { 2 } ( a , x ) =$ $\\operatorname { E } [ \\{ Y ^ { * } ( a ) - \\varphi ^ { \\top } ( X ) \\beta _ { a } \\} ^ { 2 } | X = x ]$ , for any $x \\in \\mathbb { X }$ . According to equation 3, the right-hand-side (RHS) of equation 2 is to converge in distribution to the maximum of some Gaussian random variables. This observation forms the basis of our test. ", + "bbox": [ + 173, + 893, + 825, + 925 + ], + "page_idx": 2 + }, + { + "type": "text", + "text": "", + "bbox": [ + 171, + 103, + 823, + 132 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "We next discuss the sequential implementation of our test. Assume that the interim analyses are conducted at time points $t _ { 1 } , t _ { 2 } , \\ldots , t _ { K } \\in [ 0 , \\ldots , T ]$ such that $0 < t _ { 1 } < t _ { 2 } < \\cdots < t _ { K } = T$ . We allow $K$ to grow with the number of observations. In the most extreme case, one may set $t _ { k } = \\operatorname* { i n f } _ { t } \\{ N ( t ) \\geq N ( t _ { k - 1 } ) + 1 \\} , \\forall k \\geq 2$ . That is, we make a decision regarding the null hypothesis upon the arrival of each observation. In addition, we assume that $t _ { 1 }$ is large so that there are enough number of samples $N ( t _ { 1 } )$ to guarantee the validity of the normal approximation for $B ( t _ { 1 } )$ . We remark that in typical tech companies such as Amazon, Facebook, etc., massive data are collected even within a short time interval. Large sample approximation is validated in these applications. ", + "bbox": [ + 173, + 138, + 825, + 251 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "To guarantee our test controls the type-I error, we reject $H _ { 0 }$ and terminate the experiment at $t _ { k }$ if $\\sqrt { N ( t _ { k } ) } S ( t _ { k } ) \\geq z _ { k }$ for some $k = 1 , \\ldots , K$ with some suitably chosen $z _ { 1 } , \\dotsc , z _ { K } > 0$ that satisfy ", + "bbox": [ + 174, + 257, + 821, + 287 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/65859d05a2e49f119b63e96f1b2ad11b606257ea8232e165ff44e9385ec36f89.jpg", + "text": "$$\n\\operatorname* { P r } \\bigg ( \\operatorname* { m a x } _ { k \\in \\{ 1 , \\dots , K \\} } \\{ \\sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \\} > 0 \\bigg ) \\leq \\alpha + o ( 1 )\n$$", + "text_format": "latex", + "bbox": [ + 297, + 295, + 668, + 330 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "for a given significance level $\\alpha > 0$ under $H _ { 0 }$ . In view of equation 2, it suffices to find $\\{ z _ { k } \\} _ { k }$ that satisfy ", + "bbox": [ + 173, + 337, + 823, + 366 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/cdb11743140241b57d5608e6390631b62c3b230a69c1de1ca6cb554d46c37d5f.jpg", + "text": "$$\n\\operatorname* { P r } \\left\\{ \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left( \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} \\leq \\alpha + o ( 1 ) ,\n$$", + "text_format": "latex", + "bbox": [ + 281, + 372, + 683, + 407 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where the stochastic process $B ( \\cdot )$ is defined in equation 3. ", + "bbox": [ + 173, + 415, + 555, + 430 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "To determine $\\{ z _ { k } \\} _ { k }$ , we need to derive the asymptotic distribution of the left-hand-side (LHS) of equation 4. To this end, define a mean-zero Gaussian process $G ( t )$ with covariance function ", + "bbox": [ + 171, + 435, + 826, + 465 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/b5da6438913f801f6c9ee030669da5ee9ea8e764bd599b1285ad3afd1f0940fe.jpg", + "text": "$$\n\\mathrm { C o v } ( G ( t ) , G ( t ^ { \\prime } ) ) = N ^ { 1 / 2 } ( t ) N ^ { - 1 / 2 } ( t ^ { \\prime } ) \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } , \\forall 0 < t \\leq t ^ { \\prime } .\n$$", + "text_format": "latex", + "bbox": [ + 235, + 472, + 728, + 508 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In the following, we show that the LHS of equation 4 can be uniformly approximated by $G ( \\cdot )$ , for any $\\{ z _ { k } \\} _ { k = 1 , . . . , K }$ . To establish our theoretical results, we need some regularity conditions on $\\dot { \\varphi } ( \\cdot )$ . To save space, we summarize these assumptions in (A3) and put them in Appendix $\\mathbf { B }$ . ", + "bbox": [ + 174, + 515, + 826, + 559 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Theorem 1 Assume (A1)-(A3) hold. For $a = 0 , 1$ , assume $\\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\pi ^ { * } ( a , x ) > 0$ and $\\left| Y ^ { * } ( a ) \\right|$ is bounded almost surely. Assume there exists some $0 < \\alpha _ { 0 } \\le 1$ such that for any sequence $\\{ j _ { n } \\} _ { n }$ that satisfies $j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }$ , the following event occurs with probability at least $1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )$ , ", + "bbox": [ + 174, + 570, + 826, + 614 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/2f4a233230f977c24e4fd14c8d9edf2cbe1cf5ff85f3f695b182a4b5d0bb7bc3.jpg", + "text": "$$\n\\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } E \\left| \\sum _ { i = 1 } ^ { k } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right| \\leq O ( 1 ) q k ^ { 1 - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } k , \\forall k \\geq j _ { n } ,\n$$", + "text_format": "latex", + "bbox": [ + 235, + 621, + 728, + 665 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "where $O ( 1 )$ denotes some positive constant. Assume $N ^ { \\alpha _ { 0 } } ( t _ { 1 } ) / \\log ^ { \\alpha _ { 0 } } N ( t _ { 1 } ) \\gg q ^ { 2 }$ and $N ( t _ { 1 } ) \\gg$ $\\log N ( T )$ almost surely. Then conditional on the counting process $N ( \\cdot )$ , there exists some constant $c > 0$ such that ", + "bbox": [ + 173, + 671, + 828, + 714 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/397b9ec20a3891c062c68b4b9cac396b6c00dc9a6edf38e4390ea9fc7a64b942.jpg", + "text": "$$\n\\begin{array} { r l r } { { \\operatorname* { s u p } _ { 1 , \\ldots , z _ { K } } P r \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { K } ) - z _ { k } ) > 0 \\} - P r \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { K } ) - z _ { k } ) \\} } } \\\\ & { } & { \\leq c q ^ { 3 / 4 } N ^ { - 1 / 8 } ( t _ { 1 } ) \\log ^ { 1 5 / 8 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K N ( t _ { 1 } ) \\} } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 718, + 839, + 784 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "Theorem 1 implies that the approximation error depends on the number of observations obtained up to the first decision point $\\bar { N ( t _ { 1 } ) }$ , the maximum number of interim analyses $K$ , the total number of basis functions $q$ , and $\\alpha _ { 0 }$ , which characterizes the convergence rate of the treatment assignment mechanism $\\scriptstyle \\sum _ { i = 1 } ^ { n } { n ^ { - 1 } \\pi _ { i - 1 } }$ . Clearly, the error will decay to zero when the followings hold with probability tending to 1, ", + "bbox": [ + 173, + 795, + 825, + 867 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/4a058a6d3f64b26650b6f7eae0f7f9ce154ebff761fb37cc4513baf589c1365a.jpg", + "text": "$$\nq = O ( N ^ { \\alpha _ { * } } ( t _ { 1 } ) ) , \\mathrm { f o r s o m e } 0 \\leq \\alpha ^ { * } < \\operatorname* { m i n } ( 1 / 6 , \\alpha _ { 0 } / 3 ) ,\n$$", + "text_format": "latex", + "bbox": [ + 294, + 873, + 669, + 890 + ], + "page_idx": 3 + }, + { + "type": "equation", + "img_path": "images/895c0b209097604a0d727b4cbaeaa26a2b4721a5869715b7373d97ce85feed4c.jpg", + "text": "$$\n\\log ( K ) \\ll \\operatorname * { m i n } \\{ N ^ { 1 / 1 5 - 2 \\alpha ^ { * } / 5 } ( t _ { 1 } ) , N ^ { ( \\alpha _ { 0 } - 3 \\alpha ^ { * } ) / ( 5 + \\alpha _ { 0 } ) } ( t _ { 1 } ) \\} .\n$$", + "text_format": "latex", + "bbox": [ + 285, + 905, + 679, + 925 + ], + "page_idx": 3 + }, + { + "type": "text", + "text": "In Appendix C, we show that $\\alpha _ { 0 } = 1 / 2$ , when an $\\epsilon$ -greedy strategy is used for randomization to balance the trade-off between exploration and exploitation. In this case, 6 requires $q$ to grow at a slower rate than $N ^ { 1 / 6 } ( t _ { 1 } )$ . This condition is automatically satisfied when $q$ is bounded. Condition 7 is satisfied when $K$ grows polynomially fast with respect to $N ( t _ { 1 } )$ . In addition to $\\epsilon$ -greedy, other adaptive allocation procedures (e.g., upper confidence bound or Thompson sampling) could be applied as well. ", + "bbox": [ + 173, + 103, + 825, + 189 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "As discussed in the introduction, the derivation of Theorem 1 is nontrivial. One way to obtain the magnitude of the approximation error is to apply the strong approximation theorem for multidimensional martingales (see Morrow & Philipp, 1982; Zhang, 2004). However, the rate of approximation typically depends on the dimension and decays fast as the dimension increases. To derive Theorem 1, we view $\\{ \\varphi ^ { \\top } ( x ) B ( t _ { K } ) \\} _ { x \\in \\mathbb { X } , k \\in \\{ 1 , \\dots , \\kappa \\} }$ as a high-dimensional martingale and adopt the Gaussian approximation techniques that have been recently developed by Belloni $\\&$ Oliveira (2018). In view of equation 2, an application of Theorem 1 yields the following result. ", + "bbox": [ + 173, + 194, + 825, + 294 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Theorem 2 Assume that the conditions of Theorem $^ { l }$ hold, equation $6$ and equation 7 hold with probability tending to 1. Then for any $z _ { 1 } , \\ldots , z _ { k }$ that satisfy ", + "bbox": [ + 173, + 304, + 823, + 334 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/b3dcfb6d0a4d02370c10a89205f159331e576da4c293842d09aa91987e623f86.jpg", + "text": "$$\nP r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} = \\alpha + o ( 1 ) ,\n$$", + "text_format": "latex", + "bbox": [ + 281, + 338, + 683, + 372 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "as $N ( t _ { 1 } )$ diverges to infinity, we have under $H _ { 0 }$ , ", + "bbox": [ + 174, + 377, + 490, + 392 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/b98d1a1e99a9e64af87f904f9f27ca276747702b53666ab57196230310ae548e.jpg", + "text": "$$\nP r \\left( \\operatorname* { m a x } _ { k \\in \\{ 1 , \\dots , K \\} } \\{ \\sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \\} > 0 \\right) \\leq \\alpha + o ( 1 ) .\n$$", + "text_format": "latex", + "bbox": [ + 294, + 397, + 669, + 433 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The above equality holds when $\\beta _ { 0 } ^ { * } = \\beta _ { 1 } ^ { * }$ . ", + "bbox": [ + 176, + 435, + 442, + 452 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Theorem 2 suggests that the type-I error rate of the proposed test can be well controlled. It remains to find critical values $\\left\\{ z _ { k } \\right\\} _ { 1 \\leq k \\leq K }$ that satisfy equation 8. In the next section, we propose a bootstrapassisted procedure to determine these critical values. ", + "bbox": [ + 174, + 462, + 823, + 506 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "3.2 BOOTSTRAP STOPPING BOUNDARY ", + "text_level": 1, + "bbox": [ + 176, + 522, + 455, + 536 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We first outline a method based on the wild bootstrap (Wu, 1986) to approximate the limiting distribution of $\\{ S ( t _ { k } ) \\} _ { k }$ . Then we discuss its limitation and present our proposal, a scalable bootstrap algorithm to determine the stopping boundary. ", + "bbox": [ + 174, + 546, + 825, + 590 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "The idea is to generate bootstrap samples $\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }$ that have asymptotically the same joint distribution as $\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }$ . Then the joint distribution of $\\{ S ( t _ { k } ) \\} _ { k }$ can be well-approximated by the conditional distribution of $\\{ \\widehat { S } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { k }$ given the data, where $\\begin{array} { r } { \\widehat { S } ^ { \\mathrm { M B } } ( t ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } } ( t ) - } \\end{array}$ $\\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } } ( t ) \\}$ for any $t$ . Specifically, let $\\{ \\xi _ { i } \\} _ { i = 1 } ^ { + \\infty }$ be a sequence of i.i.d. standard normal random variables b independent of $\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { + \\infty }$ . For $a \\in \\{ 0 , 1 \\}$ , define ", + "bbox": [ + 173, + 597, + 825, + 683 + ], + "page_idx": 4 + }, + { + "type": "equation", + "img_path": "images/8790fb08605b7efe045ca78e191d9c17fcca9e4f6ece6a9a7844aad29a8d3aa7.jpg", + "text": "$$\n\\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t ) = \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t ) \\left[ \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi _ { i } ( X ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } ( t ) \\} \\xi _ { i } \\right] , \\forall a \\in \\{ 0 , 1 \\} .\n$$", + "text_format": "latex", + "bbox": [ + 196, + 686, + 767, + 737 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "Both the asymptotic means of $\\sqrt { N ( t ) } \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t )$ and $\\sqrt { N ( t ) } ( \\widehat { \\beta } _ { a } ( t ) - \\beta _ { a } ^ { * } )$ are zero. In addition, their covariance functions are asymptotically the same. By design, $\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }$ is multivariate normal. Similar to equation 3, we can show $\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }$ is asymptotically multivariate normal. Consequently, the limiting distributions of $\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }$ and $\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }$ are asymptotically equivalent. As such, the bootstrap approximation is valid. ", + "bbox": [ + 173, + 741, + 826, + 825 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "However, calculating $\\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } )$ requires $O ( N ( t _ { k } ) )$ operations. The time complexity of the resulting bootstrap algorithm is $O ( B N ( t _ { k } ) )$ up to the $k$ -th interim stage, where $B$ is the total number of bootstrap samples. This can be time consuming when $\\{ N ( t _ { k } ) - \\mathbf { \\bar { \\phi } } N ( t _ { k - 1 } ) \\} _ { k = 1 } ^ { K }$ are large. To facilitate the computation, we observe that in the calculation of ${ \\widehat { \\beta } } _ { a } ^ { \\mathrm { M B } }$ , the random noise is generated upon the arrival of each observation. This is unnecessary as we aim to approximate the distribution of ${ \\widehat \\beta } _ { a } ( \\cdot )$ only at finitely many time points. ", + "bbox": [ + 173, + 832, + 825, + 924 + ], + "page_idx": 4 + }, + { + "type": "text", + "text": "We next present our proposal. Let $\\{ e _ { i , a } \\} _ { i = 1 , . . . , K , a = 0 , 1 }$ be a sequence of i.i.d $N ( 0 , I _ { q } )$ random vectors independent of the observed data, where $I _ { q }$ denotes the $q \\times q$ identity matrix. At the $k$ - th interim stage, we compute $\\begin{array} { r } { \\widehat { S } ^ { \\mathtt { M B } * } ( t _ { k } ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\bar { \\varphi } ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathtt { M B } * } ( t _ { k } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathtt { M B } * } ( t _ { k } ) \\} } \\end{array}$ , where $\\widehat { \\beta } _ { a } ^ { \\mathrm { M B * } } ( t _ { k } )$ equals ", + "bbox": [ + 173, + 102, + 826, + 164 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/dfcad42d203a5d4d843a534acaa920afa3d5e7c642d2baf3838e73de3a39320f.jpg", + "text": "$$\n\\frac { 1 } { \\mathrm { V } ( t _ { k } ) } \\sum _ { j = 1 } ^ { k } \\left( \\sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ( X _ { i } ) ^ { \\top } \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\right) ^ { 1 / 2 } e _ { j , a } .\n$$", + "text_format": "latex", + "bbox": [ + 181, + 165, + 839, + 217 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "For any $k _ { 1 }$ and $k _ { 2 }$ , the conditional covariance of $\\sqrt { N ( t _ { k _ { 1 } } ) } \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k _ { 1 } } ) \\ - \\ \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k _ { 1 } } ) \\}$ and $\\sqrt { N ( t _ { k _ { 2 } } ) } \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k _ { 2 } } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k _ { 2 } } ) \\}$ equals ", + "bbox": [ + 174, + 219, + 830, + 256 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/0d6dd609f91ae7c2afb3f8619227b0cb8030b849f5a53fe8e2f250befe4129ee.jpg", + "text": "$$\n\\frac { 1 } { \\sqrt { N ( t _ { k _ { 1 } } ) N ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { k _ { 1 } } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 257, + 839, + 304 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Under the given conditions in Theorem 1, it is to converge to ", + "bbox": [ + 173, + 305, + 575, + 320 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/a326351e96bc660ab14f125d6ad896fc077b66eb144aeb465975f64eec0cfaf8.jpg", + "text": "$$\n\\frac { \\sqrt { N ( t _ { k _ { 1 } } ) } } { \\sqrt { N ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\Sigma _ { a } ^ { - 1 } \\Phi ( a ) \\Sigma _ { a } ^ { - 1 } = \\mathrm { C o v } ( G ( t _ { k _ { 1 } } ) , G ( t _ { k _ { 2 } } ) ) .\n$$", + "text_format": "latex", + "bbox": [ + 303, + 321, + 661, + 363 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "This means $\\{ \\sqrt { N ( t _ { k } ) } ( \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } ^ { * } } ( t _ { k } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } ^ { * } } ( t _ { k } ) ) \\} _ { k }$ and $\\{ G ( t _ { k } ) \\} _ { k }$ have the same asymptotic distribution. Consequently, $\\{ \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { k } ) \\} _ { k = 1 } ^ { K }$ can be used to approximate the joint distribution of $\\{ \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) \\} _ { k = 1 } ^ { \\cdot }$ . ", + "bbox": [ + 173, + 367, + 826, + 419 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "To choose $\\{ z _ { k } \\} _ { k }$ that satisfies equation 8, we adopt the $\\alpha$ -spending approach that allocates the total allowable type I error at each interim stage according to an error-spending function. This guarantees our test controls the type-I error. We begin by specifying an $\\alpha$ spending function $\\alpha ( t )$ that is nonincreasing and satisfies $\\alpha ( 0 ) = 0$ , $\\alpha ( T ) = \\alpha$ . Popular choices of $\\alpha ( \\cdot )$ include ", + "bbox": [ + 173, + 422, + 825, + 481 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/e8067e9915e5e58b5155aff2c5490d21f7299fc448228f7e4529f002c825e0a8.jpg", + "text": "$$\n\\alpha _ { 1 } ( t ) = \\alpha \\log \\left( 1 + ( e - 1 ) \\frac { t } { T } \\right) , \\quad \\quad \\quad \\quad \\alpha _ { 2 } ( t ) = 2 - 2 \\Phi \\left( \\frac { \\Phi ^ { - 1 } ( 1 - \\alpha / 2 ) \\sqrt { T } } { \\sqrt { t } } \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 212, + 483, + 769, + 521 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/dc4e04931872ce685b700c7507abf0cd6a224fafabb61335b0afb5cf98ddf7a8.jpg", + "text": "$$\n\\alpha _ { 3 } ( t ) = \\alpha \\left( \\frac { t } { T } \\right) ^ { \\theta } , \\mathrm { f o r } \\theta > 0 , \\alpha _ { 4 } ( t ) = \\alpha \\frac { 1 - \\exp ( - \\gamma t / T ) } { 1 - \\exp ( - \\gamma ) } , \\mathrm { f o r } \\gamma \\neq 0 ,\n$$", + "text_format": "latex", + "bbox": [ + 228, + 525, + 769, + 561 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "where $\\Phi ( \\cdot )$ denotes the cumulative distribution function of a standard normal variable and $\\Phi ^ { - 1 } ( \\cdot )$ is its quantile function. Based on $\\alpha ( \\cdot )$ , we iteratively calculate $\\widehat { z } _ { k } , k = 1 , \\ldots , K$ as the solution of ", + "bbox": [ + 174, + 564, + 825, + 593 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/aeaeca618a81428e399389f57b7f9acd0253cd5f1526ba9c8d5667060c5c6598.jpg", + "text": "$$\n\\mathrm { P r } ^ { * } \\left\\{ \\operatorname* { m a x } _ { j \\in \\{ 1 , \\dots , k - 1 \\} } \\left( \\sqrt { N ( t _ { j } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { j } ) - \\widehat { z } _ { j } \\right) \\leq 0 , \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { k } ) > \\widehat { z } _ { k } \\right\\} = \\alpha ( t _ { k } ) - \\alpha ( t _ { k - 1 } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 171, + 593, + 810, + 628 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "and reject $H _ { 0 }$ when $\\sqrt { N ( t _ { k } ) } S ( t _ { k } ) > \\widehat { z } _ { k }$ holds for some $k$ . ", + "bbox": [ + 173, + 631, + 562, + 648 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "The validity of the bootstrap test is summarized in Theorems 3 and 4 below. ", + "bbox": [ + 171, + 654, + 668, + 669 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorem 3 Assume the conditions in Theorem $^ { l }$ hold. Assume $q = O ( N ^ { \\alpha ^ { * } } ( t _ { 1 } ) )$ for some $0 ~ <$ $\\alpha ^ { * } < 1 / 3$ , almost surely. Then conditional on the counting process $N ( \\cdot )$ , we have ", + "bbox": [ + 171, + 679, + 823, + 709 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/de49dfc406302225aa201259fc74efe00181ec2000bba22e090a0b76e9b8ea06.jpg", + "text": "$$\n\\begin{array} { r } { \\underset { 1 , \\cdots , z _ { K } } { \\operatorname* { s u p } } \\left| P r ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { M B * } ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} - P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) \\right\\} \\right| } \\\\ { \\leq c \\left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \\log ^ { 1 1 / 6 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K \\} \\right] , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 710, + 839, + 775 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "for some constant $c > 0$ with probability at least $1 - O ( N ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ , where $\\textstyle P r ^ { * } ( \\cdot )$ denotes the probability measure conditional on the data stream $\\{ X _ { i } , A _ { i } , Y _ { i } \\} _ { i = 1 } ^ { + \\infty }$ . ", + "bbox": [ + 173, + 775, + 826, + 808 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "Theorem 4 Assume the conditions in Theorem 3 hold. Then conditional on $N ( \\cdot )$ , the critical values $\\{ \\widehat { z } _ { k } \\} _ { k }$ satisfy ", + "bbox": [ + 169, + 814, + 826, + 844 + ], + "page_idx": 5 + }, + { + "type": "equation", + "img_path": "images/8c089c17dd33e098e259d6459ffda19963916b3833f083f83b76ee31e36a0894.jpg", + "text": "$$\n\\begin{array} { r l } & { \\left| P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\widehat z _ { k } \\right) > 0 \\right\\} - \\alpha \\right| } \\\\ { \\leq } & { c \\left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \\log ^ { 1 1 / 6 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K N ( t _ { 1 } ) \\} \\right] , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 230, + 845, + 781, + 910 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "for some constant $c > 0$ . ", + "bbox": [ + 171, + 910, + 336, + 924 + ], + "page_idx": 5 + }, + { + "type": "text", + "text": "When the RHS of equation 11 is $o _ { p } ( 1 )$ , it follows from Theorems 2 and 4 that our test is valid. The conditional distribution in equation 10 can be approximated by the empirical distribution of Bootstrap samples. ", + "bbox": [ + 174, + 103, + 823, + 146 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "Finally, we remark that our test can be online updated as batches of observations arrive at the end of each interim stage. A pseudocode summarizing our procedure is given in Algorithm 1 in the appendix. The spatial complexity of the proposed algorithm is $O ( B )$ , where $B$ is the number of bootstrap samples. The time complexity is $\\bar { O ( } B k + \\bar { N } ( t _ { k } ) )$ up to the $k$ -th interim stage. Suppose $N ( t _ { j } ) - N ( t _ { j - 1 } ) = n$ for any $1 \\leq j \\leq K$ , we have $B k + N ( t _ { k } ) = ( B + n ) k \\ll B n k = B N ( t _ { k } )$ for large $n$ and $B$ . Hence, our procedure is much faster compared to the standard wild bootstrap. ", + "bbox": [ + 174, + 152, + 825, + 236 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4 NUMERICAL STUDIES ", + "text_level": 1, + "bbox": [ + 176, + 256, + 387, + 272 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.1 SIMULATION STUDIES ", + "text_level": 1, + "bbox": [ + 176, + 287, + 367, + 301 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In this section, we conduct Monte Carlo simulations to examine the finite sample properties of the proposed test. We generated the potential outcomes as $Y _ { i } ^ { * } ( a ) = 1 + ( X _ { i 1 } - X _ { i 2 } ) / 2 + a \\tau ( X _ { i } ) + \\varepsilon _ { i }$ , where $\\varepsilon _ { i }$ ’s are i.i.d $N ( 0 , 0 . 5 ^ { 2 } )$ . The covariates $X _ { i } ~ = ~ ( X _ { i 1 } , X _ { i 2 } , X _ { i 3 } ) ^ { \\top }$ were generated as follows. We first generated $X _ { i } ^ { * } ~ = ~ ( X _ { i 1 } ^ { * } , X _ { i 2 } ^ { * } , X _ { i 3 } ^ { * } ) ^ { \\top }$ from a multivariate normal distribution with zero mean and covariance matrix equal to $\\{ 0 . 5 ^ { | i - j | } \\} _ { i , j }$ . Then we set $X _ { i j } ~ = ~ X _ { i j } ^ { * } \\mathbb { I } ( X _ { i j } ^ { * } | ~ \\le$ $2 ) + 2 \\mathrm { s g n } ( X _ { i j } ^ { * } ) \\mathbb { I } ( X _ { i j } ^ { * } | > 2 )$ . We consider two randomization designs. In the first design, the treatment assignment is nondynamic and completely random. Specifically we set $\\textstyle \\pi _ { i } ( a , x ) = 0 . 5$ , for any $a , x$ and $i$ . In the second design, we use an $\\epsilon$ -greedy strategy to generate the treatment with $\\varepsilon = 0 . 3$ . In addition, we set $N ( T _ { 1 } ) = 2 0 0 0$ and $\\bar { N ( T _ { j } ) } - \\bar { N } \\bar { ( T _ { j - 1 } ) } ^ { - } = 2 \\bar { n }$ for $2 \\leq j \\leq K$ and some $n > 0$ . We consider two combinations of $( n , K )$ , corresponding to $( n , K ) = ( 2 0 0 , 5 )$ and (20, 50). ", + "bbox": [ + 173, + 313, + 825, + 460 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We set the significance level √ $\\alpha = 0 . 0 5$ and choose $B \\ = \\ 1 0 0 0 0$ . We set $\\tau ( X _ { i } ) = \\phi _ { \\delta } \\{ ( X _ { i 1 } +$ $X _ { i 2 } ) / \\sqrt { 2 } \\} X _ { i 3 } ^ { 2 }$ for some function $\\phi _ { \\delta }$ parameterized by some $\\delta \\geq 0$ . We consider two scenarios for $\\phi _ { \\delta }$ . Specifically, we set $\\phi _ { \\delta } ( x ) = \\delta x ^ { 2 } / 3$ in Scenario 1 and $\\phi _ { \\delta } = \\delta \\cos ( \\pi x )$ in Scenario 2. For each setting, we further consider four cases by setting $\\delta = 0 , 0 . 1 , 0 . 1 5 , 0 . 2 , 0 . 2 5$ and 0.3. When $\\delta = 0$ , $H _ { 0 }$ holds. Otherwise, $H _ { 1 }$ holds. For all settings, we construct the basis function $\\varphi ( \\cdot )$ using additive cubic splines. For each univariate spline, we set the number of internal knots to be 4. These knots are equally spaced between $[ - 2 , 2 ]$ . ", + "bbox": [ + 174, + 465, + 825, + 566 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "We denote our test by BAT, short for bootstrap-assisted test. We run our experiments on a single computer instance with 40 Intel(R) Xeon(R) 2.20GHz CPUs. It takes 1-2 seconds on average to compute each test. In Table 1 (see Appendix G), we report the rejection probabilities and average stopping times (defined as the average number of samples consumed when the experiment is terminated) of the proposed test aggregated over 400 simulations when $\\alpha _ { 1 } ( \\cdot )$ is chosen as the spending function. In Figure 2, we plot the rejection probabilities of our tests and the average stopping times of the experiments. It can be seen that the type-I error rates are close to the nominal level in all cases. The power of our test increases as $\\delta$ increases, demonstrating its consistency. In addition, when $\\delta > 0$ , our experiments are stopped early in all cases. ", + "bbox": [ + 173, + 571, + 825, + 698 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "To further evaluate our method, we compare it with a test based on the law of iterated logarithm (denoted by LIL). LIL determines the decision boundary based on an always valid finite error bound (see Appendix $\\mathrm { F }$ for details about the competing method). It can be seen from Figure 2 that our method has much larger power than the law of iterated logarithm approach. ", + "bbox": [ + 174, + 704, + 825, + 761 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "4.2 REAL DATA ANALYSIS ", + "text_level": 1, + "bbox": [ + 176, + 777, + 367, + 791 + ], + "page_idx": 6 + }, + { + "type": "text", + "text": "In this section, we apply the proposed method to a Yahoo! Today Module user click log dataset1, which contains 45,811,883 user visits to the Today Module, during the first ten days in May 2009. For the $i$ th visit, the dataset contains an ID of the new article recommended to the user, a binary response variable $Y _ { i }$ indicating whether the user clicked the article or not, and a five dimensional feature vector summarizing information of the user. Due to privacy concerns, feature definitions and article names were not included in the data. Each feature vector sums up to 1. Therefore, we took the first three and the fifth elements to form the covariates $X _ { i }$ . For illustration, we only consider a subset of data that contains visits on May 1st where the recommended article ID is either 109510 or 109520. These two articles were being recommended most on that day. This gives us a total of 405888 visits. On the reduced dataset, define $A _ { i } = 1$ if the recommended article is 109510 and $A _ { i } = 0$ otherwise. ", + "bbox": [ + 174, + 803, + 825, + 901 + ], + "page_idx": 6 + }, + { + "type": "image", + "img_path": "images/e8f1dd4aee2e95fb37aee7ba9ac609bd8fce0a4c6bbedd073021aa180f59c5ff.jpg", + "image_caption": [ + "Figure 2: Rejection probabilities and average stopping times of the proposed test when $\\alpha _ { 1 } ( \\cdot )$ is chosen as the spending function. From left to right: Scenario 1 with random design, Scenario 1 with $\\epsilon$ -greedy design, Scenario 2 with random design and Scenario 2 with $\\epsilon$ -greedy design. " + ], + "image_footnote": [], + "bbox": [ + 176, + 101, + 821, + 305 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "", + "bbox": [ + 174, + 386, + 825, + 441 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "We first conduct A/A experiments (which compare these two articles against themselves) to examine the validity of our test. The A/A experiments are done when every 2000 more users are available, we randomly assign 1000 users to arm A, and the other 1000 users in arm B. We expect our test will not reject $H _ { 0 }$ in A/A experiments, since the articles being recommended are the same. Then, we conduct A/B experiment to test the QTE of these two articles. The test statistics and their corresponding critical values are plotted in Figure 3. On average it takes several seconds to implement our test. It can be seen that our test is able to be reject $H _ { 0 }$ after obtaining the first one-third of the observations, in the A/B experiment. In the A/A experiments, we fail to reject $H _ { 0 }$ , as expected. ", + "bbox": [ + 173, + 449, + 825, + 560 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "5 DISCUSSION ", + "text_level": 1, + "bbox": [ + 174, + 580, + 310, + 597 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "In this paper, we propose a new testing procedure for evaluating the performance of technology products in tech companies based on the notion of qualitative treatment effects. Currently, we only focus on comparing two products. It would be practically useful to develop a multiple testing procedure under settings with multiple treatment options. These topics warrant further investigations. ", + "bbox": [ + 174, + 613, + 825, + 667 + ], + "page_idx": 7 + }, + { + "type": "image", + "img_path": "images/d07ec0bda641ab04da632fa857aca2761150230607e09e18e0434c03477db667.jpg", + "image_caption": [ + "Figure 3: Critical values and test statistics. " + ], + "image_footnote": [], + "bbox": [ + 173, + 699, + 821, + 901 + ], + "page_idx": 7 + }, + { + "type": "text", + "text": "REFERENCES ", + "text_level": 1, + "bbox": [ + 174, + 103, + 285, + 118 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Donald W. K. Andrews and Xiaoxia Shi. Inference based on conditional moment inequalities. Econometrica, 81(2):609–666, 2013. ISSN 0012-9682. doi: 10.3982/ECTA9370. URL http://dx.doi.org/10.3982/ECTA9370. ", + "bbox": [ + 174, + 126, + 821, + 169 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Donald W. K. Andrews and Xiaoxia Shi. Nonparametric inference based on conditional moment inequalities. J. Econometrics, 179(1):31–45, 2014. ISSN 0304-4076. doi: 10.1016/j.jeconom. 2013.10.005. URL http://dx.doi.org/10.1016/j.jeconom.2013.10.005. ", + "bbox": [ + 176, + 178, + 823, + 222 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Timothy B. Armstrong and Hock Peng Chan. Multiscale adaptive inference on conditional moment inequalities. J. Econometrics, 194(1):24–43, 2016. ISSN 0304-4076. doi: 10.1016/j.jeconom. 2016.04.001. URL http://dx.doi.org/10.1016/j.jeconom.2016.04.001. ", + "bbox": [ + 176, + 231, + 823, + 273 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Susan Athey and Guido Imbens. Recursive partitioning for heterogeneous causal effects. Proc. Natl. Acad. Sci. USA, 113(27):7353–7360, 2016. ISSN 1091-6490. doi: 10.1073/pnas.1510489113. URL https://doi.org/10.1073/pnas.1510489113. ", + "bbox": [ + 174, + 284, + 825, + 327 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Alexandre Belloni and Roberto I Oliveira. A high dimensional central limit theorem for martingales, with applications to context tree models. arXiv preprint arXiv:1809.02741, 2018. ", + "bbox": [ + 171, + 335, + 823, + 364 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Bernard Bercu and Abderrahmen Touati. Exponential inequalities for self-normalized martingales with applications. Ann. Appl. Probab., 18(5):1848–1869, 2008. ISSN 1050-5164. doi: 10.1214/ 07-AAP506. URL https://doi.org/10.1214/07-AAP506. ", + "bbox": [ + 173, + 375, + 823, + 417 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Prabir Burman and Keh-Wei Chen. Nonparametric estimation of a regression function. Ann. Statist., 17(4):1567–1596, 1989. ISSN 0090-5364. doi: 10.1214/aos/1176347382. ", + "bbox": [ + 169, + 426, + 823, + 455 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Minsu Chang, Sokbae Lee, and Yoon-Jae Whang. Nonparametric tests of conditional treatment effects with an application to single-sex schooling on academic achievements. Econom. J., 18(3): 307–346, 2015. ISSN 1368-4221. ", + "bbox": [ + 173, + 464, + 823, + 508 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Xiaohong Chen and Timothy M. Christensen. Optimal uniform convergence rates and asymptotic normality for series estimators under weak dependence and weak conditions. J. Econometrics, 188(2):447–465, 2015. ISSN 0304-4076. doi: 10.1016/j.jeconom.2015.03.010. ", + "bbox": [ + 173, + 517, + 823, + 560 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Victor Chernozhukov, Sokbae Lee, and Adam M. Rosen. Intersection bounds: estimation and inference. Econometrica, 81(2):667–737, 2013. ISSN 0012-9682. doi: 10.3982/ECTA8718. URL http://dx.doi.org/10.3982/ECTA8718. ", + "bbox": [ + 174, + 569, + 821, + 613 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Victor Chernozhukov, Denis Chetverikov, and Kengo Kato. Empirical and multiplier bootstraps for suprema of empirical processes of increasing complexity, and related Gaussian couplings. Stochastic Process. Appl., 126(12):3632–3651, 2016. ISSN 0304-4149. doi: 10.1016/j.spa.2016. 04.009. URL https://doi.org/10.1016/j.spa.2016.04.009. ", + "bbox": [ + 173, + 622, + 825, + 680 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Victor Chernozhukov, Denis Chetverikov, and Kengo Kato. Detailed proof of nazarov’s inequality. arXiv preprint arXiv:1711.10696, 2017. ", + "bbox": [ + 174, + 688, + 823, + 718 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "M Gail and R Simon. Testing for qualitative interactions between treatment effects and patient subsets. Biometrics, 41(2):361–372, 1985. ", + "bbox": [ + 169, + 727, + 825, + 756 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Yu-Chin Hsu. Consistent tests for conditional treatment effects. The Econometrics Journal, 20(1): 1–22, 2017. ", + "bbox": [ + 173, + 765, + 823, + 795 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Jianhua Z. Huang. Projection estimation in multiple regression with application to functional ANOVA models. Ann. Statist., 26(1):242–272, 1998. ISSN 0090-5364. doi: 10.1214/aos/ 1030563984. ", + "bbox": [ + 173, + 804, + 823, + 847 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Christopher Jennison and Bruce W Turnbull. Group sequential methods with applications to clinical trials. Chapman and Hall/CRC, 1999. ", + "bbox": [ + 173, + 856, + 821, + 886 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Ramesh Johari, Leo Pekelis, and David J Walsh. Always valid inference: Bringing sequential analysis to a/b testing. arXiv preprint arXiv:1512.04922, 2015. ", + "bbox": [ + 174, + 895, + 820, + 924 + ], + "page_idx": 8 + }, + { + "type": "text", + "text": "Ramesh Johari, Pete Koomen, Leonid Pekelis, and David Walsh. Peeking at a/b tests: Why it matters, and what to do about it. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1517–1525. ACM, 2017. ", + "bbox": [ + 174, + 103, + 821, + 147 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Nianqiao Ju, Diane Hu, Adam Henderson, and Liangjie Hong. A sequential test for selecting the better variant: Online a/b testing, adaptive allocation, and continuous monitoring. In Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 492–500. ACM, 2019. ", + "bbox": [ + 173, + 155, + 826, + 210 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Eugene Kharitonov, Aleksandr Vorobev, Craig Macdonald, Pavel Serdyukov, and Iadh Ounis. Sequential testing for early stopping of online experiments. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 473–482. ACM, 2015. ", + "bbox": [ + 173, + 220, + 826, + 277 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "K. K. Gordon Lan and David L. DeMets. Discrete sequential boundaries for clinical trials. Biometrika, 70(3):659–663, 1983. ISSN 0006-3444. doi: 10.2307/2336502. URL https: //doi.org/10.2307/2336502. ", + "bbox": [ + 173, + 286, + 825, + 329 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Gregory Morrow and Walter Philipp. An almost sure invariance principle for Hilbert space valued martingales. Trans. Amer. Math. Soc., 273(1):231–251, 1982. ISSN 0002-9947. doi: 10.2307/ 1999203. URL https://doi.org/10.2307/1999203. ", + "bbox": [ + 174, + 338, + 823, + 382 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Jeremy Roth and Noah Simon. A framework for estimating and testing qualitative interactions with applications to predictive biomarkers. Biostatistics, 19(3):263–280, 2018. ISSN 1468-4357. doi: 10.1093/biostatistics/kxx038. URL https://doi.org/10.1093/ biostatistics/kxx038. ", + "bbox": [ + 173, + 390, + 825, + 446 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "D.B. Rubin. Estimating causal effects of treatments in randomized and non-randomized studies. J. Edu. Psychol., 66:688–701, 1974. ", + "bbox": [ + 171, + 455, + 823, + 484 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Donald B. Rubin. Causal inference using potential outcomes: design, modeling, decisions. J. Amer. Statist. Assoc., 100(469):322–331, 2005. ISSN 0162-1459. doi: 10.1198/016214504000001880. URL https://doi.org/10.1198/016214504000001880. ", + "bbox": [ + 174, + 494, + 825, + 537 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Chengchun Shi, Wenbin Lu, and Rui Song. A sparse random projection-based test for overall qualitative treatment effects. Journal of the American Statistical Association, 115(531):12011213, 2020a. ", + "bbox": [ + 173, + 546, + 825, + 588 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Chengchun Shi, Sheng Zhang, Rui Song, and Wenbin Lu. Statistical Inference of the Value Function for Reinforcement Learning in Infinite Horizon Settings. Under review, 2020b. ", + "bbox": [ + 173, + 598, + 823, + 627 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Charles J. Stone. Optimal global rates of convergence for nonparametric regression. Ann. Statist., 10(4):1040–1053, 1982. ISSN 0090-5364. ", + "bbox": [ + 173, + 636, + 823, + 665 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Matt Taddy, Matt Gardner, Liyun Chen, and David Draper. A nonparametric bayesian analysis of heterogenous treatment effects in digital experimentation. Journal of Business & Economic Statistics, 34(4):661–672, 2016. ", + "bbox": [ + 173, + 672, + 825, + 717 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Stefan Wager and Susan Athey. Estimation and inference of heterogeneous treatment effects using random forests. J. Amer. Statist. Assoc., 113(523):1228–1242, 2018. ISSN 0162-1459. doi: 10.1080/01621459.2017.1319839. URL https://doi.org/10.1080/01621459. 2017.1319839. ", + "bbox": [ + 173, + 726, + 825, + 782 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "C.-F. J. Wu. Jackknife, bootstrap and other resampling methods in regression analysis. Ann. Statist., 14(4):1261–1350, 1986. ISSN 0090-5364. doi: 10.1214/aos/1176350142. URL https:// doi.org/10.1214/aos/1176350142. With discussion and a rejoinder by the author. ", + "bbox": [ + 174, + 791, + 823, + 835 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Fanny Yang, Aaditya Ramdas, Kevin G Jamieson, and Martin J Wainwright. A framework for multia (rmed)/b (andit) testing with online fdr control. In Advances in Neural Information Processing Systems, pp. 5957–5966, 2017. ", + "bbox": [ + 173, + 843, + 825, + 886 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Miao Yu, Wenbin Lu, and Rui Song. A new framework for online testing of heterogeneous treatment effect. In AAAI, pp. 10310–10317, 2020. ", + "bbox": [ + 173, + 895, + 821, + 924 + ], + "page_idx": 9 + }, + { + "type": "text", + "text": "Input: Number of bootstrap samples $B$ , an $\\alpha$ spending function $\\alpha ( \\cdot )$ ", + "bbox": [ + 192, + 104, + 642, + 118 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Initialize: $n = 0$ , $\\widehat { \\Sigma } _ { 0 } = \\widehat { \\Sigma } _ { 1 } = { \\cal O } _ { p + 1 }$ , $\\widehat { \\gamma } _ { 0 } = \\widehat { \\gamma } _ { 1 } = 0 _ { p + 1 }$ , $\\widehat { \\beta } _ { 0 , b } = \\widehat { \\beta } _ { 1 , b } = 0 _ { p + 1 }$ , and a set $\\mathcal { T } = \\{ 1 , \\ldots , B \\}$ . \nFor $k = 1$ to $K$ do ", + "bbox": [ + 189, + 119, + 753, + 160 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Initialize: $m = 0$ and $\\widehat { \\Phi } _ { 0 } = \\widehat { \\Phi } _ { 1 } = O _ { p + 1 }$ ", + "bbox": [ + 205, + 161, + 478, + 178 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Step 1: Online update of ${ \\widehat { \\beta } } _ { a }$ \nFor $i = N ( t _ { k - 1 } ) \\bar { { + } 1 }$ to $N ( t _ { k } )$ do $n = n + 1$ and $m = m + 1$ ; $\\widehat { \\Sigma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\Sigma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;$ $\\widehat { \\gamma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\gamma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) Y _ { i } \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;$ ", + "bbox": [ + 205, + 180, + 637, + 252 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "bCompute $\\widehat { \\beta } _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\widehat { \\gamma } _ { a }$ for $a \\in \\{ 0 , 1 \\}$ and $S = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 } - \\widehat { \\beta } _ { 0 } ) ;$ ", + "bbox": [ + 202, + 252, + 687, + 270 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Step 2: Bootstrap ", + "text_level": 1, + "bbox": [ + 207, + 268, + 331, + 281 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Generate two independent ${ \\cal N } ( 0 , I _ { p + 1 } )$ Gaussian vectors $e _ { 0 } , e _ { 1 }$ ", + "bbox": [ + 217, + 327, + 635, + 340 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Step 3: Reject or not ", + "text_level": 1, + "bbox": [ + 207, + 376, + 352, + 388 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Set $z$ to be the upper $\\{ \\alpha ( t ) - | \\mathcal { T } | ^ { c } / B | \\} / ( 1 - | \\mathcal { T } ^ { c } | / B )$ -th percentile of $\\{ \\widehat { S } _ { b } \\} _ { b \\in \\mathbb { Z } }$ Update $\\mathcal { T }$ as ${ \\mathcal { T } } \\{ b \\in { \\mathcal { T } } : { \\widehat { S } } _ { b } \\leq z \\}$ . ", + "bbox": [ + 207, + 390, + 728, + 421 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "If $S > z$ : Reject $H _ { 0 }$ and terminate the experiment. ", + "bbox": [ + 209, + 422, + 539, + 435 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Algorithm 1: the Pseudocode that summarizing the online bootstrap testing procedure. ", + "bbox": [ + 210, + 436, + 784, + 452 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Baqun Zhang, Anastasios A Tsiatis, Eric B Laber, and Marie Davidian. Robust estimation of optimal dynamic treatment regimes for sequential treatment decisions. Biometrika, 100(3):681–694, 2013. ", + "bbox": [ + 174, + 481, + 825, + 523 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "Li-xin Zhang. Strong approximations of martingale vectors and their applications in Markovchain adaptive designs. Acta Math. Appl. Sin. Engl. Ser., 20(2):337–352, 2004. ISSN 0168-9673. doi: 10.1007/s10255-004-0173-z. URL https://doi.org/10.1007/ $\\mathtt { s 1 0 2 5 5 - 0 0 4 - 0 1 7 3 - z }$ . ", + "bbox": [ + 173, + 535, + 825, + 590 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "A NOTATIONS ", + "text_level": 1, + "bbox": [ + 174, + 612, + 308, + 628 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "We introduce some general notations used in the appendix. For any matrix Mat, we use $\\left\\| \\mathbf { M a t } \\right\\| _ { p }$ to denote the matrix norm induced by the corresponding $\\ell _ { p }$ norm of vectors, for $1 \\leq p \\leq + \\infty$ . For two nonnegative sequences $\\{ s _ { 1 , n } \\} _ { n }$ and $\\{ s _ { 2 , n } \\} _ { n }$ , we will use the notation $s _ { 1 , n } \\preceq s _ { 2 , n }$ to represent that $s _ { 1 , n } \\leq \\bar { c } s _ { 2 , n }$ for some universal constant $\\bar { c } > 0$ whose value is allowed to change from place to place. When a matrix Mat is degenerate, $\\mathrm { { M a t } ^ { - 1 } }$ denotes the Moore-Penrose inverse of Mat. For any vector $\\psi$ , we use $\\psi ^ { ( i ) }$ to denote its $i$ -th element. ", + "bbox": [ + 173, + 643, + 825, + 731 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "In Algorithm 1, we use $O _ { p + 1 }$ to denote a $( p + 1 ) \\times ( p + 1 )$ zero matrix and $0 _ { p + 1 }$ to denote a $( p + 1 )$ -dimensional zero vector. ", + "bbox": [ + 174, + 737, + 823, + 767 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "B MORE ON THE BASIS FUNCTION ", + "text_level": 1, + "bbox": [ + 174, + 787, + 475, + 804 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "B.1 CONDITION (A3) ", + "text_level": 1, + "bbox": [ + 174, + 819, + 338, + 834 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "(A3). Assume $\\lambda _ { \\operatorname* { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1 , \\lambda _ { \\operatorname* { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1 , \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } = O ( q ^ { \\top } ) ,$ , $\\begin{array} { r } { \\operatorname* { l i m } \\operatorname* { i n f } _ { q } \\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } > 0 } \\end{array}$ . In addition, assume ", + "bbox": [ + 171, + 844, + 823, + 876 + ], + "page_idx": 10 + }, + { + "type": "equation", + "img_path": "images/bc37a934116573d3dc38916594e2a8986748d69fedf32e57370035f29b24b164.jpg", + "text": "$$\n\\operatorname* { s u p } _ { x , y \\in \\mathbb { X } } \\frac { \\| \\varphi ( x ) - \\varphi ( y ) \\| _ { 2 } } { \\| x - y \\| _ { 2 } } \\preceq q ^ { 1 / 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 377, + 882, + 588, + 928 + ], + "page_idx": 10 + }, + { + "type": "text", + "text": "When a tensor-product B-spline is used (see Section 6 of Chen & Christensen, 2015, for a brief overview of tenor-product B-splines), (A3) is automatically satisfied. Specifically, $\\lambda _ { \\operatorname* { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1$ , $\\dot { \\lambda } _ { \\mathrm { m a x } } [ \\mathrm { E } \\varphi ( X ) \\dot { \\varphi } ^ { \\top } ( X ) ] \\asymp 1$ follow from Theorem 3.3 of (Burman & Chen, 1989). $\\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } = O ( q ^ { 1 / 2 } )$ follows by noting that the absolute value of each element in $\\varphi ( x )$ is bounded by some universal constant. $\\begin{array} { r } { \\operatorname* { l i m } \\operatorname* { i n f } _ { q } \\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } > 0 } \\end{array}$ follows from the arguments used in the proof of Lemma E.4 of Shi et al. (2020b). The last condition in equation 12 holds by noting that each function in the vector $\\varphi ( \\cdot )$ is Lipschitz continuous when a tensor-product B-spline is used. ", + "bbox": [ + 173, + 102, + 826, + 217 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "B.2 ON THE APPROXIMATION ERROR ", + "text_level": 1, + "bbox": [ + 176, + 233, + 442, + 247 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "The proposed test remains valid as long as the approximation error satisfies ", + "bbox": [ + 176, + 258, + 668, + 273 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/6430aad6083eb26df949d353ffe25fae3d6ebf25c588fd090be324281029d7e1.jpg", + "text": "$$\n\\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | = o ( \\{ N ( T ) \\} ^ { - 1 / 2 } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 253, + 275, + 710, + 305 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "with probability tending to 1. In the following, we introduce some sufficient conditions for equation 13. ", + "bbox": [ + 173, + 306, + 820, + 335 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Suppose the Q-function $Q _ { 0 } ( \\cdot , a )$ is $p$ -smooth (see the definition of $p$ -smoothness in Stone, 1982), for $a \\in [ 0 , 1 ]$ . When a tensor-product B-spline or Wavelet basis is used for $\\varphi ( \\cdot )$ , then there exist some $\\beta _ { 0 } ^ { \\ast }$ and $\\beta _ { 1 } ^ { * }$ that satisfy ", + "bbox": [ + 174, + 342, + 823, + 385 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/6f0c8d27a0832b66adf8ddbdacb13e7232ac3886671974707e0449ff1a0c8b98.jpg", + "text": "$$\n\\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | = O ( q ^ { - p / d } ) .\n$$", + "text_format": "latex", + "bbox": [ + 274, + 386, + 689, + 416 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "See Section 2.2 of Huang (1998) for detailed discussions on the approximation power of these basis functions. Condition equation 13 is thus automatically satisfied when ", + "bbox": [ + 176, + 417, + 821, + 446 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/889508cae5e1cb04f39271104cc0322b564e84f205d454d257c722e9fb152fa4.jpg", + "text": "$$\nq \\gg \\{ N ( T ) \\} ^ { d / ( 2 p ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 415, + 448, + 549, + 468 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "with probability tending to 1. ", + "bbox": [ + 174, + 469, + 366, + 484 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "C ADAPTIVE RANDOMIZATION ", + "text_level": 1, + "bbox": [ + 176, + 503, + 444, + 520 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "In practice, the company might want to allocate more traffic to a better treatment based on the observed data stream. The $\\epsilon$ -greedy strategy is commonly used to balance the trade-off between exploration and exploitation. For a given $0 < \\varepsilon _ { 0 } < 1$ , consider the following randomization procedure: for some integer $N _ { 0 } > 0$ and any $j \\geq N _ { 0 }$ , $a \\in \\{ 0 , 1 \\}$ , $x \\in \\mathbb { X }$ , we set ", + "bbox": [ + 173, + 534, + 826, + 590 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "π $\\begin{array} { r } { \\tau _ { j - 1 } ( a , x ) = ( 1 - \\varepsilon _ { 0 } ) a \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 , j - 1 } - \\widehat { \\beta } _ { 0 , j - 1 } ) > 0 \\} + \\varepsilon _ { 0 } ( 1 - a ) \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 , j - 1 } - \\widehat { \\beta } _ { 0 , j - 1 } ) \\leq 0 } \\end{array}$ }, where ", + "bbox": [ + 171, + 592, + 849, + 628 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/51ce5207529e43fe8b1a8407d42df5c52d861bba4c23d54c7ffc6cf999fa8809.jpg", + "text": "$$\n\\widehat { \\beta } _ { a , j } = \\widehat { \\Sigma } _ { a , j } ^ { - 1 } \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\} \\mathrm { a n d } \\widehat { \\Sigma } _ { a , j } = \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) .\n$$", + "text_format": "latex", + "bbox": [ + 197, + 627, + 766, + 671 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "It is immediate to see that $\\widehat { \\Sigma } _ { a } ( t ) = \\widehat { \\Sigma } _ { a , n ( t ) }$ and $\\widehat { \\beta } _ { a } ( t ) = \\widehat { \\beta } _ { a , n ( t ) }$ . Define ", + "bbox": [ + 173, + 672, + 642, + 693 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/8dcafb92bd47026ee739b96321c0f6d8c86aeb71f23d2e2c317e40e581414d03.jpg", + "text": "$$\n\\pi ^ { * } ( a , x ) = ( 1 - \\varepsilon _ { 0 } ) a \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } - \\beta _ { 0 } ) > 0 \\} + \\varepsilon _ { 0 } ( 1 - a ) \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\leq 0 \\}\n$$", + "text_format": "latex", + "bbox": [ + 205, + 694, + 759, + 713 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "for any $a \\in \\{ 0 , 1 \\}$ and $x \\in \\mathbb { X }$ . ", + "bbox": [ + 173, + 715, + 370, + 731 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Lemma 2 Assume (A1)-(A3) hold. Assume $\\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\pi ^ { * } ( a , x ) > 0$ and $\\left| Y ^ { * } ( a ) \\right|$ is bounded almost surely, for $a \\in \\{ 0 , 1 \\}$ . Assume $P r ( | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\bar { \\beta } _ { 0 } ) | \\le \\epsilon ) \\ \\le L _ { 0 } \\mathfrak { e }$ \u000f, for some constant $L _ { 0 } > 0$ and any $\\epsilon > 0$ . Then for any $\\{ j _ { n } \\} _ { n }$ that satisfies $\\sqrt { j _ { n } } / \\sqrt { \\log j _ { n } } \\gg q ^ { 2 }$ , the following event occurs with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ , ", + "bbox": [ + 173, + 738, + 826, + 797 + ], + "page_idx": 11 + }, + { + "type": "equation", + "img_path": "images/861230d88193766b7e64c8aa4c8a9354e7d1962583cb02ceab07107e1fb29111.jpg", + "text": "$$\n \\sum _ { a \\in \\{ 0 , 1 \\} } E ^ { \\mathcal { F } _ { i - 1 } } | \\sum _ { i = 1 } ^ { k } \\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\} | \\preceq q \\sqrt { k \\log k } , \\forall k \\geq j _ { n } .\n$$", + "text_format": "latex", + "bbox": [ + 246, + 797, + 717, + 843 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "Lemma 2 implies that Condition equation 5 in Theorem 1 automatically holds with $\\alpha _ { 0 } = 1 / 2$ , when the epsilon-greedy strategy is used. When $\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } )$ is a continuous random variable, the assumption $\\bar { \\operatorname* { P r } } ( | \\varphi ^ { \\top } ( X ) ( \\bar { \\beta _ { 1 } } - \\beta _ { 0 } ) | \\leq \\epsilon ) \\leq { \\dot { L _ { 0 } } } \\epsilon$ for any $\\epsilon > 0$ in Lemma 2 is satisfied if $\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } -$ $\\beta _ { 0 , }$ ) has a bounded probability density function. When $\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } )$ is discrete, this assumption is satisfied if $\\begin{array} { r } { \\operatorname* { i n f } _ { x \\in \\bar { \\mathbb { X } } } | \\varphi ^ { \\top } ( x ) \\dot { ( \\beta _ { 1 } - \\beta _ { 0 } ) } | > 0 } \\end{array}$ . ", + "bbox": [ + 173, + 853, + 825, + 925 + ], + "page_idx": 11 + }, + { + "type": "text", + "text": "D TESTING THE AVERAGE TREATMENT EFFECTS ", + "text_level": 1, + "bbox": [ + 173, + 102, + 589, + 118 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "D.1 THE ALGORITHM ", + "text_level": 1, + "bbox": [ + 174, + 133, + 338, + 148 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We focus on testing the following hypothesis, ", + "bbox": [ + 176, + 159, + 473, + 174 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/cd2d5b140d865ccb4ec9daf6fd35f1e2fe3068f80c03443af72c60966d2eeb85.jpg", + "text": "$$\nH _ { 0 } : { \\mathrm { E } } Y _ { i } ^ { * } ( 1 ) \\leq { \\mathrm { E } } Y _ { i } ^ { * } ( 0 ) { \\mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \\mathrm { E } } Y _ { i } ^ { * } ( 1 ) > { \\mathrm { E } } Y _ { i } ^ { * } ( 0 ) .\n$$", + "text_format": "latex", + "bbox": [ + 287, + 181, + 674, + 199 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Under (A1) and (A2), it suffices to test ", + "bbox": [ + 174, + 204, + 429, + 219 + ], + "page_idx": 12 + }, + { + "type": "equation", + "img_path": "images/98de986d12bede2b34cc5b2d8ff73e7d6a523890d25d368bf55e9510da81abcb.jpg", + "text": "$$\nH _ { 0 } : { \\mathrm { E } } Q ( X _ { i } , 1 ) \\leq { \\mathrm { E } } Q ( X _ { i } , 0 ) { \\mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \\mathrm { E } } Q ( X _ { i } , 1 ) > { \\mathrm { E } } Q ( X _ { i } , 0 ) .\n$$", + "text_format": "latex", + "bbox": [ + 250, + 227, + 714, + 243 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "We similarly use basis approximations to model the Q-function. Our proposal is summarized in the following algorithm. We next conduct simulation studies to evaluate this algorithm. ", + "bbox": [ + 174, + 251, + 826, + 280 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Input: Number of bootstrap samples $B$ , an $\\alpha$ spending function $\\alpha ( \\cdot )$ ", + "bbox": [ + 189, + 295, + 645, + 310 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Initialize: $n = 0$ , $\\widehat { \\Sigma } _ { 0 } = \\widehat { \\Sigma } _ { 1 } = O _ { p + 1 }$ , $\\widehat { \\gamma } _ { 0 } = \\widehat { \\gamma } _ { 1 } = 0 _ { p + 1 }$ , $\\widehat { \\beta } _ { 0 , b } = \\widehat { \\beta } _ { 1 , b } = 0 _ { p + 1 }$ , $\\bar { \\varphi } = 0$ and a set $\\mathcal { T } = \\{ 1 , \\ldots , B \\}$ . \nFor $k = 1$ to $K$ do ", + "bbox": [ + 189, + 310, + 800, + 352 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Initialize: $m = 0$ , $\\widehat { \\phi } = 0$ and $\\widehat { \\Phi } _ { 0 } = \\widehat { \\Phi } _ { 1 } = O _ { p + 1 }$ ", + "bbox": [ + 205, + 353, + 526, + 369 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "For $i = N ( t _ { k - 1 } ) + 1$ to $N ( t _ { k } )$ do ", + "bbox": [ + 205, + 381, + 436, + 396 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "bCompute $\\widehat { \\beta } _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\widehat { \\gamma } _ { a }$ for $a \\in \\{ 0 , 1 \\}$ and $S = \\bar { \\varphi } ^ { \\top } ( \\widehat { \\beta } _ { 1 } - \\widehat { \\beta } _ { 0 } )$ ; ", + "bbox": [ + 205, + 443, + 614, + 458 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "For $b = 1 , \\dots , B$ do ", + "bbox": [ + 205, + 518, + 348, + 531 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Generate two independent $N ( 0 , I _ { p + 1 } )$ Gaussian vectors e0, e1, $N ( 0 , 1 )$ random variable $e _ { 2 }$ $\\widehat { \\beta } _ { a , b } = ( 1 - m n ^ { - 1 } ) \\widehat { \\beta } _ { a , b } + n ^ { - 1 } \\widehat { \\Phi } _ { a } ^ { 1 / 2 } e _ { a } + n ^ { - 1 } \\widehat { \\phi } ^ { 1 / 2 } e _ { 2 } , a = 0 , 1$ ; \nCompute $\\widehat { S } _ { b } = \\bar { \\varphi } ^ { \\top } ( \\widehat { \\beta } _ { 1 , b } - \\widehat { \\beta } _ { 0 , b } )$ ; Set $z$ to be the upper $\\{ \\alpha ( t ) - | \\mathcal { T } | ^ { c } / B | \\} / ( 1 - | \\mathcal { T } ^ { c } | / B )$ -th percentile of $\\{ \\widehat { S } _ { b } \\} _ { b \\in \\mathbb { Z } }$ ; Update $\\mathcal { T }$ as ${ \\mathcal { T } } \\{ b \\in { \\mathcal { T } } : { \\widehat { S } } _ { b } \\leq z \\}$ . \nIf $S > z$ : ", + "bbox": [ + 217, + 532, + 818, + 583 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "", + "bbox": [ + 205, + 593, + 730, + 638 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Reject $H _ { 0 }$ and terminate the experiment; ", + "bbox": [ + 223, + 640, + 490, + 654 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "D.2 NUMERICAL STUDIES ", + "text_level": 1, + "bbox": [ + 174, + 684, + 369, + 699 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In this section, we compare our procedure with the always valid test for testing ATE (Johari et al., 2015). We generate the potential outcomes with the same model, except that $\\varepsilon _ { i }$ ’s are i.i.d $N ( 0 , 1 )$ . However, we set $N ( T _ { 1 } ) \\stackrel { - } { = } 1 0 0 0$ and $N ( T _ { j } ) - N ( T _ { j - 1 } ) = 2 n$ for $2 \\leq j \\leq K$ and some $n > 0$ . We consider two combinations of $( n , K )$ , corresponding to $( n , K ) = ( 1 0 0 , 5 )$ and (10, 50). For all settings, we use a linear function to approximate $Q$ . ", + "bbox": [ + 173, + 710, + 825, + 781 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "In Table 2 (see Appendix G) and Figure 4, we show the rejection probabilities and average stopping times of the proposed test aggregated over 400 simulations, when $\\alpha _ { 1 } ( \\cdot )$ is chosen as the spending function. It can be seen that our method behaves better than the always valid test when the effect size is small, and comparable when the effect size is large. The always valid test fails in the adaptive randomization settings, as the type-I error rates are around $50 \\%$ under the null hypothesis. ", + "bbox": [ + 174, + 786, + 825, + 858 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "E PROOFS ", + "text_level": 1, + "bbox": [ + 174, + 877, + 274, + 893 + ], + "page_idx": 12 + }, + { + "type": "text", + "text": "Note that we require $\\mathbb { X }$ to be a compact set. To simplify the proof, we assume $\\mathbb { X } = [ 0 , 1 ] ^ { d }$ . ", + "bbox": [ + 171, + 909, + 764, + 924 + ], + "page_idx": 12 + }, + { + "type": "image", + "img_path": "images/190f52fa2835cb10c09afb066ce68d7c745ed90ba954fd3930ae64a0529ced2e.jpg", + "image_caption": [ + "Figure 4: Rejection probabilities and average stopping times of the proposed test when $\\alpha _ { 1 } ( \\cdot )$ is chosen as the spending function. " + ], + "image_footnote": [], + "bbox": [ + 174, + 102, + 823, + 328 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "E.1 PROOF OF LEMMA 1 ", + "text_level": 1, + "bbox": [ + 174, + 391, + 356, + 405 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Set $\\mathcal { F } _ { 0 } = \\emptyset$ . We state the following lemma before proving Lemma 1. ", + "bbox": [ + 173, + 416, + 622, + 433 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lemma 3 For any $j \\geq 1$ $, ( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp \\mathcal { F } _ { j - 1 } .$ ", + "bbox": [ + 173, + 441, + 544, + 460 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For any $a \\in \\{ 0 , 1 \\} , i \\geq 1$ , notice that ", + "bbox": [ + 173, + 470, + 419, + 487 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/730e082aa5bcd7ccd7ef1a389e2354703f0f25ee81cfbe8c4b5669672572797b.jpg", + "text": "$$\n\\begin{array} { r } { \\mathrm { E I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} = \\mathrm { E I } ( A _ { i } = a ) \\{ Y _ { i } ^ { \\ast } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} } \\\\ { = \\mathrm { E E } ^ { X _ { i } , F _ { i - 1 } } [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } ^ { \\ast } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 256, + 492, + 707, + 534 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "where the first equation is due to Assumption (A1) and $\\mathrm { E } ^ { X _ { i } , \\mathcal { F } _ { i - 1 } }$ denotes the conditional expectation given $\\mathcal { F } _ { i - 1 }$ and $X _ { i }$ . By Assumption (A2), we have ", + "bbox": [ + 173, + 537, + 828, + 568 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/677db7c669ac5bb198a0f6cd4e41da9bafa76cfe6ddaad6407a4095eb4c7afcb.jpg", + "text": "$$\n{ } _ { \\mathfrak { X } ^ { \\lambda _ { i } , F _ { i - 1 } } [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] } = \\{ \\mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \\mathbb { I } ( A _ { i } = a ) \\} [ \\mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ]\n$$", + "text_format": "latex", + "bbox": [ + 181, + 573, + 839, + 593 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "The second term on the RHS equals zero due to Lemma 3 and our model assumption $\\operatorname { E } \\{ Y _ { i } ^ { * } ( a ) | X _ { i } \\} = \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a }$ . The proof is hence completed. ", + "bbox": [ + 173, + 598, + 833, + 627 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "E.2 PROOF OF THEOREM 1 ", + "text_level": 1, + "bbox": [ + 174, + 642, + 374, + 659 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Let $n ( \\cdot )$ be the realization of the counting process $N ( \\cdot )$ . We will show the assertion in Theorem 1 holds for any such realizations that satisfy $n ( t _ { 1 } ) < n ( t _ { 2 } ) < \\cdot \\cdot \\cdot < n ( t _ { K } )$ . The case where some of the $n ( t _ { k } )$ ’s are the same can be similarly discussed. ", + "bbox": [ + 173, + 669, + 826, + 712 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "For any $j \\geq 1$ , define $\\sigma ( \\mathcal { F } _ { j } )$ to be the $\\sigma$ -algebra generated by ${ \\mathcal { F } } _ { j }$ . For $a \\in \\{ 0 , 1 \\}$ , define ", + "bbox": [ + 171, + 718, + 751, + 734 + ], + "page_idx": 13 + }, + { + "type": "equation", + "img_path": "images/678e7b08efa7470f9b2f2800f0d96ad6c5f215135bf4ebd3f8fde5b9cef4fcee.jpg", + "text": "$$\n\\widehat { \\Sigma } _ { a , j } = \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\ \\mathrm { ~ a n d ~ } \\widehat { \\beta } _ { a , j } = \\widehat { \\Sigma } _ { a , j } ^ { - 1 } \\left( \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 192, + 741, + 772, + 785 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "It is immediate to see that $\\widehat { \\Sigma } _ { a } ( t ) = \\widehat { \\Sigma } _ { a , n ( t ) }$ and $\\widehat { \\beta } _ { a } ( t ) = \\widehat { \\beta } _ { a , n ( t ) }$ . Define $\\delta _ { n } = q n ^ { - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } n$ . We state the following lemmas before proving Theorem 1. ", + "bbox": [ + 171, + 790, + 825, + 823 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lemma 4 There exists some constant $0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1$ such that $\\lambda _ { \\operatorname* { m i n } } [ E \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] ~ \\geq ~ \\epsilon _ { 0 } ,$ , $\\begin{array} { r } { \\operatorname* { m a x } [ E \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\leq \\epsilon _ { 0 } ^ { - 1 } , \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 2 } \\leq \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } , \\operatorname* { m i n } _ { a \\in \\{ 0 , 1 \\} } \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\geqslant \\epsilon _ { 0 } ^ { - 1 } } \\end{array}$ \u000f0, $\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\beta _ { a } \\| _ { 2 } \\leq \\epsilon _ { 0 } ^ { - 1 } , } \\end{array}$ , $\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | Y ^ { * } ( a ) | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}$ and $\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | \\varphi ^ { \\top } ( x ) \\beta _ { a } | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}$ . ", + "bbox": [ + 173, + 833, + 825, + 885 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "Lemma 5 Assume the conditions in Theorem $I$ hold. Then for any sequence $\\{ j _ { n } \\} _ { n }$ that satisfies $j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } ( j _ { n } ) \\gg q ^ { 2 }$ , we have with probability at least $1 - O ( j _ { n } ^ { - \\alpha _ { 0 } } )$ that for any $a \\in \\{ 0 , 1 \\}$ and ", + "bbox": [ + 169, + 895, + 825, + 925 + ], + "page_idx": 13 + }, + { + "type": "text", + "text": "any $k \\geq j _ { n }$ ", + "bbox": [ + 173, + 103, + 254, + 119 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/559af563d49ede930871100a560de369ee8a1cb8edf6d607cba6074ba4a2fa26.jpg", + "text": "$$\n\\begin{array} { r } { \\| ( \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , } \\\\ { \\| ( \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 344, + 125, + 619, + 170 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Lemma 6 Assume the conditions in Theorem $^ { l }$ hold. The for any sequence $\\{ j _ { n } \\} _ { n }$ that satisfies $j _ { n } / \\log ( j _ { n } ) \\gg q ,$ , we have with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ that for any $a \\in \\{ 0 , 1 \\}$ and any $k \\geq j _ { n } ,$ , ", + "bbox": [ + 173, + 179, + 825, + 223 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/d72c7d4d04ffea76c8a84f3033647e69548b84de811f40aac9185403233a89cf.jpg", + "text": "$$\n\\left\\| \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log k } .\n$$", + "text_format": "latex", + "bbox": [ + 290, + 229, + 673, + 272 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "For $a \\in \\{ 0 , 1 \\}$ , ", + "bbox": [ + 173, + 286, + 276, + 303 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/a9e10a0e53b2909231b95a72a9792b55ac902e50f2ad4507570dac0a07c03674.jpg", + "text": "$$\n\\widehat { \\beta } _ { a , k } - \\beta _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\left[ \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right] ,\n$$", + "text_format": "latex", + "bbox": [ + 271, + 309, + 692, + 352 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "and hence ", + "bbox": [ + 173, + 358, + 243, + 372 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/73c0e6a5693c8b86b5891144cbd0dcb35c62fce9a4dc8d2c0b54ae605be2f325.jpg", + "text": "$$\n\\begin{array} { r l } & { \\Bigg \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } - \\Sigma _ { a } ^ { - 1 } \\left[ \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right] \\Bigg \\| _ { 2 } } \\\\ { \\leq } & { \\| \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\| _ { 2 } \\Bigg \\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\Bigg \\| _ { 2 } } \\\\ { \\leq } & { ( q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } ) q ^ { 1 / 2 } k ^ { - 1 / 2 } \\log ^ { 1 / 2 } k , ~ \\forall k \\geq j _ { n } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 269, + 377, + 738, + 487 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "with probability at least $1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )$ , by Lemma 5 and Lemma 6. Define ", + "bbox": [ + 173, + 491, + 660, + 508 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/8bd2974359b86f4c12323f013116a28cc3186773a490cfb2843cd2795a187d54.jpg", + "text": "$$\nB ^ { * } ( t ) = { \\frac { 1 } { \\sqrt { n ( t ) } } } \\sum _ { i = 1 } ^ { n ( t ) } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] .\n$$", + "text_format": "latex", + "bbox": [ + 171, + 513, + 808, + 559 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "It follows that ", + "bbox": [ + 173, + 564, + 267, + 579 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/79e41a94ce06b7cb13a6141b4dfdc7c947fa75c0809035cc2aae53aed6e2765e.jpg", + "text": "$$\n\\begin{array} { r } { \\| B ^ { * } ( t _ { k } ) - B ( t _ { k } ) \\| _ { 2 } \\preceq \\{ q ^ { 3 / 2 } \\delta _ { n ( t _ { k } ) } + q \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} n ^ { - 1 / 2 } ( t _ { k } ) \\log ^ { 1 / 2 } n ( t _ { k } ) , \\forall k \\geq 1 , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 178, + 583, + 789, + 604 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ , and hence ", + "bbox": [ + 173, + 611, + 526, + 626 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/a112f99afa97460fb88337898a326efbd251d70e458132252d2d0fac977a71cd.jpg", + "text": "$$\n\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) \\| _ { 2 } \\leq \\bar { c } \\{ q ^ { 2 } \\delta _ { n ( t _ { k } ) } + q ^ { 3 / 2 } \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } .\n$$", + "text_format": "latex", + "bbox": [ + 181, + 632, + 839, + 661 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ , for some constant $\\bar { c } > 0$ , by equation 41. Under the given conditions on $q$ and $n ( t _ { 1 } )$ , we have ", + "bbox": [ + 174, + 684, + 828, + 714 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/44de17708e7d92ad1e9e207200cd700f4a1c8f68194f7d9c881abbe5714e7faa.jpg", + "text": "$$\nq \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } = o ( 1 ) , ~ \\forall k \\geq 1 ,\n$$", + "text_format": "latex", + "bbox": [ + 344, + 720, + 619, + 741 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "and hence ", + "bbox": [ + 173, + 747, + 243, + 761 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/cc397be3c250d4c29816222ce191125002acc9b38029f07223112df51291bab9.jpg", + "text": "$$\n\\| \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) \\| _ { 2 } \\leq { \\bar { c } } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} , \\forall k \\geq 1 ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 765, + 782, + 795 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "Thus, for any given $z _ { 1 } , z _ { 2 } , \\dotsc , z _ { K }$ , we obtain ", + "bbox": [ + 174, + 801, + 473, + 815 + ], + "page_idx": 14 + }, + { + "type": "equation", + "img_path": "images/421db15433f0508b092fd376de9810dd95d8d03150262dfaeabf6910a4162801.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } \\right) \\leq 0 \\right\\} - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } \\right) \\leq 0 \\right\\} + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 266, + 821, + 743, + 931 + ], + "page_idx": 14 + }, + { + "type": "text", + "text": "where ", + "bbox": [ + 173, + 103, + 217, + 118 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/cdcb1bbc80b153bfb0d038b4fb13b4b81b47c928454f154dcc715debeb7bdd04.jpg", + "text": "$$\n\\begin{array} { r } { z _ { k , - } = z _ { k } - \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} , } \\\\ { z _ { k , + } = z _ { k } + \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 318, + 122, + 647, + 167 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "For any $i \\geq 1 , 1 \\leq k \\leq K$ , define a $q$ -dimensional vector ", + "bbox": [ + 171, + 178, + 552, + 195 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/d762be66d00bf7c1ab2768fe4344df82a8342bb1706cc82bce32cf944c0d89a7.jpg", + "text": "$$\n\\dot { \\iota } _ { i , k } = \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] \\mathbb { I } ( i \\leq n ( t _ { k } ) , 1 ) .\n$$", + "text_format": "latex", + "bbox": [ + 181, + 200, + 838, + 236 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "or equivalently, ", + "bbox": [ + 173, + 242, + 276, + 257 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/2ca906cb0ea6c713fd744ac32e5b5117a5e5d828346e40b741c5e0fd06bd36ec.jpg", + "text": "$$\n\\dot { \\iota } _ { i , k } = \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } ^ { * } ( 0 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] \\mathbb { I } ( \\dot { \\iota } _ { i } ) \\mathbb { 1 } - \\mu _ { 0 } \\mathbb { 1 } / \\mathbb { 1 } \\mu _ { 0 } ]\n$$", + "text_format": "latex", + "bbox": [ + 181, + 262, + 839, + 297 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "by Condition (A1). Let $\\pmb { \\xi } _ { i } = ( \\xi _ { i , 1 } ^ { \\top } , \\xi _ { i , 2 } ^ { \\top } , \\cdot \\cdot \\cdot , \\xi _ { i , K } ^ { \\top } ) ^ { \\top }$ and $\\begin{array} { r } { \\mathcal { M } _ { j } = \\sum _ { i = 1 } ^ { j } \\pmb { \\xi } _ { i } } \\end{array}$ . The sequence $\\{ \\mathcal { M } _ { i } \\} _ { i \\ge 1 }$ forms a multivariate martingale with respect to the filtration $\\{ \\sigma ( \\mathcal { F } _ { i } ) : i \\ge 1 \\}$ , since ", + "bbox": [ + 174, + 305, + 820, + 340 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/e400792ccfec46f8a9cbb44dda14b3013aaa7c15a6fa06caf56388876756c52b.jpg", + "text": "$$\n\\begin{array} { r } { \\mathrm { E } ( \\xi _ { i , k } | \\mathcal { F } _ { i } ) = [ \\{ \\mathrm { E } ( \\xi _ { i , k } | A _ { i } , X _ { i } , \\mathcal { F } _ { i } ) \\} | \\mathcal { F } _ { i } ] = 0 , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 334, + 345, + 629, + 363 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "by (A2). Let $n ( t _ { 0 } ) = 0$ . For any $i$ such that $n ( t _ { k - 1 } ) < i \\leq n ( t _ { k } )$ for some $1 \\leq k \\leq K$ , we have ", + "bbox": [ + 171, + 369, + 803, + 386 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/85b7ff30c1a5a942165b107fd1062b8f5fd64f87562a685a86340928aa06b4fb.jpg", + "text": "$$\n\\xi _ { i } | | _ { \\infty } \\leq \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } \\{ \\| \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} \\| _ { 2 } + \\| \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } ^ { * } ( 0 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} \\| _ { 2 } \\}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 391, + 821, + 429 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where the second inequality is due to Lemma 4. Therefore, ", + "bbox": [ + 173, + 453, + 562, + 469 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/61e59a12095d032285b0f9bf3b2520eb18817974b656554ecf7fec6bed1eba64.jpg", + "text": "$$\n\\mathbb { E } \\| \\pmb { \\xi } _ { i } \\| _ { \\infty } ^ { 3 } \\preceq \\frac { q ^ { 3 / 2 } } { n ^ { 3 / 2 } ( t _ { k } ) } .\n$$", + "text_format": "latex", + "bbox": [ + 408, + 474, + 553, + 512 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "It follows that ", + "bbox": [ + 173, + 517, + 267, + 531 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/fc7e9df0d372bc3db2ccd0e79e89ffc42c40931801e2aa28fee8f4b1053e4cca.jpg", + "text": "$$\n\\begin{array} { r l } { { } } & { \\underset { i = 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\ \\mathrm { E } \\| \\xi _ { i } \\| _ { \\infty } ^ { 3 } = \\underset { k = 1 } { \\overset { K } { \\sum } } \\ \\underset { i = n ( t _ { k - 1 } ) + 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\ \\mathrm { E } \\| \\xi _ { i } \\| _ { \\infty } ^ { 3 } \\preceq q ^ { 3 / 2 } \\underset { k = 1 } { \\overset { K } { \\sum } } \\ \\frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } } \\\\ { { \\leq } } & { \\frac { q ^ { 3 / 2 } } { \\sqrt { n ( t _ { 1 } ) } } + q ^ { 3 / 2 } \\underset { k = 2 } { \\overset { K } { \\sum } } \\ \\frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } \\leq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) + q ^ { 3 / 2 } \\int _ { n ( t _ { 1 } ) } ^ { + \\infty } x ^ { - 3 / 2 } d x = 3 q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { k } ) } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 187, + 536, + 839, + 630 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "Define a sequence of independent Gaussian vectors $\\{ \\eta _ { i } \\} _ { i \\ge 1 }$ that satisfy $\\pmb { \\eta _ { i } } \\sim N ( 0 , \\mathbb { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) )$ for any $i \\geq 1$ . Then the distribution of $\\eta _ { i }$ is the same as ", + "bbox": [ + 173, + 637, + 825, + 666 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/44c0ea64b278a5838b22fe2ed3eeeea0f3c192607cba9d34dfffd9ef1e0c9f3b.jpg", + "text": "$$\n\\left( \\frac { \\mathbb { I } ( i \\leq n ( t _ { 1 } ) ) } { \\sqrt { n ( t _ { 1 } ) } } Z ^ { \\top } , \\frac { \\mathbb { I } ( i \\leq n ( t _ { 2 } ) ) } { \\sqrt { n ( t _ { 2 } ) } } Z ^ { \\top } , \\cdots , \\frac { \\mathbb { I } ( i \\leq n ( t _ { K } ) ) } { \\sqrt { n ( t _ { K } ) } } Z ^ { \\top } \\right) ,\n$$", + "text_format": "latex", + "bbox": [ + 274, + 672, + 689, + 714 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where $Z$ is a $p$ -dimensional mean-zero Gaussian vector with covariance matrix ", + "bbox": [ + 174, + 720, + 691, + 736 + ], + "page_idx": 15 + }, + { + "type": "equation", + "img_path": "images/28b92267918a11a9272fd7cbfbf7c8d3621266cd2f948032dd1b4b5548f3d789.jpg", + "text": "$$\n\\begin{array} { r l } & { \\quad \\mathrm { C o v } [ \\displaystyle \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\varphi ( X _ { i } ) ] [ ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] \\mathcal { F } _ { i - 1 } ] } \\\\ { = } & { \\quad \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] [ ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } ] \\mathcal { F } _ { i - 1 } ] \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] [ ( A _ { i } = a ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } ] \\Sigma _ { a } ^ { - 1 } } \\\\ & { = \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\mathbb { E } \\{ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\pi _ { i - 1 } ( a , X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } \\} \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } \\{ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\pi _ { i - 1 } ( a , X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } \\} \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\Sigma _ { a } ^ { - 1 } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 246, + 742, + 764, + 930 + ], + "page_idx": 15 + }, + { + "type": "text", + "text": "where the second equality follows from (A2) and Lemma 3, the third equality is due to the definition of $\\pi _ { i - 1 }$ and the last equality follows from Lemma 3. ", + "bbox": [ + 171, + 103, + 825, + 132 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Similar to equation 19, we can show that ", + "bbox": [ + 174, + 138, + 442, + 154 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/7cccfdd817f82d536e29d24053e279a2d5351d6acdb36fccdbeda3d7b2444b63.jpg", + "text": "$$\n\\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\operatorname { E } \\lVert \\pmb { \\eta } _ { i } \\rVert _ { \\infty } ^ { 3 } \\preceq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) .\n$$", + "text_format": "latex", + "bbox": [ + 374, + 161, + 591, + 207 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Using similar arguments in equation 20, we can show that for any $1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K$ , ", + "bbox": [ + 173, + 213, + 735, + 229 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/a22526e060b339971548b2a0ba264da6d480fb68c0114193f62238fe63d178d6.jpg", + "text": "$$\n\\sum _ { i = 1 } ^ { \\langle t \\kappa \\rangle } \\mathbf { E } \\{ \\xi _ { i } , _ { k _ { 1 } } \\xi _ { i , k _ { 2 } } ^ { \\top } | \\mathcal { F } _ { i - 1 } \\} = \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 236, + 839, + 285 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Let ", + "bbox": [ + 173, + 292, + 199, + 306 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/f5899ff4840a54c280022aa48afb27710306014db22dde8be26d4e9dba7f07b2.jpg", + "text": "$$\n\\begin{array} { c } { { V ( k _ { 1 } , k _ { 2 } ) = \\displaystyle \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi ^ { * } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\Sigma _ { a } ^ { - 1 } } } \\\\ { { = \\displaystyle \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } = \\displaystyle \\frac { \\sqrt { n ( t _ { k _ { 1 } } ) } } { \\sqrt { n ( t _ { k _ { 2 } } ) } } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } . } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 186, + 311, + 781, + 412 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Consider an arbitrary sequence of $\\mathbb { R } ^ { p + 1 }$ vectors $\\left\\{ b _ { k } \\right\\} _ { 1 \\leq k \\leq K }$ . Under the given conditions, we have ", + "bbox": [ + 171, + 419, + 815, + 436 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/0e096c097238e0e6d88f62d25ac67af9085fd1aa3d0fd2f273d82510aeaedd7d.jpg", + "text": "$$\n\\begin{array} { r l } & { \\left| b _ { k _ { 1 } } ^ { \\top } \\left( \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathsf { E } ( \\xi _ { i , k _ { 1 } } \\xi _ { 1 , k _ { 2 } } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V ( k _ { 1 } , k _ { 2 } ) \\right) b _ { k _ { 2 } } \\right| } \\\\ { \\ \\preceq } & { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathsf { E } ^ { \\mathcal { F } _ { i - 1 } } \\left\\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\right\\} \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\right\\| _ { 2 } \\| b _ { k _ { 1 } } \\| _ { 2 } \\| b _ { k _ { 2 } } \\| _ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 191, + 441, + 838, + 545 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Define a matrix $V$ as ", + "bbox": [ + 173, + 551, + 315, + 565 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/7235e14873273852a26c911377352b8d77b7ed0099727646f250964b143159de.jpg", + "text": "$$\nV = \\left( \\begin{array} { c c c c } { { V ( 1 , 1 ) } } & { { V ( 1 , 2 ) } } & { { . . . } } & { { V ( 1 , K ) } } \\\\ { { V ( 2 , 1 ) } } & { { V ( 2 , 2 ) } } & { { . . . } } & { { V ( 2 , K ) } } \\\\ { { \\vdots } } & { { \\vdots } } & { { } } & { { \\vdots } } \\\\ { { V ( K , 1 ) } } & { { V ( K , 2 ) } } & { { . . . } } & { { V ( K , K ) } } \\end{array} \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 313, + 570, + 651, + 640 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "It follows that ", + "bbox": [ + 173, + 646, + 267, + 661 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/5dee80761ce6abececc3c8d02f83e89ae1675bbb2c92be363b5288dccb8979f9.jpg", + "text": "$$\n\\left| \\sum _ { i = 1 } ^ { \\boldsymbol { n } ( t _ { k } ) } \\mathrm { E } ( \\xi _ { i } \\xi _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right| \\Bigg | _ { 2 } \\preceq \\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\} \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\right\\| ^ { 2 } ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 666, + 839, + 720 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Using similar arguments in proving equation 14, we can show the RHS of the above equation is upper bounded by ", + "bbox": [ + 171, + 728, + 825, + 758 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/5fb420116bca17951a1c45bd6daa95cab6986ac8a2d82f1bd5a038f518615294.jpg", + "text": "$$\n\\epsilon _ { 0 } ^ { - 2 } q \\operatorname* { s u p } _ { \\stackrel { a \\in \\{ 0 , 1 \\} } { x \\in \\mathbb { X } , j \\geq n ( t _ { 1 } ) } } \\left| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right| ,\n$$", + "text_format": "latex", + "bbox": [ + 316, + 765, + 647, + 816 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "and hence by $\\epsilon _ { 0 } ^ { - 2 } q \\delta _ { n ( t _ { 1 } ) }$ , with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ . Therefore, we have ", + "bbox": [ + 169, + 825, + 753, + 843 + ], + "page_idx": 16 + }, + { + "type": "equation", + "img_path": "images/67865eb72d4624ee20ff0842ece592f35f83b92f3da34f9ccd8da22569610906.jpg", + "text": "$$\n\\lambda _ { \\operatorname* { m i n } } \\left[ { V + \\delta _ { n ( t _ { 1 } ) } I _ { K p \\times K p } - \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\operatorname { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) } \\right] \\geq 0 ,\n$$", + "text_format": "latex", + "bbox": [ + 294, + 851, + 669, + 901 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ , where $I _ { K p \\times K p }$ denotes a $K p \\times K p$ identity matrix. ", + "bbox": [ + 173, + 909, + 797, + 926 + ], + "page_idx": 16 + }, + { + "type": "text", + "text": "Moreover, notice that ", + "bbox": [ + 174, + 103, + 316, + 118 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/ad871042cbcc0f56b719188c0aab9abefda2df7aae8218eae0d57ccab75d7068.jpg", + "text": "$$\n\\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } \\left| { \\frac { 1 } { j } } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right|\n$$", + "text_format": "latex", + "bbox": [ + 336, + 125, + 629, + 176 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "is bounded between 0 and 1. For any $a \\in \\{ 0 , 1 \\}$ and any $z > 0$ , we have ", + "bbox": [ + 174, + 184, + 648, + 200 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/9d59005e04f2113b8e0c1f31210894d5f45f6f125d98590ede71d151ced794bb.jpg", + "text": "$$\n\\begin{array} { r l } { { } } & { { } \\underset { x \\in \\{ 0 , 1 \\} } { \\operatorname* { s u p } } } \\\\ { { \\leq } } & { { } \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | } \\\\ { { + } } & { { } \\operatorname* { P r } ( \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | \\mathbb { 1 } ( \\underset { a \\leq t \\leq \\{ 0 , 1 \\} } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | | } \\\\ { + } & { { } \\operatorname* { P r } ( \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | > z ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 187, + 208, + 839, + 378 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Under the given conditions, we have ", + "bbox": [ + 174, + 385, + 415, + 400 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/4095d12bc1dde9c1b568da25d07c539bb8c0f636a62afaa7db54e9e89bc33b2b.jpg", + "text": "$$\n\\left. \\underset { x \\in \\mathbb { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { E } } \\right| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\Bigg | \\preceq \\delta _ { n ( t _ { 1 } ) } + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) .\n$$", + "text_format": "latex", + "bbox": [ + 241, + 407, + 718, + 459 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Therefore, we obtain ", + "bbox": [ + 174, + 467, + 313, + 481 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/573f80cc74c50021a0b41f82b6b341d4f4c10f983b92ed4373e964d864116f01.jpg", + "text": "$$\n\\mathbf { E } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathrm { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right\\| _ { 2 } \\preceq q n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) + q \\delta _ { n ( t _ { 1 } ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 297, + 487, + 665, + 537 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "or ", + "bbox": [ + 173, + 544, + 191, + 555 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/438773c3fef7b56a505e0d074dc1896cfbd7585d027812ac5de0c667da66c658.jpg", + "text": "$$\n\\mathbf { E } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathbf { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right\\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 343, + 560, + 622, + 612 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "since $n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) \\ll \\delta _ { n ( t _ { 1 } ) }$ . Combining equation 19 with equation 21, equation 23 and equation 24, an application of Theorem 2.1 in Belloni & Oliveira (2018) yields that ", + "bbox": [ + 176, + 619, + 821, + 648 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/56fcabf292d46d39a587a47c8f460d99923308fef0996f0a1c9c417789df9e3e.jpg", + "text": "$$\n\\begin{array} { r l } & { | \\mathrm { E } \\psi ( \\mathcal { M } _ { n ( t _ { K } ) } ) - \\mathrm { E } \\psi ( N ( 0 , { \\pmb V } ) ) | } \\\\ { \\preceq } & { c _ { 0 } ( \\psi ) n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) + c _ { 2 } ( \\psi ) q \\delta _ { n ( t _ { 1 } ) } + c _ { 3 } ( \\psi ) q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 303, + 654, + 702, + 696 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "for any thrice differential function $\\psi ( \\cdot )$ , and ", + "bbox": [ + 173, + 703, + 464, + 718 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/7f5435e98450fb25a40eaafc886429b380896ef5d83951f1c52266c93bc353c7.jpg", + "text": "$$\nc _ { 0 } ( \\psi ) = \\operatorname* { s u p } _ { z , z ^ { \\prime } \\in \\mathbb { R } ^ { p K } } | \\psi ( z ) - \\psi ( z ^ { \\prime } ) | \\mathrm { ~ a n d ~ } c _ { i } = \\operatorname* { s u p } _ { z \\in \\mathbb { R } ^ { p K } } \\sum _ { j _ { 1 } , \\cdots , j _ { i } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\cdots \\partial _ { j _ { i } } \\psi ( z ) | , i = 2 , 3 ,\n$$", + "text_format": "latex", + "bbox": [ + 196, + 724, + 766, + 761 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "where $\\partial _ { j } g ( z )$ denotes the partial derivative $\\partial g ( z ) / \\partial z ^ { ( j ) }$ for any function $\\mathbf { g } ( \\cdot )$ and $z ^ { ( j ) }$ stands for the $j$ -th element of $z$ . ", + "bbox": [ + 176, + 768, + 823, + 799 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "Let ${ \\mathbb X } _ { k , 0 }$ be an $\\varepsilon$ -net of $\\mathbb { X }$ that satisfies the following: for any $x \\in \\mathbb { X }$ , there exists some $x _ { 0 } \\in \\mathbb { X } _ { 0 }$ such that $\\| x - x _ { 0 } \\| _ { 2 } \\leq \\varepsilon$ . Set $\\varepsilon = \\sqrt { d } / n ^ { 4 } ( t _ { 1 } )$ . Since $\\mathbb { X } = [ 0 , 1 ] ^ { d }$ , there exists some ${ \\mathbb X } _ { 0 }$ with ", + "bbox": [ + 174, + 804, + 823, + 838 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/3679f59ee70b238a0af1a12f4e27044b790ee1a0d8ff1e4c1af6a9a3112715f8.jpg", + "text": "$$\n| \\mathbb { X } _ { 0 } | \\leq n ^ { 4 d } ( t _ { 1 } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 428, + 844, + 535, + 863 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "where $| \\mathbb { X } _ { 0 } |$ denotes the number of elements in ${ \\mathbb X } _ { 0 }$ . Under Condition (A3), we have ", + "bbox": [ + 173, + 869, + 714, + 886 + ], + "page_idx": 17 + }, + { + "type": "equation", + "img_path": "images/b5f6c27b39a710f3a27c194c6262bc197aefc43185cf428decb7e824843d8e6c.jpg", + "text": "$$\n\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\operatorname* { i n f } _ { x _ { 0 } \\in \\mathbb { X } _ { 0 } } \\| \\varphi ( x ) - \\varphi ( x _ { 0 } ) \\| _ { 2 } \\preceq \\frac { \\sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } .\n$$", + "text_format": "latex", + "bbox": [ + 351, + 893, + 612, + 928 + ], + "page_idx": 17 + }, + { + "type": "text", + "text": "It follows that ", + "bbox": [ + 173, + 103, + 267, + 118 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/8d3f39bbbce5737299289409a80b88a62fde42a3a596baab6bef00056f169c62.jpg", + "text": "$$\n\\operatorname* { s u p } _ { \\| \\nu \\| _ { 2 } = 1 } | \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\nu - \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) \\nu | \\preceq \\frac { \\sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } .\n$$", + "text_format": "latex", + "bbox": [ + 320, + 123, + 643, + 160 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Using similar arguments in showing equation 17, we can show the following event occurs with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ , ", + "bbox": [ + 174, + 166, + 823, + 196 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/3952d45abef2334a6d7b79c5b88e8664ec6cfd9d4acc9f9b390f762333c9c02a.jpg", + "text": "$$\n\\| B ^ { * } ( t _ { k } ) \\| _ { 2 } \\preceq q ^ { 1 / 2 } \\log ^ { 1 / 2 } n ( t _ { k } ) , ~ \\forall k \\geq 1 .\n$$", + "text_format": "latex", + "bbox": [ + 343, + 203, + 620, + 223 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "This together with equation 27 yields ", + "bbox": [ + 174, + 231, + 419, + 246 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/06a76f0351a6ac04842346ee2484d51bdb7b3a1850193c25864c722b470f09ff.jpg", + "text": "$$\n\\begin{array} { r l } & { \\left| \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) \\right| } \\\\ { \\leq } & { \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\left| \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) \\right| \\preceq \\frac { q \\log n ^ { 1 / 2 } ( t _ { K } ) } { n ^ { 4 } ( t _ { 1 } ) } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 253, + 252, + 758, + 328 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "with probability at least $\\mathrm { ~ 1 ~ - ~ } O ( n ^ { - 1 } ( t _ { 1 } ) )$ . Under the given conditions, we have $n ( t _ { 1 } ) ~ \\gg$ $\\operatorname* { m a x } ( q , \\log n ( t _ { K } ) )$ . It follows that there exists some constant $\\bar { c } ^ { * } > 0$ such that ", + "bbox": [ + 171, + 334, + 826, + 364 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/14f734545f4fe0a929eb1ff16ad9e37c8152fed6840a03cfeb3ac252d049ef6a.jpg", + "text": "$$\n\\left. \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { \\ast } ( t _ { k } ) - \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) B ^ { \\ast } ( t _ { k } ) \\right. \\leq { \\vec { c } } ^ { \\ast } n ^ { - 2 } ( t _ { 1 } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 225, + 371, + 736, + 407 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ . ", + "bbox": [ + 173, + 415, + 446, + 431 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Define ", + "bbox": [ + 173, + 438, + 220, + 452 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/155b86c7e0da21b2776f99df075b14bbdb0e9bbe1f73280a28c7a21f8be52c6e.jpg", + "text": "$$\n\\begin{array} { r l } & { z _ { k , - } ^ { * } = z _ { k } - \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} - \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , } \\\\ & { z _ { k , + } ^ { * } = z _ { k } + \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 274, + 457, + 689, + 502 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Combining equation 28 with equation 18 yields ", + "bbox": [ + 173, + 506, + 486, + 522 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/ed3b67cbac3ea0556546bcf778c7a3683ad1e5dfb864c3d6be172a5b75651845.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 261, + 529, + 748, + 637 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "Notice that $\\mathcal { M } _ { n ( t _ { K } ) } = \\{ B ^ { * } ( t _ { 1 } ) ^ { \\top } , B ^ { * } ( t _ { 2 } ) ^ { \\top } , \\cdot \\cdot \\cdot , B ^ { * } ( t _ { K } ) ^ { \\top } \\} ^ { \\top }$ . By equation 26 and Lemma 4, there exist a set of vectors $d _ { 1 } , d _ { 2 } , \\dots , d _ { L } \\in \\mathbb { R } ^ { q K }$ with $L \\leq n ^ { 4 d } ( t _ { 1 } ) K$ , $\\mathrm { m a x } _ { j } \\| d _ { j } \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }$ and a function $k ( \\cdot )$ that maps $\\{ 1 , \\ldots , L \\}$ into $\\{ 1 , \\ldots , K \\}$ such that ", + "bbox": [ + 176, + 643, + 825, + 693 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/b8d39d25d3f8b062414fe4d8e7ce508fea9d6275e73fc19acb2a201d57f7b8f4.jpg", + "text": "$$\n\\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left\\{ \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\nu _ { k } \\right\\} = \\operatorname* { m a x } _ { 1 \\leq j \\leq L } \\{ d _ { j } ^ { \\top } \\mathcal { M } _ { n ( t _ { K } ) } - \\nu _ { k ( j ) } \\} ,\n$$", + "text_format": "latex", + "bbox": [ + 246, + 699, + 717, + 734 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "for any $\\{ \\nu _ { k } \\} _ { k = 1 } ^ { K }$ . For any $\\eta > 0$ , $m \\in \\mathbb { R } ^ { q K }$ , consider the function $\\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } : \\mathbb { R } ^ { q K } \\mathbb { R }$ , defined as ", + "bbox": [ + 171, + 742, + 818, + 761 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/5cd807045e20b3081d1e3588272cb3080401d4484d3256a1975b8752377f1dea.jpg", + "text": "$$\n\\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) = \\frac { 1 } { \\eta } \\log \\left\\{ \\sum _ { j = 1 } ^ { L } \\exp [ \\eta \\{ d _ { j } ^ { \\top } m - \\eta \\nu _ { k ( j ) } \\} ] \\right\\} .\n$$", + "text_format": "latex", + "bbox": [ + 300, + 767, + 665, + 818 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "It has the following property: ", + "bbox": [ + 173, + 824, + 367, + 839 + ], + "page_idx": 18 + }, + { + "type": "equation", + "img_path": "images/43f57c14ff39f437f2b373f0320bb58bf18a4382279f82ae323c73337e8ee0a2.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} \\leq \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\leq \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} + \\eta ^ { - 1 } \\log L } \\\\ { \\leq } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} } \\\\ { = } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } [ d _ { j } ^ { \\top } m - \\{ \\nu _ { k ( j ) } - \\eta ^ { - 1 } \\log K - \\eta ^ { - 1 } 4 d \\log n ( t _ { 1 } ) \\} ] . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 238, + 845, + 774, + 930 + ], + "page_idx": 18 + }, + { + "type": "text", + "text": "It follows that ", + "bbox": [ + 173, + 103, + 267, + 117 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/706b671fd42870ce47b188c633eac5ece57a7180d43a844b798c25a2c0be0888.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} \\leq \\operatorname* { P r } \\left\\{ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } ^ { * * } \\left( \\mathcal { M } _ { n ( t _ { K } ) } \\right) \\leq 0 } , \\quad \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\Omega , } } \\\\ & \\right\\{ \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } & { \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\Omega ~ } \\\\ { = } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - ( z _ { k , - } ^ { * } - 3 \\delta ) \\right) \\leq 3 \\delta \\right\\} \\geq \\operatorname* { P r } \\left\\{ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } \\left( \\mathcal { M } _ { n ( t _ { K } ) } \\right) \\leq 3 \\delta \\right\\} } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 186, + 118, + 839, + 228 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "where ", + "bbox": [ + 173, + 229, + 217, + 242 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "The value of $\\delta$ will be specified later. In addition, with some calculations, we have ", + "bbox": [ + 184, + 265, + 707, + 280 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/caeebe71ea528fa4e1da56a329240f3fb7744f71fb5b1a54ec1516336c33e37f.jpg", + "text": "$$\n\\begin{array} { r l } { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to - \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\rho \\mathrm { e r f } ( \\phi _ { \\mathrm { c a i r c } } ^ { 2 } - \\phi _ { \\mathrm { c a c i r c } } ^ { 2 } ) , } \\\\ { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to - \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\rho \\mathrm { e r f } ( \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) , } \\\\ { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) ) , } \\\\ { \\phantom { = } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) ) , } \\\\ { \\phantom { = } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a c c } } ^ { 2 } ) ) ^ { \\frac { 1 } { \\sqrt { 2 } } } , } \\\\ \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 236, + 284, + 751, + 637 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Since $\\operatorname* { m a x } _ { i } \\| d _ { i } \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }$ , we obtain that ", + "bbox": [ + 174, + 633, + 468, + 651 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/8470b59a097e03c6a0cad5fd174cc11f15d8f6e0774f502c7ce567ce991afb0d.jpg", + "text": "$$\n\\begin{array} { r l r } { { \\sum _ { j } | \\partial _ { j } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 } , \\sum _ { j _ { 1 } , j _ { 2 } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le 2 \\eta \\epsilon _ { 0 } ^ { - 2 } q , } } \\\\ & { } & { \\ \\sum _ { j _ { 1 } , j _ { 2 } , j _ { 3 } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\partial _ { j _ { 3 } } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le 6 \\eta ^ { 2 } \\epsilon _ { 0 } ^ { - 3 } q ^ { 3 / 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 243, + 654, + 717, + 726 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "By Lemma 5.1 of Chernozhukov et al. (2016), for any $\\delta > 0$ , there exists some function $\\mathbf { g } _ { \\delta } ( \\cdot ) : \\mathbb { R } \\to$ $\\mathbb { R }$ with $\\| \\mathbf { g } _ { \\delta } ^ { \\prime } \\| _ { \\infty } \\leq \\delta ^ { - 1 } , \\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime } \\| _ { \\infty } \\leq K _ { 0 } \\delta ^ { - 2 } , \\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime \\prime } \\| _ { \\infty } \\leq K _ { 0 } \\delta ^ { - 3 } \\mathbf { f }$ or some constant $K _ { 0 } > 0$ such that ", + "bbox": [ + 173, + 734, + 820, + 767 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "It follows that ", + "bbox": [ + 173, + 787, + 267, + 803 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/e3cf614eaf9df5f7f37e22642e46de67601baabbb7fc2b21cbdb3b206f83f6a8.jpg", + "text": "$$\n\\mathbb { I } ( \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le 0 ) \\le \\mathtt { g o } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le \\mathbb { I } ( \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le 3 \\delta ) ,\n$$", + "text_format": "latex", + "bbox": [ + 266, + 805, + 696, + 824 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "for any $m \\in \\mathbb { R } ^ { q K }$ . Combining this together with equation 30, equation 31 and equation 32, we obtain that ", + "bbox": [ + 176, + 827, + 821, + 856 + ], + "page_idx": 19 + }, + { + "type": "equation", + "img_path": "images/7a0db8e3014f46354462660dfe94f5f4bb80afe0f94e84c2fbc141e9e1960cd8.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} \\leq \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } \\big ( \\mathcal { M } _ { n ( t _ { K } ) } \\big ) , } \\\\ & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} \\geq \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } \\big ( \\mathcal { M } _ { n ( t _ { K } ) } \\big ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 240, + 856, + 785, + 930 + ], + "page_idx": 19 + }, + { + "type": "text", + "text": "Consider the function $\\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } }$ . Apparently, we have ", + "bbox": [ + 173, + 103, + 552, + 119 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/094a877e5d6e3f659d5f4ab3057d5f6839dfd5ed209e3ec8378bcc77448a589e.jpg", + "text": "$$\n\\operatorname* { s u p } _ { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } c _ { 0 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\leq 1 .\n$$", + "text_format": "latex", + "bbox": [ + 377, + 126, + 588, + 154 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "By equation 33, we can show that ", + "bbox": [ + 173, + 161, + 397, + 176 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/d14f6dafa13046597541e753fdf5f3fd3a73fef3635c4dd6749bf42d01ff8709.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } c _ { 2 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq \\delta ^ { - 2 } q + \\delta ^ { - 1 } \\eta q , } \\\\ & { } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } c _ { 3 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq \\delta ^ { - 3 } q ^ { 3 / 2 } + \\delta ^ { - 2 } \\eta q ^ { 3 / 2 } + \\delta ^ { - 1 } \\eta ^ { 2 } q ^ { 3 / 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 277, + 181, + 705, + 243 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Set $\\delta = \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\}$ , we obtain ", + "bbox": [ + 173, + 250, + 485, + 266 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/bc770cef0ee9ac6d62cba6a7d4fe070509f1d1e62e10ddda0afb1d8cd315d5c1.jpg", + "text": "$$\n\\operatorname* { s u p } _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } c _ { i } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq q ^ { i / 2 } \\eta ^ { i } \\{ \\log ^ { i } K + \\log ^ { i } n ( t _ { 1 } ) \\} , i = 2 , 3 .\n$$", + "text_format": "latex", + "bbox": [ + 259, + 272, + 705, + 303 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Combining equation 37 together with equation 25 and equation 36 yields ", + "bbox": [ + 173, + 309, + 655, + 325 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/c9f8a9fdbff597f4342a28226060d4c489253ed20e0a93e3d297dd456a0dea5e.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } \\vert \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( \\mathcal { M } _ { n ( t _ { K } ) } ) - \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , V ) ) \\vert } \\\\ { \\overset { \\mathrm { } } { \\to } } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } N + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } N + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 200, + 329, + 808, + 382 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "This together with equation 34 and equation 35 yields ", + "bbox": [ + 173, + 386, + 529, + 401 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/9abc401e8d8d32cf2d15f3b65b268568e0271e235b7abd237b0453b8ef3db119.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} - \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * } \\} _ { k } } ( N ( 0 , V ) ) \\quad ( 3 ) } \\\\ { \\preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) , } \\\\ & { \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * } \\} _ { k } } ( N ( 0 , V ) ) - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} \\quad ( 3 ) } \\\\ { \\preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 202, + 406, + 808, + 523 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "Similar to equation 31-equation 35, we can show ", + "bbox": [ + 176, + 527, + 495, + 542 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/7200221d4ede3a511354fbf645b54028e435bb43450528d9c9e6584480dc82a6.jpg", + "text": "$$\n\\begin{array} { r l } & { { \\mathrm { E g } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq \\operatorname* { P r } \\left( \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq 3 \\delta \\right) } \\\\ { \\leq } & { \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * } \\} \\leq 3 \\delta \\right) = \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * * } \\} \\leq 0 \\right) , } \\\\ & { { \\mathrm { E g } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\geq \\operatorname* { P r } \\left( \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq 0 \\right) } \\\\ { \\geq } & { \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , - } ^ { * * * } \\} \\leq 0 \\right) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 194, + 547, + 812, + 675 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "where ", + "bbox": [ + 173, + 680, + 217, + 694 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "$= z _ { k , + } ^ { * } + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} + 3 \\delta \\mathrm { ~ a n d ~ } z _ { k , - } ^ { * * * } = z _ { k , - } ^ { * } - \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} - 3 \\delta ,$ for each $k$ . Notice that for any $\\{ \\nu _ { k } \\} _ { k }$ , we have ", + "bbox": [ + 171, + 700, + 849, + 742 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/89cf405c52b003e24b8ec1070abcc10a8137a413a973d904356e5eba3dfd5b55.jpg", + "text": "$$\n\\operatorname* { P r } \\left\\{ \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left( \\operatorname* { s u p } _ { x \\in \\Xi _ { 0 } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k } \\right) \\leq 0 \\right\\} = \\operatorname* { P r } \\left( \\operatorname* { m a x } _ { 1 \\leq j \\leq L } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - \\nu _ { k ( j ) } \\} \\leq 0 \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 176, + 748, + 787, + 784 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "This together with equation 38 and equation 39 yields ", + "bbox": [ + 173, + 790, + 529, + 805 + ], + "page_idx": 20 + }, + { + "type": "equation", + "img_path": "images/0d3947b1be72ef2768f083311df693501e972ff85a5a696510cdc5b8bc280c17.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\preceq \\ 3 n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) \\delta _ { n ( t _ { 1 } ) } } \\\\ & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\preceq \\lambda n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 810, + 839, + 929 + ], + "page_idx": 20 + }, + { + "type": "text", + "text": "In view of equation 29, we have shown that ", + "bbox": [ + 173, + 103, + 460, + 118 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/f3cbf46334ffb88e7d7895b71d58ec13067029780a6e7e07d0edc49df17269e6.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} - \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\qquad \\preceq \\lambda \\mathrm { \\Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) , } \\\\ & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} - \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { m p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\qquad \\preceq \\lambda \\mathrm { \\Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 122, + 838, + 241 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "The covariance matrix $\\operatorname { C o v } ( G ( t _ { k } ) )$ is given by $\\begin{array} { r } { \\sum _ { a \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } } \\end{array}$ and is nonsingular by Lemma 4. In addition, we have $\\| \\varphi ( x ) \\| _ { 2 } \\geq \\bar { c } , \\forall x \\in \\mathbb { X } _ { 0 }$ , by Condition A3. Thus, there exists some constant $c _ { * } > 0$ such that ", + "bbox": [ + 173, + 246, + 830, + 292 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/f2e147a1164f6f226793440b2c9e630859aa23e409bb5f4cc4f330de0d376ddf.jpg", + "text": "$$\nc _ { * } \\leq \\varphi ^ { \\top } ( x ) \\left( \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } \\right) ^ { 1 / 2 } \\varphi ( x ) , \\forall x \\in \\mathbb { X } _ { 0 } .\n$$", + "text_format": "latex", + "bbox": [ + 292, + 296, + 673, + 352 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "By Theorem 1 of Chernozhukov et al. (2017), we obtain that ", + "bbox": [ + 173, + 356, + 573, + 372 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/80bb55b8595d580f8a724cd3ea854ca803a5ce984e04d39df56334fd877c55d3.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { p } _ { \\mathrm { { r } } } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} } \\\\ & { \\ l ^ { - 1 } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 3 / 2 } + q \\delta _ { n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 1 / 2 } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 225, + 377, + 882, + 438 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Thus, we obtain ", + "bbox": [ + 173, + 440, + 282, + 455 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/baffea1771cd54328b90e59df4f5c3314d00ce0db24212055e1c6a2264160b9e.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathfrak { X } } { \\operatorname* { m a x } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathfrak { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} \\bigg | } \\\\ & { \\ i ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) } \\\\ & { \\ j ^ { - 1 } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 3 / 2 } + q \\delta _ { n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 1 / 2 } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 225, + 460, + 882, + 540 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Setting $\\eta = \\operatorname* { m i n } ( q ^ { - 3 / 4 } n ^ { 1 / 8 } ( t _ { 1 } ) \\log ^ { - 3 / 8 } \\{ K n ( t _ { 1 } ) \\} , q ^ { - 1 } n ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { - \\alpha _ { 0 } / 3 - 1 / 6 } \\{ K n ( t _ { 1 } ) \\} )$ yields the desired results. The proof is hence completed. ", + "bbox": [ + 174, + 546, + 823, + 578 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "E.3 PROOF OF LEMMA 3 ", + "text_level": 1, + "bbox": [ + 174, + 594, + 357, + 608 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "The assertion trivially holds for $j = 1$ . We prove it holds for any $j \\geq 2$ , by induction. By (A2), we have $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , \\overset { \\cdot } { Y _ { j } ^ { * } } ( 1 ) ) \\overset { } { \\bot } \\overset { } { A _ { 1 } } | X _ { 1 }$ . Since $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp ( X _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )$ , this further implies $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp { \\cal A } _ { 1 }$ and hence $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp ( X _ { 1 } , A _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )$ . By (A1), $Y _ { 1 }$ is completely determined by $A _ { 1 }$ , $Y _ { 1 } ^ { * } ( \\bar { 0 } )$ and $Y _ { 1 } ^ { * } ( 1 )$ . Therefore, we obtain $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp F _ { 1 }$ . ", + "bbox": [ + 173, + 619, + 825, + 695 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "Suppose we have shown that $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ \\bot ~ \\mathcal { F } _ { k }$ for some $k \\ < \\ j \\ - \\ 1$ . To prove $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\ \\perp \\ \\mathcal { F } _ { k + 1 } ,$ , it suffices to show $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ .$ ⊥⊥ $( X _ { k + 1 } , A _ { k + 1 } , Y _ { k + 1 } )$ . By (A1), $Y _ { k + 1 }$ is determined by $A _ { k + 1 }$ , $Y _ { k + 1 } ^ { * } ( 0 )$ and $Y _ { k + 1 } ^ { * } ( 1 )$ . Since $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ .$ ⊥⊥ $( X _ { k + 1 } , Y _ { k + 1 } ^ { * } ( 0 ) , Y _ { k + 1 } ^ { * } ( 1 ) )$ , it suffices to show $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\ \\perp \\ A _ { k + 1 }$ . This is implied by $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp A _ { k + 1 } | X _ { k + 1 } , \\mathcal { F } _ { k }$ and that $( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp \\perp X _ { k + 1 } , \\mathcal { F } _ { k }$ . The proof is hence completed. ", + "bbox": [ + 173, + 700, + 825, + 795 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "E.4 PROOF OF LEMMA 4 ", + "text_level": 1, + "bbox": [ + 174, + 810, + 357, + 824 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "The assertions ", + "bbox": [ + 174, + 837, + 271, + 851 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/d21643e0583df8df80a14fe044fa5ab5b43bb154005ae132693e1786375a89c4.jpg", + "text": "$$\n\\epsilon _ { 0 } \\le \\lambda _ { \\operatorname* { m i n } } [ \\mathsf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\le \\lambda _ { \\operatorname* { m a x } } [ \\mathsf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\le \\epsilon _ { 0 } ^ { - 1 } ,\n$$", + "text_format": "latex", + "bbox": [ + 285, + 856, + 678, + 876 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 882, + 200, + 896 + ], + "page_idx": 21 + }, + { + "type": "equation", + "img_path": "images/21dca32db5d6b3d1473aa3872b61249cb75d8c1b73c7592800bbf58a5d44874e.jpg", + "text": "$$\n\\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } ,\n$$", + "text_format": "latex", + "bbox": [ + 401, + 902, + 560, + 928 + ], + "page_idx": 21 + }, + { + "type": "text", + "text": "for some $0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1$ are directly implied by the conditions that $\\lambda _ { \\mathrm { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\ \\asymp \\ 1$ , $\\lambda _ { \\mathrm { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\ \\asymp \\ 1$ , $\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\ \\leq \\ \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } } \\end{array}$ . Since $\\| \\varphi ( x ) \\| _ { 2 } ~ \\leq ~ \\| \\varphi ( x ) \\| _ { 1 }$ , we obtain $\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 2 } \\leq \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } } \\end{array}$ . ", + "bbox": [ + 173, + 102, + 825, + 152 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Under the condition $\\begin{array} { r } { \\operatorname* { i n f } _ { a , x } \\pi ^ { * } ( a , x ) > 0 } \\end{array}$ , we can similarly show that $\\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\geq \\epsilon _ { 0 }$ for some $\\epsilon _ { 0 } > 0$ . ", + "bbox": [ + 171, + 156, + 823, + 172 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Since $\\lvert Y ^ { * } ( 0 ) \\rvert$ and $\\lvert Y ^ { * } ( 1 ) \\rvert$ are bounded, there exists some constant $0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1$ that satisfies $\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | Y ^ { * } ( a ) | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}$ . Notice that $\\varphi ^ { \\top } ( x ) \\beta _ { a } = \\operatorname { E } \\{ Y ^ { * } ( a ) | X = x \\}$ . Boundedness of $\\left| Y ^ { * } ( a ) \\right|$ implies that the conditional mean $\\operatorname { E } \\{ Y ^ { * } ( a ) | X \\}$ is a bounded random variable as well. As a result, we obtain $\\begin{array} { r } { \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | \\varphi ^ { \\top } ( x ) \\beta _ { a } | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}$ . ", + "bbox": [ + 173, + 178, + 825, + 242 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Notice that $\\beta _ { a } = \\Sigma _ { a } ^ { - 1 } \\mathrm { E } \\varphi ^ { \\top } ( X ) Y ^ { \\ast } ( a )$ . Since $\\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ]$ is bounded away from 0, it suffices to show $\\| \\mathrm { E } \\varphi ^ { \\top } ( X ) Y ^ { * } ( a ) \\| _ { 2 } \\stackrel { } { = } { \\cal O } ( 1 )$ , or equivalently, ", + "bbox": [ + 176, + 247, + 821, + 277 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/a7d84c86e5191f977437b9ecc6569e8e5c1842267420860f4197db43d2343f46.jpg", + "text": "$$\n\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } | \\mathrm { E } \\nu ^ { \\top } \\varphi ( X ) Y ^ { \\ast } ( a ) | = O ( 1 ) .\n$$", + "text_format": "latex", + "bbox": [ + 349, + 281, + 614, + 311 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "By Cauchy-Schwarz inequality, it suffices to show ", + "bbox": [ + 174, + 316, + 504, + 332 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/ee4bcfd33c5212998a365ff71d4b94b109577dca9f8b485fbbfa0ac090343ae9.jpg", + "text": "$$\n\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\mathrm { E } | Y ^ { * } ( a ) | ^ { 2 } \\mathrm { E } | \\nu ^ { \\top } \\varphi ( X ) | ^ { 2 } = O ( 1 ) .\n$$", + "text_format": "latex", + "bbox": [ + 331, + 335, + 632, + 366 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Since $| Y ^ { * } ( a ) | = O ( 1 )$ almost surely, we have by the condition $\\lambda _ { \\operatorname* { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] = O ( 1 )$ that ", + "bbox": [ + 171, + 372, + 813, + 390 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/bcb7b78433d4f322159451cd85d683526257b6de59dc82f3d064f6da69badd75.jpg", + "text": "$$\n\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\mathbf { E } | \\nu ^ { \\top } \\varphi ( X ) | ^ { 2 } = \\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\nu ^ { \\top } \\mathbf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\nu \\leq \\lambda _ { \\operatorname* { m a x } } [ \\mathbf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] = O ( 1 ) .\n$$", + "text_format": "latex", + "bbox": [ + 173, + 392, + 789, + 422 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "The proof is hence completed. ", + "bbox": [ + 174, + 428, + 374, + 443 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "E.5 PROOF OF LEMMA 5 ", + "text_level": 1, + "bbox": [ + 174, + 458, + 357, + 473 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "E.5.1 PROOF OF EQUATION 14 ", + "text_level": 1, + "bbox": [ + 174, + 484, + 398, + 498 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Notice that ", + "bbox": [ + 173, + 508, + 250, + 522 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/b5d16af9003d3307b18d4125c3666b87af4ff921dcd66e88053e106750201436.jpg", + "text": "$$\n\\begin{array} { r } { \\| j ( \\widehat { \\Sigma } _ { 1 , j } - \\Sigma _ { 1 } ) \\| _ { 2 } = \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { j } \\{ A _ { i } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( 1 , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } } \\\\ { + j \\left\\| \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\left( \\displaystyle \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right) \\right\\| _ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 212, + 526, + 753, + 617 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "By Lemma 4, we have ", + "bbox": [ + 173, + 619, + 323, + 633 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/2b53ed79d5085e9d09f0a35e76b5b57ab7e04bda5fd67703aa639c9985fc3b6d.jpg", + "text": "$$\n\\begin{array} { r } { \\left| { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\left( \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right) \\right| \\Big | _ { 2 } \\leq \\varepsilon _ { 0 } ^ { - 2 } q { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\left| \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right| } \\\\ { \\leq \\varepsilon _ { 0 } ^ { - 2 } q ^ { 2 } j ^ { - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } j , \\forall j \\geq . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 638, + 839, + 705 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "with probability at least $1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )$ ", + "bbox": [ + 174, + 708, + 424, + 723 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Consider the first term on the RHS of equation 42. For any $i \\geq 1$ , define $M _ { i } = \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ A _ { i } -$ $\\pi _ { i - 1 } ( 1 , X _ { i } ) \\}$ . Notice that $\\{ M _ { i } \\} _ { i \\geq 1 }$ forms a martingale difference sequence with respect to the filtration $\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 2 \\}$ , since ", + "bbox": [ + 173, + 729, + 825, + 772 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/c89454f92bf83e2c0afe3a43e15ae954002dd9b83f6f2f326195ca6d0e28facf.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ A _ { i } - \\pi _ { i - 1 } ( X _ { i } ) \\} \\vert \\mathcal { F } _ { i - 1 } ] } \\\\ { = } & { \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } [ \\mathbb { E } ( \\varphi ( X _ { i } ) \\varphi ( X _ { i } ) ^ { \\top } \\{ A _ { i } - \\pi _ { i - 1 } ( X _ { i } ) \\} \\vert \\mathcal { F } _ { i - 1 } , X _ { i } ) ] = 0 , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 294, + 776, + 714, + 818 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "where $\\mathrm { E } ^ { \\mathcal { F } _ { i } , { X } _ { i } }$ denotes the conditional expectation given $X _ { i }$ and ${ \\mathcal { F } } _ { i }$ . Here, the first equality is due to that $X _ { i } \\perp \\perp F _ { i - 1 }$ , implied by Lemma 3. Under the given conditions on the basis function $\\varphi ( \\cdot )$ , using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that the following event occurs with probability at least $1 - O ( j ^ { - 2 } )$ , ", + "bbox": [ + 173, + 821, + 825, + 880 + ], + "page_idx": 22 + }, + { + "type": "equation", + "img_path": "images/645f1e1015e9bf71e392b2f562cbe14ef39c72b29365961c7dc919b5213137c3.jpg", + "text": "$$\n\\left\\| \\sum _ { i = 1 } ^ { j } M _ { i } \\right\\| _ { 2 } \\preceq \\sqrt { q j \\log ( j ) } .\n$$", + "text_format": "latex", + "bbox": [ + 392, + 885, + 571, + 928 + ], + "page_idx": 22 + }, + { + "type": "text", + "text": "Notice that $\\textstyle \\sum _ { k \\geq j } k ^ { - 2 } \\leq j ^ { - 2 } + \\sum _ { k > j } \\{ k ( k - 1 ) \\} ^ { - 1 } = j ^ { - 2 } + j ^ { - 1 }$ . Thus, the following occurs with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ , ", + "bbox": [ + 176, + 101, + 825, + 136 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/6241a704f222b25d15ae194e74796ea83258131f4c4cae94832855e4410e6cf2.jpg", + "text": "$$\n\\left\\| \\sum _ { i = 1 } ^ { j } \\{ A _ { i } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( 1 , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q j \\log j } , ~ \\forall j \\geq j _ { n } .\n$$", + "text_format": "latex", + "bbox": [ + 197, + 142, + 766, + 186 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "It follows that ", + "bbox": [ + 173, + 191, + 267, + 205 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/ad6c52e28f6a115fed42965cfbf7d138fbd7d28c9f558c15cac7a557fdf6d6bb.jpg", + "text": "$$\n\\begin{array} { r } { \\| \\big ( \\widehat { \\Sigma } _ { 1 , k } - \\Sigma _ { 1 } \\big ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 312, + 209, + 650, + 231 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( j ^ { - \\alpha _ { 0 } } )$ . Similarly, we can show ", + "bbox": [ + 173, + 234, + 583, + 251 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/fde34ebf4f47073d3164c6a5257cb8a246dd6257a3cbfdf7724669d99317d6f7.jpg", + "text": "$$\n\\begin{array} { r } { \\| \\big ( \\widehat { \\Sigma } _ { 0 , k } - \\Sigma _ { 0 } \\big ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 313, + 257, + 650, + 277 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "with probability at least $1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )$ . The proof is hence completed. ", + "bbox": [ + 176, + 282, + 627, + 299 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "E.5.2 PROOF OF EQUATION 15 ", + "text_level": 1, + "bbox": [ + 174, + 313, + 398, + 328 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "When $j _ { n }$ satisfies $j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } ( j _ { n } ) \\gg q ^ { 2 }$ , it follows from equation 14 and equation 40 that ", + "bbox": [ + 171, + 335, + 758, + 353 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/79b6f79d22ec377a11c83d33f9c48044c876be3563ecefcfd922caa681f49a39.jpg", + "text": "$$\n\\begin{array} { r } { \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] - \\Vert \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } \\Vert _ { 2 } \\geq 2 ^ { - 1 } \\varepsilon _ { 0 } , \\forall k \\geq j _ { n } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 276, + 358, + 687, + 378 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "with probability at least $1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )$ . Combining equation 40 with equation 45 and equation 14, we obtain ", + "bbox": [ + 173, + 383, + 828, + 412 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/af142631fb71f4c152b63b9a18a2d933b099045e731f6b520324a74acd971c42.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { \\Vert \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\Vert _ { 2 } = \\Vert \\widehat { \\Sigma } _ { a , k } ^ { - 1 } ( \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } ) \\Sigma _ { a } ^ { - 1 } \\Vert _ { 2 } \\leq \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ) \\Vert \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } \\Vert _ { 2 } } \\\\ & { } & { \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 210, + 415, + 756, + 462 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "with probability at least $1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )$ . The proof is hence completed. ", + "bbox": [ + 173, + 465, + 629, + 482 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "E.6 PROOF OF LEMMA 6 ", + "text_level": 1, + "bbox": [ + 174, + 497, + 359, + 511 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "For any $l \\in \\{ 1 , \\ldots , q \\}$ and $i \\geq 1$ , define $M _ { i } ( l ) = \\varphi ^ { ( l ) } ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\}$ . Here, $\\varphi ^ { ( l ) } ( X _ { i } )$ corresponds to the $l$ -th element of $\\varphi ( X _ { i } )$ . Similar to equation 43, we can show $\\{ \\dot { M } _ { i } ( l ) \\} _ { i \\geq 1 }$ forms a martingale difference sequence with respect to the filtration $\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 1 \\}$ . By equation 43, we have for any $l$ , ", + "bbox": [ + 173, + 521, + 826, + 580 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/afe12fc10ee3c227df777d4acef5193eee9cdd96ed4cf07fcf1bfcea0bcb2f97.jpg", + "text": "$$\n\\begin{array} { r } { \\mathbb { E } \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\le \\lambda _ { \\operatorname* { m a x } } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] \\le \\epsilon _ { 0 } ^ { - 1 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 328, + 585, + 635, + 606 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "Notice that ", + "bbox": [ + 173, + 611, + 250, + 625 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/2668bb434e3b56e16a896864ab70ca250759cabc5da7815e1ed564d40b89ef96.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} = \\mathbb { E } [ \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } A _ { i } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} ^ { 2 } | \\mathcal { F } _ { i - 1 } ] } \\\\ { \\le } & { \\mathbb { E } [ \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} ^ { 2 } | \\mathcal { F } _ { i - 1 } ] = \\mathbb { E } \\sigma ^ { 2 } ( 1 , X _ { i } ) \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } } \\\\ { \\le } & { 4 \\epsilon _ { 0 } ^ { - 2 } \\mathbb { E } \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\le 4 \\epsilon _ { 0 } ^ { - 3 } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 253, + 628, + 759, + 691 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "where the first equality is due to (A1), the first inequality is due to that $A$ is bounded between 0 and 1, the second equality follows from Lemma 3, the second inequality follows from Lemma 4, and the last inequality is due to equation 46. It follows that ", + "bbox": [ + 178, + 695, + 821, + 738 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/23e67584f8cc36883e9a3b4e29af308ce55d06d8088a487c30d7cff53d3a9776.jpg", + "text": "$$\n\\sum _ { i = 1 } ^ { k } \\operatorname { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} \\leq 4 k \\epsilon _ { 0 } ^ { - 3 } .\n$$", + "text_format": "latex", + "bbox": [ + 377, + 743, + 586, + 787 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "Similarly, by (A1) and Lemma 4, we have ", + "bbox": [ + 174, + 792, + 450, + 808 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/48406becbd6ba4ea4f0fc07394d67ea5376f890f7006ef3c39e89e2a74975f18.jpg", + "text": "$$\n\\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) \\leq 4 \\epsilon _ { 0 } ^ { - 2 } \\sum _ { i = 1 } ^ { k } \\{ \\psi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 361, + 813, + 602, + 857 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "Similar to equation 44, we can show with probability at least $1 - O ( j ^ { - 1 } )$ that ", + "bbox": [ + 173, + 863, + 684, + 878 + ], + "page_idx": 23 + }, + { + "type": "equation", + "img_path": "images/f8fd90bd8a2e51301e49cefc88bb4296fcdcb9e20235726a8a800a8940838f57.jpg", + "text": "$$\n\\sum _ { i = 1 } ^ { k } [ M _ { i } ^ { 2 } ( l ) - \\mathtt { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\preceq \\sqrt { q k \\log k } , \\forall k \\ge j .\n$$", + "text_format": "latex", + "bbox": [ + 299, + 885, + 665, + 928 + ], + "page_idx": 23 + }, + { + "type": "text", + "text": "Thus, for any sequence $j _ { n }$ that satisfies $j _ { n } / \\log ( j _ { n } ) \\gg q$ , we have by equation 47 that ", + "bbox": [ + 173, + 102, + 736, + 119 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/b41093d819950a1f95b6e5633c4c569faa132acbf11e3da3e39890934d14c894.jpg", + "text": "$$\n\\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) + \\sum _ { i = 1 } ^ { k } \\mathrm { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} \\leq \\bar { c } k , \\forall k \\geq j _ { n } ,\n$$", + "text_format": "latex", + "bbox": [ + 308, + 123, + 653, + 167 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "for some constant $\\bar { c } > 0$ , with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . It follows that ", + "bbox": [ + 173, + 171, + 679, + 189 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/838907517dcd3561377156e25d0bd971e23583574cd972c086444e6f60d46ce2.jpg", + "text": "$$\n\\begin{array} { r l } & { \\mathbb { P } _ { \\mathbb { P } } ( \\underset { \\mathrm { S t } } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\sum } } M _ { i } ( \\ell ) \\leq 2 \\sqrt { \\ 6 \\mathbb { k } } \\log k ) \\Bigg \\} } \\\\ & \\mathbb { P } _ { \\mathbb { P } } ( \\{ \\underset { s = 2 } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\prod } } \\frac { \\lambda } { \\underset { s = 1 } { \\prod } } ( \\lambda ) \\leq 2 \\sqrt { 6 \\mathbb { k } \\mathbb { k } \\log k } \\} \\prod _ { s = 2 } \\Biggl \\{ \\underset { s = 1 } { \\overset { k } { \\prod } } \\underset { s = 1 } { \\overset { k } { \\sum } } \\big [ M _ { i } ^ { 2 } ( \\ell ) + \\frac { 4 \\lambda _ { i } ^ { 2 } ( \\ell ) ( \\ell ) ( \\mathcal { F } _ { i - 1 } ) } { \\underset { s = 1 } { \\overset { k } { \\prod } } } ] \\leq \\mathbb { e } \\mathbb { k } \\} \\Bigg \\} \\\\ & { \\mathcal { O } _ { \\mathbb { Q } ^ { ( - 1 ) } } ^ { - 1 } \\succeq \\mathbb { P r } ( \\{ \\underset { \\mathrm { S t } \\geq \\delta _ { i } } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\sum } } ( \\lambda ) ^ { \\frac { \\ell } { \\ell } } ( \\ell ) + \\underset { s = 1 } { \\overset { k } { \\prod } } ( \\ell ) ( \\mathcal { F } _ { i } ) \\underset { s = 1 } { \\overset { k } { \\sum } } \\} \\leq \\mathbb { E } \\mathbb { k } \\} \\Bigg ) - \\mathcal { O } ( \\underset { \\mathbb { P } } { \\longrightarrow } ^ { - 1 } ) } \\\\ & \\mathbb { P } _ { \\mathbb { P } } ( \\{ \\underset { \\mathrm { S t } \\geq \\delta _ { i } } { \\bigcup } \\underset { s = 1 } { \\overset { k } { \\sum } } \\frac { \\lambda } { \\underset { s = 1 } { \\overset { k } { \\prod } } ( \\ell ) \\leq 2 \\sqrt { 6 \\mathbb { k } \\log \\ell } } \\} \\int \\prod _ { s = \\underset { i = 1 } { \\overset { k } { \\sum } } \\sum _ { i } \\mathcal { M } _ { i } ^ { 2 } ( \\ell ) + \\underset { s = 1 } { \\overset { k } { \\sum } } ( \\lambda ) ^ { \\frac { \\ell } { \\sum } } ( \\ell ) \\mathcal { F } _ { i - 1 } \\mathbb { I } \\} \\leq \\mathbb { e } \\mathbb { k } \\Bigg \\} ) } \\\\ & 1 - \\mathbb { P } _ \\mathbb \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 202, + 194, + 861, + 448 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "By Bonferroni’s inequality and Theorem 2.1 of Bercu & Touati (2008), we have ", + "bbox": [ + 173, + 467, + 699, + 483 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/b1509510102a43bcf4a0c195e06f4307afea19d0869d9161e6467f7744b813a1.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { P r } ( \\displaystyle \\bigcap _ { k \\geq j _ { n } } \\{ \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | \\leq 2 \\sqrt { c k \\log { k } } \\} ) \\geq 1 - O ( j _ { n } ^ { - 1 } ) } \\\\ { - } & { \\displaystyle \\sum _ { k \\geq j _ { n } } \\operatorname* { P r } _ { \\epsilon } ( \\{ | \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \\sqrt { c k \\log { k } } \\} \\bigcap _ { k ^ { \\prime } \\geq j _ { n } } \\{ \\displaystyle \\sum _ { i = 1 } ^ { k ^ { \\prime } } [ \\displaystyle M _ { i } ^ { 2 } ( l ) + \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\leq \\bar { \\alpha } k ^ { \\prime } \\} \\} ) } \\\\ { \\geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - \\displaystyle \\sum _ { k \\geq j _ { n } } \\operatorname* { P r } ( \\{ | \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \\sqrt { c k \\log { k } } \\} \\bigcap \\{ \\displaystyle \\sum _ { i = 1 } ^ { k } [ \\displaystyle M _ { i } ^ { 2 } ( l ) + \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\leq \\bar { \\alpha } k \\} } \\\\ { \\geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - 2 \\displaystyle \\sum _ { k \\geq j _ { n } } \\exp ( - \\frac { 4 \\bar { c } k \\log { k } } { 2 \\bar { c k } } ) = 1 - O ( j _ { n } ^ { - 1 } ) - \\displaystyle \\sum _ { k \\geq j _ { n } } 2 k ^ { - 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 186, + 489, + 839, + 676 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "The last term on the RHS of equation 49 is $1 - O ( j _ { n } ^ { - 1 } )$ . To summarize, we have shown that the following event occurs with probability at least $1 - \\dot { O } ( j _ { n } ^ { - 1 } )$ , ", + "bbox": [ + 171, + 679, + 823, + 710 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/8c3af4ca7646bf3d8907c3c80948bc9ec80996b1f00b121af61848ce91b48201.jpg", + "text": "$$\n\\bigcap _ { k \\geq j _ { n } } \\left\\{ | \\sum _ { i = 1 } ^ { k } M _ { i } ( l ) | \\leq 2 { \\sqrt { { \\bar { c } } k \\log k } } \\right\\} .\n$$", + "text_format": "latex", + "bbox": [ + 359, + 714, + 604, + 760 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "By Bonferroni’s inequality, we have ", + "bbox": [ + 174, + 763, + 413, + 779 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/081e1b472858fe6faf480f62673b5072d8ff0a4d50adc86fe6729634ef459d11.jpg", + "text": "$$\n\\bigcap _ { k \\geq j _ { n } } \\left\\{ \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} \\right. _ { 2 } \\leq 2 \\sqrt { \\bar { c } q k \\log k } \\right\\} ,\n$$", + "text_format": "latex", + "bbox": [ + 277, + 784, + 686, + 829 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( j _ { n } ^ { - 1 / 2 } )$ . Similarly, we can show ", + "bbox": [ + 174, + 835, + 588, + 853 + ], + "page_idx": 24 + }, + { + "type": "equation", + "img_path": "images/3109711a5c8b13618da997f3e9541183889c5dc855b1cff24b28f53769852da4.jpg", + "text": "$$\n\\bigcap _ { k \\geq j _ { n } } \\left\\{ \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} \\right. _ { 2 } \\leq c \\sqrt { q k \\log k } \\right\\} ,\n$$", + "text_format": "latex", + "bbox": [ + 261, + 858, + 700, + 902 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "for some constant $c > 0$ , with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . The proof is hence completed. ", + "bbox": [ + 169, + 907, + 784, + 925 + ], + "page_idx": 24 + }, + { + "type": "text", + "text": "E.7 PROOF OF THEOREM 3 ", + "text_level": 1, + "bbox": [ + 174, + 103, + 375, + 118 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "We state the following lemmas before presenting the proof. ", + "bbox": [ + 173, + 128, + 563, + 145 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "Lemma 7 Assume the conditions in Theorem 3 hold. Then for any sequence $\\{ j _ { n } \\} _ { n }$ that satisfies $j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }$ , we have with probability at least $1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )$ that ", + "bbox": [ + 169, + 155, + 823, + 185 + ], + "page_idx": 25 + }, + { + "type": "equation", + "img_path": "images/0bf4ad765184c5114c6de44c5fecb87aef06b9f1b8b9cae921b0e69787b65e60.jpg", + "text": "$$\n\\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\quad \\forall a \\in \\{ 0 , 1 \\} , \\forall k \\geq j _ { n } .\n$$", + "text_format": "latex", + "bbox": [ + 281, + 189, + 686, + 209 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "Lemma 8 Assume the conditions in Theorem 3 hold. Then for any sequence $\\{ j _ { n } \\} _ { n }$ that satisfies $j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }$ , we have with probability at least $1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )$ that ", + "bbox": [ + 171, + 218, + 825, + 250 + ], + "page_idx": 25 + }, + { + "type": "equation", + "img_path": "images/fafce161fbc0c7504692a27d40ce81a021a4d2ca660e720753bf198f8825e48d.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { \\left| \\left| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\Phi _ { a } \\right| \\right| _ { 2 } \\preceq q \\delta _ { k } + q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , } \\\\ & { } & { \\forall a \\in \\{ 0 , 1 \\} , k \\geq j _ { n } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 253, + 779, + 316 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "Similar to the proof of Theorem 1, we will show the assertion in Theorem 3 holds for any $n ( \\cdot )$ that correspond to the realizations of $N ( \\cdot )$ that satisfy $n ( t _ { 1 } ) < n ( t _ { 2 } ) < \\cdots < n ( t _ { K } )$ . For any $1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K$ , define ", + "bbox": [ + 173, + 325, + 826, + 368 + ], + "page_idx": 25 + }, + { + "type": "equation", + "img_path": "images/ff3bb9854dd570eeda9c1583e013889471e5512bdc0a45767fbde54e53b88e7d.jpg", + "text": "$$\n\\begin{array} { l } { { \\displaystyle \\widehat { V } ( k _ { 1 } , k _ { 2 } ) = \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } \\mathrm { C o v } \\left( \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k 1 } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k 1 } ) , \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k 2 } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k 2 } ) | \\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 , \\ldots , n } ^ { + \\infty } \\right) } } \\\\ { { \\displaystyle = \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { k 1 } ) , } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 371, + 839, + 448 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 452, + 202, + 465 + ], + "page_idx": 25 + }, + { + "type": "equation", + "img_path": "images/6902a0d7fbe73dd237203693e21633bb68d0a466d1e777ab92d781df410e5708.jpg", + "text": "$$\n\\widehat { \\pmb { V } } = \\left( \\begin{array} { c c c c } { \\widehat { V } ( 1 , 1 ) } & { \\widehat { V } ( 1 , 2 ) } & { \\ldots } & { \\widehat { V } ( 1 , K ) } \\\\ { \\widehat { V } ( 2 , 1 ) } & { \\widehat { V } ( 2 , 2 ) } & { \\ldots } & { \\widehat { V } ( 2 , K ) } \\\\ { \\vdots } & { \\vdots } & { \\vdots } \\\\ { \\widehat { V } ( K , 1 ) } & { \\widehat { V } ( K , 2 ) } & { \\ldots } & { \\widehat { V } ( K , K ) } \\end{array} \\right) .\n$$", + "text_format": "latex", + "bbox": [ + 313, + 467, + 650, + 544 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "We aim to bound the entrywise $\\ell _ { \\infty }$ norm of $\\widehat { V } - V$ where $V$ is defined in equation 22. It suffices to bound $\\begin{array} { r l } { \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\operatorname* { s u p } _ { b _ { 1 } , b _ { 2 } \\in \\mathbb { R } ^ { p + 1 } , \\| b _ { 1 } \\| _ { 2 } = \\| b _ { 2 } \\| _ { 2 } = 1 } | b _ { 1 } ^ { T } \\{ \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\} b _ { 2 } | } & { = \\| b _ { 2 } ^ { T } \\{ ( k _ { 2 } , k _ { 2 } ) - V ( k _ { 2 } , k _ { 2 } ) \\} b _ { 1 } \\| _ { 2 } = \\| b _ { 2 } ^ { T } \\{ ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\} b _ { 2 } \\| } \\end{array}$ $\\begin{array} { r } { \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\end{array}$ . For any $k _ { 1 } , k _ { 2 }$ , we decompose $\\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } )$ as ", + "bbox": [ + 173, + 547, + 841, + 614 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "Vb (k1, k ${ \\mathrm { ~ \\psi ~ } } _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) = \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) + \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) + \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) ,$ where ", + "bbox": [ + 169, + 614, + 880, + 654 + ], + "page_idx": 25 + }, + { + "type": "equation", + "img_path": "images/9500720c045a11a397bc15fc16cdbd0aba89cb0288678f16d538d6f68fc10711.jpg", + "text": "$$\n\\begin{array} { c } { { k _ { 1 } , k _ { 2 } ) = \\displaystyle { \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat \\beta _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) } } } \\\\ { { \\widehat { V } ^ { \\ast \\ast } ( k _ { 1 } , k _ { 2 } ) = \\displaystyle { \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) \\varphi ( X _ { i } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) \\varphi ( X _ { j } ) } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 202, + 656, + 861, + 753 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "By Lemma 4 and Lemma 8, we obtain that ", + "bbox": [ + 173, + 756, + 457, + 771 + ], + "page_idx": 25 + }, + { + "type": "equation", + "img_path": "images/4014d66a2a14ed0ec4a2585119ce6df54abed7f17e4b78768c111f8153240aac.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\| \\hat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\\\ { \\leq } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\Bigg \\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\underset { j = 1 } { \\overset { n ( t _ { k _ { 1 } } ) } { \\sum } } \\underset { 2 = 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - } } \\\\ { \\leq } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { \\epsilon _ { 0 } ^ { 2 } } \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\Bigg \\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\underset { j = 1 } { \\overset { n ( t _ { k _ { 1 } } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\Phi _ { a } \\Bigg \\| _ { 2 } } \\\\ { \\overset { \\leq } } & { q \\delta _ { n ( t _ { 1 } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \\sqrt { \\log n ( t _ { 1 } ) } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 186, + 775, + 839, + 930 + ], + "page_idx": 25 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ . ", + "bbox": [ + 176, + 103, + 452, + 119 + ], + "page_idx": 26 + }, + { + "type": "text", + "text": "Notice that ", + "bbox": [ + 173, + 125, + 250, + 140 + ], + "page_idx": 26 + }, + { + "type": "equation", + "img_path": "images/f7ad89a33ccf60cca3eb02d2bcb406f4053c0c971fd42f814903cb5dc5c592ad.jpg", + "text": "$$\n\\begin{array} { r l r } { { \\sum _ { i = 1 } ^ { n } \\operatorname { n u f f } _ { k \\to i } \\hat { \\mathcal { V } } ^ { * } ( k _ { 1 } , k _ { 2 } ) = \\sum _ { s = i } ^ { 1 } \\sum _ { i = 1 } ^ { k } \\sum _ { m \\in \\{ i , j \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\xi _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big ] ^ { 2 } \\Sigma _ { a } ^ { - 1 } } } \\\\ & { } & { \\underset { = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { = 1 } { \\overset { n ( \\cdot ) } { \\sum } } \\sum _ { i = 1 } ^ { n } \\sum _ { ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) } \\xi ^ { \\top } ( X _ { i } ) \\big \\{ ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } + \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big ) ^ { 2 } \\Sigma _ { a } ^ { - 1 } } \\\\ & { } & { + \\sum _ { 1 } ^ { k _ { 1 } } \\sum _ { i = 0 } ^ { k } \\sum _ { \\beta = 1 } ^ { k } \\sum _ { \\beta = 1 } ^ { k } \\sum _ { 0 } ^ { k } \\sum _ { 0 } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\} \\hat { \\varphi } _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } } \\\\ & { } & + 2 \\sum _ { a = 0 } ^ { 1 } \\sum _ { i = 1 } ^ { k _ { 1 } } \\sum _ { \\beta = 1 } ^ { k _ { 2 } } \\sum _ { \\alpha } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { \\alpha } - \\varphi ^ { \\top } ( X _ { i } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 225, + 141, + 880, + 364 + ], + "page_idx": 26 + }, + { + "type": "text", + "text": "It follows that ", + "bbox": [ + 173, + 361, + 267, + 375 + ], + "page_idx": 26 + }, + { + "type": "equation", + "img_path": "images/0e255892d7c2ff036db5844834d38f73e159107ecd6115d6f60e86d3cb2289fe.jpg", + "text": "$$\n\\begin{array} { r l } { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\left\\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } } & { { } } \\\\ { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { \\top } \\mathbb { I } ( X _ { i } ) \\right\\| _ { 2 } ^ { 2 } } & { { } } \\\\ { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 2 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { \\top } ( X _ { i } ) ( \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } ) ) \\varphi ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } ) \\right\\| _ { 2 } ^ { 2 } } & { { } = 0 } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 202, + 377, + 861, + 511 + ], + "page_idx": 26 + }, + { + "type": "text", + "text": "By Lemma 4, we obtain that ", + "bbox": [ + 173, + 512, + 362, + 526 + ], + "page_idx": 26 + }, + { + "type": "equation", + "img_path": "images/68ae25e47cf6d8bf4b9681cff0f465fbb3ec7ea8dc1ae29cec1a223910da0613.jpg", + "text": "$$\n\\begin{array} { r l } & { \\quad \\underset { 1 \\leq k \\leq k \\leq K } { \\operatorname* { m a x } } \\| \\hat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\\\ & { \\quad \\underset { 1 \\leq k \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { K } \\| \\underset { 2 \\leq - 1 : = n ( \\{ k _ { 1 } , - 1 \\} + 1 ) } { \\overset { k _ { 1 } } { \\sum } } \\mathbb { \\overset { n ( k _ { 2 } ) } { \\sum } } \\mathbb { \\overset { \\eta ( A _ { i } ) } { = } } \\alpha ^ { \\top } ( X _ { i } ) \\boldsymbol { \\varphi } ^ { \\top } ( X _ { i } ) \\boldsymbol { \\{ \\varphi } } ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\boldsymbol { \\varphi } ^ { \\top } ( X _ { i } ) \\beta _ { a } ( t _ { 2 } ) \\boldsymbol { \\} ^ { 2 } \\| _ { 2 } } \\\\ & { \\quad \\underset { \\theta \\leq \\{ 0 , 1 \\} } { \\overset { \\operatorname* { m a x } } { = } } \\frac { 1 } { K } \\| \\underset { 1 \\leq k \\leq K } { \\sum } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 202, + 529, + 861, + 741 + ], + "page_idx": 26 + }, + { + "type": "text", + "text": "By Lemmas 4 and 7, we have with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ that ", + "bbox": [ + 174, + 746, + 669, + 762 + ], + "page_idx": 26 + }, + { + "type": "equation", + "img_path": "images/2294f172ea3c007f254ce98ce62c336ef5f15c87acbe8f47fa9ce2e079559c89.jpg", + "text": "$$\n\\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\| \\Psi _ { 1 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} \\left\\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\right\\| _ { 2 } ,\n$$", + "text_format": "latex", + "bbox": [ + 194, + 765, + 767, + 816 + ], + "page_idx": 26 + }, + { + "type": "text", + "text": "Similar to Lemma 5, we can show there exists some constant $c _ { * } > 0$ that ", + "bbox": [ + 173, + 837, + 653, + 852 + ], + "page_idx": 26 + }, + { + "type": "equation", + "img_path": "images/28f7e71fc8de827bc285a3a6b1b39ad721c5331ac8aad8b64a3a759cd747cb5c.jpg", + "text": "$$\n\\begin{array} { r l } & { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } \\big ( A _ { i } = a \\big ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\} \\big ] \\right\\| _ { 2 } } \\\\ & { \\quad \\quad \\leq c _ { * } \\{ q \\delta _ { n ( t _ { k _ { 1 } } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 218, + 854, + 745, + 929 + ], + "page_idx": 26 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ . By Lemma 4, we can show with probability at least $1 - \\bar { O } ( n ^ { - 1 } ( t _ { 1 } ) )$ that ", + "bbox": [ + 168, + 102, + 826, + 133 + ], + "page_idx": 27 + }, + { + "type": "equation", + "img_path": "images/4c19b795794f1a20727e1549383501561f5a15747452499df0608f6bb5941a90.jpg", + "text": "$$\n\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\mathbb I ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\} \\right\\| _ { 2 } = O ( 1 ) .\n$$", + "text_format": "latex", + "bbox": [ + 256, + 133, + 707, + 185 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "This together with equation 52 and equation 53 yields ", + "bbox": [ + 173, + 185, + 527, + 200 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ ", + "bbox": [ + 174, + 223, + 444, + 238 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "$\\begin{array} { r } { n ^ { - 1 } ( t _ { k 1 } ) \\| \\Psi _ { 1 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} , } \\end{array}$ . ", + "bbox": [ + 235, + 202, + 728, + 238 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "Moreover, using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that for any $1 \\leq k _ { 1 } \\leq K$ , the following event occurs with probability at least $1 - O ( n ^ { - 2 } ( t _ { k _ { 1 } } ) )$ , ", + "bbox": [ + 176, + 244, + 823, + 273 + ], + "page_idx": 27 + }, + { + "type": "equation", + "img_path": "images/b528917172b00eaab720b780fa28188acf59e1804b2a40c6bfe59770fe209841.jpg", + "text": "$$\n\\frac { 1 } { \\iota ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { ( l ) } ( X _ { i } ) \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 275, + 839, + 325 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "$\\begin{array} { r } { \\sum _ { k _ { 1 } = 1 } ^ { K } n ^ { - 2 } ( t _ { k _ { 1 } } ) \\leq n ^ { - 1 } ( t _ { 1 } ) } \\end{array}$ $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ ", + "bbox": [ + 173, + 345, + 772, + 363 + ], + "page_idx": 27 + }, + { + "type": "equation", + "img_path": "images/0bc36a084eb2ebcb3b98a93887bc37430402e973e8fb34a708c056581d72d74c.jpg", + "text": "$$\n\\frac { 1 } { \\iota ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { ( l ) } ( X _ { i } ) \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 364, + 839, + 417 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "In addition, it follows from Lemma 7 that ", + "bbox": [ + 176, + 434, + 447, + 449 + ], + "page_idx": 27 + }, + { + "type": "equation", + "img_path": "images/71dc3c0168e0045f066825ba8708f70f7cd37955ed2187033322a65322dfdd1a.jpg", + "text": "$$\n\\begin{array} { r } { n ^ { - 1 } ( t _ { k _ { 1 } } ) \\| \\Psi _ { 2 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 3 / 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 230, + 449, + 733, + 469 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "This together with equation 54 yields that ", + "bbox": [ + 176, + 478, + 449, + 493 + ], + "page_idx": 27 + }, + { + "type": "equation", + "img_path": "images/58fd4a50956a62fae9a7e7805b4c4dc55052f270be671c4713baf11b8630ffcd.jpg", + "text": "$$\n\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 264, + 494, + 697, + 523 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ . Under the given conditions, we have ", + "bbox": [ + 173, + 526, + 691, + 542 + ], + "page_idx": 27 + }, + { + "type": "equation", + "img_path": "images/6071cef6b0af5bf1ad3eee7741170d33e5c24a6ad76908800171d7740dde65f6.jpg", + "text": "$$\n\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \\log ^ { 1 / 2 } n ( t _ { 1 } ) ,\n$$", + "text_format": "latex", + "bbox": [ + 240, + 544, + 722, + 574 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - 1 } ( t _ { 1 } ) )$ ", + "bbox": [ + 174, + 577, + 444, + 593 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "Moreover, with some calculations, we can show that ", + "bbox": [ + 173, + 598, + 519, + 613 + ], + "page_idx": 27 + }, + { + "type": "equation", + "img_path": "images/04be3cae4a9688e33606be7ed589be85efc05f4f25d1b2dc1151488d51182b38.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\left\\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\leq \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\underset { j \\geq 1 } { \\operatorname* { m a x } } \\left\\| \\Sigma _ { a } ^ { - 1 } - \\widehat { \\Sigma } _ { a } ^ { - 1 } ( l _ { j } ) \\right\\| _ { 2 } } \\\\ { \\times } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 2 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { j } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\right\\| _ { 2 } } \\\\ { + } & { \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { i } ) } { \\sum } } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\right\\| } \\\\ { \\times } & { \\underset { j \\geq 1 } { \\operatorname* { m a x } } \\| \\Sigma _ { a } ^ { - 1 } - \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\| _ { 2 } ^ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 187, + 614, + 839, + 787 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "In view of Lemma 4 and Lemma 5, we have with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ that ", + "bbox": [ + 171, + 789, + 772, + 805 + ], + "page_idx": 27 + }, + { + "type": "equation", + "img_path": "images/298782662824acf531c5b9456cce46c58772056078045001b98db00e60d16d0a.jpg", + "text": "$$\n\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\left\\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\leq O ( 1 ) ( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ) } \\\\ { \\times } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { j } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\right\\| , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 214, + 808, + 799, + 929 + ], + "page_idx": 27 + }, + { + "type": "text", + "text": "where $O ( 1 )$ denotes some positive constant. Similar to equation 50 and equation 55, we can show with probability at least $1 \\stackrel { - } { - } O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ that ", + "bbox": [ + 171, + 103, + 823, + 133 + ], + "page_idx": 28 + }, + { + "type": "equation", + "img_path": "images/1fab5457321bc242941464700f2be8af4c80b454b4340877699ba9d476f9dc26.jpg", + "text": "$$\n\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\left\\| { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } } \\Psi _ { 3 , a , k _ { 1 } } - \\Psi _ { a } \\right\\| _ { 2 } = o ( 1 ) .\n$$", + "text_format": "latex", + "bbox": [ + 320, + 140, + 643, + 175 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "Similar to Lemma 4, we can show $\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\Psi _ { a } \\| _ { 2 } = O ( 1 ) } \\end{array}$ . It follows that ", + "bbox": [ + 174, + 181, + 684, + 200 + ], + "page_idx": 28 + }, + { + "type": "equation", + "img_path": "images/a9192a7fcda4c92cb8f75adcab18fd6b499211246abaaa65fa75569d72169ebb.jpg", + "text": "$$\n\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 233, + 205, + 728, + 236 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ . Combining this together with equation 50 and equation 55, we obtain with probability at least $1 - \\dot { O } ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ that ", + "bbox": [ + 174, + 244, + 821, + 275 + ], + "page_idx": 28 + }, + { + "type": "equation", + "img_path": "images/a417f09523a6add689d0026a3b3578e95fe4ed870caf7ef06efdec331f04c547.jpg", + "text": "$$\n\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\left\\| { \\widehat { V } } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } + { \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } } .\n$$", + "text_format": "latex", + "bbox": [ + 236, + 281, + 725, + 310 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "Consider the function $\\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } }$ defined in the proof of Theorem 1. We fix $\\delta = \\eta ^ { - 1 } \\{ \\log K +$ $4 d \\log n ( t _ { 1 } ) \\}$ . Based on Lemma A2 in Belloni $\\&$ Oliveira (2018), we have with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ that ", + "bbox": [ + 174, + 319, + 825, + 364 + ], + "page_idx": 28 + }, + { + "type": "equation", + "img_path": "images/cfeeb911fb3cd7dcf55e2454f6e1f3c166ae1b764787191c509dfd33ece8097e.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { \\underset { \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } \\left| { \\mathbf E } ^ { * } { \\mathbf g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) - { \\mathbf E } { \\mathbf g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , { \\pmb V } ) ) \\right| } \\\\ & { } & { \\preceq q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 267, + 371, + 696, + 434 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "where $\\mathbf { E } ^ { \\ast }$ denotes the expectation conditional on the observed data. For a given set of thresholds $\\{ \\nu _ { k } \\} _ { k }$ , using similar arguments in proving equation 31, equation 32, equation 34 and equation 35, we can show with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ that ", + "bbox": [ + 173, + 439, + 825, + 483 + ], + "page_idx": 28 + }, + { + "type": "equation", + "img_path": "images/cc351a59d858ee7490babaaeb95a55a89c6746faf6069c29b942d06882afd573.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { P r } ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\scriptscriptstyle { \\mathrm { M B } * } } - \\nu _ { k } \\right) \\le 0 \\right\\} \\le \\mathrm { E } ^ { * } \\mathtt { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , + } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) } \\\\ { \\le } & { \\mathrm { E } \\underline { { \\mathtt { g } } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , + } \\} _ { k } } ( N ( 0 , V ) ) + O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) } \\\\ { \\le } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\overline { { \\mathtt { X } } } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , + } ^ { * } \\right) \\le 0 \\right\\} } \\\\ { + } & { O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 184, + 489, + 839, + 618 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "and ", + "bbox": [ + 173, + 625, + 202, + 637 + ], + "page_idx": 28 + }, + { + "type": "equation", + "img_path": "images/93ad3108d19767a0e7bdebc66e4c173502d86665bbb8bce23498ead2eeefc581.jpg", + "text": "$$\n\\begin{array} { r l } & { \\operatorname* { P r } ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\scriptscriptstyle { \\mathrm { M B } * } } - \\nu _ { k } \\right) \\leq 0 \\right\\} \\geq \\mathrm { E } ^ { * } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , - } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) } \\\\ { \\geq } & { \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , - } \\} _ { k } } ( N ( 0 , V ) ) - O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) } \\\\ { \\geq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } \\\\ { - } & { O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 184, + 643, + 839, + 772 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "where $O ( 1 )$ denotes some positive constant, and ", + "bbox": [ + 174, + 777, + 493, + 792 + ], + "page_idx": 28 + }, + { + "type": "equation", + "img_path": "images/dc99c18c562c2884047ccad7efef2eb4838bd16083b3ca6d71e93d3c0cc346c6.jpg", + "text": "$$\n\\begin{array} { r l } & { \\nu _ { k , + } = \\nu _ { k } + \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \\nu _ { k , + } ^ { * } = \\nu _ { k , + } + 3 \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} } \\\\ & { \\nu _ { k , - } = \\nu _ { k } - 3 \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} - \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \\nu _ { k , - } ^ { * } = \\nu _ { k , - } - \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 204, + 797, + 861, + 843 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "By Theorem 2 of Chernozhukov et al. (2017), we obtain that ", + "bbox": [ + 173, + 845, + 573, + 862 + ], + "page_idx": 28 + }, + { + "type": "equation", + "img_path": "images/035cd86cc5282b44c2b747c06c0961c61522ced32361a9725cacb548c0b94124.jpg", + "text": "$$\n\\begin{array} { r } { \\mathtt { p } _ { \\mathrm { T } } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , + } ^ { * } \\right) \\le 0 \\right\\} - \\mathtt { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , - } ^ { * } \\right) \\le 0 \\right\\} } \\\\ { \\preceq \\eta ^ { - 1 } \\{ \\log ^ { 3 / 2 } n ( t _ { 1 } ) + \\log ^ { 3 / 2 } K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \\{ \\log ^ { 1 / 2 } n ( t _ { 1 } ) + \\log ^ { 1 / 2 } K \\} . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 867, + 839, + 929 + ], + "page_idx": 28 + }, + { + "type": "text", + "text": "It follows that ", + "bbox": [ + 173, + 103, + 267, + 118 + ], + "page_idx": 29 + }, + { + "type": "equation", + "img_path": "images/14011b32e0863773df48fc26ca76e79e1487225d9103c264dcc95cb23749c27f.jpg", + "text": "$$\n\\begin{array} { r } { \\underset { \\nu _ { k } \\not \\mathrm { J } _ { k } } { \\operatorname* { s u p } } | { \\operatorname* { P r } } ^ { * } \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } - \\nu _ { k } ) \\leq 0 \\} - { \\operatorname* { P r } } \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k } ) \\leq 0 \\} } \\\\ { \\preceq q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} ( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ) } \\\\ { + \\eta ^ { - 1 } \\{ \\log ^ { 3 / 2 } n ( t _ { 1 } ) + \\log ^ { 3 / 2 } K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \\{ \\log ^ { 1 / 2 } n ( t _ { 1 } ) + \\log ^ { 1 / 2 } K \\} } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 125, + 839, + 213 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )$ . Set ", + "bbox": [ + 173, + 218, + 482, + 234 + ], + "page_idx": 29 + }, + { + "type": "equation", + "img_path": "images/6896a4985723f61306460a5100ec6aa098d4224277481af733881c1bc66b21a1.jpg", + "text": "$$\n\\eta = \\operatorname* { m i n } [ q ^ { - 1 } n ^ { \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { - ( 1 + 2 \\alpha _ { 0 } ) / 6 } \\{ K n ( t _ { 1 } ) \\} , q ^ { - 1 / 2 } n ^ { 1 / 6 } ( t _ { 1 } ) \\log ^ { - 1 / 3 } \\{ K n ( t _ { 1 } ) \\} ] ,\n$$", + "text_format": "latex", + "bbox": [ + 223, + 243, + 772, + 263 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "we obtain the desired result. ", + "bbox": [ + 173, + 272, + 359, + 287 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "E.8 PROOF OF LEMMA 7 ", + "text_level": 1, + "bbox": [ + 174, + 308, + 357, + 321 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "Combining Lemma 6 with Lemma 4 yields that ", + "bbox": [ + 173, + 334, + 486, + 349 + ], + "page_idx": 29 + }, + { + "type": "equation", + "img_path": "images/b0a6063c35d1e3122f587337a9ba3c78e38c7bb832a251582d9aa652c294aa43.jpg", + "text": "$$\n\\left. \\Sigma _ { a } ^ { - 1 } \\left( \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right) \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } , a \\in \\{ 0 , 1 \\} ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 358, + 826, + 404 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . Combining this together with equation 16 yields that ", + "bbox": [ + 171, + 411, + 766, + 429 + ], + "page_idx": 29 + }, + { + "type": "equation", + "img_path": "images/bc2cf4ae409cbfad26663ccbbefa14adf028030f3840b8a4cd1fe6fc98112b3b.jpg", + "text": "$$\n\\begin{array} { r } { \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } , a \\in \\{ 0 , 1 \\} , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 289, + 436, + 674, + 458 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . The proof is hence completed. ", + "bbox": [ + 171, + 467, + 620, + 483 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "E.9 PROOF OF LEMMA 8 ", + "text_level": 1, + "bbox": [ + 173, + 502, + 359, + 516 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "Notice that ", + "bbox": [ + 173, + 530, + 250, + 544 + ], + "page_idx": 29 + }, + { + "type": "equation", + "img_path": "images/8475210fe69162edb06d280f3b6535563fbb9e59422470507dbea1829fb922e0.jpg", + "text": "$$\n\\begin{array} { r l } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ) ^ { 2 } - \\Phi _ { a } \\right\\| _ { 2 } } \\\\ { \\le } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) [ \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) ] \\right\\| _ { 2 } } \\\\ { + } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) - \\Phi _ { a } \\right\\| _ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 261, + 551, + 750, + 686 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "Similar to the proof of Lemma 5, we can show that the second term on the RHS of equation 56 is of the order $O ( q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } )$ , for any $a \\in \\{ 0 , 1 \\}$ and any $k \\geq j _ { n }$ , with probability at least $1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )$ . As for the first term, notice that each element in the matrix ", + "bbox": [ + 176, + 693, + 823, + 738 + ], + "page_idx": 29 + }, + { + "type": "equation", + "img_path": "images/c1eefd4a3f072fb139798ea9dd495c7b3d5de3bb86fdb5361c8f334000ae3261.jpg", + "text": "$$\n\\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ) ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) \\}\n$$", + "text_format": "latex", + "bbox": [ + 264, + 747, + 700, + 791 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "corresponds to a martingale with respect to the filtration $\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 1 \\}$ , under (A1) and (A2). Using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that ", + "bbox": [ + 173, + 799, + 823, + 830 + ], + "page_idx": 29 + }, + { + "type": "equation", + "img_path": "images/c5ef5ba1bf838d63226ef6e70d156c9f5306b602bda9c7bc55db3c50fcc52e94.jpg", + "text": "$$\n\\left. \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) [ \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) ] \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } ,\n$$", + "text_format": "latex", + "bbox": [ + 173, + 838, + 787, + 898 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . The proof is hence completed. ", + "bbox": [ + 173, + 907, + 620, + 925 + ], + "page_idx": 29 + }, + { + "type": "text", + "text": "E.10 PROOF OF LEMMA 2 ", + "text_level": 1, + "bbox": [ + 174, + 103, + 369, + 118 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "We begin by providing an upper bound for $\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } } \\end{array}$ . With some calculations, we have ", + "bbox": [ + 173, + 127, + 825, + 160 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/f99d49c76ea24f57de770704be3f6da67df34d4a6c067d1dc2ff547e09d87889.jpg", + "text": "$$\n\\begin{array} { r } { \\displaystyle \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } = \\displaystyle \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left\\| \\widehat { \\boldsymbol { \\Sigma } } _ { a , k } ^ { - 1 } \\left( \\displaystyle \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right) \\right\\| _ { 2 } } \\\\ { \\leq \\displaystyle \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\widehat { \\boldsymbol { \\Sigma } } _ { a , k } ^ { - 1 } \\right\\| _ { 2 a \\in \\{ 0 , 1 \\} } \\displaystyle \\operatorname* { m a x } _ { k } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 194, + 160, + 767, + 251 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "By Lemma 6, we obtain with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ that ", + "bbox": [ + 171, + 256, + 604, + 271 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/8e02308c99fdcb5824d3e79b41fea44dfc335ef10ff4c22e3e84cb6f54f98c20.jpg", + "text": "$$\n\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } .\n$$", + "text_format": "latex", + "bbox": [ + 199, + 276, + 766, + 320 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "Similarly, we can show with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ that ", + "bbox": [ + 173, + 325, + 599, + 342 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/c7495ade52eb7d5c794ef9d165dd659ff162e83a0d29075f2fe50e77b3ecae2a.jpg", + "text": "$$\n\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left\\| \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log j _ { n } } ,\n$$", + "text_format": "latex", + "bbox": [ + 230, + 347, + 732, + 391 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "Similar to equation 42, we have ", + "bbox": [ + 173, + 421, + 383, + 435 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/112658f5f18d71dff63814ee8aeac48fb40109561b305adca62497dac74cea42.jpg", + "text": "$$\n\\begin{array} { r l r } & { } & { \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } ~ \\lambda _ { \\mathrm { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m i n } } ~ \\lambda _ { \\mathrm { m i n } } \\left( \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\frac { 1 } { k } \\underset { i = 1 } { \\overset { k } { \\sum } } \\pi _ { i - 1 } ( a , X ) \\right) } \\\\ & { } & { - \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } ~ \\frac { 1 } { k } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 210, + 440, + 753, + 530 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "Using similar arguments in proving equation 44, we can show that ", + "bbox": [ + 173, + 534, + 609, + 549 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/8243d3944f2a103dde0cdd28b11c4f9bd983f4d5c87a4c5166ab7795bc02f78c.jpg", + "text": "$$\n\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ { \\mathbb { I } } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log k } ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 553, + 782, + 598 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . Similarly, we can show ", + "bbox": [ + 173, + 618, + 575, + 636 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/8f0e5115f02954dee91dfc36586b5fd172651251319fea0d46280c2833ebf7dc.jpg", + "text": "$$\n\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ { \\mathbb { I } } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log j _ { n } } ,\n$$", + "text_format": "latex", + "bbox": [ + 178, + 640, + 784, + 685 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ ", + "bbox": [ + 174, + 705, + 416, + 722 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "Without loss of generality, assume $\\varepsilon _ { 0 } \\leq 1 / 2$ . Notice that we have $\\pi _ { i - 1 } ( a , x ) \\geq \\varepsilon _ { 0 }$ , for any $a \\in$ $\\{ 0 , 1 \\} , x \\in \\mathbb { X }$ and $i \\geq N _ { 0 }$ . This together with Lemma equation 4 implies that ", + "bbox": [ + 171, + 727, + 823, + 757 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/8583626ddc7a477a67a134fba07ab17a194e0c368d18cfe5ee3160f6e996dfa1.jpg", + "text": "$$\n\\operatorname* { i n f } _ { a \\in \\{ 0 , 1 \\} , n \\geq j _ { n } } \\lambda _ { \\operatorname* { m i n } } \\left( \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\frac { 1 } { n } \\sum _ { i = 1 } ^ { n } \\pi _ { i - 1 } ( a , X ) \\right) \\geq \\frac { n - N _ { 0 } } { n } \\varepsilon _ { 0 } \\geq \\frac { j - N _ { 0 } } { j } \\varepsilon _ { 0 } .\n$$", + "text_format": "latex", + "bbox": [ + 192, + 762, + 771, + 805 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "Combining this together with equation 60 and equation 61 yields ", + "bbox": [ + 173, + 809, + 601, + 824 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/85070b0f79dc8a2678bd4332fdfcf8fcc1b4282538fe6ebac2a7baa9794971d8.jpg", + "text": "$$\n\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\frac { \\varepsilon _ { 0 } } { 2 } , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } ,\n$$", + "text_format": "latex", + "bbox": [ + 325, + 828, + 637, + 858 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "for some constant $L ^ { * } \\geq 1$ , with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . This together with equation 58 and equation 59 yields that ", + "bbox": [ + 171, + 864, + 825, + 895 + ], + "page_idx": 30 + }, + { + "type": "equation", + "img_path": "images/32eae6a2cd006bc94c93939067fb95113a411988e498c1f8593cf8d26868d21a.jpg", + "text": "$$\n\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) } , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } ,\n$$", + "text_format": "latex", + "bbox": [ + 235, + 898, + 727, + 928 + ], + "page_idx": 30 + }, + { + "type": "text", + "text": "with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ ", + "bbox": [ + 174, + 103, + 416, + 119 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "By Condition (A3), we have ", + "bbox": [ + 173, + 125, + 361, + 140 + ], + "page_idx": 31 + }, + { + "type": "equation", + "img_path": "images/ddb1d90e27280361dbab6ce36fd255d2d4f0e6ead7bf20cb281fd61fc751f619.jpg", + "text": "$$\n\\begin{array} { r } { | \\varphi ^ { \\mathsf { T } } ( X ) ( \\widehat { \\beta } _ { 1 , k } - \\widehat { \\beta } _ { 0 , k } - \\beta _ { 1 } + \\beta _ { 0 } ) | \\leq \\bar { L } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 196, + 145, + 767, + 165 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "for some constant $\\bar { L } > 0$ , with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ . ", + "bbox": [ + 173, + 171, + 588, + 188 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "For any $z _ { 1 } , z _ { 2 } \\in \\mathbb { R }$ , we have $\\mathbb { I } ( z _ { 1 } > 0 ) \\neq \\mathbb { I } ( z _ { 2 } > 0 )$ only when $| z _ { 1 } - z _ { 2 } | \\geq | z _ { 2 } |$ . Hence, under the event defined in equation 62, the event $\\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\widehat { \\beta } _ { 1 , k } - \\widehat { \\beta } _ { 0 , k } ) > 0 \\} \\neq \\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) > 0 \\}$ occurs only when ", + "bbox": [ + 173, + 193, + 821, + 239 + ], + "page_idx": 31 + }, + { + "type": "equation", + "img_path": "images/241af2b941e8433242d3376619be37c7a81a0e63dd6597742ecf5c6a1ef35b97.jpg", + "text": "$$\n\\begin{array} { r } { | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) | \\le | \\varphi ^ { \\top } ( X ) ( \\widehat \\beta _ { 1 , k } - \\widehat \\beta _ { 0 , k } - \\beta _ { 1 } + \\beta _ { 0 } ) | \\le \\bar { L } q k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) } , } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 196, + 243, + 766, + 265 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "for any $k \\geq j _ { n }$ . Under the given conditions, we have ", + "bbox": [ + 173, + 270, + 522, + 285 + ], + "page_idx": 31 + }, + { + "type": "equation", + "img_path": "images/64facdf10834de275f42513b2ddc9f6855f03f3bc3fac35d07fd7b06ee94e6c9.jpg", + "text": "$$\n\\begin{array} { r } { \\operatorname* { P r } \\Big ( | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) | \\leq \\bar { L } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) \\Big ) \\leq \\bar { L } L _ { 0 } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) . } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 186, + 289, + 781, + 318 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "Notice that when $\\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\widehat { \\beta } _ { 1 , k } \\ - \\ \\widehat { \\beta } _ { 0 , k } ) \\ > \\ \\ 0 \\} = \\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } \\ - \\ \\beta _ { 0 } ) \\ > \\ \\ 0 \\}$ , we have $\\pi _ { k } ( a , X ) = \\pi ^ { * } ( a , X ) $ . Thus, we obtain $\\pi _ { k } ( a , X ) ~ = ~ \\pi ^ { * } ( a , X )$ if $\\begin{array} { r l } { \\vert \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\vert } & { { } > } \\end{array}$ $\\bar { L } q k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) }$ , for any $k \\geq L ^ { * } { \\sqrt { q \\log j _ { n } } }$ . Set $k _ { 0 } = L ^ { * } { \\sqrt { q \\log j _ { n } } }$ . By equation 62 and equation 63, we have with probability at least $1 - O ( j _ { n } ^ { - 1 } )$ that ", + "bbox": [ + 173, + 321, + 825, + 388 + ], + "page_idx": 31 + }, + { + "type": "equation", + "img_path": "images/a467558b115027eac90b8bfd57ea2595bbf517c18d0cc91e2f5c782ce7abefa8.jpg", + "text": "$$\n\\begin{array} { r l } { { \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { i = 1 } ^ { K } \\Big \\{ \\underset { i = 1 } { \\overset { K } { \\sum } } \\{ \\alpha _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\} \\Big \\} \\Bigg \\{ \\underset { \\alpha \\in \\{ 0 , 1 \\} } { \\sum } \\sum _ { i = 1 } ^ { K } \\sum _ { i = 1 } ^ { K } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert } } \\\\ { + \\ } & { \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { i = K + 1 } ^ { K } \\sum _ { i = 1 } ^ { K } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\leq 2 L ^ { * } \\sqrt { \\| \\Phi \\| _ { 2 } } } \\\\ { + \\ } & { \\mathrm { a s t ~ } \\big \\{ \\underset { i = 1 } { \\overset { K } { \\sum } } \\big \\} \\sum _ { i = 1 } ^ { K } \\mathbb { E } ^ { I _ { i - 1 } } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\rvert > L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\} } \\\\ { + \\ } & { \\underset { \\mathrm { a s t ~ } \\{ 0 , 1 \\} + \\kappa = + 1 } { \\overset { K } { \\sum } } \\mathbb { E } ^ { I _ { i } } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\rvert \\leq L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\} } \\\\ { + \\ } & \\underset { \\mathrm { a s t ~ } \\{ 0 , 1 \\} + \\kappa = + 1 } { \\overset { K } { \\sum } } \\mathbb { E } ^ { I _ { i } } \\cdot \\big \\| \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\| \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\| \\leq L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 186, + 396, + 838, + 627 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "The proof is hence completed. ", + "bbox": [ + 174, + 631, + 374, + 646 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "F COMPARISON OF THE BASELINE", + "text_level": 1, + "bbox": [ + 176, + 665, + 473, + 681 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "Consider our test statistic $S ( t )$ . Under $H _ { 0 }$ , it can be bounded from above by ", + "bbox": [ + 174, + 696, + 673, + 712 + ], + "page_idx": 31 + }, + { + "type": "equation", + "img_path": "images/4e4f08c3e1765f2867133075a8f17d560b165aebd99f647fa2b66a4d309ebc48.jpg", + "text": "$$\n\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ { \\widehat { \\beta } } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - { \\widehat { \\beta } } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} .\n$$", + "text_format": "latex", + "bbox": [ + 349, + 717, + 614, + 747 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "It suffices to provide an upper bound for the above expression. By Cauchy-Schwarz inequality, equation 64 can be upper bounded by ", + "bbox": [ + 171, + 751, + 823, + 780 + ], + "page_idx": 31 + }, + { + "type": "equation", + "img_path": "images/bcfb5c2f16ca4d4b73ee4a5fa8da9e9ee6f1ba036d8fb061746f168c789d29e6.jpg", + "text": "$$\n\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } \\| { \\widehat { \\beta } } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - { \\widehat { \\beta } } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\| _ { 2 } .\n$$", + "text_format": "latex", + "bbox": [ + 341, + 785, + 622, + 815 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "It suffices to provide anytime upper bound for $\\| \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) - \\beta _ { 0 } ^ { * } \\| _ { 2 }$ . ", + "bbox": [ + 176, + 820, + 673, + 840 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "Recall that ", + "bbox": [ + 173, + 844, + 248, + 859 + ], + "page_idx": 31 + }, + { + "type": "equation", + "img_path": "images/320f0e25225397b8780814639c9dbf20b2aa71664c0d627b8c71741d221ac190.jpg", + "text": "$$\n\\begin{array} { r l } & { \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } } \\\\ { = } & { \\frac { 1 } { N ( t ) } \\displaystyle \\sum _ { i = 1 } ^ { N ( t ) } [ \\mathbb { I } ( A _ { i } = 1 ) \\widehat { \\Sigma } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } ^ { * } \\} - \\mathbb { I } ( A _ { i } = 0 ) \\widehat { \\Sigma } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\} ] } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 184, + 861, + 839, + 929 + ], + "page_idx": 31 + }, + { + "type": "text", + "text": "The above expression is asymptotically equivalent to ", + "bbox": [ + 173, + 103, + 522, + 119 + ], + "page_idx": 32 + }, + { + "type": "equation", + "img_path": "images/7be9828d8f1930eb8d95936fbb1a58b809648e88b97a4597dc0c45697b8f013e.jpg", + "text": "$$\n\\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } [ \\mathbb { I } ( A _ { i } = 1 ) \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } ^ { * } \\} - \\mathbb { I } ( A _ { i } = 0 ) \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } ^ { * } \\} ] .\n$$", + "text_format": "latex", + "bbox": [ + 171, + 125, + 797, + 170 + ], + "page_idx": 32 + }, + { + "type": "text", + "text": "By the law of iterated logarithm, the $\\ell$ -th dimension of the above expression can be upper bounded by ", + "bbox": [ + 173, + 175, + 825, + 205 + ], + "page_idx": 32 + }, + { + "type": "equation", + "img_path": "images/4f345e4d113717d4323a9b5eb14c21ed44fc574d0ab1281aaa4620a0248705c1.jpg", + "text": "$$\nN ^ { - 1 / 2 } ( t ) \\sqrt { 2 \\sigma _ { \\ell } ^ { 2 } \\log \\log \\{ N ( t ) \\} } ,\n$$", + "text_format": "latex", + "bbox": [ + 377, + 212, + 588, + 238 + ], + "page_idx": 32 + }, + { + "type": "text", + "text": "where $\\textstyle \\sum _ { \\ell } { \\widehat { \\sigma } } _ { \\ell } ^ { 2 }$ can be consistently estimated by ", + "bbox": [ + 173, + 244, + 480, + 262 + ], + "page_idx": 32 + }, + { + "type": "equation", + "img_path": "images/00f33e25aa2d94ac77a786b1cb1b44b00034b9e5ab291679ee697ed278c07605.jpg", + "text": "$$\n{ \\frac { 1 } { \\mathrm { V } ( t ) } } \\sum _ { i = 1 } ^ { N ( t ) } \\| \\mathbb { I } ( A _ { i } = 1 ) { \\widehat { \\Sigma } } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) { \\widehat { \\beta } } _ { 1 } ( t ) \\} - \\mathbb { I } ( A _ { i } = 0 ) { \\widehat { \\Sigma } } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) { \\widehat { \\beta } } _ { 0 } ( t ) \\} \\varphi ( X _ { i } ) \\| \\varphi ( X _ { i } ) \\| _ { L ^ { \\infty } ( L ^ { \\infty } ( H ) ) } ,\n$$", + "text_format": "latex", + "bbox": [ + 181, + 267, + 839, + 314 + ], + "page_idx": 32 + }, + { + "type": "text", + "text": "As such, the finite error bound is given by ", + "bbox": [ + 174, + 319, + 450, + 335 + ], + "page_idx": 32 + }, + { + "type": "equation", + "img_path": "images/5db848cc0d7fb62565b39d4e94d050a4488a84ecfbddd46547f20699c18adde7.jpg", + "text": "$$\n\\begin{array} { r l r } { \\displaystyle } & { } & { \\displaystyle \\operatorname* { s u p } _ { x \\in \\widetilde { \\mathbb { X } } } \\| \\varphi ( x ) \\| _ { 2 } \\frac { \\sqrt { 2 \\log \\log \\{ 1 \\} } } { \\sqrt { N ( t ) } } } \\\\ { \\displaystyle } & { } & { \\displaystyle \\sqrt { \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\| \\mathbb { I } ( A _ { i } = 1 ) \\widehat { \\Sigma } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { 1 } ( t ) \\} - \\mathbb { I } ( A _ { i } = 0 ) \\widehat { \\Sigma } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\} } } \\end{array}\n$$", + "text_format": "latex", + "bbox": [ + 181, + 338, + 839, + 431 + ], + "page_idx": 32 + }, + { + "type": "text", + "text": "G ADDITIONAL TABLES AND FIGURES ", + "text_level": 1, + "bbox": [ + 173, + 446, + 508, + 463 + ], + "page_idx": 32 + }, + { + "type": "table", + "img_path": "images/83b323dea972b5109fec273889ad3e87eb415945052b5a99367ae5e971167498.jpg", + "table_caption": [], + "table_footnote": [ + "Table 1: QTE: rejection probabilities (multiplied by 100) and average stopping times under Scenarios 1 and 2 when $\\alpha _ { 1 } ( \\cdot )$ is chosen as the spending function. Standard errors are reported in the parentheses. " + ], + "table_body": "
methodBATLIL
RandomAdaptiveRandomAdaptive
(n,K8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S10.000.105.0(1.1)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
17.2(1.9)3400(24)18.5(1.9)3409(23)0.0(0.0)3600(0)0.0(0.0)3600(0)
(200,5)0.150.200.250.3036.0(2.4)55.8(2.5)79.5(2.0)93.2(1.3)3184(32)35.5(2.4)3189(32)0.2(0.2)3599(0)0.0(0.0)3600(0)
2914(36)60.0(2.4)2908(36)0.5(0.4)3598(1)0.8(0.4)3595(3)
2545(35)81.5(1.9)2528(34)1.8(0.7)3590(4)2.8(0.8)3585(5)
2286(27)95.2(1.1)2280(26)7.2(1.3)3560(10)7.5(1.3)3549(11)
(20,50)0.000.100.150.200.250.305.2(1.1)17.2(1.9)3879(18)5.5(1.1)3882(18)0.0(0.0)3960(0)0.0(0.0)3960(0)
3716(29)24.0(2.1)3651(32)0.0(0.0)3960(0)0.0(0.0)3960(0)
39.5(2.4)61.8(2.4)84.0(1.8)95.8(1.0)3394(40)3021(44)41.2(2.5)61.0(2.4)3365(40)0.0(0.0)3960(0)0.2(0.2)3958(1)
3013(44)0.8(0.4)3949(6)0.2(0.2)3956(3)
2588(39)83.5(1.9)2579(39)4.8(1.1)3919(11)3.5(0.9)3936(8)
2281(28)95.5(1.0)2275(28)12.8(1.7)3847(18)14.5(1.8)3873(15)
S1(200,5)0.000.100.150.200.250.305.0(1.1)8.8(1.4)25.5(2.2)57.2(2.5)87.2(1.7)98.0(0.7)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
3511(17)3346(26)8.8(1.4)3515(16)0.0(0.0)3600(0)0.0(0.0)3600(0)
26.0(2.2)3337(27)0.0(0.0)3600(0)0.0(0.0)3600(0)
3004(34)2569(32)2224(21)60.2(2.4)88.2(1.6)3000(34)2581(32)0.0(0.0)3600(0)0.0(0.0)3600(0)
(32)2.0(0.7)3594(4)1.5(0.6)3589(5)3574(8)
97.8(0.7)2254(24)10.2(1.5)3559(9)6.2(1.2)
(20,50)0.000.100.150.200.250.305.2(1.1)8.2(1.4)28.0(2.2)64.8(2.4)92.2(1.3)99.2(0.4)3879(18)3839(21)5.5(1.1)7.0(1.3)3882(18)3852(21)0.0(0.0)3960(0)0.0(0.0)3960(0)3960(0)
0.0(0.0)3960(0)0.0(0.0)
3599(34)27.8(2.2)3627(33)0.0(0.0)3960(0)0.2(0.2)3956(3)
3165(41)62.0(2.4)3168(41)1.0(0.5)3951(5)0.8(0.4)3955(4)3936(8)3868(15)
2608(35)2238(23)90.2(1.5)99.2(0.4)2597(36)2250(24)5.0(1.1)14.5(1.8)3926(10)3854(16)2.8(0.8)13.8(1.7)
", + "bbox": [ + 173, + 479, + 928, + 827 + ], + "page_idx": 32 + }, + { + "type": "table", + "img_path": "images/f71405ecb538e1ab493cd56bce1417bdbb54d4029c9c183c707d773a8f3d875f.jpg", + "table_caption": [ + "Table 2: ATE: rejection probabilities (multiplied by 100) and average stopping times under Scenarios 1 and 2 when $\\alpha _ { 1 } ( \\cdot )$ is chosen as the spending function. Standard errors are reported in the parentheses. " + ], + "table_footnote": [], + "table_body": "
methodBATAVT
RandomAdaptiveRandomAdaptive
(n,K)8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S1(200,5)0.000.100.150.200.250.305.2(1.1)27.5(2.2)45.5(2.5)62.5(2.4)80.2(2.0)88.2(1.6)1763(8)6.2(1.2)1762(8)0.2(0.2)1800(0)51.2(2.5)1586(11)
1644(15)26.0(2.2)1647(14)6.8(1.3)1771(6)89.0(1.6)1344(9)
1511(17)1391(18)1263(17)1176(14)44.2(2.5)1527(17)19.0(2.0)1718(10)98.0(0.7)1250(6)
64.2(2.4)1383(18)42.8(2.5)1581(15)99.5(0.4)1196(6)
78.8(2.0)1266(17)72.8(2.2)1394(17)99.8(0.2)1145(5)1091(5)
88.8(1.6)1179(14)89.2(1.5)1216(14)100.0(0.0)
(20,50)0.000.100.150.200.250.305.8(1.2)27.5(2.2)45.5(2.5)67.0(2.4)83.8(1.8)92.0(1.4)1933(9)1771(18)1617(22)1446(22)1287(19)1182(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)
27.5(2.2)1771(18)8.0(1.4)1929(9)89.2(1.5)1276(13)
45.8(2.5)1630(21)25.2(2.2)1826(15)97.8(0.7)1166(7)
65.5(2.4)82.5(1.9)91.5(1.4)1459(22)53.8(2.5)1617(20)99.0(0.5)1105(6)
1288(19)79.0(2.0)1379(19)99.8(0.2)1061(4)1030(2)
1193(16)94.0(1.2)1187(15)100.0(0.0)
S2(200,5)0.000.100.150.200.250.305.2(1.1)18.2(1.9)29.0(2.3)40.5(2.5)50.5(2.5)62.5(2.4)1763(8)1692(12)6.2(1.2)16.8(1.9)1762(8)1699(12)0.2(0.2)1800(0)51.2(2.5)82.2(1.9)1586(11)1406(10)
3.0(0.9)1788(3)
1633(15)1559(17)1489(18)1407(18)25.2(2.2)1642(15)8.5(1.4)1762(7)91.8(1.4)1323(9)
42.0(2.5)49.8(2.5)62.5(2.4)1548(17)1492(18)1413(18)17.2(1.9)1724(10)97.8(0.7)1257(7)
33.0(2.4)53.5(2.5)1641(14)99.0(0.5)99.5(0.4)1218(6)1181(6)
62.5(2.4)1522(16)
(20,50)0.000.100.150.200.250.305.8(1.2)19.0(2.0)28.5(2.3)39.0(2.4)50.7(2.5)65.2(2.4)1933(9)1839(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)1360(15)
19.0(2.0)1837(16)3.5(0.9)1961(5)81.0(2.0)
1763(19)1680(21)28.0(2.2)1771(18)11.5(1.6)1911(10)90.8(1.4)1256(12)1171(8)1124(6)1092(5)
1680(21)41.8(2.5)1685(20)24.0(2.1)1830(15)97.5(0.8)
1592(22)1479(22)52.5(2.5)1568(22)44.2(2.5)1688(19)1539(20)99.0(0.5)99.2(0.4)
63.7(2.4)1481(22)63.5(2.4)
", + "bbox": [ + 173, + 167, + 936, + 511 + ], + "page_idx": 33 + }, + { + "type": "image", + "img_path": "images/3a71b11105d6bd40963e8e996977b72b9608eefdc9f17ccca0092181f0fe9212.jpg", + "image_caption": [ + "Figure 5: Alpha spending functions when $\\theta = 0 . 5 , \\gamma = 1 . 0$ . " + ], + "image_footnote": [], + "bbox": [ + 339, + 704, + 658, + 824 + ], + "page_idx": 33 + } +] \ No newline at end of file diff --git a/parse/train/yxafu6ZtUux/yxafu6ZtUux_middle.json b/parse/train/yxafu6ZtUux/yxafu6ZtUux_middle.json new file mode 100644 index 0000000000000000000000000000000000000000..aed18d807c8f1aebe737d61feab4a13e150037da --- /dev/null +++ b/parse/train/yxafu6ZtUux/yxafu6ZtUux_middle.json @@ -0,0 +1,98780 @@ +{ + "pdf_info": [ + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 108, + 78, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 104, + 75, + 506, + 101 + ], + "spans": [ + { + "bbox": [ + 104, + 75, + 506, + 101 + ], + "score": 1.0, + "content": "AN ONLINE SEQUENTIAL TEST FOR QUALITATIVE", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 99, + 270, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 99, + 270, + 117 + ], + "score": 1.0, + "content": "TREATMENT EFFECTS", + "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, + 212, + 468, + 354 + ], + "lines": [ + { + "bbox": [ + 141, + 212, + 469, + 225 + ], + "spans": [ + { + "bbox": [ + 141, + 212, + 469, + 225 + ], + "score": 1.0, + "content": "Tech companies (e.g., Google or Facebook) often use randomized online experi-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 223, + 470, + 236 + ], + "spans": [ + { + "bbox": [ + 141, + 223, + 470, + 236 + ], + "score": 1.0, + "content": "ments and/or A/B testing primarily based on the average treatment effects to com-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 234, + 470, + 246 + ], + "spans": [ + { + "bbox": [ + 141, + 234, + 470, + 246 + ], + "score": 1.0, + "content": "pare their new product with an old one. However, it is also critically important", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 245, + 469, + 257 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 469, + 257 + ], + "score": 1.0, + "content": "to detect qualitative treatment effects such that the new one may significantly out-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 255, + 470, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 470, + 268 + ], + "score": 1.0, + "content": "perform the existing one only under some specific circumstances. The aim of this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 267, + 470, + 278 + ], + "spans": [ + { + "bbox": [ + 141, + 267, + 470, + 278 + ], + "score": 1.0, + "content": "paper is to develop a powerful testing procedure to efficiently detect such qualita-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 278, + 469, + 289 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 469, + 289 + ], + "score": 1.0, + "content": "tive treatment effects. We propose a scalable online updating algorithm to imple-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 301 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 301 + ], + "score": 1.0, + "content": "ment our test procedure. It has three novelties including adaptive randomization,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 469, + 312 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 469, + 312 + ], + "score": 1.0, + "content": "sequential monitoring, and online updating with guaranteed type-I error control.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 310, + 469, + 322 + ], + "spans": [ + { + "bbox": [ + 142, + 310, + 469, + 322 + ], + "score": 1.0, + "content": "We also thoroughly examine the theoretical properties of our testing procedure", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 321, + 470, + 334 + ], + "spans": [ + { + "bbox": [ + 141, + 321, + 470, + 334 + ], + "score": 1.0, + "content": "including the limiting distribution of test statistics and the justification of an effi-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 333, + 469, + 344 + ], + "spans": [ + { + "bbox": [ + 142, + 333, + 469, + 344 + ], + "score": 1.0, + "content": "cient bootstrap method. Extensive empirical studies are conducted to examine the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 142, + 344, + 336, + 356 + ], + "spans": [ + { + "bbox": [ + 142, + 344, + 336, + 356 + ], + "score": 1.0, + "content": "finite sample performance of our test procedure.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 11 + }, + { + "type": "title", + "bbox": [ + 108, + 376, + 206, + 389 + ], + "lines": [ + { + "bbox": [ + 105, + 375, + 208, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 208, + 392 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 395, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "score": 1.0, + "content": "Tech companies use randomized online experiments, or A/B testing to compare their new product", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "with a well-established one. Most works in the literature focus on the average treatment effects", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 417, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 506, + 430 + ], + "score": 1.0, + "content": "(ATE) between the new and existing products (see Kharitonov et al., 2015; Johari et al., 2015; 2017;", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 428, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 506, + 442 + ], + "score": 1.0, + "content": "Yang et al., 2017; Ju et al., 2019, and the references therein). In addition to ATE, sometimes we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 441, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 505, + 452 + ], + "score": 1.0, + "content": "are interested in locating the subgroup (if exists) that the new product performs significantly better", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 449, + 506, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 449, + 506, + 464 + ], + "score": 1.0, + "content": "than the existing one, as early as possible. Consider a ride-hailing company (e.g., Uber). Suppose", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 462, + 506, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 506, + 474 + ], + "score": 1.0, + "content": "some passengers are in the recession state (at a high risk of stopping using the companys app) and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 472, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 506, + 485 + ], + "score": 1.0, + "content": "the company comes up with certain strategy to intervene the recession process. We would like to if", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 483, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 506, + 497 + ], + "score": 1.0, + "content": "there are some subgroups that are sensitive to the strategy and pin-point these subgroups if exists. It", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 493, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 505, + 508 + ], + "score": 1.0, + "content": "motivates us to consider the null hypothesis that the treatment effect is nonpositive for all passenger.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 107, + 511, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "score": 1.0, + "content": "Such a null hypothesis is closely related to the notion of qualitative treatment effects in medical", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 522, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 535 + ], + "score": 1.0, + "content": "studies (QTE, Gail & Simon, 1985; Roth & Simon, 2018; Shi et al., 2020a), and conditional moment", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "inequalities in economics (see for example, Andrews & Shi, 2013; 2014; Chernozhukov et al., 2013;", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 544, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 557 + ], + "score": 1.0, + "content": "Armstrong & Chan, 2016; Chang et al., 2015; Hsu, 2017). However, these tests are computed offline", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 568 + ], + "score": 1.0, + "content": "and might not be suitable to implement in online settings. Moreover, it is assumed in those papers", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 567, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 567, + 505, + 578 + ], + "score": 1.0, + "content": "that observations are independent. In online experiment, one may wish to adaptively allocate the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 578, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 505, + 589 + ], + "score": 1.0, + "content": "treatment based on the observed data stream in order to maximize the cumulative reward or to detect", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "the alternative more efficiently. The independence assumption is thus violated. In addition, an", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "online experiment is desired to be terminated as early as possible in order to save time and budget.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 610, + 401, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 401, + 622 + ], + "score": 1.0, + "content": "Sequential testing for qualitative treatment effects has been less explored.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 639 + ], + "score": 1.0, + "content": "In the literature, there is a line of research on estimation and inference of the heterogeneous treatment", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 638, + 504, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 504, + 650 + ], + "score": 1.0, + "content": "effects (HTE) (Athey & Imbens, 2016; Taddy et al., 2016; Wager & Athey, 2018; Yu et al., 2020).", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "In particular, Yu et al. (2020) proposed an online test for HTE. We remark that HTE and QTE are", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "score": 1.0, + "content": "related yet fundamentally different hypotheses. There are cases where HTE exists whereas QTE", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 669, + 498, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 498, + 685 + ], + "score": 1.0, + "content": "does not. See Figure 1 for an illustration. Consequently, applying their test will fail in our setting.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "The contributions of this paper are summarized as follows. First, we propose a new testing procedure", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "for treatment comparison based on the notion of QTE. When the null hypothesis is not rejected,", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "the new product is no better than the control for any realization of covariates, and thus it is not", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "useful at all. Otherwise, the company could implement different products according to the auxiliary", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45.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": [ + 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, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 104, + 75, + 506, + 101 + ], + "spans": [ + { + "bbox": [ + 104, + 75, + 506, + 101 + ], + "score": 1.0, + "content": "AN ONLINE SEQUENTIAL TEST FOR QUALITATIVE", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 99, + 270, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 99, + 270, + 117 + ], + "score": 1.0, + "content": "TREATMENT EFFECTS", + "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, + 212, + 468, + 354 + ], + "lines": [ + { + "bbox": [ + 141, + 212, + 469, + 225 + ], + "spans": [ + { + "bbox": [ + 141, + 212, + 469, + 225 + ], + "score": 1.0, + "content": "Tech companies (e.g., Google or Facebook) often use randomized online experi-", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 141, + 223, + 470, + 236 + ], + "spans": [ + { + "bbox": [ + 141, + 223, + 470, + 236 + ], + "score": 1.0, + "content": "ments and/or A/B testing primarily based on the average treatment effects to com-", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 141, + 234, + 470, + 246 + ], + "spans": [ + { + "bbox": [ + 141, + 234, + 470, + 246 + ], + "score": 1.0, + "content": "pare their new product with an old one. However, it is also critically important", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 141, + 245, + 469, + 257 + ], + "spans": [ + { + "bbox": [ + 141, + 245, + 469, + 257 + ], + "score": 1.0, + "content": "to detect qualitative treatment effects such that the new one may significantly out-", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 141, + 255, + 470, + 268 + ], + "spans": [ + { + "bbox": [ + 141, + 255, + 470, + 268 + ], + "score": 1.0, + "content": "perform the existing one only under some specific circumstances. The aim of this", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 141, + 267, + 470, + 278 + ], + "spans": [ + { + "bbox": [ + 141, + 267, + 470, + 278 + ], + "score": 1.0, + "content": "paper is to develop a powerful testing procedure to efficiently detect such qualita-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 141, + 278, + 469, + 289 + ], + "spans": [ + { + "bbox": [ + 141, + 278, + 469, + 289 + ], + "score": 1.0, + "content": "tive treatment effects. We propose a scalable online updating algorithm to imple-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 141, + 289, + 470, + 301 + ], + "spans": [ + { + "bbox": [ + 141, + 289, + 470, + 301 + ], + "score": 1.0, + "content": "ment our test procedure. It has three novelties including adaptive randomization,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 141, + 300, + 469, + 312 + ], + "spans": [ + { + "bbox": [ + 141, + 300, + 469, + 312 + ], + "score": 1.0, + "content": "sequential monitoring, and online updating with guaranteed type-I error control.", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 142, + 310, + 469, + 322 + ], + "spans": [ + { + "bbox": [ + 142, + 310, + 469, + 322 + ], + "score": 1.0, + "content": "We also thoroughly examine the theoretical properties of our testing procedure", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 141, + 321, + 470, + 334 + ], + "spans": [ + { + "bbox": [ + 141, + 321, + 470, + 334 + ], + "score": 1.0, + "content": "including the limiting distribution of test statistics and the justification of an effi-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 142, + 333, + 469, + 344 + ], + "spans": [ + { + "bbox": [ + 142, + 333, + 469, + 344 + ], + "score": 1.0, + "content": "cient bootstrap method. Extensive empirical studies are conducted to examine the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 142, + 344, + 336, + 356 + ], + "spans": [ + { + "bbox": [ + 142, + 344, + 336, + 356 + ], + "score": 1.0, + "content": "finite sample performance of our test procedure.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 11, + "bbox_fs": [ + 141, + 212, + 470, + 356 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 376, + 206, + 389 + ], + "lines": [ + { + "bbox": [ + 105, + 375, + 208, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 375, + 208, + 392 + ], + "score": 1.0, + "content": "1 INTRODUCTION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 395, + 505, + 506 + ], + "lines": [ + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "spans": [ + { + "bbox": [ + 105, + 395, + 506, + 408 + ], + "score": 1.0, + "content": "Tech companies use randomized online experiments, or A/B testing to compare their new product", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 406, + 505, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 505, + 419 + ], + "score": 1.0, + "content": "with a well-established one. Most works in the literature focus on the average treatment effects", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 417, + 506, + 430 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 506, + 430 + ], + "score": 1.0, + "content": "(ATE) between the new and existing products (see Kharitonov et al., 2015; Johari et al., 2015; 2017;", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 428, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 506, + 442 + ], + "score": 1.0, + "content": "Yang et al., 2017; Ju et al., 2019, and the references therein). In addition to ATE, sometimes we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 441, + 505, + 452 + ], + "spans": [ + { + "bbox": [ + 105, + 441, + 505, + 452 + ], + "score": 1.0, + "content": "are interested in locating the subgroup (if exists) that the new product performs significantly better", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 449, + 506, + 464 + ], + "spans": [ + { + "bbox": [ + 105, + 449, + 506, + 464 + ], + "score": 1.0, + "content": "than the existing one, as early as possible. Consider a ride-hailing company (e.g., Uber). Suppose", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 462, + 506, + 474 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 506, + 474 + ], + "score": 1.0, + "content": "some passengers are in the recession state (at a high risk of stopping using the companys app) and", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 472, + 506, + 485 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 506, + 485 + ], + "score": 1.0, + "content": "the company comes up with certain strategy to intervene the recession process. We would like to if", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 483, + 506, + 497 + ], + "spans": [ + { + "bbox": [ + 105, + 483, + 506, + 497 + ], + "score": 1.0, + "content": "there are some subgroups that are sensitive to the strategy and pin-point these subgroups if exists. It", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 493, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 505, + 508 + ], + "score": 1.0, + "content": "motivates us to consider the null hypothesis that the treatment effect is nonpositive for all passenger.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 395, + 506, + 508 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 511, + 505, + 621 + ], + "lines": [ + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "spans": [ + { + "bbox": [ + 105, + 511, + 505, + 523 + ], + "score": 1.0, + "content": "Such a null hypothesis is closely related to the notion of qualitative treatment effects in medical", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 522, + 506, + 535 + ], + "spans": [ + { + "bbox": [ + 105, + 522, + 506, + 535 + ], + "score": 1.0, + "content": "studies (QTE, Gail & Simon, 1985; Roth & Simon, 2018; Shi et al., 2020a), and conditional moment", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 505, + 546 + ], + "score": 1.0, + "content": "inequalities in economics (see for example, Andrews & Shi, 2013; 2014; Chernozhukov et al., 2013;", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 544, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 557 + ], + "score": 1.0, + "content": "Armstrong & Chan, 2016; Chang et al., 2015; Hsu, 2017). However, these tests are computed offline", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 555, + 506, + 568 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 506, + 568 + ], + "score": 1.0, + "content": "and might not be suitable to implement in online settings. Moreover, it is assumed in those papers", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 567, + 505, + 578 + ], + "spans": [ + { + "bbox": [ + 106, + 567, + 505, + 578 + ], + "score": 1.0, + "content": "that observations are independent. In online experiment, one may wish to adaptively allocate the", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 578, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 578, + 505, + 589 + ], + "score": 1.0, + "content": "treatment based on the observed data stream in order to maximize the cumulative reward or to detect", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 588, + 505, + 600 + ], + "score": 1.0, + "content": "the alternative more efficiently. The independence assumption is thus violated. In addition, an", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 599, + 505, + 612 + ], + "score": 1.0, + "content": "online experiment is desired to be terminated as early as possible in order to save time and budget.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 610, + 401, + 622 + ], + "spans": [ + { + "bbox": [ + 106, + 610, + 401, + 622 + ], + "score": 1.0, + "content": "Sequential testing for qualitative treatment effects has been less explored.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 511, + 506, + 622 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 504, + 682 + ], + "lines": [ + { + "bbox": [ + 105, + 626, + 505, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 626, + 505, + 639 + ], + "score": 1.0, + "content": "In the literature, there is a line of research on estimation and inference of the heterogeneous treatment", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 106, + 638, + 504, + 650 + ], + "spans": [ + { + "bbox": [ + 106, + 638, + 504, + 650 + ], + "score": 1.0, + "content": "effects (HTE) (Athey & Imbens, 2016; Taddy et al., 2016; Wager & Athey, 2018; Yu et al., 2020).", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "spans": [ + { + "bbox": [ + 105, + 648, + 506, + 662 + ], + "score": 1.0, + "content": "In particular, Yu et al. (2020) proposed an online test for HTE. We remark that HTE and QTE are", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "spans": [ + { + "bbox": [ + 105, + 660, + 506, + 673 + ], + "score": 1.0, + "content": "related yet fundamentally different hypotheses. There are cases where HTE exists whereas QTE", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 669, + 498, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 498, + 685 + ], + "score": 1.0, + "content": "does not. See Figure 1 for an illustration. Consequently, applying their test will fail in our setting.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 41, + "bbox_fs": [ + 105, + 626, + 506, + 685 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 687, + 504, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 687, + 505, + 700 + ], + "score": 1.0, + "content": "The contributions of this paper are summarized as follows. First, we propose a new testing procedure", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 106, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "for treatment comparison based on the notion of QTE. When the null hypothesis is not rejected,", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 506, + 722 + ], + "score": 1.0, + "content": "the new product is no better than the control for any realization of covariates, and thus it is not", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 505, + 734 + ], + "score": 1.0, + "content": "useful at all. Otherwise, the company could implement different products according to the auxiliary", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 240, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 253 + ], + "score": 1.0, + "content": "covariates observed, to maximize the average reward obtained. We remark that there are plenty cases", + "type": "text", + "cross_page": true + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 252, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 505, + 264 + ], + "score": 1.0, + "content": "where the treatment effects are always nonpositive (see Section 5 of Chang et al., 2015; Shi et al.,", + "type": "text", + "cross_page": true + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 261, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 506, + 277 + ], + "score": 1.0, + "content": "2020a). A by-product of our test is that it yields a decision rule to implement personalization when", + "type": "text", + "cross_page": true + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 272, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 506, + 288 + ], + "score": 1.0, + "content": "the null is rejected (see Section 3.1 for details). Although we primarily focus on QTE in this paper,", + "type": "text", + "cross_page": true + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 285, + 465, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 465, + 298 + ], + "score": 1.0, + "content": "our procedure can be easily extended to testing ATE as well (see Appendix D for details).", + "type": "text", + "cross_page": true + } + ], + "index": 13 + } + ], + "index": 45.5, + "bbox_fs": [ + 105, + 687, + 506, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 176, + 93, + 426, + 163 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 176, + 93, + 426, + 163 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 176, + 93, + 426, + 163 + ], + "spans": [ + { + "bbox": [ + 176, + 93, + 426, + 163 + ], + "score": 0.964, + "type": "image", + "image_path": "bdfa07c6e548c34b414e3b216be9e7ed4ed71107e91e13b03ab1e2e9975a4e3b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 176, + 93, + 426, + 116.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 176, + 116.33333333333333, + 426, + 139.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 176, + 139.66666666666666, + 426, + 163.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 169, + 506, + 230 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 170, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 241, + 181 + ], + "score": 1.0, + "content": "Figure 1: Plots demonstrating QTE.", + "type": "text" + }, + { + "bbox": [ + 241, + 170, + 251, + 179 + ], + "score": 0.76, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 170, + 369, + 181 + ], + "score": 1.0, + "content": "denotes the observed covariates,", + "type": "text" + }, + { + "bbox": [ + 370, + 170, + 378, + 179 + ], + "score": 0.62, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 170, + 505, + 181 + ], + "score": 1.0, + "content": "denotes the received treatment and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 179, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 107, + 180, + 115, + 189 + ], + "score": 0.7, + "content": "Y", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 179, + 325, + 191 + ], + "score": 1.0, + "content": "denotes the associated reward. In the ride-hailing example,", + "type": "text" + }, + { + "bbox": [ + 325, + 180, + 335, + 189 + ], + "score": 0.81, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 179, + 505, + 191 + ], + "score": 1.0, + "content": "is a feature vector describing the characteristics", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 190, + 506, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 163, + 202 + ], + "score": 1.0, + "content": "of a passenger,", + "type": "text" + }, + { + "bbox": [ + 163, + 190, + 171, + 199 + ], + "score": 0.67, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 190, + 293, + 202 + ], + "score": 1.0, + "content": "is a binary strategy indicator and", + "type": "text" + }, + { + "bbox": [ + 293, + 190, + 302, + 199 + ], + "score": 0.73, + "content": "Y", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 190, + 506, + 202 + ], + "score": 1.0, + "content": "is the passenger’s number of rides in the following two", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 199, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 340, + 211 + ], + "score": 1.0, + "content": "weeks. In the left panel, the treatment effect does not depend on", + "type": "text" + }, + { + "bbox": [ + 340, + 200, + 350, + 209 + ], + "score": 0.76, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 199, + 505, + 211 + ], + "score": 1.0, + "content": ". Neither HTE nor QTE exists in this case.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 210, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 505, + 221 + ], + "score": 1.0, + "content": "In the middle panel, HTE exists. However, the treatment effect is always negative. As such, QTE does not", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 220, + 288, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 288, + 231 + ], + "score": 1.0, + "content": "exist. In the right penal, both QTE and HTE exist.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 107, + 240, + 505, + 296 + ], + "lines": [ + { + "bbox": [ + 105, + 240, + 505, + 253 + ], + "spans": [ + { + "bbox": [ + 105, + 240, + 505, + 253 + ], + "score": 1.0, + "content": "covariates observed, to maximize the average reward obtained. We remark that there are plenty cases", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 252, + 505, + 264 + ], + "spans": [ + { + "bbox": [ + 106, + 252, + 505, + 264 + ], + "score": 1.0, + "content": "where the treatment effects are always nonpositive (see Section 5 of Chang et al., 2015; Shi et al.,", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 261, + 506, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 261, + 506, + 277 + ], + "score": 1.0, + "content": "2020a). A by-product of our test is that it yields a decision rule to implement personalization when", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 272, + 506, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 272, + 506, + 288 + ], + "score": 1.0, + "content": "the null is rejected (see Section 3.1 for details). Although we primarily focus on QTE in this paper,", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 285, + 465, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 285, + 465, + 298 + ], + "score": 1.0, + "content": "our procedure can be easily extended to testing ATE as well (see Appendix D for details).", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 107, + 301, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 106, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "Second, we propose a scalable online updating algorithm to implement our test. To allow for se-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 313, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 348, + 325 + ], + "score": 1.0, + "content": "quential monitoring, our procedure leverages idea from the", + "type": "text" + }, + { + "bbox": [ + 348, + 315, + 357, + 322 + ], + "score": 0.75, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 313, + 506, + 325 + ], + "score": 1.0, + "content": "spending function approach (Lan &", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "score": 1.0, + "content": "DeMets, 1983) originally designed for sequential analysis in a clinical trial (see Jennison & Turnbull,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 335, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 505, + 347 + ], + "score": 1.0, + "content": "1999, for an overview). Classical sequential tests focus on ATE. The test statistic at each interim", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 345, + 506, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 506, + 358 + ], + "score": 1.0, + "content": "stage is asymptotically normal and the stopping boundary can be recursively updated via numerical", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "score": 1.0, + "content": "integration. However, the limiting distribution of the proposed test statistic does not have a tractable", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "analytical form, making the numerical integration method difficult to apply. To resolve this issue,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 378, + 459, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 459, + 392 + ], + "score": 1.0, + "content": "we propose a scalable bootstrap-assisted procedure to determine the stopping boundary.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5 + }, + { + "type": "text", + "bbox": [ + 106, + 395, + 505, + 494 + ], + "lines": [ + { + "bbox": [ + 106, + 396, + 504, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 493, + 407 + ], + "score": 1.0, + "content": "Third, we adopt a theoretical framework that allows the maximum number of interim analyses", + "type": "text" + }, + { + "bbox": [ + 493, + 396, + 504, + 406 + ], + "score": 0.75, + "content": "K", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 406, + 505, + 418 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 505, + 418 + ], + "score": 1.0, + "content": "to diverge as the number of observations increases, since tech companies might analyze the results", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 417, + 506, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 506, + 431 + ], + "score": 1.0, + "content": "every few minutes (or hours) to determine whether to stop the experiment or continue collecting", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 428, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 414, + 441 + ], + "score": 1.0, + "content": "more data. It is ultimately different from classical sequential analysis where", + "type": "text" + }, + { + "bbox": [ + 414, + 429, + 425, + 438 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 428, + 506, + 441 + ], + "score": 1.0, + "content": "is fixed. Moreover,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 439, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 506, + 452 + ], + "score": 1.0, + "content": "the derivation of the asymptotic property of the proposed test is further complicated due to the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 451, + 504, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 504, + 462 + ], + "score": 1.0, + "content": "adaptive randomization procedure, which makes observations dependent of each other. Despite", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 462, + 504, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 504, + 474 + ], + "score": 1.0, + "content": "these technical challenges, we establish a nonasymptotic upper bound on the type-I error rate by", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 472, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 416, + 484 + ], + "score": 1.0, + "content": "explicitly characterizing the conditions needed on randomization procedure,", + "type": "text" + }, + { + "bbox": [ + 416, + 473, + 427, + 482 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 472, + 506, + 484 + ], + "score": 1.0, + "content": "and the number of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 483, + 419, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 419, + 495 + ], + "score": 1.0, + "content": "samples observed at the initial decision point to ensure the validity of our test.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26 + }, + { + "type": "title", + "bbox": [ + 107, + 511, + 356, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 357, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 357, + 525 + ], + "score": 1.0, + "content": "2 BACKGROUND AND PROBLEM FORMULATION", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 528, + 505, + 656 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "We propose a potential outcome framework (Rubin, 2005) to formulate our problem. Suppose that", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 539, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 553 + ], + "score": 1.0, + "content": "we have two products including the control and the treatment. The observed data at time point", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 546, + 509, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 112, + 564 + ], + "score": 0.63, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 112, + 546, + 252, + 574 + ], + "score": 1.0, + "content": "consists of a sequence of triples", + "type": "text" + }, + { + "bbox": [ + 252, + 551, + 327, + 566 + ], + "score": 0.92, + "content": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { N ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 546, + 361, + 574 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 362, + 553, + 383, + 566 + ], + "score": 0.9, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 546, + 509, + 574 + ], + "score": 1.0, + "content": "is a counting process that is", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 563, + 507, + 582 + ], + "spans": [ + { + "bbox": [ + 104, + 563, + 237, + 582 + ], + "score": 1.0, + "content": "independent of the data stream", + "type": "text" + }, + { + "bbox": [ + 238, + 567, + 310, + 578 + ], + "score": 0.92, + "content": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 563, + 315, + 582 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 316, + 567, + 328, + 577 + ], + "score": 0.83, + "content": "A _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 563, + 507, + 582 + ], + "score": 1.0, + "content": "is a binary random variable indicating the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 206, + 590 + ], + "score": 1.0, + "content": "product executed for the", + "type": "text" + }, + { + "bbox": [ + 207, + 578, + 211, + 587 + ], + "score": 0.73, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 577, + 273, + 590 + ], + "score": 1.0, + "content": "-th experiment,", + "type": "text" + }, + { + "bbox": [ + 273, + 578, + 311, + 588 + ], + "score": 0.88, + "content": "X _ { i } \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 577, + 465, + 590 + ], + "score": 1.0, + "content": "denotes the associated covariates, and", + "type": "text" + }, + { + "bbox": [ + 466, + 577, + 476, + 588 + ], + "score": 0.86, + "content": "Y _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "stands", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 391, + 600 + ], + "score": 1.0, + "content": "for the associated reward (the larger the better by convention). We allow", + "type": "text" + }, + { + "bbox": [ + 392, + 588, + 403, + 599 + ], + "score": 0.88, + "content": "A _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 587, + 456, + 600 + ], + "score": 1.0, + "content": "to depend on", + "type": "text" + }, + { + "bbox": [ + 457, + 588, + 469, + 599 + ], + "score": 0.89, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 587, + 506, + 600 + ], + "score": 1.0, + "content": "and past", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 597, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 159, + 613 + ], + "score": 1.0, + "content": "observations", + "type": "text" + }, + { + "bbox": [ + 160, + 599, + 235, + 611 + ], + "score": 0.91, + "content": "\\{ ( X _ { j } , A _ { j } , Y _ { j } ) \\} _ { j < i }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 597, + 506, + 613 + ], + "score": 1.0, + "content": "so that the randomization procedure can be adaptively changed. In", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 101, + 608, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 101, + 615, + 276, + 646 + ], + "score": 1.0, + "content": "corresponding product is executed for the are independently and identically distribut", + "type": "text" + }, + { + "bbox": [ + 105, + 608, + 171, + 624 + ], + "score": 1.0, + "content": "addition, define", + "type": "text" + }, + { + "bbox": [ + 172, + 611, + 198, + 622 + ], + "score": 0.9, + "content": "Y _ { i } ^ { * } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 608, + 216, + 624 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 216, + 611, + 243, + 622 + ], + "score": 0.91, + "content": "Y _ { i } ^ { * } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 608, + 506, + 624 + ], + "score": 1.0, + "content": "to be the potential outcome that would have been observed if the", + "type": "text" + }, + { + "bbox": [ + 276, + 623, + 281, + 632 + ], + "score": 0.71, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 615, + 327, + 646 + ], + "score": 1.0, + "content": "-th experimd copies of", + "type": "text" + }, + { + "bbox": [ + 400, + 621, + 504, + 635 + ], + "score": 0.92, + "content": "\\{ ( X _ { i } , Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 ) ) \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 327, + 633, + 434, + 645 + ], + "spans": [ + { + "bbox": [ + 327, + 633, + 403, + 645 + ], + "score": 0.91, + "content": "( X , Y ^ { * } \\bar { ( 0 ) } , Y ^ { * } ( 1 ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 634, + 434, + 643 + ], + "score": 0.75, + "content": "\\mathbb { X }", + "type": "inline_equation" + } + ], + "index": 40 + }, + { + "bbox": [ + 107, + 643, + 496, + 657 + ], + "spans": [ + { + "bbox": [ + 107, + 644, + 117, + 654 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 643, + 135, + 657 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 135, + 644, + 258, + 657 + ], + "score": 0.92, + "content": "\\bar { Q } _ { 0 } ( x , a ) \\stackrel { \\cdot } { = } \\mathrm { E } \\{ Y ^ { * } ( a ) | X \\stackrel { \\cdot } { = } x \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 643, + 272, + 657 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 273, + 645, + 307, + 656 + ], + "score": 0.92, + "content": "a = 0 , 1", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 643, + 496, + 657 + ], + "score": 1.0, + "content": ", we focus on testing the following hypotheses:", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 36.5 + }, + { + "type": "interline_equation", + "bbox": [ + 134, + 659, + 456, + 673 + ], + "lines": [ + { + "bbox": [ + 134, + 659, + 456, + 673 + ], + "spans": [ + { + "bbox": [ + 134, + 659, + 456, + 673 + ], + "score": 0.82, + "content": "H _ { 0 } : Q _ { 0 } ( x , 1 ) \\leq Q _ { 0 } ( x , 0 ) , \\forall x \\in \\mathbb { X } { \\mathrm { ~ ~ v e r s u s ~ } } H _ { 1 } : Q _ { 0 } ( x , 1 ) > Q _ { 0 } ( x , 0 ) , \\exists x \\in \\mathbb { X } .", + "type": "interline_equation", + "image_path": "65b1ea09972c584098db202cc61cab852b995c7068655f826f4de3b201480845.jpg" + } + ] + } + ], + "index": 42, + "virtual_lines": [ + { + "bbox": [ + 134, + 659, + 456, + 673 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 675, + 504, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 293, + 690 + ], + "score": 1.0, + "content": "Notice that when there are no covariates, i.e.,", + "type": "text" + }, + { + "bbox": [ + 293, + 677, + 322, + 687 + ], + "score": 0.9, + "content": "\\mathbb { X } = \\emptyset", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 675, + 450, + 690 + ], + "score": 1.0, + "content": ", the hypotheses are reduced to", + "type": "text" + }, + { + "bbox": [ + 450, + 677, + 504, + 688 + ], + "score": 0.9, + "content": "H _ { 0 } : \\tau _ { 0 } \\leq 0", + "type": "inline_equation" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 686, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 135, + 701 + ], + "score": 1.0, + "content": "versus", + "type": "text" + }, + { + "bbox": [ + 135, + 688, + 188, + 699 + ], + "score": 0.92, + "content": "H _ { 1 } : \\tau _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 686, + 220, + 701 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 220, + 690, + 230, + 699 + ], + "score": 0.85, + "content": "\\tau _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 686, + 333, + 701 + ], + "score": 1.0, + "content": "corresponds to ATE, i.e,", + "type": "text" + }, + { + "bbox": [ + 334, + 687, + 438, + 700 + ], + "score": 0.92, + "content": "\\tau _ { 0 } \\stackrel { } { = } \\mathrm { E } \\{ Y ^ { \\ast } ( 1 ) - Y ^ { \\ast } ( 0 ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 686, + 506, + 701 + ], + "score": 1.0, + "content": ". In general, we", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 137, + 711 + ], + "score": 1.0, + "content": "require", + "type": "text" + }, + { + "bbox": [ + 137, + 699, + 146, + 709 + ], + "score": 0.71, + "content": "\\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 699, + 419, + 711 + ], + "score": 1.0, + "content": "to be a compact set. We consider a large linear approximation space", + "type": "text" + }, + { + "bbox": [ + 419, + 700, + 428, + 709 + ], + "score": 0.8, + "content": "\\mathcal { Q }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "for the conditional", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 168, + 722 + ], + "score": 1.0, + "content": "mean function", + "type": "text" + }, + { + "bbox": [ + 169, + 710, + 182, + 721 + ], + "score": 0.89, + "content": "Q _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 709, + 257, + 722 + ], + "score": 1.0, + "content": ". Specifically, let", + "type": "text" + }, + { + "bbox": [ + 257, + 709, + 475, + 722 + ], + "score": 0.87, + "content": "\\mathcal { Q } = \\{ Q \\in \\langle x , a ; \\beta _ { 0 } , \\hat { \\beta _ { 1 } } \\rangle = \\varphi ^ { \\top } ( x ) \\hat { \\beta _ { a } } : \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { q } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "be the", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 221, + 733 + ], + "score": 1.0, + "content": "approximation space, where", + "type": "text" + }, + { + "bbox": [ + 221, + 721, + 242, + 732 + ], + "score": 0.92, + "content": "\\varphi ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 720, + 259, + 733 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 260, + 723, + 266, + 732 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 720, + 474, + 733 + ], + "score": 1.0, + "content": "-dimensional vector composed of basis functions on", + "type": "text" + }, + { + "bbox": [ + 474, + 721, + 483, + 730 + ], + "score": 0.69, + "content": "\\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 720, + 505, + 733 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 45 + } + ], + "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": "image", + "bbox": [ + 176, + 93, + 426, + 163 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 176, + 93, + 426, + 163 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 176, + 93, + 426, + 163 + ], + "spans": [ + { + "bbox": [ + 176, + 93, + 426, + 163 + ], + "score": 0.964, + "type": "image", + "image_path": "bdfa07c6e548c34b414e3b216be9e7ed4ed71107e91e13b03ab1e2e9975a4e3b.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 176, + 93, + 426, + 116.33333333333333 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 176, + 116.33333333333333, + 426, + 139.66666666666666 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 176, + 139.66666666666666, + 426, + 163.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 169, + 506, + 230 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 170, + 505, + 181 + ], + "spans": [ + { + "bbox": [ + 106, + 170, + 241, + 181 + ], + "score": 1.0, + "content": "Figure 1: Plots demonstrating QTE.", + "type": "text" + }, + { + "bbox": [ + 241, + 170, + 251, + 179 + ], + "score": 0.76, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 170, + 369, + 181 + ], + "score": 1.0, + "content": "denotes the observed covariates,", + "type": "text" + }, + { + "bbox": [ + 370, + 170, + 378, + 179 + ], + "score": 0.62, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 170, + 505, + 181 + ], + "score": 1.0, + "content": "denotes the received treatment and", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 179, + 505, + 191 + ], + "spans": [ + { + "bbox": [ + 107, + 180, + 115, + 189 + ], + "score": 0.7, + "content": "Y", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 179, + 325, + 191 + ], + "score": 1.0, + "content": "denotes the associated reward. In the ride-hailing example,", + "type": "text" + }, + { + "bbox": [ + 325, + 180, + 335, + 189 + ], + "score": 0.81, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 179, + 505, + 191 + ], + "score": 1.0, + "content": "is a feature vector describing the characteristics", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 190, + 506, + 202 + ], + "spans": [ + { + "bbox": [ + 105, + 190, + 163, + 202 + ], + "score": 1.0, + "content": "of a passenger,", + "type": "text" + }, + { + "bbox": [ + 163, + 190, + 171, + 199 + ], + "score": 0.67, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 190, + 293, + 202 + ], + "score": 1.0, + "content": "is a binary strategy indicator and", + "type": "text" + }, + { + "bbox": [ + 293, + 190, + 302, + 199 + ], + "score": 0.73, + "content": "Y", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 190, + 506, + 202 + ], + "score": 1.0, + "content": "is the passenger’s number of rides in the following two", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 199, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 199, + 340, + 211 + ], + "score": 1.0, + "content": "weeks. In the left panel, the treatment effect does not depend on", + "type": "text" + }, + { + "bbox": [ + 340, + 200, + 350, + 209 + ], + "score": 0.76, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 199, + 505, + 211 + ], + "score": 1.0, + "content": ". Neither HTE nor QTE exists in this case.", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 210, + 505, + 221 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 505, + 221 + ], + "score": 1.0, + "content": "In the middle panel, HTE exists. However, the treatment effect is always negative. As such, QTE does not", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 220, + 288, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 220, + 288, + 231 + ], + "score": 1.0, + "content": "exist. In the right penal, both QTE and HTE exist.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + } + ], + "index": 3.25 + }, + { + "type": "text", + "bbox": [ + 107, + 240, + 505, + 296 + ], + "lines": [], + "index": 11, + "bbox_fs": [ + 105, + 240, + 506, + 298 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 107, + 301, + 505, + 390 + ], + "lines": [ + { + "bbox": [ + 106, + 302, + 505, + 314 + ], + "spans": [ + { + "bbox": [ + 106, + 302, + 505, + 314 + ], + "score": 1.0, + "content": "Second, we propose a scalable online updating algorithm to implement our test. To allow for se-", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 105, + 313, + 506, + 325 + ], + "spans": [ + { + "bbox": [ + 105, + 313, + 348, + 325 + ], + "score": 1.0, + "content": "quential monitoring, our procedure leverages idea from the", + "type": "text" + }, + { + "bbox": [ + 348, + 315, + 357, + 322 + ], + "score": 0.75, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 313, + 506, + 325 + ], + "score": 1.0, + "content": "spending function approach (Lan &", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "spans": [ + { + "bbox": [ + 105, + 324, + 505, + 336 + ], + "score": 1.0, + "content": "DeMets, 1983) originally designed for sequential analysis in a clinical trial (see Jennison & Turnbull,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 335, + 505, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 335, + 505, + 347 + ], + "score": 1.0, + "content": "1999, for an overview). Classical sequential tests focus on ATE. The test statistic at each interim", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 345, + 506, + 358 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 506, + 358 + ], + "score": 1.0, + "content": "stage is asymptotically normal and the stopping boundary can be recursively updated via numerical", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 356, + 506, + 369 + ], + "score": 1.0, + "content": "integration. However, the limiting distribution of the proposed test statistic does not have a tractable", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 506, + 380 + ], + "score": 1.0, + "content": "analytical form, making the numerical integration method difficult to apply. To resolve this issue,", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 378, + 459, + 392 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 459, + 392 + ], + "score": 1.0, + "content": "we propose a scalable bootstrap-assisted procedure to determine the stopping boundary.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 302, + 506, + 392 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 395, + 505, + 494 + ], + "lines": [ + { + "bbox": [ + 106, + 396, + 504, + 407 + ], + "spans": [ + { + "bbox": [ + 106, + 396, + 493, + 407 + ], + "score": 1.0, + "content": "Third, we adopt a theoretical framework that allows the maximum number of interim analyses", + "type": "text" + }, + { + "bbox": [ + 493, + 396, + 504, + 406 + ], + "score": 0.75, + "content": "K", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 406, + 505, + 418 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 505, + 418 + ], + "score": 1.0, + "content": "to diverge as the number of observations increases, since tech companies might analyze the results", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 417, + 506, + 431 + ], + "spans": [ + { + "bbox": [ + 105, + 417, + 506, + 431 + ], + "score": 1.0, + "content": "every few minutes (or hours) to determine whether to stop the experiment or continue collecting", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 428, + 506, + 441 + ], + "spans": [ + { + "bbox": [ + 105, + 428, + 414, + 441 + ], + "score": 1.0, + "content": "more data. It is ultimately different from classical sequential analysis where", + "type": "text" + }, + { + "bbox": [ + 414, + 429, + 425, + 438 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 428, + 506, + 441 + ], + "score": 1.0, + "content": "is fixed. Moreover,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 439, + 506, + 452 + ], + "spans": [ + { + "bbox": [ + 106, + 439, + 506, + 452 + ], + "score": 1.0, + "content": "the derivation of the asymptotic property of the proposed test is further complicated due to the", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 451, + 504, + 462 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 504, + 462 + ], + "score": 1.0, + "content": "adaptive randomization procedure, which makes observations dependent of each other. Despite", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 462, + 504, + 474 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 504, + 474 + ], + "score": 1.0, + "content": "these technical challenges, we establish a nonasymptotic upper bound on the type-I error rate by", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 472, + 506, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 416, + 484 + ], + "score": 1.0, + "content": "explicitly characterizing the conditions needed on randomization procedure,", + "type": "text" + }, + { + "bbox": [ + 416, + 473, + 427, + 482 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 472, + 506, + 484 + ], + "score": 1.0, + "content": "and the number of", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 483, + 419, + 495 + ], + "spans": [ + { + "bbox": [ + 106, + 483, + 419, + 495 + ], + "score": 1.0, + "content": "samples observed at the initial decision point to ensure the validity of our test.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 396, + 506, + 495 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 511, + 356, + 523 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 357, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 357, + 525 + ], + "score": 1.0, + "content": "2 BACKGROUND AND PROBLEM FORMULATION", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 106, + 528, + 505, + 656 + ], + "lines": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "spans": [ + { + "bbox": [ + 106, + 529, + 505, + 541 + ], + "score": 1.0, + "content": "We propose a potential outcome framework (Rubin, 2005) to formulate our problem. Suppose that", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 539, + 505, + 553 + ], + "spans": [ + { + "bbox": [ + 105, + 539, + 505, + 553 + ], + "score": 1.0, + "content": "we have two products including the control and the treatment. The observed data at time point", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 106, + 546, + 509, + 574 + ], + "spans": [ + { + "bbox": [ + 106, + 555, + 112, + 564 + ], + "score": 0.63, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 112, + 546, + 252, + 574 + ], + "score": 1.0, + "content": "consists of a sequence of triples", + "type": "text" + }, + { + "bbox": [ + 252, + 551, + 327, + 566 + ], + "score": 0.92, + "content": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { N ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 546, + 361, + 574 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 362, + 553, + 383, + 566 + ], + "score": 0.9, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 383, + 546, + 509, + 574 + ], + "score": 1.0, + "content": "is a counting process that is", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 563, + 507, + 582 + ], + "spans": [ + { + "bbox": [ + 104, + 563, + 237, + 582 + ], + "score": 1.0, + "content": "independent of the data stream", + "type": "text" + }, + { + "bbox": [ + 238, + 567, + 310, + 578 + ], + "score": 0.92, + "content": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 563, + 315, + 582 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 316, + 567, + 328, + 577 + ], + "score": 0.83, + "content": "A _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 328, + 563, + 507, + 582 + ], + "score": 1.0, + "content": "is a binary random variable indicating the", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 577, + 505, + 590 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 206, + 590 + ], + "score": 1.0, + "content": "product executed for the", + "type": "text" + }, + { + "bbox": [ + 207, + 578, + 211, + 587 + ], + "score": 0.73, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 577, + 273, + 590 + ], + "score": 1.0, + "content": "-th experiment,", + "type": "text" + }, + { + "bbox": [ + 273, + 578, + 311, + 588 + ], + "score": 0.88, + "content": "X _ { i } \\in \\mathbb { R } ^ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 577, + 465, + 590 + ], + "score": 1.0, + "content": "denotes the associated covariates, and", + "type": "text" + }, + { + "bbox": [ + 466, + 577, + 476, + 588 + ], + "score": 0.86, + "content": "Y _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 577, + 505, + 590 + ], + "score": 1.0, + "content": "stands", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 587, + 506, + 600 + ], + "spans": [ + { + "bbox": [ + 105, + 587, + 391, + 600 + ], + "score": 1.0, + "content": "for the associated reward (the larger the better by convention). We allow", + "type": "text" + }, + { + "bbox": [ + 392, + 588, + 403, + 599 + ], + "score": 0.88, + "content": "A _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 403, + 587, + 456, + 600 + ], + "score": 1.0, + "content": "to depend on", + "type": "text" + }, + { + "bbox": [ + 457, + 588, + 469, + 599 + ], + "score": 0.89, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 469, + 587, + 506, + 600 + ], + "score": 1.0, + "content": "and past", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 597, + 506, + 613 + ], + "spans": [ + { + "bbox": [ + 105, + 597, + 159, + 613 + ], + "score": 1.0, + "content": "observations", + "type": "text" + }, + { + "bbox": [ + 160, + 599, + 235, + 611 + ], + "score": 0.91, + "content": "\\{ ( X _ { j } , A _ { j } , Y _ { j } ) \\} _ { j < i }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 597, + 506, + 613 + ], + "score": 1.0, + "content": "so that the randomization procedure can be adaptively changed. In", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 101, + 608, + 506, + 646 + ], + "spans": [ + { + "bbox": [ + 101, + 615, + 276, + 646 + ], + "score": 1.0, + "content": "corresponding product is executed for the are independently and identically distribut", + "type": "text" + }, + { + "bbox": [ + 105, + 608, + 171, + 624 + ], + "score": 1.0, + "content": "addition, define", + "type": "text" + }, + { + "bbox": [ + 172, + 611, + 198, + 622 + ], + "score": 0.9, + "content": "Y _ { i } ^ { * } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 608, + 216, + 624 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 216, + 611, + 243, + 622 + ], + "score": 0.91, + "content": "Y _ { i } ^ { * } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 608, + 506, + 624 + ], + "score": 1.0, + "content": "to be the potential outcome that would have been observed if the", + "type": "text" + }, + { + "bbox": [ + 276, + 623, + 281, + 632 + ], + "score": 0.71, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 615, + 327, + 646 + ], + "score": 1.0, + "content": "-th experimd copies of", + "type": "text" + }, + { + "bbox": [ + 400, + 621, + 504, + 635 + ], + "score": 0.92, + "content": "\\{ ( X _ { i } , Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 ) ) \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + } + ], + "index": 39 + }, + { + "bbox": [ + 327, + 633, + 434, + 645 + ], + "spans": [ + { + "bbox": [ + 327, + 633, + 403, + 645 + ], + "score": 0.91, + "content": "( X , Y ^ { * } \\bar { ( 0 ) } , Y ^ { * } ( 1 ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 634, + 434, + 643 + ], + "score": 0.75, + "content": "\\mathbb { X }", + "type": "inline_equation" + } + ], + "index": 40 + }, + { + "bbox": [ + 107, + 643, + 496, + 657 + ], + "spans": [ + { + "bbox": [ + 107, + 644, + 117, + 654 + ], + "score": 0.83, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 643, + 135, + 657 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 135, + 644, + 258, + 657 + ], + "score": 0.92, + "content": "\\bar { Q } _ { 0 } ( x , a ) \\stackrel { \\cdot } { = } \\mathrm { E } \\{ Y ^ { * } ( a ) | X \\stackrel { \\cdot } { = } x \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 643, + 272, + 657 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 273, + 645, + 307, + 656 + ], + "score": 0.92, + "content": "a = 0 , 1", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 643, + 496, + 657 + ], + "score": 1.0, + "content": ", we focus on testing the following hypotheses:", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 36.5, + "bbox_fs": [ + 101, + 529, + 509, + 657 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 134, + 659, + 456, + 673 + ], + "lines": [ + { + "bbox": [ + 134, + 659, + 456, + 673 + ], + "spans": [ + { + "bbox": [ + 134, + 659, + 456, + 673 + ], + "score": 0.82, + "content": "H _ { 0 } : Q _ { 0 } ( x , 1 ) \\leq Q _ { 0 } ( x , 0 ) , \\forall x \\in \\mathbb { X } { \\mathrm { ~ ~ v e r s u s ~ } } H _ { 1 } : Q _ { 0 } ( x , 1 ) > Q _ { 0 } ( x , 0 ) , \\exists x \\in \\mathbb { X } .", + "type": "interline_equation", + "image_path": "65b1ea09972c584098db202cc61cab852b995c7068655f826f4de3b201480845.jpg" + } + ] + } + ], + "index": 42, + "virtual_lines": [ + { + "bbox": [ + 134, + 659, + 456, + 673 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 676, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 675, + 504, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 293, + 690 + ], + "score": 1.0, + "content": "Notice that when there are no covariates, i.e.,", + "type": "text" + }, + { + "bbox": [ + 293, + 677, + 322, + 687 + ], + "score": 0.9, + "content": "\\mathbb { X } = \\emptyset", + "type": "inline_equation" + }, + { + "bbox": [ + 323, + 675, + 450, + 690 + ], + "score": 1.0, + "content": ", the hypotheses are reduced to", + "type": "text" + }, + { + "bbox": [ + 450, + 677, + 504, + 688 + ], + "score": 0.9, + "content": "H _ { 0 } : \\tau _ { 0 } \\leq 0", + "type": "inline_equation" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 686, + 506, + 701 + ], + "spans": [ + { + "bbox": [ + 105, + 686, + 135, + 701 + ], + "score": 1.0, + "content": "versus", + "type": "text" + }, + { + "bbox": [ + 135, + 688, + 188, + 699 + ], + "score": 0.92, + "content": "H _ { 1 } : \\tau _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 686, + 220, + 701 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 220, + 690, + 230, + 699 + ], + "score": 0.85, + "content": "\\tau _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 686, + 333, + 701 + ], + "score": 1.0, + "content": "corresponds to ATE, i.e,", + "type": "text" + }, + { + "bbox": [ + 334, + 687, + 438, + 700 + ], + "score": 0.92, + "content": "\\tau _ { 0 } \\stackrel { } { = } \\mathrm { E } \\{ Y ^ { \\ast } ( 1 ) - Y ^ { \\ast } ( 0 ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 439, + 686, + 506, + 701 + ], + "score": 1.0, + "content": ". In general, we", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 699, + 505, + 711 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 137, + 711 + ], + "score": 1.0, + "content": "require", + "type": "text" + }, + { + "bbox": [ + 137, + 699, + 146, + 709 + ], + "score": 0.71, + "content": "\\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 699, + 419, + 711 + ], + "score": 1.0, + "content": "to be a compact set. We consider a large linear approximation space", + "type": "text" + }, + { + "bbox": [ + 419, + 700, + 428, + 709 + ], + "score": 0.8, + "content": "\\mathcal { Q }", + "type": "inline_equation" + }, + { + "bbox": [ + 429, + 699, + 505, + 711 + ], + "score": 1.0, + "content": "for the conditional", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 709, + 168, + 722 + ], + "score": 1.0, + "content": "mean function", + "type": "text" + }, + { + "bbox": [ + 169, + 710, + 182, + 721 + ], + "score": 0.89, + "content": "Q _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 709, + 257, + 722 + ], + "score": 1.0, + "content": ". Specifically, let", + "type": "text" + }, + { + "bbox": [ + 257, + 709, + 475, + 722 + ], + "score": 0.87, + "content": "\\mathcal { Q } = \\{ Q \\in \\langle x , a ; \\beta _ { 0 } , \\hat { \\beta _ { 1 } } \\rangle = \\varphi ^ { \\top } ( x ) \\hat { \\beta _ { a } } : \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { q } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 475, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "be the", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 720, + 505, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 221, + 733 + ], + "score": 1.0, + "content": "approximation space, where", + "type": "text" + }, + { + "bbox": [ + 221, + 721, + 242, + 732 + ], + "score": 0.92, + "content": "\\varphi ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 720, + 259, + 733 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 260, + 723, + 266, + 732 + ], + "score": 0.8, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 720, + 474, + 733 + ], + "score": 1.0, + "content": "-dimensional vector composed of basis functions on", + "type": "text" + }, + { + "bbox": [ + 474, + 721, + 483, + 730 + ], + "score": 0.69, + "content": "\\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 720, + 505, + 733 + ], + "score": 1.0, + "content": ". The", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 151, + 95 + ], + "score": 1.0, + "content": "dimension", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 151, + 85, + 157, + 94 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 158, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "is allowed to diverge with the number of observations in order to alleviate the effects", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "of model misspecification. The use of linear approximation space simplifies the computation of our", + "type": "text", + "cross_page": true + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 379, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 207, + 117 + ], + "score": 1.0, + "content": "testing procedure. When", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 207, + 105, + 221, + 116 + ], + "score": 0.9, + "content": "Q _ { 0 }", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 221, + 105, + 379, + 117 + ], + "score": 1.0, + "content": "is well approximated, it suffices to test", + "type": "text", + "cross_page": true + } + ], + "index": 2 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 675, + 506, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 505, + 116 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 151, + 95 + ], + "score": 1.0, + "content": "dimension", + "type": "text" + }, + { + "bbox": [ + 151, + 85, + 157, + 94 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "is allowed to diverge with the number of observations in order to alleviate the effects", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "of model misspecification. The use of linear approximation space simplifies the computation of our", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 105, + 379, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 105, + 207, + 117 + ], + "score": 1.0, + "content": "testing procedure. When", + "type": "text" + }, + { + "bbox": [ + 207, + 105, + 221, + 116 + ], + "score": 0.9, + "content": "Q _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 105, + 379, + 117 + ], + "score": 1.0, + "content": "is well approximated, it suffices to test", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "interline_equation", + "bbox": [ + 131, + 119, + 461, + 135 + ], + "lines": [ + { + "bbox": [ + 131, + 119, + 461, + 135 + ], + "spans": [ + { + "bbox": [ + 131, + 119, + 461, + 135 + ], + "score": 0.86, + "content": "H _ { 0 } : \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) \\leq 0 , \\forall x \\in \\mathbb { X } \\mathrm { ~ \\mathrm { ~ v e r s u s ~ } ~ } H _ { 1 } : \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) > 0 , \\exists x \\in \\mathbb { X } .", + "type": "interline_equation", + "image_path": "2eac75b3ac71122b17af5136f098f288e74104c140466fc3e530f0ac07d59408.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 131, + 119, + 461, + 135 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 138, + 505, + 163 + ], + "lines": [ + { + "bbox": [ + 105, + 136, + 505, + 152 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 218, + 152 + ], + "score": 1.0, + "content": "For clarity, here we assume", + "type": "text" + }, + { + "bbox": [ + 218, + 138, + 329, + 150 + ], + "score": 0.89, + "content": "Q _ { 0 } ( x , a ) = Q ( x , a ; \\beta _ { 0 } ^ { * } , \\beta _ { 1 } ^ { * } )", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 136, + 367, + 152 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 368, + 138, + 380, + 150 + ], + "score": 0.86, + "content": "\\beta _ { 0 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 136, + 398, + 152 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 398, + 138, + 409, + 150 + ], + "score": 0.86, + "content": "\\beta _ { 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 136, + 505, + 152 + ], + "score": 1.0, + "content": ". In Appendix B, we al-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 146, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 219, + 164 + ], + "score": 1.0, + "content": "low the approximation error", + "type": "text" + }, + { + "bbox": [ + 219, + 150, + 444, + 163 + ], + "score": 0.77, + "content": "\\begin{array} { r } { \\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 146, + 505, + 164 + ], + "score": 1.0, + "content": "to be nonzero.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 107, + 167, + 503, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 505, + 182 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 122, + 182 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 168, + 135, + 180 + ], + "score": 0.88, + "content": "{ \\mathcal { F } } _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 165, + 229, + 182 + ], + "score": 1.0, + "content": "denote the sub-dataset", + "type": "text" + }, + { + "bbox": [ + 230, + 167, + 312, + 180 + ], + "score": 0.92, + "content": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { 1 \\leq i \\leq j }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 165, + 328, + 182 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 328, + 168, + 354, + 180 + ], + "score": 0.9, + "content": "j \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 165, + 372, + 182 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 373, + 168, + 406, + 179 + ], + "score": 0.94, + "content": "\\mathcal { F } _ { 0 } = \\emptyset", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 165, + 505, + 182 + ], + "score": 1.0, + "content": ". Throughout this paper,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 178, + 317, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 317, + 191 + ], + "score": 1.0, + "content": "we assume that the following two assumptions hold.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 106, + 198, + 497, + 223 + ], + "lines": [ + { + "bbox": [ + 105, + 197, + 309, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 127, + 212 + ], + "score": 1.0, + "content": "(A1)", + "type": "text" + }, + { + "bbox": [ + 128, + 198, + 261, + 210 + ], + "score": 0.91, + "content": "Y _ { i } = A _ { i } Y _ { i } ^ { * } ( 1 ) + ( 1 - A _ { i } ) Y _ { i } ^ { * } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 197, + 275, + 212 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 276, + 199, + 304, + 209 + ], + "score": 0.87, + "content": "\\forall i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 197, + 309, + 212 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 208, + 495, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 127, + 224 + ], + "score": 1.0, + "content": "(A2)", + "type": "text" + }, + { + "bbox": [ + 128, + 210, + 140, + 221 + ], + "score": 0.86, + "content": "A _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 208, + 212, + 224 + ], + "score": 1.0, + "content": "is independent of", + "type": "text" + }, + { + "bbox": [ + 212, + 210, + 268, + 222 + ], + "score": 0.76, + "content": "Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 208, + 273, + 224 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 273, + 209, + 378, + 222 + ], + "score": 0.84, + "content": "\\{ ( X _ { k } , Y _ { k } ^ { * } ( 0 ) , Y _ { k } ^ { * } ( 1 ) ) \\} _ { k > i }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 208, + 403, + 224 + ], + "score": 1.0, + "content": "given", + "type": "text" + }, + { + "bbox": [ + 403, + 210, + 416, + 221 + ], + "score": 0.88, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 208, + 434, + 224 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 434, + 210, + 456, + 221 + ], + "score": 0.94, + "content": "\\mathcal { F } _ { i - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 208, + 491, + 224 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 491, + 211, + 495, + 219 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 226, + 505, + 293 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 504, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 504, + 238 + ], + "score": 1.0, + "content": "Assumption (A1) is referred to be the stable unit treatment value assumption (Rubin, 1974) and As-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "sumption (A2) is the sequential randomization assumption (Zhang et al., 2013) and is automatically", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 248, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 505, + 261 + ], + "score": 1.0, + "content": "satisfied in a randomized study where the treatments are independently generated of the observed", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "score": 1.0, + "content": "data. (A2) essentially assumes there is no unmeasured confounders. These assumptions guaran-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "score": 1.0, + "content": "tee that both regression coefficients (defined through potential outcomes) are estimable from the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 281, + 312, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 281, + 312, + 293 + ], + "score": 1.0, + "content": "observed dataset as shown in the following lemma.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12.5 + }, + { + "type": "text", + "bbox": [ + 106, + 301, + 415, + 313 + ], + "lines": [ + { + "bbox": [ + 106, + 300, + 415, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 167, + 315 + ], + "score": 1.0, + "content": "Lemma 1 Let", + "type": "text" + }, + { + "bbox": [ + 167, + 301, + 182, + 313 + ], + "score": 0.81, + "content": "\\mathbb { I } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 300, + 415, + 315 + ], + "score": 1.0, + "content": "denotes the indicator function. Under (A1)-(A2), we have", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 316, + 413, + 332 + ], + "lines": [ + { + "bbox": [ + 177, + 316, + 413, + 332 + ], + "spans": [ + { + "bbox": [ + 177, + 316, + 413, + 332 + ], + "score": 0.89, + "content": "E [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ^ { * } \\} ] = 0 , \\forall a \\in \\{ 0 , 1 \\} , i \\geq 1 .", + "type": "interline_equation", + "image_path": "2b778884f309f595ba78613746895bc356b05eb2645e9fd3f1cfd5fc58f2b850.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 177, + 316, + 413, + 332 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 346, + 335, + 360 + ], + "lines": [ + { + "bbox": [ + 104, + 344, + 335, + 362 + ], + "spans": [ + { + "bbox": [ + 104, + 344, + 335, + 362 + ], + "score": 1.0, + "content": "3 ONLINE SEQUENTIAL TESTING FOR QTE", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "title", + "bbox": [ + 106, + 371, + 361, + 383 + ], + "lines": [ + { + "bbox": [ + 105, + 371, + 362, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 362, + 383 + ], + "score": 1.0, + "content": "3.1 TEST STATISTICS AND THEIR LIMITING DISTRIBUTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 391, + 504, + 414 + ], + "lines": [ + { + "bbox": [ + 105, + 389, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 282, + 405 + ], + "score": 1.0, + "content": "We first present our test statistic for testing", + "type": "text" + }, + { + "bbox": [ + 282, + 392, + 296, + 403 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 389, + 439, + 405 + ], + "score": 1.0, + "content": ". In view of Lemma 1, we estimate", + "type": "text" + }, + { + "bbox": [ + 440, + 392, + 451, + 403 + ], + "score": 0.89, + "content": "\\beta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 389, + 505, + 405 + ], + "score": 1.0, + "content": "by using the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 403, + 235, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 235, + 415 + ], + "score": 1.0, + "content": "ordinary least squares estimator", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 417, + 394, + 457 + ], + "lines": [ + { + "bbox": [ + 189, + 417, + 394, + 457 + ], + "spans": [ + { + "bbox": [ + 189, + 417, + 394, + 457 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a } ( t ) = { \\widehat \\Sigma } _ { a } ^ { - 1 } ( t ) \\left\\{ \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\right\\}", + "type": "interline_equation", + "image_path": "0d2ead2b29bf363e5280bcabe1998b93a0bff663ab850d7dd23fb3fe59b8ce32.jpg" + } + ] + } + ], + "index": 22.5, + "virtual_lines": [ + { + "bbox": [ + 189, + 417, + 394, + 437.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 189, + 437.0, + 394, + 457.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 461, + 506, + 539 + ], + "lines": [ + { + "bbox": [ + 101, + 456, + 510, + 482 + ], + "spans": [ + { + "bbox": [ + 101, + 456, + 183, + 482 + ], + "score": 1.0, + "content": "at each time point", + "type": "text" + }, + { + "bbox": [ + 183, + 465, + 189, + 474 + ], + "score": 0.75, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 456, + 205, + 482 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 205, + 463, + 251, + 476 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 456, + 283, + 482 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 284, + 461, + 489, + 477 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\widehat { \\Sigma } _ { a } ( t ) = N ^ { - 1 } ( t ) \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 456, + 510, + 482 + ], + "score": 1.0, + "content": ". A", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 475, + 506, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 271, + 490 + ], + "score": 1.0, + "content": "generalized inverse might be used even if", + "type": "text" + }, + { + "bbox": [ + 271, + 475, + 295, + 489 + ], + "score": 0.93, + "content": "\\widehat { \\Sigma } _ { a } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 476, + 506, + 490 + ], + "score": 1.0, + "content": "is not invertible. Consider the following test statistic", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 488, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 263, + 503 + ], + "score": 0.92, + "content": "\\begin{array} { r } { S ( t ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ \\widehat \\beta _ { 1 } ( t ) - \\widehat \\beta _ { 0 } ( t ) \\} } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 489, + 294, + 504 + ], + "score": 1.0, + "content": ". Under", + "type": "text" + }, + { + "bbox": [ + 295, + 491, + 308, + 502 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 489, + 354, + 504 + ], + "score": 1.0, + "content": ", we expect", + "type": "text" + }, + { + "bbox": [ + 355, + 491, + 374, + 502 + ], + "score": 0.91, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 489, + 456, + 504 + ], + "score": 1.0, + "content": "to be small. A large", + "type": "text" + }, + { + "bbox": [ + 456, + 490, + 475, + 503 + ], + "score": 0.92, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 489, + 506, + 504 + ], + "score": 1.0, + "content": "can be", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 501, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 246, + 515 + ], + "score": 1.0, + "content": "interpreted as the evidence against", + "type": "text" + }, + { + "bbox": [ + 247, + 503, + 260, + 513 + ], + "score": 0.87, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 501, + 341, + 515 + ], + "score": 1.0, + "content": ". As such, we reject", + "type": "text" + }, + { + "bbox": [ + 341, + 502, + 355, + 513 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 501, + 393, + 515 + ], + "score": 1.0, + "content": "for large", + "type": "text" + }, + { + "bbox": [ + 393, + 502, + 412, + 514 + ], + "score": 0.9, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 501, + 506, + 515 + ], + "score": 1.0, + "content": ". We remark that when", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 513, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 515, + 120, + 527 + ], + "score": 0.87, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 513, + 291, + 529 + ], + "score": 1.0, + "content": "is rejected, we can apply the decision rule", + "type": "text" + }, + { + "bbox": [ + 291, + 514, + 437, + 529 + ], + "score": 0.89, + "content": "d ( x ) = \\arg \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\varphi ^ { \\top } ( x ) \\widehat { \\beta } _ { a } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 513, + 506, + 529 + ], + "score": 1.0, + "content": "for personalized", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 527, + 178, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 178, + 538 + ], + "score": 1.0, + "content": "recommendation.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5 + }, + { + "type": "text", + "bbox": [ + 104, + 543, + 486, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 542, + 486, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 416, + 558 + ], + "score": 1.0, + "content": "To determine the rejection region, we next discuss the limiting distribution of", + "type": "text" + }, + { + "bbox": [ + 417, + 544, + 435, + 556 + ], + "score": 0.91, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 542, + 468, + 558 + ], + "score": 1.0, + "content": ". Under", + "type": "text" + }, + { + "bbox": [ + 468, + 545, + 481, + 555 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 542, + 486, + 558 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 559, + 438, + 607 + ], + "lines": [ + { + "bbox": [ + 153, + 559, + 438, + 607 + ], + "spans": [ + { + "bbox": [ + 153, + 559, + 438, + 607 + ], + "score": 0.93, + "content": "\\begin{array} { r } { S ( t ) \\le \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} + \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) } \\\\ { \\le \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} . } \\end{array}", + "type": "interline_equation", + "image_path": "a6e33106058f086e77ae4d70e8c25c62851033e2d3188a96c0c0fc314947bf82.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 153, + 559, + 438, + 575.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 153, + 575.0, + 438, + 591.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 153, + 591.0, + 438, + 607.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 609, + 507, + 672 + ], + "lines": [ + { + "bbox": [ + 105, + 609, + 506, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 221, + 624 + ], + "score": 1.0, + "content": "Both equalities hold when", + "type": "text" + }, + { + "bbox": [ + 221, + 610, + 263, + 623 + ], + "score": 0.94, + "content": "\\beta _ { 0 } ^ { * } ~ = ~ \\beta _ { 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 609, + 426, + 624 + ], + "score": 1.0, + "content": ". Suppose there exists some function", + "type": "text" + }, + { + "bbox": [ + 426, + 610, + 456, + 622 + ], + "score": 0.92, + "content": "\\pi ^ { * } ( \\cdot , \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 609, + 506, + 624 + ], + "score": 1.0, + "content": "defined on", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 107, + 619, + 509, + 642 + ], + "spans": [ + { + "bbox": [ + 107, + 624, + 154, + 637 + ], + "score": 0.92, + "content": "\\{ 0 , 1 \\} \\times \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 619, + 209, + 642 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + }, + { + "bbox": [ + 209, + 622, + 451, + 637 + ], + "score": 0.9, + "content": "\\begin{array} { r } { { \\mathrm { E } } ^ { X } | \\sum _ { i = 1 } ^ { n } n ^ { - 1 } \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) | \\ \\stackrel { P } { \\to } \\ 0 , \\forall a \\ \\in \\ \\{ 0 , 1 \\} } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 619, + 464, + 642 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 465, + 627, + 501, + 636 + ], + "score": 0.85, + "content": "n \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 619, + 509, + 642 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 134, + 651 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 638, + 299, + 650 + ], + "score": 0.9, + "content": "\\pi _ { n } ( \\cdot , \\cdot ) = \\operatorname* { P r } ( A _ { n } = a | X _ { n } = x , { \\mathcal { F } } _ { n - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 637, + 388, + 651 + ], + "score": 1.0, + "content": ", and the expectation", + "type": "text" + }, + { + "bbox": [ + 389, + 637, + 404, + 648 + ], + "score": 0.87, + "content": "\\operatorname { E } ^ { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "is taken with respect to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 648, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 117, + 659 + ], + "score": 0.82, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 648, + 505, + 661 + ], + "score": 1.0, + "content": ". This condition implies that the treatment assignment mechanism cannot be arbitrary (see the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 659, + 351, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 351, + 672 + ], + "score": 1.0, + "content": "discussion below Theorem 1 for details). Then we will show", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 675, + 478, + 704 + ], + "lines": [ + { + "bbox": [ + 111, + 675, + 478, + 704 + ], + "spans": [ + { + "bbox": [ + 111, + 675, + 478, + 704 + ], + "score": 0.92, + "content": "B ( t ) \\equiv \\sqrt { N ( t ) } \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} \\stackrel { d } { } N ( 0 , \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } ) , \\mathrm { a s } N ( t ) \\infty ,", + "type": "interline_equation", + "image_path": "afe6664799fa6668b3e113e66c2da44fdcbb85d62599f3ae96841f82705ca3a8.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 111, + 675, + 478, + 684.6666666666666 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 111, + 684.6666666666666, + 478, + 694.3333333333333 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 111, + 694.3333333333333, + 478, + 703.9999999999999 + ], + "spans": [], + "index": 41 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 708, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 134, + 722 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 709, + 262, + 721 + ], + "score": 0.81, + "content": "\\Sigma _ { a } = \\mathrm { E } \\pi ^ { * } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 708, + 267, + 722 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 267, + 708, + 432, + 722 + ], + "score": 0.9, + "content": "\\Phi _ { a } = \\mathrm { E } \\pi ^ { * } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X )", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 708, + 456, + 722 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 456, + 709, + 505, + 722 + ], + "score": 0.9, + "content": "\\sigma ^ { 2 } ( a , x ) =", + "type": "inline_equation" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 718, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 246, + 733 + ], + "score": 0.88, + "content": "\\operatorname { E } [ \\{ Y ^ { * } ( a ) - \\varphi ^ { \\top } ( X ) \\beta _ { a } \\} ^ { 2 } | X = x ]", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 718, + 284, + 734 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 285, + 721, + 314, + 731 + ], + "score": 0.87, + "content": "x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 718, + 506, + 734 + ], + "score": 1.0, + "content": ". According to equation 3, the right-hand-side", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + } + ], + "page_idx": 2, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 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, + 505, + 116 + ], + "lines": [], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 117 + ], + "lines_deleted": true + }, + { + "type": "interline_equation", + "bbox": [ + 131, + 119, + 461, + 135 + ], + "lines": [ + { + "bbox": [ + 131, + 119, + 461, + 135 + ], + "spans": [ + { + "bbox": [ + 131, + 119, + 461, + 135 + ], + "score": 0.86, + "content": "H _ { 0 } : \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) \\leq 0 , \\forall x \\in \\mathbb { X } \\mathrm { ~ \\mathrm { ~ v e r s u s ~ } ~ } H _ { 1 } : \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) > 0 , \\exists x \\in \\mathbb { X } .", + "type": "interline_equation", + "image_path": "2eac75b3ac71122b17af5136f098f288e74104c140466fc3e530f0ac07d59408.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 131, + 119, + 461, + 135 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 138, + 505, + 163 + ], + "lines": [ + { + "bbox": [ + 105, + 136, + 505, + 152 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 218, + 152 + ], + "score": 1.0, + "content": "For clarity, here we assume", + "type": "text" + }, + { + "bbox": [ + 218, + 138, + 329, + 150 + ], + "score": 0.89, + "content": "Q _ { 0 } ( x , a ) = Q ( x , a ; \\beta _ { 0 } ^ { * } , \\beta _ { 1 } ^ { * } )", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 136, + 367, + 152 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 368, + 138, + 380, + 150 + ], + "score": 0.86, + "content": "\\beta _ { 0 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 380, + 136, + 398, + 152 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 398, + 138, + 409, + 150 + ], + "score": 0.86, + "content": "\\beta _ { 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 410, + 136, + 505, + 152 + ], + "score": 1.0, + "content": ". In Appendix B, we al-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 146, + 505, + 164 + ], + "spans": [ + { + "bbox": [ + 105, + 146, + 219, + 164 + ], + "score": 1.0, + "content": "low the approximation error", + "type": "text" + }, + { + "bbox": [ + 219, + 150, + 444, + 163 + ], + "score": 0.77, + "content": "\\begin{array} { r } { \\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 146, + 505, + 164 + ], + "score": 1.0, + "content": "to be nonzero.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 136, + 505, + 164 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 167, + 503, + 191 + ], + "lines": [ + { + "bbox": [ + 105, + 165, + 505, + 182 + ], + "spans": [ + { + "bbox": [ + 105, + 165, + 122, + 182 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 168, + 135, + 180 + ], + "score": 0.88, + "content": "{ \\mathcal { F } } _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 136, + 165, + 229, + 182 + ], + "score": 1.0, + "content": "denote the sub-dataset", + "type": "text" + }, + { + "bbox": [ + 230, + 167, + 312, + 180 + ], + "score": 0.92, + "content": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { 1 \\leq i \\leq j }", + "type": "inline_equation" + }, + { + "bbox": [ + 312, + 165, + 328, + 182 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 328, + 168, + 354, + 180 + ], + "score": 0.9, + "content": "j \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 165, + 372, + 182 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 373, + 168, + 406, + 179 + ], + "score": 0.94, + "content": "\\mathcal { F } _ { 0 } = \\emptyset", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 165, + 505, + 182 + ], + "score": 1.0, + "content": ". Throughout this paper,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 178, + 317, + 191 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 317, + 191 + ], + "score": 1.0, + "content": "we assume that the following two assumptions hold.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 105, + 165, + 505, + 191 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 198, + 497, + 223 + ], + "lines": [ + { + "bbox": [ + 105, + 197, + 309, + 212 + ], + "spans": [ + { + "bbox": [ + 105, + 197, + 127, + 212 + ], + "score": 1.0, + "content": "(A1)", + "type": "text" + }, + { + "bbox": [ + 128, + 198, + 261, + 210 + ], + "score": 0.91, + "content": "Y _ { i } = A _ { i } Y _ { i } ^ { * } ( 1 ) + ( 1 - A _ { i } ) Y _ { i } ^ { * } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 197, + 275, + 212 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 276, + 199, + 304, + 209 + ], + "score": 0.87, + "content": "\\forall i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 197, + 309, + 212 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 208, + 495, + 224 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 127, + 224 + ], + "score": 1.0, + "content": "(A2)", + "type": "text" + }, + { + "bbox": [ + 128, + 210, + 140, + 221 + ], + "score": 0.86, + "content": "A _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 208, + 212, + 224 + ], + "score": 1.0, + "content": "is independent of", + "type": "text" + }, + { + "bbox": [ + 212, + 210, + 268, + 222 + ], + "score": 0.76, + "content": "Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 208, + 273, + 224 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 273, + 209, + 378, + 222 + ], + "score": 0.84, + "content": "\\{ ( X _ { k } , Y _ { k } ^ { * } ( 0 ) , Y _ { k } ^ { * } ( 1 ) ) \\} _ { k > i }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 208, + 403, + 224 + ], + "score": 1.0, + "content": "given", + "type": "text" + }, + { + "bbox": [ + 403, + 210, + 416, + 221 + ], + "score": 0.88, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 416, + 208, + 434, + 224 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 434, + 210, + 456, + 221 + ], + "score": 0.94, + "content": "\\mathcal { F } _ { i - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 208, + 491, + 224 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 491, + 211, + 495, + 219 + ], + "score": 0.67, + "content": "i", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 197, + 495, + 224 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 226, + 505, + 293 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 504, + 238 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 504, + 238 + ], + "score": 1.0, + "content": "Assumption (A1) is referred to be the stable unit treatment value assumption (Rubin, 1974) and As-", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "spans": [ + { + "bbox": [ + 105, + 237, + 505, + 250 + ], + "score": 1.0, + "content": "sumption (A2) is the sequential randomization assumption (Zhang et al., 2013) and is automatically", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 248, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 505, + 261 + ], + "score": 1.0, + "content": "satisfied in a randomized study where the treatments are independently generated of the observed", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 505, + 272 + ], + "score": 1.0, + "content": "data. (A2) essentially assumes there is no unmeasured confounders. These assumptions guaran-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 506, + 283 + ], + "score": 1.0, + "content": "tee that both regression coefficients (defined through potential outcomes) are estimable from the", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 281, + 312, + 293 + ], + "spans": [ + { + "bbox": [ + 106, + 281, + 312, + 293 + ], + "score": 1.0, + "content": "observed dataset as shown in the following lemma.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 12.5, + "bbox_fs": [ + 105, + 227, + 506, + 293 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 301, + 415, + 313 + ], + "lines": [ + { + "bbox": [ + 106, + 300, + 415, + 315 + ], + "spans": [ + { + "bbox": [ + 106, + 300, + 167, + 315 + ], + "score": 1.0, + "content": "Lemma 1 Let", + "type": "text" + }, + { + "bbox": [ + 167, + 301, + 182, + 313 + ], + "score": 0.81, + "content": "\\mathbb { I } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 300, + 415, + 315 + ], + "score": 1.0, + "content": "denotes the indicator function. Under (A1)-(A2), we have", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 300, + 415, + 315 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 316, + 413, + 332 + ], + "lines": [ + { + "bbox": [ + 177, + 316, + 413, + 332 + ], + "spans": [ + { + "bbox": [ + 177, + 316, + 413, + 332 + ], + "score": 0.89, + "content": "E [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ^ { * } \\} ] = 0 , \\forall a \\in \\{ 0 , 1 \\} , i \\geq 1 .", + "type": "interline_equation", + "image_path": "2b778884f309f595ba78613746895bc356b05eb2645e9fd3f1cfd5fc58f2b850.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 177, + 316, + 413, + 332 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 346, + 335, + 360 + ], + "lines": [ + { + "bbox": [ + 104, + 344, + 335, + 362 + ], + "spans": [ + { + "bbox": [ + 104, + 344, + 335, + 362 + ], + "score": 1.0, + "content": "3 ONLINE SEQUENTIAL TESTING FOR QTE", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18, + "bbox_fs": [ + 104, + 344, + 335, + 362 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 371, + 361, + 383 + ], + "lines": [ + { + "bbox": [ + 105, + 371, + 362, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 362, + 383 + ], + "score": 1.0, + "content": "3.1 TEST STATISTICS AND THEIR LIMITING DISTRIBUTION", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 391, + 504, + 414 + ], + "lines": [ + { + "bbox": [ + 105, + 389, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 282, + 405 + ], + "score": 1.0, + "content": "We first present our test statistic for testing", + "type": "text" + }, + { + "bbox": [ + 282, + 392, + 296, + 403 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 389, + 439, + 405 + ], + "score": 1.0, + "content": ". In view of Lemma 1, we estimate", + "type": "text" + }, + { + "bbox": [ + 440, + 392, + 451, + 403 + ], + "score": 0.89, + "content": "\\beta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 389, + 505, + 405 + ], + "score": 1.0, + "content": "by using the", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 403, + 235, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 403, + 235, + 415 + ], + "score": 1.0, + "content": "ordinary least squares estimator", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 389, + 505, + 415 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 417, + 394, + 457 + ], + "lines": [ + { + "bbox": [ + 189, + 417, + 394, + 457 + ], + "spans": [ + { + "bbox": [ + 189, + 417, + 394, + 457 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a } ( t ) = { \\widehat \\Sigma } _ { a } ^ { - 1 } ( t ) \\left\\{ \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\right\\}", + "type": "interline_equation", + "image_path": "0d2ead2b29bf363e5280bcabe1998b93a0bff663ab850d7dd23fb3fe59b8ce32.jpg" + } + ] + } + ], + "index": 22.5, + "virtual_lines": [ + { + "bbox": [ + 189, + 417, + 394, + 437.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 189, + 437.0, + 394, + 457.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 461, + 506, + 539 + ], + "lines": [ + { + "bbox": [ + 101, + 456, + 510, + 482 + ], + "spans": [ + { + "bbox": [ + 101, + 456, + 183, + 482 + ], + "score": 1.0, + "content": "at each time point", + "type": "text" + }, + { + "bbox": [ + 183, + 465, + 189, + 474 + ], + "score": 0.75, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 456, + 205, + 482 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 205, + 463, + 251, + 476 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 456, + 283, + 482 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 284, + 461, + 489, + 477 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\widehat { \\Sigma } _ { a } ( t ) = N ^ { - 1 } ( t ) \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 489, + 456, + 510, + 482 + ], + "score": 1.0, + "content": ". A", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 475, + 506, + 490 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 271, + 490 + ], + "score": 1.0, + "content": "generalized inverse might be used even if", + "type": "text" + }, + { + "bbox": [ + 271, + 475, + 295, + 489 + ], + "score": 0.93, + "content": "\\widehat { \\Sigma } _ { a } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 295, + 476, + 506, + 490 + ], + "score": 1.0, + "content": "is not invertible. Consider the following test statistic", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 488, + 506, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 488, + 263, + 503 + ], + "score": 0.92, + "content": "\\begin{array} { r } { S ( t ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ \\widehat \\beta _ { 1 } ( t ) - \\widehat \\beta _ { 0 } ( t ) \\} } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 489, + 294, + 504 + ], + "score": 1.0, + "content": ". Under", + "type": "text" + }, + { + "bbox": [ + 295, + 491, + 308, + 502 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 489, + 354, + 504 + ], + "score": 1.0, + "content": ", we expect", + "type": "text" + }, + { + "bbox": [ + 355, + 491, + 374, + 502 + ], + "score": 0.91, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 489, + 456, + 504 + ], + "score": 1.0, + "content": "to be small. A large", + "type": "text" + }, + { + "bbox": [ + 456, + 490, + 475, + 503 + ], + "score": 0.92, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 476, + 489, + 506, + 504 + ], + "score": 1.0, + "content": "can be", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 501, + 506, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 246, + 515 + ], + "score": 1.0, + "content": "interpreted as the evidence against", + "type": "text" + }, + { + "bbox": [ + 247, + 503, + 260, + 513 + ], + "score": 0.87, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 501, + 341, + 515 + ], + "score": 1.0, + "content": ". As such, we reject", + "type": "text" + }, + { + "bbox": [ + 341, + 502, + 355, + 513 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 501, + 393, + 515 + ], + "score": 1.0, + "content": "for large", + "type": "text" + }, + { + "bbox": [ + 393, + 502, + 412, + 514 + ], + "score": 0.9, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 501, + 506, + 515 + ], + "score": 1.0, + "content": ". We remark that when", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 106, + 513, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 106, + 515, + 120, + 527 + ], + "score": 0.87, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 513, + 291, + 529 + ], + "score": 1.0, + "content": "is rejected, we can apply the decision rule", + "type": "text" + }, + { + "bbox": [ + 291, + 514, + 437, + 529 + ], + "score": 0.89, + "content": "d ( x ) = \\arg \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\varphi ^ { \\top } ( x ) \\widehat { \\beta } _ { a } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 513, + 506, + 529 + ], + "score": 1.0, + "content": "for personalized", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 527, + 178, + 538 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 178, + 538 + ], + "score": 1.0, + "content": "recommendation.", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 26.5, + "bbox_fs": [ + 101, + 456, + 510, + 538 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 543, + 486, + 556 + ], + "lines": [ + { + "bbox": [ + 106, + 542, + 486, + 558 + ], + "spans": [ + { + "bbox": [ + 106, + 542, + 416, + 558 + ], + "score": 1.0, + "content": "To determine the rejection region, we next discuss the limiting distribution of", + "type": "text" + }, + { + "bbox": [ + 417, + 544, + 435, + 556 + ], + "score": 0.91, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 542, + 468, + 558 + ], + "score": 1.0, + "content": ". Under", + "type": "text" + }, + { + "bbox": [ + 468, + 545, + 481, + 555 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 542, + 486, + 558 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 542, + 486, + 558 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 559, + 438, + 607 + ], + "lines": [ + { + "bbox": [ + 153, + 559, + 438, + 607 + ], + "spans": [ + { + "bbox": [ + 153, + 559, + 438, + 607 + ], + "score": 0.93, + "content": "\\begin{array} { r } { S ( t ) \\le \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} + \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) } \\\\ { \\le \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} . } \\end{array}", + "type": "interline_equation", + "image_path": "a6e33106058f086e77ae4d70e8c25c62851033e2d3188a96c0c0fc314947bf82.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 153, + 559, + 438, + 575.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 153, + 575.0, + 438, + 591.0 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 153, + 591.0, + 438, + 607.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 609, + 507, + 672 + ], + "lines": [ + { + "bbox": [ + 105, + 609, + 506, + 624 + ], + "spans": [ + { + "bbox": [ + 105, + 609, + 221, + 624 + ], + "score": 1.0, + "content": "Both equalities hold when", + "type": "text" + }, + { + "bbox": [ + 221, + 610, + 263, + 623 + ], + "score": 0.94, + "content": "\\beta _ { 0 } ^ { * } ~ = ~ \\beta _ { 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 609, + 426, + 624 + ], + "score": 1.0, + "content": ". Suppose there exists some function", + "type": "text" + }, + { + "bbox": [ + 426, + 610, + 456, + 622 + ], + "score": 0.92, + "content": "\\pi ^ { * } ( \\cdot , \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 609, + 506, + 624 + ], + "score": 1.0, + "content": "defined on", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 107, + 619, + 509, + 642 + ], + "spans": [ + { + "bbox": [ + 107, + 624, + 154, + 637 + ], + "score": 0.92, + "content": "\\{ 0 , 1 \\} \\times \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 154, + 619, + 209, + 642 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + }, + { + "bbox": [ + 209, + 622, + 451, + 637 + ], + "score": 0.9, + "content": "\\begin{array} { r } { { \\mathrm { E } } ^ { X } | \\sum _ { i = 1 } ^ { n } n ^ { - 1 } \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) | \\ \\stackrel { P } { \\to } \\ 0 , \\forall a \\ \\in \\ \\{ 0 , 1 \\} } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 451, + 619, + 464, + 642 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 465, + 627, + 501, + 636 + ], + "score": 0.85, + "content": "n \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 619, + 509, + 642 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 637, + 506, + 651 + ], + "spans": [ + { + "bbox": [ + 105, + 637, + 134, + 651 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 638, + 299, + 650 + ], + "score": 0.9, + "content": "\\pi _ { n } ( \\cdot , \\cdot ) = \\operatorname* { P r } ( A _ { n } = a | X _ { n } = x , { \\mathcal { F } } _ { n - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 637, + 388, + 651 + ], + "score": 1.0, + "content": ", and the expectation", + "type": "text" + }, + { + "bbox": [ + 389, + 637, + 404, + 648 + ], + "score": 0.87, + "content": "\\operatorname { E } ^ { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 637, + 506, + 651 + ], + "score": 1.0, + "content": "is taken with respect to", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 648, + 505, + 661 + ], + "spans": [ + { + "bbox": [ + 106, + 650, + 117, + 659 + ], + "score": 0.82, + "content": "X", + "type": "inline_equation" + }, + { + "bbox": [ + 117, + 648, + 505, + 661 + ], + "score": 1.0, + "content": ". This condition implies that the treatment assignment mechanism cannot be arbitrary (see the", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 659, + 351, + 672 + ], + "spans": [ + { + "bbox": [ + 105, + 659, + 351, + 672 + ], + "score": 1.0, + "content": "discussion below Theorem 1 for details). Then we will show", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36, + "bbox_fs": [ + 105, + 609, + 509, + 672 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 675, + 478, + 704 + ], + "lines": [ + { + "bbox": [ + 111, + 675, + 478, + 704 + ], + "spans": [ + { + "bbox": [ + 111, + 675, + 478, + 704 + ], + "score": 0.92, + "content": "B ( t ) \\equiv \\sqrt { N ( t ) } \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} \\stackrel { d } { } N ( 0 , \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } ) , \\mathrm { a s } N ( t ) \\infty ,", + "type": "interline_equation", + "image_path": "afe6664799fa6668b3e113e66c2da44fdcbb85d62599f3ae96841f82705ca3a8.jpg" + } + ] + } + ], + "index": 40, + "virtual_lines": [ + { + "bbox": [ + 111, + 675, + 478, + 684.6666666666666 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 111, + 684.6666666666666, + 478, + 694.3333333333333 + ], + "spans": [], + "index": 40 + }, + { + "bbox": [ + 111, + 694.3333333333333, + 478, + 703.9999999999999 + ], + "spans": [], + "index": 41 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 708, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 106, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 708, + 134, + 722 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 135, + 709, + 262, + 721 + ], + "score": 0.81, + "content": "\\Sigma _ { a } = \\mathrm { E } \\pi ^ { * } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X )", + "type": "inline_equation" + }, + { + "bbox": [ + 262, + 708, + 267, + 722 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 267, + 708, + 432, + 722 + ], + "score": 0.9, + "content": "\\Phi _ { a } = \\mathrm { E } \\pi ^ { * } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X )", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 708, + 456, + 722 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 456, + 709, + 505, + 722 + ], + "score": 0.9, + "content": "\\sigma ^ { 2 } ( a , x ) =", + "type": "inline_equation" + } + ], + "index": 42 + }, + { + "bbox": [ + 106, + 718, + 506, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 246, + 733 + ], + "score": 0.88, + "content": "\\operatorname { E } [ \\{ Y ^ { * } ( a ) - \\varphi ^ { \\top } ( X ) \\beta _ { a } \\} ^ { 2 } | X = x ]", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 718, + 284, + 734 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 285, + 721, + 314, + 731 + ], + "score": 0.87, + "content": "x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 315, + 718, + 506, + 734 + ], + "score": 1.0, + "content": ". According to equation 3, the right-hand-side", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "(RHS) of equation 2 is to converge in distribution to the maximum of some Gaussian random vari-", + "type": "text", + "cross_page": true + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 309, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 309, + 105 + ], + "score": 1.0, + "content": "ables. This observation forms the basis of our test.", + "type": "text", + "cross_page": true + } + ], + "index": 1 + } + ], + "index": 42.5, + "bbox_fs": [ + 106, + 708, + 506, + 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": "(RHS) of equation 2 is to converge in distribution to the maximum of some Gaussian random vari-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 309, + 105 + ], + "spans": [ + { + "bbox": [ + 106, + 93, + 309, + 105 + ], + "score": 1.0, + "content": "ables. This observation forms the basis of our test.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 505, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 506, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 506, + 123 + ], + "score": 1.0, + "content": "We next discuss the sequential implementation of our test. Assume that the interim analyses are", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 210, + 133 + ], + "score": 1.0, + "content": "conducted at time points", + "type": "text" + }, + { + "bbox": [ + 211, + 121, + 321, + 133 + ], + "score": 0.9, + "content": "t _ { 1 } , t _ { 2 } , \\ldots , t _ { K } \\in [ 0 , \\ldots , T ]", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 121, + 364, + 133 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 364, + 122, + 502, + 133 + ], + "score": 0.9, + "content": "0 < t _ { 1 } < t _ { 2 } < \\cdots < t _ { K } = T", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 121, + 505, + 133 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 131, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 149, + 145 + ], + "score": 1.0, + "content": "We allow", + "type": "text" + }, + { + "bbox": [ + 149, + 133, + 160, + 142 + ], + "score": 0.84, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 131, + 506, + 145 + ], + "score": 1.0, + "content": "to grow with the number of observations. In the most extreme case, one may set", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 273, + 155 + ], + "score": 0.91, + "content": "t _ { k } = \\operatorname* { i n f } _ { t } \\{ N ( t ) \\geq N ( t _ { k - 1 } ) + 1 \\} , \\forall k \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 143, + 506, + 156 + ], + "score": 1.0, + "content": ". That is, we make a decision regarding the null hypothesis", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 366, + 167 + ], + "score": 1.0, + "content": "upon the arrival of each observation. In addition, we assume that", + "type": "text" + }, + { + "bbox": [ + 366, + 155, + 375, + 165 + ], + "score": 0.87, + "content": "t _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "is large so that there are enough", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 164, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 104, + 164, + 188, + 178 + ], + "score": 1.0, + "content": "number of samples", + "type": "text" + }, + { + "bbox": [ + 188, + 165, + 214, + 177 + ], + "score": 0.93, + "content": "N ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 164, + 456, + 178 + ], + "score": 1.0, + "content": "to guarantee the validity of the normal approximation for", + "type": "text" + }, + { + "bbox": [ + 457, + 165, + 481, + 177 + ], + "score": 0.92, + "content": "B ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 164, + 506, + 178 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "score": 1.0, + "content": "remark that in typical tech companies such as Amazon, Facebook, etc., massive data are collected", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 186, + 492, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 186, + 492, + 200 + ], + "score": 1.0, + "content": "even within a short time interval. Large sample approximation is validated in these applications.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 107, + 204, + 503, + 228 + ], + "lines": [ + { + "bbox": [ + 107, + 204, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 107, + 204, + 337, + 216 + ], + "score": 1.0, + "content": "To guarantee our test controls the type-I error, we reject", + "type": "text" + }, + { + "bbox": [ + 337, + 205, + 351, + 215 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 204, + 484, + 216 + ], + "score": 1.0, + "content": "and terminate the experiment at", + "type": "text" + }, + { + "bbox": [ + 484, + 205, + 495, + 215 + ], + "score": 0.87, + "content": "t _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 204, + 505, + 216 + ], + "score": 1.0, + "content": "if", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 215, + 503, + 229 + ], + "spans": [ + { + "bbox": [ + 107, + 215, + 188, + 229 + ], + "score": 0.91, + "content": "\\sqrt { N ( t _ { k } ) } S ( t _ { k } ) \\geq z _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 215, + 228, + 229 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 228, + 216, + 284, + 228 + ], + "score": 0.93, + "content": "k = 1 , \\ldots , K", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 215, + 393, + 229 + ], + "score": 1.0, + "content": "with some suitably chosen", + "type": "text" + }, + { + "bbox": [ + 393, + 217, + 456, + 228 + ], + "score": 0.92, + "content": "z _ { 1 } , \\dotsc , z _ { K } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 215, + 503, + 229 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5 + }, + { + "type": "interline_equation", + "bbox": [ + 182, + 234, + 409, + 262 + ], + "lines": [ + { + "bbox": [ + 182, + 234, + 409, + 262 + ], + "spans": [ + { + "bbox": [ + 182, + 234, + 409, + 262 + ], + "score": 0.94, + "content": "\\operatorname* { P r } \\bigg ( \\operatorname* { m a x } _ { k \\in \\{ 1 , \\dots , K \\} } \\{ \\sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \\} > 0 \\bigg ) \\leq \\alpha + o ( 1 )", + "type": "interline_equation", + "image_path": "65859d05a2e49f119b63e96f1b2ad11b606257ea8232e165ff44e9385ec36f89.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 182, + 234, + 409, + 262 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 267, + 504, + 290 + ], + "lines": [ + { + "bbox": [ + 105, + 266, + 506, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 225, + 280 + ], + "score": 1.0, + "content": "for a given significance level", + "type": "text" + }, + { + "bbox": [ + 225, + 268, + 252, + 278 + ], + "score": 0.89, + "content": "\\alpha > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 266, + 279, + 280 + ], + "score": 1.0, + "content": "under", + "type": "text" + }, + { + "bbox": [ + 279, + 268, + 293, + 279 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 266, + 460, + 280 + ], + "score": 1.0, + "content": ". In view of equation 2, it suffices to find", + "type": "text" + }, + { + "bbox": [ + 461, + 267, + 486, + 280 + ], + "score": 0.93, + "content": "\\{ z _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 266, + 506, + 280 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 276, + 137, + 293 + ], + "spans": [ + { + "bbox": [ + 104, + 276, + 137, + 293 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 295, + 418, + 323 + ], + "lines": [ + { + "bbox": [ + 172, + 295, + 418, + 323 + ], + "spans": [ + { + "bbox": [ + 172, + 295, + 418, + 323 + ], + "score": 0.92, + "content": "\\operatorname* { P r } \\left\\{ \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left( \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} \\leq \\alpha + o ( 1 ) ,", + "type": "interline_equation", + "image_path": "cdb11743140241b57d5608e6390631b62c3b230a69c1de1ca6cb554d46c37d5f.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 172, + 295, + 418, + 323 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 340, + 341 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 341, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 222, + 343 + ], + "score": 1.0, + "content": "where the stochastic process", + "type": "text" + }, + { + "bbox": [ + 222, + 329, + 242, + 341 + ], + "score": 0.91, + "content": "B ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 328, + 341, + 343 + ], + "score": 1.0, + "content": "is defined in equation 3.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 105, + 345, + 506, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 344, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 163, + 359 + ], + "score": 1.0, + "content": "To determine", + "type": "text" + }, + { + "bbox": [ + 163, + 346, + 188, + 358 + ], + "score": 0.92, + "content": "\\{ z _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 344, + 506, + 359 + ], + "score": 1.0, + "content": ", we need to derive the asymptotic distribution of the left-hand-side (LHS) of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 357, + 475, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 352, + 369 + ], + "score": 1.0, + "content": "equation 4. To this end, define a mean-zero Gaussian process", + "type": "text" + }, + { + "bbox": [ + 353, + 357, + 373, + 369 + ], + "score": 0.91, + "content": "G ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 357, + 475, + 369 + ], + "score": 1.0, + "content": "with covariance function", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "interline_equation", + "bbox": [ + 144, + 374, + 446, + 403 + ], + "lines": [ + { + "bbox": [ + 144, + 374, + 446, + 403 + ], + "spans": [ + { + "bbox": [ + 144, + 374, + 446, + 403 + ], + "score": 0.92, + "content": "\\mathrm { C o v } ( G ( t ) , G ( t ^ { \\prime } ) ) = N ^ { 1 / 2 } ( t ) N ^ { - 1 / 2 } ( t ^ { \\prime } ) \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } , \\forall 0 < t \\leq t ^ { \\prime } .", + "type": "interline_equation", + "image_path": "b5da6438913f801f6c9ee030669da5ee9ea8e764bd599b1285ad3afd1f0940fe.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 144, + 374, + 446, + 383.6666666666667 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 144, + 383.6666666666667, + 446, + 393.33333333333337 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 144, + 393.33333333333337, + 446, + 403.00000000000006 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 408, + 506, + 443 + ], + "lines": [ + { + "bbox": [ + 105, + 408, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 467, + 422 + ], + "score": 1.0, + "content": "In the following, we show that the LHS of equation 4 can be uniformly approximated by", + "type": "text" + }, + { + "bbox": [ + 468, + 409, + 486, + 421 + ], + "score": 0.91, + "content": "G ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 408, + 505, + 422 + ], + "score": 1.0, + "content": ", for", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 419, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 124, + 434 + ], + "score": 1.0, + "content": "any", + "type": "text" + }, + { + "bbox": [ + 124, + 420, + 178, + 432 + ], + "score": 0.92, + "content": "\\{ z _ { k } \\} _ { k = 1 , . . . , K }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 419, + 483, + 434 + ], + "score": 1.0, + "content": ". To establish our theoretical results, we need some regularity conditions on", + "type": "text" + }, + { + "bbox": [ + 483, + 420, + 501, + 432 + ], + "score": 0.9, + "content": "\\dot { \\varphi } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 419, + 506, + 434 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 431, + 451, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 439, + 443 + ], + "score": 1.0, + "content": "To save space, we summarize these assumptions in (A3) and put them in Appendix", + "type": "text" + }, + { + "bbox": [ + 439, + 432, + 447, + 441 + ], + "score": 0.34, + "content": "\\mathbf { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 431, + 451, + 443 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 107, + 452, + 506, + 487 + ], + "lines": [ + { + "bbox": [ + 106, + 452, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 278, + 466 + ], + "score": 1.0, + "content": "Theorem 1 Assume (A1)-(A3) hold. For", + "type": "text" + }, + { + "bbox": [ + 278, + 453, + 316, + 464 + ], + "score": 0.9, + "content": "a = 0 , 1", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 452, + 354, + 466 + ], + "score": 1.0, + "content": ", assume", + "type": "text" + }, + { + "bbox": [ + 354, + 453, + 441, + 465 + ], + "score": 0.91, + "content": "\\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\pi ^ { * } ( a , x ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 452, + 461, + 466 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 461, + 453, + 493, + 465 + ], + "score": 0.91, + "content": "\\left| Y ^ { * } ( a ) \\right|", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 452, + 506, + 466 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 462, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 303, + 478 + ], + "score": 1.0, + "content": "bounded almost surely. Assume there exists some", + "type": "text" + }, + { + "bbox": [ + 303, + 465, + 352, + 475 + ], + "score": 0.91, + "content": "0 < \\alpha _ { 0 } \\le 1", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 462, + 460, + 478 + ], + "score": 1.0, + "content": "such that for any sequence", + "type": "text" + }, + { + "bbox": [ + 460, + 465, + 486, + 475 + ], + "score": 0.88, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 462, + 506, + 478 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 473, + 488, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 141, + 489 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 141, + 474, + 221, + 487 + ], + "score": 0.92, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 473, + 430, + 489 + ], + "score": 1.0, + "content": ", the following event occurs with probability at least", + "type": "text" + }, + { + "bbox": [ + 430, + 475, + 483, + 487 + ], + "score": 0.91, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 473, + 488, + 489 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 144, + 492, + 446, + 527 + ], + "lines": [ + { + "bbox": [ + 144, + 492, + 446, + 527 + ], + "spans": [ + { + "bbox": [ + 144, + 492, + 446, + 527 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } E \\left| \\sum _ { i = 1 } ^ { k } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right| \\leq O ( 1 ) q k ^ { 1 - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } k , \\forall k \\geq j _ { n } ,", + "type": "interline_equation", + "image_path": "2f4a233230f977c24e4fd14c8d9edf2cbe1cf5ff85f3f695b182a4b5d0bb7bc3.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 144, + 492, + 446, + 503.6666666666667 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 144, + 503.6666666666667, + 446, + 515.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 144, + 515.3333333333334, + 446, + 527.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 532, + 507, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 133, + 546 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 533, + 155, + 545 + ], + "score": 0.89, + "content": "O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 531, + 325, + 546 + ], + "score": 1.0, + "content": "denotes some positive constant. Assume", + "type": "text" + }, + { + "bbox": [ + 325, + 532, + 443, + 545 + ], + "score": 0.92, + "content": "N ^ { \\alpha _ { 0 } } ( t _ { 1 } ) / \\log ^ { \\alpha _ { 0 } } N ( t _ { 1 } ) \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 531, + 463, + 546 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 464, + 533, + 505, + 545 + ], + "score": 0.9, + "content": "N ( t _ { 1 } ) \\gg", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 107, + 543, + 506, + 557 + ], + "spans": [ + { + "bbox": [ + 107, + 544, + 146, + 556 + ], + "score": 0.9, + "content": "\\log N ( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 543, + 374, + 557 + ], + "score": 1.0, + "content": "almost surely. Then conditional on the counting process", + "type": "text" + }, + { + "bbox": [ + 374, + 545, + 394, + 556 + ], + "score": 0.89, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 543, + 506, + 557 + ], + "score": 1.0, + "content": ", there exists some constant", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 107, + 555, + 171, + 567 + ], + "spans": [ + { + "bbox": [ + 107, + 556, + 130, + 565 + ], + "score": 0.86, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 555, + 171, + 567 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 569, + 514, + 621 + ], + "lines": [ + { + "bbox": [ + 111, + 569, + 514, + 621 + ], + "spans": [ + { + "bbox": [ + 111, + 569, + 514, + 621 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } { { \\operatorname* { s u p } _ { 1 , \\ldots , z _ { K } } P r \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { K } ) - z _ { k } ) > 0 \\} - P r \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { K } ) - z _ { k } ) \\} } } \\\\ & { } & { \\leq c q ^ { 3 / 4 } N ^ { - 1 / 8 } ( t _ { 1 } ) \\log ^ { 1 5 / 8 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K N ( t _ { 1 } ) \\} } \\end{array}", + "type": "interline_equation", + "image_path": "397b9ec20a3891c062c68b4b9cac396b6c00dc9a6edf38e4390ea9fc7a64b942.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 111, + 569, + 514, + 586.3333333333334 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 111, + 586.3333333333334, + 514, + 603.6666666666667 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 111, + 603.6666666666667, + 514, + 621.0000000000001 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 630, + 505, + 687 + ], + "lines": [ + { + "bbox": [ + 106, + 631, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 505, + 643 + ], + "score": 1.0, + "content": "Theorem 1 implies that the approximation error depends on the number of observations obtained", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 642, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 222, + 654 + ], + "score": 1.0, + "content": "up to the first decision point", + "type": "text" + }, + { + "bbox": [ + 222, + 642, + 248, + 654 + ], + "score": 0.92, + "content": "\\bar { N ( t _ { 1 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 642, + 422, + 654 + ], + "score": 1.0, + "content": ", the maximum number of interim analyses", + "type": "text" + }, + { + "bbox": [ + 423, + 642, + 433, + 652 + ], + "score": 0.82, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 642, + 506, + 654 + ], + "score": 1.0, + "content": ", the total number", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 653, + 505, + 665 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 180, + 665 + ], + "score": 1.0, + "content": "of basis functions", + "type": "text" + }, + { + "bbox": [ + 180, + 655, + 186, + 664 + ], + "score": 0.7, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 653, + 208, + 665 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 208, + 655, + 219, + 664 + ], + "score": 0.83, + "content": "\\alpha _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 653, + 505, + 665 + ], + "score": 1.0, + "content": ", which characterizes the convergence rate of the treatment assignment", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 103, + 662, + 507, + 681 + ], + "spans": [ + { + "bbox": [ + 103, + 662, + 155, + 681 + ], + "score": 1.0, + "content": "mechanism", + "type": "text" + }, + { + "bbox": [ + 155, + 664, + 218, + 677 + ], + "score": 0.92, + "content": "\\scriptstyle \\sum _ { i = 1 } ^ { n } { n ^ { - 1 } \\pi _ { i - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 662, + 507, + 681 + ], + "score": 1.0, + "content": ". Clearly, the error will decay to zero when the followings hold with", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 675, + 206, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 206, + 688 + ], + "score": 1.0, + "content": "probability tending to 1,", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39 + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 692, + 410, + 705 + ], + "lines": [ + { + "bbox": [ + 180, + 692, + 410, + 705 + ], + "spans": [ + { + "bbox": [ + 180, + 692, + 410, + 705 + ], + "score": 0.83, + "content": "q = O ( N ^ { \\alpha _ { * } } ( t _ { 1 } ) ) , \\mathrm { f o r s o m e } 0 \\leq \\alpha ^ { * } < \\operatorname* { m i n } ( 1 / 6 , \\alpha _ { 0 } / 3 ) ,", + "type": "interline_equation", + "image_path": "4a058a6d3f64b26650b6f7eae0f7f9ce154ebff761fb37cc4513baf589c1365a.jpg" + } + ] + } + ], + "index": 42, + "virtual_lines": [ + { + "bbox": [ + 180, + 692, + 410, + 705 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 717, + 416, + 733 + ], + "lines": [ + { + "bbox": [ + 175, + 717, + 416, + 733 + ], + "spans": [ + { + "bbox": [ + 175, + 717, + 416, + 733 + ], + "score": 0.83, + "content": "\\log ( K ) \\ll \\operatorname * { m i n } \\{ N ^ { 1 / 1 5 - 2 \\alpha ^ { * } / 5 } ( t _ { 1 } ) , N ^ { ( \\alpha _ { 0 } - 3 \\alpha ^ { * } ) / ( 5 + \\alpha _ { 0 } ) } ( t _ { 1 } ) \\} .", + "type": "interline_equation", + "image_path": "895c0b209097604a0d727b4cbaeaa26a2b4721a5869715b7373d97ce85feed4c.jpg" + } + ] + } + ], + "index": 43, + "virtual_lines": [ + { + "bbox": [ + 175, + 717, + 416, + 733 + ], + "spans": [], + "index": 43 + } + ] + } + ], + "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, + 309, + 759 + ], + "lines": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "spans": [ + { + "bbox": [ + 301, + 750, + 310, + 762 + ], + "score": 1.0, + "content": "4", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 105 + ], + "lines": [], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 105 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 110, + 505, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 110, + 506, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 110, + 506, + 123 + ], + "score": 1.0, + "content": "We next discuss the sequential implementation of our test. Assume that the interim analyses are", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 121, + 505, + 133 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 210, + 133 + ], + "score": 1.0, + "content": "conducted at time points", + "type": "text" + }, + { + "bbox": [ + 211, + 121, + 321, + 133 + ], + "score": 0.9, + "content": "t _ { 1 } , t _ { 2 } , \\ldots , t _ { K } \\in [ 0 , \\ldots , T ]", + "type": "inline_equation" + }, + { + "bbox": [ + 322, + 121, + 364, + 133 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 364, + 122, + 502, + 133 + ], + "score": 0.9, + "content": "0 < t _ { 1 } < t _ { 2 } < \\cdots < t _ { K } = T", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 121, + 505, + 133 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 131, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 106, + 131, + 149, + 145 + ], + "score": 1.0, + "content": "We allow", + "type": "text" + }, + { + "bbox": [ + 149, + 133, + 160, + 142 + ], + "score": 0.84, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 131, + 506, + 145 + ], + "score": 1.0, + "content": "to grow with the number of observations. In the most extreme case, one may set", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 106, + 143, + 273, + 155 + ], + "score": 0.91, + "content": "t _ { k } = \\operatorname* { i n f } _ { t } \\{ N ( t ) \\geq N ( t _ { k - 1 } ) + 1 \\} , \\forall k \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 143, + 506, + 156 + ], + "score": 1.0, + "content": ". That is, we make a decision regarding the null hypothesis", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 154, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 366, + 167 + ], + "score": 1.0, + "content": "upon the arrival of each observation. In addition, we assume that", + "type": "text" + }, + { + "bbox": [ + 366, + 155, + 375, + 165 + ], + "score": 0.87, + "content": "t _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 154, + 505, + 167 + ], + "score": 1.0, + "content": "is large so that there are enough", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 104, + 164, + 506, + 178 + ], + "spans": [ + { + "bbox": [ + 104, + 164, + 188, + 178 + ], + "score": 1.0, + "content": "number of samples", + "type": "text" + }, + { + "bbox": [ + 188, + 165, + 214, + 177 + ], + "score": 0.93, + "content": "N ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 164, + 456, + 178 + ], + "score": 1.0, + "content": "to guarantee the validity of the normal approximation for", + "type": "text" + }, + { + "bbox": [ + 457, + 165, + 481, + 177 + ], + "score": 0.92, + "content": "B ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 482, + 164, + 506, + 178 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "spans": [ + { + "bbox": [ + 105, + 176, + 506, + 188 + ], + "score": 1.0, + "content": "remark that in typical tech companies such as Amazon, Facebook, etc., massive data are collected", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 104, + 186, + 492, + 200 + ], + "spans": [ + { + "bbox": [ + 104, + 186, + 492, + 200 + ], + "score": 1.0, + "content": "even within a short time interval. Large sample approximation is validated in these applications.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 5.5, + "bbox_fs": [ + 104, + 110, + 506, + 200 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 204, + 503, + 228 + ], + "lines": [ + { + "bbox": [ + 107, + 204, + 505, + 216 + ], + "spans": [ + { + "bbox": [ + 107, + 204, + 337, + 216 + ], + "score": 1.0, + "content": "To guarantee our test controls the type-I error, we reject", + "type": "text" + }, + { + "bbox": [ + 337, + 205, + 351, + 215 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 204, + 484, + 216 + ], + "score": 1.0, + "content": "and terminate the experiment at", + "type": "text" + }, + { + "bbox": [ + 484, + 205, + 495, + 215 + ], + "score": 0.87, + "content": "t _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 204, + 505, + 216 + ], + "score": 1.0, + "content": "if", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 215, + 503, + 229 + ], + "spans": [ + { + "bbox": [ + 107, + 215, + 188, + 229 + ], + "score": 0.91, + "content": "\\sqrt { N ( t _ { k } ) } S ( t _ { k } ) \\geq z _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 215, + 228, + 229 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 228, + 216, + 284, + 228 + ], + "score": 0.93, + "content": "k = 1 , \\ldots , K", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 215, + 393, + 229 + ], + "score": 1.0, + "content": "with some suitably chosen", + "type": "text" + }, + { + "bbox": [ + 393, + 217, + 456, + 228 + ], + "score": 0.92, + "content": "z _ { 1 } , \\dotsc , z _ { K } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 457, + 215, + 503, + 229 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10.5, + "bbox_fs": [ + 107, + 204, + 505, + 229 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 182, + 234, + 409, + 262 + ], + "lines": [ + { + "bbox": [ + 182, + 234, + 409, + 262 + ], + "spans": [ + { + "bbox": [ + 182, + 234, + 409, + 262 + ], + "score": 0.94, + "content": "\\operatorname* { P r } \\bigg ( \\operatorname* { m a x } _ { k \\in \\{ 1 , \\dots , K \\} } \\{ \\sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \\} > 0 \\bigg ) \\leq \\alpha + o ( 1 )", + "type": "interline_equation", + "image_path": "65859d05a2e49f119b63e96f1b2ad11b606257ea8232e165ff44e9385ec36f89.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 182, + 234, + 409, + 262 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 267, + 504, + 290 + ], + "lines": [ + { + "bbox": [ + 105, + 266, + 506, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 266, + 225, + 280 + ], + "score": 1.0, + "content": "for a given significance level", + "type": "text" + }, + { + "bbox": [ + 225, + 268, + 252, + 278 + ], + "score": 0.89, + "content": "\\alpha > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 266, + 279, + 280 + ], + "score": 1.0, + "content": "under", + "type": "text" + }, + { + "bbox": [ + 279, + 268, + 293, + 279 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 293, + 266, + 460, + 280 + ], + "score": 1.0, + "content": ". In view of equation 2, it suffices to find", + "type": "text" + }, + { + "bbox": [ + 461, + 267, + 486, + 280 + ], + "score": 0.93, + "content": "\\{ z _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 266, + 506, + 280 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 276, + 137, + 293 + ], + "spans": [ + { + "bbox": [ + 104, + 276, + 137, + 293 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 266, + 506, + 293 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 295, + 418, + 323 + ], + "lines": [ + { + "bbox": [ + 172, + 295, + 418, + 323 + ], + "spans": [ + { + "bbox": [ + 172, + 295, + 418, + 323 + ], + "score": 0.92, + "content": "\\operatorname* { P r } \\left\\{ \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left( \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} \\leq \\alpha + o ( 1 ) ,", + "type": "interline_equation", + "image_path": "cdb11743140241b57d5608e6390631b62c3b230a69c1de1ca6cb554d46c37d5f.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 172, + 295, + 418, + 323 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 340, + 341 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 341, + 343 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 222, + 343 + ], + "score": 1.0, + "content": "where the stochastic process", + "type": "text" + }, + { + "bbox": [ + 222, + 329, + 242, + 341 + ], + "score": 0.91, + "content": "B ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 242, + 328, + 341, + 343 + ], + "score": 1.0, + "content": "is defined in equation 3.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 328, + 341, + 343 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 345, + 506, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 344, + 506, + 359 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 163, + 359 + ], + "score": 1.0, + "content": "To determine", + "type": "text" + }, + { + "bbox": [ + 163, + 346, + 188, + 358 + ], + "score": 0.92, + "content": "\\{ z _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 344, + 506, + 359 + ], + "score": 1.0, + "content": ", we need to derive the asymptotic distribution of the left-hand-side (LHS) of", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 357, + 475, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 352, + 369 + ], + "score": 1.0, + "content": "equation 4. To this end, define a mean-zero Gaussian process", + "type": "text" + }, + { + "bbox": [ + 353, + 357, + 373, + 369 + ], + "score": 0.91, + "content": "G ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 357, + 475, + 369 + ], + "score": 1.0, + "content": "with covariance function", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 344, + 506, + 369 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 144, + 374, + 446, + 403 + ], + "lines": [ + { + "bbox": [ + 144, + 374, + 446, + 403 + ], + "spans": [ + { + "bbox": [ + 144, + 374, + 446, + 403 + ], + "score": 0.92, + "content": "\\mathrm { C o v } ( G ( t ) , G ( t ^ { \\prime } ) ) = N ^ { 1 / 2 } ( t ) N ^ { - 1 / 2 } ( t ^ { \\prime } ) \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } , \\forall 0 < t \\leq t ^ { \\prime } .", + "type": "interline_equation", + "image_path": "b5da6438913f801f6c9ee030669da5ee9ea8e764bd599b1285ad3afd1f0940fe.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 144, + 374, + 446, + 383.6666666666667 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 144, + 383.6666666666667, + 446, + 393.33333333333337 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 144, + 393.33333333333337, + 446, + 403.00000000000006 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 408, + 506, + 443 + ], + "lines": [ + { + "bbox": [ + 105, + 408, + 505, + 422 + ], + "spans": [ + { + "bbox": [ + 105, + 408, + 467, + 422 + ], + "score": 1.0, + "content": "In the following, we show that the LHS of equation 4 can be uniformly approximated by", + "type": "text" + }, + { + "bbox": [ + 468, + 409, + 486, + 421 + ], + "score": 0.91, + "content": "G ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 487, + 408, + 505, + 422 + ], + "score": 1.0, + "content": ", for", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 419, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 419, + 124, + 434 + ], + "score": 1.0, + "content": "any", + "type": "text" + }, + { + "bbox": [ + 124, + 420, + 178, + 432 + ], + "score": 0.92, + "content": "\\{ z _ { k } \\} _ { k = 1 , . . . , K }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 419, + 483, + 434 + ], + "score": 1.0, + "content": ". To establish our theoretical results, we need some regularity conditions on", + "type": "text" + }, + { + "bbox": [ + 483, + 420, + 501, + 432 + ], + "score": 0.9, + "content": "\\dot { \\varphi } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 419, + 506, + 434 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 106, + 431, + 451, + 443 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 439, + 443 + ], + "score": 1.0, + "content": "To save space, we summarize these assumptions in (A3) and put them in Appendix", + "type": "text" + }, + { + "bbox": [ + 439, + 432, + 447, + 441 + ], + "score": 0.34, + "content": "\\mathbf { B }", + "type": "inline_equation" + }, + { + "bbox": [ + 447, + 431, + 451, + 443 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 408, + 506, + 443 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 452, + 506, + 487 + ], + "lines": [ + { + "bbox": [ + 106, + 452, + 506, + 466 + ], + "spans": [ + { + "bbox": [ + 106, + 452, + 278, + 466 + ], + "score": 1.0, + "content": "Theorem 1 Assume (A1)-(A3) hold. For", + "type": "text" + }, + { + "bbox": [ + 278, + 453, + 316, + 464 + ], + "score": 0.9, + "content": "a = 0 , 1", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 452, + 354, + 466 + ], + "score": 1.0, + "content": ", assume", + "type": "text" + }, + { + "bbox": [ + 354, + 453, + 441, + 465 + ], + "score": 0.91, + "content": "\\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\pi ^ { * } ( a , x ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 441, + 452, + 461, + 466 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 461, + 453, + 493, + 465 + ], + "score": 0.91, + "content": "\\left| Y ^ { * } ( a ) \\right|", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 452, + 506, + 466 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 462, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 105, + 462, + 303, + 478 + ], + "score": 1.0, + "content": "bounded almost surely. Assume there exists some", + "type": "text" + }, + { + "bbox": [ + 303, + 465, + 352, + 475 + ], + "score": 0.91, + "content": "0 < \\alpha _ { 0 } \\le 1", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 462, + 460, + 478 + ], + "score": 1.0, + "content": "such that for any sequence", + "type": "text" + }, + { + "bbox": [ + 460, + 465, + 486, + 475 + ], + "score": 0.88, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 462, + 506, + 478 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 473, + 488, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 141, + 489 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 141, + 474, + 221, + 487 + ], + "score": 0.92, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 473, + 430, + 489 + ], + "score": 1.0, + "content": ", the following event occurs with probability at least", + "type": "text" + }, + { + "bbox": [ + 430, + 475, + 483, + 487 + ], + "score": 0.91, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 473, + 488, + 489 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 452, + 506, + 489 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 144, + 492, + 446, + 527 + ], + "lines": [ + { + "bbox": [ + 144, + 492, + 446, + 527 + ], + "spans": [ + { + "bbox": [ + 144, + 492, + 446, + 527 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } E \\left| \\sum _ { i = 1 } ^ { k } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right| \\leq O ( 1 ) q k ^ { 1 - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } k , \\forall k \\geq j _ { n } ,", + "type": "interline_equation", + "image_path": "2f4a233230f977c24e4fd14c8d9edf2cbe1cf5ff85f3f695b182a4b5d0bb7bc3.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 144, + 492, + 446, + 503.6666666666667 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 144, + 503.6666666666667, + 446, + 515.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 144, + 515.3333333333334, + 446, + 527.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 532, + 507, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 531, + 505, + 546 + ], + "spans": [ + { + "bbox": [ + 105, + 531, + 133, + 546 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 533, + 155, + 545 + ], + "score": 0.89, + "content": "O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 531, + 325, + 546 + ], + "score": 1.0, + "content": "denotes some positive constant. Assume", + "type": "text" + }, + { + "bbox": [ + 325, + 532, + 443, + 545 + ], + "score": 0.92, + "content": "N ^ { \\alpha _ { 0 } } ( t _ { 1 } ) / \\log ^ { \\alpha _ { 0 } } N ( t _ { 1 } ) \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 531, + 463, + 546 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 464, + 533, + 505, + 545 + ], + "score": 0.9, + "content": "N ( t _ { 1 } ) \\gg", + "type": "inline_equation" + } + ], + "index": 31 + }, + { + "bbox": [ + 107, + 543, + 506, + 557 + ], + "spans": [ + { + "bbox": [ + 107, + 544, + 146, + 556 + ], + "score": 0.9, + "content": "\\log N ( T )", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 543, + 374, + 557 + ], + "score": 1.0, + "content": "almost surely. Then conditional on the counting process", + "type": "text" + }, + { + "bbox": [ + 374, + 545, + 394, + 556 + ], + "score": 0.89, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 543, + 506, + 557 + ], + "score": 1.0, + "content": ", there exists some constant", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 107, + 555, + 171, + 567 + ], + "spans": [ + { + "bbox": [ + 107, + 556, + 130, + 565 + ], + "score": 0.86, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 131, + 555, + 171, + 567 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 531, + 506, + 567 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 569, + 514, + 621 + ], + "lines": [ + { + "bbox": [ + 111, + 569, + 514, + 621 + ], + "spans": [ + { + "bbox": [ + 111, + 569, + 514, + 621 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } { { \\operatorname* { s u p } _ { 1 , \\ldots , z _ { K } } P r \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { K } ) - z _ { k } ) > 0 \\} - P r \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { K } ) - z _ { k } ) \\} } } \\\\ & { } & { \\leq c q ^ { 3 / 4 } N ^ { - 1 / 8 } ( t _ { 1 } ) \\log ^ { 1 5 / 8 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K N ( t _ { 1 } ) \\} } \\end{array}", + "type": "interline_equation", + "image_path": "397b9ec20a3891c062c68b4b9cac396b6c00dc9a6edf38e4390ea9fc7a64b942.jpg" + } + ] + } + ], + "index": 35, + "virtual_lines": [ + { + "bbox": [ + 111, + 569, + 514, + 586.3333333333334 + ], + "spans": [], + "index": 34 + }, + { + "bbox": [ + 111, + 586.3333333333334, + 514, + 603.6666666666667 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 111, + 603.6666666666667, + 514, + 621.0000000000001 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 630, + 505, + 687 + ], + "lines": [ + { + "bbox": [ + 106, + 631, + 505, + 643 + ], + "spans": [ + { + "bbox": [ + 106, + 631, + 505, + 643 + ], + "score": 1.0, + "content": "Theorem 1 implies that the approximation error depends on the number of observations obtained", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 642, + 506, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 642, + 222, + 654 + ], + "score": 1.0, + "content": "up to the first decision point", + "type": "text" + }, + { + "bbox": [ + 222, + 642, + 248, + 654 + ], + "score": 0.92, + "content": "\\bar { N ( t _ { 1 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 642, + 422, + 654 + ], + "score": 1.0, + "content": ", the maximum number of interim analyses", + "type": "text" + }, + { + "bbox": [ + 423, + 642, + 433, + 652 + ], + "score": 0.82, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 642, + 506, + 654 + ], + "score": 1.0, + "content": ", the total number", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 653, + 505, + 665 + ], + "spans": [ + { + "bbox": [ + 106, + 653, + 180, + 665 + ], + "score": 1.0, + "content": "of basis functions", + "type": "text" + }, + { + "bbox": [ + 180, + 655, + 186, + 664 + ], + "score": 0.7, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 653, + 208, + 665 + ], + "score": 1.0, + "content": ", and", + "type": "text" + }, + { + "bbox": [ + 208, + 655, + 219, + 664 + ], + "score": 0.83, + "content": "\\alpha _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 220, + 653, + 505, + 665 + ], + "score": 1.0, + "content": ", which characterizes the convergence rate of the treatment assignment", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 103, + 662, + 507, + 681 + ], + "spans": [ + { + "bbox": [ + 103, + 662, + 155, + 681 + ], + "score": 1.0, + "content": "mechanism", + "type": "text" + }, + { + "bbox": [ + 155, + 664, + 218, + 677 + ], + "score": 0.92, + "content": "\\scriptstyle \\sum _ { i = 1 } ^ { n } { n ^ { - 1 } \\pi _ { i - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 662, + 507, + 681 + ], + "score": 1.0, + "content": ". Clearly, the error will decay to zero when the followings hold with", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 105, + 675, + 206, + 688 + ], + "spans": [ + { + "bbox": [ + 105, + 675, + 206, + 688 + ], + "score": 1.0, + "content": "probability tending to 1,", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 39, + "bbox_fs": [ + 103, + 631, + 507, + 688 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 692, + 410, + 705 + ], + "lines": [ + { + "bbox": [ + 180, + 692, + 410, + 705 + ], + "spans": [ + { + "bbox": [ + 180, + 692, + 410, + 705 + ], + "score": 0.83, + "content": "q = O ( N ^ { \\alpha _ { * } } ( t _ { 1 } ) ) , \\mathrm { f o r s o m e } 0 \\leq \\alpha ^ { * } < \\operatorname* { m i n } ( 1 / 6 , \\alpha _ { 0 } / 3 ) ,", + "type": "interline_equation", + "image_path": "4a058a6d3f64b26650b6f7eae0f7f9ce154ebff761fb37cc4513baf589c1365a.jpg" + } + ] + } + ], + "index": 42, + "virtual_lines": [ + { + "bbox": [ + 180, + 692, + 410, + 705 + ], + "spans": [], + "index": 42 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 717, + 416, + 733 + ], + "lines": [ + { + "bbox": [ + 175, + 717, + 416, + 733 + ], + "spans": [ + { + "bbox": [ + 175, + 717, + 416, + 733 + ], + "score": 0.83, + "content": "\\log ( K ) \\ll \\operatorname * { m i n } \\{ N ^ { 1 / 1 5 - 2 \\alpha ^ { * } / 5 } ( t _ { 1 } ) , N ^ { ( \\alpha _ { 0 } - 3 \\alpha ^ { * } ) / ( 5 + \\alpha _ { 0 } ) } ( t _ { 1 } ) \\} .", + "type": "interline_equation", + "image_path": "895c0b209097604a0d727b4cbaeaa26a2b4721a5869715b7373d97ce85feed4c.jpg" + } + ] + } + ], + "index": 43, + "virtual_lines": [ + { + "bbox": [ + 175, + 717, + 416, + 733 + ], + "spans": [], + "index": 43 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 150 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 230, + 94 + ], + "score": 1.0, + "content": "In Appendix C, we show that", + "type": "text" + }, + { + "bbox": [ + 230, + 83, + 273, + 95 + ], + "score": 0.92, + "content": "\\alpha _ { 0 } = 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 83, + 315, + 94 + ], + "score": 1.0, + "content": ", when an", + "type": "text" + }, + { + "bbox": [ + 315, + 85, + 321, + 93 + ], + "score": 0.63, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 83, + 505, + 94 + ], + "score": 1.0, + "content": "-greedy strategy is used for randomization to", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 445, + 107 + ], + "score": 1.0, + "content": "balance the trade-off between exploration and exploitation. In this case, 6 requires", + "type": "text" + }, + { + "bbox": [ + 446, + 96, + 452, + 105 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 92, + 506, + 107 + ], + "score": 1.0, + "content": "to grow at a", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 173, + 119 + ], + "score": 1.0, + "content": "slower rate than", + "type": "text" + }, + { + "bbox": [ + 173, + 104, + 212, + 117 + ], + "score": 0.92, + "content": "N ^ { 1 / 6 } ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 104, + 404, + 119 + ], + "score": 1.0, + "content": ". This condition is automatically satisfied when", + "type": "text" + }, + { + "bbox": [ + 405, + 107, + 411, + 117 + ], + "score": 0.78, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 104, + 505, + 119 + ], + "score": 1.0, + "content": "is bounded. Condition", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 188, + 129 + ], + "score": 1.0, + "content": "7 is satisfied when", + "type": "text" + }, + { + "bbox": [ + 188, + 117, + 199, + 127 + ], + "score": 0.77, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 115, + 370, + 129 + ], + "score": 1.0, + "content": "grows polynomially fast with respect to", + "type": "text" + }, + { + "bbox": [ + 371, + 117, + 396, + 128 + ], + "score": 0.94, + "content": "N ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 115, + 466, + 129 + ], + "score": 1.0, + "content": ". In addition to", + "type": "text" + }, + { + "bbox": [ + 466, + 118, + 471, + 127 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 115, + 505, + 129 + ], + "score": 1.0, + "content": "-greedy,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 141 + ], + "score": 1.0, + "content": "other adaptive allocation procedures (e.g., upper confidence bound or Thompson sampling) could", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 138, + 183, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 183, + 151 + ], + "score": 1.0, + "content": "be applied as well.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 106, + 154, + 505, + 233 + ], + "lines": [ + { + "bbox": [ + 105, + 154, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 168 + ], + "score": 1.0, + "content": "As discussed in the introduction, the derivation of Theorem 1 is nontrivial. One way to obtain the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 166, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 505, + 179 + ], + "score": 1.0, + "content": "magnitude of the approximation error is to apply the strong approximation theorem for multidimen-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "score": 1.0, + "content": "sional martingales (see Morrow & Philipp, 1982; Zhang, 2004). However, the rate of approximation", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 188, + 506, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 506, + 201 + ], + "score": 1.0, + "content": "typically depends on the dimension and decays fast as the dimension increases. To derive Theorem", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 198, + 506, + 215 + ], + "spans": [ + { + "bbox": [ + 104, + 198, + 153, + 215 + ], + "score": 1.0, + "content": "1, we view", + "type": "text" + }, + { + "bbox": [ + 153, + 199, + 273, + 212 + ], + "score": 0.92, + "content": "\\{ \\varphi ^ { \\top } ( x ) B ( t _ { K } ) \\} _ { x \\in \\mathbb { X } , k \\in \\{ 1 , \\dots , \\kappa \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 198, + 506, + 215 + ], + "score": 1.0, + "content": "as a high-dimensional martingale and adopt the Gaussian", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 210, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 395, + 222 + ], + "score": 1.0, + "content": "approximation techniques that have been recently developed by Belloni", + "type": "text" + }, + { + "bbox": [ + 395, + 210, + 404, + 220 + ], + "score": 0.5, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 210, + 505, + 222 + ], + "score": 1.0, + "content": "Oliveira (2018). In view", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 221, + 389, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 389, + 234 + ], + "score": 1.0, + "content": "of equation 2, an application of Theorem 1 yields the following result.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9 + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 504, + 265 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 320, + 254 + ], + "score": 1.0, + "content": "Theorem 2 Assume that the conditions of Theorem", + "type": "text" + }, + { + "bbox": [ + 321, + 243, + 327, + 252 + ], + "score": 0.34, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 241, + 390, + 254 + ], + "score": 1.0, + "content": "hold, equation", + "type": "text" + }, + { + "bbox": [ + 391, + 243, + 398, + 252 + ], + "score": 0.59, + "content": "6", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 241, + 505, + 254 + ], + "score": 1.0, + "content": "and equation 7 hold with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 253, + 349, + 267 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 259, + 267 + ], + "score": 1.0, + "content": "probability tending to 1. Then for any", + "type": "text" + }, + { + "bbox": [ + 259, + 255, + 301, + 265 + ], + "score": 0.9, + "content": "z _ { 1 } , \\ldots , z _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 253, + 349, + 267 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 268, + 418, + 295 + ], + "lines": [ + { + "bbox": [ + 172, + 268, + 418, + 295 + ], + "spans": [ + { + "bbox": [ + 172, + 268, + 418, + 295 + ], + "score": 0.91, + "content": "P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} = \\alpha + o ( 1 ) ,", + "type": "interline_equation", + "image_path": "b3dcfb6d0a4d02370c10a89205f159331e576da4c293842d09aa91987e623f86.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 172, + 268, + 418, + 295 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 299, + 300, + 311 + ], + "lines": [ + { + "bbox": [ + 105, + 298, + 301, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 118, + 313 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 118, + 299, + 144, + 312 + ], + "score": 0.92, + "content": "N ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 298, + 284, + 313 + ], + "score": 1.0, + "content": "diverges to infinity, we have under", + "type": "text" + }, + { + "bbox": [ + 284, + 300, + 298, + 311 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 298, + 301, + 313 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 315, + 410, + 343 + ], + "lines": [ + { + "bbox": [ + 180, + 315, + 410, + 343 + ], + "spans": [ + { + "bbox": [ + 180, + 315, + 410, + 343 + ], + "score": 0.94, + "content": "P r \\left( \\operatorname* { m a x } _ { k \\in \\{ 1 , \\dots , K \\} } \\{ \\sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \\} > 0 \\right) \\leq \\alpha + o ( 1 ) .", + "type": "interline_equation", + "image_path": "b98d1a1e99a9e64af87f904f9f27ca276747702b53666ab57196230310ae548e.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 180, + 315, + 410, + 343 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 345, + 271, + 358 + ], + "lines": [ + { + "bbox": [ + 105, + 344, + 272, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 232, + 360 + ], + "score": 1.0, + "content": "The above equality holds when", + "type": "text" + }, + { + "bbox": [ + 233, + 346, + 268, + 358 + ], + "score": 0.93, + "content": "\\beta _ { 0 } ^ { * } = \\beta _ { 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 344, + 272, + 360 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 366, + 504, + 401 + ], + "lines": [ + { + "bbox": [ + 105, + 366, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 506, + 380 + ], + "score": 1.0, + "content": "Theorem 2 suggests that the type-I error rate of the proposed test can be well controlled. It remains", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 378, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 191, + 391 + ], + "score": 1.0, + "content": "to find critical values", + "type": "text" + }, + { + "bbox": [ + 191, + 378, + 240, + 390 + ], + "score": 0.93, + "content": "\\left\\{ z _ { k } \\right\\} _ { 1 \\leq k \\leq K }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 378, + 505, + 391 + ], + "score": 1.0, + "content": "that satisfy equation 8. In the next section, we propose a bootstrap-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 389, + 318, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 318, + 401 + ], + "score": 1.0, + "content": "assisted procedure to determine these critical values.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20 + }, + { + "type": "title", + "bbox": [ + 108, + 414, + 279, + 425 + ], + "lines": [ + { + "bbox": [ + 105, + 413, + 280, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 280, + 426 + ], + "score": 1.0, + "content": "3.2 BOOTSTRAP STOPPING BOUNDARY", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 433, + 505, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 505, + 447 + ], + "score": 1.0, + "content": "We first outline a method based on the wild bootstrap (Wu, 1986) to approximate the limiting dis-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 443, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 154, + 459 + ], + "score": 1.0, + "content": "tribution of", + "type": "text" + }, + { + "bbox": [ + 155, + 445, + 193, + 457 + ], + "score": 0.93, + "content": "\\{ S ( t _ { k } ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 443, + 505, + 459 + ], + "score": 1.0, + "content": ". Then we discuss its limitation and present our proposal, a scalable bootstrap", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 456, + 294, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 294, + 469 + ], + "score": 1.0, + "content": "algorithm to determine the stopping boundary.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 473, + 505, + 541 + ], + "lines": [ + { + "bbox": [ + 105, + 472, + 506, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 273, + 489 + ], + "score": 1.0, + "content": "The idea is to generate bootstrap samples", + "type": "text" + }, + { + "bbox": [ + 274, + 473, + 328, + 487 + ], + "score": 0.93, + "content": "\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 472, + 506, + 489 + ], + "score": 1.0, + "content": "that have asymptotically the same joint dis-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 486, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 154, + 502 + ], + "score": 1.0, + "content": "tribution as", + "type": "text" + }, + { + "bbox": [ + 154, + 487, + 226, + 501 + ], + "score": 0.93, + "content": "\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 486, + 347, + 502 + ], + "score": 1.0, + "content": ". Then the joint distribution of", + "type": "text" + }, + { + "bbox": [ + 347, + 488, + 385, + 501 + ], + "score": 0.92, + "content": "\\{ S ( t _ { k } ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 486, + 505, + 502 + ], + "score": 1.0, + "content": "can be well-approximated by", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 498, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 104, + 498, + 226, + 517 + ], + "score": 1.0, + "content": "the conditional distribution of", + "type": "text" + }, + { + "bbox": [ + 227, + 500, + 275, + 515 + ], + "score": 0.93, + "content": "\\{ \\widehat { S } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 498, + 362, + 517 + ], + "score": 1.0, + "content": "given the data, where", + "type": "text" + }, + { + "bbox": [ + 362, + 500, + 505, + 515 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\widehat { S } ^ { \\mathrm { M B } } ( t ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } } ( t ) - } \\end{array}", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 513, + 507, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 514, + 140, + 528 + ], + "score": 0.92, + "content": "\\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } } ( t ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 513, + 172, + 532 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 172, + 518, + 176, + 526 + ], + "score": 0.6, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 513, + 244, + 532 + ], + "score": 1.0, + "content": ". Specifically, let", + "type": "text" + }, + { + "bbox": [ + 245, + 516, + 277, + 528 + ], + "score": 0.92, + "content": "\\{ \\xi _ { i } \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 513, + 507, + 532 + ], + "score": 1.0, + "content": "be a sequence of i.i.d. standard normal random variables", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 523, + 339, + 545 + ], + "spans": [ + { + "bbox": [ + 104, + 523, + 169, + 545 + ], + "score": 1.0, + "content": "b independent of", + "type": "text" + }, + { + "bbox": [ + 169, + 528, + 242, + 541 + ], + "score": 0.94, + "content": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 523, + 263, + 545 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 263, + 528, + 306, + 541 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 523, + 339, + 545 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 544, + 470, + 584 + ], + "lines": [ + { + "bbox": [ + 120, + 544, + 470, + 584 + ], + "spans": [ + { + "bbox": [ + 120, + 544, + 470, + 584 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t ) = \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t ) \\left[ \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi _ { i } ( X ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } ( t ) \\} \\xi _ { i } \\right] , \\forall a \\in \\{ 0 , 1 \\} .", + "type": "interline_equation", + "image_path": "8790fb08605b7efe045ca78e191d9c17fcca9e4f6ece6a9a7844aad29a8d3aa7.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 120, + 544, + 470, + 557.3333333333334 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 120, + 557.3333333333334, + 470, + 570.6666666666667 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 120, + 570.6666666666667, + 470, + 584.0000000000001 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 587, + 506, + 654 + ], + "lines": [ + { + "bbox": [ + 104, + 587, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 104, + 587, + 231, + 604 + ], + "score": 1.0, + "content": "Both the asymptotic means of", + "type": "text" + }, + { + "bbox": [ + 231, + 587, + 289, + 603 + ], + "score": 0.94, + "content": "\\sqrt { N ( t ) } \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 587, + 309, + 604 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 309, + 587, + 393, + 602 + ], + "score": 0.92, + "content": "\\sqrt { N ( t ) } ( \\widehat { \\beta } _ { a } ( t ) - \\beta _ { a } ^ { * } )", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 587, + 506, + 604 + ], + "score": 1.0, + "content": "are zero. In addition, their", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 602, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 367, + 616 + ], + "score": 1.0, + "content": "covariance functions are asymptotically the same. By design,", + "type": "text" + }, + { + "bbox": [ + 367, + 602, + 421, + 616 + ], + "score": 0.93, + "content": "\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 602, + 505, + 616 + ], + "score": 1.0, + "content": "is multivariate nor-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 615, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 275, + 631 + ], + "score": 1.0, + "content": "mal. Similar to equation 3, we can show", + "type": "text" + }, + { + "bbox": [ + 275, + 615, + 348, + 629 + ], + "score": 0.91, + "content": "\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 616, + 505, + 631 + ], + "score": 1.0, + "content": "is asymptotically multivariate normal.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 627, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 104, + 627, + 280, + 645 + ], + "score": 1.0, + "content": "Consequently, the limiting distributions of", + "type": "text" + }, + { + "bbox": [ + 280, + 630, + 335, + 643 + ], + "score": 0.9, + "content": "\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 627, + 354, + 645 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 354, + 629, + 426, + 643 + ], + "score": 0.93, + "content": "\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 627, + 506, + 645 + ], + "score": 1.0, + "content": "are asymptotically", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 641, + 339, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 339, + 654 + ], + "score": 1.0, + "content": "equivalent. As such, the bootstrap approximation is valid.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36 + }, + { + "type": "text", + "bbox": [ + 106, + 659, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 658, + 506, + 675 + ], + "spans": [ + { + "bbox": [ + 104, + 658, + 194, + 675 + ], + "score": 1.0, + "content": "However, calculating", + "type": "text" + }, + { + "bbox": [ + 194, + 659, + 227, + 672 + ], + "score": 0.92, + "content": "\\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 658, + 264, + 675 + ], + "score": 1.0, + "content": "requires", + "type": "text" + }, + { + "bbox": [ + 264, + 660, + 306, + 672 + ], + "score": 0.91, + "content": "O ( N ( t _ { k } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 658, + 506, + 675 + ], + "score": 1.0, + "content": "operations. The time complexity of the resulting", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 200, + 684 + ], + "score": 1.0, + "content": "bootstrap algorithm is", + "type": "text" + }, + { + "bbox": [ + 200, + 672, + 250, + 684 + ], + "score": 0.92, + "content": "O ( B N ( t _ { k } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 671, + 293, + 684 + ], + "score": 1.0, + "content": "up to the", + "type": "text" + }, + { + "bbox": [ + 294, + 673, + 300, + 682 + ], + "score": 0.84, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 671, + 401, + 684 + ], + "score": 1.0, + "content": "-th interim stage, where", + "type": "text" + }, + { + "bbox": [ + 401, + 672, + 410, + 681 + ], + "score": 0.83, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 671, + 506, + 684 + ], + "score": 1.0, + "content": "is the total number of", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 102, + 677, + 509, + 700 + ], + "spans": [ + { + "bbox": [ + 102, + 677, + 320, + 700 + ], + "score": 1.0, + "content": "bootstrap samples. This can be time consuming when", + "type": "text" + }, + { + "bbox": [ + 320, + 682, + 415, + 695 + ], + "score": 0.92, + "content": "\\{ N ( t _ { k } ) - \\mathbf { \\bar { \\phi } } N ( t _ { k - 1 } ) \\} _ { k = 1 } ^ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 677, + 509, + 700 + ], + "score": 1.0, + "content": "are large. To facilitate", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 694, + 506, + 710 + ], + "spans": [ + { + "bbox": [ + 104, + 694, + 324, + 710 + ], + "score": 1.0, + "content": "the computation, we observe that in the calculation of", + "type": "text" + }, + { + "bbox": [ + 325, + 695, + 341, + 708 + ], + "score": 0.91, + "content": "{ \\widehat { \\beta } } _ { a } ^ { \\mathrm { M B } }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 694, + 506, + 710 + ], + "score": 1.0, + "content": ", the random noise is generated upon the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 707, + 504, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 482, + 723 + ], + "score": 1.0, + "content": "arrival of each observation. This is unnecessary as we aim to approximate the distribution of", + "type": "text" + }, + { + "bbox": [ + 482, + 707, + 504, + 722 + ], + "score": 0.91, + "content": "{ \\widehat \\beta } _ { a } ( \\cdot )", + "type": "inline_equation" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 721, + 241, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 241, + 733 + ], + "score": 1.0, + "content": "only at finitely many time points.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41.5 + } + ], + "page_idx": 4, + "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": "5", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 505, + 150 + ], + "lines": [ + { + "bbox": [ + 106, + 83, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 83, + 230, + 94 + ], + "score": 1.0, + "content": "In Appendix C, we show that", + "type": "text" + }, + { + "bbox": [ + 230, + 83, + 273, + 95 + ], + "score": 0.92, + "content": "\\alpha _ { 0 } = 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 83, + 315, + 94 + ], + "score": 1.0, + "content": ", when an", + "type": "text" + }, + { + "bbox": [ + 315, + 85, + 321, + 93 + ], + "score": 0.63, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 321, + 83, + 505, + 94 + ], + "score": 1.0, + "content": "-greedy strategy is used for randomization to", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 92, + 506, + 107 + ], + "spans": [ + { + "bbox": [ + 105, + 92, + 445, + 107 + ], + "score": 1.0, + "content": "balance the trade-off between exploration and exploitation. In this case, 6 requires", + "type": "text" + }, + { + "bbox": [ + 446, + 96, + 452, + 105 + ], + "score": 0.79, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 452, + 92, + 506, + 107 + ], + "score": 1.0, + "content": "to grow at a", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 505, + 119 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 173, + 119 + ], + "score": 1.0, + "content": "slower rate than", + "type": "text" + }, + { + "bbox": [ + 173, + 104, + 212, + 117 + ], + "score": 0.92, + "content": "N ^ { 1 / 6 } ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 104, + 404, + 119 + ], + "score": 1.0, + "content": ". This condition is automatically satisfied when", + "type": "text" + }, + { + "bbox": [ + 405, + 107, + 411, + 117 + ], + "score": 0.78, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 104, + 505, + 119 + ], + "score": 1.0, + "content": "is bounded. Condition", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 505, + 129 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 188, + 129 + ], + "score": 1.0, + "content": "7 is satisfied when", + "type": "text" + }, + { + "bbox": [ + 188, + 117, + 199, + 127 + ], + "score": 0.77, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 115, + 370, + 129 + ], + "score": 1.0, + "content": "grows polynomially fast with respect to", + "type": "text" + }, + { + "bbox": [ + 371, + 117, + 396, + 128 + ], + "score": 0.94, + "content": "N ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 115, + 466, + 129 + ], + "score": 1.0, + "content": ". In addition to", + "type": "text" + }, + { + "bbox": [ + 466, + 118, + 471, + 127 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 472, + 115, + 505, + 129 + ], + "score": 1.0, + "content": "-greedy,", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 126, + 505, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 126, + 505, + 141 + ], + "score": 1.0, + "content": "other adaptive allocation procedures (e.g., upper confidence bound or Thompson sampling) could", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 138, + 183, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 183, + 151 + ], + "score": 1.0, + "content": "be applied as well.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 83, + 506, + 151 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 154, + 505, + 233 + ], + "lines": [ + { + "bbox": [ + 105, + 154, + 505, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 154, + 505, + 168 + ], + "score": 1.0, + "content": "As discussed in the introduction, the derivation of Theorem 1 is nontrivial. One way to obtain the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 166, + 505, + 179 + ], + "spans": [ + { + "bbox": [ + 105, + 166, + 505, + 179 + ], + "score": 1.0, + "content": "magnitude of the approximation error is to apply the strong approximation theorem for multidimen-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 177, + 505, + 190 + ], + "score": 1.0, + "content": "sional martingales (see Morrow & Philipp, 1982; Zhang, 2004). However, the rate of approximation", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 105, + 188, + 506, + 201 + ], + "spans": [ + { + "bbox": [ + 105, + 188, + 506, + 201 + ], + "score": 1.0, + "content": "typically depends on the dimension and decays fast as the dimension increases. To derive Theorem", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 104, + 198, + 506, + 215 + ], + "spans": [ + { + "bbox": [ + 104, + 198, + 153, + 215 + ], + "score": 1.0, + "content": "1, we view", + "type": "text" + }, + { + "bbox": [ + 153, + 199, + 273, + 212 + ], + "score": 0.92, + "content": "\\{ \\varphi ^ { \\top } ( x ) B ( t _ { K } ) \\} _ { x \\in \\mathbb { X } , k \\in \\{ 1 , \\dots , \\kappa \\} }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 198, + 506, + 215 + ], + "score": 1.0, + "content": "as a high-dimensional martingale and adopt the Gaussian", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 105, + 210, + 505, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 210, + 395, + 222 + ], + "score": 1.0, + "content": "approximation techniques that have been recently developed by Belloni", + "type": "text" + }, + { + "bbox": [ + 395, + 210, + 404, + 220 + ], + "score": 0.5, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 210, + 505, + 222 + ], + "score": 1.0, + "content": "Oliveira (2018). In view", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 221, + 389, + 234 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 389, + 234 + ], + "score": 1.0, + "content": "of equation 2, an application of Theorem 1 yields the following result.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 9, + "bbox_fs": [ + 104, + 154, + 506, + 234 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 241, + 504, + 265 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 505, + 254 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 320, + 254 + ], + "score": 1.0, + "content": "Theorem 2 Assume that the conditions of Theorem", + "type": "text" + }, + { + "bbox": [ + 321, + 243, + 327, + 252 + ], + "score": 0.34, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 241, + 390, + 254 + ], + "score": 1.0, + "content": "hold, equation", + "type": "text" + }, + { + "bbox": [ + 391, + 243, + 398, + 252 + ], + "score": 0.59, + "content": "6", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 241, + 505, + 254 + ], + "score": 1.0, + "content": "and equation 7 hold with", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 253, + 349, + 267 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 259, + 267 + ], + "score": 1.0, + "content": "probability tending to 1. Then for any", + "type": "text" + }, + { + "bbox": [ + 259, + 255, + 301, + 265 + ], + "score": 0.9, + "content": "z _ { 1 } , \\ldots , z _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 302, + 253, + 349, + 267 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 241, + 505, + 267 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 268, + 418, + 295 + ], + "lines": [ + { + "bbox": [ + 172, + 268, + 418, + 295 + ], + "spans": [ + { + "bbox": [ + 172, + 268, + 418, + 295 + ], + "score": 0.91, + "content": "P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} = \\alpha + o ( 1 ) ,", + "type": "interline_equation", + "image_path": "b3dcfb6d0a4d02370c10a89205f159331e576da4c293842d09aa91987e623f86.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 172, + 268, + 418, + 295 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 299, + 300, + 311 + ], + "lines": [ + { + "bbox": [ + 105, + 298, + 301, + 313 + ], + "spans": [ + { + "bbox": [ + 105, + 298, + 118, + 313 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 118, + 299, + 144, + 312 + ], + "score": 0.92, + "content": "N ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 298, + 284, + 313 + ], + "score": 1.0, + "content": "diverges to infinity, we have under", + "type": "text" + }, + { + "bbox": [ + 284, + 300, + 298, + 311 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 298, + 301, + 313 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 298, + 301, + 313 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 315, + 410, + 343 + ], + "lines": [ + { + "bbox": [ + 180, + 315, + 410, + 343 + ], + "spans": [ + { + "bbox": [ + 180, + 315, + 410, + 343 + ], + "score": 0.94, + "content": "P r \\left( \\operatorname* { m a x } _ { k \\in \\{ 1 , \\dots , K \\} } \\{ \\sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \\} > 0 \\right) \\leq \\alpha + o ( 1 ) .", + "type": "interline_equation", + "image_path": "b98d1a1e99a9e64af87f904f9f27ca276747702b53666ab57196230310ae548e.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 180, + 315, + 410, + 343 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 345, + 271, + 358 + ], + "lines": [ + { + "bbox": [ + 105, + 344, + 272, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 344, + 232, + 360 + ], + "score": 1.0, + "content": "The above equality holds when", + "type": "text" + }, + { + "bbox": [ + 233, + 346, + 268, + 358 + ], + "score": 0.93, + "content": "\\beta _ { 0 } ^ { * } = \\beta _ { 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 344, + 272, + 360 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 344, + 272, + 360 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 366, + 504, + 401 + ], + "lines": [ + { + "bbox": [ + 105, + 366, + 506, + 380 + ], + "spans": [ + { + "bbox": [ + 105, + 366, + 506, + 380 + ], + "score": 1.0, + "content": "Theorem 2 suggests that the type-I error rate of the proposed test can be well controlled. It remains", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 378, + 505, + 391 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 191, + 391 + ], + "score": 1.0, + "content": "to find critical values", + "type": "text" + }, + { + "bbox": [ + 191, + 378, + 240, + 390 + ], + "score": 0.93, + "content": "\\left\\{ z _ { k } \\right\\} _ { 1 \\leq k \\leq K }", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 378, + 505, + 391 + ], + "score": 1.0, + "content": "that satisfy equation 8. In the next section, we propose a bootstrap-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 389, + 318, + 401 + ], + "spans": [ + { + "bbox": [ + 105, + 389, + 318, + 401 + ], + "score": 1.0, + "content": "assisted procedure to determine these critical values.", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 366, + 506, + 401 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 414, + 279, + 425 + ], + "lines": [ + { + "bbox": [ + 105, + 413, + 280, + 426 + ], + "spans": [ + { + "bbox": [ + 105, + 413, + 280, + 426 + ], + "score": 1.0, + "content": "3.2 BOOTSTRAP STOPPING BOUNDARY", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "text", + "bbox": [ + 107, + 433, + 505, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 505, + 447 + ], + "score": 1.0, + "content": "We first outline a method based on the wild bootstrap (Wu, 1986) to approximate the limiting dis-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 443, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 443, + 154, + 459 + ], + "score": 1.0, + "content": "tribution of", + "type": "text" + }, + { + "bbox": [ + 155, + 445, + 193, + 457 + ], + "score": 0.93, + "content": "\\{ S ( t _ { k } ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 443, + 505, + 459 + ], + "score": 1.0, + "content": ". Then we discuss its limitation and present our proposal, a scalable bootstrap", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 105, + 456, + 294, + 469 + ], + "spans": [ + { + "bbox": [ + 105, + 456, + 294, + 469 + ], + "score": 1.0, + "content": "algorithm to determine the stopping boundary.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 433, + 505, + 469 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 473, + 505, + 541 + ], + "lines": [ + { + "bbox": [ + 105, + 472, + 506, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 472, + 273, + 489 + ], + "score": 1.0, + "content": "The idea is to generate bootstrap samples", + "type": "text" + }, + { + "bbox": [ + 274, + 473, + 328, + 487 + ], + "score": 0.93, + "content": "\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 472, + 506, + 489 + ], + "score": 1.0, + "content": "that have asymptotically the same joint dis-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 486, + 505, + 502 + ], + "spans": [ + { + "bbox": [ + 105, + 486, + 154, + 502 + ], + "score": 1.0, + "content": "tribution as", + "type": "text" + }, + { + "bbox": [ + 154, + 487, + 226, + 501 + ], + "score": 0.93, + "content": "\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 486, + 347, + 502 + ], + "score": 1.0, + "content": ". Then the joint distribution of", + "type": "text" + }, + { + "bbox": [ + 347, + 488, + 385, + 501 + ], + "score": 0.92, + "content": "\\{ S ( t _ { k } ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 486, + 505, + 502 + ], + "score": 1.0, + "content": "can be well-approximated by", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 498, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 104, + 498, + 226, + 517 + ], + "score": 1.0, + "content": "the conditional distribution of", + "type": "text" + }, + { + "bbox": [ + 227, + 500, + 275, + 515 + ], + "score": 0.93, + "content": "\\{ \\widehat { S } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 498, + 362, + 517 + ], + "score": 1.0, + "content": "given the data, where", + "type": "text" + }, + { + "bbox": [ + 362, + 500, + 505, + 515 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\widehat { S } ^ { \\mathrm { M B } } ( t ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } } ( t ) - } \\end{array}", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 513, + 507, + 532 + ], + "spans": [ + { + "bbox": [ + 106, + 514, + 140, + 528 + ], + "score": 0.92, + "content": "\\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } } ( t ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 140, + 513, + 172, + 532 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 172, + 518, + 176, + 526 + ], + "score": 0.6, + "content": "t", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 513, + 244, + 532 + ], + "score": 1.0, + "content": ". Specifically, let", + "type": "text" + }, + { + "bbox": [ + 245, + 516, + 277, + 528 + ], + "score": 0.92, + "content": "\\{ \\xi _ { i } \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 277, + 513, + 507, + 532 + ], + "score": 1.0, + "content": "be a sequence of i.i.d. standard normal random variables", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 104, + 523, + 339, + 545 + ], + "spans": [ + { + "bbox": [ + 104, + 523, + 169, + 545 + ], + "score": 1.0, + "content": "b independent of", + "type": "text" + }, + { + "bbox": [ + 169, + 528, + 242, + 541 + ], + "score": 0.94, + "content": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 523, + 263, + 545 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 263, + 528, + 306, + 541 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 523, + 339, + 545 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 28, + "bbox_fs": [ + 104, + 472, + 507, + 545 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 544, + 470, + 584 + ], + "lines": [ + { + "bbox": [ + 120, + 544, + 470, + 584 + ], + "spans": [ + { + "bbox": [ + 120, + 544, + 470, + 584 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t ) = \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t ) \\left[ \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi _ { i } ( X ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } ( t ) \\} \\xi _ { i } \\right] , \\forall a \\in \\{ 0 , 1 \\} .", + "type": "interline_equation", + "image_path": "8790fb08605b7efe045ca78e191d9c17fcca9e4f6ece6a9a7844aad29a8d3aa7.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 120, + 544, + 470, + 557.3333333333334 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 120, + 557.3333333333334, + 470, + 570.6666666666667 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 120, + 570.6666666666667, + 470, + 584.0000000000001 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 587, + 506, + 654 + ], + "lines": [ + { + "bbox": [ + 104, + 587, + 506, + 604 + ], + "spans": [ + { + "bbox": [ + 104, + 587, + 231, + 604 + ], + "score": 1.0, + "content": "Both the asymptotic means of", + "type": "text" + }, + { + "bbox": [ + 231, + 587, + 289, + 603 + ], + "score": 0.94, + "content": "\\sqrt { N ( t ) } \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 289, + 587, + 309, + 604 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 309, + 587, + 393, + 602 + ], + "score": 0.92, + "content": "\\sqrt { N ( t ) } ( \\widehat { \\beta } _ { a } ( t ) - \\beta _ { a } ^ { * } )", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 587, + 506, + 604 + ], + "score": 1.0, + "content": "are zero. In addition, their", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 602, + 505, + 616 + ], + "spans": [ + { + "bbox": [ + 105, + 602, + 367, + 616 + ], + "score": 1.0, + "content": "covariance functions are asymptotically the same. By design,", + "type": "text" + }, + { + "bbox": [ + 367, + 602, + 421, + 616 + ], + "score": 0.93, + "content": "\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 602, + 505, + 616 + ], + "score": 1.0, + "content": "is multivariate nor-", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 615, + 505, + 631 + ], + "spans": [ + { + "bbox": [ + 105, + 616, + 275, + 631 + ], + "score": 1.0, + "content": "mal. Similar to equation 3, we can show", + "type": "text" + }, + { + "bbox": [ + 275, + 615, + 348, + 629 + ], + "score": 0.91, + "content": "\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 616, + 505, + 631 + ], + "score": 1.0, + "content": "is asymptotically multivariate normal.", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 104, + 627, + 506, + 645 + ], + "spans": [ + { + "bbox": [ + 104, + 627, + 280, + 645 + ], + "score": 1.0, + "content": "Consequently, the limiting distributions of", + "type": "text" + }, + { + "bbox": [ + 280, + 630, + 335, + 643 + ], + "score": 0.9, + "content": "\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 627, + 354, + 645 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 354, + 629, + 426, + 643 + ], + "score": 0.93, + "content": "\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }", + "type": "inline_equation" + }, + { + "bbox": [ + 427, + 627, + 506, + 645 + ], + "score": 1.0, + "content": "are asymptotically", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 105, + 641, + 339, + 654 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 339, + 654 + ], + "score": 1.0, + "content": "equivalent. As such, the bootstrap approximation is valid.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 36, + "bbox_fs": [ + 104, + 587, + 506, + 654 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 659, + 505, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 658, + 506, + 675 + ], + "spans": [ + { + "bbox": [ + 104, + 658, + 194, + 675 + ], + "score": 1.0, + "content": "However, calculating", + "type": "text" + }, + { + "bbox": [ + 194, + 659, + 227, + 672 + ], + "score": 0.92, + "content": "\\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 227, + 658, + 264, + 675 + ], + "score": 1.0, + "content": "requires", + "type": "text" + }, + { + "bbox": [ + 264, + 660, + 306, + 672 + ], + "score": 0.91, + "content": "O ( N ( t _ { k } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 306, + 658, + 506, + 675 + ], + "score": 1.0, + "content": "operations. The time complexity of the resulting", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 671, + 506, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 671, + 200, + 684 + ], + "score": 1.0, + "content": "bootstrap algorithm is", + "type": "text" + }, + { + "bbox": [ + 200, + 672, + 250, + 684 + ], + "score": 0.92, + "content": "O ( B N ( t _ { k } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 671, + 293, + 684 + ], + "score": 1.0, + "content": "up to the", + "type": "text" + }, + { + "bbox": [ + 294, + 673, + 300, + 682 + ], + "score": 0.84, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 671, + 401, + 684 + ], + "score": 1.0, + "content": "-th interim stage, where", + "type": "text" + }, + { + "bbox": [ + 401, + 672, + 410, + 681 + ], + "score": 0.83, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 671, + 506, + 684 + ], + "score": 1.0, + "content": "is the total number of", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 102, + 677, + 509, + 700 + ], + "spans": [ + { + "bbox": [ + 102, + 677, + 320, + 700 + ], + "score": 1.0, + "content": "bootstrap samples. This can be time consuming when", + "type": "text" + }, + { + "bbox": [ + 320, + 682, + 415, + 695 + ], + "score": 0.92, + "content": "\\{ N ( t _ { k } ) - \\mathbf { \\bar { \\phi } } N ( t _ { k - 1 } ) \\} _ { k = 1 } ^ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 415, + 677, + 509, + 700 + ], + "score": 1.0, + "content": "are large. To facilitate", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 104, + 694, + 506, + 710 + ], + "spans": [ + { + "bbox": [ + 104, + 694, + 324, + 710 + ], + "score": 1.0, + "content": "the computation, we observe that in the calculation of", + "type": "text" + }, + { + "bbox": [ + 325, + 695, + 341, + 708 + ], + "score": 0.91, + "content": "{ \\widehat { \\beta } } _ { a } ^ { \\mathrm { M B } }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 694, + 506, + 710 + ], + "score": 1.0, + "content": ", the random noise is generated upon the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 707, + 504, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 482, + 723 + ], + "score": 1.0, + "content": "arrival of each observation. This is unnecessary as we aim to approximate the distribution of", + "type": "text" + }, + { + "bbox": [ + 482, + 707, + 504, + 722 + ], + "score": 0.91, + "content": "{ \\widehat \\beta } _ { a } ( \\cdot )", + "type": "inline_equation" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 721, + 241, + 733 + ], + "spans": [ + { + "bbox": [ + 106, + 721, + 241, + 733 + ], + "score": 1.0, + "content": "only at finitely many time points.", + "type": "text" + } + ], + "index": 44 + } + ], + "index": 41.5, + "bbox_fs": [ + 102, + 658, + 509, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 506, + 130 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 256, + 95 + ], + "score": 1.0, + "content": "We next present our proposal. Let", + "type": "text" + }, + { + "bbox": [ + 256, + 82, + 336, + 95 + ], + "score": 0.92, + "content": "\\{ e _ { i , a } \\} _ { i = 1 , . . . , K , a = 0 , 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 81, + 433, + 95 + ], + "score": 1.0, + "content": "be a sequence of i.i.d", + "type": "text" + }, + { + "bbox": [ + 433, + 82, + 469, + 95 + ], + "score": 0.93, + "content": "N ( 0 , I _ { q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "random", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 308, + 106 + ], + "score": 1.0, + "content": "vectors independent of the observed data, where", + "type": "text" + }, + { + "bbox": [ + 308, + 95, + 318, + 106 + ], + "score": 0.85, + "content": "I _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 93, + 369, + 106 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 370, + 95, + 394, + 105 + ], + "score": 0.88, + "content": "q \\times q", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 93, + 493, + 106 + ], + "score": 1.0, + "content": "identity matrix. At the", + "type": "text" + }, + { + "bbox": [ + 494, + 94, + 500, + 104 + ], + "score": 0.77, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 104, + 504, + 121 + ], + "spans": [ + { + "bbox": [ + 104, + 104, + 227, + 121 + ], + "score": 1.0, + "content": "th interim stage, we compute", + "type": "text" + }, + { + "bbox": [ + 227, + 105, + 434, + 120 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\widehat { S } ^ { \\mathtt { M B } * } ( t _ { k } ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\bar { \\varphi } ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathtt { M B } * } ( t _ { k } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathtt { M B } * } ( t _ { k } ) \\} } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 104, + 466, + 121 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 466, + 105, + 504, + 119 + ], + "score": 0.94, + "content": "\\widehat { \\beta } _ { a } ^ { \\mathrm { M B * } } ( t _ { k } )", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 117, + 136, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 117, + 136, + 131 + ], + "score": 1.0, + "content": "equals", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 131, + 514, + 172 + ], + "lines": [ + { + "bbox": [ + 111, + 131, + 514, + 172 + ], + "spans": [ + { + "bbox": [ + 111, + 131, + 514, + 172 + ], + "score": 0.88, + "content": "\\frac { 1 } { \\mathrm { V } ( t _ { k } ) } \\sum _ { j = 1 } ^ { k } \\left( \\sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ( X _ { i } ) ^ { \\top } \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\right) ^ { 1 / 2 } e _ { j , a } .", + "type": "interline_equation", + "image_path": "dfcad42d203a5d4d843a534acaa920afa3d5e7c642d2baf3838e73de3a39320f.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 111, + 131, + 514, + 144.66666666666666 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 111, + 144.66666666666666, + 514, + 158.33333333333331 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 111, + 158.33333333333331, + 514, + 171.99999999999997 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 174, + 508, + 203 + ], + "lines": [ + { + "bbox": [ + 104, + 172, + 506, + 191 + ], + "spans": [ + { + "bbox": [ + 104, + 172, + 146, + 191 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 146, + 176, + 158, + 187 + ], + "score": 0.87, + "content": "k _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 172, + 182, + 191 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 183, + 176, + 194, + 187 + ], + "score": 0.86, + "content": "k _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 172, + 335, + 191 + ], + "score": 1.0, + "content": ", the conditional covariance of", + "type": "text" + }, + { + "bbox": [ + 335, + 174, + 483, + 189 + ], + "score": 0.87, + "content": "\\sqrt { N ( t _ { k _ { 1 } } ) } \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k _ { 1 } } ) \\ - \\ \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k _ { 1 } } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 172, + 506, + 191 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 187, + 279, + 204 + ], + "spans": [ + { + "bbox": [ + 107, + 188, + 248, + 203 + ], + "score": 0.88, + "content": "\\sqrt { N ( t _ { k _ { 2 } } ) } \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k _ { 2 } } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k _ { 2 } } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 187, + 279, + 204 + ], + "score": 1.0, + "content": "equals", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 204, + 514, + 241 + ], + "lines": [ + { + "bbox": [ + 111, + 204, + 514, + 241 + ], + "spans": [ + { + "bbox": [ + 111, + 204, + 514, + 241 + ], + "score": 0.88, + "content": "\\frac { 1 } { \\sqrt { N ( t _ { k _ { 1 } } ) N ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { k _ { 1 } } ) ,", + "type": "interline_equation", + "image_path": "0d6dd609f91ae7c2afb3f8619227b0cb8030b849f5a53fe8e2f250befe4129ee.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 111, + 204, + 514, + 216.33333333333334 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 111, + 216.33333333333334, + 514, + 228.66666666666669 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 111, + 228.66666666666669, + 514, + 241.00000000000003 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 242, + 352, + 254 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 352, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 352, + 255 + ], + "score": 1.0, + "content": "Under the given conditions in Theorem 1, it is to converge to", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 255, + 405, + 288 + ], + "lines": [ + { + "bbox": [ + 186, + 255, + 405, + 288 + ], + "spans": [ + { + "bbox": [ + 186, + 255, + 405, + 288 + ], + "score": 0.92, + "content": "\\frac { \\sqrt { N ( t _ { k _ { 1 } } ) } } { \\sqrt { N ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\Sigma _ { a } ^ { - 1 } \\Phi ( a ) \\Sigma _ { a } ^ { - 1 } = \\mathrm { C o v } ( G ( t _ { k _ { 1 } } ) , G ( t _ { k _ { 2 } } ) ) .", + "type": "interline_equation", + "image_path": "a326351e96bc660ab14f125d6ad896fc077b66eb144aeb465975f64eec0cfaf8.jpg" + } + ] + } + ], + "index": 13.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 255, + 405, + 271.5 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 186, + 271.5, + 405, + 288.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 291, + 506, + 332 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 156, + 307 + ], + "score": 1.0, + "content": "This means", + "type": "text" + }, + { + "bbox": [ + 157, + 290, + 299, + 305 + ], + "score": 0.92, + "content": "\\{ \\sqrt { N ( t _ { k } ) } ( \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } ^ { * } } ( t _ { k } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } ^ { * } } ( t _ { k } ) ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 289, + 319, + 307 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 319, + 292, + 359, + 305 + ], + "score": 0.93, + "content": "\\{ G ( t _ { k } ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 289, + 506, + 307 + ], + "score": 1.0, + "content": "have the same asymptotic distribu-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 303, + 507, + 321 + ], + "spans": [ + { + "bbox": [ + 104, + 303, + 191, + 321 + ], + "score": 1.0, + "content": "tion. Consequently,", + "type": "text" + }, + { + "bbox": [ + 191, + 305, + 289, + 319 + ], + "score": 0.92, + "content": "\\{ \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { k } ) \\} _ { k = 1 } ^ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 303, + 507, + 321 + ], + "score": 1.0, + "content": "can be used to approximate the joint distribution of", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 107, + 311, + 222, + 336 + ], + "spans": [ + { + "bbox": [ + 107, + 317, + 216, + 332 + ], + "score": 0.91, + "content": "\\{ \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) \\} _ { k = 1 } ^ { \\cdot }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 311, + 222, + 336 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 104, + 334, + 506, + 349 + ], + "spans": [ + { + "bbox": [ + 104, + 334, + 149, + 349 + ], + "score": 1.0, + "content": "To choose", + "type": "text" + }, + { + "bbox": [ + 150, + 335, + 175, + 348 + ], + "score": 0.92, + "content": "\\{ z _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 334, + 328, + 349 + ], + "score": 1.0, + "content": "that satisfies equation 8, we adopt the", + "type": "text" + }, + { + "bbox": [ + 328, + 338, + 336, + 345 + ], + "score": 0.79, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 334, + 506, + 349 + ], + "score": 1.0, + "content": "-spending approach that allocates the total", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 347, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 505, + 359 + ], + "score": 1.0, + "content": "allowable type I error at each interim stage according to an error-spending function. This guarantees", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 352, + 370 + ], + "score": 1.0, + "content": "our test controls the type-I error. We begin by specifying an", + "type": "text" + }, + { + "bbox": [ + 352, + 360, + 360, + 367 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 357, + 436, + 370 + ], + "score": 1.0, + "content": "spending function", + "type": "text" + }, + { + "bbox": [ + 437, + 358, + 455, + 370 + ], + "score": 0.92, + "content": "\\alpha ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "that is non-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 369, + 418, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 200, + 381 + ], + "score": 1.0, + "content": "increasing and satisfies", + "type": "text" + }, + { + "bbox": [ + 201, + 369, + 239, + 381 + ], + "score": 0.86, + "content": "\\alpha ( 0 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 369, + 243, + 381 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 244, + 369, + 285, + 381 + ], + "score": 0.82, + "content": "\\alpha ( T ) = \\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 369, + 366, + 381 + ], + "score": 1.0, + "content": ". Popular choices of", + "type": "text" + }, + { + "bbox": [ + 367, + 369, + 384, + 381 + ], + "score": 0.91, + "content": "\\alpha ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 369, + 418, + 381 + ], + "score": 1.0, + "content": "include", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5 + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 383, + 471, + 413 + ], + "lines": [ + { + "bbox": [ + 130, + 383, + 471, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 383, + 471, + 413 + ], + "score": 0.72, + "content": "\\alpha _ { 1 } ( t ) = \\alpha \\log \\left( 1 + ( e - 1 ) \\frac { t } { T } \\right) , \\quad \\quad \\quad \\quad \\alpha _ { 2 } ( t ) = 2 - 2 \\Phi \\left( \\frac { \\Phi ^ { - 1 } ( 1 - \\alpha / 2 ) \\sqrt { T } } { \\sqrt { t } } \\right) ,", + "type": "interline_equation", + "image_path": "e8067e9915e5e58b5155aff2c5490d21f7299fc448228f7e4529f002c825e0a8.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 130, + 383, + 471, + 393.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 130, + 393.0, + 471, + 403.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 130, + 403.0, + 471, + 413.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 140, + 416, + 471, + 445 + ], + "lines": [ + { + "bbox": [ + 140, + 416, + 471, + 445 + ], + "spans": [ + { + "bbox": [ + 140, + 416, + 471, + 445 + ], + "score": 0.71, + "content": "\\alpha _ { 3 } ( t ) = \\alpha \\left( \\frac { t } { T } \\right) ^ { \\theta } , \\mathrm { f o r } \\theta > 0 , \\alpha _ { 4 } ( t ) = \\alpha \\frac { 1 - \\exp ( - \\gamma t / T ) } { 1 - \\exp ( - \\gamma ) } , \\mathrm { f o r } \\gamma \\neq 0 ,", + "type": "interline_equation", + "image_path": "dc4e04931872ce685b700c7507abf0cd6a224fafabb61335b0afb5cf98ddf7a8.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 140, + 416, + 471, + 425.6666666666667 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 140, + 425.6666666666667, + 471, + 435.33333333333337 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 140, + 435.33333333333337, + 471, + 445.00000000000006 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 447, + 505, + 470 + ], + "lines": [ + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 133, + 459 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 447, + 152, + 459 + ], + "score": 0.91, + "content": "\\Phi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 445, + 465, + 459 + ], + "score": 1.0, + "content": "denotes the cumulative distribution function of a standard normal variable and", + "type": "text" + }, + { + "bbox": [ + 465, + 446, + 494, + 459 + ], + "score": 0.92, + "content": "\\Phi ^ { - 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 445, + 505, + 459 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 457, + 491, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 231, + 470 + ], + "score": 1.0, + "content": "its quantile function. Based on", + "type": "text" + }, + { + "bbox": [ + 231, + 458, + 249, + 470 + ], + "score": 0.91, + "content": "\\alpha ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 457, + 347, + 470 + ], + "score": 1.0, + "content": ", we iteratively calculate", + "type": "text" + }, + { + "bbox": [ + 348, + 458, + 417, + 469 + ], + "score": 0.92, + "content": "\\widehat { z } _ { k } , k = 1 , \\ldots , K", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 457, + 491, + 470 + ], + "score": 1.0, + "content": "as the solution of", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5 + }, + { + "type": "interline_equation", + "bbox": [ + 105, + 470, + 496, + 498 + ], + "lines": [ + { + "bbox": [ + 105, + 470, + 496, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 496, + 498 + ], + "score": 0.92, + "content": "\\mathrm { P r } ^ { * } \\left\\{ \\operatorname* { m a x } _ { j \\in \\{ 1 , \\dots , k - 1 \\} } \\left( \\sqrt { N ( t _ { j } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { j } ) - \\widehat { z } _ { j } \\right) \\leq 0 , \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { k } ) > \\widehat { z } _ { k } \\right\\} = \\alpha ( t _ { k } ) - \\alpha ( t _ { k - 1 } ) ,", + "type": "interline_equation", + "image_path": "aeaeca618a81428e399389f57b7f9acd0253cd5f1526ba9c8d5667060c5c6598.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 105, + 470, + 496, + 498 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 500, + 344, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 500, + 343, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 148, + 515 + ], + "score": 1.0, + "content": "and reject", + "type": "text" + }, + { + "bbox": [ + 148, + 501, + 162, + 512 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 500, + 188, + 515 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 188, + 500, + 269, + 514 + ], + "score": 0.92, + "content": "\\sqrt { N ( t _ { k } ) } S ( t _ { k } ) > \\widehat { z } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 500, + 332, + 515 + ], + "score": 1.0, + "content": "holds for some", + "type": "text" + }, + { + "bbox": [ + 333, + 502, + 339, + 511 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 500, + 343, + 515 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "text", + "bbox": [ + 105, + 518, + 409, + 530 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 411, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 411, + 531 + ], + "score": 1.0, + "content": "The validity of the bootstrap test is summarized in Theorems 3 and 4 below.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 105, + 538, + 504, + 562 + ], + "lines": [ + { + "bbox": [ + 106, + 538, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 302, + 552 + ], + "score": 1.0, + "content": "Theorem 3 Assume the conditions in Theorem", + "type": "text" + }, + { + "bbox": [ + 302, + 540, + 308, + 549 + ], + "score": 0.46, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 538, + 370, + 552 + ], + "score": 1.0, + "content": "hold. Assume", + "type": "text" + }, + { + "bbox": [ + 371, + 538, + 443, + 551 + ], + "score": 0.91, + "content": "q = O ( N ^ { \\alpha ^ { * } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 538, + 485, + 552 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 485, + 539, + 505, + 550 + ], + "score": 0.81, + "content": "0 ~ <", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 549, + 436, + 563 + ], + "spans": [ + { + "bbox": [ + 107, + 550, + 147, + 562 + ], + "score": 0.9, + "content": "\\alpha ^ { * } < 1 / 3", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 549, + 376, + 563 + ], + "score": 1.0, + "content": ", almost surely. Then conditional on the counting process", + "type": "text" + }, + { + "bbox": [ + 376, + 551, + 396, + 562 + ], + "score": 0.91, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 549, + 436, + 563 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 563, + 514, + 614 + ], + "lines": [ + { + "bbox": [ + 111, + 563, + 514, + 614 + ], + "spans": [ + { + "bbox": [ + 111, + 563, + 514, + 614 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\underset { 1 , \\cdots , z _ { K } } { \\operatorname* { s u p } } \\left| P r ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { M B * } ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} - P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) \\right\\} \\right| } \\\\ { \\leq c \\left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \\log ^ { 1 1 / 6 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K \\} \\right] , } \\end{array}", + "type": "interline_equation", + "image_path": "de49dfc406302225aa201259fc74efe00181ec2000bba22e090a0b76e9b8ea06.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 111, + 563, + 514, + 580.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 111, + 580.0, + 514, + 597.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 111, + 597.0, + 514, + 614.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 614, + 506, + 640 + ], + "lines": [ + { + "bbox": [ + 104, + 613, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 104, + 613, + 183, + 628 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 184, + 615, + 213, + 625 + ], + "score": 0.89, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 613, + 317, + 628 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 318, + 614, + 394, + 626 + ], + "score": 0.89, + "content": "1 - O ( N ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 613, + 427, + 628 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 427, + 614, + 453, + 627 + ], + "score": 0.91, + "content": "\\textstyle P r ^ { * } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 613, + 506, + 628 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 102, + 621, + 385, + 645 + ], + "spans": [ + { + "bbox": [ + 102, + 621, + 313, + 645 + ], + "score": 1.0, + "content": "probability measure conditional on the data stream", + "type": "text" + }, + { + "bbox": [ + 314, + 626, + 379, + 639 + ], + "score": 0.91, + "content": "\\{ X _ { i } , A _ { i } , Y _ { i } \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 621, + 385, + 645 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5 + }, + { + "type": "text", + "bbox": [ + 104, + 645, + 506, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 645, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 407, + 659 + ], + "score": 1.0, + "content": "Theorem 4 Assume the conditions in Theorem 3 hold. Then conditional on", + "type": "text" + }, + { + "bbox": [ + 408, + 646, + 428, + 659 + ], + "score": 0.91, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 645, + 505, + 659 + ], + "score": 1.0, + "content": ", the critical values", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 107, + 656, + 162, + 671 + ], + "spans": [ + { + "bbox": [ + 107, + 657, + 132, + 669 + ], + "score": 0.92, + "content": "\\{ \\widehat { z } _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 656, + 162, + 671 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5 + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 670, + 478, + 721 + ], + "lines": [ + { + "bbox": [ + 141, + 670, + 478, + 721 + ], + "spans": [ + { + "bbox": [ + 141, + 670, + 478, + 721 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\left| P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\widehat z _ { k } \\right) > 0 \\right\\} - \\alpha \\right| } \\\\ { \\leq } & { c \\left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \\log ^ { 1 1 / 6 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K N ( t _ { 1 } ) \\} \\right] , } \\end{array}", + "type": "interline_equation", + "image_path": "8c089c17dd33e098e259d6459ffda19963916b3833f083f83b76ee31e36a0894.jpg" + } + ] + } + ], + "index": 43, + "virtual_lines": [ + { + "bbox": [ + 141, + 670, + 478, + 687.0 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 141, + 687.0, + 478, + 704.0 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 141, + 704.0, + 478, + 721.0 + ], + "spans": [], + "index": 44 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 721, + 206, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 720, + 207, + 733 + ], + "spans": [ + { + "bbox": [ + 104, + 720, + 180, + 733 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 722, + 203, + 731 + ], + "score": 0.8, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 720, + 207, + 733 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45 + } + ], + "page_idx": 5, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 302, + 751, + 309, + 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": [ + 106, + 81, + 506, + 130 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 256, + 95 + ], + "score": 1.0, + "content": "We next present our proposal. Let", + "type": "text" + }, + { + "bbox": [ + 256, + 82, + 336, + 95 + ], + "score": 0.92, + "content": "\\{ e _ { i , a } \\} _ { i = 1 , . . . , K , a = 0 , 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 81, + 433, + 95 + ], + "score": 1.0, + "content": "be a sequence of i.i.d", + "type": "text" + }, + { + "bbox": [ + 433, + 82, + 469, + 95 + ], + "score": 0.93, + "content": "N ( 0 , I _ { q } )", + "type": "inline_equation" + }, + { + "bbox": [ + 470, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "random", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 308, + 106 + ], + "score": 1.0, + "content": "vectors independent of the observed data, where", + "type": "text" + }, + { + "bbox": [ + 308, + 95, + 318, + 106 + ], + "score": 0.85, + "content": "I _ { q }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 93, + 369, + 106 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + }, + { + "bbox": [ + 370, + 95, + 394, + 105 + ], + "score": 0.88, + "content": "q \\times q", + "type": "inline_equation" + }, + { + "bbox": [ + 395, + 93, + 493, + 106 + ], + "score": 1.0, + "content": "identity matrix. At the", + "type": "text" + }, + { + "bbox": [ + 494, + 94, + 500, + 104 + ], + "score": 0.77, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 104, + 104, + 504, + 121 + ], + "spans": [ + { + "bbox": [ + 104, + 104, + 227, + 121 + ], + "score": 1.0, + "content": "th interim stage, we compute", + "type": "text" + }, + { + "bbox": [ + 227, + 105, + 434, + 120 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\widehat { S } ^ { \\mathtt { M B } * } ( t _ { k } ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\bar { \\varphi } ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathtt { M B } * } ( t _ { k } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathtt { M B } * } ( t _ { k } ) \\} } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 435, + 104, + 466, + 121 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 466, + 105, + 504, + 119 + ], + "score": 0.94, + "content": "\\widehat { \\beta } _ { a } ^ { \\mathrm { M B * } } ( t _ { k } )", + "type": "inline_equation" + } + ], + "index": 2 + }, + { + "bbox": [ + 104, + 117, + 136, + 131 + ], + "spans": [ + { + "bbox": [ + 104, + 117, + 136, + 131 + ], + "score": 1.0, + "content": "equals", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 1.5, + "bbox_fs": [ + 104, + 81, + 505, + 131 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 131, + 514, + 172 + ], + "lines": [ + { + "bbox": [ + 111, + 131, + 514, + 172 + ], + "spans": [ + { + "bbox": [ + 111, + 131, + 514, + 172 + ], + "score": 0.88, + "content": "\\frac { 1 } { \\mathrm { V } ( t _ { k } ) } \\sum _ { j = 1 } ^ { k } \\left( \\sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ( X _ { i } ) ^ { \\top } \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\right) ^ { 1 / 2 } e _ { j , a } .", + "type": "interline_equation", + "image_path": "dfcad42d203a5d4d843a534acaa920afa3d5e7c642d2baf3838e73de3a39320f.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 111, + 131, + 514, + 144.66666666666666 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 111, + 144.66666666666666, + 514, + 158.33333333333331 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 111, + 158.33333333333331, + 514, + 171.99999999999997 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 174, + 508, + 203 + ], + "lines": [ + { + "bbox": [ + 104, + 172, + 506, + 191 + ], + "spans": [ + { + "bbox": [ + 104, + 172, + 146, + 191 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 146, + 176, + 158, + 187 + ], + "score": 0.87, + "content": "k _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 158, + 172, + 182, + 191 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 183, + 176, + 194, + 187 + ], + "score": 0.86, + "content": "k _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 172, + 335, + 191 + ], + "score": 1.0, + "content": ", the conditional covariance of", + "type": "text" + }, + { + "bbox": [ + 335, + 174, + 483, + 189 + ], + "score": 0.87, + "content": "\\sqrt { N ( t _ { k _ { 1 } } ) } \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k _ { 1 } } ) \\ - \\ \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k _ { 1 } } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 484, + 172, + 506, + 191 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 107, + 187, + 279, + 204 + ], + "spans": [ + { + "bbox": [ + 107, + 188, + 248, + 203 + ], + "score": 0.88, + "content": "\\sqrt { N ( t _ { k _ { 2 } } ) } \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k _ { 2 } } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k _ { 2 } } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 187, + 279, + 204 + ], + "score": 1.0, + "content": "equals", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 104, + 172, + 506, + 204 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 204, + 514, + 241 + ], + "lines": [ + { + "bbox": [ + 111, + 204, + 514, + 241 + ], + "spans": [ + { + "bbox": [ + 111, + 204, + 514, + 241 + ], + "score": 0.88, + "content": "\\frac { 1 } { \\sqrt { N ( t _ { k _ { 1 } } ) N ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { k _ { 1 } } ) ,", + "type": "interline_equation", + "image_path": "0d6dd609f91ae7c2afb3f8619227b0cb8030b849f5a53fe8e2f250befe4129ee.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 111, + 204, + 514, + 216.33333333333334 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 111, + 216.33333333333334, + 514, + 228.66666666666669 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 111, + 228.66666666666669, + 514, + 241.00000000000003 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 242, + 352, + 254 + ], + "lines": [ + { + "bbox": [ + 106, + 241, + 352, + 255 + ], + "spans": [ + { + "bbox": [ + 106, + 241, + 352, + 255 + ], + "score": 1.0, + "content": "Under the given conditions in Theorem 1, it is to converge to", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 241, + 352, + 255 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 255, + 405, + 288 + ], + "lines": [ + { + "bbox": [ + 186, + 255, + 405, + 288 + ], + "spans": [ + { + "bbox": [ + 186, + 255, + 405, + 288 + ], + "score": 0.92, + "content": "\\frac { \\sqrt { N ( t _ { k _ { 1 } } ) } } { \\sqrt { N ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\Sigma _ { a } ^ { - 1 } \\Phi ( a ) \\Sigma _ { a } ^ { - 1 } = \\mathrm { C o v } ( G ( t _ { k _ { 1 } } ) , G ( t _ { k _ { 2 } } ) ) .", + "type": "interline_equation", + "image_path": "a326351e96bc660ab14f125d6ad896fc077b66eb144aeb465975f64eec0cfaf8.jpg" + } + ] + } + ], + "index": 13.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 255, + 405, + 271.5 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 186, + 271.5, + 405, + 288.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 291, + 506, + 332 + ], + "lines": [ + { + "bbox": [ + 105, + 289, + 506, + 307 + ], + "spans": [ + { + "bbox": [ + 105, + 289, + 156, + 307 + ], + "score": 1.0, + "content": "This means", + "type": "text" + }, + { + "bbox": [ + 157, + 290, + 299, + 305 + ], + "score": 0.92, + "content": "\\{ \\sqrt { N ( t _ { k } ) } ( \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } ^ { * } } ( t _ { k } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } ^ { * } } ( t _ { k } ) ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 289, + 319, + 307 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 319, + 292, + 359, + 305 + ], + "score": 0.93, + "content": "\\{ G ( t _ { k } ) \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 289, + 506, + 307 + ], + "score": 1.0, + "content": "have the same asymptotic distribu-", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 104, + 303, + 507, + 321 + ], + "spans": [ + { + "bbox": [ + 104, + 303, + 191, + 321 + ], + "score": 1.0, + "content": "tion. Consequently,", + "type": "text" + }, + { + "bbox": [ + 191, + 305, + 289, + 319 + ], + "score": 0.92, + "content": "\\{ \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { k } ) \\} _ { k = 1 } ^ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 303, + 507, + 321 + ], + "score": 1.0, + "content": "can be used to approximate the joint distribution of", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 107, + 311, + 222, + 336 + ], + "spans": [ + { + "bbox": [ + 107, + 317, + 216, + 332 + ], + "score": 0.91, + "content": "\\{ \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) \\} _ { k = 1 } ^ { \\cdot }", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 311, + 222, + 336 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 104, + 289, + 507, + 336 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 335, + 505, + 381 + ], + "lines": [ + { + "bbox": [ + 104, + 334, + 506, + 349 + ], + "spans": [ + { + "bbox": [ + 104, + 334, + 149, + 349 + ], + "score": 1.0, + "content": "To choose", + "type": "text" + }, + { + "bbox": [ + 150, + 335, + 175, + 348 + ], + "score": 0.92, + "content": "\\{ z _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 175, + 334, + 328, + 349 + ], + "score": 1.0, + "content": "that satisfies equation 8, we adopt the", + "type": "text" + }, + { + "bbox": [ + 328, + 338, + 336, + 345 + ], + "score": 0.79, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 334, + 506, + 349 + ], + "score": 1.0, + "content": "-spending approach that allocates the total", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 347, + 505, + 359 + ], + "spans": [ + { + "bbox": [ + 106, + 347, + 505, + 359 + ], + "score": 1.0, + "content": "allowable type I error at each interim stage according to an error-spending function. This guarantees", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 357, + 505, + 370 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 352, + 370 + ], + "score": 1.0, + "content": "our test controls the type-I error. We begin by specifying an", + "type": "text" + }, + { + "bbox": [ + 352, + 360, + 360, + 367 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 357, + 436, + 370 + ], + "score": 1.0, + "content": "spending function", + "type": "text" + }, + { + "bbox": [ + 437, + 358, + 455, + 370 + ], + "score": 0.92, + "content": "\\alpha ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 357, + 505, + 370 + ], + "score": 1.0, + "content": "that is non-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 369, + 418, + 381 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 200, + 381 + ], + "score": 1.0, + "content": "increasing and satisfies", + "type": "text" + }, + { + "bbox": [ + 201, + 369, + 239, + 381 + ], + "score": 0.86, + "content": "\\alpha ( 0 ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 369, + 243, + 381 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 244, + 369, + 285, + 381 + ], + "score": 0.82, + "content": "\\alpha ( T ) = \\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 286, + 369, + 366, + 381 + ], + "score": 1.0, + "content": ". Popular choices of", + "type": "text" + }, + { + "bbox": [ + 367, + 369, + 384, + 381 + ], + "score": 0.91, + "content": "\\alpha ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 385, + 369, + 418, + 381 + ], + "score": 1.0, + "content": "include", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 19.5, + "bbox_fs": [ + 104, + 334, + 506, + 381 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 383, + 471, + 413 + ], + "lines": [ + { + "bbox": [ + 130, + 383, + 471, + 413 + ], + "spans": [ + { + "bbox": [ + 130, + 383, + 471, + 413 + ], + "score": 0.72, + "content": "\\alpha _ { 1 } ( t ) = \\alpha \\log \\left( 1 + ( e - 1 ) \\frac { t } { T } \\right) , \\quad \\quad \\quad \\quad \\alpha _ { 2 } ( t ) = 2 - 2 \\Phi \\left( \\frac { \\Phi ^ { - 1 } ( 1 - \\alpha / 2 ) \\sqrt { T } } { \\sqrt { t } } \\right) ,", + "type": "interline_equation", + "image_path": "e8067e9915e5e58b5155aff2c5490d21f7299fc448228f7e4529f002c825e0a8.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 130, + 383, + 471, + 393.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 130, + 393.0, + 471, + 403.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 130, + 403.0, + 471, + 413.0 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 140, + 416, + 471, + 445 + ], + "lines": [ + { + "bbox": [ + 140, + 416, + 471, + 445 + ], + "spans": [ + { + "bbox": [ + 140, + 416, + 471, + 445 + ], + "score": 0.71, + "content": "\\alpha _ { 3 } ( t ) = \\alpha \\left( \\frac { t } { T } \\right) ^ { \\theta } , \\mathrm { f o r } \\theta > 0 , \\alpha _ { 4 } ( t ) = \\alpha \\frac { 1 - \\exp ( - \\gamma t / T ) } { 1 - \\exp ( - \\gamma ) } , \\mathrm { f o r } \\gamma \\neq 0 ,", + "type": "interline_equation", + "image_path": "dc4e04931872ce685b700c7507abf0cd6a224fafabb61335b0afb5cf98ddf7a8.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 140, + 416, + 471, + 425.6666666666667 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 140, + 425.6666666666667, + 471, + 435.33333333333337 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 140, + 435.33333333333337, + 471, + 445.00000000000006 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 447, + 505, + 470 + ], + "lines": [ + { + "bbox": [ + 105, + 445, + 505, + 459 + ], + "spans": [ + { + "bbox": [ + 105, + 445, + 133, + 459 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 447, + 152, + 459 + ], + "score": 0.91, + "content": "\\Phi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 445, + 465, + 459 + ], + "score": 1.0, + "content": "denotes the cumulative distribution function of a standard normal variable and", + "type": "text" + }, + { + "bbox": [ + 465, + 446, + 494, + 459 + ], + "score": 0.92, + "content": "\\Phi ^ { - 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 495, + 445, + 505, + 459 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 457, + 491, + 470 + ], + "spans": [ + { + "bbox": [ + 105, + 457, + 231, + 470 + ], + "score": 1.0, + "content": "its quantile function. Based on", + "type": "text" + }, + { + "bbox": [ + 231, + 458, + 249, + 470 + ], + "score": 0.91, + "content": "\\alpha ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 457, + 347, + 470 + ], + "score": 1.0, + "content": ", we iteratively calculate", + "type": "text" + }, + { + "bbox": [ + 348, + 458, + 417, + 469 + ], + "score": 0.92, + "content": "\\widehat { z } _ { k } , k = 1 , \\ldots , K", + "type": "inline_equation" + }, + { + "bbox": [ + 418, + 457, + 491, + 470 + ], + "score": 1.0, + "content": "as the solution of", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 445, + 505, + 470 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 105, + 470, + 496, + 498 + ], + "lines": [ + { + "bbox": [ + 105, + 470, + 496, + 498 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 496, + 498 + ], + "score": 0.92, + "content": "\\mathrm { P r } ^ { * } \\left\\{ \\operatorname* { m a x } _ { j \\in \\{ 1 , \\dots , k - 1 \\} } \\left( \\sqrt { N ( t _ { j } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { j } ) - \\widehat { z } _ { j } \\right) \\leq 0 , \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { k } ) > \\widehat { z } _ { k } \\right\\} = \\alpha ( t _ { k } ) - \\alpha ( t _ { k - 1 } ) ,", + "type": "interline_equation", + "image_path": "aeaeca618a81428e399389f57b7f9acd0253cd5f1526ba9c8d5667060c5c6598.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 105, + 470, + 496, + 498 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 500, + 344, + 514 + ], + "lines": [ + { + "bbox": [ + 106, + 500, + 343, + 515 + ], + "spans": [ + { + "bbox": [ + 106, + 500, + 148, + 515 + ], + "score": 1.0, + "content": "and reject", + "type": "text" + }, + { + "bbox": [ + 148, + 501, + 162, + 512 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 500, + 188, + 515 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 188, + 500, + 269, + 514 + ], + "score": 0.92, + "content": "\\sqrt { N ( t _ { k } ) } S ( t _ { k } ) > \\widehat { z } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 500, + 332, + 515 + ], + "score": 1.0, + "content": "holds for some", + "type": "text" + }, + { + "bbox": [ + 333, + 502, + 339, + 511 + ], + "score": 0.81, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 339, + 500, + 343, + 515 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31, + "bbox_fs": [ + 106, + 500, + 343, + 515 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 518, + 409, + 530 + ], + "lines": [ + { + "bbox": [ + 105, + 517, + 411, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 517, + 411, + 531 + ], + "score": 1.0, + "content": "The validity of the bootstrap test is summarized in Theorems 3 and 4 below.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 517, + 411, + 531 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 538, + 504, + 562 + ], + "lines": [ + { + "bbox": [ + 106, + 538, + 505, + 552 + ], + "spans": [ + { + "bbox": [ + 106, + 538, + 302, + 552 + ], + "score": 1.0, + "content": "Theorem 3 Assume the conditions in Theorem", + "type": "text" + }, + { + "bbox": [ + 302, + 540, + 308, + 549 + ], + "score": 0.46, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 308, + 538, + 370, + 552 + ], + "score": 1.0, + "content": "hold. Assume", + "type": "text" + }, + { + "bbox": [ + 371, + 538, + 443, + 551 + ], + "score": 0.91, + "content": "q = O ( N ^ { \\alpha ^ { * } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 444, + 538, + 485, + 552 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 485, + 539, + 505, + 550 + ], + "score": 0.81, + "content": "0 ~ <", + "type": "inline_equation" + } + ], + "index": 33 + }, + { + "bbox": [ + 107, + 549, + 436, + 563 + ], + "spans": [ + { + "bbox": [ + 107, + 550, + 147, + 562 + ], + "score": 0.9, + "content": "\\alpha ^ { * } < 1 / 3", + "type": "inline_equation" + }, + { + "bbox": [ + 147, + 549, + 376, + 563 + ], + "score": 1.0, + "content": ", almost surely. Then conditional on the counting process", + "type": "text" + }, + { + "bbox": [ + 376, + 551, + 396, + 562 + ], + "score": 0.91, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 549, + 436, + 563 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 106, + 538, + 505, + 563 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 563, + 514, + 614 + ], + "lines": [ + { + "bbox": [ + 111, + 563, + 514, + 614 + ], + "spans": [ + { + "bbox": [ + 111, + 563, + 514, + 614 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\underset { 1 , \\cdots , z _ { K } } { \\operatorname* { s u p } } \\left| P r ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { M B * } ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} - P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) \\right\\} \\right| } \\\\ { \\leq c \\left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \\log ^ { 1 1 / 6 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K \\} \\right] , } \\end{array}", + "type": "interline_equation", + "image_path": "de49dfc406302225aa201259fc74efe00181ec2000bba22e090a0b76e9b8ea06.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 111, + 563, + 514, + 580.0 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 111, + 580.0, + 514, + 597.0 + ], + "spans": [], + "index": 36 + }, + { + "bbox": [ + 111, + 597.0, + 514, + 614.0 + ], + "spans": [], + "index": 37 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 614, + 506, + 640 + ], + "lines": [ + { + "bbox": [ + 104, + 613, + 506, + 628 + ], + "spans": [ + { + "bbox": [ + 104, + 613, + 183, + 628 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 184, + 615, + 213, + 625 + ], + "score": 0.89, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 613, + 317, + 628 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 318, + 614, + 394, + 626 + ], + "score": 0.89, + "content": "1 - O ( N ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 613, + 427, + 628 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 427, + 614, + 453, + 627 + ], + "score": 0.91, + "content": "\\textstyle P r ^ { * } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 613, + 506, + 628 + ], + "score": 1.0, + "content": "denotes the", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 102, + 621, + 385, + 645 + ], + "spans": [ + { + "bbox": [ + 102, + 621, + 313, + 645 + ], + "score": 1.0, + "content": "probability measure conditional on the data stream", + "type": "text" + }, + { + "bbox": [ + 314, + 626, + 379, + 639 + ], + "score": 0.91, + "content": "\\{ X _ { i } , A _ { i } , Y _ { i } \\} _ { i = 1 } ^ { + \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 379, + 621, + 385, + 645 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 38.5, + "bbox_fs": [ + 102, + 613, + 506, + 645 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 645, + 506, + 669 + ], + "lines": [ + { + "bbox": [ + 106, + 645, + 505, + 659 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 407, + 659 + ], + "score": 1.0, + "content": "Theorem 4 Assume the conditions in Theorem 3 hold. Then conditional on", + "type": "text" + }, + { + "bbox": [ + 408, + 646, + 428, + 659 + ], + "score": 0.91, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 645, + 505, + 659 + ], + "score": 1.0, + "content": ", the critical values", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 107, + 656, + 162, + 671 + ], + "spans": [ + { + "bbox": [ + 107, + 657, + 132, + 669 + ], + "score": 0.92, + "content": "\\{ \\widehat { z } _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 656, + 162, + 671 + ], + "score": 1.0, + "content": "satisfy", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40.5, + "bbox_fs": [ + 106, + 645, + 505, + 671 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 670, + 478, + 721 + ], + "lines": [ + { + "bbox": [ + 141, + 670, + 478, + 721 + ], + "spans": [ + { + "bbox": [ + 141, + 670, + 478, + 721 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\left| P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\widehat z _ { k } \\right) > 0 \\right\\} - \\alpha \\right| } \\\\ { \\leq } & { c \\left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \\log ^ { 1 1 / 6 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K N ( t _ { 1 } ) \\} \\right] , } \\end{array}", + "type": "interline_equation", + "image_path": "8c089c17dd33e098e259d6459ffda19963916b3833f083f83b76ee31e36a0894.jpg" + } + ] + } + ], + "index": 43, + "virtual_lines": [ + { + "bbox": [ + 141, + 670, + 478, + 687.0 + ], + "spans": [], + "index": 42 + }, + { + "bbox": [ + 141, + 687.0, + 478, + 704.0 + ], + "spans": [], + "index": 43 + }, + { + "bbox": [ + 141, + 704.0, + 478, + 721.0 + ], + "spans": [], + "index": 44 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 721, + 206, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 720, + 207, + 733 + ], + "spans": [ + { + "bbox": [ + 104, + 720, + 180, + 733 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 722, + 203, + 731 + ], + "score": 0.8, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 720, + 207, + 733 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 45, + "bbox_fs": [ + 104, + 720, + 207, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 245, + 95 + ], + "score": 1.0, + "content": "When the RHS of equation 11 is", + "type": "text" + }, + { + "bbox": [ + 246, + 82, + 269, + 95 + ], + "score": 0.91, + "content": "o _ { p } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 82, + 504, + 95 + ], + "score": 1.0, + "content": ", it follows from Theorems 2 and 4 that our test is valid.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "The conditional distribution in equation 10 can be approximated by the empirical distribution of", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 185, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 185, + 118 + ], + "score": 1.0, + "content": "Bootstrap samples.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "Finally, we remark that our test can be online updated as batches of observations arrive at the end", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "of each interim stage. A pseudocode summarizing our procedure is given in Algorithm 1 in the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 366, + 156 + ], + "score": 1.0, + "content": "appendix. The spatial complexity of the proposed algorithm is", + "type": "text" + }, + { + "bbox": [ + 366, + 143, + 391, + 155 + ], + "score": 0.92, + "content": "O ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 143, + 423, + 156 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 424, + 144, + 433, + 153 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "is the number of", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 281, + 168 + ], + "score": 1.0, + "content": "bootstrap samples. The time complexity is", + "type": "text" + }, + { + "bbox": [ + 282, + 154, + 350, + 166 + ], + "score": 0.91, + "content": "\\bar { O ( } B k + \\bar { N } ( t _ { k } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 153, + 390, + 168 + ], + "score": 1.0, + "content": "up to the", + "type": "text" + }, + { + "bbox": [ + 390, + 155, + 397, + 164 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 153, + 506, + 168 + ], + "score": 1.0, + "content": "-th interim stage. Suppose", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 164, + 504, + 178 + ], + "spans": [ + { + "bbox": [ + 107, + 165, + 199, + 177 + ], + "score": 0.91, + "content": "N ( t _ { j } ) - N ( t _ { j - 1 } ) = n", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 164, + 231, + 178 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 231, + 165, + 277, + 177 + ], + "score": 0.92, + "content": "1 \\leq j \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 164, + 317, + 178 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 317, + 165, + 504, + 177 + ], + "score": 0.93, + "content": "B k + N ( t _ { k } ) = ( B + n ) k \\ll B n k = B N ( t _ { k } )", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 493, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 142, + 189 + ], + "score": 1.0, + "content": "for large", + "type": "text" + }, + { + "bbox": [ + 143, + 179, + 150, + 186 + ], + "score": 0.77, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 175, + 168, + 189 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 168, + 177, + 177, + 186 + ], + "score": 0.79, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 175, + 493, + 189 + ], + "score": 1.0, + "content": ". Hence, our procedure is much faster compared to the standard wild bootstrap.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5 + }, + { + "type": "title", + "bbox": [ + 108, + 203, + 237, + 216 + ], + "lines": [ + { + "bbox": [ + 105, + 203, + 238, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 238, + 218 + ], + "score": 1.0, + "content": "4 NUMERICAL STUDIES", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "title", + "bbox": [ + 108, + 228, + 225, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 226, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 226, + 240 + ], + "score": 1.0, + "content": "4.1 SIMULATION STUDIES", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 248, + 505, + 365 + ], + "lines": [ + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "In this section, we conduct Monte Carlo simulations to examine the finite sample properties of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 258, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 325, + 273 + ], + "score": 1.0, + "content": "proposed test. We generated the potential outcomes as", + "type": "text" + }, + { + "bbox": [ + 325, + 259, + 501, + 272 + ], + "score": 0.92, + "content": "Y _ { i } ^ { * } ( a ) = 1 + ( X _ { i 1 } - X _ { i 2 } ) / 2 + a \\tau ( X _ { i } ) + \\varepsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 258, + 506, + 273 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 270, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 134, + 285 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 273, + 144, + 282 + ], + "score": 0.83, + "content": "\\varepsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 270, + 189, + 285 + ], + "score": 1.0, + "content": "’s are i.i.d", + "type": "text" + }, + { + "bbox": [ + 189, + 271, + 233, + 283 + ], + "score": 0.92, + "content": "N ( 0 , 0 . 5 ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 270, + 306, + 285 + ], + "score": 1.0, + "content": ". The covariates", + "type": "text" + }, + { + "bbox": [ + 306, + 272, + 406, + 284 + ], + "score": 0.9, + "content": "X _ { i } ~ = ~ ( X _ { i 1 } , X _ { i 2 } , X _ { i 3 } ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 270, + 505, + 285 + ], + "score": 1.0, + "content": "were generated as fol-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 281, + 506, + 296 + ], + "spans": [ + { + "bbox": [ + 104, + 281, + 213, + 296 + ], + "score": 1.0, + "content": "lows. We first generated", + "type": "text" + }, + { + "bbox": [ + 214, + 282, + 317, + 295 + ], + "score": 0.9, + "content": "X _ { i } ^ { * } ~ = ~ ( X _ { i 1 } ^ { * } , X _ { i 2 } ^ { * } , X _ { i 3 } ^ { * } ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 281, + 506, + 296 + ], + "score": 1.0, + "content": "from a multivariate normal distribution with", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 290, + 504, + 311 + ], + "spans": [ + { + "bbox": [ + 104, + 290, + 290, + 311 + ], + "score": 1.0, + "content": "zero mean and covariance matrix equal to", + "type": "text" + }, + { + "bbox": [ + 291, + 294, + 342, + 307 + ], + "score": 0.93, + "content": "\\{ 0 . 5 ^ { | i - j | } \\} _ { i , j }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 290, + 410, + 311 + ], + "score": 1.0, + "content": ". Then we set", + "type": "text" + }, + { + "bbox": [ + 410, + 294, + 504, + 308 + ], + "score": 0.92, + "content": "X _ { i j } ~ = ~ X _ { i j } ^ { * } \\mathbb { I } ( X _ { i j } ^ { * } | ~ \\le", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 226, + 321 + ], + "score": 0.9, + "content": "2 ) + 2 \\mathrm { s g n } ( X _ { i j } ^ { * } ) \\mathbb { I } ( X _ { i j } ^ { * } | > 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 307, + 505, + 321 + ], + "score": 1.0, + "content": ". We consider two randomization designs. In the first design, the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 319, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 439, + 332 + ], + "score": 1.0, + "content": "treatment assignment is nondynamic and completely random. Specifically we set", + "type": "text" + }, + { + "bbox": [ + 440, + 319, + 501, + 332 + ], + "score": 0.92, + "content": "\\textstyle \\pi _ { i } ( a , x ) = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 320, + 505, + 332 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 331, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 137, + 344 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 138, + 333, + 154, + 342 + ], + "score": 0.86, + "content": "a , x", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 331, + 172, + 344 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 173, + 332, + 177, + 341 + ], + "score": 0.7, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 331, + 312, + 344 + ], + "score": 1.0, + "content": ". In the second design, we use an", + "type": "text" + }, + { + "bbox": [ + 312, + 333, + 317, + 341 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 331, + 505, + 344 + ], + "score": 1.0, + "content": "-greedy strategy to generate the treatment with", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 342, + 138, + 352 + ], + "score": 0.87, + "content": "\\varepsilon = 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 341, + 219, + 354 + ], + "score": 1.0, + "content": ". In addition, we set", + "type": "text" + }, + { + "bbox": [ + 219, + 342, + 281, + 354 + ], + "score": 0.92, + "content": "N ( T _ { 1 } ) = 2 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 341, + 299, + 354 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 299, + 342, + 401, + 354 + ], + "score": 0.92, + "content": "\\bar { N ( T _ { j } ) } - \\bar { N } \\bar { ( T _ { j - 1 } ) } ^ { - } = 2 \\bar { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 341, + 416, + 354 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 416, + 342, + 464, + 353 + ], + "score": 0.91, + "content": "2 \\leq j \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "and some", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 353, + 504, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 132, + 363 + ], + "score": 0.86, + "content": "n > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 353, + 273, + 366 + ], + "score": 1.0, + "content": ". We consider two combinations of", + "type": "text" + }, + { + "bbox": [ + 273, + 353, + 300, + 365 + ], + "score": 0.92, + "content": "( n , K )", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 353, + 375, + 366 + ], + "score": 1.0, + "content": ", corresponding to", + "type": "text" + }, + { + "bbox": [ + 375, + 353, + 448, + 365 + ], + "score": 0.91, + "content": "( n , K ) = ( 2 0 0 , 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 353, + 504, + 366 + ], + "score": 1.0, + "content": "and (20, 50).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 15.5 + }, + { + "type": "text", + "bbox": [ + 107, + 369, + 505, + 449 + ], + "lines": [ + { + "bbox": [ + 106, + 368, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 227, + 383 + ], + "score": 1.0, + "content": "We set the significance level √", + "type": "text" + }, + { + "bbox": [ + 228, + 370, + 271, + 380 + ], + "score": 0.88, + "content": "\\alpha = 0 . 0 5", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 368, + 323, + 383 + ], + "score": 1.0, + "content": "and choose", + "type": "text" + }, + { + "bbox": [ + 323, + 370, + 375, + 380 + ], + "score": 0.88, + "content": "B \\ = \\ 1 0 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 368, + 414, + 383 + ], + "score": 1.0, + "content": ". We set", + "type": "text" + }, + { + "bbox": [ + 415, + 369, + 505, + 382 + ], + "score": 0.92, + "content": "\\tau ( X _ { i } ) = \\phi _ { \\delta } \\{ ( X _ { i 1 } +", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 380, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 166, + 394 + ], + "score": 0.92, + "content": "X _ { i 2 } ) / \\sqrt { 2 } \\} X _ { i 3 } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 380, + 241, + 396 + ], + "score": 1.0, + "content": "for some function", + "type": "text" + }, + { + "bbox": [ + 242, + 382, + 253, + 393 + ], + "score": 0.87, + "content": "\\phi _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 380, + 350, + 396 + ], + "score": 1.0, + "content": "parameterized by some", + "type": "text" + }, + { + "bbox": [ + 351, + 382, + 376, + 393 + ], + "score": 0.88, + "content": "\\delta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 380, + 506, + 396 + ], + "score": 1.0, + "content": ". We consider two scenarios for", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 392, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 118, + 405 + ], + "score": 0.87, + "content": "\\phi _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 392, + 203, + 406 + ], + "score": 1.0, + "content": ". Specifically, we set", + "type": "text" + }, + { + "bbox": [ + 203, + 393, + 267, + 405 + ], + "score": 0.92, + "content": "\\phi _ { \\delta } ( x ) = \\delta x ^ { 2 } / 3", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 392, + 342, + 406 + ], + "score": 1.0, + "content": "in Scenario 1 and", + "type": "text" + }, + { + "bbox": [ + 342, + 393, + 407, + 405 + ], + "score": 0.9, + "content": "\\phi _ { \\delta } = \\delta \\cos ( \\pi x )", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 392, + 506, + 406 + ], + "score": 1.0, + "content": "in Scenario 2. For each", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 404, + 505, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 306, + 416 + ], + "score": 1.0, + "content": "setting, we further consider four cases by setting", + "type": "text" + }, + { + "bbox": [ + 306, + 405, + 410, + 416 + ], + "score": 0.79, + "content": "\\delta = 0 , 0 . 1 , 0 . 1 5 , 0 . 2 , 0 . 2 5", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 404, + 475, + 416 + ], + "score": 1.0, + "content": "and 0.3. When", + "type": "text" + }, + { + "bbox": [ + 475, + 404, + 501, + 414 + ], + "score": 0.88, + "content": "\\delta = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 404, + 505, + 416 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 415, + 504, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 120, + 426 + ], + "score": 0.87, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 416, + 195, + 427 + ], + "score": 1.0, + "content": "holds. Otherwise,", + "type": "text" + }, + { + "bbox": [ + 195, + 415, + 209, + 426 + ], + "score": 0.88, + "content": "H _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 416, + 427, + 427 + ], + "score": 1.0, + "content": "holds. For all settings, we construct the basis function", + "type": "text" + }, + { + "bbox": [ + 427, + 415, + 446, + 427 + ], + "score": 0.9, + "content": "\\varphi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 416, + 504, + 427 + ], + "score": 1.0, + "content": "using additive", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "cubic splines. For each univariate spline, we set the number of internal knots to be 4. These knots", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 437, + 251, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 218, + 450 + ], + "score": 1.0, + "content": "are equally spaced between", + "type": "text" + }, + { + "bbox": [ + 219, + 437, + 247, + 449 + ], + "score": 0.85, + "content": "[ - 2 , 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 437, + 251, + 450 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 453, + 505, + 553 + ], + "lines": [ + { + "bbox": [ + 106, + 454, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 454, + 505, + 467 + ], + "score": 1.0, + "content": "We denote our test by BAT, short for bootstrap-assisted test. We run our experiments on a single", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 465, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 506, + 478 + ], + "score": 1.0, + "content": "computer instance with 40 Intel(R) Xeon(R) 2.20GHz CPUs. It takes 1-2 seconds on average to", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 474, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 505, + 489 + ], + "score": 1.0, + "content": "compute each test. In Table 1 (see Appendix G), we report the rejection probabilities and average", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 487, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 487, + 505, + 500 + ], + "score": 1.0, + "content": "stopping times (defined as the average number of samples consumed when the experiment is termi-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 497, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 104, + 497, + 375, + 512 + ], + "score": 1.0, + "content": "nated) of the proposed test aggregated over 400 simulations when", + "type": "text" + }, + { + "bbox": [ + 375, + 497, + 398, + 510 + ], + "score": 0.92, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 497, + 505, + 512 + ], + "score": 1.0, + "content": "is chosen as the spending", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "score": 1.0, + "content": "function. In Figure 2, we plot the rejection probabilities of our tests and the average stopping times", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "of the experiments. It can be seen that the type-I error rates are close to the nominal level in all", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 529, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 104, + 529, + 278, + 545 + ], + "score": 1.0, + "content": "cases. The power of our test increases as", + "type": "text" + }, + { + "bbox": [ + 279, + 531, + 285, + 541 + ], + "score": 0.7, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 529, + 505, + 545 + ], + "score": 1.0, + "content": "increases, demonstrating its consistency. In addition,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 541, + 345, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 130, + 555 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 131, + 542, + 155, + 552 + ], + "score": 0.9, + "content": "\\delta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 541, + 345, + 555 + ], + "score": 1.0, + "content": ", our experiments are stopped early in all cases.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 558, + 505, + 603 + ], + "lines": [ + { + "bbox": [ + 105, + 558, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 505, + 571 + ], + "score": 1.0, + "content": "To further evaluate our method, we compare it with a test based on the law of iterated logarithm", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 570, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 505, + 581 + ], + "score": 1.0, + "content": "(denoted by LIL). LIL determines the decision boundary based on an always valid finite error bound", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 168, + 593 + ], + "score": 1.0, + "content": "(see Appendix", + "type": "text" + }, + { + "bbox": [ + 168, + 581, + 176, + 591 + ], + "score": 0.29, + "content": "\\mathrm { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 581, + 505, + 593 + ], + "score": 1.0, + "content": "for details about the competing method). It can be seen from Figure 2 that our", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 591, + 409, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 591, + 409, + 604 + ], + "score": 1.0, + "content": "method has much larger power than the law of iterated logarithm approach.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5 + }, + { + "type": "title", + "bbox": [ + 108, + 616, + 225, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 227, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 227, + 628 + ], + "score": 1.0, + "content": "4.2 REAL DATA ANALYSIS", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 505, + 714 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 504, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 504, + 649 + ], + "score": 1.0, + "content": "In this section, we apply the proposed method to a Yahoo! Today Module user click log dataset1,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "score": 1.0, + "content": "which contains 45,811,883 user visits to the Today Module, during the first ten days in May 2009.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 657, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 138, + 671 + ], + "score": 1.0, + "content": "For the", + "type": "text" + }, + { + "bbox": [ + 139, + 659, + 144, + 668 + ], + "score": 0.27, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 657, + 505, + 671 + ], + "score": 1.0, + "content": "th visit, the dataset contains an ID of the new article recommended to the user, a binary", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 669, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 179, + 682 + ], + "score": 1.0, + "content": "response variable", + "type": "text" + }, + { + "bbox": [ + 180, + 669, + 190, + 681 + ], + "score": 0.86, + "content": "Y _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 669, + 505, + 682 + ], + "score": 1.0, + "content": "indicating whether the user clicked the article or not, and a five dimensional", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 681, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 505, + 693 + ], + "score": 1.0, + "content": "feature vector summarizing information of the user. Due to privacy concerns, feature definitions and", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 691, + 506, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 506, + 704 + ], + "score": 1.0, + "content": "article names were not included in the data. Each feature vector sums up to 1. Therefore, we took", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 702, + 506, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 702, + 343, + 715 + ], + "score": 1.0, + "content": "the first three and the fifth elements to form the covariates", + "type": "text" + }, + { + "bbox": [ + 343, + 703, + 356, + 713 + ], + "score": 0.89, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 702, + 506, + 715 + ], + "score": 1.0, + "content": ". For illustration, we only consider a", + "type": "text" + } + ], + "index": 48 + } + ], + "index": 45 + } + ], + "page_idx": 6, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 114, + 722, + 468, + 732 + ], + "lines": [ + { + "bbox": [ + 119, + 720, + 468, + 733 + ], + "spans": [ + { + "bbox": [ + 119, + 720, + 419, + 733 + ], + "score": 1.0, + "content": "1https://webscope.sandbox.yahoo.com/catalog.php?datatype", + "type": "text" + }, + { + "bbox": [ + 419, + 723, + 425, + 730 + ], + "score": 0.47, + "content": "=", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 720, + 451, + 733 + ], + "score": 1.0, + "content": "r&did", + "type": "text" + }, + { + "bbox": [ + 451, + 722, + 468, + 731 + ], + "score": 0.48, + "content": "_ { - 4 9 }", + "type": "inline_equation" + } + ] + } + ] + }, + { + "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": "text", + "bbox": [ + 107, + 82, + 504, + 116 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 504, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 245, + 95 + ], + "score": 1.0, + "content": "When the RHS of equation 11 is", + "type": "text" + }, + { + "bbox": [ + 246, + 82, + 269, + 95 + ], + "score": 0.91, + "content": "o _ { p } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 82, + 504, + 95 + ], + "score": 1.0, + "content": ", it follows from Theorems 2 and 4 that our test is valid.", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 105, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "The conditional distribution in equation 10 can be approximated by the empirical distribution of", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 104, + 185, + 118 + ], + "spans": [ + { + "bbox": [ + 105, + 104, + 185, + 118 + ], + "score": 1.0, + "content": "Bootstrap samples.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 82, + 505, + 118 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 121, + 505, + 187 + ], + "lines": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "spans": [ + { + "bbox": [ + 105, + 121, + 505, + 134 + ], + "score": 1.0, + "content": "Finally, we remark that our test can be online updated as batches of observations arrive at the end", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 145 + ], + "score": 1.0, + "content": "of each interim stage. A pseudocode summarizing our procedure is given in Algorithm 1 in the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 143, + 506, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 143, + 366, + 156 + ], + "score": 1.0, + "content": "appendix. The spatial complexity of the proposed algorithm is", + "type": "text" + }, + { + "bbox": [ + 366, + 143, + 391, + 155 + ], + "score": 0.92, + "content": "O ( B )", + "type": "inline_equation" + }, + { + "bbox": [ + 391, + 143, + 423, + 156 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 424, + 144, + 433, + 153 + ], + "score": 0.81, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 433, + 143, + 506, + 156 + ], + "score": 1.0, + "content": "is the number of", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 153, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 281, + 168 + ], + "score": 1.0, + "content": "bootstrap samples. The time complexity is", + "type": "text" + }, + { + "bbox": [ + 282, + 154, + 350, + 166 + ], + "score": 0.91, + "content": "\\bar { O ( } B k + \\bar { N } ( t _ { k } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 153, + 390, + 168 + ], + "score": 1.0, + "content": "up to the", + "type": "text" + }, + { + "bbox": [ + 390, + 155, + 397, + 164 + ], + "score": 0.8, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 153, + 506, + 168 + ], + "score": 1.0, + "content": "-th interim stage. Suppose", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 107, + 164, + 504, + 178 + ], + "spans": [ + { + "bbox": [ + 107, + 165, + 199, + 177 + ], + "score": 0.91, + "content": "N ( t _ { j } ) - N ( t _ { j - 1 } ) = n", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 164, + 231, + 178 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 231, + 165, + 277, + 177 + ], + "score": 0.92, + "content": "1 \\leq j \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 164, + 317, + 178 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 317, + 165, + 504, + 177 + ], + "score": 0.93, + "content": "B k + N ( t _ { k } ) = ( B + n ) k \\ll B n k = B N ( t _ { k } )", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 175, + 493, + 189 + ], + "spans": [ + { + "bbox": [ + 105, + 175, + 142, + 189 + ], + "score": 1.0, + "content": "for large", + "type": "text" + }, + { + "bbox": [ + 143, + 179, + 150, + 186 + ], + "score": 0.77, + "content": "n", + "type": "inline_equation" + }, + { + "bbox": [ + 151, + 175, + 168, + 189 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 168, + 177, + 177, + 186 + ], + "score": 0.79, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 175, + 493, + 189 + ], + "score": 1.0, + "content": ". Hence, our procedure is much faster compared to the standard wild bootstrap.", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 121, + 506, + 189 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 203, + 237, + 216 + ], + "lines": [ + { + "bbox": [ + 105, + 203, + 238, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 203, + 238, + 218 + ], + "score": 1.0, + "content": "4 NUMERICAL STUDIES", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "title", + "bbox": [ + 108, + 228, + 225, + 239 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 226, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 226, + 240 + ], + "score": 1.0, + "content": "4.1 SIMULATION STUDIES", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 106, + 248, + 505, + 365 + ], + "lines": [ + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 249, + 505, + 261 + ], + "score": 1.0, + "content": "In this section, we conduct Monte Carlo simulations to examine the finite sample properties of the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 258, + 506, + 273 + ], + "spans": [ + { + "bbox": [ + 105, + 258, + 325, + 273 + ], + "score": 1.0, + "content": "proposed test. We generated the potential outcomes as", + "type": "text" + }, + { + "bbox": [ + 325, + 259, + 501, + 272 + ], + "score": 0.92, + "content": "Y _ { i } ^ { * } ( a ) = 1 + ( X _ { i 1 } - X _ { i 2 } ) / 2 + a \\tau ( X _ { i } ) + \\varepsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 258, + 506, + 273 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 270, + 505, + 285 + ], + "spans": [ + { + "bbox": [ + 105, + 270, + 134, + 285 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 273, + 144, + 282 + ], + "score": 0.83, + "content": "\\varepsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 270, + 189, + 285 + ], + "score": 1.0, + "content": "’s are i.i.d", + "type": "text" + }, + { + "bbox": [ + 189, + 271, + 233, + 283 + ], + "score": 0.92, + "content": "N ( 0 , 0 . 5 ^ { 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 270, + 306, + 285 + ], + "score": 1.0, + "content": ". The covariates", + "type": "text" + }, + { + "bbox": [ + 306, + 272, + 406, + 284 + ], + "score": 0.9, + "content": "X _ { i } ~ = ~ ( X _ { i 1 } , X _ { i 2 } , X _ { i 3 } ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 270, + 505, + 285 + ], + "score": 1.0, + "content": "were generated as fol-", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 104, + 281, + 506, + 296 + ], + "spans": [ + { + "bbox": [ + 104, + 281, + 213, + 296 + ], + "score": 1.0, + "content": "lows. We first generated", + "type": "text" + }, + { + "bbox": [ + 214, + 282, + 317, + 295 + ], + "score": 0.9, + "content": "X _ { i } ^ { * } ~ = ~ ( X _ { i 1 } ^ { * } , X _ { i 2 } ^ { * } , X _ { i 3 } ^ { * } ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 318, + 281, + 506, + 296 + ], + "score": 1.0, + "content": "from a multivariate normal distribution with", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 104, + 290, + 504, + 311 + ], + "spans": [ + { + "bbox": [ + 104, + 290, + 290, + 311 + ], + "score": 1.0, + "content": "zero mean and covariance matrix equal to", + "type": "text" + }, + { + "bbox": [ + 291, + 294, + 342, + 307 + ], + "score": 0.93, + "content": "\\{ 0 . 5 ^ { | i - j | } \\} _ { i , j }", + "type": "inline_equation" + }, + { + "bbox": [ + 342, + 290, + 410, + 311 + ], + "score": 1.0, + "content": ". Then we set", + "type": "text" + }, + { + "bbox": [ + 410, + 294, + 504, + 308 + ], + "score": 0.92, + "content": "X _ { i j } ~ = ~ X _ { i j } ^ { * } \\mathbb { I } ( X _ { i j } ^ { * } | ~ \\le", + "type": "inline_equation" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 307, + 505, + 321 + ], + "spans": [ + { + "bbox": [ + 106, + 307, + 226, + 321 + ], + "score": 0.9, + "content": "2 ) + 2 \\mathrm { s g n } ( X _ { i j } ^ { * } ) \\mathbb { I } ( X _ { i j } ^ { * } | > 2 )", + "type": "inline_equation" + }, + { + "bbox": [ + 226, + 307, + 505, + 321 + ], + "score": 1.0, + "content": ". We consider two randomization designs. In the first design, the", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 106, + 319, + 505, + 332 + ], + "spans": [ + { + "bbox": [ + 106, + 320, + 439, + 332 + ], + "score": 1.0, + "content": "treatment assignment is nondynamic and completely random. Specifically we set", + "type": "text" + }, + { + "bbox": [ + 440, + 319, + 501, + 332 + ], + "score": 0.92, + "content": "\\textstyle \\pi _ { i } ( a , x ) = 0 . 5", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 320, + 505, + 332 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 331, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 105, + 331, + 137, + 344 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 138, + 333, + 154, + 342 + ], + "score": 0.86, + "content": "a , x", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 331, + 172, + 344 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 173, + 332, + 177, + 341 + ], + "score": 0.7, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 331, + 312, + 344 + ], + "score": 1.0, + "content": ". In the second design, we use an", + "type": "text" + }, + { + "bbox": [ + 312, + 333, + 317, + 341 + ], + "score": 0.7, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 331, + 505, + 344 + ], + "score": 1.0, + "content": "-greedy strategy to generate the treatment with", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 341, + 505, + 354 + ], + "spans": [ + { + "bbox": [ + 106, + 342, + 138, + 352 + ], + "score": 0.87, + "content": "\\varepsilon = 0 . 3", + "type": "inline_equation" + }, + { + "bbox": [ + 139, + 341, + 219, + 354 + ], + "score": 1.0, + "content": ". In addition, we set", + "type": "text" + }, + { + "bbox": [ + 219, + 342, + 281, + 354 + ], + "score": 0.92, + "content": "N ( T _ { 1 } ) = 2 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 341, + 299, + 354 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 299, + 342, + 401, + 354 + ], + "score": 0.92, + "content": "\\bar { N ( T _ { j } ) } - \\bar { N } \\bar { ( T _ { j - 1 } ) } ^ { - } = 2 \\bar { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 341, + 416, + 354 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 416, + 342, + 464, + 353 + ], + "score": 0.91, + "content": "2 \\leq j \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 341, + 505, + 354 + ], + "score": 1.0, + "content": "and some", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 353, + 504, + 366 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 132, + 363 + ], + "score": 0.86, + "content": "n > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 353, + 273, + 366 + ], + "score": 1.0, + "content": ". We consider two combinations of", + "type": "text" + }, + { + "bbox": [ + 273, + 353, + 300, + 365 + ], + "score": 0.92, + "content": "( n , K )", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 353, + 375, + 366 + ], + "score": 1.0, + "content": ", corresponding to", + "type": "text" + }, + { + "bbox": [ + 375, + 353, + 448, + 365 + ], + "score": 0.91, + "content": "( n , K ) = ( 2 0 0 , 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 353, + 504, + 366 + ], + "score": 1.0, + "content": "and (20, 50).", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 15.5, + "bbox_fs": [ + 104, + 249, + 506, + 366 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 369, + 505, + 449 + ], + "lines": [ + { + "bbox": [ + 106, + 368, + 505, + 383 + ], + "spans": [ + { + "bbox": [ + 106, + 368, + 227, + 383 + ], + "score": 1.0, + "content": "We set the significance level √", + "type": "text" + }, + { + "bbox": [ + 228, + 370, + 271, + 380 + ], + "score": 0.88, + "content": "\\alpha = 0 . 0 5", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 368, + 323, + 383 + ], + "score": 1.0, + "content": "and choose", + "type": "text" + }, + { + "bbox": [ + 323, + 370, + 375, + 380 + ], + "score": 0.88, + "content": "B \\ = \\ 1 0 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 368, + 414, + 383 + ], + "score": 1.0, + "content": ". We set", + "type": "text" + }, + { + "bbox": [ + 415, + 369, + 505, + 382 + ], + "score": 0.92, + "content": "\\tau ( X _ { i } ) = \\phi _ { \\delta } \\{ ( X _ { i 1 } +", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 380, + 506, + 396 + ], + "spans": [ + { + "bbox": [ + 106, + 381, + 166, + 394 + ], + "score": 0.92, + "content": "X _ { i 2 } ) / \\sqrt { 2 } \\} X _ { i 3 } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 380, + 241, + 396 + ], + "score": 1.0, + "content": "for some function", + "type": "text" + }, + { + "bbox": [ + 242, + 382, + 253, + 393 + ], + "score": 0.87, + "content": "\\phi _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 380, + 350, + 396 + ], + "score": 1.0, + "content": "parameterized by some", + "type": "text" + }, + { + "bbox": [ + 351, + 382, + 376, + 393 + ], + "score": 0.88, + "content": "\\delta \\geq 0", + "type": "inline_equation" + }, + { + "bbox": [ + 376, + 380, + 506, + 396 + ], + "score": 1.0, + "content": ". We consider two scenarios for", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 392, + 506, + 406 + ], + "spans": [ + { + "bbox": [ + 106, + 394, + 118, + 405 + ], + "score": 0.87, + "content": "\\phi _ { \\delta }", + "type": "inline_equation" + }, + { + "bbox": [ + 118, + 392, + 203, + 406 + ], + "score": 1.0, + "content": ". Specifically, we set", + "type": "text" + }, + { + "bbox": [ + 203, + 393, + 267, + 405 + ], + "score": 0.92, + "content": "\\phi _ { \\delta } ( x ) = \\delta x ^ { 2 } / 3", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 392, + 342, + 406 + ], + "score": 1.0, + "content": "in Scenario 1 and", + "type": "text" + }, + { + "bbox": [ + 342, + 393, + 407, + 405 + ], + "score": 0.9, + "content": "\\phi _ { \\delta } = \\delta \\cos ( \\pi x )", + "type": "inline_equation" + }, + { + "bbox": [ + 407, + 392, + 506, + 406 + ], + "score": 1.0, + "content": "in Scenario 2. For each", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 404, + 505, + 416 + ], + "spans": [ + { + "bbox": [ + 105, + 404, + 306, + 416 + ], + "score": 1.0, + "content": "setting, we further consider four cases by setting", + "type": "text" + }, + { + "bbox": [ + 306, + 405, + 410, + 416 + ], + "score": 0.79, + "content": "\\delta = 0 , 0 . 1 , 0 . 1 5 , 0 . 2 , 0 . 2 5", + "type": "inline_equation" + }, + { + "bbox": [ + 411, + 404, + 475, + 416 + ], + "score": 1.0, + "content": "and 0.3. When", + "type": "text" + }, + { + "bbox": [ + 475, + 404, + 501, + 414 + ], + "score": 0.88, + "content": "\\delta = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 404, + 505, + 416 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 415, + 504, + 427 + ], + "spans": [ + { + "bbox": [ + 106, + 415, + 120, + 426 + ], + "score": 0.87, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 121, + 416, + 195, + 427 + ], + "score": 1.0, + "content": "holds. Otherwise,", + "type": "text" + }, + { + "bbox": [ + 195, + 415, + 209, + 426 + ], + "score": 0.88, + "content": "H _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 416, + 427, + 427 + ], + "score": 1.0, + "content": "holds. For all settings, we construct the basis function", + "type": "text" + }, + { + "bbox": [ + 427, + 415, + 446, + 427 + ], + "score": 0.9, + "content": "\\varphi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 416, + 504, + 427 + ], + "score": 1.0, + "content": "using additive", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "spans": [ + { + "bbox": [ + 106, + 426, + 505, + 438 + ], + "score": 1.0, + "content": "cubic splines. For each univariate spline, we set the number of internal knots to be 4. These knots", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 437, + 251, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 437, + 218, + 450 + ], + "score": 1.0, + "content": "are equally spaced between", + "type": "text" + }, + { + "bbox": [ + 219, + 437, + 247, + 449 + ], + "score": 0.85, + "content": "[ - 2 , 2 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 437, + 251, + 450 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 368, + 506, + 450 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 453, + 505, + 553 + ], + "lines": [ + { + "bbox": [ + 106, + 454, + 505, + 467 + ], + "spans": [ + { + "bbox": [ + 106, + 454, + 505, + 467 + ], + "score": 1.0, + "content": "We denote our test by BAT, short for bootstrap-assisted test. We run our experiments on a single", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 465, + 506, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 465, + 506, + 478 + ], + "score": 1.0, + "content": "computer instance with 40 Intel(R) Xeon(R) 2.20GHz CPUs. It takes 1-2 seconds on average to", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 474, + 505, + 489 + ], + "spans": [ + { + "bbox": [ + 105, + 474, + 505, + 489 + ], + "score": 1.0, + "content": "compute each test. In Table 1 (see Appendix G), we report the rejection probabilities and average", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 487, + 505, + 500 + ], + "spans": [ + { + "bbox": [ + 106, + 487, + 505, + 500 + ], + "score": 1.0, + "content": "stopping times (defined as the average number of samples consumed when the experiment is termi-", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 104, + 497, + 505, + 512 + ], + "spans": [ + { + "bbox": [ + 104, + 497, + 375, + 512 + ], + "score": 1.0, + "content": "nated) of the proposed test aggregated over 400 simulations when", + "type": "text" + }, + { + "bbox": [ + 375, + 497, + 398, + 510 + ], + "score": 0.92, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 497, + 505, + 512 + ], + "score": 1.0, + "content": "is chosen as the spending", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "spans": [ + { + "bbox": [ + 105, + 508, + 505, + 522 + ], + "score": 1.0, + "content": "function. In Figure 2, we plot the rejection probabilities of our tests and the average stopping times", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 519, + 505, + 532 + ], + "spans": [ + { + "bbox": [ + 105, + 519, + 505, + 532 + ], + "score": 1.0, + "content": "of the experiments. It can be seen that the type-I error rates are close to the nominal level in all", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 104, + 529, + 505, + 545 + ], + "spans": [ + { + "bbox": [ + 104, + 529, + 278, + 545 + ], + "score": 1.0, + "content": "cases. The power of our test increases as", + "type": "text" + }, + { + "bbox": [ + 279, + 531, + 285, + 541 + ], + "score": 0.7, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 285, + 529, + 505, + 545 + ], + "score": 1.0, + "content": "increases, demonstrating its consistency. In addition,", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 541, + 345, + 555 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 130, + 555 + ], + "score": 1.0, + "content": "when", + "type": "text" + }, + { + "bbox": [ + 131, + 542, + 155, + 552 + ], + "score": 0.9, + "content": "\\delta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 541, + 345, + 555 + ], + "score": 1.0, + "content": ", our experiments are stopped early in all cases.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 32, + "bbox_fs": [ + 104, + 454, + 506, + 555 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 558, + 505, + 603 + ], + "lines": [ + { + "bbox": [ + 105, + 558, + 505, + 571 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 505, + 571 + ], + "score": 1.0, + "content": "To further evaluate our method, we compare it with a test based on the law of iterated logarithm", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 106, + 570, + 505, + 581 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 505, + 581 + ], + "score": 1.0, + "content": "(denoted by LIL). LIL determines the decision boundary based on an always valid finite error bound", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 106, + 581, + 505, + 593 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 168, + 593 + ], + "score": 1.0, + "content": "(see Appendix", + "type": "text" + }, + { + "bbox": [ + 168, + 581, + 176, + 591 + ], + "score": 0.29, + "content": "\\mathrm { F }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 581, + 505, + 593 + ], + "score": 1.0, + "content": "for details about the competing method). It can be seen from Figure 2 that our", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 105, + 591, + 409, + 604 + ], + "spans": [ + { + "bbox": [ + 105, + 591, + 409, + 604 + ], + "score": 1.0, + "content": "method has much larger power than the law of iterated logarithm approach.", + "type": "text" + } + ], + "index": 40 + } + ], + "index": 38.5, + "bbox_fs": [ + 105, + 558, + 505, + 604 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 616, + 225, + 627 + ], + "lines": [ + { + "bbox": [ + 105, + 615, + 227, + 628 + ], + "spans": [ + { + "bbox": [ + 105, + 615, + 227, + 628 + ], + "score": 1.0, + "content": "4.2 REAL DATA ANALYSIS", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 107, + 636, + 505, + 714 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 504, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 504, + 649 + ], + "score": 1.0, + "content": "In this section, we apply the proposed method to a Yahoo! Today Module user click log dataset1,", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 105, + 646, + 505, + 660 + ], + "score": 1.0, + "content": "which contains 45,811,883 user visits to the Today Module, during the first ten days in May 2009.", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 105, + 657, + 505, + 671 + ], + "spans": [ + { + "bbox": [ + 105, + 657, + 138, + 671 + ], + "score": 1.0, + "content": "For the", + "type": "text" + }, + { + "bbox": [ + 139, + 659, + 144, + 668 + ], + "score": 0.27, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 657, + 505, + 671 + ], + "score": 1.0, + "content": "th visit, the dataset contains an ID of the new article recommended to the user, a binary", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 669, + 505, + 682 + ], + "spans": [ + { + "bbox": [ + 105, + 669, + 179, + 682 + ], + "score": 1.0, + "content": "response variable", + "type": "text" + }, + { + "bbox": [ + 180, + 669, + 190, + 681 + ], + "score": 0.86, + "content": "Y _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 669, + 505, + 682 + ], + "score": 1.0, + "content": "indicating whether the user clicked the article or not, and a five dimensional", + "type": "text" + } + ], + "index": 45 + }, + { + "bbox": [ + 105, + 681, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 105, + 681, + 505, + 693 + ], + "score": 1.0, + "content": "feature vector summarizing information of the user. Due to privacy concerns, feature definitions and", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 105, + 691, + 506, + 704 + ], + "spans": [ + { + "bbox": [ + 105, + 691, + 506, + 704 + ], + "score": 1.0, + "content": "article names were not included in the data. Each feature vector sums up to 1. Therefore, we took", + "type": "text" + } + ], + "index": 47 + }, + { + "bbox": [ + 105, + 702, + 506, + 715 + ], + "spans": [ + { + "bbox": [ + 105, + 702, + 343, + 715 + ], + "score": 1.0, + "content": "the first three and the fifth elements to form the covariates", + "type": "text" + }, + { + "bbox": [ + 343, + 703, + 356, + 713 + ], + "score": 0.89, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 702, + 506, + 715 + ], + "score": 1.0, + "content": ". For illustration, we only consider a", + "type": "text" + } + ], + "index": 48 + }, + { + "bbox": [ + 105, + 306, + 506, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 506, + 317 + ], + "score": 1.0, + "content": "subset of data that contains visits on May 1st where the recommended article ID is either 109510", + "type": "text", + "cross_page": true + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 317, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 506, + 329 + ], + "score": 1.0, + "content": "or 109520. These two articles were being recommended most on that day. This gives us a total of", + "type": "text", + "cross_page": true + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 296, + 340 + ], + "score": 1.0, + "content": "405888 visits. On the reduced dataset, define", + "type": "text", + "cross_page": true + }, + { + "bbox": [ + 297, + 328, + 330, + 339 + ], + "score": 0.93, + "content": "A _ { i } = 1", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 330, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "if the recommended article is 109510 and", + "type": "text", + "cross_page": true + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 338, + 182, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 137, + 350 + ], + "score": 0.91, + "content": "A _ { i } = 0", + "type": "inline_equation", + "cross_page": true + }, + { + "bbox": [ + 137, + 338, + 182, + 351 + ], + "score": 1.0, + "content": "otherwise.", + "type": "text", + "cross_page": true + } + ], + "index": 9 + } + ], + "index": 45, + "bbox_fs": [ + 105, + 636, + 506, + 715 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 108, + 80, + 503, + 242 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 80, + 503, + 242 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 80, + 503, + 242 + ], + "spans": [ + { + "bbox": [ + 108, + 80, + 503, + 242 + ], + "score": 0.97, + "type": "image", + "image_path": "e8f1dd4aee2e95fb37aee7ba9ac609bd8fce0a4c6bbedd073021aa180f59c5ff.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 80, + 503, + 134.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 134.0, + 503, + 188.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 188.0, + 503, + 242.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 255, + 505, + 286 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 254, + 506, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 435, + 267 + ], + "score": 1.0, + "content": "Figure 2: Rejection probabilities and average stopping times of the proposed test when", + "type": "text" + }, + { + "bbox": [ + 435, + 255, + 456, + 266 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 254, + 506, + 267 + ], + "score": 1.0, + "content": "is chosen as", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 264, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 443, + 277 + ], + "score": 1.0, + "content": "the spending function. From left to right: Scenario 1 with random design, Scenario 1 with", + "type": "text" + }, + { + "bbox": [ + 443, + 267, + 448, + 274 + ], + "score": 0.58, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 264, + 505, + 277 + ], + "score": 1.0, + "content": "-greedy design,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 274, + 356, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 274, + 294, + 288 + ], + "score": 1.0, + "content": "Scenario 2 with random design and Scenario 2 with", + "type": "text" + }, + { + "bbox": [ + 294, + 277, + 299, + 284 + ], + "score": 0.66, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 274, + 356, + 288 + ], + "score": 1.0, + "content": "-greedy design.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 306, + 505, + 350 + ], + "lines": [ + { + "bbox": [ + 105, + 306, + 506, + 317 + ], + "spans": [ + { + "bbox": [ + 105, + 306, + 506, + 317 + ], + "score": 1.0, + "content": "subset of data that contains visits on May 1st where the recommended article ID is either 109510", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 317, + 506, + 329 + ], + "spans": [ + { + "bbox": [ + 105, + 317, + 506, + 329 + ], + "score": 1.0, + "content": "or 109520. These two articles were being recommended most on that day. This gives us a total of", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 105, + 327, + 505, + 340 + ], + "spans": [ + { + "bbox": [ + 105, + 327, + 296, + 340 + ], + "score": 1.0, + "content": "405888 visits. On the reduced dataset, define", + "type": "text" + }, + { + "bbox": [ + 297, + 328, + 330, + 339 + ], + "score": 0.93, + "content": "A _ { i } = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 327, + 505, + 340 + ], + "score": 1.0, + "content": "if the recommended article is 109510 and", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 106, + 338, + 182, + 351 + ], + "spans": [ + { + "bbox": [ + 106, + 339, + 137, + 350 + ], + "score": 0.91, + "content": "A _ { i } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 338, + 182, + 351 + ], + "score": 1.0, + "content": "otherwise.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 7.5 + }, + { + "type": "text", + "bbox": [ + 106, + 356, + 505, + 444 + ], + "lines": [ + { + "bbox": [ + 106, + 355, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 355, + 505, + 369 + ], + "score": 1.0, + "content": "We first conduct A/A experiments (which compare these two articles against themselves) to examine", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 367, + 506, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 506, + 379 + ], + "score": 1.0, + "content": "the validity of our test. The A/A experiments are done when every 2000 more users are available, we", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 378, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 506, + 390 + ], + "score": 1.0, + "content": "randomly assign 1000 users to arm A, and the other 1000 users in arm B. We expect our test will not", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 389, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 104, + 389, + 131, + 401 + ], + "score": 1.0, + "content": "reject", + "type": "text" + }, + { + "bbox": [ + 131, + 389, + 145, + 400 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 389, + 506, + 401 + ], + "score": 1.0, + "content": "in A/A experiments, since the articles being recommended are the same. Then, we conduct", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 399, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 414 + ], + "score": 1.0, + "content": "A/B experiment to test the QTE of these two articles. The test statistics and their corresponding", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 411, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 506, + 423 + ], + "score": 1.0, + "content": "critical values are plotted in Figure 3. On average it takes several seconds to implement our test. It", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 422, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 277, + 434 + ], + "score": 1.0, + "content": "can be seen that our test is able to be reject", + "type": "text" + }, + { + "bbox": [ + 278, + 422, + 292, + 433 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 422, + 506, + 434 + ], + "score": 1.0, + "content": "after obtaining the first one-third of the observations,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 433, + 432, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 364, + 445 + ], + "score": 1.0, + "content": "in the A/B experiment. In the A/A experiments, we fail to reject", + "type": "text" + }, + { + "bbox": [ + 364, + 433, + 378, + 444 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 433, + 432, + 445 + ], + "score": 1.0, + "content": ", as expected.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5 + }, + { + "type": "title", + "bbox": [ + 107, + 460, + 190, + 473 + ], + "lines": [ + { + "bbox": [ + 105, + 459, + 192, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 192, + 475 + ], + "score": 1.0, + "content": "5 DISCUSSION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 486, + 505, + 529 + ], + "lines": [ + { + "bbox": [ + 105, + 484, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 499 + ], + "score": 1.0, + "content": "In this paper, we propose a new testing procedure for evaluating the performance of technology prod-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 497, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 508 + ], + "score": 1.0, + "content": "ucts in tech companies based on the notion of qualitative treatment effects. Currently, we only focus", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "on comparing two products. It would be practically useful to develop a multiple testing procedure", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 518, + 470, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 470, + 531 + ], + "score": 1.0, + "content": "under settings with multiple treatment options. These topics warrant further investigations.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5 + }, + { + "type": "image", + "bbox": [ + 106, + 554, + 503, + 714 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 554, + 503, + 714 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 554, + 503, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 554, + 503, + 714 + ], + "score": 0.969, + "type": "image", + "image_path": "d07ec0bda641ab04da632fa857aca2761150230607e09e18e0434c03477db667.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 106, + 554, + 503, + 607.3333333333334 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 106, + 607.3333333333334, + 503, + 660.6666666666667 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 106, + 660.6666666666667, + 503, + 714.0000000000001 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 227, + 719, + 384, + 730 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 226, + 718, + 385, + 731 + ], + "spans": [ + { + "bbox": [ + 226, + 718, + 385, + 731 + ], + "score": 1.0, + "content": "Figure 3: Critical values and test statistics.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + } + ], + "index": 25.0 + } + ], + "page_idx": 7, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 108, + 27, + 306, + 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": [ + 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": "image", + "bbox": [ + 108, + 80, + 503, + 242 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 108, + 80, + 503, + 242 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 108, + 80, + 503, + 242 + ], + "spans": [ + { + "bbox": [ + 108, + 80, + 503, + 242 + ], + "score": 0.97, + "type": "image", + "image_path": "e8f1dd4aee2e95fb37aee7ba9ac609bd8fce0a4c6bbedd073021aa180f59c5ff.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 108, + 80, + 503, + 134.0 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 108, + 134.0, + 503, + 188.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 108, + 188.0, + 503, + 242.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 255, + 505, + 286 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 254, + 506, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 254, + 435, + 267 + ], + "score": 1.0, + "content": "Figure 2: Rejection probabilities and average stopping times of the proposed test when", + "type": "text" + }, + { + "bbox": [ + 435, + 255, + 456, + 266 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 254, + 506, + 267 + ], + "score": 1.0, + "content": "is chosen as", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 264, + 505, + 277 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 443, + 277 + ], + "score": 1.0, + "content": "the spending function. From left to right: Scenario 1 with random design, Scenario 1 with", + "type": "text" + }, + { + "bbox": [ + 443, + 267, + 448, + 274 + ], + "score": 0.58, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 264, + 505, + 277 + ], + "score": 1.0, + "content": "-greedy design,", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 274, + 356, + 288 + ], + "spans": [ + { + "bbox": [ + 105, + 274, + 294, + 288 + ], + "score": 1.0, + "content": "Scenario 2 with random design and Scenario 2 with", + "type": "text" + }, + { + "bbox": [ + 294, + 277, + 299, + 284 + ], + "score": 0.66, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 274, + 356, + 288 + ], + "score": 1.0, + "content": "-greedy design.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "text", + "bbox": [ + 107, + 306, + 505, + 350 + ], + "lines": [], + "index": 7.5, + "bbox_fs": [ + 105, + 306, + 506, + 351 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 106, + 356, + 505, + 444 + ], + "lines": [ + { + "bbox": [ + 106, + 355, + 505, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 355, + 505, + 369 + ], + "score": 1.0, + "content": "We first conduct A/A experiments (which compare these two articles against themselves) to examine", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 106, + 367, + 506, + 379 + ], + "spans": [ + { + "bbox": [ + 106, + 367, + 506, + 379 + ], + "score": 1.0, + "content": "the validity of our test. The A/A experiments are done when every 2000 more users are available, we", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 378, + 506, + 390 + ], + "spans": [ + { + "bbox": [ + 105, + 378, + 506, + 390 + ], + "score": 1.0, + "content": "randomly assign 1000 users to arm A, and the other 1000 users in arm B. We expect our test will not", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 104, + 389, + 506, + 401 + ], + "spans": [ + { + "bbox": [ + 104, + 389, + 131, + 401 + ], + "score": 1.0, + "content": "reject", + "type": "text" + }, + { + "bbox": [ + 131, + 389, + 145, + 400 + ], + "score": 0.88, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 389, + 506, + 401 + ], + "score": 1.0, + "content": "in A/A experiments, since the articles being recommended are the same. Then, we conduct", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 399, + 506, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 399, + 506, + 414 + ], + "score": 1.0, + "content": "A/B experiment to test the QTE of these two articles. The test statistics and their corresponding", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 411, + 506, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 506, + 423 + ], + "score": 1.0, + "content": "critical values are plotted in Figure 3. On average it takes several seconds to implement our test. It", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 422, + 506, + 434 + ], + "spans": [ + { + "bbox": [ + 105, + 422, + 277, + 434 + ], + "score": 1.0, + "content": "can be seen that our test is able to be reject", + "type": "text" + }, + { + "bbox": [ + 278, + 422, + 292, + 433 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 422, + 506, + 434 + ], + "score": 1.0, + "content": "after obtaining the first one-third of the observations,", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 105, + 433, + 432, + 445 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 364, + 445 + ], + "score": 1.0, + "content": "in the A/B experiment. In the A/A experiments, we fail to reject", + "type": "text" + }, + { + "bbox": [ + 364, + 433, + 378, + 444 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 433, + 432, + 445 + ], + "score": 1.0, + "content": ", as expected.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 355, + 506, + 445 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 460, + 190, + 473 + ], + "lines": [ + { + "bbox": [ + 105, + 459, + 192, + 475 + ], + "spans": [ + { + "bbox": [ + 105, + 459, + 192, + 475 + ], + "score": 1.0, + "content": "5 DISCUSSION", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 486, + 505, + 529 + ], + "lines": [ + { + "bbox": [ + 105, + 484, + 505, + 499 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 505, + 499 + ], + "score": 1.0, + "content": "In this paper, we propose a new testing procedure for evaluating the performance of technology prod-", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 105, + 497, + 505, + 508 + ], + "spans": [ + { + "bbox": [ + 105, + 497, + 505, + 508 + ], + "score": 1.0, + "content": "ucts in tech companies based on the notion of qualitative treatment effects. Currently, we only focus", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "spans": [ + { + "bbox": [ + 105, + 507, + 505, + 520 + ], + "score": 1.0, + "content": "on comparing two products. It would be practically useful to develop a multiple testing procedure", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 518, + 470, + 531 + ], + "spans": [ + { + "bbox": [ + 105, + 518, + 470, + 531 + ], + "score": 1.0, + "content": "under settings with multiple treatment options. These topics warrant further investigations.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 20.5, + "bbox_fs": [ + 105, + 484, + 505, + 531 + ] + }, + { + "type": "image", + "bbox": [ + 106, + 554, + 503, + 714 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 106, + 554, + 503, + 714 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 106, + 554, + 503, + 714 + ], + "spans": [ + { + "bbox": [ + 106, + 554, + 503, + 714 + ], + "score": 0.969, + "type": "image", + "image_path": "d07ec0bda641ab04da632fa857aca2761150230607e09e18e0434c03477db667.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 106, + 554, + 503, + 607.3333333333334 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 106, + 607.3333333333334, + 503, + 660.6666666666667 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 106, + 660.6666666666667, + 503, + 714.0000000000001 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 227, + 719, + 384, + 730 + ], + "group_id": 1, + "lines": [ + { + "bbox": [ + 226, + 718, + 385, + 731 + ], + "spans": [ + { + "bbox": [ + 226, + 718, + 385, + 731 + ], + "score": 1.0, + "content": "Figure 3: Critical values and test statistics.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + } + ], + "index": 25.0 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 175, + 94 + ], + "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": [ + 107, + 100, + 503, + 134 + ], + "lines": [ + { + "bbox": [ + 106, + 100, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 505, + 113 + ], + "score": 1.0, + "content": "Donald W. K. Andrews and Xiaoxia Shi. Inference based on conditional moment inequali-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 116, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "ties. Econometrica, 81(2):609–666, 2013. ISSN 0012-9682. doi: 10.3982/ECTA9370. URL", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 122, + 325, + 136 + ], + "spans": [ + { + "bbox": [ + 116, + 122, + 325, + 136 + ], + "score": 1.0, + "content": "http://dx.doi.org/10.3982/ECTA9370.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 108, + 141, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "Donald W. K. Andrews and Xiaoxia Shi. Nonparametric inference based on conditional moment", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 153, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 115, + 153, + 505, + 166 + ], + "score": 1.0, + "content": "inequalities. J. Econometrics, 179(1):31–45, 2014. ISSN 0304-4076. doi: 10.1016/j.jeconom.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 482, + 178 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 482, + 178 + ], + "score": 1.0, + "content": "2013.10.005. URL http://dx.doi.org/10.1016/j.jeconom.2013.10.005.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 108, + 183, + 504, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 183, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 183, + 505, + 196 + ], + "score": 1.0, + "content": "Timothy B. Armstrong and Hock Peng Chan. Multiscale adaptive inference on conditional moment", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 505, + 207 + ], + "score": 1.0, + "content": "inequalities. J. Econometrics, 194(1):24–43, 2016. ISSN 0304-4076. doi: 10.1016/j.jeconom.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 482, + 219 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 482, + 219 + ], + "score": 1.0, + "content": "2016.04.001. URL http://dx.doi.org/10.1016/j.jeconom.2016.04.001.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 107, + 225, + 505, + 259 + ], + "lines": [ + { + "bbox": [ + 106, + 225, + 504, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 225, + 504, + 237 + ], + "score": 1.0, + "content": "Susan Athey and Guido Imbens. Recursive partitioning for heterogeneous causal effects. Proc. Natl.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 236, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 115, + 236, + 505, + 248 + ], + "score": 1.0, + "content": "Acad. Sci. USA, 113(27):7353–7360, 2016. ISSN 1091-6490. doi: 10.1073/pnas.1510489113.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 246, + 377, + 259 + ], + "spans": [ + { + "bbox": [ + 116, + 246, + 377, + 259 + ], + "score": 1.0, + "content": "URL https://doi.org/10.1073/pnas.1510489113.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 105, + 266, + 504, + 289 + ], + "lines": [ + { + "bbox": [ + 106, + 266, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 505, + 279 + ], + "score": 1.0, + "content": "Alexandre Belloni and Roberto I Oliveira. A high dimensional central limit theorem for martingales,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 277, + 444, + 290 + ], + "spans": [ + { + "bbox": [ + 116, + 277, + 444, + 290 + ], + "score": 1.0, + "content": "with applications to context tree models. arXiv preprint arXiv:1809.02741, 2018.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "text", + "bbox": [ + 106, + 297, + 504, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 297, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 505, + 309 + ], + "score": 1.0, + "content": "Bernard Bercu and Abderrahmen Touati. Exponential inequalities for self-normalized martingales", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 308, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 116, + 308, + 505, + 320 + ], + "score": 1.0, + "content": "with applications. Ann. Appl. Probab., 18(5):1848–1869, 2008. ISSN 1050-5164. doi: 10.1214/", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 319, + 397, + 331 + ], + "spans": [ + { + "bbox": [ + 116, + 319, + 397, + 331 + ], + "score": 1.0, + "content": "07-AAP506. URL https://doi.org/10.1214/07-AAP506.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 104, + 338, + 504, + 361 + ], + "lines": [ + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "Prabir Burman and Keh-Wei Chen. Nonparametric estimation of a regression function. Ann. Statist.,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 117, + 349, + 414, + 361 + ], + "spans": [ + { + "bbox": [ + 117, + 349, + 414, + 361 + ], + "score": 1.0, + "content": "17(4):1567–1596, 1989. ISSN 0090-5364. doi: 10.1214/aos/1176347382.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 106, + 368, + 504, + 403 + ], + "lines": [ + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "score": 1.0, + "content": "Minsu Chang, Sokbae Lee, and Yoon-Jae Whang. Nonparametric tests of conditional treatment", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 380, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 116, + 380, + 505, + 393 + ], + "score": 1.0, + "content": "effects with an application to single-sex schooling on academic achievements. Econom. J., 18(3):", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 117, + 391, + 255, + 402 + ], + "spans": [ + { + "bbox": [ + 117, + 391, + 255, + 402 + ], + "score": 1.0, + "content": "307–346, 2015. ISSN 1368-4221.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 410, + 504, + 444 + ], + "lines": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "Xiaohong Chen and Timothy M. Christensen. Optimal uniform convergence rates and asymptotic", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 422, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 116, + 422, + 505, + 434 + ], + "score": 1.0, + "content": "normality for series estimators under weak dependence and weak conditions. J. Econometrics,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 117, + 432, + 435, + 445 + ], + "spans": [ + { + "bbox": [ + 117, + 432, + 435, + 445 + ], + "score": 1.0, + "content": "188(2):447–465, 2015. ISSN 0304-4076. doi: 10.1016/j.jeconom.2015.03.010.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 107, + 451, + 503, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 451, + 504, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 504, + 464 + ], + "score": 1.0, + "content": "Victor Chernozhukov, Sokbae Lee, and Adam M. Rosen. Intersection bounds: estimation and in-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 116, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "ference. Econometrica, 81(2):667–737, 2013. ISSN 0012-9682. doi: 10.3982/ECTA8718. URL", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 117, + 475, + 325, + 486 + ], + "spans": [ + { + "bbox": [ + 117, + 475, + 325, + 486 + ], + "score": 1.0, + "content": "http://dx.doi.org/10.3982/ECTA8718.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 493, + 505, + 539 + ], + "lines": [ + { + "bbox": [ + 105, + 493, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 505, + 507 + ], + "score": 1.0, + "content": "Victor Chernozhukov, Denis Chetverikov, and Kengo Kato. Empirical and multiplier bootstraps", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 505, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 116, + 505, + 505, + 517 + ], + "score": 1.0, + "content": "for suprema of empirical processes of increasing complexity, and related Gaussian couplings.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 515, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 115, + 515, + 505, + 529 + ], + "score": 1.0, + "content": "Stochastic Process. Appl., 126(12):3632–3651, 2016. ISSN 0304-4149. doi: 10.1016/j.spa.2016.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 527, + 423, + 539 + ], + "spans": [ + { + "bbox": [ + 116, + 527, + 423, + 539 + ], + "score": 1.0, + "content": "04.009. URL https://doi.org/10.1016/j.spa.2016.04.009.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5 + }, + { + "type": "text", + "bbox": [ + 107, + 545, + 504, + 569 + ], + "lines": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "score": 1.0, + "content": "Victor Chernozhukov, Denis Chetverikov, and Kengo Kato. Detailed proof of nazarov’s inequality.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 557, + 279, + 569 + ], + "spans": [ + { + "bbox": [ + 116, + 557, + 279, + 569 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1711.10696, 2017.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5 + }, + { + "type": "text", + "bbox": [ + 104, + 576, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "score": 1.0, + "content": "M Gail and R Simon. Testing for qualitative interactions between treatment effects and patient", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 587, + 289, + 600 + ], + "spans": [ + { + "bbox": [ + 115, + 587, + 289, + 600 + ], + "score": 1.0, + "content": "subsets. Biometrics, 41(2):361–372, 1985.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5 + }, + { + "type": "text", + "bbox": [ + 106, + 606, + 504, + 630 + ], + "lines": [ + { + "bbox": [ + 106, + 605, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 620 + ], + "score": 1.0, + "content": "Yu-Chin Hsu. Consistent tests for conditional treatment effects. The Econometrics Journal, 20(1):", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 617, + 167, + 630 + ], + "spans": [ + { + "bbox": [ + 115, + 617, + 167, + 630 + ], + "score": 1.0, + "content": "1–22, 2017.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 106, + 637, + 504, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "score": 1.0, + "content": "Jianhua Z. Huang. Projection estimation in multiple regression with application to functional", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 116, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "ANOVA models. Ann. Statist., 26(1):242–272, 1998. ISSN 0090-5364. doi: 10.1214/aos/", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 117, + 659, + 172, + 671 + ], + "spans": [ + { + "bbox": [ + 117, + 659, + 172, + 671 + ], + "score": 1.0, + "content": "1030563984.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40 + }, + { + "type": "text", + "bbox": [ + 106, + 678, + 503, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "Christopher Jennison and Bruce W Turnbull. Group sequential methods with applications to clinical", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 690, + 270, + 702 + ], + "spans": [ + { + "bbox": [ + 115, + 690, + 270, + 702 + ], + "score": 1.0, + "content": "trials. Chapman and Hall/CRC, 1999.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5 + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 504, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 504, + 723 + ], + "score": 1.0, + "content": "Ramesh Johari, Leo Pekelis, and David J Walsh. Always valid inference: Bringing sequential anal-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 721, + 354, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 354, + 732 + ], + "score": 1.0, + "content": "ysis to a/b testing. arXiv preprint arXiv:1512.04922, 2015.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5 + } + ], + "page_idx": 8, + "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, + 751, + 309, + 762 + ], + "spans": [ + { + "bbox": [ + 302, + 751, + 309, + 762 + ], + "score": 1.0, + "content": "9", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 175, + 94 + ], + "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": [ + 107, + 100, + 503, + 134 + ], + "lines": [ + { + "bbox": [ + 106, + 100, + 505, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 100, + 505, + 113 + ], + "score": 1.0, + "content": "Donald W. K. Andrews and Xiaoxia Shi. Inference based on conditional moment inequali-", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 111, + 505, + 123 + ], + "spans": [ + { + "bbox": [ + 116, + 111, + 505, + 123 + ], + "score": 1.0, + "content": "ties. Econometrica, 81(2):609–666, 2013. ISSN 0012-9682. doi: 10.3982/ECTA9370. URL", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 116, + 122, + 325, + 136 + ], + "spans": [ + { + "bbox": [ + 116, + 122, + 325, + 136 + ], + "score": 1.0, + "content": "http://dx.doi.org/10.3982/ECTA9370.", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 100, + 505, + 136 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 141, + 504, + 176 + ], + "lines": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "spans": [ + { + "bbox": [ + 106, + 142, + 505, + 154 + ], + "score": 1.0, + "content": "Donald W. K. Andrews and Xiaoxia Shi. Nonparametric inference based on conditional moment", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 153, + 505, + 166 + ], + "spans": [ + { + "bbox": [ + 115, + 153, + 505, + 166 + ], + "score": 1.0, + "content": "inequalities. J. Econometrics, 179(1):31–45, 2014. ISSN 0304-4076. doi: 10.1016/j.jeconom.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 115, + 163, + 482, + 178 + ], + "spans": [ + { + "bbox": [ + 115, + 163, + 482, + 178 + ], + "score": 1.0, + "content": "2013.10.005. URL http://dx.doi.org/10.1016/j.jeconom.2013.10.005.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 106, + 142, + 505, + 178 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 183, + 504, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 183, + 505, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 183, + 505, + 196 + ], + "score": 1.0, + "content": "Timothy B. Armstrong and Hock Peng Chan. Multiscale adaptive inference on conditional moment", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 194, + 505, + 207 + ], + "spans": [ + { + "bbox": [ + 115, + 194, + 505, + 207 + ], + "score": 1.0, + "content": "inequalities. J. Econometrics, 194(1):24–43, 2016. ISSN 0304-4076. doi: 10.1016/j.jeconom.", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 115, + 204, + 482, + 219 + ], + "spans": [ + { + "bbox": [ + 115, + 204, + 482, + 219 + ], + "score": 1.0, + "content": "2016.04.001. URL http://dx.doi.org/10.1016/j.jeconom.2016.04.001.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 183, + 505, + 219 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 225, + 505, + 259 + ], + "lines": [ + { + "bbox": [ + 106, + 225, + 504, + 237 + ], + "spans": [ + { + "bbox": [ + 106, + 225, + 504, + 237 + ], + "score": 1.0, + "content": "Susan Athey and Guido Imbens. Recursive partitioning for heterogeneous causal effects. Proc. Natl.", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 115, + 236, + 505, + 248 + ], + "spans": [ + { + "bbox": [ + 115, + 236, + 505, + 248 + ], + "score": 1.0, + "content": "Acad. Sci. USA, 113(27):7353–7360, 2016. ISSN 1091-6490. doi: 10.1073/pnas.1510489113.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 116, + 246, + 377, + 259 + ], + "spans": [ + { + "bbox": [ + 116, + 246, + 377, + 259 + ], + "score": 1.0, + "content": "URL https://doi.org/10.1073/pnas.1510489113.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 225, + 505, + 259 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 266, + 504, + 289 + ], + "lines": [ + { + "bbox": [ + 106, + 266, + 505, + 279 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 505, + 279 + ], + "score": 1.0, + "content": "Alexandre Belloni and Roberto I Oliveira. A high dimensional central limit theorem for martingales,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 116, + 277, + 444, + 290 + ], + "spans": [ + { + "bbox": [ + 116, + 277, + 444, + 290 + ], + "score": 1.0, + "content": "with applications to context tree models. arXiv preprint arXiv:1809.02741, 2018.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 106, + 266, + 505, + 290 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 297, + 504, + 331 + ], + "lines": [ + { + "bbox": [ + 106, + 297, + 505, + 309 + ], + "spans": [ + { + "bbox": [ + 106, + 297, + 505, + 309 + ], + "score": 1.0, + "content": "Bernard Bercu and Abderrahmen Touati. Exponential inequalities for self-normalized martingales", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 116, + 308, + 505, + 320 + ], + "spans": [ + { + "bbox": [ + 116, + 308, + 505, + 320 + ], + "score": 1.0, + "content": "with applications. Ann. Appl. Probab., 18(5):1848–1869, 2008. ISSN 1050-5164. doi: 10.1214/", + "type": "text" + } + ], + "index": 16 + }, + { + "bbox": [ + 116, + 319, + 397, + 331 + ], + "spans": [ + { + "bbox": [ + 116, + 319, + 397, + 331 + ], + "score": 1.0, + "content": "07-AAP506. URL https://doi.org/10.1214/07-AAP506.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 297, + 505, + 331 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 338, + 504, + 361 + ], + "lines": [ + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "spans": [ + { + "bbox": [ + 105, + 338, + 505, + 351 + ], + "score": 1.0, + "content": "Prabir Burman and Keh-Wei Chen. Nonparametric estimation of a regression function. Ann. Statist.,", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 117, + 349, + 414, + 361 + ], + "spans": [ + { + "bbox": [ + 117, + 349, + 414, + 361 + ], + "score": 1.0, + "content": "17(4):1567–1596, 1989. ISSN 0090-5364. doi: 10.1214/aos/1176347382.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 338, + 505, + 361 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 368, + 504, + 403 + ], + "lines": [ + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "spans": [ + { + "bbox": [ + 105, + 369, + 505, + 381 + ], + "score": 1.0, + "content": "Minsu Chang, Sokbae Lee, and Yoon-Jae Whang. Nonparametric tests of conditional treatment", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 116, + 380, + 505, + 393 + ], + "spans": [ + { + "bbox": [ + 116, + 380, + 505, + 393 + ], + "score": 1.0, + "content": "effects with an application to single-sex schooling on academic achievements. Econom. J., 18(3):", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 117, + 391, + 255, + 402 + ], + "spans": [ + { + "bbox": [ + 117, + 391, + 255, + 402 + ], + "score": 1.0, + "content": "307–346, 2015. ISSN 1368-4221.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 369, + 505, + 402 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 410, + 504, + 444 + ], + "lines": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "spans": [ + { + "bbox": [ + 106, + 411, + 505, + 423 + ], + "score": 1.0, + "content": "Xiaohong Chen and Timothy M. Christensen. Optimal uniform convergence rates and asymptotic", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 422, + 505, + 434 + ], + "spans": [ + { + "bbox": [ + 116, + 422, + 505, + 434 + ], + "score": 1.0, + "content": "normality for series estimators under weak dependence and weak conditions. J. Econometrics,", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 117, + 432, + 435, + 445 + ], + "spans": [ + { + "bbox": [ + 117, + 432, + 435, + 445 + ], + "score": 1.0, + "content": "188(2):447–465, 2015. ISSN 0304-4076. doi: 10.1016/j.jeconom.2015.03.010.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 106, + 411, + 505, + 445 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 451, + 503, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 451, + 504, + 464 + ], + "spans": [ + { + "bbox": [ + 106, + 451, + 504, + 464 + ], + "score": 1.0, + "content": "Victor Chernozhukov, Sokbae Lee, and Adam M. Rosen. Intersection bounds: estimation and in-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 463, + 505, + 475 + ], + "spans": [ + { + "bbox": [ + 116, + 463, + 505, + 475 + ], + "score": 1.0, + "content": "ference. Econometrica, 81(2):667–737, 2013. ISSN 0012-9682. doi: 10.3982/ECTA8718. URL", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 117, + 475, + 325, + 486 + ], + "spans": [ + { + "bbox": [ + 117, + 475, + 325, + 486 + ], + "score": 1.0, + "content": "http://dx.doi.org/10.3982/ECTA8718.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 451, + 505, + 486 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 493, + 505, + 539 + ], + "lines": [ + { + "bbox": [ + 105, + 493, + 505, + 507 + ], + "spans": [ + { + "bbox": [ + 105, + 493, + 505, + 507 + ], + "score": 1.0, + "content": "Victor Chernozhukov, Denis Chetverikov, and Kengo Kato. Empirical and multiplier bootstraps", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 116, + 505, + 505, + 517 + ], + "spans": [ + { + "bbox": [ + 116, + 505, + 505, + 517 + ], + "score": 1.0, + "content": "for suprema of empirical processes of increasing complexity, and related Gaussian couplings.", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 115, + 515, + 505, + 529 + ], + "spans": [ + { + "bbox": [ + 115, + 515, + 505, + 529 + ], + "score": 1.0, + "content": "Stochastic Process. Appl., 126(12):3632–3651, 2016. ISSN 0304-4149. doi: 10.1016/j.spa.2016.", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 116, + 527, + 423, + 539 + ], + "spans": [ + { + "bbox": [ + 116, + 527, + 423, + 539 + ], + "score": 1.0, + "content": "04.009. URL https://doi.org/10.1016/j.spa.2016.04.009.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 493, + 505, + 539 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 545, + 504, + 569 + ], + "lines": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "spans": [ + { + "bbox": [ + 105, + 544, + 505, + 559 + ], + "score": 1.0, + "content": "Victor Chernozhukov, Denis Chetverikov, and Kengo Kato. Detailed proof of nazarov’s inequality.", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 557, + 279, + 569 + ], + "spans": [ + { + "bbox": [ + 116, + 557, + 279, + 569 + ], + "score": 1.0, + "content": "arXiv preprint arXiv:1711.10696, 2017.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 33.5, + "bbox_fs": [ + 105, + 544, + 505, + 569 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 576, + 505, + 599 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 505, + 589 + ], + "score": 1.0, + "content": "M Gail and R Simon. Testing for qualitative interactions between treatment effects and patient", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 115, + 587, + 289, + 600 + ], + "spans": [ + { + "bbox": [ + 115, + 587, + 289, + 600 + ], + "score": 1.0, + "content": "subsets. Biometrics, 41(2):361–372, 1985.", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 576, + 505, + 600 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 606, + 504, + 630 + ], + "lines": [ + { + "bbox": [ + 106, + 605, + 505, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 505, + 620 + ], + "score": 1.0, + "content": "Yu-Chin Hsu. Consistent tests for conditional treatment effects. The Econometrics Journal, 20(1):", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 617, + 167, + 630 + ], + "spans": [ + { + "bbox": [ + 115, + 617, + 167, + 630 + ], + "score": 1.0, + "content": "1–22, 2017.", + "type": "text" + } + ], + "index": 38 + } + ], + "index": 37.5, + "bbox_fs": [ + 106, + 605, + 505, + 630 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 637, + 504, + 671 + ], + "lines": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 106, + 637, + 505, + 649 + ], + "score": 1.0, + "content": "Jianhua Z. Huang. Projection estimation in multiple regression with application to functional", + "type": "text" + } + ], + "index": 39 + }, + { + "bbox": [ + 116, + 648, + 505, + 660 + ], + "spans": [ + { + "bbox": [ + 116, + 648, + 505, + 660 + ], + "score": 1.0, + "content": "ANOVA models. Ann. Statist., 26(1):242–272, 1998. ISSN 0090-5364. doi: 10.1214/aos/", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 117, + 659, + 172, + 671 + ], + "spans": [ + { + "bbox": [ + 117, + 659, + 172, + 671 + ], + "score": 1.0, + "content": "1030563984.", + "type": "text" + } + ], + "index": 41 + } + ], + "index": 40, + "bbox_fs": [ + 106, + 637, + 505, + 671 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 678, + 503, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 678, + 505, + 691 + ], + "spans": [ + { + "bbox": [ + 106, + 678, + 505, + 691 + ], + "score": 1.0, + "content": "Christopher Jennison and Bruce W Turnbull. Group sequential methods with applications to clinical", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 115, + 690, + 270, + 702 + ], + "spans": [ + { + "bbox": [ + 115, + 690, + 270, + 702 + ], + "score": 1.0, + "content": "trials. Chapman and Hall/CRC, 1999.", + "type": "text" + } + ], + "index": 43 + } + ], + "index": 42.5, + "bbox_fs": [ + 106, + 678, + 505, + 702 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 709, + 502, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 504, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 504, + 723 + ], + "score": 1.0, + "content": "Ramesh Johari, Leo Pekelis, and David J Walsh. Always valid inference: Bringing sequential anal-", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 115, + 721, + 354, + 732 + ], + "spans": [ + { + "bbox": [ + 115, + 721, + 354, + 732 + ], + "score": 1.0, + "content": "ysis to a/b testing. arXiv preprint arXiv:1512.04922, 2015.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44.5, + "bbox_fs": [ + 105, + 708, + 504, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 503, + 117 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Ramesh Johari, Pete Koomen, Leonid Pekelis, and David Walsh. Peeking at a/b tests: Why it mat-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "ters, and what to do about it. In Proceedings of the 23rd ACM SIGKDD International Conference", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 410, + 117 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 410, + 117 + ], + "score": 1.0, + "content": "on Knowledge Discovery and Data Mining, pp. 1517–1525. ACM, 2017.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 506, + 167 + ], + "lines": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Nianqiao Ju, Diane Hu, Adam Henderson, and Liangjie Hong. A sequential test for selecting the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 505, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 505, + 147 + ], + "score": 1.0, + "content": "better variant: Online a/b testing, adaptive allocation, and continuous monitoring. In Proceedings", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 145, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 115, + 145, + 505, + 158 + ], + "score": 1.0, + "content": "of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 492–500.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 156, + 169, + 168 + ], + "spans": [ + { + "bbox": [ + 116, + 156, + 169, + 168 + ], + "score": 1.0, + "content": "ACM, 2019.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5 + }, + { + "type": "text", + "bbox": [ + 106, + 175, + 506, + 220 + ], + "lines": [ + { + "bbox": [ + 106, + 176, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 505, + 188 + ], + "score": 1.0, + "content": "Eugene Kharitonov, Aleksandr Vorobev, Craig Macdonald, Pavel Serdyukov, and Iadh Ounis. Se-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 187, + 506, + 199 + ], + "spans": [ + { + "bbox": [ + 115, + 187, + 506, + 199 + ], + "score": 1.0, + "content": "quential testing for early stopping of online experiments. In Proceedings of the 38th International", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 114, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 114, + 197, + 506, + 211 + ], + "score": 1.0, + "content": "ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 473–482.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 208, + 169, + 221 + ], + "spans": [ + { + "bbox": [ + 115, + 208, + 169, + 221 + ], + "score": 1.0, + "content": "ACM, 2015.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5 + }, + { + "type": "text", + "bbox": [ + 106, + 227, + 505, + 261 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "K. K. Gordon Lan and David L. DeMets. Discrete sequential boundaries for clinical trials.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 237, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 115, + 237, + 505, + 252 + ], + "score": 1.0, + "content": "Biometrika, 70(3):659–663, 1983. ISSN 0006-3444. doi: 10.2307/2336502. URL https:", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 117, + 250, + 270, + 261 + ], + "spans": [ + { + "bbox": [ + 117, + 250, + 270, + 261 + ], + "score": 1.0, + "content": "//doi.org/10.2307/2336502.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 107, + 268, + 504, + 303 + ], + "lines": [ + { + "bbox": [ + 106, + 269, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 506, + 281 + ], + "score": 1.0, + "content": "Gregory Morrow and Walter Philipp. An almost sure invariance principle for Hilbert space valued", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 280, + 506, + 292 + ], + "spans": [ + { + "bbox": [ + 116, + 280, + 506, + 292 + ], + "score": 1.0, + "content": "martingales. Trans. Amer. Math. Soc., 273(1):231–251, 1982. ISSN 0002-9947. doi: 10.2307/", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 117, + 291, + 371, + 303 + ], + "spans": [ + { + "bbox": [ + 117, + 291, + 371, + 303 + ], + "score": 1.0, + "content": "1999203. URL https://doi.org/10.2307/1999203.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 309, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "score": 1.0, + "content": "Jeremy Roth and Noah Simon. A framework for estimating and testing qualitative interac-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 321, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 115, + 321, + 505, + 333 + ], + "score": 1.0, + "content": "tions with applications to predictive biomarkers. Biostatistics, 19(3):263–280, 2018. ISSN", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 331, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 116, + 331, + 505, + 343 + ], + "score": 1.0, + "content": "1468-4357. doi: 10.1093/biostatistics/kxx038. URL https://doi.org/10.1093/", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 343, + 241, + 354 + ], + "spans": [ + { + "bbox": [ + 116, + 343, + 241, + 354 + ], + "score": 1.0, + "content": "biostatistics/kxx038.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5 + }, + { + "type": "text", + "bbox": [ + 105, + 361, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 505, + 374 + ], + "score": 1.0, + "content": "D.B. Rubin. Estimating causal effects of treatments in randomized and non-randomized studies. J.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 117, + 373, + 254, + 384 + ], + "spans": [ + { + "bbox": [ + 117, + 373, + 254, + 384 + ], + "score": 1.0, + "content": "Edu. Psychol., 66:688–701, 1974.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 107, + 392, + 505, + 426 + ], + "lines": [ + { + "bbox": [ + 105, + 391, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 505, + 405 + ], + "score": 1.0, + "content": "Donald B. Rubin. Causal inference using potential outcomes: design, modeling, decisions. J. Amer.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 116, + 402, + 505, + 415 + ], + "score": 1.0, + "content": "Statist. Assoc., 100(469):322–331, 2005. ISSN 0162-1459. doi: 10.1198/016214504000001880.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 117, + 414, + 395, + 426 + ], + "spans": [ + { + "bbox": [ + 117, + 414, + 395, + 426 + ], + "score": 1.0, + "content": "URL https://doi.org/10.1198/016214504000001880.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 433, + 505, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 433, + 504, + 445 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 504, + 445 + ], + "score": 1.0, + "content": "Chengchun Shi, Wenbin Lu, and Rui Song. A sparse random projection-based test for overall qual-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 444, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 116, + 444, + 505, + 456 + ], + "score": 1.0, + "content": "itative treatment effects. Journal of the American Statistical Association, 115(531):12011213,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 453, + 147, + 467 + ], + "spans": [ + { + "bbox": [ + 115, + 453, + 147, + 467 + ], + "score": 1.0, + "content": "2020a.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 504, + 497 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "Chengchun Shi, Sheng Zhang, Rui Song, and Wenbin Lu. Statistical Inference of the Value Function", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 114, + 485, + 432, + 497 + ], + "spans": [ + { + "bbox": [ + 114, + 485, + 432, + 497 + ], + "score": 1.0, + "content": "for Reinforcement Learning in Infinite Horizon Settings. Under review, 2020b.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5 + }, + { + "type": "text", + "bbox": [ + 106, + 504, + 504, + 527 + ], + "lines": [ + { + "bbox": [ + 106, + 503, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 506, + 518 + ], + "score": 1.0, + "content": "Charles J. Stone. Optimal global rates of convergence for nonparametric regression. Ann. Statist.,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 117, + 515, + 288, + 527 + ], + "spans": [ + { + "bbox": [ + 117, + 515, + 288, + 527 + ], + "score": 1.0, + "content": "10(4):1040–1053, 1982. ISSN 0090-5364.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5 + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 505, + 568 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 506, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 547 + ], + "score": 1.0, + "content": "Matt Taddy, Matt Gardner, Liyun Chen, and David Draper. A nonparametric bayesian analysis", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 546, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 116, + 546, + 505, + 558 + ], + "score": 1.0, + "content": "of heterogenous treatment effects in digital experimentation. Journal of Business & Economic", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 556, + 247, + 568 + ], + "spans": [ + { + "bbox": [ + 116, + 556, + 247, + 568 + ], + "score": 1.0, + "content": "Statistics, 34(4):661–672, 2016.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34 + }, + { + "type": "text", + "bbox": [ + 106, + 575, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 106, + 575, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 505, + 588 + ], + "score": 1.0, + "content": "Stefan Wager and Susan Athey. Estimation and inference of heterogeneous treatment effects us-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 586, + 505, + 598 + ], + "spans": [ + { + "bbox": [ + 115, + 586, + 505, + 598 + ], + "score": 1.0, + "content": "ing random forests. J. Amer. Statist. Assoc., 113(523):1228–1242, 2018. ISSN 0162-1459.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 597, + 504, + 609 + ], + "spans": [ + { + "bbox": [ + 115, + 597, + 504, + 609 + ], + "score": 1.0, + "content": "doi: 10.1080/01621459.2017.1319839. URL https://doi.org/10.1080/01621459.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 609, + 194, + 620 + ], + "spans": [ + { + "bbox": [ + 116, + 609, + 194, + 620 + ], + "score": 1.0, + "content": "2017.1319839.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5 + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 504, + 662 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "score": 1.0, + "content": "C.-F. J. Wu. Jackknife, bootstrap and other resampling methods in regression analysis. Ann. Statist.,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "14(4):1261–1350, 1986. ISSN 0090-5364. doi: 10.1214/aos/1176350142. URL https://", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 117, + 650, + 487, + 662 + ], + "spans": [ + { + "bbox": [ + 117, + 650, + 487, + 662 + ], + "score": 1.0, + "content": "doi.org/10.1214/aos/1176350142. With discussion and a rejoinder by the author.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41 + }, + { + "type": "text", + "bbox": [ + 106, + 668, + 505, + 702 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "Fanny Yang, Aaditya Ramdas, Kevin G Jamieson, and Martin J Wainwright. A framework for multi-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 114, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 114, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "a (rmed)/b (andit) testing with online fdr control. In Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 690, + 243, + 703 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 243, + 703 + ], + "score": 1.0, + "content": "Systems, pp. 5957–5966, 2017.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44 + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "Miao Yu, Wenbin Lu, and Rui Song. A new framework for online testing of heterogeneous treatment", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 117, + 720, + 281, + 732 + ], + "spans": [ + { + "bbox": [ + 117, + 720, + 281, + 732 + ], + "score": 1.0, + "content": "effect. In AAAI, pp. 10310–10317, 2020.", + "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, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "10", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 503, + 117 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 505, + 95 + ], + "score": 1.0, + "content": "Ramesh Johari, Pete Koomen, Leonid Pekelis, and David Walsh. Peeking at a/b tests: Why it mat-", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 116, + 94, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 116, + 94, + 505, + 106 + ], + "score": 1.0, + "content": "ters, and what to do about it. In Proceedings of the 23rd ACM SIGKDD International Conference", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 104, + 410, + 117 + ], + "spans": [ + { + "bbox": [ + 116, + 104, + 410, + 117 + ], + "score": 1.0, + "content": "on Knowledge Discovery and Data Mining, pp. 1517–1525. ACM, 2017.", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 505, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 123, + 506, + 167 + ], + "lines": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "spans": [ + { + "bbox": [ + 105, + 123, + 505, + 136 + ], + "score": 1.0, + "content": "Nianqiao Ju, Diane Hu, Adam Henderson, and Liangjie Hong. A sequential test for selecting the", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 115, + 134, + 505, + 147 + ], + "spans": [ + { + "bbox": [ + 115, + 134, + 505, + 147 + ], + "score": 1.0, + "content": "better variant: Online a/b testing, adaptive allocation, and continuous monitoring. In Proceedings", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 115, + 145, + 505, + 158 + ], + "spans": [ + { + "bbox": [ + 115, + 145, + 505, + 158 + ], + "score": 1.0, + "content": "of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 492–500.", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 116, + 156, + 169, + 168 + ], + "spans": [ + { + "bbox": [ + 116, + 156, + 169, + 168 + ], + "score": 1.0, + "content": "ACM, 2019.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 4.5, + "bbox_fs": [ + 105, + 123, + 505, + 168 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 175, + 506, + 220 + ], + "lines": [ + { + "bbox": [ + 106, + 176, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 106, + 176, + 505, + 188 + ], + "score": 1.0, + "content": "Eugene Kharitonov, Aleksandr Vorobev, Craig Macdonald, Pavel Serdyukov, and Iadh Ounis. Se-", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 115, + 187, + 506, + 199 + ], + "spans": [ + { + "bbox": [ + 115, + 187, + 506, + 199 + ], + "score": 1.0, + "content": "quential testing for early stopping of online experiments. In Proceedings of the 38th International", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 114, + 197, + 506, + 211 + ], + "spans": [ + { + "bbox": [ + 114, + 197, + 506, + 211 + ], + "score": 1.0, + "content": "ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 473–482.", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 115, + 208, + 169, + 221 + ], + "spans": [ + { + "bbox": [ + 115, + 208, + 169, + 221 + ], + "score": 1.0, + "content": "ACM, 2015.", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 8.5, + "bbox_fs": [ + 106, + 176, + 506, + 221 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 227, + 505, + 261 + ], + "lines": [ + { + "bbox": [ + 106, + 227, + 505, + 240 + ], + "spans": [ + { + "bbox": [ + 106, + 227, + 505, + 240 + ], + "score": 1.0, + "content": "K. K. Gordon Lan and David L. DeMets. Discrete sequential boundaries for clinical trials.", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 115, + 237, + 505, + 252 + ], + "spans": [ + { + "bbox": [ + 115, + 237, + 505, + 252 + ], + "score": 1.0, + "content": "Biometrika, 70(3):659–663, 1983. ISSN 0006-3444. doi: 10.2307/2336502. URL https:", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 117, + 250, + 270, + 261 + ], + "spans": [ + { + "bbox": [ + 117, + 250, + 270, + 261 + ], + "score": 1.0, + "content": "//doi.org/10.2307/2336502.", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 227, + 505, + 261 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 268, + 504, + 303 + ], + "lines": [ + { + "bbox": [ + 106, + 269, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 269, + 506, + 281 + ], + "score": 1.0, + "content": "Gregory Morrow and Walter Philipp. An almost sure invariance principle for Hilbert space valued", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 116, + 280, + 506, + 292 + ], + "spans": [ + { + "bbox": [ + 116, + 280, + 506, + 292 + ], + "score": 1.0, + "content": "martingales. Trans. Amer. Math. Soc., 273(1):231–251, 1982. ISSN 0002-9947. doi: 10.2307/", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 117, + 291, + 371, + 303 + ], + "spans": [ + { + "bbox": [ + 117, + 291, + 371, + 303 + ], + "score": 1.0, + "content": "1999203. URL https://doi.org/10.2307/1999203.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 106, + 269, + 506, + 303 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 309, + 505, + 354 + ], + "lines": [ + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "spans": [ + { + "bbox": [ + 105, + 309, + 505, + 322 + ], + "score": 1.0, + "content": "Jeremy Roth and Noah Simon. A framework for estimating and testing qualitative interac-", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 115, + 321, + 505, + 333 + ], + "spans": [ + { + "bbox": [ + 115, + 321, + 505, + 333 + ], + "score": 1.0, + "content": "tions with applications to predictive biomarkers. Biostatistics, 19(3):263–280, 2018. ISSN", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 116, + 331, + 505, + 343 + ], + "spans": [ + { + "bbox": [ + 116, + 331, + 505, + 343 + ], + "score": 1.0, + "content": "1468-4357. doi: 10.1093/biostatistics/kxx038. URL https://doi.org/10.1093/", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 116, + 343, + 241, + 354 + ], + "spans": [ + { + "bbox": [ + 116, + 343, + 241, + 354 + ], + "score": 1.0, + "content": "biostatistics/kxx038.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 309, + 505, + 354 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 361, + 504, + 384 + ], + "lines": [ + { + "bbox": [ + 106, + 361, + 505, + 374 + ], + "spans": [ + { + "bbox": [ + 106, + 361, + 505, + 374 + ], + "score": 1.0, + "content": "D.B. Rubin. Estimating causal effects of treatments in randomized and non-randomized studies. J.", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 117, + 373, + 254, + 384 + ], + "spans": [ + { + "bbox": [ + 117, + 373, + 254, + 384 + ], + "score": 1.0, + "content": "Edu. Psychol., 66:688–701, 1974.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 106, + 361, + 505, + 384 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 392, + 505, + 426 + ], + "lines": [ + { + "bbox": [ + 105, + 391, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 105, + 391, + 505, + 405 + ], + "score": 1.0, + "content": "Donald B. Rubin. Causal inference using potential outcomes: design, modeling, decisions. J. Amer.", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 116, + 402, + 505, + 415 + ], + "spans": [ + { + "bbox": [ + 116, + 402, + 505, + 415 + ], + "score": 1.0, + "content": "Statist. Assoc., 100(469):322–331, 2005. ISSN 0162-1459. doi: 10.1198/016214504000001880.", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 117, + 414, + 395, + 426 + ], + "spans": [ + { + "bbox": [ + 117, + 414, + 395, + 426 + ], + "score": 1.0, + "content": "URL https://doi.org/10.1198/016214504000001880.", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 391, + 505, + 426 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 433, + 505, + 466 + ], + "lines": [ + { + "bbox": [ + 106, + 433, + 504, + 445 + ], + "spans": [ + { + "bbox": [ + 106, + 433, + 504, + 445 + ], + "score": 1.0, + "content": "Chengchun Shi, Wenbin Lu, and Rui Song. A sparse random projection-based test for overall qual-", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 116, + 444, + 505, + 456 + ], + "spans": [ + { + "bbox": [ + 116, + 444, + 505, + 456 + ], + "score": 1.0, + "content": "itative treatment effects. Journal of the American Statistical Association, 115(531):12011213,", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 115, + 453, + 147, + 467 + ], + "spans": [ + { + "bbox": [ + 115, + 453, + 147, + 467 + ], + "score": 1.0, + "content": "2020a.", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 433, + 505, + 467 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 504, + 497 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 505, + 487 + ], + "score": 1.0, + "content": "Chengchun Shi, Sheng Zhang, Rui Song, and Wenbin Lu. Statistical Inference of the Value Function", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 114, + 485, + 432, + 497 + ], + "spans": [ + { + "bbox": [ + 114, + 485, + 432, + 497 + ], + "score": 1.0, + "content": "for Reinforcement Learning in Infinite Horizon Settings. Under review, 2020b.", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 29.5, + "bbox_fs": [ + 106, + 474, + 505, + 497 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 504, + 504, + 527 + ], + "lines": [ + { + "bbox": [ + 106, + 503, + 506, + 518 + ], + "spans": [ + { + "bbox": [ + 106, + 503, + 506, + 518 + ], + "score": 1.0, + "content": "Charles J. Stone. Optimal global rates of convergence for nonparametric regression. Ann. Statist.,", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 117, + 515, + 288, + 527 + ], + "spans": [ + { + "bbox": [ + 117, + 515, + 288, + 527 + ], + "score": 1.0, + "content": "10(4):1040–1053, 1982. ISSN 0090-5364.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 31.5, + "bbox_fs": [ + 106, + 503, + 506, + 527 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 505, + 568 + ], + "lines": [ + { + "bbox": [ + 105, + 533, + 506, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 533, + 506, + 547 + ], + "score": 1.0, + "content": "Matt Taddy, Matt Gardner, Liyun Chen, and David Draper. A nonparametric bayesian analysis", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 116, + 546, + 505, + 558 + ], + "spans": [ + { + "bbox": [ + 116, + 546, + 505, + 558 + ], + "score": 1.0, + "content": "of heterogenous treatment effects in digital experimentation. Journal of Business & Economic", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 116, + 556, + 247, + 568 + ], + "spans": [ + { + "bbox": [ + 116, + 556, + 247, + 568 + ], + "score": 1.0, + "content": "Statistics, 34(4):661–672, 2016.", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34, + "bbox_fs": [ + 105, + 533, + 506, + 568 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 575, + 505, + 620 + ], + "lines": [ + { + "bbox": [ + 106, + 575, + 505, + 588 + ], + "spans": [ + { + "bbox": [ + 106, + 575, + 505, + 588 + ], + "score": 1.0, + "content": "Stefan Wager and Susan Athey. Estimation and inference of heterogeneous treatment effects us-", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 115, + 586, + 505, + 598 + ], + "spans": [ + { + "bbox": [ + 115, + 586, + 505, + 598 + ], + "score": 1.0, + "content": "ing random forests. J. Amer. Statist. Assoc., 113(523):1228–1242, 2018. ISSN 0162-1459.", + "type": "text" + } + ], + "index": 37 + }, + { + "bbox": [ + 115, + 597, + 504, + 609 + ], + "spans": [ + { + "bbox": [ + 115, + 597, + 504, + 609 + ], + "score": 1.0, + "content": "doi: 10.1080/01621459.2017.1319839. URL https://doi.org/10.1080/01621459.", + "type": "text" + } + ], + "index": 38 + }, + { + "bbox": [ + 116, + 609, + 194, + 620 + ], + "spans": [ + { + "bbox": [ + 116, + 609, + 194, + 620 + ], + "score": 1.0, + "content": "2017.1319839.", + "type": "text" + } + ], + "index": 39 + } + ], + "index": 37.5, + "bbox_fs": [ + 106, + 575, + 505, + 620 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 627, + 504, + 662 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 505, + 640 + ], + "score": 1.0, + "content": "C.-F. J. Wu. Jackknife, bootstrap and other resampling methods in regression analysis. Ann. Statist.,", + "type": "text" + } + ], + "index": 40 + }, + { + "bbox": [ + 116, + 637, + 505, + 651 + ], + "spans": [ + { + "bbox": [ + 116, + 637, + 505, + 651 + ], + "score": 1.0, + "content": "14(4):1261–1350, 1986. ISSN 0090-5364. doi: 10.1214/aos/1176350142. URL https://", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 117, + 650, + 487, + 662 + ], + "spans": [ + { + "bbox": [ + 117, + 650, + 487, + 662 + ], + "score": 1.0, + "content": "doi.org/10.1214/aos/1176350142. With discussion and a rejoinder by the author.", + "type": "text" + } + ], + "index": 42 + } + ], + "index": 41, + "bbox_fs": [ + 106, + 627, + 505, + 662 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 668, + 505, + 702 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 505, + 681 + ], + "score": 1.0, + "content": "Fanny Yang, Aaditya Ramdas, Kevin G Jamieson, and Martin J Wainwright. A framework for multi-", + "type": "text" + } + ], + "index": 43 + }, + { + "bbox": [ + 114, + 678, + 505, + 693 + ], + "spans": [ + { + "bbox": [ + 114, + 678, + 505, + 693 + ], + "score": 1.0, + "content": "a (rmed)/b (andit) testing with online fdr control. In Advances in Neural Information Processing", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 116, + 690, + 243, + 703 + ], + "spans": [ + { + "bbox": [ + 116, + 690, + 243, + 703 + ], + "score": 1.0, + "content": "Systems, pp. 5957–5966, 2017.", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 44, + "bbox_fs": [ + 105, + 668, + 505, + 703 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 709, + 503, + 732 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 505, + 723 + ], + "score": 1.0, + "content": "Miao Yu, Wenbin Lu, and Rui Song. A new framework for online testing of heterogeneous treatment", + "type": "text" + } + ], + "index": 46 + }, + { + "bbox": [ + 117, + 720, + 281, + 732 + ], + "spans": [ + { + "bbox": [ + 117, + 720, + 281, + 732 + ], + "score": 1.0, + "content": "effect. In AAAI, pp. 10310–10317, 2020.", + "type": "text" + } + ], + "index": 47 + } + ], + "index": 46.5, + "bbox_fs": [ + 105, + 708, + 505, + 732 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 118, + 83, + 393, + 94 + ], + "lines": [ + { + "bbox": [ + 116, + 81, + 393, + 97 + ], + "spans": [ + { + "bbox": [ + 116, + 81, + 267, + 97 + ], + "score": 1.0, + "content": "Input: Number of bootstrap samples", + "type": "text" + }, + { + "bbox": [ + 267, + 83, + 276, + 93 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 81, + 291, + 97 + ], + "score": 1.0, + "content": ", an", + "type": "text" + }, + { + "bbox": [ + 292, + 85, + 299, + 93 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 81, + 375, + 97 + ], + "score": 1.0, + "content": "spending function", + "type": "text" + }, + { + "bbox": [ + 375, + 83, + 393, + 95 + ], + "score": 0.9, + "content": "\\alpha ( \\cdot )", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 116, + 95, + 461, + 127 + ], + "lines": [ + { + "bbox": [ + 114, + 91, + 462, + 111 + ], + "spans": [ + { + "bbox": [ + 114, + 91, + 163, + 111 + ], + "score": 1.0, + "content": "Initialize:", + "type": "text" + }, + { + "bbox": [ + 163, + 95, + 189, + 106 + ], + "score": 0.83, + "content": "n = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 91, + 193, + 111 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 193, + 94, + 266, + 109 + ], + "score": 0.86, + "content": "\\widehat { \\Sigma } _ { 0 } = \\widehat { \\Sigma } _ { 1 } = { \\cal O } _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 91, + 270, + 111 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 270, + 95, + 336, + 109 + ], + "score": 0.77, + "content": "\\widehat { \\gamma } _ { 0 } = \\widehat { \\gamma } _ { 1 } = 0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 91, + 340, + 111 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 340, + 94, + 420, + 109 + ], + "score": 0.84, + "content": "\\widehat { \\beta } _ { 0 , b } = \\widehat { \\beta } _ { 1 , b } = 0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 91, + 462, + 111 + ], + "score": 1.0, + "content": ", and a set", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 107, + 187, + 119 + ], + "spans": [ + { + "bbox": [ + 116, + 107, + 182, + 119 + ], + "score": 0.9, + "content": "\\mathcal { T } = \\{ 1 , \\ldots , B \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 107, + 187, + 119 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 115, + 117, + 195, + 129 + ], + "spans": [ + { + "bbox": [ + 115, + 117, + 133, + 129 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 134, + 119, + 159, + 128 + ], + "score": 0.88, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 117, + 171, + 129 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 171, + 119, + 181, + 128 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 117, + 195, + 129 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2 + }, + { + "type": "text", + "bbox": [ + 126, + 128, + 293, + 141 + ], + "lines": [ + { + "bbox": [ + 124, + 123, + 290, + 145 + ], + "spans": [ + { + "bbox": [ + 124, + 123, + 170, + 145 + ], + "score": 1.0, + "content": "Initialize:", + "type": "text" + }, + { + "bbox": [ + 171, + 129, + 199, + 140 + ], + "score": 0.88, + "content": "m = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 123, + 217, + 145 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 217, + 127, + 290, + 141 + ], + "score": 0.92, + "content": "\\widehat { \\Phi } _ { 0 } = \\widehat { \\Phi } _ { 1 } = O _ { p + 1 }", + "type": "inline_equation" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "text", + "bbox": [ + 126, + 143, + 390, + 200 + ], + "lines": [ + { + "bbox": [ + 126, + 141, + 244, + 154 + ], + "spans": [ + { + "bbox": [ + 126, + 143, + 233, + 154 + ], + "score": 1.0, + "content": "Step 1: Online update of", + "type": "text" + }, + { + "bbox": [ + 233, + 141, + 244, + 154 + ], + "score": 0.82, + "content": "{ \\widehat { \\beta } } _ { a }", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 126, + 154, + 267, + 166 + ], + "spans": [ + { + "bbox": [ + 126, + 154, + 144, + 165 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 145, + 154, + 215, + 166 + ], + "score": 0.91, + "content": "i = N ( t _ { k - 1 } ) \\bar { { + } 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 154, + 226, + 165 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 226, + 154, + 253, + 166 + ], + "score": 0.89, + "content": "N ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 154, + 267, + 165 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 137, + 165, + 252, + 176 + ], + "spans": [ + { + "bbox": [ + 137, + 166, + 180, + 175 + ], + "score": 0.87, + "content": "n = n + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 165, + 198, + 176 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 198, + 166, + 247, + 175 + ], + "score": 0.89, + "content": "m = m + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 165, + 252, + 176 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 7 + }, + { + "bbox": [ + 136, + 176, + 383, + 188 + ], + "spans": [ + { + "bbox": [ + 136, + 176, + 383, + 188 + ], + "score": 0.84, + "content": "\\widehat { \\Sigma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\Sigma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 136, + 188, + 363, + 200 + ], + "spans": [ + { + "bbox": [ + 136, + 188, + 363, + 200 + ], + "score": 0.66, + "content": "\\widehat { \\gamma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\gamma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) Y _ { i } \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;", + "type": "inline_equation" + } + ], + "index": 9 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 124, + 200, + 421, + 214 + ], + "lines": [ + { + "bbox": [ + 125, + 197, + 419, + 217 + ], + "spans": [ + { + "bbox": [ + 125, + 197, + 168, + 217 + ], + "score": 1.0, + "content": "bCompute", + "type": "text" + }, + { + "bbox": [ + 169, + 200, + 221, + 213 + ], + "score": 0.92, + "content": "\\widehat { \\beta } _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\widehat { \\gamma } _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 197, + 236, + 217 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 237, + 201, + 279, + 213 + ], + "score": 0.9, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 197, + 298, + 217 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 298, + 199, + 419, + 214 + ], + "score": 0.81, + "content": "S = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 } - \\widehat { \\beta } _ { 0 } ) ;", + "type": "inline_equation" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "title", + "bbox": [ + 127, + 213, + 203, + 223 + ], + "lines": [ + { + "bbox": [ + 126, + 210, + 204, + 227 + ], + "spans": [ + { + "bbox": [ + 126, + 210, + 204, + 227 + ], + "score": 1.0, + "content": "Step 2: Bootstrap", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 133, + 259, + 389, + 270 + ], + "lines": [ + { + "bbox": [ + 136, + 255, + 385, + 273 + ], + "spans": [ + { + "bbox": [ + 136, + 255, + 243, + 273 + ], + "score": 1.0, + "content": "Generate two independent", + "type": "text" + }, + { + "bbox": [ + 244, + 258, + 289, + 270 + ], + "score": 0.9, + "content": "{ \\cal N } ( 0 , I _ { p + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 255, + 361, + 273 + ], + "score": 1.0, + "content": "Gaussian vectors", + "type": "text" + }, + { + "bbox": [ + 362, + 261, + 385, + 270 + ], + "score": 0.83, + "content": "e _ { 0 } , e _ { 1 }", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "title", + "bbox": [ + 127, + 298, + 216, + 308 + ], + "lines": [ + { + "bbox": [ + 126, + 296, + 217, + 311 + ], + "spans": [ + { + "bbox": [ + 126, + 296, + 217, + 311 + ], + "score": 1.0, + "content": "Step 3: Reject or not", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 127, + 309, + 446, + 334 + ], + "lines": [ + { + "bbox": [ + 124, + 306, + 443, + 324 + ], + "spans": [ + { + "bbox": [ + 124, + 306, + 141, + 324 + ], + "score": 1.0, + "content": "Set", + "type": "text" + }, + { + "bbox": [ + 141, + 312, + 148, + 320 + ], + "score": 0.79, + "content": "z", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 306, + 211, + 324 + ], + "score": 1.0, + "content": "to be the upper", + "type": "text" + }, + { + "bbox": [ + 212, + 309, + 343, + 322 + ], + "score": 0.91, + "content": "\\{ \\alpha ( t ) - | \\mathcal { T } | ^ { c } / B | \\} / ( 1 - | \\mathcal { T } ^ { c } | / B )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 306, + 408, + 324 + ], + "score": 1.0, + "content": "-th percentile of", + "type": "text" + }, + { + "bbox": [ + 408, + 308, + 443, + 322 + ], + "score": 0.93, + "content": "\\{ \\widehat { S } _ { b } \\} _ { b \\in \\mathbb { Z } }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 125, + 320, + 274, + 337 + ], + "spans": [ + { + "bbox": [ + 125, + 320, + 157, + 337 + ], + "score": 1.0, + "content": "Update", + "type": "text" + }, + { + "bbox": [ + 157, + 323, + 165, + 333 + ], + "score": 0.81, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 320, + 177, + 337 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 177, + 322, + 269, + 335 + ], + "score": 0.91, + "content": "{ \\mathcal { T } } \\{ b \\in { \\mathcal { T } } : { \\widehat { S } } _ { b } \\leq z \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 320, + 274, + 337 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 128, + 335, + 330, + 345 + ], + "lines": [ + { + "bbox": [ + 126, + 333, + 331, + 347 + ], + "spans": [ + { + "bbox": [ + 126, + 333, + 136, + 347 + ], + "score": 1.0, + "content": "If", + "type": "text" + }, + { + "bbox": [ + 136, + 334, + 162, + 345 + ], + "score": 0.89, + "content": "S > z", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 333, + 195, + 347 + ], + "score": 1.0, + "content": ": Reject", + "type": "text" + }, + { + "bbox": [ + 195, + 335, + 209, + 345 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 333, + 331, + 347 + ], + "score": 1.0, + "content": "and terminate the experiment.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 129, + 346, + 480, + 358 + ], + "lines": [ + { + "bbox": [ + 130, + 344, + 482, + 360 + ], + "spans": [ + { + "bbox": [ + 130, + 344, + 482, + 360 + ], + "score": 1.0, + "content": "Algorithm 1: the Pseudocode that summarizing the online bootstrap testing procedure.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 107, + 381, + 505, + 415 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 504, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 504, + 394 + ], + "score": 1.0, + "content": "Baqun Zhang, Anastasios A Tsiatis, Eric B Laber, and Marie Davidian. Robust estimation of opti-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 393, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 115, + 393, + 505, + 405 + ], + "score": 1.0, + "content": "mal dynamic treatment regimes for sequential treatment decisions. Biometrika, 100(3):681–694,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 402, + 144, + 416 + ], + "spans": [ + { + "bbox": [ + 114, + 402, + 144, + 416 + ], + "score": 1.0, + "content": "2013.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 424, + 505, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 424, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 505, + 437 + ], + "score": 1.0, + "content": "Li-xin Zhang. Strong approximations of martingale vectors and their applications in Markov-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 115, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "chain adaptive designs. Acta Math. Appl. Sin. Engl. Ser., 20(2):337–352, 2004. ISSN", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 446, + 505, + 458 + ], + "spans": [ + { + "bbox": [ + 115, + 446, + 505, + 458 + ], + "score": 1.0, + "content": "0168-9673. doi: 10.1007/s10255-004-0173-z. URL https://doi.org/10.1007/", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 117, + 456, + 225, + 469 + ], + "spans": [ + { + "bbox": [ + 117, + 457, + 221, + 468 + ], + "score": 0.47, + "content": "\\mathtt { s 1 0 2 5 5 - 0 0 4 - 0 1 7 3 - z }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 456, + 225, + 469 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5 + }, + { + "type": "title", + "bbox": [ + 107, + 485, + 189, + 498 + ], + "lines": [ + { + "bbox": [ + 105, + 484, + 190, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 190, + 500 + ], + "score": 1.0, + "content": "A NOTATIONS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 510, + 505, + 579 + ], + "lines": [ + { + "bbox": [ + 106, + 510, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 462, + 524 + ], + "score": 1.0, + "content": "We introduce some general notations used in the appendix. For any matrix Mat, we use", + "type": "text" + }, + { + "bbox": [ + 462, + 511, + 493, + 523 + ], + "score": 0.92, + "content": "\\left\\| \\mathbf { M a t } \\right\\| _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 510, + 505, + 524 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 520, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 326, + 534 + ], + "score": 1.0, + "content": "denote the matrix norm induced by the corresponding", + "type": "text" + }, + { + "bbox": [ + 327, + 522, + 337, + 534 + ], + "score": 0.89, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 520, + 423, + 534 + ], + "score": 1.0, + "content": "norm of vectors, for", + "type": "text" + }, + { + "bbox": [ + 423, + 522, + 483, + 533 + ], + "score": 0.92, + "content": "1 \\leq p \\leq + \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 520, + 506, + 534 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 532, + 506, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 218, + 547 + ], + "score": 1.0, + "content": "two nonnegative sequences", + "type": "text" + }, + { + "bbox": [ + 218, + 533, + 251, + 545 + ], + "score": 0.93, + "content": "\\{ s _ { 1 , n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 532, + 270, + 547 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 270, + 533, + 303, + 545 + ], + "score": 0.93, + "content": "\\{ s _ { 2 , n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 532, + 406, + 547 + ], + "score": 1.0, + "content": ", we will use the notation", + "type": "text" + }, + { + "bbox": [ + 406, + 534, + 454, + 545 + ], + "score": 0.92, + "content": "s _ { 1 , n } \\preceq s _ { 2 , n }", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 532, + 506, + 547 + ], + "score": 1.0, + "content": "to represent", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 124, + 556 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 124, + 545, + 176, + 556 + ], + "score": 0.92, + "content": "s _ { 1 , n } \\leq \\bar { c } s _ { 2 , n }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 543, + 289, + 556 + ], + "score": 1.0, + "content": "for some universal constant", + "type": "text" + }, + { + "bbox": [ + 289, + 545, + 313, + 554 + ], + "score": 0.89, + "content": "\\bar { c } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "whose value is allowed to change from place to", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 554, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 269, + 570 + ], + "score": 1.0, + "content": "place. When a matrix Mat is degenerate,", + "type": "text" + }, + { + "bbox": [ + 269, + 555, + 297, + 567 + ], + "score": 0.83, + "content": "\\mathrm { { M a t } ^ { - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 554, + 506, + 570 + ], + "score": 1.0, + "content": "denotes the Moore-Penrose inverse of Mat. For any", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 567, + 300, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 133, + 581 + ], + "score": 1.0, + "content": "vector", + "type": "text" + }, + { + "bbox": [ + 134, + 569, + 142, + 580 + ], + "score": 0.85, + "content": "\\psi", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 567, + 175, + 581 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 176, + 567, + 193, + 580 + ], + "score": 0.92, + "content": "\\psi ^ { ( i ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 567, + 245, + 581 + ], + "score": 1.0, + "content": "to denote its", + "type": "text" + }, + { + "bbox": [ + 246, + 569, + 250, + 578 + ], + "score": 0.78, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 567, + 300, + 581 + ], + "score": 1.0, + "content": "-th element.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + }, + { + "type": "text", + "bbox": [ + 107, + 584, + 504, + 608 + ], + "lines": [ + { + "bbox": [ + 105, + 583, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 207, + 599 + ], + "score": 1.0, + "content": "In Algorithm 1, we use", + "type": "text" + }, + { + "bbox": [ + 207, + 585, + 231, + 598 + ], + "score": 0.92, + "content": "O _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 583, + 284, + 599 + ], + "score": 1.0, + "content": "to denote a", + "type": "text" + }, + { + "bbox": [ + 284, + 585, + 362, + 597 + ], + "score": 0.94, + "content": "( p + 1 ) \\times ( p + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 583, + 433, + 599 + ], + "score": 1.0, + "content": "zero matrix and", + "type": "text" + }, + { + "bbox": [ + 433, + 586, + 454, + 598 + ], + "score": 0.91, + "content": "0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 583, + 506, + 599 + ], + "score": 1.0, + "content": "to denote a", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 107, + 596, + 240, + 609 + ], + "spans": [ + { + "bbox": [ + 107, + 596, + 137, + 608 + ], + "score": 0.91, + "content": "( p + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 596, + 240, + 609 + ], + "score": 1.0, + "content": "-dimensional zero vector.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5 + }, + { + "type": "title", + "bbox": [ + 107, + 624, + 291, + 637 + ], + "lines": [ + { + "bbox": [ + 105, + 623, + 292, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 292, + 639 + ], + "score": 1.0, + "content": "B MORE ON THE BASIS FUNCTION", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "title", + "bbox": [ + 107, + 649, + 207, + 661 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 208, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 208, + 664 + ], + "score": 1.0, + "content": "B.1 CONDITION (A3)", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 105, + 669, + 504, + 694 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 169, + 685 + ], + "score": 1.0, + "content": "(A3). Assume", + "type": "text" + }, + { + "bbox": [ + 171, + 669, + 485, + 683 + ], + "score": 0.46, + "content": "\\lambda _ { \\operatorname* { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1 , \\lambda _ { \\operatorname* { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1 , \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } = O ( q ^ { \\top } ) ,", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 668, + 505, + 685 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 681, + 308, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 223, + 694 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\operatorname* { l i m } \\operatorname* { i n f } _ { q } \\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } > 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 681, + 308, + 694 + ], + "score": 1.0, + "content": ". In addition, assume", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 699, + 360, + 735 + ], + "lines": [ + { + "bbox": [ + 231, + 699, + 360, + 735 + ], + "spans": [ + { + "bbox": [ + 231, + 699, + 360, + 735 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { x , y \\in \\mathbb { X } } \\frac { \\| \\varphi ( x ) - \\varphi ( y ) \\| _ { 2 } } { \\| x - y \\| _ { 2 } } \\preceq q ^ { 1 / 2 } .", + "type": "interline_equation", + "image_path": "bc37a934116573d3dc38916594e2a8986748d69fedf32e57370035f29b24b164.jpg" + } + ] + } + ], + "index": 38.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 699, + 360, + 717.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 231, + 717.0, + 360, + 735.0 + ], + "spans": [], + "index": 39 + } + ] + } + ], + "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, + 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": [ + 118, + 83, + 393, + 94 + ], + "lines": [ + { + "bbox": [ + 116, + 81, + 393, + 97 + ], + "spans": [ + { + "bbox": [ + 116, + 81, + 267, + 97 + ], + "score": 1.0, + "content": "Input: Number of bootstrap samples", + "type": "text" + }, + { + "bbox": [ + 267, + 83, + 276, + 93 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 81, + 291, + 97 + ], + "score": 1.0, + "content": ", an", + "type": "text" + }, + { + "bbox": [ + 292, + 85, + 299, + 93 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 81, + 375, + 97 + ], + "score": 1.0, + "content": "spending function", + "type": "text" + }, + { + "bbox": [ + 375, + 83, + 393, + 95 + ], + "score": 0.9, + "content": "\\alpha ( \\cdot )", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 116, + 81, + 393, + 97 + ] + }, + { + "type": "list", + "bbox": [ + 116, + 95, + 461, + 127 + ], + "lines": [ + { + "bbox": [ + 114, + 91, + 462, + 111 + ], + "spans": [ + { + "bbox": [ + 114, + 91, + 163, + 111 + ], + "score": 1.0, + "content": "Initialize:", + "type": "text" + }, + { + "bbox": [ + 163, + 95, + 189, + 106 + ], + "score": 0.83, + "content": "n = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 190, + 91, + 193, + 111 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 193, + 94, + 266, + 109 + ], + "score": 0.86, + "content": "\\widehat { \\Sigma } _ { 0 } = \\widehat { \\Sigma } _ { 1 } = { \\cal O } _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 91, + 270, + 111 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 270, + 95, + 336, + 109 + ], + "score": 0.77, + "content": "\\widehat { \\gamma } _ { 0 } = \\widehat { \\gamma } _ { 1 } = 0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 91, + 340, + 111 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 340, + 94, + 420, + 109 + ], + "score": 0.84, + "content": "\\widehat { \\beta } _ { 0 , b } = \\widehat { \\beta } _ { 1 , b } = 0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 91, + 462, + 111 + ], + "score": 1.0, + "content": ", and a set", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 116, + 107, + 187, + 119 + ], + "spans": [ + { + "bbox": [ + 116, + 107, + 182, + 119 + ], + "score": 0.9, + "content": "\\mathcal { T } = \\{ 1 , \\ldots , B \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 107, + 187, + 119 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2, + "is_list_end_line": true + }, + { + "bbox": [ + 115, + 117, + 195, + 129 + ], + "spans": [ + { + "bbox": [ + 115, + 117, + 133, + 129 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 134, + 119, + 159, + 128 + ], + "score": 0.88, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 117, + 171, + 129 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 171, + 119, + 181, + 128 + ], + "score": 0.79, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 117, + 195, + 129 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 3, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 2, + "bbox_fs": [ + 114, + 91, + 462, + 129 + ] + }, + { + "type": "text", + "bbox": [ + 126, + 128, + 293, + 141 + ], + "lines": [ + { + "bbox": [ + 124, + 123, + 290, + 145 + ], + "spans": [ + { + "bbox": [ + 124, + 123, + 170, + 145 + ], + "score": 1.0, + "content": "Initialize:", + "type": "text" + }, + { + "bbox": [ + 171, + 129, + 199, + 140 + ], + "score": 0.88, + "content": "m = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 123, + 217, + 145 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 217, + 127, + 290, + 141 + ], + "score": 0.92, + "content": "\\widehat { \\Phi } _ { 0 } = \\widehat { \\Phi } _ { 1 } = O _ { p + 1 }", + "type": "inline_equation" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 124, + 123, + 290, + 145 + ] + }, + { + "type": "list", + "bbox": [ + 126, + 143, + 390, + 200 + ], + "lines": [ + { + "bbox": [ + 126, + 141, + 244, + 154 + ], + "spans": [ + { + "bbox": [ + 126, + 143, + 233, + 154 + ], + "score": 1.0, + "content": "Step 1: Online update of", + "type": "text" + }, + { + "bbox": [ + 233, + 141, + 244, + 154 + ], + "score": 0.82, + "content": "{ \\widehat { \\beta } } _ { a }", + "type": "inline_equation" + } + ], + "index": 5, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 126, + 154, + 267, + 166 + ], + "spans": [ + { + "bbox": [ + 126, + 154, + 144, + 165 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 145, + 154, + 215, + 166 + ], + "score": 0.91, + "content": "i = N ( t _ { k - 1 } ) \\bar { { + } 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 154, + 226, + 165 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 226, + 154, + 253, + 166 + ], + "score": 0.89, + "content": "N ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 154, + 267, + 165 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 6, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 137, + 165, + 252, + 176 + ], + "spans": [ + { + "bbox": [ + 137, + 166, + 180, + 175 + ], + "score": 0.87, + "content": "n = n + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 180, + 165, + 198, + 176 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 198, + 166, + 247, + 175 + ], + "score": 0.89, + "content": "m = m + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 165, + 252, + 176 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 7, + "is_list_end_line": true + }, + { + "bbox": [ + 136, + 176, + 383, + 188 + ], + "spans": [ + { + "bbox": [ + 136, + 176, + 383, + 188 + ], + "score": 0.84, + "content": "\\widehat { \\Sigma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\Sigma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 136, + 188, + 363, + 200 + ], + "spans": [ + { + "bbox": [ + 136, + 188, + 363, + 200 + ], + "score": 0.66, + "content": "\\widehat { \\gamma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\gamma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) Y _ { i } \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;", + "type": "inline_equation" + } + ], + "index": 9, + "is_list_end_line": true + } + ], + "index": 7, + "bbox_fs": [ + 126, + 141, + 383, + 200 + ] + }, + { + "type": "text", + "bbox": [ + 124, + 200, + 421, + 214 + ], + "lines": [ + { + "bbox": [ + 125, + 197, + 419, + 217 + ], + "spans": [ + { + "bbox": [ + 125, + 197, + 168, + 217 + ], + "score": 1.0, + "content": "bCompute", + "type": "text" + }, + { + "bbox": [ + 169, + 200, + 221, + 213 + ], + "score": 0.92, + "content": "\\widehat { \\beta } _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\widehat { \\gamma } _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 197, + 236, + 217 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 237, + 201, + 279, + 213 + ], + "score": 0.9, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 197, + 298, + 217 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 298, + 199, + 419, + 214 + ], + "score": 0.81, + "content": "S = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 } - \\widehat { \\beta } _ { 0 } ) ;", + "type": "inline_equation" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 125, + 197, + 419, + 217 + ] + }, + { + "type": "title", + "bbox": [ + 127, + 213, + 203, + 223 + ], + "lines": [ + { + "bbox": [ + 126, + 210, + 204, + 227 + ], + "spans": [ + { + "bbox": [ + 126, + 210, + 204, + 227 + ], + "score": 1.0, + "content": "Step 2: Bootstrap", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "text", + "bbox": [ + 133, + 259, + 389, + 270 + ], + "lines": [ + { + "bbox": [ + 136, + 255, + 385, + 273 + ], + "spans": [ + { + "bbox": [ + 136, + 255, + 243, + 273 + ], + "score": 1.0, + "content": "Generate two independent", + "type": "text" + }, + { + "bbox": [ + 244, + 258, + 289, + 270 + ], + "score": 0.9, + "content": "{ \\cal N } ( 0 , I _ { p + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 255, + 361, + 273 + ], + "score": 1.0, + "content": "Gaussian vectors", + "type": "text" + }, + { + "bbox": [ + 362, + 261, + 385, + 270 + ], + "score": 0.83, + "content": "e _ { 0 } , e _ { 1 }", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 136, + 255, + 385, + 273 + ] + }, + { + "type": "title", + "bbox": [ + 127, + 298, + 216, + 308 + ], + "lines": [ + { + "bbox": [ + 126, + 296, + 217, + 311 + ], + "spans": [ + { + "bbox": [ + 126, + 296, + 217, + 311 + ], + "score": 1.0, + "content": "Step 3: Reject or not", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 127, + 309, + 446, + 334 + ], + "lines": [ + { + "bbox": [ + 124, + 306, + 443, + 324 + ], + "spans": [ + { + "bbox": [ + 124, + 306, + 141, + 324 + ], + "score": 1.0, + "content": "Set", + "type": "text" + }, + { + "bbox": [ + 141, + 312, + 148, + 320 + ], + "score": 0.79, + "content": "z", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 306, + 211, + 324 + ], + "score": 1.0, + "content": "to be the upper", + "type": "text" + }, + { + "bbox": [ + 212, + 309, + 343, + 322 + ], + "score": 0.91, + "content": "\\{ \\alpha ( t ) - | \\mathcal { T } | ^ { c } / B | \\} / ( 1 - | \\mathcal { T } ^ { c } | / B )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 306, + 408, + 324 + ], + "score": 1.0, + "content": "-th percentile of", + "type": "text" + }, + { + "bbox": [ + 408, + 308, + 443, + 322 + ], + "score": 0.93, + "content": "\\{ \\widehat { S } _ { b } \\} _ { b \\in \\mathbb { Z } }", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 125, + 320, + 274, + 337 + ], + "spans": [ + { + "bbox": [ + 125, + 320, + 157, + 337 + ], + "score": 1.0, + "content": "Update", + "type": "text" + }, + { + "bbox": [ + 157, + 323, + 165, + 333 + ], + "score": 0.81, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 320, + 177, + 337 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 177, + 322, + 269, + 335 + ], + "score": 0.91, + "content": "{ \\mathcal { T } } \\{ b \\in { \\mathcal { T } } : { \\widehat { S } } _ { b } \\leq z \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 320, + 274, + 337 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 124, + 306, + 443, + 337 + ] + }, + { + "type": "text", + "bbox": [ + 128, + 335, + 330, + 345 + ], + "lines": [ + { + "bbox": [ + 126, + 333, + 331, + 347 + ], + "spans": [ + { + "bbox": [ + 126, + 333, + 136, + 347 + ], + "score": 1.0, + "content": "If", + "type": "text" + }, + { + "bbox": [ + 136, + 334, + 162, + 345 + ], + "score": 0.89, + "content": "S > z", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 333, + 195, + 347 + ], + "score": 1.0, + "content": ": Reject", + "type": "text" + }, + { + "bbox": [ + 195, + 335, + 209, + 345 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 333, + 331, + 347 + ], + "score": 1.0, + "content": "and terminate the experiment.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 126, + 333, + 331, + 347 + ] + }, + { + "type": "text", + "bbox": [ + 129, + 346, + 480, + 358 + ], + "lines": [ + { + "bbox": [ + 130, + 344, + 482, + 360 + ], + "spans": [ + { + "bbox": [ + 130, + 344, + 482, + 360 + ], + "score": 1.0, + "content": "Algorithm 1: the Pseudocode that summarizing the online bootstrap testing procedure.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 130, + 344, + 482, + 360 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 381, + 505, + 415 + ], + "lines": [ + { + "bbox": [ + 105, + 381, + 504, + 394 + ], + "spans": [ + { + "bbox": [ + 105, + 381, + 504, + 394 + ], + "score": 1.0, + "content": "Baqun Zhang, Anastasios A Tsiatis, Eric B Laber, and Marie Davidian. Robust estimation of opti-", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 115, + 393, + 505, + 405 + ], + "spans": [ + { + "bbox": [ + 115, + 393, + 505, + 405 + ], + "score": 1.0, + "content": "mal dynamic treatment regimes for sequential treatment decisions. Biometrika, 100(3):681–694,", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 114, + 402, + 144, + 416 + ], + "spans": [ + { + "bbox": [ + 114, + 402, + 144, + 416 + ], + "score": 1.0, + "content": "2013.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 381, + 505, + 416 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 424, + 505, + 468 + ], + "lines": [ + { + "bbox": [ + 105, + 424, + 505, + 437 + ], + "spans": [ + { + "bbox": [ + 105, + 424, + 505, + 437 + ], + "score": 1.0, + "content": "Li-xin Zhang. Strong approximations of martingale vectors and their applications in Markov-", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 115, + 434, + 506, + 447 + ], + "spans": [ + { + "bbox": [ + 115, + 434, + 506, + 447 + ], + "score": 1.0, + "content": "chain adaptive designs. Acta Math. Appl. Sin. Engl. Ser., 20(2):337–352, 2004. ISSN", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 115, + 446, + 505, + 458 + ], + "spans": [ + { + "bbox": [ + 115, + 446, + 505, + 458 + ], + "score": 1.0, + "content": "0168-9673. doi: 10.1007/s10255-004-0173-z. URL https://doi.org/10.1007/", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 117, + 456, + 225, + 469 + ], + "spans": [ + { + "bbox": [ + 117, + 457, + 221, + 468 + ], + "score": 0.47, + "content": "\\mathtt { s 1 0 2 5 5 - 0 0 4 - 0 1 7 3 - z }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 456, + 225, + 469 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 22.5, + "bbox_fs": [ + 105, + 424, + 506, + 469 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 485, + 189, + 498 + ], + "lines": [ + { + "bbox": [ + 105, + 484, + 190, + 500 + ], + "spans": [ + { + "bbox": [ + 105, + 484, + 190, + 500 + ], + "score": 1.0, + "content": "A NOTATIONS", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "text", + "bbox": [ + 106, + 510, + 505, + 579 + ], + "lines": [ + { + "bbox": [ + 106, + 510, + 505, + 524 + ], + "spans": [ + { + "bbox": [ + 106, + 510, + 462, + 524 + ], + "score": 1.0, + "content": "We introduce some general notations used in the appendix. For any matrix Mat, we use", + "type": "text" + }, + { + "bbox": [ + 462, + 511, + 493, + 523 + ], + "score": 0.92, + "content": "\\left\\| \\mathbf { M a t } \\right\\| _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 493, + 510, + 505, + 524 + ], + "score": 1.0, + "content": "to", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 520, + 506, + 534 + ], + "spans": [ + { + "bbox": [ + 105, + 520, + 326, + 534 + ], + "score": 1.0, + "content": "denote the matrix norm induced by the corresponding", + "type": "text" + }, + { + "bbox": [ + 327, + 522, + 337, + 534 + ], + "score": 0.89, + "content": "\\ell _ { p }", + "type": "inline_equation" + }, + { + "bbox": [ + 338, + 520, + 423, + 534 + ], + "score": 1.0, + "content": "norm of vectors, for", + "type": "text" + }, + { + "bbox": [ + 423, + 522, + 483, + 533 + ], + "score": 0.92, + "content": "1 \\leq p \\leq + \\infty", + "type": "inline_equation" + }, + { + "bbox": [ + 483, + 520, + 506, + 534 + ], + "score": 1.0, + "content": ". For", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 532, + 506, + 547 + ], + "spans": [ + { + "bbox": [ + 105, + 532, + 218, + 547 + ], + "score": 1.0, + "content": "two nonnegative sequences", + "type": "text" + }, + { + "bbox": [ + 218, + 533, + 251, + 545 + ], + "score": 0.93, + "content": "\\{ s _ { 1 , n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 251, + 532, + 270, + 547 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 270, + 533, + 303, + 545 + ], + "score": 0.93, + "content": "\\{ s _ { 2 , n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 532, + 406, + 547 + ], + "score": 1.0, + "content": ", we will use the notation", + "type": "text" + }, + { + "bbox": [ + 406, + 534, + 454, + 545 + ], + "score": 0.92, + "content": "s _ { 1 , n } \\preceq s _ { 2 , n }", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 532, + 506, + 547 + ], + "score": 1.0, + "content": "to represent", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 105, + 543, + 505, + 556 + ], + "spans": [ + { + "bbox": [ + 105, + 543, + 124, + 556 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 124, + 545, + 176, + 556 + ], + "score": 0.92, + "content": "s _ { 1 , n } \\leq \\bar { c } s _ { 2 , n }", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 543, + 289, + 556 + ], + "score": 1.0, + "content": "for some universal constant", + "type": "text" + }, + { + "bbox": [ + 289, + 545, + 313, + 554 + ], + "score": 0.89, + "content": "\\bar { c } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 313, + 543, + 505, + 556 + ], + "score": 1.0, + "content": "whose value is allowed to change from place to", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 105, + 554, + 506, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 554, + 269, + 570 + ], + "score": 1.0, + "content": "place. When a matrix Mat is degenerate,", + "type": "text" + }, + { + "bbox": [ + 269, + 555, + 297, + 567 + ], + "score": 0.83, + "content": "\\mathrm { { M a t } ^ { - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 298, + 554, + 506, + 570 + ], + "score": 1.0, + "content": "denotes the Moore-Penrose inverse of Mat. For any", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 567, + 300, + 581 + ], + "spans": [ + { + "bbox": [ + 105, + 567, + 133, + 581 + ], + "score": 1.0, + "content": "vector", + "type": "text" + }, + { + "bbox": [ + 134, + 569, + 142, + 580 + ], + "score": 0.85, + "content": "\\psi", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 567, + 175, + 581 + ], + "score": 1.0, + "content": ", we use", + "type": "text" + }, + { + "bbox": [ + 176, + 567, + 193, + 580 + ], + "score": 0.92, + "content": "\\psi ^ { ( i ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 193, + 567, + 245, + 581 + ], + "score": 1.0, + "content": "to denote its", + "type": "text" + }, + { + "bbox": [ + 246, + 569, + 250, + 578 + ], + "score": 0.78, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 250, + 567, + 300, + 581 + ], + "score": 1.0, + "content": "-th element.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5, + "bbox_fs": [ + 105, + 510, + 506, + 581 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 584, + 504, + 608 + ], + "lines": [ + { + "bbox": [ + 105, + 583, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 583, + 207, + 599 + ], + "score": 1.0, + "content": "In Algorithm 1, we use", + "type": "text" + }, + { + "bbox": [ + 207, + 585, + 231, + 598 + ], + "score": 0.92, + "content": "O _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 583, + 284, + 599 + ], + "score": 1.0, + "content": "to denote a", + "type": "text" + }, + { + "bbox": [ + 284, + 585, + 362, + 597 + ], + "score": 0.94, + "content": "( p + 1 ) \\times ( p + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 583, + 433, + 599 + ], + "score": 1.0, + "content": "zero matrix and", + "type": "text" + }, + { + "bbox": [ + 433, + 586, + 454, + 598 + ], + "score": 0.91, + "content": "0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 583, + 506, + 599 + ], + "score": 1.0, + "content": "to denote a", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 107, + 596, + 240, + 609 + ], + "spans": [ + { + "bbox": [ + 107, + 596, + 137, + 608 + ], + "score": 0.91, + "content": "( p + 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 596, + 240, + 609 + ], + "score": 1.0, + "content": "-dimensional zero vector.", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 32.5, + "bbox_fs": [ + 105, + 583, + 506, + 609 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 624, + 291, + 637 + ], + "lines": [ + { + "bbox": [ + 105, + 623, + 292, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 292, + 639 + ], + "score": 1.0, + "content": "B MORE ON THE BASIS FUNCTION", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "title", + "bbox": [ + 107, + 649, + 207, + 661 + ], + "lines": [ + { + "bbox": [ + 105, + 647, + 208, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 647, + 208, + 664 + ], + "score": 1.0, + "content": "B.1 CONDITION (A3)", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 105, + 669, + 504, + 694 + ], + "lines": [ + { + "bbox": [ + 105, + 668, + 505, + 685 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 169, + 685 + ], + "score": 1.0, + "content": "(A3). Assume", + "type": "text" + }, + { + "bbox": [ + 171, + 669, + 485, + 683 + ], + "score": 0.46, + "content": "\\lambda _ { \\operatorname* { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1 , \\lambda _ { \\operatorname* { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1 , \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } = O ( q ^ { \\top } ) ,", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 668, + 505, + 685 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 106, + 681, + 308, + 694 + ], + "spans": [ + { + "bbox": [ + 106, + 682, + 223, + 694 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\operatorname* { l i m } \\operatorname* { i n f } _ { q } \\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } > 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 223, + 681, + 308, + 694 + ], + "score": 1.0, + "content": ". In addition, assume", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 36.5, + "bbox_fs": [ + 105, + 668, + 505, + 694 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 699, + 360, + 735 + ], + "lines": [ + { + "bbox": [ + 231, + 699, + 360, + 735 + ], + "spans": [ + { + "bbox": [ + 231, + 699, + 360, + 735 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { x , y \\in \\mathbb { X } } \\frac { \\| \\varphi ( x ) - \\varphi ( y ) \\| _ { 2 } } { \\| x - y \\| _ { 2 } } \\preceq q ^ { 1 / 2 } .", + "type": "interline_equation", + "image_path": "bc37a934116573d3dc38916594e2a8986748d69fedf32e57370035f29b24b164.jpg" + } + ] + } + ], + "index": 38.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 699, + 360, + 717.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 231, + 717.0, + 360, + 735.0 + ], + "spans": [], + "index": 39 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 506, + 172 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "When a tensor-product B-spline is used (see Section 6 of Chen & Christensen, 2015, for", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 104, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 104, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "a brief overview of tenor-product B-splines), (A3) is automatically satisfied. Specifically,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 216, + 117 + ], + "score": 0.88, + "content": "\\lambda _ { \\operatorname* { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 104, + 221, + 118 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 221, + 104, + 332, + 117 + ], + "score": 0.9, + "content": "\\dot { \\lambda } _ { \\mathrm { m a x } } [ \\mathrm { E } \\varphi ( X ) \\dot { \\varphi } ^ { \\top } ( X ) ] \\asymp 1", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 104, + 506, + 118 + ], + "score": 1.0, + "content": "follow from Theorem 3.3 of (Burman &", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 163, + 130 + ], + "score": 1.0, + "content": "Chen, 1989).", + "type": "text" + }, + { + "bbox": [ + 163, + 117, + 269, + 129 + ], + "score": 0.89, + "content": "\\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } = O ( q ^ { 1 / 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 115, + 506, + 130 + ], + "score": 1.0, + "content": "follows by noting that the absolute value of each element", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 117, + 141 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 117, + 128, + 138, + 140 + ], + "score": 0.91, + "content": "\\varphi ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 127, + 302, + 141 + ], + "score": 1.0, + "content": "is bounded by some universal constant.", + "type": "text" + }, + { + "bbox": [ + 302, + 128, + 421, + 140 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\operatorname* { l i m } \\operatorname* { i n f } _ { q } \\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } > 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 127, + 506, + 141 + ], + "score": 1.0, + "content": "follows from the ar-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 138, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 104, + 138, + 505, + 151 + ], + "score": 1.0, + "content": "guments used in the proof of Lemma E.4 of Shi et al. (2020b). The last condition in equation 12", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 298, + 163 + ], + "score": 1.0, + "content": "holds by noting that each function in the vector", + "type": "text" + }, + { + "bbox": [ + 298, + 150, + 316, + 162 + ], + "score": 0.91, + "content": "\\varphi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 149, + 506, + 163 + ], + "score": 1.0, + "content": "is Lipschitz continuous when a tensor-product", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 160, + 175, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 175, + 173 + ], + "score": 1.0, + "content": "B-spline is used.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 3.5 + }, + { + "type": "title", + "bbox": [ + 108, + 185, + 271, + 196 + ], + "lines": [ + { + "bbox": [ + 105, + 184, + 273, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 273, + 198 + ], + "score": 1.0, + "content": "B.2 ON THE APPROXIMATION ERROR", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 108, + 205, + 409, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 205, + 410, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 410, + 219 + ], + "score": 1.0, + "content": "The proposed test remains valid as long as the approximation error satisfies", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 218, + 435, + 242 + ], + "lines": [ + { + "bbox": [ + 155, + 218, + 435, + 242 + ], + "spans": [ + { + "bbox": [ + 155, + 218, + 435, + 242 + ], + "score": 0.89, + "content": "\\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | = o ( \\{ N ( T ) \\} ^ { - 1 / 2 } ) ,", + "type": "interline_equation", + "image_path": "6430aad6083eb26df949d353ffe25fae3d6ebf25c588fd090be324281029d7e1.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 155, + 218, + 435, + 242 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 243, + 502, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 241, + 504, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 504, + 257 + ], + "score": 1.0, + "content": "with probability tending to 1. In the following, we introduce some sufficient conditions for equa-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 253, + 140, + 266 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 140, + 266 + ], + "score": 1.0, + "content": "tion 13.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "text", + "bbox": [ + 107, + 271, + 504, + 305 + ], + "lines": [ + { + "bbox": [ + 105, + 271, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 205, + 284 + ], + "score": 1.0, + "content": "Suppose the Q-function", + "type": "text" + }, + { + "bbox": [ + 206, + 271, + 239, + 284 + ], + "score": 0.93, + "content": "Q _ { 0 } ( \\cdot , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 271, + 251, + 284 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 251, + 274, + 258, + 283 + ], + "score": 0.82, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 271, + 379, + 284 + ], + "score": 1.0, + "content": "-smooth (see the definition of", + "type": "text" + }, + { + "bbox": [ + 379, + 274, + 386, + 283 + ], + "score": 0.82, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 271, + 505, + 284 + ], + "score": 1.0, + "content": "-smoothness in Stone, 1982),", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 281, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 121, + 295 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 122, + 282, + 162, + 294 + ], + "score": 0.91, + "content": "a \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 281, + 417, + 295 + ], + "score": 1.0, + "content": ". When a tensor-product B-spline or Wavelet basis is used for", + "type": "text" + }, + { + "bbox": [ + 417, + 282, + 435, + 294 + ], + "score": 0.91, + "content": "\\varphi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 281, + 506, + 295 + ], + "score": 1.0, + "content": ", then there exist", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 293, + 219, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 293, + 130, + 306 + ], + "score": 1.0, + "content": "some", + "type": "text" + }, + { + "bbox": [ + 130, + 294, + 142, + 305 + ], + "score": 0.89, + "content": "\\beta _ { 0 } ^ { \\ast }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 293, + 160, + 306 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 160, + 294, + 172, + 305 + ], + "score": 0.89, + "content": "\\beta _ { 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 293, + 219, + 306 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 306, + 422, + 330 + ], + "lines": [ + { + "bbox": [ + 168, + 306, + 422, + 330 + ], + "spans": [ + { + "bbox": [ + 168, + 306, + 422, + 330 + ], + "score": 0.91, + "content": "\\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | = O ( q ^ { - p / d } ) .", + "type": "interline_equation", + "image_path": "6f0c8d27a0832b66adf8ddbdacb13e7232ac3886671974707e0449ff1a0c8b98.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 168, + 306, + 422, + 330 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 331, + 503, + 354 + ], + "lines": [ + { + "bbox": [ + 106, + 331, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 331, + 505, + 344 + ], + "score": 1.0, + "content": "See Section 2.2 of Huang (1998) for detailed discussions on the approximation power of these basis", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 343, + 385, + 355 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 385, + 355 + ], + "score": 1.0, + "content": "functions. Condition equation 13 is thus automatically satisfied when", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "interline_equation", + "bbox": [ + 254, + 355, + 336, + 371 + ], + "lines": [ + { + "bbox": [ + 254, + 355, + 336, + 371 + ], + "spans": [ + { + "bbox": [ + 254, + 355, + 336, + 371 + ], + "score": 0.91, + "content": "q \\gg \\{ N ( T ) \\} ^ { d / ( 2 p ) } ,", + "type": "interline_equation", + "image_path": "889508cae5e1cb04f39271104cc0322b564e84f205d454d257c722e9fb152fa4.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 254, + 355, + 336, + 371 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 372, + 224, + 384 + ], + "lines": [ + { + "bbox": [ + 106, + 371, + 226, + 386 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 226, + 386 + ], + "score": 1.0, + "content": "with probability tending to 1.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "title", + "bbox": [ + 108, + 399, + 272, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 275, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 275, + 414 + ], + "score": 1.0, + "content": "C ADAPTIVE RANDOMIZATION", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 423, + 506, + 468 + ], + "lines": [ + { + "bbox": [ + 106, + 424, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 505, + 435 + ], + "score": 1.0, + "content": "In practice, the company might want to allocate more traffic to a better treatment based on the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 214, + 447 + ], + "score": 1.0, + "content": "observed data stream. The", + "type": "text" + }, + { + "bbox": [ + 214, + 437, + 219, + 444 + ], + "score": 0.71, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "-greedy strategy is commonly used to balance the trade-off between ex-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 446, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 259, + 457 + ], + "score": 1.0, + "content": "ploration and exploitation. For a given", + "type": "text" + }, + { + "bbox": [ + 260, + 446, + 307, + 456 + ], + "score": 0.91, + "content": "0 < \\varepsilon _ { 0 } < 1", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 446, + 505, + 457 + ], + "score": 1.0, + "content": ", consider the following randomization procedure:", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 456, + 382, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 174, + 469 + ], + "score": 1.0, + "content": "for some integer", + "type": "text" + }, + { + "bbox": [ + 174, + 456, + 206, + 468 + ], + "score": 0.92, + "content": "N _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 457, + 241, + 469 + ], + "score": 1.0, + "content": "and any", + "type": "text" + }, + { + "bbox": [ + 241, + 457, + 272, + 468 + ], + "score": 0.88, + "content": "j \\geq N _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 457, + 276, + 469 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 276, + 456, + 319, + 468 + ], + "score": 0.85, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 457, + 323, + 469 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 323, + 456, + 349, + 467 + ], + "score": 0.8, + "content": "x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 457, + 382, + 469 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5 + }, + { + "type": "text", + "bbox": [ + 105, + 469, + 520, + 498 + ], + "lines": [ + { + "bbox": [ + 104, + 468, + 523, + 489 + ], + "spans": [ + { + "bbox": [ + 104, + 468, + 111, + 489 + ], + "score": 1.0, + "content": "π", + "type": "text" + }, + { + "bbox": [ + 111, + 469, + 514, + 486 + ], + "score": 0.73, + "content": "\\begin{array} { r } { \\tau _ { j - 1 } ( a , x ) = ( 1 - \\varepsilon _ { 0 } ) a \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 , j - 1 } - \\widehat { \\beta } _ { 0 , j - 1 } ) > 0 \\} + \\varepsilon _ { 0 } ( 1 - a ) \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 , j - 1 } - \\widehat { \\beta } _ { 0 , j - 1 } ) \\leq 0 } \\end{array}", + "type": "inline_equation", + "image_path": "8e3b45e597e249249ad7add75631c6d9d0546833b69099ed8d5f34a9964ca5c8.jpg" + }, + { + "bbox": [ + 514, + 468, + 523, + 489 + ], + "score": 1.0, + "content": "},", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 484, + 135, + 500 + ], + "spans": [ + { + "bbox": [ + 104, + 484, + 135, + 500 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 497, + 469, + 532 + ], + "lines": [ + { + "bbox": [ + 121, + 497, + 469, + 532 + ], + "spans": [ + { + "bbox": [ + 121, + 497, + 469, + 532 + ], + "score": 0.89, + "content": "\\widehat { \\beta } _ { a , j } = \\widehat { \\Sigma } _ { a , j } ^ { - 1 } \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\} \\mathrm { a n d } \\widehat { \\Sigma } _ { a , j } = \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) .", + "type": "interline_equation", + "image_path": "51ce5207529e43fe8b1a8407d42df5c52d861bba4c23d54c7ffc6cf999fa8809.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 121, + 497, + 469, + 508.6666666666667 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 121, + 508.6666666666667, + 469, + 520.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 121, + 520.3333333333334, + 469, + 532.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 393, + 549 + ], + "lines": [ + { + "bbox": [ + 103, + 529, + 394, + 552 + ], + "spans": [ + { + "bbox": [ + 103, + 529, + 212, + 552 + ], + "score": 1.0, + "content": "It is immediate to see that", + "type": "text" + }, + { + "bbox": [ + 212, + 534, + 278, + 549 + ], + "score": 0.93, + "content": "\\widehat { \\Sigma } _ { a } ( t ) = \\widehat { \\Sigma } _ { a , n ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 529, + 296, + 552 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 296, + 534, + 359, + 549 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a } ( t ) = \\widehat { \\beta } _ { a , n ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 529, + 394, + 552 + ], + "score": 1.0, + "content": ". Define", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 550, + 465, + 565 + ], + "lines": [ + { + "bbox": [ + 126, + 550, + 465, + 565 + ], + "spans": [ + { + "bbox": [ + 126, + 550, + 465, + 565 + ], + "score": 0.78, + "content": "\\pi ^ { * } ( a , x ) = ( 1 - \\varepsilon _ { 0 } ) a \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } - \\beta _ { 0 } ) > 0 \\} + \\varepsilon _ { 0 } ( 1 - a ) \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\leq 0 \\}", + "type": "interline_equation", + "image_path": "8dcafb92bd47026ee739b96321c0f6d8c86aeb71f23d2e2c317e40e581414d03.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 126, + 550, + 465, + 565 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 567, + 227, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 565, + 228, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 137, + 580 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 137, + 567, + 180, + 579 + ], + "score": 0.92, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 565, + 198, + 580 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 199, + 567, + 225, + 578 + ], + "score": 0.85, + "content": "x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 565, + 228, + 580 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "text", + "bbox": [ + 106, + 585, + 506, + 632 + ], + "lines": [ + { + "bbox": [ + 105, + 585, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 287, + 599 + ], + "score": 1.0, + "content": "Lemma 2 Assume (A1)-(A3) hold. Assume", + "type": "text" + }, + { + "bbox": [ + 288, + 586, + 373, + 598 + ], + "score": 0.91, + "content": "\\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\pi ^ { * } ( a , x ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 585, + 394, + 599 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 394, + 586, + 426, + 598 + ], + "score": 0.92, + "content": "\\left| Y ^ { * } ( a ) \\right|", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 585, + 506, + 599 + ], + "score": 1.0, + "content": "is bounded almost", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 596, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 150, + 610 + ], + "score": 1.0, + "content": "surely, for", + "type": "text" + }, + { + "bbox": [ + 150, + 597, + 194, + 609 + ], + "score": 0.92, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 596, + 232, + 610 + ], + "score": 1.0, + "content": ". Assume", + "type": "text" + }, + { + "bbox": [ + 232, + 597, + 372, + 609 + ], + "score": 0.85, + "content": "P r ( | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\bar { \\beta } _ { 0 } ) | \\le \\epsilon ) \\ \\le L _ { 0 } \\mathfrak { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 596, + 454, + 610 + ], + "score": 1.0, + "content": "\u000f, for some constant", + "type": "text" + }, + { + "bbox": [ + 454, + 597, + 486, + 608 + ], + "score": 0.91, + "content": "L _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 596, + 506, + 610 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 608, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 123, + 621 + ], + "score": 1.0, + "content": "any", + "type": "text" + }, + { + "bbox": [ + 124, + 609, + 149, + 619 + ], + "score": 0.88, + "content": "\\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 608, + 209, + 621 + ], + "score": 1.0, + "content": ". Then for any", + "type": "text" + }, + { + "bbox": [ + 209, + 608, + 235, + 620 + ], + "score": 0.89, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 608, + 290, + 621 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + }, + { + "bbox": [ + 290, + 609, + 372, + 620 + ], + "score": 0.85, + "content": "\\sqrt { j _ { n } } / \\sqrt { \\log j _ { n } } \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 608, + 506, + 621 + ], + "score": 1.0, + "content": ", the following event occurs with", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 619, + 237, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 184, + 633 + ], + "score": 1.0, + "content": "probability at least", + "type": "text" + }, + { + "bbox": [ + 185, + 619, + 233, + 631 + ], + "score": 0.89, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 619, + 237, + 633 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5 + }, + { + "type": "interline_equation", + "bbox": [ + 151, + 632, + 439, + 668 + ], + "lines": [ + { + "bbox": [ + 151, + 632, + 439, + 668 + ], + "spans": [ + { + "bbox": [ + 151, + 632, + 439, + 668 + ], + "score": 0.91, + "content": " \\sum _ { a \\in \\{ 0 , 1 \\} } E ^ { \\mathcal { F } _ { i - 1 } } | \\sum _ { i = 1 } ^ { k } \\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\} | \\preceq q \\sqrt { k \\log k } , \\forall k \\geq j _ { n } .", + "type": "interline_equation", + "image_path": "861230d88193766b7e64c8aa4c8a9354e7d1962583cb02ceab07107e1fb29111.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 151, + 632, + 439, + 644.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 151, + 644.0, + 439, + 656.0 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 151, + 656.0, + 439, + 668.0 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 676, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 437, + 690 + ], + "score": 1.0, + "content": "Lemma 2 implies that Condition equation 5 in Theorem 1 automatically holds with", + "type": "text" + }, + { + "bbox": [ + 437, + 677, + 477, + 689 + ], + "score": 0.92, + "content": "\\alpha _ { 0 } = 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 676, + 505, + 690 + ], + "score": 1.0, + "content": ", when", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 281, + 701 + ], + "score": 1.0, + "content": "the epsilon-greedy strategy is used. When", + "type": "text" + }, + { + "bbox": [ + 281, + 687, + 353, + 700 + ], + "score": 0.91, + "content": "\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "is a continuous random variable, the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 154, + 712 + ], + "score": 1.0, + "content": "assumption", + "type": "text" + }, + { + "bbox": [ + 154, + 698, + 292, + 711 + ], + "score": 0.88, + "content": "\\bar { \\operatorname* { P r } } ( | \\varphi ^ { \\top } ( X ) ( \\bar { \\beta _ { 1 } } - \\beta _ { 0 } ) | \\leq \\epsilon ) \\leq { \\dot { L _ { 0 } } } \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 698, + 323, + 712 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 324, + 700, + 347, + 709 + ], + "score": 0.85, + "content": "\\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 698, + 450, + 712 + ], + "score": 1.0, + "content": "in Lemma 2 is satisfied if", + "type": "text" + }, + { + "bbox": [ + 450, + 698, + 505, + 711 + ], + "score": 0.91, + "content": "\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } -", + "type": "inline_equation" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 119, + 721 + ], + "score": 0.71, + "content": "\\beta _ { 0 , }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 709, + 324, + 722 + ], + "score": 1.0, + "content": ") has a bounded probability density function. When", + "type": "text" + }, + { + "bbox": [ + 325, + 709, + 394, + 722 + ], + "score": 0.91, + "content": "\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "is discrete, this assumption", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 720, + 284, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 159, + 733 + ], + "score": 1.0, + "content": "is satisfied if", + "type": "text" + }, + { + "bbox": [ + 160, + 720, + 281, + 733 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname* { i n f } _ { x \\in \\bar { \\mathbb { X } } } | \\varphi ^ { \\top } ( x ) \\dot { ( \\beta _ { 1 } - \\beta _ { 0 } ) } | > 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 720, + 284, + 733 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43 + } + ], + "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, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 15, + "width": 14 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 506, + 172 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "When a tensor-product B-spline is used (see Section 6 of Chen & Christensen, 2015, for", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 104, + 93, + 505, + 106 + ], + "spans": [ + { + "bbox": [ + 104, + 93, + 505, + 106 + ], + "score": 1.0, + "content": "a brief overview of tenor-product B-splines), (A3) is automatically satisfied. Specifically,", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 104, + 506, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 104, + 216, + 117 + ], + "score": 0.88, + "content": "\\lambda _ { \\operatorname* { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1", + "type": "inline_equation" + }, + { + "bbox": [ + 216, + 104, + 221, + 118 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 221, + 104, + 332, + 117 + ], + "score": 0.9, + "content": "\\dot { \\lambda } _ { \\mathrm { m a x } } [ \\mathrm { E } \\varphi ( X ) \\dot { \\varphi } ^ { \\top } ( X ) ] \\asymp 1", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 104, + 506, + 118 + ], + "score": 1.0, + "content": "follow from Theorem 3.3 of (Burman &", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 115, + 506, + 130 + ], + "spans": [ + { + "bbox": [ + 105, + 115, + 163, + 130 + ], + "score": 1.0, + "content": "Chen, 1989).", + "type": "text" + }, + { + "bbox": [ + 163, + 117, + 269, + 129 + ], + "score": 0.89, + "content": "\\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } = O ( q ^ { 1 / 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 115, + 506, + 130 + ], + "score": 1.0, + "content": "follows by noting that the absolute value of each element", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 105, + 127, + 506, + 141 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 117, + 141 + ], + "score": 1.0, + "content": "in", + "type": "text" + }, + { + "bbox": [ + 117, + 128, + 138, + 140 + ], + "score": 0.91, + "content": "\\varphi ( x )", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 127, + 302, + 141 + ], + "score": 1.0, + "content": "is bounded by some universal constant.", + "type": "text" + }, + { + "bbox": [ + 302, + 128, + 421, + 140 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\operatorname* { l i m } \\operatorname* { i n f } _ { q } \\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } > 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 127, + 506, + 141 + ], + "score": 1.0, + "content": "follows from the ar-", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 138, + 505, + 151 + ], + "spans": [ + { + "bbox": [ + 104, + 138, + 505, + 151 + ], + "score": 1.0, + "content": "guments used in the proof of Lemma E.4 of Shi et al. (2020b). The last condition in equation 12", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 149, + 506, + 163 + ], + "spans": [ + { + "bbox": [ + 105, + 149, + 298, + 163 + ], + "score": 1.0, + "content": "holds by noting that each function in the vector", + "type": "text" + }, + { + "bbox": [ + 298, + 150, + 316, + 162 + ], + "score": 0.91, + "content": "\\varphi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 149, + 506, + 163 + ], + "score": 1.0, + "content": "is Lipschitz continuous when a tensor-product", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 105, + 160, + 175, + 173 + ], + "spans": [ + { + "bbox": [ + 105, + 160, + 175, + 173 + ], + "score": 1.0, + "content": "B-spline is used.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 3.5, + "bbox_fs": [ + 104, + 82, + 506, + 173 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 185, + 271, + 196 + ], + "lines": [ + { + "bbox": [ + 105, + 184, + 273, + 198 + ], + "spans": [ + { + "bbox": [ + 105, + 184, + 273, + 198 + ], + "score": 1.0, + "content": "B.2 ON THE APPROXIMATION ERROR", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 108, + 205, + 409, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 205, + 410, + 219 + ], + "spans": [ + { + "bbox": [ + 106, + 205, + 410, + 219 + ], + "score": 1.0, + "content": "The proposed test remains valid as long as the approximation error satisfies", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 106, + 205, + 410, + 219 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 218, + 435, + 242 + ], + "lines": [ + { + "bbox": [ + 155, + 218, + 435, + 242 + ], + "spans": [ + { + "bbox": [ + 155, + 218, + 435, + 242 + ], + "score": 0.89, + "content": "\\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | = o ( \\{ N ( T ) \\} ^ { - 1 / 2 } ) ,", + "type": "interline_equation", + "image_path": "6430aad6083eb26df949d353ffe25fae3d6ebf25c588fd090be324281029d7e1.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 155, + 218, + 435, + 242 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 243, + 502, + 266 + ], + "lines": [ + { + "bbox": [ + 105, + 241, + 504, + 257 + ], + "spans": [ + { + "bbox": [ + 105, + 241, + 504, + 257 + ], + "score": 1.0, + "content": "with probability tending to 1. In the following, we introduce some sufficient conditions for equa-", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 104, + 253, + 140, + 266 + ], + "spans": [ + { + "bbox": [ + 104, + 253, + 140, + 266 + ], + "score": 1.0, + "content": "tion 13.", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 104, + 241, + 504, + 266 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 271, + 504, + 305 + ], + "lines": [ + { + "bbox": [ + 105, + 271, + 505, + 284 + ], + "spans": [ + { + "bbox": [ + 105, + 271, + 205, + 284 + ], + "score": 1.0, + "content": "Suppose the Q-function", + "type": "text" + }, + { + "bbox": [ + 206, + 271, + 239, + 284 + ], + "score": 0.93, + "content": "Q _ { 0 } ( \\cdot , a )", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 271, + 251, + 284 + ], + "score": 1.0, + "content": "is", + "type": "text" + }, + { + "bbox": [ + 251, + 274, + 258, + 283 + ], + "score": 0.82, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 271, + 379, + 284 + ], + "score": 1.0, + "content": "-smooth (see the definition of", + "type": "text" + }, + { + "bbox": [ + 379, + 274, + 386, + 283 + ], + "score": 0.82, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 271, + 505, + 284 + ], + "score": 1.0, + "content": "-smoothness in Stone, 1982),", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 281, + 506, + 295 + ], + "spans": [ + { + "bbox": [ + 105, + 281, + 121, + 295 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 122, + 282, + 162, + 294 + ], + "score": 0.91, + "content": "a \\in [ 0 , 1 ]", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 281, + 417, + 295 + ], + "score": 1.0, + "content": ". When a tensor-product B-spline or Wavelet basis is used for", + "type": "text" + }, + { + "bbox": [ + 417, + 282, + 435, + 294 + ], + "score": 0.91, + "content": "\\varphi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 281, + 506, + 295 + ], + "score": 1.0, + "content": ", then there exist", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 293, + 219, + 306 + ], + "spans": [ + { + "bbox": [ + 106, + 293, + 130, + 306 + ], + "score": 1.0, + "content": "some", + "type": "text" + }, + { + "bbox": [ + 130, + 294, + 142, + 305 + ], + "score": 0.89, + "content": "\\beta _ { 0 } ^ { \\ast }", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 293, + 160, + 306 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 160, + 294, + 172, + 305 + ], + "score": 0.89, + "content": "\\beta _ { 1 } ^ { * }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 293, + 219, + 306 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14, + "bbox_fs": [ + 105, + 271, + 506, + 306 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 306, + 422, + 330 + ], + "lines": [ + { + "bbox": [ + 168, + 306, + 422, + 330 + ], + "spans": [ + { + "bbox": [ + 168, + 306, + 422, + 330 + ], + "score": 0.91, + "content": "\\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | = O ( q ^ { - p / d } ) .", + "type": "interline_equation", + "image_path": "6f0c8d27a0832b66adf8ddbdacb13e7232ac3886671974707e0449ff1a0c8b98.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 168, + 306, + 422, + 330 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 331, + 503, + 354 + ], + "lines": [ + { + "bbox": [ + 106, + 331, + 505, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 331, + 505, + 344 + ], + "score": 1.0, + "content": "See Section 2.2 of Huang (1998) for detailed discussions on the approximation power of these basis", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 106, + 343, + 385, + 355 + ], + "spans": [ + { + "bbox": [ + 106, + 343, + 385, + 355 + ], + "score": 1.0, + "content": "functions. Condition equation 13 is thus automatically satisfied when", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 106, + 331, + 505, + 355 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 254, + 355, + 336, + 371 + ], + "lines": [ + { + "bbox": [ + 254, + 355, + 336, + 371 + ], + "spans": [ + { + "bbox": [ + 254, + 355, + 336, + 371 + ], + "score": 0.91, + "content": "q \\gg \\{ N ( T ) \\} ^ { d / ( 2 p ) } ,", + "type": "interline_equation", + "image_path": "889508cae5e1cb04f39271104cc0322b564e84f205d454d257c722e9fb152fa4.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 254, + 355, + 336, + 371 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 372, + 224, + 384 + ], + "lines": [ + { + "bbox": [ + 106, + 371, + 226, + 386 + ], + "spans": [ + { + "bbox": [ + 106, + 371, + 226, + 386 + ], + "score": 1.0, + "content": "with probability tending to 1.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 106, + 371, + 226, + 386 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 399, + 272, + 412 + ], + "lines": [ + { + "bbox": [ + 105, + 398, + 275, + 414 + ], + "spans": [ + { + "bbox": [ + 105, + 398, + 275, + 414 + ], + "score": 1.0, + "content": "C ADAPTIVE RANDOMIZATION", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 106, + 423, + 506, + 468 + ], + "lines": [ + { + "bbox": [ + 106, + 424, + 505, + 435 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 505, + 435 + ], + "score": 1.0, + "content": "In practice, the company might want to allocate more traffic to a better treatment based on the", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 434, + 505, + 447 + ], + "spans": [ + { + "bbox": [ + 105, + 434, + 214, + 447 + ], + "score": 1.0, + "content": "observed data stream. The", + "type": "text" + }, + { + "bbox": [ + 214, + 437, + 219, + 444 + ], + "score": 0.71, + "content": "\\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 434, + 505, + 447 + ], + "score": 1.0, + "content": "-greedy strategy is commonly used to balance the trade-off between ex-", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 446, + 505, + 457 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 259, + 457 + ], + "score": 1.0, + "content": "ploration and exploitation. For a given", + "type": "text" + }, + { + "bbox": [ + 260, + 446, + 307, + 456 + ], + "score": 0.91, + "content": "0 < \\varepsilon _ { 0 } < 1", + "type": "inline_equation" + }, + { + "bbox": [ + 307, + 446, + 505, + 457 + ], + "score": 1.0, + "content": ", consider the following randomization procedure:", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 456, + 382, + 469 + ], + "spans": [ + { + "bbox": [ + 106, + 457, + 174, + 469 + ], + "score": 1.0, + "content": "for some integer", + "type": "text" + }, + { + "bbox": [ + 174, + 456, + 206, + 468 + ], + "score": 0.92, + "content": "N _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 457, + 241, + 469 + ], + "score": 1.0, + "content": "and any", + "type": "text" + }, + { + "bbox": [ + 241, + 457, + 272, + 468 + ], + "score": 0.88, + "content": "j \\geq N _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 457, + 276, + 469 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 276, + 456, + 319, + 468 + ], + "score": 0.85, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 319, + 457, + 323, + 469 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 323, + 456, + 349, + 467 + ], + "score": 0.8, + "content": "x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 350, + 457, + 382, + 469 + ], + "score": 1.0, + "content": ", we set", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23.5, + "bbox_fs": [ + 105, + 424, + 505, + 469 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 469, + 520, + 498 + ], + "lines": [ + { + "bbox": [ + 104, + 468, + 523, + 489 + ], + "spans": [ + { + "bbox": [ + 104, + 468, + 111, + 489 + ], + "score": 1.0, + "content": "π", + "type": "text" + }, + { + "bbox": [ + 111, + 469, + 514, + 486 + ], + "score": 0.73, + "content": "\\begin{array} { r } { \\tau _ { j - 1 } ( a , x ) = ( 1 - \\varepsilon _ { 0 } ) a \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 , j - 1 } - \\widehat { \\beta } _ { 0 , j - 1 } ) > 0 \\} + \\varepsilon _ { 0 } ( 1 - a ) \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 , j - 1 } - \\widehat { \\beta } _ { 0 , j - 1 } ) \\leq 0 } \\end{array}", + "type": "inline_equation", + "image_path": "8e3b45e597e249249ad7add75631c6d9d0546833b69099ed8d5f34a9964ca5c8.jpg" + }, + { + "bbox": [ + 514, + 468, + 523, + 489 + ], + "score": 1.0, + "content": "},", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 104, + 484, + 135, + 500 + ], + "spans": [ + { + "bbox": [ + 104, + 484, + 135, + 500 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 104, + 468, + 523, + 500 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 497, + 469, + 532 + ], + "lines": [ + { + "bbox": [ + 121, + 497, + 469, + 532 + ], + "spans": [ + { + "bbox": [ + 121, + 497, + 469, + 532 + ], + "score": 0.89, + "content": "\\widehat { \\beta } _ { a , j } = \\widehat { \\Sigma } _ { a , j } ^ { - 1 } \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\} \\mathrm { a n d } \\widehat { \\Sigma } _ { a , j } = \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) .", + "type": "interline_equation", + "image_path": "51ce5207529e43fe8b1a8407d42df5c52d861bba4c23d54c7ffc6cf999fa8809.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 121, + 497, + 469, + 508.6666666666667 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 121, + 508.6666666666667, + 469, + 520.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 121, + 520.3333333333334, + 469, + 532.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 533, + 393, + 549 + ], + "lines": [ + { + "bbox": [ + 103, + 529, + 394, + 552 + ], + "spans": [ + { + "bbox": [ + 103, + 529, + 212, + 552 + ], + "score": 1.0, + "content": "It is immediate to see that", + "type": "text" + }, + { + "bbox": [ + 212, + 534, + 278, + 549 + ], + "score": 0.93, + "content": "\\widehat { \\Sigma } _ { a } ( t ) = \\widehat { \\Sigma } _ { a , n ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 278, + 529, + 296, + 552 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 296, + 534, + 359, + 549 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a } ( t ) = \\widehat { \\beta } _ { a , n ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 529, + 394, + 552 + ], + "score": 1.0, + "content": ". Define", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31, + "bbox_fs": [ + 103, + 529, + 394, + 552 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 126, + 550, + 465, + 565 + ], + "lines": [ + { + "bbox": [ + 126, + 550, + 465, + 565 + ], + "spans": [ + { + "bbox": [ + 126, + 550, + 465, + 565 + ], + "score": 0.78, + "content": "\\pi ^ { * } ( a , x ) = ( 1 - \\varepsilon _ { 0 } ) a \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } - \\beta _ { 0 } ) > 0 \\} + \\varepsilon _ { 0 } ( 1 - a ) \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\leq 0 \\}", + "type": "interline_equation", + "image_path": "8dcafb92bd47026ee739b96321c0f6d8c86aeb71f23d2e2c317e40e581414d03.jpg" + } + ] + } + ], + "index": 32, + "virtual_lines": [ + { + "bbox": [ + 126, + 550, + 465, + 565 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 567, + 227, + 579 + ], + "lines": [ + { + "bbox": [ + 105, + 565, + 228, + 580 + ], + "spans": [ + { + "bbox": [ + 105, + 565, + 137, + 580 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 137, + 567, + 180, + 579 + ], + "score": 0.92, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 565, + 198, + 580 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 199, + 567, + 225, + 578 + ], + "score": 0.85, + "content": "x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 565, + 228, + 580 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33, + "bbox_fs": [ + 105, + 565, + 228, + 580 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 585, + 506, + 632 + ], + "lines": [ + { + "bbox": [ + 105, + 585, + 506, + 599 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 287, + 599 + ], + "score": 1.0, + "content": "Lemma 2 Assume (A1)-(A3) hold. Assume", + "type": "text" + }, + { + "bbox": [ + 288, + 586, + 373, + 598 + ], + "score": 0.91, + "content": "\\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\pi ^ { * } ( a , x ) > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 374, + 585, + 394, + 599 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 394, + 586, + 426, + 598 + ], + "score": 0.92, + "content": "\\left| Y ^ { * } ( a ) \\right|", + "type": "inline_equation" + }, + { + "bbox": [ + 426, + 585, + 506, + 599 + ], + "score": 1.0, + "content": "is bounded almost", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 596, + 506, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 596, + 150, + 610 + ], + "score": 1.0, + "content": "surely, for", + "type": "text" + }, + { + "bbox": [ + 150, + 597, + 194, + 609 + ], + "score": 0.92, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 596, + 232, + 610 + ], + "score": 1.0, + "content": ". Assume", + "type": "text" + }, + { + "bbox": [ + 232, + 597, + 372, + 609 + ], + "score": 0.85, + "content": "P r ( | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\bar { \\beta } _ { 0 } ) | \\le \\epsilon ) \\ \\le L _ { 0 } \\mathfrak { e }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 596, + 454, + 610 + ], + "score": 1.0, + "content": "\u000f, for some constant", + "type": "text" + }, + { + "bbox": [ + 454, + 597, + 486, + 608 + ], + "score": 0.91, + "content": "L _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 596, + 506, + 610 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 105, + 608, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 105, + 608, + 123, + 621 + ], + "score": 1.0, + "content": "any", + "type": "text" + }, + { + "bbox": [ + 124, + 609, + 149, + 619 + ], + "score": 0.88, + "content": "\\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 608, + 209, + 621 + ], + "score": 1.0, + "content": ". Then for any", + "type": "text" + }, + { + "bbox": [ + 209, + 608, + 235, + 620 + ], + "score": 0.89, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 235, + 608, + 290, + 621 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + }, + { + "bbox": [ + 290, + 609, + 372, + 620 + ], + "score": 0.85, + "content": "\\sqrt { j _ { n } } / \\sqrt { \\log j _ { n } } \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 608, + 506, + 621 + ], + "score": 1.0, + "content": ", the following event occurs with", + "type": "text" + } + ], + "index": 36 + }, + { + "bbox": [ + 105, + 619, + 237, + 633 + ], + "spans": [ + { + "bbox": [ + 105, + 619, + 184, + 633 + ], + "score": 1.0, + "content": "probability at least", + "type": "text" + }, + { + "bbox": [ + 185, + 619, + 233, + 631 + ], + "score": 0.89, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 234, + 619, + 237, + 633 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 35.5, + "bbox_fs": [ + 105, + 585, + 506, + 633 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 151, + 632, + 439, + 668 + ], + "lines": [ + { + "bbox": [ + 151, + 632, + 439, + 668 + ], + "spans": [ + { + "bbox": [ + 151, + 632, + 439, + 668 + ], + "score": 0.91, + "content": " \\sum _ { a \\in \\{ 0 , 1 \\} } E ^ { \\mathcal { F } _ { i - 1 } } | \\sum _ { i = 1 } ^ { k } \\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\} | \\preceq q \\sqrt { k \\log k } , \\forall k \\geq j _ { n } .", + "type": "interline_equation", + "image_path": "861230d88193766b7e64c8aa4c8a9354e7d1962583cb02ceab07107e1fb29111.jpg" + } + ] + } + ], + "index": 39, + "virtual_lines": [ + { + "bbox": [ + 151, + 632, + 439, + 644.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 151, + 644.0, + 439, + 656.0 + ], + "spans": [], + "index": 39 + }, + { + "bbox": [ + 151, + 656.0, + 439, + 668.0 + ], + "spans": [], + "index": 40 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 676, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 676, + 505, + 690 + ], + "spans": [ + { + "bbox": [ + 105, + 676, + 437, + 690 + ], + "score": 1.0, + "content": "Lemma 2 implies that Condition equation 5 in Theorem 1 automatically holds with", + "type": "text" + }, + { + "bbox": [ + 437, + 677, + 477, + 689 + ], + "score": 0.92, + "content": "\\alpha _ { 0 } = 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 676, + 505, + 690 + ], + "score": 1.0, + "content": ", when", + "type": "text" + } + ], + "index": 41 + }, + { + "bbox": [ + 106, + 687, + 505, + 701 + ], + "spans": [ + { + "bbox": [ + 106, + 687, + 281, + 701 + ], + "score": 1.0, + "content": "the epsilon-greedy strategy is used. When", + "type": "text" + }, + { + "bbox": [ + 281, + 687, + 353, + 700 + ], + "score": 0.91, + "content": "\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 687, + 505, + 701 + ], + "score": 1.0, + "content": "is a continuous random variable, the", + "type": "text" + } + ], + "index": 42 + }, + { + "bbox": [ + 105, + 698, + 505, + 712 + ], + "spans": [ + { + "bbox": [ + 105, + 698, + 154, + 712 + ], + "score": 1.0, + "content": "assumption", + "type": "text" + }, + { + "bbox": [ + 154, + 698, + 292, + 711 + ], + "score": 0.88, + "content": "\\bar { \\operatorname* { P r } } ( | \\varphi ^ { \\top } ( X ) ( \\bar { \\beta _ { 1 } } - \\beta _ { 0 } ) | \\leq \\epsilon ) \\leq { \\dot { L _ { 0 } } } \\epsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 292, + 698, + 323, + 712 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 324, + 700, + 347, + 709 + ], + "score": 0.85, + "content": "\\epsilon > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 347, + 698, + 450, + 712 + ], + "score": 1.0, + "content": "in Lemma 2 is satisfied if", + "type": "text" + }, + { + "bbox": [ + 450, + 698, + 505, + 711 + ], + "score": 0.91, + "content": "\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } -", + "type": "inline_equation" + } + ], + "index": 43 + }, + { + "bbox": [ + 106, + 709, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 106, + 710, + 119, + 721 + ], + "score": 0.71, + "content": "\\beta _ { 0 , }", + "type": "inline_equation" + }, + { + "bbox": [ + 119, + 709, + 324, + 722 + ], + "score": 1.0, + "content": ") has a bounded probability density function. When", + "type": "text" + }, + { + "bbox": [ + 325, + 709, + 394, + 722 + ], + "score": 0.91, + "content": "\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 394, + 709, + 505, + 722 + ], + "score": 1.0, + "content": "is discrete, this assumption", + "type": "text" + } + ], + "index": 44 + }, + { + "bbox": [ + 105, + 720, + 284, + 733 + ], + "spans": [ + { + "bbox": [ + 105, + 720, + 159, + 733 + ], + "score": 1.0, + "content": "is satisfied if", + "type": "text" + }, + { + "bbox": [ + 160, + 720, + 281, + 733 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname* { i n f } _ { x \\in \\bar { \\mathbb { X } } } | \\varphi ^ { \\top } ( x ) \\dot { ( \\beta _ { 1 } - \\beta _ { 0 } ) } | > 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 281, + 720, + 284, + 733 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 45 + } + ], + "index": 43, + "bbox_fs": [ + 105, + 676, + 505, + 733 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 81, + 361, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 362, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 362, + 95 + ], + "score": 1.0, + "content": "D TESTING THE AVERAGE TREATMENT EFFECTS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 107, + 106, + 207, + 118 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 208, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 208, + 118 + ], + "score": 1.0, + "content": "D.1 THE ALGORITHM", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 108, + 126, + 290, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 125, + 291, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 291, + 140 + ], + "score": 1.0, + "content": "We focus on testing the following hypothesis,", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 176, + 144, + 413, + 158 + ], + "lines": [ + { + "bbox": [ + 176, + 144, + 413, + 158 + ], + "spans": [ + { + "bbox": [ + 176, + 144, + 413, + 158 + ], + "score": 0.86, + "content": "H _ { 0 } : { \\mathrm { E } } Y _ { i } ^ { * } ( 1 ) \\leq { \\mathrm { E } } Y _ { i } ^ { * } ( 0 ) { \\mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \\mathrm { E } } Y _ { i } ^ { * } ( 1 ) > { \\mathrm { E } } Y _ { i } ^ { * } ( 0 ) .", + "type": "interline_equation", + "image_path": "cd2d5b140d865ccb4ec9daf6fd35f1e2fe3068f80c03443af72c60966d2eeb85.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 176, + 144, + 413, + 158 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 162, + 263, + 174 + ], + "lines": [ + { + "bbox": [ + 106, + 162, + 263, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 263, + 175 + ], + "score": 1.0, + "content": "Under (A1) and (A2), it suffices to test", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 180, + 437, + 193 + ], + "lines": [ + { + "bbox": [ + 153, + 180, + 437, + 193 + ], + "spans": [ + { + "bbox": [ + 153, + 180, + 437, + 193 + ], + "score": 0.83, + "content": "H _ { 0 } : { \\mathrm { E } } Q ( X _ { i } , 1 ) \\leq { \\mathrm { E } } Q ( X _ { i } , 0 ) { \\mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \\mathrm { E } } Q ( X _ { i } , 1 ) > { \\mathrm { E } } Q ( X _ { i } , 0 ) .", + "type": "interline_equation", + "image_path": "98de986d12bede2b34cc5b2d8ff73e7d6a523890d25d368bf55e9510da81abcb.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 153, + 180, + 437, + 193 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 199, + 506, + 222 + ], + "lines": [ + { + "bbox": [ + 106, + 198, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 505, + 211 + ], + "score": 1.0, + "content": "We similarly use basis approximations to model the Q-function. Our proposal is summarized in the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 210, + 441, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 441, + 223 + ], + "score": 1.0, + "content": "following algorithm. We next conduct simulation studies to evaluate this algorithm.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5 + }, + { + "type": "text", + "bbox": [ + 116, + 234, + 395, + 246 + ], + "lines": [ + { + "bbox": [ + 115, + 231, + 393, + 250 + ], + "spans": [ + { + "bbox": [ + 115, + 231, + 267, + 250 + ], + "score": 1.0, + "content": "Input: Number of bootstrap samples", + "type": "text" + }, + { + "bbox": [ + 267, + 235, + 276, + 244 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 231, + 291, + 250 + ], + "score": 1.0, + "content": ", an", + "type": "text" + }, + { + "bbox": [ + 292, + 237, + 299, + 244 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 231, + 375, + 250 + ], + "score": 1.0, + "content": "spending function", + "type": "text" + }, + { + "bbox": [ + 375, + 234, + 393, + 246 + ], + "score": 0.9, + "content": "\\alpha ( \\cdot )", + "type": "inline_equation" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "text", + "bbox": [ + 116, + 246, + 490, + 279 + ], + "lines": [ + { + "bbox": [ + 115, + 245, + 489, + 261 + ], + "spans": [ + { + "bbox": [ + 115, + 245, + 163, + 261 + ], + "score": 1.0, + "content": "Initialize:", + "type": "text" + }, + { + "bbox": [ + 163, + 246, + 189, + 258 + ], + "score": 0.76, + "content": "n = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 245, + 193, + 261 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 193, + 245, + 266, + 260 + ], + "score": 0.79, + "content": "\\widehat { \\Sigma } _ { 0 } = \\widehat { \\Sigma } _ { 1 } = O _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 245, + 270, + 261 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 270, + 246, + 337, + 260 + ], + "score": 0.69, + "content": "\\widehat { \\gamma } _ { 0 } = \\widehat { \\gamma } _ { 1 } = 0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 245, + 340, + 261 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 340, + 246, + 420, + 260 + ], + "score": 0.81, + "content": "\\widehat { \\beta } _ { 0 , b } = \\widehat { \\beta } _ { 1 , b } = 0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 245, + 423, + 261 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 424, + 248, + 450, + 259 + ], + "score": 0.72, + "content": "\\bar { \\varphi } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 245, + 489, + 261 + ], + "score": 1.0, + "content": "and a set", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 117, + 258, + 186, + 271 + ], + "spans": [ + { + "bbox": [ + 117, + 259, + 182, + 271 + ], + "score": 0.91, + "content": "\\mathcal { T } = \\{ 1 , \\ldots , B \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 258, + 186, + 270 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 116, + 269, + 195, + 281 + ], + "spans": [ + { + "bbox": [ + 116, + 269, + 134, + 281 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 134, + 271, + 159, + 280 + ], + "score": 0.86, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 269, + 171, + 281 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 171, + 271, + 181, + 279 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 269, + 195, + 281 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 126, + 280, + 322, + 293 + ], + "lines": [ + { + "bbox": [ + 125, + 275, + 319, + 297 + ], + "spans": [ + { + "bbox": [ + 125, + 275, + 170, + 297 + ], + "score": 1.0, + "content": "Initialize:", + "type": "text" + }, + { + "bbox": [ + 171, + 281, + 199, + 291 + ], + "score": 0.81, + "content": "m = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 275, + 202, + 297 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 202, + 279, + 228, + 292 + ], + "score": 0.75, + "content": "\\widehat { \\phi } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 275, + 246, + 297 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 246, + 278, + 319, + 293 + ], + "score": 0.92, + "content": "\\widehat { \\Phi } _ { 0 } = \\widehat { \\Phi } _ { 1 } = O _ { p + 1 }", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 126, + 302, + 267, + 314 + ], + "lines": [ + { + "bbox": [ + 125, + 301, + 267, + 316 + ], + "spans": [ + { + "bbox": [ + 125, + 301, + 144, + 316 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 145, + 303, + 215, + 315 + ], + "score": 0.9, + "content": "i = N ( t _ { k - 1 } ) + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 301, + 226, + 316 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 226, + 303, + 253, + 315 + ], + "score": 0.89, + "content": "N ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 301, + 267, + 316 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "text", + "bbox": [ + 126, + 351, + 376, + 363 + ], + "lines": [ + { + "bbox": [ + 126, + 348, + 377, + 366 + ], + "spans": [ + { + "bbox": [ + 126, + 348, + 168, + 366 + ], + "score": 1.0, + "content": "bCompute", + "type": "text" + }, + { + "bbox": [ + 169, + 349, + 221, + 363 + ], + "score": 0.92, + "content": "\\widehat { \\beta } _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\widehat { \\gamma } _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 348, + 236, + 366 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 236, + 351, + 279, + 363 + ], + "score": 0.92, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 348, + 298, + 366 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 298, + 349, + 372, + 363 + ], + "score": 0.91, + "content": "S = \\bar { \\varphi } ^ { \\top } ( \\widehat { \\beta } _ { 1 } - \\widehat { \\beta } _ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 348, + 377, + 366 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 136, + 398, + 442, + 412 + ], + "lines": [], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 136, + 398, + 442, + 412 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 126, + 411, + 213, + 421 + ], + "lines": [ + { + "bbox": [ + 126, + 409, + 213, + 423 + ], + "spans": [ + { + "bbox": [ + 126, + 409, + 144, + 423 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 145, + 411, + 198, + 422 + ], + "score": 0.86, + "content": "b = 1 , \\dots , B", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 409, + 213, + 423 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "text", + "bbox": [ + 133, + 422, + 501, + 462 + ], + "lines": [ + { + "bbox": [ + 135, + 419, + 501, + 435 + ], + "spans": [ + { + "bbox": [ + 135, + 419, + 243, + 435 + ], + "score": 1.0, + "content": "Generate two independent", + "type": "text" + }, + { + "bbox": [ + 244, + 421, + 290, + 434 + ], + "score": 0.91, + "content": "N ( 0 , I _ { p + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 419, + 389, + 435 + ], + "score": 1.0, + "content": "Gaussian vectors e0, e1,", + "type": "text" + }, + { + "bbox": [ + 389, + 421, + 422, + 434 + ], + "score": 0.55, + "content": "N ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 419, + 490, + 435 + ], + "score": 1.0, + "content": "random variable", + "type": "text" + }, + { + "bbox": [ + 490, + 423, + 501, + 433 + ], + "score": 0.85, + "content": "e _ { 2 }", + "type": "inline_equation" + } + ], + "index": 17 + }, + { + "bbox": [ + 136, + 428, + 394, + 452 + ], + "spans": [ + { + "bbox": [ + 136, + 433, + 386, + 447 + ], + "score": 0.91, + "content": "\\widehat { \\beta } _ { a , b } = ( 1 - m n ^ { - 1 } ) \\widehat { \\beta } _ { a , b } + n ^ { - 1 } \\widehat { \\Phi } _ { a } ^ { 1 / 2 } e _ { a } + n ^ { - 1 } \\widehat { \\phi } ^ { 1 / 2 } e _ { 2 } , a = 0 , 1", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 428, + 394, + 452 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 135, + 445, + 273, + 464 + ], + "spans": [ + { + "bbox": [ + 135, + 445, + 178, + 464 + ], + "score": 1.0, + "content": "Compute", + "type": "text" + }, + { + "bbox": [ + 178, + 448, + 267, + 462 + ], + "score": 0.92, + "content": "\\widehat { S } _ { b } = \\bar { \\varphi } ^ { \\top } ( \\widehat { \\beta } _ { 1 , b } - \\widehat { \\beta } _ { 0 , b } )", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 445, + 273, + 464 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 126, + 470, + 447, + 506 + ], + "lines": [ + { + "bbox": [ + 125, + 469, + 448, + 485 + ], + "spans": [ + { + "bbox": [ + 125, + 469, + 141, + 485 + ], + "score": 1.0, + "content": "Set", + "type": "text" + }, + { + "bbox": [ + 142, + 473, + 148, + 481 + ], + "score": 0.79, + "content": "z", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 469, + 212, + 485 + ], + "score": 1.0, + "content": "to be the upper", + "type": "text" + }, + { + "bbox": [ + 212, + 471, + 343, + 483 + ], + "score": 0.91, + "content": "\\{ \\alpha ( t ) - | \\mathcal { T } | ^ { c } / B | \\} / ( 1 - | \\mathcal { T } ^ { c } | / B )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 469, + 408, + 485 + ], + "score": 1.0, + "content": "-th percentile of", + "type": "text" + }, + { + "bbox": [ + 408, + 469, + 443, + 483 + ], + "score": 0.93, + "content": "\\{ \\widehat { S } _ { b } \\} _ { b \\in \\mathbb { Z } }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 469, + 448, + 485 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 125, + 483, + 273, + 498 + ], + "spans": [ + { + "bbox": [ + 125, + 483, + 157, + 498 + ], + "score": 1.0, + "content": "Update", + "type": "text" + }, + { + "bbox": [ + 158, + 485, + 165, + 495 + ], + "score": 0.82, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 483, + 177, + 498 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 177, + 483, + 269, + 497 + ], + "score": 0.9, + "content": "{ \\mathcal { T } } \\{ b \\in { \\mathcal { T } } : { \\widehat { S } } _ { b } \\leq z \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 483, + 273, + 498 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 126, + 494, + 167, + 508 + ], + "spans": [ + { + "bbox": [ + 126, + 494, + 136, + 508 + ], + "score": 1.0, + "content": "If", + "type": "text" + }, + { + "bbox": [ + 136, + 496, + 162, + 506 + ], + "score": 0.9, + "content": "S > z", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 494, + 167, + 508 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "text", + "bbox": [ + 137, + 507, + 300, + 518 + ], + "lines": [ + { + "bbox": [ + 136, + 505, + 301, + 520 + ], + "spans": [ + { + "bbox": [ + 136, + 505, + 164, + 520 + ], + "score": 1.0, + "content": "Reject", + "type": "text" + }, + { + "bbox": [ + 164, + 507, + 178, + 518 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 505, + 301, + 520 + ], + "score": 1.0, + "content": "and terminate the experiment;", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + }, + { + "type": "title", + "bbox": [ + 107, + 542, + 226, + 554 + ], + "lines": [ + { + "bbox": [ + 106, + 541, + 227, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 227, + 555 + ], + "score": 1.0, + "content": "D.2 NUMERICAL STUDIES", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 563, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 105, + 563, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 505, + 576 + ], + "score": 1.0, + "content": "In this section, we compare our procedure with the always valid test for testing ATE (Johari et al.,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 573, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 417, + 587 + ], + "score": 1.0, + "content": "2015). We generate the potential outcomes with the same model, except that", + "type": "text" + }, + { + "bbox": [ + 418, + 576, + 427, + 585 + ], + "score": 0.82, + "content": "\\varepsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 573, + 469, + 587 + ], + "score": 1.0, + "content": "’s are i.i.d", + "type": "text" + }, + { + "bbox": [ + 469, + 574, + 501, + 586 + ], + "score": 0.91, + "content": "N ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 573, + 505, + 587 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 585, + 505, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 176, + 598 + ], + "score": 1.0, + "content": "However, we set", + "type": "text" + }, + { + "bbox": [ + 177, + 585, + 240, + 597 + ], + "score": 0.92, + "content": "N ( T _ { 1 } ) \\stackrel { - } { = } 1 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 585, + 259, + 598 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 259, + 585, + 363, + 597 + ], + "score": 0.92, + "content": "N ( T _ { j } ) - N ( T _ { j - 1 } ) = 2 n", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 585, + 380, + 598 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 380, + 586, + 431, + 596 + ], + "score": 0.91, + "content": "2 \\leq j \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 585, + 473, + 598 + ], + "score": 1.0, + "content": "and some", + "type": "text" + }, + { + "bbox": [ + 474, + 586, + 501, + 595 + ], + "score": 0.88, + "content": "n > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 585, + 505, + 598 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 595, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 244, + 610 + ], + "score": 1.0, + "content": "We consider two combinations of", + "type": "text" + }, + { + "bbox": [ + 244, + 597, + 271, + 608 + ], + "score": 0.92, + "content": "( n , K )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 595, + 346, + 610 + ], + "score": 1.0, + "content": ", corresponding to", + "type": "text" + }, + { + "bbox": [ + 346, + 596, + 419, + 608 + ], + "score": 0.92, + "content": "( n , K ) = ( 1 0 0 , 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 595, + 505, + 610 + ], + "score": 1.0, + "content": "and (10, 50). For all", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 607, + 315, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 302, + 621 + ], + "score": 1.0, + "content": "settings, we use a linear function to approximate", + "type": "text" + }, + { + "bbox": [ + 302, + 608, + 311, + 618 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 607, + 315, + 621 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27 + }, + { + "type": "text", + "bbox": [ + 107, + 623, + 505, + 680 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 637 + ], + "score": 1.0, + "content": "In Table 2 (see Appendix G) and Figure 4, we show the rejection probabilities and average stopping", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 634, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 634, + 375, + 649 + ], + "score": 1.0, + "content": "times of the proposed test aggregated over 400 simulations, when", + "type": "text" + }, + { + "bbox": [ + 375, + 635, + 398, + 647 + ], + "score": 0.92, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 634, + 505, + 649 + ], + "score": 1.0, + "content": "is chosen as the spending", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 645, + 506, + 659 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 506, + 659 + ], + "score": 1.0, + "content": "function. It can be seen that our method behaves better than the always valid test when the effect", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 656, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 656, + 506, + 670 + ], + "score": 1.0, + "content": "size is small, and comparable when the effect size is large. The always valid test fails in the adaptive", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 668, + 467, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 341, + 680 + ], + "score": 1.0, + "content": "randomization settings, as the type-I error rates are around", + "type": "text" + }, + { + "bbox": [ + 342, + 668, + 361, + 678 + ], + "score": 0.87, + "content": "50 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 668, + 467, + 680 + ], + "score": 1.0, + "content": "under the null hypothesis.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32 + }, + { + "type": "title", + "bbox": [ + 107, + 695, + 168, + 708 + ], + "lines": [ + { + "bbox": [ + 105, + 694, + 170, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 170, + 710 + ], + "score": 1.0, + "content": "E PROOFS", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 105, + 720, + 468, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 718, + 469, + 734 + ], + "spans": [ + { + "bbox": [ + 104, + 718, + 190, + 734 + ], + "score": 1.0, + "content": "Note that we require", + "type": "text" + }, + { + "bbox": [ + 191, + 721, + 199, + 730 + ], + "score": 0.73, + "content": "\\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 718, + 418, + 734 + ], + "score": 1.0, + "content": "to be a compact set. To simplify the proof, we assume", + "type": "text" + }, + { + "bbox": [ + 418, + 720, + 464, + 732 + ], + "score": 0.93, + "content": "\\mathbb { X } = [ 0 , 1 ] ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 718, + 469, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36 + } + ], + "page_idx": 12, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "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" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 106, + 81, + 361, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 362, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 362, + 95 + ], + "score": 1.0, + "content": "D TESTING THE AVERAGE TREATMENT EFFECTS", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "title", + "bbox": [ + 107, + 106, + 207, + 118 + ], + "lines": [ + { + "bbox": [ + 106, + 106, + 208, + 118 + ], + "spans": [ + { + "bbox": [ + 106, + 106, + 208, + 118 + ], + "score": 1.0, + "content": "D.1 THE ALGORITHM", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 108, + 126, + 290, + 138 + ], + "lines": [ + { + "bbox": [ + 106, + 125, + 291, + 140 + ], + "spans": [ + { + "bbox": [ + 106, + 125, + 291, + 140 + ], + "score": 1.0, + "content": "We focus on testing the following hypothesis,", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 125, + 291, + 140 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 176, + 144, + 413, + 158 + ], + "lines": [ + { + "bbox": [ + 176, + 144, + 413, + 158 + ], + "spans": [ + { + "bbox": [ + 176, + 144, + 413, + 158 + ], + "score": 0.86, + "content": "H _ { 0 } : { \\mathrm { E } } Y _ { i } ^ { * } ( 1 ) \\leq { \\mathrm { E } } Y _ { i } ^ { * } ( 0 ) { \\mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \\mathrm { E } } Y _ { i } ^ { * } ( 1 ) > { \\mathrm { E } } Y _ { i } ^ { * } ( 0 ) .", + "type": "interline_equation", + "image_path": "cd2d5b140d865ccb4ec9daf6fd35f1e2fe3068f80c03443af72c60966d2eeb85.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 176, + 144, + 413, + 158 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 162, + 263, + 174 + ], + "lines": [ + { + "bbox": [ + 106, + 162, + 263, + 175 + ], + "spans": [ + { + "bbox": [ + 106, + 162, + 263, + 175 + ], + "score": 1.0, + "content": "Under (A1) and (A2), it suffices to test", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 106, + 162, + 263, + 175 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 153, + 180, + 437, + 193 + ], + "lines": [ + { + "bbox": [ + 153, + 180, + 437, + 193 + ], + "spans": [ + { + "bbox": [ + 153, + 180, + 437, + 193 + ], + "score": 0.83, + "content": "H _ { 0 } : { \\mathrm { E } } Q ( X _ { i } , 1 ) \\leq { \\mathrm { E } } Q ( X _ { i } , 0 ) { \\mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \\mathrm { E } } Q ( X _ { i } , 1 ) > { \\mathrm { E } } Q ( X _ { i } , 0 ) .", + "type": "interline_equation", + "image_path": "98de986d12bede2b34cc5b2d8ff73e7d6a523890d25d368bf55e9510da81abcb.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 153, + 180, + 437, + 193 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 199, + 506, + 222 + ], + "lines": [ + { + "bbox": [ + 106, + 198, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 106, + 198, + 505, + 211 + ], + "score": 1.0, + "content": "We similarly use basis approximations to model the Q-function. Our proposal is summarized in the", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 210, + 441, + 223 + ], + "spans": [ + { + "bbox": [ + 106, + 210, + 441, + 223 + ], + "score": 1.0, + "content": "following algorithm. We next conduct simulation studies to evaluate this algorithm.", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 6.5, + "bbox_fs": [ + 106, + 198, + 505, + 223 + ] + }, + { + "type": "text", + "bbox": [ + 116, + 234, + 395, + 246 + ], + "lines": [ + { + "bbox": [ + 115, + 231, + 393, + 250 + ], + "spans": [ + { + "bbox": [ + 115, + 231, + 267, + 250 + ], + "score": 1.0, + "content": "Input: Number of bootstrap samples", + "type": "text" + }, + { + "bbox": [ + 267, + 235, + 276, + 244 + ], + "score": 0.82, + "content": "B", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 231, + 291, + 250 + ], + "score": 1.0, + "content": ", an", + "type": "text" + }, + { + "bbox": [ + 292, + 237, + 299, + 244 + ], + "score": 0.77, + "content": "\\alpha", + "type": "inline_equation" + }, + { + "bbox": [ + 300, + 231, + 375, + 250 + ], + "score": 1.0, + "content": "spending function", + "type": "text" + }, + { + "bbox": [ + 375, + 234, + 393, + 246 + ], + "score": 0.9, + "content": "\\alpha ( \\cdot )", + "type": "inline_equation" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 115, + 231, + 393, + 250 + ] + }, + { + "type": "list", + "bbox": [ + 116, + 246, + 490, + 279 + ], + "lines": [ + { + "bbox": [ + 115, + 245, + 489, + 261 + ], + "spans": [ + { + "bbox": [ + 115, + 245, + 163, + 261 + ], + "score": 1.0, + "content": "Initialize:", + "type": "text" + }, + { + "bbox": [ + 163, + 246, + 189, + 258 + ], + "score": 0.76, + "content": "n = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 189, + 245, + 193, + 261 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 193, + 245, + 266, + 260 + ], + "score": 0.79, + "content": "\\widehat { \\Sigma } _ { 0 } = \\widehat { \\Sigma } _ { 1 } = O _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 245, + 270, + 261 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 270, + 246, + 337, + 260 + ], + "score": 0.69, + "content": "\\widehat { \\gamma } _ { 0 } = \\widehat { \\gamma } _ { 1 } = 0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 245, + 340, + 261 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 340, + 246, + 420, + 260 + ], + "score": 0.81, + "content": "\\widehat { \\beta } _ { 0 , b } = \\widehat { \\beta } _ { 1 , b } = 0 _ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 245, + 423, + 261 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 424, + 248, + 450, + 259 + ], + "score": 0.72, + "content": "\\bar { \\varphi } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 245, + 489, + 261 + ], + "score": 1.0, + "content": "and a set", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 117, + 258, + 186, + 271 + ], + "spans": [ + { + "bbox": [ + 117, + 259, + 182, + 271 + ], + "score": 0.91, + "content": "\\mathcal { T } = \\{ 1 , \\ldots , B \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 258, + 186, + 270 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 10, + "is_list_end_line": true + }, + { + "bbox": [ + 116, + 269, + 195, + 281 + ], + "spans": [ + { + "bbox": [ + 116, + 269, + 134, + 281 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 134, + 271, + 159, + 280 + ], + "score": 0.86, + "content": "k = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 269, + 171, + 281 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 171, + 271, + 181, + 279 + ], + "score": 0.8, + "content": "K", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 269, + 195, + 281 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 11, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 10, + "bbox_fs": [ + 115, + 245, + 489, + 281 + ] + }, + { + "type": "text", + "bbox": [ + 126, + 280, + 322, + 293 + ], + "lines": [ + { + "bbox": [ + 125, + 275, + 319, + 297 + ], + "spans": [ + { + "bbox": [ + 125, + 275, + 170, + 297 + ], + "score": 1.0, + "content": "Initialize:", + "type": "text" + }, + { + "bbox": [ + 171, + 281, + 199, + 291 + ], + "score": 0.81, + "content": "m = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 275, + 202, + 297 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 202, + 279, + 228, + 292 + ], + "score": 0.75, + "content": "\\widehat { \\phi } = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 228, + 275, + 246, + 297 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 246, + 278, + 319, + 293 + ], + "score": 0.92, + "content": "\\widehat { \\Phi } _ { 0 } = \\widehat { \\Phi } _ { 1 } = O _ { p + 1 }", + "type": "inline_equation" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 125, + 275, + 319, + 297 + ] + }, + { + "type": "text", + "bbox": [ + 126, + 302, + 267, + 314 + ], + "lines": [ + { + "bbox": [ + 125, + 301, + 267, + 316 + ], + "spans": [ + { + "bbox": [ + 125, + 301, + 144, + 316 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 145, + 303, + 215, + 315 + ], + "score": 0.9, + "content": "i = N ( t _ { k - 1 } ) + 1", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 301, + 226, + 316 + ], + "score": 1.0, + "content": "to", + "type": "text" + }, + { + "bbox": [ + 226, + 303, + 253, + 315 + ], + "score": 0.89, + "content": "N ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 301, + 267, + 316 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 125, + 301, + 267, + 316 + ] + }, + { + "type": "text", + "bbox": [ + 126, + 351, + 376, + 363 + ], + "lines": [ + { + "bbox": [ + 126, + 348, + 377, + 366 + ], + "spans": [ + { + "bbox": [ + 126, + 348, + 168, + 366 + ], + "score": 1.0, + "content": "bCompute", + "type": "text" + }, + { + "bbox": [ + 169, + 349, + 221, + 363 + ], + "score": 0.92, + "content": "\\widehat { \\beta } _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\widehat { \\gamma } _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 348, + 236, + 366 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 236, + 351, + 279, + 363 + ], + "score": 0.92, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 348, + 298, + 366 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 298, + 349, + 372, + 363 + ], + "score": 0.91, + "content": "S = \\bar { \\varphi } ^ { \\top } ( \\widehat { \\beta } _ { 1 } - \\widehat { \\beta } _ { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 348, + 377, + 366 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 126, + 348, + 377, + 366 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 136, + 398, + 442, + 412 + ], + "lines": [], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 136, + 398, + 442, + 412 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 126, + 411, + 213, + 421 + ], + "lines": [ + { + "bbox": [ + 126, + 409, + 213, + 423 + ], + "spans": [ + { + "bbox": [ + 126, + 409, + 144, + 423 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 145, + 411, + 198, + 422 + ], + "score": 0.86, + "content": "b = 1 , \\dots , B", + "type": "inline_equation" + }, + { + "bbox": [ + 199, + 409, + 213, + 423 + ], + "score": 1.0, + "content": "do", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 126, + 409, + 213, + 423 + ] + }, + { + "type": "list", + "bbox": [ + 133, + 422, + 501, + 462 + ], + "lines": [ + { + "bbox": [ + 135, + 419, + 501, + 435 + ], + "spans": [ + { + "bbox": [ + 135, + 419, + 243, + 435 + ], + "score": 1.0, + "content": "Generate two independent", + "type": "text" + }, + { + "bbox": [ + 244, + 421, + 290, + 434 + ], + "score": 0.91, + "content": "N ( 0 , I _ { p + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 419, + 389, + 435 + ], + "score": 1.0, + "content": "Gaussian vectors e0, e1,", + "type": "text" + }, + { + "bbox": [ + 389, + 421, + 422, + 434 + ], + "score": 0.55, + "content": "N ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 422, + 419, + 490, + 435 + ], + "score": 1.0, + "content": "random variable", + "type": "text" + }, + { + "bbox": [ + 490, + 423, + 501, + 433 + ], + "score": 0.85, + "content": "e _ { 2 }", + "type": "inline_equation" + } + ], + "index": 17 + }, + { + "bbox": [ + 136, + 428, + 394, + 452 + ], + "spans": [ + { + "bbox": [ + 136, + 433, + 386, + 447 + ], + "score": 0.91, + "content": "\\widehat { \\beta } _ { a , b } = ( 1 - m n ^ { - 1 } ) \\widehat { \\beta } _ { a , b } + n ^ { - 1 } \\widehat { \\Phi } _ { a } ^ { 1 / 2 } e _ { a } + n ^ { - 1 } \\widehat { \\phi } ^ { 1 / 2 } e _ { 2 } , a = 0 , 1", + "type": "inline_equation" + }, + { + "bbox": [ + 387, + 428, + 394, + 452 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 18, + "is_list_end_line": true + }, + { + "bbox": [ + 135, + 445, + 273, + 464 + ], + "spans": [ + { + "bbox": [ + 135, + 445, + 178, + 464 + ], + "score": 1.0, + "content": "Compute", + "type": "text" + }, + { + "bbox": [ + 178, + 448, + 267, + 462 + ], + "score": 0.92, + "content": "\\widehat { S } _ { b } = \\bar { \\varphi } ^ { \\top } ( \\widehat { \\beta } _ { 1 , b } - \\widehat { \\beta } _ { 0 , b } )", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 445, + 273, + 464 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 19, + "is_list_start_line": true, + "is_list_end_line": true + }, + { + "bbox": [ + 125, + 469, + 448, + 485 + ], + "spans": [ + { + "bbox": [ + 125, + 469, + 141, + 485 + ], + "score": 1.0, + "content": "Set", + "type": "text" + }, + { + "bbox": [ + 142, + 473, + 148, + 481 + ], + "score": 0.79, + "content": "z", + "type": "inline_equation" + }, + { + "bbox": [ + 149, + 469, + 212, + 485 + ], + "score": 1.0, + "content": "to be the upper", + "type": "text" + }, + { + "bbox": [ + 212, + 471, + 343, + 483 + ], + "score": 0.91, + "content": "\\{ \\alpha ( t ) - | \\mathcal { T } | ^ { c } / B | \\} / ( 1 - | \\mathcal { T } ^ { c } | / B )", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 469, + 408, + 485 + ], + "score": 1.0, + "content": "-th percentile of", + "type": "text" + }, + { + "bbox": [ + 408, + 469, + 443, + 483 + ], + "score": 0.93, + "content": "\\{ \\widehat { S } _ { b } \\} _ { b \\in \\mathbb { Z } }", + "type": "inline_equation" + }, + { + "bbox": [ + 443, + 469, + 448, + 485 + ], + "score": 1.0, + "content": ";", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 125, + 483, + 273, + 498 + ], + "spans": [ + { + "bbox": [ + 125, + 483, + 157, + 498 + ], + "score": 1.0, + "content": "Update", + "type": "text" + }, + { + "bbox": [ + 158, + 485, + 165, + 495 + ], + "score": 0.82, + "content": "\\mathcal { T }", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 483, + 177, + 498 + ], + "score": 1.0, + "content": "as", + "type": "text" + }, + { + "bbox": [ + 177, + 483, + 269, + 497 + ], + "score": 0.9, + "content": "{ \\mathcal { T } } \\{ b \\in { \\mathcal { T } } : { \\widehat { S } } _ { b } \\leq z \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 269, + 483, + 273, + 498 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 21, + "is_list_end_line": true + }, + { + "bbox": [ + 126, + 494, + 167, + 508 + ], + "spans": [ + { + "bbox": [ + 126, + 494, + 136, + 508 + ], + "score": 1.0, + "content": "If", + "type": "text" + }, + { + "bbox": [ + 136, + 496, + 162, + 506 + ], + "score": 0.9, + "content": "S > z", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 494, + 167, + 508 + ], + "score": 1.0, + "content": ":", + "type": "text" + } + ], + "index": 22, + "is_list_start_line": true, + "is_list_end_line": true + } + ], + "index": 18, + "bbox_fs": [ + 135, + 419, + 501, + 464 + ] + }, + { + "type": "list", + "bbox": [ + 126, + 470, + 447, + 506 + ], + "lines": [], + "index": 21, + "bbox_fs": [ + 125, + 469, + 448, + 508 + ], + "lines_deleted": true + }, + { + "type": "text", + "bbox": [ + 137, + 507, + 300, + 518 + ], + "lines": [ + { + "bbox": [ + 136, + 505, + 301, + 520 + ], + "spans": [ + { + "bbox": [ + 136, + 505, + 164, + 520 + ], + "score": 1.0, + "content": "Reject", + "type": "text" + }, + { + "bbox": [ + 164, + 507, + 178, + 518 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 505, + 301, + 520 + ], + "score": 1.0, + "content": "and terminate the experiment;", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 136, + 505, + 301, + 520 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 542, + 226, + 554 + ], + "lines": [ + { + "bbox": [ + 106, + 541, + 227, + 555 + ], + "spans": [ + { + "bbox": [ + 106, + 541, + 227, + 555 + ], + "score": 1.0, + "content": "D.2 NUMERICAL STUDIES", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 563, + 505, + 619 + ], + "lines": [ + { + "bbox": [ + 105, + 563, + 505, + 576 + ], + "spans": [ + { + "bbox": [ + 105, + 563, + 505, + 576 + ], + "score": 1.0, + "content": "In this section, we compare our procedure with the always valid test for testing ATE (Johari et al.,", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 573, + 505, + 587 + ], + "spans": [ + { + "bbox": [ + 105, + 573, + 417, + 587 + ], + "score": 1.0, + "content": "2015). We generate the potential outcomes with the same model, except that", + "type": "text" + }, + { + "bbox": [ + 418, + 576, + 427, + 585 + ], + "score": 0.82, + "content": "\\varepsilon _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 428, + 573, + 469, + 587 + ], + "score": 1.0, + "content": "’s are i.i.d", + "type": "text" + }, + { + "bbox": [ + 469, + 574, + 501, + 586 + ], + "score": 0.91, + "content": "N ( 0 , 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 573, + 505, + 587 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 105, + 585, + 505, + 598 + ], + "spans": [ + { + "bbox": [ + 105, + 585, + 176, + 598 + ], + "score": 1.0, + "content": "However, we set", + "type": "text" + }, + { + "bbox": [ + 177, + 585, + 240, + 597 + ], + "score": 0.92, + "content": "N ( T _ { 1 } ) \\stackrel { - } { = } 1 0 0 0", + "type": "inline_equation" + }, + { + "bbox": [ + 240, + 585, + 259, + 598 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 259, + 585, + 363, + 597 + ], + "score": 0.92, + "content": "N ( T _ { j } ) - N ( T _ { j - 1 } ) = 2 n", + "type": "inline_equation" + }, + { + "bbox": [ + 364, + 585, + 380, + 598 + ], + "score": 1.0, + "content": "for", + "type": "text" + }, + { + "bbox": [ + 380, + 586, + 431, + 596 + ], + "score": 0.91, + "content": "2 \\leq j \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 585, + 473, + 598 + ], + "score": 1.0, + "content": "and some", + "type": "text" + }, + { + "bbox": [ + 474, + 586, + 501, + 595 + ], + "score": 0.88, + "content": "n > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 585, + 505, + 598 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 595, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 595, + 244, + 610 + ], + "score": 1.0, + "content": "We consider two combinations of", + "type": "text" + }, + { + "bbox": [ + 244, + 597, + 271, + 608 + ], + "score": 0.92, + "content": "( n , K )", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 595, + 346, + 610 + ], + "score": 1.0, + "content": ", corresponding to", + "type": "text" + }, + { + "bbox": [ + 346, + 596, + 419, + 608 + ], + "score": 0.92, + "content": "( n , K ) = ( 1 0 0 , 5 )", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 595, + 505, + 610 + ], + "score": 1.0, + "content": "and (10, 50). For all", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 607, + 315, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 302, + 621 + ], + "score": 1.0, + "content": "settings, we use a linear function to approximate", + "type": "text" + }, + { + "bbox": [ + 302, + 608, + 311, + 618 + ], + "score": 0.86, + "content": "Q", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 607, + 315, + 621 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 27, + "bbox_fs": [ + 105, + 563, + 505, + 621 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 623, + 505, + 680 + ], + "lines": [ + { + "bbox": [ + 105, + 622, + 505, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 622, + 505, + 637 + ], + "score": 1.0, + "content": "In Table 2 (see Appendix G) and Figure 4, we show the rejection probabilities and average stopping", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 634, + 505, + 649 + ], + "spans": [ + { + "bbox": [ + 105, + 634, + 375, + 649 + ], + "score": 1.0, + "content": "times of the proposed test aggregated over 400 simulations, when", + "type": "text" + }, + { + "bbox": [ + 375, + 635, + 398, + 647 + ], + "score": 0.92, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 634, + 505, + 649 + ], + "score": 1.0, + "content": "is chosen as the spending", + "type": "text" + } + ], + "index": 31 + }, + { + "bbox": [ + 105, + 645, + 506, + 659 + ], + "spans": [ + { + "bbox": [ + 105, + 645, + 506, + 659 + ], + "score": 1.0, + "content": "function. It can be seen that our method behaves better than the always valid test when the effect", + "type": "text" + } + ], + "index": 32 + }, + { + "bbox": [ + 105, + 656, + 506, + 670 + ], + "spans": [ + { + "bbox": [ + 105, + 656, + 506, + 670 + ], + "score": 1.0, + "content": "size is small, and comparable when the effect size is large. The always valid test fails in the adaptive", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 668, + 467, + 680 + ], + "spans": [ + { + "bbox": [ + 105, + 668, + 341, + 680 + ], + "score": 1.0, + "content": "randomization settings, as the type-I error rates are around", + "type": "text" + }, + { + "bbox": [ + 342, + 668, + 361, + 678 + ], + "score": 0.87, + "content": "50 \\%", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 668, + 467, + 680 + ], + "score": 1.0, + "content": "under the null hypothesis.", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 622, + 506, + 680 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 695, + 168, + 708 + ], + "lines": [ + { + "bbox": [ + 105, + 694, + 170, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 694, + 170, + 710 + ], + "score": 1.0, + "content": "E PROOFS", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "text", + "bbox": [ + 105, + 720, + 468, + 732 + ], + "lines": [ + { + "bbox": [ + 104, + 718, + 469, + 734 + ], + "spans": [ + { + "bbox": [ + 104, + 718, + 190, + 734 + ], + "score": 1.0, + "content": "Note that we require", + "type": "text" + }, + { + "bbox": [ + 191, + 721, + 199, + 730 + ], + "score": 0.73, + "content": "\\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 200, + 718, + 418, + 734 + ], + "score": 1.0, + "content": "to be a compact set. To simplify the proof, we assume", + "type": "text" + }, + { + "bbox": [ + 418, + 720, + 464, + 732 + ], + "score": 0.93, + "content": "\\mathbb { X } = [ 0 , 1 ] ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 718, + 469, + 734 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 36, + "bbox_fs": [ + 104, + 718, + 469, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "image", + "bbox": [ + 107, + 81, + 504, + 260 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 81, + 504, + 260 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 81, + 504, + 260 + ], + "spans": [ + { + "bbox": [ + 107, + 81, + 504, + 260 + ], + "score": 0.969, + "type": "image", + "image_path": "190f52fa2835cb10c09afb066ce68d7c745ed90ba954fd3930ae64a0529ced2e.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 81, + 504, + 140.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 140.66666666666666, + 504, + 200.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 200.33333333333331, + 504, + 260.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 267, + 505, + 290 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 267, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 470, + 281 + ], + "score": 1.0, + "content": "Figure 4: Rejection probabilities and average stopping times of the proposed test when", + "type": "text" + }, + { + "bbox": [ + 471, + 268, + 493, + 280 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 267, + 506, + 281 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 279, + 239, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 239, + 291 + ], + "score": 1.0, + "content": "chosen as the spending function.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "title", + "bbox": [ + 107, + 310, + 218, + 321 + ], + "lines": [ + { + "bbox": [ + 105, + 310, + 219, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 219, + 323 + ], + "score": 1.0, + "content": "E.1 PROOF OF LEMMA 1", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 330, + 381, + 343 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 383, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 122, + 345 + ], + "score": 1.0, + "content": "Set", + "type": "text" + }, + { + "bbox": [ + 122, + 331, + 153, + 342 + ], + "score": 0.91, + "content": "\\mathcal { F } _ { 0 } = \\emptyset", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 329, + 383, + 345 + ], + "score": 1.0, + "content": ". We state the following lemma before proving Lemma 1.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "text", + "bbox": [ + 106, + 350, + 333, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 348, + 331, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 185, + 368 + ], + "score": 1.0, + "content": "Lemma 3 For any", + "type": "text" + }, + { + "bbox": [ + 185, + 352, + 209, + 363 + ], + "score": 0.5, + "content": "j \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 351, + 331, + 365 + ], + "score": 0.83, + "content": ", ( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp \\mathcal { F } _ { j - 1 } .", + "type": "inline_equation" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 373, + 257, + 386 + ], + "lines": [ + { + "bbox": [ + 105, + 373, + 258, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 139, + 387 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 140, + 374, + 209, + 386 + ], + "score": 0.76, + "content": "a \\in \\{ 0 , 1 \\} , i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 373, + 258, + 387 + ], + "score": 1.0, + "content": ", notice that", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 390, + 433, + 423 + ], + "lines": [ + { + "bbox": [ + 157, + 390, + 433, + 423 + ], + "spans": [ + { + "bbox": [ + 157, + 390, + 433, + 423 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathrm { E I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} = \\mathrm { E I } ( A _ { i } = a ) \\{ Y _ { i } ^ { \\ast } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} } \\\\ { = \\mathrm { E E } ^ { X _ { i } , F _ { i - 1 } } [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } ^ { \\ast } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] , } \\end{array}", + "type": "interline_equation", + "image_path": "730e082aa5bcd7ccd7ef1a389e2354703f0f25ee81cfbe8c4b5669672572797b.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 157, + 390, + 433, + 401.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 157, + 401.0, + 433, + 412.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 157, + 412.0, + 433, + 423.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 426, + 507, + 450 + ], + "lines": [ + { + "bbox": [ + 104, + 423, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 104, + 423, + 324, + 442 + ], + "score": 1.0, + "content": "where the first equation is due to Assumption (A1) and", + "type": "text" + }, + { + "bbox": [ + 325, + 426, + 361, + 437 + ], + "score": 0.89, + "content": "\\mathrm { E } ^ { X _ { i } , \\mathcal { F } _ { i - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 423, + 506, + 442 + ], + "score": 1.0, + "content": "denotes the conditional expectation", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 438, + 312, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 131, + 451 + ], + "score": 1.0, + "content": "given", + "type": "text" + }, + { + "bbox": [ + 131, + 439, + 152, + 450 + ], + "score": 0.91, + "content": "\\mathcal { F } _ { i - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 438, + 171, + 451 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 171, + 439, + 183, + 449 + ], + "score": 0.89, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 438, + 312, + 451 + ], + "score": 1.0, + "content": ". By Assumption (A2), we have", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 454, + 514, + 470 + ], + "lines": [ + { + "bbox": [ + 111, + 454, + 514, + 470 + ], + "spans": [ + { + "bbox": [ + 111, + 454, + 514, + 470 + ], + "score": 0.85, + "content": "{ } _ { \\mathfrak { X } ^ { \\lambda _ { i } , F _ { i - 1 } } [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] } = \\{ \\mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \\mathbb { I } ( A _ { i } = a ) \\} [ \\mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ]", + "type": "interline_equation", + "image_path": "677db7c669ac5bb198a0f6cd4e41da9bafa76cfe6ddaad6407a4095eb4c7afcb.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 111, + 454, + 514, + 470 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 510, + 497 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 506, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 488 + ], + "score": 1.0, + "content": "The second term on the RHS equals zero due to Lemma 3 and our model assumption", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 484, + 348, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 220, + 497 + ], + "score": 0.91, + "content": "\\operatorname { E } \\{ Y _ { i } ^ { * } ( a ) | X _ { i } \\} = \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 484, + 348, + 499 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5 + }, + { + "type": "title", + "bbox": [ + 107, + 509, + 229, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 230, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 230, + 523 + ], + "score": 1.0, + "content": "E.2 PROOF OF THEOREM 1", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 530, + 506, + 564 + ], + "lines": [ + { + "bbox": [ + 106, + 530, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 530, + 122, + 543 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 531, + 140, + 543 + ], + "score": 0.9, + "content": "n ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 530, + 311, + 543 + ], + "score": 1.0, + "content": "be the realization of the counting process", + "type": "text" + }, + { + "bbox": [ + 311, + 531, + 331, + 542 + ], + "score": 0.89, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 530, + 505, + 543 + ], + "score": 1.0, + "content": ". We will show the assertion in Theorem 1", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 541, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 278, + 554 + ], + "score": 1.0, + "content": "holds for any such realizations that satisfy", + "type": "text" + }, + { + "bbox": [ + 278, + 542, + 401, + 554 + ], + "score": 0.92, + "content": "n ( t _ { 1 } ) < n ( t _ { 2 } ) < \\cdot \\cdot \\cdot < n ( t _ { K } )", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 541, + 506, + 554 + ], + "score": 1.0, + "content": ". The case where some of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 552, + 314, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 121, + 565 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 122, + 553, + 145, + 565 + ], + "score": 0.92, + "content": "n ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 552, + 314, + 565 + ], + "score": 1.0, + "content": "’s are the same can be similarly discussed.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 105, + 569, + 460, + 582 + ], + "lines": [ + { + "bbox": [ + 105, + 569, + 460, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 140, + 583 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 140, + 570, + 163, + 581 + ], + "score": 0.89, + "content": "j \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 569, + 194, + 583 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 194, + 569, + 220, + 582 + ], + "score": 0.92, + "content": "\\sigma ( \\mathcal { F } _ { j } )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 569, + 258, + 583 + ], + "score": 1.0, + "content": "to be the", + "type": "text" + }, + { + "bbox": [ + 259, + 572, + 266, + 579 + ], + "score": 0.78, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 569, + 353, + 583 + ], + "score": 1.0, + "content": "-algebra generated by", + "type": "text" + }, + { + "bbox": [ + 354, + 570, + 366, + 582 + ], + "score": 0.88, + "content": "{ \\mathcal { F } } _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 569, + 386, + 583 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 387, + 569, + 429, + 582 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 569, + 460, + 583 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 587, + 473, + 622 + ], + "lines": [ + { + "bbox": [ + 118, + 587, + 473, + 622 + ], + "spans": [ + { + "bbox": [ + 118, + 587, + 473, + 622 + ], + "score": 0.92, + "content": "\\widehat { \\Sigma } _ { a , j } = \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\ \\mathrm { ~ a n d ~ } \\widehat { \\beta } _ { a , j } = \\widehat { \\Sigma } _ { a , j } ^ { - 1 } \\left( \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\right) .", + "type": "interline_equation", + "image_path": "678e7b08efa7470f9b2f2800f0d96ad6c5f215135bf4ebd3f8fde5b9cef4fcee.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 118, + 587, + 473, + 598.6666666666666 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 118, + 598.6666666666666, + 473, + 610.3333333333333 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 118, + 610.3333333333333, + 473, + 621.9999999999999 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 626, + 505, + 652 + ], + "lines": [ + { + "bbox": [ + 103, + 623, + 507, + 645 + ], + "spans": [ + { + "bbox": [ + 103, + 623, + 214, + 645 + ], + "score": 1.0, + "content": "It is immediate to see that", + "type": "text" + }, + { + "bbox": [ + 214, + 626, + 281, + 641 + ], + "score": 0.94, + "content": "\\widehat { \\Sigma } _ { a } ( t ) = \\widehat { \\Sigma } _ { a , n ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 623, + 300, + 645 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 301, + 626, + 365, + 642 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a } ( t ) = \\widehat { \\beta } _ { a , n ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 623, + 399, + 645 + ], + "score": 1.0, + "content": ". Define", + "type": "text" + }, + { + "bbox": [ + 400, + 628, + 484, + 640 + ], + "score": 0.92, + "content": "\\delta _ { n } = q n ^ { - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } n", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 623, + 507, + 645 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 638, + 327, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 327, + 652 + ], + "score": 1.0, + "content": "state the following lemmas before proving Theorem 1.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 106, + 660, + 505, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 658, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 271, + 675 + ], + "score": 1.0, + "content": "Lemma 4 There exists some constant", + "type": "text" + }, + { + "bbox": [ + 271, + 662, + 336, + 672 + ], + "score": 0.87, + "content": "0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 658, + 384, + 675 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 384, + 660, + 502, + 673 + ], + "score": 0.88, + "content": "\\lambda _ { \\operatorname* { m i n } } [ E \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] ~ \\geq ~ \\epsilon _ { 0 } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 658, + 505, + 675 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 112, + 673, + 499, + 686 + ], + "spans": [ + { + "bbox": [ + 112, + 673, + 499, + 686 + ], + "score": 0.48, + "content": "\\begin{array} { r } { \\operatorname* { m a x } [ E \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\leq \\epsilon _ { 0 } ^ { - 1 } , \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 2 } \\leq \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } , \\operatorname* { m i n } _ { a \\in \\{ 0 , 1 \\} } \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\geqslant \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 103, + 680, + 504, + 704 + ], + "spans": [ + { + "bbox": [ + 103, + 680, + 118, + 704 + ], + "score": 1.0, + "content": "\u000f0,", + "type": "text" + }, + { + "bbox": [ + 118, + 687, + 223, + 700 + ], + "score": 0.54, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\beta _ { a } \\| _ { 2 } \\leq \\epsilon _ { 0 } ^ { - 1 } , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 680, + 226, + 704 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 227, + 686, + 335, + 700 + ], + "score": 0.61, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | Y ^ { * } ( a ) | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 680, + 355, + 704 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 355, + 687, + 497, + 700 + ], + "score": 0.66, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | \\varphi ^ { \\top } ( x ) \\beta _ { a } | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 680, + 504, + 704 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "text", + "bbox": [ + 104, + 709, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 295, + 722 + ], + "score": 1.0, + "content": "Lemma 5 Assume the conditions in Theorem", + "type": "text" + }, + { + "bbox": [ + 295, + 711, + 301, + 720 + ], + "score": 0.38, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 708, + 424, + 722 + ], + "score": 1.0, + "content": "hold. Then for any sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 710, + 450, + 722 + ], + "score": 0.92, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 718, + 507, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 194, + 733 + ], + "score": 0.92, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } ( j _ { n } ) \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 718, + 334, + 734 + ], + "score": 1.0, + "content": ", we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 335, + 721, + 389, + 732 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - \\alpha _ { 0 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 718, + 441, + 734 + ], + "score": 1.0, + "content": "that for any", + "type": "text" + }, + { + "bbox": [ + 442, + 721, + 486, + 732 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 718, + 507, + 734 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5 + } + ], + "page_idx": 13, + "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": "14", + "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": [ + 107, + 81, + 504, + 260 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 107, + 81, + 504, + 260 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 107, + 81, + 504, + 260 + ], + "spans": [ + { + "bbox": [ + 107, + 81, + 504, + 260 + ], + "score": 0.969, + "type": "image", + "image_path": "190f52fa2835cb10c09afb066ce68d7c745ed90ba954fd3930ae64a0529ced2e.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 107, + 81, + 504, + 140.66666666666666 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 107, + 140.66666666666666, + 504, + 200.33333333333331 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 107, + 200.33333333333331, + 504, + 260.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 106, + 267, + 505, + 290 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 267, + 506, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 267, + 470, + 281 + ], + "score": 1.0, + "content": "Figure 4: Rejection probabilities and average stopping times of the proposed test when", + "type": "text" + }, + { + "bbox": [ + 471, + 268, + 493, + 280 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 494, + 267, + 506, + 281 + ], + "score": 1.0, + "content": "is", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 279, + 239, + 291 + ], + "spans": [ + { + "bbox": [ + 106, + 279, + 239, + 291 + ], + "score": 1.0, + "content": "chosen as the spending function.", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 3.5 + } + ], + "index": 2.25 + }, + { + "type": "title", + "bbox": [ + 107, + 310, + 218, + 321 + ], + "lines": [ + { + "bbox": [ + 105, + 310, + 219, + 323 + ], + "spans": [ + { + "bbox": [ + 105, + 310, + 219, + 323 + ], + "score": 1.0, + "content": "E.1 PROOF OF LEMMA 1", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 106, + 330, + 381, + 343 + ], + "lines": [ + { + "bbox": [ + 105, + 329, + 383, + 345 + ], + "spans": [ + { + "bbox": [ + 105, + 329, + 122, + 345 + ], + "score": 1.0, + "content": "Set", + "type": "text" + }, + { + "bbox": [ + 122, + 331, + 153, + 342 + ], + "score": 0.91, + "content": "\\mathcal { F } _ { 0 } = \\emptyset", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 329, + 383, + 345 + ], + "score": 1.0, + "content": ". We state the following lemma before proving Lemma 1.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 105, + 329, + 383, + 345 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 350, + 333, + 365 + ], + "lines": [ + { + "bbox": [ + 105, + 348, + 331, + 368 + ], + "spans": [ + { + "bbox": [ + 105, + 348, + 185, + 368 + ], + "score": 1.0, + "content": "Lemma 3 For any", + "type": "text" + }, + { + "bbox": [ + 185, + 352, + 209, + 363 + ], + "score": 0.5, + "content": "j \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 351, + 331, + 365 + ], + "score": 0.83, + "content": ", ( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp \\mathcal { F } _ { j - 1 } .", + "type": "inline_equation" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 348, + 331, + 368 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 373, + 257, + 386 + ], + "lines": [ + { + "bbox": [ + 105, + 373, + 258, + 387 + ], + "spans": [ + { + "bbox": [ + 105, + 373, + 139, + 387 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 140, + 374, + 209, + 386 + ], + "score": 0.76, + "content": "a \\in \\{ 0 , 1 \\} , i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 373, + 258, + 387 + ], + "score": 1.0, + "content": ", notice that", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 373, + 258, + 387 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 390, + 433, + 423 + ], + "lines": [ + { + "bbox": [ + 157, + 390, + 433, + 423 + ], + "spans": [ + { + "bbox": [ + 157, + 390, + 433, + 423 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathrm { E I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} = \\mathrm { E I } ( A _ { i } = a ) \\{ Y _ { i } ^ { \\ast } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} } \\\\ { = \\mathrm { E E } ^ { X _ { i } , F _ { i - 1 } } [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } ^ { \\ast } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] , } \\end{array}", + "type": "interline_equation", + "image_path": "730e082aa5bcd7ccd7ef1a389e2354703f0f25ee81cfbe8c4b5669672572797b.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 157, + 390, + 433, + 401.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 157, + 401.0, + 433, + 412.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 157, + 412.0, + 433, + 423.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 426, + 507, + 450 + ], + "lines": [ + { + "bbox": [ + 104, + 423, + 506, + 442 + ], + "spans": [ + { + "bbox": [ + 104, + 423, + 324, + 442 + ], + "score": 1.0, + "content": "where the first equation is due to Assumption (A1) and", + "type": "text" + }, + { + "bbox": [ + 325, + 426, + 361, + 437 + ], + "score": 0.89, + "content": "\\mathrm { E } ^ { X _ { i } , \\mathcal { F } _ { i - 1 } }", + "type": "inline_equation" + }, + { + "bbox": [ + 362, + 423, + 506, + 442 + ], + "score": 1.0, + "content": "denotes the conditional expectation", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 105, + 438, + 312, + 451 + ], + "spans": [ + { + "bbox": [ + 105, + 438, + 131, + 451 + ], + "score": 1.0, + "content": "given", + "type": "text" + }, + { + "bbox": [ + 131, + 439, + 152, + 450 + ], + "score": 0.91, + "content": "\\mathcal { F } _ { i - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 153, + 438, + 171, + 451 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 171, + 439, + 183, + 449 + ], + "score": 0.89, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 438, + 312, + 451 + ], + "score": 1.0, + "content": ". By Assumption (A2), we have", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 12.5, + "bbox_fs": [ + 104, + 423, + 506, + 451 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 454, + 514, + 470 + ], + "lines": [ + { + "bbox": [ + 111, + 454, + 514, + 470 + ], + "spans": [ + { + "bbox": [ + 111, + 454, + 514, + 470 + ], + "score": 0.85, + "content": "{ } _ { \\mathfrak { X } ^ { \\lambda _ { i } , F _ { i - 1 } } [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] } = \\{ \\mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \\mathbb { I } ( A _ { i } = a ) \\} [ \\mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ]", + "type": "interline_equation", + "image_path": "677db7c669ac5bb198a0f6cd4e41da9bafa76cfe6ddaad6407a4095eb4c7afcb.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 111, + 454, + 514, + 470 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 510, + 497 + ], + "lines": [ + { + "bbox": [ + 105, + 473, + 506, + 488 + ], + "spans": [ + { + "bbox": [ + 105, + 473, + 506, + 488 + ], + "score": 1.0, + "content": "The second term on the RHS equals zero due to Lemma 3 and our model assumption", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 106, + 484, + 348, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 485, + 220, + 497 + ], + "score": 0.91, + "content": "\\operatorname { E } \\{ Y _ { i } ^ { * } ( a ) | X _ { i } \\} = \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a }", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 484, + 348, + 499 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15.5, + "bbox_fs": [ + 105, + 473, + 506, + 499 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 509, + 229, + 522 + ], + "lines": [ + { + "bbox": [ + 106, + 509, + 230, + 523 + ], + "spans": [ + { + "bbox": [ + 106, + 509, + 230, + 523 + ], + "score": 1.0, + "content": "E.2 PROOF OF THEOREM 1", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 530, + 506, + 564 + ], + "lines": [ + { + "bbox": [ + 106, + 530, + 505, + 543 + ], + "spans": [ + { + "bbox": [ + 106, + 530, + 122, + 543 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 531, + 140, + 543 + ], + "score": 0.9, + "content": "n ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 141, + 530, + 311, + 543 + ], + "score": 1.0, + "content": "be the realization of the counting process", + "type": "text" + }, + { + "bbox": [ + 311, + 531, + 331, + 542 + ], + "score": 0.89, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 332, + 530, + 505, + 543 + ], + "score": 1.0, + "content": ". We will show the assertion in Theorem 1", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 105, + 541, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 541, + 278, + 554 + ], + "score": 1.0, + "content": "holds for any such realizations that satisfy", + "type": "text" + }, + { + "bbox": [ + 278, + 542, + 401, + 554 + ], + "score": 0.92, + "content": "n ( t _ { 1 } ) < n ( t _ { 2 } ) < \\cdot \\cdot \\cdot < n ( t _ { K } )", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 541, + 506, + 554 + ], + "score": 1.0, + "content": ". The case where some of", + "type": "text" + } + ], + "index": 19 + }, + { + "bbox": [ + 106, + 552, + 314, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 552, + 121, + 565 + ], + "score": 1.0, + "content": "the", + "type": "text" + }, + { + "bbox": [ + 122, + 553, + 145, + 565 + ], + "score": 0.92, + "content": "n ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 145, + 552, + 314, + 565 + ], + "score": 1.0, + "content": "’s are the same can be similarly discussed.", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 530, + 506, + 565 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 569, + 460, + 582 + ], + "lines": [ + { + "bbox": [ + 105, + 569, + 460, + 583 + ], + "spans": [ + { + "bbox": [ + 105, + 569, + 140, + 583 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 140, + 570, + 163, + 581 + ], + "score": 0.89, + "content": "j \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 569, + 194, + 583 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 194, + 569, + 220, + 582 + ], + "score": 0.92, + "content": "\\sigma ( \\mathcal { F } _ { j } )", + "type": "inline_equation" + }, + { + "bbox": [ + 221, + 569, + 258, + 583 + ], + "score": 1.0, + "content": "to be the", + "type": "text" + }, + { + "bbox": [ + 259, + 572, + 266, + 579 + ], + "score": 0.78, + "content": "\\sigma", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 569, + 353, + 583 + ], + "score": 1.0, + "content": "-algebra generated by", + "type": "text" + }, + { + "bbox": [ + 354, + 570, + 366, + 582 + ], + "score": 0.88, + "content": "{ \\mathcal { F } } _ { j }", + "type": "inline_equation" + }, + { + "bbox": [ + 366, + 569, + 386, + 583 + ], + "score": 1.0, + "content": ". For", + "type": "text" + }, + { + "bbox": [ + 387, + 569, + 429, + 582 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 569, + 460, + 583 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 569, + 460, + 583 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 587, + 473, + 622 + ], + "lines": [ + { + "bbox": [ + 118, + 587, + 473, + 622 + ], + "spans": [ + { + "bbox": [ + 118, + 587, + 473, + 622 + ], + "score": 0.92, + "content": "\\widehat { \\Sigma } _ { a , j } = \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\ \\mathrm { ~ a n d ~ } \\widehat { \\beta } _ { a , j } = \\widehat { \\Sigma } _ { a , j } ^ { - 1 } \\left( \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\right) .", + "type": "interline_equation", + "image_path": "678e7b08efa7470f9b2f2800f0d96ad6c5f215135bf4ebd3f8fde5b9cef4fcee.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 118, + 587, + 473, + 598.6666666666666 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 118, + 598.6666666666666, + 473, + 610.3333333333333 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 118, + 610.3333333333333, + 473, + 621.9999999999999 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 626, + 505, + 652 + ], + "lines": [ + { + "bbox": [ + 103, + 623, + 507, + 645 + ], + "spans": [ + { + "bbox": [ + 103, + 623, + 214, + 645 + ], + "score": 1.0, + "content": "It is immediate to see that", + "type": "text" + }, + { + "bbox": [ + 214, + 626, + 281, + 641 + ], + "score": 0.94, + "content": "\\widehat { \\Sigma } _ { a } ( t ) = \\widehat { \\Sigma } _ { a , n ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 623, + 300, + 645 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 301, + 626, + 365, + 642 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a } ( t ) = \\widehat { \\beta } _ { a , n ( t ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 623, + 399, + 645 + ], + "score": 1.0, + "content": ". Define", + "type": "text" + }, + { + "bbox": [ + 400, + 628, + 484, + 640 + ], + "score": 0.92, + "content": "\\delta _ { n } = q n ^ { - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } n", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 623, + 507, + 645 + ], + "score": 1.0, + "content": ". We", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 105, + 638, + 327, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 638, + 327, + 652 + ], + "score": 1.0, + "content": "state the following lemmas before proving Theorem 1.", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 103, + 623, + 507, + 652 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 660, + 505, + 701 + ], + "lines": [ + { + "bbox": [ + 105, + 658, + 505, + 675 + ], + "spans": [ + { + "bbox": [ + 105, + 658, + 271, + 675 + ], + "score": 1.0, + "content": "Lemma 4 There exists some constant", + "type": "text" + }, + { + "bbox": [ + 271, + 662, + 336, + 672 + ], + "score": 0.87, + "content": "0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 658, + 384, + 675 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 384, + 660, + 502, + 673 + ], + "score": 0.88, + "content": "\\lambda _ { \\operatorname* { m i n } } [ E \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] ~ \\geq ~ \\epsilon _ { 0 } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 658, + 505, + 675 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 112, + 673, + 499, + 686 + ], + "spans": [ + { + "bbox": [ + 112, + 673, + 499, + 686 + ], + "score": 0.48, + "content": "\\begin{array} { r } { \\operatorname* { m a x } [ E \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\leq \\epsilon _ { 0 } ^ { - 1 } , \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 2 } \\leq \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } , \\operatorname* { m i n } _ { a \\in \\{ 0 , 1 \\} } \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\geqslant \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + } + ], + "index": 28 + }, + { + "bbox": [ + 103, + 680, + 504, + 704 + ], + "spans": [ + { + "bbox": [ + 103, + 680, + 118, + 704 + ], + "score": 1.0, + "content": "\u000f0,", + "type": "text" + }, + { + "bbox": [ + 118, + 687, + 223, + 700 + ], + "score": 0.54, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\beta _ { a } \\| _ { 2 } \\leq \\epsilon _ { 0 } ^ { - 1 } , } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 224, + 680, + 226, + 704 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 227, + 686, + 335, + 700 + ], + "score": 0.61, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | Y ^ { * } ( a ) | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 336, + 680, + 355, + 704 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 355, + 687, + 497, + 700 + ], + "score": 0.66, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | \\varphi ^ { \\top } ( x ) \\beta _ { a } | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 680, + 504, + 704 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 103, + 658, + 505, + 704 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 709, + 505, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 708, + 505, + 722 + ], + "spans": [ + { + "bbox": [ + 105, + 708, + 295, + 722 + ], + "score": 1.0, + "content": "Lemma 5 Assume the conditions in Theorem", + "type": "text" + }, + { + "bbox": [ + 295, + 711, + 301, + 720 + ], + "score": 0.38, + "content": "I", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 708, + 424, + 722 + ], + "score": 1.0, + "content": "hold. Then for any sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 710, + 450, + 722 + ], + "score": 0.92, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 708, + 505, + 722 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 106, + 718, + 507, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 720, + 194, + 733 + ], + "score": 0.92, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } ( j _ { n } ) \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 194, + 718, + 334, + 734 + ], + "score": 1.0, + "content": ", we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 335, + 721, + 389, + 732 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - \\alpha _ { 0 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 718, + 441, + 734 + ], + "score": 1.0, + "content": "that for any", + "type": "text" + }, + { + "bbox": [ + 442, + 721, + 486, + 732 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 486, + 718, + 507, + 734 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30.5, + "bbox_fs": [ + 105, + 708, + 507, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 156, + 95 + ], + "lines": [ + { + "bbox": [ + 104, + 79, + 153, + 97 + ], + "spans": [ + { + "bbox": [ + 104, + 79, + 123, + 97 + ], + "score": 1.0, + "content": "any", + "type": "text" + }, + { + "bbox": [ + 123, + 83, + 153, + 94 + ], + "score": 0.88, + "content": "k \\geq j _ { n }", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 211, + 99, + 379, + 135 + ], + "lines": [ + { + "bbox": [ + 211, + 99, + 379, + 135 + ], + "spans": [ + { + "bbox": [ + 211, + 99, + 379, + 135 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\| ( \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , } \\\\ { \\| ( \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } . } \\end{array}", + "type": "interline_equation", + "image_path": "559af563d49ede930871100a560de369ee8a1cb8edf6d607cba6074ba4a2fa26.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 211, + 99, + 379, + 117.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 211, + 117.0, + 379, + 135.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 142, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 296, + 156 + ], + "score": 1.0, + "content": "Lemma 6 Assume the conditions in Theorem", + "type": "text" + }, + { + "bbox": [ + 297, + 144, + 303, + 153 + ], + "score": 0.6, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 141, + 424, + 156 + ], + "score": 1.0, + "content": "hold. The for any sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 143, + 449, + 155 + ], + "score": 0.92, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 141, + 505, + 156 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 153, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 107, + 154, + 177, + 166 + ], + "score": 0.89, + "content": "j _ { n } / \\log ( j _ { n } ) \\gg q ,", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 153, + 318, + 168 + ], + "score": 1.0, + "content": ", we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 319, + 154, + 369, + 166 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 153, + 422, + 168 + ], + "score": 1.0, + "content": "that for any", + "type": "text" + }, + { + "bbox": [ + 423, + 155, + 468, + 166 + ], + "score": 0.92, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 153, + 506, + 168 + ], + "score": 1.0, + "content": "and any", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 107, + 163, + 141, + 180 + ], + "spans": [ + { + "bbox": [ + 107, + 167, + 136, + 177 + ], + "score": 0.88, + "content": "k \\geq j _ { n } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 163, + 141, + 180 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 178, + 182, + 412, + 216 + ], + "lines": [ + { + "bbox": [ + 178, + 182, + 412, + 216 + ], + "spans": [ + { + "bbox": [ + 178, + 182, + 412, + 216 + ], + "score": 0.93, + "content": "\\left\\| \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log k } .", + "type": "interline_equation", + "image_path": "d72c7d4d04ffea76c8a84f3033647e69548b84de811f40aac9185403233a89cf.jpg" + } + ] + } + ], + "index": 6.5, + "virtual_lines": [ + { + "bbox": [ + 178, + 182, + 412, + 199.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 178, + 199.0, + 412, + 216.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 227, + 169, + 240 + ], + "lines": [ + { + "bbox": [ + 105, + 225, + 170, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 123, + 242 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 123, + 227, + 165, + 240 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 225, + 170, + 242 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 166, + 245, + 424, + 279 + ], + "lines": [ + { + "bbox": [ + 166, + 245, + 424, + 279 + ], + "spans": [ + { + "bbox": [ + 166, + 245, + 424, + 279 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a , k } - \\beta _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\left[ \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right] ,", + "type": "interline_equation", + "image_path": "a9e10a0e53b2909231b95a72a9792b55ac902e50f2ad4507570dac0a07c03674.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 166, + 245, + 424, + 256.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 166, + 256.3333333333333, + 424, + 267.66666666666663 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 166, + 267.66666666666663, + 424, + 278.99999999999994 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 284, + 149, + 295 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 150, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 150, + 296 + ], + "score": 1.0, + "content": "and hence", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 299, + 452, + 386 + ], + "lines": [ + { + "bbox": [ + 165, + 299, + 452, + 386 + ], + "spans": [ + { + "bbox": [ + 165, + 299, + 452, + 386 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\Bigg \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } - \\Sigma _ { a } ^ { - 1 } \\left[ \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right] \\Bigg \\| _ { 2 } } \\\\ { \\leq } & { \\| \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\| _ { 2 } \\Bigg \\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\Bigg \\| _ { 2 } } \\\\ { \\leq } & { ( q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } ) q ^ { 1 / 2 } k ^ { - 1 / 2 } \\log ^ { 1 / 2 } k , ~ \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "73c0e6a5693c8b86b5891144cbd0dcb35c62fce9a4dc8d2c0b54ae605be2f325.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 165, + 299, + 452, + 328.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 165, + 328.0, + 452, + 357.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 165, + 357.0, + 452, + 386.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 389, + 404, + 403 + ], + "lines": [ + { + "bbox": [ + 106, + 388, + 405, + 404 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 204, + 404 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 390, + 257, + 403 + ], + "score": 0.93, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 388, + 405, + 404 + ], + "score": 1.0, + "content": ", by Lemma 5 and Lemma 6. Define", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 105, + 407, + 495, + 443 + ], + "lines": [ + { + "bbox": [ + 105, + 407, + 495, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 495, + 443 + ], + "score": 0.93, + "content": "B ^ { * } ( t ) = { \\frac { 1 } { \\sqrt { n ( t ) } } } \\sum _ { i = 1 } ^ { n ( t ) } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] .", + "type": "interline_equation", + "image_path": "8bd2974359b86f4c12323f013116a28cc3186773a490cfb2843cd2795a187d54.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 105, + 407, + 495, + 419.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 105, + 419.0, + 495, + 431.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 105, + 431.0, + 495, + 443.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 447, + 164, + 459 + ], + "lines": [ + { + "bbox": [ + 105, + 446, + 165, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 165, + 460 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 109, + 462, + 483, + 479 + ], + "lines": [ + { + "bbox": [ + 109, + 462, + 483, + 479 + ], + "spans": [ + { + "bbox": [ + 109, + 462, + 483, + 479 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\| B ^ { * } ( t _ { k } ) - B ( t _ { k } ) \\| _ { 2 } \\preceq \\{ q ^ { 3 / 2 } \\delta _ { n ( t _ { k } ) } + q \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} n ^ { - 1 / 2 } ( t _ { k } ) \\log ^ { 1 / 2 } n ( t _ { k } ) , \\forall k \\geq 1 , } \\end{array}", + "type": "interline_equation", + "image_path": "79e41a94ce06b7cb13a6141b4dfdc7c947fa75c0809035cc2aae53aed6e2765e.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 109, + 462, + 483, + 479 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 322, + 496 + ], + "lines": [ + { + "bbox": [ + 106, + 482, + 322, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 482, + 204, + 499 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 484, + 274, + 497 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 482, + 322, + 499 + ], + "score": 1.0, + "content": ", and hence", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 501, + 514, + 524 + ], + "lines": [ + { + "bbox": [ + 111, + 501, + 514, + 524 + ], + "spans": [ + { + "bbox": [ + 111, + 501, + 514, + 524 + ], + "score": 0.87, + "content": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) \\| _ { 2 } \\leq \\bar { c } \\{ q ^ { 2 } \\delta _ { n ( t _ { k } ) } + q ^ { 3 / 2 } \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } .", + "type": "interline_equation", + "image_path": "a112f99afa97460fb88337898a326efbd251d70e458132252d2d0fac977a71cd.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 111, + 501, + 514, + 524 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 542, + 507, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 542, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 203, + 557 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 203, + 543, + 271, + 555 + ], + "score": 0.94, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 542, + 348, + 557 + ], + "score": 1.0, + "content": ", for some constant", + "type": "text" + }, + { + "bbox": [ + 348, + 544, + 371, + 554 + ], + "score": 0.89, + "content": "\\bar { c } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 542, + 505, + 557 + ], + "score": 1.0, + "content": ", by equation 41. Under the given", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 553, + 249, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 553, + 163, + 567 + ], + "score": 1.0, + "content": "conditions on", + "type": "text" + }, + { + "bbox": [ + 163, + 556, + 169, + 565 + ], + "score": 0.82, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 553, + 187, + 567 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 187, + 554, + 210, + 566 + ], + "score": 0.92, + "content": "n ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 553, + 249, + 567 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 211, + 571, + 379, + 587 + ], + "lines": [ + { + "bbox": [ + 211, + 571, + 379, + 587 + ], + "spans": [ + { + "bbox": [ + 211, + 571, + 379, + 587 + ], + "score": 0.91, + "content": "q \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } = o ( 1 ) , ~ \\forall k \\geq 1 ,", + "type": "interline_equation", + "image_path": "44de17708e7d92ad1e9e207200cd700f4a1c8f68194f7d9c881abbe5714e7faa.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 211, + 571, + 379, + 587 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 592, + 149, + 603 + ], + "lines": [ + { + "bbox": [ + 106, + 592, + 149, + 604 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 149, + 604 + ], + "score": 1.0, + "content": "and hence", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 606, + 479, + 630 + ], + "lines": [ + { + "bbox": [ + 111, + 606, + 479, + 630 + ], + "spans": [ + { + "bbox": [ + 111, + 606, + 479, + 630 + ], + "score": 0.9, + "content": "\\| \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) \\| _ { 2 } \\leq { \\bar { c } } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} , \\forall k \\geq 1 ,", + "type": "interline_equation", + "image_path": "cc397be3c250d4c29816222ce191125002acc9b38029f07223112df51291bab9.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 111, + 606, + 479, + 630 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 635, + 290, + 646 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 290, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 186, + 648 + ], + "score": 1.0, + "content": "Thus, for any given", + "type": "text" + }, + { + "bbox": [ + 187, + 637, + 244, + 646 + ], + "score": 0.88, + "content": "z _ { 1 } , z _ { 2 } , \\dotsc , z _ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 633, + 290, + 648 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "interline_equation", + "bbox": [ + 163, + 651, + 455, + 738 + ], + "lines": [ + { + "bbox": [ + 163, + 651, + 455, + 738 + ], + "spans": [ + { + "bbox": [ + 163, + 651, + 455, + 738 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } \\right) \\leq 0 \\right\\} - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } \\right) \\leq 0 \\right\\} + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) , } \\end{array}", + "type": "interline_equation", + "image_path": "421db15433f0508b092fd376de9810dd95d8d03150262dfaeabf6910a4162801.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 163, + 651, + 455, + 680.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 163, + 680.0, + 455, + 709.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 163, + 709.0, + 455, + 738.0 + ], + "spans": [], + "index": 32 + } + ] + } + ], + "page_idx": 14, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 761 + ], + "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, + 82, + 156, + 95 + ], + "lines": [ + { + "bbox": [ + 104, + 79, + 153, + 97 + ], + "spans": [ + { + "bbox": [ + 104, + 79, + 123, + 97 + ], + "score": 1.0, + "content": "any", + "type": "text" + }, + { + "bbox": [ + 123, + 83, + 153, + 94 + ], + "score": 0.88, + "content": "k \\geq j _ { n }", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 104, + 79, + 153, + 97 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 211, + 99, + 379, + 135 + ], + "lines": [ + { + "bbox": [ + 211, + 99, + 379, + 135 + ], + "spans": [ + { + "bbox": [ + 211, + 99, + 379, + 135 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\| ( \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , } \\\\ { \\| ( \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } . } \\end{array}", + "type": "interline_equation", + "image_path": "559af563d49ede930871100a560de369ee8a1cb8edf6d607cba6074ba4a2fa26.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 211, + 99, + 379, + 117.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 211, + 117.0, + 379, + 135.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 142, + 505, + 177 + ], + "lines": [ + { + "bbox": [ + 105, + 141, + 505, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 141, + 296, + 156 + ], + "score": 1.0, + "content": "Lemma 6 Assume the conditions in Theorem", + "type": "text" + }, + { + "bbox": [ + 297, + 144, + 303, + 153 + ], + "score": 0.6, + "content": "^ { l }", + "type": "inline_equation" + }, + { + "bbox": [ + 303, + 141, + 424, + 156 + ], + "score": 1.0, + "content": "hold. The for any sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 143, + 449, + 155 + ], + "score": 0.92, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 141, + 505, + 156 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 107, + 153, + 506, + 168 + ], + "spans": [ + { + "bbox": [ + 107, + 154, + 177, + 166 + ], + "score": 0.89, + "content": "j _ { n } / \\log ( j _ { n } ) \\gg q ,", + "type": "inline_equation" + }, + { + "bbox": [ + 178, + 153, + 318, + 168 + ], + "score": 1.0, + "content": ", we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 319, + 154, + 369, + 166 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 369, + 153, + 422, + 168 + ], + "score": 1.0, + "content": "that for any", + "type": "text" + }, + { + "bbox": [ + 423, + 155, + 468, + 166 + ], + "score": 0.92, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 153, + 506, + 168 + ], + "score": 1.0, + "content": "and any", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 107, + 163, + 141, + 180 + ], + "spans": [ + { + "bbox": [ + 107, + 167, + 136, + 177 + ], + "score": 0.88, + "content": "k \\geq j _ { n } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 137, + 163, + 141, + 180 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 141, + 506, + 180 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 178, + 182, + 412, + 216 + ], + "lines": [ + { + "bbox": [ + 178, + 182, + 412, + 216 + ], + "spans": [ + { + "bbox": [ + 178, + 182, + 412, + 216 + ], + "score": 0.93, + "content": "\\left\\| \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log k } .", + "type": "interline_equation", + "image_path": "d72c7d4d04ffea76c8a84f3033647e69548b84de811f40aac9185403233a89cf.jpg" + } + ] + } + ], + "index": 6.5, + "virtual_lines": [ + { + "bbox": [ + 178, + 182, + 412, + 199.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 178, + 199.0, + 412, + 216.0 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 227, + 169, + 240 + ], + "lines": [ + { + "bbox": [ + 105, + 225, + 170, + 242 + ], + "spans": [ + { + "bbox": [ + 105, + 225, + 123, + 242 + ], + "score": 1.0, + "content": "For", + "type": "text" + }, + { + "bbox": [ + 123, + 227, + 165, + 240 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 225, + 170, + 242 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 225, + 170, + 242 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 166, + 245, + 424, + 279 + ], + "lines": [ + { + "bbox": [ + 166, + 245, + 424, + 279 + ], + "spans": [ + { + "bbox": [ + 166, + 245, + 424, + 279 + ], + "score": 0.93, + "content": "\\widehat { \\beta } _ { a , k } - \\beta _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\left[ \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right] ,", + "type": "interline_equation", + "image_path": "a9e10a0e53b2909231b95a72a9792b55ac902e50f2ad4507570dac0a07c03674.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 166, + 245, + 424, + 256.3333333333333 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 166, + 256.3333333333333, + 424, + 267.66666666666663 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 166, + 267.66666666666663, + 424, + 278.99999999999994 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 284, + 149, + 295 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 150, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 150, + 296 + ], + "score": 1.0, + "content": "and hence", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 282, + 150, + 296 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 165, + 299, + 452, + 386 + ], + "lines": [ + { + "bbox": [ + 165, + 299, + 452, + 386 + ], + "spans": [ + { + "bbox": [ + 165, + 299, + 452, + 386 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\Bigg \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } - \\Sigma _ { a } ^ { - 1 } \\left[ \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right] \\Bigg \\| _ { 2 } } \\\\ { \\leq } & { \\| \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\| _ { 2 } \\Bigg \\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\Bigg \\| _ { 2 } } \\\\ { \\leq } & { ( q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } ) q ^ { 1 / 2 } k ^ { - 1 / 2 } \\log ^ { 1 / 2 } k , ~ \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "73c0e6a5693c8b86b5891144cbd0dcb35c62fce9a4dc8d2c0b54ae605be2f325.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 165, + 299, + 452, + 328.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 165, + 328.0, + 452, + 357.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 165, + 357.0, + 452, + 386.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 389, + 404, + 403 + ], + "lines": [ + { + "bbox": [ + 106, + 388, + 405, + 404 + ], + "spans": [ + { + "bbox": [ + 106, + 388, + 204, + 404 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 390, + 257, + 403 + ], + "score": 0.93, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 388, + 405, + 404 + ], + "score": 1.0, + "content": ", by Lemma 5 and Lemma 6. Define", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 388, + 405, + 404 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 105, + 407, + 495, + 443 + ], + "lines": [ + { + "bbox": [ + 105, + 407, + 495, + 443 + ], + "spans": [ + { + "bbox": [ + 105, + 407, + 495, + 443 + ], + "score": 0.93, + "content": "B ^ { * } ( t ) = { \\frac { 1 } { \\sqrt { n ( t ) } } } \\sum _ { i = 1 } ^ { n ( t ) } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] .", + "type": "interline_equation", + "image_path": "8bd2974359b86f4c12323f013116a28cc3186773a490cfb2843cd2795a187d54.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 105, + 407, + 495, + 419.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 105, + 419.0, + 495, + 431.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 105, + 431.0, + 495, + 443.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 447, + 164, + 459 + ], + "lines": [ + { + "bbox": [ + 105, + 446, + 165, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 446, + 165, + 460 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 446, + 165, + 460 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 109, + 462, + 483, + 479 + ], + "lines": [ + { + "bbox": [ + 109, + 462, + 483, + 479 + ], + "spans": [ + { + "bbox": [ + 109, + 462, + 483, + 479 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\| B ^ { * } ( t _ { k } ) - B ( t _ { k } ) \\| _ { 2 } \\preceq \\{ q ^ { 3 / 2 } \\delta _ { n ( t _ { k } ) } + q \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} n ^ { - 1 / 2 } ( t _ { k } ) \\log ^ { 1 / 2 } n ( t _ { k } ) , \\forall k \\geq 1 , } \\end{array}", + "type": "interline_equation", + "image_path": "79e41a94ce06b7cb13a6141b4dfdc7c947fa75c0809035cc2aae53aed6e2765e.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 109, + 462, + 483, + 479 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 322, + 496 + ], + "lines": [ + { + "bbox": [ + 106, + 482, + 322, + 499 + ], + "spans": [ + { + "bbox": [ + 106, + 482, + 204, + 499 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 484, + 274, + 497 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 482, + 322, + 499 + ], + "score": 1.0, + "content": ", and hence", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 482, + 322, + 499 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 501, + 514, + 524 + ], + "lines": [ + { + "bbox": [ + 111, + 501, + 514, + 524 + ], + "spans": [ + { + "bbox": [ + 111, + 501, + 514, + 524 + ], + "score": 0.87, + "content": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) \\| _ { 2 } \\leq \\bar { c } \\{ q ^ { 2 } \\delta _ { n ( t _ { k } ) } + q ^ { 3 / 2 } \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } .", + "type": "interline_equation", + "image_path": "a112f99afa97460fb88337898a326efbd251d70e458132252d2d0fac977a71cd.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 111, + 501, + 514, + 524 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 542, + 507, + 566 + ], + "lines": [ + { + "bbox": [ + 105, + 542, + 505, + 557 + ], + "spans": [ + { + "bbox": [ + 105, + 542, + 203, + 557 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 203, + 543, + 271, + 555 + ], + "score": 0.94, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 542, + 348, + 557 + ], + "score": 1.0, + "content": ", for some constant", + "type": "text" + }, + { + "bbox": [ + 348, + 544, + 371, + 554 + ], + "score": 0.89, + "content": "\\bar { c } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 372, + 542, + 505, + 557 + ], + "score": 1.0, + "content": ", by equation 41. Under the given", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 106, + 553, + 249, + 567 + ], + "spans": [ + { + "bbox": [ + 106, + 553, + 163, + 567 + ], + "score": 1.0, + "content": "conditions on", + "type": "text" + }, + { + "bbox": [ + 163, + 556, + 169, + 565 + ], + "score": 0.82, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 169, + 553, + 187, + 567 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 187, + 554, + 210, + 566 + ], + "score": 0.92, + "content": "n ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 553, + 249, + 567 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 105, + 542, + 505, + 567 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 211, + 571, + 379, + 587 + ], + "lines": [ + { + "bbox": [ + 211, + 571, + 379, + 587 + ], + "spans": [ + { + "bbox": [ + 211, + 571, + 379, + 587 + ], + "score": 0.91, + "content": "q \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } = o ( 1 ) , ~ \\forall k \\geq 1 ,", + "type": "interline_equation", + "image_path": "44de17708e7d92ad1e9e207200cd700f4a1c8f68194f7d9c881abbe5714e7faa.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 211, + 571, + 379, + 587 + ], + "spans": [], + "index": 26 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 592, + 149, + 603 + ], + "lines": [ + { + "bbox": [ + 106, + 592, + 149, + 604 + ], + "spans": [ + { + "bbox": [ + 106, + 592, + 149, + 604 + ], + "score": 1.0, + "content": "and hence", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 27, + "bbox_fs": [ + 106, + 592, + 149, + 604 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 606, + 479, + 630 + ], + "lines": [ + { + "bbox": [ + 111, + 606, + 479, + 630 + ], + "spans": [ + { + "bbox": [ + 111, + 606, + 479, + 630 + ], + "score": 0.9, + "content": "\\| \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) \\| _ { 2 } \\leq { \\bar { c } } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} , \\forall k \\geq 1 ,", + "type": "interline_equation", + "image_path": "cc397be3c250d4c29816222ce191125002acc9b38029f07223112df51291bab9.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 111, + 606, + 479, + 630 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 635, + 290, + 646 + ], + "lines": [ + { + "bbox": [ + 105, + 633, + 290, + 648 + ], + "spans": [ + { + "bbox": [ + 105, + 633, + 186, + 648 + ], + "score": 1.0, + "content": "Thus, for any given", + "type": "text" + }, + { + "bbox": [ + 187, + 637, + 244, + 646 + ], + "score": 0.88, + "content": "z _ { 1 } , z _ { 2 } , \\dotsc , z _ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 633, + 290, + 648 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 633, + 290, + 648 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 163, + 651, + 455, + 738 + ], + "lines": [ + { + "bbox": [ + 163, + 651, + 455, + 738 + ], + "spans": [ + { + "bbox": [ + 163, + 651, + 455, + 738 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } \\right) \\leq 0 \\right\\} - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } \\right) \\leq 0 \\right\\} + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) , } \\end{array}", + "type": "interline_equation", + "image_path": "421db15433f0508b092fd376de9810dd95d8d03150262dfaeabf6910a4162801.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 163, + 651, + 455, + 680.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 163, + 680.0, + 455, + 709.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 163, + 709.0, + 455, + 738.0 + ], + "spans": [], + "index": 32 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 133, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 135, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 135, + 95 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 195, + 97, + 396, + 133 + ], + "lines": [ + { + "bbox": [ + 195, + 97, + 396, + 133 + ], + "spans": [ + { + "bbox": [ + 195, + 97, + 396, + 133 + ], + "score": 0.92, + "content": "\\begin{array} { r } { z _ { k , - } = z _ { k } - \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} , } \\\\ { z _ { k , + } = z _ { k } + \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} . } \\end{array}", + "type": "interline_equation", + "image_path": "cdcb1bbc80b153bfb0d038b4fb13b4b81b47c928454f154dcc715debeb7bdd04.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 195, + 97, + 396, + 115.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 195, + 115.0, + 396, + 133.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 141, + 338, + 155 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 338, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 139, + 155 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 140, + 142, + 214, + 154 + ], + "score": 0.91, + "content": "i \\geq 1 , 1 \\leq k \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 141, + 251, + 155 + ], + "score": 1.0, + "content": ", define a", + "type": "text" + }, + { + "bbox": [ + 251, + 145, + 257, + 154 + ], + "score": 0.82, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 141, + 338, + 155 + ], + "score": 1.0, + "content": "-dimensional vector", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 159, + 513, + 187 + ], + "lines": [ + { + "bbox": [ + 111, + 159, + 513, + 187 + ], + "spans": [ + { + "bbox": [ + 111, + 159, + 513, + 187 + ], + "score": 0.85, + "content": "\\dot { \\iota } _ { i , k } = \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] \\mathbb { I } ( i \\leq n ( t _ { k } ) , 1 ) .", + "type": "interline_equation", + "image_path": "d762be66d00bf7c1ab2768fe4344df82a8342bb1706cc82bce32cf944c0d89a7.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 111, + 159, + 513, + 187 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 192, + 169, + 204 + ], + "lines": [ + { + "bbox": [ + 105, + 189, + 171, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 171, + 207 + ], + "score": 1.0, + "content": "or equivalently,", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 208, + 514, + 236 + ], + "lines": [ + { + "bbox": [ + 111, + 208, + 514, + 236 + ], + "spans": [ + { + "bbox": [ + 111, + 208, + 514, + 236 + ], + "score": 0.85, + "content": "\\dot { \\iota } _ { i , k } = \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } ^ { * } ( 0 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] \\mathbb { I } ( \\dot { \\iota } _ { i } ) \\mathbb { 1 } - \\mu _ { 0 } \\mathbb { 1 } / \\mathbb { 1 } \\mu _ { 0 } ]", + "type": "interline_equation", + "image_path": "2ca906cb0ea6c713fd744ac32e5b5117a5e5d828346e40b741c5e0fd06bd36ec.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 111, + 208, + 514, + 236 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 242, + 502, + 270 + ], + "lines": [ + { + "bbox": [ + 104, + 241, + 504, + 260 + ], + "spans": [ + { + "bbox": [ + 104, + 241, + 204, + 260 + ], + "score": 1.0, + "content": "by Condition (A1). Let", + "type": "text" + }, + { + "bbox": [ + 204, + 243, + 315, + 258 + ], + "score": 0.93, + "content": "\\pmb { \\xi } _ { i } = ( \\xi _ { i , 1 } ^ { \\top } , \\xi _ { i , 2 } ^ { \\top } , \\cdot \\cdot \\cdot , \\xi _ { i , K } ^ { \\top } ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 241, + 335, + 260 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 335, + 243, + 401, + 257 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { M } _ { j } = \\sum _ { i = 1 } ^ { j } \\pmb { \\xi } _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 241, + 464, + 260 + ], + "score": 1.0, + "content": ". The sequence", + "type": "text" + }, + { + "bbox": [ + 464, + 244, + 504, + 257 + ], + "score": 0.92, + "content": "\\{ \\mathcal { M } _ { i } \\} _ { i \\ge 1 }", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 256, + 439, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 256, + 347, + 270 + ], + "score": 1.0, + "content": "forms a multivariate martingale with respect to the filtration", + "type": "text" + }, + { + "bbox": [ + 347, + 257, + 412, + 269 + ], + "score": 0.92, + "content": "\\{ \\sigma ( \\mathcal { F } _ { i } ) : i \\ge 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 256, + 439, + 270 + ], + "score": 1.0, + "content": ", since", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5 + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 274, + 385, + 288 + ], + "lines": [ + { + "bbox": [ + 205, + 274, + 385, + 288 + ], + "spans": [ + { + "bbox": [ + 205, + 274, + 385, + 288 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathrm { E } ( \\xi _ { i , k } | \\mathcal { F } _ { i } ) = [ \\{ \\mathrm { E } ( \\xi _ { i , k } | A _ { i } , X _ { i } , \\mathcal { F } _ { i } ) \\} | \\mathcal { F } _ { i } ] = 0 , } \\end{array}", + "type": "interline_equation", + "image_path": "e400792ccfec46f8a9cbb44dda14b3013aaa7c15a6fa06caf56388876756c52b.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 205, + 274, + 385, + 288 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 293, + 492, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 293, + 493, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 159, + 306 + ], + "score": 1.0, + "content": "by (A2). Let", + "type": "text" + }, + { + "bbox": [ + 159, + 293, + 200, + 306 + ], + "score": 0.93, + "content": "n ( t _ { 0 } ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 293, + 237, + 306 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + }, + { + "bbox": [ + 238, + 294, + 243, + 303 + ], + "score": 0.78, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 293, + 282, + 306 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 282, + 293, + 367, + 306 + ], + "score": 0.93, + "content": "n ( t _ { k - 1 } ) < i \\leq n ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 293, + 406, + 306 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 407, + 294, + 454, + 304 + ], + "score": 0.91, + "content": "1 \\leq k \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 293, + 493, + 306 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 310, + 503, + 340 + ], + "lines": [ + { + "bbox": [ + 111, + 310, + 503, + 340 + ], + "spans": [ + { + "bbox": [ + 111, + 310, + 503, + 340 + ], + "score": 0.73, + "content": "\\xi _ { i } | | _ { \\infty } \\leq \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } \\{ \\| \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} \\| _ { 2 } + \\| \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } ^ { * } ( 0 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} \\| _ { 2 } \\}", + "type": "interline_equation", + "image_path": "85b7ff30c1a5a942165b107fd1062b8f5fd64f87562a685a86340928aa06b4fb.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 111, + 310, + 503, + 320.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 111, + 320.0, + 503, + 330.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 111, + 330.0, + 503, + 340.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 359, + 344, + 372 + ], + "lines": [ + { + "bbox": [ + 106, + 359, + 345, + 374 + ], + "spans": [ + { + "bbox": [ + 106, + 359, + 345, + 374 + ], + "score": 1.0, + "content": "where the second inequality is due to Lemma 4. Therefore,", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 250, + 376, + 339, + 406 + ], + "lines": [ + { + "bbox": [ + 250, + 376, + 339, + 406 + ], + "spans": [ + { + "bbox": [ + 250, + 376, + 339, + 406 + ], + "score": 0.94, + "content": "\\mathbb { E } \\| \\pmb { \\xi } _ { i } \\| _ { \\infty } ^ { 3 } \\preceq \\frac { q ^ { 3 / 2 } } { n ^ { 3 / 2 } ( t _ { k } ) } .", + "type": "interline_equation", + "image_path": "61e59a12095d032285b0f9bf3b2520eb18817974b656554ecf7fec6bed1eba64.jpg" + } + ] + } + ], + "index": 15.5, + "virtual_lines": [ + { + "bbox": [ + 250, + 376, + 339, + 391.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 250, + 391.0, + 339, + 406.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 410, + 164, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 409, + 165, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 165, + 423 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 425, + 514, + 499 + ], + "lines": [ + { + "bbox": [ + 115, + 425, + 514, + 499 + ], + "spans": [ + { + "bbox": [ + 115, + 425, + 514, + 499 + ], + "score": 0.92, + "content": "\\begin{array} { r l } { { } } & { \\underset { i = 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\ \\mathrm { E } \\| \\xi _ { i } \\| _ { \\infty } ^ { 3 } = \\underset { k = 1 } { \\overset { K } { \\sum } } \\ \\underset { i = n ( t _ { k - 1 } ) + 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\ \\mathrm { E } \\| \\xi _ { i } \\| _ { \\infty } ^ { 3 } \\preceq q ^ { 3 / 2 } \\underset { k = 1 } { \\overset { K } { \\sum } } \\ \\frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } } \\\\ { { \\leq } } & { \\frac { q ^ { 3 / 2 } } { \\sqrt { n ( t _ { 1 } ) } } + q ^ { 3 / 2 } \\underset { k = 2 } { \\overset { K } { \\sum } } \\ \\frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } \\leq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) + q ^ { 3 / 2 } \\int _ { n ( t _ { 1 } ) } ^ { + \\infty } x ^ { - 3 / 2 } d x = 3 q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { k } ) } \\end{array}", + "type": "interline_equation", + "image_path": "fc7e9df0d372bc3db2ccd0e79e89ffc42c40931801e2aa28fee8f4b1053e4cca.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 115, + 425, + 514, + 449.6666666666667 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 115, + 449.6666666666667, + 514, + 474.33333333333337 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 115, + 474.33333333333337, + 514, + 499.00000000000006 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 505, + 505, + 528 + ], + "lines": [ + { + "bbox": [ + 105, + 504, + 502, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 314, + 519 + ], + "score": 1.0, + "content": "Define a sequence of independent Gaussian vectors", + "type": "text" + }, + { + "bbox": [ + 315, + 505, + 348, + 518 + ], + "score": 0.93, + "content": "\\{ \\eta _ { i } \\} _ { i \\ge 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 504, + 395, + 519 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + }, + { + "bbox": [ + 396, + 504, + 502, + 518 + ], + "score": 0.91, + "content": "\\pmb { \\eta _ { i } } \\sim N ( 0 , \\mathbb { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) )", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 516, + 331, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 516, + 137, + 528 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 137, + 517, + 160, + 527 + ], + "score": 0.9, + "content": "i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 516, + 261, + 528 + ], + "score": 1.0, + "content": ". Then the distribution of", + "type": "text" + }, + { + "bbox": [ + 262, + 518, + 272, + 528 + ], + "score": 0.84, + "content": "\\eta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 516, + 331, + 528 + ], + "score": 1.0, + "content": "is the same as", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 533, + 422, + 566 + ], + "lines": [ + { + "bbox": [ + 168, + 533, + 422, + 566 + ], + "spans": [ + { + "bbox": [ + 168, + 533, + 422, + 566 + ], + "score": 0.92, + "content": "\\left( \\frac { \\mathbb { I } ( i \\leq n ( t _ { 1 } ) ) } { \\sqrt { n ( t _ { 1 } ) } } Z ^ { \\top } , \\frac { \\mathbb { I } ( i \\leq n ( t _ { 2 } ) ) } { \\sqrt { n ( t _ { 2 } ) } } Z ^ { \\top } , \\cdots , \\frac { \\mathbb { I } ( i \\leq n ( t _ { K } ) ) } { \\sqrt { n ( t _ { K } ) } } Z ^ { \\top } \\right) ,", + "type": "interline_equation", + "image_path": "44c0ea64b278a5838b22fe2ed3eeeea0f3c192607cba9d34dfffd9ef1e0c9f3b.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 168, + 533, + 422, + 544.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 168, + 544.0, + 422, + 555.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 168, + 555.0, + 422, + 566.0 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 571, + 423, + 583 + ], + "lines": [ + { + "bbox": [ + 106, + 570, + 424, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 133, + 585 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 572, + 142, + 581 + ], + "score": 0.85, + "content": "Z", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 570, + 159, + 585 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 160, + 574, + 165, + 583 + ], + "score": 0.8, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 570, + 424, + 585 + ], + "score": 1.0, + "content": "-dimensional mean-zero Gaussian vector with covariance matrix", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "interline_equation", + "bbox": [ + 151, + 588, + 468, + 737 + ], + "lines": [ + { + "bbox": [ + 151, + 588, + 468, + 737 + ], + "spans": [ + { + "bbox": [ + 151, + 588, + 468, + 737 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\quad \\mathrm { C o v } [ \\displaystyle \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\varphi ( X _ { i } ) ] [ ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] \\mathcal { F } _ { i - 1 } ] } \\\\ { = } & { \\quad \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] [ ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } ] \\mathcal { F } _ { i - 1 } ] \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] [ ( A _ { i } = a ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } ] \\Sigma _ { a } ^ { - 1 } } \\\\ & { = \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\mathbb { E } \\{ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\pi _ { i - 1 } ( a , X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } \\} \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } \\{ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\pi _ { i - 1 } ( a , X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } \\} \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\Sigma _ { a } ^ { - 1 } , } \\end{array}", + "type": "interline_equation", + "image_path": "28b92267918a11a9272fd7cbfbf7c8d3621266cd2f948032dd1b4b5548f3d789.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 151, + 588, + 468, + 637.6666666666666 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 151, + 637.6666666666666, + 468, + 687.3333333333333 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 151, + 687.3333333333333, + 468, + 736.9999999999999 + ], + "spans": [], + "index": 29 + } + ] + } + ], + "page_idx": 15, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 761 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "16", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 133, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 135, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 135, + 95 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 135, + 95 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 195, + 97, + 396, + 133 + ], + "lines": [ + { + "bbox": [ + 195, + 97, + 396, + 133 + ], + "spans": [ + { + "bbox": [ + 195, + 97, + 396, + 133 + ], + "score": 0.92, + "content": "\\begin{array} { r } { z _ { k , - } = z _ { k } - \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} , } \\\\ { z _ { k , + } = z _ { k } + \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} . } \\end{array}", + "type": "interline_equation", + "image_path": "cdcb1bbc80b153bfb0d038b4fb13b4b81b47c928454f154dcc715debeb7bdd04.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 195, + 97, + 396, + 115.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 195, + 115.0, + 396, + 133.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 141, + 338, + 155 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 338, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 139, + 155 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 140, + 142, + 214, + 154 + ], + "score": 0.91, + "content": "i \\geq 1 , 1 \\leq k \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 141, + 251, + 155 + ], + "score": 1.0, + "content": ", define a", + "type": "text" + }, + { + "bbox": [ + 251, + 145, + 257, + 154 + ], + "score": 0.82, + "content": "q", + "type": "inline_equation" + }, + { + "bbox": [ + 257, + 141, + 338, + 155 + ], + "score": 1.0, + "content": "-dimensional vector", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 106, + 141, + 338, + 155 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 159, + 513, + 187 + ], + "lines": [ + { + "bbox": [ + 111, + 159, + 513, + 187 + ], + "spans": [ + { + "bbox": [ + 111, + 159, + 513, + 187 + ], + "score": 0.85, + "content": "\\dot { \\iota } _ { i , k } = \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] \\mathbb { I } ( i \\leq n ( t _ { k } ) , 1 ) .", + "type": "interline_equation", + "image_path": "d762be66d00bf7c1ab2768fe4344df82a8342bb1706cc82bce32cf944c0d89a7.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 111, + 159, + 513, + 187 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 192, + 169, + 204 + ], + "lines": [ + { + "bbox": [ + 105, + 189, + 171, + 207 + ], + "spans": [ + { + "bbox": [ + 105, + 189, + 171, + 207 + ], + "score": 1.0, + "content": "or equivalently,", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 189, + 171, + 207 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 208, + 514, + 236 + ], + "lines": [ + { + "bbox": [ + 111, + 208, + 514, + 236 + ], + "spans": [ + { + "bbox": [ + 111, + 208, + 514, + 236 + ], + "score": 0.85, + "content": "\\dot { \\iota } _ { i , k } = \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } ^ { * } ( 0 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] \\mathbb { I } ( \\dot { \\iota } _ { i } ) \\mathbb { 1 } - \\mu _ { 0 } \\mathbb { 1 } / \\mathbb { 1 } \\mu _ { 0 } ]", + "type": "interline_equation", + "image_path": "2ca906cb0ea6c713fd744ac32e5b5117a5e5d828346e40b741c5e0fd06bd36ec.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 111, + 208, + 514, + 236 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 242, + 502, + 270 + ], + "lines": [ + { + "bbox": [ + 104, + 241, + 504, + 260 + ], + "spans": [ + { + "bbox": [ + 104, + 241, + 204, + 260 + ], + "score": 1.0, + "content": "by Condition (A1). Let", + "type": "text" + }, + { + "bbox": [ + 204, + 243, + 315, + 258 + ], + "score": 0.93, + "content": "\\pmb { \\xi } _ { i } = ( \\xi _ { i , 1 } ^ { \\top } , \\xi _ { i , 2 } ^ { \\top } , \\cdot \\cdot \\cdot , \\xi _ { i , K } ^ { \\top } ) ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 241, + 335, + 260 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 335, + 243, + 401, + 257 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\mathcal { M } _ { j } = \\sum _ { i = 1 } ^ { j } \\pmb { \\xi } _ { i } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 401, + 241, + 464, + 260 + ], + "score": 1.0, + "content": ". The sequence", + "type": "text" + }, + { + "bbox": [ + 464, + 244, + 504, + 257 + ], + "score": 0.92, + "content": "\\{ \\mathcal { M } _ { i } \\} _ { i \\ge 1 }", + "type": "inline_equation" + } + ], + "index": 7 + }, + { + "bbox": [ + 106, + 256, + 439, + 270 + ], + "spans": [ + { + "bbox": [ + 106, + 256, + 347, + 270 + ], + "score": 1.0, + "content": "forms a multivariate martingale with respect to the filtration", + "type": "text" + }, + { + "bbox": [ + 347, + 257, + 412, + 269 + ], + "score": 0.92, + "content": "\\{ \\sigma ( \\mathcal { F } _ { i } ) : i \\ge 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 412, + 256, + 439, + 270 + ], + "score": 1.0, + "content": ", since", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.5, + "bbox_fs": [ + 104, + 241, + 504, + 270 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 205, + 274, + 385, + 288 + ], + "lines": [ + { + "bbox": [ + 205, + 274, + 385, + 288 + ], + "spans": [ + { + "bbox": [ + 205, + 274, + 385, + 288 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathrm { E } ( \\xi _ { i , k } | \\mathcal { F } _ { i } ) = [ \\{ \\mathrm { E } ( \\xi _ { i , k } | A _ { i } , X _ { i } , \\mathcal { F } _ { i } ) \\} | \\mathcal { F } _ { i } ] = 0 , } \\end{array}", + "type": "interline_equation", + "image_path": "e400792ccfec46f8a9cbb44dda14b3013aaa7c15a6fa06caf56388876756c52b.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 205, + 274, + 385, + 288 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 293, + 492, + 306 + ], + "lines": [ + { + "bbox": [ + 105, + 293, + 493, + 306 + ], + "spans": [ + { + "bbox": [ + 105, + 293, + 159, + 306 + ], + "score": 1.0, + "content": "by (A2). Let", + "type": "text" + }, + { + "bbox": [ + 159, + 293, + 200, + 306 + ], + "score": 0.93, + "content": "n ( t _ { 0 } ) = 0", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 293, + 237, + 306 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + }, + { + "bbox": [ + 238, + 294, + 243, + 303 + ], + "score": 0.78, + "content": "i", + "type": "inline_equation" + }, + { + "bbox": [ + 243, + 293, + 282, + 306 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 282, + 293, + 367, + 306 + ], + "score": 0.93, + "content": "n ( t _ { k - 1 } ) < i \\leq n ( t _ { k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 368, + 293, + 406, + 306 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 407, + 294, + 454, + 304 + ], + "score": 0.91, + "content": "1 \\leq k \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 454, + 293, + 493, + 306 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 293, + 493, + 306 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 310, + 503, + 340 + ], + "lines": [ + { + "bbox": [ + 111, + 310, + 503, + 340 + ], + "spans": [ + { + "bbox": [ + 111, + 310, + 503, + 340 + ], + "score": 0.73, + "content": "\\xi _ { i } | | _ { \\infty } \\leq \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } \\{ \\| \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} \\| _ { 2 } + \\| \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } ^ { * } ( 0 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} \\| _ { 2 } \\}", + "type": "interline_equation", + "image_path": "85b7ff30c1a5a942165b107fd1062b8f5fd64f87562a685a86340928aa06b4fb.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 111, + 310, + 503, + 320.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 111, + 320.0, + 503, + 330.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 111, + 330.0, + 503, + 340.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 359, + 344, + 372 + ], + "lines": [ + { + "bbox": [ + 106, + 359, + 345, + 374 + ], + "spans": [ + { + "bbox": [ + 106, + 359, + 345, + 374 + ], + "score": 1.0, + "content": "where the second inequality is due to Lemma 4. Therefore,", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 359, + 345, + 374 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 250, + 376, + 339, + 406 + ], + "lines": [ + { + "bbox": [ + 250, + 376, + 339, + 406 + ], + "spans": [ + { + "bbox": [ + 250, + 376, + 339, + 406 + ], + "score": 0.94, + "content": "\\mathbb { E } \\| \\pmb { \\xi } _ { i } \\| _ { \\infty } ^ { 3 } \\preceq \\frac { q ^ { 3 / 2 } } { n ^ { 3 / 2 } ( t _ { k } ) } .", + "type": "interline_equation", + "image_path": "61e59a12095d032285b0f9bf3b2520eb18817974b656554ecf7fec6bed1eba64.jpg" + } + ] + } + ], + "index": 15.5, + "virtual_lines": [ + { + "bbox": [ + 250, + 376, + 339, + 391.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 250, + 391.0, + 339, + 406.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 410, + 164, + 421 + ], + "lines": [ + { + "bbox": [ + 105, + 409, + 165, + 423 + ], + "spans": [ + { + "bbox": [ + 105, + 409, + 165, + 423 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 105, + 409, + 165, + 423 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 425, + 514, + 499 + ], + "lines": [ + { + "bbox": [ + 115, + 425, + 514, + 499 + ], + "spans": [ + { + "bbox": [ + 115, + 425, + 514, + 499 + ], + "score": 0.92, + "content": "\\begin{array} { r l } { { } } & { \\underset { i = 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\ \\mathrm { E } \\| \\xi _ { i } \\| _ { \\infty } ^ { 3 } = \\underset { k = 1 } { \\overset { K } { \\sum } } \\ \\underset { i = n ( t _ { k - 1 } ) + 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\ \\mathrm { E } \\| \\xi _ { i } \\| _ { \\infty } ^ { 3 } \\preceq q ^ { 3 / 2 } \\underset { k = 1 } { \\overset { K } { \\sum } } \\ \\frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } } \\\\ { { \\leq } } & { \\frac { q ^ { 3 / 2 } } { \\sqrt { n ( t _ { 1 } ) } } + q ^ { 3 / 2 } \\underset { k = 2 } { \\overset { K } { \\sum } } \\ \\frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } \\leq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) + q ^ { 3 / 2 } \\int _ { n ( t _ { 1 } ) } ^ { + \\infty } x ^ { - 3 / 2 } d x = 3 q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { k } ) } \\end{array}", + "type": "interline_equation", + "image_path": "fc7e9df0d372bc3db2ccd0e79e89ffc42c40931801e2aa28fee8f4b1053e4cca.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 115, + 425, + 514, + 449.6666666666667 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 115, + 449.6666666666667, + 514, + 474.33333333333337 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 115, + 474.33333333333337, + 514, + 499.00000000000006 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 505, + 505, + 528 + ], + "lines": [ + { + "bbox": [ + 105, + 504, + 502, + 519 + ], + "spans": [ + { + "bbox": [ + 105, + 504, + 314, + 519 + ], + "score": 1.0, + "content": "Define a sequence of independent Gaussian vectors", + "type": "text" + }, + { + "bbox": [ + 315, + 505, + 348, + 518 + ], + "score": 0.93, + "content": "\\{ \\eta _ { i } \\} _ { i \\ge 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 504, + 395, + 519 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + }, + { + "bbox": [ + 396, + 504, + 502, + 518 + ], + "score": 0.91, + "content": "\\pmb { \\eta _ { i } } \\sim N ( 0 , \\mathbb { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) )", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 516, + 331, + 528 + ], + "spans": [ + { + "bbox": [ + 106, + 516, + 137, + 528 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 137, + 517, + 160, + 527 + ], + "score": 0.9, + "content": "i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 160, + 516, + 261, + 528 + ], + "score": 1.0, + "content": ". Then the distribution of", + "type": "text" + }, + { + "bbox": [ + 262, + 518, + 272, + 528 + ], + "score": 0.84, + "content": "\\eta _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 272, + 516, + 331, + 528 + ], + "score": 1.0, + "content": "is the same as", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 504, + 502, + 528 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 533, + 422, + 566 + ], + "lines": [ + { + "bbox": [ + 168, + 533, + 422, + 566 + ], + "spans": [ + { + "bbox": [ + 168, + 533, + 422, + 566 + ], + "score": 0.92, + "content": "\\left( \\frac { \\mathbb { I } ( i \\leq n ( t _ { 1 } ) ) } { \\sqrt { n ( t _ { 1 } ) } } Z ^ { \\top } , \\frac { \\mathbb { I } ( i \\leq n ( t _ { 2 } ) ) } { \\sqrt { n ( t _ { 2 } ) } } Z ^ { \\top } , \\cdots , \\frac { \\mathbb { I } ( i \\leq n ( t _ { K } ) ) } { \\sqrt { n ( t _ { K } ) } } Z ^ { \\top } \\right) ,", + "type": "interline_equation", + "image_path": "44c0ea64b278a5838b22fe2ed3eeeea0f3c192607cba9d34dfffd9ef1e0c9f3b.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 168, + 533, + 422, + 544.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 168, + 544.0, + 422, + 555.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 168, + 555.0, + 422, + 566.0 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 571, + 423, + 583 + ], + "lines": [ + { + "bbox": [ + 106, + 570, + 424, + 585 + ], + "spans": [ + { + "bbox": [ + 106, + 570, + 133, + 585 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 572, + 142, + 581 + ], + "score": 0.85, + "content": "Z", + "type": "inline_equation" + }, + { + "bbox": [ + 142, + 570, + 159, + 585 + ], + "score": 1.0, + "content": "is a", + "type": "text" + }, + { + "bbox": [ + 160, + 574, + 165, + 583 + ], + "score": 0.8, + "content": "p", + "type": "inline_equation" + }, + { + "bbox": [ + 166, + 570, + 424, + 585 + ], + "score": 1.0, + "content": "-dimensional mean-zero Gaussian vector with covariance matrix", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 26, + "bbox_fs": [ + 106, + 570, + 424, + 585 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 151, + 588, + 468, + 737 + ], + "lines": [ + { + "bbox": [ + 151, + 588, + 468, + 737 + ], + "spans": [ + { + "bbox": [ + 151, + 588, + 468, + 737 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\quad \\mathrm { C o v } [ \\displaystyle \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\varphi ( X _ { i } ) ] [ ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] \\mathcal { F } _ { i - 1 } ] } \\\\ { = } & { \\quad \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] [ ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } ] \\mathcal { F } _ { i - 1 } ] \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] [ ( A _ { i } = a ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } ] \\Sigma _ { a } ^ { - 1 } } \\\\ & { = \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\mathbb { E } \\{ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\pi _ { i - 1 } ( a , X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } \\} \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } \\{ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\pi _ { i - 1 } ( a , X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } \\} \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\Sigma _ { a } ^ { - 1 } , } \\end{array}", + "type": "interline_equation", + "image_path": "28b92267918a11a9272fd7cbfbf7c8d3621266cd2f948032dd1b4b5548f3d789.jpg" + } + ] + } + ], + "index": 28, + "virtual_lines": [ + { + "bbox": [ + 151, + 588, + 468, + 637.6666666666666 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 151, + 637.6666666666666, + 468, + 687.3333333333333 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 151, + 687.3333333333333, + 468, + 736.9999999999999 + ], + "spans": [], + "index": 29 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "where the second equality follows from (A2) and Lemma 3, the third equality is due to the definition", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 318, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 117, + 106 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 95, + 138, + 105 + ], + "score": 0.88, + "content": "\\pi _ { i - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 94, + 318, + 106 + ], + "score": 1.0, + "content": "and the last equality follows from Lemma 3.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 271, + 122 + ], + "lines": [ + { + "bbox": [ + 106, + 109, + 272, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 109, + 272, + 123 + ], + "score": 1.0, + "content": "Similar to equation 19, we can show that", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 229, + 128, + 362, + 164 + ], + "lines": [ + { + "bbox": [ + 229, + 128, + 362, + 164 + ], + "spans": [ + { + "bbox": [ + 229, + 128, + 362, + 164 + ], + "score": 0.94, + "content": "\\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\operatorname { E } \\lVert \\pmb { \\eta } _ { i } \\rVert _ { \\infty } ^ { 3 } \\preceq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) .", + "type": "interline_equation", + "image_path": "7cccfdd817f82d536e29d24053e279a2d5351d6acdb36fccdbeda3d7b2444b63.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 229, + 128, + 362, + 146.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 229, + 146.0, + 362, + 164.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 169, + 450, + 182 + ], + "lines": [ + { + "bbox": [ + 106, + 168, + 449, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 168, + 371, + 183 + ], + "score": 1.0, + "content": "Using similar arguments in equation 20, we can show that for any", + "type": "text" + }, + { + "bbox": [ + 371, + 169, + 445, + 181 + ], + "score": 0.91, + "content": "1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 168, + 449, + 183 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 187, + 514, + 226 + ], + "lines": [ + { + "bbox": [ + 111, + 187, + 514, + 226 + ], + "spans": [ + { + "bbox": [ + 111, + 187, + 514, + 226 + ], + "score": 0.91, + "content": "\\sum _ { i = 1 } ^ { \\langle t \\kappa \\rangle } \\mathbf { E } \\{ \\xi _ { i } , _ { k _ { 1 } } \\xi _ { i , k _ { 2 } } ^ { \\top } | \\mathcal { F } _ { i - 1 } \\} = \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) ,", + "type": "interline_equation", + "image_path": "a22526e060b339971548b2a0ba264da6d480fb68c0114193f62238fe63d178d6.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 111, + 187, + 514, + 200.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 111, + 200.0, + 514, + 213.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 111, + 213.0, + 514, + 226.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 232, + 122, + 243 + ], + "lines": [ + { + "bbox": [ + 105, + 231, + 123, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 123, + 245 + ], + "score": 1.0, + "content": "Let", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 247, + 478, + 327 + ], + "lines": [ + { + "bbox": [ + 114, + 247, + 478, + 327 + ], + "spans": [ + { + "bbox": [ + 114, + 247, + 478, + 327 + ], + "score": 0.95, + "content": "\\begin{array} { c } { { V ( k _ { 1 } , k _ { 2 } ) = \\displaystyle \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi ^ { * } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\Sigma _ { a } ^ { - 1 } } } \\\\ { { = \\displaystyle \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } = \\displaystyle \\frac { \\sqrt { n ( t _ { k _ { 1 } } ) } } { \\sqrt { n ( t _ { k _ { 2 } } ) } } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } . } } \\end{array}", + "type": "interline_equation", + "image_path": "f5899ff4840a54c280022aa48afb27710306014db22dde8be26d4e9dba7f07b2.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 114, + 247, + 478, + 273.6666666666667 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 114, + 273.6666666666667, + 478, + 300.33333333333337 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 114, + 300.33333333333337, + 478, + 327.00000000000006 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 332, + 499, + 346 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 501, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 244, + 347 + ], + "score": 1.0, + "content": "Consider an arbitrary sequence of", + "type": "text" + }, + { + "bbox": [ + 244, + 333, + 266, + 343 + ], + "score": 0.9, + "content": "\\mathbb { R } ^ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 330, + 299, + 347 + ], + "score": 1.0, + "content": "vectors", + "type": "text" + }, + { + "bbox": [ + 299, + 333, + 348, + 345 + ], + "score": 0.92, + "content": "\\left\\{ b _ { k } \\right\\} _ { 1 \\leq k \\leq K }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 330, + 501, + 347 + ], + "score": 1.0, + "content": ". Under the given conditions, we have", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 350, + 513, + 432 + ], + "lines": [ + { + "bbox": [ + 117, + 350, + 513, + 432 + ], + "spans": [ + { + "bbox": [ + 117, + 350, + 513, + 432 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\left| b _ { k _ { 1 } } ^ { \\top } \\left( \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathsf { E } ( \\xi _ { i , k _ { 1 } } \\xi _ { 1 , k _ { 2 } } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V ( k _ { 1 } , k _ { 2 } ) \\right) b _ { k _ { 2 } } \\right| } \\\\ { \\ \\preceq } & { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathsf { E } ^ { \\mathcal { F } _ { i - 1 } } \\left\\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\right\\} \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\right\\| _ { 2 } \\| b _ { k _ { 1 } } \\| _ { 2 } \\| b _ { k _ { 2 } } \\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "0e096c097238e0e6d88f62d25ac67af9085fd1aa3d0fd2f273d82510aeaedd7d.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 117, + 350, + 513, + 377.3333333333333 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 117, + 377.3333333333333, + 513, + 404.66666666666663 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 117, + 404.66666666666663, + 513, + 431.99999999999994 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 437, + 193, + 448 + ], + "lines": [ + { + "bbox": [ + 106, + 436, + 194, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 171, + 449 + ], + "score": 1.0, + "content": "Define a matrix", + "type": "text" + }, + { + "bbox": [ + 172, + 437, + 181, + 447 + ], + "score": 0.83, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 436, + 194, + 449 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 452, + 399, + 507 + ], + "lines": [ + { + "bbox": [ + 192, + 452, + 399, + 507 + ], + "spans": [ + { + "bbox": [ + 192, + 452, + 399, + 507 + ], + "score": 0.94, + "content": "V = \\left( \\begin{array} { c c c c } { { V ( 1 , 1 ) } } & { { V ( 1 , 2 ) } } & { { . . . } } & { { V ( 1 , K ) } } \\\\ { { V ( 2 , 1 ) } } & { { V ( 2 , 2 ) } } & { { . . . } } & { { V ( 2 , K ) } } \\\\ { { \\vdots } } & { { \\vdots } } & { { } } & { { \\vdots } } \\\\ { { V ( K , 1 ) } } & { { V ( K , 2 ) } } & { { . . . } } & { { V ( K , K ) } } \\end{array} \\right) .", + "type": "interline_equation", + "image_path": "7235e14873273852a26c911377352b8d77b7ed0099727646f250964b143159de.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 192, + 452, + 399, + 470.3333333333333 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 192, + 470.3333333333333, + 399, + 488.66666666666663 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 192, + 488.66666666666663, + 399, + 506.99999999999994 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 512, + 164, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 165, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 165, + 524 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 528, + 514, + 571 + ], + "lines": [ + { + "bbox": [ + 111, + 528, + 514, + 571 + ], + "spans": [ + { + "bbox": [ + 111, + 528, + 514, + 571 + ], + "score": 0.9, + "content": "\\left| \\sum _ { i = 1 } ^ { \\boldsymbol { n } ( t _ { k } ) } \\mathrm { E } ( \\xi _ { i } \\xi _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right| \\Bigg | _ { 2 } \\preceq \\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\} \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\right\\| ^ { 2 } ,", + "type": "interline_equation", + "image_path": "5dee80761ce6abececc3c8d02f83e89ae1675bbb2c92be363b5288dccb8979f9.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 111, + 528, + 514, + 542.3333333333334 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 111, + 542.3333333333334, + 514, + 556.6666666666667 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 111, + 556.6666666666667, + 514, + 571.0000000000001 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 577, + 505, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 591 + ], + "score": 1.0, + "content": "Using similar arguments in proving equation 14, we can show the RHS of the above equation is", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 588, + 181, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 181, + 602 + ], + "score": 1.0, + "content": "upper bounded by", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 606, + 396, + 647 + ], + "lines": [ + { + "bbox": [ + 194, + 606, + 396, + 647 + ], + "spans": [ + { + "bbox": [ + 194, + 606, + 396, + 647 + ], + "score": 0.93, + "content": "\\epsilon _ { 0 } ^ { - 2 } q \\operatorname* { s u p } _ { \\stackrel { a \\in \\{ 0 , 1 \\} } { x \\in \\mathbb { X } , j \\geq n ( t _ { 1 } ) } } \\left| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right| ,", + "type": "interline_equation", + "image_path": "5fb420116bca17951a1c45bd6daa95cab6986ac8a2d82f1bd5a038f518615294.jpg" + } + ] + } + ], + "index": 27.5, + "virtual_lines": [ + { + "bbox": [ + 194, + 606, + 396, + 626.5 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 194, + 626.5, + 396, + 647.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 654, + 461, + 668 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 462, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 162, + 669 + ], + "score": 1.0, + "content": "and hence by", + "type": "text" + }, + { + "bbox": [ + 162, + 654, + 205, + 668 + ], + "score": 0.93, + "content": "\\epsilon _ { 0 } ^ { - 2 } q \\delta _ { n ( t _ { 1 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 654, + 306, + 669 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 306, + 655, + 377, + 667 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 654, + 462, + 669 + ], + "score": 1.0, + "content": ". Therefore, we have", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 674, + 410, + 714 + ], + "lines": [ + { + "bbox": [ + 180, + 674, + 410, + 714 + ], + "spans": [ + { + "bbox": [ + 180, + 674, + 410, + 714 + ], + "score": 0.94, + "content": "\\lambda _ { \\operatorname* { m i n } } \\left[ { V + \\delta _ { n ( t _ { 1 } ) } I _ { K p \\times K p } - \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\operatorname { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) } \\right] \\geq 0 ,", + "type": "interline_equation", + "image_path": "67865eb72d4624ee20ff0842ece592f35f83b92f3da34f9ccd8da22569610906.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 180, + 674, + 410, + 694.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 180, + 694.0, + 410, + 714.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 488, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 719, + 489, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 204, + 735 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 721, + 275, + 732 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 719, + 306, + 735 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 306, + 721, + 341, + 733 + ], + "score": 0.92, + "content": "I _ { K p \\times K p }", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 719, + 382, + 735 + ], + "score": 1.0, + "content": "denotes a", + "type": "text" + }, + { + "bbox": [ + 383, + 721, + 424, + 732 + ], + "score": 0.94, + "content": "K p \\times K p", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 719, + 489, + 735 + ], + "score": 1.0, + "content": "identity matrix.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + } + ], + "page_idx": 16, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 750, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "17", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 505, + 105 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 506, + 96 + ], + "score": 1.0, + "content": "where the second equality follows from (A2) and Lemma 3, the third equality is due to the definition", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 318, + 106 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 117, + 106 + ], + "score": 1.0, + "content": "of", + "type": "text" + }, + { + "bbox": [ + 117, + 95, + 138, + 105 + ], + "score": 0.88, + "content": "\\pi _ { i - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 138, + 94, + 318, + 106 + ], + "score": 1.0, + "content": "and the last equality follows from Lemma 3.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 506, + 106 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 110, + 271, + 122 + ], + "lines": [ + { + "bbox": [ + 106, + 109, + 272, + 123 + ], + "spans": [ + { + "bbox": [ + 106, + 109, + 272, + 123 + ], + "score": 1.0, + "content": "Similar to equation 19, we can show that", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 106, + 109, + 272, + 123 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 229, + 128, + 362, + 164 + ], + "lines": [ + { + "bbox": [ + 229, + 128, + 362, + 164 + ], + "spans": [ + { + "bbox": [ + 229, + 128, + 362, + 164 + ], + "score": 0.94, + "content": "\\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\operatorname { E } \\lVert \\pmb { \\eta } _ { i } \\rVert _ { \\infty } ^ { 3 } \\preceq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) .", + "type": "interline_equation", + "image_path": "7cccfdd817f82d536e29d24053e279a2d5351d6acdb36fccdbeda3d7b2444b63.jpg" + } + ] + } + ], + "index": 3.5, + "virtual_lines": [ + { + "bbox": [ + 229, + 128, + 362, + 146.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 229, + 146.0, + 362, + 164.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 169, + 450, + 182 + ], + "lines": [ + { + "bbox": [ + 106, + 168, + 449, + 183 + ], + "spans": [ + { + "bbox": [ + 106, + 168, + 371, + 183 + ], + "score": 1.0, + "content": "Using similar arguments in equation 20, we can show that for any", + "type": "text" + }, + { + "bbox": [ + 371, + 169, + 445, + 181 + ], + "score": 0.91, + "content": "1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 168, + 449, + 183 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 106, + 168, + 449, + 183 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 187, + 514, + 226 + ], + "lines": [ + { + "bbox": [ + 111, + 187, + 514, + 226 + ], + "spans": [ + { + "bbox": [ + 111, + 187, + 514, + 226 + ], + "score": 0.91, + "content": "\\sum _ { i = 1 } ^ { \\langle t \\kappa \\rangle } \\mathbf { E } \\{ \\xi _ { i } , _ { k _ { 1 } } \\xi _ { i , k _ { 2 } } ^ { \\top } | \\mathcal { F } _ { i - 1 } \\} = \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) ,", + "type": "interline_equation", + "image_path": "a22526e060b339971548b2a0ba264da6d480fb68c0114193f62238fe63d178d6.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 111, + 187, + 514, + 200.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 111, + 200.0, + 514, + 213.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 111, + 213.0, + 514, + 226.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 232, + 122, + 243 + ], + "lines": [ + { + "bbox": [ + 105, + 231, + 123, + 245 + ], + "spans": [ + { + "bbox": [ + 105, + 231, + 123, + 245 + ], + "score": 1.0, + "content": "Let", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 231, + 123, + 245 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 247, + 478, + 327 + ], + "lines": [ + { + "bbox": [ + 114, + 247, + 478, + 327 + ], + "spans": [ + { + "bbox": [ + 114, + 247, + 478, + 327 + ], + "score": 0.95, + "content": "\\begin{array} { c } { { V ( k _ { 1 } , k _ { 2 } ) = \\displaystyle \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi ^ { * } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\Sigma _ { a } ^ { - 1 } } } \\\\ { { = \\displaystyle \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } = \\displaystyle \\frac { \\sqrt { n ( t _ { k _ { 1 } } ) } } { \\sqrt { n ( t _ { k _ { 2 } } ) } } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } . } } \\end{array}", + "type": "interline_equation", + "image_path": "f5899ff4840a54c280022aa48afb27710306014db22dde8be26d4e9dba7f07b2.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 114, + 247, + 478, + 273.6666666666667 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 114, + 273.6666666666667, + 478, + 300.33333333333337 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 114, + 300.33333333333337, + 478, + 327.00000000000006 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 332, + 499, + 346 + ], + "lines": [ + { + "bbox": [ + 105, + 330, + 501, + 347 + ], + "spans": [ + { + "bbox": [ + 105, + 330, + 244, + 347 + ], + "score": 1.0, + "content": "Consider an arbitrary sequence of", + "type": "text" + }, + { + "bbox": [ + 244, + 333, + 266, + 343 + ], + "score": 0.9, + "content": "\\mathbb { R } ^ { p + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 267, + 330, + 299, + 347 + ], + "score": 1.0, + "content": "vectors", + "type": "text" + }, + { + "bbox": [ + 299, + 333, + 348, + 345 + ], + "score": 0.92, + "content": "\\left\\{ b _ { k } \\right\\} _ { 1 \\leq k \\leq K }", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 330, + 501, + 347 + ], + "score": 1.0, + "content": ". Under the given conditions, we have", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 330, + 501, + 347 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 117, + 350, + 513, + 432 + ], + "lines": [ + { + "bbox": [ + 117, + 350, + 513, + 432 + ], + "spans": [ + { + "bbox": [ + 117, + 350, + 513, + 432 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\left| b _ { k _ { 1 } } ^ { \\top } \\left( \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathsf { E } ( \\xi _ { i , k _ { 1 } } \\xi _ { 1 , k _ { 2 } } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V ( k _ { 1 } , k _ { 2 } ) \\right) b _ { k _ { 2 } } \\right| } \\\\ { \\ \\preceq } & { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathsf { E } ^ { \\mathcal { F } _ { i - 1 } } \\left\\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\right\\} \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\right\\| _ { 2 } \\| b _ { k _ { 1 } } \\| _ { 2 } \\| b _ { k _ { 2 } } \\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "0e096c097238e0e6d88f62d25ac67af9085fd1aa3d0fd2f273d82510aeaedd7d.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 117, + 350, + 513, + 377.3333333333333 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 117, + 377.3333333333333, + 513, + 404.66666666666663 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 117, + 404.66666666666663, + 513, + 431.99999999999994 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 437, + 193, + 448 + ], + "lines": [ + { + "bbox": [ + 106, + 436, + 194, + 449 + ], + "spans": [ + { + "bbox": [ + 106, + 436, + 171, + 449 + ], + "score": 1.0, + "content": "Define a matrix", + "type": "text" + }, + { + "bbox": [ + 172, + 437, + 181, + 447 + ], + "score": 0.83, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 182, + 436, + 194, + 449 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 436, + 194, + 449 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 452, + 399, + 507 + ], + "lines": [ + { + "bbox": [ + 192, + 452, + 399, + 507 + ], + "spans": [ + { + "bbox": [ + 192, + 452, + 399, + 507 + ], + "score": 0.94, + "content": "V = \\left( \\begin{array} { c c c c } { { V ( 1 , 1 ) } } & { { V ( 1 , 2 ) } } & { { . . . } } & { { V ( 1 , K ) } } \\\\ { { V ( 2 , 1 ) } } & { { V ( 2 , 2 ) } } & { { . . . } } & { { V ( 2 , K ) } } \\\\ { { \\vdots } } & { { \\vdots } } & { { } } & { { \\vdots } } \\\\ { { V ( K , 1 ) } } & { { V ( K , 2 ) } } & { { . . . } } & { { V ( K , K ) } } \\end{array} \\right) .", + "type": "interline_equation", + "image_path": "7235e14873273852a26c911377352b8d77b7ed0099727646f250964b143159de.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 192, + 452, + 399, + 470.3333333333333 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 192, + 470.3333333333333, + 399, + 488.66666666666663 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 192, + 488.66666666666663, + 399, + 506.99999999999994 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 512, + 164, + 524 + ], + "lines": [ + { + "bbox": [ + 105, + 512, + 165, + 524 + ], + "spans": [ + { + "bbox": [ + 105, + 512, + 165, + 524 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 512, + 165, + 524 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 528, + 514, + 571 + ], + "lines": [ + { + "bbox": [ + 111, + 528, + 514, + 571 + ], + "spans": [ + { + "bbox": [ + 111, + 528, + 514, + 571 + ], + "score": 0.9, + "content": "\\left| \\sum _ { i = 1 } ^ { \\boldsymbol { n } ( t _ { k } ) } \\mathrm { E } ( \\xi _ { i } \\xi _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right| \\Bigg | _ { 2 } \\preceq \\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\} \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\right\\| ^ { 2 } ,", + "type": "interline_equation", + "image_path": "5dee80761ce6abececc3c8d02f83e89ae1675bbb2c92be363b5288dccb8979f9.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 111, + 528, + 514, + 542.3333333333334 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 111, + 542.3333333333334, + 514, + 556.6666666666667 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 111, + 556.6666666666667, + 514, + 571.0000000000001 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 577, + 505, + 601 + ], + "lines": [ + { + "bbox": [ + 105, + 576, + 506, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 576, + 506, + 591 + ], + "score": 1.0, + "content": "Using similar arguments in proving equation 14, we can show the RHS of the above equation is", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 106, + 588, + 181, + 602 + ], + "spans": [ + { + "bbox": [ + 106, + 588, + 181, + 602 + ], + "score": 1.0, + "content": "upper bounded by", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 105, + 576, + 506, + 602 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 194, + 606, + 396, + 647 + ], + "lines": [ + { + "bbox": [ + 194, + 606, + 396, + 647 + ], + "spans": [ + { + "bbox": [ + 194, + 606, + 396, + 647 + ], + "score": 0.93, + "content": "\\epsilon _ { 0 } ^ { - 2 } q \\operatorname* { s u p } _ { \\stackrel { a \\in \\{ 0 , 1 \\} } { x \\in \\mathbb { X } , j \\geq n ( t _ { 1 } ) } } \\left| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right| ,", + "type": "interline_equation", + "image_path": "5fb420116bca17951a1c45bd6daa95cab6986ac8a2d82f1bd5a038f518615294.jpg" + } + ] + } + ], + "index": 27.5, + "virtual_lines": [ + { + "bbox": [ + 194, + 606, + 396, + 626.5 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 194, + 626.5, + 396, + 647.0 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 654, + 461, + 668 + ], + "lines": [ + { + "bbox": [ + 106, + 654, + 462, + 669 + ], + "spans": [ + { + "bbox": [ + 106, + 654, + 162, + 669 + ], + "score": 1.0, + "content": "and hence by", + "type": "text" + }, + { + "bbox": [ + 162, + 654, + 205, + 668 + ], + "score": 0.93, + "content": "\\epsilon _ { 0 } ^ { - 2 } q \\delta _ { n ( t _ { 1 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 654, + 306, + 669 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 306, + 655, + 377, + 667 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 654, + 462, + 669 + ], + "score": 1.0, + "content": ". Therefore, we have", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 106, + 654, + 462, + 669 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 674, + 410, + 714 + ], + "lines": [ + { + "bbox": [ + 180, + 674, + 410, + 714 + ], + "spans": [ + { + "bbox": [ + 180, + 674, + 410, + 714 + ], + "score": 0.94, + "content": "\\lambda _ { \\operatorname* { m i n } } \\left[ { V + \\delta _ { n ( t _ { 1 } ) } I _ { K p \\times K p } - \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\operatorname { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) } \\right] \\geq 0 ,", + "type": "interline_equation", + "image_path": "67865eb72d4624ee20ff0842ece592f35f83b92f3da34f9ccd8da22569610906.jpg" + } + ] + } + ], + "index": 30.5, + "virtual_lines": [ + { + "bbox": [ + 180, + 674, + 410, + 694.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 180, + 694.0, + 410, + 714.0 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 720, + 488, + 734 + ], + "lines": [ + { + "bbox": [ + 105, + 719, + 489, + 735 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 204, + 735 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 721, + 275, + 732 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 719, + 306, + 735 + ], + "score": 1.0, + "content": ", where", + "type": "text" + }, + { + "bbox": [ + 306, + 721, + 341, + 733 + ], + "score": 0.92, + "content": "I _ { K p \\times K p }", + "type": "inline_equation" + }, + { + "bbox": [ + 341, + 719, + 382, + 735 + ], + "score": 1.0, + "content": "denotes a", + "type": "text" + }, + { + "bbox": [ + 383, + 721, + 424, + 732 + ], + "score": 0.94, + "content": "K p \\times K p", + "type": "inline_equation" + }, + { + "bbox": [ + 425, + 719, + 489, + 735 + ], + "score": 1.0, + "content": "identity matrix.", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32, + "bbox_fs": [ + 105, + 719, + 489, + 735 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 194, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 194, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 194, + 94 + ], + "score": 1.0, + "content": "Moreover, notice that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 206, + 99, + 385, + 140 + ], + "lines": [ + { + "bbox": [ + 206, + 99, + 385, + 140 + ], + "spans": [ + { + "bbox": [ + 206, + 99, + 385, + 140 + ], + "score": 0.91, + "content": "\\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } \\left| { \\frac { 1 } { j } } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right|", + "type": "interline_equation", + "image_path": "ad871042cbcc0f56b719188c0aab9abefda2df7aae8218eae0d57ccab75d7068.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 206, + 99, + 385, + 119.5 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 206, + 119.5, + 385, + 140.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 146, + 397, + 159 + ], + "lines": [ + { + "bbox": [ + 105, + 145, + 398, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 145, + 256, + 160 + ], + "score": 1.0, + "content": "is bounded between 0 and 1. For any", + "type": "text" + }, + { + "bbox": [ + 256, + 147, + 299, + 159 + ], + "score": 0.94, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 145, + 334, + 160 + ], + "score": 1.0, + "content": "and any", + "type": "text" + }, + { + "bbox": [ + 334, + 148, + 358, + 157 + ], + "score": 0.9, + "content": "z > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 145, + 398, + 160 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 165, + 514, + 300 + ], + "lines": [ + { + "bbox": [ + 115, + 165, + 514, + 300 + ], + "spans": [ + { + "bbox": [ + 115, + 165, + 514, + 300 + ], + "score": 0.92, + "content": "\\begin{array} { r l } { { } } & { { } \\underset { x \\in \\{ 0 , 1 \\} } { \\operatorname* { s u p } } } \\\\ { { \\leq } } & { { } \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | } \\\\ { { + } } & { { } \\operatorname* { P r } ( \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | \\mathbb { 1 } ( \\underset { a \\leq t \\leq \\{ 0 , 1 \\} } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | | } \\\\ { + } & { { } \\operatorname* { P r } ( \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | > z ) . } \\end{array}", + "type": "interline_equation", + "image_path": "9d59005e04f2113b8e0c1f31210894d5f45f6f125d98590ede71d151ced794bb.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 115, + 165, + 514, + 210.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 115, + 210.0, + 514, + 255.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 115, + 255.0, + 514, + 300.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 305, + 254, + 317 + ], + "lines": [ + { + "bbox": [ + 106, + 304, + 254, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 304, + 254, + 318 + ], + "score": 1.0, + "content": "Under the given conditions, we have", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 148, + 323, + 440, + 364 + ], + "lines": [ + { + "bbox": [ + 148, + 323, + 440, + 364 + ], + "spans": [ + { + "bbox": [ + 148, + 323, + 440, + 364 + ], + "score": 0.93, + "content": "\\left. \\underset { x \\in \\mathbb { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { E } } \\right| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\Bigg | \\preceq \\delta _ { n ( t _ { 1 } ) } + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) .", + "type": "interline_equation", + "image_path": "4095d12bc1dde9c1b568da25d07c539bb8c0f636a62afaa7db54e9e89bc33b2b.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 148, + 323, + 440, + 336.6666666666667 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 148, + 336.6666666666667, + 440, + 350.33333333333337 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 148, + 350.33333333333337, + 440, + 364.00000000000006 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 370, + 192, + 381 + ], + "lines": [ + { + "bbox": [ + 106, + 369, + 192, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 192, + 382 + ], + "score": 1.0, + "content": "Therefore, we obtain", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 182, + 386, + 407, + 426 + ], + "lines": [ + { + "bbox": [ + 182, + 386, + 407, + 426 + ], + "spans": [ + { + "bbox": [ + 182, + 386, + 407, + 426 + ], + "score": 0.94, + "content": "\\mathbf { E } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathrm { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right\\| _ { 2 } \\preceq q n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) + q \\delta _ { n ( t _ { 1 } ) } ,", + "type": "interline_equation", + "image_path": "573f80cc74c50021a0b41f82b6b341d4f4c10f983b92ed4373e964d864116f01.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 182, + 386, + 407, + 406.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 182, + 406.0, + 407, + 426.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 431, + 117, + 440 + ], + "lines": [ + { + "bbox": [ + 106, + 431, + 118, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 118, + 442 + ], + "score": 1.0, + "content": "or", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 444, + 381, + 485 + ], + "lines": [ + { + "bbox": [ + 210, + 444, + 381, + 485 + ], + "spans": [ + { + "bbox": [ + 210, + 444, + 381, + 485 + ], + "score": 0.94, + "content": "\\mathbf { E } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathbf { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right\\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } ,", + "type": "interline_equation", + "image_path": "438773c3fef7b56a505e0d074dc1896cfbd7585d027812ac5de0c667da66c658.jpg" + } + ] + } + ], + "index": 15.5, + "virtual_lines": [ + { + "bbox": [ + 210, + 444, + 381, + 464.5 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 210, + 464.5, + 381, + 485.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 491, + 503, + 514 + ], + "lines": [ + { + "bbox": [ + 105, + 489, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 130, + 505 + ], + "score": 1.0, + "content": "since", + "type": "text" + }, + { + "bbox": [ + 130, + 491, + 208, + 504 + ], + "score": 0.9, + "content": "n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) \\ll \\delta _ { n ( t _ { 1 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 489, + 505, + 505 + ], + "score": 1.0, + "content": ". Combining equation 19 with equation 21, equation 23 and equation 24,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 501, + 390, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 390, + 515 + ], + "score": 1.0, + "content": "an application of Theorem 2.1 in Belloni & Oliveira (2018) yields that", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5 + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 518, + 430, + 552 + ], + "lines": [ + { + "bbox": [ + 186, + 518, + 430, + 552 + ], + "spans": [ + { + "bbox": [ + 186, + 518, + 430, + 552 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { | \\mathrm { E } \\psi ( \\mathcal { M } _ { n ( t _ { K } ) } ) - \\mathrm { E } \\psi ( N ( 0 , { \\pmb V } ) ) | } \\\\ { \\preceq } & { c _ { 0 } ( \\psi ) n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) + c _ { 2 } ( \\psi ) q \\delta _ { n ( t _ { 1 } ) } + c _ { 3 } ( \\psi ) q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) , } \\end{array}", + "type": "interline_equation", + "image_path": "56fcabf292d46d39a587a47c8f460d99923308fef0996f0a1c9c417789df9e3e.jpg" + } + ] + } + ], + "index": 19.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 518, + 430, + 535.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 186, + 535.0, + 430, + 552.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 557, + 284, + 569 + ], + "lines": [ + { + "bbox": [ + 106, + 556, + 284, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 556, + 244, + 570 + ], + "score": 1.0, + "content": "for any thrice differential function", + "type": "text" + }, + { + "bbox": [ + 245, + 557, + 263, + 569 + ], + "score": 0.9, + "content": "\\psi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 556, + 284, + 570 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 574, + 469, + 603 + ], + "lines": [ + { + "bbox": [ + 120, + 574, + 469, + 603 + ], + "spans": [ + { + "bbox": [ + 120, + 574, + 469, + 603 + ], + "score": 0.9, + "content": "c _ { 0 } ( \\psi ) = \\operatorname* { s u p } _ { z , z ^ { \\prime } \\in \\mathbb { R } ^ { p K } } | \\psi ( z ) - \\psi ( z ^ { \\prime } ) | \\mathrm { ~ a n d ~ } c _ { i } = \\operatorname* { s u p } _ { z \\in \\mathbb { R } ^ { p K } } \\sum _ { j _ { 1 } , \\cdots , j _ { i } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\cdots \\partial _ { j _ { i } } \\psi ( z ) | , i = 2 , 3 ,", + "type": "interline_equation", + "image_path": "7f5435e98450fb25a40eaafc886429b380896ef5d83951f1c52266c93bc353c7.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 120, + 574, + 469, + 583.6666666666666 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 120, + 583.6666666666666, + 469, + 593.3333333333333 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 120, + 593.3333333333333, + 469, + 602.9999999999999 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 609, + 504, + 633 + ], + "lines": [ + { + "bbox": [ + 104, + 608, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 104, + 608, + 133, + 623 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 610, + 162, + 623 + ], + "score": 0.93, + "content": "\\partial _ { j } g ( z )", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 608, + 279, + 623 + ], + "score": 1.0, + "content": "denotes the partial derivative", + "type": "text" + }, + { + "bbox": [ + 279, + 609, + 330, + 623 + ], + "score": 0.94, + "content": "\\partial g ( z ) / \\partial z ^ { ( j ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 608, + 397, + 623 + ], + "score": 1.0, + "content": "for any function", + "type": "text" + }, + { + "bbox": [ + 397, + 610, + 414, + 623 + ], + "score": 0.89, + "content": "\\mathbf { g } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 608, + 432, + 623 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 432, + 609, + 448, + 621 + ], + "score": 0.9, + "content": "z ^ { ( j ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 608, + 506, + 623 + ], + "score": 1.0, + "content": "stands for the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 621, + 180, + 633 + ], + "spans": [ + { + "bbox": [ + 107, + 622, + 112, + 633 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 621, + 169, + 633 + ], + "score": 1.0, + "content": "-th element of", + "type": "text" + }, + { + "bbox": [ + 170, + 624, + 176, + 631 + ], + "score": 0.78, + "content": "z", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 621, + 180, + 633 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5 + }, + { + "type": "text", + "bbox": [ + 107, + 637, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 504, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 122, + 652 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 639, + 142, + 651 + ], + "score": 0.91, + "content": "{ \\mathbb X } _ { k , 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 143, + 636, + 169, + 652 + ], + "score": 1.0, + "content": "be an", + "type": "text" + }, + { + "bbox": [ + 169, + 641, + 175, + 648 + ], + "score": 0.74, + "content": "\\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 636, + 204, + 652 + ], + "score": 1.0, + "content": "-net of", + "type": "text" + }, + { + "bbox": [ + 204, + 639, + 213, + 648 + ], + "score": 0.79, + "content": "\\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 636, + 360, + 652 + ], + "score": 1.0, + "content": "that satisfies the following: for any", + "type": "text" + }, + { + "bbox": [ + 360, + 639, + 389, + 649 + ], + "score": 0.9, + "content": "x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 636, + 466, + 652 + ], + "score": 1.0, + "content": ", there exists some", + "type": "text" + }, + { + "bbox": [ + 466, + 639, + 504, + 650 + ], + "score": 0.91, + "content": "x _ { 0 } \\in \\mathbb { X } _ { 0 }", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 649, + 475, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 145, + 664 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 145, + 651, + 207, + 664 + ], + "score": 0.92, + "content": "\\| x - x _ { 0 } \\| _ { 2 } \\leq \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 649, + 225, + 664 + ], + "score": 1.0, + "content": ". Set", + "type": "text" + }, + { + "bbox": [ + 226, + 650, + 289, + 664 + ], + "score": 0.93, + "content": "\\varepsilon = \\sqrt { d } / n ^ { 4 } ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 649, + 318, + 664 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 319, + 651, + 365, + 664 + ], + "score": 0.94, + "content": "\\mathbb { X } = [ 0 , 1 ] ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 649, + 439, + 664 + ], + "score": 1.0, + "content": ", there exists some", + "type": "text" + }, + { + "bbox": [ + 440, + 652, + 452, + 663 + ], + "score": 0.89, + "content": "{ \\mathbb X } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 649, + 475, + 664 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "interline_equation", + "bbox": [ + 262, + 669, + 328, + 684 + ], + "lines": [ + { + "bbox": [ + 262, + 669, + 328, + 684 + ], + "spans": [ + { + "bbox": [ + 262, + 669, + 328, + 684 + ], + "score": 0.91, + "content": "| \\mathbb { X } _ { 0 } | \\leq n ^ { 4 d } ( t _ { 1 } ) ,", + "type": "interline_equation", + "image_path": "3679f59ee70b238a0af1a12f4e27044b790ee1a0d8ff1e4c1af6a9a3112715f8.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 262, + 669, + 328, + 684 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 689, + 437, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 689, + 439, + 703 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 133, + 703 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 690, + 152, + 702 + ], + "score": 0.91, + "content": "| \\mathbb { X } _ { 0 } |", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 689, + 292, + 703 + ], + "score": 1.0, + "content": "denotes the number of elements in", + "type": "text" + }, + { + "bbox": [ + 293, + 690, + 305, + 702 + ], + "score": 0.88, + "content": "{ \\mathbb X } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 689, + 439, + 703 + ], + "score": 1.0, + "content": ". Under Condition (A3), we have", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 215, + 708, + 375, + 735 + ], + "lines": [ + { + "bbox": [ + 215, + 708, + 375, + 735 + ], + "spans": [ + { + "bbox": [ + 215, + 708, + 375, + 735 + ], + "score": 0.94, + "content": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\operatorname* { i n f } _ { x _ { 0 } \\in \\mathbb { X } _ { 0 } } \\| \\varphi ( x ) - \\varphi ( x _ { 0 } ) \\| _ { 2 } \\preceq \\frac { \\sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } .", + "type": "interline_equation", + "image_path": "b5f6c27b39a710f3a27c194c6262bc197aefc43185cf428decb7e824843d8e6c.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 215, + 708, + 375, + 735 + ], + "spans": [], + "index": 31 + } + ] + } + ], + "page_idx": 17, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 313, + 764 + ], + "score": 1.0, + "content": "18", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 194, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 194, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 194, + 94 + ], + "score": 1.0, + "content": "Moreover, notice that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 82, + 194, + 94 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 206, + 99, + 385, + 140 + ], + "lines": [ + { + "bbox": [ + 206, + 99, + 385, + 140 + ], + "spans": [ + { + "bbox": [ + 206, + 99, + 385, + 140 + ], + "score": 0.91, + "content": "\\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } \\left| { \\frac { 1 } { j } } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right|", + "type": "interline_equation", + "image_path": "ad871042cbcc0f56b719188c0aab9abefda2df7aae8218eae0d57ccab75d7068.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 206, + 99, + 385, + 119.5 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 206, + 119.5, + 385, + 140.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 146, + 397, + 159 + ], + "lines": [ + { + "bbox": [ + 105, + 145, + 398, + 160 + ], + "spans": [ + { + "bbox": [ + 105, + 145, + 256, + 160 + ], + "score": 1.0, + "content": "is bounded between 0 and 1. For any", + "type": "text" + }, + { + "bbox": [ + 256, + 147, + 299, + 159 + ], + "score": 0.94, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 145, + 334, + 160 + ], + "score": 1.0, + "content": "and any", + "type": "text" + }, + { + "bbox": [ + 334, + 148, + 358, + 157 + ], + "score": 0.9, + "content": "z > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 359, + 145, + 398, + 160 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 145, + 398, + 160 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 165, + 514, + 300 + ], + "lines": [ + { + "bbox": [ + 115, + 165, + 514, + 300 + ], + "spans": [ + { + "bbox": [ + 115, + 165, + 514, + 300 + ], + "score": 0.92, + "content": "\\begin{array} { r l } { { } } & { { } \\underset { x \\in \\{ 0 , 1 \\} } { \\operatorname* { s u p } } } \\\\ { { \\leq } } & { { } \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | } \\\\ { { + } } & { { } \\operatorname* { P r } ( \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | \\mathbb { 1 } ( \\underset { a \\leq t \\leq \\{ 0 , 1 \\} } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | | } \\\\ { + } & { { } \\operatorname* { P r } ( \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | > z ) . } \\end{array}", + "type": "interline_equation", + "image_path": "9d59005e04f2113b8e0c1f31210894d5f45f6f125d98590ede71d151ced794bb.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 115, + 165, + 514, + 210.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 115, + 210.0, + 514, + 255.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 115, + 255.0, + 514, + 300.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 305, + 254, + 317 + ], + "lines": [ + { + "bbox": [ + 106, + 304, + 254, + 318 + ], + "spans": [ + { + "bbox": [ + 106, + 304, + 254, + 318 + ], + "score": 1.0, + "content": "Under the given conditions, we have", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 106, + 304, + 254, + 318 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 148, + 323, + 440, + 364 + ], + "lines": [ + { + "bbox": [ + 148, + 323, + 440, + 364 + ], + "spans": [ + { + "bbox": [ + 148, + 323, + 440, + 364 + ], + "score": 0.93, + "content": "\\left. \\underset { x \\in \\mathbb { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { E } } \\right| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\Bigg | \\preceq \\delta _ { n ( t _ { 1 } ) } + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) .", + "type": "interline_equation", + "image_path": "4095d12bc1dde9c1b568da25d07c539bb8c0f636a62afaa7db54e9e89bc33b2b.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 148, + 323, + 440, + 336.6666666666667 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 148, + 336.6666666666667, + 440, + 350.33333333333337 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 148, + 350.33333333333337, + 440, + 364.00000000000006 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 370, + 192, + 381 + ], + "lines": [ + { + "bbox": [ + 106, + 369, + 192, + 382 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 192, + 382 + ], + "score": 1.0, + "content": "Therefore, we obtain", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 369, + 192, + 382 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 182, + 386, + 407, + 426 + ], + "lines": [ + { + "bbox": [ + 182, + 386, + 407, + 426 + ], + "spans": [ + { + "bbox": [ + 182, + 386, + 407, + 426 + ], + "score": 0.94, + "content": "\\mathbf { E } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathrm { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right\\| _ { 2 } \\preceq q n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) + q \\delta _ { n ( t _ { 1 } ) } ,", + "type": "interline_equation", + "image_path": "573f80cc74c50021a0b41f82b6b341d4f4c10f983b92ed4373e964d864116f01.jpg" + } + ] + } + ], + "index": 12.5, + "virtual_lines": [ + { + "bbox": [ + 182, + 386, + 407, + 406.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 182, + 406.0, + 407, + 426.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 431, + 117, + 440 + ], + "lines": [ + { + "bbox": [ + 106, + 431, + 118, + 442 + ], + "spans": [ + { + "bbox": [ + 106, + 431, + 118, + 442 + ], + "score": 1.0, + "content": "or", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 431, + 118, + 442 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 444, + 381, + 485 + ], + "lines": [ + { + "bbox": [ + 210, + 444, + 381, + 485 + ], + "spans": [ + { + "bbox": [ + 210, + 444, + 381, + 485 + ], + "score": 0.94, + "content": "\\mathbf { E } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathbf { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right\\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } ,", + "type": "interline_equation", + "image_path": "438773c3fef7b56a505e0d074dc1896cfbd7585d027812ac5de0c667da66c658.jpg" + } + ] + } + ], + "index": 15.5, + "virtual_lines": [ + { + "bbox": [ + 210, + 444, + 381, + 464.5 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 210, + 464.5, + 381, + 485.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 491, + 503, + 514 + ], + "lines": [ + { + "bbox": [ + 105, + 489, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 489, + 130, + 505 + ], + "score": 1.0, + "content": "since", + "type": "text" + }, + { + "bbox": [ + 130, + 491, + 208, + 504 + ], + "score": 0.9, + "content": "n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) \\ll \\delta _ { n ( t _ { 1 } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 209, + 489, + 505, + 505 + ], + "score": 1.0, + "content": ". Combining equation 19 with equation 21, equation 23 and equation 24,", + "type": "text" + } + ], + "index": 17 + }, + { + "bbox": [ + 105, + 501, + 390, + 515 + ], + "spans": [ + { + "bbox": [ + 105, + 501, + 390, + 515 + ], + "score": 1.0, + "content": "an application of Theorem 2.1 in Belloni & Oliveira (2018) yields that", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 17.5, + "bbox_fs": [ + 105, + 489, + 505, + 515 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 186, + 518, + 430, + 552 + ], + "lines": [ + { + "bbox": [ + 186, + 518, + 430, + 552 + ], + "spans": [ + { + "bbox": [ + 186, + 518, + 430, + 552 + ], + "score": 0.9, + "content": "\\begin{array} { r l } & { | \\mathrm { E } \\psi ( \\mathcal { M } _ { n ( t _ { K } ) } ) - \\mathrm { E } \\psi ( N ( 0 , { \\pmb V } ) ) | } \\\\ { \\preceq } & { c _ { 0 } ( \\psi ) n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) + c _ { 2 } ( \\psi ) q \\delta _ { n ( t _ { 1 } ) } + c _ { 3 } ( \\psi ) q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) , } \\end{array}", + "type": "interline_equation", + "image_path": "56fcabf292d46d39a587a47c8f460d99923308fef0996f0a1c9c417789df9e3e.jpg" + } + ] + } + ], + "index": 19.5, + "virtual_lines": [ + { + "bbox": [ + 186, + 518, + 430, + 535.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 186, + 535.0, + 430, + 552.0 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 557, + 284, + 569 + ], + "lines": [ + { + "bbox": [ + 106, + 556, + 284, + 570 + ], + "spans": [ + { + "bbox": [ + 106, + 556, + 244, + 570 + ], + "score": 1.0, + "content": "for any thrice differential function", + "type": "text" + }, + { + "bbox": [ + 245, + 557, + 263, + 569 + ], + "score": 0.9, + "content": "\\psi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 263, + 556, + 284, + 570 + ], + "score": 1.0, + "content": ", and", + "type": "text" + } + ], + "index": 21 + } + ], + "index": 21, + "bbox_fs": [ + 106, + 556, + 284, + 570 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 574, + 469, + 603 + ], + "lines": [ + { + "bbox": [ + 120, + 574, + 469, + 603 + ], + "spans": [ + { + "bbox": [ + 120, + 574, + 469, + 603 + ], + "score": 0.9, + "content": "c _ { 0 } ( \\psi ) = \\operatorname* { s u p } _ { z , z ^ { \\prime } \\in \\mathbb { R } ^ { p K } } | \\psi ( z ) - \\psi ( z ^ { \\prime } ) | \\mathrm { ~ a n d ~ } c _ { i } = \\operatorname* { s u p } _ { z \\in \\mathbb { R } ^ { p K } } \\sum _ { j _ { 1 } , \\cdots , j _ { i } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\cdots \\partial _ { j _ { i } } \\psi ( z ) | , i = 2 , 3 ,", + "type": "interline_equation", + "image_path": "7f5435e98450fb25a40eaafc886429b380896ef5d83951f1c52266c93bc353c7.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 120, + 574, + 469, + 583.6666666666666 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 120, + 583.6666666666666, + 469, + 593.3333333333333 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 120, + 593.3333333333333, + 469, + 602.9999999999999 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 609, + 504, + 633 + ], + "lines": [ + { + "bbox": [ + 104, + 608, + 506, + 623 + ], + "spans": [ + { + "bbox": [ + 104, + 608, + 133, + 623 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 610, + 162, + 623 + ], + "score": 0.93, + "content": "\\partial _ { j } g ( z )", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 608, + 279, + 623 + ], + "score": 1.0, + "content": "denotes the partial derivative", + "type": "text" + }, + { + "bbox": [ + 279, + 609, + 330, + 623 + ], + "score": 0.94, + "content": "\\partial g ( z ) / \\partial z ^ { ( j ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 608, + 397, + 623 + ], + "score": 1.0, + "content": "for any function", + "type": "text" + }, + { + "bbox": [ + 397, + 610, + 414, + 623 + ], + "score": 0.89, + "content": "\\mathbf { g } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 414, + 608, + 432, + 623 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 432, + 609, + 448, + 621 + ], + "score": 0.9, + "content": "z ^ { ( j ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 448, + 608, + 506, + 623 + ], + "score": 1.0, + "content": "stands for the", + "type": "text" + } + ], + "index": 25 + }, + { + "bbox": [ + 107, + 621, + 180, + 633 + ], + "spans": [ + { + "bbox": [ + 107, + 622, + 112, + 633 + ], + "score": 0.81, + "content": "j", + "type": "inline_equation" + }, + { + "bbox": [ + 113, + 621, + 169, + 633 + ], + "score": 1.0, + "content": "-th element of", + "type": "text" + }, + { + "bbox": [ + 170, + 624, + 176, + 631 + ], + "score": 0.78, + "content": "z", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 621, + 180, + 633 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 26 + } + ], + "index": 25.5, + "bbox_fs": [ + 104, + 608, + 506, + 633 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 637, + 504, + 664 + ], + "lines": [ + { + "bbox": [ + 105, + 636, + 504, + 652 + ], + "spans": [ + { + "bbox": [ + 105, + 636, + 122, + 652 + ], + "score": 1.0, + "content": "Let", + "type": "text" + }, + { + "bbox": [ + 123, + 639, + 142, + 651 + ], + "score": 0.91, + "content": "{ \\mathbb X } _ { k , 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 143, + 636, + 169, + 652 + ], + "score": 1.0, + "content": "be an", + "type": "text" + }, + { + "bbox": [ + 169, + 641, + 175, + 648 + ], + "score": 0.74, + "content": "\\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 176, + 636, + 204, + 652 + ], + "score": 1.0, + "content": "-net of", + "type": "text" + }, + { + "bbox": [ + 204, + 639, + 213, + 648 + ], + "score": 0.79, + "content": "\\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 213, + 636, + 360, + 652 + ], + "score": 1.0, + "content": "that satisfies the following: for any", + "type": "text" + }, + { + "bbox": [ + 360, + 639, + 389, + 649 + ], + "score": 0.9, + "content": "x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 389, + 636, + 466, + 652 + ], + "score": 1.0, + "content": ", there exists some", + "type": "text" + }, + { + "bbox": [ + 466, + 639, + 504, + 650 + ], + "score": 0.91, + "content": "x _ { 0 } \\in \\mathbb { X } _ { 0 }", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 105, + 649, + 475, + 664 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 145, + 664 + ], + "score": 1.0, + "content": "such that", + "type": "text" + }, + { + "bbox": [ + 145, + 651, + 207, + 664 + ], + "score": 0.92, + "content": "\\| x - x _ { 0 } \\| _ { 2 } \\leq \\varepsilon", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 649, + 225, + 664 + ], + "score": 1.0, + "content": ". Set", + "type": "text" + }, + { + "bbox": [ + 226, + 650, + 289, + 664 + ], + "score": 0.93, + "content": "\\varepsilon = \\sqrt { d } / n ^ { 4 } ( t _ { 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 290, + 649, + 318, + 664 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 319, + 651, + 365, + 664 + ], + "score": 0.94, + "content": "\\mathbb { X } = [ 0 , 1 ] ^ { d }", + "type": "inline_equation" + }, + { + "bbox": [ + 365, + 649, + 439, + 664 + ], + "score": 1.0, + "content": ", there exists some", + "type": "text" + }, + { + "bbox": [ + 440, + 652, + 452, + 663 + ], + "score": 0.89, + "content": "{ \\mathbb X } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 649, + 475, + 664 + ], + "score": 1.0, + "content": "with", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 636, + 504, + 664 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 262, + 669, + 328, + 684 + ], + "lines": [ + { + "bbox": [ + 262, + 669, + 328, + 684 + ], + "spans": [ + { + "bbox": [ + 262, + 669, + 328, + 684 + ], + "score": 0.91, + "content": "| \\mathbb { X } _ { 0 } | \\leq n ^ { 4 d } ( t _ { 1 } ) ,", + "type": "interline_equation", + "image_path": "3679f59ee70b238a0af1a12f4e27044b790ee1a0d8ff1e4c1af6a9a3112715f8.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 262, + 669, + 328, + 684 + ], + "spans": [], + "index": 29 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 689, + 437, + 702 + ], + "lines": [ + { + "bbox": [ + 106, + 689, + 439, + 703 + ], + "spans": [ + { + "bbox": [ + 106, + 689, + 133, + 703 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 690, + 152, + 702 + ], + "score": 0.91, + "content": "| \\mathbb { X } _ { 0 } |", + "type": "inline_equation" + }, + { + "bbox": [ + 152, + 689, + 292, + 703 + ], + "score": 1.0, + "content": "denotes the number of elements in", + "type": "text" + }, + { + "bbox": [ + 293, + 690, + 305, + 702 + ], + "score": 0.88, + "content": "{ \\mathbb X } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 689, + 439, + 703 + ], + "score": 1.0, + "content": ". Under Condition (A3), we have", + "type": "text" + } + ], + "index": 30 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 689, + 439, + 703 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 215, + 708, + 375, + 735 + ], + "lines": [ + { + "bbox": [ + 215, + 708, + 375, + 735 + ], + "spans": [ + { + "bbox": [ + 215, + 708, + 375, + 735 + ], + "score": 0.94, + "content": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\operatorname* { i n f } _ { x _ { 0 } \\in \\mathbb { X } _ { 0 } } \\| \\varphi ( x ) - \\varphi ( x _ { 0 } ) \\| _ { 2 } \\preceq \\frac { \\sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } .", + "type": "interline_equation", + "image_path": "b5f6c27b39a710f3a27c194c6262bc197aefc43185cf428decb7e824843d8e6c.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 215, + 708, + 375, + 735 + ], + "spans": [], + "index": 31 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 164, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 165, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 165, + 94 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 98, + 394, + 127 + ], + "lines": [ + { + "bbox": [ + 196, + 98, + 394, + 127 + ], + "spans": [ + { + "bbox": [ + 196, + 98, + 394, + 127 + ], + "score": 0.92, + "content": "\\operatorname* { s u p } _ { \\| \\nu \\| _ { 2 } = 1 } | \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\nu - \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) \\nu | \\preceq \\frac { \\sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } .", + "type": "interline_equation", + "image_path": "8d3f39bbbce5737299289409a80b88a62fde42a3a596baab6bef00056f169c62.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 196, + 98, + 394, + 127 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 132, + 504, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "Using similar arguments in showing equation 17, we can show the following event occurs with", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 142, + 254, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 183, + 156 + ], + "score": 1.0, + "content": "probability at least", + "type": "text" + }, + { + "bbox": [ + 183, + 143, + 249, + 156 + ], + "score": 0.93, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 142, + 254, + 156 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 161, + 380, + 177 + ], + "lines": [ + { + "bbox": [ + 210, + 161, + 380, + 177 + ], + "spans": [ + { + "bbox": [ + 210, + 161, + 380, + 177 + ], + "score": 0.9, + "content": "\\| B ^ { * } ( t _ { k } ) \\| _ { 2 } \\preceq q ^ { 1 / 2 } \\log ^ { 1 / 2 } n ( t _ { k } ) , ~ \\forall k \\geq 1 .", + "type": "interline_equation", + "image_path": "3952d45abef2334a6d7b79c5b88e8664ec6cfd9d4acc9f9b390f762333c9c02a.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 210, + 161, + 380, + 177 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 183, + 257, + 195 + ], + "lines": [ + { + "bbox": [ + 106, + 182, + 257, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 257, + 196 + ], + "score": 1.0, + "content": "This together with equation 27 yields", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 200, + 464, + 260 + ], + "lines": [ + { + "bbox": [ + 155, + 200, + 464, + 260 + ], + "spans": [ + { + "bbox": [ + 155, + 200, + 464, + 260 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\left| \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) \\right| } \\\\ { \\leq } & { \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\left| \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) \\right| \\preceq \\frac { q \\log n ^ { 1 / 2 } ( t _ { K } ) } { n ^ { 4 } ( t _ { 1 } ) } , } \\end{array}", + "type": "interline_equation", + "image_path": "06a76f0351a6ac04842346ee2484d51bdb7b3a1850193c25864c722b470f09ff.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 155, + 200, + 464, + 220.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 155, + 220.0, + 464, + 240.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 155, + 240.0, + 464, + 260.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 265, + 506, + 289 + ], + "lines": [ + { + "bbox": [ + 105, + 264, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 214, + 280 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 214, + 265, + 284, + 278 + ], + "score": 0.93, + "content": "\\mathrm { ~ 1 ~ - ~ } O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 264, + 463, + 280 + ], + "score": 1.0, + "content": ". Under the given conditions, we have", + "type": "text" + }, + { + "bbox": [ + 463, + 265, + 505, + 279 + ], + "score": 0.88, + "content": "n ( t _ { 1 } ) ~ \\gg", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 277, + 421, + 289 + ], + "spans": [ + { + "bbox": [ + 107, + 277, + 183, + 289 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } ( q , \\log n ( t _ { K } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 277, + 352, + 289 + ], + "score": 1.0, + "content": ". It follows that there exists some constant", + "type": "text" + }, + { + "bbox": [ + 352, + 277, + 380, + 287 + ], + "score": 0.9, + "content": "\\bar { c } ^ { * } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 277, + 421, + 289 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 294, + 451, + 323 + ], + "lines": [ + { + "bbox": [ + 138, + 294, + 451, + 323 + ], + "spans": [ + { + "bbox": [ + 138, + 294, + 451, + 323 + ], + "score": 0.9, + "content": "\\left. \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { \\ast } ( t _ { k } ) - \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) B ^ { \\ast } ( t _ { k } ) \\right. \\leq { \\vec { c } } ^ { \\ast } n ^ { - 2 } ( t _ { 1 } ) ,", + "type": "interline_equation", + "image_path": "14f734545f4fe0a929eb1ff16ad9e37c8152fed6840a03cfeb3ac252d049ef6a.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 138, + 294, + 451, + 323 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 273, + 342 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 273, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 204, + 344 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 329, + 269, + 342 + ], + "score": 0.91, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 328, + 273, + 344 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "text", + "bbox": [ + 106, + 347, + 135, + 358 + ], + "lines": [ + { + "bbox": [ + 105, + 345, + 136, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 136, + 360 + ], + "score": 1.0, + "content": "Define", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 362, + 422, + 398 + ], + "lines": [ + { + "bbox": [ + 168, + 362, + 422, + 398 + ], + "spans": [ + { + "bbox": [ + 168, + 362, + 422, + 398 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { z _ { k , - } ^ { * } = z _ { k } - \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} - \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , } \\\\ & { z _ { k , + } ^ { * } = z _ { k } + \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "155b86c7e0da21b2776f99df075b14bbdb0e9bbe1f73280a28c7a21f8be52c6e.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 168, + 362, + 422, + 374.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 168, + 374.0, + 422, + 386.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 168, + 386.0, + 422, + 398.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 401, + 298, + 414 + ], + "lines": [ + { + "bbox": [ + 106, + 400, + 299, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 400, + 299, + 415 + ], + "score": 1.0, + "content": "Combining equation 28 with equation 18 yields", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "interline_equation", + "bbox": [ + 160, + 419, + 458, + 505 + ], + "lines": [ + { + "bbox": [ + 160, + 419, + 458, + 505 + ], + "spans": [ + { + "bbox": [ + 160, + 419, + 458, + 505 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) . } \\end{array}", + "type": "interline_equation", + "image_path": "ed3b67cbac3ea0556546bcf778c7a3683ad1e5dfb864c3d6be172a5b75651845.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 160, + 419, + 458, + 447.6666666666667 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 160, + 447.6666666666667, + 458, + 476.33333333333337 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 160, + 476.33333333333337, + 458, + 505.00000000000006 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 510, + 505, + 549 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 153, + 525 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + }, + { + "bbox": [ + 153, + 510, + 355, + 525 + ], + "score": 0.9, + "content": "\\mathcal { M } _ { n ( t _ { K } ) } = \\{ B ^ { * } ( t _ { 1 } ) ^ { \\top } , B ^ { * } ( t _ { 2 } ) ^ { \\top } , \\cdot \\cdot \\cdot , B ^ { * } ( t _ { K } ) ^ { \\top } \\} ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 509, + 506, + 525 + ], + "score": 1.0, + "content": ". By equation 26 and Lemma 4, there", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 520, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 104, + 520, + 195, + 541 + ], + "score": 1.0, + "content": "exist a set of vectors", + "type": "text" + }, + { + "bbox": [ + 195, + 525, + 286, + 537 + ], + "score": 0.89, + "content": "d _ { 1 } , d _ { 2 } , \\dots , d _ { L } \\in \\mathbb { R } ^ { q K }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 520, + 311, + 541 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 311, + 525, + 375, + 538 + ], + "score": 0.75, + "content": "L \\leq n ^ { 4 d } ( t _ { 1 } ) K", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 520, + 379, + 541 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 380, + 524, + 478, + 538 + ], + "score": 0.61, + "content": "\\mathrm { m a x } _ { j } \\| d _ { j } \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 520, + 506, + 541 + ], + "score": 1.0, + "content": "and a", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 534, + 355, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 142, + 550 + ], + "score": 1.0, + "content": "function", + "type": "text" + }, + { + "bbox": [ + 142, + 537, + 159, + 549 + ], + "score": 0.91, + "content": "k ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 534, + 202, + 550 + ], + "score": 1.0, + "content": "that maps", + "type": "text" + }, + { + "bbox": [ + 202, + 537, + 246, + 549 + ], + "score": 0.92, + "content": "\\{ 1 , \\ldots , L \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 534, + 266, + 550 + ], + "score": 1.0, + "content": "into", + "type": "text" + }, + { + "bbox": [ + 266, + 537, + 313, + 549 + ], + "score": 0.92, + "content": "\\{ 1 , \\ldots , K \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 534, + 355, + 550 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 151, + 554, + 439, + 582 + ], + "lines": [ + { + "bbox": [ + 151, + 554, + 439, + 582 + ], + "spans": [ + { + "bbox": [ + 151, + 554, + 439, + 582 + ], + "score": 0.92, + "content": "\\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left\\{ \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\nu _ { k } \\right\\} = \\operatorname* { m a x } _ { 1 \\leq j \\leq L } \\{ d _ { j } ^ { \\top } \\mathcal { M } _ { n ( t _ { K } ) } - \\nu _ { k ( j ) } \\} ,", + "type": "interline_equation", + "image_path": "b8d39d25d3f8b062414fe4d8e7ce508fea9d6275e73fc19acb2a201d57f7b8f4.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 151, + 554, + 439, + 582 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 588, + 501, + 603 + ], + "lines": [ + { + "bbox": [ + 104, + 586, + 504, + 604 + ], + "spans": [ + { + "bbox": [ + 104, + 586, + 137, + 604 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 138, + 589, + 173, + 602 + ], + "score": 0.93, + "content": "\\{ \\nu _ { k } \\} _ { k = 1 } ^ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 586, + 210, + 604 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + }, + { + "bbox": [ + 211, + 590, + 235, + 601 + ], + "score": 0.82, + "content": "\\eta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 586, + 239, + 604 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 240, + 589, + 280, + 600 + ], + "score": 0.73, + "content": "m \\in \\mathbb { R } ^ { q K }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 586, + 370, + 604 + ], + "score": 1.0, + "content": ", consider the function", + "type": "text" + }, + { + "bbox": [ + 371, + 589, + 455, + 603 + ], + "score": 0.93, + "content": "\\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } : \\mathbb { R } ^ { q K } \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 586, + 504, + 604 + ], + "score": 1.0, + "content": ", defined as", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "interline_equation", + "bbox": [ + 184, + 608, + 407, + 648 + ], + "lines": [ + { + "bbox": [ + 184, + 608, + 407, + 648 + ], + "spans": [ + { + "bbox": [ + 184, + 608, + 407, + 648 + ], + "score": 0.94, + "content": "\\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) = \\frac { 1 } { \\eta } \\log \\left\\{ \\sum _ { j = 1 } ^ { L } \\exp [ \\eta \\{ d _ { j } ^ { \\top } m - \\eta \\nu _ { k ( j ) } \\} ] \\right\\} .", + "type": "interline_equation", + "image_path": "5cd807045e20b3081d1e3588272cb3080401d4484d3256a1975b8752377f1dea.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 184, + 608, + 407, + 628.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 184, + 628.0, + 407, + 648.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 653, + 225, + 665 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 226, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 226, + 668 + ], + "score": 1.0, + "content": "It has the following property:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 146, + 670, + 474, + 737 + ], + "lines": [ + { + "bbox": [ + 146, + 670, + 474, + 737 + ], + "spans": [ + { + "bbox": [ + 146, + 670, + 474, + 737 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} \\leq \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\leq \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} + \\eta ^ { - 1 } \\log L } \\\\ { \\leq } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} } \\\\ { = } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } [ d _ { j } ^ { \\top } m - \\{ \\nu _ { k ( j ) } - \\eta ^ { - 1 } \\log K - \\eta ^ { - 1 } 4 d \\log n ( t _ { 1 } ) \\} ] . } \\end{array}", + "type": "interline_equation", + "image_path": "43f57c14ff39f437f2b373f0320bb58bf18a4382279f82ae323c73337e8ee0a2.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 146, + 670, + 474, + 692.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 146, + 692.3333333333334, + 474, + 714.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 146, + 714.6666666666667, + 474, + 737.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + } + ], + "page_idx": 18, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "spans": [ + { + "bbox": [ + 299, + 750, + 312, + 765 + ], + "score": 1.0, + "content": "19", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 164, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 165, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 165, + 94 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 82, + 165, + 94 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 98, + 394, + 127 + ], + "lines": [ + { + "bbox": [ + 196, + 98, + 394, + 127 + ], + "spans": [ + { + "bbox": [ + 196, + 98, + 394, + 127 + ], + "score": 0.92, + "content": "\\operatorname* { s u p } _ { \\| \\nu \\| _ { 2 } = 1 } | \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\nu - \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) \\nu | \\preceq \\frac { \\sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } .", + "type": "interline_equation", + "image_path": "8d3f39bbbce5737299289409a80b88a62fde42a3a596baab6bef00056f169c62.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 196, + 98, + 394, + 127 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 132, + 504, + 156 + ], + "lines": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "spans": [ + { + "bbox": [ + 105, + 132, + 506, + 146 + ], + "score": 1.0, + "content": "Using similar arguments in showing equation 17, we can show the following event occurs with", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 105, + 142, + 254, + 156 + ], + "spans": [ + { + "bbox": [ + 105, + 142, + 183, + 156 + ], + "score": 1.0, + "content": "probability at least", + "type": "text" + }, + { + "bbox": [ + 183, + 143, + 249, + 156 + ], + "score": 0.93, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 142, + 254, + 156 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 132, + 506, + 156 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 210, + 161, + 380, + 177 + ], + "lines": [ + { + "bbox": [ + 210, + 161, + 380, + 177 + ], + "spans": [ + { + "bbox": [ + 210, + 161, + 380, + 177 + ], + "score": 0.9, + "content": "\\| B ^ { * } ( t _ { k } ) \\| _ { 2 } \\preceq q ^ { 1 / 2 } \\log ^ { 1 / 2 } n ( t _ { k } ) , ~ \\forall k \\geq 1 .", + "type": "interline_equation", + "image_path": "3952d45abef2334a6d7b79c5b88e8664ec6cfd9d4acc9f9b390f762333c9c02a.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 210, + 161, + 380, + 177 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 183, + 257, + 195 + ], + "lines": [ + { + "bbox": [ + 106, + 182, + 257, + 196 + ], + "spans": [ + { + "bbox": [ + 106, + 182, + 257, + 196 + ], + "score": 1.0, + "content": "This together with equation 27 yields", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 106, + 182, + 257, + 196 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 200, + 464, + 260 + ], + "lines": [ + { + "bbox": [ + 155, + 200, + 464, + 260 + ], + "spans": [ + { + "bbox": [ + 155, + 200, + 464, + 260 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\left| \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) \\right| } \\\\ { \\leq } & { \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\left| \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) \\right| \\preceq \\frac { q \\log n ^ { 1 / 2 } ( t _ { K } ) } { n ^ { 4 } ( t _ { 1 } ) } , } \\end{array}", + "type": "interline_equation", + "image_path": "06a76f0351a6ac04842346ee2484d51bdb7b3a1850193c25864c722b470f09ff.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 155, + 200, + 464, + 220.0 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 155, + 220.0, + 464, + 240.0 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 155, + 240.0, + 464, + 260.0 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 265, + 506, + 289 + ], + "lines": [ + { + "bbox": [ + 105, + 264, + 505, + 280 + ], + "spans": [ + { + "bbox": [ + 105, + 264, + 214, + 280 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 214, + 265, + 284, + 278 + ], + "score": 0.93, + "content": "\\mathrm { ~ 1 ~ - ~ } O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 284, + 264, + 463, + 280 + ], + "score": 1.0, + "content": ". Under the given conditions, we have", + "type": "text" + }, + { + "bbox": [ + 463, + 265, + 505, + 279 + ], + "score": 0.88, + "content": "n ( t _ { 1 } ) ~ \\gg", + "type": "inline_equation" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 277, + 421, + 289 + ], + "spans": [ + { + "bbox": [ + 107, + 277, + 183, + 289 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } ( q , \\log n ( t _ { K } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 183, + 277, + 352, + 289 + ], + "score": 1.0, + "content": ". It follows that there exists some constant", + "type": "text" + }, + { + "bbox": [ + 352, + 277, + 380, + 287 + ], + "score": 0.9, + "content": "\\bar { c } ^ { * } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 277, + 421, + 289 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 105, + 264, + 505, + 289 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 294, + 451, + 323 + ], + "lines": [ + { + "bbox": [ + 138, + 294, + 451, + 323 + ], + "spans": [ + { + "bbox": [ + 138, + 294, + 451, + 323 + ], + "score": 0.9, + "content": "\\left. \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { \\ast } ( t _ { k } ) - \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) B ^ { \\ast } ( t _ { k } ) \\right. \\leq { \\vec { c } } ^ { \\ast } n ^ { - 2 } ( t _ { 1 } ) ,", + "type": "interline_equation", + "image_path": "14f734545f4fe0a929eb1ff16ad9e37c8152fed6840a03cfeb3ac252d049ef6a.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 138, + 294, + 451, + 323 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 329, + 273, + 342 + ], + "lines": [ + { + "bbox": [ + 106, + 328, + 273, + 344 + ], + "spans": [ + { + "bbox": [ + 106, + 328, + 204, + 344 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 329, + 269, + 342 + ], + "score": 0.91, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 328, + 273, + 344 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 328, + 273, + 344 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 347, + 135, + 358 + ], + "lines": [ + { + "bbox": [ + 105, + 345, + 136, + 360 + ], + "spans": [ + { + "bbox": [ + 105, + 345, + 136, + 360 + ], + "score": 1.0, + "content": "Define", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 105, + 345, + 136, + 360 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 168, + 362, + 422, + 398 + ], + "lines": [ + { + "bbox": [ + 168, + 362, + 422, + 398 + ], + "spans": [ + { + "bbox": [ + 168, + 362, + 422, + 398 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { z _ { k , - } ^ { * } = z _ { k } - \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} - \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , } \\\\ & { z _ { k , + } ^ { * } = z _ { k } + \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "155b86c7e0da21b2776f99df075b14bbdb0e9bbe1f73280a28c7a21f8be52c6e.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 168, + 362, + 422, + 374.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 168, + 374.0, + 422, + 386.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 168, + 386.0, + 422, + 398.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 401, + 298, + 414 + ], + "lines": [ + { + "bbox": [ + 106, + 400, + 299, + 415 + ], + "spans": [ + { + "bbox": [ + 106, + 400, + 299, + 415 + ], + "score": 1.0, + "content": "Combining equation 28 with equation 18 yields", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 400, + 299, + 415 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 160, + 419, + 458, + 505 + ], + "lines": [ + { + "bbox": [ + 160, + 419, + 458, + 505 + ], + "spans": [ + { + "bbox": [ + 160, + 419, + 458, + 505 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) . } \\end{array}", + "type": "interline_equation", + "image_path": "ed3b67cbac3ea0556546bcf778c7a3683ad1e5dfb864c3d6be172a5b75651845.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 160, + 419, + 458, + 447.6666666666667 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 160, + 447.6666666666667, + 458, + 476.33333333333337 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 160, + 476.33333333333337, + 458, + 505.00000000000006 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 510, + 505, + 549 + ], + "lines": [ + { + "bbox": [ + 105, + 509, + 506, + 525 + ], + "spans": [ + { + "bbox": [ + 105, + 509, + 153, + 525 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + }, + { + "bbox": [ + 153, + 510, + 355, + 525 + ], + "score": 0.9, + "content": "\\mathcal { M } _ { n ( t _ { K } ) } = \\{ B ^ { * } ( t _ { 1 } ) ^ { \\top } , B ^ { * } ( t _ { 2 } ) ^ { \\top } , \\cdot \\cdot \\cdot , B ^ { * } ( t _ { K } ) ^ { \\top } \\} ^ { \\top }", + "type": "inline_equation" + }, + { + "bbox": [ + 355, + 509, + 506, + 525 + ], + "score": 1.0, + "content": ". By equation 26 and Lemma 4, there", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 104, + 520, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 104, + 520, + 195, + 541 + ], + "score": 1.0, + "content": "exist a set of vectors", + "type": "text" + }, + { + "bbox": [ + 195, + 525, + 286, + 537 + ], + "score": 0.89, + "content": "d _ { 1 } , d _ { 2 } , \\dots , d _ { L } \\in \\mathbb { R } ^ { q K }", + "type": "inline_equation" + }, + { + "bbox": [ + 287, + 520, + 311, + 541 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 311, + 525, + 375, + 538 + ], + "score": 0.75, + "content": "L \\leq n ^ { 4 d } ( t _ { 1 } ) K", + "type": "inline_equation" + }, + { + "bbox": [ + 375, + 520, + 379, + 541 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 380, + 524, + 478, + 538 + ], + "score": 0.61, + "content": "\\mathrm { m a x } _ { j } \\| d _ { j } \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 520, + 506, + 541 + ], + "score": 1.0, + "content": "and a", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 106, + 534, + 355, + 550 + ], + "spans": [ + { + "bbox": [ + 106, + 534, + 142, + 550 + ], + "score": 1.0, + "content": "function", + "type": "text" + }, + { + "bbox": [ + 142, + 537, + 159, + 549 + ], + "score": 0.91, + "content": "k ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 159, + 534, + 202, + 550 + ], + "score": 1.0, + "content": "that maps", + "type": "text" + }, + { + "bbox": [ + 202, + 537, + 246, + 549 + ], + "score": 0.92, + "content": "\\{ 1 , \\ldots , L \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 247, + 534, + 266, + 550 + ], + "score": 1.0, + "content": "into", + "type": "text" + }, + { + "bbox": [ + 266, + 537, + 313, + 549 + ], + "score": 0.92, + "content": "\\{ 1 , \\ldots , K \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 534, + 355, + 550 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 22, + "bbox_fs": [ + 104, + 509, + 506, + 550 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 151, + 554, + 439, + 582 + ], + "lines": [ + { + "bbox": [ + 151, + 554, + 439, + 582 + ], + "spans": [ + { + "bbox": [ + 151, + 554, + 439, + 582 + ], + "score": 0.92, + "content": "\\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left\\{ \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\nu _ { k } \\right\\} = \\operatorname* { m a x } _ { 1 \\leq j \\leq L } \\{ d _ { j } ^ { \\top } \\mathcal { M } _ { n ( t _ { K } ) } - \\nu _ { k ( j ) } \\} ,", + "type": "interline_equation", + "image_path": "b8d39d25d3f8b062414fe4d8e7ce508fea9d6275e73fc19acb2a201d57f7b8f4.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 151, + 554, + 439, + 582 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 588, + 501, + 603 + ], + "lines": [ + { + "bbox": [ + 104, + 586, + 504, + 604 + ], + "spans": [ + { + "bbox": [ + 104, + 586, + 137, + 604 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 138, + 589, + 173, + 602 + ], + "score": 0.93, + "content": "\\{ \\nu _ { k } \\} _ { k = 1 } ^ { K }", + "type": "inline_equation" + }, + { + "bbox": [ + 173, + 586, + 210, + 604 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + }, + { + "bbox": [ + 211, + 590, + 235, + 601 + ], + "score": 0.82, + "content": "\\eta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 236, + 586, + 239, + 604 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 240, + 589, + 280, + 600 + ], + "score": 0.73, + "content": "m \\in \\mathbb { R } ^ { q K }", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 586, + 370, + 604 + ], + "score": 1.0, + "content": ", consider the function", + "type": "text" + }, + { + "bbox": [ + 371, + 589, + 455, + 603 + ], + "score": 0.93, + "content": "\\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } : \\mathbb { R } ^ { q K } \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 586, + 504, + 604 + ], + "score": 1.0, + "content": ", defined as", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25, + "bbox_fs": [ + 104, + 586, + 504, + 604 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 184, + 608, + 407, + 648 + ], + "lines": [ + { + "bbox": [ + 184, + 608, + 407, + 648 + ], + "spans": [ + { + "bbox": [ + 184, + 608, + 407, + 648 + ], + "score": 0.94, + "content": "\\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) = \\frac { 1 } { \\eta } \\log \\left\\{ \\sum _ { j = 1 } ^ { L } \\exp [ \\eta \\{ d _ { j } ^ { \\top } m - \\eta \\nu _ { k ( j ) } \\} ] \\right\\} .", + "type": "interline_equation", + "image_path": "5cd807045e20b3081d1e3588272cb3080401d4484d3256a1975b8752377f1dea.jpg" + } + ] + } + ], + "index": 26.5, + "virtual_lines": [ + { + "bbox": [ + 184, + 608, + 407, + 628.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 184, + 628.0, + 407, + 648.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 653, + 225, + 665 + ], + "lines": [ + { + "bbox": [ + 105, + 651, + 226, + 668 + ], + "spans": [ + { + "bbox": [ + 105, + 651, + 226, + 668 + ], + "score": 1.0, + "content": "It has the following property:", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 651, + 226, + 668 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 146, + 670, + 474, + 737 + ], + "lines": [ + { + "bbox": [ + 146, + 670, + 474, + 737 + ], + "spans": [ + { + "bbox": [ + 146, + 670, + 474, + 737 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} \\leq \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\leq \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} + \\eta ^ { - 1 } \\log L } \\\\ { \\leq } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} } \\\\ { = } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } [ d _ { j } ^ { \\top } m - \\{ \\nu _ { k ( j ) } - \\eta ^ { - 1 } \\log K - \\eta ^ { - 1 } 4 d \\log n ( t _ { 1 } ) \\} ] . } \\end{array}", + "type": "interline_equation", + "image_path": "43f57c14ff39f437f2b373f0320bb58bf18a4382279f82ae323c73337e8ee0a2.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 146, + 670, + 474, + 692.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 146, + 692.3333333333334, + 474, + 714.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 146, + 714.6666666666667, + 474, + 737.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 164, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 165, + 94 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 165, + 94 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 94, + 514, + 181 + ], + "lines": [ + { + "bbox": [ + 114, + 94, + 514, + 181 + ], + "spans": [ + { + "bbox": [ + 114, + 94, + 514, + 181 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} \\leq \\operatorname* { P r } \\left\\{ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } ^ { * * } \\left( \\mathcal { M } _ { n ( t _ { K } ) } \\right) \\leq 0 } , \\quad \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\Omega , } } \\\\ & \\right\\{ \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } & { \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\Omega ~ } \\\\ { = } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - ( z _ { k , - } ^ { * } - 3 \\delta ) \\right) \\leq 3 \\delta \\right\\} \\geq \\operatorname* { P r } \\left\\{ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } \\left( \\mathcal { M } _ { n ( t _ { K } ) } \\right) \\leq 3 \\delta \\right\\} } \\end{array}", + "type": "interline_equation", + "image_path": "706b671fd42870ce47b188c633eac5ece57a7180d43a844b798c25a2c0be0888.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 114, + 94, + 514, + 123.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 114, + 123.0, + 514, + 152.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 114, + 152.0, + 514, + 181.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 182, + 133, + 192 + ], + "lines": [ + { + "bbox": [ + 105, + 180, + 135, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 135, + 194 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 161, + 194, + 335, + 209 + ], + "lines": [], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 161, + 194, + 335, + 209 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 113, + 210, + 433, + 222 + ], + "lines": [ + { + "bbox": [ + 111, + 210, + 436, + 223 + ], + "spans": [ + { + "bbox": [ + 111, + 210, + 159, + 223 + ], + "score": 1.0, + "content": "The value of", + "type": "text" + }, + { + "bbox": [ + 159, + 211, + 165, + 221 + ], + "score": 0.81, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 210, + 436, + 223 + ], + "score": 1.0, + "content": "will be specified later. In addition, with some calculations, we have", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 225, + 460, + 505 + ], + "lines": [ + { + "bbox": [ + 145, + 225, + 460, + 505 + ], + "spans": [ + { + "bbox": [ + 145, + 225, + 460, + 505 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to - \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\rho \\mathrm { e r f } ( \\phi _ { \\mathrm { c a i r c } } ^ { 2 } - \\phi _ { \\mathrm { c a c i r c } } ^ { 2 } ) , } \\\\ { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to - \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\rho \\mathrm { e r f } ( \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) , } \\\\ { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) ) , } \\\\ { \\phantom { = } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) ) , } \\\\ { \\phantom { = } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a c c } } ^ { 2 } ) ) ^ { \\frac { 1 } { \\sqrt { 2 } } } , } \\\\ \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac \\end{array}", + "type": "interline_equation", + "image_path": "caeebe71ea528fa4e1da56a329240f3fb7744f71fb5b1a54ec1516336c33e37f.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 145, + 225, + 460, + 318.3333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 145, + 318.3333333333333, + 460, + 411.66666666666663 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 145, + 411.66666666666663, + 460, + 504.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 502, + 287, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 502, + 288, + 517 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 131, + 517 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 131, + 502, + 224, + 516 + ], + "score": 0.84, + "content": "\\operatorname* { m a x } _ { i } \\| d _ { i } \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 502, + 288, + 517 + ], + "score": 1.0, + "content": ", we obtain that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 518, + 439, + 575 + ], + "lines": [ + { + "bbox": [ + 149, + 518, + 439, + 575 + ], + "spans": [ + { + "bbox": [ + 149, + 518, + 439, + 575 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } { { \\sum _ { j } | \\partial _ { j } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 } , \\sum _ { j _ { 1 } , j _ { 2 } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le 2 \\eta \\epsilon _ { 0 } ^ { - 2 } q , } } \\\\ & { } & { \\ \\sum _ { j _ { 1 } , j _ { 2 } , j _ { 3 } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\partial _ { j _ { 3 } } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le 6 \\eta ^ { 2 } \\epsilon _ { 0 } ^ { - 3 } q ^ { 3 / 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "8470b59a097e03c6a0cad5fd174cc11f15d8f6e0774f502c7ce567ce991afb0d.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 149, + 518, + 439, + 537.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 149, + 537.0, + 439, + 556.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 149, + 556.0, + 439, + 575.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 582, + 502, + 608 + ], + "lines": [ + { + "bbox": [ + 106, + 581, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 321, + 595 + ], + "score": 1.0, + "content": "By Lemma 5.1 of Chernozhukov et al. (2016), for any", + "type": "text" + }, + { + "bbox": [ + 321, + 583, + 345, + 593 + ], + "score": 0.9, + "content": "\\delta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 581, + 454, + 595 + ], + "score": 1.0, + "content": ", there exists some function", + "type": "text" + }, + { + "bbox": [ + 455, + 582, + 505, + 595 + ], + "score": 0.9, + "content": "\\mathbf { g } _ { \\delta } ( \\cdot ) : \\mathbb { R } \\to", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 594, + 495, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 115, + 605 + ], + "score": 0.8, + "content": "\\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 594, + 136, + 609 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 137, + 594, + 352, + 609 + ], + "score": 0.27, + "content": "\\| \\mathbf { g } _ { \\delta } ^ { \\prime } \\| _ { \\infty } \\leq \\delta ^ { - 1 } , \\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime } \\| _ { \\infty } \\leq K _ { 0 } \\delta ^ { - 2 } , \\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime \\prime } \\| _ { \\infty } \\leq K _ { 0 } \\delta ^ { - 3 } \\mathbf { f }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 594, + 422, + 609 + ], + "score": 1.0, + "content": "or some constant", + "type": "text" + }, + { + "bbox": [ + 422, + 596, + 454, + 606 + ], + "score": 0.91, + "content": "K _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 594, + 495, + 609 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5 + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 164, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 623, + 165, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 165, + 637 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 163, + 638, + 426, + 653 + ], + "lines": [ + { + "bbox": [ + 163, + 638, + 426, + 653 + ], + "spans": [ + { + "bbox": [ + 163, + 638, + 426, + 653 + ], + "score": 0.87, + "content": "\\mathbb { I } ( \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le 0 ) \\le \\mathtt { g o } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le \\mathbb { I } ( \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le 3 \\delta ) ,", + "type": "interline_equation", + "image_path": "e3cf614eaf9df5f7f37e22642e46de67601baabbb7fc2b21cbdb3b206f83f6a8.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 163, + 638, + 426, + 653 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 655, + 503, + 678 + ], + "lines": [ + { + "bbox": [ + 105, + 653, + 506, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 653, + 139, + 669 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 139, + 655, + 183, + 666 + ], + "score": 0.92, + "content": "m \\in \\mathbb { R } ^ { q K }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 653, + 506, + 669 + ], + "score": 1.0, + "content": ". Combining this together with equation 30, equation 31 and equation 32, we", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 667, + 152, + 679 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 152, + 679 + ], + "score": 1.0, + "content": "obtain that", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 678, + 481, + 737 + ], + "lines": [ + { + "bbox": [ + 147, + 678, + 481, + 737 + ], + "spans": [ + { + "bbox": [ + 147, + 678, + 481, + 737 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} \\leq \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } \\big ( \\mathcal { M } _ { n ( t _ { K } ) } \\big ) , } \\\\ & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} \\geq \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } \\big ( \\mathcal { M } _ { n ( t _ { K } ) } \\big ) . } \\end{array}", + "type": "interline_equation", + "image_path": "7a0db8e3014f46354462660dfe94f5f4bb80afe0f94e84c2fbc141e9e1960cd8.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 147, + 678, + 481, + 697.6666666666666 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 147, + 697.6666666666666, + 481, + 717.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 147, + 717.3333333333333, + 481, + 736.9999999999999 + ], + "spans": [], + "index": 22 + } + ] + } + ], + "page_idx": 19, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 312, + 761 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "20", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 164, + 93 + ], + "lines": [ + { + "bbox": [ + 105, + 82, + 165, + 94 + ], + "spans": [ + { + "bbox": [ + 105, + 82, + 165, + 94 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 82, + 165, + 94 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 94, + 514, + 181 + ], + "lines": [ + { + "bbox": [ + 114, + 94, + 514, + 181 + ], + "spans": [ + { + "bbox": [ + 114, + 94, + 514, + 181 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} \\leq \\operatorname* { P r } \\left\\{ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } ^ { * * } \\left( \\mathcal { M } _ { n ( t _ { K } ) } \\right) \\leq 0 } , \\quad \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\Omega , } } \\\\ & \\right\\{ \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } & { \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\Omega ~ } \\\\ { = } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - ( z _ { k , - } ^ { * } - 3 \\delta ) \\right) \\leq 3 \\delta \\right\\} \\geq \\operatorname* { P r } \\left\\{ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } \\left( \\mathcal { M } _ { n ( t _ { K } ) } \\right) \\leq 3 \\delta \\right\\} } \\end{array}", + "type": "interline_equation", + "image_path": "706b671fd42870ce47b188c633eac5ece57a7180d43a844b798c25a2c0be0888.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 114, + 94, + 514, + 123.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 114, + 123.0, + 514, + 152.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 114, + 152.0, + 514, + 181.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 182, + 133, + 192 + ], + "lines": [ + { + "bbox": [ + 105, + 180, + 135, + 194 + ], + "spans": [ + { + "bbox": [ + 105, + 180, + 135, + 194 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 180, + 135, + 194 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 161, + 194, + 335, + 209 + ], + "lines": [], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 161, + 194, + 335, + 209 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 113, + 210, + 433, + 222 + ], + "lines": [ + { + "bbox": [ + 111, + 210, + 436, + 223 + ], + "spans": [ + { + "bbox": [ + 111, + 210, + 159, + 223 + ], + "score": 1.0, + "content": "The value of", + "type": "text" + }, + { + "bbox": [ + 159, + 211, + 165, + 221 + ], + "score": 0.81, + "content": "\\delta", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 210, + 436, + 223 + ], + "score": 1.0, + "content": "will be specified later. In addition, with some calculations, we have", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 111, + 210, + 436, + 223 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 225, + 460, + 505 + ], + "lines": [ + { + "bbox": [ + 145, + 225, + 460, + 505 + ], + "spans": [ + { + "bbox": [ + 145, + 225, + 460, + 505 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to - \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\rho \\mathrm { e r f } ( \\phi _ { \\mathrm { c a i r c } } ^ { 2 } - \\phi _ { \\mathrm { c a c i r c } } ^ { 2 } ) , } \\\\ { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to - \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\rho \\mathrm { e r f } ( \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) , } \\\\ { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) ) , } \\\\ { \\phantom { = } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) ) , } \\\\ { \\phantom { = } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a c c } } ^ { 2 } ) ) ^ { \\frac { 1 } { \\sqrt { 2 } } } , } \\\\ \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac \\end{array}", + "type": "interline_equation", + "image_path": "caeebe71ea528fa4e1da56a329240f3fb7744f71fb5b1a54ec1516336c33e37f.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 145, + 225, + 460, + 318.3333333333333 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 145, + 318.3333333333333, + 460, + 411.66666666666663 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 145, + 411.66666666666663, + 460, + 504.99999999999994 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 502, + 287, + 516 + ], + "lines": [ + { + "bbox": [ + 105, + 502, + 288, + 517 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 131, + 517 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 131, + 502, + 224, + 516 + ], + "score": 0.84, + "content": "\\operatorname* { m a x } _ { i } \\| d _ { i } \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 225, + 502, + 288, + 517 + ], + "score": 1.0, + "content": ", we obtain that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 502, + 288, + 517 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 149, + 518, + 439, + 575 + ], + "lines": [ + { + "bbox": [ + 149, + 518, + 439, + 575 + ], + "spans": [ + { + "bbox": [ + 149, + 518, + 439, + 575 + ], + "score": 0.93, + "content": "\\begin{array} { r l r } { { \\sum _ { j } | \\partial _ { j } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 } , \\sum _ { j _ { 1 } , j _ { 2 } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le 2 \\eta \\epsilon _ { 0 } ^ { - 2 } q , } } \\\\ & { } & { \\ \\sum _ { j _ { 1 } , j _ { 2 } , j _ { 3 } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\partial _ { j _ { 3 } } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le 6 \\eta ^ { 2 } \\epsilon _ { 0 } ^ { - 3 } q ^ { 3 / 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "8470b59a097e03c6a0cad5fd174cc11f15d8f6e0774f502c7ce567ce991afb0d.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 149, + 518, + 439, + 537.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 149, + 537.0, + 439, + 556.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 149, + 556.0, + 439, + 575.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 582, + 502, + 608 + ], + "lines": [ + { + "bbox": [ + 106, + 581, + 505, + 595 + ], + "spans": [ + { + "bbox": [ + 106, + 581, + 321, + 595 + ], + "score": 1.0, + "content": "By Lemma 5.1 of Chernozhukov et al. (2016), for any", + "type": "text" + }, + { + "bbox": [ + 321, + 583, + 345, + 593 + ], + "score": 0.9, + "content": "\\delta > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 581, + 454, + 595 + ], + "score": 1.0, + "content": ", there exists some function", + "type": "text" + }, + { + "bbox": [ + 455, + 582, + 505, + 595 + ], + "score": 0.9, + "content": "\\mathbf { g } _ { \\delta } ( \\cdot ) : \\mathbb { R } \\to", + "type": "inline_equation" + } + ], + "index": 14 + }, + { + "bbox": [ + 106, + 594, + 495, + 609 + ], + "spans": [ + { + "bbox": [ + 106, + 596, + 115, + 605 + ], + "score": 0.8, + "content": "\\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 115, + 594, + 136, + 609 + ], + "score": 1.0, + "content": "with", + "type": "text" + }, + { + "bbox": [ + 137, + 594, + 352, + 609 + ], + "score": 0.27, + "content": "\\| \\mathbf { g } _ { \\delta } ^ { \\prime } \\| _ { \\infty } \\leq \\delta ^ { - 1 } , \\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime } \\| _ { \\infty } \\leq K _ { 0 } \\delta ^ { - 2 } , \\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime \\prime } \\| _ { \\infty } \\leq K _ { 0 } \\delta ^ { - 3 } \\mathbf { f }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 594, + 422, + 609 + ], + "score": 1.0, + "content": "or some constant", + "type": "text" + }, + { + "bbox": [ + 422, + 596, + 454, + 606 + ], + "score": 0.91, + "content": "K _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 455, + 594, + 495, + 609 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 14.5, + "bbox_fs": [ + 106, + 581, + 505, + 609 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 624, + 164, + 636 + ], + "lines": [ + { + "bbox": [ + 105, + 623, + 165, + 637 + ], + "spans": [ + { + "bbox": [ + 105, + 623, + 165, + 637 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 623, + 165, + 637 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 163, + 638, + 426, + 653 + ], + "lines": [ + { + "bbox": [ + 163, + 638, + 426, + 653 + ], + "spans": [ + { + "bbox": [ + 163, + 638, + 426, + 653 + ], + "score": 0.87, + "content": "\\mathbb { I } ( \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le 0 ) \\le \\mathtt { g o } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le \\mathbb { I } ( \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le 3 \\delta ) ,", + "type": "interline_equation", + "image_path": "e3cf614eaf9df5f7f37e22642e46de67601baabbb7fc2b21cbdb3b206f83f6a8.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 163, + 638, + 426, + 653 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 655, + 503, + 678 + ], + "lines": [ + { + "bbox": [ + 105, + 653, + 506, + 669 + ], + "spans": [ + { + "bbox": [ + 105, + 653, + 139, + 669 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 139, + 655, + 183, + 666 + ], + "score": 0.92, + "content": "m \\in \\mathbb { R } ^ { q K }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 653, + 506, + 669 + ], + "score": 1.0, + "content": ". Combining this together with equation 30, equation 31 and equation 32, we", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 667, + 152, + 679 + ], + "spans": [ + { + "bbox": [ + 106, + 667, + 152, + 679 + ], + "score": 1.0, + "content": "obtain that", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 105, + 653, + 506, + 679 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 678, + 481, + 737 + ], + "lines": [ + { + "bbox": [ + 147, + 678, + 481, + 737 + ], + "spans": [ + { + "bbox": [ + 147, + 678, + 481, + 737 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} \\leq \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } \\big ( \\mathcal { M } _ { n ( t _ { K } ) } \\big ) , } \\\\ & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} \\geq \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } \\big ( \\mathcal { M } _ { n ( t _ { K } ) } \\big ) . } \\end{array}", + "type": "interline_equation", + "image_path": "7a0db8e3014f46354462660dfe94f5f4bb80afe0f94e84c2fbc141e9e1960cd8.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 147, + 678, + 481, + 697.6666666666666 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 147, + 697.6666666666666, + 481, + 717.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 147, + 717.3333333333333, + 481, + 736.9999999999999 + ], + "spans": [], + "index": 22 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 338, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 339, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 195, + 97 + ], + "score": 1.0, + "content": "Consider the function", + "type": "text" + }, + { + "bbox": [ + 195, + 83, + 249, + 96 + ], + "score": 0.94, + "content": "\\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 80, + 339, + 97 + ], + "score": 1.0, + "content": ". Apparently, we have", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 100, + 360, + 122 + ], + "lines": [ + { + "bbox": [ + 231, + 100, + 360, + 122 + ], + "spans": [ + { + "bbox": [ + 231, + 100, + 360, + 122 + ], + "score": 0.92, + "content": "\\operatorname* { s u p } _ { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } c _ { 0 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\leq 1 .", + "type": "interline_equation", + "image_path": "094a877e5d6e3f659d5f4ab3057d5f6839dfd5ed209e3ec8378bcc77448a589e.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 231, + 100, + 360, + 122 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 128, + 243, + 140 + ], + "lines": [ + { + "bbox": [ + 105, + 127, + 244, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 244, + 140 + ], + "score": 1.0, + "content": "By equation 33, we can show that", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2 + }, + { + "type": "interline_equation", + "bbox": [ + 170, + 144, + 432, + 193 + ], + "lines": [ + { + "bbox": [ + 170, + 144, + 432, + 193 + ], + "spans": [ + { + "bbox": [ + 170, + 144, + 432, + 193 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } & { } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } c _ { 2 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq \\delta ^ { - 2 } q + \\delta ^ { - 1 } \\eta q , } \\\\ & { } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } c _ { 3 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq \\delta ^ { - 3 } q ^ { 3 / 2 } + \\delta ^ { - 2 } \\eta q ^ { 3 / 2 } + \\delta ^ { - 1 } \\eta ^ { 2 } q ^ { 3 / 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "d14f6dafa13046597541e753fdf5f3fd3a73fef3635c4dd6749bf42d01ff8709.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 170, + 144, + 432, + 160.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 170, + 160.33333333333334, + 432, + 176.66666666666669 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 170, + 176.66666666666669, + 432, + 193.00000000000003 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 198, + 297, + 211 + ], + "lines": [ + { + "bbox": [ + 106, + 197, + 297, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 197, + 122, + 213 + ], + "score": 1.0, + "content": "Set", + "type": "text" + }, + { + "bbox": [ + 122, + 198, + 251, + 211 + ], + "score": 0.93, + "content": "\\delta = \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 197, + 297, + 213 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 159, + 216, + 432, + 240 + ], + "lines": [ + { + "bbox": [ + 159, + 216, + 432, + 240 + ], + "spans": [ + { + "bbox": [ + 159, + 216, + 432, + 240 + ], + "score": 0.89, + "content": "\\operatorname* { s u p } _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } c _ { i } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq q ^ { i / 2 } \\eta ^ { i } \\{ \\log ^ { i } K + \\log ^ { i } n ( t _ { 1 } ) \\} , i = 2 , 3 .", + "type": "interline_equation", + "image_path": "bc770cef0ee9ac6d62cba6a7d4fe070509f1d1e62e10ddda0afb1d8cd315d5c1.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 159, + 216, + 432, + 240 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 245, + 401, + 258 + ], + "lines": [ + { + "bbox": [ + 105, + 244, + 401, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 401, + 260 + ], + "score": 1.0, + "content": "Combining equation 37 together with equation 25 and equation 36 yields", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 261, + 495, + 303 + ], + "lines": [ + { + "bbox": [ + 123, + 261, + 495, + 303 + ], + "spans": [ + { + "bbox": [ + 123, + 261, + 495, + 303 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } \\vert \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( \\mathcal { M } _ { n ( t _ { K } ) } ) - \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , V ) ) \\vert } \\\\ { \\overset { \\mathrm { } } { \\to } } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } N + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } N + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "c9f8a9fdbff597f4342a28226060d4c489253ed20e0a93e3d297dd456a0dea5e.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 123, + 261, + 495, + 275.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 123, + 275.0, + 495, + 289.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 123, + 289.0, + 495, + 303.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 306, + 324, + 318 + ], + "lines": [ + { + "bbox": [ + 106, + 305, + 323, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 305, + 323, + 320 + ], + "score": 1.0, + "content": "This together with equation 34 and equation 35 yields", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 322, + 495, + 415 + ], + "lines": [ + { + "bbox": [ + 124, + 322, + 495, + 415 + ], + "spans": [ + { + "bbox": [ + 124, + 322, + 495, + 415 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} - \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * } \\} _ { k } } ( N ( 0 , V ) ) \\quad ( 3 ) } \\\\ { \\preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) , } \\\\ & { \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * } \\} _ { k } } ( N ( 0 , V ) ) - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} \\quad ( 3 ) } \\\\ { \\preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "9abc401e8d8d32cf2d15f3b65b268568e0271e235b7abd237b0453b8ef3db119.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 124, + 322, + 495, + 353.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 124, + 353.0, + 495, + 384.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 124, + 384.0, + 495, + 415.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 418, + 303, + 430 + ], + "lines": [ + { + "bbox": [ + 106, + 417, + 304, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 417, + 304, + 432 + ], + "score": 1.0, + "content": "Similar to equation 31-equation 35, we can show", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 434, + 497, + 535 + ], + "lines": [ + { + "bbox": [ + 119, + 434, + 497, + 535 + ], + "spans": [ + { + "bbox": [ + 119, + 434, + 497, + 535 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { { \\mathrm { E g } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq \\operatorname* { P r } \\left( \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq 3 \\delta \\right) } \\\\ { \\leq } & { \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * } \\} \\leq 3 \\delta \\right) = \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * * } \\} \\leq 0 \\right) , } \\\\ & { { \\mathrm { E g } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\geq \\operatorname* { P r } \\left( \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq 0 \\right) } \\\\ { \\geq } & { \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , - } ^ { * * * } \\} \\leq 0 \\right) , } \\end{array}", + "type": "interline_equation", + "image_path": "7200221d4ede3a511354fbf645b54028e435bb43450528d9c9e6584480dc82a6.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 119, + 434, + 497, + 467.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 119, + 467.6666666666667, + 497, + 501.33333333333337 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 119, + 501.33333333333337, + 497, + 535.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 133, + 550 + ], + "lines": [ + { + "bbox": [ + 105, + 537, + 135, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 135, + 551 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 105, + 555, + 520, + 588 + ], + "lines": [ + { + "bbox": [ + 124, + 555, + 519, + 571 + ], + "spans": [ + { + "bbox": [ + 124, + 555, + 519, + 571 + ], + "score": 0.28, + "content": "= z _ { k , + } ^ { * } + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} + 3 \\delta \\mathrm { ~ a n d ~ } z _ { k , - } ^ { * * * } = z _ { k , - } ^ { * } - \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} - 3 \\delta ,", + "type": "inline_equation", + "image_path": "179592b13636558dd47fb6c2cee6e03e3641acd2869966c8faf42a6340f8b538.jpg" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 576, + 295, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 141, + 589 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 141, + 577, + 148, + 586 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 576, + 230, + 589 + ], + "score": 1.0, + "content": ". Notice that for any", + "type": "text" + }, + { + "bbox": [ + 230, + 576, + 255, + 588 + ], + "score": 0.92, + "content": "\\{ \\nu _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 576, + 295, + 589 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "interline_equation", + "bbox": [ + 108, + 593, + 482, + 621 + ], + "lines": [ + { + "bbox": [ + 108, + 593, + 482, + 621 + ], + "spans": [ + { + "bbox": [ + 108, + 593, + 482, + 621 + ], + "score": 0.91, + "content": "\\operatorname* { P r } \\left\\{ \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left( \\operatorname* { s u p } _ { x \\in \\Xi _ { 0 } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k } \\right) \\leq 0 \\right\\} = \\operatorname* { P r } \\left( \\operatorname* { m a x } _ { 1 \\leq j \\leq L } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - \\nu _ { k ( j ) } \\} \\leq 0 \\right) .", + "type": "interline_equation", + "image_path": "89cf405c52b003e24b8ec1070abcc10a8137a413a973d904356e5eba3dfd5b55.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 108, + 593, + 482, + 621 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 626, + 324, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 324, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 324, + 640 + ], + "score": 1.0, + "content": "This together with equation 38 and equation 39 yields", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 642, + 514, + 736 + ], + "lines": [ + { + "bbox": [ + 111, + 642, + 514, + 736 + ], + "spans": [ + { + "bbox": [ + 111, + 642, + 514, + 736 + ], + "score": 0.92, + "content": "\\begin{array} { r l r } & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\preceq \\ 3 n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) \\delta _ { n ( t _ { 1 } ) } } \\\\ & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\preceq \\lambda n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } , } \\end{array}", + "type": "interline_equation", + "image_path": "0d3947b1be72ef2768f083311df693501e972ff85a5a696510cdc5b8bc280c17.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 111, + 642, + 514, + 673.3333333333334 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 111, + 673.3333333333334, + 514, + 704.6666666666667 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 111, + 704.6666666666667, + 514, + 736.0000000000001 + ], + "spans": [], + "index": 27 + } + ] + } + ], + "page_idx": 20, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 761 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "21", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 338, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 80, + 339, + 97 + ], + "spans": [ + { + "bbox": [ + 106, + 80, + 195, + 97 + ], + "score": 1.0, + "content": "Consider the function", + "type": "text" + }, + { + "bbox": [ + 195, + 83, + 249, + 96 + ], + "score": 0.94, + "content": "\\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 249, + 80, + 339, + 97 + ], + "score": 1.0, + "content": ". Apparently, we have", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 80, + 339, + 97 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 100, + 360, + 122 + ], + "lines": [ + { + "bbox": [ + 231, + 100, + 360, + 122 + ], + "spans": [ + { + "bbox": [ + 231, + 100, + 360, + 122 + ], + "score": 0.92, + "content": "\\operatorname* { s u p } _ { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } c _ { 0 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\leq 1 .", + "type": "interline_equation", + "image_path": "094a877e5d6e3f659d5f4ab3057d5f6839dfd5ed209e3ec8378bcc77448a589e.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 231, + 100, + 360, + 122 + ], + "spans": [], + "index": 1 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 128, + 243, + 140 + ], + "lines": [ + { + "bbox": [ + 105, + 127, + 244, + 140 + ], + "spans": [ + { + "bbox": [ + 105, + 127, + 244, + 140 + ], + "score": 1.0, + "content": "By equation 33, we can show that", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 2, + "bbox_fs": [ + 105, + 127, + 244, + 140 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 170, + 144, + 432, + 193 + ], + "lines": [ + { + "bbox": [ + 170, + 144, + 432, + 193 + ], + "spans": [ + { + "bbox": [ + 170, + 144, + 432, + 193 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } & { } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } c _ { 2 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq \\delta ^ { - 2 } q + \\delta ^ { - 1 } \\eta q , } \\\\ & { } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } c _ { 3 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq \\delta ^ { - 3 } q ^ { 3 / 2 } + \\delta ^ { - 2 } \\eta q ^ { 3 / 2 } + \\delta ^ { - 1 } \\eta ^ { 2 } q ^ { 3 / 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "d14f6dafa13046597541e753fdf5f3fd3a73fef3635c4dd6749bf42d01ff8709.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 170, + 144, + 432, + 160.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 170, + 160.33333333333334, + 432, + 176.66666666666669 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 170, + 176.66666666666669, + 432, + 193.00000000000003 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 198, + 297, + 211 + ], + "lines": [ + { + "bbox": [ + 106, + 197, + 297, + 213 + ], + "spans": [ + { + "bbox": [ + 106, + 197, + 122, + 213 + ], + "score": 1.0, + "content": "Set", + "type": "text" + }, + { + "bbox": [ + 122, + 198, + 251, + 211 + ], + "score": 0.93, + "content": "\\delta = \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 197, + 297, + 213 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 197, + 297, + 213 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 159, + 216, + 432, + 240 + ], + "lines": [ + { + "bbox": [ + 159, + 216, + 432, + 240 + ], + "spans": [ + { + "bbox": [ + 159, + 216, + 432, + 240 + ], + "score": 0.89, + "content": "\\operatorname* { s u p } _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } c _ { i } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq q ^ { i / 2 } \\eta ^ { i } \\{ \\log ^ { i } K + \\log ^ { i } n ( t _ { 1 } ) \\} , i = 2 , 3 .", + "type": "interline_equation", + "image_path": "bc770cef0ee9ac6d62cba6a7d4fe070509f1d1e62e10ddda0afb1d8cd315d5c1.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 159, + 216, + 432, + 240 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 245, + 401, + 258 + ], + "lines": [ + { + "bbox": [ + 105, + 244, + 401, + 260 + ], + "spans": [ + { + "bbox": [ + 105, + 244, + 401, + 260 + ], + "score": 1.0, + "content": "Combining equation 37 together with equation 25 and equation 36 yields", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 105, + 244, + 401, + 260 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 123, + 261, + 495, + 303 + ], + "lines": [ + { + "bbox": [ + 123, + 261, + 495, + 303 + ], + "spans": [ + { + "bbox": [ + 123, + 261, + 495, + 303 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } \\vert \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( \\mathcal { M } _ { n ( t _ { K } ) } ) - \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , V ) ) \\vert } \\\\ { \\overset { \\mathrm { } } { \\to } } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } N + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } N + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "c9f8a9fdbff597f4342a28226060d4c489253ed20e0a93e3d297dd456a0dea5e.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 123, + 261, + 495, + 275.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 123, + 275.0, + 495, + 289.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 123, + 289.0, + 495, + 303.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 306, + 324, + 318 + ], + "lines": [ + { + "bbox": [ + 106, + 305, + 323, + 320 + ], + "spans": [ + { + "bbox": [ + 106, + 305, + 323, + 320 + ], + "score": 1.0, + "content": "This together with equation 34 and equation 35 yields", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 106, + 305, + 323, + 320 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 322, + 495, + 415 + ], + "lines": [ + { + "bbox": [ + 124, + 322, + 495, + 415 + ], + "spans": [ + { + "bbox": [ + 124, + 322, + 495, + 415 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} - \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * } \\} _ { k } } ( N ( 0 , V ) ) \\quad ( 3 ) } \\\\ { \\preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) , } \\\\ & { \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * } \\} _ { k } } ( N ( 0 , V ) ) - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} \\quad ( 3 ) } \\\\ { \\preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "9abc401e8d8d32cf2d15f3b65b268568e0271e235b7abd237b0453b8ef3db119.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 124, + 322, + 495, + 353.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 124, + 353.0, + 495, + 384.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 124, + 384.0, + 495, + 415.0 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 418, + 303, + 430 + ], + "lines": [ + { + "bbox": [ + 106, + 417, + 304, + 432 + ], + "spans": [ + { + "bbox": [ + 106, + 417, + 304, + 432 + ], + "score": 1.0, + "content": "Similar to equation 31-equation 35, we can show", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 106, + 417, + 304, + 432 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 434, + 497, + 535 + ], + "lines": [ + { + "bbox": [ + 119, + 434, + 497, + 535 + ], + "spans": [ + { + "bbox": [ + 119, + 434, + 497, + 535 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { { \\mathrm { E g } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq \\operatorname* { P r } \\left( \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq 3 \\delta \\right) } \\\\ { \\leq } & { \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * } \\} \\leq 3 \\delta \\right) = \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * * } \\} \\leq 0 \\right) , } \\\\ & { { \\mathrm { E g } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\geq \\operatorname* { P r } \\left( \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq 0 \\right) } \\\\ { \\geq } & { \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , - } ^ { * * * } \\} \\leq 0 \\right) , } \\end{array}", + "type": "interline_equation", + "image_path": "7200221d4ede3a511354fbf645b54028e435bb43450528d9c9e6584480dc82a6.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 119, + 434, + 497, + 467.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 119, + 467.6666666666667, + 497, + 501.33333333333337 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 119, + 501.33333333333337, + 497, + 535.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 539, + 133, + 550 + ], + "lines": [ + { + "bbox": [ + 105, + 537, + 135, + 551 + ], + "spans": [ + { + "bbox": [ + 105, + 537, + 135, + 551 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 537, + 135, + 551 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 555, + 520, + 588 + ], + "lines": [ + { + "bbox": [ + 124, + 555, + 519, + 571 + ], + "spans": [ + { + "bbox": [ + 124, + 555, + 519, + 571 + ], + "score": 0.28, + "content": "= z _ { k , + } ^ { * } + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} + 3 \\delta \\mathrm { ~ a n d ~ } z _ { k , - } ^ { * * * } = z _ { k , - } ^ { * } - \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} - 3 \\delta ,", + "type": "inline_equation", + "image_path": "179592b13636558dd47fb6c2cee6e03e3641acd2869966c8faf42a6340f8b538.jpg" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 576, + 295, + 589 + ], + "spans": [ + { + "bbox": [ + 106, + 576, + 141, + 589 + ], + "score": 1.0, + "content": "for each", + "type": "text" + }, + { + "bbox": [ + 141, + 577, + 148, + 586 + ], + "score": 0.79, + "content": "k", + "type": "inline_equation" + }, + { + "bbox": [ + 148, + 576, + 230, + 589 + ], + "score": 1.0, + "content": ". Notice that for any", + "type": "text" + }, + { + "bbox": [ + 230, + 576, + 255, + 588 + ], + "score": 0.92, + "content": "\\{ \\nu _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 255, + 576, + 295, + 589 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 106, + 555, + 519, + 589 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 108, + 593, + 482, + 621 + ], + "lines": [ + { + "bbox": [ + 108, + 593, + 482, + 621 + ], + "spans": [ + { + "bbox": [ + 108, + 593, + 482, + 621 + ], + "score": 0.91, + "content": "\\operatorname* { P r } \\left\\{ \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left( \\operatorname* { s u p } _ { x \\in \\Xi _ { 0 } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k } \\right) \\leq 0 \\right\\} = \\operatorname* { P r } \\left( \\operatorname* { m a x } _ { 1 \\leq j \\leq L } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - \\nu _ { k ( j ) } \\} \\leq 0 \\right) .", + "type": "interline_equation", + "image_path": "89cf405c52b003e24b8ec1070abcc10a8137a413a973d904356e5eba3dfd5b55.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 108, + 593, + 482, + 621 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 626, + 324, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 324, + 640 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 324, + 640 + ], + "score": 1.0, + "content": "This together with equation 38 and equation 39 yields", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 624, + 324, + 640 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 642, + 514, + 736 + ], + "lines": [ + { + "bbox": [ + 111, + 642, + 514, + 736 + ], + "spans": [ + { + "bbox": [ + 111, + 642, + 514, + 736 + ], + "score": 0.92, + "content": "\\begin{array} { r l r } & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\preceq \\ 3 n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) \\delta _ { n ( t _ { 1 } ) } } \\\\ & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\preceq \\lambda n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } , } \\end{array}", + "type": "interline_equation", + "image_path": "0d3947b1be72ef2768f083311df693501e972ff85a5a696510cdc5b8bc280c17.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 111, + 642, + 514, + 673.3333333333334 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 111, + 673.3333333333334, + 514, + 704.6666666666667 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 111, + 704.6666666666667, + 514, + 736.0000000000001 + ], + "spans": [], + "index": 27 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 282, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 282, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 282, + 95 + ], + "score": 1.0, + "content": "In view of equation 29, we have shown that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 97, + 513, + 191 + ], + "lines": [ + { + "bbox": [ + 111, + 97, + 513, + 191 + ], + "spans": [ + { + "bbox": [ + 111, + 97, + 513, + 191 + ], + "score": 0.92, + "content": "\\begin{array} { r l r } & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} - \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\qquad \\preceq \\lambda \\mathrm { \\Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) , } \\\\ & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} - \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { m p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\qquad \\preceq \\lambda \\mathrm { \\Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "f3cbf46334ffb88e7d7895b71d58ec13067029780a6e7e07d0edc49df17269e6.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 111, + 97, + 513, + 128.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 128.33333333333334, + 513, + 159.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 159.66666666666669, + 513, + 191.00000000000003 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 195, + 508, + 232 + ], + "lines": [ + { + "bbox": [ + 104, + 193, + 507, + 213 + ], + "spans": [ + { + "bbox": [ + 104, + 193, + 197, + 213 + ], + "score": 1.0, + "content": "The covariance matrix", + "type": "text" + }, + { + "bbox": [ + 198, + 196, + 247, + 208 + ], + "score": 0.92, + "content": "\\operatorname { C o v } ( G ( t _ { k } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 193, + 294, + 213 + ], + "score": 1.0, + "content": "is given by", + "type": "text" + }, + { + "bbox": [ + 294, + 195, + 384, + 210 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\sum _ { a \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 193, + 507, + 213 + ], + "score": 1.0, + "content": "and is nonsingular by Lemma", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 208, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 202, + 222 + ], + "score": 1.0, + "content": "4. In addition, we have", + "type": "text" + }, + { + "bbox": [ + 202, + 209, + 295, + 221 + ], + "score": 0.92, + "content": "\\| \\varphi ( x ) \\| _ { 2 } \\geq \\bar { c } , \\forall x \\in \\mathbb { X } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 208, + 506, + 222 + ], + "score": 1.0, + "content": ", by Condition A3. Thus, there exists some constant", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 220, + 175, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 135, + 231 + ], + "score": 0.9, + "content": "c _ { * } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 220, + 175, + 231 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 179, + 235, + 412, + 279 + ], + "lines": [ + { + "bbox": [ + 179, + 235, + 412, + 279 + ], + "spans": [ + { + "bbox": [ + 179, + 235, + 412, + 279 + ], + "score": 0.94, + "content": "c _ { * } \\leq \\varphi ^ { \\top } ( x ) \\left( \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } \\right) ^ { 1 / 2 } \\varphi ( x ) , \\forall x \\in \\mathbb { X } _ { 0 } .", + "type": "interline_equation", + "image_path": "f2e147a1164f6f226793440b2c9e630859aa23e409bb5f4cc4f330de0d376ddf.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 179, + 235, + 412, + 249.66666666666666 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 179, + 249.66666666666666, + 412, + 264.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 179, + 264.3333333333333, + 412, + 279.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 282, + 351, + 295 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 351, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 351, + 296 + ], + "score": 1.0, + "content": "By Theorem 1 of Chernozhukov et al. (2017), we obtain that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 299, + 540, + 347 + ], + "lines": [ + { + "bbox": [ + 138, + 299, + 540, + 347 + ], + "spans": [ + { + "bbox": [ + 138, + 299, + 540, + 347 + ], + "score": 0.86, + "content": "\\begin{array} { r l } & { \\operatorname* { p } _ { \\mathrm { { r } } } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} } \\\\ & { \\ l ^ { - 1 } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 3 / 2 } + q \\delta _ { n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 1 / 2 } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} } \\end{array}", + "type": "interline_equation", + "image_path": "80bb55b8595d580f8a724cd3ea854ca803a5ce984e04d39df56334fd877c55d3.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 138, + 299, + 540, + 315.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 138, + 315.0, + 540, + 331.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 138, + 331.0, + 540, + 347.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 349, + 173, + 361 + ], + "lines": [ + { + "bbox": [ + 106, + 349, + 173, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 173, + 362 + ], + "score": 1.0, + "content": "Thus, we obtain", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 365, + 540, + 428 + ], + "lines": [ + { + "bbox": [ + 138, + 365, + 540, + 428 + ], + "spans": [ + { + "bbox": [ + 138, + 365, + 540, + 428 + ], + "score": 0.83, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathfrak { X } } { \\operatorname* { m a x } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathfrak { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} \\bigg | } \\\\ & { \\ i ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) } \\\\ & { \\ j ^ { - 1 } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 3 / 2 } + q \\delta _ { n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 1 / 2 } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} } \\end{array}", + "type": "interline_equation", + "image_path": "baffea1771cd54328b90e59df4f5c3314d00ce0db24212055e1c6a2264160b9e.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 138, + 365, + 540, + 386.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 138, + 386.0, + 540, + 407.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 138, + 407.0, + 540, + 428.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 433, + 504, + 458 + ], + "lines": [ + { + "bbox": [ + 104, + 430, + 507, + 450 + ], + "spans": [ + { + "bbox": [ + 104, + 430, + 137, + 450 + ], + "score": 1.0, + "content": "Setting", + "type": "text" + }, + { + "bbox": [ + 137, + 433, + 478, + 448 + ], + "score": 0.81, + "content": "\\eta = \\operatorname* { m i n } ( q ^ { - 3 / 4 } n ^ { 1 / 8 } ( t _ { 1 } ) \\log ^ { - 3 / 8 } \\{ K n ( t _ { 1 } ) \\} , q ^ { - 1 } n ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { - \\alpha _ { 0 } / 3 - 1 / 6 } \\{ K n ( t _ { 1 } ) \\} )", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 430, + 507, + 450 + ], + "score": 1.0, + "content": "yields", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 446, + 308, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 308, + 459 + ], + "score": 1.0, + "content": "the desired results. The proof is hence completed.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5 + }, + { + "type": "title", + "bbox": [ + 107, + 471, + 219, + 482 + ], + "lines": [ + { + "bbox": [ + 105, + 470, + 221, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 221, + 484 + ], + "score": 1.0, + "content": "E.3 PROOF OF LEMMA 3", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 491, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 237, + 505 + ], + "score": 1.0, + "content": "The assertion trivially holds for", + "type": "text" + }, + { + "bbox": [ + 238, + 492, + 264, + 503 + ], + "score": 0.89, + "content": "j = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 491, + 377, + 505 + ], + "score": 1.0, + "content": ". We prove it holds for any", + "type": "text" + }, + { + "bbox": [ + 378, + 492, + 404, + 503 + ], + "score": 0.89, + "content": "j \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 491, + 505, + 505 + ], + "score": 1.0, + "content": ", by induction. By (A2),", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 502, + 506, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 141, + 516 + ], + "score": 1.0, + "content": "we have", + "type": "text" + }, + { + "bbox": [ + 141, + 502, + 264, + 515 + ], + "score": 0.84, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , \\overset { \\cdot } { Y _ { j } ^ { * } } ( 1 ) ) \\overset { } { \\bot } \\overset { } { A _ { 1 } } | X _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 502, + 292, + 516 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 293, + 503, + 468, + 515 + ], + "score": 0.35, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp ( X _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 502, + 506, + 516 + ], + "score": 1.0, + "content": ", this fur-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 514, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 157, + 528 + ], + "score": 1.0, + "content": "ther implies", + "type": "text" + }, + { + "bbox": [ + 157, + 515, + 264, + 529 + ], + "score": 0.87, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp { \\cal A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 514, + 309, + 528 + ], + "score": 1.0, + "content": "and hence", + "type": "text" + }, + { + "bbox": [ + 309, + 515, + 501, + 528 + ], + "score": 0.85, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp ( X _ { 1 } , A _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 514, + 506, + 528 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 526, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 526, + 152, + 541 + ], + "score": 1.0, + "content": "By (A1),", + "type": "text" + }, + { + "bbox": [ + 152, + 528, + 164, + 538 + ], + "score": 0.85, + "content": "Y _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 526, + 297, + 541 + ], + "score": 1.0, + "content": "is completely determined by", + "type": "text" + }, + { + "bbox": [ + 298, + 528, + 311, + 539 + ], + "score": 0.78, + "content": "A _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 526, + 318, + 541 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 318, + 528, + 345, + 540 + ], + "score": 0.83, + "content": "Y _ { 1 } ^ { * } ( \\bar { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 526, + 370, + 541 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 370, + 528, + 397, + 540 + ], + "score": 0.91, + "content": "Y _ { 1 } ^ { * } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 526, + 506, + 541 + ], + "score": 1.0, + "content": ". Therefore, we obtain", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 537, + 219, + 552 + ], + "spans": [ + { + "bbox": [ + 107, + 538, + 213, + 552 + ], + "score": 0.92, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp F _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 537, + 219, + 552 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23 + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 505, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 236, + 570 + ], + "score": 1.0, + "content": "Suppose we have shown that", + "type": "text" + }, + { + "bbox": [ + 236, + 556, + 352, + 570 + ], + "score": 0.9, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ \\bot ~ \\mathcal { F } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 555, + 398, + 570 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 399, + 557, + 453, + 568 + ], + "score": 0.9, + "content": "k \\ < \\ j \\ - \\ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 555, + 505, + 570 + ], + "score": 1.0, + "content": ". To prove", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 107, + 567, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 107, + 569, + 231, + 582 + ], + "score": 0.88, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\ \\perp \\ \\mathcal { F } _ { k + 1 } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 567, + 317, + 582 + ], + "score": 1.0, + "content": ", it suffices to show", + "type": "text" + }, + { + "bbox": [ + 317, + 569, + 406, + 582 + ], + "score": 0.61, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ .", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 567, + 417, + 582 + ], + "score": 1.0, + "content": "⊥⊥", + "type": "text" + }, + { + "bbox": [ + 418, + 569, + 501, + 581 + ], + "score": 0.76, + "content": "( X _ { k + 1 } , A _ { k + 1 } , Y _ { k + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 567, + 505, + 582 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 579, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 104, + 579, + 149, + 596 + ], + "score": 1.0, + "content": "By (A1),", + "type": "text" + }, + { + "bbox": [ + 149, + 582, + 171, + 594 + ], + "score": 0.88, + "content": "Y _ { k + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 579, + 249, + 596 + ], + "score": 1.0, + "content": "is determined by", + "type": "text" + }, + { + "bbox": [ + 249, + 582, + 272, + 594 + ], + "score": 0.78, + "content": "A _ { k + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 579, + 279, + 596 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 279, + 581, + 314, + 595 + ], + "score": 0.78, + "content": "Y _ { k + 1 } ^ { * } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 579, + 335, + 596 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 336, + 582, + 370, + 594 + ], + "score": 0.9, + "content": "Y _ { k + 1 } ^ { * } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 579, + 408, + 596 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 408, + 582, + 497, + 595 + ], + "score": 0.83, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ .", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 579, + 506, + 596 + ], + "score": 1.0, + "content": "⊥⊥", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 592, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 107, + 594, + 214, + 607 + ], + "score": 0.89, + "content": "( X _ { k + 1 } , Y _ { k + 1 } ^ { * } ( 0 ) , Y _ { k + 1 } ^ { * } ( 1 ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 592, + 299, + 609 + ], + "score": 1.0, + "content": ", it suffices to show", + "type": "text" + }, + { + "bbox": [ + 299, + 594, + 420, + 607 + ], + "score": 0.79, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\ \\perp \\ A _ { k + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 592, + 506, + 609 + ], + "score": 1.0, + "content": ". This is implied by", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 605, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 270, + 620 + ], + "score": 0.77, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp A _ { k + 1 } | X _ { k + 1 } , \\mathcal { F } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 605, + 308, + 621 + ], + "score": 1.0, + "content": "and that", + "type": "text" + }, + { + "bbox": [ + 308, + 607, + 446, + 620 + ], + "score": 0.83, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp \\perp X _ { k + 1 } , \\mathcal { F } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 605, + 506, + 621 + ], + "score": 1.0, + "content": ". The proof is", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 617, + 179, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 179, + 630 + ], + "score": 1.0, + "content": "hence completed.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5 + }, + { + "type": "title", + "bbox": [ + 107, + 642, + 219, + 653 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 220, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 220, + 655 + ], + "score": 1.0, + "content": "E.4 PROOF OF LEMMA 4", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 663, + 166, + 674 + ], + "lines": [ + { + "bbox": [ + 106, + 662, + 167, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 167, + 675 + ], + "score": 1.0, + "content": "The assertions", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33 + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 678, + 415, + 694 + ], + "lines": [ + { + "bbox": [ + 175, + 678, + 415, + 694 + ], + "spans": [ + { + "bbox": [ + 175, + 678, + 415, + 694 + ], + "score": 0.88, + "content": "\\epsilon _ { 0 } \\le \\lambda _ { \\operatorname* { m i n } } [ \\mathsf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\le \\lambda _ { \\operatorname* { m a x } } [ \\mathsf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\le \\epsilon _ { 0 } ^ { - 1 } ,", + "type": "interline_equation", + "image_path": "d21643e0583df8df80a14fe044fa5ab5b43bb154005ae132693e1786375a89c4.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 175, + 678, + 415, + 694 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 699, + 123, + 710 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 124, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 124, + 710 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35 + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 715, + 343, + 735 + ], + "lines": [ + { + "bbox": [ + 246, + 715, + 343, + 735 + ], + "spans": [ + { + "bbox": [ + 246, + 715, + 343, + 735 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } ,", + "type": "interline_equation", + "image_path": "21dca32db5d6b3d1473aa3872b61249cb75d8c1b73c7592800bbf58a5d44874e.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 246, + 715, + 343, + 735 + ], + "spans": [], + "index": 36 + } + ] + } + ], + "page_idx": 21, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 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, + 82, + 282, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 282, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 282, + 95 + ], + "score": 1.0, + "content": "In view of equation 29, we have shown that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 82, + 282, + 95 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 97, + 513, + 191 + ], + "lines": [ + { + "bbox": [ + 111, + 97, + 513, + 191 + ], + "spans": [ + { + "bbox": [ + 111, + 97, + 513, + 191 + ], + "score": 0.92, + "content": "\\begin{array} { r l r } & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} - \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\qquad \\preceq \\lambda \\mathrm { \\Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) , } \\\\ & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} - \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { m p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\qquad \\preceq \\lambda \\mathrm { \\Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "f3cbf46334ffb88e7d7895b71d58ec13067029780a6e7e07d0edc49df17269e6.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 111, + 97, + 513, + 128.33333333333334 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 128.33333333333334, + 513, + 159.66666666666669 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 159.66666666666669, + 513, + 191.00000000000003 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 195, + 508, + 232 + ], + "lines": [ + { + "bbox": [ + 104, + 193, + 507, + 213 + ], + "spans": [ + { + "bbox": [ + 104, + 193, + 197, + 213 + ], + "score": 1.0, + "content": "The covariance matrix", + "type": "text" + }, + { + "bbox": [ + 198, + 196, + 247, + 208 + ], + "score": 0.92, + "content": "\\operatorname { C o v } ( G ( t _ { k } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 248, + 193, + 294, + 213 + ], + "score": 1.0, + "content": "is given by", + "type": "text" + }, + { + "bbox": [ + 294, + 195, + 384, + 210 + ], + "score": 0.94, + "content": "\\begin{array} { r } { \\sum _ { a \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 384, + 193, + 507, + 213 + ], + "score": 1.0, + "content": "and is nonsingular by Lemma", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 208, + 506, + 222 + ], + "spans": [ + { + "bbox": [ + 105, + 208, + 202, + 222 + ], + "score": 1.0, + "content": "4. In addition, we have", + "type": "text" + }, + { + "bbox": [ + 202, + 209, + 295, + 221 + ], + "score": 0.92, + "content": "\\| \\varphi ( x ) \\| _ { 2 } \\geq \\bar { c } , \\forall x \\in \\mathbb { X } _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 296, + 208, + 506, + 222 + ], + "score": 1.0, + "content": ", by Condition A3. Thus, there exists some constant", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 220, + 175, + 231 + ], + "spans": [ + { + "bbox": [ + 106, + 221, + 135, + 231 + ], + "score": 0.9, + "content": "c _ { * } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 135, + 220, + 175, + 231 + ], + "score": 1.0, + "content": "such that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 104, + 193, + 507, + 231 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 179, + 235, + 412, + 279 + ], + "lines": [ + { + "bbox": [ + 179, + 235, + 412, + 279 + ], + "spans": [ + { + "bbox": [ + 179, + 235, + 412, + 279 + ], + "score": 0.94, + "content": "c _ { * } \\leq \\varphi ^ { \\top } ( x ) \\left( \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } \\right) ^ { 1 / 2 } \\varphi ( x ) , \\forall x \\in \\mathbb { X } _ { 0 } .", + "type": "interline_equation", + "image_path": "f2e147a1164f6f226793440b2c9e630859aa23e409bb5f4cc4f330de0d376ddf.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 179, + 235, + 412, + 249.66666666666666 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 179, + 249.66666666666666, + 412, + 264.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 179, + 264.3333333333333, + 412, + 279.0 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 282, + 351, + 295 + ], + "lines": [ + { + "bbox": [ + 105, + 282, + 351, + 296 + ], + "spans": [ + { + "bbox": [ + 105, + 282, + 351, + 296 + ], + "score": 1.0, + "content": "By Theorem 1 of Chernozhukov et al. (2017), we obtain that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 105, + 282, + 351, + 296 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 299, + 540, + 347 + ], + "lines": [ + { + "bbox": [ + 138, + 299, + 540, + 347 + ], + "spans": [ + { + "bbox": [ + 138, + 299, + 540, + 347 + ], + "score": 0.86, + "content": "\\begin{array} { r l } & { \\operatorname* { p } _ { \\mathrm { { r } } } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} } \\\\ & { \\ l ^ { - 1 } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 3 / 2 } + q \\delta _ { n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 1 / 2 } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} } \\end{array}", + "type": "interline_equation", + "image_path": "80bb55b8595d580f8a724cd3ea854ca803a5ce984e04d39df56334fd877c55d3.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 138, + 299, + 540, + 315.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 138, + 315.0, + 540, + 331.0 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 138, + 331.0, + 540, + 347.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 349, + 173, + 361 + ], + "lines": [ + { + "bbox": [ + 106, + 349, + 173, + 362 + ], + "spans": [ + { + "bbox": [ + 106, + 349, + 173, + 362 + ], + "score": 1.0, + "content": "Thus, we obtain", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 349, + 173, + 362 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 365, + 540, + 428 + ], + "lines": [ + { + "bbox": [ + 138, + 365, + 540, + 428 + ], + "spans": [ + { + "bbox": [ + 138, + 365, + 540, + 428 + ], + "score": 0.83, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathfrak { X } } { \\operatorname* { m a x } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathfrak { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} \\bigg | } \\\\ & { \\ i ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) } \\\\ & { \\ j ^ { - 1 } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 3 / 2 } + q \\delta _ { n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 1 / 2 } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} } \\end{array}", + "type": "interline_equation", + "image_path": "baffea1771cd54328b90e59df4f5c3314d00ce0db24212055e1c6a2264160b9e.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 138, + 365, + 540, + 386.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 138, + 386.0, + 540, + 407.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 138, + 407.0, + 540, + 428.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 433, + 504, + 458 + ], + "lines": [ + { + "bbox": [ + 104, + 430, + 507, + 450 + ], + "spans": [ + { + "bbox": [ + 104, + 430, + 137, + 450 + ], + "score": 1.0, + "content": "Setting", + "type": "text" + }, + { + "bbox": [ + 137, + 433, + 478, + 448 + ], + "score": 0.81, + "content": "\\eta = \\operatorname* { m i n } ( q ^ { - 3 / 4 } n ^ { 1 / 8 } ( t _ { 1 } ) \\log ^ { - 3 / 8 } \\{ K n ( t _ { 1 } ) \\} , q ^ { - 1 } n ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { - \\alpha _ { 0 } / 3 - 1 / 6 } \\{ K n ( t _ { 1 } ) \\} )", + "type": "inline_equation" + }, + { + "bbox": [ + 478, + 430, + 507, + 450 + ], + "score": 1.0, + "content": "yields", + "type": "text" + } + ], + "index": 18 + }, + { + "bbox": [ + 106, + 446, + 308, + 459 + ], + "spans": [ + { + "bbox": [ + 106, + 446, + 308, + 459 + ], + "score": 1.0, + "content": "the desired results. The proof is hence completed.", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 18.5, + "bbox_fs": [ + 104, + 430, + 507, + 459 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 471, + 219, + 482 + ], + "lines": [ + { + "bbox": [ + 105, + 470, + 221, + 484 + ], + "spans": [ + { + "bbox": [ + 105, + 470, + 221, + 484 + ], + "score": 1.0, + "content": "E.3 PROOF OF LEMMA 3", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "text", + "bbox": [ + 106, + 491, + 505, + 551 + ], + "lines": [ + { + "bbox": [ + 105, + 491, + 505, + 505 + ], + "spans": [ + { + "bbox": [ + 105, + 491, + 237, + 505 + ], + "score": 1.0, + "content": "The assertion trivially holds for", + "type": "text" + }, + { + "bbox": [ + 238, + 492, + 264, + 503 + ], + "score": 0.89, + "content": "j = 1", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 491, + 377, + 505 + ], + "score": 1.0, + "content": ". We prove it holds for any", + "type": "text" + }, + { + "bbox": [ + 378, + 492, + 404, + 503 + ], + "score": 0.89, + "content": "j \\geq 2", + "type": "inline_equation" + }, + { + "bbox": [ + 404, + 491, + 505, + 505 + ], + "score": 1.0, + "content": ", by induction. By (A2),", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 502, + 506, + 516 + ], + "spans": [ + { + "bbox": [ + 105, + 502, + 141, + 516 + ], + "score": 1.0, + "content": "we have", + "type": "text" + }, + { + "bbox": [ + 141, + 502, + 264, + 515 + ], + "score": 0.84, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , \\overset { \\cdot } { Y _ { j } ^ { * } } ( 1 ) ) \\overset { } { \\bot } \\overset { } { A _ { 1 } } | X _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 502, + 292, + 516 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 293, + 503, + 468, + 515 + ], + "score": 0.35, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp ( X _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 468, + 502, + 506, + 516 + ], + "score": 1.0, + "content": ", this fur-", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 514, + 506, + 529 + ], + "spans": [ + { + "bbox": [ + 105, + 514, + 157, + 528 + ], + "score": 1.0, + "content": "ther implies", + "type": "text" + }, + { + "bbox": [ + 157, + 515, + 264, + 529 + ], + "score": 0.87, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp { \\cal A } _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 264, + 514, + 309, + 528 + ], + "score": 1.0, + "content": "and hence", + "type": "text" + }, + { + "bbox": [ + 309, + 515, + 501, + 528 + ], + "score": 0.85, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp ( X _ { 1 } , A _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 514, + 506, + 528 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 23 + }, + { + "bbox": [ + 105, + 526, + 506, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 526, + 152, + 541 + ], + "score": 1.0, + "content": "By (A1),", + "type": "text" + }, + { + "bbox": [ + 152, + 528, + 164, + 538 + ], + "score": 0.85, + "content": "Y _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 164, + 526, + 297, + 541 + ], + "score": 1.0, + "content": "is completely determined by", + "type": "text" + }, + { + "bbox": [ + 298, + 528, + 311, + 539 + ], + "score": 0.78, + "content": "A _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 311, + 526, + 318, + 541 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 318, + 528, + 345, + 540 + ], + "score": 0.83, + "content": "Y _ { 1 } ^ { * } ( \\bar { 0 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 526, + 370, + 541 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 370, + 528, + 397, + 540 + ], + "score": 0.91, + "content": "Y _ { 1 } ^ { * } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 397, + 526, + 506, + 541 + ], + "score": 1.0, + "content": ". Therefore, we obtain", + "type": "text" + } + ], + "index": 24 + }, + { + "bbox": [ + 107, + 537, + 219, + 552 + ], + "spans": [ + { + "bbox": [ + 107, + 538, + 213, + 552 + ], + "score": 0.92, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp F _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 537, + 219, + 552 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 491, + 506, + 552 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 555, + 505, + 630 + ], + "lines": [ + { + "bbox": [ + 105, + 555, + 505, + 570 + ], + "spans": [ + { + "bbox": [ + 105, + 555, + 236, + 570 + ], + "score": 1.0, + "content": "Suppose we have shown that", + "type": "text" + }, + { + "bbox": [ + 236, + 556, + 352, + 570 + ], + "score": 0.9, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ \\bot ~ \\mathcal { F } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 352, + 555, + 398, + 570 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 399, + 557, + 453, + 568 + ], + "score": 0.9, + "content": "k \\ < \\ j \\ - \\ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 555, + 505, + 570 + ], + "score": 1.0, + "content": ". To prove", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 107, + 567, + 505, + 582 + ], + "spans": [ + { + "bbox": [ + 107, + 569, + 231, + 582 + ], + "score": 0.88, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\ \\perp \\ \\mathcal { F } _ { k + 1 } ,", + "type": "inline_equation" + }, + { + "bbox": [ + 231, + 567, + 317, + 582 + ], + "score": 1.0, + "content": ", it suffices to show", + "type": "text" + }, + { + "bbox": [ + 317, + 569, + 406, + 582 + ], + "score": 0.61, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ .", + "type": "inline_equation" + }, + { + "bbox": [ + 406, + 567, + 417, + 582 + ], + "score": 1.0, + "content": "⊥⊥", + "type": "text" + }, + { + "bbox": [ + 418, + 569, + 501, + 581 + ], + "score": 0.76, + "content": "( X _ { k + 1 } , A _ { k + 1 } , Y _ { k + 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 567, + 505, + 582 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 27 + }, + { + "bbox": [ + 104, + 579, + 506, + 596 + ], + "spans": [ + { + "bbox": [ + 104, + 579, + 149, + 596 + ], + "score": 1.0, + "content": "By (A1),", + "type": "text" + }, + { + "bbox": [ + 149, + 582, + 171, + 594 + ], + "score": 0.88, + "content": "Y _ { k + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 579, + 249, + 596 + ], + "score": 1.0, + "content": "is determined by", + "type": "text" + }, + { + "bbox": [ + 249, + 582, + 272, + 594 + ], + "score": 0.78, + "content": "A _ { k + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 273, + 579, + 279, + 596 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 279, + 581, + 314, + 595 + ], + "score": 0.78, + "content": "Y _ { k + 1 } ^ { * } ( 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 314, + 579, + 335, + 596 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 336, + 582, + 370, + 594 + ], + "score": 0.9, + "content": "Y _ { k + 1 } ^ { * } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 370, + 579, + 408, + 596 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 408, + 582, + 497, + 595 + ], + "score": 0.83, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ .", + "type": "inline_equation" + }, + { + "bbox": [ + 497, + 579, + 506, + 596 + ], + "score": 1.0, + "content": "⊥⊥", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 107, + 592, + 506, + 609 + ], + "spans": [ + { + "bbox": [ + 107, + 594, + 214, + 607 + ], + "score": 0.89, + "content": "( X _ { k + 1 } , Y _ { k + 1 } ^ { * } ( 0 ) , Y _ { k + 1 } ^ { * } ( 1 ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 592, + 299, + 609 + ], + "score": 1.0, + "content": ", it suffices to show", + "type": "text" + }, + { + "bbox": [ + 299, + 594, + 420, + 607 + ], + "score": 0.79, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\ \\perp \\ A _ { k + 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 420, + 592, + 506, + 609 + ], + "score": 1.0, + "content": ". This is implied by", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 605, + 506, + 621 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 270, + 620 + ], + "score": 0.77, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp A _ { k + 1 } | X _ { k + 1 } , \\mathcal { F } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 605, + 308, + 621 + ], + "score": 1.0, + "content": "and that", + "type": "text" + }, + { + "bbox": [ + 308, + 607, + 446, + 620 + ], + "score": 0.83, + "content": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp \\perp X _ { k + 1 } , \\mathcal { F } _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 446, + 605, + 506, + 621 + ], + "score": 1.0, + "content": ". The proof is", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 105, + 617, + 179, + 630 + ], + "spans": [ + { + "bbox": [ + 105, + 617, + 179, + 630 + ], + "score": 1.0, + "content": "hence completed.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 28.5, + "bbox_fs": [ + 104, + 555, + 506, + 630 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 642, + 219, + 653 + ], + "lines": [ + { + "bbox": [ + 105, + 641, + 220, + 655 + ], + "spans": [ + { + "bbox": [ + 105, + 641, + 220, + 655 + ], + "score": 1.0, + "content": "E.4 PROOF OF LEMMA 4", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "text", + "bbox": [ + 107, + 663, + 166, + 674 + ], + "lines": [ + { + "bbox": [ + 106, + 662, + 167, + 675 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 167, + 675 + ], + "score": 1.0, + "content": "The assertions", + "type": "text" + } + ], + "index": 33 + } + ], + "index": 33, + "bbox_fs": [ + 106, + 662, + 167, + 675 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 175, + 678, + 415, + 694 + ], + "lines": [ + { + "bbox": [ + 175, + 678, + 415, + 694 + ], + "spans": [ + { + "bbox": [ + 175, + 678, + 415, + 694 + ], + "score": 0.88, + "content": "\\epsilon _ { 0 } \\le \\lambda _ { \\operatorname* { m i n } } [ \\mathsf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\le \\lambda _ { \\operatorname* { m a x } } [ \\mathsf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\le \\epsilon _ { 0 } ^ { - 1 } ,", + "type": "interline_equation", + "image_path": "d21643e0583df8df80a14fe044fa5ab5b43bb154005ae132693e1786375a89c4.jpg" + } + ] + } + ], + "index": 34, + "virtual_lines": [ + { + "bbox": [ + 175, + 678, + 415, + 694 + ], + "spans": [], + "index": 34 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 699, + 123, + 710 + ], + "lines": [ + { + "bbox": [ + 105, + 699, + 124, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 699, + 124, + 710 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 35, + "bbox_fs": [ + 105, + 699, + 124, + 710 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 246, + 715, + 343, + 735 + ], + "lines": [ + { + "bbox": [ + 246, + 715, + 343, + 735 + ], + "spans": [ + { + "bbox": [ + 246, + 715, + 343, + 735 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } ,", + "type": "interline_equation", + "image_path": "21dca32db5d6b3d1473aa3872b61249cb75d8c1b73c7592800bbf58a5d44874e.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 246, + 715, + 343, + 735 + ], + "spans": [], + "index": 36 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 505, + 121 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 147, + 95 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 147, + 83, + 207, + 93 + ], + "score": 0.9, + "content": "0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 81, + 390, + 95 + ], + "score": 1.0, + "content": "are directly implied by the conditions that", + "type": "text" + }, + { + "bbox": [ + 391, + 81, + 501, + 95 + ], + "score": 0.92, + "content": "\\lambda _ { \\mathrm { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\ \\asymp \\ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 81, + 506, + 95 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 109 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 218, + 107 + ], + "score": 0.89, + "content": "\\lambda _ { \\mathrm { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\ \\asymp \\ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 93, + 224, + 109 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 225, + 93, + 329, + 108 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\ \\leq \\ \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 93, + 366, + 109 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 366, + 95, + 455, + 107 + ], + "score": 0.9, + "content": "\\| \\varphi ( x ) \\| _ { 2 } ~ \\leq ~ \\| \\varphi ( x ) \\| _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 93, + 506, + 109 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 107, + 279, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 108, + 275, + 121 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 2 } \\leq \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 107, + 279, + 122 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 105, + 124, + 504, + 137 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 187, + 139 + ], + "score": 1.0, + "content": "Under the condition", + "type": "text" + }, + { + "bbox": [ + 188, + 124, + 266, + 137 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\operatorname* { i n f } _ { a , x } \\pi ^ { * } ( a , x ) > 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 123, + 376, + 139 + ], + "score": 1.0, + "content": ", we can similarly show that", + "type": "text" + }, + { + "bbox": [ + 376, + 125, + 435, + 137 + ], + "score": 0.92, + "content": "\\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\geq \\epsilon _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 123, + 473, + 139 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 473, + 126, + 501, + 136 + ], + "score": 0.9, + "content": "\\epsilon _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 123, + 505, + 139 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 141, + 505, + 192 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 133, + 155 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 133, + 141, + 165, + 154 + ], + "score": 0.92, + "content": "\\lvert Y ^ { * } ( 0 ) \\rvert", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 141, + 186, + 155 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 186, + 141, + 218, + 153 + ], + "score": 0.9, + "content": "\\lvert Y ^ { * } ( 1 ) \\rvert", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 141, + 391, + 155 + ], + "score": 1.0, + "content": "are bounded, there exists some constant", + "type": "text" + }, + { + "bbox": [ + 391, + 142, + 449, + 153 + ], + "score": 0.92, + "content": "0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 141, + 506, + 155 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 153, + 504, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 217, + 167 + ], + "score": 0.83, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | Y ^ { * } ( a ) | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 153, + 271, + 168 + ], + "score": 1.0, + "content": ". Notice that", + "type": "text" + }, + { + "bbox": [ + 271, + 153, + 398, + 166 + ], + "score": 0.92, + "content": "\\varphi ^ { \\top } ( x ) \\beta _ { a } = \\operatorname { E } \\{ Y ^ { * } ( a ) | X = x \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 153, + 471, + 168 + ], + "score": 1.0, + "content": ". Boundedness of", + "type": "text" + }, + { + "bbox": [ + 471, + 154, + 504, + 166 + ], + "score": 0.93, + "content": "\\left| Y ^ { * } ( a ) \\right|", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 244, + 178 + ], + "score": 1.0, + "content": "implies that the conditional mean", + "type": "text" + }, + { + "bbox": [ + 244, + 166, + 298, + 178 + ], + "score": 0.91, + "content": "\\operatorname { E } \\{ Y ^ { * } ( a ) | X \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "is a bounded random variable as well. As a result,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 177, + 305, + 192 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 148, + 192 + ], + "score": 1.0, + "content": "we obtain", + "type": "text" + }, + { + "bbox": [ + 148, + 177, + 301, + 192 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | \\varphi ^ { \\top } ( x ) \\beta _ { a } | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 178, + 305, + 192 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5 + }, + { + "type": "text", + "bbox": [ + 108, + 196, + 503, + 220 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 153, + 211 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + }, + { + "bbox": [ + 154, + 196, + 258, + 209 + ], + "score": 0.9, + "content": "\\beta _ { a } = \\Sigma _ { a } ^ { - 1 } \\mathrm { E } \\varphi ^ { \\top } ( X ) Y ^ { \\ast } ( a )", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 195, + 288, + 211 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 288, + 197, + 327, + 209 + ], + "score": 0.93, + "content": "\\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 195, + 505, + 211 + ], + "score": 1.0, + "content": "is bounded away from 0, it suffices to show", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 206, + 286, + 222 + ], + "spans": [ + { + "bbox": [ + 107, + 208, + 217, + 220 + ], + "score": 0.9, + "content": "\\| \\mathrm { E } \\varphi ^ { \\top } ( X ) Y ^ { * } ( a ) \\| _ { 2 } \\stackrel { } { = } { \\cal O } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 206, + 286, + 222 + ], + "score": 1.0, + "content": ", or equivalently,", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5 + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 223, + 376, + 247 + ], + "lines": [ + { + "bbox": [ + 214, + 223, + 376, + 247 + ], + "spans": [ + { + "bbox": [ + 214, + 223, + 376, + 247 + ], + "score": 0.92, + "content": "\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } | \\mathrm { E } \\nu ^ { \\top } \\varphi ( X ) Y ^ { \\ast } ( a ) | = O ( 1 ) .", + "type": "interline_equation", + "image_path": "a7d84c86e5191f977437b9ecc6569e8e5c1842267420860f4197db43d2343f46.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 214, + 223, + 376, + 247 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 251, + 309, + 263 + ], + "lines": [ + { + "bbox": [ + 105, + 250, + 309, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 309, + 265 + ], + "score": 1.0, + "content": "By Cauchy-Schwarz inequality, it suffices to show", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 266, + 387, + 290 + ], + "lines": [ + { + "bbox": [ + 203, + 266, + 387, + 290 + ], + "spans": [ + { + "bbox": [ + 203, + 266, + 387, + 290 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\mathrm { E } | Y ^ { * } ( a ) | ^ { 2 } \\mathrm { E } | \\nu ^ { \\top } \\varphi ( X ) | ^ { 2 } = O ( 1 ) .", + "type": "interline_equation", + "image_path": "ee4bcfd33c5212998a365ff71d4b94b109577dca9f8b485fbbfa0ac090343ae9.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 203, + 266, + 387, + 290 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 295, + 498, + 309 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 499, + 310 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 131, + 310 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 131, + 296, + 197, + 308 + ], + "score": 0.92, + "content": "| Y ^ { * } ( a ) | = O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 294, + 358, + 310 + ], + "score": 1.0, + "content": "almost surely, we have by the condition", + "type": "text" + }, + { + "bbox": [ + 359, + 295, + 479, + 308 + ], + "score": 0.92, + "content": "\\lambda _ { \\operatorname* { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] = O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 294, + 499, + 310 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 106, + 311, + 483, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 311, + 483, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 483, + 335 + ], + "score": 0.9, + "content": "\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\mathbf { E } | \\nu ^ { \\top } \\varphi ( X ) | ^ { 2 } = \\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\nu ^ { \\top } \\mathbf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\nu \\leq \\lambda _ { \\operatorname* { m a x } } [ \\mathbf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] = O ( 1 ) .", + "type": "interline_equation", + "image_path": "bcb7b78433d4f322159451cd85d683526257b6de59dc82f3d064f6da69badd75.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 106, + 311, + 483, + 335 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 339, + 229, + 351 + ], + "lines": [ + { + "bbox": [ + 106, + 338, + 230, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 230, + 352 + ], + "score": 1.0, + "content": "The proof is hence completed.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "title", + "bbox": [ + 107, + 363, + 219, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 362, + 221, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 221, + 376 + ], + "score": 1.0, + "content": "E.5 PROOF OF LEMMA 5", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "title", + "bbox": [ + 107, + 384, + 244, + 395 + ], + "lines": [ + { + "bbox": [ + 106, + 384, + 245, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 245, + 397 + ], + "score": 1.0, + "content": "E.5.1 PROOF OF EQUATION 14", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 403, + 153, + 414 + ], + "lines": [ + { + "bbox": [ + 105, + 403, + 154, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 154, + 415 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 417, + 461, + 489 + ], + "lines": [ + { + "bbox": [ + 130, + 417, + 461, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 417, + 461, + 489 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\| j ( \\widehat { \\Sigma } _ { 1 , j } - \\Sigma _ { 1 } ) \\| _ { 2 } = \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { j } \\{ A _ { i } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( 1 , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } } \\\\ { + j \\left\\| \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\left( \\displaystyle \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right) \\right\\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "b5d16af9003d3307b18d4125c3666b87af4ff921dcd66e88053e106750201436.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 130, + 417, + 461, + 441.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 130, + 441.0, + 461, + 465.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 130, + 465.0, + 461, + 489.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 491, + 198, + 502 + ], + "lines": [ + { + "bbox": [ + 106, + 491, + 199, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 199, + 504 + ], + "score": 1.0, + "content": "By Lemma 4, we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 506, + 514, + 559 + ], + "lines": [ + { + "bbox": [ + 111, + 506, + 514, + 559 + ], + "spans": [ + { + "bbox": [ + 111, + 506, + 514, + 559 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\left| { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\left( \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right) \\right| \\Big | _ { 2 } \\leq \\varepsilon _ { 0 } ^ { - 2 } q { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\left| \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right| } \\\\ { \\leq \\varepsilon _ { 0 } ^ { - 2 } q ^ { 2 } j ^ { - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } j , \\forall j \\geq . } \\end{array}", + "type": "interline_equation", + "image_path": "2b53ed79d5085e9d09f0a35e76b5b57ab7e04bda5fd67703aa639c9985fc3b6d.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 111, + 506, + 514, + 523.6666666666666 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 111, + 523.6666666666666, + 514, + 541.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 111, + 541.3333333333333, + 514, + 558.9999999999999 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 561, + 260, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 559, + 257, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 204, + 577 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 561, + 257, + 574 + ], + "score": 0.91, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 106, + 578, + 505, + 612 + ], + "lines": [ + { + "bbox": [ + 105, + 577, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 340, + 591 + ], + "score": 1.0, + "content": "Consider the first term on the RHS of equation 42. For any", + "type": "text" + }, + { + "bbox": [ + 340, + 579, + 363, + 589 + ], + "score": 0.9, + "content": "i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 577, + 393, + 591 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 394, + 577, + 505, + 590 + ], + "score": 0.91, + "content": "M _ { i } = \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ A _ { i } -", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 588, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 107, + 589, + 160, + 601 + ], + "score": 0.91, + "content": "\\pi _ { i - 1 } ( 1 , X _ { i } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 588, + 218, + 602 + ], + "score": 1.0, + "content": ". Notice that", + "type": "text" + }, + { + "bbox": [ + 219, + 589, + 256, + 601 + ], + "score": 0.92, + "content": "\\{ M _ { i } \\} _ { i \\geq 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 588, + 505, + 602 + ], + "score": 1.0, + "content": "forms a martingale difference sequence with respect to the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 599, + 246, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 144, + 613 + ], + "score": 1.0, + "content": "filtration", + "type": "text" + }, + { + "bbox": [ + 144, + 600, + 218, + 612 + ], + "score": 0.92, + "content": "\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 599, + 246, + 613 + ], + "score": 1.0, + "content": ", since", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 615, + 437, + 648 + ], + "lines": [ + { + "bbox": [ + 180, + 615, + 437, + 648 + ], + "spans": [ + { + "bbox": [ + 180, + 615, + 437, + 648 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ A _ { i } - \\pi _ { i - 1 } ( X _ { i } ) \\} \\vert \\mathcal { F } _ { i - 1 } ] } \\\\ { = } & { \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } [ \\mathbb { E } ( \\varphi ( X _ { i } ) \\varphi ( X _ { i } ) ^ { \\top } \\{ A _ { i } - \\pi _ { i - 1 } ( X _ { i } ) \\} \\vert \\mathcal { F } _ { i - 1 } , X _ { i } ) ] = 0 , } \\end{array}", + "type": "interline_equation", + "image_path": "c89454f92bf83e2c0afe3a43e15ae954002dd9b83f6f2f326195ca6d0e28facf.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 180, + 615, + 437, + 626.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 180, + 626.0, + 437, + 637.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 180, + 637.0, + 437, + 648.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 651, + 505, + 697 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 506, + 665 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 133, + 665 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 650, + 162, + 662 + ], + "score": 0.9, + "content": "\\mathrm { E } ^ { \\mathcal { F } _ { i } , { X } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 649, + 330, + 665 + ], + "score": 1.0, + "content": "denotes the conditional expectation given", + "type": "text" + }, + { + "bbox": [ + 331, + 652, + 343, + 663 + ], + "score": 0.89, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 649, + 361, + 665 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 362, + 652, + 373, + 663 + ], + "score": 0.89, + "content": "{ \\mathcal { F } } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 649, + 506, + 665 + ], + "score": 1.0, + "content": ". Here, the first equality is due to", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 662, + 506, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 124, + 676 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 124, + 663, + 172, + 675 + ], + "score": 0.89, + "content": "X _ { i } \\perp \\perp F _ { i - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 662, + 459, + 676 + ], + "score": 1.0, + "content": ", implied by Lemma 3. Under the given conditions on the basis function", + "type": "text" + }, + { + "bbox": [ + 459, + 663, + 477, + 675 + ], + "score": 0.9, + "content": "\\varphi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 662, + 506, + 676 + ], + "score": 1.0, + "content": ", using", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 672, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 506, + 687 + ], + "score": 1.0, + "content": "similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that the following", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 104, + 683, + 309, + 698 + ], + "spans": [ + { + "bbox": [ + 104, + 683, + 256, + 698 + ], + "score": 1.0, + "content": "event occurs with probability at least", + "type": "text" + }, + { + "bbox": [ + 256, + 685, + 304, + 697 + ], + "score": 0.91, + "content": "1 - O ( j ^ { - 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 683, + 309, + 698 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5 + }, + { + "type": "interline_equation", + "bbox": [ + 240, + 701, + 350, + 735 + ], + "lines": [ + { + "bbox": [ + 240, + 701, + 350, + 735 + ], + "spans": [ + { + "bbox": [ + 240, + 701, + 350, + 735 + ], + "score": 0.94, + "content": "\\left\\| \\sum _ { i = 1 } ^ { j } M _ { i } \\right\\| _ { 2 } \\preceq \\sqrt { q j \\log ( j ) } .", + "type": "interline_equation", + "image_path": "645f1e1015e9bf71e392b2f562cbe14ef39c72b29365961c7dc919b5213137c3.jpg" + } + ] + } + ], + "index": 37.5, + "virtual_lines": [ + { + "bbox": [ + 240, + 701, + 350, + 718.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 240, + 718.0, + 350, + 735.0 + ], + "spans": [], + "index": 38 + } + ] + } + ], + "page_idx": 22, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 307, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 307, + 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": "text", + "bbox": [ + 106, + 81, + 505, + 121 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 506, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 147, + 95 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 147, + 83, + 207, + 93 + ], + "score": 0.9, + "content": "0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 81, + 390, + 95 + ], + "score": 1.0, + "content": "are directly implied by the conditions that", + "type": "text" + }, + { + "bbox": [ + 391, + 81, + 501, + 95 + ], + "score": 0.92, + "content": "\\lambda _ { \\mathrm { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\ \\asymp \\ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 502, + 81, + 506, + 95 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 93, + 506, + 109 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 218, + 107 + ], + "score": 0.89, + "content": "\\lambda _ { \\mathrm { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\ \\asymp \\ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 93, + 224, + 109 + ], + "score": 1.0, + "content": ",", + "type": "text" + }, + { + "bbox": [ + 225, + 93, + 329, + 108 + ], + "score": 0.86, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\ \\leq \\ \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 330, + 93, + 366, + 109 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 366, + 95, + 455, + 107 + ], + "score": 0.9, + "content": "\\| \\varphi ( x ) \\| _ { 2 } ~ \\leq ~ \\| \\varphi ( x ) \\| _ { 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 456, + 93, + 506, + 109 + ], + "score": 1.0, + "content": ", we obtain", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 106, + 107, + 279, + 122 + ], + "spans": [ + { + "bbox": [ + 106, + 108, + 275, + 121 + ], + "score": 0.87, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 2 } \\leq \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 107, + 279, + 122 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 81, + 506, + 122 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 124, + 504, + 137 + ], + "lines": [ + { + "bbox": [ + 106, + 123, + 505, + 139 + ], + "spans": [ + { + "bbox": [ + 106, + 123, + 187, + 139 + ], + "score": 1.0, + "content": "Under the condition", + "type": "text" + }, + { + "bbox": [ + 188, + 124, + 266, + 137 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\operatorname* { i n f } _ { a , x } \\pi ^ { * } ( a , x ) > 0 } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 123, + 376, + 139 + ], + "score": 1.0, + "content": ", we can similarly show that", + "type": "text" + }, + { + "bbox": [ + 376, + 125, + 435, + 137 + ], + "score": 0.92, + "content": "\\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\geq \\epsilon _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 436, + 123, + 473, + 139 + ], + "score": 1.0, + "content": "for some", + "type": "text" + }, + { + "bbox": [ + 473, + 126, + 501, + 136 + ], + "score": 0.9, + "content": "\\epsilon _ { 0 } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 501, + 123, + 505, + 139 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 106, + 123, + 505, + 139 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 141, + 505, + 192 + ], + "lines": [ + { + "bbox": [ + 106, + 141, + 506, + 155 + ], + "spans": [ + { + "bbox": [ + 106, + 141, + 133, + 155 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 133, + 141, + 165, + 154 + ], + "score": 0.92, + "content": "\\lvert Y ^ { * } ( 0 ) \\rvert", + "type": "inline_equation" + }, + { + "bbox": [ + 165, + 141, + 186, + 155 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 186, + 141, + 218, + 153 + ], + "score": 0.9, + "content": "\\lvert Y ^ { * } ( 1 ) \\rvert", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 141, + 391, + 155 + ], + "score": 1.0, + "content": "are bounded, there exists some constant", + "type": "text" + }, + { + "bbox": [ + 391, + 142, + 449, + 153 + ], + "score": 0.92, + "content": "0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 141, + 506, + 155 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 106, + 153, + 504, + 168 + ], + "spans": [ + { + "bbox": [ + 106, + 154, + 217, + 167 + ], + "score": 0.83, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | Y ^ { * } ( a ) | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 217, + 153, + 271, + 168 + ], + "score": 1.0, + "content": ". Notice that", + "type": "text" + }, + { + "bbox": [ + 271, + 153, + 398, + 166 + ], + "score": 0.92, + "content": "\\varphi ^ { \\top } ( x ) \\beta _ { a } = \\operatorname { E } \\{ Y ^ { * } ( a ) | X = x \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 399, + 153, + 471, + 168 + ], + "score": 1.0, + "content": ". Boundedness of", + "type": "text" + }, + { + "bbox": [ + 471, + 154, + 504, + 166 + ], + "score": 0.93, + "content": "\\left| Y ^ { * } ( a ) \\right|", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 165, + 505, + 178 + ], + "spans": [ + { + "bbox": [ + 106, + 165, + 244, + 178 + ], + "score": 1.0, + "content": "implies that the conditional mean", + "type": "text" + }, + { + "bbox": [ + 244, + 166, + 298, + 178 + ], + "score": 0.91, + "content": "\\operatorname { E } \\{ Y ^ { * } ( a ) | X \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 299, + 165, + 505, + 178 + ], + "score": 1.0, + "content": "is a bounded random variable as well. As a result,", + "type": "text" + } + ], + "index": 6 + }, + { + "bbox": [ + 106, + 177, + 305, + 192 + ], + "spans": [ + { + "bbox": [ + 106, + 178, + 148, + 192 + ], + "score": 1.0, + "content": "we obtain", + "type": "text" + }, + { + "bbox": [ + 148, + 177, + 301, + 192 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | \\varphi ^ { \\top } ( x ) \\beta _ { a } | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 301, + 178, + 305, + 192 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 5.5, + "bbox_fs": [ + 106, + 141, + 506, + 192 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 196, + 503, + 220 + ], + "lines": [ + { + "bbox": [ + 105, + 195, + 505, + 211 + ], + "spans": [ + { + "bbox": [ + 105, + 195, + 153, + 211 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + }, + { + "bbox": [ + 154, + 196, + 258, + 209 + ], + "score": 0.9, + "content": "\\beta _ { a } = \\Sigma _ { a } ^ { - 1 } \\mathrm { E } \\varphi ^ { \\top } ( X ) Y ^ { \\ast } ( a )", + "type": "inline_equation" + }, + { + "bbox": [ + 259, + 195, + 288, + 211 + ], + "score": 1.0, + "content": ". Since", + "type": "text" + }, + { + "bbox": [ + 288, + 197, + 327, + 209 + ], + "score": 0.93, + "content": "\\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ]", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 195, + 505, + 211 + ], + "score": 1.0, + "content": "is bounded away from 0, it suffices to show", + "type": "text" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 206, + 286, + 222 + ], + "spans": [ + { + "bbox": [ + 107, + 208, + 217, + 220 + ], + "score": 0.9, + "content": "\\| \\mathrm { E } \\varphi ^ { \\top } ( X ) Y ^ { * } ( a ) \\| _ { 2 } \\stackrel { } { = } { \\cal O } ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 218, + 206, + 286, + 222 + ], + "score": 1.0, + "content": ", or equivalently,", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 8.5, + "bbox_fs": [ + 105, + 195, + 505, + 222 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 223, + 376, + 247 + ], + "lines": [ + { + "bbox": [ + 214, + 223, + 376, + 247 + ], + "spans": [ + { + "bbox": [ + 214, + 223, + 376, + 247 + ], + "score": 0.92, + "content": "\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } | \\mathrm { E } \\nu ^ { \\top } \\varphi ( X ) Y ^ { \\ast } ( a ) | = O ( 1 ) .", + "type": "interline_equation", + "image_path": "a7d84c86e5191f977437b9ecc6569e8e5c1842267420860f4197db43d2343f46.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 214, + 223, + 376, + 247 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 251, + 309, + 263 + ], + "lines": [ + { + "bbox": [ + 105, + 250, + 309, + 265 + ], + "spans": [ + { + "bbox": [ + 105, + 250, + 309, + 265 + ], + "score": 1.0, + "content": "By Cauchy-Schwarz inequality, it suffices to show", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 105, + 250, + 309, + 265 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 203, + 266, + 387, + 290 + ], + "lines": [ + { + "bbox": [ + 203, + 266, + 387, + 290 + ], + "spans": [ + { + "bbox": [ + 203, + 266, + 387, + 290 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\mathrm { E } | Y ^ { * } ( a ) | ^ { 2 } \\mathrm { E } | \\nu ^ { \\top } \\varphi ( X ) | ^ { 2 } = O ( 1 ) .", + "type": "interline_equation", + "image_path": "ee4bcfd33c5212998a365ff71d4b94b109577dca9f8b485fbbfa0ac090343ae9.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 203, + 266, + 387, + 290 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 295, + 498, + 309 + ], + "lines": [ + { + "bbox": [ + 106, + 294, + 499, + 310 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 131, + 310 + ], + "score": 1.0, + "content": "Since", + "type": "text" + }, + { + "bbox": [ + 131, + 296, + 197, + 308 + ], + "score": 0.92, + "content": "| Y ^ { * } ( a ) | = O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 198, + 294, + 358, + 310 + ], + "score": 1.0, + "content": "almost surely, we have by the condition", + "type": "text" + }, + { + "bbox": [ + 359, + 295, + 479, + 308 + ], + "score": 0.92, + "content": "\\lambda _ { \\operatorname* { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] = O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 480, + 294, + 499, + 310 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 294, + 499, + 310 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 106, + 311, + 483, + 335 + ], + "lines": [ + { + "bbox": [ + 106, + 311, + 483, + 335 + ], + "spans": [ + { + "bbox": [ + 106, + 311, + 483, + 335 + ], + "score": 0.9, + "content": "\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\mathbf { E } | \\nu ^ { \\top } \\varphi ( X ) | ^ { 2 } = \\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\nu ^ { \\top } \\mathbf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\nu \\leq \\lambda _ { \\operatorname* { m a x } } [ \\mathbf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] = O ( 1 ) .", + "type": "interline_equation", + "image_path": "bcb7b78433d4f322159451cd85d683526257b6de59dc82f3d064f6da69badd75.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 106, + 311, + 483, + 335 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 339, + 229, + 351 + ], + "lines": [ + { + "bbox": [ + 106, + 338, + 230, + 352 + ], + "spans": [ + { + "bbox": [ + 106, + 338, + 230, + 352 + ], + "score": 1.0, + "content": "The proof is hence completed.", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 106, + 338, + 230, + 352 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 363, + 219, + 375 + ], + "lines": [ + { + "bbox": [ + 105, + 362, + 221, + 376 + ], + "spans": [ + { + "bbox": [ + 105, + 362, + 221, + 376 + ], + "score": 1.0, + "content": "E.5 PROOF OF LEMMA 5", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "title", + "bbox": [ + 107, + 384, + 244, + 395 + ], + "lines": [ + { + "bbox": [ + 106, + 384, + 245, + 397 + ], + "spans": [ + { + "bbox": [ + 106, + 384, + 245, + 397 + ], + "score": 1.0, + "content": "E.5.1 PROOF OF EQUATION 14", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "text", + "bbox": [ + 106, + 403, + 153, + 414 + ], + "lines": [ + { + "bbox": [ + 105, + 403, + 154, + 415 + ], + "spans": [ + { + "bbox": [ + 105, + 403, + 154, + 415 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 403, + 154, + 415 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 130, + 417, + 461, + 489 + ], + "lines": [ + { + "bbox": [ + 130, + 417, + 461, + 489 + ], + "spans": [ + { + "bbox": [ + 130, + 417, + 461, + 489 + ], + "score": 0.93, + "content": "\\begin{array} { r } { \\| j ( \\widehat { \\Sigma } _ { 1 , j } - \\Sigma _ { 1 } ) \\| _ { 2 } = \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { j } \\{ A _ { i } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( 1 , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } } \\\\ { + j \\left\\| \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\left( \\displaystyle \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right) \\right\\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "b5d16af9003d3307b18d4125c3666b87af4ff921dcd66e88053e106750201436.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 130, + 417, + 461, + 441.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 130, + 441.0, + 461, + 465.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 130, + 465.0, + 461, + 489.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 491, + 198, + 502 + ], + "lines": [ + { + "bbox": [ + 106, + 491, + 199, + 504 + ], + "spans": [ + { + "bbox": [ + 106, + 491, + 199, + 504 + ], + "score": 1.0, + "content": "By Lemma 4, we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 491, + 199, + 504 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 506, + 514, + 559 + ], + "lines": [ + { + "bbox": [ + 111, + 506, + 514, + 559 + ], + "spans": [ + { + "bbox": [ + 111, + 506, + 514, + 559 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\left| { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\left( \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right) \\right| \\Big | _ { 2 } \\leq \\varepsilon _ { 0 } ^ { - 2 } q { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\left| \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right| } \\\\ { \\leq \\varepsilon _ { 0 } ^ { - 2 } q ^ { 2 } j ^ { - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } j , \\forall j \\geq . } \\end{array}", + "type": "interline_equation", + "image_path": "2b53ed79d5085e9d09f0a35e76b5b57ab7e04bda5fd67703aa639c9985fc3b6d.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 111, + 506, + 514, + 523.6666666666666 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 111, + 523.6666666666666, + 514, + 541.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 111, + 541.3333333333333, + 514, + 558.9999999999999 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 561, + 260, + 573 + ], + "lines": [ + { + "bbox": [ + 105, + 559, + 257, + 577 + ], + "spans": [ + { + "bbox": [ + 105, + 559, + 204, + 577 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 561, + 257, + 574 + ], + "score": 0.91, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + } + ], + "index": 26 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 559, + 257, + 577 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 578, + 505, + 612 + ], + "lines": [ + { + "bbox": [ + 105, + 577, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 577, + 340, + 591 + ], + "score": 1.0, + "content": "Consider the first term on the RHS of equation 42. For any", + "type": "text" + }, + { + "bbox": [ + 340, + 579, + 363, + 589 + ], + "score": 0.9, + "content": "i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 363, + 577, + 393, + 591 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 394, + 577, + 505, + 590 + ], + "score": 0.91, + "content": "M _ { i } = \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ A _ { i } -", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 588, + 505, + 602 + ], + "spans": [ + { + "bbox": [ + 107, + 589, + 160, + 601 + ], + "score": 0.91, + "content": "\\pi _ { i - 1 } ( 1 , X _ { i } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 588, + 218, + 602 + ], + "score": 1.0, + "content": ". Notice that", + "type": "text" + }, + { + "bbox": [ + 219, + 589, + 256, + 601 + ], + "score": 0.92, + "content": "\\{ M _ { i } \\} _ { i \\geq 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 256, + 588, + 505, + 602 + ], + "score": 1.0, + "content": "forms a martingale difference sequence with respect to the", + "type": "text" + } + ], + "index": 28 + }, + { + "bbox": [ + 106, + 599, + 246, + 613 + ], + "spans": [ + { + "bbox": [ + 106, + 599, + 144, + 613 + ], + "score": 1.0, + "content": "filtration", + "type": "text" + }, + { + "bbox": [ + 144, + 600, + 218, + 612 + ], + "score": 0.92, + "content": "\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 2 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 219, + 599, + 246, + 613 + ], + "score": 1.0, + "content": ", since", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 577, + 505, + 613 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 180, + 615, + 437, + 648 + ], + "lines": [ + { + "bbox": [ + 180, + 615, + 437, + 648 + ], + "spans": [ + { + "bbox": [ + 180, + 615, + 437, + 648 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ A _ { i } - \\pi _ { i - 1 } ( X _ { i } ) \\} \\vert \\mathcal { F } _ { i - 1 } ] } \\\\ { = } & { \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } [ \\mathbb { E } ( \\varphi ( X _ { i } ) \\varphi ( X _ { i } ) ^ { \\top } \\{ A _ { i } - \\pi _ { i - 1 } ( X _ { i } ) \\} \\vert \\mathcal { F } _ { i - 1 } , X _ { i } ) ] = 0 , } \\end{array}", + "type": "interline_equation", + "image_path": "c89454f92bf83e2c0afe3a43e15ae954002dd9b83f6f2f326195ca6d0e28facf.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 180, + 615, + 437, + 626.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 180, + 626.0, + 437, + 637.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 180, + 637.0, + 437, + 648.0 + ], + "spans": [], + "index": 32 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 651, + 505, + 697 + ], + "lines": [ + { + "bbox": [ + 105, + 649, + 506, + 665 + ], + "spans": [ + { + "bbox": [ + 105, + 649, + 133, + 665 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 650, + 162, + 662 + ], + "score": 0.9, + "content": "\\mathrm { E } ^ { \\mathcal { F } _ { i } , { X } _ { i } }", + "type": "inline_equation" + }, + { + "bbox": [ + 162, + 649, + 330, + 665 + ], + "score": 1.0, + "content": "denotes the conditional expectation given", + "type": "text" + }, + { + "bbox": [ + 331, + 652, + 343, + 663 + ], + "score": 0.89, + "content": "X _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 343, + 649, + 361, + 665 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 362, + 652, + 373, + 663 + ], + "score": 0.89, + "content": "{ \\mathcal { F } } _ { i }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 649, + 506, + 665 + ], + "score": 1.0, + "content": ". Here, the first equality is due to", + "type": "text" + } + ], + "index": 33 + }, + { + "bbox": [ + 105, + 662, + 506, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 662, + 124, + 676 + ], + "score": 1.0, + "content": "that", + "type": "text" + }, + { + "bbox": [ + 124, + 663, + 172, + 675 + ], + "score": 0.89, + "content": "X _ { i } \\perp \\perp F _ { i - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 662, + 459, + 676 + ], + "score": 1.0, + "content": ", implied by Lemma 3. Under the given conditions on the basis function", + "type": "text" + }, + { + "bbox": [ + 459, + 663, + 477, + 675 + ], + "score": 0.9, + "content": "\\varphi ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 477, + 662, + 506, + 676 + ], + "score": 1.0, + "content": ", using", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 672, + 506, + 687 + ], + "spans": [ + { + "bbox": [ + 105, + 672, + 506, + 687 + ], + "score": 1.0, + "content": "similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that the following", + "type": "text" + } + ], + "index": 35 + }, + { + "bbox": [ + 104, + 683, + 309, + 698 + ], + "spans": [ + { + "bbox": [ + 104, + 683, + 256, + 698 + ], + "score": 1.0, + "content": "event occurs with probability at least", + "type": "text" + }, + { + "bbox": [ + 256, + 685, + 304, + 697 + ], + "score": 0.91, + "content": "1 - O ( j ^ { - 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 683, + 309, + 698 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 36 + } + ], + "index": 34.5, + "bbox_fs": [ + 104, + 649, + 506, + 698 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 240, + 701, + 350, + 735 + ], + "lines": [ + { + "bbox": [ + 240, + 701, + 350, + 735 + ], + "spans": [ + { + "bbox": [ + 240, + 701, + 350, + 735 + ], + "score": 0.94, + "content": "\\left\\| \\sum _ { i = 1 } ^ { j } M _ { i } \\right\\| _ { 2 } \\preceq \\sqrt { q j \\log ( j ) } .", + "type": "interline_equation", + "image_path": "645f1e1015e9bf71e392b2f562cbe14ef39c72b29365961c7dc919b5213137c3.jpg" + } + ] + } + ], + "index": 37.5, + "virtual_lines": [ + { + "bbox": [ + 240, + 701, + 350, + 718.0 + ], + "spans": [], + "index": 37 + }, + { + "bbox": [ + 240, + 718.0, + 350, + 735.0 + ], + "spans": [], + "index": 38 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 80, + 505, + 108 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 153, + 97 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + }, + { + "bbox": [ + 153, + 81, + 372, + 96 + ], + "score": 0.92, + "content": "\\textstyle \\sum _ { k \\geq j } k ^ { - 2 } \\leq j ^ { - 2 } + \\sum _ { k > j } \\{ k ( k - 1 ) \\} ^ { - 1 } = j ^ { - 2 } + j ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 80, + 505, + 97 + ], + "score": 1.0, + "content": ". Thus, the following occurs with", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 236, + 110 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 183, + 110 + ], + "score": 1.0, + "content": "probability at least", + "type": "text" + }, + { + "bbox": [ + 183, + 96, + 232, + 108 + ], + "score": 0.89, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 94, + 236, + 110 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 113, + 469, + 148 + ], + "lines": [ + { + "bbox": [ + 121, + 113, + 469, + 148 + ], + "spans": [ + { + "bbox": [ + 121, + 113, + 469, + 148 + ], + "score": 0.93, + "content": "\\left\\| \\sum _ { i = 1 } ^ { j } \\{ A _ { i } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( 1 , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q j \\log j } , ~ \\forall j \\geq j _ { n } .", + "type": "interline_equation", + "image_path": "6241a704f222b25d15ae194e74796ea83258131f4c4cae94832855e4410e6cf2.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 121, + 113, + 469, + 124.66666666666667 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 121, + 124.66666666666667, + 469, + 136.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 121, + 136.33333333333334, + 469, + 148.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 152, + 164, + 163 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 165, + 164 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 165, + 164 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 166, + 398, + 183 + ], + "lines": [ + { + "bbox": [ + 191, + 166, + 398, + 183 + ], + "spans": [ + { + "bbox": [ + 191, + 166, + 398, + 183 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\| \\big ( \\widehat { \\Sigma } _ { 1 , k } - \\Sigma _ { 1 } \\big ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "ad6c52e28f6a115fed42965cfbf7d138fbd7d28c9f558c15cac7a557fdf6d6bb.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 191, + 166, + 398, + 183 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 357, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 186, + 357, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 204, + 201 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 187, + 257, + 199 + ], + "score": 0.93, + "content": "1 - O ( j ^ { - \\alpha _ { 0 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 186, + 357, + 201 + ], + "score": 1.0, + "content": ". Similarly, we can show", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 204, + 398, + 220 + ], + "lines": [ + { + "bbox": [ + 192, + 204, + 398, + 220 + ], + "spans": [ + { + "bbox": [ + 192, + 204, + 398, + 220 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\| \\big ( \\widehat { \\Sigma } _ { 0 , k } - \\Sigma _ { 0 } \\big ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "fde34ebf4f47073d3164c6a5257cb8a246dd6257a3cbfdf7724669d99317d6f7.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 192, + 204, + 398, + 220 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 224, + 384, + 237 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 386, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 204, + 239 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 224, + 257, + 237 + ], + "score": 0.93, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 223, + 386, + 239 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "title", + "bbox": [ + 107, + 248, + 244, + 260 + ], + "lines": [ + { + "bbox": [ + 106, + 248, + 245, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 245, + 261 + ], + "score": 1.0, + "content": "E.5.2 PROOF OF EQUATION 15", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 105, + 266, + 464, + 280 + ], + "lines": [ + { + "bbox": [ + 106, + 266, + 465, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 133, + 281 + ], + "score": 1.0, + "content": "When", + "type": "text" + }, + { + "bbox": [ + 133, + 268, + 143, + 279 + ], + "score": 0.86, + "content": "j _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 266, + 179, + 281 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 179, + 267, + 265, + 280 + ], + "score": 0.93, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } ( j _ { n } ) \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 266, + 465, + 281 + ], + "score": 1.0, + "content": ", it follows from equation 14 and equation 40 that", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 284, + 421, + 300 + ], + "lines": [ + { + "bbox": [ + 169, + 284, + 421, + 300 + ], + "spans": [ + { + "bbox": [ + 169, + 284, + 421, + 300 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] - \\Vert \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } \\Vert _ { 2 } \\geq 2 ^ { - 1 } \\varepsilon _ { 0 } , \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "79b6f79d22ec377a11c83d33f9c48044c876be3563ecefcfd922caa681f49a39.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 169, + 284, + 421, + 300 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 304, + 507, + 327 + ], + "lines": [ + { + "bbox": [ + 104, + 303, + 506, + 319 + ], + "spans": [ + { + "bbox": [ + 104, + 303, + 205, + 319 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 206, + 304, + 260, + 317 + ], + "score": 0.93, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 303, + 506, + 319 + ], + "score": 1.0, + "content": ". Combining equation 40 with equation 45 and equation 14,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 315, + 149, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 149, + 328 + ], + "score": 1.0, + "content": "we obtain", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5 + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 329, + 463, + 366 + ], + "lines": [ + { + "bbox": [ + 129, + 329, + 463, + 366 + ], + "spans": [ + { + "bbox": [ + 129, + 329, + 463, + 366 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } & { } & { \\Vert \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\Vert _ { 2 } = \\Vert \\widehat { \\Sigma } _ { a , k } ^ { - 1 } ( \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } ) \\Sigma _ { a } ^ { - 1 } \\Vert _ { 2 } \\leq \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ) \\Vert \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } \\Vert _ { 2 } } \\\\ & { } & { \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "af142631fb71f4c152b63b9a18a2d933b099045e731f6b520324a74acd971c42.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 129, + 329, + 463, + 341.3333333333333 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 129, + 341.3333333333333, + 463, + 353.66666666666663 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 129, + 353.66666666666663, + 463, + 365.99999999999994 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 369, + 385, + 382 + ], + "lines": [ + { + "bbox": [ + 105, + 367, + 386, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 204, + 384 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 369, + 257, + 381 + ], + "score": 0.92, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 367, + 386, + 384 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "title", + "bbox": [ + 107, + 394, + 220, + 405 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 221, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 221, + 407 + ], + "score": 1.0, + "content": "E.6 PROOF OF LEMMA 6", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 506, + 460 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 504, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 140, + 428 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 141, + 415, + 200, + 427 + ], + "score": 0.93, + "content": "l \\in \\{ 1 , \\ldots , q \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 412, + 219, + 428 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 219, + 415, + 244, + 426 + ], + "score": 0.9, + "content": "i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 412, + 276, + 428 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 276, + 414, + 437, + 427 + ], + "score": 0.93, + "content": "M _ { i } ( l ) = \\varphi ^ { ( l ) } ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 412, + 467, + 428 + ], + "score": 1.0, + "content": ". Here,", + "type": "text" + }, + { + "bbox": [ + 468, + 414, + 504, + 427 + ], + "score": 0.92, + "content": "\\varphi ^ { ( l ) } ( X _ { i } )", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 425, + 506, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 182, + 438 + ], + "score": 1.0, + "content": "corresponds to the", + "type": "text" + }, + { + "bbox": [ + 182, + 427, + 186, + 435 + ], + "score": 0.73, + "content": "l", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 425, + 244, + 438 + ], + "score": 1.0, + "content": "-th element of", + "type": "text" + }, + { + "bbox": [ + 244, + 426, + 270, + 438 + ], + "score": 0.93, + "content": "\\varphi ( X _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 425, + 423, + 438 + ], + "score": 1.0, + "content": ". Similar to equation 43, we can show", + "type": "text" + }, + { + "bbox": [ + 423, + 426, + 471, + 438 + ], + "score": 0.93, + "content": "\\{ \\dot { M } _ { i } ( l ) \\} _ { i \\geq 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 425, + 506, + 438 + ], + "score": 1.0, + "content": "forms a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 436, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 345, + 450 + ], + "score": 1.0, + "content": "martingale difference sequence with respect to the filtration", + "type": "text" + }, + { + "bbox": [ + 346, + 437, + 421, + 449 + ], + "score": 0.92, + "content": "\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 436, + 506, + 450 + ], + "score": 1.0, + "content": ". By equation 43, we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 447, + 168, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 158, + 460 + ], + "score": 1.0, + "content": "have for any", + "type": "text" + }, + { + "bbox": [ + 159, + 448, + 163, + 457 + ], + "score": 0.66, + "content": "l", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 447, + 168, + 460 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5 + }, + { + "type": "interline_equation", + "bbox": [ + 201, + 464, + 389, + 480 + ], + "lines": [ + { + "bbox": [ + 201, + 464, + 389, + 480 + ], + "spans": [ + { + "bbox": [ + 201, + 464, + 389, + 480 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathbb { E } \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\le \\lambda _ { \\operatorname* { m a x } } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] \\le \\epsilon _ { 0 } ^ { - 1 } . } \\end{array}", + "type": "interline_equation", + "image_path": "afe12fc10ee3c227df777d4acef5193eee9cdd96ed4cf07fcf1bfcea0bcb2f97.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 201, + 464, + 389, + 480 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 153, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 154, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 154, + 496 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 498, + 465, + 548 + ], + "lines": [ + { + "bbox": [ + 155, + 498, + 465, + 548 + ], + "spans": [ + { + "bbox": [ + 155, + 498, + 465, + 548 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathbb { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} = \\mathbb { E } [ \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } A _ { i } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} ^ { 2 } | \\mathcal { F } _ { i - 1 } ] } \\\\ { \\le } & { \\mathbb { E } [ \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} ^ { 2 } | \\mathcal { F } _ { i - 1 } ] = \\mathbb { E } \\sigma ^ { 2 } ( 1 , X _ { i } ) \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } } \\\\ { \\le } & { 4 \\epsilon _ { 0 } ^ { - 2 } \\mathbb { E } \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\le 4 \\epsilon _ { 0 } ^ { - 3 } , } \\end{array}", + "type": "interline_equation", + "image_path": "2668bb434e3b56e16a896864ab70ca250759cabc5da7815e1ed564d40b89ef96.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 155, + 498, + 465, + 514.6666666666666 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 155, + 514.6666666666666, + 465, + 531.3333333333333 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 155, + 531.3333333333333, + 465, + 547.9999999999999 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 109, + 551, + 503, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 550, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 389, + 565 + ], + "score": 1.0, + "content": "where the first equality is due to (A1), the first inequality is due to that", + "type": "text" + }, + { + "bbox": [ + 389, + 551, + 398, + 561 + ], + "score": 0.83, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 550, + 506, + 565 + ], + "score": 1.0, + "content": "is bounded between 0 and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 561, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 575 + ], + "score": 1.0, + "content": "1, the second equality follows from Lemma 3, the second inequality follows from Lemma 4, and the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 107, + 573, + 312, + 585 + ], + "spans": [ + { + "bbox": [ + 107, + 573, + 312, + 585 + ], + "score": 1.0, + "content": "last inequality is due to equation 46. It follows that", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 589, + 359, + 624 + ], + "lines": [ + { + "bbox": [ + 231, + 589, + 359, + 624 + ], + "spans": [ + { + "bbox": [ + 231, + 589, + 359, + 624 + ], + "score": 0.94, + "content": "\\sum _ { i = 1 } ^ { k } \\operatorname { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} \\leq 4 k \\epsilon _ { 0 } ^ { - 3 } .", + "type": "interline_equation", + "image_path": "23e67584f8cc36883e9a3b4e29af308ce55d06d8088a487c30d7cff53d3a9776.jpg" + } + ] + } + ], + "index": 32.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 589, + 359, + 606.5 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 231, + 606.5, + 359, + 624.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 628, + 276, + 640 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 277, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 277, + 640 + ], + "score": 1.0, + "content": "Similarly, by (A1) and Lemma 4, we have", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34 + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 644, + 369, + 679 + ], + "lines": [ + { + "bbox": [ + 221, + 644, + 369, + 679 + ], + "spans": [ + { + "bbox": [ + 221, + 644, + 369, + 679 + ], + "score": 0.93, + "content": "\\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) \\leq 4 \\epsilon _ { 0 } ^ { - 2 } \\sum _ { i = 1 } ^ { k } \\{ \\psi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } .", + "type": "interline_equation", + "image_path": "48406becbd6ba4ea4f0fc07394d67ea5376f890f7006ef3c39e89e2a74975f18.jpg" + } + ] + } + ], + "index": 35.5, + "virtual_lines": [ + { + "bbox": [ + 221, + 644, + 369, + 661.5 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 221, + 661.5, + 369, + 679.0 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 684, + 419, + 696 + ], + "lines": [ + { + "bbox": [ + 106, + 683, + 419, + 698 + ], + "spans": [ + { + "bbox": [ + 106, + 683, + 351, + 698 + ], + "score": 1.0, + "content": "Similar to equation 44, we can show with probability at least", + "type": "text" + }, + { + "bbox": [ + 352, + 684, + 400, + 696 + ], + "score": 0.93, + "content": "1 - O ( j ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 683, + 419, + 698 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37 + }, + { + "type": "interline_equation", + "bbox": [ + 183, + 701, + 407, + 735 + ], + "lines": [ + { + "bbox": [ + 183, + 701, + 407, + 735 + ], + "spans": [ + { + "bbox": [ + 183, + 701, + 407, + 735 + ], + "score": 0.94, + "content": "\\sum _ { i = 1 } ^ { k } [ M _ { i } ^ { 2 } ( l ) - \\mathtt { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\preceq \\sqrt { q k \\log k } , \\forall k \\ge j .", + "type": "interline_equation", + "image_path": "f8fd90bd8a2e51301e49cefc88bb4296fcdcb9e20235726a8a800a8940838f57.jpg" + } + ] + } + ], + "index": 38.5, + "virtual_lines": [ + { + "bbox": [ + 183, + 701, + 407, + 718.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 183, + 718.0, + 407, + 735.0 + ], + "spans": [], + "index": 39 + } + ] + } + ], + "page_idx": 23, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 749, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 749, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 16, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 80, + 505, + 108 + ], + "lines": [ + { + "bbox": [ + 105, + 80, + 505, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 80, + 153, + 97 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + }, + { + "bbox": [ + 153, + 81, + 372, + 96 + ], + "score": 0.92, + "content": "\\textstyle \\sum _ { k \\geq j } k ^ { - 2 } \\leq j ^ { - 2 } + \\sum _ { k > j } \\{ k ( k - 1 ) \\} ^ { - 1 } = j ^ { - 2 } + j ^ { - 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 373, + 80, + 505, + 97 + ], + "score": 1.0, + "content": ". Thus, the following occurs with", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 94, + 236, + 110 + ], + "spans": [ + { + "bbox": [ + 106, + 94, + 183, + 110 + ], + "score": 1.0, + "content": "probability at least", + "type": "text" + }, + { + "bbox": [ + 183, + 96, + 232, + 108 + ], + "score": 0.89, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 232, + 94, + 236, + 110 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 80, + 505, + 110 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 121, + 113, + 469, + 148 + ], + "lines": [ + { + "bbox": [ + 121, + 113, + 469, + 148 + ], + "spans": [ + { + "bbox": [ + 121, + 113, + 469, + 148 + ], + "score": 0.93, + "content": "\\left\\| \\sum _ { i = 1 } ^ { j } \\{ A _ { i } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( 1 , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q j \\log j } , ~ \\forall j \\geq j _ { n } .", + "type": "interline_equation", + "image_path": "6241a704f222b25d15ae194e74796ea83258131f4c4cae94832855e4410e6cf2.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 121, + 113, + 469, + 124.66666666666667 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 121, + 124.66666666666667, + 469, + 136.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 121, + 136.33333333333334, + 469, + 148.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 152, + 164, + 163 + ], + "lines": [ + { + "bbox": [ + 106, + 152, + 165, + 164 + ], + "spans": [ + { + "bbox": [ + 106, + 152, + 165, + 164 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 106, + 152, + 165, + 164 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 191, + 166, + 398, + 183 + ], + "lines": [ + { + "bbox": [ + 191, + 166, + 398, + 183 + ], + "spans": [ + { + "bbox": [ + 191, + 166, + 398, + 183 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\| \\big ( \\widehat { \\Sigma } _ { 1 , k } - \\Sigma _ { 1 } \\big ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "ad6c52e28f6a115fed42965cfbf7d138fbd7d28c9f558c15cac7a557fdf6d6bb.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 191, + 166, + 398, + 183 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 186, + 357, + 199 + ], + "lines": [ + { + "bbox": [ + 106, + 186, + 357, + 201 + ], + "spans": [ + { + "bbox": [ + 106, + 186, + 204, + 201 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 187, + 257, + 199 + ], + "score": 0.93, + "content": "1 - O ( j ^ { - \\alpha _ { 0 } } )", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 186, + 357, + 201 + ], + "score": 1.0, + "content": ". Similarly, we can show", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 106, + 186, + 357, + 201 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 204, + 398, + 220 + ], + "lines": [ + { + "bbox": [ + 192, + 204, + 398, + 220 + ], + "spans": [ + { + "bbox": [ + 192, + 204, + 398, + 220 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\| \\big ( \\widehat { \\Sigma } _ { 0 , k } - \\Sigma _ { 0 } \\big ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "fde34ebf4f47073d3164c6a5257cb8a246dd6257a3cbfdf7724669d99317d6f7.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 192, + 204, + 398, + 220 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 224, + 384, + 237 + ], + "lines": [ + { + "bbox": [ + 105, + 223, + 386, + 239 + ], + "spans": [ + { + "bbox": [ + 105, + 223, + 204, + 239 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 224, + 257, + 237 + ], + "score": 0.93, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 223, + 386, + 239 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 223, + 386, + 239 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 248, + 244, + 260 + ], + "lines": [ + { + "bbox": [ + 106, + 248, + 245, + 261 + ], + "spans": [ + { + "bbox": [ + 106, + 248, + 245, + 261 + ], + "score": 1.0, + "content": "E.5.2 PROOF OF EQUATION 15", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "text", + "bbox": [ + 105, + 266, + 464, + 280 + ], + "lines": [ + { + "bbox": [ + 106, + 266, + 465, + 281 + ], + "spans": [ + { + "bbox": [ + 106, + 266, + 133, + 281 + ], + "score": 1.0, + "content": "When", + "type": "text" + }, + { + "bbox": [ + 133, + 268, + 143, + 279 + ], + "score": 0.86, + "content": "j _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 144, + 266, + 179, + 281 + ], + "score": 1.0, + "content": "satisfies", + "type": "text" + }, + { + "bbox": [ + 179, + 267, + 265, + 280 + ], + "score": 0.93, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } ( j _ { n } ) \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 266, + 266, + 465, + 281 + ], + "score": 1.0, + "content": ", it follows from equation 14 and equation 40 that", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 266, + 465, + 281 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 169, + 284, + 421, + 300 + ], + "lines": [ + { + "bbox": [ + 169, + 284, + 421, + 300 + ], + "spans": [ + { + "bbox": [ + 169, + 284, + 421, + 300 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] - \\Vert \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } \\Vert _ { 2 } \\geq 2 ^ { - 1 } \\varepsilon _ { 0 } , \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "79b6f79d22ec377a11c83d33f9c48044c876be3563ecefcfd922caa681f49a39.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 169, + 284, + 421, + 300 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 304, + 507, + 327 + ], + "lines": [ + { + "bbox": [ + 104, + 303, + 506, + 319 + ], + "spans": [ + { + "bbox": [ + 104, + 303, + 205, + 319 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 206, + 304, + 260, + 317 + ], + "score": 0.93, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 303, + 506, + 319 + ], + "score": 1.0, + "content": ". Combining equation 40 with equation 45 and equation 14,", + "type": "text" + } + ], + "index": 13 + }, + { + "bbox": [ + 105, + 315, + 149, + 328 + ], + "spans": [ + { + "bbox": [ + 105, + 315, + 149, + 328 + ], + "score": 1.0, + "content": "we obtain", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 13.5, + "bbox_fs": [ + 104, + 303, + 506, + 328 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 329, + 463, + 366 + ], + "lines": [ + { + "bbox": [ + 129, + 329, + 463, + 366 + ], + "spans": [ + { + "bbox": [ + 129, + 329, + 463, + 366 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } & { } & { \\Vert \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\Vert _ { 2 } = \\Vert \\widehat { \\Sigma } _ { a , k } ^ { - 1 } ( \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } ) \\Sigma _ { a } ^ { - 1 } \\Vert _ { 2 } \\leq \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ) \\Vert \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } \\Vert _ { 2 } } \\\\ & { } & { \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}", + "type": "interline_equation", + "image_path": "af142631fb71f4c152b63b9a18a2d933b099045e731f6b520324a74acd971c42.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 129, + 329, + 463, + 341.3333333333333 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 129, + 341.3333333333333, + 463, + 353.66666666666663 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 129, + 353.66666666666663, + 463, + 365.99999999999994 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 369, + 385, + 382 + ], + "lines": [ + { + "bbox": [ + 105, + 367, + 386, + 384 + ], + "spans": [ + { + "bbox": [ + 105, + 367, + 204, + 384 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 369, + 257, + 381 + ], + "score": 0.92, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 367, + 386, + 384 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18, + "bbox_fs": [ + 105, + 367, + 386, + 384 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 394, + 220, + 405 + ], + "lines": [ + { + "bbox": [ + 105, + 393, + 221, + 407 + ], + "spans": [ + { + "bbox": [ + 105, + 393, + 221, + 407 + ], + "score": 1.0, + "content": "E.6 PROOF OF LEMMA 6", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "text", + "bbox": [ + 106, + 413, + 506, + 460 + ], + "lines": [ + { + "bbox": [ + 105, + 412, + 504, + 428 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 140, + 428 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 141, + 415, + 200, + 427 + ], + "score": 0.93, + "content": "l \\in \\{ 1 , \\ldots , q \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 201, + 412, + 219, + 428 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 219, + 415, + 244, + 426 + ], + "score": 0.9, + "content": "i \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 245, + 412, + 276, + 428 + ], + "score": 1.0, + "content": ", define", + "type": "text" + }, + { + "bbox": [ + 276, + 414, + 437, + 427 + ], + "score": 0.93, + "content": "M _ { i } ( l ) = \\varphi ^ { ( l ) } ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 437, + 412, + 467, + 428 + ], + "score": 1.0, + "content": ". Here,", + "type": "text" + }, + { + "bbox": [ + 468, + 414, + 504, + 427 + ], + "score": 0.92, + "content": "\\varphi ^ { ( l ) } ( X _ { i } )", + "type": "inline_equation" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 425, + 506, + 438 + ], + "spans": [ + { + "bbox": [ + 105, + 425, + 182, + 438 + ], + "score": 1.0, + "content": "corresponds to the", + "type": "text" + }, + { + "bbox": [ + 182, + 427, + 186, + 435 + ], + "score": 0.73, + "content": "l", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 425, + 244, + 438 + ], + "score": 1.0, + "content": "-th element of", + "type": "text" + }, + { + "bbox": [ + 244, + 426, + 270, + 438 + ], + "score": 0.93, + "content": "\\varphi ( X _ { i } )", + "type": "inline_equation" + }, + { + "bbox": [ + 271, + 425, + 423, + 438 + ], + "score": 1.0, + "content": ". Similar to equation 43, we can show", + "type": "text" + }, + { + "bbox": [ + 423, + 426, + 471, + 438 + ], + "score": 0.93, + "content": "\\{ \\dot { M } _ { i } ( l ) \\} _ { i \\geq 1 }", + "type": "inline_equation" + }, + { + "bbox": [ + 471, + 425, + 506, + 438 + ], + "score": 1.0, + "content": "forms a", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 436, + 506, + 450 + ], + "spans": [ + { + "bbox": [ + 105, + 436, + 345, + 450 + ], + "score": 1.0, + "content": "martingale difference sequence with respect to the filtration", + "type": "text" + }, + { + "bbox": [ + 346, + 437, + 421, + 449 + ], + "score": 0.92, + "content": "\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 421, + 436, + 506, + 450 + ], + "score": 1.0, + "content": ". By equation 43, we", + "type": "text" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 447, + 168, + 460 + ], + "spans": [ + { + "bbox": [ + 105, + 447, + 158, + 460 + ], + "score": 1.0, + "content": "have for any", + "type": "text" + }, + { + "bbox": [ + 159, + 448, + 163, + 457 + ], + "score": 0.66, + "content": "l", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 447, + 168, + 460 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 412, + 506, + 460 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 201, + 464, + 389, + 480 + ], + "lines": [ + { + "bbox": [ + 201, + 464, + 389, + 480 + ], + "spans": [ + { + "bbox": [ + 201, + 464, + 389, + 480 + ], + "score": 0.9, + "content": "\\begin{array} { r } { \\mathbb { E } \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\le \\lambda _ { \\operatorname* { m a x } } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] \\le \\epsilon _ { 0 } ^ { - 1 } . } \\end{array}", + "type": "interline_equation", + "image_path": "afe12fc10ee3c227df777d4acef5193eee9cdd96ed4cf07fcf1bfcea0bcb2f97.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 201, + 464, + 389, + 480 + ], + "spans": [], + "index": 24 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 484, + 153, + 495 + ], + "lines": [ + { + "bbox": [ + 105, + 482, + 154, + 496 + ], + "spans": [ + { + "bbox": [ + 105, + 482, + 154, + 496 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25, + "bbox_fs": [ + 105, + 482, + 154, + 496 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 155, + 498, + 465, + 548 + ], + "lines": [ + { + "bbox": [ + 155, + 498, + 465, + 548 + ], + "spans": [ + { + "bbox": [ + 155, + 498, + 465, + 548 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\mathbb { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} = \\mathbb { E } [ \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } A _ { i } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} ^ { 2 } | \\mathcal { F } _ { i - 1 } ] } \\\\ { \\le } & { \\mathbb { E } [ \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} ^ { 2 } | \\mathcal { F } _ { i - 1 } ] = \\mathbb { E } \\sigma ^ { 2 } ( 1 , X _ { i } ) \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } } \\\\ { \\le } & { 4 \\epsilon _ { 0 } ^ { - 2 } \\mathbb { E } \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\le 4 \\epsilon _ { 0 } ^ { - 3 } , } \\end{array}", + "type": "interline_equation", + "image_path": "2668bb434e3b56e16a896864ab70ca250759cabc5da7815e1ed564d40b89ef96.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 155, + 498, + 465, + 514.6666666666666 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 155, + 514.6666666666666, + 465, + 531.3333333333333 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 155, + 531.3333333333333, + 465, + 547.9999999999999 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 109, + 551, + 503, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 550, + 506, + 565 + ], + "spans": [ + { + "bbox": [ + 106, + 550, + 389, + 565 + ], + "score": 1.0, + "content": "where the first equality is due to (A1), the first inequality is due to that", + "type": "text" + }, + { + "bbox": [ + 389, + 551, + 398, + 561 + ], + "score": 0.83, + "content": "A", + "type": "inline_equation" + }, + { + "bbox": [ + 398, + 550, + 506, + 565 + ], + "score": 1.0, + "content": "is bounded between 0 and", + "type": "text" + } + ], + "index": 29 + }, + { + "bbox": [ + 106, + 561, + 505, + 575 + ], + "spans": [ + { + "bbox": [ + 106, + 561, + 505, + 575 + ], + "score": 1.0, + "content": "1, the second equality follows from Lemma 3, the second inequality follows from Lemma 4, and the", + "type": "text" + } + ], + "index": 30 + }, + { + "bbox": [ + 107, + 573, + 312, + 585 + ], + "spans": [ + { + "bbox": [ + 107, + 573, + 312, + 585 + ], + "score": 1.0, + "content": "last inequality is due to equation 46. It follows that", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 30, + "bbox_fs": [ + 106, + 550, + 506, + 585 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 589, + 359, + 624 + ], + "lines": [ + { + "bbox": [ + 231, + 589, + 359, + 624 + ], + "spans": [ + { + "bbox": [ + 231, + 589, + 359, + 624 + ], + "score": 0.94, + "content": "\\sum _ { i = 1 } ^ { k } \\operatorname { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} \\leq 4 k \\epsilon _ { 0 } ^ { - 3 } .", + "type": "interline_equation", + "image_path": "23e67584f8cc36883e9a3b4e29af308ce55d06d8088a487c30d7cff53d3a9776.jpg" + } + ] + } + ], + "index": 32.5, + "virtual_lines": [ + { + "bbox": [ + 231, + 589, + 359, + 606.5 + ], + "spans": [], + "index": 32 + }, + { + "bbox": [ + 231, + 606.5, + 359, + 624.0 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 628, + 276, + 640 + ], + "lines": [ + { + "bbox": [ + 106, + 627, + 277, + 640 + ], + "spans": [ + { + "bbox": [ + 106, + 627, + 277, + 640 + ], + "score": 1.0, + "content": "Similarly, by (A1) and Lemma 4, we have", + "type": "text" + } + ], + "index": 34 + } + ], + "index": 34, + "bbox_fs": [ + 106, + 627, + 277, + 640 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 221, + 644, + 369, + 679 + ], + "lines": [ + { + "bbox": [ + 221, + 644, + 369, + 679 + ], + "spans": [ + { + "bbox": [ + 221, + 644, + 369, + 679 + ], + "score": 0.93, + "content": "\\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) \\leq 4 \\epsilon _ { 0 } ^ { - 2 } \\sum _ { i = 1 } ^ { k } \\{ \\psi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } .", + "type": "interline_equation", + "image_path": "48406becbd6ba4ea4f0fc07394d67ea5376f890f7006ef3c39e89e2a74975f18.jpg" + } + ] + } + ], + "index": 35.5, + "virtual_lines": [ + { + "bbox": [ + 221, + 644, + 369, + 661.5 + ], + "spans": [], + "index": 35 + }, + { + "bbox": [ + 221, + 661.5, + 369, + 679.0 + ], + "spans": [], + "index": 36 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 684, + 419, + 696 + ], + "lines": [ + { + "bbox": [ + 106, + 683, + 419, + 698 + ], + "spans": [ + { + "bbox": [ + 106, + 683, + 351, + 698 + ], + "score": 1.0, + "content": "Similar to equation 44, we can show with probability at least", + "type": "text" + }, + { + "bbox": [ + 352, + 684, + 400, + 696 + ], + "score": 0.93, + "content": "1 - O ( j ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 400, + 683, + 419, + 698 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 37 + } + ], + "index": 37, + "bbox_fs": [ + 106, + 683, + 419, + 698 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 183, + 701, + 407, + 735 + ], + "lines": [ + { + "bbox": [ + 183, + 701, + 407, + 735 + ], + "spans": [ + { + "bbox": [ + 183, + 701, + 407, + 735 + ], + "score": 0.94, + "content": "\\sum _ { i = 1 } ^ { k } [ M _ { i } ^ { 2 } ( l ) - \\mathtt { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\preceq \\sqrt { q k \\log k } , \\forall k \\ge j .", + "type": "interline_equation", + "image_path": "f8fd90bd8a2e51301e49cefc88bb4296fcdcb9e20235726a8a800a8940838f57.jpg" + } + ] + } + ], + "index": 38.5, + "virtual_lines": [ + { + "bbox": [ + 183, + 701, + 407, + 718.0 + ], + "spans": [], + "index": 38 + }, + { + "bbox": [ + 183, + 718.0, + 407, + 735.0 + ], + "spans": [], + "index": 39 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 451, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 452, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 201, + 96 + ], + "score": 1.0, + "content": "Thus, for any sequence", + "type": "text" + }, + { + "bbox": [ + 201, + 83, + 212, + 94 + ], + "score": 0.88, + "content": "j _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 81, + 264, + 96 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + }, + { + "bbox": [ + 265, + 82, + 333, + 95 + ], + "score": 0.92, + "content": "j _ { n } / \\log ( j _ { n } ) \\gg q", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 81, + 452, + 96 + ], + "score": 1.0, + "content": ", we have by equation 47 that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 98, + 400, + 133 + ], + "lines": [ + { + "bbox": [ + 189, + 98, + 400, + 133 + ], + "spans": [ + { + "bbox": [ + 189, + 98, + 400, + 133 + ], + "score": 0.93, + "content": "\\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) + \\sum _ { i = 1 } ^ { k } \\mathrm { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} \\leq \\bar { c } k , \\forall k \\geq j _ { n } ,", + "type": "interline_equation", + "image_path": "b41093d819950a1f95b6e5633c4c569faa132acbf11e3da3e39890934d14c894.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 189, + 98, + 400, + 115.5 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 189, + 115.5, + 400, + 133.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 136, + 416, + 150 + ], + "lines": [ + { + "bbox": [ + 105, + 136, + 416, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 180, + 151 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 138, + 204, + 148 + ], + "score": 0.9, + "content": "\\bar { c } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 136, + 304, + 151 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 304, + 137, + 353, + 150 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 136, + 416, + 151 + ], + "score": 1.0, + "content": ". It follows that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 154, + 527, + 355 + ], + "lines": [ + { + "bbox": [ + 124, + 154, + 527, + 355 + ], + "spans": [ + { + "bbox": [ + 124, + 154, + 527, + 355 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\mathbb { P } _ { \\mathbb { P } } ( \\underset { \\mathrm { S t } } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\sum } } M _ { i } ( \\ell ) \\leq 2 \\sqrt { \\ 6 \\mathbb { k } } \\log k ) \\Bigg \\} } \\\\ & \\mathbb { P } _ { \\mathbb { P } } ( \\{ \\underset { s = 2 } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\prod } } \\frac { \\lambda } { \\underset { s = 1 } { \\prod } } ( \\lambda ) \\leq 2 \\sqrt { 6 \\mathbb { k } \\mathbb { k } \\log k } \\} \\prod _ { s = 2 } \\Biggl \\{ \\underset { s = 1 } { \\overset { k } { \\prod } } \\underset { s = 1 } { \\overset { k } { \\sum } } \\big [ M _ { i } ^ { 2 } ( \\ell ) + \\frac { 4 \\lambda _ { i } ^ { 2 } ( \\ell ) ( \\ell ) ( \\mathcal { F } _ { i - 1 } ) } { \\underset { s = 1 } { \\overset { k } { \\prod } } } ] \\leq \\mathbb { e } \\mathbb { k } \\} \\Bigg \\} \\\\ & { \\mathcal { O } _ { \\mathbb { Q } ^ { ( - 1 ) } } ^ { - 1 } \\succeq \\mathbb { P r } ( \\{ \\underset { \\mathrm { S t } \\geq \\delta _ { i } } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\sum } } ( \\lambda ) ^ { \\frac { \\ell } { \\ell } } ( \\ell ) + \\underset { s = 1 } { \\overset { k } { \\prod } } ( \\ell ) ( \\mathcal { F } _ { i } ) \\underset { s = 1 } { \\overset { k } { \\sum } } \\} \\leq \\mathbb { E } \\mathbb { k } \\} \\Bigg ) - \\mathcal { O } ( \\underset { \\mathbb { P } } { \\longrightarrow } ^ { - 1 } ) } \\\\ & \\mathbb { P } _ { \\mathbb { P } } ( \\{ \\underset { \\mathrm { S t } \\geq \\delta _ { i } } { \\bigcup } \\underset { s = 1 } { \\overset { k } { \\sum } } \\frac { \\lambda } { \\underset { s = 1 } { \\overset { k } { \\prod } } ( \\ell ) \\leq 2 \\sqrt { 6 \\mathbb { k } \\log \\ell } } \\} \\int \\prod _ { s = \\underset { i = 1 } { \\overset { k } { \\sum } } \\sum _ { i } \\mathcal { M } _ { i } ^ { 2 } ( \\ell ) + \\underset { s = 1 } { \\overset { k } { \\sum } } ( \\lambda ) ^ { \\frac { \\ell } { \\sum } } ( \\ell ) \\mathcal { F } _ { i - 1 } \\mathbb { I } \\} \\leq \\mathbb { e } \\mathbb { k } \\Bigg \\} ) } \\\\ & 1 - \\mathbb { P } _ \\mathbb \\end{array}", + "type": "interline_equation", + "image_path": "838907517dcd3561377156e25d0bd971e23583574cd972c086444e6f60d46ce2.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 124, + 154, + 527, + 221.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 124, + 221.0, + 527, + 288.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 124, + 288.0, + 527, + 355.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 370, + 428, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 370, + 428, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 428, + 384 + ], + "score": 1.0, + "content": "By Bonferroni’s inequality and Theorem 2.1 of Bercu & Touati (2008), we have", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 388, + 514, + 536 + ], + "lines": [ + { + "bbox": [ + 114, + 388, + 514, + 536 + ], + "spans": [ + { + "bbox": [ + 114, + 388, + 514, + 536 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } ( \\displaystyle \\bigcap _ { k \\geq j _ { n } } \\{ \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | \\leq 2 \\sqrt { c k \\log { k } } \\} ) \\geq 1 - O ( j _ { n } ^ { - 1 } ) } \\\\ { - } & { \\displaystyle \\sum _ { k \\geq j _ { n } } \\operatorname* { P r } _ { \\epsilon } ( \\{ | \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \\sqrt { c k \\log { k } } \\} \\bigcap _ { k ^ { \\prime } \\geq j _ { n } } \\{ \\displaystyle \\sum _ { i = 1 } ^ { k ^ { \\prime } } [ \\displaystyle M _ { i } ^ { 2 } ( l ) + \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\leq \\bar { \\alpha } k ^ { \\prime } \\} \\} ) } \\\\ { \\geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - \\displaystyle \\sum _ { k \\geq j _ { n } } \\operatorname* { P r } ( \\{ | \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \\sqrt { c k \\log { k } } \\} \\bigcap \\{ \\displaystyle \\sum _ { i = 1 } ^ { k } [ \\displaystyle M _ { i } ^ { 2 } ( l ) + \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\leq \\bar { \\alpha } k \\} } \\\\ { \\geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - 2 \\displaystyle \\sum _ { k \\geq j _ { n } } \\exp ( - \\frac { 4 \\bar { c } k \\log { k } } { 2 \\bar { c k } } ) = 1 - O ( j _ { n } ^ { - 1 } ) - \\displaystyle \\sum _ { k \\geq j _ { n } } 2 k ^ { - 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "b1509510102a43bcf4a0c195e06f4307afea19d0869d9161e6467f7744b813a1.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 114, + 388, + 514, + 437.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 114, + 437.3333333333333, + 514, + 486.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 114, + 486.66666666666663, + 514, + 536.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 538, + 504, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 287, + 554 + ], + "score": 1.0, + "content": "The last term on the RHS of equation 49 is", + "type": "text" + }, + { + "bbox": [ + 287, + 539, + 337, + 551 + ], + "score": 0.9, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 538, + 506, + 554 + ], + "score": 1.0, + "content": ". To summarize, we have shown that the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 548, + 351, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 548, + 297, + 565 + ], + "score": 1.0, + "content": "following event occurs with probability at least", + "type": "text" + }, + { + "bbox": [ + 297, + 551, + 345, + 563 + ], + "score": 0.89, + "content": "1 - \\dot { O } ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 548, + 351, + 565 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5 + }, + { + "type": "interline_equation", + "bbox": [ + 220, + 566, + 370, + 602 + ], + "lines": [ + { + "bbox": [ + 220, + 566, + 370, + 602 + ], + "spans": [ + { + "bbox": [ + 220, + 566, + 370, + 602 + ], + "score": 0.94, + "content": "\\bigcap _ { k \\geq j _ { n } } \\left\\{ | \\sum _ { i = 1 } ^ { k } M _ { i } ( l ) | \\leq 2 { \\sqrt { { \\bar { c } } k \\log k } } \\right\\} .", + "type": "interline_equation", + "image_path": "8c3af4ca7646bf3d8907c3c80948bc9ec80996b1f00b121af61848ce91b48201.jpg" + } + ] + } + ], + "index": 13.5, + "virtual_lines": [ + { + "bbox": [ + 220, + 566, + 370, + 584.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 220, + 584.0, + 370, + 602.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 605, + 253, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 605, + 253, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 253, + 619 + ], + "score": 1.0, + "content": "By Bonferroni’s inequality, we have", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 170, + 621, + 420, + 657 + ], + "lines": [ + { + "bbox": [ + 170, + 621, + 420, + 657 + ], + "spans": [ + { + "bbox": [ + 170, + 621, + 420, + 657 + ], + "score": 0.93, + "content": "\\bigcap _ { k \\geq j _ { n } } \\left\\{ \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} \\right. _ { 2 } \\leq 2 \\sqrt { \\bar { c } q k \\log k } \\right\\} ,", + "type": "interline_equation", + "image_path": "081e1b472858fe6faf480f62673b5072d8ff0a4d50adc86fe6729634ef459d11.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 170, + 621, + 420, + 633.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 170, + 633.0, + 420, + 645.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 170, + 645.0, + 420, + 657.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 662, + 360, + 676 + ], + "lines": [ + { + "bbox": [ + 104, + 659, + 362, + 680 + ], + "spans": [ + { + "bbox": [ + 104, + 659, + 204, + 680 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 661, + 261, + 677 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 / 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 659, + 362, + 680 + ], + "score": 1.0, + "content": ". Similarly, we can show", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "interline_equation", + "bbox": [ + 160, + 680, + 429, + 715 + ], + "lines": [ + { + "bbox": [ + 160, + 680, + 429, + 715 + ], + "spans": [ + { + "bbox": [ + 160, + 680, + 429, + 715 + ], + "score": 0.93, + "content": "\\bigcap _ { k \\geq j _ { n } } \\left\\{ \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} \\right. _ { 2 } \\leq c \\sqrt { q k \\log k } \\right\\} ,", + "type": "interline_equation", + "image_path": "3109711a5c8b13618da997f3e9541183889c5dc855b1cff24b28f53769852da4.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 160, + 680, + 429, + 691.6666666666666 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 160, + 691.6666666666666, + 429, + 703.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 160, + 703.3333333333333, + 429, + 714.9999999999999 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 719, + 480, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 719, + 482, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 180, + 734 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 721, + 204, + 731 + ], + "score": 0.89, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 719, + 304, + 734 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 305, + 721, + 353, + 732 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 719, + 482, + 734 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23 + } + ], + "page_idx": 24, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 749, + 313, + 765 + ], + "spans": [ + { + "bbox": [ + 298, + 749, + 313, + 765 + ], + "score": 1.0, + "content": "", + "type": "text", + "height": 16, + "width": 15 + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 81, + 451, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 452, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 201, + 96 + ], + "score": 1.0, + "content": "Thus, for any sequence", + "type": "text" + }, + { + "bbox": [ + 201, + 83, + 212, + 94 + ], + "score": 0.88, + "content": "j _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 212, + 81, + 264, + 96 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + }, + { + "bbox": [ + 265, + 82, + 333, + 95 + ], + "score": 0.92, + "content": "j _ { n } / \\log ( j _ { n } ) \\gg q", + "type": "inline_equation" + }, + { + "bbox": [ + 333, + 81, + 452, + 96 + ], + "score": 1.0, + "content": ", we have by equation 47 that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 452, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 189, + 98, + 400, + 133 + ], + "lines": [ + { + "bbox": [ + 189, + 98, + 400, + 133 + ], + "spans": [ + { + "bbox": [ + 189, + 98, + 400, + 133 + ], + "score": 0.93, + "content": "\\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) + \\sum _ { i = 1 } ^ { k } \\mathrm { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} \\leq \\bar { c } k , \\forall k \\geq j _ { n } ,", + "type": "interline_equation", + "image_path": "b41093d819950a1f95b6e5633c4c569faa132acbf11e3da3e39890934d14c894.jpg" + } + ] + } + ], + "index": 1.5, + "virtual_lines": [ + { + "bbox": [ + 189, + 98, + 400, + 115.5 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 189, + 115.5, + 400, + 133.0 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 136, + 416, + 150 + ], + "lines": [ + { + "bbox": [ + 105, + 136, + 416, + 151 + ], + "spans": [ + { + "bbox": [ + 105, + 136, + 180, + 151 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 138, + 204, + 148 + ], + "score": 0.9, + "content": "\\bar { c } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 136, + 304, + 151 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 304, + 137, + 353, + 150 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 353, + 136, + 416, + 151 + ], + "score": 1.0, + "content": ". It follows that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 105, + 136, + 416, + 151 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 154, + 527, + 355 + ], + "lines": [ + { + "bbox": [ + 124, + 154, + 527, + 355 + ], + "spans": [ + { + "bbox": [ + 124, + 154, + 527, + 355 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\mathbb { P } _ { \\mathbb { P } } ( \\underset { \\mathrm { S t } } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\sum } } M _ { i } ( \\ell ) \\leq 2 \\sqrt { \\ 6 \\mathbb { k } } \\log k ) \\Bigg \\} } \\\\ & \\mathbb { P } _ { \\mathbb { P } } ( \\{ \\underset { s = 2 } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\prod } } \\frac { \\lambda } { \\underset { s = 1 } { \\prod } } ( \\lambda ) \\leq 2 \\sqrt { 6 \\mathbb { k } \\mathbb { k } \\log k } \\} \\prod _ { s = 2 } \\Biggl \\{ \\underset { s = 1 } { \\overset { k } { \\prod } } \\underset { s = 1 } { \\overset { k } { \\sum } } \\big [ M _ { i } ^ { 2 } ( \\ell ) + \\frac { 4 \\lambda _ { i } ^ { 2 } ( \\ell ) ( \\ell ) ( \\mathcal { F } _ { i - 1 } ) } { \\underset { s = 1 } { \\overset { k } { \\prod } } } ] \\leq \\mathbb { e } \\mathbb { k } \\} \\Bigg \\} \\\\ & { \\mathcal { O } _ { \\mathbb { Q } ^ { ( - 1 ) } } ^ { - 1 } \\succeq \\mathbb { P r } ( \\{ \\underset { \\mathrm { S t } \\geq \\delta _ { i } } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\sum } } ( \\lambda ) ^ { \\frac { \\ell } { \\ell } } ( \\ell ) + \\underset { s = 1 } { \\overset { k } { \\prod } } ( \\ell ) ( \\mathcal { F } _ { i } ) \\underset { s = 1 } { \\overset { k } { \\sum } } \\} \\leq \\mathbb { E } \\mathbb { k } \\} \\Bigg ) - \\mathcal { O } ( \\underset { \\mathbb { P } } { \\longrightarrow } ^ { - 1 } ) } \\\\ & \\mathbb { P } _ { \\mathbb { P } } ( \\{ \\underset { \\mathrm { S t } \\geq \\delta _ { i } } { \\bigcup } \\underset { s = 1 } { \\overset { k } { \\sum } } \\frac { \\lambda } { \\underset { s = 1 } { \\overset { k } { \\prod } } ( \\ell ) \\leq 2 \\sqrt { 6 \\mathbb { k } \\log \\ell } } \\} \\int \\prod _ { s = \\underset { i = 1 } { \\overset { k } { \\sum } } \\sum _ { i } \\mathcal { M } _ { i } ^ { 2 } ( \\ell ) + \\underset { s = 1 } { \\overset { k } { \\sum } } ( \\lambda ) ^ { \\frac { \\ell } { \\sum } } ( \\ell ) \\mathcal { F } _ { i - 1 } \\mathbb { I } \\} \\leq \\mathbb { e } \\mathbb { k } \\Bigg \\} ) } \\\\ & 1 - \\mathbb { P } _ \\mathbb \\end{array}", + "type": "interline_equation", + "image_path": "838907517dcd3561377156e25d0bd971e23583574cd972c086444e6f60d46ce2.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 124, + 154, + 527, + 221.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 124, + 221.0, + 527, + 288.0 + ], + "spans": [], + "index": 5 + }, + { + "bbox": [ + 124, + 288.0, + 527, + 355.0 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 370, + 428, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 370, + 428, + 384 + ], + "spans": [ + { + "bbox": [ + 106, + 370, + 428, + 384 + ], + "score": 1.0, + "content": "By Bonferroni’s inequality and Theorem 2.1 of Bercu & Touati (2008), we have", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 106, + 370, + 428, + 384 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 388, + 514, + 536 + ], + "lines": [ + { + "bbox": [ + 114, + 388, + 514, + 536 + ], + "spans": [ + { + "bbox": [ + 114, + 388, + 514, + 536 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } ( \\displaystyle \\bigcap _ { k \\geq j _ { n } } \\{ \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | \\leq 2 \\sqrt { c k \\log { k } } \\} ) \\geq 1 - O ( j _ { n } ^ { - 1 } ) } \\\\ { - } & { \\displaystyle \\sum _ { k \\geq j _ { n } } \\operatorname* { P r } _ { \\epsilon } ( \\{ | \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \\sqrt { c k \\log { k } } \\} \\bigcap _ { k ^ { \\prime } \\geq j _ { n } } \\{ \\displaystyle \\sum _ { i = 1 } ^ { k ^ { \\prime } } [ \\displaystyle M _ { i } ^ { 2 } ( l ) + \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\leq \\bar { \\alpha } k ^ { \\prime } \\} \\} ) } \\\\ { \\geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - \\displaystyle \\sum _ { k \\geq j _ { n } } \\operatorname* { P r } ( \\{ | \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \\sqrt { c k \\log { k } } \\} \\bigcap \\{ \\displaystyle \\sum _ { i = 1 } ^ { k } [ \\displaystyle M _ { i } ^ { 2 } ( l ) + \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\leq \\bar { \\alpha } k \\} } \\\\ { \\geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - 2 \\displaystyle \\sum _ { k \\geq j _ { n } } \\exp ( - \\frac { 4 \\bar { c } k \\log { k } } { 2 \\bar { c k } } ) = 1 - O ( j _ { n } ^ { - 1 } ) - \\displaystyle \\sum _ { k \\geq j _ { n } } 2 k ^ { - 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "b1509510102a43bcf4a0c195e06f4307afea19d0869d9161e6467f7744b813a1.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 114, + 388, + 514, + 437.3333333333333 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 114, + 437.3333333333333, + 514, + 486.66666666666663 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 114, + 486.66666666666663, + 514, + 536.0 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 538, + 504, + 563 + ], + "lines": [ + { + "bbox": [ + 105, + 538, + 506, + 554 + ], + "spans": [ + { + "bbox": [ + 105, + 538, + 287, + 554 + ], + "score": 1.0, + "content": "The last term on the RHS of equation 49 is", + "type": "text" + }, + { + "bbox": [ + 287, + 539, + 337, + 551 + ], + "score": 0.9, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 337, + 538, + 506, + 554 + ], + "score": 1.0, + "content": ". To summarize, we have shown that the", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 105, + 548, + 351, + 565 + ], + "spans": [ + { + "bbox": [ + 105, + 548, + 297, + 565 + ], + "score": 1.0, + "content": "following event occurs with probability at least", + "type": "text" + }, + { + "bbox": [ + 297, + 551, + 345, + 563 + ], + "score": 0.89, + "content": "1 - \\dot { O } ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 346, + 548, + 351, + 565 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 538, + 506, + 565 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 220, + 566, + 370, + 602 + ], + "lines": [ + { + "bbox": [ + 220, + 566, + 370, + 602 + ], + "spans": [ + { + "bbox": [ + 220, + 566, + 370, + 602 + ], + "score": 0.94, + "content": "\\bigcap _ { k \\geq j _ { n } } \\left\\{ | \\sum _ { i = 1 } ^ { k } M _ { i } ( l ) | \\leq 2 { \\sqrt { { \\bar { c } } k \\log k } } \\right\\} .", + "type": "interline_equation", + "image_path": "8c3af4ca7646bf3d8907c3c80948bc9ec80996b1f00b121af61848ce91b48201.jpg" + } + ] + } + ], + "index": 13.5, + "virtual_lines": [ + { + "bbox": [ + 220, + 566, + 370, + 584.0 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 220, + 584.0, + 370, + 602.0 + ], + "spans": [], + "index": 14 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 605, + 253, + 617 + ], + "lines": [ + { + "bbox": [ + 106, + 605, + 253, + 619 + ], + "spans": [ + { + "bbox": [ + 106, + 605, + 253, + 619 + ], + "score": 1.0, + "content": "By Bonferroni’s inequality, we have", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15, + "bbox_fs": [ + 106, + 605, + 253, + 619 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 170, + 621, + 420, + 657 + ], + "lines": [ + { + "bbox": [ + 170, + 621, + 420, + 657 + ], + "spans": [ + { + "bbox": [ + 170, + 621, + 420, + 657 + ], + "score": 0.93, + "content": "\\bigcap _ { k \\geq j _ { n } } \\left\\{ \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} \\right. _ { 2 } \\leq 2 \\sqrt { \\bar { c } q k \\log k } \\right\\} ,", + "type": "interline_equation", + "image_path": "081e1b472858fe6faf480f62673b5072d8ff0a4d50adc86fe6729634ef459d11.jpg" + } + ] + } + ], + "index": 17, + "virtual_lines": [ + { + "bbox": [ + 170, + 621, + 420, + 633.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 170, + 633.0, + 420, + 645.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 170, + 645.0, + 420, + 657.0 + ], + "spans": [], + "index": 18 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 662, + 360, + 676 + ], + "lines": [ + { + "bbox": [ + 104, + 659, + 362, + 680 + ], + "spans": [ + { + "bbox": [ + 104, + 659, + 204, + 680 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 661, + 261, + 677 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 / 2 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 659, + 362, + 680 + ], + "score": 1.0, + "content": ". Similarly, we can show", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 104, + 659, + 362, + 680 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 160, + 680, + 429, + 715 + ], + "lines": [ + { + "bbox": [ + 160, + 680, + 429, + 715 + ], + "spans": [ + { + "bbox": [ + 160, + 680, + 429, + 715 + ], + "score": 0.93, + "content": "\\bigcap _ { k \\geq j _ { n } } \\left\\{ \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} \\right. _ { 2 } \\leq c \\sqrt { q k \\log k } \\right\\} ,", + "type": "interline_equation", + "image_path": "3109711a5c8b13618da997f3e9541183889c5dc855b1cff24b28f53769852da4.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 160, + 680, + 429, + 691.6666666666666 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 160, + 691.6666666666666, + 429, + 703.3333333333333 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 160, + 703.3333333333333, + 429, + 714.9999999999999 + ], + "spans": [], + "index": 22 + } + ] + }, + { + "type": "text", + "bbox": [ + 104, + 719, + 480, + 733 + ], + "lines": [ + { + "bbox": [ + 105, + 719, + 482, + 734 + ], + "spans": [ + { + "bbox": [ + 105, + 719, + 180, + 734 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 721, + 204, + 731 + ], + "score": 0.89, + "content": "c > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 204, + 719, + 304, + 734 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 305, + 721, + 353, + 732 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 354, + 719, + 482, + 734 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 23, + "bbox_fs": [ + 105, + 719, + 482, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 230, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 230, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 230, + 95 + ], + "score": 1.0, + "content": "E.7 PROOF OF THEOREM 3", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 102, + 345, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 101, + 345, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 345, + 117 + ], + "score": 1.0, + "content": "We state the following lemmas before presenting the proof.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "text", + "bbox": [ + 104, + 123, + 504, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 424, + 137 + ], + "score": 1.0, + "content": "Lemma 7 Assume the conditions in Theorem 3 hold. Then for any sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 124, + 450, + 136 + ], + "score": 0.92, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 122, + 505, + 137 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 132, + 399, + 149 + ], + "spans": [ + { + "bbox": [ + 107, + 135, + 186, + 147 + ], + "score": 0.91, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 132, + 324, + 149 + ], + "score": 1.0, + "content": ", we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 324, + 135, + 377, + 147 + ], + "score": 0.92, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 132, + 399, + 149 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5 + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 150, + 420, + 166 + ], + "lines": [ + { + "bbox": [ + 172, + 150, + 420, + 166 + ], + "spans": [ + { + "bbox": [ + 172, + 150, + 420, + 166 + ], + "score": 0.89, + "content": "\\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\quad \\forall a \\in \\{ 0 , 1 \\} , \\forall k \\geq j _ { n } .", + "type": "interline_equation", + "image_path": "0bf4ad765184c5114c6de44c5fecb87aef06b9f1b8b9cae921b0e69787b65e60.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 172, + 150, + 420, + 166 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 173, + 505, + 198 + ], + "lines": [ + { + "bbox": [ + 104, + 172, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 104, + 172, + 424, + 188 + ], + "score": 1.0, + "content": "Lemma 8 Assume the conditions in Theorem 3 hold. Then for any sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 174, + 450, + 186 + ], + "score": 0.92, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 172, + 505, + 188 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 183, + 398, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 185, + 186, + 198 + ], + "score": 0.91, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 183, + 324, + 199 + ], + "score": 1.0, + "content": ", we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 324, + 185, + 377, + 197 + ], + "score": 0.92, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 183, + 398, + 199 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 201, + 477, + 251 + ], + "lines": [ + { + "bbox": [ + 111, + 201, + 477, + 251 + ], + "spans": [ + { + "bbox": [ + 111, + 201, + 477, + 251 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } & { } & { \\left| \\left| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\Phi _ { a } \\right| \\right| _ { 2 } \\preceq q \\delta _ { k } + q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , } \\\\ & { } & { \\forall a \\in \\{ 0 , 1 \\} , k \\geq j _ { n } . } \\end{array}", + "type": "interline_equation", + "image_path": "fafce161fbc0c7504692a27d40ce81a021a4d2ca660e720753bf198f8825e48d.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 111, + 201, + 477, + 217.66666666666666 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 111, + 217.66666666666666, + 477, + 234.33333333333331 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 111, + 234.33333333333331, + 477, + 250.99999999999997 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 258, + 506, + 292 + ], + "lines": [ + { + "bbox": [ + 105, + 256, + 504, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 486, + 271 + ], + "score": 1.0, + "content": "Similar to the proof of Theorem 1, we will show the assertion in Theorem 3 holds for any", + "type": "text" + }, + { + "bbox": [ + 486, + 258, + 504, + 271 + ], + "score": 0.89, + "content": "n ( \\cdot )", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 268, + 505, + 283 + ], + "spans": [ + { + "bbox": [ + 104, + 268, + 261, + 283 + ], + "score": 1.0, + "content": "that correspond to the realizations of", + "type": "text" + }, + { + "bbox": [ + 261, + 270, + 281, + 281 + ], + "score": 0.92, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 268, + 332, + 283 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + }, + { + "bbox": [ + 332, + 269, + 464, + 281 + ], + "score": 0.91, + "content": "n ( t _ { 1 } ) < n ( t _ { 2 } ) < \\cdots < n ( t _ { K } )", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 268, + 505, + 283 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 280, + 212, + 292 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 181, + 292 + ], + "score": 0.9, + "content": "1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 280, + 212, + 292 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 294, + 514, + 355 + ], + "lines": [ + { + "bbox": [ + 111, + 294, + 514, + 355 + ], + "spans": [ + { + "bbox": [ + 111, + 294, + 514, + 355 + ], + "score": 0.89, + "content": "\\begin{array} { l } { { \\displaystyle \\widehat { V } ( k _ { 1 } , k _ { 2 } ) = \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } \\mathrm { C o v } \\left( \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k 1 } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k 1 } ) , \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k 2 } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k 2 } ) | \\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 , \\ldots , n } ^ { + \\infty } \\right) } } \\\\ { { \\displaystyle = \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { k 1 } ) , } } \\end{array}", + "type": "interline_equation", + "image_path": "ff3bb9854dd570eeda9c1583e013889471e5512bdc0a45767fbde54e53b88e7d.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 111, + 294, + 514, + 314.3333333333333 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 111, + 314.3333333333333, + 514, + 334.66666666666663 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 111, + 334.66666666666663, + 514, + 354.99999999999994 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 358, + 124, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 357, + 124, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 124, + 369 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 370, + 398, + 431 + ], + "lines": [ + { + "bbox": [ + 192, + 370, + 398, + 431 + ], + "spans": [ + { + "bbox": [ + 192, + 370, + 398, + 431 + ], + "score": 0.94, + "content": "\\widehat { \\pmb { V } } = \\left( \\begin{array} { c c c c } { \\widehat { V } ( 1 , 1 ) } & { \\widehat { V } ( 1 , 2 ) } & { \\ldots } & { \\widehat { V } ( 1 , K ) } \\\\ { \\widehat { V } ( 2 , 1 ) } & { \\widehat { V } ( 2 , 2 ) } & { \\ldots } & { \\widehat { V } ( 2 , K ) } \\\\ { \\vdots } & { \\vdots } & { \\vdots } \\\\ { \\widehat { V } ( K , 1 ) } & { \\widehat { V } ( K , 2 ) } & { \\ldots } & { \\widehat { V } ( K , K ) } \\end{array} \\right) .", + "type": "interline_equation", + "image_path": "6902a0d7fbe73dd237203693e21633bb68d0a466d1e777ab92d781df410e5708.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 192, + 370, + 398, + 390.3333333333333 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 192, + 390.3333333333333, + 398, + 410.66666666666663 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 192, + 410.66666666666663, + 398, + 430.99999999999994 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 434, + 515, + 487 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 506, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 244, + 449 + ], + "score": 1.0, + "content": "We aim to bound the entrywise", + "type": "text" + }, + { + "bbox": [ + 244, + 437, + 258, + 448 + ], + "score": 0.89, + "content": "\\ell _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 433, + 299, + 449 + ], + "score": 1.0, + "content": "norm of", + "type": "text" + }, + { + "bbox": [ + 299, + 434, + 335, + 447 + ], + "score": 0.91, + "content": "\\widehat { V } - V", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 433, + 366, + 449 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 366, + 437, + 377, + 446 + ], + "score": 0.81, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 433, + 506, + 449 + ], + "score": 1.0, + "content": "is defined in equation 22. It", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 447, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 104, + 447, + 181, + 466 + ], + "score": 1.0, + "content": "suffices to bound", + "type": "text" + }, + { + "bbox": [ + 181, + 447, + 505, + 464 + ], + "score": 0.89, + "content": "\\begin{array} { r l } { \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\operatorname* { s u p } _ { b _ { 1 } , b _ { 2 } \\in \\mathbb { R } ^ { p + 1 } , \\| b _ { 1 } \\| _ { 2 } = \\| b _ { 2 } \\| _ { 2 } = 1 } | b _ { 1 } ^ { T } \\{ \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\} b _ { 2 } | } & { = \\| b _ { 2 } ^ { T } \\{ ( k _ { 2 } , k _ { 2 } ) - V ( k _ { 2 } , k _ { 2 } ) \\} b _ { 1 } \\| _ { 2 } = \\| b _ { 2 } ^ { T } \\{ ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\} b _ { 2 } \\| } \\end{array}", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 462, + 504, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 280, + 477 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 462, + 319, + 478 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + }, + { + "bbox": [ + 320, + 465, + 344, + 476 + ], + "score": 0.91, + "content": "k _ { 1 } , k _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 462, + 411, + 478 + ], + "score": 1.0, + "content": ", we decompose", + "type": "text" + }, + { + "bbox": [ + 411, + 462, + 504, + 477 + ], + "score": 0.9, + "content": "\\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } )", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 476, + 118, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 118, + 487 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5 + }, + { + "type": "text", + "bbox": [ + 104, + 487, + 539, + 518 + ], + "lines": [ + { + "bbox": [ + 104, + 486, + 539, + 506 + ], + "spans": [ + { + "bbox": [ + 104, + 486, + 137, + 506 + ], + "score": 1.0, + "content": "Vb (k1, k", + "type": "text" + }, + { + "bbox": [ + 138, + 487, + 539, + 504 + ], + "score": 0.77, + "content": "{ \\mathrm { ~ \\psi ~ } } _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) = \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) + \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) + \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) ,", + "type": "inline_equation", + "image_path": "185a1069a067db82ef1340cf120f2f30fee83a52b0e1b3d084cfa3d1529d2a03.jpg" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 504, + 136, + 520 + ], + "spans": [ + { + "bbox": [ + 104, + 504, + 136, + 520 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5 + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 520, + 527, + 597 + ], + "lines": [ + { + "bbox": [ + 124, + 520, + 527, + 597 + ], + "spans": [ + { + "bbox": [ + 124, + 520, + 527, + 597 + ], + "score": 0.88, + "content": "\\begin{array} { c } { { k _ { 1 } , k _ { 2 } ) = \\displaystyle { \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat \\beta _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) } } } \\\\ { { \\widehat { V } ^ { \\ast \\ast } ( k _ { 1 } , k _ { 2 } ) = \\displaystyle { \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) \\varphi ( X _ { i } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) \\varphi ( X _ { j } ) } } } \\end{array}", + "type": "interline_equation", + "image_path": "9500720c045a11a397bc15fc16cdbd0aba89cb0288678f16d538d6f68fc10711.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 124, + 520, + 527, + 545.6666666666666 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 124, + 545.6666666666666, + 527, + 571.3333333333333 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 124, + 571.3333333333333, + 527, + 596.9999999999999 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 599, + 280, + 611 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 280, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 280, + 612 + ], + "score": 1.0, + "content": "By Lemma 4 and Lemma 8, we obtain that", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 614, + 514, + 737 + ], + "lines": [ + { + "bbox": [ + 114, + 614, + 514, + 737 + ], + "spans": [ + { + "bbox": [ + 114, + 614, + 514, + 737 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\| \\hat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\\\ { \\leq } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\Bigg \\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\underset { j = 1 } { \\overset { n ( t _ { k _ { 1 } } ) } { \\sum } } \\underset { 2 = 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - } } \\\\ { \\leq } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { \\epsilon _ { 0 } ^ { 2 } } \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\Bigg \\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\underset { j = 1 } { \\overset { n ( t _ { k _ { 1 } } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\Phi _ { a } \\Bigg \\| _ { 2 } } \\\\ { \\overset { \\leq } } & { q \\delta _ { n ( t _ { 1 } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \\sqrt { \\log n ( t _ { 1 } ) } , } \\end{array}", + "type": "interline_equation", + "image_path": "4014d66a2a14ed0ec4a2585119ce6df54abed7f17e4b78768c111f8153240aac.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 114, + 614, + 514, + 655.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 114, + 655.0, + 514, + 696.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 114, + 696.0, + 514, + 737.0 + ], + "spans": [], + "index": 32 + } + ] + } + ], + "page_idx": 25, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "lines": [ + { + "bbox": [ + 106, + 25, + 307, + 38 + ], + "spans": [ + { + "bbox": [ + 106, + 25, + 307, + 38 + ], + "score": 1.0, + "content": "Under review as a conference paper at ICLR 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 761 + ], + "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": "title", + "bbox": [ + 107, + 82, + 230, + 94 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 230, + 95 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 230, + 95 + ], + "score": 1.0, + "content": "E.7 PROOF OF THEOREM 3", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 102, + 345, + 115 + ], + "lines": [ + { + "bbox": [ + 106, + 101, + 345, + 117 + ], + "spans": [ + { + "bbox": [ + 106, + 101, + 345, + 117 + ], + "score": 1.0, + "content": "We state the following lemmas before presenting the proof.", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 101, + 345, + 117 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 123, + 504, + 147 + ], + "lines": [ + { + "bbox": [ + 105, + 122, + 505, + 137 + ], + "spans": [ + { + "bbox": [ + 105, + 122, + 424, + 137 + ], + "score": 1.0, + "content": "Lemma 7 Assume the conditions in Theorem 3 hold. Then for any sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 124, + 450, + 136 + ], + "score": 0.92, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 122, + 505, + 137 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 2 + }, + { + "bbox": [ + 107, + 132, + 399, + 149 + ], + "spans": [ + { + "bbox": [ + 107, + 135, + 186, + 147 + ], + "score": 0.91, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 132, + 324, + 149 + ], + "score": 1.0, + "content": ", we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 324, + 135, + 377, + 147 + ], + "score": 0.92, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 132, + 399, + 149 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 2.5, + "bbox_fs": [ + 105, + 122, + 505, + 149 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 172, + 150, + 420, + 166 + ], + "lines": [ + { + "bbox": [ + 172, + 150, + 420, + 166 + ], + "spans": [ + { + "bbox": [ + 172, + 150, + 420, + 166 + ], + "score": 0.89, + "content": "\\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\quad \\forall a \\in \\{ 0 , 1 \\} , \\forall k \\geq j _ { n } .", + "type": "interline_equation", + "image_path": "0bf4ad765184c5114c6de44c5fecb87aef06b9f1b8b9cae921b0e69787b65e60.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 172, + 150, + 420, + 166 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 173, + 505, + 198 + ], + "lines": [ + { + "bbox": [ + 104, + 172, + 505, + 188 + ], + "spans": [ + { + "bbox": [ + 104, + 172, + 424, + 188 + ], + "score": 1.0, + "content": "Lemma 8 Assume the conditions in Theorem 3 hold. Then for any sequence", + "type": "text" + }, + { + "bbox": [ + 424, + 174, + 450, + 186 + ], + "score": 0.92, + "content": "\\{ j _ { n } \\} _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 172, + 505, + 188 + ], + "score": 1.0, + "content": "that satisfies", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 106, + 183, + 398, + 199 + ], + "spans": [ + { + "bbox": [ + 106, + 185, + 186, + 198 + ], + "score": 0.91, + "content": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 187, + 183, + 324, + 199 + ], + "score": 1.0, + "content": ", we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 324, + 185, + 377, + 197 + ], + "score": 0.92, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 378, + 183, + 398, + 199 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 104, + 172, + 505, + 199 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 201, + 477, + 251 + ], + "lines": [ + { + "bbox": [ + 111, + 201, + 477, + 251 + ], + "spans": [ + { + "bbox": [ + 111, + 201, + 477, + 251 + ], + "score": 0.91, + "content": "\\begin{array} { r l r } & { } & { \\left| \\left| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\Phi _ { a } \\right| \\right| _ { 2 } \\preceq q \\delta _ { k } + q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , } \\\\ & { } & { \\forall a \\in \\{ 0 , 1 \\} , k \\geq j _ { n } . } \\end{array}", + "type": "interline_equation", + "image_path": "fafce161fbc0c7504692a27d40ce81a021a4d2ca660e720753bf198f8825e48d.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 111, + 201, + 477, + 217.66666666666666 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 111, + 217.66666666666666, + 477, + 234.33333333333331 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 111, + 234.33333333333331, + 477, + 250.99999999999997 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 258, + 506, + 292 + ], + "lines": [ + { + "bbox": [ + 105, + 256, + 504, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 256, + 486, + 271 + ], + "score": 1.0, + "content": "Similar to the proof of Theorem 1, we will show the assertion in Theorem 3 holds for any", + "type": "text" + }, + { + "bbox": [ + 486, + 258, + 504, + 271 + ], + "score": 0.89, + "content": "n ( \\cdot )", + "type": "inline_equation" + } + ], + "index": 10 + }, + { + "bbox": [ + 104, + 268, + 505, + 283 + ], + "spans": [ + { + "bbox": [ + 104, + 268, + 261, + 283 + ], + "score": 1.0, + "content": "that correspond to the realizations of", + "type": "text" + }, + { + "bbox": [ + 261, + 270, + 281, + 281 + ], + "score": 0.92, + "content": "N ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 282, + 268, + 332, + 283 + ], + "score": 1.0, + "content": "that satisfy", + "type": "text" + }, + { + "bbox": [ + 332, + 269, + 464, + 281 + ], + "score": 0.91, + "content": "n ( t _ { 1 } ) < n ( t _ { 2 } ) < \\cdots < n ( t _ { K } )", + "type": "inline_equation" + }, + { + "bbox": [ + 464, + 268, + 505, + 283 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + } + ], + "index": 11 + }, + { + "bbox": [ + 106, + 280, + 212, + 292 + ], + "spans": [ + { + "bbox": [ + 106, + 280, + 181, + 292 + ], + "score": 0.9, + "content": "1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 181, + 280, + 212, + 292 + ], + "score": 1.0, + "content": ", define", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 11, + "bbox_fs": [ + 104, + 256, + 505, + 292 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 294, + 514, + 355 + ], + "lines": [ + { + "bbox": [ + 111, + 294, + 514, + 355 + ], + "spans": [ + { + "bbox": [ + 111, + 294, + 514, + 355 + ], + "score": 0.89, + "content": "\\begin{array} { l } { { \\displaystyle \\widehat { V } ( k _ { 1 } , k _ { 2 } ) = \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } \\mathrm { C o v } \\left( \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k 1 } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k 1 } ) , \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k 2 } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k 2 } ) | \\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 , \\ldots , n } ^ { + \\infty } \\right) } } \\\\ { { \\displaystyle = \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { k 1 } ) , } } \\end{array}", + "type": "interline_equation", + "image_path": "ff3bb9854dd570eeda9c1583e013889471e5512bdc0a45767fbde54e53b88e7d.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 111, + 294, + 514, + 314.3333333333333 + ], + "spans": [], + "index": 13 + }, + { + "bbox": [ + 111, + 314.3333333333333, + 514, + 334.66666666666663 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 111, + 334.66666666666663, + 514, + 354.99999999999994 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 358, + 124, + 369 + ], + "lines": [ + { + "bbox": [ + 105, + 357, + 124, + 369 + ], + "spans": [ + { + "bbox": [ + 105, + 357, + 124, + 369 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 357, + 124, + 369 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 192, + 370, + 398, + 431 + ], + "lines": [ + { + "bbox": [ + 192, + 370, + 398, + 431 + ], + "spans": [ + { + "bbox": [ + 192, + 370, + 398, + 431 + ], + "score": 0.94, + "content": "\\widehat { \\pmb { V } } = \\left( \\begin{array} { c c c c } { \\widehat { V } ( 1 , 1 ) } & { \\widehat { V } ( 1 , 2 ) } & { \\ldots } & { \\widehat { V } ( 1 , K ) } \\\\ { \\widehat { V } ( 2 , 1 ) } & { \\widehat { V } ( 2 , 2 ) } & { \\ldots } & { \\widehat { V } ( 2 , K ) } \\\\ { \\vdots } & { \\vdots } & { \\vdots } \\\\ { \\widehat { V } ( K , 1 ) } & { \\widehat { V } ( K , 2 ) } & { \\ldots } & { \\widehat { V } ( K , K ) } \\end{array} \\right) .", + "type": "interline_equation", + "image_path": "6902a0d7fbe73dd237203693e21633bb68d0a466d1e777ab92d781df410e5708.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 192, + 370, + 398, + 390.3333333333333 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 192, + 390.3333333333333, + 398, + 410.66666666666663 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 192, + 410.66666666666663, + 398, + 430.99999999999994 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 434, + 515, + 487 + ], + "lines": [ + { + "bbox": [ + 105, + 433, + 506, + 449 + ], + "spans": [ + { + "bbox": [ + 105, + 433, + 244, + 449 + ], + "score": 1.0, + "content": "We aim to bound the entrywise", + "type": "text" + }, + { + "bbox": [ + 244, + 437, + 258, + 448 + ], + "score": 0.89, + "content": "\\ell _ { \\infty }", + "type": "inline_equation" + }, + { + "bbox": [ + 258, + 433, + 299, + 449 + ], + "score": 1.0, + "content": "norm of", + "type": "text" + }, + { + "bbox": [ + 299, + 434, + 335, + 447 + ], + "score": 0.91, + "content": "\\widehat { V } - V", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 433, + 366, + 449 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 366, + 437, + 377, + 446 + ], + "score": 0.81, + "content": "V", + "type": "inline_equation" + }, + { + "bbox": [ + 377, + 433, + 506, + 449 + ], + "score": 1.0, + "content": "is defined in equation 22. It", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 104, + 447, + 505, + 466 + ], + "spans": [ + { + "bbox": [ + 104, + 447, + 181, + 466 + ], + "score": 1.0, + "content": "suffices to bound", + "type": "text" + }, + { + "bbox": [ + 181, + 447, + 505, + 464 + ], + "score": 0.89, + "content": "\\begin{array} { r l } { \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\operatorname* { s u p } _ { b _ { 1 } , b _ { 2 } \\in \\mathbb { R } ^ { p + 1 } , \\| b _ { 1 } \\| _ { 2 } = \\| b _ { 2 } \\| _ { 2 } = 1 } | b _ { 1 } ^ { T } \\{ \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\} b _ { 2 } | } & { = \\| b _ { 2 } ^ { T } \\{ ( k _ { 2 } , k _ { 2 } ) - V ( k _ { 2 } , k _ { 2 } ) \\} b _ { 1 } \\| _ { 2 } = \\| b _ { 2 } ^ { T } \\{ ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\} b _ { 2 } \\| } \\end{array}", + "type": "inline_equation" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 462, + 504, + 478 + ], + "spans": [ + { + "bbox": [ + 106, + 462, + 280, + 477 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 280, + 462, + 319, + 478 + ], + "score": 1.0, + "content": ". For any", + "type": "text" + }, + { + "bbox": [ + 320, + 465, + 344, + 476 + ], + "score": 0.91, + "content": "k _ { 1 } , k _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 345, + 462, + 411, + 478 + ], + "score": 1.0, + "content": ", we decompose", + "type": "text" + }, + { + "bbox": [ + 411, + 462, + 504, + 477 + ], + "score": 0.9, + "content": "\\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } )", + "type": "inline_equation" + } + ], + "index": 22 + }, + { + "bbox": [ + 105, + 476, + 118, + 487 + ], + "spans": [ + { + "bbox": [ + 105, + 476, + 118, + 487 + ], + "score": 1.0, + "content": "as", + "type": "text" + } + ], + "index": 23 + } + ], + "index": 21.5, + "bbox_fs": [ + 104, + 433, + 506, + 487 + ] + }, + { + "type": "text", + "bbox": [ + 104, + 487, + 539, + 518 + ], + "lines": [ + { + "bbox": [ + 104, + 486, + 539, + 506 + ], + "spans": [ + { + "bbox": [ + 104, + 486, + 137, + 506 + ], + "score": 1.0, + "content": "Vb (k1, k", + "type": "text" + }, + { + "bbox": [ + 138, + 487, + 539, + 504 + ], + "score": 0.77, + "content": "{ \\mathrm { ~ \\psi ~ } } _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) = \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) + \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) + \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) ,", + "type": "inline_equation", + "image_path": "185a1069a067db82ef1340cf120f2f30fee83a52b0e1b3d084cfa3d1529d2a03.jpg" + } + ], + "index": 24 + }, + { + "bbox": [ + 104, + 504, + 136, + 520 + ], + "spans": [ + { + "bbox": [ + 104, + 504, + 136, + 520 + ], + "score": 1.0, + "content": "where", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 24.5, + "bbox_fs": [ + 104, + 486, + 539, + 520 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 520, + 527, + 597 + ], + "lines": [ + { + "bbox": [ + 124, + 520, + 527, + 597 + ], + "spans": [ + { + "bbox": [ + 124, + 520, + 527, + 597 + ], + "score": 0.88, + "content": "\\begin{array} { c } { { k _ { 1 } , k _ { 2 } ) = \\displaystyle { \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat \\beta _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) } } } \\\\ { { \\widehat { V } ^ { \\ast \\ast } ( k _ { 1 } , k _ { 2 } ) = \\displaystyle { \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) \\varphi ( X _ { i } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) \\varphi ( X _ { j } ) } } } \\end{array}", + "type": "interline_equation", + "image_path": "9500720c045a11a397bc15fc16cdbd0aba89cb0288678f16d538d6f68fc10711.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 124, + 520, + 527, + 545.6666666666666 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 124, + 545.6666666666666, + 527, + 571.3333333333333 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 124, + 571.3333333333333, + 527, + 596.9999999999999 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 599, + 280, + 611 + ], + "lines": [ + { + "bbox": [ + 105, + 598, + 280, + 612 + ], + "spans": [ + { + "bbox": [ + 105, + 598, + 280, + 612 + ], + "score": 1.0, + "content": "By Lemma 4 and Lemma 8, we obtain that", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 598, + 280, + 612 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 614, + 514, + 737 + ], + "lines": [ + { + "bbox": [ + 114, + 614, + 514, + 737 + ], + "spans": [ + { + "bbox": [ + 114, + 614, + 514, + 737 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\| \\hat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\\\ { \\leq } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\Bigg \\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\underset { j = 1 } { \\overset { n ( t _ { k _ { 1 } } ) } { \\sum } } \\underset { 2 = 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - } } \\\\ { \\leq } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { \\epsilon _ { 0 } ^ { 2 } } \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\Bigg \\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\underset { j = 1 } { \\overset { n ( t _ { k _ { 1 } } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\Phi _ { a } \\Bigg \\| _ { 2 } } \\\\ { \\overset { \\leq } } & { q \\delta _ { n ( t _ { 1 } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \\sqrt { \\log n ( t _ { 1 } ) } , } \\end{array}", + "type": "interline_equation", + "image_path": "4014d66a2a14ed0ec4a2585119ce6df54abed7f17e4b78768c111f8153240aac.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 114, + 614, + 514, + 655.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 114, + 655.0, + 514, + 696.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 114, + 696.0, + 514, + 737.0 + ], + "spans": [], + "index": 32 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 108, + 82, + 277, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 278, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 203, + 96 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 82, + 274, + 95 + ], + "score": 0.91, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 81, + 278, + 96 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 99, + 153, + 111 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 154, + 111 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 154, + 111 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 112, + 539, + 289 + ], + "lines": [ + { + "bbox": [ + 138, + 112, + 539, + 289 + ], + "spans": [ + { + "bbox": [ + 138, + 112, + 539, + 289 + ], + "score": 0.76, + "content": "\\begin{array} { r l r } { { \\sum _ { i = 1 } ^ { n } \\operatorname { n u f f } _ { k \\to i } \\hat { \\mathcal { V } } ^ { * } ( k _ { 1 } , k _ { 2 } ) = \\sum _ { s = i } ^ { 1 } \\sum _ { i = 1 } ^ { k } \\sum _ { m \\in \\{ i , j \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\xi _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big ] ^ { 2 } \\Sigma _ { a } ^ { - 1 } } } \\\\ & { } & { \\underset { = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { = 1 } { \\overset { n ( \\cdot ) } { \\sum } } \\sum _ { i = 1 } ^ { n } \\sum _ { ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) } \\xi ^ { \\top } ( X _ { i } ) \\big \\{ ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } + \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big ) ^ { 2 } \\Sigma _ { a } ^ { - 1 } } \\\\ & { } & { + \\sum _ { 1 } ^ { k _ { 1 } } \\sum _ { i = 0 } ^ { k } \\sum _ { \\beta = 1 } ^ { k } \\sum _ { \\beta = 1 } ^ { k } \\sum _ { 0 } ^ { k } \\sum _ { 0 } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\} \\hat { \\varphi } _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } } \\\\ & { } & + 2 \\sum _ { a = 0 } ^ { 1 } \\sum _ { i = 1 } ^ { k _ { 1 } } \\sum _ { \\beta = 1 } ^ { k _ { 2 } } \\sum _ { \\alpha } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { \\alpha } - \\varphi ^ { \\top } ( X _ { i } \\end{array}", + "type": "interline_equation", + "image_path": "f7ad89a33ccf60cca3eb02d2bcb406f4053c0c971fd42f814903cb5dc5c592ad.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 138, + 112, + 539, + 171.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 138, + 171.0, + 539, + 230.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 138, + 230.0, + 539, + 289.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 286, + 164, + 297 + ], + "lines": [ + { + "bbox": [ + 105, + 286, + 165, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 165, + 298 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 299, + 527, + 405 + ], + "lines": [ + { + "bbox": [ + 124, + 299, + 527, + 405 + ], + "spans": [ + { + "bbox": [ + 124, + 299, + 527, + 405 + ], + "score": 0.88, + "content": "\\begin{array} { r l } { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\left\\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } } & { { } } \\\\ { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { \\top } \\mathbb { I } ( X _ { i } ) \\right\\| _ { 2 } ^ { 2 } } & { { } } \\\\ { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 2 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { \\top } ( X _ { i } ) ( \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } ) ) \\varphi ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } ) \\right\\| _ { 2 } ^ { 2 } } & { { } = 0 } \\end{array}", + "type": "interline_equation", + "image_path": "0e255892d7c2ff036db5844834d38f73e159107ecd6115d6f60e86d3cb2289fe.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 124, + 299, + 527, + 334.3333333333333 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 124, + 334.3333333333333, + 527, + 369.66666666666663 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 124, + 369.66666666666663, + 527, + 404.99999999999994 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 406, + 222, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 406, + 223, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 223, + 419 + ], + "score": 1.0, + "content": "By Lemma 4, we obtain that", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 419, + 527, + 587 + ], + "lines": [ + { + "bbox": [ + 124, + 419, + 527, + 587 + ], + "spans": [ + { + "bbox": [ + 124, + 419, + 527, + 587 + ], + "score": 0.87, + "content": "\\begin{array} { r l } & { \\quad \\underset { 1 \\leq k \\leq k \\leq K } { \\operatorname* { m a x } } \\| \\hat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\\\ & { \\quad \\underset { 1 \\leq k \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { K } \\| \\underset { 2 \\leq - 1 : = n ( \\{ k _ { 1 } , - 1 \\} + 1 ) } { \\overset { k _ { 1 } } { \\sum } } \\mathbb { \\overset { n ( k _ { 2 } ) } { \\sum } } \\mathbb { \\overset { \\eta ( A _ { i } ) } { = } } \\alpha ^ { \\top } ( X _ { i } ) \\boldsymbol { \\varphi } ^ { \\top } ( X _ { i } ) \\boldsymbol { \\{ \\varphi } } ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\boldsymbol { \\varphi } ^ { \\top } ( X _ { i } ) \\beta _ { a } ( t _ { 2 } ) \\boldsymbol { \\} ^ { 2 } \\| _ { 2 } } \\\\ & { \\quad \\underset { \\theta \\leq \\{ 0 , 1 \\} } { \\overset { \\operatorname* { m a x } } { = } } \\frac { 1 } { K } \\| \\underset { 1 \\leq k \\leq K } { \\sum } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } } \\end{array}", + "type": "interline_equation", + "image_path": "68ae25e47cf6d8bf4b9681cff0f465fbb3ec7ea8dc1ae29cec1a223910da0613.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 124, + 419, + 527, + 475.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 124, + 475.0, + 527, + 531.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 124, + 531.0, + 527, + 587.0 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 591, + 410, + 604 + ], + "lines": [ + { + "bbox": [ + 106, + 591, + 409, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 324, + 605 + ], + "score": 1.0, + "content": "By Lemmas 4 and 7, we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 324, + 591, + 390, + 604 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 591, + 409, + 605 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 606, + 470, + 647 + ], + "lines": [ + { + "bbox": [ + 119, + 606, + 470, + 647 + ], + "spans": [ + { + "bbox": [ + 119, + 606, + 470, + 647 + ], + "score": 0.79, + "content": "\\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\| \\Psi _ { 1 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} \\left\\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\right\\| _ { 2 } ,", + "type": "interline_equation", + "image_path": "2294f172ea3c007f254ce98ce62c336ef5f15c87acbe8f47fa9ce2e079559c89.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 119, + 606, + 470, + 619.6666666666666 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 119, + 619.6666666666666, + 470, + 633.3333333333333 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 119, + 633.3333333333333, + 470, + 646.9999999999999 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 663, + 400, + 675 + ], + "lines": [ + { + "bbox": [ + 106, + 662, + 399, + 676 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 352, + 676 + ], + "score": 1.0, + "content": "Similar to Lemma 5, we can show there exists some constant", + "type": "text" + }, + { + "bbox": [ + 352, + 664, + 380, + 674 + ], + "score": 0.92, + "content": "c _ { * } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 662, + 399, + 676 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "interline_equation", + "bbox": [ + 134, + 677, + 456, + 736 + ], + "lines": [ + { + "bbox": [ + 134, + 677, + 456, + 736 + ], + "spans": [ + { + "bbox": [ + 134, + 677, + 456, + 736 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } \\big ( A _ { i } = a \\big ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\} \\big ] \\right\\| _ { 2 } } \\\\ & { \\quad \\quad \\leq c _ { * } \\{ q \\delta _ { n ( t _ { k _ { 1 } } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "28f7e71fc8de827bc285a3a6b1b39ad721c5331ac8aad8b64a3a759cd747cb5c.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 134, + 677, + 456, + 696.6666666666666 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 134, + 696.6666666666666, + 456, + 716.3333333333333 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 134, + 716.3333333333333, + 456, + 735.9999999999999 + ], + "spans": [], + "index": 20 + } + ] + } + ], + "page_idx": 26, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 311, + 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": "text", + "bbox": [ + 108, + 82, + 277, + 95 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 278, + 96 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 203, + 96 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 82, + 274, + 95 + ], + "score": 0.91, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 81, + 278, + 96 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 81, + 278, + 96 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 99, + 153, + 111 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 154, + 111 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 154, + 111 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 105, + 99, + 154, + 111 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 138, + 112, + 539, + 289 + ], + "lines": [ + { + "bbox": [ + 138, + 112, + 539, + 289 + ], + "spans": [ + { + "bbox": [ + 138, + 112, + 539, + 289 + ], + "score": 0.76, + "content": "\\begin{array} { r l r } { { \\sum _ { i = 1 } ^ { n } \\operatorname { n u f f } _ { k \\to i } \\hat { \\mathcal { V } } ^ { * } ( k _ { 1 } , k _ { 2 } ) = \\sum _ { s = i } ^ { 1 } \\sum _ { i = 1 } ^ { k } \\sum _ { m \\in \\{ i , j \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\xi _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big ] ^ { 2 } \\Sigma _ { a } ^ { - 1 } } } \\\\ & { } & { \\underset { = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { = 1 } { \\overset { n ( \\cdot ) } { \\sum } } \\sum _ { i = 1 } ^ { n } \\sum _ { ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) } \\xi ^ { \\top } ( X _ { i } ) \\big \\{ ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } + \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big ) ^ { 2 } \\Sigma _ { a } ^ { - 1 } } \\\\ & { } & { + \\sum _ { 1 } ^ { k _ { 1 } } \\sum _ { i = 0 } ^ { k } \\sum _ { \\beta = 1 } ^ { k } \\sum _ { \\beta = 1 } ^ { k } \\sum _ { 0 } ^ { k } \\sum _ { 0 } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\} \\hat { \\varphi } _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } } \\\\ & { } & + 2 \\sum _ { a = 0 } ^ { 1 } \\sum _ { i = 1 } ^ { k _ { 1 } } \\sum _ { \\beta = 1 } ^ { k _ { 2 } } \\sum _ { \\alpha } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { \\alpha } - \\varphi ^ { \\top } ( X _ { i } \\end{array}", + "type": "interline_equation", + "image_path": "f7ad89a33ccf60cca3eb02d2bcb406f4053c0c971fd42f814903cb5dc5c592ad.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 138, + 112, + 539, + 171.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 138, + 171.0, + 539, + 230.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 138, + 230.0, + 539, + 289.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 286, + 164, + 297 + ], + "lines": [ + { + "bbox": [ + 105, + 286, + 165, + 298 + ], + "spans": [ + { + "bbox": [ + 105, + 286, + 165, + 298 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 105, + 286, + 165, + 298 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 299, + 527, + 405 + ], + "lines": [ + { + "bbox": [ + 124, + 299, + 527, + 405 + ], + "spans": [ + { + "bbox": [ + 124, + 299, + 527, + 405 + ], + "score": 0.88, + "content": "\\begin{array} { r l } { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\left\\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } } & { { } } \\\\ { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { \\top } \\mathbb { I } ( X _ { i } ) \\right\\| _ { 2 } ^ { 2 } } & { { } } \\\\ { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 2 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { \\top } ( X _ { i } ) ( \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } ) ) \\varphi ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } ) \\right\\| _ { 2 } ^ { 2 } } & { { } = 0 } \\end{array}", + "type": "interline_equation", + "image_path": "0e255892d7c2ff036db5844834d38f73e159107ecd6115d6f60e86d3cb2289fe.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 124, + 299, + 527, + 334.3333333333333 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 124, + 334.3333333333333, + 527, + 369.66666666666663 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 124, + 369.66666666666663, + 527, + 404.99999999999994 + ], + "spans": [], + "index": 8 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 406, + 222, + 417 + ], + "lines": [ + { + "bbox": [ + 106, + 406, + 223, + 419 + ], + "spans": [ + { + "bbox": [ + 106, + 406, + 223, + 419 + ], + "score": 1.0, + "content": "By Lemma 4, we obtain that", + "type": "text" + } + ], + "index": 9 + } + ], + "index": 9, + "bbox_fs": [ + 106, + 406, + 223, + 419 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 124, + 419, + 527, + 587 + ], + "lines": [ + { + "bbox": [ + 124, + 419, + 527, + 587 + ], + "spans": [ + { + "bbox": [ + 124, + 419, + 527, + 587 + ], + "score": 0.87, + "content": "\\begin{array} { r l } & { \\quad \\underset { 1 \\leq k \\leq k \\leq K } { \\operatorname* { m a x } } \\| \\hat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\\\ & { \\quad \\underset { 1 \\leq k \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { K } \\| \\underset { 2 \\leq - 1 : = n ( \\{ k _ { 1 } , - 1 \\} + 1 ) } { \\overset { k _ { 1 } } { \\sum } } \\mathbb { \\overset { n ( k _ { 2 } ) } { \\sum } } \\mathbb { \\overset { \\eta ( A _ { i } ) } { = } } \\alpha ^ { \\top } ( X _ { i } ) \\boldsymbol { \\varphi } ^ { \\top } ( X _ { i } ) \\boldsymbol { \\{ \\varphi } } ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\boldsymbol { \\varphi } ^ { \\top } ( X _ { i } ) \\beta _ { a } ( t _ { 2 } ) \\boldsymbol { \\} ^ { 2 } \\| _ { 2 } } \\\\ & { \\quad \\underset { \\theta \\leq \\{ 0 , 1 \\} } { \\overset { \\operatorname* { m a x } } { = } } \\frac { 1 } { K } \\| \\underset { 1 \\leq k \\leq K } { \\sum } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } } \\end{array}", + "type": "interline_equation", + "image_path": "68ae25e47cf6d8bf4b9681cff0f465fbb3ec7ea8dc1ae29cec1a223910da0613.jpg" + } + ] + } + ], + "index": 11, + "virtual_lines": [ + { + "bbox": [ + 124, + 419, + 527, + 475.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 124, + 475.0, + 527, + 531.0 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 124, + 531.0, + 527, + 587.0 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 591, + 410, + 604 + ], + "lines": [ + { + "bbox": [ + 106, + 591, + 409, + 605 + ], + "spans": [ + { + "bbox": [ + 106, + 591, + 324, + 605 + ], + "score": 1.0, + "content": "By Lemmas 4 and 7, we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 324, + 591, + 390, + 604 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 390, + 591, + 409, + 605 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13, + "bbox_fs": [ + 106, + 591, + 409, + 605 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 606, + 470, + 647 + ], + "lines": [ + { + "bbox": [ + 119, + 606, + 470, + 647 + ], + "spans": [ + { + "bbox": [ + 119, + 606, + 470, + 647 + ], + "score": 0.79, + "content": "\\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\| \\Psi _ { 1 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} \\left\\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\right\\| _ { 2 } ,", + "type": "interline_equation", + "image_path": "2294f172ea3c007f254ce98ce62c336ef5f15c87acbe8f47fa9ce2e079559c89.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 119, + 606, + 470, + 619.6666666666666 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 119, + 619.6666666666666, + 470, + 633.3333333333333 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 119, + 633.3333333333333, + 470, + 646.9999999999999 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 663, + 400, + 675 + ], + "lines": [ + { + "bbox": [ + 106, + 662, + 399, + 676 + ], + "spans": [ + { + "bbox": [ + 106, + 662, + 352, + 676 + ], + "score": 1.0, + "content": "Similar to Lemma 5, we can show there exists some constant", + "type": "text" + }, + { + "bbox": [ + 352, + 664, + 380, + 674 + ], + "score": 0.92, + "content": "c _ { * } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 381, + 662, + 399, + 676 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 662, + 399, + 676 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 134, + 677, + 456, + 736 + ], + "lines": [ + { + "bbox": [ + 134, + 677, + 456, + 736 + ], + "spans": [ + { + "bbox": [ + 134, + 677, + 456, + 736 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } \\big ( A _ { i } = a \\big ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\} \\big ] \\right\\| _ { 2 } } \\\\ & { \\quad \\quad \\leq c _ { * } \\{ q \\delta _ { n ( t _ { k _ { 1 } } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "28f7e71fc8de827bc285a3a6b1b39ad721c5331ac8aad8b64a3a759cd747cb5c.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 134, + 677, + 456, + 696.6666666666666 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 134, + 696.6666666666666, + 456, + 716.3333333333333 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 134, + 716.3333333333333, + 456, + 735.9999999999999 + ], + "spans": [], + "index": 20 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 103, + 81, + 506, + 106 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 208, + 96 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 209, + 82, + 276, + 95 + ], + "score": 0.93, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 81, + 505, + 96 + ], + "score": 1.0, + "content": ". By Lemma 4, we can show with probability at least", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 92, + 192, + 106 + ], + "spans": [ + { + "bbox": [ + 107, + 93, + 172, + 106 + ], + "score": 0.92, + "content": "1 - \\bar { O } ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 92, + 192, + 106 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 106, + 433, + 147 + ], + "lines": [ + { + "bbox": [ + 157, + 106, + 433, + 147 + ], + "spans": [ + { + "bbox": [ + 157, + 106, + 433, + 147 + ], + "score": 0.92, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\mathbb I ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\} \\right\\| _ { 2 } = O ( 1 ) .", + "type": "interline_equation", + "image_path": "4c19b795794f1a20727e1549383501561f5a15747452499df0608f6bb5941a90.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 157, + 106, + 433, + 119.66666666666667 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 157, + 119.66666666666667, + 433, + 133.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 157, + 133.33333333333334, + 433, + 147.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 147, + 323, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 146, + 324, + 162 + ], + "spans": [ + { + "bbox": [ + 106, + 146, + 324, + 162 + ], + "score": 1.0, + "content": "This together with equation 52 and equation 53 yields", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5 + }, + { + "type": "text", + "bbox": [ + 107, + 177, + 272, + 189 + ], + "lines": [ + { + "bbox": [ + 106, + 175, + 269, + 192 + ], + "spans": [ + { + "bbox": [ + 106, + 175, + 204, + 192 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 176, + 269, + 190 + ], + "score": 0.89, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 144, + 160, + 446, + 189 + ], + "lines": [ + { + "bbox": [ + 145, + 160, + 445, + 175 + ], + "spans": [ + { + "bbox": [ + 145, + 160, + 445, + 175 + ], + "score": 0.85, + "content": "\\begin{array} { r } { n ^ { - 1 } ( t _ { k 1 } ) \\| \\Psi _ { 1 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} , } \\end{array}", + "type": "inline_equation", + "image_path": "990829ee87c5cdbf4ebf702f43f6d1a69cc7c83b840da67aa4f3ca902ae1cf65.jpg" + } + ], + "index": 6 + }, + { + "bbox": [ + 270, + 176, + 274, + 191 + ], + "spans": [ + { + "bbox": [ + 270, + 176, + 274, + 191 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.0 + }, + { + "type": "text", + "bbox": [ + 108, + 194, + 504, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 193, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 106, + 193, + 505, + 206 + ], + "score": 1.0, + "content": "Moreover, using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 204, + 489, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 155, + 218 + ], + "score": 1.0, + "content": "that for any", + "type": "text" + }, + { + "bbox": [ + 155, + 205, + 206, + 216 + ], + "score": 0.92, + "content": "1 \\leq k _ { 1 } \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 204, + 415, + 218 + ], + "score": 1.0, + "content": ", the following event occurs with probability at least", + "type": "text" + }, + { + "bbox": [ + 415, + 204, + 484, + 217 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - 2 } ( t _ { k _ { 1 } } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 204, + 489, + 218 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 218, + 514, + 258 + ], + "lines": [ + { + "bbox": [ + 111, + 218, + 514, + 258 + ], + "spans": [ + { + "bbox": [ + 111, + 218, + 514, + 258 + ], + "score": 0.91, + "content": "\\frac { 1 } { \\iota ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { ( l ) } ( X _ { i } ) \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } ,", + "type": "interline_equation", + "image_path": "b528917172b00eaab720b780fa28188acf59e1804b2a40c6bfe59770fe209841.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 111, + 218, + 514, + 231.33333333333334 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 111, + 231.33333333333334, + 514, + 244.66666666666669 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 111, + 244.66666666666669, + 514, + 258.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 274, + 473, + 288 + ], + "lines": [ + { + "bbox": [ + 131, + 273, + 454, + 289 + ], + "spans": [ + { + "bbox": [ + 131, + 273, + 246, + 289 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\sum _ { k _ { 1 } = 1 } ^ { K } n ^ { - 2 } ( t _ { k _ { 1 } } ) \\leq n ^ { - 1 } ( t _ { 1 } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 274, + 454, + 287 + ], + "score": 0.95, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 289, + 514, + 331 + ], + "lines": [ + { + "bbox": [ + 111, + 289, + 514, + 331 + ], + "spans": [ + { + "bbox": [ + 111, + 289, + 514, + 331 + ], + "score": 0.82, + "content": "\\frac { 1 } { \\iota ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { ( l ) } ( X _ { i } ) \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } ,", + "type": "interline_equation", + "image_path": "0bc36a084eb2ebcb3b98a93887bc37430402e973e8fb34a708c056581d72d74c.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 111, + 289, + 514, + 303.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 111, + 303.0, + 514, + 317.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 111, + 317.0, + 514, + 331.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 344, + 274, + 356 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 275, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 275, + 357 + ], + "score": 1.0, + "content": "In addition, it follows from Lemma 7 that", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 356, + 449, + 372 + ], + "lines": [ + { + "bbox": [ + 141, + 356, + 449, + 372 + ], + "spans": [ + { + "bbox": [ + 141, + 356, + 449, + 372 + ], + "score": 0.86, + "content": "\\begin{array} { r } { n ^ { - 1 } ( t _ { k _ { 1 } } ) \\| \\Psi _ { 2 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 3 / 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} . } \\end{array}", + "type": "interline_equation", + "image_path": "71dc3c0168e0045f066825ba8708f70f7cd37955ed2187033322a65322dfdd1a.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 141, + 356, + 449, + 372 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 379, + 275, + 391 + ], + "lines": [ + { + "bbox": [ + 107, + 378, + 275, + 392 + ], + "spans": [ + { + "bbox": [ + 107, + 378, + 275, + 392 + ], + "score": 1.0, + "content": "This together with equation 54 yields that", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 392, + 427, + 415 + ], + "lines": [ + { + "bbox": [ + 162, + 392, + 427, + 415 + ], + "spans": [ + { + "bbox": [ + 162, + 392, + 427, + 415 + ], + "score": 0.89, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) ,", + "type": "interline_equation", + "image_path": "58fd4a50956a62fae9a7e7805b4c4dc55052f270be671c4713baf11b8630ffcd.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 162, + 392, + 427, + 415 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 417, + 423, + 430 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 423, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 203, + 433 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 417, + 269, + 430 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 416, + 423, + 433 + ], + "score": 1.0, + "content": ". Under the given conditions, we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 431, + 442, + 455 + ], + "lines": [ + { + "bbox": [ + 147, + 431, + 442, + 455 + ], + "spans": [ + { + "bbox": [ + 147, + 431, + 442, + 455 + ], + "score": 0.88, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \\log ^ { 1 / 2 } n ( t _ { 1 } ) ,", + "type": "interline_equation", + "image_path": "6071cef6b0af5bf1ad3eee7741170d33e5c24a6ad76908800171d7740dde65f6.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 147, + 431, + 442, + 455 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 457, + 272, + 470 + ], + "lines": [ + { + "bbox": [ + 105, + 455, + 269, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 204, + 472 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 457, + 269, + 470 + ], + "score": 0.9, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 318, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 318, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 318, + 487 + ], + "score": 1.0, + "content": "Moreover, with some calculations, we can show that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 487, + 514, + 624 + ], + "lines": [ + { + "bbox": [ + 115, + 487, + 514, + 624 + ], + "spans": [ + { + "bbox": [ + 115, + 487, + 514, + 624 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\left\\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\leq \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\underset { j \\geq 1 } { \\operatorname* { m a x } } \\left\\| \\Sigma _ { a } ^ { - 1 } - \\widehat { \\Sigma } _ { a } ^ { - 1 } ( l _ { j } ) \\right\\| _ { 2 } } \\\\ { \\times } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 2 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { j } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\right\\| _ { 2 } } \\\\ { + } & { \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { i } ) } { \\sum } } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\right\\| } \\\\ { \\times } & { \\underset { j \\geq 1 } { \\operatorname* { m a x } } \\| \\Sigma _ { a } ^ { - 1 } - \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\| _ { 2 } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "04be3cae4a9688e33606be7ed589be85efc05f4f25d1b2dc1151488d51182b38.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 115, + 487, + 514, + 532.6666666666666 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 115, + 532.6666666666666, + 514, + 578.3333333333333 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 115, + 578.3333333333333, + 514, + 623.9999999999999 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 625, + 473, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 473, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 382, + 639 + ], + "score": 1.0, + "content": "In view of Lemma 4 and Lemma 5, we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 382, + 626, + 452, + 638 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 624, + 473, + 639 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29 + }, + { + "type": "interline_equation", + "bbox": [ + 131, + 640, + 489, + 736 + ], + "lines": [ + { + "bbox": [ + 131, + 640, + 489, + 736 + ], + "spans": [ + { + "bbox": [ + 131, + 640, + 489, + 736 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\left\\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\leq O ( 1 ) ( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ) } \\\\ { \\times } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { j } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\right\\| , } \\end{array}", + "type": "interline_equation", + "image_path": "298782662824acf531c5b9456cce46c58772056078045001b98db00e60d16d0a.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 131, + 640, + 489, + 672.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 131, + 672.0, + 489, + 704.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 131, + 704.0, + 489, + 736.0 + ], + "spans": [], + "index": 32 + } + ] + } + ], + "page_idx": 27, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 761 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "28", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 103, + 81, + 506, + 106 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 505, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 208, + 96 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 209, + 82, + 276, + 95 + ], + "score": 0.93, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 276, + 81, + 505, + 96 + ], + "score": 1.0, + "content": ". By Lemma 4, we can show with probability at least", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 107, + 92, + 192, + 106 + ], + "spans": [ + { + "bbox": [ + 107, + 93, + 172, + 106 + ], + "score": 0.92, + "content": "1 - \\bar { O } ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 172, + 92, + 192, + 106 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 105, + 81, + 505, + 106 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 157, + 106, + 433, + 147 + ], + "lines": [ + { + "bbox": [ + 157, + 106, + 433, + 147 + ], + "spans": [ + { + "bbox": [ + 157, + 106, + 433, + 147 + ], + "score": 0.92, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\mathbb I ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\} \\right\\| _ { 2 } = O ( 1 ) .", + "type": "interline_equation", + "image_path": "4c19b795794f1a20727e1549383501561f5a15747452499df0608f6bb5941a90.jpg" + } + ] + } + ], + "index": 3, + "virtual_lines": [ + { + "bbox": [ + 157, + 106, + 433, + 119.66666666666667 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 157, + 119.66666666666667, + 433, + 133.33333333333334 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 157, + 133.33333333333334, + 433, + 147.0 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 147, + 323, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 146, + 324, + 162 + ], + "spans": [ + { + "bbox": [ + 106, + 146, + 324, + 162 + ], + "score": 1.0, + "content": "This together with equation 52 and equation 53 yields", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 5, + "bbox_fs": [ + 106, + 146, + 324, + 162 + ] + }, + { + "type": "text", + "bbox": [ + 107, + 177, + 272, + 189 + ], + "lines": [ + { + "bbox": [ + 106, + 175, + 269, + 192 + ], + "spans": [ + { + "bbox": [ + 106, + 175, + 204, + 192 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 176, + 269, + 190 + ], + "score": 0.89, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 106, + 175, + 269, + 192 + ] + }, + { + "type": "text", + "bbox": [ + 144, + 160, + 446, + 189 + ], + "lines": [ + { + "bbox": [ + 145, + 160, + 445, + 175 + ], + "spans": [ + { + "bbox": [ + 145, + 160, + 445, + 175 + ], + "score": 0.85, + "content": "\\begin{array} { r } { n ^ { - 1 } ( t _ { k 1 } ) \\| \\Psi _ { 1 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} , } \\end{array}", + "type": "inline_equation", + "image_path": "990829ee87c5cdbf4ebf702f43f6d1a69cc7c83b840da67aa4f3ca902ae1cf65.jpg" + } + ], + "index": 6 + }, + { + "bbox": [ + 270, + 176, + 274, + 191 + ], + "spans": [ + { + "bbox": [ + 270, + 176, + 274, + 191 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 7.0, + "bbox_fs": [ + 145, + 160, + 445, + 191 + ] + }, + { + "type": "text", + "bbox": [ + 108, + 194, + 504, + 217 + ], + "lines": [ + { + "bbox": [ + 106, + 193, + 505, + 206 + ], + "spans": [ + { + "bbox": [ + 106, + 193, + 505, + 206 + ], + "score": 1.0, + "content": "Moreover, using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 106, + 204, + 489, + 218 + ], + "spans": [ + { + "bbox": [ + 106, + 204, + 155, + 218 + ], + "score": 1.0, + "content": "that for any", + "type": "text" + }, + { + "bbox": [ + 155, + 205, + 206, + 216 + ], + "score": 0.92, + "content": "1 \\leq k _ { 1 } \\leq K", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 204, + 415, + 218 + ], + "score": 1.0, + "content": ", the following event occurs with probability at least", + "type": "text" + }, + { + "bbox": [ + 415, + 204, + 484, + 217 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - 2 } ( t _ { k _ { 1 } } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 485, + 204, + 489, + 218 + ], + "score": 1.0, + "content": ",", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9.5, + "bbox_fs": [ + 106, + 193, + 505, + 218 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 218, + 514, + 258 + ], + "lines": [ + { + "bbox": [ + 111, + 218, + 514, + 258 + ], + "spans": [ + { + "bbox": [ + 111, + 218, + 514, + 258 + ], + "score": 0.91, + "content": "\\frac { 1 } { \\iota ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { ( l ) } ( X _ { i } ) \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } ,", + "type": "interline_equation", + "image_path": "b528917172b00eaab720b780fa28188acf59e1804b2a40c6bfe59770fe209841.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 111, + 218, + 514, + 231.33333333333334 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 111, + 231.33333333333334, + 514, + 244.66666666666669 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 111, + 244.66666666666669, + 514, + 258.0 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 274, + 473, + 288 + ], + "lines": [ + { + "bbox": [ + 131, + 273, + 454, + 289 + ], + "spans": [ + { + "bbox": [ + 131, + 273, + 246, + 289 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\sum _ { k _ { 1 } = 1 } ^ { K } n ^ { - 2 } ( t _ { k _ { 1 } } ) \\leq n ^ { - 1 } ( t _ { 1 } ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 388, + 274, + 454, + 287 + ], + "score": 0.95, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 131, + 273, + 454, + 289 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 289, + 514, + 331 + ], + "lines": [ + { + "bbox": [ + 111, + 289, + 514, + 331 + ], + "spans": [ + { + "bbox": [ + 111, + 289, + 514, + 331 + ], + "score": 0.82, + "content": "\\frac { 1 } { \\iota ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { ( l ) } ( X _ { i } ) \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } ,", + "type": "interline_equation", + "image_path": "0bc36a084eb2ebcb3b98a93887bc37430402e973e8fb34a708c056581d72d74c.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 111, + 289, + 514, + 303.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 111, + 303.0, + 514, + 317.0 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 111, + 317.0, + 514, + 331.0 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 344, + 274, + 356 + ], + "lines": [ + { + "bbox": [ + 106, + 344, + 275, + 357 + ], + "spans": [ + { + "bbox": [ + 106, + 344, + 275, + 357 + ], + "score": 1.0, + "content": "In addition, it follows from Lemma 7 that", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18, + "bbox_fs": [ + 106, + 344, + 275, + 357 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 356, + 449, + 372 + ], + "lines": [ + { + "bbox": [ + 141, + 356, + 449, + 372 + ], + "spans": [ + { + "bbox": [ + 141, + 356, + 449, + 372 + ], + "score": 0.86, + "content": "\\begin{array} { r } { n ^ { - 1 } ( t _ { k _ { 1 } } ) \\| \\Psi _ { 2 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 3 / 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} . } \\end{array}", + "type": "interline_equation", + "image_path": "71dc3c0168e0045f066825ba8708f70f7cd37955ed2187033322a65322dfdd1a.jpg" + } + ] + } + ], + "index": 19, + "virtual_lines": [ + { + "bbox": [ + 141, + 356, + 449, + 372 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 379, + 275, + 391 + ], + "lines": [ + { + "bbox": [ + 107, + 378, + 275, + 392 + ], + "spans": [ + { + "bbox": [ + 107, + 378, + 275, + 392 + ], + "score": 1.0, + "content": "This together with equation 54 yields that", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 107, + 378, + 275, + 392 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 392, + 427, + 415 + ], + "lines": [ + { + "bbox": [ + 162, + 392, + 427, + 415 + ], + "spans": [ + { + "bbox": [ + 162, + 392, + 427, + 415 + ], + "score": 0.89, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) ,", + "type": "interline_equation", + "image_path": "58fd4a50956a62fae9a7e7805b4c4dc55052f270be671c4713baf11b8630ffcd.jpg" + } + ] + } + ], + "index": 21, + "virtual_lines": [ + { + "bbox": [ + 162, + 392, + 427, + 415 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 417, + 423, + 430 + ], + "lines": [ + { + "bbox": [ + 105, + 416, + 423, + 433 + ], + "spans": [ + { + "bbox": [ + 105, + 416, + 203, + 433 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 417, + 269, + 430 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 270, + 416, + 423, + 433 + ], + "score": 1.0, + "content": ". Under the given conditions, we have", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 105, + 416, + 423, + 433 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 147, + 431, + 442, + 455 + ], + "lines": [ + { + "bbox": [ + 147, + 431, + 442, + 455 + ], + "spans": [ + { + "bbox": [ + 147, + 431, + 442, + 455 + ], + "score": 0.88, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \\log ^ { 1 / 2 } n ( t _ { 1 } ) ,", + "type": "interline_equation", + "image_path": "6071cef6b0af5bf1ad3eee7741170d33e5c24a6ad76908800171d7740dde65f6.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 147, + 431, + 442, + 455 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 457, + 272, + 470 + ], + "lines": [ + { + "bbox": [ + 105, + 455, + 269, + 472 + ], + "spans": [ + { + "bbox": [ + 105, + 455, + 204, + 472 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 457, + 269, + 470 + ], + "score": 0.9, + "content": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )", + "type": "inline_equation" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 105, + 455, + 269, + 472 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 474, + 318, + 486 + ], + "lines": [ + { + "bbox": [ + 106, + 474, + 318, + 487 + ], + "spans": [ + { + "bbox": [ + 106, + 474, + 318, + 487 + ], + "score": 1.0, + "content": "Moreover, with some calculations, we can show that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 474, + 318, + 487 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 115, + 487, + 514, + 624 + ], + "lines": [ + { + "bbox": [ + 115, + 487, + 514, + 624 + ], + "spans": [ + { + "bbox": [ + 115, + 487, + 514, + 624 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\left\\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\leq \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\underset { j \\geq 1 } { \\operatorname* { m a x } } \\left\\| \\Sigma _ { a } ^ { - 1 } - \\widehat { \\Sigma } _ { a } ^ { - 1 } ( l _ { j } ) \\right\\| _ { 2 } } \\\\ { \\times } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 2 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { j } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\right\\| _ { 2 } } \\\\ { + } & { \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { i } ) } { \\sum } } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\right\\| } \\\\ { \\times } & { \\underset { j \\geq 1 } { \\operatorname* { m a x } } \\| \\Sigma _ { a } ^ { - 1 } - \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\| _ { 2 } ^ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "04be3cae4a9688e33606be7ed589be85efc05f4f25d1b2dc1151488d51182b38.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 115, + 487, + 514, + 532.6666666666666 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 115, + 532.6666666666666, + 514, + 578.3333333333333 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 115, + 578.3333333333333, + 514, + 623.9999999999999 + ], + "spans": [], + "index": 28 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 625, + 473, + 638 + ], + "lines": [ + { + "bbox": [ + 105, + 624, + 473, + 639 + ], + "spans": [ + { + "bbox": [ + 105, + 624, + 382, + 639 + ], + "score": 1.0, + "content": "In view of Lemma 4 and Lemma 5, we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 382, + 626, + 452, + 638 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 453, + 624, + 473, + 639 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 29 + } + ], + "index": 29, + "bbox_fs": [ + 105, + 624, + 473, + 639 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 131, + 640, + 489, + 736 + ], + "lines": [ + { + "bbox": [ + 131, + 640, + 489, + 736 + ], + "spans": [ + { + "bbox": [ + 131, + 640, + 489, + 736 + ], + "score": 0.92, + "content": "\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\left\\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\leq O ( 1 ) ( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ) } \\\\ { \\times } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { j } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\right\\| , } \\end{array}", + "type": "interline_equation", + "image_path": "298782662824acf531c5b9456cce46c58772056078045001b98db00e60d16d0a.jpg" + } + ] + } + ], + "index": 31, + "virtual_lines": [ + { + "bbox": [ + 131, + 640, + 489, + 672.0 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 131, + 672.0, + 489, + 704.0 + ], + "spans": [], + "index": 31 + }, + { + "bbox": [ + 131, + 704.0, + 489, + 736.0 + ], + "spans": [], + "index": 32 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 105, + 82, + 504, + 106 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 133, + 95 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 82, + 155, + 95 + ], + "score": 0.9, + "content": "O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "denotes some positive constant. Similar to equation 50 and equation 55, we can show", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 92, + 295, + 107 + ], + "spans": [ + { + "bbox": [ + 106, + 92, + 204, + 107 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 93, + 275, + 106 + ], + "score": 0.93, + "content": "1 \\stackrel { - } { - } O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 92, + 295, + 107 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5 + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 111, + 394, + 139 + ], + "lines": [ + { + "bbox": [ + 196, + 111, + 394, + 139 + ], + "spans": [ + { + "bbox": [ + 196, + 111, + 394, + 139 + ], + "score": 0.95, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\left\\| { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } } \\Psi _ { 3 , a , k _ { 1 } } - \\Psi _ { a } \\right\\| _ { 2 } = o ( 1 ) .", + "type": "interline_equation", + "image_path": "1fab5457321bc242941464700f2be8af4c80b454b4340877699ba9d476f9dc26.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 196, + 111, + 394, + 139 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 144, + 419, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 144, + 420, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 245, + 160 + ], + "score": 1.0, + "content": "Similar to Lemma 4, we can show", + "type": "text" + }, + { + "bbox": [ + 245, + 145, + 356, + 158 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\Psi _ { a } \\| _ { 2 } = O ( 1 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 144, + 420, + 160 + ], + "score": 1.0, + "content": ". It follows that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "interline_equation", + "bbox": [ + 143, + 163, + 446, + 187 + ], + "lines": [ + { + "bbox": [ + 143, + 163, + 446, + 187 + ], + "spans": [ + { + "bbox": [ + 143, + 163, + 446, + 187 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ,", + "type": "interline_equation", + "image_path": "a9192a7fcda4c92cb8f75adcab18fd6b499211246abaaa65fa75569d72169ebb.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 143, + 163, + 446, + 187 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 503, + 218 + ], + "lines": [ + { + "bbox": [ + 105, + 193, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 201, + 208 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 201, + 194, + 268, + 207 + ], + "score": 0.9, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 193, + 505, + 208 + ], + "score": 1.0, + "content": ". Combining this together with equation 50 and equation 55,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 205, + 336, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 245, + 218 + ], + "score": 1.0, + "content": "we obtain with probability at least", + "type": "text" + }, + { + "bbox": [ + 245, + 205, + 316, + 218 + ], + "score": 0.91, + "content": "1 - \\dot { O } ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 205, + 336, + 218 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5 + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 223, + 444, + 246 + ], + "lines": [ + { + "bbox": [ + 145, + 223, + 444, + 246 + ], + "spans": [ + { + "bbox": [ + 145, + 223, + 444, + 246 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\left\\| { \\widehat { V } } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } + { \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } } .", + "type": "interline_equation", + "image_path": "a417f09523a6add689d0026a3b3578e95fe4ed870caf7ef06efdec331f04c547.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 145, + 223, + 444, + 246 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 505, + 289 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 197, + 269 + ], + "score": 1.0, + "content": "Consider the function", + "type": "text" + }, + { + "bbox": [ + 197, + 254, + 251, + 267 + ], + "score": 0.92, + "content": "\\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 252, + 428, + 269 + ], + "score": 1.0, + "content": "defined in the proof of Theorem 1. We fix", + "type": "text" + }, + { + "bbox": [ + 428, + 253, + 505, + 266 + ], + "score": 0.93, + "content": "\\delta = \\eta ^ { - 1 } \\{ \\log K +", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 264, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 107, + 265, + 161, + 277 + ], + "score": 0.88, + "content": "4 d \\log n ( t _ { 1 } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 264, + 295, + 278 + ], + "score": 1.0, + "content": ". Based on Lemma A2 in Belloni", + "type": "text" + }, + { + "bbox": [ + 295, + 266, + 305, + 276 + ], + "score": 0.28, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 264, + 505, + 278 + ], + "score": 1.0, + "content": "Oliveira (2018), we have with probability at least", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 275, + 198, + 290 + ], + "spans": [ + { + "bbox": [ + 107, + 277, + 177, + 289 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 275, + 198, + 290 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9 + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 294, + 426, + 344 + ], + "lines": [ + { + "bbox": [ + 164, + 294, + 426, + 344 + ], + "spans": [ + { + "bbox": [ + 164, + 294, + 426, + 344 + ], + "score": 0.92, + "content": "\\begin{array} { r l r } & { } & { \\underset { \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } \\left| { \\mathbf E } ^ { * } { \\mathbf g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) - { \\mathbf E } { \\mathbf g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , { \\pmb V } ) ) \\right| } \\\\ & { } & { \\preceq q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}", + "type": "interline_equation", + "image_path": "cfeeb911fb3cd7dcf55e2454f6e1f3c166ae1b764787191c509dfd33ece8097e.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 164, + 294, + 426, + 310.6666666666667 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 164, + 310.6666666666667, + 426, + 327.33333333333337 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 164, + 327.33333333333337, + 426, + 344.00000000000006 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 348, + 505, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 348, + 133, + 361 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 349, + 146, + 359 + ], + "score": 0.86, + "content": "\\mathbf { E } ^ { \\ast }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "denotes the expectation conditional on the observed data. For a given set of thresholds", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 360, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 107, + 360, + 132, + 372 + ], + "score": 0.92, + "content": "\\{ \\nu _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 360, + 505, + 373 + ], + "score": 1.0, + "content": ", using similar arguments in proving equation 31, equation 32, equation 34 and equation 35,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 371, + 348, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 257, + 383 + ], + "score": 1.0, + "content": "we can show with probability at least", + "type": "text" + }, + { + "bbox": [ + 258, + 371, + 328, + 383 + ], + "score": 0.91, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 371, + 348, + 383 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15 + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 388, + 514, + 490 + ], + "lines": [ + { + "bbox": [ + 113, + 388, + 514, + 490 + ], + "spans": [ + { + "bbox": [ + 113, + 388, + 514, + 490 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\scriptscriptstyle { \\mathrm { M B } * } } - \\nu _ { k } \\right) \\le 0 \\right\\} \\le \\mathrm { E } ^ { * } \\mathtt { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , + } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) } \\\\ { \\le } & { \\mathrm { E } \\underline { { \\mathtt { g } } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , + } \\} _ { k } } ( N ( 0 , V ) ) + O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) } \\\\ { \\le } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\overline { { \\mathtt { X } } } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , + } ^ { * } \\right) \\le 0 \\right\\} } \\\\ { + } & { O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}", + "type": "interline_equation", + "image_path": "cc351a59d858ee7490babaaeb95a55a89c6746faf6069c29b942d06882afd573.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 113, + 388, + 514, + 422.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 113, + 422.0, + 514, + 456.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 113, + 456.0, + 514, + 490.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 495, + 124, + 505 + ], + "lines": [ + { + "bbox": [ + 105, + 494, + 124, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 494, + 124, + 506 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20 + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 510, + 514, + 612 + ], + "lines": [ + { + "bbox": [ + 113, + 510, + 514, + 612 + ], + "spans": [ + { + "bbox": [ + 113, + 510, + 514, + 612 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\scriptscriptstyle { \\mathrm { M B } * } } - \\nu _ { k } \\right) \\leq 0 \\right\\} \\geq \\mathrm { E } ^ { * } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , - } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) } \\\\ { \\geq } & { \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , - } \\} _ { k } } ( N ( 0 , V ) ) - O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) } \\\\ { \\geq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } \\\\ { - } & { O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}", + "type": "interline_equation", + "image_path": "93ad3108d19767a0e7bdebc66e4c173502d86665bbb8bce23498ead2eeefc581.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 113, + 510, + 514, + 544.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 113, + 544.0, + 514, + 578.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 113, + 578.0, + 514, + 612.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 616, + 302, + 628 + ], + "lines": [ + { + "bbox": [ + 106, + 615, + 302, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 615, + 133, + 630 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 617, + 155, + 628 + ], + "score": 0.92, + "content": "O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 615, + 302, + 630 + ], + "score": 1.0, + "content": "denotes some positive constant, and", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "interline_equation", + "bbox": [ + 125, + 632, + 527, + 668 + ], + "lines": [ + { + "bbox": [ + 125, + 632, + 527, + 668 + ], + "spans": [ + { + "bbox": [ + 125, + 632, + 527, + 668 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\nu _ { k , + } = \\nu _ { k } + \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \\nu _ { k , + } ^ { * } = \\nu _ { k , + } + 3 \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} } \\\\ & { \\nu _ { k , - } = \\nu _ { k } - 3 \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} - \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \\nu _ { k , - } ^ { * } = \\nu _ { k , - } - \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} } \\end{array}", + "type": "interline_equation", + "image_path": "dc99c18c562c2884047ccad7efef2eb4838bd16083b3ca6d71e93d3c0cc346c6.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 125, + 632, + 527, + 644.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 125, + 644.0, + 527, + 656.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 125, + 656.0, + 527, + 668.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 670, + 351, + 683 + ], + "lines": [ + { + "bbox": [ + 105, + 670, + 351, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 351, + 684 + ], + "score": 1.0, + "content": "By Theorem 2 of Chernozhukov et al. (2017), we obtain that", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 687, + 514, + 736 + ], + "lines": [ + { + "bbox": [ + 111, + 687, + 514, + 736 + ], + "spans": [ + { + "bbox": [ + 111, + 687, + 514, + 736 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\mathtt { p } _ { \\mathrm { T } } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , + } ^ { * } \\right) \\le 0 \\right\\} - \\mathtt { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , - } ^ { * } \\right) \\le 0 \\right\\} } \\\\ { \\preceq \\eta ^ { - 1 } \\{ \\log ^ { 3 / 2 } n ( t _ { 1 } ) + \\log ^ { 3 / 2 } K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \\{ \\log ^ { 1 / 2 } n ( t _ { 1 } ) + \\log ^ { 1 / 2 } K \\} . } \\end{array}", + "type": "interline_equation", + "image_path": "035cd86cc5282b44c2b747c06c0961c61522ced32361a9725cacb548c0b94124.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 111, + 687, + 514, + 703.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 111, + 703.3333333333334, + 514, + 719.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 111, + 719.6666666666667, + 514, + 736.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + } + ], + "page_idx": 28, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 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": [ + 105, + 82, + 504, + 106 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 505, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 133, + 95 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 82, + 155, + 95 + ], + "score": 0.9, + "content": "O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 156, + 82, + 505, + 95 + ], + "score": 1.0, + "content": "denotes some positive constant. Similar to equation 50 and equation 55, we can show", + "type": "text" + } + ], + "index": 0 + }, + { + "bbox": [ + 106, + 92, + 295, + 107 + ], + "spans": [ + { + "bbox": [ + 106, + 92, + 204, + 107 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 93, + 275, + 106 + ], + "score": 0.93, + "content": "1 \\stackrel { - } { - } O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 92, + 295, + 107 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 0.5, + "bbox_fs": [ + 106, + 82, + 505, + 107 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 196, + 111, + 394, + 139 + ], + "lines": [ + { + "bbox": [ + 196, + 111, + 394, + 139 + ], + "spans": [ + { + "bbox": [ + 196, + 111, + 394, + 139 + ], + "score": 0.95, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\left\\| { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } } \\Psi _ { 3 , a , k _ { 1 } } - \\Psi _ { a } \\right\\| _ { 2 } = o ( 1 ) .", + "type": "interline_equation", + "image_path": "1fab5457321bc242941464700f2be8af4c80b454b4340877699ba9d476f9dc26.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 196, + 111, + 394, + 139 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 144, + 419, + 159 + ], + "lines": [ + { + "bbox": [ + 106, + 144, + 420, + 160 + ], + "spans": [ + { + "bbox": [ + 106, + 144, + 245, + 160 + ], + "score": 1.0, + "content": "Similar to Lemma 4, we can show", + "type": "text" + }, + { + "bbox": [ + 245, + 145, + 356, + 158 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\Psi _ { a } \\| _ { 2 } = O ( 1 ) } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 357, + 144, + 420, + 160 + ], + "score": 1.0, + "content": ". It follows that", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 106, + 144, + 420, + 160 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 143, + 163, + 446, + 187 + ], + "lines": [ + { + "bbox": [ + 143, + 163, + 446, + 187 + ], + "spans": [ + { + "bbox": [ + 143, + 163, + 446, + 187 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ,", + "type": "interline_equation", + "image_path": "a9192a7fcda4c92cb8f75adcab18fd6b499211246abaaa65fa75569d72169ebb.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 143, + 163, + 446, + 187 + ], + "spans": [], + "index": 4 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 194, + 503, + 218 + ], + "lines": [ + { + "bbox": [ + 105, + 193, + 505, + 208 + ], + "spans": [ + { + "bbox": [ + 105, + 193, + 201, + 208 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 201, + 194, + 268, + 207 + ], + "score": 0.9, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 268, + 193, + 505, + 208 + ], + "score": 1.0, + "content": ". Combining this together with equation 50 and equation 55,", + "type": "text" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 205, + 336, + 218 + ], + "spans": [ + { + "bbox": [ + 105, + 205, + 245, + 218 + ], + "score": 1.0, + "content": "we obtain with probability at least", + "type": "text" + }, + { + "bbox": [ + 245, + 205, + 316, + 218 + ], + "score": 0.91, + "content": "1 - \\dot { O } ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 316, + 205, + 336, + 218 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5.5, + "bbox_fs": [ + 105, + 193, + 505, + 218 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 145, + 223, + 444, + 246 + ], + "lines": [ + { + "bbox": [ + 145, + 223, + 444, + 246 + ], + "spans": [ + { + "bbox": [ + 145, + 223, + 444, + 246 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\left\\| { \\widehat { V } } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } + { \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } } .", + "type": "interline_equation", + "image_path": "a417f09523a6add689d0026a3b3578e95fe4ed870caf7ef06efdec331f04c547.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 145, + 223, + 444, + 246 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 505, + 289 + ], + "lines": [ + { + "bbox": [ + 105, + 252, + 505, + 269 + ], + "spans": [ + { + "bbox": [ + 105, + 252, + 197, + 269 + ], + "score": 1.0, + "content": "Consider the function", + "type": "text" + }, + { + "bbox": [ + 197, + 254, + 251, + 267 + ], + "score": 0.92, + "content": "\\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } }", + "type": "inline_equation" + }, + { + "bbox": [ + 252, + 252, + 428, + 269 + ], + "score": 1.0, + "content": "defined in the proof of Theorem 1. We fix", + "type": "text" + }, + { + "bbox": [ + 428, + 253, + 505, + 266 + ], + "score": 0.93, + "content": "\\delta = \\eta ^ { - 1 } \\{ \\log K +", + "type": "inline_equation" + } + ], + "index": 8 + }, + { + "bbox": [ + 107, + 264, + 505, + 278 + ], + "spans": [ + { + "bbox": [ + 107, + 265, + 161, + 277 + ], + "score": 0.88, + "content": "4 d \\log n ( t _ { 1 } ) \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 264, + 295, + 278 + ], + "score": 1.0, + "content": ". Based on Lemma A2 in Belloni", + "type": "text" + }, + { + "bbox": [ + 295, + 266, + 305, + 276 + ], + "score": 0.28, + "content": "\\&", + "type": "inline_equation" + }, + { + "bbox": [ + 305, + 264, + 505, + 278 + ], + "score": 1.0, + "content": "Oliveira (2018), we have with probability at least", + "type": "text" + } + ], + "index": 9 + }, + { + "bbox": [ + 107, + 275, + 198, + 290 + ], + "spans": [ + { + "bbox": [ + 107, + 277, + 177, + 289 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 177, + 275, + 198, + 290 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 9, + "bbox_fs": [ + 105, + 252, + 505, + 290 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 164, + 294, + 426, + 344 + ], + "lines": [ + { + "bbox": [ + 164, + 294, + 426, + 344 + ], + "spans": [ + { + "bbox": [ + 164, + 294, + 426, + 344 + ], + "score": 0.92, + "content": "\\begin{array} { r l r } & { } & { \\underset { \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } \\left| { \\mathbf E } ^ { * } { \\mathbf g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) - { \\mathbf E } { \\mathbf g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , { \\pmb V } ) ) \\right| } \\\\ & { } & { \\preceq q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}", + "type": "interline_equation", + "image_path": "cfeeb911fb3cd7dcf55e2454f6e1f3c166ae1b764787191c509dfd33ece8097e.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 164, + 294, + 426, + 310.6666666666667 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 164, + 310.6666666666667, + 426, + 327.33333333333337 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 164, + 327.33333333333337, + 426, + 344.00000000000006 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 348, + 505, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 348, + 505, + 361 + ], + "spans": [ + { + "bbox": [ + 106, + 348, + 133, + 361 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 349, + 146, + 359 + ], + "score": 0.86, + "content": "\\mathbf { E } ^ { \\ast }", + "type": "inline_equation" + }, + { + "bbox": [ + 146, + 348, + 505, + 361 + ], + "score": 1.0, + "content": "denotes the expectation conditional on the observed data. For a given set of thresholds", + "type": "text" + } + ], + "index": 14 + }, + { + "bbox": [ + 107, + 360, + 505, + 373 + ], + "spans": [ + { + "bbox": [ + 107, + 360, + 132, + 372 + ], + "score": 0.92, + "content": "\\{ \\nu _ { k } \\} _ { k }", + "type": "inline_equation" + }, + { + "bbox": [ + 132, + 360, + 505, + 373 + ], + "score": 1.0, + "content": ", using similar arguments in proving equation 31, equation 32, equation 34 and equation 35,", + "type": "text" + } + ], + "index": 15 + }, + { + "bbox": [ + 105, + 371, + 348, + 383 + ], + "spans": [ + { + "bbox": [ + 105, + 371, + 257, + 383 + ], + "score": 1.0, + "content": "we can show with probability at least", + "type": "text" + }, + { + "bbox": [ + 258, + 371, + 328, + 383 + ], + "score": 0.91, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 329, + 371, + 348, + 383 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 15, + "bbox_fs": [ + 105, + 348, + 505, + 383 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 388, + 514, + 490 + ], + "lines": [ + { + "bbox": [ + 113, + 388, + 514, + 490 + ], + "spans": [ + { + "bbox": [ + 113, + 388, + 514, + 490 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\scriptscriptstyle { \\mathrm { M B } * } } - \\nu _ { k } \\right) \\le 0 \\right\\} \\le \\mathrm { E } ^ { * } \\mathtt { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , + } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) } \\\\ { \\le } & { \\mathrm { E } \\underline { { \\mathtt { g } } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , + } \\} _ { k } } ( N ( 0 , V ) ) + O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) } \\\\ { \\le } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\overline { { \\mathtt { X } } } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , + } ^ { * } \\right) \\le 0 \\right\\} } \\\\ { + } & { O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}", + "type": "interline_equation", + "image_path": "cc351a59d858ee7490babaaeb95a55a89c6746faf6069c29b942d06882afd573.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 113, + 388, + 514, + 422.0 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 113, + 422.0, + 514, + 456.0 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 113, + 456.0, + 514, + 490.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 495, + 124, + 505 + ], + "lines": [ + { + "bbox": [ + 105, + 494, + 124, + 506 + ], + "spans": [ + { + "bbox": [ + 105, + 494, + 124, + 506 + ], + "score": 1.0, + "content": "and", + "type": "text" + } + ], + "index": 20 + } + ], + "index": 20, + "bbox_fs": [ + 105, + 494, + 124, + 506 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 510, + 514, + 612 + ], + "lines": [ + { + "bbox": [ + 113, + 510, + 514, + 612 + ], + "spans": [ + { + "bbox": [ + 113, + 510, + 514, + 612 + ], + "score": 0.94, + "content": "\\begin{array} { r l } & { \\operatorname* { P r } ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\scriptscriptstyle { \\mathrm { M B } * } } - \\nu _ { k } \\right) \\leq 0 \\right\\} \\geq \\mathrm { E } ^ { * } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , - } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) } \\\\ { \\geq } & { \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , - } \\} _ { k } } ( N ( 0 , V ) ) - O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) } \\\\ { \\geq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } \\\\ { - } & { O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}", + "type": "interline_equation", + "image_path": "93ad3108d19767a0e7bdebc66e4c173502d86665bbb8bce23498ead2eeefc581.jpg" + } + ] + } + ], + "index": 22, + "virtual_lines": [ + { + "bbox": [ + 113, + 510, + 514, + 544.0 + ], + "spans": [], + "index": 21 + }, + { + "bbox": [ + 113, + 544.0, + 514, + 578.0 + ], + "spans": [], + "index": 22 + }, + { + "bbox": [ + 113, + 578.0, + 514, + 612.0 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 616, + 302, + 628 + ], + "lines": [ + { + "bbox": [ + 106, + 615, + 302, + 630 + ], + "spans": [ + { + "bbox": [ + 106, + 615, + 133, + 630 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 134, + 617, + 155, + 628 + ], + "score": 0.92, + "content": "O ( 1 )", + "type": "inline_equation" + }, + { + "bbox": [ + 155, + 615, + 302, + 630 + ], + "score": 1.0, + "content": "denotes some positive constant, and", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 106, + 615, + 302, + 630 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 125, + 632, + 527, + 668 + ], + "lines": [ + { + "bbox": [ + 125, + 632, + 527, + 668 + ], + "spans": [ + { + "bbox": [ + 125, + 632, + 527, + 668 + ], + "score": 0.91, + "content": "\\begin{array} { r l } & { \\nu _ { k , + } = \\nu _ { k } + \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \\nu _ { k , + } ^ { * } = \\nu _ { k , + } + 3 \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} } \\\\ & { \\nu _ { k , - } = \\nu _ { k } - 3 \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} - \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \\nu _ { k , - } ^ { * } = \\nu _ { k , - } - \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} } \\end{array}", + "type": "interline_equation", + "image_path": "dc99c18c562c2884047ccad7efef2eb4838bd16083b3ca6d71e93d3c0cc346c6.jpg" + } + ] + } + ], + "index": 26, + "virtual_lines": [ + { + "bbox": [ + 125, + 632, + 527, + 644.0 + ], + "spans": [], + "index": 25 + }, + { + "bbox": [ + 125, + 644.0, + 527, + 656.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 125, + 656.0, + 527, + 668.0 + ], + "spans": [], + "index": 27 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 670, + 351, + 683 + ], + "lines": [ + { + "bbox": [ + 105, + 670, + 351, + 684 + ], + "spans": [ + { + "bbox": [ + 105, + 670, + 351, + 684 + ], + "score": 1.0, + "content": "By Theorem 2 of Chernozhukov et al. (2017), we obtain that", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 28, + "bbox_fs": [ + 105, + 670, + 351, + 684 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 687, + 514, + 736 + ], + "lines": [ + { + "bbox": [ + 111, + 687, + 514, + 736 + ], + "spans": [ + { + "bbox": [ + 111, + 687, + 514, + 736 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\mathtt { p } _ { \\mathrm { T } } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , + } ^ { * } \\right) \\le 0 \\right\\} - \\mathtt { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , - } ^ { * } \\right) \\le 0 \\right\\} } \\\\ { \\preceq \\eta ^ { - 1 } \\{ \\log ^ { 3 / 2 } n ( t _ { 1 } ) + \\log ^ { 3 / 2 } K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \\{ \\log ^ { 1 / 2 } n ( t _ { 1 } ) + \\log ^ { 1 / 2 } K \\} . } \\end{array}", + "type": "interline_equation", + "image_path": "035cd86cc5282b44c2b747c06c0961c61522ced32361a9725cacb548c0b94124.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 111, + 687, + 514, + 703.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 111, + 703.3333333333334, + 514, + 719.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 111, + 719.6666666666667, + 514, + 736.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 164, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 165, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 165, + 94 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 99, + 514, + 169 + ], + "lines": [ + { + "bbox": [ + 111, + 99, + 514, + 169 + ], + "spans": [ + { + "bbox": [ + 111, + 99, + 514, + 169 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\underset { \\nu _ { k } \\not \\mathrm { J } _ { k } } { \\operatorname* { s u p } } | { \\operatorname* { P r } } ^ { * } \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } - \\nu _ { k } ) \\leq 0 \\} - { \\operatorname* { P r } } \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k } ) \\leq 0 \\} } \\\\ { \\preceq q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} ( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ) } \\\\ { + \\eta ^ { - 1 } \\{ \\log ^ { 3 / 2 } n ( t _ { 1 } ) + \\log ^ { 3 / 2 } K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \\{ \\log ^ { 1 / 2 } n ( t _ { 1 } ) + \\log ^ { 1 / 2 } K \\} } \\end{array}", + "type": "interline_equation", + "image_path": "14011b32e0863773df48fc26ca76e79e1487225d9103c264dcc95cb23749c27f.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 111, + 99, + 514, + 122.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 122.33333333333333, + 514, + 145.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 145.66666666666666, + 514, + 169.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 173, + 295, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 173, + 295, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 204, + 187 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 174, + 275, + 187 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 173, + 295, + 187 + ], + "score": 1.0, + "content": ". Set", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4 + }, + { + "type": "interline_equation", + "bbox": [ + 137, + 193, + 473, + 209 + ], + "lines": [ + { + "bbox": [ + 137, + 193, + 473, + 209 + ], + "spans": [ + { + "bbox": [ + 137, + 193, + 473, + 209 + ], + "score": 0.87, + "content": "\\eta = \\operatorname* { m i n } [ q ^ { - 1 } n ^ { \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { - ( 1 + 2 \\alpha _ { 0 } ) / 6 } \\{ K n ( t _ { 1 } ) \\} , q ^ { - 1 / 2 } n ^ { 1 / 6 } ( t _ { 1 } ) \\log ^ { - 1 / 3 } \\{ K n ( t _ { 1 } ) \\} ] ,", + "type": "interline_equation", + "image_path": "6896a4985723f61306460a5100ec6aa098d4224277481af733881c1bc66b21a1.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 137, + 193, + 473, + 209 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 216, + 220, + 228 + ], + "lines": [ + { + "bbox": [ + 106, + 216, + 221, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 221, + 228 + ], + "score": 1.0, + "content": "we obtain the desired result.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "title", + "bbox": [ + 107, + 244, + 219, + 255 + ], + "lines": [ + { + "bbox": [ + 106, + 243, + 220, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 220, + 256 + ], + "score": 1.0, + "content": "E.8 PROOF OF LEMMA 7", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 265, + 298, + 277 + ], + "lines": [ + { + "bbox": [ + 107, + 265, + 299, + 278 + ], + "spans": [ + { + "bbox": [ + 107, + 265, + 299, + 278 + ], + "score": 1.0, + "content": "Combining Lemma 6 with Lemma 4 yields that", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 284, + 506, + 320 + ], + "lines": [ + { + "bbox": [ + 111, + 284, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 111, + 284, + 506, + 320 + ], + "score": 0.9, + "content": "\\left. \\Sigma _ { a } ^ { - 1 } \\left( \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right) \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } , a \\in \\{ 0 , 1 \\} ,", + "type": "interline_equation", + "image_path": "b0a6063c35d1e3122f587337a9ba3c78e38c7bb832a251582d9aa652c294aa43.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 111, + 284, + 506, + 296.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 111, + 296.0, + 506, + 308.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 111, + 308.0, + 506, + 320.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 326, + 469, + 340 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 471, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 204, + 342 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 327, + 252, + 340 + ], + "score": 0.94, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 326, + 471, + 342 + ], + "score": 1.0, + "content": ". Combining this together with equation 16 yields that", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12 + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 346, + 413, + 363 + ], + "lines": [ + { + "bbox": [ + 177, + 346, + 413, + 363 + ], + "spans": [ + { + "bbox": [ + 177, + 346, + 413, + 363 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } , a \\in \\{ 0 , 1 \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "bc2cf4ae409cbfad26663ccbbefa14adf028030f3840b8a4cd1fe6fc98112b3b.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 177, + 346, + 413, + 363 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 370, + 380, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 369, + 380, + 385 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 204, + 385 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 370, + 252, + 383 + ], + "score": 0.95, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 369, + 380, + 385 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "title", + "bbox": [ + 106, + 398, + 220, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 396, + 221, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 221, + 411 + ], + "score": 1.0, + "content": "E.9 PROOF OF LEMMA 8", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 153, + 431 + ], + "lines": [ + { + "bbox": [ + 105, + 418, + 154, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 154, + 432 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "interline_equation", + "bbox": [ + 160, + 437, + 459, + 544 + ], + "lines": [ + { + "bbox": [ + 160, + 437, + 459, + 544 + ], + "spans": [ + { + "bbox": [ + 160, + 437, + 459, + 544 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ) ^ { 2 } - \\Phi _ { a } \\right\\| _ { 2 } } \\\\ { \\le } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) [ \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) ] \\right\\| _ { 2 } } \\\\ { + } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) - \\Phi _ { a } \\right\\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "8475210fe69162edb06d280f3b6535563fbb9e59422470507dbea1829fb922e0.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 160, + 437, + 459, + 472.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 160, + 472.6666666666667, + 459, + 508.33333333333337 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 160, + 508.33333333333337, + 459, + 544.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 549, + 504, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 505, + 561 + ], + "score": 1.0, + "content": "Similar to the proof of Lemma 5, we can show that the second term on the RHS of equation 56 is", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 560, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 157, + 575 + ], + "score": 1.0, + "content": "of the order", + "type": "text" + }, + { + "bbox": [ + 158, + 560, + 253, + 574 + ], + "score": 0.92, + "content": "O ( q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 561, + 290, + 575 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 290, + 561, + 335, + 574 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 561, + 371, + 575 + ], + "score": 1.0, + "content": "and any", + "type": "text" + }, + { + "bbox": [ + 371, + 562, + 402, + 574 + ], + "score": 0.91, + "content": "k \\geq j _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 561, + 506, + 575 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 572, + 403, + 586 + ], + "spans": [ + { + "bbox": [ + 107, + 573, + 160, + 585 + ], + "score": 0.92, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 572, + 403, + 586 + ], + "score": 1.0, + "content": ". As for the first term, notice that each element in the matrix", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 592, + 429, + 627 + ], + "lines": [ + { + "bbox": [ + 162, + 592, + 429, + 627 + ], + "spans": [ + { + "bbox": [ + 162, + 592, + 429, + 627 + ], + "score": 0.93, + "content": "\\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ) ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) \\}", + "type": "interline_equation", + "image_path": "c1eefd4a3f072fb139798ea9dd495c7b3d5de3bb86fdb5361c8f334000ae3261.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 162, + 592, + 429, + 603.6666666666666 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 162, + 603.6666666666666, + 429, + 615.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 162, + 615.3333333333333, + 429, + 626.9999999999999 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 633, + 504, + 658 + ], + "lines": [ + { + "bbox": [ + 106, + 634, + 504, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 335, + 646 + ], + "score": 1.0, + "content": "corresponds to a martingale with respect to the filtration", + "type": "text" + }, + { + "bbox": [ + 335, + 634, + 412, + 646 + ], + "score": 0.91, + "content": "\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 635, + 504, + 646 + ], + "score": 1.0, + "content": ", under (A1) and (A2).", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 645, + 474, + 658 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 474, + 658 + ], + "score": 1.0, + "content": "Using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5 + }, + { + "type": "interline_equation", + "bbox": [ + 106, + 664, + 482, + 712 + ], + "lines": [ + { + "bbox": [ + 106, + 664, + 482, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 664, + 482, + 712 + ], + "score": 0.92, + "content": "\\left. \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) [ \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) ] \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } ,", + "type": "interline_equation", + "image_path": "c5ef5ba1bf838d63226ef6e70d156c9f5306b602bda9c7bc55db3c50fcc52e94.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 106, + 664, + 482, + 680.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 106, + 680.0, + 482, + 696.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 106, + 696.0, + 482, + 712.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 719, + 380, + 733 + ], + "lines": [ + { + "bbox": [ + 106, + 719, + 380, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 719, + 204, + 734 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 720, + 252, + 732 + ], + "score": 0.94, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 719, + 380, + 734 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31 + } + ], + "page_idx": 29, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 2021", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 313, + 763 + ], + "score": 1.0, + "content": "30", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 164, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 82, + 165, + 94 + ], + "spans": [ + { + "bbox": [ + 106, + 82, + 165, + 94 + ], + "score": 1.0, + "content": "It follows that", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 106, + 82, + 165, + 94 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 99, + 514, + 169 + ], + "lines": [ + { + "bbox": [ + 111, + 99, + 514, + 169 + ], + "spans": [ + { + "bbox": [ + 111, + 99, + 514, + 169 + ], + "score": 0.89, + "content": "\\begin{array} { r } { \\underset { \\nu _ { k } \\not \\mathrm { J } _ { k } } { \\operatorname* { s u p } } | { \\operatorname* { P r } } ^ { * } \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } - \\nu _ { k } ) \\leq 0 \\} - { \\operatorname* { P r } } \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k } ) \\leq 0 \\} } \\\\ { \\preceq q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} ( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ) } \\\\ { + \\eta ^ { - 1 } \\{ \\log ^ { 3 / 2 } n ( t _ { 1 } ) + \\log ^ { 3 / 2 } K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \\{ \\log ^ { 1 / 2 } n ( t _ { 1 } ) + \\log ^ { 1 / 2 } K \\} } \\end{array}", + "type": "interline_equation", + "image_path": "14011b32e0863773df48fc26ca76e79e1487225d9103c264dcc95cb23749c27f.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 111, + 99, + 514, + 122.33333333333333 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 111, + 122.33333333333333, + 514, + 145.66666666666666 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 111, + 145.66666666666666, + 514, + 169.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 173, + 295, + 186 + ], + "lines": [ + { + "bbox": [ + 105, + 173, + 295, + 187 + ], + "spans": [ + { + "bbox": [ + 105, + 173, + 204, + 187 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 174, + 275, + 187 + ], + "score": 0.92, + "content": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 173, + 295, + 187 + ], + "score": 1.0, + "content": ". Set", + "type": "text" + } + ], + "index": 4 + } + ], + "index": 4, + "bbox_fs": [ + 105, + 173, + 295, + 187 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 137, + 193, + 473, + 209 + ], + "lines": [ + { + "bbox": [ + 137, + 193, + 473, + 209 + ], + "spans": [ + { + "bbox": [ + 137, + 193, + 473, + 209 + ], + "score": 0.87, + "content": "\\eta = \\operatorname* { m i n } [ q ^ { - 1 } n ^ { \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { - ( 1 + 2 \\alpha _ { 0 } ) / 6 } \\{ K n ( t _ { 1 } ) \\} , q ^ { - 1 / 2 } n ^ { 1 / 6 } ( t _ { 1 } ) \\log ^ { - 1 / 3 } \\{ K n ( t _ { 1 } ) \\} ] ,", + "type": "interline_equation", + "image_path": "6896a4985723f61306460a5100ec6aa098d4224277481af733881c1bc66b21a1.jpg" + } + ] + } + ], + "index": 5, + "virtual_lines": [ + { + "bbox": [ + 137, + 193, + 473, + 209 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 216, + 220, + 228 + ], + "lines": [ + { + "bbox": [ + 106, + 216, + 221, + 228 + ], + "spans": [ + { + "bbox": [ + 106, + 216, + 221, + 228 + ], + "score": 1.0, + "content": "we obtain the desired result.", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 216, + 221, + 228 + ] + }, + { + "type": "title", + "bbox": [ + 107, + 244, + 219, + 255 + ], + "lines": [ + { + "bbox": [ + 106, + 243, + 220, + 256 + ], + "spans": [ + { + "bbox": [ + 106, + 243, + 220, + 256 + ], + "score": 1.0, + "content": "E.8 PROOF OF LEMMA 7", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "text", + "bbox": [ + 106, + 265, + 298, + 277 + ], + "lines": [ + { + "bbox": [ + 107, + 265, + 299, + 278 + ], + "spans": [ + { + "bbox": [ + 107, + 265, + 299, + 278 + ], + "score": 1.0, + "content": "Combining Lemma 6 with Lemma 4 yields that", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 107, + 265, + 299, + 278 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 284, + 506, + 320 + ], + "lines": [ + { + "bbox": [ + 111, + 284, + 506, + 320 + ], + "spans": [ + { + "bbox": [ + 111, + 284, + 506, + 320 + ], + "score": 0.9, + "content": "\\left. \\Sigma _ { a } ^ { - 1 } \\left( \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right) \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } , a \\in \\{ 0 , 1 \\} ,", + "type": "interline_equation", + "image_path": "b0a6063c35d1e3122f587337a9ba3c78e38c7bb832a251582d9aa652c294aa43.jpg" + } + ] + } + ], + "index": 10, + "virtual_lines": [ + { + "bbox": [ + 111, + 284, + 506, + 296.0 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 111, + 296.0, + 506, + 308.0 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 111, + 308.0, + 506, + 320.0 + ], + "spans": [], + "index": 11 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 326, + 469, + 340 + ], + "lines": [ + { + "bbox": [ + 105, + 326, + 471, + 342 + ], + "spans": [ + { + "bbox": [ + 105, + 326, + 204, + 342 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 327, + 252, + 340 + ], + "score": 0.94, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 326, + 471, + 342 + ], + "score": 1.0, + "content": ". Combining this together with equation 16 yields that", + "type": "text" + } + ], + "index": 12 + } + ], + "index": 12, + "bbox_fs": [ + 105, + 326, + 471, + 342 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 177, + 346, + 413, + 363 + ], + "lines": [ + { + "bbox": [ + 177, + 346, + 413, + 363 + ], + "spans": [ + { + "bbox": [ + 177, + 346, + 413, + 363 + ], + "score": 0.88, + "content": "\\begin{array} { r } { \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } , a \\in \\{ 0 , 1 \\} , } \\end{array}", + "type": "interline_equation", + "image_path": "bc2cf4ae409cbfad26663ccbbefa14adf028030f3840b8a4cd1fe6fc98112b3b.jpg" + } + ] + } + ], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 177, + 346, + 413, + 363 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 370, + 380, + 383 + ], + "lines": [ + { + "bbox": [ + 106, + 369, + 380, + 385 + ], + "spans": [ + { + "bbox": [ + 106, + 369, + 204, + 385 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 370, + 252, + 383 + ], + "score": 0.95, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 369, + 380, + 385 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 369, + 380, + 385 + ] + }, + { + "type": "title", + "bbox": [ + 106, + 398, + 220, + 409 + ], + "lines": [ + { + "bbox": [ + 105, + 396, + 221, + 411 + ], + "spans": [ + { + "bbox": [ + 105, + 396, + 221, + 411 + ], + "score": 1.0, + "content": "E.9 PROOF OF LEMMA 8", + "type": "text" + } + ], + "index": 15 + } + ], + "index": 15 + }, + { + "type": "text", + "bbox": [ + 106, + 420, + 153, + 431 + ], + "lines": [ + { + "bbox": [ + 105, + 418, + 154, + 432 + ], + "spans": [ + { + "bbox": [ + 105, + 418, + 154, + 432 + ], + "score": 1.0, + "content": "Notice that", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16, + "bbox_fs": [ + 105, + 418, + 154, + 432 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 160, + 437, + 459, + 544 + ], + "lines": [ + { + "bbox": [ + 160, + 437, + 459, + 544 + ], + "spans": [ + { + "bbox": [ + 160, + 437, + 459, + 544 + ], + "score": 0.95, + "content": "\\begin{array} { r l } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ) ^ { 2 } - \\Phi _ { a } \\right\\| _ { 2 } } \\\\ { \\le } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) [ \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) ] \\right\\| _ { 2 } } \\\\ { + } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) - \\Phi _ { a } \\right\\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "8475210fe69162edb06d280f3b6535563fbb9e59422470507dbea1829fb922e0.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 160, + 437, + 459, + 472.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 160, + 472.6666666666667, + 459, + 508.33333333333337 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 160, + 508.33333333333337, + 459, + 544.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 549, + 504, + 585 + ], + "lines": [ + { + "bbox": [ + 106, + 549, + 505, + 561 + ], + "spans": [ + { + "bbox": [ + 106, + 549, + 505, + 561 + ], + "score": 1.0, + "content": "Similar to the proof of Lemma 5, we can show that the second term on the RHS of equation 56 is", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 105, + 560, + 506, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 561, + 157, + 575 + ], + "score": 1.0, + "content": "of the order", + "type": "text" + }, + { + "bbox": [ + 158, + 560, + 253, + 574 + ], + "score": 0.92, + "content": "O ( q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } )", + "type": "inline_equation" + }, + { + "bbox": [ + 254, + 561, + 290, + 575 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 290, + 561, + 335, + 574 + ], + "score": 0.93, + "content": "a \\in \\{ 0 , 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 335, + 561, + 371, + 575 + ], + "score": 1.0, + "content": "and any", + "type": "text" + }, + { + "bbox": [ + 371, + 562, + 402, + 574 + ], + "score": 0.91, + "content": "k \\geq j _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 402, + 561, + 506, + 575 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 107, + 572, + 403, + 586 + ], + "spans": [ + { + "bbox": [ + 107, + 573, + 160, + 585 + ], + "score": 0.92, + "content": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 572, + 403, + 586 + ], + "score": 1.0, + "content": ". As for the first term, notice that each element in the matrix", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21, + "bbox_fs": [ + 105, + 549, + 506, + 586 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 162, + 592, + 429, + 627 + ], + "lines": [ + { + "bbox": [ + 162, + 592, + 429, + 627 + ], + "spans": [ + { + "bbox": [ + 162, + 592, + 429, + 627 + ], + "score": 0.93, + "content": "\\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ) ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) \\}", + "type": "interline_equation", + "image_path": "c1eefd4a3f072fb139798ea9dd495c7b3d5de3bb86fdb5361c8f334000ae3261.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 162, + 592, + 429, + 603.6666666666666 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 162, + 603.6666666666666, + 429, + 615.3333333333333 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 162, + 615.3333333333333, + 429, + 626.9999999999999 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 633, + 504, + 658 + ], + "lines": [ + { + "bbox": [ + 106, + 634, + 504, + 646 + ], + "spans": [ + { + "bbox": [ + 106, + 635, + 335, + 646 + ], + "score": 1.0, + "content": "corresponds to a martingale with respect to the filtration", + "type": "text" + }, + { + "bbox": [ + 335, + 634, + 412, + 646 + ], + "score": 0.91, + "content": "\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 1 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 413, + 635, + 504, + 646 + ], + "score": 1.0, + "content": ", under (A1) and (A2).", + "type": "text" + } + ], + "index": 26 + }, + { + "bbox": [ + 106, + 645, + 474, + 658 + ], + "spans": [ + { + "bbox": [ + 106, + 645, + 474, + 658 + ], + "score": 1.0, + "content": "Using similar arguments in proving Equation (C.15) of Shi et al. (2020b), we can show that", + "type": "text" + } + ], + "index": 27 + } + ], + "index": 26.5, + "bbox_fs": [ + 106, + 634, + 504, + 658 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 106, + 664, + 482, + 712 + ], + "lines": [ + { + "bbox": [ + 106, + 664, + 482, + 712 + ], + "spans": [ + { + "bbox": [ + 106, + 664, + 482, + 712 + ], + "score": 0.92, + "content": "\\left. \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) [ \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) ] \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } ,", + "type": "interline_equation", + "image_path": "c5ef5ba1bf838d63226ef6e70d156c9f5306b602bda9c7bc55db3c50fcc52e94.jpg" + } + ] + } + ], + "index": 29, + "virtual_lines": [ + { + "bbox": [ + 106, + 664, + 482, + 680.0 + ], + "spans": [], + "index": 28 + }, + { + "bbox": [ + 106, + 680.0, + 482, + 696.0 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 106, + 696.0, + 482, + 712.0 + ], + "spans": [], + "index": 30 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 719, + 380, + 733 + ], + "lines": [ + { + "bbox": [ + 106, + 719, + 380, + 734 + ], + "spans": [ + { + "bbox": [ + 106, + 719, + 204, + 734 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 720, + 252, + 732 + ], + "score": 0.94, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 719, + 380, + 734 + ], + "score": 1.0, + "content": ". The proof is hence completed.", + "type": "text" + } + ], + "index": 31 + } + ], + "index": 31, + "bbox_fs": [ + 106, + 719, + 380, + 734 + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 226, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 226, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 226, + 95 + ], + "score": 1.0, + "content": "E.10 PROOF OF LEMMA 2", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 101, + 505, + 127 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 281, + 117 + ], + "score": 1.0, + "content": "We begin by providing an upper bound for", + "type": "text" + }, + { + "bbox": [ + 281, + 101, + 386, + 116 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 100, + 506, + 117 + ], + "score": 1.0, + "content": ". With some calculations, we", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 111, + 129, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 129, + 128 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5 + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 127, + 470, + 199 + ], + "lines": [ + { + "bbox": [ + 119, + 127, + 470, + 199 + ], + "spans": [ + { + "bbox": [ + 119, + 127, + 470, + 199 + ], + "score": 0.95, + "content": "\\begin{array} { r } { \\displaystyle \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } = \\displaystyle \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left\\| \\widehat { \\boldsymbol { \\Sigma } } _ { a , k } ^ { - 1 } \\left( \\displaystyle \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right) \\right\\| _ { 2 } } \\\\ { \\leq \\displaystyle \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\widehat { \\boldsymbol { \\Sigma } } _ { a , k } ^ { - 1 } \\right\\| _ { 2 a \\in \\{ 0 , 1 \\} } \\displaystyle \\operatorname* { m a x } _ { k } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "f99d49c76ea24f57de770704be3f6da67df34d4a6c067d1dc2ff547e09d87889.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 119, + 127, + 470, + 151.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 119, + 151.0, + 470, + 175.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 119, + 175.0, + 470, + 199.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 203, + 370, + 215 + ], + "lines": [ + { + "bbox": [ + 106, + 202, + 370, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 202, + 302, + 217 + ], + "score": 1.0, + "content": "By Lemma 6, we obtain with probability at least", + "type": "text" + }, + { + "bbox": [ + 302, + 202, + 351, + 216 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 202, + 370, + 217 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6 + }, + { + "type": "interline_equation", + "bbox": [ + 122, + 219, + 469, + 254 + ], + "lines": [ + { + "bbox": [ + 122, + 219, + 469, + 254 + ], + "spans": [ + { + "bbox": [ + 122, + 219, + 469, + 254 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } .", + "type": "interline_equation", + "image_path": "8e02308c99fdcb5824d3e79b41fea44dfc335ef10ff4c22e3e84cb6f54f98c20.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 122, + 219, + 469, + 230.66666666666666 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 122, + 230.66666666666666, + 469, + 242.33333333333331 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 122, + 242.33333333333331, + 469, + 253.99999999999997 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 258, + 367, + 271 + ], + "lines": [ + { + "bbox": [ + 106, + 258, + 367, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 299, + 272 + ], + "score": 1.0, + "content": "Similarly, we can show with probability at least", + "type": "text" + }, + { + "bbox": [ + 299, + 258, + 348, + 271 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 258, + 367, + 272 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10 + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 275, + 448, + 310 + ], + "lines": [ + { + "bbox": [ + 141, + 275, + 448, + 310 + ], + "spans": [ + { + "bbox": [ + 141, + 275, + 448, + 310 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left\\| \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log j _ { n } } ,", + "type": "interline_equation", + "image_path": "c7495ade52eb7d5c794ef9d165dd659ff162e83a0d29075f2fe50e77b3ecae2a.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 141, + 275, + 448, + 286.6666666666667 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 141, + 286.6666666666667, + 448, + 298.33333333333337 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 141, + 298.33333333333337, + 448, + 310.00000000000006 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 334, + 235, + 345 + ], + "lines": [ + { + "bbox": [ + 106, + 333, + 236, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 236, + 347 + ], + "score": 1.0, + "content": "Similar to equation 42, we have", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14 + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 349, + 461, + 420 + ], + "lines": [ + { + "bbox": [ + 129, + 349, + 461, + 420 + ], + "spans": [ + { + "bbox": [ + 129, + 349, + 461, + 420 + ], + "score": 0.94, + "content": "\\begin{array} { r l r } & { } & { \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } ~ \\lambda _ { \\mathrm { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m i n } } ~ \\lambda _ { \\mathrm { m i n } } \\left( \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\frac { 1 } { k } \\underset { i = 1 } { \\overset { k } { \\sum } } \\pi _ { i - 1 } ( a , X ) \\right) } \\\\ & { } & { - \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } ~ \\frac { 1 } { k } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "112658f5f18d71dff63814ee8aeac48fb40109561b305adca62497dac74cea42.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 129, + 349, + 461, + 372.6666666666667 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 129, + 372.6666666666667, + 461, + 396.33333333333337 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 129, + 396.33333333333337, + 461, + 420.00000000000006 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 423, + 373, + 435 + ], + "lines": [ + { + "bbox": [ + 106, + 422, + 374, + 437 + ], + "spans": [ + { + "bbox": [ + 106, + 422, + 374, + 437 + ], + "score": 1.0, + "content": "Using similar arguments in proving equation 44, we can show that", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 438, + 479, + 474 + ], + "lines": [ + { + "bbox": [ + 111, + 438, + 479, + 474 + ], + "spans": [ + { + "bbox": [ + 111, + 438, + 479, + 474 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ { \\mathbb { I } } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log k } ,", + "type": "interline_equation", + "image_path": "8243d3944f2a103dde0cdd28b11c4f9bd983f4d5c87a4c5166ab7795bc02f78c.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 111, + 438, + 479, + 450.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 111, + 450.0, + 479, + 462.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 111, + 462.0, + 479, + 474.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 490, + 352, + 504 + ], + "lines": [ + { + "bbox": [ + 106, + 490, + 352, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 203, + 506 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 491, + 252, + 504 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 490, + 352, + 506 + ], + "score": 1.0, + "content": ". Similarly, we can show", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22 + }, + { + "type": "interline_equation", + "bbox": [ + 109, + 507, + 480, + 543 + ], + "lines": [ + { + "bbox": [ + 109, + 507, + 480, + 543 + ], + "spans": [ + { + "bbox": [ + 109, + 507, + 480, + 543 + ], + "score": 0.86, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ { \\mathbb { I } } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log j _ { n } } ,", + "type": "interline_equation", + "image_path": "8f0e5115f02954dee91dfc36586b5fd172651251319fea0d46280c2833ebf7dc.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 109, + 507, + 480, + 519.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 109, + 519.0, + 480, + 531.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 109, + 531.0, + 480, + 543.0 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 559, + 255, + 572 + ], + "lines": [ + { + "bbox": [ + 105, + 558, + 253, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 204, + 575 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 560, + 253, + 573 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + } + ], + "index": 26 + } + ], + "index": 26 + }, + { + "type": "text", + "bbox": [ + 105, + 576, + 504, + 600 + ], + "lines": [ + { + "bbox": [ + 105, + 575, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 249, + 591 + ], + "score": 1.0, + "content": "Without loss of generality, assume", + "type": "text" + }, + { + "bbox": [ + 250, + 577, + 290, + 589 + ], + "score": 0.91, + "content": "\\varepsilon _ { 0 } \\leq 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 575, + 381, + 591 + ], + "score": 1.0, + "content": ". Notice that we have", + "type": "text" + }, + { + "bbox": [ + 382, + 577, + 450, + 589 + ], + "score": 0.92, + "content": "\\pi _ { i - 1 } ( a , x ) \\geq \\varepsilon _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 575, + 487, + 591 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 487, + 578, + 505, + 588 + ], + "score": 0.82, + "content": "a \\in", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 587, + 417, + 600 + ], + "spans": [ + { + "bbox": [ + 107, + 588, + 162, + 600 + ], + "score": 0.25, + "content": "\\{ 0 , 1 \\} , x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 587, + 180, + 600 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 180, + 588, + 210, + 599 + ], + "score": 0.91, + "content": "i \\geq N _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 587, + 417, + 600 + ], + "score": 1.0, + "content": ". This together with Lemma equation 4 implies that", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5 + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 604, + 472, + 638 + ], + "lines": [ + { + "bbox": [ + 118, + 604, + 472, + 638 + ], + "spans": [ + { + "bbox": [ + 118, + 604, + 472, + 638 + ], + "score": 0.94, + "content": "\\operatorname* { i n f } _ { a \\in \\{ 0 , 1 \\} , n \\geq j _ { n } } \\lambda _ { \\operatorname* { m i n } } \\left( \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\frac { 1 } { n } \\sum _ { i = 1 } ^ { n } \\pi _ { i - 1 } ( a , X ) \\right) \\geq \\frac { n - N _ { 0 } } { n } \\varepsilon _ { 0 } \\geq \\frac { j - N _ { 0 } } { j } \\varepsilon _ { 0 } .", + "type": "interline_equation", + "image_path": "8583626ddc7a477a67a134fba07ab17a194e0c368d18cfe5ee3160f6e996dfa1.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 118, + 604, + 472, + 615.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 118, + 615.3333333333334, + 472, + 626.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 118, + 626.6666666666667, + 472, + 638.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 641, + 368, + 653 + ], + "lines": [ + { + "bbox": [ + 106, + 640, + 368, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 640, + 368, + 655 + ], + "score": 1.0, + "content": "Combining this together with equation 60 and equation 61 yields", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32 + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 656, + 390, + 680 + ], + "lines": [ + { + "bbox": [ + 199, + 656, + 390, + 680 + ], + "spans": [ + { + "bbox": [ + 199, + 656, + 390, + 680 + ], + "score": 0.92, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\frac { \\varepsilon _ { 0 } } { 2 } , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } ,", + "type": "interline_equation", + "image_path": "85070b0f79dc8a2678bd4332fdfcf8fcc1b4282538fe6ebac2a7baa9794971d8.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 199, + 656, + 390, + 680 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 685, + 505, + 709 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 180, + 700 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 686, + 210, + 697 + ], + "score": 0.91, + "content": "L ^ { * } \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 684, + 311, + 700 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 311, + 686, + 359, + 698 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 684, + 506, + 700 + ], + "score": 1.0, + "content": ". This together with equation 58 and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 696, + 201, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 696, + 201, + 710 + ], + "score": 1.0, + "content": "equation 59 yields that", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5 + }, + { + "type": "interline_equation", + "bbox": [ + 144, + 712, + 445, + 735 + ], + "lines": [ + { + "bbox": [ + 144, + 712, + 445, + 735 + ], + "spans": [ + { + "bbox": [ + 144, + 712, + 445, + 735 + ], + "score": 0.88, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) } , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } ,", + "type": "interline_equation", + "image_path": "32eae6a2cd006bc94c93939067fb95113a411988e498c1f8593cf8d26868d21a.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 144, + 712, + 445, + 735 + ], + "spans": [], + "index": 36 + } + ] + } + ], + "page_idx": 30, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 761 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 764 + ], + "score": 1.0, + "content": "31", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "title", + "bbox": [ + 107, + 82, + 226, + 94 + ], + "lines": [ + { + "bbox": [ + 106, + 81, + 226, + 95 + ], + "spans": [ + { + "bbox": [ + 106, + 81, + 226, + 95 + ], + "score": 1.0, + "content": "E.10 PROOF OF LEMMA 2", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 101, + 505, + 127 + ], + "lines": [ + { + "bbox": [ + 105, + 100, + 506, + 117 + ], + "spans": [ + { + "bbox": [ + 105, + 100, + 281, + 117 + ], + "score": 1.0, + "content": "We begin by providing an upper bound for", + "type": "text" + }, + { + "bbox": [ + 281, + 101, + 386, + 116 + ], + "score": 0.92, + "content": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } } \\end{array}", + "type": "inline_equation" + }, + { + "bbox": [ + 386, + 100, + 506, + 117 + ], + "score": 1.0, + "content": ". With some calculations, we", + "type": "text" + } + ], + "index": 1 + }, + { + "bbox": [ + 105, + 111, + 129, + 128 + ], + "spans": [ + { + "bbox": [ + 105, + 111, + 129, + 128 + ], + "score": 1.0, + "content": "have", + "type": "text" + } + ], + "index": 2 + } + ], + "index": 1.5, + "bbox_fs": [ + 105, + 100, + 506, + 128 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 119, + 127, + 470, + 199 + ], + "lines": [ + { + "bbox": [ + 119, + 127, + 470, + 199 + ], + "spans": [ + { + "bbox": [ + 119, + 127, + 470, + 199 + ], + "score": 0.95, + "content": "\\begin{array} { r } { \\displaystyle \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } = \\displaystyle \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left\\| \\widehat { \\boldsymbol { \\Sigma } } _ { a , k } ^ { - 1 } \\left( \\displaystyle \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right) \\right\\| _ { 2 } } \\\\ { \\leq \\displaystyle \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\widehat { \\boldsymbol { \\Sigma } } _ { a , k } ^ { - 1 } \\right\\| _ { 2 a \\in \\{ 0 , 1 \\} } \\displaystyle \\operatorname* { m a x } _ { k } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "f99d49c76ea24f57de770704be3f6da67df34d4a6c067d1dc2ff547e09d87889.jpg" + } + ] + } + ], + "index": 4, + "virtual_lines": [ + { + "bbox": [ + 119, + 127, + 470, + 151.0 + ], + "spans": [], + "index": 3 + }, + { + "bbox": [ + 119, + 151.0, + 470, + 175.0 + ], + "spans": [], + "index": 4 + }, + { + "bbox": [ + 119, + 175.0, + 470, + 199.0 + ], + "spans": [], + "index": 5 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 203, + 370, + 215 + ], + "lines": [ + { + "bbox": [ + 106, + 202, + 370, + 217 + ], + "spans": [ + { + "bbox": [ + 106, + 202, + 302, + 217 + ], + "score": 1.0, + "content": "By Lemma 6, we obtain with probability at least", + "type": "text" + }, + { + "bbox": [ + 302, + 202, + 351, + 216 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 351, + 202, + 370, + 217 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 6, + "bbox_fs": [ + 106, + 202, + 370, + 217 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 122, + 219, + 469, + 254 + ], + "lines": [ + { + "bbox": [ + 122, + 219, + 469, + 254 + ], + "spans": [ + { + "bbox": [ + 122, + 219, + 469, + 254 + ], + "score": 0.93, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } .", + "type": "interline_equation", + "image_path": "8e02308c99fdcb5824d3e79b41fea44dfc335ef10ff4c22e3e84cb6f54f98c20.jpg" + } + ] + } + ], + "index": 8, + "virtual_lines": [ + { + "bbox": [ + 122, + 219, + 469, + 230.66666666666666 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 122, + 230.66666666666666, + 469, + 242.33333333333331 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 122, + 242.33333333333331, + 469, + 253.99999999999997 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 258, + 367, + 271 + ], + "lines": [ + { + "bbox": [ + 106, + 258, + 367, + 272 + ], + "spans": [ + { + "bbox": [ + 106, + 258, + 299, + 272 + ], + "score": 1.0, + "content": "Similarly, we can show with probability at least", + "type": "text" + }, + { + "bbox": [ + 299, + 258, + 348, + 271 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 348, + 258, + 367, + 272 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 10 + } + ], + "index": 10, + "bbox_fs": [ + 106, + 258, + 367, + 272 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 141, + 275, + 448, + 310 + ], + "lines": [ + { + "bbox": [ + 141, + 275, + 448, + 310 + ], + "spans": [ + { + "bbox": [ + 141, + 275, + 448, + 310 + ], + "score": 0.91, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left\\| \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log j _ { n } } ,", + "type": "interline_equation", + "image_path": "c7495ade52eb7d5c794ef9d165dd659ff162e83a0d29075f2fe50e77b3ecae2a.jpg" + } + ] + } + ], + "index": 12, + "virtual_lines": [ + { + "bbox": [ + 141, + 275, + 448, + 286.6666666666667 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 141, + 286.6666666666667, + 448, + 298.33333333333337 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 141, + 298.33333333333337, + 448, + 310.00000000000006 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 334, + 235, + 345 + ], + "lines": [ + { + "bbox": [ + 106, + 333, + 236, + 347 + ], + "spans": [ + { + "bbox": [ + 106, + 333, + 236, + 347 + ], + "score": 1.0, + "content": "Similar to equation 42, we have", + "type": "text" + } + ], + "index": 14 + } + ], + "index": 14, + "bbox_fs": [ + 106, + 333, + 236, + 347 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 129, + 349, + 461, + 420 + ], + "lines": [ + { + "bbox": [ + 129, + 349, + 461, + 420 + ], + "spans": [ + { + "bbox": [ + 129, + 349, + 461, + 420 + ], + "score": 0.94, + "content": "\\begin{array} { r l r } & { } & { \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } ~ \\lambda _ { \\mathrm { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m i n } } ~ \\lambda _ { \\mathrm { m i n } } \\left( \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\frac { 1 } { k } \\underset { i = 1 } { \\overset { k } { \\sum } } \\pi _ { i - 1 } ( a , X ) \\right) } \\\\ & { } & { - \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } ~ \\frac { 1 } { k } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } . } \\end{array}", + "type": "interline_equation", + "image_path": "112658f5f18d71dff63814ee8aeac48fb40109561b305adca62497dac74cea42.jpg" + } + ] + } + ], + "index": 16, + "virtual_lines": [ + { + "bbox": [ + 129, + 349, + 461, + 372.6666666666667 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 129, + 372.6666666666667, + 461, + 396.33333333333337 + ], + "spans": [], + "index": 16 + }, + { + "bbox": [ + 129, + 396.33333333333337, + 461, + 420.00000000000006 + ], + "spans": [], + "index": 17 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 423, + 373, + 435 + ], + "lines": [ + { + "bbox": [ + 106, + 422, + 374, + 437 + ], + "spans": [ + { + "bbox": [ + 106, + 422, + 374, + 437 + ], + "score": 1.0, + "content": "Using similar arguments in proving equation 44, we can show that", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18, + "bbox_fs": [ + 106, + 422, + 374, + 437 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 438, + 479, + 474 + ], + "lines": [ + { + "bbox": [ + 111, + 438, + 479, + 474 + ], + "spans": [ + { + "bbox": [ + 111, + 438, + 479, + 474 + ], + "score": 0.9, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ { \\mathbb { I } } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log k } ,", + "type": "interline_equation", + "image_path": "8243d3944f2a103dde0cdd28b11c4f9bd983f4d5c87a4c5166ab7795bc02f78c.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 111, + 438, + 479, + 450.0 + ], + "spans": [], + "index": 19 + }, + { + "bbox": [ + 111, + 450.0, + 479, + 462.0 + ], + "spans": [], + "index": 20 + }, + { + "bbox": [ + 111, + 462.0, + 479, + 474.0 + ], + "spans": [], + "index": 21 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 490, + 352, + 504 + ], + "lines": [ + { + "bbox": [ + 106, + 490, + 352, + 506 + ], + "spans": [ + { + "bbox": [ + 106, + 490, + 203, + 506 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 491, + 252, + 504 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 253, + 490, + 352, + 506 + ], + "score": 1.0, + "content": ". Similarly, we can show", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 22, + "bbox_fs": [ + 106, + 490, + 352, + 506 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 109, + 507, + 480, + 543 + ], + "lines": [ + { + "bbox": [ + 109, + 507, + 480, + 543 + ], + "spans": [ + { + "bbox": [ + 109, + 507, + 480, + 543 + ], + "score": 0.86, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ { \\mathbb { I } } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log j _ { n } } ,", + "type": "interline_equation", + "image_path": "8f0e5115f02954dee91dfc36586b5fd172651251319fea0d46280c2833ebf7dc.jpg" + } + ] + } + ], + "index": 24, + "virtual_lines": [ + { + "bbox": [ + 109, + 507, + 480, + 519.0 + ], + "spans": [], + "index": 23 + }, + { + "bbox": [ + 109, + 519.0, + 480, + 531.0 + ], + "spans": [], + "index": 24 + }, + { + "bbox": [ + 109, + 531.0, + 480, + 543.0 + ], + "spans": [], + "index": 25 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 559, + 255, + 572 + ], + "lines": [ + { + "bbox": [ + 105, + 558, + 253, + 575 + ], + "spans": [ + { + "bbox": [ + 105, + 558, + 204, + 575 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 560, + 253, + 573 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + } + ], + "index": 26 + } + ], + "index": 26, + "bbox_fs": [ + 105, + 558, + 253, + 575 + ] + }, + { + "type": "text", + "bbox": [ + 105, + 576, + 504, + 600 + ], + "lines": [ + { + "bbox": [ + 105, + 575, + 505, + 591 + ], + "spans": [ + { + "bbox": [ + 105, + 575, + 249, + 591 + ], + "score": 1.0, + "content": "Without loss of generality, assume", + "type": "text" + }, + { + "bbox": [ + 250, + 577, + 290, + 589 + ], + "score": 0.91, + "content": "\\varepsilon _ { 0 } \\leq 1 / 2", + "type": "inline_equation" + }, + { + "bbox": [ + 291, + 575, + 381, + 591 + ], + "score": 1.0, + "content": ". Notice that we have", + "type": "text" + }, + { + "bbox": [ + 382, + 577, + 450, + 589 + ], + "score": 0.92, + "content": "\\pi _ { i - 1 } ( a , x ) \\geq \\varepsilon _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 450, + 575, + 487, + 591 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 487, + 578, + 505, + 588 + ], + "score": 0.82, + "content": "a \\in", + "type": "inline_equation" + } + ], + "index": 27 + }, + { + "bbox": [ + 107, + 587, + 417, + 600 + ], + "spans": [ + { + "bbox": [ + 107, + 588, + 162, + 600 + ], + "score": 0.25, + "content": "\\{ 0 , 1 \\} , x \\in \\mathbb { X }", + "type": "inline_equation" + }, + { + "bbox": [ + 163, + 587, + 180, + 600 + ], + "score": 1.0, + "content": "and", + "type": "text" + }, + { + "bbox": [ + 180, + 588, + 210, + 599 + ], + "score": 0.91, + "content": "i \\geq N _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 211, + 587, + 417, + 600 + ], + "score": 1.0, + "content": ". This together with Lemma equation 4 implies that", + "type": "text" + } + ], + "index": 28 + } + ], + "index": 27.5, + "bbox_fs": [ + 105, + 575, + 505, + 600 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 118, + 604, + 472, + 638 + ], + "lines": [ + { + "bbox": [ + 118, + 604, + 472, + 638 + ], + "spans": [ + { + "bbox": [ + 118, + 604, + 472, + 638 + ], + "score": 0.94, + "content": "\\operatorname* { i n f } _ { a \\in \\{ 0 , 1 \\} , n \\geq j _ { n } } \\lambda _ { \\operatorname* { m i n } } \\left( \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\frac { 1 } { n } \\sum _ { i = 1 } ^ { n } \\pi _ { i - 1 } ( a , X ) \\right) \\geq \\frac { n - N _ { 0 } } { n } \\varepsilon _ { 0 } \\geq \\frac { j - N _ { 0 } } { j } \\varepsilon _ { 0 } .", + "type": "interline_equation", + "image_path": "8583626ddc7a477a67a134fba07ab17a194e0c368d18cfe5ee3160f6e996dfa1.jpg" + } + ] + } + ], + "index": 30, + "virtual_lines": [ + { + "bbox": [ + 118, + 604, + 472, + 615.3333333333334 + ], + "spans": [], + "index": 29 + }, + { + "bbox": [ + 118, + 615.3333333333334, + 472, + 626.6666666666667 + ], + "spans": [], + "index": 30 + }, + { + "bbox": [ + 118, + 626.6666666666667, + 472, + 638.0000000000001 + ], + "spans": [], + "index": 31 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 641, + 368, + 653 + ], + "lines": [ + { + "bbox": [ + 106, + 640, + 368, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 640, + 368, + 655 + ], + "score": 1.0, + "content": "Combining this together with equation 60 and equation 61 yields", + "type": "text" + } + ], + "index": 32 + } + ], + "index": 32, + "bbox_fs": [ + 106, + 640, + 368, + 655 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 199, + 656, + 390, + 680 + ], + "lines": [ + { + "bbox": [ + 199, + 656, + 390, + 680 + ], + "spans": [ + { + "bbox": [ + 199, + 656, + 390, + 680 + ], + "score": 0.92, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\frac { \\varepsilon _ { 0 } } { 2 } , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } ,", + "type": "interline_equation", + "image_path": "85070b0f79dc8a2678bd4332fdfcf8fcc1b4282538fe6ebac2a7baa9794971d8.jpg" + } + ] + } + ], + "index": 33, + "virtual_lines": [ + { + "bbox": [ + 199, + 656, + 390, + 680 + ], + "spans": [], + "index": 33 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 685, + 505, + 709 + ], + "lines": [ + { + "bbox": [ + 105, + 684, + 506, + 700 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 180, + 700 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 686, + 210, + 697 + ], + "score": 0.91, + "content": "L ^ { * } \\geq 1", + "type": "inline_equation" + }, + { + "bbox": [ + 210, + 684, + 311, + 700 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 311, + 686, + 359, + 698 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 360, + 684, + 506, + 700 + ], + "score": 1.0, + "content": ". This together with equation 58 and", + "type": "text" + } + ], + "index": 34 + }, + { + "bbox": [ + 105, + 696, + 201, + 710 + ], + "spans": [ + { + "bbox": [ + 105, + 696, + 201, + 710 + ], + "score": 1.0, + "content": "equation 59 yields that", + "type": "text" + } + ], + "index": 35 + } + ], + "index": 34.5, + "bbox_fs": [ + 105, + 684, + 506, + 710 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 144, + 712, + 445, + 735 + ], + "lines": [ + { + "bbox": [ + 144, + 712, + 445, + 735 + ], + "spans": [ + { + "bbox": [ + 144, + 712, + 445, + 735 + ], + "score": 0.88, + "content": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) } , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } ,", + "type": "interline_equation", + "image_path": "32eae6a2cd006bc94c93939067fb95113a411988e498c1f8593cf8d26868d21a.jpg" + } + ] + } + ], + "index": 36, + "virtual_lines": [ + { + "bbox": [ + 144, + 712, + 445, + 735 + ], + "spans": [], + "index": 36 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 107, + 82, + 255, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 252, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 203, + 97 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 82, + 252, + 95 + ], + "score": 0.94, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "text", + "bbox": [ + 106, + 99, + 221, + 111 + ], + "lines": [ + { + "bbox": [ + 106, + 98, + 222, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 98, + 222, + 113 + ], + "score": 1.0, + "content": "By Condition (A3), we have", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1 + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 115, + 470, + 131 + ], + "lines": [ + { + "bbox": [ + 120, + 115, + 470, + 131 + ], + "spans": [ + { + "bbox": [ + 120, + 115, + 470, + 131 + ], + "score": 0.89, + "content": "\\begin{array} { r } { | \\varphi ^ { \\mathsf { T } } ( X ) ( \\widehat { \\beta } _ { 1 , k } - \\widehat { \\beta } _ { 0 , k } - \\beta _ { 1 } + \\beta _ { 0 } ) | \\leq \\bar { L } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } , } \\end{array}", + "type": "interline_equation", + "image_path": "ddb1d90e27280361dbab6ce36fd255d2d4f0e6ead7bf20cb281fd61fc751f619.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 120, + 115, + 470, + 131 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 136, + 360, + 149 + ], + "lines": [ + { + "bbox": [ + 104, + 133, + 360, + 151 + ], + "spans": [ + { + "bbox": [ + 104, + 133, + 180, + 151 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 136, + 206, + 147 + ], + "score": 0.91, + "content": "\\bar { L } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 133, + 307, + 151 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 307, + 136, + 356, + 149 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 133, + 360, + 151 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3 + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 503, + 190 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 139, + 167 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 140, + 154, + 183, + 165 + ], + "score": 0.92, + "content": "z _ { 1 } , z _ { 2 } \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 153, + 223, + 167 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 223, + 153, + 317, + 166 + ], + "score": 0.92, + "content": "\\mathbb { I } ( z _ { 1 } > 0 ) \\neq \\mathbb { I } ( z _ { 2 } > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 153, + 363, + 167 + ], + "score": 1.0, + "content": "only when", + "type": "text" + }, + { + "bbox": [ + 364, + 154, + 429, + 166 + ], + "score": 0.92, + "content": "| z _ { 1 } - z _ { 2 } | \\geq | z _ { 2 } |", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 153, + 505, + 167 + ], + "score": 1.0, + "content": ". Hence, under the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 165, + 504, + 181 + ], + "spans": [ + { + "bbox": [ + 104, + 165, + 265, + 181 + ], + "score": 1.0, + "content": "event defined in equation 62, the event", + "type": "text" + }, + { + "bbox": [ + 265, + 166, + 504, + 180 + ], + "score": 0.84, + "content": "\\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\widehat { \\beta } _ { 1 , k } - \\widehat { \\beta } _ { 0 , k } ) > 0 \\} \\neq \\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) > 0 \\}", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 178, + 180, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 180, + 190 + ], + "score": 1.0, + "content": "occurs only when", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5 + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 193, + 469, + 210 + ], + "lines": [ + { + "bbox": [ + 120, + 193, + 469, + 210 + ], + "spans": [ + { + "bbox": [ + 120, + 193, + 469, + 210 + ], + "score": 0.9, + "content": "\\begin{array} { r } { | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) | \\le | \\varphi ^ { \\top } ( X ) ( \\widehat \\beta _ { 1 , k } - \\widehat \\beta _ { 0 , k } - \\beta _ { 1 } + \\beta _ { 0 } ) | \\le \\bar { L } q k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) } , } \\end{array}", + "type": "interline_equation", + "image_path": "241af2b941e8433242d3376619be37c7a81a0e63dd6597742ecf5c6a1ef35b97.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 120, + 193, + 469, + 210 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 214, + 320, + 226 + ], + "lines": [ + { + "bbox": [ + 106, + 213, + 320, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 137, + 227 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 137, + 214, + 167, + 226 + ], + "score": 0.91, + "content": "k \\geq j _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 213, + 320, + 227 + ], + "score": 1.0, + "content": ". Under the given conditions, we have", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8 + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 229, + 478, + 252 + ], + "lines": [ + { + "bbox": [ + 114, + 229, + 478, + 252 + ], + "spans": [ + { + "bbox": [ + 114, + 229, + 478, + 252 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname* { P r } \\Big ( | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) | \\leq \\bar { L } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) \\Big ) \\leq \\bar { L } L _ { 0 } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "64facdf10834de275f42513b2ddc9f6855f03f3bc3fac35d07fd7b06ee94e6c9.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 114, + 229, + 478, + 252 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 255, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 255, + 506, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 185, + 271 + ], + "score": 1.0, + "content": "Notice that when", + "type": "text" + }, + { + "bbox": [ + 186, + 256, + 459, + 270 + ], + "score": 0.89, + "content": "\\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\widehat { \\beta } _ { 1 , k } \\ - \\ \\widehat { \\beta } _ { 0 , k } ) \\ > \\ \\ 0 \\} = \\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } \\ - \\ \\beta _ { 0 } ) \\ > \\ \\ 0 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 255, + 506, + 271 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 269, + 504, + 284 + ], + "spans": [ + { + "bbox": [ + 107, + 270, + 205, + 282 + ], + "score": 0.88, + "content": "\\pi _ { k } ( a , X ) = \\pi ^ { * } ( a , X ) ", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 269, + 293, + 284 + ], + "score": 1.0, + "content": ". Thus, we obtain", + "type": "text" + }, + { + "bbox": [ + 293, + 271, + 392, + 282 + ], + "score": 0.89, + "content": "\\pi _ { k } ( a , X ) ~ = ~ \\pi ^ { * } ( a , X )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 269, + 407, + 284 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 407, + 270, + 504, + 282 + ], + "score": 0.88, + "content": "\\begin{array} { r l } { \\vert \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\vert } & { { } > } \\end{array}", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 107, + 280, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 107, + 282, + 214, + 296 + ], + "score": 0.89, + "content": "\\bar { L } q k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 280, + 252, + 297 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 253, + 283, + 327, + 295 + ], + "score": 0.92, + "content": "k \\geq L ^ { * } { \\sqrt { q \\log j _ { n } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 280, + 352, + 297 + ], + "score": 1.0, + "content": ". Set", + "type": "text" + }, + { + "bbox": [ + 352, + 283, + 431, + 295 + ], + "score": 0.91, + "content": "k _ { 0 } = L ^ { * } { \\sqrt { q \\log j _ { n } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 280, + 506, + 297 + ], + "score": 1.0, + "content": ". By equation 62", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 294, + 376, + 308 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 307, + 308 + ], + "score": 1.0, + "content": "and equation 63, we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 308, + 295, + 356, + 308 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 294, + 376, + 308 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5 + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 314, + 513, + 497 + ], + "lines": [ + { + "bbox": [ + 114, + 314, + 513, + 497 + ], + "spans": [ + { + "bbox": [ + 114, + 314, + 513, + 497 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { { \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { i = 1 } ^ { K } \\Big \\{ \\underset { i = 1 } { \\overset { K } { \\sum } } \\{ \\alpha _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\} \\Big \\} \\Bigg \\{ \\underset { \\alpha \\in \\{ 0 , 1 \\} } { \\sum } \\sum _ { i = 1 } ^ { K } \\sum _ { i = 1 } ^ { K } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert } } \\\\ { + \\ } & { \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { i = K + 1 } ^ { K } \\sum _ { i = 1 } ^ { K } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\leq 2 L ^ { * } \\sqrt { \\| \\Phi \\| _ { 2 } } } \\\\ { + \\ } & { \\mathrm { a s t ~ } \\big \\{ \\underset { i = 1 } { \\overset { K } { \\sum } } \\big \\} \\sum _ { i = 1 } ^ { K } \\mathbb { E } ^ { I _ { i - 1 } } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\rvert > L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\} } \\\\ { + \\ } & { \\underset { \\mathrm { a s t ~ } \\{ 0 , 1 \\} + \\kappa = + 1 } { \\overset { K } { \\sum } } \\mathbb { E } ^ { I _ { i } } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\rvert \\leq L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\} } \\\\ { + \\ } & \\underset { \\mathrm { a s t ~ } \\{ 0 , 1 \\} + \\kappa = + 1 } { \\overset { K } { \\sum } } \\mathbb { E } ^ { I _ { i } } \\cdot \\big \\| \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\| \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\| \\leq L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\end{array}", + "type": "interline_equation", + "image_path": "a467558b115027eac90b8bfd57ea2595bbf517c18d0cc91e2f5c782ce7abefa8.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 114, + 314, + 513, + 375.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 114, + 375.0, + 513, + 436.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 114, + 436.0, + 513, + 497.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 500, + 229, + 512 + ], + "lines": [ + { + "bbox": [ + 106, + 499, + 229, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 229, + 514 + ], + "score": 1.0, + "content": "The proof is hence completed.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17 + }, + { + "type": "title", + "bbox": [ + 108, + 527, + 290, + 540 + ], + "lines": [ + { + "bbox": [ + 105, + 527, + 291, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 291, + 541 + ], + "score": 1.0, + "content": "F COMPARISON OF THE BASELINE", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 552, + 412, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 550, + 412, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 210, + 567 + ], + "score": 1.0, + "content": "Consider our test statistic", + "type": "text" + }, + { + "bbox": [ + 210, + 552, + 229, + 565 + ], + "score": 0.92, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 550, + 261, + 567 + ], + "score": 1.0, + "content": ". Under", + "type": "text" + }, + { + "bbox": [ + 261, + 553, + 275, + 564 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 550, + 412, + 567 + ], + "score": 1.0, + "content": ", it can be bounded from above by", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19 + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 568, + 376, + 592 + ], + "lines": [ + { + "bbox": [ + 214, + 568, + 376, + 592 + ], + "spans": [ + { + "bbox": [ + 214, + 568, + 376, + 592 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ { \\widehat { \\beta } } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - { \\widehat { \\beta } } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} .", + "type": "interline_equation", + "image_path": "4e4f08c3e1765f2867133075a8f17d560b165aebd99f647fa2b66a4d309ebc48.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 214, + 568, + 376, + 592 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 595, + 504, + 618 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 610 + ], + "score": 1.0, + "content": "It suffices to provide an upper bound for the above expression. By Cauchy-Schwarz inequality,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 607, + 259, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 259, + 620 + ], + "score": 1.0, + "content": "equation 64 can be upper bounded by", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5 + }, + { + "type": "interline_equation", + "bbox": [ + 209, + 622, + 381, + 646 + ], + "lines": [ + { + "bbox": [ + 209, + 622, + 381, + 646 + ], + "spans": [ + { + "bbox": [ + 209, + 622, + 381, + 646 + ], + "score": 0.92, + "content": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } \\| { \\widehat { \\beta } } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - { \\widehat { \\beta } } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\| _ { 2 } .", + "type": "interline_equation", + "image_path": "bcfb5c2f16ca4d4b73ee4a5fa8da9e9ee6f1ba036d8fb061746f168c789d29e6.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 209, + 622, + 381, + 646 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 650, + 412, + 666 + ], + "lines": [ + { + "bbox": [ + 104, + 649, + 414, + 668 + ], + "spans": [ + { + "bbox": [ + 104, + 649, + 292, + 668 + ], + "score": 1.0, + "content": "It suffices to provide anytime upper bound for", + "type": "text" + }, + { + "bbox": [ + 292, + 650, + 408, + 665 + ], + "score": 0.9, + "content": "\\| \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) - \\beta _ { 0 } ^ { * } \\| _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 649, + 414, + 668 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24 + }, + { + "type": "text", + "bbox": [ + 106, + 669, + 152, + 681 + ], + "lines": [ + { + "bbox": [ + 106, + 669, + 153, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 153, + 681 + ], + "score": 1.0, + "content": "Recall that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25 + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 682, + 514, + 736 + ], + "lines": [ + { + "bbox": [ + 113, + 682, + 514, + 736 + ], + "spans": [ + { + "bbox": [ + 113, + 682, + 514, + 736 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } } \\\\ { = } & { \\frac { 1 } { N ( t ) } \\displaystyle \\sum _ { i = 1 } ^ { N ( t ) } [ \\mathbb { I } ( A _ { i } = 1 ) \\widehat { \\Sigma } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } ^ { * } \\} - \\mathbb { I } ( A _ { i } = 0 ) \\widehat { \\Sigma } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\} ] } \\end{array}", + "type": "interline_equation", + "image_path": "320f0e25225397b8780814639c9dbf20b2aa71664c0d627b8c71741d221ac190.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 113, + 682, + 514, + 700.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 113, + 700.0, + 514, + 718.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 113, + 718.0, + 514, + 736.0 + ], + "spans": [], + "index": 28 + } + ] + } + ], + "page_idx": 31, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 38 + ], + "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, + 311, + 761 + ], + "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": [ + 107, + 82, + 255, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 252, + 97 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 203, + 97 + ], + "score": 1.0, + "content": "with probability at least", + "type": "text" + }, + { + "bbox": [ + 204, + 82, + 252, + 95 + ], + "score": 0.94, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 81, + 252, + 97 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 99, + 221, + 111 + ], + "lines": [ + { + "bbox": [ + 106, + 98, + 222, + 113 + ], + "spans": [ + { + "bbox": [ + 106, + 98, + 222, + 113 + ], + "score": 1.0, + "content": "By Condition (A3), we have", + "type": "text" + } + ], + "index": 1 + } + ], + "index": 1, + "bbox_fs": [ + 106, + 98, + 222, + 113 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 115, + 470, + 131 + ], + "lines": [ + { + "bbox": [ + 120, + 115, + 470, + 131 + ], + "spans": [ + { + "bbox": [ + 120, + 115, + 470, + 131 + ], + "score": 0.89, + "content": "\\begin{array} { r } { | \\varphi ^ { \\mathsf { T } } ( X ) ( \\widehat { \\beta } _ { 1 , k } - \\widehat { \\beta } _ { 0 , k } - \\beta _ { 1 } + \\beta _ { 0 } ) | \\leq \\bar { L } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } , } \\end{array}", + "type": "interline_equation", + "image_path": "ddb1d90e27280361dbab6ce36fd255d2d4f0e6ead7bf20cb281fd61fc751f619.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 120, + 115, + 470, + 131 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 136, + 360, + 149 + ], + "lines": [ + { + "bbox": [ + 104, + 133, + 360, + 151 + ], + "spans": [ + { + "bbox": [ + 104, + 133, + 180, + 151 + ], + "score": 1.0, + "content": "for some constant", + "type": "text" + }, + { + "bbox": [ + 180, + 136, + 206, + 147 + ], + "score": 0.91, + "content": "\\bar { L } > 0", + "type": "inline_equation" + }, + { + "bbox": [ + 207, + 133, + 307, + 151 + ], + "score": 1.0, + "content": ", with probability at least", + "type": "text" + }, + { + "bbox": [ + 307, + 136, + 356, + 149 + ], + "score": 0.93, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 133, + 360, + 151 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 3 + } + ], + "index": 3, + "bbox_fs": [ + 104, + 133, + 360, + 151 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 153, + 503, + 190 + ], + "lines": [ + { + "bbox": [ + 105, + 153, + 505, + 167 + ], + "spans": [ + { + "bbox": [ + 105, + 153, + 139, + 167 + ], + "score": 1.0, + "content": "For any", + "type": "text" + }, + { + "bbox": [ + 140, + 154, + 183, + 165 + ], + "score": 0.92, + "content": "z _ { 1 } , z _ { 2 } \\in \\mathbb { R }", + "type": "inline_equation" + }, + { + "bbox": [ + 184, + 153, + 223, + 167 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + }, + { + "bbox": [ + 223, + 153, + 317, + 166 + ], + "score": 0.92, + "content": "\\mathbb { I } ( z _ { 1 } > 0 ) \\neq \\mathbb { I } ( z _ { 2 } > 0 )", + "type": "inline_equation" + }, + { + "bbox": [ + 317, + 153, + 363, + 167 + ], + "score": 1.0, + "content": "only when", + "type": "text" + }, + { + "bbox": [ + 364, + 154, + 429, + 166 + ], + "score": 0.92, + "content": "| z _ { 1 } - z _ { 2 } | \\geq | z _ { 2 } |", + "type": "inline_equation" + }, + { + "bbox": [ + 430, + 153, + 505, + 167 + ], + "score": 1.0, + "content": ". Hence, under the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 165, + 504, + 181 + ], + "spans": [ + { + "bbox": [ + 104, + 165, + 265, + 181 + ], + "score": 1.0, + "content": "event defined in equation 62, the event", + "type": "text" + }, + { + "bbox": [ + 265, + 166, + 504, + 180 + ], + "score": 0.84, + "content": "\\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\widehat { \\beta } _ { 1 , k } - \\widehat { \\beta } _ { 0 , k } ) > 0 \\} \\neq \\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) > 0 \\}", + "type": "inline_equation" + } + ], + "index": 5 + }, + { + "bbox": [ + 105, + 178, + 180, + 190 + ], + "spans": [ + { + "bbox": [ + 105, + 178, + 180, + 190 + ], + "score": 1.0, + "content": "occurs only when", + "type": "text" + } + ], + "index": 6 + } + ], + "index": 5, + "bbox_fs": [ + 104, + 153, + 505, + 190 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 120, + 193, + 469, + 210 + ], + "lines": [ + { + "bbox": [ + 120, + 193, + 469, + 210 + ], + "spans": [ + { + "bbox": [ + 120, + 193, + 469, + 210 + ], + "score": 0.9, + "content": "\\begin{array} { r } { | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) | \\le | \\varphi ^ { \\top } ( X ) ( \\widehat \\beta _ { 1 , k } - \\widehat \\beta _ { 0 , k } - \\beta _ { 1 } + \\beta _ { 0 } ) | \\le \\bar { L } q k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) } , } \\end{array}", + "type": "interline_equation", + "image_path": "241af2b941e8433242d3376619be37c7a81a0e63dd6597742ecf5c6a1ef35b97.jpg" + } + ] + } + ], + "index": 7, + "virtual_lines": [ + { + "bbox": [ + 120, + 193, + 469, + 210 + ], + "spans": [], + "index": 7 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 214, + 320, + 226 + ], + "lines": [ + { + "bbox": [ + 106, + 213, + 320, + 227 + ], + "spans": [ + { + "bbox": [ + 106, + 213, + 137, + 227 + ], + "score": 1.0, + "content": "for any", + "type": "text" + }, + { + "bbox": [ + 137, + 214, + 167, + 226 + ], + "score": 0.91, + "content": "k \\geq j _ { n }", + "type": "inline_equation" + }, + { + "bbox": [ + 167, + 213, + 320, + 227 + ], + "score": 1.0, + "content": ". Under the given conditions, we have", + "type": "text" + } + ], + "index": 8 + } + ], + "index": 8, + "bbox_fs": [ + 106, + 213, + 320, + 227 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 229, + 478, + 252 + ], + "lines": [ + { + "bbox": [ + 114, + 229, + 478, + 252 + ], + "spans": [ + { + "bbox": [ + 114, + 229, + 478, + 252 + ], + "score": 0.91, + "content": "\\begin{array} { r } { \\operatorname* { P r } \\Big ( | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) | \\leq \\bar { L } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) \\Big ) \\leq \\bar { L } L _ { 0 } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) . } \\end{array}", + "type": "interline_equation", + "image_path": "64facdf10834de275f42513b2ddc9f6855f03f3bc3fac35d07fd7b06ee94e6c9.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 114, + 229, + 478, + 252 + ], + "spans": [], + "index": 9 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 255, + 505, + 308 + ], + "lines": [ + { + "bbox": [ + 105, + 255, + 506, + 271 + ], + "spans": [ + { + "bbox": [ + 105, + 255, + 185, + 271 + ], + "score": 1.0, + "content": "Notice that when", + "type": "text" + }, + { + "bbox": [ + 186, + 256, + 459, + 270 + ], + "score": 0.89, + "content": "\\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\widehat { \\beta } _ { 1 , k } \\ - \\ \\widehat { \\beta } _ { 0 , k } ) \\ > \\ \\ 0 \\} = \\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } \\ - \\ \\beta _ { 0 } ) \\ > \\ \\ 0 \\}", + "type": "inline_equation" + }, + { + "bbox": [ + 459, + 255, + 506, + 271 + ], + "score": 1.0, + "content": ", we have", + "type": "text" + } + ], + "index": 10 + }, + { + "bbox": [ + 107, + 269, + 504, + 284 + ], + "spans": [ + { + "bbox": [ + 107, + 270, + 205, + 282 + ], + "score": 0.88, + "content": "\\pi _ { k } ( a , X ) = \\pi ^ { * } ( a , X ) ", + "type": "inline_equation" + }, + { + "bbox": [ + 205, + 269, + 293, + 284 + ], + "score": 1.0, + "content": ". Thus, we obtain", + "type": "text" + }, + { + "bbox": [ + 293, + 271, + 392, + 282 + ], + "score": 0.89, + "content": "\\pi _ { k } ( a , X ) ~ = ~ \\pi ^ { * } ( a , X )", + "type": "inline_equation" + }, + { + "bbox": [ + 393, + 269, + 407, + 284 + ], + "score": 1.0, + "content": "if", + "type": "text" + }, + { + "bbox": [ + 407, + 270, + 504, + 282 + ], + "score": 0.88, + "content": "\\begin{array} { r l } { \\vert \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\vert } & { { } > } \\end{array}", + "type": "inline_equation" + } + ], + "index": 11 + }, + { + "bbox": [ + 107, + 280, + 506, + 297 + ], + "spans": [ + { + "bbox": [ + 107, + 282, + 214, + 296 + ], + "score": 0.89, + "content": "\\bar { L } q k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) }", + "type": "inline_equation" + }, + { + "bbox": [ + 214, + 280, + 252, + 297 + ], + "score": 1.0, + "content": ", for any", + "type": "text" + }, + { + "bbox": [ + 253, + 283, + 327, + 295 + ], + "score": 0.92, + "content": "k \\geq L ^ { * } { \\sqrt { q \\log j _ { n } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 327, + 280, + 352, + 297 + ], + "score": 1.0, + "content": ". Set", + "type": "text" + }, + { + "bbox": [ + 352, + 283, + 431, + 295 + ], + "score": 0.91, + "content": "k _ { 0 } = L ^ { * } { \\sqrt { q \\log j _ { n } } }", + "type": "inline_equation" + }, + { + "bbox": [ + 431, + 280, + 506, + 297 + ], + "score": 1.0, + "content": ". By equation 62", + "type": "text" + } + ], + "index": 12 + }, + { + "bbox": [ + 106, + 294, + 376, + 308 + ], + "spans": [ + { + "bbox": [ + 106, + 294, + 307, + 308 + ], + "score": 1.0, + "content": "and equation 63, we have with probability at least", + "type": "text" + }, + { + "bbox": [ + 308, + 295, + 356, + 308 + ], + "score": 0.92, + "content": "1 - O ( j _ { n } ^ { - 1 } )", + "type": "inline_equation" + }, + { + "bbox": [ + 356, + 294, + 376, + 308 + ], + "score": 1.0, + "content": "that", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 11.5, + "bbox_fs": [ + 105, + 255, + 506, + 308 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 114, + 314, + 513, + 497 + ], + "lines": [ + { + "bbox": [ + 114, + 314, + 513, + 497 + ], + "spans": [ + { + "bbox": [ + 114, + 314, + 513, + 497 + ], + "score": 0.93, + "content": "\\begin{array} { r l } { { \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { i = 1 } ^ { K } \\Big \\{ \\underset { i = 1 } { \\overset { K } { \\sum } } \\{ \\alpha _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\} \\Big \\} \\Bigg \\{ \\underset { \\alpha \\in \\{ 0 , 1 \\} } { \\sum } \\sum _ { i = 1 } ^ { K } \\sum _ { i = 1 } ^ { K } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert } } \\\\ { + \\ } & { \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { i = K + 1 } ^ { K } \\sum _ { i = 1 } ^ { K } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\leq 2 L ^ { * } \\sqrt { \\| \\Phi \\| _ { 2 } } } \\\\ { + \\ } & { \\mathrm { a s t ~ } \\big \\{ \\underset { i = 1 } { \\overset { K } { \\sum } } \\big \\} \\sum _ { i = 1 } ^ { K } \\mathbb { E } ^ { I _ { i - 1 } } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\rvert > L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\} } \\\\ { + \\ } & { \\underset { \\mathrm { a s t ~ } \\{ 0 , 1 \\} + \\kappa = + 1 } { \\overset { K } { \\sum } } \\mathbb { E } ^ { I _ { i } } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\rvert \\leq L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\} } \\\\ { + \\ } & \\underset { \\mathrm { a s t ~ } \\{ 0 , 1 \\} + \\kappa = + 1 } { \\overset { K } { \\sum } } \\mathbb { E } ^ { I _ { i } } \\cdot \\big \\| \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\| \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\| \\leq L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\end{array}", + "type": "interline_equation", + "image_path": "a467558b115027eac90b8bfd57ea2595bbf517c18d0cc91e2f5c782ce7abefa8.jpg" + } + ] + } + ], + "index": 15, + "virtual_lines": [ + { + "bbox": [ + 114, + 314, + 513, + 375.0 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 114, + 375.0, + 513, + 436.0 + ], + "spans": [], + "index": 15 + }, + { + "bbox": [ + 114, + 436.0, + 513, + 497.0 + ], + "spans": [], + "index": 16 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 500, + 229, + 512 + ], + "lines": [ + { + "bbox": [ + 106, + 499, + 229, + 514 + ], + "spans": [ + { + "bbox": [ + 106, + 499, + 229, + 514 + ], + "score": 1.0, + "content": "The proof is hence completed.", + "type": "text" + } + ], + "index": 17 + } + ], + "index": 17, + "bbox_fs": [ + 106, + 499, + 229, + 514 + ] + }, + { + "type": "title", + "bbox": [ + 108, + 527, + 290, + 540 + ], + "lines": [ + { + "bbox": [ + 105, + 527, + 291, + 541 + ], + "spans": [ + { + "bbox": [ + 105, + 527, + 291, + 541 + ], + "score": 1.0, + "content": "F COMPARISON OF THE BASELINE", + "type": "text" + } + ], + "index": 18 + } + ], + "index": 18 + }, + { + "type": "text", + "bbox": [ + 107, + 552, + 412, + 564 + ], + "lines": [ + { + "bbox": [ + 105, + 550, + 412, + 567 + ], + "spans": [ + { + "bbox": [ + 105, + 550, + 210, + 567 + ], + "score": 1.0, + "content": "Consider our test statistic", + "type": "text" + }, + { + "bbox": [ + 210, + 552, + 229, + 565 + ], + "score": 0.92, + "content": "S ( t )", + "type": "inline_equation" + }, + { + "bbox": [ + 229, + 550, + 261, + 567 + ], + "score": 1.0, + "content": ". Under", + "type": "text" + }, + { + "bbox": [ + 261, + 553, + 275, + 564 + ], + "score": 0.89, + "content": "H _ { 0 }", + "type": "inline_equation" + }, + { + "bbox": [ + 275, + 550, + 412, + 567 + ], + "score": 1.0, + "content": ", it can be bounded from above by", + "type": "text" + } + ], + "index": 19 + } + ], + "index": 19, + "bbox_fs": [ + 105, + 550, + 412, + 567 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 214, + 568, + 376, + 592 + ], + "lines": [ + { + "bbox": [ + 214, + 568, + 376, + 592 + ], + "spans": [ + { + "bbox": [ + 214, + 568, + 376, + 592 + ], + "score": 0.93, + "content": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ { \\widehat { \\beta } } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - { \\widehat { \\beta } } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} .", + "type": "interline_equation", + "image_path": "4e4f08c3e1765f2867133075a8f17d560b165aebd99f647fa2b66a4d309ebc48.jpg" + } + ] + } + ], + "index": 20, + "virtual_lines": [ + { + "bbox": [ + 214, + 568, + 376, + 592 + ], + "spans": [], + "index": 20 + } + ] + }, + { + "type": "text", + "bbox": [ + 105, + 595, + 504, + 618 + ], + "lines": [ + { + "bbox": [ + 105, + 594, + 505, + 610 + ], + "spans": [ + { + "bbox": [ + 105, + 594, + 505, + 610 + ], + "score": 1.0, + "content": "It suffices to provide an upper bound for the above expression. By Cauchy-Schwarz inequality,", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 106, + 607, + 259, + 620 + ], + "spans": [ + { + "bbox": [ + 106, + 607, + 259, + 620 + ], + "score": 1.0, + "content": "equation 64 can be upper bounded by", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21.5, + "bbox_fs": [ + 105, + 594, + 505, + 620 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 209, + 622, + 381, + 646 + ], + "lines": [ + { + "bbox": [ + 209, + 622, + 381, + 646 + ], + "spans": [ + { + "bbox": [ + 209, + 622, + 381, + 646 + ], + "score": 0.92, + "content": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } \\| { \\widehat { \\beta } } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - { \\widehat { \\beta } } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\| _ { 2 } .", + "type": "interline_equation", + "image_path": "bcfb5c2f16ca4d4b73ee4a5fa8da9e9ee6f1ba036d8fb061746f168c789d29e6.jpg" + } + ] + } + ], + "index": 23, + "virtual_lines": [ + { + "bbox": [ + 209, + 622, + 381, + 646 + ], + "spans": [], + "index": 23 + } + ] + }, + { + "type": "text", + "bbox": [ + 108, + 650, + 412, + 666 + ], + "lines": [ + { + "bbox": [ + 104, + 649, + 414, + 668 + ], + "spans": [ + { + "bbox": [ + 104, + 649, + 292, + 668 + ], + "score": 1.0, + "content": "It suffices to provide anytime upper bound for", + "type": "text" + }, + { + "bbox": [ + 292, + 650, + 408, + 665 + ], + "score": 0.9, + "content": "\\| \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) - \\beta _ { 0 } ^ { * } \\| _ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 408, + 649, + 414, + 668 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 24 + } + ], + "index": 24, + "bbox_fs": [ + 104, + 649, + 414, + 668 + ] + }, + { + "type": "text", + "bbox": [ + 106, + 669, + 152, + 681 + ], + "lines": [ + { + "bbox": [ + 106, + 669, + 153, + 681 + ], + "spans": [ + { + "bbox": [ + 106, + 669, + 153, + 681 + ], + "score": 1.0, + "content": "Recall that", + "type": "text" + } + ], + "index": 25 + } + ], + "index": 25, + "bbox_fs": [ + 106, + 669, + 153, + 681 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 113, + 682, + 514, + 736 + ], + "lines": [ + { + "bbox": [ + 113, + 682, + 514, + 736 + ], + "spans": [ + { + "bbox": [ + 113, + 682, + 514, + 736 + ], + "score": 0.93, + "content": "\\begin{array} { r l } & { \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } } \\\\ { = } & { \\frac { 1 } { N ( t ) } \\displaystyle \\sum _ { i = 1 } ^ { N ( t ) } [ \\mathbb { I } ( A _ { i } = 1 ) \\widehat { \\Sigma } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } ^ { * } \\} - \\mathbb { I } ( A _ { i } = 0 ) \\widehat { \\Sigma } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\} ] } \\end{array}", + "type": "interline_equation", + "image_path": "320f0e25225397b8780814639c9dbf20b2aa71664c0d627b8c71741d221ac190.jpg" + } + ] + } + ], + "index": 27, + "virtual_lines": [ + { + "bbox": [ + 113, + 682, + 514, + 700.0 + ], + "spans": [], + "index": 26 + }, + { + "bbox": [ + 113, + 700.0, + 514, + 718.0 + ], + "spans": [], + "index": 27 + }, + { + "bbox": [ + 113, + 718.0, + 514, + 736.0 + ], + "spans": [], + "index": 28 + } + ] + } + ] + }, + { + "preproc_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 320, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 320, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 320, + 96 + ], + "score": 1.0, + "content": "The above expression is asymptotically equivalent to", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0 + }, + { + "type": "interline_equation", + "bbox": [ + 105, + 99, + 488, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 488, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 488, + 135 + ], + "score": 0.91, + "content": "\\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } [ \\mathbb { I } ( A _ { i } = 1 ) \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } ^ { * } \\} - \\mathbb { I } ( A _ { i } = 0 ) \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } ^ { * } \\} ] .", + "type": "interline_equation", + "image_path": "7be9828d8f1930eb8d95936fbb1a58b809648e88b97a4597dc0c45697b8f013e.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 105, + 99, + 488, + 111.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 105, + 111.0, + 488, + 123.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 105, + 123.0, + 488, + 135.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 139, + 505, + 163 + ], + "lines": [ + { + "bbox": [ + 105, + 138, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 254, + 153 + ], + "score": 1.0, + "content": "By the law of iterated logarithm, the", + "type": "text" + }, + { + "bbox": [ + 255, + 140, + 260, + 149 + ], + "score": 0.71, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 138, + 506, + 153 + ], + "score": 1.0, + "content": "-th dimension of the above expression can be upper bounded", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 150, + 120, + 165 + ], + "spans": [ + { + "bbox": [ + 104, + 150, + 120, + 165 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5 + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 168, + 360, + 189 + ], + "lines": [ + { + "bbox": [ + 231, + 168, + 360, + 189 + ], + "spans": [ + { + "bbox": [ + 231, + 168, + 360, + 189 + ], + "score": 0.92, + "content": "N ^ { - 1 / 2 } ( t ) \\sqrt { 2 \\sigma _ { \\ell } ^ { 2 } \\log \\log \\{ N ( t ) \\} } ,", + "type": "interline_equation", + "image_path": "4f345e4d113717d4323a9b5eb14c21ed44fc574d0ab1281aaa4620a0248705c1.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 231, + 168, + 360, + 189 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 294, + 208 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 294, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 133, + 210 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 195, + 161, + 208 + ], + "score": 0.93, + "content": "\\textstyle \\sum _ { \\ell } { \\widehat { \\sigma } } _ { \\ell } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 192, + 294, + 210 + ], + "score": 1.0, + "content": "can be consistently estimated by", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7 + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 212, + 514, + 249 + ], + "lines": [ + { + "bbox": [ + 111, + 212, + 514, + 249 + ], + "spans": [ + { + "bbox": [ + 111, + 212, + 514, + 249 + ], + "score": 0.87, + "content": "{ \\frac { 1 } { \\mathrm { V } ( t ) } } \\sum _ { i = 1 } ^ { N ( t ) } \\| \\mathbb { I } ( A _ { i } = 1 ) { \\widehat { \\Sigma } } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) { \\widehat { \\beta } } _ { 1 } ( t ) \\} - \\mathbb { I } ( A _ { i } = 0 ) { \\widehat { \\Sigma } } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) { \\widehat { \\beta } } _ { 0 } ( t ) \\} \\varphi ( X _ { i } ) \\| \\varphi ( X _ { i } ) \\| _ { L ^ { \\infty } ( L ^ { \\infty } ( H ) ) } ,", + "type": "interline_equation", + "image_path": "00f33e25aa2d94ac77a786b1cb1b44b00034b9e5ab291679ee697ed278c07605.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 111, + 212, + 514, + 224.33333333333334 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 111, + 224.33333333333334, + 514, + 236.66666666666669 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 111, + 236.66666666666669, + 514, + 249.00000000000003 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 276, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 251, + 276, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 251, + 276, + 267 + ], + "score": 1.0, + "content": "As such, the finite error bound is given by", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11 + }, + { + "type": "interline_equation", + "bbox": [ + 410, + 272, + 549, + 300 + ], + "lines": [], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 410, + 272, + 549, + 300 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 268, + 514, + 342 + ], + "lines": [ + { + "bbox": [ + 111, + 268, + 514, + 342 + ], + "spans": [ + { + "bbox": [ + 111, + 268, + 514, + 342 + ], + "score": 0.78, + "content": "\\begin{array} { r l r } { \\displaystyle } & { } & { \\displaystyle \\operatorname* { s u p } _ { x \\in \\widetilde { \\mathbb { X } } } \\| \\varphi ( x ) \\| _ { 2 } \\frac { \\sqrt { 2 \\log \\log \\{ 1 \\} } } { \\sqrt { N ( t ) } } } \\\\ { \\displaystyle } & { } & { \\displaystyle \\sqrt { \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\| \\mathbb { I } ( A _ { i } = 1 ) \\widehat { \\Sigma } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { 1 } ( t ) \\} - \\mathbb { I } ( A _ { i } = 0 ) \\widehat { \\Sigma } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\} } } \\end{array}", + "type": "interline_equation", + "image_path": "5db848cc0d7fb62565b39d4e94d050a4488a84ecfbddd46547f20699c18adde7.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 111, + 268, + 514, + 292.6666666666667 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 111, + 292.6666666666667, + 514, + 317.33333333333337 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 111, + 317.33333333333337, + 514, + 342.00000000000006 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 354, + 311, + 367 + ], + "lines": [ + { + "bbox": [ + 106, + 353, + 311, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 311, + 369 + ], + "score": 1.0, + "content": "G ADDITIONAL TABLES AND FIGURES", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "table", + "bbox": [ + 106, + 380, + 568, + 655 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 380, + 568, + 655 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 380, + 568, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 568, + 655 + ], + "score": 0.984, + "html": "
methodBATLIL
RandomAdaptiveRandomAdaptive
(n,K8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S10.000.105.0(1.1)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
17.2(1.9)3400(24)18.5(1.9)3409(23)0.0(0.0)3600(0)0.0(0.0)3600(0)
(200,5)0.150.200.250.3036.0(2.4)55.8(2.5)79.5(2.0)93.2(1.3)3184(32)35.5(2.4)3189(32)0.2(0.2)3599(0)0.0(0.0)3600(0)
2914(36)60.0(2.4)2908(36)0.5(0.4)3598(1)0.8(0.4)3595(3)
2545(35)81.5(1.9)2528(34)1.8(0.7)3590(4)2.8(0.8)3585(5)
2286(27)95.2(1.1)2280(26)7.2(1.3)3560(10)7.5(1.3)3549(11)
(20,50)0.000.100.150.200.250.305.2(1.1)17.2(1.9)3879(18)5.5(1.1)3882(18)0.0(0.0)3960(0)0.0(0.0)3960(0)
3716(29)24.0(2.1)3651(32)0.0(0.0)3960(0)0.0(0.0)3960(0)
39.5(2.4)61.8(2.4)84.0(1.8)95.8(1.0)3394(40)3021(44)41.2(2.5)61.0(2.4)3365(40)0.0(0.0)3960(0)0.2(0.2)3958(1)
3013(44)0.8(0.4)3949(6)0.2(0.2)3956(3)
2588(39)83.5(1.9)2579(39)4.8(1.1)3919(11)3.5(0.9)3936(8)
2281(28)95.5(1.0)2275(28)12.8(1.7)3847(18)14.5(1.8)3873(15)
S1(200,5)0.000.100.150.200.250.305.0(1.1)8.8(1.4)25.5(2.2)57.2(2.5)87.2(1.7)98.0(0.7)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
3511(17)3346(26)8.8(1.4)3515(16)0.0(0.0)3600(0)0.0(0.0)3600(0)
26.0(2.2)3337(27)0.0(0.0)3600(0)0.0(0.0)3600(0)
3004(34)2569(32)2224(21)60.2(2.4)88.2(1.6)3000(34)2581(32)0.0(0.0)3600(0)0.0(0.0)3600(0)
(32)2.0(0.7)3594(4)1.5(0.6)3589(5)3574(8)
97.8(0.7)2254(24)10.2(1.5)3559(9)6.2(1.2)
(20,50)0.000.100.150.200.250.305.2(1.1)8.2(1.4)28.0(2.2)64.8(2.4)92.2(1.3)99.2(0.4)3879(18)3839(21)5.5(1.1)7.0(1.3)3882(18)3852(21)0.0(0.0)3960(0)0.0(0.0)3960(0)3960(0)
0.0(0.0)3960(0)0.0(0.0)
3599(34)27.8(2.2)3627(33)0.0(0.0)3960(0)0.2(0.2)3956(3)
3165(41)62.0(2.4)3168(41)1.0(0.5)3951(5)0.8(0.4)3955(4)3936(8)3868(15)
2608(35)2238(23)90.2(1.5)99.2(0.4)2597(36)2250(24)5.0(1.1)14.5(1.8)3926(10)3854(16)2.8(0.8)13.8(1.7)
", + "type": "table", + "image_path": "83b323dea972b5109fec273889ad3e87eb415945052b5a99367ae5e971167498.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 106, + 380, + 568, + 471.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 106, + 471.6666666666667, + 568, + 563.3333333333334 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 106, + 563.3333333333334, + 568, + 655.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 106, + 662, + 505, + 696 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 661, + 505, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 505, + 676 + ], + "score": 1.0, + "content": "Table 1: QTE: rejection probabilities (multiplied by 100) and average stopping times under Sce-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 673, + 505, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 673, + 192, + 686 + ], + "score": 1.0, + "content": "narios 1 and 2 when", + "type": "text" + }, + { + "bbox": [ + 192, + 673, + 215, + 685 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 673, + 505, + 686 + ], + "score": 1.0, + "content": "is chosen as the spending function. Standard errors are reported in the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 684, + 159, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 159, + 697 + ], + "score": 1.0, + "content": "parentheses.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + } + ], + "index": 19.5 + } + ], + "page_idx": 32, + "page_size": [ + 612, + 792 + ], + "discarded_blocks": [ + { + "type": "discarded", + "bbox": [ + 300, + 751, + 311, + 760 + ], + "lines": [ + { + "bbox": [ + 298, + 750, + 312, + 763 + ], + "spans": [ + { + "bbox": [ + 298, + 750, + 312, + 763 + ], + "score": 1.0, + "content": "33", + "type": "text" + } + ] + } + ] + }, + { + "type": "discarded", + "bbox": [ + 106, + 26, + 307, + 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 2021", + "type": "text" + } + ] + } + ] + } + ], + "para_blocks": [ + { + "type": "text", + "bbox": [ + 106, + 82, + 320, + 95 + ], + "lines": [ + { + "bbox": [ + 105, + 81, + 320, + 96 + ], + "spans": [ + { + "bbox": [ + 105, + 81, + 320, + 96 + ], + "score": 1.0, + "content": "The above expression is asymptotically equivalent to", + "type": "text" + } + ], + "index": 0 + } + ], + "index": 0, + "bbox_fs": [ + 105, + 81, + 320, + 96 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 105, + 99, + 488, + 135 + ], + "lines": [ + { + "bbox": [ + 105, + 99, + 488, + 135 + ], + "spans": [ + { + "bbox": [ + 105, + 99, + 488, + 135 + ], + "score": 0.91, + "content": "\\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } [ \\mathbb { I } ( A _ { i } = 1 ) \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } ^ { * } \\} - \\mathbb { I } ( A _ { i } = 0 ) \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } ^ { * } \\} ] .", + "type": "interline_equation", + "image_path": "7be9828d8f1930eb8d95936fbb1a58b809648e88b97a4597dc0c45697b8f013e.jpg" + } + ] + } + ], + "index": 2, + "virtual_lines": [ + { + "bbox": [ + 105, + 99, + 488, + 111.0 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 105, + 111.0, + 488, + 123.0 + ], + "spans": [], + "index": 2 + }, + { + "bbox": [ + 105, + 123.0, + 488, + 135.0 + ], + "spans": [], + "index": 3 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 139, + 505, + 163 + ], + "lines": [ + { + "bbox": [ + 105, + 138, + 506, + 153 + ], + "spans": [ + { + "bbox": [ + 105, + 138, + 254, + 153 + ], + "score": 1.0, + "content": "By the law of iterated logarithm, the", + "type": "text" + }, + { + "bbox": [ + 255, + 140, + 260, + 149 + ], + "score": 0.71, + "content": "\\ell", + "type": "inline_equation" + }, + { + "bbox": [ + 261, + 138, + 506, + 153 + ], + "score": 1.0, + "content": "-th dimension of the above expression can be upper bounded", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 104, + 150, + 120, + 165 + ], + "spans": [ + { + "bbox": [ + 104, + 150, + 120, + 165 + ], + "score": 1.0, + "content": "by", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4.5, + "bbox_fs": [ + 104, + 138, + 506, + 165 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 231, + 168, + 360, + 189 + ], + "lines": [ + { + "bbox": [ + 231, + 168, + 360, + 189 + ], + "spans": [ + { + "bbox": [ + 231, + 168, + 360, + 189 + ], + "score": 0.92, + "content": "N ^ { - 1 / 2 } ( t ) \\sqrt { 2 \\sigma _ { \\ell } ^ { 2 } \\log \\log \\{ N ( t ) \\} } ,", + "type": "interline_equation", + "image_path": "4f345e4d113717d4323a9b5eb14c21ed44fc574d0ab1281aaa4620a0248705c1.jpg" + } + ] + } + ], + "index": 6, + "virtual_lines": [ + { + "bbox": [ + 231, + 168, + 360, + 189 + ], + "spans": [], + "index": 6 + } + ] + }, + { + "type": "text", + "bbox": [ + 106, + 194, + 294, + 208 + ], + "lines": [ + { + "bbox": [ + 105, + 192, + 294, + 210 + ], + "spans": [ + { + "bbox": [ + 105, + 192, + 133, + 210 + ], + "score": 1.0, + "content": "where", + "type": "text" + }, + { + "bbox": [ + 133, + 195, + 161, + 208 + ], + "score": 0.93, + "content": "\\textstyle \\sum _ { \\ell } { \\widehat { \\sigma } } _ { \\ell } ^ { 2 }", + "type": "inline_equation" + }, + { + "bbox": [ + 161, + 192, + 294, + 210 + ], + "score": 1.0, + "content": "can be consistently estimated by", + "type": "text" + } + ], + "index": 7 + } + ], + "index": 7, + "bbox_fs": [ + 105, + 192, + 294, + 210 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 212, + 514, + 249 + ], + "lines": [ + { + "bbox": [ + 111, + 212, + 514, + 249 + ], + "spans": [ + { + "bbox": [ + 111, + 212, + 514, + 249 + ], + "score": 0.87, + "content": "{ \\frac { 1 } { \\mathrm { V } ( t ) } } \\sum _ { i = 1 } ^ { N ( t ) } \\| \\mathbb { I } ( A _ { i } = 1 ) { \\widehat { \\Sigma } } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) { \\widehat { \\beta } } _ { 1 } ( t ) \\} - \\mathbb { I } ( A _ { i } = 0 ) { \\widehat { \\Sigma } } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) { \\widehat { \\beta } } _ { 0 } ( t ) \\} \\varphi ( X _ { i } ) \\| \\varphi ( X _ { i } ) \\| _ { L ^ { \\infty } ( L ^ { \\infty } ( H ) ) } ,", + "type": "interline_equation", + "image_path": "00f33e25aa2d94ac77a786b1cb1b44b00034b9e5ab291679ee697ed278c07605.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 111, + 212, + 514, + 224.33333333333334 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 111, + 224.33333333333334, + 514, + 236.66666666666669 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 111, + 236.66666666666669, + 514, + 249.00000000000003 + ], + "spans": [], + "index": 10 + } + ] + }, + { + "type": "text", + "bbox": [ + 107, + 253, + 276, + 266 + ], + "lines": [ + { + "bbox": [ + 106, + 251, + 276, + 267 + ], + "spans": [ + { + "bbox": [ + 106, + 251, + 276, + 267 + ], + "score": 1.0, + "content": "As such, the finite error bound is given by", + "type": "text" + } + ], + "index": 11 + } + ], + "index": 11, + "bbox_fs": [ + 106, + 251, + 276, + 267 + ] + }, + { + "type": "interline_equation", + "bbox": [ + 410, + 272, + 549, + 300 + ], + "lines": [], + "index": 13, + "virtual_lines": [ + { + "bbox": [ + 410, + 272, + 549, + 300 + ], + "spans": [], + "index": 13 + } + ] + }, + { + "type": "interline_equation", + "bbox": [ + 111, + 268, + 514, + 342 + ], + "lines": [ + { + "bbox": [ + 111, + 268, + 514, + 342 + ], + "spans": [ + { + "bbox": [ + 111, + 268, + 514, + 342 + ], + "score": 0.78, + "content": "\\begin{array} { r l r } { \\displaystyle } & { } & { \\displaystyle \\operatorname* { s u p } _ { x \\in \\widetilde { \\mathbb { X } } } \\| \\varphi ( x ) \\| _ { 2 } \\frac { \\sqrt { 2 \\log \\log \\{ 1 \\} } } { \\sqrt { N ( t ) } } } \\\\ { \\displaystyle } & { } & { \\displaystyle \\sqrt { \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\| \\mathbb { I } ( A _ { i } = 1 ) \\widehat { \\Sigma } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { 1 } ( t ) \\} - \\mathbb { I } ( A _ { i } = 0 ) \\widehat { \\Sigma } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\} } } \\end{array}", + "type": "interline_equation", + "image_path": "5db848cc0d7fb62565b39d4e94d050a4488a84ecfbddd46547f20699c18adde7.jpg" + } + ] + } + ], + "index": 14, + "virtual_lines": [ + { + "bbox": [ + 111, + 268, + 514, + 292.6666666666667 + ], + "spans": [], + "index": 12 + }, + { + "bbox": [ + 111, + 292.6666666666667, + 514, + 317.33333333333337 + ], + "spans": [], + "index": 14 + }, + { + "bbox": [ + 111, + 317.33333333333337, + 514, + 342.00000000000006 + ], + "spans": [], + "index": 15 + } + ] + }, + { + "type": "title", + "bbox": [ + 106, + 354, + 311, + 367 + ], + "lines": [ + { + "bbox": [ + 106, + 353, + 311, + 369 + ], + "spans": [ + { + "bbox": [ + 106, + 353, + 311, + 369 + ], + "score": 1.0, + "content": "G ADDITIONAL TABLES AND FIGURES", + "type": "text" + } + ], + "index": 16 + } + ], + "index": 16 + }, + { + "type": "table", + "bbox": [ + 106, + 380, + 568, + 655 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 380, + 568, + 655 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 380, + 568, + 655 + ], + "spans": [ + { + "bbox": [ + 106, + 380, + 568, + 655 + ], + "score": 0.984, + "html": "
methodBATLIL
RandomAdaptiveRandomAdaptive
(n,K8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S10.000.105.0(1.1)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
17.2(1.9)3400(24)18.5(1.9)3409(23)0.0(0.0)3600(0)0.0(0.0)3600(0)
(200,5)0.150.200.250.3036.0(2.4)55.8(2.5)79.5(2.0)93.2(1.3)3184(32)35.5(2.4)3189(32)0.2(0.2)3599(0)0.0(0.0)3600(0)
2914(36)60.0(2.4)2908(36)0.5(0.4)3598(1)0.8(0.4)3595(3)
2545(35)81.5(1.9)2528(34)1.8(0.7)3590(4)2.8(0.8)3585(5)
2286(27)95.2(1.1)2280(26)7.2(1.3)3560(10)7.5(1.3)3549(11)
(20,50)0.000.100.150.200.250.305.2(1.1)17.2(1.9)3879(18)5.5(1.1)3882(18)0.0(0.0)3960(0)0.0(0.0)3960(0)
3716(29)24.0(2.1)3651(32)0.0(0.0)3960(0)0.0(0.0)3960(0)
39.5(2.4)61.8(2.4)84.0(1.8)95.8(1.0)3394(40)3021(44)41.2(2.5)61.0(2.4)3365(40)0.0(0.0)3960(0)0.2(0.2)3958(1)
3013(44)0.8(0.4)3949(6)0.2(0.2)3956(3)
2588(39)83.5(1.9)2579(39)4.8(1.1)3919(11)3.5(0.9)3936(8)
2281(28)95.5(1.0)2275(28)12.8(1.7)3847(18)14.5(1.8)3873(15)
S1(200,5)0.000.100.150.200.250.305.0(1.1)8.8(1.4)25.5(2.2)57.2(2.5)87.2(1.7)98.0(0.7)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
3511(17)3346(26)8.8(1.4)3515(16)0.0(0.0)3600(0)0.0(0.0)3600(0)
26.0(2.2)3337(27)0.0(0.0)3600(0)0.0(0.0)3600(0)
3004(34)2569(32)2224(21)60.2(2.4)88.2(1.6)3000(34)2581(32)0.0(0.0)3600(0)0.0(0.0)3600(0)
(32)2.0(0.7)3594(4)1.5(0.6)3589(5)3574(8)
97.8(0.7)2254(24)10.2(1.5)3559(9)6.2(1.2)
(20,50)0.000.100.150.200.250.305.2(1.1)8.2(1.4)28.0(2.2)64.8(2.4)92.2(1.3)99.2(0.4)3879(18)3839(21)5.5(1.1)7.0(1.3)3882(18)3852(21)0.0(0.0)3960(0)0.0(0.0)3960(0)3960(0)
0.0(0.0)3960(0)0.0(0.0)
3599(34)27.8(2.2)3627(33)0.0(0.0)3960(0)0.2(0.2)3956(3)
3165(41)62.0(2.4)3168(41)1.0(0.5)3951(5)0.8(0.4)3955(4)3936(8)3868(15)
2608(35)2238(23)90.2(1.5)99.2(0.4)2597(36)2250(24)5.0(1.1)14.5(1.8)3926(10)3854(16)2.8(0.8)13.8(1.7)
", + "type": "table", + "image_path": "83b323dea972b5109fec273889ad3e87eb415945052b5a99367ae5e971167498.jpg" + } + ] + } + ], + "index": 18, + "virtual_lines": [ + { + "bbox": [ + 106, + 380, + 568, + 471.6666666666667 + ], + "spans": [], + "index": 17 + }, + { + "bbox": [ + 106, + 471.6666666666667, + 568, + 563.3333333333334 + ], + "spans": [], + "index": 18 + }, + { + "bbox": [ + 106, + 563.3333333333334, + 568, + 655.0 + ], + "spans": [], + "index": 19 + } + ] + }, + { + "type": "table_footnote", + "bbox": [ + 106, + 662, + 505, + 696 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 661, + 505, + 676 + ], + "spans": [ + { + "bbox": [ + 105, + 661, + 505, + 676 + ], + "score": 1.0, + "content": "Table 1: QTE: rejection probabilities (multiplied by 100) and average stopping times under Sce-", + "type": "text" + } + ], + "index": 20 + }, + { + "bbox": [ + 106, + 673, + 505, + 686 + ], + "spans": [ + { + "bbox": [ + 106, + 673, + 192, + 686 + ], + "score": 1.0, + "content": "narios 1 and 2 when", + "type": "text" + }, + { + "bbox": [ + 192, + 673, + 215, + 685 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 673, + 505, + 686 + ], + "score": 1.0, + "content": "is chosen as the spending function. Standard errors are reported in the", + "type": "text" + } + ], + "index": 21 + }, + { + "bbox": [ + 105, + 684, + 159, + 697 + ], + "spans": [ + { + "bbox": [ + 105, + 684, + 159, + 697 + ], + "score": 1.0, + "content": "parentheses.", + "type": "text" + } + ], + "index": 22 + } + ], + "index": 21 + } + ], + "index": 19.5 + } + ] + }, + { + "preproc_blocks": [ + { + "type": "table", + "bbox": [ + 106, + 133, + 573, + 405 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 133, + 573, + 405 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 133, + 573, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 133, + 573, + 405 + ], + "score": 0.981, + "html": "
methodBATAVT
RandomAdaptiveRandomAdaptive
(n,K)8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S1(200,5)0.000.100.150.200.250.305.2(1.1)27.5(2.2)45.5(2.5)62.5(2.4)80.2(2.0)88.2(1.6)1763(8)6.2(1.2)1762(8)0.2(0.2)1800(0)51.2(2.5)1586(11)
1644(15)26.0(2.2)1647(14)6.8(1.3)1771(6)89.0(1.6)1344(9)
1511(17)1391(18)1263(17)1176(14)44.2(2.5)1527(17)19.0(2.0)1718(10)98.0(0.7)1250(6)
64.2(2.4)1383(18)42.8(2.5)1581(15)99.5(0.4)1196(6)
78.8(2.0)1266(17)72.8(2.2)1394(17)99.8(0.2)1145(5)1091(5)
88.8(1.6)1179(14)89.2(1.5)1216(14)100.0(0.0)
(20,50)0.000.100.150.200.250.305.8(1.2)27.5(2.2)45.5(2.5)67.0(2.4)83.8(1.8)92.0(1.4)1933(9)1771(18)1617(22)1446(22)1287(19)1182(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)
27.5(2.2)1771(18)8.0(1.4)1929(9)89.2(1.5)1276(13)
45.8(2.5)1630(21)25.2(2.2)1826(15)97.8(0.7)1166(7)
65.5(2.4)82.5(1.9)91.5(1.4)1459(22)53.8(2.5)1617(20)99.0(0.5)1105(6)
1288(19)79.0(2.0)1379(19)99.8(0.2)1061(4)1030(2)
1193(16)94.0(1.2)1187(15)100.0(0.0)
S2(200,5)0.000.100.150.200.250.305.2(1.1)18.2(1.9)29.0(2.3)40.5(2.5)50.5(2.5)62.5(2.4)1763(8)1692(12)6.2(1.2)16.8(1.9)1762(8)1699(12)0.2(0.2)1800(0)51.2(2.5)82.2(1.9)1586(11)1406(10)
3.0(0.9)1788(3)
1633(15)1559(17)1489(18)1407(18)25.2(2.2)1642(15)8.5(1.4)1762(7)91.8(1.4)1323(9)
42.0(2.5)49.8(2.5)62.5(2.4)1548(17)1492(18)1413(18)17.2(1.9)1724(10)97.8(0.7)1257(7)
33.0(2.4)53.5(2.5)1641(14)99.0(0.5)99.5(0.4)1218(6)1181(6)
62.5(2.4)1522(16)
(20,50)0.000.100.150.200.250.305.8(1.2)19.0(2.0)28.5(2.3)39.0(2.4)50.7(2.5)65.2(2.4)1933(9)1839(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)1360(15)
19.0(2.0)1837(16)3.5(0.9)1961(5)81.0(2.0)
1763(19)1680(21)28.0(2.2)1771(18)11.5(1.6)1911(10)90.8(1.4)1256(12)1171(8)1124(6)1092(5)
1680(21)41.8(2.5)1685(20)24.0(2.1)1830(15)97.5(0.8)
1592(22)1479(22)52.5(2.5)1568(22)44.2(2.5)1688(19)1539(20)99.0(0.5)99.2(0.4)
63.7(2.4)1481(22)63.5(2.4)
", + "type": "table", + "image_path": "f71405ecb538e1ab493cd56bce1417bdbb54d4029c9c183c707d773a8f3d875f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 133, + 573, + 223.66666666666669 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 223.66666666666669, + 573, + 314.33333333333337 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 314.33333333333337, + 573, + 405.00000000000006 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 412, + 506, + 446 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "Table 2: ATE: rejection probabilities (multiplied by 100) and average stopping times under Sce-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 192, + 436 + ], + "score": 1.0, + "content": "narios 1 and 2 when", + "type": "text" + }, + { + "bbox": [ + 192, + 424, + 215, + 436 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 424, + 505, + 436 + ], + "score": 1.0, + "content": "is chosen as the spending function. Standard errors are reported in the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 435, + 159, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 159, + 446 + ], + "score": 1.0, + "content": "parentheses.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "image", + "bbox": [ + 208, + 558, + 403, + 653 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 208, + 558, + 403, + 653 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 208, + 558, + 403, + 653 + ], + "spans": [ + { + "bbox": [ + 208, + 558, + 403, + 653 + ], + "score": 0.967, + "type": "image", + "image_path": "3a71b11105d6bd40963e8e996977b72b9608eefdc9f17ccca0092181f0fe9212.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 208, + 558, + 403, + 571.5714285714286 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 208, + 571.5714285714286, + 403, + 585.1428571428571 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 208, + 585.1428571428571, + 403, + 598.7142857142857 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 208, + 598.7142857142857, + 403, + 612.2857142857142 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 208, + 612.2857142857142, + 403, + 625.8571428571428 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 208, + 625.8571428571428, + 403, + 639.4285714285713 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 208, + 639.4285714285713, + 403, + 652.9999999999999 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 185, + 666, + 425, + 678 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 184, + 665, + 426, + 680 + ], + "spans": [ + { + "bbox": [ + 184, + 665, + 354, + 680 + ], + "score": 1.0, + "content": "Figure 5: Alpha spending functions when", + "type": "text" + }, + { + "bbox": [ + 354, + 666, + 422, + 678 + ], + "score": 0.9, + "content": "\\theta = 0 . 5 , \\gamma = 1 . 0", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 665, + 426, + 680 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + } + ], + "index": 11.0 + } + ], + "page_idx": 33, + "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": "table", + "bbox": [ + 106, + 133, + 573, + 405 + ], + "blocks": [ + { + "type": "table_body", + "bbox": [ + 106, + 133, + 573, + 405 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 106, + 133, + 573, + 405 + ], + "spans": [ + { + "bbox": [ + 106, + 133, + 573, + 405 + ], + "score": 0.981, + "html": "
methodBATAVT
RandomAdaptiveRandomAdaptive
(n,K)8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S1(200,5)0.000.100.150.200.250.305.2(1.1)27.5(2.2)45.5(2.5)62.5(2.4)80.2(2.0)88.2(1.6)1763(8)6.2(1.2)1762(8)0.2(0.2)1800(0)51.2(2.5)1586(11)
1644(15)26.0(2.2)1647(14)6.8(1.3)1771(6)89.0(1.6)1344(9)
1511(17)1391(18)1263(17)1176(14)44.2(2.5)1527(17)19.0(2.0)1718(10)98.0(0.7)1250(6)
64.2(2.4)1383(18)42.8(2.5)1581(15)99.5(0.4)1196(6)
78.8(2.0)1266(17)72.8(2.2)1394(17)99.8(0.2)1145(5)1091(5)
88.8(1.6)1179(14)89.2(1.5)1216(14)100.0(0.0)
(20,50)0.000.100.150.200.250.305.8(1.2)27.5(2.2)45.5(2.5)67.0(2.4)83.8(1.8)92.0(1.4)1933(9)1771(18)1617(22)1446(22)1287(19)1182(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)
27.5(2.2)1771(18)8.0(1.4)1929(9)89.2(1.5)1276(13)
45.8(2.5)1630(21)25.2(2.2)1826(15)97.8(0.7)1166(7)
65.5(2.4)82.5(1.9)91.5(1.4)1459(22)53.8(2.5)1617(20)99.0(0.5)1105(6)
1288(19)79.0(2.0)1379(19)99.8(0.2)1061(4)1030(2)
1193(16)94.0(1.2)1187(15)100.0(0.0)
S2(200,5)0.000.100.150.200.250.305.2(1.1)18.2(1.9)29.0(2.3)40.5(2.5)50.5(2.5)62.5(2.4)1763(8)1692(12)6.2(1.2)16.8(1.9)1762(8)1699(12)0.2(0.2)1800(0)51.2(2.5)82.2(1.9)1586(11)1406(10)
3.0(0.9)1788(3)
1633(15)1559(17)1489(18)1407(18)25.2(2.2)1642(15)8.5(1.4)1762(7)91.8(1.4)1323(9)
42.0(2.5)49.8(2.5)62.5(2.4)1548(17)1492(18)1413(18)17.2(1.9)1724(10)97.8(0.7)1257(7)
33.0(2.4)53.5(2.5)1641(14)99.0(0.5)99.5(0.4)1218(6)1181(6)
62.5(2.4)1522(16)
(20,50)0.000.100.150.200.250.305.8(1.2)19.0(2.0)28.5(2.3)39.0(2.4)50.7(2.5)65.2(2.4)1933(9)1839(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)1360(15)
19.0(2.0)1837(16)3.5(0.9)1961(5)81.0(2.0)
1763(19)1680(21)28.0(2.2)1771(18)11.5(1.6)1911(10)90.8(1.4)1256(12)1171(8)1124(6)1092(5)
1680(21)41.8(2.5)1685(20)24.0(2.1)1830(15)97.5(0.8)
1592(22)1479(22)52.5(2.5)1568(22)44.2(2.5)1688(19)1539(20)99.0(0.5)99.2(0.4)
63.7(2.4)1481(22)63.5(2.4)
", + "type": "table", + "image_path": "f71405ecb538e1ab493cd56bce1417bdbb54d4029c9c183c707d773a8f3d875f.jpg" + } + ] + } + ], + "index": 1, + "virtual_lines": [ + { + "bbox": [ + 106, + 133, + 573, + 223.66666666666669 + ], + "spans": [], + "index": 0 + }, + { + "bbox": [ + 106, + 223.66666666666669, + 573, + 314.33333333333337 + ], + "spans": [], + "index": 1 + }, + { + "bbox": [ + 106, + 314.33333333333337, + 573, + 405.00000000000006 + ], + "spans": [], + "index": 2 + } + ] + }, + { + "type": "table_caption", + "bbox": [ + 106, + 412, + 506, + 446 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "spans": [ + { + "bbox": [ + 105, + 412, + 505, + 425 + ], + "score": 1.0, + "content": "Table 2: ATE: rejection probabilities (multiplied by 100) and average stopping times under Sce-", + "type": "text" + } + ], + "index": 3 + }, + { + "bbox": [ + 106, + 424, + 505, + 436 + ], + "spans": [ + { + "bbox": [ + 106, + 424, + 192, + 436 + ], + "score": 1.0, + "content": "narios 1 and 2 when", + "type": "text" + }, + { + "bbox": [ + 192, + 424, + 215, + 436 + ], + "score": 0.91, + "content": "\\alpha _ { 1 } ( \\cdot )", + "type": "inline_equation" + }, + { + "bbox": [ + 215, + 424, + 505, + 436 + ], + "score": 1.0, + "content": "is chosen as the spending function. Standard errors are reported in the", + "type": "text" + } + ], + "index": 4 + }, + { + "bbox": [ + 105, + 435, + 159, + 446 + ], + "spans": [ + { + "bbox": [ + 105, + 435, + 159, + 446 + ], + "score": 1.0, + "content": "parentheses.", + "type": "text" + } + ], + "index": 5 + } + ], + "index": 4 + } + ], + "index": 2.5 + }, + { + "type": "image", + "bbox": [ + 208, + 558, + 403, + 653 + ], + "blocks": [ + { + "type": "image_body", + "bbox": [ + 208, + 558, + 403, + 653 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 208, + 558, + 403, + 653 + ], + "spans": [ + { + "bbox": [ + 208, + 558, + 403, + 653 + ], + "score": 0.967, + "type": "image", + "image_path": "3a71b11105d6bd40963e8e996977b72b9608eefdc9f17ccca0092181f0fe9212.jpg" + } + ] + } + ], + "index": 9, + "virtual_lines": [ + { + "bbox": [ + 208, + 558, + 403, + 571.5714285714286 + ], + "spans": [], + "index": 6 + }, + { + "bbox": [ + 208, + 571.5714285714286, + 403, + 585.1428571428571 + ], + "spans": [], + "index": 7 + }, + { + "bbox": [ + 208, + 585.1428571428571, + 403, + 598.7142857142857 + ], + "spans": [], + "index": 8 + }, + { + "bbox": [ + 208, + 598.7142857142857, + 403, + 612.2857142857142 + ], + "spans": [], + "index": 9 + }, + { + "bbox": [ + 208, + 612.2857142857142, + 403, + 625.8571428571428 + ], + "spans": [], + "index": 10 + }, + { + "bbox": [ + 208, + 625.8571428571428, + 403, + 639.4285714285713 + ], + "spans": [], + "index": 11 + }, + { + "bbox": [ + 208, + 639.4285714285713, + 403, + 652.9999999999999 + ], + "spans": [], + "index": 12 + } + ] + }, + { + "type": "image_caption", + "bbox": [ + 185, + 666, + 425, + 678 + ], + "group_id": 0, + "lines": [ + { + "bbox": [ + 184, + 665, + 426, + 680 + ], + "spans": [ + { + "bbox": [ + 184, + 665, + 354, + 680 + ], + "score": 1.0, + "content": "Figure 5: Alpha spending functions when", + "type": "text" + }, + { + "bbox": [ + 354, + 666, + 422, + 678 + ], + "score": 0.9, + "content": "\\theta = 0 . 5 , \\gamma = 1 . 0", + "type": "inline_equation" + }, + { + "bbox": [ + 423, + 665, + 426, + 680 + ], + "score": 1.0, + "content": ".", + "type": "text" + } + ], + "index": 13 + } + ], + "index": 13 + } + ], + "index": 11.0 + } + ] + } + ], + "_backend": "pipeline", + "_version_name": "2.2.2" +} \ No newline at end of file diff --git a/parse/train/yxafu6ZtUux/yxafu6ZtUux_model.json b/parse/train/yxafu6ZtUux/yxafu6ZtUux_model.json new file mode 100644 index 0000000000000000000000000000000000000000..50225194a3f6a533cba57e7740a4f4546348031b --- /dev/null +++ b/parse/train/yxafu6ZtUux/yxafu6ZtUux_model.json @@ -0,0 +1,54277 @@ +[ + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1099, + 1404, + 1099, + 1404, + 1406, + 298, + 1406 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 398, + 589, + 1302, + 589, + 1302, + 986, + 398, + 986 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 298, + 1420, + 1404, + 1420, + 1404, + 1726, + 298, + 1726 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1742, + 1402, + 1742, + 1402, + 1896, + 298, + 1896 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1911, + 1401, + 1911, + 1401, + 2034, + 299, + 2034 + ], + "score": 0.973 + }, + { + "category_id": 0, + "poly": [ + 301, + 219, + 1402, + 219, + 1402, + 323, + 301, + 323 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 313, + 378, + 680, + 378, + 680, + 438, + 313, + 438 + ], + "score": 0.936 + }, + { + "category_id": 0, + "poly": [ + 302, + 1046, + 573, + 1046, + 573, + 1081, + 302, + 1081 + ], + "score": 0.891 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 104, + 298, + 104 + ], + "score": 0.886 + }, + { + "category_id": 0, + "poly": [ + 773, + 520, + 926, + 520, + 926, + 553, + 773, + 553 + ], + "score": 0.871 + }, + { + "category_id": 2, + "poly": [ + 842, + 2089, + 857, + 2089, + 857, + 2112, + 842, + 2112 + ], + "score": 0.621 + }, + { + "category_id": 15, + "poly": [ + 291.0, + 211.0, + 1407.0, + 211.0, + 1407.0, + 281.0, + 291.0, + 281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 275.0, + 750.0, + 275.0, + 750.0, + 327.0, + 296.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1043.0, + 579.0, + 1043.0, + 579.0, + 1090.0, + 294.0, + 1090.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": [ + 841.0, + 2088.0, + 860.0, + 2088.0, + 860.0, + 2118.0, + 841.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1099.0, + 1406.0, + 1099.0, + 1406.0, + 1136.0, + 293.0, + 1136.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1130.0, + 1405.0, + 1130.0, + 1405.0, + 1165.0, + 295.0, + 1165.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1161.0, + 1406.0, + 1161.0, + 1406.0, + 1197.0, + 294.0, + 1197.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1190.0, + 1406.0, + 1190.0, + 1406.0, + 1228.0, + 293.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1225.0, + 1405.0, + 1225.0, + 1405.0, + 1256.0, + 294.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1249.0, + 1408.0, + 1249.0, + 1408.0, + 1291.0, + 292.0, + 1291.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1284.0, + 1406.0, + 1284.0, + 1406.0, + 1317.0, + 292.0, + 1317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1312.0, + 1407.0, + 1312.0, + 1407.0, + 1348.0, + 293.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1343.0, + 1408.0, + 1343.0, + 1408.0, + 1382.0, + 293.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1371.0, + 1404.0, + 1371.0, + 1404.0, + 1413.0, + 293.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 590.0, + 1304.0, + 590.0, + 1304.0, + 625.0, + 394.0, + 625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 621.0, + 1306.0, + 621.0, + 1306.0, + 656.0, + 394.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 651.0, + 1307.0, + 651.0, + 1307.0, + 685.0, + 392.0, + 685.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 683.0, + 1305.0, + 683.0, + 1305.0, + 715.0, + 394.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 711.0, + 1306.0, + 711.0, + 1306.0, + 746.0, + 392.0, + 746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 743.0, + 1306.0, + 743.0, + 1306.0, + 774.0, + 392.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 773.0, + 1305.0, + 773.0, + 1305.0, + 805.0, + 393.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 803.0, + 1306.0, + 803.0, + 1306.0, + 838.0, + 393.0, + 838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 393.0, + 835.0, + 1304.0, + 835.0, + 1304.0, + 867.0, + 393.0, + 867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 863.0, + 1305.0, + 863.0, + 1305.0, + 897.0, + 395.0, + 897.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.0, + 894.0, + 1306.0, + 894.0, + 1306.0, + 929.0, + 394.0, + 929.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 925.0, + 1305.0, + 925.0, + 1305.0, + 957.0, + 395.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 957.0, + 936.0, + 957.0, + 936.0, + 989.0, + 395.0, + 989.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1422.0, + 1404.0, + 1422.0, + 1404.0, + 1454.0, + 294.0, + 1454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1452.0, + 1406.0, + 1452.0, + 1406.0, + 1487.0, + 293.0, + 1487.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1482.0, + 1405.0, + 1482.0, + 1405.0, + 1517.0, + 294.0, + 1517.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1513.0, + 1404.0, + 1513.0, + 1404.0, + 1549.0, + 294.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1543.0, + 1406.0, + 1543.0, + 1406.0, + 1579.0, + 293.0, + 1579.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1576.0, + 1404.0, + 1576.0, + 1404.0, + 1607.0, + 296.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1606.0, + 1405.0, + 1606.0, + 1405.0, + 1638.0, + 294.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1634.0, + 1405.0, + 1634.0, + 1405.0, + 1669.0, + 294.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1666.0, + 1404.0, + 1666.0, + 1404.0, + 1701.0, + 294.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1697.0, + 1115.0, + 1697.0, + 1115.0, + 1729.0, + 296.0, + 1729.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1741.0, + 1404.0, + 1741.0, + 1404.0, + 1777.0, + 293.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1773.0, + 1402.0, + 1773.0, + 1402.0, + 1806.0, + 296.0, + 1806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1802.0, + 1406.0, + 1802.0, + 1406.0, + 1839.0, + 293.0, + 1839.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1834.0, + 1406.0, + 1834.0, + 1406.0, + 1871.0, + 294.0, + 1871.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1860.0, + 1386.0, + 1860.0, + 1386.0, + 1904.0, + 293.0, + 1904.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1910.0, + 1405.0, + 1910.0, + 1405.0, + 1946.0, + 294.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1943.0, + 1405.0, + 1943.0, + 1405.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": [ + 293.0, + 2000.0, + 1405.0, + 2000.0, + 1405.0, + 2039.0, + 293.0, + 2039.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, + 1098, + 1404, + 1098, + 1404, + 1374, + 297, + 1374 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 297, + 1469, + 1405, + 1469, + 1405, + 1823, + 297, + 1823 + ], + "score": 0.984 + }, + { + "category_id": 1, + "poly": [ + 298, + 838, + 1403, + 838, + 1403, + 1084, + 298, + 1084 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 669, + 1403, + 669, + 1403, + 824, + 298, + 824 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1880, + 1403, + 1880, + 1403, + 2036, + 298, + 2036 + ], + "score": 0.975 + }, + { + "category_id": 4, + "poly": [ + 296, + 471, + 1407, + 471, + 1407, + 640, + 296, + 640 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 489, + 261, + 1186, + 261, + 1186, + 453, + 489, + 453 + ], + "score": 0.964 + }, + { + "category_id": 0, + "poly": [ + 298, + 1421, + 990, + 1421, + 990, + 1453, + 298, + 1453 + ], + "score": 0.923 + }, + { + "category_id": 8, + "poly": [ + 369, + 1832, + 1267, + 1832, + 1267, + 1870, + 369, + 1870 + ], + "score": 0.847 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.722 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 852, + 76, + 852, + 104, + 299, + 104 + ], + "score": 0.494 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 854, + 76, + 854, + 104, + 298, + 104 + ], + "score": 0.449 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.146 + }, + { + "category_id": 13, + "poly": [ + 928, + 1911, + 1219, + 1911, + 1219, + 1945, + 928, + 1945 + ], + "score": 0.92, + "latex": "\\tau _ { 0 } \\stackrel { } { = } \\mathrm { E } \\{ Y ^ { \\ast } ( 1 ) - Y ^ { \\ast } ( 0 ) \\}" + }, + { + "category_id": 13, + "poly": [ + 701, + 1532, + 911, + 1532, + 911, + 1574, + 701, + 1574 + ], + "score": 0.92, + "latex": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { N ( t ) }" + }, + { + "category_id": 13, + "poly": [ + 616, + 2003, + 673, + 2003, + 673, + 2036, + 616, + 2036 + ], + "score": 0.92, + "latex": "\\varphi ( x )" + }, + { + "category_id": 13, + "poly": [ + 377, + 1913, + 524, + 1913, + 524, + 1943, + 377, + 1943 + ], + "score": 0.92, + "latex": "H _ { 1 } : \\tau _ { 0 } > 0" + }, + { + "category_id": 13, + "poly": [ + 1112, + 1726, + 1400, + 1726, + 1400, + 1764, + 1112, + 1764 + ], + "score": 0.92, + "latex": "\\{ ( X _ { i } , Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 ) ) \\} _ { i = 1 } ^ { + \\infty }" + }, + { + "category_id": 13, + "poly": [ + 662, + 1575, + 863, + 1575, + 863, + 1607, + 662, + 1607 + ], + "score": 0.92, + "latex": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { + \\infty }" + }, + { + "category_id": 13, + "poly": [ + 377, + 1789, + 717, + 1789, + 717, + 1825, + 377, + 1825 + ], + "score": 0.92, + "latex": "\\bar { Q } _ { 0 } ( x , a ) \\stackrel { \\cdot } { = } \\mathrm { E } \\{ Y ^ { * } ( a ) | X \\stackrel { \\cdot } { = } x \\}" + }, + { + "category_id": 13, + "poly": [ + 759, + 1792, + 853, + 1792, + 853, + 1823, + 759, + 1823 + ], + "score": 0.92, + "latex": "a = 0 , 1" + }, + { + "category_id": 13, + "poly": [ + 445, + 1665, + 653, + 1665, + 653, + 1699, + 445, + 1699 + ], + "score": 0.91, + "latex": "\\{ ( X _ { j } , A _ { j } , Y _ { j } ) \\} _ { j < i }" + }, + { + "category_id": 13, + "poly": [ + 910, + 1759, + 1120, + 1759, + 1120, + 1793, + 910, + 1793 + ], + "score": 0.91, + "latex": "( X , Y ^ { * } \\bar { ( 0 ) } , Y ^ { * } ( 1 ) )" + }, + { + "category_id": 13, + "poly": [ + 602, + 1698, + 675, + 1698, + 675, + 1729, + 602, + 1729 + ], + "score": 0.91, + "latex": "Y _ { i } ^ { * } ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 816, + 1881, + 897, + 1881, + 897, + 1911, + 816, + 1911 + ], + "score": 0.9, + "latex": "\\mathbb { X } = \\emptyset" + }, + { + "category_id": 13, + "poly": [ + 1006, + 1537, + 1064, + 1537, + 1064, + 1573, + 1006, + 1573 + ], + "score": 0.9, + "latex": "N ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 478, + 1698, + 550, + 1698, + 550, + 1729, + 478, + 1729 + ], + "score": 0.9, + "latex": "Y _ { i } ^ { * } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 1252, + 1882, + 1402, + 1882, + 1402, + 1913, + 1252, + 1913 + ], + "score": 0.9, + "latex": "H _ { 0 } : \\tau _ { 0 } \\leq 0" + }, + { + "category_id": 13, + "poly": [ + 1270, + 1636, + 1304, + 1636, + 1304, + 1665, + 1270, + 1665 + ], + "score": 0.89, + "latex": "X _ { i }" + }, + { + "category_id": 13, + "poly": [ + 470, + 1973, + 507, + 1973, + 507, + 2005, + 470, + 2005 + ], + "score": 0.89, + "latex": "Q _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1089, + 1636, + 1121, + 1636, + 1121, + 1665, + 1089, + 1665 + ], + "score": 0.88, + "latex": "A _ { i }" + }, + { + "category_id": 13, + "poly": [ + 761, + 1608, + 864, + 1608, + 864, + 1635, + 761, + 1635 + ], + "score": 0.88, + "latex": "X _ { i } \\in \\mathbb { R } ^ { p }" + }, + { + "category_id": 13, + "poly": [ + 715, + 1971, + 1321, + 1971, + 1321, + 2006, + 715, + 2006 + ], + "score": 0.87, + "latex": "\\mathcal { Q } = \\{ Q \\in \\langle x , a ; \\beta _ { 0 } , \\hat { \\beta _ { 1 } } \\rangle = \\varphi ^ { \\top } ( x ) \\hat { \\beta _ { a } } : \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { q } \\}" + }, + { + "category_id": 13, + "poly": [ + 1295, + 1605, + 1324, + 1605, + 1324, + 1635, + 1295, + 1635 + ], + "score": 0.86, + "latex": "Y _ { i }" + }, + { + "category_id": 13, + "poly": [ + 613, + 1917, + 641, + 1917, + 641, + 1943, + 613, + 1943 + ], + "score": 0.85, + "latex": "\\tau _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 878, + 1575, + 912, + 1575, + 912, + 1605, + 878, + 1605 + ], + "score": 0.83, + "latex": "A _ { i }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1791, + 325, + 1791, + 325, + 1818, + 298, + 1818 + ], + "score": 0.83, + "latex": "X" + }, + { + "category_id": 14, + "poly": [ + 373, + 1833, + 1268, + 1833, + 1268, + 1870, + 373, + 1870 + ], + "score": 0.82, + "latex": "H _ { 0 } : Q _ { 0 } ( x , 1 ) \\leq Q _ { 0 } ( x , 0 ) , \\forall x \\in \\mathbb { X } { \\mathrm { ~ ~ v e r s u s ~ } } H _ { 1 } : Q _ { 0 } ( x , 1 ) > Q _ { 0 } ( x , 0 ) , \\exists x \\in \\mathbb { X } ." + }, + { + "category_id": 13, + "poly": [ + 905, + 502, + 931, + 502, + 931, + 526, + 905, + 526 + ], + "score": 0.81, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 1158, + 1314, + 1187, + 1314, + 1187, + 1340, + 1158, + 1340 + ], + "score": 0.8, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 723, + 2009, + 739, + 2009, + 739, + 2035, + 723, + 2035 + ], + "score": 0.8, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1152, + 1192, + 1181, + 1192, + 1181, + 1219, + 1152, + 1219 + ], + "score": 0.8, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1165, + 1946, + 1191, + 1946, + 1191, + 1971, + 1165, + 1971 + ], + "score": 0.8, + "latex": "\\mathcal { Q }" + }, + { + "category_id": 13, + "poly": [ + 947, + 557, + 973, + 557, + 973, + 581, + 947, + 581 + ], + "score": 0.76, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 672, + 474, + 698, + 474, + 698, + 499, + 672, + 499 + ], + "score": 0.76, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 969, + 875, + 992, + 875, + 992, + 897, + 969, + 897 + ], + "score": 0.75, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 1372, + 1100, + 1402, + 1100, + 1402, + 1128, + 1372, + 1128 + ], + "score": 0.75, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1181, + 1763, + 1206, + 1763, + 1206, + 1787, + 1181, + 1787 + ], + "score": 0.75, + "latex": "\\mathbb { X }" + }, + { + "category_id": 13, + "poly": [ + 816, + 530, + 841, + 530, + 841, + 554, + 816, + 554 + ], + "score": 0.73, + "latex": "Y" + }, + { + "category_id": 13, + "poly": [ + 575, + 1607, + 588, + 1607, + 588, + 1632, + 575, + 1632 + ], + "score": 0.73, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 382, + 1944, + 407, + 1944, + 407, + 1970, + 382, + 1970 + ], + "score": 0.71, + "latex": "\\mathbb { X }" + }, + { + "category_id": 13, + "poly": [ + 769, + 1732, + 782, + 1732, + 782, + 1757, + 769, + 1757 + ], + "score": 0.71, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 298, + 502, + 321, + 502, + 321, + 526, + 298, + 526 + ], + "score": 0.7, + "latex": "Y" + }, + { + "category_id": 13, + "poly": [ + 1319, + 2005, + 1343, + 2005, + 1343, + 2030, + 1319, + 2030 + ], + "score": 0.69, + "latex": "\\mathbb { X }" + }, + { + "category_id": 13, + "poly": [ + 454, + 530, + 477, + 530, + 477, + 554, + 454, + 554 + ], + "score": 0.67, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 297, + 1542, + 312, + 1542, + 312, + 1567, + 297, + 1567 + ], + "score": 0.63, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1028, + 474, + 1051, + 474, + 1051, + 498, + 1028, + 498 + ], + "score": 0.62, + "latex": "A" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 473.0, + 671.0, + 473.0, + 671.0, + 503.0, + 295.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 473.0, + 1027.0, + 473.0, + 1027.0, + 503.0, + 699.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 473.0, + 1405.0, + 473.0, + 1405.0, + 503.0, + 1052.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 499.0, + 297.0, + 499.0, + 297.0, + 531.0, + 294.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 499.0, + 904.0, + 499.0, + 904.0, + 531.0, + 322.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 499.0, + 1404.0, + 499.0, + 1404.0, + 531.0, + 932.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 528.0, + 453.0, + 528.0, + 453.0, + 562.0, + 294.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 528.0, + 815.0, + 528.0, + 815.0, + 562.0, + 478.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 842.0, + 528.0, + 1407.0, + 528.0, + 1407.0, + 562.0, + 842.0, + 562.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 554.0, + 946.0, + 554.0, + 946.0, + 588.0, + 294.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 554.0, + 1405.0, + 554.0, + 1405.0, + 588.0, + 974.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 584.0, + 1405.0, + 584.0, + 1405.0, + 614.0, + 294.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 612.0, + 802.0, + 612.0, + 802.0, + 642.0, + 295.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 284.0, + 528.0, + 284.0, + 528.0, + 315.0, + 505.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 292.0, + 626.0, + 292.0, + 626.0, + 317.0, + 583.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 284.0, + 766.0, + 284.0, + 766.0, + 315.0, + 743.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 291.0, + 844.0, + 291.0, + 844.0, + 321.0, + 799.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 979.0, + 284.0, + 1002.0, + 284.0, + 1002.0, + 315.0, + 979.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1025.0, + 310.0, + 1072.0, + 310.0, + 1072.0, + 340.0, + 1025.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1120.0, + 310.0, + 1166.0, + 310.0, + 1166.0, + 340.0, + 1120.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 333.0, + 506.0, + 333.0, + 506.0, + 350.0, + 488.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 338.0, + 531.0, + 338.0, + 531.0, + 367.0, + 507.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 355.0, + 634.0, + 355.0, + 634.0, + 384.0, + 590.0, + 384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 333.0, + 742.0, + 333.0, + 742.0, + 349.0, + 724.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 339.0, + 766.0, + 339.0, + 766.0, + 367.0, + 743.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 821.0, + 348.0, + 864.0, + 348.0, + 864.0, + 376.0, + 821.0, + 376.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 960.0, + 332.0, + 977.0, + 332.0, + 977.0, + 349.0, + 960.0, + 349.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 339.0, + 1002.0, + 339.0, + 1002.0, + 367.0, + 980.0, + 367.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 389.0, + 530.0, + 389.0, + 530.0, + 420.0, + 507.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 390.0, + 766.0, + 390.0, + 766.0, + 421.0, + 743.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 979.0, + 389.0, + 1002.0, + 389.0, + 1002.0, + 420.0, + 979.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 412.0, + 714.0, + 412.0, + 714.0, + 435.0, + 526.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 412.0, + 951.0, + 412.0, + 951.0, + 435.0, + 764.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 413.0, + 1186.0, + 413.0, + 1186.0, + 434.0, + 1000.0, + 434.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 610.0, + 433.0, + 631.0, + 433.0, + 631.0, + 456.0, + 610.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 846.0, + 434.0, + 866.0, + 434.0, + 866.0, + 455.0, + 846.0, + 455.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 433.0, + 1103.0, + 433.0, + 1103.0, + 456.0, + 1083.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1416.0, + 994.0, + 1416.0, + 994.0, + 1461.0, + 292.0, + 1461.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, + 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": [ + 296.0, + 1100.0, + 1371.0, + 1100.0, + 1371.0, + 1133.0, + 296.0, + 1133.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1130.0, + 1404.0, + 1130.0, + 1404.0, + 1163.0, + 295.0, + 1163.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1159.0, + 1406.0, + 1159.0, + 1406.0, + 1198.0, + 292.0, + 1198.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1189.0, + 1151.0, + 1189.0, + 1151.0, + 1227.0, + 292.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1182.0, + 1189.0, + 1406.0, + 1189.0, + 1406.0, + 1227.0, + 1182.0, + 1227.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1222.0, + 1406.0, + 1222.0, + 1406.0, + 1258.0, + 295.0, + 1258.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1253.0, + 1402.0, + 1253.0, + 1402.0, + 1286.0, + 296.0, + 1286.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1284.0, + 1402.0, + 1284.0, + 1402.0, + 1317.0, + 295.0, + 1317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1313.0, + 1157.0, + 1313.0, + 1157.0, + 1347.0, + 293.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1188.0, + 1313.0, + 1406.0, + 1313.0, + 1406.0, + 1347.0, + 1188.0, + 1347.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1344.0, + 1166.0, + 1344.0, + 1166.0, + 1377.0, + 296.0, + 1377.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1472.0, + 1403.0, + 1472.0, + 1403.0, + 1504.0, + 297.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1499.0, + 1405.0, + 1499.0, + 1405.0, + 1538.0, + 294.0, + 1538.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1517.0, + 296.0, + 1517.0, + 296.0, + 1597.0, + 283.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 1517.0, + 700.0, + 1517.0, + 700.0, + 1597.0, + 313.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 912.0, + 1517.0, + 1005.0, + 1517.0, + 1005.0, + 1597.0, + 912.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1065.0, + 1517.0, + 1416.0, + 1517.0, + 1416.0, + 1597.0, + 1065.0, + 1597.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1565.0, + 661.0, + 1565.0, + 661.0, + 1618.0, + 289.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 864.0, + 1565.0, + 877.0, + 1565.0, + 877.0, + 1618.0, + 864.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 913.0, + 1565.0, + 1410.0, + 1565.0, + 1410.0, + 1618.0, + 913.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1603.0, + 574.0, + 1603.0, + 574.0, + 1640.0, + 294.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 589.0, + 1603.0, + 760.0, + 1603.0, + 760.0, + 1640.0, + 589.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1603.0, + 1294.0, + 1603.0, + 1294.0, + 1640.0, + 865.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1325.0, + 1603.0, + 1405.0, + 1603.0, + 1405.0, + 1640.0, + 1325.0, + 1640.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1632.0, + 1088.0, + 1632.0, + 1088.0, + 1669.0, + 292.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1122.0, + 1632.0, + 1269.0, + 1632.0, + 1269.0, + 1669.0, + 1122.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 1632.0, + 1407.0, + 1632.0, + 1407.0, + 1669.0, + 1305.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1661.0, + 444.0, + 1661.0, + 444.0, + 1703.0, + 292.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 1661.0, + 1407.0, + 1661.0, + 1407.0, + 1703.0, + 654.0, + 1703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1690.0, + 477.0, + 1690.0, + 477.0, + 1735.0, + 292.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 551.0, + 1690.0, + 601.0, + 1690.0, + 601.0, + 1735.0, + 551.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 1690.0, + 1407.0, + 1690.0, + 1407.0, + 1735.0, + 676.0, + 1735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1709.0, + 768.0, + 1709.0, + 768.0, + 1797.0, + 283.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 1709.0, + 909.0, + 1709.0, + 909.0, + 1797.0, + 783.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1709.0, + 1416.0, + 1709.0, + 1416.0, + 1797.0, + 1401.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1788.0, + 297.0, + 1788.0, + 297.0, + 1827.0, + 292.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1788.0, + 376.0, + 1788.0, + 376.0, + 1827.0, + 326.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 1788.0, + 758.0, + 1788.0, + 758.0, + 1827.0, + 718.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 1788.0, + 1378.0, + 1788.0, + 1378.0, + 1827.0, + 854.0, + 1827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 840.0, + 1404.0, + 840.0, + 1404.0, + 873.0, + 296.0, + 873.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 870.0, + 968.0, + 870.0, + 968.0, + 905.0, + 292.0, + 905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 993.0, + 870.0, + 1406.0, + 870.0, + 1406.0, + 905.0, + 993.0, + 905.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 901.0, + 1403.0, + 901.0, + 1403.0, + 935.0, + 294.0, + 935.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 931.0, + 1405.0, + 931.0, + 1405.0, + 965.0, + 296.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 961.0, + 1406.0, + 961.0, + 1406.0, + 996.0, + 292.0, + 996.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 991.0, + 1406.0, + 991.0, + 1406.0, + 1026.0, + 292.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1020.0, + 1408.0, + 1020.0, + 1408.0, + 1058.0, + 292.0, + 1058.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1052.0, + 1276.0, + 1052.0, + 1276.0, + 1090.0, + 294.0, + 1090.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 669.0, + 1404.0, + 669.0, + 1404.0, + 703.0, + 294.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 701.0, + 1404.0, + 701.0, + 1404.0, + 735.0, + 296.0, + 735.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 727.0, + 1407.0, + 727.0, + 1407.0, + 770.0, + 292.0, + 770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 756.0, + 1407.0, + 756.0, + 1407.0, + 801.0, + 292.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 792.0, + 1294.0, + 792.0, + 1294.0, + 829.0, + 294.0, + 829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1877.0, + 815.0, + 1877.0, + 815.0, + 1917.0, + 292.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 898.0, + 1877.0, + 1251.0, + 1877.0, + 1251.0, + 1917.0, + 898.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1877.0, + 1407.0, + 1877.0, + 1407.0, + 1917.0, + 1403.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1907.0, + 376.0, + 1907.0, + 376.0, + 1949.0, + 293.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 1907.0, + 612.0, + 1907.0, + 612.0, + 1949.0, + 525.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 642.0, + 1907.0, + 927.0, + 1907.0, + 927.0, + 1949.0, + 642.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1220.0, + 1907.0, + 1408.0, + 1907.0, + 1408.0, + 1949.0, + 1220.0, + 1949.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1942.0, + 381.0, + 1942.0, + 381.0, + 1975.0, + 294.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 1942.0, + 1164.0, + 1942.0, + 1164.0, + 1975.0, + 408.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1192.0, + 1942.0, + 1403.0, + 1942.0, + 1403.0, + 1975.0, + 1192.0, + 1975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1970.0, + 469.0, + 1970.0, + 469.0, + 2007.0, + 292.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 1970.0, + 714.0, + 1970.0, + 714.0, + 2007.0, + 508.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1322.0, + 1970.0, + 1405.0, + 1970.0, + 1405.0, + 2007.0, + 1322.0, + 2007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 2002.0, + 615.0, + 2002.0, + 615.0, + 2037.0, + 293.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 2002.0, + 722.0, + 2002.0, + 722.0, + 2037.0, + 674.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 2002.0, + 1318.0, + 2002.0, + 1318.0, + 2037.0, + 740.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 2002.0, + 1405.0, + 2002.0, + 1405.0, + 2037.0, + 1344.0, + 2037.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 1, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 295, + 1281, + 1407, + 1281, + 1407, + 1498, + 295, + 1498 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 297, + 628, + 1405, + 628, + 1405, + 815, + 297, + 815 + ], + "score": 0.98 + }, + { + "category_id": 1, + "poly": [ + 295, + 1694, + 1409, + 1694, + 1409, + 1867, + 295, + 1867 + ], + "score": 0.98 + }, + { + "category_id": 8, + "poly": [ + 427, + 1554, + 1224, + 1554, + 1224, + 1683, + 427, + 1683 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 1404, + 228, + 1404, + 323, + 298, + 323 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 526, + 1162, + 1094, + 1162, + 1094, + 1271, + 526, + 1271 + ], + "score": 0.961 + }, + { + "category_id": 1, + "poly": [ + 295, + 1087, + 1402, + 1087, + 1402, + 1152, + 295, + 1152 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 296, + 1968, + 1403, + 1968, + 1403, + 2038, + 296, + 2038 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 299, + 465, + 1399, + 465, + 1399, + 531, + 299, + 531 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 490, + 882, + 1150, + 882, + 1150, + 926, + 490, + 926 + ], + "score": 0.936 + }, + { + "category_id": 8, + "poly": [ + 310, + 1877, + 1328, + 1877, + 1328, + 1956, + 310, + 1956 + ], + "score": 0.932 + }, + { + "category_id": 8, + "poly": [ + 364, + 334, + 1277, + 334, + 1277, + 377, + 364, + 377 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 299, + 384, + 1404, + 384, + 1404, + 454, + 299, + 454 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 296, + 550, + 1383, + 550, + 1383, + 620, + 296, + 620 + ], + "score": 0.917 + }, + { + "category_id": 1, + "poly": [ + 289, + 1510, + 1350, + 1510, + 1350, + 1545, + 289, + 1545 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 295, + 837, + 1153, + 837, + 1153, + 872, + 295, + 872 + ], + "score": 0.907 + }, + { + "category_id": 0, + "poly": [ + 297, + 1031, + 1004, + 1031, + 1004, + 1065, + 297, + 1065 + ], + "score": 0.904 + }, + { + "category_id": 2, + "poly": [ + 297, + 74, + 855, + 74, + 855, + 106, + 297, + 106 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1365, + 341, + 1400, + 341, + 1400, + 372, + 1365, + 372 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1632, + 1400, + 1632, + 1400, + 1662, + 1365, + 1662 + ], + "score": 0.872 + }, + { + "category_id": 9, + "poly": [ + 1366, + 1890, + 1401, + 1890, + 1401, + 1921, + 1366, + 1921 + ], + "score": 0.851 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 859, + 2087, + 859, + 2113, + 841, + 2113 + ], + "score": 0.657 + }, + { + "category_id": 1, + "poly": [ + 299, + 962, + 931, + 962, + 931, + 1000, + 299, + 1000 + ], + "score": 0.549 + }, + { + "category_id": 2, + "poly": [ + 841, + 2087, + 860, + 2087, + 860, + 2113, + 841, + 2113 + ], + "score": 0.536 + }, + { + "category_id": 0, + "poly": [ + 299, + 962, + 931, + 962, + 931, + 1000, + 299, + 1000 + ], + "score": 0.399 + }, + { + "category_id": 13, + "poly": [ + 615, + 1697, + 733, + 1697, + 733, + 1731, + 615, + 1731 + ], + "score": 0.94, + "latex": "\\beta _ { 0 } ^ { * } ~ = ~ \\beta _ { 1 } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1037, + 467, + 1128, + 467, + 1128, + 499, + 1037, + 499 + ], + "score": 0.94, + "latex": "\\mathcal { F } _ { 0 } = \\emptyset" + }, + { + "category_id": 13, + "poly": [ + 1208, + 585, + 1267, + 585, + 1267, + 616, + 1208, + 616 + ], + "score": 0.94, + "latex": "\\mathcal { F } _ { i - 1 }" + }, + { + "category_id": 13, + "poly": [ + 572, + 1288, + 698, + 1288, + 698, + 1323, + 572, + 1323 + ], + "score": 0.93, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 14, + "poly": [ + 527, + 1160, + 1097, + 1160, + 1097, + 1271, + 527, + 1271 + ], + "score": 0.93, + "latex": "\\widehat { \\beta } _ { a } ( t ) = { \\widehat \\Sigma } _ { a } ^ { - 1 } ( t ) \\left\\{ \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\right\\}" + }, + { + "category_id": 13, + "poly": [ + 755, + 1322, + 821, + 1322, + 821, + 1361, + 755, + 1361 + ], + "score": 0.93, + "latex": "\\widehat { \\Sigma } _ { a } ( t )" + }, + { + "category_id": 14, + "poly": [ + 425, + 1553, + 1218, + 1553, + 1218, + 1687, + 425, + 1687 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { S ( t ) \\le \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} + \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) } \\\\ { \\le \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1185, + 1696, + 1267, + 1696, + 1267, + 1730, + 1185, + 1730 + ], + "score": 0.92, + "latex": "\\pi ^ { * } ( \\cdot , \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 639, + 466, + 867, + 466, + 867, + 502, + 639, + 502 + ], + "score": 0.92, + "latex": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { 1 \\leq i \\leq j }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1735, + 428, + 1735, + 428, + 1771, + 298, + 1771 + ], + "score": 0.92, + "latex": "\\{ 0 , 1 \\} \\times \\mathbb { X }" + }, + { + "category_id": 14, + "poly": [ + 311, + 1875, + 1328, + 1875, + 1328, + 1958, + 311, + 1958 + ], + "score": 0.92, + "latex": "B ( t ) \\equiv \\sqrt { N ( t ) } \\{ \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} \\stackrel { d } { } N ( 0 , \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } ) , \\mathrm { a s } N ( t ) \\infty ," + }, + { + "category_id": 13, + "poly": [ + 789, + 1281, + 1359, + 1281, + 1359, + 1325, + 789, + 1325 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\widehat { \\Sigma } _ { a } ( t ) = N ^ { - 1 } ( t ) \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 1358, + 732, + 1358, + 732, + 1399, + 297, + 1399 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { S ( t ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ \\widehat \\beta _ { 1 } ( t ) - \\widehat \\beta _ { 0 } ( t ) \\} } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1269, + 1363, + 1322, + 1363, + 1322, + 1398, + 1269, + 1398 + ], + "score": 0.92, + "latex": "S ( t )" + }, + { + "category_id": 13, + "poly": [ + 356, + 552, + 725, + 552, + 725, + 586, + 356, + 586 + ], + "score": 0.91, + "latex": "Y _ { i } = A _ { i } Y _ { i } ^ { * } ( 1 ) + ( 1 - A _ { i } ) Y _ { i } ^ { * } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 987, + 1364, + 1039, + 1364, + 1039, + 1397, + 987, + 1397 + ], + "score": 0.91, + "latex": "S ( t )" + }, + { + "category_id": 13, + "poly": [ + 1159, + 1513, + 1211, + 1513, + 1211, + 1546, + 1159, + 1546 + ], + "score": 0.91, + "latex": "S ( t )" + }, + { + "category_id": 13, + "poly": [ + 583, + 1729, + 1253, + 1729, + 1253, + 1772, + 583, + 1772 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { { \\mathrm { E } } ^ { X } | \\sum _ { i = 1 } ^ { n } n ^ { - 1 } \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) | \\ \\stackrel { P } { \\to } \\ 0 , \\forall a \\ \\in \\ \\{ 0 , 1 \\} } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1094, + 1395, + 1146, + 1395, + 1146, + 1428, + 1094, + 1428 + ], + "score": 0.9, + "latex": "S ( t )" + }, + { + "category_id": 13, + "poly": [ + 743, + 1969, + 1202, + 1969, + 1202, + 2006, + 743, + 2006 + ], + "score": 0.9, + "latex": "\\Phi _ { a } = \\mathrm { E } \\pi ^ { * } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X )" + }, + { + "category_id": 13, + "poly": [ + 1268, + 1970, + 1403, + 1970, + 1403, + 2006, + 1268, + 2006 + ], + "score": 0.9, + "latex": "\\sigma ^ { 2 } ( a , x ) =" + }, + { + "category_id": 13, + "poly": [ + 374, + 1773, + 833, + 1773, + 833, + 1807, + 374, + 1807 + ], + "score": 0.9, + "latex": "\\pi _ { n } ( \\cdot , \\cdot ) = \\operatorname* { P r } ( A _ { n } = a | X _ { n } = x , { \\mathcal { F } } _ { n - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 577, + 293, + 615, + 293, + 615, + 323, + 577, + 323 + ], + "score": 0.9, + "latex": "Q _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 913, + 468, + 984, + 468, + 984, + 500, + 913, + 500 + ], + "score": 0.9, + "latex": "j \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 811, + 1429, + 1214, + 1429, + 1214, + 1470, + 811, + 1470 + ], + "score": 0.89, + "latex": "d ( x ) = \\arg \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\varphi ^ { \\top } ( x ) \\widehat { \\beta } _ { a } ( t )" + }, + { + "category_id": 13, + "poly": [ + 820, + 1365, + 857, + 1365, + 857, + 1395, + 820, + 1395 + ], + "score": 0.89, + "latex": "H _ { 0 }" + }, + { + "category_id": 14, + "poly": [ + 493, + 880, + 1148, + 880, + 1148, + 924, + 493, + 924 + ], + "score": 0.89, + "latex": "E [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ^ { * } \\} ] = 0 , \\forall a \\in \\{ 0 , 1 \\} , i \\geq 1 ." + }, + { + "category_id": 13, + "poly": [ + 1223, + 1091, + 1255, + 1091, + 1255, + 1121, + 1223, + 1121 + ], + "score": 0.89, + "latex": "\\beta _ { a }" + }, + { + "category_id": 13, + "poly": [ + 608, + 385, + 915, + 385, + 915, + 419, + 608, + 419 + ], + "score": 0.89, + "latex": "Q _ { 0 } ( x , a ) = Q ( x , a ; \\beta _ { 0 } ^ { * } , \\beta _ { 1 } ^ { * } )" + }, + { + "category_id": 13, + "poly": [ + 1301, + 1514, + 1338, + 1514, + 1338, + 1543, + 1301, + 1543 + ], + "score": 0.89, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 342, + 469, + 377, + 469, + 377, + 501, + 342, + 501 + ], + "score": 0.88, + "latex": "{ \\mathcal { F } } _ { j }" + }, + { + "category_id": 13, + "poly": [ + 1121, + 585, + 1157, + 585, + 1157, + 614, + 1121, + 614 + ], + "score": 0.88, + "latex": "X _ { i }" + }, + { + "category_id": 13, + "poly": [ + 949, + 1397, + 987, + 1397, + 987, + 1426, + 949, + 1426 + ], + "score": 0.88, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 2003, + 686, + 2003, + 686, + 2037, + 297, + 2037 + ], + "score": 0.88, + "latex": "\\operatorname { E } [ \\{ Y ^ { * } ( a ) - \\varphi ^ { \\top } ( X ) \\beta _ { a } \\} ^ { 2 } | X = x ]" + }, + { + "category_id": 13, + "poly": [ + 785, + 1091, + 823, + 1091, + 823, + 1120, + 785, + 1120 + ], + "score": 0.88, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 767, + 553, + 847, + 553, + 847, + 582, + 767, + 582 + ], + "score": 0.87, + "latex": "\\forall i \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 297, + 1432, + 336, + 1432, + 336, + 1464, + 297, + 1464 + ], + "score": 0.87, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 687, + 1398, + 724, + 1398, + 724, + 1427, + 687, + 1427 + ], + "score": 0.87, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1081, + 1770, + 1123, + 1770, + 1123, + 1802, + 1081, + 1802 + ], + "score": 0.87, + "latex": "\\operatorname { E } ^ { X }" + }, + { + "category_id": 13, + "poly": [ + 792, + 2005, + 874, + 2005, + 874, + 2032, + 792, + 2032 + ], + "score": 0.87, + "latex": "x \\in \\mathbb { X }" + }, + { + "category_id": 13, + "poly": [ + 1107, + 386, + 1138, + 386, + 1138, + 417, + 1107, + 417 + ], + "score": 0.86, + "latex": "\\beta _ { 1 } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 1023, + 386, + 1056, + 386, + 1056, + 418, + 1023, + 418 + ], + "score": 0.86, + "latex": "\\beta _ { 0 } ^ { * }" + }, + { + "category_id": 14, + "poly": [ + 366, + 332, + 1281, + 332, + 1281, + 376, + 366, + 376 + ], + "score": 0.86, + "latex": "H _ { 0 } : \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) \\leq 0 , \\forall x \\in \\mathbb { X } \\mathrm { ~ \\mathrm { ~ v e r s u s ~ } ~ } H _ { 1 } : \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } ^ { * } - \\beta _ { 0 } ^ { * } ) > 0 , \\exists x \\in \\mathbb { X } ." + }, + { + "category_id": 13, + "poly": [ + 356, + 585, + 389, + 585, + 389, + 614, + 356, + 614 + ], + "score": 0.86, + "latex": "A _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1292, + 1742, + 1393, + 1742, + 1393, + 1767, + 1292, + 1767 + ], + "score": 0.85, + "latex": "n \\infty" + }, + { + "category_id": 13, + "poly": [ + 760, + 583, + 1050, + 583, + 1050, + 618, + 760, + 618 + ], + "score": 0.84, + "latex": "\\{ ( X _ { k } , Y _ { k } ^ { * } ( 0 ) , Y _ { k } ^ { * } ( 1 ) ) \\} _ { k > i }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1806, + 325, + 1806, + 325, + 1833, + 297, + 1833 + ], + "score": 0.82, + "latex": "X" + }, + { + "category_id": 13, + "poly": [ + 465, + 838, + 508, + 838, + 508, + 872, + 465, + 872 + ], + "score": 0.81, + "latex": "\\mathbb { I } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 375, + 1970, + 729, + 1970, + 729, + 2003, + 375, + 2003 + ], + "score": 0.81, + "latex": "\\Sigma _ { a } = \\mathrm { E } \\pi ^ { * } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X )" + }, + { + "category_id": 13, + "poly": [ + 421, + 237, + 438, + 237, + 438, + 263, + 421, + 263 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 610, + 419, + 1235, + 419, + 1235, + 454, + 610, + 454 + ], + "score": 0.77, + "latex": "\\begin{array} { r } { \\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 591, + 585, + 746, + 585, + 746, + 618, + 591, + 618 + ], + "score": 0.76, + "latex": "Y _ { i } ^ { * } ( 0 ) , Y _ { i } ^ { * } ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 511, + 1293, + 525, + 1293, + 525, + 1317, + 511, + 1317 + ], + "score": 0.75, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1365, + 588, + 1376, + 588, + 1376, + 611, + 1365, + 611 + ], + "score": 0.67, + "latex": "i" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1031.0, + 1006.0, + 1031.0, + 1006.0, + 1066.0, + 294.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 856.0, + 72.0, + 856.0, + 109.0, + 297.0, + 109.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": [ + 837.0, + 2085.0, + 862.0, + 2085.0, + 862.0, + 2119.0, + 837.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 957.0, + 933.0, + 957.0, + 933.0, + 1007.0, + 290.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 283.0, + 1267.0, + 510.0, + 1267.0, + 510.0, + 1341.0, + 283.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 526.0, + 1267.0, + 571.0, + 1267.0, + 571.0, + 1341.0, + 526.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1267.0, + 788.0, + 1267.0, + 788.0, + 1341.0, + 699.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1360.0, + 1267.0, + 1417.0, + 1267.0, + 1417.0, + 1341.0, + 1360.0, + 1341.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1323.0, + 754.0, + 1323.0, + 754.0, + 1363.0, + 292.0, + 1363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 822.0, + 1323.0, + 1406.0, + 1323.0, + 1406.0, + 1363.0, + 822.0, + 1363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1360.0, + 296.0, + 1360.0, + 296.0, + 1401.0, + 293.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1360.0, + 819.0, + 1360.0, + 819.0, + 1401.0, + 733.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1360.0, + 986.0, + 1360.0, + 986.0, + 1401.0, + 858.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1360.0, + 1268.0, + 1360.0, + 1268.0, + 1401.0, + 1040.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 1360.0, + 1408.0, + 1360.0, + 1408.0, + 1401.0, + 1323.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1393.0, + 686.0, + 1393.0, + 686.0, + 1432.0, + 293.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 725.0, + 1393.0, + 948.0, + 1393.0, + 948.0, + 1432.0, + 725.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 1393.0, + 1093.0, + 1393.0, + 1093.0, + 1432.0, + 988.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 1393.0, + 1406.0, + 1393.0, + 1406.0, + 1432.0, + 1147.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1427.0, + 296.0, + 1427.0, + 296.0, + 1472.0, + 290.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 1427.0, + 810.0, + 1427.0, + 810.0, + 1472.0, + 337.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 1427.0, + 1408.0, + 1427.0, + 1408.0, + 1472.0, + 1215.0, + 1472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1464.0, + 495.0, + 1464.0, + 495.0, + 1497.0, + 293.0, + 1497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 1297.5, + 1057.0, + 1297.5, + 1057.0, + 1313.5, + 1016.0, + 1313.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 631.0, + 1402.0, + 631.0, + 1402.0, + 663.0, + 297.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 660.0, + 1405.0, + 660.0, + 1405.0, + 695.0, + 294.0, + 695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 689.0, + 1405.0, + 689.0, + 1405.0, + 725.0, + 295.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 719.0, + 1405.0, + 719.0, + 1405.0, + 757.0, + 294.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 751.0, + 1406.0, + 751.0, + 1406.0, + 787.0, + 294.0, + 787.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 782.0, + 867.0, + 782.0, + 867.0, + 816.0, + 295.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1693.0, + 614.0, + 1693.0, + 614.0, + 1734.0, + 293.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 1693.0, + 1184.0, + 1693.0, + 1184.0, + 1734.0, + 734.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 1693.0, + 1406.0, + 1693.0, + 1406.0, + 1734.0, + 1268.0, + 1734.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1720.0, + 297.0, + 1720.0, + 297.0, + 1784.0, + 288.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 1720.0, + 582.0, + 1720.0, + 582.0, + 1784.0, + 429.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1254.0, + 1720.0, + 1291.0, + 1720.0, + 1291.0, + 1784.0, + 1254.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1720.0, + 1415.0, + 1720.0, + 1415.0, + 1784.0, + 1394.0, + 1784.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1770.0, + 373.0, + 1770.0, + 373.0, + 1811.0, + 293.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 1770.0, + 1080.0, + 1770.0, + 1080.0, + 1811.0, + 834.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 1770.0, + 1407.0, + 1770.0, + 1407.0, + 1811.0, + 1124.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1802.0, + 1405.0, + 1802.0, + 1405.0, + 1838.0, + 326.0, + 1838.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1832.0, + 975.0, + 1832.0, + 975.0, + 1867.0, + 294.0, + 1867.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 420.0, + 228.0, + 420.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 439.0, + 228.0, + 1405.0, + 228.0, + 1405.0, + 266.0, + 439.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 262.0, + 1404.0, + 262.0, + 1404.0, + 296.0, + 296.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 293.0, + 576.0, + 293.0, + 576.0, + 327.0, + 296.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 293.0, + 1053.0, + 293.0, + 1053.0, + 327.0, + 616.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1083.0, + 784.0, + 1083.0, + 784.0, + 1126.0, + 293.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 824.0, + 1083.0, + 1222.0, + 1083.0, + 1222.0, + 1126.0, + 824.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1256.0, + 1083.0, + 1404.0, + 1083.0, + 1404.0, + 1126.0, + 1256.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1122.0, + 655.0, + 1122.0, + 655.0, + 1154.0, + 297.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1967.0, + 374.0, + 1967.0, + 374.0, + 2008.0, + 295.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 1967.0, + 742.0, + 1967.0, + 742.0, + 2008.0, + 730.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1203.0, + 1967.0, + 1267.0, + 1967.0, + 1267.0, + 2008.0, + 1203.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1996.0, + 296.0, + 1996.0, + 296.0, + 2039.0, + 291.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1996.0, + 791.0, + 1996.0, + 791.0, + 2039.0, + 687.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 1996.0, + 1406.0, + 1996.0, + 1406.0, + 2039.0, + 875.0, + 2039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 459.0, + 341.0, + 459.0, + 341.0, + 508.0, + 292.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 459.0, + 638.0, + 459.0, + 638.0, + 508.0, + 378.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 459.0, + 912.0, + 459.0, + 912.0, + 508.0, + 868.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 459.0, + 1036.0, + 459.0, + 1036.0, + 508.0, + 985.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 459.0, + 1405.0, + 459.0, + 1405.0, + 508.0, + 1129.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 497.0, + 881.0, + 497.0, + 881.0, + 532.0, + 295.0, + 532.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 379.0, + 607.0, + 379.0, + 607.0, + 423.0, + 293.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 916.0, + 379.0, + 1022.0, + 379.0, + 1022.0, + 423.0, + 916.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1057.0, + 379.0, + 1106.0, + 379.0, + 1106.0, + 423.0, + 1057.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1139.0, + 379.0, + 1404.0, + 379.0, + 1404.0, + 423.0, + 1139.0, + 423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 408.0, + 609.0, + 408.0, + 609.0, + 458.0, + 292.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 408.0, + 1405.0, + 408.0, + 1405.0, + 458.0, + 1236.0, + 458.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 549.0, + 355.0, + 549.0, + 355.0, + 590.0, + 294.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 549.0, + 766.0, + 549.0, + 766.0, + 590.0, + 726.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 549.0, + 859.0, + 549.0, + 859.0, + 590.0, + 848.0, + 590.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 578.0, + 355.0, + 578.0, + 355.0, + 624.0, + 293.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 390.0, + 578.0, + 590.0, + 578.0, + 590.0, + 624.0, + 390.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 578.0, + 759.0, + 578.0, + 759.0, + 624.0, + 747.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1051.0, + 578.0, + 1120.0, + 578.0, + 1120.0, + 624.0, + 1051.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1158.0, + 578.0, + 1207.0, + 578.0, + 1207.0, + 624.0, + 1158.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 578.0, + 1364.0, + 578.0, + 1364.0, + 624.0, + 1268.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 578.0, + 1391.0, + 578.0, + 1391.0, + 624.0, + 1377.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1508.0, + 1158.0, + 1508.0, + 1158.0, + 1551.0, + 295.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1212.0, + 1508.0, + 1300.0, + 1508.0, + 1300.0, + 1551.0, + 1212.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 1508.0, + 1350.0, + 1508.0, + 1350.0, + 1551.0, + 1339.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 836.0, + 464.0, + 836.0, + 464.0, + 875.0, + 296.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 509.0, + 836.0, + 1154.0, + 836.0, + 1154.0, + 875.0, + 509.0, + 875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 957.0, + 933.0, + 957.0, + 933.0, + 1007.0, + 290.0, + 1007.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 2, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 306, + 1405, + 306, + 1405, + 555, + 296, + 555 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 296, + 1752, + 1405, + 1752, + 1405, + 1909, + 296, + 1909 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 296, + 1479, + 1409, + 1479, + 1409, + 1573, + 296, + 1573 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 298, + 1256, + 1406, + 1256, + 1406, + 1354, + 298, + 1354 + ], + "score": 0.974 + }, + { + "category_id": 8, + "poly": [ + 296, + 1583, + 1520, + 1583, + 1520, + 1725, + 296, + 1725 + ], + "score": 0.968 + }, + { + "category_id": 1, + "poly": [ + 298, + 1135, + 1406, + 1135, + 1406, + 1232, + 298, + 1232 + ], + "score": 0.963 + }, + { + "category_id": 1, + "poly": [ + 293, + 228, + 1400, + 228, + 1400, + 293, + 293, + 293 + ], + "score": 0.954 + }, + { + "category_id": 1, + "poly": [ + 298, + 567, + 1398, + 567, + 1398, + 636, + 298, + 636 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 505, + 653, + 1136, + 653, + 1136, + 728, + 505, + 728 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 402, + 1040, + 1240, + 1040, + 1240, + 1119, + 402, + 1119 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 402, + 1370, + 1246, + 1370, + 1246, + 1464, + 402, + 1464 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 478, + 822, + 1161, + 822, + 1161, + 900, + 478, + 900 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 293, + 961, + 1407, + 961, + 1407, + 1025, + 293, + 1025 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 297, + 742, + 1400, + 742, + 1400, + 808, + 297, + 808 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 297, + 914, + 947, + 914, + 947, + 949, + 297, + 949 + ], + "score": 0.932 + }, + { + "category_id": 8, + "poly": [ + 485, + 1994, + 1154, + 1994, + 1154, + 2037, + 485, + 2037 + ], + "score": 0.926 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.912 + }, + { + "category_id": 8, + "poly": [ + 500, + 1923, + 1142, + 1923, + 1142, + 1961, + 500, + 1961 + ], + "score": 0.911 + }, + { + "category_id": 9, + "poly": [ + 1365, + 845, + 1401, + 845, + 1401, + 875, + 1365, + 875 + ], + "score": 0.871 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1401, + 1401, + 1401, + 1401, + 1432, + 1365, + 1432 + ], + "score": 0.869 + }, + { + "category_id": 9, + "poly": [ + 1365, + 2004, + 1401, + 2004, + 1401, + 2034, + 1365, + 2034 + ], + "score": 0.866 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1928, + 1401, + 1928, + 1401, + 1957, + 1365, + 1957 + ], + "score": 0.865 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2111, + 840, + 2111 + ], + "score": 0.781 + }, + { + "category_id": 14, + "poly": [ + 506, + 651, + 1138, + 651, + 1138, + 729, + 506, + 729 + ], + "score": 0.94, + "latex": "\\operatorname* { P r } \\bigg ( \\operatorname* { m a x } _ { k \\in \\{ 1 , \\dots , K \\} } \\{ \\sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \\} > 0 \\bigg ) \\leq \\alpha + o ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 1281, + 744, + 1350, + 744, + 1350, + 778, + 1281, + 778 + ], + "score": 0.93, + "latex": "\\{ z _ { k } \\} _ { k }" + }, + { + "category_id": 14, + "poly": [ + 400, + 1369, + 1241, + 1369, + 1241, + 1464, + 400, + 1464 + ], + "score": 0.93, + "latex": "\\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } E \\left| \\sum _ { i = 1 } ^ { k } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right| \\leq O ( 1 ) q k ^ { 1 - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } k , \\forall k \\geq j _ { n } ," + }, + { + "category_id": 13, + "poly": [ + 524, + 460, + 596, + 460, + 596, + 493, + 524, + 493 + ], + "score": 0.93, + "latex": "N ( t _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 635, + 602, + 790, + 602, + 790, + 635, + 635, + 635 + ], + "score": 0.93, + "latex": "k = 1 , \\ldots , K" + }, + { + "category_id": 13, + "poly": [ + 618, + 1784, + 690, + 1784, + 690, + 1818, + 618, + 1818 + ], + "score": 0.92, + "latex": "\\bar { N ( t _ { 1 } ) }" + }, + { + "category_id": 13, + "poly": [ + 455, + 962, + 524, + 962, + 524, + 995, + 455, + 995 + ], + "score": 0.92, + "latex": "\\{ z _ { k } \\} _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1270, + 460, + 1338, + 460, + 1338, + 494, + 1270, + 494 + ], + "score": 0.92, + "latex": "B ( t _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 346, + 1168, + 495, + 1168, + 495, + 1202, + 346, + 1202 + ], + "score": 0.92, + "latex": "\\{ z _ { k } \\} _ { k = 1 , . . . , K }" + }, + { + "category_id": 14, + "poly": [ + 402, + 1040, + 1241, + 1040, + 1241, + 1120, + 402, + 1120 + ], + "score": 0.92, + "latex": "\\mathrm { C o v } ( G ( t ) , G ( t ^ { \\prime } ) ) = N ^ { 1 / 2 } ( t ) N ^ { - 1 / 2 } ( t ^ { \\prime } ) \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } , \\forall 0 < t \\leq t ^ { \\prime } ." + }, + { + "category_id": 13, + "poly": [ + 1094, + 604, + 1269, + 604, + 1269, + 635, + 1094, + 635 + ], + "score": 0.92, + "latex": "z _ { 1 } , \\dotsc , z _ { K } > 0" + }, + { + "category_id": 13, + "poly": [ + 904, + 1480, + 1232, + 1480, + 1232, + 1515, + 904, + 1515 + ], + "score": 0.92, + "latex": "N ^ { \\alpha _ { 0 } } ( t _ { 1 } ) / \\log ^ { \\alpha _ { 0 } } N ( t _ { 1 } ) \\gg q ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 393, + 1319, + 614, + 1319, + 614, + 1354, + 393, + 1354 + ], + "score": 0.92, + "latex": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }" + }, + { + "category_id": 14, + "poly": [ + 480, + 821, + 1162, + 821, + 1162, + 899, + 480, + 899 + ], + "score": 0.92, + "latex": "\\operatorname* { P r } \\left\\{ \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left( \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} \\leq \\alpha + o ( 1 ) ," + }, + { + "category_id": 13, + "poly": [ + 433, + 1845, + 606, + 1845, + 606, + 1881, + 433, + 1881 + ], + "score": 0.92, + "latex": "\\scriptstyle \\sum _ { i = 1 } ^ { n } { n ^ { - 1 } \\pi _ { i - 1 } }" + }, + { + "category_id": 13, + "poly": [ + 981, + 993, + 1037, + 993, + 1037, + 1026, + 981, + 1026 + ], + "score": 0.91, + "latex": "G ( t )" + }, + { + "category_id": 14, + "poly": [ + 310, + 1582, + 1428, + 1582, + 1428, + 1727, + 310, + 1727 + ], + "score": 0.91, + "latex": "\\begin{array} { r l r } { { \\operatorname* { s u p } _ { 1 , \\ldots , z _ { K } } P r \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { K } ) - z _ { k } ) > 0 \\} - P r \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { K } ) - z _ { k } ) \\} } } \\\\ & { } & { \\leq c q ^ { 3 / 4 } N ^ { - 1 / 8 } ( t _ { 1 } ) \\log ^ { 1 5 / 8 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K N ( t _ { 1 } ) \\} } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 399, + 760, + 399, + 760, + 433, + 297, + 433 + ], + "score": 0.91, + "latex": "t _ { k } = \\operatorname* { i n f } _ { t } \\{ N ( t ) \\geq N ( t _ { k - 1 } ) + 1 \\} , \\forall k \\geq 2" + }, + { + "category_id": 13, + "poly": [ + 299, + 599, + 524, + 599, + 524, + 638, + 299, + 638 + ], + "score": 0.91, + "latex": "\\sqrt { N ( t _ { k } ) } S ( t _ { k } ) \\geq z _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1283, + 1259, + 1372, + 1259, + 1372, + 1292, + 1283, + 1292 + ], + "score": 0.91, + "latex": "\\left| Y ^ { * } ( a ) \\right|" + }, + { + "category_id": 13, + "poly": [ + 619, + 915, + 673, + 915, + 673, + 949, + 619, + 949 + ], + "score": 0.91, + "latex": "B ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 985, + 1259, + 1225, + 1259, + 1225, + 1292, + 985, + 1292 + ], + "score": 0.91, + "latex": "\\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\pi ^ { * } ( a , x ) > 0" + }, + { + "category_id": 13, + "poly": [ + 1196, + 1322, + 1343, + 1322, + 1343, + 1354, + 1196, + 1354 + ], + "score": 0.91, + "latex": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 843, + 1292, + 978, + 1292, + 978, + 1321, + 843, + 1321 + ], + "score": 0.91, + "latex": "0 < \\alpha _ { 0 } \\le 1" + }, + { + "category_id": 13, + "poly": [ + 1300, + 1137, + 1352, + 1137, + 1352, + 1170, + 1300, + 1170 + ], + "score": 0.91, + "latex": "G ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 587, + 338, + 894, + 338, + 894, + 372, + 587, + 372 + ], + "score": 0.9, + "latex": "t _ { 1 } , t _ { 2 } , \\ldots , t _ { K } \\in [ 0 , \\ldots , T ]" + }, + { + "category_id": 13, + "poly": [ + 1289, + 1481, + 1403, + 1481, + 1403, + 1515, + 1289, + 1515 + ], + "score": 0.9, + "latex": "N ( t _ { 1 } ) \\gg" + }, + { + "category_id": 13, + "poly": [ + 1343, + 1168, + 1393, + 1168, + 1393, + 1201, + 1343, + 1201 + ], + "score": 0.9, + "latex": "\\dot { \\varphi } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1513, + 407, + 1513, + 407, + 1545, + 298, + 1545 + ], + "score": 0.9, + "latex": "\\log N ( T )" + }, + { + "category_id": 13, + "poly": [ + 774, + 1261, + 878, + 1261, + 878, + 1291, + 774, + 1291 + ], + "score": 0.9, + "latex": "a = 0 , 1" + }, + { + "category_id": 13, + "poly": [ + 1013, + 339, + 1395, + 339, + 1395, + 370, + 1013, + 370 + ], + "score": 0.9, + "latex": "0 < t _ { 1 } < t _ { 2 } < \\cdots < t _ { K } = T" + }, + { + "category_id": 13, + "poly": [ + 373, + 1481, + 433, + 1481, + 433, + 1514, + 373, + 1514 + ], + "score": 0.89, + "latex": "O ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 626, + 746, + 702, + 746, + 702, + 773, + 626, + 773 + ], + "score": 0.89, + "latex": "\\alpha > 0" + }, + { + "category_id": 13, + "poly": [ + 1041, + 1514, + 1097, + 1514, + 1097, + 1546, + 1041, + 1546 + ], + "score": 0.89, + "latex": "N ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 777, + 745, + 814, + 745, + 814, + 775, + 777, + 775 + ], + "score": 0.88, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 938, + 570, + 977, + 570, + 977, + 599, + 938, + 599 + ], + "score": 0.88, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1280, + 1292, + 1350, + 1292, + 1350, + 1322, + 1280, + 1322 + ], + "score": 0.88, + "latex": "\\{ j _ { n } \\} _ { n }" + }, + { + "category_id": 13, + "poly": [ + 1347, + 571, + 1375, + 571, + 1375, + 599, + 1347, + 599 + ], + "score": 0.87, + "latex": "t _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1018, + 432, + 1043, + 432, + 1043, + 460, + 1018, + 460 + ], + "score": 0.87, + "latex": "t _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1546, + 363, + 1546, + 363, + 1571, + 298, + 1571 + ], + "score": 0.86, + "latex": "c > 0" + }, + { + "category_id": 13, + "poly": [ + 416, + 370, + 445, + 370, + 445, + 396, + 416, + 396 + ], + "score": 0.84, + "latex": "K" + }, + { + "category_id": 14, + "poly": [ + 487, + 1994, + 1157, + 1994, + 1157, + 2037, + 487, + 2037 + ], + "score": 0.83, + "latex": "\\log ( K ) \\ll \\operatorname * { m i n } \\{ N ^ { 1 / 1 5 - 2 \\alpha ^ { * } / 5 } ( t _ { 1 } ) , N ^ { ( \\alpha _ { 0 } - 3 \\alpha ^ { * } ) / ( 5 + \\alpha _ { 0 } ) } ( t _ { 1 } ) \\} ." + }, + { + "category_id": 14, + "poly": [ + 501, + 1923, + 1139, + 1923, + 1139, + 1961, + 501, + 1961 + ], + "score": 0.83, + "latex": "q = O ( N ^ { \\alpha _ { * } } ( t _ { 1 } ) ) , \\mathrm { f o r s o m e } 0 \\leq \\alpha ^ { * } < \\operatorname* { m i n } ( 1 / 6 , \\alpha _ { 0 } / 3 ) ," + }, + { + "category_id": 13, + "poly": [ + 579, + 1821, + 611, + 1821, + 611, + 1846, + 579, + 1846 + ], + "score": 0.83, + "latex": "\\alpha _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 1175, + 1786, + 1203, + 1786, + 1203, + 1813, + 1175, + 1813 + ], + "score": 0.82, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 502, + 1822, + 519, + 1822, + 519, + 1846, + 502, + 1846 + ], + "score": 0.7, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1222, + 1200, + 1243, + 1200, + 1243, + 1226, + 1222, + 1226 + ], + "score": 0.34, + "latex": "\\mathbf { B }" + }, + { + "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, + 863.0, + 2086.0, + 863.0, + 2118.0, + 838.0, + 2118.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 308.0, + 1406.0, + 308.0, + 1406.0, + 342.0, + 296.0, + 342.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 337.0, + 586.0, + 337.0, + 586.0, + 372.0, + 293.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 895.0, + 337.0, + 1012.0, + 337.0, + 1012.0, + 372.0, + 895.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1396.0, + 337.0, + 1405.0, + 337.0, + 1405.0, + 372.0, + 1396.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 366.0, + 415.0, + 366.0, + 415.0, + 403.0, + 295.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 446.0, + 366.0, + 1406.0, + 366.0, + 1406.0, + 403.0, + 446.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 398.0, + 1406.0, + 398.0, + 1406.0, + 435.0, + 761.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 430.0, + 1017.0, + 430.0, + 1017.0, + 464.0, + 295.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 430.0, + 1405.0, + 430.0, + 1405.0, + 464.0, + 1044.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 458.0, + 523.0, + 458.0, + 523.0, + 495.0, + 291.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 458.0, + 1269.0, + 458.0, + 1269.0, + 495.0, + 597.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1339.0, + 458.0, + 1406.0, + 458.0, + 1406.0, + 495.0, + 1339.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 491.0, + 1406.0, + 491.0, + 1406.0, + 523.0, + 293.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 519.0, + 1368.0, + 519.0, + 1368.0, + 558.0, + 291.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1754.0, + 1405.0, + 1754.0, + 1405.0, + 1788.0, + 296.0, + 1788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1784.0, + 617.0, + 1784.0, + 617.0, + 1818.0, + 293.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 691.0, + 1784.0, + 1174.0, + 1784.0, + 1174.0, + 1818.0, + 691.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1204.0, + 1784.0, + 1406.0, + 1784.0, + 1406.0, + 1818.0, + 1204.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1816.0, + 501.0, + 1816.0, + 501.0, + 1849.0, + 295.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 1816.0, + 578.0, + 1816.0, + 578.0, + 1849.0, + 520.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 612.0, + 1816.0, + 1405.0, + 1816.0, + 1405.0, + 1849.0, + 612.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1839.0, + 432.0, + 1839.0, + 432.0, + 1892.0, + 288.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 607.0, + 1839.0, + 1410.0, + 1839.0, + 1410.0, + 1892.0, + 607.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1876.0, + 573.0, + 1876.0, + 573.0, + 1913.0, + 294.0, + 1913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1475.0, + 372.0, + 1475.0, + 372.0, + 1519.0, + 292.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 1475.0, + 903.0, + 1475.0, + 903.0, + 1519.0, + 434.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 1475.0, + 1288.0, + 1475.0, + 1288.0, + 1519.0, + 1233.0, + 1519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1509.0, + 297.0, + 1509.0, + 297.0, + 1549.0, + 292.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 408.0, + 1509.0, + 1040.0, + 1509.0, + 1040.0, + 1549.0, + 408.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 1509.0, + 1407.0, + 1509.0, + 1407.0, + 1549.0, + 1098.0, + 1549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1543.0, + 297.0, + 1543.0, + 297.0, + 1575.0, + 294.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 1543.0, + 476.0, + 1543.0, + 476.0, + 1575.0, + 364.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1257.0, + 773.0, + 1257.0, + 773.0, + 1295.0, + 295.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 1257.0, + 984.0, + 1257.0, + 984.0, + 1295.0, + 879.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1226.0, + 1257.0, + 1282.0, + 1257.0, + 1282.0, + 1295.0, + 1226.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 1257.0, + 1407.0, + 1257.0, + 1407.0, + 1295.0, + 1373.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1286.0, + 842.0, + 1286.0, + 842.0, + 1329.0, + 293.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 979.0, + 1286.0, + 1279.0, + 1286.0, + 1279.0, + 1329.0, + 979.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 1286.0, + 1408.0, + 1286.0, + 1408.0, + 1329.0, + 1351.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1315.0, + 392.0, + 1315.0, + 392.0, + 1361.0, + 292.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1315.0, + 1195.0, + 1315.0, + 1195.0, + 1361.0, + 615.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 1315.0, + 1357.0, + 1315.0, + 1357.0, + 1361.0, + 1344.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1135.0, + 1299.0, + 1135.0, + 1299.0, + 1174.0, + 293.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1353.0, + 1135.0, + 1404.0, + 1135.0, + 1404.0, + 1174.0, + 1353.0, + 1174.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1165.0, + 345.0, + 1165.0, + 345.0, + 1207.0, + 292.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 496.0, + 1165.0, + 1342.0, + 1165.0, + 1342.0, + 1207.0, + 496.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1165.0, + 1406.0, + 1165.0, + 1406.0, + 1207.0, + 1394.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1198.0, + 1221.0, + 1198.0, + 1221.0, + 1233.0, + 295.0, + 1233.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 1198.0, + 1255.0, + 1198.0, + 1255.0, + 1233.0, + 1244.0, + 1233.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": [ + 295.0, + 260.0, + 860.0, + 260.0, + 860.0, + 294.0, + 295.0, + 294.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 568.0, + 937.0, + 568.0, + 937.0, + 601.0, + 298.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 978.0, + 568.0, + 1346.0, + 568.0, + 1346.0, + 601.0, + 978.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1376.0, + 568.0, + 1404.0, + 568.0, + 1404.0, + 601.0, + 1376.0, + 601.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 599.0, + 634.0, + 599.0, + 634.0, + 638.0, + 525.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 599.0, + 1093.0, + 599.0, + 1093.0, + 638.0, + 791.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 599.0, + 1399.0, + 599.0, + 1399.0, + 638.0, + 1270.0, + 638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 957.0, + 454.0, + 957.0, + 454.0, + 998.0, + 292.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 525.0, + 957.0, + 1408.0, + 957.0, + 1408.0, + 998.0, + 525.0, + 998.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 992.0, + 980.0, + 992.0, + 980.0, + 1026.0, + 294.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 992.0, + 1322.0, + 992.0, + 1322.0, + 1026.0, + 1038.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 740.0, + 625.0, + 740.0, + 625.0, + 780.0, + 293.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 740.0, + 776.0, + 740.0, + 776.0, + 780.0, + 703.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 815.0, + 740.0, + 1280.0, + 740.0, + 1280.0, + 780.0, + 815.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 740.0, + 1406.0, + 740.0, + 1406.0, + 780.0, + 1351.0, + 780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 768.0, + 382.0, + 768.0, + 382.0, + 816.0, + 289.0, + 816.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 913.0, + 618.0, + 913.0, + 618.0, + 953.0, + 296.0, + 953.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 674.0, + 913.0, + 949.0, + 913.0, + 949.0, + 953.0, + 674.0, + 953.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 3, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 430, + 1405, + 430, + 1405, + 649, + 296, + 649 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 296, + 1832, + 1405, + 1832, + 1405, + 2036, + 296, + 2036 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 228, + 1404, + 228, + 1404, + 418, + 297, + 418 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 297, + 1631, + 1406, + 1631, + 1406, + 1818, + 297, + 1818 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 299, + 1205, + 1403, + 1205, + 1403, + 1301, + 299, + 1301 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 1019, + 1402, + 1019, + 1402, + 1114, + 298, + 1114 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 297, + 1314, + 1405, + 1314, + 1405, + 1505, + 297, + 1505 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 332, + 1514, + 1306, + 1514, + 1306, + 1622, + 332, + 1622 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 295, + 671, + 1400, + 671, + 1400, + 737, + 295, + 737 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 500, + 879, + 1139, + 879, + 1139, + 951, + 500, + 951 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 299, + 833, + 835, + 833, + 835, + 866, + 299, + 866 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 300, + 961, + 754, + 961, + 754, + 996, + 300, + 996 + ], + "score": 0.92 + }, + { + "category_id": 8, + "poly": [ + 477, + 746, + 1164, + 746, + 1164, + 822, + 477, + 822 + ], + "score": 0.92 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.911 + }, + { + "category_id": 0, + "poly": [ + 301, + 1150, + 775, + 1150, + 775, + 1181, + 301, + 1181 + ], + "score": 0.91 + }, + { + "category_id": 9, + "poly": [ + 1365, + 769, + 1400, + 769, + 1400, + 799, + 1365, + 799 + ], + "score": 0.876 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2112, + 841, + 2112 + ], + "score": 0.753 + }, + { + "category_id": 8, + "poly": [ + 478, + 746, + 1163, + 746, + 1163, + 822, + 478, + 822 + ], + "score": 0.093 + }, + { + "category_id": 13, + "poly": [ + 471, + 1467, + 674, + 1467, + 674, + 1504, + 471, + 1504 + ], + "score": 0.94, + "latex": "\\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 } ^ { + \\infty }" + }, + { + "category_id": 13, + "poly": [ + 1031, + 325, + 1102, + 325, + 1102, + 358, + 1031, + 358 + ], + "score": 0.94, + "latex": "N ( t _ { 1 } )" + }, + { + "category_id": 14, + "poly": [ + 501, + 876, + 1141, + 876, + 1141, + 953, + 501, + 953 + ], + "score": 0.94, + "latex": "P r \\left( \\operatorname* { m a x } _ { k \\in \\{ 1 , \\dots , K \\} } \\{ \\sqrt { N ( t _ { k } ) } S ( t _ { k } ) - z _ { k } \\} > 0 \\right) \\leq \\alpha + o ( 1 ) ." + }, + { + "category_id": 13, + "poly": [ + 644, + 1632, + 804, + 1632, + 804, + 1675, + 644, + 1675 + ], + "score": 0.94, + "latex": "\\sqrt { N ( t ) } \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t )" + }, + { + "category_id": 14, + "poly": [ + 336, + 1512, + 1307, + 1512, + 1307, + 1623, + 336, + 1623 + ], + "score": 0.93, + "latex": "\\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t ) = \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t ) \\left[ \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\mathbb { I } ( A _ { i } = a ) \\varphi _ { i } ( X ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } ( t ) \\} \\xi _ { i } \\right] , \\forall a \\in \\{ 0 , 1 \\} ." + }, + { + "category_id": 13, + "poly": [ + 1021, + 1674, + 1172, + 1674, + 1172, + 1712, + 1021, + 1712 + ], + "score": 0.93, + "latex": "\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }" + }, + { + "category_id": 13, + "poly": [ + 762, + 1314, + 913, + 1314, + 913, + 1355, + 762, + 1355 + ], + "score": 0.93, + "latex": "\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }" + }, + { + "category_id": 13, + "poly": [ + 631, + 1391, + 764, + 1391, + 764, + 1431, + 631, + 1431 + ], + "score": 0.93, + "latex": "\\{ \\widehat { S } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { k }" + }, + { + "category_id": 13, + "poly": [ + 431, + 1237, + 537, + 1237, + 537, + 1271, + 431, + 1271 + ], + "score": 0.93, + "latex": "\\{ S ( t _ { k } ) \\} _ { k }" + }, + { + "category_id": 13, + "poly": [ + 732, + 1469, + 850, + 1469, + 850, + 1503, + 732, + 1503 + ], + "score": 0.93, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 533, + 1051, + 667, + 1051, + 667, + 1086, + 533, + 1086 + ], + "score": 0.93, + "latex": "\\left\\{ z _ { k } \\right\\} _ { 1 \\leq k \\leq K }" + }, + { + "category_id": 13, + "poly": [ + 985, + 1748, + 1186, + 1748, + 1186, + 1788, + 985, + 1788 + ], + "score": 0.93, + "latex": "\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }" + }, + { + "category_id": 13, + "poly": [ + 430, + 1353, + 628, + 1353, + 628, + 1393, + 430, + 1393 + ], + "score": 0.93, + "latex": "\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }" + }, + { + "category_id": 13, + "poly": [ + 648, + 963, + 745, + 963, + 745, + 995, + 648, + 995 + ], + "score": 0.93, + "latex": "\\beta _ { 0 } ^ { * } = \\beta _ { 1 } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 861, + 1631, + 1094, + 1631, + 1094, + 1674, + 861, + 1674 + ], + "score": 0.92, + "latex": "\\sqrt { N ( t ) } ( \\widehat { \\beta } _ { a } ( t ) - \\beta _ { a } ^ { * } )" + }, + { + "category_id": 13, + "poly": [ + 966, + 1357, + 1072, + 1357, + 1072, + 1392, + 966, + 1392 + ], + "score": 0.92, + "latex": "\\{ S ( t _ { k } ) \\} _ { k }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1429, + 390, + 1429, + 390, + 1469, + 297, + 1469 + ], + "score": 0.92, + "latex": "\\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } } ( t ) \\}" + }, + { + "category_id": 13, + "poly": [ + 890, + 1896, + 1154, + 1896, + 1154, + 1933, + 890, + 1933 + ], + "score": 0.92, + "latex": "\\{ N ( t _ { k } ) - \\mathbf { \\bar { \\phi } } N ( t _ { k - 1 } ) \\} _ { k = 1 } ^ { K }" + }, + { + "category_id": 13, + "poly": [ + 640, + 231, + 760, + 231, + 760, + 264, + 640, + 264 + ], + "score": 0.92, + "latex": "\\alpha _ { 0 } = 1 / 2" + }, + { + "category_id": 13, + "poly": [ + 426, + 553, + 760, + 553, + 760, + 591, + 426, + 591 + ], + "score": 0.92, + "latex": "\\{ \\varphi ^ { \\top } ( x ) B ( t _ { K } ) \\} _ { x \\in \\mathbb { X } , k \\in \\{ 1 , \\dots , \\kappa \\} }" + }, + { + "category_id": 13, + "poly": [ + 540, + 1831, + 632, + 1831, + 632, + 1869, + 540, + 1869 + ], + "score": 0.92, + "latex": "\\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 329, + 833, + 400, + 833, + 400, + 867, + 329, + 867 + ], + "score": 0.92, + "latex": "N ( t _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 1007, + 1390, + 1403, + 1390, + 1403, + 1432, + 1007, + 1432 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\widehat { S } ^ { \\mathrm { M B } } ( t ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } } ( t ) - } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 483, + 291, + 589, + 291, + 589, + 327, + 483, + 327 + ], + "score": 0.92, + "latex": "N ^ { 1 / 6 } ( t _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 558, + 1869, + 695, + 1869, + 695, + 1901, + 558, + 1901 + ], + "score": 0.92, + "latex": "O ( B N ( t _ { k } ) )" + }, + { + "category_id": 13, + "poly": [ + 681, + 1434, + 771, + 1434, + 771, + 1469, + 681, + 1469 + ], + "score": 0.92, + "latex": "\\{ \\xi _ { i } \\} _ { i = 1 } ^ { + \\infty }" + }, + { + "category_id": 13, + "poly": [ + 766, + 1710, + 967, + 1710, + 967, + 1749, + 766, + 1749 + ], + "score": 0.91, + "latex": "\\{ \\widehat { \\beta } _ { a } ( t _ { k } ) - \\beta _ { a } ^ { * } \\} _ { a , k }" + }, + { + "category_id": 14, + "poly": [ + 478, + 745, + 1162, + 745, + 1162, + 822, + 478, + 822 + ], + "score": 0.91, + "latex": "P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} = \\alpha + o ( 1 ) ," + }, + { + "category_id": 13, + "poly": [ + 735, + 1835, + 850, + 1835, + 850, + 1869, + 735, + 1869 + ], + "score": 0.91, + "latex": "O ( N ( t _ { k } ) )" + }, + { + "category_id": 13, + "poly": [ + 903, + 1932, + 949, + 1932, + 949, + 1969, + 903, + 1969 + ], + "score": 0.91, + "latex": "{ \\widehat { \\beta } } _ { a } ^ { \\mathrm { M B } }" + }, + { + "category_id": 13, + "poly": [ + 1340, + 1966, + 1400, + 1966, + 1400, + 2006, + 1340, + 2006 + ], + "score": 0.91, + "latex": "{ \\widehat \\beta } _ { a } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 722, + 709, + 838, + 709, + 838, + 737, + 722, + 737 + ], + "score": 0.9, + "latex": "z _ { 1 } , \\ldots , z _ { k }" + }, + { + "category_id": 13, + "poly": [ + 780, + 1750, + 931, + 1750, + 931, + 1788, + 780, + 1788 + ], + "score": 0.9, + "latex": "\\{ \\widehat { \\beta } _ { a } ^ { \\mathrm { M B } } ( t _ { k } ) \\} _ { a , k }" + }, + { + "category_id": 13, + "poly": [ + 791, + 834, + 828, + 834, + 828, + 865, + 791, + 865 + ], + "score": 0.89, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 817, + 1871, + 835, + 1871, + 835, + 1895, + 817, + 1895 + ], + "score": 0.84, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 1115, + 1869, + 1141, + 1869, + 1141, + 1894, + 1115, + 1894 + ], + "score": 0.83, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 1239, + 267, + 1257, + 267, + 1257, + 294, + 1239, + 294 + ], + "score": 0.79, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 1125, + 299, + 1143, + 299, + 1143, + 326, + 1125, + 326 + ], + "score": 0.78, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 524, + 326, + 554, + 326, + 554, + 353, + 524, + 353 + ], + "score": 0.77, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 1296, + 330, + 1311, + 330, + 1311, + 353, + 1296, + 353 + ], + "score": 0.7, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 877, + 237, + 892, + 237, + 892, + 259, + 877, + 259 + ], + "score": 0.63, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 479, + 1439, + 491, + 1439, + 491, + 1462, + 479, + 1462 + ], + "score": 0.6, + "latex": "t" + }, + { + "category_id": 13, + "poly": [ + 1087, + 676, + 1106, + 676, + 1106, + 701, + 1087, + 701 + ], + "score": 0.59, + "latex": "6" + }, + { + "category_id": 13, + "poly": [ + 1099, + 586, + 1123, + 586, + 1123, + 612, + 1099, + 612 + ], + "score": 0.5, + "latex": "\\&" + }, + { + "category_id": 13, + "poly": [ + 892, + 675, + 909, + 675, + 909, + 701, + 892, + 701 + ], + "score": 0.34, + "latex": "^ { l }" + }, + { + "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": [ + 294.0, + 1149.0, + 779.0, + 1149.0, + 779.0, + 1185.0, + 294.0, + 1185.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": [ + 294.0, + 430.0, + 1405.0, + 430.0, + 1405.0, + 467.0, + 294.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 463.0, + 1405.0, + 463.0, + 1405.0, + 498.0, + 294.0, + 498.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 493.0, + 1405.0, + 493.0, + 1405.0, + 528.0, + 294.0, + 528.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 523.0, + 1406.0, + 523.0, + 1406.0, + 561.0, + 293.0, + 561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 551.0, + 425.0, + 551.0, + 425.0, + 598.0, + 290.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 551.0, + 1408.0, + 551.0, + 1408.0, + 598.0, + 761.0, + 598.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 584.0, + 1098.0, + 584.0, + 1098.0, + 619.0, + 294.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 584.0, + 1405.0, + 584.0, + 1405.0, + 619.0, + 1124.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 616.0, + 1081.0, + 616.0, + 1081.0, + 650.0, + 296.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1830.0, + 539.0, + 1830.0, + 539.0, + 1875.0, + 291.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 633.0, + 1830.0, + 734.0, + 1830.0, + 734.0, + 1875.0, + 633.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 1830.0, + 1407.0, + 1830.0, + 1407.0, + 1875.0, + 851.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1865.0, + 557.0, + 1865.0, + 557.0, + 1902.0, + 293.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 696.0, + 1865.0, + 816.0, + 1865.0, + 816.0, + 1902.0, + 696.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 836.0, + 1865.0, + 1114.0, + 1865.0, + 1114.0, + 1902.0, + 836.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 1865.0, + 1406.0, + 1865.0, + 1406.0, + 1902.0, + 1142.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1883.0, + 889.0, + 1883.0, + 889.0, + 1946.0, + 285.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1155.0, + 1883.0, + 1415.0, + 1883.0, + 1415.0, + 1946.0, + 1155.0, + 1946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1928.0, + 902.0, + 1928.0, + 902.0, + 1973.0, + 291.0, + 1973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 950.0, + 1928.0, + 1408.0, + 1928.0, + 1408.0, + 1973.0, + 950.0, + 1973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1968.0, + 1339.0, + 1968.0, + 1339.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1968.0, + 1405.0, + 1968.0, + 1405.0, + 2009.0, + 1401.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 2004.0, + 670.0, + 2004.0, + 670.0, + 2037.0, + 296.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 231.0, + 639.0, + 231.0, + 639.0, + 263.0, + 295.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 761.0, + 231.0, + 876.0, + 231.0, + 876.0, + 263.0, + 761.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 893.0, + 231.0, + 1405.0, + 231.0, + 1405.0, + 263.0, + 893.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 258.0, + 1238.0, + 258.0, + 1238.0, + 298.0, + 292.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1258.0, + 258.0, + 1408.0, + 258.0, + 1408.0, + 298.0, + 1258.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 291.0, + 482.0, + 291.0, + 482.0, + 331.0, + 292.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 590.0, + 291.0, + 1124.0, + 291.0, + 1124.0, + 331.0, + 590.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1144.0, + 291.0, + 1404.0, + 291.0, + 1404.0, + 331.0, + 1144.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 322.0, + 523.0, + 322.0, + 523.0, + 361.0, + 292.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 555.0, + 322.0, + 1030.0, + 322.0, + 1030.0, + 361.0, + 555.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 322.0, + 1295.0, + 322.0, + 1295.0, + 361.0, + 1103.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1312.0, + 322.0, + 1404.0, + 322.0, + 1404.0, + 361.0, + 1312.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 351.0, + 1405.0, + 351.0, + 1405.0, + 393.0, + 292.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 385.0, + 511.0, + 385.0, + 511.0, + 420.0, + 292.0, + 420.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1631.0, + 643.0, + 1631.0, + 643.0, + 1678.0, + 291.0, + 1678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 805.0, + 1631.0, + 860.0, + 1631.0, + 860.0, + 1678.0, + 805.0, + 1678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1095.0, + 1631.0, + 1408.0, + 1631.0, + 1408.0, + 1678.0, + 1095.0, + 1678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1673.0, + 1020.0, + 1673.0, + 1020.0, + 1713.0, + 294.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1173.0, + 1673.0, + 1404.0, + 1673.0, + 1404.0, + 1713.0, + 1173.0, + 1713.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1713.0, + 765.0, + 1713.0, + 765.0, + 1753.0, + 294.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 1713.0, + 1404.0, + 1713.0, + 1404.0, + 1753.0, + 968.0, + 1753.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1742.0, + 779.0, + 1742.0, + 779.0, + 1794.0, + 291.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1742.0, + 984.0, + 1742.0, + 984.0, + 1794.0, + 932.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 1742.0, + 1406.0, + 1742.0, + 1406.0, + 1794.0, + 1187.0, + 1794.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1783.0, + 942.0, + 1783.0, + 942.0, + 1818.0, + 294.0, + 1818.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1204.0, + 1403.0, + 1204.0, + 1403.0, + 1242.0, + 294.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1233.0, + 430.0, + 1233.0, + 430.0, + 1275.0, + 293.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1233.0, + 1405.0, + 1233.0, + 1405.0, + 1275.0, + 538.0, + 1275.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1268.0, + 817.0, + 1268.0, + 817.0, + 1304.0, + 294.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1017.0, + 1406.0, + 1017.0, + 1406.0, + 1056.0, + 293.0, + 1056.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1051.0, + 532.0, + 1051.0, + 532.0, + 1088.0, + 293.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 668.0, + 1051.0, + 1403.0, + 1051.0, + 1403.0, + 1088.0, + 668.0, + 1088.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1082.0, + 885.0, + 1082.0, + 885.0, + 1115.0, + 293.0, + 1115.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1312.0, + 761.0, + 1312.0, + 761.0, + 1360.0, + 292.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.0, + 1312.0, + 1406.0, + 1312.0, + 1406.0, + 1360.0, + 914.0, + 1360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1352.0, + 429.0, + 1352.0, + 429.0, + 1397.0, + 292.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 1352.0, + 965.0, + 1352.0, + 965.0, + 1397.0, + 629.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 1352.0, + 1405.0, + 1352.0, + 1405.0, + 1397.0, + 1073.0, + 1397.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1386.0, + 630.0, + 1386.0, + 630.0, + 1437.0, + 290.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 1386.0, + 1006.0, + 1386.0, + 1006.0, + 1437.0, + 765.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 391.0, + 1425.0, + 478.0, + 1425.0, + 478.0, + 1478.0, + 391.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 492.0, + 1425.0, + 680.0, + 1425.0, + 680.0, + 1478.0, + 492.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 772.0, + 1425.0, + 1410.0, + 1425.0, + 1410.0, + 1478.0, + 772.0, + 1478.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1455.0, + 470.0, + 1455.0, + 470.0, + 1516.0, + 289.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 675.0, + 1455.0, + 731.0, + 1455.0, + 731.0, + 1516.0, + 675.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 851.0, + 1455.0, + 944.0, + 1455.0, + 944.0, + 1516.0, + 851.0, + 1516.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 672.0, + 891.0, + 672.0, + 891.0, + 708.0, + 295.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 672.0, + 1086.0, + 672.0, + 1086.0, + 708.0, + 910.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 672.0, + 1405.0, + 672.0, + 1405.0, + 708.0, + 1107.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 703.0, + 721.0, + 703.0, + 721.0, + 742.0, + 290.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 839.0, + 703.0, + 972.0, + 703.0, + 972.0, + 742.0, + 839.0, + 742.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 828.0, + 328.0, + 828.0, + 328.0, + 872.0, + 293.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 828.0, + 790.0, + 828.0, + 790.0, + 872.0, + 401.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 828.0, + 838.0, + 828.0, + 838.0, + 872.0, + 829.0, + 872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 956.0, + 647.0, + 956.0, + 647.0, + 1002.0, + 294.0, + 1002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 956.0, + 756.0, + 956.0, + 756.0, + 1002.0, + 746.0, + 1002.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 4, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 809, + 1407, + 809, + 1407, + 923, + 296, + 923 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 296, + 227, + 1407, + 227, + 1407, + 362, + 296, + 362 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 297, + 932, + 1403, + 932, + 1403, + 1059, + 297, + 1059 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 366, + 1065, + 1313, + 1065, + 1313, + 1238, + 366, + 1238 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 520, + 715, + 1127, + 715, + 1127, + 801, + 520, + 801 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 297, + 372, + 1424, + 372, + 1424, + 479, + 297, + 479 + ], + "score": 0.94 + }, + { + "category_id": 8, + "poly": [ + 399, + 1864, + 1327, + 1864, + 1327, + 1999, + 399, + 1999 + ], + "score": 0.936 + }, + { + "category_id": 1, + "poly": [ + 289, + 1794, + 1406, + 1794, + 1406, + 1860, + 289, + 1860 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 295, + 1707, + 1408, + 1707, + 1408, + 1778, + 295, + 1778 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 298, + 1242, + 1403, + 1242, + 1403, + 1306, + 298, + 1306 + ], + "score": 0.927 + }, + { + "category_id": 8, + "poly": [ + 296, + 1564, + 1523, + 1564, + 1523, + 1702, + 296, + 1702 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 297, + 674, + 978, + 674, + 978, + 707, + 297, + 707 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 294, + 1439, + 1137, + 1439, + 1137, + 1474, + 294, + 1474 + ], + "score": 0.905 + }, + { + "category_id": 8, + "poly": [ + 298, + 571, + 1455, + 571, + 1455, + 670, + 298, + 670 + ], + "score": 0.899 + }, + { + "category_id": 1, + "poly": [ + 298, + 485, + 1412, + 485, + 1412, + 564, + 298, + 564 + ], + "score": 0.892 + }, + { + "category_id": 2, + "poly": [ + 297, + 74, + 855, + 74, + 855, + 106, + 297, + 106 + ], + "score": 0.888 + }, + { + "category_id": 8, + "poly": [ + 302, + 1310, + 1382, + 1310, + 1382, + 1384, + 302, + 1384 + ], + "score": 0.888 + }, + { + "category_id": 1, + "poly": [ + 292, + 1495, + 1401, + 1495, + 1401, + 1562, + 292, + 1562 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 294, + 2004, + 574, + 2004, + 574, + 2035, + 294, + 2035 + ], + "score": 0.863 + }, + { + "category_id": 9, + "poly": [ + 1365, + 1135, + 1401, + 1135, + 1401, + 1164, + 1365, + 1164 + ], + "score": 0.842 + }, + { + "category_id": 1, + "poly": [ + 295, + 1390, + 956, + 1390, + 956, + 1428, + 295, + 1428 + ], + "score": 0.83 + }, + { + "category_id": 2, + "poly": [ + 839, + 2088, + 859, + 2088, + 859, + 2113, + 839, + 2113 + ], + "score": 0.803 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1955, + 1402, + 1955, + 1402, + 1989, + 1352, + 1989 + ], + "score": 0.712 + }, + { + "category_id": 9, + "poly": [ + 1384, + 1331, + 1432, + 1331, + 1432, + 1362, + 1384, + 1362 + ], + "score": 0.562 + }, + { + "category_id": 13, + "poly": [ + 1297, + 292, + 1400, + 292, + 1400, + 332, + 1297, + 332 + ], + "score": 0.94, + "latex": "\\widehat { \\beta } _ { a } ^ { \\mathrm { M B * } } ( t _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 888, + 813, + 998, + 813, + 998, + 848, + 888, + 848 + ], + "score": 0.93, + "latex": "\\{ G ( t _ { k } ) \\} _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1204, + 230, + 1305, + 230, + 1305, + 265, + 1204, + 265 + ], + "score": 0.93, + "latex": "N ( 0 , I _ { q } )" + }, + { + "category_id": 13, + "poly": [ + 524, + 1390, + 749, + 1390, + 749, + 1428, + 524, + 1428 + ], + "score": 0.92, + "latex": "\\sqrt { N ( t _ { k } ) } S ( t _ { k } ) > \\widehat { z } _ { k }" + }, + { + "category_id": 14, + "poly": [ + 292, + 1308, + 1379, + 1308, + 1379, + 1385, + 292, + 1385 + ], + "score": 0.92, + "latex": "\\mathrm { P r } ^ { * } \\left\\{ \\operatorname* { m a x } _ { j \\in \\{ 1 , \\dots , k - 1 \\} } \\left( \\sqrt { N ( t _ { j } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { j } ) - \\widehat { z } _ { j } \\right) \\leq 0 , \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { k } ) > \\widehat { z } _ { k } \\right\\} = \\alpha ( t _ { k } ) - \\alpha ( t _ { k - 1 } ) ," + }, + { + "category_id": 13, + "poly": [ + 417, + 933, + 487, + 933, + 487, + 967, + 417, + 967 + ], + "score": 0.92, + "latex": "\\{ z _ { k } \\} _ { k }" + }, + { + "category_id": 13, + "poly": [ + 713, + 230, + 936, + 230, + 936, + 265, + 713, + 265 + ], + "score": 0.92, + "latex": "\\{ e _ { i , a } \\} _ { i = 1 , . . . , K , a = 0 , 1 }" + }, + { + "category_id": 13, + "poly": [ + 1294, + 1240, + 1374, + 1240, + 1374, + 1276, + 1294, + 1276 + ], + "score": 0.92, + "latex": "\\Phi ^ { - 1 } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 437, + 808, + 831, + 808, + 831, + 848, + 437, + 848 + ], + "score": 0.92, + "latex": "\\{ \\sqrt { N ( t _ { k } ) } ( \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } ^ { * } } ( t _ { k } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } ^ { * } } ( t _ { k } ) ) \\} _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1214, + 995, + 1265, + 995, + 1265, + 1028, + 1214, + 1028 + ], + "score": 0.92, + "latex": "\\alpha ( t )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1827, + 367, + 1827, + 367, + 1861, + 298, + 1861 + ], + "score": 0.92, + "latex": "\\{ \\widehat { z } _ { k } \\} _ { k }" + }, + { + "category_id": 13, + "poly": [ + 967, + 1273, + 1161, + 1273, + 1161, + 1305, + 967, + 1305 + ], + "score": 0.92, + "latex": "\\widehat { z } _ { k } , k = 1 , \\ldots , K" + }, + { + "category_id": 14, + "poly": [ + 517, + 710, + 1126, + 710, + 1126, + 802, + 517, + 802 + ], + "score": 0.92, + "latex": "\\frac { \\sqrt { N ( t _ { k _ { 1 } } ) } } { \\sqrt { N ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\Sigma _ { a } ^ { - 1 } \\Phi ( a ) \\Sigma _ { a } ^ { - 1 } = \\mathrm { C o v } ( G ( t _ { k _ { 1 } } ) , G ( t _ { k _ { 2 } } ) ) ." + }, + { + "category_id": 13, + "poly": [ + 533, + 849, + 805, + 849, + 805, + 887, + 533, + 887 + ], + "score": 0.92, + "latex": "\\{ \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } ( t _ { k } ) \\} _ { k = 1 } ^ { K }" + }, + { + "category_id": 14, + "poly": [ + 393, + 1862, + 1328, + 1862, + 1328, + 2005, + 393, + 2005 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\left| P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\widehat z _ { k } \\right) > 0 \\right\\} - \\alpha \\right| } \\\\ { \\leq } & { c \\left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \\log ^ { 1 1 / 6 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K N ( t _ { 1 } ) \\} \\right] , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 873, + 1741, + 1053, + 1741, + 1053, + 1777, + 873, + 1777 + ], + "score": 0.91, + "latex": "\\{ X _ { i } , A _ { i } , Y _ { i } \\} _ { i = 1 } ^ { + \\infty }" + }, + { + "category_id": 13, + "poly": [ + 372, + 1242, + 423, + 1242, + 423, + 1276, + 372, + 1276 + ], + "score": 0.91, + "latex": "\\Phi ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 1031, + 1495, + 1233, + 1495, + 1233, + 1532, + 1031, + 1532 + ], + "score": 0.91, + "latex": "q = O ( N ^ { \\alpha ^ { * } } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 1020, + 1025, + 1069, + 1025, + 1069, + 1059, + 1020, + 1059 + ], + "score": 0.91, + "latex": "\\alpha ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 632, + 293, + 1208, + 293, + 1208, + 334, + 632, + 334 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\widehat { S } ^ { \\mathtt { M B } * } ( t _ { k } ) = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\bar { \\varphi } ^ { \\top } ( x ) \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathtt { M B } * } ( t _ { k } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathtt { M B } * } ( t _ { k } ) \\} } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 883, + 600, + 883, + 600, + 923, + 298, + 923 + ], + "score": 0.91, + "latex": "\\{ \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) \\} _ { k = 1 } ^ { \\cdot }" + }, + { + "category_id": 13, + "poly": [ + 1188, + 1708, + 1261, + 1708, + 1261, + 1742, + 1188, + 1742 + ], + "score": 0.91, + "latex": "\\textstyle P r ^ { * } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 644, + 1273, + 693, + 1273, + 693, + 1307, + 644, + 1307 + ], + "score": 0.91, + "latex": "\\alpha ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 1134, + 1797, + 1190, + 1797, + 1190, + 1831, + 1134, + 1831 + ], + "score": 0.91, + "latex": "N ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 1046, + 1531, + 1102, + 1531, + 1102, + 1563, + 1046, + 1563 + ], + "score": 0.91, + "latex": "N ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1529, + 410, + 1529, + 410, + 1563, + 298, + 1563 + ], + "score": 0.9, + "latex": "\\alpha ^ { * } < 1 / 3" + }, + { + "category_id": 13, + "poly": [ + 413, + 1394, + 451, + 1394, + 451, + 1424, + 413, + 1424 + ], + "score": 0.89, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 884, + 1707, + 1095, + 1707, + 1095, + 1741, + 884, + 1741 + ], + "score": 0.89, + "latex": "1 - O ( N ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 512, + 1711, + 592, + 1711, + 592, + 1738, + 512, + 1738 + ], + "score": 0.89, + "latex": "c > 0" + }, + { + "category_id": 14, + "poly": [ + 310, + 365, + 1428, + 365, + 1428, + 479, + 310, + 479 + ], + "score": 0.88, + "latex": "\\frac { 1 } { \\mathrm { V } ( t _ { k } ) } \\sum _ { j = 1 } ^ { k } \\left( \\sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ( X _ { i } ) ^ { \\top } \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\right) ^ { 1 / 2 } e _ { j , a } ." + }, + { + "category_id": 13, + "poly": [ + 1028, + 264, + 1097, + 264, + 1097, + 293, + 1028, + 293 + ], + "score": 0.88, + "latex": "q \\times q" + }, + { + "category_id": 13, + "poly": [ + 298, + 523, + 691, + 523, + 691, + 564, + 298, + 564 + ], + "score": 0.88, + "latex": "\\sqrt { N ( t _ { k _ { 2 } } ) } \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k _ { 2 } } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k _ { 2 } } ) \\}" + }, + { + "category_id": 14, + "poly": [ + 310, + 567, + 1428, + 567, + 1428, + 672, + 310, + 672 + ], + "score": 0.88, + "latex": "\\frac { 1 } { \\sqrt { N ( t _ { k _ { 1 } } ) N ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = N ( t _ { j - 1 } ) + 1 } ^ { N ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { k _ { 1 } } ) ," + }, + { + "category_id": 13, + "poly": [ + 932, + 484, + 1344, + 484, + 1344, + 526, + 932, + 526 + ], + "score": 0.87, + "latex": "\\sqrt { N ( t _ { k _ { 1 } } ) } \\{ \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k _ { 1 } } ) \\ - \\ \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k _ { 1 } } ) \\}" + }, + { + "category_id": 13, + "poly": [ + 408, + 491, + 440, + 491, + 440, + 521, + 408, + 521 + ], + "score": 0.87, + "latex": "k _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 559, + 1025, + 666, + 1025, + 666, + 1059, + 559, + 1059 + ], + "score": 0.86, + "latex": "\\alpha ( 0 ) = 0" + }, + { + "category_id": 13, + "poly": [ + 509, + 491, + 540, + 491, + 540, + 522, + 509, + 522 + ], + "score": 0.86, + "latex": "k _ { 2 }" + }, + { + "category_id": 14, + "poly": [ + 310, + 1564, + 1428, + 1564, + 1428, + 1706, + 310, + 1706 + ], + "score": 0.86, + "latex": "\\begin{array} { r } { \\underset { 1 , \\cdots , z _ { K } } { \\operatorname* { s u p } } \\left| P r ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { N ( t _ { k } ) } \\widehat { S } ^ { M B * } ( t _ { k } ) - z _ { k } \\right) > 0 \\right\\} - P r \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) \\right\\} \\right| } \\\\ { \\leq c \\left[ q ^ { 1 / 2 } N ^ { - 1 / 6 } ( t _ { 1 } ) \\log ^ { 1 1 / 6 } \\{ K N ( t _ { 1 } ) \\} + q N ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { ( 5 + \\alpha _ { 0 } ) / 3 } \\{ K \\} \\right] , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 857, + 265, + 885, + 265, + 885, + 295, + 857, + 295 + ], + "score": 0.85, + "latex": "I _ { q }" + }, + { + "category_id": 13, + "poly": [ + 678, + 1025, + 794, + 1025, + 794, + 1059, + 678, + 1059 + ], + "score": 0.82, + "latex": "\\alpha ( T ) = \\alpha" + }, + { + "category_id": 13, + "poly": [ + 1349, + 1499, + 1405, + 1499, + 1405, + 1529, + 1349, + 1529 + ], + "score": 0.81, + "latex": "0 ~ <" + }, + { + "category_id": 13, + "poly": [ + 925, + 1395, + 943, + 1395, + 943, + 1421, + 925, + 1421 + ], + "score": 0.81, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 502, + 2006, + 566, + 2006, + 566, + 2031, + 502, + 2031 + ], + "score": 0.8, + "latex": "c > 0" + }, + { + "category_id": 13, + "poly": [ + 913, + 940, + 934, + 940, + 934, + 961, + 913, + 961 + ], + "score": 0.79, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 1373, + 262, + 1391, + 262, + 1391, + 289, + 1373, + 289 + ], + "score": 0.77, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 979, + 1001, + 1001, + 1001, + 1001, + 1022, + 979, + 1022 + ], + "score": 0.77, + "latex": "\\alpha" + }, + { + "category_id": 14, + "poly": [ + 363, + 1064, + 1311, + 1064, + 1311, + 1149, + 363, + 1149 + ], + "score": 0.72, + "latex": "\\alpha _ { 1 } ( t ) = \\alpha \\log \\left( 1 + ( e - 1 ) \\frac { t } { T } \\right) , \\quad \\quad \\quad \\quad \\alpha _ { 2 } ( t ) = 2 - 2 \\Phi \\left( \\frac { \\Phi ^ { - 1 } ( 1 - \\alpha / 2 ) \\sqrt { T } } { \\sqrt { t } } \\right) ," + }, + { + "category_id": 14, + "poly": [ + 389, + 1158, + 1310, + 1158, + 1310, + 1238, + 389, + 1238 + ], + "score": 0.71, + "latex": "\\alpha _ { 3 } ( t ) = \\alpha \\left( \\frac { t } { T } \\right) ^ { \\theta } , \\mathrm { f o r } \\theta > 0 , \\alpha _ { 4 } ( t ) = \\alpha \\frac { 1 - \\exp ( - \\gamma t / T ) } { 1 - \\exp ( - \\gamma ) } , \\mathrm { f o r } \\gamma \\neq 0 ," + }, + { + "category_id": 13, + "poly": [ + 840, + 1501, + 857, + 1501, + 857, + 1526, + 840, + 1526 + ], + "score": 0.46, + "latex": "^ { l }" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 856.0, + 72.0, + 856.0, + 109.0, + 297.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 840.0, + 2087.0, + 861.0, + 2087.0, + 861.0, + 2117.0, + 840.0, + 2117.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 803.0, + 436.0, + 803.0, + 436.0, + 854.0, + 293.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 803.0, + 887.0, + 803.0, + 887.0, + 854.0, + 832.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 999.0, + 803.0, + 1407.0, + 803.0, + 1407.0, + 854.0, + 999.0, + 854.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 843.0, + 532.0, + 843.0, + 532.0, + 894.0, + 291.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 843.0, + 1409.0, + 843.0, + 1409.0, + 894.0, + 806.0, + 894.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 866.0, + 297.0, + 866.0, + 297.0, + 936.0, + 290.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 866.0, + 618.0, + 866.0, + 618.0, + 936.0, + 601.0, + 936.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 712.0, + 227.0, + 712.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 227.0, + 1203.0, + 227.0, + 1203.0, + 265.0, + 937.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1306.0, + 227.0, + 1405.0, + 227.0, + 1405.0, + 265.0, + 1306.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 259.0, + 856.0, + 259.0, + 856.0, + 297.0, + 294.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 886.0, + 259.0, + 1027.0, + 259.0, + 1027.0, + 297.0, + 886.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1098.0, + 259.0, + 1372.0, + 259.0, + 1372.0, + 297.0, + 1098.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1392.0, + 259.0, + 1405.0, + 259.0, + 1405.0, + 297.0, + 1392.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 291.0, + 631.0, + 291.0, + 631.0, + 337.0, + 290.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1209.0, + 291.0, + 1296.0, + 291.0, + 1296.0, + 337.0, + 1209.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 291.0, + 1407.0, + 291.0, + 1407.0, + 337.0, + 1401.0, + 337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 327.0, + 379.0, + 327.0, + 379.0, + 366.0, + 290.0, + 366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 929.0, + 416.0, + 929.0, + 416.0, + 971.0, + 291.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 488.0, + 929.0, + 912.0, + 929.0, + 912.0, + 971.0, + 488.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 935.0, + 929.0, + 1408.0, + 929.0, + 1408.0, + 971.0, + 935.0, + 971.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 964.0, + 1404.0, + 964.0, + 1404.0, + 999.0, + 295.0, + 999.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 994.0, + 978.0, + 994.0, + 978.0, + 1030.0, + 292.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1002.0, + 994.0, + 1213.0, + 994.0, + 1213.0, + 1030.0, + 1002.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 994.0, + 1404.0, + 994.0, + 1404.0, + 1030.0, + 1266.0, + 1030.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1026.0, + 558.0, + 1026.0, + 558.0, + 1059.0, + 296.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 1026.0, + 677.0, + 1026.0, + 677.0, + 1059.0, + 667.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 795.0, + 1026.0, + 1019.0, + 1026.0, + 1019.0, + 1059.0, + 795.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 1026.0, + 1163.0, + 1026.0, + 1163.0, + 1059.0, + 1070.0, + 1059.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1793.0, + 1133.0, + 1793.0, + 1133.0, + 1832.0, + 295.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1191.0, + 1793.0, + 1404.0, + 1793.0, + 1404.0, + 1832.0, + 1191.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 1824.0, + 452.0, + 1824.0, + 452.0, + 1866.0, + 368.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1704.0, + 511.0, + 1704.0, + 511.0, + 1745.0, + 290.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 593.0, + 1704.0, + 883.0, + 1704.0, + 883.0, + 1745.0, + 593.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1096.0, + 1704.0, + 1187.0, + 1704.0, + 1187.0, + 1745.0, + 1096.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1262.0, + 1704.0, + 1406.0, + 1704.0, + 1406.0, + 1745.0, + 1262.0, + 1745.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 284.0, + 1725.0, + 872.0, + 1725.0, + 872.0, + 1792.0, + 284.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1054.0, + 1725.0, + 1070.0, + 1725.0, + 1070.0, + 1792.0, + 1054.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1237.0, + 371.0, + 1237.0, + 371.0, + 1277.0, + 294.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1237.0, + 1293.0, + 1237.0, + 1293.0, + 1277.0, + 424.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1375.0, + 1237.0, + 1405.0, + 1237.0, + 1405.0, + 1277.0, + 1375.0, + 1277.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1271.0, + 643.0, + 1271.0, + 643.0, + 1307.0, + 293.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 694.0, + 1271.0, + 966.0, + 1271.0, + 966.0, + 1307.0, + 694.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1162.0, + 1271.0, + 1365.0, + 1271.0, + 1365.0, + 1307.0, + 1162.0, + 1307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 671.0, + 978.0, + 671.0, + 978.0, + 711.0, + 296.0, + 711.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1438.0, + 1143.0, + 1438.0, + 1143.0, + 1475.0, + 294.0, + 1475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 480.0, + 407.0, + 480.0, + 407.0, + 531.0, + 291.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 441.0, + 480.0, + 508.0, + 480.0, + 508.0, + 531.0, + 441.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 480.0, + 931.0, + 480.0, + 931.0, + 531.0, + 541.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 480.0, + 1408.0, + 480.0, + 1408.0, + 531.0, + 1345.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 692.0, + 520.0, + 777.0, + 520.0, + 777.0, + 569.0, + 692.0, + 569.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1495.0, + 839.0, + 1495.0, + 839.0, + 1535.0, + 295.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 858.0, + 1495.0, + 1030.0, + 1495.0, + 1030.0, + 1535.0, + 858.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1234.0, + 1495.0, + 1348.0, + 1495.0, + 1348.0, + 1535.0, + 1234.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 411.0, + 1527.0, + 1045.0, + 1527.0, + 1045.0, + 1564.0, + 411.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1103.0, + 1527.0, + 1212.0, + 1527.0, + 1212.0, + 1564.0, + 1103.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 2001.0, + 501.0, + 2001.0, + 501.0, + 2037.0, + 290.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 2001.0, + 576.0, + 2001.0, + 576.0, + 2037.0, + 567.0, + 2037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1390.0, + 412.0, + 1390.0, + 412.0, + 1431.0, + 296.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 1390.0, + 523.0, + 1390.0, + 523.0, + 1431.0, + 452.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 1390.0, + 924.0, + 1390.0, + 924.0, + 1431.0, + 750.0, + 1431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 944.0, + 1390.0, + 953.0, + 1390.0, + 953.0, + 1431.0, + 944.0, + 1431.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 5, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 1261, + 1404, + 1261, + 1404, + 1537, + 297, + 1537 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 690, + 1405, + 690, + 1405, + 1014, + 297, + 1014 + ], + "score": 0.982 + }, + { + "category_id": 1, + "poly": [ + 298, + 1027, + 1404, + 1027, + 1404, + 1249, + 298, + 1249 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 298, + 338, + 1404, + 338, + 1404, + 522, + 298, + 522 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 299, + 1552, + 1403, + 1552, + 1403, + 1676, + 299, + 1676 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 298, + 1768, + 1403, + 1768, + 1403, + 1984, + 298, + 1984 + ], + "score": 0.977 + }, + { + "category_id": 2, + "poly": [ + 318, + 2007, + 1302, + 2007, + 1302, + 2034, + 318, + 2034 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 300, + 634, + 625, + 634, + 625, + 665, + 300, + 665 + ], + "score": 0.898 + }, + { + "category_id": 0, + "poly": [ + 300, + 1712, + 626, + 1712, + 626, + 1743, + 300, + 1743 + ], + "score": 0.893 + }, + { + "category_id": 0, + "poly": [ + 300, + 566, + 660, + 566, + 660, + 601, + 300, + 601 + ], + "score": 0.88 + }, + { + "category_id": 1, + "poly": [ + 299, + 228, + 1400, + 228, + 1400, + 323, + 299, + 323 + ], + "score": 0.752 + }, + { + "category_id": 2, + "poly": [ + 300, + 76, + 852, + 76, + 852, + 104, + 300, + 104 + ], + "score": 0.691 + }, + { + "category_id": 2, + "poly": [ + 842, + 2088, + 858, + 2088, + 858, + 2111, + 842, + 2111 + ], + "score": 0.681 + }, + { + "category_id": 2, + "poly": [ + 299, + 75, + 853, + 75, + 853, + 104, + 299, + 104 + ], + "score": 0.247 + }, + { + "category_id": 2, + "poly": [ + 841, + 2088, + 859, + 2088, + 859, + 2111, + 841, + 2111 + ], + "score": 0.182 + }, + { + "category_id": 13, + "poly": [ + 809, + 818, + 950, + 818, + 950, + 855, + 809, + 855 + ], + "score": 0.93, + "latex": "\\{ 0 . 5 ^ { | i - j | } \\} _ { i , j }" + }, + { + "category_id": 13, + "poly": [ + 882, + 460, + 1400, + 460, + 1400, + 494, + 882, + 494 + ], + "score": 0.93, + "latex": "B k + N ( t _ { k } ) = ( B + n ) k \\ll B n k = B N ( t _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 526, + 754, + 649, + 754, + 649, + 788, + 526, + 788 + ], + "score": 0.92, + "latex": "N ( 0 , 0 . 5 ^ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 611, + 950, + 782, + 950, + 782, + 984, + 611, + 984 + ], + "score": 0.92, + "latex": "N ( T _ { 1 } ) = 2 0 0 0" + }, + { + "category_id": 13, + "poly": [ + 297, + 1059, + 462, + 1059, + 462, + 1097, + 297, + 1097 + ], + "score": 0.92, + "latex": "X _ { i 2 } ) / \\sqrt { 2 } \\} X _ { i 3 } ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1019, + 399, + 1087, + 399, + 1087, + 432, + 1019, + 432 + ], + "score": 0.92, + "latex": "O ( B )" + }, + { + "category_id": 13, + "poly": [ + 760, + 982, + 836, + 982, + 836, + 1015, + 760, + 1015 + ], + "score": 0.92, + "latex": "( n , K )" + }, + { + "category_id": 13, + "poly": [ + 1141, + 819, + 1401, + 819, + 1401, + 858, + 1141, + 858 + ], + "score": 0.92, + "latex": "X _ { i j } ~ = ~ X _ { i j } ^ { * } \\mathbb { I } ( X _ { i j } ^ { * } | ~ \\le" + }, + { + "category_id": 13, + "poly": [ + 1044, + 1383, + 1107, + 1383, + 1107, + 1417, + 1044, + 1417 + ], + "score": 0.92, + "latex": "\\alpha _ { 1 } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 566, + 1093, + 744, + 1093, + 744, + 1127, + 566, + 1127 + ], + "score": 0.92, + "latex": "\\phi _ { \\delta } ( x ) = \\delta x ^ { 2 } / 3" + }, + { + "category_id": 13, + "poly": [ + 904, + 722, + 1394, + 722, + 1394, + 756, + 904, + 756 + ], + "score": 0.92, + "latex": "Y _ { i } ^ { * } ( a ) = 1 + ( X _ { i 1 } - X _ { i 2 } ) / 2 + a \\tau ( X _ { i } ) + \\varepsilon _ { i }" + }, + { + "category_id": 13, + "poly": [ + 833, + 950, + 1116, + 950, + 1116, + 985, + 833, + 985 + ], + "score": 0.92, + "latex": "\\bar { N ( T _ { j } ) } - \\bar { N } \\bar { ( T _ { j - 1 } ) } ^ { - } = 2 \\bar { n }" + }, + { + "category_id": 13, + "poly": [ + 1223, + 888, + 1394, + 888, + 1394, + 923, + 1223, + 923 + ], + "score": 0.92, + "latex": "\\textstyle \\pi _ { i } ( a , x ) = 0 . 5" + }, + { + "category_id": 13, + "poly": [ + 643, + 461, + 772, + 461, + 772, + 493, + 643, + 493 + ], + "score": 0.92, + "latex": "1 \\leq j \\leq K" + }, + { + "category_id": 13, + "poly": [ + 1153, + 1026, + 1403, + 1026, + 1403, + 1062, + 1153, + 1062 + ], + "score": 0.92, + "latex": "\\tau ( X _ { i } ) = \\phi _ { \\delta } \\{ ( X _ { i 1 } +" + }, + { + "category_id": 13, + "poly": [ + 1043, + 982, + 1246, + 982, + 1246, + 1015, + 1043, + 1015 + ], + "score": 0.91, + "latex": "( n , K ) = ( 2 0 0 , 5 )" + }, + { + "category_id": 13, + "poly": [ + 1158, + 951, + 1289, + 951, + 1289, + 982, + 1158, + 982 + ], + "score": 0.91, + "latex": "2 \\leq j \\leq K" + }, + { + "category_id": 13, + "poly": [ + 684, + 230, + 748, + 230, + 748, + 265, + 684, + 265 + ], + "score": 0.91, + "latex": "o _ { p } ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 298, + 460, + 553, + 460, + 553, + 494, + 298, + 494 + ], + "score": 0.91, + "latex": "N ( t _ { j } ) - N ( t _ { j - 1 } ) = n" + }, + { + "category_id": 13, + "poly": [ + 784, + 429, + 973, + 429, + 973, + 462, + 784, + 462 + ], + "score": 0.91, + "latex": "\\bar { O ( } B k + \\bar { N } ( t _ { k } ) )" + }, + { + "category_id": 13, + "poly": [ + 951, + 1094, + 1131, + 1094, + 1131, + 1126, + 951, + 1126 + ], + "score": 0.9, + "latex": "\\phi _ { \\delta } = \\delta \\cos ( \\pi x )" + }, + { + "category_id": 13, + "poly": [ + 1188, + 1154, + 1239, + 1154, + 1239, + 1187, + 1188, + 1187 + ], + "score": 0.9, + "latex": "\\varphi ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 295, + 854, + 628, + 854, + 628, + 893, + 295, + 893 + ], + "score": 0.9, + "latex": "2 ) + 2 \\mathrm { s g n } ( X _ { i j } ^ { * } ) \\mathbb { I } ( X _ { i j } ^ { * } | > 2 )" + }, + { + "category_id": 13, + "poly": [ + 595, + 786, + 883, + 786, + 883, + 821, + 595, + 821 + ], + "score": 0.9, + "latex": "X _ { i } ^ { * } ~ = ~ ( X _ { i 1 } ^ { * } , X _ { i 2 } ^ { * } , X _ { i 3 } ^ { * } ) ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 364, + 1506, + 431, + 1506, + 431, + 1534, + 364, + 1534 + ], + "score": 0.9, + "latex": "\\delta > 0" + }, + { + "category_id": 13, + "poly": [ + 852, + 756, + 1130, + 756, + 1130, + 789, + 852, + 789 + ], + "score": 0.9, + "latex": "X _ { i } ~ = ~ ( X _ { i 1 } , X _ { i 2 } , X _ { i 3 } ) ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 955, + 1955, + 989, + 1955, + 989, + 1983, + 955, + 1983 + ], + "score": 0.89, + "latex": "X _ { i }" + }, + { + "category_id": 13, + "poly": [ + 634, + 1029, + 755, + 1029, + 755, + 1058, + 634, + 1058 + ], + "score": 0.88, + "latex": "\\alpha = 0 . 0 5" + }, + { + "category_id": 13, + "poly": [ + 543, + 1155, + 581, + 1155, + 581, + 1185, + 543, + 1185 + ], + "score": 0.88, + "latex": "H _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 899, + 1029, + 1043, + 1029, + 1043, + 1057, + 899, + 1057 + ], + "score": 0.88, + "latex": "B \\ = \\ 1 0 0 0 0" + }, + { + "category_id": 13, + "poly": [ + 1322, + 1124, + 1393, + 1124, + 1393, + 1152, + 1322, + 1152 + ], + "score": 0.88, + "latex": "\\delta = 0" + }, + { + "category_id": 13, + "poly": [ + 975, + 1062, + 1045, + 1062, + 1045, + 1093, + 975, + 1093 + ], + "score": 0.88, + "latex": "\\delta \\geq 0" + }, + { + "category_id": 13, + "poly": [ + 297, + 1155, + 336, + 1155, + 336, + 1185, + 297, + 1185 + ], + "score": 0.87, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 952, + 386, + 952, + 386, + 980, + 297, + 980 + ], + "score": 0.87, + "latex": "\\varepsilon = 0 . 3" + }, + { + "category_id": 13, + "poly": [ + 297, + 1096, + 328, + 1096, + 328, + 1126, + 297, + 1126 + ], + "score": 0.87, + "latex": "\\phi _ { \\delta }" + }, + { + "category_id": 13, + "poly": [ + 673, + 1063, + 704, + 1063, + 704, + 1093, + 673, + 1093 + ], + "score": 0.87, + "latex": "\\phi _ { \\delta }" + }, + { + "category_id": 13, + "poly": [ + 500, + 1861, + 529, + 1861, + 529, + 1892, + 500, + 1892 + ], + "score": 0.86, + "latex": "Y _ { i }" + }, + { + "category_id": 13, + "poly": [ + 297, + 983, + 368, + 983, + 368, + 1011, + 297, + 1011 + ], + "score": 0.86, + "latex": "n > 0" + }, + { + "category_id": 13, + "poly": [ + 384, + 925, + 430, + 925, + 430, + 951, + 384, + 951 + ], + "score": 0.86, + "latex": "a , x" + }, + { + "category_id": 13, + "poly": [ + 609, + 1215, + 687, + 1215, + 687, + 1249, + 609, + 1249 + ], + "score": 0.85, + "latex": "[ - 2 , 2 ]" + }, + { + "category_id": 13, + "poly": [ + 374, + 759, + 401, + 759, + 401, + 786, + 374, + 786 + ], + "score": 0.83, + "latex": "\\varepsilon _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1178, + 401, + 1204, + 401, + 1204, + 427, + 1178, + 427 + ], + "score": 0.81, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 1086, + 432, + 1104, + 432, + 1104, + 457, + 1086, + 457 + ], + "score": 0.8, + "latex": "k" + }, + { + "category_id": 13, + "poly": [ + 469, + 494, + 494, + 494, + 494, + 518, + 469, + 518 + ], + "score": 0.79, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 851, + 1125, + 1141, + 1125, + 1141, + 1156, + 851, + 1156 + ], + "score": 0.79, + "latex": "\\delta = 0 , 0 . 1 , 0 . 1 5 , 0 . 2 , 0 . 2 5" + }, + { + "category_id": 13, + "poly": [ + 398, + 498, + 419, + 498, + 419, + 518, + 398, + 518 + ], + "score": 0.77, + "latex": "n" + }, + { + "category_id": 13, + "poly": [ + 481, + 923, + 494, + 923, + 494, + 948, + 481, + 948 + ], + "score": 0.7, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 868, + 927, + 882, + 927, + 882, + 948, + 868, + 948 + ], + "score": 0.7, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 775, + 1477, + 793, + 1477, + 793, + 1503, + 775, + 1503 + ], + "score": 0.7, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 1254, + 2006, + 1302, + 2006, + 1302, + 2031, + 1254, + 2031 + ], + "score": 0.48, + "latex": "_ { - 4 9 }" + }, + { + "category_id": 13, + "poly": [ + 1165, + 2010, + 1182, + 2010, + 1182, + 2030, + 1165, + 2030 + ], + "score": 0.47, + "latex": "=" + }, + { + "category_id": 13, + "poly": [ + 468, + 1615, + 490, + 1615, + 490, + 1642, + 468, + 1642 + ], + "score": 0.29, + "latex": "\\mathrm { F }" + }, + { + "category_id": 13, + "poly": [ + 387, + 1833, + 400, + 1833, + 400, + 1858, + 387, + 1858 + ], + "score": 0.27, + "latex": "i" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 2002.0, + 1164.0, + 2002.0, + 1164.0, + 2038.0, + 332.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1183.0, + 2002.0, + 1253.0, + 2002.0, + 1253.0, + 2038.0, + 1183.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1303.0, + 2002.0, + 1306.0, + 2002.0, + 1306.0, + 2038.0, + 1303.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 633.0, + 629.0, + 633.0, + 629.0, + 669.0, + 295.0, + 669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1710.0, + 631.0, + 1710.0, + 631.0, + 1746.0, + 294.0, + 1746.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 564.0, + 662.0, + 564.0, + 662.0, + 608.0, + 292.0, + 608.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, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2119.0, + 840.0, + 2119.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": [ + 840.0, + 2086.0, + 860.0, + 2086.0, + 860.0, + 2119.0, + 840.0, + 2119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1262.0, + 1405.0, + 1262.0, + 1405.0, + 1298.0, + 296.0, + 1298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1292.0, + 1406.0, + 1292.0, + 1406.0, + 1329.0, + 295.0, + 1329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1319.0, + 1405.0, + 1319.0, + 1405.0, + 1361.0, + 292.0, + 1361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1353.0, + 1404.0, + 1353.0, + 1404.0, + 1390.0, + 295.0, + 1390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1381.0, + 1043.0, + 1381.0, + 1043.0, + 1423.0, + 291.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 1381.0, + 1405.0, + 1381.0, + 1405.0, + 1423.0, + 1108.0, + 1423.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1412.0, + 1405.0, + 1412.0, + 1405.0, + 1451.0, + 292.0, + 1451.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1443.0, + 1405.0, + 1443.0, + 1405.0, + 1479.0, + 292.0, + 1479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1472.0, + 774.0, + 1472.0, + 774.0, + 1515.0, + 291.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 794.0, + 1472.0, + 1405.0, + 1472.0, + 1405.0, + 1515.0, + 794.0, + 1515.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1505.0, + 363.0, + 1505.0, + 363.0, + 1543.0, + 294.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 1505.0, + 959.0, + 1505.0, + 959.0, + 1543.0, + 432.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 692.0, + 1405.0, + 692.0, + 1405.0, + 725.0, + 296.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 718.0, + 903.0, + 718.0, + 903.0, + 759.0, + 294.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 718.0, + 1406.0, + 718.0, + 1406.0, + 759.0, + 1395.0, + 759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 751.0, + 373.0, + 751.0, + 373.0, + 792.0, + 294.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 402.0, + 751.0, + 525.0, + 751.0, + 525.0, + 792.0, + 402.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 751.0, + 851.0, + 751.0, + 851.0, + 792.0, + 650.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1131.0, + 751.0, + 1405.0, + 751.0, + 1405.0, + 792.0, + 1131.0, + 792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 782.0, + 594.0, + 782.0, + 594.0, + 824.0, + 290.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 884.0, + 782.0, + 1407.0, + 782.0, + 1407.0, + 824.0, + 884.0, + 824.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 807.0, + 808.0, + 807.0, + 808.0, + 864.0, + 289.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 951.0, + 807.0, + 1140.0, + 807.0, + 1140.0, + 864.0, + 951.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 807.0, + 1408.0, + 807.0, + 1408.0, + 864.0, + 1402.0, + 864.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 855.0, + 1405.0, + 855.0, + 1405.0, + 892.0, + 629.0, + 892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 890.0, + 1222.0, + 890.0, + 1222.0, + 924.0, + 295.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 890.0, + 1403.0, + 890.0, + 1403.0, + 924.0, + 1395.0, + 924.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 920.0, + 383.0, + 920.0, + 383.0, + 957.0, + 294.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.0, + 920.0, + 480.0, + 920.0, + 480.0, + 957.0, + 431.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 920.0, + 867.0, + 920.0, + 867.0, + 957.0, + 495.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 883.0, + 920.0, + 1405.0, + 920.0, + 1405.0, + 957.0, + 883.0, + 957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 949.0, + 296.0, + 949.0, + 296.0, + 986.0, + 292.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 387.0, + 949.0, + 610.0, + 949.0, + 610.0, + 986.0, + 387.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 949.0, + 832.0, + 949.0, + 832.0, + 986.0, + 783.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1117.0, + 949.0, + 1157.0, + 949.0, + 1157.0, + 986.0, + 1117.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1290.0, + 949.0, + 1403.0, + 949.0, + 1403.0, + 986.0, + 1290.0, + 986.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 981.0, + 296.0, + 981.0, + 296.0, + 1018.0, + 292.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 981.0, + 759.0, + 981.0, + 759.0, + 1018.0, + 369.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 837.0, + 981.0, + 1042.0, + 981.0, + 1042.0, + 1018.0, + 837.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1247.0, + 981.0, + 1401.0, + 981.0, + 1401.0, + 1018.0, + 1247.0, + 1018.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1024.0, + 633.0, + 1024.0, + 633.0, + 1065.0, + 295.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1024.0, + 898.0, + 1024.0, + 898.0, + 1065.0, + 756.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1044.0, + 1024.0, + 1152.0, + 1024.0, + 1152.0, + 1065.0, + 1044.0, + 1065.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1057.0, + 296.0, + 1057.0, + 296.0, + 1100.0, + 293.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 463.0, + 1057.0, + 672.0, + 1057.0, + 672.0, + 1100.0, + 463.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 705.0, + 1057.0, + 974.0, + 1057.0, + 974.0, + 1100.0, + 705.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1046.0, + 1057.0, + 1408.0, + 1057.0, + 1408.0, + 1100.0, + 1046.0, + 1100.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1091.0, + 296.0, + 1091.0, + 296.0, + 1130.0, + 293.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 329.0, + 1091.0, + 565.0, + 1091.0, + 565.0, + 1130.0, + 329.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 1091.0, + 950.0, + 1091.0, + 950.0, + 1130.0, + 745.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.0, + 1091.0, + 1406.0, + 1091.0, + 1406.0, + 1130.0, + 1132.0, + 1130.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1123.0, + 850.0, + 1123.0, + 850.0, + 1158.0, + 293.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1142.0, + 1123.0, + 1321.0, + 1123.0, + 1321.0, + 1158.0, + 1142.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1123.0, + 1405.0, + 1123.0, + 1405.0, + 1158.0, + 1394.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 337.0, + 1156.0, + 542.0, + 1156.0, + 542.0, + 1187.0, + 337.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 1156.0, + 1187.0, + 1156.0, + 1187.0, + 1187.0, + 582.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1156.0, + 1402.0, + 1156.0, + 1402.0, + 1187.0, + 1240.0, + 1187.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1186.0, + 1404.0, + 1186.0, + 1404.0, + 1217.0, + 296.0, + 1217.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1216.0, + 608.0, + 1216.0, + 608.0, + 1251.0, + 294.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 688.0, + 1216.0, + 699.0, + 1216.0, + 699.0, + 1251.0, + 688.0, + 1251.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 337.0, + 1405.0, + 337.0, + 1405.0, + 373.0, + 294.0, + 373.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 368.0, + 1406.0, + 368.0, + 1406.0, + 403.0, + 294.0, + 403.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 398.0, + 1018.0, + 398.0, + 1018.0, + 435.0, + 292.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1088.0, + 398.0, + 1177.0, + 398.0, + 1177.0, + 435.0, + 1088.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1205.0, + 398.0, + 1407.0, + 398.0, + 1407.0, + 435.0, + 1205.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 426.0, + 783.0, + 426.0, + 783.0, + 467.0, + 292.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 974.0, + 426.0, + 1085.0, + 426.0, + 1085.0, + 467.0, + 974.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1105.0, + 426.0, + 1408.0, + 426.0, + 1408.0, + 467.0, + 1105.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 458.0, + 297.0, + 458.0, + 297.0, + 497.0, + 294.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 458.0, + 642.0, + 458.0, + 642.0, + 497.0, + 554.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 458.0, + 881.0, + 458.0, + 881.0, + 497.0, + 773.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 458.0, + 1405.0, + 458.0, + 1405.0, + 497.0, + 1401.0, + 497.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 488.0, + 397.0, + 488.0, + 397.0, + 526.0, + 293.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 420.0, + 488.0, + 468.0, + 488.0, + 468.0, + 526.0, + 420.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 488.0, + 1372.0, + 488.0, + 1372.0, + 526.0, + 495.0, + 526.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1550.0, + 1403.0, + 1550.0, + 1403.0, + 1587.0, + 294.0, + 1587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1586.0, + 1404.0, + 1586.0, + 1404.0, + 1615.0, + 297.0, + 1615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1615.0, + 467.0, + 1615.0, + 467.0, + 1648.0, + 295.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 491.0, + 1615.0, + 1405.0, + 1615.0, + 1405.0, + 1648.0, + 491.0, + 1648.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1644.0, + 1137.0, + 1644.0, + 1137.0, + 1680.0, + 294.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1767.0, + 1401.0, + 1767.0, + 1401.0, + 1803.0, + 292.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1797.0, + 1404.0, + 1797.0, + 1404.0, + 1834.0, + 293.0, + 1834.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1827.0, + 386.0, + 1827.0, + 386.0, + 1866.0, + 292.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 401.0, + 1827.0, + 1403.0, + 1827.0, + 1403.0, + 1866.0, + 401.0, + 1866.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1861.0, + 499.0, + 1861.0, + 499.0, + 1896.0, + 293.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 530.0, + 1861.0, + 1405.0, + 1861.0, + 1405.0, + 1896.0, + 530.0, + 1896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1892.0, + 1405.0, + 1892.0, + 1405.0, + 1927.0, + 293.0, + 1927.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1922.0, + 1407.0, + 1922.0, + 1407.0, + 1956.0, + 293.0, + 1956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1950.0, + 954.0, + 1950.0, + 954.0, + 1987.0, + 293.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 1950.0, + 1407.0, + 1950.0, + 1407.0, + 1987.0, + 990.0, + 1987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 228.0, + 683.0, + 228.0, + 683.0, + 266.0, + 295.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 228.0, + 1402.0, + 228.0, + 1402.0, + 266.0, + 749.0, + 266.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, + 290.0, + 514.0, + 290.0, + 514.0, + 328.0, + 294.0, + 328.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 6, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 989, + 1405, + 989, + 1405, + 1236, + 297, + 1236 + ], + "score": 0.981 + }, + { + "category_id": 1, + "poly": [ + 298, + 1350, + 1403, + 1350, + 1403, + 1472, + 298, + 1472 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 299, + 851, + 1405, + 851, + 1405, + 973, + 299, + 973 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 301, + 223, + 1399, + 223, + 1399, + 673, + 301, + 673 + ], + "score": 0.97 + }, + { + "category_id": 3, + "poly": [ + 297, + 1539, + 1399, + 1539, + 1399, + 1984, + 297, + 1984 + ], + "score": 0.969 + }, + { + "category_id": 4, + "poly": [ + 297, + 710, + 1405, + 710, + 1405, + 795, + 297, + 795 + ], + "score": 0.958 + }, + { + "category_id": 4, + "poly": [ + 631, + 1998, + 1068, + 1998, + 1068, + 2028, + 631, + 2028 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 299, + 1279, + 529, + 1279, + 529, + 1314, + 299, + 1314 + ], + "score": 0.9 + }, + { + "category_id": 2, + "poly": [ + 300, + 77, + 852, + 77, + 852, + 104, + 300, + 104 + ], + "score": 0.867 + }, + { + "category_id": 2, + "poly": [ + 840, + 2089, + 858, + 2089, + 858, + 2112, + 840, + 2112 + ], + "score": 0.806 + }, + { + "category_id": 13, + "poly": [ + 825, + 913, + 918, + 913, + 918, + 944, + 825, + 944 + ], + "score": 0.93, + "latex": "A _ { i } = 1" + }, + { + "category_id": 13, + "poly": [ + 1210, + 710, + 1268, + 710, + 1268, + 740, + 1210, + 740 + ], + "score": 0.91, + "latex": "\\alpha _ { 1 } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 297, + 944, + 382, + 944, + 382, + 974, + 297, + 974 + ], + "score": 0.91, + "latex": "A _ { i } = 0" + }, + { + "category_id": 13, + "poly": [ + 1013, + 1204, + 1051, + 1204, + 1051, + 1234, + 1013, + 1234 + ], + "score": 0.89, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 773, + 1174, + 812, + 1174, + 812, + 1204, + 773, + 1204 + ], + "score": 0.89, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 365, + 1083, + 403, + 1083, + 403, + 1112, + 365, + 1112 + ], + "score": 0.88, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 819, + 771, + 832, + 771, + 832, + 791, + 819, + 791 + ], + "score": 0.66, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 1232, + 743, + 1245, + 743, + 1245, + 763, + 1232, + 763 + ], + "score": 0.58, + "latex": "\\epsilon" + }, + { + "category_id": 15, + "poly": [ + 432.0, + 231.0, + 504.0, + 231.0, + 504.0, + 252.0, + 432.0, + 252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 229.0, + 778.0, + 229.0, + 778.0, + 254.0, + 699.0, + 254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 231.0, + 1045.0, + 231.0, + 1045.0, + 252.0, + 972.0, + 252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 229.0, + 1319.0, + 229.0, + 1319.0, + 254.0, + 1241.0, + 254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 256.0, + 352.0, + 256.0, + 352.0, + 280.0, + 321.0, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 368.0, + 258.0, + 456.0, + 258.0, + 456.0, + 282.0, + 368.0, + 282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 592.0, + 256.0, + 623.0, + 256.0, + 623.0, + 279.0, + 592.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 264.0, + 653.0, + 264.0, + 653.0, + 274.0, + 638.0, + 274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 655.0, + 258.0, + 726.0, + 258.0, + 726.0, + 282.0, + 655.0, + 282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 266.0, + 846.0, + 266.0, + 846.0, + 281.0, + 830.0, + 281.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 861.0, + 256.0, + 894.0, + 256.0, + 894.0, + 279.0, + 861.0, + 279.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 258.0, + 997.0, + 258.0, + 997.0, + 282.0, + 906.0, + 282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 256.0, + 1164.0, + 256.0, + 1164.0, + 280.0, + 1133.0, + 280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 258.0, + 1268.0, + 258.0, + 1268.0, + 282.0, + 1176.0, + 282.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 286.0, + 351.0, + 286.0, + 351.0, + 307.0, + 327.0, + 307.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 276.0, + 454.0, + 276.0, + 454.0, + 297.0, + 362.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 285.0, + 624.0, + 285.0, + 624.0, + 308.0, + 597.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 632.0, + 277.0, + 725.0, + 277.0, + 725.0, + 298.0, + 632.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 285.0, + 895.0, + 285.0, + 895.0, + 308.0, + 866.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 276.0, + 994.0, + 276.0, + 994.0, + 297.0, + 904.0, + 297.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 285.0, + 1166.0, + 285.0, + 1166.0, + 308.0, + 1138.0, + 308.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1169.0, + 275.0, + 1267.0, + 275.0, + 1267.0, + 298.0, + 1169.0, + 298.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 367.0, + 299.0, + 385.0, + 299.0, + 385.0, + 313.0, + 367.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 295.0, + 451.0, + 295.0, + 451.0, + 319.0, + 386.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 637.0, + 298.0, + 655.0, + 298.0, + 655.0, + 313.0, + 637.0, + 313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 657.0, + 295.0, + 720.0, + 295.0, + 720.0, + 319.0, + 657.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 295.0, + 991.0, + 295.0, + 991.0, + 319.0, + 907.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 295.0, + 1262.0, + 295.0, + 1262.0, + 319.0, + 1176.0, + 319.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 307.0, + 307.0, + 351.0, + 307.0, + 351.0, + 372.0, + 307.0, + 372.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 313.0, + 452.0, + 313.0, + 452.0, + 338.0, + 365.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 313.0, + 624.0, + 313.0, + 624.0, + 336.0, + 597.0, + 336.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 313.0, + 721.0, + 313.0, + 721.0, + 338.0, + 634.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 315.0, + 892.0, + 315.0, + 892.0, + 335.0, + 870.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 313.0, + 992.0, + 313.0, + 992.0, + 338.0, + 905.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 315.0, + 1164.0, + 315.0, + 1164.0, + 335.0, + 1140.0, + 335.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 313.0, + 1262.0, + 313.0, + 1262.0, + 338.0, + 1174.0, + 338.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 341.0, + 352.0, + 341.0, + 352.0, + 366.0, + 326.0, + 366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 342.0, + 622.0, + 342.0, + 622.0, + 363.0, + 598.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 869.0, + 342.0, + 892.0, + 342.0, + 892.0, + 363.0, + 869.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 342.0, + 1163.0, + 342.0, + 1163.0, + 363.0, + 1141.0, + 363.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 372.0, + 351.0, + 372.0, + 351.0, + 393.0, + 328.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 565.0, + 388.0, + 574.0, + 388.0, + 574.0, + 398.0, + 565.0, + 398.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 371.0, + 624.0, + 371.0, + 624.0, + 394.0, + 597.0, + 394.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 384.0, + 845.0, + 384.0, + 845.0, + 396.0, + 835.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 372.0, + 892.0, + 372.0, + 892.0, + 393.0, + 870.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 372.0, + 1163.0, + 372.0, + 1163.0, + 393.0, + 1141.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 385.0, + 1388.0, + 385.0, + 1388.0, + 396.0, + 1377.0, + 396.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 400.0, + 352.0, + 400.0, + 352.0, + 421.0, + 333.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 400.0, + 623.0, + 400.0, + 623.0, + 421.0, + 604.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 400.0, + 894.0, + 400.0, + 894.0, + 421.0, + 875.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 400.0, + 1082.0, + 400.0, + 1082.0, + 410.0, + 1073.0, + 410.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 400.0, + 1164.0, + 400.0, + 1164.0, + 421.0, + 1146.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 452.0, + 352.0, + 452.0, + 352.0, + 474.0, + 315.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 358.0, + 460.0, + 373.0, + 460.0, + 373.0, + 479.0, + 358.0, + 479.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 428.0, + 463.0, + 438.0, + 463.0, + 438.0, + 471.0, + 428.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 462.0, + 508.0, + 462.0, + 508.0, + 473.0, + 497.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 527.0, + 463.0, + 543.0, + 463.0, + 543.0, + 476.0, + 527.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 453.0, + 623.0, + 453.0, + 623.0, + 474.0, + 584.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 459.0, + 643.0, + 459.0, + 643.0, + 475.0, + 627.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 734.0, + 463.0, + 745.0, + 463.0, + 745.0, + 473.0, + 734.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 768.0, + 463.0, + 778.0, + 463.0, + 778.0, + 471.0, + 768.0, + 471.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 799.0, + 462.0, + 814.0, + 462.0, + 814.0, + 476.0, + 799.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 453.0, + 894.0, + 453.0, + 894.0, + 474.0, + 855.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 462.0, + 980.0, + 462.0, + 980.0, + 473.0, + 969.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.0, + 462.0, + 1015.0, + 462.0, + 1015.0, + 473.0, + 1003.0, + 473.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 460.0, + 1051.0, + 460.0, + 1051.0, + 475.0, + 1036.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1070.0, + 462.0, + 1086.0, + 462.0, + 1086.0, + 476.0, + 1070.0, + 476.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 453.0, + 1166.0, + 453.0, + 1166.0, + 474.0, + 1126.0, + 474.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 463.0, + 1354.0, + 463.0, + 1354.0, + 475.0, + 1343.0, + 475.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 563.0, + 473.0, + 575.0, + 473.0, + 575.0, + 484.0, + 563.0, + 484.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 469.0, + 846.0, + 469.0, + 846.0, + 480.0, + 834.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 470.0, + 984.0, + 470.0, + 984.0, + 485.0, + 967.0, + 485.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 471.0, + 1117.0, + 471.0, + 1117.0, + 481.0, + 1107.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 470.0, + 1252.0, + 470.0, + 1252.0, + 481.0, + 1241.0, + 481.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1377.0, + 470.0, + 1387.0, + 470.0, + 1387.0, + 480.0, + 1377.0, + 480.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 497.0, + 351.0, + 497.0, + 351.0, + 594.0, + 300.0, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 496.0, + 624.0, + 496.0, + 624.0, + 522.0, + 583.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 495.0, + 895.0, + 495.0, + 895.0, + 520.0, + 854.0, + 520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 901.0, + 496.0, + 912.0, + 496.0, + 912.0, + 506.0, + 901.0, + 506.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1127.0, + 497.0, + 1164.0, + 497.0, + 1164.0, + 519.0, + 1127.0, + 519.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 544.0, + 351.0, + 544.0, + 351.0, + 566.0, + 313.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 544.0, + 456.0, + 544.0, + 456.0, + 568.0, + 362.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 544.0, + 623.0, + 544.0, + 623.0, + 566.0, + 584.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 544.0, + 726.0, + 544.0, + 726.0, + 568.0, + 635.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 540.0, + 895.0, + 540.0, + 895.0, + 566.0, + 854.0, + 566.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 906.0, + 544.0, + 997.0, + 544.0, + 997.0, + 568.0, + 906.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 543.0, + 1164.0, + 543.0, + 1164.0, + 565.0, + 1126.0, + 565.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 544.0, + 1269.0, + 544.0, + 1269.0, + 568.0, + 1176.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 562.0, + 456.0, + 562.0, + 456.0, + 587.0, + 363.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 562.0, + 725.0, + 562.0, + 725.0, + 587.0, + 634.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 562.0, + 996.0, + 562.0, + 996.0, + 587.0, + 905.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 562.0, + 1268.0, + 562.0, + 1268.0, + 587.0, + 1176.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 315.0, + 590.0, + 351.0, + 590.0, + 351.0, + 614.0, + 315.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 363.0, + 581.0, + 451.0, + 581.0, + 451.0, + 624.0, + 363.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 588.0, + 624.0, + 588.0, + 624.0, + 614.0, + 584.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 581.0, + 721.0, + 581.0, + 721.0, + 624.0, + 634.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 584.0, + 895.0, + 584.0, + 895.0, + 610.0, + 854.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 583.0, + 992.0, + 583.0, + 992.0, + 624.0, + 905.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 587.0, + 1166.0, + 587.0, + 1166.0, + 613.0, + 1126.0, + 613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1176.0, + 582.0, + 1262.0, + 582.0, + 1262.0, + 624.0, + 1176.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 564.0, + 616.0, + 575.0, + 616.0, + 575.0, + 627.0, + 564.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 616.0, + 846.0, + 616.0, + 846.0, + 627.0, + 835.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1378.0, + 617.0, + 1387.0, + 617.0, + 1387.0, + 627.0, + 1378.0, + 627.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 636.0, + 587.0, + 636.0, + 587.0, + 655.0, + 348.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 619.0, + 636.0, + 857.0, + 636.0, + 857.0, + 655.0, + 619.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 636.0, + 1128.0, + 636.0, + 1128.0, + 655.0, + 890.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1161.0, + 636.0, + 1398.0, + 636.0, + 1398.0, + 655.0, + 1161.0, + 655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 458.0, + 653.0, + 478.0, + 653.0, + 478.0, + 673.0, + 458.0, + 673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 654.0, + 748.0, + 654.0, + 748.0, + 670.0, + 730.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 653.0, + 1020.0, + 653.0, + 1020.0, + 673.0, + 1000.0, + 673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 654.0, + 1288.0, + 654.0, + 1288.0, + 671.0, + 1272.0, + 671.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1323.0, + 265.0, + 1399.0, + 265.0, + 1399.0, + 288.5, + 1323.0, + 288.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 292.5, + 825.0, + 292.5, + 825.0, + 306.5, + 766.0, + 306.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1307.0, + 314.0, + 1329.0, + 314.0, + 1329.0, + 321.0, + 1307.0, + 321.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 303.5, + 588.0, + 303.5, + 588.0, + 329.5, + 434.0, + 329.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 342.0, + 790.0, + 342.0, + 790.0, + 362.5, + 685.0, + 362.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1268.0, + 368.0, + 1288.0, + 368.0, + 1288.0, + 374.0, + 1268.0, + 374.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1236.0, + 394.0, + 1254.0, + 394.0, + 1254.0, + 402.5, + 1236.0, + 402.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 897.0, + 459.5, + 918.0, + 459.5, + 918.0, + 477.5, + 897.0, + 477.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 461.0, + 1288.0, + 461.0, + 1288.0, + 472.0, + 1270.0, + 472.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 431.75, + 486.0, + 435.75, + 486.0, + 435.75, + 495.0, + 431.75, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.75, + 547.5, + 536.75, + 547.5, + 536.75, + 570.5, + 465.75, + 570.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.25, + 557.0, + 823.25, + 557.0, + 823.25, + 578.0, + 739.25, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 551.5, + 1078.0, + 551.5, + 1078.0, + 571.5, + 1036.0, + 571.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1314.0, + 555.5, + 1336.0, + 555.5, + 1336.0, + 568.0, + 1314.0, + 568.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.25, + 585.5, + 1349.25, + 585.5, + 1349.25, + 594.0, + 1345.25, + 594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 477.0, + 1541.0, + 564.0, + 1541.0, + 564.0, + 1564.0, + 477.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 835.0, + 1541.0, + 921.0, + 1541.0, + 921.0, + 1564.0, + 835.0, + 1564.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1219.0, + 1540.0, + 1254.0, + 1540.0, + 1254.0, + 1567.0, + 1219.0, + 1567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1555.0, + 367.0, + 1555.0, + 367.0, + 1577.0, + 333.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1555.0, + 723.0, + 1555.0, + 723.0, + 1577.0, + 690.0, + 1577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1555.0, + 1082.0, + 1555.0, + 1082.0, + 1578.0, + 1048.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 1568.0, + 1121.0, + 1568.0, + 1121.0, + 1578.0, + 1111.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 1577.0, + 560.0, + 1577.0, + 560.0, + 1585.0, + 550.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1572.0, + 664.0, + 1572.0, + 664.0, + 1591.0, + 569.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 904.0, + 1574.0, + 922.0, + 1574.0, + 922.0, + 1588.0, + 904.0, + 1588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1572.0, + 1022.0, + 1572.0, + 1022.0, + 1591.0, + 927.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 1577.0, + 1276.0, + 1577.0, + 1276.0, + 1585.0, + 1261.0, + 1585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 1572.0, + 1378.0, + 1572.0, + 1378.0, + 1591.0, + 1285.0, + 1591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1583.0, + 366.0, + 1583.0, + 366.0, + 1606.0, + 333.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 567.0, + 1585.0, + 664.0, + 1585.0, + 664.0, + 1611.0, + 567.0, + 1611.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1583.0, + 724.0, + 1583.0, + 724.0, + 1606.0, + 690.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 1588.0, + 1018.0, + 1588.0, + 1018.0, + 1607.0, + 926.0, + 1607.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1583.0, + 1082.0, + 1583.0, + 1082.0, + 1606.0, + 1048.0, + 1606.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1285.0, + 1589.0, + 1376.0, + 1589.0, + 1376.0, + 1608.0, + 1285.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1611.0, + 367.0, + 1611.0, + 367.0, + 1634.0, + 333.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 377.0, + 1609.0, + 394.0, + 1609.0, + 394.0, + 1635.0, + 377.0, + 1635.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1611.0, + 724.0, + 1611.0, + 724.0, + 1634.0, + 690.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1612.0, + 1082.0, + 1612.0, + 1082.0, + 1634.0, + 1048.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 1612.0, + 1152.0, + 1612.0, + 1152.0, + 1626.0, + 1137.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 301.0, + 1629.0, + 328.0, + 1629.0, + 328.0, + 1670.0, + 301.0, + 1670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 1630.0, + 1179.0, + 1630.0, + 1179.0, + 1641.0, + 1166.0, + 1641.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1640.0, + 367.0, + 1640.0, + 367.0, + 1663.0, + 333.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1640.0, + 724.0, + 1640.0, + 724.0, + 1663.0, + 690.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1640.0, + 1081.0, + 1640.0, + 1081.0, + 1663.0, + 1048.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1224.0, + 1637.0, + 1235.0, + 1637.0, + 1235.0, + 1647.0, + 1224.0, + 1647.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1667.0, + 367.0, + 1667.0, + 367.0, + 1693.0, + 332.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1668.0, + 723.0, + 1668.0, + 723.0, + 1691.0, + 690.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1668.0, + 1081.0, + 1668.0, + 1081.0, + 1691.0, + 1048.0, + 1691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 1669.0, + 1264.0, + 1669.0, + 1264.0, + 1680.0, + 1252.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 380.0, + 1682.0, + 415.0, + 1682.0, + 415.0, + 1709.0, + 380.0, + 1709.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 744.0, + 1685.0, + 758.0, + 1685.0, + 758.0, + 1701.0, + 744.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 1681.0, + 1125.0, + 1681.0, + 1125.0, + 1695.0, + 1108.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 1685.0, + 1206.0, + 1685.0, + 1206.0, + 1695.0, + 1195.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 1690.0, + 1179.0, + 1690.0, + 1179.0, + 1701.0, + 1166.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1696.0, + 367.0, + 1696.0, + 367.0, + 1719.0, + 332.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 1696.0, + 724.0, + 1696.0, + 724.0, + 1719.0, + 689.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 1696.0, + 1082.0, + 1696.0, + 1082.0, + 1719.0, + 1047.0, + 1719.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1725.0, + 366.0, + 1725.0, + 366.0, + 1747.0, + 325.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 680.0, + 1724.0, + 724.0, + 1724.0, + 724.0, + 1749.0, + 680.0, + 1749.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 1725.0, + 1080.0, + 1725.0, + 1080.0, + 1747.0, + 1040.0, + 1747.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1742.0, + 392.0, + 1742.0, + 392.0, + 1763.0, + 372.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1742.0, + 477.0, + 1742.0, + 477.0, + 1763.0, + 425.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 490.0, + 1742.0, + 551.0, + 1742.0, + 551.0, + 1761.0, + 490.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 558.0, + 1742.0, + 619.0, + 1742.0, + 619.0, + 1761.0, + 558.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 624.0, + 1742.0, + 685.0, + 1742.0, + 685.0, + 1761.0, + 624.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 729.0, + 1742.0, + 750.0, + 1742.0, + 750.0, + 1763.0, + 729.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 1742.0, + 835.0, + 1742.0, + 835.0, + 1763.0, + 783.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1742.0, + 908.0, + 1742.0, + 908.0, + 1761.0, + 847.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.0, + 1742.0, + 976.0, + 1742.0, + 976.0, + 1761.0, + 914.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1742.0, + 1043.0, + 1742.0, + 1043.0, + 1763.0, + 983.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 1742.0, + 1097.0, + 1742.0, + 1097.0, + 1763.0, + 1077.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1133.0, + 1740.0, + 1181.0, + 1740.0, + 1181.0, + 1764.0, + 1133.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 1740.0, + 1256.0, + 1740.0, + 1256.0, + 1764.0, + 1201.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1272.0, + 1740.0, + 1326.0, + 1740.0, + 1326.0, + 1764.0, + 1272.0, + 1764.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1345.0, + 1742.0, + 1396.0, + 1742.0, + 1396.0, + 1763.0, + 1345.0, + 1763.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1775.0, + 367.0, + 1775.0, + 367.0, + 1798.0, + 333.0, + 1798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1776.0, + 665.0, + 1776.0, + 665.0, + 1796.0, + 569.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1775.0, + 724.0, + 1775.0, + 724.0, + 1798.0, + 690.0, + 1798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 927.0, + 1776.0, + 1022.0, + 1776.0, + 1022.0, + 1796.0, + 927.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1047.0, + 1775.0, + 1082.0, + 1775.0, + 1082.0, + 1798.0, + 1047.0, + 1798.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1111.0, + 1774.0, + 1121.0, + 1774.0, + 1121.0, + 1783.0, + 1111.0, + 1783.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1776.0, + 1378.0, + 1776.0, + 1378.0, + 1796.0, + 1284.0, + 1796.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 569.0, + 1789.0, + 663.0, + 1789.0, + 663.0, + 1815.0, + 569.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 925.0, + 1789.0, + 1021.0, + 1789.0, + 1021.0, + 1815.0, + 925.0, + 1815.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1284.0, + 1793.0, + 1376.0, + 1793.0, + 1376.0, + 1813.0, + 1284.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1807.0, + 367.0, + 1807.0, + 367.0, + 1828.0, + 333.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1807.0, + 724.0, + 1807.0, + 724.0, + 1828.0, + 690.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1805.0, + 1082.0, + 1805.0, + 1082.0, + 1828.0, + 1048.0, + 1828.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 1825.0, + 393.0, + 1825.0, + 393.0, + 1837.0, + 383.0, + 1837.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 303.0, + 1835.0, + 329.0, + 1835.0, + 329.0, + 1878.0, + 303.0, + 1878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1837.0, + 367.0, + 1837.0, + 367.0, + 1859.0, + 332.0, + 1859.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1837.0, + 724.0, + 1837.0, + 724.0, + 1860.0, + 690.0, + 1860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 743.0, + 1832.0, + 758.0, + 1832.0, + 758.0, + 1848.0, + 743.0, + 1848.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1837.0, + 1082.0, + 1837.0, + 1082.0, + 1860.0, + 1048.0, + 1860.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 1838.0, + 1177.0, + 1838.0, + 1177.0, + 1849.0, + 1166.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 737.0, + 1847.0, + 750.0, + 1847.0, + 750.0, + 1862.0, + 737.0, + 1862.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1308.0, + 1862.0, + 1320.0, + 1862.0, + 1320.0, + 1872.0, + 1308.0, + 1872.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 332.0, + 1866.0, + 367.0, + 1866.0, + 367.0, + 1893.0, + 332.0, + 1893.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1867.0, + 724.0, + 1867.0, + 724.0, + 1890.0, + 690.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1867.0, + 1081.0, + 1867.0, + 1081.0, + 1890.0, + 1048.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1336.0, + 1866.0, + 1348.0, + 1866.0, + 1348.0, + 1877.0, + 1336.0, + 1877.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1196.0, + 1890.0, + 1206.0, + 1890.0, + 1206.0, + 1899.0, + 1196.0, + 1899.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1899.0, + 367.0, + 1899.0, + 367.0, + 1921.0, + 333.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1899.0, + 724.0, + 1899.0, + 724.0, + 1921.0, + 690.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1048.0, + 1899.0, + 1082.0, + 1899.0, + 1082.0, + 1921.0, + 1048.0, + 1921.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1928.0, + 367.0, + 1928.0, + 367.0, + 1954.0, + 323.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 679.0, + 1928.0, + 724.0, + 1928.0, + 724.0, + 1954.0, + 679.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1928.0, + 1082.0, + 1928.0, + 1082.0, + 1954.0, + 1038.0, + 1954.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 1946.0, + 392.0, + 1946.0, + 392.0, + 1967.0, + 372.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1946.0, + 477.0, + 1946.0, + 477.0, + 1967.0, + 425.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 490.0, + 1946.0, + 551.0, + 1946.0, + 551.0, + 1966.0, + 490.0, + 1966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1946.0, + 685.0, + 1946.0, + 685.0, + 1966.0, + 556.0, + 1966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 730.0, + 1946.0, + 750.0, + 1946.0, + 750.0, + 1967.0, + 730.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 783.0, + 1946.0, + 835.0, + 1946.0, + 835.0, + 1967.0, + 783.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 847.0, + 1946.0, + 977.0, + 1946.0, + 977.0, + 1966.0, + 847.0, + 1966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 979.0, + 1946.0, + 1043.0, + 1946.0, + 1043.0, + 1966.0, + 979.0, + 1966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1077.0, + 1946.0, + 1097.0, + 1946.0, + 1097.0, + 1967.0, + 1077.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1946.0, + 1180.0, + 1946.0, + 1180.0, + 1967.0, + 1136.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1202.0, + 1946.0, + 1255.0, + 1946.0, + 1255.0, + 1967.0, + 1202.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1274.0, + 1946.0, + 1326.0, + 1946.0, + 1326.0, + 1967.0, + 1274.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1344.0, + 1946.0, + 1396.0, + 1946.0, + 1396.0, + 1967.0, + 1344.0, + 1967.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 1966.0, + 531.0, + 1966.0, + 531.0, + 1985.0, + 510.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 1966.0, + 889.0, + 1966.0, + 889.0, + 1985.0, + 868.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1225.0, + 1966.0, + 1247.0, + 1966.0, + 1247.0, + 1985.0, + 1225.0, + 1985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 394.25, + 1651.5, + 405.25, + 1651.5, + 405.25, + 1662.0, + 394.25, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 754.0, + 1657.5, + 781.0, + 1657.5, + 781.0, + 1673.5, + 754.0, + 1673.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1134.0, + 1815.0, + 1156.0, + 1815.0, + 1156.0, + 1832.0, + 1134.0, + 1832.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 1856.0, + 410.0, + 1856.0, + 410.0, + 1868.0, + 395.0, + 1868.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 707.0, + 1209.0, + 707.0, + 1209.0, + 743.0, + 295.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1269.0, + 707.0, + 1406.0, + 707.0, + 1406.0, + 743.0, + 1269.0, + 743.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 736.0, + 1231.0, + 736.0, + 1231.0, + 771.0, + 294.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 736.0, + 1403.0, + 736.0, + 1403.0, + 771.0, + 1246.0, + 771.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 762.0, + 818.0, + 762.0, + 818.0, + 801.0, + 292.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 762.0, + 989.0, + 762.0, + 989.0, + 801.0, + 833.0, + 801.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 628.0, + 1996.0, + 1071.0, + 1996.0, + 1071.0, + 2031.0, + 628.0, + 2031.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1275.0, + 535.0, + 1275.0, + 535.0, + 1322.0, + 292.0, + 1322.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 73.0, + 856.0, + 73.0, + 856.0, + 107.0, + 298.0, + 107.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": [ + 295.0, + 988.0, + 1405.0, + 988.0, + 1405.0, + 1025.0, + 295.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1021.0, + 1406.0, + 1021.0, + 1406.0, + 1055.0, + 295.0, + 1055.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1052.0, + 1406.0, + 1052.0, + 1406.0, + 1085.0, + 292.0, + 1085.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1081.0, + 364.0, + 1081.0, + 364.0, + 1116.0, + 291.0, + 1116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1081.0, + 1407.0, + 1081.0, + 1407.0, + 1116.0, + 404.0, + 1116.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1109.0, + 1406.0, + 1109.0, + 1406.0, + 1150.0, + 292.0, + 1150.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1143.0, + 1406.0, + 1143.0, + 1406.0, + 1176.0, + 295.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1173.0, + 772.0, + 1173.0, + 772.0, + 1208.0, + 294.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 1173.0, + 1407.0, + 1173.0, + 1407.0, + 1208.0, + 813.0, + 1208.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1204.0, + 1012.0, + 1204.0, + 1012.0, + 1238.0, + 294.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1052.0, + 1204.0, + 1202.0, + 1204.0, + 1202.0, + 1238.0, + 1052.0, + 1238.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1347.0, + 1405.0, + 1347.0, + 1405.0, + 1387.0, + 292.0, + 1387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1381.0, + 1403.0, + 1381.0, + 1403.0, + 1413.0, + 294.0, + 1413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1411.0, + 1404.0, + 1411.0, + 1404.0, + 1447.0, + 292.0, + 1447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1441.0, + 1307.0, + 1441.0, + 1307.0, + 1477.0, + 294.0, + 1477.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 851.0, + 1406.0, + 851.0, + 1406.0, + 883.0, + 294.0, + 883.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 883.0, + 1406.0, + 883.0, + 1406.0, + 915.0, + 294.0, + 915.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 911.0, + 824.0, + 911.0, + 824.0, + 946.0, + 294.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 919.0, + 911.0, + 1405.0, + 911.0, + 1405.0, + 946.0, + 919.0, + 946.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 383.0, + 941.0, + 508.0, + 941.0, + 508.0, + 977.0, + 383.0, + 977.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 7, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.817 + }, + { + "category_id": 0, + "poly": [ + 299, + 228, + 488, + 228, + 488, + 262, + 299, + 262 + ], + "score": 0.781 + }, + { + "category_id": 2, + "poly": [ + 840, + 2088, + 859, + 2088, + 859, + 2111, + 840, + 2111 + ], + "score": 0.772 + }, + { + "category_id": 1, + "poly": [ + 290, + 1601, + 1404, + 1601, + 1404, + 1666, + 290, + 1666 + ], + "score": 0.572 + }, + { + "category_id": 1, + "poly": [ + 299, + 626, + 1404, + 626, + 1404, + 720, + 299, + 720 + ], + "score": 0.568 + }, + { + "category_id": 1, + "poly": [ + 297, + 825, + 1401, + 825, + 1401, + 921, + 297, + 921 + ], + "score": 0.566 + }, + { + "category_id": 1, + "poly": [ + 296, + 1685, + 1402, + 1685, + 1402, + 1750, + 296, + 1750 + ], + "score": 0.565 + }, + { + "category_id": 1, + "poly": [ + 294, + 740, + 1400, + 740, + 1400, + 804, + 294, + 804 + ], + "score": 0.563 + }, + { + "category_id": 1, + "poly": [ + 290, + 940, + 1400, + 940, + 1400, + 1004, + 290, + 1004 + ], + "score": 0.553 + }, + { + "category_id": 1, + "poly": [ + 300, + 509, + 1400, + 509, + 1400, + 605, + 300, + 605 + ], + "score": 0.546 + }, + { + "category_id": 1, + "poly": [ + 299, + 280, + 1399, + 280, + 1399, + 374, + 299, + 374 + ], + "score": 0.545 + }, + { + "category_id": 1, + "poly": [ + 298, + 1255, + 1398, + 1255, + 1398, + 1351, + 298, + 1351 + ], + "score": 0.542 + }, + { + "category_id": 1, + "poly": [ + 298, + 1516, + 1401, + 1516, + 1401, + 1581, + 298, + 1581 + ], + "score": 0.533 + }, + { + "category_id": 1, + "poly": [ + 300, + 394, + 1400, + 394, + 1400, + 490, + 300, + 490 + ], + "score": 0.523 + }, + { + "category_id": 1, + "poly": [ + 295, + 1024, + 1402, + 1024, + 1402, + 1120, + 295, + 1120 + ], + "score": 0.522 + }, + { + "category_id": 1, + "poly": [ + 299, + 1971, + 1395, + 1971, + 1395, + 2035, + 299, + 2035 + ], + "score": 0.519 + }, + { + "category_id": 1, + "poly": [ + 295, + 1139, + 1400, + 1139, + 1400, + 1236, + 295, + 1236 + ], + "score": 0.506 + }, + { + "category_id": 1, + "poly": [ + 296, + 1886, + 1399, + 1886, + 1399, + 1951, + 296, + 1951 + ], + "score": 0.487 + }, + { + "category_id": 1, + "poly": [ + 296, + 1771, + 1401, + 1771, + 1401, + 1864, + 296, + 1864 + ], + "score": 0.473 + }, + { + "category_id": 1, + "poly": [ + 297, + 1370, + 1404, + 1370, + 1404, + 1498, + 297, + 1498 + ], + "score": 0.46 + }, + { + "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, + 228.0, + 490.0, + 228.0, + 490.0, + 265.0, + 296.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": [ + 294.0, + 1601.0, + 1405.0, + 1601.0, + 1405.0, + 1637.0, + 294.0, + 1637.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1631.0, + 804.0, + 1631.0, + 804.0, + 1667.0, + 322.0, + 1667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 627.0, + 1401.0, + 627.0, + 1401.0, + 661.0, + 295.0, + 661.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 657.0, + 1405.0, + 657.0, + 1405.0, + 691.0, + 322.0, + 691.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 685.0, + 1049.0, + 685.0, + 1049.0, + 722.0, + 323.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 826.0, + 1405.0, + 826.0, + 1405.0, + 861.0, + 296.0, + 861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 857.0, + 1405.0, + 857.0, + 1405.0, + 889.0, + 323.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 888.0, + 1104.0, + 888.0, + 1104.0, + 922.0, + 324.0, + 922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1683.0, + 1404.0, + 1683.0, + 1404.0, + 1723.0, + 295.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1714.0, + 466.0, + 1714.0, + 466.0, + 1751.0, + 321.0, + 1751.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 739.0, + 1404.0, + 739.0, + 1404.0, + 776.0, + 296.0, + 776.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 771.0, + 1234.0, + 771.0, + 1234.0, + 807.0, + 324.0, + 807.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 940.0, + 1403.0, + 940.0, + 1403.0, + 975.0, + 294.0, + 975.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 971.0, + 1151.0, + 971.0, + 1151.0, + 1003.0, + 326.0, + 1003.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 509.0, + 1405.0, + 509.0, + 1405.0, + 547.0, + 296.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 541.0, + 1403.0, + 541.0, + 1403.0, + 577.0, + 321.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 568.0, + 1339.0, + 568.0, + 1339.0, + 610.0, + 320.0, + 610.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 280.0, + 1403.0, + 280.0, + 1403.0, + 314.0, + 295.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 310.0, + 1404.0, + 310.0, + 1404.0, + 343.0, + 323.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 340.0, + 905.0, + 340.0, + 905.0, + 378.0, + 323.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1255.0, + 1402.0, + 1255.0, + 1402.0, + 1290.0, + 297.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1287.0, + 1404.0, + 1287.0, + 1404.0, + 1320.0, + 323.0, + 1320.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1320.0, + 904.0, + 1320.0, + 904.0, + 1351.0, + 325.0, + 1351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1512.0, + 1403.0, + 1512.0, + 1403.0, + 1555.0, + 294.0, + 1555.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1549.0, + 777.0, + 1549.0, + 777.0, + 1582.0, + 323.0, + 1582.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 395.0, + 1405.0, + 395.0, + 1405.0, + 430.0, + 296.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 425.0, + 1404.0, + 425.0, + 1404.0, + 462.0, + 321.0, + 462.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 453.0, + 1339.0, + 453.0, + 1339.0, + 495.0, + 320.0, + 495.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1025.0, + 1405.0, + 1025.0, + 1405.0, + 1060.0, + 294.0, + 1060.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1057.0, + 1404.0, + 1057.0, + 1404.0, + 1092.0, + 323.0, + 1092.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1088.0, + 710.0, + 1088.0, + 710.0, + 1119.0, + 325.0, + 1119.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1967.0, + 1400.0, + 1967.0, + 1400.0, + 2009.0, + 293.0, + 2009.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 2003.0, + 985.0, + 2003.0, + 985.0, + 2036.0, + 320.0, + 2036.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1142.0, + 1404.0, + 1142.0, + 1404.0, + 1176.0, + 295.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1173.0, + 1405.0, + 1173.0, + 1405.0, + 1207.0, + 323.0, + 1207.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 1202.0, + 1210.0, + 1202.0, + 1210.0, + 1237.0, + 327.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1886.0, + 1404.0, + 1886.0, + 1404.0, + 1922.0, + 297.0, + 1922.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1919.0, + 752.0, + 1919.0, + 752.0, + 1951.0, + 322.0, + 1951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1772.0, + 1405.0, + 1772.0, + 1405.0, + 1805.0, + 295.0, + 1805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1802.0, + 1405.0, + 1802.0, + 1405.0, + 1836.0, + 324.0, + 1836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1833.0, + 478.0, + 1833.0, + 478.0, + 1865.0, + 325.0, + 1865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1370.0, + 1405.0, + 1370.0, + 1405.0, + 1409.0, + 294.0, + 1409.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1404.0, + 1404.0, + 1404.0, + 1404.0, + 1438.0, + 324.0, + 1438.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1433.0, + 1405.0, + 1433.0, + 1405.0, + 1470.0, + 322.0, + 1470.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1465.0, + 1177.0, + 1465.0, + 1177.0, + 1498.0, + 324.0, + 1498.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.854 + }, + { + "category_id": 1, + "poly": [ + 299, + 228, + 1399, + 228, + 1399, + 325, + 299, + 325 + ], + "score": 0.839 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 865, + 2088, + 865, + 2113, + 836, + 2113 + ], + "score": 0.828 + }, + { + "category_id": 1, + "poly": [ + 297, + 1400, + 1402, + 1400, + 1402, + 1465, + 297, + 1465 + ], + "score": 0.81 + }, + { + "category_id": 1, + "poly": [ + 299, + 1743, + 1402, + 1743, + 1402, + 1839, + 299, + 1839 + ], + "score": 0.801 + }, + { + "category_id": 1, + "poly": [ + 296, + 1598, + 1403, + 1598, + 1403, + 1723, + 296, + 1723 + ], + "score": 0.793 + }, + { + "category_id": 1, + "poly": [ + 296, + 632, + 1405, + 632, + 1405, + 727, + 296, + 727 + ], + "score": 0.79 + }, + { + "category_id": 1, + "poly": [ + 296, + 860, + 1405, + 860, + 1405, + 985, + 296, + 985 + ], + "score": 0.79 + }, + { + "category_id": 1, + "poly": [ + 296, + 1483, + 1405, + 1483, + 1405, + 1578, + 296, + 1578 + ], + "score": 0.786 + }, + { + "category_id": 1, + "poly": [ + 298, + 747, + 1402, + 747, + 1402, + 842, + 298, + 842 + ], + "score": 0.786 + }, + { + "category_id": 1, + "poly": [ + 298, + 1089, + 1405, + 1089, + 1405, + 1184, + 298, + 1184 + ], + "score": 0.766 + }, + { + "category_id": 1, + "poly": [ + 296, + 487, + 1406, + 487, + 1406, + 612, + 296, + 612 + ], + "score": 0.764 + }, + { + "category_id": 1, + "poly": [ + 297, + 1203, + 1405, + 1203, + 1405, + 1296, + 297, + 1296 + ], + "score": 0.761 + }, + { + "category_id": 1, + "poly": [ + 297, + 343, + 1406, + 343, + 1406, + 466, + 297, + 466 + ], + "score": 0.76 + }, + { + "category_id": 1, + "poly": [ + 296, + 1317, + 1400, + 1317, + 1400, + 1381, + 296, + 1381 + ], + "score": 0.756 + }, + { + "category_id": 1, + "poly": [ + 295, + 1972, + 1398, + 1972, + 1398, + 2035, + 295, + 2035 + ], + "score": 0.749 + }, + { + "category_id": 1, + "poly": [ + 292, + 1005, + 1400, + 1005, + 1400, + 1069, + 292, + 1069 + ], + "score": 0.74 + }, + { + "category_id": 1, + "poly": [ + 295, + 1857, + 1403, + 1857, + 1403, + 1952, + 295, + 1952 + ], + "score": 0.686 + }, + { + "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, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 1403.0, + 227.0, + 1403.0, + 265.0, + 294.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 262.0, + 1403.0, + 262.0, + 1403.0, + 296.0, + 324.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 290.0, + 1140.0, + 290.0, + 1140.0, + 327.0, + 323.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1399.0, + 1406.0, + 1399.0, + 1406.0, + 1439.0, + 295.0, + 1439.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 1432.0, + 802.0, + 1432.0, + 802.0, + 1465.0, + 326.0, + 1465.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1744.0, + 1403.0, + 1744.0, + 1403.0, + 1779.0, + 295.0, + 1779.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1771.0, + 1403.0, + 1771.0, + 1403.0, + 1811.0, + 323.0, + 1811.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1806.0, + 1354.0, + 1806.0, + 1354.0, + 1840.0, + 325.0, + 1840.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1598.0, + 1404.0, + 1598.0, + 1404.0, + 1634.0, + 295.0, + 1634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1630.0, + 1404.0, + 1630.0, + 1404.0, + 1663.0, + 321.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1659.0, + 1401.0, + 1659.0, + 1401.0, + 1693.0, + 321.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1693.0, + 539.0, + 1693.0, + 539.0, + 1723.0, + 324.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 633.0, + 1403.0, + 633.0, + 1403.0, + 667.0, + 295.0, + 667.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 661.0, + 1405.0, + 661.0, + 1405.0, + 700.0, + 320.0, + 700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 697.0, + 752.0, + 697.0, + 752.0, + 727.0, + 327.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 859.0, + 1405.0, + 859.0, + 1405.0, + 896.0, + 294.0, + 896.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 892.0, + 1405.0, + 892.0, + 1405.0, + 925.0, + 322.0, + 925.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 922.0, + 1403.0, + 922.0, + 1403.0, + 955.0, + 324.0, + 955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 955.0, + 672.0, + 955.0, + 672.0, + 985.0, + 324.0, + 985.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1483.0, + 1406.0, + 1483.0, + 1406.0, + 1521.0, + 294.0, + 1521.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1517.0, + 1405.0, + 1517.0, + 1405.0, + 1551.0, + 324.0, + 1551.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 324.0, + 1546.0, + 687.0, + 1546.0, + 687.0, + 1580.0, + 324.0, + 1580.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 748.0, + 1406.0, + 748.0, + 1406.0, + 782.0, + 297.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 779.0, + 1406.0, + 779.0, + 1406.0, + 813.0, + 323.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 326.0, + 809.0, + 1031.0, + 809.0, + 1031.0, + 843.0, + 326.0, + 843.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1087.0, + 1405.0, + 1087.0, + 1405.0, + 1127.0, + 292.0, + 1127.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1119.0, + 1403.0, + 1119.0, + 1403.0, + 1154.0, + 323.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1151.0, + 1099.0, + 1151.0, + 1099.0, + 1185.0, + 325.0, + 1185.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 490.0, + 1404.0, + 490.0, + 1404.0, + 523.0, + 296.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 520.0, + 1407.0, + 520.0, + 1407.0, + 553.0, + 320.0, + 553.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 318.0, + 548.0, + 1407.0, + 548.0, + 1407.0, + 588.0, + 318.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 580.0, + 472.0, + 580.0, + 472.0, + 614.0, + 322.0, + 614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1204.0, + 1401.0, + 1204.0, + 1401.0, + 1237.0, + 297.0, + 1237.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1234.0, + 1405.0, + 1234.0, + 1405.0, + 1268.0, + 323.0, + 1268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 1260.0, + 410.0, + 1260.0, + 410.0, + 1299.0, + 320.0, + 1299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 343.0, + 1404.0, + 343.0, + 1404.0, + 378.0, + 294.0, + 378.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 373.0, + 1404.0, + 373.0, + 1404.0, + 411.0, + 320.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 405.0, + 1404.0, + 405.0, + 1404.0, + 441.0, + 321.0, + 441.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 435.0, + 472.0, + 435.0, + 472.0, + 468.0, + 323.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1317.0, + 1404.0, + 1317.0, + 1404.0, + 1353.0, + 297.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 1348.0, + 1202.0, + 1348.0, + 1202.0, + 1382.0, + 317.0, + 1382.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1968.0, + 1403.0, + 1968.0, + 1403.0, + 2010.0, + 294.0, + 2010.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 2001.0, + 783.0, + 2001.0, + 783.0, + 2035.0, + 325.0, + 2035.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1005.0, + 1403.0, + 1005.0, + 1403.0, + 1041.0, + 295.0, + 1041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 325.0, + 1037.0, + 708.0, + 1037.0, + 708.0, + 1069.0, + 325.0, + 1069.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1856.0, + 1403.0, + 1856.0, + 1403.0, + 1892.0, + 293.0, + 1892.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1885.0, + 1404.0, + 1885.0, + 1404.0, + 1926.0, + 319.0, + 1926.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1919.0, + 675.0, + 1919.0, + 675.0, + 1953.0, + 323.0, + 1953.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 9, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1419, + 1405, + 1419, + 1405, + 1611, + 296, + 1611 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 1178, + 1405, + 1178, + 1405, + 1302, + 297, + 1302 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 298, + 1061, + 1404, + 1061, + 1404, + 1153, + 298, + 1153 + ], + "score": 0.958 + }, + { + "category_id": 8, + "poly": [ + 644, + 1946, + 998, + 1946, + 998, + 2041, + 644, + 2041 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 299, + 1624, + 1401, + 1624, + 1401, + 1690, + 299, + 1690 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 294, + 1859, + 1402, + 1859, + 1402, + 1928, + 294, + 1928 + ], + "score": 0.936 + }, + { + "category_id": 0, + "poly": [ + 299, + 1349, + 525, + 1349, + 525, + 1385, + 299, + 1385 + ], + "score": 0.907 + }, + { + "category_id": 0, + "poly": [ + 298, + 1735, + 810, + 1735, + 810, + 1771, + 298, + 1771 + ], + "score": 0.879 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.867 + }, + { + "category_id": 0, + "poly": [ + 299, + 1804, + 577, + 1804, + 577, + 1838, + 299, + 1838 + ], + "score": 0.867 + }, + { + "category_id": 1, + "poly": [ + 359, + 963, + 1334, + 963, + 1334, + 995, + 359, + 995 + ], + "score": 0.865 + }, + { + "category_id": 1, + "poly": [ + 354, + 860, + 1240, + 860, + 1240, + 930, + 354, + 930 + ], + "score": 0.864 + }, + { + "category_id": 1, + "poly": [ + 324, + 265, + 1283, + 265, + 1283, + 354, + 324, + 354 + ], + "score": 0.863 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1967, + 1401, + 1967, + 1401, + 1998, + 1351, + 1998 + ], + "score": 0.863 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 863, + 2088, + 863, + 2113, + 836, + 2113 + ], + "score": 0.858 + }, + { + "category_id": 1, + "poly": [ + 358, + 932, + 917, + 932, + 917, + 961, + 358, + 961 + ], + "score": 0.829 + }, + { + "category_id": 1, + "poly": [ + 330, + 232, + 1094, + 232, + 1094, + 262, + 330, + 262 + ], + "score": 0.698 + }, + { + "category_id": 1, + "poly": [ + 347, + 558, + 1172, + 558, + 1172, + 595, + 347, + 595 + ], + "score": 0.647 + }, + { + "category_id": 1, + "poly": [ + 351, + 357, + 815, + 357, + 815, + 394, + 351, + 394 + ], + "score": 0.643 + }, + { + "category_id": 0, + "poly": [ + 353, + 829, + 602, + 829, + 602, + 857, + 353, + 857 + ], + "score": 0.538 + }, + { + "category_id": 1, + "poly": [ + 370, + 720, + 1081, + 720, + 1081, + 751, + 370, + 751 + ], + "score": 0.366 + }, + { + "category_id": 0, + "poly": [ + 353, + 594, + 566, + 594, + 566, + 621, + 353, + 621 + ], + "score": 0.365 + }, + { + "category_id": 8, + "poly": [ + 357, + 623, + 1234, + 623, + 1234, + 717, + 357, + 717 + ], + "score": 0.338 + }, + { + "category_id": 1, + "poly": [ + 352, + 399, + 1085, + 399, + 1085, + 558, + 352, + 558 + ], + "score": 0.317 + }, + { + "category_id": 1, + "poly": [ + 353, + 829, + 602, + 829, + 602, + 857, + 353, + 857 + ], + "score": 0.238 + }, + { + "category_id": 8, + "poly": [ + 360, + 430, + 1076, + 430, + 1076, + 556, + 360, + 556 + ], + "score": 0.179 + }, + { + "category_id": 1, + "poly": [ + 351, + 623, + 1234, + 623, + 1234, + 719, + 351, + 719 + ], + "score": 0.168 + }, + { + "category_id": 8, + "poly": [ + 377, + 753, + 924, + 753, + 924, + 830, + 377, + 830 + ], + "score": 0.148 + }, + { + "category_id": 1, + "poly": [ + 377, + 753, + 924, + 753, + 924, + 830, + 377, + 830 + ], + "score": 0.104 + }, + { + "category_id": 1, + "poly": [ + 353, + 594, + 566, + 594, + 566, + 621, + 353, + 621 + ], + "score": 0.092 + }, + { + "category_id": 13, + "poly": [ + 790, + 1625, + 1006, + 1625, + 1006, + 1661, + 790, + 1661 + ], + "score": 0.94, + "latex": "( p + 1 ) \\times ( p + 1 )" + }, + { + "category_id": 13, + "poly": [ + 608, + 1481, + 698, + 1481, + 698, + 1515, + 608, + 1515 + ], + "score": 0.93, + "latex": "\\{ s _ { 1 , n } \\} _ { n }" + }, + { + "category_id": 13, + "poly": [ + 1135, + 856, + 1232, + 856, + 1232, + 896, + 1135, + 896 + ], + "score": 0.93, + "latex": "\\{ \\widehat { S } _ { b } \\} _ { b \\in \\mathbb { Z } }" + }, + { + "category_id": 14, + "poly": [ + 642, + 1944, + 1000, + 1944, + 1000, + 2043, + 642, + 2043 + ], + "score": 0.93, + "latex": "\\operatorname* { s u p } _ { x , y \\in \\mathbb { X } } \\frac { \\| \\varphi ( x ) - \\varphi ( y ) \\| _ { 2 } } { \\| x - y \\| _ { 2 } } \\preceq q ^ { 1 / 2 } ." + }, + { + "category_id": 13, + "poly": [ + 752, + 1481, + 842, + 1481, + 842, + 1515, + 752, + 1515 + ], + "score": 0.93, + "latex": "\\{ s _ { 2 , n } \\} _ { n }" + }, + { + "category_id": 13, + "poly": [ + 497, + 792, + 869, + 792, + 869, + 831, + 497, + 831 + ], + "score": 0.92, + "latex": "\\widehat { S } _ { b } = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 , b } - \\widehat { \\beta } _ { 0 , b } )" + }, + { + "category_id": 13, + "poly": [ + 347, + 1514, + 489, + 1514, + 489, + 1546, + 347, + 1546 + ], + "score": 0.92, + "latex": "s _ { 1 , n } \\leq \\bar { c } s _ { 2 , n }" + }, + { + "category_id": 13, + "poly": [ + 1129, + 1485, + 1262, + 1485, + 1262, + 1515, + 1129, + 1515 + ], + "score": 0.92, + "latex": "s _ { 1 , n } \\preceq s _ { 2 , n }" + }, + { + "category_id": 13, + "poly": [ + 470, + 556, + 615, + 556, + 615, + 594, + 470, + 594 + ], + "score": 0.92, + "latex": "\\widehat { \\beta } _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\widehat { \\gamma } _ { a }" + }, + { + "category_id": 13, + "poly": [ + 1285, + 1420, + 1371, + 1420, + 1371, + 1454, + 1285, + 1454 + ], + "score": 0.92, + "latex": "\\left\\| \\mathbf { M a t } \\right\\| _ { p }" + }, + { + "category_id": 13, + "poly": [ + 489, + 1576, + 537, + 1576, + 537, + 1612, + 489, + 1612 + ], + "score": 0.92, + "latex": "\\psi ^ { ( i ) }" + }, + { + "category_id": 13, + "poly": [ + 577, + 1627, + 643, + 1627, + 643, + 1662, + 577, + 1662 + ], + "score": 0.92, + "latex": "O _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1177, + 1452, + 1342, + 1452, + 1342, + 1482, + 1177, + 1482 + ], + "score": 0.92, + "latex": "1 \\leq p \\leq + \\infty" + }, + { + "category_id": 13, + "poly": [ + 605, + 353, + 807, + 353, + 807, + 394, + 605, + 394 + ], + "score": 0.92, + "latex": "\\widehat { \\Phi } _ { 0 } = \\widehat { \\Phi } _ { 1 } = O _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1204, + 1628, + 1262, + 1628, + 1262, + 1662, + 1204, + 1662 + ], + "score": 0.91, + "latex": "0 _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 403, + 428, + 598, + 428, + 598, + 462, + 403, + 462 + ], + "score": 0.91, + "latex": "i = N ( t _ { k - 1 } ) \\bar { { + } 1 }" + }, + { + "category_id": 13, + "poly": [ + 403, + 621, + 598, + 621, + 598, + 653, + 403, + 653 + ], + "score": 0.91, + "latex": "i = N ( t _ { k - 1 } ) + 1" + }, + { + "category_id": 13, + "poly": [ + 494, + 895, + 749, + 895, + 749, + 931, + 494, + 931 + ], + "score": 0.91, + "latex": "{ \\mathcal { T } } \\{ b \\in { \\mathcal { T } } : { \\widehat { S } } _ { b } \\leq z \\}" + }, + { + "category_id": 13, + "poly": [ + 299, + 1657, + 383, + 1657, + 383, + 1691, + 299, + 1691 + ], + "score": 0.91, + "latex": "( p + 1 )" + }, + { + "category_id": 13, + "poly": [ + 589, + 861, + 953, + 861, + 953, + 896, + 589, + 896 + ], + "score": 0.91, + "latex": "\\{ \\alpha ( t ) - | \\mathcal { T } | ^ { c } / B | \\} / ( 1 - | \\mathcal { T } ^ { c } | / B )" + }, + { + "category_id": 13, + "poly": [ + 297, + 1897, + 621, + 1897, + 621, + 1930, + 297, + 1930 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\operatorname* { l i m } \\operatorname* { i n f } _ { q } \\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } > 0 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 324, + 299, + 507, + 299, + 507, + 332, + 324, + 332 + ], + "score": 0.9, + "latex": "\\mathcal { T } = \\{ 1 , \\ldots , B \\}" + }, + { + "category_id": 13, + "poly": [ + 678, + 718, + 805, + 718, + 805, + 752, + 678, + 752 + ], + "score": 0.9, + "latex": "{ \\cal N } ( 0 , I _ { p + 1 } )" + }, + { + "category_id": 13, + "poly": [ + 659, + 560, + 777, + 560, + 777, + 594, + 659, + 594 + ], + "score": 0.9, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 1043, + 231, + 1092, + 231, + 1092, + 264, + 1043, + 264 + ], + "score": 0.9, + "latex": "\\alpha ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 630, + 430, + 703, + 430, + 703, + 462, + 630, + 462 + ], + "score": 0.89, + "latex": "N ( t _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 380, + 930, + 452, + 930, + 452, + 959, + 380, + 959 + ], + "score": 0.89, + "latex": "S > z" + }, + { + "category_id": 13, + "poly": [ + 552, + 463, + 688, + 463, + 688, + 488, + 552, + 488 + ], + "score": 0.89, + "latex": "m = m + 1" + }, + { + "category_id": 13, + "poly": [ + 804, + 1514, + 870, + 1514, + 870, + 1540, + 804, + 1540 + ], + "score": 0.89, + "latex": "\\bar { c } > 0" + }, + { + "category_id": 13, + "poly": [ + 909, + 1452, + 938, + 1452, + 938, + 1485, + 909, + 1485 + ], + "score": 0.89, + "latex": "\\ell _ { p }" + }, + { + "category_id": 13, + "poly": [ + 543, + 931, + 582, + 931, + 582, + 961, + 543, + 961 + ], + "score": 0.89, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 475, + 361, + 554, + 361, + 554, + 390, + 475, + 390 + ], + "score": 0.88, + "latex": "m = 0" + }, + { + "category_id": 13, + "poly": [ + 380, + 753, + 916, + 753, + 916, + 791, + 380, + 791 + ], + "score": 0.88, + "latex": "\\widehat { \\beta } _ { a , b } = ( 1 - m n ^ { - 1 } ) \\widehat { \\beta } _ { a , b } + n ^ { - 1 } \\widehat { \\Phi } _ { a } ^ { 1 / 2 } e _ { a } , a = 0 , 1" + }, + { + "category_id": 13, + "poly": [ + 373, + 332, + 444, + 332, + 444, + 358, + 373, + 358 + ], + "score": 0.88, + "latex": "k = 1" + }, + { + "category_id": 13, + "poly": [ + 381, + 463, + 501, + 463, + 501, + 488, + 381, + 488 + ], + "score": 0.87, + "latex": "n = n + 1" + }, + { + "category_id": 13, + "poly": [ + 471, + 1861, + 768, + 1861, + 768, + 1897, + 471, + 1897 + ], + "score": 0.87, + "latex": "\\lambda _ { \\operatorname* { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1" + }, + { + "category_id": 13, + "poly": [ + 630, + 621, + 703, + 621, + 703, + 654, + 630, + 654 + ], + "score": 0.87, + "latex": "N ( t _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 538, + 262, + 740, + 262, + 740, + 303, + 538, + 303 + ], + "score": 0.86, + "latex": "\\widehat { \\Sigma } _ { 0 } = \\widehat { \\Sigma } _ { 1 } = { \\cal O } _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 373, + 1581, + 395, + 1581, + 395, + 1612, + 373, + 1612 + ], + "score": 0.85, + "latex": "\\psi" + }, + { + "category_id": 13, + "poly": [ + 378, + 490, + 1066, + 490, + 1066, + 524, + 378, + 524 + ], + "score": 0.84, + "latex": "\\widehat { \\Sigma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\Sigma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;" + }, + { + "category_id": 13, + "poly": [ + 947, + 263, + 1168, + 263, + 1168, + 304, + 947, + 304 + ], + "score": 0.84, + "latex": "\\widehat { \\beta } _ { 0 , b } = \\widehat { \\beta } _ { 1 , b } = 0 _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 403, + 691, + 551, + 691, + 551, + 720, + 403, + 720 + ], + "score": 0.84, + "latex": "b = 1 , \\dots , B" + }, + { + "category_id": 13, + "poly": [ + 749, + 1543, + 827, + 1543, + 827, + 1576, + 749, + 1576 + ], + "score": 0.83, + "latex": "\\mathrm { { M a t } ^ { - 1 } }" + }, + { + "category_id": 13, + "poly": [ + 781, + 1861, + 1083, + 1861, + 1083, + 1899, + 781, + 1899 + ], + "score": 0.83, + "latex": "\\lambda _ { \\operatorname* { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1" + }, + { + "category_id": 13, + "poly": [ + 455, + 264, + 527, + 264, + 527, + 297, + 455, + 297 + ], + "score": 0.83, + "latex": "n = 0" + }, + { + "category_id": 13, + "poly": [ + 1006, + 725, + 1072, + 725, + 1072, + 751, + 1006, + 751 + ], + "score": 0.83, + "latex": "e _ { 0 } , e _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 649, + 392, + 680, + 392, + 680, + 429, + 649, + 429 + ], + "score": 0.82, + "latex": "{ \\widehat { \\beta } } _ { a }" + }, + { + "category_id": 13, + "poly": [ + 743, + 233, + 768, + 233, + 768, + 259, + 743, + 259 + ], + "score": 0.82, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 438, + 899, + 461, + 899, + 461, + 926, + 438, + 926 + ], + "score": 0.81, + "latex": "\\mathcal { T }" + }, + { + "category_id": 13, + "poly": [ + 829, + 555, + 1165, + 555, + 1165, + 595, + 829, + 595 + ], + "score": 0.81, + "latex": "S = \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 } - \\widehat { \\beta } _ { 0 } ) ;" + }, + { + "category_id": 13, + "poly": [ + 378, + 651, + 1228, + 651, + 1228, + 693, + 378, + 693 + ], + "score": 0.81, + "latex": "\\widehat { \\Phi } _ { a } = \\widehat { \\Phi } _ { a } + \\widehat { \\Sigma } _ { a } ^ { - 1 } \\varphi ( X _ { i } ) \\varphi ^ { \\dagger } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;" + }, + { + "category_id": 13, + "poly": [ + 1097, + 1860, + 1395, + 1860, + 1395, + 1899, + 1097, + 1899 + ], + "score": 0.8, + "latex": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } = O ( q ^ { 1 / 2 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 394, + 867, + 413, + 867, + 413, + 890, + 394, + 890 + ], + "score": 0.79, + "latex": "z" + }, + { + "category_id": 13, + "poly": [ + 476, + 332, + 504, + 332, + 504, + 357, + 476, + 357 + ], + "score": 0.79, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 684, + 1582, + 696, + 1582, + 696, + 1607, + 684, + 1607 + ], + "score": 0.78, + "latex": "i" + }, + { + "category_id": 13, + "poly": [ + 751, + 264, + 936, + 264, + 936, + 304, + 751, + 304 + ], + "score": 0.77, + "latex": "\\widehat { \\gamma } _ { 0 } = \\widehat { \\gamma } _ { 1 } = 0 _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 812, + 238, + 833, + 238, + 833, + 259, + 812, + 259 + ], + "score": 0.77, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 380, + 524, + 1010, + 524, + 1010, + 557, + 380, + 557 + ], + "score": 0.66, + "latex": "\\widehat { \\gamma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\gamma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) Y _ { i } \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;" + }, + { + "category_id": 13, + "poly": [ + 327, + 1272, + 614, + 1272, + 614, + 1300, + 327, + 1300 + ], + "score": 0.47, + "latex": "\\mathtt { s 1 0 2 5 5 - 0 0 4 - 0 1 7 3 - z }" + }, + { + "category_id": 13, + "poly": [ + 475, + 1860, + 1349, + 1860, + 1349, + 1899, + 475, + 1899 + ], + "score": 0.46, + "latex": "\\lambda _ { \\operatorname* { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1 , \\lambda _ { \\operatorname* { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1 , \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } = O ( q ^ { \\top } ) ," + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1347.0, + 529.0, + 1347.0, + 529.0, + 1391.0, + 294.0, + 1391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1732.0, + 813.0, + 1732.0, + 813.0, + 1775.0, + 292.0, + 1775.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, + 1799.0, + 580.0, + 1799.0, + 580.0, + 1845.0, + 292.0, + 1845.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": [ + 350.0, + 824.0, + 605.0, + 824.0, + 605.0, + 865.0, + 350.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 584.0, + 568.0, + 584.0, + 568.0, + 631.0, + 350.0, + 631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1417.0, + 1284.0, + 1417.0, + 1284.0, + 1456.0, + 295.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1372.0, + 1417.0, + 1405.0, + 1417.0, + 1405.0, + 1456.0, + 1372.0, + 1456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1447.0, + 908.0, + 1447.0, + 908.0, + 1486.0, + 294.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 939.0, + 1447.0, + 1176.0, + 1447.0, + 1176.0, + 1486.0, + 939.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1447.0, + 1406.0, + 1447.0, + 1406.0, + 1486.0, + 1343.0, + 1486.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1480.0, + 607.0, + 1480.0, + 607.0, + 1520.0, + 293.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 1480.0, + 751.0, + 1480.0, + 751.0, + 1520.0, + 699.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 843.0, + 1480.0, + 1128.0, + 1480.0, + 1128.0, + 1520.0, + 843.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 1480.0, + 1407.0, + 1480.0, + 1407.0, + 1520.0, + 1263.0, + 1520.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1510.0, + 346.0, + 1510.0, + 346.0, + 1546.0, + 293.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 490.0, + 1510.0, + 803.0, + 1510.0, + 803.0, + 1546.0, + 490.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 871.0, + 1510.0, + 1405.0, + 1510.0, + 1405.0, + 1546.0, + 871.0, + 1546.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1541.0, + 748.0, + 1541.0, + 748.0, + 1584.0, + 293.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 828.0, + 1541.0, + 1406.0, + 1541.0, + 1406.0, + 1584.0, + 828.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1575.0, + 372.0, + 1575.0, + 372.0, + 1614.0, + 293.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1575.0, + 488.0, + 1575.0, + 488.0, + 1614.0, + 396.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 538.0, + 1575.0, + 683.0, + 1575.0, + 683.0, + 1614.0, + 538.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 697.0, + 1575.0, + 834.0, + 1575.0, + 834.0, + 1614.0, + 697.0, + 1614.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1178.0, + 1403.0, + 1178.0, + 1403.0, + 1214.0, + 294.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1207.0, + 1406.0, + 1207.0, + 1406.0, + 1242.0, + 321.0, + 1242.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1239.0, + 1403.0, + 1239.0, + 1403.0, + 1274.0, + 321.0, + 1274.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 1269.0, + 326.0, + 1269.0, + 326.0, + 1304.0, + 323.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 615.0, + 1269.0, + 627.0, + 1269.0, + 627.0, + 1304.0, + 615.0, + 1304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1060.0, + 1402.0, + 1060.0, + 1402.0, + 1096.0, + 293.0, + 1096.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 322.0, + 1093.0, + 1405.0, + 1093.0, + 1405.0, + 1126.0, + 322.0, + 1126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 319.0, + 1117.0, + 402.0, + 1117.0, + 402.0, + 1158.0, + 319.0, + 1158.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1621.0, + 576.0, + 1621.0, + 576.0, + 1665.0, + 292.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 644.0, + 1621.0, + 789.0, + 1621.0, + 789.0, + 1665.0, + 644.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1007.0, + 1621.0, + 1203.0, + 1621.0, + 1203.0, + 1665.0, + 1007.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 1621.0, + 1406.0, + 1621.0, + 1406.0, + 1665.0, + 1263.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1657.0, + 298.0, + 1657.0, + 298.0, + 1693.0, + 295.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 384.0, + 1657.0, + 667.0, + 1657.0, + 667.0, + 1693.0, + 384.0, + 1693.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1858.0, + 470.0, + 1858.0, + 470.0, + 1903.0, + 293.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1396.0, + 1858.0, + 1404.0, + 1858.0, + 1404.0, + 1903.0, + 1396.0, + 1903.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 622.0, + 1893.0, + 858.0, + 1893.0, + 858.0, + 1930.0, + 622.0, + 1930.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 362.0, + 957.0, + 1339.0, + 957.0, + 1339.0, + 1002.0, + 362.0, + 1002.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 346.0, + 850.0, + 393.0, + 850.0, + 393.0, + 902.0, + 346.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 850.0, + 588.0, + 850.0, + 588.0, + 902.0, + 414.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 850.0, + 1134.0, + 850.0, + 1134.0, + 902.0, + 954.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 850.0, + 1246.0, + 850.0, + 1246.0, + 902.0, + 1233.0, + 902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 890.0, + 437.0, + 890.0, + 437.0, + 938.0, + 348.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 890.0, + 493.0, + 890.0, + 493.0, + 938.0, + 462.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 890.0, + 762.0, + 890.0, + 762.0, + 938.0, + 750.0, + 938.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 317.0, + 255.0, + 454.0, + 255.0, + 454.0, + 310.0, + 317.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 528.0, + 255.0, + 537.0, + 255.0, + 537.0, + 310.0, + 528.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 255.0, + 750.0, + 255.0, + 750.0, + 310.0, + 741.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 255.0, + 946.0, + 255.0, + 946.0, + 310.0, + 937.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1169.0, + 255.0, + 1286.0, + 255.0, + 1286.0, + 310.0, + 1169.0, + 310.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 508.0, + 298.0, + 520.0, + 298.0, + 520.0, + 332.0, + 508.0, + 332.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 327.0, + 372.0, + 327.0, + 372.0, + 360.0, + 321.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 327.0, + 475.0, + 327.0, + 475.0, + 360.0, + 445.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 327.0, + 544.0, + 327.0, + 544.0, + 360.0, + 505.0, + 360.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 927.0, + 379.0, + 927.0, + 379.0, + 966.0, + 351.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 927.0, + 542.0, + 927.0, + 542.0, + 966.0, + 453.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 927.0, + 921.0, + 927.0, + 921.0, + 966.0, + 583.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 227.0, + 742.0, + 227.0, + 742.0, + 272.0, + 323.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 227.0, + 811.0, + 227.0, + 811.0, + 272.0, + 769.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 227.0, + 1042.0, + 227.0, + 1042.0, + 272.0, + 834.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 227.0, + 1096.0, + 227.0, + 1096.0, + 272.0, + 1093.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 548.0, + 469.0, + 548.0, + 469.0, + 603.0, + 349.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 548.0, + 658.0, + 548.0, + 658.0, + 603.0, + 616.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 548.0, + 828.0, + 548.0, + 828.0, + 603.0, + 778.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1166.0, + 548.0, + 1177.0, + 548.0, + 1177.0, + 603.0, + 1166.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 347.0, + 344.0, + 474.0, + 344.0, + 474.0, + 405.0, + 347.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 555.0, + 344.0, + 604.0, + 344.0, + 604.0, + 405.0, + 555.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 808.0, + 344.0, + 822.0, + 344.0, + 822.0, + 405.0, + 808.0, + 405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 711.0, + 677.0, + 711.0, + 677.0, + 760.0, + 378.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 711.0, + 1005.0, + 711.0, + 1005.0, + 760.0, + 806.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1073.0, + 711.0, + 1087.0, + 711.0, + 1087.0, + 760.0, + 1073.0, + 760.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 398.0, + 648.0, + 398.0, + 648.0, + 430.0, + 352.0, + 430.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 351.0, + 428.0, + 402.0, + 428.0, + 402.0, + 460.0, + 351.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 428.0, + 629.0, + 428.0, + 629.0, + 460.0, + 599.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 428.0, + 743.0, + 428.0, + 743.0, + 460.0, + 704.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 375.0, + 459.0, + 380.0, + 459.0, + 380.0, + 490.0, + 375.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 502.0, + 459.0, + 551.0, + 459.0, + 551.0, + 490.0, + 502.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 459.0, + 700.0, + 459.0, + 700.0, + 490.0, + 689.0, + 490.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 478.0, + 377.0, + 478.0, + 377.0, + 536.0, + 372.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1067.0, + 478.0, + 1079.0, + 478.0, + 1079.0, + 536.0, + 1067.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 375.0, + 520.0, + 379.0, + 520.0, + 379.0, + 558.0, + 375.0, + 558.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 824.0, + 605.0, + 824.0, + 605.0, + 865.0, + 350.0, + 865.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 617.0, + 402.0, + 617.0, + 402.0, + 656.0, + 349.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 617.0, + 629.0, + 617.0, + 629.0, + 656.0, + 599.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 617.0, + 744.0, + 617.0, + 744.0, + 656.0, + 704.0, + 656.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 371.0, + 642.0, + 377.0, + 642.0, + 377.0, + 703.0, + 371.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1229.0, + 642.0, + 1236.0, + 642.0, + 1236.0, + 703.0, + 1229.0, + 703.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 686.0, + 402.0, + 686.0, + 402.0, + 722.0, + 350.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 552.0, + 686.0, + 594.0, + 686.0, + 594.0, + 722.0, + 552.0, + 722.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 370.0, + 735.0, + 379.0, + 735.0, + 379.0, + 805.0, + 370.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 735.0, + 942.0, + 735.0, + 942.0, + 805.0, + 917.0, + 805.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 789.0, + 496.0, + 789.0, + 496.0, + 836.0, + 378.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 789.0, + 887.0, + 789.0, + 887.0, + 836.0, + 870.0, + 836.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 584.0, + 568.0, + 584.0, + 568.0, + 631.0, + 350.0, + 631.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 10, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 227, + 1406, + 227, + 1406, + 480, + 296, + 480 + ], + "score": 0.983 + }, + { + "category_id": 1, + "poly": [ + 297, + 1176, + 1406, + 1176, + 1406, + 1301, + 297, + 1301 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 297, + 1879, + 1404, + 1879, + 1404, + 2038, + 297, + 2038 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 295, + 1627, + 1407, + 1627, + 1407, + 1756, + 295, + 1756 + ], + "score": 0.974 + }, + { + "category_id": 1, + "poly": [ + 298, + 754, + 1402, + 754, + 1402, + 849, + 298, + 849 + ], + "score": 0.964 + }, + { + "category_id": 1, + "poly": [ + 300, + 922, + 1399, + 922, + 1399, + 985, + 300, + 985 + ], + "score": 0.958 + }, + { + "category_id": 8, + "poly": [ + 469, + 856, + 1175, + 856, + 1175, + 916, + 469, + 916 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 421, + 1762, + 1222, + 1762, + 1222, + 1856, + 421, + 1856 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 297, + 677, + 1397, + 677, + 1397, + 740, + 297, + 740 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 706, + 991, + 936, + 991, + 936, + 1032, + 706, + 1032 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 302, + 571, + 1137, + 571, + 1137, + 605, + 302, + 605 + ], + "score": 0.922 + }, + { + "category_id": 8, + "poly": [ + 337, + 1389, + 1298, + 1389, + 1298, + 1477, + 337, + 1477 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 298, + 1035, + 624, + 1035, + 624, + 1067, + 298, + 1067 + ], + "score": 0.919 + }, + { + "category_id": 8, + "poly": [ + 433, + 610, + 1211, + 610, + 1211, + 671, + 433, + 671 + ], + "score": 0.915 + }, + { + "category_id": 0, + "poly": [ + 302, + 514, + 755, + 514, + 755, + 546, + 302, + 546 + ], + "score": 0.911 + }, + { + "category_id": 0, + "poly": [ + 301, + 1110, + 758, + 1110, + 758, + 1145, + 301, + 1145 + ], + "score": 0.91 + }, + { + "category_id": 9, + "poly": [ + 1352, + 615, + 1400, + 615, + 1400, + 647, + 1352, + 647 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 298, + 75, + 854, + 75, + 854, + 105, + 298, + 105 + ], + "score": 0.906 + }, + { + "category_id": 1, + "poly": [ + 296, + 1483, + 1094, + 1483, + 1094, + 1525, + 296, + 1525 + ], + "score": 0.902 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.867 + }, + { + "category_id": 1, + "poly": [ + 293, + 1307, + 1445, + 1307, + 1445, + 1385, + 293, + 1385 + ], + "score": 0.757 + }, + { + "category_id": 1, + "poly": [ + 297, + 1576, + 632, + 1576, + 632, + 1610, + 297, + 1610 + ], + "score": 0.453 + }, + { + "category_id": 8, + "poly": [ + 335, + 1531, + 1286, + 1531, + 1286, + 1572, + 335, + 1572 + ], + "score": 0.437 + }, + { + "category_id": 8, + "poly": [ + 293, + 1307, + 1445, + 1307, + 1445, + 1385, + 293, + 1385 + ], + "score": 0.146 + }, + { + "category_id": 8, + "poly": [ + 326, + 1531, + 1291, + 1531, + 1291, + 1608, + 326, + 1608 + ], + "score": 0.122 + }, + { + "category_id": 13, + "poly": [ + 573, + 755, + 666, + 755, + 666, + 789, + 573, + 789 + ], + "score": 0.93, + "latex": "Q _ { 0 } ( \\cdot , a )" + }, + { + "category_id": 13, + "poly": [ + 590, + 1484, + 773, + 1484, + 773, + 1527, + 590, + 1527 + ], + "score": 0.93, + "latex": "\\widehat { \\Sigma } _ { a } ( t ) = \\widehat { \\Sigma } _ { a , n ( t ) }" + }, + { + "category_id": 13, + "poly": [ + 824, + 1484, + 999, + 1484, + 999, + 1527, + 824, + 1527 + ], + "score": 0.93, + "latex": "\\widehat { \\beta } _ { a } ( t ) = \\widehat { \\beta } _ { a , n ( t ) }" + }, + { + "category_id": 13, + "poly": [ + 1096, + 1630, + 1185, + 1630, + 1185, + 1663, + 1096, + 1663 + ], + "score": 0.92, + "latex": "\\left| Y ^ { * } ( a ) \\right|" + }, + { + "category_id": 13, + "poly": [ + 1216, + 1882, + 1326, + 1882, + 1326, + 1915, + 1216, + 1915 + ], + "score": 0.92, + "latex": "\\alpha _ { 0 } = 1 / 2" + }, + { + "category_id": 13, + "poly": [ + 418, + 1661, + 539, + 1661, + 539, + 1693, + 418, + 1693 + ], + "score": 0.92, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 383, + 1576, + 502, + 1576, + 502, + 1610, + 383, + 1610 + ], + "score": 0.92, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 485, + 1269, + 574, + 1269, + 574, + 1301, + 485, + 1301 + ], + "score": 0.92, + "latex": "N _ { 0 } > 0" + }, + { + "category_id": 13, + "poly": [ + 327, + 357, + 385, + 357, + 385, + 390, + 327, + 390 + ], + "score": 0.91, + "latex": "\\varphi ( x )" + }, + { + "category_id": 13, + "poly": [ + 903, + 1972, + 1096, + 1972, + 1096, + 2006, + 903, + 2006 + ], + "score": 0.91, + "latex": "\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } )" + }, + { + "category_id": 13, + "poly": [ + 1263, + 1661, + 1351, + 1661, + 1351, + 1691, + 1263, + 1691 + ], + "score": 0.91, + "latex": "L _ { 0 } > 0" + }, + { + "category_id": 13, + "poly": [ + 723, + 1240, + 853, + 1240, + 853, + 1269, + 723, + 1269 + ], + "score": 0.91, + "latex": "0 < \\varepsilon _ { 0 } < 1" + }, + { + "category_id": 14, + "poly": [ + 421, + 1758, + 1221, + 1758, + 1221, + 1858, + 421, + 1858 + ], + "score": 0.91, + "latex": " \\sum _ { a \\in \\{ 0 , 1 \\} } E ^ { \\mathcal { F } _ { i - 1 } } | \\sum _ { i = 1 } ^ { k } \\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\} | \\preceq q \\sqrt { k \\log k } , \\forall k \\geq j _ { n } ." + }, + { + "category_id": 13, + "poly": [ + 339, + 786, + 451, + 786, + 451, + 818, + 339, + 818 + ], + "score": 0.91, + "latex": "a \\in [ 0 , 1 ]" + }, + { + "category_id": 13, + "poly": [ + 445, + 2001, + 781, + 2001, + 781, + 2037, + 445, + 2037 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\operatorname* { i n f } _ { x \\in \\bar { \\mathbb { X } } } | \\varphi ^ { \\top } ( x ) \\dot { ( \\beta _ { 1 } - \\beta _ { 0 } ) } | > 0 } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 707, + 988, + 934, + 988, + 934, + 1031, + 707, + 1031 + ], + "score": 0.91, + "latex": "q \\gg \\{ N ( T ) \\} ^ { d / ( 2 p ) } ," + }, + { + "category_id": 13, + "poly": [ + 830, + 417, + 880, + 417, + 880, + 451, + 830, + 451 + ], + "score": 0.91, + "latex": "\\varphi ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 1161, + 785, + 1211, + 785, + 1211, + 819, + 1161, + 819 + ], + "score": 0.91, + "latex": "\\varphi ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 1251, + 1940, + 1404, + 1940, + 1404, + 1976, + 1251, + 1976 + ], + "score": 0.91, + "latex": "\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } -" + }, + { + "category_id": 13, + "poly": [ + 783, + 1910, + 982, + 1910, + 982, + 1945, + 783, + 1945 + ], + "score": 0.91, + "latex": "\\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } )" + }, + { + "category_id": 13, + "poly": [ + 800, + 1630, + 1038, + 1630, + 1038, + 1662, + 800, + 1662 + ], + "score": 0.91, + "latex": "\\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\pi ^ { * } ( a , x ) > 0" + }, + { + "category_id": 14, + "poly": [ + 469, + 852, + 1174, + 852, + 1174, + 918, + 469, + 918 + ], + "score": 0.91, + "latex": "\\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | = O ( q ^ { - p / d } ) ." + }, + { + "category_id": 13, + "poly": [ + 616, + 290, + 923, + 290, + 923, + 325, + 616, + 325 + ], + "score": 0.9, + "latex": "\\dot { \\lambda } _ { \\mathrm { m a x } } [ \\mathrm { E } \\varphi ( X ) \\dot { \\varphi } ^ { \\top } ( X ) ] \\asymp 1" + }, + { + "category_id": 13, + "poly": [ + 446, + 818, + 479, + 818, + 479, + 849, + 446, + 849 + ], + "score": 0.89, + "latex": "\\beta _ { 1 } ^ { * }" + }, + { + "category_id": 13, + "poly": [ + 514, + 1722, + 649, + 1722, + 649, + 1755, + 514, + 1755 + ], + "score": 0.89, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 455, + 325, + 748, + 325, + 748, + 359, + 455, + 359 + ], + "score": 0.89, + "latex": "\\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } = O ( q ^ { 1 / 2 } )" + }, + { + "category_id": 13, + "poly": [ + 583, + 1691, + 653, + 1691, + 653, + 1723, + 583, + 1723 + ], + "score": 0.89, + "latex": "\\{ j _ { n } \\} _ { n }" + }, + { + "category_id": 13, + "poly": [ + 363, + 819, + 395, + 819, + 395, + 849, + 363, + 849 + ], + "score": 0.89, + "latex": "\\beta _ { 0 } ^ { \\ast }" + }, + { + "category_id": 14, + "poly": [ + 433, + 607, + 1209, + 607, + 1209, + 673, + 433, + 673 + ], + "score": 0.89, + "latex": "\\operatorname* { i n f } _ { \\beta _ { 0 } , \\beta _ { 1 } \\in \\mathbb { R } ^ { p } } \\operatorname* { s u p } _ { x \\in \\mathbb { X } , a \\in \\{ 0 , 1 \\} } | Q _ { 0 } ( x , a ) - Q ( x , a ; \\beta _ { 0 } , \\beta _ { 1 } ) | = o ( \\{ N ( T ) \\} ^ { - 1 / 2 } ) ," + }, + { + "category_id": 14, + "poly": [ + 337, + 1382, + 1303, + 1382, + 1303, + 1480, + 337, + 1480 + ], + "score": 0.89, + "latex": "\\widehat { \\beta } _ { a , j } = \\widehat { \\Sigma } _ { a , j } ^ { - 1 } \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\} \\mathrm { a n d } \\widehat { \\Sigma } _ { a , j } = \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ." + }, + { + "category_id": 13, + "poly": [ + 671, + 1270, + 757, + 1270, + 757, + 1301, + 671, + 1301 + ], + "score": 0.88, + "latex": "j \\geq N _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 430, + 1941, + 812, + 1941, + 812, + 1976, + 430, + 1976 + ], + "score": 0.88, + "latex": "\\bar { \\operatorname* { P r } } ( | \\varphi ^ { \\top } ( X ) ( \\bar { \\beta _ { 1 } } - \\beta _ { 0 } ) | \\leq \\epsilon ) \\leq { \\dot { L _ { 0 } } } \\epsilon" + }, + { + "category_id": 13, + "poly": [ + 297, + 289, + 600, + 289, + 600, + 325, + 297, + 325 + ], + "score": 0.88, + "latex": "\\lambda _ { \\operatorname* { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\asymp 1" + }, + { + "category_id": 13, + "poly": [ + 345, + 1693, + 414, + 1693, + 414, + 1720, + 345, + 1720 + ], + "score": 0.88, + "latex": "\\epsilon > 0" + }, + { + "category_id": 13, + "poly": [ + 840, + 356, + 1170, + 356, + 1170, + 389, + 840, + 389 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\operatorname* { l i m } \\operatorname* { i n f } _ { q } \\operatorname* { i n f } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } > 0 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 647, + 1659, + 1036, + 1659, + 1036, + 1693, + 647, + 1693 + ], + "score": 0.85, + "latex": "P r ( | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\bar { \\beta } _ { 0 } ) | \\le \\epsilon ) \\ \\le L _ { 0 } \\mathfrak { e }" + }, + { + "category_id": 13, + "poly": [ + 900, + 1946, + 964, + 1946, + 964, + 1972, + 900, + 1972 + ], + "score": 0.85, + "latex": "\\epsilon > 0" + }, + { + "category_id": 13, + "poly": [ + 769, + 1269, + 887, + 1269, + 887, + 1302, + 769, + 1302 + ], + "score": 0.85, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 807, + 1692, + 1034, + 1692, + 1034, + 1724, + 807, + 1724 + ], + "score": 0.85, + "latex": "\\sqrt { j _ { n } } / \\sqrt { \\log j _ { n } } \\gg q ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 553, + 1577, + 626, + 1577, + 626, + 1606, + 553, + 1606 + ], + "score": 0.85, + "latex": "x \\in \\mathbb { X }" + }, + { + "category_id": 13, + "poly": [ + 699, + 762, + 717, + 762, + 717, + 788, + 699, + 788 + ], + "score": 0.82, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 1055, + 762, + 1073, + 762, + 1073, + 788, + 1055, + 788 + ], + "score": 0.82, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 899, + 1269, + 972, + 1269, + 972, + 1298, + 899, + 1298 + ], + "score": 0.8, + "latex": "x \\in \\mathbb { X }" + }, + { + "category_id": 14, + "poly": [ + 351, + 1530, + 1292, + 1530, + 1292, + 1572, + 351, + 1572 + ], + "score": 0.78, + "latex": "\\pi ^ { * } ( a , x ) = ( 1 - \\varepsilon _ { 0 } ) a \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } - \\beta _ { 0 } ) > 0 \\} + \\varepsilon _ { 0 } ( 1 - a ) \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\leq 0 \\}" + }, + { + "category_id": 14, + "poly": [ + 310, + 1305, + 1428, + 1305, + 1428, + 1351, + 310, + 1351 + ], + "score": 0.73, + "latex": "\\begin{array} { r } { \\tau _ { j - 1 } ( a , x ) = ( 1 - \\varepsilon _ { 0 } ) a \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 , j - 1 } - \\widehat { \\beta } _ { 0 , j - 1 } ) > 0 \\} + \\varepsilon _ { 0 } ( 1 - a ) \\mathbb { I } \\{ \\varphi ^ { \\top } ( x ) ( \\widehat { \\beta } _ { 1 , j - 1 } - \\widehat { \\beta } _ { 0 , j - 1 } ) \\leq 0 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 596, + 1214, + 610, + 1214, + 610, + 1236, + 596, + 1236 + ], + "score": 0.71, + "latex": "\\epsilon" + }, + { + "category_id": 13, + "poly": [ + 297, + 1973, + 332, + 1973, + 332, + 2005, + 297, + 2005 + ], + "score": 0.71, + "latex": "\\beta _ { 0 , }" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 512.0, + 759.0, + 512.0, + 759.0, + 550.0, + 294.0, + 550.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1106.0, + 765.0, + 1106.0, + 765.0, + 1152.0, + 293.0, + 1152.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, + 2125.0, + 832.0, + 2125.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": [ + 291.0, + 259.0, + 1404.0, + 259.0, + 1404.0, + 296.0, + 291.0, + 296.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 601.0, + 290.0, + 615.0, + 290.0, + 615.0, + 328.0, + 601.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 924.0, + 290.0, + 1406.0, + 290.0, + 1406.0, + 328.0, + 924.0, + 328.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 320.0, + 454.0, + 320.0, + 454.0, + 362.0, + 293.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 320.0, + 1407.0, + 320.0, + 1407.0, + 362.0, + 749.0, + 362.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 355.0, + 326.0, + 355.0, + 326.0, + 393.0, + 293.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 386.0, + 355.0, + 839.0, + 355.0, + 839.0, + 393.0, + 386.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 355.0, + 1406.0, + 355.0, + 1406.0, + 393.0, + 1171.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 385.0, + 1405.0, + 385.0, + 1405.0, + 421.0, + 291.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 416.0, + 829.0, + 416.0, + 829.0, + 454.0, + 293.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 881.0, + 416.0, + 1407.0, + 416.0, + 1407.0, + 454.0, + 881.0, + 454.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 447.0, + 488.0, + 447.0, + 488.0, + 482.0, + 294.0, + 482.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1178.0, + 1404.0, + 1178.0, + 1404.0, + 1210.0, + 295.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1206.0, + 595.0, + 1206.0, + 595.0, + 1243.0, + 294.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 611.0, + 1206.0, + 1404.0, + 1206.0, + 1404.0, + 1243.0, + 611.0, + 1243.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1240.0, + 722.0, + 1240.0, + 722.0, + 1272.0, + 294.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 854.0, + 1240.0, + 1404.0, + 1240.0, + 1404.0, + 1272.0, + 854.0, + 1272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1270.0, + 484.0, + 1270.0, + 484.0, + 1303.0, + 295.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 1270.0, + 670.0, + 1270.0, + 670.0, + 1303.0, + 575.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 758.0, + 1270.0, + 768.0, + 1270.0, + 768.0, + 1303.0, + 758.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 888.0, + 1270.0, + 898.0, + 1270.0, + 898.0, + 1303.0, + 888.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 973.0, + 1270.0, + 1062.0, + 1270.0, + 1062.0, + 1303.0, + 973.0, + 1303.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1878.0, + 1215.0, + 1878.0, + 1215.0, + 1917.0, + 294.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 1878.0, + 1405.0, + 1878.0, + 1405.0, + 1917.0, + 1327.0, + 1917.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1910.0, + 782.0, + 1910.0, + 782.0, + 1948.0, + 295.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 1910.0, + 1404.0, + 1910.0, + 1404.0, + 1948.0, + 983.0, + 1948.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1941.0, + 429.0, + 1941.0, + 429.0, + 1979.0, + 294.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 813.0, + 1941.0, + 899.0, + 1941.0, + 899.0, + 1979.0, + 813.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 965.0, + 1941.0, + 1250.0, + 1941.0, + 1250.0, + 1979.0, + 965.0, + 1979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 333.0, + 1971.0, + 902.0, + 1971.0, + 902.0, + 2008.0, + 333.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1097.0, + 1971.0, + 1404.0, + 1971.0, + 1404.0, + 2008.0, + 1097.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 2000.0, + 444.0, + 2000.0, + 444.0, + 2038.0, + 294.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 782.0, + 2000.0, + 791.0, + 2000.0, + 791.0, + 2038.0, + 782.0, + 2038.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1625.0, + 799.0, + 1625.0, + 799.0, + 1665.0, + 293.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1039.0, + 1625.0, + 1095.0, + 1625.0, + 1095.0, + 1665.0, + 1039.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1186.0, + 1625.0, + 1408.0, + 1625.0, + 1408.0, + 1665.0, + 1186.0, + 1665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1657.0, + 417.0, + 1657.0, + 417.0, + 1696.0, + 292.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 540.0, + 1657.0, + 646.0, + 1657.0, + 646.0, + 1696.0, + 540.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 1657.0, + 1262.0, + 1657.0, + 1262.0, + 1696.0, + 1037.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1352.0, + 1657.0, + 1408.0, + 1657.0, + 1408.0, + 1696.0, + 1352.0, + 1696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1689.0, + 344.0, + 1689.0, + 344.0, + 1726.0, + 292.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 415.0, + 1689.0, + 582.0, + 1689.0, + 582.0, + 1726.0, + 415.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 654.0, + 1689.0, + 806.0, + 1689.0, + 806.0, + 1726.0, + 654.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 1689.0, + 1406.0, + 1689.0, + 1406.0, + 1726.0, + 1035.0, + 1726.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1721.0, + 513.0, + 1721.0, + 513.0, + 1759.0, + 293.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 650.0, + 1721.0, + 660.0, + 1721.0, + 660.0, + 1759.0, + 650.0, + 1759.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 753.0, + 572.0, + 753.0, + 572.0, + 791.0, + 294.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 667.0, + 753.0, + 698.0, + 753.0, + 698.0, + 791.0, + 667.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 718.0, + 753.0, + 1054.0, + 753.0, + 1054.0, + 791.0, + 718.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 753.0, + 1403.0, + 753.0, + 1403.0, + 791.0, + 1074.0, + 791.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 782.0, + 338.0, + 782.0, + 338.0, + 821.0, + 292.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 452.0, + 782.0, + 1160.0, + 782.0, + 1160.0, + 821.0, + 452.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1212.0, + 782.0, + 1407.0, + 782.0, + 1407.0, + 821.0, + 1212.0, + 821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 816.0, + 362.0, + 816.0, + 362.0, + 851.0, + 296.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 816.0, + 445.0, + 816.0, + 445.0, + 851.0, + 396.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 816.0, + 609.0, + 816.0, + 609.0, + 851.0, + 480.0, + 851.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 920.0, + 1403.0, + 920.0, + 1403.0, + 956.0, + 296.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 955.0, + 1071.0, + 955.0, + 1071.0, + 987.0, + 297.0, + 987.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 672.0, + 1402.0, + 672.0, + 1402.0, + 715.0, + 292.0, + 715.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 704.0, + 391.0, + 704.0, + 391.0, + 740.0, + 290.0, + 740.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 570.0, + 1139.0, + 570.0, + 1139.0, + 609.0, + 297.0, + 609.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1031.0, + 629.0, + 1031.0, + 629.0, + 1074.0, + 295.0, + 1074.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1472.0, + 589.0, + 1472.0, + 589.0, + 1535.0, + 288.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 774.0, + 1472.0, + 823.0, + 1472.0, + 823.0, + 1535.0, + 774.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 1472.0, + 1097.0, + 1472.0, + 1097.0, + 1535.0, + 1000.0, + 1535.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1300.0, + 309.0, + 1300.0, + 309.0, + 1359.0, + 289.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1429.0, + 1300.0, + 1455.0, + 1300.0, + 1455.0, + 1359.0, + 1429.0, + 1359.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1345.0, + 377.0, + 1345.0, + 377.0, + 1391.0, + 291.0, + 1391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1572.0, + 382.0, + 1572.0, + 382.0, + 1613.0, + 294.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 503.0, + 1572.0, + 552.0, + 1572.0, + 552.0, + 1613.0, + 503.0, + 1613.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 627.0, + 1572.0, + 636.0, + 1572.0, + 636.0, + 1613.0, + 627.0, + 1613.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 11, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 1733, + 1403, + 1733, + 1403, + 1889, + 298, + 1889 + ], + "score": 0.976 + }, + { + "category_id": 1, + "poly": [ + 297, + 1564, + 1404, + 1564, + 1404, + 1720, + 297, + 1720 + ], + "score": 0.975 + }, + { + "category_id": 1, + "poly": [ + 299, + 553, + 1406, + 553, + 1406, + 617, + 299, + 617 + ], + "score": 0.938 + }, + { + "category_id": 8, + "poly": [ + 432, + 500, + 1213, + 500, + 1213, + 538, + 432, + 538 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 300, + 352, + 806, + 352, + 806, + 386, + 300, + 386 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 298, + 452, + 733, + 452, + 733, + 485, + 298, + 485 + ], + "score": 0.918 + }, + { + "category_id": 0, + "poly": [ + 299, + 1508, + 628, + 1508, + 628, + 1539, + 299, + 1539 + ], + "score": 0.91 + }, + { + "category_id": 1, + "poly": [ + 292, + 2001, + 1300, + 2001, + 1300, + 2036, + 292, + 2036 + ], + "score": 0.907 + }, + { + "category_id": 0, + "poly": [ + 298, + 1932, + 468, + 1932, + 468, + 1967, + 298, + 1967 + ], + "score": 0.903 + }, + { + "category_id": 1, + "poly": [ + 324, + 686, + 1362, + 686, + 1362, + 777, + 324, + 777 + ], + "score": 0.902 + }, + { + "category_id": 1, + "poly": [ + 381, + 1410, + 835, + 1410, + 835, + 1441, + 381, + 1441 + ], + "score": 0.896 + }, + { + "category_id": 8, + "poly": [ + 490, + 400, + 1152, + 400, + 1152, + 439, + 490, + 439 + ], + "score": 0.893 + }, + { + "category_id": 1, + "poly": [ + 350, + 778, + 895, + 778, + 895, + 816, + 350, + 816 + ], + "score": 0.883 + }, + { + "category_id": 1, + "poly": [ + 323, + 651, + 1099, + 651, + 1099, + 684, + 323, + 684 + ], + "score": 0.882 + }, + { + "category_id": 2, + "poly": [ + 836, + 2088, + 864, + 2088, + 864, + 2112, + 836, + 2112 + ], + "score": 0.855 + }, + { + "category_id": 0, + "poly": [ + 299, + 295, + 577, + 295, + 577, + 328, + 299, + 328 + ], + "score": 0.84 + }, + { + "category_id": 0, + "poly": [ + 297, + 227, + 1004, + 227, + 1004, + 262, + 297, + 262 + ], + "score": 0.839 + }, + { + "category_id": 1, + "poly": [ + 350, + 975, + 1045, + 975, + 1045, + 1011, + 350, + 1011 + ], + "score": 0.721 + }, + { + "category_id": 1, + "poly": [ + 351, + 1307, + 1243, + 1307, + 1243, + 1406, + 351, + 1406 + ], + "score": 0.655 + }, + { + "category_id": 8, + "poly": [ + 353, + 1036, + 1234, + 1036, + 1234, + 1171, + 353, + 1171 + ], + "score": 0.642 + }, + { + "category_id": 1, + "poly": [ + 371, + 1173, + 1394, + 1173, + 1394, + 1285, + 371, + 1285 + ], + "score": 0.642 + }, + { + "category_id": 2, + "poly": [ + 297, + 74, + 855, + 74, + 855, + 106, + 297, + 106 + ], + "score": 0.545 + }, + { + "category_id": 8, + "poly": [ + 363, + 874, + 1072, + 874, + 1072, + 973, + 363, + 973 + ], + "score": 0.436 + }, + { + "category_id": 2, + "poly": [ + 297, + 74, + 855, + 74, + 855, + 106, + 297, + 106 + ], + "score": 0.382 + }, + { + "category_id": 1, + "poly": [ + 352, + 1144, + 592, + 1144, + 592, + 1172, + 352, + 1172 + ], + "score": 0.278 + }, + { + "category_id": 1, + "poly": [ + 352, + 841, + 743, + 841, + 743, + 874, + 352, + 874 + ], + "score": 0.218 + }, + { + "category_id": 8, + "poly": [ + 378, + 1206, + 1093, + 1206, + 1093, + 1284, + 378, + 1284 + ], + "score": 0.151 + }, + { + "category_id": 8, + "poly": [ + 371, + 1173, + 1394, + 1173, + 1394, + 1285, + 371, + 1285 + ], + "score": 0.121 + }, + { + "category_id": 13, + "poly": [ + 1135, + 1304, + 1232, + 1304, + 1232, + 1344, + 1135, + 1344 + ], + "score": 0.93, + "latex": "\\{ \\widehat { S } _ { b } \\} _ { b \\in \\mathbb { Z } }" + }, + { + "category_id": 13, + "poly": [ + 1163, + 2000, + 1290, + 2000, + 1290, + 2036, + 1163, + 2036 + ], + "score": 0.93, + "latex": "\\mathbb { X } = [ 0 , 1 ] ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 963, + 1658, + 1166, + 1658, + 1166, + 1691, + 963, + 1691 + ], + "score": 0.92, + "latex": "( n , K ) = ( 1 0 0 , 5 )" + }, + { + "category_id": 13, + "poly": [ + 679, + 1659, + 755, + 1659, + 755, + 1691, + 679, + 1691 + ], + "score": 0.92, + "latex": "( n , K )" + }, + { + "category_id": 13, + "poly": [ + 470, + 972, + 615, + 972, + 615, + 1010, + 470, + 1010 + ], + "score": 0.92, + "latex": "\\widehat { \\beta } _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\widehat { \\gamma } _ { a }" + }, + { + "category_id": 13, + "poly": [ + 686, + 774, + 888, + 774, + 888, + 816, + 686, + 816 + ], + "score": 0.92, + "latex": "\\widehat { \\Phi } _ { 0 } = \\widehat { \\Phi } _ { 1 } = O _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 658, + 975, + 777, + 975, + 777, + 1010, + 658, + 1010 + ], + "score": 0.92, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 722, + 1626, + 1011, + 1626, + 1011, + 1661, + 722, + 1661 + ], + "score": 0.92, + "latex": "N ( T _ { j } ) - N ( T _ { j - 1 } ) = 2 n" + }, + { + "category_id": 13, + "poly": [ + 497, + 1245, + 744, + 1245, + 744, + 1284, + 497, + 1284 + ], + "score": 0.92, + "latex": "\\widehat { S } _ { b } = \\bar { \\varphi } ^ { \\top } ( \\widehat { \\beta } _ { 1 , b } - \\widehat { \\beta } _ { 0 , b } )" + }, + { + "category_id": 13, + "poly": [ + 492, + 1626, + 668, + 1626, + 668, + 1660, + 492, + 1660 + ], + "score": 0.92, + "latex": "N ( T _ { 1 } ) \\stackrel { - } { = } 1 0 0 0" + }, + { + "category_id": 13, + "poly": [ + 1044, + 1765, + 1106, + 1765, + 1106, + 1798, + 1044, + 1798 + ], + "score": 0.92, + "latex": "\\alpha _ { 1 } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 379, + 1205, + 1074, + 1205, + 1074, + 1244, + 379, + 1244 + ], + "score": 0.91, + "latex": "\\widehat { \\beta } _ { a , b } = ( 1 - m n ^ { - 1 } ) \\widehat { \\beta } _ { a , b } + n ^ { - 1 } \\widehat { \\Phi } _ { a } ^ { 1 / 2 } e _ { a } + n ^ { - 1 } \\widehat { \\phi } ^ { 1 / 2 } e _ { 2 } , a = 0 , 1" + }, + { + "category_id": 13, + "poly": [ + 325, + 720, + 506, + 720, + 506, + 753, + 325, + 753 + ], + "score": 0.91, + "latex": "\\mathcal { T } = \\{ 1 , \\ldots , B \\}" + }, + { + "category_id": 13, + "poly": [ + 829, + 971, + 1034, + 971, + 1034, + 1010, + 829, + 1010 + ], + "score": 0.91, + "latex": "S = \\bar { \\varphi } ^ { \\top } ( \\widehat { \\beta } _ { 1 } - \\widehat { \\beta } _ { 0 } )" + }, + { + "category_id": 13, + "poly": [ + 590, + 1309, + 953, + 1309, + 953, + 1344, + 590, + 1344 + ], + "score": 0.91, + "latex": "\\{ \\alpha ( t ) - | \\mathcal { T } | ^ { c } / B | \\} / ( 1 - | \\mathcal { T } ^ { c } | / B )" + }, + { + "category_id": 13, + "poly": [ + 1304, + 1596, + 1392, + 1596, + 1392, + 1629, + 1304, + 1629 + ], + "score": 0.91, + "latex": "N ( 0 , 1 )" + }, + { + "category_id": 13, + "poly": [ + 678, + 1172, + 806, + 1172, + 806, + 1206, + 678, + 1206 + ], + "score": 0.91, + "latex": "N ( 0 , I _ { p + 1 } )" + }, + { + "category_id": 13, + "poly": [ + 1057, + 1628, + 1198, + 1628, + 1198, + 1658, + 1057, + 1658 + ], + "score": 0.91, + "latex": "2 \\leq j \\leq K" + }, + { + "category_id": 13, + "poly": [ + 493, + 1343, + 748, + 1343, + 748, + 1381, + 493, + 1381 + ], + "score": 0.9, + "latex": "{ \\mathcal { T } } \\{ b \\in { \\mathcal { T } } : { \\widehat { S } } _ { b } \\leq z \\}" + }, + { + "category_id": 13, + "poly": [ + 1043, + 652, + 1092, + 652, + 1092, + 685, + 1043, + 685 + ], + "score": 0.9, + "latex": "\\alpha ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 403, + 842, + 598, + 842, + 598, + 875, + 403, + 875 + ], + "score": 0.9, + "latex": "i = N ( t _ { k - 1 } ) + 1" + }, + { + "category_id": 13, + "poly": [ + 380, + 1379, + 452, + 1379, + 452, + 1406, + 380, + 1406 + ], + "score": 0.9, + "latex": "S > z" + }, + { + "category_id": 13, + "poly": [ + 379, + 1070, + 797, + 1070, + 797, + 1107, + 379, + 1107 + ], + "score": 0.9, + "latex": "{ \\widehat { \\boldsymbol { \\phi } } } = { \\widehat { \\boldsymbol { \\phi } } } + [ \\{ \\varphi ( X _ { i } ) - { \\bar { \\varphi } } \\} ^ { \\top } ( { \\widehat { \\beta } } _ { 1 } - { \\widehat { \\beta } } _ { 0 } ) ] ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 403, + 1037, + 598, + 1037, + 598, + 1070, + 403, + 1070 + ], + "score": 0.89, + "latex": "i = N ( t _ { k - 1 } ) + 1" + }, + { + "category_id": 13, + "poly": [ + 458, + 1410, + 496, + 1410, + 496, + 1439, + 458, + 1439 + ], + "score": 0.89, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 630, + 842, + 703, + 842, + 703, + 875, + 630, + 875 + ], + "score": 0.89, + "latex": "N ( t _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 1317, + 1630, + 1393, + 1630, + 1393, + 1655, + 1317, + 1655 + ], + "score": 0.88, + "latex": "n > 0" + }, + { + "category_id": 13, + "poly": [ + 698, + 871, + 1062, + 871, + 1062, + 906, + 698, + 906 + ], + "score": 0.88, + "latex": "\\bar { \\varphi } = n ^ { - 1 } ( n - 1 ) \\bar { \\varphi } + n ^ { - 1 } \\varphi ( X _ { i } ) \\colon" + }, + { + "category_id": 13, + "poly": [ + 950, + 1857, + 1005, + 1857, + 1005, + 1886, + 950, + 1886 + ], + "score": 0.87, + "latex": "50 \\%" + }, + { + "category_id": 13, + "poly": [ + 374, + 753, + 444, + 753, + 444, + 778, + 374, + 778 + ], + "score": 0.86, + "latex": "k = 1" + }, + { + "category_id": 14, + "poly": [ + 489, + 400, + 1148, + 400, + 1148, + 439, + 489, + 439 + ], + "score": 0.86, + "latex": "H _ { 0 } : { \\mathrm { E } } Y _ { i } ^ { * } ( 1 ) \\leq { \\mathrm { E } } Y _ { i } ^ { * } ( 0 ) { \\mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \\mathrm { E } } Y _ { i } ^ { * } ( 1 ) > { \\mathrm { E } } Y _ { i } ^ { * } ( 0 ) ." + }, + { + "category_id": 13, + "poly": [ + 403, + 1144, + 552, + 1144, + 552, + 1173, + 403, + 1173 + ], + "score": 0.86, + "latex": "b = 1 , \\dots , B" + }, + { + "category_id": 13, + "poly": [ + 841, + 1689, + 865, + 1689, + 865, + 1719, + 841, + 1719 + ], + "score": 0.86, + "latex": "Q" + }, + { + "category_id": 13, + "poly": [ + 513, + 875, + 649, + 875, + 649, + 902, + 513, + 902 + ], + "score": 0.86, + "latex": "m = m + 1" + }, + { + "category_id": 13, + "poly": [ + 1363, + 1177, + 1392, + 1177, + 1392, + 1203, + 1363, + 1203 + ], + "score": 0.85, + "latex": "e _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 381, + 876, + 500, + 876, + 500, + 902, + 381, + 902 + ], + "score": 0.84, + "latex": "n = n + 1" + }, + { + "category_id": 14, + "poly": [ + 427, + 500, + 1214, + 500, + 1214, + 538, + 427, + 538 + ], + "score": 0.83, + "latex": "H _ { 0 } : { \\mathrm { E } } Q ( X _ { i } , 1 ) \\leq { \\mathrm { E } } Q ( X _ { i } , 0 ) { \\mathrm { ~ v e r s u s ~ } } H _ { 1 } : { \\mathrm { E } } Q ( X _ { i } , 1 ) > { \\mathrm { E } } Q ( X _ { i } , 0 ) ." + }, + { + "category_id": 13, + "poly": [ + 1162, + 1600, + 1188, + 1600, + 1188, + 1627, + 1162, + 1627 + ], + "score": 0.82, + "latex": "\\varepsilon _ { i }" + }, + { + "category_id": 13, + "poly": [ + 439, + 1348, + 461, + 1348, + 461, + 1375, + 439, + 1375 + ], + "score": 0.82, + "latex": "\\mathcal { T }" + }, + { + "category_id": 13, + "poly": [ + 378, + 905, + 1064, + 905, + 1064, + 940, + 378, + 940 + ], + "score": 0.82, + "latex": "\\widehat { \\Sigma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\Sigma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1" + }, + { + "category_id": 13, + "poly": [ + 743, + 654, + 768, + 654, + 768, + 680, + 743, + 680 + ], + "score": 0.82, + "latex": "B" + }, + { + "category_id": 13, + "poly": [ + 475, + 781, + 553, + 781, + 553, + 811, + 475, + 811 + ], + "score": 0.81, + "latex": "m = 0" + }, + { + "category_id": 13, + "poly": [ + 947, + 684, + 1168, + 684, + 1168, + 724, + 947, + 724 + ], + "score": 0.81, + "latex": "\\widehat { \\beta } _ { 0 , b } = \\widehat { \\beta } _ { 1 , b } = 0 _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 476, + 753, + 504, + 753, + 504, + 777, + 476, + 777 + ], + "score": 0.8, + "latex": "K" + }, + { + "category_id": 13, + "poly": [ + 395, + 1316, + 413, + 1316, + 413, + 1338, + 395, + 1338 + ], + "score": 0.79, + "latex": "z" + }, + { + "category_id": 13, + "poly": [ + 538, + 683, + 739, + 683, + 739, + 724, + 538, + 724 + ], + "score": 0.79, + "latex": "\\widehat { \\Sigma } _ { 0 } = \\widehat { \\Sigma } _ { 1 } = O _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 812, + 659, + 833, + 659, + 833, + 680, + 812, + 680 + ], + "score": 0.77, + "latex": "\\alpha" + }, + { + "category_id": 13, + "poly": [ + 381, + 941, + 1006, + 941, + 1006, + 972, + 381, + 972 + ], + "score": 0.76, + "latex": "\\widehat { \\gamma } _ { a } = ( 1 - n ^ { - 1 } ) \\widehat { \\gamma } _ { a } + n ^ { - 1 } \\varphi ( X _ { i } ) Y _ { i } \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;" + }, + { + "category_id": 13, + "poly": [ + 455, + 685, + 526, + 685, + 526, + 718, + 455, + 718 + ], + "score": 0.76, + "latex": "n = 0" + }, + { + "category_id": 13, + "poly": [ + 563, + 775, + 634, + 775, + 634, + 813, + 563, + 813 + ], + "score": 0.75, + "latex": "\\widehat { \\phi } = 0" + }, + { + "category_id": 13, + "poly": [ + 630, + 1037, + 703, + 1037, + 703, + 1070, + 630, + 1070 + ], + "score": 0.74, + "latex": "N ( t _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 531, + 2004, + 555, + 2004, + 555, + 2030, + 531, + 2030 + ], + "score": 0.73, + "latex": "\\mathbb { X }" + }, + { + "category_id": 13, + "poly": [ + 1178, + 691, + 1251, + 691, + 1251, + 722, + 1178, + 722 + ], + "score": 0.72, + "latex": "\\bar { \\varphi } = 0" + }, + { + "category_id": 13, + "poly": [ + 751, + 685, + 937, + 685, + 937, + 724, + 751, + 724 + ], + "score": 0.69, + "latex": "\\widehat { \\gamma } _ { 0 } = \\widehat { \\gamma } _ { 1 } = 0 _ { p + 1 }" + }, + { + "category_id": 13, + "poly": [ + 380, + 1107, + 1225, + 1107, + 1225, + 1145, + 380, + 1145 + ], + "score": 0.65, + "latex": "\\widehat { \\Phi } _ { a } = \\widehat { \\Phi } _ { a } + \\widehat { \\Sigma } _ { a } ^ { - 1 } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;" + }, + { + "category_id": 13, + "poly": [ + 1083, + 1172, + 1173, + 1172, + 1173, + 1206, + 1083, + 1206 + ], + "score": 0.55, + "latex": "N ( 0 , 1 )" + }, + { + "category_id": 14, + "poly": [ + 378, + 1107, + 1228, + 1107, + 1228, + 1147, + 378, + 1147 + ], + "score": 0.42, + "latex": "\\widehat { \\Phi } _ { a } = \\widehat { \\Phi } _ { a } + \\widehat { \\Sigma } _ { a } ^ { - 1 } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) , a = 0 , 1 ;" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1505.0, + 633.0, + 1505.0, + 633.0, + 1543.0, + 295.0, + 1543.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1929.0, + 473.0, + 1929.0, + 473.0, + 1973.0, + 293.0, + 1973.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": [ + 296.0, + 296.0, + 579.0, + 296.0, + 579.0, + 329.0, + 296.0, + 329.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 226.0, + 1007.0, + 226.0, + 1007.0, + 266.0, + 293.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 856.0, + 72.0, + 856.0, + 109.0, + 297.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 856.0, + 72.0, + 856.0, + 109.0, + 297.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1730.0, + 1405.0, + 1730.0, + 1405.0, + 1772.0, + 292.0, + 1772.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1762.0, + 1043.0, + 1762.0, + 1043.0, + 1803.0, + 293.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1107.0, + 1762.0, + 1405.0, + 1762.0, + 1405.0, + 1803.0, + 1107.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1792.0, + 1407.0, + 1792.0, + 1407.0, + 1831.0, + 293.0, + 1831.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1824.0, + 1407.0, + 1824.0, + 1407.0, + 1863.0, + 293.0, + 1863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1858.0, + 949.0, + 1858.0, + 949.0, + 1891.0, + 294.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 1858.0, + 1299.0, + 1858.0, + 1299.0, + 1891.0, + 1006.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1565.0, + 1404.0, + 1565.0, + 1404.0, + 1602.0, + 294.0, + 1602.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1593.0, + 1161.0, + 1593.0, + 1161.0, + 1631.0, + 294.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1189.0, + 1593.0, + 1303.0, + 1593.0, + 1303.0, + 1631.0, + 1189.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1593.0, + 1404.0, + 1593.0, + 1404.0, + 1631.0, + 1393.0, + 1631.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1625.0, + 491.0, + 1625.0, + 491.0, + 1662.0, + 294.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 669.0, + 1625.0, + 721.0, + 1625.0, + 721.0, + 1662.0, + 669.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1012.0, + 1625.0, + 1056.0, + 1625.0, + 1056.0, + 1662.0, + 1012.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 1625.0, + 1316.0, + 1625.0, + 1316.0, + 1662.0, + 1199.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1625.0, + 1404.0, + 1625.0, + 1404.0, + 1662.0, + 1394.0, + 1662.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1654.0, + 678.0, + 1654.0, + 678.0, + 1695.0, + 294.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 756.0, + 1654.0, + 962.0, + 1654.0, + 962.0, + 1695.0, + 756.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1167.0, + 1654.0, + 1405.0, + 1654.0, + 1405.0, + 1695.0, + 1167.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1687.0, + 840.0, + 1687.0, + 840.0, + 1725.0, + 295.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 866.0, + 1687.0, + 876.0, + 1687.0, + 876.0, + 1725.0, + 866.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 550.0, + 1404.0, + 550.0, + 1404.0, + 588.0, + 296.0, + 588.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 584.0, + 1227.0, + 584.0, + 1227.0, + 620.0, + 296.0, + 620.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 348.0, + 809.0, + 348.0, + 809.0, + 391.0, + 295.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 452.0, + 733.0, + 452.0, + 733.0, + 488.0, + 297.0, + 488.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1997.0, + 530.0, + 1997.0, + 530.0, + 2040.0, + 290.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 556.0, + 1997.0, + 1162.0, + 1997.0, + 1162.0, + 2040.0, + 556.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 1997.0, + 1303.0, + 1997.0, + 1303.0, + 2040.0, + 1291.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 681.0, + 454.0, + 681.0, + 454.0, + 727.0, + 320.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 527.0, + 681.0, + 537.0, + 681.0, + 537.0, + 727.0, + 527.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 740.0, + 681.0, + 750.0, + 681.0, + 750.0, + 727.0, + 740.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 681.0, + 946.0, + 681.0, + 946.0, + 727.0, + 938.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1169.0, + 681.0, + 1177.0, + 681.0, + 1177.0, + 727.0, + 1169.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 681.0, + 1361.0, + 681.0, + 1361.0, + 727.0, + 1252.0, + 727.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 507.0, + 717.0, + 519.0, + 717.0, + 519.0, + 752.0, + 507.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 323.0, + 749.0, + 373.0, + 749.0, + 373.0, + 782.0, + 323.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 445.0, + 749.0, + 475.0, + 749.0, + 475.0, + 782.0, + 445.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 749.0, + 544.0, + 749.0, + 544.0, + 782.0, + 505.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 378.0, + 1405.0, + 457.0, + 1405.0, + 457.0, + 1446.0, + 378.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 497.0, + 1405.0, + 838.0, + 1405.0, + 838.0, + 1446.0, + 497.0, + 1446.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 766.0, + 474.0, + 766.0, + 474.0, + 825.0, + 348.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 554.0, + 766.0, + 562.0, + 766.0, + 562.0, + 825.0, + 554.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 766.0, + 685.0, + 766.0, + 685.0, + 825.0, + 635.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 889.0, + 766.0, + 903.0, + 766.0, + 903.0, + 825.0, + 889.0, + 825.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 644.0, + 742.0, + 644.0, + 742.0, + 696.0, + 320.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 644.0, + 811.0, + 644.0, + 811.0, + 696.0, + 769.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 834.0, + 644.0, + 1042.0, + 644.0, + 1042.0, + 696.0, + 834.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1093.0, + 644.0, + 1104.0, + 644.0, + 1104.0, + 696.0, + 1093.0, + 696.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 352.0, + 967.0, + 469.0, + 967.0, + 469.0, + 1017.0, + 352.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 616.0, + 967.0, + 657.0, + 967.0, + 657.0, + 1017.0, + 616.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 778.0, + 967.0, + 828.0, + 967.0, + 828.0, + 1017.0, + 778.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1035.0, + 967.0, + 1049.0, + 967.0, + 1049.0, + 1017.0, + 1035.0, + 1017.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1303.0, + 394.0, + 1303.0, + 394.0, + 1348.0, + 349.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 414.0, + 1303.0, + 589.0, + 1303.0, + 589.0, + 1348.0, + 414.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 954.0, + 1303.0, + 1134.0, + 1303.0, + 1134.0, + 1348.0, + 954.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1233.0, + 1303.0, + 1245.0, + 1303.0, + 1245.0, + 1348.0, + 1233.0, + 1348.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 1342.0, + 438.0, + 1342.0, + 438.0, + 1384.0, + 349.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 1342.0, + 492.0, + 1342.0, + 492.0, + 1384.0, + 462.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 749.0, + 1342.0, + 760.0, + 1342.0, + 760.0, + 1384.0, + 749.0, + 1384.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1373.0, + 379.0, + 1373.0, + 379.0, + 1412.0, + 350.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 453.0, + 1373.0, + 465.0, + 1373.0, + 465.0, + 1412.0, + 453.0, + 1412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 376.0, + 1165.0, + 677.0, + 1165.0, + 677.0, + 1210.0, + 376.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 807.0, + 1165.0, + 1082.0, + 1165.0, + 1082.0, + 1210.0, + 807.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.0, + 1165.0, + 1362.0, + 1165.0, + 1362.0, + 1210.0, + 1174.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1393.0, + 1165.0, + 1398.0, + 1165.0, + 1398.0, + 1210.0, + 1393.0, + 1210.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 366.0, + 1191.0, + 378.0, + 1191.0, + 378.0, + 1256.0, + 366.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1075.0, + 1191.0, + 1097.0, + 1191.0, + 1097.0, + 1256.0, + 1075.0, + 1256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 375.0, + 1238.0, + 496.0, + 1238.0, + 496.0, + 1290.0, + 375.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 745.0, + 1238.0, + 760.0, + 1238.0, + 760.0, + 1290.0, + 745.0, + 1290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 350.0, + 1138.0, + 402.0, + 1138.0, + 402.0, + 1176.0, + 350.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 553.0, + 1138.0, + 593.0, + 1138.0, + 593.0, + 1176.0, + 553.0, + 1176.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 349.0, + 838.0, + 402.0, + 838.0, + 402.0, + 879.0, + 349.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 838.0, + 629.0, + 838.0, + 629.0, + 879.0, + 599.0, + 879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 838.0, + 744.0, + 838.0, + 744.0, + 879.0, + 704.0, + 879.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 12, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1835, + 1404, + 1835, + 1404, + 1948, + 296, + 1948 + ], + "score": 0.973 + }, + { + "category_id": 1, + "poly": [ + 297, + 1473, + 1406, + 1473, + 1406, + 1569, + 297, + 1569 + ], + "score": 0.972 + }, + { + "category_id": 3, + "poly": [ + 299, + 225, + 1400, + 225, + 1400, + 724, + 299, + 724 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 438, + 1085, + 1205, + 1085, + 1205, + 1172, + 438, + 1172 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 293, + 1739, + 1404, + 1739, + 1404, + 1812, + 293, + 1812 + ], + "score": 0.95 + }, + { + "category_id": 4, + "poly": [ + 297, + 744, + 1403, + 744, + 1403, + 808, + 297, + 808 + ], + "score": 0.943 + }, + { + "category_id": 8, + "poly": [ + 321, + 1634, + 1314, + 1634, + 1314, + 1726, + 321, + 1726 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 291, + 1970, + 1403, + 1970, + 1403, + 2038, + 291, + 2038 + ], + "score": 0.941 + }, + { + "category_id": 0, + "poly": [ + 298, + 1416, + 637, + 1416, + 637, + 1450, + 298, + 1450 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 297, + 1184, + 1409, + 1184, + 1409, + 1251, + 297, + 1251 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 294, + 1581, + 1280, + 1581, + 1280, + 1619, + 294, + 1619 + ], + "score": 0.925 + }, + { + "category_id": 0, + "poly": [ + 298, + 862, + 608, + 862, + 608, + 894, + 298, + 894 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 297, + 1038, + 716, + 1038, + 716, + 1074, + 297, + 1074 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 296, + 919, + 1061, + 919, + 1061, + 954, + 296, + 954 + ], + "score": 0.922 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.869 + }, + { + "category_id": 1, + "poly": [ + 295, + 974, + 926, + 974, + 926, + 1016, + 295, + 1016 + ], + "score": 0.859 + }, + { + "category_id": 2, + "poly": [ + 299, + 76, + 852, + 76, + 852, + 104, + 299, + 104 + ], + "score": 0.762 + }, + { + "category_id": 1, + "poly": [ + 297, + 1318, + 1418, + 1318, + 1418, + 1383, + 297, + 1383 + ], + "score": 0.758 + }, + { + "category_id": 8, + "poly": [ + 296, + 1263, + 1429, + 1263, + 1429, + 1308, + 296, + 1308 + ], + "score": 0.661 + }, + { + "category_id": 2, + "poly": [ + 298, + 76, + 854, + 76, + 854, + 104, + 298, + 104 + ], + "score": 0.099 + }, + { + "category_id": 13, + "poly": [ + 597, + 1740, + 783, + 1740, + 783, + 1783, + 597, + 1783 + ], + "score": 0.94, + "latex": "\\widehat { \\Sigma } _ { a } ( t ) = \\widehat { \\Sigma } _ { a , n ( t ) }" + }, + { + "category_id": 13, + "poly": [ + 1075, + 1583, + 1194, + 1583, + 1194, + 1617, + 1075, + 1617 + ], + "score": 0.93, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 1228, + 2003, + 1350, + 2003, + 1350, + 2036, + 1228, + 2036 + ], + "score": 0.93, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 837, + 1740, + 1015, + 1740, + 1015, + 1784, + 837, + 1784 + ], + "score": 0.93, + "latex": "\\widehat { \\beta } _ { a } ( t ) = \\widehat { \\beta } _ { a , n ( t ) }" + }, + { + "category_id": 13, + "poly": [ + 931, + 2003, + 1082, + 2003, + 1082, + 2036, + 931, + 2036 + ], + "score": 0.93, + "latex": "1 - O ( j _ { n } ^ { - \\alpha _ { 0 } } )" + }, + { + "category_id": 13, + "poly": [ + 541, + 1583, + 613, + 1583, + 613, + 1619, + 541, + 1619 + ], + "score": 0.92, + "latex": "\\sigma ( \\mathcal { F } _ { j } )" + }, + { + "category_id": 14, + "poly": [ + 328, + 1631, + 1315, + 1631, + 1315, + 1728, + 328, + 1728 + ], + "score": 0.92, + "latex": "\\widehat { \\Sigma } _ { a , j } = \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\ \\mathrm { ~ a n d ~ } \\widehat { \\beta } _ { a , j } = \\widehat { \\Sigma } _ { a , j } ^ { - 1 } \\left( \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) Y _ { i } \\right) ." + }, + { + "category_id": 13, + "poly": [ + 297, + 2002, + 540, + 2002, + 540, + 2037, + 297, + 2037 + ], + "score": 0.92, + "latex": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } ( j _ { n } ) \\gg q ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 1180, + 1973, + 1251, + 1973, + 1251, + 2006, + 1180, + 2006 + ], + "score": 0.92, + "latex": "\\{ j _ { n } \\} _ { n }" + }, + { + "category_id": 13, + "poly": [ + 774, + 1507, + 1114, + 1507, + 1114, + 1540, + 774, + 1540 + ], + "score": 0.92, + "latex": "n ( t _ { 1 } ) < n ( t _ { 2 } ) < \\cdot \\cdot \\cdot < n ( t _ { K } )" + }, + { + "category_id": 13, + "poly": [ + 1112, + 1746, + 1347, + 1746, + 1347, + 1780, + 1112, + 1780 + ], + "score": 0.92, + "latex": "\\delta _ { n } = q n ^ { - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } n" + }, + { + "category_id": 13, + "poly": [ + 339, + 1537, + 403, + 1537, + 403, + 1570, + 339, + 1570 + ], + "score": 0.92, + "latex": "n ( t _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 340, + 920, + 426, + 920, + 426, + 951, + 340, + 951 + ], + "score": 0.91, + "latex": "\\mathcal { F } _ { 0 } = \\emptyset" + }, + { + "category_id": 13, + "poly": [ + 297, + 1348, + 613, + 1348, + 613, + 1383, + 297, + 1383 + ], + "score": 0.91, + "latex": "\\operatorname { E } \\{ Y _ { i } ^ { * } ( a ) | X _ { i } \\} = \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a }" + }, + { + "category_id": 13, + "poly": [ + 1309, + 745, + 1372, + 745, + 1372, + 779, + 1309, + 779 + ], + "score": 0.91, + "latex": "\\alpha _ { 1 } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 365, + 1220, + 424, + 1220, + 424, + 1251, + 365, + 1251 + ], + "score": 0.91, + "latex": "\\mathcal { F } _ { i - 1 }" + }, + { + "category_id": 13, + "poly": [ + 342, + 1475, + 391, + 1475, + 391, + 1509, + 342, + 1509 + ], + "score": 0.9, + "latex": "n ( \\cdot )" + }, + { + "category_id": 14, + "poly": [ + 438, + 1084, + 1205, + 1084, + 1205, + 1175, + 438, + 1175 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathrm { E I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} = \\mathrm { E I } ( A _ { i } = a ) \\{ Y _ { i } ^ { \\ast } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} } \\\\ { = \\mathrm { E E } ^ { X _ { i } , F _ { i - 1 } } [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } ^ { \\ast } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 903, + 1184, + 1005, + 1184, + 1005, + 1216, + 903, + 1216 + ], + "score": 0.89, + "latex": "\\mathrm { E } ^ { X _ { i } , \\mathcal { F } _ { i - 1 } }" + }, + { + "category_id": 13, + "poly": [ + 865, + 1475, + 922, + 1475, + 922, + 1507, + 865, + 1507 + ], + "score": 0.89, + "latex": "N ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 390, + 1584, + 455, + 1584, + 455, + 1616, + 390, + 1616 + ], + "score": 0.89, + "latex": "j \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 476, + 1220, + 510, + 1220, + 510, + 1249, + 476, + 1249 + ], + "score": 0.89, + "latex": "X _ { i }" + }, + { + "category_id": 13, + "poly": [ + 984, + 1585, + 1017, + 1585, + 1017, + 1619, + 984, + 1619 + ], + "score": 0.88, + "latex": "{ \\mathcal { F } } _ { j }" + }, + { + "category_id": 13, + "poly": [ + 1069, + 1835, + 1395, + 1835, + 1395, + 1871, + 1069, + 1871 + ], + "score": 0.88, + "latex": "\\lambda _ { \\operatorname* { m i n } } [ E \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] ~ \\geq ~ \\epsilon _ { 0 } ," + }, + { + "category_id": 13, + "poly": [ + 754, + 1840, + 936, + 1840, + 936, + 1869, + 754, + 1869 + ], + "score": 0.87, + "latex": "0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1" + }, + { + "category_id": 14, + "poly": [ + 310, + 1262, + 1428, + 1262, + 1428, + 1306, + 310, + 1306 + ], + "score": 0.85, + "latex": "{ } _ { \\mathfrak { X } ^ { \\lambda _ { i } , F _ { i - 1 } } [ \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] } = \\{ \\mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \\mathbb { I } ( A _ { i } = a ) \\} [ \\mathrm { E } ^ { X _ { i } , F _ { i - 1 } } \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ]" + }, + { + "category_id": 13, + "poly": [ + 583, + 977, + 920, + 977, + 920, + 1016, + 583, + 1016 + ], + "score": 0.83, + "latex": ", ( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp \\mathcal { F } _ { j - 1 } ." + }, + { + "category_id": 13, + "poly": [ + 720, + 1590, + 740, + 1590, + 740, + 1611, + 720, + 1611 + ], + "score": 0.78, + "latex": "\\sigma" + }, + { + "category_id": 13, + "poly": [ + 297, + 1869, + 625, + 1869, + 625, + 1907, + 297, + 1907 + ], + "score": 0.77, + "latex": "\\lambda _ { \\operatorname* { m a x } } [ E \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\leq \\epsilon _ { 0 } ^ { - 1 } ," + }, + { + "category_id": 13, + "poly": [ + 389, + 1040, + 581, + 1040, + 581, + 1074, + 389, + 1074 + ], + "score": 0.76, + "latex": "a \\in \\{ 0 , 1 \\} , i \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 1129, + 1873, + 1402, + 1873, + 1402, + 1908, + 1129, + 1908 + ], + "score": 0.75, + "latex": "\\begin{array} { r } { \\operatorname* { m i n } _ { a \\in \\{ 0 , 1 \\} } \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\geq } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 988, + 1909, + 1382, + 1909, + 1382, + 1946, + 988, + 1946 + ], + "score": 0.66, + "latex": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | \\varphi ^ { \\top } ( x ) \\beta _ { a } | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 631, + 1908, + 933, + 1908, + 933, + 1946, + 631, + 1946 + ], + "score": 0.61, + "latex": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | Y ^ { * } ( a ) | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 329, + 1909, + 622, + 1909, + 622, + 1946, + 329, + 1946 + ], + "score": 0.54, + "latex": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\beta _ { a } \\| _ { 2 } \\leq \\epsilon _ { 0 } ^ { - 1 } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 516, + 979, + 581, + 979, + 581, + 1011, + 516, + 1011 + ], + "score": 0.5, + "latex": "j \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 312, + 1871, + 1388, + 1871, + 1388, + 1908, + 312, + 1908 + ], + "score": 0.48, + "latex": "\\begin{array} { r } { \\operatorname* { m a x } [ E \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\leq \\epsilon _ { 0 } ^ { - 1 } , \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 2 } \\leq \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } , \\operatorname* { m i n } _ { a \\in \\{ 0 , 1 \\} } \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\geqslant \\epsilon _ { 0 } ^ { - 1 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 519, + 1041, + 581, + 1041, + 581, + 1072, + 519, + 1072 + ], + "score": 0.38, + "latex": "i \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 821, + 1975, + 837, + 1975, + 837, + 2000, + 821, + 2000 + ], + "score": 0.38, + "latex": "I" + }, + { + "category_id": 13, + "poly": [ + 362, + 308, + 388, + 308, + 388, + 325, + 362, + 325 + ], + "score": 0.31, + "latex": "\\twoheadleftarrow" + }, + { + "category_id": 13, + "poly": [ + 1172, + 308, + 1200, + 308, + 1200, + 325, + 1172, + 325 + ], + "score": 0.3, + "latex": "\\nleftarrow" + }, + { + "category_id": 13, + "poly": [ + 629, + 308, + 659, + 308, + 659, + 325, + 629, + 325 + ], + "score": 0.27, + "latex": "\\scriptstyle \\left| - \\sigma - \\right." + }, + { + "category_id": 15, + "poly": [ + 430.0, + 231.0, + 504.0, + 231.0, + 504.0, + 256.0, + 430.0, + 256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 699.0, + 231.0, + 777.0, + 231.0, + 777.0, + 256.0, + 699.0, + 256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 972.0, + 231.0, + 1046.0, + 231.0, + 1046.0, + 256.0, + 972.0, + 256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1241.0, + 231.0, + 1320.0, + 231.0, + 1320.0, + 256.0, + 1241.0, + 256.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 320.0, + 261.0, + 353.0, + 261.0, + 353.0, + 285.0, + 320.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 262.0, + 455.0, + 262.0, + 455.0, + 287.0, + 364.0, + 287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 261.0, + 623.0, + 261.0, + 623.0, + 284.0, + 591.0, + 284.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 636.0, + 260.0, + 728.0, + 260.0, + 728.0, + 289.0, + 636.0, + 289.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 862.0, + 261.0, + 893.0, + 261.0, + 893.0, + 285.0, + 862.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 262.0, + 997.0, + 262.0, + 997.0, + 287.0, + 903.0, + 287.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1132.0, + 261.0, + 1165.0, + 261.0, + 1165.0, + 285.0, + 1132.0, + 285.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1175.0, + 261.0, + 1270.0, + 261.0, + 1270.0, + 290.0, + 1175.0, + 290.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 294.0, + 350.0, + 294.0, + 350.0, + 315.0, + 328.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 389.0, + 282.0, + 455.0, + 282.0, + 455.0, + 331.0, + 389.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 294.0, + 622.0, + 294.0, + 622.0, + 315.0, + 598.0, + 315.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 660.0, + 281.0, + 727.0, + 281.0, + 727.0, + 331.0, + 660.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 867.0, + 292.0, + 893.0, + 292.0, + 893.0, + 317.0, + 867.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 902.0, + 281.0, + 997.0, + 281.0, + 997.0, + 331.0, + 902.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1137.0, + 292.0, + 1165.0, + 292.0, + 1165.0, + 317.0, + 1137.0, + 317.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1201.0, + 282.0, + 1269.0, + 282.0, + 1269.0, + 331.0, + 1201.0, + 331.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 305.0, + 315.0, + 352.0, + 315.0, + 352.0, + 391.0, + 305.0, + 391.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 364.0, + 325.0, + 457.0, + 325.0, + 457.0, + 350.0, + 364.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 325.0, + 623.0, + 325.0, + 623.0, + 350.0, + 597.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 321.0, + 727.0, + 321.0, + 727.0, + 353.0, + 634.0, + 353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 326.0, + 893.0, + 326.0, + 893.0, + 350.0, + 870.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 907.0, + 325.0, + 996.0, + 325.0, + 996.0, + 350.0, + 907.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1138.0, + 325.0, + 1165.0, + 325.0, + 1165.0, + 350.0, + 1138.0, + 350.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1170.0, + 319.0, + 1269.0, + 319.0, + 1269.0, + 351.0, + 1170.0, + 351.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 328.0, + 357.0, + 352.0, + 357.0, + 352.0, + 381.0, + 328.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 356.0, + 623.0, + 356.0, + 623.0, + 381.0, + 597.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 870.0, + 358.0, + 892.0, + 358.0, + 892.0, + 380.0, + 870.0, + 380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1141.0, + 357.0, + 1165.0, + 357.0, + 1165.0, + 381.0, + 1141.0, + 381.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 327.0, + 387.0, + 353.0, + 387.0, + 353.0, + 412.0, + 327.0, + 412.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 388.0, + 624.0, + 388.0, + 624.0, + 413.0, + 597.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 868.0, + 388.0, + 895.0, + 388.0, + 895.0, + 413.0, + 868.0, + 413.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1140.0, + 390.0, + 1164.0, + 390.0, + 1164.0, + 411.0, + 1140.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 430.0, + 418.0, + 437.0, + 418.0, + 437.0, + 425.0, + 430.0, + 425.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 335.0, + 423.0, + 350.0, + 423.0, + 350.0, + 442.0, + 335.0, + 442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 604.0, + 422.0, + 623.0, + 422.0, + 623.0, + 443.0, + 604.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 875.0, + 422.0, + 893.0, + 422.0, + 893.0, + 443.0, + 875.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1146.0, + 422.0, + 1165.0, + 422.0, + 1165.0, + 443.0, + 1146.0, + 443.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 477.0, + 354.0, + 477.0, + 354.0, + 503.0, + 314.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 360.0, + 491.0, + 373.0, + 491.0, + 373.0, + 512.0, + 360.0, + 512.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 429.0, + 502.0, + 439.0, + 502.0, + 439.0, + 511.0, + 429.0, + 511.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 652.0, + 501.0, + 664.0, + 501.0, + 664.0, + 509.0, + 652.0, + 509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 476.0, + 895.0, + 476.0, + 895.0, + 502.0, + 855.0, + 502.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 967.0, + 493.0, + 983.0, + 493.0, + 983.0, + 508.0, + 967.0, + 508.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 487.0, + 1189.0, + 487.0, + 1189.0, + 503.0, + 1171.0, + 503.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 282.0, + 509.0, + 370.0, + 509.0, + 370.0, + 654.0, + 282.0, + 654.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 508.0, + 624.0, + 508.0, + 624.0, + 534.0, + 583.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 536.0, + 895.0, + 536.0, + 895.0, + 563.0, + 855.0, + 563.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 966.0, + 529.0, + 986.0, + 529.0, + 986.0, + 549.0, + 966.0, + 549.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1036.0, + 533.0, + 1051.0, + 533.0, + 1051.0, + 548.0, + 1036.0, + 548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 509.0, + 1166.0, + 509.0, + 1166.0, + 537.0, + 1125.0, + 537.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 508.0, + 1256.0, + 508.0, + 1256.0, + 523.0, + 1240.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1309.0, + 543.0, + 1320.0, + 543.0, + 1320.0, + 552.0, + 1309.0, + 552.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 584.0, + 547.0, + 624.0, + 547.0, + 624.0, + 573.0, + 584.0, + 573.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1005.0, + 554.0, + 1016.0, + 554.0, + 1016.0, + 567.0, + 1005.0, + 567.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 551.0, + 1166.0, + 551.0, + 1166.0, + 578.0, + 1126.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 313.0, + 607.0, + 353.0, + 607.0, + 353.0, + 634.0, + 313.0, + 634.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 359.0, + 583.0, + 457.0, + 583.0, + 457.0, + 630.0, + 359.0, + 630.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 586.0, + 624.0, + 586.0, + 624.0, + 612.0, + 583.0, + 612.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 629.0, + 583.0, + 727.0, + 583.0, + 727.0, + 629.0, + 629.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 855.0, + 598.0, + 895.0, + 598.0, + 895.0, + 624.0, + 855.0, + 624.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 903.0, + 582.0, + 1000.0, + 582.0, + 1000.0, + 629.0, + 903.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 577.0, + 1052.0, + 577.0, + 1052.0, + 593.0, + 1037.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1125.0, + 593.0, + 1166.0, + 593.0, + 1166.0, + 619.0, + 1125.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 583.0, + 1269.0, + 583.0, + 1269.0, + 629.0, + 1172.0, + 629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 372.0, + 632.0, + 382.0, + 632.0, + 382.0, + 642.0, + 372.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 623.0, + 457.0, + 623.0, + 457.0, + 652.0, + 385.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 583.0, + 623.0, + 623.0, + 623.0, + 623.0, + 650.0, + 583.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 653.0, + 623.0, + 727.0, + 623.0, + 727.0, + 652.0, + 653.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 732.0, + 635.0, + 748.0, + 635.0, + 748.0, + 650.0, + 732.0, + 650.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 912.0, + 632.0, + 925.0, + 632.0, + 925.0, + 642.0, + 912.0, + 642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 623.0, + 997.0, + 623.0, + 997.0, + 652.0, + 926.0, + 652.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1126.0, + 634.0, + 1166.0, + 634.0, + 1166.0, + 660.0, + 1126.0, + 660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1177.0, + 624.0, + 1267.0, + 624.0, + 1267.0, + 649.0, + 1177.0, + 649.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1271.0, + 627.0, + 1289.0, + 627.0, + 1289.0, + 643.0, + 1271.0, + 643.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 650.0, + 353.0, + 650.0, + 353.0, + 678.0, + 314.0, + 678.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 365.0, + 643.0, + 457.0, + 643.0, + 457.0, + 672.0, + 365.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 634.0, + 645.0, + 726.0, + 645.0, + 726.0, + 670.0, + 634.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 643.0, + 997.0, + 643.0, + 997.0, + 672.0, + 905.0, + 672.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1172.0, + 645.0, + 1269.0, + 645.0, + 1269.0, + 670.0, + 1172.0, + 670.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1305.0, + 644.0, + 1327.0, + 644.0, + 1327.0, + 663.0, + 1305.0, + 663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 664.0, + 622.0, + 664.0, + 622.0, + 687.0, + 586.0, + 687.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 856.0, + 660.0, + 893.0, + 660.0, + 893.0, + 683.0, + 856.0, + 683.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 348.0, + 684.0, + 587.0, + 684.0, + 587.0, + 708.0, + 348.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 618.0, + 684.0, + 858.0, + 684.0, + 858.0, + 708.0, + 618.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 890.0, + 684.0, + 1130.0, + 684.0, + 1130.0, + 708.0, + 890.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1160.0, + 684.0, + 1400.0, + 684.0, + 1400.0, + 708.0, + 1160.0, + 708.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 458.0, + 704.0, + 479.0, + 704.0, + 479.0, + 724.0, + 458.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 728.0, + 704.0, + 749.0, + 704.0, + 749.0, + 725.0, + 728.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 704.0, + 1020.0, + 704.0, + 1020.0, + 725.0, + 1000.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1270.0, + 704.0, + 1290.0, + 704.0, + 1290.0, + 725.0, + 1270.0, + 725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 815.75, + 278.5, + 850.75, + 278.5, + 850.75, + 297.5, + 815.75, + 297.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 773.0, + 298.5, + 830.0, + 298.5, + 830.0, + 314.5, + 773.0, + 314.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 760.0, + 323.5, + 783.0, + 323.5, + 783.0, + 333.0, + 760.0, + 333.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1316.75, + 333.5, + 1395.75, + 333.5, + 1395.75, + 353.5, + 1316.75, + 353.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 724.0, + 356.0, + 749.0, + 356.0, + 749.0, + 366.0, + 724.0, + 366.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1302.25, + 361.5, + 1322.25, + 361.5, + 1322.25, + 370.5, + 1302.25, + 370.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 375.5, + 731.0, + 375.5, + 731.0, + 390.5, + 685.0, + 390.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1283.0, + 374.0, + 1303.0, + 374.0, + 1303.0, + 382.5, + 1283.0, + 382.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 410.0, + 320.0, + 601.0, + 320.0, + 601.0, + 361.0, + 410.0, + 361.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 985.0, + 349.5, + 1145.0, + 349.5, + 1145.0, + 393.0, + 985.0, + 393.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1221.0, + 397.0, + 1256.0, + 397.0, + 1256.0, + 411.0, + 1221.0, + 411.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1244.0, + 384.0, + 1294.0, + 384.0, + 1294.0, + 402.0, + 1244.0, + 402.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 635.0, + 489.0, + 645.0, + 489.0, + 645.0, + 504.0, + 635.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1003.25, + 509.5, + 1012.25, + 509.5, + 1012.25, + 520.5, + 1003.25, + 520.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 630.0, + 553.0, + 649.0, + 553.0, + 649.0, + 571.0, + 630.0, + 571.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1174.25, + 559.5, + 1190.25, + 559.5, + 1190.25, + 576.0, + 1174.25, + 576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 487.0, + 610.0, + 562.0, + 610.0, + 562.0, + 643.5, + 487.0, + 643.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 747.0, + 589.5, + 819.0, + 589.5, + 819.0, + 615.0, + 747.0, + 615.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1347.0, + 568.5, + 1354.0, + 568.5, + 1354.0, + 580.5, + 1347.0, + 580.5 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 743.0, + 1308.0, + 743.0, + 1308.0, + 782.0, + 295.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1373.0, + 743.0, + 1407.0, + 743.0, + 1407.0, + 782.0, + 1373.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 777.0, + 664.0, + 777.0, + 664.0, + 809.0, + 296.0, + 809.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1416.0, + 640.0, + 1416.0, + 640.0, + 1453.0, + 295.0, + 1453.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 862.0, + 611.0, + 862.0, + 611.0, + 898.0, + 294.0, + 898.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 832.0, + 2085.0, + 871.0, + 2085.0, + 871.0, + 2124.0, + 832.0, + 2124.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": [ + 293.0, + 1830.0, + 753.0, + 1830.0, + 753.0, + 1876.0, + 293.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 937.0, + 1830.0, + 1068.0, + 1830.0, + 1068.0, + 1876.0, + 937.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1396.0, + 1830.0, + 1405.0, + 1830.0, + 1405.0, + 1876.0, + 1396.0, + 1876.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1862.0, + 296.0, + 1862.0, + 296.0, + 1916.0, + 290.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1403.0, + 1862.0, + 1406.0, + 1862.0, + 1406.0, + 1916.0, + 1403.0, + 1916.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 288.0, + 1891.0, + 328.0, + 1891.0, + 328.0, + 1957.0, + 288.0, + 1957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 623.0, + 1891.0, + 630.0, + 1891.0, + 630.0, + 1957.0, + 623.0, + 1957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 934.0, + 1891.0, + 987.0, + 1891.0, + 987.0, + 1957.0, + 934.0, + 1957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1383.0, + 1891.0, + 1401.0, + 1891.0, + 1401.0, + 1957.0, + 1383.0, + 1957.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1474.0, + 341.0, + 1474.0, + 341.0, + 1509.0, + 295.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 392.0, + 1474.0, + 864.0, + 1474.0, + 864.0, + 1509.0, + 392.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 923.0, + 1474.0, + 1404.0, + 1474.0, + 1404.0, + 1509.0, + 923.0, + 1509.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1504.0, + 773.0, + 1504.0, + 773.0, + 1541.0, + 292.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 1504.0, + 1406.0, + 1504.0, + 1406.0, + 1541.0, + 1115.0, + 1541.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1536.0, + 338.0, + 1536.0, + 338.0, + 1570.0, + 295.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 404.0, + 1536.0, + 873.0, + 1536.0, + 873.0, + 1570.0, + 404.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 287.0, + 1731.0, + 596.0, + 1731.0, + 596.0, + 1792.0, + 287.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 1731.0, + 836.0, + 1731.0, + 836.0, + 1792.0, + 784.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1016.0, + 1731.0, + 1111.0, + 1731.0, + 1111.0, + 1792.0, + 1016.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 1731.0, + 1409.0, + 1731.0, + 1409.0, + 1792.0, + 1348.0, + 1792.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1774.0, + 909.0, + 1774.0, + 909.0, + 1812.0, + 293.0, + 1812.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1969.0, + 820.0, + 1969.0, + 820.0, + 2008.0, + 293.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 1969.0, + 1179.0, + 1969.0, + 1179.0, + 2008.0, + 838.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 1969.0, + 1405.0, + 1969.0, + 1405.0, + 2008.0, + 1252.0, + 2008.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1997.0, + 296.0, + 1997.0, + 296.0, + 2041.0, + 291.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 541.0, + 1997.0, + 930.0, + 1997.0, + 930.0, + 2041.0, + 541.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 1997.0, + 1227.0, + 1997.0, + 1227.0, + 2041.0, + 1083.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1351.0, + 1997.0, + 1409.0, + 1997.0, + 1409.0, + 2041.0, + 1351.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1177.0, + 902.0, + 1177.0, + 902.0, + 1228.0, + 291.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1006.0, + 1177.0, + 1407.0, + 1177.0, + 1407.0, + 1228.0, + 1006.0, + 1228.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1218.0, + 364.0, + 1218.0, + 364.0, + 1254.0, + 294.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 425.0, + 1218.0, + 475.0, + 1218.0, + 475.0, + 1254.0, + 425.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 511.0, + 1218.0, + 868.0, + 1218.0, + 868.0, + 1254.0, + 511.0, + 1254.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1581.0, + 389.0, + 1581.0, + 389.0, + 1622.0, + 294.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 456.0, + 1581.0, + 540.0, + 1581.0, + 540.0, + 1622.0, + 456.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 1581.0, + 719.0, + 1581.0, + 719.0, + 1622.0, + 614.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 1581.0, + 983.0, + 1581.0, + 983.0, + 1622.0, + 741.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1018.0, + 1581.0, + 1074.0, + 1581.0, + 1074.0, + 1622.0, + 1018.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 1581.0, + 1280.0, + 1581.0, + 1280.0, + 1622.0, + 1195.0, + 1622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1038.0, + 388.0, + 1038.0, + 388.0, + 1076.0, + 294.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 582.0, + 1038.0, + 717.0, + 1038.0, + 717.0, + 1076.0, + 582.0, + 1076.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 914.0, + 339.0, + 914.0, + 339.0, + 960.0, + 293.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 427.0, + 914.0, + 1066.0, + 914.0, + 1066.0, + 960.0, + 427.0, + 960.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 968.0, + 515.0, + 968.0, + 515.0, + 1023.0, + 293.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 921.0, + 968.0, + 928.0, + 968.0, + 928.0, + 1023.0, + 921.0, + 1023.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1316.0, + 1406.0, + 1316.0, + 1406.0, + 1356.0, + 294.0, + 1356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 614.0, + 1347.0, + 968.0, + 1347.0, + 968.0, + 1387.0, + 614.0, + 1387.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 13, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 396, + 1405, + 396, + 1405, + 493, + 296, + 493 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 459, + 829, + 1259, + 829, + 1259, + 1074, + 459, + 1074 + ], + "score": 0.971 + }, + { + "category_id": 8, + "poly": [ + 455, + 1808, + 1267, + 1808, + 1267, + 2047, + 455, + 2047 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 497, + 507, + 1146, + 507, + 1146, + 603, + 497, + 603 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 461, + 682, + 1181, + 682, + 1181, + 776, + 461, + 776 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 589, + 1591, + 1057, + 1591, + 1057, + 1634, + 589, + 1634 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 298, + 1508, + 1410, + 1508, + 1410, + 1574, + 298, + 1574 + ], + "score": 0.946 + }, + { + "category_id": 1, + "poly": [ + 296, + 631, + 470, + 631, + 470, + 667, + 296, + 667 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 296, + 789, + 415, + 789, + 415, + 820, + 296, + 820 + ], + "score": 0.924 + }, + { + "category_id": 8, + "poly": [ + 302, + 1135, + 1371, + 1135, + 1371, + 1229, + 302, + 1229 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 297, + 1083, + 1124, + 1083, + 1124, + 1120, + 297, + 1120 + ], + "score": 0.922 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 107, + 296, + 107 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 296, + 1647, + 415, + 1647, + 415, + 1677, + 296, + 1677 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 295, + 230, + 434, + 230, + 434, + 264, + 295, + 264 + ], + "score": 0.917 + }, + { + "category_id": 1, + "poly": [ + 296, + 1243, + 458, + 1243, + 458, + 1275, + 296, + 1275 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 296, + 1345, + 895, + 1345, + 895, + 1380, + 296, + 1380 + ], + "score": 0.911 + }, + { + "category_id": 1, + "poly": [ + 298, + 1764, + 807, + 1764, + 807, + 1797, + 298, + 1797 + ], + "score": 0.911 + }, + { + "category_id": 8, + "poly": [ + 308, + 1687, + 1332, + 1687, + 1332, + 1748, + 308, + 1748 + ], + "score": 0.908 + }, + { + "category_id": 9, + "poly": [ + 1351, + 285, + 1401, + 285, + 1401, + 317, + 1351, + 317 + ], + "score": 0.89 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1911, + 1402, + 1911, + 1402, + 1942, + 1350, + 1942 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1350, + 862, + 1402, + 862, + 1402, + 894, + 1350, + 894 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1351, + 333, + 1401, + 333, + 1401, + 364, + 1351, + 364 + ], + "score": 0.882 + }, + { + "category_id": 8, + "poly": [ + 291, + 1394, + 1489, + 1394, + 1489, + 1458, + 291, + 1458 + ], + "score": 0.878 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 865, + 2087, + 865, + 2114, + 835, + 2114 + ], + "score": 0.861 + }, + { + "category_id": 8, + "poly": [ + 298, + 1285, + 1405, + 1285, + 1405, + 1331, + 298, + 1331 + ], + "score": 0.732 + }, + { + "category_id": 8, + "poly": [ + 590, + 328, + 1054, + 328, + 1054, + 372, + 590, + 372 + ], + "score": 0.724 + }, + { + "category_id": 8, + "poly": [ + 597, + 278, + 1051, + 278, + 1051, + 322, + 597, + 322 + ], + "score": 0.692 + }, + { + "category_id": 9, + "poly": [ + 1387, + 1461, + 1481, + 1461, + 1481, + 1495, + 1387, + 1495 + ], + "score": 0.522 + }, + { + "category_id": 8, + "poly": [ + 588, + 277, + 1055, + 277, + 1055, + 372, + 588, + 372 + ], + "score": 0.424 + }, + { + "category_id": 1, + "poly": [ + 298, + 1285, + 1405, + 1285, + 1405, + 1331, + 298, + 1331 + ], + "score": 0.153 + }, + { + "category_id": 14, + "poly": [ + 454, + 1810, + 1265, + 1810, + 1265, + 2050, + 454, + 2050 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } \\right) \\leq 0 \\right\\} - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } \\right) \\leq 0 \\right\\} + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 565, + 1510, + 754, + 1510, + 754, + 1544, + 565, + 1544 + ], + "score": 0.94, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 463, + 682, + 1178, + 682, + 1178, + 776, + 463, + 776 + ], + "score": 0.93, + "latex": "\\widehat { \\beta } _ { a , k } - \\beta _ { a } = \\widehat { \\Sigma } _ { a } ^ { - 1 } \\left[ \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right] ," + }, + { + "category_id": 14, + "poly": [ + 293, + 1132, + 1375, + 1132, + 1375, + 1231, + 293, + 1231 + ], + "score": 0.93, + "latex": "B ^ { * } ( t ) = { \\frac { 1 } { \\sqrt { n ( t ) } } } \\sum _ { i = 1 } ^ { n ( t ) } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] ." + }, + { + "category_id": 14, + "poly": [ + 495, + 506, + 1145, + 506, + 1145, + 602, + 495, + 602 + ], + "score": 0.93, + "latex": "\\left\\| \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log k } ." + }, + { + "category_id": 14, + "poly": [ + 461, + 832, + 1258, + 832, + 1258, + 1074, + 461, + 1074 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\Bigg \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } - \\Sigma _ { a } ^ { - 1 } \\left[ \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right] \\Bigg \\| _ { 2 } } \\\\ { \\leq } & { \\| \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\| _ { 2 } \\Bigg \\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\Bigg \\| _ { 2 } } \\\\ { \\leq } & { ( q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } ) q ^ { 1 / 2 } k ^ { - 1 / 2 } \\log ^ { 1 / 2 } k , ~ \\forall k \\geq j _ { n } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 887, + 428, + 1026, + 428, + 1026, + 463, + 887, + 463 + ], + "score": 0.93, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 568, + 1084, + 716, + 1084, + 716, + 1120, + 568, + 1120 + ], + "score": 0.93, + "latex": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 343, + 633, + 460, + 633, + 460, + 667, + 343, + 667 + ], + "score": 0.93, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 1179, + 398, + 1249, + 398, + 1249, + 432, + 1179, + 432 + ], + "score": 0.92, + "latex": "\\{ j _ { n } \\} _ { n }" + }, + { + "category_id": 13, + "poly": [ + 568, + 1346, + 763, + 1346, + 763, + 1382, + 568, + 1382 + ], + "score": 0.92, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 1175, + 431, + 1300, + 431, + 1300, + 463, + 1175, + 463 + ], + "score": 0.92, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 522, + 1541, + 584, + 1541, + 584, + 1574, + 522, + 1574 + ], + "score": 0.92, + "latex": "n ( t _ { 1 } )" + }, + { + "category_id": 14, + "poly": [ + 588, + 275, + 1055, + 275, + 1055, + 376, + 588, + 376 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\| ( \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , } \\\\ { \\| ( \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 587, + 1588, + 1054, + 1588, + 1054, + 1631, + 587, + 1631 + ], + "score": 0.91, + "latex": "q \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } = o ( 1 ) , ~ \\forall k \\geq 1 ," + }, + { + "category_id": 14, + "poly": [ + 311, + 1686, + 1331, + 1686, + 1331, + 1750, + 311, + 1750 + ], + "score": 0.9, + "latex": "\\| \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) \\| _ { 2 } \\leq { \\bar { c } } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} , \\forall k \\geq 1 ," + }, + { + "category_id": 13, + "poly": [ + 968, + 1513, + 1033, + 1513, + 1033, + 1539, + 968, + 1539 + ], + "score": 0.89, + "latex": "\\bar { c } > 0" + }, + { + "category_id": 13, + "poly": [ + 298, + 429, + 494, + 429, + 494, + 463, + 298, + 463 + ], + "score": 0.89, + "latex": "j _ { n } / \\log ( j _ { n } ) \\gg q ," + }, + { + "category_id": 13, + "poly": [ + 298, + 465, + 380, + 465, + 380, + 492, + 298, + 492 + ], + "score": 0.88, + "latex": "k \\geq j _ { n } ," + }, + { + "category_id": 13, + "poly": [ + 344, + 231, + 425, + 231, + 425, + 263, + 344, + 263 + ], + "score": 0.88, + "latex": "k \\geq j _ { n }" + }, + { + "category_id": 13, + "poly": [ + 520, + 1770, + 680, + 1770, + 680, + 1796, + 520, + 1796 + ], + "score": 0.88, + "latex": "z _ { 1 } , z _ { 2 } , \\dotsc , z _ { K }" + }, + { + "category_id": 14, + "poly": [ + 304, + 1284, + 1342, + 1284, + 1342, + 1331, + 304, + 1331 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\| B ^ { * } ( t _ { k } ) - B ( t _ { k } ) \\| _ { 2 } \\preceq \\{ q ^ { 3 / 2 } \\delta _ { n ( t _ { k } ) } + q \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} n ^ { - 1 / 2 } ( t _ { k } ) \\log ^ { 1 / 2 } n ( t _ { k } ) , \\forall k \\geq 1 , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 310, + 1393, + 1428, + 1393, + 1428, + 1458, + 310, + 1458 + ], + "score": 0.87, + "latex": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) \\| _ { 2 } \\leq \\bar { c } \\{ q ^ { 2 } \\delta _ { n ( t _ { k } ) } + q ^ { 3 / 2 } \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} \\sqrt { n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } ." + }, + { + "category_id": 13, + "poly": [ + 454, + 1546, + 471, + 1546, + 471, + 1572, + 454, + 1572 + ], + "score": 0.82, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 825, + 400, + 842, + 400, + 842, + 426, + 825, + 426 + ], + "score": 0.6, + "latex": "^ { l }" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 109.0, + 297.0, + 109.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": [ + 293.0, + 393.0, + 824.0, + 393.0, + 824.0, + 435.0, + 293.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 843.0, + 393.0, + 1178.0, + 393.0, + 1178.0, + 435.0, + 843.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1250.0, + 393.0, + 1405.0, + 393.0, + 1405.0, + 435.0, + 1250.0, + 435.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 426.0, + 297.0, + 426.0, + 297.0, + 468.0, + 291.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 495.0, + 426.0, + 886.0, + 426.0, + 886.0, + 468.0, + 495.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1027.0, + 426.0, + 1174.0, + 426.0, + 1174.0, + 468.0, + 1027.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1301.0, + 426.0, + 1406.0, + 426.0, + 1406.0, + 468.0, + 1301.0, + 468.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 454.0, + 297.0, + 454.0, + 297.0, + 501.0, + 289.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 381.0, + 454.0, + 393.0, + 454.0, + 393.0, + 501.0, + 381.0, + 501.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1506.0, + 564.0, + 1506.0, + 564.0, + 1548.0, + 293.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 755.0, + 1506.0, + 967.0, + 1506.0, + 967.0, + 1548.0, + 755.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1034.0, + 1506.0, + 1404.0, + 1506.0, + 1404.0, + 1548.0, + 1034.0, + 1548.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1538.0, + 453.0, + 1538.0, + 453.0, + 1575.0, + 295.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 472.0, + 1538.0, + 521.0, + 1538.0, + 521.0, + 1575.0, + 472.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 585.0, + 1538.0, + 694.0, + 1538.0, + 694.0, + 1575.0, + 585.0, + 1575.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 625.0, + 342.0, + 625.0, + 342.0, + 673.0, + 294.0, + 673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 625.0, + 473.0, + 625.0, + 473.0, + 673.0, + 461.0, + 673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 784.0, + 417.0, + 784.0, + 417.0, + 823.0, + 294.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1080.0, + 567.0, + 1080.0, + 567.0, + 1123.0, + 295.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1080.0, + 1125.0, + 1080.0, + 1125.0, + 1123.0, + 717.0, + 1123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1646.0, + 416.0, + 1646.0, + 416.0, + 1679.0, + 295.0, + 1679.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 222.0, + 343.0, + 222.0, + 343.0, + 272.0, + 290.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 426.0, + 222.0, + 439.0, + 222.0, + 439.0, + 272.0, + 426.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1241.0, + 460.0, + 1241.0, + 460.0, + 1278.0, + 293.0, + 1278.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1341.0, + 567.0, + 1341.0, + 567.0, + 1388.0, + 295.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 1341.0, + 895.0, + 1341.0, + 895.0, + 1388.0, + 764.0, + 1388.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1760.0, + 519.0, + 1760.0, + 519.0, + 1802.0, + 294.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1760.0, + 808.0, + 1760.0, + 808.0, + 1802.0, + 681.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 300.0, + 1283.0, + 303.0, + 1283.0, + 303.0, + 1337.0, + 300.0, + 1337.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1343.0, + 1283.0, + 1408.0, + 1283.0, + 1408.0, + 1337.0, + 1343.0, + 1337.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 14, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 320, + 1185, + 1475, + 1185, + 1475, + 1386, + 320, + 1386 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 419, + 1635, + 1303, + 1635, + 1303, + 2043, + 419, + 2043 + ], + "score": 0.964 + }, + { + "category_id": 8, + "poly": [ + 543, + 274, + 1101, + 274, + 1101, + 369, + 543, + 369 + ], + "score": 0.955 + }, + { + "category_id": 8, + "poly": [ + 698, + 1051, + 943, + 1051, + 943, + 1128, + 698, + 1128 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 471, + 1484, + 1175, + 1484, + 1175, + 1576, + 471, + 1576 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 297, + 1403, + 1405, + 1403, + 1405, + 1468, + 297, + 1468 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 572, + 761, + 1072, + 761, + 1072, + 804, + 572, + 804 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 298, + 1588, + 1177, + 1588, + 1177, + 1622, + 298, + 1622 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 299, + 673, + 1397, + 673, + 1397, + 750, + 299, + 750 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 296, + 1141, + 458, + 1141, + 458, + 1172, + 296, + 1172 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 297, + 230, + 371, + 230, + 371, + 262, + 297, + 262 + ], + "score": 0.912 + }, + { + "category_id": 1, + "poly": [ + 293, + 393, + 940, + 393, + 940, + 431, + 293, + 431 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 107, + 296, + 107 + ], + "score": 0.906 + }, + { + "category_id": 8, + "poly": [ + 292, + 447, + 1459, + 447, + 1459, + 520, + 292, + 520 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1420, + 1218, + 1471, + 1218, + 1471, + 1250, + 1420, + 1250 + ], + "score": 0.887 + }, + { + "category_id": 1, + "poly": [ + 295, + 999, + 957, + 999, + 957, + 1034, + 295, + 1034 + ], + "score": 0.881 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1646, + 1402, + 1646, + 1402, + 1678, + 1350, + 1678 + ], + "score": 0.878 + }, + { + "category_id": 1, + "poly": [ + 292, + 814, + 1367, + 814, + 1367, + 852, + 292, + 852 + ], + "score": 0.862 + }, + { + "category_id": 8, + "poly": [ + 293, + 588, + 1548, + 588, + 1548, + 658, + 293, + 658 + ], + "score": 0.836 + }, + { + "category_id": 1, + "poly": [ + 296, + 534, + 472, + 534, + 472, + 567, + 296, + 567 + ], + "score": 0.812 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 866, + 2087, + 866, + 2114, + 836, + 2114 + ], + "score": 0.801 + }, + { + "category_id": 8, + "poly": [ + 295, + 865, + 1400, + 865, + 1400, + 986, + 295, + 986 + ], + "score": 0.768 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 866, + 2087, + 866, + 2114, + 836, + 2114 + ], + "score": 0.115 + }, + { + "category_id": 14, + "poly": [ + 420, + 1635, + 1300, + 1635, + 1300, + 2049, + 420, + 2049 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\quad \\mathrm { C o v } [ \\displaystyle \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\varphi ( X _ { i } ) ] [ ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ] \\mathcal { F } _ { i - 1 } ] } \\\\ { = } & { \\quad \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] [ ( A _ { i } = a ) \\{ Y _ { i } ^ { * } ( a ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } ] \\mathcal { F } _ { i - 1 } ] \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] [ ( A _ { i } = a ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } ] \\Sigma _ { a } ^ { - 1 } } \\\\ & { = \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\mathbb { E } \\{ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\pi _ { i - 1 } ( a , X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } \\} \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } \\{ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\pi _ { i - 1 } ( a , X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) | \\mathcal { F } _ { i - 1 } \\} \\Sigma _ { a } ^ { - 1 } } \\\\ { = } & { \\quad \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\Sigma _ { a } ^ { - 1 } , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 697, + 1047, + 944, + 1047, + 944, + 1128, + 697, + 1128 + ], + "score": 0.94, + "latex": "\\mathbb { E } \\| \\pmb { \\xi } _ { i } \\| _ { \\infty } ^ { 3 } \\preceq \\frac { q ^ { 3 / 2 } } { n ^ { 3 / 2 } ( t _ { k } ) } ." + }, + { + "category_id": 13, + "poly": [ + 568, + 676, + 877, + 676, + 877, + 718, + 568, + 718 + ], + "score": 0.93, + "latex": "\\pmb { \\xi } _ { i } = ( \\xi _ { i , 1 } ^ { \\top } , \\xi _ { i , 2 } ^ { \\top } , \\cdot \\cdot \\cdot , \\xi _ { i , K } ^ { \\top } ) ^ { \\top }" + }, + { + "category_id": 13, + "poly": [ + 444, + 816, + 558, + 816, + 558, + 850, + 444, + 850 + ], + "score": 0.93, + "latex": "n ( t _ { 0 } ) = 0" + }, + { + "category_id": 13, + "poly": [ + 875, + 1405, + 968, + 1405, + 968, + 1439, + 875, + 1439 + ], + "score": 0.93, + "latex": "\\{ \\eta _ { i } \\} _ { i \\ge 1 }" + }, + { + "category_id": 13, + "poly": [ + 786, + 815, + 1022, + 815, + 1022, + 851, + 786, + 851 + ], + "score": 0.93, + "latex": "n ( t _ { k - 1 } ) < i \\leq n ( t _ { k } )" + }, + { + "category_id": 13, + "poly": [ + 932, + 675, + 1114, + 675, + 1114, + 715, + 932, + 715 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\mathcal { M } _ { j } = \\sum _ { i = 1 } ^ { j } \\pmb { \\xi } _ { i } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1290, + 679, + 1400, + 679, + 1400, + 715, + 1290, + 715 + ], + "score": 0.92, + "latex": "\\{ \\mathcal { M } _ { i } \\} _ { i \\ge 1 }" + }, + { + "category_id": 14, + "poly": [ + 322, + 1183, + 1428, + 1183, + 1428, + 1388, + 322, + 1388 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } { { } } & { \\underset { i = 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\ \\mathrm { E } \\| \\xi _ { i } \\| _ { \\infty } ^ { 3 } = \\underset { k = 1 } { \\overset { K } { \\sum } } \\ \\underset { i = n ( t _ { k - 1 } ) + 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\ \\mathrm { E } \\| \\xi _ { i } \\| _ { \\infty } ^ { 3 } \\preceq q ^ { 3 / 2 } \\underset { k = 1 } { \\overset { K } { \\sum } } \\ \\frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } } \\\\ { { \\leq } } & { \\frac { q ^ { 3 / 2 } } { \\sqrt { n ( t _ { 1 } ) } } + q ^ { 3 / 2 } \\underset { k = 2 } { \\overset { K } { \\sum } } \\ \\frac { n ( t _ { k } ) - n ( t _ { k - 1 } ) } { n ^ { 3 / 2 } ( t _ { k } ) } \\leq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) + q ^ { 3 / 2 } \\int _ { n ( t _ { 1 } ) } ^ { + \\infty } x ^ { - 3 / 2 } d x = 3 q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { k } ) } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 542, + 271, + 1101, + 271, + 1101, + 371, + 542, + 371 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { z _ { k , - } = z _ { k } - \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} , } \\\\ { z _ { k , + } = z _ { k } + \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 468, + 1481, + 1174, + 1481, + 1174, + 1574, + 468, + 1574 + ], + "score": 0.92, + "latex": "\\left( \\frac { \\mathbb { I } ( i \\leq n ( t _ { 1 } ) ) } { \\sqrt { n ( t _ { 1 } ) } } Z ^ { \\top } , \\frac { \\mathbb { I } ( i \\leq n ( t _ { 2 } ) ) } { \\sqrt { n ( t _ { 2 } ) } } Z ^ { \\top } , \\cdots , \\frac { \\mathbb { I } ( i \\leq n ( t _ { K } ) ) } { \\sqrt { n ( t _ { K } ) } } Z ^ { \\top } \\right) ," + }, + { + "category_id": 13, + "poly": [ + 966, + 716, + 1146, + 716, + 1146, + 749, + 966, + 749 + ], + "score": 0.92, + "latex": "\\{ \\sigma ( \\mathcal { F } _ { i } ) : i \\ge 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 1131, + 817, + 1262, + 817, + 1262, + 847, + 1131, + 847 + ], + "score": 0.91, + "latex": "1 \\leq k \\leq K" + }, + { + "category_id": 13, + "poly": [ + 389, + 397, + 595, + 397, + 595, + 428, + 389, + 428 + ], + "score": 0.91, + "latex": "i \\geq 1 , 1 \\leq k \\leq K" + }, + { + "category_id": 13, + "poly": [ + 1100, + 1402, + 1397, + 1402, + 1397, + 1440, + 1100, + 1440 + ], + "score": 0.91, + "latex": "\\pmb { \\eta _ { i } } \\sim N ( 0 , \\mathbb { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 383, + 1437, + 446, + 1437, + 446, + 1466, + 383, + 1466 + ], + "score": 0.9, + "latex": "i \\geq 1" + }, + { + "category_id": 14, + "poly": [ + 571, + 762, + 1070, + 762, + 1070, + 802, + 571, + 802 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathrm { E } ( \\xi _ { i , k } | \\mathcal { F } _ { i } ) = [ \\{ \\mathrm { E } ( \\xi _ { i , k } | A _ { i } , X _ { i } , \\mathcal { F } _ { i } ) \\} | \\mathcal { F } _ { i } ] = 0 , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 310, + 579, + 1428, + 579, + 1428, + 658, + 310, + 658 + ], + "score": 0.85, + "latex": "\\dot { \\iota } _ { i , k } = \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } ^ { * } ( 0 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] \\mathbb { I } ( \\dot { \\iota } _ { i } ) \\mathbb { 1 } - \\mu _ { 0 } \\mathbb { 1 } / \\mathbb { 1 } \\mu _ { 0 } ]" + }, + { + "category_id": 14, + "poly": [ + 310, + 442, + 1427, + 442, + 1427, + 520, + 310, + 520 + ], + "score": 0.85, + "latex": "\\dot { \\iota } _ { i , k } = \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } [ \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} - \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} ] \\mathbb { I } ( i \\leq n ( t _ { k } ) , 1 ) ." + }, + { + "category_id": 13, + "poly": [ + 372, + 1591, + 395, + 1591, + 395, + 1616, + 372, + 1616 + ], + "score": 0.85, + "latex": "Z" + }, + { + "category_id": 13, + "poly": [ + 728, + 1440, + 756, + 1440, + 756, + 1467, + 728, + 1467 + ], + "score": 0.84, + "latex": "\\eta _ { i }" + }, + { + "category_id": 13, + "poly": [ + 699, + 403, + 715, + 403, + 715, + 429, + 699, + 429 + ], + "score": 0.82, + "latex": "q" + }, + { + "category_id": 13, + "poly": [ + 445, + 1596, + 461, + 1596, + 461, + 1621, + 445, + 1621 + ], + "score": 0.8, + "latex": "p" + }, + { + "category_id": 13, + "poly": [ + 662, + 819, + 675, + 819, + 675, + 844, + 662, + 844 + ], + "score": 0.78, + "latex": "i" + }, + { + "category_id": 14, + "poly": [ + 310, + 863, + 1399, + 863, + 1399, + 945, + 310, + 945 + ], + "score": 0.73, + "latex": "\\xi _ { i } | | _ { \\infty } \\leq \\frac { 1 } { \\sqrt { n ( t _ { k } ) } } \\{ \\| \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} \\| _ { 2 } + \\| \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } ^ { * } ( 0 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} \\| _ { 2 } \\}" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 109.0, + 297.0, + 109.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": [ + 832.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2123.0, + 832.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1402.0, + 874.0, + 1402.0, + 874.0, + 1442.0, + 294.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 1402.0, + 1099.0, + 1402.0, + 1099.0, + 1442.0, + 969.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1398.0, + 1402.0, + 1403.0, + 1402.0, + 1403.0, + 1442.0, + 1398.0, + 1442.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1434.0, + 382.0, + 1434.0, + 382.0, + 1469.0, + 295.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 447.0, + 1434.0, + 727.0, + 1434.0, + 727.0, + 1469.0, + 447.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 757.0, + 1434.0, + 920.0, + 1434.0, + 920.0, + 1469.0, + 757.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1586.0, + 371.0, + 1586.0, + 371.0, + 1625.0, + 295.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 396.0, + 1586.0, + 444.0, + 1586.0, + 444.0, + 1625.0, + 396.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 462.0, + 1586.0, + 1179.0, + 1586.0, + 1179.0, + 1625.0, + 462.0, + 1625.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 671.0, + 567.0, + 671.0, + 567.0, + 724.0, + 291.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 878.0, + 671.0, + 931.0, + 671.0, + 931.0, + 724.0, + 878.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1115.0, + 671.0, + 1289.0, + 671.0, + 1289.0, + 724.0, + 1115.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 713.0, + 965.0, + 713.0, + 965.0, + 752.0, + 295.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1147.0, + 713.0, + 1221.0, + 713.0, + 1221.0, + 752.0, + 1147.0, + 752.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1137.0, + 461.0, + 1137.0, + 461.0, + 1175.0, + 293.0, + 1175.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 226.0, + 376.0, + 226.0, + 376.0, + 265.0, + 295.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 394.0, + 388.0, + 394.0, + 388.0, + 431.0, + 296.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 394.0, + 698.0, + 394.0, + 698.0, + 431.0, + 596.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 716.0, + 394.0, + 939.0, + 394.0, + 939.0, + 431.0, + 716.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 999.0, + 960.0, + 999.0, + 960.0, + 1039.0, + 297.0, + 1039.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 814.0, + 443.0, + 814.0, + 443.0, + 852.0, + 292.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 814.0, + 661.0, + 814.0, + 661.0, + 852.0, + 559.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 676.0, + 814.0, + 785.0, + 814.0, + 785.0, + 852.0, + 676.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1023.0, + 814.0, + 1130.0, + 814.0, + 1130.0, + 852.0, + 1023.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 814.0, + 1372.0, + 814.0, + 1372.0, + 852.0, + 1263.0, + 852.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 527.0, + 475.0, + 527.0, + 475.0, + 575.0, + 292.0, + 575.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 15, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 317, + 691, + 1327, + 691, + 1327, + 907, + 317, + 907 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 318, + 975, + 1431, + 975, + 1431, + 1200, + 318, + 1200 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 536, + 1688, + 1105, + 1688, + 1105, + 1799, + 536, + 1799 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 638, + 362, + 1005, + 362, + 1005, + 455, + 638, + 455 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 296, + 525, + 1497, + 525, + 1497, + 628, + 296, + 628 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 502, + 1875, + 1141, + 1875, + 1141, + 1984, + 502, + 1984 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 292, + 228, + 1403, + 228, + 1403, + 294, + 292, + 294 + ], + "score": 0.954 + }, + { + "category_id": 8, + "poly": [ + 297, + 1472, + 1481, + 1472, + 1481, + 1586, + 297, + 1586 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 292, + 1603, + 1403, + 1603, + 1403, + 1670, + 292, + 1670 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 295, + 470, + 1250, + 470, + 1250, + 507, + 295, + 507 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 289, + 1818, + 1283, + 1818, + 1283, + 1856, + 289, + 1856 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 293, + 923, + 1387, + 923, + 1387, + 962, + 293, + 962 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 296, + 1424, + 458, + 1424, + 458, + 1457, + 296, + 1457 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 295, + 2000, + 1356, + 2000, + 1356, + 2039, + 295, + 2039 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 297, + 1214, + 537, + 1214, + 537, + 1246, + 297, + 1246 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 299, + 307, + 754, + 307, + 754, + 341, + 299, + 341 + ], + "score": 0.917 + }, + { + "category_id": 9, + "poly": [ + 1350, + 393, + 1402, + 393, + 1402, + 425, + 1350, + 425 + ], + "score": 0.898 + }, + { + "category_id": 1, + "poly": [ + 295, + 645, + 341, + 645, + 341, + 677, + 295, + 677 + ], + "score": 0.895 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1913, + 1401, + 1913, + 1401, + 1945, + 1350, + 1945 + ], + "score": 0.882 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1318, + 1402, + 1318, + 1402, + 1349, + 1350, + 1349 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 836, + 2086, + 865, + 2086, + 865, + 2113, + 836, + 2113 + ], + "score": 0.871 + }, + { + "category_id": 8, + "poly": [ + 537, + 1255, + 1105, + 1255, + 1105, + 1410, + 537, + 1410 + ], + "score": 0.765 + }, + { + "category_id": 8, + "poly": [ + 535, + 1255, + 1104, + 1255, + 1104, + 1411, + 535, + 1411 + ], + "score": 0.488 + }, + { + "category_id": 14, + "poly": [ + 317, + 688, + 1328, + 688, + 1328, + 909, + 317, + 909 + ], + "score": 0.95, + "latex": "\\begin{array} { c } { { V ( k _ { 1 } , k _ { 2 } ) = \\displaystyle \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi ^ { * } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\Sigma _ { a } ^ { - 1 } } } \\\\ { { = \\displaystyle \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } = \\displaystyle \\frac { \\sqrt { n ( t _ { k _ { 1 } } ) } } { \\sqrt { n ( t _ { k _ { 2 } } ) } } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } . } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1064, + 2003, + 1180, + 2003, + 1180, + 2035, + 1064, + 2035 + ], + "score": 0.94, + "latex": "K p \\times K p" + }, + { + "category_id": 14, + "poly": [ + 638, + 357, + 1007, + 357, + 1007, + 456, + 638, + 456 + ], + "score": 0.94, + "latex": "\\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\operatorname { E } \\lVert \\pmb { \\eta } _ { i } \\rVert _ { \\infty } ^ { 3 } \\preceq q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) ." + }, + { + "category_id": 14, + "poly": [ + 535, + 1256, + 1109, + 1256, + 1109, + 1409, + 535, + 1409 + ], + "score": 0.94, + "latex": "V = \\left( \\begin{array} { c c c c } { { V ( 1 , 1 ) } } & { { V ( 1 , 2 ) } } & { { . . . } } & { { V ( 1 , K ) } } \\\\ { { V ( 2 , 1 ) } } & { { V ( 2 , 2 ) } } & { { . . . } } & { { V ( 2 , K ) } } \\\\ { { \\vdots } } & { { \\vdots } } & { { } } & { { \\vdots } } \\\\ { { V ( K , 1 ) } } & { { V ( K , 2 ) } } & { { . . . } } & { { V ( K , K ) } } \\end{array} \\right) ." + }, + { + "category_id": 14, + "poly": [ + 502, + 1873, + 1139, + 1873, + 1139, + 1985, + 502, + 1985 + ], + "score": 0.94, + "latex": "\\lambda _ { \\operatorname* { m i n } } \\left[ { V + \\delta _ { n ( t _ { 1 } ) } I _ { K p \\times K p } - \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\operatorname { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) } \\right] \\geq 0 ," + }, + { + "category_id": 14, + "poly": [ + 539, + 1685, + 1101, + 1685, + 1101, + 1798, + 539, + 1798 + ], + "score": 0.93, + "latex": "\\epsilon _ { 0 } ^ { - 2 } q \\operatorname* { s u p } _ { \\stackrel { a \\in \\{ 0 , 1 \\} } { x \\in \\mathbb { X } , j \\geq n ( t _ { 1 } ) } } \\left| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right| ," + }, + { + "category_id": 13, + "poly": [ + 451, + 1818, + 571, + 1818, + 571, + 1858, + 451, + 1858 + ], + "score": 0.93, + "latex": "\\epsilon _ { 0 } ^ { - 2 } q \\delta _ { n ( t _ { 1 } ) }" + }, + { + "category_id": 13, + "poly": [ + 568, + 2004, + 765, + 2004, + 765, + 2036, + 568, + 2036 + ], + "score": 0.92, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 325, + 974, + 1427, + 974, + 1427, + 1202, + 325, + 1202 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\left| b _ { k _ { 1 } } ^ { \\top } \\left( \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathsf { E } ( \\xi _ { i , k _ { 1 } } \\xi _ { 1 , k _ { 2 } } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V ( k _ { 1 } , k _ { 2 } ) \\right) b _ { k _ { 2 } } \\right| } \\\\ { \\ \\preceq } & { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\displaystyle \\sum _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathsf { E } ^ { \\mathcal { F } _ { i - 1 } } \\left\\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\right\\} \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\right\\| _ { 2 } \\| b _ { k _ { 1 } } \\| _ { 2 } \\| b _ { k _ { 2 } } \\| _ { 2 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 833, + 926, + 968, + 926, + 968, + 961, + 833, + 961 + ], + "score": 0.92, + "latex": "\\left\\{ b _ { k } \\right\\} _ { 1 \\leq k \\leq K }" + }, + { + "category_id": 13, + "poly": [ + 852, + 1820, + 1048, + 1820, + 1048, + 1855, + 852, + 1855 + ], + "score": 0.92, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 851, + 2003, + 948, + 2003, + 948, + 2038, + 851, + 2038 + ], + "score": 0.92, + "latex": "I _ { K p \\times K p }" + }, + { + "category_id": 14, + "poly": [ + 310, + 520, + 1428, + 520, + 1428, + 629, + 310, + 629 + ], + "score": 0.91, + "latex": "\\sum _ { i = 1 } ^ { \\langle t \\kappa \\rangle } \\mathbf { E } \\{ \\xi _ { i } , _ { k _ { 1 } } \\xi _ { i , k _ { 2 } } ^ { \\top } | \\mathcal { F } _ { i - 1 } \\} = \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) ," + }, + { + "category_id": 13, + "poly": [ + 1032, + 472, + 1238, + 472, + 1238, + 504, + 1032, + 504 + ], + "score": 0.91, + "latex": "1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K" + }, + { + "category_id": 13, + "poly": [ + 679, + 925, + 741, + 925, + 741, + 953, + 679, + 953 + ], + "score": 0.9, + "latex": "\\mathbb { R } ^ { p + 1 }" + }, + { + "category_id": 14, + "poly": [ + 310, + 1467, + 1428, + 1467, + 1428, + 1588, + 310, + 1588 + ], + "score": 0.9, + "latex": "\\left| \\sum _ { i = 1 } ^ { \\boldsymbol { n } ( t _ { k } ) } \\mathrm { E } ( \\xi _ { i } \\xi _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right| \\Bigg | _ { 2 } \\preceq \\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\pi _ { i - 1 } ( a , X ) - \\pi ^ { * } ( a , X ) \\} \\sigma ^ { 2 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\right\\| ^ { 2 } ," + }, + { + "category_id": 13, + "poly": [ + 327, + 265, + 384, + 265, + 384, + 294, + 327, + 294 + ], + "score": 0.88, + "latex": "\\pi _ { i - 1 }" + }, + { + "category_id": 13, + "poly": [ + 478, + 1215, + 505, + 1215, + 505, + 1242, + 478, + 1242 + ], + "score": 0.83, + "latex": "V" + }, + { + "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": [ + 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, + 226.0, + 1406.0, + 226.0, + 1406.0, + 268.0, + 294.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 262.0, + 326.0, + 262.0, + 326.0, + 295.0, + 296.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 385.0, + 262.0, + 885.0, + 262.0, + 885.0, + 295.0, + 385.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1601.0, + 1406.0, + 1601.0, + 1406.0, + 1642.0, + 294.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1635.0, + 503.0, + 1635.0, + 503.0, + 1673.0, + 295.0, + 1673.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 469.0, + 1031.0, + 469.0, + 1031.0, + 510.0, + 296.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1239.0, + 469.0, + 1249.0, + 469.0, + 1249.0, + 510.0, + 1239.0, + 510.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1817.0, + 450.0, + 1817.0, + 450.0, + 1861.0, + 295.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 572.0, + 1817.0, + 851.0, + 1817.0, + 851.0, + 1861.0, + 572.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1817.0, + 1285.0, + 1817.0, + 1285.0, + 1861.0, + 1049.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 918.0, + 678.0, + 918.0, + 678.0, + 966.0, + 294.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 742.0, + 918.0, + 832.0, + 918.0, + 832.0, + 966.0, + 742.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 969.0, + 918.0, + 1392.0, + 918.0, + 1392.0, + 966.0, + 969.0, + 966.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1424.0, + 460.0, + 1424.0, + 460.0, + 1457.0, + 294.0, + 1457.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1998.0, + 567.0, + 1998.0, + 567.0, + 2042.0, + 293.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 766.0, + 1998.0, + 850.0, + 1998.0, + 850.0, + 2042.0, + 766.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 949.0, + 1998.0, + 1063.0, + 1998.0, + 1063.0, + 2042.0, + 949.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1181.0, + 1998.0, + 1360.0, + 1998.0, + 1360.0, + 2042.0, + 1181.0, + 2042.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1212.0, + 477.0, + 1212.0, + 477.0, + 1249.0, + 295.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 506.0, + 1212.0, + 541.0, + 1212.0, + 541.0, + 1249.0, + 506.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 305.0, + 757.0, + 305.0, + 757.0, + 343.0, + 295.0, + 343.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 643.0, + 344.0, + 643.0, + 344.0, + 682.0, + 293.0, + 682.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 16, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 320, + 460, + 1493, + 460, + 1493, + 834, + 320, + 834 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 527, + 1443, + 1198, + 1443, + 1198, + 1533, + 527, + 1533 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 506, + 1075, + 1137, + 1075, + 1137, + 1187, + 506, + 1187 + ], + "score": 0.961 + }, + { + "category_id": 8, + "poly": [ + 583, + 1237, + 1060, + 1237, + 1060, + 1349, + 583, + 1349 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 575, + 280, + 1068, + 280, + 1068, + 390, + 575, + 390 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 417, + 901, + 1224, + 901, + 1224, + 1011, + 417, + 1011 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 300, + 1364, + 1399, + 1364, + 1399, + 1428, + 300, + 1428 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 298, + 1772, + 1400, + 1772, + 1400, + 1846, + 298, + 1846 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 597, + 1971, + 1042, + 1971, + 1042, + 2044, + 597, + 2044 + ], + "score": 0.948 + }, + { + "category_id": 1, + "poly": [ + 300, + 1694, + 1400, + 1694, + 1400, + 1760, + 300, + 1760 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 730, + 1861, + 913, + 1861, + 913, + 1904, + 730, + 1904 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 340, + 1598, + 1306, + 1598, + 1306, + 1675, + 340, + 1675 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 298, + 407, + 1104, + 407, + 1104, + 444, + 298, + 444 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 298, + 1028, + 534, + 1028, + 534, + 1059, + 298, + 1059 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 297, + 1916, + 1216, + 1916, + 1216, + 1952, + 297, + 1952 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 297, + 1548, + 791, + 1548, + 791, + 1582, + 297, + 1582 + ], + "score": 0.928 + }, + { + "category_id": 1, + "poly": [ + 298, + 230, + 541, + 230, + 541, + 262, + 298, + 262 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 298, + 849, + 707, + 849, + 707, + 881, + 298, + 881 + ], + "score": 0.926 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.907 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1275, + 1401, + 1275, + 1401, + 1307, + 1351, + 1307 + ], + "score": 0.901 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1867, + 1401, + 1867, + 1401, + 1898, + 1351, + 1898 + ], + "score": 0.898 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1447, + 1401, + 1447, + 1401, + 1479, + 1351, + 1479 + ], + "score": 0.884 + }, + { + "category_id": 1, + "poly": [ + 295, + 1198, + 326, + 1198, + 326, + 1224, + 295, + 1224 + ], + "score": 0.88 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 865, + 2087, + 865, + 2113, + 836, + 2113 + ], + "score": 0.875 + }, + { + "category_id": 14, + "poly": [ + 508, + 1074, + 1133, + 1074, + 1133, + 1186, + 508, + 1186 + ], + "score": 0.94, + "latex": "\\mathbf { E } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathrm { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right\\| _ { 2 } \\preceq q n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) + q \\delta _ { n ( t _ { 1 } ) } ," + }, + { + "category_id": 13, + "poly": [ + 887, + 1809, + 1014, + 1809, + 1014, + 1845, + 887, + 1845 + ], + "score": 0.94, + "latex": "\\mathbb { X } = [ 0 , 1 ] ^ { d }" + }, + { + "category_id": 13, + "poly": [ + 713, + 409, + 832, + 409, + 832, + 443, + 713, + 443 + ], + "score": 0.94, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 14, + "poly": [ + 584, + 1234, + 1059, + 1234, + 1059, + 1349, + 584, + 1349 + ], + "score": 0.94, + "latex": "\\mathbf { E } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { K } ) } \\mathbf { E } ( \\pmb { \\xi } _ { i } \\pmb { \\xi } _ { i } ^ { \\top } | \\mathcal { F } _ { i - 1 } ) - V \\right\\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } ," + }, + { + "category_id": 13, + "poly": [ + 777, + 1693, + 917, + 1693, + 917, + 1731, + 777, + 1731 + ], + "score": 0.94, + "latex": "\\partial g ( z ) / \\partial z ^ { ( j ) }" + }, + { + "category_id": 14, + "poly": [ + 598, + 1968, + 1042, + 1968, + 1042, + 2043, + 598, + 2043 + ], + "score": 0.94, + "latex": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\operatorname* { i n f } _ { x _ { 0 } \\in \\mathbb { X } _ { 0 } } \\| \\varphi ( x ) - \\varphi ( x _ { 0 } ) \\| _ { 2 } \\preceq \\frac { \\sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } ." + }, + { + "category_id": 13, + "poly": [ + 628, + 1806, + 805, + 1806, + 805, + 1845, + 628, + 1845 + ], + "score": 0.93, + "latex": "\\varepsilon = \\sqrt { d } / n ^ { 4 } ( t _ { 1 } )" + }, + { + "category_id": 13, + "poly": [ + 371, + 1697, + 450, + 1697, + 450, + 1731, + 371, + 1731 + ], + "score": 0.93, + "latex": "\\partial _ { j } g ( z )" + }, + { + "category_id": 14, + "poly": [ + 413, + 898, + 1223, + 898, + 1223, + 1012, + 413, + 1012 + ], + "score": 0.93, + "latex": "\\left. \\underset { x \\in \\mathbb { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { E } } \\right| \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\Bigg | \\preceq \\delta _ { n ( t _ { 1 } ) } + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) ." + }, + { + "category_id": 14, + "poly": [ + 321, + 461, + 1428, + 461, + 1428, + 836, + 321, + 836 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } { { } } & { { } \\underset { x \\in \\{ 0 , 1 \\} } { \\operatorname* { s u p } } } \\\\ { { \\leq } } & { { } \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | } \\\\ { { + } } & { { } \\operatorname* { P r } ( \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | \\mathbb { 1 } ( \\underset { a \\leq t \\leq \\{ 0 , 1 \\} } { \\operatorname* { s u p } } | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | | } \\\\ { + } & { { } \\operatorname* { P r } ( \\underset { x \\in \\mathcal { X } , j \\geq n ( t _ { 1 } ) } { \\operatorname* { s u p } } | | \\frac { 1 } { j } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} | > z ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 405, + 1810, + 575, + 1810, + 575, + 1845, + 405, + 1845 + ], + "score": 0.92, + "latex": "\\| x - x _ { 0 } \\| _ { 2 } \\leq \\varepsilon" + }, + { + "category_id": 13, + "poly": [ + 342, + 1775, + 397, + 1775, + 397, + 1809, + 342, + 1809 + ], + "score": 0.91, + "latex": "{ \\mathbb X } _ { k , 0 }" + }, + { + "category_id": 13, + "poly": [ + 373, + 1919, + 423, + 1919, + 423, + 1952, + 373, + 1952 + ], + "score": 0.91, + "latex": "| \\mathbb { X } _ { 0 } |" + }, + { + "category_id": 14, + "poly": [ + 730, + 1859, + 912, + 1859, + 912, + 1901, + 730, + 1901 + ], + "score": 0.91, + "latex": "| \\mathbb { X } _ { 0 } | \\leq n ^ { 4 d } ( t _ { 1 } ) ," + }, + { + "category_id": 14, + "poly": [ + 573, + 277, + 1072, + 277, + 1072, + 390, + 573, + 390 + ], + "score": 0.91, + "latex": "\\operatorname* { s u p } _ { a \\in \\{ 0 , 1 \\} } \\left| { \\frac { 1 } { j } } \\sum _ { i = 1 } ^ { j } \\{ \\pi _ { i - 1 } ( a , x ) - \\pi ^ { * } ( a , x ) \\} \\right|" + }, + { + "category_id": 13, + "poly": [ + 1297, + 1775, + 1400, + 1775, + 1400, + 1806, + 1297, + 1806 + ], + "score": 0.91, + "latex": "x _ { 0 } \\in \\mathbb { X } _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 363, + 1364, + 580, + 1364, + 580, + 1401, + 363, + 1401 + ], + "score": 0.9, + "latex": "n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) \\ll \\delta _ { n ( t _ { 1 } ) }" + }, + { + "category_id": 14, + "poly": [ + 336, + 1597, + 1305, + 1597, + 1305, + 1676, + 336, + 1676 + ], + "score": 0.9, + "latex": "c _ { 0 } ( \\psi ) = \\operatorname* { s u p } _ { z , z ^ { \\prime } \\in \\mathbb { R } ^ { p K } } | \\psi ( z ) - \\psi ( z ^ { \\prime } ) | \\mathrm { ~ a n d ~ } c _ { i } = \\operatorname* { s u p } _ { z \\in \\mathbb { R } ^ { p K } } \\sum _ { j _ { 1 } , \\cdots , j _ { i } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\cdots \\partial _ { j _ { i } } \\psi ( z ) | , i = 2 , 3 ," + }, + { + "category_id": 13, + "poly": [ + 681, + 1549, + 732, + 1549, + 732, + 1583, + 681, + 1583 + ], + "score": 0.9, + "latex": "\\psi ( \\cdot )" + }, + { + "category_id": 14, + "poly": [ + 519, + 1441, + 1196, + 1441, + 1196, + 1535, + 519, + 1535 + ], + "score": 0.9, + "latex": "\\begin{array} { r l } & { | \\mathrm { E } \\psi ( \\mathcal { M } _ { n ( t _ { K } ) } ) - \\mathrm { E } \\psi ( N ( 0 , { \\pmb V } ) ) | } \\\\ { \\preceq } & { c _ { 0 } ( \\psi ) n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) + c _ { 2 } ( \\psi ) q \\delta _ { n ( t _ { 1 } ) } + c _ { 3 } ( \\psi ) q ^ { 3 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1002, + 1775, + 1082, + 1775, + 1082, + 1804, + 1002, + 1804 + ], + "score": 0.9, + "latex": "x \\in \\mathbb { X }" + }, + { + "category_id": 13, + "poly": [ + 1201, + 1694, + 1245, + 1694, + 1245, + 1725, + 1201, + 1725 + ], + "score": 0.9, + "latex": "z ^ { ( j ) }" + }, + { + "category_id": 13, + "poly": [ + 929, + 412, + 997, + 412, + 997, + 438, + 929, + 438 + ], + "score": 0.9, + "latex": "z > 0" + }, + { + "category_id": 13, + "poly": [ + 1105, + 1696, + 1151, + 1696, + 1151, + 1731, + 1105, + 1731 + ], + "score": 0.89, + "latex": "\\mathbf { g } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 1223, + 1812, + 1258, + 1812, + 1258, + 1842, + 1223, + 1842 + ], + "score": 0.89, + "latex": "{ \\mathbb X } _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 814, + 1919, + 848, + 1919, + 848, + 1950, + 814, + 1950 + ], + "score": 0.88, + "latex": "{ \\mathbb X } _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1730, + 313, + 1730, + 313, + 1760, + 298, + 1760 + ], + "score": 0.81, + "latex": "j" + }, + { + "category_id": 13, + "poly": [ + 568, + 1776, + 593, + 1776, + 593, + 1802, + 568, + 1802 + ], + "score": 0.79, + "latex": "\\mathbb { X }" + }, + { + "category_id": 13, + "poly": [ + 473, + 1734, + 489, + 1734, + 489, + 1754, + 473, + 1754 + ], + "score": 0.78, + "latex": "z" + }, + { + "category_id": 13, + "poly": [ + 472, + 1781, + 488, + 1781, + 488, + 1802, + 472, + 1802 + ], + "score": 0.74, + "latex": "\\varepsilon" + }, + { + "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": [ + 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, + 1359.0, + 362.0, + 1359.0, + 362.0, + 1405.0, + 292.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 581.0, + 1359.0, + 1405.0, + 1359.0, + 1405.0, + 1405.0, + 581.0, + 1405.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1392.0, + 1086.0, + 1392.0, + 1086.0, + 1432.0, + 294.0, + 1432.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1768.0, + 341.0, + 1768.0, + 341.0, + 1813.0, + 293.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 398.0, + 1768.0, + 471.0, + 1768.0, + 471.0, + 1813.0, + 398.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 489.0, + 1768.0, + 567.0, + 1768.0, + 567.0, + 1813.0, + 489.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 594.0, + 1768.0, + 1001.0, + 1768.0, + 1001.0, + 1813.0, + 594.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1083.0, + 1768.0, + 1296.0, + 1768.0, + 1296.0, + 1813.0, + 1083.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1768.0, + 1405.0, + 1768.0, + 1405.0, + 1813.0, + 1401.0, + 1813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1805.0, + 404.0, + 1805.0, + 404.0, + 1847.0, + 294.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 576.0, + 1805.0, + 627.0, + 1805.0, + 627.0, + 1847.0, + 576.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 806.0, + 1805.0, + 886.0, + 1805.0, + 886.0, + 1847.0, + 806.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1015.0, + 1805.0, + 1222.0, + 1805.0, + 1222.0, + 1847.0, + 1015.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 1805.0, + 1320.0, + 1805.0, + 1320.0, + 1847.0, + 1259.0, + 1847.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1691.0, + 370.0, + 1691.0, + 370.0, + 1733.0, + 291.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1691.0, + 776.0, + 1691.0, + 776.0, + 1733.0, + 451.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 918.0, + 1691.0, + 1104.0, + 1691.0, + 1104.0, + 1733.0, + 918.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1152.0, + 1691.0, + 1200.0, + 1691.0, + 1200.0, + 1733.0, + 1152.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1246.0, + 1691.0, + 1406.0, + 1691.0, + 1406.0, + 1733.0, + 1246.0, + 1733.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1726.0, + 297.0, + 1726.0, + 297.0, + 1761.0, + 291.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 314.0, + 1726.0, + 472.0, + 1726.0, + 472.0, + 1761.0, + 314.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 490.0, + 1726.0, + 502.0, + 1726.0, + 502.0, + 1761.0, + 490.0, + 1761.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 404.0, + 712.0, + 404.0, + 712.0, + 447.0, + 293.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 833.0, + 404.0, + 928.0, + 404.0, + 928.0, + 447.0, + 833.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 998.0, + 404.0, + 1106.0, + 404.0, + 1106.0, + 447.0, + 998.0, + 447.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1026.0, + 536.0, + 1026.0, + 536.0, + 1062.0, + 296.0, + 1062.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1914.0, + 372.0, + 1914.0, + 372.0, + 1955.0, + 295.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 424.0, + 1914.0, + 813.0, + 1914.0, + 813.0, + 1955.0, + 424.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 1914.0, + 1220.0, + 1914.0, + 1220.0, + 1955.0, + 849.0, + 1955.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1546.0, + 680.0, + 1546.0, + 680.0, + 1586.0, + 295.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1546.0, + 791.0, + 1546.0, + 791.0, + 1586.0, + 733.0, + 1586.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 230.0, + 541.0, + 230.0, + 541.0, + 262.0, + 297.0, + 262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 846.0, + 707.0, + 846.0, + 707.0, + 885.0, + 297.0, + 885.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1199.0, + 328.0, + 1199.0, + 328.0, + 1228.0, + 295.0, + 1228.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 17, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 302, + 1418, + 1403, + 1418, + 1403, + 1526, + 302, + 1526 + ], + "score": 0.974 + }, + { + "category_id": 8, + "poly": [ + 451, + 1165, + 1272, + 1165, + 1272, + 1404, + 451, + 1404 + ], + "score": 0.973 + }, + { + "category_id": 8, + "poly": [ + 435, + 561, + 1290, + 561, + 1290, + 722, + 435, + 722 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 409, + 1863, + 1317, + 1863, + 1317, + 2045, + 409, + 2045 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 511, + 1693, + 1129, + 1693, + 1129, + 1801, + 511, + 1801 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 468, + 1008, + 1175, + 1008, + 1175, + 1105, + 468, + 1105 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 298, + 369, + 1402, + 369, + 1402, + 435, + 298, + 435 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 548, + 275, + 1093, + 275, + 1093, + 352, + 548, + 352 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 424, + 1542, + 1221, + 1542, + 1221, + 1618, + 424, + 1618 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 587, + 452, + 1056, + 452, + 1056, + 497, + 587, + 497 + ], + "score": 0.942 + }, + { + "category_id": 1, + "poly": [ + 294, + 738, + 1407, + 738, + 1407, + 804, + 294, + 804 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 297, + 1816, + 625, + 1816, + 625, + 1848, + 297, + 1848 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 389, + 820, + 1257, + 820, + 1257, + 898, + 389, + 898 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 294, + 1635, + 1393, + 1635, + 1393, + 1676, + 294, + 1676 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 298, + 509, + 716, + 509, + 716, + 543, + 298, + 543 + ], + "score": 0.932 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 458, + 229, + 458, + 262, + 297, + 262 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 295, + 1116, + 830, + 1116, + 830, + 1150, + 295, + 1150 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 297, + 916, + 759, + 916, + 759, + 950, + 297, + 950 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 296, + 964, + 377, + 964, + 377, + 995, + 296, + 995 + ], + "score": 0.917 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1562, + 1400, + 1562, + 1400, + 1594, + 1351, + 1594 + ], + "score": 0.9 + }, + { + "category_id": 9, + "poly": [ + 1351, + 294, + 1401, + 294, + 1401, + 326, + 1351, + 326 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1268, + 1401, + 1268, + 1401, + 1300, + 1350, + 1300 + ], + "score": 0.88 + }, + { + "category_id": 9, + "poly": [ + 1350, + 842, + 1401, + 842, + 1401, + 874, + 1350, + 874 + ], + "score": 0.866 + }, + { + "category_id": 2, + "poly": [ + 836, + 2087, + 866, + 2087, + 866, + 2113, + 836, + 2113 + ], + "score": 0.863 + }, + { + "category_id": 14, + "poly": [ + 447, + 1164, + 1273, + 1164, + 1273, + 1405, + 447, + 1405 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ { \\leq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} + O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) ) . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 513, + 1689, + 1131, + 1689, + 1131, + 1802, + 513, + 1802 + ], + "score": 0.94, + "latex": "\\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) = \\frac { 1 } { \\eta } \\log \\left\\{ \\sum _ { j = 1 } ^ { L } \\exp [ \\eta \\{ d _ { j } ^ { \\top } m - \\eta \\nu _ { k ( j ) } \\} ] \\right\\} ." + }, + { + "category_id": 13, + "poly": [ + 1031, + 1637, + 1265, + 1637, + 1265, + 1676, + 1031, + 1676 + ], + "score": 0.93, + "latex": "\\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } : \\mathbb { R } ^ { q K } \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 511, + 399, + 692, + 399, + 692, + 434, + 511, + 434 + ], + "score": 0.93, + "latex": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 384, + 1637, + 482, + 1637, + 482, + 1674, + 384, + 1674 + ], + "score": 0.93, + "latex": "\\{ \\nu _ { k } \\} _ { k = 1 } ^ { K }" + }, + { + "category_id": 14, + "poly": [ + 468, + 1006, + 1173, + 1006, + 1173, + 1108, + 468, + 1108 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { z _ { k , - } ^ { * } = z _ { k } - \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} - \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , } \\\\ & { z _ { k , + } ^ { * } = z _ { k } + \\bar { c } \\{ q \\delta _ { n ( t _ { k } ) } + \\sqrt { q n ^ { - 1 } ( t _ { k } ) \\log n ( t _ { k } ) } \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 597, + 738, + 790, + 738, + 790, + 774, + 597, + 774 + ], + "score": 0.93, + "latex": "\\mathrm { ~ 1 ~ - ~ } O ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 422, + 1540, + 1220, + 1540, + 1220, + 1618, + 422, + 1618 + ], + "score": 0.92, + "latex": "\\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left\\{ \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\nu _ { k } \\right\\} = \\operatorname* { m a x } _ { 1 \\leq j \\leq L } \\{ d _ { j } ^ { \\top } \\mathcal { M } _ { n ( t _ { K } ) } - \\nu _ { k ( j ) } \\} ," + }, + { + "category_id": 14, + "poly": [ + 547, + 273, + 1096, + 273, + 1096, + 354, + 547, + 354 + ], + "score": 0.92, + "latex": "\\operatorname* { s u p } _ { \\| \\nu \\| _ { 2 } = 1 } | \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\nu - \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) \\nu | \\preceq \\frac { \\sqrt { q } } { n ^ { 4 } ( t _ { 1 } ) } ." + }, + { + "category_id": 14, + "poly": [ + 433, + 558, + 1289, + 558, + 1289, + 724, + 433, + 724 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\left| \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) \\right| } \\\\ { \\leq } & { \\underset { k \\in \\{ 1 , \\cdots , K \\} } { \\operatorname* { m a x } } \\left| \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) \\right| \\preceq \\frac { q \\log n ^ { 1 / 2 } ( t _ { K } ) } { n ^ { 4 } ( t _ { 1 } ) } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 741, + 1492, + 872, + 1492, + 872, + 1525, + 741, + 1525 + ], + "score": 0.92, + "latex": "\\{ 1 , \\ldots , K \\}" + }, + { + "category_id": 13, + "poly": [ + 563, + 1493, + 686, + 1493, + 686, + 1525, + 563, + 1525 + ], + "score": 0.92, + "latex": "\\{ 1 , \\ldots , L \\}" + }, + { + "category_id": 14, + "poly": [ + 408, + 1862, + 1317, + 1862, + 1317, + 2048, + 408, + 2048 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} \\leq \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\leq \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} + \\eta ^ { - 1 } \\log L } \\\\ { \\leq } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } m - \\nu _ { k ( j ) } \\} + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} } \\\\ { = } & { \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } [ d _ { j } ^ { \\top } m - \\{ \\nu _ { k ( j ) } - \\eta ^ { - 1 } \\log K - \\eta ^ { - 1 } 4 d \\log n ( t _ { 1 } ) \\} ] . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 568, + 915, + 749, + 915, + 749, + 952, + 568, + 952 + ], + "score": 0.91, + "latex": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 397, + 1492, + 443, + 1492, + 443, + 1525, + 397, + 1525 + ], + "score": 0.91, + "latex": "k ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 980, + 772, + 1058, + 772, + 1058, + 799, + 980, + 799 + ], + "score": 0.9, + "latex": "\\bar { c } ^ { * } > 0" + }, + { + "category_id": 13, + "poly": [ + 427, + 1419, + 987, + 1419, + 987, + 1459, + 427, + 1459 + ], + "score": 0.9, + "latex": "\\mathcal { M } _ { n ( t _ { K } ) } = \\{ B ^ { * } ( t _ { 1 } ) ^ { \\top } , B ^ { * } ( t _ { 2 } ) ^ { \\top } , \\cdot \\cdot \\cdot , B ^ { * } ( t _ { K } ) ^ { \\top } \\} ^ { \\top }" + }, + { + "category_id": 14, + "poly": [ + 385, + 817, + 1255, + 817, + 1255, + 898, + 385, + 898 + ], + "score": 0.9, + "latex": "\\left. \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) B ^ { \\ast } ( t _ { k } ) - \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\operatorname* { s u p } _ { x \\in \\mathbb { X } _ { 0 } } \\varphi ^ { \\top } ( x ) B ^ { \\ast } ( t _ { k } ) \\right. \\leq { \\vec { c } } ^ { \\ast } n ^ { - 2 } ( t _ { 1 } ) ," + }, + { + "category_id": 13, + "poly": [ + 299, + 771, + 509, + 771, + 509, + 804, + 299, + 804 + ], + "score": 0.9, + "latex": "\\operatorname* { m a x } ( q , \\log n ( t _ { K } ) )" + }, + { + "category_id": 14, + "poly": [ + 585, + 449, + 1058, + 449, + 1058, + 494, + 585, + 494 + ], + "score": 0.9, + "latex": "\\| B ^ { * } ( t _ { k } ) \\| _ { 2 } \\preceq q ^ { 1 / 2 } \\log ^ { 1 / 2 } n ( t _ { k } ) , ~ \\forall k \\geq 1 ." + }, + { + "category_id": 13, + "poly": [ + 543, + 1460, + 797, + 1460, + 797, + 1492, + 543, + 1492 + ], + "score": 0.89, + "latex": "d _ { 1 } , d _ { 2 } , \\dots , d _ { L } \\in \\mathbb { R } ^ { q K }" + }, + { + "category_id": 13, + "poly": [ + 1288, + 738, + 1403, + 738, + 1403, + 775, + 1288, + 775 + ], + "score": 0.88, + "latex": "n ( t _ { 1 } ) ~ \\gg" + }, + { + "category_id": 13, + "poly": [ + 587, + 1640, + 655, + 1640, + 655, + 1672, + 587, + 1672 + ], + "score": 0.82, + "latex": "\\eta > 0" + }, + { + "category_id": 13, + "poly": [ + 865, + 1459, + 1042, + 1459, + 1042, + 1495, + 865, + 1495 + ], + "score": 0.75, + "latex": "L \\leq n ^ { 4 d } ( t _ { 1 } ) K" + }, + { + "category_id": 13, + "poly": [ + 667, + 1637, + 778, + 1637, + 778, + 1669, + 667, + 1669 + ], + "score": 0.73, + "latex": "m \\in \\mathbb { R } ^ { q K }" + }, + { + "category_id": 13, + "poly": [ + 1056, + 1456, + 1329, + 1456, + 1329, + 1496, + 1056, + 1496 + ], + "score": 0.61, + "latex": "\\mathrm { m a x } _ { j } \\| d _ { j } \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }" + }, + { + "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": [ + 832.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2125.0, + 832.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1416.0, + 426.0, + 1416.0, + 426.0, + 1459.0, + 293.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 988.0, + 1416.0, + 1408.0, + 1416.0, + 1408.0, + 1459.0, + 988.0, + 1459.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1447.0, + 542.0, + 1447.0, + 542.0, + 1505.0, + 291.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 798.0, + 1447.0, + 864.0, + 1447.0, + 864.0, + 1505.0, + 798.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1043.0, + 1447.0, + 1055.0, + 1447.0, + 1055.0, + 1505.0, + 1043.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1330.0, + 1447.0, + 1407.0, + 1447.0, + 1407.0, + 1505.0, + 1330.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1486.0, + 396.0, + 1486.0, + 396.0, + 1530.0, + 296.0, + 1530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 444.0, + 1486.0, + 562.0, + 1486.0, + 562.0, + 1530.0, + 444.0, + 1530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 687.0, + 1486.0, + 740.0, + 1486.0, + 740.0, + 1530.0, + 687.0, + 1530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 873.0, + 1486.0, + 988.0, + 1486.0, + 988.0, + 1530.0, + 873.0, + 1530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 367.0, + 1406.0, + 367.0, + 1406.0, + 407.0, + 294.0, + 407.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 397.0, + 510.0, + 397.0, + 510.0, + 436.0, + 292.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 693.0, + 397.0, + 708.0, + 397.0, + 708.0, + 436.0, + 693.0, + 436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 735.0, + 596.0, + 735.0, + 596.0, + 778.0, + 293.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 791.0, + 735.0, + 1287.0, + 735.0, + 1287.0, + 778.0, + 791.0, + 778.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 770.0, + 298.0, + 770.0, + 298.0, + 803.0, + 293.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 510.0, + 770.0, + 979.0, + 770.0, + 979.0, + 803.0, + 510.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 770.0, + 1170.0, + 770.0, + 1170.0, + 803.0, + 1059.0, + 803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1811.0, + 628.0, + 1811.0, + 628.0, + 1856.0, + 294.0, + 1856.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1630.0, + 383.0, + 1630.0, + 383.0, + 1680.0, + 289.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 483.0, + 1630.0, + 586.0, + 1630.0, + 586.0, + 1680.0, + 483.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 656.0, + 1630.0, + 666.0, + 1630.0, + 666.0, + 1680.0, + 656.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 779.0, + 1630.0, + 1030.0, + 1630.0, + 1030.0, + 1680.0, + 779.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1266.0, + 1630.0, + 1402.0, + 1630.0, + 1402.0, + 1680.0, + 1266.0, + 1680.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 507.0, + 716.0, + 507.0, + 716.0, + 547.0, + 296.0, + 547.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 460.0, + 229.0, + 460.0, + 262.0, + 295.0, + 262.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1113.0, + 832.0, + 1113.0, + 832.0, + 1154.0, + 296.0, + 1154.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 913.0, + 567.0, + 913.0, + 567.0, + 956.0, + 296.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 913.0, + 760.0, + 913.0, + 760.0, + 956.0, + 750.0, + 956.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 960.0, + 379.0, + 960.0, + 379.0, + 1001.0, + 294.0, + 1001.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 18, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 419, + 1440, + 1224, + 1440, + 1224, + 1598, + 419, + 1598 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 299, + 1396, + 799, + 1396, + 799, + 1435, + 299, + 1435 + ], + "score": 0.932 + }, + { + "category_id": 8, + "poly": [ + 398, + 623, + 1275, + 623, + 1275, + 1391, + 398, + 1391 + ], + "score": 0.932 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 302, + 1822, + 1399, + 1822, + 1399, + 1885, + 302, + 1885 + ], + "score": 0.926 + }, + { + "category_id": 8, + "poly": [ + 410, + 1968, + 1333, + 1968, + 1333, + 2043, + 410, + 2043 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 296, + 1736, + 458, + 1736, + 458, + 1767, + 296, + 1767 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 296, + 230, + 458, + 230, + 458, + 260, + 296, + 260 + ], + "score": 0.918 + }, + { + "category_id": 8, + "poly": [ + 454, + 1774, + 1186, + 1774, + 1186, + 1816, + 454, + 1816 + ], + "score": 0.91 + }, + { + "category_id": 1, + "poly": [ + 296, + 506, + 371, + 506, + 371, + 536, + 296, + 536 + ], + "score": 0.909 + }, + { + "category_id": 8, + "poly": [ + 411, + 1888, + 1330, + 1888, + 1330, + 1961, + 411, + 1961 + ], + "score": 0.907 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1450, + 1401, + 1450, + 1401, + 1482, + 1350, + 1482 + ], + "score": 0.888 + }, + { + "category_id": 9, + "poly": [ + 1407, + 364, + 1459, + 364, + 1459, + 396, + 1407, + 396 + ], + "score": 0.882 + }, + { + "category_id": 8, + "poly": [ + 368, + 263, + 1355, + 263, + 1355, + 338, + 368, + 338 + ], + "score": 0.873 + }, + { + "category_id": 9, + "poly": [ + 1408, + 284, + 1459, + 284, + 1459, + 317, + 1408, + 317 + ], + "score": 0.862 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 867, + 2087, + 867, + 2114, + 834, + 2114 + ], + "score": 0.861 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1908, + 1401, + 1908, + 1401, + 1939, + 1352, + 1939 + ], + "score": 0.847 + }, + { + "category_id": 1, + "poly": [ + 315, + 586, + 1205, + 586, + 1205, + 619, + 315, + 619 + ], + "score": 0.836 + }, + { + "category_id": 8, + "poly": [ + 575, + 1694, + 1068, + 1694, + 1068, + 1734, + 575, + 1734 + ], + "score": 0.823 + }, + { + "category_id": 8, + "poly": [ + 318, + 345, + 1458, + 345, + 1458, + 500, + 318, + 500 + ], + "score": 0.771 + }, + { + "category_id": 8, + "poly": [ + 447, + 542, + 1198, + 542, + 1198, + 582, + 447, + 582 + ], + "score": 0.766 + }, + { + "category_id": 1, + "poly": [ + 296, + 1617, + 1397, + 1617, + 1397, + 1691, + 296, + 1691 + ], + "score": 0.7 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1988, + 1401, + 1988, + 1401, + 2019, + 1352, + 2019 + ], + "score": 0.499 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1988, + 1401, + 1988, + 1401, + 2020, + 1352, + 2020 + ], + "score": 0.408 + }, + { + "category_id": 8, + "poly": [ + 398, + 627, + 1287, + 627, + 1287, + 1390, + 398, + 1390 + ], + "score": 0.314 + }, + { + "category_id": 1, + "poly": [ + 447, + 542, + 1198, + 542, + 1198, + 582, + 447, + 582 + ], + "score": 0.169 + }, + { + "category_id": 14, + "poly": [ + 403, + 627, + 1280, + 627, + 1280, + 1404, + 403, + 1404 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to - \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\rho \\mathrm { e r f } ( \\phi _ { \\mathrm { c a i r c } } ^ { 2 } - \\phi _ { \\mathrm { c a c i r c } } ^ { 2 } ) , } \\\\ { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to - \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\rho \\mathrm { e r f } ( \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) , } \\\\ { \\partial _ { t } \\phi _ { \\mathrm { c a i r c } } \\Delta \\phi _ { \\mathrm { c a i r c } } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) ) , } \\\\ { \\phantom { = } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a i r c } } ^ { 2 } ) ) , } \\\\ { \\phantom { = } } & { \\to \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\exp ( \\exp ( - \\pi \\phi _ { \\mathrm { c a c c } } ^ { 2 } ) ) ^ { \\frac { 1 } { \\sqrt { 2 } } } , } \\\\ \\frac { \\sqrt { 2 } - \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac { \\alpha ^ { 2 } } { \\sqrt { 2 } } \\frac \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 985, + 546, + 1186, + 546, + 1186, + 583, + 985, + 583 + ], + "score": 0.93, + "latex": "z _ { k , - } ^ { * * } = z _ { k , - } ^ { * } - 3 \\delta" + }, + { + "category_id": 14, + "poly": [ + 410, + 1884, + 1337, + 1884, + 1337, + 2048, + 410, + 2048 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} \\leq \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } \\big ( \\mathcal { M } _ { n ( t _ { K } ) } \\big ) , } \\\\ & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} \\geq \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } \\big ( \\mathcal { M } _ { n ( t _ { K } ) } \\big ) . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 416, + 1439, + 1222, + 1439, + 1222, + 1599, + 416, + 1599 + ], + "score": 0.93, + "latex": "\\begin{array} { r l r } { { \\sum _ { j } | \\partial _ { j } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 } , \\sum _ { j _ { 1 } , j _ { 2 } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le 2 \\eta \\epsilon _ { 0 } ^ { - 2 } q , } } \\\\ & { } & { \\ \\sum _ { j _ { 1 } , j _ { 2 } , j _ { 3 } } | \\partial _ { j _ { 1 } } \\partial _ { j _ { 2 } } \\partial _ { j _ { 3 } } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) | \\le 6 \\eta ^ { 2 } \\epsilon _ { 0 } ^ { - 3 } q ^ { 3 / 2 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 388, + 1821, + 511, + 1821, + 511, + 1852, + 388, + 1852 + ], + "score": 0.92, + "latex": "m \\in \\mathbb { R } ^ { q K }" + }, + { + "category_id": 13, + "poly": [ + 1174, + 1656, + 1263, + 1656, + 1263, + 1686, + 1174, + 1686 + ], + "score": 0.91, + "latex": "K _ { 0 } > 0" + }, + { + "category_id": 14, + "poly": [ + 319, + 262, + 1428, + 262, + 1428, + 503, + 319, + 503 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} \\leq \\operatorname* { P r } \\left\\{ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } ^ { * * } \\left( \\mathcal { M } _ { n ( t _ { K } ) } \\right) \\leq 0 } , \\quad \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\Omega , } } \\\\ & \\right\\{ \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } & { \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\mathrm { ~ } \\Omega ~ } \\\\ { = } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - ( z _ { k , - } ^ { * } - 3 \\delta ) \\right) \\leq 3 \\delta \\right\\} \\geq \\operatorname* { P r } \\left\\{ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } \\left( \\mathcal { M } _ { n ( t _ { K } ) } \\right) \\leq 3 \\delta \\right\\} } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1264, + 1619, + 1405, + 1619, + 1405, + 1654, + 1264, + 1654 + ], + "score": 0.9, + "latex": "\\mathbf { g } _ { \\delta } ( \\cdot ) : \\mathbb { R } \\to" + }, + { + "category_id": 13, + "poly": [ + 894, + 1620, + 961, + 1620, + 961, + 1649, + 894, + 1649 + ], + "score": 0.9, + "latex": "\\delta > 0" + }, + { + "category_id": 13, + "poly": [ + 450, + 541, + 930, + 541, + 930, + 583, + 450, + 583 + ], + "score": 0.89, + "latex": "z _ { k , + } ^ { * * } = z _ { k , + } ^ { * } + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\}" + }, + { + "category_id": 13, + "poly": [ + 763, + 1651, + 965, + 1651, + 965, + 1690, + 763, + 1690 + ], + "score": 0.88, + "latex": "\\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime \\prime } \\| _ { \\infty } \\le K _ { 0 } \\delta ^ { - 3 }" + }, + { + "category_id": 14, + "poly": [ + 454, + 1773, + 1185, + 1773, + 1185, + 1815, + 454, + 1815 + ], + "score": 0.87, + "latex": "\\mathbb { I } ( \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le 0 ) \\le \\mathtt { g o } \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le \\mathbb { I } ( \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( m ) \\le 3 \\delta ) ," + }, + { + "category_id": 13, + "poly": [ + 365, + 1397, + 624, + 1397, + 624, + 1435, + 365, + 1435 + ], + "score": 0.84, + "latex": "\\operatorname* { m a x } _ { i } \\| d _ { i } \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } q ^ { 1 / 2 }" + }, + { + "category_id": 13, + "poly": [ + 573, + 1694, + 1063, + 1694, + 1063, + 1731, + 573, + 1731 + ], + "score": 0.83, + "latex": "\\mathbb { I } ( z _ { 0 } \\leq 0 ) \\leq \\mathbf { g } _ { \\delta } ( z _ { 0 } ) \\leq \\mathbb { I } ( z _ { 0 } \\leq 3 \\delta ) , \\forall \\delta \\in \\mathbb { R } ." + }, + { + "category_id": 13, + "poly": [ + 444, + 588, + 460, + 588, + 460, + 614, + 444, + 614 + ], + "score": 0.81, + "latex": "\\delta" + }, + { + "category_id": 13, + "poly": [ + 297, + 1656, + 320, + 1656, + 320, + 1683, + 297, + 1683 + ], + "score": 0.8, + "latex": "\\mathbb { R }" + }, + { + "category_id": 14, + "poly": [ + 448, + 541, + 932, + 541, + 932, + 583, + 448, + 583 + ], + "score": 0.77, + "latex": "z _ { k , + } ^ { * * } = z _ { k , + } ^ { * } + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\}" + }, + { + "category_id": 13, + "poly": [ + 552, + 1651, + 747, + 1651, + 747, + 1690, + 552, + 1690 + ], + "score": 0.74, + "latex": "\\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime } \\| _ { \\infty } \\le K _ { 0 } \\delta ^ { - 2 }" + }, + { + "category_id": 13, + "poly": [ + 383, + 1652, + 539, + 1652, + 539, + 1690, + 383, + 1690 + ], + "score": 0.72, + "latex": "\\| \\mathbf { g } _ { \\delta } ^ { \\prime } \\| _ { \\infty } \\leq \\delta ^ { - 1 }" + }, + { + "category_id": 13, + "poly": [ + 971, + 1695, + 1060, + 1695, + 1060, + 1728, + 971, + 1728 + ], + "score": 0.31, + "latex": "\\forall \\delta \\in \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 381, + 1651, + 979, + 1651, + 979, + 1692, + 381, + 1692 + ], + "score": 0.27, + "latex": "\\| \\mathbf { g } _ { \\delta } ^ { \\prime } \\| _ { \\infty } \\leq \\delta ^ { - 1 } , \\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime } \\| _ { \\infty } \\leq K _ { 0 } \\delta ^ { - 2 } , \\| \\mathbf { g } _ { \\delta } ^ { \\prime \\prime \\prime } \\| _ { \\infty } \\leq K _ { 0 } \\delta ^ { - 3 } \\mathbf { f }" + }, + { + "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": [ + 830.0, + 2084.0, + 870.0, + 2084.0, + 870.0, + 2122.0, + 830.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1395.0, + 364.0, + 1395.0, + 364.0, + 1437.0, + 294.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 625.0, + 1395.0, + 801.0, + 1395.0, + 801.0, + 1437.0, + 625.0, + 1437.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1815.0, + 387.0, + 1815.0, + 387.0, + 1861.0, + 292.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 1815.0, + 1407.0, + 1815.0, + 1407.0, + 1861.0, + 512.0, + 1861.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1854.0, + 424.0, + 1854.0, + 424.0, + 1887.0, + 296.0, + 1887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1732.0, + 461.0, + 1732.0, + 461.0, + 1770.0, + 292.0, + 1770.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 228.0, + 461.0, + 228.0, + 461.0, + 263.0, + 294.0, + 263.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 501.0, + 375.0, + 501.0, + 375.0, + 540.0, + 294.0, + 540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 309.0, + 584.0, + 443.0, + 584.0, + 443.0, + 622.0, + 309.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 461.0, + 584.0, + 1212.0, + 584.0, + 1212.0, + 622.0, + 461.0, + 622.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1615.0, + 893.0, + 1615.0, + 893.0, + 1655.0, + 295.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 1615.0, + 1263.0, + 1615.0, + 1263.0, + 1655.0, + 962.0, + 1655.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1650.0, + 296.0, + 1650.0, + 296.0, + 1692.0, + 291.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 321.0, + 1650.0, + 380.0, + 1650.0, + 380.0, + 1692.0, + 321.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1650.0, + 1173.0, + 1650.0, + 1173.0, + 1692.0, + 980.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1264.0, + 1650.0, + 1376.0, + 1650.0, + 1376.0, + 1692.0, + 1264.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 788.0, + 1650.0, + 808.0, + 1650.0, + 808.0, + 1663.0, + 788.0, + 1663.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 933.0, + 535.0, + 984.0, + 535.0, + 984.0, + 592.0, + 933.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1187.0, + 543.0, + 1196.0, + 543.0, + 1196.0, + 577.0, + 1187.0, + 577.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1040.0, + 528.5, + 1129.0, + 528.5, + 1129.0, + 591.0, + 1040.0, + 591.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 549.0, + 504.0, + 549.0, + 504.0, + 588.0, + 451.0, + 588.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 19, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 335, + 1209, + 1385, + 1209, + 1385, + 1487, + 335, + 1487 + ], + "score": 0.968 + }, + { + "category_id": 8, + "poly": [ + 475, + 404, + 1201, + 404, + 1201, + 536, + 475, + 536 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 293, + 1785, + 1480, + 1785, + 1480, + 2043, + 293, + 2043 + ], + "score": 0.966 + }, + { + "category_id": 8, + "poly": [ + 351, + 729, + 1374, + 729, + 1374, + 842, + 351, + 842 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 645, + 281, + 998, + 281, + 998, + 340, + 645, + 340 + ], + "score": 0.95 + }, + { + "category_id": 8, + "poly": [ + 443, + 603, + 1197, + 603, + 1197, + 666, + 443, + 666 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 296, + 229, + 941, + 229, + 941, + 266, + 296, + 266 + ], + "score": 0.939 + }, + { + "category_id": 8, + "poly": [ + 301, + 1649, + 1339, + 1649, + 1339, + 1727, + 301, + 1727 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 297, + 356, + 677, + 356, + 677, + 389, + 297, + 389 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 297, + 851, + 901, + 851, + 901, + 885, + 297, + 885 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 296, + 682, + 1115, + 682, + 1115, + 717, + 296, + 717 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 297, + 1740, + 902, + 1740, + 902, + 1774, + 297, + 1774 + ], + "score": 0.918 + }, + { + "category_id": 1, + "poly": [ + 296, + 552, + 825, + 552, + 825, + 588, + 296, + 588 + ], + "score": 0.913 + }, + { + "category_id": 1, + "poly": [ + 297, + 1544, + 1446, + 1544, + 1446, + 1636, + 297, + 1636 + ], + "score": 0.911 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 107, + 296, + 107 + ], + "score": 0.896 + }, + { + "category_id": 9, + "poly": [ + 1351, + 283, + 1401, + 283, + 1401, + 315, + 1351, + 315 + ], + "score": 0.896 + }, + { + "category_id": 1, + "poly": [ + 296, + 1499, + 371, + 1499, + 371, + 1529, + 296, + 1529 + ], + "score": 0.889 + }, + { + "category_id": 8, + "poly": [ + 346, + 897, + 1374, + 897, + 1374, + 1153, + 346, + 1153 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1350, + 454, + 1402, + 454, + 1402, + 487, + 1350, + 487 + ], + "score": 0.887 + }, + { + "category_id": 9, + "poly": [ + 1351, + 921, + 1401, + 921, + 1401, + 952, + 1351, + 952 + ], + "score": 0.852 + }, + { + "category_id": 9, + "poly": [ + 1353, + 1048, + 1401, + 1048, + 1401, + 1079, + 1353, + 1079 + ], + "score": 0.787 + }, + { + "category_id": 1, + "poly": [ + 300, + 1162, + 844, + 1162, + 844, + 1196, + 300, + 1196 + ], + "score": 0.733 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 864, + 2087, + 864, + 2114, + 834, + 2114 + ], + "score": 0.673 + }, + { + "category_id": 8, + "poly": [ + 346, + 897, + 1375, + 897, + 1375, + 1153, + 346, + 1153 + ], + "score": 0.462 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 864, + 2087, + 864, + 2114, + 834, + 2114 + ], + "score": 0.233 + }, + { + "category_id": 14, + "poly": [ + 333, + 1208, + 1383, + 1208, + 1383, + 1488, + 333, + 1488 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { { \\mathrm { E g } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq \\operatorname* { P r } \\left( \\phi _ { \\eta , \\{ z _ { k , + } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq 3 \\delta \\right) } \\\\ { \\leq } & { \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * } \\} \\leq 3 \\delta \\right) = \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , + } ^ { * * * } \\} \\leq 0 \\right) , } \\\\ & { { \\mathrm { E g } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\geq \\operatorname* { P r } \\left( \\phi _ { \\eta , \\{ z _ { k , - } ^ { * * } \\} _ { k } } ( N ( 0 , V ) ) \\leq 0 \\right) } \\\\ { \\geq } & { \\operatorname* { P r } \\left( \\underset { 1 \\leq j \\leq L } { \\operatorname* { m a x } } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - z _ { k ( j ) , - } ^ { * * * } \\} \\leq 0 \\right) , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 345, + 896, + 1377, + 896, + 1377, + 1154, + 345, + 1154 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} - \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , + } ^ { * } \\} _ { k } } ( N ( 0 , V ) ) \\quad ( 3 ) } \\\\ { \\preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) , } \\\\ & { \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ z _ { k , - } ^ { * } \\} _ { k } } ( N ( 0 , V ) ) - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} \\quad ( 3 ) } \\\\ { \\preceq } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 544, + 232, + 693, + 232, + 693, + 267, + 544, + 267 + ], + "score": 0.94, + "latex": "\\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } }" + }, + { + "category_id": 13, + "poly": [ + 340, + 552, + 699, + 552, + 699, + 588, + 340, + 588 + ], + "score": 0.93, + "latex": "\\delta = \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\}" + }, + { + "category_id": 14, + "poly": [ + 342, + 727, + 1376, + 727, + 1376, + 844, + 342, + 844 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } \\vert \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( \\mathcal { M } _ { n ( t _ { K } ) } ) - \\mathrm { E g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , V ) ) \\vert } \\\\ { \\overset { \\mathrm { } } { \\to } } & { n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } N + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } N + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 641, + 1602, + 710, + 1602, + 710, + 1636, + 641, + 1636 + ], + "score": 0.92, + "latex": "\\{ \\nu _ { k } \\} _ { k }" + }, + { + "category_id": 14, + "poly": [ + 642, + 280, + 1000, + 280, + 1000, + 341, + 642, + 341 + ], + "score": 0.92, + "latex": "\\operatorname* { s u p } _ { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } c _ { 0 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\leq 1 ." + }, + { + "category_id": 14, + "poly": [ + 310, + 1786, + 1428, + 1786, + 1428, + 2047, + 310, + 2047 + ], + "score": 0.92, + "latex": "\\begin{array} { r l r } & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , + } ^ { * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\preceq \\ 3 n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) \\delta _ { n ( t _ { 1 } ) } } \\\\ & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { R } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ^ { * } ( t _ { k } ) - z _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\preceq \\lambda n ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 474, + 402, + 1202, + 402, + 1202, + 538, + 474, + 538 + ], + "score": 0.91, + "latex": "\\begin{array} { r l r } & { } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } c _ { 2 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq \\delta ^ { - 2 } q + \\delta ^ { - 1 } \\eta q , } \\\\ & { } & { \\underset { \\delta , \\eta , \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } c _ { 3 } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq \\delta ^ { - 3 } q ^ { 3 / 2 } + \\delta ^ { - 2 } \\eta q ^ { 3 / 2 } + \\delta ^ { - 1 } \\eta ^ { 2 } q ^ { 3 / 2 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 301, + 1648, + 1339, + 1648, + 1339, + 1726, + 301, + 1726 + ], + "score": 0.91, + "latex": "\\operatorname* { P r } \\left\\{ \\operatorname* { m a x } _ { k \\in \\{ 1 , \\ldots , K \\} } \\left( \\operatorname* { s u p } _ { x \\in \\Xi _ { 0 } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k } \\right) \\leq 0 \\right\\} = \\operatorname* { P r } \\left( \\operatorname* { m a x } _ { 1 \\leq j \\leq L } \\{ d _ { j } ^ { \\top } N ( 0 , V ) - \\nu _ { k ( j ) } \\} \\leq 0 \\right) ." + }, + { + "category_id": 14, + "poly": [ + 444, + 601, + 1200, + 601, + 1200, + 669, + 444, + 669 + ], + "score": 0.89, + "latex": "\\operatorname* { s u p } _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } c _ { i } ( \\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ) \\preceq q ^ { i / 2 } \\eta ^ { i } \\{ \\log ^ { i } K + \\log ^ { i } n ( t _ { 1 } ) \\} , i = 2 , 3 ." + }, + { + "category_id": 13, + "poly": [ + 890, + 1546, + 1435, + 1546, + 1435, + 1586, + 890, + 1586 + ], + "score": 0.87, + "latex": "z _ { k , - } ^ { * * * } = z _ { k , - } ^ { * } - \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} - 3 \\delta" + }, + { + "category_id": 13, + "poly": [ + 394, + 1604, + 412, + 1604, + 412, + 1630, + 394, + 1630 + ], + "score": 0.79, + "latex": "k" + }, + { + "category_id": 14, + "poly": [ + 294, + 1543, + 840, + 1543, + 840, + 1587, + 294, + 1587 + ], + "score": 0.65, + "latex": "z _ { k , + } ^ { * * * } = z _ { k , + } ^ { * } + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} + 3 \\delta" + }, + { + "category_id": 14, + "poly": [ + 347, + 1543, + 1444, + 1543, + 1444, + 1587, + 347, + 1587 + ], + "score": 0.28, + "latex": "= z _ { k , + } ^ { * } + \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} + 3 \\delta \\mathrm { ~ a n d ~ } z _ { k , - } ^ { * * * } = z _ { k , - } ^ { * } - \\eta ^ { - 1 } \\{ \\log K + 4 d \\log n ( t _ { 1 } ) \\} - 3 \\delta ," + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 109.0, + 297.0, + 109.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": [ + 295.0, + 223.0, + 543.0, + 223.0, + 543.0, + 272.0, + 295.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 694.0, + 223.0, + 942.0, + 223.0, + 942.0, + 272.0, + 694.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 355.0, + 680.0, + 355.0, + 680.0, + 390.0, + 294.0, + 390.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 849.0, + 899.0, + 849.0, + 899.0, + 889.0, + 296.0, + 889.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 678.0, + 1114.0, + 678.0, + 1114.0, + 724.0, + 294.0, + 724.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1736.0, + 901.0, + 1736.0, + 901.0, + 1780.0, + 294.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 549.0, + 339.0, + 549.0, + 339.0, + 592.0, + 295.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 549.0, + 825.0, + 549.0, + 825.0, + 592.0, + 700.0, + 592.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 285.0, + 1534.0, + 293.0, + 1534.0, + 293.0, + 1594.0, + 285.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1445.0, + 1534.0, + 1450.0, + 1534.0, + 1450.0, + 1594.0, + 1445.0, + 1594.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1600.0, + 393.0, + 1600.0, + 393.0, + 1638.0, + 295.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 413.0, + 1600.0, + 640.0, + 1600.0, + 640.0, + 1638.0, + 413.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 711.0, + 1600.0, + 821.0, + 1600.0, + 821.0, + 1638.0, + 711.0, + 1638.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1494.0, + 375.0, + 1494.0, + 375.0, + 1533.0, + 294.0, + 1533.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1159.0, + 846.0, + 1159.0, + 846.0, + 1202.0, + 295.0, + 1202.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 20, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 295, + 1543, + 1405, + 1543, + 1405, + 1751, + 295, + 1751 + ], + "score": 0.979 + }, + { + "category_id": 1, + "poly": [ + 296, + 1365, + 1405, + 1365, + 1405, + 1533, + 296, + 1533 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 295, + 543, + 1412, + 543, + 1412, + 645, + 295, + 645 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 320, + 832, + 1604, + 832, + 1604, + 961, + 320, + 961 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 293, + 274, + 1432, + 274, + 1432, + 531, + 293, + 531 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 318, + 1014, + 1599, + 1014, + 1599, + 1190, + 318, + 1190 + ], + "score": 0.964 + }, + { + "category_id": 8, + "poly": [ + 499, + 659, + 1144, + 659, + 1144, + 774, + 499, + 774 + ], + "score": 0.959 + }, + { + "category_id": 1, + "poly": [ + 299, + 1203, + 1402, + 1203, + 1402, + 1274, + 299, + 1274 + ], + "score": 0.951 + }, + { + "category_id": 1, + "poly": [ + 295, + 786, + 977, + 786, + 977, + 820, + 295, + 820 + ], + "score": 0.929 + }, + { + "category_id": 0, + "poly": [ + 298, + 1784, + 611, + 1784, + 611, + 1816, + 298, + 1816 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 785, + 229, + 785, + 263, + 297, + 263 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 298, + 1842, + 462, + 1842, + 462, + 1873, + 298, + 1873 + ], + "score": 0.925 + }, + { + "category_id": 8, + "poly": [ + 686, + 1986, + 958, + 1986, + 958, + 2042, + 686, + 2042 + ], + "score": 0.924 + }, + { + "category_id": 8, + "poly": [ + 488, + 1885, + 1155, + 1885, + 1155, + 1931, + 488, + 1931 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 298, + 1309, + 611, + 1309, + 611, + 1341, + 298, + 1341 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 297, + 972, + 481, + 972, + 481, + 1004, + 297, + 1004 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.903 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1892, + 1401, + 1892, + 1401, + 1924, + 1351, + 1924 + ], + "score": 0.897 + }, + { + "category_id": 1, + "poly": [ + 297, + 1944, + 344, + 1944, + 344, + 1973, + 297, + 1973 + ], + "score": 0.897 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1992, + 1401, + 1992, + 1401, + 2023, + 1351, + 2023 + ], + "score": 0.888 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.846 + }, + { + "category_id": 14, + "poly": [ + 499, + 655, + 1145, + 655, + 1145, + 775, + 499, + 775 + ], + "score": 0.94, + "latex": "c _ { * } \\leq \\varphi ^ { \\top } ( x ) \\left( \\sum _ { a \\in \\{ 0 , 1 \\} } \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } \\right) ^ { 1 / 2 } \\varphi ( x ) , \\forall x \\in \\mathbb { X } _ { 0 } ." + }, + { + "category_id": 13, + "poly": [ + 819, + 544, + 1067, + 544, + 1067, + 586, + 819, + 586 + ], + "score": 0.94, + "latex": "\\begin{array} { r } { \\sum _ { a \\in \\{ 0 , 1 \\} } \\sum _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - 1 } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 686, + 1987, + 955, + 1987, + 955, + 2042, + 686, + 2042 + ], + "score": 0.93, + "latex": "\\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } ," + }, + { + "category_id": 14, + "poly": [ + 310, + 272, + 1427, + 272, + 1427, + 532, + 310, + 532 + ], + "score": 0.92, + "latex": "\\begin{array} { r l r } & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} - \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\qquad \\preceq \\lambda \\mathrm { \\Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) , } \\\\ & { } & { \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} - \\mathrm { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\dots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } } { \\operatorname* { m p } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} } \\\\ & { } & { \\qquad \\preceq \\lambda \\mathrm { \\Lambda } ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 563, + 582, + 822, + 582, + 822, + 616, + 563, + 616 + ], + "score": 0.92, + "latex": "\\| \\varphi ( x ) \\| _ { 2 } \\geq \\bar { c } , \\forall x \\in \\mathbb { X } _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 550, + 545, + 688, + 545, + 688, + 579, + 550, + 579 + ], + "score": 0.92, + "latex": "\\operatorname { C o v } ( G ( t _ { k } ) )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1497, + 594, + 1497, + 594, + 1535, + 298, + 1535 + ], + "score": 0.92, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp F _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 1030, + 1467, + 1103, + 1467, + 1103, + 1500, + 1030, + 1500 + ], + "score": 0.91, + "latex": "Y _ { 1 } ^ { * } ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 658, + 1547, + 979, + 1547, + 979, + 1586, + 658, + 1586 + ], + "score": 0.9, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ \\bot ~ \\mathcal { F } _ { k }" + }, + { + "category_id": 13, + "poly": [ + 934, + 1619, + 1029, + 1619, + 1029, + 1652, + 934, + 1652 + ], + "score": 0.9, + "latex": "Y _ { k + 1 } ^ { * } ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 297, + 615, + 376, + 615, + 376, + 644, + 297, + 644 + ], + "score": 0.9, + "latex": "c _ { * } > 0" + }, + { + "category_id": 13, + "poly": [ + 1109, + 1548, + 1260, + 1548, + 1260, + 1580, + 1109, + 1580 + ], + "score": 0.9, + "latex": "k \\ < \\ j \\ - \\ 1" + }, + { + "category_id": 13, + "poly": [ + 662, + 1369, + 734, + 1369, + 734, + 1398, + 662, + 1398 + ], + "score": 0.89, + "latex": "j = 1" + }, + { + "category_id": 13, + "poly": [ + 1050, + 1369, + 1123, + 1369, + 1123, + 1398, + 1050, + 1398 + ], + "score": 0.89, + "latex": "j \\geq 2" + }, + { + "category_id": 13, + "poly": [ + 299, + 1651, + 596, + 1651, + 596, + 1687, + 299, + 1687 + ], + "score": 0.89, + "latex": "( X _ { k + 1 } , Y _ { k + 1 } ^ { * } ( 0 ) , Y _ { k + 1 } ^ { * } ( 1 ) )" + }, + { + "category_id": 14, + "poly": [ + 488, + 1884, + 1153, + 1884, + 1153, + 1928, + 488, + 1928 + ], + "score": 0.88, + "latex": "\\epsilon _ { 0 } \\le \\lambda _ { \\operatorname* { m i n } } [ \\mathsf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\le \\lambda _ { \\operatorname* { m a x } } [ \\mathsf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\le \\epsilon _ { 0 } ^ { - 1 } ," + }, + { + "category_id": 13, + "poly": [ + 298, + 1581, + 642, + 1581, + 642, + 1619, + 298, + 1619 + ], + "score": 0.88, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\ \\perp \\ \\mathcal { F } _ { k + 1 } ," + }, + { + "category_id": 13, + "poly": [ + 415, + 1619, + 477, + 1619, + 477, + 1650, + 415, + 1650 + ], + "score": 0.88, + "latex": "Y _ { k + 1 }" + }, + { + "category_id": 13, + "poly": [ + 815, + 1397, + 1035, + 1397, + 1035, + 1433, + 815, + 1433 + ], + "score": 0.87, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) )" + }, + { + "category_id": 13, + "poly": [ + 438, + 1433, + 735, + 1433, + 735, + 1470, + 438, + 1470 + ], + "score": 0.87, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp { \\cal A } _ { 1 }" + }, + { + "category_id": 14, + "poly": [ + 384, + 831, + 1502, + 831, + 1502, + 965, + 384, + 965 + ], + "score": 0.86, + "latex": "\\begin{array} { r l } & { \\operatorname* { p } _ { \\mathrm { { r } } } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , + } ^ { * * * } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k , - } ^ { * * * } \\right) \\leq 0 \\right\\} } \\\\ & { \\ l ^ { - 1 } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 3 / 2 } + q \\delta _ { n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 1 / 2 } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 860, + 1432, + 1394, + 1432, + 1394, + 1467, + 860, + 1467 + ], + "score": 0.85, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp ( X _ { 1 } , A _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )" + }, + { + "category_id": 13, + "poly": [ + 424, + 1468, + 456, + 1468, + 456, + 1497, + 424, + 1497 + ], + "score": 0.85, + "latex": "Y _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 394, + 1397, + 735, + 1397, + 735, + 1433, + 394, + 1433 + ], + "score": 0.84, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , \\overset { \\cdot } { Y _ { j } ^ { * } } ( 1 ) ) \\overset { } { \\bot } \\overset { } { A _ { 1 } } | X _ { 1 }" + }, + { + "category_id": 14, + "poly": [ + 385, + 1014, + 1502, + 1014, + 1502, + 1191, + 385, + 1191 + ], + "score": 0.83, + "latex": "\\begin{array} { r l } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathfrak { X } } { \\operatorname* { m a x } } \\varphi ^ { \\top } ( x ) B ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} - \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathfrak { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - z _ { k } \\right) \\leq 0 \\right\\} \\bigg | } \\\\ & { \\ i ^ { - 1 / 2 } ( t _ { 1 } ) q ^ { 3 } \\eta ^ { 3 } \\{ \\log ^ { 3 } K + \\log ^ { 3 } n ( t _ { 1 } ) \\} + q ^ { 2 } \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\delta _ { n ( t _ { 1 } ) } + n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) } \\\\ & { \\ j ^ { - 1 } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 3 / 2 } + q \\delta _ { n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} ^ { 1 / 2 } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\{ \\log K + \\log n ( t _ { 1 } ) \\} } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 886, + 1467, + 961, + 1467, + 961, + 1500, + 886, + 1500 + ], + "score": 0.83, + "latex": "Y _ { 1 } ^ { * } ( \\bar { 0 } )" + }, + { + "category_id": 13, + "poly": [ + 1135, + 1617, + 1381, + 1617, + 1381, + 1655, + 1135, + 1655 + ], + "score": 0.83, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ ." + }, + { + "category_id": 13, + "poly": [ + 857, + 1687, + 1239, + 1687, + 1239, + 1724, + 857, + 1724 + ], + "score": 0.83, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp \\perp X _ { k + 1 } , \\mathcal { F } _ { k }" + }, + { + "category_id": 13, + "poly": [ + 382, + 1204, + 1328, + 1204, + 1328, + 1245, + 382, + 1245 + ], + "score": 0.81, + "latex": "\\eta = \\operatorname* { m i n } ( q ^ { - 3 / 4 } n ^ { 1 / 8 } ( t _ { 1 } ) \\log ^ { - 3 / 8 } \\{ K n ( t _ { 1 } ) \\} , q ^ { - 1 } n ^ { - \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { - \\alpha _ { 0 } / 3 - 1 / 6 } \\{ K n ( t _ { 1 } ) \\} )" + }, + { + "category_id": 13, + "poly": [ + 832, + 1651, + 1167, + 1651, + 1167, + 1687, + 832, + 1687 + ], + "score": 0.79, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\ \\perp \\ A _ { k + 1 }" + }, + { + "category_id": 13, + "poly": [ + 828, + 1467, + 864, + 1467, + 864, + 1498, + 828, + 1498 + ], + "score": 0.78, + "latex": "A _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 776, + 1616, + 873, + 1616, + 873, + 1653, + 776, + 1653 + ], + "score": 0.78, + "latex": "Y _ { k + 1 } ^ { * } ( 0 )" + }, + { + "category_id": 13, + "poly": [ + 693, + 1617, + 758, + 1617, + 758, + 1651, + 693, + 1651 + ], + "score": 0.78, + "latex": "A _ { k + 1 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 1687, + 750, + 1687, + 750, + 1723, + 297, + 1723 + ], + "score": 0.77, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp A _ { k + 1 } | X _ { k + 1 } , \\mathcal { F } _ { k }" + }, + { + "category_id": 13, + "poly": [ + 1162, + 1582, + 1393, + 1582, + 1393, + 1616, + 1162, + 1616 + ], + "score": 0.76, + "latex": "( X _ { k + 1 } , A _ { k + 1 } , Y _ { k + 1 } )" + }, + { + "category_id": 13, + "poly": [ + 883, + 1582, + 1128, + 1582, + 1128, + 1619, + 883, + 1619 + ], + "score": 0.61, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) ~ ." + }, + { + "category_id": 13, + "poly": [ + 1075, + 1397, + 1299, + 1397, + 1299, + 1431, + 1075, + 1431 + ], + "score": 0.59, + "latex": "( X _ { 1 } , \\bar { Y _ { 1 } ^ { * } } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )" + }, + { + "category_id": 13, + "poly": [ + 1101, + 1652, + 1166, + 1652, + 1166, + 1684, + 1101, + 1684 + ], + "score": 0.44, + "latex": "A _ { k + 1 }" + }, + { + "category_id": 13, + "poly": [ + 1124, + 1686, + 1238, + 1686, + 1238, + 1720, + 1124, + 1720 + ], + "score": 0.39, + "latex": "X _ { k + 1 } , \\mathcal { F } _ { k }" + }, + { + "category_id": 13, + "poly": [ + 567, + 1685, + 749, + 1685, + 749, + 1720, + 567, + 1720 + ], + "score": 0.39, + "latex": "A _ { k + 1 } | X _ { k + 1 } , \\mathcal F _ { k }" + }, + { + "category_id": 13, + "poly": [ + 814, + 1398, + 1301, + 1398, + 1301, + 1432, + 814, + 1432 + ], + "score": 0.35, + "latex": "( X _ { j } , Y _ { j } ^ { * } ( 0 ) , Y _ { j } ^ { * } ( 1 ) ) \\perp ( X _ { 1 } , Y _ { 1 } ^ { * } ( 0 ) , Y _ { 1 } ^ { * } ( 1 ) )" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1781.0, + 613.0, + 1781.0, + 613.0, + 1820.0, + 294.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1306.0, + 614.0, + 1306.0, + 614.0, + 1346.0, + 294.0, + 1346.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": [ + 829.0, + 2084.0, + 871.0, + 2084.0, + 871.0, + 2126.0, + 829.0, + 2126.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1544.0, + 657.0, + 1544.0, + 657.0, + 1584.0, + 294.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 980.0, + 1544.0, + 1108.0, + 1544.0, + 1108.0, + 1584.0, + 980.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1261.0, + 1544.0, + 1405.0, + 1544.0, + 1405.0, + 1584.0, + 1261.0, + 1584.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 643.0, + 1577.0, + 882.0, + 1577.0, + 882.0, + 1618.0, + 643.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1129.0, + 1577.0, + 1161.0, + 1577.0, + 1161.0, + 1618.0, + 1129.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 1577.0, + 1405.0, + 1577.0, + 1405.0, + 1618.0, + 1394.0, + 1618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1611.0, + 414.0, + 1611.0, + 414.0, + 1657.0, + 290.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 478.0, + 1611.0, + 692.0, + 1611.0, + 692.0, + 1657.0, + 478.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 759.0, + 1611.0, + 775.0, + 1611.0, + 775.0, + 1657.0, + 759.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 874.0, + 1611.0, + 933.0, + 1611.0, + 933.0, + 1657.0, + 874.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1030.0, + 1611.0, + 1134.0, + 1611.0, + 1134.0, + 1657.0, + 1030.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1382.0, + 1611.0, + 1407.0, + 1611.0, + 1407.0, + 1657.0, + 1382.0, + 1657.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1647.0, + 298.0, + 1647.0, + 298.0, + 1692.0, + 293.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 597.0, + 1647.0, + 831.0, + 1647.0, + 831.0, + 1692.0, + 597.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1168.0, + 1647.0, + 1407.0, + 1647.0, + 1407.0, + 1692.0, + 1168.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1681.0, + 296.0, + 1681.0, + 296.0, + 1725.0, + 293.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 751.0, + 1681.0, + 856.0, + 1681.0, + 856.0, + 1725.0, + 751.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1240.0, + 1681.0, + 1408.0, + 1681.0, + 1408.0, + 1725.0, + 1240.0, + 1725.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1716.0, + 498.0, + 1716.0, + 498.0, + 1750.0, + 294.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1364.0, + 661.0, + 1364.0, + 661.0, + 1404.0, + 294.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 735.0, + 1364.0, + 1049.0, + 1364.0, + 1049.0, + 1404.0, + 735.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1124.0, + 1364.0, + 1405.0, + 1364.0, + 1405.0, + 1404.0, + 1124.0, + 1404.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1395.0, + 393.0, + 1395.0, + 393.0, + 1436.0, + 293.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 1395.0, + 813.0, + 1395.0, + 813.0, + 1436.0, + 736.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1302.0, + 1395.0, + 1407.0, + 1395.0, + 1407.0, + 1436.0, + 1302.0, + 1436.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1429.0, + 437.0, + 1429.0, + 437.0, + 1469.0, + 293.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 736.0, + 1429.0, + 859.0, + 1429.0, + 859.0, + 1469.0, + 736.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 1429.0, + 1406.0, + 1429.0, + 1406.0, + 1469.0, + 1395.0, + 1469.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1463.0, + 423.0, + 1463.0, + 423.0, + 1504.0, + 293.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 457.0, + 1463.0, + 827.0, + 1463.0, + 827.0, + 1504.0, + 457.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 865.0, + 1463.0, + 885.0, + 1463.0, + 885.0, + 1504.0, + 865.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 1463.0, + 1029.0, + 1463.0, + 1029.0, + 1504.0, + 962.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1104.0, + 1463.0, + 1407.0, + 1463.0, + 1407.0, + 1504.0, + 1104.0, + 1504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 595.0, + 1494.0, + 609.0, + 1494.0, + 609.0, + 1536.0, + 595.0, + 1536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 537.0, + 549.0, + 537.0, + 549.0, + 593.0, + 289.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 537.0, + 818.0, + 537.0, + 818.0, + 593.0, + 689.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1068.0, + 537.0, + 1411.0, + 537.0, + 1411.0, + 593.0, + 1068.0, + 593.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 580.0, + 562.0, + 580.0, + 562.0, + 619.0, + 292.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 823.0, + 580.0, + 1407.0, + 580.0, + 1407.0, + 619.0, + 823.0, + 619.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 613.0, + 296.0, + 613.0, + 296.0, + 644.0, + 292.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 377.0, + 613.0, + 488.0, + 613.0, + 488.0, + 644.0, + 377.0, + 644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 1196.0, + 381.0, + 1196.0, + 381.0, + 1252.0, + 289.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1329.0, + 1196.0, + 1409.0, + 1196.0, + 1409.0, + 1252.0, + 1329.0, + 1252.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1239.0, + 856.0, + 1239.0, + 856.0, + 1276.0, + 295.0, + 1276.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 784.0, + 977.0, + 784.0, + 977.0, + 823.0, + 294.0, + 823.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 228.0, + 786.0, + 228.0, + 786.0, + 265.0, + 296.0, + 265.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1839.0, + 464.0, + 1839.0, + 464.0, + 1875.0, + 295.0, + 1875.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 970.0, + 483.0, + 970.0, + 483.0, + 1007.0, + 295.0, + 1007.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1942.0, + 345.0, + 1942.0, + 345.0, + 1974.0, + 292.0, + 1974.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 21, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 296, + 1809, + 1405, + 1809, + 1405, + 1937, + 296, + 1937 + ], + "score": 0.974 + }, + { + "category_id": 8, + "poly": [ + 362, + 1163, + 1279, + 1163, + 1279, + 1355, + 362, + 1355 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 296, + 1606, + 1405, + 1606, + 1405, + 1702, + 296, + 1702 + ], + "score": 0.971 + }, + { + "category_id": 1, + "poly": [ + 296, + 227, + 1404, + 227, + 1404, + 337, + 296, + 337 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 671, + 1951, + 973, + 1951, + 973, + 2045, + 671, + 2045 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 296, + 1410, + 1459, + 1410, + 1459, + 1550, + 296, + 1550 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 597, + 624, + 1044, + 624, + 1044, + 688, + 597, + 688 + ], + "score": 0.952 + }, + { + "category_id": 1, + "poly": [ + 300, + 547, + 1399, + 547, + 1399, + 612, + 300, + 612 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 569, + 742, + 1073, + 742, + 1073, + 805, + 569, + 805 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 297, + 393, + 1404, + 393, + 1404, + 534, + 297, + 534 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 299, + 698, + 859, + 698, + 859, + 732, + 299, + 732 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 299, + 942, + 637, + 942, + 637, + 975, + 299, + 975 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 296, + 1122, + 426, + 1122, + 426, + 1152, + 296, + 1152 + ], + "score": 0.922 + }, + { + "category_id": 0, + "poly": [ + 298, + 1067, + 679, + 1067, + 679, + 1099, + 298, + 1099 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 297, + 1365, + 552, + 1365, + 552, + 1397, + 297, + 1397 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 299, + 1559, + 724, + 1559, + 724, + 1594, + 299, + 1594 + ], + "score": 0.915 + }, + { + "category_id": 0, + "poly": [ + 298, + 1010, + 611, + 1010, + 611, + 1042, + 298, + 1042 + ], + "score": 0.91 + }, + { + "category_id": 2, + "poly": [ + 297, + 73, + 855, + 73, + 855, + 106, + 297, + 106 + ], + "score": 0.903 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1719, + 1400, + 1719, + 1400, + 1749, + 1351, + 1749 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.878 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1193, + 1402, + 1193, + 1402, + 1224, + 1350, + 1224 + ], + "score": 0.873 + }, + { + "category_id": 8, + "poly": [ + 507, + 1713, + 1218, + 1713, + 1218, + 1799, + 507, + 1799 + ], + "score": 0.757 + }, + { + "category_id": 1, + "poly": [ + 294, + 346, + 1400, + 346, + 1400, + 383, + 294, + 383 + ], + "score": 0.745 + }, + { + "category_id": 8, + "poly": [ + 305, + 865, + 1356, + 865, + 1356, + 930, + 305, + 930 + ], + "score": 0.704 + }, + { + "category_id": 1, + "poly": [ + 293, + 820, + 1386, + 820, + 1386, + 859, + 293, + 859 + ], + "score": 0.56 + }, + { + "category_id": 8, + "poly": [ + 507, + 1713, + 1218, + 1713, + 1218, + 1799, + 507, + 1799 + ], + "score": 0.355 + }, + { + "category_id": 14, + "poly": [ + 667, + 1948, + 974, + 1948, + 974, + 2044, + 667, + 2044 + ], + "score": 0.94, + "latex": "\\left\\| \\sum _ { i = 1 } ^ { j } M _ { i } \\right\\| _ { 2 } \\preceq \\sqrt { q j \\log ( j ) } ." + }, + { + "category_id": 14, + "poly": [ + 363, + 1159, + 1282, + 1159, + 1282, + 1359, + 363, + 1359 + ], + "score": 0.93, + "latex": "\\begin{array} { r } { \\| j ( \\widehat { \\Sigma } _ { 1 , j } - \\Sigma _ { 1 } ) \\| _ { 2 } = \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { j } \\{ A _ { i } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( 1 , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } } \\\\ { + j \\left\\| \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\left( \\displaystyle \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right) \\right\\| _ { 2 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 565, + 740, + 1076, + 740, + 1076, + 808, + 565, + 808 + ], + "score": 0.93, + "latex": "\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\mathrm { E } | Y ^ { * } ( a ) | ^ { 2 } \\mathrm { E } | \\nu ^ { \\top } \\varphi ( X ) | ^ { 2 } = O ( 1 ) ." + }, + { + "category_id": 13, + "poly": [ + 802, + 549, + 909, + 549, + 909, + 583, + 802, + 583 + ], + "score": 0.93, + "latex": "\\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ]" + }, + { + "category_id": 13, + "poly": [ + 1311, + 428, + 1400, + 428, + 1400, + 463, + 1311, + 463 + ], + "score": 0.93, + "latex": "\\left| Y ^ { * } ( a ) \\right|" + }, + { + "category_id": 14, + "poly": [ + 595, + 622, + 1047, + 622, + 1047, + 688, + 595, + 688 + ], + "score": 0.92, + "latex": "\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } | \\mathrm { E } \\nu ^ { \\top } \\varphi ( X ) Y ^ { \\ast } ( a ) | = O ( 1 ) ." + }, + { + "category_id": 13, + "poly": [ + 609, + 1638, + 712, + 1638, + 712, + 1671, + 609, + 1671 + ], + "score": 0.92, + "latex": "\\{ M _ { i } \\} _ { i \\geq 1 }" + }, + { + "category_id": 13, + "poly": [ + 998, + 820, + 1333, + 820, + 1333, + 858, + 998, + 858 + ], + "score": 0.92, + "latex": "\\lambda _ { \\operatorname* { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] = O ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 1046, + 348, + 1211, + 348, + 1211, + 382, + 1046, + 382 + ], + "score": 0.92, + "latex": "\\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\geq \\epsilon _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 366, + 823, + 549, + 823, + 549, + 857, + 366, + 857 + ], + "score": 0.92, + "latex": "| Y ^ { * } ( a ) | = O ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 755, + 427, + 1108, + 427, + 1108, + 463, + 755, + 463 + ], + "score": 0.92, + "latex": "\\varphi ^ { \\top } ( x ) \\beta _ { a } = \\operatorname { E } \\{ Y ^ { * } ( a ) | X = x \\}" + }, + { + "category_id": 13, + "poly": [ + 401, + 1668, + 608, + 1668, + 608, + 1702, + 401, + 1702 + ], + "score": 0.92, + "latex": "\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 2 \\}" + }, + { + "category_id": 13, + "poly": [ + 1087, + 227, + 1394, + 227, + 1394, + 264, + 1087, + 264 + ], + "score": 0.92, + "latex": "\\lambda _ { \\mathrm { m i n } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\ \\asymp \\ 1" + }, + { + "category_id": 13, + "poly": [ + 371, + 394, + 459, + 394, + 459, + 429, + 371, + 429 + ], + "score": 0.92, + "latex": "\\lvert Y ^ { * } ( 0 ) \\rvert" + }, + { + "category_id": 13, + "poly": [ + 1088, + 396, + 1249, + 396, + 1249, + 427, + 1088, + 427 + ], + "score": 0.92, + "latex": "0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1" + }, + { + "category_id": 14, + "poly": [ + 310, + 1408, + 1428, + 1408, + 1428, + 1554, + 310, + 1554 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\left| { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\left( \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right) \\right| \\Big | _ { 2 } \\leq \\varepsilon _ { 0 } ^ { - 2 } q { \\mathrm { E } } ^ { \\mathcal { F } _ { i - 1 } } \\left| \\frac { 1 } { j } \\displaystyle \\sum _ { i = 1 } ^ { j } \\pi _ { i - 1 } ( 1 , X ) - \\pi ^ { * } ( 1 , X ) \\right| } \\\\ { \\leq \\varepsilon _ { 0 } ^ { - 2 } q ^ { 2 } j ^ { - \\alpha _ { 0 } } \\log ^ { \\alpha _ { 0 } } j , \\forall j \\geq . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 568, + 1559, + 716, + 1559, + 716, + 1595, + 568, + 1595 + ], + "score": 0.91, + "latex": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 713, + 1904, + 847, + 1904, + 847, + 1937, + 713, + 1937 + ], + "score": 0.91, + "latex": "1 - O ( j ^ { - 2 } )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1637, + 447, + 1637, + 447, + 1670, + 298, + 1670 + ], + "score": 0.91, + "latex": "\\pi _ { i - 1 } ( 1 , X _ { i } ) \\}" + }, + { + "category_id": 13, + "poly": [ + 679, + 463, + 830, + 463, + 830, + 495, + 679, + 495 + ], + "score": 0.91, + "latex": "\\operatorname { E } \\{ Y ^ { * } ( a ) | X \\}" + }, + { + "category_id": 13, + "poly": [ + 1095, + 1605, + 1405, + 1605, + 1405, + 1641, + 1095, + 1641 + ], + "score": 0.91, + "latex": "M _ { i } = \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ A _ { i } -" + }, + { + "category_id": 14, + "poly": [ + 502, + 1709, + 1216, + 1709, + 1216, + 1802, + 502, + 1802 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { \\mathbb { E } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ A _ { i } - \\pi _ { i - 1 } ( X _ { i } ) \\} \\vert \\mathcal { F } _ { i - 1 } ] } \\\\ { = } & { \\mathbb { E } ^ { \\mathcal { F } _ { i - 1 } } [ \\mathbb { E } ( \\varphi ( X _ { i } ) \\varphi ( X _ { i } ) ^ { \\top } \\{ A _ { i } - \\pi _ { i - 1 } ( X _ { i } ) \\} \\vert \\mathcal { F } _ { i - 1 } , X _ { i } ) ] = 0 , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1018, + 264, + 1266, + 264, + 1266, + 299, + 1018, + 299 + ], + "score": 0.9, + "latex": "\\| \\varphi ( x ) \\| _ { 2 } ~ \\leq ~ \\| \\varphi ( x ) \\| _ { 1 }" + }, + { + "category_id": 13, + "poly": [ + 413, + 494, + 837, + 494, + 837, + 534, + 413, + 534 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | \\varphi ^ { \\top } ( x ) \\beta _ { a } | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 519, + 394, + 607, + 394, + 607, + 427, + 519, + 427 + ], + "score": 0.9, + "latex": "\\lvert Y ^ { * } ( 1 ) \\rvert" + }, + { + "category_id": 13, + "poly": [ + 1277, + 1843, + 1326, + 1843, + 1326, + 1876, + 1277, + 1876 + ], + "score": 0.9, + "latex": "\\varphi ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 428, + 546, + 719, + 546, + 719, + 582, + 428, + 582 + ], + "score": 0.9, + "latex": "\\beta _ { a } = \\Sigma _ { a } ^ { - 1 } \\mathrm { E } \\varphi ^ { \\top } ( X ) Y ^ { \\ast } ( a )" + }, + { + "category_id": 14, + "poly": [ + 296, + 864, + 1344, + 864, + 1344, + 931, + 296, + 931 + ], + "score": 0.9, + "latex": "\\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\mathbf { E } | \\nu ^ { \\top } \\varphi ( X ) | ^ { 2 } = \\operatorname* { s u p } _ { \\nu \\in \\mathbb { R } ^ { p } , \\| \\nu \\| _ { 2 } = 1 } \\nu ^ { \\top } \\mathbf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\nu \\leq \\lambda _ { \\operatorname* { m a x } } [ \\mathbf { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] = O ( 1 ) ." + }, + { + "category_id": 13, + "poly": [ + 1316, + 351, + 1393, + 351, + 1393, + 380, + 1316, + 380 + ], + "score": 0.9, + "latex": "\\epsilon _ { 0 } > 0" + }, + { + "category_id": 13, + "poly": [ + 298, + 578, + 605, + 578, + 605, + 613, + 298, + 613 + ], + "score": 0.9, + "latex": "\\| \\mathrm { E } \\varphi ^ { \\top } ( X ) Y ^ { * } ( a ) \\| _ { 2 } \\stackrel { } { = } { \\cal O } ( 1 )" + }, + { + "category_id": 13, + "poly": [ + 523, + 347, + 740, + 347, + 740, + 382, + 523, + 382 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\operatorname* { i n f } _ { a , x } \\pi ^ { * } ( a , x ) > 0 } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 411, + 232, + 576, + 232, + 576, + 261, + 411, + 261 + ], + "score": 0.9, + "latex": "0 ~ < ~ \\epsilon _ { 0 } ~ < ~ 1" + }, + { + "category_id": 13, + "poly": [ + 371, + 1807, + 450, + 1807, + 450, + 1839, + 371, + 1839 + ], + "score": 0.9, + "latex": "\\mathrm { E } ^ { \\mathcal { F } _ { i } , { X } _ { i } }" + }, + { + "category_id": 13, + "poly": [ + 947, + 1609, + 1009, + 1609, + 1009, + 1638, + 947, + 1638 + ], + "score": 0.9, + "latex": "i \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 920, + 1813, + 954, + 1813, + 954, + 1842, + 920, + 1842 + ], + "score": 0.89, + "latex": "X _ { i }" + }, + { + "category_id": 13, + "poly": [ + 1006, + 1813, + 1037, + 1813, + 1037, + 1842, + 1006, + 1842 + ], + "score": 0.89, + "latex": "{ \\mathcal { F } } _ { i }" + }, + { + "category_id": 13, + "poly": [ + 346, + 1843, + 478, + 1843, + 478, + 1875, + 346, + 1875 + ], + "score": 0.89, + "latex": "X _ { i } \\perp \\perp F _ { i - 1 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 262, + 607, + 262, + 607, + 298, + 297, + 298 + ], + "score": 0.89, + "latex": "\\lambda _ { \\mathrm { m a x } } [ \\mathrm { E } \\varphi ( X ) \\varphi ^ { \\top } ( X ) ] \\ \\asymp \\ 1" + }, + { + "category_id": 13, + "poly": [ + 297, + 300, + 764, + 300, + 764, + 337, + 297, + 337 + ], + "score": 0.87, + "latex": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 2 } \\leq \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\leq \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 625, + 261, + 916, + 261, + 916, + 300, + 625, + 300 + ], + "score": 0.86, + "latex": "\\begin{array} { r } { \\operatorname* { s u p } _ { x } \\| \\varphi ( x ) \\| _ { 1 } \\ \\leq \\ \\epsilon _ { 0 } ^ { - 1 } \\sqrt { q } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 297, + 429, + 604, + 429, + 604, + 466, + 297, + 466 + ], + "score": 0.83, + "latex": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } | Y ^ { * } ( a ) | \\leq \\epsilon _ { 0 } ^ { - 1 } } \\end{array}" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1067.0, + 682.0, + 1067.0, + 682.0, + 1103.0, + 295.0, + 1103.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1007.0, + 614.0, + 1007.0, + 614.0, + 1047.0, + 294.0, + 1047.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 855.0, + 72.0, + 855.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2084.0, + 870.0, + 2084.0, + 870.0, + 2123.0, + 830.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1804.0, + 370.0, + 1804.0, + 370.0, + 1849.0, + 293.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 451.0, + 1804.0, + 919.0, + 1804.0, + 919.0, + 1849.0, + 451.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 955.0, + 1804.0, + 1005.0, + 1804.0, + 1005.0, + 1849.0, + 955.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1038.0, + 1804.0, + 1407.0, + 1804.0, + 1407.0, + 1849.0, + 1038.0, + 1849.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1839.0, + 345.0, + 1839.0, + 345.0, + 1879.0, + 293.0, + 1879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 479.0, + 1839.0, + 1276.0, + 1839.0, + 1276.0, + 1879.0, + 479.0, + 1879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1327.0, + 1839.0, + 1406.0, + 1839.0, + 1406.0, + 1879.0, + 1327.0, + 1879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1869.0, + 1406.0, + 1869.0, + 1406.0, + 1910.0, + 293.0, + 1910.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1899.0, + 712.0, + 1899.0, + 712.0, + 1941.0, + 291.0, + 1941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 848.0, + 1899.0, + 861.0, + 1899.0, + 861.0, + 1941.0, + 848.0, + 1941.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1603.0, + 946.0, + 1603.0, + 946.0, + 1644.0, + 294.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1010.0, + 1603.0, + 1094.0, + 1603.0, + 1094.0, + 1644.0, + 1010.0, + 1644.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1636.0, + 608.0, + 1636.0, + 608.0, + 1674.0, + 448.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 713.0, + 1636.0, + 1405.0, + 1636.0, + 1405.0, + 1674.0, + 713.0, + 1674.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1666.0, + 400.0, + 1666.0, + 400.0, + 1704.0, + 295.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 609.0, + 1666.0, + 686.0, + 1666.0, + 686.0, + 1704.0, + 609.0, + 1704.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 226.0, + 410.0, + 226.0, + 410.0, + 266.0, + 294.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 577.0, + 226.0, + 1086.0, + 226.0, + 1086.0, + 266.0, + 577.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1395.0, + 226.0, + 1406.0, + 226.0, + 1406.0, + 266.0, + 1395.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 260.0, + 624.0, + 260.0, + 624.0, + 304.0, + 608.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 917.0, + 260.0, + 1017.0, + 260.0, + 1017.0, + 304.0, + 917.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1267.0, + 260.0, + 1406.0, + 260.0, + 1406.0, + 304.0, + 1267.0, + 304.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 298.0, + 776.0, + 298.0, + 776.0, + 340.0, + 765.0, + 340.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 542.0, + 427.0, + 542.0, + 427.0, + 587.0, + 292.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 720.0, + 542.0, + 801.0, + 542.0, + 801.0, + 587.0, + 720.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 910.0, + 542.0, + 1405.0, + 542.0, + 1405.0, + 587.0, + 910.0, + 587.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 606.0, + 574.0, + 795.0, + 574.0, + 795.0, + 618.0, + 606.0, + 618.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 392.0, + 370.0, + 392.0, + 370.0, + 431.0, + 296.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 460.0, + 392.0, + 518.0, + 392.0, + 518.0, + 431.0, + 460.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 608.0, + 392.0, + 1087.0, + 392.0, + 1087.0, + 431.0, + 608.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1250.0, + 392.0, + 1406.0, + 392.0, + 1406.0, + 431.0, + 1250.0, + 431.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 425.0, + 296.0, + 425.0, + 296.0, + 467.0, + 291.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 605.0, + 425.0, + 754.0, + 425.0, + 754.0, + 467.0, + 605.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1109.0, + 425.0, + 1310.0, + 425.0, + 1310.0, + 467.0, + 1109.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 425.0, + 1406.0, + 425.0, + 1406.0, + 467.0, + 1401.0, + 467.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 461.0, + 678.0, + 461.0, + 678.0, + 496.0, + 296.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 831.0, + 461.0, + 1404.0, + 461.0, + 1404.0, + 496.0, + 831.0, + 496.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 495.0, + 412.0, + 495.0, + 412.0, + 536.0, + 295.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 838.0, + 495.0, + 849.0, + 495.0, + 849.0, + 536.0, + 838.0, + 536.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 695.0, + 861.0, + 695.0, + 861.0, + 738.0, + 294.0, + 738.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 940.0, + 639.0, + 940.0, + 639.0, + 979.0, + 295.0, + 979.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1120.0, + 428.0, + 1120.0, + 428.0, + 1153.0, + 294.0, + 1153.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1365.0, + 554.0, + 1365.0, + 554.0, + 1401.0, + 296.0, + 1401.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1553.0, + 567.0, + 1553.0, + 567.0, + 1603.0, + 293.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1553.0, + 729.0, + 1553.0, + 729.0, + 1603.0, + 717.0, + 1603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 343.0, + 522.0, + 343.0, + 522.0, + 387.0, + 296.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 741.0, + 343.0, + 1045.0, + 343.0, + 1045.0, + 387.0, + 741.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1212.0, + 343.0, + 1315.0, + 343.0, + 1315.0, + 387.0, + 1212.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1394.0, + 343.0, + 1405.0, + 343.0, + 1405.0, + 387.0, + 1394.0, + 387.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 818.0, + 365.0, + 818.0, + 365.0, + 863.0, + 295.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 550.0, + 818.0, + 997.0, + 818.0, + 997.0, + 863.0, + 550.0, + 863.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1334.0, + 818.0, + 1388.0, + 818.0, + 1388.0, + 863.0, + 1334.0, + 863.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 22, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 295, + 1149, + 1406, + 1149, + 1406, + 1278, + 295, + 1278 + ], + "score": 0.977 + }, + { + "category_id": 1, + "poly": [ + 304, + 1531, + 1399, + 1531, + 1399, + 1625, + 304, + 1625 + ], + "score": 0.975 + }, + { + "category_id": 8, + "poly": [ + 434, + 1386, + 1291, + 1386, + 1291, + 1520, + 434, + 1520 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 338, + 317, + 1306, + 317, + 1306, + 412, + 338, + 412 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 616, + 1794, + 1025, + 1794, + 1025, + 1887, + 616, + 1887 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 645, + 1642, + 995, + 1642, + 995, + 1733, + 645, + 1733 + ], + "score": 0.958 + }, + { + "category_id": 1, + "poly": [ + 301, + 224, + 1403, + 224, + 1403, + 302, + 301, + 302 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 360, + 917, + 1284, + 917, + 1284, + 1014, + 360, + 1014 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 471, + 791, + 1174, + 791, + 1174, + 838, + 471, + 838 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 508, + 1951, + 1133, + 1951, + 1133, + 2042, + 508, + 2042 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 560, + 1290, + 1081, + 1290, + 1081, + 1336, + 560, + 1336 + ], + "score": 0.94 + }, + { + "category_id": 8, + "poly": [ + 533, + 569, + 1109, + 569, + 1109, + 614, + 533, + 614 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 295, + 1900, + 1166, + 1900, + 1166, + 1936, + 295, + 1936 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 295, + 847, + 1410, + 847, + 1410, + 910, + 295, + 910 + ], + "score": 0.938 + }, + { + "category_id": 1, + "poly": [ + 301, + 624, + 1069, + 624, + 1069, + 659, + 301, + 659 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 296, + 1346, + 425, + 1346, + 425, + 1377, + 296, + 1377 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 298, + 1745, + 768, + 1745, + 768, + 1778, + 298, + 1778 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 297, + 1025, + 1071, + 1025, + 1071, + 1062, + 297, + 1062 + ], + "score": 0.932 + }, + { + "category_id": 8, + "poly": [ + 533, + 464, + 1110, + 464, + 1110, + 510, + 533, + 510 + ], + "score": 0.93 + }, + { + "category_id": 0, + "poly": [ + 298, + 1095, + 612, + 1095, + 612, + 1127, + 298, + 1127 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 294, + 741, + 1289, + 741, + 1289, + 779, + 294, + 779 + ], + "score": 0.929 + }, + { + "category_id": 1, + "poly": [ + 297, + 424, + 458, + 424, + 458, + 455, + 297, + 455 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 295, + 519, + 994, + 519, + 994, + 555, + 295, + 555 + ], + "score": 0.923 + }, + { + "category_id": 0, + "poly": [ + 299, + 690, + 680, + 690, + 680, + 723, + 299, + 723 + ], + "score": 0.919 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.906 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1823, + 1401, + 1823, + 1401, + 1855, + 1351, + 1855 + ], + "score": 0.898 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1670, + 1401, + 1670, + 1401, + 1701, + 1351, + 1701 + ], + "score": 0.896 + }, + { + "category_id": 9, + "poly": [ + 1351, + 799, + 1401, + 799, + 1401, + 831, + 1351, + 831 + ], + "score": 0.894 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1298, + 1401, + 1298, + 1401, + 1328, + 1351, + 1328 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1350, + 347, + 1402, + 347, + 1402, + 379, + 1350, + 379 + ], + "score": 0.863 + }, + { + "category_id": 14, + "poly": [ + 509, + 1948, + 1133, + 1948, + 1133, + 2044, + 509, + 2044 + ], + "score": 0.94, + "latex": "\\sum _ { i = 1 } ^ { k } [ M _ { i } ^ { 2 } ( l ) - \\mathtt { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\preceq \\sqrt { q k \\log k } , \\forall k \\ge j ." + }, + { + "category_id": 14, + "poly": [ + 644, + 1637, + 998, + 1637, + 998, + 1734, + 644, + 1734 + ], + "score": 0.94, + "latex": "\\sum _ { i = 1 } ^ { k } \\operatorname { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} \\leq 4 k \\epsilon _ { 0 } ^ { - 3 } ." + }, + { + "category_id": 14, + "poly": [ + 337, + 314, + 1304, + 314, + 1304, + 413, + 337, + 413 + ], + "score": 0.93, + "latex": "\\left\\| \\sum _ { i = 1 } ^ { j } \\{ A _ { i } \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( 1 , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q j \\log j } , ~ \\forall j \\geq j _ { n } ." + }, + { + "category_id": 14, + "poly": [ + 615, + 1790, + 1027, + 1790, + 1027, + 1887, + 615, + 1887 + ], + "score": 0.93, + "latex": "\\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) \\leq 4 \\epsilon _ { 0 } ^ { - 2 } \\sum _ { i = 1 } ^ { k } \\{ \\psi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } ." + }, + { + "category_id": 13, + "poly": [ + 499, + 742, + 738, + 742, + 738, + 779, + 499, + 779 + ], + "score": 0.93, + "latex": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } ( j _ { n } ) \\gg q ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 769, + 1150, + 1214, + 1150, + 1214, + 1187, + 769, + 1187 + ], + "score": 0.93, + "latex": "M _ { i } ( l ) = \\varphi ^ { ( l ) } ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\}" + }, + { + "category_id": 13, + "poly": [ + 392, + 1153, + 558, + 1153, + 558, + 1187, + 392, + 1187 + ], + "score": 0.93, + "latex": "l \\in \\{ 1 , \\ldots , q \\}" + }, + { + "category_id": 13, + "poly": [ + 978, + 1901, + 1112, + 1901, + 1112, + 1936, + 978, + 1936 + ], + "score": 0.93, + "latex": "1 - O ( j ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 568, + 520, + 716, + 520, + 716, + 555, + 568, + 555 + ], + "score": 0.93, + "latex": "1 - O ( j ^ { - \\alpha _ { 0 } } )" + }, + { + "category_id": 13, + "poly": [ + 573, + 847, + 724, + 847, + 724, + 882, + 573, + 882 + ], + "score": 0.93, + "latex": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 1177, + 1184, + 1309, + 1184, + 1309, + 1219, + 1177, + 1219 + ], + "score": 0.93, + "latex": "\\{ \\dot { M } _ { i } ( l ) \\} _ { i \\geq 1 }" + }, + { + "category_id": 13, + "poly": [ + 679, + 1184, + 752, + 1184, + 752, + 1217, + 679, + 1217 + ], + "score": 0.93, + "latex": "\\varphi ( X _ { i } )" + }, + { + "category_id": 14, + "poly": [ + 432, + 1384, + 1292, + 1384, + 1292, + 1524, + 432, + 1524 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\mathbb { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} = \\mathbb { E } [ \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } A _ { i } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} ^ { 2 } | \\mathcal { F } _ { i - 1 } ] } \\\\ { \\le } & { \\mathbb { E } [ \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\{ Y _ { i } ^ { * } ( 1 ) - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} ^ { 2 } | \\mathcal { F } _ { i - 1 } ] = \\mathbb { E } \\sigma ^ { 2 } ( 1 , X _ { i } ) \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } } \\\\ { \\le } & { 4 \\epsilon _ { 0 } ^ { - 2 } \\mathbb { E } \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\le 4 \\epsilon _ { 0 } ^ { - 3 } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 568, + 624, + 716, + 624, + 716, + 659, + 568, + 659 + ], + "score": 0.93, + "latex": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 568, + 1026, + 716, + 1026, + 716, + 1061, + 568, + 1061 + ], + "score": 0.92, + "latex": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 1300, + 1150, + 1400, + 1150, + 1400, + 1187, + 1300, + 1187 + ], + "score": 0.92, + "latex": "\\varphi ^ { ( l ) } ( X _ { i } )" + }, + { + "category_id": 13, + "poly": [ + 962, + 1214, + 1170, + 1214, + 1170, + 1248, + 962, + 1248 + ], + "score": 0.92, + "latex": "\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 426, + 227, + 1036, + 227, + 1036, + 268, + 426, + 268 + ], + "score": 0.92, + "latex": "\\textstyle \\sum _ { k \\geq j } k ^ { - 2 } \\leq j ^ { - 2 } + \\sum _ { k > j } \\{ k ( k - 1 ) \\} ^ { - 1 } = j ^ { - 2 } + j ^ { - 1 }" + }, + { + "category_id": 14, + "poly": [ + 359, + 915, + 1287, + 915, + 1287, + 1018, + 359, + 1018 + ], + "score": 0.91, + "latex": "\\begin{array} { r l r } & { } & { \\Vert \\widehat { \\Sigma } _ { a , k } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\Vert _ { 2 } = \\Vert \\widehat { \\Sigma } _ { a , k } ^ { - 1 } ( \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } ) \\Sigma _ { a } ^ { - 1 } \\Vert _ { 2 } \\leq \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ) \\Vert \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } \\Vert _ { 2 } } \\\\ & { } & { \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 533, + 463, + 1106, + 463, + 1106, + 509, + 533, + 509 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\| \\big ( \\widehat { \\Sigma } _ { 1 , k } - \\Sigma _ { 1 } \\big ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 534, + 567, + 1107, + 567, + 1107, + 613, + 534, + 613 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\| \\big ( \\widehat { \\Sigma } _ { 0 , k } - \\Sigma _ { 0 } \\big ) \\| _ { 2 } \\preceq q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } , \\forall k \\geq j _ { n } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 611, + 1154, + 680, + 1154, + 680, + 1184, + 611, + 1184 + ], + "score": 0.9, + "latex": "i \\geq 1" + }, + { + "category_id": 14, + "poly": [ + 560, + 1289, + 1083, + 1289, + 1083, + 1334, + 560, + 1334 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { \\mathbb { E } \\{ \\varphi ^ { ( l ) } ( X _ { i } ) \\} ^ { 2 } \\le \\lambda _ { \\operatorname* { m a x } } [ \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ] \\le \\epsilon _ { 0 } ^ { - 1 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 471, + 790, + 1172, + 790, + 1172, + 835, + 471, + 835 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\lambda _ { \\operatorname* { m i n } } [ \\Sigma _ { a } ] - \\Vert \\widehat { \\Sigma } _ { a , k } - \\Sigma _ { a } \\Vert _ { 2 } \\geq 2 ^ { - 1 } \\varepsilon _ { 0 } , \\forall k \\geq j _ { n } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 511, + 268, + 646, + 268, + 646, + 302, + 511, + 302 + ], + "score": 0.89, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 371, + 747, + 399, + 747, + 399, + 776, + 371, + 776 + ], + "score": 0.86, + "latex": "j _ { n }" + }, + { + "category_id": 13, + "poly": [ + 1083, + 1533, + 1107, + 1533, + 1107, + 1559, + 1083, + 1559 + ], + "score": 0.83, + "latex": "A" + }, + { + "category_id": 13, + "poly": [ + 507, + 1188, + 519, + 1188, + 519, + 1211, + 507, + 1211 + ], + "score": 0.73, + "latex": "l" + }, + { + "category_id": 13, + "poly": [ + 442, + 1247, + 453, + 1247, + 453, + 1272, + 442, + 1272 + ], + "score": 0.66, + "latex": "l" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1092.0, + 615.0, + 1092.0, + 615.0, + 1132.0, + 294.0, + 1132.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 690.0, + 681.0, + 690.0, + 681.0, + 726.0, + 295.0, + 726.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": [ + 829.0, + 2083.0, + 871.0, + 2083.0, + 871.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1147.0, + 391.0, + 1147.0, + 391.0, + 1191.0, + 292.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 559.0, + 1147.0, + 610.0, + 1147.0, + 610.0, + 1191.0, + 559.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 681.0, + 1147.0, + 768.0, + 1147.0, + 768.0, + 1191.0, + 681.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1215.0, + 1147.0, + 1299.0, + 1147.0, + 1299.0, + 1191.0, + 1215.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 1147.0, + 1407.0, + 1147.0, + 1407.0, + 1191.0, + 1401.0, + 1191.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1182.0, + 506.0, + 1182.0, + 506.0, + 1219.0, + 294.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 1182.0, + 678.0, + 1182.0, + 678.0, + 1219.0, + 520.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 753.0, + 1182.0, + 1176.0, + 1182.0, + 1176.0, + 1219.0, + 753.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1310.0, + 1182.0, + 1407.0, + 1182.0, + 1407.0, + 1219.0, + 1310.0, + 1219.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1213.0, + 961.0, + 1213.0, + 961.0, + 1250.0, + 293.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1171.0, + 1213.0, + 1406.0, + 1213.0, + 1406.0, + 1250.0, + 1171.0, + 1250.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1242.0, + 441.0, + 1242.0, + 441.0, + 1280.0, + 293.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1242.0, + 467.0, + 1242.0, + 467.0, + 1280.0, + 454.0, + 1280.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1528.0, + 1082.0, + 1528.0, + 1082.0, + 1570.0, + 296.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1108.0, + 1528.0, + 1407.0, + 1528.0, + 1407.0, + 1570.0, + 1108.0, + 1570.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1561.0, + 1405.0, + 1561.0, + 1405.0, + 1599.0, + 296.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 299.0, + 1593.0, + 869.0, + 1593.0, + 869.0, + 1626.0, + 299.0, + 1626.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 223.0, + 425.0, + 223.0, + 425.0, + 270.0, + 294.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1037.0, + 223.0, + 1405.0, + 223.0, + 1405.0, + 270.0, + 1037.0, + 270.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 263.0, + 510.0, + 263.0, + 510.0, + 306.0, + 295.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 647.0, + 263.0, + 658.0, + 263.0, + 658.0, + 306.0, + 647.0, + 306.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1899.0, + 977.0, + 1899.0, + 977.0, + 1939.0, + 296.0, + 1939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1113.0, + 1899.0, + 1166.0, + 1899.0, + 1166.0, + 1939.0, + 1113.0, + 1939.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 842.0, + 572.0, + 842.0, + 572.0, + 887.0, + 291.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 725.0, + 842.0, + 1407.0, + 842.0, + 1407.0, + 887.0, + 725.0, + 887.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 876.0, + 415.0, + 876.0, + 415.0, + 913.0, + 293.0, + 913.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 620.0, + 567.0, + 620.0, + 567.0, + 665.0, + 293.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 620.0, + 1074.0, + 620.0, + 1074.0, + 665.0, + 717.0, + 665.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1341.0, + 429.0, + 1341.0, + 429.0, + 1380.0, + 292.0, + 1380.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1744.0, + 771.0, + 1744.0, + 771.0, + 1780.0, + 297.0, + 1780.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1022.0, + 567.0, + 1022.0, + 567.0, + 1067.0, + 293.0, + 1067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 1022.0, + 1073.0, + 1022.0, + 1073.0, + 1067.0, + 717.0, + 1067.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 741.0, + 370.0, + 741.0, + 370.0, + 782.0, + 295.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 741.0, + 498.0, + 741.0, + 498.0, + 782.0, + 400.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 739.0, + 741.0, + 1293.0, + 741.0, + 1293.0, + 782.0, + 739.0, + 782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 423.0, + 460.0, + 423.0, + 460.0, + 456.0, + 295.0, + 456.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 517.0, + 567.0, + 517.0, + 567.0, + 560.0, + 295.0, + 560.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 717.0, + 517.0, + 994.0, + 517.0, + 994.0, + 560.0, + 717.0, + 560.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 23, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 315, + 428, + 1470, + 428, + 1470, + 1022, + 315, + 1022 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 318, + 1076, + 1481, + 1076, + 1481, + 1486, + 318, + 1486 + ], + "score": 0.968 + }, + { + "category_id": 8, + "poly": [ + 472, + 1728, + 1169, + 1728, + 1169, + 1826, + 472, + 1826 + ], + "score": 0.96 + }, + { + "category_id": 8, + "poly": [ + 612, + 1576, + 1029, + 1576, + 1029, + 1672, + 612, + 1672 + ], + "score": 0.958 + }, + { + "category_id": 8, + "poly": [ + 528, + 279, + 1114, + 279, + 1114, + 369, + 528, + 369 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 294, + 1497, + 1402, + 1497, + 1402, + 1564, + 294, + 1564 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 445, + 1891, + 1196, + 1891, + 1196, + 1989, + 445, + 1989 + ], + "score": 0.95 + }, + { + "category_id": 1, + "poly": [ + 298, + 1839, + 1001, + 1839, + 1001, + 1880, + 298, + 1880 + ], + "score": 0.935 + }, + { + "category_id": 1, + "poly": [ + 297, + 380, + 1157, + 380, + 1157, + 418, + 297, + 418 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 298, + 1682, + 703, + 1682, + 703, + 1716, + 298, + 1716 + ], + "score": 0.932 + }, + { + "category_id": 1, + "poly": [ + 296, + 226, + 1254, + 226, + 1254, + 266, + 296, + 266 + ], + "score": 0.93 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 107, + 296, + 107 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 291, + 1999, + 1334, + 1999, + 1334, + 2038, + 291, + 2038 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 296, + 1029, + 1189, + 1029, + 1189, + 1065, + 296, + 1065 + ], + "score": 0.923 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.87 + }, + { + "category_id": 9, + "poly": [ + 1429, + 1419, + 1481, + 1419, + 1481, + 1451, + 1429, + 1451 + ], + "score": 0.846 + }, + { + "category_id": 14, + "poly": [ + 612, + 1574, + 1030, + 1574, + 1030, + 1673, + 612, + 1673 + ], + "score": 0.94, + "latex": "\\bigcap _ { k \\geq j _ { n } } \\left\\{ | \\sum _ { i = 1 } ^ { k } M _ { i } ( l ) | \\leq 2 { \\sqrt { { \\bar { c } } k \\log k } } \\right\\} ." + }, + { + "category_id": 14, + "poly": [ + 527, + 274, + 1112, + 274, + 1112, + 370, + 527, + 370 + ], + "score": 0.93, + "latex": "\\sum _ { i = 1 } ^ { k } M _ { i } ^ { 2 } ( l ) + \\sum _ { i = 1 } ^ { k } \\mathrm { E } \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} \\leq \\bar { c } k , \\forall k \\geq j _ { n } ," + }, + { + "category_id": 13, + "poly": [ + 568, + 1838, + 725, + 1838, + 725, + 1881, + 568, + 1881 + ], + "score": 0.93, + "latex": "1 - O ( j _ { n } ^ { - 1 / 2 } )" + }, + { + "category_id": 14, + "poly": [ + 473, + 1726, + 1168, + 1726, + 1168, + 1826, + 473, + 1826 + ], + "score": 0.93, + "latex": "\\bigcap _ { k \\geq j _ { n } } \\left\\{ \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) A _ { i } \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } \\} \\right. _ { 2 } \\leq 2 \\sqrt { \\bar { c } q k \\log k } \\right\\} ," + }, + { + "category_id": 13, + "poly": [ + 847, + 381, + 982, + 381, + 982, + 417, + 847, + 417 + ], + "score": 0.93, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 14, + "poly": [ + 445, + 1890, + 1194, + 1890, + 1194, + 1988, + 445, + 1988 + ], + "score": 0.93, + "latex": "\\bigcap _ { k \\geq j _ { n } } \\left\\{ \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) ( 1 - A _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } \\} \\right. _ { 2 } \\leq c \\sqrt { q k \\log k } \\right\\} ," + }, + { + "category_id": 13, + "poly": [ + 737, + 230, + 925, + 230, + 925, + 264, + 737, + 264 + ], + "score": 0.92, + "latex": "j _ { n } / \\log ( j _ { n } ) \\gg q" + }, + { + "category_id": 13, + "poly": [ + 848, + 2003, + 983, + 2003, + 983, + 2036, + 848, + 2036 + ], + "score": 0.92, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 14, + "poly": [ + 317, + 1078, + 1428, + 1078, + 1428, + 1489, + 317, + 1489 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\operatorname* { P r } ( \\displaystyle \\bigcap _ { k \\geq j _ { n } } \\{ \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | \\leq 2 \\sqrt { c k \\log { k } } \\} ) \\geq 1 - O ( j _ { n } ^ { - 1 } ) } \\\\ { - } & { \\displaystyle \\sum _ { k \\geq j _ { n } } \\operatorname* { P r } _ { \\epsilon } ( \\{ | \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \\sqrt { c k \\log { k } } \\} \\bigcap _ { k ^ { \\prime } \\geq j _ { n } } \\{ \\displaystyle \\sum _ { i = 1 } ^ { k ^ { \\prime } } [ \\displaystyle M _ { i } ^ { 2 } ( l ) + \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\leq \\bar { \\alpha } k ^ { \\prime } \\} \\} ) } \\\\ { \\geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - \\displaystyle \\sum _ { k \\geq j _ { n } } \\operatorname* { P r } ( \\{ | \\displaystyle \\sum _ { i = 1 } ^ { k } { M _ { i } ( l ) } | > 2 \\sqrt { c k \\log { k } } \\} \\bigcap \\{ \\displaystyle \\sum _ { i = 1 } ^ { k } [ \\displaystyle M _ { i } ^ { 2 } ( l ) + \\{ M _ { i } ^ { 2 } ( l ) | \\mathcal { F } _ { i - 1 } \\} ] \\leq \\bar { \\alpha } k \\} } \\\\ { \\geq } & { 1 - O ( j _ { n } ^ { - 1 } ) - 2 \\displaystyle \\sum _ { k \\geq j _ { n } } \\exp ( - \\frac { 4 \\bar { c } k \\log { k } } { 2 \\bar { c k } } ) = 1 - O ( j _ { n } ^ { - 1 } ) - \\displaystyle \\sum _ { k \\geq j _ { n } } 2 k ^ { - 2 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 347, + 428, + 1465, + 428, + 1465, + 988, + 347, + 988 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { \\mathbb { P } _ { \\mathbb { P } } ( \\underset { \\mathrm { S t } } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\sum } } M _ { i } ( \\ell ) \\leq 2 \\sqrt { \\ 6 \\mathbb { k } } \\log k ) \\Bigg \\} } \\\\ & \\mathbb { P } _ { \\mathbb { P } } ( \\{ \\underset { s = 2 } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\prod } } \\frac { \\lambda } { \\underset { s = 1 } { \\prod } } ( \\lambda ) \\leq 2 \\sqrt { 6 \\mathbb { k } \\mathbb { k } \\log k } \\} \\prod _ { s = 2 } \\Biggl \\{ \\underset { s = 1 } { \\overset { k } { \\prod } } \\underset { s = 1 } { \\overset { k } { \\sum } } \\big [ M _ { i } ^ { 2 } ( \\ell ) + \\frac { 4 \\lambda _ { i } ^ { 2 } ( \\ell ) ( \\ell ) ( \\mathcal { F } _ { i - 1 } ) } { \\underset { s = 1 } { \\overset { k } { \\prod } } } ] \\leq \\mathbb { e } \\mathbb { k } \\} \\Bigg \\} \\\\ & { \\mathcal { O } _ { \\mathbb { Q } ^ { ( - 1 ) } } ^ { - 1 } \\succeq \\mathbb { P r } ( \\{ \\underset { \\mathrm { S t } \\geq \\delta _ { i } } { \\bigcap } \\underset { s = 1 } { \\overset { k } { \\sum } } ( \\lambda ) ^ { \\frac { \\ell } { \\ell } } ( \\ell ) + \\underset { s = 1 } { \\overset { k } { \\prod } } ( \\ell ) ( \\mathcal { F } _ { i } ) \\underset { s = 1 } { \\overset { k } { \\sum } } \\} \\leq \\mathbb { E } \\mathbb { k } \\} \\Bigg ) - \\mathcal { O } ( \\underset { \\mathbb { P } } { \\longrightarrow } ^ { - 1 } ) } \\\\ & \\mathbb { P } _ { \\mathbb { P } } ( \\{ \\underset { \\mathrm { S t } \\geq \\delta _ { i } } { \\bigcup } \\underset { s = 1 } { \\overset { k } { \\sum } } \\frac { \\lambda } { \\underset { s = 1 } { \\overset { k } { \\prod } } ( \\ell ) \\leq 2 \\sqrt { 6 \\mathbb { k } \\log \\ell } } \\} \\int \\prod _ { s = \\underset { i = 1 } { \\overset { k } { \\sum } } \\sum _ { i } \\mathcal { M } _ { i } ^ { 2 } ( \\ell ) + \\underset { s = 1 } { \\overset { k } { \\sum } } ( \\lambda ) ^ { \\frac { \\ell } { \\sum } } ( \\ell ) \\mathcal { F } _ { i - 1 } \\mathbb { I } \\} \\leq \\mathbb { e } \\mathbb { k } \\Bigg \\} ) } \\\\ & 1 - \\mathbb { P } _ \\mathbb \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 799, + 1498, + 937, + 1498, + 937, + 1533, + 799, + 1533 + ], + "score": 0.9, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 502, + 385, + 567, + 385, + 567, + 412, + 502, + 412 + ], + "score": 0.9, + "latex": "\\bar { c } > 0" + }, + { + "category_id": 13, + "poly": [ + 502, + 2004, + 567, + 2004, + 567, + 2031, + 502, + 2031 + ], + "score": 0.89, + "latex": "c > 0" + }, + { + "category_id": 13, + "poly": [ + 826, + 1531, + 961, + 1531, + 961, + 1565, + 826, + 1565 + ], + "score": 0.89, + "latex": "1 - \\dot { O } ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 560, + 233, + 590, + 233, + 590, + 263, + 560, + 263 + ], + "score": 0.88, + "latex": "j _ { n }" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 109.0, + 297.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2083.0, + 871.0, + 2083.0, + 871.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1495.0, + 798.0, + 1495.0, + 798.0, + 1540.0, + 293.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 938.0, + 1495.0, + 1408.0, + 1495.0, + 1408.0, + 1540.0, + 938.0, + 1540.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1523.0, + 825.0, + 1523.0, + 825.0, + 1572.0, + 292.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 962.0, + 1523.0, + 976.0, + 1523.0, + 976.0, + 1572.0, + 962.0, + 1572.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1832.0, + 567.0, + 1832.0, + 567.0, + 1890.0, + 291.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 726.0, + 1832.0, + 1007.0, + 1832.0, + 1007.0, + 1890.0, + 726.0, + 1890.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 380.0, + 501.0, + 380.0, + 501.0, + 421.0, + 294.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 380.0, + 846.0, + 380.0, + 846.0, + 421.0, + 568.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 983.0, + 380.0, + 1158.0, + 380.0, + 1158.0, + 421.0, + 983.0, + 421.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1681.0, + 704.0, + 1681.0, + 704.0, + 1721.0, + 295.0, + 1721.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 226.0, + 559.0, + 226.0, + 559.0, + 268.0, + 296.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 591.0, + 226.0, + 736.0, + 226.0, + 736.0, + 268.0, + 591.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 926.0, + 226.0, + 1256.0, + 226.0, + 1256.0, + 268.0, + 926.0, + 268.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1999.0, + 501.0, + 1999.0, + 501.0, + 2040.0, + 292.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 568.0, + 1999.0, + 847.0, + 1999.0, + 847.0, + 2040.0, + 568.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 984.0, + 1999.0, + 1339.0, + 1999.0, + 1339.0, + 2040.0, + 984.0, + 2040.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1028.0, + 1189.0, + 1028.0, + 1189.0, + 1068.0, + 295.0, + 1068.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 24, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 295, + 1449, + 1515, + 1449, + 1515, + 1657, + 295, + 1657 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 317, + 1711, + 1476, + 1711, + 1476, + 2042, + 317, + 2042 + ], + "score": 0.963 + }, + { + "category_id": 8, + "poly": [ + 537, + 1029, + 1106, + 1029, + 1106, + 1198, + 537, + 1198 + ], + "score": 0.96 + }, + { + "category_id": 1, + "poly": [ + 297, + 717, + 1407, + 717, + 1407, + 812, + 297, + 812 + ], + "score": 0.957 + }, + { + "category_id": 8, + "poly": [ + 294, + 820, + 1468, + 820, + 1468, + 985, + 294, + 985 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 290, + 343, + 1402, + 343, + 1402, + 410, + 290, + 410 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 292, + 482, + 1404, + 482, + 1404, + 550, + 292, + 550 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 476, + 418, + 1165, + 418, + 1165, + 464, + 476, + 464 + ], + "score": 0.933 + }, + { + "category_id": 8, + "poly": [ + 318, + 560, + 1324, + 560, + 1324, + 694, + 318, + 694 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 297, + 285, + 959, + 285, + 959, + 321, + 297, + 321 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 297, + 1665, + 778, + 1665, + 778, + 1699, + 297, + 1699 + ], + "score": 0.918 + }, + { + "category_id": 2, + "poly": [ + 297, + 73, + 855, + 73, + 855, + 106, + 297, + 106 + ], + "score": 0.905 + }, + { + "category_id": 0, + "poly": [ + 298, + 228, + 639, + 228, + 639, + 262, + 298, + 262 + ], + "score": 0.875 + }, + { + "category_id": 9, + "poly": [ + 1423, + 2003, + 1475, + 2003, + 1475, + 2034, + 1423, + 2034 + ], + "score": 0.824 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 866, + 2087, + 866, + 2114, + 834, + 2114 + ], + "score": 0.82 + }, + { + "category_id": 1, + "poly": [ + 296, + 996, + 345, + 996, + 345, + 1025, + 296, + 1025 + ], + "score": 0.763 + }, + { + "category_id": 1, + "poly": [ + 295, + 1208, + 1433, + 1208, + 1433, + 1354, + 295, + 1354 + ], + "score": 0.658 + }, + { + "category_id": 1, + "poly": [ + 291, + 1358, + 1499, + 1358, + 1499, + 1441, + 291, + 1441 + ], + "score": 0.62 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 866, + 2087, + 866, + 2114, + 834, + 2114 + ], + "score": 0.131 + }, + { + "category_id": 8, + "poly": [ + 318, + 561, + 1323, + 561, + 1323, + 652, + 318, + 652 + ], + "score": 0.098 + }, + { + "category_id": 14, + "poly": [ + 318, + 1708, + 1428, + 1708, + 1428, + 2048, + 318, + 2048 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\| \\hat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\\\ { \\leq } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\Bigg \\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\underset { j = 1 } { \\overset { n ( t _ { k _ { 1 } } ) } { \\sum } } \\underset { 2 = 1 } { \\overset { n ( t _ { k } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } - \\Sigma _ { a } ^ { - 1 } \\Phi _ { a } \\Sigma _ { a } ^ { - } } \\\\ { \\leq } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { \\epsilon _ { 0 } ^ { 2 } } \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\Bigg \\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\underset { j = 1 } { \\overset { n ( t _ { k _ { 1 } } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\Phi _ { a } \\Bigg \\| _ { 2 } } \\\\ { \\overset { \\leq } } & { q \\delta _ { n ( t _ { 1 } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \\sqrt { \\log n ( t _ { 1 } ) } , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 535, + 1028, + 1107, + 1028, + 1107, + 1199, + 535, + 1199 + ], + "score": 0.94, + "latex": "\\widehat { \\pmb { V } } = \\left( \\begin{array} { c c c c } { \\widehat { V } ( 1 , 1 ) } & { \\widehat { V } ( 1 , 2 ) } & { \\ldots } & { \\widehat { V } ( 1 , K ) } \\\\ { \\widehat { V } ( 2 , 1 ) } & { \\widehat { V } ( 2 , 2 ) } & { \\ldots } & { \\widehat { V } ( 2 , K ) } \\\\ { \\vdots } & { \\vdots } & { \\vdots } \\\\ { \\widehat { V } ( K , 1 ) } & { \\widehat { V } ( K , 2 ) } & { \\ldots } & { \\widehat { V } ( K , K ) } \\end{array} \\right) ." + }, + { + "category_id": 13, + "poly": [ + 901, + 377, + 1049, + 377, + 1049, + 410, + 901, + 410 + ], + "score": 0.92, + "latex": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 901, + 516, + 1049, + 516, + 1049, + 549, + 901, + 549 + ], + "score": 0.92, + "latex": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 1180, + 345, + 1251, + 345, + 1251, + 379, + 1180, + 379 + ], + "score": 0.92, + "latex": "\\{ j _ { n } \\} _ { n }" + }, + { + "category_id": 13, + "poly": [ + 1180, + 484, + 1251, + 484, + 1251, + 518, + 1180, + 518 + ], + "score": 0.92, + "latex": "\\{ j _ { n } \\} _ { n }" + }, + { + "category_id": 13, + "poly": [ + 726, + 750, + 783, + 750, + 783, + 783, + 726, + 783 + ], + "score": 0.92, + "latex": "N ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 924, + 749, + 1290, + 749, + 1290, + 783, + 924, + 783 + ], + "score": 0.91, + "latex": "n ( t _ { 1 } ) < n ( t _ { 2 } ) < \\cdots < n ( t _ { K } )" + }, + { + "category_id": 13, + "poly": [ + 833, + 1207, + 931, + 1207, + 931, + 1243, + 833, + 1243 + ], + "score": 0.91, + "latex": "\\widehat { V } - V" + }, + { + "category_id": 14, + "poly": [ + 310, + 559, + 1326, + 559, + 1326, + 699, + 310, + 699 + ], + "score": 0.91, + "latex": "\\begin{array} { r l r } & { } & { \\left| \\left| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\Phi _ { a } \\right| \\right| _ { 2 } \\preceq q \\delta _ { k } + q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , } \\\\ & { } & { \\forall a \\in \\{ 0 , 1 \\} , k \\geq j _ { n } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 375, + 519, + 375, + 519, + 411, + 298, + 411 + ], + "score": 0.91, + "latex": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 514, + 519, + 514, + 519, + 550, + 297, + 550 + ], + "score": 0.91, + "latex": "j _ { n } ^ { \\alpha _ { 0 } } / \\log ^ { \\alpha _ { 0 } } j _ { n } \\gg q ^ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 889, + 1292, + 958, + 1292, + 958, + 1324, + 889, + 1324 + ], + "score": 0.91, + "latex": "k _ { 1 } , k _ { 2 }" + }, + { + "category_id": 13, + "poly": [ + 297, + 780, + 504, + 780, + 504, + 812, + 297, + 812 + ], + "score": 0.9, + "latex": "1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K" + }, + { + "category_id": 13, + "poly": [ + 1144, + 1286, + 1401, + 1286, + 1401, + 1325, + 1144, + 1325 + ], + "score": 0.9, + "latex": "\\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } )" + }, + { + "category_id": 13, + "poly": [ + 1352, + 719, + 1400, + 719, + 1400, + 753, + 1352, + 753 + ], + "score": 0.89, + "latex": "n ( \\cdot )" + }, + { + "category_id": 14, + "poly": [ + 310, + 817, + 1428, + 817, + 1428, + 988, + 310, + 988 + ], + "score": 0.89, + "latex": "\\begin{array} { l } { { \\displaystyle \\widehat { V } ( k _ { 1 } , k _ { 2 } ) = \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } \\mathrm { C o v } \\left( \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k 1 } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k 1 } ) , \\widehat { \\beta } _ { 1 } ^ { \\mathrm { M B } * } ( t _ { k 2 } ) - \\widehat { \\beta } _ { 0 } ^ { \\mathrm { M B } * } ( t _ { k 2 } ) | \\{ ( X _ { i } , A _ { i } , Y _ { i } ) \\} _ { i = 1 , \\ldots , n } ^ { + \\infty } \\right) } } \\\\ { { \\displaystyle = \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { k 1 } ) , } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 504, + 1244, + 1404, + 1244, + 1404, + 1289, + 504, + 1289 + ], + "score": 0.89, + "latex": "\\begin{array} { r l } { \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\operatorname* { s u p } _ { b _ { 1 } , b _ { 2 } \\in \\mathbb { R } ^ { p + 1 } , \\| b _ { 1 } \\| _ { 2 } = \\| b _ { 2 } \\| _ { 2 } = 1 } | b _ { 1 } ^ { T } \\{ \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\} b _ { 2 } | } & { = \\| b _ { 2 } ^ { T } \\{ ( k _ { 2 } , k _ { 2 } ) - V ( k _ { 2 } , k _ { 2 } ) \\} b _ { 1 } \\| _ { 2 } = \\| b _ { 2 } ^ { T } \\{ ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\} b _ { 2 } \\| } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 478, + 418, + 1167, + 418, + 1167, + 463, + 478, + 463 + ], + "score": 0.89, + "latex": "\\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\quad \\forall a \\in \\{ 0 , 1 \\} , \\forall k \\geq j _ { n } ." + }, + { + "category_id": 13, + "poly": [ + 679, + 1214, + 718, + 1214, + 718, + 1245, + 679, + 1245 + ], + "score": 0.89, + "latex": "\\ell _ { \\infty }" + }, + { + "category_id": 14, + "poly": [ + 347, + 1446, + 1465, + 1446, + 1465, + 1661, + 347, + 1661 + ], + "score": 0.88, + "latex": "\\begin{array} { c } { { k _ { 1 } , k _ { 2 } ) = \\displaystyle { \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat \\beta _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) } } } \\\\ { { \\widehat { V } ^ { \\ast \\ast } ( k _ { 1 } , k _ { 2 } ) = \\displaystyle { \\frac { 1 } { \\sqrt { n ( t _ { k _ { 1 } } ) n ( t _ { k _ { 2 } } ) } } \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) \\varphi ( X _ { i } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( X _ { i } ) \\varphi ( X _ { i } ) \\varphi ( X _ { j } ) } } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 296, + 1285, + 779, + 1285, + 779, + 1326, + 296, + 1326 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1018, + 1214, + 1048, + 1214, + 1048, + 1241, + 1018, + 1241 + ], + "score": 0.81, + "latex": "V" + }, + { + "category_id": 14, + "poly": [ + 384, + 1355, + 1499, + 1355, + 1499, + 1401, + 384, + 1401 + ], + "score": 0.77, + "latex": "{ \\mathrm { ~ \\psi ~ } } _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) = \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) + \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) + \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) ," + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 855.0, + 72.0, + 855.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 227.0, + 640.0, + 227.0, + 640.0, + 264.0, + 294.0, + 264.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": [ + 828.0, + 2083.0, + 872.0, + 2083.0, + 872.0, + 2123.0, + 828.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 713.0, + 1351.0, + 713.0, + 1351.0, + 755.0, + 292.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 713.0, + 1405.0, + 713.0, + 1405.0, + 755.0, + 1401.0, + 755.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 745.0, + 725.0, + 745.0, + 725.0, + 788.0, + 291.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 784.0, + 745.0, + 923.0, + 745.0, + 923.0, + 788.0, + 784.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1291.0, + 745.0, + 1404.0, + 745.0, + 1404.0, + 788.0, + 1291.0, + 788.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 505.0, + 779.0, + 590.0, + 779.0, + 590.0, + 813.0, + 505.0, + 813.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 340.0, + 1179.0, + 340.0, + 1179.0, + 383.0, + 292.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 340.0, + 1405.0, + 340.0, + 1405.0, + 383.0, + 1252.0, + 383.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 289.0, + 369.0, + 297.0, + 369.0, + 297.0, + 416.0, + 289.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 369.0, + 900.0, + 369.0, + 900.0, + 416.0, + 520.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 369.0, + 1110.0, + 369.0, + 1110.0, + 416.0, + 1050.0, + 416.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 479.0, + 1179.0, + 479.0, + 1179.0, + 523.0, + 291.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1252.0, + 479.0, + 1405.0, + 479.0, + 1405.0, + 523.0, + 1252.0, + 523.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 511.0, + 296.0, + 511.0, + 296.0, + 554.0, + 291.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 520.0, + 511.0, + 900.0, + 511.0, + 900.0, + 554.0, + 520.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1050.0, + 511.0, + 1108.0, + 511.0, + 1108.0, + 554.0, + 1050.0, + 554.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 283.0, + 959.0, + 283.0, + 959.0, + 325.0, + 296.0, + 325.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1663.0, + 780.0, + 1663.0, + 780.0, + 1700.0, + 293.0, + 1700.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 994.0, + 345.0, + 994.0, + 345.0, + 1026.0, + 293.0, + 1026.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1205.0, + 678.0, + 1205.0, + 678.0, + 1249.0, + 294.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 719.0, + 1205.0, + 832.0, + 1205.0, + 832.0, + 1249.0, + 719.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1205.0, + 1017.0, + 1205.0, + 1017.0, + 1249.0, + 932.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1049.0, + 1205.0, + 1408.0, + 1205.0, + 1408.0, + 1249.0, + 1049.0, + 1249.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1243.0, + 503.0, + 1243.0, + 503.0, + 1295.0, + 290.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1405.0, + 1243.0, + 1409.0, + 1243.0, + 1409.0, + 1295.0, + 1405.0, + 1295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1286.0, + 295.0, + 1286.0, + 295.0, + 1330.0, + 290.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 780.0, + 1286.0, + 888.0, + 1286.0, + 888.0, + 1330.0, + 780.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 959.0, + 1286.0, + 1143.0, + 1286.0, + 1143.0, + 1330.0, + 959.0, + 1330.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1323.0, + 330.0, + 1323.0, + 330.0, + 1354.0, + 294.0, + 1354.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1351.0, + 383.0, + 1351.0, + 383.0, + 1408.0, + 291.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1500.0, + 1351.0, + 1507.0, + 1351.0, + 1507.0, + 1408.0, + 1500.0, + 1408.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1400.0, + 378.0, + 1400.0, + 378.0, + 1447.0, + 291.0, + 1447.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 25, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 317, + 832, + 1649, + 832, + 1649, + 1121, + 317, + 1121 + ], + "score": 0.963 + }, + { + "category_id": 8, + "poly": [ + 295, + 314, + 1503, + 314, + 1503, + 789, + 295, + 789 + ], + "score": 0.962 + }, + { + "category_id": 8, + "poly": [ + 374, + 1885, + 1269, + 1885, + 1269, + 2044, + 374, + 2044 + ], + "score": 0.959 + }, + { + "category_id": 8, + "poly": [ + 317, + 1169, + 1537, + 1169, + 1537, + 1632, + 317, + 1632 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 331, + 1688, + 1313, + 1688, + 1313, + 1834, + 331, + 1834 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 297, + 1128, + 619, + 1128, + 619, + 1160, + 297, + 1160 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 296, + 797, + 458, + 797, + 458, + 827, + 296, + 827 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 300, + 228, + 772, + 228, + 772, + 264, + 300, + 264 + ], + "score": 0.915 + }, + { + "category_id": 1, + "poly": [ + 298, + 1643, + 1139, + 1643, + 1139, + 1679, + 298, + 1679 + ], + "score": 0.909 + }, + { + "category_id": 1, + "poly": [ + 297, + 1843, + 1112, + 1843, + 1112, + 1877, + 297, + 1877 + ], + "score": 0.906 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.9 + }, + { + "category_id": 1, + "poly": [ + 296, + 277, + 427, + 277, + 427, + 309, + 296, + 309 + ], + "score": 0.884 + }, + { + "category_id": 9, + "poly": [ + 1350, + 1920, + 1402, + 1920, + 1402, + 1952, + 1350, + 1952 + ], + "score": 0.872 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 865, + 2087, + 865, + 2113, + 834, + 2113 + ], + "score": 0.861 + }, + { + "category_id": 9, + "poly": [ + 1469, + 1181, + 1523, + 1181, + 1523, + 1214, + 1469, + 1214 + ], + "score": 0.852 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1725, + 1402, + 1725, + 1402, + 1756, + 1351, + 1756 + ], + "score": 0.784 + }, + { + "category_id": 13, + "poly": [ + 902, + 1643, + 1084, + 1643, + 1084, + 1679, + 902, + 1679 + ], + "score": 0.92, + "latex": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 373, + 1881, + 1268, + 1881, + 1268, + 2047, + 373, + 2047 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } \\big ( A _ { i } = a \\big ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\} \\big ] \\right\\| _ { 2 } } \\\\ & { \\quad \\quad \\leq c _ { * } \\{ q \\delta _ { n ( t _ { k _ { 1 } } ) } + q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 979, + 1846, + 1058, + 1846, + 1058, + 1874, + 979, + 1874 + ], + "score": 0.92, + "latex": "c _ { * } > 0" + }, + { + "category_id": 13, + "poly": [ + 567, + 229, + 763, + 229, + 763, + 264, + 567, + 264 + ], + "score": 0.91, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 347, + 833, + 1465, + 833, + 1465, + 1126, + 347, + 1126 + ], + "score": 0.88, + "latex": "\\begin{array} { r l } { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\left\\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } } & { { } } \\\\ { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { \\top } \\mathbb { I } ( X _ { i } ) \\right\\| _ { 2 } ^ { 2 } } & { { } } \\\\ { \\displaystyle \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 2 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\displaystyle \\sum _ { a = 0 } ^ { 1 } \\sum _ { j = 1 } ^ { k _ { 1 } } \\sum _ { i = n ( t _ { j - 1 } ) + 1 } ^ { n ( t _ { j } ) } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { \\top } ( X _ { i } ) ( \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } ) ) \\varphi ( X _ { i } ) \\mathbb { I } ( \\beta _ { a } ) \\right\\| _ { 2 } ^ { 2 } } & { { } = 0 } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 347, + 1166, + 1465, + 1166, + 1465, + 1632, + 347, + 1632 + ], + "score": 0.87, + "latex": "\\begin{array} { r l } & { \\quad \\underset { 1 \\leq k \\leq k \\leq K } { \\operatorname* { m a x } } \\| \\hat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\| _ { 2 } } \\\\ & { \\quad \\underset { 1 \\leq k \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { K } \\| \\underset { 2 \\leq - 1 : = n ( \\{ k _ { 1 } , - 1 \\} + 1 ) } { \\overset { k _ { 1 } } { \\sum } } \\mathbb { \\overset { n ( k _ { 2 } ) } { \\sum } } \\mathbb { \\overset { \\eta ( A _ { i } ) } { = } } \\alpha ^ { \\top } ( X _ { i } ) \\boldsymbol { \\varphi } ^ { \\top } ( X _ { i } ) \\boldsymbol { \\{ \\varphi } } ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\boldsymbol { \\varphi } ^ { \\top } ( X _ { i } ) \\beta _ { a } ( t _ { 2 } ) \\boldsymbol { \\} ^ { 2 } \\| _ { 2 } } \\\\ & { \\quad \\underset { \\theta \\leq \\{ 0 , 1 \\} } { \\overset { \\operatorname* { m a x } } { = } } \\frac { 1 } { K } \\| \\underset { 1 \\leq k \\leq K } { \\sum } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } \\mathbb { \\overset { n ( k _ { 2 } ) } { = } } \\mathbb { \\overset { n ( k _ { 1 } ) } { = } } } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 332, + 1685, + 1307, + 1685, + 1307, + 1799, + 332, + 1799 + ], + "score": 0.79, + "latex": "\\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\| \\Psi _ { 1 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} \\left\\| \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\right\\| _ { 2 } ," + }, + { + "category_id": 14, + "poly": [ + 384, + 312, + 1499, + 312, + 1499, + 805, + 384, + 805 + ], + "score": 0.76, + "latex": "\\begin{array} { r l r } { { \\sum _ { i = 1 } ^ { n } \\operatorname { n u f f } _ { k \\to i } \\hat { \\mathcal { V } } ^ { * } ( k _ { 1 } , k _ { 2 } ) = \\sum _ { s = i } ^ { 1 } \\sum _ { i = 1 } ^ { k } \\sum _ { m \\in \\{ i , j \\} } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\xi _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big ] ^ { 2 } \\Sigma _ { a } ^ { - 1 } } } \\\\ & { } & { \\underset { = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { = 1 } { \\overset { n ( \\cdot ) } { \\sum } } \\sum _ { i = 1 } ^ { n } \\sum _ { ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) } \\xi ^ { \\top } ( X _ { i } ) \\big \\{ ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } + \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big ) ^ { 2 } \\Sigma _ { a } ^ { - 1 } } \\\\ & { } & { + \\sum _ { 1 } ^ { k _ { 1 } } \\sum _ { i = 0 } ^ { k } \\sum _ { \\beta = 1 } ^ { k } \\sum _ { \\beta = 1 } ^ { k } \\sum _ { 0 } ^ { k } \\sum _ { 0 } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\} \\hat { \\varphi } _ { a } - \\varphi ^ { \\top } ( X _ { i } ) \\hat { \\mathcal { B } } _ { a } ( t _ { j } ) \\big \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } } \\\\ & { } & + 2 \\sum _ { a = 0 } ^ { 1 } \\sum _ { i = 1 } ^ { k _ { 1 } } \\sum _ { \\beta = 1 } ^ { k _ { 2 } } \\sum _ { \\alpha } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { \\alpha } - \\varphi ^ { \\top } ( X _ { i } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 934, + 1408, + 1007, + 1408, + 1007, + 1430, + 934, + 1430 + ], + "score": 0.55, + "latex": "\\Psi _ { 1 , a , k _ { 1 } }" + }, + { + "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": [ + 830.0, + 2085.0, + 869.0, + 2085.0, + 869.0, + 2125.0, + 830.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1128.0, + 620.0, + 1128.0, + 620.0, + 1164.0, + 296.0, + 1164.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 795.0, + 461.0, + 795.0, + 461.0, + 830.0, + 293.0, + 830.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 226.0, + 566.0, + 226.0, + 566.0, + 269.0, + 296.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 764.0, + 226.0, + 774.0, + 226.0, + 774.0, + 269.0, + 764.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1642.0, + 901.0, + 1642.0, + 901.0, + 1682.0, + 295.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1085.0, + 1642.0, + 1138.0, + 1642.0, + 1138.0, + 1682.0, + 1085.0, + 1682.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1841.0, + 978.0, + 1841.0, + 978.0, + 1879.0, + 296.0, + 1879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1059.0, + 1841.0, + 1111.0, + 1841.0, + 1111.0, + 1879.0, + 1059.0, + 1879.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 275.0, + 429.0, + 275.0, + 429.0, + 309.0, + 294.0, + 309.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 26, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 317, + 1358, + 1459, + 1358, + 1459, + 1727, + 317, + 1727 + ], + "score": 0.949 + }, + { + "category_id": 8, + "poly": [ + 439, + 300, + 1204, + 300, + 1204, + 406, + 439, + 406 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 364, + 1778, + 1365, + 1778, + 1365, + 2043, + 364, + 2043 + ], + "score": 0.946 + }, + { + "category_id": 8, + "poly": [ + 297, + 611, + 1432, + 611, + 1432, + 718, + 297, + 718 + ], + "score": 0.945 + }, + { + "category_id": 1, + "poly": [ + 288, + 226, + 1406, + 226, + 1406, + 295, + 288, + 295 + ], + "score": 0.94 + }, + { + "category_id": 8, + "poly": [ + 452, + 1092, + 1191, + 1092, + 1191, + 1152, + 452, + 1152 + ], + "score": 0.937 + }, + { + "category_id": 8, + "poly": [ + 297, + 808, + 1436, + 808, + 1436, + 916, + 297, + 916 + ], + "score": 0.935 + }, + { + "category_id": 8, + "poly": [ + 411, + 1201, + 1230, + 1201, + 1230, + 1261, + 411, + 1261 + ], + "score": 0.934 + }, + { + "category_id": 1, + "poly": [ + 302, + 1054, + 764, + 1054, + 764, + 1087, + 302, + 1087 + ], + "score": 0.926 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 107, + 296, + 107 + ], + "score": 0.925 + }, + { + "category_id": 1, + "poly": [ + 300, + 539, + 1401, + 539, + 1401, + 604, + 300, + 604 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 296, + 1319, + 884, + 1319, + 884, + 1351, + 296, + 1351 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 296, + 411, + 899, + 411, + 899, + 443, + 296, + 443 + ], + "score": 0.914 + }, + { + "category_id": 1, + "poly": [ + 301, + 958, + 763, + 958, + 763, + 990, + 301, + 990 + ], + "score": 0.913 + }, + { + "category_id": 1, + "poly": [ + 299, + 1271, + 758, + 1271, + 758, + 1306, + 299, + 1306 + ], + "score": 0.909 + }, + { + "category_id": 8, + "poly": [ + 391, + 994, + 1247, + 994, + 1247, + 1037, + 391, + 1037 + ], + "score": 0.907 + }, + { + "category_id": 1, + "poly": [ + 297, + 1161, + 1176, + 1161, + 1176, + 1196, + 297, + 1196 + ], + "score": 0.893 + }, + { + "category_id": 1, + "poly": [ + 295, + 762, + 1314, + 762, + 1314, + 800, + 295, + 800 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1350, + 451, + 1402, + 451, + 1402, + 483, + 1350, + 483 + ], + "score": 0.89 + }, + { + "category_id": 1, + "poly": [ + 292, + 1738, + 1314, + 1738, + 1314, + 1774, + 292, + 1774 + ], + "score": 0.886 + }, + { + "category_id": 1, + "poly": [ + 298, + 492, + 758, + 492, + 758, + 527, + 298, + 527 + ], + "score": 0.868 + }, + { + "category_id": 9, + "poly": [ + 1349, + 1213, + 1402, + 1213, + 1402, + 1245, + 1349, + 1245 + ], + "score": 0.867 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 866, + 2087, + 866, + 2114, + 834, + 2114 + ], + "score": 0.862 + }, + { + "category_id": 8, + "poly": [ + 408, + 447, + 1236, + 447, + 1236, + 488, + 408, + 488 + ], + "score": 0.75 + }, + { + "category_id": 8, + "poly": [ + 1296, + 720, + 1435, + 720, + 1435, + 754, + 1296, + 754 + ], + "score": 0.231 + }, + { + "category_id": 8, + "poly": [ + 318, + 1358, + 1459, + 1358, + 1459, + 1729, + 318, + 1729 + ], + "score": 0.134 + }, + { + "category_id": 1, + "poly": [ + 401, + 445, + 1240, + 445, + 1240, + 527, + 401, + 527 + ], + "score": 0.127 + }, + { + "category_id": 8, + "poly": [ + 1146, + 918, + 1436, + 918, + 1436, + 955, + 1146, + 955 + ], + "score": 0.116 + }, + { + "category_id": 8, + "poly": [ + 401, + 445, + 1240, + 445, + 1240, + 527, + 401, + 527 + ], + "score": 0.11 + }, + { + "category_id": 13, + "poly": [ + 1079, + 763, + 1262, + 763, + 1262, + 799, + 1079, + 799 + ], + "score": 0.95, + "latex": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 581, + 228, + 768, + 228, + 768, + 264, + 581, + 264 + ], + "score": 0.93, + "latex": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 567, + 1161, + 749, + 1161, + 749, + 1197, + 567, + 1197 + ], + "score": 0.92, + "latex": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 366, + 759, + 684, + 759, + 684, + 803, + 366, + 803 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\sum _ { k _ { 1 } = 1 } ^ { K } n ^ { - 2 } ( t _ { k _ { 1 } } ) \\leq n ^ { - 1 } ( t _ { 1 } ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 260, + 479, + 260, + 479, + 295, + 298, + 295 + ], + "score": 0.92, + "latex": "1 - \\bar { O } ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 437, + 296, + 1204, + 296, + 1204, + 409, + 437, + 409 + ], + "score": 0.92, + "latex": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\{ \\mathbb I ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\} \\right\\| _ { 2 } = O ( 1 ) ." + }, + { + "category_id": 13, + "poly": [ + 1063, + 1739, + 1258, + 1739, + 1258, + 1774, + 1063, + 1774 + ], + "score": 0.92, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 364, + 1778, + 1361, + 1778, + 1361, + 2046, + 364, + 2046 + ], + "score": 0.92, + "latex": "\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\left\\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\leq O ( 1 ) ( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ) } \\\\ { \\times } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { j } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\right\\| , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 432, + 571, + 574, + 571, + 574, + 601, + 432, + 601 + ], + "score": 0.92, + "latex": "1 \\leq k _ { 1 } \\leq K" + }, + { + "category_id": 13, + "poly": [ + 1155, + 569, + 1347, + 569, + 1347, + 604, + 1155, + 604 + ], + "score": 0.92, + "latex": "1 - O ( n ^ { - 2 } ( t _ { k _ { 1 } } ) )" + }, + { + "category_id": 14, + "poly": [ + 322, + 1353, + 1428, + 1353, + 1428, + 1735, + 322, + 1735 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { \\underset { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } { \\operatorname* { m a x } } \\left\\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\leq \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\underset { j \\geq 1 } { \\operatorname* { m a x } } \\left\\| \\Sigma _ { a } ^ { - 1 } - \\widehat { \\Sigma } _ { a } ^ { - 1 } ( l _ { j } ) \\right\\| _ { 2 } } \\\\ { \\times } & { \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 2 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { j } ) } { \\sum } } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\right\\| _ { 2 } } \\\\ { + } & { \\underset { a = 0 } { \\overset { 1 } { \\sum } } \\underset { 1 \\leq k _ { 1 } \\leq K } { \\operatorname* { m a x } } \\frac { 1 } { n ( t _ { k _ { 1 } } ) } \\left\\| \\underset { j = 1 } { \\overset { k _ { 1 } } { \\sum } } \\underset { i = n ( t _ { j - 1 } ) + 1 } { \\overset { n ( t _ { i } ) } { \\sum } } \\Sigma _ { a } ^ { - 1 } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { a } ( t _ { j } ) \\} ^ { 2 } \\Sigma _ { a } ^ { - 1 } \\right\\| } \\\\ { \\times } & { \\underset { j \\geq 1 } { \\operatorname* { m a x } } \\| \\Sigma _ { a } ^ { - 1 } - \\widehat { \\Sigma } _ { a } ^ { - 1 } ( t _ { j } ) \\| _ { 2 } ^ { 2 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 310, + 606, + 1428, + 606, + 1428, + 719, + 310, + 719 + ], + "score": 0.91, + "latex": "\\frac { 1 } { \\iota ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { ( l ) } ( X _ { i } ) \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } ," + }, + { + "category_id": 13, + "poly": [ + 568, + 1270, + 749, + 1270, + 749, + 1306, + 568, + 1306 + ], + "score": 0.9, + "latex": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 452, + 1090, + 1188, + 1090, + 1188, + 1154, + 452, + 1154 + ], + "score": 0.89, + "latex": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) ," + }, + { + "category_id": 13, + "poly": [ + 568, + 491, + 749, + 491, + 749, + 528, + 568, + 528 + ], + "score": 0.89, + "latex": "1 - O ( n ^ { - 1 } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 411, + 1199, + 1229, + 1199, + 1229, + 1264, + 411, + 1264 + ], + "score": 0.88, + "latex": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { 1 } ) \\log ^ { 1 / 2 } n ( t _ { 1 } ) ," + }, + { + "category_id": 14, + "poly": [ + 394, + 991, + 1248, + 991, + 1248, + 1034, + 394, + 1034 + ], + "score": 0.86, + "latex": "\\begin{array} { r } { n ^ { - 1 } ( t _ { k _ { 1 } } ) \\| \\Psi _ { 2 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 3 / 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 405, + 445, + 1238, + 445, + 1238, + 487, + 405, + 487 + ], + "score": 0.85, + "latex": "\\begin{array} { r } { n ^ { - 1 } ( t _ { k 1 } ) \\| \\Psi _ { 1 , a , k _ { 1 } } \\| _ { 2 } \\preceq q ^ { 2 } n ^ { - 1 } ( t _ { 1 } ) \\log \\{ n ( t _ { 1 } ) \\} , \\forall 1 \\leq k _ { 1 } \\leq K , a \\in \\{ 0 , 1 \\} , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 310, + 805, + 1428, + 805, + 1428, + 921, + 310, + 921 + ], + "score": 0.82, + "latex": "\\frac { 1 } { \\iota ( t _ { k _ { 1 } } ) } \\left\\| \\sum _ { i = 1 } ^ { n ( t _ { k _ { 1 } } ) } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\varphi ^ { ( l ) } ( X _ { i } ) \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } n ^ { - 1 / 2 } ( t _ { k _ { 1 } } ) \\sqrt { \\log n ( t _ { k _ { 1 } } ) } ," + }, + { + "category_id": 13, + "poly": [ + 1336, + 2030, + 1348, + 2030, + 1348, + 2043, + 1336, + 2043 + ], + "score": 0.37, + "latex": "^ 2" + }, + { + "category_id": 13, + "poly": [ + 1296, + 719, + 1431, + 719, + 1431, + 754, + 1296, + 754 + ], + "score": 0.31, + "latex": "\\forall 1 \\leq l \\leq q ." + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 109.0, + 297.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2085.0, + 870.0, + 2085.0, + 870.0, + 2122.0, + 829.0, + 2122.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 225.0, + 580.0, + 225.0, + 580.0, + 267.0, + 293.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 769.0, + 225.0, + 1405.0, + 225.0, + 1405.0, + 267.0, + 769.0, + 267.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 480.0, + 257.0, + 535.0, + 257.0, + 535.0, + 295.0, + 480.0, + 295.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 1052.0, + 765.0, + 1052.0, + 765.0, + 1091.0, + 298.0, + 1091.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 538.0, + 1403.0, + 538.0, + 1403.0, + 574.0, + 295.0, + 574.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 568.0, + 431.0, + 568.0, + 431.0, + 608.0, + 295.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 568.0, + 1154.0, + 568.0, + 1154.0, + 608.0, + 575.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1348.0, + 568.0, + 1361.0, + 568.0, + 1361.0, + 608.0, + 1348.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1317.0, + 884.0, + 1317.0, + 884.0, + 1353.0, + 295.0, + 1353.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 407.0, + 902.0, + 407.0, + 902.0, + 450.0, + 295.0, + 450.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 958.0, + 765.0, + 958.0, + 765.0, + 994.0, + 296.0, + 994.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1266.0, + 567.0, + 1266.0, + 567.0, + 1313.0, + 294.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 1266.0, + 762.0, + 1266.0, + 762.0, + 1313.0, + 750.0, + 1313.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1158.0, + 566.0, + 1158.0, + 566.0, + 1203.0, + 294.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 1158.0, + 1176.0, + 1158.0, + 1176.0, + 1203.0, + 750.0, + 1203.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 280.0, + 738.0, + 365.0, + 738.0, + 365.0, + 820.0, + 280.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 685.0, + 738.0, + 1078.0, + 738.0, + 1078.0, + 820.0, + 685.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1263.0, + 738.0, + 1331.0, + 738.0, + 1331.0, + 820.0, + 1263.0, + 820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1735.0, + 1062.0, + 1735.0, + 1062.0, + 1777.0, + 292.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1259.0, + 1735.0, + 1315.0, + 1735.0, + 1315.0, + 1777.0, + 1259.0, + 1777.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 487.0, + 567.0, + 487.0, + 567.0, + 534.0, + 295.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 487.0, + 760.0, + 487.0, + 760.0, + 534.0, + 750.0, + 534.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 400.0, + 440.0, + 404.0, + 440.0, + 404.0, + 491.0, + 400.0, + 491.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 395.0, + 490.0, + 567.0, + 490.0, + 567.0, + 531.0, + 395.0, + 531.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 750.0, + 490.0, + 763.0, + 490.0, + 763.0, + 531.0, + 750.0, + 531.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 27, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 298, + 704, + 1405, + 704, + 1405, + 804, + 298, + 804 + ], + "score": 0.976 + }, + { + "category_id": 8, + "poly": [ + 319, + 1081, + 1453, + 1081, + 1453, + 1360, + 319, + 1360 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 318, + 1416, + 1454, + 1416, + 1454, + 1696, + 318, + 1696 + ], + "score": 0.969 + }, + { + "category_id": 8, + "poly": [ + 456, + 820, + 1186, + 820, + 1186, + 954, + 456, + 954 + ], + "score": 0.967 + }, + { + "category_id": 8, + "poly": [ + 295, + 1913, + 1469, + 1913, + 1469, + 2041, + 295, + 2041 + ], + "score": 0.965 + }, + { + "category_id": 1, + "poly": [ + 297, + 969, + 1404, + 969, + 1404, + 1066, + 297, + 1066 + ], + "score": 0.965 + }, + { + "category_id": 8, + "poly": [ + 546, + 311, + 1095, + 311, + 1095, + 389, + 546, + 389 + ], + "score": 0.956 + }, + { + "category_id": 1, + "poly": [ + 293, + 228, + 1402, + 228, + 1402, + 296, + 293, + 296 + ], + "score": 0.953 + }, + { + "category_id": 1, + "poly": [ + 298, + 539, + 1399, + 539, + 1399, + 606, + 298, + 606 + ], + "score": 0.953 + }, + { + "category_id": 8, + "poly": [ + 347, + 1762, + 1493, + 1762, + 1493, + 1852, + 347, + 1852 + ], + "score": 0.952 + }, + { + "category_id": 8, + "poly": [ + 405, + 622, + 1236, + 622, + 1236, + 685, + 405, + 685 + ], + "score": 0.947 + }, + { + "category_id": 8, + "poly": [ + 399, + 457, + 1242, + 457, + 1242, + 520, + 399, + 520 + ], + "score": 0.947 + }, + { + "category_id": 1, + "poly": [ + 298, + 402, + 1166, + 402, + 1166, + 442, + 298, + 442 + ], + "score": 0.933 + }, + { + "category_id": 1, + "poly": [ + 299, + 1712, + 839, + 1712, + 839, + 1746, + 299, + 1746 + ], + "score": 0.925 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 295, + 1863, + 977, + 1863, + 977, + 1898, + 295, + 1898 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 295, + 1376, + 345, + 1376, + 345, + 1405, + 295, + 1405 + ], + "score": 0.895 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 866, + 2087, + 866, + 2113, + 834, + 2113 + ], + "score": 0.875 + }, + { + "category_id": 14, + "poly": [ + 314, + 1080, + 1428, + 1080, + 1428, + 1363, + 314, + 1363 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\operatorname* { P r } ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\scriptscriptstyle { \\mathrm { M B } * } } - \\nu _ { k } \\right) \\le 0 \\right\\} \\le \\mathrm { E } ^ { * } \\mathtt { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , + } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) } \\\\ { \\le } & { \\mathrm { E } \\underline { { \\mathtt { g } } } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , + } \\} _ { k } } ( N ( 0 , V ) ) + O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) } \\\\ { \\le } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\overline { { \\mathtt { X } } } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , + } ^ { * } \\right) \\le 0 \\right\\} } \\\\ { + } & { O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 547, + 309, + 1095, + 309, + 1095, + 388, + 547, + 388 + ], + "score": 0.95, + "latex": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq K } \\left\\| { \\frac { 1 } { n ( t _ { k _ { 1 } } ) } } \\Psi _ { 3 , a , k _ { 1 } } - \\Psi _ { a } \\right\\| _ { 2 } = o ( 1 ) ." + }, + { + "category_id": 14, + "poly": [ + 315, + 1419, + 1428, + 1419, + 1428, + 1700, + 315, + 1700 + ], + "score": 0.94, + "latex": "\\begin{array} { r l } & { \\operatorname* { P r } ^ { * } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\scriptscriptstyle { \\mathrm { M B } * } } - \\nu _ { k } \\right) \\leq 0 \\right\\} \\geq \\mathrm { E } ^ { * } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , - } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) } \\\\ { \\geq } & { \\mathrm { E } \\mathrm { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k , - } \\} _ { k } } ( N ( 0 , V ) ) - O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) } \\\\ { \\geq } & { \\operatorname* { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , - } ^ { * } \\right) \\leq 0 \\right\\} } \\\\ { - } & { O ( 1 ) q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1190, + 705, + 1405, + 705, + 1405, + 740, + 1190, + 740 + ], + "score": 0.93, + "latex": "\\delta = \\eta ^ { - 1 } \\{ \\log K +" + }, + { + "category_id": 13, + "poly": [ + 568, + 260, + 764, + 260, + 764, + 296, + 568, + 296 + ], + "score": 0.93, + "latex": "1 \\stackrel { - } { - } O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 549, + 708, + 699, + 708, + 699, + 743, + 549, + 743 + ], + "score": 0.92, + "latex": "\\mathbf { g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } }" + }, + { + "category_id": 13, + "poly": [ + 298, + 771, + 493, + 771, + 493, + 804, + 298, + 804 + ], + "score": 0.92, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 298, + 1001, + 368, + 1001, + 368, + 1035, + 298, + 1035 + ], + "score": 0.92, + "latex": "\\{ \\nu _ { k } \\} _ { k }" + }, + { + "category_id": 13, + "poly": [ + 373, + 1714, + 432, + 1714, + 432, + 1747, + 373, + 1747 + ], + "score": 0.92, + "latex": "O ( 1 )" + }, + { + "category_id": 14, + "poly": [ + 456, + 817, + 1186, + 817, + 1186, + 958, + 456, + 958 + ], + "score": 0.92, + "latex": "\\begin{array} { r l r } & { } & { \\underset { \\{ \\nu _ { k } \\} _ { k } } { \\operatorname* { s u p } } \\left| { \\mathbf E } ^ { * } { \\mathbf g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , \\widehat { V } ) ) - { \\mathbf E } { \\mathbf g } _ { \\delta } \\circ \\phi _ { \\eta , \\{ \\nu _ { k } \\} _ { k } } ( N ( 0 , { \\pmb V } ) ) \\right| } \\\\ & { } & { \\preceq q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} \\left( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } \\right) , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 683, + 403, + 991, + 403, + 991, + 441, + 683, + 441 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\Psi _ { a } \\| _ { 2 } = O ( 1 ) } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 717, + 1032, + 913, + 1032, + 913, + 1065, + 717, + 1065 + ], + "score": 0.91, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 14, + "poly": [ + 404, + 620, + 1236, + 620, + 1236, + 685, + 404, + 685 + ], + "score": 0.91, + "latex": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\left\\| { \\widehat { V } } ( k _ { 1 } , k _ { 2 } ) - V ( k _ { 1 } , k _ { 2 } ) \\right\\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } + { \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } } ." + }, + { + "category_id": 14, + "poly": [ + 349, + 1758, + 1465, + 1758, + 1465, + 1856, + 349, + 1856 + ], + "score": 0.91, + "latex": "\\begin{array} { r l } & { \\nu _ { k , + } = \\nu _ { k } + \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \\nu _ { k , + } ^ { * } = \\nu _ { k , + } + 3 \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} } \\\\ & { \\nu _ { k , - } = \\nu _ { k } - 3 \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} - \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) , \\nu _ { k , - } ^ { * } = \\nu _ { k , - } - \\eta ^ { - 1 } \\{ 4 d \\log n ( t _ { 1 } ) + \\log K \\} } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 683, + 572, + 878, + 572, + 878, + 606, + 683, + 606 + ], + "score": 0.91, + "latex": "1 - \\dot { O } ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 561, + 540, + 745, + 540, + 745, + 575, + 561, + 575 + ], + "score": 0.9, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 373, + 230, + 433, + 230, + 433, + 264, + 373, + 264 + ], + "score": 0.9, + "latex": "O ( 1 )" + }, + { + "category_id": 14, + "poly": [ + 399, + 455, + 1241, + 455, + 1241, + 521, + 399, + 521 + ], + "score": 0.9, + "latex": "\\operatorname* { m a x } _ { 1 \\leq k _ { 1 } \\leq k _ { 2 } \\leq K } \\Big \\| \\widehat { V } ( k _ { 1 } , k _ { 2 } ) - \\widehat { V } ^ { * } ( k _ { 1 } , k _ { 2 } ) \\Big \\| _ { 2 } \\preceq q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ," + }, + { + "category_id": 13, + "poly": [ + 298, + 738, + 448, + 738, + 448, + 772, + 298, + 772 + ], + "score": 0.88, + "latex": "4 d \\log n ( t _ { 1 } ) \\}" + }, + { + "category_id": 14, + "poly": [ + 310, + 1911, + 1428, + 1911, + 1428, + 2045, + 310, + 2045 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\mathtt { p } _ { \\mathrm { T } } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , + } ^ { * } \\right) \\le 0 \\right\\} - \\mathtt { P r } \\left\\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } \\left( \\underset { x \\in \\mathbb { X } _ { 0 } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k , - } ^ { * } \\right) \\le 0 \\right\\} } \\\\ { \\preceq \\eta ^ { - 1 } \\{ \\log ^ { 3 / 2 } n ( t _ { 1 } ) + \\log ^ { 3 / 2 } K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \\{ \\log ^ { 1 / 2 } n ( t _ { 1 } ) + \\log ^ { 1 / 2 } K \\} . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 373, + 971, + 406, + 971, + 406, + 999, + 373, + 999 + ], + "score": 0.86, + "latex": "\\mathbf { E } ^ { \\ast }" + }, + { + "category_id": 13, + "poly": [ + 822, + 741, + 848, + 741, + 848, + 768, + 822, + 768 + ], + "score": 0.28, + "latex": "\\&" + }, + { + "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": [ + 828.0, + 2084.0, + 872.0, + 2084.0, + 872.0, + 2125.0, + 828.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 700.0, + 548.0, + 700.0, + 548.0, + 748.0, + 292.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 700.0, + 700.0, + 1189.0, + 700.0, + 1189.0, + 748.0, + 700.0, + 748.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 736.0, + 297.0, + 736.0, + 297.0, + 774.0, + 293.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 736.0, + 821.0, + 736.0, + 821.0, + 774.0, + 449.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 849.0, + 736.0, + 1405.0, + 736.0, + 1405.0, + 774.0, + 849.0, + 774.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 766.0, + 297.0, + 766.0, + 297.0, + 806.0, + 293.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 494.0, + 766.0, + 551.0, + 766.0, + 551.0, + 806.0, + 494.0, + 806.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 969.0, + 372.0, + 969.0, + 372.0, + 1004.0, + 296.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 407.0, + 969.0, + 1404.0, + 969.0, + 1404.0, + 1004.0, + 407.0, + 1004.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 369.0, + 1002.0, + 1405.0, + 1002.0, + 1405.0, + 1037.0, + 369.0, + 1037.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1031.0, + 716.0, + 1031.0, + 716.0, + 1066.0, + 293.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 914.0, + 1031.0, + 967.0, + 1031.0, + 967.0, + 1066.0, + 914.0, + 1066.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 229.0, + 372.0, + 229.0, + 372.0, + 266.0, + 296.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 434.0, + 229.0, + 1404.0, + 229.0, + 1404.0, + 266.0, + 434.0, + 266.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 258.0, + 567.0, + 258.0, + 567.0, + 299.0, + 295.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 258.0, + 820.0, + 258.0, + 820.0, + 299.0, + 765.0, + 299.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 537.0, + 560.0, + 537.0, + 560.0, + 578.0, + 294.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 746.0, + 537.0, + 1404.0, + 537.0, + 1404.0, + 578.0, + 746.0, + 578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 571.0, + 682.0, + 571.0, + 682.0, + 608.0, + 294.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 879.0, + 571.0, + 934.0, + 571.0, + 934.0, + 608.0, + 879.0, + 608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 400.0, + 682.0, + 400.0, + 682.0, + 445.0, + 295.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 992.0, + 400.0, + 1167.0, + 400.0, + 1167.0, + 445.0, + 992.0, + 445.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1710.0, + 372.0, + 1710.0, + 372.0, + 1750.0, + 295.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 433.0, + 1710.0, + 839.0, + 1710.0, + 839.0, + 1750.0, + 433.0, + 1750.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1863.0, + 977.0, + 1863.0, + 977.0, + 1902.0, + 294.0, + 1902.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1374.0, + 345.0, + 1374.0, + 345.0, + 1406.0, + 292.0, + 1406.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 28, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 300, + 1526, + 1402, + 1526, + 1402, + 1627, + 300, + 1627 + ], + "score": 0.972 + }, + { + "category_id": 8, + "poly": [ + 298, + 274, + 1444, + 274, + 1444, + 469, + 298, + 469 + ], + "score": 0.964 + }, + { + "category_id": 8, + "poly": [ + 297, + 792, + 1407, + 792, + 1407, + 890, + 297, + 890 + ], + "score": 0.957 + }, + { + "category_id": 1, + "poly": [ + 295, + 1760, + 1402, + 1760, + 1402, + 1828, + 295, + 1828 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 492, + 964, + 1148, + 964, + 1148, + 1011, + 492, + 1011 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 452, + 1650, + 1193, + 1650, + 1193, + 1739, + 452, + 1739 + ], + "score": 0.941 + }, + { + "category_id": 8, + "poly": [ + 444, + 1216, + 1276, + 1216, + 1276, + 1510, + 444, + 1510 + ], + "score": 0.939 + }, + { + "category_id": 1, + "poly": [ + 294, + 1028, + 1058, + 1028, + 1058, + 1066, + 294, + 1066 + ], + "score": 0.931 + }, + { + "category_id": 1, + "poly": [ + 297, + 602, + 612, + 602, + 612, + 636, + 297, + 636 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 292, + 908, + 1305, + 908, + 1305, + 946, + 292, + 946 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 296, + 1167, + 426, + 1167, + 426, + 1198, + 296, + 1198 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 297, + 483, + 820, + 483, + 820, + 519, + 297, + 519 + ], + "score": 0.92 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 107, + 296, + 107 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 297, + 1106, + 612, + 1106, + 612, + 1138, + 297, + 1138 + ], + "score": 0.916 + }, + { + "category_id": 0, + "poly": [ + 299, + 678, + 611, + 678, + 611, + 711, + 299, + 711 + ], + "score": 0.912 + }, + { + "category_id": 1, + "poly": [ + 295, + 1999, + 1056, + 1999, + 1056, + 2038, + 295, + 2038 + ], + "score": 0.903 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1679, + 1401, + 1679, + 1401, + 1711, + 1351, + 1711 + ], + "score": 0.894 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1444, + 1401, + 1444, + 1401, + 1475, + 1351, + 1475 + ], + "score": 0.89 + }, + { + "category_id": 1, + "poly": [ + 296, + 737, + 830, + 737, + 830, + 772, + 296, + 772 + ], + "score": 0.887 + }, + { + "category_id": 8, + "poly": [ + 379, + 538, + 1317, + 538, + 1317, + 584, + 379, + 584 + ], + "score": 0.885 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 866, + 2087, + 866, + 2113, + 835, + 2113 + ], + "score": 0.873 + }, + { + "category_id": 1, + "poly": [ + 297, + 229, + 458, + 229, + 458, + 262, + 297, + 262 + ], + "score": 0.871 + }, + { + "category_id": 8, + "poly": [ + 302, + 1848, + 1343, + 1848, + 1343, + 1983, + 302, + 1983 + ], + "score": 0.813 + }, + { + "category_id": 8, + "poly": [ + 304, + 1848, + 1319, + 1848, + 1319, + 1943, + 304, + 1943 + ], + "score": 0.337 + }, + { + "category_id": 8, + "poly": [ + 444, + 1216, + 1276, + 1216, + 1276, + 1509, + 444, + 1509 + ], + "score": 0.276 + }, + { + "category_id": 14, + "poly": [ + 447, + 1216, + 1275, + 1216, + 1275, + 1512, + 447, + 1512 + ], + "score": 0.95, + "latex": "\\begin{array} { r l } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ) ^ { 2 } - \\Phi _ { a } \\right\\| _ { 2 } } \\\\ { \\le } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) [ \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) ] \\right\\| _ { 2 } } \\\\ { + } & { \\left\\| \\frac { 1 } { k } \\displaystyle \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\sigma ^ { 2 } ( a , X _ { i } ) - \\Phi _ { a } \\right\\| _ { 2 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 568, + 1029, + 702, + 1029, + 702, + 1065, + 568, + 1065 + ], + "score": 0.95, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 568, + 909, + 702, + 909, + 702, + 945, + 568, + 945 + ], + "score": 0.94, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 568, + 2001, + 702, + 2001, + 702, + 2036, + 568, + 2036 + ], + "score": 0.94, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 807, + 1561, + 931, + 1561, + 931, + 1596, + 807, + 1596 + ], + "score": 0.93, + "latex": "a \\in \\{ 0 , 1 \\}" + }, + { + "category_id": 14, + "poly": [ + 451, + 1645, + 1193, + 1645, + 1193, + 1743, + 451, + 1743 + ], + "score": 0.93, + "latex": "\\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) \\{ ( Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } ) ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) \\}" + }, + { + "category_id": 13, + "poly": [ + 568, + 484, + 764, + 484, + 764, + 520, + 568, + 520 + ], + "score": 0.92, + "latex": "1 - O ( n ^ { - \\alpha _ { 0 } } ( t _ { 1 } ) )" + }, + { + "category_id": 13, + "poly": [ + 439, + 1558, + 705, + 1558, + 705, + 1597, + 439, + 1597 + ], + "score": 0.92, + "latex": "O ( q \\delta _ { k } + \\sqrt { q k ^ { - 1 } \\log k } )" + }, + { + "category_id": 14, + "poly": [ + 295, + 1845, + 1339, + 1845, + 1339, + 1980, + 295, + 1980 + ], + "score": 0.92, + "latex": "\\left. \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) [ \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} ^ { 2 } - \\sigma ^ { 2 } ( a , X _ { i } ) ] \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } ," + }, + { + "category_id": 13, + "poly": [ + 298, + 1593, + 447, + 1593, + 447, + 1627, + 298, + 1627 + ], + "score": 0.92, + "latex": "1 - O \\big ( j _ { n } ^ { - \\alpha _ { 0 } } \\big )" + }, + { + "category_id": 13, + "poly": [ + 1032, + 1562, + 1118, + 1562, + 1118, + 1595, + 1032, + 1595 + ], + "score": 0.91, + "latex": "k \\geq j _ { n }" + }, + { + "category_id": 13, + "poly": [ + 933, + 1762, + 1147, + 1762, + 1147, + 1796, + 933, + 1796 + ], + "score": 0.91, + "latex": "\\{ \\sigma ( \\mathcal { F } _ { i - 1 } ) : i \\ge 1 \\}" + }, + { + "category_id": 14, + "poly": [ + 310, + 791, + 1406, + 791, + 1406, + 890, + 310, + 890 + ], + "score": 0.9, + "latex": "\\left. \\Sigma _ { a } ^ { - 1 } \\left( \\frac { 1 } { k } \\sum _ { i = 1 } ^ { k } \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right) \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } , a \\in \\{ 0 , 1 \\} ," + }, + { + "category_id": 14, + "poly": [ + 310, + 275, + 1428, + 275, + 1428, + 471, + 310, + 471 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { \\underset { \\nu _ { k } \\not \\mathrm { J } _ { k } } { \\operatorname* { s u p } } | { \\operatorname* { P r } } ^ { * } \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\sqrt { n ( t _ { k } ) } \\widehat { S } ^ { \\mathrm { M B } * } - \\nu _ { k } ) \\leq 0 \\} - { \\operatorname* { P r } } \\{ \\underset { k \\in \\{ 1 , \\ldots , K \\} } { \\operatorname* { m a x } } ( \\underset { x \\in \\mathbb { X } } { \\operatorname* { s u p } } \\varphi ^ { \\top } ( x ) G ( t _ { k } ) - \\nu _ { k } ) \\leq 0 \\} } \\\\ { \\preceq q \\eta ^ { 2 } \\{ \\log ^ { 2 } K + \\log ^ { 2 } n ( t _ { 1 } ) \\} ( q \\delta _ { n ( t _ { 1 } ) } + \\sqrt { q n ^ { - 1 } ( t _ { 1 } ) \\log n ( t _ { 1 } ) } ) } \\\\ { + \\eta ^ { - 1 } \\{ \\log ^ { 3 / 2 } n ( t _ { 1 } ) + \\log ^ { 3 / 2 } K \\} + \\bar { c } ^ { * } n ^ { - 2 } ( t _ { 1 } ) \\{ \\log ^ { 1 / 2 } n ( t _ { 1 } ) + \\log ^ { 1 / 2 } K \\} } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 494, + 963, + 1148, + 963, + 1148, + 1009, + 494, + 1009 + ], + "score": 0.88, + "latex": "\\begin{array} { r } { \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } , a \\in \\{ 0 , 1 \\} , } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 382, + 537, + 1316, + 537, + 1316, + 583, + 382, + 583 + ], + "score": 0.87, + "latex": "\\eta = \\operatorname* { m i n } [ q ^ { - 1 } n ^ { \\alpha _ { 0 } / 3 } ( t _ { 1 } ) \\log ^ { - ( 1 + 2 \\alpha _ { 0 } ) / 6 } \\{ K n ( t _ { 1 } ) \\} , q ^ { - 1 / 2 } n ^ { 1 / 6 } ( t _ { 1 } ) \\log ^ { - 1 / 3 } \\{ K n ( t _ { 1 } ) \\} ] ," + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 109.0, + 297.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1101.0, + 615.0, + 1101.0, + 615.0, + 1143.0, + 293.0, + 1143.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 677.0, + 613.0, + 677.0, + 613.0, + 713.0, + 296.0, + 713.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": [ + 296.0, + 1526.0, + 1404.0, + 1526.0, + 1404.0, + 1561.0, + 296.0, + 1561.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1560.0, + 438.0, + 1560.0, + 438.0, + 1599.0, + 294.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 706.0, + 1560.0, + 806.0, + 1560.0, + 806.0, + 1599.0, + 706.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 932.0, + 1560.0, + 1031.0, + 1560.0, + 1031.0, + 1599.0, + 932.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1119.0, + 1560.0, + 1406.0, + 1560.0, + 1406.0, + 1599.0, + 1119.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 1589.0, + 297.0, + 1589.0, + 297.0, + 1629.0, + 291.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 448.0, + 1589.0, + 1120.0, + 1589.0, + 1120.0, + 1629.0, + 448.0, + 1629.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1764.0, + 932.0, + 1764.0, + 932.0, + 1797.0, + 297.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1148.0, + 1764.0, + 1402.0, + 1764.0, + 1402.0, + 1797.0, + 1148.0, + 1797.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1793.0, + 1317.0, + 1793.0, + 1317.0, + 1829.0, + 297.0, + 1829.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1027.0, + 567.0, + 1027.0, + 567.0, + 1070.0, + 295.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 1027.0, + 1058.0, + 1027.0, + 1058.0, + 1070.0, + 703.0, + 1070.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 601.0, + 614.0, + 601.0, + 614.0, + 636.0, + 295.0, + 636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 907.0, + 567.0, + 907.0, + 567.0, + 951.0, + 294.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 907.0, + 1310.0, + 907.0, + 1310.0, + 951.0, + 703.0, + 951.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1162.0, + 429.0, + 1162.0, + 429.0, + 1201.0, + 293.0, + 1201.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 481.0, + 567.0, + 481.0, + 567.0, + 522.0, + 294.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 481.0, + 822.0, + 481.0, + 822.0, + 522.0, + 765.0, + 522.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1998.0, + 567.0, + 1998.0, + 567.0, + 2041.0, + 295.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 1998.0, + 1058.0, + 1998.0, + 1058.0, + 2041.0, + 703.0, + 2041.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 298.0, + 737.0, + 831.0, + 737.0, + 831.0, + 773.0, + 298.0, + 773.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 229.0, + 460.0, + 229.0, + 460.0, + 262.0, + 295.0, + 262.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 29, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 8, + "poly": [ + 333, + 359, + 1307, + 359, + 1307, + 550, + 333, + 550 + ], + "score": 0.971 + }, + { + "category_id": 8, + "poly": [ + 362, + 976, + 1280, + 976, + 1280, + 1165, + 362, + 1165 + ], + "score": 0.967 + }, + { + "category_id": 1, + "poly": [ + 294, + 1602, + 1402, + 1602, + 1402, + 1668, + 294, + 1668 + ], + "score": 0.948 + }, + { + "category_id": 8, + "poly": [ + 337, + 1681, + 1310, + 1681, + 1310, + 1772, + 337, + 1772 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 391, + 768, + 1250, + 768, + 1250, + 900, + 391, + 900 + ], + "score": 0.944 + }, + { + "category_id": 1, + "poly": [ + 295, + 282, + 1403, + 282, + 1403, + 353, + 295, + 353 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 334, + 612, + 1303, + 612, + 1303, + 707, + 334, + 707 + ], + "score": 0.942 + }, + { + "category_id": 8, + "poly": [ + 555, + 1826, + 1089, + 1826, + 1089, + 1889, + 555, + 1889 + ], + "score": 0.941 + }, + { + "category_id": 1, + "poly": [ + 293, + 1904, + 1404, + 1904, + 1404, + 1971, + 293, + 1971 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 296, + 1781, + 1023, + 1781, + 1023, + 1815, + 296, + 1815 + ], + "score": 0.927 + }, + { + "category_id": 1, + "poly": [ + 295, + 718, + 1020, + 718, + 1020, + 754, + 295, + 754 + ], + "score": 0.924 + }, + { + "category_id": 1, + "poly": [ + 293, + 564, + 1030, + 564, + 1030, + 599, + 293, + 599 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 297, + 928, + 655, + 928, + 655, + 960, + 297, + 960 + ], + "score": 0.921 + }, + { + "category_id": 1, + "poly": [ + 296, + 1175, + 1038, + 1175, + 1038, + 1210, + 296, + 1210 + ], + "score": 0.918 + }, + { + "category_id": 8, + "poly": [ + 400, + 1981, + 1244, + 1981, + 1244, + 2042, + 400, + 2042 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 296, + 1363, + 980, + 1363, + 980, + 1401, + 296, + 1401 + ], + "score": 0.913 + }, + { + "category_id": 1, + "poly": [ + 299, + 1555, + 711, + 1555, + 711, + 1591, + 299, + 1591 + ], + "score": 0.907 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.901 + }, + { + "category_id": 0, + "poly": [ + 298, + 228, + 628, + 228, + 628, + 262, + 298, + 262 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1350, + 797, + 1401, + 797, + 1401, + 829, + 1350, + 829 + ], + "score": 0.889 + }, + { + "category_id": 8, + "poly": [ + 305, + 1411, + 1338, + 1411, + 1338, + 1544, + 305, + 1544 + ], + "score": 0.886 + }, + { + "category_id": 9, + "poly": [ + 1350, + 642, + 1401, + 642, + 1401, + 674, + 1350, + 674 + ], + "score": 0.885 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1444, + 1401, + 1444, + 1401, + 1475, + 1352, + 1475 + ], + "score": 0.865 + }, + { + "category_id": 9, + "poly": [ + 1352, + 1253, + 1402, + 1253, + 1402, + 1284, + 1352, + 1284 + ], + "score": 0.858 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 863, + 2087, + 863, + 2113, + 834, + 2113 + ], + "score": 0.796 + }, + { + "category_id": 8, + "poly": [ + 308, + 1223, + 1330, + 1223, + 1330, + 1316, + 308, + 1316 + ], + "score": 0.78 + }, + { + "category_id": 8, + "poly": [ + 308, + 1413, + 1333, + 1413, + 1333, + 1508, + 308, + 1508 + ], + "score": 0.238 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 863, + 2087, + 863, + 2114, + 834, + 2114 + ], + "score": 0.096 + }, + { + "category_id": 8, + "poly": [ + 1222, + 1320, + 1330, + 1320, + 1330, + 1355, + 1222, + 1355 + ], + "score": 0.095 + }, + { + "category_id": 14, + "poly": [ + 333, + 355, + 1308, + 355, + 1308, + 554, + 333, + 554 + ], + "score": 0.95, + "latex": "\\begin{array} { r } { \\displaystyle \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } = \\displaystyle \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left\\| \\widehat { \\boldsymbol { \\Sigma } } _ { a , k } ^ { - 1 } \\left( \\displaystyle \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right) \\right\\| _ { 2 } } \\\\ { \\leq \\displaystyle \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\widehat { \\boldsymbol { \\Sigma } } _ { a , k } ^ { - 1 } \\right\\| _ { 2 a \\in \\{ 0 , 1 \\} } \\displaystyle \\operatorname* { m a x } _ { k } \\left\\| \\displaystyle \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } . } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 328, + 1679, + 1313, + 1679, + 1313, + 1773, + 328, + 1773 + ], + "score": 0.94, + "latex": "\\operatorname* { i n f } _ { a \\in \\{ 0 , 1 \\} , n \\geq j _ { n } } \\lambda _ { \\operatorname* { m i n } } \\left( \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\frac { 1 } { n } \\sum _ { i = 1 } ^ { n } \\pi _ { i - 1 } ( a , X ) \\right) \\geq \\frac { n - N _ { 0 } } { n } \\varepsilon _ { 0 } \\geq \\frac { j - N _ { 0 } } { j } \\varepsilon _ { 0 } ." + }, + { + "category_id": 14, + "poly": [ + 359, + 972, + 1282, + 972, + 1282, + 1168, + 359, + 1168 + ], + "score": 0.94, + "latex": "\\begin{array} { r l r } & { } & { \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } ~ \\lambda _ { \\mathrm { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m i n } } ~ \\lambda _ { \\mathrm { m i n } } \\left( \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\frac { 1 } { k } \\underset { i = 1 } { \\overset { k } { \\sum } } \\pi _ { i - 1 } ( a , X ) \\right) } \\\\ & { } & { - \\underset { a \\in \\{ 0 , 1 \\} } { \\operatorname* { m a x } } ~ \\frac { 1 } { k } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ \\mathbb { I } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathrm { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 567, + 1365, + 702, + 1365, + 702, + 1401, + 567, + 1401 + ], + "score": 0.93, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 14, + "poly": [ + 339, + 610, + 1304, + 610, + 1304, + 708, + 339, + 708 + ], + "score": 0.93, + "latex": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left. \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right. _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log k } , \\forall k \\geq j _ { n } ." + }, + { + "category_id": 13, + "poly": [ + 832, + 718, + 967, + 718, + 967, + 755, + 832, + 755 + ], + "score": 0.93, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 14, + "poly": [ + 554, + 1824, + 1085, + 1824, + 1085, + 1891, + 554, + 1891 + ], + "score": 0.92, + "latex": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\lambda _ { \\operatorname* { m i n } } [ \\widehat { \\Sigma } _ { a , k } ] \\geq \\frac { \\varepsilon _ { 0 } } { 2 } , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } ," + }, + { + "category_id": 13, + "poly": [ + 841, + 563, + 976, + 563, + 976, + 600, + 841, + 600 + ], + "score": 0.92, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 568, + 1556, + 703, + 1556, + 703, + 1592, + 568, + 1592 + ], + "score": 0.92, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 866, + 1906, + 999, + 1906, + 999, + 1941, + 866, + 1941 + ], + "score": 0.92, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 783, + 281, + 1073, + 281, + 1073, + 324, + 783, + 324 + ], + "score": 0.92, + "latex": "\\begin{array} { r } { \\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 1062, + 1604, + 1250, + 1604, + 1250, + 1638, + 1062, + 1638 + ], + "score": 0.92, + "latex": "\\pi _ { i - 1 } ( a , x ) \\geq \\varepsilon _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 502, + 1636, + 586, + 1636, + 586, + 1665, + 502, + 1665 + ], + "score": 0.91, + "latex": "i \\geq N _ { 0 }" + }, + { + "category_id": 14, + "poly": [ + 393, + 765, + 1246, + 765, + 1246, + 863, + 393, + 863 + ], + "score": 0.91, + "latex": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\frac { 1 } { k } \\left\\| \\sum _ { i = 1 } ^ { k } \\varphi ( X _ { i } ) \\mathbb { I } ( A _ { i } = a ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { a } \\} \\right\\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log j _ { n } } ," + }, + { + "category_id": 13, + "poly": [ + 501, + 1908, + 585, + 1908, + 585, + 1938, + 501, + 1938 + ], + "score": 0.91, + "latex": "L ^ { * } \\geq 1" + }, + { + "category_id": 13, + "poly": [ + 695, + 1604, + 808, + 1604, + 808, + 1638, + 695, + 1638 + ], + "score": 0.91, + "latex": "\\varepsilon _ { 0 } \\leq 1 / 2" + }, + { + "category_id": 14, + "poly": [ + 309, + 1219, + 1331, + 1219, + 1331, + 1318, + 309, + 1318 + ], + "score": 0.9, + "latex": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ { \\mathbb { I } } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log k } ," + }, + { + "category_id": 14, + "poly": [ + 401, + 1980, + 1238, + 1980, + 1238, + 2043, + 401, + 2043 + ], + "score": 0.88, + "latex": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\| \\widehat { \\beta } _ { a , k } - \\beta _ { a } \\| _ { 2 } \\preceq q ^ { 1 / 2 } k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) } , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } ," + }, + { + "category_id": 14, + "poly": [ + 305, + 1410, + 1336, + 1410, + 1336, + 1510, + 305, + 1510 + ], + "score": 0.86, + "latex": "\\operatorname* { m a x } _ { a \\in \\{ 0 , 1 \\} } \\left\\| \\sum _ { i = 1 } ^ { k } \\{ { \\mathbb { I } } ( A _ { i } = a ) \\varphi ( X _ { i } ) \\varphi ^ { \\top } ( X _ { i } ) - \\mathbf { E } ^ { \\mathcal { F } _ { i - 1 } } \\pi _ { i - 1 } ( a , X ) \\varphi ( X ) \\varphi ^ { \\top } ( X ) \\} \\right\\| _ { 2 } \\preceq \\sqrt { q k \\log j _ { n } } ," + }, + { + "category_id": 13, + "poly": [ + 299, + 1634, + 367, + 1634, + 367, + 1668, + 299, + 1668 + ], + "score": 0.84, + "latex": "\\{ 0 , 1 \\}" + }, + { + "category_id": 13, + "poly": [ + 1354, + 1607, + 1404, + 1607, + 1404, + 1636, + 1354, + 1636 + ], + "score": 0.82, + "latex": "a \\in" + }, + { + "category_id": 13, + "poly": [ + 379, + 1635, + 453, + 1635, + 453, + 1664, + 379, + 1664 + ], + "score": 0.76, + "latex": "x \\in \\mathbb { X }" + }, + { + "category_id": 13, + "poly": [ + 298, + 1634, + 451, + 1634, + 451, + 1668, + 298, + 1668 + ], + "score": 0.25, + "latex": "\\{ 0 , 1 \\} , x \\in \\mathbb { X }" + }, + { + "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, + 227.0, + 629.0, + 227.0, + 629.0, + 264.0, + 295.0, + 264.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 830.0, + 2084.0, + 868.0, + 2084.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, + 2123.0, + 830.0, + 2123.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1599.0, + 694.0, + 1599.0, + 694.0, + 1642.0, + 293.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 809.0, + 1599.0, + 1061.0, + 1599.0, + 1061.0, + 1642.0, + 809.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1251.0, + 1599.0, + 1353.0, + 1599.0, + 1353.0, + 1642.0, + 1251.0, + 1642.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 454.0, + 1632.0, + 501.0, + 1632.0, + 501.0, + 1669.0, + 454.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 587.0, + 1632.0, + 1161.0, + 1632.0, + 1161.0, + 1669.0, + 587.0, + 1669.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 279.0, + 782.0, + 279.0, + 782.0, + 327.0, + 292.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1074.0, + 279.0, + 1408.0, + 279.0, + 1408.0, + 327.0, + 1074.0, + 327.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 311.0, + 360.0, + 311.0, + 360.0, + 356.0, + 292.0, + 356.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1902.0, + 500.0, + 1902.0, + 500.0, + 1947.0, + 292.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 586.0, + 1902.0, + 865.0, + 1902.0, + 865.0, + 1947.0, + 586.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1000.0, + 1902.0, + 1406.0, + 1902.0, + 1406.0, + 1947.0, + 1000.0, + 1947.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1936.0, + 559.0, + 1936.0, + 559.0, + 1973.0, + 293.0, + 1973.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1778.0, + 1023.0, + 1778.0, + 1023.0, + 1821.0, + 296.0, + 1821.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 717.0, + 831.0, + 717.0, + 831.0, + 757.0, + 296.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 968.0, + 717.0, + 1020.0, + 717.0, + 1020.0, + 757.0, + 968.0, + 757.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 563.0, + 840.0, + 563.0, + 840.0, + 603.0, + 295.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 977.0, + 563.0, + 1030.0, + 563.0, + 1030.0, + 603.0, + 977.0, + 603.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 925.0, + 657.0, + 925.0, + 657.0, + 965.0, + 296.0, + 965.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 1174.0, + 1040.0, + 1174.0, + 1040.0, + 1214.0, + 297.0, + 1214.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1362.0, + 566.0, + 1362.0, + 566.0, + 1406.0, + 296.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 1362.0, + 980.0, + 1362.0, + 980.0, + 1406.0, + 703.0, + 1406.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 1552.0, + 567.0, + 1552.0, + 567.0, + 1599.0, + 294.0, + 1599.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 704.0, + 1552.0, + 714.0, + 1552.0, + 714.0, + 1599.0, + 704.0, + 1599.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 30, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 1, + "poly": [ + 297, + 710, + 1405, + 710, + 1405, + 857, + 297, + 857 + ], + "score": 0.978 + }, + { + "category_id": 1, + "poly": [ + 297, + 426, + 1399, + 426, + 1399, + 528, + 297, + 528 + ], + "score": 0.97 + }, + { + "category_id": 8, + "poly": [ + 322, + 1903, + 1498, + 1903, + 1498, + 2044, + 322, + 2044 + ], + "score": 0.956 + }, + { + "category_id": 8, + "poly": [ + 318, + 869, + 1407, + 869, + 1407, + 1380, + 318, + 1380 + ], + "score": 0.951 + }, + { + "category_id": 8, + "poly": [ + 582, + 1732, + 1060, + 1732, + 1060, + 1793, + 582, + 1793 + ], + "score": 0.949 + }, + { + "category_id": 1, + "poly": [ + 294, + 1655, + 1402, + 1655, + 1402, + 1719, + 294, + 1719 + ], + "score": 0.945 + }, + { + "category_id": 8, + "poly": [ + 602, + 1580, + 1041, + 1580, + 1041, + 1642, + 602, + 1642 + ], + "score": 0.943 + }, + { + "category_id": 1, + "poly": [ + 298, + 1534, + 1145, + 1534, + 1145, + 1569, + 298, + 1569 + ], + "score": 0.929 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 106, + 296, + 106 + ], + "score": 0.926 + }, + { + "category_id": 1, + "poly": [ + 298, + 1390, + 638, + 1390, + 638, + 1424, + 298, + 1424 + ], + "score": 0.924 + }, + { + "category_id": 0, + "poly": [ + 300, + 1466, + 807, + 1466, + 807, + 1502, + 300, + 1502 + ], + "score": 0.923 + }, + { + "category_id": 1, + "poly": [ + 301, + 1808, + 1145, + 1808, + 1145, + 1850, + 301, + 1850 + ], + "score": 0.922 + }, + { + "category_id": 1, + "poly": [ + 296, + 595, + 889, + 595, + 889, + 629, + 296, + 629 + ], + "score": 0.92 + }, + { + "category_id": 1, + "poly": [ + 297, + 276, + 616, + 276, + 616, + 310, + 297, + 310 + ], + "score": 0.916 + }, + { + "category_id": 1, + "poly": [ + 298, + 228, + 711, + 228, + 711, + 264, + 298, + 264 + ], + "score": 0.91 + }, + { + "category_id": 1, + "poly": [ + 295, + 378, + 1001, + 378, + 1001, + 415, + 295, + 415 + ], + "score": 0.905 + }, + { + "category_id": 8, + "poly": [ + 313, + 642, + 1319, + 642, + 1319, + 696, + 313, + 696 + ], + "score": 0.904 + }, + { + "category_id": 1, + "poly": [ + 296, + 1861, + 423, + 1861, + 423, + 1892, + 296, + 1892 + ], + "score": 0.897 + }, + { + "category_id": 8, + "poly": [ + 324, + 540, + 1304, + 540, + 1304, + 586, + 324, + 586 + ], + "score": 0.897 + }, + { + "category_id": 9, + "poly": [ + 1351, + 1591, + 1401, + 1591, + 1401, + 1622, + 1351, + 1622 + ], + "score": 0.891 + }, + { + "category_id": 9, + "poly": [ + 1351, + 330, + 1401, + 330, + 1401, + 362, + 1351, + 362 + ], + "score": 0.886 + }, + { + "category_id": 8, + "poly": [ + 331, + 322, + 1307, + 322, + 1307, + 368, + 331, + 368 + ], + "score": 0.878 + }, + { + "category_id": 9, + "poly": [ + 1352, + 653, + 1400, + 653, + 1400, + 685, + 1352, + 685 + ], + "score": 0.874 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 866, + 2087, + 866, + 2114, + 834, + 2114 + ], + "score": 0.703 + }, + { + "category_id": 2, + "poly": [ + 834, + 2087, + 866, + 2087, + 866, + 2114, + 834, + 2114 + ], + "score": 0.344 + }, + { + "category_id": 13, + "poly": [ + 567, + 228, + 702, + 228, + 702, + 265, + 567, + 265 + ], + "score": 0.94, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 14, + "poly": [ + 318, + 873, + 1427, + 873, + 1427, + 1381, + 318, + 1381 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } { { \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { i = 1 } ^ { K } \\Big \\{ \\underset { i = 1 } { \\overset { K } { \\sum } } \\{ \\alpha _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\} \\Big \\} \\Bigg \\{ \\underset { \\alpha \\in \\{ 0 , 1 \\} } { \\sum } \\sum _ { i = 1 } ^ { K } \\sum _ { i = 1 } ^ { K } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert } } \\\\ { + \\ } & { \\sum _ { \\alpha \\in \\{ 0 , 1 \\} } \\sum _ { i = K + 1 } ^ { K } \\sum _ { i = 1 } ^ { K } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\leq 2 L ^ { * } \\sqrt { \\| \\Phi \\| _ { 2 } } } \\\\ { + \\ } & { \\mathrm { a s t ~ } \\big \\{ \\underset { i = 1 } { \\overset { K } { \\sum } } \\big \\} \\sum _ { i = 1 } ^ { K } \\mathbb { E } ^ { I _ { i - 1 } } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\rvert > L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\} } \\\\ { + \\ } & { \\underset { \\mathrm { a s t ~ } \\{ 0 , 1 \\} + \\kappa = + 1 } { \\overset { K } { \\sum } } \\mathbb { E } ^ { I _ { i } } \\big \\lvert \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\rvert \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\rvert \\leq L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\} } \\\\ { + \\ } & \\underset { \\mathrm { a s t ~ } \\{ 0 , 1 \\} + \\kappa = + 1 } { \\overset { K } { \\sum } } \\mathbb { E } ^ { I _ { i } } \\cdot \\big \\| \\pi _ { i - 1 } ( \\alpha , X ) - \\pi ^ { * } ( \\alpha , X ) \\big \\| \\mathbb { E } \\big \\| \\mathcal { E } ^ { T } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\big \\| \\leq L \\bar { q } ^ { 1 - 1 / 2 } \\log ^ { 1 / 2 } \\delta \\big \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 316, + 1896, + 1428, + 1896, + 1428, + 2046, + 316, + 2046 + ], + "score": 0.93, + "latex": "\\begin{array} { r l } & { \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } } \\\\ { = } & { \\frac { 1 } { N ( t ) } \\displaystyle \\sum _ { i = 1 } ^ { N ( t ) } [ \\mathbb { I } ( A _ { i } = 1 ) \\widehat { \\Sigma } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } ^ { * } \\} - \\mathbb { I } ( A _ { i } = 0 ) \\widehat { \\Sigma } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\} ] } \\end{array}" + }, + { + "category_id": 14, + "poly": [ + 597, + 1579, + 1045, + 1579, + 1045, + 1645, + 597, + 1645 + ], + "score": 0.93, + "latex": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\varphi ^ { \\top } ( x ) \\{ { \\widehat { \\beta } } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - { \\widehat { \\beta } } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\} ." + }, + { + "category_id": 13, + "poly": [ + 854, + 379, + 989, + 379, + 989, + 415, + 854, + 415 + ], + "score": 0.93, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 856, + 821, + 990, + 821, + 990, + 857, + 856, + 857 + ], + "score": 0.92, + "latex": "1 - O ( j _ { n } ^ { - 1 } )" + }, + { + "category_id": 13, + "poly": [ + 621, + 427, + 881, + 427, + 881, + 462, + 621, + 462 + ], + "score": 0.92, + "latex": "\\mathbb { I } ( z _ { 1 } > 0 ) \\neq \\mathbb { I } ( z _ { 2 } > 0 )" + }, + { + "category_id": 13, + "poly": [ + 703, + 787, + 910, + 787, + 910, + 821, + 703, + 821 + ], + "score": 0.92, + "latex": "k \\geq L ^ { * } { \\sqrt { q \\log j _ { n } } }" + }, + { + "category_id": 14, + "poly": [ + 581, + 1728, + 1060, + 1728, + 1060, + 1795, + 581, + 1795 + ], + "score": 0.92, + "latex": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } \\| { \\widehat { \\beta } } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - { \\widehat { \\beta } } _ { 0 } ( t ) + \\beta _ { 0 } ^ { * } \\| _ { 2 } ." + }, + { + "category_id": 13, + "poly": [ + 389, + 429, + 511, + 429, + 511, + 461, + 389, + 461 + ], + "score": 0.92, + "latex": "z _ { 1 } , z _ { 2 } \\in \\mathbb { R }" + }, + { + "category_id": 13, + "poly": [ + 1012, + 428, + 1194, + 428, + 1194, + 462, + 1012, + 462 + ], + "score": 0.92, + "latex": "| z _ { 1 } - z _ { 2 } | \\geq | z _ { 2 } |" + }, + { + "category_id": 13, + "poly": [ + 586, + 1536, + 637, + 1536, + 637, + 1570, + 586, + 1570 + ], + "score": 0.92, + "latex": "S ( t )" + }, + { + "category_id": 13, + "poly": [ + 980, + 787, + 1198, + 787, + 1198, + 821, + 980, + 821 + ], + "score": 0.91, + "latex": "k _ { 0 } = L ^ { * } { \\sqrt { q \\log j _ { n } } }" + }, + { + "category_id": 13, + "poly": [ + 383, + 597, + 464, + 597, + 464, + 629, + 383, + 629 + ], + "score": 0.91, + "latex": "k \\geq j _ { n }" + }, + { + "category_id": 13, + "poly": [ + 502, + 379, + 574, + 379, + 574, + 410, + 502, + 410 + ], + "score": 0.91, + "latex": "\\bar { L } > 0" + }, + { + "category_id": 14, + "poly": [ + 318, + 638, + 1328, + 638, + 1328, + 700, + 318, + 700 + ], + "score": 0.91, + "latex": "\\begin{array} { r } { \\operatorname* { P r } \\Big ( | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) | \\leq \\bar { L } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) \\Big ) \\leq \\bar { L } L _ { 0 } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) . } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 813, + 1808, + 1135, + 1808, + 1135, + 1849, + 813, + 1849 + ], + "score": 0.9, + "latex": "\\| \\widehat { \\beta } _ { 1 } ( t ) - \\beta _ { 1 } ^ { * } - \\widehat { \\beta } _ { 0 } ( t ) - \\beta _ { 0 } ^ { * } \\| _ { 2 }" + }, + { + "category_id": 14, + "poly": [ + 336, + 538, + 1305, + 538, + 1305, + 585, + 336, + 585 + ], + "score": 0.9, + "latex": "\\begin{array} { r } { | \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) | \\le | \\varphi ^ { \\top } ( X ) ( \\widehat \\beta _ { 1 , k } - \\widehat \\beta _ { 0 , k } - \\beta _ { 1 } + \\beta _ { 0 } ) | \\le \\bar { L } q k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 298, + 786, + 595, + 786, + 595, + 824, + 298, + 824 + ], + "score": 0.89, + "latex": "\\bar { L } q k ^ { - 1 / 2 } \\sqrt { \\log \\operatorname* { m a x } ( k , j _ { n } ) }" + }, + { + "category_id": 14, + "poly": [ + 334, + 321, + 1307, + 321, + 1307, + 366, + 334, + 366 + ], + "score": 0.89, + "latex": "\\begin{array} { r } { | \\varphi ^ { \\mathsf { T } } ( X ) ( \\widehat { \\beta } _ { 1 , k } - \\widehat { \\beta } _ { 0 , k } - \\beta _ { 1 } + \\beta _ { 0 } ) | \\leq \\bar { L } q k ^ { - 1 / 2 } \\log ^ { 1 / 2 } \\operatorname* { m a x } ( k , j _ { n } ) , \\forall k \\geq L ^ { * } \\sqrt { q \\log j _ { n } } , } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 815, + 753, + 1091, + 753, + 1091, + 786, + 815, + 786 + ], + "score": 0.89, + "latex": "\\pi _ { k } ( a , X ) ~ = ~ \\pi ^ { * } ( a , X )" + }, + { + "category_id": 13, + "poly": [ + 517, + 712, + 1276, + 712, + 1276, + 752, + 517, + 752 + ], + "score": 0.89, + "latex": "\\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\widehat { \\beta } _ { 1 , k } \\ - \\ \\widehat { \\beta } _ { 0 , k } ) \\ > \\ \\ 0 \\} = \\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } \\ - \\ \\beta _ { 0 } ) \\ > \\ \\ 0 \\}" + }, + { + "category_id": 13, + "poly": [ + 727, + 1538, + 764, + 1538, + 764, + 1568, + 727, + 1568 + ], + "score": 0.89, + "latex": "H _ { 0 }" + }, + { + "category_id": 13, + "poly": [ + 298, + 751, + 570, + 751, + 570, + 785, + 298, + 785 + ], + "score": 0.88, + "latex": "\\pi _ { k } ( a , X ) = \\pi ^ { * } ( a , X ) " + }, + { + "category_id": 13, + "poly": [ + 1132, + 751, + 1401, + 751, + 1401, + 786, + 1132, + 786 + ], + "score": 0.88, + "latex": "\\begin{array} { r l } { \\vert \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) \\vert } & { { } > } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 738, + 463, + 1400, + 463, + 1400, + 500, + 738, + 500 + ], + "score": 0.84, + "latex": "\\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\widehat { \\beta } _ { 1 , k } - \\widehat { \\beta } _ { 0 , k } ) > 0 \\} \\neq \\mathbb { I } \\{ \\varphi ^ { \\top } ( X ) ( \\beta _ { 1 } - \\beta _ { 0 } ) > 0 \\}" + }, + { + "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": [ + 293.0, + 1465.0, + 809.0, + 1465.0, + 809.0, + 1505.0, + 293.0, + 1505.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2084.0, + 872.0, + 2084.0, + 872.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 829.0, + 2084.0, + 872.0, + 2084.0, + 872.0, + 2125.0, + 829.0, + 2125.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 710.0, + 516.0, + 710.0, + 516.0, + 754.0, + 292.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1277.0, + 710.0, + 1406.0, + 710.0, + 1406.0, + 754.0, + 1277.0, + 754.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 749.0, + 297.0, + 749.0, + 297.0, + 789.0, + 294.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 571.0, + 749.0, + 814.0, + 749.0, + 814.0, + 789.0, + 571.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1092.0, + 749.0, + 1131.0, + 749.0, + 1131.0, + 789.0, + 1092.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1402.0, + 749.0, + 1405.0, + 749.0, + 1405.0, + 789.0, + 1402.0, + 789.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 596.0, + 780.0, + 702.0, + 780.0, + 702.0, + 827.0, + 596.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 911.0, + 780.0, + 979.0, + 780.0, + 979.0, + 827.0, + 911.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1199.0, + 780.0, + 1406.0, + 780.0, + 1406.0, + 827.0, + 1199.0, + 827.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 818.0, + 855.0, + 818.0, + 855.0, + 858.0, + 296.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 818.0, + 1047.0, + 818.0, + 1047.0, + 858.0, + 991.0, + 858.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 425.0, + 388.0, + 425.0, + 388.0, + 464.0, + 293.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 512.0, + 425.0, + 620.0, + 425.0, + 620.0, + 464.0, + 512.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 882.0, + 425.0, + 1011.0, + 425.0, + 1011.0, + 464.0, + 882.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1195.0, + 425.0, + 1404.0, + 425.0, + 1404.0, + 464.0, + 1195.0, + 464.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 459.0, + 737.0, + 459.0, + 737.0, + 504.0, + 291.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1401.0, + 459.0, + 1404.0, + 459.0, + 1404.0, + 504.0, + 1401.0, + 504.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 495.0, + 501.0, + 495.0, + 501.0, + 530.0, + 293.0, + 530.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1651.0, + 1404.0, + 1651.0, + 1404.0, + 1695.0, + 292.0, + 1695.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 1687.0, + 720.0, + 1687.0, + 720.0, + 1723.0, + 296.0, + 1723.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1529.0, + 585.0, + 1529.0, + 585.0, + 1576.0, + 293.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 638.0, + 1529.0, + 726.0, + 1529.0, + 726.0, + 1576.0, + 638.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 765.0, + 1529.0, + 1147.0, + 1529.0, + 1147.0, + 1576.0, + 765.0, + 1576.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1388.0, + 638.0, + 1388.0, + 638.0, + 1428.0, + 295.0, + 1428.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 1803.0, + 812.0, + 1803.0, + 812.0, + 1857.0, + 290.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1136.0, + 1803.0, + 1150.0, + 1803.0, + 1150.0, + 1857.0, + 1136.0, + 1857.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 593.0, + 382.0, + 593.0, + 382.0, + 633.0, + 295.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 465.0, + 593.0, + 889.0, + 593.0, + 889.0, + 633.0, + 465.0, + 633.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 274.0, + 619.0, + 274.0, + 619.0, + 314.0, + 295.0, + 314.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 225.0, + 566.0, + 225.0, + 566.0, + 272.0, + 294.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 703.0, + 225.0, + 714.0, + 225.0, + 714.0, + 272.0, + 703.0, + 272.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 291.0, + 371.0, + 501.0, + 371.0, + 501.0, + 422.0, + 291.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 575.0, + 371.0, + 853.0, + 371.0, + 853.0, + 422.0, + 575.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 990.0, + 371.0, + 1001.0, + 371.0, + 1001.0, + 422.0, + 990.0, + 422.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1860.0, + 425.0, + 1860.0, + 425.0, + 1894.0, + 295.0, + 1894.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 31, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 297, + 1058, + 1578, + 1058, + 1578, + 1821, + 297, + 1821 + ], + "score": 0.984, + "html": "
methodBATLIL
RandomAdaptiveRandomAdaptive
(n,K8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S10.000.105.0(1.1)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
17.2(1.9)3400(24)18.5(1.9)3409(23)0.0(0.0)3600(0)0.0(0.0)3600(0)
(200,5)0.150.200.250.3036.0(2.4)55.8(2.5)79.5(2.0)93.2(1.3)3184(32)35.5(2.4)3189(32)0.2(0.2)3599(0)0.0(0.0)3600(0)
2914(36)60.0(2.4)2908(36)0.5(0.4)3598(1)0.8(0.4)3595(3)
2545(35)81.5(1.9)2528(34)1.8(0.7)3590(4)2.8(0.8)3585(5)
2286(27)95.2(1.1)2280(26)7.2(1.3)3560(10)7.5(1.3)3549(11)
(20,50)0.000.100.150.200.250.305.2(1.1)17.2(1.9)3879(18)5.5(1.1)3882(18)0.0(0.0)3960(0)0.0(0.0)3960(0)
3716(29)24.0(2.1)3651(32)0.0(0.0)3960(0)0.0(0.0)3960(0)
39.5(2.4)61.8(2.4)84.0(1.8)95.8(1.0)3394(40)3021(44)41.2(2.5)61.0(2.4)3365(40)0.0(0.0)3960(0)0.2(0.2)3958(1)
3013(44)0.8(0.4)3949(6)0.2(0.2)3956(3)
2588(39)83.5(1.9)2579(39)4.8(1.1)3919(11)3.5(0.9)3936(8)
2281(28)95.5(1.0)2275(28)12.8(1.7)3847(18)14.5(1.8)3873(15)
S1(200,5)0.000.100.150.200.250.305.0(1.1)8.8(1.4)25.5(2.2)57.2(2.5)87.2(1.7)98.0(0.7)3537(14)6.2(1.2)3534(15)0.0(0.0)3600(0)0.0(0.0)3600(0)
3511(17)3346(26)8.8(1.4)3515(16)0.0(0.0)3600(0)0.0(0.0)3600(0)
26.0(2.2)3337(27)0.0(0.0)3600(0)0.0(0.0)3600(0)
3004(34)2569(32)2224(21)60.2(2.4)88.2(1.6)3000(34)2581(32)0.0(0.0)3600(0)0.0(0.0)3600(0)
(32)2.0(0.7)3594(4)1.5(0.6)3589(5)3574(8)
97.8(0.7)2254(24)10.2(1.5)3559(9)6.2(1.2)
(20,50)0.000.100.150.200.250.305.2(1.1)8.2(1.4)28.0(2.2)64.8(2.4)92.2(1.3)99.2(0.4)3879(18)3839(21)5.5(1.1)7.0(1.3)3882(18)3852(21)0.0(0.0)3960(0)0.0(0.0)3960(0)3960(0)
0.0(0.0)3960(0)0.0(0.0)
3599(34)27.8(2.2)3627(33)0.0(0.0)3960(0)0.2(0.2)3956(3)
3165(41)62.0(2.4)3168(41)1.0(0.5)3951(5)0.8(0.4)3955(4)3936(8)3868(15)
2608(35)2238(23)90.2(1.5)99.2(0.4)2597(36)2250(24)5.0(1.1)14.5(1.8)3926(10)3854(16)2.8(0.8)13.8(1.7)
" + }, + { + "category_id": 8, + "poly": [ + 643, + 469, + 1002, + 469, + 1002, + 526, + 643, + 526 + ], + "score": 0.944 + }, + { + "category_id": 8, + "poly": [ + 298, + 595, + 1509, + 595, + 1509, + 690, + 298, + 690 + ], + "score": 0.94 + }, + { + "category_id": 1, + "poly": [ + 295, + 387, + 1405, + 387, + 1405, + 455, + 295, + 455 + ], + "score": 0.93 + }, + { + "category_id": 1, + "poly": [ + 297, + 541, + 817, + 541, + 817, + 579, + 297, + 579 + ], + "score": 0.919 + }, + { + "category_id": 1, + "poly": [ + 297, + 228, + 889, + 228, + 889, + 264, + 297, + 264 + ], + "score": 0.917 + }, + { + "category_id": 1, + "poly": [ + 298, + 705, + 767, + 705, + 767, + 739, + 298, + 739 + ], + "score": 0.893 + }, + { + "category_id": 8, + "poly": [ + 302, + 279, + 1359, + 279, + 1359, + 374, + 302, + 374 + ], + "score": 0.881 + }, + { + "category_id": 2, + "poly": [ + 835, + 2087, + 865, + 2087, + 865, + 2113, + 835, + 2113 + ], + "score": 0.867 + }, + { + "category_id": 2, + "poly": [ + 296, + 73, + 855, + 73, + 855, + 107, + 296, + 107 + ], + "score": 0.801 + }, + { + "category_id": 0, + "poly": [ + 296, + 985, + 864, + 985, + 864, + 1021, + 296, + 1021 + ], + "score": 0.79 + }, + { + "category_id": 8, + "poly": [ + 1141, + 754, + 1530, + 754, + 1530, + 839, + 1141, + 839 + ], + "score": 0.78 + }, + { + "category_id": 8, + "poly": [ + 298, + 851, + 1537, + 851, + 1537, + 947, + 298, + 947 + ], + "score": 0.671 + }, + { + "category_id": 8, + "poly": [ + 297, + 759, + 1536, + 759, + 1536, + 947, + 297, + 947 + ], + "score": 0.457 + }, + { + "category_id": 7, + "poly": [ + 297, + 1840, + 1405, + 1840, + 1405, + 1935, + 297, + 1935 + ], + "score": 0.345 + }, + { + "category_id": 2, + "poly": [ + 297, + 73, + 855, + 73, + 855, + 106, + 297, + 106 + ], + "score": 0.19 + }, + { + "category_id": 6, + "poly": [ + 296, + 985, + 864, + 985, + 864, + 1021, + 296, + 1021 + ], + "score": 0.119 + }, + { + "category_id": 13, + "poly": [ + 372, + 542, + 448, + 542, + 448, + 579, + 372, + 579 + ], + "score": 0.93, + "latex": "\\textstyle \\sum _ { \\ell } { \\widehat { \\sigma } } _ { \\ell } ^ { 2 }" + }, + { + "category_id": 14, + "poly": [ + 642, + 467, + 1000, + 467, + 1000, + 527, + 642, + 527 + ], + "score": 0.92, + "latex": "N ^ { - 1 / 2 } ( t ) \\sqrt { 2 \\sigma _ { \\ell } ^ { 2 } \\log \\log \\{ N ( t ) \\} } ," + }, + { + "category_id": 14, + "poly": [ + 293, + 276, + 1358, + 276, + 1358, + 375, + 293, + 375 + ], + "score": 0.91, + "latex": "\\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } [ \\mathbb { I } ( A _ { i } = 1 ) \\Sigma _ { 1 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 1 } ^ { * } \\} - \\mathbb { I } ( A _ { i } = 0 ) \\Sigma _ { 0 } ^ { - 1 } \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\beta _ { 0 } ^ { * } \\} ] ." + }, + { + "category_id": 13, + "poly": [ + 535, + 1871, + 598, + 1871, + 598, + 1905, + 535, + 1905 + ], + "score": 0.91, + "latex": "\\alpha _ { 1 } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 380, + 1123, + 450, + 1123, + 450, + 1149, + 380, + 1149 + ], + "score": 0.9, + "latex": "( n , K )" + }, + { + "category_id": 14, + "poly": [ + 310, + 591, + 1428, + 591, + 1428, + 692, + 310, + 692 + ], + "score": 0.87, + "latex": "{ \\frac { 1 } { \\mathrm { V } ( t ) } } \\sum _ { i = 1 } ^ { N ( t ) } \\| \\mathbb { I } ( A _ { i } = 1 ) { \\widehat { \\Sigma } } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) { \\widehat { \\beta } } _ { 1 } ( t ) \\} - \\mathbb { I } ( A _ { i } = 0 ) { \\widehat { \\Sigma } } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) { \\widehat { \\beta } } _ { 0 } ( t ) \\} \\varphi ( X _ { i } ) \\| \\varphi ( X _ { i } ) \\| _ { L ^ { \\infty } ( L ^ { \\infty } ( H ) ) } ," + }, + { + "category_id": 14, + "poly": [ + 310, + 747, + 1428, + 747, + 1428, + 950, + 310, + 950 + ], + "score": 0.78, + "latex": "\\begin{array} { r l r } { \\displaystyle } & { } & { \\displaystyle \\operatorname* { s u p } _ { x \\in \\widetilde { \\mathbb { X } } } \\| \\varphi ( x ) \\| _ { 2 } \\frac { \\sqrt { 2 \\log \\log \\{ 1 \\} } } { \\sqrt { N ( t ) } } } \\\\ { \\displaystyle } & { } & { \\displaystyle \\sqrt { \\frac { 1 } { N ( t ) } \\sum _ { i = 1 } ^ { N ( t ) } \\| \\mathbb { I } ( A _ { i } = 1 ) \\widehat { \\Sigma } _ { 1 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\widehat { \\beta } _ { 1 } ( t ) \\} - \\mathbb { I } ( A _ { i } = 0 ) \\widehat { \\Sigma } _ { 0 } ^ { - 1 } ( t ) \\varphi ( X _ { i } ) \\{ Y _ { i } - \\varphi ^ { \\top } ( X _ { i } ) \\} } } \\end{array}" + }, + { + "category_id": 13, + "poly": [ + 709, + 391, + 724, + 391, + 724, + 416, + 709, + 416 + ], + "score": 0.71, + "latex": "\\ell" + }, + { + "category_id": 14, + "poly": [ + 1141, + 756, + 1527, + 756, + 1527, + 836, + 1141, + 836 + ], + "score": 0.56, + "latex": "\\operatorname* { s u p } _ { x \\in \\mathbb { X } } \\| \\varphi ( x ) \\| _ { 2 } \\frac { \\sqrt { 2 \\log \\log \\{ N ( t ) \\} } } { \\sqrt { N ( t ) } } \\times" + }, + { + "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": [ + 297.0, + 72.0, + 857.0, + 72.0, + 857.0, + 109.0, + 297.0, + 109.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 982.0, + 864.0, + 982.0, + 864.0, + 1025.0, + 296.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 292.0, + 1838.0, + 1403.0, + 1838.0, + 1403.0, + 1878.0, + 292.0, + 1878.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1872.0, + 534.0, + 1872.0, + 534.0, + 1906.0, + 295.0, + 1906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1872.0, + 1403.0, + 1872.0, + 1403.0, + 1906.0, + 599.0, + 1906.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1902.0, + 442.0, + 1902.0, + 442.0, + 1937.0, + 293.0, + 1937.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 297.0, + 72.0, + 855.0, + 72.0, + 855.0, + 108.0, + 297.0, + 108.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 982.0, + 864.0, + 982.0, + 864.0, + 1025.0, + 296.0, + 1025.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 386.0, + 708.0, + 386.0, + 708.0, + 426.0, + 293.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 725.0, + 386.0, + 1406.0, + 386.0, + 1406.0, + 426.0, + 725.0, + 426.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 290.0, + 417.0, + 336.0, + 417.0, + 336.0, + 460.0, + 290.0, + 460.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 535.0, + 371.0, + 535.0, + 371.0, + 585.0, + 293.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 449.0, + 535.0, + 818.0, + 535.0, + 818.0, + 585.0, + 449.0, + 585.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 294.0, + 225.0, + 890.0, + 225.0, + 890.0, + 269.0, + 294.0, + 269.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 296.0, + 699.0, + 767.0, + 699.0, + 767.0, + 744.0, + 296.0, + 744.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 32, + "width": 1700, + "height": 2200 + } + }, + { + "layout_dets": [ + { + "category_id": 5, + "poly": [ + 296, + 370, + 1593, + 370, + 1593, + 1125, + 296, + 1125 + ], + "score": 0.981, + "html": "
methodBATAVT
RandomAdaptiveRandomAdaptive
(n,K)8rej probsE[stop]rej probsE[stop]rej probsE[stop]rej probsE[stop]
S1(200,5)0.000.100.150.200.250.305.2(1.1)27.5(2.2)45.5(2.5)62.5(2.4)80.2(2.0)88.2(1.6)1763(8)6.2(1.2)1762(8)0.2(0.2)1800(0)51.2(2.5)1586(11)
1644(15)26.0(2.2)1647(14)6.8(1.3)1771(6)89.0(1.6)1344(9)
1511(17)1391(18)1263(17)1176(14)44.2(2.5)1527(17)19.0(2.0)1718(10)98.0(0.7)1250(6)
64.2(2.4)1383(18)42.8(2.5)1581(15)99.5(0.4)1196(6)
78.8(2.0)1266(17)72.8(2.2)1394(17)99.8(0.2)1145(5)1091(5)
88.8(1.6)1179(14)89.2(1.5)1216(14)100.0(0.0)
(20,50)0.000.100.150.200.250.305.8(1.2)27.5(2.2)45.5(2.5)67.0(2.4)83.8(1.8)92.0(1.4)1933(9)1771(18)1617(22)1446(22)1287(19)1182(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)
27.5(2.2)1771(18)8.0(1.4)1929(9)89.2(1.5)1276(13)
45.8(2.5)1630(21)25.2(2.2)1826(15)97.8(0.7)1166(7)
65.5(2.4)82.5(1.9)91.5(1.4)1459(22)53.8(2.5)1617(20)99.0(0.5)1105(6)
1288(19)79.0(2.0)1379(19)99.8(0.2)1061(4)1030(2)
1193(16)94.0(1.2)1187(15)100.0(0.0)
S2(200,5)0.000.100.150.200.250.305.2(1.1)18.2(1.9)29.0(2.3)40.5(2.5)50.5(2.5)62.5(2.4)1763(8)1692(12)6.2(1.2)16.8(1.9)1762(8)1699(12)0.2(0.2)1800(0)51.2(2.5)82.2(1.9)1586(11)1406(10)
3.0(0.9)1788(3)
1633(15)1559(17)1489(18)1407(18)25.2(2.2)1642(15)8.5(1.4)1762(7)91.8(1.4)1323(9)
42.0(2.5)49.8(2.5)62.5(2.4)1548(17)1492(18)1413(18)17.2(1.9)1724(10)97.8(0.7)1257(7)
33.0(2.4)53.5(2.5)1641(14)99.0(0.5)99.5(0.4)1218(6)1181(6)
62.5(2.4)1522(16)
(20,50)0.000.100.150.200.250.305.8(1.2)19.0(2.0)28.5(2.3)39.0(2.4)50.7(2.5)65.2(2.4)1933(9)1839(16)5.0(1.1)1936(9)0.2(0.2)1978(1)51.5(2.5)1621(17)1360(15)
19.0(2.0)1837(16)3.5(0.9)1961(5)81.0(2.0)
1763(19)1680(21)28.0(2.2)1771(18)11.5(1.6)1911(10)90.8(1.4)1256(12)1171(8)1124(6)1092(5)
1680(21)41.8(2.5)1685(20)24.0(2.1)1830(15)97.5(0.8)
1592(22)1479(22)52.5(2.5)1568(22)44.2(2.5)1688(19)1539(20)99.0(0.5)99.2(0.4)
63.7(2.4)1481(22)63.5(2.4)
" + }, + { + "category_id": 3, + "poly": [ + 578, + 1550, + 1121, + 1550, + 1121, + 1816, + 578, + 1816 + ], + "score": 0.967 + }, + { + "category_id": 4, + "poly": [ + 514, + 1851, + 1183, + 1851, + 1183, + 1886, + 514, + 1886 + ], + "score": 0.916 + }, + { + "category_id": 2, + "poly": [ + 835, + 2088, + 865, + 2088, + 865, + 2113, + 835, + 2113 + ], + "score": 0.857 + }, + { + "category_id": 6, + "poly": [ + 297, + 1147, + 1407, + 1147, + 1407, + 1241, + 297, + 1241 + ], + "score": 0.79 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.487 + }, + { + "category_id": 2, + "poly": [ + 297, + 75, + 855, + 75, + 855, + 105, + 297, + 105 + ], + "score": 0.477 + }, + { + "category_id": 1, + "poly": [ + 297, + 1147, + 1407, + 1147, + 1407, + 1241, + 297, + 1241 + ], + "score": 0.141 + }, + { + "category_id": 13, + "poly": [ + 380, + 428, + 450, + 428, + 450, + 455, + 380, + 455 + ], + "score": 0.91, + "latex": "( n , K )" + }, + { + "category_id": 13, + "poly": [ + 535, + 1178, + 598, + 1178, + 598, + 1212, + 535, + 1212 + ], + "score": 0.91, + "latex": "\\alpha _ { 1 } ( \\cdot )" + }, + { + "category_id": 13, + "poly": [ + 985, + 1852, + 1174, + 1852, + 1174, + 1885, + 985, + 1885 + ], + "score": 0.9, + "latex": "\\theta = 0 . 5 , \\gamma = 1 . 0" + }, + { + "category_id": 13, + "poly": [ + 518, + 429, + 531, + 429, + 531, + 449, + 518, + 449 + ], + "score": 0.39, + "latex": "\\delta" + }, + { + "category_id": 15, + "poly": [ + 684.0, + 1549.0, + 747.0, + 1549.0, + 747.0, + 1608.0, + 684.0, + 1608.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1552.0, + 646.0, + 1552.0, + 646.0, + 1578.0, + 600.0, + 1578.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 708.0, + 1574.0, + 731.0, + 1574.0, + 731.0, + 1581.0, + 708.0, + 1581.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 690.0, + 1587.0, + 740.0, + 1587.0, + 740.0, + 1617.0, + 690.0, + 1617.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 598.0, + 1592.0, + 648.0, + 1592.0, + 648.0, + 1621.0, + 598.0, + 1621.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 689.0, + 1603.0, + 742.0, + 1603.0, + 742.0, + 1636.0, + 689.0, + 1636.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1634.0, + 647.0, + 1634.0, + 647.0, + 1660.0, + 600.0, + 1660.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 573.0, + 1643.0, + 606.0, + 1643.0, + 606.0, + 1692.0, + 573.0, + 1692.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1675.0, + 646.0, + 1675.0, + 646.0, + 1701.0, + 600.0, + 1701.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 600.0, + 1715.0, + 645.0, + 1715.0, + 645.0, + 1741.0, + 600.0, + 1741.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1756.0, + 646.0, + 1756.0, + 646.0, + 1782.0, + 599.0, + 1782.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 646.0, + 1777.0, + 685.0, + 1777.0, + 685.0, + 1803.0, + 646.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 733.0, + 1778.0, + 770.0, + 1778.0, + 770.0, + 1804.0, + 733.0, + 1804.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 818.0, + 1777.0, + 857.0, + 1777.0, + 857.0, + 1803.0, + 818.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 905.0, + 1777.0, + 942.0, + 1777.0, + 942.0, + 1803.0, + 905.0, + 1803.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 991.0, + 1779.0, + 1027.0, + 1779.0, + 1027.0, + 1802.0, + 991.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1078.0, + 1779.0, + 1113.0, + 1779.0, + 1113.0, + 1802.0, + 1078.0, + 1802.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 863.0, + 1789.0, + 902.0, + 1789.0, + 902.0, + 1820.0, + 863.0, + 1820.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 513.0, + 1848.0, + 984.0, + 1848.0, + 984.0, + 1891.0, + 513.0, + 1891.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 1175.0, + 1848.0, + 1185.0, + 1848.0, + 1185.0, + 1891.0, + 1175.0, + 1891.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": [ + 294.0, + 1145.0, + 1405.0, + 1145.0, + 1405.0, + 1183.0, + 294.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1179.0, + 534.0, + 1179.0, + 534.0, + 1213.0, + 295.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1179.0, + 1404.0, + 1179.0, + 1404.0, + 1213.0, + 599.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1209.0, + 442.0, + 1209.0, + 442.0, + 1241.0, + 293.0, + 1241.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": [ + 294.0, + 1145.0, + 1405.0, + 1145.0, + 1405.0, + 1183.0, + 294.0, + 1183.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 295.0, + 1179.0, + 534.0, + 1179.0, + 534.0, + 1213.0, + 295.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 599.0, + 1179.0, + 1404.0, + 1179.0, + 1404.0, + 1213.0, + 599.0, + 1213.0 + ], + "score": 1.0, + "text": "" + }, + { + "category_id": 15, + "poly": [ + 293.0, + 1209.0, + 442.0, + 1209.0, + 442.0, + 1241.0, + 293.0, + 1241.0 + ], + "score": 1.0, + "text": "" + } + ], + "page_info": { + "page_no": 33, + "width": 1700, + "height": 2200 + } + } +] \ No newline at end of file diff --git a/parse/train/zmbiQmdtg9/zmbiQmdtg9_layout.pdf b/parse/train/zmbiQmdtg9/zmbiQmdtg9_layout.pdf new file mode 100644 index 0000000000000000000000000000000000000000..ae8383a29080cccacc900d4e6759d63b4def725e --- /dev/null +++ b/parse/train/zmbiQmdtg9/zmbiQmdtg9_layout.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:df61a41caa154c63ef1071aaf1be1bacc8c73a4a06ae89321f0ee1b1872a37f1 +size 2069998 diff --git a/parse/train/zmbiQmdtg9/zmbiQmdtg9_origin.pdf b/parse/train/zmbiQmdtg9/zmbiQmdtg9_origin.pdf new file mode 100644 index 0000000000000000000000000000000000000000..61a870363e5de5aff61c59098523439beb3f337e --- /dev/null +++ b/parse/train/zmbiQmdtg9/zmbiQmdtg9_origin.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:0b3866db3c69f4d1f7f442c4c529f8a2c4961114140df1c057ea174d628a8b50 +size 1930701 diff --git a/parse/train/zmbiQmdtg9/zmbiQmdtg9_span.pdf b/parse/train/zmbiQmdtg9/zmbiQmdtg9_span.pdf new file mode 100644 index 0000000000000000000000000000000000000000..47060054943b3114f736eb9a1e77d49f75b512c8 --- /dev/null +++ b/parse/train/zmbiQmdtg9/zmbiQmdtg9_span.pdf @@ -0,0 +1,3 @@ +version https://git-lfs.github.com/spec/v1 +oid sha256:35cff6f8cde2cb9bfb98826bd6d7278eaeaf1d38de3db80f290b0e6c503a8937 +size 2081607